{"text":"\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2009, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Willow Garage, Inc. nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n********************************************************************\/\n\n\/\/ Bring in my package's API, which is what I'm testing\n#include \"ros\/ros.h\"\n#include \"topic_tools\/shape_shifter.h\"\n#include \"std_msgs\/String.h\"\n#include \"std_msgs\/Int32.h\"\n\n\/\/ Bring in gtest\n#include \n\nclass ShapeShifterSubscriber : public testing::Test\n{\n public:\n\n bool success;\n\n void messageCallbackInt(const topic_tools::ShapeShifter::ConstPtr& msg)\n {\n try {\n std_msgs::Int32::Ptr s = msg->instantiate();\n } catch (topic_tools::ShapeShifterException& e)\n {\n success = true;\n }\n }\n\n void messageCallbackString(const topic_tools::ShapeShifter::ConstPtr& msg)\n {\n try {\n std_msgs::String::Ptr s = msg->instantiate();\n if (s->data == \"chatter\")\n success = true;\n } catch (topic_tools::ShapeShifterException& e)\n {\n\n }\n }\n \nprotected:\n ShapeShifterSubscriber() {}\n\n void SetUp()\n {\n success = false;\n }\n\n void TearDown() {}\n};\n\n\nTEST_F(ShapeShifterSubscriber, testInstantiateString)\n{\n ros::NodeHandle nh;\n ros::Subscriber sub = nh.subscribe(\"input\",1,&ShapeShifterSubscriber::messageCallbackString, (ShapeShifterSubscriber*)this);\n\n ros::Time t1(ros::Time::now()+ros::Duration(10.0));\n\n while(ros::Time::now() < t1 && !success)\n {\n ros::WallDuration(0.01).sleep();\n ros::spinOnce();\n }\n\n if(success)\n SUCCEED();\n else\n FAIL();\n}\n\nTEST_F(ShapeShifterSubscriber, testInstantiateInt)\n{\n ros::NodeHandle nh;\n ros::Subscriber sub = nh.subscribe(\"input\",1,&ShapeShifterSubscriber::messageCallbackInt, (ShapeShifterSubscriber*)this);\n\n ros::Time t1(ros::Time::now()+ros::Duration(10.0));\n\n while(ros::Time::now() < t1 && !success)\n {\n ros::WallDuration(0.01).sleep();\n ros::spinOnce();\n }\n\n if(success)\n SUCCEED();\n else\n FAIL();\n}\n\nint main(int argc, char **argv){\n ros::init(argc, argv, \"test_shapeshifter\");\n\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\nAdding loopback test for shapeshifter\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2009, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Willow Garage, Inc. nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n********************************************************************\/\n\n\/\/ Bring in my package's API, which is what I'm testing\n#include \"ros\/ros.h\"\n#include \"topic_tools\/shape_shifter.h\"\n#include \"std_msgs\/String.h\"\n#include \"std_msgs\/Int32.h\"\n\n\/\/ Bring in gtest\n#include \n\nclass ShapeShifterSubscriber : public testing::Test\n{\n public:\n\n bool success;\n\n void messageCallbackInt(const topic_tools::ShapeShifter::ConstPtr& msg)\n {\n try {\n std_msgs::Int32::Ptr s = msg->instantiate();\n } catch (topic_tools::ShapeShifterException& e)\n {\n success = true;\n }\n }\n\n void messageCallbackString(const topic_tools::ShapeShifter::ConstPtr& msg)\n {\n try {\n std_msgs::String::Ptr s = msg->instantiate();\n if (s->data == \"chatter\")\n success = true;\n } catch (topic_tools::ShapeShifterException& e)\n {\n\n }\n }\n\n void messageCallbackLoopback(const topic_tools::ShapeShifter::ConstPtr& msg)\n {\n try {\n std_msgs::String::Ptr s = msg->instantiate();\n printf(\"Got data: %s\", s->data.c_str());\n if (s->data == \"abc123\")\n success = true;\n } catch (topic_tools::ShapeShifterException& e)\n {\n printf(\"Instantiate failed!\\n\");\n }\n }\n \nprotected:\n ShapeShifterSubscriber() {}\n\n void SetUp()\n {\n success = false;\n }\n\n void TearDown() {}\n};\n\n\nTEST_F(ShapeShifterSubscriber, testInstantiateString)\n{\n ros::NodeHandle nh;\n ros::Subscriber sub = nh.subscribe(\"input\",1,&ShapeShifterSubscriber::messageCallbackString, (ShapeShifterSubscriber*)this);\n\n ros::Time t1(ros::Time::now()+ros::Duration(10.0));\n\n while(ros::Time::now() < t1 && !success)\n {\n ros::WallDuration(0.01).sleep();\n ros::spinOnce();\n }\n\n if(success)\n SUCCEED();\n else\n FAIL();\n}\n\nTEST_F(ShapeShifterSubscriber, testInstantiateInt)\n{\n ros::NodeHandle nh;\n ros::Subscriber sub = nh.subscribe(\"input\",1,&ShapeShifterSubscriber::messageCallbackInt, (ShapeShifterSubscriber*)this);\n\n ros::Time t1(ros::Time::now()+ros::Duration(10.0));\n\n while(ros::Time::now() < t1 && !success)\n {\n ros::WallDuration(0.01).sleep();\n ros::spinOnce();\n }\n\n if(success)\n SUCCEED();\n else\n FAIL();\n}\n\nTEST_F(ShapeShifterSubscriber, testLoopback)\n{\n ros::NodeHandle nh;\n ros::Subscriber sub = nh.subscribe(\"loopback\",1,&ShapeShifterSubscriber::messageCallbackLoopback, (ShapeShifterSubscriber*)this);\n\n ros::Time t1(ros::Time::now()+ros::Duration(10.0));\n\n ros::Publisher pub = nh.advertise(\"loopback\", 1);\n std_msgs::String s;\n s.data = \"abc123\";\n pub.publish(s);\n\n while(ros::Time::now() < t1 && !success)\n {\n ros::WallDuration(0.01).sleep();\n ros::spinOnce();\n }\n\n if(success)\n SUCCEED();\n else\n FAIL();\n}\n\nint main(int argc, char **argv){\n ros::init(argc, argv, \"test_shapeshifter\");\n\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"\/\/ The MIT License (MIT) \r\n\r\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\r\n\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\r\n\/\/ the Software without restriction, including without limitation the rights to\r\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\r\n\/\/ subject to the following conditions:\r\n\r\n\/\/ The above copyright notice and this permission notice shall be included in all\r\n\/\/ copies or substantial portions of the Software.\r\n\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef SOL_FUNCTION_TYPES_HPP\r\n#define SOL_FUNCTION_TYPES_HPP\r\n\r\n#include \"function_types_core.hpp\"\r\n#include \"function_types_templated.hpp\"\r\n#include \"function_types_basic.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"function_types_member.hpp\"\r\n#include \"function_types_usertype.hpp\"\r\n#include \"function_types_overload.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"resolve.hpp\"\r\n\r\nnamespace sol {\r\n\r\ntemplate \r\nstruct function_arguments {\r\n std::tuple params;\r\n template \r\n function_arguments(Args&&... args) : params(std::forward(args)...) {}\r\n};\r\n\r\ntemplate , typename... Args>\r\nfunction_arguments function_args( Args&&... args ) { \r\n return function_arguments(std::forward(args)...);\r\n}\r\n\r\nnamespace stack {\r\ntemplate\r\nstruct pusher> {\r\n template \r\n static void select_convertible(std::false_type, types, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique>(std::forward(fx), std::forward(args)...);\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_convertible(std::true_type, types, lua_State* L, Fx&& fx, Args&&... args) {\r\n using fx_ptr_t = R(*)(A...);\r\n fx_ptr_t fxptr = detail::unwrap(std::forward(fx));\r\n select_function(std::true_type(), L, fxptr, std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_convertible(types t, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::decay_t>> raw_fx_t;\r\n typedef R(* fx_ptr_t)(A...);\r\n typedef std::is_convertible is_convertible;\r\n select_convertible(is_convertible(), t, L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_convertible(types<>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef meta::function_signature_t>> Sig;\r\n select_convertible(types(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_reference_member_variable(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique, clean_fx>>(std::forward(fx), std::forward(obj), std::forward(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_reference_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t dFx;\r\n dFx memfxptr(std::forward(fx));\r\n auto userptr = detail::ptr(std::forward(obj));\r\n lua_CFunction freefunc = &function_detail::upvalue_member_variable, meta::Unqualified>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_member_variable(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_convertible(types(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference;\r\n select_reference_member_variable(is_reference(), L, std::forward(fx), std::forward(obj), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_variable::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_reference_member_function(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique>, clean_fx>>(std::forward(fx), std::forward(obj), std::forward(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_reference_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t dFx;\r\n dFx memfxptr(std::forward(fx));\r\n auto userptr = detail::ptr(std::forward(obj));\r\n lua_CFunction freefunc = &function_detail::upvalue_member_function, meta::Unqualified>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_member_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_variable(std::is_member_object_pointer>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference;\r\n select_reference_member_function(is_reference(), L, std::forward(fx), std::forward(obj), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_function::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_function(std::is_member_function_pointer>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_function(std::true_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n std::decay_t target(std::forward(fx), std::forward(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_free_function::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, target);\r\n stack::push(L, freefunc, upvalues);\r\n }\r\n\r\n static void select_function(std::true_type, lua_State* L, lua_CFunction f) {\r\n stack::push(L, f);\r\n }\r\n\r\n template \r\n static void select(lua_State* L, Fx&& fx, Args&&... args) {\r\n select_function(std::is_function>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n static void set_fx(lua_State* L, std::unique_ptr luafunc) {\r\n function_detail::base_function* target = luafunc.release();\r\n void* targetdata = static_cast(target);\r\n lua_CFunction freefunc = function_detail::call;\r\n\r\n stack::push(L, userdata_value(targetdata));\r\n function_detail::free_function_cleanup(L);\r\n lua_setmetatable(L, -2);\r\n stack::push(L, freefunc, 1);\r\n }\r\n\r\n template\r\n static int push(lua_State* L, Args&&... args) {\r\n \/\/ Set will always place one thing (function) on the stack\r\n select(L, std::forward(args)...);\r\n return 1;\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n template \r\n static int push_func(std::index_sequence, lua_State* L, FP&& fp) {\r\n return stack::push(L, detail::forward_get(fp.params)...);\r\n }\r\n\r\n template \r\n static int push(lua_State* L, FP&& fp) {\r\n return push_func(std::index_sequence_for(), L, std::forward(fp));\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n static int push(lua_State* L, std::function fx) {\r\n return pusher>{}.push(L, std::move(fx));\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n static int push(lua_State* L, overload_set&& set) {\r\n pusher>{}.set_fx(L, std::make_unique>(std::move(set.set)));\r\n return 1;\r\n }\r\n\r\n static int push(lua_State* L, const overload_set& set) {\r\n pusher>{}.set_fx(L, std::make_unique>(set.set));\r\n return 1;\r\n }\r\n};\r\n\r\n} \/\/ stack\r\n} \/\/ sol\r\n\r\n#endif \/\/ SOL_FUNCTION_TYPES_HPP\r\nMore unused parameters. .-.\/\/ The MIT License (MIT) \r\n\r\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\r\n\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\r\n\/\/ the Software without restriction, including without limitation the rights to\r\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\r\n\/\/ subject to the following conditions:\r\n\r\n\/\/ The above copyright notice and this permission notice shall be included in all\r\n\/\/ copies or substantial portions of the Software.\r\n\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef SOL_FUNCTION_TYPES_HPP\r\n#define SOL_FUNCTION_TYPES_HPP\r\n\r\n#include \"function_types_core.hpp\"\r\n#include \"function_types_templated.hpp\"\r\n#include \"function_types_basic.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"function_types_member.hpp\"\r\n#include \"function_types_usertype.hpp\"\r\n#include \"function_types_overload.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"resolve.hpp\"\r\n\r\nnamespace sol {\r\n\r\ntemplate \r\nstruct function_arguments {\r\n std::tuple params;\r\n template \r\n function_arguments(Args&&... args) : params(std::forward(args)...) {}\r\n};\r\n\r\ntemplate , typename... Args>\r\nfunction_arguments function_args( Args&&... args ) { \r\n return function_arguments(std::forward(args)...);\r\n}\r\n\r\nnamespace stack {\r\ntemplate\r\nstruct pusher> {\r\n template \r\n static void select_convertible(std::false_type, types, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique>(std::forward(fx), std::forward(args)...);\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_convertible(std::true_type, types, lua_State* L, Fx&& fx, Args&&... args) {\r\n using fx_ptr_t = R(*)(A...);\r\n fx_ptr_t fxptr = detail::unwrap(std::forward(fx));\r\n select_function(std::true_type(), L, fxptr, std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_convertible(types t, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::decay_t>> raw_fx_t;\r\n typedef R(* fx_ptr_t)(A...);\r\n typedef std::is_convertible is_convertible;\r\n select_convertible(is_convertible(), t, L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_convertible(types<>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef meta::function_signature_t>> Sig;\r\n select_convertible(types(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_reference_member_variable(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique, clean_fx>>(std::forward(fx), std::forward(obj), std::forward(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_reference_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t dFx;\r\n dFx memfxptr(std::forward(fx));\r\n auto userptr = detail::ptr(std::forward(obj), std::forward(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_member_variable, meta::Unqualified>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_member_variable(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_convertible(types(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference;\r\n select_reference_member_variable(is_reference(), L, std::forward(fx), std::forward(obj), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_variable::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_reference_member_function(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t> clean_fx;\r\n std::unique_ptr sptr = std::make_unique>, clean_fx>>(std::forward(fx), std::forward(obj), std::forward(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template \r\n static void select_reference_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t dFx;\r\n dFx memfxptr(std::forward(fx));\r\n auto userptr = detail::ptr(std::forward(obj));\r\n lua_CFunction freefunc = &function_detail::upvalue_member_function, meta::Unqualified>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_member_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_variable(std::is_member_object_pointer>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool, std::reference_wrapper>::value || std::is_pointer::value> is_reference;\r\n select_reference_member_function(is_reference(), L, std::forward(fx), std::forward(obj), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_function::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template \r\n static void select_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_function(std::is_member_function_pointer>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n template \r\n static void select_function(std::true_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n std::decay_t target(std::forward(fx), std::forward(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_free_function::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, target);\r\n stack::push(L, freefunc, upvalues);\r\n }\r\n\r\n static void select_function(std::true_type, lua_State* L, lua_CFunction f) {\r\n stack::push(L, f);\r\n }\r\n\r\n template \r\n static void select(lua_State* L, Fx&& fx, Args&&... args) {\r\n select_function(std::is_function>(), L, std::forward(fx), std::forward(args)...);\r\n }\r\n\r\n static void set_fx(lua_State* L, std::unique_ptr luafunc) {\r\n function_detail::base_function* target = luafunc.release();\r\n void* targetdata = static_cast(target);\r\n lua_CFunction freefunc = function_detail::call;\r\n\r\n stack::push(L, userdata_value(targetdata));\r\n function_detail::free_function_cleanup(L);\r\n lua_setmetatable(L, -2);\r\n stack::push(L, freefunc, 1);\r\n }\r\n\r\n template\r\n static int push(lua_State* L, Args&&... args) {\r\n \/\/ Set will always place one thing (function) on the stack\r\n select(L, std::forward(args)...);\r\n return 1;\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n template \r\n static int push_func(std::index_sequence, lua_State* L, FP&& fp) {\r\n return stack::push(L, detail::forward_get(fp.params)...);\r\n }\r\n\r\n template \r\n static int push(lua_State* L, FP&& fp) {\r\n return push_func(std::index_sequence_for(), L, std::forward(fp));\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n static int push(lua_State* L, std::function fx) {\r\n return pusher>{}.push(L, std::move(fx));\r\n }\r\n};\r\n\r\ntemplate\r\nstruct pusher> {\r\n static int push(lua_State* L, overload_set&& set) {\r\n pusher>{}.set_fx(L, std::make_unique>(std::move(set.set)));\r\n return 1;\r\n }\r\n\r\n static int push(lua_State* L, const overload_set& set) {\r\n pusher>{}.set_fx(L, std::make_unique>(set.set));\r\n return 1;\r\n }\r\n};\r\n\r\n} \/\/ stack\r\n} \/\/ sol\r\n\r\n#endif \/\/ SOL_FUNCTION_TYPES_HPP\r\n<|endoftext|>"} {"text":"\/*\n * Copyright 2015 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include \"FiberManagerMap.h\"\n\n#include \n#include \n#include \n\n#include \n\nnamespace folly { namespace fibers {\n\nnamespace {\n\n\/\/ Leak these intentionally. During shutdown, we may call getFiberManager, and\n\/\/ want access to the fiber managers during that time.\nclass LocalFiberManagerMapTag;\ntypedef folly::ThreadLocal<\n std::unordered_map,\n LocalFiberManagerMapTag>\n LocalMapType;\nLocalMapType* localFiberManagerMap() {\n static auto ret = new LocalMapType();\n return ret;\n}\n\ntypedef\n std::unordered_map>\n MapType;\nMapType* fiberManagerMap() {\n static auto ret = new MapType();\n return ret;\n}\n\nstd::mutex* fiberManagerMapMutex() {\n static auto ret = new std::mutex();\n return ret;\n}\n\n\nclass OnEventBaseDestructionCallback : public folly::EventBase::LoopCallback {\n public:\n explicit OnEventBaseDestructionCallback(folly::EventBase& evb)\n : evb_(&evb) {}\n void runLoopCallback() noexcept override {\n for (auto& localMap : localFiberManagerMap()->accessAllThreads()) {\n localMap.erase(evb_);\n }\n std::unique_ptr fm;\n {\n std::lock_guard lg(*fiberManagerMapMutex());\n auto it = fiberManagerMap()->find(evb_);\n assert(it != fiberManagerMap()->end());\n fm = std::move(it->second);\n fiberManagerMap()->erase(it);\n }\n assert(fm.get() != nullptr);\n fm->loopUntilNoReady();\n delete this;\n }\n private:\n folly::EventBase* evb_;\n};\n\nFiberManager* getFiberManagerThreadSafe(folly::EventBase& evb,\n const FiberManager::Options& opts) {\n std::lock_guard lg(*fiberManagerMapMutex());\n\n auto it = fiberManagerMap()->find(&evb);\n if (LIKELY(it != fiberManagerMap()->end())) {\n return it->second.get();\n }\n\n auto loopController = folly::make_unique();\n loopController->attachEventBase(evb);\n auto fiberManager =\n folly::make_unique(std::move(loopController), opts);\n auto result = fiberManagerMap()->emplace(&evb, std::move(fiberManager));\n evb.runOnDestruction(new OnEventBaseDestructionCallback(evb));\n return result.first->second.get();\n}\n\n} \/\/ namespace\n\nFiberManager& getFiberManager(folly::EventBase& evb,\n const FiberManager::Options& opts) {\n auto it = (*localFiberManagerMap())->find(&evb);\n if (LIKELY(it != (*localFiberManagerMap())->end())) {\n return *(it->second);\n }\n\n auto fm = getFiberManagerThreadSafe(evb, opts);\n (*localFiberManagerMap())->emplace(&evb, fm);\n return *fm;\n}\n\n}}\nFix EventBase destruction race in FiberManagerMap\/*\n * Copyright 2015 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include \"FiberManagerMap.h\"\n\n#include \n#include \n\n#include \n#include \n#include \n\nnamespace folly { namespace fibers {\n\nnamespace {\n\nclass EventBaseOnDestructionCallback : public EventBase::LoopCallback {\n public:\n explicit EventBaseOnDestructionCallback(EventBase& evb) : evb_(evb) {}\n void runLoopCallback() noexcept override;\n\n private:\n EventBase& evb_;\n};\n\nclass GlobalCache {\n public:\n static FiberManager& get(EventBase& evb, const FiberManager::Options& opts) {\n return instance().getImpl(evb, opts);\n }\n\n static std::unique_ptr erase(EventBase& evb) {\n return instance().eraseImpl(evb);\n }\n\n private:\n GlobalCache() {}\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static GlobalCache& instance() {\n static auto ret = new GlobalCache();\n return *ret;\n }\n\n FiberManager& getImpl(EventBase& evb, const FiberManager::Options& opts) {\n std::lock_guard lg(mutex_);\n\n auto& fmPtrRef = map_[&evb];\n\n if (!fmPtrRef) {\n auto loopController = make_unique();\n loopController->attachEventBase(evb);\n evb.runOnDestruction(new EventBaseOnDestructionCallback(evb));\n\n fmPtrRef = make_unique(std::move(loopController), opts);\n }\n\n return *fmPtrRef;\n }\n\n std::unique_ptr eraseImpl(EventBase& evb) {\n std::lock_guard lg(mutex_);\n\n DCHECK_EQ(1, map_.count(&evb));\n\n auto ret = std::move(map_[&evb]);\n map_.erase(&evb);\n return ret;\n }\n\n std::mutex mutex_;\n std::unordered_map> map_;\n};\n\nconstexpr size_t kEraseListMaxSize = 64;\n\nclass ThreadLocalCache {\n public:\n static FiberManager& get(EventBase& evb, const FiberManager::Options& opts) {\n return instance()->getImpl(evb, opts);\n }\n\n static void erase(EventBase& evb) {\n for (auto& localInstance : instance().accessAllThreads()) {\n SYNCHRONIZED(info, localInstance.eraseInfo_) {\n if (info.eraseList.size() >= kEraseListMaxSize) {\n info.eraseAll = true;\n } else {\n info.eraseList.push_back(&evb);\n }\n localInstance.eraseRequested_ = true;\n }\n }\n }\n\n private:\n ThreadLocalCache() {}\n\n struct ThreadLocalCacheTag {};\n using ThreadThreadLocalCache = ThreadLocal;\n\n \/\/ Leak this intentionally. During shutdown, we may call getFiberManager,\n \/\/ and want access to the fiber managers during that time.\n static ThreadThreadLocalCache& instance() {\n static auto ret = new ThreadThreadLocalCache([]() { return new ThreadLocalCache(); });\n return *ret;\n }\n\n FiberManager& getImpl(EventBase& evb, const FiberManager::Options& opts) {\n eraseImpl();\n\n auto& fmPtrRef = map_[&evb];\n if (!fmPtrRef) {\n fmPtrRef = &GlobalCache::get(evb, opts);\n }\n\n DCHECK(fmPtrRef != nullptr);\n\n return *fmPtrRef;\n }\n\n void eraseImpl() {\n if (!eraseRequested_.load()) {\n return;\n }\n\n SYNCHRONIZED(info, eraseInfo_) {\n if (info.eraseAll) {\n map_.clear();\n } else {\n for (auto evbPtr : info.eraseList) {\n map_.erase(evbPtr);\n }\n }\n\n info.eraseList.clear();\n info.eraseAll = false;\n eraseRequested_ = false;\n }\n }\n\n std::unordered_map map_;\n std::atomic eraseRequested_{false};\n\n struct EraseInfo {\n bool eraseAll{false};\n std::vector eraseList;\n };\n\n folly::Synchronized eraseInfo_;\n};\n\nvoid EventBaseOnDestructionCallback::runLoopCallback() noexcept {\n auto fm = GlobalCache::erase(evb_);\n DCHECK(fm.get() != nullptr);\n ThreadLocalCache::erase(evb_);\n\n fm->loopUntilNoReady();\n\n delete this;\n}\n\n} \/\/ namespace\n\nFiberManager& getFiberManager(EventBase& evb,\n const FiberManager::Options& opts) {\n return ThreadLocalCache::get(evb, opts);\n}\n\n}}\n<|endoftext|>"} {"text":"#include \"FiltersWindow.hpp\"\n\n#include \n#include \n\nusing namespace GUI;\n\nvoid FiltersWindow::Show() {\n \/\/ Configure filters.\n if (ImGui::Begin(\"Filters\", &visible, ImGuiWindowFlags_ShowBorders)) {\n \/\/ Color\n if (ImGui::CollapsingHeader(\"Color\")) {\n ImGui::Checkbox(\"Enable##Color\", &Hymn().filterSettings.color);\n \n if (Hymn().filterSettings.color) {\n ImGui::ColorEdit3(\"Color##Color\", &Hymn().filterSettings.colorColor[0]);\n }\n }\n \n \/\/ Fog\n if (ImGui::CollapsingHeader(\"Fog\")) {\n ImGui::Checkbox(\"Enable##Fog\", &Hymn().filterSettings.fog);\n \n if (Hymn().filterSettings.fog) {\n ImGui::InputFloat(\"Density\", &Hymn().filterSettings.fogDensity);\n ImGui::ColorEdit3(\"Color##Fog\", &Hymn().filterSettings.fogColor[0]);\n }\n }\n \n \/\/ FXAA\n if (ImGui::CollapsingHeader(\"FXAA\")) {\n ImGui::Checkbox(\"Enable##FXAA\", &Hymn().filterSettings.fxaa);\n }\n \n \/\/ Glow\n if (ImGui::CollapsingHeader(\"Glow\")) {\n ImGui::Checkbox(\"Enable##Glow\", &Hymn().filterSettings.glow);\n \n if (Hymn().filterSettings.glow) {\n ImGui::InputInt(\"Blur amount\", &Hymn().filterSettings.glowBlurAmount);\n }\n }\n }\n ImGui::End();\n}\n\nbool FiltersWindow::IsVisible() const {\n return visible;\n}\n\nvoid FiltersWindow::SetVisible(bool visible) {\n this->visible = visible;\n}\nTexts explaining the different filters#include \"FiltersWindow.hpp\"\n\n#include \n#include \n\nusing namespace GUI;\n\nvoid FiltersWindow::Show() {\n \/\/ Configure filters.\n if (ImGui::Begin(\"Filters\", &visible, ImGuiWindowFlags_ShowBorders)) {\n \/\/ Color\n if (ImGui::CollapsingHeader(\"Color\")) {\n ImGui::TextWrapped(\"Color blending filter.\");\n \n ImGui::Checkbox(\"Enable##Color\", &Hymn().filterSettings.color);\n \n if (Hymn().filterSettings.color) {\n ImGui::ColorEdit3(\"Color##Color\", &Hymn().filterSettings.colorColor[0]);\n }\n }\n \n \/\/ Fog\n if (ImGui::CollapsingHeader(\"Fog\")) {\n ImGui::TextWrapped(\"Screen-space fog based on the depth buffer.\");\n \n ImGui::Checkbox(\"Enable##Fog\", &Hymn().filterSettings.fog);\n \n if (Hymn().filterSettings.fog) {\n ImGui::InputFloat(\"Density\", &Hymn().filterSettings.fogDensity);\n ImGui::ColorEdit3(\"Color##Fog\", &Hymn().filterSettings.fogColor[0]);\n }\n }\n \n \/\/ FXAA\n if (ImGui::CollapsingHeader(\"FXAA\")) {\n ImGui::TextWrapped(\"Cheap anti-aliasing.\");\n \n ImGui::Checkbox(\"Enable##FXAA\", &Hymn().filterSettings.fxaa);\n }\n \n \/\/ Glow\n if (ImGui::CollapsingHeader(\"Glow\")) {\n ImGui::TextWrapped(\"Blur the glow buffer and render it using additive blending.\");\n \n ImGui::Checkbox(\"Enable##Glow\", &Hymn().filterSettings.glow);\n \n if (Hymn().filterSettings.glow) {\n ImGui::InputInt(\"Blur amount\", &Hymn().filterSettings.glowBlurAmount);\n }\n }\n }\n ImGui::End();\n}\n\nbool FiltersWindow::IsVisible() const {\n return visible;\n}\n\nvoid FiltersWindow::SetVisible(bool visible) {\n this->visible = visible;\n}\n<|endoftext|>"} {"text":"#include \"WMSTimeDimension.h\"\n#include \n#include \n#include \n\nnamespace SmartMet\n{\nnamespace Plugin\n{\nnamespace WMS\n{\nnamespace\n{\nboost::posix_time::ptime parse_time(const std::string& time_string)\n{\n if (time_string == \"now\")\n return boost::posix_time::second_clock::universal_time();\n\n return Fmi::TimeParser::parse(time_string);\n}\n} \/\/ namespace\n\nvoid WMSTimeDimension::addTimestep(const boost::posix_time::ptime& timestep)\n{\n try\n {\n itsTimesteps.insert(timestep);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to add time step!\");\n }\n}\n\nvoid WMSTimeDimension::removeTimestep(const boost::posix_time::ptime& timestep)\n{\n try\n {\n itsTimesteps.erase(timestep);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to remove time step!\");\n }\n}\n\nbool WMSTimeDimension::isValidTime(const boost::posix_time::ptime& theTime) const\n{\n \/\/ Allow any time within the range\n\n if (itsTimesteps.empty())\n return false;\n\n return (theTime >= *itsTimesteps.cbegin() && theTime <= *itsTimesteps.crbegin());\n\n#if 0\n \/\/ Allow only listed times\n try\n {\n auto res = itsTimesteps.find(theTime);\n\n if (res == itsTimesteps.end())\n {\n return false;\n }\n else\n {\n return true;\n }\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to validate time!\");\n }\n#endif\n}\n\nstd::set WMSTimeDimension::getTimeSteps() const\n{\n return itsTimesteps;\n}\nboost::posix_time::ptime WMSTimeDimension::mostCurrentTime() const\n{\n try\n {\n if (itsTimesteps.size() == 0)\n return boost::posix_time::not_a_date_time;\n\n boost::posix_time::ptime current_time = boost::posix_time::second_clock::universal_time();\n\n \/\/ if current time is earlier than first timestep -> return first timestep\n if (current_time <= *(itsTimesteps.begin()))\n return *(itsTimesteps.begin());\n\n auto itLastTimestep = itsTimesteps.end();\n itLastTimestep--;\n \/\/ if current time is later than last timestep -> return last timestep\n if (current_time >= *itLastTimestep)\n return *itLastTimestep;\n\n \/\/ otherwise iterate timesteps ans find the closest one\n auto itPrevious = itsTimesteps.begin();\n for (auto it = itsTimesteps.begin(); it != itsTimesteps.end(); ++it)\n {\n if (*it >= current_time)\n {\n \/\/ perfect match: current timestep is equal to current time\n if (*it == current_time)\n return *it;\n\n \/\/ check which is closer to current time: current timestep or previous timestep\n boost::posix_time::time_duration duration_tonext(*it - current_time);\n boost::posix_time::time_duration duration_toprevious(current_time - *itPrevious);\n\n if (duration_toprevious.total_seconds() <= duration_tonext.total_seconds())\n return *itPrevious;\n else\n return *it;\n }\n\n itPrevious = it;\n }\n\n return boost::posix_time::not_a_date_time;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to establish most current time!\");\n }\n}\n\nstd::string StepTimeDimension::getCapabilities(const boost::optional& starttime,\n const boost::optional& endtime) const\n{\n try\n {\n std::ostringstream os;\n\n std::vector ret;\n ret.reserve(itsTimesteps.size());\n\n boost::posix_time::ptime startt =\n (starttime ? parse_time(*starttime) : boost::posix_time::min_date_time);\n boost::posix_time::ptime endt =\n (endtime ? parse_time(*endtime) : boost::posix_time::max_date_time);\n\n for (auto& step : itsTimesteps)\n {\n if (step >= startt && step <= endt)\n ret.push_back(Fmi::to_iso_extended_string(step) + \"Z\");\n if (step > endt)\n break;\n }\n\n return boost::algorithm::join(ret, \",\");\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to extract time dimension capabilities!\");\n }\n}\n\nIntervalTimeDimension::IntervalTimeDimension(const boost::posix_time::ptime& begin,\n const boost::posix_time::ptime& end,\n const boost::posix_time::time_duration& step)\n : itsInterval(begin, end, step)\n{\n}\n\nboost::posix_time::ptime IntervalTimeDimension::mostCurrentTime() const\n{\n return itsInterval.endTime;\n}\n\nbool IntervalTimeDimension::isValidTime(const boost::posix_time::ptime& theTime) const\n{\n return (theTime >= itsInterval.startTime && theTime <= itsInterval.endTime);\n}\n\nIntervalTimeDimension::tag_interval IntervalTimeDimension::getInterval() const\n{\n return itsInterval;\n}\n\nstd::string IntervalTimeDimension::getCapabilities(\n const boost::optional& starttime,\n const boost::optional& endtime) const\n{\n try\n {\n if ((starttime && endtime) && parse_time(*starttime) > parse_time(*endtime))\n throw Spine::Exception::Trace(BCP,\n \"Requested starttime must be earlier than requested endtime!\");\n\n boost::posix_time::ptime startt = itsInterval.startTime;\n boost::posix_time::ptime endt = itsInterval.endTime;\n boost::posix_time::ptime requested_startt =\n (starttime ? parse_time(*starttime) : itsInterval.startTime);\n boost::posix_time::ptime requested_endt =\n (endtime ? parse_time(*endtime) : itsInterval.endTime);\n\n if (requested_startt > endt || requested_endt < startt)\n return \"\";\n\n if (startt < requested_startt)\n {\n startt = boost::posix_time::ptime(requested_startt.date(), startt.time_of_day());\n boost::posix_time::time_duration resolution =\n (itsInterval.resolution.total_seconds() == 0 ? boost::posix_time::minutes(1)\n : itsInterval.resolution);\n if (startt < requested_startt)\n {\n while (startt < requested_startt)\n startt += resolution;\n }\n else if (startt > requested_startt)\n {\n while (startt - resolution >= requested_startt)\n startt -= resolution;\n }\n }\n\n if (requested_endt < endt)\n {\n endt = requested_endt;\n }\n\n std::ostringstream os;\n\n os << Fmi::to_iso_extended_string(startt) << \"Z\/\" << Fmi::to_iso_extended_string(endt)\n << \"Z\/PT\";\n if (itsInterval.resolution.hours() == 0 && itsInterval.resolution.minutes() <= 60)\n os << itsInterval.resolution.minutes() << \"M\";\n else\n {\n os << itsInterval.resolution.hours() << \"H\";\n if (itsInterval.resolution.minutes() > 0)\n os << itsInterval.resolution.minutes() << \"M\";\n }\n\n return os.str();\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to generate time dimension capabilities!\");\n }\n}\n\nstd::ostream& operator<<(std::ostream& ost, const StepTimeDimension& timeDimension)\n{\n try\n {\n auto timesteps = timeDimension.getTimeSteps();\n\n for (auto& step : timesteps)\n {\n ost << step << \" \";\n }\n\n ost << std::endl;\n\n return ost;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to print step time dimension data!\");\n }\n}\n\nstd::ostream& operator<<(std::ostream& ost, const IntervalTimeDimension& timeDimension)\n{\n try\n {\n auto interval = timeDimension.getInterval();\n ost << interval.startTime << \" - \" << interval.endTime << \" : \" << interval.resolution << \" \";\n ost << std::endl;\n\n return ost;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to print time dimension data!\");\n }\n}\n\n} \/\/ namespace WMS\n} \/\/ namespace Plugin\n} \/\/ namespace SmartMet\nRemoved unnecessary ostringstream object#include \"WMSTimeDimension.h\"\n#include \n#include \n#include \n\nnamespace SmartMet\n{\nnamespace Plugin\n{\nnamespace WMS\n{\nnamespace\n{\nboost::posix_time::ptime parse_time(const std::string& time_string)\n{\n if (time_string == \"now\")\n return boost::posix_time::second_clock::universal_time();\n\n return Fmi::TimeParser::parse(time_string);\n}\n} \/\/ namespace\n\nvoid WMSTimeDimension::addTimestep(const boost::posix_time::ptime& timestep)\n{\n try\n {\n itsTimesteps.insert(timestep);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to add time step!\");\n }\n}\n\nvoid WMSTimeDimension::removeTimestep(const boost::posix_time::ptime& timestep)\n{\n try\n {\n itsTimesteps.erase(timestep);\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to remove time step!\");\n }\n}\n\nbool WMSTimeDimension::isValidTime(const boost::posix_time::ptime& theTime) const\n{\n \/\/ Allow any time within the range\n\n if (itsTimesteps.empty())\n return false;\n\n return (theTime >= *itsTimesteps.cbegin() && theTime <= *itsTimesteps.crbegin());\n\n#if 0\n \/\/ Allow only listed times\n try\n {\n auto res = itsTimesteps.find(theTime);\n\n if (res == itsTimesteps.end())\n {\n return false;\n }\n else\n {\n return true;\n }\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to validate time!\");\n }\n#endif\n}\n\nstd::set WMSTimeDimension::getTimeSteps() const\n{\n return itsTimesteps;\n}\nboost::posix_time::ptime WMSTimeDimension::mostCurrentTime() const\n{\n try\n {\n if (itsTimesteps.size() == 0)\n return boost::posix_time::not_a_date_time;\n\n boost::posix_time::ptime current_time = boost::posix_time::second_clock::universal_time();\n\n \/\/ if current time is earlier than first timestep -> return first timestep\n if (current_time <= *(itsTimesteps.begin()))\n return *(itsTimesteps.begin());\n\n auto itLastTimestep = itsTimesteps.end();\n itLastTimestep--;\n \/\/ if current time is later than last timestep -> return last timestep\n if (current_time >= *itLastTimestep)\n return *itLastTimestep;\n\n \/\/ otherwise iterate timesteps ans find the closest one\n auto itPrevious = itsTimesteps.begin();\n for (auto it = itsTimesteps.begin(); it != itsTimesteps.end(); ++it)\n {\n if (*it >= current_time)\n {\n \/\/ perfect match: current timestep is equal to current time\n if (*it == current_time)\n return *it;\n\n \/\/ check which is closer to current time: current timestep or previous timestep\n boost::posix_time::time_duration duration_tonext(*it - current_time);\n boost::posix_time::time_duration duration_toprevious(current_time - *itPrevious);\n\n if (duration_toprevious.total_seconds() <= duration_tonext.total_seconds())\n return *itPrevious;\n else\n return *it;\n }\n\n itPrevious = it;\n }\n\n return boost::posix_time::not_a_date_time;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to establish most current time!\");\n }\n}\n\nstd::string StepTimeDimension::getCapabilities(const boost::optional& starttime,\n const boost::optional& endtime) const\n{\n try\n {\n std::vector ret;\n ret.reserve(itsTimesteps.size());\n\n boost::posix_time::ptime startt =\n (starttime ? parse_time(*starttime) : boost::posix_time::min_date_time);\n boost::posix_time::ptime endt =\n (endtime ? parse_time(*endtime) : boost::posix_time::max_date_time);\n\n for (auto& step : itsTimesteps)\n {\n if (step >= startt && step <= endt)\n ret.push_back(Fmi::to_iso_extended_string(step) + \"Z\");\n if (step > endt)\n break;\n }\n\n return boost::algorithm::join(ret, \",\");\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to extract time dimension capabilities!\");\n }\n}\n\nIntervalTimeDimension::IntervalTimeDimension(const boost::posix_time::ptime& begin,\n const boost::posix_time::ptime& end,\n const boost::posix_time::time_duration& step)\n : itsInterval(begin, end, step)\n{\n}\n\nboost::posix_time::ptime IntervalTimeDimension::mostCurrentTime() const\n{\n return itsInterval.endTime;\n}\n\nbool IntervalTimeDimension::isValidTime(const boost::posix_time::ptime& theTime) const\n{\n return (theTime >= itsInterval.startTime && theTime <= itsInterval.endTime);\n}\n\nIntervalTimeDimension::tag_interval IntervalTimeDimension::getInterval() const\n{\n return itsInterval;\n}\n\nstd::string IntervalTimeDimension::getCapabilities(\n const boost::optional& starttime,\n const boost::optional& endtime) const\n{\n try\n {\n if ((starttime && endtime) && parse_time(*starttime) > parse_time(*endtime))\n throw Spine::Exception::Trace(BCP,\n \"Requested starttime must be earlier than requested endtime!\");\n\n boost::posix_time::ptime startt = itsInterval.startTime;\n boost::posix_time::ptime endt = itsInterval.endTime;\n boost::posix_time::ptime requested_startt =\n (starttime ? parse_time(*starttime) : itsInterval.startTime);\n boost::posix_time::ptime requested_endt =\n (endtime ? parse_time(*endtime) : itsInterval.endTime);\n\n if (requested_startt > endt || requested_endt < startt)\n return \"\";\n\n if (startt < requested_startt)\n {\n startt = boost::posix_time::ptime(requested_startt.date(), startt.time_of_day());\n boost::posix_time::time_duration resolution =\n (itsInterval.resolution.total_seconds() == 0 ? boost::posix_time::minutes(1)\n : itsInterval.resolution);\n if (startt < requested_startt)\n {\n while (startt < requested_startt)\n startt += resolution;\n }\n else if (startt > requested_startt)\n {\n while (startt - resolution >= requested_startt)\n startt -= resolution;\n }\n }\n\n if (requested_endt < endt)\n {\n endt = requested_endt;\n }\n\n std::ostringstream os;\n\n os << Fmi::to_iso_extended_string(startt) << \"Z\/\" << Fmi::to_iso_extended_string(endt)\n << \"Z\/PT\";\n if (itsInterval.resolution.hours() == 0 && itsInterval.resolution.minutes() <= 60)\n os << itsInterval.resolution.minutes() << \"M\";\n else\n {\n os << itsInterval.resolution.hours() << \"H\";\n if (itsInterval.resolution.minutes() > 0)\n os << itsInterval.resolution.minutes() << \"M\";\n }\n\n return os.str();\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to generate time dimension capabilities!\");\n }\n}\n\nstd::ostream& operator<<(std::ostream& ost, const StepTimeDimension& timeDimension)\n{\n try\n {\n auto timesteps = timeDimension.getTimeSteps();\n\n for (auto& step : timesteps)\n {\n ost << step << \" \";\n }\n\n ost << std::endl;\n\n return ost;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to print step time dimension data!\");\n }\n}\n\nstd::ostream& operator<<(std::ostream& ost, const IntervalTimeDimension& timeDimension)\n{\n try\n {\n auto interval = timeDimension.getInterval();\n ost << interval.startTime << \" - \" << interval.endTime << \" : \" << interval.resolution << \" \";\n ost << std::endl;\n\n return ost;\n }\n catch (...)\n {\n throw Spine::Exception::Trace(BCP, \"Failed to print time dimension data!\");\n }\n}\n\n} \/\/ namespace WMS\n} \/\/ namespace Plugin\n} \/\/ namespace SmartMet\n<|endoftext|>"} {"text":"#pragma once\n\nnamespace GUI {\n \/\/\/ A window where filters is configured.\n class FiltersWindow {\n public:\n \/\/\/ Show the window\n void Show();\n \n \/\/\/ Get whether the window is visible.\n \/**\n * @return Whether the window is visible.\n *\/\n bool IsVisible() const;\n \n \/\/\/ Set whether the window should be visible.\n \/**\n * @param visible Whether the window should be visible.\n *\/\n void SetVisible(bool visible);\n \n private:\n bool visible = false;\n };\n}\nFix grammar error#pragma once\n\nnamespace GUI {\n \/\/\/ A window where filters are configured.\n class FiltersWindow {\n public:\n \/\/\/ Show the window\n void Show();\n \n \/\/\/ Get whether the window is visible.\n \/**\n * @return Whether the window is visible.\n *\/\n bool IsVisible() const;\n \n \/\/\/ Set whether the window should be visible.\n \/**\n * @param visible Whether the window should be visible.\n *\/\n void SetVisible(bool visible);\n \n private:\n bool visible = false;\n };\n}\n<|endoftext|>"} {"text":"#undef _WIN32_WINNT\n#define _WIN32_WINNT 0x0601\n\n#undef WINVER\n#define WINVER 0x0601\n\n#define SPACE_SCAN_CODE 0x0039\n\n#include \"keyboard-layout-manager.h\"\n\n#include \n#include \n#include \n\nusing namespace v8;\n\nstd::string ToUTF8(const std::wstring& string) {\n if (string.length() < 1) {\n return std::string();\n }\n\n \/\/ NB: In the pathological case, each character could expand up\n \/\/ to 4 bytes in UTF8.\n int cbLen = (string.length()+1) * sizeof(char) * 4;\n char* buf = new char[cbLen];\n int retLen = WideCharToMultiByte(CP_UTF8, 0, string.c_str(), string.length(), buf, cbLen, NULL, NULL);\n buf[retLen] = 0;\n\n std::string ret;\n ret.assign(buf);\n return ret;\n}\n\nvoid KeyboardLayoutManager::Init(Handle exports, Handle module) {\n Nan::HandleScope scope;\n Local newTemplate = Nan::New(KeyboardLayoutManager::New);\n newTemplate->SetClassName(Nan::New(\"KeyboardLayoutManager\").ToLocalChecked());\n newTemplate->InstanceTemplate()->SetInternalFieldCount(1);\n Local proto = newTemplate->PrototypeTemplate();\n\n Nan::SetMethod(proto, \"getCurrentKeyboardLayout\", KeyboardLayoutManager::GetCurrentKeyboardLayout);\n Nan::SetMethod(proto, \"getCurrentKeyboardLanguage\", KeyboardLayoutManager::GetCurrentKeyboardLanguage);\n Nan::SetMethod(proto, \"getInstalledKeyboardLanguages\", KeyboardLayoutManager::GetInstalledKeyboardLanguages);\n Nan::SetMethod(proto, \"getCurrentKeymap\", KeyboardLayoutManager::GetCurrentKeymap);\n\n module->Set(Nan::New(\"exports\").ToLocalChecked(), newTemplate->GetFunction());\n}\n\nNODE_MODULE(keyboard_layout_manager, KeyboardLayoutManager::Init)\n\nNAN_METHOD(KeyboardLayoutManager::New) {\n Nan::HandleScope scope;\n\n Local callbackHandle = info[0].As();\n Nan::Callback *callback = new Nan::Callback(callbackHandle);\n\n KeyboardLayoutManager *manager = new KeyboardLayoutManager(callback);\n manager->Wrap(info.This());\n return;\n}\n\nKeyboardLayoutManager::KeyboardLayoutManager(Nan::Callback *callback) : callback(callback) {\n}\n\nKeyboardLayoutManager::~KeyboardLayoutManager() {\n delete callback;\n};\n\nvoid KeyboardLayoutManager::HandleKeyboardLayoutChanged() {\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeyboardLayout) {\n Nan::HandleScope scope;\n\n char layoutName[KL_NAMELENGTH];\n if (::GetKeyboardLayoutName(layoutName))\n info.GetReturnValue().Set(Nan::New(layoutName).ToLocalChecked());\n else\n info.GetReturnValue().Set(Nan::Undefined());\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeyboardLanguage) {\n Nan::HandleScope scope;\n\n HKL layout;\n DWORD dwThreadId = 0;\n HWND hWnd = GetForegroundWindow();\n\n if (hWnd != NULL) {\n dwThreadId = GetWindowThreadProcessId(hWnd, NULL);\n }\n\n layout = GetKeyboardLayout(dwThreadId);\n\n wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n std::wstring wstr;\n LCIDToLocaleName(MAKELCID((UINT)layout & 0xFFFF, SORT_DEFAULT), buf, LOCALE_NAME_MAX_LENGTH, 0);\n wstr.assign(buf);\n\n std::string str = ToUTF8(wstr);\n info.GetReturnValue().Set(Nan::New(str.data(), str.size()).ToLocalChecked());\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetInstalledKeyboardLanguages) {\n Nan::HandleScope scope;\n\n int layoutCount = GetKeyboardLayoutList(0, NULL);\n HKL* layouts = new HKL[layoutCount];\n GetKeyboardLayoutList(layoutCount, layouts);\n\n Local result = Nan::New(layoutCount);\n wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n\n for (int i=0; i < layoutCount; i++) {\n std::wstring wstr;\n LCIDToLocaleName(MAKELCID((UINT)layouts[i] & 0xFFFF, SORT_DEFAULT), buf, LOCALE_NAME_MAX_LENGTH, 0);\n wstr.assign(buf);\n\n std::string str = ToUTF8(wstr);\n result->Set(i, Nan::New(str.data(), str.size()).ToLocalChecked());\n }\n\n delete[] layouts;\n info.GetReturnValue().Set(result);\n}\n\nstruct KeycodeMapEntry {\n UINT scanCode;\n const char *dom3Code;\n};\n\n#define USB_KEYMAP_DECLARATION static const KeycodeMapEntry keyCodeMap[] =\n#define USB_KEYMAP(usb, evdev, xkb, win, mac, code, id) {win, code}\n\n#include \"keycode_converter_data.inc\"\n\nLocal CharacterForNativeCode(HKL keyboardLayout, UINT keyCode, UINT scanCode,\n BYTE *keyboardState, bool shift, bool altGraph) {\n memset(keyboardState, 0, 256);\n if (shift) {\n keyboardState[VK_SHIFT] = 0x80;\n }\n\n if (altGraph) {\n keyboardState[VK_MENU] = 0x80;\n keyboardState[VK_CONTROL] = 0x80;\n }\n\n wchar_t characters[5];\n int count = ToUnicodeEx(keyCode, scanCode, keyboardState, characters, 5, 0, keyboardLayout);\n\n if (count == -1) { \/\/ Dead key\n Local result = Nan::New(reinterpret_cast(characters), count).ToLocalChecked();\n \/\/ Clear dead key out of kernel-mode keyboard buffer so subsequent translations are not affected\n UINT spaceKeyCode = MapVirtualKeyEx(SPACE_SCAN_CODE, MAPVK_VSC_TO_VK, keyboardLayout);\n ToUnicodeEx(spaceKeyCode, SPACE_SCAN_CODE, keyboardState, characters, 5, 0, keyboardLayout);\n return result;\n }\n\n if (count > 0 && !std::iscntrl(characters[0])) {\n return Nan::New(reinterpret_cast(characters), count).ToLocalChecked();\n } else {\n return Nan::Null();\n }\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeymap) {\n BYTE keyboardState[256];\n HKL keyboardLayout = GetKeyboardLayout(0);\n\n Handle result = Nan::New();\n Local unmodifiedKey = Nan::New(\"unmodified\").ToLocalChecked();\n Local withShiftKey = Nan::New(\"withShift\").ToLocalChecked();\n Local withAltGraphKey = Nan::New(\"withAltGraph\").ToLocalChecked();\n Local withAltGraphShiftKey = Nan::New(\"withAltGraphShift\").ToLocalChecked();\n\n size_t keyCodeMapSize = sizeof(keyCodeMap) \/ sizeof(keyCodeMap[0]);\n for (size_t i = 0; i < keyCodeMapSize; i++) {\n const char *dom3Code = keyCodeMap[i].dom3Code;\n UINT scanCode = keyCodeMap[i].scanCode;\n\n if (dom3Code && scanCode > 0x0000) {\n UINT keyCode = MapVirtualKeyEx(scanCode, MAPVK_VSC_TO_VK, keyboardLayout);\n\n Local dom3CodeKey = Nan::New(dom3Code).ToLocalChecked();\n Local unmodified = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, false, false);\n Local withShift = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, true, false);\n Local withAltGraph = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, false, true);\n Local withAltGraphShift = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, true, true);\n\n if (unmodified->IsString() || withShift->IsString() || withAltGraph->IsString() || withAltGraphShift->IsString()) {\n Local entry = Nan::New();\n entry->Set(unmodifiedKey, unmodified);\n entry->Set(withShiftKey, withShift);\n entry->Set(withAltGraphKey, withAltGraph);\n entry->Set(withAltGraphShiftKey, withAltGraphShift);\n\n result->Set(dom3CodeKey, entry);\n }\n }\n }\n\n info.GetReturnValue().Set(result);\n\n}\nDon’t map dead keys on Windows to avoid dropping dead key state#undef _WIN32_WINNT\n#define _WIN32_WINNT 0x0601\n\n#undef WINVER\n#define WINVER 0x0601\n\n#define SPACE_SCAN_CODE 0x0039\n\n#include \"keyboard-layout-manager.h\"\n\n#include \n#include \n#include \n\nusing namespace v8;\n\nstd::string ToUTF8(const std::wstring& string) {\n if (string.length() < 1) {\n return std::string();\n }\n\n \/\/ NB: In the pathological case, each character could expand up\n \/\/ to 4 bytes in UTF8.\n int cbLen = (string.length()+1) * sizeof(char) * 4;\n char* buf = new char[cbLen];\n int retLen = WideCharToMultiByte(CP_UTF8, 0, string.c_str(), string.length(), buf, cbLen, NULL, NULL);\n buf[retLen] = 0;\n\n std::string ret;\n ret.assign(buf);\n return ret;\n}\n\nvoid KeyboardLayoutManager::Init(Handle exports, Handle module) {\n Nan::HandleScope scope;\n Local newTemplate = Nan::New(KeyboardLayoutManager::New);\n newTemplate->SetClassName(Nan::New(\"KeyboardLayoutManager\").ToLocalChecked());\n newTemplate->InstanceTemplate()->SetInternalFieldCount(1);\n Local proto = newTemplate->PrototypeTemplate();\n\n Nan::SetMethod(proto, \"getCurrentKeyboardLayout\", KeyboardLayoutManager::GetCurrentKeyboardLayout);\n Nan::SetMethod(proto, \"getCurrentKeyboardLanguage\", KeyboardLayoutManager::GetCurrentKeyboardLanguage);\n Nan::SetMethod(proto, \"getInstalledKeyboardLanguages\", KeyboardLayoutManager::GetInstalledKeyboardLanguages);\n Nan::SetMethod(proto, \"getCurrentKeymap\", KeyboardLayoutManager::GetCurrentKeymap);\n\n module->Set(Nan::New(\"exports\").ToLocalChecked(), newTemplate->GetFunction());\n}\n\nNODE_MODULE(keyboard_layout_manager, KeyboardLayoutManager::Init)\n\nNAN_METHOD(KeyboardLayoutManager::New) {\n Nan::HandleScope scope;\n\n Local callbackHandle = info[0].As();\n Nan::Callback *callback = new Nan::Callback(callbackHandle);\n\n KeyboardLayoutManager *manager = new KeyboardLayoutManager(callback);\n manager->Wrap(info.This());\n return;\n}\n\nKeyboardLayoutManager::KeyboardLayoutManager(Nan::Callback *callback) : callback(callback) {\n}\n\nKeyboardLayoutManager::~KeyboardLayoutManager() {\n delete callback;\n};\n\nvoid KeyboardLayoutManager::HandleKeyboardLayoutChanged() {\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeyboardLayout) {\n Nan::HandleScope scope;\n\n char layoutName[KL_NAMELENGTH];\n if (::GetKeyboardLayoutName(layoutName))\n info.GetReturnValue().Set(Nan::New(layoutName).ToLocalChecked());\n else\n info.GetReturnValue().Set(Nan::Undefined());\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeyboardLanguage) {\n Nan::HandleScope scope;\n\n HKL layout;\n DWORD dwThreadId = 0;\n HWND hWnd = GetForegroundWindow();\n\n if (hWnd != NULL) {\n dwThreadId = GetWindowThreadProcessId(hWnd, NULL);\n }\n\n layout = GetKeyboardLayout(dwThreadId);\n\n wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n std::wstring wstr;\n LCIDToLocaleName(MAKELCID((UINT)layout & 0xFFFF, SORT_DEFAULT), buf, LOCALE_NAME_MAX_LENGTH, 0);\n wstr.assign(buf);\n\n std::string str = ToUTF8(wstr);\n info.GetReturnValue().Set(Nan::New(str.data(), str.size()).ToLocalChecked());\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetInstalledKeyboardLanguages) {\n Nan::HandleScope scope;\n\n int layoutCount = GetKeyboardLayoutList(0, NULL);\n HKL* layouts = new HKL[layoutCount];\n GetKeyboardLayoutList(layoutCount, layouts);\n\n Local result = Nan::New(layoutCount);\n wchar_t buf[LOCALE_NAME_MAX_LENGTH];\n\n for (int i=0; i < layoutCount; i++) {\n std::wstring wstr;\n LCIDToLocaleName(MAKELCID((UINT)layouts[i] & 0xFFFF, SORT_DEFAULT), buf, LOCALE_NAME_MAX_LENGTH, 0);\n wstr.assign(buf);\n\n std::string str = ToUTF8(wstr);\n result->Set(i, Nan::New(str.data(), str.size()).ToLocalChecked());\n }\n\n delete[] layouts;\n info.GetReturnValue().Set(result);\n}\n\nstruct KeycodeMapEntry {\n UINT scanCode;\n const char *dom3Code;\n};\n\n#define USB_KEYMAP_DECLARATION static const KeycodeMapEntry keyCodeMap[] =\n#define USB_KEYMAP(usb, evdev, xkb, win, mac, code, id) {win, code}\n\n#include \"keycode_converter_data.inc\"\n\nLocal CharacterForNativeCode(HKL keyboardLayout, UINT keyCode, UINT scanCode,\n BYTE *keyboardState, bool shift, bool altGraph) {\n memset(keyboardState, 0, 256);\n if (shift) {\n keyboardState[VK_SHIFT] = 0x80;\n }\n\n if (altGraph) {\n keyboardState[VK_MENU] = 0x80;\n keyboardState[VK_CONTROL] = 0x80;\n }\n\n wchar_t characters[5];\n int count = ToUnicodeEx(keyCode, scanCode, keyboardState, characters, 5, 0, keyboardLayout);\n\n if (count > 0 && !std::iscntrl(characters[0])) {\n return Nan::New(reinterpret_cast(characters), count).ToLocalChecked();\n } else {\n return Nan::Null();\n }\n}\n\nNAN_METHOD(KeyboardLayoutManager::GetCurrentKeymap) {\n BYTE keyboardState[256];\n HKL keyboardLayout = GetKeyboardLayout(0);\n\n Handle result = Nan::New();\n Local unmodifiedKey = Nan::New(\"unmodified\").ToLocalChecked();\n Local withShiftKey = Nan::New(\"withShift\").ToLocalChecked();\n Local withAltGraphKey = Nan::New(\"withAltGraph\").ToLocalChecked();\n Local withAltGraphShiftKey = Nan::New(\"withAltGraphShift\").ToLocalChecked();\n\n size_t keyCodeMapSize = sizeof(keyCodeMap) \/ sizeof(keyCodeMap[0]);\n for (size_t i = 0; i < keyCodeMapSize; i++) {\n const char *dom3Code = keyCodeMap[i].dom3Code;\n UINT scanCode = keyCodeMap[i].scanCode;\n\n if (dom3Code && scanCode > 0x0000) {\n UINT keyCode = MapVirtualKeyEx(scanCode, MAPVK_VSC_TO_VK, keyboardLayout);\n\n \/\/ Detect and skip dead keys. If the most significant bit of the returned\n \/\/ character value is 1, this is a dead key. Trying to translate it to a\n \/\/ character will mutate the Windows keyboard buffer and blow away pending\n \/\/ dead keys. To avoid this bug, we just refuse to map dead keys to\n \/\/ characters.\n if ((MapVirtualKeyEx(keyCode, MAPVK_VK_TO_CHAR, keyboardLayout) >> (sizeof(UINT) * 8 - 1))) continue;\n\n Local dom3CodeKey = Nan::New(dom3Code).ToLocalChecked();\n Local unmodified = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, false, false);\n Local withShift = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, true, false);\n Local withAltGraph = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, false, true);\n Local withAltGraphShift = CharacterForNativeCode(keyboardLayout, keyCode, scanCode, keyboardState, true, true);\n\n if (unmodified->IsString() || withShift->IsString() || withAltGraph->IsString() || withAltGraphShift->IsString()) {\n Local entry = Nan::New();\n entry->Set(unmodifiedKey, unmodified);\n entry->Set(withShiftKey, withShift);\n entry->Set(withAltGraphKey, withAltGraph);\n entry->Set(withAltGraphShiftKey, withAltGraphShift);\n\n result->Set(dom3CodeKey, entry);\n }\n }\n }\n\n info.GetReturnValue().Set(result);\n\n}\n<|endoftext|>"} {"text":"#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include \n#include \n\n\/\/ Libslic3r\n#include \"libslic3r.h\"\n#include \"ConfigBase.hpp\"\n#include \"Config.hpp\"\n\n\/\/ GUI\n#include \"misc_ui.hpp\"\n\n\/\/ Wx\n#include \n#include \n#include \n\nusing namespace std::string_literals;\nnamespace Slic3r { namespace GUI {\n\nclass PresetPage;\n\nclass PresetEditor : public wxPanel {\n\npublic: \n \/\/\/ Member function to retrieve a list of options \n \/\/\/ that this preset governs. Subclasses should \n \/\/\/ call their own static method.\n virtual t_config_option_keys my_options() = 0;\n static t_config_option_keys options() { return t_config_option_keys {}; }\n\n static t_config_option_keys overridable_options() { return t_config_option_keys {}; };\n static t_config_option_keys overriding_options() { return t_config_option_keys {}; };\n\n virtual t_config_option_keys my_overridable_options() = 0;\n virtual t_config_option_keys my_overriding_options() = 0;\n\n wxSizer* sizer() { return _sizer; };\n PresetEditor(wxWindow* parent, t_config_option_keys options = {});\n PresetEditor() : PresetEditor(nullptr, {}) {};\n std::shared_ptr current_preset;\n\n \/\/\/ Check if there is a dirty config that is different than the loaded config.\n bool prompt_unsaved_changes();\n void select_preset_by_name(const wxString& name, bool force = false);\n \n \/\/\/ suppress the callback when the tree selection is changed.\n bool disable_tree_sel_changed_event {false};\n\n void save_preset();\n std::function on_save_preset {};\n std::function on_value_change {};\n\n config_ptr config;\n PresetPage* add_options_page(const wxString& _title, const wxString& _icon = \"\");\n\n virtual wxString title() = 0;\n virtual std::string name() = 0;\nprotected:\n \/\/ Main sizer\n wxSizer* _sizer {nullptr};\n wxString presets;\n wxImageList* _icons {nullptr};\n wxTreeCtrl* _treectrl {nullptr};\n wxBitmapButton* _btn_save_preset {nullptr}; \n wxBitmapButton* _btn_delete_preset {nullptr};\n wxChoice* _presets_choice {nullptr};\n int _iconcount {-1};\n\n \/\/\/ Vector of PresetPage pointers; trust wxWidgets RTTI to avoid leaks\n std::vector _pages {};\n \n const unsigned int left_col_width {150};\n void _update_tree();\n void load_presets();\n\n virtual void _build() = 0;\n virtual void _update() = 0;\n virtual void _on_preset_loaded() = 0;\n void set_tooltips() { \n this->_btn_save_preset->SetToolTip(wxString(_(\"Save current \")) + this->title());\n this->_btn_delete_preset->SetToolTip(_(\"Delete this preset.\"));\n }\n};\n\nclass PrintEditor : public PresetEditor {\npublic:\n\n PrintEditor(wxWindow* parent, t_config_option_keys options = {});\n PrintEditor() : PrintEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Print Settings\"); }\n std::string name() override { return \"print\"s; }\n\n\n t_config_option_keys my_overridable_options() override { return PresetEditor::overridable_options(); };\n static t_config_option_keys overridable_options() { return PresetEditor::overridable_options(); };\n\n t_config_option_keys my_overriding_options() override { return PresetEditor::overriding_options(); };\n static t_config_option_keys overriding_options() { return PresetEditor::overriding_options(); };\n\n \/\/\/ Static method to retrieve list of options that this preset governs.\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"layer_height\"s, \"first_layer_height\"s,\n \"adaptive_slicing\"s, \"adaptive_slicing_quality\"s, \"match_horizontal_surfaces\"s,\n \"perimeters\"s, \"spiral_vase\"s,\n \"top_solid_layers\"s, \"bottom_solid_layers\"s,\n \"extra_perimeters\"s, \"avoid_crossing_perimeters\"s, \"thin_walls\"s, \"overhangs\"s,\n \"seam_position\"s, \"external_perimeters_first\"s,\n \"fill_density\"s, \"fill_pattern\"s, \"top_infill_pattern\"s, \"bottom_infill_pattern\"s, \"fill_gaps\"s,\n \"infill_every_layers\"s, \"infill_only_where_needed\"s,\n \"solid_infill_every_layers\"s, \"fill_angle\"s, \"solid_infill_below_area\"s, \"\"s,\n \"only_retract_when_crossing_perimeters\"s, \"infill_first\"s,\n \"max_print_speed\"s, \"max_volumetric_speed\"s,\n \"perimeter_speed\"s, \"small_perimeter_speed\"s, \"external_perimeter_speed\"s, \"infill_speed\"s, \"\"s,\n \"solid_infill_speed\"s, \"top_solid_infill_speed\"s, \"support_material_speed\"s,\n \"support_material_interface_speed\"s, \"bridge_speed\"s, \"gap_fill_speed\"s,\n \"travel_speed\"s,\n \"first_layer_speed\"s,\n \"perimeter_acceleration\"s, \"infill_acceleration\"s, \"bridge_acceleration\"s,\n \"first_layer_acceleration\"s, \"default_acceleration\"s,\n \"skirts\"s, \"skirt_distance\"s, \"skirt_height\"s, \"min_skirt_length\"s,\n \"brim_connections_width\"s, \"brim_width\"s, \"interior_brim_width\"s,\n \"support_material\"s, \"support_material_threshold\"s, \"support_material_max_layers\"s, \"support_material_enforce_layers\"s,\n \"raft_layers\"s,\n \"support_material_pattern\"s, \"support_material_spacing\"s, \"support_material_angle\"s, \"\"s,\n \"support_material_interface_layers\"s, \"support_material_interface_spacing\"s,\n \"support_material_contact_distance\"s, \"support_material_buildplate_only\"s, \"dont_support_bridges\"s,\n \"notes\"s,\n \"complete_objects\"s, \"extruder_clearance_radius\"s, \"extruder_clearance_height\"s,\n \"gcode_comments\"s, \"output_filename_format\"s,\n \"post_process\"s,\n \"perimeter_extruder\"s, \"infill_extruder\"s, \"solid_infill_extruder\"s,\n \"support_material_extruder\"s, \"support_material_interface_extruder\"s,\n \"ooze_prevention\"s, \"standby_temperature_delta\"s,\n \"interface_shells\"s, \"regions_overlap\"s,\n \"extrusion_width\"s, \"first_layer_extrusion_width\"s, \"perimeter_extrusion_width\"s, \"\"s,\n \"external_perimeter_extrusion_width\"s, \"infill_extrusion_width\"s, \"solid_infill_extrusion_width\"s,\n \"top_infill_extrusion_width\"s, \"support_material_extrusion_width\"s,\n \"support_material_interface_extrusion_width\"s, \"infill_overlap\"s, \"bridge_flow_ratio\"s,\n \"xy_size_compensation\"s, \"resolution\"s, \"shortcuts\"s, \"compatible_printers\"s,\n \"print_settings_id\"s\n };\n }\n\n t_config_option_keys my_options() override { return PrintEditor::options(); }\n\nprotected:\n void _update() override;\n void _build() override;\n};\n\nclass PrinterEditor : public PresetEditor {\npublic:\n PrinterEditor(wxWindow* parent, t_config_option_keys options = {});\n PrinterEditor() : PrinterEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Printer Settings\"); }\n std::string name() override { return \"printer\"s; }\n static t_config_option_keys overridable_options() { return t_config_option_keys \n {\n \"pressure_advance\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s,\n \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s\n }; };\n static t_config_option_keys overriding_options() { return PresetEditor::overriding_options(); };\n\n t_config_option_keys my_overridable_options() override { return PrinterEditor::overridable_options(); };\n t_config_option_keys my_overriding_options() override { return PrinterEditor::overriding_options(); };\n\n \n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"bed_shape\"s, \"z_offset\"s, \"z_steps_per_mm\"s, \"has_heatbed\"s,\n \"gcode_flavor\"s, \"use_relative_e_distances\"s,\n \"serial_port\"s, \"serial_speed\"s,\n \"host_type\"s, \"print_host\"s, \"octoprint_apikey\"s,\n \"use_firmware_retraction\"s, \"pressure_advance\"s, \"vibration_limit\"s,\n \"use_volumetric_e\"s,\n \"start_gcode\"s, \"end_gcode\"s, \"before_layer_gcode\"s, \"layer_gcode\"s, \"toolchange_gcode\"s, \"between_objects_gcode\"s,\n \"nozzle_diameter\"s, \"extruder_offset\"s, \"min_layer_height\"s, \"max_layer_height\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s, \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s,\n \"retract_length_toolchange\"s, \"retract_restart_extra_toolchange\"s, \"retract_lift_above\"s, \"retract_lift_below\"s,\n \"printer_settings_id\"s,\n \"printer_notes\"s,\n \"use_set_and_wait_bed\"s, \"use_set_and_wait_extruder\"s\n };\n }\n \n t_config_option_keys my_options() override { return PrinterEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"PrinterEditor\"s;} \/\/< Which log these messages should go to.\n};\n\nclass MaterialEditor : public PresetEditor {\npublic:\n\n wxString title() override { return _(\"Material Settings\"); }\n std::string name() override { return \"material\"s; }\n preset_t type() override { return preset_t::Material; }; \n int typeId() override { return static_cast(preset_t::Material); }; \n MaterialEditor(wxWindow* parent, t_config_option_keys options = {});\n MaterialEditor() : MaterialEditor(nullptr, {}) {};\n \n t_config_option_keys my_overridable_options() override { return PresetEditor::overridable_options(); };\n t_config_option_keys my_overriding_options() override { return PrinterEditor::overridable_options(); };\n\n static t_config_option_keys overriding_options() { return PrinterEditor::overridable_options(); };\n static t_config_option_keys overridable_options() { return PresetEditor::overridable_options(); };\n\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"filament_colour\"s, \"filament_diameter\"s, \"filament_notes\"s, \"filament_max_volumetric_speed\"s, \"extrusion_multiplier\"s, \"filament_density\"s, \"filament_cost\"s,\n \"temperature\"s, \"first_layer_temperature\"s, \"bed_temperature\"s, \"first_layer_bed_temperature\"s,\n \"fan_always_on\"s, \"cooling\"s, \"compatible_printers\"s,\n \"min_fan_speed\"s, \"max_fan_speed\"s, \"bridge_fan_speed\"s, \"disable_fan_first_layers\"s,\n \"fan_below_layer_time\"s, \"slowdown_below_layer_time\"s, \"min_print_speed\"s,\n \"start_filament_gcode\"s, \"end_filament_gcode\"s,\n \"filament_settings_id\"s\n };\n }\n \n t_config_option_keys my_options() override { return MaterialEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"MaterialEditor\"s;} \/\/< Which log these messages should go to.\n};\n\n\n\n\nclass PresetPage : wxScrolledWindow {\npublic:\n PresetPage(wxWindow* parent, wxString _title, int _iconID) : \n wxScrolledWindow(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL),\n title(_title), iconID(_iconID) {\n this->vsizer = new wxBoxSizer(wxVERTICAL);\n this->SetSizer(this->vsizer);\n this->SetScrollRate(ui_settings->scroll_step(), ui_settings->scroll_step());\n }\nprotected:\n wxSizer* vsizer {nullptr};\n wxString title {\"\"};\n int iconID {0};\n};\n\n}} \/\/ namespace Slic3r::GUI\n#endif \/\/ PRESETEDITOR_HPP\nBring in Preset reference file#ifndef PRESETEDITOR_HPP\n#define PRESETEDITOR_HPP\n\n\/\/ stdlib\n#include \n#include \n\n\/\/ Libslic3r\n#include \"libslic3r.h\"\n#include \"ConfigBase.hpp\"\n#include \"Config.hpp\"\n\n\/\/ GUI\n#include \"misc_ui.hpp\"\n#include \"Preset.hpp\"\n\n\/\/ Wx\n#include \n#include \n#include \n#include \n\nusing namespace std::string_literals;\nnamespace Slic3r { namespace GUI {\n\nclass PresetPage;\n\nclass PresetEditor : public wxPanel {\n\npublic: \n \/\/\/ Member function to retrieve a list of options \n \/\/\/ that this preset governs. Subclasses should \n \/\/\/ call their own static method.\n virtual t_config_option_keys my_options() = 0;\n static t_config_option_keys options() { return t_config_option_keys {}; }\n\n static t_config_option_keys overridable_options() { return t_config_option_keys {}; };\n static t_config_option_keys overriding_options() { return t_config_option_keys {}; };\n\n virtual t_config_option_keys my_overridable_options() = 0;\n virtual t_config_option_keys my_overriding_options() = 0;\n\n wxSizer* sizer() { return _sizer; };\n PresetEditor(wxWindow* parent, t_config_option_keys options = {});\n PresetEditor() : PresetEditor(nullptr, {}) {};\n std::shared_ptr current_preset;\n\n \/\/\/ Check if there is a dirty config that is different than the loaded config.\n bool prompt_unsaved_changes();\n void select_preset_by_name(const wxString& name, bool force = false);\n \n \/\/\/ suppress the callback when the tree selection is changed.\n bool disable_tree_sel_changed_event {false};\n\n void save_preset();\n std::function on_save_preset {};\n std::function on_value_change {};\n\n config_ptr config;\n PresetPage* add_options_page(const wxString& _title, const wxString& _icon = \"\");\n\n virtual wxString title() = 0;\n virtual std::string name() = 0;\nprotected:\n \/\/ Main sizer\n wxSizer* _sizer {nullptr};\n wxString presets;\n wxImageList* _icons {nullptr};\n wxTreeCtrl* _treectrl {nullptr};\n wxBitmapButton* _btn_save_preset {nullptr}; \n wxBitmapButton* _btn_delete_preset {nullptr};\n wxChoice* _presets_choice {nullptr};\n int _iconcount {-1};\n\n \/\/\/ Vector of PresetPage pointers; trust wxWidgets RTTI to avoid leaks\n std::vector _pages {};\n \n const unsigned int left_col_width {150};\n void _update_tree();\n void load_presets();\n\n virtual void _build() = 0;\n virtual void _update() = 0;\n virtual void _on_preset_loaded() = 0;\n void set_tooltips() { \n this->_btn_save_preset->SetToolTip(wxString(_(\"Save current \")) + this->title());\n this->_btn_delete_preset->SetToolTip(_(\"Delete this preset.\"));\n }\n};\n\nclass PrintEditor : public PresetEditor {\npublic:\n\n PrintEditor(wxWindow* parent, t_config_option_keys options = {});\n PrintEditor() : PrintEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Print Settings\"); }\n std::string name() override { return \"print\"s; }\n\n\n t_config_option_keys my_overridable_options() override { return PresetEditor::overridable_options(); };\n static t_config_option_keys overridable_options() { return PresetEditor::overridable_options(); };\n\n t_config_option_keys my_overriding_options() override { return PresetEditor::overriding_options(); };\n static t_config_option_keys overriding_options() { return PresetEditor::overriding_options(); };\n\n \/\/\/ Static method to retrieve list of options that this preset governs.\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"layer_height\"s, \"first_layer_height\"s,\n \"adaptive_slicing\"s, \"adaptive_slicing_quality\"s, \"match_horizontal_surfaces\"s,\n \"perimeters\"s, \"spiral_vase\"s,\n \"top_solid_layers\"s, \"bottom_solid_layers\"s,\n \"extra_perimeters\"s, \"avoid_crossing_perimeters\"s, \"thin_walls\"s, \"overhangs\"s,\n \"seam_position\"s, \"external_perimeters_first\"s,\n \"fill_density\"s, \"fill_pattern\"s, \"top_infill_pattern\"s, \"bottom_infill_pattern\"s, \"fill_gaps\"s,\n \"infill_every_layers\"s, \"infill_only_where_needed\"s,\n \"solid_infill_every_layers\"s, \"fill_angle\"s, \"solid_infill_below_area\"s, \"\"s,\n \"only_retract_when_crossing_perimeters\"s, \"infill_first\"s,\n \"max_print_speed\"s, \"max_volumetric_speed\"s,\n \"perimeter_speed\"s, \"small_perimeter_speed\"s, \"external_perimeter_speed\"s, \"infill_speed\"s, \"\"s,\n \"solid_infill_speed\"s, \"top_solid_infill_speed\"s, \"support_material_speed\"s,\n \"support_material_interface_speed\"s, \"bridge_speed\"s, \"gap_fill_speed\"s,\n \"travel_speed\"s,\n \"first_layer_speed\"s,\n \"perimeter_acceleration\"s, \"infill_acceleration\"s, \"bridge_acceleration\"s,\n \"first_layer_acceleration\"s, \"default_acceleration\"s,\n \"skirts\"s, \"skirt_distance\"s, \"skirt_height\"s, \"min_skirt_length\"s,\n \"brim_connections_width\"s, \"brim_width\"s, \"interior_brim_width\"s,\n \"support_material\"s, \"support_material_threshold\"s, \"support_material_max_layers\"s, \"support_material_enforce_layers\"s,\n \"raft_layers\"s,\n \"support_material_pattern\"s, \"support_material_spacing\"s, \"support_material_angle\"s, \"\"s,\n \"support_material_interface_layers\"s, \"support_material_interface_spacing\"s,\n \"support_material_contact_distance\"s, \"support_material_buildplate_only\"s, \"dont_support_bridges\"s,\n \"notes\"s,\n \"complete_objects\"s, \"extruder_clearance_radius\"s, \"extruder_clearance_height\"s,\n \"gcode_comments\"s, \"output_filename_format\"s,\n \"post_process\"s,\n \"perimeter_extruder\"s, \"infill_extruder\"s, \"solid_infill_extruder\"s,\n \"support_material_extruder\"s, \"support_material_interface_extruder\"s,\n \"ooze_prevention\"s, \"standby_temperature_delta\"s,\n \"interface_shells\"s, \"regions_overlap\"s,\n \"extrusion_width\"s, \"first_layer_extrusion_width\"s, \"perimeter_extrusion_width\"s, \"\"s,\n \"external_perimeter_extrusion_width\"s, \"infill_extrusion_width\"s, \"solid_infill_extrusion_width\"s,\n \"top_infill_extrusion_width\"s, \"support_material_extrusion_width\"s,\n \"support_material_interface_extrusion_width\"s, \"infill_overlap\"s, \"bridge_flow_ratio\"s,\n \"xy_size_compensation\"s, \"resolution\"s, \"shortcuts\"s, \"compatible_printers\"s,\n \"print_settings_id\"s\n };\n }\n\n t_config_option_keys my_options() override { return PrintEditor::options(); }\n\nprotected:\n void _update() override;\n void _build() override;\n};\n\nclass PrinterEditor : public PresetEditor {\npublic:\n PrinterEditor(wxWindow* parent, t_config_option_keys options = {});\n PrinterEditor() : PrinterEditor(nullptr, {}) {};\n\n wxString title() override { return _(\"Printer Settings\"); }\n std::string name() override { return \"printer\"s; }\n static t_config_option_keys overridable_options() { return t_config_option_keys \n {\n \"pressure_advance\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s,\n \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s\n }; };\n static t_config_option_keys overriding_options() { return PresetEditor::overriding_options(); };\n\n t_config_option_keys my_overridable_options() override { return PrinterEditor::overridable_options(); };\n t_config_option_keys my_overriding_options() override { return PrinterEditor::overriding_options(); };\n\n \n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"bed_shape\"s, \"z_offset\"s, \"z_steps_per_mm\"s, \"has_heatbed\"s,\n \"gcode_flavor\"s, \"use_relative_e_distances\"s,\n \"serial_port\"s, \"serial_speed\"s,\n \"host_type\"s, \"print_host\"s, \"octoprint_apikey\"s,\n \"use_firmware_retraction\"s, \"pressure_advance\"s, \"vibration_limit\"s,\n \"use_volumetric_e\"s,\n \"start_gcode\"s, \"end_gcode\"s, \"before_layer_gcode\"s, \"layer_gcode\"s, \"toolchange_gcode\"s, \"between_objects_gcode\"s,\n \"nozzle_diameter\"s, \"extruder_offset\"s, \"min_layer_height\"s, \"max_layer_height\"s,\n \"retract_length\"s, \"retract_lift\"s, \"retract_speed\"s, \"retract_restart_extra\"s, \"retract_before_travel\"s, \"retract_layer_change\"s, \"wipe\"s,\n \"retract_length_toolchange\"s, \"retract_restart_extra_toolchange\"s, \"retract_lift_above\"s, \"retract_lift_below\"s,\n \"printer_settings_id\"s,\n \"printer_notes\"s,\n \"use_set_and_wait_bed\"s, \"use_set_and_wait_extruder\"s\n };\n }\n \n t_config_option_keys my_options() override { return PrinterEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"PrinterEditor\"s;} \/\/< Which log these messages should go to.\n};\n\nclass MaterialEditor : public PresetEditor {\npublic:\n\n wxString title() override { return _(\"Material Settings\"); }\n std::string name() override { return \"material\"s; }\n preset_t type() override { return preset_t::Material; }; \n int typeId() override { return static_cast(preset_t::Material); }; \n MaterialEditor(wxWindow* parent, t_config_option_keys options = {});\n MaterialEditor() : MaterialEditor(nullptr, {}) {};\n \n t_config_option_keys my_overridable_options() override { return PresetEditor::overridable_options(); };\n t_config_option_keys my_overriding_options() override { return PrinterEditor::overridable_options(); };\n\n static t_config_option_keys overriding_options() { return PrinterEditor::overridable_options(); };\n static t_config_option_keys overridable_options() { return PresetEditor::overridable_options(); };\n\n static t_config_option_keys options() {\n return t_config_option_keys\n {\n \"filament_colour\"s, \"filament_diameter\"s, \"filament_notes\"s, \"filament_max_volumetric_speed\"s, \"extrusion_multiplier\"s, \"filament_density\"s, \"filament_cost\"s,\n \"temperature\"s, \"first_layer_temperature\"s, \"bed_temperature\"s, \"first_layer_bed_temperature\"s,\n \"fan_always_on\"s, \"cooling\"s, \"compatible_printers\"s,\n \"min_fan_speed\"s, \"max_fan_speed\"s, \"bridge_fan_speed\"s, \"disable_fan_first_layers\"s,\n \"fan_below_layer_time\"s, \"slowdown_below_layer_time\"s, \"min_print_speed\"s,\n \"start_filament_gcode\"s, \"end_filament_gcode\"s,\n \"filament_settings_id\"s\n };\n }\n \n t_config_option_keys my_options() override { return MaterialEditor::options(); }\nprotected:\n void _update() override;\n void _build() override;\n const std::string LogChannel() override {return \"MaterialEditor\"s;} \/\/< Which log these messages should go to.\n};\n\n\n\n\nclass PresetPage : wxScrolledWindow {\npublic:\n PresetPage(wxWindow* parent, wxString _title, int _iconID) : \n wxScrolledWindow(parent, wxID_ANY, wxDefaultPosition, wxDefaultSize, wxTAB_TRAVERSAL),\n title(_title), iconID(_iconID) {\n this->vsizer = new wxBoxSizer(wxVERTICAL);\n this->SetSizer(this->vsizer);\n this->SetScrollRate(ui_settings->scroll_step(), ui_settings->scroll_step());\n }\nprotected:\n wxSizer* vsizer {nullptr};\n wxString title {\"\"};\n int iconID {0};\n};\n\n}} \/\/ namespace Slic3r::GUI\n#endif \/\/ PRESETEDITOR_HPP\n<|endoftext|>"} {"text":"\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/host_resolver.h\"\n\n#if defined(OS_WIN)\n#include \n#include \n#elif defined(OS_POSIX)\n#include \n#endif\n\n#include \n\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/ref_counted.h\"\n#include \"net\/base\/address_list.h\"\n#include \"net\/base\/completion_callback.h\"\n#include \"net\/base\/host_resolver_unittest.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing net::RuleBasedHostMapper;\nusing net::ScopedHostMapper;\nusing net::WaitingHostMapper;\n\nnamespace {\n\nclass HostResolverTest : public testing::Test {\n public:\n HostResolverTest()\n : callback_called_(false),\n ALLOW_THIS_IN_INITIALIZER_LIST(\n callback_(this, &HostResolverTest::OnLookupFinished)) {\n }\n\n protected:\n bool callback_called_;\n int callback_result_;\n net::CompletionCallbackImpl callback_;\n\n private:\n void OnLookupFinished(int result) {\n callback_called_ = true;\n callback_result_ = result;\n MessageLoop::current()->Quit();\n }\n};\n\nTEST_F(HostResolverTest, SynchronousLookup) {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AddRule(\"just.testing\", \"192.168.1.42\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist, NULL);\n EXPECT_EQ(net::OK, err);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0xc0a8012a) == sa_in->sin_addr.s_addr);\n}\n\nTEST_F(HostResolverTest, AsynchronousLookup) {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AddRule(\"just.testing\", \"192.168.1.42\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist,\n &callback_);\n EXPECT_EQ(net::ERR_IO_PENDING, err);\n\n MessageLoop::current()->Run();\n\n ASSERT_TRUE(callback_called_);\n ASSERT_EQ(net::OK, callback_result_);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0xc0a8012a) == sa_in->sin_addr.s_addr);\n}\n\nTEST_F(HostResolverTest, CanceledAsynchronousLookup) {\n scoped_refptr mapper = new WaitingHostMapper();\n ScopedHostMapper scoped_mapper(mapper.get());\n\n {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist,\n &callback_);\n EXPECT_EQ(net::ERR_IO_PENDING, err);\n\n \/\/ Make sure we will exit the queue even when callback is not called.\n MessageLoop::current()->PostDelayedTask(FROM_HERE,\n new MessageLoop::QuitTask(),\n 1000);\n MessageLoop::current()->Run();\n }\n\n mapper->Signal();\n\n EXPECT_FALSE(callback_called_);\n}\n\nTEST_F(HostResolverTest, NumericAddresses) {\n \/\/ Stevens says dotted quads with AI_UNSPEC resolve to a single sockaddr_in.\n\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 5555;\n int err = host_resolver.Resolve(\"127.0.0.1\", kPortnum, &adrlist, NULL);\n EXPECT_EQ(net::OK, err);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0x7f000001) == sa_in->sin_addr.s_addr);\n}\n\n} \/\/ namespace\nFix up some unit tests for HostResolver:\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"net\/base\/host_resolver.h\"\n\n#if defined(OS_WIN)\n#include \n#include \n#elif defined(OS_POSIX)\n#include \n#endif\n\n#include \n\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/ref_counted.h\"\n#include \"net\/base\/address_list.h\"\n#include \"net\/base\/completion_callback.h\"\n#include \"net\/base\/host_resolver_unittest.h\"\n#include \"net\/base\/net_errors.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing net::RuleBasedHostMapper;\nusing net::ScopedHostMapper;\nusing net::WaitingHostMapper;\n\nnamespace {\n\nclass HostResolverTest : public testing::Test {\n public:\n HostResolverTest()\n : callback_called_(false),\n ALLOW_THIS_IN_INITIALIZER_LIST(\n callback_(this, &HostResolverTest::OnLookupFinished)) {\n }\n\n protected:\n bool callback_called_;\n int callback_result_;\n net::CompletionCallbackImpl callback_;\n\n private:\n void OnLookupFinished(int result) {\n callback_called_ = true;\n callback_result_ = result;\n MessageLoop::current()->Quit();\n }\n};\n\nTEST_F(HostResolverTest, SynchronousLookup) {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AddRule(\"just.testing\", \"192.168.1.42\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist, NULL);\n EXPECT_EQ(net::OK, err);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0xc0a8012a) == sa_in->sin_addr.s_addr);\n}\n\nTEST_F(HostResolverTest, AsynchronousLookup) {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AddRule(\"just.testing\", \"192.168.1.42\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist,\n &callback_);\n EXPECT_EQ(net::ERR_IO_PENDING, err);\n\n MessageLoop::current()->Run();\n\n ASSERT_TRUE(callback_called_);\n ASSERT_EQ(net::OK, callback_result_);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0xc0a8012a) == sa_in->sin_addr.s_addr);\n}\n\nTEST_F(HostResolverTest, CanceledAsynchronousLookup) {\n scoped_refptr mapper = new WaitingHostMapper();\n ScopedHostMapper scoped_mapper(mapper.get());\n\n {\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 80;\n\n int err = host_resolver.Resolve(\"just.testing\", kPortnum, &adrlist,\n &callback_);\n EXPECT_EQ(net::ERR_IO_PENDING, err);\n\n \/\/ Make sure we will exit the queue even when callback is not called.\n MessageLoop::current()->PostDelayedTask(FROM_HERE,\n new MessageLoop::QuitTask(),\n 1000);\n MessageLoop::current()->Run();\n }\n\n mapper->Signal();\n\n EXPECT_FALSE(callback_called_);\n}\n\nTEST_F(HostResolverTest, NumericIPv4Address) {\n \/\/ Stevens says dotted quads with AI_UNSPEC resolve to a single sockaddr_in.\n\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AllowDirectLookup(\"*\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 5555;\n int err = host_resolver.Resolve(\"127.1.2.3\", kPortnum, &adrlist, NULL);\n EXPECT_EQ(net::OK, err);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in* sa_in = (const struct sockaddr_in*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in->sin_port);\n EXPECT_TRUE(htonl(0x7f010203) == sa_in->sin_addr.s_addr);\n}\n\nTEST_F(HostResolverTest, NumericIPv6Address) {\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AllowDirectLookup(\"*\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n \/\/ Resolve a plain IPv6 address. Don't worry about [brackets], because\n \/\/ the caller should have removed them.\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 5555;\n int err = host_resolver.Resolve(\"2001:db8::1\", kPortnum, &adrlist, NULL);\n \/\/ On computers without IPv6 support, getaddrinfo cannot convert IPv6\n \/\/ address literals to addresses (getaddrinfo returns EAI_NONAME). So this\n \/\/ test has to allow host_resolver.Resolve to fail.\n if (err == net::ERR_NAME_NOT_RESOLVED)\n return;\n EXPECT_EQ(net::OK, err);\n\n const struct addrinfo* ainfo = adrlist.head();\n EXPECT_EQ(static_cast(NULL), ainfo->ai_next);\n EXPECT_EQ(sizeof(struct sockaddr_in6), ainfo->ai_addrlen);\n\n const struct sockaddr* sa = ainfo->ai_addr;\n const struct sockaddr_in6* sa_in6 = (const struct sockaddr_in6*) sa;\n EXPECT_TRUE(htons(kPortnum) == sa_in6->sin6_port);\n\n const uint8 expect_addr[] = {\n 0x20, 0x01, 0x0d, 0xb8, 0x00, 0x00, 0x00, 0x00,\n 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01\n };\n for (int i = 0; i < 16; i++) {\n EXPECT_EQ(expect_addr[i], sa_in6->sin6_addr.s6_addr[i]);\n }\n}\n\nTEST_F(HostResolverTest, EmptyHost) {\n scoped_refptr mapper = new RuleBasedHostMapper();\n mapper->AllowDirectLookup(\"*\");\n ScopedHostMapper scoped_mapper(mapper.get());\n\n net::HostResolver host_resolver;\n net::AddressList adrlist;\n const int kPortnum = 5555;\n int err = host_resolver.Resolve(\"\", kPortnum, &adrlist, NULL);\n EXPECT_EQ(net::ERR_NAME_NOT_RESOLVED, err);\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"#include \"signverifymessagedialog.h\"\n#include \"ui_signverifymessagedialog.h\"\n\n#include \"addressbookpage.h\"\n#include \"base58.h\"\n#include \"guiutil.h\"\n#include \"init.h\"\n#include \"main.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n#include \"wallet.h\"\n\n#include \n#include \n\n#include \n\nSignVerifyMessageDialog::SignVerifyMessageDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::SignVerifyMessageDialog),\n model(0)\n{\n ui->setupUi(this);\n\n#if (QT_VERSION >= 0x040700)\n \/* Do not move this to the XML file, Qt before 4.7 will choke on it *\/\n ui->addressIn_SM->setPlaceholderText(tr(\"Enter a YaCoin address (e.g. 4Zo1ga6xuKuQ7JV7M9rGDoxdbYwV5zgQJ5)\"));\n ui->signatureOut_SM->setPlaceholderText(tr(\"Click \\\"Sign Message\\\" to generate signature\"));\n\n ui->addressIn_VM->setPlaceholderText(tr(\"Enter a YaCoin address (e.g. 4Zo1ga6xuKuQ7JV7M9rGDoxdbYwV5zgQJ5)\"));\n ui->signatureIn_VM->setPlaceholderText(tr(\"Enter YaCoin signature\"));\n#endif\n\n GUIUtil::setupAddressWidget(ui->addressIn_SM, this);\n GUIUtil::setupAddressWidget(ui->addressIn_VM, this);\n\n ui->addressIn_SM->installEventFilter(this);\n ui->messageIn_SM->installEventFilter(this);\n ui->signatureOut_SM->installEventFilter(this);\n ui->addressIn_VM->installEventFilter(this);\n ui->messageIn_VM->installEventFilter(this);\n ui->signatureIn_VM->installEventFilter(this);\n\n ui->signatureOut_SM->setFont(GUIUtil::bitcoinAddressFont());\n ui->signatureIn_VM->setFont(GUIUtil::bitcoinAddressFont());\n}\n\nSignVerifyMessageDialog::~SignVerifyMessageDialog()\n{\n delete ui;\n}\n\nvoid SignVerifyMessageDialog::setModel(WalletModel *model)\n{\n this->model = model;\n}\n\nvoid SignVerifyMessageDialog::setAddress_SM(QString address)\n{\n ui->addressIn_SM->setText(address);\n ui->messageIn_SM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::setAddress_VM(QString address)\n{\n ui->addressIn_VM->setText(address);\n ui->messageIn_VM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::showTab_SM(bool fShow)\n{\n ui->tabWidget->setCurrentIndex(0);\n\n if (fShow)\n this->show();\n}\n\nvoid SignVerifyMessageDialog::showTab_VM(bool fShow)\n{\n ui->tabWidget->setCurrentIndex(1);\n if (fShow)\n this->show();\n}\n\nvoid SignVerifyMessageDialog::on_addressBookButton_SM_clicked()\n{\n if (model && model->getAddressTableModel())\n {\n AddressBookPage dlg(AddressBookPage::ForSending, AddressBookPage::ReceivingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if (dlg.exec())\n {\n setAddress_SM(dlg.getReturnValue());\n }\n }\n}\n\nvoid SignVerifyMessageDialog::on_pasteButton_SM_clicked()\n{\n setAddress_SM(QApplication::clipboard()->text());\n}\n\nvoid SignVerifyMessageDialog::on_signMessageButton_SM_clicked()\n{\n \/* Clear old signature to ensure users don't get confused on error with an old signature displayed *\/\n ui->signatureOut_SM->clear();\n\n CBitcoinAddress addr(ui->addressIn_SM->text().toStdString());\n if (!addr.IsValid())\n {\n ui->addressIn_SM->setValid(false);\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"The entered address is invalid.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n CKeyID keyID;\n if (!addr.GetKeyID(keyID))\n {\n ui->addressIn_SM->setValid(false);\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"The entered address does not refer to a key.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n\n WalletModel::UnlockContext ctx(model->requestUnlock());\n if (!ctx.isValid())\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"Wallet unlock was cancelled.\"));\n return;\n }\n\n CKey key;\n if (!pwalletMain->GetKey(keyID, key))\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"Private key for the entered address is not available.\"));\n return;\n }\n\n CDataStream ss(SER_GETHASH, 0);\n ss << strMessageMagic;\n ss << ui->messageIn_SM->document()->toPlainText().toStdString();\n\n std::vector vchSig;\n if (!key.SignCompact(Hash(ss.begin(), ss.end()), vchSig))\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(QString(\"\") + tr(\"Message signing failed.\") + QString(\"<\/nobr>\"));\n return;\n }\n\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: green; }\");\n ui->statusLabel_SM->setText(QString(\"\") + tr(\"Message signed.\") + QString(\"<\/nobr>\"));\n\n ui->signatureOut_SM->setText(QString::fromStdString(EncodeBase64(&vchSig[0], vchSig.size())));\n}\n\nvoid SignVerifyMessageDialog::on_copySignatureButton_SM_clicked()\n{\n QApplication::clipboard()->setText(ui->signatureOut_SM->text());\n}\n\nvoid SignVerifyMessageDialog::on_clearButton_SM_clicked()\n{\n ui->addressIn_SM->clear();\n ui->messageIn_SM->clear();\n ui->signatureOut_SM->clear();\n ui->statusLabel_SM->clear();\n\n ui->addressIn_SM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::on_addressBookButton_VM_clicked()\n{\n if (model && model->getAddressTableModel())\n {\n AddressBookPage dlg(AddressBookPage::ForSending, AddressBookPage::SendingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if (dlg.exec())\n {\n setAddress_VM(dlg.getReturnValue());\n }\n }\n}\n\nvoid SignVerifyMessageDialog::on_verifyMessageButton_VM_clicked()\n{\n CBitcoinAddress addr(ui->addressIn_VM->text().toStdString());\n if (!addr.IsValid())\n {\n ui->addressIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The entered address is invalid.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n CKeyID keyID;\n if (!addr.GetKeyID(keyID))\n {\n ui->addressIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The entered address does not refer to a key.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n\n bool fInvalid = false;\n std::vector vchSig = DecodeBase64(ui->signatureIn_VM->text().toStdString().c_str(), &fInvalid);\n\n if (fInvalid)\n {\n ui->signatureIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The signature could not be decoded.\") + QString(\" \") + tr(\"Please check the signature and try again.\"));\n return;\n }\n\n CDataStream ss(SER_GETHASH, 0);\n ss << strMessageMagic;\n ss << ui->messageIn_VM->document()->toPlainText().toStdString();\n\n CKey key;\n if (!key.SetCompactSignature(Hash(ss.begin(), ss.end()), vchSig))\n {\n ui->signatureIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The signature did not match the message digest.\") + QString(\" \") + tr(\"Please check the signature and try again.\"));\n return;\n }\n\n if (!(CBitcoinAddress(key.GetPubKey().GetID()) == addr))\n {\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(QString(\"\") + tr(\"Message verification failed.\") + QString(\"<\/nobr>\"));\n return;\n }\n\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: green; }\");\n ui->statusLabel_VM->setText(QString(\"\") + tr(\"Message verified.\") + QString(\"<\/nobr>\"));\n}\n\nvoid SignVerifyMessageDialog::on_clearButton_VM_clicked()\n{\n ui->addressIn_VM->clear();\n ui->signatureIn_VM->clear();\n ui->messageIn_VM->clear();\n ui->statusLabel_VM->clear();\n\n ui->addressIn_VM->setFocus();\n}\n\nbool SignVerifyMessageDialog::eventFilter(QObject *object, QEvent *event)\n{\n if (event->type() == QEvent::MouseButtonPress || event->type() == QEvent::FocusIn)\n {\n if (ui->tabWidget->currentIndex() == 0)\n {\n \/* Clear status message on focus change *\/\n ui->statusLabel_SM->clear();\n\n \/* Select generated signature *\/\n if (object == ui->signatureOut_SM)\n {\n ui->signatureOut_SM->selectAll();\n return true;\n }\n }\n else if (ui->tabWidget->currentIndex() == 1)\n {\n \/* Clear status message on focus change *\/\n ui->statusLabel_VM->clear();\n }\n }\n return QDialog::eventFilter(object, event);\n}\nUpdate signverifymessagedialog.cpp#include \"signverifymessagedialog.h\"\n#include \"ui_signverifymessagedialog.h\"\n\n#include \"addressbookpage.h\"\n#include \"base58.h\"\n#include \"guiutil.h\"\n#include \"init.h\"\n#include \"main.h\"\n#include \"optionsmodel.h\"\n#include \"walletmodel.h\"\n#include \"wallet.h\"\n\n#include \n#include \n\n#include \n\nSignVerifyMessageDialog::SignVerifyMessageDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::SignVerifyMessageDialog),\n model(0)\n{\n ui->setupUi(this);\n\n#if (QT_VERSION >= 0x040700)\n \/* Do not move this to the XML file, Qt before 4.7 will choke on it *\/\n ui->addressIn_SM->setPlaceholderText(tr(\"Enter a YaCoin address (e.g. Y9H3tANhMroxU4rCre4bkoeDRhHKRSGwsi)\"));\n ui->signatureOut_SM->setPlaceholderText(tr(\"Click \\\"Sign Message\\\" to generate signature\"));\n\n ui->addressIn_VM->setPlaceholderText(tr(\"Enter a YaCoin address (e.g. Y9H3tANhMroxU4rCre4bkoeDRhHKRSGwsi)\"));\n ui->signatureIn_VM->setPlaceholderText(tr(\"Enter YaCoin signature\"));\n#endif\n\n GUIUtil::setupAddressWidget(ui->addressIn_SM, this);\n GUIUtil::setupAddressWidget(ui->addressIn_VM, this);\n\n ui->addressIn_SM->installEventFilter(this);\n ui->messageIn_SM->installEventFilter(this);\n ui->signatureOut_SM->installEventFilter(this);\n ui->addressIn_VM->installEventFilter(this);\n ui->messageIn_VM->installEventFilter(this);\n ui->signatureIn_VM->installEventFilter(this);\n\n ui->signatureOut_SM->setFont(GUIUtil::bitcoinAddressFont());\n ui->signatureIn_VM->setFont(GUIUtil::bitcoinAddressFont());\n}\n\nSignVerifyMessageDialog::~SignVerifyMessageDialog()\n{\n delete ui;\n}\n\nvoid SignVerifyMessageDialog::setModel(WalletModel *model)\n{\n this->model = model;\n}\n\nvoid SignVerifyMessageDialog::setAddress_SM(QString address)\n{\n ui->addressIn_SM->setText(address);\n ui->messageIn_SM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::setAddress_VM(QString address)\n{\n ui->addressIn_VM->setText(address);\n ui->messageIn_VM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::showTab_SM(bool fShow)\n{\n ui->tabWidget->setCurrentIndex(0);\n\n if (fShow)\n this->show();\n}\n\nvoid SignVerifyMessageDialog::showTab_VM(bool fShow)\n{\n ui->tabWidget->setCurrentIndex(1);\n if (fShow)\n this->show();\n}\n\nvoid SignVerifyMessageDialog::on_addressBookButton_SM_clicked()\n{\n if (model && model->getAddressTableModel())\n {\n AddressBookPage dlg(AddressBookPage::ForSending, AddressBookPage::ReceivingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if (dlg.exec())\n {\n setAddress_SM(dlg.getReturnValue());\n }\n }\n}\n\nvoid SignVerifyMessageDialog::on_pasteButton_SM_clicked()\n{\n setAddress_SM(QApplication::clipboard()->text());\n}\n\nvoid SignVerifyMessageDialog::on_signMessageButton_SM_clicked()\n{\n \/* Clear old signature to ensure users don't get confused on error with an old signature displayed *\/\n ui->signatureOut_SM->clear();\n\n CBitcoinAddress addr(ui->addressIn_SM->text().toStdString());\n if (!addr.IsValid())\n {\n ui->addressIn_SM->setValid(false);\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"The entered address is invalid.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n CKeyID keyID;\n if (!addr.GetKeyID(keyID))\n {\n ui->addressIn_SM->setValid(false);\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"The entered address does not refer to a key.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n\n WalletModel::UnlockContext ctx(model->requestUnlock());\n if (!ctx.isValid())\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"Wallet unlock was cancelled.\"));\n return;\n }\n\n CKey key;\n if (!pwalletMain->GetKey(keyID, key))\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(tr(\"Private key for the entered address is not available.\"));\n return;\n }\n\n CDataStream ss(SER_GETHASH, 0);\n ss << strMessageMagic;\n ss << ui->messageIn_SM->document()->toPlainText().toStdString();\n\n std::vector vchSig;\n if (!key.SignCompact(Hash(ss.begin(), ss.end()), vchSig))\n {\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_SM->setText(QString(\"\") + tr(\"Message signing failed.\") + QString(\"<\/nobr>\"));\n return;\n }\n\n ui->statusLabel_SM->setStyleSheet(\"QLabel { color: green; }\");\n ui->statusLabel_SM->setText(QString(\"\") + tr(\"Message signed.\") + QString(\"<\/nobr>\"));\n\n ui->signatureOut_SM->setText(QString::fromStdString(EncodeBase64(&vchSig[0], vchSig.size())));\n}\n\nvoid SignVerifyMessageDialog::on_copySignatureButton_SM_clicked()\n{\n QApplication::clipboard()->setText(ui->signatureOut_SM->text());\n}\n\nvoid SignVerifyMessageDialog::on_clearButton_SM_clicked()\n{\n ui->addressIn_SM->clear();\n ui->messageIn_SM->clear();\n ui->signatureOut_SM->clear();\n ui->statusLabel_SM->clear();\n\n ui->addressIn_SM->setFocus();\n}\n\nvoid SignVerifyMessageDialog::on_addressBookButton_VM_clicked()\n{\n if (model && model->getAddressTableModel())\n {\n AddressBookPage dlg(AddressBookPage::ForSending, AddressBookPage::SendingTab, this);\n dlg.setModel(model->getAddressTableModel());\n if (dlg.exec())\n {\n setAddress_VM(dlg.getReturnValue());\n }\n }\n}\n\nvoid SignVerifyMessageDialog::on_verifyMessageButton_VM_clicked()\n{\n CBitcoinAddress addr(ui->addressIn_VM->text().toStdString());\n if (!addr.IsValid())\n {\n ui->addressIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The entered address is invalid.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n CKeyID keyID;\n if (!addr.GetKeyID(keyID))\n {\n ui->addressIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The entered address does not refer to a key.\") + QString(\" \") + tr(\"Please check the address and try again.\"));\n return;\n }\n\n bool fInvalid = false;\n std::vector vchSig = DecodeBase64(ui->signatureIn_VM->text().toStdString().c_str(), &fInvalid);\n\n if (fInvalid)\n {\n ui->signatureIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The signature could not be decoded.\") + QString(\" \") + tr(\"Please check the signature and try again.\"));\n return;\n }\n\n CDataStream ss(SER_GETHASH, 0);\n ss << strMessageMagic;\n ss << ui->messageIn_VM->document()->toPlainText().toStdString();\n\n CKey key;\n if (!key.SetCompactSignature(Hash(ss.begin(), ss.end()), vchSig))\n {\n ui->signatureIn_VM->setValid(false);\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(tr(\"The signature did not match the message digest.\") + QString(\" \") + tr(\"Please check the signature and try again.\"));\n return;\n }\n\n if (!(CBitcoinAddress(key.GetPubKey().GetID()) == addr))\n {\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: red; }\");\n ui->statusLabel_VM->setText(QString(\"\") + tr(\"Message verification failed.\") + QString(\"<\/nobr>\"));\n return;\n }\n\n ui->statusLabel_VM->setStyleSheet(\"QLabel { color: green; }\");\n ui->statusLabel_VM->setText(QString(\"\") + tr(\"Message verified.\") + QString(\"<\/nobr>\"));\n}\n\nvoid SignVerifyMessageDialog::on_clearButton_VM_clicked()\n{\n ui->addressIn_VM->clear();\n ui->signatureIn_VM->clear();\n ui->messageIn_VM->clear();\n ui->statusLabel_VM->clear();\n\n ui->addressIn_VM->setFocus();\n}\n\nbool SignVerifyMessageDialog::eventFilter(QObject *object, QEvent *event)\n{\n if (event->type() == QEvent::MouseButtonPress || event->type() == QEvent::FocusIn)\n {\n if (ui->tabWidget->currentIndex() == 0)\n {\n \/* Clear status message on focus change *\/\n ui->statusLabel_SM->clear();\n\n \/* Select generated signature *\/\n if (object == ui->signatureOut_SM)\n {\n ui->signatureOut_SM->selectAll();\n return true;\n }\n }\n else if (ui->tabWidget->currentIndex() == 1)\n {\n \/* Clear status message on focus change *\/\n ui->statusLabel_VM->clear();\n }\n }\n return QDialog::eventFilter(object, event);\n}\n<|endoftext|>"} {"text":"\/*\n Copyright 2017 Thomas Krause \n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"precedence.h\"\n#include \/\/ for ListWrapper\n#include \/\/ for min, move\n#include \/\/ for pair\n#include \"annis\/db.h\" \/\/ for DB\n#include \"annis\/graphstorage\/graphstorage.h\" \/\/ for ReadableGraphStorage\n#include \"annis\/iterators.h\" \/\/ for EdgeIterator, AnnoIt\n#include \"annis\/operators\/operator.h\" \/\/ for Operator\n#include \"annis\/util\/helper.h\" \/\/ for TokenHelper\n\n\nusing namespace annis;\n\n\nPrecedence::Precedence(const DB &db, DB::GetGSFuncT getGraphStorageFunc, unsigned int minDistance, unsigned int maxDistance)\n : tokHelper(getGraphStorageFunc, db),\n gsOrder(getGraphStorageFunc(ComponentType::ORDERING, annis_ns, \"\")),\n gsLeft(getGraphStorageFunc(ComponentType::LEFT_TOKEN, annis_ns, \"\")),\n anyTokAnno(Init::initAnnotation(db.getTokStringID(), 0, db.getNamespaceStringID())),\n anyNodeAnno(Init::initAnnotation(db.getNodeNameStringID(), 0, db.getNamespaceStringID())),\n minDistance(minDistance), maxDistance(maxDistance)\n{\n}\n\nPrecedence::Precedence(const DB &db, DB::GetGSFuncT getGraphStorageFunc,\n std::string segmentation,\n unsigned int minDistance, unsigned int maxDistance)\n : tokHelper(getGraphStorageFunc, db),\n gsOrder(getGraphStorageFunc(ComponentType::ORDERING, annis_ns, segmentation)),\n gsLeft(getGraphStorageFunc(ComponentType::LEFT_TOKEN, annis_ns, \"\")),\n anyTokAnno(Init::initAnnotation(db.getTokStringID(), 0, db.getNamespaceStringID())),\n anyNodeAnno(Init::initAnnotation(db.getNodeNameStringID(), 0, db.getNamespaceStringID())),\n minDistance(minDistance), maxDistance(maxDistance),\n segmentation(segmentation)\n{\n}\n\nstd::unique_ptr Precedence::retrieveMatches(const Match &lhs)\n{\n std::unique_ptr w = std::unique_ptr(new ListWrapper());\n\n std::unique_ptr edgeIterator;\n nodeid_t startNode;\n if(segmentation)\n {\n startNode = lhs.node;\n }\n else\n {\n startNode = tokHelper.rightTokenForNode(lhs.node);\n }\n\n edgeIterator = gsOrder->findConnected(startNode,\n minDistance, maxDistance);\n \/\/ materialize a list of all matches and wrap it\n for(std::pair matchedToken = edgeIterator->next();\n matchedToken.first; matchedToken = edgeIterator->next())\n {\n \/\/ get all nodes that are left-aligned to this token\n for(const auto& n : gsLeft->getOutgoingEdges(matchedToken.second))\n {\n w->addMatch(Init::initMatch(anyNodeAnno, n));\n }\n \/\/ add the actual token to the list as well\n w->addMatch(Init::initMatch(anyNodeAnno, matchedToken.second));\n }\n\n return std::move(w);\n}\n\nbool Precedence::filter(const Match &lhs, const Match &rhs)\n{\n nodeid_t startNode;\n nodeid_t endNode;\n if(segmentation)\n {\n startNode = lhs.node;\n endNode = rhs.node;\n }\n else\n {\n startNode = tokHelper.rightTokenForNode(lhs.node);\n endNode = tokHelper.leftTokenForNode(rhs.node);\n }\n\n if(gsOrder->isConnected(Init::initEdge(startNode, endNode),\n minDistance, maxDistance))\n {\n return true;\n }\n return false;\n\n}\n\nstd::string Precedence::description() \n{\n if(minDistance == 1 && maxDistance == 1)\n {\n if(segmentation)\n {\n return \".\" + *segmentation;\n }\n else\n {\n return \".\";\n }\n }\n else if(minDistance == 0 && maxDistance == 0)\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \"*\";\n }\n else\n {\n return \".*\";\n }\n }\n else if(minDistance == maxDistance)\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \",\" + std::to_string(minDistance);\n }\n else\n {\n return \".\" + std::to_string(minDistance);\n }\n }\n else\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \",\" + std::to_string(minDistance) + \",\" + std::to_string(maxDistance);\n }\n else\n {\n return \".\" + std::to_string(minDistance) + \",\" + std::to_string(maxDistance);\n }\n }\n}\n\ndouble Precedence::selectivity() \n{\n if(gsOrder == nullptr)\n {\n return Operator::selectivity();\n }\n \n GraphStatistic stats = gsOrder->getStatistics();\n unsigned int maxPossibleDist = std::min(maxDistance, stats.maxDepth);\n unsigned int numOfDescendants = maxPossibleDist - minDistance + 1;\n return (double) numOfDescendants \/ (double) (stats.nodes\/2);\n}\n\n\nPrecedence::~Precedence()\n{\n\n}\nOnly search for precedence if the specific graph storage component exists.\/*\n Copyright 2017 Thomas Krause \n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"precedence.h\"\n#include \/\/ for ListWrapper\n#include \/\/ for min, move\n#include \/\/ for pair\n#include \"annis\/db.h\" \/\/ for DB\n#include \"annis\/graphstorage\/graphstorage.h\" \/\/ for ReadableGraphStorage\n#include \"annis\/iterators.h\" \/\/ for EdgeIterator, AnnoIt\n#include \"annis\/operators\/operator.h\" \/\/ for Operator\n#include \"annis\/util\/helper.h\" \/\/ for TokenHelper\n\n\nusing namespace annis;\n\n\nPrecedence::Precedence(const DB &db, DB::GetGSFuncT getGraphStorageFunc, unsigned int minDistance, unsigned int maxDistance)\n : tokHelper(getGraphStorageFunc, db),\n gsOrder(getGraphStorageFunc(ComponentType::ORDERING, annis_ns, \"\")),\n gsLeft(getGraphStorageFunc(ComponentType::LEFT_TOKEN, annis_ns, \"\")),\n anyTokAnno(Init::initAnnotation(db.getTokStringID(), 0, db.getNamespaceStringID())),\n anyNodeAnno(Init::initAnnotation(db.getNodeNameStringID(), 0, db.getNamespaceStringID())),\n minDistance(minDistance), maxDistance(maxDistance)\n{\n}\n\nPrecedence::Precedence(const DB &db, DB::GetGSFuncT getGraphStorageFunc,\n std::string segmentation,\n unsigned int minDistance, unsigned int maxDistance)\n : tokHelper(getGraphStorageFunc, db),\n gsOrder(getGraphStorageFunc(ComponentType::ORDERING, annis_ns, segmentation)),\n gsLeft(getGraphStorageFunc(ComponentType::LEFT_TOKEN, annis_ns, \"\")),\n anyTokAnno(Init::initAnnotation(db.getTokStringID(), 0, db.getNamespaceStringID())),\n anyNodeAnno(Init::initAnnotation(db.getNodeNameStringID(), 0, db.getNamespaceStringID())),\n minDistance(minDistance), maxDistance(maxDistance),\n segmentation(segmentation)\n{\n}\n\nstd::unique_ptr Precedence::retrieveMatches(const Match &lhs)\n{\n std::unique_ptr w = std::unique_ptr(new ListWrapper());\n\n if(gsOrder)\n {\n std::unique_ptr edgeIterator;\n nodeid_t startNode;\n if(segmentation)\n {\n startNode = lhs.node;\n }\n else\n {\n startNode = tokHelper.rightTokenForNode(lhs.node);\n }\n\n edgeIterator = gsOrder->findConnected(startNode,\n minDistance, maxDistance);\n \/\/ materialize a list of all matches and wrap it\n for(std::pair matchedToken = edgeIterator->next();\n matchedToken.first; matchedToken = edgeIterator->next())\n {\n \/\/ get all nodes that are left-aligned to this token\n for(const auto& n : gsLeft->getOutgoingEdges(matchedToken.second))\n {\n w->addMatch(Init::initMatch(anyNodeAnno, n));\n }\n \/\/ add the actual token to the list as well\n w->addMatch(Init::initMatch(anyNodeAnno, matchedToken.second));\n }\n }\n\n return std::move(w);\n}\n\nbool Precedence::filter(const Match &lhs, const Match &rhs)\n{\n nodeid_t startNode;\n nodeid_t endNode;\n if(segmentation)\n {\n startNode = lhs.node;\n endNode = rhs.node;\n }\n else\n {\n startNode = tokHelper.rightTokenForNode(lhs.node);\n endNode = tokHelper.leftTokenForNode(rhs.node);\n }\n\n if(gsOrder->isConnected(Init::initEdge(startNode, endNode),\n minDistance, maxDistance))\n {\n return true;\n }\n return false;\n\n}\n\nstd::string Precedence::description() \n{\n if(minDistance == 1 && maxDistance == 1)\n {\n if(segmentation)\n {\n return \".\" + *segmentation;\n }\n else\n {\n return \".\";\n }\n }\n else if(minDistance == 0 && maxDistance == 0)\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \"*\";\n }\n else\n {\n return \".*\";\n }\n }\n else if(minDistance == maxDistance)\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \",\" + std::to_string(minDistance);\n }\n else\n {\n return \".\" + std::to_string(minDistance);\n }\n }\n else\n {\n if(segmentation)\n {\n return \".\" + *segmentation + \",\" + std::to_string(minDistance) + \",\" + std::to_string(maxDistance);\n }\n else\n {\n return \".\" + std::to_string(minDistance) + \",\" + std::to_string(maxDistance);\n }\n }\n}\n\ndouble Precedence::selectivity() \n{\n if(gsOrder == nullptr)\n {\n return Operator::selectivity();\n }\n \n GraphStatistic stats = gsOrder->getStatistics();\n unsigned int maxPossibleDist = std::min(maxDistance, stats.maxDepth);\n unsigned int numOfDescendants = maxPossibleDist - minDistance + 1;\n return (double) numOfDescendants \/ (double) (stats.nodes\/2);\n}\n\n\nPrecedence::~Precedence()\n{\n\n}\n<|endoftext|>"} {"text":"#include \"xchainer\/context.h\"\n\n#include \n#include \n\n#include \n#include \n\n#include \"xchainer\/backend.h\"\n#include \"xchainer\/device.h\"\n#include \"xchainer\/native\/native_backend.h\"\n#include \"xchainer\/native\/native_device.h\"\n#include \"xchainer\/testing\/threading.h\"\n\nnamespace xchainer {\nnamespace {\n\nTEST(ContextTest, Ctor) {\n Context(); \/\/ no throw\n}\n\nTEST(ContextTest, GetBackend) {\n Context ctx;\n Backend& backend = ctx.GetBackend(\"native\");\n EXPECT_EQ(&backend, &ctx.GetBackend(\"native\"));\n}\n\nTEST(ContextTest, NativeBackend) {\n Context ctx;\n native::NativeBackend& backend = ctx.GetNativeBackend();\n EXPECT_EQ(&ctx.GetBackend(\"native\"), &backend);\n}\n\nTEST(ContextTest, GetBackendThreadSafe) {\n static constexpr size_t kRepeat = 1;\n static constexpr size_t kThreadCount = 2;\n std::string backend_name{\"native\"};\n\n xchainer::testing::CheckThreadSafety(\n kRepeat,\n kThreadCount,\n [](size_t \/*repeat*\/) { return std::make_unique(); },\n [&backend_name](size_t \/*thread_index*\/, const std::unique_ptr& ctx) {\n Backend& backend = ctx->GetBackend(backend_name);\n return &backend;\n },\n [&backend_name](const std::vector& results) {\n for (Backend* backend : results) {\n ASSERT_EQ(backend, results.front());\n ASSERT_EQ(backend_name, backend->GetName());\n }\n });\n}\n\nTEST(ContextTest, BackendNotFound) {\n Context ctx;\n EXPECT_THROW(ctx.GetBackend(\"something_that_does_not_exist\"), BackendError);\n}\n\nTEST(ContextTest, GetDevice) {\n Context ctx;\n Device& device = ctx.GetDevice({\"native\", 0});\n EXPECT_EQ(&device, &ctx.GetDevice({\"native:0\"}));\n}\n\nTEST(ContextTest, GetDeviceThreadSafe) {\n static constexpr size_t kRepeat = 1;\n static constexpr int kDeviceCount = 4;\n static constexpr size_t kThreadCountPerDevice = 2;\n static constexpr size_t kThreadCount = kDeviceCount * kThreadCountPerDevice;\n\n xchainer::testing::CheckThreadSafety(\n kRepeat,\n kThreadCount,\n [](size_t \/*repeat*\/) { return std::make_unique(); },\n [](size_t thread_index, const std::unique_ptr& ctx) {\n int device_index = thread_index \/ kThreadCountPerDevice;\n Device& device = ctx->GetDevice({\"native\", device_index});\n return &device;\n },\n [](const std::vector& results) {\n \/\/ Check device pointers are identical within each set of threads corresponding to one device\n for (int device_index = 0; device_index < kDeviceCount; ++device_index) {\n auto it_first = std::next(results.begin(), device_index * kThreadCountPerDevice);\n auto it_last = std::next(results.begin(), (device_index + 1) * kThreadCountPerDevice);\n Device* ref_device = *it_first;\n\n \/\/ Check the device index\n ASSERT_EQ(device_index, ref_device->index());\n\n for (auto it = it_first; it != it_last; ++it) {\n ASSERT_EQ(ref_device, *it);\n }\n }\n });\n}\n\nTEST(ContextTest, DefaultContext) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n ASSERT_THROW(GetDefaultContext(), XchainerError);\n\n Context ctx;\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetDefaultContext());\n\n Context global_ctx;\n SetGlobalDefaultContext(&global_ctx);\n SetDefaultContext(nullptr);\n ASSERT_EQ(&global_ctx, &GetDefaultContext());\n\n SetGlobalDefaultContext(&global_ctx);\n SetDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetDefaultContext());\n}\n\nTEST(ContextTest, DefaultContextThreadSafe) {\n static constexpr size_t kRepeat = 1;\n static constexpr size_t kThreadCount = 2;\n\n xchainer::testing::CheckThreadSafety(\n kRepeat,\n kThreadCount,\n [](size_t \/*repeat*\/) { return nullptr; },\n [](size_t \/*thread_index*\/, std::nullptr_t) {\n Context ctx{};\n SetDefaultContext(&ctx);\n Context& ctx2 = GetDefaultContext();\n EXPECT_EQ(&ctx, &ctx2);\n return nullptr;\n },\n [](const std::vector& \/*results*\/) {});\n}\n\nTEST(ContextTest, GlobalDefaultContextThreadSafe) {\n static constexpr size_t kRepeat = 1;\n static constexpr size_t kThreadCount = 2;\n\n \/\/ Each of SetGlobalDefaultContext() and GetGlobalDefaultContext() must be thread-safe, but a pair of these calls is not guaranteed to\n \/\/ be so. In this check, a single context is set as the global context simultaneously in many threads and it only checks that\n \/\/ the succeeding Get...() call returns the same instance.\n xchainer::testing::CheckThreadSafety(\n kRepeat,\n kThreadCount,\n [](size_t \/*repeat*\/) { return std::make_unique(); },\n [](size_t \/*thread_index*\/, const std::unique_ptr& ctx) {\n SetGlobalDefaultContext(ctx.get());\n Context& ctx2 = GetGlobalDefaultContext();\n EXPECT_EQ(ctx.get(), &ctx2);\n return nullptr;\n },\n [](const std::vector& \/*results*\/) {});\n}\n\nTEST(ContextTest, GlobalDefaultContext) {\n SetGlobalDefaultContext(nullptr);\n ASSERT_THROW(GetGlobalDefaultContext(), XchainerError);\n\n Context ctx;\n SetGlobalDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetGlobalDefaultContext());\n}\n\nTEST(ContextTest, ThreadLocal) {\n Context ctx;\n SetDefaultContext(&ctx);\n\n Context ctx2;\n auto future = std::async(std::launch::async, [&ctx2] {\n SetDefaultContext(&ctx2);\n return &GetDefaultContext();\n });\n ASSERT_NE(&GetDefaultContext(), future.get());\n}\n\nTEST(ContextTest, ContextScopeCtor) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n Context ctx1;\n {\n \/\/ ContextScope should work even if default context is not set\n ContextScope scope(ctx1);\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n }\n ASSERT_THROW(GetDefaultContext(), XchainerError);\n SetDefaultContext(&ctx1);\n {\n Context ctx2;\n ContextScope scope(ctx2);\n EXPECT_EQ(&ctx2, &GetDefaultContext());\n }\n ASSERT_EQ(&ctx1, &GetDefaultContext());\n {\n ContextScope scope;\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n Context ctx2;\n SetDefaultContext(&ctx2);\n }\n ASSERT_EQ(&ctx1, &GetDefaultContext());\n Context ctx2;\n {\n ContextScope scope(ctx2);\n scope.Exit();\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n SetDefaultContext(&ctx2);\n \/\/ not recovered here because the scope has already existed\n }\n ASSERT_EQ(&ctx2, &GetDefaultContext());\n}\n\nTEST(ContextTest, ContextScopeResetDevice) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n Context ctx1;\n Context ctx2;\n {\n ContextScope ctx_scope1{ctx1};\n Device& device1 = ctx1.GetDevice({\"native\", 0});\n DeviceScope dev_scope1{device1};\n\n {\n ContextScope ctx_scope2{ctx2};\n ASSERT_NE(&device1, &GetDefaultDevice());\n Device& device2 = ctx2.GetDevice({\"native\", 0});\n SetDefaultDevice(&device2);\n }\n\n EXPECT_EQ(&device1, &GetDefaultDevice());\n }\n}\n\nTEST(ContextTest, UserDefinedBackend) {\n ::setenv(\"XCHAINER_PATH\", XCHAINER_TEST_DIR \"\/context_testdata\", 1);\n Context ctx;\n Backend& backend0 = ctx.GetBackend(\"backend0\");\n EXPECT_EQ(\"backend0\", backend0.GetName());\n Backend& backend0_2 = ctx.GetBackend(\"backend0\");\n EXPECT_EQ(&backend0, &backend0_2);\n Backend& backend1 = ctx.GetBackend(\"backend1\");\n EXPECT_EQ(\"backend1\", backend1.GetName());\n\n Device& device0 = ctx.GetDevice(std::string(\"backend0:0\"));\n EXPECT_EQ(&backend0, &device0.backend());\n}\n\nTEST(ContextTest, GetBackendOnDefaultContext) {\n \/\/ xchainer::GetBackend\n Context ctx;\n SetDefaultContext(&ctx);\n Backend& backend = GetBackend(\"native\");\n EXPECT_EQ(&ctx, &backend.context());\n EXPECT_EQ(\"native\", backend.GetName());\n}\n\nTEST(ContextTest, GetNativeBackendOnDefaultContext) {\n \/\/ xchainer::GetNativeBackend\n Context ctx;\n SetDefaultContext(&ctx);\n native::NativeBackend& backend = GetNativeBackend();\n EXPECT_EQ(&ctx.GetNativeBackend(), &backend);\n}\n\nTEST(ContextTest, GetDeviceOnDefaultContext) {\n \/\/ xchainer::GetDevice\n Context ctx;\n SetDefaultContext(&ctx);\n Device& device = GetDevice({\"native:0\"});\n EXPECT_EQ(&ctx, &device.backend().context());\n EXPECT_EQ(\"native:0\", device.name());\n}\n\n} \/\/ namespace\n} \/\/ namespace xchainer\ncontext_test.cc: remove using CheckThreadSafety#include \"xchainer\/context.h\"\n\n#include \n#include \n#include \n\n#include \n#include \n\n#include \"xchainer\/backend.h\"\n#include \"xchainer\/device.h\"\n#include \"xchainer\/native\/native_backend.h\"\n#include \"xchainer\/native\/native_device.h\"\n#include \"xchainer\/testing\/threading.h\"\n\nnamespace xchainer {\nnamespace {\n\nTEST(ContextTest, Ctor) {\n Context(); \/\/ no throw\n}\n\nTEST(ContextTest, GetBackend) {\n Context ctx;\n Backend& backend = ctx.GetBackend(\"native\");\n EXPECT_EQ(&backend, &ctx.GetBackend(\"native\"));\n}\n\nTEST(ContextTest, NativeBackend) {\n Context ctx;\n native::NativeBackend& backend = ctx.GetNativeBackend();\n EXPECT_EQ(&ctx.GetBackend(\"native\"), &backend);\n}\n\nTEST(ContextTest, GetBackendThreadSafe) {\n static constexpr size_t kThreadCount = 2;\n Context ctx{};\n std::string backend_name{\"native\"};\n\n std::vector backends = testing::RunThreads(kThreadCount, [&ctx, &backend_name](size_t \/*thread_index*\/) {\n Backend& backend = ctx.GetBackend(backend_name);\n return &backend;\n });\n for (Backend* backend : backends) {\n ASSERT_EQ(backend, backends.front());\n ASSERT_EQ(backend_name, backend->GetName());\n }\n}\n\nTEST(ContextTest, BackendNotFound) {\n Context ctx;\n EXPECT_THROW(ctx.GetBackend(\"something_that_does_not_exist\"), BackendError);\n}\n\nTEST(ContextTest, GetDevice) {\n Context ctx;\n Device& device = ctx.GetDevice({\"native\", 0});\n EXPECT_EQ(&device, &ctx.GetDevice({\"native:0\"}));\n}\n\nTEST(ContextTest, GetDeviceThreadSafe) {\n static constexpr int kDeviceCount = 4;\n static constexpr size_t kThreadCountPerDevice = 2;\n static constexpr size_t kThreadCount = kDeviceCount * kThreadCountPerDevice;\n Context ctx{};\n\n std::vector devices = testing::RunThreads(kThreadCount, [&ctx](size_t thread_index) {\n int device_index = thread_index \/ kThreadCountPerDevice;\n Device& device = ctx.GetDevice({\"native\", device_index});\n return &device;\n });\n \/\/ Check device pointers are identical within each set of threads corresponding to one device\n for (int device_index = 0; device_index < kDeviceCount; ++device_index) {\n auto it_first = std::next(devices.begin(), device_index * kThreadCountPerDevice);\n auto it_last = std::next(devices.begin(), (device_index + 1) * kThreadCountPerDevice);\n Device* ref_device = *it_first;\n\n \/\/ Check the device index\n ASSERT_EQ(device_index, ref_device->index());\n\n for (auto it = it_first; it != it_last; ++it) {\n ASSERT_EQ(ref_device, *it);\n }\n }\n}\n\nTEST(ContextTest, DefaultContext) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n ASSERT_THROW(GetDefaultContext(), XchainerError);\n\n Context ctx;\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetDefaultContext());\n\n Context global_ctx;\n SetGlobalDefaultContext(&global_ctx);\n SetDefaultContext(nullptr);\n ASSERT_EQ(&global_ctx, &GetDefaultContext());\n\n SetGlobalDefaultContext(&global_ctx);\n SetDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetDefaultContext());\n}\n\nTEST(ContextTest, DefaultContextThreadSafe) {\n static constexpr int kThreadCount = 2;\n\n testing::RunThreads(kThreadCount, [](size_t \/*thread_index*\/) {\n Context ctx{};\n SetDefaultContext(&ctx);\n Context& ctx2 = GetDefaultContext();\n EXPECT_EQ(&ctx, &ctx2);\n return nullptr;\n });\n}\n\nTEST(ContextTest, GlobalDefaultContextThreadSafe) {\n static constexpr int kThreadCount = 2;\n Context ctx{};\n\n \/\/ Each of SetGlobalDefaultContext() and GetGlobalDefaultContext() must be thread-safe, but a pair of these calls is not guaranteed\n \/\/ to be so. In this check, a single context is set as the global context simultaneously in many threads and it only checks that the\n \/\/ succeeding Get...() call returns the same instance.\n testing::RunThreads(kThreadCount, [&ctx](size_t \/*thread_index*\/) {\n SetGlobalDefaultContext(&ctx);\n Context& ctx2 = GetGlobalDefaultContext();\n EXPECT_EQ(&ctx, &ctx2);\n return nullptr;\n });\n}\n\nTEST(ContextTest, GlobalDefaultContext) {\n SetGlobalDefaultContext(nullptr);\n ASSERT_THROW(GetGlobalDefaultContext(), XchainerError);\n\n Context ctx;\n SetGlobalDefaultContext(&ctx);\n ASSERT_EQ(&ctx, &GetGlobalDefaultContext());\n}\n\nTEST(ContextTest, ThreadLocal) {\n Context ctx;\n SetDefaultContext(&ctx);\n\n Context ctx2;\n auto future = std::async(std::launch::async, [&ctx2] {\n SetDefaultContext(&ctx2);\n return &GetDefaultContext();\n });\n ASSERT_NE(&GetDefaultContext(), future.get());\n}\n\nTEST(ContextTest, ContextScopeCtor) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n Context ctx1;\n {\n \/\/ ContextScope should work even if default context is not set\n ContextScope scope(ctx1);\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n }\n ASSERT_THROW(GetDefaultContext(), XchainerError);\n SetDefaultContext(&ctx1);\n {\n Context ctx2;\n ContextScope scope(ctx2);\n EXPECT_EQ(&ctx2, &GetDefaultContext());\n }\n ASSERT_EQ(&ctx1, &GetDefaultContext());\n {\n ContextScope scope;\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n Context ctx2;\n SetDefaultContext(&ctx2);\n }\n ASSERT_EQ(&ctx1, &GetDefaultContext());\n Context ctx2;\n {\n ContextScope scope(ctx2);\n scope.Exit();\n EXPECT_EQ(&ctx1, &GetDefaultContext());\n SetDefaultContext(&ctx2);\n \/\/ not recovered here because the scope has already existed\n }\n ASSERT_EQ(&ctx2, &GetDefaultContext());\n}\n\nTEST(ContextTest, ContextScopeResetDevice) {\n SetGlobalDefaultContext(nullptr);\n SetDefaultContext(nullptr);\n Context ctx1;\n Context ctx2;\n {\n ContextScope ctx_scope1{ctx1};\n Device& device1 = ctx1.GetDevice({\"native\", 0});\n DeviceScope dev_scope1{device1};\n\n {\n ContextScope ctx_scope2{ctx2};\n ASSERT_NE(&device1, &GetDefaultDevice());\n Device& device2 = ctx2.GetDevice({\"native\", 0});\n SetDefaultDevice(&device2);\n }\n\n EXPECT_EQ(&device1, &GetDefaultDevice());\n }\n}\n\nTEST(ContextTest, UserDefinedBackend) {\n ::setenv(\"XCHAINER_PATH\", XCHAINER_TEST_DIR \"\/context_testdata\", 1);\n Context ctx;\n Backend& backend0 = ctx.GetBackend(\"backend0\");\n EXPECT_EQ(\"backend0\", backend0.GetName());\n Backend& backend0_2 = ctx.GetBackend(\"backend0\");\n EXPECT_EQ(&backend0, &backend0_2);\n Backend& backend1 = ctx.GetBackend(\"backend1\");\n EXPECT_EQ(\"backend1\", backend1.GetName());\n\n Device& device0 = ctx.GetDevice(std::string(\"backend0:0\"));\n EXPECT_EQ(&backend0, &device0.backend());\n}\n\nTEST(ContextTest, GetBackendOnDefaultContext) {\n \/\/ xchainer::GetBackend\n Context ctx;\n SetDefaultContext(&ctx);\n Backend& backend = GetBackend(\"native\");\n EXPECT_EQ(&ctx, &backend.context());\n EXPECT_EQ(\"native\", backend.GetName());\n}\n\nTEST(ContextTest, GetNativeBackendOnDefaultContext) {\n \/\/ xchainer::GetNativeBackend\n Context ctx;\n SetDefaultContext(&ctx);\n native::NativeBackend& backend = GetNativeBackend();\n EXPECT_EQ(&ctx.GetNativeBackend(), &backend);\n}\n\nTEST(ContextTest, GetDeviceOnDefaultContext) {\n \/\/ xchainer::GetDevice\n Context ctx;\n SetDefaultContext(&ctx);\n Device& device = GetDevice({\"native:0\"});\n EXPECT_EQ(&ctx, &device.backend().context());\n EXPECT_EQ(\"native:0\", device.name());\n}\n\n} \/\/ namespace\n} \/\/ namespace xchainer\n<|endoftext|>"} {"text":"#include \"xchainer\/python\/array.h\"\n\n#include \n#include \n\n#include \n#include \n\n#include \"xchainer\/array.h\"\n#include \"xchainer\/dtype.h\"\n#include \"xchainer\/error.h\"\n\n#include \"xchainer\/python\/common.h\"\n\nnamespace xchainer {\n\nnamespace py = pybind11;\n\nnamespace {\n\nusing ArrayBodyPtr = std::shared_ptr;\nusing ConstArrayBodyPtr = std::shared_ptr;\n\nDtype NumpyDtypeToDtype(const py::dtype& npdtype) {\n switch (npdtype.kind()) {\n case 'b':\n return Dtype::kBool;\n case 'i':\n switch (npdtype.itemsize()) {\n case 1:\n return Dtype::kInt8;\n case 2:\n return Dtype::kInt16;\n case 4:\n return Dtype::kInt32;\n case 8:\n return Dtype::kInt64;\n default:\n break;\n }\n break;\n case 'u':\n switch (npdtype.itemsize()) {\n case 1:\n return Dtype::kUInt8;\n default:\n break;\n }\n break;\n case 'f':\n switch (npdtype.itemsize()) {\n case 4:\n return Dtype::kFloat32;\n case 8:\n return Dtype::kFloat64;\n default:\n break;\n }\n break;\n default:\n break;\n }\n throw DtypeError(\"unsupported NumPy dtype\");\n}\n\nArrayBodyPtr MakeArray(const Shape& shape, Dtype dtype, py::list list) {\n auto total_size = shape.total_size();\n auto bytes = GetElementSize(dtype) * total_size;\n if (static_cast(total_size) != list.size()) {\n throw DimensionError(\"Invalid data length\");\n }\n\n \/\/ Allocate a buffer and copy data\n std::shared_ptr ptr = std::make_unique(bytes);\n VisitDtype(dtype, [&](auto pt) {\n using T = typename decltype(pt)::type;\n std::transform(list.begin(), list.end(), static_cast(ptr.get()), [](auto& item) { return py::cast(item); });\n });\n return Array::FromBuffer(shape, dtype, ptr).move_body();\n}\n\nArrayBodyPtr MakeArray(py::array array) {\n if ((array.flags() & py::array::c_style) == 0) {\n throw DimensionError(\"cannot convert non-contiguous NumPy array to Array\");\n }\n\n Dtype dtype = NumpyDtypeToDtype(array.dtype());\n py::buffer_info info = array.request();\n Shape shape(info.shape);\n\n \/\/ data holds the copy of py::array which in turn references the NumPy array and the buffer is therefore not released\n std::shared_ptr data(std::make_shared(std::move(array)), array.mutable_data());\n\n return Array::FromBuffer(shape, dtype, data).move_body();\n}\n\npy::buffer_info MakeNumpyArrayFromArray(internal::ArrayBody& self) {\n \/\/ Used as a temporary accessor\n Array array{std::move(ArrayBodyPtr(&self, [](internal::ArrayBody* ptr) {\n (void)ptr; \/\/ unused\n }))};\n\n if (!array.is_contiguous()) {\n throw DimensionError(\"cannot convert non-contiguous Array to NumPy array\");\n }\n\n int64_t itemsize{GetElementSize(array.dtype())};\n const Shape& shape = array.shape();\n\n \/\/ compute C-contiguous strides\n size_t ndim = array.ndim();\n std::vector strides(ndim);\n if (ndim > 0) {\n std::partial_sum(shape.crbegin(), shape.crend() - 1, strides.rbegin() + 1, std::multiplies());\n strides.back() = 1;\n std::transform(strides.crbegin(), strides.crend(), strides.rbegin(), [&itemsize](size_t item) { return item * itemsize; });\n }\n\n return py::buffer_info(array.data().get(), itemsize, std::string(1, GetCharCode(array.dtype())), ndim, shape, strides);\n}\n\n} \/\/ namespace\n\nvoid InitXchainerArray(pybind11::module& m) {\n py::class_{m, \"Array\", py::buffer_protocol()}\n .def(py::init(py::overload_cast(&MakeArray)))\n .def(py::init(py::overload_cast(&MakeArray)))\n .def_buffer(&MakeNumpyArrayFromArray)\n .def(\"view\",\n [](const ArrayBodyPtr& self) {\n \/\/ Duplicate the array body\n return std::make_shared(*self);\n })\n .def(\"__iadd__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} += Array{rhs}).move_body(); })\n .def(\"__imul__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} *= Array{rhs}).move_body(); })\n .def(\"__add__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} + Array{rhs}).move_body(); })\n .def(\"__mul__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} * Array{rhs}).move_body(); })\n .def(\"__repr__\", [](const ArrayBodyPtr& self) { return Array{self}.ToString(); })\n .def(\"copy\", [](const ArrayBodyPtr& self) { return Array{self}.Copy().move_body(); })\n .def_property(\"requires_grad\", [](const ArrayBodyPtr& self) { return Array{self}.IsGradRequired(); },\n [](const ArrayBodyPtr& self, bool value) {\n \/\/ Cannot unset required gradients\n if (value && !self->HasNode()) {\n Array{self}.RequireGrad();\n }\n })\n .def_property(\"grad\",\n [](const ArrayBodyPtr& self) -> ConstArrayBodyPtr {\n if (self->HasNode()) {\n return Array{self}.GetGrad()->body();\n } else {\n return nullptr;\n }\n },\n [](const ArrayBodyPtr& self, const ArrayBodyPtr& grad) {\n if (grad) {\n if (!self->HasNode()) {\n Array{self}.RequireGrad().SetGrad(Array{grad});\n } else {\n Array{self}.SetGrad(Array{grad});\n }\n } else {\n Array{self}.ClearGrad();\n }\n })\n .def_property_readonly(\"dtype\", [](const ArrayBodyPtr& self) { return Array{self}.dtype(); })\n .def_property_readonly(\"element_bytes\", [](const ArrayBodyPtr& self) { return Array{self}.element_bytes(); })\n .def_property_readonly(\"is_contiguous\", [](const ArrayBodyPtr& self) { return Array{self}.is_contiguous(); })\n .def_property_readonly(\"ndim\", [](const ArrayBodyPtr& self) { return Array{self}.ndim(); })\n .def_property_readonly(\"offset\", [](const ArrayBodyPtr& self) { return Array{self}.offset(); })\n .def_property_readonly(\"shape\", [](const ArrayBodyPtr& self) { return Array{self}.shape(); })\n .def_property_readonly(\"total_bytes\", [](const ArrayBodyPtr& self) { return Array{self}.total_bytes(); })\n .def_property_readonly(\"total_size\", [](const ArrayBodyPtr& self) { return Array{self}.total_size(); })\n .def_property_readonly(\"_debug_data_memory_address\", \/\/ These methods starting with `_debug_` are stubs for testing\n [](const ArrayBodyPtr& self) { return reinterpret_cast(Array{self}.data().get()); })\n .def_property_readonly(\"_debug_flat_data\", [](const ArrayBodyPtr& self) {\n py::list list;\n Array array{self};\n\n \/\/ Copy data into the list\n VisitDtype(array.dtype(), [&array, &list](auto pt) {\n using T = typename decltype(pt)::type;\n auto size = array.total_size();\n const T& data = *std::static_pointer_cast(array.data());\n for (int64_t i = 0; i < size; ++i) {\n list.append((&data)[i]);\n }\n });\n\n return list;\n });\n}\n\n} \/\/ namespace xchainer\nFix unclear comment#include \"xchainer\/python\/array.h\"\n\n#include \n#include \n\n#include \n#include \n\n#include \"xchainer\/array.h\"\n#include \"xchainer\/dtype.h\"\n#include \"xchainer\/error.h\"\n\n#include \"xchainer\/python\/common.h\"\n\nnamespace xchainer {\n\nnamespace py = pybind11;\n\nnamespace {\n\nusing ArrayBodyPtr = std::shared_ptr;\nusing ConstArrayBodyPtr = std::shared_ptr;\n\nDtype NumpyDtypeToDtype(const py::dtype& npdtype) {\n switch (npdtype.kind()) {\n case 'b':\n return Dtype::kBool;\n case 'i':\n switch (npdtype.itemsize()) {\n case 1:\n return Dtype::kInt8;\n case 2:\n return Dtype::kInt16;\n case 4:\n return Dtype::kInt32;\n case 8:\n return Dtype::kInt64;\n default:\n break;\n }\n break;\n case 'u':\n switch (npdtype.itemsize()) {\n case 1:\n return Dtype::kUInt8;\n default:\n break;\n }\n break;\n case 'f':\n switch (npdtype.itemsize()) {\n case 4:\n return Dtype::kFloat32;\n case 8:\n return Dtype::kFloat64;\n default:\n break;\n }\n break;\n default:\n break;\n }\n throw DtypeError(\"unsupported NumPy dtype\");\n}\n\nArrayBodyPtr MakeArray(const Shape& shape, Dtype dtype, py::list list) {\n auto total_size = shape.total_size();\n auto bytes = GetElementSize(dtype) * total_size;\n if (static_cast(total_size) != list.size()) {\n throw DimensionError(\"Invalid data length\");\n }\n\n \/\/ Allocate a buffer and copy data\n std::shared_ptr ptr = std::make_unique(bytes);\n VisitDtype(dtype, [&](auto pt) {\n using T = typename decltype(pt)::type;\n std::transform(list.begin(), list.end(), static_cast(ptr.get()), [](auto& item) { return py::cast(item); });\n });\n return Array::FromBuffer(shape, dtype, ptr).move_body();\n}\n\nArrayBodyPtr MakeArray(py::array array) {\n if ((array.flags() & py::array::c_style) == 0) {\n throw DimensionError(\"cannot convert non-contiguous NumPy array to Array\");\n }\n\n Dtype dtype = NumpyDtypeToDtype(array.dtype());\n py::buffer_info info = array.request();\n Shape shape(info.shape);\n\n \/\/ data holds the copy of py::array which in turn references the NumPy array and the buffer is therefore not released\n std::shared_ptr data(std::make_shared(std::move(array)), array.mutable_data());\n\n return Array::FromBuffer(shape, dtype, data).move_body();\n}\n\npy::buffer_info MakeNumpyArrayFromArray(internal::ArrayBody& self) {\n \/\/ Used as a temporary accessor\n Array array{std::move(ArrayBodyPtr(&self, [](internal::ArrayBody* ptr) {\n (void)ptr; \/\/ unused\n }))};\n\n if (!array.is_contiguous()) {\n throw DimensionError(\"cannot convert non-contiguous Array to NumPy array\");\n }\n\n int64_t itemsize{GetElementSize(array.dtype())};\n const Shape& shape = array.shape();\n\n \/\/ compute C-contiguous strides\n size_t ndim = array.ndim();\n std::vector strides(ndim);\n if (ndim > 0) {\n std::partial_sum(shape.crbegin(), shape.crend() - 1, strides.rbegin() + 1, std::multiplies());\n strides.back() = 1;\n std::transform(strides.crbegin(), strides.crend(), strides.rbegin(), [&itemsize](size_t item) { return item * itemsize; });\n }\n\n return py::buffer_info(array.data().get(), itemsize, std::string(1, GetCharCode(array.dtype())), ndim, shape, strides);\n}\n\n} \/\/ namespace\n\nvoid InitXchainerArray(pybind11::module& m) {\n py::class_{m, \"Array\", py::buffer_protocol()}\n .def(py::init(py::overload_cast(&MakeArray)))\n .def(py::init(py::overload_cast(&MakeArray)))\n .def_buffer(&MakeNumpyArrayFromArray)\n .def(\"view\",\n [](const ArrayBodyPtr& self) {\n \/\/ Duplicate the array body\n return std::make_shared(*self);\n })\n .def(\"__iadd__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} += Array{rhs}).move_body(); })\n .def(\"__imul__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} *= Array{rhs}).move_body(); })\n .def(\"__add__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} + Array{rhs}).move_body(); })\n .def(\"__mul__\", [](const ArrayBodyPtr& self, const ArrayBodyPtr& rhs) { return (Array{self} * Array{rhs}).move_body(); })\n .def(\"__repr__\", [](const ArrayBodyPtr& self) { return Array{self}.ToString(); })\n .def(\"copy\", [](const ArrayBodyPtr& self) { return Array{self}.Copy().move_body(); })\n .def_property(\"requires_grad\", [](const ArrayBodyPtr& self) { return Array{self}.IsGradRequired(); },\n [](const ArrayBodyPtr& self, bool value) {\n \/\/ TODO(hvy): requires_grad should not be a boolean property but a method that takes a graph id argument, aligning\n \/\/ to the c++ interface. Currently, this property is broken in the sense that once the required_grad flag is set\n \/\/ to true (and an ArrayNode is created internally) it cannot be uset.\n if (value && !self->HasNode()) {\n Array{self}.RequireGrad();\n }\n })\n .def_property(\"grad\",\n [](const ArrayBodyPtr& self) -> ConstArrayBodyPtr {\n if (self->HasNode()) {\n return Array{self}.GetGrad()->body();\n } else {\n return nullptr;\n }\n },\n [](const ArrayBodyPtr& self, const ArrayBodyPtr& grad) {\n if (grad) {\n if (!self->HasNode()) {\n Array{self}.RequireGrad().SetGrad(Array{grad});\n } else {\n Array{self}.SetGrad(Array{grad});\n }\n } else {\n Array{self}.ClearGrad();\n }\n })\n .def_property_readonly(\"dtype\", [](const ArrayBodyPtr& self) { return Array{self}.dtype(); })\n .def_property_readonly(\"element_bytes\", [](const ArrayBodyPtr& self) { return Array{self}.element_bytes(); })\n .def_property_readonly(\"is_contiguous\", [](const ArrayBodyPtr& self) { return Array{self}.is_contiguous(); })\n .def_property_readonly(\"ndim\", [](const ArrayBodyPtr& self) { return Array{self}.ndim(); })\n .def_property_readonly(\"offset\", [](const ArrayBodyPtr& self) { return Array{self}.offset(); })\n .def_property_readonly(\"shape\", [](const ArrayBodyPtr& self) { return Array{self}.shape(); })\n .def_property_readonly(\"total_bytes\", [](const ArrayBodyPtr& self) { return Array{self}.total_bytes(); })\n .def_property_readonly(\"total_size\", [](const ArrayBodyPtr& self) { return Array{self}.total_size(); })\n .def_property_readonly(\"_debug_data_memory_address\", \/\/ These methods starting with `_debug_` are stubs for testing\n [](const ArrayBodyPtr& self) { return reinterpret_cast(Array{self}.data().get()); })\n .def_property_readonly(\"_debug_flat_data\", [](const ArrayBodyPtr& self) {\n py::list list;\n Array array{self};\n\n \/\/ Copy data into the list\n VisitDtype(array.dtype(), [&array, &list](auto pt) {\n using T = typename decltype(pt)::type;\n auto size = array.total_size();\n const T& data = *std::static_pointer_cast(array.data());\n for (int64_t i = 0; i < size; ++i) {\n list.append((&data)[i]);\n }\n });\n\n return list;\n });\n}\n\n} \/\/ namespace xchainer\n<|endoftext|>"} {"text":"#include \n#include \n\n#include \n#include \n#include \n#include \n\nXCodecDecoder::XCodecDecoder(XCodec *codec)\n: log_(\"\/xcodec\/decoder\"),\n cache_(codec->cache_),\n window_()\n{ }\n\nXCodecDecoder::~XCodecDecoder()\n{ }\n\n\/*\n * Decode an XCodec-encoded stream. Returns false if there was an\n * inconsistency in the stream or something malformed. Returns true\n * if we were able to process the stream or expect to be able to\n * once more data arrives. The input buffer is cleared of anything\n * we can process right now.\n *\/\nbool\nXCodecDecoder::decode(Buffer *output, Buffer *input)\n{\n\tBufferSegment *seg, *oseg;\n\tuint64_t hash;\n\tsize_t inlen;\n\tuint8_t ch;\n\n\tinlen = input->length();\n\twhile (inlen != 0) {\n\t\tch = input->peek();\n\n\t\twhile (!XCODEC_CHAR_SPECIAL(ch)) {\n\t\t\tinlen--;\n\t\t\tinput->skip(1);\n\t\t\toutput->append(ch);\n\n\t\t\tif (inlen == 0)\n\t\t\t\tbreak;\n\n\t\t\tch = input->peek();\n\t\t}\n\n\t\tASSERT(inlen == input->length());\n\n\t\tif (inlen == 0)\n\t\t\tbreak;\n\n\t\tswitch (ch) {\n\t\t\t\/*\n\t\t\t * A reference to a hash we are expected to have\n\t\t\t * in our database.\n\t\t\t *\/\n\t\tcase XCODEC_HASHREF_CHAR:\n\t\t\tif (inlen < 9)\n\t\t\t\treturn (true);\n\n\t\t\tinput->moveout((uint8_t *)&hash, 1, sizeof hash);\n\t\t\thash = LittleEndian::decode(hash);\n\n\t\t\tseg = cache_->lookup(hash);\n\t\t\tif (seg == NULL) {\n\t\t\t\tERROR(log_) << \"Stream referenced unseen hash: \" << hash;\n\t\t\t\treturn (false);\n\t\t\t}\n\t\t\twindow_.declare(hash, seg);\n\n\t\t\toutput->append(seg);\n\t\t\tinlen -= 9;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A literal character will follow that would\n\t\t\t * otherwise have seemed magic.\n\t\t\t *\/\n\t\tcase XCODEC_ESCAPE_CHAR:\n\t\t\tif (inlen < 2)\n\t\t\t\treturn (true);\n\t\t\tinput->skip(1);\n\t\t\toutput->append(input->peek());\n\t\t\tinput->skip(1);\n\t\t\tinlen -= 2;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A learning opportunity -- a hash we should put\n\t\t\t * into our database for future use and the data\n\t\t\t * it will be used in reference to next time.\n\t\t\t *\/\n\t\tcase XCODEC_DECLARE_CHAR:\n\t\t\tif (inlen < 9 + XCODEC_SEGMENT_LENGTH)\n\t\t\t\treturn (true);\n\n\t\t\tinput->moveout((uint8_t *)&hash, 1, sizeof hash);\n\t\t\thash = LittleEndian::decode(hash);\n\n\t\t\tinput->copyout(&seg, XCODEC_SEGMENT_LENGTH);\n\t\t\tinput->skip(XCODEC_SEGMENT_LENGTH);\n\n\t\t\tif (XCodecHash::hash(seg->data()) != hash) {\n\t\t\t\tseg->unref();\n\t\t\t\tERROR(log_) << \"Data in stream does not have expected hash.\";\n\t\t\t\treturn (false);\n\t\t\t}\n\n\t\t\t\/*\n\t\t\t * Chech whether we already know a hash by this name.\n\t\t\t *\/\n\t\t\toseg = cache_->lookup(hash);\n\t\t\tif (oseg != NULL) {\n\t\t\t\t\/*\n\t\t\t\t * We already know a hash by this name. Check\n\t\t\t\t * whether it is for the same data. That would\n\t\t\t\t * be nice. In that case all we need to do is\n\t\t\t\t * update the backreference window.\n\t\t\t\t *\/\n\t\t\t\tif (seg->match(oseg)) {\n\t\t\t\t\tseg->unref();\n\t\t\t\t\t\/*\n\t\t\t\t\t * NB: Use the existing segment since\n\t\t\t\t\t * it's nice to share.\n\t\t\t\t\t *\/\n\t\t\t\t\twindow_.declare(hash, oseg);\n\t\t\t\t\toseg->unref();\n\t\t\t\t} else {\n\t\t\t\t\tseg->unref();\n\t\t\t\t\toseg->unref();\n\t\t\t\t\tERROR(log_) << \"Stream includes hash with different local data.\";\n\t\t\t\t\treturn (false);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/*\n\t\t\t\t * This is a brand new hash. Enter it into the\n\t\t\t\t * database and the backref window.\n\t\t\t\t *\/\n\t\t\t\tcache_->enter(hash, seg);\n\t\t\t\twindow_.declare(hash, seg);\n\t\t\t\tseg->unref();\n\t\t\t}\n\n\t\t\tinlen -= 9 + XCODEC_SEGMENT_LENGTH;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A reference to a recently-used hash. We expect\n\t\t\t * to see a lot of these whenever we see declarations\n\t\t\t * since the declarations are desorted in the stream\n\t\t\t * and are not literally inserted.\n\t\t\t *\/\n\t\tcase XCODEC_BACKREF_CHAR:\n\t\t\tif (inlen < 2)\n\t\t\t\treturn (true);\n\t\t\tinput->skip(1);\n\t\t\tch = input->peek();\n\t\t\tinput->skip(1);\n\n\t\t\tseg = window_.dereference(ch);\n\t\t\tif (seg == NULL) {\n\t\t\t\tERROR(log_) << \"Stream included invalid backref.\";\n\t\t\t\treturn (false);\n\t\t\t}\n\n\t\t\toutput->append(seg);\n\t\t\tinlen -= 2;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tNOTREACHED();\n\t\t}\n\t}\n\n\treturn (true);\n}\nDrop references to BufferSegments appropriately. Thanks, Valgrind!#include \n#include \n\n#include \n#include \n#include \n#include \n\nXCodecDecoder::XCodecDecoder(XCodec *codec)\n: log_(\"\/xcodec\/decoder\"),\n cache_(codec->cache_),\n window_()\n{ }\n\nXCodecDecoder::~XCodecDecoder()\n{ }\n\n\/*\n * Decode an XCodec-encoded stream. Returns false if there was an\n * inconsistency in the stream or something malformed. Returns true\n * if we were able to process the stream or expect to be able to\n * once more data arrives. The input buffer is cleared of anything\n * we can process right now.\n *\/\nbool\nXCodecDecoder::decode(Buffer *output, Buffer *input)\n{\n\tBufferSegment *seg, *oseg;\n\tuint64_t hash;\n\tsize_t inlen;\n\tuint8_t ch;\n\n\tinlen = input->length();\n\twhile (inlen != 0) {\n\t\tch = input->peek();\n\n\t\twhile (!XCODEC_CHAR_SPECIAL(ch)) {\n\t\t\tinlen--;\n\t\t\tinput->skip(1);\n\t\t\toutput->append(ch);\n\n\t\t\tif (inlen == 0)\n\t\t\t\tbreak;\n\n\t\t\tch = input->peek();\n\t\t}\n\n\t\tASSERT(inlen == input->length());\n\n\t\tif (inlen == 0)\n\t\t\tbreak;\n\n\t\tswitch (ch) {\n\t\t\t\/*\n\t\t\t * A reference to a hash we are expected to have\n\t\t\t * in our database.\n\t\t\t *\/\n\t\tcase XCODEC_HASHREF_CHAR:\n\t\t\tif (inlen < 9)\n\t\t\t\treturn (true);\n\n\t\t\tinput->moveout((uint8_t *)&hash, 1, sizeof hash);\n\t\t\thash = LittleEndian::decode(hash);\n\n\t\t\tseg = cache_->lookup(hash);\n\t\t\tif (seg == NULL) {\n\t\t\t\tERROR(log_) << \"Stream referenced unseen hash: \" << hash;\n\t\t\t\treturn (false);\n\t\t\t}\n\t\t\twindow_.declare(hash, seg);\n\n\t\t\toutput->append(seg);\n\t\t\tseg->unref();\n\t\t\tinlen -= 9;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A literal character will follow that would\n\t\t\t * otherwise have seemed magic.\n\t\t\t *\/\n\t\tcase XCODEC_ESCAPE_CHAR:\n\t\t\tif (inlen < 2)\n\t\t\t\treturn (true);\n\t\t\tinput->skip(1);\n\t\t\toutput->append(input->peek());\n\t\t\tinput->skip(1);\n\t\t\tinlen -= 2;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A learning opportunity -- a hash we should put\n\t\t\t * into our database for future use and the data\n\t\t\t * it will be used in reference to next time.\n\t\t\t *\/\n\t\tcase XCODEC_DECLARE_CHAR:\n\t\t\tif (inlen < 9 + XCODEC_SEGMENT_LENGTH)\n\t\t\t\treturn (true);\n\n\t\t\tinput->moveout((uint8_t *)&hash, 1, sizeof hash);\n\t\t\thash = LittleEndian::decode(hash);\n\n\t\t\tinput->copyout(&seg, XCODEC_SEGMENT_LENGTH);\n\t\t\tinput->skip(XCODEC_SEGMENT_LENGTH);\n\n\t\t\tif (XCodecHash::hash(seg->data()) != hash) {\n\t\t\t\tseg->unref();\n\t\t\t\tERROR(log_) << \"Data in stream does not have expected hash.\";\n\t\t\t\treturn (false);\n\t\t\t}\n\n\t\t\t\/*\n\t\t\t * Chech whether we already know a hash by this name.\n\t\t\t *\/\n\t\t\toseg = cache_->lookup(hash);\n\t\t\tif (oseg != NULL) {\n\t\t\t\t\/*\n\t\t\t\t * We already know a hash by this name. Check\n\t\t\t\t * whether it is for the same data. That would\n\t\t\t\t * be nice. In that case all we need to do is\n\t\t\t\t * update the backreference window.\n\t\t\t\t *\/\n\t\t\t\tif (seg->match(oseg)) {\n\t\t\t\t\tseg->unref();\n\t\t\t\t\t\/*\n\t\t\t\t\t * NB: Use the existing segment since\n\t\t\t\t\t * it's nice to share.\n\t\t\t\t\t *\/\n\t\t\t\t\twindow_.declare(hash, oseg);\n\t\t\t\t\toseg->unref();\n\t\t\t\t} else {\n\t\t\t\t\tseg->unref();\n\t\t\t\t\toseg->unref();\n\t\t\t\t\tERROR(log_) << \"Stream includes hash with different local data.\";\n\t\t\t\t\treturn (false);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/*\n\t\t\t\t * This is a brand new hash. Enter it into the\n\t\t\t\t * database and the backref window.\n\t\t\t\t *\/\n\t\t\t\tcache_->enter(hash, seg);\n\t\t\t\twindow_.declare(hash, seg);\n\t\t\t\tseg->unref();\n\t\t\t}\n\n\t\t\tinlen -= 9 + XCODEC_SEGMENT_LENGTH;\n\t\t\tbreak;\n\n\t\t\t\/*\n\t\t\t * A reference to a recently-used hash. We expect\n\t\t\t * to see a lot of these whenever we see declarations\n\t\t\t * since the declarations are desorted in the stream\n\t\t\t * and are not literally inserted.\n\t\t\t *\/\n\t\tcase XCODEC_BACKREF_CHAR:\n\t\t\tif (inlen < 2)\n\t\t\t\treturn (true);\n\t\t\tinput->skip(1);\n\t\t\tch = input->peek();\n\t\t\tinput->skip(1);\n\n\t\t\tseg = window_.dereference(ch);\n\t\t\tif (seg == NULL) {\n\t\t\t\tERROR(log_) << \"Stream included invalid backref.\";\n\t\t\t\treturn (false);\n\t\t\t}\n\n\t\t\toutput->append(seg);\n\t\t\tseg->unref();\n\t\t\tinlen -= 2;\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tNOTREACHED();\n\t\t}\n\t}\n\n\treturn (true);\n}\n<|endoftext|>"} {"text":"\/*\n* Prime Generation\n* (C) 1999-2007,2018,2019 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace Botan {\n\nnamespace {\n\nclass Prime_Sieve final\n {\n public:\n Prime_Sieve(const BigInt& init_value, size_t sieve_size) :\n m_sieve(std::min(sieve_size, PRIME_TABLE_SIZE))\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n m_sieve[i] = static_cast(init_value % PRIMES[i]);\n }\n\n void step(word increment)\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n {\n m_sieve[i] = (m_sieve[i] + increment) % PRIMES[i];\n }\n }\n\n bool passes(bool check_2p1 = false) const\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n {\n \/*\n In this case, p is a multiple of PRIMES[i]\n *\/\n if(m_sieve[i] == 0)\n return false;\n\n if(check_2p1)\n {\n \/*\n In this case, 2*p+1 will be a multiple of PRIMES[i]\n\n So if potentially generating a safe prime, we want to\n avoid this value because 2*p+1 will certainly not be prime.\n\n See \"Safe Prime Generation with a Combined Sieve\" M. Wiener\n https:\/\/eprint.iacr.org\/2003\/186.pdf\n *\/\n if(m_sieve[i] == (PRIMES[i] - 1) \/ 2)\n return false;\n }\n }\n\n return true;\n }\n\n private:\n std::vector m_sieve;\n };\n\n}\n\n\n\/*\n* Generate a random prime\n*\/\nBigInt random_prime(RandomNumberGenerator& rng,\n size_t bits, const BigInt& coprime,\n size_t equiv, size_t modulo,\n size_t prob)\n {\n if(coprime.is_negative() || (!coprime.is_zero() && coprime.is_even()) || coprime.bits() >= bits)\n {\n throw Invalid_Argument(\"random_prime: invalid coprime\");\n }\n if(modulo == 0)\n {\n throw Invalid_Argument(\"random_prime: Invalid modulo value\");\n }\n\n equiv %= modulo;\n\n if(equiv == 0)\n throw Invalid_Argument(\"random_prime Invalid value for equiv\/modulo\");\n\n \/\/ Handle small values:\n\n if(bits <= 16)\n {\n if(equiv != 1 || modulo != 2 || coprime != 0)\n throw Not_Implemented(\"random_prime equiv\/modulo\/coprime options not usable for small primes\");\n\n if(bits <= 1)\n {\n throw Invalid_Argument(\"random_prime: Can't make a prime of \" +\n std::to_string(bits) + \" bits\");\n }\n else if(bits == 2)\n {\n return ((rng.next_byte() % 2) ? 2 : 3);\n }\n else if(bits == 3)\n {\n return ((rng.next_byte() % 2) ? 5 : 7);\n }\n else if(bits == 4)\n {\n return ((rng.next_byte() % 2) ? 11 : 13);\n }\n else\n {\n for(;;)\n {\n \/\/ This is slightly biased, but for small primes it does not seem to matter\n const uint8_t b0 = rng.next_byte();\n const uint8_t b1 = rng.next_byte();\n const size_t idx = make_uint16(b0, b1) % PRIME_TABLE_SIZE;\n const uint16_t small_prime = PRIMES[idx];\n\n if(high_bit(small_prime) == bits)\n return small_prime;\n }\n }\n }\n\n const size_t MAX_ATTEMPTS = 32*1024;\n\n while(true)\n {\n BigInt p(rng, bits);\n\n \/\/ Force lowest and two top bits on\n p.set_bit(bits - 1);\n p.set_bit(bits - 2);\n p.set_bit(0);\n\n \/\/ Force p to be equal to equiv mod modulo\n p += (modulo - (p % modulo)) + equiv;\n\n Prime_Sieve sieve(p, bits);\n\n for(size_t attempt = 0; attempt <= MAX_ATTEMPTS; ++attempt)\n {\n p += modulo;\n\n sieve.step(modulo);\n\n \/\/ p can be even if modulo is odd, continue on in that case\n if(p.is_even() || sieve.passes(true) == false)\n continue;\n\n Modular_Reducer mod_p(p);\n\n \/*\n First do a single M-R iteration to quickly elimate most non-primes,\n before doing the coprimality check which is expensive\n *\/\n if(is_miller_rabin_probable_prime(p, mod_p, rng, 1) == false)\n continue;\n\n if(coprime > 1)\n {\n \/*\n * Check if gcd(p - 1, coprime) != 1 by attempting to compute a\n * modular inverse. We are assured coprime is odd (since if it was\n * even, it would always have a common factor with p - 1), so\n * take off the factors of 2 from (p-1) then compute the inverse\n * of coprime modulo that integer.\n *\/\n BigInt p1 = p - 1;\n p1 >>= low_zero_bits(p1);\n if(ct_inverse_mod_odd_modulus(coprime, p1).is_zero())\n {\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) > 1);\n continue;\n }\n\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) == 1);\n }\n\n if(p.bits() > bits)\n break;\n\n const size_t t = miller_rabin_test_iterations(bits, prob, true);\n\n if(is_miller_rabin_probable_prime(p, mod_p, rng, t) == false)\n continue;\n\n if(prob > 32 && !is_lucas_probable_prime(p, mod_p))\n continue;\n\n return p;\n }\n }\n }\n\nBigInt generate_rsa_prime(RandomNumberGenerator& keygen_rng,\n RandomNumberGenerator& prime_test_rng,\n size_t bits,\n const BigInt& coprime,\n size_t prob)\n {\n if(bits < 512)\n throw Invalid_Argument(\"generate_rsa_prime bits too small\");\n\n \/*\n * The restriction on coprime <= 64 bits is arbitrary but generally speaking\n * very large RSA public exponents are a bad idea both for performance and due\n * to attacks on small d.\n *\/\n if(coprime <= 1 || coprime.is_even() || coprime.bits() > 64)\n throw Invalid_Argument(\"generate_rsa_prime coprime must be small odd positive integer\");\n\n const size_t MAX_ATTEMPTS = 32*1024;\n\n while(true)\n {\n BigInt p(keygen_rng, bits);\n\n \/\/ Force lowest and two top bits on\n p.set_bit(bits - 1);\n p.set_bit(bits - 2);\n p.set_bit(0);\n\n Prime_Sieve sieve(p, bits);\n\n const word step = 2;\n\n for(size_t attempt = 0; attempt <= MAX_ATTEMPTS; ++attempt)\n {\n p += step;\n\n sieve.step(step);\n\n if(sieve.passes() == false)\n continue;\n\n Modular_Reducer mod_p(p);\n\n \/*\n * Do a single primality test first before checking coprimality, since\n * currently a single Miller-Rabin test is faster than computing modular\n * inverse, and this eliminates almost all wasted modular inverses.\n *\/\n if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, 1) == false)\n continue;\n\n \/*\n * Check if p - 1 and coprime are relatively prime by computing the inverse.\n *\n * We avoid gcd here because that algorithm is not constant time.\n * Modular inverse is (for odd modulus anyway).\n *\n * We earlier verified that coprime argument is odd. Thus the factors of 2\n * in (p - 1) cannot possibly be factors in coprime, so remove them from p - 1.\n * Using an odd modulus allows the const time algorithm to be used.\n *\n * This assumes coprime < p - 1 which is always true for RSA.\n *\/\n BigInt p1 = p - 1;\n p1 >>= low_zero_bits(p1);\n if(ct_inverse_mod_odd_modulus(coprime, p1).is_zero())\n {\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) > 1);\n continue;\n }\n\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) == 1);\n\n if(p.bits() > bits)\n break;\n\n const size_t t = miller_rabin_test_iterations(bits, prob, true);\n\n if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, t) == true)\n return p;\n }\n }\n }\n\n\/*\n* Generate a random safe prime\n*\/\nBigInt random_safe_prime(RandomNumberGenerator& rng, size_t bits)\n {\n if(bits <= 64)\n throw Invalid_Argument(\"random_safe_prime: Can't make a prime of \" +\n std::to_string(bits) + \" bits\");\n\n BigInt q, p;\n for(;;)\n {\n \/*\n Generate q == 2 (mod 3)\n\n Otherwise [q == 1 (mod 3) case], 2*q+1 == 3 (mod 3) and not prime.\n\n Initially allow a very high error prob (1\/2**8) to allow for fast checks,\n then if 2*q+1 turns out to be a prime go back and strongly check q.\n *\/\n q = random_prime(rng, bits - 1, 0, 2, 3, 8);\n p = (q << 1) + 1;\n\n if(is_prime(p, rng, 128, true))\n {\n \/\/ We did only a weak check before, go back and verify q before returning\n if(is_prime(q, rng, 128, true))\n return p;\n }\n }\n }\n\n}\nFix error message\/*\n* Prime Generation\n* (C) 1999-2007,2018,2019 Jack Lloyd\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace Botan {\n\nnamespace {\n\nclass Prime_Sieve final\n {\n public:\n Prime_Sieve(const BigInt& init_value, size_t sieve_size) :\n m_sieve(std::min(sieve_size, PRIME_TABLE_SIZE))\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n m_sieve[i] = static_cast(init_value % PRIMES[i]);\n }\n\n void step(word increment)\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n {\n m_sieve[i] = (m_sieve[i] + increment) % PRIMES[i];\n }\n }\n\n bool passes(bool check_2p1 = false) const\n {\n for(size_t i = 0; i != m_sieve.size(); ++i)\n {\n \/*\n In this case, p is a multiple of PRIMES[i]\n *\/\n if(m_sieve[i] == 0)\n return false;\n\n if(check_2p1)\n {\n \/*\n In this case, 2*p+1 will be a multiple of PRIMES[i]\n\n So if potentially generating a safe prime, we want to\n avoid this value because 2*p+1 will certainly not be prime.\n\n See \"Safe Prime Generation with a Combined Sieve\" M. Wiener\n https:\/\/eprint.iacr.org\/2003\/186.pdf\n *\/\n if(m_sieve[i] == (PRIMES[i] - 1) \/ 2)\n return false;\n }\n }\n\n return true;\n }\n\n private:\n std::vector m_sieve;\n };\n\n}\n\n\n\/*\n* Generate a random prime\n*\/\nBigInt random_prime(RandomNumberGenerator& rng,\n size_t bits, const BigInt& coprime,\n size_t equiv, size_t modulo,\n size_t prob)\n {\n if(bits <= 1)\n {\n throw Invalid_Argument(\"random_prime: Can't make a prime of \" +\n std::to_string(bits) + \" bits\");\n }\n if(coprime.is_negative() || (!coprime.is_zero() && coprime.is_even()) || coprime.bits() >= bits)\n {\n throw Invalid_Argument(\"random_prime: invalid coprime\");\n }\n if(modulo == 0)\n {\n throw Invalid_Argument(\"random_prime: Invalid modulo value\");\n }\n\n equiv %= modulo;\n\n if(equiv == 0)\n throw Invalid_Argument(\"random_prime Invalid value for equiv\/modulo\");\n\n \/\/ Handle small values:\n\n if(bits <= 16)\n {\n if(equiv != 1 || modulo != 2 || coprime != 0)\n throw Not_Implemented(\"random_prime equiv\/modulo\/coprime options not usable for small primes\");\n\n if(bits == 2)\n {\n return ((rng.next_byte() % 2) ? 2 : 3);\n }\n else if(bits == 3)\n {\n return ((rng.next_byte() % 2) ? 5 : 7);\n }\n else if(bits == 4)\n {\n return ((rng.next_byte() % 2) ? 11 : 13);\n }\n else\n {\n for(;;)\n {\n \/\/ This is slightly biased, but for small primes it does not seem to matter\n const uint8_t b0 = rng.next_byte();\n const uint8_t b1 = rng.next_byte();\n const size_t idx = make_uint16(b0, b1) % PRIME_TABLE_SIZE;\n const uint16_t small_prime = PRIMES[idx];\n\n if(high_bit(small_prime) == bits)\n return small_prime;\n }\n }\n }\n\n const size_t MAX_ATTEMPTS = 32*1024;\n\n while(true)\n {\n BigInt p(rng, bits);\n\n \/\/ Force lowest and two top bits on\n p.set_bit(bits - 1);\n p.set_bit(bits - 2);\n p.set_bit(0);\n\n \/\/ Force p to be equal to equiv mod modulo\n p += (modulo - (p % modulo)) + equiv;\n\n Prime_Sieve sieve(p, bits);\n\n for(size_t attempt = 0; attempt <= MAX_ATTEMPTS; ++attempt)\n {\n p += modulo;\n\n sieve.step(modulo);\n\n \/\/ p can be even if modulo is odd, continue on in that case\n if(p.is_even() || sieve.passes(true) == false)\n continue;\n\n Modular_Reducer mod_p(p);\n\n \/*\n First do a single M-R iteration to quickly elimate most non-primes,\n before doing the coprimality check which is expensive\n *\/\n if(is_miller_rabin_probable_prime(p, mod_p, rng, 1) == false)\n continue;\n\n if(coprime > 1)\n {\n \/*\n * Check if gcd(p - 1, coprime) != 1 by attempting to compute a\n * modular inverse. We are assured coprime is odd (since if it was\n * even, it would always have a common factor with p - 1), so\n * take off the factors of 2 from (p-1) then compute the inverse\n * of coprime modulo that integer.\n *\/\n BigInt p1 = p - 1;\n p1 >>= low_zero_bits(p1);\n if(ct_inverse_mod_odd_modulus(coprime, p1).is_zero())\n {\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) > 1);\n continue;\n }\n\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) == 1);\n }\n\n if(p.bits() > bits)\n break;\n\n const size_t t = miller_rabin_test_iterations(bits, prob, true);\n\n if(is_miller_rabin_probable_prime(p, mod_p, rng, t) == false)\n continue;\n\n if(prob > 32 && !is_lucas_probable_prime(p, mod_p))\n continue;\n\n return p;\n }\n }\n }\n\nBigInt generate_rsa_prime(RandomNumberGenerator& keygen_rng,\n RandomNumberGenerator& prime_test_rng,\n size_t bits,\n const BigInt& coprime,\n size_t prob)\n {\n if(bits < 512)\n throw Invalid_Argument(\"generate_rsa_prime bits too small\");\n\n \/*\n * The restriction on coprime <= 64 bits is arbitrary but generally speaking\n * very large RSA public exponents are a bad idea both for performance and due\n * to attacks on small d.\n *\/\n if(coprime <= 1 || coprime.is_even() || coprime.bits() > 64)\n throw Invalid_Argument(\"generate_rsa_prime coprime must be small odd positive integer\");\n\n const size_t MAX_ATTEMPTS = 32*1024;\n\n while(true)\n {\n BigInt p(keygen_rng, bits);\n\n \/\/ Force lowest and two top bits on\n p.set_bit(bits - 1);\n p.set_bit(bits - 2);\n p.set_bit(0);\n\n Prime_Sieve sieve(p, bits);\n\n const word step = 2;\n\n for(size_t attempt = 0; attempt <= MAX_ATTEMPTS; ++attempt)\n {\n p += step;\n\n sieve.step(step);\n\n if(sieve.passes() == false)\n continue;\n\n Modular_Reducer mod_p(p);\n\n \/*\n * Do a single primality test first before checking coprimality, since\n * currently a single Miller-Rabin test is faster than computing modular\n * inverse, and this eliminates almost all wasted modular inverses.\n *\/\n if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, 1) == false)\n continue;\n\n \/*\n * Check if p - 1 and coprime are relatively prime by computing the inverse.\n *\n * We avoid gcd here because that algorithm is not constant time.\n * Modular inverse is (for odd modulus anyway).\n *\n * We earlier verified that coprime argument is odd. Thus the factors of 2\n * in (p - 1) cannot possibly be factors in coprime, so remove them from p - 1.\n * Using an odd modulus allows the const time algorithm to be used.\n *\n * This assumes coprime < p - 1 which is always true for RSA.\n *\/\n BigInt p1 = p - 1;\n p1 >>= low_zero_bits(p1);\n if(ct_inverse_mod_odd_modulus(coprime, p1).is_zero())\n {\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) > 1);\n continue;\n }\n\n BOTAN_DEBUG_ASSERT(gcd(p - 1, coprime) == 1);\n\n if(p.bits() > bits)\n break;\n\n const size_t t = miller_rabin_test_iterations(bits, prob, true);\n\n if(is_miller_rabin_probable_prime(p, mod_p, prime_test_rng, t) == true)\n return p;\n }\n }\n }\n\n\/*\n* Generate a random safe prime\n*\/\nBigInt random_safe_prime(RandomNumberGenerator& rng, size_t bits)\n {\n if(bits <= 64)\n throw Invalid_Argument(\"random_safe_prime: Can't make a prime of \" +\n std::to_string(bits) + \" bits\");\n\n BigInt q, p;\n for(;;)\n {\n \/*\n Generate q == 2 (mod 3)\n\n Otherwise [q == 1 (mod 3) case], 2*q+1 == 3 (mod 3) and not prime.\n\n Initially allow a very high error prob (1\/2**8) to allow for fast checks,\n then if 2*q+1 turns out to be a prime go back and strongly check q.\n *\/\n q = random_prime(rng, bits - 1, 0, 2, 3, 8);\n p = (q << 1) + 1;\n\n if(is_prime(p, rng, 128, true))\n {\n \/\/ We did only a weak check before, go back and verify q before returning\n if(is_prime(q, rng, 128, true))\n return p;\n }\n }\n }\n\n}\n<|endoftext|>"} {"text":"\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2010, OpenNebula Project Leads (OpenNebula.org) *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\/\n\/* not use this file except in compliance with the License. You may obtain *\/\n\/* a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/* -------------------------------------------------------------------------- *\/\n\n#include \"RequestManager.h\"\n#include \"NebulaLog.h\"\n\n#include \"AuthManager.h\"\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid RequestManager::ClusterAdd::execute(\n xmlrpc_c::paramList const& paramList,\n xmlrpc_c::value * const retval)\n{\n string session;\n\n int hid;\n int clid;\n int rc;\n \n const string method_name = \"ClusterAdd\";\n\n Host * host;\n Cluster * cluster;\n\n ostringstream oss;\n\n \/* -- RPC specific vars -- *\/\n vector arrayData;\n xmlrpc_c::value_array * arrayresult;\n\n NebulaLog::log(\"ReM\",Log::DEBUG,\"ClusterAdd method invoked\");\n\n \/\/ Get the parameters\n session = xmlrpc_c::value_string(paramList.getString(0));\n hid = xmlrpc_c::value_int (paramList.getInt(1));\n clid = xmlrpc_c::value_int (paramList.getInt(2));\n\n \/\/Authenticate the user\n rc = ClusterAdd::upool->authenticate(session);\n\n if ( rc == -1 )\n {\n goto error_authenticate;\n }\n\n \/\/Authorize the operation\n if ( rc != 0 ) \/\/ rc == 0 means oneadmin\n {\n AuthRequest ar(rc);\n \n ar.add_auth(AuthRequest::HOST,hid,AuthRequest::MANAGE,0,false);\n ar.add_auth(AuthRequest::CLUSTER,clid,AuthRequest::USE,0,false);\n\n if (UserPool::authorize(ar) == -1)\n {\n goto error_authorize;\n }\n }\n\n \/\/ Check if host exists\n host = ClusterAdd::hpool->get(hid,true);\n\n if ( host == 0 )\n {\n goto error_host_get;\n }\n\n \/\/ Check if cluster exists\n cluster = ClusterAdd::cpool->get(clid,true);\n\n if ( cluster == 0 )\n {\n goto error_cluster_get;\n }\n\n \/\/ Set cluster\n rc = host->set_cluster( cluster->get_name() );\n\n if ( rc != 0 )\n {\n goto error_cluster_add;\n }\n\n \/\/ Update the DB\n ClusterAdd::hpool->update(host);\n\n host->unlock();\n cluster->unlock();\n\n \/\/ All nice, return success to the client\n arrayData.push_back(xmlrpc_c::value_boolean(true)); \/\/ SUCCESS\n\n \/\/ Copy arrayresult into retval mem space\n arrayresult = new xmlrpc_c::value_array(arrayData);\n *retval = *arrayresult;\n\n delete arrayresult; \/\/ and get rid of the original\n\n return;\n\nerror_authenticate:\n oss.str(authenticate_error(method_name));\n goto error_common;\n\nerror_authorize:\n oss.str(authorization_error(method_name, \"USE\", \"CLUSTER\", rc, clid));\n goto error_common;\n\nerror_host_get:\n oss.str(get_error(method_name, \"HOST\", hid));\n goto error_common;\n\nerror_cluster_get:\n oss.str(get_error(method_name, \"CLUSTER\", clid));\n goto error_common;\n\nerror_cluster_add:\n host->unlock();\n oss.str(action_error(method_name, \"USE\", \"CLUSTER\", clid, rc));\n goto error_common;\n\nerror_common:\n\n arrayData.push_back(xmlrpc_c::value_boolean(false)); \/\/ FAILURE\n arrayData.push_back(xmlrpc_c::value_string(oss.str()));\n\n NebulaLog::log(\"ReM\",Log::ERROR,oss);\n\n xmlrpc_c::value_array arrayresult_error(arrayData);\n\n *retval = arrayresult_error;\n\n return;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\nFeature #407: Fix deadlock when adding a Host to a non existing Cluster\/* -------------------------------------------------------------------------- *\/\n\/* Copyright 2002-2010, OpenNebula Project Leads (OpenNebula.org) *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\/\n\/* not use this file except in compliance with the License. You may obtain *\/\n\/* a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/* -------------------------------------------------------------------------- *\/\n\n#include \"RequestManager.h\"\n#include \"NebulaLog.h\"\n\n#include \"AuthManager.h\"\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n\nvoid RequestManager::ClusterAdd::execute(\n xmlrpc_c::paramList const& paramList,\n xmlrpc_c::value * const retval)\n{\n string session;\n\n int hid;\n int clid;\n int rc;\n \n const string method_name = \"ClusterAdd\";\n\n Host * host;\n Cluster * cluster;\n\n ostringstream oss;\n\n \/* -- RPC specific vars -- *\/\n vector arrayData;\n xmlrpc_c::value_array * arrayresult;\n\n NebulaLog::log(\"ReM\",Log::DEBUG,\"ClusterAdd method invoked\");\n\n \/\/ Get the parameters\n session = xmlrpc_c::value_string(paramList.getString(0));\n hid = xmlrpc_c::value_int (paramList.getInt(1));\n clid = xmlrpc_c::value_int (paramList.getInt(2));\n\n \/\/Authenticate the user\n rc = ClusterAdd::upool->authenticate(session);\n\n if ( rc == -1 )\n {\n goto error_authenticate;\n }\n\n \/\/Authorize the operation\n if ( rc != 0 ) \/\/ rc == 0 means oneadmin\n {\n AuthRequest ar(rc);\n \n ar.add_auth(AuthRequest::HOST,hid,AuthRequest::MANAGE,0,false);\n ar.add_auth(AuthRequest::CLUSTER,clid,AuthRequest::USE,0,false);\n\n if (UserPool::authorize(ar) == -1)\n {\n goto error_authorize;\n }\n }\n\n \/\/ Check if host exists\n host = ClusterAdd::hpool->get(hid,true);\n\n if ( host == 0 )\n {\n goto error_host_get;\n }\n\n \/\/ Check if cluster exists\n cluster = ClusterAdd::cpool->get(clid,true);\n\n if ( cluster == 0 )\n {\n goto error_cluster_get;\n }\n\n \/\/ Set cluster\n rc = host->set_cluster( cluster->get_name() );\n\n if ( rc != 0 )\n {\n goto error_cluster_add;\n }\n\n \/\/ Update the DB\n ClusterAdd::hpool->update(host);\n\n host->unlock();\n cluster->unlock();\n\n \/\/ All nice, return success to the client\n arrayData.push_back(xmlrpc_c::value_boolean(true)); \/\/ SUCCESS\n\n \/\/ Copy arrayresult into retval mem space\n arrayresult = new xmlrpc_c::value_array(arrayData);\n *retval = *arrayresult;\n\n delete arrayresult; \/\/ and get rid of the original\n\n return;\n\nerror_authenticate:\n oss.str(authenticate_error(method_name));\n goto error_common;\n\nerror_authorize:\n oss.str(authorization_error(method_name, \"USE\", \"CLUSTER\", rc, clid));\n goto error_common;\n\nerror_host_get:\n oss.str(get_error(method_name, \"HOST\", hid));\n goto error_common;\n\nerror_cluster_get:\n host->unlock();\n oss.str(get_error(method_name, \"CLUSTER\", clid));\n goto error_common;\n\nerror_cluster_add:\n host->unlock();\n oss.str(action_error(method_name, \"USE\", \"CLUSTER\", clid, rc));\n goto error_common;\n\nerror_common:\n\n arrayData.push_back(xmlrpc_c::value_boolean(false)); \/\/ FAILURE\n arrayData.push_back(xmlrpc_c::value_string(oss.str()));\n\n NebulaLog::log(\"ReM\",Log::ERROR,oss);\n\n xmlrpc_c::value_array arrayresult_error(arrayData);\n\n *retval = arrayresult_error;\n\n return;\n}\n\n\/* -------------------------------------------------------------------------- *\/\n\/* -------------------------------------------------------------------------- *\/\n<|endoftext|>"} {"text":"\/*\n * Copyright 2006-2008 The FLWOR Foundation.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include \"stdafx.h\"\n\n#include \"diagnostics\/assert.h\"\n#include \"diagnostics\/xquery_diagnostics.h\"\n\n\n#include \"system\/globalenv.h\"\n\n#include \"context\/namespace_context.h\"\n#include \"context\/static_context.h\"\n#include \"context\/dynamic_context.h\"\n\n#include \"runtime\/access\/access.h\"\n\n#include \"runtime\/visitors\/planiter_visitor.h\"\n\n#include \n#include \n#include \n#include \n\n#include \"store\/api\/item.h\"\n#include \"store\/api\/iterator.h\"\n#include \"store\/api\/item_factory.h\"\n#include \"store\/api\/shared_types.h\"\n#include \"store\/api\/pul.h\"\n#include \"store\/api\/index.h\"\n#include \"store\/api\/annotation.h\"\n#include \"store\/api\/ic.h\"\n#include \"api\/dynamiccontextimpl.h\"\n#include \"api\/unmarshaller.h\"\n#include \"api\/xqueryimpl.h\"\n\nnamespace zorba {\n\n static zstring normalizeInput(zstring const& aUri, static_context* aSctx,\n QueryLoc const& loc)\n {\n zstring const aBaseUri = aSctx->get_base_uri();\n zstring lResolvedURI;\n\n try\n {\n \/\/ To support the very common (if technically incorrect) use\n \/\/ case of users passing local filesystem paths to fn:doc(),\n \/\/ we use the following heuristic: IF the base URI has a file:\n \/\/ scheme AND the incoming URI has no scheme, we will assume\n \/\/ the incoming URI is actually a filesystem path. QQQ For\n \/\/ the moment, we assume any \"unknown\" schemes are probably\n \/\/ Windows drive letters.\n if ((uri::get_scheme(aUri) == uri::none ||\n uri::get_scheme(aUri) == uri::unknown) &&\n uri::get_scheme(aBaseUri) == uri::file)\n {\n \/\/ Ok, we assume it's a filesystem path. First normalize it.\n zstring lNormalizedPath =\n fs::get_normalized_path(aUri, zstring(\"\"));\n \/\/ QQQ For now, get_normalized_path() doesn't do what we\n \/\/ want when base URI represents a file. So, when the\n \/\/ normalized path is relative, we pretend it's a relative\n \/\/ URI and resolve it as such.\n if (fs::is_absolute(lNormalizedPath))\n {\n URI::encode_file_URI(lNormalizedPath, lResolvedURI);\n }\n else\n {\n #ifdef WIN32\n ascii::replace_all(lNormalizedPath, '\\\\', '\/');\n #endif\n lResolvedURI = aSctx->resolve_relative_uri(lNormalizedPath, true);\n }\n }\n else\n {\n \/\/ We do NOT assume it's a filesystem path; just resolve it.\n lResolvedURI = aSctx->resolve_relative_uri(aUri, true);\n }\n }\n catch (ZorbaException& e)\n {\n if (e.diagnostic() == err::XQST0046)\n \/\/ the value of a URILiteral is of nonzero length and is not in the\n \/\/ lexical space of xs:anyURI.\n e.set_diagnostic(err::FODC0005);\n else\n e.set_diagnostic(err::FODC0002);\n\n set_source(e, loc);\n throw;\n }\n\n return lResolvedURI;\n }\n \n static void streamReleaser(std::istream* aStream)\n {\n }\n \n static void readDocument(\n zstring const& aUri,\n static_context* aSctx,\n PlanState& aPlanState,\n QueryLoc const& loc,\n store::Item_t& oResult)\n {\n \/\/Normilize input to handle filesystem paths, etc.\n zstring const lNormUri(normalizeInput(aUri, aSctx, loc));\n\n store::LoadProperties lLoadProperties;\n\n zstring lErrorMessage;\n std::auto_ptr lResource = aSctx->resolve_uri\n (lNormUri, internal::EntityData::SOME_CONTENT, lErrorMessage);\n\n internal::StreamResource* lStreamResource =\n dynamic_cast(lResource.get());\n \n if(lStreamResource == NULL)\n {\n throw XQUERY_EXCEPTION(err::FOUT1170, ERROR_PARAMS(aUri, lErrorMessage), ERROR_LOC(loc));\n }\n \n GENV_ITEMFACTORY->createStreamableString(\n oResult,\n *lStreamResource->getStream(),\n *lStreamResource->getStreamReleaser()\n );\n lStreamResource->setStreamReleaser(nullptr);\n \n if(oResult.isNull())\n {\n throw XQUERY_EXCEPTION(err::FOUT1170, ERROR_PARAMS(aUri), ERROR_LOC(loc));\n }\n }\n\n\/*******************************************************************************\n 14.8.5 fn:unparsed-text\n********************************************************************************\/\n bool FnUnparsedTextIterator::nextImpl(store::Item_t& result, PlanState& planState) const\n {\n store::Item_t unparsedText;\n store::Item_t uriItem;\n store::Item_t encodingItem;\n zstring uriString;\n\n PlanIteratorState* state;\n DEFAULT_STACK_INIT(PlanIteratorState, state, planState);\n\n if(consumeNext(uriItem, theChildren[0].getp(), planState))\n {\n uriItem->getStringValue2(uriString);\n readDocument(uriString, theSctx, planState, loc, result);\n STACK_PUSH(true, state);\n }\n else \n STACK_PUSH(false, state);\n\n STACK_END(state);\n }\n\n\n\/*******************************************************************************\n 14.8.7 fn:unparsed-text-available\n********************************************************************************\/\n \n bool FnUnparsedTextAvailableIterator::nextImpl(store::Item_t& result, PlanState& planState) const\n {\n store::Item_t unparsedText;\n store::Item_t uriItem;\n store::Item_t encodingItem;\n zstring uriString;\n\n PlanIteratorState* state;\n DEFAULT_STACK_INIT(PlanIteratorState, state, planState);\n\n if(consumeNext(uriItem, theChildren[0].getp(), planState))\n {\n uriItem->getStringValue2(uriString);\n readDocument(uriString, theSctx, planState, loc, unparsedText);\n STACK_PUSH(GENV_ITEMFACTORY->createBoolean(result, !(unparsedText.isNull()) ), state);\n }\n else \n STACK_PUSH(GENV_ITEMFACTORY->createBoolean(result, false), state);\n\n STACK_END(state);\n }\n\n}\/\/namespace zorba\nadded include file to access_impl.cpp\/*\n * Copyright 2006-2008 The FLWOR Foundation.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include \"stdafx.h\"\n\n#include \"diagnostics\/assert.h\"\n#include \"diagnostics\/xquery_diagnostics.h\"\n\n\n#include \"system\/globalenv.h\"\n\n#include \"context\/namespace_context.h\"\n#include \"context\/static_context.h\"\n#include \"context\/dynamic_context.h\"\n\n#include \"runtime\/access\/access.h\"\n\n#include \"runtime\/visitors\/planiter_visitor.h\"\n\n#include \n#include \n#include \n#include \n\n#include \"store\/api\/item.h\"\n#include \"store\/api\/iterator.h\"\n#include \"store\/api\/item_factory.h\"\n#include \"store\/api\/shared_types.h\"\n#include \"store\/api\/pul.h\"\n#include \"store\/api\/index.h\"\n#include \"store\/api\/annotation.h\"\n#include \"store\/api\/ic.h\"\n#include \"store\/api\/load_properties.h\"\n#include \"api\/dynamiccontextimpl.h\"\n#include \"api\/unmarshaller.h\"\n#include \"api\/xqueryimpl.h\"\n\nnamespace zorba {\n\n static zstring normalizeInput(zstring const& aUri, static_context* aSctx,\n QueryLoc const& loc)\n {\n zstring const aBaseUri = aSctx->get_base_uri();\n zstring lResolvedURI;\n\n try\n {\n \/\/ To support the very common (if technically incorrect) use\n \/\/ case of users passing local filesystem paths to fn:doc(),\n \/\/ we use the following heuristic: IF the base URI has a file:\n \/\/ scheme AND the incoming URI has no scheme, we will assume\n \/\/ the incoming URI is actually a filesystem path. QQQ For\n \/\/ the moment, we assume any \"unknown\" schemes are probably\n \/\/ Windows drive letters.\n if ((uri::get_scheme(aUri) == uri::none ||\n uri::get_scheme(aUri) == uri::unknown) &&\n uri::get_scheme(aBaseUri) == uri::file)\n {\n \/\/ Ok, we assume it's a filesystem path. First normalize it.\n zstring lNormalizedPath =\n fs::get_normalized_path(aUri, zstring(\"\"));\n \/\/ QQQ For now, get_normalized_path() doesn't do what we\n \/\/ want when base URI represents a file. So, when the\n \/\/ normalized path is relative, we pretend it's a relative\n \/\/ URI and resolve it as such.\n if (fs::is_absolute(lNormalizedPath))\n {\n URI::encode_file_URI(lNormalizedPath, lResolvedURI);\n }\n else\n {\n #ifdef WIN32\n ascii::replace_all(lNormalizedPath, '\\\\', '\/');\n #endif\n lResolvedURI = aSctx->resolve_relative_uri(lNormalizedPath, true);\n }\n }\n else\n {\n \/\/ We do NOT assume it's a filesystem path; just resolve it.\n lResolvedURI = aSctx->resolve_relative_uri(aUri, true);\n }\n }\n catch (ZorbaException& e)\n {\n if (e.diagnostic() == err::XQST0046)\n \/\/ the value of a URILiteral is of nonzero length and is not in the\n \/\/ lexical space of xs:anyURI.\n e.set_diagnostic(err::FODC0005);\n else\n e.set_diagnostic(err::FODC0002);\n\n set_source(e, loc);\n throw;\n }\n\n return lResolvedURI;\n }\n \n static void streamReleaser(std::istream* aStream)\n {\n }\n \n static void readDocument(\n zstring const& aUri,\n static_context* aSctx,\n PlanState& aPlanState,\n QueryLoc const& loc,\n store::Item_t& oResult)\n {\n \/\/Normilize input to handle filesystem paths, etc.\n zstring const lNormUri(normalizeInput(aUri, aSctx, loc));\n\n store::LoadProperties lLoadProperties;\n\n zstring lErrorMessage;\n std::auto_ptr lResource = aSctx->resolve_uri\n (lNormUri, internal::EntityData::SOME_CONTENT, lErrorMessage);\n\n internal::StreamResource* lStreamResource =\n dynamic_cast(lResource.get());\n \n if(lStreamResource == NULL)\n {\n throw XQUERY_EXCEPTION(err::FOUT1170, ERROR_PARAMS(aUri, lErrorMessage), ERROR_LOC(loc));\n }\n \n GENV_ITEMFACTORY->createStreamableString(\n oResult,\n *lStreamResource->getStream(),\n *lStreamResource->getStreamReleaser()\n );\n lStreamResource->setStreamReleaser(nullptr);\n \n if(oResult.isNull())\n {\n throw XQUERY_EXCEPTION(err::FOUT1170, ERROR_PARAMS(aUri), ERROR_LOC(loc));\n }\n }\n\n\/*******************************************************************************\n 14.8.5 fn:unparsed-text\n********************************************************************************\/\n bool FnUnparsedTextIterator::nextImpl(store::Item_t& result, PlanState& planState) const\n {\n store::Item_t unparsedText;\n store::Item_t uriItem;\n store::Item_t encodingItem;\n zstring uriString;\n\n PlanIteratorState* state;\n DEFAULT_STACK_INIT(PlanIteratorState, state, planState);\n\n if(consumeNext(uriItem, theChildren[0].getp(), planState))\n {\n uriItem->getStringValue2(uriString);\n readDocument(uriString, theSctx, planState, loc, result);\n STACK_PUSH(true, state);\n }\n else \n STACK_PUSH(false, state);\n\n STACK_END(state);\n }\n\n\n\/*******************************************************************************\n 14.8.7 fn:unparsed-text-available\n********************************************************************************\/\n \n bool FnUnparsedTextAvailableIterator::nextImpl(store::Item_t& result, PlanState& planState) const\n {\n store::Item_t unparsedText;\n store::Item_t uriItem;\n store::Item_t encodingItem;\n zstring uriString;\n\n PlanIteratorState* state;\n DEFAULT_STACK_INIT(PlanIteratorState, state, planState);\n\n if(consumeNext(uriItem, theChildren[0].getp(), planState))\n {\n uriItem->getStringValue2(uriString);\n readDocument(uriString, theSctx, planState, loc, unparsedText);\n STACK_PUSH(GENV_ITEMFACTORY->createBoolean(result, !(unparsedText.isNull()) ), state);\n }\n else \n STACK_PUSH(GENV_ITEMFACTORY->createBoolean(result, false), state);\n\n STACK_END(state);\n }\n\n}\/\/namespace zorba\n<|endoftext|>"} {"text":"\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"consoleprocess_p.h\"\n\n#include \"qtcprocess.h\"\n\n#include \n#include \n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\nnamespace Utils {\n\nConsoleProcessPrivate::ConsoleProcessPrivate() :\n m_mode(ConsoleProcess::Run),\n m_appPid(0),\n m_stubSocket(0),\n m_tempFile(0),\n m_settings(0),\n m_stubConnected(false),\n m_stubPid(0),\n m_stubConnectTimer(0)\n{\n}\n\nConsoleProcess::ConsoleProcess(QObject *parent) :\n QObject(parent), d(new ConsoleProcessPrivate)\n{\n connect(&d->m_stubServer, SIGNAL(newConnection()), SLOT(stubConnectionAvailable()));\n\n d->m_process.setProcessChannelMode(QProcess::ForwardedChannels);\n}\n\nqint64 ConsoleProcess::applicationMainThreadID() const\n{\n QTC_CHECK(false);\n return -1;\n}\n\nvoid ConsoleProcess::setSettings(QSettings *settings)\n{\n d->m_settings = settings;\n}\n\nbool ConsoleProcess::start(const QString &program, const QString &args)\n{\n if (isRunning())\n return false;\n\n QtcProcess::SplitError perr;\n QtcProcess::Arguments pargs = QtcProcess::prepareArgs(args, &perr, HostOsInfo::hostOs(),\n &d->m_environment, &d->m_workingDir);\n QString pcmd;\n if (perr == QtcProcess::SplitOk) {\n pcmd = program;\n } else {\n if (perr != QtcProcess::FoundMeta) {\n emit processError(tr(\"Quoting error in command.\"));\n return false;\n }\n if (d->m_mode == Debug) {\n \/\/ FIXME: QTCREATORBUG-2809\n emit processError(tr(\"Debugging complex shell commands in a terminal\"\n \" is currently not supported.\"));\n return false;\n }\n pcmd = QLatin1String(\"\/bin\/sh\");\n pargs = QtcProcess::Arguments::createUnixArgs(QStringList()\n << QLatin1String(\"-c\")\n << (QtcProcess::quoteArg(program) + QLatin1Char(' ') + args));\n }\n\n QtcProcess::SplitError qerr;\n QtcProcess::Arguments xtermArgs = QtcProcess::prepareArgs(terminalEmulator(d->m_settings), &qerr,\n HostOsInfo::hostOs(),\n &d->m_environment, &d->m_workingDir);\n if (qerr != QtcProcess::SplitOk) {\n emit processError(qerr == QtcProcess::BadQuoting\n ? tr(\"Quoting error in terminal command.\")\n : tr(\"Terminal command may not be a shell command.\"));\n return false;\n }\n\n const QString err = stubServerListen();\n if (!err.isEmpty()) {\n emit processError(msgCommChannelFailed(err));\n return false;\n }\n\n QStringList env = d->m_environment.toStringList();\n if (!env.isEmpty()) {\n d->m_tempFile = new QTemporaryFile();\n if (!d->m_tempFile->open()) {\n stubServerShutdown();\n emit processError(msgCannotCreateTempFile(d->m_tempFile->errorString()));\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n QByteArray contents;\n foreach (const QString &var, env) {\n QByteArray l8b = var.toLocal8Bit();\n contents.append(l8b.constData(), l8b.size() + 1);\n }\n if (d->m_tempFile->write(contents) != contents.size() || !d->m_tempFile->flush()) {\n stubServerShutdown();\n emit processError(msgCannotWriteTempFile());\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n }\n\n QString stubPath = QCoreApplication::applicationDirPath();\n if (Utils::HostOsInfo::isMacHost())\n stubPath.append(QLatin1String(\"\/..\/Resources\/qtcreator_process_stub\"));\n else\n stubPath.append(QLatin1String(\"\/qtcreator_process_stub\"));\n\n QStringList allArgs = xtermArgs.toUnixArgs();\n allArgs << stubPath\n << modeOption(d->m_mode)\n << d->m_stubServer.fullServerName()\n << msgPromptToClose()\n << workingDirectory()\n << (d->m_tempFile ? d->m_tempFile->fileName() : QString())\n << pcmd << pargs.toUnixArgs();\n\n QString xterm = allArgs.takeFirst();\n d->m_process.start(xterm, allArgs);\n if (!d->m_process.waitForStarted()) {\n stubServerShutdown();\n emit processError(tr(\"Cannot start the terminal emulator '%1', change the setting in the \"\n \"Environment options.\").arg(xterm));\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n d->m_stubConnectTimer = new QTimer(this);\n connect(d->m_stubConnectTimer, SIGNAL(timeout()), SLOT(stop()));\n d->m_stubConnectTimer->setSingleShot(true);\n d->m_stubConnectTimer->start(10000);\n d->m_executable = program;\n return true;\n}\n\nvoid ConsoleProcess::killProcess()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"k\", 1);\n d->m_stubSocket->flush();\n }\n d->m_appPid = 0;\n}\n\nvoid ConsoleProcess::killStub()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"s\", 1);\n d->m_stubSocket->flush();\n }\n stubServerShutdown();\n d->m_stubPid = 0;\n}\n\nvoid ConsoleProcess::detachStub()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"d\", 1);\n d->m_stubSocket->flush();\n }\n stubServerShutdown();\n d->m_stubPid = 0;\n}\n\nvoid ConsoleProcess::stop()\n{\n killProcess();\n killStub();\n if (isRunning()) {\n d->m_process.terminate();\n if (!d->m_process.waitForFinished(1000)) {\n d->m_process.kill();\n d->m_process.waitForFinished();\n }\n }\n}\n\nbool ConsoleProcess::isRunning() const\n{\n return d->m_process.state() != QProcess::NotRunning\n || (d->m_stubSocket && d->m_stubSocket->isOpen());\n}\n\nQString ConsoleProcess::stubServerListen()\n{\n \/\/ We need to put the socket in a private directory, as some systems simply do not\n \/\/ check the file permissions of sockets.\n QString stubFifoDir;\n forever {\n {\n QTemporaryFile tf;\n if (!tf.open())\n return msgCannotCreateTempFile(tf.errorString());\n stubFifoDir = tf.fileName();\n }\n \/\/ By now the temp file was deleted again\n d->m_stubServerDir = QFile::encodeName(stubFifoDir);\n if (!::mkdir(d->m_stubServerDir.constData(), 0700))\n break;\n if (errno != EEXIST)\n return msgCannotCreateTempDir(stubFifoDir, QString::fromLocal8Bit(strerror(errno)));\n }\n const QString stubServer = stubFifoDir + QLatin1String(\"\/stub-socket\");\n if (!d->m_stubServer.listen(stubServer)) {\n ::rmdir(d->m_stubServerDir.constData());\n return tr(\"Cannot create socket '%1': %2\").arg(stubServer, d->m_stubServer.errorString());\n }\n return QString();\n}\n\nvoid ConsoleProcess::stubServerShutdown()\n{\n if (d->m_stubSocket) {\n readStubOutput(); \/\/ we could get the shutdown signal before emptying the buffer\n d->m_stubSocket->disconnect(); \/\/ avoid getting queued readyRead signals\n d->m_stubSocket->deleteLater(); \/\/ we might be called from the disconnected signal of m_stubSocket\n }\n d->m_stubSocket = 0;\n if (d->m_stubServer.isListening()) {\n d->m_stubServer.close();\n ::rmdir(d->m_stubServerDir.constData());\n }\n}\n\nvoid ConsoleProcess::stubConnectionAvailable()\n{\n if (d->m_stubConnectTimer) {\n delete d->m_stubConnectTimer;\n d->m_stubConnectTimer = 0;\n }\n d->m_stubConnected = true;\n emit stubStarted();\n d->m_stubSocket = d->m_stubServer.nextPendingConnection();\n connect(d->m_stubSocket, SIGNAL(readyRead()), SLOT(readStubOutput()));\n connect(d->m_stubSocket, SIGNAL(disconnected()), SLOT(stubExited()));\n}\n\nstatic QString errorMsg(int code)\n{\n return QString::fromLocal8Bit(strerror(code));\n}\n\nvoid ConsoleProcess::readStubOutput()\n{\n while (d->m_stubSocket->canReadLine()) {\n QByteArray out = d->m_stubSocket->readLine();\n out.chop(1); \/\/ \\n\n if (out.startsWith(\"err:chdir \")) {\n emit processError(msgCannotChangeToWorkDir(workingDirectory(), errorMsg(out.mid(10).toInt())));\n } else if (out.startsWith(\"err:exec \")) {\n emit processError(msgCannotExecute(d->m_executable, errorMsg(out.mid(9).toInt())));\n } else if (out.startsWith(\"spid \")) {\n delete d->m_tempFile;\n d->m_tempFile = 0;\n\n d->m_stubPid = out.mid(4).toInt();\n } else if (out.startsWith(\"pid \")) {\n d->m_appPid = out.mid(4).toInt();\n emit processStarted();\n } else if (out.startsWith(\"exit \")) {\n d->m_appStatus = QProcess::NormalExit;\n d->m_appCode = out.mid(5).toInt();\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus);\n } else if (out.startsWith(\"crash \")) {\n d->m_appStatus = QProcess::CrashExit;\n d->m_appCode = out.mid(6).toInt();\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus);\n } else {\n emit processError(msgUnexpectedOutput(out));\n d->m_stubPid = 0;\n d->m_process.terminate();\n break;\n }\n }\n}\n\nvoid ConsoleProcess::stubExited()\n{\n \/\/ The stub exit might get noticed before we read the error status.\n if (d->m_stubSocket && d->m_stubSocket->state() == QLocalSocket::ConnectedState)\n d->m_stubSocket->waitForDisconnected();\n stubServerShutdown();\n d->m_stubPid = 0;\n delete d->m_tempFile;\n d->m_tempFile = 0;\n if (d->m_appPid) {\n d->m_appStatus = QProcess::CrashExit;\n d->m_appCode = -1;\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus); \/\/ Maybe it actually did not, but keep state consistent\n }\n emit stubStopped();\n}\n\nstruct Terminal {\n const char *binary;\n const char *options;\n};\n\nstatic const Terminal knownTerminals[] =\n{\n {\"xterm\", \"-e\"},\n {\"aterm\", \"-e\"},\n {\"Eterm\", \"-e\"},\n {\"rxvt\", \"-e\"},\n {\"urxvt\", \"-e\"},\n {\"xfce4-terminal\", \"-x\"},\n {\"konsole\", \"-e\"},\n {\"gnome-terminal\", \"-x\"}\n};\n\nQString ConsoleProcess::defaultTerminalEmulator()\n{\n if (Utils::HostOsInfo::isMacHost()) {\n QString termCmd = QCoreApplication::applicationDirPath() + QLatin1String(\"\/..\/Resources\/scripts\/openTerminal.command\");\n if (QFile(termCmd).exists())\n return termCmd.replace(QLatin1Char(' '), QLatin1String(\"\\\\ \"));\n return QLatin1String(\"\/usr\/X11\/bin\/xterm\");\n }\n const Environment env = Environment::systemEnvironment();\n const int terminalCount = int(sizeof(knownTerminals) \/ sizeof(knownTerminals[0]));\n for (int i = 0; i < terminalCount; ++i) {\n QString result = env.searchInPath(QLatin1String(knownTerminals[i].binary));\n if (!result.isEmpty()) {\n result += QLatin1Char(' ');\n result += QLatin1String(knownTerminals[i].options);\n return result;\n }\n }\n return QLatin1String(\"xterm -e\");\n}\n\nQStringList ConsoleProcess::availableTerminalEmulators()\n{\n QStringList result;\n const Environment env = Environment::systemEnvironment();\n const int terminalCount = int(sizeof(knownTerminals) \/ sizeof(knownTerminals[0]));\n for (int i = 0; i < terminalCount; ++i) {\n QString terminal = env.searchInPath(QLatin1String(knownTerminals[i].binary));\n if (!terminal.isEmpty()) {\n terminal += QLatin1Char(' ');\n terminal += QLatin1String(knownTerminals[i].options);\n result.push_back(terminal);\n }\n }\n if (!result.contains(defaultTerminalEmulator()))\n result.append(defaultTerminalEmulator());\n result.sort();\n return result;\n}\n\n} \/\/ namespace Utils\nConsoleProcess: Remove assert\/****************************************************************************\n**\n** Copyright (C) 2014 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"consoleprocess_p.h\"\n\n#include \"qtcprocess.h\"\n\n#include \n#include \n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\nnamespace Utils {\n\nConsoleProcessPrivate::ConsoleProcessPrivate() :\n m_mode(ConsoleProcess::Run),\n m_appPid(0),\n m_stubSocket(0),\n m_tempFile(0),\n m_settings(0),\n m_stubConnected(false),\n m_stubPid(0),\n m_stubConnectTimer(0)\n{\n}\n\nConsoleProcess::ConsoleProcess(QObject *parent) :\n QObject(parent), d(new ConsoleProcessPrivate)\n{\n connect(&d->m_stubServer, SIGNAL(newConnection()), SLOT(stubConnectionAvailable()));\n\n d->m_process.setProcessChannelMode(QProcess::ForwardedChannels);\n}\n\nqint64 ConsoleProcess::applicationMainThreadID() const\n{\n return -1;\n}\n\nvoid ConsoleProcess::setSettings(QSettings *settings)\n{\n d->m_settings = settings;\n}\n\nbool ConsoleProcess::start(const QString &program, const QString &args)\n{\n if (isRunning())\n return false;\n\n QtcProcess::SplitError perr;\n QtcProcess::Arguments pargs = QtcProcess::prepareArgs(args, &perr, HostOsInfo::hostOs(),\n &d->m_environment, &d->m_workingDir);\n QString pcmd;\n if (perr == QtcProcess::SplitOk) {\n pcmd = program;\n } else {\n if (perr != QtcProcess::FoundMeta) {\n emit processError(tr(\"Quoting error in command.\"));\n return false;\n }\n if (d->m_mode == Debug) {\n \/\/ FIXME: QTCREATORBUG-2809\n emit processError(tr(\"Debugging complex shell commands in a terminal\"\n \" is currently not supported.\"));\n return false;\n }\n pcmd = QLatin1String(\"\/bin\/sh\");\n pargs = QtcProcess::Arguments::createUnixArgs(QStringList()\n << QLatin1String(\"-c\")\n << (QtcProcess::quoteArg(program) + QLatin1Char(' ') + args));\n }\n\n QtcProcess::SplitError qerr;\n QtcProcess::Arguments xtermArgs = QtcProcess::prepareArgs(terminalEmulator(d->m_settings), &qerr,\n HostOsInfo::hostOs(),\n &d->m_environment, &d->m_workingDir);\n if (qerr != QtcProcess::SplitOk) {\n emit processError(qerr == QtcProcess::BadQuoting\n ? tr(\"Quoting error in terminal command.\")\n : tr(\"Terminal command may not be a shell command.\"));\n return false;\n }\n\n const QString err = stubServerListen();\n if (!err.isEmpty()) {\n emit processError(msgCommChannelFailed(err));\n return false;\n }\n\n QStringList env = d->m_environment.toStringList();\n if (!env.isEmpty()) {\n d->m_tempFile = new QTemporaryFile();\n if (!d->m_tempFile->open()) {\n stubServerShutdown();\n emit processError(msgCannotCreateTempFile(d->m_tempFile->errorString()));\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n QByteArray contents;\n foreach (const QString &var, env) {\n QByteArray l8b = var.toLocal8Bit();\n contents.append(l8b.constData(), l8b.size() + 1);\n }\n if (d->m_tempFile->write(contents) != contents.size() || !d->m_tempFile->flush()) {\n stubServerShutdown();\n emit processError(msgCannotWriteTempFile());\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n }\n\n QString stubPath = QCoreApplication::applicationDirPath();\n if (Utils::HostOsInfo::isMacHost())\n stubPath.append(QLatin1String(\"\/..\/Resources\/qtcreator_process_stub\"));\n else\n stubPath.append(QLatin1String(\"\/qtcreator_process_stub\"));\n\n QStringList allArgs = xtermArgs.toUnixArgs();\n allArgs << stubPath\n << modeOption(d->m_mode)\n << d->m_stubServer.fullServerName()\n << msgPromptToClose()\n << workingDirectory()\n << (d->m_tempFile ? d->m_tempFile->fileName() : QString())\n << pcmd << pargs.toUnixArgs();\n\n QString xterm = allArgs.takeFirst();\n d->m_process.start(xterm, allArgs);\n if (!d->m_process.waitForStarted()) {\n stubServerShutdown();\n emit processError(tr(\"Cannot start the terminal emulator '%1', change the setting in the \"\n \"Environment options.\").arg(xterm));\n delete d->m_tempFile;\n d->m_tempFile = 0;\n return false;\n }\n d->m_stubConnectTimer = new QTimer(this);\n connect(d->m_stubConnectTimer, SIGNAL(timeout()), SLOT(stop()));\n d->m_stubConnectTimer->setSingleShot(true);\n d->m_stubConnectTimer->start(10000);\n d->m_executable = program;\n return true;\n}\n\nvoid ConsoleProcess::killProcess()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"k\", 1);\n d->m_stubSocket->flush();\n }\n d->m_appPid = 0;\n}\n\nvoid ConsoleProcess::killStub()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"s\", 1);\n d->m_stubSocket->flush();\n }\n stubServerShutdown();\n d->m_stubPid = 0;\n}\n\nvoid ConsoleProcess::detachStub()\n{\n if (d->m_stubSocket && d->m_stubSocket->isWritable()) {\n d->m_stubSocket->write(\"d\", 1);\n d->m_stubSocket->flush();\n }\n stubServerShutdown();\n d->m_stubPid = 0;\n}\n\nvoid ConsoleProcess::stop()\n{\n killProcess();\n killStub();\n if (isRunning()) {\n d->m_process.terminate();\n if (!d->m_process.waitForFinished(1000)) {\n d->m_process.kill();\n d->m_process.waitForFinished();\n }\n }\n}\n\nbool ConsoleProcess::isRunning() const\n{\n return d->m_process.state() != QProcess::NotRunning\n || (d->m_stubSocket && d->m_stubSocket->isOpen());\n}\n\nQString ConsoleProcess::stubServerListen()\n{\n \/\/ We need to put the socket in a private directory, as some systems simply do not\n \/\/ check the file permissions of sockets.\n QString stubFifoDir;\n forever {\n {\n QTemporaryFile tf;\n if (!tf.open())\n return msgCannotCreateTempFile(tf.errorString());\n stubFifoDir = tf.fileName();\n }\n \/\/ By now the temp file was deleted again\n d->m_stubServerDir = QFile::encodeName(stubFifoDir);\n if (!::mkdir(d->m_stubServerDir.constData(), 0700))\n break;\n if (errno != EEXIST)\n return msgCannotCreateTempDir(stubFifoDir, QString::fromLocal8Bit(strerror(errno)));\n }\n const QString stubServer = stubFifoDir + QLatin1String(\"\/stub-socket\");\n if (!d->m_stubServer.listen(stubServer)) {\n ::rmdir(d->m_stubServerDir.constData());\n return tr(\"Cannot create socket '%1': %2\").arg(stubServer, d->m_stubServer.errorString());\n }\n return QString();\n}\n\nvoid ConsoleProcess::stubServerShutdown()\n{\n if (d->m_stubSocket) {\n readStubOutput(); \/\/ we could get the shutdown signal before emptying the buffer\n d->m_stubSocket->disconnect(); \/\/ avoid getting queued readyRead signals\n d->m_stubSocket->deleteLater(); \/\/ we might be called from the disconnected signal of m_stubSocket\n }\n d->m_stubSocket = 0;\n if (d->m_stubServer.isListening()) {\n d->m_stubServer.close();\n ::rmdir(d->m_stubServerDir.constData());\n }\n}\n\nvoid ConsoleProcess::stubConnectionAvailable()\n{\n if (d->m_stubConnectTimer) {\n delete d->m_stubConnectTimer;\n d->m_stubConnectTimer = 0;\n }\n d->m_stubConnected = true;\n emit stubStarted();\n d->m_stubSocket = d->m_stubServer.nextPendingConnection();\n connect(d->m_stubSocket, SIGNAL(readyRead()), SLOT(readStubOutput()));\n connect(d->m_stubSocket, SIGNAL(disconnected()), SLOT(stubExited()));\n}\n\nstatic QString errorMsg(int code)\n{\n return QString::fromLocal8Bit(strerror(code));\n}\n\nvoid ConsoleProcess::readStubOutput()\n{\n while (d->m_stubSocket->canReadLine()) {\n QByteArray out = d->m_stubSocket->readLine();\n out.chop(1); \/\/ \\n\n if (out.startsWith(\"err:chdir \")) {\n emit processError(msgCannotChangeToWorkDir(workingDirectory(), errorMsg(out.mid(10).toInt())));\n } else if (out.startsWith(\"err:exec \")) {\n emit processError(msgCannotExecute(d->m_executable, errorMsg(out.mid(9).toInt())));\n } else if (out.startsWith(\"spid \")) {\n delete d->m_tempFile;\n d->m_tempFile = 0;\n\n d->m_stubPid = out.mid(4).toInt();\n } else if (out.startsWith(\"pid \")) {\n d->m_appPid = out.mid(4).toInt();\n emit processStarted();\n } else if (out.startsWith(\"exit \")) {\n d->m_appStatus = QProcess::NormalExit;\n d->m_appCode = out.mid(5).toInt();\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus);\n } else if (out.startsWith(\"crash \")) {\n d->m_appStatus = QProcess::CrashExit;\n d->m_appCode = out.mid(6).toInt();\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus);\n } else {\n emit processError(msgUnexpectedOutput(out));\n d->m_stubPid = 0;\n d->m_process.terminate();\n break;\n }\n }\n}\n\nvoid ConsoleProcess::stubExited()\n{\n \/\/ The stub exit might get noticed before we read the error status.\n if (d->m_stubSocket && d->m_stubSocket->state() == QLocalSocket::ConnectedState)\n d->m_stubSocket->waitForDisconnected();\n stubServerShutdown();\n d->m_stubPid = 0;\n delete d->m_tempFile;\n d->m_tempFile = 0;\n if (d->m_appPid) {\n d->m_appStatus = QProcess::CrashExit;\n d->m_appCode = -1;\n d->m_appPid = 0;\n emit processStopped(d->m_appCode, d->m_appStatus); \/\/ Maybe it actually did not, but keep state consistent\n }\n emit stubStopped();\n}\n\nstruct Terminal {\n const char *binary;\n const char *options;\n};\n\nstatic const Terminal knownTerminals[] =\n{\n {\"xterm\", \"-e\"},\n {\"aterm\", \"-e\"},\n {\"Eterm\", \"-e\"},\n {\"rxvt\", \"-e\"},\n {\"urxvt\", \"-e\"},\n {\"xfce4-terminal\", \"-x\"},\n {\"konsole\", \"-e\"},\n {\"gnome-terminal\", \"-x\"}\n};\n\nQString ConsoleProcess::defaultTerminalEmulator()\n{\n if (Utils::HostOsInfo::isMacHost()) {\n QString termCmd = QCoreApplication::applicationDirPath() + QLatin1String(\"\/..\/Resources\/scripts\/openTerminal.command\");\n if (QFile(termCmd).exists())\n return termCmd.replace(QLatin1Char(' '), QLatin1String(\"\\\\ \"));\n return QLatin1String(\"\/usr\/X11\/bin\/xterm\");\n }\n const Environment env = Environment::systemEnvironment();\n const int terminalCount = int(sizeof(knownTerminals) \/ sizeof(knownTerminals[0]));\n for (int i = 0; i < terminalCount; ++i) {\n QString result = env.searchInPath(QLatin1String(knownTerminals[i].binary));\n if (!result.isEmpty()) {\n result += QLatin1Char(' ');\n result += QLatin1String(knownTerminals[i].options);\n return result;\n }\n }\n return QLatin1String(\"xterm -e\");\n}\n\nQStringList ConsoleProcess::availableTerminalEmulators()\n{\n QStringList result;\n const Environment env = Environment::systemEnvironment();\n const int terminalCount = int(sizeof(knownTerminals) \/ sizeof(knownTerminals[0]));\n for (int i = 0; i < terminalCount; ++i) {\n QString terminal = env.searchInPath(QLatin1String(knownTerminals[i].binary));\n if (!terminal.isEmpty()) {\n terminal += QLatin1Char(' ');\n terminal += QLatin1String(knownTerminals[i].options);\n result.push_back(terminal);\n }\n }\n if (!result.contains(defaultTerminalEmulator()))\n result.append(defaultTerminalEmulator());\n result.sort();\n return result;\n}\n\n} \/\/ namespace Utils\n<|endoftext|>"} {"text":"\/****************************************************************************\n *\n * (c) 2009-2020 QGROUNDCONTROL PROJECT \n *\n * QGroundControl is licensed according to the terms in the file\n * COPYING.md in the root of the source code directory.\n *\n ****************************************************************************\/\n\n#include \"CameraCalc.h\"\n#include \"JsonHelper.h\"\n#include \"Vehicle.h\"\n#include \"CameraMetaData.h\"\n\n#include \n\nconst char* CameraCalc::cameraNameName = \"CameraName\";\nconst char* CameraCalc::valueSetIsDistanceName = \"ValueSetIsDistance\";\nconst char* CameraCalc::distanceToSurfaceName = \"DistanceToSurface\";\nconst char* CameraCalc::distanceToSurfaceRelativeName = \"DistanceToSurfaceRelative\";\nconst char* CameraCalc::imageDensityName = \"ImageDensity\";\nconst char* CameraCalc::frontalOverlapName = \"FrontalOverlap\";\nconst char* CameraCalc::sideOverlapName = \"SideOverlap\";\nconst char* CameraCalc::adjustedFootprintFrontalName = \"AdjustedFootprintFrontal\";\nconst char* CameraCalc::adjustedFootprintSideName = \"AdjustedFootprintSide\";\n\nconst char* CameraCalc::_jsonCameraSpecTypeKey = \"CameraSpecType\";\n\nCameraCalc::CameraCalc(Vehicle* vehicle, const QString& settingsGroup, QObject* parent)\n : CameraSpec (settingsGroup, parent)\n , _vehicle (vehicle)\n , _dirty (false)\n , _disableRecalc (false)\n , _distanceToSurfaceRelative (true)\n , _metaDataMap (FactMetaData::createMapFromJsonFile(QStringLiteral(\":\/json\/CameraCalc.FactMetaData.json\"), this))\n , _cameraNameFact (settingsGroup, _metaDataMap[cameraNameName])\n , _valueSetIsDistanceFact (settingsGroup, _metaDataMap[valueSetIsDistanceName])\n , _distanceToSurfaceFact (settingsGroup, _metaDataMap[distanceToSurfaceName])\n , _imageDensityFact (settingsGroup, _metaDataMap[imageDensityName])\n , _frontalOverlapFact (settingsGroup, _metaDataMap[frontalOverlapName])\n , _sideOverlapFact (settingsGroup, _metaDataMap[sideOverlapName])\n , _adjustedFootprintSideFact (settingsGroup, _metaDataMap[adjustedFootprintSideName])\n , _adjustedFootprintFrontalFact (settingsGroup, _metaDataMap[adjustedFootprintFrontalName])\n , _imageFootprintSide (0)\n , _imageFootprintFrontal (0)\n , _knownCameraList (_vehicle->staticCameraList())\n{\n QQmlEngine::setObjectOwnership(this, QQmlEngine::CppOwnership);\n\n connect(&_valueSetIsDistanceFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_distanceToSurfaceFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_imageDensityFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_frontalOverlapFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_sideOverlapFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_adjustedFootprintSideFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_adjustedFootprintFrontalFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(this, &CameraCalc::distanceToSurfaceRelativeChanged, this, &CameraCalc::_setDirty);\n\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::_cameraNameChanged);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::isManualCameraChanged);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::isCustomCameraChanged);\n\n connect(&_distanceToSurfaceFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_imageDensityFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_frontalOverlapFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_sideOverlapFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(sensorWidth(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(sensorHeight(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(imageWidth(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(imageHeight(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(focalLength(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(landscape(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n\n _cameraNameChanged();\n\n setDirty(false);\n}\n\nvoid CameraCalc::setDirty(bool dirty)\n{\n if (_dirty != dirty) {\n _dirty = dirty;\n emit dirtyChanged(_dirty);\n }\n}\n\nvoid CameraCalc::_cameraNameChanged(void)\n{\n if (_disableRecalc) {\n return;\n }\n\n QString cameraName = _cameraNameFact.rawValue().toString();\n\n \/\/ Validate known camera name\n bool foundKnownCamera = false;\n CameraMetaData* cameraMetaData = nullptr;\n if (!isManualCamera() && !isCustomCamera()) {\n for (int cameraIndex=0; cameraIndex<_knownCameraList.count(); cameraIndex++) {\n cameraMetaData = _knownCameraList[cameraIndex].value();\n if (cameraName == cameraMetaData->name()) {\n foundKnownCamera = true;\n break;\n }\n }\n\n if (!foundKnownCamera) {\n \/\/ This will cause another camera changed signal which will recurse back to this routine\n _cameraNameFact.setRawValue(customCameraName());\n return;\n }\n }\n\n _disableRecalc = true;\n if (foundKnownCamera) {\n sensorWidth()->setRawValue (cameraMetaData->sensorWidth());\n sensorHeight()->setRawValue (cameraMetaData->sensorHeight());\n imageWidth()->setRawValue (cameraMetaData->imageWidth());\n imageHeight()->setRawValue (cameraMetaData->imageHeight());\n focalLength()->setRawValue (cameraMetaData->focalLength());\n landscape()->setRawValue (cameraMetaData->landscape());\n fixedOrientation()->setRawValue (cameraMetaData->fixedOrientation());\n minTriggerInterval()->setRawValue (cameraMetaData->minTriggerInterval());\n } else {\n if (isManualCamera() || isCustomCamera()) {\n \/\/ These values are unknown for these types\n fixedOrientation()->setRawValue(false);\n minTriggerInterval()->setRawValue(0);\n if (isManualCamera() && !valueSetIsDistance()->rawValue().toBool()) {\n valueSetIsDistance()->setRawValue(true);\n }\n } else {\n qWarning() << \"Internal Error: Not known camera, but now manual or custom either\";\n }\n }\n _disableRecalc = false;\n\n _recalcTriggerDistance();\n _adjustDistanceToSurfaceRelative();\n}\n\nvoid CameraCalc::_recalcTriggerDistance(void)\n{\n if (_disableRecalc || isManualCamera()) {\n return;\n }\n\n _disableRecalc = true;\n\n double focalLength = this->focalLength()->rawValue().toDouble();\n double sensorWidth = this->sensorWidth()->rawValue().toDouble();\n double sensorHeight = this->sensorHeight()->rawValue().toDouble();\n double imageWidth = this->imageWidth()->rawValue().toDouble();\n double imageHeight = this->imageHeight()->rawValue().toDouble();\n double imageDensity = _imageDensityFact.rawValue().toDouble();\n\n if (focalLength <= 0 || sensorWidth <= 0 || sensorHeight <= 0 || imageWidth <= 0 || imageHeight <= 0 || imageDensity <= 0) {\n return;\n }\n\n if (_valueSetIsDistanceFact.rawValue().toBool()) {\n _imageDensityFact.setRawValue((_distanceToSurfaceFact.rawValue().toDouble() * sensorWidth * 100.0) \/ (imageWidth * focalLength));\n } else {\n _distanceToSurfaceFact.setRawValue((imageWidth * _imageDensityFact.rawValue().toDouble() * focalLength) \/ (sensorWidth * 100.0));\n }\n\n imageDensity = _imageDensityFact.rawValue().toDouble();\n\n if (landscape()->rawValue().toBool()) {\n _imageFootprintSide = (imageWidth * imageDensity) \/ 100.0;\n _imageFootprintFrontal = (imageHeight * imageDensity) \/ 100.0;\n } else {\n _imageFootprintSide = (imageHeight * imageDensity) \/ 100.0;\n _imageFootprintFrontal = (imageWidth * imageDensity) \/ 100.0;\n }\n _adjustedFootprintSideFact.setRawValue (_imageFootprintSide * ((100.0 - _sideOverlapFact.rawValue().toDouble()) \/ 100.0));\n _adjustedFootprintFrontalFact.setRawValue (_imageFootprintFrontal * ((100.0 - _frontalOverlapFact.rawValue().toDouble()) \/ 100.0));\n\n emit imageFootprintSideChanged (_imageFootprintSide);\n emit imageFootprintFrontalChanged (_imageFootprintFrontal);\n\n _disableRecalc = false;\n}\n\nvoid CameraCalc::save(QJsonObject& json) const\n{\n json[JsonHelper::jsonVersionKey] = 1;\n json[adjustedFootprintSideName] = _adjustedFootprintSideFact.rawValue().toDouble();\n json[adjustedFootprintFrontalName] = _adjustedFootprintFrontalFact.rawValue().toDouble();\n json[distanceToSurfaceName] = _distanceToSurfaceFact.rawValue().toDouble();\n json[distanceToSurfaceRelativeName] = _distanceToSurfaceRelative;\n json[cameraNameName] = _cameraNameFact.rawValue().toString();\n\n if (!isManualCamera()) {\n CameraSpec::save(json);\n json[valueSetIsDistanceName] = _valueSetIsDistanceFact.rawValue().toBool();\n json[imageDensityName] = _imageDensityFact.rawValue().toDouble();\n json[frontalOverlapName] = _frontalOverlapFact.rawValue().toDouble();\n json[sideOverlapName] = _sideOverlapFact.rawValue().toDouble();\n }\n}\n\nbool CameraCalc::load(const QJsonObject& json, QString& errorString)\n{\n QJsonObject v1Json = json;\n\n if (!json.contains(JsonHelper::jsonVersionKey)) {\n \/\/ Version 0 file. Differences from Version 1 for conversion:\n \/\/ JsonHelper::jsonVersionKey not stored\n \/\/ _jsonCameraSpecTypeKey stores CameraSpecType\n \/\/ _jsonCameraNameKey only set if CameraSpecKnown\n int cameraSpec = v1Json[_jsonCameraSpecTypeKey].toInt(CameraSpecNone);\n if (cameraSpec == CameraSpecCustom) {\n v1Json[cameraNameName] = customCameraName();\n } else if (cameraSpec == CameraSpecNone) {\n v1Json[cameraNameName] = manualCameraName();\n }\n v1Json.remove(_jsonCameraSpecTypeKey);\n v1Json[JsonHelper::jsonVersionKey] = 1;\n }\n\n int version = v1Json[JsonHelper::jsonVersionKey].toInt();\n if (version != 1) {\n errorString = tr(\"CameraCalc section version %1 not supported\").arg(version);\n return false;\n }\n\n QList keyInfoList1 = {\n { cameraNameName, QJsonValue::String, true },\n { adjustedFootprintSideName, QJsonValue::Double, true },\n { adjustedFootprintFrontalName, QJsonValue::Double, true },\n { distanceToSurfaceName, QJsonValue::Double, true },\n { distanceToSurfaceRelativeName, QJsonValue::Bool, true },\n };\n if (!JsonHelper::validateKeys(v1Json, keyInfoList1, errorString)) {\n return false;\n }\n\n _disableRecalc = true;\n\n _distanceToSurfaceRelative = v1Json[distanceToSurfaceRelativeName].toBool();\n\n if (!isManualCamera()) {\n QList keyInfoList2 = {\n { valueSetIsDistanceName, QJsonValue::Bool, true },\n { imageDensityName, QJsonValue::Double, true },\n { frontalOverlapName, QJsonValue::Double, true },\n { sideOverlapName, QJsonValue::Double, true },\n };\n if (!JsonHelper::validateKeys(v1Json, keyInfoList2, errorString)) {\n _disableRecalc = false;\n return false;\n }\n\n _valueSetIsDistanceFact.setRawValue (v1Json[valueSetIsDistanceName].toBool());\n _frontalOverlapFact.setRawValue (v1Json[frontalOverlapName].toDouble());\n _sideOverlapFact.setRawValue (v1Json[sideOverlapName].toDouble());\n }\n\n _cameraNameFact.setRawValue (v1Json[cameraNameName].toString());\n _adjustedFootprintSideFact.setRawValue (v1Json[adjustedFootprintSideName].toDouble());\n _adjustedFootprintFrontalFact.setRawValue (v1Json[adjustedFootprintFrontalName].toDouble());\n _distanceToSurfaceFact.setRawValue (v1Json[distanceToSurfaceName].toDouble());\n if (!isManualCamera()) {\n _imageDensityFact.setRawValue(v1Json[imageDensityName].toDouble());\n\n if (!CameraSpec::load(v1Json, errorString)) {\n _disableRecalc = false;\n return false;\n }\n }\n\n _disableRecalc = false;\n\n return true;\n}\n\nQString CameraCalc::customCameraName(void)\n{\n return tr(\"Custom Camera\");\n}\n\nQString CameraCalc::manualCameraName(void)\n{\n return tr(\"Manual (no camera specs)\");\n}\n\nvoid CameraCalc::_adjustDistanceToSurfaceRelative(void)\n{\n if (!isManualCamera()) {\n setDistanceToSurfaceRelative(true);\n }\n}\n\nvoid CameraCalc::setDistanceToSurfaceRelative(bool distanceToSurfaceRelative)\n{\n if (distanceToSurfaceRelative != _distanceToSurfaceRelative) {\n _distanceToSurfaceRelative = distanceToSurfaceRelative;\n emit distanceToSurfaceRelativeChanged(distanceToSurfaceRelative);\n }\n}\n\nvoid CameraCalc::_setDirty(void)\n{\n setDirty(true);\n}\n\/****************************************************************************\n *\n * (c) 2009-2020 QGROUNDCONTROL PROJECT \n *\n * QGroundControl is licensed according to the terms in the file\n * COPYING.md in the root of the source code directory.\n *\n ****************************************************************************\/\n\n#include \"CameraCalc.h\"\n#include \"JsonHelper.h\"\n#include \"Vehicle.h\"\n#include \"CameraMetaData.h\"\n\n#include \n\nconst char* CameraCalc::cameraNameName = \"CameraName\";\nconst char* CameraCalc::valueSetIsDistanceName = \"ValueSetIsDistance\";\nconst char* CameraCalc::distanceToSurfaceName = \"DistanceToSurface\";\nconst char* CameraCalc::distanceToSurfaceRelativeName = \"DistanceToSurfaceRelative\";\nconst char* CameraCalc::imageDensityName = \"ImageDensity\";\nconst char* CameraCalc::frontalOverlapName = \"FrontalOverlap\";\nconst char* CameraCalc::sideOverlapName = \"SideOverlap\";\nconst char* CameraCalc::adjustedFootprintFrontalName = \"AdjustedFootprintFrontal\";\nconst char* CameraCalc::adjustedFootprintSideName = \"AdjustedFootprintSide\";\n\nconst char* CameraCalc::_jsonCameraSpecTypeKey = \"CameraSpecType\";\n\nCameraCalc::CameraCalc(Vehicle* vehicle, const QString& settingsGroup, QObject* parent)\n : CameraSpec (settingsGroup, parent)\n , _vehicle (vehicle)\n , _dirty (false)\n , _disableRecalc (false)\n , _distanceToSurfaceRelative (true)\n , _metaDataMap (FactMetaData::createMapFromJsonFile(QStringLiteral(\":\/json\/CameraCalc.FactMetaData.json\"), this))\n , _cameraNameFact (settingsGroup, _metaDataMap[cameraNameName])\n , _valueSetIsDistanceFact (settingsGroup, _metaDataMap[valueSetIsDistanceName])\n , _distanceToSurfaceFact (settingsGroup, _metaDataMap[distanceToSurfaceName])\n , _imageDensityFact (settingsGroup, _metaDataMap[imageDensityName])\n , _frontalOverlapFact (settingsGroup, _metaDataMap[frontalOverlapName])\n , _sideOverlapFact (settingsGroup, _metaDataMap[sideOverlapName])\n , _adjustedFootprintSideFact (settingsGroup, _metaDataMap[adjustedFootprintSideName])\n , _adjustedFootprintFrontalFact (settingsGroup, _metaDataMap[adjustedFootprintFrontalName])\n , _imageFootprintSide (0)\n , _imageFootprintFrontal (0)\n , _knownCameraList (_vehicle->staticCameraList())\n{\n QQmlEngine::setObjectOwnership(this, QQmlEngine::CppOwnership);\n\n connect(&_valueSetIsDistanceFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_distanceToSurfaceFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_imageDensityFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_frontalOverlapFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_sideOverlapFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_adjustedFootprintSideFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_adjustedFootprintFrontalFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::_setDirty);\n connect(this, &CameraCalc::distanceToSurfaceRelativeChanged, this, &CameraCalc::_setDirty);\n\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::_cameraNameChanged);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::isManualCameraChanged);\n connect(&_cameraNameFact, &Fact::valueChanged, this, &CameraCalc::isCustomCameraChanged);\n\n connect(&_distanceToSurfaceFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_imageDensityFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_frontalOverlapFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(&_sideOverlapFact, &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(sensorWidth(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(sensorHeight(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(imageWidth(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(imageHeight(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(focalLength(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n connect(landscape(), &Fact::rawValueChanged, this, &CameraCalc::_recalcTriggerDistance);\n\n _cameraNameChanged();\n\n setDirty(false);\n}\n\nvoid CameraCalc::setDirty(bool dirty)\n{\n if (_dirty != dirty) {\n _dirty = dirty;\n emit dirtyChanged(_dirty);\n }\n}\n\nvoid CameraCalc::_cameraNameChanged(void)\n{\n if (_disableRecalc) {\n return;\n }\n\n QString cameraName = _cameraNameFact.rawValue().toString();\n\n \/\/ Validate known camera name\n bool foundKnownCamera = false;\n CameraMetaData* cameraMetaData = nullptr;\n if (!isManualCamera() && !isCustomCamera()) {\n for (int cameraIndex=0; cameraIndex<_knownCameraList.count(); cameraIndex++) {\n cameraMetaData = _knownCameraList[cameraIndex].value();\n if (cameraName == cameraMetaData->name()) {\n foundKnownCamera = true;\n break;\n }\n }\n\n if (!foundKnownCamera) {\n \/\/ This will cause another camera changed signal which will recurse back to this routine\n _cameraNameFact.setRawValue(customCameraName());\n return;\n }\n }\n\n _disableRecalc = true;\n if (foundKnownCamera) {\n sensorWidth()->setRawValue (cameraMetaData->sensorWidth());\n sensorHeight()->setRawValue (cameraMetaData->sensorHeight());\n imageWidth()->setRawValue (cameraMetaData->imageWidth());\n imageHeight()->setRawValue (cameraMetaData->imageHeight());\n focalLength()->setRawValue (cameraMetaData->focalLength());\n landscape()->setRawValue (cameraMetaData->landscape());\n fixedOrientation()->setRawValue (cameraMetaData->fixedOrientation());\n minTriggerInterval()->setRawValue (cameraMetaData->minTriggerInterval());\n } else {\n if (isManualCamera() || isCustomCamera()) {\n \/\/ These values are unknown for these types\n fixedOrientation()->setRawValue(false);\n minTriggerInterval()->setRawValue(0);\n if (isManualCamera() && !valueSetIsDistance()->rawValue().toBool()) {\n valueSetIsDistance()->setRawValue(true);\n }\n } else {\n qWarning() << \"Internal Error: Not known camera, but now manual or custom either\";\n }\n }\n _disableRecalc = false;\n\n _recalcTriggerDistance();\n _adjustDistanceToSurfaceRelative();\n}\n\nvoid CameraCalc::_recalcTriggerDistance(void)\n{\n if (_disableRecalc || isManualCamera()) {\n return;\n }\n\n _disableRecalc = true;\n\n double focalLength = this->focalLength()->rawValue().toDouble();\n double sensorWidth = this->sensorWidth()->rawValue().toDouble();\n double sensorHeight = this->sensorHeight()->rawValue().toDouble();\n double imageWidth = this->imageWidth()->rawValue().toDouble();\n double imageHeight = this->imageHeight()->rawValue().toDouble();\n double imageDensity = _imageDensityFact.rawValue().toDouble();\n\n if (focalLength <= 0 || sensorWidth <= 0 || sensorHeight <= 0 || imageWidth <= 0 || imageHeight <= 0 || imageDensity <= 0) {\n return;\n }\n\n if (_valueSetIsDistanceFact.rawValue().toBool()) {\n _imageDensityFact.setRawValue((_distanceToSurfaceFact.rawValue().toDouble() * sensorWidth * 100.0) \/ (imageWidth * focalLength));\n } else {\n _distanceToSurfaceFact.setRawValue((imageWidth * _imageDensityFact.rawValue().toDouble() * focalLength) \/ (sensorWidth * 100.0));\n }\n\n imageDensity = _imageDensityFact.rawValue().toDouble();\n\n if (landscape()->rawValue().toBool()) {\n _imageFootprintSide = (imageWidth * imageDensity) \/ 100.0;\n _imageFootprintFrontal = (imageHeight * imageDensity) \/ 100.0;\n } else {\n _imageFootprintSide = (imageHeight * imageDensity) \/ 100.0;\n _imageFootprintFrontal = (imageWidth * imageDensity) \/ 100.0;\n }\n _adjustedFootprintSideFact.setRawValue (_imageFootprintSide * ((100.0 - _sideOverlapFact.rawValue().toDouble()) \/ 100.0));\n _adjustedFootprintFrontalFact.setRawValue (_imageFootprintFrontal * ((100.0 - _frontalOverlapFact.rawValue().toDouble()) \/ 100.0));\n\n emit imageFootprintSideChanged (_imageFootprintSide);\n emit imageFootprintFrontalChanged (_imageFootprintFrontal);\n\n _disableRecalc = false;\n}\n\nvoid CameraCalc::save(QJsonObject& json) const\n{\n json[JsonHelper::jsonVersionKey] = 1;\n json[adjustedFootprintSideName] = _adjustedFootprintSideFact.rawValue().toDouble();\n json[adjustedFootprintFrontalName] = _adjustedFootprintFrontalFact.rawValue().toDouble();\n json[distanceToSurfaceName] = _distanceToSurfaceFact.rawValue().toDouble();\n json[distanceToSurfaceRelativeName] = _distanceToSurfaceRelative;\n json[cameraNameName] = _cameraNameFact.rawValue().toString();\n\n if (!isManualCamera()) {\n CameraSpec::save(json);\n json[valueSetIsDistanceName] = _valueSetIsDistanceFact.rawValue().toBool();\n json[imageDensityName] = _imageDensityFact.rawValue().toDouble();\n json[frontalOverlapName] = _frontalOverlapFact.rawValue().toDouble();\n json[sideOverlapName] = _sideOverlapFact.rawValue().toDouble();\n }\n}\n\nbool CameraCalc::load(const QJsonObject& json, QString& errorString)\n{\n QJsonObject v1Json = json;\n\n if (!json.contains(JsonHelper::jsonVersionKey)) {\n \/\/ Version 0 file. Differences from Version 1 for conversion:\n \/\/ JsonHelper::jsonVersionKey not stored\n \/\/ _jsonCameraSpecTypeKey stores CameraSpecType\n \/\/ _jsonCameraNameKey only set if CameraSpecKnown\n int cameraSpec = v1Json[_jsonCameraSpecTypeKey].toInt(CameraSpecNone);\n if (cameraSpec == CameraSpecCustom) {\n v1Json[cameraNameName] = customCameraName();\n } else if (cameraSpec == CameraSpecNone) {\n v1Json[cameraNameName] = manualCameraName();\n }\n v1Json.remove(_jsonCameraSpecTypeKey);\n v1Json[JsonHelper::jsonVersionKey] = 1;\n }\n\n int version = v1Json[JsonHelper::jsonVersionKey].toInt();\n if (version != 1) {\n errorString = tr(\"CameraCalc section version %1 not supported\").arg(version);\n return false;\n }\n\n QList keyInfoList1 = {\n { cameraNameName, QJsonValue::String, true },\n { adjustedFootprintSideName, QJsonValue::Double, true },\n { adjustedFootprintFrontalName, QJsonValue::Double, true },\n { distanceToSurfaceName, QJsonValue::Double, true },\n { distanceToSurfaceRelativeName, QJsonValue::Bool, true },\n };\n if (!JsonHelper::validateKeys(v1Json, keyInfoList1, errorString)) {\n return false;\n }\n\n _disableRecalc = true;\n\n _distanceToSurfaceRelative = v1Json[distanceToSurfaceRelativeName].toBool();\n\n _cameraNameFact.setRawValue (v1Json[cameraNameName].toString());\n _adjustedFootprintSideFact.setRawValue (v1Json[adjustedFootprintSideName].toDouble());\n _adjustedFootprintFrontalFact.setRawValue (v1Json[adjustedFootprintFrontalName].toDouble());\n _distanceToSurfaceFact.setRawValue (v1Json[distanceToSurfaceName].toDouble());\n\n if (!isManualCamera()) {\n QList keyInfoList2 = {\n { valueSetIsDistanceName, QJsonValue::Bool, true },\n { imageDensityName, QJsonValue::Double, true },\n { frontalOverlapName, QJsonValue::Double, true },\n { sideOverlapName, QJsonValue::Double, true },\n };\n if (!JsonHelper::validateKeys(v1Json, keyInfoList2, errorString)) {\n _disableRecalc = false;\n return false;\n }\n\n _valueSetIsDistanceFact.setRawValue (v1Json[valueSetIsDistanceName].toBool());\n _frontalOverlapFact.setRawValue (v1Json[frontalOverlapName].toDouble());\n _sideOverlapFact.setRawValue (v1Json[sideOverlapName].toDouble());\n _imageDensityFact.setRawValue (v1Json[imageDensityName].toDouble());\n\n if (!CameraSpec::load(v1Json, errorString)) {\n _disableRecalc = false;\n return false;\n }\n }\n\n _disableRecalc = false;\n\n return true;\n}\n\nQString CameraCalc::customCameraName(void)\n{\n return tr(\"Custom Camera\");\n}\n\nQString CameraCalc::manualCameraName(void)\n{\n return tr(\"Manual (no camera specs)\");\n}\n\nvoid CameraCalc::_adjustDistanceToSurfaceRelative(void)\n{\n if (!isManualCamera()) {\n setDistanceToSurfaceRelative(true);\n }\n}\n\nvoid CameraCalc::setDistanceToSurfaceRelative(bool distanceToSurfaceRelative)\n{\n if (distanceToSurfaceRelative != _distanceToSurfaceRelative) {\n _distanceToSurfaceRelative = distanceToSurfaceRelative;\n emit distanceToSurfaceRelativeChanged(distanceToSurfaceRelative);\n }\n}\n\nvoid CameraCalc::_setDirty(void)\n{\n setDirty(true);\n}\n<|endoftext|>"} {"text":"\/**\n * Copyright (c) 2016-2017 mvs developers \n *\n * This file is part of metaverse-explorer.\n *\n * metaverse-explorer is free software: you can redistribute it and\/or\n * modify it under the terms of the GNU Affero General Public License with\n * additional permissions to the one published by the Free Software\n * Foundation, either version 3 of the License, or (at your option)\n * any later version. For more information see LICENSE.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see .\n *\/\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \/\/ for cmd move\n#include \/\/ for cmd move\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\n\nnamespace libbitcoin {\nnamespace explorer {\n\n\nvoid broadcast_extension(const function)> func)\n{\n using namespace std;\n using namespace commands;\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n}\n\nshared_ptr find_extension(const string& symbol)\n{\n using namespace std;\n using namespace commands;\n if (symbol == stop::symbol())\n return make_shared();\n if (symbol == start::symbol())\n return make_shared();\n if (symbol == getinfo::symbol())\n return make_shared();\n if (symbol == getpeerinfo::symbol())\n return make_shared();\n if (symbol == ping::symbol())\n return make_shared();\n if (symbol == addnode::symbol())\n return make_shared();\n if (symbol == getmininginfo::symbol())\n return make_shared();\n if (symbol == fetchheaderext::symbol())\n return make_shared();\n if (symbol == gettransaction::symbol())\n return make_shared();\n if (symbol == backupwallet::symbol())\n return make_shared();\n if (symbol == importwallet::symbol())\n return make_shared();\n if (symbol == lockwallet::symbol())\n return make_shared();\n if (symbol == exportaccountasfile::symbol())\n return make_shared();\n if (symbol == importaccountfromfile::symbol())\n return make_shared();\n if (symbol == importaccount::symbol())\n return make_shared();\n if (symbol == getnewaccount::symbol())\n return make_shared();\n if (symbol == getaccount::symbol())\n return make_shared();\n if (symbol == deleteaccount::symbol())\n return make_shared();\n if (symbol == lockaccount::symbol())\n return make_shared();\n if (symbol == setaccountinfo::symbol())\n return make_shared();\n if (symbol == listaddresses::symbol())\n return make_shared();\n if (symbol == getnewaddress::symbol())\n return make_shared();\n if (symbol == getaddress::symbol())\n return make_shared();\n if (symbol == getpublickey::symbol())\n return make_shared();\n if (symbol == getblock::symbol())\n return make_shared();\n if (symbol == signmessage::symbol())\n return make_shared();\n if (symbol == verifymessage::symbol())\n return make_shared();\n if (symbol == createmultisig::symbol())\n return make_shared();\n if (symbol == addmultisigaddress::symbol())\n return make_shared();\n if (symbol == validateaddress::symbol())\n return make_shared();\n if (symbol == listbalances::symbol())\n return make_shared();\n if (symbol == getbalance::symbol())\n return make_shared();\n if (symbol == getbestblockhash::symbol())\n return make_shared();\n if (symbol == getbestblockheader::symbol())\n return make_shared();\n if (symbol == listtxs::symbol())\n return make_shared();\n if (symbol == xfetchbalance::symbol())\n return make_shared();\n if (symbol == xfetchutxo::symbol())\n return make_shared();\n if (symbol == gettx::symbol())\n return make_shared();\n if (symbol == getaddresstx::symbol())\n return make_shared();\n if (symbol == getaccounttx::symbol())\n return make_shared();\n if (symbol == deposit::symbol())\n return make_shared();\n if (symbol == send::symbol())\n return make_shared();\n if (symbol == sendmore::symbol())\n return make_shared();\n if (symbol == sendfrom::symbol())\n return make_shared();\n if (symbol == listassets::symbol())\n return make_shared();\n if (symbol == getasset::symbol())\n return make_shared();\n if (symbol == getaddressasset::symbol())\n return make_shared();\n if (symbol == getaccountasset::symbol())\n return make_shared();\n if (symbol == createasset::symbol())\n return make_shared();\n if (symbol == deleteasset::symbol())\n return make_shared();\n if (symbol == issue::symbol())\n return make_shared();\n if (symbol == issuefrom::symbol())\n return make_shared();\n if (symbol == sendasset::symbol())\n return make_shared();\n if (symbol == sendassetfrom::symbol())\n return make_shared();\n if (symbol == getdid::symbol())\n return make_shared();\n if (symbol == setdid::symbol())\n return make_shared();\n if (symbol == sendwithdid::symbol())\n return make_shared();\n if (symbol == settxfee::symbol())\n return make_shared();\n if (symbol == encodeattachtx::symbol())\n return make_shared();\n if (symbol == getwork::symbol())\n return make_shared();\n if (symbol == submitwork::symbol())\n return make_shared();\n if (symbol == setminingaccount::symbol())\n return make_shared();\n if (symbol == changepasswd::symbol())\n return make_shared();\n if (symbol == getnewmultisig::symbol())\n return make_shared();\n if (symbol == listmultisig::symbol())\n return make_shared();\n if (symbol == deletemultisig::symbol())\n return make_shared();\n if (symbol == createmultisigtx::symbol())\n return make_shared();\n if (symbol == signmultisigtx::symbol())\n return make_shared();\n if (symbol == issuefrom::symbol())\n return make_shared();\n if (symbol == sendassetfrom::symbol())\n return make_shared();\n if (symbol == stopall::symbol())\n return make_shared();\n if (symbol == getmemorypool::symbol())\n return make_shared();\n return nullptr;\n}\n\nstd::string formerly_extension(const string& former)\n{\n return \"\";\n}\n\n} \/\/ namespace explorer\n} \/\/ namespace libbitcoin\n\n#169 add broadcast tx command\/**\n * Copyright (c) 2016-2017 mvs developers \n *\n * This file is part of metaverse-explorer.\n *\n * metaverse-explorer is free software: you can redistribute it and\/or\n * modify it under the terms of the GNU Affero General Public License with\n * additional permissions to the one published by the Free Software\n * Foundation, either version 3 of the License, or (at your option)\n * any later version. For more information see LICENSE.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see .\n *\/\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \/\/ for cmd move\n#include \/\/ for cmd move\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\n\nnamespace libbitcoin {\nnamespace explorer {\n\n\nvoid broadcast_extension(const function)> func)\n{\n using namespace std;\n using namespace commands;\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n func(make_shared());\n}\n\nshared_ptr find_extension(const string& symbol)\n{\n using namespace std;\n using namespace commands;\n if (symbol == stop::symbol())\n return make_shared();\n if (symbol == start::symbol())\n return make_shared();\n if (symbol == getinfo::symbol())\n return make_shared();\n if (symbol == getpeerinfo::symbol())\n return make_shared();\n if (symbol == ping::symbol())\n return make_shared();\n if (symbol == addnode::symbol())\n return make_shared();\n if (symbol == getmininginfo::symbol())\n return make_shared();\n if (symbol == fetchheaderext::symbol())\n return make_shared();\n if (symbol == gettransaction::symbol())\n return make_shared();\n if (symbol == backupwallet::symbol())\n return make_shared();\n if (symbol == importwallet::symbol())\n return make_shared();\n if (symbol == lockwallet::symbol())\n return make_shared();\n if (symbol == exportaccountasfile::symbol())\n return make_shared();\n if (symbol == importaccountfromfile::symbol())\n return make_shared();\n if (symbol == importaccount::symbol())\n return make_shared();\n if (symbol == getnewaccount::symbol())\n return make_shared();\n if (symbol == getaccount::symbol())\n return make_shared();\n if (symbol == deleteaccount::symbol())\n return make_shared();\n if (symbol == lockaccount::symbol())\n return make_shared();\n if (symbol == setaccountinfo::symbol())\n return make_shared();\n if (symbol == listaddresses::symbol())\n return make_shared();\n if (symbol == getnewaddress::symbol())\n return make_shared();\n if (symbol == getaddress::symbol())\n return make_shared();\n if (symbol == getpublickey::symbol())\n return make_shared();\n if (symbol == getblock::symbol())\n return make_shared();\n if (symbol == signmessage::symbol())\n return make_shared();\n if (symbol == verifymessage::symbol())\n return make_shared();\n if (symbol == createmultisig::symbol())\n return make_shared();\n if (symbol == addmultisigaddress::symbol())\n return make_shared();\n if (symbol == validateaddress::symbol())\n return make_shared();\n if (symbol == listbalances::symbol())\n return make_shared();\n if (symbol == getbalance::symbol())\n return make_shared();\n if (symbol == getbestblockhash::symbol())\n return make_shared();\n if (symbol == getbestblockheader::symbol())\n return make_shared();\n if (symbol == listtxs::symbol())\n return make_shared();\n if (symbol == xfetchbalance::symbol())\n return make_shared();\n if (symbol == xfetchutxo::symbol())\n return make_shared();\n if (symbol == gettx::symbol())\n return make_shared();\n if (symbol == getaddresstx::symbol())\n return make_shared();\n if (symbol == getaccounttx::symbol())\n return make_shared();\n if (symbol == deposit::symbol())\n return make_shared();\n if (symbol == send::symbol())\n return make_shared();\n if (symbol == sendmore::symbol())\n return make_shared();\n if (symbol == sendfrom::symbol())\n return make_shared();\n if (symbol == listassets::symbol())\n return make_shared();\n if (symbol == getasset::symbol())\n return make_shared();\n if (symbol == getaddressasset::symbol())\n return make_shared();\n if (symbol == getaccountasset::symbol())\n return make_shared();\n if (symbol == createasset::symbol())\n return make_shared();\n if (symbol == deleteasset::symbol())\n return make_shared();\n if (symbol == issue::symbol())\n return make_shared();\n if (symbol == issuefrom::symbol())\n return make_shared();\n if (symbol == sendasset::symbol())\n return make_shared();\n if (symbol == sendassetfrom::symbol())\n return make_shared();\n if (symbol == getdid::symbol())\n return make_shared();\n if (symbol == setdid::symbol())\n return make_shared();\n if (symbol == sendwithdid::symbol())\n return make_shared();\n if (symbol == settxfee::symbol())\n return make_shared();\n if (symbol == encodeattachtx::symbol())\n return make_shared();\n if (symbol == getwork::symbol())\n return make_shared();\n if (symbol == submitwork::symbol())\n return make_shared();\n if (symbol == setminingaccount::symbol())\n return make_shared();\n if (symbol == changepasswd::symbol())\n return make_shared();\n if (symbol == getnewmultisig::symbol())\n return make_shared();\n if (symbol == listmultisig::symbol())\n return make_shared();\n if (symbol == deletemultisig::symbol())\n return make_shared();\n if (symbol == createmultisigtx::symbol())\n return make_shared();\n if (symbol == signmultisigtx::symbol())\n return make_shared();\n if (symbol == broadcasttx::symbol())\n return make_shared();\n if (symbol == issuefrom::symbol())\n return make_shared();\n if (symbol == sendassetfrom::symbol())\n return make_shared();\n if (symbol == stopall::symbol())\n return make_shared();\n if (symbol == getmemorypool::symbol())\n return make_shared();\n return nullptr;\n}\n\nstd::string formerly_extension(const string& former)\n{\n return \"\";\n}\n\n} \/\/ namespace explorer\n} \/\/ namespace libbitcoin\n\n<|endoftext|>"} {"text":"\/\/===-- Globals.cpp - Implement the Global object classes -----------------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the GlobalValue & GlobalVariable classes for the VMCore\n\/\/ library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/SymbolTable.h\"\n#include \"Support\/LeakDetector.h\"\n\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ GlobalValue Class\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ This could be named \"SafeToDestroyGlobalValue\". It just makes sure that \n\/\/\/ there are no non-constant uses of this GlobalValue. If there aren't then\n\/\/\/ this and the transitive closure of the constants can be deleted. See the\n\/\/\/ destructor for details.\nnamespace {\nbool removeDeadConstantUsers(Constant* C) {\n while (!C->use_empty()) {\n if (Constant *User = dyn_cast(C->use_back())) {\n if (!removeDeadConstantUsers(User)) \n return false; \/\/ Constant wasn't dead\n } else {\n return false; \/\/ Non-constant usage;\n }\n }\n if (!isa(C))\n C->destroyConstant();\n return true;\n}\n}\n\n\/\/\/ removeDeadConstantUsers - If there are any dead constant users dangling\n\/\/\/ off of this global value, remove them. This method is useful for clients\n\/\/\/ that want to check to see if a global is unused, but don't want to deal\n\/\/\/ with potentially dead constants hanging off of the globals.\n\/\/\/\n\/\/\/ This function returns true if the global value is now dead. If all \n\/\/\/ users of this global are not dead, this method may return false and\n\/\/\/ leave some of them around.\nbool GlobalValue::removeDeadConstantUsers() {\n while(!use_empty()) {\n if (Constant* User = dyn_cast(use_back())) {\n if (!::removeDeadConstantUsers(User))\n return false; \/\/ Constant wasn't dead\n } else {\n return false; \/\/ Non-constant usage;\n }\n }\n return true;\n}\n\n\/\/\/ This virtual destructor is responsible for deleting any transitively dead\n\/\/\/ Constants that are using the GlobalValue.\nGlobalValue::~GlobalValue() {\n \/\/ Its an error to attempt destruction with non-constant uses remaining.\n bool okay_to_destruct = removeDeadConstantUsers();\n assert(okay_to_destruct && \n \"Can't destroy GlobalValue with non-constant uses.\");\n}\n\n\/\/\/ Override destroyConstant to make sure it doesn't get called on \n\/\/\/ GlobalValue's because they shouldn't be treated like other constants.\nvoid GlobalValue::destroyConstant() {\n assert(0 && \"You can't GV->destroyConstant()!\");\n abort();\n}\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ GlobalVariable Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nGlobalVariable::GlobalVariable(const Type *Ty, bool constant, LinkageTypes Link,\n Constant *Initializer,\n const std::string &Name, Module *ParentModule)\n : GlobalValue(PointerType::get(Ty), Value::GlobalVariableVal, Link, Name),\n isConstantGlobal(constant) {\n if (Initializer) Operands.push_back(Use((Value*)Initializer, this));\n\n LeakDetector::addGarbageObject(this);\n\n if (ParentModule)\n ParentModule->getGlobalList().push_back(this);\n}\n\nvoid GlobalVariable::setParent(Module *parent) {\n if (getParent())\n LeakDetector::addGarbageObject(this);\n Parent = parent;\n if (getParent())\n LeakDetector::removeGarbageObject(this);\n}\n\n\/\/ Specialize setName to take care of symbol table majik\nvoid GlobalVariable::setName(const std::string &name, SymbolTable *ST) {\n Module *P;\n assert((ST == 0 || (!getParent() || ST == &getParent()->getSymbolTable())) &&\n \"Invalid symtab argument!\");\n if ((P = getParent()) && hasName()) P->getSymbolTable().remove(this);\n Value::setName(name);\n if (P && hasName()) P->getSymbolTable().insert(this);\n}\n\nvoid GlobalVariable::replaceUsesOfWithOnConstant(Value *From, Value *To,\n bool DisableChecking )\n{\n \/\/ If you call this, then you better know this GVar has a constant\n \/\/ initializer worth replacing. Enforce that here.\n assert(getNumOperands() == 1 && \n \"Attempt to replace uses of Constants on a GVar with no initializer\");\n\n \/\/ And, since you know it has an initializer, the From value better be\n \/\/ the initializer :)\n assert(getOperand(0) == From &&\n \"Attempt to replace wrong constant initializer in GVar\");\n\n \/\/ And, you better have a constant for the replacement value\n assert(isa(To) &&\n \"Attempt to replace GVar initializer with non-constant\");\n \n \/\/ Okay, preconditions out of the way, replace the constant initializer.\n this->setOperand(0,To);\n}\n\n\/\/ vim: sw=2 ai\n\nFix infinite loop gccld'ing povray\/\/===-- Globals.cpp - Implement the Global object classes -----------------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the GlobalValue & GlobalVariable classes for the VMCore\n\/\/ library.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/GlobalVariable.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/SymbolTable.h\"\n#include \"Support\/LeakDetector.h\"\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ GlobalValue Class\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ This could be named \"SafeToDestroyGlobalValue\". It just makes sure that \n\/\/\/ there are no non-constant uses of this GlobalValue. If there aren't then\n\/\/\/ this and the transitive closure of the constants can be deleted. See the\n\/\/\/ destructor for details.\nstatic bool removeDeadConstantUsers(Constant* C) {\n if (isa(C)) return false; \/\/ Cannot remove this\n\n while (!C->use_empty())\n if (Constant *User = dyn_cast(C->use_back())) {\n if (!removeDeadConstantUsers(User)) \n return false; \/\/ Constant wasn't dead\n } else {\n return false; \/\/ Non-constant usage;\n }\n\n C->destroyConstant();\n return true;\n}\n\n\/\/\/ removeDeadConstantUsers - If there are any dead constant users dangling\n\/\/\/ off of this global value, remove them. This method is useful for clients\n\/\/\/ that want to check to see if a global is unused, but don't want to deal\n\/\/\/ with potentially dead constants hanging off of the globals.\n\/\/\/\n\/\/\/ This function returns true if the global value is now dead. If all \n\/\/\/ users of this global are not dead, this method may return false and\n\/\/\/ leave some of them around.\nbool GlobalValue::removeDeadConstantUsers() {\n while(!use_empty()) {\n if (Constant* User = dyn_cast(use_back())) {\n if (!::removeDeadConstantUsers(User))\n return false; \/\/ Constant wasn't dead\n } else {\n return false; \/\/ Non-constant usage;\n }\n }\n return true;\n}\n\n\/\/\/ This virtual destructor is responsible for deleting any transitively dead\n\/\/\/ Constants that are using the GlobalValue.\nGlobalValue::~GlobalValue() {\n \/\/ Its an error to attempt destruction with non-constant uses remaining.\n bool okay_to_destruct = removeDeadConstantUsers();\n assert(okay_to_destruct && \n \"Can't destroy GlobalValue with non-constant uses.\");\n}\n\n\/\/\/ Override destroyConstant to make sure it doesn't get called on \n\/\/\/ GlobalValue's because they shouldn't be treated like other constants.\nvoid GlobalValue::destroyConstant() {\n assert(0 && \"You can't GV->destroyConstant()!\");\n abort();\n}\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ GlobalVariable Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nGlobalVariable::GlobalVariable(const Type *Ty, bool constant, LinkageTypes Link,\n Constant *Initializer,\n const std::string &Name, Module *ParentModule)\n : GlobalValue(PointerType::get(Ty), Value::GlobalVariableVal, Link, Name),\n isConstantGlobal(constant) {\n if (Initializer) Operands.push_back(Use((Value*)Initializer, this));\n\n LeakDetector::addGarbageObject(this);\n\n if (ParentModule)\n ParentModule->getGlobalList().push_back(this);\n}\n\nvoid GlobalVariable::setParent(Module *parent) {\n if (getParent())\n LeakDetector::addGarbageObject(this);\n Parent = parent;\n if (getParent())\n LeakDetector::removeGarbageObject(this);\n}\n\n\/\/ Specialize setName to take care of symbol table majik\nvoid GlobalVariable::setName(const std::string &name, SymbolTable *ST) {\n Module *P;\n assert((ST == 0 || (!getParent() || ST == &getParent()->getSymbolTable())) &&\n \"Invalid symtab argument!\");\n if ((P = getParent()) && hasName()) P->getSymbolTable().remove(this);\n Value::setName(name);\n if (P && hasName()) P->getSymbolTable().insert(this);\n}\n\nvoid GlobalVariable::replaceUsesOfWithOnConstant(Value *From, Value *To,\n bool DisableChecking )\n{\n \/\/ If you call this, then you better know this GVar has a constant\n \/\/ initializer worth replacing. Enforce that here.\n assert(getNumOperands() == 1 && \n \"Attempt to replace uses of Constants on a GVar with no initializer\");\n\n \/\/ And, since you know it has an initializer, the From value better be\n \/\/ the initializer :)\n assert(getOperand(0) == From &&\n \"Attempt to replace wrong constant initializer in GVar\");\n\n \/\/ And, you better have a constant for the replacement value\n assert(isa(To) &&\n \"Attempt to replace GVar initializer with non-constant\");\n \n \/\/ Okay, preconditions out of the way, replace the constant initializer.\n this->setOperand(0,To);\n}\n\n\/\/ vim: sw=2 ai\n\n<|endoftext|>"} {"text":"# include \n\n\n\nint main() {\n\n std::cout << \"HelloWorld!\" << std::endl;\n\n}Updating HelloWorld.cpp, changed cout message# include \n\n\n\nint main() {\n\n std::cout << \"Fight On!\" << std::endl;\n\n}\n<|endoftext|>"} {"text":"#include \n#include \n\nnamespace registry\n{\n\t\/\/ Registry settings\n\t\/\/ Creating a new reg key:\n\t\/\/ 1 - Define an accessor object using boolRegKey, wstringRegKey or dwordRegKey\n\t\/\/ 2 - Add pointer to the object to RegKeys vector\n\t\/\/ 3 - Add an extern for the object to registry.h\n\t\/\/ 4 - If the setting should show in options, ensure it has a unique options prompt value\n\t\/\/ Note: Accessor objects can be used in code as their underlying type, though some care may be needed with casting\n#ifdef _DEBUG\n\tdwordRegKey debugTag{L\"DebugTag\", regoptStringHex, DBGAll, false, IDS_REGKEY_DEBUG_TAG};\n#else\n\tdwordRegKey debugTag{L\"DebugTag\", regoptStringHex, DBGNoDebug, false, IDS_REGKEY_DEBUG_TAG};\n#endif\n\tboolRegKey debugToFile{L\"DebugToFile\", false, false, IDS_REGKEY_DEBUG_TO_FILE};\n\twstringRegKey debugFileName{L\"DebugFileName\", L\"c:\\\\mfcmapi.log\", false, IDS_REGKEY_DEBUG_FILE_NAME};\n\tboolRegKey getPropNamesOnAllProps{L\"GetPropNamesOnAllProps\", false, true, IDS_REGKEY_GETPROPNAMES_ON_ALL_PROPS};\n\tboolRegKey parseNamedProps{L\"ParseNamedProps\", false, true, IDS_REGKEY_PARSED_NAMED_PROPS};\n\tdwordRegKey throttleLevel{L\"ThrottleLevel\", regoptStringDec, 0, false, IDS_REGKEY_THROTTLE_LEVEL};\n\tboolRegKey hierExpandNotifications{L\"HierExpandNotifications\", true, false, IDS_REGKEY_HIER_EXPAND_NOTIFS};\n\tboolRegKey hierRootNotifs{L\"HierRootNotifs\", false, false, IDS_REGKEY_HIER_ROOT_NOTIFS};\n\tboolRegKey doSmartView{L\"DoSmartView\", true, true, IDS_REGKEY_DO_SMART_VIEW};\n\tboolRegKey onlyAdditionalProperties{L\"OnlyAdditionalProperties\", false, true, IDS_REGKEY_ONLYADDITIONALPROPERTIES};\n\tboolRegKey useRowDataForSinglePropList{L\"UseRowDataForSinglePropList\",\n\t\t\t\t\t\t\t\t\t\t false,\n\t\t\t\t\t\t\t\t\t\t true,\n\t\t\t\t\t\t\t\t\t\t IDS_REGKEY_USE_ROW_DATA_FOR_SINGLEPROPLIST};\n\tboolRegKey useGetPropList{L\"UseGetPropList\", true, true, IDS_REGKEY_USE_GETPROPLIST};\n\tboolRegKey preferUnicodeProps{L\"PreferUnicodeProps\", true, true, IDS_REGKEY_PREFER_UNICODE_PROPS};\n\tboolRegKey cacheNamedProps{L\"CacheNamedProps\", true, false, IDS_REGKEY_CACHE_NAMED_PROPS};\n\tboolRegKey allowDupeColumns{L\"AllowDupeColumns\", false, false, IDS_REGKEY_ALLOW_DUPE_COLUMNS};\n\tboolRegKey doColumnNames{L\"DoColumnNames\", true, false, IDS_REGKEY_DO_COLUMN_NAMES};\n\tboolRegKey editColumnsOnLoad{L\"EditColumnsOnLoad\", false, false, IDS_REGKEY_EDIT_COLUMNS_ON_LOAD};\n\tboolRegKey forceMDBOnline{L\"ForceMDBOnline\", false, false, IDS_REGKEY_MDB_ONLINE};\n\tboolRegKey forceMapiNoCache{L\"ForceMapiNoCache\", false, false, IDS_REGKEY_MAPI_NO_CACHE};\n\tboolRegKey allowPersistCache{L\"AllowPersistCache\", false, false, IDS_REGKEY_ALLOW_PERSIST_CACHE};\n\tboolRegKey useIMAPIProgress{L\"UseIMAPIProgress\", false, false, IDS_REGKEY_USE_IMAPIPROGRESS};\n\tboolRegKey useMessageRaw{L\"UseMessageRaw\", false, false, IDS_REGKEY_USE_MESSAGERAW};\n\tboolRegKey suppressNotFound{L\"SuppressNotFound\", true, false, IDS_REGKEY_SUPPRESS_NOTFOUND};\n\tboolRegKey heapEnableTerminationOnCorruption{L\"HeapEnableTerminationOnCorruption\",\n\t\t\t\t\t\t\t\t\t\t\t\t true,\n\t\t\t\t\t\t\t\t\t\t\t\t false,\n\t\t\t\t\t\t\t\t\t\t\t\t IDS_REGKEY_HEAPENABLETERMINATIONONCORRUPTION};\n\tboolRegKey loadAddIns{L\"LoadAddIns\", true, false, IDS_REGKEY_LOADADDINS};\n\tboolRegKey forceOutlookMAPI{L\"ForceOutlookMAPI\", false, false, IDS_REGKEY_FORCEOUTLOOKMAPI};\n\tboolRegKey forceSystemMAPI{L\"ForceSystemMAPI\", false, false, IDS_REGKEY_FORCESYSTEMMAPI};\n\tboolRegKey hexDialogDiag{L\"HexDialogDiag\", false, false, IDS_REGKEY_HEXDIALOGDIAG};\n\tboolRegKey displayAboutDialog{L\"DisplayAboutDialog\", true, false, NULL};\n\twstringRegKey propertyColumnOrder{L\"PropertyColumnOrder\", L\"\", false, NULL};\n\n\tstd::vector<__RegKey*> RegKeys = {\n\t\t&debugTag,\n\t\t&debugToFile,\n\t\t&debugFileName,\n\t\t&getPropNamesOnAllProps,\n\t\t&parseNamedProps,\n\t\t&throttleLevel,\n\t\t&hierExpandNotifications,\n\t\t&hierRootNotifs,\n\t\t&doSmartView,\n\t\t&onlyAdditionalProperties,\n\t\t&useRowDataForSinglePropList,\n\t\t&useGetPropList,\n\t\t&preferUnicodeProps,\n\t\t&cacheNamedProps,\n\t\t&allowDupeColumns,\n\t\t&doColumnNames,\n\t\t&editColumnsOnLoad,\n\t\t&forceMDBOnline,\n\t\t&forceMapiNoCache,\n\t\t&allowPersistCache,\n\t\t&useIMAPIProgress,\n\t\t&useMessageRaw,\n\t\t&suppressNotFound,\n\t\t&heapEnableTerminationOnCorruption,\n\t\t&loadAddIns,\n\t\t&forceOutlookMAPI,\n\t\t&forceSystemMAPI,\n\t\t&hexDialogDiag,\n\t\t&displayAboutDialog,\n\t\t&propertyColumnOrder,\n\t};\n\n\t\/\/ $--HrGetRegistryValue---------------------------------------------------------\n\t\/\/ Get a registry value - allocating memory using new to hold it.\n\t\/\/ -----------------------------------------------------------------------------\n\t_Check_return_ HRESULT HrGetRegistryValue(\n\t\t_In_ HKEY hKey, \/\/ the key.\n\t\t_In_ const std::wstring& lpszValue, \/\/ value name in key.\n\t\t_Out_ DWORD* lpType, \/\/ where to put type info.\n\t\t_Out_ LPVOID* lppData) \/\/ where to put the data.\n\t{\n\t\toutput::DebugPrint(DBGGeneric, L\"HrGetRegistryValue(%ws)\\n\", lpszValue.c_str());\n\n\t\t*lppData = nullptr;\n\t\tDWORD cb = NULL;\n\n\t\t\/\/ Get its size\n\t\tauto hRes = WC_W32(RegQueryValueExW(hKey, lpszValue.c_str(), nullptr, lpType, nullptr, &cb));\n\n\t\t\/\/ only handle types we know about - all others are bad\n\t\tif (hRes == S_OK && cb && (REG_SZ == *lpType || REG_DWORD == *lpType || REG_MULTI_SZ == *lpType))\n\t\t{\n\t\t\t*lppData = new BYTE[cb];\n\n\t\t\tif (*lppData)\n\t\t\t{\n\t\t\t\t\/\/ Get the current value\n\t\t\t\thRes = EC_W32(RegQueryValueExW(\n\t\t\t\t\thKey, lpszValue.c_str(), nullptr, lpType, static_cast(*lppData), &cb));\n\n\t\t\t\tif (FAILED(hRes))\n\t\t\t\t{\n\t\t\t\t\tdelete[] * lppData;\n\t\t\t\t\t*lppData = nullptr;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\thRes = MAPI_E_INVALID_PARAMETER;\n\n\t\treturn hRes;\n\t}\n\n\t\/\/ If the value is not set in the registry, return the default value\n\tDWORD ReadDWORDFromRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValue, _In_ const DWORD dwDefaultVal)\n\t{\n\t\tif (szValue.empty()) return dwDefaultVal;\n\t\tDWORD dwKeyType = NULL;\n\t\tDWORD* lpValue = nullptr;\n\t\tauto ret = dwDefaultVal;\n\n\t\tconst auto hRes = WC_H(HrGetRegistryValue(hKey, szValue, &dwKeyType, reinterpret_cast(&lpValue)));\n\t\tif (hRes == S_OK && REG_DWORD == dwKeyType && lpValue)\n\t\t{\n\t\t\tret = *lpValue;\n\t\t}\n\n\t\tdelete[] lpValue;\n\t\treturn ret;\n\t}\n\n\t\/\/ If the value is not set in the registry, return the default value\n\tstd::wstring\n\tReadStringFromRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValue, _In_ const std::wstring& szDefault)\n\t{\n\t\tif (szValue.empty()) return szDefault;\n\t\toutput::DebugPrint(DBGGeneric, L\"ReadStringFromRegistry(%ws)\\n\", szValue.c_str());\n\n\t\tDWORD dwKeyType = NULL;\n\t\tLPBYTE szBuf = nullptr;\n\t\tDWORD cb = NULL;\n\n\t\t\/\/ Get its size\n\t\tauto hRes = WC_W32(RegQueryValueExW(hKey, szValue.c_str(), nullptr, &dwKeyType, nullptr, &cb));\n\n\t\tif (hRes == S_OK && cb && !(cb % 2) && REG_SZ == dwKeyType)\n\t\t{\n\t\t\tszBuf = new (std::nothrow) BYTE[cb];\n\t\t\tif (szBuf)\n\t\t\t{\n\t\t\t\t\/\/ Get the current value\n\t\t\t\thRes = EC_W32(RegQueryValueExW(hKey, szValue.c_str(), nullptr, &dwKeyType, szBuf, &cb));\n\n\t\t\t\tif (FAILED(hRes))\n\t\t\t\t{\n\t\t\t\t\tdelete[] szBuf;\n\t\t\t\t\tszBuf = nullptr;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto ret = szDefault;\n\t\tif (hRes == S_OK && cb && !(cb % 2) && REG_SZ == dwKeyType && szBuf)\n\t\t{\n\t\t\tret = std::wstring(LPWSTR(szBuf), cb \/ sizeof WCHAR);\n\t\t}\n\n\t\tdelete[] szBuf;\n\t\treturn ret;\n\t}\n\n\tvoid ReadFromRegistry()\n\t{\n\t\tHKEY hRootKey = nullptr;\n\t\tWC_W32_S(RegOpenKeyExW(HKEY_CURRENT_USER, RKEY_ROOT, NULL, KEY_READ, &hRootKey));\n\n\t\t\/\/ Now that we have a root key, go get our values\n\t\tif (hRootKey)\n\t\t{\n\t\t\tfor (auto& regKey : RegKeys)\n\t\t\t{\n\t\t\t\tif (!regKey) continue;\n\n\t\t\t\tif (regKey->ulRegKeyType == regDWORD)\n\t\t\t\t{\n\t\t\t\t\tregKey->ulCurDWORD = ReadDWORDFromRegistry(hRootKey, regKey->szKeyName, regKey->ulCurDWORD);\n\t\t\t\t}\n\t\t\t\telse if (regKey->ulRegKeyType == regSTRING)\n\t\t\t\t{\n\t\t\t\t\tregKey->szCurSTRING = ReadStringFromRegistry(hRootKey, regKey->szKeyName, regKey->szCurSTRING);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tEC_W32_S(RegCloseKey(hRootKey));\n\t\t}\n\n\t\toutput::SetDebugLevel(debugTag);\n\t\toutput::DebugPrintVersion(DBGVersionBanner);\n\t}\n\n\tvoid WriteDWORDToRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValueName, DWORD dwValue)\n\t{\n\t\tWC_W32_S(RegSetValueExW(\n\t\t\thKey, szValueName.c_str(), NULL, REG_DWORD, reinterpret_cast(&dwValue), sizeof(DWORD)));\n\t}\n\n\tvoid CommitDWORDIfNeeded(\n\t\t_In_ HKEY hKey,\n\t\t_In_ const std::wstring& szValueName,\n\t\tconst DWORD dwValue,\n\t\tconst DWORD dwDefaultValue)\n\t{\n\t\tif (dwValue != dwDefaultValue)\n\t\t{\n\t\t\tWriteDWORDToRegistry(hKey, szValueName, dwValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tWC_W32_S(RegDeleteValueW(hKey, szValueName.c_str()));\n\t\t}\n\t}\n\n\tvoid WriteStringToRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValueName, _In_ const std::wstring& szValue)\n\t{\n\t\t\/\/ Reg needs bytes, so CB is correct here\n\t\tauto cbValue = szValue.length() * sizeof(WCHAR);\n\t\tcbValue += sizeof(WCHAR); \/\/ NULL terminator\n\n\t\tWC_W32_S(RegSetValueExW(\n\t\t\thKey, szValueName.c_str(), NULL, REG_SZ, LPBYTE(szValue.c_str()), static_cast(cbValue)));\n\t}\n\n\tvoid CommitStringIfNeeded(\n\t\t_In_ HKEY hKey,\n\t\t_In_ const std::wstring& szValueName,\n\t\t_In_ const std::wstring& szValue,\n\t\t_In_ const std::wstring& szDefaultValue)\n\t{\n\t\tif (strings::wstringToLower(szValue) != strings::wstringToLower(szDefaultValue))\n\t\t{\n\t\t\tWriteStringToRegistry(hKey, szValueName, szValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tWC_W32_S(RegDeleteValueW(hKey, szValueName.c_str()));\n\t\t}\n\t}\n\n\t_Check_return_ HKEY CreateRootKey()\n\t{\n\t\tHKEY hkSub = nullptr;\n\n\t\t\/\/ Try to open the root key before we do the work to create it\n\t\tconst auto hRes = WC_W32(RegOpenKeyExW(HKEY_CURRENT_USER, RKEY_ROOT, NULL, KEY_READ | KEY_WRITE, &hkSub));\n\t\tif (SUCCEEDED(hRes) && hkSub) return hkSub;\n\n\t\tWC_W32_S(RegCreateKeyExW(\n\t\t\tHKEY_CURRENT_USER, RKEY_ROOT, 0, nullptr, 0, KEY_READ | KEY_WRITE, nullptr, &hkSub, nullptr));\n\n\t\treturn hkSub;\n\t}\n\n\tvoid WriteToRegistry()\n\t{\n\t\tconst auto hRootKey = CreateRootKey();\n\n\t\t\/\/ Now that we have a root key, go set our values\n\t\tfor (auto& regKey : RegKeys)\n\t\t{\n\t\t\tif (!regKey) continue;\n\n\t\t\tif (regKey->ulRegKeyType == regDWORD)\n\t\t\t{\n\t\t\t\tCommitDWORDIfNeeded(hRootKey, regKey->szKeyName, regKey->ulCurDWORD, regKey->ulDefDWORD);\n\t\t\t}\n\t\t\telse if (regKey->ulRegKeyType == regSTRING)\n\t\t\t{\n\t\t\t\tCommitStringIfNeeded(hRootKey, regKey->szKeyName, regKey->szCurSTRING, regKey->szDefSTRING);\n\t\t\t}\n\t\t}\n\n\t\tif (hRootKey) EC_W32_S(RegCloseKey(hRootKey));\n\t}\n} \/\/ namespace registryclean up comment#include \n#include \n\nnamespace registry\n{\n\t\/\/ Registry settings\n\t\/\/ Creating a new reg key:\n\t\/\/ 1 - Define an accessor object using boolRegKey, wstringRegKey or dwordRegKey\n\t\/\/ 2 - Add pointer to the object to RegKeys vector\n\t\/\/ 3 - Add an extern for the object to registry.h\n\t\/\/ 4 - If the setting should show in options, ensure it has a unique options prompt value\n\t\/\/ Note: Accessor objects can be used in code as their underlying type, though some care may be needed with casting\n#ifdef _DEBUG\n\tdwordRegKey debugTag{L\"DebugTag\", regoptStringHex, DBGAll, false, IDS_REGKEY_DEBUG_TAG};\n#else\n\tdwordRegKey debugTag{L\"DebugTag\", regoptStringHex, DBGNoDebug, false, IDS_REGKEY_DEBUG_TAG};\n#endif\n\tboolRegKey debugToFile{L\"DebugToFile\", false, false, IDS_REGKEY_DEBUG_TO_FILE};\n\twstringRegKey debugFileName{L\"DebugFileName\", L\"c:\\\\mfcmapi.log\", false, IDS_REGKEY_DEBUG_FILE_NAME};\n\tboolRegKey getPropNamesOnAllProps{L\"GetPropNamesOnAllProps\", false, true, IDS_REGKEY_GETPROPNAMES_ON_ALL_PROPS};\n\tboolRegKey parseNamedProps{L\"ParseNamedProps\", false, true, IDS_REGKEY_PARSED_NAMED_PROPS};\n\tdwordRegKey throttleLevel{L\"ThrottleLevel\", regoptStringDec, 0, false, IDS_REGKEY_THROTTLE_LEVEL};\n\tboolRegKey hierExpandNotifications{L\"HierExpandNotifications\", true, false, IDS_REGKEY_HIER_EXPAND_NOTIFS};\n\tboolRegKey hierRootNotifs{L\"HierRootNotifs\", false, false, IDS_REGKEY_HIER_ROOT_NOTIFS};\n\tboolRegKey doSmartView{L\"DoSmartView\", true, true, IDS_REGKEY_DO_SMART_VIEW};\n\tboolRegKey onlyAdditionalProperties{L\"OnlyAdditionalProperties\", false, true, IDS_REGKEY_ONLYADDITIONALPROPERTIES};\n\tboolRegKey useRowDataForSinglePropList{L\"UseRowDataForSinglePropList\",\n\t\t\t\t\t\t\t\t\t\t false,\n\t\t\t\t\t\t\t\t\t\t true,\n\t\t\t\t\t\t\t\t\t\t IDS_REGKEY_USE_ROW_DATA_FOR_SINGLEPROPLIST};\n\tboolRegKey useGetPropList{L\"UseGetPropList\", true, true, IDS_REGKEY_USE_GETPROPLIST};\n\tboolRegKey preferUnicodeProps{L\"PreferUnicodeProps\", true, true, IDS_REGKEY_PREFER_UNICODE_PROPS};\n\tboolRegKey cacheNamedProps{L\"CacheNamedProps\", true, false, IDS_REGKEY_CACHE_NAMED_PROPS};\n\tboolRegKey allowDupeColumns{L\"AllowDupeColumns\", false, false, IDS_REGKEY_ALLOW_DUPE_COLUMNS};\n\tboolRegKey doColumnNames{L\"DoColumnNames\", true, false, IDS_REGKEY_DO_COLUMN_NAMES};\n\tboolRegKey editColumnsOnLoad{L\"EditColumnsOnLoad\", false, false, IDS_REGKEY_EDIT_COLUMNS_ON_LOAD};\n\tboolRegKey forceMDBOnline{L\"ForceMDBOnline\", false, false, IDS_REGKEY_MDB_ONLINE};\n\tboolRegKey forceMapiNoCache{L\"ForceMapiNoCache\", false, false, IDS_REGKEY_MAPI_NO_CACHE};\n\tboolRegKey allowPersistCache{L\"AllowPersistCache\", false, false, IDS_REGKEY_ALLOW_PERSIST_CACHE};\n\tboolRegKey useIMAPIProgress{L\"UseIMAPIProgress\", false, false, IDS_REGKEY_USE_IMAPIPROGRESS};\n\tboolRegKey useMessageRaw{L\"UseMessageRaw\", false, false, IDS_REGKEY_USE_MESSAGERAW};\n\tboolRegKey suppressNotFound{L\"SuppressNotFound\", true, false, IDS_REGKEY_SUPPRESS_NOTFOUND};\n\tboolRegKey heapEnableTerminationOnCorruption{L\"HeapEnableTerminationOnCorruption\",\n\t\t\t\t\t\t\t\t\t\t\t\t true,\n\t\t\t\t\t\t\t\t\t\t\t\t false,\n\t\t\t\t\t\t\t\t\t\t\t\t IDS_REGKEY_HEAPENABLETERMINATIONONCORRUPTION};\n\tboolRegKey loadAddIns{L\"LoadAddIns\", true, false, IDS_REGKEY_LOADADDINS};\n\tboolRegKey forceOutlookMAPI{L\"ForceOutlookMAPI\", false, false, IDS_REGKEY_FORCEOUTLOOKMAPI};\n\tboolRegKey forceSystemMAPI{L\"ForceSystemMAPI\", false, false, IDS_REGKEY_FORCESYSTEMMAPI};\n\tboolRegKey hexDialogDiag{L\"HexDialogDiag\", false, false, IDS_REGKEY_HEXDIALOGDIAG};\n\tboolRegKey displayAboutDialog{L\"DisplayAboutDialog\", true, false, NULL};\n\twstringRegKey propertyColumnOrder{L\"PropertyColumnOrder\", L\"\", false, NULL};\n\n\tstd::vector<__RegKey*> RegKeys = {\n\t\t&debugTag,\n\t\t&debugToFile,\n\t\t&debugFileName,\n\t\t&getPropNamesOnAllProps,\n\t\t&parseNamedProps,\n\t\t&throttleLevel,\n\t\t&hierExpandNotifications,\n\t\t&hierRootNotifs,\n\t\t&doSmartView,\n\t\t&onlyAdditionalProperties,\n\t\t&useRowDataForSinglePropList,\n\t\t&useGetPropList,\n\t\t&preferUnicodeProps,\n\t\t&cacheNamedProps,\n\t\t&allowDupeColumns,\n\t\t&doColumnNames,\n\t\t&editColumnsOnLoad,\n\t\t&forceMDBOnline,\n\t\t&forceMapiNoCache,\n\t\t&allowPersistCache,\n\t\t&useIMAPIProgress,\n\t\t&useMessageRaw,\n\t\t&suppressNotFound,\n\t\t&heapEnableTerminationOnCorruption,\n\t\t&loadAddIns,\n\t\t&forceOutlookMAPI,\n\t\t&forceSystemMAPI,\n\t\t&hexDialogDiag,\n\t\t&displayAboutDialog,\n\t\t&propertyColumnOrder,\n\t};\n\n\t\/\/ Get a registry value - allocating memory using new to hold it.\n\t_Check_return_ HRESULT HrGetRegistryValue(\n\t\t_In_ HKEY hKey, \/\/ the key.\n\t\t_In_ const std::wstring& lpszValue, \/\/ value name in key.\n\t\t_Out_ DWORD* lpType, \/\/ where to put type info.\n\t\t_Out_ LPVOID* lppData) \/\/ where to put the data.\n\t{\n\t\toutput::DebugPrint(DBGGeneric, L\"HrGetRegistryValue(%ws)\\n\", lpszValue.c_str());\n\n\t\t*lppData = nullptr;\n\t\tDWORD cb = NULL;\n\n\t\t\/\/ Get its size\n\t\tauto hRes = WC_W32(RegQueryValueExW(hKey, lpszValue.c_str(), nullptr, lpType, nullptr, &cb));\n\n\t\t\/\/ only handle types we know about - all others are bad\n\t\tif (hRes == S_OK && cb && (REG_SZ == *lpType || REG_DWORD == *lpType || REG_MULTI_SZ == *lpType))\n\t\t{\n\t\t\t*lppData = new BYTE[cb];\n\n\t\t\tif (*lppData)\n\t\t\t{\n\t\t\t\t\/\/ Get the current value\n\t\t\t\thRes = EC_W32(RegQueryValueExW(\n\t\t\t\t\thKey, lpszValue.c_str(), nullptr, lpType, static_cast(*lppData), &cb));\n\n\t\t\t\tif (FAILED(hRes))\n\t\t\t\t{\n\t\t\t\t\tdelete[] * lppData;\n\t\t\t\t\t*lppData = nullptr;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\thRes = MAPI_E_INVALID_PARAMETER;\n\n\t\treturn hRes;\n\t}\n\n\t\/\/ If the value is not set in the registry, return the default value\n\tDWORD ReadDWORDFromRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValue, _In_ const DWORD dwDefaultVal)\n\t{\n\t\tif (szValue.empty()) return dwDefaultVal;\n\t\tDWORD dwKeyType = NULL;\n\t\tDWORD* lpValue = nullptr;\n\t\tauto ret = dwDefaultVal;\n\n\t\tconst auto hRes = WC_H(HrGetRegistryValue(hKey, szValue, &dwKeyType, reinterpret_cast(&lpValue)));\n\t\tif (hRes == S_OK && REG_DWORD == dwKeyType && lpValue)\n\t\t{\n\t\t\tret = *lpValue;\n\t\t}\n\n\t\tdelete[] lpValue;\n\t\treturn ret;\n\t}\n\n\t\/\/ If the value is not set in the registry, return the default value\n\tstd::wstring\n\tReadStringFromRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValue, _In_ const std::wstring& szDefault)\n\t{\n\t\tif (szValue.empty()) return szDefault;\n\t\toutput::DebugPrint(DBGGeneric, L\"ReadStringFromRegistry(%ws)\\n\", szValue.c_str());\n\n\t\tDWORD dwKeyType = NULL;\n\t\tLPBYTE szBuf = nullptr;\n\t\tDWORD cb = NULL;\n\n\t\t\/\/ Get its size\n\t\tauto hRes = WC_W32(RegQueryValueExW(hKey, szValue.c_str(), nullptr, &dwKeyType, nullptr, &cb));\n\n\t\tif (hRes == S_OK && cb && !(cb % 2) && REG_SZ == dwKeyType)\n\t\t{\n\t\t\tszBuf = new (std::nothrow) BYTE[cb];\n\t\t\tif (szBuf)\n\t\t\t{\n\t\t\t\t\/\/ Get the current value\n\t\t\t\thRes = EC_W32(RegQueryValueExW(hKey, szValue.c_str(), nullptr, &dwKeyType, szBuf, &cb));\n\n\t\t\t\tif (FAILED(hRes))\n\t\t\t\t{\n\t\t\t\t\tdelete[] szBuf;\n\t\t\t\t\tszBuf = nullptr;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tauto ret = szDefault;\n\t\tif (hRes == S_OK && cb && !(cb % 2) && REG_SZ == dwKeyType && szBuf)\n\t\t{\n\t\t\tret = std::wstring(LPWSTR(szBuf), cb \/ sizeof WCHAR);\n\t\t}\n\n\t\tdelete[] szBuf;\n\t\treturn ret;\n\t}\n\n\tvoid ReadFromRegistry()\n\t{\n\t\tHKEY hRootKey = nullptr;\n\t\tWC_W32_S(RegOpenKeyExW(HKEY_CURRENT_USER, RKEY_ROOT, NULL, KEY_READ, &hRootKey));\n\n\t\t\/\/ Now that we have a root key, go get our values\n\t\tif (hRootKey)\n\t\t{\n\t\t\tfor (auto& regKey : RegKeys)\n\t\t\t{\n\t\t\t\tif (!regKey) continue;\n\n\t\t\t\tif (regKey->ulRegKeyType == regDWORD)\n\t\t\t\t{\n\t\t\t\t\tregKey->ulCurDWORD = ReadDWORDFromRegistry(hRootKey, regKey->szKeyName, regKey->ulCurDWORD);\n\t\t\t\t}\n\t\t\t\telse if (regKey->ulRegKeyType == regSTRING)\n\t\t\t\t{\n\t\t\t\t\tregKey->szCurSTRING = ReadStringFromRegistry(hRootKey, regKey->szKeyName, regKey->szCurSTRING);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tEC_W32_S(RegCloseKey(hRootKey));\n\t\t}\n\n\t\toutput::SetDebugLevel(debugTag);\n\t\toutput::DebugPrintVersion(DBGVersionBanner);\n\t}\n\n\tvoid WriteDWORDToRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValueName, DWORD dwValue)\n\t{\n\t\tWC_W32_S(RegSetValueExW(\n\t\t\thKey, szValueName.c_str(), NULL, REG_DWORD, reinterpret_cast(&dwValue), sizeof(DWORD)));\n\t}\n\n\tvoid CommitDWORDIfNeeded(\n\t\t_In_ HKEY hKey,\n\t\t_In_ const std::wstring& szValueName,\n\t\tconst DWORD dwValue,\n\t\tconst DWORD dwDefaultValue)\n\t{\n\t\tif (dwValue != dwDefaultValue)\n\t\t{\n\t\t\tWriteDWORDToRegistry(hKey, szValueName, dwValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tWC_W32_S(RegDeleteValueW(hKey, szValueName.c_str()));\n\t\t}\n\t}\n\n\tvoid WriteStringToRegistry(_In_ HKEY hKey, _In_ const std::wstring& szValueName, _In_ const std::wstring& szValue)\n\t{\n\t\t\/\/ Reg needs bytes, so CB is correct here\n\t\tauto cbValue = szValue.length() * sizeof(WCHAR);\n\t\tcbValue += sizeof(WCHAR); \/\/ NULL terminator\n\n\t\tWC_W32_S(RegSetValueExW(\n\t\t\thKey, szValueName.c_str(), NULL, REG_SZ, LPBYTE(szValue.c_str()), static_cast(cbValue)));\n\t}\n\n\tvoid CommitStringIfNeeded(\n\t\t_In_ HKEY hKey,\n\t\t_In_ const std::wstring& szValueName,\n\t\t_In_ const std::wstring& szValue,\n\t\t_In_ const std::wstring& szDefaultValue)\n\t{\n\t\tif (strings::wstringToLower(szValue) != strings::wstringToLower(szDefaultValue))\n\t\t{\n\t\t\tWriteStringToRegistry(hKey, szValueName, szValue);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tWC_W32_S(RegDeleteValueW(hKey, szValueName.c_str()));\n\t\t}\n\t}\n\n\t_Check_return_ HKEY CreateRootKey()\n\t{\n\t\tHKEY hkSub = nullptr;\n\n\t\t\/\/ Try to open the root key before we do the work to create it\n\t\tconst auto hRes = WC_W32(RegOpenKeyExW(HKEY_CURRENT_USER, RKEY_ROOT, NULL, KEY_READ | KEY_WRITE, &hkSub));\n\t\tif (SUCCEEDED(hRes) && hkSub) return hkSub;\n\n\t\tWC_W32_S(RegCreateKeyExW(\n\t\t\tHKEY_CURRENT_USER, RKEY_ROOT, 0, nullptr, 0, KEY_READ | KEY_WRITE, nullptr, &hkSub, nullptr));\n\n\t\treturn hkSub;\n\t}\n\n\tvoid WriteToRegistry()\n\t{\n\t\tconst auto hRootKey = CreateRootKey();\n\n\t\t\/\/ Now that we have a root key, go set our values\n\t\tfor (auto& regKey : RegKeys)\n\t\t{\n\t\t\tif (!regKey) continue;\n\n\t\t\tif (regKey->ulRegKeyType == regDWORD)\n\t\t\t{\n\t\t\t\tCommitDWORDIfNeeded(hRootKey, regKey->szKeyName, regKey->ulCurDWORD, regKey->ulDefDWORD);\n\t\t\t}\n\t\t\telse if (regKey->ulRegKeyType == regSTRING)\n\t\t\t{\n\t\t\t\tCommitStringIfNeeded(hRootKey, regKey->szKeyName, regKey->szCurSTRING, regKey->szDefSTRING);\n\t\t\t}\n\t\t}\n\n\t\tif (hRootKey) EC_W32_S(RegCloseKey(hRootKey));\n\t}\n} \/\/ namespace registry<|endoftext|>"} {"text":"#ifndef SILICIUM_POSIX_PIPE_HPP\n#define SILICIUM_POSIX_PIPE_HPP\n\n#include \n#include \n#include \n#ifdef _WIN32\n#include \n#else\n#include \n#endif\n\nnamespace Si\n{\n\tnamespace detail\n\t{\n#ifndef _WIN32\n\t\tinline boost::system::error_code\n\t\tset_close_on_exec(native_file_descriptor file) BOOST_NOEXCEPT\n\t\t{\n\t\t\tif (fcntl(file, F_SETFD, fcntl(file, F_GETFD) | FD_CLOEXEC) < 0)\n\t\t\t{\n\t\t\t\treturn get_last_error();\n\t\t\t}\n\t\t\treturn {};\n\t\t}\n#endif\n\t}\n\n\tstruct pipe\n\t{\n\t\tfile_handle write, read;\n\n\t\tpipe() BOOST_NOEXCEPT\n\t\t{\n\t\t}\n\n\t\tvoid close() BOOST_NOEXCEPT\n\t\t{\n\t\t\tpipe().swap(*this);\n\t\t}\n\n\t\tvoid swap(pipe &other) BOOST_NOEXCEPT\n\t\t{\n\t\t\twrite.swap(other.write);\n\t\t\tread.swap(other.read);\n\t\t}\n\n#if !SILICIUM_COMPILER_GENERATES_MOVES\n\t\tpipe(pipe &&other) BOOST_NOEXCEPT : write(std::move(other.write)),\n\t\t read(std::move(other.read))\n\t\t{\n\t\t}\n\n\t\tpipe &operator=(pipe &&other) BOOST_NOEXCEPT\n\t\t{\n\t\t\twrite = std::move(other.write);\n\t\t\tread = std::move(other.read);\n\t\t\treturn *this;\n\t\t}\n\n\t\tSILICIUM_DELETED_FUNCTION(pipe(pipe const &))\n\t\tSILICIUM_DELETED_FUNCTION(pipe &operator=(pipe const &))\n#endif\n\t};\n\n\tinline error_or make_pipe() BOOST_NOEXCEPT\n\t{\n#ifdef _WIN32\n\t\tSECURITY_ATTRIBUTES security = {};\n\t\tsecurity.nLength = sizeof(security);\n\t\tsecurity.bInheritHandle = TRUE;\n\t\tHANDLE read, write;\n\t\tif (!CreatePipe(&read, &write, &security, 0))\n\t\t{\n\t\t\treturn get_last_error();\n\t\t}\n\t\tpipe result;\n\t\tresult.read = file_handle(read);\n\t\tresult.write = file_handle(write);\n\t\treturn std::move(result);\n#else\n\t\tstd::array fds;\n\t\tif (::pipe(fds.data()) < 0)\n\t\t{\n\t\t\treturn get_last_error();\n\t\t}\n\t\tpipe result;\n\t\tresult.read = file_handle(fds[0]);\n\t\tresult.write = file_handle(fds[1]);\n\t\treturn std::move(result);\n#endif\n\t}\n}\n\n#endif\nWin32: make_pipe creates a non-inheritable pipe#ifndef SILICIUM_POSIX_PIPE_HPP\n#define SILICIUM_POSIX_PIPE_HPP\n\n#include \n#include \n#include \n#ifdef _WIN32\n#include \n#else\n#include \n#endif\n\nnamespace Si\n{\n\tnamespace detail\n\t{\n#ifndef _WIN32\n\t\tinline boost::system::error_code\n\t\tset_close_on_exec(native_file_descriptor file) BOOST_NOEXCEPT\n\t\t{\n\t\t\tif (fcntl(file, F_SETFD, fcntl(file, F_GETFD) | FD_CLOEXEC) < 0)\n\t\t\t{\n\t\t\t\treturn get_last_error();\n\t\t\t}\n\t\t\treturn {};\n\t\t}\n#endif\n\t}\n\n\tstruct pipe\n\t{\n\t\tfile_handle write, read;\n\n\t\tpipe() BOOST_NOEXCEPT\n\t\t{\n\t\t}\n\n\t\tvoid close() BOOST_NOEXCEPT\n\t\t{\n\t\t\tpipe().swap(*this);\n\t\t}\n\n\t\tvoid swap(pipe &other) BOOST_NOEXCEPT\n\t\t{\n\t\t\twrite.swap(other.write);\n\t\t\tread.swap(other.read);\n\t\t}\n\n#if !SILICIUM_COMPILER_GENERATES_MOVES\n\t\tpipe(pipe &&other) BOOST_NOEXCEPT : write(std::move(other.write)),\n\t\t read(std::move(other.read))\n\t\t{\n\t\t}\n\n\t\tpipe &operator=(pipe &&other) BOOST_NOEXCEPT\n\t\t{\n\t\t\twrite = std::move(other.write);\n\t\t\tread = std::move(other.read);\n\t\t\treturn *this;\n\t\t}\n\n\t\tSILICIUM_DELETED_FUNCTION(pipe(pipe const &))\n\t\tSILICIUM_DELETED_FUNCTION(pipe &operator=(pipe const &))\n#endif\n\t};\n\n\tinline error_or make_pipe() BOOST_NOEXCEPT\n\t{\n#ifdef _WIN32\n\t\tSECURITY_ATTRIBUTES security = {};\n\t\tsecurity.nLength = sizeof(security);\n\t\t\/\/usually you do not want to inherit random handles from the parent\n\t\tsecurity.bInheritHandle = FALSE;\n\t\tHANDLE read, write;\n\t\tif (!CreatePipe(&read, &write, &security, 0))\n\t\t{\n\t\t\treturn get_last_error();\n\t\t}\n\t\tpipe result;\n\t\tresult.read = file_handle(read);\n\t\tresult.write = file_handle(write);\n\t\treturn std::move(result);\n#else\n\t\tstd::array fds;\n\t\tif (::pipe(fds.data()) < 0)\n\t\t{\n\t\t\treturn get_last_error();\n\t\t}\n\t\tpipe result;\n\t\tresult.read = file_handle(fds[0]);\n\t\tresult.write = file_handle(fds[1]);\n\t\treturn std::move(result);\n#endif\n\t}\n}\n\n#endif\n<|endoftext|>"} {"text":"\/** File: test-iliopoulos-elimination.C\n * Author: Zhendong Wan\n *\/\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"test-common.h\"\n#include \n#include \n\nusing namespace LinBox;\n\ntemplate \nbool testRandom(const Ring& R, \n\t\tLinBox::VectorStream& stream1) {\n \n\tusing namespace std;\n\t\n\tostringstream str;\n \n\tstr << \"Testing Iloipoulos elimination:\";\n\n commentator.start (str.str ().c_str (), \"testRandom\", stream1.m ());\n\n bool ret = true;\n \n bool iter_passed = true;\n \n VectorDomain VD (R);\n\n\tVector d, x;\n\t\n\tVectorWrapper::ensureDim (d, stream1.n ());\n\t\n\tVectorWrapper::ensureDim (x, stream1.n ());\n\t\n\tint n = d. size();\n\n\t while (stream1) {\n \n commentator.startIteration (stream1.j ());\n \n\t\tostream &report = commentator.report (Commentator::LEVEL_IMPORTANT, INTERNAL_DESCRIPTION); \n\n iter_passed = true;\n \n stream1.next (d);\n\n\t\treport << \"Input vector: \";\n\t\tVD.write (report, d);\n report << endl;\n\n\t\tDenseMatrix D(R, n, n), L(R, n, n), U(R, n, n), A(R,n,n);\n\n\t\tint i, j;\n\n\t\tfor(i = 0; i < n; ++i) { R. assign (D[i][i], d[i]); R. init (L[i][i], 1); R. init (U[i][i], 1);}\n\t\t\n\t\tfor (i = 0; i < n; ++ i) \n\t\t\n\t\t\tfor (j = 0; j < i; ++ j) {\n\t\t\t\t\n\t\t\t\tR.init(L[i][j], rand() % 10);\n\t\t\t\t\n\t\t\t\tR.init(U[j][i], rand() % 10);\n\t\t\t}\n\t\n\t\n\t\tstd::vector tmp1(n), tmp2(n), e(n);\n\t\t\n\t\ttypename DenseMatrix::ColIterator col_p;\n\n\t\ti = 0;\n\t\tfor (col_p = A.colBegin(); col_p != A.colEnd(); ++ col_p, ++ i) {\n\t\t\t\n\t\t\tR.init(e[i],1);\n\t\t\tU.apply(tmp1, e);\n\t\t\tD.apply(tmp2, tmp1);\n\t\t\tL.apply(*col_p, tmp2);\n\t\t\tR.init(e[i],0);\n\t\t}\n\n\t\t\n\t\t\n\t\ttypename Ring::Element s;\n\t\t\n\t\tR. init (s, 1);\n\n\t\ttypename Vector::iterator d_p;\n\n\t\tfor(d_p = d.begin(); d_p!= d.end(); ++ d_p)\n\t\t\t\n\t\t\tR. lcm (s, s, *d_p);\n\n\t\treport << \"Last Invariant factor: \" ;\n\t\t\n\t\tR. write (report, s);\n\n\t\treport << '\\n';\n\n\t\tPIR_ntl_ZZ_p PIR(s);\n\t\t\n\t\tDenseMatrix* Ap;\n\n\t\tMatrixMod::mod (Ap, A, PIR);\n\t\t\n\t\tIliopoulosElimination::smithIn (*Ap);\n \t\t\n\t\treport << \"Computed Smith form: \\n\";\n\t\t\n\t\tfor ( unsigned int i = 0; i < A. rowdim(); ++ i)\n\t\t\treport << (*Ap)[i][i] << \" \";\n\t\t\n\t\treport << '\\n';\n\t\n\t\t\t\t\n\t\ttypename std::vector::iterator p1, p2;\n\t\ttypename Ring::Element g;\n\t\t\n\t\ti = 0;\n\n\t\tfor (p1 = x. begin(); p1 != x. end(); ++ p1, ++ i) {\n\n\t\t\tif (PIR.isZero((*Ap)[i][i])) \n\t\t\t\t\n\t\t\t\tR.assign (*p1, s);\n\n\t\t\telse\n\t\t\t\n\t\t\t\tR.assign (*p1, NTL::rep((*Ap)[i][i]));\n\t\t}\n\t\t\n\t\tfor (p1 = d.begin(); p1 != d.end(); ++ p1) {\n\t\t\t\n\t\t\tfor ( p2 = p1 + 1; p2 != d.end(); ++ p2) {\n\t\t\t\t\n\t\t\t\tif (R. isUnit(*p1)) break;\n \n\t\t\t\telse if (R. isZero (*p2)) continue;\n\t\t\t\t\n\t\t\t\telse if (R. isZero (*p1)) {\n std::swap (*p1, *p2);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse {\n\t\t\t\t\tR. gcd (g, *p1, *p2);\n\t\t\t\t\t\n\t\t\t\t\tR. divin (*p2, g);\n\t\t\t\t\t\n\t\t\t\t\tR. mulin (*p2, *p1);\n\t\t\t\t\t\n\t\t\t\t\tR. assign (*p1, g);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\treport << \"Expected smith form:\\n\";\n\t\t\n\t\tfor (p1 = d.begin(); p1 != d.end(); ++ p1)\n\t\t\treport << * p1 << \" \";\n\n\t\treport << '\\n';\n\n\t\tif (!VD.areEqual (d, x))\n\t\t\t\n\t\t\tret = iter_passed = false;\n\t\t\n if (!iter_passed) \n\t\t\t\n commentator.report (Commentator::LEVEL_IMPORTANT, INTERNAL_ERROR)\n\t\t\t\t<< \"ERROR: Computed Smith form is incorrect\" << endl;\n\t\t\t\n\t\t\n\n commentator.stop (\"done\");\n\n commentator.progress ();\n\t\t\n\t }\n\t \n\t \/\/stream1.reset ();\n\t \t \n\t commentator.stop (MSG_STATUS (ret), (const char *) 0, \"testRandom\");\n \n\t return ret;\n\n}\n\nint main(int argc, char** argv) {\n \n using namespace LinBox;\n \n bool pass = true;\n \n static size_t n = 20;\n \n static int iterations = 20;\n \n static Argument args[] = {\n { 'n', \"-n N\", \"Set order of test matrices to N (default 20)\", TYPE_INT, &n },\n { 'i', \"-i I\", \"Perform each test for I iterations (default 10)\"\n, TYPE_INT, &iterations },\n };\n \n \n parseArguments (argc, argv, args);\n \n typedef NTL_ZZ Ring;\n \n Ring R;\n\n\tstd::cout << std::endl << \"Ilioloulos Elimination test suite:\\n\";\n\n commentator.getMessageClass (INTERNAL_DESCRIPTION).setMaxDepth (5);\n\n RandomDenseStream s1 (R, n, iterations);\n \n if (!testRandom(R, s1)) pass = false;\n \n return pass ? 0 : -1;\n \n}\nIn IliopoulosElimination, when modulus is small, using PIRModular, otherwise using PIR_ntl_ZZ_p.\/** File: test-iliopoulos-elimination.C\n * Author: Zhendong Wan\n *\/\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \"test-common.h\"\n#include \n#include \n#include \n\nusing namespace LinBox;\n\ntemplate \nbool testRandom(const Ring& R, \n\t\tLinBox::VectorStream& stream1) {\n \n\tusing namespace std;\n\t\n\tostringstream str;\n \n\tstr << \"Testing Iloipoulos elimination:\";\n\n commentator.start (str.str ().c_str (), \"testRandom\", stream1.m ());\n\n bool ret = true;\n \n bool iter_passed = true;\n \n VectorDomain VD (R);\n\n\tVector d, x;\n\t\n\tVectorWrapper::ensureDim (d, stream1.n ());\n\t\n\tVectorWrapper::ensureDim (x, stream1.n ());\n\t\n\tint n = d. size();\n\n\t while (stream1) {\n \n commentator.startIteration (stream1.j ());\n \n\t\tostream &report = commentator.report (Commentator::LEVEL_IMPORTANT, INTERNAL_DESCRIPTION); \n\n iter_passed = true;\n \n stream1.next (d);\n\n\t\treport << \"Input vector: \";\n\t\tVD.write (report, d);\n report << endl;\n\n\t\tDenseMatrix D(R, n, n), L(R, n, n), U(R, n, n), A(R,n,n);\n\n\t\tint i, j;\n\n\t\tfor(i = 0; i < n; ++i) { R. assign (D[i][i], d[i]); R. init (L[i][i], 1); R. init (U[i][i], 1);}\n\t\t\n\t\tfor (i = 0; i < n; ++ i) \n\t\t\n\t\t\tfor (j = 0; j < i; ++ j) {\n\t\t\t\t\n\t\t\t\tR.init(L[i][j], rand() % 10);\n\t\t\t\t\n\t\t\t\tR.init(U[j][i], rand() % 10);\n\t\t\t}\n\t\n\t\n\t\tstd::vector tmp1(n), tmp2(n), e(n);\n\t\t\n\t\ttypename DenseMatrix::ColIterator col_p;\n\n\t\ti = 0;\n\t\tfor (col_p = A.colBegin(); col_p != A.colEnd(); ++ col_p, ++ i) {\n\t\t\t\n\t\t\tR.init(e[i],1);\n\t\t\tU.apply(tmp1, e);\n\t\t\tD.apply(tmp2, tmp1);\n\t\t\tL.apply(*col_p, tmp2);\n\t\t\tR.init(e[i],0);\n\t\t}\n\n\t\t\n\t\t\n\t\ttypename Ring::Element s;\n\t\t\n\t\tR. init (s, 1);\n\n\t\ttypename Vector::iterator d_p;\n\n\t\tfor(d_p = d.begin(); d_p!= d.end(); ++ d_p)\n\t\t\t\n\t\t\tR. lcm (s, s, *d_p);\n\n\t\treport << \"Last Invariant factor: \" ;\n\t\t\n\t\tR. write (report, s);\n\n\t\treport << '\\n';\n\t\t\n\t\t\n\t\tif (s >= LINBOX_MAX_MODULUS) {\n\n\t\t\treport << \"Using PIR_ntl_ZZ_p\\n\";\n\t\t\t\n\t\t\tPIR_ntl_ZZ_p PIR(s);\n\t\t\t\n\t\t\tDenseMatrix* Ap;\n\t\t\t\n\t\t\tMatrixMod::mod (Ap, A, PIR);\n\t\t\t\n\t\t\tIliopoulosElimination::smithIn (*Ap);\n\t\t\t\n\t\t\treport << \"Computed Smith form: \\n\";\n\t\t\t\n\t\t\tfor ( unsigned int i = 0; i < A. rowdim(); ++ i)\n\t\t\t\treport << (*Ap)[i][i] << \" \";\n\t\t\t\n\t\t\treport << '\\n';\n\t\t\t\n\t\t\tint i = 0;\n\t\t\t\n\t\t\ttypename std::vector::iterator p1;\n\t\t\t\n\t\t\t\n\t\t\tfor (p1 = x. begin(); p1 != x. end(); ++ p1, ++ i) {\n\t\t\t\t\n\t\t\t\tif (PIR.isZero((*Ap)[i][i])) \n\t\t\t\t\t\n\t\t\t\t\tR.assign (*p1, s);\n\t\t\t\t\n\t\t\t\telse\n\t\t\t\t\t\n\t\t\t\t\tR.assign (*p1, NTL::rep((*Ap)[i][i]));\n\t\t\t}\n\t\t}\n\n\t\telse {\n\n\t\t\treport << \"Using PIRModular\\n\";\n\t\t\n\t\t\tPIRModular PIR(s % LINBOX_MAX_MODULUS);\n\t\t\t\n\t\t\tDenseMatrix >* Ap;\n\t\t\t\n\t\t\tMatrixMod::mod (Ap, A, PIR);\n\t\t\t\n\t\t\tIliopoulosElimination::smithIn (*Ap);\n\t\t\t\n\t\t\t\n\t\t\treport << \"Computed Smith form: \\n\";\n \n\t\t\tfor ( unsigned int i = 0; i < A. rowdim(); ++ i)\n\t\t\t\treport << (*Ap)[i][i] << \" \";\n\t\t\t\n\t\t\treport << '\\n';\n\t\t\t\n\t\t\t\n\t\t\ttypename std::vector::iterator p1;\n\t\t\tint i = 0;\n\t\t\t\n\t\t\tfor (p1 = x. begin(); p1 != x. end(); ++ p1, ++ i) {\n\t\t\t\t\n\t\t\t\tif (PIR.isZero((*Ap)[i][i]))\n\t\t\t\t\t\n\t\t\t\t\tR.assign (*p1, s);\n\t\t\t\t\n\t\t\t\telse\n \n\t\t\t\t\tR.init (*p1, (*Ap)[i][i]);\n\t\t\t}\n\t\t}\n\t\t\t\n\t\ttypename std::vector::iterator p1, p2;\n\n\t\ttypename Ring::Element g;\n\t\t\n\t\tfor (p1 = d.begin(); p1 != d.end(); ++ p1) {\n\t\t\t\n\t\t\tfor ( p2 = p1 + 1; p2 != d.end(); ++ p2) {\n\t\t\t\t\n\t\t\t\tif (R. isUnit(*p1)) break;\n \n\t\t\t\telse if (R. isZero (*p2)) continue;\n\t\t\t\t\n\t\t\t\telse if (R. isZero (*p1)) {\n std::swap (*p1, *p2);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse {\n\t\t\t\t\tR. gcd (g, *p1, *p2);\n\t\t\t\t\t\n\t\t\t\t\tR. divin (*p2, g);\n\t\t\t\t\t\n\t\t\t\t\tR. mulin (*p2, *p1);\n\t\t\t\t\t\n\t\t\t\t\tR. assign (*p1, g);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\treport << \"Expected smith form:\\n\";\n\t\t\n\t\tfor (p1 = d.begin(); p1 != d.end(); ++ p1)\n\t\t\treport << * p1 << \" \";\n\n\t\treport << '\\n';\n\n\t\tif (!VD.areEqual (d, x))\n\t\t\t\n\t\t\tret = iter_passed = false;\n\t\t\n if (!iter_passed) \n\t\t\t\n commentator.report (Commentator::LEVEL_IMPORTANT, INTERNAL_ERROR)\n\t\t\t\t<< \"ERROR: Computed Smith form is incorrect\" << endl;\n\t\t\t\n\t\t\n\n commentator.stop (\"done\");\n\n commentator.progress ();\n\t\t\n\t }\n\t \n\t \/\/stream1.reset ();\n\t \t \n\t commentator.stop (MSG_STATUS (ret), (const char *) 0, \"testRandom\");\n \n\t return ret;\n\n}\n\nint main(int argc, char** argv) {\n \n using namespace LinBox;\n \n bool pass = true;\n \n static size_t n = 20;\n \n static int iterations = 20;\n \n static Argument args[] = {\n { 'n', \"-n N\", \"Set order of test matrices to N (default 20)\", TYPE_INT, &n },\n { 'i', \"-i I\", \"Perform each test for I iterations (default 10)\"\n, TYPE_INT, &iterations },\n };\n \n \n parseArguments (argc, argv, args);\n \n typedef NTL_ZZ Ring;\n \n Ring R;\n\n\tstd::cout << std::endl << \"Ilioloulos Elimination test suite:\\n\";\n\n commentator.getMessageClass (INTERNAL_DESCRIPTION).setMaxDepth (5);\n\n RandomDenseStream s1 (R, n, iterations);\n \n if (!testRandom(R, s1)) pass = false;\n \n return pass ? 0 : -1;\n \n}\n<|endoftext|>"} {"text":"#include \"net.hpp\"\n#include \"net_cpu.hpp\"\n#include \"net_gpu.hpp\"\n\n#include \n#include \n\nint main(int argc, char * argv[]) {\n arma::Mat A;\n A.load(\"mnist.arma\");\n A.shed_row(0); \/\/remove header labels\n const int n_rows = 40000;\n const int output_cols = 10;\n const int test_num = 2000;\n arma::Mat labels(n_rows, output_cols, arma::fill::zeros);\n arma::Mat test_labels(test_num, output_cols, arma::fill::zeros);\n int i=0;\n int j=0;\n for (auto iter = A.begin_col(0); iter != A.end_col(0); ++iter) {\n if (i >= n_rows) {\n if (j >= test_num) {\n break;\n }\n test_labels(j, *iter) = 1;\n j += 1;\n continue;\n }\n labels(i, *iter) = 1;\n i += 1;\n }\n\n\n std::cout << labels << std::endl;\n A.shed_col(0);\n A \/= 256;\n A -= .5;\n arma::Mat test = A.rows(n_rows, n_rows + test_num - 1);\n\n A.shed_rows(n_rows, A.n_rows-1);\n std::cout << A.n_rows << \",\" << labels.n_rows << std::endl;\n arma::Mat data = join_rows(labels, A);\n const int feature_size = 784;\n FeedForward_Network<> f(feature_size, 1000, 10);\n randomize(f);\n std::cout << \"train\" << std::endl;\n for (int i=0; i <80; i++) {\n std::cout << i << std::endl;\n gpu_train_batch(f, data.cols(output_cols, data.n_cols - 1).rows(0, n_rows-1), data.cols(0, output_cols-1), 0.03f, 10);\n std::cout << \"start score\" << std::endl;\n arma::Mat result = gpu_predict(f, data.cols(output_cols, data.n_cols-1).rows(0,n_rows-1));\n std::cout << \"Score: \" << classify_percent_score(result, data.cols(0, output_cols-1)) << std::endl;\n\n result = predict(f, test);\n std::cout << \"TestS: \" << classify_percent_score(result, test_labels) << std::endl;\n std::cout << \"Shuffling\" << std::endl;\n data = shuffle(data);\n }\n\n return 0;\n}\nremoved old mnist sample<|endoftext|>"} {"text":"#include \n#include \"List.h\"\n\nusing namespace std;\nusing namespace List_h;\n\nint main() {\n Slink_list sl{ 1, 2, 3, 4, 5 };\n Slink_list tl;\n\n const Link *list = sl.get_head();\n\n print_link(tl.get_head());\n\n sl.push_back(nullptr);\n tl.push_back(new Link{ 120 });\n\n print_link(list);\n print_link(tl.get_head());\n\n return 0;\n}Change the example#include \n#include \"List.h\"\n\nusing namespace std;\nusing namespace List_h;\n\nvoid foo() {\n Skip_list ll;\n\n for (auto i = -50; i < 50000; ++i) {\n ll.push_back(i);\n }\n\n ll.display();\n}\n\nint main() {\n Skip_list sl;\n \n sl.push_back(3);\n sl.push_back(6);\n sl.push_back(7);\n sl.push_back(9);\n sl.push_back(12);\n sl.push_back(17);\n sl.push_back(19);\n sl.push_back(25);\n sl.push_back(26);\n\n sl.insert(40, 40);\n sl.push_front(1);\n\n sl.delete_node(1);\n sl.delete_node(17);\n\n sl.display();\n\n int val;\n\n std::cout << \"Please enter a number to search: \";\n std::cin >> val;\n\n if (sl.search(val)) {\n std::cout << val << \" was found\" << std::endl;\n }\n else {\n std::cout << val << \" was not found\" << std::endl;\n }\n\n return 0;\n}<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \"FireLog.h\"\n#include \"FireUtils.h\"\n#include \"version.h\"\n#include \"FireStepSerial.h\"\n\nusing namespace std;\nusing namespace firestep;\n\nFireStepSerial::FireStepSerial(const char *serialPath, int32_t msResponse) \n : serialPath(serialPath), msResponse(msResponse), usb(serialPath)\n{\n}\n\nFireStepSerial::~FireStepSerial() {\n\tclose();\n}\n\nint FireStepSerial::executeCore(const std::string &request, std::string &response) {\n\tint rc = 0;\n\tusb.write(request);\n\tresponse = usb.readln(msResponse);\n\tif (request.compare(\"\\n\") == 0) { \/\/ simple LF should be echoed\n\t\tfor (int i=0; response.size() == 0 && i<4; i++) {\n\t\t\tLOGDEBUG1(\"FireStepClient::console() wait %ldms\", (long) msResponse);\n\t\t\tresponse = usb.readln(msResponse);\n\t\t}\n\t} else { \/\/ JSON response should end with }-SPACE-LF\n\t\tint nRead = 0;\n\t\tfor (int i=0; response.find(\"} \\n\")==string::npos && (nRead != response.size() || i<4); i++) {\n\t\t\tnRead = response.size();\n\t\t\tLOGDEBUG1(\"FireStepClient::console() wait %ldms\", (long) msResponse);\n\t\t\tresponse += usb.readln(msResponse);\n\t\t}\n\t}\n\n\treturn rc;\n}\n\nint FireStepSerial::reset() {\n int rc = 0;\n if (isOpen()) {\n\t\tconst char *msg =\"FireStepSerial::reset() sending LF to interrupt FireStep\";\n\t\tcerr << \"RESET\t: \" << msg << endl;\n\t\tLOGINFO1(\"%s\", msg);\n\t\tusb.writeln(); \/\/ interrupt any current processing\n rc = close();\n }\n if (rc == 0) {\n\t\tLOGINFO(\"FireStepSerial::reset() configure(hup)\");\n rc = usb.configure(true);\n }\n if (rc != 0) {\n\t\tconst char *msg = \"could not configure serial port (hup) \";\n cerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return rc;\n }\n rc = open();\n if (rc == 0) {\n\t\tLOGINFO(\"FireStepSerial::reset() configure(nohup)\");\n rc = close(); \/\/ hup reset happens here\n }\n\n if (rc == 0) {\n rc = usb.configure(false);\n }\n if (rc != 0) {\n\t\tconst char *msg = \"could not configure serial port (nohup) \";\n cerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return rc;\n\t}\n rc = open(); \n if (rc == 0) { \/\/ clear out startup text\n string ignore = usb.readln(5000);\n\t\tcerr << \"RESET\t: re-open \" << serialPath;\n while (ignore.size()) {\n LOGINFO1(\"FireStepSerial::reset() ignored:%ldB\", (long) ignore.size());\n LOGDEBUG1(\"FireStepSerial::reset() ignore:%s\", ignore.c_str());\n\t\t\tcerr << \".\";\n ignore = usb.readln();\n }\n\t\tcerr << endl;\n rc = close(); \/\/ nohup\n }\n\tLOGINFO(\"FireStepSerial::reset() complete\");\n\treturn rc;\n}\n\nint FireStepSerial::open() {\n if (!isOpen() && usb.open() != 0) {\n\t\tconst char *msg = \"FireStepSerial::open() failed:\";\n\t\tcerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n\t\treturn STATUS_USB_OPEN;\n\t}\n\treturn IFireStep::open();\n}\n\nint FireStepSerial::close() {\n if (isOpen() && usb.close() != 0) {\n\t\tconst char *msg = \"FireStepSerial::close() failed:\";\n\t\tcerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return STATUS_USB_CLOSE;\n }\n return IFireStep::close();\n}\n\nfirestep client display startup text#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \"FireLog.h\"\n#include \"FireUtils.h\"\n#include \"version.h\"\n#include \"FireStepSerial.h\"\n\nusing namespace std;\nusing namespace firestep;\n\nFireStepSerial::FireStepSerial(const char *serialPath, int32_t msResponse) \n : serialPath(serialPath), msResponse(msResponse), usb(serialPath)\n{\n}\n\nFireStepSerial::~FireStepSerial() {\n\tclose();\n}\n\nint FireStepSerial::executeCore(const std::string &request, std::string &response) {\n\tint rc = 0;\n\tusb.write(request);\n\tresponse = usb.readln(msResponse);\n\tif (request.compare(\"\\n\") == 0) { \/\/ simple LF should be echoed\n\t\tfor (int i=0; response.size() == 0 && i<4; i++) {\n\t\t\tLOGDEBUG1(\"FireStepClient::console() wait %ldms\", (long) msResponse);\n\t\t\tresponse = usb.readln(msResponse);\n\t\t}\n\t} else { \/\/ JSON response should end with }-SPACE-LF\n\t\tint nRead = 0;\n\t\tfor (int i=0; response.find(\"} \\n\")==string::npos && (nRead != response.size() || i<4); i++) {\n\t\t\tnRead = response.size();\n\t\t\tLOGDEBUG1(\"FireStepClient::console() wait %ldms\", (long) msResponse);\n\t\t\tresponse += usb.readln(msResponse);\n\t\t}\n\t}\n\n\treturn rc;\n}\n\nint FireStepSerial::reset() {\n int rc = 0;\n if (isOpen()) {\n\t\tconst char *msg =\"FireStepSerial::reset() sending LF to interrupt FireStep\";\n\t\tcerr << \"RESET\t: \" << msg << endl;\n\t\tLOGINFO1(\"%s\", msg);\n\t\tusb.writeln(); \/\/ interrupt any current processing\n rc = close();\n }\n if (rc == 0) {\n\t\tLOGINFO(\"FireStepSerial::reset() configure(hup)\");\n rc = usb.configure(true);\n }\n if (rc != 0) {\n\t\tconst char *msg = \"could not configure serial port (hup) \";\n cerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return rc;\n }\n rc = open();\n if (rc == 0) {\n\t\tLOGINFO(\"FireStepSerial::reset() configure(nohup)\");\n rc = close(); \/\/ hup reset happens here\n }\n\n if (rc == 0) {\n rc = usb.configure(false);\n }\n if (rc != 0) {\n\t\tconst char *msg = \"could not configure serial port (nohup) \";\n cerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return rc;\n\t}\n rc = open(); \n if (rc == 0) { \/\/ clear out startup text\n string ignore = usb.readln(5000);\n\t\tcerr << \"RESET\t: re-open \" << serialPath << endl;\n while (ignore.size()) {\n LOGINFO1(\"FireStepSerial::reset() ignored:%ldB\", (long) ignore.size());\n LOGDEBUG1(\"FireStepSerial::reset() ignore:%s\", ignore.c_str());\n\t\t\tcerr << ignore ; \n ignore = usb.readln();\n }\n rc = close(); \/\/ nohup\n }\n\tLOGINFO(\"FireStepSerial::reset() complete\");\n\treturn rc;\n}\n\nint FireStepSerial::open() {\n if (!isOpen() && usb.open() != 0) {\n\t\tconst char *msg = \"FireStepSerial::open() failed:\";\n\t\tcerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n\t\treturn STATUS_USB_OPEN;\n\t}\n\treturn IFireStep::open();\n}\n\nint FireStepSerial::close() {\n if (isOpen() && usb.close() != 0) {\n\t\tconst char *msg = \"FireStepSerial::close() failed:\";\n\t\tcerr << \"ERROR\t: \" << msg << serialPath << endl;\n\t\tLOGERROR2(\"%s%s\", msg, serialPath.c_str());\n return STATUS_USB_CLOSE;\n }\n return IFireStep::close();\n}\n\n<|endoftext|>"} {"text":"\n#include \n#include \n#include \"i2cdetect.h\"\n\nvoid i2cdetect(uint8_t first, uint8_t last) {\n uint8_t i, j, address, error;\n\n \/\/ header\n Serial.print(\" \");\n for (i = 0; i < 16; i++) {\n Serial.printf(\"%3x\", i);\n }\n Serial.println(\"\");\n\n for (j = 0; j < 8; j++) {\n Serial.printf(\"%02d:\", j*10);\n for (i = 0; i < 16; i++) {\n address = i + j*16;\n if (address >= first && address <= last) {\n Wire.beginTransmission(address);\n error = Wire.endTransmission();\n if (error) {\n Serial.print(\" --\");\n } else {\n Serial.printf(\" %02x\", address);\n }\n } else {\n Serial.print(\" \");\n }\n }\n Serial.println(\"\");\n }\n}\n\nvoid i2cdetect() {\n i2cdetect(0x03, 0x77);\n}\n\nFixed printf\n#include \n#include \n#include \"i2cdetect.h\"\n\n\/\/ _printf base code: http:\/\/playground.arduino.cc\/Main\/Printf\n#include \n#define PRINTF_BUF 80 \/\/ define the tmp buffer size (change if desired)\nvoid _printf(const char *format, ...)\n{\n char buf[PRINTF_BUF];\n va_list ap;\n va_start(ap, format);\n vsnprintf(buf, sizeof(buf), format, ap);\n for(char *p = &buf[0]; *p; p++) \/\/ emulate cooked mode for newlines\n {\n if(*p == '\\n')\n Serial.write('\\r');\n Serial.write(*p);\n }\n va_end(ap);\n}\n\nvoid i2cdetect(uint8_t first, uint8_t last) {\n uint8_t i, j, address, error;\n\n \/\/ header\n Serial.print(\" \");\n for (i = 0; i < 16; i++) {\n printf(\"%3x\", i);\n }\n Serial.println(\"\");\n\n for (j = 0; j < 8; j++) {\n _printf(\"%02d:\", j*10);\n for (i = 0; i < 16; i++) {\n address = i + j*16;\n if (address >= first && address <= last) {\n Wire.beginTransmission(address);\n error = Wire.endTransmission();\n if (error) {\n Serial.print(\" --\");\n } else {\n _printf(\" %02x\", address);\n }\n } else {\n Serial.print(\" \");\n }\n }\n Serial.println(\"\");\n }\n}\n\nvoid i2cdetect() {\n i2cdetect(0x03, 0x77);\n}\n\n<|endoftext|>"} {"text":"#include\n#include \"object.h\"\n\n\nvoid object::init(LPDIRECT3DDEVICE9 g_pd3dDevice, int VertexSize, int IndexSize, CUSTOMVERTEX Vertices[], WORD Indices[],int PrimitiveCount)\n{\n\t\n\tm_VertexSize = VertexSize;\n\tm_IndexSize = IndexSize;\n\tm_PrimitiveCount = PrimitiveCount;\n\tg_pd3dDevice->CreateVertexBuffer(m_VertexSize*sizeof(CUSTOMVERTEX), 0, D3DFVF_CUSTOMVERTEX, D3DPOOL_DEFAULT, &m_pVertexBuffer, NULL);\n\tg_pd3dDevice->CreateIndexBuffer(m_IndexSize*sizeof(WORD), 0, D3DFMT_INDEX16, D3DPOOL_DEFAULT, &m_pIndexBuffer, NULL);\n\tWriteInVertexBuffer(Vertices);\n\tWriteInIndexBuffer(Indices);\n}\n\nobject::~object()\n{\n\tSAFE_RELEASE(m_pVertexBuffer);\n\tSAFE_RELEASE(m_pIndexBuffer);\n}\n\nobject::object()\n{\n\tm_VertexSize = 0;\n\tm_IndexSize = 0;\n\tm_PrimitiveCount = 0;\n\tm_pVertexBuffer = NULL;\n\tm_pIndexBuffer = NULL;\n\tmVertices = NULL;\n\tmIndices = NULL;\n}\n\nvoid object::WriteInVertexBuffer(CUSTOMVERTEX Vertices[])\n{\n\tm_pVertexBuffer->Lock(0, 0, (void**)&mVertices, 0);\n\tmemcpy(mVertices, Vertices, m_VertexSize*sizeof(CUSTOMVERTEX));\n\tm_pIndexBuffer->Unlock();\n}\n\nvoid object::WriteInIndexBuffer(WORD Indices[])\n{\n\tm_pIndexBuffer->Lock(0, 0, (void**)&mIndices, 0);\n\tmemcpy(mIndices, Indices, m_IndexSize*sizeof(WORD));\n\tm_pIndexBuffer->Unlock();\n}\n\nvoid object::ObjectPrint(LPDIRECT3DDEVICE9 g_pd3dDevice)\n{\n\tg_pd3dDevice->SetStreamSource(0, m_pVertexBuffer, 0, sizeof(CUSTOMVERTEX));\n\tg_pd3dDevice->SetFVF(D3DFVF_CUSTOMVERTEX);\n\tg_pd3dDevice->SetIndices(m_pIndexBuffer);\n\tg_pd3dDevice->DrawIndexedPrimitive(D3DPT_TRIANGLELIST, 0, 0, m_VertexSize, 0,(UINT)m_PrimitiveCount);\n}solve a big bug!#include\n#include \"object.h\"\n\n\nvoid object::init(LPDIRECT3DDEVICE9 g_pd3dDevice, int VertexSize, int IndexSize, CUSTOMVERTEX Vertices[], WORD Indices[],int PrimitiveCount)\n{\n\t\n\tm_VertexSize = VertexSize;\n\tm_IndexSize = IndexSize;\n\tm_PrimitiveCount = PrimitiveCount;\n\tg_pd3dDevice->CreateVertexBuffer(m_VertexSize*sizeof(CUSTOMVERTEX), 0, D3DFVF_CUSTOMVERTEX, D3DPOOL_DEFAULT, &m_pVertexBuffer, NULL);\n\tg_pd3dDevice->CreateIndexBuffer(m_IndexSize*sizeof(WORD), 0, D3DFMT_INDEX16, D3DPOOL_DEFAULT, &m_pIndexBuffer, NULL);\n\tWriteInVertexBuffer(Vertices);\n\tWriteInIndexBuffer(Indices);\n}\n\nobject::~object()\n{\n\tSAFE_RELEASE(m_pVertexBuffer);\n\tSAFE_RELEASE(m_pIndexBuffer);\n}\n\nobject::object()\n{\n\tm_VertexSize = 0;\n\tm_IndexSize = 0;\n\tm_PrimitiveCount = 0;\n\tm_pVertexBuffer = NULL;\n\tm_pIndexBuffer = NULL;\n\tmVertices = NULL;\n\tmIndices = NULL;\n}\n\nvoid object::WriteInVertexBuffer(CUSTOMVERTEX Vertices[])\n{\n\tm_pVertexBuffer->Lock(0, 0, (void**)&mVertices, 0);\n\tmemcpy(mVertices, Vertices, m_VertexSize*sizeof(CUSTOMVERTEX));\n\tm_pVertexBuffer->Unlock();\n}\n\nvoid object::WriteInIndexBuffer(WORD Indices[])\n{\n\tm_pIndexBuffer->Lock(0, 0, (void**)&mIndices, 0);\n\tmemcpy(mIndices, Indices, m_IndexSize*sizeof(WORD));\n\tm_pIndexBuffer->Unlock();\n}\n\nvoid object::ObjectPrint(LPDIRECT3DDEVICE9 g_pd3dDevice)\n{\n\tg_pd3dDevice->SetStreamSource(0, m_pVertexBuffer, 0, sizeof(CUSTOMVERTEX));\n\tg_pd3dDevice->SetFVF(D3DFVF_CUSTOMVERTEX);\n\tg_pd3dDevice->SetIndices(m_pIndexBuffer);\n\tg_pd3dDevice->DrawIndexedPrimitive(D3DPT_TRIANGLELIST, 0, 0, m_VertexSize, 0,(UINT)m_PrimitiveCount);\n}<|endoftext|>"} {"text":"\/*\n * Copyright (c) 2013-2014 Nicholas Corgan (n.corgan@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n#ifndef INCLUDED_GAME_SAVE_IMPL_HPP\n#define INCLUDED_GAME_SAVE_IMPL_HPP\n\n#include \n\n#include \"conversions\/trainer.hpp\"\n\nnamespace pkmn\n{\n class game_save_impl: public game_save\n {\n public:\n \n game_save_impl() {};\n \n unsigned int get_game_id() const;\n \n trainer::sptr get_trainer() const;\n \n bag::sptr get_trainer_bag() const;\n \n void get_trainer_party(pokemon_team_t& party);\n void set_trainer_party(pokemon_team_t& party);\n \n pokemon_text get_trainer_name() const;\n void set_trainer_name(pokemon_text trainer_name);\n \n protected:\n \n unsigned int _game_id;\n trainer::sptr _trainer;\n };\n}\n#endif \/* INCLUDED_GAME_SAVE_IMPL_HPP *\/Made game_save_impl a subclass of boost::noncopyable, added a filepath protected variable\/*\n * Copyright (c) 2013-2014 Nicholas Corgan (n.corgan@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n#ifndef INCLUDED_GAME_SAVE_IMPL_HPP\n#define INCLUDED_GAME_SAVE_IMPL_HPP\n\n#include \n#include \n\n#include \n\n#include \"conversions\/trainer.hpp\"\n\nnamespace pkmn\n{\n class game_save_impl: public game_save, boost::noncopyable\n {\n public:\n \n game_save_impl() {};\n \n unsigned int get_game_id() const;\n \n trainer::sptr get_trainer() const;\n \n bag::sptr get_trainer_bag() const;\n \n void get_trainer_party(pokemon_team_t& party);\n void set_trainer_party(pokemon_team_t& party);\n \n pokemon_text get_trainer_name() const;\n void set_trainer_name(pokemon_text trainer_name);\n \n protected:\n\n boost::filesystem::path filepath;\n\n unsigned int _game_id;\n trainer::sptr _trainer;\n };\n}\n#endif \/* INCLUDED_GAME_SAVE_IMPL_HPP *\/\n<|endoftext|>"} {"text":"#include \"Zenderer\/Network\/Socket.hpp\"\n\nusing namespace zen;\nusing util::CLog;\nusing util::LogMode;\nusing net::CSocket;\n\nbool CSocket::s_init = false;\n\nbool CSocket::InitializeLibrary()\n{\n if(s_init) return true;\n\n#ifdef _WIN32\n WSADATA Data;\n if(WSAStartup(MAKEWORD(2, 0), &Data) != 0)\n {\n return (s_init = false);\n }\n#endif \/\/ _WIN32\n return (s_init = true);\n}\n\nbool CSocket::Init(const string_t& host, const string_t& port)\n{\n addrinfo hints;\n addrinfo* tmp;\n\n memset(&hints, 0, sizeof(hints));\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_DGRAM;\n hints.ai_flags = AI_PASSIVE ? host.empty() : 0;\n\n if(m_Type == SocketType::TCP)\n hints.ai_socktype = SOCK_STREAM;\n\n else if(m_Type == SocketType::RAW)\n hints.ai_socktype = SOCK_RAW;\n\n if(getaddrinfo(host.empty() ? nullptr : host.c_str(),\n port.empty() ? nullptr : port.c_str(),\n &hints, &tmp) != 0)\n {\n return false;\n }\n\n addrinfo* result = tmp;\n for( ; result != nullptr; result = result->ai_next)\n {\n if((m_socket = socket(result->ai_family,\n result->ai_socktype,\n result->ai_protocol)) == -1)\n {\n continue;\n }\n\n this->SetSocketOption(SOL_SOCKET, SO_REUSEADDR, true);\n\n if(bind(m_socket, result->ai_addr, result->ai_addrlen) == -1)\n {\n this->Destroy();\n continue;\n }\n }\n\n freeaddrinfo(tmp);\n return m_socket != -1;\n}\n\nbool CSocket::Destroy()\n{\n if(m_socket == -1) return false;\n#ifdef _WIN32\n closesocket(m_socket);\n#else\n close(m_socket);\n#endif \/\/ _WIN32\n return (m_socket = -1);\n}\n\nstring_t CSocket::RecvFrom(const size_t size, string_t& address,\n string_t& port)\n{\n if(m_socket <= 0) return \"\";\n\n address = \"\";\n sockaddr_in addr;\n int addrlen = sizeof(addr);\n char* buffer = new char[size];\n\n int bytes = recvfrom(m_socket, buffer, size, 0,\n (sockaddr*)&addr, &addrlen);\n if(bytes == -1)\n {\n delete[] buffer;\n return string_t(\"\");\n }\n\n address = CSocket::GetAddress(addr);\n std::stringstream ss;\n ss << ntohs(addr.sin_port);\n port = ss.str();\n\n string_t ret(buffer, bytes);\n delete[] buffer;\n\n#ifdef ZEN_DEBUG_BUILD\n CLog& Log = CLog::GetEngineLog();\n Log << Log.SetMode(LogMode::ZEN_DEBUG) << Log.SetSystem(\"Network\")\n << \"Received '\" << ret << \"' from \" << address << ':'\n << port << '.' << CLog::endl;\n#endif \/\/ ZEN_DEBUG_BUILD\n\n return ret;\n}\n\nint CSocket::SendTo(const std::string& addr, const std::string& port,\n const std::string& data)\n{\n if(m_socket < 0 || m_Type == SocketType::TCP) return -1;\n\n#ifdef ZEN_DEBUG_BUILD\n CLog& Log = CLog::GetEngineLog();\n Log << Log.SetMode(LogMode::ZEN_DEBUG) << Log.SetSystem(\"Network\")\n << \"Sending '\" << data << \"' to \" << addr << ':' << port\n << '.' << CLog::endl;\n#endif \/\/ ZEN_DEBUG_BUILD\n\n sockaddr_in sock;\n sock.sin_family = AF_INET;\n sock.sin_port = htons(std::stoi(port));\n sock.sin_addr = this->GetAddress(addr);\n return sendto(m_socket, data.c_str(), data.size(), 0,\n (sockaddr*)&sock, sizeof(sock));\n}\n\nint CSocket::SendBroadcast(const string_t& message, const string_t& port)\n{\n if(m_Type != SocketType::UDP)\n {\n m_Log << m_Log.SetSystem(\"Network\")\n << m_Log.SetMode(LogMode::ZEN_ERROR)\n << \"Broadcasting is only for UDP packets.\" << CLog::endl;\n return -1;\n }\n\n this->SetSocketOption(SOL_SOCKET, SO_BROADCAST, true);\n int b = this->SendTo(\"255.255.255.255\", port, message);\n this->SetSocketOption(SOL_SOCKET, SO_BROADCAST, false);\n return b;\n}\n\nbool CSocket::Ping()\n{\n ZEN_ASSERTM(false, \"not implemented\");\n return false;\n}\n\nbool CSocket::SetSocketOption(const int type, const int option,\n const bool flag)\n{\n if(m_socket < 0) return false;\n char set = flag ? 1 : 0;\n return setsockopt(m_socket, type, option, &set, sizeof set) == 0;\n}\n\nbool CSocket::SetNonblocking(const bool flag)\n{\n if(m_socket < 0) return false;\n\n#ifdef _WIN32\n unsigned long set = flag ? 1 : 0;\n return ioctlsocket(m_socket, FIONBIO, &set) == 0;\n#else\n int set = flag ? 1 : 0;\n return fcntl(m_socket, F_SETFL, O_NONBLOCK, &set) == 0;\n#endif\n}\n\nint CSocket::GetError() const\n{\n#ifdef _WIN32\n return WSAGetLastError();\n#else\n return errno;\n#endif \/\/ _WIN32\n}\n\nstring_t CSocket::GetAddress(sockaddr_in& addr)\n{\n \/\/ We would like to support Windows XP and above.\n#ifdef _WIN32\n return string_t(inet_ntoa(addr.sin_addr));\n#else\n char ip[INET_ADDRSTRLEN] = {0};\n inet_ntop(AF_INET, &(addr.sin_addr), ip, INET_ADDRSTRLEN);\n return string_t(ip);\n#endif \/\/ _WIN32\n}\n\nin_addr CSocket::GetAddress(const std::string& ip)\n{\n in_addr s;\n\n \/\/ We would like to support Windows XP and above.\n#ifdef _WIN32\n s.S_un.S_addr = inet_addr(ip.c_str());\n#else\n inet_pton(AF_INET, ip.c_str(), &s);\n#endif \/\/ _WIN32\n\n return s;\n}\n\nUse zen::string_t in sockets.#include \"Zenderer\/Network\/Socket.hpp\"\n\nusing namespace zen;\nusing util::CLog;\nusing util::LogMode;\nusing net::CSocket;\n\nbool CSocket::s_init = false;\n\nbool CSocket::InitializeLibrary()\n{\n if(s_init) return true;\n\n#ifdef _WIN32\n WSADATA Data;\n if(WSAStartup(MAKEWORD(2, 0), &Data) != 0)\n {\n return (s_init = false);\n }\n#endif \/\/ _WIN32\n return (s_init = true);\n}\n\nbool CSocket::Init(const string_t& host, const string_t& port)\n{\n addrinfo hints;\n addrinfo* tmp;\n\n memset(&hints, 0, sizeof(hints));\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_DGRAM;\n hints.ai_flags = AI_PASSIVE ? host.empty() : 0;\n\n if(m_Type == SocketType::TCP)\n hints.ai_socktype = SOCK_STREAM;\n\n else if(m_Type == SocketType::RAW)\n hints.ai_socktype = SOCK_RAW;\n\n if(getaddrinfo(host.empty() ? nullptr : host.c_str(),\n port.empty() ? nullptr : port.c_str(),\n &hints, &tmp) != 0)\n {\n return false;\n }\n\n addrinfo* result = tmp;\n for( ; result != nullptr; result = result->ai_next)\n {\n if((m_socket = socket(result->ai_family,\n result->ai_socktype,\n result->ai_protocol)) == -1)\n {\n continue;\n }\n\n this->SetSocketOption(SOL_SOCKET, SO_REUSEADDR, true);\n\n if(bind(m_socket, result->ai_addr, result->ai_addrlen) == -1)\n {\n this->Destroy();\n continue;\n }\n }\n\n freeaddrinfo(tmp);\n return m_socket != -1;\n}\n\nbool CSocket::Destroy()\n{\n if(m_socket == -1) return false;\n#ifdef _WIN32\n closesocket(m_socket);\n#else\n close(m_socket);\n#endif \/\/ _WIN32\n return (m_socket = -1);\n}\n\nstring_t CSocket::RecvFrom(const size_t size, string_t& address,\n string_t& port)\n{\n if(m_socket <= 0) return \"\";\n\n address = \"\";\n sockaddr_in addr;\n int addrlen = sizeof(addr);\n char* buffer = new char[size];\n\n int bytes = recvfrom(m_socket, buffer, size, 0,\n (sockaddr*)&addr, &addrlen);\n if(bytes == -1)\n {\n delete[] buffer;\n return string_t(\"\");\n }\n\n address = CSocket::GetAddress(addr);\n std::stringstream ss;\n ss << ntohs(addr.sin_port);\n port = ss.str();\n\n string_t ret(buffer, bytes);\n delete[] buffer;\n\n#ifdef ZEN_DEBUG_BUILD\n CLog& Log = CLog::GetEngineLog();\n Log << Log.SetMode(LogMode::ZEN_DEBUG) << Log.SetSystem(\"Network\")\n << \"Received '\" << ret << \"' from \" << address << ':'\n << port << '.' << CLog::endl;\n#endif \/\/ ZEN_DEBUG_BUILD\n\n return ret;\n}\n\nint CSocket::SendTo(const string_t& addr, const string_t& port,\n const string_t& data)\n{\n if(m_socket < 0 || m_Type == SocketType::TCP) return -1;\n\n#ifdef ZEN_DEBUG_BUILD\n CLog& Log = CLog::GetEngineLog();\n Log << Log.SetMode(LogMode::ZEN_DEBUG) << Log.SetSystem(\"Network\")\n << \"Sending '\" << data << \"' to \" << addr << ':' << port\n << '.' << CLog::endl;\n#endif \/\/ ZEN_DEBUG_BUILD\n\n sockaddr_in sock;\n sock.sin_family = AF_INET;\n sock.sin_port = htons(std::stoi(port));\n sock.sin_addr = this->GetAddress(addr);\n return sendto(m_socket, data.c_str(), data.size(), 0,\n (sockaddr*)&sock, sizeof(sock));\n}\n\nint CSocket::SendBroadcast(const string_t& message, const string_t& port)\n{\n if(m_Type != SocketType::UDP)\n {\n m_Log << m_Log.SetSystem(\"Network\")\n << m_Log.SetMode(LogMode::ZEN_ERROR)\n << \"Broadcasting is only for UDP packets.\" << CLog::endl;\n return -1;\n }\n\n this->SetSocketOption(SOL_SOCKET, SO_BROADCAST, true);\n int b = this->SendTo(\"255.255.255.255\", port, message);\n this->SetSocketOption(SOL_SOCKET, SO_BROADCAST, false);\n return b;\n}\n\nbool CSocket::Ping()\n{\n ZEN_ASSERTM(false, \"not implemented\");\n return false;\n}\n\nbool CSocket::SetSocketOption(const int type, const int option,\n const bool flag)\n{\n if(m_socket < 0) return false;\n char set = flag ? 1 : 0;\n return setsockopt(m_socket, type, option, &set, sizeof set) == 0;\n}\n\nbool CSocket::SetNonblocking(const bool flag)\n{\n if(m_socket < 0) return false;\n\n#ifdef _WIN32\n unsigned long set = flag ? 1 : 0;\n return ioctlsocket(m_socket, FIONBIO, &set) == 0;\n#else\n int set = flag ? 1 : 0;\n return fcntl(m_socket, F_SETFL, O_NONBLOCK, &set) == 0;\n#endif\n}\n\nint CSocket::GetError() const\n{\n#ifdef _WIN32\n return WSAGetLastError();\n#else\n return errno;\n#endif \/\/ _WIN32\n}\n\nstring_t CSocket::GetAddress(sockaddr_in& addr)\n{\n \/\/ We would like to support Windows XP and above.\n#ifdef _WIN32\n return string_t(inet_ntoa(addr.sin_addr));\n#else\n char ip[INET_ADDRSTRLEN] = {0};\n inet_ntop(AF_INET, &(addr.sin_addr), ip, INET_ADDRSTRLEN);\n return string_t(ip);\n#endif \/\/ _WIN32\n}\n\nin_addr CSocket::GetAddress(const string_t& ip)\n{\n in_addr s;\n\n \/\/ We would like to support Windows XP and above.\n#ifdef _WIN32\n s.S_un.S_addr = inet_addr(ip.c_str());\n#else\n inet_pton(AF_INET, ip.c_str(), &s);\n#endif \/\/ _WIN32\n\n return s;\n}\n\n<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"include\/factory\/logging_interface.h\"\n#include \"include\/factory\/http_interface.h\"\n#include \"include\/factory.h\"\n\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/--------------------------------Globals-------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nchar *POSTURL;\nchar *PUTURL;\nchar *GETURL;\nchar *DELETEURL;\n\nHttpInterface *http;\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/------------------------------Benchmarks------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nBENCHMARK(HTTP, Get, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n std::string success = http->get(GETURL, 5);\n if (!success.empty())\n {\n \/\/We now have the full response\n logging->error(\"Get Request Failed\");\n }\n else\n {\n logging->debug(\"Retrieved:\");\n logging->debug(write_data);\n }\n\n}\n\nBENCHMARK(HTTP, Put, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n std::string success = http->put(PUTURL, \"123\", 5);\n\n}\n\nBENCHMARK(HTTP, Post, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n std::string success = http->post(POSTURL, \"CLYMAN\", 5);\n\n}\n\nBENCHMARK(HTTP, Delete, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n bool std::string = http->del(DELETEURL, 5);\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/------------------------------Main Method-----------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nint main()\n{\n\n \/\/Variables to store URL's\n std::string post = \"http:\/\/httpbin.org\/post\";\n std::string put = \"http:\/\/httpbin.org\/put\";\n std::string get = \"http:\/\/httpbin.org\/get\";\n std::string del = \"http:\/\/httpbin.org\/delete\";\n\n POSTURL = new char[post.length() + 1];\n PUTURL = new char[put.length() + 1];\n GETURL = new char[get.length() + 1];\n DELETEURL = new char[del.length() + 1];\n\n strcpy(POSTURL, post.c_str());\n strcpy(PUTURL, put.c_str());\n strcpy(GETURL, get.c_str());\n strcpy(DELETEURL, del.c_str());\n\nServiceComponentFactory factory;\n\n\/\/Read the Logging Configuration File\nstd::string initFileName = \"test\/log4cpp_test.properties\";\nlogging = factory.get_logging_interface( initFileName );\n\/\/logging = new Logger(initFileName);\n\n\/\/Set up internal variables\nlogging->info(\"Internal Logging Intialized\");\n\n\/\/Set up UUID Generator\nhttp = factory.get_http_interface();\n\/\/uuid = new uuidAdmin;\nlogging->info(\"HTTP Outbound Interface Created\");\n\n\/\/------------------------------Run Tests-------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nhayai::ConsoleOutputter consoleOutputter;\n\nhayai::Benchmarker::AddOutputter(consoleOutputter);\nhayai::Benchmarker::RunAllTests();\n\n\/\/-------------------------Post-Test Teardown---------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\ndelete http;\ndelete logging;\n\nreturn 0;\n\n}\nCouchbase Updates to bring onto Universal Callback Interface#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"include\/factory\/logging_interface.h\"\n#include \"include\/factory\/http_interface.h\"\n#include \"include\/factory.h\"\n\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/--------------------------------Globals-------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nchar *POSTURL;\nchar *PUTURL;\nchar *GETURL;\nchar *DELETEURL;\n\nHttpInterface *http;\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/------------------------------Benchmarks------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nBENCHMARK(HTTP, Get, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n bool success = http->get(GETURL, 5);\n if (!success)\n {\n \/\/We now have the full response\n logging->error(\"Get Request Failed\");\n }\n else\n {\n logging->debug(\"Retrieved:\");\n logging->debug(write_data);\n }\n\n}\n\nBENCHMARK(HTTP, Put, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n bool success = http->put(PUTURL, \"123\", 5);\n\n}\n\nBENCHMARK(HTTP, Post, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n bool success = http->post(POSTURL, \"CLYMAN\", 5);\n\n}\n\nBENCHMARK(HTTP, Delete, 10, 100)\n{\n\n \/\/Clear the return string\n write_data.clear();\n\n \/\/Send the request\n bool success = http->del(DELETEURL, 5);\n\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/------------------------------Main Method-----------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nint main()\n{\n\n \/\/Variables to store URL's\n std::string post = \"http:\/\/httpbin.org\/post\";\n std::string put = \"http:\/\/httpbin.org\/put\";\n std::string get = \"http:\/\/httpbin.org\/get\";\n std::string del = \"http:\/\/httpbin.org\/delete\";\n\n POSTURL = new char[post.length() + 1];\n PUTURL = new char[put.length() + 1];\n GETURL = new char[get.length() + 1];\n DELETEURL = new char[del.length() + 1];\n\n strcpy(POSTURL, post.c_str());\n strcpy(PUTURL, put.c_str());\n strcpy(GETURL, get.c_str());\n strcpy(DELETEURL, del.c_str());\n\nServiceComponentFactory factory;\n\n\/\/Read the Logging Configuration File\nstd::string initFileName = \"test\/log4cpp_test.properties\";\nlogging = factory.get_logging_interface( initFileName );\n\/\/logging = new Logger(initFileName);\n\n\/\/Set up internal variables\nlogging->info(\"Internal Logging Intialized\");\n\n\/\/Set up UUID Generator\nhttp = factory.get_http_interface();\n\/\/uuid = new uuidAdmin;\nlogging->info(\"HTTP Outbound Interface Created\");\n\n\/\/------------------------------Run Tests-------------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\nhayai::ConsoleOutputter consoleOutputter;\n\nhayai::Benchmarker::AddOutputter(consoleOutputter);\nhayai::Benchmarker::RunAllTests();\n\n\/\/-------------------------Post-Test Teardown---------------------------------\/\/\n\/\/----------------------------------------------------------------------------\/\/\n\ndelete http;\ndelete logging;\n\nreturn 0;\n\n}\n<|endoftext|>"} {"text":"\/*\n * Copyright (c) 2016 The ZLMediaKit project authors. All Rights Reserved.\n *\n * This file is part of ZLMediaKit(https:\/\/github.com\/xiongziliang\/ZLMediaKit).\n *\n * Use of this source code is governed by MIT license that can be found in the\n * LICENSE file in the root of the source tree. All contributing project authors\n * may be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#if defined(ENABLE_RTPPROXY)\n#include \"RtpSession.h\"\n#include \"RtpSelector.h\"\n#include \"Network\/TcpServer.h\"\nnamespace mediakit{\n\nconst string RtpSession::kStreamID = \"stream_id\";\n\nvoid RtpSession::attachServer(const TcpServer &server) {\n _stream_id = const_cast(server)[kStreamID];\n}\n\nRtpSession::RtpSession(const Socket::Ptr &sock) : TcpSession(sock) {\n DebugP(this);\n socklen_t addr_len = sizeof(addr);\n getpeername(sock->rawFD(), &addr, &addr_len);\n}\nRtpSession::~RtpSession() {\n DebugP(this);\n if(_process){\n RtpSelector::Instance().delProcess(_stream_id,_process.get());\n }\n}\n\nvoid RtpSession::onRecv(const Buffer::Ptr &data) {\n try {\n RtpSplitter::input(data->data(), data->size());\n } catch (SockException &ex) {\n shutdown(ex);\n } catch (std::exception &ex) {\n shutdown(SockException(Err_other, ex.what()));\n }\n}\n\nvoid RtpSession::onError(const SockException &err) {\n WarnL << _stream_id << \" \" << err.what();\n}\n\nvoid RtpSession::onManager() {\n if(_process && !_process->alive()){\n shutdown(SockException(Err_timeout, \"receive rtp timeout\"));\n }\n\n if(!_process && _ticker.createdTime() > 10 * 1000){\n shutdown(SockException(Err_timeout, \"illegal connection\"));\n }\n}\n\nvoid RtpSession::onRtpPacket(const char *data, uint64_t len) {\n if (!_process) {\n uint32_t ssrc;\n if (!RtpSelector::getSSRC(data, len, ssrc)) {\n return;\n }\n if (_stream_id.empty()) {\n \/\/未指定流id就使用ssrc为流id\n _stream_id = printSSRC(ssrc);\n }\n \/\/tcp情况下，一个tcp链接只可能是一路流，不需要通过多个ssrc来区分，所以不需要频繁getProcess\n _process = RtpSelector::Instance().getProcess(_stream_id, true);\n _process->setListener(dynamic_pointer_cast(shared_from_this()));\n }\n _process->inputRtp(getSock(), data, len, &addr);\n _ticker.resetTime();\n}\n\nbool RtpSession::close(MediaSource &sender, bool force) {\n \/\/此回调在其他线程触发\n if(!_process || (!force && _process->totalReaderCount())){\n return false;\n }\n string err = StrPrinter << \"close media:\" << sender.getSchema() << \"\/\" << sender.getVhost() << \"\/\" << sender.getApp() << \"\/\" << sender.getId() << \" \" << force;\n safeShutdown(SockException(Err_shutdown,err));\n return true;\n}\n\nint RtpSession::totalReaderCount(MediaSource &sender) {\n \/\/此回调在其他线程触发\n return _process ? _process->totalReaderCount() : sender.totalReaderCount();\n}\n\n}\/\/namespace mediakit\n#endif\/\/defined(ENABLE_RTPPROXY)tcp情况下，rtp长度不得超过2K，防止发送端存在缓存覆盖的bug\/*\n * Copyright (c) 2016 The ZLMediaKit project authors. All Rights Reserved.\n *\n * This file is part of ZLMediaKit(https:\/\/github.com\/xiongziliang\/ZLMediaKit).\n *\n * Use of this source code is governed by MIT license that can be found in the\n * LICENSE file in the root of the source tree. All contributing project authors\n * may be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#if defined(ENABLE_RTPPROXY)\n#include \"RtpSession.h\"\n#include \"RtpSelector.h\"\n#include \"Network\/TcpServer.h\"\nnamespace mediakit{\n\nconst string RtpSession::kStreamID = \"stream_id\";\n\nvoid RtpSession::attachServer(const TcpServer &server) {\n _stream_id = const_cast(server)[kStreamID];\n}\n\nRtpSession::RtpSession(const Socket::Ptr &sock) : TcpSession(sock) {\n DebugP(this);\n socklen_t addr_len = sizeof(addr);\n getpeername(sock->rawFD(), &addr, &addr_len);\n}\nRtpSession::~RtpSession() {\n DebugP(this);\n if(_process){\n RtpSelector::Instance().delProcess(_stream_id,_process.get());\n }\n}\n\nvoid RtpSession::onRecv(const Buffer::Ptr &data) {\n try {\n RtpSplitter::input(data->data(), data->size());\n } catch (SockException &ex) {\n shutdown(ex);\n } catch (std::exception &ex) {\n shutdown(SockException(Err_other, ex.what()));\n }\n}\n\nvoid RtpSession::onError(const SockException &err) {\n WarnL << _stream_id << \" \" << err.what();\n}\n\nvoid RtpSession::onManager() {\n if(_process && !_process->alive()){\n shutdown(SockException(Err_timeout, \"receive rtp timeout\"));\n }\n\n if(!_process && _ticker.createdTime() > 10 * 1000){\n shutdown(SockException(Err_timeout, \"illegal connection\"));\n }\n}\n\nvoid RtpSession::onRtpPacket(const char *data, uint64_t len) {\n if (len > 1024 * 2) {\n throw SockException(Err_shutdown, \"rtp包长度异常，发送端可能缓存溢出并覆盖\");\n }\n if (!_process) {\n uint32_t ssrc;\n if (!RtpSelector::getSSRC(data, len, ssrc)) {\n return;\n }\n if (_stream_id.empty()) {\n \/\/未指定流id就使用ssrc为流id\n _stream_id = printSSRC(ssrc);\n }\n \/\/tcp情况下，一个tcp链接只可能是一路流，不需要通过多个ssrc来区分，所以不需要频繁getProcess\n _process = RtpSelector::Instance().getProcess(_stream_id, true);\n _process->setListener(dynamic_pointer_cast(shared_from_this()));\n }\n _process->inputRtp(getSock(), data, len, &addr);\n _ticker.resetTime();\n}\n\nbool RtpSession::close(MediaSource &sender, bool force) {\n \/\/此回调在其他线程触发\n if(!_process || (!force && _process->totalReaderCount())){\n return false;\n }\n string err = StrPrinter << \"close media:\" << sender.getSchema() << \"\/\" << sender.getVhost() << \"\/\" << sender.getApp() << \"\/\" << sender.getId() << \" \" << force;\n safeShutdown(SockException(Err_shutdown,err));\n return true;\n}\n\nint RtpSession::totalReaderCount(MediaSource &sender) {\n \/\/此回调在其他线程触发\n return _process ? _process->totalReaderCount() : sender.totalReaderCount();\n}\n\n}\/\/namespace mediakit\n#endif\/\/defined(ENABLE_RTPPROXY)<|endoftext|>"} {"text":"#ifndef SIMPLEHASHCACHE_HH\n#define SIMPLEHASHCACHE_HH\n\n#define HASH_SIZE_MULTIPLIER 1.3\n\ntemplate \nclass SimpleHashCache {\npublic:\n SimpleHashCache(void);\n inline bool insert(int key, T item, T *removed);\n inline bool find(int key, T *result);\n void set_max_items(int max);\n int get_num_items(void) { return num_items; }\n bool remove_last_item(T *removed);\n\nprivate:\n void rehash(int new_max);\n inline int get_hash_index(int key) { return (key%hash_table_size); }\n \n class StoreType {\n public:\n T value;\n int key;\n };\n std::vector< StoreType > *hash_table;\n\n int hash_table_size;\n int num_items;\n};\n\ntemplate\nSimpleHashCache::SimpleHashCache(void)\n{\n hash_table = NULL;\n hash_table_size = num_items = 0;\n}\n\ntemplate\nvoid\nSimpleHashCache::rehash(int new_max)\n{\n std::vector< StoreType > *new_hash_table = new std::vector< StoreType >;\n int new_size = (int)(HASH_SIZE_MULTIPLIER*new_max);\n new_hash_table->resize(new_size);\n for (int i = 0; i < new_size; i++)\n (*new_hash_table)[i].key = -1;\n if (hash_table != NULL)\n {\n \/\/ Copy at most new_max items\n \/\/ FIXME: Missing! We just delete the old hash.\n delete hash_table;\n }\n hash_table = new_hash_table;\n hash_table_size = new_size;\n num_items = 0;\n}\n\n\/\/ Returns true if an item is removed, in which case the removed item is\n\/\/ stored to variable *removed (if it is != NULL).\ntemplate\nbool\nSimpleHashCache::insert(int key, T item, T *removed)\n{\n int index = get_hash_index(key);\n bool rm = false;\n \n if ((*hash_table)[index].key != -1)\n {\n \/\/ Remove the item\n if (removed != NULL)\n *removed = (*hash_table)[index].value;\n rm = true;\n }\n else\n num_items++;\n (*hash_table)[index].value = item;\n (*hash_table)[index].key = key;\n return rm;\n}\n\ntemplate\nbool\nSimpleHashCache::remove_last_item(T *removed)\n{\n for (int i = 0; i < hash_table_size; i++)\n {\n if ((*hash_table)[i].key != -1)\n {\n if (removed != NULL)\n *removed = (*hash_table)[i].value;\n (*hash_table)[i].key = -1;\n num_items--;\n return true;\n }\n }\n return false;\n}\n\ntemplate\nbool\nSimpleHashCache::find(int key, T *result)\n{\n int index = get_hash_index(key);\n if ((*hash_table)[index].key != key)\n return false;\n\n *result = (*hash_table)[index].value;\n return true;\n}\n\n\ntemplate\nvoid\nSimpleHashCache::set_max_items(int max)\n{\n rehash(max);\n}\n\n\n#endif \/\/ SIMPLEHASHCACHE_HH\nget_hash_index() throws an exception instead of FPE signal if the hash table is empty.#ifndef SIMPLEHASHCACHE_HH\n#define SIMPLEHASHCACHE_HH\n\n#include \n\n#define HASH_SIZE_MULTIPLIER 1.3\n\ntemplate\nclass SimpleHashCache\n{\npublic:\n\tSimpleHashCache();\n\tinline bool insert(int key, T item, T *removed);\n\tinline bool find(int key, T *result);\n\tvoid set_max_items(int max);\n\tint get_num_items(void)\n\t{\n\t\treturn num_items;\n\t}\n\tbool remove_last_item(T *removed);\n\nprivate:\n\tvoid rehash(int new_max);\n\tint get_hash_index(int key);\n\n\tclass StoreType\n\t{\n\tpublic:\n\t\tT value;\n\t\tint key;\n\t};\n\tstd::vector hash_table;\n\n\tint num_items;\n};\n\ntemplate\nSimpleHashCache::SimpleHashCache()\n{\n\tnum_items = 0;\n}\n\ntemplate\nvoid SimpleHashCache::rehash(int new_max)\n{\n\tint new_size = (int) (HASH_SIZE_MULTIPLIER * new_max);\n\thash_table.resize(new_size);\n\tfor (int i = 0; i < new_size; i++)\n\t\thash_table[i].key = -1;\n\tnum_items = 0;\n}\n\ntemplate\ninline int SimpleHashCache::get_hash_index(int key)\n{\n\tif (hash_table.empty())\n\t\tthrow std::runtime_error(\"SimpleHashCache::get_hash_index\");\n\treturn key % hash_table.size();\n}\n\n\/\/ Returns true if an item is removed, in which case the removed item is\n\/\/ stored to variable *removed (if it is != NULL).\ntemplate\nbool SimpleHashCache::insert(int key, T item, T *removed)\n{\n\tint index = get_hash_index(key);\n\tbool rm = false;\n\n\tif (hash_table[index].key != -1) {\n\t\t\/\/ Remove the item\n\t\tif (removed != NULL)\n\t\t\t*removed = hash_table[index].value;\n\t\trm = true;\n\t}\n\telse\n\t\tnum_items++;\n\thash_table[index].value = item;\n\thash_table[index].key = key;\n\treturn rm;\n}\n\ntemplate\nbool SimpleHashCache::remove_last_item(T *removed)\n{\n\tfor (int i = 0; i < hash_table.size(); i++) {\n\t\tif (hash_table[i].key != -1) {\n\t\t\tif (removed != NULL)\n\t\t\t\t*removed = hash_table[i].value;\n\t\t\thash_table[i].key = -1;\n\t\t\tnum_items--;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\ntemplate\nbool SimpleHashCache::find(int key, T *result)\n{\n\tint index = get_hash_index(key);\n\tif (hash_table[index].key != key)\n\t\treturn false;\n\n\t*result = hash_table[index].value;\n\treturn true;\n}\n\ntemplate\nvoid SimpleHashCache::set_max_items(int max)\n{\n\trehash(max);\n}\n\n#endif \/\/ SIMPLEHASHCACHE_HH\n<|endoftext|>"} {"text":"\/\/ =============================================================================\n\/\/ Description: Provides an interface for the robot's arm\n\/\/ Author: FRC Team 3512, Spartatroniks\n\/\/ =============================================================================\n\n#include \"Arm.hpp\"\n#include \"..\/MotionProfile\/TrapezoidProfile.hpp\"\n#include \"..\/WPILib\/PIDController.hpp\"\n\nArm::Arm() {\n m_leftArmPID = std::make_shared(0.f, 0.f, 0.f, 0.f, 0.f,\n &m_leftArmActuator,\n &m_leftArmActuator);\n m_leftArmProfile = std::make_shared(m_leftArmPID,\n 0.0, 0.0);\n\n m_rightArmPID = std::make_shared(0.f, 0.f, 0.f, 0.f, 0.f,\n &m_rightArmActuator,\n &m_rightArmActuator);\n m_rightArmProfile = std::make_shared(m_rightArmPID,\n 0.0, 0.0);\n\n\n m_leftArmHeightProfile = std::make_shared(\n m_leftArmPID, 0.0, 0.0);\n\n\n m_rightArmHeightProfile = std::make_shared(\n m_rightArmPID, 0.0, 0.0)\n}\n\n\n\nvoid Arm::SetManualArmHeight(double height) {\n m_leftArmActuator.Set(height);\n}\n\nvoid Arm::SetManualCarriagePosition(double position) {\n m_carriagePositionMotor.Set(position);\n}\n\nvoid Arm::SetPIDArmHeight(double height) {\n}\n\nvoid Arm::ReloadPID() {\n}\n\nvoid Arm::ResetEncoders() {\n}\n\nvoid Arm::UpdateState() {\n}\nAdded semicolon to Arm\/\/ =============================================================================\n\/\/ Description: Provides an interface for the robot's arm\n\/\/ Author: FRC Team 3512, Spartatroniks\n\/\/ =============================================================================\n\n#include \"Arm.hpp\"\n#include \"..\/MotionProfile\/TrapezoidProfile.hpp\"\n#include \"..\/WPILib\/PIDController.hpp\"\n\nArm::Arm() {\n m_leftArmPID = std::make_shared(0.f, 0.f, 0.f, 0.f, 0.f,\n &m_leftArmActuator,\n &m_leftArmActuator);\n m_leftArmProfile = std::make_shared(m_leftArmPID,\n 0.0, 0.0);\n\n m_rightArmPID = std::make_shared(0.f, 0.f, 0.f, 0.f, 0.f,\n &m_rightArmActuator,\n &m_rightArmActuator);\n m_rightArmProfile = std::make_shared(m_rightArmPID,\n 0.0, 0.0);\n\n\n m_leftArmHeightProfile = std::make_shared(\n m_leftArmPID, 0.0, 0.0);\n\n\n m_rightArmHeightProfile = std::make_shared(\n m_rightArmPID, 0.0, 0.0);\n}\n\n\n\nvoid Arm::SetManualArmHeight(double height) {\n m_leftArmActuator.Set(height);\n}\n\nvoid Arm::SetManualCarriagePosition(double position) {\n m_carriagePositionMotor.Set(position);\n}\n\nvoid Arm::SetPIDArmHeight(double height) {\n}\n\nvoid Arm::ReloadPID() {\n}\n\nvoid Arm::ResetEncoders() {\n}\n\nvoid Arm::UpdateState() {\n}\n<|endoftext|>"} {"text":"#include \"stdafx.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\nusing namespace Annwvyn;\n\nAnnEngine* AnnEngine::singleton(NULL);\nstd::shared_ptr AnnEngine::onScreenConsole(nullptr);\n\nAnnEngine* AnnEngine::Instance()\n{\n\treturn singleton;\n}\n\nstd::string AnnEngine::getAnnwvynVersion()\n{\n\tstd::stringstream version;\n\tversion << ANN_MAJOR << \".\" << ANN_MINOR << \".\" << ANN_PATCH;\n\tif (ANN_EXPERIMENTAL)\n\t\tversion << \"-experimental\";\n\treturn version.str();\n}\n\nvoid AnnEngine::startGameplayLoop()\n{\n\twhile (refresh());\n}\n\nAnnEngine::AnnEngine(const char title[], std::string hmdCommand) :\n\tplayer(nullptr),\n\taudioEngine(nullptr),\n\teventManager(nullptr),\n\tlevelManager(nullptr),\n\tfilesystemManager(nullptr),\n\tresourceManager(nullptr),\n\tgameObjectManager(nullptr),\n\tsceneryManager(nullptr),\n\trenderer(nullptr),\n\tpovNode(nullptr),\n\tupdateTime(-1),\n\tcanAccessSubSystems(true)\n{\n\n\tif (singleton)\n\t{\n\t\tlog(\"Can't create 2 instances of the engine!\");\n\t\texit(ANN_ERR_MEMORY);\n\t}\n\n\tstd::cerr << \"HMD selection from command line routine retuned : \" << hmdCommand << std::endl;\n\n\t\/\/Launching initialisation routines : \n\tif (hmdCommand == \"OgreOculusRender\"\n\t\t|| hmdCommand == \"OgreDefaultRender\")\n\t{\n\t\trenderer = std::make_shared(title);\n\t}\n\t\/\/\/else if vive\n\telse if (hmdCommand == \"OgreOpenVRRender\")\n\t{\n\t\t\/*MessageBox(NULL,\n\t\t\t\t L\"The Vive rendering is not implemented yet.\\n\"\n\t\t\t\t L\"Sorry for that. ^^\\\"\",\n\t\t\t\t L\"Error: Vive not implemented. Yet ;-)\",\n\t\t\t\t MB_ICONERROR);\n\t\texit(ANN_ERR_CANTHMD);*\/\n\t\trenderer = std::make_shared(title);\n\t}\n\t\/\/\/else if osvr\n\t\/\/\/else if ...\n\telse\n\t{\n\t\tMessageBox(NULL,\n\t\t\t\t L\"This program can be used with multiple VR solution.\\n\"\n\t\t\t\t L\"The executable should be launched from the intended launcher.\\n\"\n\t\t\t\t L\"If you're trying to launch it by hand, please check if your command line parameter is correct!\\n\\n\"\n\t\t\t\t L\"Available command line parameter : \\n\\t-oculus\\n\"\n\t\t\t\t L\"\\t-vive\\n\",\n\t\t\t\t L\"Error: Cannot understand what HMD you want to use!\",\n\t\t\t\t MB_ICONERROR);\n\t\texit(ANN_ERR_CANTHMD);\n\t}\n\n\trenderer->initOgreRoot(\"Annwvyn.log\");\n\n\n\tsrand(time(nullptr));\n\tsingleton = this;\n\n\tplayer = std::make_shared< AnnPlayer>();\n\trenderer->initVrHmd();\n\trenderer->initPipeline();\n\tSceneManager = renderer->getSceneManager();\n\n\trenderer->showDebug(OgreVRRender::DebugMode::MONOSCOPIC);\n\n\tlog(\"Setup Annwvyn's subsystems\");\n\n\t\/\/Element on this list will be updated in order by the engine each frame\n\tSubSystemList.push_back(levelManager = std::make_shared());\n\tSubSystemList.push_back(gameObjectManager = std::make_shared());\n\n\t\/\/Physics engine needs to be declared before the event manager. But we want the physics engine to be updated after the event manager.\n\n\n\t\/*The wanted order is \n\t- event happens (player input, timers...)\n\t- physics is ticked (stuff move)\n\t- audio is synced (sonds comes form where they should)\n\t- then the game can redraw*\/\n\n\tphysicsEngine = std::make_shared(getSceneManager()->getRootSceneNode(), player, gameObjectManager->Objects, gameObjectManager->Triggers);\n\tSubSystemList.push_back(eventManager = std::make_shared< AnnEventManager>(renderer->getWindow()));\n\tSubSystemList.push_back(physicsEngine);\n\tSubSystemList.push_back(audioEngine = std::make_shared< AnnAudioEngine>());\n\n\t\n\t\/\/These could be anywere\n\tSubSystemList.push_back(filesystemManager = std::make_shared(title));\n\tSubSystemList.push_back(resourceManager = std::make_shared());\n\tSubSystemList.push_back(sceneryManager = std::make_shared(renderer));\n\n\n\trenderer->initClientHmdRendering();\n\tpovNode = renderer->getCameraInformationNode();\n\tpovNode->setPosition(player->getPosition() +\n\t\tAnnVect3(0.0f, player->getEyesHeight(), 0.0f));\n\n\t\/\/This subsystem need the povNode object to be initialized. And the Resource manager because it wants a font file and an image background \n\tSubSystemList.push_back(onScreenConsole = std::make_shared());\n\n\tlog(\"===================================================\", false);\n\tlog(\"Annwvyn Game Engine - Step into the Other World \", false);\n\tlog(\"Free\/Libre Game Engine designed for Virtual Reality\", false);\n\tlog(\"Version : \" + getAnnwvynVersion(), false);\n\tlog(\"===================================================\", false);\n}\n\nAnnEngine::~AnnEngine()\n{\n\t\/\/Some cute log messsages\n\tlog(\"Game engine stopped. Subsystem are shutting down...\");\n\tlog(\"Good luck with the real world now! :3\");\n}\n\n\/\/All theses getter are for encapsulation purpose. Calling them directly would make verry long lines of code. Note that there's a whole bunch of macro in AnnEngine.hpp to help with that\nstd::shared_ptr AnnEngine::getEventManager()\n{\n\treturn eventManager;\n}\n\nstd::shared_ptr AnnEngine::getResourceManager()\n{\n\treturn resourceManager;\n}\n\nstd::shared_ptr AnnEngine::getGameObjectManager()\n{\n\treturn gameObjectManager;\n}\n\nstd::shared_ptr AnnEngine::getSceneryManager()\n{\n\treturn sceneryManager;\n}\n\nstd::shared_ptr AnnEngine::getVRRenderer()\n{\n\treturn renderer;\n}\n\nstd::shared_ptr AnnEngine::getLevelManager()\n{\n\treturn levelManager;\n}\n\nstd::shared_ptr AnnEngine::getPlayer()\n{\n\treturn player;\n}\n\nstd::shared_ptr AnnEngine::getFileSystemManager()\n{\n\treturn filesystemManager;\n}\n\n\nstd::shared_ptr AnnEngine::getAudioEngine()\n{\n\treturn audioEngine;\n}\n\nstd::shared_ptr AnnEngine::getPhysicsEngine()\n{\n\treturn physicsEngine;\n}\n\n\/\/This is static, but actually needs Ogre to be running. So be carefull\nvoid AnnEngine::log(std::string message, bool flag)\n{\n\tOgre::String messageForLog;\n\n\tif (flag)\n\t{\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\t\tmessageForLog += \"Annwvyn - \";\n\t}\n\telse\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n\n\tmessageForLog += message;\n\tOgre::LogManager::getSingleton().logMessage(messageForLog);\n\tif (onScreenConsole != nullptr)\n\t\tonScreenConsole->append(message);\n\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n}\n\n\/\/Don't ask me why this is not part of the Physics engine. Actually it just calls something on the physics engine. Will be probably deleted in the future.\nvoid AnnEngine::initPlayerPhysics()\n{\n\tphysicsEngine->initPlayerPhysics(povNode);\n}\n\n\/\/Need to be redone. \nbool AnnEngine::requestStop()\n{\n\t\/\/pres ESC to quit. Stupid but efficient. I like that.\n\tif (isKeyDown(OIS::KC_ESCAPE))\n\t\treturn true;\n\t\/\/If the user quit the App from the Oculus Home\n\tif (renderer->shouldQuit())\n\t\treturn true;\n\treturn false;\n}\n\n\/\/This is the most important function of the whole project. It's the heartbeat of the game or app using this engine.\nbool AnnEngine::refresh()\n{\n\t\/\/Get the rendering delta time (should be roughly equals to 1\/desiredFramerate in seconds)\n\tupdateTime = renderer->getUpdateTime();\n\tplayer->engineUpdate(getFrameTime());\n\n\tfor (auto SubSystem : SubSystemList) \n\t\tif (!SubSystem->needUpdate()) continue; \/\/If doen't need update, swith to the next\n\t\telse SubSystem->update();\t\t\t\t\/\/The \"else\" keyword is used to not put curly braces, by lazyness and by code style.\n\n\t\/\/Update camera from player\n\tsyncPov();\n\n\t\/\/Update VR form real world\n\trenderer->updateTracking();\n\n\t\/\/Update view\n\trenderer->renderAndSubmitFrame();\n\n\t\/\/Don't laugh\n\treturn !requestStop();\n}\n\n\/\/This just move a node where the other node is. Yes I know about parenting. I had reasons to do it that way, but I forgot. \ninline void AnnEngine::syncPov()\n{\n\tpovNode->setPosition(player->getPosition());\n\tpovNode->setOrientation(player->getOrientation().toQuaternion());\n}\n\n\/\/Bad. Don't use. Register an event listener and use the KeyEvent callback. \ninline bool AnnEngine::isKeyDown(OIS::KeyCode key)\n{\n\tif (!eventManager) return false;\n\treturn eventManager->Keyboard->isKeyDown(key);\n}\n\nOgre::SceneNode* AnnEngine::getCamera()\n{\n\treturn povNode;\n}\n\n\nOgre::SceneManager* AnnEngine::getSceneManager()\n{\n\treturn SceneManager;\n}\n\nunsigned long AnnEngine::getTimeFromStartUp()\n{\n\treturn renderer->getTimer()->getMilliseconds();\n}\n\ndouble AnnEngine::getTimeFromStartupSeconds()\n{\n\treturn static_cast(getTimeFromStartUp()) \/ 1000.0;\n}\n\n\/\/the delta time of the last frame, not the current one\ndouble AnnEngine::getFrameTime()\n{\n\treturn updateTime;\n}\n\n\/\/Raw position and orientaiton of the head in world space. This is usefull if you want to mess around with weird stuff. This has been bodged when I integrated a LEAP motion in that mess. \nOgrePose AnnEngine::getHmdPose()\n{\n\tif (renderer)\n\t\treturn renderer->returnPose;\n\treturn OgrePose();\n}\n\n\/\/Because Windows and the Win32 platform sucks. \nvoid AnnEngine::openConsole()\n{\n#ifdef _WIN32\n\n\t\/\/Allocate a console for this app\n\tif (AllocConsole())\n\t{\n\t\t\/\/put stdout on this console;\n#pragma warning(disable:4996) \/\/Okay, so for some reason, freopen is \"bad\" because potentially dangerous. However, since I'm passing static strings here, unless you go hack the DLL, I don't know what harm you can do.\n\t\tfreopen(\"CONOUT$\", \"w\", stdout); \n#pragma warning(default:4996)\n\t}\n\n\t\/\/Redirect cerr to cout\n\tstd::cerr.rdbuf(std::cout.rdbuf());\n\n\tSetConsoleTitle(L\"Annwyn Debug Console\");\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\n#endif\n}\n\n\/\/Well, I may make the pointer to the onScreenConsole more accessible. \nvoid AnnEngine::toogleOnScreenConsole()\n{\n\tif (onScreenConsole) onScreenConsole->toogle();\n}\n\nbool AnnEngine::appVisibleInHMD()\n{\n\tif (renderer->isVisibleInHmd() == true) \/\/ why \"== true\" ? Because at some point it was returning an ovrBool, wich is the boolean type of the oculus SDK that doesn't cast correctly to a C++ bool. YES. I DON'T KNOW HOW THEY MANAGED TO FFFF TAHT UP. \n\t\treturn true;\n\treturn false;\n}\ncorrect error in command line message#include \"stdafx.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\nusing namespace Annwvyn;\n\nAnnEngine* AnnEngine::singleton(NULL);\nstd::shared_ptr AnnEngine::onScreenConsole(nullptr);\n\nAnnEngine* AnnEngine::Instance()\n{\n\treturn singleton;\n}\n\nstd::string AnnEngine::getAnnwvynVersion()\n{\n\tstd::stringstream version;\n\tversion << ANN_MAJOR << \".\" << ANN_MINOR << \".\" << ANN_PATCH;\n\tif (ANN_EXPERIMENTAL)\n\t\tversion << \"-experimental\";\n\treturn version.str();\n}\n\nvoid AnnEngine::startGameplayLoop()\n{\n\twhile (refresh());\n}\n\nAnnEngine::AnnEngine(const char title[], std::string hmdCommand) :\n\tplayer(nullptr),\n\taudioEngine(nullptr),\n\teventManager(nullptr),\n\tlevelManager(nullptr),\n\tfilesystemManager(nullptr),\n\tresourceManager(nullptr),\n\tgameObjectManager(nullptr),\n\tsceneryManager(nullptr),\n\trenderer(nullptr),\n\tpovNode(nullptr),\n\tupdateTime(-1),\n\tcanAccessSubSystems(true)\n{\n\n\tif (singleton)\n\t{\n\t\tlog(\"Can't create 2 instances of the engine!\");\n\t\texit(ANN_ERR_MEMORY);\n\t}\n\n\tstd::cerr << \"HMD selection from command line routine retuned : \" << hmdCommand << std::endl;\n\n\t\/\/Launching initialisation routines : \n\tif (hmdCommand == \"OgreOculusRender\"\n\t\t|| hmdCommand == \"OgreDefaultRender\")\n\t{\n\t\trenderer = std::make_shared(title);\n\t}\n\t\/\/\/else if vive\n\telse if (hmdCommand == \"OgreOpenVRRender\")\n\t{\n\t\t\/*MessageBox(NULL,\n\t\t\t\t L\"The Vive rendering is not implemented yet.\\n\"\n\t\t\t\t L\"Sorry for that. ^^\\\"\",\n\t\t\t\t L\"Error: Vive not implemented. Yet ;-)\",\n\t\t\t\t MB_ICONERROR);\n\t\texit(ANN_ERR_CANTHMD);*\/\n\t\trenderer = std::make_shared(title);\n\t}\n\t\/\/\/else if osvr\n\t\/\/\/else if ...\n\telse\n\t{\n\t\tMessageBox(NULL,\n\t\t\t\t L\"This program can be used with multiple VR solution.\\n\"\n\t\t\t\t L\"The executable should be launched from the intended launcher.\\n\"\n\t\t\t\t L\"If you're trying to launch it by hand, please check if your command line parameter is correct!\\n\\n\"\n\t\t\t\t L\"Available command line parameter : \\n\\t-rift\\n\"\n\t\t\t\t L\"\\t-vive\\n\",\n\t\t\t\t L\"Error: Cannot understand what HMD you want to use!\",\n\t\t\t\t MB_ICONERROR);\n\t\texit(ANN_ERR_CANTHMD);\n\t}\n\n\trenderer->initOgreRoot(\"Annwvyn.log\");\n\n\n\tsrand(time(nullptr));\n\tsingleton = this;\n\n\tplayer = std::make_shared< AnnPlayer>();\n\trenderer->initVrHmd();\n\trenderer->initPipeline();\n\tSceneManager = renderer->getSceneManager();\n\n\trenderer->showDebug(OgreVRRender::DebugMode::MONOSCOPIC);\n\n\tlog(\"Setup Annwvyn's subsystems\");\n\n\t\/\/Element on this list will be updated in order by the engine each frame\n\tSubSystemList.push_back(levelManager = std::make_shared());\n\tSubSystemList.push_back(gameObjectManager = std::make_shared());\n\n\t\/\/Physics engine needs to be declared before the event manager. But we want the physics engine to be updated after the event manager.\n\n\n\t\/*The wanted order is \n\t- event happens (player input, timers...)\n\t- physics is ticked (stuff move)\n\t- audio is synced (sonds comes form where they should)\n\t- then the game can redraw*\/\n\n\tphysicsEngine = std::make_shared(getSceneManager()->getRootSceneNode(), player, gameObjectManager->Objects, gameObjectManager->Triggers);\n\tSubSystemList.push_back(eventManager = std::make_shared< AnnEventManager>(renderer->getWindow()));\n\tSubSystemList.push_back(physicsEngine);\n\tSubSystemList.push_back(audioEngine = std::make_shared< AnnAudioEngine>());\n\n\t\n\t\/\/These could be anywere\n\tSubSystemList.push_back(filesystemManager = std::make_shared(title));\n\tSubSystemList.push_back(resourceManager = std::make_shared());\n\tSubSystemList.push_back(sceneryManager = std::make_shared(renderer));\n\n\n\trenderer->initClientHmdRendering();\n\tpovNode = renderer->getCameraInformationNode();\n\tpovNode->setPosition(player->getPosition() +\n\t\tAnnVect3(0.0f, player->getEyesHeight(), 0.0f));\n\n\t\/\/This subsystem need the povNode object to be initialized. And the Resource manager because it wants a font file and an image background \n\tSubSystemList.push_back(onScreenConsole = std::make_shared());\n\n\tlog(\"===================================================\", false);\n\tlog(\"Annwvyn Game Engine - Step into the Other World \", false);\n\tlog(\"Free\/Libre Game Engine designed for Virtual Reality\", false);\n\tlog(\"Version : \" + getAnnwvynVersion(), false);\n\tlog(\"===================================================\", false);\n}\n\nAnnEngine::~AnnEngine()\n{\n\t\/\/Some cute log messsages\n\tlog(\"Game engine stopped. Subsystem are shutting down...\");\n\tlog(\"Good luck with the real world now! :3\");\n}\n\n\/\/All theses getter are for encapsulation purpose. Calling them directly would make verry long lines of code. Note that there's a whole bunch of macro in AnnEngine.hpp to help with that\nstd::shared_ptr AnnEngine::getEventManager()\n{\n\treturn eventManager;\n}\n\nstd::shared_ptr AnnEngine::getResourceManager()\n{\n\treturn resourceManager;\n}\n\nstd::shared_ptr AnnEngine::getGameObjectManager()\n{\n\treturn gameObjectManager;\n}\n\nstd::shared_ptr AnnEngine::getSceneryManager()\n{\n\treturn sceneryManager;\n}\n\nstd::shared_ptr AnnEngine::getVRRenderer()\n{\n\treturn renderer;\n}\n\nstd::shared_ptr AnnEngine::getLevelManager()\n{\n\treturn levelManager;\n}\n\nstd::shared_ptr AnnEngine::getPlayer()\n{\n\treturn player;\n}\n\nstd::shared_ptr AnnEngine::getFileSystemManager()\n{\n\treturn filesystemManager;\n}\n\n\nstd::shared_ptr AnnEngine::getAudioEngine()\n{\n\treturn audioEngine;\n}\n\nstd::shared_ptr AnnEngine::getPhysicsEngine()\n{\n\treturn physicsEngine;\n}\n\n\/\/This is static, but actually needs Ogre to be running. So be carefull\nvoid AnnEngine::log(std::string message, bool flag)\n{\n\tOgre::String messageForLog;\n\n\tif (flag)\n\t{\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\t\tmessageForLog += \"Annwvyn - \";\n\t}\n\telse\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n\n\tmessageForLog += message;\n\tOgre::LogManager::getSingleton().logMessage(messageForLog);\n\tif (onScreenConsole != nullptr)\n\t\tonScreenConsole->append(message);\n\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n}\n\n\/\/Don't ask me why this is not part of the Physics engine. Actually it just calls something on the physics engine. Will be probably deleted in the future.\nvoid AnnEngine::initPlayerPhysics()\n{\n\tphysicsEngine->initPlayerPhysics(povNode);\n}\n\n\/\/Need to be redone. \nbool AnnEngine::requestStop()\n{\n\t\/\/pres ESC to quit. Stupid but efficient. I like that.\n\tif (isKeyDown(OIS::KC_ESCAPE))\n\t\treturn true;\n\t\/\/If the user quit the App from the Oculus Home\n\tif (renderer->shouldQuit())\n\t\treturn true;\n\treturn false;\n}\n\n\/\/This is the most important function of the whole project. It's the heartbeat of the game or app using this engine.\nbool AnnEngine::refresh()\n{\n\t\/\/Get the rendering delta time (should be roughly equals to 1\/desiredFramerate in seconds)\n\tupdateTime = renderer->getUpdateTime();\n\tplayer->engineUpdate(getFrameTime());\n\n\tfor (auto SubSystem : SubSystemList) \n\t\tif (!SubSystem->needUpdate()) continue; \/\/If doen't need update, swith to the next\n\t\telse SubSystem->update();\t\t\t\t\/\/The \"else\" keyword is used to not put curly braces, by lazyness and by code style.\n\n\t\/\/Update camera from player\n\tsyncPov();\n\n\t\/\/Update VR form real world\n\trenderer->updateTracking();\n\n\t\/\/Update view\n\trenderer->renderAndSubmitFrame();\n\n\t\/\/Don't laugh\n\treturn !requestStop();\n}\n\n\/\/This just move a node where the other node is. Yes I know about parenting. I had reasons to do it that way, but I forgot. \ninline void AnnEngine::syncPov()\n{\n\tpovNode->setPosition(player->getPosition());\n\tpovNode->setOrientation(player->getOrientation().toQuaternion());\n}\n\n\/\/Bad. Don't use. Register an event listener and use the KeyEvent callback. \ninline bool AnnEngine::isKeyDown(OIS::KeyCode key)\n{\n\tif (!eventManager) return false;\n\treturn eventManager->Keyboard->isKeyDown(key);\n}\n\nOgre::SceneNode* AnnEngine::getCamera()\n{\n\treturn povNode;\n}\n\n\nOgre::SceneManager* AnnEngine::getSceneManager()\n{\n\treturn SceneManager;\n}\n\nunsigned long AnnEngine::getTimeFromStartUp()\n{\n\treturn renderer->getTimer()->getMilliseconds();\n}\n\ndouble AnnEngine::getTimeFromStartupSeconds()\n{\n\treturn static_cast(getTimeFromStartUp()) \/ 1000.0;\n}\n\n\/\/the delta time of the last frame, not the current one\ndouble AnnEngine::getFrameTime()\n{\n\treturn updateTime;\n}\n\n\/\/Raw position and orientaiton of the head in world space. This is usefull if you want to mess around with weird stuff. This has been bodged when I integrated a LEAP motion in that mess. \nOgrePose AnnEngine::getHmdPose()\n{\n\tif (renderer)\n\t\treturn renderer->returnPose;\n\treturn OgrePose();\n}\n\n\/\/Because Windows and the Win32 platform sucks. \nvoid AnnEngine::openConsole()\n{\n#ifdef _WIN32\n\n\t\/\/Allocate a console for this app\n\tif (AllocConsole())\n\t{\n\t\t\/\/put stdout on this console;\n#pragma warning(disable:4996) \/\/Okay, so for some reason, freopen is \"bad\" because potentially dangerous. However, since I'm passing static strings here, unless you go hack the DLL, I don't know what harm you can do.\n\t\tfreopen(\"CONOUT$\", \"w\", stdout); \n#pragma warning(default:4996)\n\t}\n\n\t\/\/Redirect cerr to cout\n\tstd::cerr.rdbuf(std::cout.rdbuf());\n\n\tSetConsoleTitle(L\"Annwyn Debug Console\");\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\n#endif\n}\n\n\/\/Well, I may make the pointer to the onScreenConsole more accessible. \nvoid AnnEngine::toogleOnScreenConsole()\n{\n\tif (onScreenConsole) onScreenConsole->toogle();\n}\n\nbool AnnEngine::appVisibleInHMD()\n{\n\tif (renderer->isVisibleInHmd() == true) \/\/ why \"== true\" ? Because at some point it was returning an ovrBool, wich is the boolean type of the oculus SDK that doesn't cast correctly to a C++ bool. YES. I DON'T KNOW HOW THEY MANAGED TO FFFF TAHT UP. \n\t\treturn true;\n\treturn false;\n}\n<|endoftext|>"} {"text":"#include \"stdafx.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n\nusing namespace Annwvyn;\n\nAnnEngine* AnnEngine::singleton(NULL);\n\n\/\/Log is static. Therefore this has to be static too to be able to write to it.\nstd::shared_ptr AnnEngine::onScreenConsole(nullptr);\n\nAnnEngine* AnnEngine::Instance()\n{\n\treturn singleton;\n}\n\nstd::string AnnEngine::getAnnwvynVersion(long long int padding)\n{\n\tstd::stringstream version;\n\tversion << ANN_MAJOR << \".\" << ANN_MINOR << \".\" << ANN_PATCH;\n\tif (ANN_EXPERIMENTAL)\n\t\tversion << \"-experimental\";\n\tpadding -= version.str().length();\n\tfor (int i(0); i < padding; i++)\n\t\tversion << \" \";\n\treturn version.str();\n}\n\nvoid AnnEngine::startGameplayLoop()\n{\n\twhile (refresh());\n}\n\nAnnEngine::AnnEngine(const char title[], std::string hmdCommand) :\n\trenderer(nullptr),\n\tresourceManager(nullptr),\n\tsceneryManager(nullptr),\n\tfilesystemManager(nullptr),\n\taudioEngine(nullptr),\n\teventManager(nullptr),\n\tphysicsEngine(nullptr),\n\tgameObjectManager(nullptr),\n\tlevelManager(nullptr),\n\tplayer(nullptr),\n\tSceneManager(nullptr),\n\tvrRendererPovGameplayPlacement(nullptr),\n\tupdateTime(-1)\n{\n\tif (singleton)\n\t{\n\t\tlog(\"Can't create 2 instances of the engine!\");\n\t\texit(ANN_ERR_MEMORY);\n\t}\n\n\tstd::cerr << \"HMD selection from command line routine returned : \" << hmdCommand << std::endl;\n\n\t\/\/Select the correct OgreVRRender class to use :\n\tif (hmdCommand == \"OgreOculusRender\"\n\t\t|| hmdCommand == \"OgreDefaultRender\")\n\t\trenderer = std::make_shared(title);\n\telse if (hmdCommand == \"OgreOpenVRRender\")\n\t\trenderer = std::make_shared(title);\n\telse if (hmdCommand == \"OgreNoVRRender\")\n\t\trenderer = std::make_shared(title);\n\n\telse\n\t{\n\t\tdisplayWin32ErrorMessage(L\"Error: Cannot understand VR System you want to use!\",\n\t\t\t\t\t\t\t\t L\"This program can be used with multiple VR solution.\\n\"\n\t\t\t\t\t\t\t\t L\"The executable should be launched via a dedicated launcher.\\n\"\n\t\t\t\t\t\t\t\t L\"If you're trying to launch it by hand, please check if your command line parameter is correct!\\n\\n\"\n\t\t\t\t\t\t\t\t L\"Available command line parameter : \\n\"\n\t\t\t\t\t\t\t\t L\"\\t-rift\\n\"\n\t\t\t\t\t\t\t\t L\"\\t-vive\\n\"\n\t\t\t\t\t\t\t\t L\"\\nIf you don't specify anything, the default system will be used (here it's the Oculus Rift)\\n\"\n\t\t\t\t\t\t\t\t L\"If you don't have (or can't use) VR Hardware, you can launch with -noVR.\\n\"\n\t\t\t\t\t\t\t\t L\"This will display the image on a simple window without attempting to talk to VR hardware\"\n\t\t);\n\t\texit(ANN_ERR_CANTHMD);\n\t}\n\n\trenderer->initOgreRoot(\"Annwvyn.log\");\n\n\t\/\/Display start banner\n\tlog(\"============================================================\", false);\n\tlog(\"| Annwvyn Game Engine - Step into the Other World |\", false);\n\tlog(\"| Free\/Libre C++ Game Engine designed for Virtual Reality |\", false);\n\tlog(\"| |\", false);\n\tlog(\"| Copyright Arthur Brainville (a.k.a. Ybalrid) 2013-2016 |\", false);\n\tlog(\"| Distributed under the terms of the MIT license agreement |\", false);\n\tlog(\"| |\", false);\n\tlog(\"| Visit http:\/\/annwvyn.org\/ for more informations! |\", false);\n\tlog(\"| Version : \" + getAnnwvynVersion(61 - 13 - 1) + \"|\", false);\n\tlog(\"============================================================\", false);\n\n\tsrand(time(nullptr));\n\tsingleton = this;\n\n\tplayer = std::make_shared< AnnPlayer>();\n\trenderer->initVrHmd();\n\trenderer->initPipeline();\n\tSceneManager = renderer->getSceneManager();\n\n\trenderer->showDebug(OgreVRRender::DebugMode::RAW_BUFFER);\n\n\tlog(\"Setup Annwvyn's subsystems\");\n\n\t\/\/Element on this list will be updated in order by the engine each frame\n\tSubSystemList.push_back(levelManager = std::make_shared());\n\tSubSystemList.push_back(gameObjectManager = std::make_shared());\n\n\t\/\/Physics engine needs to be declared before the event manager. But we want the physics engine to be updated after the event manager.\n\n\t\/*The wanted order is\n\t- event happens (player input, timers...)\n\t- physics is ticked (stuff move)\n\t- audio is synced (sounds comes form where they should)\n\t- then the game can redraw*\/\n\n\tphysicsEngine = std::make_shared(getSceneManager()->getRootSceneNode(), player, gameObjectManager->Objects, gameObjectManager->Triggers);\n\tSubSystemList.push_back(eventManager = std::make_shared< AnnEventManager>(renderer->getWindow()));\n\tSubSystemList.push_back(physicsEngine);\n\tSubSystemList.push_back(audioEngine = std::make_shared< AnnAudioEngine>());\n\n\t\/\/These could be anywhere\n\tSubSystemList.push_back(filesystemManager = std::make_shared(title));\n\tSubSystemList.push_back(resourceManager = std::make_shared());\n\tSubSystemList.push_back(sceneryManager = std::make_shared(renderer));\n\n\trenderer->initClientHmdRendering();\n\tvrRendererPovGameplayPlacement = renderer->getCameraInformationNode();\n\tvrRendererPovGameplayPlacement->setPosition(player->getPosition() +\n\t\t\t\t\t\t\t\t\t\t\t\tAnnVect3(0.0f, player->getEyesHeight(), 0.0f));\n\n\t\t\t\t\t\t\t\t\t\t\t\/\/This subsystem need the vrRendererPovGameplayPlacement object to be initialized. And the Resource manager because it wants a font file and an image background\n\tSubSystemList.push_back(onScreenConsole = std::make_shared());\n}\n\nAnnEngine::~AnnEngine()\n{\n\t\/\/Some cute log messages\n\tlog(\"Game engine stopped. Subsystem are shutting down...\");\n\tlog(\"Good luck with the real world now! :3\");\n}\n\n\/\/All theses getter are for encapsulation purpose. Calling them directly would make very long lines of code. Note that there's a whole bunch of macro in AnnEngine.hpp to help with that\nstd::shared_ptr AnnEngine::getEventManager()\n{\n\treturn eventManager;\n}\n\nstd::shared_ptr AnnEngine::getResourceManager()\n{\n\treturn resourceManager;\n}\n\nstd::shared_ptr AnnEngine::getGameObjectManager()\n{\n\treturn gameObjectManager;\n}\n\nstd::shared_ptr AnnEngine::getSceneryManager()\n{\n\treturn sceneryManager;\n}\n\nstd::shared_ptr AnnEngine::getVRRenderer()\n{\n\treturn renderer;\n}\n\nstd::shared_ptr AnnEngine::getLevelManager()\n{\n\treturn levelManager;\n}\n\nstd::shared_ptr AnnEngine::getPlayer()\n{\n\treturn player;\n}\n\nstd::shared_ptr AnnEngine::getFileSystemManager()\n{\n\treturn filesystemManager;\n}\n\nstd::shared_ptr AnnEngine::getAudioEngine()\n{\n\treturn audioEngine;\n}\n\nstd::shared_ptr AnnEngine::getPhysicsEngine()\n{\n\treturn physicsEngine;\n}\n\n\/\/This is static, but actually needs Ogre to be running. So be careful\nvoid AnnEngine::log(std::string message, bool flag)\n{\n\tOgre::String messageForLog;\n\n\tif (flag)\n\t{\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\t\tmessageForLog += \"Annwvyn - \";\n\t}\n\telse\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n\n\tmessageForLog += message;\n\tOgre::LogManager::getSingleton().logMessage(messageForLog);\n\tif (onScreenConsole != nullptr)\n\t\tonScreenConsole->append(message);\n\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n}\n\n\/\/Don't ask me why this is not part of the Physics engine. Actually it just calls something on the physics engine. Will be probably deleted in the future.\nvoid AnnEngine::initPlayerPhysics()\n{\n\tphysicsEngine->initPlayerPhysics(vrRendererPovGameplayPlacement);\n}\n\n\/\/Need to be redone.\nbool AnnEngine::requestStop()\n{\n\t\/\/pres ESC to quit. Stupid but efficient. I like that.\n\tif (isKeyDown(OIS::KC_ESCAPE))\n\t\treturn true;\n\t\/\/If the user quit the App from the Oculus Home\n\tif (renderer->shouldQuit())\n\t\treturn true;\n\treturn false;\n}\n\n\/\/This is the most important function of the whole project. It's the heartbeat of the game or app using this engine.\nbool AnnEngine::refresh()\n{\n\t\/\/Get the rendering delta time (should be roughly equals to 1\/desiredFramerate in seconds)\n\tupdateTime = renderer->getUpdateTime();\n\tplayer->engineUpdate(getFrameTime());\n\n\tfor (auto SubSystem : SubSystemList)\n\t\tif (!SubSystem->needUpdate()) continue; \/\/If doesn't need update, switch to the next\n\t\telse SubSystem->update();\t\t\t\t\/\/The \"else\" keyword is used to not put curly braces, by laziness and by code style.\n\n\t\t\/\/Update camera from player\n\t\tsyncPov();\n\n\t\t\/\/Update VR form real world\n\t\trenderer->updateTracking();\n\n\t\t\/\/Update view\n\t\trenderer->renderAndSubmitFrame();\n\n\t\t\/\/Don't laugh\n\t\treturn !requestStop();\n}\n\n\/\/This just move a node where the other node is. Yes I know about parenting. I had reasons to do it that way, but I forgot.\ninline void AnnEngine::syncPov()\n{\n\tvrRendererPovGameplayPlacement->setPosition(player->getPosition());\n\tvrRendererPovGameplayPlacement->setOrientation(player->getOrientation().toQuaternion());\n}\n\n\/\/Bad. Don't use. Register an event listener and use the KeyEvent callback.\ninline bool AnnEngine::isKeyDown(OIS::KeyCode key)\n{\n\tif (!eventManager) return false;\n\treturn eventManager->Keyboard->isKeyDown(key);\n}\n\nOgre::SceneNode* AnnEngine::getPlayerPovNode()\n{\n\treturn vrRendererPovGameplayPlacement;\n}\n\nOgre::SceneManager* AnnEngine::getSceneManager()\n{\n\treturn SceneManager;\n}\n\nunsigned long AnnEngine::getTimeFromStartUp()\n{\n\treturn renderer->getTimer()->getMilliseconds();\n}\n\ndouble AnnEngine::getTimeFromStartupSeconds()\n{\n\treturn static_cast(getTimeFromStartUp()) \/ 1000.0;\n}\n\n\/\/the delta time of the last frame, not the current one\ndouble AnnEngine::getFrameTime()\n{\n\treturn updateTime;\n}\n\n\/\/Raw position and orientation of the head in world space. This is useful if you want to mess around with weird stuff. This has been bodged when I integrated a LEAP motion in that mess.\nOgrePose AnnEngine::getHmdPose()\n{\n\tif (renderer)\n\t\treturn renderer->returnPose;\n\treturn OgrePose();\n}\n\nstd::shared_ptr AnnEngine::registerUserSubSystem(std::shared_ptr userSystem)\n{\n\tfor (auto system : SubSystemList)\n\t\tif (userSystem->name == system->name)\n\t\t{\n\t\t\tAnnDebug() << \"A subsystem with the name \" << userSystem->name << \"is already registered.\";\n\t\t\treturn nullptr;\n\t\t}\n\tSubSystemList.push_back(userSystem);\n\treturn userSystem;\n}\n\nstd::shared_ptr Annwvyn::AnnEngine::getSubSystemByName(std::string name)\n{\n\tfor (auto subsystem : SubSystemList)\n\t\tif (subsystem->name == name)\n\t\t\treturn subsystem;\n\treturn nullptr;\n}\n\nbool AnnEngine::isUserSubSystem(std::shared_ptr subsystem)\n{\n\tAnnSubSystem* nakedSubSystem(subsystem.get());\n\n\tAnnUserSubSystem* result = dynamic_cast(nakedSubSystem);\n\tif (result != nullptr) return true;\n\treturn false;\n}\n\nvoid Annwvyn::AnnEngine::removeUserSubSystem(std::shared_ptr subsystem)\n{\n\tSubSystemList.remove(subsystem);\n}\n\n\/\/Because Windows and the Win32 platform sucks.\nvoid AnnEngine::openConsole()\n{\n#ifdef _WIN32\n\n\t\/\/Allocate a console for this app\n\tif (AllocConsole())\n\t{\n\t\t\/\/put stdout on this console;\n#pragma warning(disable:4996) \/\/Okay, so for some reason, freopen is \"bad\" because potentially dangerous. However, since I'm passing static strings here, unless you go hack the DLL, I don't know what harm you can do.\n\t\tfreopen(\"CONOUT$\", \"w\", stdout);\n#pragma warning(default:4996)\n\t}\n\n\t\/\/Redirect cerr to cout\n\tstd::cerr.rdbuf(std::cout.rdbuf());\n\n\tSetConsoleTitle(L\"Annwvyn Debug Console\");\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\n#endif\n}\n\n\/\/Well, I may make the pointer to the onScreenConsole more accessible.\nvoid AnnEngine::toogleOnScreenConsole()\n{\n\tif (onScreenConsole) onScreenConsole->toggle();\n}\n\nbool AnnEngine::appVisibleInHMD()\n{\n\tif (renderer->isVisibleInHmd())\n\t\treturn true;\n\treturn false;\n}Update AnnEngine.cpp#include \"stdafx.h\"\n#include \"AnnEngine.hpp\"\n#include \"AnnLogger.hpp\"\n\nusing namespace Annwvyn;\n\nAnnEngine* AnnEngine::singleton(NULL);\n\n\/\/Log is static. Therefore this has to be static too to be able to write to it.\nstd::shared_ptr AnnEngine::onScreenConsole(nullptr);\n\nAnnEngine* AnnEngine::Instance()\n{\n\treturn singleton;\n}\n\nstd::string AnnEngine::getAnnwvynVersion(long long int padding)\n{\n\tstd::stringstream version;\n\tversion << ANN_MAJOR << \".\" << ANN_MINOR << \".\" << ANN_PATCH;\n\tif (ANN_EXPERIMENTAL)\n\t\tversion << \"-experimental\";\n\tpadding -= version.str().length();\n\tfor (int i(0); i < padding; i++)\n\t\tversion << \" \";\n\treturn version.str();\n}\n\nvoid AnnEngine::startGameplayLoop()\n{\n\twhile (refresh());\n}\n\nAnnEngine::AnnEngine(const char title[], std::string hmdCommand) :\n\trenderer(nullptr),\n\tresourceManager(nullptr),\n\tsceneryManager(nullptr),\n\tfilesystemManager(nullptr),\n\taudioEngine(nullptr),\n\teventManager(nullptr),\n\tphysicsEngine(nullptr),\n\tgameObjectManager(nullptr),\n\tlevelManager(nullptr),\n\tplayer(nullptr),\n\tSceneManager(nullptr),\n\tvrRendererPovGameplayPlacement(nullptr),\n\tupdateTime(-1)\n{\n\tif (singleton)\n\t{\n\t\tlog(\"Can't create 2 instances of the engine!\");\n\t\texit(ANN_ERR_MEMORY);\n\t}\n\n\tstd::cerr << \"HMD selection from command line routine returned : \" << hmdCommand << std::endl;\n\n\t\/\/Select the correct OgreVRRender class to use :\n\tif (hmdCommand == \"OgreOculusRender\"\n\t\t|| hmdCommand == \"OgreDefaultRender\")\n\t\trenderer = std::make_shared(title);\n\telse if (hmdCommand == \"OgreOpenVRRender\")\n\t\trenderer = std::make_shared(title);\n\telse if (hmdCommand == \"OgreNoVRRender\")\n\t\trenderer = std::make_shared(title);\n\n\telse\n\t{\n\t\tdisplayWin32ErrorMessage(L\"Error: Cannot understand VR System you want to use!\",\n\t\t\t\t\t\t\t\t L\"This program can be used with multiple VR solution.\\n\"\n\t\t\t\t\t\t\t\t L\"The executable should be launched via a dedicated launcher.\\n\"\n\t\t\t\t\t\t\t\t L\"If you're trying to launch it by hand, please check if your command line parameter is correct!\\n\\n\"\n\t\t\t\t\t\t\t\t L\"Available command line parameter : \\n\"\n\t\t\t\t\t\t\t\t L\"\\t-rift\\n\"\n\t\t\t\t\t\t\t\t L\"\\t-vive\\n\"\n\t\t\t\t\t\t\t\t L\"\\nIf you don't specify anything, the default system will be used (here it's the Oculus Rift)\\n\"\n\t\t\t\t\t\t\t\t L\"If you don't have (or can't use) VR Hardware, you can launch with -noVR.\\n\"\n\t\t\t\t\t\t\t\t L\"This will display the image on a simple window without attempting to talk to VR hardware\"\n\t\t);\n\t\texit(ANN_ERR_CANTHMD);\n\t}\n\n\trenderer->initOgreRoot(\"Annwvyn.log\");\n\n\t\/\/Display start banner\n\tlog(\"============================================================\", false);\n\tlog(\"| Annwvyn Game Engine - Step into the Other World |\", false);\n\tlog(\"| Free\/Libre C++ Game Engine designed for Virtual Reality |\", false);\n\tlog(\"| |\", false);\n\tlog(\"| Copyright Arthur Brainville (a.k.a. Ybalrid) 2013-2016 |\", false);\n\tlog(\"| Distributed under the terms of the MIT license agreement |\", false);\n\tlog(\"| |\", false);\n\tlog(\"| Visit http:\/\/annwvyn.org\/ for more informations! |\", false);\n\tlog(\"| Version : \" + getAnnwvynVersion(61 - 13 - 1) + \"|\", false);\n\tlog(\"============================================================\", false);\n\n\tsrand(time(nullptr));\n\tsingleton = this;\n\n\tplayer = std::make_shared< AnnPlayer>();\n\trenderer->initVrHmd();\n\trenderer->initPipeline();\n\tSceneManager = renderer->getSceneManager();\n\n\trenderer->showDebug(OgreVRRender::DebugMode::MONOSCOPIC);\n\n\tlog(\"Setup Annwvyn's subsystems\");\n\n\t\/\/Element on this list will be updated in order by the engine each frame\n\tSubSystemList.push_back(levelManager = std::make_shared());\n\tSubSystemList.push_back(gameObjectManager = std::make_shared());\n\n\t\/\/Physics engine needs to be declared before the event manager. But we want the physics engine to be updated after the event manager.\n\n\t\/*The wanted order is\n\t- event happens (player input, timers...)\n\t- physics is ticked (stuff move)\n\t- audio is synced (sounds comes form where they should)\n\t- then the game can redraw*\/\n\n\tphysicsEngine = std::make_shared(getSceneManager()->getRootSceneNode(), player, gameObjectManager->Objects, gameObjectManager->Triggers);\n\tSubSystemList.push_back(eventManager = std::make_shared< AnnEventManager>(renderer->getWindow()));\n\tSubSystemList.push_back(physicsEngine);\n\tSubSystemList.push_back(audioEngine = std::make_shared< AnnAudioEngine>());\n\n\t\/\/These could be anywhere\n\tSubSystemList.push_back(filesystemManager = std::make_shared(title));\n\tSubSystemList.push_back(resourceManager = std::make_shared());\n\tSubSystemList.push_back(sceneryManager = std::make_shared(renderer));\n\n\trenderer->initClientHmdRendering();\n\tvrRendererPovGameplayPlacement = renderer->getCameraInformationNode();\n\tvrRendererPovGameplayPlacement->setPosition(player->getPosition() +\n\t\t\t\t\t\t\t\t\t\t\t\tAnnVect3(0.0f, player->getEyesHeight(), 0.0f));\n\n\t\t\t\t\t\t\t\t\t\t\t\/\/This subsystem need the vrRendererPovGameplayPlacement object to be initialized. And the Resource manager because it wants a font file and an image background\n\tSubSystemList.push_back(onScreenConsole = std::make_shared());\n}\n\nAnnEngine::~AnnEngine()\n{\n\t\/\/Some cute log messages\n\tlog(\"Game engine stopped. Subsystem are shutting down...\");\n\tlog(\"Good luck with the real world now! :3\");\n}\n\n\/\/All theses getter are for encapsulation purpose. Calling them directly would make very long lines of code. Note that there's a whole bunch of macro in AnnEngine.hpp to help with that\nstd::shared_ptr AnnEngine::getEventManager()\n{\n\treturn eventManager;\n}\n\nstd::shared_ptr AnnEngine::getResourceManager()\n{\n\treturn resourceManager;\n}\n\nstd::shared_ptr AnnEngine::getGameObjectManager()\n{\n\treturn gameObjectManager;\n}\n\nstd::shared_ptr AnnEngine::getSceneryManager()\n{\n\treturn sceneryManager;\n}\n\nstd::shared_ptr AnnEngine::getVRRenderer()\n{\n\treturn renderer;\n}\n\nstd::shared_ptr AnnEngine::getLevelManager()\n{\n\treturn levelManager;\n}\n\nstd::shared_ptr AnnEngine::getPlayer()\n{\n\treturn player;\n}\n\nstd::shared_ptr AnnEngine::getFileSystemManager()\n{\n\treturn filesystemManager;\n}\n\nstd::shared_ptr AnnEngine::getAudioEngine()\n{\n\treturn audioEngine;\n}\n\nstd::shared_ptr AnnEngine::getPhysicsEngine()\n{\n\treturn physicsEngine;\n}\n\n\/\/This is static, but actually needs Ogre to be running. So be careful\nvoid AnnEngine::log(std::string message, bool flag)\n{\n\tOgre::String messageForLog;\n\n\tif (flag)\n\t{\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\t\tmessageForLog += \"Annwvyn - \";\n\t}\n\telse\n\t\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n\n\tmessageForLog += message;\n\tOgre::LogManager::getSingleton().logMessage(messageForLog);\n\tif (onScreenConsole != nullptr)\n\t\tonScreenConsole->append(message);\n\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_GREEN | FOREGROUND_INTENSITY);\n}\n\n\/\/Don't ask me why this is not part of the Physics engine. Actually it just calls something on the physics engine. Will be probably deleted in the future.\nvoid AnnEngine::initPlayerPhysics()\n{\n\tphysicsEngine->initPlayerPhysics(vrRendererPovGameplayPlacement);\n}\n\n\/\/Need to be redone.\nbool AnnEngine::requestStop()\n{\n\t\/\/pres ESC to quit. Stupid but efficient. I like that.\n\tif (isKeyDown(OIS::KC_ESCAPE))\n\t\treturn true;\n\t\/\/If the user quit the App from the Oculus Home\n\tif (renderer->shouldQuit())\n\t\treturn true;\n\treturn false;\n}\n\n\/\/This is the most important function of the whole project. It's the heartbeat of the game or app using this engine.\nbool AnnEngine::refresh()\n{\n\t\/\/Get the rendering delta time (should be roughly equals to 1\/desiredFramerate in seconds)\n\tupdateTime = renderer->getUpdateTime();\n\tplayer->engineUpdate(getFrameTime());\n\n\tfor (auto SubSystem : SubSystemList)\n\t\tif (!SubSystem->needUpdate()) continue; \/\/If doesn't need update, switch to the next\n\t\telse SubSystem->update();\t\t\t\t\/\/The \"else\" keyword is used to not put curly braces, by laziness and by code style.\n\n\t\t\/\/Update camera from player\n\t\tsyncPov();\n\n\t\t\/\/Update VR form real world\n\t\trenderer->updateTracking();\n\n\t\t\/\/Update view\n\t\trenderer->renderAndSubmitFrame();\n\n\t\t\/\/Don't laugh\n\t\treturn !requestStop();\n}\n\n\/\/This just move a node where the other node is. Yes I know about parenting. I had reasons to do it that way, but I forgot.\ninline void AnnEngine::syncPov()\n{\n\tvrRendererPovGameplayPlacement->setPosition(player->getPosition());\n\tvrRendererPovGameplayPlacement->setOrientation(player->getOrientation().toQuaternion());\n}\n\n\/\/Bad. Don't use. Register an event listener and use the KeyEvent callback.\ninline bool AnnEngine::isKeyDown(OIS::KeyCode key)\n{\n\tif (!eventManager) return false;\n\treturn eventManager->Keyboard->isKeyDown(key);\n}\n\nOgre::SceneNode* AnnEngine::getPlayerPovNode()\n{\n\treturn vrRendererPovGameplayPlacement;\n}\n\nOgre::SceneManager* AnnEngine::getSceneManager()\n{\n\treturn SceneManager;\n}\n\nunsigned long AnnEngine::getTimeFromStartUp()\n{\n\treturn renderer->getTimer()->getMilliseconds();\n}\n\ndouble AnnEngine::getTimeFromStartupSeconds()\n{\n\treturn static_cast(getTimeFromStartUp()) \/ 1000.0;\n}\n\n\/\/the delta time of the last frame, not the current one\ndouble AnnEngine::getFrameTime()\n{\n\treturn updateTime;\n}\n\n\/\/Raw position and orientation of the head in world space. This is useful if you want to mess around with weird stuff. This has been bodged when I integrated a LEAP motion in that mess.\nOgrePose AnnEngine::getHmdPose()\n{\n\tif (renderer)\n\t\treturn renderer->returnPose;\n\treturn OgrePose();\n}\n\nstd::shared_ptr AnnEngine::registerUserSubSystem(std::shared_ptr userSystem)\n{\n\tfor (auto system : SubSystemList)\n\t\tif (userSystem->name == system->name)\n\t\t{\n\t\t\tAnnDebug() << \"A subsystem with the name \" << userSystem->name << \"is already registered.\";\n\t\t\treturn nullptr;\n\t\t}\n\tSubSystemList.push_back(userSystem);\n\treturn userSystem;\n}\n\nstd::shared_ptr Annwvyn::AnnEngine::getSubSystemByName(std::string name)\n{\n\tfor (auto subsystem : SubSystemList)\n\t\tif (subsystem->name == name)\n\t\t\treturn subsystem;\n\treturn nullptr;\n}\n\nbool AnnEngine::isUserSubSystem(std::shared_ptr subsystem)\n{\n\tAnnSubSystem* nakedSubSystem(subsystem.get());\n\n\tAnnUserSubSystem* result = dynamic_cast(nakedSubSystem);\n\tif (result != nullptr) return true;\n\treturn false;\n}\n\nvoid Annwvyn::AnnEngine::removeUserSubSystem(std::shared_ptr subsystem)\n{\n\tSubSystemList.remove(subsystem);\n}\n\n\/\/Because Windows and the Win32 platform sucks.\nvoid AnnEngine::openConsole()\n{\n#ifdef _WIN32\n\n\t\/\/Allocate a console for this app\n\tif (AllocConsole())\n\t{\n\t\t\/\/put stdout on this console;\n#pragma warning(disable:4996) \/\/Okay, so for some reason, freopen is \"bad\" because potentially dangerous. However, since I'm passing static strings here, unless you go hack the DLL, I don't know what harm you can do.\n\t\tfreopen(\"CONOUT$\", \"w\", stdout);\n#pragma warning(default:4996)\n\t}\n\n\t\/\/Redirect cerr to cout\n\tstd::cerr.rdbuf(std::cout.rdbuf());\n\n\tSetConsoleTitle(L\"Annwvyn Debug Console\");\n\tSetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_BLUE | FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY);\n\n#endif\n}\n\n\/\/Well, I may make the pointer to the onScreenConsole more accessible.\nvoid AnnEngine::toogleOnScreenConsole()\n{\n\tif (onScreenConsole) onScreenConsole->toggle();\n}\n\nbool AnnEngine::appVisibleInHMD()\n{\n\tif (renderer->isVisibleInHmd())\n\t\treturn true;\n\treturn false;\n}\n<|endoftext|>"} {"text":"Actually play the game if not in testing mode.<|endoftext|>"} {"text":"\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2019 Dominik Charousset *\n * *\n * Distributed under the terms and conditions of the BSD 3-Clause License or *\n * (at your option) under the terms and conditions of the Boost Software *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *\n * *\n * If you did not receive a copy of the license files, see *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt. *\n ******************************************************************************\/\n\n#define CAF_SUITE ip\n\n#include \"caf\/net\/ip.hpp\"\n\n#include \"caf\/test\/dsl.hpp\"\n\n#include \"host_fixture.hpp\"\n\n#include \"caf\/ip_address.hpp\"\n#include \"caf\/ipv4_address.hpp\"\n\nusing namespace caf;\nusing namespace caf::net;\n\nnamespace {\n\nstruct fixture : host_fixture {\n fixture() : v6_local{{0}, {0x1}} {\n v4_local = ip_address{make_ipv4_address(127, 0, 0, 1)};\n v4_any_addr = ip_address{make_ipv4_address(0, 0, 0, 0)};\n }\n\n bool contains(ip_address x) {\n return std::count(addrs.begin(), addrs.end(), x) > 0;\n }\n\n ip_address v4_any_addr;\n ip_address v6_any_addr;\n ip_address v4_local;\n ip_address v6_local;\n\n std::vector addrs;\n};\n\n} \/\/ namespace\n\nCAF_TEST_FIXTURE_SCOPE(ip_tests, fixture)\n\nCAF_TEST(resolve localhost) {\n addrs = ip::resolve(\"localhost\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_local) || contains(v6_local));\n}\n\nCAF_TEST(resolve any) {\n ip_address v4_any{make_ipv4_address(0, 0, 0, 0)};\n ip_address v6_any{{0}, {0}};\n auto addrs = ip::resolve(\"\");\n CAF_CHECK(!addrs.empty());\n auto contains = [&](ip_address x) {\n return std::count(addrs.begin(), addrs.end(), x) > 0;\n };\n CAF_CHECK(contains(v4_any) || contains(v6_any));\n}\n\nCAF_TEST(local addresses) {\n CAF_MESSAGE(\"check: v4\");\n addrs = ip::local_addresses(\"0.0.0.0\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_any_addr));\n CAF_MESSAGE(\"check: v6\");\n addrs = ip::local_addresses(\"::\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v6_any_addr));\n CAF_MESSAGE(\"check: localhost\");\n addrs = ip::local_addresses(\"localhost\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_local) || contains(v6_local));\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\nSplit local address test cases\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2019 Dominik Charousset *\n * *\n * Distributed under the terms and conditions of the BSD 3-Clause License or *\n * (at your option) under the terms and conditions of the Boost Software *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *\n * *\n * If you did not receive a copy of the license files, see *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt. *\n ******************************************************************************\/\n\n#define CAF_SUITE ip\n\n#include \"caf\/net\/ip.hpp\"\n\n#include \"caf\/test\/dsl.hpp\"\n\n#include \"host_fixture.hpp\"\n\n#include \"caf\/ip_address.hpp\"\n#include \"caf\/ipv4_address.hpp\"\n\nusing namespace caf;\nusing namespace caf::net;\n\nnamespace {\n\nstruct fixture : host_fixture {\n fixture() : v6_local{{0}, {0x1}} {\n v4_local = ip_address{make_ipv4_address(127, 0, 0, 1)};\n v4_any_addr = ip_address{make_ipv4_address(0, 0, 0, 0)};\n }\n\n bool contains(ip_address x) {\n return std::count(addrs.begin(), addrs.end(), x) > 0;\n }\n\n ip_address v4_any_addr;\n ip_address v6_any_addr;\n ip_address v4_local;\n ip_address v6_local;\n\n std::vector addrs;\n};\n\n} \/\/ namespace\n\nCAF_TEST_FIXTURE_SCOPE(ip_tests, fixture)\n\nCAF_TEST(resolve localhost) {\n addrs = ip::resolve(\"localhost\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_local) || contains(v6_local));\n}\n\nCAF_TEST(resolve any) {\n addrs = ip::resolve(\"\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_any_addr) || contains(v6_any_addr));\n}\n\nCAF_TEST(local addresses localhost) {\n addrs = ip::local_addresses(\"localhost\");\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_local) || contains(v6_local));\n}\n\nCAF_TEST(local addresses any) {\n addrs = ip::local_addresses(\"0.0.0.0\");\n auto tmp = ip::local_addresses(\"::\");\n addrs.insert(addrs.end(), tmp.begin(), tmp.end());\n CAF_CHECK(!addrs.empty());\n CAF_CHECK(contains(v4_any_addr) || contains(v6_any_addr));\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\n<|endoftext|>"} {"text":"\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson \n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' || \n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic void getRangeLowered(unsigned int start,\n\t\tunsigned int end,\n\t\tAccessor &styler,\n\t\tchar *s,\n\t\tunsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast(tolower(styler[start + i]));\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\ninline bool IsASpace(unsigned int ch) {\n return (ch == ' ') || ((ch >= 0x09) && (ch <= 0x0d));\n}\n\ninline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADigit(unsigned int ch) {\n\treturn (ch >= '0') && (ch <= '9');\n}\n\n\/\/ All languages handled so far can treat all characters >= 0x80 as one class\n\/\/ which just continues the current token or starts an identifier if in default.\n\/\/ DBCS treated specially as the second character can be < 0x80 and hence \n\/\/ syntactically significant. UTF-8 avoids this as all trail bytes are >= 0x80\nclass ColouriseContext {\n\tAccessor &styler;\n\tint lengthDoc;\n\tint currentPos;\n\tColouriseContext& operator=(const ColouriseContext&) {\n\t\treturn *this;\n\t}\npublic:\n\tint state;\n\tunsigned int chPrev;\n\tunsigned int ch;\n\tunsigned int chNext;\n\n\tColouriseContext(unsigned int startPos, int length,\n int initStyle, Accessor &styler_) : \n\t\tstyler(styler_),\n\t\tlengthDoc(startPos + length),\n\t\tcurrentPos(startPos), \n\t\tstate(initStyle), \n\t\tchPrev(0),\n\t\tch(0), \n\t\tchNext(0) {\n\t\tstyler.StartAt(startPos);\n\t\tstyler.StartSegment(startPos);\n\t\tint pos = currentPos;\n\t\tch = static_cast(styler.SafeGetCharAt(pos));\n\t\tif (styler.IsLeadByte(static_cast(ch))) {\n\t\t\tpos++;\n\t\t\tch = ch << 8;\n\t\t\tch |= static_cast(styler.SafeGetCharAt(pos));\n\t\t}\n\t\tchNext = static_cast(styler.SafeGetCharAt(pos+1));\n\t\tif (styler.IsLeadByte(static_cast(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast(styler.SafeGetCharAt(pos+2));\n\t\t}\n\t}\n\tvoid Complete() {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t}\n\tbool More() {\n\t\treturn currentPos <= lengthDoc;\n\t}\n\tvoid Forward() {\n\t\tchPrev = ch;\n\t\tcurrentPos++;\n\t\tif (ch >= 0x100)\n\t\t\tcurrentPos++;\n\t\tch = chNext;\n\t\tchNext = static_cast(styler.SafeGetCharAt(currentPos+1));\n\t\tif (styler.IsLeadByte(static_cast(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast(styler.SafeGetCharAt(currentPos + 2));\n\t\t}\n\t}\n\tvoid ChangeState(int state_) {\n\t\tstate = state_;\n\t}\n\tvoid SetState(int state_) {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t\tstate = state_;\n\t}\n\tvoid GetCurrentLowered(char *s, int len) {\n\t\tgetRangeLowered(styler.GetStartSegment(), currentPos - 1, styler, s, len);\n\t}\n};\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tColouriseContext lc(startPos, length, initStyle, styler);\n\n\tfor (; lc.More(); lc.Forward()) {\n\n\t\tif (lc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (lc.ch != '\\r' && lc.ch != '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (lc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tlc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tlc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (lc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (lc.ch == '-' && lc.chNext == '-') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(lc.ch) || (lc.ch == '.')) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tlc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) || \n\t\t\t\t(strcmp(s, \"debug\") == 0) || \n\t\t\t\t(strcmp(s, \"deferred\") == 0) || \n\t\t\t\t(strcmp(s, \"do\") == 0) || \n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) || \n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0) \n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords);\nChanged name of ColouriseContext to allow debugging.\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson \n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' || \n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic void getRangeLowered(unsigned int start,\n\t\tunsigned int end,\n\t\tAccessor &styler,\n\t\tchar *s,\n\t\tunsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast(tolower(styler[start + i]));\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\ninline bool IsASpace(unsigned int ch) {\n return (ch == ' ') || ((ch >= 0x09) && (ch <= 0x0d));\n}\n\ninline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADigit(unsigned int ch) {\n\treturn (ch >= '0') && (ch <= '9');\n}\n\n\/\/ All languages handled so far can treat all characters >= 0x80 as one class\n\/\/ which just continues the current token or starts an identifier if in default.\n\/\/ DBCS treated specially as the second character can be < 0x80 and hence \n\/\/ syntactically significant. UTF-8 avoids this as all trail bytes are >= 0x80\nclass xColouriseContext {\n\tAccessor &styler;\n\tint lengthDoc;\n\tint currentPos;\n\txColouriseContext& operator=(const xColouriseContext&) {\n\t\treturn *this;\n\t}\npublic:\n\tint state;\n\tunsigned int chPrev;\n\tunsigned int ch;\n\tunsigned int chNext;\n\n\txColouriseContext(unsigned int startPos, int length,\n int initStyle, Accessor &styler_) : \n\t\tstyler(styler_),\n\t\tlengthDoc(startPos + length),\n\t\tcurrentPos(startPos), \n\t\tstate(initStyle), \n\t\tchPrev(0),\n\t\tch(0), \n\t\tchNext(0) {\n\t\tstyler.StartAt(startPos);\n\t\tstyler.StartSegment(startPos);\n\t\tint pos = currentPos;\n\t\tch = static_cast(styler.SafeGetCharAt(pos));\n\t\tif (styler.IsLeadByte(static_cast(ch))) {\n\t\t\tpos++;\n\t\t\tch = ch << 8;\n\t\t\tch |= static_cast(styler.SafeGetCharAt(pos));\n\t\t}\n\t\tchNext = static_cast(styler.SafeGetCharAt(pos+1));\n\t\tif (styler.IsLeadByte(static_cast(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast(styler.SafeGetCharAt(pos+2));\n\t\t}\n\t}\n\tvoid Complete() {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t}\n\tbool More() {\n\t\treturn currentPos <= lengthDoc;\n\t}\n\tvoid Forward() {\n\t\tchPrev = ch;\n\t\tcurrentPos++;\n\t\tif (ch >= 0x100)\n\t\t\tcurrentPos++;\n\t\tch = chNext;\n\t\tchNext = static_cast(styler.SafeGetCharAt(currentPos+1));\n\t\tif (styler.IsLeadByte(static_cast(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast(styler.SafeGetCharAt(currentPos + 2));\n\t\t}\n\t}\n\tvoid ChangeState(int state_) {\n\t\tstate = state_;\n\t}\n\tvoid SetState(int state_) {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t\tstate = state_;\n\t}\n\tvoid GetCurrentLowered(char *s, int len) {\n\t\tgetRangeLowered(styler.GetStartSegment(), currentPos - 1, styler, s, len);\n\t}\n};\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\txColouriseContext lc(startPos, length, initStyle, styler);\n\n\tfor (; lc.More(); lc.Forward()) {\n\n\t\tif (lc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (lc.ch != '\\r' && lc.ch != '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (lc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tlc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tlc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (lc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (lc.ch == '-' && lc.chNext == '-') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(lc.ch) || (lc.ch == '.')) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tlc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) || \n\t\t\t\t(strcmp(s, \"debug\") == 0) || \n\t\t\t\t(strcmp(s, \"deferred\") == 0) || \n\t\t\t\t(strcmp(s, \"do\") == 0) || \n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) || \n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0) \n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords);\n<|endoftext|>"} {"text":"#include \"Monotonic.h\"\n#include \"IRMutator.h\"\n#include \"Substitute.h\"\n#include \"Scope.h\"\n#include \"Simplify.h\"\n#include \"IROperator.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\n\nclass MonotonicVisitor : public IRVisitor {\n const string &var;\n\n Scope scope;\n\n void visit(const IntImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const UIntImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const FloatImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const StringImm *) {\n internal_error << \"Monotonic on String\\n\";\n }\n\n void visit(const Cast *op) {\n op->value.accept(this);\n\n if (op->type.can_represent(op->value.type())) {\n \/\/ No overflow.\n return;\n }\n\n if (op->value.type().bits() >= 32 && op->type.bits() >= 32) {\n \/\/ We assume 32-bit types don't overflow.\n return;\n }\n\n \/\/ A narrowing cast. There may be more cases we can catch, but\n \/\/ for now we punt.\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Variable *op) {\n if (op->name == var) {\n result = Monotonic::Increasing;\n } else if (scope.contains(op->name)) {\n result = scope.get(op->name);\n } else {\n result = Monotonic::Constant;\n }\n }\n\n Monotonic flip(Monotonic r) {\n switch (r) {\n case Monotonic::Increasing: return Monotonic::Decreasing;\n case Monotonic::Decreasing: return Monotonic::Increasing;\n default: return r;\n }\n }\n\n Monotonic unify(Monotonic a, Monotonic b) {\n if (a == b) {\n return a;\n }\n\n if (a == Monotonic::Unknown || b == Monotonic::Unknown) {\n return Monotonic::Unknown;\n }\n\n if (a == Monotonic::Constant) {\n return b;\n }\n\n if (b == Monotonic::Constant) {\n return a;\n }\n\n return Monotonic::Unknown;\n }\n\n void visit(const Add *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Sub *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, flip(rb));\n }\n\n void visit(const Mul *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else if (is_positive_const(op->a)) {\n result = rb;\n } else if (is_positive_const(op->b)) {\n result = ra;\n } else if (is_negative_const(op->a)) {\n result = flip(rb);\n } else if (is_negative_const(op->b)) {\n result = flip(ra);\n } else {\n result = Monotonic::Unknown;\n }\n\n }\n\n void visit(const Div *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else if (is_positive_const(op->b)) {\n result = ra;\n } else if (is_negative_const(op->b)) {\n result = flip(ra);\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Mod *op) {\n result = Monotonic::Unknown;\n }\n\n void visit(const Min *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Max *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit_eq(Expr a, Expr b) {\n a.accept(this);\n Monotonic ra = result;\n b.accept(this);\n Monotonic rb = result;\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const EQ *op) {\n visit_eq(op->a, op->b);\n }\n\n void visit(const NE *op) {\n visit_eq(op->a, op->b);\n }\n\n void visit_lt(Expr a, Expr b) {\n a.accept(this);\n Monotonic ra = result;\n b.accept(this);\n Monotonic rb = result;\n result = unify(flip(ra), rb);\n }\n\n void visit(const LT *op) {\n visit_lt(op->a, op->b);\n }\n\n void visit(const LE *op) {\n visit_lt(op->a, op->b);\n }\n\n void visit(const GT *op) {\n visit_lt(op->b, op->a);\n }\n\n void visit(const GE *op) {\n visit_lt(op->b, op->a);\n }\n\n void visit(const And *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Or *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Not *op) {\n op->a.accept(this);\n result = flip(result);\n }\n\n void visit(const Select *op) {\n op->condition.accept(this);\n Monotonic rcond = result;\n\n op->true_value.accept(this);\n Monotonic ra = result;\n op->false_value.accept(this);\n Monotonic rb = result;\n Monotonic unified = unify(ra, rb);\n\n if (rcond == Monotonic::Constant) {\n result = unified;\n return;\n }\n\n bool true_value_ge_false_value = is_one(simplify(op->true_value >= op->false_value));\n bool true_value_le_false_value = is_one(simplify(op->true_value <= op->false_value));\n\n bool switches_from_true_to_false = rcond == Monotonic::Decreasing;\n bool switches_from_false_to_true = rcond == Monotonic::Increasing;\n\n if (rcond == Monotonic::Constant) {\n result = unify(ra, rb);\n } else if ((unified == Monotonic::Increasing || unified == Monotonic::Constant) &&\n ((switches_from_false_to_true && true_value_ge_false_value) ||\n (switches_from_true_to_false && true_value_le_false_value))) {\n \/\/ Both paths increase, and the condition makes it switch\n \/\/ from the lesser path to the greater path.\n result = Monotonic::Increasing;\n } else if ((unified == Monotonic::Decreasing || unified == Monotonic::Constant) &&\n ((switches_from_false_to_true && true_value_le_false_value) ||\n (switches_from_true_to_false && true_value_ge_false_value))) {\n \/\/ Both paths decrease, and the condition makes it switch\n \/\/ from the greater path to the lesser path.\n result = Monotonic::Decreasing;\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Load *op) {\n op->index.accept(this);\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Ramp *op) {\n internal_error << \"Monotonic of vector\\n\";\n }\n\n void visit(const Broadcast *op) {\n internal_error << \"Monotonic of vector\\n\";\n }\n\n void visit(const Call *op) {\n \/\/ Some functions are known to be monotonic\n if (op->is_intrinsic(Call::likely)) {\n op->args[0].accept(this);\n return;\n }\n\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n return;\n }\n }\n result = Monotonic::Constant;\n }\n\n void visit(const Let *op) {\n op->value.accept(this);\n\n if (result == Monotonic::Constant) {\n \/\/ No point pushing it if it's constant w.r.t the var,\n \/\/ because unknown variables are treated as constant.\n op->body.accept(this);\n } else {\n scope.push(op->name, result);\n op->body.accept(this);\n scope.pop(op->name);\n }\n }\n\n void visit(const LetStmt *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const AssertStmt *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const ProducerConsumer *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const For *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Store *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Provide *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Allocate *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Free *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Realize *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Block *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const IfThenElse *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Evaluate *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\npublic:\n Monotonic result;\n\n MonotonicVisitor(const std::string &v) : var(v), result(Monotonic::Unknown) {}\n};\n\nMonotonic is_monotonic(Expr e, const std::string &var) {\n if (!e.defined()) return Monotonic::Unknown;\n MonotonicVisitor m(var);\n e.accept(&m);\n return m.result;\n}\n\nnamespace {\nvoid check_increasing(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Increasing)\n << \"Was supposed to be increasing: \" << e << \"\\n\";\n}\n\nvoid check_decreasing(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Decreasing)\n << \"Was supposed to be decreasing: \" << e << \"\\n\";\n}\n\nvoid check_constant(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Constant)\n << \"Was supposed to be constant: \" << e << \"\\n\";\n}\n\nvoid check_unknown(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Unknown)\n << \"Was supposed to be unknown: \" << e << \"\\n\";\n}\n}\n\nvoid is_monotonic_test() {\n\n Expr x = Variable::make(Int(32), \"x\");\n Expr y = Variable::make(Int(32), \"y\");\n\n check_increasing(x);\n check_increasing(x+4);\n check_increasing(x+y);\n check_increasing(x*4);\n check_increasing(min(x+4, y+4));\n check_increasing(max(x+y, x-y));\n check_increasing(x >= y);\n check_increasing(x > y);\n\n check_decreasing(-x);\n check_decreasing(x*-4);\n check_decreasing(y - x);\n check_decreasing(x < y);\n check_decreasing(x <= y);\n\n check_unknown(x == y);\n check_unknown(x != y);\n check_unknown(x*y);\n\n check_increasing(select(y == 2, x, x+4));\n check_decreasing(select(y == 2, -x, x*-4));\n\n check_increasing(select(x > 2, x+1, x));\n check_increasing(select(x < 2, x, x+1));\n check_decreasing(select(x > 2, -x-1, -x));\n check_decreasing(select(x < 2, -x, -x-1));\n\n check_unknown(select(x < 2, x, x-5));\n check_unknown(select(x > 2, x-5, x));\n\n check_constant(y);\n\n check_increasing(select(x < 17, y, y+1));\n check_increasing(select(x > 17, y, y-1));\n check_decreasing(select(x < 17, y, y-1));\n check_decreasing(select(x > 17, y, y+1));\n\n check_constant(select(y > 3, y + 23, y - 65));\n\n std::cout << \"is_monotonic test passed\" << std::endl;\n}\n\n\n}\n}\nDelete dead code#include \"Monotonic.h\"\n#include \"IRMutator.h\"\n#include \"Substitute.h\"\n#include \"Scope.h\"\n#include \"Simplify.h\"\n#include \"IROperator.h\"\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\n\nclass MonotonicVisitor : public IRVisitor {\n const string &var;\n\n Scope scope;\n\n void visit(const IntImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const UIntImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const FloatImm *) {\n result = Monotonic::Constant;\n }\n\n void visit(const StringImm *) {\n internal_error << \"Monotonic on String\\n\";\n }\n\n void visit(const Cast *op) {\n op->value.accept(this);\n\n if (op->type.can_represent(op->value.type())) {\n \/\/ No overflow.\n return;\n }\n\n if (op->value.type().bits() >= 32 && op->type.bits() >= 32) {\n \/\/ We assume 32-bit types don't overflow.\n return;\n }\n\n \/\/ A narrowing cast. There may be more cases we can catch, but\n \/\/ for now we punt.\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Variable *op) {\n if (op->name == var) {\n result = Monotonic::Increasing;\n } else if (scope.contains(op->name)) {\n result = scope.get(op->name);\n } else {\n result = Monotonic::Constant;\n }\n }\n\n Monotonic flip(Monotonic r) {\n switch (r) {\n case Monotonic::Increasing: return Monotonic::Decreasing;\n case Monotonic::Decreasing: return Monotonic::Increasing;\n default: return r;\n }\n }\n\n Monotonic unify(Monotonic a, Monotonic b) {\n if (a == b) {\n return a;\n }\n\n if (a == Monotonic::Unknown || b == Monotonic::Unknown) {\n return Monotonic::Unknown;\n }\n\n if (a == Monotonic::Constant) {\n return b;\n }\n\n if (b == Monotonic::Constant) {\n return a;\n }\n\n return Monotonic::Unknown;\n }\n\n void visit(const Add *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Sub *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, flip(rb));\n }\n\n void visit(const Mul *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else if (is_positive_const(op->a)) {\n result = rb;\n } else if (is_positive_const(op->b)) {\n result = ra;\n } else if (is_negative_const(op->a)) {\n result = flip(rb);\n } else if (is_negative_const(op->b)) {\n result = flip(ra);\n } else {\n result = Monotonic::Unknown;\n }\n\n }\n\n void visit(const Div *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else if (is_positive_const(op->b)) {\n result = ra;\n } else if (is_negative_const(op->b)) {\n result = flip(ra);\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Mod *op) {\n result = Monotonic::Unknown;\n }\n\n void visit(const Min *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Max *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit_eq(Expr a, Expr b) {\n a.accept(this);\n Monotonic ra = result;\n b.accept(this);\n Monotonic rb = result;\n if (ra == Monotonic::Constant && rb == Monotonic::Constant) {\n result = Monotonic::Constant;\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const EQ *op) {\n visit_eq(op->a, op->b);\n }\n\n void visit(const NE *op) {\n visit_eq(op->a, op->b);\n }\n\n void visit_lt(Expr a, Expr b) {\n a.accept(this);\n Monotonic ra = result;\n b.accept(this);\n Monotonic rb = result;\n result = unify(flip(ra), rb);\n }\n\n void visit(const LT *op) {\n visit_lt(op->a, op->b);\n }\n\n void visit(const LE *op) {\n visit_lt(op->a, op->b);\n }\n\n void visit(const GT *op) {\n visit_lt(op->b, op->a);\n }\n\n void visit(const GE *op) {\n visit_lt(op->b, op->a);\n }\n\n void visit(const And *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Or *op) {\n op->a.accept(this);\n Monotonic ra = result;\n op->b.accept(this);\n Monotonic rb = result;\n result = unify(ra, rb);\n }\n\n void visit(const Not *op) {\n op->a.accept(this);\n result = flip(result);\n }\n\n void visit(const Select *op) {\n op->condition.accept(this);\n Monotonic rcond = result;\n\n op->true_value.accept(this);\n Monotonic ra = result;\n op->false_value.accept(this);\n Monotonic rb = result;\n Monotonic unified = unify(ra, rb);\n\n if (rcond == Monotonic::Constant) {\n result = unified;\n return;\n }\n\n bool true_value_ge_false_value = is_one(simplify(op->true_value >= op->false_value));\n bool true_value_le_false_value = is_one(simplify(op->true_value <= op->false_value));\n\n bool switches_from_true_to_false = rcond == Monotonic::Decreasing;\n bool switches_from_false_to_true = rcond == Monotonic::Increasing;\n\n if ((unified == Monotonic::Increasing || unified == Monotonic::Constant) &&\n ((switches_from_false_to_true && true_value_ge_false_value) ||\n (switches_from_true_to_false && true_value_le_false_value))) {\n \/\/ Both paths increase, and the condition makes it switch\n \/\/ from the lesser path to the greater path.\n result = Monotonic::Increasing;\n } else if ((unified == Monotonic::Decreasing || unified == Monotonic::Constant) &&\n ((switches_from_false_to_true && true_value_le_false_value) ||\n (switches_from_true_to_false && true_value_ge_false_value))) {\n \/\/ Both paths decrease, and the condition makes it switch\n \/\/ from the greater path to the lesser path.\n result = Monotonic::Decreasing;\n } else {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Load *op) {\n op->index.accept(this);\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n }\n }\n\n void visit(const Ramp *op) {\n internal_error << \"Monotonic of vector\\n\";\n }\n\n void visit(const Broadcast *op) {\n internal_error << \"Monotonic of vector\\n\";\n }\n\n void visit(const Call *op) {\n \/\/ Some functions are known to be monotonic\n if (op->is_intrinsic(Call::likely)) {\n op->args[0].accept(this);\n return;\n }\n\n for (size_t i = 0; i < op->args.size(); i++) {\n op->args[i].accept(this);\n if (result != Monotonic::Constant) {\n result = Monotonic::Unknown;\n return;\n }\n }\n result = Monotonic::Constant;\n }\n\n void visit(const Let *op) {\n op->value.accept(this);\n\n if (result == Monotonic::Constant) {\n \/\/ No point pushing it if it's constant w.r.t the var,\n \/\/ because unknown variables are treated as constant.\n op->body.accept(this);\n } else {\n scope.push(op->name, result);\n op->body.accept(this);\n scope.pop(op->name);\n }\n }\n\n void visit(const LetStmt *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const AssertStmt *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const ProducerConsumer *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const For *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Store *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Provide *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Allocate *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Free *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Realize *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Block *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const IfThenElse *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\n void visit(const Evaluate *op) {\n internal_error << \"Monotonic of statement\\n\";\n }\n\npublic:\n Monotonic result;\n\n MonotonicVisitor(const std::string &v) : var(v), result(Monotonic::Unknown) {}\n};\n\nMonotonic is_monotonic(Expr e, const std::string &var) {\n if (!e.defined()) return Monotonic::Unknown;\n MonotonicVisitor m(var);\n e.accept(&m);\n return m.result;\n}\n\nnamespace {\nvoid check_increasing(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Increasing)\n << \"Was supposed to be increasing: \" << e << \"\\n\";\n}\n\nvoid check_decreasing(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Decreasing)\n << \"Was supposed to be decreasing: \" << e << \"\\n\";\n}\n\nvoid check_constant(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Constant)\n << \"Was supposed to be constant: \" << e << \"\\n\";\n}\n\nvoid check_unknown(Expr e) {\n internal_assert(is_monotonic(e, \"x\") == Monotonic::Unknown)\n << \"Was supposed to be unknown: \" << e << \"\\n\";\n}\n}\n\nvoid is_monotonic_test() {\n\n Expr x = Variable::make(Int(32), \"x\");\n Expr y = Variable::make(Int(32), \"y\");\n\n check_increasing(x);\n check_increasing(x+4);\n check_increasing(x+y);\n check_increasing(x*4);\n check_increasing(min(x+4, y+4));\n check_increasing(max(x+y, x-y));\n check_increasing(x >= y);\n check_increasing(x > y);\n\n check_decreasing(-x);\n check_decreasing(x*-4);\n check_decreasing(y - x);\n check_decreasing(x < y);\n check_decreasing(x <= y);\n\n check_unknown(x == y);\n check_unknown(x != y);\n check_unknown(x*y);\n\n check_increasing(select(y == 2, x, x+4));\n check_decreasing(select(y == 2, -x, x*-4));\n\n check_increasing(select(x > 2, x+1, x));\n check_increasing(select(x < 2, x, x+1));\n check_decreasing(select(x > 2, -x-1, -x));\n check_decreasing(select(x < 2, -x, -x-1));\n\n check_unknown(select(x < 2, x, x-5));\n check_unknown(select(x > 2, x-5, x));\n\n check_constant(y);\n\n check_increasing(select(x < 17, y, y+1));\n check_increasing(select(x > 17, y, y-1));\n check_decreasing(select(x < 17, y, y-1));\n check_decreasing(select(x > 17, y, y+1));\n\n check_constant(select(y > 3, y + 23, y - 65));\n\n std::cout << \"is_monotonic test passed\" << std::endl;\n}\n\n\n}\n}\n<|endoftext|>"} {"text":"\/*-------------------------------------------------------------------------\n *\n * FILE\n *\tcursor.cxx\n *\n * DESCRIPTION\n * implementation of the pqxx::Cursor class.\n * pqxx::Cursor represents a database cursor.\n *\n * Copyright (c) 2001-2004, Jeroen T. Vermeulen \n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\n *-------------------------------------------------------------------------\n *\/\n#include \"pqxx\/compiler.h\"\n\n#include \n\n#include \"pqxx\/cursor\"\n#include \"pqxx\/result\"\n#include \"pqxx\/transaction\"\n\nusing namespace PGSTD;\n\n\nint pqxx::cursor_base::get_unique_cursor_num()\n{\n if (!m_context) throw logic_error(\"libpqxx internal error: \"\n \"cursor in get_unique_cursor_num() has no transaction\");\n return m_context->GetUniqueCursorNum();\n}\n\n\nunsigned char pqxx::cursor_base::s_dummy;\n\n\npqxx::icursorstream::icursorstream(pqxx::transaction_base &context,\n const string &query,\n const string &basename,\n size_type stride) :\n cursor_base(&context, basename),\n m_stride(stride)\n{\n set_stride(stride);\n declare(query);\n}\n\nvoid pqxx::icursorstream::set_stride(size_type n)\n{\n if (n < 1)\n throw invalid_argument(\"Attempt to set cursor stride to \" + to_string(n));\n m_stride = n;\n}\n\nvoid pqxx::icursorstream::declare(const string &query)\n{\n m_context->exec(\"DECLARE \\\"\" + name() + \"\\\" \"\n \t\t\"NO SCROLL CURSOR FOR \" + query + \" FOR READ ONLY\",\n\t\"[DECLARE \"+name()+\"]\");\n}\n\n\npqxx::result pqxx::icursorstream::fetch()\n{\n result r(m_context->exec(\"FETCH \"+to_string(m_stride)+\" IN \\\"\"+name()+\"\\\"\"));\n if (r.empty()) m_done = true;\n return r;\n}\n\n\npqxx::icursorstream &pqxx::icursorstream::ignore(streamsize n)\n{\n m_context->exec(\"MOVE \" + to_string(n) + \" IN \\\"\" + name() + \"\\\"\");\n return *this;\n}\n\n\nFixed incompatibility with pre-7.4 backends\/*-------------------------------------------------------------------------\n *\n * FILE\n *\tcursor.cxx\n *\n * DESCRIPTION\n * implementation of the pqxx::Cursor class.\n * pqxx::Cursor represents a database cursor.\n *\n * Copyright (c) 2001-2004, Jeroen T. Vermeulen \n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\n *-------------------------------------------------------------------------\n *\/\n#include \"pqxx\/compiler.h\"\n\n#include \n\n#include \"pqxx\/cursor\"\n#include \"pqxx\/result\"\n#include \"pqxx\/transaction\"\n\nusing namespace PGSTD;\n\n\nint pqxx::cursor_base::get_unique_cursor_num()\n{\n if (!m_context) throw logic_error(\"libpqxx internal error: \"\n \"cursor in get_unique_cursor_num() has no transaction\");\n return m_context->GetUniqueCursorNum();\n}\n\n\nunsigned char pqxx::cursor_base::s_dummy;\n\n\npqxx::icursorstream::icursorstream(pqxx::transaction_base &context,\n const string &query,\n const string &basename,\n size_type stride) :\n cursor_base(&context, basename),\n m_stride(stride)\n{\n set_stride(stride);\n declare(query);\n}\n\nvoid pqxx::icursorstream::set_stride(size_type n)\n{\n if (n < 1)\n throw invalid_argument(\"Attempt to set cursor stride to \" + to_string(n));\n m_stride = n;\n}\n\nvoid pqxx::icursorstream::declare(const string &query)\n{\n \/\/ TODO: Add NO SCROLL if backend supports it (7.4 or better)\n stringstream cq, qn;\n cq << \"DECLARE \\\"\" << name() << \"\\\" CURSOR FOR \" << query << \" FOR READ ONLY\";\n qn << \"[DECLARE \" << name() << ']';\n m_context->exec(cq, qn.str());\n}\n\n\npqxx::result pqxx::icursorstream::fetch()\n{\n result r(m_context->exec(\"FETCH \"+to_string(m_stride)+\" IN \\\"\"+name()+\"\\\"\"));\n if (r.empty()) m_done = true;\n return r;\n}\n\n\npqxx::icursorstream &pqxx::icursorstream::ignore(streamsize n)\n{\n m_context->exec(\"MOVE \" + to_string(n) + \" IN \\\"\" + name() + \"\\\"\");\n return *this;\n}\n\n\n<|endoftext|>"} {"text":"\/*-------------------------------------------------------------------------\n *\n * FILE\n *\tresult.cxx\n *\n * DESCRIPTION\n * implementation of the pqxx::result class and support classes.\n * pqxx::result represents the set of result tuples from a database query\n *\n * Copyright (c) 2001-2004, Jeroen T. Vermeulen \n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\n *-------------------------------------------------------------------------\n *\/\n#include \"pqxx\/compiler.h\"\n\n#include \t\/\/ DEBUG CODE\n#include \n\n#include \"pqxx\/except\"\n#include \"pqxx\/result\"\n\n\nusing namespace PGSTD;\n\n\npqxx::result &pqxx::result::operator=(const pqxx::result &Other) throw ()\n{\n assert(!m_Result || ((Other.m_Result==m_Result) == (&Other==this)));\n\n if (&Other != this)\n {\n LoseRef();\n MakeRef(Other);\n }\n\n assert(m_l->m_r == this);\n assert(m_r->m_l == this);\n assert((m_l!=m_r) || ((m_l->m_l==this) && (m_r->m_r==this)));\n\n return *this;\n}\n\n\npqxx::result &pqxx::result::operator=(PGresult *Other) throw ()\n{\n if (Other != m_Result)\n {\n LoseRef();\n MakeRef(Other);\n }\n return *this;\n}\n\n\nvoid pqxx::result::swap(pqxx::result &other) throw ()\n{\n const result *const l=m_l, *const r=m_r;\n PGresult *p(m_Result);\n\n m_l = other.m_l;\n m_r = other.m_r;\n m_Result = other.m_Result;\n other.m_l = l;\n other.m_r = r;\n other.m_Result = p;\n}\n\n\nconst pqxx::result::tuple pqxx::result::at(pqxx::result::size_type i) const\n throw (out_of_range)\n{\n if ((i < 0) || (i >= size()))\n throw out_of_range(\"Tuple number out of range\");\n\n return operator[](i);\n}\n\n\nvoid pqxx::result::CheckStatus(const string &Query) const\n{\n const string Err = StatusError();\n if (!Err.empty()) throw sql_error(Err, Query);\n}\n\n\nvoid pqxx::result::CheckStatus(const char Query[]) const\n{\n const string Err = StatusError();\n if (!Err.empty()) throw sql_error(Err, string(Query ? Query : \"\"));\n}\n\n\nstring pqxx::result::StatusError() const\n{\n if (!m_Result)\n throw runtime_error(\"No result\");\n\n string Err;\n\n switch (PQresultStatus(m_Result))\n {\n case PGRES_EMPTY_QUERY: \/\/ The string sent to the backend was empty.\n case PGRES_COMMAND_OK: \/\/ Successful completion of a command returning no data\n case PGRES_TUPLES_OK: \/\/ The query successfully executed\n break;\n\n case PGRES_COPY_OUT: \/\/ Copy Out (from server) data transfer started\n case PGRES_COPY_IN: \/\/ Copy In (to server) data transfer started\n break;\n\n case PGRES_BAD_RESPONSE: \/\/ The server's response was not understood\n case PGRES_NONFATAL_ERROR:\n case PGRES_FATAL_ERROR:\n Err = PQresultErrorMessage(m_Result);\n break;\n\n default:\n throw logic_error(\"libpqxx internal error: \"\n\t\t \"pqxx::result: Unrecognized response code \" +\n\t\t to_string(int(PQresultStatus(m_Result))));\n }\n return Err;\n}\n\n\nvoid pqxx::result::MakeRef(PGresult *Other) throw ()\n{\n assert(m_l == this);\n assert(m_r == this);\n assert(!m_Result);\n\n m_Result = Other;\n}\n\n\nvoid pqxx::result::MakeRef(const pqxx::result &Other) throw ()\n{\n assert(m_l == this);\n assert(m_r == this);\n assert(!m_Result);\n\n m_l = &Other;\n m_r = Other.m_r;\n\n assert(m_r->m_l == m_l);\n assert(m_l->m_r == m_r);\n\n m_l->m_r = m_r->m_l = this;\n m_Result = Other.m_Result;\n\n assert(m_l->m_r == this);\n assert(m_r->m_l == this);\n assert((m_l!=m_r) || ((m_l->m_l==this) && (m_r->m_r==this)));\n}\n\n\nvoid pqxx::result::LoseRef() throw ()\n{\n assert(m_l->m_r == this);\n assert(m_r->m_l == this);\n assert((m_l!=m_r) || ((m_l->m_l==this) && (m_r->m_r==this)));\n\n if (m_l == this)\n {\n assert(m_r == this);\n if (m_Result) PQclear(m_Result);\n }\n m_Result = 0;\n m_l->m_r = m_r;\n m_r->m_l = m_l;\n m_l = m_r = this;\n\n assert(m_l->m_r == this);\n assert(m_r->m_l == this);\n assert((m_l!=m_r) || ((m_l->m_l==this) && (m_r->m_r==this)));\n}\n\n\n\npqxx::result::size_type pqxx::result::affected_rows() const\n{\n const char *const RowsStr = PQcmdTuples(m_Result);\n return RowsStr[0] ? atoi(RowsStr) : 0;\n}\n\n\nconst char *pqxx::result::GetValue(pqxx::result::size_type Row, \n\t\t pqxx::result::tuple::size_type Col) const\n{\n return PQgetvalue(m_Result, Row, Col);\n}\n\n\nbool pqxx::result::GetIsNull(pqxx::result::size_type Row,\n\t\t pqxx::result::tuple::size_type Col) const\n{\n return PQgetisnull(m_Result, Row, Col) != 0;\n}\n\npqxx::result::field::size_type \npqxx::result::GetLength(pqxx::result::size_type Row,\n pqxx::result::tuple::size_type Col) const\n{\n return PQgetlength(m_Result, Row, Col);\n}\n\n\nint pqxx::result::errorposition() const throw ()\n{\n int pos = -1;\n if (m_Result)\n {\n const char *p = PQresultErrorField(m_Result, PG_DIAG_STATEMENT_POSITION);\n if (p) from_string(p, pos);\n }\n return pos;\n}\n\n\n\/\/ tuple\n\npqxx::result::field pqxx::result::tuple::operator[](const char f[]) const\n{\n return field(*this, m_Home->column_number(f));\n}\n\n\npqxx::result::field pqxx::result::tuple::at(const char f[]) const\n{\n const int fnum = m_Home->column_number(f);\n if (fnum == -1)\n throw invalid_argument(string(\"Unknown field '\") + f + \"'\");\n\n return field(*this, fnum);\n}\n\n\npqxx::result::field \npqxx::result::tuple::at(pqxx::result::tuple::size_type i) const throw (out_of_range)\n{\n if ((i < 0) || (i >= size()))\n throw out_of_range(\"Invalid field number\");\n\n return operator[](i);\n}\n\n\nconst char *\npqxx::result::column_name(pqxx::result::tuple::size_type Number) const\n{\n const char *const N = PQfname(m_Result, Number);\n if (!N) \n throw out_of_range(\"Invalid column number: \" + to_string(Number));\n\n return N;\n}\n\n\npqxx::result::tuple::size_type\npqxx::result::column_number(const char ColName[]) const\n{\n const tuple::size_type N = PQfnumber(m_Result, ColName);\n if (N == -1)\n throw invalid_argument(\"Unknown column name: '\" + string(ColName) + \"'\");\n\n return N;\n}\n\n\n\/\/ const_iterator\n\npqxx::result::const_iterator pqxx::result::const_iterator::operator++(int)\n{\n const_iterator Old(*this);\n m_Index++;\n return Old;\n}\n\n\npqxx::result::const_iterator pqxx::result::const_iterator::operator--(int)\n{\n const_iterator Old(*this);\n m_Index--;\n return Old;\n}\n\n\n\nRemoved debug code\/*-------------------------------------------------------------------------\n *\n * FILE\n *\tresult.cxx\n *\n * DESCRIPTION\n * implementation of the pqxx::result class and support classes.\n * pqxx::result represents the set of result tuples from a database query\n *\n * Copyright (c) 2001-2004, Jeroen T. Vermeulen \n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\n *-------------------------------------------------------------------------\n *\/\n#include \"pqxx\/compiler.h\"\n\n#include \n\n#include \"pqxx\/except\"\n#include \"pqxx\/result\"\n\n\nusing namespace PGSTD;\n\n\npqxx::result &pqxx::result::operator=(const pqxx::result &Other) throw ()\n{\n if (&Other != this)\n {\n LoseRef();\n MakeRef(Other);\n }\n\n return *this;\n}\n\n\npqxx::result &pqxx::result::operator=(PGresult *Other) throw ()\n{\n if (Other != m_Result)\n {\n LoseRef();\n MakeRef(Other);\n }\n return *this;\n}\n\n\nvoid pqxx::result::swap(pqxx::result &other) throw ()\n{\n const result *const l=m_l, *const r=m_r;\n PGresult *p(m_Result);\n\n m_l = other.m_l;\n m_r = other.m_r;\n m_Result = other.m_Result;\n other.m_l = l;\n other.m_r = r;\n other.m_Result = p;\n}\n\n\nconst pqxx::result::tuple pqxx::result::at(pqxx::result::size_type i) const\n throw (out_of_range)\n{\n if ((i < 0) || (i >= size()))\n throw out_of_range(\"Tuple number out of range\");\n\n return operator[](i);\n}\n\n\nvoid pqxx::result::CheckStatus(const string &Query) const\n{\n const string Err = StatusError();\n if (!Err.empty()) throw sql_error(Err, Query);\n}\n\n\nvoid pqxx::result::CheckStatus(const char Query[]) const\n{\n const string Err = StatusError();\n if (!Err.empty()) throw sql_error(Err, string(Query ? Query : \"\"));\n}\n\n\nstring pqxx::result::StatusError() const\n{\n if (!m_Result)\n throw runtime_error(\"No result\");\n\n string Err;\n\n switch (PQresultStatus(m_Result))\n {\n case PGRES_EMPTY_QUERY: \/\/ The string sent to the backend was empty.\n case PGRES_COMMAND_OK: \/\/ Successful completion of a command returning no data\n case PGRES_TUPLES_OK: \/\/ The query successfully executed\n break;\n\n case PGRES_COPY_OUT: \/\/ Copy Out (from server) data transfer started\n case PGRES_COPY_IN: \/\/ Copy In (to server) data transfer started\n break;\n\n case PGRES_BAD_RESPONSE: \/\/ The server's response was not understood\n case PGRES_NONFATAL_ERROR:\n case PGRES_FATAL_ERROR:\n Err = PQresultErrorMessage(m_Result);\n break;\n\n default:\n throw logic_error(\"libpqxx internal error: \"\n\t\t \"pqxx::result: Unrecognized response code \" +\n\t\t to_string(int(PQresultStatus(m_Result))));\n }\n return Err;\n}\n\n\nvoid pqxx::result::MakeRef(PGresult *Other) throw ()\n{\n m_Result = Other;\n}\n\n\nvoid pqxx::result::MakeRef(const pqxx::result &Other) throw ()\n{\n m_l = &Other;\n m_r = Other.m_r;\n\n m_l->m_r = m_r->m_l = this;\n m_Result = Other.m_Result;\n}\n\n\nvoid pqxx::result::LoseRef() throw ()\n{\n if ((m_l == this) && m_Result) PQclear(m_Result);\n m_Result = 0;\n m_l->m_r = m_r;\n m_r->m_l = m_l;\n m_l = m_r = this;\n}\n\n\n\npqxx::result::size_type pqxx::result::affected_rows() const\n{\n const char *const RowsStr = PQcmdTuples(m_Result);\n return RowsStr[0] ? atoi(RowsStr) : 0;\n}\n\n\nconst char *pqxx::result::GetValue(pqxx::result::size_type Row, \n\t\t pqxx::result::tuple::size_type Col) const\n{\n return PQgetvalue(m_Result, Row, Col);\n}\n\n\nbool pqxx::result::GetIsNull(pqxx::result::size_type Row,\n\t\t pqxx::result::tuple::size_type Col) const\n{\n return PQgetisnull(m_Result, Row, Col) != 0;\n}\n\npqxx::result::field::size_type \npqxx::result::GetLength(pqxx::result::size_type Row,\n pqxx::result::tuple::size_type Col) const\n{\n return PQgetlength(m_Result, Row, Col);\n}\n\n\nint pqxx::result::errorposition() const throw ()\n{\n int pos = -1;\n if (m_Result)\n {\n const char *p = PQresultErrorField(m_Result, PG_DIAG_STATEMENT_POSITION);\n if (p) from_string(p, pos);\n }\n return pos;\n}\n\n\n\/\/ tuple\n\npqxx::result::field pqxx::result::tuple::operator[](const char f[]) const\n{\n return field(*this, m_Home->column_number(f));\n}\n\n\npqxx::result::field pqxx::result::tuple::at(const char f[]) const\n{\n const int fnum = m_Home->column_number(f);\n if (fnum == -1)\n throw invalid_argument(string(\"Unknown field '\") + f + \"'\");\n\n return field(*this, fnum);\n}\n\n\npqxx::result::field \npqxx::result::tuple::at(pqxx::result::tuple::size_type i) const throw (out_of_range)\n{\n if ((i < 0) || (i >= size()))\n throw out_of_range(\"Invalid field number\");\n\n return operator[](i);\n}\n\n\nconst char *\npqxx::result::column_name(pqxx::result::tuple::size_type Number) const\n{\n const char *const N = PQfname(m_Result, Number);\n if (!N) \n throw out_of_range(\"Invalid column number: \" + to_string(Number));\n\n return N;\n}\n\n\npqxx::result::tuple::size_type\npqxx::result::column_number(const char ColName[]) const\n{\n const tuple::size_type N = PQfnumber(m_Result, ColName);\n if (N == -1)\n throw invalid_argument(\"Unknown column name: '\" + string(ColName) + \"'\");\n\n return N;\n}\n\n\n\/\/ const_iterator\n\npqxx::result::const_iterator pqxx::result::const_iterator::operator++(int)\n{\n const_iterator Old(*this);\n m_Index++;\n return Old;\n}\n\n\npqxx::result::const_iterator pqxx::result::const_iterator::operator--(int)\n{\n const_iterator Old(*this);\n m_Index--;\n return Old;\n}\n\n\n\n<|endoftext|>"} {"text":"#include \"RapidDecay.h\"\n\n#include \n\n#include \"TMath.h\"\n#include \"TRandom.h\"\n\n#include \"RapidExternalEvtGen.h\"\n#include \"RapidMomentumSmearGauss.h\"\n#include \"RapidMomentumSmearHisto.h\"\n#include \"RapidParam.h\"\n#include \"RapidParticle.h\"\n#include \"RapidParticleData.h\"\n\nvoid RapidDecay::setParentKinematics(TH1* ptHisto, TH1* etaHisto) {\n\tstd::cout << \"INFO in RapidDecay::setParentKinematics : setting kinematics of the parent.\" << std::endl;\n\tptHisto_=ptHisto;\n\tetaHisto_=etaHisto;\n}\n\nvoid RapidDecay::setAcceptRejectHist(TH1* histo, RapidParam* param) {\n\taccRejParameterX_ = param;\n\taccRejParameterY_ = 0;\n\taccRejHisto_ = histo;\n\n\t\/\/correct the histogram to account for the the phasespace distribution\n\tTH1* denom = generateAccRejDenominator1D();\n\taccRejHisto_->Divide(denom);\n\tdelete denom;\n}\n\nvoid RapidDecay::setAcceptRejectHist(TH1* histo, RapidParam* paramX, RapidParam* paramY) {\n\taccRejParameterX_ = paramX;\n\taccRejParameterY_ = paramY;\n\taccRejHisto_ = histo;\n\n\t\/\/correct the histogram to account for the the phasespace distribution\n\tTH2* denom = generateAccRejDenominator2D();\n\taccRejHisto_->Divide(denom);\n\tdelete denom;\n}\n\nvoid RapidDecay::setExternal(RapidExternalGenerator* external) {\n\texternal_ = external;\n}\n\nbool RapidDecay::checkDecay() {\n\tfor(unsigned int i=0; inDaughters()>0) {\n\t\t\tif(!decay_.SetDecay(part->getP(), part->nDaughters(), part->daughterMasses())) {\n\t\t\t\tstd::cout << \"ERROR in RapidDecay::checkDecay : decay of \" << part->name() << \" is kinematically forbidden.\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool RapidDecay::generate() {\n\t\/\/keep resonance masses and parent kinematics independent of the accept\/reject decision\n\t\/\/these will only be biased if the function is very inefficient for certain values\n\t\/\/however, one should not use an a\/r function the is highly correlated to these variables\n\tfloatMasses();\n\tgenParent();\n\n\tbool decayed(false);\n\tif(external_) {\n\t\tdecayed = external_->decay(parts_);\n\t}\n\t\n\tif(!decayed) {\n\t\tif(accRejHisto_) {\n\t\t\tif(!genDecayAccRej()) return false;\n\n\t\t} else {\n\t\t\tif(!genDecay()) return false;\n\t\t}\n\t}\n\n\tsmearMomenta();\n smearIPs();\n\n\treturn true;\n}\n\nvoid RapidDecay::smearMomenta() {\n\t\/\/run backwards so that we reach the daughters first\n\tfor(int i=parts_.size()-1; i>=0; --i) {\/\/don't change to unsigned - needs to hit -1 to break loop\n\t\tparts_[i]->smearMomentum();\n\t}\n\n}\n\nvoid RapidDecay::smearIPs() {\n \/\/run backwards so that we reach the daughters first\n for(int i=parts_.size()-1; i>=0; --i) {\/\/don't change to unsigned - needs to hit -1 to break loop\n parts_[i]->smearIP();\n }\n}\n\nvoid RapidDecay::setup() {\n\tsetupMasses();\n\n\tstd::cout << \"INFO in RapidDecay::setup : Particle summary follows:\" << std::endl;\n\tprintf(\"index\\tlabel\\t\\t ID\\t\\tmass (GeV\/c^2)\\tparent\\t\\t# children\\tchildren\\n\");\n\tfor(unsigned int i=0; iprint(i);\n\t}\n}\n\nvoid RapidDecay::floatMasses() {\n\tfor(unsigned int i=0; ifloatMass();\n\t}\n}\n\nvoid RapidDecay::setupMasses() {\n\tRapidParticleData* particleData = RapidParticleData::getInstance();\n\n\tfor(unsigned int i=0; isetupMass(parts_[i]);\n\t}\n}\n\nbool RapidDecay::runAcceptReject() {\n\tif(accRejParameterY_) return runAcceptReject2D();\n\telse return runAcceptReject1D();\n}\n\nbool RapidDecay::runAcceptReject1D() {\n\tdouble val = accRejParameterX_->eval();\n\tint bin = accRejHisto_->FindBin(val);\n\n\tdouble score(0.);\n\tif(!accRejHisto_->IsBinOverflow(bin) && !accRejHisto_->IsBinUnderflow(bin)) {\n\t\tscore = accRejHisto_->Interpolate(val);\n\t}\n\tdouble max = accRejHisto_->GetMaximum();\n\tif(score > gRandom->Uniform(max)) return true;\n\treturn false;\n}\n\nbool RapidDecay::runAcceptReject2D() {\n\tdouble valX = accRejParameterX_->eval();\n\tdouble valY = accRejParameterY_->eval();\n\tint bin = accRejHisto_->FindBin(valX,valY);\n\n\tdouble score(0.);\n\tif(!accRejHisto_->IsBinOverflow(bin) && !accRejHisto_->IsBinUnderflow(bin)) {\n\t\tscore = accRejHisto_->Interpolate(valX,valY);\n\t}\n\tdouble max = accRejHisto_->GetMaximum();\n\tif(score > gRandom->Uniform(max)) return true;\n\treturn false;\n}\n\nTH1* RapidDecay::generateAccRejDenominator1D() {\n\tTH1* denomHisto = dynamic_cast(accRejHisto_->Clone(\"denom\"));\n\tdenomHisto->Reset();\n\n\tstd::cout << \"INFO in RapidDecay::generateAccRejDenominator : generating 1M decays to remove the \\\"phasespace\\\" distribution...\" << std::endl;\n\tfor(int i=0; i<1000000; ++i) {\n\t\tfloatMasses();\n\t\tgenParent();\n\t\tif(!genDecay(true)) continue;\n\t\tdenomHisto->Fill(accRejParameterX_->eval());\n\t}\n\treturn denomHisto;\n}\n\nTH2* RapidDecay::generateAccRejDenominator2D() {\n\tTH2* denomHisto = dynamic_cast(accRejHisto_->Clone(\"denom\"));\n\tdenomHisto->Reset();\n\n\tstd::cout << \"INFO in RapidDecay::generateAccRejDenominator : generating 1M decays to remove the \\\"phasespace\\\" distribution...\" << std::endl;\n\tfor(int i=0; i<1000000; ++i) {\n\t\tfloatMasses();\n\t\tgenParent();\n\t\tif(!genDecay(true)) continue;\n\t\tdenomHisto->Fill(accRejParameterX_->eval(), accRejParameterY_->eval());\n\t}\n\treturn denomHisto;\n}\n\nvoid RapidDecay::genParent() {\n\tdouble pt(0), eta(0), phi(gRandom->Uniform(0,2*TMath::Pi()));\n\tif(ptHisto_) pt = ptHisto_->GetRandom();\n\tif(etaHisto_) eta = etaHisto_->GetRandom();\n\tparts_[0]->setPtEtaPhi(pt,eta,phi);\n}\n\nbool RapidDecay::genDecay(bool acceptAny) {\n \/\/The origin vertex of the signal is always 0,0,0\n ROOT::Math::XYZPoint signalpv(0.,0.,0.);\n\tfor(unsigned int i=0; inDaughters()>0) {\n\t\t\t\/\/ check decay kinematics valid\n\t\t\tif(!decay_.SetDecay(part->getP(), part->nDaughters(), part->daughterMasses())) {\n\t\t\t\tif(!suppressKinematicWarning_) {\n\t\t\t\t\tstd::cout << \"WARNING in RapidDecay::genDecay : decay of \" << part->name() << \" is kinematically forbidden for some events due to resonance mass shapes.\" << std::endl\n\t\t\t\t\t\t << \" these events will not be generated.\" << std::endl\n\t\t\t\t\t\t << \" further warnings will be suppressed.\" << std::endl;\n\t\t\t\t\tsuppressKinematicWarning_ = true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ make an event\n\t\t\tif(acceptAny) {\n\t\t\t\tdecay_.Generate();\n\t\t\t} else {\n\t\t\t\tint nGen(0);\n\t\t\t\tbool accept(false);\n\t\t\t\twhile (nGen < maxgen_ && accept == false){\n\t\t\t\t\taccept = decay_.Generate() > gRandom->Uniform();\n\t\t\t\t\t++nGen;\n\t\t\t\t} \/\/ while\n\n\t\t\t\tif(!accept) {\n\t\t\t\t\tif(!suppressAttemptsWarning_) {\n\t\t\t\t\t\tstd::cout << \"WARNING in RapidDecay::genDecay : rejected all \" << maxgen_ << \" attempts to decay \" << part->name() << \".\" << std::endl\n\t\t\t\t\t\t\t << \" this event will not be generated.\" << std::endl\n\t\t\t\t\t\t\t << \" further warnings will be suppressed.\" << std::endl;\n\t\t\t\t\tsuppressAttemptsWarning_ = true;\n\t\t\t\t\t}\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n \/\/ Now generate the decay vertex for long-lived particles\n \/\/ First set the origin vertex to be the PV for the head of the chain\n \/\/ in all other cases, the origin vertex will already be set in the loop below\n if (!part->mother()) part->setOriginVertex(signalpv);\n double dist = part->mass()*gRandom->Exp(part->ctau())\/part->getP().P();\n double dvx = part->getOriginVertex().X() + part->getP().Vect().Unit().X()*dist;\n double dvy = part->getOriginVertex().Y() + part->getP().Vect().Unit().Y()*dist;\n double dvz = part->getOriginVertex().Z() + part->getP().Vect().Unit().Z()*dist;\n part->setDecayVertex(ROOT::Math::XYZPoint(dvx,dvy,dvz));\n\n\t\t\tint j=0;\n ROOT::Math::XYZPoint decayvertex(0.,0.,0.); \n\t\t\tfor(RapidParticle* jDaug=part->daughter(0); jDaug!=0; jDaug=jDaug->next()) {\n\t\t\t\tjDaug->setP(*decay_.GetDecay(j++));\n jDaug->setOriginVertex(part->getDecayVertex());\n double ip(0.);\n ip = getParticleIP(signalpv,jDaug->getOriginVertex(),jDaug->getP());\n jDaug->setIP(ip);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\ndouble RapidDecay::getParticleIP(ROOT::Math::XYZPoint pv, ROOT::Math::XYZPoint dv, TLorentzVector p) {\n ROOT::Math::XYZVector v1 = pv - dv;\n ROOT::Math::XYZVector dispv(dv.X() + p.X(), dv.Y()+p.Y(), dv.Z()+p.Z());\n ROOT::Math::XYZVector lengthv(p.X(), p.Y(), p.Z());\n ROOT::Math::XYZVector v2 = pv - (dv + dispv);\n\n ROOT::Math::XYZVector impact = v1.Cross(v2)\/sqrt(lengthv.Mag2());\n\n return sqrt(impact.Mag2());\n}\n\nbool RapidDecay::genDecayAccRej() {\n\tbool passAccRej(true);\n\tint ntry(0);\n\n\tdo {\n\t\tif(!genDecay(true)) return false;\n\t\tpassAccRej = runAcceptReject();\n\t\t++ntry;\n\n\t} while(!passAccRej && ntryfix second trivial bug#include \"RapidDecay.h\"\n\n#include \n\n#include \"TMath.h\"\n#include \"TRandom.h\"\n\n#include \"RapidExternalEvtGen.h\"\n#include \"RapidMomentumSmearGauss.h\"\n#include \"RapidMomentumSmearHisto.h\"\n#include \"RapidParam.h\"\n#include \"RapidParticle.h\"\n#include \"RapidParticleData.h\"\n\nvoid RapidDecay::setParentKinematics(TH1* ptHisto, TH1* etaHisto) {\n\tstd::cout << \"INFO in RapidDecay::setParentKinematics : setting kinematics of the parent.\" << std::endl;\n\tptHisto_=ptHisto;\n\tetaHisto_=etaHisto;\n}\n\nvoid RapidDecay::setAcceptRejectHist(TH1* histo, RapidParam* param) {\n\taccRejParameterX_ = param;\n\taccRejParameterY_ = 0;\n\taccRejHisto_ = histo;\n\n\t\/\/correct the histogram to account for the the phasespace distribution\n\tTH1* denom = generateAccRejDenominator1D();\n\taccRejHisto_->Divide(denom);\n\tdelete denom;\n}\n\nvoid RapidDecay::setAcceptRejectHist(TH1* histo, RapidParam* paramX, RapidParam* paramY) {\n\taccRejParameterX_ = paramX;\n\taccRejParameterY_ = paramY;\n\taccRejHisto_ = histo;\n\n\t\/\/correct the histogram to account for the the phasespace distribution\n\tTH2* denom = generateAccRejDenominator2D();\n\taccRejHisto_->Divide(denom);\n\tdelete denom;\n}\n\nvoid RapidDecay::setExternal(RapidExternalGenerator* external) {\n\texternal_ = external;\n}\n\nbool RapidDecay::checkDecay() {\n\tfor(unsigned int i=0; inDaughters()>0) {\n\t\t\tif(!decay_.SetDecay(part->getP(), part->nDaughters(), part->daughterMasses())) {\n\t\t\t\tstd::cout << \"ERROR in RapidDecay::checkDecay : decay of \" << part->name() << \" is kinematically forbidden.\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nbool RapidDecay::generate() {\n\t\/\/keep resonance masses and parent kinematics independent of the accept\/reject decision\n\t\/\/these will only be biased if the function is very inefficient for certain values\n\t\/\/however, one should not use an a\/r function the is highly correlated to these variables\n\tfloatMasses();\n\tgenParent();\n\n\tbool decayed(false);\n\tif(external_) {\n\t\tdecayed = external_->decay(parts_);\n\t}\n\t\n\tif(!decayed) {\n\t\tif(accRejHisto_) {\n\t\t\tif(!genDecayAccRej()) return false;\n\n\t\t} else {\n\t\t\tif(!genDecay()) return false;\n\t\t}\n\t}\n\n\tsmearMomenta();\n smearIPs();\n\n\treturn true;\n}\n\nvoid RapidDecay::smearMomenta() {\n\t\/\/run backwards so that we reach the daughters first\n\tfor(int i=parts_.size()-1; i>=0; --i) {\/\/don't change to unsigned - needs to hit -1 to break loop\n\t\tparts_[i]->smearMomentum();\n\t}\n\n}\n\nvoid RapidDecay::smearIPs() {\n \/\/run backwards so that we reach the daughters first\n for(int i=parts_.size()-1; i>=0; --i) {\/\/don't change to unsigned - needs to hit -1 to break loop\n parts_[i]->smearIP();\n }\n}\n\nvoid RapidDecay::setup() {\n\tsetupMasses();\n\n\tstd::cout << \"INFO in RapidDecay::setup : Particle summary follows:\" << std::endl;\n\tprintf(\"index\\tlabel\\t\\t ID\\t\\tmass (GeV\/c^2)\\tparent\\t\\t# children\\tchildren\\n\");\n\tfor(unsigned int i=0; iprint(i);\n\t}\n}\n\nvoid RapidDecay::floatMasses() {\n\tfor(unsigned int i=0; ifloatMass();\n\t}\n}\n\nvoid RapidDecay::setupMasses() {\n\tRapidParticleData* particleData = RapidParticleData::getInstance();\n\n\tfor(unsigned int i=0; isetupMass(parts_[i]);\n\t}\n}\n\nbool RapidDecay::runAcceptReject() {\n\tif(accRejParameterY_) return runAcceptReject2D();\n\telse return runAcceptReject1D();\n}\n\nbool RapidDecay::runAcceptReject1D() {\n\tdouble val = accRejParameterX_->eval();\n\tint bin = accRejHisto_->FindBin(val);\n\n\tdouble score(0.);\n\tif(!accRejHisto_->IsBinOverflow(bin) && !accRejHisto_->IsBinUnderflow(bin)) {\n\t\tscore = accRejHisto_->Interpolate(val);\n\t}\n\tdouble max = accRejHisto_->GetMaximum();\n\tif(score > gRandom->Uniform(max)) return true;\n\treturn false;\n}\n\nbool RapidDecay::runAcceptReject2D() {\n\tdouble valX = accRejParameterX_->eval();\n\tdouble valY = accRejParameterY_->eval();\n\tint bin = accRejHisto_->FindBin(valX,valY);\n\n\tdouble score(0.);\n\tif(!accRejHisto_->IsBinOverflow(bin) && !accRejHisto_->IsBinUnderflow(bin)) {\n\t\tscore = accRejHisto_->Interpolate(valX,valY);\n\t}\n\tdouble max = accRejHisto_->GetMaximum();\n\tif(score > gRandom->Uniform(max)) return true;\n\treturn false;\n}\n\nTH1* RapidDecay::generateAccRejDenominator1D() {\n\tTH1* denomHisto = dynamic_cast(accRejHisto_->Clone(\"denom\"));\n\tdenomHisto->Reset();\n\n\tstd::cout << \"INFO in RapidDecay::generateAccRejDenominator : generating 1M decays to remove the \\\"phasespace\\\" distribution...\" << std::endl;\n\tfor(int i=0; i<1000000; ++i) {\n\t\tfloatMasses();\n\t\tgenParent();\n\t\tif(!genDecay(true)) continue;\n\t\tdenomHisto->Fill(accRejParameterX_->eval());\n\t}\n\treturn denomHisto;\n}\n\nTH2* RapidDecay::generateAccRejDenominator2D() {\n\tTH2* denomHisto = dynamic_cast(accRejHisto_->Clone(\"denom\"));\n\tdenomHisto->Reset();\n\n\tstd::cout << \"INFO in RapidDecay::generateAccRejDenominator : generating 1M decays to remove the \\\"phasespace\\\" distribution...\" << std::endl;\n\tfor(int i=0; i<1000000; ++i) {\n\t\tfloatMasses();\n\t\tgenParent();\n\t\tif(!genDecay(true)) continue;\n\t\tdenomHisto->Fill(accRejParameterX_->eval(), accRejParameterY_->eval());\n\t}\n\treturn denomHisto;\n}\n\nvoid RapidDecay::genParent() {\n\tdouble pt(0), eta(0), phi(gRandom->Uniform(0,2*TMath::Pi()));\n\tif(ptHisto_) pt = ptHisto_->GetRandom();\n\tif(etaHisto_) eta = etaHisto_->GetRandom();\n\tparts_[0]->setPtEtaPhi(pt,eta,phi);\n}\n\nbool RapidDecay::genDecay(bool acceptAny) {\n \/\/The origin vertex of the signal is always 0,0,0\n ROOT::Math::XYZPoint signalpv(0.,0.,0.);\n\tfor(unsigned int i=0; inDaughters()>0) {\n\t\t\t\/\/ check decay kinematics valid\n\t\t\tif(!decay_.SetDecay(part->getP(), part->nDaughters(), part->daughterMasses())) {\n\t\t\t\tif(!suppressKinematicWarning_) {\n\t\t\t\t\tstd::cout << \"WARNING in RapidDecay::genDecay : decay of \" << part->name() << \" is kinematically forbidden for some events due to resonance mass shapes.\" << std::endl\n\t\t\t\t\t\t << \" these events will not be generated.\" << std::endl\n\t\t\t\t\t\t << \" further warnings will be suppressed.\" << std::endl;\n\t\t\t\t\tsuppressKinematicWarning_ = true;\n\t\t\t\t}\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t\/\/ make an event\n\t\t\tif(acceptAny) {\n\t\t\t\tdecay_.Generate();\n\t\t\t} else {\n\t\t\t\tint nGen(0);\n\t\t\t\tbool accept(false);\n\t\t\t\twhile (nGen < maxgen_ && accept == false){\n\t\t\t\t\taccept = decay_.Generate() > gRandom->Uniform();\n\t\t\t\t\t++nGen;\n\t\t\t\t} \/\/ while\n\n\t\t\t\tif(!accept) {\n\t\t\t\t\tif(!suppressAttemptsWarning_) {\n\t\t\t\t\t\tstd::cout << \"WARNING in RapidDecay::genDecay : rejected all \" << maxgen_ << \" attempts to decay \" << part->name() << \".\" << std::endl\n\t\t\t\t\t\t\t << \" this event will not be generated.\" << std::endl\n\t\t\t\t\t\t\t << \" further warnings will be suppressed.\" << std::endl;\n\t\t\t\t\tsuppressAttemptsWarning_ = true;\n\t\t\t\t\t}\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n \/\/ Now generate the decay vertex for long-lived particles\n \/\/ First set the origin vertex to be the PV for the head of the chain\n \/\/ in all other cases, the origin vertex will already be set in the loop below\n if (!part->mother()) part->setOriginVertex(signalpv);\n double dist = part->getP().P()*gRandom->Exp(part->ctau())\/part->mass();\n double dvx = part->getOriginVertex().X() + part->getP().Vect().Unit().X()*dist;\n double dvy = part->getOriginVertex().Y() + part->getP().Vect().Unit().Y()*dist;\n double dvz = part->getOriginVertex().Z() + part->getP().Vect().Unit().Z()*dist;\n part->setDecayVertex(ROOT::Math::XYZPoint(dvx,dvy,dvz));\n\n\t\t\tint j=0;\n ROOT::Math::XYZPoint decayvertex(0.,0.,0.); \n\t\t\tfor(RapidParticle* jDaug=part->daughter(0); jDaug!=0; jDaug=jDaug->next()) {\n\t\t\t\tjDaug->setP(*decay_.GetDecay(j++));\n jDaug->setOriginVertex(part->getDecayVertex());\n double ip(0.);\n ip = getParticleIP(signalpv,jDaug->getOriginVertex(),jDaug->getP());\n jDaug->setIP(ip);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\ndouble RapidDecay::getParticleIP(ROOT::Math::XYZPoint pv, ROOT::Math::XYZPoint dv, TLorentzVector p) {\n ROOT::Math::XYZVector v1 = pv - dv;\n ROOT::Math::XYZVector dispv(dv.X() + p.X(), dv.Y()+p.Y(), dv.Z()+p.Z());\n ROOT::Math::XYZVector lengthv(p.X(), p.Y(), p.Z());\n ROOT::Math::XYZVector v2 = pv - (dv + dispv);\n\n ROOT::Math::XYZVector impact = v1.Cross(v2)\/sqrt(lengthv.Mag2());\n\n return sqrt(impact.Mag2());\n}\n\nbool RapidDecay::genDecayAccRej() {\n\tbool passAccRej(true);\n\tint ntry(0);\n\n\tdo {\n\t\tif(!genDecay(true)) return false;\n\t\tpassAccRej = runAcceptReject();\n\t\t++ntry;\n\n\t} while(!passAccRej && ntry"} {"text":"\/*\n * RelayNode.cpp\n * Homie Node for a Relay with optional status indicator LED\n *\n * Version: 1.1\n * Author: Lübbe Onken (http:\/\/github.com\/luebbe)\n *\/\n\n#include \"RelayNode.hpp\"\n\nRelayNode::RelayNode(const char *name, const int relayPin, const int ledPin, const bool reverseSignal)\n : HomieNode(name, \"RelayNode\", \"actor\")\n{\n _relayPin = relayPin;\n _ledPin = ledPin;\n if (reverseSignal)\n {\n _relayOnValue = LOW;\n _relayOffValue = HIGH;\n }\n else\n {\n _relayOnValue = HIGH;\n _relayOffValue = LOW;\n }\n advertise(\"on\")\n .setDatatype(\"boolean\")\n .settable();\n\n advertise(\"timeout\")\n .setDatatype(\"integer\")\n .settable();\n}\n\nHomieInternals::Uptime relayUptime;\n\nbool RelayNode::handleOnOff(const String &value)\n{\n if (value == \"true\" || value == \"false\" || value == \"toggle\")\n {\n if (value == \"toggle\")\n {\n bool current = getRelay();\n setRelay(!current);\n }\n else\n setRelay(value == \"true\");\n return true;\n }\n else\n {\n return false;\n }\n}\n\n#define IS_INTEGER(s) (s == String(s.toInt()))\n\nbool RelayNode::handleTimeout(const String &value)\n{\n if (IS_INTEGER(value))\n {\n long timeout = value.toInt();\n if (timeout > 0)\n {\n setRelay(true, timeout);\n return true;\n }\n }\n return false;\n}\n\nbool RelayNode::handleInput(const HomieRange &range, const String &property, const String &value)\n{\n Homie.getLogger() << \"Message: \" << property << \" \" << value << endl;\n\n if (property.equals(\"on\"))\n {\n return handleOnOff(value);\n }\n else if (property.equals(\"timeout\"))\n {\n return handleTimeout(value);\n }\n else\n {\n return false;\n }\n}\n\nvoid RelayNode::onReadyToOperate()\n{\n setRelay(false);\n sendState();\n};\n\nvoid RelayNode::printCaption()\n{\n Homie.getLogger() << cCaption << endl;\n}\n\nvoid RelayNode::sendState()\n{\n printCaption();\n bool on = getRelay();\n Homie.getLogger() << cIndent << \"Relay is \" << (on ? \"on\" : \"off\") << endl;\n if (Homie.isConnected())\n {\n setProperty(\"on\").send(on ? \"true\" : \"false\");\n setProperty(\"timeout\").send(String(long(_timeout)));\n }\n}\n\nvoid RelayNode::setLed(bool on)\n{\n if (_ledPin > DEFAULTPIN)\n {\n digitalWrite(_ledPin, on ? LOW : HIGH); \/\/ LOW = LED on\n }\n}\n\nbool RelayNode::getRelay()\n{\n if (_relayPin > DEFAULTPIN)\n {\n return digitalRead(_relayPin) == _relayOnValue;\n }\n else\n {\n return false;\n }\n}\n\nvoid RelayNode::setRelay(bool on, long timeoutSecs)\n{\n if (_relayPin > DEFAULTPIN)\n {\n digitalWrite(_relayPin, on ? _relayOnValue : _relayOffValue);\n if (on && timeoutSecs > 0)\n {\n _timeout = relayUptime.getSeconds() + timeoutSecs;\n }\n else\n {\n _timeout = 0;\n }\n sendState();\n }\n else\n {\n Homie.getLogger() << cIndent << \"No Relay Pin!\" << endl;\n }\n \/\/ Set Led according to relay\n setLed(on);\n}\n\nvoid RelayNode::toggleRelay()\n{\n setRelay(!getRelay());\n}\n\nvoid RelayNode::setup()\n{\n printCaption();\n\n Homie.getLogger() << cIndent << \"Relay Pin: \" << _relayPin << endl\n << cIndent << \"Led Pin : \" << _ledPin << endl;\n\n if (_ledPin > DEFAULTPIN)\n {\n pinMode(_ledPin, OUTPUT);\n }\n\n if (_relayPin > DEFAULTPIN)\n {\n pinMode(_relayPin, OUTPUT);\n }\n}\n\nvoid RelayNode::loop()\n{\n relayUptime.update();\n if ((_timeout > 0) && getRelay() && (_timeout < relayUptime.getSeconds()))\n {\n setRelay(false);\n }\n}\nFix RelayNode: sendState only necessary after setRelay Relay has to be set to false in Setup()\/*\n * RelayNode.cpp\n * Homie Node for a Relay with optional status indicator LED\n *\n * Version: 1.1\n * Author: Lübbe Onken (http:\/\/github.com\/luebbe)\n *\/\n\n#include \"RelayNode.hpp\"\n\nRelayNode::RelayNode(const char *name, const int relayPin, const int ledPin, const bool reverseSignal)\n : HomieNode(name, \"RelayNode\", \"actor\")\n{\n _relayPin = relayPin;\n _ledPin = ledPin;\n if (reverseSignal)\n {\n _relayOnValue = LOW;\n _relayOffValue = HIGH;\n }\n else\n {\n _relayOnValue = HIGH;\n _relayOffValue = LOW;\n }\n advertise(\"on\")\n .setDatatype(\"boolean\")\n .settable();\n\n advertise(\"timeout\")\n .setDatatype(\"integer\")\n .settable();\n}\n\nHomieInternals::Uptime relayUptime;\n\nbool RelayNode::handleOnOff(const String &value)\n{\n if (value == \"true\" || value == \"false\" || value == \"toggle\")\n {\n if (value == \"toggle\")\n {\n bool current = getRelay();\n setRelay(!current);\n }\n else\n setRelay(value == \"true\");\n return true;\n }\n else\n {\n return false;\n }\n}\n\n#define IS_INTEGER(s) (s == String(s.toInt()))\n\nbool RelayNode::handleTimeout(const String &value)\n{\n if (IS_INTEGER(value))\n {\n long timeout = value.toInt();\n if (timeout > 0)\n {\n setRelay(true, timeout);\n return true;\n }\n }\n return false;\n}\n\nbool RelayNode::handleInput(const HomieRange &range, const String &property, const String &value)\n{\n Homie.getLogger() << \"Message: \" << property << \" \" << value << endl;\n\n if (property.equals(\"on\"))\n {\n return handleOnOff(value);\n }\n else if (property.equals(\"timeout\"))\n {\n return handleTimeout(value);\n }\n else\n {\n return false;\n }\n}\n\nvoid RelayNode::onReadyToOperate()\n{\n setRelay(false);\n};\n\nvoid RelayNode::printCaption()\n{\n Homie.getLogger() << cCaption << endl;\n}\n\nvoid RelayNode::sendState()\n{\n printCaption();\n bool on = getRelay();\n Homie.getLogger() << cIndent << \"Relay is \" << (on ? \"on\" : \"off\") << endl;\n if (Homie.isConnected())\n {\n setProperty(\"on\").send(on ? \"true\" : \"false\");\n setProperty(\"timeout\").send(String(long(_timeout)));\n }\n}\n\nvoid RelayNode::setLed(bool on)\n{\n if (_ledPin > DEFAULTPIN)\n {\n digitalWrite(_ledPin, on ? LOW : HIGH); \/\/ LOW = LED on\n }\n}\n\nbool RelayNode::getRelay()\n{\n if (_relayPin > DEFAULTPIN)\n {\n return digitalRead(_relayPin) == _relayOnValue;\n }\n else\n {\n return false;\n }\n}\n\nvoid RelayNode::setRelay(bool on, long timeoutSecs)\n{\n if (_relayPin > DEFAULTPIN)\n {\n digitalWrite(_relayPin, on ? _relayOnValue : _relayOffValue);\n if (on && timeoutSecs > 0)\n {\n _timeout = relayUptime.getSeconds() + timeoutSecs;\n }\n else\n {\n _timeout = 0;\n }\n sendState();\n }\n else\n {\n Homie.getLogger() << cIndent << \"No Relay Pin!\" << endl;\n }\n \/\/ Set Led according to relay\n setLed(on);\n}\n\nvoid RelayNode::toggleRelay()\n{\n setRelay(!getRelay());\n}\n\nvoid RelayNode::setup()\n{\n printCaption();\n\n Homie.getLogger() << cIndent << \"Relay Pin: \" << _relayPin << endl\n << cIndent << \"Led Pin : \" << _ledPin << endl;\n\n if (_ledPin > DEFAULTPIN)\n {\n pinMode(_ledPin, OUTPUT);\n }\n if (_relayPin > DEFAULTPIN)\n {\n pinMode(_relayPin, OUTPUT);\n }\n setRelay(false);\n}\n\nvoid RelayNode::loop()\n{\n relayUptime.update();\n if ((_timeout > 0) && getRelay() && (_timeout < relayUptime.getSeconds()))\n {\n setRelay(false);\n }\n}\n<|endoftext|>"} {"text":"#include \"cssysdef.h\"\n#include \"csutil\/mmapio.h\"\n\ncsMemoryMappedIO::csMemoryMappedIO(unsigned _block_size, char *filename):\n block_size(_block_size)\n{\n valid_mmio_object = MemoryMapFile(&platform, filename);\n}\n\ncsMemoryMappedIO::~csMemoryMappedIO()\n{\n UnMemoryMapFile(&platform);\n}\n\nvoid *\ncsMemoryMappedIO::GetPointer(unsigned int index)\n{\n\n#ifdef CS_HAS_MEMORY_MAPPED_IO\n\n return platform.data + (index*block_size);\n\n#else\n\n unsigned int page = index\/cache_block_size;\n \n if (!(*page_map)[page])\n CachePage(page);\n\n \/\/ This MUST come AFTER CachPage b\/c CachePage might re-orient things.\n CacheBlock *cp = cache[page % csmmioDefaultHashSize];\n\n while(cp)\n { \n if (cp->page==page)\n {\n \/\/ Decrease age \n ++cp->age;\n\t \n return cp->data + ((index-cp->offset)*block_size);\n }\n\n cp=cp->next;\n }\n\n \/\/Serious error! The page is marked as here, but we could not find it!\n return NULL;\n \n#endif\n\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Software Support for Memory Mapping \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef CS_HAS_MEMORY_MAPPED_IO\n\nbool\ncsMemoryMappedIO::MemoryMapFile(mmioInfo *_platform, char *filename)\n{\n if ((_platform->hMappedFile=fopen(filename, \"rb\")) != NULL)\n {\n return false;\n }\n else\n {\n \/\/ Create a page map with one bit per cache block.\n page_map = new csBitArray(_platform->file_size\/cache_block_size);\n\n \/\/ Clear the cache\n memset(&cache, 0, sizeof(cache));\n\n \/\/ Set that we're good to go.\n return true;\n }\n}\n\nvoid\ncsMemoryMappedIO::UnMemoryMapFile(mmioInfo *_platform)\n{\n if (_platform->hMappedFile)\n fclose(_platform->hMappedFile);\n\n if (page_map)\n delete page_map;\n\n unsigned int i;\n CacheBlock *cp, *np;\n\n \/\/ Free all allocated memory.\n for(i=0; inext;\n delete [] cp->data;\n delete cp;\n\n cp=np;\n }\n }\n}\n\nvoid \ncsMemoryMappedIO::CachePage(unsigned int page)\n{\n unsigned int bucket = page % csmmioDefaultHashSize;\n\n CacheBlock *cp;\n\n if (cache_block_count < cache_max_size)\n {\n cp = new CacheBlock;\n ++cache_block_count;\n\n \/\/ Insert it into the bucket.\n cp->next=cache[bucket];\n cache[bucket]=cp;\n\n \/\/ Initialize it\n cp->data = new unsigned char[block_size * cache_block_size];\n }\n else\n {\n CacheBlock *block;\n \n \/\/ Find the least used block in this bucket.\n cp=cache[bucket];\n block=cp->next;\n\n while(block)\n { \n if (block->age < cp->age)\n cp=block;\n\n block=block->next;\n }\n\n \/\/ Unmark this page as allocated\n page_map->ClearBit(cp->page); \n }\n \n \/\/ Get the data for it.\n cp->offset=page*cache_block_size;\n cp->page=page;\n cp->age=0;\n\n \/\/ Mark this page as allocated\n page_map->SetBit(page);\n \n \/\/ Read the page from the file\n fseek(mapped_file, page*cache_block_size*block_size, SEEK_SET);\n fread(cp->data, block_size, cache_block_size, mapped_file);\n}\n\n\n#endif1. Bugfixes:#include \"cssysdef.h\"\n#include \"csutil\/mmapio.h\"\n\ncsMemoryMappedIO::csMemoryMappedIO(unsigned _block_size, char *filename):\n block_size(_block_size)\n{\n valid_mmio_object = MemoryMapFile(&platform, filename);\n}\n\ncsMemoryMappedIO::~csMemoryMappedIO()\n{\n UnMemoryMapFile(&platform);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ Software Support for Memory Mapping \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef CS_HAS_MEMORY_MAPPED_IO\n\nbool\ncsMemoryMappedIO::MemoryMapFile(mmioInfo *_platform, char *filename)\n{\n \/\/ Clear the page map\n page_map = NULL;\n\n \/\/ Clear the cache\n memset(&cache, 0, sizeof(cache));\n\n \/\/ Initialize cache management variables\n cache_block_size = csmmioDefaultCacheBlockSize;\n cache_max_size = csmmioDefaultCacheSize;\n cache_block_count=0;\n \n if ((_platform->hMappedFile=fopen(filename, \"rb\")) == NULL)\n {\n return false;\n }\n else\n {\n \/\/ Create a page map with one bit per cache block.\n page_map = new csBitArray(_platform->file_size\/cache_block_size);\n\n \/\/ Clear all of it's bits\n page_map->Clear();\n \n \/\/ Set that we're good to go.\n return true;\n }\n}\n\nvoid\ncsMemoryMappedIO::UnMemoryMapFile(mmioInfo *_platform)\n{\n if (_platform->hMappedFile)\n fclose(_platform->hMappedFile);\n\n if (page_map)\n delete page_map;\n\n unsigned int i;\n CacheBlock *cp, *np;\n\n \/\/ Free all allocated memory.\n for(i=0; inext;\n delete [] cp->data;\n delete cp;\n\n cp=np;\n }\n }\n}\n\nvoid \ncsMemoryMappedIO::CachePage(unsigned int page)\n{\n unsigned int bucket = page % csmmioDefaultHashSize;\n\n CacheBlock *cp;\n\n if (cache_block_count < cache_max_size)\n {\n cp = new CacheBlock;\n ++cache_block_count;\n\n \/\/ Insert it into the bucket.\n cp->next=cache[bucket];\n cache[bucket]=cp;\n\n \/\/ Initialize it\n cp->data = new unsigned char[block_size * cache_block_size];\n }\n else\n {\n CacheBlock *block;\n \n \/\/ Find the least used block in this bucket.\n cp=cache[bucket];\n block=cp->next;\n\n while(block)\n { \n if (block->age < cp->age)\n cp=block;\n\n block=block->next;\n }\n\n \/\/ Unmark this page as allocated\n page_map->ClearBit(cp->page); \n }\n \n \/\/ Get the data for it.\n cp->offset=page*cache_block_size;\n cp->page=page;\n cp->age=0;\n\n \/\/ Mark this page as allocated\n page_map->SetBit(page);\n \n \/\/ Read the page from the file\n fseek(platform.hMappedFile, page*cache_block_size*block_size, SEEK_SET);\n fread(cp->data, block_size, cache_block_size, platform.hMappedFile);\n}\n\n\n#endif<|endoftext|>"} {"text":"\/*\n * Copyright 2007-2020 CM4all GmbH\n * All rights reserved.\n *\n * author: Max Kellermann \n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#pragma once\n\n#include \"SliceAllocation.hxx\"\n#include \"util\/Compiler.h\"\n\n#include \n\n#include \n\nstruct AllocatorStats;\nclass SliceArea;\n\n\/**\n * The \"slice\" memory allocator. It is an allocator for large numbers\n * of small fixed-size objects.\n *\/\nclass SlicePool {\n\tfriend class SliceArea;\n\n\tsize_t slice_size;\n\n\t\/**\n\t * Number of slices that fit on one MMU page (4 kB).\n\t *\/\n\tunsigned slices_per_page;\n\n\tunsigned pages_per_slice;\n\n\tunsigned pages_per_area;\n\n\tunsigned slices_per_area;\n\n\t\/**\n\t * Number of pages for the area header.\n\t *\/\n\tunsigned header_pages;\n\n\tsize_t area_size;\n\n\ttypedef boost::intrusive::list>>,\n\t\t\t\t boost::intrusive::constant_time_size> AreaList;\n\n\tAreaList areas;\n\n\t\/**\n\t * A list of #SliceArea instances which are empty. They are kept\n\t * in a separate list to reduce fragmentation: allocate first from\n\t * areas which are not empty.\n\t *\/\n\tAreaList empty_areas;\n\n\t\/**\n\t * A list of #SliceArea instances which are full. They are kept\n\t * in a separate list to speed up allocation, to avoid iterating\n\t * over full areas.\n\t *\/\n\tAreaList full_areas;\n\n\tbool fork_cow = true;\n\npublic:\n\tSlicePool(size_t _slice_size, unsigned _slices_per_area) noexcept;\n\t~SlicePool() noexcept;\n\n\tsize_t GetSliceSize() const noexcept {\n\t\treturn slice_size;\n\t}\n\n\t\/**\n\t * Controls whether forked child processes inherit the allocator.\n\t * This is enabled by default.\n\t *\/\n\tvoid ForkCow(bool inherit) noexcept;\n\n\tvoid AddStats(AllocatorStats &stats, const AreaList &list) const noexcept;\n\n\tgcc_pure\n\tAllocatorStats GetStats() const noexcept;\n\n\tvoid Compress() noexcept;\n\n\tgcc_pure\n\tSliceArea *FindNonFullArea() noexcept;\n\n\tSliceArea &MakeNonFullArea() noexcept;\n\n\tSliceAllocation Alloc() noexcept;\n\tvoid Free(SliceArea &area, void *p) noexcept;\n};\nSlicePool: make two methods private\/*\n * Copyright 2007-2020 CM4all GmbH\n * All rights reserved.\n *\n * author: Max Kellermann \n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#pragma once\n\n#include \"SliceAllocation.hxx\"\n#include \"util\/Compiler.h\"\n\n#include \n\n#include \n\nstruct AllocatorStats;\nclass SliceArea;\n\n\/**\n * The \"slice\" memory allocator. It is an allocator for large numbers\n * of small fixed-size objects.\n *\/\nclass SlicePool {\n\tfriend class SliceArea;\n\n\tsize_t slice_size;\n\n\t\/**\n\t * Number of slices that fit on one MMU page (4 kB).\n\t *\/\n\tunsigned slices_per_page;\n\n\tunsigned pages_per_slice;\n\n\tunsigned pages_per_area;\n\n\tunsigned slices_per_area;\n\n\t\/**\n\t * Number of pages for the area header.\n\t *\/\n\tunsigned header_pages;\n\n\tsize_t area_size;\n\n\ttypedef boost::intrusive::list>>,\n\t\t\t\t boost::intrusive::constant_time_size> AreaList;\n\n\tAreaList areas;\n\n\t\/**\n\t * A list of #SliceArea instances which are empty. They are kept\n\t * in a separate list to reduce fragmentation: allocate first from\n\t * areas which are not empty.\n\t *\/\n\tAreaList empty_areas;\n\n\t\/**\n\t * A list of #SliceArea instances which are full. They are kept\n\t * in a separate list to speed up allocation, to avoid iterating\n\t * over full areas.\n\t *\/\n\tAreaList full_areas;\n\n\tbool fork_cow = true;\n\npublic:\n\tSlicePool(size_t _slice_size, unsigned _slices_per_area) noexcept;\n\t~SlicePool() noexcept;\n\n\tsize_t GetSliceSize() const noexcept {\n\t\treturn slice_size;\n\t}\n\n\t\/**\n\t * Controls whether forked child processes inherit the allocator.\n\t * This is enabled by default.\n\t *\/\n\tvoid ForkCow(bool inherit) noexcept;\n\n\tvoid AddStats(AllocatorStats &stats, const AreaList &list) const noexcept;\n\n\tgcc_pure\n\tAllocatorStats GetStats() const noexcept;\n\n\tvoid Compress() noexcept;\n\n\tSliceAllocation Alloc() noexcept;\n\tvoid Free(SliceArea &area, void *p) noexcept;\n\nprivate:\n\tgcc_pure\n\tSliceArea *FindNonFullArea() noexcept;\n\n\tSliceArea &MakeNonFullArea() noexcept;\n};\n<|endoftext|>"} {"text":"#include \"SplayTree.hpp\"\n#include \n\nnamespace warped {\n\nSplayTree::SplayTree() = default;\n\n\/* Search lowest event *\/\nstd::shared_ptr SplayTree::begin() {\n\n \/\/ If splay tree is invalid\n if (!root_ || !num_nodes_) {\n root_ = nullptr;\n current_ = nullptr;\n num_nodes_ = 0;\n\n return nullptr;\n }\n\n if (!current_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n return current_->data_;\n}\n\n\/* Erase event *\/\nbool SplayTree::erase( std::shared_ptr event ) {\n\n assert(event && root_);\n\n if (!current_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n return false;\n }\n\n \/\/ Search for the event to be deleted\n \/\/ Also handles the condition when current = root\n auto node = (*event <= *current_->data_) ? current_ : root_;\n while (node) {\n if (*event < *node->data_) {\n node = node->left_;\n } else if (event == node->data_) { \/\/ Comparing address is sufficient\n break;\n } else {\n node = node->right_;\n }\n }\n\n if (!node) { return false; }\n\n \/\/ Remove the node if found\n if (node != root_) {\n splay(node);\n if (node != root_) assert(0);\n }\n auto left = root_->left_;\n auto right = root_->right_;\n num_nodes_--;\n delete root_; \/\/ node == root_\n root_ = nullptr;\n\n \/\/ Re-construct the tree\n if (left) {\n root_ = left;\n root_->parent_ = nullptr;\n if (right) {\n while (left->right_) {\n left = left->right_;\n }\n left->right_ = right;\n right->parent_ = left;\n }\n } else {\n root_ = right;\n if (root_) { root_->parent_ = nullptr; }\n }\n\n \/\/ Re-calculate the current\n if (root_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n return true;\n}\n\n\/* Insert event *\/\nvoid SplayTree::insert( std::shared_ptr event ) {\n\n assert(event);\n auto new_node = new SplayTree::Node();\n assert(new_node);\n new_node->data_ = event;\n num_nodes_++;\n\n if (!root_) {\n root_ = new_node;\n current_ = new_node;\n return;\n }\n\n assert(current_);\n if (!current_->data_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n\n if (*event <= *current_->data_) {\n current_->left_ = new_node;\n new_node->parent_ = current_;\n current_ = new_node;\n splay(new_node);\n return;\n }\n\n auto node = root_;\n while (1) {\n if (*event <= *node->data_) {\n if (node->left_) {\n node = node->left_;\n } else {\n node->left_ = new_node;\n break;\n }\n } else {\n if (node->right_) {\n node = node->right_;\n } else {\n node->right_ = new_node;\n break;\n }\n }\n }\n new_node->parent_ = node;\n splay(new_node);\n}\n\n\/* Splay *\/\nvoid SplayTree::splay( SplayTree::Node *node ) {\n\n unsigned int splay_cnt = 0;\n unsigned int max_splay = num_nodes_ \/ 2;\n bool parent_flag = false;\n bool grandpa_flag = false;\n\n while (node != root_) {\n auto parent = node->parent_;\n if (parent == root_) {\n if (parent->left_ == node) {\n rotateRight(parent);\n } else {\n rotateLeft(parent);\n }\n break;\n } else {\n parent_flag = (parent->left_ == node) ? false : true;\n auto grand_parent = parent->parent_;\n grandpa_flag = (grand_parent->left_ == parent) ? false : true;\n if (parent_flag != grandpa_flag) { \/\/Zig Zag\n if (!parent_flag) {\n rotateRight(parent);\n rotateLeft(grand_parent);\n } else {\n rotateLeft(parent);\n rotateRight(grand_parent);\n }\n } else { \/\/ Zig Zig\n if (!parent_flag) {\n rotateRight(grand_parent);\n rotateRight(parent);\n } else {\n rotateLeft(grand_parent);\n rotateLeft(parent);\n }\n }\n }\n\n if (splay_cnt >= max_splay) break;\n splay_cnt++;\n }\n}\n\n\/* Rotate Left *\/\nSplayTree::Node *SplayTree::rotateLeft( SplayTree::Node *node ) {\n\n if (!node) return nullptr;\n\n auto right = node->right_;\n if (!right) { return node; }\n\n auto left = right->left_;\n auto parent = node->parent_;\n node->parent_ = right;\n right->left_ = node;\n node->right_ = left;\n\n if (left) { left->parent_ = node; }\n if (node == root_) {\n root_ = right;\n root_->parent_ = nullptr;\n\n } else {\n right->parent_ = parent;\n if (parent->left_ == node) {\n parent->left_ = right;\n } else {\n parent->right_ = right;\n }\n }\n return right;\n}\n\n\/* Rotate Right *\/\nSplayTree::Node *SplayTree::rotateRight( SplayTree::Node *node ) {\n\n if (!node) return nullptr;\n\n auto left = node->left_;\n if (!left) { return node; }\n\n auto right = left->right_;\n auto parent = node->parent_;\n node->parent_ = left;\n left->right_ = node;\n node->left_ = right;\n\n if (right) { right->parent_ = node; }\n if (node == root_) {\n root_ = left;\n root_->parent_ = nullptr;\n\n } else {\n left->parent_ = parent;\n if (parent->left_ == node) {\n parent->left_ = left;\n } else {\n parent->right_ = left;\n }\n }\n return left;\n}\n\n} \/\/ namespace warped\nmoved the assert to the old format#include \"SplayTree.hpp\"\n#include \n\nnamespace warped {\n\nSplayTree::SplayTree() = default;\n\n\/* Search lowest event *\/\nstd::shared_ptr SplayTree::begin() {\n\n \/\/ If splay tree is invalid\n if (!root_ || !num_nodes_) {\n root_ = nullptr;\n current_ = nullptr;\n num_nodes_ = 0;\n\n return nullptr;\n }\n\n if (!current_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n return current_->data_;\n}\n\n\/* Erase event *\/\nbool SplayTree::erase( std::shared_ptr event ) {\n\n assert(event);\n assert(root_);\n\n if (!current_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n return false;\n }\n\n \/\/ Search for the event to be deleted\n \/\/ Also handles the condition when current = root\n auto node = (*event <= *current_->data_) ? current_ : root_;\n while (node) {\n if (*event < *node->data_) {\n node = node->left_;\n } else if (event == node->data_) { \/\/ Comparing address is sufficient\n break;\n } else {\n node = node->right_;\n }\n }\n\n if (!node) { return false; }\n\n \/\/ Remove the node if found\n if (node != root_) {\n splay(node);\n if (node != root_) assert(0);\n }\n auto left = root_->left_;\n auto right = root_->right_;\n num_nodes_--;\n delete root_; \/\/ node == root_\n root_ = nullptr;\n\n \/\/ Re-construct the tree\n if (left) {\n root_ = left;\n root_->parent_ = nullptr;\n if (right) {\n while (left->right_) {\n left = left->right_;\n }\n left->right_ = right;\n right->parent_ = left;\n }\n } else {\n root_ = right;\n if (root_) { root_->parent_ = nullptr; }\n }\n\n \/\/ Re-calculate the current\n if (root_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n return true;\n}\n\n\/* Insert event *\/\nvoid SplayTree::insert( std::shared_ptr event ) {\n\n assert(event);\n auto new_node = new SplayTree::Node();\n assert(new_node);\n new_node->data_ = event;\n num_nodes_++;\n\n if (!root_) {\n root_ = new_node;\n current_ = new_node;\n return;\n }\n\n assert(current_);\n if (!current_->data_) {\n for( current_ = root_ ; current_->left_ ; current_ = current_->left_ );\n }\n\n if (*event <= *current_->data_) {\n current_->left_ = new_node;\n new_node->parent_ = current_;\n current_ = new_node;\n splay(new_node);\n return;\n }\n\n auto node = root_;\n while (1) {\n if (*event <= *node->data_) {\n if (node->left_) {\n node = node->left_;\n } else {\n node->left_ = new_node;\n break;\n }\n } else {\n if (node->right_) {\n node = node->right_;\n } else {\n node->right_ = new_node;\n break;\n }\n }\n }\n new_node->parent_ = node;\n splay(new_node);\n}\n\n\/* Splay *\/\nvoid SplayTree::splay( SplayTree::Node *node ) {\n\n unsigned int splay_cnt = 0;\n unsigned int max_splay = num_nodes_ \/ 2;\n bool parent_flag = false;\n bool grandpa_flag = false;\n\n while (node != root_) {\n auto parent = node->parent_;\n if (parent == root_) {\n if (parent->left_ == node) {\n rotateRight(parent);\n } else {\n rotateLeft(parent);\n }\n break;\n } else {\n parent_flag = (parent->left_ == node) ? false : true;\n auto grand_parent = parent->parent_;\n grandpa_flag = (grand_parent->left_ == parent) ? false : true;\n if (parent_flag != grandpa_flag) { \/\/Zig Zag\n if (!parent_flag) {\n rotateRight(parent);\n rotateLeft(grand_parent);\n } else {\n rotateLeft(parent);\n rotateRight(grand_parent);\n }\n } else { \/\/ Zig Zig\n if (!parent_flag) {\n rotateRight(grand_parent);\n rotateRight(parent);\n } else {\n rotateLeft(grand_parent);\n rotateLeft(parent);\n }\n }\n }\n\n if (splay_cnt >= max_splay) break;\n splay_cnt++;\n }\n}\n\n\/* Rotate Left *\/\nSplayTree::Node *SplayTree::rotateLeft( SplayTree::Node *node ) {\n\n if (!node) return nullptr;\n\n auto right = node->right_;\n if (!right) { return node; }\n\n auto left = right->left_;\n auto parent = node->parent_;\n node->parent_ = right;\n right->left_ = node;\n node->right_ = left;\n\n if (left) { left->parent_ = node; }\n if (node == root_) {\n root_ = right;\n root_->parent_ = nullptr;\n\n } else {\n right->parent_ = parent;\n if (parent->left_ == node) {\n parent->left_ = right;\n } else {\n parent->right_ = right;\n }\n }\n return right;\n}\n\n\/* Rotate Right *\/\nSplayTree::Node *SplayTree::rotateRight( SplayTree::Node *node ) {\n\n if (!node) return nullptr;\n\n auto left = node->left_;\n if (!left) { return node; }\n\n auto right = left->right_;\n auto parent = node->parent_;\n node->parent_ = left;\n left->right_ = node;\n node->left_ = right;\n\n if (right) { right->parent_ = node; }\n if (node == root_) {\n root_ = left;\n root_->parent_ = nullptr;\n\n } else {\n left->parent_ = parent;\n if (parent->left_ == node) {\n parent->left_ = left;\n } else {\n parent->right_ = left;\n }\n }\n return left;\n}\n\n} \/\/ namespace warped\n<|endoftext|>"} {"text":"\/\/ StringUtil.cc for fluxbox \n\/\/ Copyright (c) 2001 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ \n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\tIN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n#include \"StringUtil.hh\"\n\n#include \n#include \n#include \n#include \n\n\/\/------- strdup ------------------------\n\/\/TODO: comment this\n\/\/----------------------------------------\nchar *StringUtil::strdup(const char *s) {\n int l = strlen(s) + 1;\n char *n = new char[l];\n strncpy(n, s, l);\n return n;\n}\n\n\/\/------- strcasestr --------------\n\/\/ TODO: comment this\n\/\/---------------------------------\nconst char * StringUtil::strcasestr(const char *str, const char *ptn) {\n\tconst char *s2, *p2;\n\tfor( ; *str; str++) {\n\t\tfor(s2=str,p2=ptn; ; s2++,p2++) {\n\t\t\tif (!*p2) return str;\n\t\t\tif (toupper(*s2) != toupper(*p2)) break;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\/\/------------- expandFilename ----------------------\n\/\/ if ~ then expand it to home of user\n\/\/ returns expanded filename \n\/\/ (note: the function creates new memory for the string)\n\/\/---------------------------------------------------\nchar *StringUtil::expandFilename(const char *filename) {\n \n\tchar retval[strlen(filename)+strlen(getenv(\"HOME\"))+2];\n retval[0]=0; \/\/mark end\n if (filename[0]=='~') {\n strcat(retval, getenv(\"HOME\"));\n strcat(retval, &filename[1]);\n } else\n return StringUtil::strdup(filename);\t\/\/return unmodified value\n \n return StringUtil::strdup(retval);\t\/\/return modified value\n}\nChanged to auto_ptr and added comment\/\/ StringUtil.cc for fluxbox \n\/\/ Copyright (c) 2001 Henrik Kinnunen (fluxgen@linuxmail.org)\n\/\/ \n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\tIN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n#include \"StringUtil.hh\"\n\n#include \n#include \n#include \n#include \n#include \n\nusing namespace std;\n\n\/\/------- strdup ------------------------\n\/\/TODO: comment this\n\/\/----------------------------------------\nchar *StringUtil::strdup(const char *s) {\n int l = strlen(s) + 1;\n char *n = new char[l];\n strncpy(n, s, l);\n return n;\n}\n\n\/\/------- strcasestr --------------\n\/\/ Tries to find a string in another and\n\/\/ ignoring the case of the characters\n\/\/ Returns 0 on success else pointer to str.\n\/\/ TODO: comment this\n\/\/---------------------------------\nconst char * StringUtil::strcasestr(const char *str, const char *ptn) {\n\tconst char *s2, *p2;\n\tfor( ; *str; str++) {\n\t\tfor(s2=str, p2=ptn; ; s2++,p2++) {\t\n\t\t\tif (!*p2) return str;\n\t\t\tif (toupper(*s2) != toupper(*p2)) break;\n\t\t}\n\t}\n\treturn 0;\n}\n\n\/\/------------- expandFilename ----------------------\n\/\/ if ~ then expand it to home of user\n\/\/ returns expanded filename \n\/\/ (note: the function creates new memory for the string)\n\/\/---------------------------------------------------\nchar *StringUtil::expandFilename(const char *filename) {\n \n\tauto_ptr retval( new char[strlen(filename)+strlen(getenv(\"HOME\"))+2]);\n if (filename[0]=='~') {\n strcat(retval.get(), getenv(\"HOME\"));\n strcat(retval.get(), &filename[1]);\n } else\n return StringUtil::strdup(filename);\t\/\/return unmodified value\n \n return StringUtil::strdup(retval.get());\t\/\/return modified value\n}\n<|endoftext|>"} {"text":"\/* Copyright (c) 2009 Stanford University\n *\n * Permission to use, copy, modify, and distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR(S) DISCLAIM ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL AUTHORS BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \"Common.h\"\n#include \"ClientException.h\"\n\nchar testName[256];\nbool progress = false;\nbool googleOnly = false;\n\nvoid __attribute__ ((noreturn))\nusage(char *arg0)\n{\n printf(\"Usage: %s \"\n \"[-p] [-t testName]\\n\"\n \"\\t-t\\t--test\\tRun a specific test..\\n\"\n \"\\t-p\\t--progress\\tShow test progress.\\n\",\n \"\\t-g\\t--google\\tRun google tests only.\\n\",\n arg0);\n exit(EXIT_FAILURE);\n}\n\nvoid\ncmdline(int argc, char *argv[])\n{\n struct option long_options[] = {\n {\"test\", required_argument, NULL, 't'},\n {\"progress\", no_argument, NULL, 'p'},\n {\"google\", no_argument, NULL, 'g'},\n {0, 0, 0, 0},\n };\n\n int c;\n int i = 0;\n while ((c = getopt_long(argc, argv, \"t:pg\",\n long_options, &i)) >= 0)\n {\n switch (c) {\n case 't':\n strncpy(testName, optarg, sizeof(testName));\n testName[sizeof(testName) - 1] = '\\0';\n break;\n case 'p':\n progress = true;\n break;\n case 'g':\n googleOnly = true;\n break;\n default:\n usage(argv[0]);\n }\n }\n}\n\n\/\/ CppUnit doesn't put this in a public header\nstruct CppUnit::ProtectorContext {\n void* _[2];\n std::string description;\n};\n\nint\nmain(int argc, char *argv[])\n{\n int googleArgc = 0;\n char* googleArgv[] = {NULL};\n ::testing::InitGoogleTest(&googleArgc, googleArgv);\n\n const char *defaultTest = \"\";\n strncpy(testName, defaultTest, sizeof(testName));\n cmdline(argc, argv);\n\n CppUnit::TextUi::TestRunner runner;\n CppUnit::TestFactoryRegistry& registry =\n CppUnit::TestFactoryRegistry::getRegistry();\n\n \/\/ This thing will print RAMCloud::Exception::message when RAMCloud\n \/\/ exceptions are thrown in our unit tests.\n class RAMCloudProtector : public CppUnit::Protector {\n bool protect(const CppUnit::Functor& functor,\n const CppUnit::ProtectorContext& context) {\n if (context.description == \"setUp() failed\")\n RAMCloud::logger.setLogLevels(RAMCloud::WARNING);\n try {\n return functor();\n } catch (const RAMCloud::Exception& e) {\n std::string className(\n CppUnit::TypeInfoHelper::getClassName(typeid(e)));\n CppUnit::Message message(className + \":\\n \" + e.str());\n reportError(context, message);\n } catch (const RAMCloud::ClientException& e) {\n std::string className(\n CppUnit::TypeInfoHelper::getClassName(typeid(e)));\n CppUnit::Message message(className + \":\\n \" + e.str());\n reportError(context, message);\n }\n return false;\n }\n };\n \/\/ CppUnit's ProtectorChain::pop() will call delete on our protector, so I\n \/\/ guess they want us to use new to allocate it.\n runner.eventManager().pushProtector(new RAMCloudProtector());\n\n runner.addTest(registry.makeTest());\n\n \/\/ set log levels for gtest unit tests\n struct LoggerEnvironment : public ::testing::Environment {\n void SetUp() { RAMCloud::logger.setLogLevels(RAMCloud::WARNING); }\n };\n ::testing::AddGlobalTestEnvironment(new LoggerEnvironment());\n\n int r = 0;\n if (!googleOnly)\n r += !runner.run(testName, false, true, progress);\n if (googleOnly || !strcmp(testName, defaultTest))\n r += RUN_ALL_TESTS();\n return r;\n}\nChange the order of tests to run gtests first (so that the cppunit output doesn't get scrolled out of sight by the voluminous gtest output).\/* Copyright (c) 2009 Stanford University\n *\n * Permission to use, copy, modify, and distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR(S) DISCLAIM ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL AUTHORS BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \"Common.h\"\n#include \"ClientException.h\"\n\nchar testName[256];\nbool progress = false;\nbool googleOnly = false;\n\nvoid __attribute__ ((noreturn))\nusage(char *arg0)\n{\n printf(\"Usage: %s \"\n \"[-p] [-t testName]\\n\"\n \"\\t-t\\t--test\\tRun a specific test..\\n\"\n \"\\t-p\\t--progress\\tShow test progress.\\n\",\n \"\\t-g\\t--google\\tRun google tests only.\\n\",\n arg0);\n exit(EXIT_FAILURE);\n}\n\nvoid\ncmdline(int argc, char *argv[])\n{\n struct option long_options[] = {\n {\"test\", required_argument, NULL, 't'},\n {\"progress\", no_argument, NULL, 'p'},\n {\"google\", no_argument, NULL, 'g'},\n {0, 0, 0, 0},\n };\n\n int c;\n int i = 0;\n while ((c = getopt_long(argc, argv, \"t:pg\",\n long_options, &i)) >= 0)\n {\n switch (c) {\n case 't':\n strncpy(testName, optarg, sizeof(testName));\n testName[sizeof(testName) - 1] = '\\0';\n break;\n case 'p':\n progress = true;\n break;\n case 'g':\n googleOnly = true;\n break;\n default:\n usage(argv[0]);\n }\n }\n}\n\n\/\/ CppUnit doesn't put this in a public header\nstruct CppUnit::ProtectorContext {\n void* _[2];\n std::string description;\n};\n\nint\nmain(int argc, char *argv[])\n{\n int googleArgc = 0;\n char* googleArgv[] = {NULL};\n ::testing::InitGoogleTest(&googleArgc, googleArgv);\n\n const char *defaultTest = \"\";\n strncpy(testName, defaultTest, sizeof(testName));\n cmdline(argc, argv);\n\n \/\/ First run gtest tests.\n \/\/ set log levels for gtest unit tests\n struct LoggerEnvironment : public ::testing::Environment {\n void SetUp() { RAMCloud::logger.setLogLevels(RAMCloud::WARNING); }\n };\n ::testing::AddGlobalTestEnvironment(new LoggerEnvironment());\n\n int r = 0;\n if (googleOnly || !strcmp(testName, defaultTest))\n r += RUN_ALL_TESTS();\n\n \/\/ Next run cppunit tests.\n\n CppUnit::TextUi::TestRunner runner;\n CppUnit::TestFactoryRegistry& registry =\n CppUnit::TestFactoryRegistry::getRegistry();\n\n \/\/ This thing will print RAMCloud::Exception::message when RAMCloud\n \/\/ exceptions are thrown in our unit tests.\n class RAMCloudProtector : public CppUnit::Protector {\n bool protect(const CppUnit::Functor& functor,\n const CppUnit::ProtectorContext& context) {\n if (context.description == \"setUp() failed\")\n RAMCloud::logger.setLogLevels(RAMCloud::WARNING);\n try {\n return functor();\n } catch (const RAMCloud::Exception& e) {\n std::string className(\n CppUnit::TypeInfoHelper::getClassName(typeid(e)));\n CppUnit::Message message(className + \":\\n \" + e.str());\n reportError(context, message);\n } catch (const RAMCloud::ClientException& e) {\n std::string className(\n CppUnit::TypeInfoHelper::getClassName(typeid(e)));\n CppUnit::Message message(className + \":\\n \" + e.str());\n reportError(context, message);\n }\n return false;\n }\n };\n \/\/ CppUnit's ProtectorChain::pop() will call delete on our protector, so I\n \/\/ guess they want us to use new to allocate it.\n runner.eventManager().pushProtector(new RAMCloudProtector());\n runner.addTest(registry.makeTest());\n if (!googleOnly)\n r += !runner.run(testName, false, true, progress);\n\n return r;\n}\n<|endoftext|>"} {"text":"#include \"algorithm8.hpp\"\n#include \n#include \n#include \n#include \n\n#define LOOM_ASSERT_CLOSE(x, y) \\\n LOOM_ASSERT_LT(fabs((x) - (y)) \/ ((x) + (y) + 1e-20), 1e-4)\n\nnamespace loom\n{\n\nvoid Algorithm8::clear ()\n{\n model.clear();\n kinds.clear();\n}\n\nvoid Algorithm8::model_load (const CrossCat & cross_cat)\n{\n clear();\n feature_clustering = cross_cat.feature_clustering;\n for (const auto & kind : cross_cat.kinds) {\n model.extend(kind.model);\n }\n LOOM_ASSERT_EQ(model.schema, cross_cat.schema);\n}\n\nvoid Algorithm8::mixture_init_empty (\n const CrossCat & cross_cat,\n rng_t & rng)\n{\n const size_t kind_count = cross_cat.kinds.size();\n LOOM_ASSERT_LT(0, kind_count);\n kinds.resize(kind_count);\n for (size_t i = 0; i < kind_count; ++i) {\n const auto & counts = cross_cat.kinds[i].mixture.clustering.counts();\n kinds[i].mixture.init_unobserved(model, counts, rng);\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Block Pitman-Yor Sampler\n\/\/\n\/\/ This sampler follows the math in\n\/\/ $DISTRIBUTIONS_PATH\/src\/clustering.hpp\n\/\/ distributions::Clustering::PitmanYor::sample_assignments(...)\n\nclass Algorithm8::BlockPitmanYorSampler\n{\npublic:\n\n BlockPitmanYorSampler (\n const distributions::Clustering::PitmanYor & clustering,\n const std::vector & likelihoods,\n std::vector & assignments);\n\n void run (size_t iterations, rng_t & rng);\n\n typedef std::unordered_set>\n IdSet;\n\nprivate:\n\n void validate () const;\n\n float get_likelihood_empty () const;\n std::vector get_counts_from_assignments () const;\n IdSet get_empty_kinds_from_counts () const;\n VectorFloat get_prior_from_counts () const;\n void add_empty_kind (size_t kindid);\n void remove_empty_kind (size_t kindid);\n\n static float compute_posterior (\n const VectorFloat & prior_in,\n const VectorFloat & likelihood_in,\n VectorFloat & posterior_out);\n\n const float alpha_;\n const float d_;\n const size_t feature_count_;\n const size_t kind_count_;\n const std::vector & likelihoods_;\n std::vector & assignments_;\n std::vector counts_;\n IdSet empty_kinds_;\n size_t empty_kind_count_;\n VectorFloat prior_;\n VectorFloat posterior_;\n};\n\nAlgorithm8::BlockPitmanYorSampler::BlockPitmanYorSampler (\n const distributions::Clustering::PitmanYor & clustering,\n const std::vector & likelihoods,\n std::vector & assignments) :\n alpha_(clustering.alpha),\n d_(clustering.d),\n feature_count_(likelihoods.size()),\n kind_count_(likelihoods[0].size()),\n likelihoods_(likelihoods),\n assignments_(assignments),\n counts_(get_counts_from_assignments()),\n empty_kinds_(get_empty_kinds_from_counts()),\n empty_kind_count_(empty_kinds_.size()),\n prior_(get_prior_from_counts()),\n posterior_(kind_count_)\n{\n LOOM_ASSERT_LT(0, alpha_);\n LOOM_ASSERT_LE(0, d_);\n LOOM_ASSERT_LT(d_, 1);\n\n LOOM_ASSERT_LT(0, likelihoods.size());\n LOOM_ASSERT_EQ(likelihoods.size(), assignments.size());\n for (const auto & likelihood : likelihoods) {\n LOOM_ASSERT_EQ(likelihood.size(), kind_count_);\n }\n}\n\ninline std::vector\n Algorithm8::BlockPitmanYorSampler::get_counts_from_assignments () const\n{\n std::vector counts(kind_count_, 0);\n for (size_t f = 0; f < feature_count_; ++f) {\n size_t k = assignments_[f];\n LOOM_ASSERT1(k < kind_count_, \"bad kind id: \" << k);\n ++counts[k];\n }\n return counts;\n}\n\ninline Algorithm8::BlockPitmanYorSampler::IdSet\n Algorithm8::BlockPitmanYorSampler::get_empty_kinds_from_counts () const\n{\n IdSet empty_kinds;\n for (size_t k = 0; k < kind_count_; ++k) {\n if (counts_[k] == 0) {\n empty_kinds.insert(k);\n }\n }\n return empty_kinds;\n}\n\ninline VectorFloat\n Algorithm8::BlockPitmanYorSampler::get_prior_from_counts () const\n{\n VectorFloat prior(kind_count_);\n const float likelihood_empty = get_likelihood_empty();\n for (size_t k = 0; k < kind_count_; ++k) {\n if (auto count = counts_[k]) {\n prior[k] = count - d_;\n } else {\n prior[k] = likelihood_empty;\n }\n }\n return prior;\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::validate () const\n{\n std::vector expected_counts = get_counts_from_assignments();\n for (size_t k = 0; k < kind_count_; ++k) {\n LOOM_ASSERT_EQ(counts_[k], expected_counts[k]);\n }\n\n LOOM_ASSERT_EQ(empty_kind_count_, empty_kinds_.size());\n for (size_t k = 0; k < kind_count_; ++k) {\n bool in_empty_kinds = (empty_kinds_.find(k) != empty_kinds_.end());\n bool has_zero_count = (counts_[k] == 0);\n LOOM_ASSERT_EQ(in_empty_kinds, has_zero_count);\n }\n\n VectorFloat expected_prior = get_prior_from_counts();\n for (size_t k = 0; k < kind_count_; ++k) {\n LOOM_ASSERT_CLOSE(prior_[k], expected_prior[k]);\n }\n}\n\ninline float Algorithm8::BlockPitmanYorSampler::get_likelihood_empty () const\n{\n if (empty_kind_count_) {\n float nonempty_kind_count = kind_count_ - empty_kind_count_;\n return (alpha_ + d_ * nonempty_kind_count) \/ empty_kind_count_;\n } else {\n return 0.f;\n }\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::add_empty_kind (size_t kindid)\n{\n empty_kinds_.insert(kindid);\n ++empty_kind_count_;\n const float likelihood_empty = get_likelihood_empty();\n for (auto k : empty_kinds_) {\n prior_[k] = likelihood_empty;\n }\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::remove_empty_kind (size_t kindid)\n{\n empty_kinds_.erase(kindid);\n --empty_kind_count_;\n const float likelihood_empty = get_likelihood_empty();\n for (auto k : empty_kinds_) {\n prior_[k] = likelihood_empty;\n }\n}\n\ninline float Algorithm8::BlockPitmanYorSampler::compute_posterior (\n const VectorFloat & prior_in,\n const VectorFloat & likelihood_in,\n VectorFloat & posterior_out)\n{\n const size_t size = prior_in.size();\n const float * __restrict__ prior =\n DIST_ASSUME_ALIGNED(prior_in.data());\n const float * __restrict__ likelihood =\n DIST_ASSUME_ALIGNED(likelihood_in.data());\n float * __restrict__ posterior =\n DIST_ASSUME_ALIGNED(posterior_out.data());\n\n float total = 0;\n for (size_t i = 0; i < size; ++i) {\n total += posterior[i] = prior[i] * likelihood[i];\n }\n return total;\n}\n\nusing distributions::sample_from_likelihoods;\n\nvoid Algorithm8::BlockPitmanYorSampler::run (\n size_t iterations,\n rng_t & rng)\n{\n LOOM_ASSERT_LT(0, iterations);\n\n for (size_t i = 0; i < iterations; ++i) {\n for (size_t f = 0; f < feature_count_; ++f) {\n size_t k = assignments_[f];\n\n if (--counts_[k] == 0) {\n add_empty_kind(k);\n } else {\n prior_[k] = counts_[k] - d_;\n }\n\n const VectorFloat & likelihood = likelihoods_[f];\n float total = compute_posterior(prior_, likelihood, posterior_);\n k = sample_from_likelihoods(rng, posterior_, total);\n assignments_[f] = k;\n\n if (counts_[k]++ == 0) {\n remove_empty_kind(k);\n }\n prior_[k] = counts_[k] - d_;\n\n if (LOOM_DEBUG_LEVEL >= 3) {\n validate();\n }\n }\n }\n}\n\nvoid Algorithm8::infer_assignments (\n std::vector & featureid_to_kindid,\n size_t iterations,\n bool parallel,\n rng_t & rng) const\n{\n LOOM_ASSERT_LT(0, iterations);\n\n const auto seed = rng();\n const size_t feature_count = featureid_to_kindid.size();\n const size_t kind_count = kinds.size();\n std::vector likelihoods(feature_count);\n\n #pragma omp parallel if (parallel)\n {\n rng_t rng;\n\n #pragma omp for schedule(dynamic, 1)\n for (size_t f = 0; f < feature_count; ++f) {\n rng.seed(seed + f);\n VectorFloat & scores = likelihoods[f];\n scores.resize(kind_count);\n for (size_t k = 0; k < kind_count; ++k) {\n const auto & mixture = kinds[k].mixture;\n scores[k] = mixture.score_feature(model, f, rng);\n }\n distributions::scores_to_likelihoods(scores);\n }\n }\n\n BlockPitmanYorSampler sampler(\n feature_clustering,\n likelihoods,\n featureid_to_kindid);\n\n sampler.run(iterations, rng);\n}\n\n} \/\/ namespace loom\nFix parallelization bug#include \"algorithm8.hpp\"\n#include \n#include \n#include \n#include \n\n#define LOOM_ASSERT_CLOSE(x, y) \\\n LOOM_ASSERT_LT(fabs((x) - (y)) \/ ((x) + (y) + 1e-20), 1e-4)\n\nnamespace loom\n{\n\nvoid Algorithm8::clear ()\n{\n model.clear();\n kinds.clear();\n}\n\nvoid Algorithm8::model_load (const CrossCat & cross_cat)\n{\n clear();\n feature_clustering = cross_cat.feature_clustering;\n for (const auto & kind : cross_cat.kinds) {\n model.extend(kind.model);\n }\n LOOM_ASSERT_EQ(model.schema, cross_cat.schema);\n}\n\nvoid Algorithm8::mixture_init_empty (\n const CrossCat & cross_cat,\n rng_t & rng)\n{\n const size_t kind_count = cross_cat.kinds.size();\n LOOM_ASSERT_LT(0, kind_count);\n kinds.resize(kind_count);\n for (size_t i = 0; i < kind_count; ++i) {\n const auto & counts = cross_cat.kinds[i].mixture.clustering.counts();\n kinds[i].mixture.init_unobserved(model, counts, rng);\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ Block Pitman-Yor Sampler\n\/\/\n\/\/ This sampler follows the math in\n\/\/ $DISTRIBUTIONS_PATH\/src\/clustering.hpp\n\/\/ distributions::Clustering::PitmanYor::sample_assignments(...)\n\nclass Algorithm8::BlockPitmanYorSampler\n{\npublic:\n\n BlockPitmanYorSampler (\n const distributions::Clustering::PitmanYor & clustering,\n const std::vector & likelihoods,\n std::vector & assignments);\n\n void run (size_t iterations, rng_t & rng);\n\n typedef std::unordered_set>\n IdSet;\n\nprivate:\n\n void validate () const;\n\n float get_likelihood_empty () const;\n std::vector get_counts_from_assignments () const;\n IdSet get_empty_kinds_from_counts () const;\n VectorFloat get_prior_from_counts () const;\n void add_empty_kind (size_t kindid);\n void remove_empty_kind (size_t kindid);\n\n static float compute_posterior (\n const VectorFloat & prior_in,\n const VectorFloat & likelihood_in,\n VectorFloat & posterior_out);\n\n const float alpha_;\n const float d_;\n const size_t feature_count_;\n const size_t kind_count_;\n const std::vector & likelihoods_;\n std::vector & assignments_;\n std::vector counts_;\n IdSet empty_kinds_;\n size_t empty_kind_count_;\n VectorFloat prior_;\n VectorFloat posterior_;\n};\n\nAlgorithm8::BlockPitmanYorSampler::BlockPitmanYorSampler (\n const distributions::Clustering::PitmanYor & clustering,\n const std::vector & likelihoods,\n std::vector & assignments) :\n alpha_(clustering.alpha),\n d_(clustering.d),\n feature_count_(likelihoods.size()),\n kind_count_(likelihoods[0].size()),\n likelihoods_(likelihoods),\n assignments_(assignments),\n counts_(get_counts_from_assignments()),\n empty_kinds_(get_empty_kinds_from_counts()),\n empty_kind_count_(empty_kinds_.size()),\n prior_(get_prior_from_counts()),\n posterior_(kind_count_)\n{\n LOOM_ASSERT_LT(0, alpha_);\n LOOM_ASSERT_LE(0, d_);\n LOOM_ASSERT_LT(d_, 1);\n\n LOOM_ASSERT_LT(0, likelihoods.size());\n LOOM_ASSERT_EQ(likelihoods.size(), assignments.size());\n for (const auto & likelihood : likelihoods) {\n LOOM_ASSERT_EQ(likelihood.size(), kind_count_);\n }\n}\n\ninline std::vector\n Algorithm8::BlockPitmanYorSampler::get_counts_from_assignments () const\n{\n std::vector counts(kind_count_, 0);\n for (size_t f = 0; f < feature_count_; ++f) {\n size_t k = assignments_[f];\n LOOM_ASSERT1(k < kind_count_, \"bad kind id: \" << k);\n ++counts[k];\n }\n return counts;\n}\n\ninline Algorithm8::BlockPitmanYorSampler::IdSet\n Algorithm8::BlockPitmanYorSampler::get_empty_kinds_from_counts () const\n{\n IdSet empty_kinds;\n for (size_t k = 0; k < kind_count_; ++k) {\n if (counts_[k] == 0) {\n empty_kinds.insert(k);\n }\n }\n return empty_kinds;\n}\n\ninline VectorFloat\n Algorithm8::BlockPitmanYorSampler::get_prior_from_counts () const\n{\n VectorFloat prior(kind_count_);\n const float likelihood_empty = get_likelihood_empty();\n for (size_t k = 0; k < kind_count_; ++k) {\n if (auto count = counts_[k]) {\n prior[k] = count - d_;\n } else {\n prior[k] = likelihood_empty;\n }\n }\n return prior;\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::validate () const\n{\n std::vector expected_counts = get_counts_from_assignments();\n for (size_t k = 0; k < kind_count_; ++k) {\n LOOM_ASSERT_EQ(counts_[k], expected_counts[k]);\n }\n\n LOOM_ASSERT_EQ(empty_kind_count_, empty_kinds_.size());\n for (size_t k = 0; k < kind_count_; ++k) {\n bool in_empty_kinds = (empty_kinds_.find(k) != empty_kinds_.end());\n bool has_zero_count = (counts_[k] == 0);\n LOOM_ASSERT_EQ(in_empty_kinds, has_zero_count);\n }\n\n VectorFloat expected_prior = get_prior_from_counts();\n for (size_t k = 0; k < kind_count_; ++k) {\n LOOM_ASSERT_CLOSE(prior_[k], expected_prior[k]);\n }\n}\n\ninline float Algorithm8::BlockPitmanYorSampler::get_likelihood_empty () const\n{\n if (empty_kind_count_) {\n float nonempty_kind_count = kind_count_ - empty_kind_count_;\n return (alpha_ + d_ * nonempty_kind_count) \/ empty_kind_count_;\n } else {\n return 0.f;\n }\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::add_empty_kind (size_t kindid)\n{\n empty_kinds_.insert(kindid);\n ++empty_kind_count_;\n const float likelihood_empty = get_likelihood_empty();\n for (auto k : empty_kinds_) {\n prior_[k] = likelihood_empty;\n }\n}\n\ninline void Algorithm8::BlockPitmanYorSampler::remove_empty_kind (size_t kindid)\n{\n empty_kinds_.erase(kindid);\n --empty_kind_count_;\n const float likelihood_empty = get_likelihood_empty();\n for (auto k : empty_kinds_) {\n prior_[k] = likelihood_empty;\n }\n}\n\ninline float Algorithm8::BlockPitmanYorSampler::compute_posterior (\n const VectorFloat & prior_in,\n const VectorFloat & likelihood_in,\n VectorFloat & posterior_out)\n{\n const size_t size = prior_in.size();\n const float * __restrict__ prior =\n DIST_ASSUME_ALIGNED(prior_in.data());\n const float * __restrict__ likelihood =\n DIST_ASSUME_ALIGNED(likelihood_in.data());\n float * __restrict__ posterior =\n DIST_ASSUME_ALIGNED(posterior_out.data());\n\n float total = 0;\n for (size_t i = 0; i < size; ++i) {\n total += posterior[i] = prior[i] * likelihood[i];\n }\n return total;\n}\n\nusing distributions::sample_from_likelihoods;\n\nvoid Algorithm8::BlockPitmanYorSampler::run (\n size_t iterations,\n rng_t & rng)\n{\n LOOM_ASSERT_LT(0, iterations);\n\n for (size_t i = 0; i < iterations; ++i) {\n for (size_t f = 0; f < feature_count_; ++f) {\n size_t k = assignments_[f];\n\n if (--counts_[k] == 0) {\n add_empty_kind(k);\n } else {\n prior_[k] = counts_[k] - d_;\n }\n\n const VectorFloat & likelihood = likelihoods_[f];\n float total = compute_posterior(prior_, likelihood, posterior_);\n k = sample_from_likelihoods(rng, posterior_, total);\n assignments_[f] = k;\n\n if (counts_[k]++ == 0) {\n remove_empty_kind(k);\n }\n prior_[k] = counts_[k] - d_;\n\n if (LOOM_DEBUG_LEVEL >= 3) {\n validate();\n }\n }\n }\n}\n\nvoid Algorithm8::infer_assignments (\n std::vector & featureid_to_kindid,\n size_t iterations,\n bool parallel,\n rng_t & rng) const\n{\n LOOM_ASSERT_LT(0, iterations);\n\n const auto seed = rng();\n const size_t feature_count = featureid_to_kindid.size();\n const size_t kind_count = kinds.size();\n std::vector likelihoods(feature_count);\n for (auto & likelihood : likelihoods) {\n likelihood.resize(kind_count);\n }\n\n #pragma omp parallel if (parallel)\n {\n rng_t rng;\n\n #pragma omp for schedule(dynamic, 1)\n for (size_t f = 0; f < feature_count; ++f) {\n rng.seed(seed + f);\n VectorFloat & scores = likelihoods[f];\n for (size_t k = 0; k < kind_count; ++k) {\n const auto & mixture = kinds[k].mixture;\n scores[k] = mixture.score_feature(model, f, rng);\n }\n distributions::scores_to_likelihoods(scores);\n }\n }\n\n BlockPitmanYorSampler sampler(\n feature_clustering,\n likelihoods,\n featureid_to_kindid);\n\n sampler.run(iterations, rng);\n}\n\n} \/\/ namespace loom\n<|endoftext|>"} {"text":"#ifndef ALIGNMENT_H\n#define ALIGNMENT_H\n\n#include \n#include \n#include \n#include \"utility.hpp\"\n#include \"path.hpp\"\n#include \"position.hpp\"\n#include \"vg.pb.h\"\n\n#include \"htslib\/hfile.h\"\n#include \"htslib\/hts.h\"\n#include \"htslib\/sam.h\"\n#include \"htslib\/vcf.h\"\n\nnamespace vg {\n\nconst char* const BAM_DNA_LOOKUP = \"=ACMGRSVTWYHKDBN\";\n\nint hts_for_each(string& filename, function lambda);\nint hts_for_each_parallel(string& filename, function lambda);\nint fastq_for_each(string& filename, function lambda);\nbool get_next_alignment_from_fastq(gzFile fp, char* buffer, size_t len, Alignment& alignment);\nbool get_next_interleaved_alignment_pair_from_fastq(gzFile fp, char* buffer, size_t len, Alignment& mate1, Alignment& mate2);\nbool get_next_alignment_pair_from_fastqs(gzFile fp1, gzFile fp2, char* buffer, size_t len, Alignment& mate1, Alignment& mate2);\n\nsize_t fastq_unpaired_for_each(string& filename, function lambda);\nsize_t fastq_paired_interleaved_for_each(string& filename, function lambda);\nsize_t fastq_paired_two_files_for_each(string& file1, string& file2, function lambda);\n\/\/ parallel versions of above\nsize_t fastq_unpaired_for_each_parallel(string& filename, function lambda);\nsize_t fastq_paired_interleaved_for_each_parallel(string& filename, function lambda);\nsize_t fastq_paired_two_files_for_each_parallel(string& file1, string& file2, function lambda);\n\nbam_hdr_t* hts_file_header(string& filename, string& header);\nbam_hdr_t* hts_string_header(string& header,\n map& path_length,\n map& rg_sample);\nvoid write_alignments(std::ostream& out, vector& buf);\nvoid write_alignment_to_file(const string& file, const Alignment& aln);\n\nvoid mapping_cigar(const Mapping& mapping, vector >& cigar);\nstring cigar_string(vector >& cigar);\nstring mapping_string(const string& source, const Mapping& mapping);\n\nAlignment bam_to_alignment(const bam1_t *b, map& rg_sample);\n\nbam1_t* alignment_to_bam(const string& sam_header,\n const Alignment& alignment,\n const string& refseq,\n const int32_t refpos,\n const bool refrev,\n const string& cigar,\n const string& mateseq,\n const int32_t matepos,\n const int32_t tlen);\n\nstring alignment_to_sam(const Alignment& alignment,\n const string& refseq,\n const int32_t refpos,\n const bool refrev,\n const string& cigar,\n const string& mateseq,\n const int32_t matepos,\n const int32_t tlen);\n\nstring cigar_against_path(const Alignment& alignment, bool on_reverse_strand);\n\nint32_t sam_flag(const Alignment& alignment, bool on_reverse_strand);\nshort quality_char_to_short(char c);\nchar quality_short_to_char(short i);\nstring string_quality_char_to_short(const string& quality);\nstring string_quality_short_to_char(const string& quality);\nvoid alignment_quality_char_to_short(Alignment& alignment);\nvoid alignment_quality_short_to_char(Alignment& alignment);\nvoid parse_rg_sample_map(char* hts_header, map& rg_sample);\nint alignment_to_length(const Alignment& a);\nint alignment_from_length(const Alignment& a);\n\/\/ Adds a2 onto the end of a1, returns reference to a1\nAlignment& extend_alignment(Alignment& a1, const Alignment& a2, bool debug=false);\n\/\/ Merge a set of alignments into one\nAlignment merge_alignments(const vector& alns, bool debug=false);\n\/\/ Merge two alignments end-to-end (could be \"concat\")\nAlignment merge_alignments(const Alignment& a1, const Alignment& a2, bool debug=false);\nAlignment strip_from_start(const Alignment& aln, size_t drop);\nAlignment strip_from_end(const Alignment& aln, size_t drop);\nAlignment trim_alignment(const Alignment& aln, const Position& pos1, const Position& pos2);\nvector alignment_ends(const Alignment& aln, size_t len1, size_t len2);\n\/\/ generate a digest of the alignmnet\nconst string hash_alignment(const Alignment& aln);\n\/\/ Flip the alignment's sequence and is_reverse flag, and flip and re-order its\n\/\/ Mappings to match. A function to get node lengths is needed because the\n\/\/ Mappings in the alignment will need to give their positions from the opposite\n\/\/ ends of their nodes. Offsets will be updated to count unused bases from node\n\/\/ start when considering the node in its new orientation.\nAlignment reverse_complement_alignment(const Alignment& aln, const function& node_length);\nvector reverse_complement_alignments(const vector& alns, const function& node_length);\nint softclip_start(const Alignment& alignment);\nint softclip_end(const Alignment& alignment);\nsize_t to_length_after_pos(const Alignment& aln, const Position& pos);\nsize_t from_length_after_pos(const Alignment& aln, const Position& pos);\nsize_t to_length_before_pos(const Alignment& aln, const Position& pos);\nsize_t from_length_before_pos(const Alignment& aln, const Position& pos);\n\n\/\/ project the alignment's path back into a different ID space\nvoid translate_nodes(Alignment& a, const map >& ids, const std::function& node_length);\n\n\/\/ Invert the orientation in the alignment of all the nodes whose IDs are\n\/\/ listed. It needs a callback to ask the length of any given node.\nvoid flip_nodes(Alignment& a, const set& ids, const std::function& node_length);\n\n\/\/ simplifies the path in the alignment\nAlignment simplify(const Alignment& a);\nvoid write_alignment_to_file(const Alignment& aln, const string& filename);\n\n\/\/ quality information; a kind of poor man's pileup\nmap alignment_quality_per_node(const Alignment& aln);\n\n}\n\n#endif\nFinish documenting alignment simplification#ifndef ALIGNMENT_H\n#define ALIGNMENT_H\n\n#include \n#include \n#include \n#include \"utility.hpp\"\n#include \"path.hpp\"\n#include \"position.hpp\"\n#include \"vg.pb.h\"\n\n#include \"htslib\/hfile.h\"\n#include \"htslib\/hts.h\"\n#include \"htslib\/sam.h\"\n#include \"htslib\/vcf.h\"\n\nnamespace vg {\n\nconst char* const BAM_DNA_LOOKUP = \"=ACMGRSVTWYHKDBN\";\n\nint hts_for_each(string& filename, function lambda);\nint hts_for_each_parallel(string& filename, function lambda);\nint fastq_for_each(string& filename, function lambda);\nbool get_next_alignment_from_fastq(gzFile fp, char* buffer, size_t len, Alignment& alignment);\nbool get_next_interleaved_alignment_pair_from_fastq(gzFile fp, char* buffer, size_t len, Alignment& mate1, Alignment& mate2);\nbool get_next_alignment_pair_from_fastqs(gzFile fp1, gzFile fp2, char* buffer, size_t len, Alignment& mate1, Alignment& mate2);\n\nsize_t fastq_unpaired_for_each(string& filename, function lambda);\nsize_t fastq_paired_interleaved_for_each(string& filename, function lambda);\nsize_t fastq_paired_two_files_for_each(string& file1, string& file2, function lambda);\n\/\/ parallel versions of above\nsize_t fastq_unpaired_for_each_parallel(string& filename, function lambda);\nsize_t fastq_paired_interleaved_for_each_parallel(string& filename, function lambda);\nsize_t fastq_paired_two_files_for_each_parallel(string& file1, string& file2, function lambda);\n\nbam_hdr_t* hts_file_header(string& filename, string& header);\nbam_hdr_t* hts_string_header(string& header,\n map& path_length,\n map& rg_sample);\nvoid write_alignments(std::ostream& out, vector& buf);\nvoid write_alignment_to_file(const string& file, const Alignment& aln);\n\nvoid mapping_cigar(const Mapping& mapping, vector >& cigar);\nstring cigar_string(vector >& cigar);\nstring mapping_string(const string& source, const Mapping& mapping);\n\nAlignment bam_to_alignment(const bam1_t *b, map& rg_sample);\n\nbam1_t* alignment_to_bam(const string& sam_header,\n const Alignment& alignment,\n const string& refseq,\n const int32_t refpos,\n const bool refrev,\n const string& cigar,\n const string& mateseq,\n const int32_t matepos,\n const int32_t tlen);\n\nstring alignment_to_sam(const Alignment& alignment,\n const string& refseq,\n const int32_t refpos,\n const bool refrev,\n const string& cigar,\n const string& mateseq,\n const int32_t matepos,\n const int32_t tlen);\n\nstring cigar_against_path(const Alignment& alignment, bool on_reverse_strand);\n\nint32_t sam_flag(const Alignment& alignment, bool on_reverse_strand);\nshort quality_char_to_short(char c);\nchar quality_short_to_char(short i);\nstring string_quality_char_to_short(const string& quality);\nstring string_quality_short_to_char(const string& quality);\nvoid alignment_quality_char_to_short(Alignment& alignment);\nvoid alignment_quality_short_to_char(Alignment& alignment);\nvoid parse_rg_sample_map(char* hts_header, map& rg_sample);\nint alignment_to_length(const Alignment& a);\nint alignment_from_length(const Alignment& a);\n\/\/ Adds a2 onto the end of a1, returns reference to a1\nAlignment& extend_alignment(Alignment& a1, const Alignment& a2, bool debug=false);\n\/\/ Merge a set of alignments into one\nAlignment merge_alignments(const vector& alns, bool debug=false);\n\/\/ Merge two alignments end-to-end (could be \"concat\")\nAlignment merge_alignments(const Alignment& a1, const Alignment& a2, bool debug=false);\nAlignment strip_from_start(const Alignment& aln, size_t drop);\nAlignment strip_from_end(const Alignment& aln, size_t drop);\nAlignment trim_alignment(const Alignment& aln, const Position& pos1, const Position& pos2);\nvector alignment_ends(const Alignment& aln, size_t len1, size_t len2);\n\/\/ generate a digest of the alignmnet\nconst string hash_alignment(const Alignment& aln);\n\/\/ Flip the alignment's sequence and is_reverse flag, and flip and re-order its\n\/\/ Mappings to match. A function to get node lengths is needed because the\n\/\/ Mappings in the alignment will need to give their positions from the opposite\n\/\/ ends of their nodes. Offsets will be updated to count unused bases from node\n\/\/ start when considering the node in its new orientation.\nAlignment reverse_complement_alignment(const Alignment& aln, const function& node_length);\nvector reverse_complement_alignments(const vector& alns, const function& node_length);\nint softclip_start(const Alignment& alignment);\nint softclip_end(const Alignment& alignment);\nsize_t to_length_after_pos(const Alignment& aln, const Position& pos);\nsize_t from_length_after_pos(const Alignment& aln, const Position& pos);\nsize_t to_length_before_pos(const Alignment& aln, const Position& pos);\nsize_t from_length_before_pos(const Alignment& aln, const Position& pos);\n\n\/\/ project the alignment's path back into a different ID space\nvoid translate_nodes(Alignment& a, const map >& ids, const std::function& node_length);\n\n\/\/ Invert the orientation in the alignment of all the nodes whose IDs are\n\/\/ listed. It needs a callback to ask the length of any given node.\nvoid flip_nodes(Alignment& a, const set& ids, const std::function& node_length);\n\n\/\/\/ Simplifies the Path in the Alignment. Note that this removes deletions at\n\/\/\/ the start and end of Mappings, so code that handles simplified Alignments\n\/\/\/ needs to handle offsets on internal Mappings.\nAlignment simplify(const Alignment& a);\nvoid write_alignment_to_file(const Alignment& aln, const string& filename);\n\n\/\/ quality information; a kind of poor man's pileup\nmap alignment_quality_per_node(const Alignment& aln);\n\n}\n\n#endif\n<|endoftext|>"} {"text":"#include \nusing namespace std;\n\n#include \n#include \n#include \n#include \"amzHeaders.h\"\n\n\nAmzHeaders::AmzHeaders() {\n\tthis->count=0;\n\tthis->namesLength=0;\n\tthis->valuesLength=0;\n}\n\nAmzHeaders::~AmzHeaders() {\n\tfor (int i=0;icount;i++) {\n\t\tthis->names[i] = NULL;\n\t\tfree(this->values[i]);\n\t}\n}\n\nvoid AmzHeaders::add(char *name, char *format, ...) {\n\tthis->names[this->count]=name;\n\n\tchar *result;\n\tva_list args;\n\tva_start(args, format);\n\tvasprintf(&result, format, args);\n\tva_end(args);\n\n\tthis->values[this->count]=result;\n\n\tthis->namesLength+=strlen(name);\n\tthis->valuesLength+=strlen(result);\n\n\tthis->count++;\n}\n\nchar *AmzHeaders::serializeIntoStringToSign() {\n\t\/\/ add 2 chars for each entry because each entry is joined by \":\" and ended with \\n\n\tint len = this->namesLength + this->valuesLength + (this->count * 2) + 2;\n\tchar *result = (char *) malloc(len);\n\tresult[0]=0;\n\tfor (int i=0;icount;i++) {\n\t\tstrcat(result, this->names[i]);\n\t\tstrcat(result, \":\");\n\t\tstrcat(result, this->values[i]);\n\t\tstrcat(result, \"\\n\");\n\t}\n\n\treturn result;\n}\n\nstruct curl_slist *AmzHeaders::serializeIntoCurl(struct curl_slist *slist) {\n\tstruct curl_slist *slist2 = slist;\n\tchar value[1024*10];\n\tfor (int i=0;icount;i++) {\n\t\tsprintf(value, \"%s: %s\", this->names[i], this->values[i]);\n\t\tslist2 = curl_slist_append(slist2, value);\n\t}\n\n\treturn slist2;\n}\nsort headers#include \n#include \n#include \nusing namespace std;\n\n#include \n#include \n#include \n#include \"amzHeaders.h\"\n\n\nAmzHeaders::AmzHeaders() {\n\tthis->count=0;\n\tthis->namesLength=0;\n\tthis->valuesLength=0;\n}\n\nAmzHeaders::~AmzHeaders() {\n\tfor (int i=0;icount;i++) {\n\t\tthis->names[i] = NULL;\n\t\tfree(this->values[i]);\n\t}\n}\n\nvoid AmzHeaders::add(char *name, char *format, ...) {\n\tthis->names[this->count]=name;\n\n\tchar *result;\n\tva_list args;\n\tva_start(args, format);\n\tvasprintf(&result, format, args);\n\tva_end(args);\n\n\tthis->values[this->count]=result;\n\n\tthis->namesLength+=strlen(name);\n\tthis->valuesLength+=strlen(result);\n\n\tthis->count++;\n}\n\nchar *AmzHeaders::serializeIntoStringToSign() {\n\t\/\/ okay here I cheat and use C++. Please forgive me or rewrite in plain C.\n\tstd::vector headersList;\n\tfor (int i=0;icount;i++) {\n\t\tchar *header;\n\t\tasprintf(&header, \"%s:%s\\n\", this->names[i], this->values[i]);\n\t\theadersList.push_back(header);\n\t\tfree(header);\n\t}\n\n\tstd::sort(headersList.begin(), headersList.end());\n\n\tstd::string result;\n\n\tfor (int i=0;icount;i++) {\n\t\tresult.append(headersList[i]);\n\t}\n\n\treturn strdup((char *) result.c_str());\n}\n\nstruct curl_slist *AmzHeaders::serializeIntoCurl(struct curl_slist *slist) {\n\tstruct curl_slist *slist2 = slist;\n\tchar value[1024*10];\n\tfor (int i=0;icount;i++) {\n\t\tsprintf(value, \"%s: %s\", this->names[i], this->values[i]);\n\t\tslist2 = curl_slist_append(slist2, value);\n\t}\n\n\treturn slist2;\n}\n<|endoftext|>"} {"text":"\/**\n * Copyright (c) 2015 - The CM Authors \n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \n#include \n#include \n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-dproc\/LocalScheduler.h\"\n#include \"fnord-dproc\/DispatchService.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-afx\/ArtifactReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"CustomerNamespace.h\"\n#include \"analytics\/AnalyticsServlet.h\"\n#include \"analytics\/FeedExportApp.h\"\n#include \"analytics\/CTRByPositionQuery.h\"\n#include \"analytics\/CTRByPageQuery.h\"\n#include \"analytics\/CTRByResultItemCategoryQuery.h\"\n#include \"analytics\/TopSearchQueriesQuery.h\"\n#include \"analytics\/DiscoveryDashboardQuery.h\"\n#include \"analytics\/DiscoveryCatalogStatsQuery.h\"\n#include \"analytics\/DiscoveryCategoryStatsQuery.h\"\n#include \"analytics\/DiscoverySearchStatsQuery.h\"\n#include \"analytics\/ECommerceKPIQuery.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/ShopStatsServlet.h\"\n\nusing namespace fnord;\n\nfnord::thread::EventLoop ev;\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"http_port\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8000\",\n \"Start the public http server on this port\",\n \"\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"datadir path\",\n \"\");\n\n flags.defineFlag(\n \"shopstats_table\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"path\",\n \"\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* thread pools *\/\n fnord::thread::ThreadPool tpool;\n fnord::thread::FixedSizeThreadPool wpool(8);\n wpool.start();\n\n \/* http *\/\n fnord::http::HTTPRouter http_router;\n fnord::http::HTTPServer http_server(&http_router, &ev);\n http_server.listen(flags.getInt(\"http_port\"));\n http::HTTPConnectionPool http(&ev);\n\n \/* tsdb *\/\n tsdb::TSDBClient tsdb(\"http:\/\/nue03.prod.fnrd.net:7003\/tsdb\", &http);\n\n \/* dproc *\/\n dproc::DispatchService dproc;\n auto local_scheduler = mkRef(new dproc::LocalScheduler());\n local_scheduler->start();\n\n \/* feed export *\/\n auto feed_export_app = mkRef(new FeedExportApp(&tsdb));\n dproc.registerApp(feed_export_app.get(), local_scheduler.get());\n\n {\n FeedConfig fc;\n fc.set_customer(\"dawanda\");\n fc.set_feed(\"ECommerceSearchQueriesFeed\");\n fc.set_partition_size(kMicrosPerHour * 4);\n fc.set_first_partition(1430438400000000); \/\/ 2015-05-01 00:00:00Z\n fc.set_num_shards(128);\n\n feed_export_app->configureFeed(fc);\n }\n\n {\n FeedConfig fc;\n fc.set_customer(\"dawanda\");\n fc.set_feed(\"ECommerceRecoQueriesFeed\");\n fc.set_partition_size(kMicrosPerHour * 4);\n fc.set_first_partition(1431014400000000);\n fc.set_num_shards(32);\n\n feed_export_app->configureFeed(fc);\n }\n\n \/* stop stats *\/\n \/\/auto shopstats = cm::ShopStatsTable::open(flags.getString(\"shopstats_table\"));\n \/\/cm::ShopStatsServlet shopstats_servlet(shopstats);\n \/\/http_router.addRouteByPrefixMatch(\"\/shopstats\", &shopstats_servlet, &tpool);\n\n \/* analytics core *\/\n auto dir = flags.getString(\"datadir\");\n cm::AnalyticsQueryEngine analytics(32, dir, &tsdb);\n cm::AnalyticsServlet analytics_servlet(&analytics, &dproc);\n http_router.addRouteByPrefixMatch(\"\/analytics\", &analytics_servlet, &tpool);\n\n analytics.registerQueryFactory(\"ctr_by_position\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByPositionQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"ctr_by_page\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByPageQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"ctr_by_result_item_category\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByResultItemCategoryQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"discovery_dashboard\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryDashboardQuery(\n scan,\n segments,\n query.start_time,\n query.end_time);\n });\n\n analytics.registerQueryFactory(\"discovery_search_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoverySearchStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_catalog_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCatalogStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category0_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category1\",\n \"search_queries.category1\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category1_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category1\",\n \"search_queries.category2\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category2_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category2\",\n \"search_queries.category3\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category3_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category3\",\n \"search_queries.category3\",\n params);\n });\n\n analytics.registerQueryFactory(\"top_search_queries\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::TopSearchQueriesQuery(scan, segments, params);\n });\n\n analytics.registerQueryFactory(\"ecommerce_dashboard\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::ECommerceKPIQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n ev.run();\n local_scheduler->stop();\n\n fnord::logInfo(\"cm.analytics.backend\", \"Exiting...\");\n exit(0);\n}\n\ncleaning up\/**\n * Copyright (c) 2015 - The CM Authors \n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include \n#include \n#include \n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/thread\/FixedSizeThreadPool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-http\/VFSFileServlet.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-dproc\/LocalScheduler.h\"\n#include \"fnord-dproc\/DispatchService.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-logtable\/LogTableServlet.h\"\n#include \"fnord-logtable\/TableRepository.h\"\n#include \"fnord-logtable\/TableJanitor.h\"\n#include \"fnord-logtable\/TableReplication.h\"\n#include \"fnord-afx\/ArtifactReplication.h\"\n#include \"fnord-logtable\/NumericBoundsSummary.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n#include \"CustomerNamespace.h\"\n#include \"analytics\/AnalyticsServlet.h\"\n#include \"analytics\/FeedExportApp.h\"\n#include \"analytics\/CTRByPositionQuery.h\"\n#include \"analytics\/CTRByPageQuery.h\"\n#include \"analytics\/CTRByResultItemCategoryQuery.h\"\n#include \"analytics\/TopSearchQueriesQuery.h\"\n#include \"analytics\/DiscoveryDashboardQuery.h\"\n#include \"analytics\/DiscoveryCatalogStatsQuery.h\"\n#include \"analytics\/DiscoveryCategoryStatsQuery.h\"\n#include \"analytics\/DiscoverySearchStatsQuery.h\"\n#include \"analytics\/ECommerceKPIQuery.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/AnalyticsQueryEngine.h\"\n#include \"analytics\/ShopStatsServlet.h\"\n\nusing namespace fnord;\n\nfnord::thread::EventLoop ev;\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"http_port\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8000\",\n \"Start the public http server on this port\",\n \"\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"datadir path\",\n \"\");\n\n flags.defineFlag(\n \"shopstats_table\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"path\",\n \"\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* thread pools *\/\n fnord::thread::ThreadPool tpool;\n fnord::thread::FixedSizeThreadPool wpool(8);\n wpool.start();\n\n \/* http *\/\n fnord::http::HTTPRouter http_router;\n fnord::http::HTTPServer http_server(&http_router, &ev);\n http_server.listen(flags.getInt(\"http_port\"));\n http::HTTPConnectionPool http(&ev);\n\n \/* tsdb *\/\n tsdb::TSDBClient tsdb(\"http:\/\/nue03.prod.fnrd.net:7003\/tsdb\", &http);\n\n \/* dproc *\/\n dproc::DispatchService dproc;\n auto local_scheduler = mkRef(new dproc::LocalScheduler());\n local_scheduler->start();\n\n \/* feed export *\/\n auto feed_export_app = mkRef(new FeedExportApp(&tsdb));\n dproc.registerApp(feed_export_app.get(), local_scheduler.get());\n\n {\n FeedConfig fc;\n fc.set_customer(\"dawanda\");\n fc.set_feed(\"ECommerceSearchQueriesFeed\");\n fc.set_partition_size(kMicrosPerHour * 4);\n fc.set_first_partition(1430438400000000); \/\/ 2015-05-01 00:00:00Z\n fc.set_num_shards(128);\n\n feed_export_app->configureFeed(fc);\n }\n\n {\n FeedConfig fc;\n fc.set_customer(\"dawanda\");\n fc.set_feed(\"ECommerceRecoQueriesFeed\");\n fc.set_partition_size(kMicrosPerHour * 4);\n fc.set_first_partition(1432785600000000);\n fc.set_num_shards(32);\n\n feed_export_app->configureFeed(fc);\n }\n\n \/* stop stats *\/\n \/\/auto shopstats = cm::ShopStatsTable::open(flags.getString(\"shopstats_table\"));\n \/\/cm::ShopStatsServlet shopstats_servlet(shopstats);\n \/\/http_router.addRouteByPrefixMatch(\"\/shopstats\", &shopstats_servlet, &tpool);\n\n \/* analytics core *\/\n auto dir = flags.getString(\"datadir\");\n cm::AnalyticsQueryEngine analytics(32, dir, &tsdb);\n cm::AnalyticsServlet analytics_servlet(&analytics, &dproc);\n http_router.addRouteByPrefixMatch(\"\/analytics\", &analytics_servlet, &tpool);\n\n analytics.registerQueryFactory(\"ctr_by_position\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByPositionQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"ctr_by_page\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByPageQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"ctr_by_result_item_category\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::CTRByResultItemCategoryQuery(scan, segments);\n });\n\n analytics.registerQueryFactory(\"discovery_dashboard\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryDashboardQuery(\n scan,\n segments,\n query.start_time,\n query.end_time);\n });\n\n analytics.registerQueryFactory(\"discovery_search_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoverySearchStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_catalog_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCatalogStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category0_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category1\",\n \"search_queries.category1\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category1_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category1\",\n \"search_queries.category2\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category2_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category2\",\n \"search_queries.category3\",\n params);\n });\n\n analytics.registerQueryFactory(\"discovery_category3_stats\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::DiscoveryCategoryStatsQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n \"search_queries.category3\",\n \"search_queries.category3\",\n params);\n });\n\n analytics.registerQueryFactory(\"top_search_queries\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::TopSearchQueriesQuery(scan, segments, params);\n });\n\n analytics.registerQueryFactory(\"ecommerce_dashboard\", [] (\n const cm::AnalyticsQuery& query,\n const cm::AnalyticsQuery::SubQueryParams params,\n const Vector>& segments,\n cm::AnalyticsTableScan* scan) {\n return new cm::ECommerceKPIQuery(\n scan,\n segments,\n query.start_time,\n query.end_time,\n params);\n });\n\n ev.run();\n local_scheduler->stop();\n\n fnord::logInfo(\"cm.analytics.backend\", \"Exiting...\");\n exit(0);\n}\n\n<|endoftext|>"} {"text":"\/\/\/ @file\n\/\/\/ @version 3.5\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/opensource.org\/licenses\/BSD-3-Clause\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"aprilUtil.h\"\n\n#define HSTR_SEPARATOR ','\n\nnamespace april\n{\n\tRenderOperation TriangleList = RO_TRIANGLE_LIST; \/\/ DEPRECATED\n\tRenderOperation TriangleStrip = RO_TRIANGLE_STRIP; \/\/ DEPRECATED\n\tRenderOperation TriangleFan = RO_TRIANGLE_FAN; \/\/ DEPRECATED\n\tRenderOperation LineList = RO_LINE_LIST; \/\/ DEPRECATED\n\tRenderOperation LineStrip = RO_LINE_STRIP; \/\/ DEPRECATED\n\tRenderOperation PointList = RO_POINT_LIST; \/\/ DEPRECATED\n\tRenderOperation RENDER_OP_UNDEFINED = RO_UNDEFINED; \/\/ DEPRECATED\n\tBlendMode DEFAULT = BM_DEFAULT; \/\/ DEPRECATED\n\tBlendMode ALPHA_BLEND = BM_ALPHA; \/\/ DEPRECATED\n\tBlendMode ADD = BM_ADD; \/\/ DEPRECATED\n\tBlendMode SUBTRACT = BM_SUBTRACT; \/\/ DEPRECATED\n\tBlendMode OVERWRITE = BM_OVERWRITE; \/\/ DEPRECATED\n\tBlendMode BLEND_MODE_UNDEFINED = BM_UNDEFINED; \/\/ DEPRECATED\n\tColorMode NORMAL = CM_DEFAULT; \/\/ DEPRECATED\n\tColorMode MULTIPLY = CM_MULTIPLY; \/\/ DEPRECATED\n\tColorMode LERP = CM_LERP; \/\/ DEPRECATED\n\tColorMode ALPHA_MAP = CM_ALPHA_MAP; \/\/ DEPRECATED\n\tColorMode COLOR_MODE_UNDEFINED = CM_UNDEFINED; \/\/ DEPRECATED\n\n\tconst char hstrSeparator = ',';\n\n\tvoid PlainVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid TexturedVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredTexturedVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredTexturedNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid TexturedNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid rgbToHsl(unsigned char r, unsigned char g, unsigned char b, float* h, float* s, float* l)\n\t{\n\t\tint min = hmin(hmin(r, g), b);\n\t\tint max = hmax(hmax(r, g), b);\n\t\tint delta = max - min;\n\t\t*h = *s = 0.0f;\n\t\t*l = (max + min) \/ 510.0f;\n\t\tif (delta > 0)\n\t\t{\n\t\t\tif (*l > 0.0f && *l < 1.0f)\n\t\t\t{\n\t\t\t\t*s = (delta \/ 255.0f) \/ (*l < 0.5f ? (2 * *l) : (2 - 2 * *l));\n\t\t\t}\n\t\t\tif (max == r)\n\t\t\t{\n\t\t\t\t*h = (g - b) \/ (float)delta;\n\t\t\t\tif (g < b)\n\t\t\t\t{\n\t\t\t\t\t*h += 6.0f;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (max == g)\n\t\t\t{\n\t\t\t\t*h += (b - r) \/ (float)delta + 2.0f;\n\t\t\t}\n\t\t\telse if (max == b)\n\t\t\t{\n\t\t\t\t*h += (r - g) \/ (float)delta + 4.0f;\n\t\t\t}\n\t\t\t*h *= 0.16666667f;\n\t\t}\n\t}\n\n\tfloat _colorHueToRgb(float p, float q, float h)\n\t{ \n\t\th = (h < 0 ? h + 1 : ((h > 1) ? h - 1 : h));\n\t\tif (h * 6 < 1)\n\t\t{\n\t\t\treturn p + (q - p) * h * 6;\n\t\t}\n\t\tif (h * 2 < 1)\n\t\t{\n\t\t\treturn q;\n\t\t}\n\t\tif (h * 3 < 2)\n\t\t{\n\t\t\treturn (p + (q - p) * (0.6666667f - h) * 6);\n\t\t}\n\t\treturn p;\n\t}\n\n\tvoid hslToRgb(float h, float s, float l, unsigned char* r, unsigned char* g, unsigned char* b)\n\t{\n\t\tif (s == 0.0f)\n\t\t{\n\t\t\t*r = *g = *b = (unsigned char)(l * 255);\n\t\t\treturn;\n\t\t}\n\t\tfloat q = (l < 0.5f ? l * (1 + s) : l + s - l * s);\n\t\tfloat p = l * 2 - q;\n\t\t*r = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h + 0.3333333f));\n\t\t*g = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h));\n\t\t*b = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h - 0.3333333f));\n\t}\n\t\n\thstr generateName(chstr prefix)\n\t{\n\t\tstatic hmap counters;\n\t\tint count = counters[prefix] + 1;\n\t\tcounters[prefix] = count;\n\t\treturn prefix + hstr(count);\n\t}\n\n\thstr gvec2ToHstr(gvec2 vector)\n\t{\n\t\treturn hsprintf(\"%f%c%f\", vector.x, HSTR_SEPARATOR, vector.y);\n\t}\n\n\thstr gvec3ToHstr(gvec3 vector)\n\t{\n\t\treturn hsprintf(\"%f%c%f%c%f\", vector.x, HSTR_SEPARATOR, vector.y, HSTR_SEPARATOR, vector.z);\n\t}\n\n\thstr grectToHstr(grect rect)\n\t{\n\t\treturn hsprintf(\"%f%c%f%c%f%c%f\", rect.x, HSTR_SEPARATOR, rect.y, HSTR_SEPARATOR, rect.w, HSTR_SEPARATOR, rect.h);\n\t}\n\n\tgvec2 hstrToGvec2(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 2)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Vector2.\");\n\t\t}\n\t\treturn gvec2(data[0].trim(), data[1].trim());\n\t}\n\n\tgvec3 hstrToGvec3(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 3)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Vector3.\");\n\t\t}\n\t\treturn gvec3(data[0].trim(), data[1].trim(), data[2].trim());\n\t}\n\n\tgrect hstrToGrect(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 4)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Rectangle.\");\n\t\t}\n\t\treturn grect(data[0].trim(), data[1].trim(), data[2].trim(), data[3].trim());\n\t}\n\n}\nremoved unused variable\/\/\/ @file\n\/\/\/ @version 3.5\n\/\/\/ \n\/\/\/ @section LICENSE\n\/\/\/ \n\/\/\/ This program is free software; you can redistribute it and\/or modify it under\n\/\/\/ the terms of the BSD license: http:\/\/opensource.org\/licenses\/BSD-3-Clause\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"aprilUtil.h\"\n\n#define HSTR_SEPARATOR ','\n\nnamespace april\n{\n\tRenderOperation TriangleList = RO_TRIANGLE_LIST; \/\/ DEPRECATED\n\tRenderOperation TriangleStrip = RO_TRIANGLE_STRIP; \/\/ DEPRECATED\n\tRenderOperation TriangleFan = RO_TRIANGLE_FAN; \/\/ DEPRECATED\n\tRenderOperation LineList = RO_LINE_LIST; \/\/ DEPRECATED\n\tRenderOperation LineStrip = RO_LINE_STRIP; \/\/ DEPRECATED\n\tRenderOperation PointList = RO_POINT_LIST; \/\/ DEPRECATED\n\tRenderOperation RENDER_OP_UNDEFINED = RO_UNDEFINED; \/\/ DEPRECATED\n\tBlendMode DEFAULT = BM_DEFAULT; \/\/ DEPRECATED\n\tBlendMode ALPHA_BLEND = BM_ALPHA; \/\/ DEPRECATED\n\tBlendMode ADD = BM_ADD; \/\/ DEPRECATED\n\tBlendMode SUBTRACT = BM_SUBTRACT; \/\/ DEPRECATED\n\tBlendMode OVERWRITE = BM_OVERWRITE; \/\/ DEPRECATED\n\tBlendMode BLEND_MODE_UNDEFINED = BM_UNDEFINED; \/\/ DEPRECATED\n\tColorMode NORMAL = CM_DEFAULT; \/\/ DEPRECATED\n\tColorMode MULTIPLY = CM_MULTIPLY; \/\/ DEPRECATED\n\tColorMode LERP = CM_LERP; \/\/ DEPRECATED\n\tColorMode ALPHA_MAP = CM_ALPHA_MAP; \/\/ DEPRECATED\n\tColorMode COLOR_MODE_UNDEFINED = CM_UNDEFINED; \/\/ DEPRECATED\n\n\tvoid PlainVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid TexturedVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredTexturedVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredTexturedNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid TexturedNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid ColoredNormalVertex::operator=(const gvec3& v)\n\t{\n\t\tthis->x = v.x;\n\t\tthis->y = v.y;\n\t\tthis->z = v.z;\n\t}\n\n\tvoid rgbToHsl(unsigned char r, unsigned char g, unsigned char b, float* h, float* s, float* l)\n\t{\n\t\tint min = hmin(hmin(r, g), b);\n\t\tint max = hmax(hmax(r, g), b);\n\t\tint delta = max - min;\n\t\t*h = *s = 0.0f;\n\t\t*l = (max + min) \/ 510.0f;\n\t\tif (delta > 0)\n\t\t{\n\t\t\tif (*l > 0.0f && *l < 1.0f)\n\t\t\t{\n\t\t\t\t*s = (delta \/ 255.0f) \/ (*l < 0.5f ? (2 * *l) : (2 - 2 * *l));\n\t\t\t}\n\t\t\tif (max == r)\n\t\t\t{\n\t\t\t\t*h = (g - b) \/ (float)delta;\n\t\t\t\tif (g < b)\n\t\t\t\t{\n\t\t\t\t\t*h += 6.0f;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (max == g)\n\t\t\t{\n\t\t\t\t*h += (b - r) \/ (float)delta + 2.0f;\n\t\t\t}\n\t\t\telse if (max == b)\n\t\t\t{\n\t\t\t\t*h += (r - g) \/ (float)delta + 4.0f;\n\t\t\t}\n\t\t\t*h *= 0.16666667f;\n\t\t}\n\t}\n\n\tfloat _colorHueToRgb(float p, float q, float h)\n\t{ \n\t\th = (h < 0 ? h + 1 : ((h > 1) ? h - 1 : h));\n\t\tif (h * 6 < 1)\n\t\t{\n\t\t\treturn p + (q - p) * h * 6;\n\t\t}\n\t\tif (h * 2 < 1)\n\t\t{\n\t\t\treturn q;\n\t\t}\n\t\tif (h * 3 < 2)\n\t\t{\n\t\t\treturn (p + (q - p) * (0.6666667f - h) * 6);\n\t\t}\n\t\treturn p;\n\t}\n\n\tvoid hslToRgb(float h, float s, float l, unsigned char* r, unsigned char* g, unsigned char* b)\n\t{\n\t\tif (s == 0.0f)\n\t\t{\n\t\t\t*r = *g = *b = (unsigned char)(l * 255);\n\t\t\treturn;\n\t\t}\n\t\tfloat q = (l < 0.5f ? l * (1 + s) : l + s - l * s);\n\t\tfloat p = l * 2 - q;\n\t\t*r = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h + 0.3333333f));\n\t\t*g = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h));\n\t\t*b = (unsigned char)hround(255.0f * _colorHueToRgb(p, q, h - 0.3333333f));\n\t}\n\t\n\thstr generateName(chstr prefix)\n\t{\n\t\tstatic hmap counters;\n\t\tint count = counters[prefix] + 1;\n\t\tcounters[prefix] = count;\n\t\treturn prefix + hstr(count);\n\t}\n\n\thstr gvec2ToHstr(gvec2 vector)\n\t{\n\t\treturn hsprintf(\"%f%c%f\", vector.x, HSTR_SEPARATOR, vector.y);\n\t}\n\n\thstr gvec3ToHstr(gvec3 vector)\n\t{\n\t\treturn hsprintf(\"%f%c%f%c%f\", vector.x, HSTR_SEPARATOR, vector.y, HSTR_SEPARATOR, vector.z);\n\t}\n\n\thstr grectToHstr(grect rect)\n\t{\n\t\treturn hsprintf(\"%f%c%f%c%f%c%f\", rect.x, HSTR_SEPARATOR, rect.y, HSTR_SEPARATOR, rect.w, HSTR_SEPARATOR, rect.h);\n\t}\n\n\tgvec2 hstrToGvec2(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 2)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Vector2.\");\n\t\t}\n\t\treturn gvec2(data[0].trim(), data[1].trim());\n\t}\n\n\tgvec3 hstrToGvec3(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 3)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Vector3.\");\n\t\t}\n\t\treturn gvec3(data[0].trim(), data[1].trim(), data[2].trim());\n\t}\n\n\tgrect hstrToGrect(chstr string)\n\t{\n\t\tharray data = string.split(HSTR_SEPARATOR);\n\t\tif (data.size() != 4)\n\t\t{\n\t\t\tthrow hl_exception(\"Cannot convert string '\" + string + \"' to gtypes::Rectangle.\");\n\t\t}\n\t\treturn grect(data[0].trim(), data[1].trim(), data[2].trim(), data[3].trim());\n\t}\n\n}\n<|endoftext|>"} {"text":"\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * Copyright (c) 2010 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Nathan Binkert\n *\/\n\n#ifndef __BASE_DEBUG_HH__\n#define __BASE_DEBUG_HH__\n\n#include \n#include \n#include \n\nnamespace Debug {\n\nvoid breakpoint();\n\nclass Flag\n{\n protected:\n const char *_name;\n const char *_desc;\n std::vector _kids;\n\n public:\n Flag(const char *name, const char *desc);\n virtual ~Flag();\n\n std::string name() const { return _name; }\n std::string desc() const { return _desc; }\n std::vector kids() { return _kids; }\n\n virtual void enable() = 0;\n virtual void disable() = 0;\n};\n\nclass SimpleFlag : public Flag\n{\n protected:\n bool _status;\n\n public:\n SimpleFlag(const char *name, const char *desc)\n : Flag(name, desc)\n { }\n\n bool status() const { return _status; }\n operator bool() const { return _status; }\n bool operator!() const { return !_status; }\n\n void enable() { _status = true; }\n void disable() { _status = false; }\n};\n\nclass CompoundFlag : public SimpleFlag\n{\n protected:\n void\n addFlag(Flag &f)\n {\n if (&f != NULL)\n _kids.push_back(&f);\n }\n\n public:\n CompoundFlag(const char *name, const char *desc,\n Flag &f00 = *(Flag *)0, Flag &f01 = *(Flag *)0,\n Flag &f02 = *(Flag *)0, Flag &f03 = *(Flag *)0,\n Flag &f04 = *(Flag *)0, Flag &f05 = *(Flag *)0,\n Flag &f06 = *(Flag *)0, Flag &f07 = *(Flag *)0,\n Flag &f08 = *(Flag *)0, Flag &f09 = *(Flag *)0,\n Flag &f10 = *(Flag *)0, Flag &f11 = *(Flag *)0,\n Flag &f12 = *(Flag *)0, Flag &f13 = *(Flag *)0,\n Flag &f14 = *(Flag *)0, Flag &f15 = *(Flag *)0,\n Flag &f16 = *(Flag *)0, Flag &f17 = *(Flag *)0,\n Flag &f18 = *(Flag *)0, Flag &f19 = *(Flag *)0)\n : SimpleFlag(name, desc)\n {\n addFlag(f00); addFlag(f01); addFlag(f02); addFlag(f03); addFlag(f04);\n addFlag(f05); addFlag(f06); addFlag(f07); addFlag(f08); addFlag(f09);\n addFlag(f10); addFlag(f11); addFlag(f12); addFlag(f13); addFlag(f14);\n addFlag(f15); addFlag(f16); addFlag(f17); addFlag(f18); addFlag(f19);\n }\n\n void enable();\n void disable();\n};\n\ntypedef std::map FlagsMap;\nFlagsMap &allFlags();\n\nFlag *findFlag(const std::string &name);\n\nbool changeFlag(const char *s, bool value);\n\n} \/\/ namespace Debug\n\nvoid setDebugFlag(const char *string);\n\nvoid clearDebugFlag(const char *string);\n\nvoid dumpDebugFlags();\n\n#endif \/\/ __BASE_DEBUG_HH__\nbase: explicitly suggest potential use of 'All' debug flags\/*\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * Copyright (c) 2010 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Nathan Binkert\n *\/\n\n#ifndef __BASE_DEBUG_HH__\n#define __BASE_DEBUG_HH__\n\n#include \n#include \n#include \n\nnamespace Debug {\n\nvoid breakpoint();\n\nclass Flag\n{\n protected:\n const char *_name;\n const char *_desc;\n std::vector _kids;\n\n public:\n Flag(const char *name, const char *desc);\n virtual ~Flag();\n\n std::string name() const { return _name; }\n std::string desc() const { return _desc; }\n std::vector kids() { return _kids; }\n\n virtual void enable() = 0;\n virtual void disable() = 0;\n};\n\nclass SimpleFlag : public Flag\n{\n protected:\n bool _status;\n\n public:\n SimpleFlag(const char *name, const char *desc)\n : Flag(name, desc)\n { }\n\n bool status() const { return _status; }\n operator bool() const { return _status; }\n bool operator!() const { return !_status; }\n\n void enable() { _status = true; }\n void disable() { _status = false; }\n};\n\nclass CompoundFlag : public SimpleFlag\n{\n protected:\n void\n addFlag(Flag &f)\n {\n if (&f != NULL)\n _kids.push_back(&f);\n }\n\n public:\n CompoundFlag(const char *name, const char *desc,\n Flag &f00 = *(Flag *)0, Flag &f01 = *(Flag *)0,\n Flag &f02 = *(Flag *)0, Flag &f03 = *(Flag *)0,\n Flag &f04 = *(Flag *)0, Flag &f05 = *(Flag *)0,\n Flag &f06 = *(Flag *)0, Flag &f07 = *(Flag *)0,\n Flag &f08 = *(Flag *)0, Flag &f09 = *(Flag *)0,\n Flag &f10 = *(Flag *)0, Flag &f11 = *(Flag *)0,\n Flag &f12 = *(Flag *)0, Flag &f13 = *(Flag *)0,\n Flag &f14 = *(Flag *)0, Flag &f15 = *(Flag *)0,\n Flag &f16 = *(Flag *)0, Flag &f17 = *(Flag *)0,\n Flag &f18 = *(Flag *)0, Flag &f19 = *(Flag *)0)\n : SimpleFlag(name, desc)\n {\n addFlag(f00); addFlag(f01); addFlag(f02); addFlag(f03); addFlag(f04);\n addFlag(f05); addFlag(f06); addFlag(f07); addFlag(f08); addFlag(f09);\n addFlag(f10); addFlag(f11); addFlag(f12); addFlag(f13); addFlag(f14);\n addFlag(f15); addFlag(f16); addFlag(f17); addFlag(f18); addFlag(f19);\n }\n\n void enable();\n void disable();\n};\n\ntypedef std::map FlagsMap;\nFlagsMap &allFlags();\n\nFlag *findFlag(const std::string &name);\n\nextern Flag *const All;\n\nbool changeFlag(const char *s, bool value);\n\n} \/\/ namespace Debug\n\nvoid setDebugFlag(const char *string);\n\nvoid clearDebugFlag(const char *string);\n\nvoid dumpDebugFlags();\n\n#endif \/\/ __BASE_DEBUG_HH__\n<|endoftext|>"} {"text":"#pragma once\n#include \"common.hpp\"\n\nDEFINE_string(type, \"int\", \"data type int|float|double\");\nDEFINE_string(op, \"sort\", \"operation sort|reduce\");\nDEFINE_uint64(num, 1000, \"length of vector\");\n\nnamespace aya\n{\nnamespace bench\n{\n\nvoid ping();\nstd::string name();\n\nstd::string reportFileName()\n{\n std::ostringstream os;\n os << name() << \"_\" << FLAGS_op << \"_\" << FLAGS_num << \"_\" << FLAGS_type << \".csv\";\n return os.str();\n}\n\ntemplate \nstruct BenchmarkBackend\n{\n virtual void generate(int) = 0;\n virtual void copy() = 0;\n virtual void sort() = 0;\n virtual void reduce() = 0;\n virtual ~BenchmarkBackend() {}\n};\n\ntemplate \nBenchmarkBackend *init();\n\nint launch(int argc, char **argv)\n{\n std::string usage = \"Benchmark \" + name() + R\"HA(\nbench --op sort --num 1000 --type int\n --op string sort|reduce\n --num uint64 larger than 1000000000 fails on GPU #5\n --type string int|float|double\n)HA\";\n\n google::SetUsageMessage(usage);\n gflags::SetVersionString(\"0.0.1\");\n\n \/\/ only show usage when no argument is provided\n if (argc < 2)\n {\n std::cout << google::ProgramUsage();\n return 0;\n }\n\n gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n std::cout << \"Let's run some benchmark \\\\w\/\" << std::endl;\n \/\/ ping();\n \/\/ sort(FLAGS_num);\n std::cout << reportFileName() << std::endl;\n auto back_end = init();\n back_end->generate(FLAGS_num);\n back_end->copy();\n if (FLAGS_op == \"sort\") {\n back_end->sort();\n } else if (FLAGS_op == \"reduce\") {\n back_end->reduce();\n } else {\n std::cout << \"unknown operation\" << FLAGS_op << std::endl;\n }\n \n delete back_end;\n\n google::ShutDownCommandLineFlags();\n return 0;\n}\n\n} \/\/ bench\n} \/\/ aya::bench\n[bench] Add flag validator#pragma once\n#include \"common.hpp\"\n\nDEFINE_string(op, \"sort\", \"operation sort|reduce\");\nDEFINE_uint64(num, 1000, \"length of vector\");\nDEFINE_string(type, \"int\", \"data type int|float|double\");\n\nstatic bool ValidateOp(const char *flagname, const std::string &value)\n{\n if (value == \"sort\")\n {\n return true;\n }\n else if (value == \"reduce\")\n {\n return true;\n }\n else\n {\n std::cout << \"unknown operation \" << value << std::endl;\n return false;\n }\n}\n\nstatic bool ValidateType(const char *flagname, const std::string &value)\n{\n if (value == \"int\")\n {\n return true;\n }\n else if (value == \"float\")\n {\n return true;\n }\n else if (value == \"double\")\n {\n return true;\n }\n else\n {\n std::cout << \"unknown value type \" << value << std::endl;\n return false;\n }\n}\n\nDEFINE_validator(op, &ValidateOp);\nDEFINE_validator(type, &ValidateType);\n\nnamespace aya\n{\nnamespace bench\n{\n\nvoid ping();\nstd::string name();\n\nstd::string reportFileName()\n{\n std::ostringstream os;\n os << name() << \"_\" << FLAGS_op << \"_\" << FLAGS_num << \"_\" << FLAGS_type << \".csv\";\n return os.str();\n}\n\ntemplate \nstruct BenchmarkBackend\n{\n virtual void generate(int) = 0;\n virtual void copy() = 0;\n virtual void sort() = 0;\n virtual void reduce() = 0;\n virtual ~BenchmarkBackend() {}\n};\n\ntemplate \nBenchmarkBackend *init();\n\ntemplate \nvoid run_bench()\n{\n auto back_end = init();\n back_end->generate(FLAGS_num);\n back_end->copy();\n if (FLAGS_op == \"sort\")\n {\n back_end->sort();\n }\n else if (FLAGS_op == \"reduce\")\n {\n back_end->reduce();\n }\n else\n {\n std::cout << \"unknown operation \" << FLAGS_op << std::endl;\n \/\/ TODO: we should return non-zero, but we also need to copy the clean up code\n }\n delete back_end;\n}\n\nint launch(int argc, char **argv)\n{\n std::string usage = \"Benchmark \" + name() + R\"HA(\nbench --op sort --num 1000 --type int\n --op string sort|reduce\n --num uint64 larger than 1000000000 fails on GPU #5\n --type string int|float|double\n)HA\";\n\n google::SetUsageMessage(usage);\n gflags::SetVersionString(\"0.0.1\");\n\n \/\/ only show usage when no argument is provided\n if (argc < 2)\n {\n std::cout << google::ProgramUsage();\n return 0;\n }\n\n gflags::ParseCommandLineFlags(&argc, &argv, true);\n\n std::cout << \"Let's run some benchmark \\\\w\/\" << std::endl;\n std::cout << reportFileName() << std::endl;\n\n \/\/ BenchmarkBackend *back_end;\n\n if (FLAGS_type == \"int\")\n {\n \/\/ back_end = init();\n run_bench();\n }\n else if (FLAGS_type == \"float\")\n {\n \/\/ back_end = init();\n run_bench();\n }\n else if (FLAGS_type == \"double\")\n {\n \/\/ back_end = init();\n run_bench();\n }\n else\n {\n \/\/ TODO: this should not be triggered if we defined option validator\n std::cout << \"unknown type \" << FLAGS_type << std::endl;\n return 1;\n }\n\n google::ShutDownCommandLineFlags();\n return 0;\n}\n\n} \/\/ bench\n} \/\/ aya::bench\n<|endoftext|>"} {"text":"#include \n\ntemplate\nRandomIt binsearch(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst) return lst;\n\n auto lft = fst, rgt = std::prev(lst);\n\n while (lft <= rgt) {\n const auto mid = std::next(lft, std::distance(lft, rgt) \/ 2);\n\n if (val == *mid)\n return mid;\n\n if (val < *mid)\n rgt = std::prev(mid);\n else\n lft = std::next(mid);\n }\n\n return lst; \/\/ not found\n}\n\ntemplate\nRandomIt xlower_bound(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst) return lst;\n\n auto lft = fst, rgt = std::prev(lst);\n\n while (lft <= rgt) {\n const auto mid = std::next(lft, std::distance(lft, rgt) \/ 2);\n\n if (*mid < val) {\n lft = std::next(mid);\n } else {\n rgt = std::prev(mid);\n }\n }\n\n return lft; \/\/ lower bound (if it exists) or past-the-end\n}\n\ntemplate\nRandomIt xupper_bound(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst) return lst;\n\n while (fst < lst) {\n const auto mid = std::next(fst, std::distance(fst, lst) \/ 2);\n\n if (*mid <= val)\n fst = mid + 1;\n else\n lst = mid;\n }\n\n return fst;\n}\nDrop extra variables from xlower_bound#include \n\ntemplate\nRandomIt binsearch(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst) return lst;\n\n auto lft = fst, rgt = std::prev(lst);\n\n while (lft <= rgt) {\n const auto mid = std::next(lft, std::distance(lft, rgt) \/ 2);\n\n if (val == *mid)\n return mid;\n\n if (val < *mid)\n rgt = std::prev(mid);\n else\n lft = std::next(mid);\n }\n\n return lst; \/\/ not found\n}\n\ntemplate\nRandomIt xlower_bound(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst)\n return lst;\n\n while (fst < lst) {\n const auto mid = std::next(fst, std::distance(fst, lst) \/ 2);\n\n if (val <= *mid)\n lst = mid;\n else\n fst = mid + 1;\n }\n\n return fst; \/\/ lower bound (if it exists) or past-the-end\n}\n\ntemplate\nRandomIt xupper_bound(RandomIt fst, RandomIt lst, const Val& val) {\n if (fst == lst) return lst;\n\n while (fst < lst) {\n const auto mid = std::next(fst, std::distance(fst, lst) \/ 2);\n\n if (*mid <= val)\n fst = mid + 1;\n else\n lst = mid;\n }\n\n return fst;\n}\n<|endoftext|>"} {"text":"#include \n#include \n#include \n#include \n#include \n#include \n#include \"utils.hpp\"\nusing std::int64_t;\nusing std::size_t;\nusing Algorithm = InsertionFinder::Algorithm;\nusing Insertion = InsertionFinder::Insertion;\nusing Solution = InsertionFinder::Solution;\nnamespace Details = InsertionFinder::Details;\n\n\nvoid Details::print_duration(std::ostream& out, int64_t duration) {\n out << termcolor::bold << \"Time usage: \" << termcolor::reset\n << std::fixed << std::setprecision(3) << termcolor::yellow;\n if (duration < 1000) {\n out << duration << termcolor::reset << \" nanoseconds.\" << std::endl;\n } else if (duration < 1'000'000) {\n out << duration \/ 1e3 << termcolor::reset << \" microseconds.\" << std::endl;\n } else if (duration < 1'000'000'000) {\n out << duration \/ 1e6 << termcolor::reset << \" milliseconds.\" << std::endl;\n } else if (duration < 60 * INT64_C(1'000'000'000)) {\n out << duration \/ 1e9 << termcolor::reset << \" seconds.\" << std::endl;\n } else if (duration < 60 * 60 * INT64_C(1'000'000'000)) {\n int64_t milliseconds = (duration + 500'000) \/ 1'000'000;\n out << milliseconds \/ (60 * 1000)\n << std::right << std::setfill('0')\n << ':' << std::setw(2) << milliseconds \/ 1000 % 60\n << '.'<< std::setw(3) << milliseconds % 1000\n << termcolor::reset << std::endl;\n } else {\n int64_t milliseconds = (duration + 500'000) \/ 1'000'000;\n out << milliseconds \/ (60 * 60 * 1000)\n << std::right << std::setfill('0')\n << ':' << std::setw(2) << milliseconds \/ (60 * 1000) % 60\n << ':' << std::setw(2) << milliseconds \/ 1000 % 60\n << ':' << std::setw(3) << milliseconds % 1000\n << termcolor::reset << '.' << std::endl;\n }\n}\n\n\nUniValue Details::create_json_solution(const Algorithm& skeleton, const Solution& solution) {\n UniValue insertion_list(UniValue::VARR);\n for (const Insertion& insertion: solution.insertions) {\n UniValue insertion_map(UniValue::VOBJ);\n insertion_map.pushKV(\"skeleton\", insertion.skeleton.str());\n insertion_map.pushKV(\"insert_place\", static_cast(insertion.insert_place));\n insertion_map.pushKV(\"insertion\", insertion.insertion->str());\n insertion_list.push_back(insertion_map);\n }\n UniValue merged_insertion_list(UniValue::VARR);\n size_t initial_order = 0;\n for (const auto& sub_solution: solution.merge_insertions(skeleton)) {\n UniValue insertion_list(UniValue::VARR);\n for (const auto& [place, insertions]: sub_solution.get_insertions()) {\n UniValue algorithms(UniValue::VARR);\n for (auto [insertion, order]: insertions) {\n UniValue algorithm_object(UniValue::VOBJ);\n algorithm_object.pushKV(\"algorithm\", insertion->str());\n algorithm_object.pushKV(\"order\", static_cast(order));\n algorithms.push_back(algorithm_object);\n }\n UniValue place_object(UniValue::VOBJ);\n place_object.pushKV(\"insert_place\", static_cast(place));\n place_object.pushKV(\"algorithms\", algorithms);\n insertion_list.push_back(place_object);\n }\n UniValue insertion_map(UniValue::VOBJ);\n insertion_map.pushKV(\"skeleton\", sub_solution.skeleton.str());\n insertion_map.pushKV(\"insertions\", insertion_list);\n merged_insertion_list.push_back(insertion_map);\n initial_order += sub_solution.insertions.size();\n }\n UniValue solution_map(UniValue::VOBJ);\n solution_map.pushKV(\"final_solution\", solution.final_solution.str());\n solution_map.pushKV(\"cancellation\", static_cast(solution.cancellation));\n solution_map.pushKV(\"insertions\", insertion_list);\n solution_map.pushKV(\"merged_insertions\", merged_insertion_list);\n return solution_map;\n}\nadd cumulative insertion order#include \n#include \n#include \n#include \n#include \n#include \n#include \"utils.hpp\"\nusing std::int64_t;\nusing std::size_t;\nusing Algorithm = InsertionFinder::Algorithm;\nusing Insertion = InsertionFinder::Insertion;\nusing Solution = InsertionFinder::Solution;\nnamespace Details = InsertionFinder::Details;\n\n\nvoid Details::print_duration(std::ostream& out, int64_t duration) {\n out << termcolor::bold << \"Time usage: \" << termcolor::reset\n << std::fixed << std::setprecision(3) << termcolor::yellow;\n if (duration < 1000) {\n out << duration << termcolor::reset << \" nanoseconds.\" << std::endl;\n } else if (duration < 1'000'000) {\n out << duration \/ 1e3 << termcolor::reset << \" microseconds.\" << std::endl;\n } else if (duration < 1'000'000'000) {\n out << duration \/ 1e6 << termcolor::reset << \" milliseconds.\" << std::endl;\n } else if (duration < 60 * INT64_C(1'000'000'000)) {\n out << duration \/ 1e9 << termcolor::reset << \" seconds.\" << std::endl;\n } else if (duration < 60 * 60 * INT64_C(1'000'000'000)) {\n int64_t milliseconds = (duration + 500'000) \/ 1'000'000;\n out << milliseconds \/ (60 * 1000)\n << std::right << std::setfill('0')\n << ':' << std::setw(2) << milliseconds \/ 1000 % 60\n << '.'<< std::setw(3) << milliseconds % 1000\n << termcolor::reset << std::endl;\n } else {\n int64_t milliseconds = (duration + 500'000) \/ 1'000'000;\n out << milliseconds \/ (60 * 60 * 1000)\n << std::right << std::setfill('0')\n << ':' << std::setw(2) << milliseconds \/ (60 * 1000) % 60\n << ':' << std::setw(2) << milliseconds \/ 1000 % 60\n << ':' << std::setw(3) << milliseconds % 1000\n << termcolor::reset << '.' << std::endl;\n }\n}\n\n\nUniValue Details::create_json_solution(const Algorithm& skeleton, const Solution& solution) {\n UniValue insertion_list(UniValue::VARR);\n for (const Insertion& insertion: solution.insertions) {\n UniValue insertion_map(UniValue::VOBJ);\n insertion_map.pushKV(\"skeleton\", insertion.skeleton.str());\n insertion_map.pushKV(\"insert_place\", static_cast(insertion.insert_place));\n insertion_map.pushKV(\"insertion\", insertion.insertion->str());\n insertion_list.push_back(insertion_map);\n }\n UniValue merged_insertion_list(UniValue::VARR);\n size_t initial_order = 0;\n for (const auto& sub_solution: solution.merge_insertions(skeleton)) {\n UniValue insertion_list(UniValue::VARR);\n for (const auto& [place, insertions]: sub_solution.get_insertions()) {\n UniValue algorithms(UniValue::VARR);\n for (auto [insertion, order]: insertions) {\n UniValue algorithm_object(UniValue::VOBJ);\n algorithm_object.pushKV(\"algorithm\", insertion->str());\n algorithm_object.pushKV(\"order\", static_cast(order));\n algorithm_object.pushKV(\"cumulative_order\", static_cast(initial_order + order));\n algorithms.push_back(algorithm_object);\n }\n UniValue place_object(UniValue::VOBJ);\n place_object.pushKV(\"insert_place\", static_cast(place));\n place_object.pushKV(\"algorithms\", algorithms);\n insertion_list.push_back(place_object);\n }\n UniValue insertion_map(UniValue::VOBJ);\n insertion_map.pushKV(\"skeleton\", sub_solution.skeleton.str());\n insertion_map.pushKV(\"insertions\", insertion_list);\n merged_insertion_list.push_back(insertion_map);\n initial_order += sub_solution.insertions.size();\n }\n UniValue solution_map(UniValue::VOBJ);\n solution_map.pushKV(\"final_solution\", solution.final_solution.str());\n solution_map.pushKV(\"cancellation\", static_cast(solution.cancellation));\n solution_map.pushKV(\"insertions\", insertion_list);\n solution_map.pushKV(\"merged_insertions\", merged_insertion_list);\n return solution_map;\n}\n<|endoftext|>"} {"text":"\n\/*\n pbrt source code is Copyright(c) 1998-2016\n Matt Pharr, Greg Humphreys, and Wenzel Jakob.\n\n This file is part of pbrt.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n - Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n\n - Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n *\/\n\n\n\/\/ core\/film.cpp*\n#include \"film.h\"\n#include \"paramset.h\"\n#include \"imageio.h\"\n#include \"stats.h\"\n\nnamespace pbrt {\n\nSTAT_MEMORY_COUNTER(\"Memory\/Film pixels\", filmPixelMemory);\n\n\/\/ Film Method Definitions\nFilm::Film(const Point2i &resolution, const Bounds2f &cropWindow,\n std::unique_ptr filt, Float diagonal,\n const std::string &filename, Float scale, Float maxSampleLuminance)\n : fullResolution(resolution),\n diagonal(diagonal * .001),\n filter(std::move(filt)),\n filename(filename),\n scale(scale),\n maxSampleLuminance(maxSampleLuminance) {\n \/\/ Compute film image bounds\n croppedPixelBounds =\n Bounds2i(Point2i(std::ceil(fullResolution.x * cropWindow.pMin.x),\n std::ceil(fullResolution.y * cropWindow.pMin.y)),\n Point2i(std::ceil(fullResolution.x * cropWindow.pMax.x),\n std::ceil(fullResolution.y * cropWindow.pMax.y)));\n LOG(INFO) << \"Created film with full resolution \" << resolution <<\n \". Crop window of \" << cropWindow << \" -> croppedPixelBounds \" <<\n croppedPixelBounds;\n\n \/\/ Allocate film image storage\n pixels = std::unique_ptr(new Pixel[croppedPixelBounds.Area()]);\n filmPixelMemory += croppedPixelBounds.Area() * sizeof(Pixel);\n\n \/\/ Precompute filter weight table\n int offset = 0;\n for (int y = 0; y < filterTableWidth; ++y) {\n for (int x = 0; x < filterTableWidth; ++x, ++offset) {\n Point2f p;\n p.x = (x + 0.5f) * filter->radius.x \/ filterTableWidth;\n p.y = (y + 0.5f) * filter->radius.y \/ filterTableWidth;\n filterTable[offset] = filter->Evaluate(p);\n }\n }\n}\n\nBounds2i Film::GetSampleBounds() const {\n Bounds2f floatBounds(Floor(Point2f(croppedPixelBounds.pMin) +\n Vector2f(0.5f, 0.5f) - filter->radius),\n Ceil(Point2f(croppedPixelBounds.pMax) -\n Vector2f(0.5f, 0.5f) + filter->radius));\n return (Bounds2i)floatBounds;\n}\n\nBounds2f Film::GetPhysicalExtent() const {\n Float aspect = (Float)fullResolution.y \/ (Float)fullResolution.x;\n Float x = std::sqrt(diagonal * diagonal \/ (1 + aspect * aspect));\n Float y = aspect * x;\n return Bounds2f(Point2f(-x \/ 2, -y \/ 2), Point2f(x \/ 2, y \/ 2));\n}\n\nstd::unique_ptr Film::GetFilmTile(const Bounds2i &sampleBounds) {\n \/\/ Bound image pixels that samples in _sampleBounds_ contribute to\n Vector2f halfPixel = Vector2f(0.5f, 0.5f);\n Bounds2f floatBounds = (Bounds2f)sampleBounds;\n Point2i p0 = (Point2i)Ceil(floatBounds.pMin - halfPixel - filter->radius);\n Point2i p1 = (Point2i)Floor(floatBounds.pMax - halfPixel + filter->radius) +\n Point2i(1, 1);\n Bounds2i tilePixelBounds = Intersect(Bounds2i(p0, p1), croppedPixelBounds);\n return std::unique_ptr(new FilmTile(\n tilePixelBounds, filter->radius, filterTable, filterTableWidth,\n maxSampleLuminance));\n}\n\nvoid Film::Clear() {\n for (Point2i p : croppedPixelBounds) {\n Pixel &pixel = GetPixel(p);\n for (int c = 0; c < 3; ++c)\n pixel.splatXYZ[c] = pixel.xyz[c] = 0;\n pixel.filterWeightSum = 0;\n }\n}\n\nvoid Film::MergeFilmTile(std::unique_ptr tile) {\n ProfilePhase p(Prof::MergeFilmTile);\n VLOG(1) << \"Merging film tile \" << tile->pixelBounds;\n std::lock_guard lock(mutex);\n for (Point2i pixel : tile->GetPixelBounds()) {\n \/\/ Merge _pixel_ into _Film::pixels_\n const FilmTilePixel &tilePixel = tile->GetPixel(pixel);\n Pixel &mergePixel = GetPixel(pixel);\n Float xyz[3];\n tilePixel.contribSum.ToXYZ(xyz);\n for (int i = 0; i < 3; ++i) mergePixel.xyz[i] += xyz[i];\n mergePixel.filterWeightSum += tilePixel.filterWeightSum;\n }\n}\n\nvoid Film::SetImage(const Spectrum *img) const {\n int nPixels = croppedPixelBounds.Area();\n for (int i = 0; i < nPixels; ++i) {\n Pixel &p = pixels[i];\n img[i].ToXYZ(p.xyz);\n p.filterWeightSum = 1;\n p.splatXYZ[0] = p.splatXYZ[1] = p.splatXYZ[2] = 0;\n }\n}\n\nvoid Film::AddSplat(const Point2f &p, Spectrum v) {\n ProfilePhase pp(Prof::SplatFilm);\n\n if (v.HasNaNs()) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with NaN values \"\n \"at (%f, %f)\", p.x, p.y);\n return;\n } else if (v.y() < 0.) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with negative \"\n \"luminance %f at (%f, %f)\", v.y(), p.x, p.y);\n return;\n } else if (std::isinf(v.y())) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with infinite \"\n \"luminance at (%f, %f)\", p.x, p.y);\n return;\n }\n\n if (!InsideExclusive((Point2i)p, croppedPixelBounds)) return;\n if (v.y() > maxSampleLuminance)\n v *= maxSampleLuminance \/ v.y();\n Float xyz[3];\n v.ToXYZ(xyz);\n Pixel &pixel = GetPixel((Point2i)p);\n for (int i = 0; i < 3; ++i) pixel.splatXYZ[i].Add(xyz[i]);\n}\n\nvoid Film::WriteImage(Float splatScale) {\n \/\/ Convert image to RGB and compute final pixel values\n LOG(INFO) <<\n \"Converting image to RGB and computing final weighted pixel values\";\n std::unique_ptr rgb(new Float[3 * croppedPixelBounds.Area()]);\n int offset = 0;\n for (Point2i p : croppedPixelBounds) {\n \/\/ Convert pixel XYZ color to RGB\n Pixel &pixel = GetPixel(p);\n XYZToRGB(pixel.xyz, &rgb[3 * offset]);\n\n \/\/ Normalize pixel with weight sum\n Float filterWeightSum = pixel.filterWeightSum;\n if (filterWeightSum != 0) {\n Float invWt = (Float)1 \/ filterWeightSum;\n rgb[3 * offset] = std::max((Float)0, rgb[3 * offset] * invWt);\n rgb[3 * offset + 1] =\n std::max((Float)0, rgb[3 * offset + 1] * invWt);\n rgb[3 * offset + 2] =\n std::max((Float)0, rgb[3 * offset + 2] * invWt);\n }\n\n \/\/ Add splat value at pixel\n Float splatRGB[3];\n Float splatXYZ[3] = {pixel.splatXYZ[0], pixel.splatXYZ[1],\n pixel.splatXYZ[2]};\n XYZToRGB(splatXYZ, splatRGB);\n rgb[3 * offset] += splatScale * splatRGB[0];\n rgb[3 * offset + 1] += splatScale * splatRGB[1];\n rgb[3 * offset + 2] += splatScale * splatRGB[2];\n\n \/\/ Scale pixel value by _scale_\n rgb[3 * offset] *= scale;\n rgb[3 * offset + 1] *= scale;\n rgb[3 * offset + 2] *= scale;\n ++offset;\n }\n\n \/\/ Write RGB image\n LOG(INFO) << \"Writing image \" << filename << \" with bounds \" <<\n croppedPixelBounds;\n pbrt::WriteImage(filename, &rgb[0], croppedPixelBounds, fullResolution);\n}\n\nFilm *CreateFilm(const ParamSet ¶ms, std::unique_ptr filter) {\n \/\/ Intentionally use FindOneString() rather than FindOneFilename() here\n \/\/ so that the rendered image is left in the working directory, rather\n \/\/ than the directory the scene file lives in.\n std::string filename = params.FindOneString(\"filename\", \"\");\n if (PbrtOptions.imageFile != \"\") {\n if (filename != \"\") {\n Warning(\n \"Output filename supplied on command line, \\\"%s\\\", ignored \"\n \"due to filename provided in scene description file, \\\"%s\\\".\",\n PbrtOptions.imageFile.c_str(), filename.c_str());\n } else\n filename = PbrtOptions.imageFile;\n }\n if (filename == \"\") filename = \"pbrt.exr\";\n\n int xres = params.FindOneInt(\"xresolution\", 1280);\n int yres = params.FindOneInt(\"yresolution\", 720);\n if (PbrtOptions.quickRender) xres = std::max(1, xres \/ 4);\n if (PbrtOptions.quickRender) yres = std::max(1, yres \/ 4);\n Bounds2f crop(Point2f(0, 0), Point2f(1, 1));\n int cwi;\n const Float *cr = params.FindFloat(\"cropwindow\", &cwi);\n if (cr && cwi == 4) {\n crop.pMin.x = Clamp(std::min(cr[0], cr[1]), 0.f, 1.f);\n crop.pMax.x = Clamp(std::max(cr[0], cr[1]), 0.f, 1.f);\n crop.pMin.y = Clamp(std::min(cr[2], cr[3]), 0.f, 1.f);\n crop.pMax.y = Clamp(std::max(cr[2], cr[3]), 0.f, 1.f);\n } else if (cr)\n Error(\"%d values supplied for \\\"cropwindow\\\". Expected 4.\", cwi);\n\n Float scale = params.FindOneFloat(\"scale\", 1.);\n Float diagonal = params.FindOneFloat(\"diagonal\", 35.);\n Float maxSampleLuminance = params.FindOneFloat(\"maxsampleluminance\",\n Infinity);\n return new Film(Point2i(xres, yres), crop, std::move(filter), diagonal,\n filename, scale, maxSampleLuminance);\n}\n\n} \/\/ namespace pbrt\nIncrease priority of --outfile w.r.t. Film parameters\n\/*\n pbrt source code is Copyright(c) 1998-2016\n Matt Pharr, Greg Humphreys, and Wenzel Jakob.\n\n This file is part of pbrt.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n\n - Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n\n - Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n *\/\n\n\n\/\/ core\/film.cpp*\n#include \"film.h\"\n#include \"paramset.h\"\n#include \"imageio.h\"\n#include \"stats.h\"\n\nnamespace pbrt {\n\nSTAT_MEMORY_COUNTER(\"Memory\/Film pixels\", filmPixelMemory);\n\n\/\/ Film Method Definitions\nFilm::Film(const Point2i &resolution, const Bounds2f &cropWindow,\n std::unique_ptr filt, Float diagonal,\n const std::string &filename, Float scale, Float maxSampleLuminance)\n : fullResolution(resolution),\n diagonal(diagonal * .001),\n filter(std::move(filt)),\n filename(filename),\n scale(scale),\n maxSampleLuminance(maxSampleLuminance) {\n \/\/ Compute film image bounds\n croppedPixelBounds =\n Bounds2i(Point2i(std::ceil(fullResolution.x * cropWindow.pMin.x),\n std::ceil(fullResolution.y * cropWindow.pMin.y)),\n Point2i(std::ceil(fullResolution.x * cropWindow.pMax.x),\n std::ceil(fullResolution.y * cropWindow.pMax.y)));\n LOG(INFO) << \"Created film with full resolution \" << resolution <<\n \". Crop window of \" << cropWindow << \" -> croppedPixelBounds \" <<\n croppedPixelBounds;\n\n \/\/ Allocate film image storage\n pixels = std::unique_ptr(new Pixel[croppedPixelBounds.Area()]);\n filmPixelMemory += croppedPixelBounds.Area() * sizeof(Pixel);\n\n \/\/ Precompute filter weight table\n int offset = 0;\n for (int y = 0; y < filterTableWidth; ++y) {\n for (int x = 0; x < filterTableWidth; ++x, ++offset) {\n Point2f p;\n p.x = (x + 0.5f) * filter->radius.x \/ filterTableWidth;\n p.y = (y + 0.5f) * filter->radius.y \/ filterTableWidth;\n filterTable[offset] = filter->Evaluate(p);\n }\n }\n}\n\nBounds2i Film::GetSampleBounds() const {\n Bounds2f floatBounds(Floor(Point2f(croppedPixelBounds.pMin) +\n Vector2f(0.5f, 0.5f) - filter->radius),\n Ceil(Point2f(croppedPixelBounds.pMax) -\n Vector2f(0.5f, 0.5f) + filter->radius));\n return (Bounds2i)floatBounds;\n}\n\nBounds2f Film::GetPhysicalExtent() const {\n Float aspect = (Float)fullResolution.y \/ (Float)fullResolution.x;\n Float x = std::sqrt(diagonal * diagonal \/ (1 + aspect * aspect));\n Float y = aspect * x;\n return Bounds2f(Point2f(-x \/ 2, -y \/ 2), Point2f(x \/ 2, y \/ 2));\n}\n\nstd::unique_ptr Film::GetFilmTile(const Bounds2i &sampleBounds) {\n \/\/ Bound image pixels that samples in _sampleBounds_ contribute to\n Vector2f halfPixel = Vector2f(0.5f, 0.5f);\n Bounds2f floatBounds = (Bounds2f)sampleBounds;\n Point2i p0 = (Point2i)Ceil(floatBounds.pMin - halfPixel - filter->radius);\n Point2i p1 = (Point2i)Floor(floatBounds.pMax - halfPixel + filter->radius) +\n Point2i(1, 1);\n Bounds2i tilePixelBounds = Intersect(Bounds2i(p0, p1), croppedPixelBounds);\n return std::unique_ptr(new FilmTile(\n tilePixelBounds, filter->radius, filterTable, filterTableWidth,\n maxSampleLuminance));\n}\n\nvoid Film::Clear() {\n for (Point2i p : croppedPixelBounds) {\n Pixel &pixel = GetPixel(p);\n for (int c = 0; c < 3; ++c)\n pixel.splatXYZ[c] = pixel.xyz[c] = 0;\n pixel.filterWeightSum = 0;\n }\n}\n\nvoid Film::MergeFilmTile(std::unique_ptr tile) {\n ProfilePhase p(Prof::MergeFilmTile);\n VLOG(1) << \"Merging film tile \" << tile->pixelBounds;\n std::lock_guard lock(mutex);\n for (Point2i pixel : tile->GetPixelBounds()) {\n \/\/ Merge _pixel_ into _Film::pixels_\n const FilmTilePixel &tilePixel = tile->GetPixel(pixel);\n Pixel &mergePixel = GetPixel(pixel);\n Float xyz[3];\n tilePixel.contribSum.ToXYZ(xyz);\n for (int i = 0; i < 3; ++i) mergePixel.xyz[i] += xyz[i];\n mergePixel.filterWeightSum += tilePixel.filterWeightSum;\n }\n}\n\nvoid Film::SetImage(const Spectrum *img) const {\n int nPixels = croppedPixelBounds.Area();\n for (int i = 0; i < nPixels; ++i) {\n Pixel &p = pixels[i];\n img[i].ToXYZ(p.xyz);\n p.filterWeightSum = 1;\n p.splatXYZ[0] = p.splatXYZ[1] = p.splatXYZ[2] = 0;\n }\n}\n\nvoid Film::AddSplat(const Point2f &p, Spectrum v) {\n ProfilePhase pp(Prof::SplatFilm);\n\n if (v.HasNaNs()) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with NaN values \"\n \"at (%f, %f)\", p.x, p.y);\n return;\n } else if (v.y() < 0.) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with negative \"\n \"luminance %f at (%f, %f)\", v.y(), p.x, p.y);\n return;\n } else if (std::isinf(v.y())) {\n LOG(ERROR) << StringPrintf(\"Ignoring splatted spectrum with infinite \"\n \"luminance at (%f, %f)\", p.x, p.y);\n return;\n }\n\n if (!InsideExclusive((Point2i)p, croppedPixelBounds)) return;\n if (v.y() > maxSampleLuminance)\n v *= maxSampleLuminance \/ v.y();\n Float xyz[3];\n v.ToXYZ(xyz);\n Pixel &pixel = GetPixel((Point2i)p);\n for (int i = 0; i < 3; ++i) pixel.splatXYZ[i].Add(xyz[i]);\n}\n\nvoid Film::WriteImage(Float splatScale) {\n \/\/ Convert image to RGB and compute final pixel values\n LOG(INFO) <<\n \"Converting image to RGB and computing final weighted pixel values\";\n std::unique_ptr rgb(new Float[3 * croppedPixelBounds.Area()]);\n int offset = 0;\n for (Point2i p : croppedPixelBounds) {\n \/\/ Convert pixel XYZ color to RGB\n Pixel &pixel = GetPixel(p);\n XYZToRGB(pixel.xyz, &rgb[3 * offset]);\n\n \/\/ Normalize pixel with weight sum\n Float filterWeightSum = pixel.filterWeightSum;\n if (filterWeightSum != 0) {\n Float invWt = (Float)1 \/ filterWeightSum;\n rgb[3 * offset] = std::max((Float)0, rgb[3 * offset] * invWt);\n rgb[3 * offset + 1] =\n std::max((Float)0, rgb[3 * offset + 1] * invWt);\n rgb[3 * offset + 2] =\n std::max((Float)0, rgb[3 * offset + 2] * invWt);\n }\n\n \/\/ Add splat value at pixel\n Float splatRGB[3];\n Float splatXYZ[3] = {pixel.splatXYZ[0], pixel.splatXYZ[1],\n pixel.splatXYZ[2]};\n XYZToRGB(splatXYZ, splatRGB);\n rgb[3 * offset] += splatScale * splatRGB[0];\n rgb[3 * offset + 1] += splatScale * splatRGB[1];\n rgb[3 * offset + 2] += splatScale * splatRGB[2];\n\n \/\/ Scale pixel value by _scale_\n rgb[3 * offset] *= scale;\n rgb[3 * offset + 1] *= scale;\n rgb[3 * offset + 2] *= scale;\n ++offset;\n }\n\n \/\/ Write RGB image\n LOG(INFO) << \"Writing image \" << filename << \" with bounds \" <<\n croppedPixelBounds;\n pbrt::WriteImage(filename, &rgb[0], croppedPixelBounds, fullResolution);\n}\n\nFilm *CreateFilm(const ParamSet ¶ms, std::unique_ptr filter) {\n std::string filename;\n if (PbrtOptions.imageFile != \"\") {\n filename = PbrtOptions.imageFile;\n std::string paramsFilename = params.FindOneString(\"filename\", \"\");\n if (paramsFilename != \"\")\n Warning(\n \"Output filename supplied on command line, \\\"%s\\\" is overriding \"\n \"filename provided in scene description file, \\\"%s\\\".\",\n PbrtOptions.imageFile.c_str(), paramsFilename.c_str());\n } else\n filename = params.FindOneString(\"filename\", \"pbrt.exr\");\n\n int xres = params.FindOneInt(\"xresolution\", 1280);\n int yres = params.FindOneInt(\"yresolution\", 720);\n if (PbrtOptions.quickRender) xres = std::max(1, xres \/ 4);\n if (PbrtOptions.quickRender) yres = std::max(1, yres \/ 4);\n Bounds2f crop(Point2f(0, 0), Point2f(1, 1));\n int cwi;\n const Float *cr = params.FindFloat(\"cropwindow\", &cwi);\n if (cr && cwi == 4) {\n crop.pMin.x = Clamp(std::min(cr[0], cr[1]), 0.f, 1.f);\n crop.pMax.x = Clamp(std::max(cr[0], cr[1]), 0.f, 1.f);\n crop.pMin.y = Clamp(std::min(cr[2], cr[3]), 0.f, 1.f);\n crop.pMax.y = Clamp(std::max(cr[2], cr[3]), 0.f, 1.f);\n } else if (cr)\n Error(\"%d values supplied for \\\"cropwindow\\\". Expected 4.\", cwi);\n\n Float scale = params.FindOneFloat(\"scale\", 1.);\n Float diagonal = params.FindOneFloat(\"diagonal\", 35.);\n Float maxSampleLuminance = params.FindOneFloat(\"maxsampleluminance\",\n Infinity);\n return new Film(Point2i(xres, yres), crop, std::move(filter), diagonal,\n filename, scale, maxSampleLuminance);\n}\n\n} \/\/ namespace pbrt\n<|endoftext|>"} {"text":"#include \"cvm.h\"\n#include \"..\/cshared\/disasm.h\"\n\nvoid DabVM_debug::print_registers()\n{\n fprintf(stderr, \"IP = %p (%d)\\n\", (void *)vm.ip(), (int)vm.ip());\n}\n\nvoid DabVM_debug::print_ssa_registers()\n{\n auto err_stream = $VM->options.output;\n fprintf(err_stream, \"Registers:\\n\");\n size_t index = 0;\n for (const auto ® : vm._registers)\n {\n fprintf(err_stream, \"R%zu: \", index);\n reg.dump(err_stream);\n fprintf(err_stream, \"\\n\");\n }\n}\n\nvoid DabVM_debug::print_classes()\n{\n for (const auto &it : vm.classes)\n {\n fprintf(stderr, \" - 0x%04x %s (super = 0x%04x)\\n\", it.first, it.second.name.c_str(),\n it.second.superclass_index);\n for (const auto &fin : it.second.static_functions)\n {\n fprintf(stderr, \" ::%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n for (const auto &fin : it.second.functions)\n {\n fprintf(stderr, \" .%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n }\n}\n\nvoid DabVM_debug::print_functions()\n{\n for (auto it : vm.functions)\n {\n auto &fun = it.second;\n fprintf(stderr, \" - %s: %s at %p\\n\", fun.name.c_str(), fun.regular ? \"Dab\" : \"C\",\n (void *)fun.address);\n }\n}\n\nvoid DabVM_debug::print_constants()\n{\n auto output = $VM->options.output;\n fprintf(output, \"symbols:\\n\");\n size_t i = 0;\n for (const auto &symbol : $VM->symbols)\n {\n fprintf(output, \"%d: %s\\n\", (int)i, symbol.c_str());\n i++;\n }\n}\n\nvoid DabVM_debug::print_stack()\n{\n}\n\nvoid DabVM_debug::print_code(bool current_only)\n{\n prepare_disasm();\n\n auto err_stream = $VM->options.output;\n\n auto ip = vm.ip();\n\n fprintf(err_stream, \"IP = %d\\n\", (int)ip);\n\n auto it = find_if(disasm.begin(), disasm.end(),\n [ip](const std::pair &obj) { return obj.first == ip; });\n\n if (it == disasm.end())\n return;\n\n auto index = std::distance(disasm.begin(), it);\n\n long start = current_only ? (index - 2) : 0;\n long end = current_only ? (index + 3) : disasm.size();\n\n for (long i = start; i < end; i++)\n {\n if (i < 0 || i >= (int)disasm.size())\n continue;\n\n const auto &line = disasm[i];\n fprintf(err_stream, \"%c %8\" PRIu64 \": %s\\n\", line.first == ip ? '>' : ' ', line.first,\n line.second.c_str());\n }\n}\n\nstruct InstructionsReader : public BaseReader\n{\n DabVM &vm;\n\n const byte *_data;\n uint64_t _length;\n\n uint64_t start_position = 0;\n\n InstructionsReader(DabVM &vm, uint64_t &position) : BaseReader(position), vm(vm)\n {\n _data = vm.instructions.raw_base_data();\n _length = vm.instructions.raw_base_length();\n\n BinSection code_section;\n bool has_code = false;\n\n for (auto §ion : vm.sections)\n {\n if (std::string(section.name) == \"code\")\n {\n code_section = section;\n has_code = true;\n break;\n }\n }\n\n if (!has_code)\n throw \"no code?\";\n\n start_position = code_section.pos;\n\n _data += start_position;\n _length = code_section.length;\n }\n\n virtual uint64_t raw_read(void *buffer, uint64_t size) override\n {\n auto data_ptr = _data;\n auto length = _length;\n auto offset = position();\n auto max_length = std::min(size, length - offset);\n\n memcpy(buffer, data_ptr + offset, (size_t)max_length);\n\n return max_length;\n }\n\n bool feof()\n {\n return false;\n }\n};\n\nvoid DabVM_debug::prepare_disasm()\n{\n if (has_disasm)\n return;\n\n has_disasm = true;\n\n uint64_t position = 0;\n InstructionsReader reader(vm, position);\n DisasmProcessor processor(reader);\n\n processor.go([this, reader](uint64_t pos, std::string info) {\n disasm.push_back(std::make_pair(pos + reader.start_position, info));\n });\n}\n\nvoid DabVM::execute_debug(Stream &input)\n{\n auto err_stream = options.output;\n\n DabVM_debug debug(*this);\n while (!input.eof())\n {\n char rawcmd[2048];\n fprintf(stderr, \"> \");\n fgets(rawcmd, sizeof(rawcmd), stdin);\n std::string cmd = rawcmd;\n\n cmd = cmd.substr(0, cmd.length() - 1);\n\n if (cmd == \"help\")\n {\n fprintf(err_stream, \"Help:\\n\");\n fprintf(err_stream, \"help - print this\\n\");\n fprintf(err_stream, \"[s]tep - run single instruction\\n\");\n fprintf(err_stream, \"[r]egisters - show registers\\n\");\n fprintf(err_stream, \"classes - print classes\\n\");\n fprintf(err_stream, \"functions - print functions\\n\");\n fprintf(err_stream, \"constants - dump constants\\n\");\n fprintf(err_stream, \"stack - dump stack\\n\");\n fprintf(err_stream, \"code - show current code\\n\");\n fprintf(err_stream, \"allcode - show all code\\n\");\n fprintf(err_stream, \"run - run remaining instructions\\n\");\n fprintf(err_stream, \"break [ip] - break at defined IP\\n\");\n fprintf(err_stream, \"quit - quit\\n\");\n }\n else if (cmd == \"step\" || cmd == \"s\")\n {\n execute_single(input);\n }\n else if (cmd == \"registers\" || cmd == \"r\")\n {\n debug.print_registers();\n }\n else if (cmd == \"classes\")\n {\n debug.print_classes();\n }\n else if (cmd == \"functions\")\n {\n debug.print_functions();\n }\n else if (cmd == \"constants\")\n {\n debug.print_constants();\n }\n else if (cmd == \"stack\")\n {\n debug.print_stack();\n }\n else if (cmd == \"ip\")\n {\n fprintf(err_stream, \"IP = %\" PRIu64 \"\\n\", ip());\n }\n else if (cmd == \"code\")\n {\n debug.print_code(true);\n }\n else if (cmd == \"allcode\")\n {\n debug.print_code(false);\n }\n else if (cmd == \"quit\")\n {\n exit(0);\n }\n else if (cmd == \"run\")\n {\n execute(input);\n }\n else if (cmd.substr(0, 6) == \"break \")\n {\n int ip = 0;\n int ret = sscanf(cmd.c_str(), \"break %d\", &ip);\n assert(ret == 1);\n fprintf(err_stream, \"debug: break at %d.\\n\", ip);\n breakpoints.insert(ip);\n }\n else if (cmd == \"ssaregs\")\n {\n debug.print_ssa_registers();\n }\n else\n {\n fprintf(stderr, \"Unknown command, type to get available commands.\\n\");\n }\n }\n}\nvm: fix some size_t\/uint64_t issues (17)#include \"cvm.h\"\n#include \"..\/cshared\/disasm.h\"\n\nvoid DabVM_debug::print_registers()\n{\n fprintf(stderr, \"IP = %p (%d)\\n\", (void *)vm.ip(), (int)vm.ip());\n}\n\nvoid DabVM_debug::print_ssa_registers()\n{\n auto err_stream = $VM->options.output;\n fprintf(err_stream, \"Registers:\\n\");\n size_t index = 0;\n for (const auto ® : vm._registers)\n {\n fprintf(err_stream, \"R%zu: \", index);\n reg.dump(err_stream);\n fprintf(err_stream, \"\\n\");\n }\n}\n\nvoid DabVM_debug::print_classes()\n{\n for (const auto &it : vm.classes)\n {\n fprintf(stderr, \" - 0x%04x %s (super = 0x%04x)\\n\", it.first, it.second.name.c_str(),\n it.second.superclass_index);\n for (const auto &fin : it.second.static_functions)\n {\n fprintf(stderr, \" ::%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n for (const auto &fin : it.second.functions)\n {\n fprintf(stderr, \" .%s [%s]\\n\", $VM->get_symbol(fin.first).c_str(),\n fin.second.regular ? \"Dab\" : \"C\");\n }\n }\n}\n\nvoid DabVM_debug::print_functions()\n{\n for (auto it : vm.functions)\n {\n auto &fun = it.second;\n fprintf(stderr, \" - %s: %s at %p\\n\", fun.name.c_str(), fun.regular ? \"Dab\" : \"C\",\n (void *)fun.address);\n }\n}\n\nvoid DabVM_debug::print_constants()\n{\n auto output = $VM->options.output;\n fprintf(output, \"symbols:\\n\");\n size_t i = 0;\n for (const auto &symbol : $VM->symbols)\n {\n fprintf(output, \"%d: %s\\n\", (int)i, symbol.c_str());\n i++;\n }\n}\n\nvoid DabVM_debug::print_stack()\n{\n}\n\nvoid DabVM_debug::print_code(bool current_only)\n{\n prepare_disasm();\n\n auto err_stream = $VM->options.output;\n\n auto ip = vm.ip();\n\n fprintf(err_stream, \"IP = %d\\n\", (int)ip);\n\n auto it =\n find_if(disasm.begin(), disasm.end(),\n [ip](const std::pair &obj) { return obj.first == ip; });\n\n if (it == disasm.end())\n return;\n\n auto index = std::distance(disasm.begin(), it);\n\n long start = current_only ? (index - 2) : 0;\n long end = current_only ? (index + 3) : disasm.size();\n\n for (long i = start; i < end; i++)\n {\n if (i < 0 || i >= (int)disasm.size())\n continue;\n\n const auto &line = disasm[i];\n fprintf(err_stream, \"%c %8\" PRIu64 \": %s\\n\", line.first == ip ? '>' : ' ', line.first,\n line.second.c_str());\n }\n}\n\nstruct InstructionsReader : public BaseReader\n{\n DabVM &vm;\n\n const byte *_data;\n uint64_t _length;\n\n uint64_t start_position = 0;\n\n InstructionsReader(DabVM &vm, uint64_t &position) : BaseReader(position), vm(vm)\n {\n _data = vm.instructions.raw_base_data();\n _length = vm.instructions.raw_base_length();\n\n BinSection code_section;\n bool has_code = false;\n\n for (auto §ion : vm.sections)\n {\n if (std::string(section.name) == \"code\")\n {\n code_section = section;\n has_code = true;\n break;\n }\n }\n\n if (!has_code)\n throw \"no code?\";\n\n start_position = code_section.pos;\n\n _data += start_position;\n _length = code_section.length;\n }\n\n virtual uint64_t raw_read(void *buffer, uint64_t size) override\n {\n auto data_ptr = _data;\n auto length = _length;\n auto offset = position();\n auto max_length = std::min(size, length - offset);\n\n memcpy(buffer, data_ptr + offset, (size_t)max_length);\n\n return max_length;\n }\n\n bool feof()\n {\n return false;\n }\n};\n\nvoid DabVM_debug::prepare_disasm()\n{\n if (has_disasm)\n return;\n\n has_disasm = true;\n\n uint64_t position = 0;\n InstructionsReader reader(vm, position);\n DisasmProcessor processor(reader);\n\n processor.go([this, reader](uint64_t pos, std::string info) {\n disasm.push_back(std::make_pair(pos + reader.start_position, info));\n });\n}\n\nvoid DabVM::execute_debug(Stream &input)\n{\n auto err_stream = options.output;\n\n DabVM_debug debug(*this);\n while (!input.eof())\n {\n char rawcmd[2048];\n fprintf(stderr, \"> \");\n fgets(rawcmd, sizeof(rawcmd), stdin);\n std::string cmd = rawcmd;\n\n cmd = cmd.substr(0, cmd.length() - 1);\n\n if (cmd == \"help\")\n {\n fprintf(err_stream, \"Help:\\n\");\n fprintf(err_stream, \"help - print this\\n\");\n fprintf(err_stream, \"[s]tep - run single instruction\\n\");\n fprintf(err_stream, \"[r]egisters - show registers\\n\");\n fprintf(err_stream, \"classes - print classes\\n\");\n fprintf(err_stream, \"functions - print functions\\n\");\n fprintf(err_stream, \"constants - dump constants\\n\");\n fprintf(err_stream, \"stack - dump stack\\n\");\n fprintf(err_stream, \"code - show current code\\n\");\n fprintf(err_stream, \"allcode - show all code\\n\");\n fprintf(err_stream, \"run - run remaining instructions\\n\");\n fprintf(err_stream, \"break [ip] - break at defined IP\\n\");\n fprintf(err_stream, \"quit - quit\\n\");\n }\n else if (cmd == \"step\" || cmd == \"s\")\n {\n execute_single(input);\n }\n else if (cmd == \"registers\" || cmd == \"r\")\n {\n debug.print_registers();\n }\n else if (cmd == \"classes\")\n {\n debug.print_classes();\n }\n else if (cmd == \"functions\")\n {\n debug.print_functions();\n }\n else if (cmd == \"constants\")\n {\n debug.print_constants();\n }\n else if (cmd == \"stack\")\n {\n debug.print_stack();\n }\n else if (cmd == \"ip\")\n {\n fprintf(err_stream, \"IP = %\" PRIu64 \"\\n\", ip());\n }\n else if (cmd == \"code\")\n {\n debug.print_code(true);\n }\n else if (cmd == \"allcode\")\n {\n debug.print_code(false);\n }\n else if (cmd == \"quit\")\n {\n exit(0);\n }\n else if (cmd == \"run\")\n {\n execute(input);\n }\n else if (cmd.substr(0, 6) == \"break \")\n {\n int ip = 0;\n int ret = sscanf(cmd.c_str(), \"break %d\", &ip);\n assert(ret == 1);\n fprintf(err_stream, \"debug: break at %d.\\n\", ip);\n breakpoints.insert(ip);\n }\n else if (cmd == \"ssaregs\")\n {\n debug.print_ssa_registers();\n }\n else\n {\n fprintf(stderr, \"Unknown command, type to get available commands.\\n\");\n }\n }\n}\n<|endoftext|>"} {"text":"#include \"db_single.h\"\n\nnamespace LeviDB {\n DBSingle::DBSingle(std::string name, Options options, SeqGenerator * seq_gen)\n : DB(std::move(name), options), _seq_gen(seq_gen) {\n std::string prefix = _name + '\/' + _name;\n _file_lock.build(prefix + \".lock\");\n\n if (IOEnv::fileExists(_name)) {\n if (_options.error_if_exists) {\n throw Exception::invalidArgumentException(\"DB already exists\");\n }\n \/\/ 打开现有数据库\n std::string data_fname = prefix + \".data\";\n if (!IOEnv::fileExists(data_fname)) {\n throw Exception::notFoundException(\"data file missing\", data_fname);\n }\n std::string index_fname = prefix + \".index\";\n std::string keeper_fname = prefix + \".keeper\";\n if (!IOEnv::fileExists(index_fname) || !IOEnv::fileExists(keeper_fname)) {\n simpleRepair();\n return;\n }\n _meta.build(std::move(prefix));\n _af.build(data_fname);\n _rf.build(std::move(data_fname));\n _index.build(std::move(index_fname), _meta->immut_value()._offset, _seq_gen, _rf.get());\n _writer.build(_af.get());\n } else {\n if (!_options.create_if_missing) {\n throw Exception::notFoundException(\"DB not found\");\n }\n \/\/ 新建数据库\n IOEnv::createDir(_name);\n _af.build(prefix + \".data\");\n _rf.build(prefix + \".data\");\n _index.build(prefix + \".index\", _seq_gen, _rf.get());\n _writer.build(_af.get());\n _meta.build(std::move(prefix), DBSingleWeakMeta{}, \"\"); \/\/ WeakKeeper will add \".keeper\" automatically\n }\n }\n\n void DBSingle::put(const WriteOptions & options,\n const Slice & key,\n const Slice & value) {\n RWLockWriteGuard write_guard(_rwlock);\n\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeRecord(key, value);\n _writer->addRecord({bin.data(), bin.size()});\n _index->insert(key, OffsetToData{pos});\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n void DBSingle::remove(const WriteOptions & options,\n const Slice & key) {\n RWLockWriteGuard write_guard(_rwlock);\n\n std::vector bin = LogWriter::makeRecord(key, {});\n _writer->addDelRecord({bin.data(), bin.size()});\n _index->remove(key);\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n void DBSingle::write(const WriteOptions & options,\n const std::vector> & kvs) {\n RWLockWriteGuard write_guard(_rwlock);\n\n if (options.compress) {\n assert(options.uncompress_size != 0);\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeCompressRecord(kvs);\n if (bin.size() <= options.uncompress_size \/ 8 * 7) { \/\/ worth\n _writer->addCompressRecord({bin.data(), bin.size()});\n for (const auto & kv:kvs) {\n _index->insert(kv.first, OffsetToData{pos});\n }\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n return;\n }\n }\n\n std::vector> group;\n group.reserve(kvs.size());\n std::transform(kvs.cbegin(), kvs.cend(), group.begin(), [](const std::pair & kv) noexcept {\n return LogWriter::makeRecord(kv.first, kv.second);\n });\n\n std::vector bkvs;\n bkvs.reserve(group.size());\n std::transform(group.cbegin(), group.cend(), bkvs.begin(),\n [](const std::vector & bkv) noexcept -> Slice {\n return {bkv.data(), bkv.size()};\n });\n\n std::vector addrs = _writer->addRecords(bkvs);\n assert(kvs.size() == addrs.size());\n for (int i = 0; i < kvs.size(); ++i) {\n _index->insert(kvs[i].first, OffsetToData{addrs[i]});\n }\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n std::pair\n DBSingle::get(const ReadOptions & options, const Slice & key) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->find(key, options.sequence_number);\n };\n\n std::unique_ptr\n DBSingle::makeSnapshot() {\n RWLockWriteGuard write_guard(_rwlock);\n _index->tryApplyPending();\n return _seq_gen->makeSnapshot();\n };\n\n std::unique_ptr>\n DBSingle::makeIterator(std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeIterator(std::move(snapshot));\n };\n\n std::unique_ptr>>\n DBSingle::makeRegexIterator(std::shared_ptr regex,\n std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeRegexIterator(std::move(regex), std::move(snapshot));\n };\n\n std::unique_ptr>>\n DBSingle::makeRegexReversedIterator(std::shared_ptr regex,\n std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeRegexReversedIterator(std::move(regex), std::move(snapshot));\n };\n\n void DBSingle::tryApplyPending() {\n RWLockWriteGuard write_guard(_rwlock);\n _index->tryApplyPending();\n }\n\n uint64_t DBSingle::indexFileSize() const noexcept {\n return _index->immut_dst().immut_length();\n };\n\n uint64_t DBSingle::dataFileSize() const noexcept {\n return _af->immut_length();\n };\n\n void DBSingle::explicitRemove(const WriteOptions & options, const Slice & key) {\n RWLockWriteGuard write_guard(_rwlock);\n\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeRecord(key, {});\n _writer->addDelRecord({bin.data(), bin.size()});\n _index->insert(key, OffsetToData{pos});\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n }\n\n void DBSingle::simpleRepair() noexcept {\n\n }\n\n Slice DBSingle::largestKey() const noexcept {\n\n };\n\n Slice DBSingle::smallestKey() const noexcept {\n\n };\n\n void DBSingle::updateKeyRange(const Slice & key) noexcept {\n\n };\n\n bool repairDBSingle(const std::string & db_single_name) noexcept {\n\n };\n}\nupdateKeyRange#include \"db_single.h\"\n\nnamespace LeviDB {\n DBSingle::DBSingle(std::string name, Options options, SeqGenerator * seq_gen)\n : DB(std::move(name), options), _seq_gen(seq_gen) {\n std::string prefix = _name + '\/' + _name;\n _file_lock.build(prefix + \".lock\");\n\n if (IOEnv::fileExists(_name)) {\n if (_options.error_if_exists) {\n throw Exception::invalidArgumentException(\"DB already exists\");\n }\n \/\/ 打开现有数据库\n std::string data_fname = prefix + \".data\";\n if (!IOEnv::fileExists(data_fname)) {\n throw Exception::notFoundException(\"data file missing\", data_fname);\n }\n std::string index_fname = prefix + \".index\";\n std::string keeper_fname = prefix + \".keeper\";\n if (!IOEnv::fileExists(index_fname) || !IOEnv::fileExists(keeper_fname)) {\n simpleRepair();\n return;\n }\n _meta.build(std::move(prefix));\n _af.build(data_fname);\n _rf.build(std::move(data_fname));\n _index.build(std::move(index_fname), _meta->immut_value()._offset, _seq_gen, _rf.get());\n _writer.build(_af.get());\n } else {\n if (!_options.create_if_missing) {\n throw Exception::notFoundException(\"DB not found\");\n }\n \/\/ 新建数据库\n IOEnv::createDir(_name);\n _af.build(prefix + \".data\");\n _rf.build(prefix + \".data\");\n _index.build(prefix + \".index\", _seq_gen, _rf.get());\n _writer.build(_af.get());\n _meta.build(std::move(prefix), DBSingleWeakMeta{}, \"\"); \/\/ WeakKeeper will add \".keeper\" automatically\n }\n }\n\n void DBSingle::put(const WriteOptions & options,\n const Slice & key,\n const Slice & value) {\n RWLockWriteGuard write_guard(_rwlock);\n\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeRecord(key, value);\n _writer->addRecord({bin.data(), bin.size()});\n updateKeyRange(key);\n _index->insert(key, OffsetToData{pos});\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n void DBSingle::remove(const WriteOptions & options,\n const Slice & key) {\n RWLockWriteGuard write_guard(_rwlock);\n\n std::vector bin = LogWriter::makeRecord(key, {});\n _writer->addDelRecord({bin.data(), bin.size()});\n _index->remove(key);\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n void DBSingle::write(const WriteOptions & options,\n const std::vector> & kvs) {\n RWLockWriteGuard write_guard(_rwlock);\n\n if (options.compress) {\n assert(options.uncompress_size != 0);\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeCompressRecord(kvs);\n if (bin.size() <= options.uncompress_size \/ 8 * 7) { \/\/ worth\n _writer->addCompressRecord({bin.data(), bin.size()});\n for (const auto & kv:kvs) {\n updateKeyRange(kv.first);\n _index->insert(kv.first, OffsetToData{pos});\n }\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n return;\n }\n }\n\n std::vector> group;\n group.reserve(kvs.size());\n std::transform(kvs.cbegin(), kvs.cend(), group.begin(), [](const std::pair & kv) noexcept {\n return LogWriter::makeRecord(kv.first, kv.second);\n });\n\n std::vector bkvs;\n bkvs.reserve(group.size());\n std::transform(group.cbegin(), group.cend(), bkvs.begin(),\n [](const std::vector & bkv) noexcept -> Slice {\n return {bkv.data(), bkv.size()};\n });\n\n std::vector addrs = _writer->addRecords(bkvs);\n assert(kvs.size() == addrs.size());\n for (int i = 0; i < kvs.size(); ++i) {\n updateKeyRange(kvs[i].first);\n _index->insert(kvs[i].first, OffsetToData{addrs[i]});\n }\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n };\n\n std::pair\n DBSingle::get(const ReadOptions & options, const Slice & key) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->find(key, options.sequence_number);\n };\n\n std::unique_ptr\n DBSingle::makeSnapshot() {\n RWLockWriteGuard write_guard(_rwlock);\n _index->tryApplyPending();\n return _seq_gen->makeSnapshot();\n };\n\n std::unique_ptr>\n DBSingle::makeIterator(std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeIterator(std::move(snapshot));\n };\n\n std::unique_ptr>>\n DBSingle::makeRegexIterator(std::shared_ptr regex,\n std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeRegexIterator(std::move(regex), std::move(snapshot));\n };\n\n std::unique_ptr>>\n DBSingle::makeRegexReversedIterator(std::shared_ptr regex,\n std::unique_ptr && snapshot) const {\n RWLockReadGuard read_guard(_rwlock);\n return _index->makeRegexReversedIterator(std::move(regex), std::move(snapshot));\n };\n\n void DBSingle::tryApplyPending() {\n RWLockWriteGuard write_guard(_rwlock);\n _index->tryApplyPending();\n }\n\n uint64_t DBSingle::indexFileSize() const noexcept {\n return _index->immut_dst().immut_length();\n };\n\n uint64_t DBSingle::dataFileSize() const noexcept {\n return _af->immut_length();\n };\n\n void DBSingle::explicitRemove(const WriteOptions & options, const Slice & key) {\n RWLockWriteGuard write_guard(_rwlock);\n\n uint32_t pos = _writer->calcWritePos();\n std::vector bin = LogWriter::makeRecord(key, {});\n _writer->addDelRecord({bin.data(), bin.size()});\n _index->insert(key, OffsetToData{pos});\n\n _index->tryApplyPending();\n if (options.sync) _af->sync();\n }\n\n void DBSingle::simpleRepair() noexcept {\n\n }\n\n Slice DBSingle::largestKey() const noexcept {\n const std::string & trailing = _meta->immut_trailing();\n uint32_t from_k_len = _meta->immut_value().from_k_len;\n uint32_t to_k_len = _meta->immut_value().to_k_len;\n return {trailing.data() + from_k_len, to_k_len};\n };\n\n Slice DBSingle::smallestKey() const noexcept {\n const std::string & trailing = _meta->immut_trailing();\n uint32_t from_k_len = _meta->immut_value().from_k_len;\n return {trailing.data(), from_k_len};\n };\n\n void DBSingle::updateKeyRange(const Slice & key) noexcept {\n if (SliceComparator{}(key, smallestKey())) { \/\/ find smaller\n std::string & trailing = _meta->mut_trailing();\n uint32_t from_k_len = _meta->immut_value().from_k_len;\n trailing.replace(trailing.begin(), trailing.begin() + from_k_len, key.data(), key.data() + key.size());\n _meta->mut_value().from_k_len = static_cast(key.size());\n } else if (SliceComparator{}(largestKey(), key)) { \/\/ find larger\n std::string & trailing = _meta->mut_trailing();\n uint32_t from_k_len = _meta->immut_value().from_k_len;\n uint32_t to_k_len = _meta->immut_value().to_k_len;\n trailing.replace(trailing.begin() + from_k_len, trailing.begin() + from_k_len + to_k_len,\n key.data(), key.data() + key.size());\n _meta->mut_value().to_k_len = static_cast(key.size());\n }\n };\n\n bool repairDBSingle(const std::string & db_single_name) noexcept {\n\n };\n}\n<|endoftext|>"} {"text":"\/\/=======================================================================\n\/\/ Copyright (c) 2014 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include \n#include \n\n#include \"dll\/dbn.hpp\"\n#include \"dll\/test.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nnamespace {\n\ntemplate\nvoid test_all(DBN& dbn, std::vector>& training_images, const std::vector& training_labels, P&& predictor){\n auto test_images = mnist::read_test_images();\n auto test_labels = mnist::read_test_labels();\n\n if(test_images.empty() || test_labels.empty()){\n std::cout << \"Impossible to read test set\" << std::endl;\n return;\n }\n\n std::cout << \"Start testing\" << std::endl;\n\n std::cout << \"Training Set\" << std::endl;\n auto error_rate = dll::test_set(dbn, training_images, training_labels, predictor);\n std::cout << \"\\tError rate (normal): \" << 100.0 * error_rate << std::endl;\n\n std::cout << \"Test Set\" << std::endl;\n error_rate = dll::test_set(dbn, test_images, test_labels, predictor);\n std::cout << \"\\tError rate (normal): \" << 100.0 * error_rate << std::endl;\n}\n\n} \/\/end of anonymous namespace\n\nint main(int argc, char* argv[]){\n auto simple = false;\n auto load = false;\n\n for(int i = 1; i < argc; ++i){\n std::string command(argv[i]);\n\n if(command == \"simple\"){\n simple = true;\n }\n\n if(command == \"load\"){\n load = true;\n }\n }\n\n auto dataset = mnist::read_dataset();\n\n if(dataset.training_images.empty() || dataset.training_labels.empty()){\n return 1;\n }\n\n mnist::binarize_dataset(dataset);\n\n if(simple){\n typedef dll::dbn<\n dll::layer<28 * 28, 100, dll::in_dbn, dll::batch_size<50>, dll::init_weights, dll::momentum, dll::weight_decay>,\n dll::layer<100, 100, dll::in_dbn, dll::batch_size<50>, dll::momentum, dll::weight_decay>,\n dll::layer<110, 200, dll::in_dbn, dll::batch_size<50>, dll::momentum, dll::weight_decay>> dbn_simple_t;\n\n auto dbn = std::make_shared();\n\n dbn->train_with_labels(dataset.training_images, dataset.training_labels, 10, 5);\n\n test_all(dbn, dataset.training_images, dataset.training_labels, dll::label_predictor());\n } else {\n typedef dll::dbn<\n dll::layer<28 * 28, 100, dll::in_dbn, dll::momentum, dll::batch_size<50>, dll::init_weights>,\n dll::layer<100, 200, dll::in_dbn, dll::momentum, dll::batch_size<50>>,\n dll::layer<200, 10, dll::in_dbn, dll::momentum, dll::batch_size<50>, dll::hidden>> dbn_t;\n\n auto dbn = make_unique();\n\n dbn->display();\n\n if(load){\n std::cout << \"Load from file\" << std::endl;\n\n std::ifstream is(\"dbn.dat\", std::ifstream::binary);\n dbn->load(is);\n } else {\n std::cout << \"Start pretraining\" << std::endl;\n dbn->pretrain(dataset.training_images, 5);\n\n std::cout << \"Start fine-tuning\" << std::endl;\n dbn->fine_tune(dataset.training_images, dataset.training_labels, 5, 1000);\n\n std::ofstream os(\"dbn.dat\", std::ofstream::binary);\n dbn->store(os);\n }\n\n test_all(dbn, dataset.training_images, dataset.training_labels, dll::predictor());\n }\n\n return 0;\n}\nClena\/\/=======================================================================\n\/\/ Copyright (c) 2014 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include \n#include \n\n#include \"dll\/dbn.hpp\"\n#include \"dll\/test.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nnamespace {\n\ntemplate\nvoid test_all(DBN& dbn, std::vector>& training_images, const std::vector& training_labels, P&& predictor){\n auto test_images = mnist::read_test_images();\n auto test_labels = mnist::read_test_labels();\n\n if(test_images.empty() || test_labels.empty()){\n std::cout << \"Impossible to read test set\" << std::endl;\n return;\n }\n\n std::cout << \"Start testing\" << std::endl;\n\n std::cout << \"Training Set\" << std::endl;\n auto error_rate = dll::test_set(dbn, training_images, training_labels, predictor);\n std::cout << \"\\tError rate (normal): \" << 100.0 * error_rate << std::endl;\n\n std::cout << \"Test Set\" << std::endl;\n error_rate = dll::test_set(dbn, test_images, test_labels, predictor);\n std::cout << \"\\tError rate (normal): \" << 100.0 * error_rate << std::endl;\n}\n\n} \/\/end of anonymous namespace\n\nint main(int argc, char* argv[]){\n auto simple = false;\n auto load = false;\n\n for(int i = 1; i < argc; ++i){\n std::string command(argv[i]);\n\n if(command == \"simple\"){\n simple = true;\n }\n\n if(command == \"load\"){\n load = true;\n }\n }\n\n auto dataset = mnist::read_dataset();\n\n if(dataset.training_images.empty() || dataset.training_labels.empty()){\n return 1;\n }\n\n mnist::binarize_dataset(dataset);\n\n if(simple){\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::in_dbn, dll::batch_size<50>, dll::init_weights, dll::momentum, dll::weight_decay>::rbm_t,\n dll::rbm_desc<100, 100, dll::in_dbn, dll::batch_size<50>, dll::momentum, dll::weight_decay>::rbm_t,\n dll::rbm_desc<110, 200, dll::in_dbn, dll::batch_size<50>, dll::momentum, dll::weight_decay>::rbm_t,\n >> dbn_simple_t;\n\n auto dbn = std::make_shared();\n\n dbn->train_with_labels(dataset.training_images, dataset.training_labels, 10, 5);\n\n test_all(dbn, dataset.training_images, dataset.training_labels, dll::label_predictor());\n } else {\n typedef dll::dbn<\n dll::layer<28 * 28, 100, dll::in_dbn, dll::momentum, dll::batch_size<50>, dll::init_weights>,\n dll::layer<100, 200, dll::in_dbn, dll::momentum, dll::batch_size<50>>,\n dll::layer<200, 10, dll::in_dbn, dll::momentum, dll::batch_size<50>, dll::hidden>> dbn_t;\n\n auto dbn = make_unique();\n\n dbn->display();\n\n if(load){\n std::cout << \"Load from file\" << std::endl;\n\n std::ifstream is(\"dbn.dat\", std::ifstream::binary);\n dbn->load(is);\n } else {\n std::cout << \"Start pretraining\" << std::endl;\n dbn->pretrain(dataset.training_images, 5);\n\n std::cout << \"Start fine-tuning\" << std::endl;\n dbn->fine_tune(dataset.training_images, dataset.training_labels, 5, 1000);\n\n std::ofstream os(\"dbn.dat\", std::ofstream::binary);\n dbn->store(os);\n }\n\n test_all(dbn, dataset.training_images, dataset.training_labels, dll::predictor());\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"\/\/ Copyright (c) 2009-2014 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"ecwrapper.h\"\n\n#include \"serialize.h\"\n#include \"uint256.h\"\n\n#include \n#include \n#include \n\nnamespace {\n\n\/**\n * Perform ECDSA key recovery (see SEC1 4.1.6) for curves over (mod p)-fields\n * recid selects which key is recovered\n * if check is non-zero, additional checks are performed\n *\/\nint ECDSA_SIG_recover_key_GFp(EC_KEY *eckey, ECDSA_SIG *ecsig, const unsigned char *msg, int msglen, int recid, int check)\n{\n if (!eckey) return 0;\n\n int ret = 0;\n BN_CTX *ctx = NULL;\n\n BIGNUM *x = NULL;\n BIGNUM *e = NULL;\n BIGNUM *order = NULL;\n BIGNUM *sor = NULL;\n BIGNUM *eor = NULL;\n BIGNUM *field = NULL;\n EC_POINT *R = NULL;\n EC_POINT *O = NULL;\n EC_POINT *Q = NULL;\n BIGNUM *rr = NULL;\n BIGNUM *zero = NULL;\n int n = 0;\n int i = recid \/ 2;\n\n const EC_GROUP *group = EC_KEY_get0_group(eckey);\n if ((ctx = BN_CTX_new()) == NULL) { ret = -1; goto err; }\n BN_CTX_start(ctx);\n order = BN_CTX_get(ctx);\n if (!EC_GROUP_get_order(group, order, ctx)) { ret = -2; goto err; }\n x = BN_CTX_get(ctx);\n if (!BN_copy(x, order)) { ret=-1; goto err; }\n if (!BN_mul_word(x, i)) { ret=-1; goto err; }\n if (!BN_add(x, x, ecsig->r)) { ret=-1; goto err; }\n field = BN_CTX_get(ctx);\n if (!EC_GROUP_get_curve_GFp(group, field, NULL, NULL, ctx)) { ret=-2; goto err; }\n if (BN_cmp(x, field) >= 0) { ret=0; goto err; }\n if ((R = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_set_compressed_coordinates_GFp(group, R, x, recid % 2, ctx)) { ret=0; goto err; }\n if (check)\n {\n if ((O = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_mul(group, O, NULL, R, order, ctx)) { ret=-2; goto err; }\n if (!EC_POINT_is_at_infinity(group, O)) { ret = 0; goto err; }\n }\n if ((Q = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n n = EC_GROUP_get_degree(group);\n e = BN_CTX_get(ctx);\n if (!BN_bin2bn(msg, msglen, e)) { ret=-1; goto err; }\n if (8*msglen > n) BN_rshift(e, e, 8-(n & 7));\n zero = BN_CTX_get(ctx);\n if (!BN_zero(zero)) { ret=-1; goto err; }\n if (!BN_mod_sub(e, zero, e, order, ctx)) { ret=-1; goto err; }\n rr = BN_CTX_get(ctx);\n if (!BN_mod_inverse(rr, ecsig->r, order, ctx)) { ret=-1; goto err; }\n sor = BN_CTX_get(ctx);\n if (!BN_mod_mul(sor, ecsig->s, rr, order, ctx)) { ret=-1; goto err; }\n eor = BN_CTX_get(ctx);\n if (!BN_mod_mul(eor, e, rr, order, ctx)) { ret=-1; goto err; }\n if (!EC_POINT_mul(group, Q, eor, R, sor, ctx)) { ret=-2; goto err; }\n if (!EC_KEY_set_public_key(eckey, Q)) { ret=-2; goto err; }\n\n ret = 1;\n\nerr:\n if (ctx) {\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n }\n if (R != NULL) EC_POINT_free(R);\n if (O != NULL) EC_POINT_free(O);\n if (Q != NULL) EC_POINT_free(Q);\n return ret;\n}\n\n} \/\/ anon namespace\n\nCECKey::CECKey() {\n pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n assert(pkey != NULL);\n}\n\nCECKey::~CECKey() {\n EC_KEY_free(pkey);\n}\n\nvoid CECKey::GetPubKey(std::vector &pubkey, bool fCompressed) {\n EC_KEY_set_conv_form(pkey, fCompressed ? POINT_CONVERSION_COMPRESSED : POINT_CONVERSION_UNCOMPRESSED);\n int nSize = i2o_ECPublicKey(pkey, NULL);\n assert(nSize);\n assert(nSize <= 65);\n pubkey.clear();\n pubkey.resize(nSize);\n unsigned char *pbegin(begin_ptr(pubkey));\n int nSize2 = i2o_ECPublicKey(pkey, &pbegin);\n assert(nSize == nSize2);\n}\n\nbool CECKey::SetPubKey(const unsigned char* pubkey, size_t size) {\n return o2i_ECPublicKey(&pkey, &pubkey, size) != NULL;\n}\n\nbool CECKey::Verify(const uint256 &hash, const std::vector& vchSig) {\n \/\/ -1 = error, 0 = bad sig, 1 = good\n if (ECDSA_verify(0, (unsigned char*)&hash, sizeof(hash), &vchSig[0], vchSig.size(), pkey) != 1)\n return false;\n return true;\n}\n\nbool CECKey::Recover(const uint256 &hash, const unsigned char *p64, int rec)\n{\n if (rec<0 || rec>=3)\n return false;\n ECDSA_SIG *sig = ECDSA_SIG_new();\n BN_bin2bn(&p64[0], 32, sig->r);\n BN_bin2bn(&p64[32], 32, sig->s);\n bool ret = ECDSA_SIG_recover_key_GFp(pkey, sig, (unsigned char*)&hash, sizeof(hash), rec, 0) == 1;\n ECDSA_SIG_free(sig);\n return ret;\n}\n\nbool CECKey::TweakPublic(const unsigned char vchTweak[32]) {\n bool ret = true;\n BN_CTX *ctx = BN_CTX_new();\n BN_CTX_start(ctx);\n BIGNUM *bnTweak = BN_CTX_get(ctx);\n BIGNUM *bnOrder = BN_CTX_get(ctx);\n BIGNUM *bnOne = BN_CTX_get(ctx);\n const EC_GROUP *group = EC_KEY_get0_group(pkey);\n EC_GROUP_get_order(group, bnOrder, ctx); \/\/ what a grossly inefficient way to get the (constant) group order...\n BN_bin2bn(vchTweak, 32, bnTweak);\n if (BN_cmp(bnTweak, bnOrder) >= 0)\n ret = false; \/\/ extremely unlikely\n EC_POINT *point = EC_POINT_dup(EC_KEY_get0_public_key(pkey), group);\n BN_one(bnOne);\n EC_POINT_mul(group, point, bnTweak, point, bnOne, ctx);\n if (EC_POINT_is_at_infinity(group, point))\n ret = false; \/\/ ridiculously unlikely\n EC_KEY_set_public_key(pkey, point);\n EC_POINT_free(point);\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n return ret;\n}\n\nbool CECKey::SanityCheck()\n{\n EC_KEY *pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n if(pkey == NULL)\n return false;\n EC_KEY_free(pkey);\n\n \/\/ TODO Is there more EC functionality that could be missing?\n return true;\n}\nconsensus: guard against openssl's new strict DER checks\/\/ Copyright (c) 2009-2014 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"ecwrapper.h\"\n\n#include \"serialize.h\"\n#include \"uint256.h\"\n\n#include \n#include \n#include \n\nnamespace {\n\n\/**\n * Perform ECDSA key recovery (see SEC1 4.1.6) for curves over (mod p)-fields\n * recid selects which key is recovered\n * if check is non-zero, additional checks are performed\n *\/\nint ECDSA_SIG_recover_key_GFp(EC_KEY *eckey, ECDSA_SIG *ecsig, const unsigned char *msg, int msglen, int recid, int check)\n{\n if (!eckey) return 0;\n\n int ret = 0;\n BN_CTX *ctx = NULL;\n\n BIGNUM *x = NULL;\n BIGNUM *e = NULL;\n BIGNUM *order = NULL;\n BIGNUM *sor = NULL;\n BIGNUM *eor = NULL;\n BIGNUM *field = NULL;\n EC_POINT *R = NULL;\n EC_POINT *O = NULL;\n EC_POINT *Q = NULL;\n BIGNUM *rr = NULL;\n BIGNUM *zero = NULL;\n int n = 0;\n int i = recid \/ 2;\n\n const EC_GROUP *group = EC_KEY_get0_group(eckey);\n if ((ctx = BN_CTX_new()) == NULL) { ret = -1; goto err; }\n BN_CTX_start(ctx);\n order = BN_CTX_get(ctx);\n if (!EC_GROUP_get_order(group, order, ctx)) { ret = -2; goto err; }\n x = BN_CTX_get(ctx);\n if (!BN_copy(x, order)) { ret=-1; goto err; }\n if (!BN_mul_word(x, i)) { ret=-1; goto err; }\n if (!BN_add(x, x, ecsig->r)) { ret=-1; goto err; }\n field = BN_CTX_get(ctx);\n if (!EC_GROUP_get_curve_GFp(group, field, NULL, NULL, ctx)) { ret=-2; goto err; }\n if (BN_cmp(x, field) >= 0) { ret=0; goto err; }\n if ((R = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_set_compressed_coordinates_GFp(group, R, x, recid % 2, ctx)) { ret=0; goto err; }\n if (check)\n {\n if ((O = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n if (!EC_POINT_mul(group, O, NULL, R, order, ctx)) { ret=-2; goto err; }\n if (!EC_POINT_is_at_infinity(group, O)) { ret = 0; goto err; }\n }\n if ((Q = EC_POINT_new(group)) == NULL) { ret = -2; goto err; }\n n = EC_GROUP_get_degree(group);\n e = BN_CTX_get(ctx);\n if (!BN_bin2bn(msg, msglen, e)) { ret=-1; goto err; }\n if (8*msglen > n) BN_rshift(e, e, 8-(n & 7));\n zero = BN_CTX_get(ctx);\n if (!BN_zero(zero)) { ret=-1; goto err; }\n if (!BN_mod_sub(e, zero, e, order, ctx)) { ret=-1; goto err; }\n rr = BN_CTX_get(ctx);\n if (!BN_mod_inverse(rr, ecsig->r, order, ctx)) { ret=-1; goto err; }\n sor = BN_CTX_get(ctx);\n if (!BN_mod_mul(sor, ecsig->s, rr, order, ctx)) { ret=-1; goto err; }\n eor = BN_CTX_get(ctx);\n if (!BN_mod_mul(eor, e, rr, order, ctx)) { ret=-1; goto err; }\n if (!EC_POINT_mul(group, Q, eor, R, sor, ctx)) { ret=-2; goto err; }\n if (!EC_KEY_set_public_key(eckey, Q)) { ret=-2; goto err; }\n\n ret = 1;\n\nerr:\n if (ctx) {\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n }\n if (R != NULL) EC_POINT_free(R);\n if (O != NULL) EC_POINT_free(O);\n if (Q != NULL) EC_POINT_free(Q);\n return ret;\n}\n\n} \/\/ anon namespace\n\nCECKey::CECKey() {\n pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n assert(pkey != NULL);\n}\n\nCECKey::~CECKey() {\n EC_KEY_free(pkey);\n}\n\nvoid CECKey::GetPubKey(std::vector &pubkey, bool fCompressed) {\n EC_KEY_set_conv_form(pkey, fCompressed ? POINT_CONVERSION_COMPRESSED : POINT_CONVERSION_UNCOMPRESSED);\n int nSize = i2o_ECPublicKey(pkey, NULL);\n assert(nSize);\n assert(nSize <= 65);\n pubkey.clear();\n pubkey.resize(nSize);\n unsigned char *pbegin(begin_ptr(pubkey));\n int nSize2 = i2o_ECPublicKey(pkey, &pbegin);\n assert(nSize == nSize2);\n}\n\nbool CECKey::SetPubKey(const unsigned char* pubkey, size_t size) {\n return o2i_ECPublicKey(&pkey, &pubkey, size) != NULL;\n}\n\nbool CECKey::Verify(const uint256 &hash, const std::vector& vchSig) {\n \/\/ New versions of OpenSSL will reject non-canonical DER signatures. de\/re-serialize first.\n unsigned char *norm_der = NULL;\n ECDSA_SIG *norm_sig = ECDSA_SIG_new();\n const unsigned char* sigptr = &vchSig[0];\n d2i_ECDSA_SIG(&norm_sig, &sigptr, vchSig.size());\n int derlen = i2d_ECDSA_SIG(norm_sig, &norm_der);\n ECDSA_SIG_free(norm_sig);\n if (derlen <= 0)\n return false;\n\n \/\/ -1 = error, 0 = bad sig, 1 = good\n bool ret = ECDSA_verify(0, (unsigned char*)&hash, sizeof(hash), norm_der, derlen, pkey) == 1;\n OPENSSL_free(norm_der);\n return ret;\n}\n\nbool CECKey::Recover(const uint256 &hash, const unsigned char *p64, int rec)\n{\n if (rec<0 || rec>=3)\n return false;\n ECDSA_SIG *sig = ECDSA_SIG_new();\n BN_bin2bn(&p64[0], 32, sig->r);\n BN_bin2bn(&p64[32], 32, sig->s);\n bool ret = ECDSA_SIG_recover_key_GFp(pkey, sig, (unsigned char*)&hash, sizeof(hash), rec, 0) == 1;\n ECDSA_SIG_free(sig);\n return ret;\n}\n\nbool CECKey::TweakPublic(const unsigned char vchTweak[32]) {\n bool ret = true;\n BN_CTX *ctx = BN_CTX_new();\n BN_CTX_start(ctx);\n BIGNUM *bnTweak = BN_CTX_get(ctx);\n BIGNUM *bnOrder = BN_CTX_get(ctx);\n BIGNUM *bnOne = BN_CTX_get(ctx);\n const EC_GROUP *group = EC_KEY_get0_group(pkey);\n EC_GROUP_get_order(group, bnOrder, ctx); \/\/ what a grossly inefficient way to get the (constant) group order...\n BN_bin2bn(vchTweak, 32, bnTweak);\n if (BN_cmp(bnTweak, bnOrder) >= 0)\n ret = false; \/\/ extremely unlikely\n EC_POINT *point = EC_POINT_dup(EC_KEY_get0_public_key(pkey), group);\n BN_one(bnOne);\n EC_POINT_mul(group, point, bnTweak, point, bnOne, ctx);\n if (EC_POINT_is_at_infinity(group, point))\n ret = false; \/\/ ridiculously unlikely\n EC_KEY_set_public_key(pkey, point);\n EC_POINT_free(point);\n BN_CTX_end(ctx);\n BN_CTX_free(ctx);\n return ret;\n}\n\nbool CECKey::SanityCheck()\n{\n EC_KEY *pkey = EC_KEY_new_by_curve_name(NID_secp256k1);\n if(pkey == NULL)\n return false;\n EC_KEY_free(pkey);\n\n \/\/ TODO Is there more EC functionality that could be missing?\n return true;\n}\n<|endoftext|>"} {"text":"#include \"http.h\"\n#include \n#include \n\n#ifdef _WIN32\n# include \n#endif\n\nnamespace enji {\n\nint cb_http_message_begin(http_parser* parser) {\n return 0;\n}\n\nint cb_http_url(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_url(at, len);\n}\n\nint cb_http_status(http_parser* parser, const char* at, size_t len) {\n std::cerr << \"Got unhandled status: \" << String(at, len) << std::endl;\n return 0;\n}\n\nint cb_http_header_field(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_header_field(at, len);\n}\n\nint cb_http_header_value(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_header_value(at, len);\n}\n\nint cb_http_headers_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_headers_complete();\n}\n\nint cb_http_body(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_body(at, len);\n}\n\nint cb_http_message_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_message_complete();\n}\n\nhttp_parser_settings& get_http_settings() {\n static http_parser_settings http_settings = {};\n http_settings.on_message_begin = cb_http_message_begin;\n http_settings.on_url = cb_http_url;\n http_settings.on_status = cb_http_status;\n http_settings.on_header_field = cb_http_header_field;\n http_settings.on_header_value = cb_http_header_value;\n http_settings.on_headers_complete = cb_http_headers_complete;\n http_settings.on_body = cb_http_body;\n http_settings.on_message_complete = cb_http_message_complete;\n return http_settings;\n}\n\nHttpConnection::HttpConnection(HttpServer* parent, size_t id)\n: Connection(parent, id),\n parent_(parent) {\n parser_.reset(new http_parser{});\n http_parser_init(parser_.get(), HTTP_REQUEST);\n parser_.get()->data = this;\n\n request_.reset(new HttpRequest{});\n}\n\nconst HttpRequest& HttpConnection::request() const {\n return *request_.get();\n}\n\nint HttpConnection::on_http_url(const char* at, size_t len) {\n request_->url_ += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_field(const char* at, size_t len) {\n check_header_finished();\n read_header_.first += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_value(const char* at, size_t len) {\n read_header_.second += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_headers_complete() {\n check_header_finished();\n return 0;\n}\n\nint HttpConnection::on_http_body(const char* at, size_t len) {\n request_->body_ += String{at, len};\n return 0;\n}\n\nconst String MULTIPART_FORM_DATA = \"multipart\/form-data; boundary=\";\n\nint HttpConnection::on_message_complete() {\n message_completed_ = true;\n\n auto expect_iter = request_->headers_.find(\"Expect\");\n\n if (expect_iter != request_->headers_.end()) {\n if (expect_iter->second == \"100-continue\") {\n message_completed_ = false;\n std::ostringstream buf;\n buf << \"HTTP\/1.1 100 Continue\\r\\n\";\n write_chunk(buf);\n }\n }\n\n auto content_type_iter = request_->headers_.find(\"Content-Type\");\n if (content_type_iter != request_->headers_.end()) {\n String boundary;\n auto multipart = content_type_iter->second.find(MULTIPART_FORM_DATA);\n if (multipart != String::npos) {\n auto boundary_start = multipart + MULTIPART_FORM_DATA.size();\n boundary = content_type_iter->second.substr(boundary_start);\n }\n\n std::vector occurrences;\n size_t start = 0;\n\n boundary = \"--\" + boundary;\n\n while ((start = request_->body_.find(boundary, start)) != String::npos) {\n occurrences.push_back(start);\n start += boundary.length();\n }\n\n const char* body = &request_->body_.front();\n for (size_t occurence = 1; occurence < occurrences.size(); ++occurence) {\n auto file_content = String{\n body + occurrences[occurence - 1] + boundary.length() + 2, \/\/ Skip boundary + \"\\r\\n\"\n body + occurrences[occurence]\n };\n\n auto headers_finished = file_content.find(\"\\r\\n\\r\\n\");\n auto headers = file_content.substr(0, headers_finished);\n\n std::regex regex(\"Content-Disposition: form-data; name=\\\"(.+)\\\"; filename=\\\"(.+)\\\"\");\n std::smatch match_groups;\n std::regex_search(headers, match_groups, regex);\n\n File file;\n \n if (!match_groups.empty()) {\n file.name_ = match_groups[1].str();\n file.filename_ = match_groups[2].str();\n }\n\n if (file.name_.empty() && file.filename_.empty()) {\n continue;\n }\n \n auto file_body = file_content.substr(headers_finished + 4);\n\n file.body_ = std::move(file_body);\n\n request_->files_.emplace_back(std::move(file));\n }\n }\n\n return 0;\n}\n\nvoid HttpConnection::handle_input(TransferBlock data) {\n http_parser_execute(parser_.get(), &get_http_settings(), data.data, data.size);\n \n if (message_completed_) {\n request_->method_ = http_method_str(static_cast(parser_.get()->method));\n parent_->call_handler(*request_.get(), this);\n }\n}\n\nvoid HttpConnection::check_header_finished() {\n if (!read_header_.first.empty() && !read_header_.second.empty()) {\n request_->headers_.insert(Header{std::move(read_header_)});\n }\n}\n\nHttpResponse::HttpResponse(HttpConnection* conn)\n: conn_{conn},\n response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n headers_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n body_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n full_response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary} {\n}\n\nHttpResponse::~HttpResponse() {\n close();\n}\n\nHttpResponse& HttpResponse::response(int code) {\n code_ = code;\n response_ << \"HTTP\/1.1 \" << code << \"\\r\\n\";\n return *this;\n}\n\nHttpResponse& HttpResponse::add_headers(std::vector> headers) {\n for (auto&& h : headers) {\n add_header(h.first, h.second);\n }\n return *this;\n}\n\nHttpResponse& HttpResponse::add_header(const String& name, const String& value) {\n if (headers_sent_) {\n throw std::runtime_error(\"Can't add headers to response. Headers already sent\");\n }\n headers_ << name << \": \" << value << \"\\r\\n\";\n return *this;\n}\n\nbool stream2stream(std::stringstream& output, std::stringstream& input) {\n const size_t alloc_block = 32 * 1024;\n char tmp[alloc_block];\n bool written_smth = false;\n while (input) {\n input.read(tmp, sizeof(tmp));\n size_t size = input.gcount();\n output.write(tmp, size);\n if (size) {\n written_smth = true;\n }\n }\n return written_smth;\n}\n\nvoid stream2conn(Connection* conn, std::stringstream& buf) {\n while (buf) {\n size_t alloc_block = 32 * 1024;\n char* data = new char[alloc_block];\n buf.read(data, alloc_block);\n const size_t size = buf.gcount();\n TransferBlock block = {data, size};\n conn->write_chunk(block);\n }\n}\n\nHttpResponse& HttpResponse::body(const String& value) {\n body_ << value;\n return *this;\n}\n\nHttpResponse& HttpResponse::body(std::stringstream& buf) {\n stream2stream(body_, buf);\n return *this;\n}\n\nHttpResponse& HttpResponse::body(const void* data, size_t length) {\n body_.write(static_cast(data), length);\n return *this;\n}\n\nvoid HttpResponse::flush() {\n if (!headers_sent_) {\n if (!stream2stream(full_response_, response_)) {\n full_response_ << \"HTTP\/1.1 200\\r\\n\";\n }\n\n body_.seekp(0, std::ios::end);\n auto body_size = body_.tellp();\n\n std::ostringstream body_size_stream;\n body_size_stream << body_size;\n add_header(\"Content-length\", body_size_stream.str());\n\n stream2stream(full_response_, headers_);\n headers_sent_ = true;\n\n full_response_ << \"\\r\\n\";\n }\n\n stream2stream(full_response_, body_);\n stream2conn(conn_, full_response_);\n}\n\nvoid HttpResponse::close() {\n flush();\n conn_->close();\n}\n\nHttpRoute::HttpRoute(const char* path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(const char* path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nstd::smatch HttpRoute::match(const String& url) const {\n std::smatch match_groups;\n std::regex_search(url, match_groups, path_match_);\n return match_groups;\n}\n\nvoid HttpRoute::call_handler(const HttpRequest& req, HttpResponse& out) {\n handler_(req, out);\n}\n\nHttpServer::HttpServer(ServerOptions&& options)\n: Server{std::move(options)} {\n create_connection([this]() {\n return std::make_shared(this, counter_++); });\n}\n\nvoid HttpServer::routes(std::vector&& routes) {\n routes_ = std::move(routes);\n}\n\nvoid HttpServer::add_route(HttpRoute&& route) {\n routes_.emplace_back(route);\n}\n\nvoid HttpServer::call_handler(HttpRequest& request, HttpConnection* bind) {\n bool matched = false;\n HttpResponse out{bind};\n\n for (auto&& route : routes_) {\n auto matches = route.match(request.url());\n if (!matches.empty()) {\n request.set_match(matches);\n route.call_handler(request, out);\n matched = true;\n }\n }\n\n if (!matched) {\n out.response(404);\n }\n\n std::cout << request.method() << \" \" << request.url() << \" \" << out.code() << std::endl;\n}\n\nString match1_filename(const HttpRequest& req) {\n return req.match()[1].str();\n}\n\nHttpRoute::Handler serve_static(std::function request2file, const Config& config) {\n return HttpRoute::Handler{\n [&] (const HttpRequest& req, HttpResponse& out)\n {\n static_file(request2file(req), out, config);\n }};\n}\n\nHttpRoute::Handler serve_static(const String& root_dir, std::function request2file) {\n return HttpRoute::Handler{\n [&] (const HttpRequest& req, HttpResponse& out)\n {\n const auto request_file = request2file(req);\n response_file(path_join(root_dir, request_file), out);\n }};\n}\n\nvoid static_file(const String& filename, HttpResponse& out, const Config& config) {\n response_file(path_join(config[\"STATIC_ROOT_DIR\"].str(), filename), out);\n}\n\nvoid response_file(const String& filename, HttpResponse& out) {\n uv_fs_t open_req;\n\n#ifdef _WIN32\n int open_mode = _S_IREAD;\n#else\n int open_mode = S_IRUSR;\n#endif\n \n uv_fs_open(nullptr, &open_req, filename.c_str(), O_RDONLY, open_mode, nullptr);\n auto open_req_exit = Defer{[&open_req] { uv_fs_req_cleanup(&open_req); }};\n const auto fd = static_cast(open_req.result);\n\n if (fd < 0) {\n out.response(404);\n return;\n }\n\n uv_fs_t read_req;\n const size_t alloc_block = 64 * 1024;\n size_t offset = 0;\n char mem[alloc_block];\n while (true) {\n uv_buf_t buf[] = {uv_buf_init(mem, sizeof(mem))};\n int read = uv_fs_read(nullptr, &read_req, fd, buf, 1, offset, nullptr);\n auto read_req_exit = Defer{[&read_req] { uv_fs_req_cleanup(&read_req); }};\n out.body(buf[0].base, read);\n offset += read;\n if (static_cast(read) < buf[0].len) {\n break;\n }\n }\n\n uv_fs_t close_req;\n uv_fs_close(nullptr, &close_req, fd, nullptr);\n auto close_req_exit = Defer{[&close_req] { uv_fs_req_cleanup(&close_req); }};\n}\n\nvoid temporary_redirect(const String& redirect_to, HttpResponse& out) {\n out.response(307);\n out.add_header(\"Location\", redirect_to);\n out.close();\n}\n\n} \/\/ namespace enjiOk, try this captures#include \"http.h\"\n#include \n#include \n\n#ifdef _WIN32\n# include \n#endif\n\nnamespace enji {\n\nint cb_http_message_begin(http_parser* parser) {\n return 0;\n}\n\nint cb_http_url(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_url(at, len);\n}\n\nint cb_http_status(http_parser* parser, const char* at, size_t len) {\n std::cerr << \"Got unhandled status: \" << String(at, len) << std::endl;\n return 0;\n}\n\nint cb_http_header_field(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_header_field(at, len);\n}\n\nint cb_http_header_value(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_header_value(at, len);\n}\n\nint cb_http_headers_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_headers_complete();\n}\n\nint cb_http_body(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_http_body(at, len);\n}\n\nint cb_http_message_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast(parser->data);\n return handler.on_message_complete();\n}\n\nhttp_parser_settings& get_http_settings() {\n static http_parser_settings http_settings = {};\n http_settings.on_message_begin = cb_http_message_begin;\n http_settings.on_url = cb_http_url;\n http_settings.on_status = cb_http_status;\n http_settings.on_header_field = cb_http_header_field;\n http_settings.on_header_value = cb_http_header_value;\n http_settings.on_headers_complete = cb_http_headers_complete;\n http_settings.on_body = cb_http_body;\n http_settings.on_message_complete = cb_http_message_complete;\n return http_settings;\n}\n\nHttpConnection::HttpConnection(HttpServer* parent, size_t id)\n: Connection(parent, id),\n parent_(parent) {\n parser_.reset(new http_parser{});\n http_parser_init(parser_.get(), HTTP_REQUEST);\n parser_.get()->data = this;\n\n request_.reset(new HttpRequest{});\n}\n\nconst HttpRequest& HttpConnection::request() const {\n return *request_.get();\n}\n\nint HttpConnection::on_http_url(const char* at, size_t len) {\n request_->url_ += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_field(const char* at, size_t len) {\n check_header_finished();\n read_header_.first += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_value(const char* at, size_t len) {\n read_header_.second += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_headers_complete() {\n check_header_finished();\n return 0;\n}\n\nint HttpConnection::on_http_body(const char* at, size_t len) {\n request_->body_ += String{at, len};\n return 0;\n}\n\nconst String MULTIPART_FORM_DATA = \"multipart\/form-data; boundary=\";\n\nint HttpConnection::on_message_complete() {\n message_completed_ = true;\n\n auto expect_iter = request_->headers_.find(\"Expect\");\n\n if (expect_iter != request_->headers_.end()) {\n if (expect_iter->second == \"100-continue\") {\n message_completed_ = false;\n std::ostringstream buf;\n buf << \"HTTP\/1.1 100 Continue\\r\\n\";\n write_chunk(buf);\n }\n }\n\n auto content_type_iter = request_->headers_.find(\"Content-Type\");\n if (content_type_iter != request_->headers_.end()) {\n String boundary;\n auto multipart = content_type_iter->second.find(MULTIPART_FORM_DATA);\n if (multipart != String::npos) {\n auto boundary_start = multipart + MULTIPART_FORM_DATA.size();\n boundary = content_type_iter->second.substr(boundary_start);\n }\n\n std::vector occurrences;\n size_t start = 0;\n\n boundary = \"--\" + boundary;\n\n while ((start = request_->body_.find(boundary, start)) != String::npos) {\n occurrences.push_back(start);\n start += boundary.length();\n }\n\n const char* body = &request_->body_.front();\n for (size_t occurence = 1; occurence < occurrences.size(); ++occurence) {\n auto file_content = String{\n body + occurrences[occurence - 1] + boundary.length() + 2, \/\/ Skip boundary + \"\\r\\n\"\n body + occurrences[occurence]\n };\n\n auto headers_finished = file_content.find(\"\\r\\n\\r\\n\");\n auto headers = file_content.substr(0, headers_finished);\n\n std::regex regex(\"Content-Disposition: form-data; name=\\\"(.+)\\\"; filename=\\\"(.+)\\\"\");\n std::smatch match_groups;\n std::regex_search(headers, match_groups, regex);\n\n File file;\n \n if (!match_groups.empty()) {\n file.name_ = match_groups[1].str();\n file.filename_ = match_groups[2].str();\n }\n\n if (file.name_.empty() && file.filename_.empty()) {\n continue;\n }\n \n auto file_body = file_content.substr(headers_finished + 4);\n\n file.body_ = std::move(file_body);\n\n request_->files_.emplace_back(std::move(file));\n }\n }\n\n return 0;\n}\n\nvoid HttpConnection::handle_input(TransferBlock data) {\n http_parser_execute(parser_.get(), &get_http_settings(), data.data, data.size);\n \n if (message_completed_) {\n request_->method_ = http_method_str(static_cast(parser_.get()->method));\n parent_->call_handler(*request_.get(), this);\n }\n}\n\nvoid HttpConnection::check_header_finished() {\n if (!read_header_.first.empty() && !read_header_.second.empty()) {\n request_->headers_.insert(Header{std::move(read_header_)});\n }\n}\n\nHttpResponse::HttpResponse(HttpConnection* conn)\n: conn_{conn},\n response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n headers_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n body_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n full_response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary} {\n}\n\nHttpResponse::~HttpResponse() {\n close();\n}\n\nHttpResponse& HttpResponse::response(int code) {\n code_ = code;\n response_ << \"HTTP\/1.1 \" << code << \"\\r\\n\";\n return *this;\n}\n\nHttpResponse& HttpResponse::add_headers(std::vector> headers) {\n for (auto&& h : headers) {\n add_header(h.first, h.second);\n }\n return *this;\n}\n\nHttpResponse& HttpResponse::add_header(const String& name, const String& value) {\n if (headers_sent_) {\n throw std::runtime_error(\"Can't add headers to response. Headers already sent\");\n }\n headers_ << name << \": \" << value << \"\\r\\n\";\n return *this;\n}\n\nbool stream2stream(std::stringstream& output, std::stringstream& input) {\n const size_t alloc_block = 32 * 1024;\n char tmp[alloc_block];\n bool written_smth = false;\n while (input) {\n input.read(tmp, sizeof(tmp));\n size_t size = input.gcount();\n output.write(tmp, size);\n if (size) {\n written_smth = true;\n }\n }\n return written_smth;\n}\n\nvoid stream2conn(Connection* conn, std::stringstream& buf) {\n while (buf) {\n size_t alloc_block = 32 * 1024;\n char* data = new char[alloc_block];\n buf.read(data, alloc_block);\n const size_t size = buf.gcount();\n TransferBlock block = {data, size};\n conn->write_chunk(block);\n }\n}\n\nHttpResponse& HttpResponse::body(const String& value) {\n body_ << value;\n return *this;\n}\n\nHttpResponse& HttpResponse::body(std::stringstream& buf) {\n stream2stream(body_, buf);\n return *this;\n}\n\nHttpResponse& HttpResponse::body(const void* data, size_t length) {\n body_.write(static_cast(data), length);\n return *this;\n}\n\nvoid HttpResponse::flush() {\n if (!headers_sent_) {\n if (!stream2stream(full_response_, response_)) {\n full_response_ << \"HTTP\/1.1 200\\r\\n\";\n }\n\n body_.seekp(0, std::ios::end);\n auto body_size = body_.tellp();\n\n std::ostringstream body_size_stream;\n body_size_stream << body_size;\n add_header(\"Content-length\", body_size_stream.str());\n\n stream2stream(full_response_, headers_);\n headers_sent_ = true;\n\n full_response_ << \"\\r\\n\";\n }\n\n stream2stream(full_response_, body_);\n stream2conn(conn_, full_response_);\n}\n\nvoid HttpResponse::close() {\n flush();\n conn_->close();\n}\n\nHttpRoute::HttpRoute(const char* path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(const char* path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nstd::smatch HttpRoute::match(const String& url) const {\n std::smatch match_groups;\n std::regex_search(url, match_groups, path_match_);\n return match_groups;\n}\n\nvoid HttpRoute::call_handler(const HttpRequest& req, HttpResponse& out) {\n handler_(req, out);\n}\n\nHttpServer::HttpServer(ServerOptions&& options)\n: Server{std::move(options)} {\n create_connection([this]() {\n return std::make_shared(this, counter_++); });\n}\n\nvoid HttpServer::routes(std::vector&& routes) {\n routes_ = std::move(routes);\n}\n\nvoid HttpServer::add_route(HttpRoute&& route) {\n routes_.emplace_back(route);\n}\n\nvoid HttpServer::call_handler(HttpRequest& request, HttpConnection* bind) {\n bool matched = false;\n HttpResponse out{bind};\n\n for (auto&& route : routes_) {\n auto matches = route.match(request.url());\n if (!matches.empty()) {\n request.set_match(matches);\n route.call_handler(request, out);\n matched = true;\n }\n }\n\n if (!matched) {\n out.response(404);\n }\n\n std::cout << request.method() << \" \" << request.url() << \" \" << out.code() << std::endl;\n}\n\nString match1_filename(const HttpRequest& req) {\n return req.match()[1].str();\n}\n\nHttpRoute::Handler serve_static(std::function request2file, const Config& config) {\n return HttpRoute::Handler{\n [request2file_bind{request2file}, config_bind{config}]\n (const HttpRequest& req, HttpResponse& out) \n {\n static_file(request2file_bind(req), out, config_bind);\n }};\n}\n\nHttpRoute::Handler serve_static(const String& root_dir, std::function request2file) {\n return HttpRoute::Handler{\n [root_dir_bind{root_dir}, request2file_bind{request2file}]\n (const HttpRequest& req, HttpResponse& out) \n {\n const auto request_file = request2file_bind(req);\n response_file(path_join(root_dir_bind, request_file), out);\n }};\n}\n\nvoid static_file(const String& filename, HttpResponse& out, const Config& config) {\n response_file(path_join(config[\"STATIC_ROOT_DIR\"].str(), filename), out);\n}\n\nvoid response_file(const String& filename, HttpResponse& out) {\n uv_fs_t open_req;\n\n#ifdef _WIN32\n int open_mode = _S_IREAD;\n#else\n int open_mode = S_IRUSR;\n#endif\n \n uv_fs_open(nullptr, &open_req, filename.c_str(), O_RDONLY, open_mode, nullptr);\n auto open_req_exit = Defer{[&open_req] { uv_fs_req_cleanup(&open_req); }};\n const auto fd = static_cast(open_req.result);\n\n if (fd < 0) {\n out.response(404);\n return;\n }\n\n uv_fs_t read_req;\n const size_t alloc_block = 64 * 1024;\n size_t offset = 0;\n char mem[alloc_block];\n while (true) {\n uv_buf_t buf[] = {uv_buf_init(mem, sizeof(mem))};\n int read = uv_fs_read(nullptr, &read_req, fd, buf, 1, offset, nullptr);\n auto read_req_exit = Defer{[&read_req] { uv_fs_req_cleanup(&read_req); }};\n out.body(buf[0].base, read);\n offset += read;\n if (static_cast(read) < buf[0].len) {\n break;\n }\n }\n\n uv_fs_t close_req;\n uv_fs_close(nullptr, &close_req, fd, nullptr);\n auto close_req_exit = Defer{[&close_req] { uv_fs_req_cleanup(&close_req); }};\n}\n\nvoid temporary_redirect(const String& redirect_to, HttpResponse& out) {\n out.response(307);\n out.add_header(\"Location\", redirect_to);\n out.close();\n}\n\n} \/\/ namespace enji<|endoftext|>"} {"text":"#ifndef FILEUTILS_HPP\n#define FILEUTILS_HPP\n#include\n#include\n#include\n#include\n#include\n\nnamespace fileutils{\n\t\/*Directoryのコピーを行う*\/\n bool cp_R(const QString from,const QString to){\n\t\tif(!QFileInfo(from).isDir())return false;\n\t\tif(to.isEmpty()) return false;\n\t\tif(!QDir().mkdir(to)) return false;\n\n\t\tQDir dir(from);\n\t\tQSringList list = dir.entryList();\n\t\tQStringListIterator i(list);\n\t\tQString b,bf;\n\t\twhile(i.hasNext()){\n\t\t\tb = i.next();\n\t\t\tbf = from + \"\/\" + b;\n\t\t\t\/\/std::cout<<\"==\"<修正途中に間違えて消した部分を修復#ifndef FILEUTILS_HPP\n#define FILEUTILS_HPP\n#include\n#include\n#include\n#include\n#include\n\nnamespace fileutils{\n\t\/*Directoryのコピーを行う*\/\n bool cp_R(const QString from,const QString to){\n\t\tif(!QFileInfo(from).isDir())return false;\n\t\tif(to.isEmpty()) return false;\n\t\tif(!QDir().mkdir(to)) return false;\n\n\t\tQDir dir(from);\n\t\tQStringList list = dir.entryList();\n\t\tQStringListIterator i(list);\n\t\tQString b,bf;\n\t\twhile(i.hasNext()){\n\t\t\tb = i.next();\n\t\t\tbf = from + \"\/\" + b;\n\t\t\t\/\/std::cout<<\"==\"<"} {"text":"\/\/ Copyright 2016 Google Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"precompiled.h\"\n\n#include \n#include \n\n#include \n\n#include \"font_manager.h\"\n#include \"font_util.h\"\n#include \"fplbase\/fpl_common.h\"\n\nnamespace flatui {\n\nusing mathfu::vec3;\nusing mathfu::vec3_packed;\n\n\/\/ Replace whitespace with a single space.\n\/\/ This emulates how HTML processes raw text fields.\n\/\/ Appends trimmed text to `out`.\n\/\/ Returns reference to `out`.\nstd::string &TrimHtmlWhitespace(const char *text, bool trim_leading_whitespace,\n std::string *out) {\n const char *t = text;\n\n if (trim_leading_whitespace) {\n while (std::isspace(*t)) ++t;\n }\n\n for (;;) {\n \/\/ Output non-whitespace.\n while (!std::isspace(*t) && *t != '\\0') out->push_back(*t++);\n\n \/\/ Break out if at end of input. Note that we do *not* trim all\n \/\/ trailing whitespace.\n if (*t == '\\0') break;\n\n \/\/ Skip whitespace.\n while (std::isspace(*t)) ++t;\n\n \/\/ Insert single space to compensate for trimmed whitespace.\n out->push_back(' ');\n }\n return *out;\n}\n\n\/\/ Remove trailing whitespace. Then add a `prefix` if there is any preceeding\n\/\/ text.\nstatic std::string &StartHtmlLine(const char *prefix, std::string *out) {\n \/\/ Trim trailing whitespace.\n while (std::isspace(out->back())) out->pop_back();\n\n \/\/ Append the new lines in `prefix`.\n if (!out->empty()) {\n out->append(prefix);\n }\n return *out;\n}\n\n\/\/ The very first text output we want to trim the leading whitespace.\n\/\/ We should also trim if the previous text ends in whitespace.\nstatic bool ShouldTrimLeadingWhitespace(const std::vector &s) {\n if (s.size() <= 1) return true;\n\n const std::string &prev_text =\n s.back().text.empty() ? s[s.size() - 2].text : s.back().text;\n return std::isspace(prev_text.back());\n}\n\nstatic void GumboTreeToHtmlSections(const GumboNode *node,\n std::vector *s) {\n switch (node->type) {\n \/\/ Process non-text elements, possibly recursing into child nodes.\n case GUMBO_NODE_ELEMENT: {\n const GumboElement &element = node->v.element;\n\n \/\/ Tree prefix processing.\n switch (element.tag) {\n case GUMBO_TAG_A:\n \/\/ Start a new section for the anchor.\n if (!s->back().text.empty()) {\n s->push_back(HtmlSection());\n }\n break;\n\n case GUMBO_TAG_P:\n case GUMBO_TAG_H1: \/\/ fallthrough\n case GUMBO_TAG_H2: \/\/ fallthrough\n case GUMBO_TAG_H3: \/\/ fallthrough\n case GUMBO_TAG_H4: \/\/ fallthrough\n case GUMBO_TAG_H5: \/\/ fallthrough\n case GUMBO_TAG_H6: \/\/ fallthrough\n StartHtmlLine(\"\\n\\n\", &s->back().text);\n break;\n\n default:\n break;\n }\n const size_t node_section = s->size() - 1;\n\n \/\/ Tree children processing via recursion.\n for (unsigned int i = 0; i < element.children.length; ++i) {\n const GumboNode *child =\n static_cast(element.children.data[i]);\n GumboTreeToHtmlSections(child, s);\n }\n\n \/\/ Tree postfix processing.\n switch (element.tag) {\n case GUMBO_TAG_A: {\n \/\/ Record the link address.\n GumboAttribute *href =\n gumbo_get_attribute(&element.attributes, \"href\");\n if (href != nullptr) {\n (*s)[node_section].link = href->value;\n }\n\n \/\/ Start a new section for the non-anchor.\n s->push_back(HtmlSection());\n break;\n }\n\n case GUMBO_TAG_HR:\n case GUMBO_TAG_P: \/\/ fallthrough\n s->back().text.append(\"\\n\\n\");\n break;\n\n case GUMBO_TAG_H1: \/\/ fallthrough\n case GUMBO_TAG_H2: \/\/ fallthrough\n case GUMBO_TAG_H3: \/\/ fallthrough\n case GUMBO_TAG_H4: \/\/ fallthrough\n case GUMBO_TAG_H5: \/\/ fallthrough\n case GUMBO_TAG_H6: \/\/ fallthrough\n case GUMBO_TAG_BR:\n s->back().text.append(\"\\n\");\n break;\n\n default:\n break;\n }\n break;\n }\n\n \/\/ Append text without excessive whitespaces.\n case GUMBO_NODE_TEXT:\n TrimHtmlWhitespace(node->v.text.text, ShouldTrimLeadingWhitespace(*s),\n &s->back().text);\n break;\n\n \/\/ Ignore other node types.\n default:\n break;\n }\n}\n\nstd::vector ParseHtml(const char *html) {\n \/\/ Ensure there is an HtmlSection that can be appended to.\n std::vector s(1);\n\n \/\/ Parse html into tree, with Gumbo, then process the tree.\n GumboOutput *gumbo = gumbo_parse(html);\n GumboTreeToHtmlSections(gumbo->root, &s);\n gumbo_destroy_output(&kGumboDefaultOptions, gumbo);\n\n \/\/ Prune empty last section.\n if (s.back().text.empty()) {\n s.pop_back();\n }\n return s;\n}\n\nstatic size_t NumUnderlineVertices(const FontBuffer &buffer) {\n const int32_t kUnderlineVerticesPerGlyph = 2;\n const int32_t kExtraUnderlineVerticesPerInfo = 2;\n size_t num_verts = 0;\n \/\/ The first strip doesn't need a triangle to stich.\n num_verts -= kExtraUnderlineVerticesPerInfo;\n auto &slices = buffer.get_slices();\n for (size_t i = 0; i < slices.size(); ++i) {\n auto regions = slices.at(i).get_underline_info();\n for (size_t i = 0; i < regions.size(); ++i) {\n auto info = regions[i];\n num_verts += (info.end_vertex_index_ - info.start_vertex_index_ + 2) *\n kUnderlineVerticesPerGlyph;\n num_verts += kExtraUnderlineVerticesPerInfo;\n }\n }\n return num_verts;\n}\n\nstd::vector GenerateUnderlineVertices(const FontBuffer &buffer,\n const mathfu::vec2 &pos) {\n std::vector vec(NumUnderlineVertices(buffer));\n auto &slices = buffer.get_slices();\n auto &vertices = buffer.get_vertices();\n bool degenerated_triangle = false;\n vec.clear();\n for (size_t i = 0; i < slices.size(); ++i) {\n if (slices.at(i).get_underline()) {\n \/\/ Generate underline strips.\n const int32_t kVerticesPerGlyph = 4;\n auto regions = slices.at(i).get_underline_info();\n for (size_t i = 0; i < regions.size(); ++i) {\n auto info = regions[i];\n auto y_start = info.y_pos_.x() + pos.y();\n auto y_end = y_start + info.y_pos_.y();\n\n if (degenerated_triangle) {\n \/\/ Add degenerated triangle to connect multiple strips.\n auto start_pos = vec3(vertices.at(info.start_vertex_index_ *\n kVerticesPerGlyph).position_);\n vec.push_back(vec.back());\n vec.push_back(\n vec3_packed(vec3(start_pos.x() + pos.x(), y_start, 0.f)));\n }\n\n \/\/ Add vertices.\n for (auto idx = info.start_vertex_index_; idx <= info.end_vertex_index_;\n ++idx) {\n auto strip_pos = vec3(vertices.at(idx * kVerticesPerGlyph).position_);\n vec.push_back(\n vec3_packed(vec3(strip_pos.x() + pos.x(), y_start, 0.f)));\n vec.push_back(vec3_packed(vec3(strip_pos.x() + pos.x(), y_end, 0.f)));\n }\n\n \/\/ Add last 2 vertices.\n auto end_pos =\n vec3(vertices.at(info.end_vertex_index_ * kVerticesPerGlyph +\n kVerticesPerGlyph - 1).position_);\n vec.push_back(vec3_packed(vec3(end_pos.x() + pos.x(), y_start, 0.f)));\n vec.push_back(vec3_packed(vec3(end_pos.x() + pos.x(), y_end, 0.f)));\n\n degenerated_triangle = true;\n }\n }\n }\n assert(NumUnderlineVertices(buffer) == vec.size());\n return vec;\n}\n\n} \/\/ namespace flatui\nFix SIGABRT in GenerateUnderlineVertices when the buffer has no underline.\/\/ Copyright 2016 Google Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"precompiled.h\"\n\n#include \n#include \n\n#include \n\n#include \"font_manager.h\"\n#include \"font_util.h\"\n#include \"fplbase\/fpl_common.h\"\n\nnamespace flatui {\n\nusing mathfu::vec3;\nusing mathfu::vec3_packed;\n\n\/\/ Replace whitespace with a single space.\n\/\/ This emulates how HTML processes raw text fields.\n\/\/ Appends trimmed text to `out`.\n\/\/ Returns reference to `out`.\nstd::string &TrimHtmlWhitespace(const char *text, bool trim_leading_whitespace,\n std::string *out) {\n const char *t = text;\n\n if (trim_leading_whitespace) {\n while (std::isspace(*t)) ++t;\n }\n\n for (;;) {\n \/\/ Output non-whitespace.\n while (!std::isspace(*t) && *t != '\\0') out->push_back(*t++);\n\n \/\/ Break out if at end of input. Note that we do *not* trim all\n \/\/ trailing whitespace.\n if (*t == '\\0') break;\n\n \/\/ Skip whitespace.\n while (std::isspace(*t)) ++t;\n\n \/\/ Insert single space to compensate for trimmed whitespace.\n out->push_back(' ');\n }\n return *out;\n}\n\n\/\/ Remove trailing whitespace. Then add a `prefix` if there is any preceeding\n\/\/ text.\nstatic std::string &StartHtmlLine(const char *prefix, std::string *out) {\n \/\/ Trim trailing whitespace.\n while (std::isspace(out->back())) out->pop_back();\n\n \/\/ Append the new lines in `prefix`.\n if (!out->empty()) {\n out->append(prefix);\n }\n return *out;\n}\n\n\/\/ The very first text output we want to trim the leading whitespace.\n\/\/ We should also trim if the previous text ends in whitespace.\nstatic bool ShouldTrimLeadingWhitespace(const std::vector &s) {\n if (s.size() <= 1) return true;\n\n const std::string &prev_text =\n s.back().text.empty() ? s[s.size() - 2].text : s.back().text;\n return std::isspace(prev_text.back());\n}\n\nstatic void GumboTreeToHtmlSections(const GumboNode *node,\n std::vector *s) {\n switch (node->type) {\n \/\/ Process non-text elements, possibly recursing into child nodes.\n case GUMBO_NODE_ELEMENT: {\n const GumboElement &element = node->v.element;\n\n \/\/ Tree prefix processing.\n switch (element.tag) {\n case GUMBO_TAG_A:\n \/\/ Start a new section for the anchor.\n if (!s->back().text.empty()) {\n s->push_back(HtmlSection());\n }\n break;\n\n case GUMBO_TAG_P:\n case GUMBO_TAG_H1: \/\/ fallthrough\n case GUMBO_TAG_H2: \/\/ fallthrough\n case GUMBO_TAG_H3: \/\/ fallthrough\n case GUMBO_TAG_H4: \/\/ fallthrough\n case GUMBO_TAG_H5: \/\/ fallthrough\n case GUMBO_TAG_H6: \/\/ fallthrough\n StartHtmlLine(\"\\n\\n\", &s->back().text);\n break;\n\n default:\n break;\n }\n const size_t node_section = s->size() - 1;\n\n \/\/ Tree children processing via recursion.\n for (unsigned int i = 0; i < element.children.length; ++i) {\n const GumboNode *child =\n static_cast(element.children.data[i]);\n GumboTreeToHtmlSections(child, s);\n }\n\n \/\/ Tree postfix processing.\n switch (element.tag) {\n case GUMBO_TAG_A: {\n \/\/ Record the link address.\n GumboAttribute *href =\n gumbo_get_attribute(&element.attributes, \"href\");\n if (href != nullptr) {\n (*s)[node_section].link = href->value;\n }\n\n \/\/ Start a new section for the non-anchor.\n s->push_back(HtmlSection());\n break;\n }\n\n case GUMBO_TAG_HR:\n case GUMBO_TAG_P: \/\/ fallthrough\n s->back().text.append(\"\\n\\n\");\n break;\n\n case GUMBO_TAG_H1: \/\/ fallthrough\n case GUMBO_TAG_H2: \/\/ fallthrough\n case GUMBO_TAG_H3: \/\/ fallthrough\n case GUMBO_TAG_H4: \/\/ fallthrough\n case GUMBO_TAG_H5: \/\/ fallthrough\n case GUMBO_TAG_H6: \/\/ fallthrough\n case GUMBO_TAG_BR:\n s->back().text.append(\"\\n\");\n break;\n\n default:\n break;\n }\n break;\n }\n\n \/\/ Append text without excessive whitespaces.\n case GUMBO_NODE_TEXT:\n TrimHtmlWhitespace(node->v.text.text, ShouldTrimLeadingWhitespace(*s),\n &s->back().text);\n break;\n\n \/\/ Ignore other node types.\n default:\n break;\n }\n}\n\nstd::vector ParseHtml(const char *html) {\n \/\/ Ensure there is an HtmlSection that can be appended to.\n std::vector s(1);\n\n \/\/ Parse html into tree, with Gumbo, then process the tree.\n GumboOutput *gumbo = gumbo_parse(html);\n GumboTreeToHtmlSections(gumbo->root, &s);\n gumbo_destroy_output(&kGumboDefaultOptions, gumbo);\n\n \/\/ Prune empty last section.\n if (s.back().text.empty()) {\n s.pop_back();\n }\n return s;\n}\n\nstatic size_t NumUnderlineVertices(const FontBuffer &buffer) {\n const int32_t kUnderlineVerticesPerGlyph = 2;\n const int32_t kExtraUnderlineVerticesPerInfo = 2;\n size_t num_verts = 0;\n auto &slices = buffer.get_slices();\n for (size_t i = 0; i < slices.size(); ++i) {\n auto regions = slices.at(i).get_underline_info();\n for (size_t i = 0; i < regions.size(); ++i) {\n auto info = regions[i];\n num_verts += (info.end_vertex_index_ - info.start_vertex_index_ + 2) *\n kUnderlineVerticesPerGlyph;\n num_verts += kExtraUnderlineVerticesPerInfo;\n }\n }\n if (num_verts) {\n \/\/ Subtract the amount of the first strip which doesn't need a triangle to\n \/\/ stitch.\n num_verts -= kExtraUnderlineVerticesPerInfo;\n }\n return num_verts;\n}\n\nstd::vector GenerateUnderlineVertices(const FontBuffer &buffer,\n const mathfu::vec2 &pos) {\n std::vector vec;\n auto num_verts = NumUnderlineVertices(buffer);\n if (!num_verts) {\n return vec;\n }\n vec.reserve(num_verts);\n auto &slices = buffer.get_slices();\n auto &vertices = buffer.get_vertices();\n bool degenerated_triangle = false;\n for (size_t i = 0; i < slices.size(); ++i) {\n if (slices.at(i).get_underline()) {\n \/\/ Generate underline strips.\n const int32_t kVerticesPerGlyph = 4;\n auto regions = slices.at(i).get_underline_info();\n for (size_t i = 0; i < regions.size(); ++i) {\n auto info = regions[i];\n auto y_start = info.y_pos_.x() + pos.y();\n auto y_end = y_start + info.y_pos_.y();\n\n if (degenerated_triangle) {\n \/\/ Add degenerated triangle to connect multiple strips.\n auto start_pos = vec3(vertices.at(info.start_vertex_index_ *\n kVerticesPerGlyph).position_);\n vec.push_back(vec.back());\n vec.push_back(\n vec3_packed(vec3(start_pos.x() + pos.x(), y_start, 0.f)));\n }\n\n \/\/ Add vertices.\n for (auto idx = info.start_vertex_index_; idx <= info.end_vertex_index_;\n ++idx) {\n auto strip_pos = vec3(vertices.at(idx * kVerticesPerGlyph).position_);\n vec.push_back(\n vec3_packed(vec3(strip_pos.x() + pos.x(), y_start, 0.f)));\n vec.push_back(vec3_packed(vec3(strip_pos.x() + pos.x(), y_end, 0.f)));\n }\n\n \/\/ Add last 2 vertices.\n auto end_pos =\n vec3(vertices.at(info.end_vertex_index_ * kVerticesPerGlyph +\n kVerticesPerGlyph - 1).position_);\n vec.push_back(vec3_packed(vec3(end_pos.x() + pos.x(), y_start, 0.f)));\n vec.push_back(vec3_packed(vec3(end_pos.x() + pos.x(), y_end, 0.f)));\n\n degenerated_triangle = true;\n }\n }\n }\n assert(num_verts == vec.size());\n return vec;\n}\n\n} \/\/ namespace flatui\n<|endoftext|>"} {"text":"\/*\n * Game.cpp\n * OpenLieroX\n *\n * Created by Albert Zeyer on 09.12.09.\n * code under LGPL\n *\n *\/\n\n#include \"Game.h\"\n#include \"AuxLib.h\"\n#include \"Debug.h\"\n#include \"LieroX.h\"\n#include \"GfxPrimitives.h\"\n#include \"Entity.h\"\n#include \"EventQueue.h\"\n#include \"InputEvents.h\"\n#include \"DedicatedControl.h\"\n#include \"CrashHandler.h\"\n#include \"Timer.h\"\n#include \"NewNetEngine.h\"\n#include \"OLXCommand.h\"\n#include \"IRC.h\"\n#include \"CClient.h\"\n#include \"CServer.h\"\n#include \"Physics.h\"\n#include \"DeprecatedGUI\/Menu.h\"\n#include \"Cache.h\"\n#include \"gusanos\/gusanos.h\"\n#include \"gusanos\/gusgame.h\"\n#include \"gusanos\/ninjarope.h\"\n#include \"game\/WormInputHandler.h\"\n#include \"CWormHuman.h\"\n#include \"gusanos\/glua.h\"\n#include \"gusanos\/lua51\/luaapi\/context.h\"\n\nGame game;\n\nstatic bool inMainGameLoop = false;\nstatic std::string quitEngineFlagReason;\n\nvoid Game::prepareGameloop() {\n\t\/\/ Pre-game initialization\n\tif(!bDedicated) FillSurface(VideoPostProcessor::videoSurface(), tLX->clBlack);\n\n\twhile(cClient->getStatus() != NET_CONNECTED) {\n\t\tnotes << \"client not connected yet - waiting\" << endl;\n\t\tSDL_Delay(10);\n\t\tSyncServerAndClient();\n\t}\n\t\t\n\tif(cServer->getState() == SVS_LOBBY) {\n\t\tnotes << \"prepareGameloop: starting game\" << endl;\n\t\tstd::string errMsg;\n\t\tif(!cServer->StartGame(&errMsg)) {\n\t\t\terrors << \"starting game in local game failed for reason: \" << errMsg << endl;\n\t\t\tDeprecatedGUI::Menu_MessageBox(\"Error\", \"Error while starting game: \" + errMsg);\n\t\t\tGotoLocalMenu();\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t\twarnings << \"prepareGameloop: server was not in lobby\" << endl;\n\n\t\/\/ we need the gamescript in physics init\n\twhile(gameScript() == NULL) {\n\t\tnotes << \"gamescript not loaded yet - waiting\" << endl;\n\t\tSDL_Delay(10);\n\t\tSyncServerAndClient();\n\t}\n\n\tif(gameScript()->gusEngineUsed() && !gusGame.level().gusIsLoaded()) {\n\t\t\/\/ WARNING: This may be temporary\n\t\t\/\/ Right now, we load the gus mod in the map loader (gusGame.changeLevel).\n\t\t\/\/ Thus, when we don't load a gus level, we must load the mod manually.\n\n#ifdef USE_GRID\n\t\tgame.objects.resize(0, 0, gusGame.level().GetWidth(), gusGame.level().GetHeight());\n#endif\t\t\n\t\t\n\t\tgusGame.refreshResources( gameScript()->directory() );\n\t\tgusGame.loadMod();\n\t\tgusGame.runInitScripts();\n\t}\n\t\n\tPhysicsEngine::Init();\n\t\n\tClearEntities();\n\t\n\tProcessEvents();\n\tnotes << \"MaxFPS is \" << tLXOptions->nMaxFPS << endl;\n\t\n\t\/\/cCache.ClearExtraEntries(); \/\/ Do not clear anything before game started, it may be slow\n\t\n\tnotes << \"GameLoopStart\" << endl;\n\tinMainGameLoop = true;\n\tif( DedicatedControl::Get() )\n\t\tDedicatedControl::Get()->GameLoopStart_Signal();\n\t\n\tCrashHandler::recoverAfterCrash = tLXOptions->bRecoverAfterCrash && GetGameVersion().releasetype == Version::RT_NORMAL;\n\t\n\tResetQuitEngineFlag();\n\toldtime = GetTime();\t\n}\n\nvoid Game::frameOuter() {\n\ttLX->currentTime = GetTime();\n\tSetCrashHandlerReturnPoint(\"main game loop\");\n\t\n\t\/\/ Timing\n\ttLX->fDeltaTime = tLX->currentTime - oldtime;\n\ttLX->fRealDeltaTime = tLX->fDeltaTime;\n\toldtime = tLX->currentTime;\n\t\n\t\/\/ cap the delta\n\tif(tLX->fDeltaTime.seconds() > 0.5f) {\n\t\twarnings << \"deltatime \" << tLX->fDeltaTime.seconds() << \" is too high\" << endl;\n\t\t\/\/ only if not in new net mode because it would screw up the gamestate there\n\t\tif(!NewNet::Active())\n\t\t\ttLX->fDeltaTime = 0.5f; \/\/ don't simulate more than 500ms, it could crash the game\n\t}\n\t\n\tProcessEvents();\n\t\n\t\/\/ Main frame\n\tframeInner();\n\t\n\tdoVideoFrameInMainThread();\n\tCapFPS();\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Game loop\nvoid Game::frameInner()\n{\n\tHandlePendingCommands();\n\t\n\tif(bDedicated)\n\t\tDedicatedControl::Get()->GameLoop_Frame();\n\t\n if(tLX->bQuitEngine)\n return;\n\t\n\t\/\/ Check if user pressed screenshot key\n\tif (tLX->cTakeScreenshot.isDownOnce()) {\n\t\tPushScreenshot(\"scrshots\", \"\");\n\t}\n\t\n\t\/\/ Switch between window and fullscreen mode\n\t\/\/ Switch only if delta time is low enough. This is because when the game does not\n\t\/\/ respond for >30secs and the user presses cSwitchMode in the meantime, the mainlock-detector\n\t\/\/ would switch to window and here we would switch again to fullscreen which is stupid.\n\tif( tLX->cSwitchMode.isUp() && tLX && tLX->fRealDeltaTime < 1.0f ) {\n\t\t\/\/ Set to fullscreen\n\t\ttLXOptions->bFullscreen = !tLXOptions->bFullscreen;\n\t\t\n\t\t\/\/ Set the new video mode\n\t\tdoSetVideoModeInMainThread();\n\t\t\n\t\ttLX->cSwitchMode.reset();\n\t}\n\t\n#ifdef WITH_G15\n\tif (OLXG15)\n\t\tOLXG15->gameFrame();\n#endif \/\/WITH_G15\n\t\n\tif(tLXOptions->bEnableChat)\n\t\tProcessIRC();\n\t\n\tgusLogicFrame();\n\t\n\t\/\/ Local\n\tswitch (tLX->iGameType) {\n\t\tcase GME_LOCAL:\n\t\t\tcClient->Frame();\n\t\t\tcServer->Frame();\n\t\t\t\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t\t\t\n\t\t\t\/\/ Hosting\n\t\tcase GME_HOST:\n\t\t\tcClient->Frame();\n\t\t\tcServer->Frame();\n\t\t\t\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t\t\t\/\/ Joined\n\t\tcase GME_JOIN:\n\t\t\tcClient->Frame();\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t} \/\/ SWITCH\n\t\n\tcClient->resetDebugStr();\n\t\n\tEnableSystemMouseCursor(false);\n}\n\n\nvoid Game::cleanupAfterGameloopEnd() {\n\tCrashHandler::recoverAfterCrash = false;\n\t\n\tgusGame.reset(GusGame::ServerQuit);\n\t\n\tPhysicsEngine::UnInit();\n\t\n\tnotes << \"GameLoopEnd: \" << quitEngineFlagReason << endl;\n\tinMainGameLoop = false;\n\tif( DedicatedControl::Get() )\n\t\tDedicatedControl::Get()->GameLoopEnd_Signal();\t\t\n\t\n\tcCache.ClearExtraEntries(); \/\/ Game ended - clear cache\t\n}\n\n\n\n\nvoid ResetQuitEngineFlag() {\n\ttLX->bQuitEngine = false;\n}\n\nvoid SetQuitEngineFlag(const std::string& reason) {\n\tWarning_QuitEngineFlagSet(\"SetQuitEngineFlag(\" + reason + \"): \");\n\tquitEngineFlagReason = reason;\n\ttLX->bQuitEngine = true;\n\t\/\/ If we call this from within the menu, the menu should shutdown.\n\t\/\/ It will be restarted then in the next frame.\n\t\/\/ If we are not in the menu (i.e. in maingameloop), this has no\n\t\/\/ effect as we set it to true in Menu_Start().\n\tif(DeprecatedGUI::tMenu)\n\t\tDeprecatedGUI::tMenu->bMenuRunning = false;\n\t\/\/ If we were in menu, because we forced the menu restart above,\n\t\/\/ we must set this, otherwise OLX would quit (because of current maingamelogic).\n\tif(DeprecatedGUI::bGame)\n\t\t*DeprecatedGUI::bGame = true;\n}\n\nbool Warning_QuitEngineFlagSet(const std::string& preText) {\n\tif(tLX->bQuitEngine) {\n\t\thints << preText << endl;\n\t\twarnings << \"bQuitEngine is set because: \" << quitEngineFlagReason << endl;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\nvoid Game::onNewWorm(CWorm* w) {\n\tif(!game.gameScript()->gusEngineUsed()) return;\n\n#ifdef USE_GRID\n\tobjects.insertImmediately(w, Grid::WormColLayer, Grid::WormRenderLayer);\n\tif(w->getNinjaRopeObj()) objects.insertImmediately(w->getNinjaRopeObj(), 1, 1);\n#else\n\tobjects.insert(WORMS_COLLISION_LAYER,WORMS_RENDER_LAYER, w);\n\tif(w->getNinjaRopeObj()) objects.insert( 1,1, (CGameObject*)w->getNinjaRopeObj() );\n#endif\t\n}\n\nvoid Game::onRemoveWorm(CWorm* w) {\n\/*#ifdef USE_GRID\n\tobjects.(w, Grid::WormColLayer, Grid::WormRenderLayer);\n\tif(w->getNinjaRopeObj()) objects.insertImmediately(w->getNinjaRopeObj(), 1, 1);\n#else\n\tobjects.insert(WORMS_COLLISION_LAYER,WORMS_RENDER_LAYER, w);\n\tif(w->getNinjaRopeObj()) objects.insert( 1,1, (CGameObject*)w->getNinjaRopeObj() );\n#endif\t*\/\n}\n\nvoid Game::onNewPlayer(CWormInputHandler* player) {\n\tplayers.push_back( player );\t\n}\n\nvoid Game::onNewPlayer_Lua(CWormInputHandler* p) {\n\tif(game.gameScript()->gusEngineUsed()) {\n\t\tEACH_CALLBACK(i, playerInit)\n\t\t{\n\t\t\t(lua.call(*i), p->getLuaReference())();\n\t\t}\t\n\t}\n}\n\nvoid Game::onNewHumanPlayer(CWormHumanInputHandler* player) {\n\tlocalPlayers.push_back( player );\t\n\tplayer->local = true;\n}\n\nvoid Game::onNewHumanPlayer_Lua(CWormHumanInputHandler* player) {\n\tif(game.gameScript()->gusEngineUsed()) {\n\t\tEACH_CALLBACK(i, localplayerInit)\n\t\t{\n\t\t\t(lua.call(*i), player->getLuaReference())();\n\t\t}\n\t}\n}\n\n\nvoid Game::reset() {\n\t\/\/ Delete all players\n\tfor ( std::list::iterator iter = game.players.begin(); iter != game.players.end(); ++iter)\n\t{\n\t\t\/\/ handled by CClient for now\n\t\t\/\/(*iter)->deleteThis();\n\t}\n\tgame.players.clear();\n\tgame.localPlayers.clear();\n\t\n\t\/\/ Delete all objects\n#ifdef USE_GRID\n\tgame.objects.clear();\n#else\n\tfor ( ObjectsList::Iterator iter = game.objects.begin(); (bool)iter; ++iter)\n\t{\n\t\t(*iter)->deleteThis();\n\t}\n\tobjects.clear();\n#endif\t\n}\n\n\nCGameScript* Game::gameScript() {\n\tif(tLX) {\n\t\tif(tLX->iGameType == GME_JOIN) return cClient->getGameScript().get();\n\t\treturn cServer->getGameScript().get();\n\t}\n\treturn NULL;\n}\nsmall security check (for now)\/*\n * Game.cpp\n * OpenLieroX\n *\n * Created by Albert Zeyer on 09.12.09.\n * code under LGPL\n *\n *\/\n\n#include \"Game.h\"\n#include \"AuxLib.h\"\n#include \"Debug.h\"\n#include \"LieroX.h\"\n#include \"GfxPrimitives.h\"\n#include \"Entity.h\"\n#include \"EventQueue.h\"\n#include \"InputEvents.h\"\n#include \"DedicatedControl.h\"\n#include \"CrashHandler.h\"\n#include \"Timer.h\"\n#include \"NewNetEngine.h\"\n#include \"OLXCommand.h\"\n#include \"IRC.h\"\n#include \"CClient.h\"\n#include \"CServer.h\"\n#include \"Physics.h\"\n#include \"DeprecatedGUI\/Menu.h\"\n#include \"Cache.h\"\n#include \"gusanos\/gusanos.h\"\n#include \"gusanos\/gusgame.h\"\n#include \"gusanos\/ninjarope.h\"\n#include \"game\/WormInputHandler.h\"\n#include \"CWormHuman.h\"\n#include \"gusanos\/glua.h\"\n#include \"gusanos\/lua51\/luaapi\/context.h\"\n\nGame game;\n\nstatic bool inMainGameLoop = false;\nstatic std::string quitEngineFlagReason;\n\nvoid Game::prepareGameloop() {\n\t\/\/ Pre-game initialization\n\tif(!bDedicated) FillSurface(VideoPostProcessor::videoSurface(), tLX->clBlack);\n\n\twhile(cClient->getStatus() != NET_CONNECTED) {\n\t\tnotes << \"client not connected yet - waiting\" << endl;\n\t\tSDL_Delay(10);\n\t\tSyncServerAndClient();\n\t}\n\t\t\n\tif(cServer->getState() == SVS_LOBBY) {\n\t\tnotes << \"prepareGameloop: starting game\" << endl;\n\t\tstd::string errMsg;\n\t\tif(!cServer->StartGame(&errMsg)) {\n\t\t\terrors << \"starting game in local game failed for reason: \" << errMsg << endl;\n\t\t\tDeprecatedGUI::Menu_MessageBox(\"Error\", \"Error while starting game: \" + errMsg);\n\t\t\tGotoLocalMenu();\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t\twarnings << \"prepareGameloop: server was not in lobby\" << endl;\n\n\t\/\/ we need the gamescript in physics init\n\twhile(gameScript() == NULL) {\n\t\tnotes << \"gamescript not loaded yet - waiting\" << endl;\n\t\tSDL_Delay(10);\n\t\tSyncServerAndClient();\n\t}\n\n\tif(gameScript()->gusEngineUsed() && !gusGame.level().gusIsLoaded()) {\n\t\t\/\/ WARNING: This may be temporary\n\t\t\/\/ Right now, we load the gus mod in the map loader (gusGame.changeLevel).\n\t\t\/\/ Thus, when we don't load a gus level, we must load the mod manually.\n\n#ifdef USE_GRID\n\t\tgame.objects.resize(0, 0, gusGame.level().GetWidth(), gusGame.level().GetHeight());\n#endif\t\t\n\t\t\n\t\tgusGame.refreshResources( gameScript()->directory() );\n\t\tgusGame.loadMod();\n\t\tgusGame.runInitScripts();\n\t}\n\t\n\tPhysicsEngine::Init();\n\t\n\tClearEntities();\n\t\n\tProcessEvents();\n\tnotes << \"MaxFPS is \" << tLXOptions->nMaxFPS << endl;\n\t\n\t\/\/cCache.ClearExtraEntries(); \/\/ Do not clear anything before game started, it may be slow\n\t\n\tnotes << \"GameLoopStart\" << endl;\n\tinMainGameLoop = true;\n\tif( DedicatedControl::Get() )\n\t\tDedicatedControl::Get()->GameLoopStart_Signal();\n\t\n\tCrashHandler::recoverAfterCrash = tLXOptions->bRecoverAfterCrash && GetGameVersion().releasetype == Version::RT_NORMAL;\n\t\n\tResetQuitEngineFlag();\n\toldtime = GetTime();\t\n}\n\nvoid Game::frameOuter() {\n\ttLX->currentTime = GetTime();\n\tSetCrashHandlerReturnPoint(\"main game loop\");\n\t\n\t\/\/ Timing\n\ttLX->fDeltaTime = tLX->currentTime - oldtime;\n\ttLX->fRealDeltaTime = tLX->fDeltaTime;\n\toldtime = tLX->currentTime;\n\t\n\t\/\/ cap the delta\n\tif(tLX->fDeltaTime.seconds() > 0.5f) {\n\t\twarnings << \"deltatime \" << tLX->fDeltaTime.seconds() << \" is too high\" << endl;\n\t\t\/\/ only if not in new net mode because it would screw up the gamestate there\n\t\tif(!NewNet::Active())\n\t\t\ttLX->fDeltaTime = 0.5f; \/\/ don't simulate more than 500ms, it could crash the game\n\t}\n\t\n\tProcessEvents();\n\t\n\t\/\/ Main frame\n\tframeInner();\n\t\n\tdoVideoFrameInMainThread();\n\tCapFPS();\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Game loop\nvoid Game::frameInner()\n{\n\tHandlePendingCommands();\n\t\n\tif(bDedicated)\n\t\tDedicatedControl::Get()->GameLoop_Frame();\n\t\n if(tLX->bQuitEngine)\n return;\n\t\n\t\/\/ Check if user pressed screenshot key\n\tif (tLX->cTakeScreenshot.isDownOnce()) {\n\t\tPushScreenshot(\"scrshots\", \"\");\n\t}\n\t\n\t\/\/ Switch between window and fullscreen mode\n\t\/\/ Switch only if delta time is low enough. This is because when the game does not\n\t\/\/ respond for >30secs and the user presses cSwitchMode in the meantime, the mainlock-detector\n\t\/\/ would switch to window and here we would switch again to fullscreen which is stupid.\n\tif( tLX->cSwitchMode.isUp() && tLX && tLX->fRealDeltaTime < 1.0f ) {\n\t\t\/\/ Set to fullscreen\n\t\ttLXOptions->bFullscreen = !tLXOptions->bFullscreen;\n\t\t\n\t\t\/\/ Set the new video mode\n\t\tdoSetVideoModeInMainThread();\n\t\t\n\t\ttLX->cSwitchMode.reset();\n\t}\n\t\n#ifdef WITH_G15\n\tif (OLXG15)\n\t\tOLXG15->gameFrame();\n#endif \/\/WITH_G15\n\t\n\tif(tLXOptions->bEnableChat)\n\t\tProcessIRC();\n\n\tif(gameScript()->gusEngineUsed() || gusGame.level().gusIsLoaded())\n\t\tgusLogicFrame();\n\t\n\t\/\/ Local\n\tswitch (tLX->iGameType) {\n\t\tcase GME_LOCAL:\n\t\t\tcClient->Frame();\n\t\t\tcServer->Frame();\n\t\t\t\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t\t\t\n\t\t\t\/\/ Hosting\n\t\tcase GME_HOST:\n\t\t\tcClient->Frame();\n\t\t\tcServer->Frame();\n\t\t\t\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t\t\t\/\/ Joined\n\t\tcase GME_JOIN:\n\t\t\tcClient->Frame();\n\t\t\tif(tLX && !tLX->bQuitEngine)\n\t\t\t\tcClient->Draw(VideoPostProcessor::videoSurface());\n\t\t\tbreak;\n\t\t\t\n\t} \/\/ SWITCH\n\t\n\tcClient->resetDebugStr();\n\t\n\tEnableSystemMouseCursor(false);\n}\n\n\nvoid Game::cleanupAfterGameloopEnd() {\n\tCrashHandler::recoverAfterCrash = false;\n\t\n\tgusGame.reset(GusGame::ServerQuit);\n\t\n\tPhysicsEngine::UnInit();\n\t\n\tnotes << \"GameLoopEnd: \" << quitEngineFlagReason << endl;\n\tinMainGameLoop = false;\n\tif( DedicatedControl::Get() )\n\t\tDedicatedControl::Get()->GameLoopEnd_Signal();\t\t\n\t\n\tcCache.ClearExtraEntries(); \/\/ Game ended - clear cache\t\n}\n\n\n\n\nvoid ResetQuitEngineFlag() {\n\ttLX->bQuitEngine = false;\n}\n\nvoid SetQuitEngineFlag(const std::string& reason) {\n\tWarning_QuitEngineFlagSet(\"SetQuitEngineFlag(\" + reason + \"): \");\n\tquitEngineFlagReason = reason;\n\ttLX->bQuitEngine = true;\n\t\/\/ If we call this from within the menu, the menu should shutdown.\n\t\/\/ It will be restarted then in the next frame.\n\t\/\/ If we are not in the menu (i.e. in maingameloop), this has no\n\t\/\/ effect as we set it to true in Menu_Start().\n\tif(DeprecatedGUI::tMenu)\n\t\tDeprecatedGUI::tMenu->bMenuRunning = false;\n\t\/\/ If we were in menu, because we forced the menu restart above,\n\t\/\/ we must set this, otherwise OLX would quit (because of current maingamelogic).\n\tif(DeprecatedGUI::bGame)\n\t\t*DeprecatedGUI::bGame = true;\n}\n\nbool Warning_QuitEngineFlagSet(const std::string& preText) {\n\tif(tLX->bQuitEngine) {\n\t\thints << preText << endl;\n\t\twarnings << \"bQuitEngine is set because: \" << quitEngineFlagReason << endl;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\nvoid Game::onNewWorm(CWorm* w) {\n\tif(!game.gameScript()->gusEngineUsed()) return;\n\n#ifdef USE_GRID\n\tobjects.insertImmediately(w, Grid::WormColLayer, Grid::WormRenderLayer);\n\tif(w->getNinjaRopeObj()) objects.insertImmediately(w->getNinjaRopeObj(), 1, 1);\n#else\n\tobjects.insert(WORMS_COLLISION_LAYER,WORMS_RENDER_LAYER, w);\n\tif(w->getNinjaRopeObj()) objects.insert( 1,1, (CGameObject*)w->getNinjaRopeObj() );\n#endif\t\n}\n\nvoid Game::onRemoveWorm(CWorm* w) {\n\/*#ifdef USE_GRID\n\tobjects.(w, Grid::WormColLayer, Grid::WormRenderLayer);\n\tif(w->getNinjaRopeObj()) objects.insertImmediately(w->getNinjaRopeObj(), 1, 1);\n#else\n\tobjects.insert(WORMS_COLLISION_LAYER,WORMS_RENDER_LAYER, w);\n\tif(w->getNinjaRopeObj()) objects.insert( 1,1, (CGameObject*)w->getNinjaRopeObj() );\n#endif\t*\/\n}\n\nvoid Game::onNewPlayer(CWormInputHandler* player) {\n\tplayers.push_back( player );\t\n}\n\nvoid Game::onNewPlayer_Lua(CWormInputHandler* p) {\n\tif(game.gameScript()->gusEngineUsed()) {\n\t\tEACH_CALLBACK(i, playerInit)\n\t\t{\n\t\t\t(lua.call(*i), p->getLuaReference())();\n\t\t}\t\n\t}\n}\n\nvoid Game::onNewHumanPlayer(CWormHumanInputHandler* player) {\n\tlocalPlayers.push_back( player );\t\n\tplayer->local = true;\n}\n\nvoid Game::onNewHumanPlayer_Lua(CWormHumanInputHandler* player) {\n\tif(game.gameScript()->gusEngineUsed()) {\n\t\tEACH_CALLBACK(i, localplayerInit)\n\t\t{\n\t\t\t(lua.call(*i), player->getLuaReference())();\n\t\t}\n\t}\n}\n\n\nvoid Game::reset() {\n\t\/\/ Delete all players\n\tfor ( std::list::iterator iter = game.players.begin(); iter != game.players.end(); ++iter)\n\t{\n\t\t\/\/ handled by CClient for now\n\t\t\/\/(*iter)->deleteThis();\n\t}\n\tgame.players.clear();\n\tgame.localPlayers.clear();\n\t\n\t\/\/ Delete all objects\n#ifdef USE_GRID\n\tgame.objects.clear();\n#else\n\tfor ( ObjectsList::Iterator iter = game.objects.begin(); (bool)iter; ++iter)\n\t{\n\t\t(*iter)->deleteThis();\n\t}\n\tobjects.clear();\n#endif\t\n}\n\n\nCGameScript* Game::gameScript() {\n\tif(tLX) {\n\t\tif(tLX->iGameType == GME_JOIN) return cClient->getGameScript().get();\n\t\treturn cServer->getGameScript().get();\n\t}\n\treturn NULL;\n}\n<|endoftext|>"} {"text":"#include \"Screen.hpp\"\n\n#include \n\n#include \"gl\/util.hpp\"\n\nnamespace nt {\nnamespace gl {\n\nvoid Screen::render(const Box2& screenArea) const\n{\n glEnable(GL_SCISSOR_TEST);\n glScissor(screenArea);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n for (std::vector::const_iterator i = viewports.begin(); i != viewports.end(); ++i) {\n Box2 viewportArea;\n\n viewportArea.setLeft(\n static_cast(screenArea.left() * i->extent.left())\n );\n viewportArea.setRight(\n static_cast(screenArea.right() * i->extent.right())\n );\n viewportArea.setTop(\n static_cast(screenArea.top() * i->extent.top())\n );\n viewportArea.setBottom(\n static_cast(screenArea.bottom() * i->extent.bottom())\n );\n\n i->viewport->render(viewportArea);\n }\n}\n\nvoid Screen::addViewport(const Viewport* const viewport)\n{\n addViewport(viewport, Box2(0, 1, 0, 1));\n}\n\nvoid Screen::addViewport(const Viewport* const viewport, const Box2& extent)\n{\n ViewportEntry entry;\n entry.viewport = viewport;\n entry.extent = extent;\n viewports.push_back(entry);\n}\n\nvoid Screen::removeViewport(const Viewport* const viewport)\n{\n viewports.erase(\n std::remove_if(begin(viewports), end(viewports),\n [&](ViewportEntry& entry) { return entry.viewport == viewport; }\n ),\n end(viewports)\n );\n}\n\n} \/\/ namespace gl\n} \/\/ namespace nt\nScreen: Fixed viewport area#include \"Screen.hpp\"\n\n#include \n\n#include \"gl\/util.hpp\"\n\nnamespace nt {\nnamespace gl {\n\nvoid Screen::render(const Box2& screenArea) const\n{\n glEnable(GL_SCISSOR_TEST);\n glScissor(screenArea);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n for (std::vector::const_iterator i = viewports.begin(); i != viewports.end(); ++i) {\n Box2 viewportArea;\n\n viewportArea.setLeft(\n static_cast(screenArea.width() * i->extent.left())\n );\n viewportArea.setRight(\n static_cast(screenArea.width() * i->extent.right())\n );\n viewportArea.setTop(\n static_cast(screenArea.height() * i->extent.top())\n );\n viewportArea.setBottom(\n static_cast(screenArea.height() * i->extent.bottom())\n );\n\n i->viewport->render(viewportArea);\n }\n}\n\nvoid Screen::addViewport(const Viewport* const viewport)\n{\n addViewport(viewport, Box2(0, 1, 0, 1));\n}\n\nvoid Screen::addViewport(const Viewport* const viewport, const Box2& extent)\n{\n ViewportEntry entry;\n entry.viewport = viewport;\n entry.extent = extent;\n viewports.push_back(entry);\n}\n\nvoid Screen::removeViewport(const Viewport* const viewport)\n{\n viewports.erase(\n std::remove_if(begin(viewports), end(viewports),\n [&](ViewportEntry& entry) { return entry.viewport == viewport; }\n ),\n end(viewports)\n );\n}\n\n} \/\/ namespace gl\n} \/\/ namespace nt\n<|endoftext|>"} {"text":"\/\/\/\n\/\/\/ @file A.cpp\n\/\/\/\n\/\/\/ Copyright (C) 2019 Kim Walisch, \n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ntemplate \nT A_OpenMP(T x,\n int64_t y,\n int64_t start,\n Primes& primes,\n int threads)\n{\n T sum = 0;\n int64_t x13 = iroot<3>(x);\n int64_t thread_threshold = 1000;\n threads = ideal_num_threads(threads, x13, thread_threshold);\n\n PiTable pi(isqrt(x));\n int64_t pi_x13 = pi[x13];\n S2Status status(x);\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: sum)\n for (int64_t b = pi[start] + 1; b <= pi_x13; b++)\n {\n int64_t prime = primes[b];\n T x2 = x \/ prime;\n int64_t j = b + 1;\n int64_t max_j = pi[isqrt(x2)];\n\n for (; j <= max_j; j++)\n {\n int64_t xn = fast_div64(x2, primes[j]);\n if (xn < y)\n sum += pi[xn] * 2;\n else\n sum += pi[xn];\n }\n\n if (is_print())\n status.print(b, pi_x13);\n }\n\n return sum;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t A(int64_t x,\n int64_t y,\n int threads)\n{\n print(\"\");\n print(\"=== A(x, y) ===\");\n print(x, y, threads);\n\n double time = get_time();\n int64_t y2 = y * y;\n int64_t start = max(iroot<4>(x), x \/ y2);\n int64_t max_prime = (int64_t) isqrt(x \/ start);\n\n auto primes = generate_primes(max_prime);\n int64_t a = A_OpenMP((intfast64_t) x, y, start, primes, threads);\n\n print(\"A\", a, time);\n return a;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t A(int128_t x,\n int64_t y,\n int threads)\n{\n print(\"\");\n print(\"=== A(x, y) ===\");\n print(x, y, threads);\n\n double time = get_time();\n int128_t a;\n\n int128_t y2 = (int128_t) y * y;\n int128_t start = max(iroot<4>(x), x \/ y2);\n int64_t max_prime = (int64_t) isqrt(x \/ start);\n\n \/\/ uses less memory\n if (max_prime <= numeric_limits::max())\n {\n auto primes = generate_primes(max_prime);\n a = A_OpenMP((intfast128_t) x, y, start, primes, threads);\n }\n else\n {\n auto primes = generate_primes(max_prime);\n a = A_OpenMP((intfast128_t) x, y, start, primes, threads);\n }\n\n print(\"A\", a, time);\n return a;\n}\n\n#endif\n\n} \/\/ namespace\nMinor speedup\/\/\/\n\/\/\/ @file A.cpp\n\/\/\/ @brief Simple demonstration implementation of the A(x, y) formula\n\/\/\/ in Xavier Gourdon's prime counting algorithm. This\n\/\/\/ implementation uses O(x^(1\/2)) memory instead of O(x^(1\/3))\n\/\/\/ in order to simplify the implementation.\n\/\/\/\n\/\/\/ Copyright (C) 2019 Kim Walisch, \n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ntemplate \nT A_OpenMP(T x,\n int64_t y,\n int64_t start,\n Primes& primes,\n int threads)\n{\n T sum = 0;\n int64_t x13 = iroot<3>(x);\n int64_t thread_threshold = 1000;\n threads = ideal_num_threads(threads, x13, thread_threshold);\n\n PiTable pi(isqrt(x));\n int64_t pi_x13 = pi[x13];\n S2Status status(x);\n\n #pragma omp parallel for schedule(dynamic) num_threads(threads) reduction(+: sum)\n for (int64_t b = pi[start] + 1; b <= pi_x13; b++)\n {\n int64_t prime = primes[b];\n T x2 = x \/ prime;\n int64_t j = b + 1;\n int64_t max_j = pi[isqrt(x2)];\n\n \/\/ x \/ (p * q) >= y\n for (; j <= max_j; j++)\n {\n int64_t xn = fast_div64(x2, primes[j]);\n if (xn < y)\n break;\n sum += pi[xn];\n }\n\n \/\/ x \/ (p * q) < y\n for (; j <= max_j; j++)\n {\n int64_t xn = fast_div64(x2, primes[j]);\n sum += pi[xn] * 2;\n }\n\n if (is_print())\n status.print(b, pi_x13);\n }\n\n return sum;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nint64_t A(int64_t x,\n int64_t y,\n int threads)\n{\n print(\"\");\n print(\"=== A(x, y) ===\");\n print(x, y, threads);\n\n double time = get_time();\n int64_t y2 = y * y;\n int64_t start = max(iroot<4>(x), x \/ y2);\n int64_t max_prime = (int64_t) isqrt(x \/ start);\n\n auto primes = generate_primes(max_prime);\n int64_t a = A_OpenMP((intfast64_t) x, y, start, primes, threads);\n\n print(\"A\", a, time);\n return a;\n}\n\n#ifdef HAVE_INT128_T\n\nint128_t A(int128_t x,\n int64_t y,\n int threads)\n{\n print(\"\");\n print(\"=== A(x, y) ===\");\n print(x, y, threads);\n\n double time = get_time();\n int128_t a;\n\n int128_t y2 = (int128_t) y * y;\n int128_t start = max(iroot<4>(x), x \/ y2);\n int64_t max_prime = (int64_t) isqrt(x \/ start);\n\n \/\/ uses less memory\n if (max_prime <= numeric_limits::max())\n {\n auto primes = generate_primes(max_prime);\n a = A_OpenMP((intfast128_t) x, y, start, primes, threads);\n }\n else\n {\n auto primes = generate_primes(max_prime);\n a = A_OpenMP((intfast128_t) x, y, start, primes, threads);\n }\n\n print(\"A\", a, time);\n return a;\n}\n\n#endif\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"\/**\n* Licensed to the Apache Software Foundation (ASF) under one\n* or more contributor license agreements. See the NOTICE file\n* distributed with this work for additional information\n* regarding copyright ownership. The ASF licenses this file\n* to you under the Apache License, Version 2.0 (the\n* \"License\"); you may not use this file except in compliance\n* with the License. You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License\n*\/\n\n#ifndef __HDFS_HPP__\n#define __HDFS_HPP__\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n\n\/\/ TODO(benh): We should get the hostname:port (or ip:port) of the\n\/\/ server via:\n\/\/\n\/\/ hadoop dfsadmin -report | grep Name: | awk '{ print $2 }'\n\/\/\n\/\/ The advantage of doing this is then we can explicitly use the\n\/\/ 'hdfs:\/\/hostname' prefix when we're trying to do copies to avoid\n\/\/ silent failures when HDFS is down and the tools just copies\n\/\/ locally.\n\/\/\n\/\/ Note that if HDFS is not on port 9000 then we'll also need to do an\n\/\/ HTTP GET on hostname:port and grab the information in the\n\/\/ ...<\/title> (this is the best hack I can think of to get\n\/\/ 'fs.default.name' given the tools available).\nclass HDFS\n{\npublic:\n \/\/ Look for `hadoop' first where proposed, otherwise, look for\n \/\/ HADOOP_HOME, otherwise, assume it's on the PATH.\n explicit HDFS(const std::string& _hadoop)\n : hadoop(os::exists(_hadoop)\n ? _hadoop\n : (os::getenv(\"HADOOP_HOME\").isSome()\n ? path::join(os::getenv(\"HADOOP_HOME\").get(), \"bin\/hadoop\")\n : \"hadoop\")) {}\n\n \/\/ Look for `hadoop' in HADOOP_HOME or assume it's on the PATH.\n HDFS()\n : hadoop(os::getenv(\"HADOOP_HOME\").isSome()\n ? path::join(os::getenv(\"HADOOP_HOME\").get(), \"bin\/hadoop\")\n : \"hadoop\") {}\n\n \/\/ Check if hadoop client is available at the path that was set.\n \/\/ This can be done by executing `hadoop version` command and\n \/\/ checking for status code == 0.\n Try<bool> available()\n {\n Try<std::string> command = strings::format(\"%s version\", hadoop);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return true;\n }\n\n Try<bool> exists(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -test -e '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return true;\n }\n\n Try<Bytes> du(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -du '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n \/\/\n \/\/ TODO(marco): this was the existing logic, but not sure it is\n \/\/ actually needed.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(\"HDFS du failed: \" + out.error());\n }\n\n \/\/ We expect 2 space-separated output fields; a number of bytes then the\n \/\/ name of the path we gave. The 'hadoop' command can emit various WARN\n \/\/ or other log messages, so we make an effort to scan for the field we\n \/\/ want.\n foreach (const std::string& line, strings::tokenize(out.get(), \"\\n\")) {\n \/\/ Note that we use tokenize() rather than split() since fields can be\n \/\/ delimited by multiple spaces.\n std::vector<std::string> fields = strings::tokenize(line, \" \");\n\n if (fields.size() == 2 && fields[1] == path) {\n Result<size_t> size = numify<size_t>(fields[0]);\n if (size.isError()) {\n return Error(\"HDFS du returned unexpected format: \" + size.error());\n } else if (size.isNone()) {\n return Error(\"HDFS du returned unexpected format\");\n }\n\n return Bytes(size.get());\n }\n }\n\n return Error(\"HDFS du returned an unexpected format: '\" + out.get() + \"'\");\n }\n\n Try<Nothing> rm(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -rm '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\n Try<Nothing> copyFromLocal(\n const std::string& from,\n std::string to)\n {\n if (!os::exists(from)) {\n return Error(\"Failed to find \" + from);\n }\n\n to = absolutePath(to);\n\n \/\/ Copy to HDFS.\n Try<std::string> command = strings::format(\n \"%s fs -copyFromLocal '%s' '%s'\", hadoop, from, to);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\n Try<Nothing> copyToLocal(\n std::string from,\n const std::string& to)\n {\n from = absolutePath(from);\n\n \/\/ Copy from HDFS.\n Try<std::string> command = strings::format(\n \"%s fs -copyToLocal '%s' '%s'\", hadoop, from, to);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\nprivate:\n \/\/ Normalize an HDFS path such that it is either an absolute path\n \/\/ or a full hdfs:\/\/ URL.\n std::string absolutePath(const std::string& hdfsPath)\n {\n if (strings::startsWith(hdfsPath, \"hdfs:\/\/\") ||\n strings::startsWith(hdfsPath, \"\/\")) {\n return hdfsPath;\n }\n\n return path::join(\"\", hdfsPath);\n }\n\n const std::string hadoop;\n};\n\n#endif \/\/ __HDFS_HPP__\n<commit_msg>Fixed the license header in hdfs.hpp.<commit_after>\/**\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License\n *\/\n\n#ifndef __HDFS_HPP__\n#define __HDFS_HPP__\n\n#include <sstream>\n#include <vector>\n\n#include <stout\/check.hpp>\n#include <stout\/error.hpp>\n#include <stout\/nothing.hpp>\n#include <stout\/os.hpp>\n#include <stout\/path.hpp>\n#include <stout\/strings.hpp>\n\n\n\/\/ TODO(benh): We should get the hostname:port (or ip:port) of the\n\/\/ server via:\n\/\/\n\/\/ hadoop dfsadmin -report | grep Name: | awk '{ print $2 }'\n\/\/\n\/\/ The advantage of doing this is then we can explicitly use the\n\/\/ 'hdfs:\/\/hostname' prefix when we're trying to do copies to avoid\n\/\/ silent failures when HDFS is down and the tools just copies\n\/\/ locally.\n\/\/\n\/\/ Note that if HDFS is not on port 9000 then we'll also need to do an\n\/\/ HTTP GET on hostname:port and grab the information in the\n\/\/ <title>...<\/title> (this is the best hack I can think of to get\n\/\/ 'fs.default.name' given the tools available).\nclass HDFS\n{\npublic:\n \/\/ Look for `hadoop' first where proposed, otherwise, look for\n \/\/ HADOOP_HOME, otherwise, assume it's on the PATH.\n explicit HDFS(const std::string& _hadoop)\n : hadoop(os::exists(_hadoop)\n ? _hadoop\n : (os::getenv(\"HADOOP_HOME\").isSome()\n ? path::join(os::getenv(\"HADOOP_HOME\").get(), \"bin\/hadoop\")\n : \"hadoop\")) {}\n\n \/\/ Look for `hadoop' in HADOOP_HOME or assume it's on the PATH.\n HDFS()\n : hadoop(os::getenv(\"HADOOP_HOME\").isSome()\n ? path::join(os::getenv(\"HADOOP_HOME\").get(), \"bin\/hadoop\")\n : \"hadoop\") {}\n\n \/\/ Check if hadoop client is available at the path that was set.\n \/\/ This can be done by executing `hadoop version` command and\n \/\/ checking for status code == 0.\n Try<bool> available()\n {\n Try<std::string> command = strings::format(\"%s version\", hadoop);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return true;\n }\n\n Try<bool> exists(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -test -e '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return true;\n }\n\n Try<Bytes> du(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -du '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n \/\/ We are piping stderr to stdout so that we can see the error (if\n \/\/ any) in the logs emitted by `os::shell()` in case of failure.\n \/\/\n \/\/ TODO(marco): this was the existing logic, but not sure it is\n \/\/ actually needed.\n Try<std::string> out = os::shell(command.get() + \" 2>&1\");\n\n if (out.isError()) {\n return Error(\"HDFS du failed: \" + out.error());\n }\n\n \/\/ We expect 2 space-separated output fields; a number of bytes then the\n \/\/ name of the path we gave. The 'hadoop' command can emit various WARN\n \/\/ or other log messages, so we make an effort to scan for the field we\n \/\/ want.\n foreach (const std::string& line, strings::tokenize(out.get(), \"\\n\")) {\n \/\/ Note that we use tokenize() rather than split() since fields can be\n \/\/ delimited by multiple spaces.\n std::vector<std::string> fields = strings::tokenize(line, \" \");\n\n if (fields.size() == 2 && fields[1] == path) {\n Result<size_t> size = numify<size_t>(fields[0]);\n if (size.isError()) {\n return Error(\"HDFS du returned unexpected format: \" + size.error());\n } else if (size.isNone()) {\n return Error(\"HDFS du returned unexpected format\");\n }\n\n return Bytes(size.get());\n }\n }\n\n return Error(\"HDFS du returned an unexpected format: '\" + out.get() + \"'\");\n }\n\n Try<Nothing> rm(std::string path)\n {\n path = absolutePath(path);\n\n Try<std::string> command = strings::format(\n \"%s fs -rm '%s'\", hadoop, path);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\n Try<Nothing> copyFromLocal(\n const std::string& from,\n std::string to)\n {\n if (!os::exists(from)) {\n return Error(\"Failed to find \" + from);\n }\n\n to = absolutePath(to);\n\n \/\/ Copy to HDFS.\n Try<std::string> command = strings::format(\n \"%s fs -copyFromLocal '%s' '%s'\", hadoop, from, to);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\n Try<Nothing> copyToLocal(\n std::string from,\n const std::string& to)\n {\n from = absolutePath(from);\n\n \/\/ Copy from HDFS.\n Try<std::string> command = strings::format(\n \"%s fs -copyToLocal '%s' '%s'\", hadoop, from, to);\n\n CHECK_SOME(command);\n\n Try<std::string> out = os::shell(command.get());\n\n if (out.isError()) {\n return Error(out.error());\n }\n\n return Nothing();\n }\n\nprivate:\n \/\/ Normalize an HDFS path such that it is either an absolute path\n \/\/ or a full hdfs:\/\/ URL.\n std::string absolutePath(const std::string& hdfsPath)\n {\n if (strings::startsWith(hdfsPath, \"hdfs:\/\/\") ||\n strings::startsWith(hdfsPath, \"\/\")) {\n return hdfsPath;\n }\n\n return path::join(\"\", hdfsPath);\n }\n\n const std::string hadoop;\n};\n\n#endif \/\/ __HDFS_HPP__\n<|endoftext|>"} {"text":"<commit_before>\/*\n * fileio.cpp\n *\n * Created on: Oct 21, 2009\n * Author: Craig Rasmussen\n *\/\n\n#include \"fileio.hpp\"\n#include \"connections\/weight_conversions.hpp\"\n#include \"structures\/Buffer.hpp\"\n#include \"utils\/BufferUtilsMPI.hpp\"\n#include \"utils\/ExpandLeadingTilde.hpp\"\n#include \"utils\/PVLog.hpp\"\n#include \"utils\/conversions.hpp\"\n\n#include <assert.h>\n#include <iostream>\n\n#undef DEBUG_OUTPUT\n\nnamespace PV {\n\nint PV_stat(const char *path, struct stat *buf) {\n \/\/ Call stat library function, trying up to MAX_FILESYSTEMCALL_TRIES times if an error is\n \/\/ returned.\n \/\/ If an error results on all MAX_FILESYSTEMCALL_TRIES times, returns -1 (the error return value)\n \/\/ for stat()\n \/\/ and errno is the error of the last attempt.\n char *realPath = strdup(expandLeadingTilde(path).c_str());\n int attempt = 0;\n int retval = -1;\n while (retval != 0) {\n errno = 0;\n retval = stat(realPath, buf);\n if (retval == 0)\n break;\n attempt++;\n WarnLog().printf(\n \"stat() failure for \\\"%s\\\" on attempt %d: %s\\n\", path, attempt, strerror(errno));\n if (attempt < MAX_FILESYSTEMCALL_TRIES) {\n sleep(1);\n }\n else {\n break;\n }\n }\n if (retval != 0) {\n ErrorLog().printf(\n \"PV_stat exceeded MAX_FILESYSTEMCALL_TRIES = %d for \\\"%s\\\"\\n\",\n MAX_FILESYSTEMCALL_TRIES,\n path);\n }\n free(realPath);\n return retval;\n}\n\nstatic inline int makeDirectory(char const *dir) {\n mode_t dirmode = S_IRWXU | S_IRWXG | S_IRWXO;\n int status = 0;\n\n char *workingDir = strdup(dir);\n FatalIf(workingDir == nullptr, \"makeDirectory: unable to duplicate path \\\"%s\\\".\", dir);\n\n int len = strlen(workingDir);\n if (workingDir[len - 1] == '\/')\n workingDir[len - 1] = '\\0';\n\n for (char *p = workingDir + 1; *p; p++)\n if (*p == '\/') {\n *p = '\\0';\n status |= mkdir(workingDir, dirmode);\n if (status != 0 && errno != EEXIST) {\n return status;\n }\n *p = '\/';\n }\n status |= mkdir(workingDir, dirmode);\n if (errno == EEXIST) {\n status = 0;\n }\n return status;\n}\n\nvoid ensureDirExists(MPIBlock const *mpiBlock, char const *dirname) {\n \/\/ If rank zero, see if path exists, and try to create it if it doesn't.\n \/\/ If not rank zero, the routine does nothing.\n if (mpiBlock->getRank() != 0) {\n return;\n }\n\n std::string expandedDirName = expandLeadingTilde(dirname);\n struct stat pathstat;\n int statresult = stat(expandedDirName.c_str(), &pathstat);\n\n \/\/ If path exists and is a directory, nothing to do.\n \/\/ If path exists but is not a directory, fatal error.\n if (statresult == 0) {\n FatalIf(!S_ISDIR(pathstat.st_mode), \"Path \\\"%s\\\" exists but is not a directory\\n\", dirname);\n return;\n }\n\n \/\/ Fatal error if checking the path gave an error other than No such file or directory\n FatalIf(\n errno != ENOENT,\n \"Checking status of directory \\\"%s\\\" gave error \\\"%s\\\".\\n\",\n dirname,\n strerror(errno));\n\n InfoLog().printf(\"Directory \\\"%s\\\" does not exist; attempting to create\\n\", dirname);\n\n \/\/ Try up to MAX_FILESYSTEMCALL_TRIES times until it works\n for (int attemptNum = 0; attemptNum < MAX_FILESYSTEMCALL_TRIES; attemptNum++) {\n int mkdirstatus = makeDirectory(expandedDirName.c_str());\n if (mkdirstatus != 0) {\n if (attemptNum == MAX_FILESYSTEMCALL_TRIES - 1) {\n Fatal().printf(\n \"Directory \\\"%s\\\" could not be created: %s; Exiting\\n\", dirname, strerror(errno));\n }\n else {\n getOutputStream().flush();\n WarnLog().printf(\n \"Directory \\\"%s\\\" could not be created: %s; Retrying %d out of %d\\n\",\n dirname,\n strerror(errno),\n attemptNum + 1,\n MAX_FILESYSTEMCALL_TRIES);\n sleep(1);\n }\n }\n else {\n InfoLog().printf(\"Successfully created directory \\\"%s\/\\\".\\n\", dirname);\n errno = 0;\n break;\n }\n }\n}\n\n} \/\/ namespace PV\n<commit_msg>Adds missing free() for a strdup-created string<commit_after>\/*\n * fileio.cpp\n *\n * Created on: Oct 21, 2009\n * Author: Craig Rasmussen\n *\/\n\n#include \"fileio.hpp\"\n#include \"connections\/weight_conversions.hpp\"\n#include \"structures\/Buffer.hpp\"\n#include \"utils\/BufferUtilsMPI.hpp\"\n#include \"utils\/ExpandLeadingTilde.hpp\"\n#include \"utils\/PVLog.hpp\"\n#include \"utils\/conversions.hpp\"\n\n#include <assert.h>\n#include <iostream>\n\n#undef DEBUG_OUTPUT\n\nnamespace PV {\n\nint PV_stat(const char *path, struct stat *buf) {\n \/\/ Call stat library function, trying up to MAX_FILESYSTEMCALL_TRIES times if an error is\n \/\/ returned.\n \/\/ If an error results on all MAX_FILESYSTEMCALL_TRIES times, returns -1 (the error return value)\n \/\/ for stat()\n \/\/ and errno is the error of the last attempt.\n char *realPath = strdup(expandLeadingTilde(path).c_str());\n int attempt = 0;\n int retval = -1;\n while (retval != 0) {\n errno = 0;\n retval = stat(realPath, buf);\n if (retval == 0)\n break;\n attempt++;\n WarnLog().printf(\n \"stat() failure for \\\"%s\\\" on attempt %d: %s\\n\", path, attempt, strerror(errno));\n if (attempt < MAX_FILESYSTEMCALL_TRIES) {\n sleep(1);\n }\n else {\n break;\n }\n }\n if (retval != 0) {\n ErrorLog().printf(\n \"PV_stat exceeded MAX_FILESYSTEMCALL_TRIES = %d for \\\"%s\\\"\\n\",\n MAX_FILESYSTEMCALL_TRIES,\n path);\n }\n free(realPath);\n return retval;\n}\n\nstatic inline int makeDirectory(char const *dir) {\n mode_t dirmode = S_IRWXU | S_IRWXG | S_IRWXO;\n int status = 0;\n\n char *workingDir = strdup(dir);\n FatalIf(workingDir == nullptr, \"makeDirectory: unable to duplicate path \\\"%s\\\".\", dir);\n\n int len = strlen(workingDir);\n if (workingDir[len - 1] == '\/')\n workingDir[len - 1] = '\\0';\n\n for (char *p = workingDir + 1; *p; p++)\n if (*p == '\/') {\n *p = '\\0';\n status |= mkdir(workingDir, dirmode);\n if (status != 0 && errno != EEXIST) {\n return status;\n }\n *p = '\/';\n }\n status |= mkdir(workingDir, dirmode);\n if (errno == EEXIST) {\n status = 0;\n }\n free(workingDir);\n return status;\n}\n\nvoid ensureDirExists(MPIBlock const *mpiBlock, char const *dirname) {\n \/\/ If rank zero, see if path exists, and try to create it if it doesn't.\n \/\/ If not rank zero, the routine does nothing.\n if (mpiBlock->getRank() != 0) {\n return;\n }\n\n std::string expandedDirName = expandLeadingTilde(dirname);\n struct stat pathstat;\n int statresult = stat(expandedDirName.c_str(), &pathstat);\n\n \/\/ If path exists and is a directory, nothing to do.\n \/\/ If path exists but is not a directory, fatal error.\n if (statresult == 0) {\n FatalIf(!S_ISDIR(pathstat.st_mode), \"Path \\\"%s\\\" exists but is not a directory\\n\", dirname);\n return;\n }\n\n \/\/ Fatal error if checking the path gave an error other than No such file or directory\n FatalIf(\n errno != ENOENT,\n \"Checking status of directory \\\"%s\\\" gave error \\\"%s\\\".\\n\",\n dirname,\n strerror(errno));\n\n InfoLog().printf(\"Directory \\\"%s\\\" does not exist; attempting to create\\n\", dirname);\n\n \/\/ Try up to MAX_FILESYSTEMCALL_TRIES times until it works\n for (int attemptNum = 0; attemptNum < MAX_FILESYSTEMCALL_TRIES; attemptNum++) {\n int mkdirstatus = makeDirectory(expandedDirName.c_str());\n if (mkdirstatus != 0) {\n if (attemptNum == MAX_FILESYSTEMCALL_TRIES - 1) {\n Fatal().printf(\n \"Directory \\\"%s\\\" could not be created: %s; Exiting\\n\", dirname, strerror(errno));\n }\n else {\n getOutputStream().flush();\n WarnLog().printf(\n \"Directory \\\"%s\\\" could not be created: %s; Retrying %d out of %d\\n\",\n dirname,\n strerror(errno),\n attemptNum + 1,\n MAX_FILESYSTEMCALL_TRIES);\n sleep(1);\n }\n }\n else {\n InfoLog().printf(\"Successfully created directory \\\"%s\/\\\".\\n\", dirname);\n errno = 0;\n break;\n }\n }\n}\n\n} \/\/ namespace PV\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of libkdepim.\n\n Copyright (c) 2002 Cornelius Schumacher <schumacher@kde.org>\n Copyright (c) 2002 David Jarvie <software@astrojar.org.uk>\n Copyright (c) 2003-2004 Reinhold Kainhofer <reinhold@kainhofer.com>\n Copyright (c) 2004 Tobias Koenig <tokoe@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n\/\/krazy:excludeall=qclasses as we want to subclass from QComboBox, not KComboBox\n\n#include \"kdateedit.h\"\n\n#include <KCalendarSystem>\n#include <KDebug>\n#include <KGlobal>\n#include <KGlobalSettings>\n#include <KLocale>\n\n#include <QAbstractItemView>\n#include <QApplication>\n#include <QCompleter>\n#include <QEvent>\n#include <QKeyEvent>\n#include <QLineEdit>\n#include <QMouseEvent>\n#include <QValidator>\n\nusing namespace KPIM;\n\nclass DateValidator : public QValidator\n{\n public:\n DateValidator( const QStringList &keywords, QWidget *parent )\n : QValidator( parent ), mKeywords( keywords )\n {}\n\n virtual State validate( QString &str, int & ) const\n {\n int length = str.length();\n\n \/\/ empty string is intermediate so one can clear the edit line and start from scratch\n if ( length <= 0 ) {\n return Intermediate;\n }\n\n if ( mKeywords.contains( str.toLower() ) ) {\n return Acceptable;\n }\n\n bool ok = false;\n KGlobal::locale()->readDate( str, &ok );\n if ( ok ) {\n return Acceptable;\n } else {\n return Intermediate;\n }\n }\n\n private:\n QStringList mKeywords;\n};\n\nKDateEdit::KDateEdit( QWidget *parent )\n : QComboBox( parent ), mReadOnly( false ), mDiscardNextMousePress( false )\n{\n \/\/ need at least one entry for popup to work\n setMaxCount( 1 );\n setEditable( true );\n\n mDate = QDate::currentDate();\n QString today = KGlobal::locale()->formatDate( mDate, KLocale::ShortDate );\n\n addItem( today );\n setCurrentIndex( 0 );\n\n connect( lineEdit(), SIGNAL(returnPressed()),\n this, SLOT(lineEnterPressed()) );\n connect( this, SIGNAL(textChanged(QString)),\n SLOT(slotTextChanged(QString)) );\n\n mPopup = new KDatePickerPopup( KDatePickerPopup::DatePicker | KDatePickerPopup::Words,\n QDate::currentDate(), this );\n mPopup->hide();\n mPopup->installEventFilter( this );\n\n connect( mPopup, SIGNAL(dateChanged(QDate)),\n SLOT(dateSelected(QDate)) );\n\n \/\/ handle keyword entry\n setupKeywords();\n lineEdit()->installEventFilter( this );\n\n setValidator( new DateValidator( mKeywordMap.keys(), this ) );\n\n mTextChanged = false;\n}\n\nKDateEdit::~KDateEdit()\n{\n}\n\nvoid KDateEdit::setDate( const QDate &date )\n{\n assignDate( date );\n updateView();\n}\n\nQDate KDateEdit::date() const\n{\n return mDate;\n}\n\nvoid KDateEdit::setReadOnly( bool readOnly )\n{\n mReadOnly = readOnly;\n lineEdit()->setReadOnly( readOnly );\n}\n\nbool KDateEdit::isReadOnly() const\n{\n return mReadOnly;\n}\n\nvoid KDateEdit::showPopup()\n{\n if ( mReadOnly ) {\n return;\n }\n\n QRect desk = KGlobalSettings::desktopGeometry( this );\n\n QPoint popupPoint = mapToGlobal( QPoint( 0, 0 ) );\n\n int dateFrameHeight = mPopup->sizeHint().height();\n if ( popupPoint.y() + height() + dateFrameHeight > desk.bottom() ) {\n popupPoint.setY( popupPoint.y() - dateFrameHeight );\n } else {\n popupPoint.setY( popupPoint.y() + height() );\n }\n\n int dateFrameWidth = mPopup->sizeHint().width();\n if ( popupPoint.x() + dateFrameWidth > desk.right() ) {\n popupPoint.setX( desk.right() - dateFrameWidth );\n }\n\n if ( popupPoint.x() < desk.left() ) {\n popupPoint.setX( desk.left() );\n }\n\n if ( popupPoint.y() < desk.top() ) {\n popupPoint.setY( desk.top() );\n }\n\n if ( mDate.isValid() ) {\n mPopup->setDate( mDate );\n } else {\n mPopup->setDate( QDate::currentDate() );\n }\n\n mPopup->popup( popupPoint );\n\n \/\/ The combo box is now shown pressed. Make it show not pressed again\n \/\/ by causing its (invisible) list box to emit a 'selected' signal.\n \/\/ First, ensure that the list box contains the date currently displayed.\n QDate date = parseDate();\n assignDate( date );\n updateView();\n\n \/\/ Now, simulate an Enter to unpress it\n QAbstractItemView *lb = view();\n if ( lb ) {\n lb->setCurrentIndex( lb->model()->index( 0, 0 ) );\n QKeyEvent *keyEvent =\n new QKeyEvent( QEvent::KeyPress, Qt::Key_Enter, Qt::NoModifier );\n QApplication::postEvent( lb, keyEvent );\n }\n}\n\nvoid KDateEdit::dateSelected( const QDate &date )\n{\n if ( assignDate( date ) ) {\n updateView();\n emit dateChanged( date );\n emit dateEntered( date );\n\n if ( date.isValid() ) {\n mPopup->hide();\n }\n }\n}\n\nvoid KDateEdit::lineEnterPressed()\n{\n bool replaced = false;\n\n QDate date = parseDate( &replaced );\n\n if ( assignDate( date ) ) {\n if ( replaced ) {\n updateView();\n }\n\n emit dateChanged( date );\n emit dateEntered( date );\n }\n}\n\nQDate KDateEdit::parseDate( bool *replaced ) const\n{\n QString text = currentText();\n QDate result;\n\n if ( replaced ) {\n (*replaced) = false;\n }\n\n if ( text.isEmpty() ) {\n result = QDate();\n } else if ( mKeywordMap.contains( text.toLower() ) ) {\n QDate today = QDate::currentDate();\n int i = mKeywordMap[ text.toLower() ];\n if ( i == 30 ) {\n today = today.addMonths( 1 );\n } else if ( i >= 100 ) {\n \/* A day name has been entered. Convert to offset from today.\n * This uses some math tricks to figure out the offset in days\n * to the next date the given day of the week occurs. There\n * are two cases, that the new day is >= the current day, which means\n * the new day has not occurred yet or that the new day < the current day,\n * which means the new day is already passed (so we need to find the\n * day in the next week).\n *\/\n i -= 100;\n int currentDay = today.dayOfWeek();\n if ( i >= currentDay ) {\n i -= currentDay;\n } else {\n i += 7 - currentDay;\n }\n }\n\n result = today.addDays( i );\n if ( replaced ) {\n (*replaced) = true;\n }\n } else {\n result = KGlobal::locale()->readDate( text );\n }\n\n return result;\n}\n\nvoid KDateEdit::focusOutEvent( QFocusEvent *e )\n{\n if ( mTextChanged ) {\n lineEnterPressed();\n mTextChanged = false;\n }\n QComboBox::focusOutEvent( e );\n}\n\nvoid KDateEdit::keyPressEvent(QKeyEvent* e)\n{\n QDate date;\n\n if ( !mReadOnly ) {\n switch ( e->key() ) {\n case Qt::Key_Up:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addDays( 1 );\n break;\n case Qt::Key_Down:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addDays( -1 );\n break;\n case Qt::Key_Plus:\n case Qt::Key_PageUp:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addMonths( 1 );\n break;\n case Qt::Key_Minus:\n case Qt::Key_PageDown:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addMonths( -1 );\n break;\n case Qt::Key_Equal:\n date = QDate::currentDate();\n break;\n }\n\n if ( date.isValid() && assignDate( date ) ) {\n e->accept();\n updateView();\n emit dateChanged( date );\n emit dateEntered( date );\n return;\n }\n }\n\n QComboBox::keyPressEvent( e );\n}\n\nbool KDateEdit::eventFilter( QObject *object, QEvent *event )\n{\n if ( object == lineEdit() ) {\n \/\/ We only process the focus out event if the text has changed\n \/\/ since we got focus\n if ( ( event->type() == QEvent::FocusOut ) && mTextChanged ) {\n lineEnterPressed();\n mTextChanged = false;\n } else if ( event->type() == QEvent::KeyPress ) {\n \/\/ Up and down arrow keys step the date\n QKeyEvent *keyEvent = (QKeyEvent *)event;\n\n if ( keyEvent->key() == Qt::Key_Return || keyEvent->key() == Qt::Key_Enter ) {\n lineEnterPressed();\n return true;\n }\n }\n } else {\n \/\/ It's a date picker event\n switch ( event->type() ) {\n case QEvent::MouseButtonDblClick:\n case QEvent::MouseButtonPress:\n {\n QMouseEvent *mouseEvent = (QMouseEvent*)event;\n if ( !mPopup->rect().contains( mouseEvent->pos() ) ) {\n QPoint globalPos = mPopup->mapToGlobal( mouseEvent->pos() );\n if ( QApplication::widgetAt( globalPos ) == this ) {\n \/\/ The date picker is being closed by a click on the\n \/\/ KDateEdit widget. Avoid popping it up again immediately.\n mDiscardNextMousePress = true;\n }\n }\n\n break;\n }\n default:\n break;\n }\n }\n\n return false;\n}\n\nvoid KDateEdit::mousePressEvent( QMouseEvent *event )\n{\n if ( event->button() == Qt::LeftButton && mDiscardNextMousePress ) {\n mDiscardNextMousePress = false;\n return;\n }\n\n QComboBox::mousePressEvent( event );\n}\n\nvoid KDateEdit::slotTextChanged( const QString & )\n{\n QDate date = parseDate();\n\n if ( assignDate( date ) ) {\n emit dateChanged( date );\n }\n\n mTextChanged = true;\n}\n\nvoid KDateEdit::setupKeywords()\n{\n \/\/ Create the keyword list. This will be used to match against when the user\n \/\/ enters information.\n mKeywordMap.insert( i18nc( \"the day after today\", \"tomorrow\" ), 1 );\n mKeywordMap.insert( i18nc( \"this day\", \"today\" ), 0 );\n mKeywordMap.insert( i18nc( \"the day before today\", \"yesterday\" ), -1 );\n mKeywordMap.insert( i18nc( \"the week after this week\", \"next week\" ), 7 );\n mKeywordMap.insert( i18nc( \"the month after this month\", \"next month\" ), 30 );\n\n QString dayName;\n for ( int i = 1; i <= 7; ++i ) {\n dayName = KGlobal::locale()->calendar()->weekDayName( i ).toLower();\n mKeywordMap.insert( dayName, i + 100 );\n }\n\n QCompleter *comp = new QCompleter( mKeywordMap.keys(), this );\n comp->setCaseSensitivity( Qt::CaseInsensitive );\n comp->setCompletionMode( QCompleter::InlineCompletion );\n setCompleter( comp );\n}\n\nbool KDateEdit::assignDate( const QDate &date )\n{\n mDate = date;\n mTextChanged = false;\n return true;\n}\n\nvoid KDateEdit::updateView()\n{\n QString dateString;\n if ( mDate.isValid() ) {\n dateString = KGlobal::locale()->formatDate( mDate, KLocale::ShortDate );\n }\n\n \/\/ We do not want to generate a signal here,\n \/\/ since we explicitly setting the date\n bool blocked = signalsBlocked();\n blockSignals( true );\n removeItem( 0 );\n insertItem( 0, dateString );\n blockSignals( blocked );\n}\n\n#include \"kdateedit.moc\"\n<commit_msg>Fix broken format in KDateEdit<commit_after>\/*\n This file is part of libkdepim.\n\n Copyright (c) 2002 Cornelius Schumacher <schumacher@kde.org>\n Copyright (c) 2002 David Jarvie <software@astrojar.org.uk>\n Copyright (c) 2003-2004 Reinhold Kainhofer <reinhold@kainhofer.com>\n Copyright (c) 2004 Tobias Koenig <tokoe@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n\/\/krazy:excludeall=qclasses as we want to subclass from QComboBox, not KComboBox\n\n#include \"kdateedit.h\"\n\n#include <KCalendarSystem>\n#include <KDebug>\n#include <KGlobal>\n#include <KGlobalSettings>\n#include <KLocale>\n\n#include <QAbstractItemView>\n#include <QApplication>\n#include <QCompleter>\n#include <QEvent>\n#include <QKeyEvent>\n#include <QLineEdit>\n#include <QMouseEvent>\n#include <QValidator>\n\nusing namespace KPIM;\n\nclass DateValidator : public QValidator\n{\n public:\n DateValidator( const QStringList &keywords, QWidget *parent )\n : QValidator( parent ), mKeywords( keywords )\n {}\n\n virtual State validate( QString &str, int & ) const\n {\n int length = str.length();\n\n \/\/ empty string is intermediate so one can clear the edit line and start from scratch\n if ( length <= 0 ) {\n return Intermediate;\n }\n\n if ( mKeywords.contains( str.toLower() ) ) {\n return Acceptable;\n }\n\n bool ok = false;\n KGlobal::locale()->readDate( str, &ok );\n if ( ok ) {\n return Acceptable;\n } else {\n return Intermediate;\n }\n }\n\n private:\n QStringList mKeywords;\n};\n\nKDateEdit::KDateEdit( QWidget *parent )\n : QComboBox( parent ), mReadOnly( false ), mDiscardNextMousePress( false )\n{\n \/\/ need at least one entry for popup to work\n setMaxCount( 1 );\n setEditable( true );\n\n mDate = QDate::currentDate();\n QString today = KGlobal::locale()->formatDate( mDate, KLocale::ShortDate );\n\n addItem( today );\n setCurrentIndex( 0 );\n\n connect( lineEdit(), SIGNAL(returnPressed()),\n this, SLOT(lineEnterPressed()) );\n connect( this, SIGNAL(textChanged(QString)),\n SLOT(slotTextChanged(QString)) );\n\n mPopup = new KDatePickerPopup( KDatePickerPopup::DatePicker | KDatePickerPopup::Words,\n QDate::currentDate(), this );\n mPopup->hide();\n mPopup->installEventFilter( this );\n\n connect( mPopup, SIGNAL(dateChanged(QDate)),\n SLOT(dateSelected(QDate)) );\n\n \/\/ handle keyword entry\n setupKeywords();\n lineEdit()->installEventFilter( this );\n\n setValidator( new DateValidator( mKeywordMap.keys(), this ) );\n\n mTextChanged = false;\n}\n\nKDateEdit::~KDateEdit()\n{\n}\n\nvoid KDateEdit::setDate( const QDate &date )\n{\n assignDate( date );\n updateView();\n}\n\nQDate KDateEdit::date() const\n{\n return mDate;\n}\n\nvoid KDateEdit::setReadOnly( bool readOnly )\n{\n mReadOnly = readOnly;\n lineEdit()->setReadOnly( readOnly );\n}\n\nbool KDateEdit::isReadOnly() const\n{\n return mReadOnly;\n}\n\nvoid KDateEdit::showPopup()\n{\n if ( mReadOnly ) {\n return;\n }\n\n QRect desk = KGlobalSettings::desktopGeometry( this );\n\n QPoint popupPoint = mapToGlobal( QPoint( 0, 0 ) );\n\n int dateFrameHeight = mPopup->sizeHint().height();\n if ( popupPoint.y() + height() + dateFrameHeight > desk.bottom() ) {\n popupPoint.setY( popupPoint.y() - dateFrameHeight );\n } else {\n popupPoint.setY( popupPoint.y() + height() );\n }\n\n int dateFrameWidth = mPopup->sizeHint().width();\n if ( popupPoint.x() + dateFrameWidth > desk.right() ) {\n popupPoint.setX( desk.right() - dateFrameWidth );\n }\n\n if ( popupPoint.x() < desk.left() ) {\n popupPoint.setX( desk.left() );\n }\n\n if ( popupPoint.y() < desk.top() ) {\n popupPoint.setY( desk.top() );\n }\n\n if ( mDate.isValid() ) {\n mPopup->setDate( mDate );\n } else {\n mPopup->setDate( QDate::currentDate() );\n }\n\n mPopup->popup( popupPoint );\n\n \/\/ The combo box is now shown pressed. Make it show not pressed again\n \/\/ by causing its (invisible) list box to emit a 'selected' signal.\n \/\/ First, ensure that the list box contains the date currently displayed.\n QDate date = parseDate();\n assignDate( date );\n updateView();\n\n \/\/ Now, simulate an Enter to unpress it\n QAbstractItemView *lb = view();\n if ( lb ) {\n lb->setCurrentIndex( lb->model()->index( 0, 0 ) );\n QKeyEvent *keyEvent =\n new QKeyEvent( QEvent::KeyPress, Qt::Key_Enter, Qt::NoModifier );\n QApplication::postEvent( lb, keyEvent );\n }\n}\n\nvoid KDateEdit::dateSelected( const QDate &date )\n{\n if ( assignDate( date ) ) {\n updateView();\n emit dateChanged( date );\n emit dateEntered( date );\n\n if ( date.isValid() ) {\n mPopup->hide();\n }\n }\n}\n\nvoid KDateEdit::lineEnterPressed()\n{\n bool replaced = false;\n\n QDate date = parseDate( &replaced );\n\n if ( assignDate( date ) ) {\n if ( replaced ) {\n updateView();\n }\n\n emit dateChanged( date );\n emit dateEntered( date );\n }\n}\n\nQDate KDateEdit::parseDate( bool *replaced ) const\n{\n QString text = currentText();\n QDate result;\n\n if ( replaced ) {\n (*replaced) = false;\n }\n\n if ( text.isEmpty() ) {\n result = QDate();\n } else if ( mKeywordMap.contains( text.toLower() ) ) {\n QDate today = QDate::currentDate();\n int i = mKeywordMap[ text.toLower() ];\n if ( i == 30 ) {\n today = today.addMonths( 1 );\n } else if ( i >= 100 ) {\n \/* A day name has been entered. Convert to offset from today.\n * This uses some math tricks to figure out the offset in days\n * to the next date the given day of the week occurs. There\n * are two cases, that the new day is >= the current day, which means\n * the new day has not occurred yet or that the new day < the current day,\n * which means the new day is already passed (so we need to find the\n * day in the next week).\n *\/\n i -= 100;\n int currentDay = today.dayOfWeek();\n if ( i >= currentDay ) {\n i -= currentDay;\n } else {\n i += 7 - currentDay;\n }\n }\n\n result = today.addDays( i );\n if ( replaced ) {\n (*replaced) = true;\n }\n } else {\n result = KGlobal::locale()->readDate( text );\n }\n\n return result;\n}\n\nvoid KDateEdit::focusOutEvent( QFocusEvent *e )\n{\n if ( mTextChanged ) {\n lineEnterPressed();\n mTextChanged = false;\n }\n QComboBox::focusOutEvent( e );\n}\n\nvoid KDateEdit::keyPressEvent(QKeyEvent* e)\n{\n QDate date;\n\n if ( !mReadOnly ) {\n switch ( e->key() ) {\n case Qt::Key_Up:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addDays( 1 );\n break;\n case Qt::Key_Down:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addDays( -1 );\n break;\n case Qt::Key_PageUp:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addMonths( 1 );\n break;\n case Qt::Key_PageDown:\n date = parseDate();\n if (!date.isValid()) break;\n date = date.addMonths( -1 );\n break;\n case Qt::Key_Equal:\n date = QDate::currentDate();\n break;\n }\n\n if ( date.isValid() && assignDate( date ) ) {\n e->accept();\n updateView();\n emit dateChanged( date );\n emit dateEntered( date );\n return;\n }\n }\n\n QComboBox::keyPressEvent( e );\n}\n\nbool KDateEdit::eventFilter( QObject *object, QEvent *event )\n{\n if ( object == lineEdit() ) {\n \/\/ We only process the focus out event if the text has changed\n \/\/ since we got focus\n if ( ( event->type() == QEvent::FocusOut ) && mTextChanged ) {\n lineEnterPressed();\n mTextChanged = false;\n } else if ( event->type() == QEvent::KeyPress ) {\n \/\/ Up and down arrow keys step the date\n QKeyEvent *keyEvent = (QKeyEvent *)event;\n\n if ( keyEvent->key() == Qt::Key_Return || keyEvent->key() == Qt::Key_Enter ) {\n lineEnterPressed();\n return true;\n }\n }\n } else {\n \/\/ It's a date picker event\n switch ( event->type() ) {\n case QEvent::MouseButtonDblClick:\n case QEvent::MouseButtonPress:\n {\n QMouseEvent *mouseEvent = (QMouseEvent*)event;\n if ( !mPopup->rect().contains( mouseEvent->pos() ) ) {\n QPoint globalPos = mPopup->mapToGlobal( mouseEvent->pos() );\n if ( QApplication::widgetAt( globalPos ) == this ) {\n \/\/ The date picker is being closed by a click on the\n \/\/ KDateEdit widget. Avoid popping it up again immediately.\n mDiscardNextMousePress = true;\n }\n }\n\n break;\n }\n default:\n break;\n }\n }\n\n return false;\n}\n\nvoid KDateEdit::mousePressEvent( QMouseEvent *event )\n{\n if ( event->button() == Qt::LeftButton && mDiscardNextMousePress ) {\n mDiscardNextMousePress = false;\n return;\n }\n\n QComboBox::mousePressEvent( event );\n}\n\nvoid KDateEdit::slotTextChanged( const QString & )\n{\n QDate date = parseDate();\n\n if ( assignDate( date ) ) {\n emit dateChanged( date );\n }\n\n mTextChanged = true;\n}\n\nvoid KDateEdit::setupKeywords()\n{\n \/\/ Create the keyword list. This will be used to match against when the user\n \/\/ enters information.\n mKeywordMap.insert( i18nc( \"the day after today\", \"tomorrow\" ), 1 );\n mKeywordMap.insert( i18nc( \"this day\", \"today\" ), 0 );\n mKeywordMap.insert( i18nc( \"the day before today\", \"yesterday\" ), -1 );\n mKeywordMap.insert( i18nc( \"the week after this week\", \"next week\" ), 7 );\n mKeywordMap.insert( i18nc( \"the month after this month\", \"next month\" ), 30 );\n\n QString dayName;\n for ( int i = 1; i <= 7; ++i ) {\n dayName = KGlobal::locale()->calendar()->weekDayName( i ).toLower();\n mKeywordMap.insert( dayName, i + 100 );\n }\n\n QCompleter *comp = new QCompleter( mKeywordMap.keys(), this );\n comp->setCaseSensitivity( Qt::CaseInsensitive );\n comp->setCompletionMode( QCompleter::InlineCompletion );\n setCompleter( comp );\n}\n\nbool KDateEdit::assignDate( const QDate &date )\n{\n mDate = date;\n mTextChanged = false;\n return true;\n}\n\nvoid KDateEdit::updateView()\n{\n QString dateString;\n if ( mDate.isValid() ) {\n dateString = KGlobal::locale()->formatDate( mDate, KLocale::ShortDate );\n }\n\n \/\/ We do not want to generate a signal here,\n \/\/ since we explicitly setting the date\n bool blocked = signalsBlocked();\n blockSignals( true );\n removeItem( 0 );\n insertItem( 0, dateString );\n blockSignals( blocked );\n}\n\n#include \"kdateedit.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Configuration.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_LB_CONFIG_H\n#define BENG_LB_CONFIG_H\n\n#include \"address_list.h\"\n#include \"sticky.h\"\n#include \"ssl_config.hxx\"\n\n#include <http\/status.h>\n\n#include <glib.h>\n\n#include <map>\n#include <list>\n#include <vector>\n#include <string>\n\nstruct pool;\n\nenum lb_protocol {\n LB_PROTOCOL_HTTP,\n LB_PROTOCOL_TCP,\n};\n\nstruct lb_control_config {\n const struct address_envelope *envelope;\n\n lb_control_config():envelope(nullptr) {}\n};\n\nstruct lb_monitor_config {\n std::string name;\n\n \/**\n * Time in seconds between two monitor checks.\n *\/\n unsigned interval;\n\n \/**\n * If the monitor does not produce a result after this timeout\n * [seconds], it is assumed to be negative.\n *\/\n unsigned timeout;\n\n enum class Type {\n NONE,\n PING,\n CONNECT,\n TCP_EXPECT,\n } type;\n\n \/**\n * The timeout for establishing a connection. Only applicable for\n * #Type::TCP_EXPECT. 0 means no special setting present.\n *\/\n unsigned connect_timeout;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is sent to the peer\n * after the connection has been established. May be empty.\n *\/\n std::string send;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is expected to be\n * received from the peer after the #send string has been sent.\n *\/\n std::string expect;\n\n \/**\n * For #Type::TCP_EXPECT: if that string is received from the\n * peer (instead of #expect), then the node is assumed to be\n * shutting down gracefully, and will only get sticky requests.\n *\/\n std::string fade_expect;\n\n lb_monitor_config(const char *_name)\n :name(_name),\n interval(10), timeout(0),\n type(Type::NONE),\n connect_timeout(0) {}\n};\n\nstruct lb_node_config {\n std::string name;\n\n const struct address_envelope *envelope;\n\n \/**\n * The Tomcat \"jvmRoute\" setting of this node. It is used for\n * #STICKY_JVM_ROUTE.\n *\/\n std::string jvm_route;\n\n lb_node_config(const char *_name,\n const struct address_envelope *_envelope=nullptr)\n :name(_name),\n envelope(_envelope) {}\n};\n\nstruct lb_member_config {\n const struct lb_node_config *node;\n\n unsigned port;\n\n lb_member_config():node(nullptr), port(0) {}\n};\n\nstruct lb_fallback_config {\n http_status_t status;\n\n \/**\n * The \"Location\" response header.\n *\/\n std::string location;\n\n std::string message;\n\n bool IsDefined() const {\n return !location.empty() || !message.empty();\n }\n};\n\nstruct lb_cluster_config {\n std::string name;\n\n \/**\n * The protocol that is spoken on this cluster.\n *\/\n enum lb_protocol protocol;\n\n bool mangle_via;\n\n struct lb_fallback_config fallback;\n\n enum sticky_mode sticky_mode;\n\n std::string session_cookie;\n\n const struct lb_monitor_config *monitor;\n\n std::vector<lb_member_config> members;\n\n \/**\n * A list of node addresses.\n *\/\n struct address_list address_list;\n\n lb_cluster_config(const char *_name)\n :name(_name),\n protocol(LB_PROTOCOL_HTTP),\n mangle_via(false),\n sticky_mode(STICKY_NONE),\n session_cookie(\"beng_proxy_session\"),\n monitor(nullptr) {}\n\n\n \/**\n * Returns the member index of the node with the specified\n * jvm_route value, or -1 if not found.\n *\/\n gcc_pure\n int FindJVMRoute(const char *jvm_route) const;\n};\n\nstruct lb_attribute_reference {\n enum class Type {\n METHOD,\n URI,\n HEADER,\n } type;\n\n std::string name;\n\n template<typename N>\n lb_attribute_reference(Type _type, N &&_name)\n :type(_type), name(std::forward<N>(_name)) {}\n};\n\nstruct lb_branch_config;\n\nstruct lb_goto {\n const lb_cluster_config *cluster;\n const lb_branch_config *branch;\n\n lb_goto()\n :cluster(nullptr), branch(nullptr) {}\n\n lb_goto(lb_cluster_config *_cluster)\n :cluster(_cluster), branch(nullptr) {}\n\n lb_goto(lb_branch_config *_branch)\n :cluster(nullptr), branch(_branch) {}\n\n bool IsDefined() const {\n return cluster != nullptr || branch != nullptr;\n }\n\n gcc_pure\n lb_protocol GetProtocol() const;\n\n gcc_pure\n const char *GetName() const;\n};\n\nstruct lb_condition_config {\n lb_attribute_reference attribute_reference;\n\n enum class Operator {\n EQUALS,\n REGEX,\n };\n\n Operator op;\n\n bool negate;\n\n std::string string;\n GRegex *regex;\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n const char *_string)\n :attribute_reference(std::move(a)), op(Operator::EQUALS),\n negate(_negate), string(_string) {}\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n GRegex *_regex)\n :attribute_reference(std::move(a)), op(Operator::REGEX),\n negate(_negate), regex(_regex) {}\n\n lb_condition_config(const lb_condition_config &other)\n :attribute_reference(other.attribute_reference),\n op(other.op), negate(other.negate),\n string(other.string),\n regex(other.op == Operator::REGEX\n ? g_regex_ref(other.regex)\n : nullptr) {}\n\n lb_condition_config(lb_condition_config &&other)\n :attribute_reference(std::move(other.attribute_reference)),\n op(other.op), negate(other.negate),\n string(std::move(other.string)),\n regex(other.regex) {\n other.regex = nullptr;\n }\n\n ~lb_condition_config() {\n if (regex != nullptr)\n g_regex_unref(regex);\n }\n\n gcc_pure\n bool Match(const char *value) const {\n switch (op) {\n case Operator::EQUALS:\n return (string == value) ^ negate;\n break;\n\n case Operator::REGEX:\n return g_regex_match(regex, value, GRegexMatchFlags(0),\n nullptr) ^ negate;\n break;\n }\n\n gcc_unreachable();\n }\n};\n\nstruct lb_goto_if_config {\n lb_condition_config condition;\n\n lb_goto destination;\n\n lb_goto_if_config(lb_condition_config &&c, lb_goto d)\n :condition(std::move(c)), destination(d) {}\n};\n\n\/**\n * An object that distributes connections or requests to the \"real\"\n * cluster.\n *\/\nstruct lb_branch_config {\n std::string name;\n\n lb_goto fallback;\n\n std::list<lb_goto_if_config> conditions;\n\n lb_branch_config(const char *_name)\n :name(_name) {}\n\n bool HasFallback() const {\n return fallback.IsDefined();\n }\n\n lb_protocol GetProtocol() const {\n return fallback.GetProtocol();\n }\n};\n\ninline lb_protocol\nlb_goto::GetProtocol() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->protocol\n : branch->GetProtocol();\n}\n\ninline const char *\nlb_goto::GetName() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->name.c_str()\n : branch->name.c_str();\n}\n\nstruct lb_listener_config {\n std::string name;\n\n const struct address_envelope *envelope;\n\n lb_goto destination;\n\n bool ssl;\n\n struct ssl_config ssl_config;\n\n lb_listener_config(const char *_name)\n :name(_name),\n envelope(nullptr),\n ssl(false) {\n }\n};\n\nstruct lb_config {\n std::list<lb_control_config> controls;\n\n std::map<std::string, lb_monitor_config> monitors;\n\n std::map<std::string, lb_node_config> nodes;\n\n std::map<std::string, lb_cluster_config> clusters;\n std::map<std::string, lb_branch_config> branches;\n\n std::list<lb_listener_config> listeners;\n\n template<typename T>\n gcc_pure\n const lb_monitor_config *FindMonitor(T &&t) const {\n const auto i = monitors.find(std::forward<T>(t));\n return i != monitors.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_node_config *FindNode(T &&t) const {\n const auto i = nodes.find(std::forward<T>(t));\n return i != nodes.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_cluster_config *FindCluster(T &&t) const {\n const auto i = clusters.find(std::forward<T>(t));\n return i != clusters.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_goto FindGoto(T &&t) const {\n lb_goto g;\n\n g.cluster = FindCluster(t);\n if (g.cluster == nullptr)\n g.branch = FindBranch(std::forward<T>(t));\n\n return g;\n }\n\n template<typename T>\n gcc_pure\n const lb_branch_config *FindBranch(T &&t) const {\n const auto i = branches.find(std::forward<T>(t));\n return i != branches.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_listener_config *FindListener(T &&t) const {\n for (const auto &i : listeners)\n if (i.name == t)\n return &i;\n\n return nullptr;\n }\n};\n\nG_GNUC_CONST\nstatic inline GQuark\nlb_config_quark(void)\n{\n return g_quark_from_static_string(\"lb_config\");\n}\n\n\/**\n * Load and parse the specified configuration file.\n *\/\nstruct lb_config *\nlb_config_load(struct pool *pool, const char *path, GError **error_r);\n\n#endif\n<commit_msg>lb_config: always initialise lb_condition_config::regex<commit_after>\/*\n * Configuration.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_LB_CONFIG_H\n#define BENG_LB_CONFIG_H\n\n#include \"address_list.h\"\n#include \"sticky.h\"\n#include \"ssl_config.hxx\"\n\n#include <http\/status.h>\n\n#include <glib.h>\n\n#include <map>\n#include <list>\n#include <vector>\n#include <string>\n\nstruct pool;\n\nenum lb_protocol {\n LB_PROTOCOL_HTTP,\n LB_PROTOCOL_TCP,\n};\n\nstruct lb_control_config {\n const struct address_envelope *envelope;\n\n lb_control_config():envelope(nullptr) {}\n};\n\nstruct lb_monitor_config {\n std::string name;\n\n \/**\n * Time in seconds between two monitor checks.\n *\/\n unsigned interval;\n\n \/**\n * If the monitor does not produce a result after this timeout\n * [seconds], it is assumed to be negative.\n *\/\n unsigned timeout;\n\n enum class Type {\n NONE,\n PING,\n CONNECT,\n TCP_EXPECT,\n } type;\n\n \/**\n * The timeout for establishing a connection. Only applicable for\n * #Type::TCP_EXPECT. 0 means no special setting present.\n *\/\n unsigned connect_timeout;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is sent to the peer\n * after the connection has been established. May be empty.\n *\/\n std::string send;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is expected to be\n * received from the peer after the #send string has been sent.\n *\/\n std::string expect;\n\n \/**\n * For #Type::TCP_EXPECT: if that string is received from the\n * peer (instead of #expect), then the node is assumed to be\n * shutting down gracefully, and will only get sticky requests.\n *\/\n std::string fade_expect;\n\n lb_monitor_config(const char *_name)\n :name(_name),\n interval(10), timeout(0),\n type(Type::NONE),\n connect_timeout(0) {}\n};\n\nstruct lb_node_config {\n std::string name;\n\n const struct address_envelope *envelope;\n\n \/**\n * The Tomcat \"jvmRoute\" setting of this node. It is used for\n * #STICKY_JVM_ROUTE.\n *\/\n std::string jvm_route;\n\n lb_node_config(const char *_name,\n const struct address_envelope *_envelope=nullptr)\n :name(_name),\n envelope(_envelope) {}\n};\n\nstruct lb_member_config {\n const struct lb_node_config *node;\n\n unsigned port;\n\n lb_member_config():node(nullptr), port(0) {}\n};\n\nstruct lb_fallback_config {\n http_status_t status;\n\n \/**\n * The \"Location\" response header.\n *\/\n std::string location;\n\n std::string message;\n\n bool IsDefined() const {\n return !location.empty() || !message.empty();\n }\n};\n\nstruct lb_cluster_config {\n std::string name;\n\n \/**\n * The protocol that is spoken on this cluster.\n *\/\n enum lb_protocol protocol;\n\n bool mangle_via;\n\n struct lb_fallback_config fallback;\n\n enum sticky_mode sticky_mode;\n\n std::string session_cookie;\n\n const struct lb_monitor_config *monitor;\n\n std::vector<lb_member_config> members;\n\n \/**\n * A list of node addresses.\n *\/\n struct address_list address_list;\n\n lb_cluster_config(const char *_name)\n :name(_name),\n protocol(LB_PROTOCOL_HTTP),\n mangle_via(false),\n sticky_mode(STICKY_NONE),\n session_cookie(\"beng_proxy_session\"),\n monitor(nullptr) {}\n\n\n \/**\n * Returns the member index of the node with the specified\n * jvm_route value, or -1 if not found.\n *\/\n gcc_pure\n int FindJVMRoute(const char *jvm_route) const;\n};\n\nstruct lb_attribute_reference {\n enum class Type {\n METHOD,\n URI,\n HEADER,\n } type;\n\n std::string name;\n\n template<typename N>\n lb_attribute_reference(Type _type, N &&_name)\n :type(_type), name(std::forward<N>(_name)) {}\n};\n\nstruct lb_branch_config;\n\nstruct lb_goto {\n const lb_cluster_config *cluster;\n const lb_branch_config *branch;\n\n lb_goto()\n :cluster(nullptr), branch(nullptr) {}\n\n lb_goto(lb_cluster_config *_cluster)\n :cluster(_cluster), branch(nullptr) {}\n\n lb_goto(lb_branch_config *_branch)\n :cluster(nullptr), branch(_branch) {}\n\n bool IsDefined() const {\n return cluster != nullptr || branch != nullptr;\n }\n\n gcc_pure\n lb_protocol GetProtocol() const;\n\n gcc_pure\n const char *GetName() const;\n};\n\nstruct lb_condition_config {\n lb_attribute_reference attribute_reference;\n\n enum class Operator {\n EQUALS,\n REGEX,\n };\n\n Operator op;\n\n bool negate;\n\n std::string string;\n GRegex *regex;\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n const char *_string)\n :attribute_reference(std::move(a)), op(Operator::EQUALS),\n negate(_negate), string(_string), regex(nullptr) {}\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n GRegex *_regex)\n :attribute_reference(std::move(a)), op(Operator::REGEX),\n negate(_negate), regex(_regex) {}\n\n lb_condition_config(const lb_condition_config &other)\n :attribute_reference(other.attribute_reference),\n op(other.op), negate(other.negate),\n string(other.string),\n regex(other.op == Operator::REGEX\n ? g_regex_ref(other.regex)\n : nullptr) {}\n\n lb_condition_config(lb_condition_config &&other)\n :attribute_reference(std::move(other.attribute_reference)),\n op(other.op), negate(other.negate),\n string(std::move(other.string)),\n regex(other.regex) {\n other.regex = nullptr;\n }\n\n ~lb_condition_config() {\n if (regex != nullptr)\n g_regex_unref(regex);\n }\n\n gcc_pure\n bool Match(const char *value) const {\n switch (op) {\n case Operator::EQUALS:\n return (string == value) ^ negate;\n break;\n\n case Operator::REGEX:\n return g_regex_match(regex, value, GRegexMatchFlags(0),\n nullptr) ^ negate;\n break;\n }\n\n gcc_unreachable();\n }\n};\n\nstruct lb_goto_if_config {\n lb_condition_config condition;\n\n lb_goto destination;\n\n lb_goto_if_config(lb_condition_config &&c, lb_goto d)\n :condition(std::move(c)), destination(d) {}\n};\n\n\/**\n * An object that distributes connections or requests to the \"real\"\n * cluster.\n *\/\nstruct lb_branch_config {\n std::string name;\n\n lb_goto fallback;\n\n std::list<lb_goto_if_config> conditions;\n\n lb_branch_config(const char *_name)\n :name(_name) {}\n\n bool HasFallback() const {\n return fallback.IsDefined();\n }\n\n lb_protocol GetProtocol() const {\n return fallback.GetProtocol();\n }\n};\n\ninline lb_protocol\nlb_goto::GetProtocol() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->protocol\n : branch->GetProtocol();\n}\n\ninline const char *\nlb_goto::GetName() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->name.c_str()\n : branch->name.c_str();\n}\n\nstruct lb_listener_config {\n std::string name;\n\n const struct address_envelope *envelope;\n\n lb_goto destination;\n\n bool ssl;\n\n struct ssl_config ssl_config;\n\n lb_listener_config(const char *_name)\n :name(_name),\n envelope(nullptr),\n ssl(false) {\n }\n};\n\nstruct lb_config {\n std::list<lb_control_config> controls;\n\n std::map<std::string, lb_monitor_config> monitors;\n\n std::map<std::string, lb_node_config> nodes;\n\n std::map<std::string, lb_cluster_config> clusters;\n std::map<std::string, lb_branch_config> branches;\n\n std::list<lb_listener_config> listeners;\n\n template<typename T>\n gcc_pure\n const lb_monitor_config *FindMonitor(T &&t) const {\n const auto i = monitors.find(std::forward<T>(t));\n return i != monitors.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_node_config *FindNode(T &&t) const {\n const auto i = nodes.find(std::forward<T>(t));\n return i != nodes.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_cluster_config *FindCluster(T &&t) const {\n const auto i = clusters.find(std::forward<T>(t));\n return i != clusters.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_goto FindGoto(T &&t) const {\n lb_goto g;\n\n g.cluster = FindCluster(t);\n if (g.cluster == nullptr)\n g.branch = FindBranch(std::forward<T>(t));\n\n return g;\n }\n\n template<typename T>\n gcc_pure\n const lb_branch_config *FindBranch(T &&t) const {\n const auto i = branches.find(std::forward<T>(t));\n return i != branches.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_listener_config *FindListener(T &&t) const {\n for (const auto &i : listeners)\n if (i.name == t)\n return &i;\n\n return nullptr;\n }\n};\n\nG_GNUC_CONST\nstatic inline GQuark\nlb_config_quark(void)\n{\n return g_quark_from_static_string(\"lb_config\");\n}\n\n\/**\n * Load and parse the specified configuration file.\n *\/\nstruct lb_config *\nlb_config_load(struct pool *pool, const char *path, GError **error_r);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Configuration.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_LB_CONFIG_H\n#define BENG_LB_CONFIG_H\n\n#include \"address_list.hxx\"\n#include \"sticky.h\"\n#include \"ssl_config.hxx\"\n#include \"net\/AllocatedSocketAddress.hxx\"\n\n#include <http\/status.h>\n\n#include <glib.h>\n\n#include <map>\n#include <list>\n#include <vector>\n#include <string>\n\nstruct pool;\nclass Error;\n\nenum lb_protocol {\n LB_PROTOCOL_HTTP,\n LB_PROTOCOL_TCP,\n};\n\nstruct lb_control_config {\n AllocatedSocketAddress bind_address;\n};\n\nstruct lb_monitor_config {\n std::string name;\n\n \/**\n * Time in seconds between two monitor checks.\n *\/\n unsigned interval = 10;\n\n \/**\n * If the monitor does not produce a result after this timeout\n * [seconds], it is assumed to be negative.\n *\/\n unsigned timeout = 0;\n\n enum class Type {\n NONE,\n PING,\n CONNECT,\n TCP_EXPECT,\n } type = Type::NONE;\n\n \/**\n * The timeout for establishing a connection. Only applicable for\n * #Type::TCP_EXPECT. 0 means no special setting present.\n *\/\n unsigned connect_timeout = 0;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is sent to the peer\n * after the connection has been established. May be empty.\n *\/\n std::string send;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is expected to be\n * received from the peer after the #send string has been sent.\n *\/\n std::string expect;\n\n \/**\n * For #Type::TCP_EXPECT: if that string is received from the\n * peer (instead of #expect), then the node is assumed to be\n * shutting down gracefully, and will only get sticky requests.\n *\/\n std::string fade_expect;\n\n explicit lb_monitor_config(const char *_name)\n :name(_name) {}\n};\n\nstruct lb_node_config {\n std::string name;\n\n AllocatedSocketAddress address;\n\n \/**\n * The Tomcat \"jvmRoute\" setting of this node. It is used for\n * #STICKY_JVM_ROUTE.\n *\/\n std::string jvm_route;\n\n explicit lb_node_config(const char *_name)\n :name(_name) {}\n\n lb_node_config(const char *_name, AllocatedSocketAddress &&_address)\n :name(_name), address(std::move(_address)) {}\n\n lb_node_config(lb_node_config &&src)\n :name(std::move(src.name)), address(std::move(src.address)),\n jvm_route(std::move(src.jvm_route)) {}\n};\n\nstruct lb_member_config {\n const struct lb_node_config *node = nullptr;\n\n unsigned port = 0;\n};\n\nstruct lb_fallback_config {\n http_status_t status;\n\n \/**\n * The \"Location\" response header.\n *\/\n std::string location;\n\n std::string message;\n\n bool IsDefined() const {\n return !location.empty() || !message.empty();\n }\n};\n\nstruct lb_cluster_config {\n std::string name;\n\n \/**\n * The protocol that is spoken on this cluster.\n *\/\n enum lb_protocol protocol = LB_PROTOCOL_HTTP;\n\n \/**\n * Use the client's source IP for the connection to the backend?\n * This is implemented using IP_TRANSPARENT and requires the\n * \"tproxy\" Linux kernel module.\n *\/\n bool transparent_source = false;\n\n bool mangle_via = false;\n\n struct lb_fallback_config fallback;\n\n enum sticky_mode sticky_mode = STICKY_NONE;\n\n std::string session_cookie = \"beng_proxy_session\";\n\n const struct lb_monitor_config *monitor = nullptr;\n\n std::vector<lb_member_config> members;\n\n \/**\n * A list of node addresses.\n *\/\n AddressList address_list;\n\n explicit lb_cluster_config(const char *_name)\n :name(_name) {}\n\n \/**\n * Returns the member index of the node with the specified\n * jvm_route value, or -1 if not found.\n *\/\n gcc_pure\n int FindJVMRoute(const char *jvm_route) const;\n};\n\nstruct lb_attribute_reference {\n enum class Type {\n METHOD,\n URI,\n HEADER,\n } type;\n\n std::string name;\n\n template<typename N>\n lb_attribute_reference(Type _type, N &&_name)\n :type(_type), name(std::forward<N>(_name)) {}\n};\n\nstruct lb_branch_config;\n\nstruct lb_goto {\n const lb_cluster_config *cluster = nullptr;\n const lb_branch_config *branch = nullptr;\n\n lb_goto() = default;\n\n explicit lb_goto(lb_cluster_config *_cluster)\n :cluster(_cluster), branch(nullptr) {}\n\n explicit lb_goto(lb_branch_config *_branch)\n :cluster(nullptr), branch(_branch) {}\n\n bool IsDefined() const {\n return cluster != nullptr || branch != nullptr;\n }\n\n gcc_pure\n lb_protocol GetProtocol() const;\n\n gcc_pure\n const char *GetName() const;\n};\n\nstruct lb_condition_config {\n lb_attribute_reference attribute_reference;\n\n enum class Operator {\n EQUALS,\n REGEX,\n };\n\n Operator op;\n\n bool negate;\n\n std::string string;\n GRegex *regex = nullptr;\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n const char *_string)\n :attribute_reference(std::move(a)), op(Operator::EQUALS),\n negate(_negate), string(_string) {}\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n GRegex *_regex)\n :attribute_reference(std::move(a)), op(Operator::REGEX),\n negate(_negate), regex(_regex) {}\n\n lb_condition_config(lb_condition_config &&other)\n :attribute_reference(std::move(other.attribute_reference)),\n op(other.op), negate(other.negate),\n string(std::move(other.string)),\n regex(other.regex) {\n other.regex = nullptr;\n }\n\n ~lb_condition_config() {\n if (regex != nullptr)\n g_regex_unref(regex);\n }\n\n lb_condition_config(const lb_condition_config &) = delete;\n lb_condition_config &operator=(const lb_condition_config &) = delete;\n\n gcc_pure\n bool Match(const char *value) const {\n switch (op) {\n case Operator::EQUALS:\n return (string == value) ^ negate;\n break;\n\n case Operator::REGEX:\n return g_regex_match(regex, value, GRegexMatchFlags(0),\n nullptr) ^ negate;\n break;\n }\n\n gcc_unreachable();\n }\n};\n\nstruct lb_goto_if_config {\n lb_condition_config condition;\n\n lb_goto destination;\n\n lb_goto_if_config(lb_condition_config &&c, lb_goto d)\n :condition(std::move(c)), destination(d) {}\n};\n\n\/**\n * An object that distributes connections or requests to the \"real\"\n * cluster.\n *\/\nstruct lb_branch_config {\n std::string name;\n\n lb_goto fallback;\n\n std::list<lb_goto_if_config> conditions;\n\n explicit lb_branch_config(const char *_name)\n :name(_name) {}\n\n lb_branch_config(lb_branch_config &&) = default;\n\n lb_branch_config(const lb_branch_config &) = delete;\n lb_branch_config &operator=(const lb_branch_config &) = delete;\n\n bool HasFallback() const {\n return fallback.IsDefined();\n }\n\n lb_protocol GetProtocol() const {\n return fallback.GetProtocol();\n }\n};\n\ninline lb_protocol\nlb_goto::GetProtocol() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->protocol\n : branch->GetProtocol();\n}\n\ninline const char *\nlb_goto::GetName() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->name.c_str()\n : branch->name.c_str();\n}\n\nstruct lb_listener_config {\n std::string name;\n\n AllocatedSocketAddress bind_address;\n\n lb_goto destination;\n\n bool verbose_response = false;\n\n bool ssl = false;\n\n struct ssl_config ssl_config;\n\n explicit lb_listener_config(const char *_name)\n :name(_name) {}\n};\n\nstruct lb_config {\n std::list<lb_control_config> controls;\n\n std::map<std::string, lb_monitor_config> monitors;\n\n std::map<std::string, lb_node_config> nodes;\n\n std::map<std::string, lb_cluster_config> clusters;\n std::map<std::string, lb_branch_config> branches;\n\n std::list<lb_listener_config> listeners;\n\n template<typename T>\n gcc_pure\n const lb_monitor_config *FindMonitor(T &&t) const {\n const auto i = monitors.find(std::forward<T>(t));\n return i != monitors.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_node_config *FindNode(T &&t) const {\n const auto i = nodes.find(std::forward<T>(t));\n return i != nodes.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_cluster_config *FindCluster(T &&t) const {\n const auto i = clusters.find(std::forward<T>(t));\n return i != clusters.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_goto FindGoto(T &&t) const {\n lb_goto g;\n\n g.cluster = FindCluster(t);\n if (g.cluster == nullptr)\n g.branch = FindBranch(std::forward<T>(t));\n\n return g;\n }\n\n template<typename T>\n gcc_pure\n const lb_branch_config *FindBranch(T &&t) const {\n const auto i = branches.find(std::forward<T>(t));\n return i != branches.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_listener_config *FindListener(T &&t) const {\n for (const auto &i : listeners)\n if (i.name == t)\n return &i;\n\n return nullptr;\n }\n};\n\n\/**\n * Load and parse the specified configuration file.\n *\/\nstruct lb_config *\nlb_config_load(struct pool *pool, const char *path, Error &error_r);\n\n#endif\n<commit_msg>lb_config: remove useless \"break\" statements<commit_after>\/*\n * Configuration.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_LB_CONFIG_H\n#define BENG_LB_CONFIG_H\n\n#include \"address_list.hxx\"\n#include \"sticky.h\"\n#include \"ssl_config.hxx\"\n#include \"net\/AllocatedSocketAddress.hxx\"\n\n#include <http\/status.h>\n\n#include <glib.h>\n\n#include <map>\n#include <list>\n#include <vector>\n#include <string>\n\nstruct pool;\nclass Error;\n\nenum lb_protocol {\n LB_PROTOCOL_HTTP,\n LB_PROTOCOL_TCP,\n};\n\nstruct lb_control_config {\n AllocatedSocketAddress bind_address;\n};\n\nstruct lb_monitor_config {\n std::string name;\n\n \/**\n * Time in seconds between two monitor checks.\n *\/\n unsigned interval = 10;\n\n \/**\n * If the monitor does not produce a result after this timeout\n * [seconds], it is assumed to be negative.\n *\/\n unsigned timeout = 0;\n\n enum class Type {\n NONE,\n PING,\n CONNECT,\n TCP_EXPECT,\n } type = Type::NONE;\n\n \/**\n * The timeout for establishing a connection. Only applicable for\n * #Type::TCP_EXPECT. 0 means no special setting present.\n *\/\n unsigned connect_timeout = 0;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is sent to the peer\n * after the connection has been established. May be empty.\n *\/\n std::string send;\n\n \/**\n * For #Type::TCP_EXPECT: a string that is expected to be\n * received from the peer after the #send string has been sent.\n *\/\n std::string expect;\n\n \/**\n * For #Type::TCP_EXPECT: if that string is received from the\n * peer (instead of #expect), then the node is assumed to be\n * shutting down gracefully, and will only get sticky requests.\n *\/\n std::string fade_expect;\n\n explicit lb_monitor_config(const char *_name)\n :name(_name) {}\n};\n\nstruct lb_node_config {\n std::string name;\n\n AllocatedSocketAddress address;\n\n \/**\n * The Tomcat \"jvmRoute\" setting of this node. It is used for\n * #STICKY_JVM_ROUTE.\n *\/\n std::string jvm_route;\n\n explicit lb_node_config(const char *_name)\n :name(_name) {}\n\n lb_node_config(const char *_name, AllocatedSocketAddress &&_address)\n :name(_name), address(std::move(_address)) {}\n\n lb_node_config(lb_node_config &&src)\n :name(std::move(src.name)), address(std::move(src.address)),\n jvm_route(std::move(src.jvm_route)) {}\n};\n\nstruct lb_member_config {\n const struct lb_node_config *node = nullptr;\n\n unsigned port = 0;\n};\n\nstruct lb_fallback_config {\n http_status_t status;\n\n \/**\n * The \"Location\" response header.\n *\/\n std::string location;\n\n std::string message;\n\n bool IsDefined() const {\n return !location.empty() || !message.empty();\n }\n};\n\nstruct lb_cluster_config {\n std::string name;\n\n \/**\n * The protocol that is spoken on this cluster.\n *\/\n enum lb_protocol protocol = LB_PROTOCOL_HTTP;\n\n \/**\n * Use the client's source IP for the connection to the backend?\n * This is implemented using IP_TRANSPARENT and requires the\n * \"tproxy\" Linux kernel module.\n *\/\n bool transparent_source = false;\n\n bool mangle_via = false;\n\n struct lb_fallback_config fallback;\n\n enum sticky_mode sticky_mode = STICKY_NONE;\n\n std::string session_cookie = \"beng_proxy_session\";\n\n const struct lb_monitor_config *monitor = nullptr;\n\n std::vector<lb_member_config> members;\n\n \/**\n * A list of node addresses.\n *\/\n AddressList address_list;\n\n explicit lb_cluster_config(const char *_name)\n :name(_name) {}\n\n \/**\n * Returns the member index of the node with the specified\n * jvm_route value, or -1 if not found.\n *\/\n gcc_pure\n int FindJVMRoute(const char *jvm_route) const;\n};\n\nstruct lb_attribute_reference {\n enum class Type {\n METHOD,\n URI,\n HEADER,\n } type;\n\n std::string name;\n\n template<typename N>\n lb_attribute_reference(Type _type, N &&_name)\n :type(_type), name(std::forward<N>(_name)) {}\n};\n\nstruct lb_branch_config;\n\nstruct lb_goto {\n const lb_cluster_config *cluster = nullptr;\n const lb_branch_config *branch = nullptr;\n\n lb_goto() = default;\n\n explicit lb_goto(lb_cluster_config *_cluster)\n :cluster(_cluster), branch(nullptr) {}\n\n explicit lb_goto(lb_branch_config *_branch)\n :cluster(nullptr), branch(_branch) {}\n\n bool IsDefined() const {\n return cluster != nullptr || branch != nullptr;\n }\n\n gcc_pure\n lb_protocol GetProtocol() const;\n\n gcc_pure\n const char *GetName() const;\n};\n\nstruct lb_condition_config {\n lb_attribute_reference attribute_reference;\n\n enum class Operator {\n EQUALS,\n REGEX,\n };\n\n Operator op;\n\n bool negate;\n\n std::string string;\n GRegex *regex = nullptr;\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n const char *_string)\n :attribute_reference(std::move(a)), op(Operator::EQUALS),\n negate(_negate), string(_string) {}\n\n lb_condition_config(lb_attribute_reference &&a, bool _negate,\n GRegex *_regex)\n :attribute_reference(std::move(a)), op(Operator::REGEX),\n negate(_negate), regex(_regex) {}\n\n lb_condition_config(lb_condition_config &&other)\n :attribute_reference(std::move(other.attribute_reference)),\n op(other.op), negate(other.negate),\n string(std::move(other.string)),\n regex(other.regex) {\n other.regex = nullptr;\n }\n\n ~lb_condition_config() {\n if (regex != nullptr)\n g_regex_unref(regex);\n }\n\n lb_condition_config(const lb_condition_config &) = delete;\n lb_condition_config &operator=(const lb_condition_config &) = delete;\n\n gcc_pure\n bool Match(const char *value) const {\n switch (op) {\n case Operator::EQUALS:\n return (string == value) ^ negate;\n\n case Operator::REGEX:\n return g_regex_match(regex, value, GRegexMatchFlags(0),\n nullptr) ^ negate;\n }\n\n gcc_unreachable();\n }\n};\n\nstruct lb_goto_if_config {\n lb_condition_config condition;\n\n lb_goto destination;\n\n lb_goto_if_config(lb_condition_config &&c, lb_goto d)\n :condition(std::move(c)), destination(d) {}\n};\n\n\/**\n * An object that distributes connections or requests to the \"real\"\n * cluster.\n *\/\nstruct lb_branch_config {\n std::string name;\n\n lb_goto fallback;\n\n std::list<lb_goto_if_config> conditions;\n\n explicit lb_branch_config(const char *_name)\n :name(_name) {}\n\n lb_branch_config(lb_branch_config &&) = default;\n\n lb_branch_config(const lb_branch_config &) = delete;\n lb_branch_config &operator=(const lb_branch_config &) = delete;\n\n bool HasFallback() const {\n return fallback.IsDefined();\n }\n\n lb_protocol GetProtocol() const {\n return fallback.GetProtocol();\n }\n};\n\ninline lb_protocol\nlb_goto::GetProtocol() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->protocol\n : branch->GetProtocol();\n}\n\ninline const char *\nlb_goto::GetName() const\n{\n assert(IsDefined());\n\n return cluster != nullptr\n ? cluster->name.c_str()\n : branch->name.c_str();\n}\n\nstruct lb_listener_config {\n std::string name;\n\n AllocatedSocketAddress bind_address;\n\n lb_goto destination;\n\n bool verbose_response = false;\n\n bool ssl = false;\n\n struct ssl_config ssl_config;\n\n explicit lb_listener_config(const char *_name)\n :name(_name) {}\n};\n\nstruct lb_config {\n std::list<lb_control_config> controls;\n\n std::map<std::string, lb_monitor_config> monitors;\n\n std::map<std::string, lb_node_config> nodes;\n\n std::map<std::string, lb_cluster_config> clusters;\n std::map<std::string, lb_branch_config> branches;\n\n std::list<lb_listener_config> listeners;\n\n template<typename T>\n gcc_pure\n const lb_monitor_config *FindMonitor(T &&t) const {\n const auto i = monitors.find(std::forward<T>(t));\n return i != monitors.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_node_config *FindNode(T &&t) const {\n const auto i = nodes.find(std::forward<T>(t));\n return i != nodes.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_cluster_config *FindCluster(T &&t) const {\n const auto i = clusters.find(std::forward<T>(t));\n return i != clusters.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_goto FindGoto(T &&t) const {\n lb_goto g;\n\n g.cluster = FindCluster(t);\n if (g.cluster == nullptr)\n g.branch = FindBranch(std::forward<T>(t));\n\n return g;\n }\n\n template<typename T>\n gcc_pure\n const lb_branch_config *FindBranch(T &&t) const {\n const auto i = branches.find(std::forward<T>(t));\n return i != branches.end()\n ? &i->second\n : nullptr;\n }\n\n template<typename T>\n gcc_pure\n const lb_listener_config *FindListener(T &&t) const {\n for (const auto &i : listeners)\n if (i.name == t)\n return &i;\n\n return nullptr;\n }\n};\n\n\/**\n * Load and parse the specified configuration file.\n *\/\nstruct lb_config *\nlb_config_load(struct pool *pool, const char *path, Error &error_r);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"Array.h\"\n#include \"Runtime.h\"\n#include \"SnowString.h\"\n#include \"Function.h\"\n#include <sstream>\n\n#define DEFAULT_ARRAY_LENGTH 8\n\nnamespace snow {\n\tGC_ROOTS_IMPL(Array) {\n\t\tGC_SUPER(Object);\n\t\t\n\t\tGC_ROOT(m_Data);\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tGC_ROOT(m_Data[i]);\n\t\t}\n\t}\n\n\tvoid Array::resize(size_t new_size) {\n\t\t\/\/ TODO: Grow more than strictly necessary to minimize allocations\n\t\tVALUE* old_pointer = m_Data;\n\t\tm_Data = new(kGarbage, kBlob) VALUE[new_size];\n\t\tm_AllocatedSize = new_size;\n\t\tif (m_Length != 0 && old_pointer) {\n\t\t\tmemcpy(m_Data, old_pointer, m_Length*sizeof(VALUE));\n\t\t}\n\t}\n\t\n\tArray::Array(size_t preallocate_length) : Object(array_prototype()), m_Data(NULL), m_Length(0), m_AllocatedSize(0) {\n\t\tif (preallocate_length == 0)\n\t\t\tpreallocate_length = DEFAULT_ARRAY_LENGTH;\n\t\tresize(preallocate_length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(const Array& other) : Object(array_prototype()), m_Data(other.m_Data), m_Length(other.m_Length), m_AllocatedSize(0) {\n\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(VALUE* existing_array, size_t len, bool copy) : Object(array_prototype()), m_Data(existing_array), m_Length(len), m_AllocatedSize(0) {\n\t\tif (copy)\n\t\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tvoid Array::ensure_length(size_t len) {\n\t\tASSERT(!is_frozen());\n\t\tif (len * sizeof(VALUE) <= m_AllocatedSize)\n\t\t\treturn;\n\t\tresize(len * sizeof(VALUE));\n\t}\n\t\n\tVALUE& Array::operator[](int64_t idx) {\n\t\tif (idx < 0)\n\t\t\tidx %= m_Length;\n\t\tif (idx >= (int64_t)m_Length)\n\t\t{\n\t\t\tensure_length(idx+1);\n\t\t\tauto old_length = m_Length;\n\t\t\tm_Length = idx+1;\n\t\t\tfor (size_t i = old_length; i < m_Length; ++i) {\n\t\t\t\tm_Data[i] = nil();\n\t\t\t}\n\t\t}\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::operator[](int64_t idx) const {\n\t\tif (idx < 0)\n\t\t\tidx = m_Length + idx;\n\t\tif (idx < 0 || idx >= (int64_t)m_Length)\n\t\t\treturn nil();\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::push(VALUE val) {\n\t\tensure_length(m_Length + 1);\n\t\tm_Data[m_Length] = val;\n\t\t++m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::pop() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[m_Length-1];\n\t\t--m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::unshift(VALUE val) {\n\t\tensure_length(m_Length+1);\n\t\t\/\/ XXX: For some reason, memmove doesn't work here. Investigate!\n\t\t\/\/ Also, this might be acceptable, since it's faster than memmove.\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tm_Data[m_Length-i] = m_Data[m_Length-1-i];\n\t\t}\n\t\t++m_Length;\n\t\tm_Data[0] = val;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::shift() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[0];\n\t\t--m_Length;\n\t\tmemmove(m_Data, &m_Data[1], m_Length);\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::va_call(VALUE self, uint64_t num_args, va_list& args) {\n\t\tif (num_args == 0)\n\t\t\treturn this;\n\t\tif (num_args == 1) {\n\t\t\tint64_t index = integer(va_arg(args, VALUE));\n\t\t\treturn (*this)[index];\n\t\t}\n\t\t\/\/ TODO: ranges and such.\n\t\tTRAP();\n\t\treturn this;\n\t}\n\t\n\tstatic VALUE array_new(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\treturn new Array(args, num_args);\n\t}\n\t\n\tstatic VALUE array_get(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tint64_t idx = integer(args[0]);\n\t\treturn (*array)[idx];\n\t}\n\t\n\tstatic VALUE array_set(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 2);\n\t\tauto array = object_cast<Array>(self);\n\t\tint idx = integer(args[0]);\n\t\tVALUE new_value = args[1];\n\t\treturn array->set_by_index(idx, new_value);\n\t}\n\t\n\tstatic VALUE array_each(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args >= 1);\n\t\tauto array = object_cast<Array>(self);\n\t\t\n\t\tVALUE closure = args[0];\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tsnow::call(NULL, closure, 2, (*array)[i], value((int64_t)i));\n\t\t}\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_length(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn value((int64_t)array->length());\n\t}\n\t\n\tstatic VALUE array_inspect(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\tstd::stringstream ss;\n\t\t\n\t\tif (array->length() == 0) {\n\t\t\tss << \"()\";\n\t\t} else {\n\t\t\tss << \"(\";\n\t\t\tfor (size_t i = 0; i < array->length() - 1; ++i) {\n\t\t\t\tss << value_to_string((*array)[i]) << \", \";\n\t\t\t}\n\t\t\tss << value_to_string((*array)[array->length()-1]) << \")\";\n\t\t}\n\t\t\n\t\treturn new String(ss.str());\n\t}\n\t\n\tstatic VALUE array_push(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\tarray->push(val);\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_pop(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->pop();\n\t}\n\t\n\tstatic VALUE array_unshift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\treturn array->unshift(val);\n\t}\n\t\n\tstatic VALUE array_shift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->shift();\n\t}\n\t\n\tObject* array_prototype() {\n\t\tstatic Object* proto = NULL;\n\t\tif (proto) return proto;\n\t\tproto = new(kMalloc) Object;\n\t\tproto->set_by_string(\"new\", new Function(array_new));\n\t\tproto->set_by_string(\"get\", new Function(array_get));\n\t\tproto->set_by_string(\"set\", new Function(array_set));\n\t\tproto->set_by_string(\"each\", new Function(array_each));\n\t\tproto->set_by_string(\"push\", new Function(array_push));\t\t\n\t\tproto->set_by_string(\"pop\", new Function(array_pop));\n\t\tproto->set_by_string(\"unshift\", new Function(array_unshift));\n\t\tproto->set_by_string(\"shift\", new Function(array_shift));\n\t\tproto->set_by_string(\"length\", new Function(array_length));\n\t\tproto->set_by_string(\"inspect\", new Function(array_inspect));\n\t\tproto->set_by_string(\"<<\", new Function(array_push));\n\t\treturn proto;\n\t}\n}\n<commit_msg>fixed Array.inspect to use inspect on its members. Breaks if the array is recursive.<commit_after>#include \"Array.h\"\n#include \"Runtime.h\"\n#include \"SnowString.h\"\n#include \"Function.h\"\n#include <sstream>\n\n#define DEFAULT_ARRAY_LENGTH 8\n\nnamespace snow {\n\tGC_ROOTS_IMPL(Array) {\n\t\tGC_SUPER(Object);\n\t\t\n\t\tGC_ROOT(m_Data);\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tGC_ROOT(m_Data[i]);\n\t\t}\n\t}\n\n\tvoid Array::resize(size_t new_size) {\n\t\t\/\/ TODO: Grow more than strictly necessary to minimize allocations\n\t\tVALUE* old_pointer = m_Data;\n\t\tm_Data = new(kGarbage, kBlob) VALUE[new_size];\n\t\tm_AllocatedSize = new_size;\n\t\tif (m_Length != 0 && old_pointer) {\n\t\t\tmemcpy(m_Data, old_pointer, m_Length*sizeof(VALUE));\n\t\t}\n\t}\n\t\n\tArray::Array(size_t preallocate_length) : Object(array_prototype()), m_Data(NULL), m_Length(0), m_AllocatedSize(0) {\n\t\tif (preallocate_length == 0)\n\t\t\tpreallocate_length = DEFAULT_ARRAY_LENGTH;\n\t\tresize(preallocate_length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(const Array& other) : Object(array_prototype()), m_Data(other.m_Data), m_Length(other.m_Length), m_AllocatedSize(0) {\n\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tArray::Array(VALUE* existing_array, size_t len, bool copy) : Object(array_prototype()), m_Data(existing_array), m_Length(len), m_AllocatedSize(0) {\n\t\tif (copy)\n\t\t\tresize(m_Length * sizeof(VALUE));\n\t}\n\t\n\tvoid Array::ensure_length(size_t len) {\n\t\tASSERT(!is_frozen());\n\t\tif (len * sizeof(VALUE) <= m_AllocatedSize)\n\t\t\treturn;\n\t\tresize(len * sizeof(VALUE));\n\t}\n\t\n\tVALUE& Array::operator[](int64_t idx) {\n\t\tif (idx < 0)\n\t\t\tidx %= m_Length;\n\t\tif (idx >= (int64_t)m_Length)\n\t\t{\n\t\t\tensure_length(idx+1);\n\t\t\tauto old_length = m_Length;\n\t\t\tm_Length = idx+1;\n\t\t\tfor (size_t i = old_length; i < m_Length; ++i) {\n\t\t\t\tm_Data[i] = nil();\n\t\t\t}\n\t\t}\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::operator[](int64_t idx) const {\n\t\tif (idx < 0)\n\t\t\tidx = m_Length + idx;\n\t\tif (idx < 0 || idx >= (int64_t)m_Length)\n\t\t\treturn nil();\n\t\treturn m_Data[idx];\n\t}\n\t\n\tVALUE Array::push(VALUE val) {\n\t\tensure_length(m_Length + 1);\n\t\tm_Data[m_Length] = val;\n\t\t++m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::pop() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[m_Length-1];\n\t\t--m_Length;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::unshift(VALUE val) {\n\t\tensure_length(m_Length+1);\n\t\t\/\/ XXX: For some reason, memmove doesn't work here. Investigate!\n\t\t\/\/ Also, this might be acceptable, since it's faster than memmove.\n\t\tfor (size_t i = 0; i < m_Length; ++i) {\n\t\t\tm_Data[m_Length-i] = m_Data[m_Length-1-i];\n\t\t}\n\t\t++m_Length;\n\t\tm_Data[0] = val;\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::shift() {\n\t\tASSERT(!is_frozen());\n\t\tif (m_Length == 0)\n\t\t\treturn nil();\n\t\tVALUE val = m_Data[0];\n\t\t--m_Length;\n\t\tmemmove(m_Data, &m_Data[1], m_Length);\n\t\treturn val;\n\t}\n\t\n\tVALUE Array::va_call(VALUE self, uint64_t num_args, va_list& args) {\n\t\tif (num_args == 0)\n\t\t\treturn this;\n\t\tif (num_args == 1) {\n\t\t\tint64_t index = integer(va_arg(args, VALUE));\n\t\t\treturn (*this)[index];\n\t\t}\n\t\t\/\/ TODO: ranges and such.\n\t\tTRAP();\n\t\treturn this;\n\t}\n\t\n\tstatic VALUE array_new(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\treturn new Array(args, num_args);\n\t}\n\t\n\tstatic VALUE array_get(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tint64_t idx = integer(args[0]);\n\t\treturn (*array)[idx];\n\t}\n\t\n\tstatic VALUE array_set(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 2);\n\t\tauto array = object_cast<Array>(self);\n\t\tint idx = integer(args[0]);\n\t\tVALUE new_value = args[1];\n\t\treturn array->set_by_index(idx, new_value);\n\t}\n\t\n\tstatic VALUE array_each(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args >= 1);\n\t\tauto array = object_cast<Array>(self);\n\t\t\n\t\tVALUE closure = args[0];\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tsnow::call(NULL, closure, 2, (*array)[i], value((int64_t)i));\n\t\t}\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_length(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn value((int64_t)array->length());\n\t}\n\t\n\tstatic VALUE array_inspect(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tauto array = object_cast<Array>(self);\n\t\tstd::stringstream ss;\n\t\t\n\t\tss << \"@(\";\n\t\tfor (size_t i = 0; i < array->length(); ++i) {\n\t\t\tss << value_to_string(snow::call_method((*array)[i], \"inspect\", 0));\n\t\t\tif (i != array->length() - 1)\n\t\t\t\tss << \", \";\n\t\t}\n\t\tss << \")\";\n\t\t\n\t\treturn new String(ss.str());\n\t}\n\t\n\tstatic VALUE array_push(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\tarray->push(val);\n\t\treturn self;\n\t}\n\t\n\tstatic VALUE array_pop(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->pop();\n\t}\n\t\n\tstatic VALUE array_unshift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 1);\n\t\tauto array = object_cast<Array>(self);\n\t\tVALUE val = args[0];\n\t\treturn array->unshift(val);\n\t}\n\t\n\tstatic VALUE array_shift(VALUE self, uint64_t num_args, VALUE* args) {\n\t\tNORMAL_SCOPE();\n\t\tASSERT_OBJECT(self, Array);\n\t\tASSERT_ARGS(num_args == 0);\n\t\tauto array = object_cast<Array>(self);\n\t\treturn array->shift();\n\t}\n\t\n\tObject* array_prototype() {\n\t\tstatic Object* proto = NULL;\n\t\tif (proto) return proto;\n\t\tproto = new(kMalloc) Object;\n\t\tproto->set_by_string(\"new\", new Function(array_new));\n\t\tproto->set_by_string(\"get\", new Function(array_get));\n\t\tproto->set_by_string(\"set\", new Function(array_set));\n\t\tproto->set_by_string(\"each\", new Function(array_each));\n\t\tproto->set_by_string(\"push\", new Function(array_push));\t\t\n\t\tproto->set_by_string(\"pop\", new Function(array_pop));\n\t\tproto->set_by_string(\"unshift\", new Function(array_unshift));\n\t\tproto->set_by_string(\"shift\", new Function(array_shift));\n\t\tproto->set_by_string(\"length\", new Function(array_length));\n\t\tproto->set_by_string(\"inspect\", new Function(array_inspect));\n\t\tproto->set_by_string(\"<<\", new Function(array_push));\n\t\treturn proto;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"novo.h\"\n\n#include <novo\/io.h>\n#include <novo\/entities\/randomcubes.h>\n#include <novo\/entities\/origin.h>\n#include <novo\/gfx\/gl\/names.h>\n#include <novo\/gfx\/framebuffer.h>\n#include <novo\/gfx\/window.h>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n\n#include <glbinding\/Binding.h>\n\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtc\/quaternion.hpp>\n\n#include <iostream>\n#include <thread>\n\nusing namespace novo;\nusing namespace graphics;\n\nusing namespace std::chrono;\nusing namespace std::placeholders;\nusing std::string;\nusing std::bind;\n\nusing boost::program_options::variables_map;\nusing boost::format;\nusing boost::ptr_list;\n\nstatic void glfwErrorCB(int code, const char* msg);\nstatic void glErrorCB(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar* message, const void* userParam);\n\nformat fmtTitle(APPNAME\" - FPS: %d ::S: %d\");\n\nNovo::Novo(variables_map opts):\n\twindow(new Window(800, 600, APPNAME))\n{\n\t\/\/ GLFW\n\tglfwSetErrorCallback(glfwErrorCB);\n\tif(!glfwInit())\n\t\tthrow std::runtime_error(string(\"GLFW init failed!\"));\n\n\t\/\/ OpenGL \/ GLEW\n\tWindow test(1,1, APPNAME \" - GL Test\");\n\ttest.config.visible = false;\n\ttest.config.debuging = true;\n\ttest.open();\n\ttest.bindContext();\n\n\tglbinding::Binding::initialize(false);\n\n\twindow->config.resizable = false;\n\twindow->config.GLversion.major = 3;\n\twindow->config.GLversion.minor = 2;\n\twindow->config.GLprofile = WindowConfig::Profile::CORE;\n\twindow->config.debuging = true;\n}\n\nNovo::~Novo()\n{\n\twindow->close();\n\tglfwTerminate();\n}\n\ni32 Novo::run() {\n\tusing namespace ::gl;\n\n\twindow->open();\n\twindow->bindContext();\n\twindow->setVsync(false);\n\n\n\tglEnable(GL_DEBUG_OUTPUT);\n\tglDebugMessageCallback(&glErrorCB, this);\n\n\t\/\/\/##################################\n\t\/\/\/##################################\n\tsptr<Camera> cam(new Camera(vec3(0), 800, 600));\n\tscreen = sptr<Framebuffer>(new Framebuffer(800, 600, cam, false));\n\n\tptr_list<Drawable> objs;\n\n\tu32 size = 64;\n\tobjs.push_back(new RandomCubes(size*size, size*size, vec3(0)));\n\tobjs.push_back(new Origin(size, 8.0));\n\n\t\/\/\/##################################\n\t\/\/\/##################################\n\n\tfunc.mouse = bind(&Camera::mouseCallback, screen->getCamera().get(), _1, _2);\n\n\tcon.focus = window->onFocus.connect(bind(&Novo::onFocus, this, _1));\n\tcon.key = window->onKey.connect(bind(&Novo::onKey, this, _1, _2, _3, _4));\n\tcon.mouse = window->onCursorMove.connect(func.mouse);\n\tcon.mouseBTN = window->onMouseButton.connect(bind(&Novo::onMouseButton, this, _1, _2, _3));\n\n\t\/\/ Debug\n\tGLuint query = 0;\n\tglGenQueries(1, &query);\n\n\tsteady_clock::time_point tick = steady_clock::now();\n\ti32 totalFrames = 0;\n\twhile(window->isOpen()) {\n\t\t\/\/\/##################################\n\n\t\tscreen->getCamera()->moveUpdate(1);\n\t\tscreen->bind();\n\t\tglClearColor(0.3f, 0.3f, 0.3f, 1.0f);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\n\t\t\/\/glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n\n\t\tglBeginQuery(GL_SAMPLES_PASSED, query);\n\n\t\t\/\/\/TODO glm::mat4_cast(glm::angleAxis(glm::sin((float)glfwGetTime()), vec3(0.0f, 0.0f, 1.0f)));\n\n\t\tfor(Drawable& obj : objs)\n\t\t\tscreen->render(&obj);\n\n\t\tglEndQuery(GL_SAMPLES_PASSED);\n\n\t\t\/\/glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n\t\tscreen->draw();\n\n\t\t\/\/\/##################################\n\t\twindow->present();\n\t\twindow->poll();\n\n\t\ttotalFrames++; \/\/ +1 Frame\n\t\tif(duration_cast<seconds>(steady_clock::now() - tick).count()) {\n\n\t\t\tGLuint samples;\n\t\t\tglGetQueryObjectuiv(query, GL_QUERY_RESULT, &samples);\n\n\t\t\tfmtTitle % totalFrames % samples;\n\t\t\twindow->setTitle(fmtTitle.str());\n\n\t\t\ttotalFrames = 0;\n\t\t\ttick = steady_clock::now();\n\t\t}\n\t\t\/\/TODO: main loop sleep\n\t}\n\n\treturn 0;\n}\n\nvoid Novo::onFocus(bool state) {\n\tif(!state) {\n\t\tcon.mouse.disconnect();\n\t\twindow->setCursorMode(CursorMode::NORMAL);\n\t}\n}\n\nvoid Novo::onMouseButton(i32 key, i32 action, i32 mod) {\n\tif(action == GLFW_PRESS && window->onCursorMove.empty()) {\n\t\tcon.mouse = window->onCursorMove.connect(func.mouse);\n\t\twindow->setCursorMode(CursorMode::DISABLED);\n\t\treturn;\n\t}\n}\n\nvoid Novo::onKey(i32 key, i32 scancode, i32 action, i32 mod) {\n\tsptr<Camera> cam = screen->getCamera();\n\tvec3 camVal = cam->getVelocity();\n\n\t\tswitch(action) {\n\t\tcase GLFW_PRESS:\n\t\t\tswitch(key) {\n\t\t\t\tcase GLFW_KEY_W:\n\t\t\t\t\tcamVal.z++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_S:\n\t\t\t\t\tcamVal.z--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_D:\n\t\t\t\t\tcamVal.x--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_A:\n\t\t\t\t\tcamVal.x++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_SPACE:\n\t\t\t\t\tcamVal.y++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_C:\n\t\t\t\t\tcamVal.y--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_ESCAPE:\n\t\t\t\t\tif(!con.mouse.connected())\n\t\t\t\t\t\twindow->close();\n\t\t\t\t\telse {\n\t\t\t\t\t\tcon.mouse.disconnect();\n\t\t\t\t\t\twindow->setCursorMode(CursorMode::NORMAL);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\n\t\t\t\tcase GLFW_KEY_TAB:\n\t\t\t\t\tstatic int e;\n\t\t\t\t\tif(++e > 5) e = 0;\n\t\t\t\t\tscreen->getProgram().setUniform(\"effectFlag\", e);\n\t\t\t\t\tbreak;\n\n\t\t\t}\n\t\t\tbreak;\n\t\tcase GLFW_RELEASE:\n\t\t\tswitch(key) {\n\t\t\t\tcase GLFW_KEY_W:\n\t\t\t\t\tcamVal.z--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_S:\n\t\t\t\t\tcamVal.z++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_D:\n\t\t\t\t\tcamVal.x++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_A:\n\t\t\t\t\tcamVal.x--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_SPACE:\n\t\t\t\t\tcamVal.y--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_C:\n\t\t\t\t\tcamVal.y++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t}\n\tcam->setVelocity(camVal);\n}\n\n\nstatic void glfwErrorCB(int code, const char* msg)\n{\n\tstd::cerr << string(\"[glfw]: \") << code << \": \" << string(msg) << std::endl;\n\tstd::cerr.flush();\n}\n\nstatic void glErrorCB(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar* message, const void *userParam)\n{\n\tusing std::cerr;\n\tusing std::endl;\n\n\tusing namespace novo::gl::names;\n\n\tstatic format err(\"[%f] glError: %d::%s::%s::%s\\n\\t%s\\n\");\n\n\tcerr << (err % glfwGetTime() % id % debug[severity] % debug[source] % debug[type] % message);\n\tcerr.flush();\n\t\/*\n\tcerr << \"Stack trace:\" << endl;\n\tcerr << saneStackTrace() << endl;\n\tcerr.flush();\n\t*\/\n\tif(severity == GL_DEBUG_SEVERITY_HIGH)\n\t\tthrow novo::NovoException(\"OpenGL critical error\");\n}\n<commit_msg>GL: using more fitting name for debug callback<commit_after>#include \"novo.h\"\n\n#include <novo\/io.h>\n#include <novo\/entities\/randomcubes.h>\n#include <novo\/entities\/origin.h>\n#include <novo\/gfx\/gl\/names.h>\n#include <novo\/gfx\/framebuffer.h>\n#include <novo\/gfx\/window.h>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/format.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n\n#include <glbinding\/Binding.h>\n\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtc\/quaternion.hpp>\n\n#include <iostream>\n#include <thread>\n\nusing namespace novo;\nusing namespace graphics;\n\nusing namespace std::chrono;\nusing namespace std::placeholders;\nusing std::string;\nusing std::bind;\n\nusing boost::program_options::variables_map;\nusing boost::format;\nusing boost::ptr_list;\n\nstatic void glfwErrorCB(int code, const char* msg);\nstatic void glDebugCB(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar* message, const void* userParam);\n\nformat fmtTitle(APPNAME\" - FPS: %d ::S: %d\");\n\nNovo::Novo(variables_map opts):\n\twindow(new Window(800, 600, APPNAME))\n{\n\t\/\/ GLFW\n\tglfwSetErrorCallback(glfwErrorCB);\n\tif(!glfwInit())\n\t\tthrow std::runtime_error(string(\"GLFW init failed!\"));\n\n\t\/\/ OpenGL \/ GLEW\n\tWindow test(1,1, APPNAME \" - GL Test\");\n\ttest.config.visible = false;\n\ttest.config.debuging = true;\n\ttest.open();\n\ttest.bindContext();\n\n\tglbinding::Binding::initialize(false);\n\n\twindow->config.resizable = false;\n\twindow->config.GLversion.major = 3;\n\twindow->config.GLversion.minor = 2;\n\twindow->config.GLprofile = WindowConfig::Profile::CORE;\n\twindow->config.debuging = true;\n}\n\nNovo::~Novo()\n{\n\twindow->close();\n\tglfwTerminate();\n}\n\ni32 Novo::run() {\n\tusing namespace ::gl;\n\n\twindow->open();\n\twindow->bindContext();\n\twindow->setVsync(false);\n\n\n\tglEnable(GL_DEBUG_OUTPUT);\n\tglDebugMessageCallback(&glDebugCB, this);\n\n\t\/\/\/##################################\n\t\/\/\/##################################\n\tsptr<Camera> cam(new Camera(vec3(0), 800, 600));\n\tscreen = sptr<Framebuffer>(new Framebuffer(800, 600, cam, false));\n\n\tptr_list<Drawable> objs;\n\n\tu32 size = 64;\n\tobjs.push_back(new RandomCubes(size*size, size*size, vec3(0)));\n\tobjs.push_back(new Origin(size, 8.0));\n\n\t\/\/\/##################################\n\t\/\/\/##################################\n\n\tfunc.mouse = bind(&Camera::mouseCallback, screen->getCamera().get(), _1, _2);\n\n\tcon.focus = window->onFocus.connect(bind(&Novo::onFocus, this, _1));\n\tcon.key = window->onKey.connect(bind(&Novo::onKey, this, _1, _2, _3, _4));\n\tcon.mouse = window->onCursorMove.connect(func.mouse);\n\tcon.mouseBTN = window->onMouseButton.connect(bind(&Novo::onMouseButton, this, _1, _2, _3));\n\n\t\/\/ Debug\n\tGLuint query = 0;\n\tglGenQueries(1, &query);\n\n\tsteady_clock::time_point tick = steady_clock::now();\n\ti32 totalFrames = 0;\n\twhile(window->isOpen()) {\n\t\t\/\/\/##################################\n\n\t\tscreen->getCamera()->moveUpdate(1);\n\t\tscreen->bind();\n\t\tglClearColor(0.3f, 0.3f, 0.3f, 1.0f);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\n\t\t\/\/glPolygonMode(GL_FRONT_AND_BACK, GL_LINE);\n\n\t\tglBeginQuery(GL_SAMPLES_PASSED, query);\n\n\t\t\/\/\/TODO glm::mat4_cast(glm::angleAxis(glm::sin((float)glfwGetTime()), vec3(0.0f, 0.0f, 1.0f)));\n\n\t\tfor(Drawable& obj : objs)\n\t\t\tscreen->render(&obj);\n\n\t\tglEndQuery(GL_SAMPLES_PASSED);\n\n\t\t\/\/glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n\t\tscreen->draw();\n\n\t\t\/\/\/##################################\n\t\twindow->present();\n\t\twindow->poll();\n\n\t\ttotalFrames++; \/\/ +1 Frame\n\t\tif(duration_cast<seconds>(steady_clock::now() - tick).count()) {\n\n\t\t\tGLuint samples;\n\t\t\tglGetQueryObjectuiv(query, GL_QUERY_RESULT, &samples);\n\n\t\t\tfmtTitle % totalFrames % samples;\n\t\t\twindow->setTitle(fmtTitle.str());\n\n\t\t\ttotalFrames = 0;\n\t\t\ttick = steady_clock::now();\n\t\t}\n\t\t\/\/TODO: main loop sleep\n\t}\n\n\treturn 0;\n}\n\nvoid Novo::onFocus(bool state) {\n\tif(!state) {\n\t\tcon.mouse.disconnect();\n\t\twindow->setCursorMode(CursorMode::NORMAL);\n\t}\n}\n\nvoid Novo::onMouseButton(i32 key, i32 action, i32 mod) {\n\tif(action == GLFW_PRESS && window->onCursorMove.empty()) {\n\t\tcon.mouse = window->onCursorMove.connect(func.mouse);\n\t\twindow->setCursorMode(CursorMode::DISABLED);\n\t\treturn;\n\t}\n}\n\nvoid Novo::onKey(i32 key, i32 scancode, i32 action, i32 mod) {\n\tsptr<Camera> cam = screen->getCamera();\n\tvec3 camVal = cam->getVelocity();\n\n\t\tswitch(action) {\n\t\tcase GLFW_PRESS:\n\t\t\tswitch(key) {\n\t\t\t\tcase GLFW_KEY_W:\n\t\t\t\t\tcamVal.z++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_S:\n\t\t\t\t\tcamVal.z--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_D:\n\t\t\t\t\tcamVal.x--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_A:\n\t\t\t\t\tcamVal.x++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_SPACE:\n\t\t\t\t\tcamVal.y++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_C:\n\t\t\t\t\tcamVal.y--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_ESCAPE:\n\t\t\t\t\tif(!con.mouse.connected())\n\t\t\t\t\t\twindow->close();\n\t\t\t\t\telse {\n\t\t\t\t\t\tcon.mouse.disconnect();\n\t\t\t\t\t\twindow->setCursorMode(CursorMode::NORMAL);\n\t\t\t\t\t}\n\t\t\t\t\treturn;\n\n\t\t\t\tcase GLFW_KEY_TAB:\n\t\t\t\t\tstatic int e;\n\t\t\t\t\tif(++e > 5) e = 0;\n\t\t\t\t\tscreen->getProgram().setUniform(\"effectFlag\", e);\n\t\t\t\t\tbreak;\n\n\t\t\t}\n\t\t\tbreak;\n\t\tcase GLFW_RELEASE:\n\t\t\tswitch(key) {\n\t\t\t\tcase GLFW_KEY_W:\n\t\t\t\t\tcamVal.z--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_S:\n\t\t\t\t\tcamVal.z++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_D:\n\t\t\t\t\tcamVal.x++;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_A:\n\t\t\t\t\tcamVal.x--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_SPACE:\n\t\t\t\t\tcamVal.y--;\n\t\t\t\t\tbreak;\n\t\t\t\tcase GLFW_KEY_C:\n\t\t\t\t\tcamVal.y++;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t}\n\tcam->setVelocity(camVal);\n}\n\n\nstatic void glfwErrorCB(int code, const char* msg)\n{\n\tstd::cerr << string(\"[glfw]: \") << code << \": \" << string(msg) << std::endl;\n\tstd::cerr.flush();\n}\n\nstatic void glDebugCB(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length, const GLchar* message, const void *userParam)\n{\n\tusing std::cerr;\n\tusing std::endl;\n\n\tusing namespace novo::gl::names;\n\n\tstatic format err(\"[%f] gl: %d::%s::%s::%s\\n\\t%s\\n\");\n\n\tcerr << (err % glfwGetTime() % id % debug[severity] % debug[source] % debug[type] % message);\n\tcerr.flush();\n\t\/*\n\tcerr << \"Stack trace:\" << endl;\n\tcerr << saneStackTrace() << endl;\n\tcerr.flush();\n\t*\/\n\tif(severity == GL_DEBUG_SEVERITY_HIGH)\n\t\tthrow novo::NovoException(\"OpenGL critical error\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2018 alex v\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"ntpclient.h\"\n#include \"random.h\"\n#include \"timedata.h\"\n#include \"util.h\"\n\n#include <sstream>\n#include <iomanip>\n\nusing namespace boost;\nusing namespace boost::asio;\n\nint64_t CNtpClient::getTimestamp()\n{\n time_t timeRecv = -1;\n\n io_service io_service;\n\n LogPrint(\"ntp\", \"[NTP] Opening socket to NTP server %s.\\n\", sHostName);\n try\n {\n\n ip::udp::resolver resolver(io_service);\n ip::udp::resolver::query query(boost::asio::ip::udp::v4(), sHostName, \"ntp\");\n\n ip::udp::endpoint receiver_endpoint = *resolver.resolve(query);\n\n ip::udp::socket socket(io_service);\n socket.open(ip::udp::v4());\n\n boost::array<unsigned char, 48> sendBuf = {{010,0,0,0,0,0,0,0,0}};\n\n socket.send_to(boost::asio::buffer(sendBuf), receiver_endpoint);\n\n boost::array<unsigned long, 1024> recvBuf;\n ip::udp::endpoint sender_endpoint;\n\n try\n {\n\n fd_set fileDescriptorSet;\n struct timeval timeStruct;\n\n timeStruct.tv_sec = GetArg(\"-ntptimeout\", DEFAULT_NTP_TIMEOUT);\n timeStruct.tv_usec = 0;\n FD_ZERO(&fileDescriptorSet);\n\n int nativeSocket = socket.native();\n\n FD_SET(nativeSocket,&fileDescriptorSet);\n\n select(nativeSocket+1,&fileDescriptorSet,NULL,NULL,&timeStruct);\n\n if(!FD_ISSET(nativeSocket,&fileDescriptorSet))\n {\n\n LogPrint(\"ntp\", \"[NTP] Could not read socket from NTP server %s (Read timeout)\\n\", sHostName);\n\n }\n else\n {\n\n socket.receive_from(boost::asio::buffer(recvBuf), sender_endpoint);\n\n std::ostringstream oss;\n oss << std::hex << std::setfill('0');\n oss << std::setw(2) << (unsigned int)recvBuf[4];\n\n timeRecv = ntohl((time_t)recvBuf[4]);\n timeRecv-= 2208988800U; \/\/ Substract 01\/01\/1970 == 2208988800U\n\n LogPrint(\"ntp\", \"[NTP] Received timestamp: %ll (Raw: 0x%s)\\n\", (uint64_t)timeRecv, oss.str());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not read clock from NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not open socket to NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n assert (sizeof(int64_t) >= sizeof(time_t));\n\n return *reinterpret_cast<int64_t*>(&timeRecv);\n}\n\nbool NtpClockSync() {\n LogPrintf(\"[NTP] Starting clock sync...\\n\");\n\n std::vector<std::string> vNtpServers;\n std::vector<int64_t> vResults;\n\n if (mapMultiArgs[\"-ntpserver\"].size() > 0)\n {\n vNtpServers = mapMultiArgs[\"-ntpserver\"];\n }\n else\n {\n vNtpServers = vDefaultNtpServers;\n }\n\n string sReport = \"\";\n string sPrevServer = \"\";\n int64_t nPrevMeasure = -1;\n\n random_shuffle(vNtpServers.begin(), vNtpServers.end(), GetRandInt);\n \n unsigned int nMeasureCount = 0;\n\n for(unsigned int i = 0; i < vNtpServers.size(); i++)\n {\n string s = vNtpServers[i];\n CNtpClient ntpClient(s);\n int64_t nTimestamp = ntpClient.getTimestamp();\n if(nTimestamp > -1)\n {\n int64_t nClockDrift = GetTimeNow() - nTimestamp;\n nMeasureCount++;\n\n \/\/ We push if its the first entry\n if(nMeasureCount == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n }\n \/\/ or if n.measure is odd, including prev measure too\n else if (nMeasureCount % 2 == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n\n vResults.push_back(nPrevMeasure);\n\n sign = \"\";\n if(nPrevMeasure > 0)\n sign = \"+\";\n\n sReport += sPrevServer + \"[\" + sign + to_string(nPrevMeasure) + \"sec.] \";\n }\n else\n {\n nPrevMeasure = nClockDrift;\n sPrevServer = s;\n }\n\n if (vResults.size() >= 5)\n break;\n }\n }\n\n assert(vResults.size() % 2 == 1 || vResults.size() == 0);\n\n unsigned int nMin = GetArg(\"-ntpminmeasures\", MINIMUM_NTP_MEASURE);\n\n if (vResults.size() >= nMin)\n {\n LogPrintf(\"[NTP] Measured: %s\\n\", sReport);\n\n static CMedianFilter<int64_t> vNtpTimeOffsets(vResults.size(), 0);\n\n for(unsigned int i = 0; i < vResults.size(); i++)\n {\n vNtpTimeOffsets.input(vResults[i]);\n }\n\n SetNtpTimeOffset(vNtpTimeOffsets.median());\n\n LogPrintf(\"[NTP] Calculated offset from median: %d\\n\", GetNtpTimeOffset());\n return true;\n }\n else\n {\n return false;\n }\n}\n<commit_msg>changed return type to int64_t<commit_after>\/\/ Copyright (c) 2018 alex v\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"ntpclient.h\"\n#include \"random.h\"\n#include \"timedata.h\"\n#include \"util.h\"\n\n#include <sstream>\n#include <iomanip>\n\nusing namespace boost;\nusing namespace boost::asio;\n\nint64_t CNtpClient::getTimestamp()\n{\n time_t timeRecv = -1;\n\n io_service io_service;\n\n LogPrint(\"ntp\", \"[NTP] Opening socket to NTP server %s.\\n\", sHostName);\n try\n {\n\n ip::udp::resolver resolver(io_service);\n ip::udp::resolver::query query(boost::asio::ip::udp::v4(), sHostName, \"ntp\");\n\n ip::udp::endpoint receiver_endpoint = *resolver.resolve(query);\n\n ip::udp::socket socket(io_service);\n socket.open(ip::udp::v4());\n\n boost::array<unsigned char, 48> sendBuf = {{010,0,0,0,0,0,0,0,0}};\n\n socket.send_to(boost::asio::buffer(sendBuf), receiver_endpoint);\n\n boost::array<unsigned long, 1024> recvBuf;\n ip::udp::endpoint sender_endpoint;\n\n try\n {\n\n fd_set fileDescriptorSet;\n struct timeval timeStruct;\n\n timeStruct.tv_sec = GetArg(\"-ntptimeout\", DEFAULT_NTP_TIMEOUT);\n timeStruct.tv_usec = 0;\n FD_ZERO(&fileDescriptorSet);\n\n int nativeSocket = socket.native();\n\n FD_SET(nativeSocket,&fileDescriptorSet);\n\n select(nativeSocket+1,&fileDescriptorSet,NULL,NULL,&timeStruct);\n\n if(!FD_ISSET(nativeSocket,&fileDescriptorSet))\n {\n\n LogPrint(\"ntp\", \"[NTP] Could not read socket from NTP server %s (Read timeout)\\n\", sHostName);\n\n }\n else\n {\n\n socket.receive_from(boost::asio::buffer(recvBuf), sender_endpoint);\n\n std::ostringstream oss;\n oss << std::hex << std::setfill('0');\n oss << std::setw(2) << (unsigned int)recvBuf[4];\n\n timeRecv = ntohl((time_t)recvBuf[4]);\n LogPrint(\"ntp\", \"[NTP] timeRecv: %ll \\n\", (uint64_t)timeRecv);\n \n timeRecv-= 2208988800U; \/\/ Substract 01\/01\/1970 == 2208988800U\n\n LogPrint(\"ntp\", \"[NTP] Received timestamp: %ll (Raw: 0x%s)\\n\", (uint64_t)timeRecv, oss.str());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not read clock from NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n }\n catch (std::exception& e)\n {\n\n LogPrintf(\"[NTP] Could not open socket to NTP server %s (%s)\\n\", sHostName, e.what());\n\n }\n\n assert (sizeof(int64_t) >= sizeof(time_t));\n\n return (int64_t)timeRecv;\n}\n\nbool NtpClockSync() {\n LogPrintf(\"[NTP] Starting clock sync...\\n\");\n\n std::vector<std::string> vNtpServers;\n std::vector<int64_t> vResults;\n\n if (mapMultiArgs[\"-ntpserver\"].size() > 0)\n {\n vNtpServers = mapMultiArgs[\"-ntpserver\"];\n }\n else\n {\n vNtpServers = vDefaultNtpServers;\n }\n\n string sReport = \"\";\n string sPrevServer = \"\";\n int64_t nPrevMeasure = -1;\n\n random_shuffle(vNtpServers.begin(), vNtpServers.end(), GetRandInt);\n\n unsigned int nMeasureCount = 0;\n\n for(unsigned int i = 0; i < vNtpServers.size(); i++)\n {\n string s = vNtpServers[i];\n CNtpClient ntpClient(s);\n int64_t nTimestamp = ntpClient.getTimestamp();\n if(nTimestamp > -1)\n {\n int64_t nClockDrift = GetTimeNow() - nTimestamp;\n nMeasureCount++;\n\n \/\/ We push if its the first entry\n if(nMeasureCount == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n }\n \/\/ or if n.measure is odd, including prev measure too\n else if (nMeasureCount % 2 == 1)\n {\n vResults.push_back(nClockDrift);\n\n string sign = \"\";\n if(nClockDrift > 0)\n sign = \"+\";\n\n sReport += s + \"[\" + sign + to_string(nClockDrift) + \"sec.] \";\n\n vResults.push_back(nPrevMeasure);\n\n sign = \"\";\n if(nPrevMeasure > 0)\n sign = \"+\";\n\n sReport += sPrevServer + \"[\" + sign + to_string(nPrevMeasure) + \"sec.] \";\n }\n else\n {\n nPrevMeasure = nClockDrift;\n sPrevServer = s;\n }\n\n if (vResults.size() >= 5)\n break;\n }\n }\n\n assert(vResults.size() % 2 == 1 || vResults.size() == 0);\n\n unsigned int nMin = GetArg(\"-ntpminmeasures\", MINIMUM_NTP_MEASURE);\n\n if (vResults.size() >= nMin)\n {\n LogPrintf(\"[NTP] Measured: %s\\n\", sReport);\n\n static CMedianFilter<int64_t> vNtpTimeOffsets(vResults.size(), 0);\n\n for(unsigned int i = 0; i < vResults.size(); i++)\n {\n vNtpTimeOffsets.input(vResults[i]);\n }\n\n SetNtpTimeOffset(vNtpTimeOffsets.median());\n\n LogPrintf(\"[NTP] Calculated offset from median: %d\\n\", GetNtpTimeOffset());\n return true;\n }\n else\n {\n return false;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n\n#include <s2list.h>\n\nstatic bool _invalidated = true;\n\nclass Button\n{\npublic:\n\tint m_x, m_y;\n\tint m_width, m_height;\n\tbool m_hovering;\n\tbool m_down;\n\npublic:\n\tButton(int x, int y, int width = 120, int height = 30)\n\t{\n\t\tm_x = x;\n\t\tm_y = y;\n\t\tm_width = width;\n\t\tm_height = height;\n\t\tm_hovering = false;\n\t\tm_down = false;\n\t}\n\n\t~Button()\n\t{\n\t}\n\n\tbool Contains(int x, int y)\n\t{\n\t\treturn (x >= m_x && x < m_x + m_width) && (y >= m_y && y < m_y + m_height);\n\t}\n\n\tvoid Draw(NVGcontext* vg)\n\t{\n\t\tnvgBeginPath(vg);\n\t\tnvgRect(vg, m_x, m_y, m_width, m_height);\n\t\tif (m_hovering) {\n\t\t\tif (m_down) {\n\t\t\t\tnvgFillColor(vg, nvgRGBA(255, 127, 0, 255));\n\t\t\t} else {\n\t\t\t\tnvgFillColor(vg, nvgRGBA(255, 255, 127, 255));\n\t\t\t}\n\t\t} else {\n\t\t\tnvgFillColor(vg, nvgRGBA(0, 127, 255, 255));\n\t\t}\n\t\tnvgFill(vg);\n\t}\n\n\tvoid MouseEnter()\n\t{\n\t\tm_hovering = true;\n\t\tm_down = false;\n\t\t_invalidated = true;\n\t}\n\n\tvoid MouseLeave()\n\t{\n\t\tm_hovering = false;\n\t\tm_down = false;\n\t\t_invalidated = true;\n\t}\n\n\tvoid MouseDown(int button)\n\t{\n\t\tif (button == GLFW_MOUSE_BUTTON_LEFT) {\n\t\t\tm_down = true;\n\t\t\t_invalidated = true;\n\t\t}\n\t}\n\n\tvoid MouseUp(int button)\n\t{\n\t\tif (button == GLFW_MOUSE_BUTTON_LEFT) {\n\t\t\tif (m_down) {\n\t\t\t\tClick();\n\t\t\t}\n\t\t\tm_down = false;\n\t\t\t_invalidated = true;\n\t\t}\n\t}\n\n\tvoid Click()\n\t{\n\t\tprintf(\"Button was clicked!\\n\");\n\t\tm_x += 10;\n\t\t_invalidated = true;\n\t}\n};\n\nstatic s2::list<Button*> _buttons;\n\nint main()\n{\n\t\/*\n\tlay_context lay;\n\tlay_init_context(&lay);\n\n\tlay_id root = lay_item(&lay);\n\tlay_set_size_xy(&lay, root, 1024, 768);\n\tlay_set_contain(&lay, root, LAY_ROW);\n\n\tlay_id master_list = lay_item(&lay);\n\tlay_set_size_xy(&lay, master_list, 400, 0);\n\tlay_set_behave(&lay, master_list, LAY_VFILL);\n\tlay_set_contain(&lay, master_list, LAY_COLUMN);\n\tlay_insert(&lay, root, master_list);\n\n\tlay_id content_view = lay_item(&lay);\n\tlay_set_behave(&lay, content_view, LAY_FILL);\n\n\tlay_run_context(&lay);\n\tlay_vec4 master_list_rect = lay_get_rect(&lay, master_list);\n\tlay_vec4 content_view_rect = lay_get_rect(&lay, content_view);\n\n\tprintf(\"master: %d,%d -- %d,%d\\n\", master_list_rect[0], master_list_rect[1], master_list_rect[2], master_list_rect[3]);\n\tprintf(\"content: %d,%d -- %d,%d\\n\", content_view_rect[0], content_view_rect[1], content_view_rect[2], content_view_rect[3]);\n\n\t\/\/lay_reset_context(&lay);\n\tlay_destroy_context(&lay);\n\n\treturn 0;\n\t*\/\n\n\t_buttons.add(new Button(100, 100));\n\t_buttons.add(new Button(100, 150));\n\t_buttons.add(new Button(100, 200));\n\t_buttons.add(new Button(100, 250));\n\n\treturn 0;\n}\n<commit_msg>Remove prototype<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"scheduler.h\"\n\n#include <assert.h>\n#include <boost\/bind.hpp>\n#include <utility>\n\nCScheduler::CScheduler() : nThreadsServicingQueue(0), stopRequested(false), stopWhenEmpty(false)\n{\n}\n\nCScheduler::~CScheduler()\n{\n assert(nThreadsServicingQueue == 0);\n}\n\n\n#if BOOST_VERSION < 105000\nstatic boost::system_time toPosixTime(const boost::chrono::system_clock::time_point& t)\n{\n return boost::posix_time::from_time_t(boost::chrono::system_clock::to_time_t(t));\n}\n#endif\n\nvoid CScheduler::serviceQueue()\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n ++nThreadsServicingQueue;\n\n \/\/ newTaskMutex is locked throughout this loop EXCEPT\n \/\/ when the thread is waiting or when the user's function\n \/\/ is called.\n while (!shouldStop()) {\n try {\n while (!shouldStop() && taskQueue.empty()) {\n \/\/ Wait until there is something to do.\n newTaskScheduled.wait(lock);\n }\n\n \/\/ Wait until either there is a new task, or until\n \/\/ the time of the first item on the queue:\n\n\/\/ wait_until needs boost 1.50 or later; older versions have timed_wait:\n#if BOOST_VERSION < 105000\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.timed_wait(lock, toPosixTime(taskQueue.begin()->first))) {\n \/\/ Keep waiting until timeout\n }\n#else\n \/\/ Some boost versions have a conflicting overload of wait_until that returns void.\n \/\/ Explicitly use a template here to avoid hitting that overload.\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.wait_until<>(lock, taskQueue.begin()->first) != boost::cv_status::timeout) {\n \/\/ Keep waiting until timeout\n }\n#endif\n \/\/ If there are multiple threads, the queue can empty while we're waiting (another\n \/\/ thread may service the task we were waiting on).\n if (shouldStop() || taskQueue.empty())\n continue;\n\n Function f = taskQueue.begin()->second;\n taskQueue.erase(taskQueue.begin());\n\n \/\/ Unlock before calling f, so it can reschedule itself or another task\n \/\/ without deadlocking:\n lock.unlock();\n f();\n lock.lock();\n } catch (...) {\n --nThreadsServicingQueue;\n throw;\n }\n }\n --nThreadsServicingQueue;\n}\n\nvoid CScheduler::stop(bool drain)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n if (drain)\n stopWhenEmpty = true;\n else\n stopRequested = true;\n }\n newTaskScheduled.notify_all();\n}\n\nvoid CScheduler::schedule(CScheduler::Function f, boost::chrono::system_clock::time_point t)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n taskQueue.insert(std::make_pair(t, f));\n }\n newTaskScheduled.notify_one();\n}\n\nvoid CScheduler::scheduleFromNow(CScheduler::Function f, int64_t deltaSeconds)\n{\n schedule(f, boost::chrono::system_clock::now() + boost::chrono::seconds(deltaSeconds));\n}\n\nstatic void Repeat(CScheduler* s, CScheduler::Function f, int64_t deltaSeconds)\n{\n f();\n s->scheduleFromNow(boost::bind(&Repeat, s, f, deltaSeconds), deltaSeconds);\n}\n\nvoid CScheduler::scheduleEvery(CScheduler::Function f, int64_t deltaSeconds)\n{\n scheduleFromNow(boost::bind(&Repeat, this, f, deltaSeconds), deltaSeconds);\n}\n\nsize_t CScheduler::getQueueInfo(boost::chrono::system_clock::time_point &first,\n boost::chrono::system_clock::time_point &last) const\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n size_t result = taskQueue.size();\n if (!taskQueue.empty()) {\n first = taskQueue.begin()->first;\n last = taskQueue.rbegin()->first;\n }\n return result;\n}\n<commit_msg>Make sure we re-acquire lock if a task throws<commit_after>\/\/ Copyright (c) 2015 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"scheduler.h\"\n\n#include <assert.h>\n#include <boost\/bind.hpp>\n#include <boost\/thread\/reverse_lock.hpp>\n#include <utility>\n\nCScheduler::CScheduler() : nThreadsServicingQueue(0), stopRequested(false), stopWhenEmpty(false)\n{\n}\n\nCScheduler::~CScheduler()\n{\n assert(nThreadsServicingQueue == 0);\n}\n\n\n#if BOOST_VERSION < 105000\nstatic boost::system_time toPosixTime(const boost::chrono::system_clock::time_point& t)\n{\n return boost::posix_time::from_time_t(boost::chrono::system_clock::to_time_t(t));\n}\n#endif\n\nvoid CScheduler::serviceQueue()\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n ++nThreadsServicingQueue;\n\n \/\/ newTaskMutex is locked throughout this loop EXCEPT\n \/\/ when the thread is waiting or when the user's function\n \/\/ is called.\n while (!shouldStop()) {\n try {\n while (!shouldStop() && taskQueue.empty()) {\n \/\/ Wait until there is something to do.\n newTaskScheduled.wait(lock);\n }\n\n \/\/ Wait until either there is a new task, or until\n \/\/ the time of the first item on the queue:\n\n\/\/ wait_until needs boost 1.50 or later; older versions have timed_wait:\n#if BOOST_VERSION < 105000\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.timed_wait(lock, toPosixTime(taskQueue.begin()->first))) {\n \/\/ Keep waiting until timeout\n }\n#else\n \/\/ Some boost versions have a conflicting overload of wait_until that returns void.\n \/\/ Explicitly use a template here to avoid hitting that overload.\n while (!shouldStop() && !taskQueue.empty() &&\n newTaskScheduled.wait_until<>(lock, taskQueue.begin()->first) != boost::cv_status::timeout) {\n \/\/ Keep waiting until timeout\n }\n#endif\n \/\/ If there are multiple threads, the queue can empty while we're waiting (another\n \/\/ thread may service the task we were waiting on).\n if (shouldStop() || taskQueue.empty())\n continue;\n\n Function f = taskQueue.begin()->second;\n taskQueue.erase(taskQueue.begin());\n\n {\n \/\/ Unlock before calling f, so it can reschedule itself or another task\n \/\/ without deadlocking:\n boost::reverse_lock<boost::unique_lock<boost::mutex> > rlock(lock);\n f();\n }\n } catch (...) {\n --nThreadsServicingQueue;\n throw;\n }\n }\n --nThreadsServicingQueue;\n}\n\nvoid CScheduler::stop(bool drain)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n if (drain)\n stopWhenEmpty = true;\n else\n stopRequested = true;\n }\n newTaskScheduled.notify_all();\n}\n\nvoid CScheduler::schedule(CScheduler::Function f, boost::chrono::system_clock::time_point t)\n{\n {\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n taskQueue.insert(std::make_pair(t, f));\n }\n newTaskScheduled.notify_one();\n}\n\nvoid CScheduler::scheduleFromNow(CScheduler::Function f, int64_t deltaSeconds)\n{\n schedule(f, boost::chrono::system_clock::now() + boost::chrono::seconds(deltaSeconds));\n}\n\nstatic void Repeat(CScheduler* s, CScheduler::Function f, int64_t deltaSeconds)\n{\n f();\n s->scheduleFromNow(boost::bind(&Repeat, s, f, deltaSeconds), deltaSeconds);\n}\n\nvoid CScheduler::scheduleEvery(CScheduler::Function f, int64_t deltaSeconds)\n{\n scheduleFromNow(boost::bind(&Repeat, this, f, deltaSeconds), deltaSeconds);\n}\n\nsize_t CScheduler::getQueueInfo(boost::chrono::system_clock::time_point &first,\n boost::chrono::system_clock::time_point &last) const\n{\n boost::unique_lock<boost::mutex> lock(newTaskMutex);\n size_t result = taskQueue.size();\n if (!taskQueue.empty()) {\n first = taskQueue.begin()->first;\n last = taskQueue.rbegin()->first;\n }\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"selectors.hpp\"\n\n#include \"json_spirit\/json_spirit_reader_template.h\"\n#include \"json_spirit\/json_spirit_writer_template.h\"\n\n#include <boost\/foreach.hpp>\n\nusing namespace json_spirit;\n\nInterval get_chunk_coordinate(int chunk_coord){\n\treturn Interval(chunk_coord * 16, (chunk_coord + 1) * 16 - 1);\n}\n\nin_circle_predicate::in_circle_predicate(point_surface & ps, int _size):\n\tsize(_size),center(ps){\n\n}\n\n\nbool in_circle_predicate::operator()(const mc::utils::level_coord & coord) {\n\tInterval x_chunk(get_chunk_coordinate(coord.get_x()));\n\tInterval z_chunk(get_chunk_coordinate(coord.get_z()));\n\n\tpoint_surface ps=center;\n\tint distance_sqr;\n\n\tint dist_x = x_chunk.distance(ps.x);\n\tint dist_y = z_chunk.distance(ps.z);\n\n\t\/\/ std::cout <<\" in circle ?\" <<std::endl;\n\tdistance_sqr = dist_x * dist_x + dist_y * dist_y ; \n\n\t\/\/ std::cout <<\" d sqr :\"<< distance_sqr << \", size\" << size * size<<std::endl;\n\treturn distance_sqr <= size * size ; \n\t\/\/ distance of the chunk from the circle\n}\n\ntemplate<typename Y>\nY sqr(Y val)\n{ return val*val; }\n\n\nbool in_circle_predicate::operator()(const point & pt){\n\t\/\/ std::cout << \"in circle ?\" << std::endl;\n\tint distance_sqr = sqr(pt.x - center.x) + sqr ( pt.z - center.z);\n\t\/\/ std::cout << pt.x << \" \" << pt.y << \" \"<< pt.z <<\" \" << distance_sqr << \" \" << sqr(size) << std::endl;\n\t\/\/ std::cout << pt.x << \" \" << pt.z <<\" \" << distance_sqr << \" \" << sqr(size) << std::endl;\n\treturn distance_sqr <= sqr(size); \n}\n\nstd::ostream & operator<<(std::ostream & out, Interval & i){\n\tout << \"[\" << i.getmin() << \",\" << i.getmax() << \"]\" <<endl;\n\treturn out;\n}\n\nstd::ostream & operator<<(std::ostream & out,point_surface & p){\n\tout << \"[ x:\" << p.x << \", z: \" << p.z << \"]\" << endl;\n\treturn out;\n}\n\npchunksel analyse_json_unknown(wmValue & v, bool & error);\npoint analyse_point(wmValue & v, bool & error){\n\twmObject obj = v.get_obj();\n\n\tstd::cout << \"analysing point\" <<std::endl;\t\n\tint X,Y,Z ;\n\tX=Y=Z=0;\n\tstd::wstring str_x(L\"X\") ; \n\tX = obj[std::wstring(str_x)].get_int(); \/\/ .get(\"X\").get_int();\n\tstd::wstring str_y(L\"Y\") ; \n\tY = obj[std::wstring(str_y)].get_int();\n\tstd::wstring str_z(L\"Z\") ; \n\tZ = obj[std::wstring(str_z)].get_int();\n\n\treturn point(X,Y,Z);\t\n}\n\npchunksel analyse_json_circle(wmValue & v, bool & error){\n\t\/\/ pallchunksel sel(new all_criterium_chunk_selector());\n\tstd::cout << \"analysing circle\" << std::endl;\n\t\n\tpoint p = analyse_point(v.get_obj()[L\"center\"],error);\n\tpoint_surface p_s(p.x,p.z);\t\n\tint size = v.get_obj()[L\"diameter\"].get_int();\n\tin_circle_predicate in_c(p_s,size);\n\t\t\n\treturn pchunksel(new in_circle_criterium(in_c)) ;\n}\n\npchunksel analyse_json_not(wmValue & v, bool & error){\n\tpchunksel inverse( analyse_json_unknown(v,error));\n\tpchunksel sel(new not_in_criterium_chunk_selector(inverse));\n\treturn sel;\n}\n\n\npchunksel analyse_json_and (wmValue & v,bool & error){\n\tstd::cout << \"analysing and\" << std::endl ;\n\tpallchunksel andsel( new all_criterium_chunk_selector());\n\tswitch (v.type()) {\n\t\tcase array_type:\n\t\t\tBOOST_FOREACH(wmValue val, v.get_array() ){\n\t\t\t\tandsel->add_criterium(analyse_json_unknown(val, error));\n\t\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\terror=true;\n\t}\n\treturn andsel;\n}\n\npchunksel analyse_json_or (wmValue & v,bool & error){\n\tpanychunksel anysel( new any_criterium_chunk_selector());\n\tswitch (v.type()) {\n\t\tcase array_type:\n\t\t\tBOOST_FOREACH(wmValue val, v.get_array() ){\n\t\t\t\tanysel->add_criterium(analyse_json_unknown(val, error));\n\t\t\t}\n\n\t\tbreak;\n\t\tdefault:\n\t\terror=true;\n\t}\n\treturn anysel;\n}\n\npchunksel analyse_json_unknown(wmValue & v, bool & error){\n\tpchunksel sel;\n\twmObject obj;\n\tstd::cout << \"analysing unknown\" << std::endl;\n\tswitch (v.type()){\n\t\tcase obj_type:\n\t\tobj=v.get_obj();\n\t\t\/\/ write_stream(v,std::cout,raw_utf8);\n\t\tBOOST_FOREACH(wmConfig::Pair_type obj_,obj ){\n\t\t\twstring first = obj_.first ;\n\t\t\tstd::cout << \"plop\";\n\t\t\tstd::wcout << first << std::endl;\n\t\t}\n\t\tstd::cout << \"is an obj\" <<std::endl;\n\t\tif (obj.count( L\"circle\") > 0 ){\n\t\t\tsel = analyse_json_circle(obj[L\"circle\"],error);\n\t\t}else if (obj.count( L\"and\") > 0 ){\n\t\t\tsel = analyse_json_and(obj[L\"and\"],error);\n\t\t}else if(obj.count( L\"or\") > 0 ){\n\t\t\tsel = analyse_json_or(obj[L\"or\"],error);\n\t\t}else if(obj.count( L\"not\") > 0 ){\n\t\t\tsel = analyse_json_not(obj[L\"not\"],error);\n\t\t}else {\n\t\t\terror=true;\n\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\t\terror=true;\n\t}\n\treturn sel;\n}\n\npchunksel selector_factory::from_json_spec(std::string & filename){\n\tstd::wifstream json_file(filename.c_str());\n\tbool error = false;\n\tif (! json_file.good()){\n\t\tstd::cout << \"bad json spec selector file : \"<< filename <<\" exiting\" << std::endl; \n\t\texit(0);\n\t}\n\twmValue value;\n\n\tread_stream(json_file,value);\n\tpchunksel p(analyse_json_and(value,error));\n\tif(error){\n\t\tstd::cout << \"erreur de parsing\" << std::endl;\n\t\texit(0);\n\t}\n\n\treturn p;\n}\n\n<commit_msg>Changed command line switch, added parsing state informations<commit_after>#include \"selectors.hpp\"\n\n#include \"json_spirit\/json_spirit_reader_template.h\"\n#include \"json_spirit\/json_spirit_writer_template.h\"\n\n#include <boost\/foreach.hpp>\n\nusing namespace json_spirit;\n\nInterval get_chunk_coordinate(int chunk_coord){\n\treturn Interval(chunk_coord * 16, (chunk_coord + 1) * 16 - 1);\n}\n\nin_circle_predicate::in_circle_predicate(point_surface & ps, int _size):\n\tsize(_size),center(ps){\n\n}\n\n\nbool in_circle_predicate::operator()(const mc::utils::level_coord & coord) {\n\tInterval x_chunk(get_chunk_coordinate(coord.get_x()));\n\tInterval z_chunk(get_chunk_coordinate(coord.get_z()));\n\n\tpoint_surface ps=center;\n\tint distance_sqr;\n\n\tint dist_x = x_chunk.distance(ps.x);\n\tint dist_y = z_chunk.distance(ps.z);\n\n\t\/\/ std::cout <<\" in circle ?\" <<std::endl;\n\tdistance_sqr = dist_x * dist_x + dist_y * dist_y ; \n\n\t\/\/ std::cout <<\" d sqr :\"<< distance_sqr << \", size\" << size * size<<std::endl;\n\treturn distance_sqr <= size * size ; \n\t\/\/ distance of the chunk from the circle\n}\n\ntemplate<typename Y>\nY sqr(Y val)\n{ return val*val; }\n\n\nbool in_circle_predicate::operator()(const point & pt){\n\t\/\/ std::cout << \"in circle ?\" << std::endl;\n\tint distance_sqr = sqr(pt.x - center.x) + sqr ( pt.z - center.z);\n\t\/\/ std::cout << pt.x << \" \" << pt.y << \" \"<< pt.z <<\" \" << distance_sqr << \" \" << sqr(size) << std::endl;\n\t\/\/ std::cout << pt.x << \" \" << pt.z <<\" \" << distance_sqr << \" \" << sqr(size) << std::endl;\n\treturn distance_sqr <= sqr(size); \n}\n\nstd::ostream & operator<<(std::ostream & out, Interval & i){\n\tout << \"[\" << i.getmin() << \",\" << i.getmax() << \"]\" <<endl;\n\treturn out;\n}\n\nstd::ostream & operator<<(std::ostream & out,point_surface & p){\n\tout << \"[ x:\" << p.x << \", z: \" << p.z << \"]\" << endl;\n\treturn out;\n}\n\npchunksel analyse_json_unknown(wmValue & v, bool & error);\npoint analyse_point(wmValue & v, bool & error){\n\twmObject obj = v.get_obj();\n\n\tstd::cout << \"analysing point\" <<std::endl;\t\n\tint X,Y,Z ;\n\tX=Y=Z=0;\n\tstd::wstring str_x(L\"X\") ; \n\tX = obj[std::wstring(str_x)].get_int(); \/\/ .get(\"X\").get_int();\n\tstd::wstring str_y(L\"Y\") ; \n\tY = obj[std::wstring(str_y)].get_int();\n\tstd::wstring str_z(L\"Z\") ; \n\tZ = obj[std::wstring(str_z)].get_int();\n\n\treturn point(X,Y,Z);\t\n}\n\npchunksel analyse_json_circle(wmValue & v, bool & error){\n\t\/\/ pallchunksel sel(new all_criterium_chunk_selector());\n\tstd::cout << \"analysing circle\" << std::endl;\n\t\n\tpoint p = analyse_point(v.get_obj()[L\"center\"],error);\n\tpoint_surface p_s(p.x,p.z);\t\n\tint size = v.get_obj()[L\"diameter\"].get_int();\n\tin_circle_predicate in_c(p_s,size);\n\t\t\n\treturn pchunksel(new in_circle_criterium(in_c)) ;\n}\n\npchunksel analyse_json_not(wmValue & v, bool & error){\n\tpchunksel inverse( analyse_json_unknown(v,error));\n\tpchunksel sel(new not_in_criterium_chunk_selector(inverse));\n\treturn sel;\n}\n\n\npchunksel analyse_json_and (wmValue & v,bool & error){\n\tstd::cout << \"analysing and\" << std::endl ;\n\tpallchunksel andsel( new all_criterium_chunk_selector());\n\tswitch (v.type()) {\n\t\tcase array_type:\n\t\t\tBOOST_FOREACH(wmValue val, v.get_array() ){\n\t\t\t\tandsel->add_criterium(analyse_json_unknown(val, error));\n\t\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\t\tcout << \"erreur de parsing dans le \\\"and\\\" : attendu un tableau\";\n\t\terror=true;\n\t}\n\treturn andsel;\n}\n\npchunksel analyse_json_or (wmValue & v,bool & error){\n\tstd::cout << \"analysing unknown\" << std::endl;\n\tpanychunksel anysel( new any_criterium_chunk_selector());\n\tswitch (v.type()) {\n\t\tcase array_type:\n\t\t\tBOOST_FOREACH(wmValue val, v.get_array() ){\n\t\t\t\tanysel->add_criterium(analyse_json_unknown(val, error));\n\t\t\t}\n\n\t\tbreak;\n\t\tdefault:\n\t\tcout << \"or error parsing\" << std::endl;\n\t\terror=true;\n\t}\n\treturn anysel;\n}\n\npchunksel analyse_json_unknown(wmValue & v, bool & error){\n\tpchunksel sel;\n\twmObject obj;\n\tstd::cout << \"analysing unknown\" << std::endl;\n\tswitch (v.type()){\n\t\tcase obj_type:\n\t\tobj=v.get_obj();\n\t\tBOOST_FOREACH(wmConfig::Pair_type obj_,obj ){\n\t\t\twstring first = obj_.first ;\n\t\t\tstd::cout << \"plop\";\n\t\t\tstd::wcout << first << std::endl;\n\t\t}\n\t\tstd::cout << \"is an obj\" <<std::endl;\n\t\tif (obj.count( L\"circle\") > 0 ){\n\t\t\tsel = analyse_json_circle(obj[L\"circle\"],error);\n\t\t}else if (obj.count( L\"and\") > 0 ){\n\t\t\tsel = analyse_json_and(obj[L\"and\"],error);\n\t\t}else if(obj.count( L\"or\") > 0 ){\n\t\t\tsel = analyse_json_or(obj[L\"or\"],error);\n\t\t}else if(obj.count( L\"not\") > 0 ){\n\t\t\tsel = analyse_json_not(obj[L\"not\"],error);\n\t\t}else {\n\t\t\n\t\t\tcout << \"JSon SPec Error : not niether a and, not or circle\" << std::endl; \n\t\t\terror=true;\n\t\t}\n\t\tbreak;\n\t\tdefault:\n\t\t\tcout << \"Json Spec Error : Object waited\";\n\t\t\terror=true;\n\t}\n\treturn sel;\n}\n\npchunksel selector_factory::from_json_spec(std::string & filename){\n\tstd::wifstream json_file(filename.c_str());\n\tbool error = false;\n\tif (! json_file.good()){\n\t\tstd::cout << \"bad json spec selector file : \"<< filename <<\" exiting\" << std::endl; \n\t\texit(0);\n\t}\n\twmValue value;\n\n\tread_stream(json_file,value);\n\tpchunksel p(analyse_json_and(value,error));\n\tif(error){\n\t\tstd::cout << \"erreur de parsing\" << std::endl;\n\t\texit(0);\n\t}\n\n\treturn p;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkImageToSurfaceFilter.h\"\n#include <vtkImageData.h>\n#include <vtkDecimate.h>\n#include <vtkDecimatePro.h>\n#include <vtkImageChangeInformation.h>\n#include <vtkLinearTransform.h>\n#include <vtkMath.h>\n#include <vtkMatrix4x4.h>\n\nmitk::ImageToSurfaceFilter::ImageToSurfaceFilter()\n{\n m_Smooth = false;\n m_Decimate = NoDecimation;\n m_Threshold = 1;\n m_TargetReduction = 0.95f;\n};\n\nmitk::ImageToSurfaceFilter::~ImageToSurfaceFilter()\n{\n};\n\ntemplate <class T1, class T2, class T3>\ninline void mitkVtkLinearTransformPoint(T1 matrix[4][4], \n T2 in[3], T3 out[3])\n{\n T3 x = matrix[0][0]*in[0]+matrix[0][1]*in[1]+matrix[0][2]*in[2]+matrix[0][3];\n T3 y = matrix[1][0]*in[0]+matrix[1][1]*in[1]+matrix[1][2]*in[2]+matrix[1][3];\n T3 z = matrix[2][0]*in[0]+matrix[2][1]*in[1]+matrix[2][2]*in[2]+matrix[2][3];\n\n out[0] = x;\n out[1] = y;\n out[2] = z;\n}\n\nvoid mitk::ImageToSurfaceFilter::CreateSurface(int time, vtkImageData *vtkimage, mitk::Surface * surface, const ScalarType threshold)\n{\n vtkImageChangeInformation *indexCoordinatesImageFilter = vtkImageChangeInformation::New();\n indexCoordinatesImageFilter->SetInput(vtkimage);\n indexCoordinatesImageFilter->SetOutputOrigin(0.0,0.0,0.0);\n\n \/\/MarchingCube -->create Surface\n vtkMarchingCubes *skinExtractor = vtkMarchingCubes::New();\n skinExtractor->SetInput(indexCoordinatesImageFilter->GetOutput());\/\/RC++\n indexCoordinatesImageFilter->Delete();\n skinExtractor->SetValue(0, threshold);\n\n vtkPolyData *polydata;\n polydata = skinExtractor->GetOutput();\n polydata->Register(NULL);\/\/RC++\n skinExtractor->Delete();\n\n if (m_Smooth)\n {\n int spIterations =50;\n float spRelaxation =0.1;\n\n vtkSmoothPolyDataFilter *smoother = vtkSmoothPolyDataFilter::New();\n \/\/read poly1 (poly1 can be the original polygon, or the decimated polygon)\n smoother->SetInput(polydata);\/\/RC++\n smoother->SetNumberOfIterations( spIterations );\n smoother->SetRelaxationFactor( spRelaxation );\n smoother->SetFeatureAngle( 60 );\n smoother->FeatureEdgeSmoothingOff();\n smoother->BoundarySmoothingOff();\n smoother->SetConvergence( 0 );\n\n polydata->Delete();\/\/RC--\n polydata = smoother->GetOutput();\n polydata->Register(NULL);\/\/RC++\n smoother->Delete();\n }\n\n \/\/decimate = to reduce number of polygons\n if(m_Decimate==DecimatePro)\n {\n vtkDecimatePro *decimate = vtkDecimatePro::New();\n decimate->SplittingOff();\n decimate->SetErrorIsAbsolute(5);\n decimate->SetFeatureAngle(30);\n decimate->PreserveTopologyOn();\n decimate->BoundaryVertexDeletionOff();\n decimate->SetDegree(10); \/\/std-value is 25!\n\n decimate->SetInput(polydata);\/\/RC++\n decimate->SetTargetReduction(m_TargetReduction);\n decimate->SetMaximumError(0.002);\n\n polydata->Delete();\/\/RC--\n polydata = decimate->GetOutput();\n polydata->Register(NULL);\/\/RC++\n decimate->Delete();\n }\n else if (m_Decimate==Decimate)\n {\n vtkDecimate *decimate = vtkDecimate::New();\n decimate->SetInput( polydata );\n decimate->PreserveTopologyOn();\n decimate->BoundaryVertexDeletionOff();\n decimate->SetTargetReduction( m_TargetReduction );\n polydata->Delete();\/\/RC--\n polydata = decimate->GetOutput();\n polydata->Register(NULL);\/\/RC++\n decimate->Delete();\n }\n\n polydata->Update();\n\n polydata->SetSource(NULL);\n\n vtkFloatingPointType* spacing;\n spacing = vtkimage->GetSpacing();\n\n vtkPoints * points = polydata->GetPoints();\n vtkMatrix4x4 *vtkmatrix = vtkMatrix4x4::New();\n GetInput()->GetGeometry(time)->GetVtkTransform()->GetMatrix(vtkmatrix);\n double (*matrix)[4] = vtkmatrix->Element;\n\n unsigned int i,j;\n for(i=0;i<3;++i)\n for(j=0;j<3;++j)\n matrix[i][j]\/=spacing[j];\n\n unsigned int n = points->GetNumberOfPoints();\n vtkFloatingPointType point[3];\n\n for (i = 0; i < n; i++)\n {\n points->GetPoint(i, point);\n mitkVtkLinearTransformPoint(matrix,point,point);\n points->SetPoint(i, point);\n }\n vtkmatrix->Delete();\n\n surface->SetVtkPolyData(polydata, time);\n polydata->UnRegister(NULL);\n}\n\n\nvoid mitk::ImageToSurfaceFilter::GenerateData()\n{\n mitk::Surface *surface = this->GetOutput();\n mitk::Image * image = (mitk::Image*)GetInput();\n mitk::Image::RegionType outputRegion = image->GetRequestedRegion();\n\n int tstart=outputRegion.GetIndex(3);\n int tmax=tstart+outputRegion.GetSize(3); \/\/GetSize()==1 - will aber 0 haben, wenn nicht zeitaufgelst\n\n int t;\n for( t=tstart; t < tmax; ++t)\n {\n vtkImageData *vtkimagedata = image->GetVtkImageData(t);\n CreateSurface(t,vtkimagedata,surface,m_Threshold);\n }\n}\n\n\nvoid mitk::ImageToSurfaceFilter::SetInput(const mitk::Image *image)\n{\n \/\/ Process object is not const-correct so the const_cast is required here\n this->ProcessObject::SetNthInput(0, const_cast< mitk::Image * >( image ) );\n}\n\n\nconst mitk::Image *mitk::ImageToSurfaceFilter::GetInput(void)\n{\n if (this->GetNumberOfInputs() < 1)\n {\n return 0;\n }\n\n return static_cast<const mitk::Image * >\n ( this->ProcessObject::GetInput(0) );\n}\n\n\nvoid mitk::ImageToSurfaceFilter::GenerateOutputInformation()\n{\n mitk::Image::ConstPointer inputImage =(mitk::Image*) this->GetInput();\n \n \/\/mitk::Image *inputImage = (mitk::Image*)this->GetImage();\n mitk::Surface::Pointer output = this->GetOutput();\n\n itkDebugMacro(<<\"GenerateOutputInformation()\");\n\n if(inputImage.IsNull()) return;\n \n \/\/Set Data\n}\n<commit_msg>FIX: do not crash when no surface has been generated<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkImageToSurfaceFilter.h\"\n#include <vtkImageData.h>\n#include <vtkDecimate.h>\n#include <vtkDecimatePro.h>\n#include <vtkImageChangeInformation.h>\n#include <vtkLinearTransform.h>\n#include <vtkMath.h>\n#include <vtkMatrix4x4.h>\n\nmitk::ImageToSurfaceFilter::ImageToSurfaceFilter()\n{\n m_Smooth = false;\n m_Decimate = NoDecimation;\n m_Threshold = 1;\n m_TargetReduction = 0.95f;\n};\n\nmitk::ImageToSurfaceFilter::~ImageToSurfaceFilter()\n{\n};\n\ntemplate <class T1, class T2, class T3>\ninline void mitkVtkLinearTransformPoint(T1 matrix[4][4], \n T2 in[3], T3 out[3])\n{\n T3 x = matrix[0][0]*in[0]+matrix[0][1]*in[1]+matrix[0][2]*in[2]+matrix[0][3];\n T3 y = matrix[1][0]*in[0]+matrix[1][1]*in[1]+matrix[1][2]*in[2]+matrix[1][3];\n T3 z = matrix[2][0]*in[0]+matrix[2][1]*in[1]+matrix[2][2]*in[2]+matrix[2][3];\n\n out[0] = x;\n out[1] = y;\n out[2] = z;\n}\n\nvoid mitk::ImageToSurfaceFilter::CreateSurface(int time, vtkImageData *vtkimage, mitk::Surface * surface, const ScalarType threshold)\n{\n vtkImageChangeInformation *indexCoordinatesImageFilter = vtkImageChangeInformation::New();\n indexCoordinatesImageFilter->SetInput(vtkimage);\n indexCoordinatesImageFilter->SetOutputOrigin(0.0,0.0,0.0);\n\n \/\/MarchingCube -->create Surface\n vtkMarchingCubes *skinExtractor = vtkMarchingCubes::New();\n skinExtractor->SetInput(indexCoordinatesImageFilter->GetOutput());\/\/RC++\n indexCoordinatesImageFilter->Delete();\n skinExtractor->SetValue(0, threshold);\n\n vtkPolyData *polydata;\n polydata = skinExtractor->GetOutput();\n polydata->Register(NULL);\/\/RC++\n skinExtractor->Delete();\n\n if (m_Smooth)\n {\n int spIterations =50;\n float spRelaxation =0.1;\n\n vtkSmoothPolyDataFilter *smoother = vtkSmoothPolyDataFilter::New();\n \/\/read poly1 (poly1 can be the original polygon, or the decimated polygon)\n smoother->SetInput(polydata);\/\/RC++\n smoother->SetNumberOfIterations( spIterations );\n smoother->SetRelaxationFactor( spRelaxation );\n smoother->SetFeatureAngle( 60 );\n smoother->FeatureEdgeSmoothingOff();\n smoother->BoundarySmoothingOff();\n smoother->SetConvergence( 0 );\n\n polydata->Delete();\/\/RC--\n polydata = smoother->GetOutput();\n polydata->Register(NULL);\/\/RC++\n smoother->Delete();\n }\n\n \/\/decimate = to reduce number of polygons\n if(m_Decimate==DecimatePro)\n {\n vtkDecimatePro *decimate = vtkDecimatePro::New();\n decimate->SplittingOff();\n decimate->SetErrorIsAbsolute(5);\n decimate->SetFeatureAngle(30);\n decimate->PreserveTopologyOn();\n decimate->BoundaryVertexDeletionOff();\n decimate->SetDegree(10); \/\/std-value is 25!\n\n decimate->SetInput(polydata);\/\/RC++\n decimate->SetTargetReduction(m_TargetReduction);\n decimate->SetMaximumError(0.002);\n\n polydata->Delete();\/\/RC--\n polydata = decimate->GetOutput();\n polydata->Register(NULL);\/\/RC++\n decimate->Delete();\n }\n else if (m_Decimate==Decimate)\n {\n vtkDecimate *decimate = vtkDecimate::New();\n decimate->SetInput( polydata );\n decimate->PreserveTopologyOn();\n decimate->BoundaryVertexDeletionOff();\n decimate->SetTargetReduction( m_TargetReduction );\n polydata->Delete();\/\/RC--\n polydata = decimate->GetOutput();\n polydata->Register(NULL);\/\/RC++\n decimate->Delete();\n }\n\n polydata->Update();\n\n polydata->SetSource(NULL);\n\n if(polydata->GetNumberOfPoints() > 0)\n {\n vtkFloatingPointType* spacing;\n spacing = vtkimage->GetSpacing();\n\n vtkPoints * points = polydata->GetPoints();\n vtkMatrix4x4 *vtkmatrix = vtkMatrix4x4::New();\n GetInput()->GetGeometry(time)->GetVtkTransform()->GetMatrix(vtkmatrix);\n double (*matrix)[4] = vtkmatrix->Element;\n\n unsigned int i,j;\n for(i=0;i<3;++i)\n for(j=0;j<3;++j)\n matrix[i][j]\/=spacing[j];\n\n unsigned int n = points->GetNumberOfPoints();\n vtkFloatingPointType point[3];\n\n for (i = 0; i < n; i++)\n {\n points->GetPoint(i, point);\n mitkVtkLinearTransformPoint(matrix,point,point);\n points->SetPoint(i, point);\n }\n vtkmatrix->Delete();\n }\n\n surface->SetVtkPolyData(polydata, time);\n polydata->UnRegister(NULL);\n}\n\n\nvoid mitk::ImageToSurfaceFilter::GenerateData()\n{\n mitk::Surface *surface = this->GetOutput();\n mitk::Image * image = (mitk::Image*)GetInput();\n mitk::Image::RegionType outputRegion = image->GetRequestedRegion();\n\n int tstart=outputRegion.GetIndex(3);\n int tmax=tstart+outputRegion.GetSize(3); \/\/GetSize()==1 - will aber 0 haben, wenn nicht zeitaufgelst\n\n int t;\n for( t=tstart; t < tmax; ++t)\n {\n vtkImageData *vtkimagedata = image->GetVtkImageData(t);\n CreateSurface(t,vtkimagedata,surface,m_Threshold);\n }\n}\n\n\nvoid mitk::ImageToSurfaceFilter::SetInput(const mitk::Image *image)\n{\n \/\/ Process object is not const-correct so the const_cast is required here\n this->ProcessObject::SetNthInput(0, const_cast< mitk::Image * >( image ) );\n}\n\n\nconst mitk::Image *mitk::ImageToSurfaceFilter::GetInput(void)\n{\n if (this->GetNumberOfInputs() < 1)\n {\n return 0;\n }\n\n return static_cast<const mitk::Image * >\n ( this->ProcessObject::GetInput(0) );\n}\n\n\nvoid mitk::ImageToSurfaceFilter::GenerateOutputInformation()\n{\n mitk::Image::ConstPointer inputImage =(mitk::Image*) this->GetInput();\n \n \/\/mitk::Image *inputImage = (mitk::Image*)this->GetImage();\n mitk::Surface::Pointer output = this->GetOutput();\n\n itkDebugMacro(<<\"GenerateOutputInformation()\");\n\n if(inputImage.IsNull()) return;\n \n \/\/Set Data\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"StateMachine.h\"\n#include \"StateTransitionOperation.h\"\n#include \"OperationEvent.h\"\n#include \"UndoController.h\"\n\n\/\/##ModelId=3E5B2DB301FD\nmitk::StateMachine::StateMachine(std::string type)\n: m_Type(type), m_CurrentState(0)\n{}\n\n\/\/##ModelId=3E5B2E660087\nstd::string mitk::StateMachine::GetType() const\n{\n\treturn m_Type;\n}\n\n\/\/##ModelId=3E5B2DE30378\nbool mitk::StateMachine::HandleEvent(StateEvent const* stateEvent)\n{\n\tif (m_CurrentState == NULL)\n\t\treturn false;\/\/m_CurrentState needs to be set first!\n\n\tconst Transition *tempTransition = m_CurrentState->GetTransition(stateEvent->GetId());\n\tState *tempState = tempTransition->GetNextState();\n\tif (tempState == NULL)\n\t\treturn false;\n\tint tempSideEffectId = tempTransition->GetSideEffectId();\n\n\t\/\/UNDO StateTransitionOperation\n\tStateTransitionOperation* undoSTO = new StateTransitionOperation(mitk::STATETRANSITION, m_CurrentState);\n\tStateTransitionOperation* redoSTO = new StateTransitionOperation(mitk::STATETRANSITION, tempState);\/\/tempStateZeiger? mgl. Fehlerquelle\n\t\n\t\/\/Dummy\n\t\/\/OperationActor *destination = new OperationActor;\/\/hier StateMachine, also \"this\"???\n\t\/\/Dummy\n\n\tOperationEvent *tempOE = new OperationEvent();\/\/to get Object- and GroupEventId\n\tOperationEvent *operationEvent = new OperationEvent(((mitk::OperationActor*)(this)), undoSTO, redoSTO, \n\t\t\t\t\t\ttempOE->GenerateObjectEventId(), tempOE->GenerateGroupEventId());\n\tUndoController *undoController = new UndoController(mitk::LIMITEDLINEARUNDO);\/\/switch to LLU or add LLU\n\tundoController->SetOperationEvent(operationEvent);\n\n\t\/\/first following StateChange, then operation(SideEffect)\n\tm_CurrentState = tempState;\n\t\n\tbool ok = ExecuteSideEffect(tempSideEffectId);\/\/Undo in ExecuteSideEffect(...)\n\treturn ok;\n}\n\n\n<commit_msg>error notification test<commit_after>#include \"StateMachine.h\"\n#include \"StateTransitionOperation.h\"\n#include \"OperationEvent.h\"\n#include \"UndoController.h\"\n\n\n#include \"StupidErrorNotification.h\"\n\n\/\/##ModelId=3E5B2DB301FD\nmitk::StateMachine::StateMachine(std::string type)\n: m_Type(type), m_CurrentState(0)\n{}\n\n\/\/##ModelId=3E5B2E660087\nstd::string mitk::StateMachine::GetType() const\n{\n\treturn m_Type;\n}\n\n\/\/##ModelId=3E5B2DE30378\nbool mitk::StateMachine::HandleEvent(StateEvent const* stateEvent)\n{\n\tif (m_CurrentState == NULL)\n\t\treturn false;\/\/m_CurrentState needs to be set first!\n\n\tconst Transition *tempTransition = m_CurrentState->GetTransition(stateEvent->GetId());\n\tState *tempState = tempTransition->GetNextState();\n\tif (tempState == NULL)\n\t\treturn false;\n\tint tempSideEffectId = tempTransition->GetSideEffectId();\n\n\t\/\/UNDO StateTransitionOperation\n\tStateTransitionOperation* undoSTO = new StateTransitionOperation(mitk::STATETRANSITION, m_CurrentState);\n\tStateTransitionOperation* redoSTO = new StateTransitionOperation(mitk::STATETRANSITION, tempState);\/\/tempStateZeiger? mgl. Fehlerquelle\n\t\n\t\/\/Dummy\n\t\/\/OperationActor *destination = new OperationActor;\/\/hier StateMachine, also \"this\"???\n\t\/\/Dummy\n\n\tOperationEvent *tempOE = new OperationEvent();\/\/to get Object- and GroupEventId\n\tOperationEvent *operationEvent = new OperationEvent(((mitk::OperationActor*)(this)), undoSTO, redoSTO, \n\t\t\t\t\t\ttempOE->GenerateObjectEventId(), tempOE->GenerateGroupEventId());\n\tUndoController *undoController = new UndoController(mitk::LIMITEDLINEARUNDO);\/\/switch to LLU or add LLU\n\tundoController->SetOperationEvent(operationEvent);\n\n\t\/\/first following StateChange, then operation(SideEffect)\n\tm_CurrentState = tempState;\n\t\n\tbool ok = ExecuteSideEffect(tempSideEffectId);\/\/Undo in ExecuteSideEffect(...)\n\treturn ok;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"otbVectorRescaleIntensityImageFilter.h\"\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {ROI_QB_MUL_1.png}\n\/\/ OUTPUTS: {PCAOutput.tif}, {InversePCAOutput.tif},{InversePCAOutput1.png}, {PCAOutput1.png}, {PCAOutput2.png}, {PCAOutput3.png}\n\/\/ 3\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example illustrates the use of the\n\/\/ \\doxygen{otb}{PCAImageFilter}.\n\/\/ This filter computes a Principal Component Analysis using an\n\/\/ efficient method based on the inner product in order to compute the\n\/\/ covariance matrix.\n\/\/\n\/\/ The first step required to use this filter is to include its header file.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbPCAImageFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\n\nint main(int argc, char* argv[])\n{\n typedef double PixelType;\n const unsigned int Dimension = 2;\n const char * inputFileName = argv[1];\n const char * outputFilename = argv[2];\n const char * outputInverseFilename = argv[3];\n const unsigned int numberOfPrincipalComponentsRequired(atoi(argv[8]));\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We start by defining the types for the images and the reader and\n \/\/ the writer. We choose to work with a \\doxygen{otb}{VectorImage},\n \/\/ since we will produce a multi-channel image (the principal\n \/\/ components) from a multi-channel input image.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::VectorImage<PixelType, Dimension> ImageType;\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::ImageFileWriter<ImageType> WriterType;\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We instantiate now the image reader and we set the image file name.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFileName);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We define the type for the filter. It is templated over the input\n \/\/ and the output image types and also the transformation direction. The\n \/\/ internal structure of this filter is a filter-to-filter like structure.\n \/\/ We can now the instantiate the filter.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::PCAImageFilter<ImageType, ImageType,\n otb::Transform::FORWARD> PCAFilterType;\n PCAFilterType::Pointer pcafilter = PCAFilterType::New();\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The only parameter needed for the PCA is the number of principal\n \/\/ components required as output. We can choose to get less PCs than\n \/\/ the number of input bands.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n pcafilter->SetNumberOfPrincipalComponentsRequired(\n numberOfPrincipalComponentsRequired);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We now instantiate the writer and set the file name for the\n \/\/ output image.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName(outputFilename);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We finally plug the pipeline and trigger the PCA computation with\n \/\/ the method \\code{Update()} of the writer.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n pcafilter->SetInput(reader->GetOutput());\n writer->SetInput(pcafilter->GetOutput());\n\n writer->Update();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ \\doxygen{otb}{PCAImageFilter} allows also to compute inverse\n \/\/ transformation from PCA coefficients. In REVERSE mode, the \n \/\/ covariance matrix or the transformation matrix\n \/\/ (which may not be square) has to be given.\n \/\/\n \/\/ Software Guide : EndLatex\n \n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::PCAImageFilter< ImageType, ImageType, otb::Transform::INVERSE > InvPCAFilterType;\n InvPCAFilterType::Pointer invFilter = InvPCAFilterType::New();\n invFilter->SetInput(pcafilter->GetOutput());\n invFilter->SetTransformationMatrix(pcafilter->GetTransformationMatrix());\n \n WriterType::Pointer invWriter = WriterType::New();\n invWriter->SetFileName(outputInverseFilename );\n invWriter->SetInput(invFilter->GetOutput() );\n\n invWriter->Update();\n\n \/\/ Software Guide : EndCodeSnippet\n \n \/\/ Software Guide : BeginLatex\n \/\/ Figure~\\ref{fig:PCA_FILTER} shows the result of applying\n \/\/ the PCA to a 3 band RGB image.\n \/\/ \\begin{figure}\n \/\/ \\center\n \/\/ \\includegraphics[width=0.25\\textwidth]{ROI_QB_MUL_1.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput1.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput2.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput3.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{InversePCAOutput1.eps}\n \/\/ \\itkcaption[PCA Filter (forward trasnformation)]{Result of applying the\n \/\/ \\doxygen{otb}{PCAImageFilter} to an image. From left\n \/\/ to right and top to bottom:\n \/\/ original image, first PC, second PC, third PC and inverse mode output.}\n \/\/ \\label{fig:PCA_FILTER}\n \/\/ \\end{figure}\n \/\/\n \/\/ Software Guide : EndLatex\n\n typedef otb::Image<PixelType, Dimension> MonoImageType;\n\n typedef otb::MultiToMonoChannelExtractROI<PixelType, PixelType>\n ExtractROIFilterType;\n\n typedef otb::Image<unsigned char, 2> OutputImageType;\n typedef otb::VectorImage<unsigned char, 2> OutputPrettyImageType;\n typedef otb::ImageFileWriter<OutputImageType> WriterType2;\n typedef otb::ImageFileWriter<OutputPrettyImageType> WriterType3;\n \n typedef itk::RescaleIntensityImageFilter<MonoImageType,\n OutputImageType> RescalerType;\n \n typedef otb::VectorRescaleIntensityImageFilter<ImageType,\n\t\t\t\t\t\t OutputPrettyImageType> RescalerType2;\n typedef ImageType::PixelType VectorPixelType;\n\n for (unsigned int cpt = 0; cpt < numberOfPrincipalComponentsRequired; cpt++)\n {\n ExtractROIFilterType::Pointer extractROIFilter = ExtractROIFilterType::New();\n RescalerType::Pointer rescaler = RescalerType::New();\n WriterType2::Pointer writer2 = WriterType2::New();\n\n extractROIFilter->SetInput(pcafilter->GetOutput());\n extractROIFilter->SetChannel(cpt + 1);\n\n rescaler->SetInput(extractROIFilter->GetOutput());\n rescaler->SetOutputMinimum(0);\n rescaler->SetOutputMaximum(255);\n\n writer2->SetInput(rescaler->GetOutput());\n writer2->SetFileName(argv[cpt + 5]);\n writer2->Update();\n }\n\n WriterType3::Pointer writerInverse = WriterType3::New();\n RescalerType2::Pointer rescalerInverse = RescalerType2::New();\n rescalerInverse->SetInput(invFilter->GetOutput());\n \n VectorPixelType minimum, maximum;\n minimum.SetSize(3);\n maximum.SetSize(3);\n minimum.Fill(0);\n maximum.Fill(255);\n rescalerInverse->SetOutputMinimum(minimum);\n rescalerInverse->SetOutputMaximum(maximum);\n\n writerInverse->SetInput(rescalerInverse->GetOutput());\n writerInverse->SetFileName(argv[4]);\n writerInverse->Update();\n\n return EXIT_SUCCESS;\n}\n<commit_msg>STYLE:kwstyle<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbImage.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"otbVectorRescaleIntensityImageFilter.h\"\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {ROI_QB_MUL_1.png}\n\/\/ OUTPUTS: {PCAOutput.tif}, {InversePCAOutput.tif},{InversePCAOutput1.png}, {PCAOutput1.png}, {PCAOutput2.png}, {PCAOutput3.png}\n\/\/ 3\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example illustrates the use of the\n\/\/ \\doxygen{otb}{PCAImageFilter}.\n\/\/ This filter computes a Principal Component Analysis using an\n\/\/ efficient method based on the inner product in order to compute the\n\/\/ covariance matrix.\n\/\/\n\/\/ The first step required to use this filter is to include its header file.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbPCAImageFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\n\nint main(int argc, char* argv[])\n{\n typedef double PixelType;\n const unsigned int Dimension = 2;\n const char * inputFileName = argv[1];\n const char * outputFilename = argv[2];\n const char * outputInverseFilename = argv[3];\n const unsigned int numberOfPrincipalComponentsRequired(atoi(argv[8]));\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We start by defining the types for the images and the reader and\n \/\/ the writer. We choose to work with a \\doxygen{otb}{VectorImage},\n \/\/ since we will produce a multi-channel image (the principal\n \/\/ components) from a multi-channel input image.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::VectorImage<PixelType, Dimension> ImageType;\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::ImageFileWriter<ImageType> WriterType;\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We instantiate now the image reader and we set the image file name.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFileName);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We define the type for the filter. It is templated over the input\n \/\/ and the output image types and also the transformation direction. The\n \/\/ internal structure of this filter is a filter-to-filter like structure.\n \/\/ We can now the instantiate the filter.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::PCAImageFilter<ImageType, ImageType,\n otb::Transform::FORWARD> PCAFilterType;\n PCAFilterType::Pointer pcafilter = PCAFilterType::New();\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ The only parameter needed for the PCA is the number of principal\n \/\/ components required as output. We can choose to get less PCs than\n \/\/ the number of input bands.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n pcafilter->SetNumberOfPrincipalComponentsRequired(\n numberOfPrincipalComponentsRequired);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We now instantiate the writer and set the file name for the\n \/\/ output image.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName(outputFilename);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We finally plug the pipeline and trigger the PCA computation with\n \/\/ the method \\code{Update()} of the writer.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n pcafilter->SetInput(reader->GetOutput());\n writer->SetInput(pcafilter->GetOutput());\n\n writer->Update();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ \\doxygen{otb}{PCAImageFilter} allows also to compute inverse\n \/\/ transformation from PCA coefficients. In REVERSE mode, the \n \/\/ covariance matrix or the transformation matrix\n \/\/ (which may not be square) has to be given.\n \/\/\n \/\/ Software Guide : EndLatex\n \n \/\/ Software Guide : BeginCodeSnippet\n typedef otb::PCAImageFilter< ImageType, ImageType, otb::Transform::INVERSE > InvPCAFilterType;\n InvPCAFilterType::Pointer invFilter = InvPCAFilterType::New();\n invFilter->SetInput(pcafilter->GetOutput());\n invFilter->SetTransformationMatrix(pcafilter->GetTransformationMatrix());\n \n WriterType::Pointer invWriter = WriterType::New();\n invWriter->SetFileName(outputInverseFilename );\n invWriter->SetInput(invFilter->GetOutput() );\n\n invWriter->Update();\n\n \/\/ Software Guide : EndCodeSnippet\n \n \/\/ Software Guide : BeginLatex\n \/\/ Figure~\\ref{fig:PCA_FILTER} shows the result of applying\n \/\/ the PCA to a 3 band RGB image.\n \/\/ \\begin{figure}\n \/\/ \\center\n \/\/ \\includegraphics[width=0.25\\textwidth]{ROI_QB_MUL_1.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput1.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput2.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{PCAOutput3.eps}\n \/\/ \\includegraphics[width=0.25\\textwidth]{InversePCAOutput1.eps}\n \/\/ \\itkcaption[PCA Filter (forward trasnformation)]{Result of applying the\n \/\/ \\doxygen{otb}{PCAImageFilter} to an image. From left\n \/\/ to right and top to bottom:\n \/\/ original image, first PC, second PC, third PC and inverse mode output.}\n \/\/ \\label{fig:PCA_FILTER}\n \/\/ \\end{figure}\n \/\/\n \/\/ Software Guide : EndLatex\n\n typedef otb::Image<PixelType, Dimension> MonoImageType;\n\n typedef otb::MultiToMonoChannelExtractROI<PixelType, PixelType>\n ExtractROIFilterType;\n\n typedef otb::Image<unsigned char, 2> OutputImageType;\n typedef otb::VectorImage<unsigned char, 2> OutputPrettyImageType;\n typedef otb::ImageFileWriter<OutputImageType> WriterType2;\n typedef otb::ImageFileWriter<OutputPrettyImageType> WriterType3;\n \n typedef itk::RescaleIntensityImageFilter<MonoImageType,\n OutputImageType> RescalerType;\n \n typedef otb::VectorRescaleIntensityImageFilter<ImageType,\n OutputPrettyImageType> RescalerType2;\n \n typedef ImageType::PixelType VectorPixelType;\n\n for (unsigned int cpt = 0; cpt < numberOfPrincipalComponentsRequired; cpt++)\n {\n ExtractROIFilterType::Pointer extractROIFilter = ExtractROIFilterType::New();\n RescalerType::Pointer rescaler = RescalerType::New();\n WriterType2::Pointer writer2 = WriterType2::New();\n\n extractROIFilter->SetInput(pcafilter->GetOutput());\n extractROIFilter->SetChannel(cpt + 1);\n\n rescaler->SetInput(extractROIFilter->GetOutput());\n rescaler->SetOutputMinimum(0);\n rescaler->SetOutputMaximum(255);\n\n writer2->SetInput(rescaler->GetOutput());\n writer2->SetFileName(argv[cpt + 5]);\n writer2->Update();\n }\n\n WriterType3::Pointer writerInverse = WriterType3::New();\n RescalerType2::Pointer rescalerInverse = RescalerType2::New();\n rescalerInverse->SetInput(invFilter->GetOutput());\n \n VectorPixelType minimum, maximum;\n minimum.SetSize(3);\n maximum.SetSize(3);\n minimum.Fill(0);\n maximum.Fill(255);\n rescalerInverse->SetOutputMinimum(minimum);\n rescalerInverse->SetOutputMaximum(maximum);\n\n writerInverse->SetInput(rescalerInverse->GetOutput());\n writerInverse->SetFileName(argv[4]);\n writerInverse->Update();\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkSimpleImageToImageFilter.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkSimpleImageToImageFilter.h\"\n\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkCxxRevisionMacro(vtkSimpleImageToImageFilter, \"1.14\");\n\n\/\/----------------------------------------------------------------------------\nvtkSimpleImageToImageFilter::vtkSimpleImageToImageFilter()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvtkSimpleImageToImageFilter::~vtkSimpleImageToImageFilter()\n{\n}\n\nint vtkSimpleImageToImageFilter::RequestUpdateExtent (\n vtkInformation * vtkNotUsed(request),\n vtkInformationVector **inputVector,\n vtkInformationVector *vtkNotUsed( outputVector ))\n{\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n \/\/ always request the whole extent\n inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(),\n inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT()),6);\n\n return 1;\n}\n\nint vtkSimpleImageToImageFilter::RequestData(\n vtkInformation* vtkNotUsed( request ),\n vtkInformationVector** inputVector,\n vtkInformationVector* outputVector)\n{\n \/\/ get the data object\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n vtkImageData *output = vtkImageData::SafeDownCast(\n outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n vtkImageData *input = vtkImageData::SafeDownCast(\n inInfo->Get(vtkDataObject::DATA_OBJECT()));\n \n \/\/ Set the extent of the output and allocate memory.\n output->SetExtent(\n outInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT()));\n output->AllocateScalars();\n\n this->SimpleExecute(input, output);\n\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSimpleImageToImageFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n}\n<commit_msg>BUG: better handking of empty input<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkSimpleImageToImageFilter.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkSimpleImageToImageFilter.h\"\n\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkCxxRevisionMacro(vtkSimpleImageToImageFilter, \"1.15\");\n\n\/\/----------------------------------------------------------------------------\nvtkSimpleImageToImageFilter::vtkSimpleImageToImageFilter()\n{\n}\n\n\/\/----------------------------------------------------------------------------\nvtkSimpleImageToImageFilter::~vtkSimpleImageToImageFilter()\n{\n}\n\nint vtkSimpleImageToImageFilter::RequestUpdateExtent (\n vtkInformation * vtkNotUsed(request),\n vtkInformationVector **inputVector,\n vtkInformationVector *vtkNotUsed( outputVector ))\n{\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n\n \/\/ always request the whole extent\n inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(),\n inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT()),6);\n\n return 1;\n}\n\nint vtkSimpleImageToImageFilter::RequestData(\n vtkInformation* vtkNotUsed( request ),\n vtkInformationVector** inputVector,\n vtkInformationVector* outputVector)\n{\n \/\/ get the data object\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n vtkImageData *output = vtkImageData::SafeDownCast(\n outInfo->Get(vtkDataObject::DATA_OBJECT()));\n\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n vtkImageData *input = vtkImageData::SafeDownCast(\n inInfo->Get(vtkDataObject::DATA_OBJECT()));\n \n int inExt[6];\n input->GetExtent(inExt);\n \/\/ if the input extent is empty then exit\n if (inExt[1] < inExt[0] ||\n inExt[3] < inExt[2] ||\n inExt[5] < inExt[4])\n {\n return 1;\n }\n \n \/\/ Set the extent of the output and allocate memory.\n output->SetExtent(\n outInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT()));\n output->AllocateScalars();\n\n this->SimpleExecute(input, output);\n\n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkSimpleImageToImageFilter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SyncThread.h\"\n#include \"common\/RhoTime.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/RhoFilePath.h\"\n\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#include \"sync\/ClientRegister.h\"\n\nnamespace rho {\nnamespace sync {\n\nusing namespace rho::common;\nusing namespace rho::db;\n\nIMPLEMENT_LOGCLASS(CSyncThread,\"Sync\");\nCSyncThread* CSyncThread::m_pInstance = 0;\n\n\/*static*\/ CSyncThread* CSyncThread::Create(common::IRhoClassFactory* factory)\n{\n if ( m_pInstance ) \n return m_pInstance;\n\n m_pInstance = new CSyncThread(factory);\n return m_pInstance;\n}\n\n\/*static*\/void CSyncThread::Destroy()\n{\n if ( m_pInstance )\n delete m_pInstance;\n\n m_pInstance = 0;\n}\n\nCSyncThread::CSyncThread(common::IRhoClassFactory* factory) : CThreadQueue(factory)\n{\n CThreadQueue::setLogCategory(getLogCategory());\n\n if( RHOCONF().isExist(\"sync_poll_interval\") )\n setPollInterval(RHOCONF().getInt(\"sync_poll_interval\"));\n\n m_oSyncEngine.setFactory(factory);\n\n if ( RHOCONF().getString(\"syncserver\").length() > 0 )\n start(epLow);\n}\n\nCSyncThread::~CSyncThread(void)\n{\n m_oSyncEngine.exitSync();\n stop(SYNC_WAIT_BEFOREKILL_SECONDS);\n\n db::CDBAdapter::closeAll();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long CSyncThread::getRetValue()\n{\n unsigned long ret = rho_ruby_get_NIL();\n if ( isNoThreadedMode() )\n {\n ret = rho_ruby_create_string( getSyncEngine().getNotify().getNotifyBody().c_str() );\n getSyncEngine().getNotify().cleanNotifyBody();\n }\n\n return ret;\n}\n#else\nunsigned long CSyncThread::getRetValue()\n{\n unsigned long ret = 0;\n if ( isNoThreadedMode() )\n {\n ret = (unsigned long)rho_sync_create_string( getSyncEngine().getNotify().getNotifyBody().c_str() );\n getSyncEngine().getNotify().cleanNotifyBody();\n }\n\n return ret;\n}\n#endif \n\nint CSyncThread::getLastPollInterval()\n{\n uint64 nowTime = CLocalTime().toULong();\n\t\n DBResult( res, CDBAdapter::getUserDB().executeSQL(\"SELECT last_updated from sources\") );\n uint64 latestTimeUpdated = 0;\n for ( ; !res.isEnd(); res.next() )\n { \n uint64 timeUpdated = res.getUInt64ByIdx(0);\n if ( latestTimeUpdated < timeUpdated )\n \tlatestTimeUpdated = timeUpdated;\n }\n\t\n\treturn latestTimeUpdated > 0 ? (int)(nowTime-latestTimeUpdated) : 0;\n}\n\nvoid CSyncThread::processCommands()\/\/throws Exception\n{\n if ( isNoCommands() )\n addQueueCommand(new CSyncCommand(scNone,false));\n\n CThreadQueue::processCommands();\n}\n\nvoid CSyncThread::checkShowStatus(CSyncCommand& oSyncCmd)\n{\n\tboolean bShowStatus = oSyncCmd.m_bShowStatus;\n\tm_oSyncEngine.getNotify().enableReporting(bShowStatus);\n\t\/\/if (bShowStatus)\n\t\t\/\/m_statusListener.createStatusPopup(RhoRuby.getMessageText(\"syncronizing_data\"));\n}\t\n\nvoid CSyncThread::processCommand(IQueueCommand* pCmd)\n{\n CSyncCommand& oSyncCmd = *((CSyncCommand*)pCmd);\n switch(oSyncCmd.m_nCmdCode)\n {\n case scNone:\n if ( getPollInterval() )\n {\n checkShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncAllSources();\n }\n break;\n case scSyncAll:\n checkShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncAllSources();\n break;\n case scSyncOne:\n {\n\t\t\tcheckShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncSource(CSyncEngine::CSourceID(oSyncCmd.m_nCmdParam,oSyncCmd.m_strCmdParam));\n }\n break;\n case scSearchOne:\n {\n\t\t\tcheckShowStatus(oSyncCmd);\n m_oSyncEngine.doSearch( ((CSyncSearchCommand&)oSyncCmd).m_arSources, oSyncCmd.m_strCmdParam, \n ((CSyncSearchCommand&)oSyncCmd).m_strFrom, ((CSyncSearchCommand&)oSyncCmd).m_bSyncChanges,\n oSyncCmd.m_nCmdParam);\n }\n break;\n case scLogin:\n \t{\n \t\tCSyncLoginCommand& oLoginCmd = (CSyncLoginCommand&)oSyncCmd;\n\n checkShowStatus(oSyncCmd);\n \t\tm_oSyncEngine.login(oLoginCmd.m_strName, oLoginCmd.m_strPassword, oLoginCmd.m_strCmdParam );\n \t}\n break;\n }\n}\n\nvoid CSyncThread::setPollInterval(int nInterval)\n{ \n if ( nInterval == 0 )\n m_oSyncEngine.stopSync();\n\n CThreadQueue::setPollInterval(nInterval);\n}\n\nString CSyncThread::CSyncCommand::toString()\n{\n switch(m_nCmdCode)\n {\n case scSyncAll:\n return \"SyncAll\";\n case scSyncOne:\n return \"SyncOne\";\n case scLogin:\n return \"Login\";\n case scSearchOne:\n return \"Search\";\n }\n\n return \"Unknown; Code : \" + convertToStringA(m_nCmdCode);\n}\n\n};\n};\n\nextern \"C\" {\n\nusing namespace rho::sync;\nusing namespace rho::db;\n\t\nunsigned long rho_sync_doSyncAllSources(int show_status_popup)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncAll,show_status_popup!=0));\n\n return CSyncThread::getInstance()->getRetValue();\n}\n\nunsigned long rho_sync_doSyncSourceByID(int nSrcID)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, \"\", nSrcID, false ) );\n return CSyncThread::getInstance()->getRetValue();\n}\n\nunsigned long rho_sync_doSyncSourceByName(const char* szSrcName)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, szSrcName, 0, false ) );\n return CSyncThread::getInstance()->getRetValue();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_doSyncSource(unsigned long nSrcID,int show_status_popup)\n{\n CRhoRubyStringOrInt oSrcID = rho_ruby_getstringorint(nSrcID);\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, oSrcID.m_szStr, (int)oSrcID.m_nInt, show_status_popup!=0 ) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\t\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_stop()\n{\n\tif (CSyncThread::getSyncEngine().isSyncing() )\n\t{\n\t\tCSyncThread::getSyncEngine().stopSyncByUser();\n CSyncThread::getInstance()->stopWait();\n\n while( CDBAdapter::isAnyInsideTransaction() )\n\t\t\tCSyncThread::getInstance()->sleep(100);\n\t}\n}\n\nextern \"C\" void\nsource_iter(const char* szName, void* parSources)\n{\n rho::Vector<rho::String>& arSources = *((rho::Vector<rho::String>*)(parSources));\n arSources.addElement(szName);\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_doSearch(unsigned long ar_sources, const char *from, const char *params, bool sync_changes, int nProgressStep, \n const char* callback, const char* callback_params)\n{\n rho_sync_stop();\n if ( callback && *callback )\n CSyncThread::getSyncEngine().getNotify().setSearchNotification( callback, callback_params ? callback_params : \"\");\n\n rho::Vector<rho::String> arSources;\n rho_ruby_enum_strary(ar_sources, source_iter, &arSources);\n\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncSearchCommand(from,params,arSources,sync_changes,nProgressStep) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\t\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_doSyncSourceByUrl(const char* szSrcUrl)\n{\n const char* szLastSlash = strrchr(szSrcUrl, '\\\\');\n if ( !szLastSlash )\n szLastSlash = strrchr(szSrcUrl, '\/');\n\n const char* szQuest = strrchr(szSrcUrl, '?');\n\n rho::String strName = \"\";\n if (szQuest && szLastSlash)\n strName = rho::String(szLastSlash+1, szQuest-szLastSlash-1);\n else\n strName = szLastSlash ? szLastSlash + 1 : szSrcUrl;\n\n \/\/TODO: save query params\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, strName, (int)0, false ) );\n}\t\n\nvoid rho_sync_set_pollinterval(int nInterval)\n{\n CSyncThread::getInstance()->setPollInterval(nInterval);\n}\n\t\nvoid rho_sync_set_syncserver(char* syncserver)\n{\n rho_sync_stop();\n\n\tCSyncThread::getSyncEngine().setSyncServer(syncserver);\n\n if ( syncserver && *syncserver )\n {\n CSyncThread::getInstance()->start(CSyncThread::epLow);\n if ( CClientRegister::getInstance() != null )\n CClientRegister::getInstance()->startUp();\n }\n else\n {\n CSyncThread::getInstance()->stop(CSyncThread::SYNC_WAIT_BEFOREKILL_SECONDS);\n if ( CClientRegister::getInstance() != null )\n CClientRegister::getInstance()->stop(CSyncThread::SYNC_WAIT_BEFOREKILL_SECONDS);\n }\n}\n\nunsigned long rho_sync_login(const char *name, const char *password, const char* callback)\n{\n rho_sync_stop();\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncLoginCommand(name, password, callback) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\n\nint rho_sync_logged_in()\n{\n\tCDBAdapter& db = CDBAdapter::getUserDB();\n return CSyncThread::getSyncEngine().isLoggedIn() ? 1 : 0;\n}\n\nvoid rho_sync_logout()\n{\n rho_sync_stop();\n\n\tCDBAdapter& db = CDBAdapter::getUserDB();\n CSyncThread::getSyncEngine().logout();\n}\n\nvoid rho_sync_set_notification(int source_id, const char *url, char* params)\n{\n return CSyncThread::getSyncEngine().getNotify().setSyncNotification(source_id, url, params ? params : \"\");\n}\n\nvoid rho_sync_clear_notification(int source_id)\n{\n return CSyncThread::getSyncEngine().getNotify().clearSyncNotification(source_id);\n}\n\nvoid rho_sync_set_bulk_notification(const char *url, char* params)\n{\n return CSyncThread::getSyncEngine().getNotify().setBulkSyncNotification(url, params ? params : \"\");\n}\n\nvoid rho_sync_clear_bulk_notification()\n{\n return CSyncThread::getSyncEngine().getNotify().clearBulkSyncNotification();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_get_attrs(const char* szPartition, int nSrcID)\n{\n return (VALUE)CDBAdapter::getDB(szPartition).getAttrMgr().getAttrsBySrc(nSrcID);\n}\n\nunsigned long rho_sync_is_blob_attr(const char* szPartition, int nSrcID, const char* szAttrName)\n{\n return rho_ruby_create_boolean( CDBAdapter::getDB(szPartition).getAttrMgr().isBlobAttr(nSrcID, szAttrName) );\n}\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_setobjectnotify_url(const char* szUrl)\n{\n CSyncNotify::setObjectNotifyUrl(szUrl);\n}\n\nvoid rho_sync_addobjectnotify(int nSrcID, const char* szObject)\n{\n CSyncThread::getSyncEngine().getNotify().addObjectNotify(nSrcID, szObject);\n}\n\nvoid rho_sync_addobjectnotify_bysrcname(const char* szSrcName, const char* szObject)\n{\n CSyncThread::getSyncEngine().getNotify().addObjectNotify(szSrcName, szObject);\n}\n\nvoid rho_sync_cleanobjectnotify()\n{\n CSyncThread::getSyncEngine().getNotify().cleanObjectNotifications();\n}\n\nint rho_sync_get_lastsync_objectcount(int nSrcID)\n{\n return CSyncThread::getSyncEngine().getNotify().getLastSyncObjectCount(nSrcID);\n}\n\nint rho_sync_get_pagesize()\n{\n return CSyncThread::getSyncEngine().getSyncPageSize();\n}\n\nvoid rho_sync_set_pagesize(int nPageSize)\n{\n CSyncThread::getSyncEngine().setSyncPageSize(nPageSize);\n}\n\nvoid rho_sync_set_threaded_mode(int b)\n{\n CSyncThread::getInstance()->setNonThreadedMode(b==0);\n CSyncThread::getSyncEngine().setNonThreadedMode(b==0);\n}\n\nchar* rho_sync_create_string(const char* szStr)\n{\n return strdup(szStr);\n}\n\nvoid rho_sync_free_string(char* szStr)\n{\n return free(szStr);\n}\n\n}\n<commit_msg>add pollinterval description<commit_after>#include \"SyncThread.h\"\n#include \"common\/RhoTime.h\"\n#include \"common\/RhoConf.h\"\n#include \"common\/RhoFilePath.h\"\n\n#include \"ruby\/ext\/rho\/rhoruby.h\"\n#include \"sync\/ClientRegister.h\"\n\nnamespace rho {\nnamespace sync {\n\nusing namespace rho::common;\nusing namespace rho::db;\n\nIMPLEMENT_LOGCLASS(CSyncThread,\"Sync\");\nCSyncThread* CSyncThread::m_pInstance = 0;\n\n\/*static*\/ CSyncThread* CSyncThread::Create(common::IRhoClassFactory* factory)\n{\n if ( m_pInstance ) \n return m_pInstance;\n\n m_pInstance = new CSyncThread(factory);\n return m_pInstance;\n}\n\n\/*static*\/void CSyncThread::Destroy()\n{\n if ( m_pInstance )\n delete m_pInstance;\n\n m_pInstance = 0;\n}\n\nCSyncThread::CSyncThread(common::IRhoClassFactory* factory) : CThreadQueue(factory)\n{\n CThreadQueue::setLogCategory(getLogCategory());\n\n if( RHOCONF().isExist(\"sync_poll_interval\") )\n setPollInterval(RHOCONF().getInt(\"sync_poll_interval\"));\n\n m_oSyncEngine.setFactory(factory);\n\n if ( RHOCONF().getString(\"syncserver\").length() > 0 )\n start(epLow);\n}\n\nCSyncThread::~CSyncThread(void)\n{\n m_oSyncEngine.exitSync();\n stop(SYNC_WAIT_BEFOREKILL_SECONDS);\n\n db::CDBAdapter::closeAll();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long CSyncThread::getRetValue()\n{\n unsigned long ret = rho_ruby_get_NIL();\n if ( isNoThreadedMode() )\n {\n ret = rho_ruby_create_string( getSyncEngine().getNotify().getNotifyBody().c_str() );\n getSyncEngine().getNotify().cleanNotifyBody();\n }\n\n return ret;\n}\n#else\nunsigned long CSyncThread::getRetValue()\n{\n unsigned long ret = 0;\n if ( isNoThreadedMode() )\n {\n ret = (unsigned long)rho_sync_create_string( getSyncEngine().getNotify().getNotifyBody().c_str() );\n getSyncEngine().getNotify().cleanNotifyBody();\n }\n\n return ret;\n}\n#endif \n\nint CSyncThread::getLastPollInterval()\n{\n uint64 nowTime = CLocalTime().toULong();\n\t\n DBResult( res, CDBAdapter::getUserDB().executeSQL(\"SELECT last_updated from sources\") );\n uint64 latestTimeUpdated = 0;\n for ( ; !res.isEnd(); res.next() )\n { \n uint64 timeUpdated = res.getUInt64ByIdx(0);\n if ( latestTimeUpdated < timeUpdated )\n \tlatestTimeUpdated = timeUpdated;\n }\n\t\n\treturn latestTimeUpdated > 0 ? (int)(nowTime-latestTimeUpdated) : 0;\n}\n\nvoid CSyncThread::processCommands()\/\/throws Exception\n{\n if ( isNoCommands() )\n addQueueCommand(new CSyncCommand(scNone,false));\n\n CThreadQueue::processCommands();\n}\n\nvoid CSyncThread::checkShowStatus(CSyncCommand& oSyncCmd)\n{\n\tboolean bShowStatus = oSyncCmd.m_bShowStatus;\n\tm_oSyncEngine.getNotify().enableReporting(bShowStatus);\n\t\/\/if (bShowStatus)\n\t\t\/\/m_statusListener.createStatusPopup(RhoRuby.getMessageText(\"syncronizing_data\"));\n}\t\n\nvoid CSyncThread::processCommand(IQueueCommand* pCmd)\n{\n CSyncCommand& oSyncCmd = *((CSyncCommand*)pCmd);\n switch(oSyncCmd.m_nCmdCode)\n {\n case scNone:\n if ( getPollInterval() )\n {\n checkShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncAllSources();\n }\n break;\n case scSyncAll:\n checkShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncAllSources();\n break;\n case scSyncOne:\n {\n\t\t\tcheckShowStatus(oSyncCmd);\n m_oSyncEngine.doSyncSource(CSyncEngine::CSourceID(oSyncCmd.m_nCmdParam,oSyncCmd.m_strCmdParam));\n }\n break;\n case scSearchOne:\n {\n\t\t\tcheckShowStatus(oSyncCmd);\n m_oSyncEngine.doSearch( ((CSyncSearchCommand&)oSyncCmd).m_arSources, oSyncCmd.m_strCmdParam, \n ((CSyncSearchCommand&)oSyncCmd).m_strFrom, ((CSyncSearchCommand&)oSyncCmd).m_bSyncChanges,\n oSyncCmd.m_nCmdParam);\n }\n break;\n case scLogin:\n \t{\n \t\tCSyncLoginCommand& oLoginCmd = (CSyncLoginCommand&)oSyncCmd;\n\n checkShowStatus(oSyncCmd);\n \t\tm_oSyncEngine.login(oLoginCmd.m_strName, oLoginCmd.m_strPassword, oLoginCmd.m_strCmdParam );\n \t}\n break;\n }\n}\n\nvoid CSyncThread::setPollInterval(int nInterval)\n{ \n if ( nInterval == 0 )\n m_oSyncEngine.stopSync();\n\n CThreadQueue::setPollInterval(nInterval);\n}\n\nString CSyncThread::CSyncCommand::toString()\n{\n switch(m_nCmdCode)\n {\n case scNone:\n return \"CheckPollInterval\";\n\n case scSyncAll:\n return \"SyncAll\";\n case scSyncOne:\n return \"SyncOne\";\n case scLogin:\n return \"Login\";\n case scSearchOne:\n return \"Search\";\n }\n\n return \"Unknown; Code : \" + convertToStringA(m_nCmdCode);\n}\n\n};\n};\n\nextern \"C\" {\n\nusing namespace rho::sync;\nusing namespace rho::db;\n\t\nunsigned long rho_sync_doSyncAllSources(int show_status_popup)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncAll,show_status_popup!=0));\n\n return CSyncThread::getInstance()->getRetValue();\n}\n\nunsigned long rho_sync_doSyncSourceByID(int nSrcID)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, \"\", nSrcID, false ) );\n return CSyncThread::getInstance()->getRetValue();\n}\n\nunsigned long rho_sync_doSyncSourceByName(const char* szSrcName)\n{\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, szSrcName, 0, false ) );\n return CSyncThread::getInstance()->getRetValue();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_doSyncSource(unsigned long nSrcID,int show_status_popup)\n{\n CRhoRubyStringOrInt oSrcID = rho_ruby_getstringorint(nSrcID);\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, oSrcID.m_szStr, (int)oSrcID.m_nInt, show_status_popup!=0 ) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\t\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_stop()\n{\n\tif (CSyncThread::getSyncEngine().isSyncing() )\n\t{\n\t\tCSyncThread::getSyncEngine().stopSyncByUser();\n CSyncThread::getInstance()->stopWait();\n\n while( CDBAdapter::isAnyInsideTransaction() )\n\t\t\tCSyncThread::getInstance()->sleep(100);\n\t}\n}\n\nextern \"C\" void\nsource_iter(const char* szName, void* parSources)\n{\n rho::Vector<rho::String>& arSources = *((rho::Vector<rho::String>*)(parSources));\n arSources.addElement(szName);\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_doSearch(unsigned long ar_sources, const char *from, const char *params, bool sync_changes, int nProgressStep, \n const char* callback, const char* callback_params)\n{\n rho_sync_stop();\n if ( callback && *callback )\n CSyncThread::getSyncEngine().getNotify().setSearchNotification( callback, callback_params ? callback_params : \"\");\n\n rho::Vector<rho::String> arSources;\n rho_ruby_enum_strary(ar_sources, source_iter, &arSources);\n\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncSearchCommand(from,params,arSources,sync_changes,nProgressStep) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\t\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_doSyncSourceByUrl(const char* szSrcUrl)\n{\n const char* szLastSlash = strrchr(szSrcUrl, '\\\\');\n if ( !szLastSlash )\n szLastSlash = strrchr(szSrcUrl, '\/');\n\n const char* szQuest = strrchr(szSrcUrl, '?');\n\n rho::String strName = \"\";\n if (szQuest && szLastSlash)\n strName = rho::String(szLastSlash+1, szQuest-szLastSlash-1);\n else\n strName = szLastSlash ? szLastSlash + 1 : szSrcUrl;\n\n \/\/TODO: save query params\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncCommand(CSyncThread::scSyncOne, strName, (int)0, false ) );\n}\t\n\nvoid rho_sync_set_pollinterval(int nInterval)\n{\n CSyncThread::getInstance()->setPollInterval(nInterval);\n}\n\t\nvoid rho_sync_set_syncserver(char* syncserver)\n{\n rho_sync_stop();\n\n\tCSyncThread::getSyncEngine().setSyncServer(syncserver);\n\n if ( syncserver && *syncserver )\n {\n CSyncThread::getInstance()->start(CSyncThread::epLow);\n if ( CClientRegister::getInstance() != null )\n CClientRegister::getInstance()->startUp();\n }\n else\n {\n CSyncThread::getInstance()->stop(CSyncThread::SYNC_WAIT_BEFOREKILL_SECONDS);\n if ( CClientRegister::getInstance() != null )\n CClientRegister::getInstance()->stop(CSyncThread::SYNC_WAIT_BEFOREKILL_SECONDS);\n }\n}\n\nunsigned long rho_sync_login(const char *name, const char *password, const char* callback)\n{\n rho_sync_stop();\n CSyncThread::getInstance()->addQueueCommand(new CSyncThread::CSyncLoginCommand(name, password, callback) );\n\n return CSyncThread::getInstance()->getRetValue();\n}\n\nint rho_sync_logged_in()\n{\n\tCDBAdapter& db = CDBAdapter::getUserDB();\n return CSyncThread::getSyncEngine().isLoggedIn() ? 1 : 0;\n}\n\nvoid rho_sync_logout()\n{\n rho_sync_stop();\n\n\tCDBAdapter& db = CDBAdapter::getUserDB();\n CSyncThread::getSyncEngine().logout();\n}\n\nvoid rho_sync_set_notification(int source_id, const char *url, char* params)\n{\n return CSyncThread::getSyncEngine().getNotify().setSyncNotification(source_id, url, params ? params : \"\");\n}\n\nvoid rho_sync_clear_notification(int source_id)\n{\n return CSyncThread::getSyncEngine().getNotify().clearSyncNotification(source_id);\n}\n\nvoid rho_sync_set_bulk_notification(const char *url, char* params)\n{\n return CSyncThread::getSyncEngine().getNotify().setBulkSyncNotification(url, params ? params : \"\");\n}\n\nvoid rho_sync_clear_bulk_notification()\n{\n return CSyncThread::getSyncEngine().getNotify().clearBulkSyncNotification();\n}\n\n#ifndef RHO_NO_RUBY\nunsigned long rho_sync_get_attrs(const char* szPartition, int nSrcID)\n{\n return (VALUE)CDBAdapter::getDB(szPartition).getAttrMgr().getAttrsBySrc(nSrcID);\n}\n\nunsigned long rho_sync_is_blob_attr(const char* szPartition, int nSrcID, const char* szAttrName)\n{\n return rho_ruby_create_boolean( CDBAdapter::getDB(szPartition).getAttrMgr().isBlobAttr(nSrcID, szAttrName) );\n}\n#endif \/\/RHO_NO_RUBY\n\nvoid rho_sync_setobjectnotify_url(const char* szUrl)\n{\n CSyncNotify::setObjectNotifyUrl(szUrl);\n}\n\nvoid rho_sync_addobjectnotify(int nSrcID, const char* szObject)\n{\n CSyncThread::getSyncEngine().getNotify().addObjectNotify(nSrcID, szObject);\n}\n\nvoid rho_sync_addobjectnotify_bysrcname(const char* szSrcName, const char* szObject)\n{\n CSyncThread::getSyncEngine().getNotify().addObjectNotify(szSrcName, szObject);\n}\n\nvoid rho_sync_cleanobjectnotify()\n{\n CSyncThread::getSyncEngine().getNotify().cleanObjectNotifications();\n}\n\nint rho_sync_get_lastsync_objectcount(int nSrcID)\n{\n return CSyncThread::getSyncEngine().getNotify().getLastSyncObjectCount(nSrcID);\n}\n\nint rho_sync_get_pagesize()\n{\n return CSyncThread::getSyncEngine().getSyncPageSize();\n}\n\nvoid rho_sync_set_pagesize(int nPageSize)\n{\n CSyncThread::getSyncEngine().setSyncPageSize(nPageSize);\n}\n\nvoid rho_sync_set_threaded_mode(int b)\n{\n CSyncThread::getInstance()->setNonThreadedMode(b==0);\n CSyncThread::getSyncEngine().setNonThreadedMode(b==0);\n}\n\nchar* rho_sync_create_string(const char* szStr)\n{\n return strdup(szStr);\n}\n\nvoid rho_sync_free_string(char* szStr)\n{\n return free(szStr);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: propertyset.hxx,v $\n * $Revision: 1.3 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef OOX_HELPER_PROPERTYSET_HXX\n#define OOX_HELPER_PROPERTYSET_HXX\n\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/XMultiPropertySet.hpp>\n\nnamespace oox {\n\n\/\/ ============================================================================\n\n\/** A wrapper for a UNO property set.\n\n This class provides functions to silently get and set properties (without\n exceptions, without the need to check validity of the UNO property set).\n\n An instance is constructed with the reference to a UNO property set or any\n other interface (the constructor will query for the\n com.sun.star.beans.XPropertySet interface then). The reference to the\n property set will be kept as long as the instance of this class is alive.\n\n The functions getProperties() and setProperties() try to handle all passed\n values at once, using the com.sun.star.beans.XMultiPropertySet interface.\n If the implementation does not support the XMultiPropertySet interface, all\n properties are handled separately in a loop.\n *\/\nclass PropertySet\n{\npublic:\n inline explicit PropertySet() {}\n\n \/** Constructs a property set wrapper with the passed UNO property set. *\/\n inline explicit PropertySet(\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& rxPropSet )\n { set( rxPropSet ); }\n\n \/** Constructs a property set wrapper after querying the XPropertySet interface. *\/\n template< typename Type >\n inline explicit PropertySet( const Type& rObject ) { set( rObject ); }\n\n \/** Sets the passed UNO property set and releases the old UNO property set. *\/\n void set( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& rxPropSet );\n\n \/** Queries the passed object (interface or any) for an XPropertySet and releases the old UNO property set. *\/\n template< typename Type >\n inline void set( const Type& rObject )\n { set( ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >( rObject, ::com::sun::star::uno::UNO_QUERY ) ); }\n\n \/** Returns true, if the contained XPropertySet interface is valid. *\/\n inline bool is() const { return mxPropSet.is(); }\n\n \/** Returns the contained XPropertySet interface. *\/\n inline ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >\n getXPropertySet() const { return mxPropSet; }\n\n \/\/ Get properties ---------------------------------------------------------\n\n \/** Gets the specified property from the property set.\n @return true, if the any could be filled with the property value. *\/\n bool getAnyProperty(\n ::com::sun::star::uno::Any& orValue,\n const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified property from the property set.\n @return true, if the passed variable could be filled with the property value. *\/\n template< typename Type >\n inline bool getProperty(\n Type& orValue,\n const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified boolean property from the property set.\n @return true = property contains true; false = property contains false or error occured. *\/\n bool getBoolProperty( const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified properties from the property set. Tries to use the XMultiPropertySet interface.\n @param orValues (out-parameter) The related property values.\n @param rPropNames The property names. MUST be ordered alphabetically. *\/\n void getProperties(\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& orValues,\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropNames ) const;\n\n \/\/ Set properties ---------------------------------------------------------\n\n \/** Puts the passed any into the property set. *\/\n void setAnyProperty(\n const ::rtl::OUString& rPropName,\n const ::com::sun::star::uno::Any& rValue );\n\n \/** Puts the passed value into the property set. *\/\n template< typename Type >\n inline void setProperty(\n const ::rtl::OUString& rPropName,\n const Type& rValue );\n\n \/** Puts the passed properties into the property set. Tries to use the XMultiPropertySet interface.\n @param rPropNames The property names. MUST be ordered alphabetically.\n @param rValues The related property values. *\/\n void setProperties(\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropNames,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& rValues );\n\n \/\/ ------------------------------------------------------------------------\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >\n mxPropSet; \/\/\/ The mandatory property set interface.\n ::com::sun::star::uno::Reference< ::com::sun::star::beans::XMultiPropertySet >\n mxMultiPropSet; \/\/\/ The optional multi property set interface.\n};\n\n\/\/ ----------------------------------------------------------------------------\n\ntemplate< typename Type >\ninline bool PropertySet::getProperty( Type& orValue, const ::rtl::OUString& rPropName ) const\n{\n ::com::sun::star::uno::Any aAny;\n return getAnyProperty( aAny, rPropName ) && (aAny >>= orValue);\n}\n\ntemplate< typename Type >\ninline void PropertySet::setProperty( const ::rtl::OUString& rPropName, const Type& rValue )\n{\n setAnyProperty( rPropName, ::com::sun::star::uno::Any( rValue ) );\n}\n\n\/\/ ============================================================================\n\n} \/\/ namespace oox\n\n#endif\n\n<commit_msg>INTEGRATION: CWS xmlfilter04 (1.2.12); FILE MERGED 2008\/02\/27 14:39:39 dr 1.2.12.1: add setters to Color class, add gamma to a:scrgbClr<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: propertyset.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef OOX_HELPER_PROPERTYSET_HXX\n#define OOX_HELPER_PROPERTYSET_HXX\n\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#include <com\/sun\/star\/beans\/XMultiPropertySet.hpp>\n\nnamespace oox {\n\nclass PropertyMap;\n\n\/\/ ============================================================================\n\n\/** A wrapper for a UNO property set.\n\n This class provides functions to silently get and set properties (without\n exceptions, without the need to check validity of the UNO property set).\n\n An instance is constructed with the reference to a UNO property set or any\n other interface (the constructor will query for the\n com.sun.star.beans.XPropertySet interface then). The reference to the\n property set will be kept as long as the instance of this class is alive.\n\n The functions getProperties() and setProperties() try to handle all passed\n values at once, using the com.sun.star.beans.XMultiPropertySet interface.\n If the implementation does not support the XMultiPropertySet interface, all\n properties are handled separately in a loop.\n *\/\nclass PropertySet\n{\npublic:\n inline explicit PropertySet() {}\n\n \/** Constructs a property set wrapper with the passed UNO property set. *\/\n inline explicit PropertySet(\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& rxPropSet )\n { set( rxPropSet ); }\n\n \/** Constructs a property set wrapper after querying the XPropertySet interface. *\/\n template< typename Type >\n inline explicit PropertySet( const Type& rObject ) { set( rObject ); }\n\n \/** Sets the passed UNO property set and releases the old UNO property set. *\/\n void set( const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >& rxPropSet );\n\n \/** Queries the passed object (interface or any) for an XPropertySet and releases the old UNO property set. *\/\n template< typename Type >\n inline void set( const Type& rObject )\n { set( ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >( rObject, ::com::sun::star::uno::UNO_QUERY ) ); }\n\n \/** Returns true, if the contained XPropertySet interface is valid. *\/\n inline bool is() const { return mxPropSet.is(); }\n\n \/** Returns the contained XPropertySet interface. *\/\n inline ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >\n getXPropertySet() const { return mxPropSet; }\n\n \/\/ Get properties ---------------------------------------------------------\n\n \/** Gets the specified property from the property set.\n @return true, if the any could be filled with the property value. *\/\n bool getAnyProperty(\n ::com::sun::star::uno::Any& orValue,\n const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified property from the property set.\n @return true, if the passed variable could be filled with the property value. *\/\n template< typename Type >\n inline bool getProperty(\n Type& orValue,\n const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified boolean property from the property set.\n @return true = property contains true; false = property contains false or error occured. *\/\n bool getBoolProperty( const ::rtl::OUString& rPropName ) const;\n\n \/** Gets the specified properties from the property set. Tries to use the XMultiPropertySet interface.\n @param orValues (out-parameter) The related property values.\n @param rPropNames The property names. MUST be ordered alphabetically. *\/\n void getProperties(\n ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& orValues,\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropNames ) const;\n\n \/\/ Set properties ---------------------------------------------------------\n\n \/** Puts the passed any into the property set. *\/\n void setAnyProperty(\n const ::rtl::OUString& rPropName,\n const ::com::sun::star::uno::Any& rValue );\n\n \/** Puts the passed value into the property set. *\/\n template< typename Type >\n inline void setProperty(\n const ::rtl::OUString& rPropName,\n const Type& rValue );\n\n \/** Puts the passed properties into the property set. Tries to use the XMultiPropertySet interface.\n @param rPropNames The property names. MUST be ordered alphabetically.\n @param rValues The related property values. *\/\n void setProperties(\n const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropNames,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& rValues );\n\n \/** Puts the passed property map into the property set. Tries to use the XMultiPropertySet interface.\n @param rPropertyMap The property map. *\/\n void setProperties( const PropertyMap& rPropertyMap );\n\n \/\/ ------------------------------------------------------------------------\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet >\n mxPropSet; \/\/\/ The mandatory property set interface.\n ::com::sun::star::uno::Reference< ::com::sun::star::beans::XMultiPropertySet >\n mxMultiPropSet; \/\/\/ The optional multi property set interface.\n};\n\n\/\/ ----------------------------------------------------------------------------\n\ntemplate< typename Type >\ninline bool PropertySet::getProperty( Type& orValue, const ::rtl::OUString& rPropName ) const\n{\n ::com::sun::star::uno::Any aAny;\n return getAnyProperty( aAny, rPropName ) && (aAny >>= orValue);\n}\n\ntemplate< typename Type >\ninline void PropertySet::setProperty( const ::rtl::OUString& rPropName, const Type& rValue )\n{\n setAnyProperty( rPropName, ::com::sun::star::uno::Any( rValue ) );\n}\n\n\/\/ ============================================================================\n\n} \/\/ namespace oox\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: workbookhelper.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2008-01-17 08:05:49 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef OOX_XLS_WORKBOOKHELPER_HXX\n#define OOX_XLS_WORKBOOKHELPER_HXX\n\n#include <boost\/shared_ptr.hpp>\n#include <rtl\/ref.hxx>\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#include \"oox\/xls\/biffhelper.hxx\"\n\nnamespace com { namespace sun { namespace star {\n namespace container { class XNameAccess; }\n namespace container { class XNameContainer; }\n namespace awt { class XDevice; }\n namespace sheet { class XSpreadsheetDocument; }\n namespace sheet { class XSpreadsheet; }\n namespace sheet { class XNamedRanges; }\n namespace sheet { class XDatabaseRanges; }\n namespace style { class XStyle; }\n} } }\n\nnamespace oox {\n class AttributeList;\n class SegmentProgressBar;\n class RecordInputStream;\n}\n\nnamespace oox { namespace core {\n class BinaryFilterBase;\n class FilterBase;\n class FragmentHandler;\n class XmlFilterBase;\n} }\n\nnamespace oox {\nnamespace xls {\n\n\/\/ ============================================================================\n\n\/** An enumeration for all supported spreadsheet filter types. *\/\nenum FilterType\n{\n FILTER_OOX, \/\/\/ MS Excel OOXML (Office Open XML) or OOBIN.\n FILTER_BIFF, \/\/\/ MS Excel BIFF (Binary Interchange File Format).\n FILTER_UNKNOWN \/\/\/ Unknown filter type.\n};\n\n\/\/ ============================================================================\n\n#if OSL_DEBUG_LEVEL > 0\n\nclass WorkbookHelperDebug\n{\npublic:\n inline explicit WorkbookHelperDebug( sal_Int32& rnCount ) : mrnCount( rnCount ) { ++mrnCount; }\n inline explicit WorkbookHelperDebug( const WorkbookHelperDebug& rCopy ) : mrnCount( rCopy.mrnCount ) { ++mrnCount; }\n virtual ~WorkbookHelperDebug() { --mrnCount; }\nprivate:\n sal_Int32& mrnCount;\n};\n\n#endif\n\n\/\/ ============================================================================\n\nclass WorkbookData;\nclass WorkbookSettings;\nclass ViewSettings;\nclass WorksheetBuffer;\nclass ThemeBuffer;\nclass StylesBuffer;\nclass SharedStringsBuffer;\nclass ExternalLinkBuffer;\nclass DefinedNamesBuffer;\nclass TableBuffer;\nclass WebQueryBuffer;\nclass PivotTableBuffer;\nclass FormulaParser;\nclass UnitConverter;\nclass AddressConverter;\nclass StylesPropertyHelper;\nclass PageSettingsPropertyHelper;\nclass ValidationPropertyHelper;\n\n\/** Helper class to provice access to global workbook data.\n\n All classes derived from this helper class will have access to a singleton\n object of type WorkbookData containing global workbook settings, buffers,\n converters, etc. Nearly all classes in this filter implementation are\n derived directly or indirectly from this class.\n *\/\nclass WorkbookHelper\n#if OSL_DEBUG_LEVEL > 0\n : private WorkbookHelperDebug\n#endif\n{\npublic:\n explicit WorkbookHelper( WorkbookData& rBookData );\n virtual ~WorkbookHelper();\n\n \/\/ filter -----------------------------------------------------------------\n\n \/** Returns the base filter object (base class of all filters). *\/\n ::oox::core::FilterBase& getBaseFilter() const;\n \/** Returns the file type of the current filter. *\/\n FilterType getFilterType() const;\n \/** Returns the filter progress bar. *\/\n SegmentProgressBar& getProgressBar() const;\n \/** Returns true, if the file is a multi-sheet document, or false if single-sheet. *\/\n bool isWorkbookFile() const;\n\n \/** Final conversion after importing the workbook. *\/\n void finalizeWorkbookImport();\n\n \/\/ document model ---------------------------------------------------------\n\n \/** Returns a reference to the source\/target spreadsheet document model. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheetDocument >\n getDocument() const;\n \/** Returns a reference to the specified spreadsheet in the document model. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheet >\n getSheet( sal_Int32 nSheet ) const;\n \/** Returns the reference device of the document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDevice >\n getReferenceDevice() const;\n \/** Returns the container for defined names from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XNamedRanges >\n getNamedRanges() const;\n \/** Returns the container for database ranges from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XDatabaseRanges >\n getDatabaseRanges() const;\n \/** Returns the container for DDE links from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >\n getDdeLinks() const;\n\n \/** Returns the cell or page styles container from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >\n getStyleFamily( bool bPageStyles ) const;\n \/** Returns the specified cell or page style from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::style::XStyle >\n getStyleObject( const ::rtl::OUString& rStyleName, bool bPageStyle ) const;\n\n \/** Creates a com.sun.star.style.Style object and returns its final name. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::style::XStyle >\n createStyleObject(\n ::rtl::OUString& orStyleName,\n bool bPageStyle,\n bool bRenameOldExisting = false );\n\n \/\/ buffers ----------------------------------------------------------------\n\n \/** Returns the global workbook settings object. *\/\n WorkbookSettings& getWorkbookSettings() const;\n \/** Returns the workbook and sheet view settings object. *\/\n ViewSettings& getViewSettings() const;\n \/** Returns the worksheet buffer containing sheet names and properties. *\/\n WorksheetBuffer& getWorksheets() const;\n \/** Returns the office theme object read from the theme substorage. *\/\n ThemeBuffer& getTheme() const;\n \/** Returns all cell formatting objects read from the styles substream. *\/\n StylesBuffer& getStyles() const;\n \/** Returns the shared strings read from the shared strings substream. *\/\n SharedStringsBuffer& getSharedStrings() const;\n \/** Returns the external links read from the external links substream. *\/\n ExternalLinkBuffer& getExternalLinks() const;\n \/** Returns the defined names read from the workbook globals. *\/\n DefinedNamesBuffer& getDefinedNames() const;\n \/** Returns the tables collection (equivalent to Calc's database ranges). *\/\n TableBuffer& getTables() const;\n \/** Returns the web queries. *\/\n WebQueryBuffer& getWebQueries() const;\n \/** Returns the pivot tables. *\/\n PivotTableBuffer& getPivotTables() const;\n\n \/\/ converters -------------------------------------------------------------\n\n \/** Returns the import formula parser. *\/\n FormulaParser& getFormulaParser() const;\n \/** Returns the measurement unit converter. *\/\n UnitConverter& getUnitConverter() const;\n \/** Returns the converter for string to cell address\/range conversion. *\/\n AddressConverter& getAddressConverter() const;\n \/** Returns the converter for properties related to cell styles. *\/\n StylesPropertyHelper& getStylesPropertyHelper() const;\n \/** Returns the converter for properties related to page and print settings. *\/\n PageSettingsPropertyHelper& getPageSettingsPropertyHelper() const;\n \/** Returns the converter for properties related to data validation. *\/\n ValidationPropertyHelper& getValidationPropertyHelper() const;\n\n \/\/ OOX specific -----------------------------------------------------------\n\n \/** Returns the base OOX filter object.\n Must not be called, if current filter is not the OOX filter. *\/\n ::oox::core::XmlFilterBase& getOoxFilter() const;\n\n \/** Imports a fragment using the passed fragment handler, which contains\n the full path to the fragment stream. *\/\n bool importOoxFragment( const ::rtl::Reference< ::oox::core::FragmentHandler >& rxHandler );\n\n \/\/ BIFF specific ----------------------------------------------------------\n\n \/** Returns the base BIFF filter object. *\/\n ::oox::core::BinaryFilterBase& getBiffFilter() const;\n \/** Returns the BIFF type in binary filter. *\/\n BiffType getBiff() const;\n\n \/** Returns the text encoding used to import\/export byte strings. *\/\n rtl_TextEncoding getTextEncoding() const;\n \/** Sets the text encoding to import\/export byte strings. *\/\n void setTextEncoding( rtl_TextEncoding eTextEnc );\n \/** Sets code page read from a CODEPAGE record for byte string import. *\/\n void setCodePage( sal_uInt16 nCodePage );\n \/** Sets text encoding from the default application font, if CODEPAGE record is missing. *\/\n void setAppFontEncoding( rtl_TextEncoding eAppFontEnc );\n\n \/** Enables workbook file mode, used for BIFF4 workspace files. *\/\n void setIsWorkbookFile();\n \/** Recreates global buffers that are used per sheet in specific BIFF versions. *\/\n void createBuffersPerSheet();\n\n \/** Looks for a password provided via API, or queries it via GUI. *\/\n ::rtl::OUString queryPassword() const;\n\nprivate:\n WorkbookData& mrBookData;\n};\n\n\/\/ ============================================================================\n\nnamespace prv {\n\ntypedef ::boost::shared_ptr< WorkbookData > WorkbookDataRef;\n\nstruct WorkbookDataOwner\n{\n explicit WorkbookDataOwner( WorkbookDataRef xBookData );\n virtual ~WorkbookDataOwner();\n WorkbookDataRef mxBookData;\n};\n\n} \/\/ namespace prv\n\n\/\/ ----------------------------------------------------------------------------\n\nclass WorkbookHelperRoot : private prv::WorkbookDataOwner, public WorkbookHelper\n{\npublic:\n explicit WorkbookHelperRoot( ::oox::core::XmlFilterBase& rFilter );\n explicit WorkbookHelperRoot( ::oox::core::BinaryFilterBase& rFilter, BiffType eBiff );\n\n \/** Returns true, if this helper refers to a valid document. *\/\n bool isValid() const;\n\nprivate:\n WorkbookHelperRoot( const WorkbookHelperRoot& );\n WorkbookHelperRoot& operator=( const WorkbookHelperRoot& );\n};\n\n\/\/ ============================================================================\n\n} \/\/ namespace xls\n} \/\/ namespace oox\n\n#endif\n\n<commit_msg>INTEGRATION: CWS xmlfilter03_DEV300 (1.2.4); FILE MERGED 2008\/02\/12 11:33:09 dr 1.2.4.1: handle drawing fragment in WorksheetHelper<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: workbookhelper.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2008-03-05 18:10:14 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef OOX_XLS_WORKBOOKHELPER_HXX\n#define OOX_XLS_WORKBOOKHELPER_HXX\n\n#include <boost\/shared_ptr.hpp>\n#include <rtl\/ref.hxx>\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#include \"oox\/xls\/biffhelper.hxx\"\n\nnamespace com { namespace sun { namespace star {\n namespace container { class XNameAccess; }\n namespace container { class XNameContainer; }\n namespace awt { class XDevice; }\n namespace sheet { class XSpreadsheetDocument; }\n namespace sheet { class XSpreadsheet; }\n namespace sheet { class XNamedRanges; }\n namespace sheet { class XDatabaseRanges; }\n namespace style { class XStyle; }\n} } }\n\nnamespace oox {\n class AttributeList;\n class SegmentProgressBar;\n class RecordInputStream;\n}\n\nnamespace oox { namespace core {\n class BinaryFilterBase;\n class FilterBase;\n class FragmentHandler;\n class XmlFilterBase;\n} }\n\nnamespace oox {\nnamespace xls {\n\n\/\/ ============================================================================\n\n\/** An enumeration for all supported spreadsheet filter types. *\/\nenum FilterType\n{\n FILTER_OOX, \/\/\/ MS Excel OOXML (Office Open XML) or OOBIN.\n FILTER_BIFF, \/\/\/ MS Excel BIFF (Binary Interchange File Format).\n FILTER_UNKNOWN \/\/\/ Unknown filter type.\n};\n\n\/\/ ============================================================================\n\n#if OSL_DEBUG_LEVEL > 0\n\nclass WorkbookHelperDebug\n{\npublic:\n inline explicit WorkbookHelperDebug( sal_Int32& rnCount ) : mrnCount( rnCount ) { ++mrnCount; }\n inline explicit WorkbookHelperDebug( const WorkbookHelperDebug& rCopy ) : mrnCount( rCopy.mrnCount ) { ++mrnCount; }\n virtual ~WorkbookHelperDebug() { --mrnCount; }\nprivate:\n sal_Int32& mrnCount;\n};\n\n#endif\n\n\/\/ ============================================================================\n\nclass WorkbookData;\nclass WorkbookSettings;\nclass ViewSettings;\nclass WorksheetBuffer;\nclass ThemeBuffer;\nclass StylesBuffer;\nclass SharedStringsBuffer;\nclass ExternalLinkBuffer;\nclass DefinedNamesBuffer;\nclass TableBuffer;\nclass WebQueryBuffer;\nclass PivotTableBuffer;\nclass FormulaParser;\nclass UnitConverter;\nclass AddressConverter;\nclass StylesPropertyHelper;\nclass PageSettingsPropertyHelper;\nclass ValidationPropertyHelper;\n\n\/** Helper class to provice access to global workbook data.\n\n All classes derived from this helper class will have access to a singleton\n object of type WorkbookData containing global workbook settings, buffers,\n converters, etc. Nearly all classes in this filter implementation are\n derived directly or indirectly from this class.\n *\/\nclass WorkbookHelper\n#if OSL_DEBUG_LEVEL > 0\n : private WorkbookHelperDebug\n#endif\n{\npublic:\n \/*implicit*\/ WorkbookHelper( WorkbookData& rBookData );\n virtual ~WorkbookHelper();\n\n \/\/ filter -----------------------------------------------------------------\n\n \/** Returns the base filter object (base class of all filters). *\/\n ::oox::core::FilterBase& getBaseFilter() const;\n \/** Returns the file type of the current filter. *\/\n FilterType getFilterType() const;\n \/** Returns the filter progress bar. *\/\n SegmentProgressBar& getProgressBar() const;\n \/** Returns true, if the file is a multi-sheet document, or false if single-sheet. *\/\n bool isWorkbookFile() const;\n\n \/** Final conversion after importing the workbook. *\/\n void finalizeWorkbookImport();\n\n \/\/ document model ---------------------------------------------------------\n\n \/** Returns a reference to the source\/target spreadsheet document model. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheetDocument >\n getDocument() const;\n \/** Returns a reference to the specified spreadsheet in the document model. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XSpreadsheet >\n getSheet( sal_Int32 nSheet ) const;\n \/** Returns the reference device of the document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XDevice >\n getReferenceDevice() const;\n \/** Returns the container for defined names from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XNamedRanges >\n getNamedRanges() const;\n \/** Returns the container for database ranges from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XDatabaseRanges >\n getDatabaseRanges() const;\n \/** Returns the container for DDE links from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >\n getDdeLinks() const;\n\n \/** Returns the cell or page styles container from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameContainer >\n getStyleFamily( bool bPageStyles ) const;\n \/** Returns the specified cell or page style from the Calc document. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::style::XStyle >\n getStyleObject( const ::rtl::OUString& rStyleName, bool bPageStyle ) const;\n\n \/** Creates a com.sun.star.style.Style object and returns its final name. *\/\n ::com::sun::star::uno::Reference< ::com::sun::star::style::XStyle >\n createStyleObject(\n ::rtl::OUString& orStyleName,\n bool bPageStyle,\n bool bRenameOldExisting = false );\n\n \/\/ buffers ----------------------------------------------------------------\n\n \/** Returns the global workbook settings object. *\/\n WorkbookSettings& getWorkbookSettings() const;\n \/** Returns the workbook and sheet view settings object. *\/\n ViewSettings& getViewSettings() const;\n \/** Returns the worksheet buffer containing sheet names and properties. *\/\n WorksheetBuffer& getWorksheets() const;\n \/** Returns the office theme object read from the theme substorage. *\/\n ThemeBuffer& getTheme() const;\n \/** Returns all cell formatting objects read from the styles substream. *\/\n StylesBuffer& getStyles() const;\n \/** Returns the shared strings read from the shared strings substream. *\/\n SharedStringsBuffer& getSharedStrings() const;\n \/** Returns the external links read from the external links substream. *\/\n ExternalLinkBuffer& getExternalLinks() const;\n \/** Returns the defined names read from the workbook globals. *\/\n DefinedNamesBuffer& getDefinedNames() const;\n \/** Returns the tables collection (equivalent to Calc's database ranges). *\/\n TableBuffer& getTables() const;\n \/** Returns the web queries. *\/\n WebQueryBuffer& getWebQueries() const;\n \/** Returns the pivot tables. *\/\n PivotTableBuffer& getPivotTables() const;\n\n \/\/ converters -------------------------------------------------------------\n\n \/** Returns the import formula parser. *\/\n FormulaParser& getFormulaParser() const;\n \/** Returns the measurement unit converter. *\/\n UnitConverter& getUnitConverter() const;\n \/** Returns the converter for string to cell address\/range conversion. *\/\n AddressConverter& getAddressConverter() const;\n \/** Returns the converter for properties related to cell styles. *\/\n StylesPropertyHelper& getStylesPropertyHelper() const;\n \/** Returns the converter for properties related to page and print settings. *\/\n PageSettingsPropertyHelper& getPageSettingsPropertyHelper() const;\n \/** Returns the converter for properties related to data validation. *\/\n ValidationPropertyHelper& getValidationPropertyHelper() const;\n\n \/\/ OOX specific -----------------------------------------------------------\n\n \/** Returns the base OOX filter object.\n Must not be called, if current filter is not the OOX filter. *\/\n ::oox::core::XmlFilterBase& getOoxFilter() const;\n\n \/** Imports a fragment using the passed fragment handler, which contains\n the full path to the fragment stream. *\/\n bool importOoxFragment( const ::rtl::Reference< ::oox::core::FragmentHandler >& rxHandler );\n\n \/\/ BIFF specific ----------------------------------------------------------\n\n \/** Returns the base BIFF filter object. *\/\n ::oox::core::BinaryFilterBase& getBiffFilter() const;\n \/** Returns the BIFF type in binary filter. *\/\n BiffType getBiff() const;\n\n \/** Returns the text encoding used to import\/export byte strings. *\/\n rtl_TextEncoding getTextEncoding() const;\n \/** Sets the text encoding to import\/export byte strings. *\/\n void setTextEncoding( rtl_TextEncoding eTextEnc );\n \/** Sets code page read from a CODEPAGE record for byte string import. *\/\n void setCodePage( sal_uInt16 nCodePage );\n \/** Sets text encoding from the default application font, if CODEPAGE record is missing. *\/\n void setAppFontEncoding( rtl_TextEncoding eAppFontEnc );\n\n \/** Enables workbook file mode, used for BIFF4 workspace files. *\/\n void setIsWorkbookFile();\n \/** Recreates global buffers that are used per sheet in specific BIFF versions. *\/\n void createBuffersPerSheet();\n\n \/** Looks for a password provided via API, or queries it via GUI. *\/\n ::rtl::OUString queryPassword() const;\n\nprivate:\n WorkbookData& mrBookData;\n};\n\n\/\/ ============================================================================\n\nnamespace prv {\n\ntypedef ::boost::shared_ptr< WorkbookData > WorkbookDataRef;\n\nstruct WorkbookDataOwner\n{\n explicit WorkbookDataOwner( WorkbookDataRef xBookData );\n virtual ~WorkbookDataOwner();\n WorkbookDataRef mxBookData;\n};\n\n} \/\/ namespace prv\n\n\/\/ ----------------------------------------------------------------------------\n\nclass WorkbookHelperRoot : private prv::WorkbookDataOwner, public WorkbookHelper\n{\npublic:\n explicit WorkbookHelperRoot( ::oox::core::XmlFilterBase& rFilter );\n explicit WorkbookHelperRoot( ::oox::core::BinaryFilterBase& rFilter, BiffType eBiff );\n\n \/** Returns true, if this helper refers to a valid document. *\/\n bool isValid() const;\n\nprivate:\n WorkbookHelperRoot( const WorkbookHelperRoot& );\n WorkbookHelperRoot& operator=( const WorkbookHelperRoot& );\n};\n\n\/\/ ============================================================================\n\n} \/\/ namespace xls\n} \/\/ namespace oox\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n created: Tue Feb 17 2009\n author: Henri I Hyyryläinen (based on code by Paul D Turner)\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2013 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/Ogre\/GeometryBuffer.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/Texture.h\"\n#include \"CEGUI\/Vertex.h\"\n#include \"CEGUI\/RenderEffect.h\"\n\n#include <OgreRenderSystem.h>\n#include <OgreQuaternion.h>\n#include <OgreHardwareBufferManager.h>\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/ShaderParameterBindings.h\"\n\n#include \"OgreManualObject.h\"\n#include \"OgreRenderOperation.h\"\n#include \"OgreSceneManager.h\"\n\n\n#define INITIAL_BUFFER_SIZE 64\n\n#define FLOATS_PER_TEXTURED 9\n#define FLOATS_PER_COLOURED 7\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::LayerBlendModeEx S_colourBlendMode =\n{\n Ogre::LBT_COLOUR,\n Ogre::LBX_MODULATE,\n Ogre::LBS_TEXTURE,\n Ogre::LBS_DIFFUSE,\n Ogre::ColourValue(0, 0, 0, 0),\n Ogre::ColourValue(0, 0, 0, 0),\n 0, 0, 0\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::LayerBlendModeEx S_alphaBlendMode =\n{\n Ogre::LBT_ALPHA,\n Ogre::LBX_MODULATE,\n Ogre::LBS_TEXTURE,\n Ogre::LBS_DIFFUSE,\n Ogre::ColourValue(0, 0, 0, 0),\n Ogre::ColourValue(0, 0, 0, 0),\n 0, 0, 0\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::TextureUnitState::UVWAddressingMode S_textureAddressMode =\n{\n Ogre::TextureUnitState::TAM_CLAMP,\n Ogre::TextureUnitState::TAM_CLAMP,\n Ogre::TextureUnitState::TAM_CLAMP\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreGeometryBuffer::OgreGeometryBuffer(OgreRenderer& owner, \n Ogre::RenderSystem& rs, CEGUI::RefCounted<RenderMaterial> renderMaterial) :\n GeometryBuffer(renderMaterial),\n d_owner(owner),\n d_renderSystem(rs),\n d_clipRect(0, 0, 0, 0),\n d_matrixValid(false),\n d_vertexHolder(0),\n d_expectedData(MANUALOBJECT_TYPE_INVALID),\n d_renderOp(0),\n d_dataAppended(false)\n{\n \n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreGeometryBuffer::~OgreGeometryBuffer()\n{\n cleanUpVertexAttributes();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::draw() const\n{\n if (d_vertexData.empty() || !d_renderOp)\n return;\n\n if (d_dataAppended)\n syncManualObject();\n\n \/\/ setup clip region\n if (d_clippingActive)\n setScissorRects();\n\n \/\/ Update the model matrix if necessary\n if (!d_matrixValid)\n updateMatrix();\n\n CEGUI::ShaderParameterBindings* shaderParameterBindings = \n (*d_renderMaterial).getShaderParamBindings();\n\n\n \/\/ Set the ModelViewProjection matrix in the bindings\n Ogre::Matrix4 omat = d_owner.getWorldViewProjMatrix()*d_matrix;\n\n glm::mat4 glmmat;\n\n OgreRenderer::convertOgreMatrixToGLMMatrix(omat, glmmat);\n\n shaderParameterBindings->setParameter(\"modelViewPerspMatrix\", glmmat);\n\n\n d_owner.bindBlendMode(d_blendMode);\n\n bool found_texture = false;\n\n \/\/ Not sure if this is needed here\n const ShaderParameterBindings::ShaderParameterBindingsMap& \n shader_parameter_bindings = shaderParameterBindings->\n getShaderParameterBindings();\n\n ShaderParameterBindings::ShaderParameterBindingsMap::const_iterator iter = \n shader_parameter_bindings.begin();\n ShaderParameterBindings::ShaderParameterBindingsMap::const_iterator end = \n shader_parameter_bindings.end();\n\n while(iter != end)\n {\n const CEGUI::ShaderParameter* parameter = iter->second;\n const ShaderParamType parameterType = parameter->getType();\n\n\n if (iter->first == \"texture0\")\n {\n\n const CEGUI::ShaderParameterTexture* parameterTexture = \n static_cast<const CEGUI::ShaderParameterTexture*>(parameter);\n\n const CEGUI::OgreTexture* texture = static_cast<const \n CEGUI::OgreTexture*>(parameterTexture->d_parameterValue);\n\n d_vertexHolder->setMaterialName(0, \n texture->getOgreTexture()->getName());\n\n found_texture = true;\n break;\n }\n }\n\n if (!found_texture)\n {\n \/\/ Reset the material\n d_vertexHolder->setMaterialName(0, \"BaseWhiteNoLighting\");\n }\n\n const int pass_count = d_effect ? d_effect->getPassCount() : 1;\n for (int pass = 0; pass < pass_count; ++pass)\n {\n \/\/ set up RenderEffect\n if (d_effect)\n d_effect->performPreRenderFunctions(pass);\n\n initialiseTextureStates();\n\n \/\/Prepare for the rendering process according to the used render material\n d_renderMaterial->prepareForRendering();\n \n\n \/\/ draw the geometry\n d_renderSystem._render(*d_renderOp);\n }\n\n \/\/ clean up RenderEffect\n if (d_effect)\n d_effect->performPostRenderFunctions();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::setClippingRegion(const Rectf& region)\n{\n d_clipRect.top(ceguimax(0.0f, region.top()));\n d_clipRect.bottom(ceguimax(0.0f, region.bottom()));\n d_clipRect.left(ceguimax(0.0f, region.left()));\n d_clipRect.right(ceguimax(0.0f, region.right()));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::appendGeometry(const std::vector<float>& vertex_data)\n{\n d_vertexData.insert(d_vertexData.end(), vertex_data.begin(), \n vertex_data.end());\n\n d_dataAppended = true;\n\n size_t float_per_element;\n\n switch(d_expectedData){\n case MANUALOBJECT_TYPE_COLOURED: float_per_element = FLOATS_PER_COLOURED; break;\n case MANUALOBJECT_TYPE_TEXTURED: float_per_element = FLOATS_PER_TEXTURED; break;\n }\n\n d_vertexCount = d_vertexData.size()\/float_per_element;\n}\n\nvoid OgreGeometryBuffer::syncManualObject() const\n{\n if (!d_dataAppended)\n return;\n\n \/\/ All the data is in the vector so it's safe to clear\n d_vertexHolder->clear();\n\n \/\/ Blank material initially\n d_vertexHolder->begin(\"BaseWhiteNoLighting\", \n Ogre::RenderOperation::OT_TRIANGLE_LIST);\n\n \/\/ Append the data to the manual object\n if (d_expectedData == MANUALOBJECT_TYPE_TEXTURED)\n {\n for (size_t i = 0; i < d_vertexData.size(); i += FLOATS_PER_TEXTURED)\n {\n assert(i+FLOATS_PER_TEXTURED < d_vertexData.size() && \n \"invalid vertex data passed to OgreGeometryBuffer\");\n\n \/\/ First the position\n d_vertexHolder->position(d_vertexData[i], d_vertexData[i+1], \n d_vertexData[i+2]);\n\n \/\/ And then the colour\n d_vertexHolder->colour(d_vertexData[i+3], d_vertexData[i+4], \n d_vertexData[i+5], d_vertexData[i+6]);\n\n\n \/\/ And finally texture coordinate\n d_vertexHolder->textureCoord(d_vertexData[i+7], d_vertexData[i+8]);\n }\n }\n else if (d_expectedData == MANUALOBJECT_TYPE_COLOURED)\n {\n\n for (size_t i = 0; i < d_vertexData.size(); i += FLOATS_PER_COLOURED)\n {\n assert(i+FLOATS_PER_COLOURED < d_vertexData.size() && \n \"invalid vertex data passed to OgreGeometryBuffer\");\n\n \/\/ First the position\n d_vertexHolder->position(d_vertexData[i], d_vertexData[i+1], \n d_vertexData[i+2]);\n\n \/\/ And then the colour\n d_vertexHolder->colour(d_vertexData[i+3], d_vertexData[i+4], \n d_vertexData[i+5], d_vertexData[i+6]);\n }\n }\n\n\n auto section = d_vertexHolder->end();\n\n d_renderOp = section->getRenderOperation();\n\n d_dataAppended = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::updateMatrix() const\n{\n \/\/ translation to position geometry and offset to pivot point\n Ogre::Matrix4 trans;\n\n trans.makeTrans(d_translation.d_x + d_pivot.d_x,\n d_translation.d_y + d_pivot.d_y,\n d_translation.d_z + d_pivot.d_z);\n\n\n \/\/ rotation\n Ogre::Matrix4 rot(Ogre::Quaternion(\n d_rotation.d_w, d_rotation.d_x, d_rotation.d_y, d_rotation.d_z));\n\n\n \/\/ translation to remove rotation pivot offset\n Ogre::Matrix4 inv_pivot_trans;\n inv_pivot_trans.makeTrans(-d_pivot.d_x, -d_pivot.d_y, -d_pivot.d_z);\n\n\n \/\/ calculate final matrix\n d_matrix = trans * rot * inv_pivot_trans;\n\n\n d_matrixValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Ogre::Matrix4& OgreGeometryBuffer::getMatrix() const{\n if (!d_matrixValid)\n updateMatrix();\n\n return d_matrix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::initialiseTextureStates() const\n{\n using namespace Ogre;\n d_renderSystem._setTextureCoordCalculation(0, TEXCALC_NONE);\n d_renderSystem._setTextureCoordSet(0, 0);\n d_renderSystem._setTextureUnitFiltering(0, FO_LINEAR, FO_LINEAR, FO_POINT);\n d_renderSystem._setTextureAddressingMode(0, S_textureAddressMode);\n d_renderSystem._setTextureMatrix(0, Matrix4::IDENTITY);\n d_renderSystem._setAlphaRejectSettings(CMPF_ALWAYS_PASS, 0, false);\n d_renderSystem._setTextureBlendMode(0, S_colourBlendMode);\n d_renderSystem._setTextureBlendMode(0, S_alphaBlendMode);\n d_renderSystem._disableTextureUnitsFrom(1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::finaliseVertexAttributes(MANUALOBJECT_TYPE type)\n{\n d_expectedData = type;\n\n if (d_expectedData >= MANUALOBJECT_TYPE_INVALID)\n {\n CEGUI_THROW(RendererException(\n \"Unknown d_expectedData type.\"));\n }\n\n setVertexBuffer(INITIAL_BUFFER_SIZE);\n}\n\nvoid OgreGeometryBuffer::setVertexBuffer(size_t size)\n{\n \/\/ create the vertex container\n d_vertexHolder = d_owner.getDummyScene().createManualObject(\n Ogre::SCENE_STATIC);\n\n if (!d_vertexHolder)\n {\n CEGUI_THROW(RendererException(\"Failed to create Ogre vertex buffer, \"\n \"probably because the vertex layout is invalid.\"));\n }\n\n\n d_vertexHolder->setDynamic(false);\n d_vertexHolder->estimateVertexCount(size);\n}\n\nvoid OgreGeometryBuffer::cleanUpVertexAttributes()\n{\n d_renderOp = 0;\n\n d_owner.getDummyScene().destroyManualObject(d_vertexHolder);\n d_vertexHolder = 0;\n}\n\nvoid OgreGeometryBuffer::setScissorRects() const\n{\n d_renderSystem.setScissorTest(true, d_clipRect.left(), \n d_clipRect.top(), d_clipRect.right(), d_clipRect.bottom());\n}\n\n\n\n\n} \/\/ End of CEGUI namespace section\n<commit_msg>IT WORKS! at least the loading screen displays<commit_after>\/***********************************************************************\n created: Tue Feb 17 2009\n author: Henri I Hyyryläinen (based on code by Paul D Turner)\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2013 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/Ogre\/GeometryBuffer.h\"\n#include \"CEGUI\/RendererModules\/Ogre\/Texture.h\"\n#include \"CEGUI\/Vertex.h\"\n#include \"CEGUI\/RenderEffect.h\"\n\n#include <OgreRenderSystem.h>\n#include <OgreQuaternion.h>\n#include <OgreHardwareBufferManager.h>\n#include \"CEGUI\/Exceptions.h\"\n#include \"CEGUI\/ShaderParameterBindings.h\"\n\n#include \"OgreManualObject.h\"\n#include \"OgreRenderOperation.h\"\n#include \"OgreSceneManager.h\"\n\n\n#define INITIAL_BUFFER_SIZE 64\n\n#define FLOATS_PER_TEXTURED 9\n#define FLOATS_PER_COLOURED 7\n\n\/\/ Start of CEGUI namespace section\nnamespace CEGUI\n{\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::LayerBlendModeEx S_colourBlendMode =\n{\n Ogre::LBT_COLOUR,\n Ogre::LBX_MODULATE,\n Ogre::LBS_TEXTURE,\n Ogre::LBS_DIFFUSE,\n Ogre::ColourValue(0, 0, 0, 0),\n Ogre::ColourValue(0, 0, 0, 0),\n 0, 0, 0\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::LayerBlendModeEx S_alphaBlendMode =\n{\n Ogre::LBT_ALPHA,\n Ogre::LBX_MODULATE,\n Ogre::LBS_TEXTURE,\n Ogre::LBS_DIFFUSE,\n Ogre::ColourValue(0, 0, 0, 0),\n Ogre::ColourValue(0, 0, 0, 0),\n 0, 0, 0\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nstatic const Ogre::TextureUnitState::UVWAddressingMode S_textureAddressMode =\n{\n Ogre::TextureUnitState::TAM_CLAMP,\n Ogre::TextureUnitState::TAM_CLAMP,\n Ogre::TextureUnitState::TAM_CLAMP\n};\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreGeometryBuffer::OgreGeometryBuffer(OgreRenderer& owner, \n Ogre::RenderSystem& rs, CEGUI::RefCounted<RenderMaterial> renderMaterial) :\n GeometryBuffer(renderMaterial),\n d_owner(owner),\n d_renderSystem(rs),\n d_clipRect(0, 0, 0, 0),\n d_matrixValid(false),\n d_vertexHolder(0),\n d_expectedData(MANUALOBJECT_TYPE_INVALID),\n d_renderOp(0),\n d_dataAppended(false)\n{\n \n}\n\n\/\/----------------------------------------------------------------------------\/\/\nOgreGeometryBuffer::~OgreGeometryBuffer()\n{\n cleanUpVertexAttributes();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::draw() const\n{\n if (d_vertexData.empty())\n return;\n\n if (d_dataAppended)\n syncManualObject();\n\n if (!d_renderOp)\n return;\n\n \/\/ setup clip region\n if (d_clippingActive)\n setScissorRects();\n\n \/\/ Update the model matrix if necessary\n if (!d_matrixValid)\n updateMatrix();\n\n CEGUI::ShaderParameterBindings* shaderParameterBindings = \n (*d_renderMaterial).getShaderParamBindings();\n\n\n \/\/ Set the ModelViewProjection matrix in the bindings\n Ogre::Matrix4 omat = d_owner.getWorldViewProjMatrix()*d_matrix;\n\n glm::mat4 glmmat;\n\n OgreRenderer::convertOgreMatrixToGLMMatrix(omat, glmmat);\n\n shaderParameterBindings->setParameter(\"modelViewPerspMatrix\", glmmat);\n\n\n d_owner.bindBlendMode(d_blendMode);\n\n bool found_texture = false;\n\n \/\/ Not sure if this is needed here\n const ShaderParameterBindings::ShaderParameterBindingsMap& \n shader_parameter_bindings = shaderParameterBindings->\n getShaderParameterBindings();\n\n auto end = shader_parameter_bindings.end();\n\n for (auto iter = shader_parameter_bindings.begin(); iter != end; ++iter)\n {\n const CEGUI::ShaderParameter* parameter = iter->second;\n const ShaderParamType parameterType = parameter->getType();\n\n\n if (iter->first == \"texture0\")\n {\n\n const CEGUI::ShaderParameterTexture* parameterTexture = \n static_cast<const CEGUI::ShaderParameterTexture*>(parameter);\n\n const CEGUI::OgreTexture* texture = static_cast<const \n CEGUI::OgreTexture*>(parameterTexture->d_parameterValue);\n\n d_vertexHolder->setMaterialName(0, \n texture->getOgreTexture()->getName());\n\n found_texture = true;\n break;\n }\n }\n\n if (!found_texture)\n {\n \/\/ Reset the material\n d_vertexHolder->setMaterialName(0, \"BaseWhiteNoLighting\");\n }\n\n const int pass_count = d_effect ? d_effect->getPassCount() : 1;\n for (int pass = 0; pass < pass_count; ++pass)\n {\n \/\/ set up RenderEffect\n if (d_effect)\n d_effect->performPreRenderFunctions(pass);\n\n initialiseTextureStates();\n\n \/\/Prepare for the rendering process according to the used render material\n d_renderMaterial->prepareForRendering();\n \n\n \/\/ draw the geometry\n d_renderSystem._render(*d_renderOp);\n }\n\n \/\/ clean up RenderEffect\n if (d_effect)\n d_effect->performPostRenderFunctions();\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::setClippingRegion(const Rectf& region)\n{\n d_clipRect.top(ceguimax(0.0f, region.top()));\n d_clipRect.bottom(ceguimax(0.0f, region.bottom()));\n d_clipRect.left(ceguimax(0.0f, region.left()));\n d_clipRect.right(ceguimax(0.0f, region.right()));\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::appendGeometry(const std::vector<float>& vertex_data)\n{\n d_vertexData.insert(d_vertexData.end(), vertex_data.begin(), \n vertex_data.end());\n\n d_dataAppended = true;\n\n size_t float_per_element;\n\n switch(d_expectedData){\n case MANUALOBJECT_TYPE_COLOURED: float_per_element = FLOATS_PER_COLOURED; break;\n case MANUALOBJECT_TYPE_TEXTURED: float_per_element = FLOATS_PER_TEXTURED; break;\n }\n\n d_vertexCount = d_vertexData.size()\/float_per_element;\n}\n\nvoid OgreGeometryBuffer::syncManualObject() const\n{\n if (!d_dataAppended)\n return;\n\n \/\/ All the data is in the vector so it's safe to clear\n d_vertexHolder->clear();\n\n \/\/ Blank material initially\n d_vertexHolder->begin(\"BaseWhiteNoLighting\", \n Ogre::RenderOperation::OT_TRIANGLE_LIST);\n\n \/\/ Append the data to the manual object\n if (d_expectedData == MANUALOBJECT_TYPE_TEXTURED)\n {\n for (size_t i = 0; i < d_vertexData.size(); i += FLOATS_PER_TEXTURED)\n {\n assert(i+FLOATS_PER_TEXTURED <= d_vertexData.size() && \n \"invalid vertex data passed to OgreGeometryBuffer\");\n\n \/\/ First the position\n d_vertexHolder->position(d_vertexData[i], d_vertexData[i+1], \n d_vertexData[i+2]);\n\n \/\/ And then the colour\n d_vertexHolder->colour(d_vertexData[i+3], d_vertexData[i+4], \n d_vertexData[i+5], d_vertexData[i+6]);\n\n\n \/\/ And finally texture coordinate\n d_vertexHolder->textureCoord(d_vertexData[i+7], d_vertexData[i+8]);\n }\n }\n else if (d_expectedData == MANUALOBJECT_TYPE_COLOURED)\n {\n\n for (size_t i = 0; i < d_vertexData.size(); i += FLOATS_PER_COLOURED)\n {\n assert(i+FLOATS_PER_COLOURED <= d_vertexData.size() && \n \"invalid vertex data passed to OgreGeometryBuffer\");\n\n \/\/ First the position\n d_vertexHolder->position(d_vertexData[i], d_vertexData[i+1], \n d_vertexData[i+2]);\n\n \/\/ And then the colour\n d_vertexHolder->colour(d_vertexData[i+3], d_vertexData[i+4], \n d_vertexData[i+5], d_vertexData[i+6]);\n }\n }\n\n\n auto section = d_vertexHolder->end();\n\n d_renderOp = section->getRenderOperation();\n\n d_dataAppended = false;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::updateMatrix() const\n{\n \/\/ translation to position geometry and offset to pivot point\n Ogre::Matrix4 trans;\n\n trans.makeTrans(d_translation.d_x + d_pivot.d_x,\n d_translation.d_y + d_pivot.d_y,\n d_translation.d_z + d_pivot.d_z);\n\n\n \/\/ rotation\n Ogre::Matrix4 rot(Ogre::Quaternion(\n d_rotation.d_w, d_rotation.d_x, d_rotation.d_y, d_rotation.d_z));\n\n\n \/\/ translation to remove rotation pivot offset\n Ogre::Matrix4 inv_pivot_trans;\n inv_pivot_trans.makeTrans(-d_pivot.d_x, -d_pivot.d_y, -d_pivot.d_z);\n\n\n \/\/ calculate final matrix\n d_matrix = trans * rot * inv_pivot_trans;\n\n\n d_matrixValid = true;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst Ogre::Matrix4& OgreGeometryBuffer::getMatrix() const{\n if (!d_matrixValid)\n updateMatrix();\n\n return d_matrix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::initialiseTextureStates() const\n{\n using namespace Ogre;\n d_renderSystem._setTextureCoordCalculation(0, TEXCALC_NONE);\n d_renderSystem._setTextureCoordSet(0, 0);\n d_renderSystem._setTextureUnitFiltering(0, FO_LINEAR, FO_LINEAR, FO_POINT);\n d_renderSystem._setTextureAddressingMode(0, S_textureAddressMode);\n d_renderSystem._setTextureMatrix(0, Matrix4::IDENTITY);\n d_renderSystem._setAlphaRejectSettings(CMPF_ALWAYS_PASS, 0, false);\n d_renderSystem._setTextureBlendMode(0, S_colourBlendMode);\n d_renderSystem._setTextureBlendMode(0, S_alphaBlendMode);\n d_renderSystem._disableTextureUnitsFrom(1);\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid OgreGeometryBuffer::finaliseVertexAttributes(MANUALOBJECT_TYPE type)\n{\n d_expectedData = type;\n\n if (d_expectedData >= MANUALOBJECT_TYPE_INVALID)\n {\n CEGUI_THROW(RendererException(\n \"Unknown d_expectedData type.\"));\n }\n\n setVertexBuffer(INITIAL_BUFFER_SIZE);\n}\n\nvoid OgreGeometryBuffer::setVertexBuffer(size_t size)\n{\n \/\/ create the vertex container\n d_vertexHolder = d_owner.getDummyScene().createManualObject(\n Ogre::SCENE_STATIC);\n\n if (!d_vertexHolder)\n {\n CEGUI_THROW(RendererException(\"Failed to create Ogre vertex buffer, \"\n \"probably because the vertex layout is invalid.\"));\n }\n\n\n d_vertexHolder->setDynamic(false);\n d_vertexHolder->estimateVertexCount(size);\n}\n\nvoid OgreGeometryBuffer::cleanUpVertexAttributes()\n{\n d_renderOp = 0;\n\n d_owner.getDummyScene().destroyManualObject(d_vertexHolder);\n d_vertexHolder = 0;\n}\n\nvoid OgreGeometryBuffer::setScissorRects() const\n{\n d_renderSystem.setScissorTest(true, d_clipRect.left(), \n d_clipRect.top(), d_clipRect.right(), d_clipRect.bottom());\n}\n\n\n\n\n} \/\/ End of CEGUI namespace section\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the CitizenFX project - http:\/\/citizen.re\/\n *\n * See LICENSE and MENTIONS in the root of the source tree for information\n * regarding licensing.\n *\/\n\n#include \"Hooking.Patterns.h\"\n\n#define WIN32_LEAN_AND_MEAN\n\n#include <windows.h>\n#include <algorithm>\n\n#if PATTERNS_USE_HINTS\n#include <map>\n#endif\n\n#if PATTERNS_USE_HINTS\n\n\/\/ from boost someplace\ntemplate <std::uint64_t FnvPrime, std::uint64_t OffsetBasis>\nstruct basic_fnv_1\n{\n std::uint64_t operator()(const char *text) const\n {\n std::uint64_t hash = OffsetBasis;\n\n while (*text != 0)\n {\n hash *= FnvPrime;\n hash ^= *(uint8_t *)text;\n\n ++text;\n }\n\n return hash;\n }\n};\n\nconst std::uint64_t fnv_prime = 1099511628211u;\nconst std::uint64_t fnv_offset_basis = 14695981039346656037u;\n\ntypedef basic_fnv_1<fnv_prime, fnv_offset_basis> fnv_1;\n\n#endif\n\nnamespace hook\n{\n ptrdiff_t baseAddressDifference;\n\n \/\/ sets the base to the process main base\n void set_base()\n {\n set_base((uintptr_t)GetModuleHandle(nullptr));\n }\n\n\n#if PATTERNS_USE_HINTS\nstatic std::multimap<uint64_t, uintptr_t> g_hints;\n#endif\n\nstatic void TransformPattern(const char *pattern, std::vector<uint8_t>& data, std::vector<uint8_t>& mask)\n{\n auto tol = [](char ch) -> uint8_t\n {\n if (ch >= 'A' && ch <= 'F') return uint8_t(ch - 'A' + 10);\n if (ch >= 'a' && ch <= 'f') return uint8_t(ch - 'a' + 10);\n return uint8_t(ch - '0');\n };\n\n auto is_digit = [](char ch) -> bool\n {\n return (ch >= 'A' && ch <= 'F') || (ch >= 'a' && ch <= 'f') || (ch >= '0' && ch <= '9');\n };\n\n char temp_string[2]{ 0, 0 };\n\n data.clear();\n mask.clear();\n\n if (!pattern)\n {\n return;\n }\n\n const char *patit = pattern;\n const char *patend = (pattern + strlen(pattern) + 1);\n\n while (patit != patend)\n {\n char ch = *patit;\n\n if (ch == ' ' || ch == 0)\n {\n if (!temp_string[0] && !temp_string[1])\n {\n continue;\n }\n else if (temp_string[0] == '?' && (temp_string[1] == '?' || temp_string[1] == 0))\n {\n data.push_back(0);\n mask.push_back(0u);\n }\n else if (temp_string[0] == '?' && is_digit(temp_string[1]))\n {\n data.push_back(tol(temp_string[1]));\n mask.push_back(0x0Fu);\n }\n else if (temp_string[1] == '?' && is_digit(temp_string[0]))\n {\n data.push_back(tol(temp_string[0]) << 4);\n mask.push_back(0xF0u);\n }\n else if (is_digit(temp_string[0]) && is_digit(temp_string[1]))\n {\n data.push_back((tol(temp_string[0]) << 4) | tol(temp_string[1]));\n mask.push_back(0xFFu);\n }\n else\n {\n data.clear();\n mask.clear();\n return;\n }\n\n temp_string[0] = 0;\n temp_string[1] = 0;\n }\n else\n {\n if (temp_string[0] == 0)\n {\n temp_string[0] = ch;\n }\n else if (temp_string[1] == 0)\n {\n temp_string[1] = ch;\n }\n else\n {\n data.clear();\n mask.clear();\n return;\n }\n }\n\n ++patit;\n }\n}\n\nclass executable_meta\n{\nprivate:\n uintptr_t m_begin;\n uintptr_t m_end;\n\npublic:\n template<typename TReturn, typename TOffset>\n TReturn* getRVA(TOffset rva)\n {\n return (TReturn*)(m_begin + rva);\n }\n\n explicit executable_meta(void* module)\n : m_begin((uintptr_t)module), m_end(0)\n {\n static auto getSection = [](const PIMAGE_NT_HEADERS nt_headers, unsigned section) -> PIMAGE_SECTION_HEADER\n {\n return reinterpret_cast<PIMAGE_SECTION_HEADER>(\n (UCHAR*)nt_headers->OptionalHeader.DataDirectory +\n nt_headers->OptionalHeader.NumberOfRvaAndSizes * sizeof(IMAGE_DATA_DIRECTORY) +\n section * sizeof(IMAGE_SECTION_HEADER));\n };\n\n PIMAGE_DOS_HEADER dosHeader = getRVA<IMAGE_DOS_HEADER>(0);\n PIMAGE_NT_HEADERS ntHeader = getRVA<IMAGE_NT_HEADERS>(dosHeader->e_lfanew);\n\n for (int i = 0; i < ntHeader->FileHeader.NumberOfSections; i++)\n {\n auto sec = getSection(ntHeader, i);\n auto secSize = sec->SizeOfRawData != 0 ? sec->SizeOfRawData : sec->Misc.VirtualSize;\n if (sec->Characteristics & IMAGE_SCN_MEM_EXECUTE)\n m_end = m_begin + sec->VirtualAddress + secSize;\n\n if ((i == ntHeader->FileHeader.NumberOfSections - 1) && m_end == 0)\n m_end = m_begin + sec->PointerToRawData + secSize;\n }\n }\n\n executable_meta(uintptr_t begin, uintptr_t end)\n : m_begin(begin), m_end(end)\n {\n }\n\n inline uintptr_t begin() const { return m_begin; }\n inline uintptr_t end() const { return m_end; }\n};\n\nvoid pattern::Initialize(const char* pattern)\n{\n \/\/ get the hash for the base pattern\n#if PATTERNS_USE_HINTS\n m_hash = fnv_1()(pattern);\n#endif\n\n \/\/ transform the base pattern from IDA format to canonical format\n TransformPattern(pattern, m_bytes, m_mask);\n\n m_size = m_mask.size();\n\n#if PATTERNS_USE_HINTS\n \/\/ if there's hints, try those first\n if (m_module == GetModuleHandle(nullptr))\n {\n auto range = g_hints.equal_range(m_hash);\n\n if (range.first != range.second)\n {\n std::for_each(range.first, range.second, [&] (const std::pair<uint64_t, uintptr_t>& hint)\n {\n ConsiderMatch(hint.second);\n });\n\n \/\/ if the hints succeeded, we don't need to do anything more\n if (!m_matches.empty())\n {\n m_matched = true;\n return;\n }\n }\n }\n#endif\n}\n\nvoid pattern::EnsureMatches(uint32_t maxCount)\n{\n if (m_matched)\n return;\n\n if (!m_rangeStart && !m_rangeEnd && !m_module)\n return;\n\n \/\/ scan the executable for code\n executable_meta executable = m_rangeStart != 0 && m_rangeEnd != 0 ? executable_meta(m_rangeStart, m_rangeEnd) : executable_meta(m_module);\n\n auto matchSuccess = [&] (uintptr_t address)\n {\n#if PATTERNS_USE_HINTS\n g_hints.emplace(m_hash, address);\n#else\n (void)address;\n#endif\n\n return (m_matches.size() == maxCount);\n };\n\n ptrdiff_t BadCharacter[256];\n\n std::ptrdiff_t index;\n\n const std::uint8_t *pbytes = m_bytes.data();\n const std::uint8_t *pmask = m_mask.data();\n\n for (std::uint32_t bc = 0; bc < 256; ++bc)\n {\n for (index = m_size - 1; index >= 0; --index)\n {\n if ((pbytes[index] & pmask[index]) == (bc & pmask[index]))\n {\n break;\n }\n }\n\n BadCharacter[bc] = index;\n }\n\n __try\n {\n for (uintptr_t i = executable.begin(), end = executable.end() - m_size; i <= end;)\n {\n uint8_t* ptr = reinterpret_cast<uint8_t*>(i);\n\n for (index = m_size - 1; index >= 0; --index)\n {\n if ((pbytes[index] & pmask[index]) != (ptr[index] & pmask[index]))\n {\n break;\n }\n }\n\n if (index == -1)\n {\n m_matches.emplace_back(ptr);\n\n if (matchSuccess(i))\n {\n break;\n }\n\n i += m_size;\n }\n else\n {\n i += max(index - BadCharacter[ptr[index]], 1);\n }\n }\n }\n __except ((GetExceptionCode() == EXCEPTION_ACCESS_VIOLATION) ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH) \n { }\n m_matched = true;\n}\n\nbool pattern::ConsiderMatch(uintptr_t offset)\n{\n const uint8_t* pattern = m_bytes.data();\n const uint8_t* mask = m_mask.data();\n\n char* ptr = reinterpret_cast<char*>(offset);\n\n for (size_t i = 0; i < m_size; i++)\n {\n if ((pattern[i] & mask[i]) != (ptr[i] & mask[i]))\n {\n return false;\n }\n }\n\n m_matches.emplace_back(ptr);\n\n return true;\n}\n\n#if PATTERNS_USE_HINTS\nvoid pattern::hint(uint64_t hash, uintptr_t address)\n{\n auto range = g_hints.equal_range(hash);\n\n for (auto it = range.first; it != range.second; it++)\n {\n if (it->second == address)\n {\n return;\n }\n }\n\n g_hints.emplace(hash, address);\n}\n#endif\n}<commit_msg>Fix deadloop at processing continous delimiter.<commit_after>\/*\n * This file is part of the CitizenFX project - http:\/\/citizen.re\/\n *\n * See LICENSE and MENTIONS in the root of the source tree for information\n * regarding licensing.\n *\/\n\n#include \"Hooking.Patterns.h\"\n\n#define WIN32_LEAN_AND_MEAN\n\n#include <windows.h>\n#include <algorithm>\n\n#if PATTERNS_USE_HINTS\n#include <map>\n#endif\n\n#if PATTERNS_USE_HINTS\n\n\/\/ from boost someplace\ntemplate <std::uint64_t FnvPrime, std::uint64_t OffsetBasis>\nstruct basic_fnv_1\n{\n std::uint64_t operator()(const char *text) const\n {\n std::uint64_t hash = OffsetBasis;\n\n while (*text != 0)\n {\n hash *= FnvPrime;\n hash ^= *(uint8_t *)text;\n\n ++text;\n }\n\n return hash;\n }\n};\n\nconst std::uint64_t fnv_prime = 1099511628211u;\nconst std::uint64_t fnv_offset_basis = 14695981039346656037u;\n\ntypedef basic_fnv_1<fnv_prime, fnv_offset_basis> fnv_1;\n\n#endif\n\nnamespace hook\n{\n ptrdiff_t baseAddressDifference;\n\n \/\/ sets the base to the process main base\n void set_base()\n {\n set_base((uintptr_t)GetModuleHandle(nullptr));\n }\n\n\n#if PATTERNS_USE_HINTS\nstatic std::multimap<uint64_t, uintptr_t> g_hints;\n#endif\n\nstatic void TransformPattern(const char *pattern, std::vector<uint8_t>& data, std::vector<uint8_t>& mask)\n{\n auto tol = [](char ch) -> uint8_t\n {\n if (ch >= 'A' && ch <= 'F') return uint8_t(ch - 'A' + 10);\n if (ch >= 'a' && ch <= 'f') return uint8_t(ch - 'a' + 10);\n return uint8_t(ch - '0');\n };\n\n auto is_digit = [](char ch) -> bool\n {\n return (ch >= 'A' && ch <= 'F') || (ch >= 'a' && ch <= 'f') || (ch >= '0' && ch <= '9');\n };\n\n char temp_string[2]{ 0, 0 };\n\n data.clear();\n mask.clear();\n\n if (!pattern)\n {\n return;\n }\n\n const char *patit = pattern;\n const char *patend = (pattern + strlen(pattern) + 1);\n\n while (patit != patend)\n {\n char ch = *patit;\n\n if (ch == ' ' || ch == 0)\n {\n if (!temp_string[0] && !temp_string[1]) \/\/Continous delimiter\n {\n \n }\n else if (temp_string[0] == '?' && (temp_string[1] == '?' || temp_string[1] == 0)) \/\/??\n {\n data.push_back(0);\n mask.push_back(0u);\n }\n else if (temp_string[0] == '?' && is_digit(temp_string[1])) \/\/?x\n {\n data.push_back(tol(temp_string[1]));\n mask.push_back(0x0Fu);\n }\n else if (temp_string[1] == '?' && is_digit(temp_string[0])) \/\/x?\n {\n data.push_back(tol(temp_string[0]) << 4);\n mask.push_back(0xF0u);\n }\n else if (is_digit(temp_string[0]) && is_digit(temp_string[1])) \/\/xx\n {\n data.push_back((tol(temp_string[0]) << 4) | tol(temp_string[1]));\n mask.push_back(0xFFu);\n }\n else\n {\n data.clear();\n mask.clear();\n return;\n }\n\n temp_string[0] = 0;\n temp_string[1] = 0;\n }\n else\n {\n if (temp_string[0] == 0)\n {\n temp_string[0] = ch;\n }\n else if (temp_string[1] == 0)\n {\n temp_string[1] = ch;\n }\n else\n {\n data.clear();\n mask.clear();\n return;\n }\n }\n\n ++patit;\n }\n}\n\nclass executable_meta\n{\nprivate:\n uintptr_t m_begin;\n uintptr_t m_end;\n\npublic:\n template<typename TReturn, typename TOffset>\n TReturn* getRVA(TOffset rva)\n {\n return (TReturn*)(m_begin + rva);\n }\n\n explicit executable_meta(void* module)\n : m_begin((uintptr_t)module), m_end(0)\n {\n static auto getSection = [](const PIMAGE_NT_HEADERS nt_headers, unsigned section) -> PIMAGE_SECTION_HEADER\n {\n return reinterpret_cast<PIMAGE_SECTION_HEADER>(\n (UCHAR*)nt_headers->OptionalHeader.DataDirectory +\n nt_headers->OptionalHeader.NumberOfRvaAndSizes * sizeof(IMAGE_DATA_DIRECTORY) +\n section * sizeof(IMAGE_SECTION_HEADER));\n };\n\n PIMAGE_DOS_HEADER dosHeader = getRVA<IMAGE_DOS_HEADER>(0);\n PIMAGE_NT_HEADERS ntHeader = getRVA<IMAGE_NT_HEADERS>(dosHeader->e_lfanew);\n\n for (int i = 0; i < ntHeader->FileHeader.NumberOfSections; i++)\n {\n auto sec = getSection(ntHeader, i);\n auto secSize = sec->SizeOfRawData != 0 ? sec->SizeOfRawData : sec->Misc.VirtualSize;\n if (sec->Characteristics & IMAGE_SCN_MEM_EXECUTE)\n m_end = m_begin + sec->VirtualAddress + secSize;\n\n if ((i == ntHeader->FileHeader.NumberOfSections - 1) && m_end == 0)\n m_end = m_begin + sec->PointerToRawData + secSize;\n }\n }\n\n executable_meta(uintptr_t begin, uintptr_t end)\n : m_begin(begin), m_end(end)\n {\n }\n\n inline uintptr_t begin() const { return m_begin; }\n inline uintptr_t end() const { return m_end; }\n};\n\nvoid pattern::Initialize(const char* pattern)\n{\n \/\/ get the hash for the base pattern\n#if PATTERNS_USE_HINTS\n m_hash = fnv_1()(pattern);\n#endif\n\n \/\/ transform the base pattern from IDA format to canonical format\n TransformPattern(pattern, m_bytes, m_mask);\n\n m_size = m_mask.size();\n\n#if PATTERNS_USE_HINTS\n \/\/ if there's hints, try those first\n if (m_module == GetModuleHandle(nullptr))\n {\n auto range = g_hints.equal_range(m_hash);\n\n if (range.first != range.second)\n {\n std::for_each(range.first, range.second, [&] (const std::pair<uint64_t, uintptr_t>& hint)\n {\n ConsiderMatch(hint.second);\n });\n\n \/\/ if the hints succeeded, we don't need to do anything more\n if (!m_matches.empty())\n {\n m_matched = true;\n return;\n }\n }\n }\n#endif\n}\n\nvoid pattern::EnsureMatches(uint32_t maxCount)\n{\n if (m_matched)\n return;\n\n if (!m_rangeStart && !m_rangeEnd && !m_module)\n return;\n\n \/\/ scan the executable for code\n executable_meta executable = m_rangeStart != 0 && m_rangeEnd != 0 ? executable_meta(m_rangeStart, m_rangeEnd) : executable_meta(m_module);\n\n auto matchSuccess = [&] (uintptr_t address)\n {\n#if PATTERNS_USE_HINTS\n g_hints.emplace(m_hash, address);\n#else\n (void)address;\n#endif\n\n return (m_matches.size() == maxCount);\n };\n\n ptrdiff_t BadCharacter[256];\n\n std::ptrdiff_t index;\n\n const std::uint8_t *pbytes = m_bytes.data();\n const std::uint8_t *pmask = m_mask.data();\n\n for (std::uint32_t bc = 0; bc < 256; ++bc)\n {\n for (index = m_size - 1; index >= 0; --index)\n {\n if ((pbytes[index] & pmask[index]) == (bc & pmask[index]))\n {\n break;\n }\n }\n\n BadCharacter[bc] = index;\n }\n\n __try\n {\n for (uintptr_t i = executable.begin(), end = executable.end() - m_size; i <= end;)\n {\n uint8_t* ptr = reinterpret_cast<uint8_t*>(i);\n\n for (index = m_size - 1; index >= 0; --index)\n {\n if ((pbytes[index] & pmask[index]) != (ptr[index] & pmask[index]))\n {\n break;\n }\n }\n\n if (index == -1)\n {\n m_matches.emplace_back(ptr);\n\n if (matchSuccess(i))\n {\n break;\n }\n\n i += m_size;\n }\n else\n {\n i += max(index - BadCharacter[ptr[index]], 1);\n }\n }\n }\n __except ((GetExceptionCode() == EXCEPTION_ACCESS_VIOLATION) ? EXCEPTION_EXECUTE_HANDLER : EXCEPTION_CONTINUE_SEARCH) \n { }\n m_matched = true;\n}\n\nbool pattern::ConsiderMatch(uintptr_t offset)\n{\n const uint8_t* pattern = m_bytes.data();\n const uint8_t* mask = m_mask.data();\n\n char* ptr = reinterpret_cast<char*>(offset);\n\n for (size_t i = 0; i < m_size; i++)\n {\n if ((pattern[i] & mask[i]) != (ptr[i] & mask[i]))\n {\n return false;\n }\n }\n\n m_matches.emplace_back(ptr);\n\n return true;\n}\n\n#if PATTERNS_USE_HINTS\nvoid pattern::hint(uint64_t hash, uintptr_t address)\n{\n auto range = g_hints.equal_range(hash);\n\n for (auto it = range.first; it != range.second; it++)\n {\n if (it->second == address)\n {\n return;\n }\n }\n\n g_hints.emplace(hash, address);\n}\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"s3key_writer.h\"\n\nvoid S3KeyWriter::open(const S3Params& params) {\n this->params = params;\n\n S3_CHECK_OR_DIE_MSG(this->s3interface != NULL, S3RuntimeError, \"s3interface must not be NULL\");\n S3_CHECK_OR_DIE_MSG(this->params.getChunkSize() > 0, S3RuntimeError,\n \"chunkSize must not be zero\");\n\n buffer.reserve(this->params.getChunkSize());\n\n this->uploadId =\n this->s3interface->getUploadId(this->params.getKeyUrl(), this->params.getRegion());\n S3_CHECK_OR_DIE_MSG(!this->uploadId.empty(), S3RuntimeError, \"Failed to get upload id\");\n\n S3DEBUG(\"key: %s, upload id: %s\", this->params.getKeyUrl().c_str(), this->uploadId.c_str());\n}\n\n\/\/ write() first fills up the data buffer before flush it out\nuint64_t S3KeyWriter::write(const char* buf, uint64_t count) {\n \/\/ Defensive code\n S3_CHECK_OR_DIE_MSG(buf != NULL, S3RuntimeError, \"Buffer is NULL\");\n this->checkQueryCancelSignal();\n\n uint64_t offset = 0;\n while (offset < count) {\n if (sharedError) {\n std::rethrow_exception(sharedException);\n }\n\n uint64_t bufferRemaining = this->params.getChunkSize() - this->buffer.size();\n uint64_t dataRemaining = count - offset;\n uint64_t dataToBuffer = bufferRemaining < dataRemaining ? bufferRemaining : dataRemaining;\n\n this->buffer.insert(this->buffer.end(), buf + offset, buf + offset + dataToBuffer);\n\n if (this->buffer.size() == this->params.getChunkSize()) {\n this->flushBuffer();\n }\n\n offset += dataToBuffer;\n }\n\n return count;\n}\n\n\/\/ This should be reentrant, has no side effects when called multiple times.\nvoid S3KeyWriter::close() {\n if (!this->uploadId.empty()) {\n this->completeKeyWriting();\n }\n}\n\nvoid S3KeyWriter::checkQueryCancelSignal() {\n if (S3QueryIsAbortInProgress() && !this->uploadId.empty()) {\n \/\/ to avoid dead-lock when other upload threads hold the lock\n pthread_mutex_unlock(&this->mutex);\n\n \/\/ wait for all threads to complete\n for (size_t i = 0; i < threadList.size(); i++) {\n pthread_join(threadList[i], NULL);\n }\n this->threadList.clear();\n\n \/\/ to avoid double unlock as other parts may lock it\n pthread_mutex_lock(&this->mutex);\n\n S3DEBUG(\"Start aborting multipart uploading (uploadID: %s, %lu parts uploaded)\",\n this->uploadId.c_str(), this->etagList.size());\n this->s3interface->abortUpload(this->params.getKeyUrl(), this->params.getRegion(),\n this->uploadId);\n S3DEBUG(\"Finished aborting multipart uploading (uploadID: %s)\", this->uploadId.c_str());\n\n this->etagList.clear();\n this->uploadId.clear();\n\n S3_DIE_MSG(S3QueryAbort, \"Uploading is interrupted by user\");\n }\n}\n\nstruct ThreadParams {\n S3KeyWriter* keyWriter;\n WriterBuffer data;\n uint64_t currentNumber;\n};\n\nvoid* S3KeyWriter::UploadThreadFunc(void* data) {\n ThreadParams* params = (ThreadParams*)data;\n S3KeyWriter* writer = params->keyWriter;\n\n try {\n S3DEBUG(\"Upload thread start: %p, part number: %\" PRIu64 \", data size: %\" PRIu64,\n pthread_self(), params->currentNumber, params->data.size());\n string etag = writer->s3interface->uploadPartOfData(\n params->data, writer->params.getKeyUrl(), writer->params.getRegion(),\n params->currentNumber, writer->uploadId);\n\n \/\/ when unique_lock destructs it will automatically unlock the mutex.\n UniqueLock threadLock(&writer->mutex);\n\n \/\/ etag is empty if the query is cancelled by user.\n if (!etag.empty()) {\n writer->etagList[params->currentNumber] = etag;\n }\n writer->activeThreads--;\n pthread_cond_broadcast(&writer->cv);\n S3DEBUG(\"Upload part finish: %p, eTag: %s, part number: %\" PRIu64, pthread_self(),\n etag.c_str(), params->currentNumber);\n } catch (S3Exception& e) {\n S3ERROR(\"Upload thread error: %s\", e.getMessage().c_str());\n UniqueLock exceptLock(&writer->exceptionMutex);\n writer->sharedError = true;\n writer->sharedException = std::current_exception();\n }\n\n delete params;\n return NULL;\n}\n\nvoid S3KeyWriter::flushBuffer() {\n if (!this->buffer.empty()) {\n UniqueLock queueLock(&this->mutex);\n while (this->activeThreads >= this->params.getNumOfChunks()) {\n pthread_cond_wait(&this->cv, &this->mutex);\n }\n\n \/\/ Most time query is canceled during uploadPartOfData(). This is the first chance to cancel\n \/\/ and clean up upload.\n this->checkQueryCancelSignal();\n\n this->activeThreads++;\n\n pthread_t writerThread;\n ThreadParams* params = new ThreadParams();\n params->keyWriter = this;\n params->data.swap(this->buffer);\n params->currentNumber = ++this->partNumber;\n pthread_create(&writerThread, NULL, UploadThreadFunc, params);\n threadList.emplace_back(writerThread);\n\n this->buffer.clear();\n }\n}\n\nvoid S3KeyWriter::completeKeyWriting() {\n \/\/ make sure the buffer is clear\n this->flushBuffer();\n\n \/\/ wait for all threads to complete\n for (size_t i = 0; i < threadList.size(); i++) {\n pthread_join(threadList[i], NULL);\n }\n this->threadList.clear();\n\n this->checkQueryCancelSignal();\n\n vector<string> etags;\n \/\/ it is equivalent to foreach(e in etagList) push_back(e.second);\n \/\/ transform(etagList.begin(), etagList.end(), etags.begin(),\n \/\/ [](std::pair<const uint64_t, string>& p) { return p.second; });\n etags.reserve(etagList.size());\n\n for (map<uint64_t, string>::iterator i = etagList.begin(); i != etagList.end(); i++) {\n etags.push_back(i->second);\n }\n\n if (!this->etagList.empty() && !this->uploadId.empty()) {\n this->s3interface->completeMultiPart(this->params.getKeyUrl(), this->params.getRegion(),\n this->uploadId, etags);\n }\n\n S3DEBUG(\"Segment %d has finished uploading \\\"%s\\\"\", s3ext_segid,\n this->params.getKeyUrl().c_str());\n\n this->buffer.clear();\n this->etagList.clear();\n this->uploadId.clear();\n}\n<commit_msg>s3ext: fix the hang issue when user interrupts uploading<commit_after>#include \"s3key_writer.h\"\n\nvoid S3KeyWriter::open(const S3Params& params) {\n this->params = params;\n\n S3_CHECK_OR_DIE_MSG(this->s3interface != NULL, S3RuntimeError, \"s3interface must not be NULL\");\n S3_CHECK_OR_DIE_MSG(this->params.getChunkSize() > 0, S3RuntimeError,\n \"chunkSize must not be zero\");\n\n buffer.reserve(this->params.getChunkSize());\n\n this->uploadId =\n this->s3interface->getUploadId(this->params.getKeyUrl(), this->params.getRegion());\n S3_CHECK_OR_DIE_MSG(!this->uploadId.empty(), S3RuntimeError, \"Failed to get upload id\");\n\n S3DEBUG(\"key: %s, upload id: %s\", this->params.getKeyUrl().c_str(), this->uploadId.c_str());\n}\n\n\/\/ write() first fills up the data buffer before flush it out\nuint64_t S3KeyWriter::write(const char* buf, uint64_t count) {\n \/\/ Defensive code\n S3_CHECK_OR_DIE_MSG(buf != NULL, S3RuntimeError, \"Buffer is NULL\");\n this->checkQueryCancelSignal();\n\n uint64_t offset = 0;\n while (offset < count) {\n if (sharedError) {\n std::rethrow_exception(sharedException);\n }\n\n uint64_t bufferRemaining = this->params.getChunkSize() - this->buffer.size();\n uint64_t dataRemaining = count - offset;\n uint64_t dataToBuffer = bufferRemaining < dataRemaining ? bufferRemaining : dataRemaining;\n\n this->buffer.insert(this->buffer.end(), buf + offset, buf + offset + dataToBuffer);\n\n if (this->buffer.size() == this->params.getChunkSize()) {\n this->flushBuffer();\n }\n\n offset += dataToBuffer;\n }\n\n return count;\n}\n\n\/\/ This should be reentrant, has no side effects when called multiple times.\nvoid S3KeyWriter::close() {\n if (!this->uploadId.empty()) {\n this->completeKeyWriting();\n }\n}\n\nvoid S3KeyWriter::checkQueryCancelSignal() {\n if (S3QueryIsAbortInProgress() && !this->uploadId.empty()) {\n \/\/ to avoid dead-lock when other upload threads hold the lock\n pthread_mutex_unlock(&this->mutex);\n\n \/\/ wait for all threads to complete\n for (size_t i = 0; i < threadList.size(); i++) {\n pthread_join(threadList[i], NULL);\n }\n this->threadList.clear();\n\n \/\/ to avoid double unlock as other parts may lock it\n pthread_mutex_lock(&this->mutex);\n\n S3DEBUG(\"Start aborting multipart uploading (uploadID: %s, %lu parts uploaded)\",\n this->uploadId.c_str(), this->etagList.size());\n this->s3interface->abortUpload(this->params.getKeyUrl(), this->params.getRegion(),\n this->uploadId);\n S3DEBUG(\"Finished aborting multipart uploading (uploadID: %s)\", this->uploadId.c_str());\n\n this->etagList.clear();\n this->uploadId.clear();\n\n S3_DIE_MSG(S3QueryAbort, \"Uploading is interrupted by user\");\n }\n}\n\nstruct ThreadParams {\n S3KeyWriter* keyWriter;\n WriterBuffer data;\n uint64_t currentNumber;\n};\n\nvoid* S3KeyWriter::UploadThreadFunc(void* data) {\n ThreadParams* params = (ThreadParams*)data;\n S3KeyWriter* writer = params->keyWriter;\n\n try {\n S3DEBUG(\"Upload thread start: %p, part number: %\" PRIu64 \", data size: %\" PRIu64,\n pthread_self(), params->currentNumber, params->data.size());\n string etag = writer->s3interface->uploadPartOfData(\n params->data, writer->params.getKeyUrl(), writer->params.getRegion(),\n params->currentNumber, writer->uploadId);\n\n \/\/ when unique_lock destructs it will automatically unlock the mutex.\n UniqueLock threadLock(&writer->mutex);\n\n \/\/ etag is empty if the query is cancelled by user.\n if (!etag.empty()) {\n writer->etagList[params->currentNumber] = etag;\n }\n writer->activeThreads--;\n pthread_cond_broadcast(&writer->cv);\n S3DEBUG(\"Upload part finish: %p, eTag: %s, part number: %\" PRIu64, pthread_self(),\n etag.c_str(), params->currentNumber);\n } catch (S3Exception& e) {\n S3ERROR(\"Upload thread error: %s\", e.getMessage().c_str());\n UniqueLock exceptLock(&writer->exceptionMutex);\n writer->sharedError = true;\n writer->sharedException = std::current_exception();\n\n \/\/ notify the flushBuffer, otherwise it will be locked when trying to create a new thread.\n writer->activeThreads--;\n pthread_cond_broadcast(&writer->cv);\n }\n\n delete params;\n return NULL;\n}\n\nvoid S3KeyWriter::flushBuffer() {\n if (!this->buffer.empty()) {\n UniqueLock queueLock(&this->mutex);\n while (this->activeThreads >= this->params.getNumOfChunks()) {\n pthread_cond_wait(&this->cv, &this->mutex);\n }\n\n \/\/ Most time query is canceled during uploadPartOfData(). This is the first chance to cancel\n \/\/ and clean up upload.\n this->checkQueryCancelSignal();\n\n this->activeThreads++;\n\n pthread_t writerThread;\n ThreadParams* params = new ThreadParams();\n params->keyWriter = this;\n params->data.swap(this->buffer);\n params->currentNumber = ++this->partNumber;\n pthread_create(&writerThread, NULL, UploadThreadFunc, params);\n threadList.emplace_back(writerThread);\n\n this->buffer.clear();\n }\n}\n\nvoid S3KeyWriter::completeKeyWriting() {\n \/\/ make sure the buffer is clear\n this->flushBuffer();\n\n \/\/ wait for all threads to complete\n for (size_t i = 0; i < threadList.size(); i++) {\n pthread_join(threadList[i], NULL);\n }\n this->threadList.clear();\n\n this->checkQueryCancelSignal();\n\n vector<string> etags;\n \/\/ it is equivalent to foreach(e in etagList) push_back(e.second);\n \/\/ transform(etagList.begin(), etagList.end(), etags.begin(),\n \/\/ [](std::pair<const uint64_t, string>& p) { return p.second; });\n etags.reserve(etagList.size());\n\n for (map<uint64_t, string>::iterator i = etagList.begin(); i != etagList.end(); i++) {\n etags.push_back(i->second);\n }\n\n if (!this->etagList.empty() && !this->uploadId.empty()) {\n this->s3interface->completeMultiPart(this->params.getKeyUrl(), this->params.getRegion(),\n this->uploadId, etags);\n }\n\n S3DEBUG(\"Segment %d has finished uploading \\\"%s\\\"\", s3ext_segid,\n this->params.getKeyUrl().c_str());\n\n this->buffer.clear();\n this->etagList.clear();\n this->uploadId.clear();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix possible vulnerability<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Bugfix: `\"%ld\"` is the correct `snprintf` format for `INT32_T`.<commit_after><|endoftext|>"} {"text":"<commit_before>#ifndef SDL_KEYBOARD_HH\r\n#define SDL_KEYBOARD_HH\r\n\r\n#include \"SDLConfig.hh\"\r\n\r\nnamespace RAGE\r\n{\r\n namespace SDL\r\n {\r\n\r\n class EventManager;\r\n\r\n \/\/\/This class is not suitable for Full Text Input. Use TextInput instead.\r\n \/\/\/However this class is well adapted to key press \/ release detection, for gaming purpose...\r\n class Keyboard\r\n {\r\n\r\n \/\/State of the Keyboard, updated only on demand by getKeyState\r\n std::vector<bool> _state;\r\n\r\n friend class EventManager;\r\n protected:\r\n bool _quitRequested;\r\n\r\n public:\r\n\r\n typedef enum\r\n {\r\n None=KMOD_NONE,\r\n LShift=KMOD_LSHIFT, RShift=KMOD_RSHIFT,\r\n LCtrl = KMOD_LCTRL, RCtrl = KMOD_RCTRL,\r\n LAlt = KMOD_LALT, RAlt = KMOD_RALT,\r\n LMeta =KMOD_LMETA, RMeta = KMOD_RMETA,\r\n Num = KMOD_NUM,\r\n Caps = KMOD_CAPS,\r\n Mode = KMOD_MODE,\r\n Ctrl = KMOD_CTRL,\r\n Shift = KMOD_SHIFT,\r\n Alt = KMOD_ALT,\r\n Meta = KMOD_META\r\n }\r\n Modifier;\r\n\r\n \/\/TO BE CONTINUED\r\n typedef enum\r\n {\r\n KBackspace = SDLK_BACKSPACE,\r\n KTab = SDLK_TAB,\r\n KClear = SDLK_CLEAR,\r\n KReturn = SDLK_RETURN,\r\n KPause = SDLK_PAUSE,\r\n KEscape = SDLK_ESCAPE,\r\n KSpace = SDLK_SPACE,\r\n KExclaim = SDLK_EXCLAIM,\r\n KQuotedbl = SDLK_QUOTEDBL,\r\n KHash = SDLK_HASH,\r\n KDollar = SDLK_DOLLAR,\r\n KAmpersand = SDLK_AMPERSAND,\r\n KQuote = SDLK_QUOTE,\r\n KLeftparen = SDLK_LEFTPAREN,\r\n KRightparen = SDLK_RIGHTPAREN,\r\n KAsterisk = SDLK_ASTERISK,\r\n KPlus = SDLK_PLUS,\r\n KComma = SDLK_COMMA,\r\n KMinus = SDLK_MINUS,\r\n KPeriod = SDLK_PERIOD,\r\n KSlash = SDLK_SLASH,\r\n K0 = SDLK_0,\r\n K1 = SDLK_1,\r\n K2 = SDLK_2,\r\n K3 = SDLK_3,\r\n K4 = SDLK_4,\r\n K5 = SDLK_5,\r\n K6 = SDLK_6,\r\n K7 = SDLK_7,\r\n K8 = SDLK_8,\r\n K9 = SDLK_9,\r\n KColon, KSemicolon, KLess, KEquals, KGreater, KQuestion, KAt, KLeftbracket, KBackslash, KRightbracket, KCaret, KUnderscore, KBackquote, KA, KB, KC, KD, KE, KF, KG, KH, KI, KJ, KK, KL, KM, KN, KO, KP , KQ, KR, KS, KT, KU, KV, KW, KX, KY, KZ, KDelete,\r\n KWorld0,KWorld1,KWorld2,KWorld3, KWorld4, KWorld5, KWorld6, KWorld7, KWorld8, KWorld9,\r\n KWorld10,KWorld11,KWorld12,KWorld13, KWorld14, KWorld15, KWorld16, KWorld17, KWorld18, KWorld19,\r\n KWorld20,KWorld21,KWorld22,KWorld23, KWorld24, KWorld25, KWorld26, KWorld27, KWorld28, KWorld29,\r\n KWorld30,KWorld31,KWorld32,KWorld33, KWorld34, KWorld35, KWorld36, KWorld37, KWorld38, KWorld39,\r\n KWorld40,KWorld41,KWorld42,KWorld43, KWorld44, KWorld45, KWorld46, KWorld47, KWorld48, KWorld49,\r\n KWorld50,KWorld51,KWorld52,KWorld53, KWorld54, KWorld55, KWorld56, KWorld57, KWorld58, KWorld59,\r\n KWorld60,KWorld61,KWorld62,KWorld63, KWorld64, KWorld65, KWorld66, KWorld67, KWorld68, KWorld69,\r\n KWorld70,KWorld71,KWorld72,KWorld73, KWorld74, KWorld75, KWorld76, KWorld77, KWorld78, KWorld79,\r\n KWorld80,KWorld81,KWorld82,KWorld83, KWorld84, KWorld85, KWorld86, KWorld87, KWorld88, KWorld89,\r\n KWorld90,KWorld91,KWorld92,KWorld93, KWorld94, KWorld95,\r\n KKp0 = SDLK_KP0,\r\n\t\t\t\tKKp1 = SDLK_KP1,\r\n\t\t\t\tKKp2 = SDLK_KP2,\r\n\t\t\t\tKKp3 = SDLK_KP3,\r\n\t\t\t\tKKp4 = SDLK_KP4,\r\n\t\t\t\tKKp5 = SDLK_KP5,\r\n\t\t\t\tKKp6 = SDLK_KP6,\r\n\t\t\t\tKKp7 = SDLK_KP7,\r\n\t\t\t\tKKp8 = SDLK_KP8,\r\n\t\t\t\tKKp9 = SDLK_KP9,\r\n KKDivide = SDLK_KP_DIVIDE,\r\n\t\t\t\tKKMultiply = SDLK_KP_MULTIPLY,\r\n\t\t\t\tKKEnter = SDLK_KP_ENTER,\r\n KUp = SDLK_UP,\r\n KDown = SDLK_DOWN,\r\n KRight = SDLK_RIGHT,\r\n KLeft = SDLK_LEFT,\r\n KInsert, KHome, KEnd, KPageup, KPagedown, KF1, KF2, KF3, KF4, KF5, KF6, KF7, KF8, KF9, KF10, KF11, KF12, KF13, KF14, KF15,\r\n KNumlock, KCapslock, KScrollock,\r\n\t\t\t\tKRShift = SDLK_RSHIFT,\r\n\t\t\t\tKLshift = SDLK_LSHIFT,\r\n\t\t\t\tKLctrl = SDLK_LCTRL,\r\n\t\t\t\tKRctrl = SDLK_RCTRL,\r\n\t\t\t\tKRalt = SDLK_RALT,\r\n\t\t\t\tKLalt = SDLK_LALT,\r\n\t\t\t\tKRmeta, KLmeta, KRsuper, KLsuper, KMode, KCompose, KHelp, KPrintscreen, KSysreq, KBreak, KMenu, KPower, KEuro, KUndo\r\n }\r\n Key;\r\n\r\n class Sym\r\n {\r\n Key _key;\r\n Modifier _mod;\r\n long unsigned int _unicode;\r\n\r\n \/\/the only class allowed to create Sym object from SDL_keysym\r\n friend class CriticalEvent;\r\n friend class Event;\r\n\r\n Sym(const SDL_keysym & ksym) : _key(static_cast<Key>(ksym.sym)), _mod(static_cast<Modifier>(ksym.mod)), _unicode(ksym.unicode)\r\n {}\r\n\r\n public :\r\n\r\n inline Key getKey() const\r\n {\r\n return _key;\r\n }\r\n inline Modifier getMod() const\r\n {\r\n return _mod;\r\n }\r\n\t\t\t\t\/\/WARNING Will return 0 if unicode not enabled\r\n inline long unsigned int getUnicode() const\r\n {\r\n return _unicode;\r\n }\r\n\t\t\t\t\/\/just to convert the unicode value\r\n\t\t\t\tinline char getChar() const\r\n\t\t\t\t{\r\n\t\t\t\t\treturn(static_cast<char>(_unicode & 0x7F));\r\n\t\t\t\t}\r\n\r\n inline bool isUnicode() const\r\n {\r\n return (_unicode & 0xff80) == 0 ;\r\n }\r\n };\r\n\r\n\r\n\r\n \/\/initialises state at size 255 because of the ASCII table size.\r\n Keyboard() : _state(255,false), _quitRequested(false)\r\n {}\r\n virtual ~Keyboard()\r\n {}\r\n\r\n \/\/Get a snapshot of the current keyboard state\r\n \/\/\/return a vector indexed by Key\r\n const std::vector<bool> & updateKeyState (void);\r\n \/\/return true if key down.\r\n bool getKeyState(Key k )\r\n {\r\n updateKeyState();\r\n return _state[k];\r\n }\r\n\r\n \/\/get the name of an SDL virtual key symbol\r\n std::string getKeyName(Key k);\r\n\r\n \/\/get the current key modifier state\r\n bool isModDown (Modifier m = None);\r\n \/\/set the current key modifier state\r\n void setModDown(Modifier m = None);\r\n\r\n\r\n \/\/ Unicode keyboard translation\r\n bool enableUNICODE(void);\r\n bool disableUNICODE(void);\r\n bool isUNICODEEnabled(void);\r\n\r\n \/\/Params Key repeat\r\n bool enableKeyRepeat (int delay = SDL_DEFAULT_REPEAT_DELAY,\r\n int interval = SDL_DEFAULT_REPEAT_INTERVAL);\r\n\r\n\r\n \/\/Callbacks on SDL_KEYUP or SDL_KEYDOWN\r\n virtual bool handleKeyEvent (const Sym &s, bool pressed) = 0;\r\n inline bool handleKeyPressEvent (const Sym &s)\r\n {\r\n return handleKeyEvent (s, true);\r\n }\r\n inline bool handleKeyReleaseEvent (const Sym &s)\r\n {\r\n return handleKeyEvent (s, false);\r\n }\r\n\r\n };\r\n\r\n \/\/\/This class is not suitable for Gaming Input (doesnt detect key releases). Use Keyboard instead.\r\n \/\/\/However this class is well adapted for accurate text typing, with unicode enabled.\r\n class TextInput : public Keyboard\r\n {\r\n public:\r\n TextInput();\r\n virtual ~TextInput();\r\n\r\n static char Unicode2Char (long unsigned int unicode)\r\n {\r\n return char(unicode & 0x7F);\r\n }\r\n\r\n \/\/Callbacks on SDL_KEYUP or SDL_KEYDOWN\r\n virtual bool handleKeyEvent (const Sym &s, bool pressed);\r\n\r\n };\r\n }\r\n}\r\n\r\n#endif\r\n<commit_msg>Add new keyboard definition<commit_after>#ifndef SDL_KEYBOARD_HH\r\n#define SDL_KEYBOARD_HH\r\n\r\n#include \"SDLConfig.hh\"\r\n\r\nnamespace RAGE\r\n{\r\n namespace SDL\r\n {\r\n\r\n class EventManager;\r\n\r\n \/\/\/This class is not suitable for Full Text Input. Use TextInput instead.\r\n \/\/\/However this class is well adapted to key press \/ release detection, for gaming purpose...\r\n class Keyboard\r\n {\r\n\r\n \/\/State of the Keyboard, updated only on demand by getKeyState\r\n std::vector<bool> _state;\r\n\r\n friend class EventManager;\r\n protected:\r\n bool _quitRequested;\r\n\r\n public:\r\n\r\n typedef enum\r\n {\r\n None=KMOD_NONE,\r\n LShift=KMOD_LSHIFT, RShift=KMOD_RSHIFT,\r\n LCtrl = KMOD_LCTRL, RCtrl = KMOD_RCTRL,\r\n LAlt = KMOD_LALT, RAlt = KMOD_RALT,\r\n LMeta =KMOD_LMETA, RMeta = KMOD_RMETA,\r\n Num = KMOD_NUM,\r\n Caps = KMOD_CAPS,\r\n Mode = KMOD_MODE,\r\n Ctrl = KMOD_CTRL,\r\n Shift = KMOD_SHIFT,\r\n Alt = KMOD_ALT,\r\n Meta = KMOD_META\r\n }\r\n Modifier;\r\n\r\n \/\/TO BE CONTINUED\r\n typedef enum\r\n {\r\n KBackspace = SDLK_BACKSPACE,\r\n KTab = SDLK_TAB,\r\n KClear = SDLK_CLEAR,\r\n KReturn = SDLK_RETURN,\r\n KPause = SDLK_PAUSE,\r\n KEscape = SDLK_ESCAPE,\r\n KSpace = SDLK_SPACE,\r\n KExclaim = SDLK_EXCLAIM,\r\n KQuotedbl = SDLK_QUOTEDBL,\r\n KHash = SDLK_HASH,\r\n KDollar = SDLK_DOLLAR,\r\n KAmpersand = SDLK_AMPERSAND,\r\n KQuote = SDLK_QUOTE,\r\n KLeftparen = SDLK_LEFTPAREN,\r\n KRightparen = SDLK_RIGHTPAREN,\r\n KAsterisk = SDLK_ASTERISK,\r\n KPlus = SDLK_PLUS,\r\n KComma = SDLK_COMMA,\r\n KMinus = SDLK_MINUS,\r\n KPeriod = SDLK_PERIOD,\r\n KSlash = SDLK_SLASH,\r\n K0 = SDLK_0,\r\n K1 = SDLK_1,\r\n K2 = SDLK_2,\r\n K3 = SDLK_3,\r\n K4 = SDLK_4,\r\n K5 = SDLK_5,\r\n K6 = SDLK_6,\r\n K7 = SDLK_7,\r\n K8 = SDLK_8,\r\n K9 = SDLK_9,\r\n KColon, KSemicolon, KLess, KEquals, KGreater, KQuestion, KAt, KLeftbracket, KBackslash, KRightbracket, KCaret, KUnderscore, KBackquote, KA, KB, KC, KD, KE, KF, KG, KH, KI, KJ, KK, KL, KM, KN, KO, KP , KQ, KR, KS, KT, KU, KV, KW, KX, KY, KZ, KDelete,\r\n KWorld0,KWorld1,KWorld2,KWorld3, KWorld4, KWorld5, KWorld6, KWorld7, KWorld8, KWorld9,\r\n KWorld10,KWorld11,KWorld12,KWorld13, KWorld14, KWorld15, KWorld16, KWorld17, KWorld18, KWorld19,\r\n KWorld20,KWorld21,KWorld22,KWorld23, KWorld24, KWorld25, KWorld26, KWorld27, KWorld28, KWorld29,\r\n KWorld30,KWorld31,KWorld32,KWorld33, KWorld34, KWorld35, KWorld36, KWorld37, KWorld38, KWorld39,\r\n KWorld40,KWorld41,KWorld42,KWorld43, KWorld44, KWorld45, KWorld46, KWorld47, KWorld48, KWorld49,\r\n KWorld50,KWorld51,KWorld52,KWorld53, KWorld54, KWorld55, KWorld56, KWorld57, KWorld58, KWorld59,\r\n KWorld60,KWorld61,KWorld62,KWorld63, KWorld64, KWorld65, KWorld66, KWorld67, KWorld68, KWorld69,\r\n KWorld70,KWorld71,KWorld72,KWorld73, KWorld74, KWorld75, KWorld76, KWorld77, KWorld78, KWorld79,\r\n KWorld80,KWorld81,KWorld82,KWorld83, KWorld84, KWorld85, KWorld86, KWorld87, KWorld88, KWorld89,\r\n KWorld90,KWorld91,KWorld92,KWorld93, KWorld94, KWorld95,\r\n KKp0 = SDLK_KP0,\r\n\t\t\t\tKKp1 = SDLK_KP1,\r\n\t\t\t\tKKp2 = SDLK_KP2,\r\n\t\t\t\tKKp3 = SDLK_KP3,\r\n\t\t\t\tKKp4 = SDLK_KP4,\r\n\t\t\t\tKKp5 = SDLK_KP5,\r\n\t\t\t\tKKp6 = SDLK_KP6,\r\n\t\t\t\tKKp7 = SDLK_KP7,\r\n\t\t\t\tKKp8 = SDLK_KP8,\r\n\t\t\t\tKKp9 = SDLK_KP9,\r\n KKDivide = SDLK_KP_DIVIDE,\r\n\t\t\t\tKKMultiply = SDLK_KP_MULTIPLY,\r\n\t\t\t\tKKEnter = SDLK_KP_ENTER,\r\n KUp = SDLK_UP,\r\n KDown = SDLK_DOWN,\r\n KRight = SDLK_RIGHT,\r\n KLeft = SDLK_LEFT,\r\n KInsert, KHome, KEnd, KPageup, KPagedown,\r\n\t\t\t\tKF1 = SDLK_F1,\r\n\t\t\t\tKF2 = SDLK_F2,\r\n\t\t\t\tKF3 = SDLK_F3,\r\n\t\t\t\tKF4 = SDLK_F4,\r\n\t\t\t\tKF5 = SDLK_F5,\r\n\t\t\t\tKF6 = SDLK_F6,\r\n\t\t\t\tKF7 = SDLK_F7,\r\n\t\t\t\tKF8 = SDLK_F8,\r\n\t\t\t\tKF9 = SDLK_F9,\r\n\t\t\t\tKF10 = SDLK_F10,\r\n\t\t\t\tKF11 = SDLK_F11,\r\n\t\t\t\tKF12 = SDLK_F12,\r\n\t\t\t\tKF13 = SDLK_F13,\r\n\t\t\t\tKF14 = SDLK_F14,\r\n\t\t\t\tKF15 = SDLK_F15,\r\n KNumlock, KCapslock, KScrollock,\r\n\t\t\t\tKRShift = SDLK_RSHIFT,\r\n\t\t\t\tKLshift = SDLK_LSHIFT,\r\n\t\t\t\tKLctrl = SDLK_LCTRL,\r\n\t\t\t\tKRctrl = SDLK_RCTRL,\r\n\t\t\t\tKRalt = SDLK_RALT,\r\n\t\t\t\tKLalt = SDLK_LALT,\r\n\t\t\t\tKRmeta, KLmeta, KRsuper, KLsuper, KMode, KCompose, KHelp, KPrintscreen, KSysreq, KBreak, KMenu, KPower, KEuro, KUndo\r\n }\r\n Key;\r\n\r\n class Sym\r\n {\r\n Key _key;\r\n Modifier _mod;\r\n long unsigned int _unicode;\r\n\r\n \/\/the only class allowed to create Sym object from SDL_keysym\r\n friend class CriticalEvent;\r\n friend class Event;\r\n\r\n Sym(const SDL_keysym & ksym) : _key(static_cast<Key>(ksym.sym)), _mod(static_cast<Modifier>(ksym.mod)), _unicode(ksym.unicode)\r\n {}\r\n\r\n public :\r\n\r\n inline Key getKey() const\r\n {\r\n return _key;\r\n }\r\n inline Modifier getMod() const\r\n {\r\n return _mod;\r\n }\r\n\t\t\t\t\/\/WARNING Will return 0 if unicode not enabled\r\n inline long unsigned int getUnicode() const\r\n {\r\n return _unicode;\r\n }\r\n\t\t\t\t\/\/just to convert the unicode value\r\n\t\t\t\tinline char getChar() const\r\n\t\t\t\t{\r\n\t\t\t\t\treturn(static_cast<char>(_unicode & 0x7F));\r\n\t\t\t\t}\r\n\r\n inline bool isUnicode() const\r\n {\r\n return (_unicode & 0xff80) == 0 ;\r\n }\r\n };\r\n\r\n\r\n\r\n \/\/initialises state at size 255 because of the ASCII table size.\r\n Keyboard() : _state(255,false), _quitRequested(false)\r\n {}\r\n virtual ~Keyboard()\r\n {}\r\n\r\n \/\/Get a snapshot of the current keyboard state\r\n \/\/\/return a vector indexed by Key\r\n const std::vector<bool> & updateKeyState (void);\r\n \/\/return true if key down.\r\n bool getKeyState(Key k )\r\n {\r\n updateKeyState();\r\n return _state[k];\r\n }\r\n\r\n \/\/get the name of an SDL virtual key symbol\r\n std::string getKeyName(Key k);\r\n\r\n \/\/get the current key modifier state\r\n bool isModDown (Modifier m = None);\r\n \/\/set the current key modifier state\r\n void setModDown(Modifier m = None);\r\n\r\n\r\n \/\/ Unicode keyboard translation\r\n bool enableUNICODE(void);\r\n bool disableUNICODE(void);\r\n bool isUNICODEEnabled(void);\r\n\r\n \/\/Params Key repeat\r\n bool enableKeyRepeat (int delay = SDL_DEFAULT_REPEAT_DELAY,\r\n int interval = SDL_DEFAULT_REPEAT_INTERVAL);\r\n\r\n\r\n \/\/Callbacks on SDL_KEYUP or SDL_KEYDOWN\r\n virtual bool handleKeyEvent (const Sym &s, bool pressed) = 0;\r\n inline bool handleKeyPressEvent (const Sym &s)\r\n {\r\n return handleKeyEvent (s, true);\r\n }\r\n inline bool handleKeyReleaseEvent (const Sym &s)\r\n {\r\n return handleKeyEvent (s, false);\r\n }\r\n\r\n };\r\n\r\n \/\/\/This class is not suitable for Gaming Input (doesnt detect key releases). Use Keyboard instead.\r\n \/\/\/However this class is well adapted for accurate text typing, with unicode enabled.\r\n class TextInput : public Keyboard\r\n {\r\n public:\r\n TextInput();\r\n virtual ~TextInput();\r\n\r\n static char Unicode2Char (long unsigned int unicode)\r\n {\r\n return char(unicode & 0x7F);\r\n }\r\n\r\n \/\/Callbacks on SDL_KEYUP or SDL_KEYDOWN\r\n virtual bool handleKeyEvent (const Sym &s, bool pressed);\r\n\r\n };\r\n }\r\n}\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Revert \"Remove redundant include bringing an rtti module.\"<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * @file eigenvalue_ratio_constraint.hpp\n * @author Ryan Curtin\n *\n * Constrain a covariance matrix to have a certain ratio of eigenvalues.\n *\/\n#ifndef __MLPACK_METHODS_GMM_EIGENVALUE_RATIO_CONSTRAINT_HPP\n#define __MLPACK_METHODS_GMM_EIGENVALUE_RATIO_CONSTRAINT_HPP\n\n#include <mlpack\/core.hpp>\n\nnamespace mlpack {\nnamespace gmm {\n\n\/**\n * Given a vector of eigenvalue ratios, ensure that the covariance matrix always\n * has those eigenvalue ratios. When you create this object, make sure that the\n * vector of ratios that you pass does not go out of scope, because this object\n * holds a reference to that vector instead of copying it. (This doesn't apply\n * if you are deserializing the object from a file.)\n *\/\nclass EigenvalueRatioConstraint\n{\n public:\n \/**\n * Create the EigenvalueRatioConstraint object with the given vector of\n * eigenvalue ratios. These ratios are with respect to the first eigenvalue,\n * which is the largest eigenvalue, so the first element of the vector should\n * be 1. In addition, all other elements should be less than or equal to 1.\n *\/\n EigenvalueRatioConstraint(const arma::vec& ratios) :\n ratios(ratios.memptr(), ratios.n_rows, ratios.n_cols, false) \/\/ Alias.\n {\n \/\/ Check validity of ratios.\n if (std::abs(ratios[0] - 1.0) > 1e-20)\n Log::Fatal << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"first element of ratio vector is not 1.0!\" << std::endl;\n\n for (size_t i = 1; i < ratios.n_elem; ++i)\n {\n if (ratios[i] > 1.0)\n Log::Fatal << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"element \" << i << \" of ratio vector is greater than 1.0!\"\n << std::endl;\n if (ratios[i] < 0.0)\n Log::Warn << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"element \" << i << \" of ratio vectors is negative and will \"\n << \"probably cause the covariance to be non-invertible...\"\n << std::endl;\n }\n }\n\n \/**\n * Apply the eigenvalue ratio constraint to the given covariance matrix.\n *\/\n void ApplyConstraint(arma::mat& covariance) const\n {\n \/\/ Eigendecompose the matrix.\n arma::vec eigenvalues;\n arma::mat eigenvectors;\n arma::eig_sym(eigenvalues, eigenvectors, covariance);\n\n \/\/ Change the eigenvalues to what we are forcing them to be. There\n \/\/ shouldn't be any negative eigenvalues anyway, so it doesn't matter if we\n \/\/ are suddenly forcing them to be positive. If the first eigenvalue is\n \/\/ negative, well, there are going to be some problems later...\n eigenvalues = (eigenvalues[0] * ratios);\n\n \/\/ Reassemble the matrix.\n covariance = eigenvectors * arma::diagmat(eigenvalues) * eigenvectors.t();\n }\n\n \/\/! Serialize the constraint.\n template<typename Archive>\n void Serialize(Archive& ar, const unsigned int \/* version *\/)\n {\n ar & data::CreateNVP(ratios, \"ratios\");\n }\n\n private:\n \/\/! Ratios for eigenvalues.\n const arma::vec ratios;\n};\n\n}; \/\/ namespace gmm\n}; \/\/ namespace mlpack\n\n#endif\n<commit_msg>Alias properly.<commit_after>\/**\n * @file eigenvalue_ratio_constraint.hpp\n * @author Ryan Curtin\n *\n * Constrain a covariance matrix to have a certain ratio of eigenvalues.\n *\/\n#ifndef __MLPACK_METHODS_GMM_EIGENVALUE_RATIO_CONSTRAINT_HPP\n#define __MLPACK_METHODS_GMM_EIGENVALUE_RATIO_CONSTRAINT_HPP\n\n#include <mlpack\/core.hpp>\n\nnamespace mlpack {\nnamespace gmm {\n\n\/**\n * Given a vector of eigenvalue ratios, ensure that the covariance matrix always\n * has those eigenvalue ratios. When you create this object, make sure that the\n * vector of ratios that you pass does not go out of scope, because this object\n * holds a reference to that vector instead of copying it. (This doesn't apply\n * if you are deserializing the object from a file.)\n *\/\nclass EigenvalueRatioConstraint\n{\n public:\n \/**\n * Create the EigenvalueRatioConstraint object with the given vector of\n * eigenvalue ratios. These ratios are with respect to the first eigenvalue,\n * which is the largest eigenvalue, so the first element of the vector should\n * be 1. In addition, all other elements should be less than or equal to 1.\n *\/\n EigenvalueRatioConstraint(const arma::vec& ratios) :\n \/\/ Make an alias of the ratios vector. It will never be modified here.\n ratios(const_cast<double*>(ratios.memptr()), ratios.n_elem, false)\n {\n \/\/ Check validity of ratios.\n if (std::abs(ratios[0] - 1.0) > 1e-20)\n Log::Fatal << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"first element of ratio vector is not 1.0!\" << std::endl;\n\n for (size_t i = 1; i < ratios.n_elem; ++i)\n {\n if (ratios[i] > 1.0)\n Log::Fatal << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"element \" << i << \" of ratio vector is greater than 1.0!\"\n << std::endl;\n if (ratios[i] < 0.0)\n Log::Warn << \"EigenvalueRatioConstraint::EigenvalueRatioConstraint(): \"\n << \"element \" << i << \" of ratio vectors is negative and will \"\n << \"probably cause the covariance to be non-invertible...\"\n << std::endl;\n }\n }\n\n \/**\n * Apply the eigenvalue ratio constraint to the given covariance matrix.\n *\/\n void ApplyConstraint(arma::mat& covariance) const\n {\n \/\/ Eigendecompose the matrix.\n arma::vec eigenvalues;\n arma::mat eigenvectors;\n arma::eig_sym(eigenvalues, eigenvectors, covariance);\n\n \/\/ Change the eigenvalues to what we are forcing them to be. There\n \/\/ shouldn't be any negative eigenvalues anyway, so it doesn't matter if we\n \/\/ are suddenly forcing them to be positive. If the first eigenvalue is\n \/\/ negative, well, there are going to be some problems later...\n eigenvalues = (eigenvalues[0] * ratios);\n\n \/\/ Reassemble the matrix.\n covariance = eigenvectors * arma::diagmat(eigenvalues) * eigenvectors.t();\n }\n\n \/\/! Serialize the constraint.\n template<typename Archive>\n void Serialize(Archive& ar, const unsigned int \/* version *\/)\n {\n \/\/ Strip the const for the sake of loading\/saving. This is the only time it\n \/\/ is modified (other than the constructor).\n ar & data::CreateNVP(const_cast<arma::vec&>(ratios), \"ratios\");\n }\n\n private:\n \/\/! Ratios for eigenvalues.\n const arma::vec ratios;\n};\n\n}; \/\/ namespace gmm\n}; \/\/ namespace mlpack\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <arpa\/inet.h>\n#include <netdb.h>\n#include <stdio.h>\n\n#include \"udt.h\"\n#include \"com_udt_udt.h\"\n#include <android\/log.h>\n\n#include <string>\n\nnamespace {\n\n std::string to_string(int value) \n {\n char buffer[100] = {0};\n sprintf(buffer, \"%d\", value);\n\n return std::string(buffer);\n }\n}\n\nconst char TAG[] = \"UDT-JNI\";\n\njint JNICALL Java_com_udt_udt_startup(JNIEnv *, jobject)\n{\n return UDT::startup();\n}\n\njint JNICALL Java_com_udt_udt_cleanup(JNIEnv *, jobject)\n{\n return UDT::cleanup();\n}\n\njint JNICALL Java_com_udt_udt_socket(JNIEnv *, jobject)\n{\n struct addrinfo hints, *local;\n\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_flags = AI_PASSIVE;\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n int result = 0;\n if ((result = getaddrinfo(NULL, \"9000\", &hints, &local)) != 0)\n {\n std::string error = \"incorrect network address\" + to_string(result);\n __android_log_write(ANDROID_LOG_ERROR, TAG, error.c_str());\n return 0;\n }\n\n int handle = UDT::socket(local->ai_family, local->ai_socktype, local->ai_protocol);\n freeaddrinfo(local);\n\n return handle;\n}\n\njint JNICALL Java_com_udt_udt_connect(JNIEnv* env, jobject thiz, jint handle, jstring ip, jint port)\n{\n const char *ip_address = env->GetStringUTFChars(ip, NULL);\n\n struct addrinfo hints, *peer;\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_flags = AI_PASSIVE;\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n std::string port_str = to_string(port);\n if (0 != getaddrinfo(ip_address, port_str.c_str(), &hints, &peer))\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"incorrect server\/peer address. \");\n return 0;\n }\n\n \/\/ connect to the server, implict bind\n int connect_result = 0;\n if ((connect_result = UDT::connect(handle, peer->ai_addr, peer->ai_addrlen)) == UDT::ERROR)\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"connect error\");\n return 0;\n }\n\n freeaddrinfo(peer);\n return connect_result;\n}\n\njint JNICALL Java_com_udt_udt_close(JNIEnv *env, jobject thiz, jint handle)\n{\n return UDT::close(handle);\n}\n\njint JNICALL Java_com_udt_udt_send(JNIEnv *env, jobject thiz, jint handle, jbyteArray data, jint flag)\n{\n jsize size = env->GetArrayLength(data);\n jbyte* data_ptr = env->GetByteArrayElements(data, NULL);\n\n int result = UDT::send(handle, (const char*)data_ptr, size, flag);\n if (result == UDT::ERROR)\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"send data fail!\");\n }\n\n env->ReleaseByteArrayElements(data, data_ptr, JNI_ABORT);\n\n return result;\n}\n\njbyteArray JNICALL Java_com_udt_udt_recv(JNIEnv *env, jobject thiz, jint handle, jint size, jint flags)\n{\n char *buffer = new buffer[size];\n int recv_size = UDT::recv(handle, buffer, size, flags);\n\n if (recv_size == UDT::ERROR)\n {\n recv_size = 0;\n }\n\n jbyteArray recv_buffer = env->NewByteArray(recv_size);\n\n jbyte* recv_buffer_ptr = env->GetByteArrayElements(recv_buffer, NULL);\n memcpy(recv_buffer_ptr, buffer, recv_size);\n env->ReleaseByteArrayElements(recv_buffer, recv_buffer_ptr, JNI_COMMIT);\n\n return recv_buffer;\n}\n<commit_msg>fix typo<commit_after>#include <arpa\/inet.h>\n#include <netdb.h>\n#include <stdio.h>\n\n#include \"udt.h\"\n#include \"com_udt_udt.h\"\n#include <android\/log.h>\n\n#include <string>\n\nnamespace {\n\n std::string to_string(int value) \n {\n char buffer[100] = {0};\n sprintf(buffer, \"%d\", value);\n\n return std::string(buffer);\n }\n}\n\nconst char TAG[] = \"UDT-JNI\";\n\njint JNICALL Java_com_udt_udt_startup(JNIEnv *, jobject)\n{\n return UDT::startup();\n}\n\njint JNICALL Java_com_udt_udt_cleanup(JNIEnv *, jobject)\n{\n return UDT::cleanup();\n}\n\njint JNICALL Java_com_udt_udt_socket(JNIEnv *, jobject)\n{\n struct addrinfo hints, *local;\n\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_flags = AI_PASSIVE;\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n int result = 0;\n if ((result = getaddrinfo(NULL, \"9000\", &hints, &local)) != 0)\n {\n std::string error = \"incorrect network address\" + to_string(result);\n __android_log_write(ANDROID_LOG_ERROR, TAG, error.c_str());\n return 0;\n }\n\n int handle = UDT::socket(local->ai_family, local->ai_socktype, local->ai_protocol);\n freeaddrinfo(local);\n\n return handle;\n}\n\njint JNICALL Java_com_udt_udt_connect(JNIEnv* env, jobject thiz, jint handle, jstring ip, jint port)\n{\n const char *ip_address = env->GetStringUTFChars(ip, NULL);\n\n struct addrinfo hints, *peer;\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_flags = AI_PASSIVE;\n hints.ai_family = AF_INET;\n hints.ai_socktype = SOCK_STREAM;\n\n std::string port_str = to_string(port);\n if (0 != getaddrinfo(ip_address, port_str.c_str(), &hints, &peer))\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"incorrect server\/peer address. \");\n return 0;\n }\n\n \/\/ connect to the server, implict bind\n int connect_result = 0;\n if ((connect_result = UDT::connect(handle, peer->ai_addr, peer->ai_addrlen)) == UDT::ERROR)\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"connect error\");\n return 0;\n }\n\n freeaddrinfo(peer);\n return connect_result;\n}\n\njint JNICALL Java_com_udt_udt_close(JNIEnv *env, jobject thiz, jint handle)\n{\n return UDT::close(handle);\n}\n\njint JNICALL Java_com_udt_udt_send(JNIEnv *env, jobject thiz, jint handle, jbyteArray data, jint flag)\n{\n jsize size = env->GetArrayLength(data);\n jbyte* data_ptr = env->GetByteArrayElements(data, NULL);\n\n int result = UDT::send(handle, (const char*)data_ptr, size, flag);\n if (result == UDT::ERROR)\n {\n __android_log_write(ANDROID_LOG_ERROR, TAG, \"send data fail!\");\n }\n\n env->ReleaseByteArrayElements(data, data_ptr, JNI_ABORT);\n\n return result;\n}\n\njbyteArray JNICALL Java_com_udt_udt_recv(JNIEnv *env, jobject thiz, jint handle, jint size, jint flags)\n{\n char *buffer = new char[size];\n int recv_size = UDT::recv(handle, buffer, size, flags);\n\n if (recv_size == UDT::ERROR)\n {\n recv_size = 0;\n }\n\n jbyteArray recv_buffer = env->NewByteArray(recv_size);\n\n jbyte* recv_buffer_ptr = env->GetByteArrayElements(recv_buffer, NULL);\n memcpy(recv_buffer_ptr, buffer, recv_size);\n env->ReleaseByteArrayElements(recv_buffer, recv_buffer_ptr, JNI_COMMIT);\n\n return recv_buffer;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright (c) 2014, weizhenwei\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * \n * * Neither the name of the {organization} nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * File: 76-Minimum_Window_Substring.cpp\n *\n *\n * Brief: https:\/\/oj.leetcode.com\/problems\/minimum-window-substring\/\n * Given a string S and a string T, find the minimum window in S which will\n * contain all the characters in T in complexity O(n).\n *\n * For example,\n * S = \"ADOBECODEBANC\"\n * T = \"ABC\"\n * Minimum window is \"BANC\".\n *\n * Note:\n * If there is no such window in S that covers all characters in T, return the\n * emtpy string \"\".\n *\n * If there are multiple such windows, you are guaranteed that there will always\n * be only one unique minimum window in S.\n *\n *\n * Date: 2014.12.26\n *\n * Author: weizhenwei <weizhenwei1988@gmail.com>\n *\n * *****************************************************************************\n *\/\n\n#include <assert.h>\n#include <limits.h>\n#include <stdio.h>\n#include <string>\n#include <map>\n\nusing std::map;\nusing std::string;\n\nclass Solution_Minimum_Window_Substring {\nprivate:\n static void check_integrity(map<char, int> &charset) {\n for (map<char, int>::iterator iter = charset.begin();\n iter != charset.end(); iter++) {\n assert((*iter).second == 0);\n } \/\/ for\n }\n\npublic:\n string minWindow(string S, string T) {\n if (S.size() == 0 || T.size() == 0) {\n return string(\"\");\n }\n\n map<char, int> charset;\n for (int i = 0; i < T.size(); i++) {\n map<char, int>::iterator iter = charset.find(T[i]);\n if (iter == charset.end()) {\n charset[T[i]] = 1;\n } else {\n (*iter).second += 1;\n }\n } \/\/ for i\n\n \/\/ find the start point;\n int i = 0;\n while (i < S.size()) {\n if (charset.find(S[i]) != charset.end()) {\n break;\n }\n i++;\n }\n if (i == S.size()) {\n return string(\"\");\n }\n\n map<char, int> workingSet;\n workingSet[S[i]] = 1;\n\n int start = i;\n int end = start + 1;\n int total = T.size();\n int minlength = INT_MAX;\n string result = string(\"\");\n while (end < S.size()) {\n map<char, int>::iterator iter = charset.find(S[end]);\n if (iter == charset.end()) {\n end++;\n continue;\n } else {\n char target = (*iter).first;\n int num = charset[target];\n int current = workingSet[target];\n workingSet[target]++;\n if (current < num) {\n if (--total == 0) {\n string candidate = string(S.begin() + start,\n S.begin() + end);\n if (candidate.size() < minlength) {\n result = candidate;\n minlength = candidate.size();\n }\n\n int j = start + 1;\n while (j < S.size()) {\n map<char, int>::iterator iter = charset.find(S[j]);\n if (iter != charset.end()) {\n char target = (*iter).first;\n int num = charset[target];\n int current = workingSet[target];\n if (current <= num) {\n break;\n } else {\n workingSet[target]--;\n }\n }\n j++;\n }\n if (j == S.size()) {\n return result;\n }\n end = start + 1;\n\n } else {\n end++;\n }\n } else {\n end++;\n }\n }\n }\n\n return result;\n }\n};\n\nint main(int argc, char *argv[]) {\n Solution_Minimum_Window_Substring solution;\n string S = \"ADOBECODEBANC\";\n string T = \"ABC\";\n string result = solution.minWindow(S, T);\n printf(\"%s\\n\", result.c_str());\n\n return 0;\n}\n\n<commit_msg>workig on 76-Minimum_Window_Substring.cpp, not accepted<commit_after>\/*\n *\n * Copyright (c) 2014, weizhenwei\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * \n * * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * \n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * \n * * Neither the name of the {organization} nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * File: 76-Minimum_Window_Substring.cpp\n *\n *\n * Brief: https:\/\/oj.leetcode.com\/problems\/minimum-window-substring\/\n * Given a string S and a string T, find the minimum window in S which will\n * contain all the characters in T in complexity O(n).\n *\n * For example,\n * S = \"ADOBECODEBANC\"\n * T = \"ABC\"\n * Minimum window is \"BANC\".\n *\n * Note:\n * If there is no such window in S that covers all characters in T, return the\n * emtpy string \"\".\n *\n * If there are multiple such windows, you are guaranteed that there will always\n * be only one unique minimum window in S.\n *\n *\n * Date: 2014.12.26\n *\n * Author: weizhenwei <weizhenwei1988@gmail.com>\n *\n * *****************************************************************************\n *\/\n\n#include <assert.h>\n#include <limits.h>\n#include <stdio.h>\n#include <string>\n#include <map>\n\nusing std::map;\nusing std::string;\n\nclass Solution_Minimum_Window_Substring {\nprivate:\n static void check_integrity(map<char, int> &charset) {\n for (map<char, int>::iterator iter = charset.begin();\n iter != charset.end(); iter++) {\n assert((*iter).second == 0);\n } \/\/ for\n }\n\npublic:\n string minWindow(string S, string T) {\n if (S.size() == 0 || T.size() == 0) {\n return string(\"\");\n }\n\n map<char, int> charset;\n for (int i = 0; i < T.size(); i++) {\n map<char, int>::iterator iter = charset.find(T[i]);\n if (iter == charset.end()) {\n charset[T[i]] = 1;\n } else {\n (*iter).second += 1;\n }\n } \/\/ for i\n\n \/\/ find the start point;\n int i = 0;\n while (i < S.size()) {\n if (charset.find(S[i]) != charset.end()) {\n break;\n }\n i++;\n }\n if (i == S.size()) {\n return string(\"\");\n }\n\n map<char, int> workingSet;\n workingSet[S[i]] = 1;\n\n int start = i;\n int end = start + 1;\n int total = T.size() - 1; \/\/ already have one at S[start];\n if (total == 0) {\n return string(end - start, S[start]);\n }\n int minlength = INT_MAX;\n string result = string(\"\");\n while (end < S.size()) {\n map<char, int>::iterator iter = charset.find(S[end]);\n if (iter == charset.end()) {\n end++;\n continue;\n } else {\n char target = (*iter).first;\n int num = charset[target];\n int current = workingSet[target];\n if (current < num) {\n workingSet[target]++;\n if (--total == 0) {\n string candidate = string(S.begin() + start,\n S.begin() + end + 1);\n if (candidate.size() < minlength) {\n result = candidate;\n minlength = candidate.size();\n }\n \n \/\/ remove the first element;\n char first = S[start];\n workingSet[first]--;\n total++;\n\n \/\/ moving start forward;\n int j = start + 1;\n while (j < S.size()) { \/\/ first next start position;\n map<char, int>::iterator iter = charset.find(S[j]);\n if (iter != charset.end()) {\n char target = (*iter).first;\n int num = charset[target];\n int current = workingSet[target];\n if (current <= num) {\n break;\n } else {\n workingSet[target]--;\n }\n }\n j++;\n }\n if (j == S.size()) {\n return result;\n }\n start = j;\n end++;\n\n } else {\n end++;\n }\n } else {\n assert(current == num);\n int k = start;\n while (k < end) {\n if (S[k] == target) {\n break;\n }\n k++;\n }\n if (k > start) {\n char sStart = S[start];\n if (sStart != target) {\n workingSet[sStart]--;\n total++;\n }\n }\n start = k + 1;\n\n int j = start;\n while (j <= end) {\n map<char, int>::iterator iter = charset.find(S[j]);\n if (iter != charset.end()) {\n break;\n }\n j++;\n }\n if (j == S.size()) {\n return result;\n }\n start = j;\n end++;\n }\n }\n }\n\n return result;\n }\n};\n\nint main(int argc, char *argv[]) {\n Solution_Minimum_Window_Substring solution;\n string S = \"ADOBECODEBANC\";\n string T = \"ABC\";\n string result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n S = \"caae\";\n T = \"cae\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n S = \"acbbaca\";\n T = \"aba\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n S = \"ADOBECODEBANC\";\n T = \"ABCC\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n T = \"ABX\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n T = \"AB\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n S = \"A\";\n T = \"A\";\n result = solution.minWindow(S, T);\n printf(\"S:%s\\n\", S.c_str());\n printf(\"T:%s\\n\", T.c_str());\n printf(\"%s\\n\", result.c_str());\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix void return<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/proxy\/ppb_surface_3d_proxy.h\"\n\n#include \"gpu\/command_buffer\/client\/gles2_implementation.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/dev\/ppb_surface_3d_dev.h\"\n#include \"ppapi\/proxy\/plugin_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_resource.h\"\n#include \"ppapi\/proxy\/ppapi_messages.h\"\n#include \"ppapi\/proxy\/ppb_context_3d_proxy.h\"\n\nnamespace pp {\nnamespace proxy {\n\nSurface3D::~Surface3D() {\n if (context_)\n context_->BindSurfaces(NULL, NULL);\n}\n\nnamespace {\n\nPP_Resource Create(PP_Instance instance,\n PP_Config3D_Dev config,\n const int32_t* attrib_list) {\n PluginDispatcher* dispatcher = PluginDispatcher::GetForInstance(instance);\n if (!dispatcher)\n return PP_ERROR_BADARGUMENT;\n\n std::vector<int32_t> attribs;\n if (attrib_list) {\n for (const int32_t* attr = attrib_list; attr; ++attr)\n attribs.push_back(*attr);\n } else {\n attribs.push_back(0);\n }\n\n HostResource result;\n dispatcher->Send(new PpapiHostMsg_PPBSurface3D_Create(\n INTERFACE_ID_PPB_SURFACE_3D, instance, config, attribs, &result));\n\n if (result.is_null())\n return 0;\n linked_ptr<Surface3D> surface_3d(new Surface3D(result));\n PP_Resource resource =\n PluginResourceTracker::GetInstance()->AddResource(surface_3d);\n surface_3d->set_resource(resource);\n return resource;\n}\n\nPP_Bool IsSurface3D(PP_Resource resource) {\n Surface3D* object = PluginResource::GetAs<Surface3D>(resource);\n return BoolToPPBool(!!object);\n}\n\nint32_t SetAttrib(PP_Resource surface_id,\n int32_t attribute,\n int32_t value) {\n \/\/ TODO(alokp): Implement me.\n return 0;\n}\n\nint32_t GetAttrib(PP_Resource surface_id,\n int32_t attribute,\n int32_t* value) {\n \/\/ TODO(alokp): Implement me.\n return 0;\n}\n\nint32_t SwapBuffers(PP_Resource surface_id,\n PP_CompletionCallback callback) {\n Surface3D* object = PluginResource::GetAs<Surface3D>(surface_id);\n if (!object)\n return PP_ERROR_BADRESOURCE;\n PluginDispatcher* dispatcher = PluginDispatcher::GetForInstance(\n object->instance());\n if (!dispatcher)\n return PP_ERROR_FAILED;\n\n \/\/ For now, disallow blocking calls. We'll need to add support for other\n \/\/ threads to this later.\n if (!callback.func)\n return PP_ERROR_BADARGUMENT;\n\n if (object->is_flush_pending())\n return PP_ERROR_INPROGRESS; \/\/ Can't have >1 flush pending.\n\n if (!object->context())\n return PP_ERROR_FAILED;\n\n object->set_current_flush_callback(callback);\n\n IPC::Message* msg = new PpapiHostMsg_PPBSurface3D_SwapBuffers(\n INTERFACE_ID_PPB_SURFACE_3D, object->host_resource());\n msg->set_unblock(true);\n dispatcher->Send(msg);\n\n object->context()->gles2_impl()->SwapBuffers();\n\n return PP_OK_COMPLETIONPENDING;\n}\n\nconst PPB_Surface3D_Dev surface_3d_interface = {\n &Create,\n &IsSurface3D,\n &SetAttrib,\n &GetAttrib,\n &SwapBuffers\n};\n\nInterfaceProxy* CreateSurface3DProxy(Dispatcher* dispatcher,\n const void* target_interface) {\n return new PPB_Surface3D_Proxy(dispatcher, target_interface);\n}\n\n} \/\/ namespace\n\nPPB_Surface3D_Proxy::PPB_Surface3D_Proxy(Dispatcher* dispatcher,\n const void* target_interface)\n : InterfaceProxy(dispatcher, target_interface),\n callback_factory_(ALLOW_THIS_IN_INITIALIZER_LIST(this)) {\n}\n\nPPB_Surface3D_Proxy::~PPB_Surface3D_Proxy() {\n}\n\n\/\/ static\nconst InterfaceProxy::Info* PPB_Surface3D_Proxy::GetInfo() {\n static const Info info = {\n &surface_3d_interface,\n PPB_SURFACE_3D_DEV_INTERFACE,\n INTERFACE_ID_PPB_SURFACE_3D,\n false,\n &CreateSurface3DProxy,\n };\n return &info;\n}\n\nbool PPB_Surface3D_Proxy::OnMessageReceived(const IPC::Message& msg) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(PPB_Surface3D_Proxy, msg)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBSurface3D_Create,\n OnMsgCreate)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBSurface3D_SwapBuffers,\n OnMsgSwapBuffers)\n\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBSurface3D_SwapBuffersACK,\n OnMsgSwapBuffersACK)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n \/\/ FIXME(brettw) handle bad messages!\n return handled;\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgCreate(PP_Instance instance,\n PP_Config3D_Dev config,\n std::vector<int32_t> attribs,\n HostResource* result) {\n DCHECK(attribs.back() == 0);\n PP_Resource resource =\n ppb_surface_3d_target()->Create(instance, config, &attribs.front());\n result->SetHostResource(instance, resource);\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgSwapBuffers(const HostResource& surface_3d) {\n CompletionCallback callback = callback_factory_.NewCallback(\n &PPB_Surface3D_Proxy::SendSwapBuffersACKToPlugin, surface_3d);\n int32_t result = ppb_surface_3d_target()->SwapBuffers(\n surface_3d.host_resource(), callback.pp_completion_callback());\n if (result != PP_OK_COMPLETIONPENDING) {\n \/\/ There was some error, so we won't get a flush callback. We need to now\n \/\/ issue the ACK to the plugin hears about the error. This will also clean\n \/\/ up the data associated with the callback.\n callback.Run(result);\n }\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgSwapBuffersACK(const HostResource& resource,\n int32_t pp_error) {\n PP_Resource plugin_resource =\n PluginResourceTracker::GetInstance()->PluginResourceForHostResource(\n resource);\n if (!plugin_resource)\n return;\n Surface3D* object = PluginResource::GetAs<Surface3D>(plugin_resource);\n if (!object) {\n \/\/ The plugin has released the Surface3D object so don't issue the\n \/\/ callback.\n return;\n }\n\n \/\/ Be careful to make the callback NULL again before issuing the callback\n \/\/ since the plugin might want to flush from within the callback.\n PP_CompletionCallback callback = object->current_flush_callback();\n object->set_current_flush_callback(PP_BlockUntilComplete());\n PP_RunCompletionCallback(&callback, pp_error);\n}\n\nvoid PPB_Surface3D_Proxy::SendSwapBuffersACKToPlugin(\n int32_t result,\n const HostResource& surface_3d) {\n dispatcher()->Send(new PpapiMsg_PPBSurface3D_SwapBuffersACK(\n INTERFACE_ID_PPB_SURFACE_3D, surface_3d, result));\n}\n\n} \/\/ namespace proxy\n} \/\/ namespace pp\n<commit_msg>Fixed handling of a non-NULL attrib_list in PPB_Surface3D Proxy's Create().<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ppapi\/proxy\/ppb_surface_3d_proxy.h\"\n\n#include \"gpu\/command_buffer\/client\/gles2_implementation.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/pp_resource.h\"\n#include \"ppapi\/c\/dev\/ppb_surface_3d_dev.h\"\n#include \"ppapi\/proxy\/plugin_dispatcher.h\"\n#include \"ppapi\/proxy\/plugin_resource.h\"\n#include \"ppapi\/proxy\/ppapi_messages.h\"\n#include \"ppapi\/proxy\/ppb_context_3d_proxy.h\"\n\nnamespace pp {\nnamespace proxy {\n\nSurface3D::~Surface3D() {\n if (context_)\n context_->BindSurfaces(NULL, NULL);\n}\n\nnamespace {\n\nPP_Resource Create(PP_Instance instance,\n PP_Config3D_Dev config,\n const int32_t* attrib_list) {\n PluginDispatcher* dispatcher = PluginDispatcher::GetForInstance(instance);\n if (!dispatcher)\n return PP_ERROR_BADARGUMENT;\n\n std::vector<int32_t> attribs;\n if (attrib_list) {\n const int32_t* attr = attrib_list;\n while(*attr != PP_GRAPHICS3DATTRIB_NONE) {\n attribs.push_back(*(attr++)); \/\/ Attribute.\n attribs.push_back(*(attr++)); \/\/ Value.\n }\n }\n attribs.push_back(PP_GRAPHICS3DATTRIB_NONE); \/\/ Always terminate.\n\n HostResource result;\n dispatcher->Send(new PpapiHostMsg_PPBSurface3D_Create(\n INTERFACE_ID_PPB_SURFACE_3D, instance, config, attribs, &result));\n\n if (result.is_null())\n return 0;\n linked_ptr<Surface3D> surface_3d(new Surface3D(result));\n PP_Resource resource =\n PluginResourceTracker::GetInstance()->AddResource(surface_3d);\n surface_3d->set_resource(resource);\n return resource;\n}\n\nPP_Bool IsSurface3D(PP_Resource resource) {\n Surface3D* object = PluginResource::GetAs<Surface3D>(resource);\n return BoolToPPBool(!!object);\n}\n\nint32_t SetAttrib(PP_Resource surface_id,\n int32_t attribute,\n int32_t value) {\n \/\/ TODO(alokp): Implement me.\n return 0;\n}\n\nint32_t GetAttrib(PP_Resource surface_id,\n int32_t attribute,\n int32_t* value) {\n \/\/ TODO(alokp): Implement me.\n return 0;\n}\n\nint32_t SwapBuffers(PP_Resource surface_id,\n PP_CompletionCallback callback) {\n Surface3D* object = PluginResource::GetAs<Surface3D>(surface_id);\n if (!object)\n return PP_ERROR_BADRESOURCE;\n PluginDispatcher* dispatcher = PluginDispatcher::GetForInstance(\n object->instance());\n if (!dispatcher)\n return PP_ERROR_FAILED;\n\n \/\/ For now, disallow blocking calls. We'll need to add support for other\n \/\/ threads to this later.\n if (!callback.func)\n return PP_ERROR_BADARGUMENT;\n\n if (object->is_flush_pending())\n return PP_ERROR_INPROGRESS; \/\/ Can't have >1 flush pending.\n\n if (!object->context())\n return PP_ERROR_FAILED;\n\n object->set_current_flush_callback(callback);\n\n IPC::Message* msg = new PpapiHostMsg_PPBSurface3D_SwapBuffers(\n INTERFACE_ID_PPB_SURFACE_3D, object->host_resource());\n msg->set_unblock(true);\n dispatcher->Send(msg);\n\n object->context()->gles2_impl()->SwapBuffers();\n\n return PP_OK_COMPLETIONPENDING;\n}\n\nconst PPB_Surface3D_Dev surface_3d_interface = {\n &Create,\n &IsSurface3D,\n &SetAttrib,\n &GetAttrib,\n &SwapBuffers\n};\n\nInterfaceProxy* CreateSurface3DProxy(Dispatcher* dispatcher,\n const void* target_interface) {\n return new PPB_Surface3D_Proxy(dispatcher, target_interface);\n}\n\n} \/\/ namespace\n\nPPB_Surface3D_Proxy::PPB_Surface3D_Proxy(Dispatcher* dispatcher,\n const void* target_interface)\n : InterfaceProxy(dispatcher, target_interface),\n callback_factory_(ALLOW_THIS_IN_INITIALIZER_LIST(this)) {\n}\n\nPPB_Surface3D_Proxy::~PPB_Surface3D_Proxy() {\n}\n\n\/\/ static\nconst InterfaceProxy::Info* PPB_Surface3D_Proxy::GetInfo() {\n static const Info info = {\n &surface_3d_interface,\n PPB_SURFACE_3D_DEV_INTERFACE,\n INTERFACE_ID_PPB_SURFACE_3D,\n false,\n &CreateSurface3DProxy,\n };\n return &info;\n}\n\nbool PPB_Surface3D_Proxy::OnMessageReceived(const IPC::Message& msg) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(PPB_Surface3D_Proxy, msg)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBSurface3D_Create,\n OnMsgCreate)\n IPC_MESSAGE_HANDLER(PpapiHostMsg_PPBSurface3D_SwapBuffers,\n OnMsgSwapBuffers)\n\n IPC_MESSAGE_HANDLER(PpapiMsg_PPBSurface3D_SwapBuffersACK,\n OnMsgSwapBuffersACK)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n \/\/ FIXME(brettw) handle bad messages!\n return handled;\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgCreate(PP_Instance instance,\n PP_Config3D_Dev config,\n std::vector<int32_t> attribs,\n HostResource* result) {\n DCHECK(attribs.size() % 2 == 1);\n DCHECK(attribs.back() == PP_GRAPHICS3DATTRIB_NONE);\n PP_Resource resource =\n ppb_surface_3d_target()->Create(instance, config, &attribs.front());\n result->SetHostResource(instance, resource);\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgSwapBuffers(const HostResource& surface_3d) {\n CompletionCallback callback = callback_factory_.NewCallback(\n &PPB_Surface3D_Proxy::SendSwapBuffersACKToPlugin, surface_3d);\n int32_t result = ppb_surface_3d_target()->SwapBuffers(\n surface_3d.host_resource(), callback.pp_completion_callback());\n if (result != PP_OK_COMPLETIONPENDING) {\n \/\/ There was some error, so we won't get a flush callback. We need to now\n \/\/ issue the ACK to the plugin hears about the error. This will also clean\n \/\/ up the data associated with the callback.\n callback.Run(result);\n }\n}\n\nvoid PPB_Surface3D_Proxy::OnMsgSwapBuffersACK(const HostResource& resource,\n int32_t pp_error) {\n PP_Resource plugin_resource =\n PluginResourceTracker::GetInstance()->PluginResourceForHostResource(\n resource);\n if (!plugin_resource)\n return;\n Surface3D* object = PluginResource::GetAs<Surface3D>(plugin_resource);\n if (!object) {\n \/\/ The plugin has released the Surface3D object so don't issue the\n \/\/ callback.\n return;\n }\n\n \/\/ Be careful to make the callback NULL again before issuing the callback\n \/\/ since the plugin might want to flush from within the callback.\n PP_CompletionCallback callback = object->current_flush_callback();\n object->set_current_flush_callback(PP_BlockUntilComplete());\n PP_RunCompletionCallback(&callback, pp_error);\n}\n\nvoid PPB_Surface3D_Proxy::SendSwapBuffersACKToPlugin(\n int32_t result,\n const HostResource& surface_3d) {\n dispatcher()->Send(new PpapiMsg_PPBSurface3D_SwapBuffersACK(\n INTERFACE_ID_PPB_SURFACE_3D, surface_3d, result));\n}\n\n} \/\/ namespace proxy\n} \/\/ namespace pp\n<|endoftext|>"} {"text":"<commit_before>#include \"ClientWrapper.hpp\"\n\n#include <bts\/net\/upnp.hpp>\n\n#include <QApplication>\n#include <QResource>\n#include <QSettings>\n#include <QJsonDocument>\n#include <QUrl>\n#include <QMessageBox>\n\n#include <iostream>\n\nvoid get_htdocs_file( const fc::path& filename, const fc::http::server::response& r )\n{\n std::cout << filename.generic_string() << \"\\n\";\n QResource file_to_send( (\"\/htdocs\/htdocs\/\" + filename.generic_string()).c_str() );\n if( !file_to_send.data() )\n {\n std::string not_found = \"this is not the file you are looking for: \" + filename.generic_string();\n r.set_status( fc::http::reply::NotFound );\n r.set_length( not_found.size() );\n r.write( not_found.c_str(), not_found.size() );\n return;\n }\n r.set_status( fc::http::reply::OK );\n if( file_to_send.isCompressed() )\n {\n auto data = qUncompress( file_to_send.data(), file_to_send.size() );\n r.set_length( data.size() );\n r.write( (const char*)data.data(), data.size() );\n }\n else\n {\n r.set_length( file_to_send.size() );\n r.write( (const char*)file_to_send.data(), file_to_send.size() );\n }\n}\n\nClientWrapper::ClientWrapper(QObject *parent)\n : QObject(parent),\n _bitshares_thread(\"bitshares\")\n{\n}\nClientWrapper::~ClientWrapper()\n{\n try {\n _init_complete.wait();\n _bitshares_thread.async( [this](){ _client->stop(); _client.reset(); } ).wait();\n } catch ( ... )\n {\n elog( \"uncaught exception\" );\n }\n}\n\nvoid ClientWrapper::initialize()\n{\n QSettings settings(\"BitShares\", BTS_BLOCKCHAIN_NAME);\n bool upnp = settings.value( \"network\/p2p\/use_upnp\", true ).toBool();\n uint32_t p2pport = settings.value( \"network\/p2p\/port\", BTS_NETWORK_DEFAULT_P2P_PORT ).toInt();\n std::string default_wallet_name = settings.value(\"client\/default_wallet_name\", \"default\").toString().toStdString();\n settings.setValue(\"client\/default_wallet_name\", QString::fromStdString(default_wallet_name));\n Q_UNUSED(p2pport);\n\n#ifdef _WIN32\n _cfg.rpc.rpc_user = \"\";\n _cfg.rpc.rpc_password = \"\";\n#else\n _cfg.rpc.rpc_user = \"randomuser\";\n _cfg.rpc.rpc_password = fc::variant(fc::ecc::private_key::generate()).as_string();\n#endif\n _cfg.rpc.httpd_endpoint = fc::ip::endpoint::from_string( \"127.0.0.1:9999\" );\n _cfg.rpc.httpd_endpoint.set_port(0);\n ilog( \"config: ${d}\", (\"d\", fc::json::to_pretty_string(_cfg) ) );\n\n auto data_dir = fc::app_path() \/ BTS_BLOCKCHAIN_NAME;\n\n fc::thread* main_thread = &fc::thread::current();\n\n _init_complete = _bitshares_thread.async( [this,main_thread,data_dir,upnp,p2pport,default_wallet_name](){\n try\n {\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Starting %1 client\").arg(qApp->applicationName())); });\n _client = std::make_shared<bts::client::client>();\n _client->open( data_dir );\n\n \/\/ setup RPC \/ HTTP services\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Loading interface\")); });\n _client->get_rpc_server()->set_http_file_callback( get_htdocs_file );\n _client->get_rpc_server()->configure_http( _cfg.rpc );\n _actual_httpd_endpoint = _client->get_rpc_server()->get_httpd_endpoint();\n\n \/\/ load config for p2p node.. creates cli\n _client->configure( data_dir );\n _client->init_cli();\n\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Connecting to %1 network\").arg(qApp->applicationName())); });\n _client->listen_on_port(0, false \/*don't wait if not available*\/);\n fc::ip::endpoint actual_p2p_endpoint = _client->get_p2p_listening_endpoint();\n\n _client->connect_to_p2p_network();\n\n for (std::string default_peer : _cfg.default_peers)\n _client->connect_to_peer(default_peer);\n\n _client->set_daemon_mode(true);\n _client->start();\n if( !_actual_httpd_endpoint )\n {\n main_thread->async( [&](){ Q_EMIT error( tr(\"Unable to start HTTP server...\")); });\n }\n\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Forwarding port\")); });\n if( upnp )\n {\n auto upnp_service = new bts::net::upnp_service();\n upnp_service->map_port( actual_p2p_endpoint.port() );\n }\n\n try\n {\n _client->wallet_open(default_wallet_name);\n }\n catch(...)\n {}\n\n main_thread->async( [&](){ Q_EMIT initialized(); });\n }\n catch (const bts::db::db_in_use_exception&)\n {\n main_thread->async( [&](){ Q_EMIT error( tr(\"An instance of %1 is already running! Please close it and try again.\").arg(qApp->applicationName())); });\n }\n catch (const fc::exception &e)\n {\n ilog(\"Failure when attempting to initialize client\");\n main_thread->async( [&](){ Q_EMIT error( tr(\"An error occurred while trying to start\")); });\n }\n });\n}\n\nvoid ClientWrapper::close()\n{\n _bitshares_thread.async([this]{\n _client->get_wallet()->close();\n _client->get_chain()->close();\n _client->get_rpc_server()->shutdown_rpc_server();\n _client->get_rpc_server()->wait_till_rpc_server_shutdown();\n }).wait();\n}\n\nQUrl ClientWrapper::http_url() const\n{\n QUrl url = QString::fromStdString(\"http:\/\/\" + std::string( *_actual_httpd_endpoint ) );\n url.setUserName(_cfg.rpc.rpc_user.c_str() );\n url.setPassword(_cfg.rpc.rpc_password.c_str() );\n return url;\n}\n\nQVariant ClientWrapper::get_info( )\n{\n fc::variant_object result = _bitshares_thread.async( [this](){ return _client->get_info(); }).wait();\n std::string sresult = fc::json::to_string( result );\n return QJsonDocument::fromJson( QByteArray( sresult.c_str(), sresult.length() ) ).toVariant();\n}\n\nQString ClientWrapper::get_http_auth_token()\n{\n QByteArray result = _cfg.rpc.rpc_user.c_str();\n result += \":\";\n result += _cfg.rpc.rpc_password.c_str();\n return result.toBase64( QByteArray::Base64Encoding | QByteArray::KeepTrailingEquals );\n}\n\nvoid ClientWrapper::confirm_and_set_approval(QString delegate_name, bool approve)\n{\n auto account = get_client()->blockchain_get_account(delegate_name.toStdString());\n if( account.valid() && account->is_delegate() )\n {\n if( QMessageBox::question(nullptr,\n tr(\"Set Delegate Approval\"),\n tr(\"Would you like to update approval rating of Delegate %1 to %2?\")\n .arg(delegate_name)\n .arg(approve?\"Approve\":\"Disapprove\")\n )\n == QMessageBox::Yes )\n get_client()->wallet_account_set_approval(delegate_name.toStdString(), approve);\n }\n else\n QMessageBox::warning(nullptr, tr(\"Invalid Account\"), tr(\"Account %1 is not a delegate, so its approval cannot be set.\").arg(delegate_name));\n\n}\n<commit_msg>Prepare qt_wallet for merge of chain_server branch<commit_after>#include \"ClientWrapper.hpp\"\n\n#include <bts\/net\/upnp.hpp>\n\n#include <QApplication>\n#include <QResource>\n#include <QSettings>\n#include <QJsonDocument>\n#include <QUrl>\n#include <QMessageBox>\n\n#include <iostream>\n\nvoid get_htdocs_file( const fc::path& filename, const fc::http::server::response& r )\n{\n std::cout << filename.generic_string() << \"\\n\";\n QResource file_to_send( (\"\/htdocs\/htdocs\/\" + filename.generic_string()).c_str() );\n if( !file_to_send.data() )\n {\n std::string not_found = \"this is not the file you are looking for: \" + filename.generic_string();\n r.set_status( fc::http::reply::NotFound );\n r.set_length( not_found.size() );\n r.write( not_found.c_str(), not_found.size() );\n return;\n }\n r.set_status( fc::http::reply::OK );\n if( file_to_send.isCompressed() )\n {\n auto data = qUncompress( file_to_send.data(), file_to_send.size() );\n r.set_length( data.size() );\n r.write( (const char*)data.data(), data.size() );\n }\n else\n {\n r.set_length( file_to_send.size() );\n r.write( (const char*)file_to_send.data(), file_to_send.size() );\n }\n}\n\nClientWrapper::ClientWrapper(QObject *parent)\n : QObject(parent),\n _bitshares_thread(\"bitshares\")\n{\n}\nClientWrapper::~ClientWrapper()\n{\n try {\n _init_complete.wait();\n _bitshares_thread.async( [this](){ _client->stop(); _client.reset(); } ).wait();\n } catch ( ... )\n {\n elog( \"uncaught exception\" );\n }\n}\n\nvoid ClientWrapper::initialize()\n{\n QSettings settings(\"BitShares\", BTS_BLOCKCHAIN_NAME);\n bool upnp = settings.value( \"network\/p2p\/use_upnp\", true ).toBool();\n uint32_t p2pport = settings.value( \"network\/p2p\/port\", BTS_NETWORK_DEFAULT_P2P_PORT ).toInt();\n std::string default_wallet_name = settings.value(\"client\/default_wallet_name\", \"default\").toString().toStdString();\n settings.setValue(\"client\/default_wallet_name\", QString::fromStdString(default_wallet_name));\n Q_UNUSED(p2pport);\n\n#ifdef _WIN32\n _cfg.rpc.rpc_user = \"\";\n _cfg.rpc.rpc_password = \"\";\n#else\n _cfg.rpc.rpc_user = \"randomuser\";\n _cfg.rpc.rpc_password = fc::variant(fc::ecc::private_key::generate()).as_string();\n#endif\n _cfg.rpc.httpd_endpoint = fc::ip::endpoint::from_string( \"127.0.0.1:9999\" );\n _cfg.rpc.httpd_endpoint.set_port(0);\n ilog( \"config: ${d}\", (\"d\", fc::json::to_pretty_string(_cfg) ) );\n\n auto data_dir = fc::app_path() \/ BTS_BLOCKCHAIN_NAME;\n\n fc::thread* main_thread = &fc::thread::current();\n\n _init_complete = _bitshares_thread.async( [this,main_thread,data_dir,upnp,p2pport,default_wallet_name](){\n try\n {\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Starting %1 client\").arg(qApp->applicationName())); });\n _client = std::make_shared<bts::client::client>();\n _client->open( data_dir );\n\n \/\/ setup RPC \/ HTTP services\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Loading interface\")); });\n _client->get_rpc_server()->set_http_file_callback( get_htdocs_file );\n _client->get_rpc_server()->configure_http( _cfg.rpc );\n _actual_httpd_endpoint = _client->get_rpc_server()->get_httpd_endpoint();\n\n \/\/ load config for p2p node.. creates cli\n _client->configure( data_dir );\n _client->init_cli();\n\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Connecting to %1 network\").arg(qApp->applicationName())); });\n _client->listen_on_port(0, false \/*don't wait if not available*\/);\n fc::ip::endpoint actual_p2p_endpoint = _client->get_p2p_listening_endpoint();\n\n for (std::string default_peer : _cfg.default_peers)\n _client->connect_to_peer(default_peer);\n\n _client->set_daemon_mode(true);\n _client->start();\n if( !_actual_httpd_endpoint )\n {\n main_thread->async( [&](){ Q_EMIT error( tr(\"Unable to start HTTP server...\")); });\n }\n\n main_thread->async( [&](){ Q_EMIT status_update(tr(\"Forwarding port\")); });\n if( upnp )\n {\n auto upnp_service = new bts::net::upnp_service();\n upnp_service->map_port( actual_p2p_endpoint.port() );\n }\n\n try\n {\n _client->wallet_open(default_wallet_name);\n }\n catch(...)\n {}\n\n main_thread->async( [&](){ Q_EMIT initialized(); });\n }\n catch (const bts::db::db_in_use_exception&)\n {\n main_thread->async( [&](){ Q_EMIT error( tr(\"An instance of %1 is already running! Please close it and try again.\").arg(qApp->applicationName())); });\n }\n catch (const fc::exception &e)\n {\n ilog(\"Failure when attempting to initialize client\");\n main_thread->async( [&](){ Q_EMIT error( tr(\"An error occurred while trying to start\")); });\n }\n });\n}\n\nvoid ClientWrapper::close()\n{\n _bitshares_thread.async([this]{\n _client->get_wallet()->close();\n _client->get_chain()->close();\n _client->get_rpc_server()->shutdown_rpc_server();\n _client->get_rpc_server()->wait_till_rpc_server_shutdown();\n }).wait();\n}\n\nQUrl ClientWrapper::http_url() const\n{\n QUrl url = QString::fromStdString(\"http:\/\/\" + std::string( *_actual_httpd_endpoint ) );\n url.setUserName(_cfg.rpc.rpc_user.c_str() );\n url.setPassword(_cfg.rpc.rpc_password.c_str() );\n return url;\n}\n\nQVariant ClientWrapper::get_info( )\n{\n fc::variant_object result = _bitshares_thread.async( [this](){ return _client->get_info(); }).wait();\n std::string sresult = fc::json::to_string( result );\n return QJsonDocument::fromJson( QByteArray( sresult.c_str(), sresult.length() ) ).toVariant();\n}\n\nQString ClientWrapper::get_http_auth_token()\n{\n QByteArray result = _cfg.rpc.rpc_user.c_str();\n result += \":\";\n result += _cfg.rpc.rpc_password.c_str();\n return result.toBase64( QByteArray::Base64Encoding | QByteArray::KeepTrailingEquals );\n}\n\nvoid ClientWrapper::confirm_and_set_approval(QString delegate_name, bool approve)\n{\n auto account = get_client()->blockchain_get_account(delegate_name.toStdString());\n if( account.valid() && account->is_delegate() )\n {\n if( QMessageBox::question(nullptr,\n tr(\"Set Delegate Approval\"),\n tr(\"Would you like to update approval rating of Delegate %1 to %2?\")\n .arg(delegate_name)\n .arg(approve?\"Approve\":\"Disapprove\")\n )\n == QMessageBox::Yes )\n get_client()->wallet_account_set_approval(delegate_name.toStdString(), approve);\n }\n else\n QMessageBox::warning(nullptr, tr(\"Invalid Account\"), tr(\"Account %1 is not a delegate, so its approval cannot be set.\").arg(delegate_name));\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by permal on 7\/31\/17.\n\/\/\n\n#include <smooth\/application\/network\/mqtt\/packet\/PacketDecoder.h>\n#include <smooth\/application\/network\/mqtt\/packet\/ConnAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/Publish.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubRec.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubRel.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubComp.h>\n#include <smooth\/application\/network\/mqtt\/packet\/SubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/UnsubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PingResp.h>\n#include <smooth\/core\/util\/make_unique.h>\n\n#include <string>\n#include \"esp_log.h\"\n\nnamespace smooth\n{\n namespace application\n {\n namespace network\n {\n namespace mqtt\n {\n namespace packet\n {\n \/\/ Decode messages from server to client\n std::unique_ptr<MQTTPacket> PacketDecoder::decode_packet(const MQTTPacket& packet)\n {\n std::unique_ptr<MQTTPacket> res;\n using namespace core::util;\n\n if (packet.is_too_big())\n {\n \/\/ We can't do anything with packets that are too big as their contents\n \/\/ is invalid; not even the variable header can be considered intact.\n ESP_LOGV(\"PacketDecoder\", \"Too big packet discarded\");\n }\n else\n {\n if (packet.get_mqtt_type() == CONNACK)\n {\n res = make_unique<ConnAck>(packet);\n }\n else if (packet.get_mqtt_type() == PUBLISH)\n {\n res = make_unique<Publish>(packet);\n }\n else if (packet.get_mqtt_type() == PUBACK)\n {\n res = make_unique<PubAck>(packet);\n }\n else if (packet.get_mqtt_type() == PUBREC)\n {\n res = make_unique<PubRec>(packet);\n }\n else if (packet.get_mqtt_type() == PUBREL)\n {\n res = make_unique<PubRel>(packet);\n }\n else if (packet.get_mqtt_type() == PUBCOMP)\n {\n res = make_unique<PubComp>(packet);\n }\n else if (packet.get_mqtt_type() == SUBACK)\n {\n res = make_unique<SubAck>(packet);\n }\n else if (packet.get_mqtt_type() == UNSUBACK)\n {\n res = make_unique<UnsubAck>(packet);\n }\n else if (packet.get_mqtt_type() == PINGRESP)\n {\n res = make_unique<PingResp>(packet);\n }\n }\n\n if (res)\n {\n if (res->validate_packet())\n {\n \/\/qqq res->dump(\"Incoming\");\n }\n else\n {\n res.reset();\n }\n }\n\n return res;\n }\n }\n }\n }\n }\n}<commit_msg>Reenabled logging.<commit_after>\/\/\n\/\/ Created by permal on 7\/31\/17.\n\/\/\n\n#include <smooth\/application\/network\/mqtt\/packet\/PacketDecoder.h>\n#include <smooth\/application\/network\/mqtt\/packet\/ConnAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/Publish.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubRec.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubRel.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PubComp.h>\n#include <smooth\/application\/network\/mqtt\/packet\/SubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/UnsubAck.h>\n#include <smooth\/application\/network\/mqtt\/packet\/PingResp.h>\n#include <smooth\/core\/util\/make_unique.h>\n\n#include <string>\n#include \"esp_log.h\"\n\nnamespace smooth\n{\n namespace application\n {\n namespace network\n {\n namespace mqtt\n {\n namespace packet\n {\n \/\/ Decode messages from server to client\n std::unique_ptr<MQTTPacket> PacketDecoder::decode_packet(const MQTTPacket& packet)\n {\n std::unique_ptr<MQTTPacket> res;\n using namespace core::util;\n\n if (packet.is_too_big())\n {\n \/\/ We can't do anything with packets that are too big as their contents\n \/\/ is invalid; not even the variable header can be considered intact.\n ESP_LOGV(\"PacketDecoder\", \"Too big packet discarded\");\n }\n else\n {\n if (packet.get_mqtt_type() == CONNACK)\n {\n res = make_unique<ConnAck>(packet);\n }\n else if (packet.get_mqtt_type() == PUBLISH)\n {\n res = make_unique<Publish>(packet);\n }\n else if (packet.get_mqtt_type() == PUBACK)\n {\n res = make_unique<PubAck>(packet);\n }\n else if (packet.get_mqtt_type() == PUBREC)\n {\n res = make_unique<PubRec>(packet);\n }\n else if (packet.get_mqtt_type() == PUBREL)\n {\n res = make_unique<PubRel>(packet);\n }\n else if (packet.get_mqtt_type() == PUBCOMP)\n {\n res = make_unique<PubComp>(packet);\n }\n else if (packet.get_mqtt_type() == SUBACK)\n {\n res = make_unique<SubAck>(packet);\n }\n else if (packet.get_mqtt_type() == UNSUBACK)\n {\n res = make_unique<UnsubAck>(packet);\n }\n else if (packet.get_mqtt_type() == PINGRESP)\n {\n res = make_unique<PingResp>(packet);\n }\n }\n\n if (res)\n {\n if (res->validate_packet())\n {\n res->dump(\"Incoming\");\n }\n else\n {\n res.reset();\n }\n }\n\n return res;\n }\n }\n }\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/shared_memory.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/win_util.h\"\n\nnamespace base {\n\nSharedMemory::SharedMemory()\n : mapped_file_(NULL),\n memory_(NULL),\n read_only_(false),\n max_size_(0),\n lock_(NULL) {\n}\n\nSharedMemory::SharedMemory(SharedMemoryHandle handle, bool read_only)\n : mapped_file_(handle),\n memory_(NULL),\n read_only_(read_only),\n max_size_(0),\n lock_(NULL) {\n}\n\nSharedMemory::SharedMemory(SharedMemoryHandle handle, bool read_only,\n ProcessHandle process)\n : mapped_file_(NULL),\n memory_(NULL),\n read_only_(read_only),\n max_size_(0),\n lock_(NULL) {\n ::DuplicateHandle(process, handle,\n GetCurrentProcess(), &mapped_file_,\n STANDARD_RIGHTS_REQUIRED |\n (read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS),\n FALSE, 0);\n}\n\nSharedMemory::~SharedMemory() {\n Close();\n if (lock_ != NULL)\n CloseHandle(lock_);\n}\n\n\/\/ static\nbool SharedMemory::IsHandleValid(const SharedMemoryHandle& handle) {\n return handle != NULL;\n}\n\n\/\/ static\nSharedMemoryHandle SharedMemory::NULLHandle() {\n return NULL;\n}\n\n\/\/ static\nvoid SharedMemory::CloseHandle(const SharedMemoryHandle& handle) {\n DCHECK(handle != NULL);\n ::CloseHandle(handle);\n}\n\nbool SharedMemory::Create(const std::wstring &name, bool read_only,\n bool open_existing, uint32 size) {\n DCHECK(mapped_file_ == NULL);\n\n name_ = name;\n read_only_ = read_only;\n mapped_file_ = CreateFileMapping(INVALID_HANDLE_VALUE, NULL,\n read_only_ ? PAGE_READONLY : PAGE_READWRITE, 0, static_cast<DWORD>(size),\n name.empty() ? NULL : name.c_str());\n if (!mapped_file_)\n return false;\n\n \/\/ Check if the shared memory pre-exists.\n if (GetLastError() == ERROR_ALREADY_EXISTS && !open_existing) {\n Close();\n return false;\n }\n max_size_ = size;\n return true;\n}\n\nbool SharedMemory::Delete(const std::wstring& name) {\n \/\/ intentionally empty -- there is nothing for us to do on Windows.\n return true;\n}\n\nbool SharedMemory::Open(const std::wstring &name, bool read_only) {\n DCHECK(mapped_file_ == NULL);\n\n name_ = name;\n read_only_ = read_only;\n mapped_file_ = OpenFileMapping(\n read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS, false,\n name.empty() ? NULL : name.c_str());\n if (mapped_file_ != NULL) {\n \/\/ Note: size_ is not set in this case.\n return true;\n }\n return false;\n}\n\nbool SharedMemory::Map(uint32 bytes) {\n if (mapped_file_ == NULL)\n return false;\n\n memory_ = MapViewOfFile(mapped_file_,\n read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS, 0, 0, bytes);\n if (memory_ != NULL) {\n return true;\n }\n return false;\n}\n\nbool SharedMemory::Unmap() {\n if (memory_ == NULL)\n return false;\n\n UnmapViewOfFile(memory_);\n memory_ = NULL;\n return true;\n}\n\nbool SharedMemory::ShareToProcessCommon(ProcessHandle process,\n SharedMemoryHandle *new_handle,\n bool close_self) {\n *new_handle = 0;\n DWORD access = STANDARD_RIGHTS_REQUIRED | FILE_MAP_READ;\n DWORD options = 0;\n HANDLE mapped_file = mapped_file_;\n HANDLE result;\n if (!read_only_)\n access |= FILE_MAP_WRITE;\n if (close_self) {\n \/\/ DUPLICATE_CLOSE_SOURCE causes DuplicateHandle to close mapped_file.\n options = DUPLICATE_CLOSE_SOURCE;\n mapped_file_ = NULL;\n Unmap();\n }\n\n if (process == GetCurrentProcess() && close_self) {\n *new_handle = mapped_file;\n return true;\n }\n\n if (!DuplicateHandle(GetCurrentProcess(), mapped_file, process,\n &result, access, FALSE, options))\n return false;\n *new_handle = result;\n return true;\n}\n\n\nvoid SharedMemory::Close() {\n if (memory_ != NULL) {\n UnmapViewOfFile(memory_);\n memory_ = NULL;\n }\n\n if (mapped_file_ != NULL) {\n CloseHandle(mapped_file_);\n mapped_file_ = NULL;\n }\n}\n\nvoid SharedMemory::Lock() {\n if (lock_ == NULL) {\n std::wstring name = name_;\n name.append(L\"lock\");\n lock_ = CreateMutex(NULL, FALSE, name.c_str());\n DCHECK(lock_ != NULL);\n if (lock_ == NULL) {\n DLOG(ERROR) << \"Could not create mutex\" << GetLastError();\n return; \/\/ there is nothing good we can do here.\n }\n }\n WaitForSingleObject(lock_, INFINITE);\n}\n\nvoid SharedMemory::Unlock() {\n DCHECK(lock_ != NULL);\n ReleaseMutex(lock_);\n}\n\nSharedMemoryHandle SharedMemory::handle() const {\n return mapped_file_;\n}\n\n} \/\/ namespace base\n<commit_msg>Round the size of shared memory regions up to 64K. This allows native client modules to map these regions. With this fix, Pepper audio works on all three platforms.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/shared_memory.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/win_util.h\"\n\nnamespace base {\n\nSharedMemory::SharedMemory()\n : mapped_file_(NULL),\n memory_(NULL),\n read_only_(false),\n max_size_(0),\n lock_(NULL) {\n}\n\nSharedMemory::SharedMemory(SharedMemoryHandle handle, bool read_only)\n : mapped_file_(handle),\n memory_(NULL),\n read_only_(read_only),\n max_size_(0),\n lock_(NULL) {\n}\n\nSharedMemory::SharedMemory(SharedMemoryHandle handle, bool read_only,\n ProcessHandle process)\n : mapped_file_(NULL),\n memory_(NULL),\n read_only_(read_only),\n max_size_(0),\n lock_(NULL) {\n ::DuplicateHandle(process, handle,\n GetCurrentProcess(), &mapped_file_,\n STANDARD_RIGHTS_REQUIRED |\n (read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS),\n FALSE, 0);\n}\n\nSharedMemory::~SharedMemory() {\n Close();\n if (lock_ != NULL)\n CloseHandle(lock_);\n}\n\n\/\/ static\nbool SharedMemory::IsHandleValid(const SharedMemoryHandle& handle) {\n return handle != NULL;\n}\n\n\/\/ static\nSharedMemoryHandle SharedMemory::NULLHandle() {\n return NULL;\n}\n\n\/\/ static\nvoid SharedMemory::CloseHandle(const SharedMemoryHandle& handle) {\n DCHECK(handle != NULL);\n ::CloseHandle(handle);\n}\n\nbool SharedMemory::Create(const std::wstring &name, bool read_only,\n bool open_existing, uint32 size) {\n DCHECK(mapped_file_ == NULL);\n\n \/\/ NaCl's memory allocator requires 0mod64K alignment and size for\n \/\/ shared memory objects. To allow passing shared memory to NaCl,\n \/\/ therefore we round the size actually created to the nearest 64K unit.\n \/\/ To avoid client impact, we continue to retain the size as the\n \/\/ actual requested size.\n uint32 rounded_size = (size + 0xffff) & ~0xffff;\n name_ = name;\n read_only_ = read_only;\n mapped_file_ = CreateFileMapping(INVALID_HANDLE_VALUE, NULL,\n read_only_ ? PAGE_READONLY : PAGE_READWRITE, 0,\n static_cast<DWORD>(rounded_size),\n name.empty() ? NULL : name.c_str());\n if (!mapped_file_)\n return false;\n\n \/\/ Check if the shared memory pre-exists.\n if (GetLastError() == ERROR_ALREADY_EXISTS && !open_existing) {\n Close();\n return false;\n }\n max_size_ = size;\n return true;\n}\n\nbool SharedMemory::Delete(const std::wstring& name) {\n \/\/ intentionally empty -- there is nothing for us to do on Windows.\n return true;\n}\n\nbool SharedMemory::Open(const std::wstring &name, bool read_only) {\n DCHECK(mapped_file_ == NULL);\n\n name_ = name;\n read_only_ = read_only;\n mapped_file_ = OpenFileMapping(\n read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS, false,\n name.empty() ? NULL : name.c_str());\n if (mapped_file_ != NULL) {\n \/\/ Note: size_ is not set in this case.\n return true;\n }\n return false;\n}\n\nbool SharedMemory::Map(uint32 bytes) {\n if (mapped_file_ == NULL)\n return false;\n\n memory_ = MapViewOfFile(mapped_file_,\n read_only_ ? FILE_MAP_READ : FILE_MAP_ALL_ACCESS, 0, 0, bytes);\n if (memory_ != NULL) {\n return true;\n }\n return false;\n}\n\nbool SharedMemory::Unmap() {\n if (memory_ == NULL)\n return false;\n\n UnmapViewOfFile(memory_);\n memory_ = NULL;\n return true;\n}\n\nbool SharedMemory::ShareToProcessCommon(ProcessHandle process,\n SharedMemoryHandle *new_handle,\n bool close_self) {\n *new_handle = 0;\n DWORD access = STANDARD_RIGHTS_REQUIRED | FILE_MAP_READ;\n DWORD options = 0;\n HANDLE mapped_file = mapped_file_;\n HANDLE result;\n if (!read_only_)\n access |= FILE_MAP_WRITE;\n if (close_self) {\n \/\/ DUPLICATE_CLOSE_SOURCE causes DuplicateHandle to close mapped_file.\n options = DUPLICATE_CLOSE_SOURCE;\n mapped_file_ = NULL;\n Unmap();\n }\n\n if (process == GetCurrentProcess() && close_self) {\n *new_handle = mapped_file;\n return true;\n }\n\n if (!DuplicateHandle(GetCurrentProcess(), mapped_file, process,\n &result, access, FALSE, options))\n return false;\n *new_handle = result;\n return true;\n}\n\n\nvoid SharedMemory::Close() {\n if (memory_ != NULL) {\n UnmapViewOfFile(memory_);\n memory_ = NULL;\n }\n\n if (mapped_file_ != NULL) {\n CloseHandle(mapped_file_);\n mapped_file_ = NULL;\n }\n}\n\nvoid SharedMemory::Lock() {\n if (lock_ == NULL) {\n std::wstring name = name_;\n name.append(L\"lock\");\n lock_ = CreateMutex(NULL, FALSE, name.c_str());\n DCHECK(lock_ != NULL);\n if (lock_ == NULL) {\n DLOG(ERROR) << \"Could not create mutex\" << GetLastError();\n return; \/\/ there is nothing good we can do here.\n }\n }\n WaitForSingleObject(lock_, INFINITE);\n}\n\nvoid SharedMemory::Unlock() {\n DCHECK(lock_ != NULL);\n ReleaseMutex(lock_);\n}\n\nSharedMemoryHandle SharedMemory::handle() const {\n return mapped_file_;\n}\n\n} \/\/ namespace base\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2020 by Robert Bosch GmbH. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License\n\n#include \"iceoryx_posh\/internal\/popo\/waitset\/wait_set.hpp\"\n#include \"iceoryx_posh\/runtime\/posh_runtime.hpp\"\n\nnamespace iox\n{\nnamespace popo\n{\nWaitSet::WaitSet() noexcept\n : m_conditionVariableDataPtr(runtime::PoshRuntime::getInstance().getMiddlewareConditionVariable())\n , m_conditionVariableWaiter(m_conditionVariableDataPtr)\n{\n \/\/\/ @todo Add GuardCondition to m_conditionVector, it's the default condition\n}\n\nbool WaitSet::attachCondition(Condition& condition) noexcept\n{\n if (!condition.isConditionVariableAttached())\n {\n if (condition.attachConditionVariable(m_conditionVariableDataPtr))\n {\n return m_conditionVector.push_back(&condition);\n }\n }\n\n return false;\n}\n\nbool WaitSet::detachCondition(Condition& condition) noexcept\n{\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition == &condition)\n {\n m_conditionVector.erase(¤tCondition);\n return true;\n }\n }\n return false;\n}\n\nvoid WaitSet::timedWait(units::Duration timeout) noexcept\n{\n m_conditionVariableWaiter.timedWait(timeout);\n}\n\ncxx::vector<Condition, MAX_NUMBER_OF_CONDITIONS> WaitSet::wait() noexcept\n{\n cxx::vector<Condition, MAX_NUMBER_OF_CONDITIONS> conditionsWithFulfilledPredicate;\n\n \/\/\/ @note Inbetween here and last wait someone could have set the trigger to true, hence reset it\n m_conditionVariableWaiter.reset();\n\n \/\/ Is one of the conditons true?\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition->hasTrigger() == true)\n {\n conditionsWithFulfilledPredicate.push_back(*currentCondition);\n }\n }\n\n if (conditionsWithFulfilledPredicate.empty())\n {\n m_conditionVariableWaiter.wait();\n\n \/\/ Check again if one of the conditions is true after we received the signal\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition->hasTrigger() == true)\n {\n conditionsWithFulfilledPredicate.push_back(*currentCondition);\n }\n }\n }\n \/\/ Return of a copy of all conditions that were fulfilled\n return conditionsWithFulfilledPredicate;\n}\n} \/\/ namespace popo\n} \/\/ namespace iox\n<commit_msg>iox-#25: Unify if<commit_after>\/\/ Copyright (c) 2020 by Robert Bosch GmbH. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License\n\n#include \"iceoryx_posh\/internal\/popo\/waitset\/wait_set.hpp\"\n#include \"iceoryx_posh\/runtime\/posh_runtime.hpp\"\n\nnamespace iox\n{\nnamespace popo\n{\nWaitSet::WaitSet() noexcept\n : m_conditionVariableDataPtr(runtime::PoshRuntime::getInstance().getMiddlewareConditionVariable())\n , m_conditionVariableWaiter(m_conditionVariableDataPtr)\n{\n \/\/\/ @todo Add GuardCondition to m_conditionVector, it's the default condition\n}\n\nbool WaitSet::attachCondition(Condition& condition) noexcept\n{\n if (!condition.isConditionVariableAttached())\n {\n if (condition.attachConditionVariable(m_conditionVariableDataPtr))\n {\n return m_conditionVector.push_back(&condition);\n }\n }\n\n return false;\n}\n\nbool WaitSet::detachCondition(Condition& condition) noexcept\n{\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition == &condition)\n {\n m_conditionVector.erase(¤tCondition);\n return true;\n }\n }\n return false;\n}\n\nvoid WaitSet::timedWait(units::Duration timeout) noexcept\n{\n m_conditionVariableWaiter.timedWait(timeout);\n}\n\ncxx::vector<Condition, MAX_NUMBER_OF_CONDITIONS> WaitSet::wait() noexcept\n{\n cxx::vector<Condition, MAX_NUMBER_OF_CONDITIONS> conditionsWithFulfilledPredicate;\n\n \/\/\/ @note Inbetween here and last wait someone could have set the trigger to true, hence reset it\n m_conditionVariableWaiter.reset();\n\n \/\/ Is one of the conditons true?\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition->hasTrigger())\n {\n conditionsWithFulfilledPredicate.push_back(*currentCondition);\n }\n }\n\n if (conditionsWithFulfilledPredicate.empty())\n {\n m_conditionVariableWaiter.wait();\n\n \/\/ Check again if one of the conditions is true after we received the signal\n for (auto currentCondition : m_conditionVector)\n {\n if (currentCondition->hasTrigger())\n {\n conditionsWithFulfilledPredicate.push_back(*currentCondition);\n }\n }\n }\n \/\/ Return of a copy of all conditions that were fulfilled\n return conditionsWithFulfilledPredicate;\n}\n} \/\/ namespace popo\n} \/\/ namespace iox\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is provided under a dual BSD\/GPLv2 license. When using or\n redistributing this file, you may do so under either license.\n\n GPL LICENSE SUMMARY\n\n Copyright(c) 2005-2012 Intel Corporation. All rights reserved.\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of version 2 of the GNU General Public License as\n published by the Free Software Foundation.\n\n This program is distributed in the hope that it will be useful, but\n WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.\n The full GNU General Public License is included in this distribution\n in the file called LICENSE.GPL.\n\n Contact Information:\n http:\/\/software.intel.com\/en-us\/articles\/intel-vtune-amplifier-xe\/\n\n BSD LICENSE\n\n Copyright(c) 2005-2012 Intel Corporation. All rights reserved.\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the\n distribution.\n * Neither the name of Intel Corporation nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n#include <string.h>\n\n#ifdef WIN32\n#include <hash_map>\nusing namespace std;\n#else\n\/\/ To avoid GCC 4.4 compilation warning about hash_map being deprecated.\n#define OLD_DEPRECATED __DEPRECATED\n#undef __DEPRECATED\n#include <ext\/hash_map>\n#define __DEPRECATED OLD_DEPRECATED\nusing namespace __gnu_cxx;\n#endif\n\n#include <list>\n\n#include \"v8-vtune.h\"\n#include \"vtune-jit.h\"\n\nnamespace vTune {\nnamespace internal {\n\n\n\/\/ This class is used to record the JITted code position info for JIT\n\/\/ code profiling.\nclass JITCodeLineInfo {\n public:\n JITCodeLineInfo() { }\n\n void SetPosition(intptr_t pc, int pos) {\n AddCodeLineInfo(LineNumInfo(pc, pos));\n }\n\n struct LineNumInfo {\n LineNumInfo(intptr_t pc, int pos)\n : pc_(pc), pos_(pos) { }\n\n intptr_t pc_;\n int pos_;\n };\n\n std::list<LineNumInfo>* GetLineNumInfo() {\n return &line_num_info_;\n }\n\n private:\n void AddCodeLineInfo(const LineNumInfo& line_info) {\n\t line_num_info_.push_back(line_info);\n }\n std::list<LineNumInfo> line_num_info_;\n};\n\nstruct SameCodeObjects {\n bool operator () (void* key1, void* key2) const {\n return key1 == key2;\n }\n};\n\nstruct HashForCodeObject {\n uint32_t operator () (void* code) const {\n static const uintptr_t kGoldenRatio = 2654435761u;\n uintptr_t hash = reinterpret_cast<uintptr_t>(code);\n return static_cast<uint32_t>(hash * kGoldenRatio);\n }\n};\n\n#ifdef WIN32\ntypedef hash_map<void*, void*> JitInfoMap;\n#else\ntypedef hash_map<void*, void*, HashForCodeObject, SameCodeObjects> JitInfoMap;\n#endif\n\nstatic JitInfoMap* GetEntries() {\n static JitInfoMap* entries;\n if (entries == NULL) {\n entries = new JitInfoMap();\n }\n return entries;\n}\n\nstatic bool IsLineInfoTagged(void* ptr) {\n return 0 != (reinterpret_cast<intptr_t>(ptr));\n}\n\nstatic JITCodeLineInfo* UntagLineInfo(void* ptr) {\n return reinterpret_cast<JITCodeLineInfo*>(\n reinterpret_cast<intptr_t>(ptr));\n}\n\n\/\/ The parameter str is a mixed pattern which contains the\n\/\/ function name and some other info. It comes from all the\n\/\/ Logger::CodeCreateEvent(...) function. This funtion get the\n\/\/ pure function name from the input parameter.\nstatic char* GetFunctionNameFromMixedName(const char* str, int length) {\n int index = 0;\n int count = 0;\n char* start_ptr = NULL;\n\n while (str[index++] != ':' && (index < length)) {}\n\n if (str[index] == '*' || str[index] == '~' ) index++;\n if (index >= length) return NULL;\n\n start_ptr = const_cast<char*>(str + index);\n\n while (index < length && str[index++] != ' ') {\n count++;\n }\n\n char* result = new char[count + 1];\n memcpy(result, start_ptr, count);\n result[count] = '\\0';\n\n return result;\n}\n\n\/\/ The JitCodeEventHandler for Vtune.\nvoid VTUNEJITInterface::event_handler(const v8::JitCodeEvent* event) {\n if (VTUNERUNNING && event != NULL) {\n switch (event->type) {\n case v8::JitCodeEvent::CODE_ADDED: {\n char* temp_file_name = NULL;\n char* temp_method_name =\n GetFunctionNameFromMixedName(event->name.str,\n static_cast<int>(event->name.len));\n iJIT_Method_Load jmethod;\n memset(&jmethod, 0, sizeof jmethod);\n jmethod.method_id = iJIT_GetNewMethodID();\n jmethod.method_load_address = event->code_start;\n jmethod.method_size = static_cast<unsigned int>(event->code_len);\n jmethod.method_name = temp_method_name;\n\n Handle<Script> script = event->script;\n\t\t\n if (*script != NULL) {\n \/\/ Get the source file name and set it to jmethod.source_file_name\n if ((*script->GetScriptName())->IsString()) {\n Handle<String> script_name =\n Handle<String>(String::Cast(*script->GetScriptName()));\n temp_file_name = new char[script_name->Length() + 1];\n script_name->WriteAscii(temp_file_name);\n jmethod.source_file_name = temp_file_name;\n }\n\n JitInfoMap::iterator entry =\n GetEntries()->find(event->code_start);\n if (entry != GetEntries()->end() && IsLineInfoTagged(entry->first)) {\n JITCodeLineInfo* line_info = UntagLineInfo(entry->second);\n \/\/ Get the line_num_info and set it to jmethod.line_number_table\n std::list<JITCodeLineInfo::LineNumInfo>* vtunelineinfo =\n line_info->GetLineNumInfo();\n\n jmethod.line_number_size = (unsigned int)vtunelineinfo->size();\n jmethod.line_number_table =\n reinterpret_cast<LineNumberInfo*>(\n malloc(sizeof(LineNumberInfo)*jmethod.line_number_size));\n\n std::list<JITCodeLineInfo::LineNumInfo>::iterator Iter;\n int index = 0;\n for (Iter = vtunelineinfo->begin();\n Iter != vtunelineinfo->end();\n Iter++) {\n jmethod.line_number_table[index].Offset =\n static_cast<unsigned int>(Iter->pc_);\n jmethod.line_number_table[index++].LineNumber =\n\t\t\t\t script->GetLineNumber(Iter->pos_)+1;\n }\n GetEntries()->erase(event->code_start);\n }\n } \n\n iJIT_NotifyEvent(iJVM_EVENT_TYPE_METHOD_LOAD_FINISHED,\n reinterpret_cast<void*>(&jmethod));\n if (temp_method_name)\n delete []temp_method_name;\n if (temp_file_name)\n delete []temp_file_name;\n break;\n }\n \/\/ TODO(chunyang.dai@intel.com): code_move will be supported.\n case v8::JitCodeEvent::CODE_MOVED:\n break;\n \/\/ Currently the CODE_REMOVED event is not issued.\n case v8::JitCodeEvent::CODE_REMOVED:\n break;\n case v8::JitCodeEvent::CODE_ADD_LINE_POS_INFO: {\n JITCodeLineInfo* line_info =\n reinterpret_cast<JITCodeLineInfo*>(event->user_data);\n if (line_info != NULL) {\n line_info->SetPosition(static_cast<intptr_t>(event->line_info.offset),\n static_cast<int>(event->line_info.pos));\n }\n break;\n }\n case v8::JitCodeEvent::CODE_START_LINE_INFO_RECORDING: {\n v8::JitCodeEvent* temp_event = const_cast<v8::JitCodeEvent*>(event);\n temp_event->user_data = new JITCodeLineInfo();\n break;\n }\n case v8::JitCodeEvent::CODE_END_LINE_INFO_RECORDING: {\n GetEntries()->insert(std::pair <void*, void*>(event->code_start, event->user_data));\n break;\n } \n default:\n break;\n }\n } \n return;\n}\n\n} \/\/ namespace internal\n\nvoid InitilizeVtuneForV8() {\n if (v8::V8::Initialize()) {\n v8::V8::SetFlagsFromString(\"--nocompact_code_space\",\n (int)strlen(\"--nocompact_code_space\"));\n v8::V8::SetJitCodeEventHandler(v8::kJitCodeEventDefault,\n vTune::internal::VTUNEJITInterface::event_handler);\n }\n}\n\n} \/\/ namespace vTune\n<commit_msg>remove use of WriteAscii for vtune<commit_after>\/*\n This file is provided under a dual BSD\/GPLv2 license. When using or\n redistributing this file, you may do so under either license.\n\n GPL LICENSE SUMMARY\n\n Copyright(c) 2005-2012 Intel Corporation. All rights reserved.\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of version 2 of the GNU General Public License as\n published by the Free Software Foundation.\n\n This program is distributed in the hope that it will be useful, but\n WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.\n The full GNU General Public License is included in this distribution\n in the file called LICENSE.GPL.\n\n Contact Information:\n http:\/\/software.intel.com\/en-us\/articles\/intel-vtune-amplifier-xe\/\n\n BSD LICENSE\n\n Copyright(c) 2005-2012 Intel Corporation. All rights reserved.\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the\n distribution.\n * Neither the name of Intel Corporation nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n#include <string.h>\n\n#ifdef WIN32\n#include <hash_map>\nusing namespace std;\n#else\n\/\/ To avoid GCC 4.4 compilation warning about hash_map being deprecated.\n#define OLD_DEPRECATED __DEPRECATED\n#undef __DEPRECATED\n#include <ext\/hash_map>\n#define __DEPRECATED OLD_DEPRECATED\nusing namespace __gnu_cxx;\n#endif\n\n#include <list>\n\n#include \"v8-vtune.h\"\n#include \"vtune-jit.h\"\n\nnamespace vTune {\nnamespace internal {\n\n\n\/\/ This class is used to record the JITted code position info for JIT\n\/\/ code profiling.\nclass JITCodeLineInfo {\n public:\n JITCodeLineInfo() { }\n\n void SetPosition(intptr_t pc, int pos) {\n AddCodeLineInfo(LineNumInfo(pc, pos));\n }\n\n struct LineNumInfo {\n LineNumInfo(intptr_t pc, int pos)\n : pc_(pc), pos_(pos) { }\n\n intptr_t pc_;\n int pos_;\n };\n\n std::list<LineNumInfo>* GetLineNumInfo() {\n return &line_num_info_;\n }\n\n private:\n void AddCodeLineInfo(const LineNumInfo& line_info) {\n\t line_num_info_.push_back(line_info);\n }\n std::list<LineNumInfo> line_num_info_;\n};\n\nstruct SameCodeObjects {\n bool operator () (void* key1, void* key2) const {\n return key1 == key2;\n }\n};\n\nstruct HashForCodeObject {\n uint32_t operator () (void* code) const {\n static const uintptr_t kGoldenRatio = 2654435761u;\n uintptr_t hash = reinterpret_cast<uintptr_t>(code);\n return static_cast<uint32_t>(hash * kGoldenRatio);\n }\n};\n\n#ifdef WIN32\ntypedef hash_map<void*, void*> JitInfoMap;\n#else\ntypedef hash_map<void*, void*, HashForCodeObject, SameCodeObjects> JitInfoMap;\n#endif\n\nstatic JitInfoMap* GetEntries() {\n static JitInfoMap* entries;\n if (entries == NULL) {\n entries = new JitInfoMap();\n }\n return entries;\n}\n\nstatic bool IsLineInfoTagged(void* ptr) {\n return 0 != (reinterpret_cast<intptr_t>(ptr));\n}\n\nstatic JITCodeLineInfo* UntagLineInfo(void* ptr) {\n return reinterpret_cast<JITCodeLineInfo*>(\n reinterpret_cast<intptr_t>(ptr));\n}\n\n\/\/ The parameter str is a mixed pattern which contains the\n\/\/ function name and some other info. It comes from all the\n\/\/ Logger::CodeCreateEvent(...) function. This funtion get the\n\/\/ pure function name from the input parameter.\nstatic char* GetFunctionNameFromMixedName(const char* str, int length) {\n int index = 0;\n int count = 0;\n char* start_ptr = NULL;\n\n while (str[index++] != ':' && (index < length)) {}\n\n if (str[index] == '*' || str[index] == '~' ) index++;\n if (index >= length) return NULL;\n\n start_ptr = const_cast<char*>(str + index);\n\n while (index < length && str[index++] != ' ') {\n count++;\n }\n\n char* result = new char[count + 1];\n memcpy(result, start_ptr, count);\n result[count] = '\\0';\n\n return result;\n}\n\n\/\/ The JitCodeEventHandler for Vtune.\nvoid VTUNEJITInterface::event_handler(const v8::JitCodeEvent* event) {\n if (VTUNERUNNING && event != NULL) {\n switch (event->type) {\n case v8::JitCodeEvent::CODE_ADDED: {\n char* temp_file_name = NULL;\n char* temp_method_name =\n GetFunctionNameFromMixedName(event->name.str,\n static_cast<int>(event->name.len));\n iJIT_Method_Load jmethod;\n memset(&jmethod, 0, sizeof jmethod);\n jmethod.method_id = iJIT_GetNewMethodID();\n jmethod.method_load_address = event->code_start;\n jmethod.method_size = static_cast<unsigned int>(event->code_len);\n jmethod.method_name = temp_method_name;\n\n Handle<Script> script = event->script;\n\t\t\n if (*script != NULL) {\n \/\/ Get the source file name and set it to jmethod.source_file_name\n if ((*script->GetScriptName())->IsString()) {\n Handle<String> script_name =\n Handle<String>(String::Cast(*script->GetScriptName()));\n temp_file_name = new char[script_name->Utf8Length() + 1];\n script_name->WriteUtf8(temp_file_name);\n jmethod.source_file_name = temp_file_name;\n }\n\n JitInfoMap::iterator entry =\n GetEntries()->find(event->code_start);\n if (entry != GetEntries()->end() && IsLineInfoTagged(entry->first)) {\n JITCodeLineInfo* line_info = UntagLineInfo(entry->second);\n \/\/ Get the line_num_info and set it to jmethod.line_number_table\n std::list<JITCodeLineInfo::LineNumInfo>* vtunelineinfo =\n line_info->GetLineNumInfo();\n\n jmethod.line_number_size = (unsigned int)vtunelineinfo->size();\n jmethod.line_number_table =\n reinterpret_cast<LineNumberInfo*>(\n malloc(sizeof(LineNumberInfo)*jmethod.line_number_size));\n\n std::list<JITCodeLineInfo::LineNumInfo>::iterator Iter;\n int index = 0;\n for (Iter = vtunelineinfo->begin();\n Iter != vtunelineinfo->end();\n Iter++) {\n jmethod.line_number_table[index].Offset =\n static_cast<unsigned int>(Iter->pc_);\n jmethod.line_number_table[index++].LineNumber =\n\t\t\t\t script->GetLineNumber(Iter->pos_)+1;\n }\n GetEntries()->erase(event->code_start);\n }\n } \n\n iJIT_NotifyEvent(iJVM_EVENT_TYPE_METHOD_LOAD_FINISHED,\n reinterpret_cast<void*>(&jmethod));\n if (temp_method_name)\n delete []temp_method_name;\n if (temp_file_name)\n delete []temp_file_name;\n break;\n }\n \/\/ TODO(chunyang.dai@intel.com): code_move will be supported.\n case v8::JitCodeEvent::CODE_MOVED:\n break;\n \/\/ Currently the CODE_REMOVED event is not issued.\n case v8::JitCodeEvent::CODE_REMOVED:\n break;\n case v8::JitCodeEvent::CODE_ADD_LINE_POS_INFO: {\n JITCodeLineInfo* line_info =\n reinterpret_cast<JITCodeLineInfo*>(event->user_data);\n if (line_info != NULL) {\n line_info->SetPosition(static_cast<intptr_t>(event->line_info.offset),\n static_cast<int>(event->line_info.pos));\n }\n break;\n }\n case v8::JitCodeEvent::CODE_START_LINE_INFO_RECORDING: {\n v8::JitCodeEvent* temp_event = const_cast<v8::JitCodeEvent*>(event);\n temp_event->user_data = new JITCodeLineInfo();\n break;\n }\n case v8::JitCodeEvent::CODE_END_LINE_INFO_RECORDING: {\n GetEntries()->insert(std::pair <void*, void*>(event->code_start, event->user_data));\n break;\n } \n default:\n break;\n }\n } \n return;\n}\n\n} \/\/ namespace internal\n\nvoid InitilizeVtuneForV8() {\n if (v8::V8::Initialize()) {\n v8::V8::SetFlagsFromString(\"--nocompact_code_space\",\n (int)strlen(\"--nocompact_code_space\"));\n v8::V8::SetJitCodeEventHandler(v8::kJitCodeEventDefault,\n vTune::internal::VTUNEJITInterface::event_handler);\n }\n}\n\n} \/\/ namespace vTune\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/json\/topojson_grammar.hpp>\n\nnamespace mapnik { namespace topojson {\n\nnamespace qi = boost::spirit::qi;\nnamespace phoenix = boost::phoenix;\nnamespace fusion = boost::fusion;\n\ntemplate <typename Iterator, typename ErrorHandler>\ntopojson_grammar<Iterator, ErrorHandler>::topojson_grammar()\n : topojson_grammar::base_type(topology, \"topojson\")\n{\n qi::lit_type lit;\n qi::double_type double_;\n qi::int_type int_;\n qi::omit_type omit;\n qi::_val_type _val;\n qi::_1_type _1;\n qi::_2_type _2;\n qi::_3_type _3;\n qi::_4_type _4;\n qi::_r1_type _r1;\n using qi::fail;\n using qi::on_error;\n using phoenix::push_back;\n using phoenix::construct;\n \/\/ generic json types\n json_.value = json_.object | json_.array | json_.string_ | json_.number\n ;\n\n json_.pairs = json_.key_value % lit(',')\n ;\n\n json_.key_value = (json_.string_ >> lit(':') >> json_.value)\n ;\n\n json_.object = lit('{') >> *json_.pairs >> lit('}')\n ;\n\n json_.array = lit('[')\n >> json_.value >> *(lit(',') >> json_.value)\n >> lit(']')\n ;\n\n json_.number = json_.strict_double[_val = json_.double_converter(_1)]\n | json_.int__[_val = json_.integer_converter(_1)]\n | lit(\"true\")[_val = true]\n | lit(\"false\")[_val = false]\n | lit(\"null\")[_val = construct<value_null>()]\n ;\n\n \/\/ topo json\n topology = lit('{') >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Topology\\\"\")\n >> ( (lit(',') >> objects) ^ ( lit(',') >> arcs) ^ (lit(',') >> transform) ^ (lit(',') >> bbox))\n >> lit('}')\n ;\n\n transform = lit(\"\\\"transform\\\"\") >> lit(':') >> lit('{')\n >> lit(\"\\\"scale\\\"\") >> lit(':')\n >> lit('[')\n >> double_ >> lit(',')\n >> double_ >> lit(']') >> lit(',')\n >> lit(\"\\\"translate\\\"\") >> lit(':')\n >> lit('[') >> double_ >> lit(',') >> double_ >> lit(']')\n >> lit('}')\n ;\n\n bbox = lit(\"\\\"bbox\\\"\") >> lit(':')\n >> lit('[') >> double_ >> lit(',') >> double_\n >> lit(',') >> double_ >> lit(',') >> double_\n >> lit(']')\n ;\n\n objects = lit(\"\\\"objects\\\"\")\n >> lit(':')\n >> lit('{')\n >> -((omit[json_.string_]\n >> lit(':')\n >> (geometry_collection(_val) | geometry)) % lit(','))\n >> lit('}')\n ;\n\n geometry =\n point |\n linestring |\n polygon |\n multi_point |\n multi_linestring |\n multi_polygon |\n omit[json_.object]\n ;\n\n geometry_collection = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"GeometryCollection\\\"\") >> lit(',')\n >> lit(\"\\\"geometries\\\"\") >> lit(':') >> lit('[') >> -(geometry[push_back(_r1, _1)] % lit(','))\n >> lit(']')\n >> lit('}')\n ;\n point = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Point\\\"\")\n >> ((lit(',') >> lit(\"\\\"coordinates\\\"\") >> lit(':') >> coordinate)\n ^ (lit(',') >> properties) \/*^ (lit(',') >> omit[id])*\/)\n >> lit('}')\n ;\n\n multi_point = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiPoint\\\"\")\n >> ((lit(',') >> lit(\"\\\"coordinates\\\"\") >> lit(':')\n >> lit('[') >> -(coordinate % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n linestring = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"LineString\\\"\")\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':') >> lit('[') >> int_ >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n multi_linestring = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiLineString\\\"\")\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':') >> lit('[')\n >> -((lit('[') >> int_ >> lit(']')) % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n polygon = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Polygon\\\"\")\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[') >> -(ring % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n multi_polygon = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiPolygon\\\"\")\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[')\n >> -((lit('[') >> -(ring % lit(',')) >> lit(']')) % lit(','))\n >> lit(']')) ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n id = lit(\"\\\"id\\\"\") >> lit(':') >> omit[json_.value]\n ;\n\n ring = lit('[') >> -(int_ % lit(',')) >> lit(']')\n ;\n\n properties = lit(\"\\\"properties\\\"\")\n >> lit(':')\n >> (( lit('{') >> attributes >> lit('}')) | json_.object)\n ;\n\n attributes = (json_.string_ >> lit(':') >> attribute_value) % lit(',')\n ;\n\n attribute_value %= json_.number | json_.string_ ;\n\n arcs = lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[') >> -( arc % lit(',')) >> lit(']') ;\n\n arc = lit('[') >> -(coordinate % lit(',')) >> lit(']') ;\n\n coordinate = lit('[') >> double_ >> lit(',') >> double_ >> lit(']');\n\n topology.name(\"topology\");\n transform.name(\"transform\");\n objects.name(\"objects\");\n arc.name(\"arc\");\n arcs.name(\"arcs\");\n json_.value.name(\"value\");\n coordinate.name(\"coordinate\");\n\n point.name(\"point\");\n multi_point.name(\"multi_point\");\n linestring.name(\"linestring\");\n polygon.name(\"polygon\");\n multi_polygon.name(\"multi_polygon\");\n geometry_collection.name(\"geometry_collection\");\n \/\/ error handler\n on_error<fail>(topology, error_handler(_1, _2, _3, _4));\n}\n\n}}\n<commit_msg>topojson grammar - add optional bbox element which is omitted<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#include <mapnik\/json\/topojson_grammar.hpp>\n\nnamespace mapnik { namespace topojson {\n\nnamespace qi = boost::spirit::qi;\nnamespace phoenix = boost::phoenix;\nnamespace fusion = boost::fusion;\n\ntemplate <typename Iterator, typename ErrorHandler>\ntopojson_grammar<Iterator, ErrorHandler>::topojson_grammar()\n : topojson_grammar::base_type(topology, \"topojson\")\n{\n qi::lit_type lit;\n qi::double_type double_;\n qi::int_type int_;\n qi::omit_type omit;\n qi::_val_type _val;\n qi::_1_type _1;\n qi::_2_type _2;\n qi::_3_type _3;\n qi::_4_type _4;\n qi::_r1_type _r1;\n using qi::fail;\n using qi::on_error;\n using phoenix::push_back;\n using phoenix::construct;\n \/\/ generic json types\n json_.value = json_.object | json_.array | json_.string_ | json_.number\n ;\n\n json_.pairs = json_.key_value % lit(',')\n ;\n\n json_.key_value = (json_.string_ >> lit(':') >> json_.value)\n ;\n\n json_.object = lit('{') >> *json_.pairs >> lit('}')\n ;\n\n json_.array = lit('[')\n >> json_.value >> *(lit(',') >> json_.value)\n >> lit(']')\n ;\n\n json_.number = json_.strict_double[_val = json_.double_converter(_1)]\n | json_.int__[_val = json_.integer_converter(_1)]\n | lit(\"true\")[_val = true]\n | lit(\"false\")[_val = false]\n | lit(\"null\")[_val = construct<value_null>()]\n ;\n\n \/\/ topo json\n topology = lit('{') >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Topology\\\"\")\n >> ( (lit(',') >> objects) ^ ( lit(',') >> arcs) ^ (lit(',') >> transform) ^ (lit(',') >> bbox))\n >> lit('}')\n ;\n\n transform = lit(\"\\\"transform\\\"\") >> lit(':') >> lit('{')\n >> lit(\"\\\"scale\\\"\") >> lit(':')\n >> lit('[')\n >> double_ >> lit(',')\n >> double_ >> lit(']') >> lit(',')\n >> lit(\"\\\"translate\\\"\") >> lit(':')\n >> lit('[') >> double_ >> lit(',') >> double_ >> lit(']')\n >> lit('}')\n ;\n\n bbox = lit(\"\\\"bbox\\\"\") >> lit(':')\n >> lit('[') >> double_ >> lit(',') >> double_\n >> lit(',') >> double_ >> lit(',') >> double_\n >> lit(']')\n ;\n\n objects = lit(\"\\\"objects\\\"\")\n >> lit(':')\n >> lit('{')\n >> -((omit[json_.string_]\n >> lit(':')\n >> (geometry_collection(_val) | geometry)) % lit(','))\n >> lit('}')\n ;\n\n geometry =\n point |\n linestring |\n polygon |\n multi_point |\n multi_linestring |\n multi_polygon |\n omit[json_.object]\n ;\n\n geometry_collection = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"GeometryCollection\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> lit(',') >> lit(\"\\\"geometries\\\"\") >> lit(':') >> lit('[') >> -(geometry[push_back(_r1, _1)] % lit(','))\n >> lit(']')\n >> lit('}')\n ;\n point = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Point\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> ((lit(',') >> lit(\"\\\"coordinates\\\"\") >> lit(':') >> coordinate)\n ^ (lit(',') >> properties) \/*^ (lit(',') >> omit[id])*\/)\n >> lit('}')\n ;\n\n multi_point = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiPoint\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> ((lit(',') >> lit(\"\\\"coordinates\\\"\") >> lit(':')\n >> lit('[') >> -(coordinate % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n linestring = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"LineString\\\"\")\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':') >> lit('[') >> int_ >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n multi_linestring = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiLineString\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':') >> lit('[')\n >> -((lit('[') >> int_ >> lit(']')) % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n polygon = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"Polygon\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[') >> -(ring % lit(',')) >> lit(']'))\n ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n multi_polygon = lit('{')\n >> lit(\"\\\"type\\\"\") >> lit(':') >> lit(\"\\\"MultiPolygon\\\"\")\n >> -(lit(',') >> omit[bbox])\n >> ((lit(',') >> lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[')\n >> -((lit('[') >> -(ring % lit(',')) >> lit(']')) % lit(','))\n >> lit(']')) ^ (lit(',') >> properties) ^ (lit(',') >> omit[id]))\n >> lit('}')\n ;\n\n id = lit(\"\\\"id\\\"\") >> lit(':') >> omit[json_.value]\n ;\n\n ring = lit('[') >> -(int_ % lit(',')) >> lit(']')\n ;\n\n properties = lit(\"\\\"properties\\\"\")\n >> lit(':')\n >> (( lit('{') >> attributes >> lit('}')) | json_.object)\n ;\n\n attributes = (json_.string_ >> lit(':') >> attribute_value) % lit(',')\n ;\n\n attribute_value %= json_.number | json_.string_ ;\n\n arcs = lit(\"\\\"arcs\\\"\") >> lit(':')\n >> lit('[') >> -( arc % lit(',')) >> lit(']') ;\n\n arc = lit('[') >> -(coordinate % lit(',')) >> lit(']') ;\n\n coordinate = lit('[') >> double_ >> lit(',') >> double_ >> lit(']');\n\n topology.name(\"topology\");\n transform.name(\"transform\");\n objects.name(\"objects\");\n arc.name(\"arc\");\n arcs.name(\"arcs\");\n json_.value.name(\"value\");\n coordinate.name(\"coordinate\");\n\n point.name(\"point\");\n multi_point.name(\"multi_point\");\n linestring.name(\"linestring\");\n polygon.name(\"polygon\");\n multi_polygon.name(\"multi_polygon\");\n geometry_collection.name(\"geometry_collection\");\n \/\/ error handler\n on_error<fail>(topology, error_handler(_1, _2, _3, _4));\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2010-2015 Joshua Boyce\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <fstream>\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n\r\n#include <windows.h>\r\n#include <shlwapi.h>\r\n\r\n#include <hadesmem\/config.hpp>\r\n#include <hadesmem\/error.hpp>\r\n#include <hadesmem\/detail\/self_path.hpp>\r\n#include <hadesmem\/detail\/smart_handle.hpp>\r\n#include <hadesmem\/detail\/str_conv.hpp>\r\n\r\n#define HADESMEM_PATHCCH_ALLOW_LONG_PATHS 0x00000001\r\n\r\nnamespace hadesmem\r\n{\r\nnamespace detail\r\n{\r\ntemplate <typename CharT>\r\ninline std::unique_ptr<std::basic_fstream<CharT>>\r\n OpenFile(std::wstring const& path, std::ios_base::openmode mode)\r\n{\r\n return std::unique_ptr<std::basic_fstream<CharT>>{\r\n new std::basic_fstream<CharT>{path, mode}};\r\n}\r\n\r\ninline bool DoesFileExist(std::wstring const& path)\r\n{\r\n return ::GetFileAttributesW(path.c_str()) != INVALID_FILE_ATTRIBUTES;\r\n}\r\n\r\ninline bool DoesDirectoryExist(std::wstring const& path)\r\n{\r\n auto const attrs = ::GetFileAttributesW(path.c_str());\r\n return attrs != INVALID_FILE_ATTRIBUTES && (attrs & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\ninline bool IsPathRelative(std::wstring const& path)\r\n{\r\n \/\/ Relative paths are always limited to a total of MAX_PATH characters\r\n return (path.size() >= MAX_PATH) ? false : !!::PathIsRelativeW(path.c_str());\r\n}\r\n\r\ninline std::wstring CombinePath(std::wstring const& base,\r\n std::wstring const& append)\r\n{\r\n \/\/ Use newer and better PathCchCombineEx if it's available.\r\n detail::SmartModuleHandle const path_mod{\r\n LoadLibraryW(L\"api-ms-win-core-path-l1-1-0.dll\")};\r\n if (path_mod.IsValid())\r\n {\r\n using PathCchCombineExFn = HRESULT(WINAPI*)(PWSTR pszPathOut,\r\n size_t cchPathOut,\r\n PCWSTR pszPathIn,\r\n PCWSTR pszMore,\r\n unsigned long dwFlags);\r\n auto const path_cch_combine_ex = reinterpret_cast<PathCchCombineExFn>(\r\n GetProcAddress(path_mod.GetHandle(), \"PathCchCombineEx\"));\r\n if (path_cch_combine_ex)\r\n {\r\n std::vector<wchar_t> buffer(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n HRESULT const hr = path_cch_combine_ex(buffer.data(),\r\n buffer.size(),\r\n base.c_str(),\r\n append.c_str(),\r\n HADESMEM_PATHCCH_ALLOW_LONG_PATHS);\r\n if (!SUCCEEDED(hr))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"PathCchCombineEx failed.\"}\r\n << ErrorCodeWinHr{hr});\r\n }\r\n\r\n return buffer.data();\r\n }\r\n }\r\n\r\n \/\/ Fall back to older API with MAX_PATH limit.\r\n std::vector<wchar_t> buffer(MAX_PATH);\r\n if (!::PathCombineW(buffer.data(), base.c_str(), append.c_str()))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathCombineW failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return buffer.data();\r\n}\r\n\r\ninline SmartFileHandle OpenFileForMetadata(std::wstring const& path)\r\n{\r\n HANDLE const file =\r\n ::CreateFileW(path.c_str(),\r\n GENERIC_READ,\r\n FILE_SHARE_DELETE | FILE_SHARE_READ | FILE_SHARE_WRITE,\r\n nullptr,\r\n OPEN_EXISTING,\r\n FILE_FLAG_BACKUP_SEMANTICS,\r\n nullptr);\r\n if (file == INVALID_HANDLE_VALUE)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{} << ErrorString{\"CreateFile failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return SmartFileHandle(file);\r\n}\r\n\r\ninline BY_HANDLE_FILE_INFORMATION GetFileInformationByHandle(HANDLE file)\r\n{\r\n BY_HANDLE_FILE_INFORMATION file_info{};\r\n if (!::GetFileInformationByHandle(file, &file_info))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"GetFileInformationByHandle failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return file_info;\r\n}\r\n\r\ninline bool ArePathsEquivalent(std::wstring const& left,\r\n std::wstring const& right)\r\n{\r\n SmartFileHandle const left_file{OpenFileForMetadata(left)};\r\n SmartFileHandle const right_file{OpenFileForMetadata(right)};\r\n BY_HANDLE_FILE_INFORMATION left_file_info =\r\n GetFileInformationByHandle(left_file.GetHandle());\r\n BY_HANDLE_FILE_INFORMATION right_file_info =\r\n GetFileInformationByHandle(right_file.GetHandle());\r\n return left_file_info.dwVolumeSerialNumber ==\r\n right_file_info.dwVolumeSerialNumber &&\r\n left_file_info.nFileIndexHigh == right_file_info.nFileIndexHigh &&\r\n left_file_info.nFileIndexLow == right_file_info.nFileIndexLow &&\r\n left_file_info.nFileSizeHigh == right_file_info.nFileSizeHigh &&\r\n left_file_info.nFileSizeLow == right_file_info.nFileSizeLow &&\r\n left_file_info.ftLastWriteTime.dwLowDateTime ==\r\n right_file_info.ftLastWriteTime.dwLowDateTime &&\r\n left_file_info.ftLastWriteTime.dwHighDateTime ==\r\n right_file_info.ftLastWriteTime.dwHighDateTime;\r\n}\r\n\r\ninline std::wstring GetRootPath(std::wstring const& path)\r\n{\r\n int const drive_num = ::PathGetDriveNumberW(path.c_str());\r\n if (drive_num == -1)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathGetDriveNumber failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n std::vector<wchar_t> drive_path(4);\r\n ::PathBuildRootW(drive_path.data(), drive_num);\r\n if (drive_path[0] == L'\\0' || drive_path[1] == L'\\0' ||\r\n drive_path[2] == L'\\0')\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathBuildRoot failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return drive_path.data();\r\n}\r\n\r\ninline DWORD GetFileAttributesWrapper(std::wstring const& path)\r\n{\r\n DWORD const attributes = ::GetFileAttributesW(path.c_str());\r\n if (attributes == INVALID_FILE_ATTRIBUTES)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"GetFileAttributes failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return attributes;\r\n}\r\n\r\ninline void CreateDirectoryWrapper(std::wstring const& path)\r\n{\r\n if (!CreateDirectoryW(path.c_str(), nullptr))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"CreateDirectory failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n}\r\n\r\ninline void CopyFileWrapper(std::wstring const& existing_path,\r\n std::wstring const& new_path,\r\n bool fail_if_exists)\r\n{\r\n if (!CopyFileW(existing_path.c_str(), new_path.c_str(), fail_if_exists))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{} << ErrorString{\"CopyFile failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n}\r\n\r\ninline bool IsDirectory(std::wstring const& path)\r\n{\r\n DWORD const attributes =\r\n ::hadesmem::detail::GetFileAttributesWrapper(path.c_str());\r\n return !!(attributes & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\ninline bool IsSymlink(std::wstring const& path)\r\n{\r\n DWORD const attributes =\r\n ::hadesmem::detail::GetFileAttributesWrapper(path.c_str());\r\n return !!(attributes & FILE_ATTRIBUTE_REPARSE_POINT);\r\n}\r\n\r\ninline std::wstring GetFullPathNameWrapper(std::wstring const& path)\r\n{\r\n std::vector<wchar_t> full_path(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n DWORD len = GetFullPathNameW(path.c_str(),\r\n static_cast<DWORD>(full_path.size()),\r\n full_path.data(),\r\n nullptr);\r\n if (!len || full_path.size() < len)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"GetFullPathNameW failed.\"}\r\n << ErrorCodeWinLast{last_error} << ErrorCodeWinOther{len});\r\n }\r\n\r\n return full_path.data();\r\n}\r\n\r\ninline std::wstring GetPathBaseName(std::wstring const& path)\r\n{\r\n return std::wstring(std::find_if(path.rbegin(),\r\n path.rend(),\r\n [](wchar_t c)\r\n {\r\n return c == '\\\\' || c == '\/';\r\n }).base(),\r\n path.end());\r\n}\r\n\r\ninline std::wstring PathFindFileNameWrapper(std::wstring const& path)\r\n{\r\n std::vector<wchar_t> file_name(MAX_PATH);\r\n auto const p = PathFindFileNameW(path.c_str());\r\n if (p == path.c_str())\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathFindFileNameW failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return file_name.data();\r\n}\r\n\r\ninline std::wstring MakeExtendedPath(std::wstring path)\r\n{\r\n \/\/ Use newer and better PathCchCanonicalizeEx if it's available, then fall\r\n \/\/ through to the custom implementation to ensure we always get an extended\r\n \/\/ path back out, rather than just when it's longer than MAX_PATH.\r\n detail::SmartModuleHandle const path_mod{\r\n LoadLibraryW(L\"api-ms-win-core-path-l1-1-0.dll\")};\r\n if (path_mod.IsValid())\r\n {\r\n using PathCchCanonicalizeExFn = HRESULT(WINAPI*)(PWSTR pszPathOut,\r\n size_t cchPathOut,\r\n PCWSTR pszPathIn,\r\n unsigned long dwFlags);\r\n auto const path_cch_combine_ex = reinterpret_cast<PathCchCanonicalizeExFn>(\r\n GetProcAddress(path_mod.GetHandle(), \"PathCchCanonicalizeEx\"));\r\n if (path_cch_combine_ex)\r\n {\r\n std::vector<wchar_t> buffer(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n HRESULT const hr = path_cch_combine_ex(buffer.data(),\r\n buffer.size(),\r\n path.c_str(),\r\n HADESMEM_PATHCCH_ALLOW_LONG_PATHS);\r\n if (!SUCCEEDED(hr))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"PathCchCanonicalizeEx failed.\"}\r\n << ErrorCodeWinHr{hr});\r\n }\r\n\r\n path = buffer.data();\r\n }\r\n }\r\n\r\n \/\/ Modified code from http:\/\/bit.ly\/1int3Iv.\r\n if (path.compare(0, 2, L\"\\\\\\\\\"))\r\n {\r\n if (hadesmem::detail::IsPathRelative(path))\r\n {\r\n \/\/ ..\\foo\\bar\r\n return MakeExtendedPath(hadesmem::detail::CombinePath(\r\n hadesmem::detail::GetSelfDirPath(), path));\r\n }\r\n else\r\n {\r\n if (path.compare(0, 1, L\"\\\\\"))\r\n {\r\n \/\/ c:\\foo\\bar\r\n return L\"\\\\\\\\?\\\\\" + path;\r\n }\r\n else\r\n {\r\n \/\/ \\foo\\bar\r\n return MakeExtendedPath(hadesmem::detail::GetFullPathNameWrapper(path));\r\n }\r\n }\r\n }\r\n else\r\n {\r\n if (path.compare(0, 3, L\"\\\\\\\\?\"))\r\n {\r\n \/\/ \\\\server\\share\\folder\r\n return L\"\\\\\\\\?\\\\UNC\\\\\" + path.substr(2);\r\n }\r\n else\r\n {\r\n \/\/ \\\\?\\c:\\foo\\bar\r\n return path;\r\n }\r\n }\r\n}\r\n\r\ninline void BufferToFile(std::wstring const& path,\r\n void const* buffer,\r\n std::streamsize len)\r\n{\r\n auto const file = OpenFile<char>(path, std::ios::out | std::ios::binary);\r\n if (!*file)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to create file.\"});\r\n }\r\n\r\n if (!file->write(static_cast<char const*>(buffer), len))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to write file.\"});\r\n }\r\n}\r\n\r\ninline std::vector<char> FileToBuffer(std::wstring const& path)\r\n{\r\n auto const file =\r\n OpenFile<char>(path, std::ios::in | std::ios::binary | std::ios::ate);\r\n if (!*file)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to create file.\"});\r\n }\r\n\r\n std::streampos const size = file->tellg();\r\n if (size <= 0)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error() << hadesmem::ErrorString(\"Empty or invalid file.\"));\r\n }\r\n\r\n if (!file->seekg(0, std::ios::beg))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(hadesmem::Error() << hadesmem::ErrorString(\r\n \"Seeking to beginning of file failed.\"));\r\n }\r\n\r\n std::vector<char> buffer(static_cast<std::size_t>(size));\r\n if (!file->read(buffer.data(), static_cast<std::streamsize>(size)))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to write file.\"});\r\n }\r\n\r\n return buffer;\r\n}\r\n}\r\n}\r\n<commit_msg>[Filesystem] Support not throwing when the directory already exists.<commit_after>\/\/ Copyright (C) 2010-2015 Joshua Boyce\r\n\/\/ See the file COPYING for copying permission.\r\n\r\n#pragma once\r\n\r\n#include <fstream>\r\n#include <memory>\r\n#include <string>\r\n#include <vector>\r\n\r\n#include <windows.h>\r\n#include <shlwapi.h>\r\n\r\n#include <hadesmem\/config.hpp>\r\n#include <hadesmem\/error.hpp>\r\n#include <hadesmem\/detail\/self_path.hpp>\r\n#include <hadesmem\/detail\/smart_handle.hpp>\r\n#include <hadesmem\/detail\/str_conv.hpp>\r\n\r\n#define HADESMEM_PATHCCH_ALLOW_LONG_PATHS 0x00000001\r\n\r\nnamespace hadesmem\r\n{\r\nnamespace detail\r\n{\r\ntemplate <typename CharT>\r\ninline std::unique_ptr<std::basic_fstream<CharT>>\r\n OpenFile(std::wstring const& path, std::ios_base::openmode mode)\r\n{\r\n return std::unique_ptr<std::basic_fstream<CharT>>{\r\n new std::basic_fstream<CharT>{path, mode}};\r\n}\r\n\r\ninline bool DoesFileExist(std::wstring const& path)\r\n{\r\n return ::GetFileAttributesW(path.c_str()) != INVALID_FILE_ATTRIBUTES;\r\n}\r\n\r\ninline bool DoesDirectoryExist(std::wstring const& path)\r\n{\r\n auto const attrs = ::GetFileAttributesW(path.c_str());\r\n return attrs != INVALID_FILE_ATTRIBUTES && (attrs & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\ninline bool IsPathRelative(std::wstring const& path)\r\n{\r\n \/\/ Relative paths are always limited to a total of MAX_PATH characters\r\n return (path.size() >= MAX_PATH) ? false : !!::PathIsRelativeW(path.c_str());\r\n}\r\n\r\ninline std::wstring CombinePath(std::wstring const& base,\r\n std::wstring const& append)\r\n{\r\n \/\/ Use newer and better PathCchCombineEx if it's available.\r\n detail::SmartModuleHandle const path_mod{\r\n LoadLibraryW(L\"api-ms-win-core-path-l1-1-0.dll\")};\r\n if (path_mod.IsValid())\r\n {\r\n using PathCchCombineExFn = HRESULT(WINAPI*)(PWSTR pszPathOut,\r\n size_t cchPathOut,\r\n PCWSTR pszPathIn,\r\n PCWSTR pszMore,\r\n unsigned long dwFlags);\r\n auto const path_cch_combine_ex = reinterpret_cast<PathCchCombineExFn>(\r\n GetProcAddress(path_mod.GetHandle(), \"PathCchCombineEx\"));\r\n if (path_cch_combine_ex)\r\n {\r\n std::vector<wchar_t> buffer(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n HRESULT const hr = path_cch_combine_ex(buffer.data(),\r\n buffer.size(),\r\n base.c_str(),\r\n append.c_str(),\r\n HADESMEM_PATHCCH_ALLOW_LONG_PATHS);\r\n if (!SUCCEEDED(hr))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"PathCchCombineEx failed.\"}\r\n << ErrorCodeWinHr{hr});\r\n }\r\n\r\n return buffer.data();\r\n }\r\n }\r\n\r\n \/\/ Fall back to older API with MAX_PATH limit.\r\n std::vector<wchar_t> buffer(MAX_PATH);\r\n if (!::PathCombineW(buffer.data(), base.c_str(), append.c_str()))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathCombineW failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return buffer.data();\r\n}\r\n\r\ninline SmartFileHandle OpenFileForMetadata(std::wstring const& path)\r\n{\r\n HANDLE const file =\r\n ::CreateFileW(path.c_str(),\r\n GENERIC_READ,\r\n FILE_SHARE_DELETE | FILE_SHARE_READ | FILE_SHARE_WRITE,\r\n nullptr,\r\n OPEN_EXISTING,\r\n FILE_FLAG_BACKUP_SEMANTICS,\r\n nullptr);\r\n if (file == INVALID_HANDLE_VALUE)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{} << ErrorString{\"CreateFile failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return SmartFileHandle(file);\r\n}\r\n\r\ninline BY_HANDLE_FILE_INFORMATION GetFileInformationByHandle(HANDLE file)\r\n{\r\n BY_HANDLE_FILE_INFORMATION file_info{};\r\n if (!::GetFileInformationByHandle(file, &file_info))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"GetFileInformationByHandle failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return file_info;\r\n}\r\n\r\ninline bool ArePathsEquivalent(std::wstring const& left,\r\n std::wstring const& right)\r\n{\r\n SmartFileHandle const left_file{OpenFileForMetadata(left)};\r\n SmartFileHandle const right_file{OpenFileForMetadata(right)};\r\n BY_HANDLE_FILE_INFORMATION left_file_info =\r\n GetFileInformationByHandle(left_file.GetHandle());\r\n BY_HANDLE_FILE_INFORMATION right_file_info =\r\n GetFileInformationByHandle(right_file.GetHandle());\r\n return left_file_info.dwVolumeSerialNumber ==\r\n right_file_info.dwVolumeSerialNumber &&\r\n left_file_info.nFileIndexHigh == right_file_info.nFileIndexHigh &&\r\n left_file_info.nFileIndexLow == right_file_info.nFileIndexLow &&\r\n left_file_info.nFileSizeHigh == right_file_info.nFileSizeHigh &&\r\n left_file_info.nFileSizeLow == right_file_info.nFileSizeLow &&\r\n left_file_info.ftLastWriteTime.dwLowDateTime ==\r\n right_file_info.ftLastWriteTime.dwLowDateTime &&\r\n left_file_info.ftLastWriteTime.dwHighDateTime ==\r\n right_file_info.ftLastWriteTime.dwHighDateTime;\r\n}\r\n\r\ninline std::wstring GetRootPath(std::wstring const& path)\r\n{\r\n int const drive_num = ::PathGetDriveNumberW(path.c_str());\r\n if (drive_num == -1)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathGetDriveNumber failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n std::vector<wchar_t> drive_path(4);\r\n ::PathBuildRootW(drive_path.data(), drive_num);\r\n if (drive_path[0] == L'\\0' || drive_path[1] == L'\\0' ||\r\n drive_path[2] == L'\\0')\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathBuildRoot failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return drive_path.data();\r\n}\r\n\r\ninline DWORD GetFileAttributesWrapper(std::wstring const& path)\r\n{\r\n DWORD const attributes = ::GetFileAttributesW(path.c_str());\r\n if (attributes == INVALID_FILE_ATTRIBUTES)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"GetFileAttributes failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return attributes;\r\n}\r\n\r\ninline void CreateDirectoryWrapper(std::wstring const& path,\r\n bool fail_if_already_exists = true)\r\n{\r\n if (!CreateDirectoryW(path.c_str(), nullptr))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n if (!fail_if_already_exists && last_error == ERROR_ALREADY_EXISTS)\r\n {\r\n return;\r\n }\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"CreateDirectory failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n}\r\n\r\ninline void CopyFileWrapper(std::wstring const& existing_path,\r\n std::wstring const& new_path,\r\n bool fail_if_exists)\r\n{\r\n if (!CopyFileW(existing_path.c_str(), new_path.c_str(), fail_if_exists))\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{} << ErrorString{\"CopyFile failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n}\r\n\r\ninline bool IsDirectory(std::wstring const& path)\r\n{\r\n DWORD const attributes =\r\n ::hadesmem::detail::GetFileAttributesWrapper(path.c_str());\r\n return !!(attributes & FILE_ATTRIBUTE_DIRECTORY);\r\n}\r\n\r\ninline bool IsSymlink(std::wstring const& path)\r\n{\r\n DWORD const attributes =\r\n ::hadesmem::detail::GetFileAttributesWrapper(path.c_str());\r\n return !!(attributes & FILE_ATTRIBUTE_REPARSE_POINT);\r\n}\r\n\r\ninline std::wstring GetFullPathNameWrapper(std::wstring const& path)\r\n{\r\n std::vector<wchar_t> full_path(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n DWORD len = GetFullPathNameW(path.c_str(),\r\n static_cast<DWORD>(full_path.size()),\r\n full_path.data(),\r\n nullptr);\r\n if (!len || full_path.size() < len)\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"GetFullPathNameW failed.\"}\r\n << ErrorCodeWinLast{last_error} << ErrorCodeWinOther{len});\r\n }\r\n\r\n return full_path.data();\r\n}\r\n\r\ninline std::wstring GetPathBaseName(std::wstring const& path)\r\n{\r\n return std::wstring(std::find_if(path.rbegin(),\r\n path.rend(),\r\n [](wchar_t c)\r\n {\r\n return c == '\\\\' || c == '\/';\r\n }).base(),\r\n path.end());\r\n}\r\n\r\ninline std::wstring PathFindFileNameWrapper(std::wstring const& path)\r\n{\r\n std::vector<wchar_t> file_name(MAX_PATH);\r\n auto const p = PathFindFileNameW(path.c_str());\r\n if (p == path.c_str())\r\n {\r\n DWORD const last_error = ::GetLastError();\r\n HADESMEM_DETAIL_THROW_EXCEPTION(Error{}\r\n << ErrorString{\"PathFindFileNameW failed.\"}\r\n << ErrorCodeWinLast{last_error});\r\n }\r\n\r\n return file_name.data();\r\n}\r\n\r\ninline std::wstring MakeExtendedPath(std::wstring path)\r\n{\r\n \/\/ Use newer and better PathCchCanonicalizeEx if it's available, then fall\r\n \/\/ through to the custom implementation to ensure we always get an extended\r\n \/\/ path back out, rather than just when it's longer than MAX_PATH.\r\n detail::SmartModuleHandle const path_mod{\r\n LoadLibraryW(L\"api-ms-win-core-path-l1-1-0.dll\")};\r\n if (path_mod.IsValid())\r\n {\r\n using PathCchCanonicalizeExFn = HRESULT(WINAPI*)(PWSTR pszPathOut,\r\n size_t cchPathOut,\r\n PCWSTR pszPathIn,\r\n unsigned long dwFlags);\r\n auto const path_cch_combine_ex = reinterpret_cast<PathCchCanonicalizeExFn>(\r\n GetProcAddress(path_mod.GetHandle(), \"PathCchCanonicalizeEx\"));\r\n if (path_cch_combine_ex)\r\n {\r\n std::vector<wchar_t> buffer(HADESMEM_DETAIL_MAX_PATH_UNICODE);\r\n HRESULT const hr = path_cch_combine_ex(buffer.data(),\r\n buffer.size(),\r\n path.c_str(),\r\n HADESMEM_PATHCCH_ALLOW_LONG_PATHS);\r\n if (!SUCCEEDED(hr))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n Error{} << ErrorString{\"PathCchCanonicalizeEx failed.\"}\r\n << ErrorCodeWinHr{hr});\r\n }\r\n\r\n path = buffer.data();\r\n }\r\n }\r\n\r\n \/\/ Modified code from http:\/\/bit.ly\/1int3Iv.\r\n if (path.compare(0, 2, L\"\\\\\\\\\"))\r\n {\r\n if (hadesmem::detail::IsPathRelative(path))\r\n {\r\n \/\/ ..\\foo\\bar\r\n return MakeExtendedPath(hadesmem::detail::CombinePath(\r\n hadesmem::detail::GetSelfDirPath(), path));\r\n }\r\n else\r\n {\r\n if (path.compare(0, 1, L\"\\\\\"))\r\n {\r\n \/\/ c:\\foo\\bar\r\n return L\"\\\\\\\\?\\\\\" + path;\r\n }\r\n else\r\n {\r\n \/\/ \\foo\\bar\r\n return MakeExtendedPath(hadesmem::detail::GetFullPathNameWrapper(path));\r\n }\r\n }\r\n }\r\n else\r\n {\r\n if (path.compare(0, 3, L\"\\\\\\\\?\"))\r\n {\r\n \/\/ \\\\server\\share\\folder\r\n return L\"\\\\\\\\?\\\\UNC\\\\\" + path.substr(2);\r\n }\r\n else\r\n {\r\n \/\/ \\\\?\\c:\\foo\\bar\r\n return path;\r\n }\r\n }\r\n}\r\n\r\ninline void BufferToFile(std::wstring const& path,\r\n void const* buffer,\r\n std::streamsize len)\r\n{\r\n auto const file = OpenFile<char>(path, std::ios::out | std::ios::binary);\r\n if (!*file)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to create file.\"});\r\n }\r\n\r\n if (!file->write(static_cast<char const*>(buffer), len))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to write file.\"});\r\n }\r\n}\r\n\r\ninline std::vector<char> FileToBuffer(std::wstring const& path)\r\n{\r\n auto const file =\r\n OpenFile<char>(path, std::ios::in | std::ios::binary | std::ios::ate);\r\n if (!*file)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to create file.\"});\r\n }\r\n\r\n std::streampos const size = file->tellg();\r\n if (size <= 0)\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error() << hadesmem::ErrorString(\"Empty or invalid file.\"));\r\n }\r\n\r\n if (!file->seekg(0, std::ios::beg))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(hadesmem::Error() << hadesmem::ErrorString(\r\n \"Seeking to beginning of file failed.\"));\r\n }\r\n\r\n std::vector<char> buffer(static_cast<std::size_t>(size));\r\n if (!file->read(buffer.data(), static_cast<std::streamsize>(size)))\r\n {\r\n HADESMEM_DETAIL_THROW_EXCEPTION(\r\n hadesmem::Error{} << hadesmem::ErrorString{\"Failed to write file.\"});\r\n }\r\n\r\n return buffer;\r\n}\r\n}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ uatraits is a simple tool for user agent detection\n\/\/ Copyright (C) 2011 Yandex <highpower@yandex-team.ru>\n\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License\n\/\/ as published by the Free Software Foundation; either version 2\n\/\/ of the License, or (at your option) any later version.\n\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n#ifndef UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n#define UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n\n#include <list>\n#include <string>\n#include <cstdlib>\n#include <iostream>\n\n#include \"uatraits\/config.hpp\"\n#include \"uatraits\/details\/definition.hpp\"\n#include \"uatraits\/details\/pcre_utils.hpp\"\n#include \"uatraits\/details\/regex_utils.hpp\"\n\nnamespace uatraits { namespace details {\n\ntemplate <typename Traits>\nclass regex_definition : public definition<Traits> {\n\npublic:\n\tregex_definition(char const *name, char const *xpath, char const *pattern, char const *result);\n\tvirtual ~regex_definition();\n\n\tvirtual void dump(std::ostream &out) const;\n\tvirtual bool detect(char const *begin, char const *end, Traits &traits) const;\n\nprivate:\n\tregex_definition(regex_definition const &);\n\tregex_definition& operator = (regex_definition const &);\n\t\n\tusing definition<Traits>::name;\n\tusing definition<Traits>::xpath;\n\nprivate:\n\tstd::string replace_pattern_;\n\tstd::list<regex_data> replaces_;\n\tstd::pair<pcre*, pcre_extra*> regex_;\n};\n\ntemplate <typename Traits> inline \nregex_definition<Traits>::regex_definition(char const *name, char const *xpath, char const *pattern, char const *replace_pattern) :\n\tdefinition<Traits>(name, xpath), replace_pattern_(replace_pattern), regex_(0, 0)\n{\n\tint max = -1;\n\tregex_ = pcre_compile_regex(pattern);\n\tint res = pcre_fullinfo(regex_.first, regex_.second, PCRE_INFO_CAPTURECOUNT, &max);\n\tif (0 != res || -1 == max) {\n\t\tthrow error(\"can not get capture count from %s: %d\", pattern, res);\n\t}\n\tfind_replaces(replace_pattern_, replaces_);\n\tstd::size_t replace_count = replaces_.size();\n\tif (replace_count > static_cast<std::size_t>(max)) {\n\t \tthrow error(\"definition intended to replace more items (%llu) than it could capture in %s (%llu)\", \n\t \t static_cast<unsigned long long>(replace_count), pattern, static_cast<unsigned long long>(max));\n\t}\n}\n\ntemplate <typename Traits> inline\nregex_definition<Traits>::~regex_definition() {\n pcre_free_regex(regex_);\n}\n\ntemplate <typename Traits> inline void\nregex_definition<Traits>::dump(std::ostream &out) const {\n out << \"regex definition at [\" << xpath() << \"] triggered: setting \" << name() << \"=\" << replace_pattern_ << \" being substituted during detection\" << std::endl;\n}\n\ntemplate <typename Traits> inline bool\nregex_definition<Traits>::detect(char const *begin, char const *end, Traits &traits) const {\n\t\n\tstd::vector<int> match((replaces_.size() + 1) * 3, 0);\n\tint result = pcre_exec(regex_.first, regex_.second, begin, end - begin, 0, 0, &match[0], match.size());\n\tif (PCRE_ERROR_NOMATCH == result) {\n\t\treturn false;\n\t}\n\telse if (result < 0) {\n\t\tthrow error(\"error while regex matching: %d\", result);\n\t}\n\tif (static_cast<std::size_t>(result) != replaces_.size() + 1) {\n\t throw error(\"error while regex matching: captured %d while desired %d\", result - 1, replaces_.size());\n\t}\n\tstd::string temp(replace_pattern_);\n\tfor (std::list<regex_data>::const_reverse_iterator ri = replaces_.rbegin(), rend = replaces_.rend(); ri != rend; ++ri) {\n \ttemp.replace(temp.begin() + ri->begin, temp.begin() + ri->end, begin + match[2 * ri->index], begin + match[2 * ri->index + 1]);\n\t}\n\ttraits[name()] = temp;\n\treturn true;\n}\n\n}} \/\/ namespaces\n\n#endif \/\/ UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n\n<commit_msg>fixed wrong include directives again<commit_after>\/\/ uatraits is a simple tool for user agent detection\n\/\/ Copyright (C) 2011 Yandex <highpower@yandex-team.ru>\n\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License\n\/\/ as published by the Free Software Foundation; either version 2\n\/\/ of the License, or (at your option) any later version.\n\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n#ifndef UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n#define UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n\n#include <list>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <iostream>\n\n#include \"uatraits\/config.hpp\"\n#include \"uatraits\/details\/definition.hpp\"\n#include \"uatraits\/details\/pcre_utils.hpp\"\n#include \"uatraits\/details\/regex_utils.hpp\"\n\nnamespace uatraits { namespace details {\n\ntemplate <typename Traits>\nclass regex_definition : public definition<Traits> {\n\npublic:\n\tregex_definition(char const *name, char const *xpath, char const *pattern, char const *result);\n\tvirtual ~regex_definition();\n\n\tvirtual void dump(std::ostream &out) const;\n\tvirtual bool detect(char const *begin, char const *end, Traits &traits) const;\n\nprivate:\n\tregex_definition(regex_definition const &);\n\tregex_definition& operator = (regex_definition const &);\n\t\n\tusing definition<Traits>::name;\n\tusing definition<Traits>::xpath;\n\nprivate:\n\tstd::string replace_pattern_;\n\tstd::list<regex_data> replaces_;\n\tstd::pair<pcre*, pcre_extra*> regex_;\n};\n\ntemplate <typename Traits> inline \nregex_definition<Traits>::regex_definition(char const *name, char const *xpath, char const *pattern, char const *replace_pattern) :\n\tdefinition<Traits>(name, xpath), replace_pattern_(replace_pattern), regex_(0, 0)\n{\n\tint max = -1;\n\tregex_ = pcre_compile_regex(pattern);\n\tint res = pcre_fullinfo(regex_.first, regex_.second, PCRE_INFO_CAPTURECOUNT, &max);\n\tif (0 != res || -1 == max) {\n\t\tthrow error(\"can not get capture count from %s: %d\", pattern, res);\n\t}\n\tfind_replaces(replace_pattern_, replaces_);\n\tstd::size_t replace_count = replaces_.size();\n\tif (replace_count > static_cast<std::size_t>(max)) {\n\t \tthrow error(\"definition intended to replace more items (%llu) than it could capture in %s (%llu)\", \n\t \t static_cast<unsigned long long>(replace_count), pattern, static_cast<unsigned long long>(max));\n\t}\n}\n\ntemplate <typename Traits> inline\nregex_definition<Traits>::~regex_definition() {\n pcre_free_regex(regex_);\n}\n\ntemplate <typename Traits> inline void\nregex_definition<Traits>::dump(std::ostream &out) const {\n out << \"regex definition at [\" << xpath() << \"] triggered: setting \" << name() << \"=\" << replace_pattern_ << \" being substituted during detection\" << std::endl;\n}\n\ntemplate <typename Traits> inline bool\nregex_definition<Traits>::detect(char const *begin, char const *end, Traits &traits) const {\n\t\n\tstd::vector<int> match((replaces_.size() + 1) * 3, 0);\n\tint result = pcre_exec(regex_.first, regex_.second, begin, end - begin, 0, 0, &match[0], match.size());\n\tif (PCRE_ERROR_NOMATCH == result) {\n\t\treturn false;\n\t}\n\telse if (result < 0) {\n\t\tthrow error(\"error while regex matching: %d\", result);\n\t}\n\tif (static_cast<std::size_t>(result) != replaces_.size() + 1) {\n\t throw error(\"error while regex matching: captured %d while desired %d\", result - 1, replaces_.size());\n\t}\n\tstd::string temp(replace_pattern_);\n\tfor (std::list<regex_data>::const_reverse_iterator ri = replaces_.rbegin(), rend = replaces_.rend(); ri != rend; ++ri) {\n \ttemp.replace(temp.begin() + ri->begin, temp.begin() + ri->end, begin + match[2 * ri->index], begin + match[2 * ri->index + 1]);\n\t}\n\ttraits[name()] = temp;\n\treturn true;\n}\n\n}} \/\/ namespaces\n\n#endif \/\/ UATRAITS_DETAILS_REGEX_DEFINITION_HPP_INCLUDED\n\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/XKBlib.h>\n#include <GL\/glx.h>\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n\n#include \"SkWindow.h\"\n\n#include \"SkBitmap.h\"\n#include \"SkCanvas.h\"\n#include \"SkColor.h\"\n#include \"SkEvent.h\"\n#include \"SkKey.h\"\n#include \"SkWindow.h\"\n#include \"XkeysToSkKeys.h\"\nextern \"C\" {\n #include \"keysym2ucs.h\"\n}\n\nconst int WIDTH = 500;\nconst int HEIGHT = 500;\n\n\/\/ Determine which events to listen for.\nconst long EVENT_MASK = StructureNotifyMask|ButtonPressMask|ButtonReleaseMask\n |ExposureMask|PointerMotionMask|KeyPressMask|KeyReleaseMask;\n\nSkOSWindow::SkOSWindow(void* unused)\n : fVi(NULL)\n , fMSAASampleCount(0) {\n fUnixWindow.fDisplay = NULL;\n fUnixWindow.fGLContext = NULL;\n this->initWindow(0);\n this->resize(WIDTH, HEIGHT);\n}\n\nSkOSWindow::~SkOSWindow() {\n this->closeWindow();\n}\n\nvoid SkOSWindow::closeWindow() {\n if (NULL != fUnixWindow.fDisplay) {\n this->detach();\n SkASSERT(NULL != fUnixWindow.fGc);\n XFreeGC(fUnixWindow.fDisplay, fUnixWindow.fGc);\n fUnixWindow.fGc = NULL;\n XDestroyWindow(fUnixWindow.fDisplay, fUnixWindow.fWin);\n fVi = NULL;\n XCloseDisplay(fUnixWindow.fDisplay);\n fUnixWindow.fDisplay = NULL;\n fMSAASampleCount = 0;\n }\n}\n\nvoid SkOSWindow::initWindow(int requestedMSAASampleCount) {\n if (fMSAASampleCount != requestedMSAASampleCount) {\n this->closeWindow();\n }\n \/\/ presence of fDisplay means we already have a window\n if (NULL != fUnixWindow.fDisplay) {\n return;\n }\n fUnixWindow.fDisplay = XOpenDisplay(NULL);\n Display* dsp = fUnixWindow.fDisplay;\n if (NULL == dsp) {\n SkDebugf(\"Could not open an X Display\");\n return;\n }\n \/\/ Attempt to create a window that supports GL\n GLint att[] = {\n GLX_RGBA,\n GLX_DEPTH_SIZE, 24,\n GLX_DOUBLEBUFFER,\n GLX_STENCIL_SIZE, 8,\n None\n };\n SkASSERT(NULL == fVi);\n if (requestedMSAASampleCount > 0) {\n static const GLint kAttCount = SK_ARRAY_COUNT(att);\n GLint msaaAtt[kAttCount + 4];\n memcpy(msaaAtt, att, sizeof(att));\n SkASSERT(None == msaaAtt[kAttCount - 1]);\n msaaAtt[kAttCount - 1] = GLX_SAMPLE_BUFFERS_ARB;\n msaaAtt[kAttCount + 0] = 1;\n msaaAtt[kAttCount + 1] = GLX_SAMPLES_ARB;\n msaaAtt[kAttCount + 2] = requestedMSAASampleCount;\n msaaAtt[kAttCount + 3] = None;\n fVi = glXChooseVisual(dsp, DefaultScreen(dsp), msaaAtt);\n fMSAASampleCount = requestedMSAASampleCount;\n }\n if (NULL == fVi) {\n fVi = glXChooseVisual(dsp, DefaultScreen(dsp), att);\n fMSAASampleCount = 0;\n }\n\n if (fVi) {\n Colormap colorMap = XCreateColormap(dsp,\n RootWindow(dsp, fVi->screen),\n fVi->visual,\n AllocNone);\n XSetWindowAttributes swa;\n swa.colormap = colorMap;\n swa.event_mask = EVENT_MASK;\n fUnixWindow.fWin = XCreateWindow(dsp,\n RootWindow(dsp, fVi->screen),\n 0, 0, \/\/ x, y\n WIDTH, HEIGHT,\n 0, \/\/ border width\n fVi->depth,\n InputOutput,\n fVi->visual,\n CWEventMask | CWColormap,\n &swa);\n } else {\n \/\/ Create a simple window instead. We will not be able to show GL\n fUnixWindow.fWin = XCreateSimpleWindow(dsp,\n DefaultRootWindow(dsp),\n 0, 0, \/\/ x, y\n WIDTH, HEIGHT,\n 0, \/\/ border width\n 0, \/\/ border value\n 0); \/\/ background value\n }\n this->mapWindowAndWait();\n fUnixWindow.fGc = XCreateGC(dsp, fUnixWindow.fWin, 0, NULL);\n}\n\n\nvoid SkOSWindow::post_linuxevent() {\n \/\/ Put an event in the X queue to fire an SkEvent.\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n long event_mask = NoEventMask;\n XClientMessageEvent event;\n event.type = ClientMessage;\n Atom myAtom(0);\n event.message_type = myAtom;\n event.format = 32;\n event.data.l[0] = 0;\n XSendEvent(fUnixWindow.fDisplay, fUnixWindow.fWin, false, 0,\n (XEvent*) &event);\n XFlush(fUnixWindow.fDisplay);\n}\n\nstatic unsigned getModifierKeys(const XEvent& evt) {\n\/\/ unsigned xmod = evt.xkey.state;\n return 0; \/\/ TODO\n}\n\nvoid SkOSWindow::loop() {\n Display* dsp = fUnixWindow.fDisplay;\n if (NULL == dsp) {\n return;\n }\n XSelectInput(dsp, fUnixWindow.fWin, EVENT_MASK);\n\n bool loop = true;\n XEvent evt;\n while (loop) {\n XNextEvent(dsp, &evt);\n switch (evt.type) {\n case Expose:\n if (evt.xexpose.count == 0)\n this->inval(NULL);\n break;\n case ConfigureNotify:\n this->resize(evt.xconfigure.width, evt.xconfigure.height);\n break;\n case ButtonPress:\n if (evt.xbutton.button == Button1)\n this->handleClick(evt.xbutton.x, evt.xbutton.y,\n SkView::Click::kDown_State, getModifierKeys(evt));\n break;\n case ButtonRelease:\n if (evt.xbutton.button == Button1)\n this->handleClick(evt.xbutton.x, evt.xbutton.y,\n SkView::Click::kUp_State, getModifierKeys(evt));\n break;\n case MotionNotify:\n this->handleClick(evt.xmotion.x, evt.xmotion.y,\n SkView::Click::kMoved_State, getModifierKeys(evt));\n break;\n case KeyPress: {\n KeySym keysym = XkbKeycodeToKeysym(dsp, evt.xkey.keycode, 0, 0);\n \/\/SkDebugf(\"pressed key %i!\\n\\tKeySym:%i\\n\", evt.xkey.keycode, XKeycodeToKeysym(dsp, evt.xkey.keycode, 0));\n if (keysym == XK_Escape) {\n loop = false;\n break;\n }\n this->handleKey(XKeyToSkKey(keysym));\n long uni = keysym2ucs(keysym);\n if (uni != -1) {\n this->handleChar((SkUnichar) uni);\n }\n break;\n }\n case KeyRelease:\n \/\/SkDebugf(\"released key %i\\n\", evt.xkey.keycode);\n this->handleKeyUp(XKeyToSkKey(XkbKeycodeToKeysym(dsp, evt.xkey.keycode, 0, 0)));\n break;\n case ClientMessage:\n if (SkEvent::ProcessEvent()) {\n this->post_linuxevent();\n }\n break;\n default:\n \/\/ Do nothing for other events\n break;\n }\n }\n}\n\nvoid SkOSWindow::mapWindowAndWait() {\n SkASSERT(NULL != fUnixWindow.fDisplay);\n Display* dsp = fUnixWindow.fDisplay;\n Window win = fUnixWindow.fWin;\n XMapWindow(dsp, win);\n\n long eventMask = StructureNotifyMask;\n XSelectInput(dsp, win, eventMask);\n\n \/\/ Wait until screen is ready.\n XEvent evt;\n do {\n XNextEvent(dsp, &evt);\n } while(evt.type != MapNotify);\n\n}\n\nbool SkOSWindow::attach(SkBackEndTypes \/* attachType *\/, int msaaSampleCount) {\n this->initWindow(msaaSampleCount);\n if (NULL == fUnixWindow.fDisplay) {\n return false;\n }\n if (NULL == fUnixWindow.fGLContext) {\n SkASSERT(NULL != fVi);\n\n fUnixWindow.fGLContext = glXCreateContext(fUnixWindow.fDisplay,\n fVi,\n NULL,\n GL_TRUE);\n if (NULL == fUnixWindow.fGLContext) {\n return false;\n }\n }\n glXMakeCurrent(fUnixWindow.fDisplay,\n fUnixWindow.fWin,\n fUnixWindow.fGLContext);\n glViewport(0, 0,\n SkScalarRound(this->width()), SkScalarRound(this->height()));\n glClearColor(0, 0, 0, 0);\n glClearStencil(0);\n glClear(GL_COLOR_BUFFER_BIT | GL_STENCIL_BUFFER_BIT);\n return true;\n}\n\nvoid SkOSWindow::detach() {\n if (NULL == fUnixWindow.fDisplay || NULL == fUnixWindow.fGLContext) {\n return;\n }\n glXMakeCurrent(fUnixWindow.fDisplay, None, NULL);\n glXDestroyContext(fUnixWindow.fDisplay, fUnixWindow.fGLContext);\n fUnixWindow.fGLContext = NULL;\n}\n\nvoid SkOSWindow::present() {\n if (NULL != fUnixWindow.fDisplay && NULL != fUnixWindow.fGLContext) {\n glXSwapBuffers(fUnixWindow.fDisplay, fUnixWindow.fWin);\n }\n}\n\nvoid SkOSWindow::onSetTitle(const char title[]) {\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n XTextProperty textProp;\n textProp.value = (unsigned char*)title;\n textProp.format = 8;\n textProp.nitems = strlen((char*)textProp.value);\n textProp.encoding = XA_STRING;\n XSetWMName(fUnixWindow.fDisplay, fUnixWindow.fWin, &textProp);\n}\n\nvoid SkOSWindow::onHandleInval(const SkIRect&) {\n (new SkEvent(\"inval-imageview\", this->getSinkID()))->post();\n}\n\nbool SkOSWindow::onEvent(const SkEvent& evt) {\n if (evt.isType(\"inval-imageview\")) {\n update(NULL);\n if (NULL == fUnixWindow.fGLContext)\n this->doPaint();\n return true;\n }\n return INHERITED::onEvent(evt);\n}\n\nstatic bool convertBitmapToXImage(XImage& image, const SkBitmap& bitmap) {\n sk_bzero(&image, sizeof(image));\n\n int bitsPerPixel = bitmap.bytesPerPixel() * 8;\n image.width = bitmap.width();\n image.height = bitmap.height();\n image.format = ZPixmap;\n image.data = (char*) bitmap.getPixels();\n image.byte_order = LSBFirst;\n image.bitmap_unit = bitsPerPixel;\n image.bitmap_bit_order = LSBFirst;\n image.bitmap_pad = bitsPerPixel;\n image.depth = 24;\n image.bytes_per_line = bitmap.rowBytes() - bitmap.width() * bitmap.bytesPerPixel();\n image.bits_per_pixel = bitsPerPixel;\n return XInitImage(&image);\n}\n\nvoid SkOSWindow::doPaint() {\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n \/\/ Draw the bitmap to the screen.\n const SkBitmap& bitmap = getBitmap();\n int width = bitmap.width();\n int height = bitmap.height();\n\n XImage image;\n if (!convertBitmapToXImage(image, bitmap)) {\n return;\n }\n\n XPutImage(fUnixWindow.fDisplay,\n fUnixWindow.fWin,\n fUnixWindow.fGc,\n &image,\n 0, 0, \/\/ src x,y\n 0, 0, \/\/ dst x,y\n width, height);\n}\n\nbool SkOSWindow::onHandleChar(SkUnichar) {\n return false;\n}\n\nbool SkOSWindow::onHandleKey(SkKey key) {\n return false;\n}\n\nbool SkOSWindow::onHandleKeyUp(SkKey key) {\n return false;\n}\n<commit_msg>fix linux build<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/XKBlib.h>\n#include <GL\/glx.h>\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n\n#include \"SkWindow.h\"\n\n#include \"SkBitmap.h\"\n#include \"SkCanvas.h\"\n#include \"SkColor.h\"\n#include \"SkEvent.h\"\n#include \"SkKey.h\"\n#include \"SkWindow.h\"\n#include \"XkeysToSkKeys.h\"\nextern \"C\" {\n #include \"keysym2ucs.h\"\n}\n\nconst int WIDTH = 500;\nconst int HEIGHT = 500;\n\n\/\/ Determine which events to listen for.\nconst long EVENT_MASK = StructureNotifyMask|ButtonPressMask|ButtonReleaseMask\n |ExposureMask|PointerMotionMask|KeyPressMask|KeyReleaseMask;\n\nSkOSWindow::SkOSWindow(void* unused)\n : fVi(NULL)\n , fMSAASampleCount(0) {\n fUnixWindow.fDisplay = NULL;\n fUnixWindow.fGLContext = NULL;\n this->initWindow(0);\n this->resize(WIDTH, HEIGHT);\n}\n\nSkOSWindow::~SkOSWindow() {\n this->closeWindow();\n}\n\nvoid SkOSWindow::closeWindow() {\n if (NULL != fUnixWindow.fDisplay) {\n this->detach();\n SkASSERT(NULL != fUnixWindow.fGc);\n XFreeGC(fUnixWindow.fDisplay, fUnixWindow.fGc);\n fUnixWindow.fGc = NULL;\n XDestroyWindow(fUnixWindow.fDisplay, fUnixWindow.fWin);\n fVi = NULL;\n XCloseDisplay(fUnixWindow.fDisplay);\n fUnixWindow.fDisplay = NULL;\n fMSAASampleCount = 0;\n }\n}\n\nvoid SkOSWindow::initWindow(int requestedMSAASampleCount) {\n if (fMSAASampleCount != requestedMSAASampleCount) {\n this->closeWindow();\n }\n \/\/ presence of fDisplay means we already have a window\n if (NULL != fUnixWindow.fDisplay) {\n return;\n }\n fUnixWindow.fDisplay = XOpenDisplay(NULL);\n Display* dsp = fUnixWindow.fDisplay;\n if (NULL == dsp) {\n SkDebugf(\"Could not open an X Display\");\n return;\n }\n \/\/ Attempt to create a window that supports GL\n GLint att[] = {\n GLX_RGBA,\n GLX_DEPTH_SIZE, 24,\n GLX_DOUBLEBUFFER,\n GLX_STENCIL_SIZE, 8,\n None\n };\n SkASSERT(NULL == fVi);\n if (requestedMSAASampleCount > 0) {\n static const GLint kAttCount = SK_ARRAY_COUNT(att);\n GLint msaaAtt[kAttCount + 4];\n memcpy(msaaAtt, att, sizeof(att));\n SkASSERT(None == msaaAtt[kAttCount - 1]);\n msaaAtt[kAttCount - 1] = GLX_SAMPLE_BUFFERS_ARB;\n msaaAtt[kAttCount + 0] = 1;\n msaaAtt[kAttCount + 1] = GLX_SAMPLES_ARB;\n msaaAtt[kAttCount + 2] = requestedMSAASampleCount;\n msaaAtt[kAttCount + 3] = None;\n fVi = glXChooseVisual(dsp, DefaultScreen(dsp), msaaAtt);\n fMSAASampleCount = requestedMSAASampleCount;\n }\n if (NULL == fVi) {\n fVi = glXChooseVisual(dsp, DefaultScreen(dsp), att);\n fMSAASampleCount = 0;\n }\n\n if (fVi) {\n Colormap colorMap = XCreateColormap(dsp,\n RootWindow(dsp, fVi->screen),\n fVi->visual,\n AllocNone);\n XSetWindowAttributes swa;\n swa.colormap = colorMap;\n swa.event_mask = EVENT_MASK;\n fUnixWindow.fWin = XCreateWindow(dsp,\n RootWindow(dsp, fVi->screen),\n 0, 0, \/\/ x, y\n WIDTH, HEIGHT,\n 0, \/\/ border width\n fVi->depth,\n InputOutput,\n fVi->visual,\n CWEventMask | CWColormap,\n &swa);\n } else {\n \/\/ Create a simple window instead. We will not be able to show GL\n fUnixWindow.fWin = XCreateSimpleWindow(dsp,\n DefaultRootWindow(dsp),\n 0, 0, \/\/ x, y\n WIDTH, HEIGHT,\n 0, \/\/ border width\n 0, \/\/ border value\n 0); \/\/ background value\n }\n this->mapWindowAndWait();\n fUnixWindow.fGc = XCreateGC(dsp, fUnixWindow.fWin, 0, NULL);\n}\n\n\nvoid SkOSWindow::post_linuxevent() {\n \/\/ Put an event in the X queue to fire an SkEvent.\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n long event_mask = NoEventMask;\n XClientMessageEvent event;\n event.type = ClientMessage;\n Atom myAtom(0);\n event.message_type = myAtom;\n event.format = 32;\n event.data.l[0] = 0;\n XSendEvent(fUnixWindow.fDisplay, fUnixWindow.fWin, false, 0,\n (XEvent*) &event);\n XFlush(fUnixWindow.fDisplay);\n}\n\nstatic unsigned getModi(const XEvent& evt) {\n\/\/ unsigned xmod = evt.xkey.state;\n return 0; \/\/ TODO\n}\n\nvoid SkOSWindow::loop() {\n Display* dsp = fUnixWindow.fDisplay;\n if (NULL == dsp) {\n return;\n }\n XSelectInput(dsp, fUnixWindow.fWin, EVENT_MASK);\n\n bool loop = true;\n XEvent evt;\n while (loop) {\n XNextEvent(dsp, &evt);\n switch (evt.type) {\n case Expose:\n if (evt.xexpose.count == 0)\n this->inval(NULL);\n break;\n case ConfigureNotify:\n this->resize(evt.xconfigure.width, evt.xconfigure.height);\n break;\n case ButtonPress:\n if (evt.xbutton.button == Button1)\n this->handleClick(evt.xbutton.x, evt.xbutton.y,\n SkView::Click::kDown_State, NULL, getModi(evt));\n break;\n case ButtonRelease:\n if (evt.xbutton.button == Button1)\n this->handleClick(evt.xbutton.x, evt.xbutton.y,\n SkView::Click::kUp_State, NULL, getModi(evt));\n break;\n case MotionNotify:\n this->handleClick(evt.xmotion.x, evt.xmotion.y,\n SkView::Click::kMoved_State, NULL, getModi(evt));\n break;\n case KeyPress: {\n KeySym keysym = XkbKeycodeToKeysym(dsp, evt.xkey.keycode, 0, 0);\n \/\/SkDebugf(\"pressed key %i!\\n\\tKeySym:%i\\n\", evt.xkey.keycode, XKeycodeToKeysym(dsp, evt.xkey.keycode, 0));\n if (keysym == XK_Escape) {\n loop = false;\n break;\n }\n this->handleKey(XKeyToSkKey(keysym));\n long uni = keysym2ucs(keysym);\n if (uni != -1) {\n this->handleChar((SkUnichar) uni);\n }\n break;\n }\n case KeyRelease:\n \/\/SkDebugf(\"released key %i\\n\", evt.xkey.keycode);\n this->handleKeyUp(XKeyToSkKey(XkbKeycodeToKeysym(dsp, evt.xkey.keycode, 0, 0)));\n break;\n case ClientMessage:\n if (SkEvent::ProcessEvent()) {\n this->post_linuxevent();\n }\n break;\n default:\n \/\/ Do nothing for other events\n break;\n }\n }\n}\n\nvoid SkOSWindow::mapWindowAndWait() {\n SkASSERT(NULL != fUnixWindow.fDisplay);\n Display* dsp = fUnixWindow.fDisplay;\n Window win = fUnixWindow.fWin;\n XMapWindow(dsp, win);\n\n long eventMask = StructureNotifyMask;\n XSelectInput(dsp, win, eventMask);\n\n \/\/ Wait until screen is ready.\n XEvent evt;\n do {\n XNextEvent(dsp, &evt);\n } while(evt.type != MapNotify);\n\n}\n\nbool SkOSWindow::attach(SkBackEndTypes \/* attachType *\/, int msaaSampleCount) {\n this->initWindow(msaaSampleCount);\n if (NULL == fUnixWindow.fDisplay) {\n return false;\n }\n if (NULL == fUnixWindow.fGLContext) {\n SkASSERT(NULL != fVi);\n\n fUnixWindow.fGLContext = glXCreateContext(fUnixWindow.fDisplay,\n fVi,\n NULL,\n GL_TRUE);\n if (NULL == fUnixWindow.fGLContext) {\n return false;\n }\n }\n glXMakeCurrent(fUnixWindow.fDisplay,\n fUnixWindow.fWin,\n fUnixWindow.fGLContext);\n glViewport(0, 0,\n SkScalarRound(this->width()), SkScalarRound(this->height()));\n glClearColor(0, 0, 0, 0);\n glClearStencil(0);\n glClear(GL_COLOR_BUFFER_BIT | GL_STENCIL_BUFFER_BIT);\n return true;\n}\n\nvoid SkOSWindow::detach() {\n if (NULL == fUnixWindow.fDisplay || NULL == fUnixWindow.fGLContext) {\n return;\n }\n glXMakeCurrent(fUnixWindow.fDisplay, None, NULL);\n glXDestroyContext(fUnixWindow.fDisplay, fUnixWindow.fGLContext);\n fUnixWindow.fGLContext = NULL;\n}\n\nvoid SkOSWindow::present() {\n if (NULL != fUnixWindow.fDisplay && NULL != fUnixWindow.fGLContext) {\n glXSwapBuffers(fUnixWindow.fDisplay, fUnixWindow.fWin);\n }\n}\n\nvoid SkOSWindow::onSetTitle(const char title[]) {\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n XTextProperty textProp;\n textProp.value = (unsigned char*)title;\n textProp.format = 8;\n textProp.nitems = strlen((char*)textProp.value);\n textProp.encoding = XA_STRING;\n XSetWMName(fUnixWindow.fDisplay, fUnixWindow.fWin, &textProp);\n}\n\nvoid SkOSWindow::onHandleInval(const SkIRect&) {\n (new SkEvent(\"inval-imageview\", this->getSinkID()))->post();\n}\n\nbool SkOSWindow::onEvent(const SkEvent& evt) {\n if (evt.isType(\"inval-imageview\")) {\n update(NULL);\n if (NULL == fUnixWindow.fGLContext)\n this->doPaint();\n return true;\n }\n return INHERITED::onEvent(evt);\n}\n\nstatic bool convertBitmapToXImage(XImage& image, const SkBitmap& bitmap) {\n sk_bzero(&image, sizeof(image));\n\n int bitsPerPixel = bitmap.bytesPerPixel() * 8;\n image.width = bitmap.width();\n image.height = bitmap.height();\n image.format = ZPixmap;\n image.data = (char*) bitmap.getPixels();\n image.byte_order = LSBFirst;\n image.bitmap_unit = bitsPerPixel;\n image.bitmap_bit_order = LSBFirst;\n image.bitmap_pad = bitsPerPixel;\n image.depth = 24;\n image.bytes_per_line = bitmap.rowBytes() - bitmap.width() * bitmap.bytesPerPixel();\n image.bits_per_pixel = bitsPerPixel;\n return XInitImage(&image);\n}\n\nvoid SkOSWindow::doPaint() {\n if (NULL == fUnixWindow.fDisplay) {\n return;\n }\n \/\/ Draw the bitmap to the screen.\n const SkBitmap& bitmap = getBitmap();\n int width = bitmap.width();\n int height = bitmap.height();\n\n XImage image;\n if (!convertBitmapToXImage(image, bitmap)) {\n return;\n }\n\n XPutImage(fUnixWindow.fDisplay,\n fUnixWindow.fWin,\n fUnixWindow.fGc,\n &image,\n 0, 0, \/\/ src x,y\n 0, 0, \/\/ dst x,y\n width, height);\n}\n\nbool SkOSWindow::onHandleChar(SkUnichar) {\n return false;\n}\n\nbool SkOSWindow::onHandleKey(SkKey key) {\n return false;\n}\n\nbool SkOSWindow::onHandleKeyUp(SkKey key) {\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"widgets\/helper\/NotebookTab.hpp\"\n\n#include \"Application.hpp\"\n#include \"common\/Common.hpp\"\n#include \"debug\/Log.hpp\"\n#include \"singletons\/Fonts.hpp\"\n#include \"singletons\/Settings.hpp\"\n#include \"singletons\/Theme.hpp\"\n#include \"singletons\/WindowManager.hpp\"\n#include \"util\/Clamp.hpp\"\n#include \"util\/Helpers.hpp\"\n#include \"widgets\/Notebook.hpp\"\n#include \"widgets\/dialogs\/SettingsDialog.hpp\"\n#include \"widgets\/dialogs\/TextInputDialog.hpp\"\n#include \"widgets\/splits\/SplitContainer.hpp\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QLinearGradient>\n#include <QMimeData>\n#include <QPainter>\n#include <boost\/bind.hpp>\n\nnamespace chatterino {\n\nNotebookTab::NotebookTab(Notebook *notebook)\n : Button(notebook)\n , positionChangedAnimation_(this, \"pos\")\n , notebook_(notebook)\n , menu_(this)\n{\n auto app = getApp();\n\n this->setAcceptDrops(true);\n\n this->positionChangedAnimation_.setEasingCurve(\n QEasingCurve(QEasingCurve::InCubic));\n\n getSettings()->showTabCloseButton.connect(\n boost::bind(&NotebookTab::hideTabXChanged, this, _1),\n this->managedConnections_);\n\n this->setMouseTracking(true);\n\n this->menu_.addAction(\"Rename\", [this]() {\n TextInputDialog d(this);\n\n d.setWindowTitle(\n \"Change tab title (Leave empty for default behaviour)\");\n d.setText(this->getCustomTitle());\n d.highlightText();\n\n if (d.exec() == QDialog::Accepted) {\n QString newTitle = d.getText();\n this->setCustomTitle(newTitle);\n }\n });\n\n this->menu_.addAction(\"Close\",\n [=]() { this->notebook_->removePage(this->page); });\n\n highlightNewMessagesAction_ =\n new QAction(\"Enable highlights on new messages\", &this->menu_);\n highlightNewMessagesAction_->setCheckable(true);\n highlightNewMessagesAction_->setChecked(highlightEnabled_);\n QObject::connect(\n highlightNewMessagesAction_, &QAction::triggered,\n [this](bool checked) { this->highlightEnabled_ = checked; });\n this->menu_.addAction(highlightNewMessagesAction_);\n}\n\nvoid NotebookTab::themeChangedEvent()\n{\n this->update();\n\n \/\/ this->setMouseEffectColor(QColor(\"#999\"));\n this->setMouseEffectColor(this->theme->tabs.regular.text);\n}\n\nvoid NotebookTab::updateSize()\n{\n float scale = getScale();\n\n int width;\n QFontMetrics metrics = getApp()->fonts->getFontMetrics(\n FontStyle::UiTabs,\n float(qreal(this->getScale()) * this->devicePixelRatioF()));\n\n if (this->hasXButton()) {\n width = (metrics.width(this->getTitle()) + int(32 * scale));\n } else {\n width = (metrics.width(this->getTitle()) + int(16 * scale));\n }\n\n width = clamp(width, this->height(), int(150 * scale));\n\n if (this->width() != width) {\n this->resize(width, int(NOTEBOOK_TAB_HEIGHT * scale));\n this->notebook_->performLayout();\n }\n}\n\nconst QString &NotebookTab::getCustomTitle() const\n{\n return this->customTitle_;\n}\n\nvoid NotebookTab::setCustomTitle(const QString &newTitle)\n{\n if (this->customTitle_ != newTitle) {\n this->customTitle_ = newTitle;\n this->titleUpdated();\n }\n}\n\nvoid NotebookTab::resetCustomTitle()\n{\n this->setCustomTitle(QString());\n}\n\nbool NotebookTab::hasCustomTitle() const\n{\n return !this->customTitle_.isEmpty();\n}\n\nvoid NotebookTab::setDefaultTitle(const QString &title)\n{\n if (this->defaultTitle_ != title) {\n this->defaultTitle_ = title;\n\n if (this->customTitle_.isEmpty()) {\n this->titleUpdated();\n }\n }\n}\n\nconst QString &NotebookTab::getDefaultTitle() const\n{\n return this->defaultTitle_;\n}\n\nconst QString &NotebookTab::getTitle() const\n{\n return this->customTitle_.isEmpty() ? this->defaultTitle_\n : this->customTitle_;\n}\n\nvoid NotebookTab::titleUpdated()\n{\n \/\/ Queue up save because: Tab title changed\n getApp()->windows->queueSave();\n\n this->updateSize();\n this->update();\n}\n\nbool NotebookTab::isSelected() const\n{\n return this->selected_;\n}\n\nvoid NotebookTab::setSelected(bool value)\n{\n this->selected_ = value;\n\n this->highlightState_ = HighlightState::None;\n\n this->update();\n}\n\nvoid NotebookTab::setLive(bool isLive)\n{\n if (this->isLive_ != isLive) {\n this->isLive_ = isLive;\n this->update();\n }\n}\n\nvoid NotebookTab::setHighlightState(HighlightState newHighlightStyle)\n{\n if (this->isSelected() || !this->highlightEnabled_) {\n return;\n }\n if (this->highlightState_ != HighlightState::Highlighted) {\n this->highlightState_ = newHighlightStyle;\n\n this->update();\n }\n}\n\nvoid NotebookTab::setHighlightsEnabled(const bool &newVal)\n{\n this->highlightNewMessagesAction_->setChecked(newVal);\n this->highlightEnabled_ = newVal;\n}\n\nbool NotebookTab::hasHighlightsEnabled() const\n{\n return this->highlightEnabled_;\n}\n\nQRect NotebookTab::getDesiredRect() const\n{\n return QRect(this->positionAnimationDesiredPoint_, size());\n}\n\nvoid NotebookTab::hideTabXChanged(bool)\n{\n this->updateSize();\n this->update();\n}\n\nvoid NotebookTab::moveAnimated(QPoint pos, bool animated)\n{\n this->positionAnimationDesiredPoint_ = pos;\n\n QWidget *w = this->window();\n\n if ((w != nullptr && !w->isVisible()) || !animated ||\n !this->positionChangedAnimationRunning_) {\n this->move(pos);\n\n this->positionChangedAnimationRunning_ = true;\n return;\n }\n\n if (this->positionChangedAnimation_.endValue() == pos) {\n return;\n }\n\n this->positionChangedAnimation_.stop();\n this->positionChangedAnimation_.setDuration(75);\n this->positionChangedAnimation_.setStartValue(this->pos());\n this->positionChangedAnimation_.setEndValue(pos);\n this->positionChangedAnimation_.start();\n}\n\nvoid NotebookTab::paintEvent(QPaintEvent *)\n{\n auto app = getApp();\n QPainter painter(this);\n float scale = this->getScale();\n\n painter.setFont(getApp()->fonts->getFont(\n FontStyle::UiTabs,\n scale * 96.f \/ this->logicalDpiX() * this->devicePixelRatioF()));\n QFontMetrics metrics = app->fonts->getFontMetrics(\n FontStyle::UiTabs,\n scale * 96.f \/ this->logicalDpiX() * this->devicePixelRatioF());\n\n int height = int(scale * NOTEBOOK_TAB_HEIGHT);\n \/\/ int fullHeight = (int)(scale * 48);\n\n \/\/ select the right tab colors\n Theme::TabColors colors;\n Theme::TabColors regular = this->theme->tabs.regular;\n\n if (this->selected_) {\n colors = this->theme->tabs.selected;\n } else if (this->highlightState_ == HighlightState::Highlighted) {\n colors = this->theme->tabs.highlighted;\n } else if (this->highlightState_ == HighlightState::NewMessage) {\n colors = this->theme->tabs.newMessage;\n } else {\n colors = this->theme->tabs.regular;\n }\n\n bool windowFocused = this->window() == QApplication::activeWindow();\n \/\/ || SettingsDialog::getHandle() == QApplication::activeWindow();\n\n QBrush tabBackground = \/*this->mouseOver_ ? colors.backgrounds.hover\n :*\/\n (windowFocused ? colors.backgrounds.regular\n : colors.backgrounds.unfocused);\n\n \/\/ painter.fillRect(rect(), this->mouseOver_ ? regular.backgrounds.hover\n \/\/ : (windowFocused ?\n \/\/ regular.backgrounds.regular\n \/\/ :\n \/\/ regular.backgrounds.unfocused));\n\n \/\/ fill the tab background\n auto bgRect = rect();\n bgRect.setTop(bgRect.top() + 2);\n\n painter.fillRect(bgRect, tabBackground);\n\n \/\/ draw border\n \/\/ painter.setPen(QPen(\"#fff\"));\n \/\/ QPainterPath path(QPointF(0, height));\n \/\/ path.lineTo(0, 0);\n \/\/ path.lineTo(this->width() - 1, 0);\n \/\/ path.lineTo(this->width() - 1, this->height() - 1);\n \/\/ path.lineTo(0, this->height() - 1);\n \/\/ painter.drawPath(path);\n\n \/\/ top line\n painter.fillRect(\n QRectF(0, (this->selected_ ? 0.f : 1.f) * scale, this->width(),\n (this->selected_ ? 2.f : 1.f) * scale),\n this->mouseOver_\n ? colors.line.hover\n : (windowFocused ? colors.line.regular : colors.line.unfocused));\n\n \/\/ draw live indicator\n if (this->isLive_) {\n painter.setPen(QColor(Qt::GlobalColor::red));\n QBrush b;\n b.setColor(QColor(Qt::GlobalColor::red));\n b.setStyle(Qt::SolidPattern);\n painter.setBrush(b);\n\n auto x = this->width() - (6.f * scale);\n auto y = 4.f * scale;\n auto diameter = 4.f * scale;\n painter.drawEllipse(QRectF(x, y, diameter, diameter));\n }\n\n \/\/ set the pen color\n painter.setPen(colors.text);\n\n \/\/ set area for text\n int rectW = (!getSettings()->showTabCloseButton ? 0 : int(16 * scale));\n QRect rect(0, 0, this->width() - rectW, height);\n\n \/\/ draw text\n int offset = int(scale * 8);\n QRect textRect(offset, this->selected_ ? 1 : 2,\n this->width() - offset - offset, height);\n\n if (this->shouldDrawXButton()) {\n textRect.setRight(textRect.right() - this->height() \/ 2);\n }\n\n int width = metrics.width(this->getTitle());\n Qt::Alignment alignment = width > textRect.width()\n ? Qt::AlignLeft | Qt::AlignVCenter\n : Qt::AlignHCenter | Qt::AlignVCenter;\n\n QTextOption option(alignment);\n option.setWrapMode(QTextOption::NoWrap);\n painter.drawText(textRect, this->getTitle(), option);\n\n \/\/ draw close x\n if (this->shouldDrawXButton()) {\n QRect xRect = this->getXRect();\n if (!xRect.isNull()) {\n if (this->selected_) xRect.moveTop(xRect.top() - 1);\n\n painter.setBrush(QColor(\"#fff\"));\n\n if (this->mouseOverX_) {\n painter.fillRect(xRect, QColor(0, 0, 0, 64));\n\n if (this->mouseDownX_) {\n painter.fillRect(xRect, QColor(0, 0, 0, 64));\n }\n }\n\n int a = static_cast<int>(scale * 4);\n\n painter.drawLine(xRect.topLeft() + QPoint(a, a),\n xRect.bottomRight() + QPoint(-a, -a));\n painter.drawLine(xRect.topRight() + QPoint(-a, a),\n xRect.bottomLeft() + QPoint(a, -a));\n }\n }\n\n \/\/ draw line at bottom\n if (!this->selected_) {\n painter.fillRect(0, this->height() - 1, this->width(), 1,\n app->themes->window.background);\n\n this->fancyPaint(painter);\n }\n}\n\nbool NotebookTab::hasXButton()\n{\n return getSettings()->showTabCloseButton &&\n this->notebook_->getAllowUserTabManagement();\n}\n\nbool NotebookTab::shouldDrawXButton()\n{\n return this->hasXButton() && (this->mouseOver_ || this->selected_);\n}\n\nvoid NotebookTab::mousePressEvent(QMouseEvent *event)\n{\n if (event->button() == Qt::LeftButton) {\n this->mouseDown_ = true;\n this->mouseDownX_ = this->getXRect().contains(event->pos());\n\n this->notebook_->select(page);\n }\n\n this->update();\n\n if (this->notebook_->getAllowUserTabManagement()) {\n switch (event->button()) {\n case Qt::RightButton: {\n this->menu_.popup(event->globalPos());\n } break;\n default:;\n }\n }\n}\n\nvoid NotebookTab::mouseReleaseEvent(QMouseEvent *event)\n{\n this->mouseDown_ = false;\n\n auto removeThisPage = [this] {\n auto reply = QMessageBox::question(\n this, \"Remove this tab\",\n \"Are you sure that you want to remove this tab?\",\n QMessageBox::Yes | QMessageBox::Cancel);\n\n if (reply == QMessageBox::Yes) {\n this->notebook_->removePage(this->page);\n }\n };\n\n if (event->button() == Qt::MiddleButton) {\n if (this->rect().contains(event->pos())) {\n removeThisPage();\n }\n } else {\n if (this->hasXButton() && this->mouseDownX_ &&\n this->getXRect().contains(event->pos())) {\n this->mouseDownX_ = false;\n\n removeThisPage();\n } else {\n this->update();\n }\n }\n}\n\nvoid NotebookTab::enterEvent(QEvent *event)\n{\n this->mouseOver_ = true;\n\n this->update();\n\n Button::enterEvent(event);\n}\n\nvoid NotebookTab::leaveEvent(QEvent *event)\n{\n this->mouseOverX_ = false;\n this->mouseOver_ = false;\n\n this->update();\n\n Button::leaveEvent(event);\n}\n\nvoid NotebookTab::dragEnterEvent(QDragEnterEvent *event)\n{\n if (!event->mimeData()->hasFormat(\"chatterino\/split\")) return;\n\n if (!SplitContainer::isDraggingSplit) return;\n\n if (this->notebook_->getAllowUserTabManagement()) {\n this->notebook_->select(this->page);\n }\n}\n\nvoid NotebookTab::mouseMoveEvent(QMouseEvent *event)\n{\n auto app = getApp();\n\n if (getSettings()->showTabCloseButton &&\n this->notebook_->getAllowUserTabManagement()) \/\/\n {\n bool overX = this->getXRect().contains(event->pos());\n\n if (overX != this->mouseOverX_) {\n \/\/ Over X state has been changed (we either left or entered it;\n this->mouseOverX_ = overX;\n\n this->update();\n }\n }\n\n QPoint relPoint = this->mapToParent(event->pos());\n\n if (this->mouseDown_ && !this->getDesiredRect().contains(relPoint) &&\n this->notebook_->getAllowUserTabManagement()) \/\/\n {\n int index;\n QWidget *clickedPage =\n this->notebook_->tabAt(relPoint, index, this->width());\n\n if (clickedPage != nullptr && clickedPage != this->page) {\n this->notebook_->rearrangePage(this->page, index);\n }\n }\n\n Button::mouseMoveEvent(event);\n}\n\nvoid NotebookTab::wheelEvent(QWheelEvent *event)\n{\n if (event->delta() > 0) {\n this->notebook_->selectPreviousTab();\n } else {\n this->notebook_->selectNextTab();\n }\n}\n\nQRect NotebookTab::getXRect()\n{\n \/\/ if (!this->notebook->getAllowUserTabManagement()) {\n \/\/ return QRect();\n \/\/ }\n\n float s = this->getScale();\n return QRect(this->width() - static_cast<int>(20 * s),\n static_cast<int>(9 * s), static_cast<int>(16 * s),\n static_cast<int>(16 * s));\n}\n\n} \/\/ namespace chatterino\n<commit_msg>got triggered by pixels<commit_after>#include \"widgets\/helper\/NotebookTab.hpp\"\n\n#include \"Application.hpp\"\n#include \"common\/Common.hpp\"\n#include \"debug\/Log.hpp\"\n#include \"singletons\/Fonts.hpp\"\n#include \"singletons\/Settings.hpp\"\n#include \"singletons\/Theme.hpp\"\n#include \"singletons\/WindowManager.hpp\"\n#include \"util\/Clamp.hpp\"\n#include \"util\/Helpers.hpp\"\n#include \"widgets\/Notebook.hpp\"\n#include \"widgets\/dialogs\/SettingsDialog.hpp\"\n#include \"widgets\/dialogs\/TextInputDialog.hpp\"\n#include \"widgets\/splits\/SplitContainer.hpp\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QLinearGradient>\n#include <QMimeData>\n#include <QPainter>\n#include <boost\/bind.hpp>\n\nnamespace chatterino {\n\nNotebookTab::NotebookTab(Notebook *notebook)\n : Button(notebook)\n , positionChangedAnimation_(this, \"pos\")\n , notebook_(notebook)\n , menu_(this)\n{\n auto app = getApp();\n\n this->setAcceptDrops(true);\n\n this->positionChangedAnimation_.setEasingCurve(\n QEasingCurve(QEasingCurve::InCubic));\n\n getSettings()->showTabCloseButton.connect(\n boost::bind(&NotebookTab::hideTabXChanged, this, _1),\n this->managedConnections_);\n\n this->setMouseTracking(true);\n\n this->menu_.addAction(\"Rename\", [this]() {\n TextInputDialog d(this);\n\n d.setWindowTitle(\n \"Change tab title (Leave empty for default behaviour)\");\n d.setText(this->getCustomTitle());\n d.highlightText();\n\n if (d.exec() == QDialog::Accepted) {\n QString newTitle = d.getText();\n this->setCustomTitle(newTitle);\n }\n });\n\n this->menu_.addAction(\"Close\",\n [=]() { this->notebook_->removePage(this->page); });\n\n highlightNewMessagesAction_ =\n new QAction(\"Enable highlights on new messages\", &this->menu_);\n highlightNewMessagesAction_->setCheckable(true);\n highlightNewMessagesAction_->setChecked(highlightEnabled_);\n QObject::connect(\n highlightNewMessagesAction_, &QAction::triggered,\n [this](bool checked) { this->highlightEnabled_ = checked; });\n this->menu_.addAction(highlightNewMessagesAction_);\n}\n\nvoid NotebookTab::themeChangedEvent()\n{\n this->update();\n\n \/\/ this->setMouseEffectColor(QColor(\"#999\"));\n this->setMouseEffectColor(this->theme->tabs.regular.text);\n}\n\nvoid NotebookTab::updateSize()\n{\n float scale = getScale();\n\n int width;\n QFontMetrics metrics = getApp()->fonts->getFontMetrics(\n FontStyle::UiTabs,\n float(qreal(this->getScale()) * this->devicePixelRatioF()));\n\n if (this->hasXButton()) {\n width = (metrics.width(this->getTitle()) + int(32 * scale));\n } else {\n width = (metrics.width(this->getTitle()) + int(16 * scale));\n }\n\n width = clamp(width, this->height(), int(150 * scale));\n\n if (this->width() != width) {\n this->resize(width, int(NOTEBOOK_TAB_HEIGHT * scale));\n this->notebook_->performLayout();\n }\n}\n\nconst QString &NotebookTab::getCustomTitle() const\n{\n return this->customTitle_;\n}\n\nvoid NotebookTab::setCustomTitle(const QString &newTitle)\n{\n if (this->customTitle_ != newTitle) {\n this->customTitle_ = newTitle;\n this->titleUpdated();\n }\n}\n\nvoid NotebookTab::resetCustomTitle()\n{\n this->setCustomTitle(QString());\n}\n\nbool NotebookTab::hasCustomTitle() const\n{\n return !this->customTitle_.isEmpty();\n}\n\nvoid NotebookTab::setDefaultTitle(const QString &title)\n{\n if (this->defaultTitle_ != title) {\n this->defaultTitle_ = title;\n\n if (this->customTitle_.isEmpty()) {\n this->titleUpdated();\n }\n }\n}\n\nconst QString &NotebookTab::getDefaultTitle() const\n{\n return this->defaultTitle_;\n}\n\nconst QString &NotebookTab::getTitle() const\n{\n return this->customTitle_.isEmpty() ? this->defaultTitle_\n : this->customTitle_;\n}\n\nvoid NotebookTab::titleUpdated()\n{\n \/\/ Queue up save because: Tab title changed\n getApp()->windows->queueSave();\n\n this->updateSize();\n this->update();\n}\n\nbool NotebookTab::isSelected() const\n{\n return this->selected_;\n}\n\nvoid NotebookTab::setSelected(bool value)\n{\n this->selected_ = value;\n\n this->highlightState_ = HighlightState::None;\n\n this->update();\n}\n\nvoid NotebookTab::setLive(bool isLive)\n{\n if (this->isLive_ != isLive) {\n this->isLive_ = isLive;\n this->update();\n }\n}\n\nvoid NotebookTab::setHighlightState(HighlightState newHighlightStyle)\n{\n if (this->isSelected() || !this->highlightEnabled_) {\n return;\n }\n if (this->highlightState_ != HighlightState::Highlighted) {\n this->highlightState_ = newHighlightStyle;\n\n this->update();\n }\n}\n\nvoid NotebookTab::setHighlightsEnabled(const bool &newVal)\n{\n this->highlightNewMessagesAction_->setChecked(newVal);\n this->highlightEnabled_ = newVal;\n}\n\nbool NotebookTab::hasHighlightsEnabled() const\n{\n return this->highlightEnabled_;\n}\n\nQRect NotebookTab::getDesiredRect() const\n{\n return QRect(this->positionAnimationDesiredPoint_, size());\n}\n\nvoid NotebookTab::hideTabXChanged(bool)\n{\n this->updateSize();\n this->update();\n}\n\nvoid NotebookTab::moveAnimated(QPoint pos, bool animated)\n{\n this->positionAnimationDesiredPoint_ = pos;\n\n QWidget *w = this->window();\n\n if ((w != nullptr && !w->isVisible()) || !animated ||\n !this->positionChangedAnimationRunning_) {\n this->move(pos);\n\n this->positionChangedAnimationRunning_ = true;\n return;\n }\n\n if (this->positionChangedAnimation_.endValue() == pos) {\n return;\n }\n\n this->positionChangedAnimation_.stop();\n this->positionChangedAnimation_.setDuration(75);\n this->positionChangedAnimation_.setStartValue(this->pos());\n this->positionChangedAnimation_.setEndValue(pos);\n this->positionChangedAnimation_.start();\n}\n\nvoid NotebookTab::paintEvent(QPaintEvent *)\n{\n auto app = getApp();\n QPainter painter(this);\n float scale = this->getScale();\n\n painter.setFont(getApp()->fonts->getFont(\n FontStyle::UiTabs,\n scale * 96.f \/ this->logicalDpiX() * this->devicePixelRatioF()));\n QFontMetrics metrics = app->fonts->getFontMetrics(\n FontStyle::UiTabs,\n scale * 96.f \/ this->logicalDpiX() * this->devicePixelRatioF());\n\n int height = int(scale * NOTEBOOK_TAB_HEIGHT);\n \/\/ int fullHeight = (int)(scale * 48);\n\n \/\/ select the right tab colors\n Theme::TabColors colors;\n Theme::TabColors regular = this->theme->tabs.regular;\n\n if (this->selected_) {\n colors = this->theme->tabs.selected;\n } else if (this->highlightState_ == HighlightState::Highlighted) {\n colors = this->theme->tabs.highlighted;\n } else if (this->highlightState_ == HighlightState::NewMessage) {\n colors = this->theme->tabs.newMessage;\n } else {\n colors = this->theme->tabs.regular;\n }\n\n bool windowFocused = this->window() == QApplication::activeWindow();\n \/\/ || SettingsDialog::getHandle() == QApplication::activeWindow();\n\n QBrush tabBackground = \/*this->mouseOver_ ? colors.backgrounds.hover\n :*\/\n (windowFocused ? colors.backgrounds.regular\n : colors.backgrounds.unfocused);\n\n \/\/ painter.fillRect(rect(), this->mouseOver_ ? regular.backgrounds.hover\n \/\/ : (windowFocused ?\n \/\/ regular.backgrounds.regular\n \/\/ :\n \/\/ regular.backgrounds.unfocused));\n\n \/\/ fill the tab background\n auto bgRect = rect();\n bgRect.setTop(bgRect.top() + 2);\n\n painter.fillRect(bgRect, tabBackground);\n\n \/\/ draw border\n \/\/ painter.setPen(QPen(\"#fff\"));\n \/\/ QPainterPath path(QPointF(0, height));\n \/\/ path.lineTo(0, 0);\n \/\/ path.lineTo(this->width() - 1, 0);\n \/\/ path.lineTo(this->width() - 1, this->height() - 1);\n \/\/ path.lineTo(0, this->height() - 1);\n \/\/ painter.drawPath(path);\n\n \/\/ top line\n painter.fillRect(\n QRectF(0, (this->selected_ ? 0.f : 1.f) * scale, this->width(),\n (this->selected_ ? 2.f : 1.f) * scale),\n this->mouseOver_\n ? colors.line.hover\n : (windowFocused ? colors.line.regular : colors.line.unfocused));\n\n \/\/ draw live indicator\n if (this->isLive_) {\n painter.setPen(QColor(Qt::GlobalColor::red));\n QBrush b;\n b.setColor(QColor(Qt::GlobalColor::red));\n b.setStyle(Qt::SolidPattern);\n painter.setBrush(b);\n\n auto x = this->width() - (7.f * scale);\n auto y = 4.f * scale;\n auto diameter = 4.f * scale;\n painter.drawEllipse(QRectF(x, y, diameter, diameter));\n }\n\n \/\/ set the pen color\n painter.setPen(colors.text);\n\n \/\/ set area for text\n int rectW = (!getSettings()->showTabCloseButton ? 0 : int(16 * scale));\n QRect rect(0, 0, this->width() - rectW, height);\n\n \/\/ draw text\n int offset = int(scale * 8);\n QRect textRect(offset, this->selected_ ? 1 : 2,\n this->width() - offset - offset, height);\n\n if (this->shouldDrawXButton()) {\n textRect.setRight(textRect.right() - this->height() \/ 2);\n }\n\n int width = metrics.width(this->getTitle());\n Qt::Alignment alignment = width > textRect.width()\n ? Qt::AlignLeft | Qt::AlignVCenter\n : Qt::AlignHCenter | Qt::AlignVCenter;\n\n QTextOption option(alignment);\n option.setWrapMode(QTextOption::NoWrap);\n painter.drawText(textRect, this->getTitle(), option);\n\n \/\/ draw close x\n if (this->shouldDrawXButton()) {\n QRect xRect = this->getXRect();\n if (!xRect.isNull()) {\n if (this->selected_) xRect.moveTop(xRect.top() - 1);\n\n painter.setBrush(QColor(\"#fff\"));\n\n if (this->mouseOverX_) {\n painter.fillRect(xRect, QColor(0, 0, 0, 64));\n\n if (this->mouseDownX_) {\n painter.fillRect(xRect, QColor(0, 0, 0, 64));\n }\n }\n\n int a = static_cast<int>(scale * 4);\n\n painter.drawLine(xRect.topLeft() + QPoint(a, a),\n xRect.bottomRight() + QPoint(-a, -a));\n painter.drawLine(xRect.topRight() + QPoint(-a, a),\n xRect.bottomLeft() + QPoint(a, -a));\n }\n }\n\n \/\/ draw line at bottom\n if (!this->selected_) {\n painter.fillRect(0, this->height() - 1, this->width(), 1,\n app->themes->window.background);\n\n this->fancyPaint(painter);\n }\n}\n\nbool NotebookTab::hasXButton()\n{\n return getSettings()->showTabCloseButton &&\n this->notebook_->getAllowUserTabManagement();\n}\n\nbool NotebookTab::shouldDrawXButton()\n{\n return this->hasXButton() && (this->mouseOver_ || this->selected_);\n}\n\nvoid NotebookTab::mousePressEvent(QMouseEvent *event)\n{\n if (event->button() == Qt::LeftButton) {\n this->mouseDown_ = true;\n this->mouseDownX_ = this->getXRect().contains(event->pos());\n\n this->notebook_->select(page);\n }\n\n this->update();\n\n if (this->notebook_->getAllowUserTabManagement()) {\n switch (event->button()) {\n case Qt::RightButton: {\n this->menu_.popup(event->globalPos());\n } break;\n default:;\n }\n }\n}\n\nvoid NotebookTab::mouseReleaseEvent(QMouseEvent *event)\n{\n this->mouseDown_ = false;\n\n auto removeThisPage = [this] {\n auto reply = QMessageBox::question(\n this, \"Remove this tab\",\n \"Are you sure that you want to remove this tab?\",\n QMessageBox::Yes | QMessageBox::Cancel);\n\n if (reply == QMessageBox::Yes) {\n this->notebook_->removePage(this->page);\n }\n };\n\n if (event->button() == Qt::MiddleButton) {\n if (this->rect().contains(event->pos())) {\n removeThisPage();\n }\n } else {\n if (this->hasXButton() && this->mouseDownX_ &&\n this->getXRect().contains(event->pos())) {\n this->mouseDownX_ = false;\n\n removeThisPage();\n } else {\n this->update();\n }\n }\n}\n\nvoid NotebookTab::enterEvent(QEvent *event)\n{\n this->mouseOver_ = true;\n\n this->update();\n\n Button::enterEvent(event);\n}\n\nvoid NotebookTab::leaveEvent(QEvent *event)\n{\n this->mouseOverX_ = false;\n this->mouseOver_ = false;\n\n this->update();\n\n Button::leaveEvent(event);\n}\n\nvoid NotebookTab::dragEnterEvent(QDragEnterEvent *event)\n{\n if (!event->mimeData()->hasFormat(\"chatterino\/split\")) return;\n\n if (!SplitContainer::isDraggingSplit) return;\n\n if (this->notebook_->getAllowUserTabManagement()) {\n this->notebook_->select(this->page);\n }\n}\n\nvoid NotebookTab::mouseMoveEvent(QMouseEvent *event)\n{\n auto app = getApp();\n\n if (getSettings()->showTabCloseButton &&\n this->notebook_->getAllowUserTabManagement()) \/\/\n {\n bool overX = this->getXRect().contains(event->pos());\n\n if (overX != this->mouseOverX_) {\n \/\/ Over X state has been changed (we either left or entered it;\n this->mouseOverX_ = overX;\n\n this->update();\n }\n }\n\n QPoint relPoint = this->mapToParent(event->pos());\n\n if (this->mouseDown_ && !this->getDesiredRect().contains(relPoint) &&\n this->notebook_->getAllowUserTabManagement()) \/\/\n {\n int index;\n QWidget *clickedPage =\n this->notebook_->tabAt(relPoint, index, this->width());\n\n if (clickedPage != nullptr && clickedPage != this->page) {\n this->notebook_->rearrangePage(this->page, index);\n }\n }\n\n Button::mouseMoveEvent(event);\n}\n\nvoid NotebookTab::wheelEvent(QWheelEvent *event)\n{\n if (event->delta() > 0) {\n this->notebook_->selectPreviousTab();\n } else {\n this->notebook_->selectNextTab();\n }\n}\n\nQRect NotebookTab::getXRect()\n{\n \/\/ if (!this->notebook->getAllowUserTabManagement()) {\n \/\/ return QRect();\n \/\/ }\n\n float s = this->getScale();\n return QRect(this->width() - static_cast<int>(20 * s),\n static_cast<int>(9 * s), static_cast<int>(16 * s),\n static_cast<int>(16 * s));\n}\n\n} \/\/ namespace chatterino\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n#define STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stdexcept>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * The evaluated gradient is stored into a\n * <code>Eigen::VectorXd<\/code> named <code>grad_fx<\/code>.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_fx Gradient of function at argument\n *\/\ntemplate <typename F>\nvoid gradient(const F& f, const Eigen::Matrix<double, Eigen::Dynamic, 1>& x,\n double& fx, Eigen::Matrix<double, Eigen::Dynamic, 1>& grad_fx) {\n nested_rev_autodiff nested;\n\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x);\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad_fx.resize(x.size());\n grad(fx_var.vi_);\n grad_fx = x_var.adj();\n}\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * The evaluated gradient is stored into the object whose data\n * begins at <code>*first_grad_fx<\/code> and ends at\n * <code>*last_grad_fx<\/code>. The caller is responsible for\n * ensuring the size of the object pointed to by\n * <code>first_grad_fx<\/code> matches the size of the argument\n * <code>x<\/code>.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @tparam EigVec Type of Eigen vector\n * @tparam InputIt must meet the requirements of [LegacyInputIterator](https:\/\/en.cppreference.com\/w\/cpp\/named_req\/InputIterator).\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] first_grad_fx First element of gradient of function at argument\n * @param[out] last_grad_fx Last element of gradient of function at argument\n * @throw std::invalid_argument if the iterator isn't the right size\n * to hold the gradients\n *\/\ntemplate <typename F, typename EigVec, typename InputIt,\n require_eigen_vector_vt<std::is_arithmetic, EigVec>* = nullptr>\nvoid gradient(const F& f, const EigVec& x, double& fx, InputIt first_grad_fx,\n InputIt last_grad_fx) {\n nested_rev_autodiff nested;\n\n if (last_grad_fx - first_grad_fx != x.size()) {\n std::stringstream s;\n s << \"gradient(): iterator and gradient different sizes; iterator size = \"\n << last_grad_fx - first_grad_fx << \"; grad size = \" << x.size()\n << std::endl;\n throw std::invalid_argument(s.str());\n }\n\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x);\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad(fx_var.vi_);\n for (Eigen::VectorXd::Index i = 0; i < x_var.size(); ++i) {\n *first_grad_fx++ = x_var.coeff(i).adj();\n }\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>[Jenkins] auto-formatting by clang-format version 10.0.0-4ubuntu1<commit_after>#ifndef STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n#define STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stdexcept>\n#include <vector>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * The evaluated gradient is stored into a\n * <code>Eigen::VectorXd<\/code> named <code>grad_fx<\/code>.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_fx Gradient of function at argument\n *\/\ntemplate <typename F>\nvoid gradient(const F& f, const Eigen::Matrix<double, Eigen::Dynamic, 1>& x,\n double& fx, Eigen::Matrix<double, Eigen::Dynamic, 1>& grad_fx) {\n nested_rev_autodiff nested;\n\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x);\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad_fx.resize(x.size());\n grad(fx_var.vi_);\n grad_fx = x_var.adj();\n}\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * The evaluated gradient is stored into the object whose data\n * begins at <code>*first_grad_fx<\/code> and ends at\n * <code>*last_grad_fx<\/code>. The caller is responsible for\n * ensuring the size of the object pointed to by\n * <code>first_grad_fx<\/code> matches the size of the argument\n * <code>x<\/code>.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @tparam EigVec Type of Eigen vector\n * @tparam InputIt must meet the requirements of\n * [LegacyInputIterator](https:\/\/en.cppreference.com\/w\/cpp\/named_req\/InputIterator).\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] first_grad_fx First element of gradient of function at argument\n * @param[out] last_grad_fx Last element of gradient of function at argument\n * @throw std::invalid_argument if the iterator isn't the right size\n * to hold the gradients\n *\/\ntemplate <typename F, typename EigVec, typename InputIt,\n require_eigen_vector_vt<std::is_arithmetic, EigVec>* = nullptr>\nvoid gradient(const F& f, const EigVec& x, double& fx, InputIt first_grad_fx,\n InputIt last_grad_fx) {\n nested_rev_autodiff nested;\n\n if (last_grad_fx - first_grad_fx != x.size()) {\n std::stringstream s;\n s << \"gradient(): iterator and gradient different sizes; iterator size = \"\n << last_grad_fx - first_grad_fx << \"; grad size = \" << x.size()\n << std::endl;\n throw std::invalid_argument(s.str());\n }\n\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x);\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad(fx_var.vi_);\n for (Eigen::VectorXd::Index i = 0; i < x_var.size(); ++i) {\n *first_grad_fx++ = x_var.coeff(i).adj();\n }\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/-------------------------------------------------------------------------\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2015 Andrew Duncan\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the\n\/\/ \"Software\"), to deal in the Software without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to\n\/\/ permit persons to whom the Software is furnished to do so, subject to\n\/\/ the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\/\/ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n\/\/ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\/\/ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n\/\/ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\/\/-------------------------------------------------------------------------\n\n#ifndef __STDC_FORMAT_MACROS\n#define __STDC_FORMAT_MACROS\n#endif\n\n#include <cmath>\n#include <cstdint>\n#include <regex>\n#include <stdexcept>\n#include <string>\n\n#include <unistd.h>\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunused-but-set-variable\"\n#include <bcm_host.h>\n#pragma GCC diagnostic pop\n\n#include \"font.h\"\n#include \"temperatureTrace.h\"\n\n\/\/-------------------------------------------------------------------------\n\nint8_t\nCTemperatureTrace::\ngetTemperature()\n{\n double temperature = 0.0;\n\n char buffer[128];\n\n memset(buffer, 0, sizeof(buffer));\n\n if (vc_gencmd(buffer, sizeof(buffer), \"measure_temp\") == 0)\n {\n try\n {\n std::regex pattern{R\"(temp=(\\d+\\.\\d)'C)\"};\n std::smatch match;\n\n if (std::regex_search(std::string(buffer), match, pattern) &&\n (match.size() == 2))\n {\n std::string found = match[1].str();\n temperature = round(stod(found));\n }\n }\n catch (std::exception&)\n {\n \/\/ ignore\n }\n }\n\n return static_cast<int8_t>(temperature);\n}\n\n\/\/-------------------------------------------------------------------------\n\nCTemperatureTrace::\nCTemperatureTrace(\n int16_t width,\n int16_t traceHeight,\n int16_t yPosition,\n int16_t gridHeight)\n:\n CTrace(width,\n traceHeight,\n yPosition,\n gridHeight,\n 1,\n \"Temperature\",\n std::vector<std::string>{\"temperature\"},\n std::vector<raspifb16::CRGB565>{{102,167,225}}),\n m_traceHeight(traceHeight)\n{\n}\n\n\/\/-------------------------------------------------------------------------\n\nvoid\nCTemperatureTrace::\nshow(\n const raspifb16::CFrameBuffer565& fb,\n time_t now)\n{\n int8_t temperature = (getTemperature() * m_traceHeight) \/ 100;\n\n update(std::vector<int8_t>{temperature}, now);\n\n putImage(fb);\n}\n\n<commit_msg>Removed unused #define<commit_after>\/\/-------------------------------------------------------------------------\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2015 Andrew Duncan\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the\n\/\/ \"Software\"), to deal in the Software without restriction, including\n\/\/ without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to\n\/\/ permit persons to whom the Software is furnished to do so, subject to\n\/\/ the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n\/\/ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n\/\/ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n\/\/ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n\/\/ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\/\/-------------------------------------------------------------------------\n\n#include <cmath>\n#include <cstdint>\n#include <regex>\n#include <stdexcept>\n#include <string>\n\n#include <unistd.h>\n\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wunused-but-set-variable\"\n#include <bcm_host.h>\n#pragma GCC diagnostic pop\n\n#include \"font.h\"\n#include \"temperatureTrace.h\"\n\n\/\/-------------------------------------------------------------------------\n\nint8_t\nCTemperatureTrace::\ngetTemperature()\n{\n double temperature = 0.0;\n\n char buffer[128];\n\n memset(buffer, 0, sizeof(buffer));\n\n if (vc_gencmd(buffer, sizeof(buffer), \"measure_temp\") == 0)\n {\n try\n {\n std::regex pattern{R\"(temp=(\\d+\\.\\d)'C)\"};\n std::smatch match;\n\n if (std::regex_search(std::string(buffer), match, pattern) &&\n (match.size() == 2))\n {\n std::string found = match[1].str();\n temperature = round(stod(found));\n }\n }\n catch (std::exception&)\n {\n \/\/ ignore\n }\n }\n\n return static_cast<int8_t>(temperature);\n}\n\n\/\/-------------------------------------------------------------------------\n\nCTemperatureTrace::\nCTemperatureTrace(\n int16_t width,\n int16_t traceHeight,\n int16_t yPosition,\n int16_t gridHeight)\n:\n CTrace(width,\n traceHeight,\n yPosition,\n gridHeight,\n 1,\n \"Temperature\",\n std::vector<std::string>{\"temperature\"},\n std::vector<raspifb16::CRGB565>{{102,167,225}}),\n m_traceHeight(traceHeight)\n{\n}\n\n\/\/-------------------------------------------------------------------------\n\nvoid\nCTemperatureTrace::\nshow(\n const raspifb16::CFrameBuffer565& fb,\n time_t now)\n{\n int8_t temperature = (getTemperature() * m_traceHeight) \/ 100;\n\n update(std::vector<int8_t>{temperature}, now);\n\n putImage(fb);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"remoting\/host\/capturer_gdi.h\"\n#include \"remoting\/host\/differ.h\"\n\n#include \"gfx\/rect.h\"\n\nnamespace remoting {\n\n\/\/ 3780 pixels per meter is equivalent to 96 DPI, typical on desktop monitors.\nstatic const int kPixelsPerMeter = 3780;\n\/\/ 32 bit RGBA is 4 bytes per pixel.\nstatic const int kBytesPerPixel = 4;\n\nCapturerGdi::CapturerGdi(MessageLoop* message_loop)\n : Capturer(message_loop),\n desktop_dc_(NULL),\n memory_dc_(NULL),\n capture_fullscreen_(true) {\n memset(target_bitmap_, 0, sizeof(target_bitmap_));\n memset(buffers_, 0, sizeof(buffers_));\n}\n\nCapturerGdi::~CapturerGdi() {\n ReleaseBuffers();\n}\n\nvoid CapturerGdi::ReleaseBuffers() {\n for (int i = kNumBuffers - 1; i >= 0; i--) {\n if (target_bitmap_[i]) {\n DeleteObject(target_bitmap_[i]);\n target_bitmap_[i] = NULL;\n }\n if (buffers_[i]) {\n DeleteObject(buffers_[i]);\n buffers_[i] = NULL;\n }\n }\n\n desktop_dc_ = NULL;\n if (memory_dc_) {\n DeleteDC(memory_dc_);\n memory_dc_ = NULL;\n }\n}\n\nvoid CapturerGdi::ScreenConfigurationChanged() {\n ReleaseBuffers();\n\n desktop_dc_ = GetDC(GetDesktopWindow());\n memory_dc_ = CreateCompatibleDC(desktop_dc_);\n\n \/\/ Create a bitmap to keep the desktop image.\n width_ = GetSystemMetrics(SM_CXSCREEN);\n height_ = GetSystemMetrics(SM_CYSCREEN);\n int rounded_width = (width_ + 3) & (~3);\n\n \/\/ Dimensions of screen.\n pixel_format_ = media::VideoFrame::RGB32;\n bytes_per_row_ = rounded_width * kBytesPerPixel;\n\n \/\/ Create a differ for this screen size.\n differ_.reset(new Differ(width_, height_, 4, bytes_per_row_));\n\n \/\/ Create a device independant bitmap (DIB) that is the same size.\n BITMAPINFO bmi;\n memset(&bmi, 0, sizeof(bmi));\n bmi.bmiHeader.biHeight = height_;\n bmi.bmiHeader.biWidth = width_;\n bmi.bmiHeader.biPlanes = 1;\n bmi.bmiHeader.biBitCount = kBytesPerPixel * 8;\n bmi.bmiHeader.biSize = sizeof(bmi.bmiHeader);\n bmi.bmiHeader.biSizeImage = bytes_per_row_ * height_;\n bmi.bmiHeader.biXPelsPerMeter = kPixelsPerMeter;\n bmi.bmiHeader.biYPelsPerMeter = kPixelsPerMeter;\n\n \/\/ Create memory for the buffers.\n for (int i = 0; i < kNumBuffers; i++) {\n target_bitmap_[i] = CreateDIBSection(desktop_dc_, &bmi, DIB_RGB_COLORS,\n static_cast<void**>(&buffers_[i]),\n NULL, 0);\n }\n\n capture_fullscreen_ = true;\n}\n\nvoid CapturerGdi::CalculateInvalidRects() {\n ClearInvalidRects();\n CaptureImage();\n\n if (capture_fullscreen_) {\n InvalidateFullScreen();\n } else {\n \/\/ Calculate the difference between the previous and current screen.\n int prev_buffer_id = current_buffer_ - 1;\n if (prev_buffer_id < 0) {\n prev_buffer_id = kNumBuffers - 1;\n }\n\n void* prev_buffer = buffers_[prev_buffer_id];\n void* curr_buffer = buffers_[current_buffer_];\n\n InvalidRects rects;\n differ_->CalcDirtyRects(prev_buffer, curr_buffer, &rects);\n\n InvalidateRects(rects);\n }\n\n capture_fullscreen_ = false;\n}\n\nvoid CapturerGdi::CaptureRects(const InvalidRects& rects,\n CaptureCompletedCallback* callback) {\n DataPlanes planes;\n planes.data[0] = static_cast<uint8*>(buffers_[current_buffer_]);\n planes.strides[0] = bytes_per_row_;\n\n scoped_refptr<CaptureData> data(new CaptureData(planes,\n width(),\n height(),\n pixel_format()));\n data->mutable_dirty_rects() = rects;\n\n FinishCapture(data, callback);\n}\n\nvoid CapturerGdi::CaptureImage() {\n \/\/ Select the target bitmap into the memory dc.\n SelectObject(memory_dc_, target_bitmap_[current_buffer_]);\n\n \/\/ And then copy the rect from desktop to memory.\n BitBlt(memory_dc_, 0, 0, width_, height_, desktop_dc_, 0, 0,\n SRCCOPY | CAPTUREBLT);\n}\n\n} \/\/ namespace remoting\n<commit_msg>Fix GDI capturer initialization.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"remoting\/host\/capturer_gdi.h\"\n#include \"remoting\/host\/differ.h\"\n\n#include \"gfx\/rect.h\"\n\nnamespace remoting {\n\n\/\/ 3780 pixels per meter is equivalent to 96 DPI, typical on desktop monitors.\nstatic const int kPixelsPerMeter = 3780;\n\/\/ 32 bit RGBA is 4 bytes per pixel.\nstatic const int kBytesPerPixel = 4;\n\nCapturerGdi::CapturerGdi(MessageLoop* message_loop)\n : Capturer(message_loop),\n desktop_dc_(NULL),\n memory_dc_(NULL),\n capture_fullscreen_(true) {\n memset(target_bitmap_, 0, sizeof(target_bitmap_));\n memset(buffers_, 0, sizeof(buffers_));\n ScreenConfigurationChanged();\n}\n\nCapturerGdi::~CapturerGdi() {\n ReleaseBuffers();\n}\n\nvoid CapturerGdi::ReleaseBuffers() {\n for (int i = kNumBuffers - 1; i >= 0; i--) {\n if (target_bitmap_[i]) {\n DeleteObject(target_bitmap_[i]);\n target_bitmap_[i] = NULL;\n }\n if (buffers_[i]) {\n DeleteObject(buffers_[i]);\n buffers_[i] = NULL;\n }\n }\n\n desktop_dc_ = NULL;\n if (memory_dc_) {\n DeleteDC(memory_dc_);\n memory_dc_ = NULL;\n }\n}\n\nvoid CapturerGdi::ScreenConfigurationChanged() {\n ReleaseBuffers();\n\n desktop_dc_ = GetDC(GetDesktopWindow());\n memory_dc_ = CreateCompatibleDC(desktop_dc_);\n\n \/\/ Create a bitmap to keep the desktop image.\n width_ = GetSystemMetrics(SM_CXSCREEN);\n height_ = GetSystemMetrics(SM_CYSCREEN);\n int rounded_width = (width_ + 3) & (~3);\n\n \/\/ Dimensions of screen.\n pixel_format_ = media::VideoFrame::RGB32;\n bytes_per_row_ = rounded_width * kBytesPerPixel;\n\n \/\/ Create a differ for this screen size.\n differ_.reset(new Differ(width_, height_, 4, bytes_per_row_));\n\n \/\/ Create a device independant bitmap (DIB) that is the same size.\n BITMAPINFO bmi;\n memset(&bmi, 0, sizeof(bmi));\n bmi.bmiHeader.biHeight = height_;\n bmi.bmiHeader.biWidth = width_;\n bmi.bmiHeader.biPlanes = 1;\n bmi.bmiHeader.biBitCount = kBytesPerPixel * 8;\n bmi.bmiHeader.biSize = sizeof(bmi.bmiHeader);\n bmi.bmiHeader.biSizeImage = bytes_per_row_ * height_;\n bmi.bmiHeader.biXPelsPerMeter = kPixelsPerMeter;\n bmi.bmiHeader.biYPelsPerMeter = kPixelsPerMeter;\n\n \/\/ Create memory for the buffers.\n for (int i = 0; i < kNumBuffers; i++) {\n target_bitmap_[i] = CreateDIBSection(desktop_dc_, &bmi, DIB_RGB_COLORS,\n static_cast<void**>(&buffers_[i]),\n NULL, 0);\n }\n\n capture_fullscreen_ = true;\n}\n\nvoid CapturerGdi::CalculateInvalidRects() {\n ClearInvalidRects();\n CaptureImage();\n\n if (capture_fullscreen_) {\n InvalidateFullScreen();\n } else {\n \/\/ Calculate the difference between the previous and current screen.\n int prev_buffer_id = current_buffer_ - 1;\n if (prev_buffer_id < 0) {\n prev_buffer_id = kNumBuffers - 1;\n }\n\n void* prev_buffer = buffers_[prev_buffer_id];\n void* curr_buffer = buffers_[current_buffer_];\n\n InvalidRects rects;\n differ_->CalcDirtyRects(prev_buffer, curr_buffer, &rects);\n\n InvalidateRects(rects);\n }\n\n capture_fullscreen_ = false;\n}\n\nvoid CapturerGdi::CaptureRects(const InvalidRects& rects,\n CaptureCompletedCallback* callback) {\n DataPlanes planes;\n planes.data[0] = static_cast<uint8*>(buffers_[current_buffer_]);\n planes.strides[0] = bytes_per_row_;\n\n scoped_refptr<CaptureData> data(new CaptureData(planes,\n width(),\n height(),\n pixel_format()));\n data->mutable_dirty_rects() = rects;\n\n FinishCapture(data, callback);\n}\n\nvoid CapturerGdi::CaptureImage() {\n \/\/ Select the target bitmap into the memory dc.\n SelectObject(memory_dc_, target_bitmap_[current_buffer_]);\n\n \/\/ And then copy the rect from desktop to memory.\n BitBlt(memory_dc_, 0, 0, width_, height_, desktop_dc_, 0, 0,\n SRCCOPY | CAPTUREBLT);\n}\n\n} \/\/ namespace remoting\n<|endoftext|>"} {"text":"<commit_before>#ifndef ENUMERABLE__H__\n#define ENUMERABLE__H__\n\n#include <iterbase.hpp>\n\n#include <utility>\n#include <iterator>\n#include <functional>\n#include <initializer_list>\n\n\n\/\/ enumerate functionality for python-style for-each enumerate loops\n\/\/ for (auto e : enumerate(vec)) {\n\/\/ std::cout << e.index\n\/\/ << \": \"\n\/\/ << e.element\n\/\/ << '\\n';\n\/\/ }\n\n\nnamespace iter {\n\n \/\/Forward declarations of Enumerable and enumerate\n template <typename Container>\n class Enumerable;\n\n template <typename T>\n Enumerable<std::initializer_list<T>> enumerate(\n std::initializer_list<T> &&);\n\n template <typename Container>\n Enumerable<Container> enumerate(Container &&);\n\n template <typename Container>\n class Enumerable : public IterBase<Container>{\n public:\n Container & container;\n\n \/\/ The only thing allowed to directly instantiate an Enumerable is\n \/\/ the enumerate function\n friend Enumerable enumerate<Container>(Container &&);\n template <typename T>\n friend Enumerable<std::initializer_list<T>> enumerate(std::initializer_list<T> &&);\n\n using typename IterBase<Container>::contained_iter_type;\n\n using typename IterBase<Container>::contained_iter_ret;\n\n Enumerable(Container && container) : container(container) { }\n \n public:\n \/\/ Value constructor for use only in the enumerate function\n Enumerable () = delete;\n Enumerable & operator=(const Enumerable &) = delete;\n\n Enumerable(const Enumerable &) = default;\n\n \/\/ \"yielded\" by the Enumerable::Iterator. Has a .index, and a \n \/\/ .element referencing the value yielded by the subiterator\n class IterYield {\n public:\n std::size_t index;\n contained_iter_ret element;\n IterYield(std::size_t i, contained_iter_ret elem) : \n index(i),\n element(elem)\n { }\n };\n\n \/\/ Holds an iterator of the contained type and a size_t for the\n \/\/ index. Each call to ++ increments both of these data members.\n \/\/ Each dereference returns an IterYield.\n class Iterator {\n private:\n contained_iter_type sub_iter;\n std::size_t index;\n public:\n Iterator (contained_iter_type si) :\n sub_iter(si),\n index(0) { } \n\n IterYield operator*() const {\n return IterYield(this->index, *this->sub_iter);\n }\n\n Iterator & operator++() { \n ++this->sub_iter;\n ++this->index;\n return *this;\n }\n\n bool operator!=(const Iterator & other) const {\n return this->sub_iter != other.sub_iter;\n }\n };\n\n Iterator begin() const {\n return Iterator(std::begin(this->container));\n }\n\n Iterator end() const {\n return Iterator(std::end(this->container));\n }\n\n };\n\n \/\/ Helper function to instantiate an Enumerable\n template <typename Container>\n Enumerable<Container> enumerate(Container && container) {\n return Enumerable<Container>(std::forward<Container>(container));\n }\n\n template <typename T>\n Enumerable<std::initializer_list<T>> enumerate(std::initializer_list<T> && il)\n {\n return Enumerable<std::initializer_list<T>>(\n std::forward<std::initializer_list<T>>(il));\n }\n\n}\n\n#endif \/\/ifndef ENUMERABLE__H__\n<commit_msg>Restores privacy to enumerate<commit_after>#ifndef ENUMERABLE__H__\n#define ENUMERABLE__H__\n\n#include <iterbase.hpp>\n\n#include <utility>\n#include <iterator>\n#include <functional>\n#include <initializer_list>\n\n\n\/\/ enumerate functionality for python-style for-each enumerate loops\n\/\/ for (auto e : enumerate(vec)) {\n\/\/ std::cout << e.index\n\/\/ << \": \"\n\/\/ << e.element\n\/\/ << '\\n';\n\/\/ }\n\n\nnamespace iter {\n\n \/\/Forward declarations of Enumerable and enumerate\n template <typename Container>\n class Enumerable;\n\n template <typename T>\n Enumerable<std::initializer_list<T>> enumerate(\n std::initializer_list<T> &&);\n\n template <typename Container>\n Enumerable<Container> enumerate(Container &&);\n\n template <typename Container>\n class Enumerable : public IterBase<Container>{\n private:\n Container & container;\n\n \/\/ The only thing allowed to directly instantiate an Enumerable is\n \/\/ the enumerate function\n friend Enumerable enumerate<Container>(Container &&);\n template <typename T>\n friend Enumerable<std::initializer_list<T>> enumerate(std::initializer_list<T> &&);\n\n using typename IterBase<Container>::contained_iter_type;\n\n using typename IterBase<Container>::contained_iter_ret;\n\n Enumerable(Container && container) : container(container) { }\n \n public:\n \/\/ Value constructor for use only in the enumerate function\n Enumerable () = delete;\n Enumerable & operator=(const Enumerable &) = delete;\n\n Enumerable(const Enumerable &) = default;\n\n \/\/ \"yielded\" by the Enumerable::Iterator. Has a .index, and a \n \/\/ .element referencing the value yielded by the subiterator\n class IterYield {\n public:\n std::size_t index;\n contained_iter_ret element;\n IterYield(std::size_t i, contained_iter_ret elem) : \n index(i),\n element(elem)\n { }\n };\n\n \/\/ Holds an iterator of the contained type and a size_t for the\n \/\/ index. Each call to ++ increments both of these data members.\n \/\/ Each dereference returns an IterYield.\n class Iterator {\n private:\n contained_iter_type sub_iter;\n std::size_t index;\n public:\n Iterator (contained_iter_type si) :\n sub_iter(si),\n index(0) { } \n\n IterYield operator*() const {\n return IterYield(this->index, *this->sub_iter);\n }\n\n Iterator & operator++() { \n ++this->sub_iter;\n ++this->index;\n return *this;\n }\n\n bool operator!=(const Iterator & other) const {\n return this->sub_iter != other.sub_iter;\n }\n };\n\n Iterator begin() const {\n return Iterator(std::begin(this->container));\n }\n\n Iterator end() const {\n return Iterator(std::end(this->container));\n }\n\n };\n\n \/\/ Helper function to instantiate an Enumerable\n template <typename Container>\n Enumerable<Container> enumerate(Container && container) {\n return Enumerable<Container>(std::forward<Container>(container));\n }\n\n template <typename T>\n Enumerable<std::initializer_list<T>> enumerate(std::initializer_list<T> && il)\n {\n return Enumerable<std::initializer_list<T>>(\n std::forward<std::initializer_list<T>>(il));\n }\n\n}\n\n#endif \/\/ifndef ENUMERABLE__H__\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ObjectMatrix.cpp\n\/\/ Implementation of the Class ObjectMatrix\n\/\/ Created on: 07-Lie-2013 20:07:30\n\/\/ Original author: Povilas\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/*! \\class ObjectMatrix\n \\brief A class of methods and attributes for manipulating matrices.\n *\/\n#include \"ObjectMatrix.h\"\n#include \"AdditionalMethods.h\"\n#include \"ARFF.h\"\n#include \"DataObject.h\"\n#include <vector>\n#include <cmath>\n#include <iostream>\n#include <algorithm>\n\/\/#include <set>\n\n\/\/double ObjectMatrix::_weight = 0;\n\nObjectMatrix::ObjectMatrix()\n{\n DataObjects.reserve(0); \/\/1\n objectCount = 0;\n isClassPresent = false;\n}\n\nObjectMatrix::~ObjectMatrix()\n{\n}\n\nObjectMatrix::ObjectMatrix(std::string file)\n{\n fileName.assign(file);\n objectCount = 0;\n isClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int cnt)\n{\n DataObjects.reserve(cnt);\n objectCount = 0;\n\tisClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int n, int m)\n{\n DataObjects.reserve(n);\n for (int i = 0; i < n; i++)\n DataObjects[i].setNumOfFeatures(m);\n objectCount = 0;\nisClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int m, int n, int k)\n{\n std::vector<double> initialFeatures;\n initialFeatures.resize(k, 1.0);\n DataObject initial(initialFeatures);\n DataObjects2D.resize(m, std::vector<DataObject>(n, initial));\n objectCount = 0;\nisClassPresent = false;\n}\n\nvoid ObjectMatrix::addObject(DataObject object)\n{\n DataObjects.push_back(object);\n objectCount++;\n}\n\nvoid ObjectMatrix::addObject(DataObject object, int cls)\n{\n DataObjects.push_back(object);\n objectCount++;\n this->DataObjects.at(objectCount -1).setClassLabel(cls);\n}\n\nvoid ObjectMatrix::addObjectTo(int index, DataObject object)\n{\n DataObjects2D[index].push_back(object);\n objectCount++;\n}\n\nvoid ObjectMatrix::updateDataObject(int objectIndex, int featureIndex, double newValue)\n{\n this->DataObjects.at(objectIndex).updateFeature(featureIndex, newValue);\n}\n\nvoid ObjectMatrix::updateDataObjectClass(int objectIndex, int newClass)\n{\n this->DataObjects.at(objectIndex).setClassLabel(newClass);\n \/\/ this->isClassPresent = true;\n}\n\nbool ObjectMatrix::getPrintClass()\n{\n return this->isClassPresent;\n}\n\nvoid ObjectMatrix::setPrintClass(std::vector <std::string> printClass)\n{\n this->attributeStringClasses = printClass;\n this->isClassPresent = true;\n}\n\nvoid ObjectMatrix::updateDataObject(int rowIndex, int colIndex, int featureIndex, double newValue)\n{\n this->DataObjects2D[rowIndex].at(colIndex).updateFeature(featureIndex, newValue);\n}\n\nDataObject ObjectMatrix::getObjectAt(int index)\n{\n return DataObjects.at(index);\n}\n\nDataObject ObjectMatrix::getObjectAt(int row_index, int col_index)\n{\n return DataObjects2D[row_index].at(col_index);\n}\n\nint ObjectMatrix::getObjectCount()\n{\n return objectCount;\n}\n\nstd::vector<std::string> ObjectMatrix::getFeaturesTitle()\n{\n return featureTitles;\n}\n\nint ObjectMatrix::getClassCount()\n{\n int cCount = 0;\n if (!attributeStringClasses.empty())\n cCount = attributeStringClasses.size();\n return cCount;\n}\n\nvoid ObjectMatrix::addAtributes(std::vector<std::string> additionalAttributes)\n{\n this->additionalAttributes = additionalAttributes;\n}\n\nbool ObjectMatrix::getIsClassPresent()\n{\n return this->isClassPresent;\n}\n\nvoid ObjectMatrix::setIsClassPresent()\n{\n this->isClassPresent = true;\n}\n\nstd::vector <std::string> ObjectMatrix::getStringClassAttributes()\n{\n return this->attributeStringClasses;\n}\n\n\nvoid ObjectMatrix::loadDataMatrix()\n{\n const char* path = fileName.c_str();\n ARFF file(path);\n\n ObjectMatrix::_weight = 0;\n\n if (file.isSuccessfullyRead() == true) \/\/ successful read\n {\n std::vector< std::vector<double>> data = file.getData();\n \/\/featureTitles = file.getAttributes();\n if (file.isClassFound())\n {\n objClasses = file.getIntClass();\n attributeStringClasses = file.getAttributeStringClasses();\n \/\/isClassPresent = true;\n \/\/ std::cout << attributeStringClasses.size();\n }\n\n std::vector< std::vector<double>> ::iterator dataObjectIterator;\n\n std::vector<double>::iterator featureIterator;\n std::vector<double> dataObjectItems;\n int indx = 0;\n for(dataObjectIterator = data.begin(); dataObjectIterator!=data.end(); ++dataObjectIterator)\n {\n for(featureIterator = (*dataObjectIterator).begin(); featureIterator!=(*dataObjectIterator).end(); ++featureIterator)\n dataObjectItems.push_back(*featureIterator);\n\n if (file.isClassFound())\n {\n DataObject tmp(dataObjectItems, file.getObjectClass(indx));\n DataObjects.push_back(tmp);\n \/\/ std::cout << DataObjects.at(indx).getClassLabel() <<std::endl;\n }\n else\n {\n DataObject tmp(dataObjectItems);\n DataObjects.push_back(tmp);\n \/\/ std::cout << DataObjects.at(indx).getClassLabel() <<std::endl;\n }\n dataObjectItems.clear();\n indx++;\n }\n objectCount = DataObjects.size();\n\n \/\/Calculate matrix X distances between vectors\n\n \/\/ObjectMatrix::_weight = 0;\n int i, j, z;\n int n = data.at(0).size(); \/\/features\n double diff, sRow, tmpVal;\n\n \/\/ FILE *distFile;\n AdditionalMethods::distFile = fopen(AdditionalMethods::tempFileSavePath.c_str(), \"wb\");\n\n for (i = 0; i < objectCount - 1; i++)\n {\n for (j = i + 1; j < objectCount; j++)\n {\n sRow = 0.0;\n for (z = 0; z < n; z++)\n {\n diff = data.at(i).at(z) - data.at(j).at(z);\n sRow += diff * diff;\n }\n tmpVal = std::sqrt(sRow);\n fwrite(&tmpVal, sizeof(double), 1, AdditionalMethods::distFile);\n ObjectMatrix::_weight += sRow;\n }\n }\n \/\/ fclose(distFile);\n \/\/ end distance matrix calculation\n }\n else\n {\n \/\/_weight = 0;\n objectCount = 0;\n }\n}\nvoid ObjectMatrix::addComment(std::string comnt)\n{\n if (this->comments.empty())\n comments.reserve(0);\n comments.push_back(comnt);\n}\n\nvoid ObjectMatrix::saveDataMatrix(const char* path)\n{\n ARFF file;\n \/\/ std::vector <std::string> classLabels; classLabels.reserve(0);\n \/\/ std::vector <std::string> comment\n \/\/std::vector <int> tmp; \/\/ assume v has the elements\n \/*if (getPrintClass())\n {\n \/*for (int i = 0; i < DataObjects.size(); i++) \/\/pass only unique class labels that will be printed in @Attribute Class section\n {\n bool notFound = true;\n int tmpLabel = DataObjects.at(i).getClassLabel();\n for (int j = 0; j < classLabels.size(); j++)\n if (tmpLabel == classLabels.at(j))\n {\n notFound = false;\n break;\n }\n if (notFound)*\/\n \/\/ for (int j = 0; j < classLabels.size(); j++)\n \/\/ classLabels.push_back(tmpLabel);\n \/\/ classLabels = attributeStringClasses;\n \/\/}\n \/\/ classLabels = attributeClasses;\n\n std::vector <std::string> attributeLabels; attributeLabels.reserve(0);\n\n if (!additionalAttributes.empty())\n {\n for (int i = 0; i < getObjectAt(0).getFeatureCount() - additionalAttributes.size(); i++)\n attributeLabels.push_back(\"atr\" + std::to_string(static_cast<long long>(i+1)) + \" REAL\");\n\n for (int i = 0; i < additionalAttributes.size(); i++)\n {\n attributeLabels.push_back(additionalAttributes.at(i) + \" REAL\");\n \/\/ std::cout << attributeStringClasses.at(i);\n }\n }\n else\n {\n for (int i = 0; i < getObjectAt(0).getFeatureCount(); i++)\n attributeLabels.push_back(\"atr\" + std::to_string(static_cast<long long>(i+1)) + \" REAL\");\n }\n file.writeData(path, this->comments, this->DataObjects, attributeStringClasses, attributeLabels);\n}\n\nvoid ObjectMatrix::clearDataObjects()\n{\n DataObjects.clear();\n objectCount = 0;\n}\n\/*void ObjectMatrix::assignStringClassesAttribute(ObjectMatrix X)\n{\n this->attributeStringClasses = X.attributeStringClasses;\n}*\/\n\n\/*double ObjectMatrix::getDistanceBetween(int i, int j)\n{\n FILE *distFile;\n distFile = fopen(\"D:\\\\dist.txt\", \"rb\");\n\/\/ std::ifstream distFile;\n\/\/ distFile.open(\"D:\\\\dist.txt\", std::ios::binary);\n double retVal;\n int noOfBytes = sizeof(double);\n\n fseek(distFile, (noOfBytes * i) + noOfBytes * (j - i - 1), SEEK_SET);\n \/\/ fseek(distFile, 1, SEEK_SET);\n fread(&retVal, noOfBytes, 1, distFile);\n \/\/ distFile>>retVal;\n\n \/\/ std::cout << retVal << std::endl;\n fclose(distFile);\n\/\/ distFile.close();\n return retVal;\n \/\/return *(*(distances + i) + j - i - 1);\n}*\/\n\ndouble ObjectMatrix::getWeight()\n{\n return ObjectMatrix::_weight;\n}\n<commit_msg>Added MPI barrier for file reading<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ObjectMatrix.cpp\n\/\/ Implementation of the Class ObjectMatrix\n\/\/ Created on: 07-Lie-2013 20:07:30\n\/\/ Original author: Povilas\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/*! \\class ObjectMatrix\n \\brief A class of methods and attributes for manipulating matrices.\n *\/\n#include \"ObjectMatrix.h\"\n#include \"AdditionalMethods.h\"\n#include \"ARFF.h\"\n#include \"DataObject.h\"\n#include <vector>\n#include <cmath>\n#include <iostream>\n#include <algorithm>\n#include <mpi.h>\n\/\/#include <set>\n\n\/\/double ObjectMatrix::_weight = 0;\n\nObjectMatrix::ObjectMatrix()\n{\n DataObjects.reserve(0); \/\/1\n objectCount = 0;\n isClassPresent = false;\n}\n\nObjectMatrix::~ObjectMatrix()\n{\n}\n\nObjectMatrix::ObjectMatrix(std::string file)\n{\n fileName.assign(file);\n objectCount = 0;\n isClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int cnt)\n{\n \/\/ DataObjects.reserve(cnt);\n DataObjects.reserve(0);\n objectCount = 0;\n\tisClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int n, int m)\n{\n DataObjects.reserve(n);\n for (int i = 0; i < n; i++)\n DataObjects[i].setNumOfFeatures(m);\n objectCount = 0;\nisClassPresent = false;\n}\n\nObjectMatrix::ObjectMatrix(int m, int n, int k)\n{\n std::vector<double> initialFeatures;\n initialFeatures.resize(k, 1.0);\n DataObject initial(initialFeatures);\n DataObjects2D.resize(m, std::vector<DataObject>(n, initial));\n objectCount = 0;\nisClassPresent = false;\n}\n\nvoid ObjectMatrix::addObject(DataObject object)\n{\n DataObjects.push_back(object);\n objectCount++;\n}\n\nvoid ObjectMatrix::addObject(DataObject object, int cls)\n{\n DataObjects.push_back(object);\n objectCount++;\n this->DataObjects.at(objectCount -1).setClassLabel(cls);\n}\n\nvoid ObjectMatrix::addObjectTo(int index, DataObject object)\n{\n DataObjects2D[index].push_back(object);\n objectCount++;\n}\n\nvoid ObjectMatrix::updateDataObject(int objectIndex, int featureIndex, double newValue)\n{\n this->DataObjects.at(objectIndex).updateFeature(featureIndex, newValue);\n}\n\nvoid ObjectMatrix::updateDataObjectClass(int objectIndex, int newClass)\n{\n this->DataObjects.at(objectIndex).setClassLabel(newClass);\n \/\/ this->isClassPresent = true;\n}\n\n\/*std::vector<int> ObjectMatrix::getIntObjectClasses();\n{\n return this->objClasses\n}*\/\n\nbool ObjectMatrix::getPrintClass()\n{\n return this->isClassPresent;\n}\n\nvoid ObjectMatrix::setPrintClass(std::vector <std::string> printClass)\n{\n this->attributeStringClasses = printClass;\n this->isClassPresent = true;\n}\n\nvoid ObjectMatrix::updateDataObject(int rowIndex, int colIndex, int featureIndex, double newValue)\n{\n this->DataObjects2D[rowIndex].at(colIndex).updateFeature(featureIndex, newValue);\n}\n\nDataObject ObjectMatrix::getObjectAt(int index)\n{\n return DataObjects.at(index);\n}\n\nDataObject ObjectMatrix::getObjectAt(int row_index, int col_index)\n{\n return DataObjects2D[row_index].at(col_index);\n}\n\nint ObjectMatrix::getObjectCount()\n{\n return objectCount;\n}\n\nstd::vector<std::string> ObjectMatrix::getFeaturesTitle()\n{\n return featureTitles;\n}\n\nint ObjectMatrix::getClassCount()\n{\n int cCount = 0;\n if (!attributeStringClasses.empty())\n cCount = attributeStringClasses.size();\n return cCount;\n}\n\nvoid ObjectMatrix::addAtributes(std::vector<std::string> additionalAttributes)\n{\n this->additionalAttributes = additionalAttributes;\n}\n\nbool ObjectMatrix::getIsClassPresent()\n{\n return this->isClassPresent;\n}\n\nvoid ObjectMatrix::setIsClassPresent()\n{\n this->isClassPresent = true;\n}\n\nstd::vector <std::string> ObjectMatrix::getStringClassAttributes()\n{\n return this->attributeStringClasses;\n}\n\n\nvoid ObjectMatrix::loadDataMatrix()\n{\n const char* path = fileName.c_str();\n ARFF file(path);\n\n ObjectMatrix::_weight = 0;\n\n if (file.isSuccessfullyRead() == true) \/\/ successful read\n {\n std::vector< std::vector<double>> data = file.getData();\n \/\/featureTitles = file.getAttributes();\n if (file.isClassFound())\n {\n objClasses = file.getIntClass();\n attributeStringClasses = file.getAttributeStringClasses();\n \/\/isClassPresent = true;\n \/\/ std::cout << attributeStringClasses.size();\n }\n\n std::vector< std::vector<double>> ::iterator dataObjectIterator;\n\n std::vector<double>::iterator featureIterator;\n std::vector<double> dataObjectItems;\n int indx = 0;\n for(dataObjectIterator = data.begin(); dataObjectIterator!=data.end(); ++dataObjectIterator)\n {\n for(featureIterator = (*dataObjectIterator).begin(); featureIterator!=(*dataObjectIterator).end(); ++featureIterator)\n dataObjectItems.push_back(*featureIterator);\n\n if (file.isClassFound())\n {\n DataObject tmp(dataObjectItems, file.getObjectClass(indx));\n DataObjects.push_back(tmp);\n \/\/ std::cout << DataObjects.at(indx).getClassLabel() <<std::endl;\n }\n else\n {\n DataObject tmp(dataObjectItems);\n DataObjects.push_back(tmp);\n \/\/ std::cout << DataObjects.at(indx).getClassLabel() <<std::endl;\n }\n dataObjectItems.clear();\n indx++;\n }\n objectCount = DataObjects.size();\n\n \/\/Calculate matrix X distances between vectors\n\n \/\/ObjectMatrix::_weight = 0;\n int i, j, z;\n int n = data.at(0).size(); \/\/features\n double diff, sRow, tmpVal;\n\n \/\/ FILE *distFile;\n if (AdditionalMethods::PID == 0) \/\/ semaphore to sync distance matrix write\n AdditionalMethods::distFile = fopen(AdditionalMethods::tempFileSavePath, \"wb\");\n\n for (i = 0; i < objectCount - 1; i++)\n {\n for (j = i + 1; j < objectCount; j++)\n {\n sRow = 0.0;\n for (z = 0; z < n; z++)\n {\n diff = data.at(i).at(z) - data.at(j).at(z);\n sRow += diff * diff;\n }\n if (AdditionalMethods::PID == 0)\n {\n tmpVal = std::sqrt(sRow);\n fwrite(&tmpVal, sizeof(double), 1, AdditionalMethods::distFile);\n }\n ObjectMatrix::_weight += sRow;\n }\n }\n \/\/implementation of waait for other processes while PID finishes distance file writing\n if (AdditionalMethods::PID == 0)\n \/\/ {\n fclose(AdditionalMethods::distFile);\n \/\/ AdditionalMethods::distFileCreated = 1;\n \/\/ }\n \/* else\n {\n while (AdditionalMethods::distFileCreated != 1)\n system(\"sleep 1\");\n }*\/\n\n \/\/ end distance matrix calculation\n \/\/ std::cout<< std::endl << AdditionalMethods::PID << std::endl;\n }\n else\n {\n \/\/_weight = 0;\n objectCount = 0;\n }\n\n MPI_Barrier(MPI_COMM_WORLD);\n if(objectCount == 0)\n {\n std::cout << \"No data in input file. Terminating\"<< std::endl;\n MPI_Finalize();\n exit(1);\n }\n}\nvoid ObjectMatrix::addComment(std::string comnt)\n{\n if (this->comments.empty())\n comments.reserve(0);\n comments.push_back(comnt);\n}\n\nvoid ObjectMatrix::saveDataMatrix(const char* path)\n{\n ARFF file;\n \/\/ std::vector <std::string> classLabels; classLabels.reserve(0);\n \/\/ std::vector <std::string> comment\n \/\/std::vector <int> tmp; \/\/ assume v has the elements\n \/*if (getPrintClass())\n {\n \/*for (int i = 0; i < DataObjects.size(); i++) \/\/pass only unique class labels that will be printed in @Attribute Class section\n {\n bool notFound = true;\n int tmpLabel = DataObjects.at(i).getClassLabel();\n for (int j = 0; j < classLabels.size(); j++)\n if (tmpLabel == classLabels.at(j))\n {\n notFound = false;\n break;\n }\n if (notFound)*\/\n \/\/ for (int j = 0; j < classLabels.size(); j++)\n \/\/ classLabels.push_back(tmpLabel);\n \/\/ classLabels = attributeStringClasses;\n \/\/}\n \/\/ classLabels = attributeClasses;\n\n std::vector <std::string> attributeLabels; attributeLabels.reserve(0);\n\n if (!additionalAttributes.empty())\n {\n for (int i = 0; i < getObjectAt(0).getFeatureCount() - additionalAttributes.size(); i++)\n attributeLabels.push_back(\"atr\" + std::to_string(static_cast<long long>(i+1)) + \" REAL\");\n\n for (int i = 0; i < additionalAttributes.size(); i++)\n {\n attributeLabels.push_back(additionalAttributes.at(i) + \" REAL\");\n \/\/ std::cout << attributeStringClasses.at(i);\n }\n }\n else\n {\n for (int i = 0; i < getObjectAt(0).getFeatureCount(); i++)\n attributeLabels.push_back(\"atr\" + std::to_string(static_cast<long long>(i+1)) + \" REAL\");\n }\n file.writeData(path, this->comments, this->DataObjects, attributeStringClasses, attributeLabels);\n}\n\nvoid ObjectMatrix::clearDataObjects()\n{\n DataObjects.clear();\n objectCount = 0;\n}\n\/*void ObjectMatrix::assignStringClassesAttribute(ObjectMatrix X)\n{\n this->attributeStringClasses = X.attributeStringClasses;\n}*\/\n\n\/*double ObjectMatrix::getDistanceBetween(int i, int j)\n{\n FILE *distFile;\n distFile = fopen(\"D:\\\\dist.txt\", \"rb\");\n\/\/ std::ifstream distFile;\n\/\/ distFile.open(\"D:\\\\dist.txt\", std::ios::binary);\n double retVal;\n int noOfBytes = sizeof(double);\n\n fseek(distFile, (noOfBytes * i) + noOfBytes * (j - i - 1), SEEK_SET);\n \/\/ fseek(distFile, 1, SEEK_SET);\n fread(&retVal, noOfBytes, 1, distFile);\n \/\/ distFile>>retVal;\n\n \/\/ std::cout << retVal << std::endl;\n fclose(distFile);\n\/\/ distFile.close();\n return retVal;\n \/\/return *(*(distances + i) + j - i - 1);\n}*\/\n\ndouble ObjectMatrix::getWeight()\n{\n return ObjectMatrix::_weight;\n}\n<|endoftext|>"} {"text":"<commit_before>e\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/screen_lock_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/screen_locker.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_manager.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_view.h\"\n#include \"chrome\/browser\/chromeos\/login\/username_view.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_accessibility_helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/textfield_with_margin.h\"\n#include \"chrome\/browser\/chromeos\/views\/copy_background.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/border.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/grid_layout.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst int kCornerRadius = 5;\n\n\/\/ A Textfield for password, which also sets focus to itself\n\/\/ when a mouse is clicked on it. This is necessary in screen locker\n\/\/ as mouse events are grabbed in the screen locker.\nclass PasswordField : public TextfieldWithMargin {\n public:\n PasswordField()\n : TextfieldWithMargin(views::Textfield::STYLE_PASSWORD) {\n set_text_to_display_when_empty(\n l10n_util::GetStringUTF16(IDS_LOGIN_EMPTY_PASSWORD_TEXT));\n }\n\n \/\/ views::View overrides.\n virtual bool OnMousePressed(const views::MouseEvent& e) {\n RequestFocus();\n return false;\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(PasswordField);\n};\n\n} \/\/ namespace\n\nusing views::GridLayout;\nusing login::kBorderSize;\n\nScreenLockView::ScreenLockView(ScreenLocker* screen_locker)\n : user_view_(NULL),\n password_field_(NULL),\n screen_locker_(screen_locker),\n main_(NULL),\n username_(NULL) {\n DCHECK(screen_locker_);\n}\n\ngfx::Size ScreenLockView::GetPreferredSize() {\n return main_->GetPreferredSize();\n}\n\nvoid ScreenLockView::Layout() {\n int username_height = login::kSelectedLabelHeight;\n main_->SetBounds(0, 0, width(), height());\n username_->SetBounds(\n kBorderSize,\n login::kUserImageSize - username_height + kBorderSize,\n login::kUserImageSize,\n username_height);\n}\n\nvoid ScreenLockView::Init() {\n registrar_.Add(this,\n NotificationType::LOGIN_USER_IMAGE_CHANGED,\n NotificationService::AllSources());\n\n user_view_ = new UserView(this,\n false, \/\/ is_login\n true); \/\/ need_background\n main_ = new views::View();\n \/\/ Use rounded rect background.\n views::Painter* painter =\n CreateWizardPainter(&BorderDefinition::kUserBorder);\n\n main_->set_background(\n views::Background::CreateBackgroundPainter(true, painter));\n main_->set_border(CreateWizardBorder(&BorderDefinition::kUserBorder));\n\n \/\/ Password field.\n password_field_ = new PasswordField();\n password_field_->SetController(this);\n password_field_->set_background(new CopyBackground(main_));\n\n \/\/ User icon.\n UserManager::User user = screen_locker_->user();\n user_view_->SetImage(user.image());\n\n \/\/ User name.\n std::wstring text = UTF8ToWide(user.GetDisplayName());\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::MediumBoldFont);\n\n \/\/ Layouts image, textfield and button components.\n GridLayout* layout = new GridLayout(main_);\n main_->SetLayoutManager(layout);\n views::ColumnSet* column_set = layout->AddColumnSet(0);\n column_set->AddPaddingColumn(0, kBorderSize);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, kBorderSize);\n\n column_set = layout->AddColumnSet(1);\n column_set->AddPaddingColumn(0, 5);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, 5);\n\n layout->AddPaddingRow(0, kBorderSize);\n layout->StartRow(0, 0);\n layout->AddView(user_view_);\n layout->AddPaddingRow(0, kBorderSize);\n layout->StartRow(0, 1);\n layout->AddView(password_field_);\n layout->AddPaddingRow(0, kBorderSize);\n\n AddChildView(main_);\n\n UsernameView* username = new UsernameView(text);\n username_ = username;\n username->SetColor(login::kTextColor);\n username->SetFont(font);\n AddChildView(username);\n}\n\nvoid ScreenLockView::ClearAndSetFocusToPassword() {\n password_field_->RequestFocus();\n password_field_->SetText(string16());\n}\n\nvoid ScreenLockView::SetSignoutEnabled(bool enabled) {\n user_view_->SetSignoutEnabled(enabled);\n}\n\ngfx::Rect ScreenLockView::GetPasswordBoundsRelativeTo(const views::View* view) {\n gfx::Point p;\n views::View::ConvertPointToView(password_field_, view, &p);\n return gfx::Rect(p, size());\n}\n\nvoid ScreenLockView::SetEnabled(bool enabled) {\n views::View::SetEnabled(enabled);\n\n if (!enabled) {\n user_view_->StartThrobber();\n \/\/ TODO(oshima): Re-enabling does not move the focus to the view\n \/\/ that had a focus (issue http:\/\/crbug.com\/43131).\n \/\/ Clear focus on the textfield so that re-enabling can set focus\n \/\/ back to the text field.\n \/\/ FocusManager may be null if the view does not have\n \/\/ associated Widget yet.\n if (password_field_->GetFocusManager())\n password_field_->GetFocusManager()->ClearFocus();\n } else {\n user_view_->StopThrobber();\n }\n password_field_->SetEnabled(enabled);\n}\n\nvoid ScreenLockView::OnSignout() {\n screen_locker_->Signout();\n}\n\nbool ScreenLockView::HandleKeystroke(\n views::Textfield* sender,\n const views::Textfield::Keystroke& keystroke) {\n screen_locker_->ClearErrors();\n if (keystroke.GetKeyboardCode() == app::VKEY_RETURN) {\n screen_locker_->Authenticate(password_field_->text());\n return true;\n }\n return false;\n}\n\nvoid ScreenLockView::Observe(\n NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type != NotificationType::LOGIN_USER_IMAGE_CHANGED || !user_view_)\n return;\n\n UserManager::User* user = Details<UserManager::User>(details).ptr();\n if (screen_locker_->user().email() != user->email())\n return;\n user_view_->SetImage(user->image());\n}\n\nvoid ScreenLockView::ViewHierarchyChanged(bool is_add,\n views::View* parent,\n views::View* child) {\n if (is_add && this == child)\n WizardAccessibilityHelper::GetInstance()->MaybeEnableAccessibility(this);\n}\n} \/\/ namespace chromeos\n<commit_msg>Removed a character that has been added by mistake when merging.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/screen_lock_view.h\"\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/login\/helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/screen_locker.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_manager.h\"\n#include \"chrome\/browser\/chromeos\/login\/user_view.h\"\n#include \"chrome\/browser\/chromeos\/login\/username_view.h\"\n#include \"chrome\/browser\/chromeos\/login\/wizard_accessibility_helper.h\"\n#include \"chrome\/browser\/chromeos\/login\/textfield_with_margin.h\"\n#include \"chrome\/browser\/chromeos\/views\/copy_background.h\"\n#include \"chrome\/browser\/profile_manager.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/background.h\"\n#include \"views\/border.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/grid_layout.h\"\n\nnamespace chromeos {\n\nnamespace {\n\nconst int kCornerRadius = 5;\n\n\/\/ A Textfield for password, which also sets focus to itself\n\/\/ when a mouse is clicked on it. This is necessary in screen locker\n\/\/ as mouse events are grabbed in the screen locker.\nclass PasswordField : public TextfieldWithMargin {\n public:\n PasswordField()\n : TextfieldWithMargin(views::Textfield::STYLE_PASSWORD) {\n set_text_to_display_when_empty(\n l10n_util::GetStringUTF16(IDS_LOGIN_EMPTY_PASSWORD_TEXT));\n }\n\n \/\/ views::View overrides.\n virtual bool OnMousePressed(const views::MouseEvent& e) {\n RequestFocus();\n return false;\n }\n\n private:\n DISALLOW_COPY_AND_ASSIGN(PasswordField);\n};\n\n} \/\/ namespace\n\nusing views::GridLayout;\nusing login::kBorderSize;\n\nScreenLockView::ScreenLockView(ScreenLocker* screen_locker)\n : user_view_(NULL),\n password_field_(NULL),\n screen_locker_(screen_locker),\n main_(NULL),\n username_(NULL) {\n DCHECK(screen_locker_);\n}\n\ngfx::Size ScreenLockView::GetPreferredSize() {\n return main_->GetPreferredSize();\n}\n\nvoid ScreenLockView::Layout() {\n int username_height = login::kSelectedLabelHeight;\n main_->SetBounds(0, 0, width(), height());\n username_->SetBounds(\n kBorderSize,\n login::kUserImageSize - username_height + kBorderSize,\n login::kUserImageSize,\n username_height);\n}\n\nvoid ScreenLockView::Init() {\n registrar_.Add(this,\n NotificationType::LOGIN_USER_IMAGE_CHANGED,\n NotificationService::AllSources());\n\n user_view_ = new UserView(this,\n false, \/\/ is_login\n true); \/\/ need_background\n main_ = new views::View();\n \/\/ Use rounded rect background.\n views::Painter* painter =\n CreateWizardPainter(&BorderDefinition::kUserBorder);\n\n main_->set_background(\n views::Background::CreateBackgroundPainter(true, painter));\n main_->set_border(CreateWizardBorder(&BorderDefinition::kUserBorder));\n\n \/\/ Password field.\n password_field_ = new PasswordField();\n password_field_->SetController(this);\n password_field_->set_background(new CopyBackground(main_));\n\n \/\/ User icon.\n UserManager::User user = screen_locker_->user();\n user_view_->SetImage(user.image());\n\n \/\/ User name.\n std::wstring text = UTF8ToWide(user.GetDisplayName());\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::MediumBoldFont);\n\n \/\/ Layouts image, textfield and button components.\n GridLayout* layout = new GridLayout(main_);\n main_->SetLayoutManager(layout);\n views::ColumnSet* column_set = layout->AddColumnSet(0);\n column_set->AddPaddingColumn(0, kBorderSize);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, kBorderSize);\n\n column_set = layout->AddColumnSet(1);\n column_set->AddPaddingColumn(0, 5);\n column_set->AddColumn(GridLayout::FILL, GridLayout::FILL, 1,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, 5);\n\n layout->AddPaddingRow(0, kBorderSize);\n layout->StartRow(0, 0);\n layout->AddView(user_view_);\n layout->AddPaddingRow(0, kBorderSize);\n layout->StartRow(0, 1);\n layout->AddView(password_field_);\n layout->AddPaddingRow(0, kBorderSize);\n\n AddChildView(main_);\n\n UsernameView* username = new UsernameView(text);\n username_ = username;\n username->SetColor(login::kTextColor);\n username->SetFont(font);\n AddChildView(username);\n}\n\nvoid ScreenLockView::ClearAndSetFocusToPassword() {\n password_field_->RequestFocus();\n password_field_->SetText(string16());\n}\n\nvoid ScreenLockView::SetSignoutEnabled(bool enabled) {\n user_view_->SetSignoutEnabled(enabled);\n}\n\ngfx::Rect ScreenLockView::GetPasswordBoundsRelativeTo(const views::View* view) {\n gfx::Point p;\n views::View::ConvertPointToView(password_field_, view, &p);\n return gfx::Rect(p, size());\n}\n\nvoid ScreenLockView::SetEnabled(bool enabled) {\n views::View::SetEnabled(enabled);\n\n if (!enabled) {\n user_view_->StartThrobber();\n \/\/ TODO(oshima): Re-enabling does not move the focus to the view\n \/\/ that had a focus (issue http:\/\/crbug.com\/43131).\n \/\/ Clear focus on the textfield so that re-enabling can set focus\n \/\/ back to the text field.\n \/\/ FocusManager may be null if the view does not have\n \/\/ associated Widget yet.\n if (password_field_->GetFocusManager())\n password_field_->GetFocusManager()->ClearFocus();\n } else {\n user_view_->StopThrobber();\n }\n password_field_->SetEnabled(enabled);\n}\n\nvoid ScreenLockView::OnSignout() {\n screen_locker_->Signout();\n}\n\nbool ScreenLockView::HandleKeystroke(\n views::Textfield* sender,\n const views::Textfield::Keystroke& keystroke) {\n screen_locker_->ClearErrors();\n if (keystroke.GetKeyboardCode() == app::VKEY_RETURN) {\n screen_locker_->Authenticate(password_field_->text());\n return true;\n }\n return false;\n}\n\nvoid ScreenLockView::Observe(\n NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type != NotificationType::LOGIN_USER_IMAGE_CHANGED || !user_view_)\n return;\n\n UserManager::User* user = Details<UserManager::User>(details).ptr();\n if (screen_locker_->user().email() != user->email())\n return;\n user_view_->SetImage(user->image());\n}\n\nvoid ScreenLockView::ViewHierarchyChanged(bool is_add,\n views::View* parent,\n views::View* child) {\n if (is_add && this == child)\n WizardAccessibilityHelper::GetInstance()->MaybeEnableAccessibility(this);\n}\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/prerender\/prerender_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"content\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nnamespace prerender {\n\nvoid ConfigurePrefetchAndPrerender(const CommandLine& command_line) {\n enum PrerenderOption {\n PRERENDER_OPTION_AUTO,\n PRERENDER_OPTION_DISABLED,\n PRERENDER_OPTION_ENABLED,\n PRERENDER_OPTION_PREFETCH_ONLY,\n };\n\n PrerenderOption prerender_option = PRERENDER_OPTION_AUTO;\n if (command_line.HasSwitch(switches::kPrerender)) {\n const std::string switch_value =\n command_line.GetSwitchValueASCII(switches::kPrerender);\n\n if (switch_value == switches::kPrerenderSwitchValueAuto) {\n prerender_option = PRERENDER_OPTION_AUTO;\n } else if (switch_value == switches::kPrerenderSwitchValueDisabled) {\n prerender_option = PRERENDER_OPTION_DISABLED;\n } else if (switch_value.empty() ||\n switch_value == switches::kPrerenderSwitchValueEnabled) {\n \/\/ The empty string means the option was provided with no value, and that\n \/\/ means enable.\n prerender_option = PRERENDER_OPTION_ENABLED;\n } else if (switch_value == switches::kPrerenderSwitchValuePrefetchOnly) {\n prerender_option = PRERENDER_OPTION_PREFETCH_ONLY;\n } else {\n prerender_option = PRERENDER_OPTION_DISABLED;\n LOG(ERROR) << \"Invalid --prerender option received on command line: \"\n << switch_value;\n LOG(ERROR) << \"Disabling prerendering!\";\n }\n }\n\n switch (prerender_option) {\n case PRERENDER_OPTION_AUTO: {\n const base::FieldTrial::Probability kPrefetchDivisor = 1000;\n const base::FieldTrial::Probability kYesPrefetchProbability = 500;\n scoped_refptr<base::FieldTrial> trial(\n new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n \"ContentPrefetchDisabled\", 2011, 6, 30));\n const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n const int kTrialGroup = trial->group();\n ResourceDispatcherHost::set_is_prefetch_enabled(\n kTrialGroup != kNoPrefetchGroup);\n\n \/\/ There is currently no prerendering field trial.\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n }\n case PRERENDER_OPTION_DISABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n case PRERENDER_OPTION_ENABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n break;\n case PRERENDER_OPTION_PREFETCH_ONLY:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n default:\n NOTREACHED();\n }\n\n UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n PrerenderManager::GetMode(),\n PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n} \/\/ namespace prerender\n<commit_msg>Add field trial (at 0%) for prerender<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/prerender\/prerender_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"content\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nnamespace prerender {\n\nvoid ConfigurePrefetchAndPrerender(const CommandLine& command_line) {\n enum PrerenderOption {\n PRERENDER_OPTION_AUTO,\n PRERENDER_OPTION_DISABLED,\n PRERENDER_OPTION_ENABLED,\n PRERENDER_OPTION_PREFETCH_ONLY,\n };\n\n PrerenderOption prerender_option = PRERENDER_OPTION_AUTO;\n if (command_line.HasSwitch(switches::kPrerender)) {\n const std::string switch_value =\n command_line.GetSwitchValueASCII(switches::kPrerender);\n\n if (switch_value == switches::kPrerenderSwitchValueAuto) {\n prerender_option = PRERENDER_OPTION_AUTO;\n } else if (switch_value == switches::kPrerenderSwitchValueDisabled) {\n prerender_option = PRERENDER_OPTION_DISABLED;\n } else if (switch_value.empty() ||\n switch_value == switches::kPrerenderSwitchValueEnabled) {\n \/\/ The empty string means the option was provided with no value, and that\n \/\/ means enable.\n prerender_option = PRERENDER_OPTION_ENABLED;\n } else if (switch_value == switches::kPrerenderSwitchValuePrefetchOnly) {\n prerender_option = PRERENDER_OPTION_PREFETCH_ONLY;\n } else {\n prerender_option = PRERENDER_OPTION_DISABLED;\n LOG(ERROR) << \"Invalid --prerender option received on command line: \"\n << switch_value;\n LOG(ERROR) << \"Disabling prerendering!\";\n }\n }\n\n switch (prerender_option) {\n case PRERENDER_OPTION_AUTO: {\n const base::FieldTrial::Probability kPrefetchDivisor = 1000;\n const base::FieldTrial::Probability kYesPrefetchProbability = 500;\n const base::FieldTrial::Probability kPrerenderProbability = 0;\n\n scoped_refptr<base::FieldTrial> trial(\n new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n \"ContentPrefetchDisabled\", 2011, 6, 30));\n\n const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n const int kYesPrefetchGroup =\n trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n const int kPrerenderGroup =\n trial->AppendGroup(\"ContentPrefetchPrerender\", kPrerenderProbability);\n const int trial_group = trial->group();\n if (trial_group == kYesPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP);\n } else if (trial_group == kNoPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n } else if (trial_group == kPrerenderGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n } else {\n NOTREACHED();\n }\n break;\n }\n case PRERENDER_OPTION_DISABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n case PRERENDER_OPTION_ENABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n break;\n case PRERENDER_OPTION_PREFETCH_ONLY:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n default:\n NOTREACHED();\n }\n\n UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n PrerenderManager::GetMode(),\n PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n} \/\/ namespace prerender\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/prerender\/prerender_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"content\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nnamespace prerender {\n\nvoid ConfigurePrefetchAndPrerender(const CommandLine& command_line) {\n enum PrerenderOption {\n PRERENDER_OPTION_AUTO,\n PRERENDER_OPTION_DISABLED,\n PRERENDER_OPTION_ENABLED,\n PRERENDER_OPTION_PREFETCH_ONLY,\n };\n\n PrerenderOption prerender_option = PRERENDER_OPTION_AUTO;\n if (command_line.HasSwitch(switches::kPrerender)) {\n const std::string switch_value =\n command_line.GetSwitchValueASCII(switches::kPrerender);\n\n if (switch_value == switches::kPrerenderSwitchValueAuto) {\n#if defined(OS_CHROMEOS)\n \/\/ Prerender is temporarily disabled on CrOS.\n \/\/ http:\/\/crosbug.com\/12483\n prerender_option = PRERENDER_OPTION_DISABLED;\n#else\n prerender_option = PRERENDER_OPTION_AUTO;\n#endif\n } else if (switch_value == switches::kPrerenderSwitchValueDisabled) {\n prerender_option = PRERENDER_OPTION_DISABLED;\n } else if (switch_value.empty() ||\n switch_value == switches::kPrerenderSwitchValueEnabled) {\n \/\/ The empty string means the option was provided with no value, and that\n \/\/ means enable.\n prerender_option = PRERENDER_OPTION_ENABLED;\n } else if (switch_value == switches::kPrerenderSwitchValuePrefetchOnly) {\n prerender_option = PRERENDER_OPTION_PREFETCH_ONLY;\n } else {\n prerender_option = PRERENDER_OPTION_DISABLED;\n LOG(ERROR) << \"Invalid --prerender option received on command line: \"\n << switch_value;\n LOG(ERROR) << \"Disabling prerendering!\";\n }\n }\n\n switch (prerender_option) {\n case PRERENDER_OPTION_AUTO: {\n const base::FieldTrial::Probability kPrefetchDivisor = 1000;\n const base::FieldTrial::Probability kYesPrefetchProbability = 0;\n const base::FieldTrial::Probability kPrerenderExp1Probability = 0;\n const base::FieldTrial::Probability kPrerenderControl1Probability = 0;\n const base::FieldTrial::Probability kPrerenderExp2Probability = 0;\n const base::FieldTrial::Probability kPrerenderControl2Probability = 0;\n\n scoped_refptr<base::FieldTrial> trial(\n new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n \"ContentPrefetchDisabled\", 2011, 6, 30));\n\n const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n const int kYesPrefetchGroup =\n trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n const int kPrerenderExperiment1Group =\n trial->AppendGroup(\"ContentPrefetchPrerender1\",\n kPrerenderExp1Probability);\n const int kPrerenderControl1Group =\n trial->AppendGroup(\"ContentPrefetchPrerenderControl1\",\n kPrerenderControl1Probability);\n const int kPrerenderExperiment2Group =\n trial->AppendGroup(\"ContentPrefetchPrerender2\",\n kPrerenderExp2Probability);\n const int kPrerenderControl2Group =\n trial->AppendGroup(\"ContentPrefetchPrerenderControl2\",\n kPrerenderControl2Probability);\n const int trial_group = trial->group();\n if (trial_group == kYesPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n } else if (trial_group == kNoPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_DISABLED);\n } else if (trial_group == kPrerenderExperiment1Group ||\n trial_group == kPrerenderExperiment2Group) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n } else if (trial_group == kPrerenderControl1Group ||\n trial_group == kPrerenderControl2Group) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP);\n } else {\n NOTREACHED();\n }\n break;\n }\n case PRERENDER_OPTION_DISABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n case PRERENDER_OPTION_ENABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n break;\n case PRERENDER_OPTION_PREFETCH_ONLY:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n default:\n NOTREACHED();\n }\n\n UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n PrerenderManager::GetMode(),\n PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n} \/\/ namespace prerender\n<commit_msg>Revert 83340 - Disable prerender experiment and control group.This is only being landed so it can be merged into the 472 branch, and will be reverted on trunk quickly.BUG=79804TEST=NoneReview URL: http:\/\/codereview.chromium.org\/6893067 TBR=cbentzel@chromium.org<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/prerender\/prerender_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/logging.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"base\/metrics\/histogram.h\"\n#include \"content\/browser\/renderer_host\/resource_dispatcher_host.h\"\n#include \"chrome\/browser\/prerender\/prerender_manager.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nnamespace prerender {\n\nvoid ConfigurePrefetchAndPrerender(const CommandLine& command_line) {\n enum PrerenderOption {\n PRERENDER_OPTION_AUTO,\n PRERENDER_OPTION_DISABLED,\n PRERENDER_OPTION_ENABLED,\n PRERENDER_OPTION_PREFETCH_ONLY,\n };\n\n PrerenderOption prerender_option = PRERENDER_OPTION_AUTO;\n if (command_line.HasSwitch(switches::kPrerender)) {\n const std::string switch_value =\n command_line.GetSwitchValueASCII(switches::kPrerender);\n\n if (switch_value == switches::kPrerenderSwitchValueAuto) {\n#if defined(OS_CHROMEOS)\n \/\/ Prerender is temporarily disabled on CrOS.\n \/\/ http:\/\/crosbug.com\/12483\n prerender_option = PRERENDER_OPTION_DISABLED;\n#else\n prerender_option = PRERENDER_OPTION_AUTO;\n#endif\n } else if (switch_value == switches::kPrerenderSwitchValueDisabled) {\n prerender_option = PRERENDER_OPTION_DISABLED;\n } else if (switch_value.empty() ||\n switch_value == switches::kPrerenderSwitchValueEnabled) {\n \/\/ The empty string means the option was provided with no value, and that\n \/\/ means enable.\n prerender_option = PRERENDER_OPTION_ENABLED;\n } else if (switch_value == switches::kPrerenderSwitchValuePrefetchOnly) {\n prerender_option = PRERENDER_OPTION_PREFETCH_ONLY;\n } else {\n prerender_option = PRERENDER_OPTION_DISABLED;\n LOG(ERROR) << \"Invalid --prerender option received on command line: \"\n << switch_value;\n LOG(ERROR) << \"Disabling prerendering!\";\n }\n }\n\n switch (prerender_option) {\n case PRERENDER_OPTION_AUTO: {\n const base::FieldTrial::Probability kPrefetchDivisor = 1000;\n const base::FieldTrial::Probability kYesPrefetchProbability = 0;\n const base::FieldTrial::Probability kPrerenderExp1Probability = 400;\n const base::FieldTrial::Probability kPrerenderControl1Probability = 100;\n const base::FieldTrial::Probability kPrerenderExp2Probability = 400;\n const base::FieldTrial::Probability kPrerenderControl2Probability = 100;\n\n scoped_refptr<base::FieldTrial> trial(\n new base::FieldTrial(\"Prefetch\", kPrefetchDivisor,\n \"ContentPrefetchDisabled\", 2011, 6, 30));\n\n const int kNoPrefetchGroup = trial->kDefaultGroupNumber;\n const int kYesPrefetchGroup =\n trial->AppendGroup(\"ContentPrefetchEnabled\", kYesPrefetchProbability);\n const int kPrerenderExperiment1Group =\n trial->AppendGroup(\"ContentPrefetchPrerender1\",\n kPrerenderExp1Probability);\n const int kPrerenderControl1Group =\n trial->AppendGroup(\"ContentPrefetchPrerenderControl1\",\n kPrerenderControl1Probability);\n const int kPrerenderExperiment2Group =\n trial->AppendGroup(\"ContentPrefetchPrerender2\",\n kPrerenderExp2Probability);\n const int kPrerenderControl2Group =\n trial->AppendGroup(\"ContentPrefetchPrerenderControl2\",\n kPrerenderControl2Probability);\n const int trial_group = trial->group();\n if (trial_group == kYesPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n } else if (trial_group == kNoPrefetchGroup) {\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_DISABLED);\n } else if (trial_group == kPrerenderExperiment1Group ||\n trial_group == kPrerenderExperiment2Group) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_PRERENDER_GROUP);\n } else if (trial_group == kPrerenderControl1Group ||\n trial_group == kPrerenderControl2Group) {\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(\n PrerenderManager::PRERENDER_MODE_EXPERIMENT_CONTROL_GROUP);\n } else {\n NOTREACHED();\n }\n break;\n }\n case PRERENDER_OPTION_DISABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(false);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n case PRERENDER_OPTION_ENABLED:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_ENABLED);\n break;\n case PRERENDER_OPTION_PREFETCH_ONLY:\n ResourceDispatcherHost::set_is_prefetch_enabled(true);\n PrerenderManager::SetMode(PrerenderManager::PRERENDER_MODE_DISABLED);\n break;\n default:\n NOTREACHED();\n }\n\n UMA_HISTOGRAM_ENUMERATION(\"Prerender.Sessions\",\n PrerenderManager::GetMode(),\n PrerenderManager::PRERENDER_MODE_MAX);\n}\n\n} \/\/ namespace prerender\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/shown_sections_handler.h\"\n\n#include <string>\n\n#include \"base\/callback.h\"\n#include \"base\/command_line.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/common\/notification_details.h\"\n#include \"content\/common\/notification_type.h\"\n\nnamespace {\n\n\/\/ Will cause an UMA notification if the mode of the new tab page\n\/\/ was changed to hide\/show the most visited thumbnails.\n\/\/ TODO(aa): Needs to be updated to match newest NTP - http:\/\/crbug.com\/57440\nvoid NotifySectionDisabled(int new_mode, int old_mode, Profile *profile) {\n \/\/ If the oldmode HAD either thumbs or lists visible.\n bool old_had_it = (old_mode & THUMB) && !(old_mode & MENU_THUMB);\n bool new_has_it = (new_mode & THUMB) && !(new_mode & MENU_THUMB);\n\n if (old_had_it && !new_has_it) {\n UserMetrics::RecordAction(\n UserMetricsAction(\"ShowSections_RecentSitesDisabled\"),\n profile);\n }\n\n if (new_has_it && !old_had_it) {\n UserMetrics::RecordAction(\n UserMetricsAction(\"ShowSections_RecentSitesEnabled\"),\n profile);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nint ShownSectionsHandler::GetShownSections(PrefService* prefs) {\n return prefs->GetInteger(prefs::kNTPShownSections);\n}\n\n\/\/ static\nvoid ShownSectionsHandler::SetShownSection(PrefService* prefs,\n Section section) {\n int shown_sections = GetShownSections(prefs);\n shown_sections &= ~ALL_SECTIONS_MASK;\n shown_sections |= section;\n prefs->SetInteger(prefs::kNTPShownSections, shown_sections);\n}\n\nShownSectionsHandler::ShownSectionsHandler(PrefService* pref_service)\n : pref_service_(pref_service) {\n pref_registrar_.Init(pref_service);\n pref_registrar_.Add(prefs::kNTPShownSections, this);\n}\n\nvoid ShownSectionsHandler::RegisterMessages() {\n web_ui_->RegisterMessageCallback(\"getShownSections\",\n NewCallback(this, &ShownSectionsHandler::HandleGetShownSections));\n web_ui_->RegisterMessageCallback(\"setShownSections\",\n NewCallback(this, &ShownSectionsHandler::HandleSetShownSections));\n}\n\nvoid ShownSectionsHandler::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::PREF_CHANGED) {\n std::string* pref_name = Details<std::string>(details).ptr();\n DCHECK(*pref_name == prefs::kNTPShownSections);\n int sections = pref_service_->GetInteger(prefs::kNTPShownSections);\n FundamentalValue sections_value(sections);\n web_ui_->CallJavascriptFunction(\"setShownSections\", sections_value);\n } else {\n NOTREACHED();\n }\n}\n\nvoid ShownSectionsHandler::HandleGetShownSections(const ListValue* args) {\n int sections = GetShownSections(pref_service_);\n FundamentalValue sections_value(sections);\n web_ui_->CallJavascriptFunction(\"onShownSections\", sections_value);\n}\n\nvoid ShownSectionsHandler::HandleSetShownSections(const ListValue* args) {\n double mode_double;\n CHECK(args->GetDouble(0, &mode_double));\n int mode = static_cast<int>(mode_double);\n int old_mode = pref_service_->GetInteger(prefs::kNTPShownSections);\n\n if (old_mode != mode) {\n NotifySectionDisabled(mode, old_mode, web_ui_->GetProfile());\n pref_service_->SetInteger(prefs::kNTPShownSections, mode);\n }\n}\n\n\/\/ static\nvoid ShownSectionsHandler::RegisterUserPrefs(PrefService* pref_service) {\n#if defined(OS_CHROMEOS)\n \/\/ Default to have expanded APPS and all other sections are minimized.\n pref_service->RegisterIntegerPref(prefs::kNTPShownSections,\n APPS | MENU_THUMB | MENU_RECENT);\n#else\n pref_service->RegisterIntegerPref(prefs::kNTPShownSections, THUMB);\n#endif\n}\n\n\/\/ static\nvoid ShownSectionsHandler::MigrateUserPrefs(PrefService* pref_service,\n int old_pref_version,\n int new_pref_version) {\n \/\/ Nothing to migrate for default kNTPShownSections value.\n const PrefService::Preference* shown_sections_pref =\n pref_service->FindPreference(prefs::kNTPShownSections);\n if (shown_sections_pref->IsDefaultValue())\n return;\n\n bool changed = false;\n int shown_sections = pref_service->GetInteger(prefs::kNTPShownSections);\n\n if (old_pref_version < 3) {\n \/\/ In version 3, we went from being able to show multiple sections to being\n \/\/ able to show only one expanded at a time. The only two expandable\n \/\/ sections are APPS and THUMBS.\n if (shown_sections & APPS)\n shown_sections = APPS;\n else\n shown_sections = THUMB;\n\n changed = true;\n }\n\n if (changed)\n pref_service->SetInteger(prefs::kNTPShownSections, shown_sections);\n}\n\n\/\/ static\nvoid ShownSectionsHandler::OnExtensionInstalled(PrefService* prefs,\n const Extension* extension) {\n if (extension->is_app()) {\n int mode = prefs->GetInteger(prefs::kNTPShownSections);\n\n \/\/ De-menu-mode the apps section.\n mode &= ~MENU_APPS;\n\n \/\/ Hide any open sections.\n mode &= ~ALL_SECTIONS_MASK;\n\n \/\/ Show the apps section.\n mode |= APPS;\n\n prefs->SetInteger(prefs::kNTPShownSections, mode);\n }\n}\n<commit_msg>Coverity: Check for a NULL preference.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/shown_sections_handler.h\"\n\n#include <string>\n\n#include \"base\/callback.h\"\n#include \"base\/command_line.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/metrics\/user_metrics.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/common\/notification_details.h\"\n#include \"content\/common\/notification_type.h\"\n\nnamespace {\n\n\/\/ Will cause an UMA notification if the mode of the new tab page\n\/\/ was changed to hide\/show the most visited thumbnails.\n\/\/ TODO(aa): Needs to be updated to match newest NTP - http:\/\/crbug.com\/57440\nvoid NotifySectionDisabled(int new_mode, int old_mode, Profile *profile) {\n \/\/ If the oldmode HAD either thumbs or lists visible.\n bool old_had_it = (old_mode & THUMB) && !(old_mode & MENU_THUMB);\n bool new_has_it = (new_mode & THUMB) && !(new_mode & MENU_THUMB);\n\n if (old_had_it && !new_has_it) {\n UserMetrics::RecordAction(\n UserMetricsAction(\"ShowSections_RecentSitesDisabled\"),\n profile);\n }\n\n if (new_has_it && !old_had_it) {\n UserMetrics::RecordAction(\n UserMetricsAction(\"ShowSections_RecentSitesEnabled\"),\n profile);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nint ShownSectionsHandler::GetShownSections(PrefService* prefs) {\n return prefs->GetInteger(prefs::kNTPShownSections);\n}\n\n\/\/ static\nvoid ShownSectionsHandler::SetShownSection(PrefService* prefs,\n Section section) {\n int shown_sections = GetShownSections(prefs);\n shown_sections &= ~ALL_SECTIONS_MASK;\n shown_sections |= section;\n prefs->SetInteger(prefs::kNTPShownSections, shown_sections);\n}\n\nShownSectionsHandler::ShownSectionsHandler(PrefService* pref_service)\n : pref_service_(pref_service) {\n pref_registrar_.Init(pref_service);\n pref_registrar_.Add(prefs::kNTPShownSections, this);\n}\n\nvoid ShownSectionsHandler::RegisterMessages() {\n web_ui_->RegisterMessageCallback(\"getShownSections\",\n NewCallback(this, &ShownSectionsHandler::HandleGetShownSections));\n web_ui_->RegisterMessageCallback(\"setShownSections\",\n NewCallback(this, &ShownSectionsHandler::HandleSetShownSections));\n}\n\nvoid ShownSectionsHandler::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::PREF_CHANGED) {\n std::string* pref_name = Details<std::string>(details).ptr();\n DCHECK(*pref_name == prefs::kNTPShownSections);\n int sections = pref_service_->GetInteger(prefs::kNTPShownSections);\n FundamentalValue sections_value(sections);\n web_ui_->CallJavascriptFunction(\"setShownSections\", sections_value);\n } else {\n NOTREACHED();\n }\n}\n\nvoid ShownSectionsHandler::HandleGetShownSections(const ListValue* args) {\n int sections = GetShownSections(pref_service_);\n FundamentalValue sections_value(sections);\n web_ui_->CallJavascriptFunction(\"onShownSections\", sections_value);\n}\n\nvoid ShownSectionsHandler::HandleSetShownSections(const ListValue* args) {\n double mode_double;\n CHECK(args->GetDouble(0, &mode_double));\n int mode = static_cast<int>(mode_double);\n int old_mode = pref_service_->GetInteger(prefs::kNTPShownSections);\n\n if (old_mode != mode) {\n NotifySectionDisabled(mode, old_mode, web_ui_->GetProfile());\n pref_service_->SetInteger(prefs::kNTPShownSections, mode);\n }\n}\n\n\/\/ static\nvoid ShownSectionsHandler::RegisterUserPrefs(PrefService* pref_service) {\n#if defined(OS_CHROMEOS)\n \/\/ Default to have expanded APPS and all other sections are minimized.\n pref_service->RegisterIntegerPref(prefs::kNTPShownSections,\n APPS | MENU_THUMB | MENU_RECENT);\n#else\n pref_service->RegisterIntegerPref(prefs::kNTPShownSections, THUMB);\n#endif\n}\n\n\/\/ static\nvoid ShownSectionsHandler::MigrateUserPrefs(PrefService* pref_service,\n int old_pref_version,\n int new_pref_version) {\n \/\/ Nothing to migrate for default kNTPShownSections value.\n const PrefService::Preference* shown_sections_pref =\n pref_service->FindPreference(prefs::kNTPShownSections);\n if (!shown_sections_pref || shown_sections_pref->IsDefaultValue())\n return;\n\n bool changed = false;\n int shown_sections = pref_service->GetInteger(prefs::kNTPShownSections);\n\n if (old_pref_version < 3) {\n \/\/ In version 3, we went from being able to show multiple sections to being\n \/\/ able to show only one expanded at a time. The only two expandable\n \/\/ sections are APPS and THUMBS.\n if (shown_sections & APPS)\n shown_sections = APPS;\n else\n shown_sections = THUMB;\n\n changed = true;\n }\n\n if (changed)\n pref_service->SetInteger(prefs::kNTPShownSections, shown_sections);\n}\n\n\/\/ static\nvoid ShownSectionsHandler::OnExtensionInstalled(PrefService* prefs,\n const Extension* extension) {\n if (extension->is_app()) {\n int mode = prefs->GetInteger(prefs::kNTPShownSections);\n\n \/\/ De-menu-mode the apps section.\n mode &= ~MENU_APPS;\n\n \/\/ Hide any open sections.\n mode &= ~ALL_SECTIONS_MASK;\n\n \/\/ Show the apps section.\n mode |= APPS;\n\n prefs->SetInteger(prefs::kNTPShownSections, mode);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/browser_actions_container.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/extensions\/extension_tabs_module.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/browser\/views\/extensions\/extension_popup.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/common\/notification_source.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"grit\/app_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"third_party\/skia\/include\/core\/SkTypeface.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"views\/controls\/button\/text_button.h\"\n\n\/\/ The size (both dimensions) of the buttons for page actions.\nstatic const int kButtonSize = 29;\n\n\/\/ The padding between the browser actions and the omnibox\/page menu.\nstatic const int kHorizontalPadding = 4;\n\n\/\/ The padding between browser action buttons. Visually, the actual number of\n\/\/ empty (non-drawing) pixels is this value + 2 when adjacent browser icons\n\/\/ use their maximum allowed size.\nstatic const int kBrowserActionButtonPadding = 3;\n\n\/\/ This is the same value from toolbar.cc. We position the browser actions\n\/\/ container flush with the edges of the toolbar as a special case so that we\n\/\/ can draw the badge outside the visual bounds of the container.\nstatic const int kControlVertOffset = 6;\n\n\/\/ The maximum of the minimum number of browser actions present when there is\n\/\/ not enough space to fit all the browser actions in the toolbar.\nstatic const int kMinimumNumberOfVisibleBrowserActions = 2;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionButton\n\nBrowserActionButton::BrowserActionButton(Extension* extension,\n BrowserActionsContainer* panel)\n : MenuButton(this, L\"\", NULL, false),\n browser_action_(extension->browser_action()),\n extension_(extension),\n tracker_(NULL),\n panel_(panel) {\n set_alignment(TextButton::ALIGN_CENTER);\n\n \/\/ No UpdateState() here because View heirarchy not setup yet. Our parent\n \/\/ should call UpdateState() after creation.\n\n registrar_.Add(this, NotificationType::EXTENSION_BROWSER_ACTION_UPDATED,\n Source<ExtensionAction>(browser_action_));\n}\n\nBrowserActionButton::~BrowserActionButton() {\n if (tracker_) {\n tracker_->StopTrackingImageLoad();\n tracker_ = NULL; \/\/ The tracker object will be deleted when we return.\n }\n}\n\ngfx::Insets BrowserActionButton::GetInsets() const {\n static gfx::Insets zero_inset;\n return zero_inset;\n}\n\nvoid BrowserActionButton::ButtonPressed(\n views::Button* sender, const views::Event& event) {\n panel_->OnBrowserActionExecuted(this);\n}\n\nvoid BrowserActionButton::LoadImage() {\n \/\/ Load the default image from the browser action asynchronously on the file\n \/\/ thread. We'll get a call back into OnImageLoaded if the image loads\n \/\/ successfully.\n std::string relative_path = browser_action()->default_icon_path();\n if (relative_path.empty())\n return;\n\n tracker_ = new ImageLoadingTracker(this, 1);\n tracker_->PostLoadImageTask(\n extension()->GetResource(relative_path),\n gfx::Size(Extension::kBrowserActionIconMaxSize,\n Extension::kBrowserActionIconMaxSize));\n}\n\nvoid BrowserActionButton::OnImageLoaded(SkBitmap* image, size_t index) {\n if (image)\n SetIcon(*image);\n tracker_ = NULL; \/\/ The tracker object will delete itself when we return.\n GetParent()->SchedulePaint();\n}\n\nvoid BrowserActionButton::UpdateState() {\n int tab_id = panel_->GetCurrentTabId();\n if (tab_id < 0)\n return;\n\n SkBitmap image = browser_action()->GetIcon(tab_id);\n if (image.isNull())\n LoadImage();\n else\n SetIcon(image);\n\n SetTooltipText(ASCIIToWide(browser_action()->GetTitle(tab_id)));\n GetParent()->SchedulePaint();\n}\n\nvoid BrowserActionButton::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::EXTENSION_BROWSER_ACTION_UPDATED) {\n UpdateState();\n } else {\n NOTREACHED() << L\"Received unexpected notification\";\n }\n}\n\nbool BrowserActionButton::IsPopup() {\n return browser_action_->has_popup();\n}\n\nbool BrowserActionButton::Activate() {\n if (IsPopup()) {\n panel_->OnBrowserActionExecuted(this);\n\n \/\/ TODO(erikkay): Run a nested modal loop while the mouse is down to\n \/\/ enable menu-like drag-select behavior.\n\n \/\/ The return value of this method is returned via OnMousePressed.\n \/\/ We need to return false here since we're handing off focus to another\n \/\/ widget\/view, and true will grab it right back and try to send events\n \/\/ to us.\n return false;\n }\n return true;\n}\n\nbool BrowserActionButton::OnMousePressed(const views::MouseEvent& e) {\n if (IsPopup())\n return MenuButton::OnMousePressed(e);\n return TextButton::OnMousePressed(e);\n}\n\nvoid BrowserActionButton::OnMouseReleased(const views::MouseEvent& e,\n bool canceled) {\n if (IsPopup()) {\n \/\/ TODO(erikkay) this never actually gets called (probably because of the\n \/\/ loss of focus).\n MenuButton::OnMouseReleased(e, canceled);\n } else {\n TextButton::OnMouseReleased(e, canceled);\n }\n}\n\nbool BrowserActionButton::OnKeyReleased(const views::KeyEvent& e) {\n if (IsPopup())\n return MenuButton::OnKeyReleased(e);\n return TextButton::OnKeyReleased(e);\n}\n\nvoid BrowserActionButton::OnMouseExited(const views::MouseEvent& e) {\n if (IsPopup())\n MenuButton::OnMouseExited(e);\n else\n TextButton::OnMouseExited(e);\n}\n\nvoid BrowserActionButton::PopupDidShow() {\n SetState(views::CustomButton::BS_PUSHED);\n menu_visible_ = true;\n}\n\nvoid BrowserActionButton::PopupDidHide() {\n SetState(views::CustomButton::BS_NORMAL);\n menu_visible_ = false;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionView\n\nBrowserActionView::BrowserActionView(Extension* extension,\n BrowserActionsContainer* panel)\n : panel_(panel) {\n button_ = new BrowserActionButton(extension, panel);\n AddChildView(button_);\n button_->UpdateState();\n}\n\nvoid BrowserActionView::Layout() {\n button_->SetBounds(0, kControlVertOffset, width(), kButtonSize);\n}\n\nvoid BrowserActionView::PaintChildren(gfx::Canvas* canvas) {\n View::PaintChildren(canvas);\n ExtensionAction* action = button()->browser_action();\n int tab_id = panel_->GetCurrentTabId();\n if (tab_id < 0)\n return;\n\n action->PaintBadge(canvas, gfx::Rect(width(), height()), tab_id);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionsContainer\n\nBrowserActionsContainer::BrowserActionsContainer(\n Profile* profile, ToolbarView* toolbar)\n : profile_(profile),\n toolbar_(toolbar),\n popup_(NULL),\n popup_button_(NULL),\n ALLOW_THIS_IN_INITIALIZER_LIST(task_factory_(this)) {\n ExtensionsService* extension_service = profile->GetExtensionsService();\n if (!extension_service) \/\/ The |extension_service| can be NULL in Incognito.\n return;\n\n registrar_.Add(this, NotificationType::EXTENSION_LOADED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED_DISABLED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE,\n Source<Profile>(profile_));\n\n for (size_t i = 0; i < extension_service->extensions()->size(); ++i)\n AddBrowserAction(extension_service->extensions()->at(i));\n\n SetID(VIEW_ID_BROWSER_ACTION_TOOLBAR);\n}\n\nBrowserActionsContainer::~BrowserActionsContainer() {\n HidePopup();\n DeleteBrowserActionViews();\n}\n\nint BrowserActionsContainer::GetCurrentTabId() {\n TabContents* tab_contents = toolbar_->browser()->GetSelectedTabContents();\n if (!tab_contents)\n return -1;\n\n return tab_contents->controller().session_id().id();\n}\n\nvoid BrowserActionsContainer::RefreshBrowserActionViews() {\n for (size_t i = 0; i < browser_action_views_.size(); ++i)\n browser_action_views_[i]->button()->UpdateState();\n}\n\nvoid BrowserActionsContainer::AddBrowserAction(Extension* extension) {\n#if defined(DEBUG)\n for (size_t i = 0; i < browser_action_views_.size(); ++i) {\n DCHECK(browser_action_views_[i]->button()->extension() != extension) <<\n \"Asked to add a browser action view for an extension that already \"\n \"exists.\";\n }\n#endif\n if (!extension->browser_action())\n return;\n\n BrowserActionView* view = new BrowserActionView(extension, this);\n browser_action_views_.push_back(view);\n AddChildView(view);\n}\n\nvoid BrowserActionsContainer::RemoveBrowserAction(Extension* extension) {\n if (!extension->browser_action())\n return;\n\n for (std::vector<BrowserActionView*>::iterator iter =\n browser_action_views_.begin(); iter != browser_action_views_.end();\n ++iter) {\n if ((*iter)->button()->extension() == extension) {\n RemoveChildView(*iter);\n browser_action_views_.erase(iter);\n return;\n }\n }\n\n NOTREACHED() << \"Asked to remove a browser action view that doesn't exist.\";\n}\n\nvoid BrowserActionsContainer::DeleteBrowserActionViews() {\n if (!browser_action_views_.empty()) {\n for (size_t i = 0; i < browser_action_views_.size(); ++i)\n RemoveChildView(browser_action_views_[i]);\n STLDeleteContainerPointers(browser_action_views_.begin(),\n browser_action_views_.end());\n browser_action_views_.clear();\n }\n}\n\nvoid BrowserActionsContainer::OnBrowserActionVisibilityChanged() {\n toolbar_->Layout();\n}\n\nvoid BrowserActionsContainer::HidePopup() {\n if (popup_) {\n \/\/ This sometimes gets called via a timer (See BubbleLostFocus), so clear\n \/\/ the task factory. in case one is pending.\n task_factory_.RevokeAll();\n\n \/\/ Save these variables in local temporaries since destroying the popup\n \/\/ calls BubbleLostFocus to be called, which will try to call HidePopup()\n \/\/ again if popup_ is non-null.\n ExtensionPopup* closing_popup = popup_;\n BrowserActionButton* closing_button = popup_button_;\n popup_ = NULL;\n popup_button_ = NULL;\n\n closing_popup->DetachFromBrowser();\n delete closing_popup;\n closing_button->PopupDidHide();\n return;\n }\n}\n\nvoid BrowserActionsContainer::TestExecuteBrowserAction(int index) {\n BrowserActionButton* button = browser_action_views_[index]->button();\n OnBrowserActionExecuted(button);\n}\n\nvoid BrowserActionsContainer::OnBrowserActionExecuted(\n BrowserActionButton* button) {\n ExtensionAction* browser_action = button->browser_action();\n\n \/\/ Popups just display. No notification to the extension.\n \/\/ TODO(erikkay): should there be?\n if (button->IsPopup()) {\n \/\/ If we're showing the same popup, just hide it and return.\n bool same_showing = popup_ && button == popup_button_;\n\n \/\/ Always hide the current popup, even if it's not the same.\n \/\/ Only one popup should be visible at a time.\n HidePopup();\n\n if (same_showing)\n return;\n\n gfx::Point origin;\n View::ConvertPointToScreen(button, &origin);\n gfx::Rect rect = button->bounds();\n rect.set_x(origin.x());\n rect.set_y(origin.y());\n popup_ = ExtensionPopup::Show(browser_action->popup_url(),\n toolbar_->browser(),\n rect);\n popup_->set_delegate(this);\n popup_button_ = button;\n popup_button_->PopupDidShow();\n return;\n }\n\n \/\/ Otherwise, we send the action to the extension.\n ExtensionBrowserEventRouter::GetInstance()->BrowserActionExecuted(\n profile_, browser_action->extension_id(), toolbar_->browser());\n}\n\ngfx::Size BrowserActionsContainer::GetPreferredSize() {\n if (browser_action_views_.empty())\n return gfx::Size(0, 0);\n int width = kHorizontalPadding * 2 +\n browser_action_views_.size() * kButtonSize;\n if (browser_action_views_.size() > 1)\n width += (browser_action_views_.size() - 1) * kBrowserActionButtonPadding;\n return gfx::Size(width, kButtonSize);\n}\n\nvoid BrowserActionsContainer::Layout() {\n for (size_t i = 0; i < browser_action_views_.size(); ++i) {\n BrowserActionView* view = browser_action_views_[i];\n int x = kHorizontalPadding +\n i * (kButtonSize + kBrowserActionButtonPadding);\n if (x + kButtonSize <= width()) {\n view->SetBounds(x, 0, kButtonSize, height());\n view->SetVisible(true);\n } else {\n view->SetVisible(false);\n }\n }\n}\n\nvoid BrowserActionsContainer::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::EXTENSION_LOADED:\n AddBrowserAction(Details<Extension>(details).ptr());\n OnBrowserActionVisibilityChanged();\n break;\n\n case NotificationType::EXTENSION_UNLOADED:\n case NotificationType::EXTENSION_UNLOADED_DISABLED:\n RemoveBrowserAction(Details<Extension>(details).ptr());\n OnBrowserActionVisibilityChanged();\n break;\n\n case NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE:\n if (Details<ExtensionHost>(popup_->host()) != details)\n return;\n\n HidePopup();\n\n default:\n NOTREACHED() << L\"Unexpected notification\";\n }\n}\n\nvoid BrowserActionsContainer::BubbleBrowserWindowMoved(BrowserBubble* bubble) {\n}\n\nvoid BrowserActionsContainer::BubbleBrowserWindowClosing(\n BrowserBubble* bubble) {\n HidePopup();\n}\n\nvoid BrowserActionsContainer::BubbleGotFocus(BrowserBubble* bubble) {\n}\n\nvoid BrowserActionsContainer::BubbleLostFocus(BrowserBubble* bubble) {\n if (!popup_)\n return;\n\n \/\/ This is a bit annoying. If you click on the button that generated the\n \/\/ current popup, then we first get this lost focus message, and then\n \/\/ we get the click action. This results in the popup being immediately\n \/\/ shown again. To workaround this, we put in a delay.\n MessageLoop::current()->PostTask(FROM_HERE,\n task_factory_.NewRunnableMethod(&BrowserActionsContainer::HidePopup));\n}\n\nint BrowserActionsContainer::GetClippedPreferredWidth(int available_width) {\n if (browser_action_views_.size() == 0)\n return 0;\n\n \/\/ We have at least one browser action. Make some of them sticky.\n int min_width = kHorizontalPadding * 2 +\n std::min(static_cast<int>(browser_action_views_.size()),\n kMinimumNumberOfVisibleBrowserActions) * kButtonSize;\n\n \/\/ Even if available_width is <= 0, we still return at least the |min_width|.\n if (available_width <= 0)\n return min_width;\n\n return std::max(min_width, available_width - available_width % kButtonSize +\n kHorizontalPadding * 2);\n}\n<commit_msg>Fix paint glitch on load\/unload browser action.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/browser_actions_container.h\"\n\n#include \"app\/gfx\/canvas.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/extensions\/extension_browser_event_router.h\"\n#include \"chrome\/browser\/extensions\/extensions_service.h\"\n#include \"chrome\/browser\/extensions\/extension_tabs_module.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/browser\/views\/extensions\/extension_popup.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/common\/notification_source.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"grit\/app_resources.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"third_party\/skia\/include\/core\/SkTypeface.h\"\n#include \"third_party\/skia\/include\/effects\/SkGradientShader.h\"\n#include \"views\/controls\/button\/text_button.h\"\n\n\/\/ The size (both dimensions) of the buttons for page actions.\nstatic const int kButtonSize = 29;\n\n\/\/ The padding between the browser actions and the omnibox\/page menu.\nstatic const int kHorizontalPadding = 4;\n\n\/\/ The padding between browser action buttons. Visually, the actual number of\n\/\/ empty (non-drawing) pixels is this value + 2 when adjacent browser icons\n\/\/ use their maximum allowed size.\nstatic const int kBrowserActionButtonPadding = 3;\n\n\/\/ This is the same value from toolbar.cc. We position the browser actions\n\/\/ container flush with the edges of the toolbar as a special case so that we\n\/\/ can draw the badge outside the visual bounds of the container.\nstatic const int kControlVertOffset = 6;\n\n\/\/ The maximum of the minimum number of browser actions present when there is\n\/\/ not enough space to fit all the browser actions in the toolbar.\nstatic const int kMinimumNumberOfVisibleBrowserActions = 2;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionButton\n\nBrowserActionButton::BrowserActionButton(Extension* extension,\n BrowserActionsContainer* panel)\n : MenuButton(this, L\"\", NULL, false),\n browser_action_(extension->browser_action()),\n extension_(extension),\n tracker_(NULL),\n panel_(panel) {\n set_alignment(TextButton::ALIGN_CENTER);\n\n \/\/ No UpdateState() here because View heirarchy not setup yet. Our parent\n \/\/ should call UpdateState() after creation.\n\n registrar_.Add(this, NotificationType::EXTENSION_BROWSER_ACTION_UPDATED,\n Source<ExtensionAction>(browser_action_));\n}\n\nBrowserActionButton::~BrowserActionButton() {\n if (tracker_) {\n tracker_->StopTrackingImageLoad();\n tracker_ = NULL; \/\/ The tracker object will be deleted when we return.\n }\n}\n\ngfx::Insets BrowserActionButton::GetInsets() const {\n static gfx::Insets zero_inset;\n return zero_inset;\n}\n\nvoid BrowserActionButton::ButtonPressed(\n views::Button* sender, const views::Event& event) {\n panel_->OnBrowserActionExecuted(this);\n}\n\nvoid BrowserActionButton::LoadImage() {\n \/\/ Load the default image from the browser action asynchronously on the file\n \/\/ thread. We'll get a call back into OnImageLoaded if the image loads\n \/\/ successfully.\n std::string relative_path = browser_action()->default_icon_path();\n if (relative_path.empty())\n return;\n\n tracker_ = new ImageLoadingTracker(this, 1);\n tracker_->PostLoadImageTask(\n extension()->GetResource(relative_path),\n gfx::Size(Extension::kBrowserActionIconMaxSize,\n Extension::kBrowserActionIconMaxSize));\n}\n\nvoid BrowserActionButton::OnImageLoaded(SkBitmap* image, size_t index) {\n if (image)\n SetIcon(*image);\n tracker_ = NULL; \/\/ The tracker object will delete itself when we return.\n GetParent()->SchedulePaint();\n}\n\nvoid BrowserActionButton::UpdateState() {\n int tab_id = panel_->GetCurrentTabId();\n if (tab_id < 0)\n return;\n\n SkBitmap image = browser_action()->GetIcon(tab_id);\n if (image.isNull())\n LoadImage();\n else\n SetIcon(image);\n\n SetTooltipText(ASCIIToWide(browser_action()->GetTitle(tab_id)));\n GetParent()->SchedulePaint();\n}\n\nvoid BrowserActionButton::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::EXTENSION_BROWSER_ACTION_UPDATED) {\n UpdateState();\n } else {\n NOTREACHED() << L\"Received unexpected notification\";\n }\n}\n\nbool BrowserActionButton::IsPopup() {\n return browser_action_->has_popup();\n}\n\nbool BrowserActionButton::Activate() {\n if (IsPopup()) {\n panel_->OnBrowserActionExecuted(this);\n\n \/\/ TODO(erikkay): Run a nested modal loop while the mouse is down to\n \/\/ enable menu-like drag-select behavior.\n\n \/\/ The return value of this method is returned via OnMousePressed.\n \/\/ We need to return false here since we're handing off focus to another\n \/\/ widget\/view, and true will grab it right back and try to send events\n \/\/ to us.\n return false;\n }\n return true;\n}\n\nbool BrowserActionButton::OnMousePressed(const views::MouseEvent& e) {\n if (IsPopup())\n return MenuButton::OnMousePressed(e);\n return TextButton::OnMousePressed(e);\n}\n\nvoid BrowserActionButton::OnMouseReleased(const views::MouseEvent& e,\n bool canceled) {\n if (IsPopup()) {\n \/\/ TODO(erikkay) this never actually gets called (probably because of the\n \/\/ loss of focus).\n MenuButton::OnMouseReleased(e, canceled);\n } else {\n TextButton::OnMouseReleased(e, canceled);\n }\n}\n\nbool BrowserActionButton::OnKeyReleased(const views::KeyEvent& e) {\n if (IsPopup())\n return MenuButton::OnKeyReleased(e);\n return TextButton::OnKeyReleased(e);\n}\n\nvoid BrowserActionButton::OnMouseExited(const views::MouseEvent& e) {\n if (IsPopup())\n MenuButton::OnMouseExited(e);\n else\n TextButton::OnMouseExited(e);\n}\n\nvoid BrowserActionButton::PopupDidShow() {\n SetState(views::CustomButton::BS_PUSHED);\n menu_visible_ = true;\n}\n\nvoid BrowserActionButton::PopupDidHide() {\n SetState(views::CustomButton::BS_NORMAL);\n menu_visible_ = false;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionView\n\nBrowserActionView::BrowserActionView(Extension* extension,\n BrowserActionsContainer* panel)\n : panel_(panel) {\n button_ = new BrowserActionButton(extension, panel);\n AddChildView(button_);\n button_->UpdateState();\n}\n\nvoid BrowserActionView::Layout() {\n button_->SetBounds(0, kControlVertOffset, width(), kButtonSize);\n}\n\nvoid BrowserActionView::PaintChildren(gfx::Canvas* canvas) {\n View::PaintChildren(canvas);\n ExtensionAction* action = button()->browser_action();\n int tab_id = panel_->GetCurrentTabId();\n if (tab_id < 0)\n return;\n\n action->PaintBadge(canvas, gfx::Rect(width(), height()), tab_id);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserActionsContainer\n\nBrowserActionsContainer::BrowserActionsContainer(\n Profile* profile, ToolbarView* toolbar)\n : profile_(profile),\n toolbar_(toolbar),\n popup_(NULL),\n popup_button_(NULL),\n ALLOW_THIS_IN_INITIALIZER_LIST(task_factory_(this)) {\n ExtensionsService* extension_service = profile->GetExtensionsService();\n if (!extension_service) \/\/ The |extension_service| can be NULL in Incognito.\n return;\n\n registrar_.Add(this, NotificationType::EXTENSION_LOADED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED_DISABLED,\n Source<ExtensionsService>(extension_service));\n registrar_.Add(this, NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE,\n Source<Profile>(profile_));\n\n for (size_t i = 0; i < extension_service->extensions()->size(); ++i)\n AddBrowserAction(extension_service->extensions()->at(i));\n\n SetID(VIEW_ID_BROWSER_ACTION_TOOLBAR);\n}\n\nBrowserActionsContainer::~BrowserActionsContainer() {\n HidePopup();\n DeleteBrowserActionViews();\n}\n\nint BrowserActionsContainer::GetCurrentTabId() {\n TabContents* tab_contents = toolbar_->browser()->GetSelectedTabContents();\n if (!tab_contents)\n return -1;\n\n return tab_contents->controller().session_id().id();\n}\n\nvoid BrowserActionsContainer::RefreshBrowserActionViews() {\n for (size_t i = 0; i < browser_action_views_.size(); ++i)\n browser_action_views_[i]->button()->UpdateState();\n}\n\nvoid BrowserActionsContainer::AddBrowserAction(Extension* extension) {\n#if defined(DEBUG)\n for (size_t i = 0; i < browser_action_views_.size(); ++i) {\n DCHECK(browser_action_views_[i]->button()->extension() != extension) <<\n \"Asked to add a browser action view for an extension that already \"\n \"exists.\";\n }\n#endif\n if (!extension->browser_action())\n return;\n\n BrowserActionView* view = new BrowserActionView(extension, this);\n browser_action_views_.push_back(view);\n AddChildView(view);\n if (GetParent()) \n GetParent()->SchedulePaint();\n}\n\nvoid BrowserActionsContainer::RemoveBrowserAction(Extension* extension) {\n if (!extension->browser_action())\n return;\n\n for (std::vector<BrowserActionView*>::iterator iter =\n browser_action_views_.begin(); iter != browser_action_views_.end();\n ++iter) {\n if ((*iter)->button()->extension() == extension) {\n RemoveChildView(*iter);\n browser_action_views_.erase(iter);\n if (GetParent()) \n GetParent()->SchedulePaint();\n return;\n }\n }\n\n NOTREACHED() << \"Asked to remove a browser action view that doesn't exist.\";\n}\n\nvoid BrowserActionsContainer::DeleteBrowserActionViews() {\n if (!browser_action_views_.empty()) {\n for (size_t i = 0; i < browser_action_views_.size(); ++i)\n RemoveChildView(browser_action_views_[i]);\n STLDeleteContainerPointers(browser_action_views_.begin(),\n browser_action_views_.end());\n browser_action_views_.clear();\n }\n}\n\nvoid BrowserActionsContainer::OnBrowserActionVisibilityChanged() {\n toolbar_->Layout();\n}\n\nvoid BrowserActionsContainer::HidePopup() {\n if (popup_) {\n \/\/ This sometimes gets called via a timer (See BubbleLostFocus), so clear\n \/\/ the task factory. in case one is pending.\n task_factory_.RevokeAll();\n\n \/\/ Save these variables in local temporaries since destroying the popup\n \/\/ calls BubbleLostFocus to be called, which will try to call HidePopup()\n \/\/ again if popup_ is non-null.\n ExtensionPopup* closing_popup = popup_;\n BrowserActionButton* closing_button = popup_button_;\n popup_ = NULL;\n popup_button_ = NULL;\n\n closing_popup->DetachFromBrowser();\n delete closing_popup;\n closing_button->PopupDidHide();\n return;\n }\n}\n\nvoid BrowserActionsContainer::TestExecuteBrowserAction(int index) {\n BrowserActionButton* button = browser_action_views_[index]->button();\n OnBrowserActionExecuted(button);\n}\n\nvoid BrowserActionsContainer::OnBrowserActionExecuted(\n BrowserActionButton* button) {\n ExtensionAction* browser_action = button->browser_action();\n\n \/\/ Popups just display. No notification to the extension.\n \/\/ TODO(erikkay): should there be?\n if (button->IsPopup()) {\n \/\/ If we're showing the same popup, just hide it and return.\n bool same_showing = popup_ && button == popup_button_;\n\n \/\/ Always hide the current popup, even if it's not the same.\n \/\/ Only one popup should be visible at a time.\n HidePopup();\n\n if (same_showing)\n return;\n\n gfx::Point origin;\n View::ConvertPointToScreen(button, &origin);\n gfx::Rect rect = button->bounds();\n rect.set_x(origin.x());\n rect.set_y(origin.y());\n popup_ = ExtensionPopup::Show(browser_action->popup_url(),\n toolbar_->browser(),\n rect);\n popup_->set_delegate(this);\n popup_button_ = button;\n popup_button_->PopupDidShow();\n return;\n }\n\n \/\/ Otherwise, we send the action to the extension.\n ExtensionBrowserEventRouter::GetInstance()->BrowserActionExecuted(\n profile_, browser_action->extension_id(), toolbar_->browser());\n}\n\ngfx::Size BrowserActionsContainer::GetPreferredSize() {\n if (browser_action_views_.empty())\n return gfx::Size(0, 0);\n int width = kHorizontalPadding * 2 +\n browser_action_views_.size() * kButtonSize;\n if (browser_action_views_.size() > 1)\n width += (browser_action_views_.size() - 1) * kBrowserActionButtonPadding;\n return gfx::Size(width, kButtonSize);\n}\n\nvoid BrowserActionsContainer::Layout() {\n for (size_t i = 0; i < browser_action_views_.size(); ++i) {\n BrowserActionView* view = browser_action_views_[i];\n int x = kHorizontalPadding +\n i * (kButtonSize + kBrowserActionButtonPadding);\n if (x + kButtonSize <= width()) {\n view->SetBounds(x, 0, kButtonSize, height());\n view->SetVisible(true);\n } else {\n view->SetVisible(false);\n }\n }\n}\n\nvoid BrowserActionsContainer::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::EXTENSION_LOADED:\n AddBrowserAction(Details<Extension>(details).ptr());\n OnBrowserActionVisibilityChanged();\n break;\n\n case NotificationType::EXTENSION_UNLOADED:\n case NotificationType::EXTENSION_UNLOADED_DISABLED:\n RemoveBrowserAction(Details<Extension>(details).ptr());\n OnBrowserActionVisibilityChanged();\n break;\n\n case NotificationType::EXTENSION_HOST_VIEW_SHOULD_CLOSE:\n if (Details<ExtensionHost>(popup_->host()) != details)\n return;\n\n HidePopup();\n\n default:\n NOTREACHED() << L\"Unexpected notification\";\n }\n}\n\nvoid BrowserActionsContainer::BubbleBrowserWindowMoved(BrowserBubble* bubble) {\n}\n\nvoid BrowserActionsContainer::BubbleBrowserWindowClosing(\n BrowserBubble* bubble) {\n HidePopup();\n}\n\nvoid BrowserActionsContainer::BubbleGotFocus(BrowserBubble* bubble) {\n}\n\nvoid BrowserActionsContainer::BubbleLostFocus(BrowserBubble* bubble) {\n if (!popup_)\n return;\n\n \/\/ This is a bit annoying. If you click on the button that generated the\n \/\/ current popup, then we first get this lost focus message, and then\n \/\/ we get the click action. This results in the popup being immediately\n \/\/ shown again. To workaround this, we put in a delay.\n MessageLoop::current()->PostTask(FROM_HERE,\n task_factory_.NewRunnableMethod(&BrowserActionsContainer::HidePopup));\n}\n\nint BrowserActionsContainer::GetClippedPreferredWidth(int available_width) {\n if (browser_action_views_.size() == 0)\n return 0;\n\n \/\/ We have at least one browser action. Make some of them sticky.\n int min_width = kHorizontalPadding * 2 +\n std::min(static_cast<int>(browser_action_views_.size()),\n kMinimumNumberOfVisibleBrowserActions) * kButtonSize;\n\n \/\/ Even if available_width is <= 0, we still return at least the |min_width|.\n if (available_width <= 0)\n return min_width;\n\n return std::max(min_width, available_width - available_width % kButtonSize +\n kHorizontalPadding * 2);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/worker_host\/worker_process_host.h\"\n\n#include <set>\n\n#include \"base\/command_line.h\"\n#include \"base\/debug_util.h\"\n#if defined(OS_POSIX)\n#include \"base\/global_descriptors_posix.h\"\n#endif\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/worker_host\/message_port_dispatcher.h\"\n#include \"chrome\/browser\/worker_host\/worker_service.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/debug_flags.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/result_codes.h\"\n#include \"chrome\/common\/worker_messages.h\"\n#include \"ipc\/ipc_descriptors.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"net\/base\/registry_controlled_domain.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/browser\/sandbox_policy.h\"\n#endif\n\n\/\/ Notifies RenderViewHost that one or more worker objects crashed.\nclass WorkerCrashTask : public Task {\n public:\n WorkerCrashTask(int render_process_id, int render_view_id)\n : render_process_id_(render_process_id),\n render_view_id_(render_view_id) { }\n\n void Run() {\n RenderViewHost* host =\n RenderViewHost::FromID(render_process_id_, render_view_id_);\n if (host) {\n RenderViewHostDelegate::BrowserIntegration* integration_delegate =\n host->delegate()->GetBrowserIntegrationDelegate();\n if (integration_delegate)\n integration_delegate->OnCrashedWorker();\n }\n }\n\n private:\n int render_process_id_;\n int render_view_id_;\n};\n\n\nWorkerProcessHost::WorkerProcessHost(\n ResourceDispatcherHost* resource_dispatcher_host_)\n : ChildProcessHost(WORKER_PROCESS, resource_dispatcher_host_) {\n next_route_id_callback_.reset(NewCallbackWithReturnValue(\n WorkerService::GetInstance(), &WorkerService::next_worker_route_id));\n}\n\nWorkerProcessHost::~WorkerProcessHost() {\n \/\/ Let interested observers know we are being deleted.\n NotificationService::current()->Notify(\n NotificationType::WORKER_PROCESS_HOST_SHUTDOWN,\n Source<WorkerProcessHost>(this),\n NotificationService::NoDetails());\n\n \/\/ If we crashed, tell the RenderViewHost.\n MessageLoop* ui_loop = WorkerService::GetInstance()->ui_loop();\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n ui_loop->PostTask(FROM_HERE, new WorkerCrashTask(\n i->renderer_process_id, i->render_view_route_id));\n }\n\n ChildProcessSecurityPolicy::GetInstance()->Remove(GetProcessId());\n}\n\nbool WorkerProcessHost::Init() {\n if (!CreateChannel())\n return false;\n\n std::wstring exe_path;\n if (!PathService::Get(base::FILE_EXE, &exe_path))\n return false;\n\n CommandLine cmd_line(exe_path);\n cmd_line.AppendSwitchWithValue(switches::kProcessType,\n switches::kWorkerProcess);\n cmd_line.AppendSwitchWithValue(switches::kProcessChannelID,\n ASCIIToWide(channel_id()));\n\n if (CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kEnableNativeWebWorkers)) {\n cmd_line.AppendSwitch(switches::kEnableNativeWebWorkers);\n }\n\n if (CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kWebWorkerShareProcesses)) {\n cmd_line.AppendSwitch(switches::kWebWorkerShareProcesses);\n }\n\n base::ProcessHandle process;\n#if defined(OS_WIN)\n process = sandbox::StartProcess(&cmd_line);\n#else\n \/\/ This code is duplicated with browser_render_process_host.cc, but\n \/\/ there's not a good place to de-duplicate it.\n base::file_handle_mapping_vector fds_to_map;\n const int ipcfd = channel().GetClientFileDescriptor();\n if (ipcfd > -1) {\n fds_to_map.push_back(std::pair<int, int>(\n ipcfd, kPrimaryIPCChannel + base::GlobalDescriptors::kBaseDescriptor));\n }\n base::LaunchApp(cmd_line.argv(), fds_to_map, false, &process);\n#endif\n if (!process)\n return false;\n SetHandle(process);\n\n ChildProcessSecurityPolicy::GetInstance()->Add(GetProcessId());\n\n return true;\n}\n\nvoid WorkerProcessHost::CreateWorker(const WorkerInstance& instance) {\n ChildProcessSecurityPolicy::GetInstance()->GrantRequestURL(\n GetProcessId(), instance.url);\n\n instances_.push_back(instance);\n Send(new WorkerProcessMsg_CreateWorker(\n instance.url, instance.worker_route_id));\n\n UpdateTitle();\n instances_.back().sender->Send(\n new ViewMsg_DedicatedWorkerCreated(instance.sender_route_id));\n}\n\nbool WorkerProcessHost::FilterMessage(const IPC::Message& message,\n int sender_pid) {\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n if (i->sender_pid == sender_pid &&\n i->sender_route_id == message.routing_id()) {\n RelayMessage(\n message, this, i->worker_route_id, next_route_id_callback_.get());\n return true;\n }\n }\n\n return false;\n}\n\nURLRequestContext* WorkerProcessHost::GetRequestContext(\n uint32 request_id,\n const ViewHostMsg_Resource_Request& request_data) {\n return NULL;\n}\n\nvoid WorkerProcessHost::OnMessageReceived(const IPC::Message& message) {\n bool msg_is_ok = true;\n bool handled = MessagePortDispatcher::GetInstance()->OnMessageReceived(\n message, this, next_route_id_callback_.get(), &msg_is_ok);\n\n if (!handled) {\n handled = true;\n IPC_BEGIN_MESSAGE_MAP_EX(WorkerProcessHost, message, msg_is_ok)\n IPC_MESSAGE_HANDLER(ViewHostMsg_CreateDedicatedWorker,\n OnCreateDedicatedWorker)\n IPC_MESSAGE_HANDLER(ViewHostMsg_CancelCreateDedicatedWorker,\n OnCancelCreateDedicatedWorker)\n IPC_MESSAGE_HANDLER(ViewHostMsg_ForwardToWorker,\n OnForwardToWorker)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP_EX()\n }\n\n if (!msg_is_ok) {\n NOTREACHED();\n base::KillProcess(handle(), ResultCodes::KILLED_BAD_MESSAGE, false);\n }\n\n if (handled)\n return;\n\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n if (i->worker_route_id == message.routing_id()) {\n CallbackWithReturnValue<int>::Type* next_route_id =\n GetNextRouteIdCallback(i->sender);\n RelayMessage(message, i->sender, i->sender_route_id, next_route_id);\n\n if (message.type() == WorkerHostMsg_WorkerContextDestroyed::ID) {\n instances_.erase(i);\n UpdateTitle();\n }\n break;\n }\n }\n}\n\nCallbackWithReturnValue<int>::Type* WorkerProcessHost::GetNextRouteIdCallback(\n IPC::Message::Sender* sender) {\n \/\/ We don't keep callbacks for senders associated with workers, so figure out\n \/\/ what kind of sender this is, and cast it to the correct class to get the\n \/\/ callback.\n for (ChildProcessHost::Iterator iter(ChildProcessInfo::WORKER_PROCESS);\n !iter.Done(); ++iter) {\n WorkerProcessHost* worker = static_cast<WorkerProcessHost*>(*iter);\n if (static_cast<IPC::Message::Sender*>(worker) == sender)\n return worker->next_route_id_callback_.get();\n }\n\n \/\/ Must be a ResourceMessageFilter.\n return static_cast<ResourceMessageFilter*>(sender)->next_route_id_callback();\n}\n\nvoid WorkerProcessHost::RelayMessage(\n const IPC::Message& message,\n IPC::Message::Sender* sender,\n int route_id,\n CallbackWithReturnValue<int>::Type* next_route_id) {\n IPC::Message* new_message;\n if (message.type() == WorkerMsg_PostMessage::ID) {\n \/\/ We want to send the receiver a routing id for the new channel, so\n \/\/ crack the message first.\n string16 msg;\n int sent_message_port_id;\n int new_routing_id; \/\/ Ignore the bogus value from the sender.\n if (!WorkerMsg_PostMessage::Read(\n &message, &msg, &sent_message_port_id, &new_routing_id)) {\n return;\n }\n\n if (sent_message_port_id != MSG_ROUTING_NONE) {\n new_routing_id = next_route_id->Run();\n MessagePortDispatcher::GetInstance()->UpdateMessagePort(\n sent_message_port_id, sender, new_routing_id, next_route_id);\n }\n\n new_message = new WorkerMsg_PostMessage(\n route_id, msg, sent_message_port_id, new_routing_id);\n } else {\n new_message = new IPC::Message(message);\n new_message->set_routing_id(route_id);\n }\n\n sender->Send(new_message);\n}\n\nvoid WorkerProcessHost::SenderShutdown(IPC::Message::Sender* sender) {\n for (Instances::iterator i = instances_.begin(); i != instances_.end();) {\n if (i->sender == sender) {\n Send(new WorkerMsg_TerminateWorkerContext(i->worker_route_id));\n i = instances_.erase(i);\n } else {\n ++i;\n }\n }\n}\n\nvoid WorkerProcessHost::UpdateTitle() {\n std::set<std::string> titles;\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n std::string title =\n net::RegistryControlledDomainService::GetDomainAndRegistry(i->url);\n \/\/ Use the host name if the domain is empty, i.e. localhost or IP address.\n if (title.empty())\n title = i->url.host();\n \/\/ If the host name is empty, i.e. file url, use the path.\n if (title.empty())\n title = i->url.path();\n titles.insert(title);\n }\n\n std::string display_title;\n for (std::set<std::string>::iterator i = titles.begin();\n i != titles.end(); ++i) {\n if (!display_title.empty())\n display_title += \", \";\n display_title += *i;\n }\n\n set_name(ASCIIToWide(display_title));\n}\n\nvoid WorkerProcessHost::OnCreateDedicatedWorker(const GURL& url,\n int render_view_route_id,\n int* route_id) {\n DCHECK(instances_.size() == 1); \/\/ Only called when one process per worker.\n *route_id = WorkerService::GetInstance()->next_worker_route_id();\n WorkerService::GetInstance()->CreateDedicatedWorker(\n url, instances_.front().renderer_process_id,\n instances_.front().render_view_route_id, this, GetProcessId(), *route_id);\n}\n\nvoid WorkerProcessHost::OnCancelCreateDedicatedWorker(int route_id) {\n WorkerService::GetInstance()->CancelCreateDedicatedWorker(\n GetProcessId(), route_id);\n}\n\nvoid WorkerProcessHost::OnForwardToWorker(const IPC::Message& message) {\n WorkerService::GetInstance()->ForwardMessage(message, GetProcessId());\n}\n<commit_msg>Get rid of warning on CHROME_OS builder. Review URL: http:\/\/codereview.chromium.org\/165080<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/worker_host\/worker_process_host.h\"\n\n#include <set>\n\n#include \"base\/command_line.h\"\n#include \"base\/debug_util.h\"\n#if defined(OS_POSIX)\n#include \"base\/global_descriptors_posix.h\"\n#endif\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/process_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/child_process_security_policy.h\"\n#include \"chrome\/browser\/renderer_host\/render_view_host.h\"\n#include \"chrome\/browser\/renderer_host\/resource_message_filter.h\"\n#include \"chrome\/browser\/worker_host\/message_port_dispatcher.h\"\n#include \"chrome\/browser\/worker_host\/worker_service.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/debug_flags.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"chrome\/common\/result_codes.h\"\n#include \"chrome\/common\/worker_messages.h\"\n#include \"ipc\/ipc_descriptors.h\"\n#include \"ipc\/ipc_switches.h\"\n#include \"net\/base\/registry_controlled_domain.h\"\n\n#if defined(OS_WIN)\n#include \"chrome\/browser\/sandbox_policy.h\"\n#endif\n\n\/\/ Notifies RenderViewHost that one or more worker objects crashed.\nclass WorkerCrashTask : public Task {\n public:\n WorkerCrashTask(int render_process_id, int render_view_id)\n : render_process_id_(render_process_id),\n render_view_id_(render_view_id) { }\n\n void Run() {\n RenderViewHost* host =\n RenderViewHost::FromID(render_process_id_, render_view_id_);\n if (host) {\n RenderViewHostDelegate::BrowserIntegration* integration_delegate =\n host->delegate()->GetBrowserIntegrationDelegate();\n if (integration_delegate)\n integration_delegate->OnCrashedWorker();\n }\n }\n\n private:\n int render_process_id_;\n int render_view_id_;\n};\n\n\nWorkerProcessHost::WorkerProcessHost(\n ResourceDispatcherHost* resource_dispatcher_host_)\n : ChildProcessHost(WORKER_PROCESS, resource_dispatcher_host_) {\n next_route_id_callback_.reset(NewCallbackWithReturnValue(\n WorkerService::GetInstance(), &WorkerService::next_worker_route_id));\n}\n\nWorkerProcessHost::~WorkerProcessHost() {\n \/\/ Let interested observers know we are being deleted.\n NotificationService::current()->Notify(\n NotificationType::WORKER_PROCESS_HOST_SHUTDOWN,\n Source<WorkerProcessHost>(this),\n NotificationService::NoDetails());\n\n \/\/ If we crashed, tell the RenderViewHost.\n MessageLoop* ui_loop = WorkerService::GetInstance()->ui_loop();\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n ui_loop->PostTask(FROM_HERE, new WorkerCrashTask(\n i->renderer_process_id, i->render_view_route_id));\n }\n\n ChildProcessSecurityPolicy::GetInstance()->Remove(GetProcessId());\n}\n\nbool WorkerProcessHost::Init() {\n if (!CreateChannel())\n return false;\n\n std::wstring exe_path;\n if (!PathService::Get(base::FILE_EXE, &exe_path))\n return false;\n\n CommandLine cmd_line(exe_path);\n cmd_line.AppendSwitchWithValue(switches::kProcessType,\n switches::kWorkerProcess);\n cmd_line.AppendSwitchWithValue(switches::kProcessChannelID,\n ASCIIToWide(channel_id()));\n\n if (CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kEnableNativeWebWorkers)) {\n cmd_line.AppendSwitch(switches::kEnableNativeWebWorkers);\n }\n\n if (CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kWebWorkerShareProcesses)) {\n cmd_line.AppendSwitch(switches::kWebWorkerShareProcesses);\n }\n\n base::ProcessHandle process;\n#if defined(OS_WIN)\n process = sandbox::StartProcess(&cmd_line);\n#else\n \/\/ This code is duplicated with browser_render_process_host.cc, but\n \/\/ there's not a good place to de-duplicate it.\n base::file_handle_mapping_vector fds_to_map;\n const int ipcfd = channel().GetClientFileDescriptor();\n if (ipcfd > -1) {\n fds_to_map.push_back(std::pair<int, int>(\n ipcfd, kPrimaryIPCChannel + base::GlobalDescriptors::kBaseDescriptor));\n }\n base::LaunchApp(cmd_line.argv(), fds_to_map, false, &process);\n#endif\n if (!process)\n return false;\n SetHandle(process);\n\n ChildProcessSecurityPolicy::GetInstance()->Add(GetProcessId());\n\n return true;\n}\n\nvoid WorkerProcessHost::CreateWorker(const WorkerInstance& instance) {\n ChildProcessSecurityPolicy::GetInstance()->GrantRequestURL(\n GetProcessId(), instance.url);\n\n instances_.push_back(instance);\n Send(new WorkerProcessMsg_CreateWorker(\n instance.url, instance.worker_route_id));\n\n UpdateTitle();\n instances_.back().sender->Send(\n new ViewMsg_DedicatedWorkerCreated(instance.sender_route_id));\n}\n\nbool WorkerProcessHost::FilterMessage(const IPC::Message& message,\n int sender_pid) {\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n if (i->sender_pid == sender_pid &&\n i->sender_route_id == message.routing_id()) {\n RelayMessage(\n message, this, i->worker_route_id, next_route_id_callback_.get());\n return true;\n }\n }\n\n return false;\n}\n\nURLRequestContext* WorkerProcessHost::GetRequestContext(\n uint32 request_id,\n const ViewHostMsg_Resource_Request& request_data) {\n return NULL;\n}\n\nvoid WorkerProcessHost::OnMessageReceived(const IPC::Message& message) {\n bool msg_is_ok = true;\n bool handled = MessagePortDispatcher::GetInstance()->OnMessageReceived(\n message, this, next_route_id_callback_.get(), &msg_is_ok);\n\n if (!handled) {\n handled = true;\n IPC_BEGIN_MESSAGE_MAP_EX(WorkerProcessHost, message, msg_is_ok)\n IPC_MESSAGE_HANDLER(ViewHostMsg_CreateDedicatedWorker,\n OnCreateDedicatedWorker)\n IPC_MESSAGE_HANDLER(ViewHostMsg_CancelCreateDedicatedWorker,\n OnCancelCreateDedicatedWorker)\n IPC_MESSAGE_HANDLER(ViewHostMsg_ForwardToWorker,\n OnForwardToWorker)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP_EX()\n }\n\n if (!msg_is_ok) {\n NOTREACHED();\n base::KillProcess(handle(), ResultCodes::KILLED_BAD_MESSAGE, false);\n }\n\n if (handled)\n return;\n\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n if (i->worker_route_id == message.routing_id()) {\n CallbackWithReturnValue<int>::Type* next_route_id =\n GetNextRouteIdCallback(i->sender);\n RelayMessage(message, i->sender, i->sender_route_id, next_route_id);\n\n if (message.type() == WorkerHostMsg_WorkerContextDestroyed::ID) {\n instances_.erase(i);\n UpdateTitle();\n }\n break;\n }\n }\n}\n\nCallbackWithReturnValue<int>::Type* WorkerProcessHost::GetNextRouteIdCallback(\n IPC::Message::Sender* sender) {\n \/\/ We don't keep callbacks for senders associated with workers, so figure out\n \/\/ what kind of sender this is, and cast it to the correct class to get the\n \/\/ callback.\n for (ChildProcessHost::Iterator iter(ChildProcessInfo::WORKER_PROCESS);\n !iter.Done(); ++iter) {\n WorkerProcessHost* worker = static_cast<WorkerProcessHost*>(*iter);\n if (static_cast<IPC::Message::Sender*>(worker) == sender)\n return worker->next_route_id_callback_.get();\n }\n\n \/\/ Must be a ResourceMessageFilter.\n return static_cast<ResourceMessageFilter*>(sender)->next_route_id_callback();\n}\n\nvoid WorkerProcessHost::RelayMessage(\n const IPC::Message& message,\n IPC::Message::Sender* sender,\n int route_id,\n CallbackWithReturnValue<int>::Type* next_route_id) {\n IPC::Message* new_message;\n if (message.type() == WorkerMsg_PostMessage::ID) {\n \/\/ We want to send the receiver a routing id for the new channel, so\n \/\/ crack the message first.\n string16 msg;\n int sent_message_port_id = MSG_ROUTING_NONE;\n int new_routing_id = MSG_ROUTING_NONE;\n if (!WorkerMsg_PostMessage::Read(\n &message, &msg, &sent_message_port_id, &new_routing_id)) {\n return;\n }\n\n if (sent_message_port_id != MSG_ROUTING_NONE) {\n new_routing_id = next_route_id->Run();\n MessagePortDispatcher::GetInstance()->UpdateMessagePort(\n sent_message_port_id, sender, new_routing_id, next_route_id);\n }\n\n new_message = new WorkerMsg_PostMessage(\n route_id, msg, sent_message_port_id, new_routing_id);\n } else {\n new_message = new IPC::Message(message);\n new_message->set_routing_id(route_id);\n }\n\n sender->Send(new_message);\n}\n\nvoid WorkerProcessHost::SenderShutdown(IPC::Message::Sender* sender) {\n for (Instances::iterator i = instances_.begin(); i != instances_.end();) {\n if (i->sender == sender) {\n Send(new WorkerMsg_TerminateWorkerContext(i->worker_route_id));\n i = instances_.erase(i);\n } else {\n ++i;\n }\n }\n}\n\nvoid WorkerProcessHost::UpdateTitle() {\n std::set<std::string> titles;\n for (Instances::iterator i = instances_.begin(); i != instances_.end(); ++i) {\n std::string title =\n net::RegistryControlledDomainService::GetDomainAndRegistry(i->url);\n \/\/ Use the host name if the domain is empty, i.e. localhost or IP address.\n if (title.empty())\n title = i->url.host();\n \/\/ If the host name is empty, i.e. file url, use the path.\n if (title.empty())\n title = i->url.path();\n titles.insert(title);\n }\n\n std::string display_title;\n for (std::set<std::string>::iterator i = titles.begin();\n i != titles.end(); ++i) {\n if (!display_title.empty())\n display_title += \", \";\n display_title += *i;\n }\n\n set_name(ASCIIToWide(display_title));\n}\n\nvoid WorkerProcessHost::OnCreateDedicatedWorker(const GURL& url,\n int render_view_route_id,\n int* route_id) {\n DCHECK(instances_.size() == 1); \/\/ Only called when one process per worker.\n *route_id = WorkerService::GetInstance()->next_worker_route_id();\n WorkerService::GetInstance()->CreateDedicatedWorker(\n url, instances_.front().renderer_process_id,\n instances_.front().render_view_route_id, this, GetProcessId(), *route_id);\n}\n\nvoid WorkerProcessHost::OnCancelCreateDedicatedWorker(int route_id) {\n WorkerService::GetInstance()->CancelCreateDedicatedWorker(\n GetProcessId(), route_id);\n}\n\nvoid WorkerProcessHost::OnForwardToWorker(const IPC::Message& message) {\n WorkerService::GetInstance()->ForwardMessage(message, GetProcessId());\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/service\/net\/service_url_request_context.h\"\n\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n#include <sys\/utsname.h>\n#endif\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/sys_info.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"chrome\/service\/service_process.h\"\n#include \"net\/base\/cert_verifier.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#include \"net\/cookies\/cookie_monster.h\"\n#include \"net\/ftp\/ftp_network_layer.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/http_cache.h\"\n#include \"net\/http\/http_network_session.h\"\n#include \"net\/http\/http_server_properties_impl.h\"\n#include \"net\/proxy\/proxy_config_service.h\"\n#include \"net\/proxy\/proxy_service.h\"\n\nnamespace {\n\/\/ Copied from webkit\/glue\/user_agent.cc. We don't want to pull in a dependency\n\/\/ on webkit\/glue which also pulls in the renderer. Also our user-agent is\n\/\/ totally different from the user-agent used by the browser, just the\n\/\/ OS-specific parts are common.\nstd::string BuildOSCpuInfo() {\n std::string os_cpu;\n\n#if defined(OS_WIN) || defined(OS_MACOSX) || defined(OS_CHROMEOS)\n int32 os_major_version = 0;\n int32 os_minor_version = 0;\n int32 os_bugfix_version = 0;\n base::SysInfo::OperatingSystemVersionNumbers(&os_major_version,\n &os_minor_version,\n &os_bugfix_version);\n#endif\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n \/\/ Should work on any Posix system.\n struct utsname unixinfo;\n uname(&unixinfo);\n\n std::string cputype;\n \/\/ special case for biarch systems\n if (strcmp(unixinfo.machine, \"x86_64\") == 0 &&\n sizeof(void*) == sizeof(int32)) { \/\/ NOLINT\n cputype.assign(\"i686 (x86_64)\");\n } else {\n cputype.assign(unixinfo.machine);\n }\n#endif\n\n base::StringAppendF(\n &os_cpu,\n#if defined(OS_WIN)\n \"Windows NT %d.%d\",\n os_major_version,\n os_minor_version\n#elif defined(OS_MACOSX)\n \"Intel Mac OS X %d_%d_%d\",\n os_major_version,\n os_minor_version,\n os_bugfix_version\n#elif defined(OS_CHROMEOS)\n \"CrOS %s %d.%d.%d\",\n cputype.c_str(), \/\/ e.g. i686\n os_major_version,\n os_minor_version,\n os_bugfix_version\n#else\n \"%s %s\",\n unixinfo.sysname, \/\/ e.g. Linux\n cputype.c_str() \/\/ e.g. i686\n#endif\n ); \/\/ NOLINT\n\n return os_cpu;\n}\n\nstd::string MakeUserAgentForServiceProcess() {\n std::string user_agent;\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n DLOG(ERROR) << \"Unable to create chrome::VersionInfo object\";\n }\n std::string extra_version_info;\n if (!version_info.IsOfficialBuild())\n extra_version_info = \"-devel\";\n base::StringAppendF(&user_agent,\n \"Chrome Service %s(%s)%s %s \",\n version_info.Version().c_str(),\n version_info.LastChange().c_str(),\n extra_version_info.c_str(),\n BuildOSCpuInfo().c_str());\n return user_agent;\n}\n\n} \/\/ namespace\n\nServiceURLRequestContext::ServiceURLRequestContext(\n const std::string& user_agent,\n net::ProxyConfigService* net_proxy_config_service)\n : user_agent_(user_agent),\n ALLOW_THIS_IN_INITIALIZER_LIST(storage_(this)) {\n storage_.set_host_resolver(\n net::CreateSystemHostResolver(net::HostResolver::kDefaultParallelism,\n net::HostResolver::kDefaultRetryAttempts,\n NULL));\n storage_.set_proxy_service(net::ProxyService::CreateUsingSystemProxyResolver(\n net_proxy_config_service, 0u, NULL));\n storage_.set_cert_verifier(net::CertVerifier::CreateDefault());\n storage_.set_ftp_transaction_factory(\n new net::FtpNetworkLayer(host_resolver()));\n storage_.set_ssl_config_service(new net::SSLConfigServiceDefaults);\n storage_.set_http_auth_handler_factory(\n net::HttpAuthHandlerFactory::CreateDefault(host_resolver()));\n storage_.set_http_server_properties(new net::HttpServerPropertiesImpl);\n storage_.set_transport_security_state(new net::TransportSecurityState);\n\n net::HttpNetworkSession::Params session_params;\n session_params.host_resolver = host_resolver();\n session_params.cert_verifier = cert_verifier();\n session_params.proxy_service = proxy_service();\n session_params.ssl_config_service = ssl_config_service();\n session_params.http_auth_handler_factory = http_auth_handler_factory();\n session_params.http_server_properties = http_server_properties();\n scoped_refptr<net::HttpNetworkSession> network_session(\n new net::HttpNetworkSession(session_params));\n storage_.set_http_transaction_factory(\n new net::HttpCache(\n network_session,\n net::HttpCache::DefaultBackend::InMemory(0)));\n \/\/ In-memory cookie store.\n storage_.set_cookie_store(new net::CookieMonster(NULL, NULL));\n set_accept_language(\"en-us,fr\");\n set_accept_charset(\"iso-8859-1,*,utf-8\");\n}\n\nconst std::string& ServiceURLRequestContext::GetUserAgent(\n const GURL& url) const {\n \/\/ If the user agent is set explicitly return that, otherwise call the\n \/\/ base class method to return default value.\n return user_agent_.empty() ?\n net::URLRequestContext::GetUserAgent(url) : user_agent_;\n}\n\nServiceURLRequestContext::~ServiceURLRequestContext() {\n}\n\nServiceURLRequestContextGetter::ServiceURLRequestContextGetter()\n : network_task_runner_(\n g_service_process->io_thread()->message_loop_proxy()) {\n \/\/ Build the default user agent.\n user_agent_ = MakeUserAgentForServiceProcess();\n\n \/\/ TODO(sanjeevr): Change CreateSystemProxyConfigService to accept a\n \/\/ MessageLoopProxy* instead of MessageLoop*.\n DCHECK(g_service_process);\n proxy_config_service_.reset(\n net::ProxyService::CreateSystemProxyConfigService(\n g_service_process->io_thread()->message_loop_proxy(),\n g_service_process->file_thread()->message_loop()));\n}\n\nnet::URLRequestContext*\nServiceURLRequestContextGetter::GetURLRequestContext() {\n if (!url_request_context_.get())\n url_request_context_.reset(\n new ServiceURLRequestContext(user_agent_,\n proxy_config_service_.release()));\n return url_request_context_.get();\n}\n\nscoped_refptr<base::SingleThreadTaskRunner>\nServiceURLRequestContextGetter::GetNetworkTaskRunner() const {\n return network_task_runner_;\n}\n\nServiceURLRequestContextGetter::~ServiceURLRequestContextGetter() {}\n<commit_msg>Bring back service process throttler.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/service\/net\/service_url_request_context.h\"\n\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n#include <sys\/utsname.h>\n#endif\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/message_loop_proxy.h\"\n#include \"base\/stringprintf.h\"\n#include \"base\/sys_info.h\"\n#include \"chrome\/common\/chrome_version_info.h\"\n#include \"chrome\/service\/service_process.h\"\n#include \"net\/base\/cert_verifier.h\"\n#include \"net\/base\/host_resolver.h\"\n#include \"net\/base\/ssl_config_service_defaults.h\"\n#include \"net\/cookies\/cookie_monster.h\"\n#include \"net\/ftp\/ftp_network_layer.h\"\n#include \"net\/http\/http_auth_handler_factory.h\"\n#include \"net\/http\/http_cache.h\"\n#include \"net\/http\/http_network_session.h\"\n#include \"net\/http\/http_server_properties_impl.h\"\n#include \"net\/proxy\/proxy_config_service.h\"\n#include \"net\/proxy\/proxy_service.h\"\n#include \"net\/url_request\/url_request_throttler_manager.h\"\n\nnamespace {\n\/\/ Copied from webkit\/glue\/user_agent.cc. We don't want to pull in a dependency\n\/\/ on webkit\/glue which also pulls in the renderer. Also our user-agent is\n\/\/ totally different from the user-agent used by the browser, just the\n\/\/ OS-specific parts are common.\nstd::string BuildOSCpuInfo() {\n std::string os_cpu;\n\n#if defined(OS_WIN) || defined(OS_MACOSX) || defined(OS_CHROMEOS)\n int32 os_major_version = 0;\n int32 os_minor_version = 0;\n int32 os_bugfix_version = 0;\n base::SysInfo::OperatingSystemVersionNumbers(&os_major_version,\n &os_minor_version,\n &os_bugfix_version);\n#endif\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\n \/\/ Should work on any Posix system.\n struct utsname unixinfo;\n uname(&unixinfo);\n\n std::string cputype;\n \/\/ special case for biarch systems\n if (strcmp(unixinfo.machine, \"x86_64\") == 0 &&\n sizeof(void*) == sizeof(int32)) { \/\/ NOLINT\n cputype.assign(\"i686 (x86_64)\");\n } else {\n cputype.assign(unixinfo.machine);\n }\n#endif\n\n base::StringAppendF(\n &os_cpu,\n#if defined(OS_WIN)\n \"Windows NT %d.%d\",\n os_major_version,\n os_minor_version\n#elif defined(OS_MACOSX)\n \"Intel Mac OS X %d_%d_%d\",\n os_major_version,\n os_minor_version,\n os_bugfix_version\n#elif defined(OS_CHROMEOS)\n \"CrOS %s %d.%d.%d\",\n cputype.c_str(), \/\/ e.g. i686\n os_major_version,\n os_minor_version,\n os_bugfix_version\n#else\n \"%s %s\",\n unixinfo.sysname, \/\/ e.g. Linux\n cputype.c_str() \/\/ e.g. i686\n#endif\n ); \/\/ NOLINT\n\n return os_cpu;\n}\n\nstd::string MakeUserAgentForServiceProcess() {\n std::string user_agent;\n chrome::VersionInfo version_info;\n if (!version_info.is_valid()) {\n DLOG(ERROR) << \"Unable to create chrome::VersionInfo object\";\n }\n std::string extra_version_info;\n if (!version_info.IsOfficialBuild())\n extra_version_info = \"-devel\";\n base::StringAppendF(&user_agent,\n \"Chrome Service %s(%s)%s %s \",\n version_info.Version().c_str(),\n version_info.LastChange().c_str(),\n extra_version_info.c_str(),\n BuildOSCpuInfo().c_str());\n return user_agent;\n}\n\n} \/\/ namespace\n\nServiceURLRequestContext::ServiceURLRequestContext(\n const std::string& user_agent,\n net::ProxyConfigService* net_proxy_config_service)\n : user_agent_(user_agent),\n ALLOW_THIS_IN_INITIALIZER_LIST(storage_(this)) {\n storage_.set_host_resolver(\n net::CreateSystemHostResolver(net::HostResolver::kDefaultParallelism,\n net::HostResolver::kDefaultRetryAttempts,\n NULL));\n storage_.set_proxy_service(net::ProxyService::CreateUsingSystemProxyResolver(\n net_proxy_config_service, 0u, NULL));\n storage_.set_cert_verifier(net::CertVerifier::CreateDefault());\n storage_.set_ftp_transaction_factory(\n new net::FtpNetworkLayer(host_resolver()));\n storage_.set_ssl_config_service(new net::SSLConfigServiceDefaults);\n storage_.set_http_auth_handler_factory(\n net::HttpAuthHandlerFactory::CreateDefault(host_resolver()));\n storage_.set_http_server_properties(new net::HttpServerPropertiesImpl);\n storage_.set_transport_security_state(new net::TransportSecurityState);\n storage_.set_throttler_manager(new net::URLRequestThrottlerManager);\n\n net::HttpNetworkSession::Params session_params;\n session_params.host_resolver = host_resolver();\n session_params.cert_verifier = cert_verifier();\n session_params.proxy_service = proxy_service();\n session_params.ssl_config_service = ssl_config_service();\n session_params.http_auth_handler_factory = http_auth_handler_factory();\n session_params.http_server_properties = http_server_properties();\n scoped_refptr<net::HttpNetworkSession> network_session(\n new net::HttpNetworkSession(session_params));\n storage_.set_http_transaction_factory(\n new net::HttpCache(\n network_session,\n net::HttpCache::DefaultBackend::InMemory(0)));\n \/\/ In-memory cookie store.\n storage_.set_cookie_store(new net::CookieMonster(NULL, NULL));\n set_accept_language(\"en-us,fr\");\n set_accept_charset(\"iso-8859-1,*,utf-8\");\n}\n\nconst std::string& ServiceURLRequestContext::GetUserAgent(\n const GURL& url) const {\n \/\/ If the user agent is set explicitly return that, otherwise call the\n \/\/ base class method to return default value.\n return user_agent_.empty() ?\n net::URLRequestContext::GetUserAgent(url) : user_agent_;\n}\n\nServiceURLRequestContext::~ServiceURLRequestContext() {\n}\n\nServiceURLRequestContextGetter::ServiceURLRequestContextGetter()\n : network_task_runner_(\n g_service_process->io_thread()->message_loop_proxy()) {\n \/\/ Build the default user agent.\n user_agent_ = MakeUserAgentForServiceProcess();\n\n \/\/ TODO(sanjeevr): Change CreateSystemProxyConfigService to accept a\n \/\/ MessageLoopProxy* instead of MessageLoop*.\n DCHECK(g_service_process);\n proxy_config_service_.reset(\n net::ProxyService::CreateSystemProxyConfigService(\n g_service_process->io_thread()->message_loop_proxy(),\n g_service_process->file_thread()->message_loop()));\n}\n\nnet::URLRequestContext*\nServiceURLRequestContextGetter::GetURLRequestContext() {\n if (!url_request_context_.get())\n url_request_context_.reset(\n new ServiceURLRequestContext(user_agent_,\n proxy_config_service_.release()));\n return url_request_context_.get();\n}\n\nscoped_refptr<base::SingleThreadTaskRunner>\nServiceURLRequestContextGetter::GetNetworkTaskRunner() const {\n return network_task_runner_;\n}\n\nServiceURLRequestContextGetter::~ServiceURLRequestContextGetter() {}\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ HTTPFileSystemTest.cc\n\/\/ Test HTTP file system functionality.\n\/\/------------------------------------------------------------------------------\n#include \"Pre.h\"\n#include \"UnitTest++\/src\/UnitTest++.h\"\n#include \"Core\/Core.h\"\n#include \"Core\/RunLoop.h\"\n#include \"HTTP\/HTTPFileSystem.h\"\n#include \"IO\/IO.h\"\n\nusing namespace Oryol;\n\n#if !ORYOL_EMSCRIPTEN\nTEST(HTTPFileSystemTest) {\n Core::Setup();\n\n \/\/ setup an IO facade, and associate http: with the HTTPFileSystem\n IOSetup ioSetup;\n ioSetup.FileSystems.Add(\"http\", HTTPFileSystem::Creator());\n IO::Setup(ioSetup);\n \n \/\/ asynchronously load the index.html file\n Ptr<IORead> req = IO::LoadFile(\"http:\/\/www.flohofwoe.net\/index.html\");\n \n \/\/ trigger the runloop until the request has been handled\n while (!req->Handled) {\n Core::PreRunLoop()->Run();\n }\n \n \/\/ check what we got\n CHECK(req->Status == IOStatus::OK);\n CHECK(!req->Data.Empty());\n CHECK(req->Data.Size() > 0);\n if (req->Data.Size() > 0) {\n String content((const char*)req->Data.Data(), 0, req->Data.Size());\n Log::Info(\"%s\\n\", content.AsCStr());\n }\n req = 0;\n \n IO::Discard();\n Core::Discard();\n}\n#endif\n<commit_msg>Disable HTTPTest if 'headless', seems to hang travis-ci now<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ HTTPFileSystemTest.cc\n\/\/ Test HTTP file system functionality.\n\/\/------------------------------------------------------------------------------\n#include \"Pre.h\"\n#include \"UnitTest++\/src\/UnitTest++.h\"\n#include \"Core\/Core.h\"\n#include \"Core\/RunLoop.h\"\n#include \"HTTP\/HTTPFileSystem.h\"\n#include \"IO\/IO.h\"\n\nusing namespace Oryol;\n\n#if !ORYOL_EMSCRIPTEN && !ORYOL_UNITTESTS_HEADLESS\nTEST(HTTPFileSystemTest) {\n Core::Setup();\n\n \/\/ setup an IO facade, and associate http: with the HTTPFileSystem\n IOSetup ioSetup;\n ioSetup.FileSystems.Add(\"http\", HTTPFileSystem::Creator());\n IO::Setup(ioSetup);\n \n \/\/ asynchronously load the index.html file\n Ptr<IORead> req = IO::LoadFile(\"http:\/\/www.flohofwoe.net\/index.html\");\n \n \/\/ trigger the runloop until the request has been handled\n while (!req->Handled) {\n Core::PreRunLoop()->Run();\n }\n \n \/\/ check what we got\n CHECK(req->Status == IOStatus::OK);\n CHECK(!req->Data.Empty());\n CHECK(req->Data.Size() > 0);\n if (req->Data.Size() > 0) {\n String content((const char*)req->Data.Data(), 0, req->Data.Size());\n Log::Info(\"%s\\n\", content.AsCStr());\n }\n req = 0;\n \n IO::Discard();\n Core::Discard();\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <gl\/glew.h>\n\n#include \"SpriteRenderer.h\"\n#include \"ShaderMgr.h\"\n#include \"ScreenFBO.h\"\n#include \"BlendShader.h\"\n#include \"FBO.h\"\n\n#include \"dataset\/ISprite.h\"\n#include \"dataset\/ISymbol.h\"\n#include \"dataset\/AbstractBV.h\"\n#include \"view\/Camera.h\"\n#include \"render\/LabelNew.h\"\n#include \"render\/PrimitiveDraw.h\"\n#include \"common\/color_config.h\"\n\nnamespace d2d\n{\n\nSpriteRenderer* SpriteRenderer::m_instance = NULL;\n\nSpriteRenderer::SpriteRenderer()\n\t: m_fbo(NULL)\n\t, m_blend_idx(0)\n\t, m_cam(NULL)\n{\n}\n\nSpriteRenderer::~SpriteRenderer()\n{\n\tdelete m_fbo;\n}\n\nvoid SpriteRenderer::Draw(const ISprite* sprite, \n\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t const Colorf& mul, \n\t\t\t\t\t\t const Colorf& add,\n\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t const Colorf& b_trans,\n\t\t\t\t\t\t bool multi_draw) const\n{\n\tif (!sprite->visiable)\n\t\treturn;\n\n\tif (!multi_draw || sprite->GetBlendMode() == BM_NORMAL) {\n\t\tDrawImpl(sprite, mt, mul, add, r_trans, g_trans, b_trans);\n\t} else {\n\t\tif (!m_fbo) {\n\t\t\tInitBlendShader();\n\t\t}\n\n\t\tShaderMgr* mgr = ShaderMgr::Instance();\n\t\tmgr->SetSpriteShader(m_blend_idx);\n\n\t\tDrawImplBlend(sprite);\n\n \t\tmgr->SetSpriteShader(0);\n \t\tmgr->sprite();\n\t\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\t\tmgr->SetFBO(scr_fbo.GetFboID());\n\t}\n}\n\nvoid SpriteRenderer::Draw(const ISymbol* symbol, \n\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t const Vector& pos, \n\t\t\t\t\t\t float angle\/* = 0.0f*\/, \n\t\t\t\t\t\t float xScale\/* = 1.0f*\/, \n\t\t\t\t\t\t float yScale\/* = 1.0f*\/, \n\t\t\t\t\t\t float xShear\/* = 0.0f*\/, \n\t\t\t\t\t\t float yShear\/* = 0.0f*\/, \n\t\t\t\t\t\t const Colorf& mul \/*= Colorf(1,1,1,1)*\/,\n\t\t\t\t\t\t const Colorf& add \/*= Colorf(0,0,0,0)*\/,\n\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t const Colorf& b_trans) const\n{\n\tMatrix t;\n\tt.setTransformation(pos.x, pos.y, angle, xScale, yScale, 0, 0, xShear, yShear);\n\tt = mt * t;\n\tsymbol->Draw(t, mul, add, r_trans, g_trans, b_trans);\n}\n\nvoid SpriteRenderer::DrawName(const std::string& name, float scale, const Matrix& mt) const\n{\n\tif (name.empty() || name[0] == '_') {\n\t\treturn;\n\t}\n\n\tVector pos = Math::transVector(Vector(0, 0), mt);\n\n\tLabelStyle style;\n\tstyle.has_edge = false;\n\tstyle.font_size = 20;\n\tstyle.width = 200;\n\tstyle.height = 50;\n\tstyle.color = Colorf(0, 0, 0);\n\tstyle.align_hori = HAT_CENTER;\n\tstyle.align_vert = VAT_TOP;\n\n\tLabelNew::Print(name.c_str(), pos, scale, style);\n}\n\nvoid SpriteRenderer::DrawImpl(const ISprite* sprite, \n\t\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t\t const Colorf& mul, \n\t\t\t\t\t\t\t const Colorf& add,\n\t\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t\t const Colorf& b_trans) const\n{\n\tMatrix t;\n\tsprite->GetTransMatrix(t);\n\tt = mt * t;\n\n\tColorf _mul = cMul(sprite->multiCol, mul),\n\t\t_add = cAdd(sprite->addCol, add);\n\n\tColorf _r_trans, _g_trans, _b_trans;\n\n\t_r_trans.r = sprite->r_trans.r * r_trans.r + sprite->r_trans.g * g_trans.r + sprite->r_trans.b * b_trans.r;\n\t_r_trans.g = sprite->r_trans.r * r_trans.g + sprite->r_trans.g * g_trans.g + sprite->r_trans.b * b_trans.g;\n\t_r_trans.b = sprite->r_trans.r * r_trans.b + sprite->r_trans.g * g_trans.b + sprite->r_trans.b * b_trans.b;\n\n\t_g_trans.r = sprite->g_trans.r * r_trans.r + sprite->g_trans.g * g_trans.r + sprite->g_trans.b * b_trans.r;\n\t_g_trans.g = sprite->g_trans.r * r_trans.g + sprite->g_trans.g * g_trans.g + sprite->g_trans.b * b_trans.g;\n\t_g_trans.b = sprite->g_trans.r * r_trans.b + sprite->g_trans.g * g_trans.b + sprite->g_trans.b * b_trans.b;\n\n\t_b_trans.r = sprite->b_trans.r * r_trans.r + sprite->b_trans.g * g_trans.r + sprite->b_trans.b * b_trans.r;\n\t_b_trans.g = sprite->b_trans.r * r_trans.g + sprite->b_trans.g * g_trans.g + sprite->b_trans.b * b_trans.g;\n\t_b_trans.b = sprite->b_trans.r * r_trans.b + sprite->b_trans.g * g_trans.b + sprite->b_trans.b * b_trans.b;\n\n\tsprite->GetSymbol().Draw(t, _mul, _add, _r_trans, _g_trans, _b_trans, sprite);\n\n\tif (sprite->IsAnchor()) {\n\t\tstd::vector<Vector> bound;\n\t\tsprite->GetBounding()->getBoundPos(bound);\n\t\tPrimitiveDraw::drawPolyline(bound, BLACK, true, 4);\n\t\tPrimitiveDraw::drawLine(bound[0], bound[2], BLACK, 4);\n\t\tPrimitiveDraw::drawLine(bound[1], bound[3], BLACK, 4);\n\t}\n}\n\nvoid SpriteRenderer::DrawImplBlend(const ISprite* sprite) const\n{\n\/\/\tDrawUnderToTmp(sprite);\n \tDrawSprToTmp(sprite);\n \tDrawTmpToScreen(sprite);\n}\n\nvoid SpriteRenderer::DrawUnderToTmp(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(m_fbo->GetFboID());\n\n\tmgr->SetBlendMode(BM_NORMAL);\n\n\tglClearColor(0, 0, 0, 1);\n\tglClear(GL_COLOR_BUFFER_BIT);\n\n\t\/\/ src \n\tVector src[4];\n\tRect src_rect = sprite->GetRect();\n\tint scr_w = scr_fbo.GetWidth(),\n\t\tscr_h = scr_fbo.GetHeight();\n\tsrc[0] = m_cam->transPosProjectToScreen(Vector(src_rect.xMin, src_rect.yMin), scr_w, scr_h);\n\tsrc[1] = m_cam->transPosProjectToScreen(Vector(src_rect.xMax, src_rect.yMin), scr_w, scr_h);\n\tsrc[2] = m_cam->transPosProjectToScreen(Vector(src_rect.xMax, src_rect.yMax), scr_w, scr_h);\n\tsrc[3] = m_cam->transPosProjectToScreen(Vector(src_rect.xMin, src_rect.yMax), scr_w, scr_h);\n\tfor (int i = 0; i < 4; ++i) {\n\t\tsrc[i].y = scr_h - 1 - src[i].y;\n\t\tsrc[i].x \/= scr_w;\n\t\tsrc[i].y \/= scr_h;\n\t\tsrc[i].x = std::min(std::max(0.0f, src[i].x), 1.0f);\n\t\tsrc[i].y = std::min(std::max(0.0f, src[i].y), 1.0f);\n\t}\n\n\t\/\/ dst\n\tVector dst[4];\n\tRect dst_rect = sprite->GetSymbol().GetSize();\n\tdst[0] = Vector(dst_rect.xMin, dst_rect.yMin);\n\tdst[1] = Vector(dst_rect.xMax, dst_rect.yMin);\n\tdst[2] = Vector(dst_rect.xMax, dst_rect.yMax);\n\tdst[3] = Vector(dst_rect.xMin, dst_rect.yMax);\n\n\tVector offset;\n\tfloat scale;\n\tmgr->GetModelView(offset, scale);\n\n\tmgr->SetModelView(Vector(0, 0), 1);\n\tRect r = sprite->GetSymbol().GetSize();\n\tmgr->SetProjection(r.xLength(), r.yLength());\n\tglViewport(0, 0, r.xLength(), r.yLength());\n\n\tBlendShader* blend_shader = static_cast<BlendShader*>(mgr->GetSpriteShader());\n\tblend_shader->SetBaseTexID(scr_fbo.GetTexID());\n \tblend_shader->DrawBlend(dst, src, src, scr_fbo.GetTexID());\n\n\tmgr->Commit();\n\n\tmgr->SetModelView(offset, scale);\n\tmgr->SetProjection(scr_fbo.GetWidth(), scr_fbo.GetHeight());\n\tglViewport(0, 0, scr_fbo.GetWidth(), scr_fbo.GetHeight());\n}\n\nvoid SpriteRenderer::DrawSprToTmp(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(m_fbo->GetFboID());\n\n\tmgr->SetBlendMode(sprite->GetBlendMode());\n\n\tglClearColor(0, 0, 0, 0);\n\tglClear(GL_COLOR_BUFFER_BIT);\n\n\tVector offset;\n\tfloat scale;\n\tmgr->GetModelView(offset, scale);\n\n\tmgr->SetModelView(Vector(0, 0), 1);\n\tRect r = sprite->GetSymbol().GetSize();\n\tmgr->SetProjection(r.xLength(), r.yLength());\n\tglViewport(0, 0, r.xLength(), r.yLength());\n\n\tBlendShader* blend_shader = static_cast<BlendShader*>(mgr->GetSpriteShader());\n\tblend_shader->SetBaseTexID(scr_fbo.GetTexID());\n\/\/\tblend_shader->SetBaseTexID(m_fbo->GetTexID());\n\n\tsprite->GetSymbol().Draw(Matrix(), sprite->multiCol, sprite->addCol, \n\t\tsprite->r_trans, sprite->g_trans, sprite->b_trans, sprite);\n\n\tmgr->Commit();\n\n\tmgr->SetModelView(offset, scale);\n\tmgr->SetProjection(scr_fbo.GetWidth(), scr_fbo.GetHeight());\n\tglViewport(0, 0, scr_fbo.GetWidth(), scr_fbo.GetHeight());\n}\n\nvoid SpriteRenderer::DrawTmpToScreen(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(0);\n\tmgr->SetFBO(scr_fbo.GetFboID());\n\n\tmgr->SetBlendMode(BM_NORMAL);\n\n\tconst d2d::Rect& r_dst = sprite->GetRect();\n\tfloat xmin = r_dst.xMin, xmax = r_dst.xMax;\n\tfloat ymin = r_dst.yMin, ymax = r_dst.yMax;\n\n\td2d::Rect r_src = sprite->GetSymbol().GetSize();\n\t\/\/ \t\tfloat txmin = r_src.xMin \/ m_fbo->GetWidth() + 0.5f,\n\t\/\/ \t\t\ttxmax = r_src.xMax \/ m_fbo->GetWidth() + 0.5f;\n\t\/\/ \t\tfloat tymin = r_src.yMin \/ m_fbo->GetHeight() + 0.5f,\n\t\/\/ \t\t\ttymax = r_src.yMax \/ m_fbo->GetHeight() + 0.5f;\n\tfloat txmin = 0, txmax = r_src.xLength() \/ m_fbo->GetWidth();\n\tfloat tymin = 0, tymax = r_src.yLength() \/ m_fbo->GetHeight();\n\tif (BlendShader* blend_shader = dynamic_cast<BlendShader*>(mgr->GetSpriteShader()))\n\t{\n\t\tconst float vertices[] = { \n\t\t\txmin, ymin, txmin, tymin, txmin, tymin,\n\t\t\txmin, ymax, txmin, tymax, txmin, tymax,\n\t\t\txmax, ymax, txmax, tymax, txmax, tymax,\n\t\t\txmax, ymin, txmax, tymin, txmax, tymin };\n\t\tblend_shader->DrawBlend(vertices, m_fbo->GetTexID());\n\t}\n\telse\n\t{\n\t\tconst float vertices[] = { \n\t\t\txmin, ymin, txmin, tymin,\n\t\t\txmin, ymax, txmin, tymax,\n\t\t\txmax, ymax, txmax, tymax,\n\t\t\txmax, ymin, txmax, tymin};\n\t\tmgr->Draw(vertices, m_fbo->GetTexID());\n\t}\n\n\tmgr->Commit();\n}\n\nvoid SpriteRenderer::InitBlendShader() const\n{\n\tm_fbo = new FBO(600, 600);\t\n\n\td2d::SpriteShader* blend_shader = new d2d::BlendShader;\n\tblend_shader->Load();\n\tm_blend_idx = ShaderMgr::Instance()->AddSpriteShader(blend_shader);\n}\n\nSpriteRenderer* SpriteRenderer::Instance()\n{\n\tif (!m_instance) {\n\t\tm_instance = new SpriteRenderer();\n\t}\n\treturn m_instance;\n}\n\n} \/\/ d2d<commit_msg>[ADDED] anchor draw<commit_after>#include <gl\/glew.h>\n\n#include \"SpriteRenderer.h\"\n#include \"ShaderMgr.h\"\n#include \"ScreenFBO.h\"\n#include \"BlendShader.h\"\n#include \"FBO.h\"\n\n#include \"dataset\/ISprite.h\"\n#include \"dataset\/ISymbol.h\"\n#include \"dataset\/AbstractBV.h\"\n#include \"view\/Camera.h\"\n#include \"render\/LabelNew.h\"\n#include \"render\/PrimitiveDraw.h\"\n#include \"common\/color_config.h\"\n\nnamespace d2d\n{\n\nSpriteRenderer* SpriteRenderer::m_instance = NULL;\n\nSpriteRenderer::SpriteRenderer()\n\t: m_fbo(NULL)\n\t, m_blend_idx(0)\n\t, m_cam(NULL)\n{\n}\n\nSpriteRenderer::~SpriteRenderer()\n{\n\tdelete m_fbo;\n}\n\nvoid SpriteRenderer::Draw(const ISprite* sprite, \n\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t const Colorf& mul, \n\t\t\t\t\t\t const Colorf& add,\n\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t const Colorf& b_trans,\n\t\t\t\t\t\t bool multi_draw) const\n{\n\tif (!sprite->visiable)\n\t\treturn;\n\n\tif (!multi_draw || sprite->GetBlendMode() == BM_NORMAL) {\n\t\tDrawImpl(sprite, mt, mul, add, r_trans, g_trans, b_trans);\n\t} else {\n\t\tif (!m_fbo) {\n\t\t\tInitBlendShader();\n\t\t}\n\n\t\tShaderMgr* mgr = ShaderMgr::Instance();\n\t\tmgr->SetSpriteShader(m_blend_idx);\n\n\t\tDrawImplBlend(sprite);\n\n \t\tmgr->SetSpriteShader(0);\n \t\tmgr->sprite();\n\t\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\t\tmgr->SetFBO(scr_fbo.GetFboID());\n\t}\n}\n\nvoid SpriteRenderer::Draw(const ISymbol* symbol, \n\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t const Vector& pos, \n\t\t\t\t\t\t float angle\/* = 0.0f*\/, \n\t\t\t\t\t\t float xScale\/* = 1.0f*\/, \n\t\t\t\t\t\t float yScale\/* = 1.0f*\/, \n\t\t\t\t\t\t float xShear\/* = 0.0f*\/, \n\t\t\t\t\t\t float yShear\/* = 0.0f*\/, \n\t\t\t\t\t\t const Colorf& mul \/*= Colorf(1,1,1,1)*\/,\n\t\t\t\t\t\t const Colorf& add \/*= Colorf(0,0,0,0)*\/,\n\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t const Colorf& b_trans) const\n{\n\tMatrix t;\n\tt.setTransformation(pos.x, pos.y, angle, xScale, yScale, 0, 0, xShear, yShear);\n\tt = mt * t;\n\tsymbol->Draw(t, mul, add, r_trans, g_trans, b_trans);\n}\n\nvoid SpriteRenderer::DrawName(const std::string& name, float scale, const Matrix& mt) const\n{\n\tif (name.empty() || name[0] == '_') {\n\t\treturn;\n\t}\n\n\tVector pos = Math::transVector(Vector(0, 0), mt);\n\n\tLabelStyle style;\n\tstyle.has_edge = false;\n\tstyle.font_size = 20;\n\tstyle.width = 200;\n\tstyle.height = 50;\n\tstyle.color = Colorf(0, 0, 0);\n\tstyle.align_hori = HAT_CENTER;\n\tstyle.align_vert = VAT_TOP;\n\n\tLabelNew::Print(name.c_str(), pos, scale, style);\n}\n\nvoid SpriteRenderer::DrawImpl(const ISprite* sprite, \n\t\t\t\t\t\t\t const d2d::Matrix& mt,\n\t\t\t\t\t\t\t const Colorf& mul, \n\t\t\t\t\t\t\t const Colorf& add,\n\t\t\t\t\t\t\t const Colorf& r_trans,\n\t\t\t\t\t\t\t const Colorf& g_trans,\n\t\t\t\t\t\t\t const Colorf& b_trans) const\n{\n\tMatrix t;\n\tsprite->GetTransMatrix(t);\n\tt = mt * t;\n\n\tColorf _mul = cMul(sprite->multiCol, mul),\n\t\t_add = cAdd(sprite->addCol, add);\n\n\tColorf _r_trans, _g_trans, _b_trans;\n\n\t_r_trans.r = sprite->r_trans.r * r_trans.r + sprite->r_trans.g * g_trans.r + sprite->r_trans.b * b_trans.r;\n\t_r_trans.g = sprite->r_trans.r * r_trans.g + sprite->r_trans.g * g_trans.g + sprite->r_trans.b * b_trans.g;\n\t_r_trans.b = sprite->r_trans.r * r_trans.b + sprite->r_trans.g * g_trans.b + sprite->r_trans.b * b_trans.b;\n\n\t_g_trans.r = sprite->g_trans.r * r_trans.r + sprite->g_trans.g * g_trans.r + sprite->g_trans.b * b_trans.r;\n\t_g_trans.g = sprite->g_trans.r * r_trans.g + sprite->g_trans.g * g_trans.g + sprite->g_trans.b * b_trans.g;\n\t_g_trans.b = sprite->g_trans.r * r_trans.b + sprite->g_trans.g * g_trans.b + sprite->g_trans.b * b_trans.b;\n\n\t_b_trans.r = sprite->b_trans.r * r_trans.r + sprite->b_trans.g * g_trans.r + sprite->b_trans.b * b_trans.r;\n\t_b_trans.g = sprite->b_trans.r * r_trans.g + sprite->b_trans.g * g_trans.g + sprite->b_trans.b * b_trans.g;\n\t_b_trans.b = sprite->b_trans.r * r_trans.b + sprite->b_trans.g * g_trans.b + sprite->b_trans.b * b_trans.b;\n\n\tsprite->GetSymbol().Draw(t, _mul, _add, _r_trans, _g_trans, _b_trans, sprite);\n\n\tif (sprite->IsAnchor()) {\n\t\tstd::vector<Vector> bound;\n\t\tsprite->GetBounding()->getBoundPos(bound);\n\t\tfor (int i = 0, n = bound.size(); i < n; ++i) {\n\t\t\tbound[i] = d2d::Math::transVector(bound[i], t);\n\t\t}\n\t\tPrimitiveDraw::drawPolyline(bound, BLACK, true, 4);\n\t\tPrimitiveDraw::drawLine(bound[0], bound[2], BLACK, 4);\n\t\tPrimitiveDraw::drawLine(bound[1], bound[3], BLACK, 4);\n\t}\n}\n\nvoid SpriteRenderer::DrawImplBlend(const ISprite* sprite) const\n{\n\/\/\tDrawUnderToTmp(sprite);\n \tDrawSprToTmp(sprite);\n \tDrawTmpToScreen(sprite);\n}\n\nvoid SpriteRenderer::DrawUnderToTmp(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(m_fbo->GetFboID());\n\n\tmgr->SetBlendMode(BM_NORMAL);\n\n\tglClearColor(0, 0, 0, 1);\n\tglClear(GL_COLOR_BUFFER_BIT);\n\n\t\/\/ src \n\tVector src[4];\n\tRect src_rect = sprite->GetRect();\n\tint scr_w = scr_fbo.GetWidth(),\n\t\tscr_h = scr_fbo.GetHeight();\n\tsrc[0] = m_cam->transPosProjectToScreen(Vector(src_rect.xMin, src_rect.yMin), scr_w, scr_h);\n\tsrc[1] = m_cam->transPosProjectToScreen(Vector(src_rect.xMax, src_rect.yMin), scr_w, scr_h);\n\tsrc[2] = m_cam->transPosProjectToScreen(Vector(src_rect.xMax, src_rect.yMax), scr_w, scr_h);\n\tsrc[3] = m_cam->transPosProjectToScreen(Vector(src_rect.xMin, src_rect.yMax), scr_w, scr_h);\n\tfor (int i = 0; i < 4; ++i) {\n\t\tsrc[i].y = scr_h - 1 - src[i].y;\n\t\tsrc[i].x \/= scr_w;\n\t\tsrc[i].y \/= scr_h;\n\t\tsrc[i].x = std::min(std::max(0.0f, src[i].x), 1.0f);\n\t\tsrc[i].y = std::min(std::max(0.0f, src[i].y), 1.0f);\n\t}\n\n\t\/\/ dst\n\tVector dst[4];\n\tRect dst_rect = sprite->GetSymbol().GetSize();\n\tdst[0] = Vector(dst_rect.xMin, dst_rect.yMin);\n\tdst[1] = Vector(dst_rect.xMax, dst_rect.yMin);\n\tdst[2] = Vector(dst_rect.xMax, dst_rect.yMax);\n\tdst[3] = Vector(dst_rect.xMin, dst_rect.yMax);\n\n\tVector offset;\n\tfloat scale;\n\tmgr->GetModelView(offset, scale);\n\n\tmgr->SetModelView(Vector(0, 0), 1);\n\tRect r = sprite->GetSymbol().GetSize();\n\tmgr->SetProjection(r.xLength(), r.yLength());\n\tglViewport(0, 0, r.xLength(), r.yLength());\n\n\tBlendShader* blend_shader = static_cast<BlendShader*>(mgr->GetSpriteShader());\n\tblend_shader->SetBaseTexID(scr_fbo.GetTexID());\n \tblend_shader->DrawBlend(dst, src, src, scr_fbo.GetTexID());\n\n\tmgr->Commit();\n\n\tmgr->SetModelView(offset, scale);\n\tmgr->SetProjection(scr_fbo.GetWidth(), scr_fbo.GetHeight());\n\tglViewport(0, 0, scr_fbo.GetWidth(), scr_fbo.GetHeight());\n}\n\nvoid SpriteRenderer::DrawSprToTmp(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(m_fbo->GetFboID());\n\n\tmgr->SetBlendMode(sprite->GetBlendMode());\n\n\tglClearColor(0, 0, 0, 0);\n\tglClear(GL_COLOR_BUFFER_BIT);\n\n\tVector offset;\n\tfloat scale;\n\tmgr->GetModelView(offset, scale);\n\n\tmgr->SetModelView(Vector(0, 0), 1);\n\tRect r = sprite->GetSymbol().GetSize();\n\tmgr->SetProjection(r.xLength(), r.yLength());\n\tglViewport(0, 0, r.xLength(), r.yLength());\n\n\tBlendShader* blend_shader = static_cast<BlendShader*>(mgr->GetSpriteShader());\n\tblend_shader->SetBaseTexID(scr_fbo.GetTexID());\n\/\/\tblend_shader->SetBaseTexID(m_fbo->GetTexID());\n\n\tsprite->GetSymbol().Draw(Matrix(), sprite->multiCol, sprite->addCol, \n\t\tsprite->r_trans, sprite->g_trans, sprite->b_trans, sprite);\n\n\tmgr->Commit();\n\n\tmgr->SetModelView(offset, scale);\n\tmgr->SetProjection(scr_fbo.GetWidth(), scr_fbo.GetHeight());\n\tglViewport(0, 0, scr_fbo.GetWidth(), scr_fbo.GetHeight());\n}\n\nvoid SpriteRenderer::DrawTmpToScreen(const ISprite* sprite) const\n{\n\tShaderMgr* mgr = ShaderMgr::Instance();\n\tFBO& scr_fbo = ScreenFBO::Instance()->GetFBO();\n\n\tmgr->sprite();\n\tmgr->SetFBO(0);\n\tmgr->SetFBO(scr_fbo.GetFboID());\n\n\tmgr->SetBlendMode(BM_NORMAL);\n\n\tconst d2d::Rect& r_dst = sprite->GetRect();\n\tfloat xmin = r_dst.xMin, xmax = r_dst.xMax;\n\tfloat ymin = r_dst.yMin, ymax = r_dst.yMax;\n\n\td2d::Rect r_src = sprite->GetSymbol().GetSize();\n\t\/\/ \t\tfloat txmin = r_src.xMin \/ m_fbo->GetWidth() + 0.5f,\n\t\/\/ \t\t\ttxmax = r_src.xMax \/ m_fbo->GetWidth() + 0.5f;\n\t\/\/ \t\tfloat tymin = r_src.yMin \/ m_fbo->GetHeight() + 0.5f,\n\t\/\/ \t\t\ttymax = r_src.yMax \/ m_fbo->GetHeight() + 0.5f;\n\tfloat txmin = 0, txmax = r_src.xLength() \/ m_fbo->GetWidth();\n\tfloat tymin = 0, tymax = r_src.yLength() \/ m_fbo->GetHeight();\n\tif (BlendShader* blend_shader = dynamic_cast<BlendShader*>(mgr->GetSpriteShader()))\n\t{\n\t\tconst float vertices[] = { \n\t\t\txmin, ymin, txmin, tymin, txmin, tymin,\n\t\t\txmin, ymax, txmin, tymax, txmin, tymax,\n\t\t\txmax, ymax, txmax, tymax, txmax, tymax,\n\t\t\txmax, ymin, txmax, tymin, txmax, tymin };\n\t\tblend_shader->DrawBlend(vertices, m_fbo->GetTexID());\n\t}\n\telse\n\t{\n\t\tconst float vertices[] = { \n\t\t\txmin, ymin, txmin, tymin,\n\t\t\txmin, ymax, txmin, tymax,\n\t\t\txmax, ymax, txmax, tymax,\n\t\t\txmax, ymin, txmax, tymin};\n\t\tmgr->Draw(vertices, m_fbo->GetTexID());\n\t}\n\n\tmgr->Commit();\n}\n\nvoid SpriteRenderer::InitBlendShader() const\n{\n\tm_fbo = new FBO(600, 600);\t\n\n\td2d::SpriteShader* blend_shader = new d2d::BlendShader;\n\tblend_shader->Load();\n\tm_blend_idx = ShaderMgr::Instance()->AddSpriteShader(blend_shader);\n}\n\nSpriteRenderer* SpriteRenderer::Instance()\n{\n\tif (!m_instance) {\n\t\tm_instance = new SpriteRenderer();\n\t}\n\treturn m_instance;\n}\n\n} \/\/ d2d<|endoftext|>"} {"text":"<commit_before>\/*\r\n * $Id$\r\n *\r\n * Copyright (c) 2011 Surfnet \r\n * Copyright (c) 2011 .SE (The Internet Infrastructure Foundation).\r\n * Copyright (c) 2011 OpenDNSSEC AB (svb)\r\n * All rights reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without\r\n * modification, are permitted provided that the following conditions\r\n * are met:\r\n * 1. Redistributions of source code must retain the above copyright\r\n * notice, this list of conditions and the following disclaimer.\r\n * 2. Redistributions in binary form must reproduce the above copyright\r\n * notice, this list of conditions and the following disclaimer in the\r\n * documentation and\/or other materials provided with the distribution.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\r\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\r\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\r\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\r\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n *\r\n *\/\r\n\r\n#include <ctime>\r\n#include <iostream>\r\n#include <cassert>\r\n\r\n#include \"enforcer\/update_all_cmd.h\"\r\n#include \"enforcer\/setup_cmd.h\"\r\n#include \"enforcer\/autostart_cmd.h\"\r\n#include \"enforcer\/update_conf_task.h\"\r\n\r\n#include \"shared\/duration.h\"\r\n#include \"shared\/file.h\"\r\n#include \"shared\/str.h\"\r\n#include \"daemon\/engine.h\"\r\n#include \"utils\/kc_helper.h\"\r\n\r\n\r\n#include \"policy\/update_kasp_task.h\"\r\n#include \"policy\/kasp.pb.h\"\r\n\r\n#include \"keystate\/update_keyzones_task.h\"\r\n#include \"keystate\/keystate.pb.h\"\r\n\r\n#include \"hsmkey\/update_hsmkeys_task.h\"\r\n#include \"hsmkey\/hsmkey_gen_task.h\"\r\n#include \"hsmkey\/hsmkey.pb.h\"\r\n\r\n\r\n\r\n\r\nstatic const char *module_str = \"update_all_cmd\";\r\n\r\nvoid help_update_all_cmd(int sockfd)\r\n{\r\n\tods_printf(sockfd,\r\n\t \"update all Perform update kasp, zonelist and repositorylist.\\n\"\r\n\t);\r\n}\r\n\r\nstatic void\r\nflush_all_tasks(int sockfd, engine_type* engine)\r\n{\r\n\tods_log_debug(\"[%s] flushing all tasks...\", module_str);\r\n\tods_printf(sockfd,\"flushing all tasks...\\n\");\r\n\r\n\tods_log_assert(engine);\r\n\tods_log_assert(engine->taskq);\r\n\tlock_basic_lock(&engine->taskq->schedule_lock);\r\n\t\/* [LOCK] schedule *\/\r\n\tschedule_flush(engine->taskq, TASK_NONE);\r\n\t\/* [UNLOCK] schedule *\/\r\n\tlock_basic_unlock(&engine->taskq->schedule_lock);\r\n\tengine_wakeup_workers(engine);\r\n}\r\n\r\nint\r\nhandled_update_all_cmd(int sockfd, engine_type* engine, const char *cmd,\r\n\tssize_t n)\r\n{\r\n\tconst char *scmd = \"update all\";\r\n\tcmd = ods_check_command(cmd,n,scmd);\r\n\tif (!cmd) return 0; \/\/ not handled\r\n\tods_log_debug(\"[%s] %s command\", module_str, scmd);\r\n\r\n\t\/\/ check that we are using a compatible protobuf version.\r\n\tGOOGLE_PROTOBUF_VERIFY_VERSION;\r\n\ttime_t tstart = time(NULL);\r\n\r\n\tautostart(engine);\r\n\r\n\t\/* todo error checking *\/\r\n\r\n\tchar *kasp = NULL;\r\n\tchar *zonelist = NULL;\r\n\tchar **replist = NULL;\r\n\tint repcount, i;\r\n\t\r\n\tint error = 1;\r\n\tif (check_conf(engine->config->cfg_filename, &kasp, \r\n\t\t\t&zonelist, &replist, &repcount, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", \r\n\t\t\tengine->config->cfg_filename);\r\n\telse if (check_kasp(kasp, replist, repcount, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", kasp);\r\n\telse if (check_zonelist(zonelist, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", zonelist);\r\n\telse error = 0;\r\n\t\r\n\tfree(kasp);\r\n\tfree(zonelist);\r\n\tif (replist) {\r\n\t\tfor (i = 0; i < repcount; i++) free(replist[i]);\r\n\t}\r\n\r\n\tif (!error) {\r\n\t\tperform_update_conf(sockfd, engine, cmd, n);\r\n\t\tperform_update_kasp(sockfd, engine->config);\r\n\t\tperform_update_keyzones(sockfd, engine->config);\r\n\t\tperform_update_hsmkeys(sockfd, engine->config, 0 \/* automatic *\/);\r\n\t\tperform_hsmkey_gen(sockfd, engine->config, 0 \/* automatic *\/,\r\n\t\t\t\t\t\t engine->config->automatic_keygen_duration);\r\n\t\tflush_all_tasks(sockfd, engine);\r\n\t}\r\n\tods_printf(sockfd, \"%s completed in %ld seconds.\\n\",scmd,time(NULL)-tstart);\r\n\treturn 1;\r\n}\r\n\r\n\r\n<commit_msg>OPENDNSSEC-321 - forgot to commit<commit_after>\/*\r\n * $Id$\r\n *\r\n * Copyright (c) 2011 Surfnet \r\n * Copyright (c) 2011 .SE (The Internet Infrastructure Foundation).\r\n * Copyright (c) 2011 OpenDNSSEC AB (svb)\r\n * All rights reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without\r\n * modification, are permitted provided that the following conditions\r\n * are met:\r\n * 1. Redistributions of source code must retain the above copyright\r\n * notice, this list of conditions and the following disclaimer.\r\n * 2. Redistributions in binary form must reproduce the above copyright\r\n * notice, this list of conditions and the following disclaimer in the\r\n * documentation and\/or other materials provided with the distribution.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR\r\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r\n * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\r\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE\r\n * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\r\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER\r\n * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\r\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN\r\n * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n *\r\n *\/\r\n\r\n#include <ctime>\r\n#include <iostream>\r\n#include <cassert>\r\n\r\n#include \"enforcer\/update_all_cmd.h\"\r\n#include \"enforcer\/setup_cmd.h\"\r\n#include \"enforcer\/autostart_cmd.h\"\r\n#include \"enforcer\/update_conf_task.h\"\r\n\r\n#include \"shared\/duration.h\"\r\n#include \"shared\/file.h\"\r\n#include \"shared\/str.h\"\r\n#include \"daemon\/engine.h\"\r\n#include \"utils\/kc_helper.h\"\r\n\r\n\r\n#include \"policy\/update_kasp_task.h\"\r\n#include \"policy\/kasp.pb.h\"\r\n\r\n#include \"keystate\/update_keyzones_task.h\"\r\n#include \"keystate\/keystate.pb.h\"\r\n\r\n#include \"hsmkey\/update_hsmkeys_task.h\"\r\n#include \"hsmkey\/hsmkey_gen_task.h\"\r\n#include \"hsmkey\/hsmkey.pb.h\"\r\n\r\n\r\n\r\n\r\nstatic const char *module_str = \"update_all_cmd\";\r\n\r\nvoid help_update_all_cmd(int sockfd)\r\n{\r\n\tods_printf(sockfd,\r\n\t \"update all Perform update kasp, zonelist and repositorylist.\\n\"\r\n\t);\r\n}\r\n\r\nstatic void\r\nflush_all_tasks(int sockfd, engine_type* engine)\r\n{\r\n\tods_log_debug(\"[%s] flushing all tasks...\", module_str);\r\n\tods_printf(sockfd,\"flushing all tasks...\\n\");\r\n\r\n\tods_log_assert(engine);\r\n\tods_log_assert(engine->taskq);\r\n\tlock_basic_lock(&engine->taskq->schedule_lock);\r\n\t\/* [LOCK] schedule *\/\r\n\tschedule_flush(engine->taskq, TASK_NONE);\r\n\t\/* [UNLOCK] schedule *\/\r\n\tlock_basic_unlock(&engine->taskq->schedule_lock);\r\n\tengine_wakeup_workers(engine);\r\n}\r\n\r\nint\r\nhandled_update_all_cmd(int sockfd, engine_type* engine, const char *cmd,\r\n\tssize_t n)\r\n{\r\n\tconst char *scmd = \"update all\";\r\n\tcmd = ods_check_command(cmd,n,scmd);\r\n\tif (!cmd) return 0; \/\/ not handled\r\n\tods_log_debug(\"[%s] %s command\", module_str, scmd);\r\n\r\n\t\/\/ check that we are using a compatible protobuf version.\r\n\tGOOGLE_PROTOBUF_VERIFY_VERSION;\r\n\ttime_t tstart = time(NULL);\r\n\r\n\tautostart(engine);\r\n\r\n\t\/* Check all files for errors. The perform_update_*()\r\n\t * functions check as well but this gives us all or nothing.\r\n\t * Plus we get a complete check of the files mentioned in the \r\n\t * conf which need not be the same as the files in use by the \r\n\t * running enforcer!*\/\r\n\tchar *kasp = NULL;\r\n\tchar *zonelist = NULL;\r\n\tchar **replist = NULL;\r\n\tint repcount, i;\r\n\tint error = 1;\r\n\tif (check_conf(engine->config->cfg_filename, &kasp, \r\n\t\t\t&zonelist, &replist, &repcount, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", \r\n\t\t\tengine->config->cfg_filename);\r\n\telse if (check_kasp(kasp, replist, repcount, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", kasp);\r\n\telse if (check_zonelist(zonelist, 0))\r\n\t\tods_log_error_and_printf(sockfd, module_str, \r\n\t\t\t\"Unable to validate '%s' consistency.\", zonelist);\r\n\telse error = 0;\r\n\t\r\n\tfree(kasp);\r\n\tfree(zonelist);\r\n\tif (replist) {\r\n\t\tfor (i = 0; i < repcount; i++) free(replist[i]);\r\n\t}\r\n\r\n\tif (!error) \r\n\t\terror |= perform_update_conf(sockfd, engine, cmd, n);\r\n\tif (!error) \r\n\t\terror |= perform_update_kasp(sockfd, engine->config);\r\n\tif (!error) \r\n\t\terror |= perform_update_keyzones(sockfd, engine->config);\r\n\tif (!error) {\r\n\t\tperform_update_hsmkeys(sockfd, engine->config, 0 \/* automatic *\/);\r\n\t\tperform_hsmkey_gen(sockfd, engine->config, 0 \/* automatic *\/,\r\n\t\t\t\t\t\t engine->config->automatic_keygen_duration);\r\n\t\tflush_all_tasks(sockfd, engine);\r\n\t}\r\n\tods_printf(sockfd, \"%s completed in %ld seconds.\\n\",scmd,time(NULL)-tstart);\r\n\treturn 1;\r\n}\r\n\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tGUI widget スピン・ボックス・クラス\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2017, 2018 Kunihito Hiramatsu @n\r\n\t\t\t\tReleased under the MIT license @n\r\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/glfw_app\/blob\/master\/LICENSE\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"widgets\/widget_director.hpp\"\r\n#include \"widgets\/widget_utils.hpp\"\r\n\r\nnamespace gui {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\tGUI widget_spinbox クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct widget_spinbox : public widget {\r\n\r\n\t\ttypedef widget_spinbox value_type;\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_spinbox ステート\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tenum class state {\r\n\t\t\tinitial,\/\/\/< 初期化\r\n\t\t\tinc,\t\/\/\/< インクリメント\r\n\t\t\tselect,\t\/\/\/< セレクト\r\n\t\t\tdec,\t\/\/\/< デクリメント\r\n\t\t\tnone\t\/\/\/< 何もしない\r\n\t\t};\r\n\r\n\r\n\t\ttypedef std::function< std::string (state st, int before, int newpos) > select_func_type;\r\n\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_spinbox パラメーター\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tstruct param {\r\n\t\t\tplate_param\t\tplate_param_;\r\n\t\t\tcolor_param\t\tcolor_param_;\t\/\/\/< 頂点カラーで変調する場合のパラメーター\r\n\t\t\ttext_param\t\ttext_param_;\t\/\/\/< テキスト描画のパラメータ\r\n\t\t\tconst img::i_img*\timage_;\t\t\/\/\/< 画像を使う場合\r\n\t\t\tgl::mobj::handle\thandle_;\t\/\/\/< モーションオブジェクトを使う場合\r\n\t\t\tuint32_t\t\t\tid_;\t\t\/\/\/< セレクト ID （押された回数）\r\n\r\n\t\t\tselect_func_type\tselect_func_;\t\/\/\/< 選択関数\r\n\r\n\t\t\tint\t\t\t\t\tmin_pos_;\t\/\/\/< 最低位置\r\n\t\t\tint\t\t\t\t\tsel_pos_;\t\/\/\/< 選択位置\r\n\t\t\tint\t\t\t\t\tmax_pos_;\t\/\/\/< 最大位置\r\n\t\t\tint\t\t\t\t\tpage_step_;\t\/\/\/< ページ移動量\r\n\r\n\t\t\tbool\t\t\t\tscroll_ctrl_;\t\/\/\/< スクロール・コントロール（マウスのダイアル）\r\n\t\t\tbool\t\t\t\taccel_;\t\t\t\/\/\/< ボタンのアクセル・コントロール\r\n\t\t\tuint16_t\t\t\taccel_delay_;\t\/\/\/< アクセルが利くまでの遅延\r\n\t\t\tuint16_t\t\t\taccel_inter_;\t\/\/\/< アクセル時のインターバル（速度）\r\n\r\n\t\t\tparam(int min = 0, int sel = 0, int max = 0) :\r\n\t\t\t\tplate_param_(), color_param_(widget_director::default_spinbox_color_),\r\n\t\t\t\ttext_param_(\"\", img::rgba8(255, 255), img::rgba8(0, 255)),\r\n\t\t\t\timage_(0), handle_(0), id_(0),\r\n\t\t\t\tselect_func_(),\r\n\t\t\t\tmin_pos_(min), sel_pos_(sel), max_pos_(max), page_step_((max - min) \/ 10),\r\n\t\t\t\tscroll_ctrl_(true),\r\n\t\t\t\taccel_(true), accel_delay_(35), accel_inter_(10)\r\n\t\t\t\t{ }\r\n\t\t};\r\n\r\n\tprivate:\r\n\t\twidget_director&\twd_;\r\n\r\n\t\tparam\t\t\t\tparam_;\r\n\r\n\t\tgl::mobj::handle\tobjh_;\r\n\t\tgl::mobj::handle\tup_objh_;\r\n\t\tgl::mobj::handle\tdn_objh_;\r\n\r\n\t\tbool\tinitial_;\r\n\r\n\t\tuint16_t\tdelay_cnt_;\r\n\r\n\r\n\t\tstate get_button_state_(int& d) const\r\n\t\t{\r\n\t\t\tstate st = state::none;\r\n\t\t\tauto x = get_param().in_point_.x;\r\n\t\t\tauto xs = get_rect().size.x;\r\n\t\t\tif(x < (xs \/ 3)) { \/\/ inc\r\n\t\t\t\td = 1;\r\n\t\t\t\tst = state::inc;\r\n\t\t\t} else if(x >= (xs * 2 \/ 3)) { \/\/ dec\r\n\t\t\t\td = -1;\r\n\t\t\t\tst = state::dec;\r\n\t\t\t} else {\r\n\t\t\t\tst = state::select;\r\n\t\t\t}\r\n\t\t\treturn st;\r\n\t\t}\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\twidget_spinbox(widget_director& wd, const widget::param& bp, const param& p) :\r\n\t\t\twidget(bp), wd_(wd), param_(p), objh_(0), up_objh_(0), dn_objh_(0),\r\n\t\t initial_(false), delay_cnt_(0) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tデストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvirtual ~widget_spinbox() { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t型を取得\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\ttype_id type() const override { return get_type_id<value_type>(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget 型の基本名称を取得\r\n\t\t\t@return widget 型の基本名称\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst char* type_name() const override { return \"spinbox\"; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tハイブリッド・ウィジェットのサイン\r\n\t\t\t@return ハイブリッド・ウィジェットの場合「true」を返す。\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool hybrid() const override { return true; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得(ro)\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst param& get_local_param() const { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tparam& at_local_param() { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t選択テキストの取得\r\n\t\t\t@return 選択テキスト\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tstd::string get_select_text() const { return param_.text_param_.get_text(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t選択位置の取得\r\n\t\t\t@return 選択位置\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tuint32_t get_select_pos() const { return param_.sel_pos_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t初期化\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid initialize() override\r\n\t\t{\r\n\t\t\t\/\/ ボタンは標準的に固定、サイズ固定、選択時拡大\r\n\t\t\tat_param().state_.set(widget::state::SERVICE);\r\n\t\t\tat_param().state_.set(widget::state::POSITION_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::SIZE_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::MOVE_STALL);\r\n\t\t\tat_param().action_.set(widget::action::SELECT_SCALE);\r\n\r\n\t\t\tusing namespace img;\r\n\r\n\t\t\tif(param_.handle_) {\r\n\t\t\t\tat_rect().size = wd_.at_mobj().get_size(param_.handle_);\r\n\t\t\t\tobjh_ = param_.handle_;\r\n\t\t\t} else if(param_.image_) {\r\n\t\t\t\tpaint pa;\r\n\t\t\t\tconst vtx::spos& size = get_rect().size;\r\n\t\t\t\tcreate_image_base(param_.image_, size, pa);\r\n\t\t\t\tat_rect().size = pa.get_size();\r\n\t\t\t\tobjh_ = wd_.at_mobj().install(&pa);\r\n\t\t\t} else {\r\n\t\t\t\tvtx::spos size;\r\n\t\t\t\tif(param_.plate_param_.resizeble_) {\r\n\t\t\t\t\tvtx::spos rsz = param_.plate_param_.grid_ * 3;\r\n\t\t\t\t\tif(get_param().rect_.size.x >= rsz.x) size.x = rsz.x;\r\n\t\t\t\t\telse size.x = get_param().rect_.size.x;\r\n\t\t\t\t\tif(get_param().rect_.size.y >= rsz.y) size.y = rsz.y;\r\n\t\t\t\t\telse size.y = get_param().rect_.size.y;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tsize = get_param().rect_.size;\r\n\t\t\t\t}\r\n\t\t\t\tshare_t t;\r\n\t\t\t\tt.size_ = size;\r\n\t\t\t\tt.color_param_ = param_.color_param_;\r\n\t\t\t\tt.plate_param_ = param_.plate_param_;\r\n\t\t\t\tobjh_ = wd_.share_add(t);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tアップデート\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid update() override\r\n\t\t{\r\n\t\t\tif(!initial_ && param_.select_func_ != nullptr) {\r\n\t\t\t\tinitial_ = true;\r\n\t\t\t\tauto t = param_.select_func_(state::initial, param_.sel_pos_, param_.sel_pos_);\r\n\t\t\t\tif(!t.empty()) {\r\n\t\t\t\t\tparam_.text_param_.set_text(t);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tstate st = state::none;\r\n\t\t\tint d = 0;\r\n\t\t\tif(get_selected()) {\r\n\t\t\t\tst = get_button_state_(d);\r\n\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t} else if(get_focus() && param_.scroll_ctrl_) {\r\n\t\t\t\tif(get_select()) {\r\n\t\t\t\t\tst = get_button_state_(d);\r\n\t\t\t\t\tif(st == state::inc || st == state::dec) {\r\n\t\t\t\t\t\t++delay_cnt_;\r\n\t\t\t\t\t\tif(delay_cnt_ >= param_.accel_delay_) {\r\n\t\t\t\t\t\t\tif(delay_cnt_ > param_.accel_inter_) {\r\n\t\t\t\t\t\t\t\tdelay_cnt_ -= param_.accel_inter_;\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tst = state::none;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t\t\tconst vtx::spos& scr = wd_.get_scroll();\r\n\t\t\t\t\tif(scr.y != 0) {\r\n\t\t\t\t\t\td = -scr.y;\r\n\t\t\t\t\t\tif(d > 0) st = state::inc;\r\n\t\t\t\t\t\telse if(d < 0) st = state::dec;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n#if 0\r\n\t\t\tif(get_focus()) {\r\n\t\t\t\tconst utils::lstring& ins = wd_.get_keyboard().input();\r\n\t\t\t\tfor(uint32_t ch : ins) {\r\n\/\/ std::cout << \"Key: \" << ch << std::endl;\r\n\t\t\t\t}\r\n\t\t\t}\r\n#endif\r\n\t\t\tif(st != state::none) {\r\n\t\t\t\tint before = param_.sel_pos_;\r\n\t\t\t\t++param_.id_;\r\n\t\t\t\tif(d > 0) {\r\n\t\t\t\t\tparam_.sel_pos_ += d;\r\n\t\t\t\t\tif(param_.sel_pos_ > param_.max_pos_) param_.sel_pos_ = param_.max_pos_;\r\n\t\t\t\t\tst = state::inc;\r\n\t\t\t\t} else if(d < 0) {\r\n\t\t\t\t\tparam_.sel_pos_ += d;\r\n\t\t\t\t\tif(param_.sel_pos_ < param_.min_pos_) param_.sel_pos_ = param_.min_pos_;\r\n\t\t\t\t\tst = state::dec;\r\n\t\t\t\t}\r\n\t\t\t\tif(param_.select_func_ != nullptr) {\r\n\t\t\t\t\tauto t = param_.select_func_(st, before, param_.sel_pos_);\r\n\t\t\t\t\tif(!t.empty()) {\r\n\t\t\t\t\t\tparam_.text_param_.set_text(t);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tサービス\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid service() override { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tレンダリング\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid render() override\r\n\t\t{\r\n\t\t\tif(objh_ == 0) return;\r\n\r\n\t\t\tusing namespace gl;\r\n\r\n\t\t\tcore& core = core::get_instance();\r\n\t\t\tconst vtx::spos& siz = core.get_rect().size;\r\n\r\n\t\t\tif(param_.plate_param_.resizeble_) {\r\n\t\t\t\twd_.at_mobj().resize(objh_, get_param().rect_.size);\r\n\t\t\t}\r\n\r\n\t\t\trender_text(wd_, objh_, get_param(), param_.text_param_, param_.plate_param_);\r\n\r\n\t\t\t\/\/ チップの描画\r\n\t\t\twd_.at_mobj().setup_matrix(siz.x, siz.y);\r\n\t\t\twd_.set_TSC();\r\n\r\n\t\t\tgl::mobj::handle uph = wd_.get_share_image().up_box_;\r\n\t\t\tgl::mobj::handle dnh = wd_.get_share_image().down_box_;\r\n\t\t\tconst vtx::spos& bs = wd_.at_mobj().get_size(uph);\r\n\t\t\tconst vtx::spos& size = get_rect().size;\r\n\t\t\tshort wf = param_.plate_param_.frame_width_;\r\n\t\t\tshort space = 2;\r\n\t\t\tvtx::spos pos(size.x - bs.x - wf - space, (size.y - bs.y) \/ 2);\r\n\t\t\twd_.at_mobj().draw(dnh, gl::mobj::attribute::normal, pos);\r\n\t\t\tpos.x = wf + space;\r\n\t\t\twd_.at_mobj().draw(uph, gl::mobj::attribute::normal, pos);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のセーブ\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool save(sys::preference& pre) override {\r\n\t\t\tstd::string path;\r\n\t\t\tpath += '\/';\r\n\t\t\tpath += wd_.create_widget_name(this);\r\n\r\n\t\t\tint err = 0;\r\n\t\t\tif(!pre.put_integer(path + \"\/selector\", param_.sel_pos_)) ++err;\r\n\t\t\treturn err == 0;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のロード\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool load(const sys::preference& pre) override {\r\n\t\t\tstd::string path;\r\n\t\t\tpath += '\/';\r\n\t\t\tpath += wd_.create_widget_name(this);\r\n\r\n\t\t\tint err = 0;\r\n\t\t\tif(!pre.get_integer(path + \"\/selector\", param_.sel_pos_)) ++err;\r\n\t\t\treturn err == 0;\r\n\t\t}\r\n\t};\r\n\r\n}\r\n<commit_msg>update: page key<commit_after>#pragma once\r\n\/\/=====================================================================\/\/\r\n\/*!\t@file\r\n\t@brief\tGUI widget スピン・ボックス・クラス\r\n @author 平松邦仁 (hira@rvf-rc45.net)\r\n\t@copyright\tCopyright (C) 2017, 2018 Kunihito Hiramatsu @n\r\n\t\t\t\tReleased under the MIT license @n\r\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/glfw_app\/blob\/master\/LICENSE\r\n*\/\r\n\/\/=====================================================================\/\/\r\n#include \"widgets\/widget_director.hpp\"\r\n#include \"widgets\/widget_utils.hpp\"\r\n\r\nnamespace gui {\r\n\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\/*!\r\n\t\t@brief\tGUI widget_spinbox クラス\r\n\t*\/\r\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\tstruct widget_spinbox : public widget {\r\n\r\n\t\ttypedef widget_spinbox value_type;\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_spinbox ステート\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tenum class state {\r\n\t\t\tinitial,\/\/\/< 初期化\r\n\t\t\tinc,\t\/\/\/< インクリメント\r\n\t\t\tselect,\t\/\/\/< セレクト\r\n\t\t\tdec,\t\/\/\/< デクリメント\r\n\t\t\tnone\t\/\/\/< 何もしない\r\n\t\t};\r\n\r\n\r\n\t\ttypedef std::function< std::string (state st, int before, int newpos) > select_func_type;\r\n\r\n\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget_spinbox パラメーター\r\n\t\t*\/\r\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\r\n\t\tstruct param {\r\n\t\t\tplate_param\t\tplate_param_;\r\n\t\t\tcolor_param\t\tcolor_param_;\t\/\/\/< 頂点カラーで変調する場合のパラメーター\r\n\t\t\ttext_param\t\ttext_param_;\t\/\/\/< テキスト描画のパラメータ\r\n\t\t\tconst img::i_img*\timage_;\t\t\/\/\/< 画像を使う場合\r\n\t\t\tgl::mobj::handle\thandle_;\t\/\/\/< モーションオブジェクトを使う場合\r\n\t\t\tuint32_t\t\t\tid_;\t\t\/\/\/< セレクト ID （押された回数）\r\n\r\n\t\t\tselect_func_type\tselect_func_;\t\/\/\/< 選択関数\r\n\r\n\t\t\tint\t\t\t\t\tmin_pos_;\t\/\/\/< 最低位置\r\n\t\t\tint\t\t\t\t\tsel_pos_;\t\/\/\/< 選択位置\r\n\t\t\tint\t\t\t\t\tmax_pos_;\t\/\/\/< 最大位置\r\n\t\t\tint\t\t\t\t\tpage_div_;\t\/\/\/< ページ移動分割数\r\n\t\t\tint\t\t\t\t\tpage_step_;\t\/\/\/< ページ移動数(page_div_ が０の場合）\r\n\r\n\t\t\tbool\t\t\t\tscroll_ctrl_;\t\/\/\/< スクロール・コントロール（マウスのダイアル）\r\n\t\t\tbool\t\t\t\taccel_;\t\t\t\/\/\/< ボタンのアクセル・コントロール\r\n\t\t\tuint16_t\t\t\taccel_delay_;\t\/\/\/< アクセルが利くまでの遅延\r\n\t\t\tuint16_t\t\t\taccel_inter_;\t\/\/\/< アクセル時のインターバル（速度）\r\n\r\n\t\t\tparam(int min = 0, int sel = 0, int max = 0) :\r\n\t\t\t\tplate_param_(), color_param_(widget_director::default_spinbox_color_),\r\n\t\t\t\ttext_param_(\"\", img::rgba8(255, 255), img::rgba8(0, 255)),\r\n\t\t\t\timage_(0), handle_(0), id_(0),\r\n\t\t\t\tselect_func_(),\r\n\t\t\t\tmin_pos_(min), sel_pos_(sel), max_pos_(max),\r\n\t\t\t\tpage_div_(0), page_step_((max - min) \/ 10),\r\n\t\t\t\tscroll_ctrl_(true),\r\n\t\t\t\taccel_(true), accel_delay_(35), accel_inter_(10)\r\n\t\t\t\t{ }\r\n\t\t};\r\n\r\n\tprivate:\r\n\t\twidget_director&\twd_;\r\n\r\n\t\tparam\t\t\t\tparam_;\r\n\r\n\t\tgl::mobj::handle\tobjh_;\r\n\t\tgl::mobj::handle\tup_objh_;\r\n\t\tgl::mobj::handle\tdn_objh_;\r\n\r\n\t\tbool\t\tinitial_;\r\n\r\n\t\tuint16_t\tdelay_cnt_;\r\n\r\n\t\tint\t\t\tsel_pos_;\r\n\r\n\t\tstate get_button_state_(int& d) const\r\n\t\t{\r\n\t\t\tstate st = state::none;\r\n\t\t\tauto x = get_param().in_point_.x;\r\n\t\t\tauto xs = get_rect().size.x;\r\n\t\t\tif(x < (xs \/ 3)) { \/\/ inc\r\n\t\t\t\td = 1;\r\n\t\t\t\tst = state::inc;\r\n\t\t\t} else if(x >= (xs * 2 \/ 3)) { \/\/ dec\r\n\t\t\t\td = -1;\r\n\t\t\t\tst = state::dec;\r\n\t\t\t} else {\r\n\t\t\t\tst = state::select;\r\n\t\t\t}\r\n\t\t\treturn st;\r\n\t\t}\r\n\r\n\tpublic:\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tコンストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\twidget_spinbox(widget_director& wd, const widget::param& bp, const param& p) :\r\n\t\t\twidget(bp), wd_(wd), param_(p), objh_(0), up_objh_(0), dn_objh_(0),\r\n\t\t initial_(false), delay_cnt_(0), sel_pos_(0) { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tデストラクター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvirtual ~widget_spinbox() { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t型を取得\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\ttype_id type() const override { return get_type_id<value_type>(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\twidget 型の基本名称を取得\r\n\t\t\t@return widget 型の基本名称\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst char* type_name() const override { return \"spinbox\"; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tハイブリッド・ウィジェットのサイン\r\n\t\t\t@return ハイブリッド・ウィジェットの場合「true」を返す。\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool hybrid() const override { return true; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得(ro)\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tconst param& get_local_param() const { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t個別パラメーターへの取得\r\n\t\t\t@return 個別パラメーター\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tparam& at_local_param() { return param_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t選択テキストの取得\r\n\t\t\t@return 選択テキスト\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tstd::string get_select_text() const { return param_.text_param_.get_text(); }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t選択位置の取得\r\n\t\t\t@return 選択位置\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tint get_select_pos() const { return param_.sel_pos_; }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t選択位置の設定\r\n\t\t\t@param[in]\tpos\t設定位置\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid set_select_pos(int pos) {\r\n\t\t\tif(param_.min_pos_ <= pos && pos <= param_.max_pos_) { \r\n\t\t\t\tparam_.sel_pos_ = pos;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t初期化\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid initialize() override\r\n\t\t{\r\n\t\t\t\/\/ ボタンは標準的に固定、サイズ固定、選択時拡大\r\n\t\t\tat_param().state_.set(widget::state::SERVICE);\r\n\t\t\tat_param().state_.set(widget::state::POSITION_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::SIZE_LOCK);\r\n\t\t\tat_param().state_.set(widget::state::MOVE_STALL);\r\n\t\t\tat_param().action_.set(widget::action::SELECT_SCALE);\r\n\r\n\t\t\tusing namespace img;\r\n\r\n\t\t\tif(param_.handle_) {\r\n\t\t\t\tat_rect().size = wd_.at_mobj().get_size(param_.handle_);\r\n\t\t\t\tobjh_ = param_.handle_;\r\n\t\t\t} else if(param_.image_) {\r\n\t\t\t\tpaint pa;\r\n\t\t\t\tconst vtx::spos& size = get_rect().size;\r\n\t\t\t\tcreate_image_base(param_.image_, size, pa);\r\n\t\t\t\tat_rect().size = pa.get_size();\r\n\t\t\t\tobjh_ = wd_.at_mobj().install(&pa);\r\n\t\t\t} else {\r\n\t\t\t\tvtx::spos size;\r\n\t\t\t\tif(param_.plate_param_.resizeble_) {\r\n\t\t\t\t\tvtx::spos rsz = param_.plate_param_.grid_ * 3;\r\n\t\t\t\t\tif(get_param().rect_.size.x >= rsz.x) size.x = rsz.x;\r\n\t\t\t\t\telse size.x = get_param().rect_.size.x;\r\n\t\t\t\t\tif(get_param().rect_.size.y >= rsz.y) size.y = rsz.y;\r\n\t\t\t\t\telse size.y = get_param().rect_.size.y;\r\n\t\t\t\t} else {\r\n\t\t\t\t\tsize = get_param().rect_.size;\r\n\t\t\t\t}\r\n\t\t\t\tshare_t t;\r\n\t\t\t\tt.size_ = size;\r\n\t\t\t\tt.color_param_ = param_.color_param_;\r\n\t\t\t\tt.plate_param_ = param_.plate_param_;\r\n\t\t\t\tobjh_ = wd_.share_add(t);\r\n\t\t\t}\r\n\r\n\t\t\tsel_pos_ = param_.sel_pos_;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tアップデート\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid update() override\r\n\t\t{\r\n\t\t\tif(!initial_ && param_.select_func_ != nullptr) {\r\n\t\t\t\tinitial_ = true;\r\n\t\t\t\tauto t = param_.select_func_(state::initial, param_.sel_pos_, param_.sel_pos_);\r\n\t\t\t\tif(!t.empty()) {\r\n\t\t\t\t\tparam_.text_param_.set_text(t);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tstate st = state::none;\r\n\t\t\tint d = 0;\r\n\t\t\tif(get_selected()) {\r\n\t\t\t\tst = get_button_state_(d);\r\n\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t} else if(get_focus() && param_.scroll_ctrl_) {\r\n\t\t\t\tif(get_select()) {\r\n\t\t\t\t\tst = get_button_state_(d);\r\n\t\t\t\t\tif(st == state::inc || st == state::dec) {\r\n\t\t\t\t\t\t++delay_cnt_;\r\n\t\t\t\t\t\tif(delay_cnt_ >= param_.accel_delay_) {\r\n\t\t\t\t\t\t\tif(delay_cnt_ > param_.accel_inter_) {\r\n\t\t\t\t\t\t\t\tdelay_cnt_ -= param_.accel_inter_;\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\tst = state::none;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t} else {\r\n\t\t\t\t\tdelay_cnt_ = 0;\r\n\t\t\t\t\tconst vtx::spos& scr = wd_.get_scroll();\r\n\t\t\t\t\tif(scr.y != 0) {\r\n\t\t\t\t\t\td = -scr.y;\r\n\t\t\t\t\t\tif(d > 0) st = state::inc;\r\n\t\t\t\t\t\telse if(d < 0) st = state::dec;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(get_focus()) {\r\n\t\t\t\tgl::core& core = gl::core::get_instance();\r\n\t\t\t\tconst gl::device& dev = core.get_device();\r\n\t\t\t\tint step = param_.page_step_;\r\n\t\t\t\tif(param_.page_div_ != 0) {\r\n\t\t\t\t\tstep = (param_.max_pos_ - param_.min_pos_) \/ param_.page_div_;\r\n\t\t\t\t}\r\n\t\t\t\tif(dev.get_positive(gl::device::key::PAGE_UP)) {\r\n\t\t\t\t\td = step;\r\n\t\t\t\t\tst = state::inc;\r\n\t\t\t\t} else if(dev.get_positive(gl::device::key::PAGE_DOWN)) {\r\n\t\t\t\t\td = -step;\r\n\t\t\t\t\tst = state::dec;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tif(st != state::none || sel_pos_ != param_.sel_pos_) {\r\n\t\t\t\t++param_.id_;\r\n\t\t\t\tif(d > 0) {\r\n\t\t\t\t\tparam_.sel_pos_ += d;\r\n\t\t\t\t\tif(param_.sel_pos_ > param_.max_pos_) param_.sel_pos_ = param_.max_pos_;\r\n\t\t\t\t\tst = state::inc;\r\n\t\t\t\t} else if(d < 0) {\r\n\t\t\t\t\tparam_.sel_pos_ += d;\r\n\t\t\t\t\tif(param_.sel_pos_ < param_.min_pos_) param_.sel_pos_ = param_.min_pos_;\r\n\t\t\t\t\tst = state::dec;\r\n\t\t\t\t}\r\n\t\t\t\tif(param_.select_func_ != nullptr) {\r\n\t\t\t\t\tauto t = param_.select_func_(st, sel_pos_, param_.sel_pos_);\r\n\t\t\t\t\tif(!t.empty()) {\r\n\t\t\t\t\t\tparam_.text_param_.set_text(t);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tsel_pos_ = param_.sel_pos_;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tサービス\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid service() override { }\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\tレンダリング\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tvoid render() override\r\n\t\t{\r\n\t\t\tif(objh_ == 0) return;\r\n\r\n\t\t\tusing namespace gl;\r\n\r\n\t\t\tcore& core = core::get_instance();\r\n\t\t\tconst vtx::spos& siz = core.get_rect().size;\r\n\r\n\t\t\tif(param_.plate_param_.resizeble_) {\r\n\t\t\t\twd_.at_mobj().resize(objh_, get_param().rect_.size);\r\n\t\t\t}\r\n\r\n\t\t\trender_text(wd_, objh_, get_param(), param_.text_param_, param_.plate_param_);\r\n\r\n\t\t\t\/\/ チップの描画\r\n\t\t\twd_.at_mobj().setup_matrix(siz.x, siz.y);\r\n\t\t\twd_.set_TSC();\r\n\r\n\t\t\tgl::mobj::handle uph = wd_.get_share_image().up_box_;\r\n\t\t\tgl::mobj::handle dnh = wd_.get_share_image().down_box_;\r\n\t\t\tconst vtx::spos& bs = wd_.at_mobj().get_size(uph);\r\n\t\t\tconst vtx::spos& size = get_rect().size;\r\n\t\t\tshort wf = param_.plate_param_.frame_width_;\r\n\t\t\tshort space = 2;\r\n\t\t\tvtx::spos pos(size.x - bs.x - wf - space, (size.y - bs.y) \/ 2);\r\n\t\t\twd_.at_mobj().draw(dnh, gl::mobj::attribute::normal, pos);\r\n\t\t\tpos.x = wf + space;\r\n\t\t\twd_.at_mobj().draw(uph, gl::mobj::attribute::normal, pos);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のセーブ\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool save(sys::preference& pre) override {\r\n\t\t\tstd::string path;\r\n\t\t\tpath += '\/';\r\n\t\t\tpath += wd_.create_widget_name(this);\r\n\r\n\t\t\tint err = 0;\r\n\t\t\tif(!pre.put_integer(path + \"\/selector\", param_.sel_pos_)) ++err;\r\n\t\t\treturn err == 0;\r\n\t\t}\r\n\r\n\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\t\/*!\r\n\t\t\t@brief\t状態のロード\r\n\t\t\t@param[in]\tpre\tプリファレンス参照\r\n\t\t\t@return エラーが無い場合「true」\r\n\t\t*\/\r\n\t\t\/\/-----------------------------------------------------------------\/\/\r\n\t\tbool load(const sys::preference& pre) override {\r\n\t\t\tstd::string path;\r\n\t\t\tpath += '\/';\r\n\t\t\tpath += wd_.create_widget_name(this);\r\n\r\n\t\t\tint err = 0;\r\n\t\t\tif(!pre.get_integer(path + \"\/selector\", param_.sel_pos_)) ++err;\r\n\t\t\treturn err == 0;\r\n\t\t}\r\n\t};\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ OptimalLinkList.cpp\n\/\/ DataStruct\n\/\/\n\/\/ Created by guyuexing on 2017\/5\/22.\n\/\/ Copyright © 2017年 neu. All rights reserved.\n\/\/\n\n#include \"OptimalLinkList.hpp\"\n\n\/\/分配由p指向的值为e的结点，并返回OK，若分配失败，则返回error\nStatus MakeNode(Link &p, ElemType e){\n p = (Link)malloc(sizeof(LNode));\n if (!p) {\n return ERROR;\n }\n p->data = e;\n return OK;\n}\n\n\/\/释放p所指结点\nvoid FreeNode(Link &p){\n free(p);\n p = NULL;\n}\n\n\/\/构造一个空的线性链表L\nStatus InitList(LinkList &L){\n \/\/生成头结点\n Link p = (Link)malloc(sizeof(LNode));\n if (!p) {\n return ERROR;\n }\n p->data = NULL;\n p->next = NULL;\n L.header = L.tail = p;\n L.len = 0;\n return OK;\n}\n\n\/\/清空线性链表L，并释放原链表的结点空间\nStatus ClearList(LinkList &L){\n \/\/如果不是空表\n if (L.header!=L.tail) {\n Link p,q;\n \/\/p，q均指向链表的第一个结点\n p = q = L.header->next;\n \/\/将链表L的第一个结点置为空\n L.header->next = NULL;\n while (p!=L.tail) {\n q = p->next;\n free(p);\n p = q;\n }\n \/\/释放最后一个结点\n free(L.tail);\n \/\/头结点和尾结点均指向头结点\n L.tail = L.header;\n L.len = 0;\n }\n return OK;\n}\n\n\/\/销毁线性链表L\nStatus DestoryList(LinkList &L){\n ClearList(L);\n FreeNode(L.header);\n L.tail = NULL;\n L.len = 0;\n return OK;\n}\n\n\/\/已知h指向线性链表的头结点，将s所指结点插入在原第一个结点之前（即s成为第一个结点）\nStatus InsFirst(LinkList &L, Link s, Link h){\n \/\/p指向原来的第一个节点\n Link p = h->next;\n h->next = s;\n s->next = p;\n if (h == L.tail) { \/\/说明原链表为空表，头指针和尾指针均指向头结点；如果不相等，即使插入结点（只要不是插到链表尾部），也不需要移动尾指针\n L.tail = h->next;\n }\n L.len++;\n return OK;\n}\n\n\/\/已知h指向线性链表的头结点，删除链表中的第一个结点并以q返回\nStatus DelFirst(LinkList &L, Link h, Link &q){\n q = h->next;\n \/\/如果q存在，即链表非空\n if (q) {\n h->next = q->next;\n \/\/即删除第一个结点之后判断表是否为空\n if (!h->next) {\n \/\/如果表为空，修改尾指针\n L.tail = h;\n }\n L.len--;\n return OK;\n }else{\n return FALSE;\n }\n}\n\n\/\/将指针s(s->data为第一个数据元素)所指(彼此以指针相链接，以NULL结尾)的一串结点链接在链表L的最后一个结点之后，并改变链表L的尾指针指向新的尾结点\nStatus Append(LinkList &L, Link s){\n Link p = s;\n int i = 1;\n \/\/这段循环目的是为了找到s的最后一个结点\n while (p->next) {\n i++;\n p = p->next;\n }\n L.tail->next = s;\n \/\/L的尾结点指向s的最后一个结点\n L.tail = p;\n L.len += i;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个结点，返回p所指结点的直接前驱的位置，若无前驱，则返回NULL\nPosition PriorPos(LinkList L, Link p){\n \/\/如果p是链表L的第一个节点，无前驱\n if (p==L.header->next) {\n return NULL;\n }\n Link q = L.header->next;\n while (q->next!=L.tail) {\n if (q->next == p) {\n return q;\n }\n q = q->next;\n }\n return NULL;\n}\n\n\/\/删除线性表L中的尾结点并以q返回，改变链表L的尾指针指向新的尾结点\nStatus Remove(LinkList &L, Link &q){\n \/\/如果L为空表\n if (L.len == 0) {\n q = NULL;\n return FALSE;\n }\n \/\/p指向L的第一个结点\n Link p = L.header->next;\n \/\/for循环找到链表L尾结点的前一个结点\n while (p->next!=L.tail) {\n p = p->next;\n }\n q = L.tail;\n p->next = NULL;\n L.tail = p;\n L.len--;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个节点，将s所指节点插入在p所指节点之前，并修改指针p指向新插入的结点\nStatus InsBefore(LinkList &L, Link &p, Link s){\n \/\/q是p节点的前驱\n Link q = PriorPos(L, p);\n \/\/如果p节点没有前驱，则q指向链表L的头结点\n if (!q) {\n q = L.header;\n }\n \/\/插入s节点\n q->next = s;\n s->next = p;\n p = s;\n L.len++;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个结点，将s所指结点插入在p所指节点之后，并修改指针p指向新插入的结点\nStatus InsAfter(LinkList &L, Link &p, Link s){\n s->next = p->next;\n p->next = s;\n if (p==L.tail) { \/\/修改尾指针\n L.tail = s;\n }\n p = s;\n L.len++;\n return OK;\n}\n\n\/\/已知p指向线性链表的一个结点，用e更新p指向结点的数据元素的值\nStatus SetCurElem(Link p, ElemType e){\n p->data = e;\n return OK;\n}\n\n\/\/已知p指向线性链表的一个结点，返回结点的数据元素的值\nElemType GetCurElem(Link p){\n return p->data;\n}\n\n\/\/若线性链表为空表返回True，否则返回False\nStatus ListEmpty(LinkList L){\n if (!L.len) {\n return TRUE;\n }else{\n return FALSE;\n }\n}\n\n\/\/返回线性链表的元素个数\nint ListLength(LinkList L){\n return L.len;\n}\n\n\/\/返回线性链表头结点的位置\nPosition GetHeader(LinkList L){\n return L.header;\n}\n\n\/\/返回线性链表最后一个结点的位置\nPosition GetLast(LinkList L){\n return L.tail;\n}\n\n\/\/已知p指向线性链表中的一个结点，返回p所指向结点的直接后继，若无直接后继，则返回NULL\nPosition NextPos(Link p){\n return p->next;\n}\n\n\/\/用p返回线性链表L中第i个结点的位置，并返回OK，如果i值不合法则返回error\nStatus LocatePos(LinkList L, int i, Link &p){\n if (i<1 || i>ListLength(L)) {\n return ERROR;\n }\n Link q = L.header;\n int j = 0;\n while (j<i && q!=NULL) {\n j++;\n q = q->next;\n }\n if (j>i || j>ListLength(L)) {\n return ERROR;\n }\n p = q;\n return OK;\n}\n\n\/\/返回线性链表L中第一个与e满足compare判定关系的结点的位置，若不存在这样的元素，则返回NULL\nPosition LocateElem(LinkList L, ElemType e, Status (*compare)(ElemType e1, ElemType e2)){\n Link p = L.header->next;\n while (p!=NULL) {\n if (compare(p->data,e)) {\n return p;\n }\n p = p->next;\n }\n return NULL;\n}\n\n\/\/依次对L中的每个调用数据元素调用visit函数。一旦visit失败，则操作失败\nStatus ListTraverse(LinkList L, void (*visit)(ElemType e)){\n Link p = L.header->next;\n while (p!=NULL) {\n visit(p->data);\n p = p->next;\n }\n printf(\"\\n\");\n return OK;\n}\n\n\/\/已知L为有序线性链表，将e元素按非降序插入在L中（用于一元多项式）\nStatus OrderInsert(LinkList &L, ElemType e, Status (*compare)(ElemType, ElemType)){\n Link p = L.header->next;\n Link q = L.header; \/\/q用来表示p的前驱\n while (p!=NULL) { \/\/之所以用p!=NULL作为循环结束条件，是为了让e能与链表L的最后一个结点元素值做比较\n \n \/\/比较p指向结点的数据与e的大小，当p->data第一次大于等于e时，e即插入在p的前驱和p之间\n if (compare(p->data,e)>=0) {\n break;\n }\n q = p;\n p = p->next;\n }\n Link s = (Link)malloc(sizeof(LNode));\n s->data = e;\n q->next = s;\n s->next = p;\n \/\/如果p等于NULL说明遍历到最后也没有找到比e大的值，因此e所在结点是表尾，修改表尾指针\n if (p==NULL) {\n L.tail = s;\n }\n L.len++;\n return OK;\n}\n\n\/\/若升序链表L中存在与e满足判定函数compare取值为0的元素，则p返回L中第一个值为e的结点的位置，并返回true；否则p指示第一个与e满足判定函数compare>0的元素的前驱的位置，并返回false（用于一元多项式）\nStatus LocatElem(LinkList L, ElemType e, Position &p, int(*compare)(ElemType, ElemType)){\n\/\/ Link q = L.header->next;\n\/\/ Link s = L.header;\n\/\/ while (!q) {\n\/\/ if (compare(q->data,e)==0) {\n\/\/ p = q;\n\/\/ return OK;\n\/\/ }else if (compare(q->data,e)>0){\n\/\/ p = s;\n\/\/ return FALSE;\n\/\/ }\n\/\/ s = q;\n\/\/ q = q->next;\n\/\/ }\n Link q = L.header;\n Link s;\n do {\n s = q;\n q = q->next;\n } while (q && compare(q->data,e)<0); \/\/循环结束后q可能到了表尾，也可能是compare(q->data,e)>=0\n if (!q||compare(q->data,e)>0) {\n p = s;\n return FALSE;\n }else{\n p = q;\n return TRUE;\n }\n}\n\n<commit_msg>fix bug，能循环遍历到最后一个数据元素<commit_after>\/\/\n\/\/ OptimalLinkList.cpp\n\/\/ DataStruct\n\/\/\n\/\/ Created by guyuexing on 2017\/5\/22.\n\/\/ Copyright © 2017年 neu. All rights reserved.\n\/\/\n\n#include \"OptimalLinkList.hpp\"\n\n\/\/分配由p指向的值为e的结点，并返回OK，若分配失败，则返回error\nStatus MakeNode(Link &p, ElemType e){\n p = (Link)malloc(sizeof(LNode));\n if (!p) {\n return ERROR;\n }\n p->data = e;\n return OK;\n}\n\n\/\/释放p所指结点\nvoid FreeNode(Link &p){\n free(p);\n p = NULL;\n}\n\n\/\/构造一个空的线性链表L\nStatus InitList(LinkList &L){\n \/\/生成头结点\n Link p = (Link)malloc(sizeof(LNode));\n if (!p) {\n return ERROR;\n }\n p->data = NULL;\n p->next = NULL;\n L.header = L.tail = p;\n L.len = 0;\n return OK;\n}\n\n\/\/清空线性链表L，并释放原链表的结点空间\nStatus ClearList(LinkList &L){\n \/\/如果不是空表\n if (L.header!=L.tail) {\n Link p,q;\n \/\/p，q均指向链表的第一个结点\n p = q = L.header->next;\n \/\/将链表L的第一个结点置为空\n L.header->next = NULL;\n while (p!=L.tail) {\n q = p->next;\n free(p);\n p = q;\n }\n \/\/释放最后一个结点\n free(L.tail);\n \/\/头结点和尾结点均指向头结点\n L.tail = L.header;\n L.len = 0;\n }\n return OK;\n}\n\n\/\/销毁线性链表L\nStatus DestoryList(LinkList &L){\n ClearList(L);\n FreeNode(L.header);\n L.tail = NULL;\n L.len = 0;\n return OK;\n}\n\n\/\/已知h指向线性链表的头结点，将s所指结点插入在原第一个结点之前（即s成为第一个结点）\nStatus InsFirst(LinkList &L, Link s, Link h){\n \/\/p指向原来的第一个节点\n Link p = h->next;\n h->next = s;\n s->next = p;\n if (h == L.tail) { \/\/说明原链表为空表，头指针和尾指针均指向头结点；如果不相等，即使插入结点（只要不是插到链表尾部），也不需要移动尾指针\n L.tail = h->next;\n }\n L.len++;\n return OK;\n}\n\n\/\/已知h指向线性链表的头结点，删除链表中的第一个结点并以q返回\nStatus DelFirst(LinkList &L, Link h, Link &q){\n q = h->next;\n \/\/如果q存在，即链表非空\n if (q) {\n h->next = q->next;\n \/\/即删除第一个结点之后判断表是否为空\n if (!h->next) {\n \/\/如果表为空，修改尾指针\n L.tail = h;\n }\n L.len--;\n return OK;\n }else{\n return FALSE;\n }\n}\n\n\/\/将指针s(s->data为第一个数据元素)所指(彼此以指针相链接，以NULL结尾)的一串结点链接在链表L的最后一个结点之后，并改变链表L的尾指针指向新的尾结点\nStatus Append(LinkList &L, Link s){\n Link p = s;\n int i = 1;\n \/\/这段循环目的是为了找到s的最后一个结点\n while (p->next) {\n i++;\n p = p->next;\n }\n L.tail->next = s;\n \/\/L的尾结点指向s的最后一个结点\n L.tail = p;\n L.len += i;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个结点，返回p所指结点的直接前驱的位置，若无前驱，则返回NULL\nPosition PriorPos(LinkList L, Link p){\n \/\/如果p是链表L的第一个节点，无前驱\n if (p==L.header->next) {\n return NULL;\n }\n Link q = L.header->next;\n while (q->next) {\n if (q->next == p) {\n return q;\n }\n q = q->next;\n }\n return NULL;\n}\n\n\/\/删除线性表L中的尾结点并以q返回，改变链表L的尾指针指向新的尾结点\nStatus Remove(LinkList &L, Link &q){\n \/\/如果L为空表\n if (L.len == 0) {\n q = NULL;\n return FALSE;\n }\n \/\/p指向L的第一个结点\n Link p = L.header->next;\n \/\/for循环找到链表L尾结点的前一个结点\n while (p->next!=L.tail) {\n p = p->next;\n }\n q = L.tail;\n p->next = NULL;\n L.tail = p;\n L.len--;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个节点，将s所指节点插入在p所指节点之前，并修改指针p指向新插入的结点\nStatus InsBefore(LinkList &L, Link &p, Link s){\n \/\/q是p节点的前驱\n Link q = PriorPos(L, p);\n \/\/如果p节点没有前驱，则q指向链表L的头结点\n if (!q) {\n q = L.header;\n }\n \/\/插入s节点\n q->next = s;\n s->next = p;\n p = s;\n L.len++;\n return OK;\n}\n\n\/\/已知p指向线性链表L中的一个结点，将s所指结点插入在p所指节点之后，并修改指针p指向新插入的结点\nStatus InsAfter(LinkList &L, Link &p, Link s){\n s->next = p->next;\n p->next = s;\n if (p==L.tail) { \/\/修改尾指针\n L.tail = s;\n }\n p = s;\n L.len++;\n return OK;\n}\n\n\/\/已知p指向线性链表的一个结点，用e更新p指向结点的数据元素的值\nStatus SetCurElem(Link p, ElemType e){\n p->data = e;\n return OK;\n}\n\n\/\/已知p指向线性链表的一个结点，返回结点的数据元素的值\nElemType GetCurElem(Link p){\n return p->data;\n}\n\n\/\/若线性链表为空表返回True，否则返回False\nStatus ListEmpty(LinkList L){\n if (!L.len) {\n return TRUE;\n }else{\n return FALSE;\n }\n}\n\n\/\/返回线性链表的元素个数\nint ListLength(LinkList L){\n return L.len;\n}\n\n\/\/返回线性链表头结点的位置\nPosition GetHeader(LinkList L){\n return L.header;\n}\n\n\/\/返回线性链表最后一个结点的位置\nPosition GetLast(LinkList L){\n return L.tail;\n}\n\n\/\/已知p指向线性链表中的一个结点，返回p所指向结点的直接后继，若无直接后继，则返回NULL\nPosition NextPos(Link p){\n return p->next;\n}\n\n\/\/用p返回线性链表L中第i个结点的位置，并返回OK，如果i值不合法则返回error\nStatus LocatePos(LinkList L, int i, Link &p){\n if (i<1 || i>ListLength(L)) {\n return ERROR;\n }\n Link q = L.header;\n int j = 0;\n while (j<i && q!=NULL) {\n j++;\n q = q->next;\n }\n if (j>i || j>ListLength(L)) {\n return ERROR;\n }\n p = q;\n return OK;\n}\n\n\/\/返回线性链表L中第一个与e满足compare判定关系的结点的位置，若不存在这样的元素，则返回NULL\nPosition LocateElem(LinkList L, ElemType e, Status (*compare)(ElemType e1, ElemType e2)){\n Link p = L.header->next;\n while (p!=NULL) {\n if (compare(p->data,e)) {\n return p;\n }\n p = p->next;\n }\n return NULL;\n}\n\n\/\/依次对L中的每个调用数据元素调用visit函数。一旦visit失败，则操作失败\nStatus ListTraverse(LinkList L, void (*visit)(ElemType e)){\n Link p = L.header->next;\n while (p!=NULL) {\n visit(p->data);\n p = p->next;\n }\n printf(\"\\n\");\n return OK;\n}\n\n\/\/已知L为有序线性链表，将e元素按非降序插入在L中（用于一元多项式）\nStatus OrderInsert(LinkList &L, ElemType e, Status (*compare)(ElemType, ElemType)){\n Link p = L.header->next;\n Link q = L.header; \/\/q用来表示p的前驱\n while (p!=NULL) { \/\/之所以用p!=NULL作为循环结束条件，是为了让e能与链表L的最后一个结点元素值做比较\n \n \/\/比较p指向结点的数据与e的大小，当p->data第一次大于等于e时，e即插入在p的前驱和p之间\n if (compare(p->data,e)>=0) {\n break;\n }\n q = p;\n p = p->next;\n }\n Link s = (Link)malloc(sizeof(LNode));\n s->data = e;\n q->next = s;\n s->next = p;\n \/\/如果p等于NULL说明遍历到最后也没有找到比e大的值，因此e所在结点是表尾，修改表尾指针\n if (p==NULL) {\n L.tail = s;\n }\n L.len++;\n return OK;\n}\n\n\/\/若升序链表L中存在与e满足判定函数compare取值为0的元素，则p返回L中第一个值为e的结点的位置，并返回true；否则p指示第一个与e满足判定函数compare>0的元素的前驱的位置，并返回false（用于一元多项式）\nStatus LocatElem(LinkList L, ElemType e, Position &p, int(*compare)(ElemType, ElemType)){\n\/\/ Link q = L.header->next;\n\/\/ Link s = L.header;\n\/\/ while (!q) {\n\/\/ if (compare(q->data,e)==0) {\n\/\/ p = q;\n\/\/ return OK;\n\/\/ }else if (compare(q->data,e)>0){\n\/\/ p = s;\n\/\/ return FALSE;\n\/\/ }\n\/\/ s = q;\n\/\/ q = q->next;\n\/\/ }\n Link q = L.header;\n Link s;\n do {\n s = q;\n q = q->next;\n } while (q && compare(q->data,e)<0); \/\/循环结束后q可能到了表尾，也可能是compare(q->data,e)>=0\n if (!q||compare(q->data,e)>0) {\n p = s;\n return FALSE;\n }else{\n p = q;\n return TRUE;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * RemoteSyslogAppender.cpp\n *\n * Copyright 2001, LifeLine Networks BV (www.lifeline.nl). All rights reserved.\n * Copyright 2001, Walter Stroebel. All rights reserved.\n *\n * See the COPYING file for the terms of usage and distribution.\n *\/\n\n#include \"PortabilityImpl.hh\"\n\n#ifdef LOG4CPP_HAVE_UNISTD_H\n# include <unistd.h>\n#endif\n#include <cstdlib>\n#include <stdio.h>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <log4cpp\/RemoteSyslogAppender.hh>\n#include <log4cpp\/FactoryParams.hh>\n#include <memory>\n\n#ifdef WIN32\n#include <winsock2.h>\n#else\n#include <netdb.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#endif\n\nnamespace log4cpp {\n\n int RemoteSyslogAppender::toSyslogPriority(Priority::Value priority) {\n static int priorities[8] = { LOG_EMERG, LOG_ALERT, LOG_CRIT, LOG_ERR,\n LOG_WARNING, LOG_NOTICE, LOG_INFO, \n LOG_DEBUG };\n int result;\n\n priority++;\n priority \/= 100;\n\n if (priority < 0) {\n result = LOG_EMERG;\n } else if (priority > 7) {\n result = LOG_DEBUG;\n } else {\n result = priorities[priority];\n }\n\n return result;\n }\n \n\n RemoteSyslogAppender::RemoteSyslogAppender(const std::string& name, \n const std::string& syslogName, \n const std::string& relayer,\n int facility,\n int portNumber) : \n LayoutAppender(name),\n _syslogName(syslogName),\n _relayer(relayer),\n _facility((facility == -1) ? LOG_USER : facility),\n _portNumber((portNumber == -1) ? 514 : portNumber),\n _socket (0),\n _ipAddr (0),\n _cludge (0)\n {\n open();\n }\n \n RemoteSyslogAppender::~RemoteSyslogAppender() {\n close();\n#ifdef WIN32\n if (_cludge) {\n \/\/ we started it, we end it.\n WSACleanup ();\n }\n#endif\n }\n\n void RemoteSyslogAppender::open() {\n if (!_ipAddr) {\n struct hostent *pent = gethostbyname (_relayer.c_str ());\n#ifdef WIN32\n if (pent == NULL) {\n if (WSAGetLastError () == WSANOTINITIALISED) {\n WSADATA wsaData;\n int err;\n \n err = WSAStartup (0x101, &wsaData );\n if (err) {\n \/\/ loglog(\"RemoteSyslogAppender: WSAStartup returned %d\", err);\n return; \/\/ fail silently\n }\n pent = gethostbyname (_relayer.c_str ());\n _cludge = 1;\n } else {\n \/\/ loglog(\"RemoteSyslogAppender: gethostbyname returned error\");\n return; \/\/ fail silently\n }\n }\n#endif\n if (pent == NULL) {\n in_addr_t ip = inet_addr (_relayer.c_str ());\n pent = gethostbyaddr ((const char *) &ip, sizeof(in_addr_t), AF_INET);\n if (pent == NULL) {\n \/\/ loglog(\"RemoteSyslogAppender: failed to resolve host %s\", _relayer.c_str());\n return; \/\/ fail silently \n }\n }\n _ipAddr = *(in_addr_t*)(pent->h_addr); \/\/ fixed bug #1579890\n }\n \/\/ Get a datagram socket.\n \n if ((_socket = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n \/\/ loglog(\"RemoteSyslogAppender: failed to open socket\");\n return; \/\/ fail silently \n }\n }\n\n void RemoteSyslogAppender::close() {\n if (_socket) {\n#ifdef WIN32\n closesocket (_socket);\n#else\n ::close (_socket);\n#endif\n _socket = 0;\n }\n }\n\n void RemoteSyslogAppender::_append(const LoggingEvent& event) {\n const std::string message(_getLayout().format(event));\n size_t messageLength = message.length();\n char *buf = new char [messageLength + 16];\n int priority = _facility + toSyslogPriority(event.priority);\n int preambleLength = sprintf (buf, \"<%d>\", priority);\n memcpy (buf + preambleLength, message.data(), messageLength);\n\n sockaddr_in sain;\n sain.sin_family = AF_INET;\n sain.sin_port = htons (_portNumber);\n \/\/ NO, do NOT use htonl on _ipAddr. Is already in network order.\n sain.sin_addr.s_addr = _ipAddr;\n\n while (messageLength > 0) {\n \/* if packet larger than maximum (900 bytes), split\n into two or more syslog packets. *\/\n if (preambleLength + messageLength > 900) {\n sendto (_socket, buf, 900, 0, (struct sockaddr *) &sain, sizeof (sain));\n messageLength -= (900 - preambleLength);\n std::memmove (buf + preambleLength, buf + 900, messageLength);\n \/\/ note: we might need to sleep a bit here\n } else {\n sendto (_socket, buf, preambleLength + messageLength, 0, (struct sockaddr *) &sain, sizeof (sain));\n break;\n }\n }\n\n delete[] buf;\n }\n\n bool RemoteSyslogAppender::reopen() {\n close();\n open();\n return true;\n }\n \n std::auto_ptr<Appender> create_remote_syslog_appender(const FactoryParams& params)\n {\n std::string name, syslog_name, relayer;\n int facility = -1, port_number = -1;\n params.get_for(\"remote syslog appender\").required(\"name\", name)(\"syslog_name\", syslog_name)(\"relayer\", relayer)\n .optional(\"facility\", facility)(\"port\", port_number);\n return std::auto_ptr<Appender>(new RemoteSyslogAppender(name, syslog_name, relayer, facility, port_number));\n }\n}\n<commit_msg>Update include<commit_after>\/*\n * RemoteSyslogAppender.cpp\n *\n * Copyright 2001, LifeLine Networks BV (www.lifeline.nl). All rights reserved.\n * Copyright 2001, Walter Stroebel. All rights reserved.\n *\n * See the COPYING file for the terms of usage and distribution.\n *\/\n\n#include \"PortabilityImpl.hh\"\n\n#ifdef LOG4CPP_HAVE_UNISTD_H\n# include <unistd.h>\n#endif\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <log4cpp\/RemoteSyslogAppender.hh>\n#include <log4cpp\/FactoryParams.hh>\n#include <memory>\n\n#ifdef WIN32\n#include <winsock2.h>\n#else\n#include <netdb.h>\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#endif\n\nnamespace log4cpp {\n\n int RemoteSyslogAppender::toSyslogPriority(Priority::Value priority) {\n static int priorities[8] = { LOG_EMERG, LOG_ALERT, LOG_CRIT, LOG_ERR,\n LOG_WARNING, LOG_NOTICE, LOG_INFO, \n LOG_DEBUG };\n int result;\n\n priority++;\n priority \/= 100;\n\n if (priority < 0) {\n result = LOG_EMERG;\n } else if (priority > 7) {\n result = LOG_DEBUG;\n } else {\n result = priorities[priority];\n }\n\n return result;\n }\n \n\n RemoteSyslogAppender::RemoteSyslogAppender(const std::string& name, \n const std::string& syslogName, \n const std::string& relayer,\n int facility,\n int portNumber) : \n LayoutAppender(name),\n _syslogName(syslogName),\n _relayer(relayer),\n _facility((facility == -1) ? LOG_USER : facility),\n _portNumber((portNumber == -1) ? 514 : portNumber),\n _socket (0),\n _ipAddr (0),\n _cludge (0)\n {\n open();\n }\n \n RemoteSyslogAppender::~RemoteSyslogAppender() {\n close();\n#ifdef WIN32\n if (_cludge) {\n \/\/ we started it, we end it.\n WSACleanup ();\n }\n#endif\n }\n\n void RemoteSyslogAppender::open() {\n if (!_ipAddr) {\n struct hostent *pent = gethostbyname (_relayer.c_str ());\n#ifdef WIN32\n if (pent == NULL) {\n if (WSAGetLastError () == WSANOTINITIALISED) {\n WSADATA wsaData;\n int err;\n \n err = WSAStartup (0x101, &wsaData );\n if (err) {\n \/\/ loglog(\"RemoteSyslogAppender: WSAStartup returned %d\", err);\n return; \/\/ fail silently\n }\n pent = gethostbyname (_relayer.c_str ());\n _cludge = 1;\n } else {\n \/\/ loglog(\"RemoteSyslogAppender: gethostbyname returned error\");\n return; \/\/ fail silently\n }\n }\n#endif\n if (pent == NULL) {\n in_addr_t ip = inet_addr (_relayer.c_str ());\n pent = gethostbyaddr ((const char *) &ip, sizeof(in_addr_t), AF_INET);\n if (pent == NULL) {\n \/\/ loglog(\"RemoteSyslogAppender: failed to resolve host %s\", _relayer.c_str());\n return; \/\/ fail silently \n }\n }\n _ipAddr = *(in_addr_t*)(pent->h_addr); \/\/ fixed bug #1579890\n }\n \/\/ Get a datagram socket.\n \n if ((_socket = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n \/\/ loglog(\"RemoteSyslogAppender: failed to open socket\");\n return; \/\/ fail silently \n }\n }\n\n void RemoteSyslogAppender::close() {\n if (_socket) {\n#ifdef WIN32\n closesocket (_socket);\n#else\n ::close (_socket);\n#endif\n _socket = 0;\n }\n }\n\n void RemoteSyslogAppender::_append(const LoggingEvent& event) {\n const std::string message(_getLayout().format(event));\n size_t messageLength = message.length();\n char *buf = new char [messageLength + 16];\n int priority = _facility + toSyslogPriority(event.priority);\n int preambleLength = sprintf (buf, \"<%d>\", priority);\n memcpy (buf + preambleLength, message.data(), messageLength);\n\n sockaddr_in sain;\n sain.sin_family = AF_INET;\n sain.sin_port = htons (_portNumber);\n \/\/ NO, do NOT use htonl on _ipAddr. Is already in network order.\n sain.sin_addr.s_addr = _ipAddr;\n\n while (messageLength > 0) {\n \/* if packet larger than maximum (900 bytes), split\n into two or more syslog packets. *\/\n if (preambleLength + messageLength > 900) {\n sendto (_socket, buf, 900, 0, (struct sockaddr *) &sain, sizeof (sain));\n messageLength -= (900 - preambleLength);\n std::memmove (buf + preambleLength, buf + 900, messageLength);\n \/\/ note: we might need to sleep a bit here\n } else {\n sendto (_socket, buf, preambleLength + messageLength, 0, (struct sockaddr *) &sain, sizeof (sain));\n break;\n }\n }\n\n delete[] buf;\n }\n\n bool RemoteSyslogAppender::reopen() {\n close();\n open();\n return true;\n }\n \n std::auto_ptr<Appender> create_remote_syslog_appender(const FactoryParams& params)\n {\n std::string name, syslog_name, relayer;\n int facility = -1, port_number = -1;\n params.get_for(\"remote syslog appender\").required(\"name\", name)(\"syslog_name\", syslog_name)(\"relayer\", relayer)\n .optional(\"facility\", facility)(\"port\", port_number);\n return std::auto_ptr<Appender>(new RemoteSyslogAppender(name, syslog_name, relayer, facility, port_number));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include \"SlottedPage.hpp\"\n\n\n#define PAGE_SIZE 8192; \/\/ TODO Duplicate to BufferManager\n#define SLOT_COUNT 256; \/\/ TODO sure about that value?\n\nusing namespace std;\n\nstruct Header {\n\n};\n\n\nSlottedPage::SlottedPage(uint64_t pageId)\n : pageId(pageId) {\n header = this;\n firstSlot = this + sizeof(Header);\n firstEmptySlot = firstSlot;\n slotEnd = firstSlot + SLOT_COUNT * sizeof(Slot);\n end = this + PAGE_SIZE;\n freeSpace = end;\n}\n\nuint64_t SlottedPage::insert(const Record& r){\n if (this->getFreeSpaceOnPage() < r.getLen()) throw \"Insufficient space.\";\n\n Slot* slot = firstEmptySlot;\n\n assert(firstEmptySlot < slotEnd);\n\n char* destination = this->freeSpace - r.getLen();\n memcpy(destination, &r, r.getLen());\n\n uint64_t slotNum = (slot - header) \/ sizeof(Slot);\n\n slot->length = r.getLen();\n slot->offset = destination - slot; \/\/ Slot::offset is the offset between slot and data\n slot->moved = false;\n slot->tid = pageId | slotNum; \/\/ TODO\n\n for (Slot* s = firstEmptySlot; s < slotEnd; s += sizeof(Slot)) {\n firstEmptySlot = s;\n if (s->isEmpty()) break;\n }\n\n freeSpace -= r.getLen();\n\n return slot->tid.getTID();\n}\n\nvoid SlottedPage::remove(uint64_t slotNum) {\n Slot* slot = this->getSlot(slotNum);\n slot->length = 0;\n slot->offset = 0;\n slot->moved = false;\n\n if (firstEmptySlot > slot) {\n firstEmptySlot = slot;\n }\n}\n\n\n\nuint64_t SlottedPage::recompress() {\n \/\/ TODO\n}\n\n\nSlot* SlottedPage::getSlot(uint64_t slotNum){\n return firstSlot + slotNum * sizeof(Slot);\n}\n\n\nSlot* SlottedPage::getFreeSlot(){\n return firstEmptySlot;\n}\n\nRecord* SlottedPage::getRecordPtr(uint64_t slotNum){\n Slot* slot = getSlot(slotNum);\n if (slot->isEmpty()) throw \"Empty slot doesn't have an associated record.\";\n return reinterpret_cast<Record*>(slot + slot->offset);\n}\n\nunsigned SlottedPage::getFreeSpaceOnPage(){\n return this->freeSpace - this->slotEnd;\n}\n\nSlottedPage::~SlottedPage(){\n}\n<commit_msg>Fixed a few pointer casts.<commit_after>#include <cassert>\n#include \"SlottedPage.hpp\"\n\n\n#define PAGE_SIZE 8192 \/\/ TODO Duplicate to BufferManager\n#define SLOT_COUNT 256 \/\/ TODO sure about that value?\n\nusing namespace std;\n\nstruct Header {\n\n};\n\n\nSlottedPage::SlottedPage(uint64_t pageId)\n : pageId(pageId) {\n header = (char*) this;\n firstSlot = (Slot*) this + sizeof(Header);\n firstEmptySlot = firstSlot;\n slotEnd = reinterpret_cast<Slot*>(reinterpret_cast<unsigned>(firstSlot) + SLOT_COUNT * sizeof(Slot));\n end = (char*) this + PAGE_SIZE;\n freeSpace = end;\n}\n\nuint64_t SlottedPage::insert(const Record& r){\n if (this->getFreeSpaceOnPage() < r.getLen()) throw \"Insufficient space.\";\n\n Slot* slot = firstEmptySlot;\n\n assert(firstEmptySlot < slotEnd);\n\n char* destination = this->freeSpace - r.getLen();\n memcpy(destination, &r, r.getLen());\n\n uint64_t slotNum = ((char*) slot - header) \/ sizeof(Slot);\n\n slot->length = r.getLen();\n slot->offset = (uint64_t) destination - (uint64_t) slot; \/\/ Slot::offset is the offset between slot and data\n slot->moved = false;\n slot->tid = pageId | slotNum; \/\/ TODO\n\n for (Slot* s = firstEmptySlot; s < slotEnd; s += sizeof(Slot)) {\n firstEmptySlot = s;\n if (s->isEmpty()) break;\n }\n\n freeSpace -= r.getLen();\n\n return slot->tid.getTID();\n}\n\nvoid SlottedPage::remove(uint64_t slotNum) {\n Slot* slot = this->getSlot(slotNum);\n slot->length = 0;\n slot->offset = 0;\n slot->moved = false;\n\n if (firstEmptySlot > slot) {\n firstEmptySlot = slot;\n }\n}\n\n\n\nuint64_t SlottedPage::recompress() {\n \/\/ TODO\n return 0;\n}\n\n\nSlot* SlottedPage::getSlot(uint64_t slotNum){\n return firstSlot + slotNum * sizeof(Slot);\n}\n\n\nSlot* SlottedPage::getFreeSlot(){\n return firstEmptySlot;\n}\n\nRecord* SlottedPage::getRecordPtr(uint64_t slotNum){\n Slot* slot = getSlot(slotNum);\n if (slot->isEmpty()) throw \"Empty slot doesn't have an associated record.\";\n return reinterpret_cast<Record*>(slot + slot->offset);\n}\n\nunsigned SlottedPage::getFreeSpaceOnPage(){\n return ((unsigned) this->freeSpace - (unsigned) this->slotEnd);\n}\n\nSlottedPage::~SlottedPage(){\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <iostream>\n\n#if defined(_MSC_VER)\n#include <SDL.h>\n#include <SDL_image.h>\n#include <SDL_ttf.h>\n#elif defined(__clang__)\n#include <SDL2\/SDL.h>\n#include <SDL2_image\/SDL_image.h>\n#include <SDL2_ttf\/SDL_ttf.h>\n#else\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_image.h>\n#include <SDL2\/SDL_ttf.h>\n#endif\n\n\/*\n* Lesson 6: True Type Fonts with SDL_ttf\n*\/\n\/\/Screen attributes\nconst int SCREEN_WIDTH = 640;\nconst int SCREEN_HEIGHT = 480;\n\n\/**\n* Log an SDL error with some error message to the output stream of our choice\n* @param os The output stream to write the message too\n* @param msg The error message to write, format will be msg error: SDL_GetError()\n*\/\nvoid logSDLError(std::ostream &os, const std::string &msg){\n\tos << msg << \" error: \" << SDL_GetError() << std::endl;\n}\n\/**\n* Loads an image into a texture on the rendering device\n* @param file The image file to load\n* @param ren The renderer to load the texture onto\n* @return the loaded texture, or nullptr if something went wrong.\n*\/\nSDL_Texture* loadTexture(const std::string &file, SDL_Renderer *ren){\n\tSDL_Texture *texture = IMG_LoadTexture(ren, file.c_str());\n\tif (texture == nullptr)\n\t\tlogSDLError(std::cout, \"LoadTexture\");\n\treturn texture;\n}\n\/**\n* Draw an SDL_Texture to an SDL_Renderer at some destination rect\n* taking a clip of the texture if desired\n* @param tex The source texture we want to draw\n* @param rend The renderer we want to draw too\n* @param dst The destination rectangle to render the texture too\n* @param clip The sub-section of the texture to draw (clipping rect)\n*\t\tdefault of nullptr draws the entire texture\n*\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, SDL_Rect dst, SDL_Rect *clip = nullptr){\n\tSDL_RenderCopy(ren, tex, clip, &dst);\n}\n\/**\n* Draw an SDL_Texture to an SDL_Renderer at position x, y, preserving\n* the texture's width and height and taking a clip of the texture if desired\n* If a clip is passed, the clip's width and height will be used instead of the texture's\n* @param tex The source texture we want to draw\n* @param rend The renderer we want to draw too\n* @param x The x coordinate to draw too\n* @param y The y coordinate to draw too\n* @param clip The sub-section of the texture to draw (clipping rect)\n*\t\tdefault of nullptr draws the entire texture\n*\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, int x, int y, SDL_Rect *clip = nullptr){\n\tSDL_Rect dst;\n\tdst.x = x;\n\tdst.y = y;\n\tif (clip != nullptr){\n\t\tdst.w = clip->w;\n\t\tdst.h = clip->h;\n\t}\n\telse\n\t\tSDL_QueryTexture(tex, NULL, NULL, &dst.w, &dst.h);\n\n\trenderTexture(tex, ren, dst, clip);\n}\n\/**\n* Render the message we want to display to a texture for drawing\n* @param message The message we want to display\n* @param fontFile The font we want to use to render the text\n* @param color The color we want the text to be\n* @param fontSize The size we want the font to be\n* @param renderer The renderer to load the texture in\n* @return An SDL_Texture containing the rendered message, or nullptr if something went wrong\n*\/\nSDL_Texture* renderText(std::string message, std::string fontFile, SDL_Color color,\n\tint fontSize, SDL_Renderer *renderer)\n{\n\t\/\/Open the font\n\tTTF_Font *font = TTF_OpenFont(fontFile.c_str(), fontSize);\n\tif (font == nullptr){\n\t\tlogSDLError(std::cout, \"TTF_OpenFont\");\n\t\treturn nullptr;\n\t}\t\n\t\/\/We need to first render to a surface as that's what TTF_RenderText returns, then\n\t\/\/load that surface into a texture\n\tSDL_Surface *surf = TTF_RenderText_Blended(font, message.c_str(), color);\n\tif (surf == nullptr){\n\t\tTTF_CloseFont(font);\n\t\tlogSDLError(std::cout, \"TTF_RenderText\");\n\t\treturn nullptr;\n\t}\n\tSDL_Texture *texture = SDL_CreateTextureFromSurface(renderer, surf);\n\tif (texture == nullptr){\n\t\tlogSDLError(std::cout, \"CreateTexture\");\n\t}\n\t\/\/Clean up the surface and font\n\tSDL_FreeSurface(surf);\n\tTTF_CloseFont(font);\n\treturn texture;\n}\n\nint main(int argc, char** argv){\n\t\/\/Start up SDL and make sure it went ok\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tlogSDLError(std::cout, \"SDL_Init\");\n\t\treturn 1;\n\t}\n\t\/\/Also need to init SDL_ttf\n\tif (TTF_Init() != 0){\n\t\tlogSDLError(std::cout, \"TTF_Init\");\n\t\treturn 1;\n\t}\n\n\t\/\/Setup our window and renderer\n\tSDL_Window *window = SDL_CreateWindow(\"Lesson 6\", SDL_WINDOWPOS_CENTERED,\n\t\tSDL_WINDOWPOS_CENTERED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n\tif (window == nullptr){\n\t\tlogSDLError(std::cout, \"CreateWindow\");\n\t\treturn 1;\n\t}\n\tSDL_Renderer *renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n\tif (renderer == nullptr){\n\t\tlogSDLError(std::cout, \"CreateRenderer\");\n\t\treturn 1;\n\t}\n\n\t\/\/We'll render the string \"TTF fonts are cool!\" in white\n\t\/\/Color is in RGB format\n\tSDL_Color color = { 255, 255, 255 };\n\tSDL_Texture *image = renderText(\"TTF fonts are cool!\", \"..\/res\/Lesson6\/sample.ttf\", color, 64, renderer);\n\n\t\/\/Get the texture w\/h so we can center it in the screen\n\tint iW, iH;\n\tSDL_QueryTexture(image, NULL, NULL, &iW, &iH);\n\tint x = SCREEN_WIDTH \/ 2 - iW \/ 2;\n\tint y = SCREEN_HEIGHT \/ 2 - iH \/ 2;\n\n\tSDL_Event e;\n\tbool quit = false;\n\twhile (!quit){\n\t\t\/\/Event Polling\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT)\n\t\t\t\tquit = true;\n\t\t\tif (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)\n\t\t\t\tquit = true;\n\t\t}\n\t\tSDL_RenderClear(renderer);\n\t\t\/\/We can draw our message as we do any other texture, since it's been\n\t\t\/\/rendered to a texture\n\t\trenderTexture(image, renderer, x, y);\n\t\tSDL_RenderPresent(renderer);\n\t}\n\t\/\/Clean up\n\tSDL_DestroyTexture(image);\n\tSDL_DestroyRenderer(renderer);\n\tSDL_DestroyWindow(window);\n\tTTF_Quit();\n\tSDL_Quit();\n\t\n\treturn 0;\n}\n<commit_msg>Take params by const&<commit_after>#include <string>\n#include <iostream>\n\n#if defined(_MSC_VER)\n#include <SDL.h>\n#include <SDL_image.h>\n#include <SDL_ttf.h>\n#elif defined(__clang__)\n#include <SDL2\/SDL.h>\n#include <SDL2_image\/SDL_image.h>\n#include <SDL2_ttf\/SDL_ttf.h>\n#else\n#include <SDL2\/SDL.h>\n#include <SDL2\/SDL_image.h>\n#include <SDL2\/SDL_ttf.h>\n#endif\n\n\/*\n* Lesson 6: True Type Fonts with SDL_ttf\n*\/\n\/\/Screen attributes\nconst int SCREEN_WIDTH = 640;\nconst int SCREEN_HEIGHT = 480;\n\n\/**\n* Log an SDL error with some error message to the output stream of our choice\n* @param os The output stream to write the message too\n* @param msg The error message to write, format will be msg error: SDL_GetError()\n*\/\nvoid logSDLError(std::ostream &os, const std::string &msg){\n\tos << msg << \" error: \" << SDL_GetError() << std::endl;\n}\n\/**\n* Loads an image into a texture on the rendering device\n* @param file The image file to load\n* @param ren The renderer to load the texture onto\n* @return the loaded texture, or nullptr if something went wrong.\n*\/\nSDL_Texture* loadTexture(const std::string &file, SDL_Renderer *ren){\n\tSDL_Texture *texture = IMG_LoadTexture(ren, file.c_str());\n\tif (texture == nullptr)\n\t\tlogSDLError(std::cout, \"LoadTexture\");\n\treturn texture;\n}\n\/**\n* Draw an SDL_Texture to an SDL_Renderer at some destination rect\n* taking a clip of the texture if desired\n* @param tex The source texture we want to draw\n* @param rend The renderer we want to draw too\n* @param dst The destination rectangle to render the texture too\n* @param clip The sub-section of the texture to draw (clipping rect)\n*\t\tdefault of nullptr draws the entire texture\n*\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, SDL_Rect dst, SDL_Rect *clip = nullptr){\n\tSDL_RenderCopy(ren, tex, clip, &dst);\n}\n\/**\n* Draw an SDL_Texture to an SDL_Renderer at position x, y, preserving\n* the texture's width and height and taking a clip of the texture if desired\n* If a clip is passed, the clip's width and height will be used instead of the texture's\n* @param tex The source texture we want to draw\n* @param rend The renderer we want to draw too\n* @param x The x coordinate to draw too\n* @param y The y coordinate to draw too\n* @param clip The sub-section of the texture to draw (clipping rect)\n*\t\tdefault of nullptr draws the entire texture\n*\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, int x, int y, SDL_Rect *clip = nullptr){\n\tSDL_Rect dst;\n\tdst.x = x;\n\tdst.y = y;\n\tif (clip != nullptr){\n\t\tdst.w = clip->w;\n\t\tdst.h = clip->h;\n\t}\n\telse\n\t\tSDL_QueryTexture(tex, NULL, NULL, &dst.w, &dst.h);\n\n\trenderTexture(tex, ren, dst, clip);\n}\n\/**\n* Render the message we want to display to a texture for drawing\n* @param message The message we want to display\n* @param fontFile The font we want to use to render the text\n* @param color The color we want the text to be\n* @param fontSize The size we want the font to be\n* @param renderer The renderer to load the texture in\n* @return An SDL_Texture containing the rendered message, or nullptr if something went wrong\n*\/\nSDL_Texture* renderText(const std::string &message, const std::string &fontFile, SDL_Color color,\n\tint fontSize, SDL_Renderer *renderer)\n{\n\t\/\/Open the font\n\tTTF_Font *font = TTF_OpenFont(fontFile.c_str(), fontSize);\n\tif (font == nullptr){\n\t\tlogSDLError(std::cout, \"TTF_OpenFont\");\n\t\treturn nullptr;\n\t}\t\n\t\/\/We need to first render to a surface as that's what TTF_RenderText returns, then\n\t\/\/load that surface into a texture\n\tSDL_Surface *surf = TTF_RenderText_Blended(font, message.c_str(), color);\n\tif (surf == nullptr){\n\t\tTTF_CloseFont(font);\n\t\tlogSDLError(std::cout, \"TTF_RenderText\");\n\t\treturn nullptr;\n\t}\n\tSDL_Texture *texture = SDL_CreateTextureFromSurface(renderer, surf);\n\tif (texture == nullptr){\n\t\tlogSDLError(std::cout, \"CreateTexture\");\n\t}\n\t\/\/Clean up the surface and font\n\tSDL_FreeSurface(surf);\n\tTTF_CloseFont(font);\n\treturn texture;\n}\n\nint main(int argc, char** argv){\n\t\/\/Start up SDL and make sure it went ok\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tlogSDLError(std::cout, \"SDL_Init\");\n\t\treturn 1;\n\t}\n\t\/\/Also need to init SDL_ttf\n\tif (TTF_Init() != 0){\n\t\tlogSDLError(std::cout, \"TTF_Init\");\n\t\treturn 1;\n\t}\n\n\t\/\/Setup our window and renderer\n\tSDL_Window *window = SDL_CreateWindow(\"Lesson 6\", SDL_WINDOWPOS_CENTERED,\n\t\tSDL_WINDOWPOS_CENTERED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n\tif (window == nullptr){\n\t\tlogSDLError(std::cout, \"CreateWindow\");\n\t\treturn 1;\n\t}\n\tSDL_Renderer *renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n\tif (renderer == nullptr){\n\t\tlogSDLError(std::cout, \"CreateRenderer\");\n\t\treturn 1;\n\t}\n\n\t\/\/We'll render the string \"TTF fonts are cool!\" in white\n\t\/\/Color is in RGB format\n\tSDL_Color color = { 255, 255, 255 };\n\tSDL_Texture *image = renderText(\"TTF fonts are cool!\", \"..\/res\/Lesson6\/sample.ttf\", color, 64, renderer);\n\n\t\/\/Get the texture w\/h so we can center it in the screen\n\tint iW, iH;\n\tSDL_QueryTexture(image, NULL, NULL, &iW, &iH);\n\tint x = SCREEN_WIDTH \/ 2 - iW \/ 2;\n\tint y = SCREEN_HEIGHT \/ 2 - iH \/ 2;\n\n\tSDL_Event e;\n\tbool quit = false;\n\twhile (!quit){\n\t\t\/\/Event Polling\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT)\n\t\t\t\tquit = true;\n\t\t\tif (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)\n\t\t\t\tquit = true;\n\t\t}\n\t\tSDL_RenderClear(renderer);\n\t\t\/\/We can draw our message as we do any other texture, since it's been\n\t\t\/\/rendered to a texture\n\t\trenderTexture(image, renderer, x, y);\n\t\tSDL_RenderPresent(renderer);\n\t}\n\t\/\/Clean up\n\tSDL_DestroyTexture(image);\n\tSDL_DestroyRenderer(renderer);\n\tSDL_DestroyWindow(window);\n\tTTF_Quit();\n\tSDL_Quit();\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- tools\/seec-view\/SourceEditor\/GlobalCompilerPreferences.cpp ---------===\/\/\n\/\/\n\/\/ SeeC\n\/\/\n\/\/ This file is distributed under The MIT License (MIT). See LICENSE.TXT for\n\/\/ details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"seec\/ICU\/Resources.hpp\"\n#include \"seec\/wxWidgets\/StringConversion.hpp\"\n\n#include <wx\/config.h>\n#include <wx\/filepicker.h>\n#include <wx\/log.h>\n#include <wx\/msgdlg.h>\n#include <wx\/sizer.h>\n#include <wx\/stattext.h>\n\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Program.h\"\n\n#include \"GlobalCompilerPreferences.hpp\"\n\nusing namespace seec;\n\nchar const * const cConfigKeyForMinGWGCCPath = \"\/Compiler\/MinGW\/GCCPath\";\n\nwxFileName getPathForMinGWGCC()\n{\n auto const Config = wxConfig::Get();\n wxString GCCPath;\n if (Config->Read(cConfigKeyForMinGWGCCPath, &GCCPath)) {\n return wxFileName{GCCPath};\n }\n\n#if defined(_WIN32)\n auto const GCCName = \"gcc.exe\";\n#else\n auto const GCCName = \"gcc\";\n#endif\n\n auto SearchEnvPath = llvm::sys::findProgramByName(GCCName);\n if (SearchEnvPath)\n return wxFileName{std::move(*SearchEnvPath)};\n\n return wxFileName{};\n}\n\nnamespace {\n\nbool setPathForMinGWGCC(wxFileName const &Path)\n{\n auto const Config = wxConfig::Get();\n if (!Config->Write(cConfigKeyForMinGWGCCPath, Path.GetFullPath()))\n return false;\n Config->Flush();\n return true;\n}\n\n}\n\nbool GlobalCompilerPreferencesWindow::SaveValuesImpl()\n{\n if (m_MinGWGCCPathCtrl) {\n auto const Path = m_MinGWGCCPathCtrl->GetPath();\n if (!llvm::sys::fs::can_execute(Path.ToStdString())) {\n auto const ResText = Resource(\"TraceViewer\")[\"GlobalCompilerPreferences\"];\n\n wxMessageDialog Dlg(this,\n towxString(ResText[\"GCCNotExecutableMessage\"]),\n towxString(ResText[\"GCCNotExecutableCaption\"]));\n Dlg.ShowModal();\n return false;\n }\n \n if (!setPathForMinGWGCC(m_MinGWGCCPathCtrl->GetPath())) {\n return false;\n }\n }\n \n return true;\n}\n\nvoid GlobalCompilerPreferencesWindow::CancelChangesImpl() {}\n\nwxString GlobalCompilerPreferencesWindow::GetDisplayNameImpl()\n{\n return towxString(Resource(\"TraceViewer\")\n [\"GlobalCompilerPreferences\"][\"Title\"]);\n}\n\nGlobalCompilerPreferencesWindow::GlobalCompilerPreferencesWindow()\n: m_MinGWGCCPathCtrl(nullptr)\n{}\n\nGlobalCompilerPreferencesWindow\n::GlobalCompilerPreferencesWindow(wxWindow *Parent)\n: GlobalCompilerPreferencesWindow()\n{\n Create(Parent);\n}\n\nGlobalCompilerPreferencesWindow::~GlobalCompilerPreferencesWindow()\n = default;\n\nbool GlobalCompilerPreferencesWindow::Create(wxWindow *Parent)\n{\n if (!wxWindow::Create(Parent, wxID_ANY)) {\n return false;\n }\n\n auto const Res = Resource(\"TraceViewer\")[\"GlobalCompilerPreferences\"];\n\n \/\/ TODO: only add on MSW\n auto const MinGWGCCFilePickerLabel =\n new wxStaticText(this, wxID_ANY, towxString(Res[\"MinGWGCCLocationLabel\"]));\n\n \/\/ TODO: only add on MSW\n m_MinGWGCCPathCtrl =\n new wxFilePickerCtrl(this, wxID_ANY,\n \/* path *\/ getPathForMinGWGCC().GetFullPath(),\n \/* message *\/ towxString(Res[\"MinGWGCCLocationPrompt\"]),\n wxFileSelectorDefaultWildcardStr,\n wxDefaultPosition,\n wxDefaultSize,\n wxFLP_DEFAULT_STYLE | wxFLP_USE_TEXTCTRL | wxFLP_FILE_MUST_EXIST);\n\n \/\/ Vertical sizer to hold each row of input.\n auto const ParentSizer = new wxBoxSizer(wxVERTICAL);\n\n int const BorderDir = wxLEFT | wxRIGHT;\n int const BorderSize = 5;\n\n ParentSizer->AddSpacer(BorderSize);\n\n \/\/ TODO: only add on MSW\n ParentSizer->Add(MinGWGCCFilePickerLabel,\n wxSizerFlags().Border(BorderDir, BorderSize));\n\n \/\/ TODO: only add on MSW\n ParentSizer->Add(m_MinGWGCCPathCtrl,\n wxSizerFlags().Expand().Border(BorderDir, BorderSize));\n\n ParentSizer->AddSpacer(BorderSize);\n\n SetSizerAndFit(ParentSizer);\n\n return true;\n}\n<commit_msg>Only show the MinGW GCC selection option under MSW.<commit_after>\/\/===- tools\/seec-view\/SourceEditor\/GlobalCompilerPreferences.cpp ---------===\/\/\n\/\/\n\/\/ SeeC\n\/\/\n\/\/ This file is distributed under The MIT License (MIT). See LICENSE.TXT for\n\/\/ details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\/\n\/\/\/ \\file\n\/\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"seec\/ICU\/Resources.hpp\"\n#include \"seec\/wxWidgets\/StringConversion.hpp\"\n\n#include <wx\/config.h>\n#include <wx\/filepicker.h>\n#include <wx\/log.h>\n#include <wx\/msgdlg.h>\n#include <wx\/platinfo.h>\n#include <wx\/sizer.h>\n#include <wx\/stattext.h>\n\n\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/Program.h\"\n\n#include \"GlobalCompilerPreferences.hpp\"\n\nusing namespace seec;\n\nchar const * const cConfigKeyForMinGWGCCPath = \"\/Compiler\/MinGW\/GCCPath\";\n\nwxFileName getPathForMinGWGCC()\n{\n auto const Config = wxConfig::Get();\n wxString GCCPath;\n if (Config->Read(cConfigKeyForMinGWGCCPath, &GCCPath)) {\n return wxFileName{GCCPath};\n }\n\n#if defined(_WIN32)\n auto const GCCName = \"gcc.exe\";\n#else\n auto const GCCName = \"gcc\";\n#endif\n\n auto SearchEnvPath = llvm::sys::findProgramByName(GCCName);\n if (SearchEnvPath)\n return wxFileName{std::move(*SearchEnvPath)};\n\n return wxFileName{};\n}\n\nnamespace {\n\nbool setPathForMinGWGCC(wxFileName const &Path)\n{\n auto const Config = wxConfig::Get();\n if (!Config->Write(cConfigKeyForMinGWGCCPath, Path.GetFullPath()))\n return false;\n Config->Flush();\n return true;\n}\n\n}\n\nbool GlobalCompilerPreferencesWindow::SaveValuesImpl()\n{\n if (m_MinGWGCCPathCtrl) {\n auto const Path = m_MinGWGCCPathCtrl->GetPath();\n if (!llvm::sys::fs::can_execute(Path.ToStdString())) {\n auto const ResText = Resource(\"TraceViewer\")[\"GlobalCompilerPreferences\"];\n\n wxMessageDialog Dlg(this,\n towxString(ResText[\"GCCNotExecutableMessage\"]),\n towxString(ResText[\"GCCNotExecutableCaption\"]));\n Dlg.ShowModal();\n return false;\n }\n \n if (!setPathForMinGWGCC(m_MinGWGCCPathCtrl->GetPath())) {\n return false;\n }\n }\n \n return true;\n}\n\nvoid GlobalCompilerPreferencesWindow::CancelChangesImpl() {}\n\nwxString GlobalCompilerPreferencesWindow::GetDisplayNameImpl()\n{\n return towxString(Resource(\"TraceViewer\")\n [\"GlobalCompilerPreferences\"][\"Title\"]);\n}\n\nGlobalCompilerPreferencesWindow::GlobalCompilerPreferencesWindow()\n: m_MinGWGCCPathCtrl(nullptr)\n{}\n\nGlobalCompilerPreferencesWindow\n::GlobalCompilerPreferencesWindow(wxWindow *Parent)\n: GlobalCompilerPreferencesWindow()\n{\n Create(Parent);\n}\n\nGlobalCompilerPreferencesWindow::~GlobalCompilerPreferencesWindow()\n = default;\n\nbool GlobalCompilerPreferencesWindow::Create(wxWindow *Parent)\n{\n if (!wxWindow::Create(Parent, wxID_ANY)) {\n return false;\n }\n\n auto const Res = Resource(\"TraceViewer\")[\"GlobalCompilerPreferences\"];\n auto const &Platform = wxPlatformInfo::Get();\n\n \/\/ Vertical sizer to hold each row of input.\n auto const ParentSizer = new wxBoxSizer(wxVERTICAL);\n\n int const BorderDir = wxLEFT | wxRIGHT;\n int const BorderSize = 5;\n \n if (Platform.GetOperatingSystemId() & wxOS_WINDOWS) {\n auto const MinGWGCCFilePickerLabel =\n new wxStaticText(this, wxID_ANY,\n towxString(Res[\"MinGWGCCLocationLabel\"]));\n\n m_MinGWGCCPathCtrl =\n new wxFilePickerCtrl(this, wxID_ANY,\n \/* path *\/ getPathForMinGWGCC().GetFullPath(),\n \/* message *\/ towxString(Res[\"MinGWGCCLocationPrompt\"]),\n wxFileSelectorDefaultWildcardStr,\n wxDefaultPosition,\n wxDefaultSize,\n wxFLP_DEFAULT_STYLE | wxFLP_USE_TEXTCTRL | wxFLP_FILE_MUST_EXIST);\n\n ParentSizer->AddSpacer(BorderSize);\n\n ParentSizer->Add(MinGWGCCFilePickerLabel,\n wxSizerFlags().Border(BorderDir, BorderSize));\n\n ParentSizer->Add(m_MinGWGCCPathCtrl,\n wxSizerFlags().Expand().Border(BorderDir, BorderSize));\n\n ParentSizer->AddSpacer(BorderSize);\n }\n\n SetSizerAndFit(ParentSizer);\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>updates to publish manipulation commands for gas and brake<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright CERN. This software is distributed under the terms of the GNU\n\/\/ General Public License v3 (GPL Version 3).\n\/\/\n\/\/ See http:\/\/www.gnu.org\/licenses\/ for full licensing information.\n\/\/\n\/\/ In applying this license CERN does not waive the privileges and immunities\n\/\/ granted to it by virtue of its status as an Intergovernmental Organization\n\/\/ or submit itself to any jurisdiction.\n\n\/\/\/ \\file AliMLResponse.cxx\n\/\/\/ \\author pietro.fecchio@cern.ch, maximiliano.puccio@cern.ch\n\n#include \"AliMLResponse.h\"\n\n#include \"yaml-cpp\/yaml.h\"\n\n#include \"AliLog.h\"\n#include \"AliExternalBDT.h\"\n\nusing std::map;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliMLResponse);\n\/\/\/ \\endcond\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse()\n : TNamed(), fConfigFilePath{}, fModels{}, fCentClasses{}, fBins{}, fVariableNames{}, fNBins{}, fNVariables{},\n fBinsBegin{}, fRaw{} {\n \/\/\n \/\/ Default constructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse(const Char_t *name, const Char_t *title)\n : TNamed(name, title), fConfigFilePath{\"\"}, fModels{}, fCentClasses{}, fBins{}, fVariableNames{}, fNBins{},\n fNVariables{}, fBinsBegin{}, fRaw{} {\n \/\/\n \/\/ Standard constructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::~AliMLResponse() {\n \/\/\n \/\/ Destructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse(const AliMLResponse &source)\n : TNamed(source.GetName(), source.GetTitle()), fConfigFilePath{source.fConfigFilePath}, fModels{source.fModels},\n fCentClasses{source.fCentClasses}, fBins{source.fBins}, fVariableNames{source.fVariableNames},\n fNBins{source.fNBins}, fNVariables{source.fNVariables}, fBinsBegin{source.fBinsBegin}, fRaw{source.fRaw} {\n \/\/\n \/\/ Copy constructor\n \/\/\n}\n\nAliMLResponse &AliMLResponse::operator=(const AliMLResponse &source) {\n \/\/\n \/\/ assignment operator\n \/\/\n if (&source == this) return *this;\n\n TNamed::operator=(source);\n\n fConfigFilePath = source.fConfigFilePath;\n fModels = source.fModels;\n fCentClasses = source.fCentClasses;\n fBins = source.fBins;\n fVariableNames = source.fVariableNames;\n fNBins = source.fNBins;\n fNVariables = source.fNVariables;\n fBinsBegin = source.fBinsBegin;\n fRaw = source.fRaw;\n\n return *this;\n}\n\n\/\/_______________________________________________________________________________\nvoid AliMLResponse::CheckConfigFile(YAML::Node nodelist) {\n \/\/\/ error for empty config file\n if (nodelist.IsNull()) {\n AliFatal(\"Empty .yaml config file, please check it! Exit\");\n }\n \/\/\/ error for bin\/model number inconsistencies\n if ((nodelist[\"BINS\"].as<vector<float>>().size() - 1) != nodelist[\"N_MODELS\"].as<unsigned int>() ||\n (nodelist[\"N_MODELS\"].as<unsigned int>() != nodelist[\"MODELS\"].size())) {\n AliFatal(\"Inconsistency found in the number of bins\/models, please check it! Exit\");\n }\n \/\/\/ error for variables\/numberofvariable inconsistency\n if (nodelist[\"NUM_VAR\"].as<unsigned int>() != nodelist[\"VAR_NAMES\"].size()) {\n AliFatal(\"Inconsistency found in the number of varibles, please check it! Exit\");\n }\n return;\n}\n\n\/\/_______________________________________________________________________________\nvoid AliMLResponse::MLResponseInit() {\n \/\/\/ import config file from alien path\n string configPath = AliMLModelHandler::ImportFile(fConfigFilePath);\n YAML::Node nodeList;\n \/\/\/ manage wrong config file path\n try {\n nodeList = YAML::LoadFile(configPath);\n } catch (std::exception &e) {\n AliFatal(Form(\"Yaml-ccp error: %s! Exit\", e.what()));\n }\n \/\/\/ manage inconsistencies in config file\n CheckConfigFile(nodeList);\n\n fVariableNames = nodeList[\"VAR_NAMES\"].as<vector<string>>();\n fBins = nodeList[\"BINS\"].as<vector<float>>();\n fNBins = nodeList[\"N_MODELS\"].as<int>();\n fNVariables = nodeList[\"NUM_VAR\"].as<int>();\n fRaw = nodeList[\"RAW_SCORE\"].as<bool>();\n\n fBinsBegin = fBins.begin();\n\n for (const auto &model : nodeList[\"MODELS\"]) {\n fModels.push_back(AliMLModelHandler{model});\n }\n\n for (auto &model : fModels) {\n bool comp = model.CompileModel();\n if (!comp) {\n AliFatal(\"Error in model compilation! Exit\");\n }\n }\n}\n\n\/\/_______________________________________________________________________________\nint AliMLResponse::FindBin(double binvar) {\n vector<float>::iterator low;\n low = std::lower_bound(fBins.begin(), fBins.end(), binvar);\n return low - fBinsBegin;\n}\n\n\/\/_______________________________________________________________________________\ndouble AliMLResponse::Predict(double binvar, map<string, double> varmap) {\n if ((int)varmap.size() < fNVariables) {\n AliFatal(\"The variable map you provided to the predictor has a size smaller than the variable list size! Exit\");\n }\n\n vector<double> features;\n for (const auto &varname : fVariableNames) {\n if (varmap.find(varname) == varmap.end()) {\n AliFatal(Form(\"Variable |%s| not found in variable list provided in config! Exit\", varname.data()));\n }\n features.push_back(varmap[varname]);\n }\n\n int bin = FindBin(binvar);\n if (bin == 0 || bin == fNBins) {\n AliWarning(\"Binned variable outside range, no model available!\");\n return -999.;\n }\n\n return fModels[bin - 1].GetModel()->Predict(&features[0], fNVariables, fRaw);\n}\n\n\/\/________________________________________________________________\ndouble AliMLResponse::Predict(double binvar, vector<double> variables) {\n if ((int)variables.size() != fNVariables) {\n AliFatal(Form(\"Number of variables passed (%d) different from the one used in the model (%d)! Exit\", (int)variables.size(), fNVariables));\n }\n\n int bin = FindBin(binvar);\n if (bin == 0 || bin == fNBins) {\n AliWarning(\"Binned variable outside range, no model available!\");\n return -999.;\n }\n\n return fModels[bin - 1].GetModel()->Predict(&variables[0], fNVariables, fRaw);\n}\n\n\/\/________________________________________________________________\nbool AliMLResponse::IsSelected(double binvar, std::map<std::string, double> varmap) {\n double score{0.};\n return IsSelected(binvar, varmap, score);\n}\n\n\/\/________________________________________________________________\nbool AliMLResponse::IsSelected(double binvar, std::vector<double> variables) {\n double score{0.};\n return IsSelected(binvar, variables, score);\n}<commit_msg>Fix typo<commit_after>\/\/ Copyright CERN. This software is distributed under the terms of the GNU\n\/\/ General Public License v3 (GPL Version 3).\n\/\/\n\/\/ See http:\/\/www.gnu.org\/licenses\/ for full licensing information.\n\/\/\n\/\/ In applying this license CERN does not waive the privileges and immunities\n\/\/ granted to it by virtue of its status as an Intergovernmental Organization\n\/\/ or submit itself to any jurisdiction.\n\n\/\/\/ \\file AliMLResponse.cxx\n\/\/\/ \\author pietro.fecchio@cern.ch, maximiliano.puccio@cern.ch\n\n#include \"AliMLResponse.h\"\n\n#include \"yaml-cpp\/yaml.h\"\n\n#include \"AliLog.h\"\n#include \"AliExternalBDT.h\"\n\nusing std::map;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\n\/\/\/ \\cond CLASSIMP\nClassImp(AliMLResponse);\n\/\/\/ \\endcond\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse()\n : TNamed(), fConfigFilePath{}, fModels{}, fCentClasses{}, fBins{}, fVariableNames{}, fNBins{}, fNVariables{},\n fBinsBegin{}, fRaw{} {\n \/\/\n \/\/ Default constructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse(const Char_t *name, const Char_t *title)\n : TNamed(name, title), fConfigFilePath{\"\"}, fModels{}, fCentClasses{}, fBins{}, fVariableNames{}, fNBins{},\n fNVariables{}, fBinsBegin{}, fRaw{} {\n \/\/\n \/\/ Standard constructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::~AliMLResponse() {\n \/\/\n \/\/ Destructor\n \/\/\n}\n\n\/\/_______________________________________________________________________________\nAliMLResponse::AliMLResponse(const AliMLResponse &source)\n : TNamed(source.GetName(), source.GetTitle()), fConfigFilePath{source.fConfigFilePath}, fModels{source.fModels},\n fCentClasses{source.fCentClasses}, fBins{source.fBins}, fVariableNames{source.fVariableNames},\n fNBins{source.fNBins}, fNVariables{source.fNVariables}, fBinsBegin{source.fBinsBegin}, fRaw{source.fRaw} {\n \/\/\n \/\/ Copy constructor\n \/\/\n}\n\nAliMLResponse &AliMLResponse::operator=(const AliMLResponse &source) {\n \/\/\n \/\/ assignment operator\n \/\/\n if (&source == this) return *this;\n\n TNamed::operator=(source);\n\n fConfigFilePath = source.fConfigFilePath;\n fModels = source.fModels;\n fCentClasses = source.fCentClasses;\n fBins = source.fBins;\n fVariableNames = source.fVariableNames;\n fNBins = source.fNBins;\n fNVariables = source.fNVariables;\n fBinsBegin = source.fBinsBegin;\n fRaw = source.fRaw;\n\n return *this;\n}\n\n\/\/_______________________________________________________________________________\nvoid AliMLResponse::CheckConfigFile(YAML::Node nodelist) {\n \/\/\/ error for empty config file\n if (nodelist.IsNull()) {\n AliFatal(\"Empty .yaml config file, please check it! Exit\");\n }\n \/\/\/ error for bin\/model number inconsistencies\n if ((nodelist[\"BINS\"].as<vector<float>>().size() - 1) != nodelist[\"N_MODELS\"].as<unsigned int>() ||\n (nodelist[\"N_MODELS\"].as<unsigned int>() != nodelist[\"MODELS\"].size())) {\n AliFatal(\"Inconsistency found in the number of bins\/models, please check it! Exit\");\n }\n \/\/\/ error for variables\/numberofvariable inconsistency\n if (nodelist[\"NUM_VAR\"].as<unsigned int>() != nodelist[\"VAR_NAMES\"].size()) {\n AliFatal(\"Inconsistency found in the number of variables, please check it! Exit\");\n }\n return;\n}\n\n\/\/_______________________________________________________________________________\nvoid AliMLResponse::MLResponseInit() {\n \/\/\/ import config file from alien path\n string configPath = AliMLModelHandler::ImportFile(fConfigFilePath);\n YAML::Node nodeList;\n \/\/\/ manage wrong config file path\n try {\n nodeList = YAML::LoadFile(configPath);\n } catch (std::exception &e) {\n AliFatal(Form(\"Yaml-ccp error: %s! Exit\", e.what()));\n }\n \/\/\/ manage inconsistencies in config file\n CheckConfigFile(nodeList);\n\n fVariableNames = nodeList[\"VAR_NAMES\"].as<vector<string>>();\n fBins = nodeList[\"BINS\"].as<vector<float>>();\n fNBins = nodeList[\"N_MODELS\"].as<int>();\n fNVariables = nodeList[\"NUM_VAR\"].as<int>();\n fRaw = nodeList[\"RAW_SCORE\"].as<bool>();\n\n fBinsBegin = fBins.begin();\n\n for (const auto &model : nodeList[\"MODELS\"]) {\n fModels.push_back(AliMLModelHandler{model});\n }\n\n for (auto &model : fModels) {\n bool comp = model.CompileModel();\n if (!comp) {\n AliFatal(\"Error in model compilation! Exit\");\n }\n }\n}\n\n\/\/_______________________________________________________________________________\nint AliMLResponse::FindBin(double binvar) {\n vector<float>::iterator low;\n low = std::lower_bound(fBins.begin(), fBins.end(), binvar);\n return low - fBinsBegin;\n}\n\n\/\/_______________________________________________________________________________\ndouble AliMLResponse::Predict(double binvar, map<string, double> varmap) {\n if ((int)varmap.size() < fNVariables) {\n AliFatal(\"The variable map you provided to the predictor has a size smaller than the variable list size! Exit\");\n }\n\n vector<double> features;\n for (const auto &varname : fVariableNames) {\n if (varmap.find(varname) == varmap.end()) {\n AliFatal(Form(\"Variable |%s| not found in variable list provided in config! Exit\", varname.data()));\n }\n features.push_back(varmap[varname]);\n }\n\n int bin = FindBin(binvar);\n if (bin == 0 || bin == fNBins) {\n AliWarning(\"Binned variable outside range, no model available!\");\n return -999.;\n }\n\n return fModels[bin - 1].GetModel()->Predict(&features[0], fNVariables, fRaw);\n}\n\n\/\/________________________________________________________________\ndouble AliMLResponse::Predict(double binvar, vector<double> variables) {\n if ((int)variables.size() != fNVariables) {\n AliFatal(Form(\"Number of variables passed (%d) different from the one used in the model (%d)! Exit\", (int)variables.size(), fNVariables));\n }\n\n int bin = FindBin(binvar);\n if (bin == 0 || bin == fNBins) {\n AliWarning(\"Binned variable outside range, no model available!\");\n return -999.;\n }\n\n return fModels[bin - 1].GetModel()->Predict(&variables[0], fNVariables, fRaw);\n}\n\n\/\/________________________________________________________________\nbool AliMLResponse::IsSelected(double binvar, std::map<std::string, double> varmap) {\n double score{0.};\n return IsSelected(binvar, varmap, score);\n}\n\n\/\/________________________________________________________________\nbool AliMLResponse::IsSelected(double binvar, std::vector<double> variables) {\n double score{0.};\n return IsSelected(binvar, variables, score);\n}<|endoftext|>"} {"text":"<commit_before>#include \"BooleanCircuit.h\"\n\nextern \"C\" {\n#include \"provsql_utils.h\"\n#include <unistd.h>\n#include <math.h>\n}\n\n#include <cassert>\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <iostream>\n\nusing namespace std;\n\n\/\/ Has to be redefined because of name hiding\nunsigned BooleanCircuit::setGate(const uuid &u, BooleanGate type)\n{\n unsigned id = Circuit::setGate(u, type);\n if(type == BooleanGate::IN)\n inputs.insert(id);\n return id;\n}\n\nunsigned BooleanCircuit::setGate(const uuid &u, BooleanGate type, double p)\n{\n unsigned id = setGate(u, type);\n prob[id] = p;\n return id;\n}\n\nunsigned BooleanCircuit::addGate()\n{\n unsigned id=Circuit::addGate();\n prob.push_back(1);\n return id;\n}\n\nstd::string BooleanCircuit::toString(unsigned g) const\n{\n std::string op;\n string result;\n\n switch(gates[g]) {\n case BooleanGate::IN:\n if(prob[g]==0.) {\n return \"⊥\";\n } else if(prob[g]==1.) {\n return \"⊤\";\n } else {\n return to_string(g)+\"[\"+to_string(prob[g])+\"]\";\n }\n case BooleanGate::NOT:\n op=\"¬\";\n break;\n case BooleanGate::UNDETERMINED:\n op=\"?\";\n break;\n case BooleanGate::AND:\n op=\"∧\";\n break;\n case BooleanGate::OR:\n op=\"∨\";\n break;\n }\n\n if(wires[g].empty()) {\n if(gates[g]==BooleanGate::AND)\n return \"⊤\";\n else if(gates[g]==BooleanGate::OR)\n return \"⊥\";\n else return op;\n }\n\n for(auto s: wires[g]) {\n if(gates[g]==BooleanGate::NOT)\n result = op;\n else if(!result.empty())\n result+=\" \"+op+\" \";\n result+=toString(s);\n }\n\n return \"(\"+result+\")\";\n}\n\ndouble BooleanCircuit::dDNNFEvaluation(unsigned g) const\n{\n switch(gates[g]) {\n case BooleanGate::IN:\n return prob[g];\n case BooleanGate::NOT:\n return 1-prob[g];\n case BooleanGate::AND:\n break;\n case BooleanGate::OR:\n break;\n case BooleanGate::UNDETERMINED:\n throw CircuitException(\"Incorrect gate type\");\n }\n\n double result=(gates[g]==BooleanGate::AND?1:0);\n for(auto s: wires[g]) {\n double d = dDNNFEvaluation(s);\n if(gates[g]==BooleanGate::AND)\n result*=d;\n else\n result+=d;\n }\n\n return result;\n}\n\nbool BooleanCircuit::evaluate(unsigned g, const unordered_set<unsigned> &sampled) const\n{\n bool disjunction=false;\n\n switch(gates[g]) {\n case BooleanGate::IN:\n return sampled.find(g)!=sampled.end();\n case BooleanGate::NOT:\n return !evaluate(*(wires[g].begin()), sampled);\n case BooleanGate::AND:\n disjunction = false;\n break;\n case BooleanGate::OR:\n disjunction = true;\n break;\n case BooleanGate::UNDETERMINED:\n throw CircuitException(\"Incorrect gate type\");\n }\n\n for(auto s: wires[g]) {\n bool e = evaluate(s, sampled);\n if(disjunction && e)\n return true;\n if(!disjunction && !e)\n return false;\n }\n\n if(disjunction)\n return false;\n else\n return true;\n}\n\ndouble BooleanCircuit::monteCarlo(unsigned g, unsigned samples) const\n{\n unsigned success=0;\n\n for(unsigned i=0; i<samples; ++i) {\n unordered_set<unsigned> sampled;\n for(unsigned in : inputs) {\n if(rand() *1. \/ RAND_MAX < prob[in]) {\n sampled.insert(in);\n }\n }\n\n if(evaluate(g, sampled))\n ++success;\n \n if(provsql_interrupted)\n throw CircuitException(\"Interrupted after \"+to_string(i+1)+\" samples\");\n }\n\n return success*1.\/samples;\n}\n\ndouble BooleanCircuit::possibleWorlds(unsigned g) const\n{ \n if(inputs.size()>=8*sizeof(unsigned long long))\n throw CircuitException(\"Too many possible worlds to iterate over\");\n\n unsigned long long nb=(1<<inputs.size());\n double totalp=0.;\n\n for(unsigned long long i=0; i < nb; ++i) {\n unordered_set<unsigned> s;\n double p = 1;\n\n unsigned j=0;\n for(unsigned in : inputs) {\n if(i & (1 << j)) {\n s.insert(in);\n p*=prob[in];\n } else {\n p*=1-prob[in];\n }\n ++j;\n }\n\n if(evaluate(g, s))\n totalp+=p;\n \n if(provsql_interrupted)\n throw CircuitException(\"Interrupted\");\n }\n\n return totalp;\n}\n\nstd::string BooleanCircuit::Tseytin(unsigned g, bool display_prob=false) const {\n vector<vector<int>> clauses;\n \n \/\/ Tseytin transformation\n for(unsigned i=0; i<gates.size(); ++i) {\n switch(gates[i]) {\n case BooleanGate::AND:\n {\n int id=i+1;\n vector<int> c = {id};\n for(int s: wires[i]) {\n clauses.push_back({-id, s+1});\n c.push_back(-s-1);\n }\n clauses.push_back(c);\n break;\n }\n\n case BooleanGate::OR:\n {\n int id=i+1;\n vector<int> c = {-id};\n for(int s: wires[i]) {\n clauses.push_back({id, -s-1});\n c.push_back(s+1);\n }\n clauses.push_back(c);\n }\n break;\n\n case BooleanGate::NOT:\n {\n int id=i+1;\n int s=*wires[i].begin();\n clauses.push_back({-id,-s-1});\n clauses.push_back({id,s+1});\n break;\n }\n\n case BooleanGate::IN:\n case BooleanGate::UNDETERMINED:\n ;\n }\n }\n clauses.push_back({(int)g+1});\n\n int fd;\n char cfilename[] = \"\/tmp\/provsqlXXXXXX\";\n fd = mkstemp(cfilename);\n close(fd);\n\n string filename=cfilename;\n ofstream ofs(filename.c_str());\n\n ofs << \"p cnf \" << gates.size() << \" \" << clauses.size() << \"\\n\";\n\n for(unsigned i=0;i<clauses.size();++i) {\n for(int x : clauses[i]) {\n ofs << x << \" \";\n }\n ofs << \"0\\n\";\n }\n if(display_prob) {\n for(unsigned in : inputs) {\n ofs << \"w \" << (in+1) << \" \" << to_string(prob[in]) << \"\\n\";\n ofs << \"w -\" << (in+1) << \" \" << to_string(1. - prob[in]) << \"\\n\";\n }\n }\n\n ofs.close();\n\n return filename;\n}\n\ndouble BooleanCircuit::compilation(unsigned g, string compiler) const {\n string filename=BooleanCircuit::Tseytin(g);\n string outfilename=filename+\".nnf\";\n\n\/\/ throw CircuitException(\"filename: \"+filename);\n\n string cmdline=compiler+\" \";\n if(compiler==\"d4\") {\n cmdline+=filename+\" -out=\"+outfilename;\n } else if(compiler==\"c2d\") {\n cmdline+=\"-in \"+filename+\" -silent\";\n } else if(compiler==\"dsharp\") {\n cmdline+=\"-q -Fnnf \"+outfilename+\" \"+filename;\n } else {\n throw CircuitException(\"Unknown compiler '\"+compiler+\"'\");\n }\n\n int retvalue=system(cmdline.c_str());\n\n if(unlink(filename.c_str())) {\n throw CircuitException(\"Error removing \"+filename);\n }\n\n if(retvalue) \n throw CircuitException(\"Error executing \"+compiler);\n \n ifstream ifs(outfilename.c_str());\n\n string nnf;\n getline(ifs, nnf, ' ');\n\n if(nnf!=\"nnf\") \/\/ unsatisfiable formula\n return 0.;\n\n unsigned nb_nodes, foobar, nb_variables;\n ifs >> nb_nodes >> foobar >> nb_variables;\n\n BooleanCircuit dnnf;\n\n if(nb_variables!=gates.size())\n throw CircuitException(\"Unreadable d-DNNF (wrong number of variables: \" + to_string(nb_variables) +\" vs \" + to_string(gates.size()) + \")\");\n\n std::string line;\n getline(ifs,line);\n unsigned i=0;\n while(getline(ifs,line)) {\n stringstream ss(line);\n \n char c;\n ss >> c;\n\n if(c=='O') {\n int var, args;\n ss >> var >> args;\n unsigned id=dnnf.getGate(to_string(i));\n dnnf.setGate(to_string(i), BooleanGate::OR);\n int g;\n while(ss >> g) {\n unsigned id2=dnnf.getGate(to_string(g));\n dnnf.addWire(id,id2);\n }\n } else if(c=='A') {\n int args;\n ss >> args;\n unsigned id=dnnf.getGate(to_string(i));\n dnnf.setGate(to_string(i), BooleanGate::AND);\n int g;\n while(ss >> g) {\n unsigned id2=dnnf.getGate(to_string(g));\n dnnf.addWire(id,id2);\n }\n } else if(c=='L') {\n int leaf;\n ss >> leaf;\n if(gates[abs(leaf)-1]==BooleanGate::IN) {\n if(leaf<0) {\n dnnf.setGate(to_string(i), BooleanGate::IN, 1-prob[-leaf-1]);\n } else {\n dnnf.setGate(to_string(i), BooleanGate::IN, prob[leaf-1]);\n }\n } else\n dnnf.setGate(to_string(i), BooleanGate::IN, 1.);\n } else \n throw CircuitException(string(\"Unreadable d-DNNF (unknown node type: \")+c+\")\");\n\n ++i;\n }\n\n ifs.close();\n if(unlink(outfilename.c_str())) {\n throw CircuitException(\"Error removing \"+outfilename);\n }\n\n\/\/ throw CircuitException(toString(g) + \"\\n\" + dnnf.toString(dnnf.getGate(to_string(i-1))));\n\n return dnnf.dDNNFEvaluation(dnnf.getGate(to_string(i-1)));\n}\n\ndouble BooleanCircuit::WeightMC(unsigned g, string opt) const {\n string filename=BooleanCircuit::Tseytin(g, true);\n\n \/\/opt of the form 'delta;epsilon'\n stringstream ssopt(opt); \n string delta_s, epsilon_s;\n getline(ssopt, delta_s, ';');\n getline(ssopt, epsilon_s, ';');\n\n double delta = 0;\n try { \n delta=stod(delta_s); \n } catch (invalid_argument &e) {\n delta=0;\n }\n double epsilon = 0;\n try {\n epsilon=stod(epsilon_s);\n } catch (invalid_argument &e) {\n epsilon=0;\n }\n if(delta == 0) delta=0.2;\n if(epsilon == 0) epsilon=0.8;\n\n \/\/TODO calcul numIterations\n\n \/\/calcul pivotAC\n final double pivotAC=2*ceil(exp(3.\/2)*(1+1\/epsilon)*(1+1\/epsilon));\n\n string cmdline=\"weightmc --startIteration=0 --gaussuntil=400 --verbosity=0 --pivotAC=\"+to_string(pivotAC)+ \" \"+filename+\" > \"+filename+\".out\";\n\n int retvalue=system(cmdline.c_str());\n if(retvalue) {\n throw CircuitException(\"Error executing weightmc\");\n }\n\n \/\/parsing\n ifstream ifs((filename+\".out\").c_str());\n string line, prev_line;\n while(getline(ifs,line))\n prev_line=line;\n\n stringstream ss(prev_line);\n string result;\n ss >> result >> result >> result >> result >> result;\n \n istringstream iss(result);\n string val, exp;\n getline(iss, val, 'x');\n getline(iss, exp);\n double value=stod(val);\n exp=exp.substr(2);\n double exponent=stod(exp);\n double ret=value*(pow(2.0,exponent));\n\/\/ throw CircuitException(to_string(ret));\n\n if(unlink(filename.c_str())) {\n throw CircuitException(\"Error removing \"+filename);\n }\n\n if(unlink((filename+\".out\").c_str())) {\n throw CircuitException(\"Error removing \"+filename+\".out\");\n }\n\n return ret;\n}\n<commit_msg>Fix compilation<commit_after>#include \"BooleanCircuit.h\"\n\nextern \"C\" {\n#include \"provsql_utils.h\"\n#include <unistd.h>\n#include <math.h>\n}\n\n#include <cassert>\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <iostream>\n\nusing namespace std;\n\n\/\/ Has to be redefined because of name hiding\nunsigned BooleanCircuit::setGate(const uuid &u, BooleanGate type)\n{\n unsigned id = Circuit::setGate(u, type);\n if(type == BooleanGate::IN)\n inputs.insert(id);\n return id;\n}\n\nunsigned BooleanCircuit::setGate(const uuid &u, BooleanGate type, double p)\n{\n unsigned id = setGate(u, type);\n prob[id] = p;\n return id;\n}\n\nunsigned BooleanCircuit::addGate()\n{\n unsigned id=Circuit::addGate();\n prob.push_back(1);\n return id;\n}\n\nstd::string BooleanCircuit::toString(unsigned g) const\n{\n std::string op;\n string result;\n\n switch(gates[g]) {\n case BooleanGate::IN:\n if(prob[g]==0.) {\n return \"⊥\";\n } else if(prob[g]==1.) {\n return \"⊤\";\n } else {\n return to_string(g)+\"[\"+to_string(prob[g])+\"]\";\n }\n case BooleanGate::NOT:\n op=\"¬\";\n break;\n case BooleanGate::UNDETERMINED:\n op=\"?\";\n break;\n case BooleanGate::AND:\n op=\"∧\";\n break;\n case BooleanGate::OR:\n op=\"∨\";\n break;\n }\n\n if(wires[g].empty()) {\n if(gates[g]==BooleanGate::AND)\n return \"⊤\";\n else if(gates[g]==BooleanGate::OR)\n return \"⊥\";\n else return op;\n }\n\n for(auto s: wires[g]) {\n if(gates[g]==BooleanGate::NOT)\n result = op;\n else if(!result.empty())\n result+=\" \"+op+\" \";\n result+=toString(s);\n }\n\n return \"(\"+result+\")\";\n}\n\ndouble BooleanCircuit::dDNNFEvaluation(unsigned g) const\n{\n switch(gates[g]) {\n case BooleanGate::IN:\n return prob[g];\n case BooleanGate::NOT:\n return 1-prob[g];\n case BooleanGate::AND:\n break;\n case BooleanGate::OR:\n break;\n case BooleanGate::UNDETERMINED:\n throw CircuitException(\"Incorrect gate type\");\n }\n\n double result=(gates[g]==BooleanGate::AND?1:0);\n for(auto s: wires[g]) {\n double d = dDNNFEvaluation(s);\n if(gates[g]==BooleanGate::AND)\n result*=d;\n else\n result+=d;\n }\n\n return result;\n}\n\nbool BooleanCircuit::evaluate(unsigned g, const unordered_set<unsigned> &sampled) const\n{\n bool disjunction=false;\n\n switch(gates[g]) {\n case BooleanGate::IN:\n return sampled.find(g)!=sampled.end();\n case BooleanGate::NOT:\n return !evaluate(*(wires[g].begin()), sampled);\n case BooleanGate::AND:\n disjunction = false;\n break;\n case BooleanGate::OR:\n disjunction = true;\n break;\n case BooleanGate::UNDETERMINED:\n throw CircuitException(\"Incorrect gate type\");\n }\n\n for(auto s: wires[g]) {\n bool e = evaluate(s, sampled);\n if(disjunction && e)\n return true;\n if(!disjunction && !e)\n return false;\n }\n\n if(disjunction)\n return false;\n else\n return true;\n}\n\ndouble BooleanCircuit::monteCarlo(unsigned g, unsigned samples) const\n{\n unsigned success=0;\n\n for(unsigned i=0; i<samples; ++i) {\n unordered_set<unsigned> sampled;\n for(unsigned in : inputs) {\n if(rand() *1. \/ RAND_MAX < prob[in]) {\n sampled.insert(in);\n }\n }\n\n if(evaluate(g, sampled))\n ++success;\n \n if(provsql_interrupted)\n throw CircuitException(\"Interrupted after \"+to_string(i+1)+\" samples\");\n }\n\n return success*1.\/samples;\n}\n\ndouble BooleanCircuit::possibleWorlds(unsigned g) const\n{ \n if(inputs.size()>=8*sizeof(unsigned long long))\n throw CircuitException(\"Too many possible worlds to iterate over\");\n\n unsigned long long nb=(1<<inputs.size());\n double totalp=0.;\n\n for(unsigned long long i=0; i < nb; ++i) {\n unordered_set<unsigned> s;\n double p = 1;\n\n unsigned j=0;\n for(unsigned in : inputs) {\n if(i & (1 << j)) {\n s.insert(in);\n p*=prob[in];\n } else {\n p*=1-prob[in];\n }\n ++j;\n }\n\n if(evaluate(g, s))\n totalp+=p;\n \n if(provsql_interrupted)\n throw CircuitException(\"Interrupted\");\n }\n\n return totalp;\n}\n\nstd::string BooleanCircuit::Tseytin(unsigned g, bool display_prob=false) const {\n vector<vector<int>> clauses;\n \n \/\/ Tseytin transformation\n for(unsigned i=0; i<gates.size(); ++i) {\n switch(gates[i]) {\n case BooleanGate::AND:\n {\n int id=i+1;\n vector<int> c = {id};\n for(int s: wires[i]) {\n clauses.push_back({-id, s+1});\n c.push_back(-s-1);\n }\n clauses.push_back(c);\n break;\n }\n\n case BooleanGate::OR:\n {\n int id=i+1;\n vector<int> c = {-id};\n for(int s: wires[i]) {\n clauses.push_back({id, -s-1});\n c.push_back(s+1);\n }\n clauses.push_back(c);\n }\n break;\n\n case BooleanGate::NOT:\n {\n int id=i+1;\n int s=*wires[i].begin();\n clauses.push_back({-id,-s-1});\n clauses.push_back({id,s+1});\n break;\n }\n\n case BooleanGate::IN:\n case BooleanGate::UNDETERMINED:\n ;\n }\n }\n clauses.push_back({(int)g+1});\n\n int fd;\n char cfilename[] = \"\/tmp\/provsqlXXXXXX\";\n fd = mkstemp(cfilename);\n close(fd);\n\n string filename=cfilename;\n ofstream ofs(filename.c_str());\n\n ofs << \"p cnf \" << gates.size() << \" \" << clauses.size() << \"\\n\";\n\n for(unsigned i=0;i<clauses.size();++i) {\n for(int x : clauses[i]) {\n ofs << x << \" \";\n }\n ofs << \"0\\n\";\n }\n if(display_prob) {\n for(unsigned in : inputs) {\n ofs << \"w \" << (in+1) << \" \" << to_string(prob[in]) << \"\\n\";\n ofs << \"w -\" << (in+1) << \" \" << to_string(1. - prob[in]) << \"\\n\";\n }\n }\n\n ofs.close();\n\n return filename;\n}\n\ndouble BooleanCircuit::compilation(unsigned g, string compiler) const {\n string filename=BooleanCircuit::Tseytin(g);\n string outfilename=filename+\".nnf\";\n\n\/\/ throw CircuitException(\"filename: \"+filename);\n\n string cmdline=compiler+\" \";\n if(compiler==\"d4\") {\n cmdline+=filename+\" -out=\"+outfilename;\n } else if(compiler==\"c2d\") {\n cmdline+=\"-in \"+filename+\" -silent\";\n } else if(compiler==\"dsharp\") {\n cmdline+=\"-q -Fnnf \"+outfilename+\" \"+filename;\n } else {\n throw CircuitException(\"Unknown compiler '\"+compiler+\"'\");\n }\n\n int retvalue=system(cmdline.c_str());\n\n if(unlink(filename.c_str())) {\n throw CircuitException(\"Error removing \"+filename);\n }\n\n if(retvalue) \n throw CircuitException(\"Error executing \"+compiler);\n \n ifstream ifs(outfilename.c_str());\n\n string nnf;\n getline(ifs, nnf, ' ');\n\n if(nnf!=\"nnf\") \/\/ unsatisfiable formula\n return 0.;\n\n unsigned nb_nodes, foobar, nb_variables;\n ifs >> nb_nodes >> foobar >> nb_variables;\n\n BooleanCircuit dnnf;\n\n if(nb_variables!=gates.size())\n throw CircuitException(\"Unreadable d-DNNF (wrong number of variables: \" + to_string(nb_variables) +\" vs \" + to_string(gates.size()) + \")\");\n\n std::string line;\n getline(ifs,line);\n unsigned i=0;\n while(getline(ifs,line)) {\n stringstream ss(line);\n \n char c;\n ss >> c;\n\n if(c=='O') {\n int var, args;\n ss >> var >> args;\n unsigned id=dnnf.getGate(to_string(i));\n dnnf.setGate(to_string(i), BooleanGate::OR);\n int g;\n while(ss >> g) {\n unsigned id2=dnnf.getGate(to_string(g));\n dnnf.addWire(id,id2);\n }\n } else if(c=='A') {\n int args;\n ss >> args;\n unsigned id=dnnf.getGate(to_string(i));\n dnnf.setGate(to_string(i), BooleanGate::AND);\n int g;\n while(ss >> g) {\n unsigned id2=dnnf.getGate(to_string(g));\n dnnf.addWire(id,id2);\n }\n } else if(c=='L') {\n int leaf;\n ss >> leaf;\n if(gates[abs(leaf)-1]==BooleanGate::IN) {\n if(leaf<0) {\n dnnf.setGate(to_string(i), BooleanGate::IN, 1-prob[-leaf-1]);\n } else {\n dnnf.setGate(to_string(i), BooleanGate::IN, prob[leaf-1]);\n }\n } else\n dnnf.setGate(to_string(i), BooleanGate::IN, 1.);\n } else \n throw CircuitException(string(\"Unreadable d-DNNF (unknown node type: \")+c+\")\");\n\n ++i;\n }\n\n ifs.close();\n if(unlink(outfilename.c_str())) {\n throw CircuitException(\"Error removing \"+outfilename);\n }\n\n\/\/ throw CircuitException(toString(g) + \"\\n\" + dnnf.toString(dnnf.getGate(to_string(i-1))));\n\n return dnnf.dDNNFEvaluation(dnnf.getGate(to_string(i-1)));\n}\n\ndouble BooleanCircuit::WeightMC(unsigned g, string opt) const {\n string filename=BooleanCircuit::Tseytin(g, true);\n\n \/\/opt of the form 'delta;epsilon'\n stringstream ssopt(opt); \n string delta_s, epsilon_s;\n getline(ssopt, delta_s, ';');\n getline(ssopt, epsilon_s, ';');\n\n double delta = 0;\n try { \n delta=stod(delta_s); \n } catch (invalid_argument &e) {\n delta=0;\n }\n double epsilon = 0;\n try {\n epsilon=stod(epsilon_s);\n } catch (invalid_argument &e) {\n epsilon=0;\n }\n if(delta == 0) delta=0.2;\n if(epsilon == 0) epsilon=0.8;\n\n \/\/TODO calcul numIterations\n\n \/\/calcul pivotAC\n const double pivotAC=2*ceil(exp(3.\/2)*(1+1\/epsilon)*(1+1\/epsilon));\n\n string cmdline=\"weightmc --startIteration=0 --gaussuntil=400 --verbosity=0 --pivotAC=\"+to_string(pivotAC)+ \" \"+filename+\" > \"+filename+\".out\";\n\n int retvalue=system(cmdline.c_str());\n if(retvalue) {\n throw CircuitException(\"Error executing weightmc\");\n }\n\n \/\/parsing\n ifstream ifs((filename+\".out\").c_str());\n string line, prev_line;\n while(getline(ifs,line))\n prev_line=line;\n\n stringstream ss(prev_line);\n string result;\n ss >> result >> result >> result >> result >> result;\n \n istringstream iss(result);\n string val, exp;\n getline(iss, val, 'x');\n getline(iss, exp);\n double value=stod(val);\n exp=exp.substr(2);\n double exponent=stod(exp);\n double ret=value*(pow(2.0,exponent));\n\/\/ throw CircuitException(to_string(ret));\n\n if(unlink(filename.c_str())) {\n throw CircuitException(\"Error removing \"+filename);\n }\n\n if(unlink((filename+\".out\").c_str())) {\n throw CircuitException(\"Error removing \"+filename+\".out\");\n }\n\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixes to the ForceDistanceConstraint tag checking scheme<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n *\n * $Id$\n *\n * History:\n *\n * Bernd Wuebben, wuebben@math.cornell.edu:\n *\n * Much of this is taken from the pppd sources in particular\n * \/pppstat\/pppstat.c, and modified to suit the needs of kppp.\n *\n *\n * Here the original history of pppstat.c:\n *\n * perkins@cps.msu.edu: Added compression statistics and alternate\n * display. 11\/94\n *\n * Brad Parker (brad@cayman.com) 6\/92\n *\n * from the original \"slstats\" by Van Jaconson\n *\n * Copyright (c) 1989 Regents of the University of California.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms are permitted\n * provided that the above copyright notice and this paragraph are\n * duplicated in all such forms and that any documentation,\n * advertising materials, and other materials related to such\n * distribution and use acknowledge that the software was developed\n * by the University of California, Berkeley. The name of the\n * University may not be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\n *\tVan Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:\n *\t- Initial distribution.\n *\/\n\n#include \"pppstats.h\"\n\n#include <ctype.h>\n#include <errno.h>\n\n#include <stdio.h>\n#include <signal.h>\n#include <fcntl.h>\n#include <sys\/param.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <net\/ppp_defs.h>\n\n#ifndef STREAMS\n#if defined(__linux__) && defined(__powerpc__) \\\n && (__GLIBC__ == 2 && __GLIBC_MINOR__ == 0)\n\/* kludge alert! *\/\n#undef __GLIBC__\n#endif\n#include <sys\/socket.h>\t\t\/* *BSD, Linux, NeXT, Ultrix etc. *\/\n#ifndef HAVE_NET_IF_PPP_H\n#ifdef HAVE_LINUX_IF_PPP_H\n#include <linux\/if.h>\n#include <linux\/if_ppp.h>\n#endif\n#else\n#include <net\/if.h>\n#include <net\/if_ppp.h>\n#endif\n\n#else\t\/* STREAMS *\/\n#include <sys\/socket.h>\n#include <sys\/stropts.h>\t\/* SVR4, Solaris 2, SunOS 4, OSF\/1, etc. *\/\n#include <net\/ppp_defs.h>\n#include <net\/pppio.h>\n#include <net\/if.h>\n#include <sys\/sockio.h>\n\n#endif\t\/* STREAMS *\/\n\n#include <qtimer.h>\n#include <kdebug.h>\n#include \"pppstats.h\"\n\nPPPStats::PPPStats() {\n timer = new QTimer;\n connect(timer, SIGNAL(timeout()), SLOT(timerClick()));\n}\n\n\nPPPStats::~PPPStats() {\n stop();\n delete timer;\n}\n\n\nvoid PPPStats::timerClick() {\n enum IOStatus newStatus;\n\n doStats();\n\n if((ibytes != ibytes_last) && (obytes != obytes_last))\n newStatus = BytesBoth;\n else if(ibytes != ibytes_last)\n newStatus = BytesIn;\n else if(obytes != obytes_last)\n newStatus = BytesOut;\n else\n newStatus = BytesNone;\n\n if(newStatus != ioStatus)\n emit statsChanged(ioStatus = newStatus);\n\n ibytes_last = ibytes;\n obytes_last = obytes;\n}\n\nvoid PPPStats::setUnit(int u) {\n unit = u;\n sprintf(unitName, \"ppp%d\", unit);\n}\n\n\nvoid PPPStats::start() {\n timer->start(PPP_STATS_INTERVAL);\n}\n\n\nvoid PPPStats::stop() {\n emit statsChanged(BytesNone);\n timer->stop();\n}\n\n\nbool PPPStats::ifIsUp() {\n bool is_up;\n struct ifreq ifr;\n\n#if defined(__svr4__ )\n usleep(1000000); \/\/ Needed for Solaris ?!\n#endif\n\n#ifdef STREAMS\n if ((t = open(\"\/dev\/ppp\", O_RDONLY)) < 0) {\n\tperror(\"pppstats: Couldn't open \/dev\/ppp: \");\n\treturn false;\n }\n if (!strioctl(t, PPPIO_ATTACH, (char*)&unit, sizeof(int), 0)) {\n\tfprintf(stderr, \"pppstats: ppp%d is not available\\n\", unit);\n\t::close(t);\n\treturn false;\n }\n \/\/ TODO: close t somewhere again\n#endif\n if ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n\tperror(\"Couldn't create IP socket\");\n\treturn false;\n }\n\n strncpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if(ioctl(s, SIOCGIFFLAGS, (caddr_t) &ifr) < 0) {\n if (errno)\n fprintf(stderr, \"Couldn't find interface %s: %s\\n\",\n unitName, strerror(errno));\n\t::close(s);\n\ts = 0;\n\treturn 0;\n }\n\n if ((ifr.ifr_flags & (IFF_UP|IFF_RUNNING)) != 0) {\n\tis_up = true;\n\tkdDebug(5002) << \"Interface is up\" << endl;\n }\n else{\n is_up = false;\n ::close(s);\n s = 0;\n kdDebug(5002) << \"Interface is down\" << endl;\n }\n\n return is_up;\n}\n\n\nbool PPPStats::initStats() {\n\n struct sockaddr_in *sinp;\n struct ifreq ifr;\n\n ibytes = 0;\n ipackets = 0;\n ibytes_last = 0;\n obytes_last = 0;\n compressedin = 0;\n uncompressedin = 0;\n errorin = 0;\n obytes = 0;\n opackets = 0;\n compressed = 0;\n packetsunc = 0;\n packetsoutunc = 0;\n ioStatus = BytesNone;\n\n strcpy(ifr.ifr_name, unitName);\n\n if (ioctl(s, SIOCGIFADDR, &ifr) < 0) {\n }\n\n sinp = (struct sockaddr_in*)&ifr.ifr_addr;\n\n if(sinp->sin_addr.s_addr)\n local_ip_address = inet_ntoa(sinp->sin_addr);\n else\n local_ip_address = \"\";\n kdDebug(5002) << \"Local IP: \" << local_ip_address << endl;\n\n if (ioctl(s, SIOCGIFDSTADDR, &ifr) < 0)\n ;\n\n sinp = (struct sockaddr_in*)&ifr.ifr_dstaddr;\n\n if(sinp->sin_addr.s_addr)\n remote_ip_address = inet_ntoa(sinp->sin_addr);\n else\n remote_ip_address = \"\";\n kdDebug(5002) << \"Remote IP: \" << remote_ip_address << endl;\n\n return true;\n\n}\n\n\nbool PPPStats::doStats() {\n struct ppp_stats cur;\n\n if(! get_ppp_stats(&cur)){\n return false;\n }\n\n \/\/ \"in\" \"pack\" \"comp\" \"uncomp\" \"err\"\n \/\/ IN PACK VJCOMP VJUNC VJERR\n\n ibytes = cur.p.ppp_ibytes; \t\t\t\/\/ bytes received\n ipackets = cur.p.ppp_ipackets; \t\t\/\/ packets recieved\n compressedin = cur.vj.vjs_compressedin; \t\/\/ inbound compressed packets\n uncompressedin = cur.vj.vjs_uncompressedin; \/\/ inbound uncompressed packets\n errorin = cur.vj.vjs_errorin; \t\t\/\/receive errors\n\n \/\/ \"out\" \"pack\" \"comp\" \"uncomp\" \"ip\"\n \/\/ OUT PACK JCOMP VJUNC NON-VJ\n\n obytes = cur.p.ppp_obytes; \t\t \t\/\/ raw bytes sent\n opackets = cur.p.ppp_opackets; \t\t\/\/ packets sent\n compressed = cur.vj.vjs_compressed; \t\t\/\/outbound compressed packets\n\n \/\/ outbound packets - outbound compressed packets\n packetsunc = cur.vj.vjs_packets - cur.vj.vjs_compressed;\n\n \/\/ packets sent - oubount compressed\n packetsoutunc = cur.p.ppp_opackets - cur.vj.vjs_packets;\n\n return true;\n}\n\n\n#ifndef STREAMS\nbool PPPStats::get_ppp_stats(struct ppp_stats *curp){\n\n struct ifpppstatsreq req;\n\n if(s==0)\n return false;\n\n#ifdef __linux__\n req.stats_ptr = (caddr_t) &req.stats;\n sprintf(req.ifr__name, \"ppp%d\", unit);\n#else\n sprintf(req.ifr_name, \"ppp%d\", unit);\n#endif\n if (ioctl(s, SIOCGPPPSTATS, &req) < 0) {\n\tif (errno == ENOTTY)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"ioctl(SIOCGPPPSTATS)\");\n\treturn false;\n }\n *curp = req.stats;\n return true;\n}\n\n#else\t\/* STREAMS *\/\nbool PPPStats::get_ppp_stats( struct ppp_stats *curp){\n\n if (!strioctl(t, PPPIO_GETSTAT, (char*)curp, 0, sizeof(*curp))) {\n\tif (errno == EINVAL)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"pppstats: Couldn't get statistics\");\n\treturn false;\n }\n return true;\n}\n\nbool PPPStats::strioctl(int fd, int cmd, char* ptr, int ilen, int olen){\n\n struct strioctl str;\n\n str.ic_cmd = cmd;\n str.ic_timout = 0;\n str.ic_len = ilen;\n str.ic_dp = ptr;\n if (ioctl(fd, I_STR, &str) == -1)\n\treturn false;\n if (str.ic_len != olen)\n\tfprintf(stderr, \"strioctl: expected %d bytes, got %d for cmd %x\\n\",\n\t olen, str.ic_len, cmd);\n return true;\n}\n#endif \/* STREAMS *\/\n\n#include \"pppstats.moc\"\n\n<commit_msg>ignore<commit_after>\/*\n *\n * $Id$\n *\n * History:\n *\n * Bernd Wuebben, wuebben@math.cornell.edu:\n *\n * Much of this is taken from the pppd sources in particular\n * \/pppstat\/pppstat.c, and modified to suit the needs of kppp.\n *\n *\n * Here the original history of pppstat.c:\n *\n * perkins@cps.msu.edu: Added compression statistics and alternate\n * display. 11\/94\n *\n * Brad Parker (brad@cayman.com) 6\/92\n *\n * from the original \"slstats\" by Van Jaconson\n *\n * Copyright (c) 1989 Regents of the University of California.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms are permitted\n * provided that the above copyright notice and this paragraph are\n * duplicated in all such forms and that any documentation,\n * advertising materials, and other materials related to such\n * distribution and use acknowledge that the software was developed\n * by the University of California, Berkeley. The name of the\n * University may not be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\n *\tVan Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:\n *\t- Initial distribution.\n *\/\n\n\n#include <ctype.h>\n#include <errno.h>\n\n#include <stdio.h>\n#include <signal.h>\n#include <fcntl.h>\n#include <sys\/param.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <net\/ppp_defs.h>\n\n#ifndef STREAMS\n#if defined(__linux__) && defined(__powerpc__) \\\n && (__GLIBC__ == 2 && __GLIBC_MINOR__ == 0)\n\/* kludge alert! *\/\n#undef __GLIBC__\n#endif\n#include <sys\/socket.h>\t\t\/* *BSD, Linux, NeXT, Ultrix etc. *\/\n#ifndef HAVE_NET_IF_PPP_H\n#ifdef HAVE_LINUX_IF_PPP_H\n#include <linux\/if.h>\n#include <linux\/if_ppp.h>\n#endif\n#else\n#include <net\/if.h>\n#include <net\/if_ppp.h>\n#endif\n\n#else\t\/* STREAMS *\/\n#include <sys\/socket.h>\n#include <sys\/stropts.h>\t\/* SVR4, Solaris 2, SunOS 4, OSF\/1, etc. *\/\n#include <net\/ppp_defs.h>\n#include <net\/pppio.h>\n#include <net\/if.h>\n#include <sys\/sockio.h>\n\n#endif\t\/* STREAMS *\/\n\n#include <qtimer.h>\n#include <kdebug.h>\n\nPPPStats::PPPStats() {\n timer = new QTimer;\n connect(timer, SIGNAL(timeout()), SLOT(timerClick()));\n}\n\n\nPPPStats::~PPPStats() {\n stop();\n delete timer;\n}\n\n\nvoid PPPStats::timerClick() {\n enum IOStatus newStatus;\n\n doStats();\n\n if((ibytes != ibytes_last) && (obytes != obytes_last))\n newStatus = BytesBoth;\n else if(ibytes != ibytes_last)\n newStatus = BytesIn;\n else if(obytes != obytes_last)\n newStatus = BytesOut;\n else\n newStatus = BytesNone;\n\n if(newStatus != ioStatus)\n emit statsChanged(ioStatus = newStatus);\n\n ibytes_last = ibytes;\n obytes_last = obytes;\n}\n\nvoid PPPStats::setUnit(int u) {\n unit = u;\n sprintf(unitName, \"ppp%d\", unit);\n}\n\n\nvoid PPPStats::start() {\n timer->start(PPP_STATS_INTERVAL);\n}\n\n\nvoid PPPStats::stop() {\n emit statsChanged(BytesNone);\n timer->stop();\n}\n\n\nbool PPPStats::ifIsUp() {\n bool is_up;\n struct ifreq ifr;\n\n#if defined(__svr4__ )\n usleep(1000000); \/\/ Needed for Solaris ?!\n#endif\n\n#ifdef STREAMS\n if ((t = open(\"\/dev\/ppp\", O_RDONLY)) < 0) {\n\tperror(\"pppstats: Couldn't open \/dev\/ppp: \");\n\treturn false;\n }\n if (!strioctl(t, PPPIO_ATTACH, (char*)&unit, sizeof(int), 0)) {\n\tfprintf(stderr, \"pppstats: ppp%d is not available\\n\", unit);\n\t::close(t);\n\treturn false;\n }\n \/\/ TODO: close t somewhere again\n#endif\n if ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n\tperror(\"Couldn't create IP socket\");\n\treturn false;\n }\n\n strncpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if(ioctl(s, SIOCGIFFLAGS, (caddr_t) &ifr) < 0) {\n if (errno)\n fprintf(stderr, \"Couldn't find interface %s: %s\\n\",\n unitName, strerror(errno));\n\t::close(s);\n\ts = 0;\n\treturn 0;\n }\n\n if ((ifr.ifr_flags & (IFF_UP|IFF_RUNNING)) != 0) {\n\tis_up = true;\n\tkdDebug(5002) << \"Interface is up\" << endl;\n }\n else{\n is_up = false;\n ::close(s);\n s = 0;\n kdDebug(5002) << \"Interface is down\" << endl;\n }\n\n return is_up;\n}\n\n\nbool PPPStats::initStats() {\n\n struct sockaddr_in *sinp;\n struct ifreq ifr;\n\n ibytes = 0;\n ipackets = 0;\n ibytes_last = 0;\n obytes_last = 0;\n compressedin = 0;\n uncompressedin = 0;\n errorin = 0;\n obytes = 0;\n opackets = 0;\n compressed = 0;\n packetsunc = 0;\n packetsoutunc = 0;\n ioStatus = BytesNone;\n\n strcpy(ifr.ifr_name, unitName);\n\n if (ioctl(s, SIOCGIFADDR, &ifr) < 0) {\n }\n\n sinp = (struct sockaddr_in*)&ifr.ifr_addr;\n\n if(sinp->sin_addr.s_addr)\n local_ip_address = inet_ntoa(sinp->sin_addr);\n else\n local_ip_address = \"\";\n kdDebug(5002) << \"Local IP: \" << local_ip_address << endl;\n\n if (ioctl(s, SIOCGIFDSTADDR, &ifr) < 0)\n ;\n\n sinp = (struct sockaddr_in*)&ifr.ifr_dstaddr;\n\n if(sinp->sin_addr.s_addr)\n remote_ip_address = inet_ntoa(sinp->sin_addr);\n else\n remote_ip_address = \"\";\n kdDebug(5002) << \"Remote IP: \" << remote_ip_address << endl;\n\n return true;\n\n}\n\n\nbool PPPStats::doStats() {\n struct ppp_stats cur;\n\n if(! get_ppp_stats(&cur)){\n return false;\n }\n\n \/\/ \"in\" \"pack\" \"comp\" \"uncomp\" \"err\"\n \/\/ IN PACK VJCOMP VJUNC VJERR\n\n ibytes = cur.p.ppp_ibytes; \t\t\t\/\/ bytes received\n ipackets = cur.p.ppp_ipackets; \t\t\/\/ packets recieved\n compressedin = cur.vj.vjs_compressedin; \t\/\/ inbound compressed packets\n uncompressedin = cur.vj.vjs_uncompressedin; \/\/ inbound uncompressed packets\n errorin = cur.vj.vjs_errorin; \t\t\/\/receive errors\n\n \/\/ \"out\" \"pack\" \"comp\" \"uncomp\" \"ip\"\n \/\/ OUT PACK JCOMP VJUNC NON-VJ\n\n obytes = cur.p.ppp_obytes; \t\t \t\/\/ raw bytes sent\n opackets = cur.p.ppp_opackets; \t\t\/\/ packets sent\n compressed = cur.vj.vjs_compressed; \t\t\/\/outbound compressed packets\n\n \/\/ outbound packets - outbound compressed packets\n packetsunc = cur.vj.vjs_packets - cur.vj.vjs_compressed;\n\n \/\/ packets sent - oubount compressed\n packetsoutunc = cur.p.ppp_opackets - cur.vj.vjs_packets;\n\n return true;\n}\n\n\n#ifndef STREAMS\nbool PPPStats::get_ppp_stats(struct ppp_stats *curp){\n\n struct ifpppstatsreq req;\n\n if(s==0)\n return false;\n\n#ifdef __linux__\n req.stats_ptr = (caddr_t) &req.stats;\n sprintf(req.ifr__name, \"ppp%d\", unit);\n#else\n sprintf(req.ifr_name, \"ppp%d\", unit);\n#endif\n if (ioctl(s, SIOCGPPPSTATS, &req) < 0) {\n\tif (errno == ENOTTY)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"ioctl(SIOCGPPPSTATS)\");\n\treturn false;\n }\n *curp = req.stats;\n return true;\n}\n\n#else\t\/* STREAMS *\/\nbool PPPStats::get_ppp_stats( struct ppp_stats *curp){\n\n if (!strioctl(t, PPPIO_GETSTAT, (char*)curp, 0, sizeof(*curp))) {\n\tif (errno == EINVAL)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"pppstats: Couldn't get statistics\");\n\treturn false;\n }\n return true;\n}\n\nbool PPPStats::strioctl(int fd, int cmd, char* ptr, int ilen, int olen){\n\n struct strioctl str;\n\n str.ic_cmd = cmd;\n str.ic_timout = 0;\n str.ic_len = ilen;\n str.ic_dp = ptr;\n if (ioctl(fd, I_STR, &str) == -1)\n\treturn false;\n if (str.ic_len != olen)\n\tfprintf(stderr, \"strioctl: expected %d bytes, got %d for cmd %x\\n\",\n\t olen, str.ic_len, cmd);\n return true;\n}\n#endif \/* STREAMS *\/\n\n#include \"pppstats.moc\"\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of KOrganizer.\n Copyright (c) 1998 Barry D Benowitz\n Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include <unistd.h>\n#include <stdio.h>\n\n#include <klocale.h>\n#include <kstandarddirs.h>\n#include <kdebug.h>\n#include <kmessagebox.h>\n#include <kurl.h>\n#include <kapplication.h>\n#include <dcopclient.h>\n#include <kprocess.h>\n\n#include <libkcal\/event.h>\n#include <libkcal\/todo.h>\n\n#include \"version.h\"\n#include \"koprefs.h\"\n\n#include \"komailclient.h\"\n\nKOMailClient::KOMailClient()\n{\n}\n\nKOMailClient::~KOMailClient()\n{\n}\n\nbool KOMailClient::mailAttendees(IncidenceBase *incidence,const QString &attachment)\n{\n Attendee::List attendees = incidence->attendees();\n if (attendees.count() == 0) return false;\n\n QString to;\n for(uint i=0; i<attendees.count();++i) {\n to += (*attendees.at(i))->email();\n if (i != attendees.count()-1) to += \", \";\n }\n\n QString from = KOPrefs::instance()->email();\n\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Object\";\n }\n\n QString body = createBody(incidence);\n\n bool bcc = KOPrefs::instance()->mBcc;\n\n return send(from,to,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::mailOrganizer(IncidenceBase *incidence,const QString &attachment)\n{\n QString to = incidence->organizer();\n\n QString from = KOPrefs::instance()->email();\n\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Message\";\n }\n\n QString body = createBody(incidence);\n\n bool bcc = KOPrefs::instance()->mBcc;\n\n return send(from,to,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::mailTo(IncidenceBase *incidence,const QString &recipients,\n const QString &attachment)\n{\n QString from = KOPrefs::instance()->email();\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Message\";\n }\n QString body = createBody(incidence);\n bool bcc = KOPrefs::instance()->mBcc;\n kdDebug () << \"KOMailClient::mailTo \" << recipients << endl;\n return send(from,recipients,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::send(const QString &from,const QString &to,\n const QString &subject,const QString &body,bool bcc,\n const QString &attachment)\n{\n kdDebug(5850) << \"KOMailClient::sendMail():\\nFrom: \" << from << \"\\nTo: \" << to\n << \"\\nSubject: \" << subject << \"\\nBody: \\n\" << body\n << \"\\nAttachment:\\n\" << attachment << endl;\n\n if (KOPrefs::instance()->mMailClient == KOPrefs::MailClientSendmail) {\n bool needHeaders = true;\n\n QString command = KStandardDirs::findExe(QString::fromLatin1(\"sendmail\"),\n QString::fromLatin1(\"\/sbin:\/usr\/sbin:\/usr\/lib\"));\n if (!command.isNull()) command += QString::fromLatin1(\" -oi -t\");\n else {\n command = KStandardDirs::findExe(QString::fromLatin1(\"mail\"));\n if (command.isNull()) return false; \/\/ give up\n\n command.append(QString::fromLatin1(\" -s \"));\n command.append(KProcess::quote(subject));\n\n if (bcc) {\n command.append(QString::fromLatin1(\" -b \"));\n command.append(KProcess::quote(from));\n }\n\n command.append(\" \");\n command.append(KProcess::quote(to));\n\n needHeaders = false;\n }\n\n FILE * fd = popen(command.local8Bit(),\"w\");\n if (!fd)\n {\n kdError() << \"Unable to open a pipe to \" << command << endl;\n return false;\n }\n\n QString textComplete;\n if (needHeaders)\n {\n textComplete += QString::fromLatin1(\"From: \") + from + '\\n';\n textComplete += QString::fromLatin1(\"To: \") + to + '\\n';\n if (bcc) textComplete += QString::fromLatin1(\"Bcc: \") + from + '\\n';\n textComplete += QString::fromLatin1(\"Subject: \") + subject + '\\n';\n textComplete += QString::fromLatin1(\"X-Mailer: KOrganizer\") + korgVersion + '\\n'; \n }\n textComplete += '\\n'; \/\/ end of headers\n textComplete += body;\n textComplete += '\\n';\n textComplete += attachment;\n\n fwrite(textComplete.local8Bit(),textComplete.length(),1,fd);\n\n pclose(fd);\n } else {\n if (!kapp->dcopClient()->isApplicationRegistered(\"kmail\")) {\n\t\t\tif (KApplication::startServiceByDesktopName(\"kmail\")) {\n KMessageBox::error(0,i18n(\"No running instance of KMail found.\"));\n return false;\n\t\t\t}\n }\n\n if (attachment.isEmpty()) {\n if (!kMailOpenComposer(to,\"\",from,subject,body,0,KURL())) return false;\n } else {\n QString meth;\n int idx = attachment.find(\"METHOD\");\n if (idx>=0) {\n idx = attachment.find(':',idx)+1;\n meth = attachment.mid(idx,attachment.find('\\n',idx)-idx);\n\tmeth = meth.lower();\n } else {\n meth = \"publish\";\n }\n if (!kMailOpenComposer(to,\"\",from,subject,body,0,\"cal.ics\",\"7bit\",\n attachment.utf8(),\"text\",\"calendar\",\"method\",meth,\n \"attachment\")) return false;\n }\n }\n return true;\n}\n\nint KOMailClient::kMailOpenComposer(const QString& arg0,const QString& arg1,\n const QString& arg2,const QString& arg3,const QString& arg4,int arg5,\n const KURL& arg6)\n{\n int result = 0;\n\n QByteArray data, replyData;\n QCString replyType;\n QDataStream arg( data, IO_WriteOnly );\n arg << arg0;\n arg << arg1;\n arg << arg2;\n arg << arg3;\n arg << arg4;\n arg << arg5;\n arg << arg6;\n if (kapp->dcopClient()->call(\"kmail\",\"KMailIface\",\"openComposer(QString,QString,QString,QString,QString,int,KURL)\", data, replyType, replyData ) ) {\n if ( replyType == \"int\" ) {\n QDataStream _reply_stream( replyData, IO_ReadOnly );\n _reply_stream >> result;\n } else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n } else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n return result;\n}\n\nint KOMailClient::kMailOpenComposer( const QString& arg0, const QString& arg1,\n const QString& arg2, const QString& arg3,\n const QString& arg4, int arg5, const QString& arg6,\n const QCString& arg7, const QCString& arg8,\n const QCString& arg9, const QCString& arg10,\n const QCString& arg11, const QString& arg12,\n const QCString& arg13 )\n{\n int result = 0;\n\n QByteArray data, replyData;\n QCString replyType;\n QDataStream arg( data, IO_WriteOnly );\n arg << arg0;\n arg << arg1;\n arg << arg2;\n arg << arg3;\n arg << arg4;\n arg << arg5;\n arg << arg6;\n arg << arg7;\n arg << arg8;\n arg << arg9;\n arg << arg10;\n arg << arg11;\n arg << arg12;\n arg << arg13;\n if ( kapp->dcopClient()->call(\"kmail\",\"KMailIface\",\"openComposer(QString,QString,QString,QString,QString,int,QString,QCString,QCString,QCString,QCString,QCString,QString,QCString)\", data, replyType, replyData ) ) {\n\tif ( replyType == \"int\" ) {\n\t QDataStream _reply_stream( replyData, IO_ReadOnly );\n\t _reply_stream >> result;\n\t} else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n\t}\n } else { \n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n return result;\n}\n\n\nQString KOMailClient::createBody(IncidenceBase *incidence)\n{\n QString CR = (\"\\n\");\n\n QString body;\n\n \/\/ mailbody for Event\n if (incidence->type()==\"Event\") {\n Event *selectedEvent = static_cast<Event *>(incidence);\n QString recurrence[]= {i18n(\"no recurrence\", \"None\"),i18n(\"Daily\"),i18n(\"Weekly\"),i18n(\"Monthly Same Day\"),\n i18n(\"Monthly Same Position\"),i18n(\"Yearly\"),i18n(\"Yearly\")};\n \n if (!selectedEvent->organizer().isEmpty()) {\n body += i18n(\"Organizer: %1\").arg(selectedEvent->organizer());\n body += CR;\n }\n body += i18n(\"Summary: %1\").arg(selectedEvent->summary());\n if (!selectedEvent->location().isEmpty()) {\n body += CR;\n body += i18n(\"Location: %1\").arg(selectedEvent->location());\n }\n if (!selectedEvent->doesFloat()) {\n body += CR;\n body += i18n(\"Start Date: %1\").arg(selectedEvent->dtStartDateStr());\n body += CR;\n body += i18n(\"Start Time: %1\").arg(selectedEvent->dtStartTimeStr());\n body += CR;\n if (selectedEvent->recurrence()->doesRecur()) {\n body += i18n(\"Recurs: %1\")\n .arg(recurrence[selectedEvent->recurrence()->frequency()]);\n body += CR;\n if (selectedEvent->recurrence()->duration() > 0 ) {\n body += i18n (\"Repeats %1 times\")\n .arg(QString::number(selectedEvent->recurrence()->duration()));\n body += CR;\n } else {\n if (selectedEvent->recurrence()->duration() != -1) {\n body += i18n(\"End Date: %1\")\n .arg(selectedEvent->recurrence()->endDateStr());\n body += CR;\n } else {\n body += i18n(\"Repeats forever\");\n body += CR;\n }\n }\n }\n body += i18n(\"End Time: %1\").arg(selectedEvent->dtEndTimeStr());\n body += CR;\n QString details = selectedEvent->description();\n if (!details.isEmpty()) {\n body += i18n(\"Details:\");\n\tbody += CR;\n\tbody += details;\n }\n }\n } \n\n \/\/ mailbody for Todo\n if (incidence->type()==\"Todo\") {\n Todo *selectedEvent = static_cast<Todo *>(incidence);\n if (!selectedEvent->organizer().isEmpty()) {\n body += i18n(\"Organizer: %1\").arg(selectedEvent->organizer());\n body += CR;\n }\n body += i18n(\"Summary: %1\").arg(selectedEvent->summary());\n if (!selectedEvent->location().isEmpty()) {\n body += CR;\n body += i18n(\"Location: %1\").arg(selectedEvent->location());\n }\n if (!selectedEvent->hasStartDate()) {\n body += CR;\n body += i18n(\"Start Date: %1\").arg(selectedEvent->dtStartDateStr());\n body += CR;\n if (!selectedEvent->doesFloat()) {\n\tbody += i18n(\"Start Time: %1\").arg(selectedEvent->dtStartTimeStr());\n\tbody += CR;\n }\n }\n if (!selectedEvent->hasDueDate()) {\n body += CR;\n body += i18n(\"Due Date: %1\").arg(selectedEvent->dtDueDateStr());\n body += CR;\n if (!selectedEvent->doesFloat()) {\n\tbody += i18n(\"Due Time: %1\").arg(selectedEvent->dtDueTimeStr());\n\tbody += CR;\n }\n }\n body += CR;\n QString details = selectedEvent->description();\n if (!details.isEmpty()) {\n body += i18n(\"Details:\");\n body += CR;\n body += details;\n }\n } \n\n \/\/ mailbody for FreeBusy\n if(incidence->type()==\"FreeBusy\") {\n body = i18n(\"This is a Free Busy Object\");\n } \n\n \/\/ mailbody for Journal\n if(incidence->type()==\"Journal\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n body = inc->summary();\n body += CR;\n body += inc->description();\n }\n\n return body;\n}\n<commit_msg>Fixed the mails sent with group scheduling. First, the recurrence type used the wrong variable, and also wrong array values for the strings (bug #62352) Second, todos used wrong conditions to check for due and start date (bug #60273)<commit_after>\/*\n This file is part of KOrganizer.\n Copyright (c) 1998 Barry D Benowitz\n Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include <unistd.h>\n#include <stdio.h>\n\n#include <klocale.h>\n#include <kstandarddirs.h>\n#include <kdebug.h>\n#include <kmessagebox.h>\n#include <kurl.h>\n#include <kapplication.h>\n#include <dcopclient.h>\n#include <kprocess.h>\n\n#include <libkcal\/event.h>\n#include <libkcal\/todo.h>\n\n#include \"version.h\"\n#include \"koprefs.h\"\n\n#include \"komailclient.h\"\n\nKOMailClient::KOMailClient()\n{\n}\n\nKOMailClient::~KOMailClient()\n{\n}\n\nbool KOMailClient::mailAttendees(IncidenceBase *incidence,const QString &attachment)\n{\n Attendee::List attendees = incidence->attendees();\n if (attendees.count() == 0) return false;\n\n QString to;\n for(uint i=0; i<attendees.count();++i) {\n to += (*attendees.at(i))->email();\n if (i != attendees.count()-1) to += \", \";\n }\n\n QString from = KOPrefs::instance()->email();\n\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Object\";\n }\n\n QString body = createBody(incidence);\n\n bool bcc = KOPrefs::instance()->mBcc;\n\n return send(from,to,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::mailOrganizer(IncidenceBase *incidence,const QString &attachment)\n{\n QString to = incidence->organizer();\n\n QString from = KOPrefs::instance()->email();\n\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Message\";\n }\n\n QString body = createBody(incidence);\n\n bool bcc = KOPrefs::instance()->mBcc;\n\n return send(from,to,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::mailTo(IncidenceBase *incidence,const QString &recipients,\n const QString &attachment)\n{\n QString from = KOPrefs::instance()->email();\n QString subject;\n if(incidence->type()!=\"FreeBusy\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n subject = inc->summary();\n } else {\n subject = \"Free Busy Message\";\n }\n QString body = createBody(incidence);\n bool bcc = KOPrefs::instance()->mBcc;\n kdDebug () << \"KOMailClient::mailTo \" << recipients << endl;\n return send(from,recipients,subject,body,bcc,attachment);\n}\n\nbool KOMailClient::send(const QString &from,const QString &to,\n const QString &subject,const QString &body,bool bcc,\n const QString &attachment)\n{\n kdDebug(5850) << \"KOMailClient::sendMail():\\nFrom: \" << from << \"\\nTo: \" << to\n << \"\\nSubject: \" << subject << \"\\nBody: \\n\" << body\n << \"\\nAttachment:\\n\" << attachment << endl;\n\n if (KOPrefs::instance()->mMailClient == KOPrefs::MailClientSendmail) {\n bool needHeaders = true;\n\n QString command = KStandardDirs::findExe(QString::fromLatin1(\"sendmail\"),\n QString::fromLatin1(\"\/sbin:\/usr\/sbin:\/usr\/lib\"));\n if (!command.isNull()) command += QString::fromLatin1(\" -oi -t\");\n else {\n command = KStandardDirs::findExe(QString::fromLatin1(\"mail\"));\n if (command.isNull()) return false; \/\/ give up\n\n command.append(QString::fromLatin1(\" -s \"));\n command.append(KProcess::quote(subject));\n\n if (bcc) {\n command.append(QString::fromLatin1(\" -b \"));\n command.append(KProcess::quote(from));\n }\n\n command.append(\" \");\n command.append(KProcess::quote(to));\n\n needHeaders = false;\n }\n\n FILE * fd = popen(command.local8Bit(),\"w\");\n if (!fd)\n {\n kdError() << \"Unable to open a pipe to \" << command << endl;\n return false;\n }\n\n QString textComplete;\n if (needHeaders)\n {\n textComplete += QString::fromLatin1(\"From: \") + from + '\\n';\n textComplete += QString::fromLatin1(\"To: \") + to + '\\n';\n if (bcc) textComplete += QString::fromLatin1(\"Bcc: \") + from + '\\n';\n textComplete += QString::fromLatin1(\"Subject: \") + subject + '\\n';\n textComplete += QString::fromLatin1(\"X-Mailer: KOrganizer\") + korgVersion + '\\n';\n }\n textComplete += '\\n'; \/\/ end of headers\n textComplete += body;\n textComplete += '\\n';\n textComplete += attachment;\n\n fwrite(textComplete.local8Bit(),textComplete.length(),1,fd);\n\n pclose(fd);\n } else {\n if (!kapp->dcopClient()->isApplicationRegistered(\"kmail\")) {\n\t\t\tif (KApplication::startServiceByDesktopName(\"kmail\")) {\n KMessageBox::error(0,i18n(\"No running instance of KMail found.\"));\n return false;\n\t\t\t}\n }\n\n if (attachment.isEmpty()) {\n if (!kMailOpenComposer(to,\"\",from,subject,body,0,KURL())) return false;\n } else {\n QString meth;\n int idx = attachment.find(\"METHOD\");\n if (idx>=0) {\n idx = attachment.find(':',idx)+1;\n meth = attachment.mid(idx,attachment.find('\\n',idx)-idx);\n\tmeth = meth.lower();\n } else {\n meth = \"publish\";\n }\n if (!kMailOpenComposer(to,\"\",from,subject,body,0,\"cal.ics\",\"7bit\",\n attachment.utf8(),\"text\",\"calendar\",\"method\",meth,\n \"attachment\")) return false;\n }\n }\n return true;\n}\n\nint KOMailClient::kMailOpenComposer(const QString& arg0,const QString& arg1,\n const QString& arg2,const QString& arg3,const QString& arg4,int arg5,\n const KURL& arg6)\n{\n int result = 0;\n\n QByteArray data, replyData;\n QCString replyType;\n QDataStream arg( data, IO_WriteOnly );\n arg << arg0;\n arg << arg1;\n arg << arg2;\n arg << arg3;\n arg << arg4;\n arg << arg5;\n arg << arg6;\n if (kapp->dcopClient()->call(\"kmail\",\"KMailIface\",\"openComposer(QString,QString,QString,QString,QString,int,KURL)\", data, replyType, replyData ) ) {\n if ( replyType == \"int\" ) {\n QDataStream _reply_stream( replyData, IO_ReadOnly );\n _reply_stream >> result;\n } else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n } else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n return result;\n}\n\nint KOMailClient::kMailOpenComposer( const QString& arg0, const QString& arg1,\n const QString& arg2, const QString& arg3,\n const QString& arg4, int arg5, const QString& arg6,\n const QCString& arg7, const QCString& arg8,\n const QCString& arg9, const QCString& arg10,\n const QCString& arg11, const QString& arg12,\n const QCString& arg13 )\n{\n int result = 0;\n\n QByteArray data, replyData;\n QCString replyType;\n QDataStream arg( data, IO_WriteOnly );\n arg << arg0;\n arg << arg1;\n arg << arg2;\n arg << arg3;\n arg << arg4;\n arg << arg5;\n arg << arg6;\n arg << arg7;\n arg << arg8;\n arg << arg9;\n arg << arg10;\n arg << arg11;\n arg << arg12;\n arg << arg13;\n if ( kapp->dcopClient()->call(\"kmail\",\"KMailIface\",\"openComposer(QString,QString,QString,QString,QString,int,QString,QCString,QCString,QCString,QCString,QCString,QString,QCString)\", data, replyType, replyData ) ) {\n\tif ( replyType == \"int\" ) {\n\t QDataStream _reply_stream( replyData, IO_ReadOnly );\n\t _reply_stream >> result;\n\t} else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n\t}\n } else {\n kdDebug(5850) << \"kMailOpenComposer() call failed.\" << endl;\n }\n return result;\n}\n\n\nQString KOMailClient::createBody(IncidenceBase *incidence)\n{\n QString CR = (\"\\n\");\n\n QString body;\n\n \/\/ mailbody for Event\n if (incidence->type()==\"Event\") {\n Event *selectedEvent = static_cast<Event *>(incidence);\n QString recurrence[]= {i18n(\"no recurrence\", \"None\"),\n i18n(\"Minutely\"), i18n(\"Hourly\"), i18n(\"Daily\"),\n i18n(\"Weekly\"), i18n(\"Monthly Same Day\"), i18n(\"Monthly Same Position\"),\n i18n(\"Yearly\"), i18n(\"Yearly\"), i18n(\"Yearly\")};\n\n if (!selectedEvent->organizer().isEmpty()) {\n body += i18n(\"Organizer: %1\").arg(selectedEvent->organizer());\n body += CR;\n }\n body += i18n(\"Summary: %1\").arg(selectedEvent->summary());\n body += CR;\n if (!selectedEvent->location().isEmpty()) {\n body += i18n(\"Location: %1\").arg(selectedEvent->location());\n body += CR;\n }\n body += i18n(\"Start Date: %1\").arg(selectedEvent->dtStartDateStr());\n body += CR;\n if (!selectedEvent->doesFloat()) {\n body += i18n(\"Start Time: %1\").arg(selectedEvent->dtStartTimeStr());\n body += CR;\n }\n if ( selectedEvent->dtStart()!=selectedEvent->dtEnd() ) {\n body += i18n(\"End Date: %1\").arg(selectedEvent->dtEndDateStr());\n body += CR;\n }\n if (!selectedEvent->doesFloat()) {\n body += i18n(\"End Time: %1\").arg(selectedEvent->dtEndTimeStr());\n body += CR;\n }\n if (selectedEvent->recurrence()->doesRecur()) {\n body += i18n(\"Recurs: %1\")\n .arg(recurrence[selectedEvent->recurrence()->doesRecur()]);\n body += CR;\n\/* TODO: frequency\n body += i18n(\"Frequency: %1\")\n .arg(recurrence[selectedEvent->recurrence()->frequency()]);\n body += CR;\n*\/\n if (selectedEvent->recurrence()->duration() > 0 ) {\n body += i18n (\"Repeats %1 times\")\n .arg(QString::number(selectedEvent->recurrence()->duration()));\n body += CR;\n } else {\n if (selectedEvent->recurrence()->duration() != -1) {\n\/\/ body += i18n(\"Repeat until: %1\")\n body += i18n(\"End Date: %1\")\n .arg(selectedEvent->recurrence()->endDateStr());\n body += CR;\n } else {\n body += i18n(\"Repeats forever\");\n body += CR;\n }\n }\n }\n QString details = selectedEvent->description();\n if (!details.isEmpty()) {\n body += i18n(\"Details:\");\n body += CR;\n body += details;\n body += CR;\n }\n }\n\n \/\/ mailbody for Todo\n if (incidence->type()==\"Todo\") {\n Todo *selectedEvent = static_cast<Todo *>(incidence);\n if (!selectedEvent->organizer().isEmpty()) {\n body += i18n(\"Organizer: %1\").arg(selectedEvent->organizer());\n body += CR;\n }\n body += i18n(\"Summary: %1\").arg(selectedEvent->summary());\n body += CR;\n if (!selectedEvent->location().isEmpty()) {\n body += i18n(\"Location: %1\").arg(selectedEvent->location());\n body += CR;\n }\n if (selectedEvent->hasStartDate()) {\n body += i18n(\"Start Date: %1\").arg(selectedEvent->dtStartDateStr());\n body += CR;\n if (!selectedEvent->doesFloat()) {\n body += i18n(\"Start Time: %1\").arg(selectedEvent->dtStartTimeStr());\n body += CR;\n }\n }\n if (selectedEvent->hasDueDate()) {\n body += i18n(\"Due Date: %1\").arg(selectedEvent->dtDueDateStr());\n body += CR;\n if (!selectedEvent->doesFloat()) {\n body += i18n(\"Due Time: %1\").arg(selectedEvent->dtDueTimeStr());\n body += CR;\n }\n }\n QString details = selectedEvent->description();\n if (!details.isEmpty()) {\n body += i18n(\"Details:\");\n body += CR;\n body += details;\n body += CR;\n }\n }\n\n \/\/ mailbody for FreeBusy\n if(incidence->type()==\"FreeBusy\") {\n body = i18n(\"This is a Free Busy Object\");\n }\n\n \/\/ mailbody for Journal\n if(incidence->type()==\"Journal\") {\n Incidence *inc = static_cast<Incidence *>(incidence);\n body = inc->summary();\n body += CR;\n body += inc->description();\n body += CR;\n }\n\n return body;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS icuupgrade (1.11.8); FILE MERGED 2006\/11\/14 20:40:31 khong 1.11.8.3: RESYNC: (1.12-1.13); FILE MERGED 2006\/10\/11 06:08:49 khong 1.11.8.2: RESYNC: (1.11-1.12); FILE MERGED 2006\/08\/04 12:25:56 er 1.11.8.1: #i60645# warnings guards for some ICU header files<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"ContextGDIPlus.h\"\n\n#include \"utf8.h\"\n\n#include <cassert>\n\nbool canvas::ContextGDIPlus::is_initialized = false;\nULONG_PTR canvas::ContextGDIPlus::m_gdiplusToken;\n\nusing namespace std;\nusing namespace canvas;\n\nstatic std::wstring convert_to_wstring(const std::string & input) {\n const char * str = input.c_str();\n const char * str_i = str;\n const char * end = str + input.size();\n std::wstring output;\n while (str_i < end) {\n output += (wchar_t)utf8::next(str_i, end);\n }\n return output;\n}\n\nstatic void toGDIPath(const Path & path, Gdiplus::GraphicsPath & output, float display_scale) { \n output.StartFigure();\n Gdiplus::PointF current_pos;\n\n for (auto pc : path.getData()) {\n switch (pc.type) {\n case PathComponent::MOVE_TO:\n current_pos = Gdiplus::PointF(Gdiplus::REAL(pc.x0 * display_scale), Gdiplus::REAL(pc.y0 * display_scale));\n break;\n case PathComponent::LINE_TO:\n {\n\tGdiplus::PointF point(Gdiplus::REAL(pc.x0 * display_scale), Gdiplus::REAL(pc.y0 * display_scale));\n\toutput.AddLine(current_pos, point);\n\tcurrent_pos = point;\n }\n break;\n case PathComponent::CLOSE:\n output.CloseFigure();\n break;\n case PathComponent::ARC:\n {\n\tdouble span = 0;\n\tif (0 && ((!pc.anticlockwise && (pc.ea - pc.sa >= 2 * M_PI)) || (pc.anticlockwise && (pc.sa - pc.ea >= 2 * M_PI)))) {\n\t \/\/ If the anticlockwise argument is false and endAngle-startAngle is equal to or greater than 2*PI, or, if the\n\t \/\/ anticlockwise argument is true and startAngle-endAngle is equal to or greater than 2*PI, then the arc is the whole\n\t \/\/ circumference of this circle.\n\t span = 2 * M_PI;\n\t} else {\n\t if (!pc.anticlockwise && (pc.ea < pc.sa)) {\n\t span += 2 * M_PI;\n\t } else if (pc.anticlockwise && (pc.sa < pc.ea)) {\n\t span -= 2 * M_PI;\n\t }\n \n#if 0\n \/\/ this is also due to switched coordinate system\n \/\/ we would end up with a 0 span instead of 360\n if (!(qFuzzyCompare(span + (ea - sa) + 1, 1.0) && qFuzzyCompare(qAbs(span), 360.0))) {\n \/\/ mod 360\n span += (ea - sa) - (static_cast<int>((ea - sa) \/ 360)) * 360;\n }\n#else\n\t span += pc.ea - pc.sa;\n#endif\n\t}\n \n#if 0\n \/\/ If the path is empty, move to where the arc will start to avoid painting a line from (0,0)\n \/\/ NOTE: QPainterPath::isEmpty() won't work here since it ignores a lone MoveToElement\n if (!m_path.elementCount())\n m_path.arcMoveTo(xs, ys, width, height, sa);\n else if (!radius) {\n m_path.lineTo(xc, yc);\n return;\n }\n#endif\n\n#if 0\n if (anticlockwise) {\n span = -M_PI \/ 2.0;\n } else {\n span = M_PI \/ 2.0;\n }\n#endif\n Gdiplus::RectF rect(Gdiplus::REAL(pc.x0 * display_scale - pc.radius * display_scale), Gdiplus::REAL(pc.y0 * display_scale - pc.radius * display_scale), Gdiplus::REAL(2 * pc.radius * display_scale), Gdiplus::REAL(2 * pc.radius * display_scale));\n\n\toutput.AddArc(rect, Gdiplus::REAL(pc.sa * 180.0f \/ M_PI), Gdiplus::REAL(span * 180.0f \/ M_PI));\n\toutput.GetLastPoint(¤t_pos);\n }\n break;\n }\n }\n}\n\nstatic Gdiplus::Color toGDIColor(const Color & input, float alpha = 1.0f) {\n int red = int(input.red * 255), green = int(input.green * 255), blue = int(input.blue * 255), alpha = int(input.alpha * alpha * 255);\n if (red < 0) red = 0;\n else if (red > 255) red = 255;\n if (green < 0) green = 0;\n else if (green > 255) green = 255;\n if (blue < 0) blue = 0;\n else if (blue > 255) blue = 255;\n if (alpha < 0) alpha = 0;\n else if (alpha > 255) alpha = 255;\n#if 0\n return Gdiplus::Color::FromArgb(alpha, red, green, blue);\n#else\n return Gdiplus::Color(alpha, red, green, blue);\n#endif\n}\n\nGDIPlusSurface::GDIPlusSurface(const std::string & filename) : Surface(0, 0, 0, 0, false) {\n std::wstring tmp = convert_to_wstring(filename);\n bitmap = std::shared_ptr<Gdiplus::Bitmap>(Gdiplus::Bitmap::FromFile(tmp.data()));\n Surface::resize(bitmap->GetWidth(), bitmap->GetHeight(), bitmap->GetWidth(), bitmap->GetHeight(), true);\n}\n\nGDIPlusSurface::GDIPlusSurface(const unsigned char * buffer, size_t size) : Surface(0, 0, 0, 0, false) {\n\tassert(0);\n}\n\n\nvoid\nGDIPlusSurface::renderPath(RenderMode mode, const Path & input_path, const Style & style, float lineWidth, Operator op, float display_scale, float globalAlpha) {\n initializeContext();\n \n switch (op) {\n case SOURCE_OVER:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n break;\n case COPY:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceCopy);\n break; \n }\n\n Gdiplus::GraphicsPath path;\n toGDIPath(input_path, path, display_scale);\n\n switch (mode) {\n case STROKE:\n {\n Gdiplus::Pen pen(toGDIColor(style.color, globalAlpha), lineWidth);\n g->DrawPath(&pen, &path);\n }\n break;\n case FILL:\n if (style.getType() == Style::LINEAR_GRADIENT) {\n const std::map<float, Color> & colors = style.getColors();\n if (!colors.empty()) {\n\tstd::map<float, Color>::const_iterator it0 = colors.begin(), it1 = colors.end();\n\tit1--;\n\tconst Color & c0 = it0->second, c1 = it1->second;\n\tGdiplus::LinearGradientBrush brush(Gdiplus::PointF(Gdiplus::REAL(style.x0), Gdiplus::REAL(style.y0)),\n\t\t\t\t\t Gdiplus::PointF(Gdiplus::REAL(style.x1), Gdiplus::REAL(style.y1)),\n\t\t\t\t\t toGDIColor(c0, globalAlpha),\n\t\t\t\t\t toGDIColor(c1, globalAlpha));\n\tg->FillPath(&brush, &path);\n }\n } else {\n Gdiplus::SolidBrush brush(toGDIColor(style.color, globalAlpha));\n g->FillPath(&brush, &path);\n }\n }\n}\n\nvoid\nGDIPlusSurface::clip(const Path & input_path, float display_scale) {\n initializeContext();\n \n Gdiplus::GraphicsPath path;\n toGDIPath(input_path, path, display_scale);\n\n Gdiplus::Region region(&path);\n g->SetClip(®ion);\n}\n\nvoid\nGDIPlusSurface::drawNativeSurface(GDIPlusSurface & img, double x, double y, double w, double h, double alpha, bool imageSmoothingEnabled) {\n initializeContext();\n\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n \n if (imageSmoothingEnabled) {\n \/\/ g->SetInterpolationMode( Gdiplus::InterpolationModeHighQualityBicubic );\n g->SetInterpolationMode( Gdiplus::InterpolationModeHighQualityBilinear );\n } else {\n g->SetInterpolationMode( Gdiplus::InterpolationModeNearestNeighbor );\n }\n if (alpha < 1.0f && 0) {\n#if 0\n ImageAttributes imageAttributes;\n ColorMatrix colorMatrix = {\n 1.0f, 0.0f, 0.0f, 0.0f, 0.0f,\n 0.0f, 1.0f, 0.0f, 0.0f, 0.0f,\n 0.0f, 0.0f, 1.0f, 0.0f, 0.0f,\n 0.0f, 0.0f, 0.0f, alpha, 0.0f,\n 0.0f, 0.0f, 0.0f, 0.0f, 1.0f};\n \n imageAttributes.SetColorMatrix( &colorMatrix, \n\t\t\t\t ColorMatrixFlagsDefault,\n\t\t\t\t ColorAdjustTypeBitmap);\n graphics.DrawImage( &(*(img.bitmap)),\n\t\t\tGdiplus::Rect(x, y, w, h), \/\/ destination rectangle \n\t\t\t0, 0, \/\/ upper-left corner of source rectangle \n\t\t\tgetWidth(), \/\/ width of source rectangle\n\t\t\tgetHeight(), \/\/ height of source rectangle\n\t\t\tGdiplus::UnitPixel,\n\t\t\t&imageAttributes);\n#endif\n } else if (img.getActualWidth() == (unsigned int)w && img.getActualHeight() == (unsigned int)h && 0) { \/\/ this scales image weirdly\n g->DrawImage(&(*(img.bitmap)), Gdiplus::REAL(x), Gdiplus::REAL(y));\n } else {\n g->DrawImage(&(*(img.bitmap)), Gdiplus::REAL(x), Gdiplus::REAL(y), Gdiplus::REAL(w), Gdiplus::REAL(h));\n }\n}\n\nvoid\nGDIPlusSurface::drawImage(Surface & _img, double x, double y, double w, double h, float alpha, bool imageSmoothingEnabled) {\n GDIPlusSurface * img = dynamic_cast<GDIPlusSurface*>(&_img);\n if (img) {\n drawNativeSurface(*img, x, y, w, h, alpha, imageSmoothingEnabled);\n } else {\n auto img = _img.createImage();\n GDIPlusSurface cs(*img);\n drawNativeSurface(cs, x, y, w, h, alpha, imageSmoothingEnabled);\n }\n}\n\nvoid\nGDIPlusSurface::renderText(RenderMode mode, const Font & font, const Style & style, TextBaseline textBaseline, TextAlign textAlign, const std::string & text, double x, double y, float lineWidth, Operator op, float display_scale) {\n initializeContext();\n\n x = round(x);\n y = round(y);\n \n switch (op) {\n case SOURCE_OVER:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n break;\n case COPY:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceCopy);\n break; \n }\n\n if (font.cleartype) {\n\tg->SetTextRenderingHint(Gdiplus::TextRenderingHintClearTypeGridFit);\n } else if (font.antialiasing && font.hinting && 0) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintAntiAliasGridFit );\n } else if (font.antialiasing) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintAntiAlias );\n } else if (font.hinting) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintSingleBitPerPixelGridFit );\n } else {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintSingleBitPerPixel );\n }\n \n std::wstring text2 = convert_to_wstring(text);\n int style_bits = 0;\n if (font.weight == Font::BOLD || font.weight == Font::BOLDER) {\n style_bits |= Gdiplus::FontStyleBold;\n }\n if (font.slant == Font::ITALIC) {\n style_bits |= Gdiplus::FontStyleItalic;\n }\n Gdiplus::Font gdifont(&Gdiplus::FontFamily(L\"Arial\"), font.size * display_scale, style_bits, Gdiplus::UnitPixel);\n\n Gdiplus::RectF rect(Gdiplus::REAL(x * display_scale), Gdiplus::REAL(y * display_scale), 0.0f, 0.0f);\n Gdiplus::StringFormat f;\n\n switch (textBaseline.getType()) {\n case TextBaseline::TOP: break;\n case TextBaseline::HANGING: break;\n case TextBaseline::MIDDLE: f.SetLineAlignment(Gdiplus::StringAlignmentCenter); break;\n case TextBaseline::BOTTOM: f.SetLineAlignment(Gdiplus::StringAlignmentFar);\n }\n\n switch (textAlign.getType()) {\n case TextAlign::CENTER: f.SetAlignment(Gdiplus::StringAlignmentCenter); break;\n case TextAlign::END: case TextAlign::RIGHT: f.SetAlignment(Gdiplus::StringAlignmentFar); break;\n case TextAlign::START: case TextAlign::LEFT: f.SetAlignment(Gdiplus::StringAlignmentNear); break;\n }\n\n f.SetFormatFlags(Gdiplus::StringFormatFlagsBypassGDI);\n\n switch (mode) {\n case STROKE:\n \/\/ implement\n break;\n case FILL:\n {\n Gdiplus::SolidBrush brush(toGDIColor(style.color));\n g->DrawString(text2.data(), text2.size(), &gdifont, rect, &f, &brush);\n }\n break;\n }\n}\n\nTextMetrics\nGDIPlusSurface::measureText(const Font & font, const std::string & text, float display_scale) {\n initializeContext();\n std::wstring text2 = convert_to_wstring(text);\n int style = 0;\n if (font.weight == Font::BOLD || font.weight == Font::BOLDER) {\n style |= Gdiplus::FontStyleBold;\n }\n if (font.slant == Font::ITALIC) {\n style |= Gdiplus::FontStyleItalic;\n }\n Gdiplus::Font gdi_font(&Gdiplus::FontFamily(L\"Arial\"), font.size * display_scale, style, Gdiplus::UnitPixel);\n Gdiplus::RectF layoutRect(0, 0, 512, 512), boundingBox;\n g->MeasureString(text2.data(), text2.size(), &gdi_font, layoutRect, &boundingBox);\n Gdiplus::SizeF size;\n boundingBox.GetSize(&size);\n \n return TextMetrics(size.Width \/ display_scale);\n}\n<commit_msg>fix globalAlpha parameter<commit_after>#include \"ContextGDIPlus.h\"\n\n#include \"utf8.h\"\n\n#include <cassert>\n\nbool canvas::ContextGDIPlus::is_initialized = false;\nULONG_PTR canvas::ContextGDIPlus::m_gdiplusToken;\n\nusing namespace std;\nusing namespace canvas;\n\nstatic std::wstring convert_to_wstring(const std::string & input) {\n const char * str = input.c_str();\n const char * str_i = str;\n const char * end = str + input.size();\n std::wstring output;\n while (str_i < end) {\n output += (wchar_t)utf8::next(str_i, end);\n }\n return output;\n}\n\nstatic void toGDIPath(const Path & path, Gdiplus::GraphicsPath & output, float display_scale) { \n output.StartFigure();\n Gdiplus::PointF current_pos;\n\n for (auto pc : path.getData()) {\n switch (pc.type) {\n case PathComponent::MOVE_TO:\n current_pos = Gdiplus::PointF(Gdiplus::REAL(pc.x0 * display_scale), Gdiplus::REAL(pc.y0 * display_scale));\n break;\n case PathComponent::LINE_TO:\n {\n\tGdiplus::PointF point(Gdiplus::REAL(pc.x0 * display_scale), Gdiplus::REAL(pc.y0 * display_scale));\n\toutput.AddLine(current_pos, point);\n\tcurrent_pos = point;\n }\n break;\n case PathComponent::CLOSE:\n output.CloseFigure();\n break;\n case PathComponent::ARC:\n {\n\tdouble span = 0;\n\tif (0 && ((!pc.anticlockwise && (pc.ea - pc.sa >= 2 * M_PI)) || (pc.anticlockwise && (pc.sa - pc.ea >= 2 * M_PI)))) {\n\t \/\/ If the anticlockwise argument is false and endAngle-startAngle is equal to or greater than 2*PI, or, if the\n\t \/\/ anticlockwise argument is true and startAngle-endAngle is equal to or greater than 2*PI, then the arc is the whole\n\t \/\/ circumference of this circle.\n\t span = 2 * M_PI;\n\t} else {\n\t if (!pc.anticlockwise && (pc.ea < pc.sa)) {\n\t span += 2 * M_PI;\n\t } else if (pc.anticlockwise && (pc.sa < pc.ea)) {\n\t span -= 2 * M_PI;\n\t }\n \n#if 0\n \/\/ this is also due to switched coordinate system\n \/\/ we would end up with a 0 span instead of 360\n if (!(qFuzzyCompare(span + (ea - sa) + 1, 1.0) && qFuzzyCompare(qAbs(span), 360.0))) {\n \/\/ mod 360\n span += (ea - sa) - (static_cast<int>((ea - sa) \/ 360)) * 360;\n }\n#else\n\t span += pc.ea - pc.sa;\n#endif\n\t}\n \n#if 0\n \/\/ If the path is empty, move to where the arc will start to avoid painting a line from (0,0)\n \/\/ NOTE: QPainterPath::isEmpty() won't work here since it ignores a lone MoveToElement\n if (!m_path.elementCount())\n m_path.arcMoveTo(xs, ys, width, height, sa);\n else if (!radius) {\n m_path.lineTo(xc, yc);\n return;\n }\n#endif\n\n#if 0\n if (anticlockwise) {\n span = -M_PI \/ 2.0;\n } else {\n span = M_PI \/ 2.0;\n }\n#endif\n Gdiplus::RectF rect(Gdiplus::REAL(pc.x0 * display_scale - pc.radius * display_scale), Gdiplus::REAL(pc.y0 * display_scale - pc.radius * display_scale), Gdiplus::REAL(2 * pc.radius * display_scale), Gdiplus::REAL(2 * pc.radius * display_scale));\n\n\toutput.AddArc(rect, Gdiplus::REAL(pc.sa * 180.0f \/ M_PI), Gdiplus::REAL(span * 180.0f \/ M_PI));\n\toutput.GetLastPoint(¤t_pos);\n }\n break;\n }\n }\n}\n\nstatic Gdiplus::Color toGDIColor(const Color & input, float globalAlpha = 1.0f) {\n int red = int(input.red * 255), green = int(input.green * 255), blue = int(input.blue * 255), alpha = int(input.alpha * globalAlpha * 255);\n if (red < 0) red = 0;\n else if (red > 255) red = 255;\n if (green < 0) green = 0;\n else if (green > 255) green = 255;\n if (blue < 0) blue = 0;\n else if (blue > 255) blue = 255;\n if (alpha < 0) alpha = 0;\n else if (alpha > 255) alpha = 255;\n#if 0\n return Gdiplus::Color::FromArgb(alpha, red, green, blue);\n#else\n return Gdiplus::Color(alpha, red, green, blue);\n#endif\n}\n\nGDIPlusSurface::GDIPlusSurface(const std::string & filename) : Surface(0, 0, 0, 0, false) {\n std::wstring tmp = convert_to_wstring(filename);\n bitmap = std::shared_ptr<Gdiplus::Bitmap>(Gdiplus::Bitmap::FromFile(tmp.data()));\n Surface::resize(bitmap->GetWidth(), bitmap->GetHeight(), bitmap->GetWidth(), bitmap->GetHeight(), true);\n}\n\nGDIPlusSurface::GDIPlusSurface(const unsigned char * buffer, size_t size) : Surface(0, 0, 0, 0, false) {\n\tassert(0);\n}\n\n\nvoid\nGDIPlusSurface::renderPath(RenderMode mode, const Path & input_path, const Style & style, float lineWidth, Operator op, float display_scale, float globalAlpha) {\n initializeContext();\n \n switch (op) {\n case SOURCE_OVER:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n break;\n case COPY:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceCopy);\n break; \n }\n\n Gdiplus::GraphicsPath path;\n toGDIPath(input_path, path, display_scale);\n\n switch (mode) {\n case STROKE:\n {\n Gdiplus::Pen pen(toGDIColor(style.color, globalAlpha), lineWidth);\n g->DrawPath(&pen, &path);\n }\n break;\n case FILL:\n if (style.getType() == Style::LINEAR_GRADIENT) {\n const std::map<float, Color> & colors = style.getColors();\n if (!colors.empty()) {\n\tstd::map<float, Color>::const_iterator it0 = colors.begin(), it1 = colors.end();\n\tit1--;\n\tconst Color & c0 = it0->second, c1 = it1->second;\n\tGdiplus::LinearGradientBrush brush(Gdiplus::PointF(Gdiplus::REAL(style.x0), Gdiplus::REAL(style.y0)),\n\t\t\t\t\t Gdiplus::PointF(Gdiplus::REAL(style.x1), Gdiplus::REAL(style.y1)),\n\t\t\t\t\t toGDIColor(c0, globalAlpha),\n\t\t\t\t\t toGDIColor(c1, globalAlpha));\n\tg->FillPath(&brush, &path);\n }\n } else {\n Gdiplus::SolidBrush brush(toGDIColor(style.color, globalAlpha));\n g->FillPath(&brush, &path);\n }\n }\n}\n\nvoid\nGDIPlusSurface::clip(const Path & input_path, float display_scale) {\n initializeContext();\n \n Gdiplus::GraphicsPath path;\n toGDIPath(input_path, path, display_scale);\n\n Gdiplus::Region region(&path);\n g->SetClip(®ion);\n}\n\nvoid\nGDIPlusSurface::drawNativeSurface(GDIPlusSurface & img, double x, double y, double w, double h, double alpha, bool imageSmoothingEnabled) {\n initializeContext();\n\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n \n if (imageSmoothingEnabled) {\n \/\/ g->SetInterpolationMode( Gdiplus::InterpolationModeHighQualityBicubic );\n g->SetInterpolationMode( Gdiplus::InterpolationModeHighQualityBilinear );\n } else {\n g->SetInterpolationMode( Gdiplus::InterpolationModeNearestNeighbor );\n }\n if (alpha < 1.0f && 0) {\n#if 0\n ImageAttributes imageAttributes;\n ColorMatrix colorMatrix = {\n 1.0f, 0.0f, 0.0f, 0.0f, 0.0f,\n 0.0f, 1.0f, 0.0f, 0.0f, 0.0f,\n 0.0f, 0.0f, 1.0f, 0.0f, 0.0f,\n 0.0f, 0.0f, 0.0f, alpha, 0.0f,\n 0.0f, 0.0f, 0.0f, 0.0f, 1.0f};\n \n imageAttributes.SetColorMatrix( &colorMatrix, \n\t\t\t\t ColorMatrixFlagsDefault,\n\t\t\t\t ColorAdjustTypeBitmap);\n graphics.DrawImage( &(*(img.bitmap)),\n\t\t\tGdiplus::Rect(x, y, w, h), \/\/ destination rectangle \n\t\t\t0, 0, \/\/ upper-left corner of source rectangle \n\t\t\tgetWidth(), \/\/ width of source rectangle\n\t\t\tgetHeight(), \/\/ height of source rectangle\n\t\t\tGdiplus::UnitPixel,\n\t\t\t&imageAttributes);\n#endif\n } else if (img.getActualWidth() == (unsigned int)w && img.getActualHeight() == (unsigned int)h && 0) { \/\/ this scales image weirdly\n g->DrawImage(&(*(img.bitmap)), Gdiplus::REAL(x), Gdiplus::REAL(y));\n } else {\n g->DrawImage(&(*(img.bitmap)), Gdiplus::REAL(x), Gdiplus::REAL(y), Gdiplus::REAL(w), Gdiplus::REAL(h));\n }\n}\n\nvoid\nGDIPlusSurface::drawImage(Surface & _img, double x, double y, double w, double h, float alpha, bool imageSmoothingEnabled) {\n GDIPlusSurface * img = dynamic_cast<GDIPlusSurface*>(&_img);\n if (img) {\n drawNativeSurface(*img, x, y, w, h, alpha, imageSmoothingEnabled);\n } else {\n auto img = _img.createImage();\n GDIPlusSurface cs(*img);\n drawNativeSurface(cs, x, y, w, h, alpha, imageSmoothingEnabled);\n }\n}\n\nvoid\nGDIPlusSurface::renderText(RenderMode mode, const Font & font, const Style & style, TextBaseline textBaseline, TextAlign textAlign, const std::string & text, double x, double y, float lineWidth, Operator op, float display_scale, float globalAlpha) {\n initializeContext();\n\n x = round(x);\n y = round(y);\n \n switch (op) {\n case SOURCE_OVER:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceOver);\n break;\n case COPY:\n g->SetCompositingMode(Gdiplus::CompositingModeSourceCopy);\n break; \n }\n\n if (font.cleartype) {\n g->SetTextRenderingHint(Gdiplus::TextRenderingHintClearTypeGridFit);\n } else if (font.antialiasing && font.hinting && 0) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintAntiAliasGridFit );\n } else if (font.antialiasing) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintAntiAlias );\n } else if (font.hinting) {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintSingleBitPerPixelGridFit );\n } else {\n g->SetTextRenderingHint( Gdiplus::TextRenderingHintSingleBitPerPixel );\n }\n \n std::wstring text2 = convert_to_wstring(text);\n int style_bits = 0;\n if (font.weight == Font::BOLD || font.weight == Font::BOLDER) {\n style_bits |= Gdiplus::FontStyleBold;\n }\n if (font.slant == Font::ITALIC) {\n style_bits |= Gdiplus::FontStyleItalic;\n }\n Gdiplus::Font gdifont(&Gdiplus::FontFamily(L\"Arial\"), font.size * display_scale, style_bits, Gdiplus::UnitPixel);\n\n Gdiplus::RectF rect(Gdiplus::REAL(x * display_scale), Gdiplus::REAL(y * display_scale), 0.0f, 0.0f);\n Gdiplus::StringFormat f;\n\n switch (textBaseline.getType()) {\n case TextBaseline::TOP: break;\n case TextBaseline::HANGING: break;\n case TextBaseline::MIDDLE: f.SetLineAlignment(Gdiplus::StringAlignmentCenter); break;\n case TextBaseline::BOTTOM: f.SetLineAlignment(Gdiplus::StringAlignmentFar);\n }\n\n switch (textAlign.getType()) {\n case TextAlign::CENTER: f.SetAlignment(Gdiplus::StringAlignmentCenter); break;\n case TextAlign::END: case TextAlign::RIGHT: f.SetAlignment(Gdiplus::StringAlignmentFar); break;\n case TextAlign::START: case TextAlign::LEFT: f.SetAlignment(Gdiplus::StringAlignmentNear); break;\n }\n\n f.SetFormatFlags(Gdiplus::StringFormatFlagsBypassGDI);\n\n switch (mode) {\n case STROKE:\n \/\/ implement\n break;\n case FILL:\n {\n Gdiplus::SolidBrush brush(toGDIColor(style.color, globalAlpha));\n g->DrawString(text2.data(), text2.size(), &gdifont, rect, &f, &brush);\n }\n break;\n }\n}\n\nTextMetrics\nGDIPlusSurface::measureText(const Font & font, const std::string & text, float display_scale) {\n initializeContext();\n std::wstring text2 = convert_to_wstring(text);\n int style = 0;\n if (font.weight == Font::BOLD || font.weight == Font::BOLDER) {\n style |= Gdiplus::FontStyleBold;\n }\n if (font.slant == Font::ITALIC) {\n style |= Gdiplus::FontStyleItalic;\n }\n Gdiplus::Font gdi_font(&Gdiplus::FontFamily(L\"Arial\"), font.size * display_scale, style, Gdiplus::UnitPixel);\n Gdiplus::RectF layoutRect(0, 0, 512, 512), boundingBox;\n g->MeasureString(text2.data(), text2.size(), &gdi_font, layoutRect, &boundingBox);\n Gdiplus::SizeF size;\n boundingBox.GetSize(&size);\n \n return TextMetrics(size.Width \/ display_scale);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011 Merethis\n**\n** This file is part of Centreon Clib.\n**\n** Centreon Clib is free software: you can redistribute it\n** and\/or modify it under the terms of the GNU Affero General Public\n** License as published by the Free Software Foundation, either version\n** 3 of the License, or (at your option) any later version.\n**\n** Centreon Clib is distributed in the hope that it will be\n** useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n** of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** Affero General Public License for more details.\n**\n** You should have received a copy of the GNU Affero General Public\n** License along with Centreon Clib. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef CC_CONCURRENCY_MUTEX_WIN32_HH\n# define CC_CONCURRENCY_MUTEX_WIN32_HH\n\n# include <windows.h>\n# include \"com\/centreon\/namespace.hh\"\n\nCC_BEGIN()\n\nnamespace concurrency {\n \/**\n * @class mutex mutex_win32.hh \"com\/centreon\/concurrency\/mutex.hh\"\n * @brief Implements a mutex.\n *\n * Win32-base implementation of a mutex (intra-process\n * synchronisation). On Windows the mutex class is a critical\n * section and should not be confused with a Win32 mutex which is\n * used for inter-process synchronisation.\n *\/\n class mutex {\n public:\n mutex();\n ~mutex() throw ();\n void lock();\n bool trylock();\n void unlock();\n\n private:\n mutex(mutex const& right);\n mutex& operator=(mutex const& right);\n mutex& _internal_copy(mutex const& right);\n\n CRITICAL_SECTION _csection;\n };\n}\n\nCC_END()\n\n#endif \/\/ !CC_CONCURRENCY_MUTEX_WIN32_HH\n<commit_msg>Fix Win32 mutex compilation error.<commit_after>\/*\n** Copyright 2011 Merethis\n**\n** This file is part of Centreon Clib.\n**\n** Centreon Clib is free software: you can redistribute it\n** and\/or modify it under the terms of the GNU Affero General Public\n** License as published by the Free Software Foundation, either version\n** 3 of the License, or (at your option) any later version.\n**\n** Centreon Clib is distributed in the hope that it will be\n** useful, but WITHOUT ANY WARRANTY; without even the implied warranty\n** of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** Affero General Public License for more details.\n**\n** You should have received a copy of the GNU Affero General Public\n** License along with Centreon Clib. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#ifndef CC_CONCURRENCY_MUTEX_WIN32_HH\n# define CC_CONCURRENCY_MUTEX_WIN32_HH\n\n# include <windows.h>\n# include \"com\/centreon\/namespace.hh\"\n\nCC_BEGIN()\n\nnamespace concurrency {\n \/**\n * @class mutex mutex_win32.hh \"com\/centreon\/concurrency\/mutex.hh\"\n * @brief Implements a mutex.\n *\n * Win32-base implementation of a mutex (intra-process\n * synchronisation). On Windows the mutex class is a critical\n * section and should not be confused with a Win32 mutex which is\n * used for inter-process synchronisation.\n *\/\n class mutex {\n public:\n mutex();\n ~mutex() throw ();\n void lock();\n bool trylock();\n void unlock();\n\n private:\n mutex(mutex const& right);\n mutex& operator=(mutex const& right);\n void _internal_copy(mutex const& right);\n\n CRITICAL_SECTION _csection;\n };\n}\n\nCC_END()\n\n#endif \/\/ !CC_CONCURRENCY_MUTEX_WIN32_HH\n<|endoftext|>"} {"text":"<commit_before>\n#include \"Triton.h\"\n#include \"analysis\/formatString.h\"\n\n\nvoid formatStringBugAnalysis(unsigned long rdi)\n{\n list<UINT64>::iterator i;\n std::string content = std::string((const char *)rdi);\n std::stringstream str;\n\n if (taintEngine->isMemoryTainted(rdi)){\n if (content.find(\"%s\") == string::npos){\n str << \"[call::printf] RDI content is tainted: \" << content;\n displayBug(str.str());\n str.str(\"[call::printf] This printf is probably vulnerable\");\n displayBug(str.str());\n }\n }\n}\n\n\n<commit_msg>Add comments<commit_after>\n#include \"Triton.h\"\n#include \"analysis\/formatString.h\"\n\n\nvoid formatStringBugAnalysis(unsigned long rdi)\n{\n list<UINT64>::iterator i;\n std::string content = std::string((const char *)rdi);\n std::stringstream str;\n\n \/* In 64-bit, RDI holds the first argument.\n * If this argument is tainted, it's probably vulnerable *\/\n if (taintEngine->isMemoryTainted(rdi)){\n str << \"[call::printf] RDI content is tainted: \" << content;\n displayBug(str.str());\n str.str(\"[call::printf] This printf is probably vulnerable\");\n displayBug(str.str());\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef _FM_INDEX_RANGE_LIST_HPP\n#define _FM_INDEX_RANGE_LIST_HPP\n\n#include \"wavelet_tree_node.hpp\"\n\n#include <boost\/tuple\/tuple.hpp>\n\n\nNS_IZENELIB_AM_BEGIN\n\nnamespace succinct\n{\nnamespace fm_index\n{\n\nnamespace detail\n{\n\nstatic double getScore(const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n{\n double score = 0.0;\n\n for (std::vector<boost::tuple<size_t, size_t, double> >::const_iterator it = patterns.begin();\n it != patterns.end(); ++it)\n {\n score += it->get<2>();\n }\n\n return score;\n}\n\nstatic struct InvalidRange\n{\n bool operator()(const std::pair<size_t, size_t> &range) const\n {\n return range.first >= range.second;\n }\n\n bool operator()(const boost::tuple<size_t, size_t, double> &range) const\n {\n return range.get<0>() >= range.get<1>();\n }\n} InvalidRange;\n\n}\n\nclass PatternList\n{\npublic:\n PatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , node_(node)\n , patterns_(patterns)\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n\n PatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n patterns_.reserve(pattern_count);\n }\n\n ~PatternList() {}\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const PatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\nclass FilteredPatternList\n{\npublic:\n FilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<std::pair<size_t, size_t> > &filters,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n , filters_(filters)\n , patterns_(patterns)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n if (!filters_.empty())\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n }\n\n FilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t filter_count, size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n filters_.reserve(filter_count);\n patterns_.reserve(pattern_count);\n }\n\n ~FilteredPatternList() {}\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const FilteredPatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<std::pair<size_t, size_t> > filters_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\ntemplate <class WaveletTreeType>\nclass FilterList\n{\npublic:\n FilterList(\n const WaveletTreeType *tree, const WaveletTreeNode *node,\n const std::vector<std::pair<size_t, size_t> > &filters)\n : tree_(tree) , node_(node)\n , filters_(filters)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n }\n\n FilterList(\n const WaveletTreeType *tree, const WaveletTreeNode *node,\n size_t filter_count)\n : tree_(tree) , node_(node)\n {\n filters_.reserve(filter_count);\n }\n\n ~FilterList() {}\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\npublic:\n const WaveletTreeType *tree_;\n const WaveletTreeNode *node_;\n std::vector<std::pair<size_t, size_t> > filters_;\n};\n\ntemplate <class WaveletTreeType>\nclass AuxFilteredPatternList\n{\npublic:\n AuxFilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<FilterList<WaveletTreeType> *> &aux_filters,\n const std::vector<std::pair<size_t, size_t> > &filters,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n , aux_filters_(aux_filters)\n , filters_(filters)\n , patterns_(patterns)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n if (!aux_filters_.empty() || !filters_.empty())\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n }\n\n AuxFilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t aux_filter_count, size_t filter_count, size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n aux_filters_.reserve(aux_filter_count);\n filters_.reserve(filter_count);\n patterns_.reserve(pattern_count);\n }\n\n ~AuxFilteredPatternList()\n {\n for (size_t i = 0; i < aux_filters_.size(); ++i)\n {\n delete aux_filters_[i];\n }\n }\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\n void addAuxFilter(FilterList<WaveletTreeType> *aux_filter)\n {\n }\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const AuxFilteredPatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<FilterList<WaveletTreeType> *> aux_filters_;\n std::vector<std::pair<size_t, size_t> > filters_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\n}\n}\n\nNS_IZENELIB_AM_END\n\nnamespace std\n{\n\ntemplate <>\nstruct less<izenelib::am::succinct::fm_index::PatternList *>\n{\n bool operator()(izenelib::am::succinct::fm_index::PatternList * const &p1, izenelib::am::succinct::fm_index::PatternList * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class T>\nstruct less<pair<izenelib::am::succinct::fm_index::PatternList *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::PatternList *, T> const &p1, pair<izenelib::am::succinct::fm_index::PatternList *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\ntemplate <>\nstruct less<izenelib::am::succinct::fm_index::FilteredPatternList *>\n{\n bool operator()(izenelib::am::succinct::fm_index::FilteredPatternList * const &p1, izenelib::am::succinct::fm_index::FilteredPatternList * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class T>\nstruct less<pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> const &p1, pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\ntemplate <class W>\nstruct less<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *>\n{\n bool operator()(izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> * const &p1, izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class W, class T>\nstruct less<pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> const &p1, pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\n}\n\n#endif\n<commit_msg>fix AuxFilteredPatternList::addAuxFilter()<commit_after>#ifndef _FM_INDEX_RANGE_LIST_HPP\n#define _FM_INDEX_RANGE_LIST_HPP\n\n#include \"wavelet_tree_node.hpp\"\n\n#include <boost\/tuple\/tuple.hpp>\n\n\nNS_IZENELIB_AM_BEGIN\n\nnamespace succinct\n{\nnamespace fm_index\n{\n\nnamespace detail\n{\n\nstatic double getScore(const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n{\n double score = 0.0;\n\n for (std::vector<boost::tuple<size_t, size_t, double> >::const_iterator it = patterns.begin();\n it != patterns.end(); ++it)\n {\n score += it->get<2>();\n }\n\n return score;\n}\n\nstatic struct InvalidRange\n{\n bool operator()(const std::pair<size_t, size_t> &range) const\n {\n return range.first >= range.second;\n }\n\n bool operator()(const boost::tuple<size_t, size_t, double> &range) const\n {\n return range.get<0>() >= range.get<1>();\n }\n} InvalidRange;\n\n}\n\nclass PatternList\n{\npublic:\n PatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , node_(node)\n , patterns_(patterns)\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n\n PatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n patterns_.reserve(pattern_count);\n }\n\n ~PatternList() {}\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const PatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\nclass FilteredPatternList\n{\npublic:\n FilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<std::pair<size_t, size_t> > &filters,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n , filters_(filters)\n , patterns_(patterns)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n if (!filters_.empty())\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n }\n\n FilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t filter_count, size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n filters_.reserve(filter_count);\n patterns_.reserve(pattern_count);\n }\n\n ~FilteredPatternList() {}\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const FilteredPatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<std::pair<size_t, size_t> > filters_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\ntemplate <class WaveletTreeType>\nclass FilterList\n{\npublic:\n FilterList(\n const WaveletTreeType *tree, const WaveletTreeNode *node,\n const std::vector<std::pair<size_t, size_t> > &filters)\n : tree_(tree) , node_(node)\n , filters_(filters)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n }\n\n FilterList(\n const WaveletTreeType *tree, const WaveletTreeNode *node,\n size_t filter_count)\n : tree_(tree) , node_(node)\n {\n filters_.reserve(filter_count);\n }\n\n ~FilterList() {}\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\npublic:\n const WaveletTreeType *tree_;\n const WaveletTreeNode *node_;\n std::vector<std::pair<size_t, size_t> > filters_;\n};\n\ntemplate <class WaveletTreeType>\nclass AuxFilteredPatternList\n{\npublic:\n AuxFilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n const std::vector<FilterList<WaveletTreeType> *> &aux_filters,\n const std::vector<std::pair<size_t, size_t> > &filters,\n const std::vector<boost::tuple<size_t, size_t, double> > &patterns)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n , aux_filters_(aux_filters)\n , filters_(filters)\n , patterns_(patterns)\n {\n\/\/ filters_.erase(std::remove_if(filters_.begin(), filters_.end(), detail::InvalidRange), filters_.end());\n if (!aux_filters_.empty() || !filters_.empty())\n {\n\/\/ patterns_.erase(std::remove_if(patterns_.begin(), patterns_.end(), detail::InvalidRange), patterns_.end());\n score_ = detail::getScore(patterns_);\n }\n }\n\n AuxFilteredPatternList(\n size_t level, uint64_t sym,\n const WaveletTreeNode *node,\n size_t aux_filter_count, size_t filter_count, size_t pattern_count)\n : level_(level)\n , sym_(sym)\n , score_()\n , node_(node)\n {\n aux_filters_.reserve(aux_filter_count);\n filters_.reserve(filter_count);\n patterns_.reserve(pattern_count);\n }\n\n ~AuxFilteredPatternList()\n {\n for (size_t i = 0; i < aux_filters_.size(); ++i)\n {\n delete aux_filters_[i];\n }\n }\n\n void addFilter(const std::pair<size_t, size_t> &filter)\n {\n if (filter.first < filter.second)\n filters_.push_back(filter);\n }\n\n void addAuxFilter(FilterList<WaveletTreeType> *aux_filter)\n {\n if (aux_filter)\n {\n if (!aux_filter->filters_.empty())\n aux_filters_.push_back(aux_filter);\n else\n delete aux_filter;\n }\n }\n\n void addPattern(const boost::tuple<size_t, size_t, double> &pattern)\n {\n if (pattern.get<0>() < pattern.get<1>())\n patterns_.push_back(pattern);\n }\n\n void calcScore()\n {\n score_ = detail::getScore(patterns_);\n }\n\n bool operator<(const AuxFilteredPatternList &rhs) const\n {\n return score_ < rhs.score_ || (score_ == rhs.score_ && level_ < rhs.level_);\n }\n\npublic:\n size_t level_;\n uint64_t sym_;\n double score_;\n const WaveletTreeNode *node_;\n std::vector<FilterList<WaveletTreeType> *> aux_filters_;\n std::vector<std::pair<size_t, size_t> > filters_;\n std::vector<boost::tuple<size_t, size_t, double> > patterns_;\n};\n\n}\n}\n\nNS_IZENELIB_AM_END\n\nnamespace std\n{\n\ntemplate <>\nstruct less<izenelib::am::succinct::fm_index::PatternList *>\n{\n bool operator()(izenelib::am::succinct::fm_index::PatternList * const &p1, izenelib::am::succinct::fm_index::PatternList * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class T>\nstruct less<pair<izenelib::am::succinct::fm_index::PatternList *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::PatternList *, T> const &p1, pair<izenelib::am::succinct::fm_index::PatternList *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\ntemplate <>\nstruct less<izenelib::am::succinct::fm_index::FilteredPatternList *>\n{\n bool operator()(izenelib::am::succinct::fm_index::FilteredPatternList * const &p1, izenelib::am::succinct::fm_index::FilteredPatternList * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class T>\nstruct less<pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> const &p1, pair<izenelib::am::succinct::fm_index::FilteredPatternList *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\ntemplate <class W>\nstruct less<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *>\n{\n bool operator()(izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> * const &p1, izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> * const &p2)\n {\n return *p1 < *p2;\n }\n};\n\ntemplate <class W, class T>\nstruct less<pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> >\n{\n bool operator()(pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> const &p1, pair<izenelib::am::succinct::fm_index::AuxFilteredPatternList<W> *, T> const &p2)\n {\n return *p1.first < *p2.first;\n }\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifdef EXTINT_H\n#ifndef EXTINT_HPP\n#define EXTINT_HPP\n\nExtInt::DListNode & ExtInt::DListNode::remove() {\n\tDListNode *tmp = this -> forward;\n\ttmp -> forward -> next = this;\n\tthis -> forward = tmp -> forward;\n\tdelete tmp;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::append(DListNode *data) {\n\tdata -> next = this -> next;\n\tdata -> forward = this;\n\tif (this -> next != NULL) {\n\t\tthis -> next -> forward = data;\n\t}\n\tthis -> next = data;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::append(const int &data) {\n\treturn append(new DListNode(data));\n}\nExtInt::DListNode & ExtInt::DListNode::insert(DListNode *data) {\n\tdata -> next = this;\n\tdata -> forward = this -> forward;\n\tif (this -> forward != NULL) {\n\t\tthis -> forward -> next = data;\n\t}\n\tthis -> forward = data;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::insert(const int &data) {\n\treturn insert(new DListNode(data));\n}\n\nExtInt::ExtInt(int data) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = false;\n\tif (data < 0) {\n\t\tisNegative = true;\n\t\tdata = -data;\n\t}\n\twhile (data >= ExtInt::LIMIT) {\n\t\thigh -> insert(data % ExtInt::LIMIT);\n\t\tdata \/= ExtInt::LIMIT;\n\t\tlength++;\n\t}\n\tif (length == 0 || data > 0) {\n\t\thigh -> insert(data);\n\t\tlength++;\n\t}\n}\nExtInt::ExtInt(const ExtInt &rhs) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = rhs.isNegative;\n\tfor (DListNode *it = rhs.low -> next; it != rhs.high; it = it -> next) {\n\t\thigh -> insert(it -> data);\n\t\tlength++;\n\t}\n}\nExtInt::ExtInt(const std::string &rhs) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = false;\n\tif (rhs[0] == '-') {\n\t\tisNegative = true;\n\t}\n\tfor (int i = rhs.length() - 1; i >= 0; i -= WIDTH) {\n\t\tint value = 0;\n\t\tfor (int j = std::max(0, i - WIDTH + 1); j <= i; j++) {\n\t\t\tif (j == 0 && isNegative) continue;\n\t\t\tassert(isdigit(rhs[j]));\n\t\t\tvalue = value * 10 + rhs[j] - '0';\n\t\t}\n\t\thigh -> insert(value);\n\t\tlength++;\n\t}\n\twhile (length > 1 && high -> forward -> data == 0) {\n\t\thigh -> remove();\n\t\tlength--;\n\t}\n}\nExtInt & ExtInt::operator =(const ExtInt &rhs) {\n\tif (this == &rhs) return *this;\n\tif (low != NULL || high != NULL) {\n\t\tthis -> ~ExtInt();\n\t}\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = rhs.isNegative;\n\tfor (DListNode *it = rhs.low -> next; it != rhs.high; it = it -> next) {\n\t\thigh -> insert(it -> data);\n\t\tlength++;\n\t}\n\treturn *this;\n}\nExtInt::~ExtInt() {\n\tfor (DListNode *it = low; it != NULL;) {\n\t\tDListNode *tmp = it -> next;\n\t\tdelete it;\n\t\tit = tmp;\n\t}\n}\n\nstd::istream & operator >>(std::istream &inputStream, ExtInt &data) {\n\tstd::string tmp;\n\tinputStream >> tmp;\n\tdata = ExtInt(tmp);\n\treturn inputStream;\n}\nstd::ostream & operator <<(std::ostream &outputStream, const ExtInt &data) {\n\tif (data.isNegative) {\n\t\toutputStream << \"-\";\n\t}\n\tExtInt::DListNode *it = data.high -> forward;\n\toutputStream << it -> data;\n\tfor (it = it -> forward; it != data.low; it = it -> forward) {\n\t\toutputStream << std::setfill('0') << std::setw(ExtInt::WIDTH) << it -> data;\n\t}\n\treturn outputStream;\n}\n\nbool operator <(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative && !b.isNegative) return true;\n\tif (!a.isNegative && b.isNegative) return false;\n\tbool flag = false;\n\tif (a.isNegative && b.isNegative) flag = true;\n\tif (a.length < b.length) return flag ^ true;\n\tif (a.length > b.length) return flag ^ false;\n\tExtInt::DListNode *itA = a.high, *itB = b.high;\n\tfor (; itA != a.low && itB != b.low; itA = itA -> forward, itB = itB -> forward) {\n\t\tif (itA -> data < itB -> data) return flag ^ true;\n\t\tif (itA -> data > itB -> data) return flag ^ false;\n\t}\n\treturn false;\n}\nbool operator >(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative && !b.isNegative) return false;\n\tif (!a.isNegative && b.isNegative) return true;\n\tbool flag = false;\n\tif (a.isNegative && b.isNegative) flag = true;\n\tif (a.length < b.length) return flag ^ false;\n\tif (a.length > b.length) return flag ^ true;\n\tExtInt::DListNode *itA = a.high, *itB = b.high;\n\tfor (; itA != a.low && itB != b.low; itA = itA -> forward, itB = itB -> forward) {\n\t\tif (itA -> data < itB -> data) return flag ^ false;\n\t\tif (itA -> data > itB -> data) return flag ^ true;\n\t}\n\treturn false;\n}\nbool operator >=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a < b);\n}\nbool operator <=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a > b);\n}\nbool operator ==(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative != b.isNegative) return false;\n\tif (a.length != b.length) return false;\n\tExtInt::DListNode *itA = a.low, *itB = b.low;\n\tfor (; itA != a.high && itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\tif (itA -> data != itB -> data) return false;\n\t}\n\treturn true;\n}\nbool operator !=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a == b);\n}\n\nExtInt operator +(const ExtInt &a, const ExtInt &b) {\n\tif (b.isNegative) {\n\t\tExtInt tmp = b;\n\t\ttmp.isNegative = false;\n\t\treturn a - tmp;\n\t}\n\tif (a.isNegative) {\n\t\tExtInt tmp = a;\n\t\ttmp.isNegative = false;\n\t\treturn b - tmp;\n\t}\n\tExtInt ret = a;\n\tExtInt::DListNode *itA = ret.low -> next, *itB = b.low -> next;\n\tfor (; itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\tif (itA == ret.high) {\n\t\t\titA -> insert(0);\n\t\t\tret.length++;\n\t\t\titA = itA -> forward;\n\t\t}\n\t\titA -> data += itB -> data;\n\t\tif (itA -> data >= ExtInt::LIMIT) {\n\t\t\tif (itA -> next == ret.high) {\n\t\t\t\titA -> append(0);\n\t\t\t\tret.length++;\n\t\t\t}\n\t\t\titA -> next -> data += itA -> data \/ ExtInt::LIMIT;\n\t\t\titA -> data %= ExtInt::LIMIT;\n\t\t}\n\t}\n\treturn ret;\n}\nExtInt operator -(const ExtInt &a, const ExtInt &b) {\n\tif (b.isNegative) {\n\t\tExtInt tmp = b;\n\t\ttmp.isNegative = false;\n\t\treturn a + tmp;\n\t}\n\tif (a.isNegative) {\n\t\tExtInt tmp = a;\n\t\ttmp.isNegative = false;\n\t\ttmp = tmp + b;\n\t\ttmp.isNegative = true;\n\t\treturn tmp;\n\t}\n\tif (a < b) {\n\t\tExtInt tmp = b - a;\n\t\ttmp.isNegative = true;\n\t\treturn tmp;\n\t}\n\tExtInt ret = a;\n\tExtInt::DListNode *itA = ret.low -> next, *itB = b.low -> next;\n\tfor (; itA != ret.high && itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\titA -> data -= itB -> data;\n\t\tif (itA -> data < 0) {\n\t\t\titA -> data += ExtInt::LIMIT;\n\t\t\titA -> next -> data--;\n\t\t}\n\t}\n\tfor (; itA != ret.high; itA = itA -> next) {\n\t\tif (itA -> data < 0) {\n\t\t\titA -> data += ExtInt::LIMIT;\n\t\t\titA -> next -> data--;\n\t\t}\n\t}\n\twhile (ret.length > 1 && ret.high -> forward -> data == 0) {\n\t\tret.high -> remove();\n\t\tret.length--;\n\t}\n\treturn ret;\n}\nExtInt operator *(const ExtInt &a, const ExtInt &b) {\n\tif (a == ExtInt(0) || b == ExtInt(0)) return ExtInt(0);\n\tExtInt ret, tmp;\n\tExtInt::DListNode *itB = b.low -> next;\n\tfor (int value = 0; itB != b.high; itB = itB -> next, value++) {\n\t\tif (itB -> data == 0) {\n\t\t\tcontinue;\n\t\t}\n\t\ttmp = a;\n\t\tfor (ExtInt::DListNode *itA = tmp.low -> next; itA != tmp.high; itA = itA -> next) {\n\t\t\titA -> data *= itB -> data;\n\t\t}\n\t\tfor (ExtInt::DListNode *itA = tmp.low -> next; itA != tmp.high; itA = itA -> next) {\n\t\t\tif (itA -> data >= ExtInt::LIMIT) {\n\t\t\t\tif (itA -> next == tmp.high) {\n\t\t\t\t\titA -> append(0);\n\t\t\t\t\ttmp.length++;\n\t\t\t\t}\n\t\t\t\titA -> next -> data += itA -> data \/ ExtInt::LIMIT;\n\t\t\t\titA -> data %= ExtInt::LIMIT;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= value; i++) {\n\t\t\ttmp.low -> append(0);\n\t\t\ttmp.length++;\n\t\t}\n\t\t\/\/std::cerr << ret << std::endl;\n\t\t\/\/std::cerr << tmp << std::endl;\n\t\t\/\/std::cerr << tmp.length << std::endl;\n\t\tret = ret + tmp;\n\t}\n\tret.isNegative = a.isNegative ^ b.isNegative;\n\treturn ret;\n}\nExtInt operator \/(const ExtInt &a, const ExtInt &b) {\n\tassert(b != ExtInt(0));\n\tif (a == ExtInt(0)) return ExtInt(0);\n\tExtInt ret, tmp, div = b;\n\tret.high -> remove();\n\tret.length = 0;\n\ttmp.high -> remove();\n\ttmp.length = 0;\n\tdiv.isNegative = false;\n\tExtInt::DListNode *itA = a.high -> forward;\n\tfor (; itA != a.low; itA = itA -> forward) {\n\t\ttmp.low -> append(itA -> data);\n\t\ttmp.length++;\n\t\tif (tmp >= div) {\n\t\t\tint left = 0, right = ExtInt::LIMIT - 1;\n\t\t\twhile (left < right) {\n\t\t\t\tint middle = (left + right >> 1) + 1;\n\t\t\t\tif (tmp >= div * middle) {\n\t\t\t\t\tleft = middle;\n\t\t\t\t} else {\n\t\t\t\t\tright = middle - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/std::cerr << tmp << \" \" << div * left << std::endl;\n\t\t\tret.low -> append(left);\n\t\t\tret.length++;\n\t\t\ttmp = tmp - div * left;\n\t\t\tif (tmp == ExtInt(0)) {\n\t\t\t\ttmp.high -> remove();\n\t\t\t\ttmp.length = 0;\n\t\t\t}\n\t\t} else {\n\t\t\tret.low -> append(0);\n\t\t\tret.length++;\n\t\t}\n\t}\n\twhile (ret.length > 1 && ret.high -> forward -> data == 0) {\n\t\tret.high -> remove();\n\t\tret.length--;\n\t}\n\tret.isNegative = a.isNegative ^ b.isNegative;\n\tif (ret.isNegative && tmp.low -> next != tmp.high) {\n\t\tret = ret - 1;\n\t}\n\treturn ret;\n}\nExtInt operator %(const ExtInt &a, const ExtInt &b) {\n\treturn a - a \/ b * b;\n}\n\nExtInt & ExtInt::operator +=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator -=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator *=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator \/=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator %=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\n\n#endif\n#endif\n<commit_msg>Division Module Mistakes Fixed.<commit_after>#ifdef EXTINT_H\n#ifndef EXTINT_HPP\n#define EXTINT_HPP\n\nExtInt::DListNode & ExtInt::DListNode::remove() {\n\tDListNode *tmp = this -> forward;\n\ttmp -> forward -> next = this;\n\tthis -> forward = tmp -> forward;\n\tdelete tmp;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::append(DListNode *data) {\n\tdata -> next = this -> next;\n\tdata -> forward = this;\n\tif (this -> next != NULL) {\n\t\tthis -> next -> forward = data;\n\t}\n\tthis -> next = data;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::append(const int &data) {\n\treturn append(new DListNode(data));\n}\nExtInt::DListNode & ExtInt::DListNode::insert(DListNode *data) {\n\tdata -> next = this;\n\tdata -> forward = this -> forward;\n\tif (this -> forward != NULL) {\n\t\tthis -> forward -> next = data;\n\t}\n\tthis -> forward = data;\n\treturn *this;\n}\nExtInt::DListNode & ExtInt::DListNode::insert(const int &data) {\n\treturn insert(new DListNode(data));\n}\n\nExtInt::ExtInt(int data) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = false;\n\tif (data < 0) {\n\t\tisNegative = true;\n\t\tdata = -data;\n\t}\n\twhile (data >= ExtInt::LIMIT) {\n\t\thigh -> insert(data % ExtInt::LIMIT);\n\t\tdata \/= ExtInt::LIMIT;\n\t\tlength++;\n\t}\n\tif (length == 0 || data > 0) {\n\t\thigh -> insert(data);\n\t\tlength++;\n\t}\n}\nExtInt::ExtInt(const ExtInt &rhs) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = rhs.isNegative;\n\tfor (DListNode *it = rhs.low -> next; it != rhs.high; it = it -> next) {\n\t\thigh -> insert(it -> data);\n\t\tlength++;\n\t}\n}\nExtInt::ExtInt(const std::string &rhs) {\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = false;\n\tif (rhs[0] == '-') {\n\t\tisNegative = true;\n\t}\n\tfor (int i = rhs.length() - 1; i >= 0; i -= WIDTH) {\n\t\tint value = 0;\n\t\tfor (int j = std::max(0, i - WIDTH + 1); j <= i; j++) {\n\t\t\tif (j == 0 && isNegative) continue;\n\t\t\tassert(isdigit(rhs[j]));\n\t\t\tvalue = value * 10 + rhs[j] - '0';\n\t\t}\n\t\thigh -> insert(value);\n\t\tlength++;\n\t}\n\twhile (length > 1 && high -> forward -> data == 0) {\n\t\thigh -> remove();\n\t\tlength--;\n\t}\n}\nExtInt & ExtInt::operator =(const ExtInt &rhs) {\n\tif (this == &rhs) return *this;\n\tif (low != NULL || high != NULL) {\n\t\tthis -> ~ExtInt();\n\t}\n\tlow = new DListNode;\n\thigh = new DListNode;\n\tlow -> append(high);\n\tlength = 0;\n\tisNegative = rhs.isNegative;\n\tfor (DListNode *it = rhs.low -> next; it != rhs.high; it = it -> next) {\n\t\thigh -> insert(it -> data);\n\t\tlength++;\n\t}\n\treturn *this;\n}\nExtInt::~ExtInt() {\n\tfor (DListNode *it = low; it != NULL;) {\n\t\tDListNode *tmp = it -> next;\n\t\tdelete it;\n\t\tit = tmp;\n\t}\n}\n\nstd::istream & operator >>(std::istream &inputStream, ExtInt &data) {\n\tstd::string tmp;\n\tinputStream >> tmp;\n\tdata = ExtInt(tmp);\n\treturn inputStream;\n}\nstd::ostream & operator <<(std::ostream &outputStream, const ExtInt &data) {\n\tif (data.isNegative) {\n\t\toutputStream << \"-\";\n\t}\n\tExtInt::DListNode *it = data.high -> forward;\n\toutputStream << it -> data;\n\tfor (it = it -> forward; it != data.low; it = it -> forward) {\n\t\toutputStream << std::setfill('0') << std::setw(ExtInt::WIDTH) << it -> data;\n\t}\n\treturn outputStream;\n}\n\nbool operator <(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative && !b.isNegative) return true;\n\tif (!a.isNegative && b.isNegative) return false;\n\tbool flag = false;\n\tif (a.isNegative && b.isNegative) flag = true;\n\tif (a.length < b.length) return flag ^ true;\n\tif (a.length > b.length) return flag ^ false;\n\tExtInt::DListNode *itA = a.high, *itB = b.high;\n\tfor (; itA != a.low && itB != b.low; itA = itA -> forward, itB = itB -> forward) {\n\t\tif (itA -> data < itB -> data) return flag ^ true;\n\t\tif (itA -> data > itB -> data) return flag ^ false;\n\t}\n\treturn false;\n}\nbool operator >(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative && !b.isNegative) return false;\n\tif (!a.isNegative && b.isNegative) return true;\n\tbool flag = false;\n\tif (a.isNegative && b.isNegative) flag = true;\n\tif (a.length < b.length) return flag ^ false;\n\tif (a.length > b.length) return flag ^ true;\n\tExtInt::DListNode *itA = a.high, *itB = b.high;\n\tfor (; itA != a.low && itB != b.low; itA = itA -> forward, itB = itB -> forward) {\n\t\tif (itA -> data < itB -> data) return flag ^ false;\n\t\tif (itA -> data > itB -> data) return flag ^ true;\n\t}\n\treturn false;\n}\nbool operator >=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a < b);\n}\nbool operator <=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a > b);\n}\nbool operator ==(const ExtInt &a, const ExtInt &b) {\n\tif (a.isNegative != b.isNegative) return false;\n\tif (a.length != b.length) return false;\n\tExtInt::DListNode *itA = a.low, *itB = b.low;\n\tfor (; itA != a.high && itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\tif (itA -> data != itB -> data) return false;\n\t}\n\treturn true;\n}\nbool operator !=(const ExtInt &a, const ExtInt &b) {\n\treturn !(a == b);\n}\n\nExtInt operator +(const ExtInt &a, const ExtInt &b) {\n\tif (b.isNegative) {\n\t\tExtInt tmp = b;\n\t\ttmp.isNegative = false;\n\t\treturn a - tmp;\n\t}\n\tif (a.isNegative) {\n\t\tExtInt tmp = a;\n\t\ttmp.isNegative = false;\n\t\treturn b - tmp;\n\t}\n\tExtInt ret = a;\n\tExtInt::DListNode *itA = ret.low -> next, *itB = b.low -> next;\n\tfor (; itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\tif (itA == ret.high) {\n\t\t\titA -> insert(0);\n\t\t\tret.length++;\n\t\t\titA = itA -> forward;\n\t\t}\n\t\titA -> data += itB -> data;\n\t\tif (itA -> data >= ExtInt::LIMIT) {\n\t\t\tif (itA -> next == ret.high) {\n\t\t\t\titA -> append(0);\n\t\t\t\tret.length++;\n\t\t\t}\n\t\t\titA -> next -> data += itA -> data \/ ExtInt::LIMIT;\n\t\t\titA -> data %= ExtInt::LIMIT;\n\t\t}\n\t}\n\treturn ret;\n}\nExtInt operator -(const ExtInt &a, const ExtInt &b) {\n\tif (b.isNegative) {\n\t\tExtInt tmp = b;\n\t\ttmp.isNegative = false;\n\t\treturn a + tmp;\n\t}\n\tif (a.isNegative) {\n\t\tExtInt tmp = a;\n\t\ttmp.isNegative = false;\n\t\ttmp = tmp + b;\n\t\ttmp.isNegative = true;\n\t\treturn tmp;\n\t}\n\tif (a < b) {\n\t\tExtInt tmp = b - a;\n\t\ttmp.isNegative = true;\n\t\treturn tmp;\n\t}\n\tExtInt ret = a;\n\tExtInt::DListNode *itA = ret.low -> next, *itB = b.low -> next;\n\tfor (; itA != ret.high && itB != b.high; itA = itA -> next, itB = itB -> next) {\n\t\titA -> data -= itB -> data;\n\t\tif (itA -> data < 0) {\n\t\t\titA -> data += ExtInt::LIMIT;\n\t\t\titA -> next -> data--;\n\t\t}\n\t}\n\tfor (; itA != ret.high; itA = itA -> next) {\n\t\tif (itA -> data < 0) {\n\t\t\titA -> data += ExtInt::LIMIT;\n\t\t\titA -> next -> data--;\n\t\t}\n\t}\n\twhile (ret.length > 1 && ret.high -> forward -> data == 0) {\n\t\tret.high -> remove();\n\t\tret.length--;\n\t}\n\treturn ret;\n}\nExtInt operator *(const ExtInt &a, const ExtInt &b) {\n\tif (a == ExtInt(0) || b == ExtInt(0)) return ExtInt(0);\n\tExtInt ret, tmp;\n\tExtInt::DListNode *itB = b.low -> next;\n\tfor (int value = 0; itB != b.high; itB = itB -> next, value++) {\n\t\tif (itB -> data == 0) {\n\t\t\tcontinue;\n\t\t}\n\t\ttmp = a;\n\t\tfor (ExtInt::DListNode *itA = tmp.low -> next; itA != tmp.high; itA = itA -> next) {\n\t\t\titA -> data *= itB -> data;\n\t\t}\n\t\tfor (ExtInt::DListNode *itA = tmp.low -> next; itA != tmp.high; itA = itA -> next) {\n\t\t\tif (itA -> data >= ExtInt::LIMIT) {\n\t\t\t\tif (itA -> next == tmp.high) {\n\t\t\t\t\titA -> append(0);\n\t\t\t\t\ttmp.length++;\n\t\t\t\t}\n\t\t\t\titA -> next -> data += itA -> data \/ ExtInt::LIMIT;\n\t\t\t\titA -> data %= ExtInt::LIMIT;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= value; i++) {\n\t\t\ttmp.low -> append(0);\n\t\t\ttmp.length++;\n\t\t}\n\t\t\/\/std::cerr << ret << std::endl;\n\t\t\/\/std::cerr << tmp << std::endl;\n\t\t\/\/std::cerr << tmp.length << std::endl;\n\t\tret = ret + tmp;\n\t}\n\tret.isNegative = a.isNegative ^ b.isNegative;\n\treturn ret;\n}\nExtInt operator \/(const ExtInt &a, const ExtInt &b) {\n\tassert(b != ExtInt(0));\n\tif (a == ExtInt(0)) return ExtInt(0);\n\tExtInt ret, tmp, div = b;\n\tret.high -> remove();\n\tret.length = 0;\n\ttmp.high -> remove();\n\ttmp.length = 0;\n\tdiv.isNegative = false;\n\tExtInt::DListNode *itA = a.high -> forward;\n\tfor (; itA != a.low; itA = itA -> forward) {\n\t\ttmp.low -> append(itA -> data);\n\t\ttmp.length++;\n\t\tif (tmp >= div) {\n\t\t\tint left = 0, right = ExtInt::LIMIT - 1;\n\t\t\twhile (left < right) {\n\t\t\t\tint middle = (left + right >> 1) + 1;\n\t\t\t\tif (tmp >= div * middle) {\n\t\t\t\t\tleft = middle;\n\t\t\t\t} else {\n\t\t\t\t\tright = middle - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/std::cerr << tmp << \" \" << div * left << std::endl;\n\t\t\tret.low -> append(left);\n\t\t\tret.length++;\n\t\t\ttmp = tmp - div * left;\n\t\t} else {\n\t\t\tret.low -> append(0);\n\t\t\tret.length++;\n\t\t}\n\t\tif (tmp == ExtInt(0)) {\n\t\t\ttmp.high -> remove();\n\t\t\ttmp.length = 0;\n\t\t}\n\t}\n\twhile (ret.length > 1 && ret.high -> forward -> data == 0) {\n\t\tret.high -> remove();\n\t\tret.length--;\n\t}\n\tret.isNegative = a.isNegative ^ b.isNegative;\n\tif (ret.isNegative && tmp.low -> next != tmp.high) {\n\t\tret = ret - 1;\n\t}\n\treturn ret;\n}\nExtInt operator %(const ExtInt &a, const ExtInt &b) {\n\treturn a - a \/ b * b;\n}\n\nExtInt & ExtInt::operator +=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator -=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator *=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator \/=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\nExtInt & ExtInt::operator %=(const ExtInt &rhs) {\n\t*this = *this + rhs;\n\treturn *this;\n}\n\n#endif\n#endif\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#include \"app\/gibbs\/gibbs_sampling.h\"\n#include \"app\/gibbs\/single_node_sampler.h\"\n#include \"io\/pb_parser.h\"\n#include \"common.h\"\n#include <unistd.h>\n#include <fstream>\n#include \"timer.h\"\n\n\/*!\n * \\brief In this function, the factor graph is located to each NUMA node.\n * \n * TODO: in the near future, this allocation should be abstracted\n * into a higher-level class to avoid writing similar things\n * for Gibbs, NN, SGD etc. However, this is the task of next pass\n * of refactoring.\n *\/\nvoid dd::GibbsSampling::prepare(){\n\n n_numa_nodes = numa_max_node();\n \/\/n_numa_nodes = 0;\n n_thread_per_numa = (sysconf(_SC_NPROCESSORS_CONF))\/(n_numa_nodes+1);\n \/\/n_thread_per_numa \/= 2;\n \/\/if(n_thread_per_numa == 0){\n \/\/ n_thread_per_numa = 1;\n \/\/}\n \/\/n_thread_per_numa = 1;\n\n this->factorgraphs.push_back(*p_fg);\n for(int i=1;i<=n_numa_nodes;i++){\n\n numa_run_on_node(i);\n numa_set_localalloc();\n\n std::cout << \"CREATE FG ON NODE ...\" << i << std::endl;\n dd::FactorGraph fg(p_fg->n_var, p_fg->n_factor, p_fg->n_weight, p_fg->n_edge);\n \n fg.copy_from(p_fg);\n \/\/fg.load(*p_cmd_parser);\n\n this->factorgraphs.push_back(fg);\n }\n\n}\n\nvoid dd::GibbsSampling::inference(const int & n_epoch){\n\n Timer t_total;\n\n Timer t;\n int nvar = this->factorgraphs[0].n_var;\n int nnode = n_numa_nodes + 1;\n\n std::vector<SingleNodeSampler> single_node_samplers;\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers.push_back(SingleNodeSampler(&this->factorgraphs[i], \n n_thread_per_numa, i));\n }\n\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers[i].clear_variabletally();\n }\n\n for(int i_epoch=0;i_epoch<n_epoch;i_epoch++){\n\n std::cout << std::setprecision(2) << \"INFERENCE EPOCH \" << i_epoch * nnode << \"~\" \n << ((i_epoch+1) * nnode) << \"....\" << std::flush;\n\n t.restart();\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].sample();\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].wait();\n }\n double elapsed = t.elapsed();\n std::cout << \"\" << elapsed << \" sec.\" ;\n std::cout << \",\" << (nvar*nnode)\/elapsed << \" vars\/sec\" << std::endl;\n }\n\n double elapsed = t_total.elapsed();\n std::cout << \"TOTAL INFERENCE TIME: \" << elapsed << \" sec.\" << std::endl;\n\n}\n\nvoid dd::GibbsSampling::learn(const int & n_epoch, const int & n_sample_per_epoch, \n const double & stepsize, const double & decay){\n\n Timer t_total;\n\n double current_stepsize = stepsize;\n\n Timer t;\n int nvar = this->factorgraphs[0].n_var;\n int nnode = n_numa_nodes + 1;\n int nweight = this->factorgraphs[0].n_weight;\n\n std::vector<SingleNodeSampler> single_node_samplers;\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers.push_back(SingleNodeSampler(&this->factorgraphs[i], n_thread_per_numa, i));\n }\n\n double * ori_weights = new double[nweight];\n memcpy(ori_weights, this->factorgraphs[0].infrs->weight_values, sizeof(double)*nweight);\n\n\n for(int i_epoch=0;i_epoch<n_epoch;i_epoch++){\n\n std::cout << std::setprecision(2) << \"LEARNING EPOCH \" << i_epoch * nnode << \"~\" \n << ((i_epoch+1) * nnode) << \"....\" << std::flush;\n\n t.restart();\n \n for(int i=0;i<nnode;i++){\n single_node_samplers[i].p_fg->stepsize = current_stepsize;\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].sample_sgd();\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].wait_sgd();\n }\n\n FactorGraph & cfg = this->factorgraphs[0];\n for(int i=1;i<=n_numa_nodes;i++){\n FactorGraph & cfg_other = this->factorgraphs[i];\n for(int j=0;j<nweight;j++){\n cfg.infrs->weight_values[j] += cfg_other.infrs->weight_values[j];\n }\n }\n\n for(int j=0;j<nweight;j++){\n cfg.infrs->weight_values[j] \/= nnode;\n if(cfg.infrs->weights_isfixed[j] == false){\n cfg.infrs->weight_values[j] *= (1.0\/(1.0+0.01*current_stepsize));\n }\n }\n\n for(int i=1;i<=n_numa_nodes;i++){\n FactorGraph &cfg_other = this->factorgraphs[i];\n for(int j=0;j<nweight;j++){\n if(cfg.infrs->weights_isfixed[j] == false){\n cfg_other.infrs->weight_values[j] = cfg.infrs->weight_values[j];\n }\n }\n } \n\n\n double lmax = -1000000;\n double l2=0.0;\n for(int i=0;i<nweight;i++){\n double diff = fabs(ori_weights[i] - cfg.infrs->weight_values[i]);\n ori_weights[i] = cfg.infrs->weight_values[i];\n l2 += diff*diff;\n if(lmax < diff){\n lmax = diff;\n }\n }\n lmax = lmax\/current_stepsize;\n \n double elapsed = t.elapsed();\n std::cout << \"\" << elapsed << \" sec.\";\n std::cout << \",\" << (nvar*nnode)\/elapsed << \" vars\/sec.\" << \",stepsize=\" << current_stepsize << \",lmax=\" << lmax << \",l2=\" << sqrt(l2)\/current_stepsize << std::endl;\n \/\/std::cout << \" \" << this->compact_factors[0].fg_mutable->weights[0] << std::endl;\n\n current_stepsize = current_stepsize * decay;\n\n }\n\n double elapsed = t_total.elapsed();\n std::cout << \"TOTAL LEARNING TIME: \" << elapsed << \" sec.\" << std::endl;\n\n}\n\nvoid dd::GibbsSampling::dump_weights(){\n\n std::cout << \"LEARNING SNIPPETS (QUERY WEIGHTS):\" << std::endl;\n FactorGraph const & cfg = this->factorgraphs[0];\n int ct = 0;\n for(size_t i=0;i<cfg.infrs->nweights;i++){\n ct ++;\n std::cout << \" \" << i << \" \" << cfg.infrs->weight_values[i] << std::endl;\n if(ct % 10 == 0){\n break;\n }\n }\n std::cout << \" ...\" << std::endl; \n\n std::string filename_protocol = p_cmd_parser->output_folder->getValue() \n + \"\/inference_result.out.weights\";\n std::string filename_text = p_cmd_parser->output_folder->getValue() \n + \"\/inference_result.out.weights.text\";\n\n std::cout << \"DUMPING... PROTOCOL: \" << filename_protocol << std::endl;\n std::cout << \"DUMPING... TEXT : \" << filename_text << std::endl;\n\n std::ofstream fout_text(filename_text.c_str());\n std::ofstream mFs(filename_protocol.c_str(),std::ios::out | std::ios::binary);\n google::protobuf::io::OstreamOutputStream *_OstreamOutputStream = \n new google::protobuf::io::OstreamOutputStream(&mFs);\n google::protobuf::io::CodedOutputStream *_CodedOutputStream = \n new google::protobuf::io::CodedOutputStream(_OstreamOutputStream);\n deepdive::WeightInferenceResult msg;\n for(size_t i=0;i<cfg.infrs->nweights;i++){\n fout_text << i << \" \" << cfg.infrs->weight_values[i] << std::endl;\n msg.set_id(i);\n msg.set_value(cfg.infrs->weight_values[i]);\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n } \n }\n delete _CodedOutputStream;\n delete _OstreamOutputStream;\n mFs.close();\n fout_text.close();\n\n}\n\n\nvoid dd::GibbsSampling::dump(){\n\n double * agg_means = new double[factorgraphs[0].n_var];\n double * agg_nsamples = new double[factorgraphs[0].n_var];\n int * multinomial_tallies = new int[factorgraphs[0].infrs->ntallies];\n\n for(long i=0;i<factorgraphs[0].n_var;i++){\n agg_means[i] = 0;\n agg_nsamples[i] = 0;\n }\n\n for(long i=0;i<factorgraphs[0].infrs->ntallies;i++){\n multinomial_tallies[i] = 0;\n }\n\n for(int i=0;i<=n_numa_nodes;i++){\n const FactorGraph & cfg = factorgraphs[i];\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n agg_means[variable.id] += cfg.infrs->agg_means[variable.id];\n agg_nsamples[variable.id] += cfg.infrs->agg_nsamples[variable.id];\n }\n for(long i=0;i<factorgraphs[0].infrs->ntallies;i++){\n multinomial_tallies[i] += cfg.infrs->multinomial_tallies[i];\n }\n }\n\n std::cout << \"INFERENCE SNIPPETS (QUERY VARIABLES):\" << std::endl;\n int ct = 0;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == false){\n ct ++;\n std::cout << \" \" << variable.id << \" EXP=\" \n << agg_means[variable.id]\/agg_nsamples[variable.id] << \" NSAMPLE=\" \n << agg_nsamples[variable.id] << std::endl;\n\n if(variable.domain_type != DTYPE_BOOLEAN){\n if(variable.domain_type == DTYPE_MULTINOMIAL){\n for(int j=0;j<=variable.upper_bound;j++){\n std::cout << \" @ \" << j << \" -> \" << 1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id] << std::endl;\n }\n }else{\n std::cout << \"ERROR: Only support boolean variables for now!\" << std::endl;\n assert(false);\n }\n }\n\n if(ct % 10 == 0){\n break;\n }\n }\n }\n std::cout << \" ...\" << std::endl; \n\n std::string filename_protocol = p_cmd_parser->output_folder->getValue() + \n \"\/inference_result.out\";\n std::string filename_text = p_cmd_parser->output_folder->getValue() + \n \"\/inference_result.out.text\";\n std::cout << \"DUMPING... PROTOCOL: \" << filename_protocol << std::endl;\n std::cout << \"DUMPING... TEXT : \" << filename_text << std::endl;\n std::ofstream fout_text(filename_text.c_str());\n std::ofstream mFs(filename_protocol.c_str(),std::ios::out | std::ios::binary);\n google::protobuf::io::OstreamOutputStream *_OstreamOutputStream = \n new google::protobuf::io::OstreamOutputStream(&mFs);\n google::protobuf::io::CodedOutputStream *_CodedOutputStream = \n new google::protobuf::io::CodedOutputStream(_OstreamOutputStream);\n deepdive::VariableInferenceResult msg;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == true){\n continue;\n }\n\n msg.set_id(variable.id);\n msg.set_category(1.0);\n msg.set_expectation(agg_means[variable.id]\/agg_nsamples[variable.id]);\n \n if(variable.domain_type != DTYPE_BOOLEAN){\n if(variable.domain_type == DTYPE_MULTINOMIAL){\n for(int j=0;j<=variable.upper_bound;j++){\n msg.set_category(j);\n msg.set_expectation(1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id]);\n \n fout_text << variable.id << \" \" << j << \" \" << (1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id]) << std::endl;\n\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n }\n }\n }else{\n std::cout << \"ERROR: Only support boolean variables for now!\" << std::endl;\n assert(false);\n }\n }else{\n fout_text << variable.id << \" \" << 1 << \" \" << (agg_means[variable.id]\/agg_nsamples[variable.id]) << std::endl;\n\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n }\n }\n }\n delete _CodedOutputStream;\n delete _OstreamOutputStream;\n mFs.close();\n fout_text.close();\n\n std::cout << \"INFERENCE CALIBRATION (QUERY BINS):\" << std::endl;\n std::vector<int> abc;\n for(int i=0;i<=10;i++){\n abc.push_back(0);\n }\n int bad = 0;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == true){\n continue;\n }\n int bin = (int)(agg_means[variable.id]\/agg_nsamples[variable.id]*10);\n if(bin >= 0 && bin <=10){\n abc[bin] ++;\n }else{\n \/\/std::cout << variable.id << \" \" << variable.agg_mean << \" \" << variable.n_sample << std::endl;\n bad ++;\n }\n }\n abc[9] += abc[10];\n for(int i=0;i<10;i++){\n std::cout << \"PROB BIN 0.\" << i << \"~0.\" << (i+1) << \" --> # \" << abc[i] << std::endl;\n }\n\n}\n\n\n\n\n\n\n\n\n\n\n<commit_msg>single numa, multiple thread<commit_after>\n#include \"app\/gibbs\/gibbs_sampling.h\"\n#include \"app\/gibbs\/single_node_sampler.h\"\n#include \"io\/pb_parser.h\"\n#include \"common.h\"\n#include <unistd.h>\n#include <fstream>\n#include \"timer.h\"\n\n\/*!\n * \\brief In this function, the factor graph is located to each NUMA node.\n * \n * TODO: in the near future, this allocation should be abstracted\n * into a higher-level class to avoid writing similar things\n * for Gibbs, NN, SGD etc. However, this is the task of next pass\n * of refactoring.\n *\/\nvoid dd::GibbsSampling::prepare(){\n\n \/\/n_numa_nodes = numa_max_node();\n n_numa_nodes = 0;\n n_thread_per_numa = (sysconf(_SC_NPROCESSORS_CONF))\/(n_numa_nodes+1);\n \/\/n_thread_per_numa \/= 2;\n \/\/if(n_thread_per_numa == 0){\n \/\/ n_thread_per_numa = 1;\n \/\/}\n \/\/n_thread_per_numa = 1;\n\n this->factorgraphs.push_back(*p_fg);\n for(int i=1;i<=n_numa_nodes;i++){\n\n numa_run_on_node(i);\n numa_set_localalloc();\n\n std::cout << \"CREATE FG ON NODE ...\" << i << std::endl;\n dd::FactorGraph fg(p_fg->n_var, p_fg->n_factor, p_fg->n_weight, p_fg->n_edge);\n \n fg.copy_from(p_fg);\n \/\/fg.load(*p_cmd_parser);\n\n this->factorgraphs.push_back(fg);\n }\n\n}\n\nvoid dd::GibbsSampling::inference(const int & n_epoch){\n\n Timer t_total;\n\n Timer t;\n int nvar = this->factorgraphs[0].n_var;\n int nnode = n_numa_nodes + 1;\n\n std::vector<SingleNodeSampler> single_node_samplers;\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers.push_back(SingleNodeSampler(&this->factorgraphs[i], \n n_thread_per_numa, i));\n }\n\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers[i].clear_variabletally();\n }\n\n for(int i_epoch=0;i_epoch<n_epoch;i_epoch++){\n\n std::cout << std::setprecision(2) << \"INFERENCE EPOCH \" << i_epoch * nnode << \"~\" \n << ((i_epoch+1) * nnode) << \"....\" << std::flush;\n\n t.restart();\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].sample();\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].wait();\n }\n double elapsed = t.elapsed();\n std::cout << \"\" << elapsed << \" sec.\" ;\n std::cout << \",\" << (nvar*nnode)\/elapsed << \" vars\/sec\" << std::endl;\n }\n\n double elapsed = t_total.elapsed();\n std::cout << \"TOTAL INFERENCE TIME: \" << elapsed << \" sec.\" << std::endl;\n\n}\n\nvoid dd::GibbsSampling::learn(const int & n_epoch, const int & n_sample_per_epoch, \n const double & stepsize, const double & decay){\n\n Timer t_total;\n\n double current_stepsize = stepsize;\n\n Timer t;\n int nvar = this->factorgraphs[0].n_var;\n int nnode = n_numa_nodes + 1;\n int nweight = this->factorgraphs[0].n_weight;\n\n std::vector<SingleNodeSampler> single_node_samplers;\n for(int i=0;i<=n_numa_nodes;i++){\n single_node_samplers.push_back(SingleNodeSampler(&this->factorgraphs[i], n_thread_per_numa, i));\n }\n\n double * ori_weights = new double[nweight];\n memcpy(ori_weights, this->factorgraphs[0].infrs->weight_values, sizeof(double)*nweight);\n\n\n for(int i_epoch=0;i_epoch<n_epoch;i_epoch++){\n\n std::cout << std::setprecision(2) << \"LEARNING EPOCH \" << i_epoch * nnode << \"~\" \n << ((i_epoch+1) * nnode) << \"....\" << std::flush;\n\n t.restart();\n \n for(int i=0;i<nnode;i++){\n single_node_samplers[i].p_fg->stepsize = current_stepsize;\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].sample_sgd();\n }\n\n for(int i=0;i<nnode;i++){\n single_node_samplers[i].wait_sgd();\n }\n\n FactorGraph & cfg = this->factorgraphs[0];\n for(int i=1;i<=n_numa_nodes;i++){\n FactorGraph & cfg_other = this->factorgraphs[i];\n for(int j=0;j<nweight;j++){\n cfg.infrs->weight_values[j] += cfg_other.infrs->weight_values[j];\n }\n }\n\n for(int j=0;j<nweight;j++){\n cfg.infrs->weight_values[j] \/= nnode;\n if(cfg.infrs->weights_isfixed[j] == false){\n cfg.infrs->weight_values[j] *= (1.0\/(1.0+0.01*current_stepsize));\n }\n }\n\n for(int i=1;i<=n_numa_nodes;i++){\n FactorGraph &cfg_other = this->factorgraphs[i];\n for(int j=0;j<nweight;j++){\n if(cfg.infrs->weights_isfixed[j] == false){\n cfg_other.infrs->weight_values[j] = cfg.infrs->weight_values[j];\n }\n }\n } \n\n\n double lmax = -1000000;\n double l2=0.0;\n for(int i=0;i<nweight;i++){\n double diff = fabs(ori_weights[i] - cfg.infrs->weight_values[i]);\n ori_weights[i] = cfg.infrs->weight_values[i];\n l2 += diff*diff;\n if(lmax < diff){\n lmax = diff;\n }\n }\n lmax = lmax\/current_stepsize;\n \n double elapsed = t.elapsed();\n std::cout << \"\" << elapsed << \" sec.\";\n std::cout << \",\" << (nvar*nnode)\/elapsed << \" vars\/sec.\" << \",stepsize=\" << current_stepsize << \",lmax=\" << lmax << \",l2=\" << sqrt(l2)\/current_stepsize << std::endl;\n \/\/std::cout << \" \" << this->compact_factors[0].fg_mutable->weights[0] << std::endl;\n\n current_stepsize = current_stepsize * decay;\n\n }\n\n double elapsed = t_total.elapsed();\n std::cout << \"TOTAL LEARNING TIME: \" << elapsed << \" sec.\" << std::endl;\n\n}\n\nvoid dd::GibbsSampling::dump_weights(){\n\n std::cout << \"LEARNING SNIPPETS (QUERY WEIGHTS):\" << std::endl;\n FactorGraph const & cfg = this->factorgraphs[0];\n int ct = 0;\n for(size_t i=0;i<cfg.infrs->nweights;i++){\n ct ++;\n std::cout << \" \" << i << \" \" << cfg.infrs->weight_values[i] << std::endl;\n if(ct % 10 == 0){\n break;\n }\n }\n std::cout << \" ...\" << std::endl; \n\n std::string filename_protocol = p_cmd_parser->output_folder->getValue() \n + \"\/inference_result.out.weights\";\n std::string filename_text = p_cmd_parser->output_folder->getValue() \n + \"\/inference_result.out.weights.text\";\n\n std::cout << \"DUMPING... PROTOCOL: \" << filename_protocol << std::endl;\n std::cout << \"DUMPING... TEXT : \" << filename_text << std::endl;\n\n std::ofstream fout_text(filename_text.c_str());\n std::ofstream mFs(filename_protocol.c_str(),std::ios::out | std::ios::binary);\n google::protobuf::io::OstreamOutputStream *_OstreamOutputStream = \n new google::protobuf::io::OstreamOutputStream(&mFs);\n google::protobuf::io::CodedOutputStream *_CodedOutputStream = \n new google::protobuf::io::CodedOutputStream(_OstreamOutputStream);\n deepdive::WeightInferenceResult msg;\n for(size_t i=0;i<cfg.infrs->nweights;i++){\n fout_text << i << \" \" << cfg.infrs->weight_values[i] << std::endl;\n msg.set_id(i);\n msg.set_value(cfg.infrs->weight_values[i]);\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n } \n }\n delete _CodedOutputStream;\n delete _OstreamOutputStream;\n mFs.close();\n fout_text.close();\n\n}\n\n\nvoid dd::GibbsSampling::dump(){\n\n double * agg_means = new double[factorgraphs[0].n_var];\n double * agg_nsamples = new double[factorgraphs[0].n_var];\n int * multinomial_tallies = new int[factorgraphs[0].infrs->ntallies];\n\n for(long i=0;i<factorgraphs[0].n_var;i++){\n agg_means[i] = 0;\n agg_nsamples[i] = 0;\n }\n\n for(long i=0;i<factorgraphs[0].infrs->ntallies;i++){\n multinomial_tallies[i] = 0;\n }\n\n for(int i=0;i<=n_numa_nodes;i++){\n const FactorGraph & cfg = factorgraphs[i];\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n agg_means[variable.id] += cfg.infrs->agg_means[variable.id];\n agg_nsamples[variable.id] += cfg.infrs->agg_nsamples[variable.id];\n }\n for(long i=0;i<factorgraphs[0].infrs->ntallies;i++){\n multinomial_tallies[i] += cfg.infrs->multinomial_tallies[i];\n }\n }\n\n std::cout << \"INFERENCE SNIPPETS (QUERY VARIABLES):\" << std::endl;\n int ct = 0;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == false){\n ct ++;\n std::cout << \" \" << variable.id << \" EXP=\" \n << agg_means[variable.id]\/agg_nsamples[variable.id] << \" NSAMPLE=\" \n << agg_nsamples[variable.id] << std::endl;\n\n if(variable.domain_type != DTYPE_BOOLEAN){\n if(variable.domain_type == DTYPE_MULTINOMIAL){\n for(int j=0;j<=variable.upper_bound;j++){\n std::cout << \" @ \" << j << \" -> \" << 1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id] << std::endl;\n }\n }else{\n std::cout << \"ERROR: Only support boolean variables for now!\" << std::endl;\n assert(false);\n }\n }\n\n if(ct % 10 == 0){\n break;\n }\n }\n }\n std::cout << \" ...\" << std::endl; \n\n std::string filename_protocol = p_cmd_parser->output_folder->getValue() + \n \"\/inference_result.out\";\n std::string filename_text = p_cmd_parser->output_folder->getValue() + \n \"\/inference_result.out.text\";\n std::cout << \"DUMPING... PROTOCOL: \" << filename_protocol << std::endl;\n std::cout << \"DUMPING... TEXT : \" << filename_text << std::endl;\n std::ofstream fout_text(filename_text.c_str());\n std::ofstream mFs(filename_protocol.c_str(),std::ios::out | std::ios::binary);\n google::protobuf::io::OstreamOutputStream *_OstreamOutputStream = \n new google::protobuf::io::OstreamOutputStream(&mFs);\n google::protobuf::io::CodedOutputStream *_CodedOutputStream = \n new google::protobuf::io::CodedOutputStream(_OstreamOutputStream);\n deepdive::VariableInferenceResult msg;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == true){\n continue;\n }\n\n msg.set_id(variable.id);\n msg.set_category(1.0);\n msg.set_expectation(agg_means[variable.id]\/agg_nsamples[variable.id]);\n \n if(variable.domain_type != DTYPE_BOOLEAN){\n if(variable.domain_type == DTYPE_MULTINOMIAL){\n for(int j=0;j<=variable.upper_bound;j++){\n msg.set_category(j);\n msg.set_expectation(1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id]);\n \n fout_text << variable.id << \" \" << j << \" \" << (1.0*multinomial_tallies[variable.n_start_i_tally + j]\/agg_nsamples[variable.id]) << std::endl;\n\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n }\n }\n }else{\n std::cout << \"ERROR: Only support boolean variables for now!\" << std::endl;\n assert(false);\n }\n }else{\n fout_text << variable.id << \" \" << 1 << \" \" << (agg_means[variable.id]\/agg_nsamples[variable.id]) << std::endl;\n\n _CodedOutputStream->WriteVarint32(msg.ByteSize());\n if ( !msg.SerializeToCodedStream(_CodedOutputStream) ){\n std::cout << \"SerializeToCodedStream error \" << std::endl;\n assert(false);\n }\n }\n }\n delete _CodedOutputStream;\n delete _OstreamOutputStream;\n mFs.close();\n fout_text.close();\n\n std::cout << \"INFERENCE CALIBRATION (QUERY BINS):\" << std::endl;\n std::vector<int> abc;\n for(int i=0;i<=10;i++){\n abc.push_back(0);\n }\n int bad = 0;\n for(long i=0;i<factorgraphs[0].n_var;i++){\n const Variable & variable = factorgraphs[0].variables[i];\n if(variable.is_evid == true){\n continue;\n }\n int bin = (int)(agg_means[variable.id]\/agg_nsamples[variable.id]*10);\n if(bin >= 0 && bin <=10){\n abc[bin] ++;\n }else{\n \/\/std::cout << variable.id << \" \" << variable.agg_mean << \" \" << variable.n_sample << std::endl;\n bad ++;\n }\n }\n abc[9] += abc[10];\n for(int i=0;i<10;i++){\n std::cout << \"PROB BIN 0.\" << i << \"~0.\" << (i+1) << \" --> # \" << abc[i] << std::endl;\n }\n\n}\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: templwin.hxx,v $\n *\n * $Revision: 1.28 $\n *\n * last change: $Author: hr $ $Date: 2004-08-02 14:36:36 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _SVTOOLS_TEMPLWIN_HXX\n#define _SVTOOLS_TEMPLWIN_HXX\n\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SV_SPLITWIN_HXX\n#include <vcl\/splitwin.hxx>\n#endif\n#ifndef _SV_TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#ifndef _SV_WINDOW_HXX\n#include <vcl\/window.hxx>\n#endif\n\n#ifndef _HEADBAR_HXX\n#include \"headbar.hxx\"\n#endif\n#ifndef _SVT_FILEVIEW_HXX\n#include \"fileview.hxx\"\n#endif\n#ifndef _ICNVW_HXX\n#include \"ivctrl.hxx\"\n#endif\n#ifndef _SVTOOLS_SVMEDIT2_HXX\n#include \"svmedit2.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_LOCALE_HPP_\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#endif\n\nnamespace com{ namespace sun { namespace star { namespace awt { class XWindow; } } } };\nnamespace com{ namespace sun { namespace star { namespace frame { class XFrame; } } } };\nnamespace com{ namespace sun { namespace star { namespace io { class XPersist; } } } };\nnamespace svtools\n{\n class ODocumentInfoPreview;\n}\n\n\/\/ class SvtDummyHeaderBar_Impl ------------------------------------------\n\nclass SvtDummyHeaderBar_Impl : public Window\n{\nprivate:\n void UpdateBackgroundColor();\n\npublic:\n SvtDummyHeaderBar_Impl( Window* pParent );\n ~SvtDummyHeaderBar_Impl();\n\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n};\n\n\/\/ class SvtIconWindow_Impl ----------------------------------------------\n\nclass SvtIconWindow_Impl : public Window\n{\nprivate:\n SvtDummyHeaderBar_Impl aDummyHeaderBar; \/\/ spaceholder instead of HeaderBar\n SvtIconChoiceCtrl aIconCtrl;\n\n String aNewDocumentRootURL;\n String aTemplateRootURL;\n String aMyDocumentsRootURL;\n String aSamplesFolderRootURL;\n\n long nMaxTextLength;\n\n SvxIconChoiceCtrlEntry* GetEntry( const String& rURL ) const;\n\npublic:\n SvtIconWindow_Impl( Window* pParent );\n ~SvtIconWindow_Impl();\n\n virtual void Resize();\n\n inline long GetMaxTextLength() const { return nMaxTextLength; }\n inline void SetClickHdl( const Link& rLink ) { aIconCtrl.SetClickHdl( rLink ); }\n inline String GetTemplateRootURL() const { return aTemplateRootURL; }\n\n String GetSelectedIconURL() const;\n String GetSelectedIconText() const;\n String GetCursorPosIconURL() const;\n String GetIconText( const String& rURL ) const;\n void InvalidateIconControl();\n void SetCursorPos( ULONG nPos );\n ULONG GetCursorPos() const;\n ULONG GetSelectEntryPos() const;\n void SetFocus();\n long CalcHeight() const;\n sal_Bool IsRootURL( const String& rURL ) const;\n ULONG GetRootPos( const String& rURL ) const;\n void UpdateIcons( sal_Bool _bHiContrast );\n\n inline sal_Bool ProcessKeyEvent( const KeyEvent& rKEvt );\n inline const String& GetSamplesFolderURL() const;\n\n void SelectFolder(sal_Int32 nFolderPos);\n};\n\ninline sal_Bool SvtIconWindow_Impl::ProcessKeyEvent( const KeyEvent& rKEvt )\n{\n return ( rKEvt.GetKeyCode().IsMod2() ? aIconCtrl.DoKeyInput( rKEvt ) : sal_False );\n}\n\ninline const String& SvtIconWindow_Impl::GetSamplesFolderURL() const\n{\n return aSamplesFolderRootURL;\n}\n\n\/\/ class SvtFileViewWindow_Impl ------------------------------------------\n\nclass SvtTemplateWindow;\n\nclass SvtFileViewWindow_Impl : public Window\n{\nprivate:\n SvtTemplateWindow& rParent;\n SvtFileView aFileView;\n Link aNewFolderLink;\n String aCurrentRootURL;\n String aFolderURL;\n String aSamplesFolderURL;\n\n sal_Bool bIsTemplateFolder;\n\n ::com::sun::star::uno::Sequence< ::rtl::OUString >\n GetNewDocContents() const;\n\npublic:\n SvtFileViewWindow_Impl( SvtTemplateWindow* pParent, const String& rSamplesFolderURL );\n ~SvtFileViewWindow_Impl();\n\n virtual void Resize();\n\n inline void SetSelectHdl( const Link& rLink ) { aFileView.SetSelectHdl( rLink ); }\n inline void SetDoubleClickHdl( const Link& rLink ) { aFileView.SetDoubleClickHdl( rLink ); }\n inline void SetNewFolderHdl( const Link& rLink ) { aNewFolderLink = rLink; }\n inline void ResetCursor() { aFileView.ResetCursor(); }\n inline sal_Bool IsTemplateFolder() const { return bIsTemplateFolder; }\n inline String GetFolderURL() const { return aFolderURL; }\n inline String GetRootURL() const { return aCurrentRootURL; }\n inline void OpenRoot( const String& rRootURL )\n { aCurrentRootURL = rRootURL; OpenFolder( rRootURL ); }\n\n String GetSelectedFile() const;\n void OpenFolder( const String& rURL );\n sal_Bool HasPreviousLevel( String& rURL ) const;\n String GetFolderTitle() const;\n void SetFocus();\n};\n\n\/\/ class SvtFrameWindow_Impl ---------------------------------------------\n\nclass SvtDocInfoTable_Impl : public ResStringArray\n{\nprivate:\n String aEmptyString;\n\npublic:\n SvtDocInfoTable_Impl();\n\n const String& GetString( long nId ) const;\n};\n\nclass SvtExtendedMultiLineEdit_Impl : public ExtMultiLineEdit\n{\npublic:\n SvtExtendedMultiLineEdit_Impl( Window* pParent,WinBits _nBits );\n inline ~SvtExtendedMultiLineEdit_Impl() {}\n\n inline void Clear() { SetText( String() ); }\n void InsertEntry( const String& rTitle, const String& rValue );\n};\n\nclass SvtFrameWindow_Impl : public Window\n{\nprivate:\n ::com::sun::star::uno::Reference < ::com::sun::star::frame::XFrame >\n xFrame;\n ::com::sun::star::uno::Reference < ::com::sun::star::io::XPersist >\n xDocInfo;\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindow >\n xWindow;\n\n ::svtools::ODocumentInfoPreview*\n pEditWin;\n Window* pTextWin;\n Window* pEmptyWin;\n ::com::sun::star::lang::Locale aLocale;\n SvtDocInfoTable_Impl aInfoTable;\n String aCurrentURL;\n ::rtl::OUString m_aOpenURL;\n sal_Bool bDocInfo;\n\n void ShowDocInfo( const String& rURL );\n void ViewEditWin();\n void ViewTextWin();\n void ViewEmptyWin();\n void ViewNonEmptyWin(); \/\/ views depending on bDocInfo\n\npublic:\n SvtFrameWindow_Impl( Window* pParent );\n ~SvtFrameWindow_Impl();\n\n virtual void Resize();\n\n void OpenFile( const String& rURL, sal_Bool bPreview, sal_Bool bIsTemplate, sal_Bool bAsTemplate );\n void ToggleView( sal_Bool bDocInfo );\n};\n\n\/\/ class SvtTemplateWindow -----------------------------------------------\n\nclass HistoryList_Impl;\n\nclass SvtTemplateWindow : public Window\n{\nprivate:\n ToolBox aFileViewTB;\n ToolBox aFrameWinTB;\n SplitWindow aSplitWin;\n\n SvtIconWindow_Impl* pIconWin;\n SvtFileViewWindow_Impl* pFileWin;\n SvtFrameWindow_Impl* pFrameWin;\n HistoryList_Impl* pHistoryList;\n\n Link aSelectHdl;\n Link aDoubleClickHdl;\n Link aNewFolderHdl;\n Link aSendFocusHdl;\n\n Timer aSelectTimer;\n\n String aFolderTitle;\n\n virtual void Resize();\n\n DECL_LINK( IconClickHdl_Impl, SvtIconChoiceCtrl* );\n DECL_LINK( FileSelectHdl_Impl, SvtFileView* );\n DECL_LINK( FileDblClickHdl_Impl, SvtFileView* );\n DECL_LINK( NewFolderHdl_Impl, SvtFileView* );\n DECL_LINK( TimeoutHdl_Impl, Timer* );\n DECL_LINK( ClickHdl_Impl, ToolBox* );\n DECL_LINK( ResizeHdl_Impl, SplitWindow* ); \/\/ used for split and initial setting of toolbar pos\n\n void PrintFile( const String& rURL );\n void AppendHistoryURL( const String& rURL, ULONG nGroup );\n void OpenHistory();\n void DoAction( USHORT nAction );\n void InitToolBoxes();\n void InitToolBoxImages();\n void UpdateIcons();\n\nprotected:\n virtual long PreNotify( NotifyEvent& rNEvt );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\npublic:\n SvtTemplateWindow( Window* pParent );\n ~SvtTemplateWindow();\n\n inline void SetSelectHdl( const Link& rLink ) { aSelectHdl = rLink; }\n inline void SetDoubleClickHdl( const Link& rLink ) { aDoubleClickHdl = rLink; }\n inline void SetNewFolderHdl( const Link& rLink ) { aNewFolderHdl = rLink; }\n inline void SetSendFocusHdl( const Link& rLink ) { aSendFocusHdl = rLink; }\n inline sal_Bool IsTemplateFolderOpen() const { return pFileWin->IsTemplateFolder(); }\n inline sal_Bool HasIconWinFocus() const { return pIconWin->HasChildPathFocus(); }\n\n void ReadViewSettings( );\n void WriteViewSettings( );\n sal_Bool IsFileSelected() const;\n String GetSelectedFile() const;\n void OpenFile( sal_Bool bNotAsTemplate );\n String GetFolderTitle() const;\n void SetFocus( sal_Bool bIconWin );\n void OpenTemplateRoot();\n void SetPrevLevelButtonState( const String& rURL ); \/\/ sets state (enable\/disable) for previous level button\n void ClearHistory();\n long CalcHeight() const;\n\n void SelectFolder(sal_Int32 nFolderPosition);\n};\n\n#endif \/\/ _SVTOOLS_TEMPLWIN_HXX\n\n<commit_msg>INTEGRATION: CWS os43 (1.28.136); FILE MERGED 2004\/11\/15 14:08:35 pb 1.28.136.1: fix: #i37154# enable DirectoryUp of MyDocuments<commit_after>\/*************************************************************************\n *\n * $RCSfile: templwin.hxx,v $\n *\n * $Revision: 1.29 $\n *\n * last change: $Author: hr $ $Date: 2004-11-26 23:01:46 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _SVTOOLS_TEMPLWIN_HXX\n#define _SVTOOLS_TEMPLWIN_HXX\n\n#ifndef _TOOLS_RESARY_HXX\n#include <tools\/resary.hxx>\n#endif\n#ifndef _SV_SPLITWIN_HXX\n#include <vcl\/splitwin.hxx>\n#endif\n#ifndef _SV_TOOLBOX_HXX\n#include <vcl\/toolbox.hxx>\n#endif\n#ifndef _SV_WINDOW_HXX\n#include <vcl\/window.hxx>\n#endif\n\n#ifndef _HEADBAR_HXX\n#include \"headbar.hxx\"\n#endif\n#ifndef _SVT_FILEVIEW_HXX\n#include \"fileview.hxx\"\n#endif\n#ifndef _ICNVW_HXX\n#include \"ivctrl.hxx\"\n#endif\n#ifndef _SVTOOLS_SVMEDIT2_HXX\n#include \"svmedit2.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_LOCALE_HPP_\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#endif\n\nnamespace com{ namespace sun { namespace star { namespace awt { class XWindow; } } } };\nnamespace com{ namespace sun { namespace star { namespace frame { class XFrame; } } } };\nnamespace com{ namespace sun { namespace star { namespace io { class XPersist; } } } };\nnamespace svtools\n{\n class ODocumentInfoPreview;\n}\n\n\/\/ class SvtDummyHeaderBar_Impl ------------------------------------------\n\nclass SvtDummyHeaderBar_Impl : public Window\n{\nprivate:\n void UpdateBackgroundColor();\n\npublic:\n SvtDummyHeaderBar_Impl( Window* pParent );\n ~SvtDummyHeaderBar_Impl();\n\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n};\n\n\/\/ class SvtIconWindow_Impl ----------------------------------------------\n\nclass SvtIconWindow_Impl : public Window\n{\nprivate:\n SvtDummyHeaderBar_Impl aDummyHeaderBar; \/\/ spaceholder instead of HeaderBar\n SvtIconChoiceCtrl aIconCtrl;\n\n String aNewDocumentRootURL;\n String aTemplateRootURL;\n String aMyDocumentsRootURL;\n String aSamplesFolderRootURL;\n\n long nMaxTextLength;\n\n SvxIconChoiceCtrlEntry* GetEntry( const String& rURL ) const;\n\npublic:\n SvtIconWindow_Impl( Window* pParent );\n ~SvtIconWindow_Impl();\n\n virtual void Resize();\n\n inline long GetMaxTextLength() const { return nMaxTextLength; }\n inline void SetClickHdl( const Link& rLink ) { aIconCtrl.SetClickHdl( rLink ); }\n\n String GetSelectedIconURL() const;\n String GetSelectedIconText() const;\n String GetCursorPosIconURL() const;\n String GetIconText( const String& rURL ) const;\n void InvalidateIconControl();\n void SetCursorPos( ULONG nPos );\n ULONG GetCursorPos() const;\n ULONG GetSelectEntryPos() const;\n void SetFocus();\n long CalcHeight() const;\n sal_Bool IsRootURL( const String& rURL ) const;\n ULONG GetRootPos( const String& rURL ) const;\n void UpdateIcons( sal_Bool _bHiContrast );\n\n inline sal_Bool ProcessKeyEvent( const KeyEvent& rKEvt );\n\n inline const String& GetTemplateRootURL() const { return aTemplateRootURL; }\n inline const String& GetMyDocumentsRootURL() const { return aMyDocumentsRootURL; }\n inline const String& GetSamplesFolderURL() const { return aSamplesFolderRootURL; }\n\n void SelectFolder(sal_Int32 nFolderPos);\n};\n\ninline sal_Bool SvtIconWindow_Impl::ProcessKeyEvent( const KeyEvent& rKEvt )\n{\n return ( rKEvt.GetKeyCode().IsMod2() ? aIconCtrl.DoKeyInput( rKEvt ) : sal_False );\n}\n\n\/\/ class SvtFileViewWindow_Impl ------------------------------------------\n\nclass SvtTemplateWindow;\n\nclass SvtFileViewWindow_Impl : public Window\n{\nprivate:\n SvtTemplateWindow& rParent;\n SvtFileView aFileView;\n Link aNewFolderLink;\n String aCurrentRootURL;\n String aFolderURL;\n String aMyDocumentsURL;\n String aSamplesFolderURL;\n\n sal_Bool bIsTemplateFolder;\n\n ::com::sun::star::uno::Sequence< ::rtl::OUString >\n GetNewDocContents() const;\n\npublic:\n SvtFileViewWindow_Impl( SvtTemplateWindow* pParent );\n ~SvtFileViewWindow_Impl();\n\n virtual void Resize();\n\n inline void SetSelectHdl( const Link& rLink ) { aFileView.SetSelectHdl( rLink ); }\n inline void SetDoubleClickHdl( const Link& rLink ) { aFileView.SetDoubleClickHdl( rLink ); }\n inline void SetNewFolderHdl( const Link& rLink ) { aNewFolderLink = rLink; }\n inline void ResetCursor() { aFileView.ResetCursor(); }\n inline sal_Bool IsTemplateFolder() const { return bIsTemplateFolder; }\n inline String GetFolderURL() const { return aFolderURL; }\n inline String GetRootURL() const { return aCurrentRootURL; }\n inline void OpenRoot( const String& rRootURL )\n { aCurrentRootURL = rRootURL; OpenFolder( rRootURL ); }\n inline void SetMyDocumentsURL( const String& _rNewURL ) { aMyDocumentsURL = _rNewURL; }\n inline void SetSamplesFolderURL( const String& _rNewURL ) { aSamplesFolderURL = _rNewURL; }\n\n String GetSelectedFile() const;\n void OpenFolder( const String& rURL );\n sal_Bool HasPreviousLevel( String& rURL ) const;\n String GetFolderTitle() const;\n void SetFocus();\n};\n\n\/\/ class SvtFrameWindow_Impl ---------------------------------------------\n\nclass SvtDocInfoTable_Impl : public ResStringArray\n{\nprivate:\n String aEmptyString;\n\npublic:\n SvtDocInfoTable_Impl();\n\n const String& GetString( long nId ) const;\n};\n\nclass SvtExtendedMultiLineEdit_Impl : public ExtMultiLineEdit\n{\npublic:\n SvtExtendedMultiLineEdit_Impl( Window* pParent,WinBits _nBits );\n inline ~SvtExtendedMultiLineEdit_Impl() {}\n\n inline void Clear() { SetText( String() ); }\n void InsertEntry( const String& rTitle, const String& rValue );\n};\n\nclass SvtFrameWindow_Impl : public Window\n{\nprivate:\n ::com::sun::star::uno::Reference < ::com::sun::star::frame::XFrame >\n xFrame;\n ::com::sun::star::uno::Reference < ::com::sun::star::io::XPersist >\n xDocInfo;\n ::com::sun::star::uno::Reference< ::com::sun::star::awt::XWindow >\n xWindow;\n\n ::svtools::ODocumentInfoPreview*\n pEditWin;\n Window* pTextWin;\n Window* pEmptyWin;\n ::com::sun::star::lang::Locale aLocale;\n SvtDocInfoTable_Impl aInfoTable;\n String aCurrentURL;\n ::rtl::OUString m_aOpenURL;\n sal_Bool bDocInfo;\n\n void ShowDocInfo( const String& rURL );\n void ViewEditWin();\n void ViewTextWin();\n void ViewEmptyWin();\n void ViewNonEmptyWin(); \/\/ views depending on bDocInfo\n\npublic:\n SvtFrameWindow_Impl( Window* pParent );\n ~SvtFrameWindow_Impl();\n\n virtual void Resize();\n\n void OpenFile( const String& rURL, sal_Bool bPreview, sal_Bool bIsTemplate, sal_Bool bAsTemplate );\n void ToggleView( sal_Bool bDocInfo );\n};\n\n\/\/ class SvtTemplateWindow -----------------------------------------------\n\nclass HistoryList_Impl;\n\nclass SvtTemplateWindow : public Window\n{\nprivate:\n ToolBox aFileViewTB;\n ToolBox aFrameWinTB;\n SplitWindow aSplitWin;\n\n SvtIconWindow_Impl* pIconWin;\n SvtFileViewWindow_Impl* pFileWin;\n SvtFrameWindow_Impl* pFrameWin;\n HistoryList_Impl* pHistoryList;\n\n Link aSelectHdl;\n Link aDoubleClickHdl;\n Link aNewFolderHdl;\n Link aSendFocusHdl;\n\n Timer aSelectTimer;\n\n String aFolderTitle;\n\n virtual void Resize();\n\n DECL_LINK( IconClickHdl_Impl, SvtIconChoiceCtrl* );\n DECL_LINK( FileSelectHdl_Impl, SvtFileView* );\n DECL_LINK( FileDblClickHdl_Impl, SvtFileView* );\n DECL_LINK( NewFolderHdl_Impl, SvtFileView* );\n DECL_LINK( TimeoutHdl_Impl, Timer* );\n DECL_LINK( ClickHdl_Impl, ToolBox* );\n DECL_LINK( ResizeHdl_Impl, SplitWindow* ); \/\/ used for split and initial setting of toolbar pos\n\n void PrintFile( const String& rURL );\n void AppendHistoryURL( const String& rURL, ULONG nGroup );\n void OpenHistory();\n void DoAction( USHORT nAction );\n void InitToolBoxes();\n void InitToolBoxImages();\n void UpdateIcons();\n\nprotected:\n virtual long PreNotify( NotifyEvent& rNEvt );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n\npublic:\n SvtTemplateWindow( Window* pParent );\n ~SvtTemplateWindow();\n\n inline void SetSelectHdl( const Link& rLink ) { aSelectHdl = rLink; }\n inline void SetDoubleClickHdl( const Link& rLink ) { aDoubleClickHdl = rLink; }\n inline void SetNewFolderHdl( const Link& rLink ) { aNewFolderHdl = rLink; }\n inline void SetSendFocusHdl( const Link& rLink ) { aSendFocusHdl = rLink; }\n inline sal_Bool IsTemplateFolderOpen() const { return pFileWin->IsTemplateFolder(); }\n inline sal_Bool HasIconWinFocus() const { return pIconWin->HasChildPathFocus(); }\n\n void ReadViewSettings( );\n void WriteViewSettings( );\n sal_Bool IsFileSelected() const;\n String GetSelectedFile() const;\n void OpenFile( sal_Bool bNotAsTemplate );\n String GetFolderTitle() const;\n void SetFocus( sal_Bool bIconWin );\n void OpenTemplateRoot();\n void SetPrevLevelButtonState( const String& rURL ); \/\/ sets state (enable\/disable) for previous level button\n void ClearHistory();\n long CalcHeight() const;\n\n void SelectFolder(sal_Int32 nFolderPosition);\n};\n\n#endif \/\/ _SVTOOLS_TEMPLWIN_HXX\n\n<|endoftext|>"} {"text":"<commit_before>#include \"viewport.h\"\n\n#include <cassert>\n#include <iostream>\n#include <cmath>\n\n#include <QtGui\/QMouseEvent>\n\n#include <ImathMatrix.h>\n\n#include <GL\/glu.h>\n\nnamespace {\nstd::vector<Viewport*> s_instances;\n}\n\nViewport::Viewport(QWidget* parent)\n : QGLWidget(parent, (s_instances.size() > 0 ? s_instances[0] : NULL)),\n m_sceneDistance(10), m_sceneRotationX(30), m_sceneRotationY(30), m_origin(0, 0, 0),\n m_mouseX(0), m_mouseY(0) {\n\ts_instances.push_back(this);\n\n\tsetMouseTracking(true);\n}\n\nViewport::~Viewport() {\n\tint index = -1;\n\tfor(unsigned a = 0; a < s_instances.size(); a++)\n\t\tif(s_instances[a] == this)\n\t\t\tindex = a;\n\tassert(index >= 0);\n\ts_instances.erase(s_instances.begin() + index);\n}\n\nvoid Viewport::initializeGL() {\n\tglClearColor(0, 0, 0, 0);\n\tresizeGL(width(), height());\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tfloat white[3] = {1, 1, 1};\n\tfloat position[4] = {1, 1, 1, 0};\n\n\tglEnable(GL_LIGHT0);\n\tglLightfv(GL_LIGHT0, GL_AMBIENT, white);\n\tglLightfv(GL_LIGHT0, GL_DIFFUSE, white);\n\tglLightfv(GL_LIGHT0, GL_POSITION, position);\n\n\t\/\/ glEnable(GL_COLOR_MATERIAL);\n\n\tm_timer = boost::posix_time::microsec_clock::universal_time();\n}\n\nnamespace {\n\nImath::V3f eyePosition(float sceneRotX, float sceneRotY, float sceneDist) {\n\tImath::V3f eye;\n\n\teye.x = sin(-sceneRotX \/ 180.0f * M_PI) * sceneDist;\n\teye.z = cos(-sceneRotX \/ 180.0f * M_PI) * sceneDist;\n\n\teye.y = sin(sceneRotY \/ 180.0f * M_PI) * sceneDist;\n\teye.x *= cos(sceneRotY \/ 180.0f * M_PI);\n\teye.z *= cos(sceneRotY \/ 180.0f * M_PI);\n\n\treturn eye;\n}\n\nImath::M44f lookAt(const Imath::V3f& eyePosition, const Imath::V3f& lookAt,\n const Imath::V3f& upVector) {\n\tImath::V3f forward = lookAt - eyePosition;\n\tforward.normalize();\n\n\tImath::V3f side = forward.cross(upVector);\n\tside.normalize();\n\n\tImath::V3f up = side.cross(forward);\n\tup.normalize();\n\n\tImath::M44f rotmat;\n\trotmat.makeIdentity();\n\n\trotmat[0][0] = side.x;\n\trotmat[1][0] = side.y;\n\trotmat[2][0] = side.z;\n\n\trotmat[0][1] = up.x;\n\trotmat[1][1] = up.y;\n\trotmat[2][1] = up.z;\n\n\trotmat[0][2] = -forward.x;\n\trotmat[1][2] = -forward.y;\n\trotmat[2][2] = -forward.z;\n\n\tImath::M44f transmat;\n\ttransmat.setTranslation(Imath::V3f(-eyePosition.x, -eyePosition.y, -eyePosition.z));\n\n\treturn transmat * rotmat;\n}\n}\n\nvoid Viewport::paintGL() {\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tgluPerspective(45, (float)width() \/ (float)height(), m_sceneDistance * 0.1f,\n\t std::max(m_sceneDistance * 2.0f, 1000.0f));\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\tconst Imath::V3f eye =\n\t eyePosition(m_sceneRotationX, m_sceneRotationY, m_sceneDistance);\n\n\tconst Imath::M44f m = lookAt(eye + m_origin, m_origin, Imath::V3f(0, 1, 0));\n\tglMultMatrixf(m.getValue());\n\n\tconst boost::posix_time::ptime t(boost::posix_time::microsec_clock::universal_time());\n\tconst float dt = (float)(t - m_timer).total_microseconds() \/ 1e6f;\n\tm_timer = t;\n\n\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\temit render(dt);\n\tglPopAttrib();\n}\n\nvoid Viewport::resizeGL(int w, int h) {\n\tQGLWidget::resizeGL(w, h);\n\n\tglViewport(0, 0, w, h);\n}\n\nvoid Viewport::mouseMoveEvent(QMouseEvent* event) {\n\tif(event->buttons() & Qt::LeftButton) {\n\t\tm_sceneRotationX += (float)(event->x() - m_mouseX) \/ (float)width() * 360.0;\n\t\tm_sceneRotationY += (float)(event->y() - m_mouseY) \/ (float)height() * 360.0;\n\n\t\tupdate();\n\t}\n\tm_sceneRotationY = std::max(-89.0f, m_sceneRotationY);\n\tm_sceneRotationY = std::min(89.0f, m_sceneRotationY);\n\n\tif(event->buttons() & Qt::RightButton) {\n\t\tm_sceneDistance \/= pow(10, (float)(event->y() - m_mouseY) \/ (float)height());\n\n\t\tupdate();\n\t}\n\n\tif(event->buttons() & Qt::MiddleButton) {\n\t\tconst Imath::V3f eye =\n\t\t eyePosition(m_sceneRotationX, m_sceneRotationY, m_sceneDistance);\n\n\t\tconst float dx = -(float)(event->x() - m_mouseX) \/ (float)(width());\n\t\tconst float dy = (float)(event->y() - m_mouseY) \/ (float)(height());\n\n\t\tImath::V3f right = Imath::V3f(0, 1, 0).cross(eye).normalized();\n\t\tImath::V3f up = eye.cross(right).normalized();\n\n\t\tright = right * m_sceneDistance * dx;\n\t\tup = up * m_sceneDistance * dy;\n\n\t\tm_origin += right + up;\n\n\t\tupdate();\n\t}\n\n\tm_mouseX = event->x();\n\tm_mouseY = event->y();\n}\n<commit_msg>Perspective matrix computation reimplemented<commit_after>#include \"viewport.h\"\n\n#include <cassert>\n#include <iostream>\n#include <cmath>\n\n#include <QtGui\/QMouseEvent>\n\n#include <ImathMatrix.h>\n\n#include <GL\/glu.h>\n\nnamespace {\nstd::vector<Viewport*> s_instances;\n}\n\nViewport::Viewport(QWidget* parent)\n : QGLWidget(parent, (s_instances.size() > 0 ? s_instances[0] : NULL)),\n m_sceneDistance(10), m_sceneRotationX(30), m_sceneRotationY(30), m_origin(0, 0, 0),\n m_mouseX(0), m_mouseY(0) {\n\ts_instances.push_back(this);\n\n\tsetMouseTracking(true);\n}\n\nViewport::~Viewport() {\n\tint index = -1;\n\tfor(unsigned a = 0; a < s_instances.size(); a++)\n\t\tif(s_instances[a] == this)\n\t\t\tindex = a;\n\tassert(index >= 0);\n\ts_instances.erase(s_instances.begin() + index);\n}\n\nvoid Viewport::initializeGL() {\n\tglClearColor(0, 0, 0, 0);\n\tresizeGL(width(), height());\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tfloat white[3] = {1, 1, 1};\n\tfloat position[4] = {1, 1, 1, 0};\n\n\tglEnable(GL_LIGHT0);\n\tglLightfv(GL_LIGHT0, GL_AMBIENT, white);\n\tglLightfv(GL_LIGHT0, GL_DIFFUSE, white);\n\tglLightfv(GL_LIGHT0, GL_POSITION, position);\n\n\t\/\/ glEnable(GL_COLOR_MATERIAL);\n\n\tm_timer = boost::posix_time::microsec_clock::universal_time();\n}\n\nnamespace {\n\nImath::V3f eyePosition(float sceneRotX, float sceneRotY, float sceneDist) {\n\tImath::V3f eye;\n\n\teye.x = sin(-sceneRotX \/ 180.0f * M_PI) * sceneDist;\n\teye.z = cos(-sceneRotX \/ 180.0f * M_PI) * sceneDist;\n\n\teye.y = sin(sceneRotY \/ 180.0f * M_PI) * sceneDist;\n\teye.x *= cos(sceneRotY \/ 180.0f * M_PI);\n\teye.z *= cos(sceneRotY \/ 180.0f * M_PI);\n\n\treturn eye;\n}\n\nImath::M44f lookAt(const Imath::V3f& eyePosition, const Imath::V3f& lookAt,\n const Imath::V3f& upVector) {\n\tImath::V3f forward = lookAt - eyePosition;\n\tforward.normalize();\n\n\tImath::V3f side = forward.cross(upVector);\n\tside.normalize();\n\n\tImath::V3f up = side.cross(forward);\n\tup.normalize();\n\n\tImath::M44f rotmat;\n\trotmat.makeIdentity();\n\n\trotmat[0][0] = side.x;\n\trotmat[1][0] = side.y;\n\trotmat[2][0] = side.z;\n\n\trotmat[0][1] = up.x;\n\trotmat[1][1] = up.y;\n\trotmat[2][1] = up.z;\n\n\trotmat[0][2] = -forward.x;\n\trotmat[1][2] = -forward.y;\n\trotmat[2][2] = -forward.z;\n\n\tImath::M44f transmat;\n\ttransmat.setTranslation(Imath::V3f(-eyePosition.x, -eyePosition.y, -eyePosition.z));\n\n\treturn transmat * rotmat;\n}\n\nImath::M44f perspective(float fovyInDegrees, float aspectRatio, float znear, float zfar) {\n\tconst float f = 1.0 \/ tanf(fovyInDegrees * M_PI \/ 360.0);\n\tconst float A = (zfar + znear) \/ (znear - zfar);\n\tconst float B = 2.0 * zfar * znear \/ (znear - zfar);\n\n\treturn Imath::M44f(\n\t\tf \/ aspectRatio, 0, 0, 0,\n\t\t0, f, 0, 0,\n\t\t0, 0, A, -1,\n\t\t0, 0, B, 0);\n}\n}\n\nvoid Viewport::paintGL() {\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\t{\n\t\tconst Imath::M44f persp =\n\t\t perspective(45, (float)width() \/ (float)height(), m_sceneDistance * 0.1f,\n\t\t std::max(m_sceneDistance * 2.0f, 1000.0f));\n\t\tglMatrixMode(GL_PROJECTION);\n\t\tglLoadMatrixf(persp.getValue());\n\t}\n\n\t{\n\t\tconst Imath::M44f m = lookAt(\n\t\t eyePosition(m_sceneRotationX, m_sceneRotationY, m_sceneDistance) + m_origin,\n\t\t m_origin, Imath::V3f(0, 1, 0));\n\t\tglMatrixMode(GL_MODELVIEW);\n\t\tglLoadMatrixf(m.getValue());\n\t}\n\n\tconst boost::posix_time::ptime t(boost::posix_time::microsec_clock::universal_time());\n\tconst float dt = (float)(t - m_timer).total_microseconds() \/ 1e6f;\n\tm_timer = t;\n\n\tglPushAttrib(GL_ALL_ATTRIB_BITS);\n\temit render(dt);\n\tglPopAttrib();\n}\n\nvoid Viewport::resizeGL(int w, int h) {\n\tQGLWidget::resizeGL(w, h);\n\n\tglViewport(0, 0, w, h);\n}\n\nvoid Viewport::mouseMoveEvent(QMouseEvent* event) {\n\tif(event->buttons() & Qt::LeftButton) {\n\t\tm_sceneRotationX += (float)(event->x() - m_mouseX) \/ (float)width() * 360.0;\n\t\tm_sceneRotationY += (float)(event->y() - m_mouseY) \/ (float)height() * 360.0;\n\n\t\tupdate();\n\t}\n\tm_sceneRotationY = std::max(-89.0f, m_sceneRotationY);\n\tm_sceneRotationY = std::min(89.0f, m_sceneRotationY);\n\n\tif(event->buttons() & Qt::RightButton) {\n\t\tm_sceneDistance \/= pow(10, (float)(event->y() - m_mouseY) \/ (float)height());\n\n\t\tupdate();\n\t}\n\n\tif(event->buttons() & Qt::MiddleButton) {\n\t\tconst Imath::V3f eye =\n\t\t eyePosition(m_sceneRotationX, m_sceneRotationY, m_sceneDistance);\n\n\t\tconst float dx = -(float)(event->x() - m_mouseX) \/ (float)(width());\n\t\tconst float dy = (float)(event->y() - m_mouseY) \/ (float)(height());\n\n\t\tImath::V3f right = Imath::V3f(0, 1, 0).cross(eye).normalized();\n\t\tImath::V3f up = eye.cross(right).normalized();\n\n\t\tright = right * m_sceneDistance * dx;\n\t\tup = up * m_sceneDistance * dy;\n\n\t\tm_origin += right + up;\n\n\t\tupdate();\n\t}\n\n\tm_mouseX = event->x();\n\tm_mouseY = event->y();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2018 Advanced Micro Devices, Inc.\n * All rights reserved.\n *\n * For use for simulation and test purposes only\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Matt Sinclair\n *\/\n\n#ifndef __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n#define __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n\n#include \"arch\/gcn3\/insts\/gpu_static_inst.hh\"\n#include \"arch\/gcn3\/insts\/op_encodings.hh\"\n#include \"debug\/GPUMem.hh\"\n#include \"gpu-compute\/gpu_dyn_inst.hh\"\n\n\/**\n * Helper function for instructions declared in op_encodings. This function\n * takes in all of the arguments for a given memory request we are trying to\n * initialize, then submits the request or requests depending on if the\n * original request is aligned or unaligned.\n *\/\ntemplate<typename T, int N>\ninline void\ninitMemReqHelper(GPUDynInstPtr gpuDynInst, MemCmd mem_req_type,\n bool is_atomic=false)\n{\n \/\/ local variables\n int req_size = N * sizeof(T);\n int block_size = gpuDynInst->computeUnit()->cacheLineSize();\n Addr vaddr = 0, split_addr = 0;\n bool misaligned_acc = false;\n RequestPtr req = nullptr, req1 = nullptr, req2 = nullptr;\n PacketPtr pkt = nullptr, pkt1 = nullptr, pkt2 = nullptr;\n\n gpuDynInst->resetEntireStatusVector();\n for (int lane = 0; lane < Gcn3ISA::NumVecElemPerVecReg; ++lane) {\n if (gpuDynInst->exec_mask[lane]) {\n vaddr = gpuDynInst->addr[lane];\n\n \/**\n * the base address of the cache line where the the last\n * byte of the request will be stored.\n *\/\n split_addr = roundDown(vaddr + req_size - 1, block_size);\n\n assert(split_addr <= vaddr || split_addr - vaddr < block_size);\n \/**\n * if the base cache line address of the last byte is\n * greater than the address of the first byte then we have\n * a misaligned access.\n *\/\n misaligned_acc = split_addr > vaddr;\n\n if (is_atomic) {\n req = std::make_shared<Request>(vaddr, sizeof(T), 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId,\n gpuDynInst->makeAtomicOpFunctor<T>(\n &(reinterpret_cast<T*>(gpuDynInst->a_data))[lane],\n &(reinterpret_cast<T*>(gpuDynInst->x_data))[lane]));\n } else {\n req = std::make_shared<Request>(vaddr, req_size, 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId);\n }\n\n if (misaligned_acc) {\n gpuDynInst->setStatusVector(lane, 2);\n req->splitOnVaddr(split_addr, req1, req2);\n gpuDynInst->setRequestFlags(req1);\n gpuDynInst->setRequestFlags(req2);\n pkt1 = new Packet(req1, mem_req_type);\n pkt2 = new Packet(req2, mem_req_type);\n pkt1->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N]);\n pkt2->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N + req1->getSize()]);\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: index: %d unaligned memory \"\n \"request for %#x\\n\", gpuDynInst->cu_id,\n gpuDynInst->simdId, gpuDynInst->wfSlotId, lane,\n split_addr);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt1);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt2);\n } else {\n gpuDynInst->setStatusVector(lane, 1);\n gpuDynInst->setRequestFlags(req);\n pkt = new Packet(req, mem_req_type);\n pkt->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N]);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt);\n }\n } else { \/\/ if lane is not active, then no pending requests\n gpuDynInst->setStatusVector(lane, 0);\n }\n }\n}\n\n\/**\n * Helper function for scalar instructions declared in op_encodings. This\n * function takes in all of the arguments for a given memory request we are\n * trying to initialize, then submits the request or requests depending on if\n * the original request is aligned or unaligned.\n *\/\ntemplate<typename T, int N>\ninline void\ninitMemReqScalarHelper(GPUDynInstPtr gpuDynInst, MemCmd mem_req_type)\n{\n int req_size = N * sizeof(T);\n int block_size = gpuDynInst->computeUnit()->cacheLineSize();\n Addr vaddr = gpuDynInst->scalarAddr;\n\n \/**\n * the base address of the cache line where the the last byte of\n * the request will be stored.\n *\/\n Addr split_addr = roundDown(vaddr + req_size - 1, block_size);\n\n assert(split_addr <= vaddr || split_addr - vaddr < block_size);\n \/**\n * if the base cache line address of the last byte is greater\n * than the address of the first byte then we have a misaligned\n * access.\n *\/\n bool misaligned_acc = split_addr > vaddr;\n\n RequestPtr req = std::make_shared<Request>(vaddr, req_size, 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId);\n\n if (misaligned_acc) {\n RequestPtr req1, req2;\n req->splitOnVaddr(split_addr, req1, req2);\n gpuDynInst->numScalarReqs = 2;\n gpuDynInst->setRequestFlags(req1);\n gpuDynInst->setRequestFlags(req2);\n PacketPtr pkt1 = new Packet(req1, mem_req_type);\n PacketPtr pkt2 = new Packet(req2, mem_req_type);\n pkt1->dataStatic(gpuDynInst->scalar_data);\n pkt2->dataStatic(gpuDynInst->scalar_data + req1->getSize());\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: unaligned scalar memory request for\"\n \" %#x\\n\", gpuDynInst->cu_id, gpuDynInst->simdId,\n gpuDynInst->wfSlotId, split_addr);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt1);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt2);\n } else {\n gpuDynInst->numScalarReqs = 1;\n gpuDynInst->setRequestFlags(req);\n PacketPtr pkt = new Packet(req, mem_req_type);\n pkt->dataStatic(gpuDynInst->scalar_data);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt);\n }\n}\n\n#endif \/\/ __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n<commit_msg>arch-gcn3: ensure that atomics follow HSA conventions<commit_after>\/*\n * Copyright (c) 2018 Advanced Micro Devices, Inc.\n * All rights reserved.\n *\n * For use for simulation and test purposes only\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Matt Sinclair\n *\/\n\n#ifndef __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n#define __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n\n#include \"arch\/gcn3\/insts\/gpu_static_inst.hh\"\n#include \"arch\/gcn3\/insts\/op_encodings.hh\"\n#include \"debug\/GPUMem.hh\"\n#include \"gpu-compute\/gpu_dyn_inst.hh\"\n\n\/**\n * Helper function for instructions declared in op_encodings. This function\n * takes in all of the arguments for a given memory request we are trying to\n * initialize, then submits the request or requests depending on if the\n * original request is aligned or unaligned.\n *\/\ntemplate<typename T, int N>\ninline void\ninitMemReqHelper(GPUDynInstPtr gpuDynInst, MemCmd mem_req_type,\n bool is_atomic=false)\n{\n \/\/ local variables\n int req_size = N * sizeof(T);\n int block_size = gpuDynInst->computeUnit()->cacheLineSize();\n Addr vaddr = 0, split_addr = 0;\n bool misaligned_acc = false;\n RequestPtr req = nullptr, req1 = nullptr, req2 = nullptr;\n PacketPtr pkt = nullptr, pkt1 = nullptr, pkt2 = nullptr;\n\n gpuDynInst->resetEntireStatusVector();\n for (int lane = 0; lane < Gcn3ISA::NumVecElemPerVecReg; ++lane) {\n if (gpuDynInst->exec_mask[lane]) {\n vaddr = gpuDynInst->addr[lane];\n\n \/**\n * the base address of the cache line where the the last\n * byte of the request will be stored.\n *\/\n split_addr = roundDown(vaddr + req_size - 1, block_size);\n\n assert(split_addr <= vaddr || split_addr - vaddr < block_size);\n \/**\n * if the base cache line address of the last byte is\n * greater than the address of the first byte then we have\n * a misaligned access.\n *\/\n misaligned_acc = split_addr > vaddr;\n\n if (is_atomic) {\n \/\/ make sure request is word aligned\n assert((vaddr & 0x3) == 0);\n\n \/\/ a given lane's atomic can't cross cache lines\n assert(!misaligned_acc);\n\n req = std::make_shared<Request>(vaddr, sizeof(T), 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId,\n gpuDynInst->makeAtomicOpFunctor<T>(\n &(reinterpret_cast<T*>(gpuDynInst->a_data))[lane],\n &(reinterpret_cast<T*>(gpuDynInst->x_data))[lane]));\n } else {\n req = std::make_shared<Request>(vaddr, req_size, 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId);\n }\n\n if (misaligned_acc) {\n gpuDynInst->setStatusVector(lane, 2);\n req->splitOnVaddr(split_addr, req1, req2);\n gpuDynInst->setRequestFlags(req1);\n gpuDynInst->setRequestFlags(req2);\n pkt1 = new Packet(req1, mem_req_type);\n pkt2 = new Packet(req2, mem_req_type);\n pkt1->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N]);\n pkt2->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N + req1->getSize()]);\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: index: %d unaligned memory \"\n \"request for %#x\\n\", gpuDynInst->cu_id,\n gpuDynInst->simdId, gpuDynInst->wfSlotId, lane,\n split_addr);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt1);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt2);\n } else {\n gpuDynInst->setStatusVector(lane, 1);\n gpuDynInst->setRequestFlags(req);\n pkt = new Packet(req, mem_req_type);\n pkt->dataStatic(&(reinterpret_cast<T*>(\n gpuDynInst->d_data))[lane * N]);\n gpuDynInst->computeUnit()->sendRequest(gpuDynInst, lane, pkt);\n }\n } else { \/\/ if lane is not active, then no pending requests\n gpuDynInst->setStatusVector(lane, 0);\n }\n }\n}\n\n\/**\n * Helper function for scalar instructions declared in op_encodings. This\n * function takes in all of the arguments for a given memory request we are\n * trying to initialize, then submits the request or requests depending on if\n * the original request is aligned or unaligned.\n *\/\ntemplate<typename T, int N>\ninline void\ninitMemReqScalarHelper(GPUDynInstPtr gpuDynInst, MemCmd mem_req_type)\n{\n int req_size = N * sizeof(T);\n int block_size = gpuDynInst->computeUnit()->cacheLineSize();\n Addr vaddr = gpuDynInst->scalarAddr;\n\n \/**\n * the base address of the cache line where the the last byte of\n * the request will be stored.\n *\/\n Addr split_addr = roundDown(vaddr + req_size - 1, block_size);\n\n assert(split_addr <= vaddr || split_addr - vaddr < block_size);\n \/**\n * if the base cache line address of the last byte is greater\n * than the address of the first byte then we have a misaligned\n * access.\n *\/\n bool misaligned_acc = split_addr > vaddr;\n\n RequestPtr req = std::make_shared<Request>(vaddr, req_size, 0,\n gpuDynInst->computeUnit()->masterId(), 0,\n gpuDynInst->wfDynId);\n\n if (misaligned_acc) {\n RequestPtr req1, req2;\n req->splitOnVaddr(split_addr, req1, req2);\n gpuDynInst->numScalarReqs = 2;\n gpuDynInst->setRequestFlags(req1);\n gpuDynInst->setRequestFlags(req2);\n PacketPtr pkt1 = new Packet(req1, mem_req_type);\n PacketPtr pkt2 = new Packet(req2, mem_req_type);\n pkt1->dataStatic(gpuDynInst->scalar_data);\n pkt2->dataStatic(gpuDynInst->scalar_data + req1->getSize());\n DPRINTF(GPUMem, \"CU%d: WF[%d][%d]: unaligned scalar memory request for\"\n \" %#x\\n\", gpuDynInst->cu_id, gpuDynInst->simdId,\n gpuDynInst->wfSlotId, split_addr);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt1);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt2);\n } else {\n gpuDynInst->numScalarReqs = 1;\n gpuDynInst->setRequestFlags(req);\n PacketPtr pkt = new Packet(req, mem_req_type);\n pkt->dataStatic(gpuDynInst->scalar_data);\n gpuDynInst->computeUnit()->sendScalarRequest(gpuDynInst, pkt);\n }\n}\n\n#endif \/\/ __ARCH_GCN3_GPU_MEM_HELPERS_HH__\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright © 2017 Arm Ltd and Contributors. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n#include \"ConcatLayer.hpp\"\n#include \"LayerCloneBase.hpp\"\n\n#include <armnn\/TypesUtils.hpp>\n#include <armnn\/utility\/PolymorphicDowncast.hpp>\n#include <backendsCommon\/WorkloadData.hpp>\n#include <backendsCommon\/WorkloadFactory.hpp>\n\n#include <queue>\n\nnamespace armnn\n{\n\nConcatLayer::ConcatLayer(const OriginsDescriptor& param, const char* name)\n : LayerWithParameters(param.GetNumViews(), 1, LayerType::Concat, param, name)\n{\n}\n\nstd::unique_ptr<IWorkload> ConcatLayer::CreateWorkload(const IWorkloadFactory& factory) const\n{\n ConcatQueueDescriptor descriptor;\n\n \/\/ Copies the view origins to the descriptor.\n descriptor.m_ViewOrigins.reserve(m_Param.GetNumViews());\n for (unsigned int i = 0; i < m_Param.GetNumViews(); ++i)\n {\n descriptor.m_ViewOrigins.emplace_back(\n std::vector<unsigned int>(m_Param.GetViewOrigin(i), m_Param.GetViewOrigin(i) + m_Param.GetNumDimensions()));\n }\n\n return factory.CreateConcat(descriptor, PrepInfoAndDesc(descriptor));\n}\n\ntemplate<typename FactoryType>\nvoid ConcatLayer::CreateTensors(const TensorHandleFactoryRegistry& registry,\n const FactoryType& factory,\n bool isMemoryManaged)\n{\n \/\/If sub tensors are supported then the concat\n \/\/just needs to make sure that the outputs of the prev layer\n \/\/are made subtensors of the output of the concat layer.\n m_OutputHandlers[0].CreateTensorHandles(factory, isMemoryManaged);\n\n if (factory.SupportsSubTensors())\n {\n \/\/ check if concat is along the x or y (2 innermost dimensions)\n uint32_t concatAxis = m_Param.GetConcatAxis();\n auto numberOfDimensions = m_Param.GetNumDimensions();\n bool isConcatOnXorY = m_Param.GetNumDimensions() >= 3\n && ((concatAxis == numberOfDimensions - 1) || (concatAxis == numberOfDimensions - 2));\n\n ITensorHandleFactory::FactoryId factoryId = GetOutputSlot(0).GetTensorHandleFactoryId();\n\n std::queue<ConcatLayer*> m_ConcatLayers;\n\n m_ConcatLayers.push(this);\n while (!m_ConcatLayers.empty())\n {\n ConcatLayer* currentLayer = m_ConcatLayers.front();\n ITensorHandle* parentTensor = currentLayer->GetOutputHandler(0).GetData();\n const TensorInfo& parentInfo = currentLayer->GetOutputHandler(0).GetTensorInfo();\n m_ConcatLayers.pop();\n\n const unsigned int numInputSlots = currentLayer->GetNumInputSlots();\n\n \/\/ if concat along x or y (2 innermost dimensions) and the previous layers do not require padding\n bool canUseSubTensorOnXorY = true;\n bool isTensorHandleFactory = std::is_same<armnn::ITensorHandleFactory, FactoryType>::value;\n if (isTensorHandleFactory)\n {\n for (unsigned int i = 0; i < numInputSlots; ++i)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n ITensorHandleFactory* handleFactory = registry.GetFactory(factoryId);\n std::vector<Capability> capabilities =\n handleFactory->GetCapabilities(&(slot->GetOwningLayer()),\n currentLayer,\n CapabilityClass::PaddingRequired);\n if (isConcatOnXorY)\n {\n canUseSubTensorOnXorY = false;\n if (capabilities.empty())\n {\n canUseSubTensorOnXorY = true;\n }\n }\n\n if (!canUseSubTensorOnXorY)\n {\n break;\n }\n }\n }\n\n \/\/ First go through all the input slots and verify that we can sub-tensor all the inputs.\n std::vector<std::unique_ptr<ITensorHandle>> subTensors(0);\n subTensors.reserve(numInputSlots);\n for (unsigned int i = 0; i < numInputSlots; ++i)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n const TensorInfo& info = slot->GetTensorInfo();\n\n auto CreateSubTensor = [&]()\n {\n \/\/ Make sure:\n \/\/ 1) quantization parameters are in the same space\n \/\/ 2) the same TensorHandleFactory is used for input and Concat layer output\n \/\/ 3) the input does not come from a Constant layer or input layer\n \/\/ 4) the input is only read by this concat layer\n \/\/ 5) if concat along x or y (2 innermost dimensions) and the previous layers do not require padding\n if (slot &&\n parentInfo.IsTypeSpaceMatch(info) && \/\/(1)\n factoryId == slot->GetTensorHandleFactoryId() && \/\/(2)\n slot->GetOwningLayer().GetType() != LayerType::Constant && \/\/(3)\n slot->GetOwningLayer().GetType() != LayerType::Input && \/\/(3)\n slot->GetNumConnections() == 1 &&\n canUseSubTensorOnXorY) \/\/(5)\n {\n ARMNN_NO_DEPRECATE_WARN_BEGIN\n return factory.CreateSubTensorHandle(*parentTensor,\n info.GetShape(),\n currentLayer->m_Param.GetViewOrigin(i));\n ARMNN_NO_DEPRECATE_WARN_END\n }\n return std::unique_ptr<ITensorHandle>();\n };\n\n auto subTensor = CreateSubTensor();\n if (!subTensor)\n {\n break; \/\/Failed to create a valid sub-tensor, so stop trying with the rest of the inputs.\n }\n else\n {\n subTensors.push_back(std::move(subTensor)); \/\/ store the valid sub-tensor.\n }\n }\n\n \/\/ Ensure that ALL inputs can be substituted with valid sub-tensors\n if (subTensors.size() < numInputSlots)\n {\n continue; \/\/ Don't optimize this Concat layer with sub-tensors\n }\n\n \/\/ Substitute input tensors with sub-tensors by replacing the output tensors on the connected layers.\n unsigned int i=0;\n for (auto& subTensor : subTensors)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n OutputHandler& outputHandler = slot->GetOutputHandler();\n\n ARMNN_ASSERT_MSG(subTensor, \"ConcatLayer: Expected a valid sub-tensor for substitution.\");\n outputHandler.SetData(std::move(subTensor));\n\n Layer& inputLayer = slot->GetOwningLayer();\n if (inputLayer.GetType() == LayerType::Concat)\n {\n \/\/ Continue with the substitution if the connected inputs are also concat layers\n m_ConcatLayers.push(PolymorphicDowncast<ConcatLayer*>(&inputLayer));\n }\n ++i;\n }\n }\n }\n}\n\nvoid ConcatLayer::CreateTensorHandles(const TensorHandleFactoryRegistry& registry,\n const IWorkloadFactory& workloadFactory,\n const bool isMemoryManaged)\n{\n OutputSlot& slot = GetOutputSlot(0);\n ITensorHandleFactory::FactoryId factoryId = slot.GetTensorHandleFactoryId();\n\n if (factoryId == ITensorHandleFactory::LegacyFactoryId)\n {\n CreateTensors(registry, workloadFactory, isMemoryManaged);\n }\n else\n {\n ITensorHandleFactory* handleFactory = registry.GetFactory(factoryId);\n ARMNN_ASSERT(handleFactory);\n CreateTensors(registry, *handleFactory, isMemoryManaged);\n }\n}\n\nConcatLayer* ConcatLayer::Clone(Graph& graph) const\n{\n return CloneBase<ConcatLayer>(graph, m_Param, GetName());\n}\n\nstd::vector<TensorShape> ConcatLayer::InferOutputShapes(const std::vector<TensorShape>& inputShapes) const\n{\n ARMNN_ASSERT(inputShapes.size() == m_Param.GetNumViews());\n\n unsigned int numDims = m_Param.GetNumDimensions();\n for (unsigned int i=0; i< inputShapes.size(); i++)\n {\n auto& inputShape = inputShapes[i];\n\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: Num Dimensions must match all inputs.\",\n numDims,\n inputShape.GetNumDimensions());\n }\n\n \/\/ Finds the bounding box (extents) of all the views.\n std::vector<unsigned int> extentMin(numDims);\n std::vector<unsigned int> extentMax(numDims);\n for (unsigned int i = 0; i < inputShapes.size(); i++)\n {\n const uint32_t* origin = m_Param.GetViewOrigin(i);\n const armnn::TensorShape& shape = inputShapes[i];\n for (unsigned int d = 0; d < numDims; d++)\n {\n extentMin[d] = std::min(extentMin[d], origin[d]);\n extentMax[d] = std::max(extentMax[d], origin[d] + shape[d]);\n }\n }\n\n \/\/ Checks that the bounding box starts at the origin.\n if (!std::all_of(extentMin.begin(), extentMin.end(), [](unsigned int s) { return s == 0; }))\n {\n throw LayerValidationException(\"ConcatLayer: there is no view that starts at the origin\");\n }\n\n \/\/ Checks that there are no overlaps of views (this would lead to undefined output at those locations).\n \/\/ Checks each pair of views against each other\n \/\/ (and doesn't bother to check against self, or check the same pair both ways round).\n for (unsigned int a = 0; a < inputShapes.size(); a++)\n {\n const uint32_t* aOrigin = m_Param.GetViewOrigin(a);\n const armnn::TensorShape& aShape = inputShapes[a];\n for (unsigned int b = 0; b < a; b++)\n {\n const uint32_t* bOrigin = m_Param.GetViewOrigin(b);\n const armnn::TensorShape& bShape = inputShapes[b];\n\n bool allAxesOverlap = true;\n for (unsigned int d = 0; d < numDims && allAxesOverlap; d++)\n {\n unsigned int a1 = aOrigin[d];\n unsigned int a2 = aOrigin[d] + aShape[d];\n\n unsigned int b1 = bOrigin[d];\n unsigned int b2 = bOrigin[d] + bShape[d];\n\n if (a2 <= b1 || b2 <= a1)\n {\n allAxesOverlap = false;\n }\n }\n if (allAxesOverlap)\n {\n throw LayerValidationException(\"ConcatLayer: Some views overlap.\");\n }\n }\n }\n\n \/\/ Checks that there are no \"holes\", i.e. regions of the output which is not covered by a view.\n \/\/ Because we already checked that there are no overlaps, this can be done simply by checking that\n \/\/ the total 'volume' of the views is the same as the output.\n unsigned int totalViewsVolume = 0;\n for (unsigned int i = 0; i < inputShapes.size(); i++)\n {\n totalViewsVolume += inputShapes[i].GetNumElements();\n }\n unsigned int outputVolume = 1;\n for (unsigned int d = 0; d < numDims; d++)\n {\n outputVolume *= (extentMax[d] - extentMin[d]);\n }\n\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: there are some gaps between views\",\n totalViewsVolume,\n outputVolume);\n\n return std::vector<TensorShape>({ TensorShape({numDims, extentMax.data()}) });\n}\n\nvoid ConcatLayer::ValidateTensorShapesFromInputs()\n{\n \/\/ Validates Concat layer.\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: Num Inputs must match num views.\",\n m_Param.GetNumViews(),\n GetNumInputSlots());\n\n VerifyLayerConnections(m_Param.GetNumViews(), CHECK_LOCATION());\n\n const TensorShape& outputShape = GetOutputSlot(0).GetTensorInfo().GetShape();\n\n VerifyShapeInferenceType(outputShape, m_ShapeInferenceMethod);\n\n std::vector<TensorShape> inputShapes;\n for (unsigned int i = 0; i < GetNumInputSlots(); ++i)\n {\n inputShapes.push_back(GetInputSlot(i).GetConnection()->GetTensorInfo().GetShape());\n }\n\n auto inferredShapes = InferOutputShapes(inputShapes);\n\n ARMNN_ASSERT(inferredShapes.size() == 1);\n\n ValidateAndCopyShape(outputShape, inferredShapes[0], m_ShapeInferenceMethod, \"ConcatLayer\");\n}\n\nvoid ConcatLayer::Accept(ILayerVisitor& visitor) const\n{\n visitor.VisitConcatLayer(this, GetParameters(), GetName());\n}\n\n} \/\/ namespace armnn armnn\n<commit_msg>IVGCVSW-5291 Fix for Yolov3 producing 0s on Neon<commit_after>\/\/\n\/\/ Copyright © 2017 Arm Ltd and Contributors. All rights reserved.\n\/\/ SPDX-License-Identifier: MIT\n\/\/\n#include \"ConcatLayer.hpp\"\n#include \"LayerCloneBase.hpp\"\n\n#include <armnn\/TypesUtils.hpp>\n#include <armnn\/utility\/PolymorphicDowncast.hpp>\n#include <backendsCommon\/WorkloadData.hpp>\n#include <backendsCommon\/WorkloadFactory.hpp>\n\n#include <queue>\n\nnamespace armnn\n{\n\nConcatLayer::ConcatLayer(const OriginsDescriptor& param, const char* name)\n : LayerWithParameters(param.GetNumViews(), 1, LayerType::Concat, param, name)\n{\n}\n\nstd::unique_ptr<IWorkload> ConcatLayer::CreateWorkload(const IWorkloadFactory& factory) const\n{\n ConcatQueueDescriptor descriptor;\n\n \/\/ Copies the view origins to the descriptor.\n descriptor.m_ViewOrigins.reserve(m_Param.GetNumViews());\n for (unsigned int i = 0; i < m_Param.GetNumViews(); ++i)\n {\n descriptor.m_ViewOrigins.emplace_back(\n std::vector<unsigned int>(m_Param.GetViewOrigin(i), m_Param.GetViewOrigin(i) + m_Param.GetNumDimensions()));\n }\n\n return factory.CreateConcat(descriptor, PrepInfoAndDesc(descriptor));\n}\n\ntemplate<typename FactoryType>\nvoid ConcatLayer::CreateTensors(const TensorHandleFactoryRegistry& registry,\n const FactoryType& factory,\n bool isMemoryManaged)\n{\n \/\/If sub tensors are supported then the concat\n \/\/just needs to make sure that the outputs of the prev layer\n \/\/are made subtensors of the output of the concat layer.\n m_OutputHandlers[0].CreateTensorHandles(factory, isMemoryManaged);\n\n if (factory.SupportsSubTensors())\n {\n \/\/ check if concat is along the x or y (2 innermost dimensions)\n uint32_t concatAxis = m_Param.GetConcatAxis();\n auto numberOfDimensions = m_Param.GetNumDimensions();\n bool isConcatOnXorY = m_Param.GetNumDimensions() >= 3\n && ((concatAxis == numberOfDimensions - 1) || (concatAxis == numberOfDimensions - 2));\n\n ITensorHandleFactory::FactoryId factoryId = GetOutputSlot(0).GetTensorHandleFactoryId();\n\n std::queue<ConcatLayer*> m_ConcatLayers;\n\n m_ConcatLayers.push(this);\n while (!m_ConcatLayers.empty())\n {\n ConcatLayer* currentLayer = m_ConcatLayers.front();\n ITensorHandle* parentTensor = currentLayer->GetOutputHandler(0).GetData();\n const TensorInfo& parentInfo = currentLayer->GetOutputHandler(0).GetTensorInfo();\n m_ConcatLayers.pop();\n\n const unsigned int numInputSlots = currentLayer->GetNumInputSlots();\n\n \/\/ if concat along x or y (2 innermost dimensions) and the previous layers do not require padding\n bool canUseSubTensorOnXorY = true;\n bool isTensorHandleFactory = std::is_same<armnn::ITensorHandleFactory, FactoryType>::value;\n if (isTensorHandleFactory)\n {\n for (unsigned int i = 0; i < numInputSlots; ++i)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n ITensorHandleFactory* handleFactory = registry.GetFactory(factoryId);\n std::vector<Capability> capabilities =\n handleFactory->GetCapabilities(&(slot->GetOwningLayer()),\n currentLayer,\n CapabilityClass::PaddingRequired);\n if (isConcatOnXorY)\n {\n canUseSubTensorOnXorY = false;\n if (capabilities.empty())\n {\n canUseSubTensorOnXorY = true;\n }\n }\n\n \/\/ Splitter layer outputs are subtensors on the inputs whereas concat inputs are subtensors on\n \/\/ the output. If the parent is a Splitter layer we cannot use subtensors.\n if ((PolymorphicDowncast<const Layer*>(&(slot->GetOwningLayer())))->GetType() == LayerType::Splitter\n && (PolymorphicDowncast<const Layer*>(currentLayer))->GetType() == LayerType::Concat)\n {\n canUseSubTensorOnXorY = false;\n }\n\n if (!canUseSubTensorOnXorY)\n {\n break;\n }\n }\n }\n\n \/\/ First go through all the input slots and verify that we can sub-tensor all the inputs.\n std::vector<std::unique_ptr<ITensorHandle>> subTensors(0);\n subTensors.reserve(numInputSlots);\n for (unsigned int i = 0; i < numInputSlots; ++i)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n const TensorInfo& info = slot->GetTensorInfo();\n\n auto CreateSubTensor = [&]()\n {\n \/\/ Make sure:\n \/\/ 1) quantization parameters are in the same space\n \/\/ 2) the same TensorHandleFactory is used for input and Concat layer output\n \/\/ 3) the input does not come from a Constant layer or input layer\n \/\/ 4) the input is only read by this concat layer\n \/\/ 5) if concat along x or y (2 innermost dimensions) and the previous layers do not require padding\n if (slot &&\n parentInfo.IsTypeSpaceMatch(info) && \/\/(1)\n factoryId == slot->GetTensorHandleFactoryId() && \/\/(2)\n slot->GetOwningLayer().GetType() != LayerType::Constant && \/\/(3)\n slot->GetOwningLayer().GetType() != LayerType::Input && \/\/(3)\n slot->GetNumConnections() == 1 &&\n canUseSubTensorOnXorY) \/\/(5)\n {\n ARMNN_NO_DEPRECATE_WARN_BEGIN\n return factory.CreateSubTensorHandle(*parentTensor,\n info.GetShape(),\n currentLayer->m_Param.GetViewOrigin(i));\n ARMNN_NO_DEPRECATE_WARN_END\n }\n return std::unique_ptr<ITensorHandle>();\n };\n\n auto subTensor = CreateSubTensor();\n if (!subTensor)\n {\n break; \/\/Failed to create a valid sub-tensor, so stop trying with the rest of the inputs.\n }\n else\n {\n subTensors.push_back(std::move(subTensor)); \/\/ store the valid sub-tensor.\n }\n }\n\n \/\/ Ensure that ALL inputs can be substituted with valid sub-tensors\n if (subTensors.size() < numInputSlots)\n {\n continue; \/\/ Don't optimize this Concat layer with sub-tensors\n }\n\n \/\/ Substitute input tensors with sub-tensors by replacing the output tensors on the connected layers.\n unsigned int i=0;\n for (auto& subTensor : subTensors)\n {\n OutputSlot* slot = currentLayer->GetInputSlot(i).GetConnectedOutputSlot();\n OutputHandler& outputHandler = slot->GetOutputHandler();\n\n ARMNN_ASSERT_MSG(subTensor, \"ConcatLayer: Expected a valid sub-tensor for substitution.\");\n outputHandler.SetData(std::move(subTensor));\n\n Layer& inputLayer = slot->GetOwningLayer();\n if (inputLayer.GetType() == LayerType::Concat)\n {\n \/\/ Continue with the substitution if the connected inputs are also concat layers\n m_ConcatLayers.push(PolymorphicDowncast<ConcatLayer*>(&inputLayer));\n }\n ++i;\n }\n }\n }\n}\n\nvoid ConcatLayer::CreateTensorHandles(const TensorHandleFactoryRegistry& registry,\n const IWorkloadFactory& workloadFactory,\n const bool isMemoryManaged)\n{\n OutputSlot& slot = GetOutputSlot(0);\n ITensorHandleFactory::FactoryId factoryId = slot.GetTensorHandleFactoryId();\n\n if (factoryId == ITensorHandleFactory::LegacyFactoryId)\n {\n CreateTensors(registry, workloadFactory, isMemoryManaged);\n }\n else\n {\n ITensorHandleFactory* handleFactory = registry.GetFactory(factoryId);\n ARMNN_ASSERT(handleFactory);\n CreateTensors(registry, *handleFactory, isMemoryManaged);\n }\n}\n\nConcatLayer* ConcatLayer::Clone(Graph& graph) const\n{\n return CloneBase<ConcatLayer>(graph, m_Param, GetName());\n}\n\nstd::vector<TensorShape> ConcatLayer::InferOutputShapes(const std::vector<TensorShape>& inputShapes) const\n{\n ARMNN_ASSERT(inputShapes.size() == m_Param.GetNumViews());\n\n unsigned int numDims = m_Param.GetNumDimensions();\n for (unsigned int i=0; i< inputShapes.size(); i++)\n {\n auto& inputShape = inputShapes[i];\n\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: Num Dimensions must match all inputs.\",\n numDims,\n inputShape.GetNumDimensions());\n }\n\n \/\/ Finds the bounding box (extents) of all the views.\n std::vector<unsigned int> extentMin(numDims);\n std::vector<unsigned int> extentMax(numDims);\n for (unsigned int i = 0; i < inputShapes.size(); i++)\n {\n const uint32_t* origin = m_Param.GetViewOrigin(i);\n const armnn::TensorShape& shape = inputShapes[i];\n for (unsigned int d = 0; d < numDims; d++)\n {\n extentMin[d] = std::min(extentMin[d], origin[d]);\n extentMax[d] = std::max(extentMax[d], origin[d] + shape[d]);\n }\n }\n\n \/\/ Checks that the bounding box starts at the origin.\n if (!std::all_of(extentMin.begin(), extentMin.end(), [](unsigned int s) { return s == 0; }))\n {\n throw LayerValidationException(\"ConcatLayer: there is no view that starts at the origin\");\n }\n\n \/\/ Checks that there are no overlaps of views (this would lead to undefined output at those locations).\n \/\/ Checks each pair of views against each other\n \/\/ (and doesn't bother to check against self, or check the same pair both ways round).\n for (unsigned int a = 0; a < inputShapes.size(); a++)\n {\n const uint32_t* aOrigin = m_Param.GetViewOrigin(a);\n const armnn::TensorShape& aShape = inputShapes[a];\n for (unsigned int b = 0; b < a; b++)\n {\n const uint32_t* bOrigin = m_Param.GetViewOrigin(b);\n const armnn::TensorShape& bShape = inputShapes[b];\n\n bool allAxesOverlap = true;\n for (unsigned int d = 0; d < numDims && allAxesOverlap; d++)\n {\n unsigned int a1 = aOrigin[d];\n unsigned int a2 = aOrigin[d] + aShape[d];\n\n unsigned int b1 = bOrigin[d];\n unsigned int b2 = bOrigin[d] + bShape[d];\n\n if (a2 <= b1 || b2 <= a1)\n {\n allAxesOverlap = false;\n }\n }\n if (allAxesOverlap)\n {\n throw LayerValidationException(\"ConcatLayer: Some views overlap.\");\n }\n }\n }\n\n \/\/ Checks that there are no \"holes\", i.e. regions of the output which is not covered by a view.\n \/\/ Because we already checked that there are no overlaps, this can be done simply by checking that\n \/\/ the total 'volume' of the views is the same as the output.\n unsigned int totalViewsVolume = 0;\n for (unsigned int i = 0; i < inputShapes.size(); i++)\n {\n totalViewsVolume += inputShapes[i].GetNumElements();\n }\n unsigned int outputVolume = 1;\n for (unsigned int d = 0; d < numDims; d++)\n {\n outputVolume *= (extentMax[d] - extentMin[d]);\n }\n\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: there are some gaps between views\",\n totalViewsVolume,\n outputVolume);\n\n return std::vector<TensorShape>({ TensorShape({numDims, extentMax.data()}) });\n}\n\nvoid ConcatLayer::ValidateTensorShapesFromInputs()\n{\n \/\/ Validates Concat layer.\n ConditionalThrowIfNotEqual<LayerValidationException>(\n \"ConcatLayer: Num Inputs must match num views.\",\n m_Param.GetNumViews(),\n GetNumInputSlots());\n\n VerifyLayerConnections(m_Param.GetNumViews(), CHECK_LOCATION());\n\n const TensorShape& outputShape = GetOutputSlot(0).GetTensorInfo().GetShape();\n\n VerifyShapeInferenceType(outputShape, m_ShapeInferenceMethod);\n\n std::vector<TensorShape> inputShapes;\n for (unsigned int i = 0; i < GetNumInputSlots(); ++i)\n {\n inputShapes.push_back(GetInputSlot(i).GetConnection()->GetTensorInfo().GetShape());\n }\n\n auto inferredShapes = InferOutputShapes(inputShapes);\n\n ARMNN_ASSERT(inferredShapes.size() == 1);\n\n ValidateAndCopyShape(outputShape, inferredShapes[0], m_ShapeInferenceMethod, \"ConcatLayer\");\n}\n\nvoid ConcatLayer::Accept(ILayerVisitor& visitor) const\n{\n visitor.VisitConcatLayer(this, GetParameters(), GetName());\n}\n\n} \/\/ namespace armnn armnn\n<|endoftext|>"} {"text":"<commit_before>#ifndef HTOOL_CLUSTERING_BOUNDINGBOX_HPP\n#define HTOOL_CLUSTERING_BOUNDINGBOX_HPP\n\n#include \"..\/misc\/evp.hpp\"\n#include \"cluster.hpp\"\n#include \"splitting.hpp\"\n#include <stack>\n\nnamespace htool {\n\ntemplate <SplittingTypes SplittingType>\nclass BoundingBox1 {\n public:\n void\n recursive_build(const double *const x, const double *const r, const double *const g, int nb_sons, MPI_Comm comm, std::stack<Cluster<BoundingBox1> *> &s, std::stack<std::vector<int>> &n) {\n\n \/\/ MPI parameters\n int rankWorld, sizeWorld;\n MPI_Comm_size(comm, &sizeWorld);\n MPI_Comm_rank(comm, &rankWorld);\n\n while (!s.empty()) {\n Cluster<BoundingBox1> *curr = s.top();\n std::vector<int> num = n.top();\n s.pop();\n n.pop();\n\n int curr_nb_sons = curr->get_depth() == 0 ? sizeWorld : nb_sons;\n\n \/\/ Mass of the cluster\n int nb_pt = curr->get_size();\n double G = 0;\n for (int j = 0; j < nb_pt; j++) {\n G += g[num[j]];\n }\n\n \/\/ Center of the cluster\n std::vector<double> xc(curr->get_space_dim(), 0);\n for (int j = 0; j < nb_pt; j++) {\n for (int p = 0; p < curr->get_space_dim(); p++) {\n xc[p] += g[num[j]] * x[curr->get_space_dim() * num[j] + p];\n }\n }\n std::transform(xc.begin(), xc.end(), xc.begin(), std::bind(std::multiplies<double>(), std::placeholders::_1, 1. \/ G));\n\n curr->set_ctr(xc);\n\n \/\/ Radius and min max for each axis\n Matrix<double> cov(curr->get_space_dim(), curr->get_space_dim());\n double rad = 0;\n std::vector<double> min_point(curr->get_space_dim(), std::numeric_limits<double>::max());\n std::vector<double> max_point(curr->get_space_dim(), std::numeric_limits<double>::min());\n for (int j = 0; j < nb_pt; j++) {\n std::vector<double> u(3, 0);\n for (int p = 0; p < curr->get_space_dim(); p++) {\n if (min_point[p] > x[curr->get_space_dim() * num[j] + p]) {\n min_point[p] = x[curr->get_space_dim() * num[j] + p];\n }\n if (max_point[p] < x[curr->get_space_dim() * num[j] + p]) {\n max_point[p] = x[curr->get_space_dim() * num[j] + p];\n }\n u[p] = x[curr->get_space_dim() * num[j] + p] - xc[p];\n }\n\n rad = std::max(rad, norm2(u) + r[j]);\n }\n curr->set_rad(rad);\n\n \/\/ Direction of largest extent\n double max_distance(std::numeric_limits<double>::min());\n int dir_axis = 0;\n for (int p = 0; p < curr->get_space_dim(); p++) {\n if (max_distance < max_point[p] - min_point[p]) {\n max_distance = max_point[p] - min_point[p];\n dir_axis = p;\n }\n }\n std::vector<double> dir(curr->get_space_dim(), 0);\n dir[dir_axis] = 1;\n\n \/\/ Creating sons\n for (int p = 0; p < curr_nb_sons; p++) {\n curr->add_son(curr->get_counter() * curr_nb_sons + p, curr->get_depth() + 1, curr->get_perm_ptr());\n }\n\n \/\/ Compute numbering\n std::vector<std::vector<int>> numbering = splitting(x, num, curr, curr_nb_sons, dir);\n\n \/\/ Set offsets, size and rank of sons\n int count = 0;\n\n for (int p = 0; p < curr_nb_sons; p++) {\n curr->get_son_ptr(p)->set_offset(curr->get_offset() + count);\n curr->get_son_ptr(p)->set_size(numbering[p].size());\n count += numbering[p].size();\n\n \/\/ level of parallelization\n if (curr->get_depth() == 0) {\n curr->get_son_ptr(p)->set_rank(curr->get_son_ptr(p)->get_counter());\n if (rankWorld == curr->get_son_ptr(p)->get_counter()) {\n curr->set_local_cluster(curr->get_son_ptr(p));\n }\n curr->set_MasterOffset(curr->get_son_ptr(p)->get_counter(), std::pair<int, int>(curr->get_son_ptr(p)->get_offset(), curr->get_son_ptr(p)->get_size()));\n }\n \/\/ after level of parallelization\n else {\n curr->get_son_ptr(p)->set_rank(curr->get_rank());\n }\n }\n\n \/\/ Recursivite\n bool test_minclustersize = true;\n for (int p = 0; p < curr_nb_sons; p++) {\n test_minclustersize = test_minclustersize && (numbering[p].size() >= curr->get_minclustersize());\n }\n if (test_minclustersize || curr->get_rank() == -1) {\n for (int p = 0; p < curr_nb_sons; p++) {\n s.push((curr->get_son_ptr(p)));\n n.push(numbering[p]);\n }\n } else {\n curr->set_max_depth(std::max(curr->get_max_depth(), curr->get_depth()));\n if (curr->get_min_depth() < 0) {\n curr->set_min_depth(curr->get_depth());\n } else {\n curr->set_min_depth(std::min(curr->get_min_depth(), curr->get_depth()));\n }\n\n curr->clear_sons();\n std::copy_n(num.begin(), num.size(), curr->get_perm_start() + curr->get_offset());\n }\n }\n }\n\n std::vector<std::vector<int>> splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir);\n};\n\n\/\/ Specialization of splitting\ntemplate <>\ninline std::vector<std::vector<int>> BoundingBox1<SplittingTypes::GeometricSplitting>::splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir) { return geometric_splitting(x, num, curr_cluster, nb_sons, dir); }\n\ntemplate <>\ninline std::vector<std::vector<int>> BoundingBox1<SplittingTypes::RegularSplitting>::splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir) { return regular_splitting(x, num, curr_cluster, nb_sons, dir); }\n\n\/\/ Typdef with specific splitting\ntypedef BoundingBox1<SplittingTypes::GeometricSplitting> BoundingBox1GeometricClustering;\ntypedef BoundingBox1<SplittingTypes::RegularSplitting> BoundingBox1RegularClustering;\n\n} \/\/ namespace htool\n\n#endif\n<commit_msg>fix missing include<commit_after>#ifndef HTOOL_CLUSTERING_BOUNDINGBOX_HPP\n#define HTOOL_CLUSTERING_BOUNDINGBOX_HPP\n\n#include \"..\/misc\/evp.hpp\"\n#include \"cluster.hpp\"\n#include \"splitting.hpp\"\n#include <limits>\n#include <stack>\n\nnamespace htool {\n\ntemplate <SplittingTypes SplittingType>\nclass BoundingBox1 {\n public:\n void\n recursive_build(const double *const x, const double *const r, const double *const g, int nb_sons, MPI_Comm comm, std::stack<Cluster<BoundingBox1> *> &s, std::stack<std::vector<int>> &n) {\n\n \/\/ MPI parameters\n int rankWorld, sizeWorld;\n MPI_Comm_size(comm, &sizeWorld);\n MPI_Comm_rank(comm, &rankWorld);\n\n while (!s.empty()) {\n Cluster<BoundingBox1> *curr = s.top();\n std::vector<int> num = n.top();\n s.pop();\n n.pop();\n\n int curr_nb_sons = curr->get_depth() == 0 ? sizeWorld : nb_sons;\n\n \/\/ Mass of the cluster\n int nb_pt = curr->get_size();\n double G = 0;\n for (int j = 0; j < nb_pt; j++) {\n G += g[num[j]];\n }\n\n \/\/ Center of the cluster\n std::vector<double> xc(curr->get_space_dim(), 0);\n for (int j = 0; j < nb_pt; j++) {\n for (int p = 0; p < curr->get_space_dim(); p++) {\n xc[p] += g[num[j]] * x[curr->get_space_dim() * num[j] + p];\n }\n }\n std::transform(xc.begin(), xc.end(), xc.begin(), std::bind(std::multiplies<double>(), std::placeholders::_1, 1. \/ G));\n\n curr->set_ctr(xc);\n\n \/\/ Radius and min max for each axis\n Matrix<double> cov(curr->get_space_dim(), curr->get_space_dim());\n double rad = 0;\n std::vector<double> min_point(curr->get_space_dim(), std::numeric_limits<double>::max());\n std::vector<double> max_point(curr->get_space_dim(), std::numeric_limits<double>::min());\n for (int j = 0; j < nb_pt; j++) {\n std::vector<double> u(3, 0);\n for (int p = 0; p < curr->get_space_dim(); p++) {\n if (min_point[p] > x[curr->get_space_dim() * num[j] + p]) {\n min_point[p] = x[curr->get_space_dim() * num[j] + p];\n }\n if (max_point[p] < x[curr->get_space_dim() * num[j] + p]) {\n max_point[p] = x[curr->get_space_dim() * num[j] + p];\n }\n u[p] = x[curr->get_space_dim() * num[j] + p] - xc[p];\n }\n\n rad = std::max(rad, norm2(u) + r[j]);\n }\n curr->set_rad(rad);\n\n \/\/ Direction of largest extent\n double max_distance(std::numeric_limits<double>::min());\n int dir_axis = 0;\n for (int p = 0; p < curr->get_space_dim(); p++) {\n if (max_distance < max_point[p] - min_point[p]) {\n max_distance = max_point[p] - min_point[p];\n dir_axis = p;\n }\n }\n std::vector<double> dir(curr->get_space_dim(), 0);\n dir[dir_axis] = 1;\n\n \/\/ Creating sons\n for (int p = 0; p < curr_nb_sons; p++) {\n curr->add_son(curr->get_counter() * curr_nb_sons + p, curr->get_depth() + 1, curr->get_perm_ptr());\n }\n\n \/\/ Compute numbering\n std::vector<std::vector<int>> numbering = splitting(x, num, curr, curr_nb_sons, dir);\n\n \/\/ Set offsets, size and rank of sons\n int count = 0;\n\n for (int p = 0; p < curr_nb_sons; p++) {\n curr->get_son_ptr(p)->set_offset(curr->get_offset() + count);\n curr->get_son_ptr(p)->set_size(numbering[p].size());\n count += numbering[p].size();\n\n \/\/ level of parallelization\n if (curr->get_depth() == 0) {\n curr->get_son_ptr(p)->set_rank(curr->get_son_ptr(p)->get_counter());\n if (rankWorld == curr->get_son_ptr(p)->get_counter()) {\n curr->set_local_cluster(curr->get_son_ptr(p));\n }\n curr->set_MasterOffset(curr->get_son_ptr(p)->get_counter(), std::pair<int, int>(curr->get_son_ptr(p)->get_offset(), curr->get_son_ptr(p)->get_size()));\n }\n \/\/ after level of parallelization\n else {\n curr->get_son_ptr(p)->set_rank(curr->get_rank());\n }\n }\n\n \/\/ Recursivite\n bool test_minclustersize = true;\n for (int p = 0; p < curr_nb_sons; p++) {\n test_minclustersize = test_minclustersize && (numbering[p].size() >= curr->get_minclustersize());\n }\n if (test_minclustersize || curr->get_rank() == -1) {\n for (int p = 0; p < curr_nb_sons; p++) {\n s.push((curr->get_son_ptr(p)));\n n.push(numbering[p]);\n }\n } else {\n curr->set_max_depth(std::max(curr->get_max_depth(), curr->get_depth()));\n if (curr->get_min_depth() < 0) {\n curr->set_min_depth(curr->get_depth());\n } else {\n curr->set_min_depth(std::min(curr->get_min_depth(), curr->get_depth()));\n }\n\n curr->clear_sons();\n std::copy_n(num.begin(), num.size(), curr->get_perm_start() + curr->get_offset());\n }\n }\n }\n\n std::vector<std::vector<int>> splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir);\n};\n\n\/\/ Specialization of splitting\ntemplate <>\ninline std::vector<std::vector<int>> BoundingBox1<SplittingTypes::GeometricSplitting>::splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir) { return geometric_splitting(x, num, curr_cluster, nb_sons, dir); }\n\ntemplate <>\ninline std::vector<std::vector<int>> BoundingBox1<SplittingTypes::RegularSplitting>::splitting(const double *const x, std::vector<int> &num, VirtualCluster const *const curr_cluster, int nb_sons, const std::vector<double> &dir) { return regular_splitting(x, num, curr_cluster, nb_sons, dir); }\n\n\/\/ Typdef with specific splitting\ntypedef BoundingBox1<SplittingTypes::GeometricSplitting> BoundingBox1GeometricClustering;\ntypedef BoundingBox1<SplittingTypes::RegularSplitting> BoundingBox1RegularClustering;\n\n} \/\/ namespace htool\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- DeclarationName.cpp - Declaration names implementation --*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the DeclarationName and DeclarationNameTable\n\/\/ classes.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/AST\/DeclarationName.h\"\n#include \"clang\/AST\/Type.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/Basic\/IdentifierTable.h\"\n#include \"llvm\/ADT\/FoldingSet.h\"\n#include \"llvm\/Bitcode\/Serialize.h\"\n#include \"llvm\/Bitcode\/Deserialize.h\"\nusing namespace clang;\n\nnamespace clang {\n\/\/\/ CXXSpecialName - Records the type associated with one of the\n\/\/\/ \"special\" kinds of declaration names in C++, e.g., constructors,\n\/\/\/ destructors, and conversion functions.\nclass CXXSpecialName \n : public DeclarationNameExtra, public llvm::FoldingSetNode {\npublic:\n \/\/\/ Type - The type associated with this declaration name.\n QualType Type;\n\n \/\/\/ FETokenInfo - Extra information associated with this declaration\n \/\/\/ name that can be used by the front end.\n void *FETokenInfo;\n\n void Profile(llvm::FoldingSetNodeID &ID) {\n ID.AddInteger(ExtraKindOrNumArgs);\n ID.AddPointer(Type.getAsOpaquePtr());\n }\n};\n\n\/\/\/ CXXOperatorIdName - Contains extra information for the name of an\n\/\/\/ overloaded operator in C++, such as \"operator+. \nclass CXXOperatorIdName : public DeclarationNameExtra {\npublic:\n \/\/\/ FETokenInfo - Extra information associated with this operator\n \/\/\/ name that can be used by the front end.\n void *FETokenInfo;\n};\n\nbool operator<(DeclarationName LHS, DeclarationName RHS) {\n if (IdentifierInfo *LhsId = LHS.getAsIdentifierInfo())\n if (IdentifierInfo *RhsId = RHS.getAsIdentifierInfo())\n return strcmp(LhsId->getName(), RhsId->getName()) < 0;\n\n return LHS.getAsOpaqueInteger() < RHS.getAsOpaqueInteger();\n}\n\n} \/\/ end namespace clang\n\nDeclarationName::DeclarationName(Selector Sel) {\n switch (Sel.getNumArgs()) {\n case 0:\n Ptr = reinterpret_cast<uintptr_t>(Sel.getAsIdentifierInfo());\n Ptr |= StoredObjCZeroArgSelector;\n break;\n\n case 1:\n Ptr = reinterpret_cast<uintptr_t>(Sel.getAsIdentifierInfo());\n Ptr |= StoredObjCOneArgSelector;\n break;\n\n default:\n Ptr = Sel.InfoPtr & ~Selector::ArgFlags;\n Ptr |= StoredDeclarationNameExtra;\n break;\n }\n}\n\nDeclarationName::NameKind DeclarationName::getNameKind() const {\n switch (getStoredNameKind()) {\n case StoredIdentifier: return Identifier;\n case StoredObjCZeroArgSelector: return ObjCZeroArgSelector;\n case StoredObjCOneArgSelector: return ObjCOneArgSelector;\n\n case StoredDeclarationNameExtra:\n switch (getExtra()->ExtraKindOrNumArgs) {\n case DeclarationNameExtra::CXXConstructor: \n return CXXConstructorName;\n\n case DeclarationNameExtra::CXXDestructor: \n return CXXDestructorName;\n\n case DeclarationNameExtra::CXXConversionFunction: \n return CXXConversionFunctionName;\n\n default:\n \/\/ Check if we have one of the CXXOperator* enumeration values.\n if (getExtra()->ExtraKindOrNumArgs < \n DeclarationNameExtra::NUM_EXTRA_KINDS)\n return CXXOperatorName;\n\n return ObjCMultiArgSelector;\n }\n break;\n }\n\n \/\/ Can't actually get here.\n return Identifier;\n}\n\nstd::string DeclarationName::getAsString() const {\n switch (getNameKind()) {\n case Identifier:\n if (const IdentifierInfo *II = getAsIdentifierInfo())\n return II->getName();\n return \"\";\n\n case ObjCZeroArgSelector:\n case ObjCOneArgSelector:\n case ObjCMultiArgSelector:\n return getObjCSelector().getAsString();\n\n case CXXConstructorName: {\n QualType ClassType = getCXXNameType();\n if (const RecordType *ClassRec = ClassType->getAsRecordType())\n return ClassRec->getDecl()->getNameAsString();\n return ClassType.getAsString();\n }\n\n case CXXDestructorName: {\n std::string Result = \"~\";\n QualType Type = getCXXNameType();\n if (const RecordType *Rec = Type->getAsRecordType())\n Result += Rec->getDecl()->getNameAsString();\n else\n Result += Type.getAsString();\n return Result;\n }\n\n case CXXOperatorName: {\n static const char *OperatorNames[NUM_OVERLOADED_OPERATORS] = {\n 0,\n#define OVERLOADED_OPERATOR(Name,Spelling,Token,Unary,Binary,MemberOnly) \\\n Spelling,\n#include \"clang\/Basic\/OperatorKinds.def\"\n };\n const char *OpName = OperatorNames[getCXXOverloadedOperator()];\n assert(OpName && \"not an overloaded operator\");\n \n std::string Result = \"operator\";\n if (OpName[0] >= 'a' && OpName[0] <= 'z')\n Result += ' ';\n Result += OpName;\n return Result;\n }\n\n case CXXConversionFunctionName: {\n std::string Result = \"operator \";\n QualType Type = getCXXNameType();\n if (const RecordType *Rec = Type->getAsRecordType())\n Result += Rec->getDecl()->getNameAsString();\n else\n Result += Type.getAsString();\n return Result;\n }\n }\n\n assert(false && \"Unexpected declaration name kind\");\n return \"\";\n}\n\nQualType DeclarationName::getCXXNameType() const {\n if (CXXSpecialName *CXXName = getAsCXXSpecialName())\n return CXXName->Type;\n else\n return QualType();\n}\n\nOverloadedOperatorKind DeclarationName::getCXXOverloadedOperator() const {\n if (CXXOperatorIdName *CXXOp = getAsCXXOperatorIdName()) {\n unsigned value \n = CXXOp->ExtraKindOrNumArgs - DeclarationNameExtra::CXXConversionFunction;\n return static_cast<OverloadedOperatorKind>(value);\n } else {\n return OO_None;\n }\n}\n\nSelector DeclarationName::getObjCSelector() const {\n switch (getNameKind()) {\n case ObjCZeroArgSelector:\n return Selector(reinterpret_cast<IdentifierInfo *>(Ptr & ~PtrMask), 0);\n\n case ObjCOneArgSelector:\n return Selector(reinterpret_cast<IdentifierInfo *>(Ptr & ~PtrMask), 1);\n\n case ObjCMultiArgSelector:\n return Selector(reinterpret_cast<MultiKeywordSelector *>(Ptr & ~PtrMask));\n\n default:\n break;\n }\n\n return Selector();\n}\n\nvoid *DeclarationName::getFETokenInfoAsVoid() const {\n switch (getNameKind()) {\n case Identifier:\n return getAsIdentifierInfo()->getFETokenInfo<void>();\n\n case CXXConstructorName:\n case CXXDestructorName:\n case CXXConversionFunctionName:\n return getAsCXXSpecialName()->FETokenInfo;\n\n case CXXOperatorName:\n return getAsCXXOperatorIdName()->FETokenInfo;\n\n default:\n assert(false && \"Declaration name has no FETokenInfo\");\n }\n return 0;\n}\n\nvoid DeclarationName::setFETokenInfo(void *T) {\n switch (getNameKind()) {\n case Identifier:\n getAsIdentifierInfo()->setFETokenInfo(T);\n break;\n\n case CXXConstructorName:\n case CXXDestructorName:\n case CXXConversionFunctionName:\n getAsCXXSpecialName()->FETokenInfo = T;\n break;\n\n case CXXOperatorName:\n getAsCXXOperatorIdName()->FETokenInfo = T;\n break;\n\n default:\n assert(false && \"Declaration name has no FETokenInfo\");\n }\n}\n\nDeclarationNameTable::DeclarationNameTable() {\n CXXSpecialNamesImpl = new llvm::FoldingSet<CXXSpecialName>;\n\n \/\/ Initialize the overloaded operator names.\n CXXOperatorNames = new CXXOperatorIdName[NUM_OVERLOADED_OPERATORS];\n for (unsigned Op = 0; Op < NUM_OVERLOADED_OPERATORS; ++Op) {\n CXXOperatorNames[Op].ExtraKindOrNumArgs \n = Op + DeclarationNameExtra::CXXConversionFunction;\n CXXOperatorNames[Op].FETokenInfo = 0;\n }\n}\n\nDeclarationNameTable::~DeclarationNameTable() {\n llvm::FoldingSet<CXXSpecialName> *set =\n static_cast<llvm::FoldingSet<CXXSpecialName>*>(CXXSpecialNamesImpl);\n llvm::FoldingSetIterator<CXXSpecialName> it = set->begin();\n\n while (it != set->end()) {\n delete &*it++;\n }\n\n delete set;\n delete [] CXXOperatorNames;\n}\n\nDeclarationName \nDeclarationNameTable::getCXXSpecialName(DeclarationName::NameKind Kind, \n QualType Ty) {\n assert(Kind >= DeclarationName::CXXConstructorName &&\n Kind <= DeclarationName::CXXConversionFunctionName &&\n \"Kind must be a C++ special name kind\");\n \n llvm::FoldingSet<CXXSpecialName> *SpecialNames \n = static_cast<llvm::FoldingSet<CXXSpecialName>*>(CXXSpecialNamesImpl);\n\n DeclarationNameExtra::ExtraKind EKind;\n switch (Kind) {\n case DeclarationName::CXXConstructorName: \n EKind = DeclarationNameExtra::CXXConstructor;\n break;\n case DeclarationName::CXXDestructorName:\n EKind = DeclarationNameExtra::CXXDestructor;\n break;\n case DeclarationName::CXXConversionFunctionName:\n EKind = DeclarationNameExtra::CXXConversionFunction;\n break;\n default:\n return DeclarationName();\n }\n\n \/\/ Unique selector, to guarantee there is one per name.\n llvm::FoldingSetNodeID ID;\n ID.AddInteger(EKind);\n ID.AddPointer(Ty.getAsOpaquePtr());\n\n void *InsertPos = 0;\n if (CXXSpecialName *Name = SpecialNames->FindNodeOrInsertPos(ID, InsertPos))\n return DeclarationName(Name);\n\n CXXSpecialName *SpecialName = new CXXSpecialName;\n SpecialName->ExtraKindOrNumArgs = EKind;\n SpecialName->Type = Ty;\n SpecialName->FETokenInfo = 0;\n\n SpecialNames->InsertNode(SpecialName, InsertPos);\n return DeclarationName(SpecialName);\n}\n\nDeclarationName \nDeclarationNameTable::getCXXOperatorName(OverloadedOperatorKind Op) {\n return DeclarationName(&CXXOperatorNames[(unsigned)Op]);\n}\n\nunsigned \nllvm::DenseMapInfo<clang::DeclarationName>::\ngetHashValue(clang::DeclarationName N) {\n return DenseMapInfo<void*>::getHashValue(N.getAsOpaquePtr());\n}\n\n<commit_msg>dont call iterator::end() on every cycle and dont read already-deleted memory<commit_after>\/\/===-- DeclarationName.cpp - Declaration names implementation --*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the DeclarationName and DeclarationNameTable\n\/\/ classes.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"clang\/AST\/DeclarationName.h\"\n#include \"clang\/AST\/Type.h\"\n#include \"clang\/AST\/Decl.h\"\n#include \"clang\/Basic\/IdentifierTable.h\"\n#include \"llvm\/ADT\/FoldingSet.h\"\n#include \"llvm\/Bitcode\/Serialize.h\"\n#include \"llvm\/Bitcode\/Deserialize.h\"\nusing namespace clang;\n\nnamespace clang {\n\/\/\/ CXXSpecialName - Records the type associated with one of the\n\/\/\/ \"special\" kinds of declaration names in C++, e.g., constructors,\n\/\/\/ destructors, and conversion functions.\nclass CXXSpecialName \n : public DeclarationNameExtra, public llvm::FoldingSetNode {\npublic:\n \/\/\/ Type - The type associated with this declaration name.\n QualType Type;\n\n \/\/\/ FETokenInfo - Extra information associated with this declaration\n \/\/\/ name that can be used by the front end.\n void *FETokenInfo;\n\n void Profile(llvm::FoldingSetNodeID &ID) {\n ID.AddInteger(ExtraKindOrNumArgs);\n ID.AddPointer(Type.getAsOpaquePtr());\n }\n};\n\n\/\/\/ CXXOperatorIdName - Contains extra information for the name of an\n\/\/\/ overloaded operator in C++, such as \"operator+. \nclass CXXOperatorIdName : public DeclarationNameExtra {\npublic:\n \/\/\/ FETokenInfo - Extra information associated with this operator\n \/\/\/ name that can be used by the front end.\n void *FETokenInfo;\n};\n\nbool operator<(DeclarationName LHS, DeclarationName RHS) {\n if (IdentifierInfo *LhsId = LHS.getAsIdentifierInfo())\n if (IdentifierInfo *RhsId = RHS.getAsIdentifierInfo())\n return strcmp(LhsId->getName(), RhsId->getName()) < 0;\n\n return LHS.getAsOpaqueInteger() < RHS.getAsOpaqueInteger();\n}\n\n} \/\/ end namespace clang\n\nDeclarationName::DeclarationName(Selector Sel) {\n switch (Sel.getNumArgs()) {\n case 0:\n Ptr = reinterpret_cast<uintptr_t>(Sel.getAsIdentifierInfo());\n Ptr |= StoredObjCZeroArgSelector;\n break;\n\n case 1:\n Ptr = reinterpret_cast<uintptr_t>(Sel.getAsIdentifierInfo());\n Ptr |= StoredObjCOneArgSelector;\n break;\n\n default:\n Ptr = Sel.InfoPtr & ~Selector::ArgFlags;\n Ptr |= StoredDeclarationNameExtra;\n break;\n }\n}\n\nDeclarationName::NameKind DeclarationName::getNameKind() const {\n switch (getStoredNameKind()) {\n case StoredIdentifier: return Identifier;\n case StoredObjCZeroArgSelector: return ObjCZeroArgSelector;\n case StoredObjCOneArgSelector: return ObjCOneArgSelector;\n\n case StoredDeclarationNameExtra:\n switch (getExtra()->ExtraKindOrNumArgs) {\n case DeclarationNameExtra::CXXConstructor: \n return CXXConstructorName;\n\n case DeclarationNameExtra::CXXDestructor: \n return CXXDestructorName;\n\n case DeclarationNameExtra::CXXConversionFunction: \n return CXXConversionFunctionName;\n\n default:\n \/\/ Check if we have one of the CXXOperator* enumeration values.\n if (getExtra()->ExtraKindOrNumArgs < \n DeclarationNameExtra::NUM_EXTRA_KINDS)\n return CXXOperatorName;\n\n return ObjCMultiArgSelector;\n }\n break;\n }\n\n \/\/ Can't actually get here.\n return Identifier;\n}\n\nstd::string DeclarationName::getAsString() const {\n switch (getNameKind()) {\n case Identifier:\n if (const IdentifierInfo *II = getAsIdentifierInfo())\n return II->getName();\n return \"\";\n\n case ObjCZeroArgSelector:\n case ObjCOneArgSelector:\n case ObjCMultiArgSelector:\n return getObjCSelector().getAsString();\n\n case CXXConstructorName: {\n QualType ClassType = getCXXNameType();\n if (const RecordType *ClassRec = ClassType->getAsRecordType())\n return ClassRec->getDecl()->getNameAsString();\n return ClassType.getAsString();\n }\n\n case CXXDestructorName: {\n std::string Result = \"~\";\n QualType Type = getCXXNameType();\n if (const RecordType *Rec = Type->getAsRecordType())\n Result += Rec->getDecl()->getNameAsString();\n else\n Result += Type.getAsString();\n return Result;\n }\n\n case CXXOperatorName: {\n static const char *OperatorNames[NUM_OVERLOADED_OPERATORS] = {\n 0,\n#define OVERLOADED_OPERATOR(Name,Spelling,Token,Unary,Binary,MemberOnly) \\\n Spelling,\n#include \"clang\/Basic\/OperatorKinds.def\"\n };\n const char *OpName = OperatorNames[getCXXOverloadedOperator()];\n assert(OpName && \"not an overloaded operator\");\n \n std::string Result = \"operator\";\n if (OpName[0] >= 'a' && OpName[0] <= 'z')\n Result += ' ';\n Result += OpName;\n return Result;\n }\n\n case CXXConversionFunctionName: {\n std::string Result = \"operator \";\n QualType Type = getCXXNameType();\n if (const RecordType *Rec = Type->getAsRecordType())\n Result += Rec->getDecl()->getNameAsString();\n else\n Result += Type.getAsString();\n return Result;\n }\n }\n\n assert(false && \"Unexpected declaration name kind\");\n return \"\";\n}\n\nQualType DeclarationName::getCXXNameType() const {\n if (CXXSpecialName *CXXName = getAsCXXSpecialName())\n return CXXName->Type;\n else\n return QualType();\n}\n\nOverloadedOperatorKind DeclarationName::getCXXOverloadedOperator() const {\n if (CXXOperatorIdName *CXXOp = getAsCXXOperatorIdName()) {\n unsigned value \n = CXXOp->ExtraKindOrNumArgs - DeclarationNameExtra::CXXConversionFunction;\n return static_cast<OverloadedOperatorKind>(value);\n } else {\n return OO_None;\n }\n}\n\nSelector DeclarationName::getObjCSelector() const {\n switch (getNameKind()) {\n case ObjCZeroArgSelector:\n return Selector(reinterpret_cast<IdentifierInfo *>(Ptr & ~PtrMask), 0);\n\n case ObjCOneArgSelector:\n return Selector(reinterpret_cast<IdentifierInfo *>(Ptr & ~PtrMask), 1);\n\n case ObjCMultiArgSelector:\n return Selector(reinterpret_cast<MultiKeywordSelector *>(Ptr & ~PtrMask));\n\n default:\n break;\n }\n\n return Selector();\n}\n\nvoid *DeclarationName::getFETokenInfoAsVoid() const {\n switch (getNameKind()) {\n case Identifier:\n return getAsIdentifierInfo()->getFETokenInfo<void>();\n\n case CXXConstructorName:\n case CXXDestructorName:\n case CXXConversionFunctionName:\n return getAsCXXSpecialName()->FETokenInfo;\n\n case CXXOperatorName:\n return getAsCXXOperatorIdName()->FETokenInfo;\n\n default:\n assert(false && \"Declaration name has no FETokenInfo\");\n }\n return 0;\n}\n\nvoid DeclarationName::setFETokenInfo(void *T) {\n switch (getNameKind()) {\n case Identifier:\n getAsIdentifierInfo()->setFETokenInfo(T);\n break;\n\n case CXXConstructorName:\n case CXXDestructorName:\n case CXXConversionFunctionName:\n getAsCXXSpecialName()->FETokenInfo = T;\n break;\n\n case CXXOperatorName:\n getAsCXXOperatorIdName()->FETokenInfo = T;\n break;\n\n default:\n assert(false && \"Declaration name has no FETokenInfo\");\n }\n}\n\nDeclarationNameTable::DeclarationNameTable() {\n CXXSpecialNamesImpl = new llvm::FoldingSet<CXXSpecialName>;\n\n \/\/ Initialize the overloaded operator names.\n CXXOperatorNames = new CXXOperatorIdName[NUM_OVERLOADED_OPERATORS];\n for (unsigned Op = 0; Op < NUM_OVERLOADED_OPERATORS; ++Op) {\n CXXOperatorNames[Op].ExtraKindOrNumArgs \n = Op + DeclarationNameExtra::CXXConversionFunction;\n CXXOperatorNames[Op].FETokenInfo = 0;\n }\n}\n\nDeclarationNameTable::~DeclarationNameTable() {\n llvm::FoldingSet<CXXSpecialName> *set =\n static_cast<llvm::FoldingSet<CXXSpecialName>*>(CXXSpecialNamesImpl);\n llvm::FoldingSetIterator<CXXSpecialName> I = set->begin(), E = set->end();\n\n while (I != E) {\n CXXSpecialName *n = &*I++;\n delete n;\n }\n\n delete set;\n delete [] CXXOperatorNames;\n}\n\nDeclarationName \nDeclarationNameTable::getCXXSpecialName(DeclarationName::NameKind Kind, \n QualType Ty) {\n assert(Kind >= DeclarationName::CXXConstructorName &&\n Kind <= DeclarationName::CXXConversionFunctionName &&\n \"Kind must be a C++ special name kind\");\n \n llvm::FoldingSet<CXXSpecialName> *SpecialNames \n = static_cast<llvm::FoldingSet<CXXSpecialName>*>(CXXSpecialNamesImpl);\n\n DeclarationNameExtra::ExtraKind EKind;\n switch (Kind) {\n case DeclarationName::CXXConstructorName: \n EKind = DeclarationNameExtra::CXXConstructor;\n break;\n case DeclarationName::CXXDestructorName:\n EKind = DeclarationNameExtra::CXXDestructor;\n break;\n case DeclarationName::CXXConversionFunctionName:\n EKind = DeclarationNameExtra::CXXConversionFunction;\n break;\n default:\n return DeclarationName();\n }\n\n \/\/ Unique selector, to guarantee there is one per name.\n llvm::FoldingSetNodeID ID;\n ID.AddInteger(EKind);\n ID.AddPointer(Ty.getAsOpaquePtr());\n\n void *InsertPos = 0;\n if (CXXSpecialName *Name = SpecialNames->FindNodeOrInsertPos(ID, InsertPos))\n return DeclarationName(Name);\n\n CXXSpecialName *SpecialName = new CXXSpecialName;\n SpecialName->ExtraKindOrNumArgs = EKind;\n SpecialName->Type = Ty;\n SpecialName->FETokenInfo = 0;\n\n SpecialNames->InsertNode(SpecialName, InsertPos);\n return DeclarationName(SpecialName);\n}\n\nDeclarationName \nDeclarationNameTable::getCXXOperatorName(OverloadedOperatorKind Op) {\n return DeclarationName(&CXXOperatorNames[(unsigned)Op]);\n}\n\nunsigned \nllvm::DenseMapInfo<clang::DeclarationName>::\ngetHashValue(clang::DeclarationName N) {\n return DenseMapInfo<void*>::getHashValue(N.getAsOpaquePtr());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- RISCV.cpp - Implement RISCV target feature support ---------------===\/\/\n\/\/\n\/\/ Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n\/\/ See https:\/\/llvm.org\/LICENSE.txt for license information.\n\/\/ SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements RISCV TargetInfo objects.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RISCV.h\"\n#include \"clang\/Basic\/MacroBuilder.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n\nusing namespace clang;\nusing namespace clang::targets;\n\nArrayRef<const char *> RISCVTargetInfo::getGCCRegNames() const {\n static const char *const GCCRegNames[] = {\n \/\/ Integer registers\n \"x0\", \"x1\", \"x2\", \"x3\", \"x4\", \"x5\", \"x6\", \"x7\",\n \"x8\", \"x9\", \"x10\", \"x11\", \"x12\", \"x13\", \"x14\", \"x15\",\n \"x16\", \"x17\", \"x18\", \"x19\", \"x20\", \"x21\", \"x22\", \"x23\",\n \"x24\", \"x25\", \"x26\", \"x27\", \"x28\", \"x29\", \"x30\", \"x31\",\n\n \/\/ Floating point registers\n \"f0\", \"f1\", \"f2\", \"f3\", \"f4\", \"f5\", \"f6\", \"f7\",\n \"f8\", \"f9\", \"f10\", \"f11\", \"f12\", \"f13\", \"f14\", \"f15\",\n \"f16\", \"f17\", \"f18\", \"f19\", \"f20\", \"f21\", \"f22\", \"f23\",\n \"f24\", \"f25\", \"f26\", \"f27\", \"f28\", \"f29\", \"f30\", \"f31\"};\n return llvm::makeArrayRef(GCCRegNames);\n}\n\nArrayRef<TargetInfo::GCCRegAlias> RISCVTargetInfo::getGCCRegAliases() const {\n static const TargetInfo::GCCRegAlias GCCRegAliases[] = {\n {{\"zero\"}, \"x0\"}, {{\"ra\"}, \"x1\"}, {{\"sp\"}, \"x2\"}, {{\"gp\"}, \"x3\"},\n {{\"tp\"}, \"x4\"}, {{\"t0\"}, \"x5\"}, {{\"t1\"}, \"x6\"}, {{\"t2\"}, \"x7\"},\n {{\"s0\"}, \"x8\"}, {{\"s1\"}, \"x9\"}, {{\"a0\"}, \"x10\"}, {{\"a1\"}, \"x11\"},\n {{\"a2\"}, \"x12\"}, {{\"a3\"}, \"x13\"}, {{\"a4\"}, \"x14\"}, {{\"a5\"}, \"x15\"},\n {{\"a6\"}, \"x16\"}, {{\"a7\"}, \"x17\"}, {{\"s2\"}, \"x18\"}, {{\"s3\"}, \"x19\"},\n {{\"s4\"}, \"x20\"}, {{\"s5\"}, \"x21\"}, {{\"s6\"}, \"x22\"}, {{\"s7\"}, \"x23\"},\n {{\"s8\"}, \"x24\"}, {{\"s9\"}, \"x25\"}, {{\"s10\"}, \"x26\"}, {{\"s11\"}, \"x27\"},\n {{\"t3\"}, \"x28\"}, {{\"t4\"}, \"x29\"}, {{\"t5\"}, \"x30\"}, {{\"t6\"}, \"x31\"},\n {{\"ft0\"}, \"f0\"}, {{\"ft1\"}, \"f1\"}, {{\"ft2\"}, \"f2\"}, {{\"ft3\"}, \"f3\"},\n {{\"ft4\"}, \"f4\"}, {{\"ft5\"}, \"f5\"}, {{\"ft6\"}, \"f6\"}, {{\"ft7\"}, \"f7\"},\n {{\"fs0\"}, \"f8\"}, {{\"fs1\"}, \"f9\"}, {{\"fa0\"}, \"f10\"}, {{\"fa1\"}, \"f11\"},\n {{\"fa2\"}, \"f12\"}, {{\"fa3\"}, \"f13\"}, {{\"fa4\"}, \"f14\"}, {{\"fa5\"}, \"f15\"},\n {{\"fa6\"}, \"f16\"}, {{\"fa7\"}, \"f17\"}, {{\"fs2\"}, \"f18\"}, {{\"fs3\"}, \"f19\"},\n {{\"fs4\"}, \"f20\"}, {{\"fs5\"}, \"f21\"}, {{\"fs6\"}, \"f22\"}, {{\"fs7\"}, \"f23\"},\n {{\"fs8\"}, \"f24\"}, {{\"fs9\"}, \"f25\"}, {{\"fs10\"}, \"f26\"}, {{\"fs11\"}, \"f27\"},\n {{\"ft8\"}, \"f28\"}, {{\"ft9\"}, \"f29\"}, {{\"ft10\"}, \"f30\"}, {{\"ft11\"}, \"f31\"}};\n return llvm::makeArrayRef(GCCRegAliases);\n}\n\nbool RISCVTargetInfo::validateAsmConstraint(\n const char *&Name, TargetInfo::ConstraintInfo &Info) const {\n switch (*Name) {\n default:\n return false;\n case 'I':\n \/\/ A 12-bit signed immediate.\n Info.setRequiresImmediate(-2048, 2047);\n return true;\n case 'J':\n \/\/ Integer zero.\n Info.setRequiresImmediate(0);\n return true;\n case 'K':\n \/\/ A 5-bit unsigned immediate for CSR access instructions.\n Info.setRequiresImmediate(0, 31);\n return true;\n case 'f':\n \/\/ A floating-point register.\n Info.setAllowsRegister();\n return true;\n case 'A':\n \/\/ An address that is held in a general-purpose register.\n Info.setAllowsMemory();\n return true;\n }\n}\n\nvoid RISCVTargetInfo::getTargetDefines(const LangOptions &Opts,\n MacroBuilder &Builder) const {\n Builder.defineMacro(\"__ELF__\");\n Builder.defineMacro(\"__riscv\");\n bool Is64Bit = getTriple().getArch() == llvm::Triple::riscv64;\n Builder.defineMacro(\"__riscv_xlen\", Is64Bit ? \"64\" : \"32\");\n \/\/ TODO: modify when more code models are supported.\n Builder.defineMacro(\"__riscv_cmodel_medlow\");\n\n StringRef ABIName = getABI();\n if (ABIName == \"ilp32f\" || ABIName == \"lp64f\")\n Builder.defineMacro(\"__riscv_float_abi_single\");\n else if (ABIName == \"ilp32d\" || ABIName == \"lp64d\")\n Builder.defineMacro(\"__riscv_float_abi_double\");\n else if (ABIName == \"ilp32e\")\n Builder.defineMacro(\"__riscv_abi_rve\");\n else\n Builder.defineMacro(\"__riscv_float_abi_soft\");\n\n if (HasM) {\n Builder.defineMacro(\"__riscv_mul\");\n Builder.defineMacro(\"__riscv_div\");\n Builder.defineMacro(\"__riscv_muldiv\");\n }\n\n if (HasA)\n Builder.defineMacro(\"__riscv_atomic\");\n\n if (HasF || HasD) {\n Builder.defineMacro(\"__riscv_flen\", HasD ? \"64\" : \"32\");\n Builder.defineMacro(\"__riscv_fdiv\");\n Builder.defineMacro(\"__riscv_fsqrt\");\n }\n\n if (HasC)\n Builder.defineMacro(\"__riscv_compressed\");\n}\n\n\/\/\/ Return true if has this feature, need to sync with handleTargetFeatures.\nbool RISCVTargetInfo::hasFeature(StringRef Feature) const {\n bool Is64Bit = getTriple().getArch() == llvm::Triple::riscv64;\n return llvm::StringSwitch<bool>(Feature)\n .Case(\"riscv\", true)\n .Case(\"riscv32\", !Is64Bit)\n .Case(\"riscv64\", Is64Bit)\n .Case(\"m\", HasM)\n .Case(\"a\", HasA)\n .Case(\"f\", HasF)\n .Case(\"d\", HasD)\n .Case(\"c\", HasC)\n .Default(false);\n}\n\n\/\/\/ Perform initialization based on the user configured set of features.\nbool RISCVTargetInfo::handleTargetFeatures(std::vector<std::string> &Features,\n DiagnosticsEngine &Diags) {\n for (const auto &Feature : Features) {\n if (Feature == \"+m\")\n HasM = true;\n else if (Feature == \"+a\")\n HasA = true;\n else if (Feature == \"+f\")\n HasF = true;\n else if (Feature == \"+d\")\n HasD = true;\n else if (Feature == \"+c\")\n HasC = true;\n }\n\n return true;\n}\n<commit_msg>[RISCV] Correct Logic around ilp32e macros<commit_after>\/\/===--- RISCV.cpp - Implement RISCV target feature support ---------------===\/\/\n\/\/\n\/\/ Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n\/\/ See https:\/\/llvm.org\/LICENSE.txt for license information.\n\/\/ SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements RISCV TargetInfo objects.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"RISCV.h\"\n#include \"clang\/Basic\/MacroBuilder.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n\nusing namespace clang;\nusing namespace clang::targets;\n\nArrayRef<const char *> RISCVTargetInfo::getGCCRegNames() const {\n static const char *const GCCRegNames[] = {\n \/\/ Integer registers\n \"x0\", \"x1\", \"x2\", \"x3\", \"x4\", \"x5\", \"x6\", \"x7\",\n \"x8\", \"x9\", \"x10\", \"x11\", \"x12\", \"x13\", \"x14\", \"x15\",\n \"x16\", \"x17\", \"x18\", \"x19\", \"x20\", \"x21\", \"x22\", \"x23\",\n \"x24\", \"x25\", \"x26\", \"x27\", \"x28\", \"x29\", \"x30\", \"x31\",\n\n \/\/ Floating point registers\n \"f0\", \"f1\", \"f2\", \"f3\", \"f4\", \"f5\", \"f6\", \"f7\",\n \"f8\", \"f9\", \"f10\", \"f11\", \"f12\", \"f13\", \"f14\", \"f15\",\n \"f16\", \"f17\", \"f18\", \"f19\", \"f20\", \"f21\", \"f22\", \"f23\",\n \"f24\", \"f25\", \"f26\", \"f27\", \"f28\", \"f29\", \"f30\", \"f31\"};\n return llvm::makeArrayRef(GCCRegNames);\n}\n\nArrayRef<TargetInfo::GCCRegAlias> RISCVTargetInfo::getGCCRegAliases() const {\n static const TargetInfo::GCCRegAlias GCCRegAliases[] = {\n {{\"zero\"}, \"x0\"}, {{\"ra\"}, \"x1\"}, {{\"sp\"}, \"x2\"}, {{\"gp\"}, \"x3\"},\n {{\"tp\"}, \"x4\"}, {{\"t0\"}, \"x5\"}, {{\"t1\"}, \"x6\"}, {{\"t2\"}, \"x7\"},\n {{\"s0\"}, \"x8\"}, {{\"s1\"}, \"x9\"}, {{\"a0\"}, \"x10\"}, {{\"a1\"}, \"x11\"},\n {{\"a2\"}, \"x12\"}, {{\"a3\"}, \"x13\"}, {{\"a4\"}, \"x14\"}, {{\"a5\"}, \"x15\"},\n {{\"a6\"}, \"x16\"}, {{\"a7\"}, \"x17\"}, {{\"s2\"}, \"x18\"}, {{\"s3\"}, \"x19\"},\n {{\"s4\"}, \"x20\"}, {{\"s5\"}, \"x21\"}, {{\"s6\"}, \"x22\"}, {{\"s7\"}, \"x23\"},\n {{\"s8\"}, \"x24\"}, {{\"s9\"}, \"x25\"}, {{\"s10\"}, \"x26\"}, {{\"s11\"}, \"x27\"},\n {{\"t3\"}, \"x28\"}, {{\"t4\"}, \"x29\"}, {{\"t5\"}, \"x30\"}, {{\"t6\"}, \"x31\"},\n {{\"ft0\"}, \"f0\"}, {{\"ft1\"}, \"f1\"}, {{\"ft2\"}, \"f2\"}, {{\"ft3\"}, \"f3\"},\n {{\"ft4\"}, \"f4\"}, {{\"ft5\"}, \"f5\"}, {{\"ft6\"}, \"f6\"}, {{\"ft7\"}, \"f7\"},\n {{\"fs0\"}, \"f8\"}, {{\"fs1\"}, \"f9\"}, {{\"fa0\"}, \"f10\"}, {{\"fa1\"}, \"f11\"},\n {{\"fa2\"}, \"f12\"}, {{\"fa3\"}, \"f13\"}, {{\"fa4\"}, \"f14\"}, {{\"fa5\"}, \"f15\"},\n {{\"fa6\"}, \"f16\"}, {{\"fa7\"}, \"f17\"}, {{\"fs2\"}, \"f18\"}, {{\"fs3\"}, \"f19\"},\n {{\"fs4\"}, \"f20\"}, {{\"fs5\"}, \"f21\"}, {{\"fs6\"}, \"f22\"}, {{\"fs7\"}, \"f23\"},\n {{\"fs8\"}, \"f24\"}, {{\"fs9\"}, \"f25\"}, {{\"fs10\"}, \"f26\"}, {{\"fs11\"}, \"f27\"},\n {{\"ft8\"}, \"f28\"}, {{\"ft9\"}, \"f29\"}, {{\"ft10\"}, \"f30\"}, {{\"ft11\"}, \"f31\"}};\n return llvm::makeArrayRef(GCCRegAliases);\n}\n\nbool RISCVTargetInfo::validateAsmConstraint(\n const char *&Name, TargetInfo::ConstraintInfo &Info) const {\n switch (*Name) {\n default:\n return false;\n case 'I':\n \/\/ A 12-bit signed immediate.\n Info.setRequiresImmediate(-2048, 2047);\n return true;\n case 'J':\n \/\/ Integer zero.\n Info.setRequiresImmediate(0);\n return true;\n case 'K':\n \/\/ A 5-bit unsigned immediate for CSR access instructions.\n Info.setRequiresImmediate(0, 31);\n return true;\n case 'f':\n \/\/ A floating-point register.\n Info.setAllowsRegister();\n return true;\n case 'A':\n \/\/ An address that is held in a general-purpose register.\n Info.setAllowsMemory();\n return true;\n }\n}\n\nvoid RISCVTargetInfo::getTargetDefines(const LangOptions &Opts,\n MacroBuilder &Builder) const {\n Builder.defineMacro(\"__ELF__\");\n Builder.defineMacro(\"__riscv\");\n bool Is64Bit = getTriple().getArch() == llvm::Triple::riscv64;\n Builder.defineMacro(\"__riscv_xlen\", Is64Bit ? \"64\" : \"32\");\n \/\/ TODO: modify when more code models are supported.\n Builder.defineMacro(\"__riscv_cmodel_medlow\");\n\n StringRef ABIName = getABI();\n if (ABIName == \"ilp32f\" || ABIName == \"lp64f\")\n Builder.defineMacro(\"__riscv_float_abi_single\");\n else if (ABIName == \"ilp32d\" || ABIName == \"lp64d\")\n Builder.defineMacro(\"__riscv_float_abi_double\");\n else\n Builder.defineMacro(\"__riscv_float_abi_soft\");\n\n if (ABIName == \"ilp32e\")\n Builder.defineMacro(\"__riscv_abi_rve\");\n\n if (HasM) {\n Builder.defineMacro(\"__riscv_mul\");\n Builder.defineMacro(\"__riscv_div\");\n Builder.defineMacro(\"__riscv_muldiv\");\n }\n\n if (HasA)\n Builder.defineMacro(\"__riscv_atomic\");\n\n if (HasF || HasD) {\n Builder.defineMacro(\"__riscv_flen\", HasD ? \"64\" : \"32\");\n Builder.defineMacro(\"__riscv_fdiv\");\n Builder.defineMacro(\"__riscv_fsqrt\");\n }\n\n if (HasC)\n Builder.defineMacro(\"__riscv_compressed\");\n}\n\n\/\/\/ Return true if has this feature, need to sync with handleTargetFeatures.\nbool RISCVTargetInfo::hasFeature(StringRef Feature) const {\n bool Is64Bit = getTriple().getArch() == llvm::Triple::riscv64;\n return llvm::StringSwitch<bool>(Feature)\n .Case(\"riscv\", true)\n .Case(\"riscv32\", !Is64Bit)\n .Case(\"riscv64\", Is64Bit)\n .Case(\"m\", HasM)\n .Case(\"a\", HasA)\n .Case(\"f\", HasF)\n .Case(\"d\", HasD)\n .Case(\"c\", HasC)\n .Default(false);\n}\n\n\/\/\/ Perform initialization based on the user configured set of features.\nbool RISCVTargetInfo::handleTargetFeatures(std::vector<std::string> &Features,\n DiagnosticsEngine &Diags) {\n for (const auto &Feature : Features) {\n if (Feature == \"+m\")\n HasM = true;\n else if (Feature == \"+a\")\n HasA = true;\n else if (Feature == \"+f\")\n HasF = true;\n else if (Feature == \"+d\")\n HasD = true;\n else if (Feature == \"+c\")\n HasC = true;\n }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/***************************************\n** Tsunagari Tile Engine **\n** window.cpp **\n** Copyright 2011-2013 PariahSoft LLC **\n***************************************\/\n\n\/\/ **********\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/ **********\n\n#include <Gosu\/Graphics.hpp> \/\/ for Gosu::Graphics\n#include <Gosu\/Timing.hpp>\n#include <Gosu\/Utility.hpp>\n\n#include \"gosu-window.h\"\n\n#include \"..\/client-conf.h\"\n#include \"..\/reader.h\"\n#include \"..\/world.h\"\n\n#define ASSERT(x) if (!(x)) { return false; }\n\n\/\/ Garbage collection called every X milliseconds\n#define GC_CALL_PERIOD 10 * 1000\n\nnamespace Gosu {\n\t\/**\n\t * Enable 1980s-style graphics scaling: nearest-neighbor filtering.\n\t * Call this function before creating any Gosu::Image.\n\t *\/\n\tvoid enableUndocumentedRetrofication() {\n\t\textern bool undocumentedRetrofication;\n\t\tundocumentedRetrofication = true;\n\t}\n}\n\n\nGameWindow* GameWindow::create()\n{\n\treturn new GosuGameWindow();\n}\n\nstatic GosuGameWindow* globalWindow = NULL;\n\nGameWindow& GameWindow::instance()\n{\n\treturn *globalWindow;\n}\n\ntime_t GameWindow::time()\n{\n\treturn Gosu::milliseconds();\n}\n\n\nGosuGameWindow::GosuGameWindow()\n\t\/\/ Gosu emulates the requested screen resolution on fullscreen,\n\t\/\/ but this breaks our aspect ratio-correcting letterbox.\n\t\/\/ Ergo we just make a window the size of the screen.\n\t: Gosu::Window(\n\t conf.fullscreen ? Gosu::screenWidth() :\n\t (unsigned)conf.windowSize.x,\n\t conf.fullscreen ? Gosu::screenHeight() :\n\t (unsigned)conf.windowSize.y,\n\t conf.fullscreen\n\t ),\n\t now(Gosu::milliseconds()),\n\t lastGCtime(0)\n{\n\tglobalWindow = this;\n\tGosu::enableUndocumentedRetrofication();\n\n\tgosuToTsunagariKey.resize(Gosu::ButtonName::numButtons);\n\tauto& keys = gosuToTsunagariKey;\n\tkeys[Gosu::ButtonName::kbEscape] = KBEscape;\n\tkeys[Gosu::ButtonName::kbLeftShift] = KBLeftShift;\n\tkeys[Gosu::ButtonName::kbRightShift] = KBRightShift;\n\tkeys[Gosu::ButtonName::kbLeftControl] = KBLeftControl;\n\tkeys[Gosu::ButtonName::kbRightControl] = KBRightControl;\n\tkeys[Gosu::ButtonName::kbSpace] = KBSpace;\n\tkeys[Gosu::ButtonName::kbLeft] = KBLeftArrow;\n\tkeys[Gosu::ButtonName::kbRight] = KBRightArrow;\n\tkeys[Gosu::ButtonName::kbUp] = KBUpArrow;\n\tkeys[Gosu::ButtonName::kbDown] = KBDownArrow;\n}\n\nGosuGameWindow::~GosuGameWindow()\n{\n}\n\nbool GosuGameWindow::init()\n{\n\treturn true;\n}\n\nunsigned GosuGameWindow::width() const\n{\n\treturn graphics().width();\n}\n\nunsigned GosuGameWindow::height() const\n{\n\treturn graphics().height();\n}\n\nvoid GosuGameWindow::setCaption(const std::string& caption)\n{\n\tGosu::Window::setCaption(Gosu::widen(caption));\n}\n\nvoid GosuGameWindow::buttonDown(const Gosu::Button btn)\n{\n\tnow = (int)Gosu::milliseconds();\n\tif (keystates.find(btn) == keystates.end()) {\n\t\tkeystate& state = keystates[btn];\n\t\tstate.since = now;\n\t\tstate.initiallyResolved = false;\n\t\tstate.consecutive = false;\n\t}\n\n\t\/\/ We process the initial buttonDown here so that it\n\t\/\/ gets handled even if we receive a buttonUp before an\n\t\/\/ update.\n\tauto mapped = gosuToTsunagariKey[btn.id()];\n\tif (mapped)\n\t\temitKeyDown(mapped);\n}\n\nvoid GosuGameWindow::buttonUp(const Gosu::Button btn)\n{\n\tkeystates.erase(btn);\n\n\tauto mapped = gosuToTsunagariKey[btn.id()];\n\tif (mapped)\n\t\temitKeyUp(mapped);\n}\n\nvoid GosuGameWindow::draw()\n{\n\tWorld::instance().draw();\n}\n\nbool GosuGameWindow::needsRedraw() const\n{\n\treturn World::instance().needsRedraw();\n}\n\nvoid GosuGameWindow::update()\n{\n\tnow = time();\n\n\tif (conf.moveMode == TURN)\n\t\thandleKeyboardInput(now);\n\tWorld::instance().update(now);\n\n\tif (now > lastGCtime + GC_CALL_PERIOD) {\n\t\tlastGCtime = now;\n\t\tReader::garbageCollect();\n\t}\n}\n\nvoid GosuGameWindow::mainLoop()\n{\n\tshow();\n}\n\nvoid GosuGameWindow::drawRect(double x1, double x2, double y1, double y2,\n\t\tunsigned int argb)\n{\n\tGosu::Color c(argb);\n\tdouble top = std::numeric_limits<double>::max();\n\tgraphics().drawQuad(\n\t\tx1, y1, c,\n\t\tx2, y1, c,\n\t\tx2, y2, c,\n\t\tx1, y2, c,\n\t\ttop\n\t);\n}\n\nvoid GosuGameWindow::scale(double x, double y)\n{\n\tgraphics().pushTransform(Gosu::scale(x, y));\n}\n\nvoid GosuGameWindow::translate(double x, double y)\n{\n\tgraphics().pushTransform(Gosu::translate(x, y));\n}\n\nvoid GosuGameWindow::clip(double x, double y, double width, double height)\n{\n\tgraphics().beginClipping(x, y, width, height);\n}\n\n\nvoid GosuGameWindow::handleKeyboardInput(time_t now)\n{\n\tstd::map<Gosu::Button, keystate>::iterator it;\n\n\t\/\/ Persistent input handling code\n\tfor (it = keystates.begin(); it != keystates.end(); it++) {\n\t\tGosu::Button btn = it->first;\n\t\tkeystate& state = it->second;\n\n\t\t\/\/ If there is persistCons milliseconds of latency\n\t\t\/\/ between when a button is depressed and when we first look at\n\t\t\/\/ it here, we'll incorrectly try to fire off a second round of\n\t\t\/\/ input.\n\t\t\/\/ This can happen if an intermediary function blocks the thread\n\t\t\/\/ for a while.\n\t\tif (!state.initiallyResolved) {\n\t\t\tstate.initiallyResolved = true;\n\t\t\tcontinue;\n\t\t}\n\n\t\ttime_t delay = state.consecutive ?\n\t\t conf.persistCons : conf.persistInit;\n\t\tif (now >= state.since + delay) {\n\t\t\tstate.since = now;\n\t\t\t\/\/World::instance().buttonDown(btn);\n\t\t\tstate.consecutive = true;\n\t\t}\n\t}\n}\n\n<commit_msg>gosu-window: fix compiler warnings<commit_after>\/***************************************\n** Tsunagari Tile Engine **\n** window.cpp **\n** Copyright 2011-2013 PariahSoft LLC **\n***************************************\/\n\n\/\/ **********\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/ **********\n\n#include <Gosu\/Graphics.hpp> \/\/ for Gosu::Graphics\n#include <Gosu\/Timing.hpp>\n#include <Gosu\/Utility.hpp>\n\n#include \"gosu-window.h\"\n\n#include \"..\/client-conf.h\"\n#include \"..\/reader.h\"\n#include \"..\/world.h\"\n\n#define ASSERT(x) if (!(x)) { return false; }\n\n\/\/ Garbage collection called every X milliseconds\n#define GC_CALL_PERIOD 10 * 1000\n\nnamespace Gosu {\n\t\/**\n\t * Enable 1980s-style graphics scaling: nearest-neighbor filtering.\n\t * Call this function before creating any Gosu::Image.\n\t *\/\n\tvoid enableUndocumentedRetrofication() {\n\t\textern bool undocumentedRetrofication;\n\t\tundocumentedRetrofication = true;\n\t}\n}\n\n\nGameWindow* GameWindow::create()\n{\n\treturn new GosuGameWindow();\n}\n\nstatic GosuGameWindow* globalWindow = NULL;\n\nGameWindow& GameWindow::instance()\n{\n\treturn *globalWindow;\n}\n\ntime_t GameWindow::time()\n{\n\treturn (time_t)Gosu::milliseconds();\n}\n\n\nGosuGameWindow::GosuGameWindow()\n\t\/\/ Gosu emulates the requested screen resolution on fullscreen,\n\t\/\/ but this breaks our aspect ratio-correcting letterbox.\n\t\/\/ Ergo we just make a window the size of the screen.\n\t: Gosu::Window(\n\t conf.fullscreen ? Gosu::screenWidth() :\n\t (unsigned)conf.windowSize.x,\n\t conf.fullscreen ? Gosu::screenHeight() :\n\t (unsigned)conf.windowSize.y,\n\t conf.fullscreen\n\t ),\n\t now(this->time()),\n\t lastGCtime(0)\n{\n\tglobalWindow = this;\n\tGosu::enableUndocumentedRetrofication();\n\n\tgosuToTsunagariKey.resize(Gosu::ButtonName::numButtons);\n\tauto& keys = gosuToTsunagariKey;\n\tkeys[Gosu::ButtonName::kbEscape] = KBEscape;\n\tkeys[Gosu::ButtonName::kbLeftShift] = KBLeftShift;\n\tkeys[Gosu::ButtonName::kbRightShift] = KBRightShift;\n\tkeys[Gosu::ButtonName::kbLeftControl] = KBLeftControl;\n\tkeys[Gosu::ButtonName::kbRightControl] = KBRightControl;\n\tkeys[Gosu::ButtonName::kbSpace] = KBSpace;\n\tkeys[Gosu::ButtonName::kbLeft] = KBLeftArrow;\n\tkeys[Gosu::ButtonName::kbRight] = KBRightArrow;\n\tkeys[Gosu::ButtonName::kbUp] = KBUpArrow;\n\tkeys[Gosu::ButtonName::kbDown] = KBDownArrow;\n}\n\nGosuGameWindow::~GosuGameWindow()\n{\n}\n\nbool GosuGameWindow::init()\n{\n\treturn true;\n}\n\nunsigned GosuGameWindow::width() const\n{\n\treturn graphics().width();\n}\n\nunsigned GosuGameWindow::height() const\n{\n\treturn graphics().height();\n}\n\nvoid GosuGameWindow::setCaption(const std::string& caption)\n{\n\tGosu::Window::setCaption(Gosu::widen(caption));\n}\n\nvoid GosuGameWindow::buttonDown(const Gosu::Button btn)\n{\n\tnow = this->time();\n\tif (keystates.find(btn) == keystates.end()) {\n\t\tkeystate& state = keystates[btn];\n\t\tstate.since = now;\n\t\tstate.initiallyResolved = false;\n\t\tstate.consecutive = false;\n\t}\n\n\t\/\/ We process the initial buttonDown here so that it\n\t\/\/ gets handled even if we receive a buttonUp before an\n\t\/\/ update.\n\tauto mapped = gosuToTsunagariKey[btn.id()];\n\tif (mapped)\n\t\temitKeyDown(mapped);\n}\n\nvoid GosuGameWindow::buttonUp(const Gosu::Button btn)\n{\n\tkeystates.erase(btn);\n\n\tauto mapped = gosuToTsunagariKey[btn.id()];\n\tif (mapped)\n\t\temitKeyUp(mapped);\n}\n\nvoid GosuGameWindow::draw()\n{\n\tWorld::instance().draw();\n}\n\nbool GosuGameWindow::needsRedraw() const\n{\n\treturn World::instance().needsRedraw();\n}\n\nvoid GosuGameWindow::update()\n{\n\tnow = this->time();\n\n\tif (conf.moveMode == TURN)\n\t\thandleKeyboardInput(now);\n\tWorld::instance().update(now);\n\n\tif (now > lastGCtime + GC_CALL_PERIOD) {\n\t\tlastGCtime = now;\n\t\tReader::garbageCollect();\n\t}\n}\n\nvoid GosuGameWindow::mainLoop()\n{\n\tshow();\n}\n\nvoid GosuGameWindow::drawRect(double x1, double x2, double y1, double y2,\n\t\tunsigned int argb)\n{\n\tGosu::Color c(argb);\n\tdouble top = std::numeric_limits<double>::max();\n\tgraphics().drawQuad(\n\t\tx1, y1, c,\n\t\tx2, y1, c,\n\t\tx2, y2, c,\n\t\tx1, y2, c,\n\t\ttop\n\t);\n}\n\nvoid GosuGameWindow::scale(double x, double y)\n{\n\tgraphics().pushTransform(Gosu::scale(x, y));\n}\n\nvoid GosuGameWindow::translate(double x, double y)\n{\n\tgraphics().pushTransform(Gosu::translate(x, y));\n}\n\nvoid GosuGameWindow::clip(double x, double y, double width, double height)\n{\n\tgraphics().beginClipping(x, y, width, height);\n}\n\n\nvoid GosuGameWindow::handleKeyboardInput(time_t now)\n{\n\tstd::map<Gosu::Button, keystate>::iterator it;\n\n\t\/\/ Persistent input handling code\n\tfor (it = keystates.begin(); it != keystates.end(); it++) {\n\t\tGosu::Button btn = it->first;\n\t\tauto mapped = gosuToTsunagariKey[btn.id()];\n\t\tkeystate& state = it->second;\n\n\t\t\/\/ If there is persistCons milliseconds of latency\n\t\t\/\/ between when a button is depressed and when we first look at\n\t\t\/\/ it here, we'll incorrectly try to fire off a second round of\n\t\t\/\/ input.\n\t\t\/\/ This can happen if an intermediary function blocks the thread\n\t\t\/\/ for a while.\n\t\tif (!state.initiallyResolved) {\n\t\t\tstate.initiallyResolved = true;\n\t\t\tcontinue;\n\t\t}\n\n\t\ttime_t delay = state.consecutive ?\n\t\t conf.persistCons : conf.persistInit;\n\t\tif (now >= state.since + delay) {\n\t\t\tstate.since += delay;\n\t\t\tWorld::instance().buttonDown(mapped);\n\t\t\tstate.consecutive = true;\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- Immediate.cpp - the swift immediate mode -------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2016 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See http:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See http:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This is the implementation of the swift interpreter, which takes a\n\/\/ source file and JITs it.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"swift-immediate\"\n#include \"swift\/Immediate\/Immediate.h\"\n#include \"ImmediateImpl.h\"\n\n#include \"swift\/Subsystems.h\"\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/AST\/IRGenOptions.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/ExecutionEngine\/MCJIT.h\"\n#include \"llvm\/IR\/DiagnosticPrinter.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/Linker\/Linker.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include \"llvm\/Support\/Path.h\"\n\n#include <dlfcn.h>\n\nusing namespace swift;\nusing namespace swift::immediate;\n\nstatic bool loadRuntimeLib(StringRef sharedLibName, StringRef runtimeLibPath) {\n \/\/ FIXME: Need error-checking.\n llvm::SmallString<128> Path = runtimeLibPath;\n llvm::sys::path::append(Path, sharedLibName);\n return dlopen(Path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n}\n\nbool swift::immediate::loadSwiftRuntime(StringRef runtimeLibPath) {\n return loadRuntimeLib(\"libswiftCore\" LTDL_SHLIB_EXT, runtimeLibPath);\n}\n\nstatic bool tryLoadLibrary(LinkLibrary linkLib,\n SearchPathOptions searchPathOpts) {\n llvm::SmallString<128> path = linkLib.getName();\n\n \/\/ If we have an absolute or relative path, just try to load it now.\n if (llvm::sys::path::has_parent_path(path.str())) {\n return dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n }\n\n bool success = false;\n switch (linkLib.getKind()) {\n case LibraryKind::Library: {\n llvm::SmallString<32> stem;\n if (llvm::sys::path::has_extension(path.str())) {\n stem = std::move(path);\n } else {\n \/\/ FIXME: Try the appropriate extension for the current platform?\n stem = \"lib\";\n stem += path;\n stem += LTDL_SHLIB_EXT;\n }\n\n \/\/ Try user-provided library search paths first.\n for (auto &libDir : searchPathOpts.LibrarySearchPaths) {\n path = libDir;\n llvm::sys::path::append(path, stem.str());\n success = dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n if (success)\n break;\n }\n\n \/\/ Let dlopen determine the best search paths.\n if (!success)\n success = dlopen(stem.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n\n \/\/ If that fails, try our runtime library path.\n if (!success)\n success = loadRuntimeLib(stem, searchPathOpts.RuntimeLibraryPath);\n break;\n }\n case LibraryKind::Framework: {\n \/\/ If we have a framework, mangle the name to point to the framework\n \/\/ binary.\n llvm::SmallString<64> frameworkPart{std::move(path)};\n frameworkPart += \".framework\";\n llvm::sys::path::append(frameworkPart, linkLib.getName());\n\n \/\/ Try user-provided framework search paths first; frameworks contain\n \/\/ binaries as well as modules.\n for (auto &frameworkDir : searchPathOpts.FrameworkSearchPaths) {\n path = frameworkDir;\n llvm::sys::path::append(path, frameworkPart.str());\n success = dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n if (success)\n break;\n }\n\n \/\/ If that fails, let dlopen search for system frameworks.\n if (!success)\n success = dlopen(frameworkPart.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n break;\n }\n }\n\n return success;\n}\n\nbool swift::immediate::tryLoadLibraries(ArrayRef<LinkLibrary> LinkLibraries,\n SearchPathOptions SearchPathOpts,\n DiagnosticEngine &Diags) {\n SmallVector<bool, 4> LoadedLibraries;\n LoadedLibraries.append(LinkLibraries.size(), false);\n\n \/\/ Libraries are not sorted in the topological order of dependencies, and we\n \/\/ don't know the dependencies in advance. Try to load all libraries until\n \/\/ we stop making progress.\n bool HadProgress;\n do {\n HadProgress = false;\n for (unsigned i = 0; i != LinkLibraries.size(); ++i) {\n if (!LoadedLibraries[i] &&\n tryLoadLibrary(LinkLibraries[i], SearchPathOpts)) {\n LoadedLibraries[i] = true;\n HadProgress = true;\n }\n }\n } while (HadProgress);\n\n return std::all_of(LoadedLibraries.begin(), LoadedLibraries.end(),\n [](bool Value) { return Value; });\n}\n\nstatic void linkerDiagnosticHandlerNoCtx(const llvm::DiagnosticInfo &DI) {\n if (DI.getSeverity() != llvm::DS_Error)\n return;\n\n std::string MsgStorage;\n {\n llvm::raw_string_ostream Stream(MsgStorage);\n llvm::DiagnosticPrinterRawOStream DP(Stream);\n DI.print(DP);\n }\n llvm::errs() << \"Error linking swift modules\\n\";\n llvm::errs() << MsgStorage << \"\\n\";\n}\n\n\n\nstatic void linkerDiagnosticHandler(const llvm::DiagnosticInfo &DI,\n void *Context) {\n \/\/ This assert self documents our precondition that Context is always\n \/\/ nullptr. It seems that parts of LLVM are using the flexibility of having a\n \/\/ context. We don't really care about this.\n assert(Context == nullptr && \"We assume Context is always a nullptr\");\n\n return linkerDiagnosticHandlerNoCtx(DI);\n}\n\nbool swift::immediate::linkLLVMModules(llvm::Module *Module,\n llvm::Module *SubModule\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n \/*, llvm::Linker::LinkerMode LinkerMode *\/)\n{\n llvm::LLVMContext &Ctx = SubModule->getContext();\n auto OldHandler = Ctx.getDiagnosticHandler();\n void *OldDiagnosticContext = Ctx.getDiagnosticContext();\n Ctx.setDiagnosticHandler(linkerDiagnosticHandler, nullptr);\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n bool Failed = llvm::Linker::linkModules(*Module, *SubModule,\n linkerDiagnosticHandlerNoCtx\n \/*, LinkerMode*\/);\n Ctx.setDiagnosticHandler(OldHandler, OldDiagnosticContext);\n\n return !Failed;\n}\n\nbool swift::immediate::IRGenImportedModules(\n CompilerInstance &CI,\n llvm::Module &Module,\n llvm::SmallPtrSet<swift::Module *, 8> &ImportedModules,\n SmallVectorImpl<llvm::Function*> &InitFns,\n IRGenOptions &IRGenOpts,\n const SILOptions &SILOpts) {\n swift::Module *M = CI.getMainModule();\n\n \/\/ Perform autolinking.\n SmallVector<LinkLibrary, 4> AllLinkLibraries(IRGenOpts.LinkLibraries);\n auto addLinkLibrary = [&](LinkLibrary linkLib) {\n AllLinkLibraries.push_back(linkLib);\n };\n\n M->forAllVisibleModules({}, \/*includePrivateTopLevel=*\/true,\n [&](Module::ImportedModule import) {\n import.second->collectLinkLibraries(addLinkLibrary);\n });\n\n \/\/ Hack to handle thunks eagerly synthesized by the Clang importer.\n swift::Module *prev = nullptr;\n for (auto external : CI.getASTContext().ExternalDefinitions) {\n swift::Module *next = external->getModuleContext();\n if (next == prev)\n continue;\n next->collectLinkLibraries(addLinkLibrary);\n prev = next;\n }\n\n tryLoadLibraries(AllLinkLibraries, CI.getASTContext().SearchPathOpts,\n CI.getDiags());\n\n ImportedModules.insert(M);\n if (!CI.hasSourceImport())\n return false;\n\n \/\/ IRGen the modules this module depends on. This is only really necessary\n \/\/ for imported source, but that's a very convenient thing to do in -i mode.\n \/\/ FIXME: Crawling all loaded modules is a hack.\n \/\/ FIXME: And re-doing SILGen, SIL-linking, SIL diagnostics, and IRGen is\n \/\/ expensive, because it's not properly being limited to new things right now.\n bool hadError = false;\n for (auto &entry : CI.getASTContext().LoadedModules) {\n swift::Module *import = entry.second;\n if (!ImportedModules.insert(import).second)\n continue;\n\n std::unique_ptr<SILModule> SILMod = performSILGeneration(import,\n CI.getSILOptions());\n performSILLinking(SILMod.get());\n if (runSILDiagnosticPasses(*SILMod)) {\n hadError = true;\n break;\n }\n\n \/\/ FIXME: We shouldn't need to use the global context here, but\n \/\/ something is persisting across calls to performIRGeneration.\n auto SubModule = performIRGeneration(IRGenOpts, import, SILMod.get(),\n import->getName().str(),\n llvm::getGlobalContext());\n\n if (CI.getASTContext().hadError()) {\n hadError = true;\n break;\n }\n\n if (!linkLLVMModules(&Module, SubModule.get()\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n \/*, llvm::Linker::DestroySource *\/)) {\n hadError = true;\n break;\n }\n\n \/\/ FIXME: This is an ugly hack; need to figure out how this should\n \/\/ actually work.\n SmallVector<char, 20> NameBuf;\n StringRef InitFnName = (import->getName().str() + \".init\").toStringRef(NameBuf);\n llvm::Function *InitFn = Module.getFunction(InitFnName);\n if (InitFn)\n InitFns.push_back(InitFn);\n }\n\n return hadError;\n}\n\nint swift::RunImmediately(CompilerInstance &CI, const ProcessCmdLine &CmdLine,\n IRGenOptions &IRGenOpts, const SILOptions &SILOpts) {\n ASTContext &Context = CI.getASTContext();\n \n \/\/ IRGen the main module.\n auto *swiftModule = CI.getMainModule();\n \/\/ FIXME: We shouldn't need to use the global context here, but\n \/\/ something is persisting across calls to performIRGeneration.\n auto ModuleOwner = performIRGeneration(\n IRGenOpts, swiftModule, CI.getSILModule(), swiftModule->getName().str(),\n llvm::getGlobalContext());\n auto *Module = ModuleOwner.get();\n\n if (Context.hadError())\n return -1;\n\n SmallVector<llvm::Function*, 8> InitFns;\n llvm::SmallPtrSet<swift::Module *, 8> ImportedModules;\n if (IRGenImportedModules(CI, *Module, ImportedModules, InitFns,\n IRGenOpts, SILOpts))\n return -1;\n\n llvm::PassManagerBuilder PMBuilder;\n PMBuilder.OptLevel = 2;\n PMBuilder.Inliner = llvm::createFunctionInliningPass(200);\n\n if (!loadSwiftRuntime(Context.SearchPathOpts.RuntimeLibraryPath)) {\n CI.getDiags().diagnose(SourceLoc(),\n diag::error_immediate_mode_missing_stdlib);\n return -1;\n }\n\n \/\/ Build the ExecutionEngine.\n llvm::EngineBuilder builder(std::move(ModuleOwner));\n std::string ErrorMsg;\n llvm::TargetOptions TargetOpt;\n std::string CPU;\n std::vector<std::string> Features;\n std::tie(TargetOpt, CPU, Features)\n = getIRTargetOptions(IRGenOpts, swiftModule->getASTContext());\n builder.setRelocationModel(llvm::Reloc::PIC_);\n builder.setTargetOptions(TargetOpt);\n builder.setMCPU(CPU);\n builder.setMAttrs(Features);\n builder.setErrorStr(&ErrorMsg);\n builder.setEngineKind(llvm::EngineKind::JIT);\n llvm::ExecutionEngine *EE = builder.create();\n if (!EE) {\n llvm::errs() << \"Error loading JIT: \" << ErrorMsg;\n return -1;\n }\n\n DEBUG(llvm::dbgs() << \"Module to be executed:\\n\";\n Module->dump());\n\n EE->finalizeObject();\n \n \/\/ Run the generated program.\n for (auto InitFn : InitFns) {\n DEBUG(llvm::dbgs() << \"Running initialization function \"\n << InitFn->getName() << '\\n');\n EE->runFunctionAsMain(InitFn, CmdLine, 0);\n }\n\n DEBUG(llvm::dbgs() << \"Running static constructors\\n\");\n EE->runStaticConstructorsDestructors(false);\n DEBUG(llvm::dbgs() << \"Running main\\n\");\n llvm::Function *EntryFn = Module->getFunction(\"main\");\n return EE->runFunctionAsMain(EntryFn, CmdLine, 0);\n}\n<commit_msg>llvm::DiagnosticInfo.h upstream now has its own header llvm\/IR\/DiagnosticInfo.h. Include it in Immediate.cpp.<commit_after>\/\/===--- Immediate.cpp - the swift immediate mode -------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2016 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See http:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See http:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This is the implementation of the swift interpreter, which takes a\n\/\/ source file and JITs it.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"swift-immediate\"\n#include \"swift\/Immediate\/Immediate.h\"\n#include \"ImmediateImpl.h\"\n\n#include \"swift\/Subsystems.h\"\n#include \"swift\/AST\/ASTContext.h\"\n#include \"swift\/AST\/DiagnosticsFrontend.h\"\n#include \"swift\/AST\/IRGenOptions.h\"\n#include \"swift\/AST\/Module.h\"\n#include \"swift\/Frontend\/Frontend.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/Basic\/LLVM.h\"\n#include \"llvm\/ADT\/SmallString.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/ExecutionEngine\/MCJIT.h\"\n#include \"llvm\/IR\/DiagnosticPrinter.h\"\n#include \"llvm\/IR\/DiagnosticInfo.h\"\n#include \"llvm\/IR\/LLVMContext.h\"\n#include \"llvm\/Linker\/Linker.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n#include \"llvm\/Support\/Path.h\"\n\n#include <dlfcn.h>\n\nusing namespace swift;\nusing namespace swift::immediate;\n\nstatic bool loadRuntimeLib(StringRef sharedLibName, StringRef runtimeLibPath) {\n \/\/ FIXME: Need error-checking.\n llvm::SmallString<128> Path = runtimeLibPath;\n llvm::sys::path::append(Path, sharedLibName);\n return dlopen(Path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n}\n\nbool swift::immediate::loadSwiftRuntime(StringRef runtimeLibPath) {\n return loadRuntimeLib(\"libswiftCore\" LTDL_SHLIB_EXT, runtimeLibPath);\n}\n\nstatic bool tryLoadLibrary(LinkLibrary linkLib,\n SearchPathOptions searchPathOpts) {\n llvm::SmallString<128> path = linkLib.getName();\n\n \/\/ If we have an absolute or relative path, just try to load it now.\n if (llvm::sys::path::has_parent_path(path.str())) {\n return dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n }\n\n bool success = false;\n switch (linkLib.getKind()) {\n case LibraryKind::Library: {\n llvm::SmallString<32> stem;\n if (llvm::sys::path::has_extension(path.str())) {\n stem = std::move(path);\n } else {\n \/\/ FIXME: Try the appropriate extension for the current platform?\n stem = \"lib\";\n stem += path;\n stem += LTDL_SHLIB_EXT;\n }\n\n \/\/ Try user-provided library search paths first.\n for (auto &libDir : searchPathOpts.LibrarySearchPaths) {\n path = libDir;\n llvm::sys::path::append(path, stem.str());\n success = dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n if (success)\n break;\n }\n\n \/\/ Let dlopen determine the best search paths.\n if (!success)\n success = dlopen(stem.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n\n \/\/ If that fails, try our runtime library path.\n if (!success)\n success = loadRuntimeLib(stem, searchPathOpts.RuntimeLibraryPath);\n break;\n }\n case LibraryKind::Framework: {\n \/\/ If we have a framework, mangle the name to point to the framework\n \/\/ binary.\n llvm::SmallString<64> frameworkPart{std::move(path)};\n frameworkPart += \".framework\";\n llvm::sys::path::append(frameworkPart, linkLib.getName());\n\n \/\/ Try user-provided framework search paths first; frameworks contain\n \/\/ binaries as well as modules.\n for (auto &frameworkDir : searchPathOpts.FrameworkSearchPaths) {\n path = frameworkDir;\n llvm::sys::path::append(path, frameworkPart.str());\n success = dlopen(path.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n if (success)\n break;\n }\n\n \/\/ If that fails, let dlopen search for system frameworks.\n if (!success)\n success = dlopen(frameworkPart.c_str(), RTLD_LAZY | RTLD_GLOBAL);\n break;\n }\n }\n\n return success;\n}\n\nbool swift::immediate::tryLoadLibraries(ArrayRef<LinkLibrary> LinkLibraries,\n SearchPathOptions SearchPathOpts,\n DiagnosticEngine &Diags) {\n SmallVector<bool, 4> LoadedLibraries;\n LoadedLibraries.append(LinkLibraries.size(), false);\n\n \/\/ Libraries are not sorted in the topological order of dependencies, and we\n \/\/ don't know the dependencies in advance. Try to load all libraries until\n \/\/ we stop making progress.\n bool HadProgress;\n do {\n HadProgress = false;\n for (unsigned i = 0; i != LinkLibraries.size(); ++i) {\n if (!LoadedLibraries[i] &&\n tryLoadLibrary(LinkLibraries[i], SearchPathOpts)) {\n LoadedLibraries[i] = true;\n HadProgress = true;\n }\n }\n } while (HadProgress);\n\n return std::all_of(LoadedLibraries.begin(), LoadedLibraries.end(),\n [](bool Value) { return Value; });\n}\n\nstatic void linkerDiagnosticHandlerNoCtx(const llvm::DiagnosticInfo &DI) {\n if (DI.getSeverity() != llvm::DS_Error)\n return;\n\n std::string MsgStorage;\n {\n llvm::raw_string_ostream Stream(MsgStorage);\n llvm::DiagnosticPrinterRawOStream DP(Stream);\n DI.print(DP);\n }\n llvm::errs() << \"Error linking swift modules\\n\";\n llvm::errs() << MsgStorage << \"\\n\";\n}\n\n\n\nstatic void linkerDiagnosticHandler(const llvm::DiagnosticInfo &DI,\n void *Context) {\n \/\/ This assert self documents our precondition that Context is always\n \/\/ nullptr. It seems that parts of LLVM are using the flexibility of having a\n \/\/ context. We don't really care about this.\n assert(Context == nullptr && \"We assume Context is always a nullptr\");\n\n return linkerDiagnosticHandlerNoCtx(DI);\n}\n\nbool swift::immediate::linkLLVMModules(llvm::Module *Module,\n llvm::Module *SubModule\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n \/*, llvm::Linker::LinkerMode LinkerMode *\/)\n{\n llvm::LLVMContext &Ctx = SubModule->getContext();\n auto OldHandler = Ctx.getDiagnosticHandler();\n void *OldDiagnosticContext = Ctx.getDiagnosticContext();\n Ctx.setDiagnosticHandler(linkerDiagnosticHandler, nullptr);\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n bool Failed = llvm::Linker::linkModules(*Module, *SubModule,\n linkerDiagnosticHandlerNoCtx\n \/*, LinkerMode*\/);\n Ctx.setDiagnosticHandler(OldHandler, OldDiagnosticContext);\n\n return !Failed;\n}\n\nbool swift::immediate::IRGenImportedModules(\n CompilerInstance &CI,\n llvm::Module &Module,\n llvm::SmallPtrSet<swift::Module *, 8> &ImportedModules,\n SmallVectorImpl<llvm::Function*> &InitFns,\n IRGenOptions &IRGenOpts,\n const SILOptions &SILOpts) {\n swift::Module *M = CI.getMainModule();\n\n \/\/ Perform autolinking.\n SmallVector<LinkLibrary, 4> AllLinkLibraries(IRGenOpts.LinkLibraries);\n auto addLinkLibrary = [&](LinkLibrary linkLib) {\n AllLinkLibraries.push_back(linkLib);\n };\n\n M->forAllVisibleModules({}, \/*includePrivateTopLevel=*\/true,\n [&](Module::ImportedModule import) {\n import.second->collectLinkLibraries(addLinkLibrary);\n });\n\n \/\/ Hack to handle thunks eagerly synthesized by the Clang importer.\n swift::Module *prev = nullptr;\n for (auto external : CI.getASTContext().ExternalDefinitions) {\n swift::Module *next = external->getModuleContext();\n if (next == prev)\n continue;\n next->collectLinkLibraries(addLinkLibrary);\n prev = next;\n }\n\n tryLoadLibraries(AllLinkLibraries, CI.getASTContext().SearchPathOpts,\n CI.getDiags());\n\n ImportedModules.insert(M);\n if (!CI.hasSourceImport())\n return false;\n\n \/\/ IRGen the modules this module depends on. This is only really necessary\n \/\/ for imported source, but that's a very convenient thing to do in -i mode.\n \/\/ FIXME: Crawling all loaded modules is a hack.\n \/\/ FIXME: And re-doing SILGen, SIL-linking, SIL diagnostics, and IRGen is\n \/\/ expensive, because it's not properly being limited to new things right now.\n bool hadError = false;\n for (auto &entry : CI.getASTContext().LoadedModules) {\n swift::Module *import = entry.second;\n if (!ImportedModules.insert(import).second)\n continue;\n\n std::unique_ptr<SILModule> SILMod = performSILGeneration(import,\n CI.getSILOptions());\n performSILLinking(SILMod.get());\n if (runSILDiagnosticPasses(*SILMod)) {\n hadError = true;\n break;\n }\n\n \/\/ FIXME: We shouldn't need to use the global context here, but\n \/\/ something is persisting across calls to performIRGeneration.\n auto SubModule = performIRGeneration(IRGenOpts, import, SILMod.get(),\n import->getName().str(),\n llvm::getGlobalContext());\n\n if (CI.getASTContext().hadError()) {\n hadError = true;\n break;\n }\n\n if (!linkLLVMModules(&Module, SubModule.get()\n \/\/ TODO: reactivate the linker mode if it is\n \/\/ supported in llvm again. Otherwise remove the\n \/\/ commented code completely.\n \/*, llvm::Linker::DestroySource *\/)) {\n hadError = true;\n break;\n }\n\n \/\/ FIXME: This is an ugly hack; need to figure out how this should\n \/\/ actually work.\n SmallVector<char, 20> NameBuf;\n StringRef InitFnName = (import->getName().str() + \".init\").toStringRef(NameBuf);\n llvm::Function *InitFn = Module.getFunction(InitFnName);\n if (InitFn)\n InitFns.push_back(InitFn);\n }\n\n return hadError;\n}\n\nint swift::RunImmediately(CompilerInstance &CI, const ProcessCmdLine &CmdLine,\n IRGenOptions &IRGenOpts, const SILOptions &SILOpts) {\n ASTContext &Context = CI.getASTContext();\n \n \/\/ IRGen the main module.\n auto *swiftModule = CI.getMainModule();\n \/\/ FIXME: We shouldn't need to use the global context here, but\n \/\/ something is persisting across calls to performIRGeneration.\n auto ModuleOwner = performIRGeneration(\n IRGenOpts, swiftModule, CI.getSILModule(), swiftModule->getName().str(),\n llvm::getGlobalContext());\n auto *Module = ModuleOwner.get();\n\n if (Context.hadError())\n return -1;\n\n SmallVector<llvm::Function*, 8> InitFns;\n llvm::SmallPtrSet<swift::Module *, 8> ImportedModules;\n if (IRGenImportedModules(CI, *Module, ImportedModules, InitFns,\n IRGenOpts, SILOpts))\n return -1;\n\n llvm::PassManagerBuilder PMBuilder;\n PMBuilder.OptLevel = 2;\n PMBuilder.Inliner = llvm::createFunctionInliningPass(200);\n\n if (!loadSwiftRuntime(Context.SearchPathOpts.RuntimeLibraryPath)) {\n CI.getDiags().diagnose(SourceLoc(),\n diag::error_immediate_mode_missing_stdlib);\n return -1;\n }\n\n \/\/ Build the ExecutionEngine.\n llvm::EngineBuilder builder(std::move(ModuleOwner));\n std::string ErrorMsg;\n llvm::TargetOptions TargetOpt;\n std::string CPU;\n std::vector<std::string> Features;\n std::tie(TargetOpt, CPU, Features)\n = getIRTargetOptions(IRGenOpts, swiftModule->getASTContext());\n builder.setRelocationModel(llvm::Reloc::PIC_);\n builder.setTargetOptions(TargetOpt);\n builder.setMCPU(CPU);\n builder.setMAttrs(Features);\n builder.setErrorStr(&ErrorMsg);\n builder.setEngineKind(llvm::EngineKind::JIT);\n llvm::ExecutionEngine *EE = builder.create();\n if (!EE) {\n llvm::errs() << \"Error loading JIT: \" << ErrorMsg;\n return -1;\n }\n\n DEBUG(llvm::dbgs() << \"Module to be executed:\\n\";\n Module->dump());\n\n EE->finalizeObject();\n \n \/\/ Run the generated program.\n for (auto InitFn : InitFns) {\n DEBUG(llvm::dbgs() << \"Running initialization function \"\n << InitFn->getName() << '\\n');\n EE->runFunctionAsMain(InitFn, CmdLine, 0);\n }\n\n DEBUG(llvm::dbgs() << \"Running static constructors\\n\");\n EE->runStaticConstructorsDestructors(false);\n DEBUG(llvm::dbgs() << \"Running main\\n\");\n llvm::Function *EntryFn = Module->getFunction(\"main\");\n return EE->runFunctionAsMain(EntryFn, CmdLine, 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 MongoDB Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n\n#include <cstddef>\n#include <cstdint>\n\n#include <bsoncxx\/stdx\/string_view.hpp>\n\n#include <bsoncxx\/config\/prelude.hpp>\n\nnamespace bsoncxx {\nBSONCXX_INLINE_NAMESPACE_BEGIN\n\nenum class type : std::uint8_t;\nenum class binary_sub_type : std::uint8_t;\n\nnamespace types {\nstruct b_eod;\nstruct b_double;\nstruct b_utf8;\nstruct b_document;\nstruct b_array;\nstruct b_binary;\nstruct b_undefined;\nstruct b_oid;\nstruct b_bool;\nstruct b_date;\nstruct b_null;\nstruct b_regex;\nstruct b_dbpointer;\nstruct b_code;\nstruct b_symbol;\nstruct b_codewscope;\nstruct b_int32;\nstruct b_timestamp;\nstruct b_int64;\nstruct b_decimal128;\nstruct b_minkey;\nstruct b_maxkey;\nclass value;\n} \/\/ namespace types\n\nnamespace array {\nclass element;\n} \/\/ namespace array\n\nnamespace document {\n\n\/\/\/\n\/\/\/ A variant view type that accesses values in serialized BSON documents.\n\/\/\/\n\/\/\/ Element functions as a variant type, where the kind of the element can be\n\/\/\/ interrogated by calling type(), the key can be extracted by calling key() and\n\/\/\/ a specific value can be extracted through get_X() accessors.\n\/\/\/\n\/\/\/ @relatesalso array::element\n\/\/\/\nclass BSONCXX_API element {\n public:\n \/\/\/\n \/\/\/ Construct an invalid element.\n \/\/\/\n \/\/\/ This is useful when mapping the end iterator of a document or array\n \/\/\/ view.\n \/\/\/\n element();\n\n \/\/\/\n \/\/\/ Conversion operator to bool which is true for valid elements.\n \/\/\/\n explicit operator bool() const;\n\n \/\/\/\n \/\/\/ Getter for the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return a pointer to the raw bson bytes.\n \/\/\/\n const std::uint8_t* raw() const;\n\n \/\/\/\n \/\/\/ Getter for length of the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return a pointer to the length of the raw bson bytes.\n \/\/\/\n std::uint32_t length() const;\n\n \/\/\/\n \/\/\/ Getter for the offset into the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return the offset into the raw bson bytes.\n \/\/\/\n std::uint32_t offset() const;\n\n \/\/\/\n \/\/\/ Getter for the type of the element.\n \/\/\/\n \/\/\/ @return the element's type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is invalid.\n \/\/\/\n bsoncxx::type type() const;\n\n \/\/\/\n \/\/\/ Getter for the element's key.\n \/\/\/\n \/\/\/ @return the element's key.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is invalid.\n \/\/\/\n stdx::string_view key() const;\n\n \/\/\/\n \/\/\/ Getter for the element's key length.\n \/\/\/\n \/\/\/ @return the element's key length.\n \/\/\/\n std::uint32_t keylen() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_double type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_double.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_double get_double() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_utf8 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_utf8.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_utf8 get_utf8() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_document type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_document.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_document get_document() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_array type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_array.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_array get_array() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_binary type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_binary.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_binary get_binary() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_undefined type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_undefined.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_undefined get_undefined() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_oid type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_oid.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_oid get_oid() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_bool type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_bool.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_bool get_bool() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_date type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_date.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_date get_date() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_null type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_null.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_null get_null() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_regex type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_regex.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_regex get_regex() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_dbpointer type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_dbpointer.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_dbpointer get_dbpointer() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_code type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_code.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_code get_code() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_symbol type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_symbol.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_symbol get_symbol() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_codewscope type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_codewscope.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_codewscope get_codewscope() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_int32 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_int32.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_int32 get_int32() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_timestamp type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_timestamp.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_timestamp get_timestamp() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_int64 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_int64.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_int64 get_int64() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_decimal128 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_decimal128.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_decimal128 get_decimal128() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_minkey type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_minkey.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_minkey get_minkey() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_maxkey type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_maxkey.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_maxkey get_maxkey() const;\n\n \/\/\/\n \/\/\/ Getter for a types::value variant wrapper of the value portion of the\n \/\/\/ element.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::value get_value() const;\n\n \/\/\/\n \/\/\/ If this element is a document, finds the first element of the document\n \/\/\/ with the provided key. If there is no such element, an invalid\n \/\/\/ document::element will be returned. The runtime of operator[] is\n \/\/\/ linear in the length of the document.\n \/\/\/\n \/\/\/ If this element is not a document, an invalid document::element will\n \/\/\/ be returned.\n \/\/\/\n \/\/\/ @param key\n \/\/\/ The key to search for.\n \/\/\/\n \/\/\/ @return The matching element, if found, or an invalid element.\n \/\/\/\n element operator[](stdx::string_view key) const;\n\n \/\/\/\n \/\/\/ If this element is an array, indexes into this BSON array. If the\n \/\/\/ index is out-of-bounds, an invalid array::element will be returned. As\n \/\/\/ BSON represents arrays as documents, the runtime of operator[] is\n \/\/\/ linear in the length of the array.\n \/\/\/\n \/\/\/ If this element is not an array, an invalid array::element will\n \/\/\/ be returned.\n \/\/\/\n \/\/\/ @param i\n \/\/\/ The index of the element.\n \/\/\/\n \/\/\/ @return The element if it exists, or an invalid element.\n \/\/\/\n array::element operator[](std::uint32_t i) const;\n\n private:\n \/\/\/\n \/\/\/ Construct an element as an offset into a buffer of bson bytes.\n \/\/\/\n \/\/\/ @param raw\n \/\/\/ A pointer to the raw bson bytes.\n \/\/\/\n \/\/\/ @param length\n \/\/\/ The size of the bson buffer.\n \/\/\/\n \/\/\/ @param offset\n \/\/\/ The element's offset into the buffer.\n \/\/\/\n BSONCXX_PRIVATE explicit element(const std::uint8_t* raw,\n std::uint32_t length,\n std::uint32_t offset,\n std::uint32_t keylen);\n\n friend class view;\n friend class array::element;\n\n const std::uint8_t* _raw;\n std::uint32_t _length;\n std::uint32_t _offset;\n std::uint32_t _keylen;\n};\n\n} \/\/ namespace document\n\nBSONCXX_INLINE_NAMESPACE_END\n} \/\/ namespace bsoncxx\n\n#include <bsoncxx\/config\/postlude.hpp>\n<commit_msg>CXX-1666 Improve comment on element::bool()<commit_after>\/\/ Copyright 2014 MongoDB Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n\n#include <cstddef>\n#include <cstdint>\n\n#include <bsoncxx\/stdx\/string_view.hpp>\n\n#include <bsoncxx\/config\/prelude.hpp>\n\nnamespace bsoncxx {\nBSONCXX_INLINE_NAMESPACE_BEGIN\n\nenum class type : std::uint8_t;\nenum class binary_sub_type : std::uint8_t;\n\nnamespace types {\nstruct b_eod;\nstruct b_double;\nstruct b_utf8;\nstruct b_document;\nstruct b_array;\nstruct b_binary;\nstruct b_undefined;\nstruct b_oid;\nstruct b_bool;\nstruct b_date;\nstruct b_null;\nstruct b_regex;\nstruct b_dbpointer;\nstruct b_code;\nstruct b_symbol;\nstruct b_codewscope;\nstruct b_int32;\nstruct b_timestamp;\nstruct b_int64;\nstruct b_decimal128;\nstruct b_minkey;\nstruct b_maxkey;\nclass value;\n} \/\/ namespace types\n\nnamespace array {\nclass element;\n} \/\/ namespace array\n\nnamespace document {\n\n\/\/\/\n\/\/\/ A variant view type that accesses values in serialized BSON documents.\n\/\/\/\n\/\/\/ Element functions as a variant type, where the kind of the element can be\n\/\/\/ interrogated by calling type(), the key can be extracted by calling key() and\n\/\/\/ a specific value can be extracted through get_X() accessors.\n\/\/\/\n\/\/\/ @relatesalso array::element\n\/\/\/\nclass BSONCXX_API element {\n public:\n \/\/\/\n \/\/\/ Construct an invalid element.\n \/\/\/\n \/\/\/ This is useful when mapping the end iterator of a document or array\n \/\/\/ view.\n \/\/\/\n element();\n\n \/\/\/\n \/\/\/ Conversion operator to bool which is true for valid elements\n \/\/\/ and false for invalid elements.\n \/\/\/\n explicit operator bool() const;\n\n \/\/\/\n \/\/\/ Getter for the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return a pointer to the raw bson bytes.\n \/\/\/\n const std::uint8_t* raw() const;\n\n \/\/\/\n \/\/\/ Getter for length of the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return a pointer to the length of the raw bson bytes.\n \/\/\/\n std::uint32_t length() const;\n\n \/\/\/\n \/\/\/ Getter for the offset into the raw bson bytes the element points to.\n \/\/\/\n \/\/\/ @return the offset into the raw bson bytes.\n \/\/\/\n std::uint32_t offset() const;\n\n \/\/\/\n \/\/\/ Getter for the type of the element.\n \/\/\/\n \/\/\/ @return the element's type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is invalid.\n \/\/\/\n bsoncxx::type type() const;\n\n \/\/\/\n \/\/\/ Getter for the element's key.\n \/\/\/\n \/\/\/ @return the element's key.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is invalid.\n \/\/\/\n stdx::string_view key() const;\n\n \/\/\/\n \/\/\/ Getter for the element's key length.\n \/\/\/\n \/\/\/ @return the element's key length.\n \/\/\/\n std::uint32_t keylen() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_double type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_double.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_double get_double() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_utf8 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_utf8.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_utf8 get_utf8() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_document type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_document.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_document get_document() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_array type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_array.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_array get_array() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_binary type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_binary.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_binary get_binary() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_undefined type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_undefined.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_undefined get_undefined() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_oid type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_oid.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_oid get_oid() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_bool type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_bool.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_bool get_bool() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_date type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_date.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_date get_date() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_null type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_null.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_null get_null() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_regex type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_regex.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_regex get_regex() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_dbpointer type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_dbpointer.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_dbpointer get_dbpointer() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_code type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_code.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_code get_code() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_symbol type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_symbol.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_symbol get_symbol() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_codewscope type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_codewscope.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_codewscope get_codewscope() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_int32 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_int32.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_int32 get_int32() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_timestamp type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_timestamp.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_timestamp get_timestamp() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_int64 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_int64.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_int64 get_int64() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_decimal128 type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_decimal128.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_decimal128 get_decimal128() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_minkey type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_minkey.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_minkey get_minkey() const;\n\n \/\/\/\n \/\/\/ Getter for elements of the b_maxkey type.\n \/\/\/\n \/\/\/ @throws bsoncxx::exception if this element is not a b_maxkey.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::b_maxkey get_maxkey() const;\n\n \/\/\/\n \/\/\/ Getter for a types::value variant wrapper of the value portion of the\n \/\/\/ element.\n \/\/\/\n \/\/\/ @return the element's value.\n \/\/\/\n types::value get_value() const;\n\n \/\/\/\n \/\/\/ If this element is a document, finds the first element of the document\n \/\/\/ with the provided key. If there is no such element, an invalid\n \/\/\/ document::element will be returned. The runtime of operator[] is\n \/\/\/ linear in the length of the document.\n \/\/\/\n \/\/\/ If this element is not a document, an invalid document::element will\n \/\/\/ be returned.\n \/\/\/\n \/\/\/ @param key\n \/\/\/ The key to search for.\n \/\/\/\n \/\/\/ @return The matching element, if found, or an invalid element.\n \/\/\/\n element operator[](stdx::string_view key) const;\n\n \/\/\/\n \/\/\/ If this element is an array, indexes into this BSON array. If the\n \/\/\/ index is out-of-bounds, an invalid array::element will be returned. As\n \/\/\/ BSON represents arrays as documents, the runtime of operator[] is\n \/\/\/ linear in the length of the array.\n \/\/\/\n \/\/\/ If this element is not an array, an invalid array::element will\n \/\/\/ be returned.\n \/\/\/\n \/\/\/ @param i\n \/\/\/ The index of the element.\n \/\/\/\n \/\/\/ @return The element if it exists, or an invalid element.\n \/\/\/\n array::element operator[](std::uint32_t i) const;\n\n private:\n \/\/\/\n \/\/\/ Construct an element as an offset into a buffer of bson bytes.\n \/\/\/\n \/\/\/ @param raw\n \/\/\/ A pointer to the raw bson bytes.\n \/\/\/\n \/\/\/ @param length\n \/\/\/ The size of the bson buffer.\n \/\/\/\n \/\/\/ @param offset\n \/\/\/ The element's offset into the buffer.\n \/\/\/\n BSONCXX_PRIVATE explicit element(const std::uint8_t* raw,\n std::uint32_t length,\n std::uint32_t offset,\n std::uint32_t keylen);\n\n friend class view;\n friend class array::element;\n\n const std::uint8_t* _raw;\n std::uint32_t _length;\n std::uint32_t _offset;\n std::uint32_t _keylen;\n};\n\n} \/\/ namespace document\n\nBSONCXX_INLINE_NAMESPACE_END\n} \/\/ namespace bsoncxx\n\n#include <bsoncxx\/config\/postlude.hpp>\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xmlscript.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: vg $ $Date: 2003-04-17 15:08:51 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#include <hintids.hxx>\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DOCUMENT_XDOCUMENTINFOSUPPLIER_HPP_\n#include <com\/sun\/star\/document\/XDocumentInfoSupplier.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include <xmloff\/xmlnmspe.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLMETAI_HXX\n#include <xmloff\/xmlscripti.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLMETAE_HXX\n#include <xmloff\/xmlscripte.hxx>\n#endif\n\n#ifndef _SVX_LANGITEM_HXX\n#include <svx\/langitem.hxx>\n#endif\n\n#ifndef _SWDOCSH_HXX\n#include \"docsh.hxx\"\n#endif\n#ifndef _DOC_HXX \/\/autogen wg. SwDoc\n#include <doc.hxx>\n#endif\n\n#ifndef _XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n\/\/ ---------------------------------------------------------------------\n\nSvXMLImportContext *SwXMLImport::CreateScriptContext(\n const OUString& rLocalName )\n{\n SvXMLImportContext *pContext = 0;\n\n if( !(IsStylesOnlyMode() || IsInsertMode()) )\n {\n pContext = new XMLScriptContext( *this,\n XML_NAMESPACE_OFFICE, rLocalName,\n GetModel() );\n }\n\n if( !pContext )\n pContext = new SvXMLImportContext( *this, XML_NAMESPACE_OFFICE,\n rLocalName );\n\n return pContext;\n}\n\n<commit_msg>INTEGRATION: CWS oasisbf1 (1.3.638); FILE MERGED 2004\/08\/18 15:32:50 mib 1.3.638.1: #i32616#: document events were not saved<commit_after>\/*************************************************************************\n *\n * $RCSfile: xmlscript.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: hr $ $Date: 2004-11-09 12:36:36 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#include <hintids.hxx>\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DOCUMENT_XDOCUMENTINFOSUPPLIER_HPP_\n#include <com\/sun\/star\/document\/XDocumentInfoSupplier.hpp>\n#endif\n\n#ifndef _XMLOFF_XMLNMSPE_HXX\n#include <xmloff\/xmlnmspe.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLMETAI_HXX\n#include <xmloff\/xmlscripti.hxx>\n#endif\n\n#ifndef _SVX_LANGITEM_HXX\n#include <svx\/langitem.hxx>\n#endif\n\n#ifndef _SWDOCSH_HXX\n#include \"docsh.hxx\"\n#endif\n#ifndef _DOC_HXX \/\/autogen wg. SwDoc\n#include <doc.hxx>\n#endif\n\n#ifndef _XMLIMP_HXX\n#include \"xmlimp.hxx\"\n#endif\n#ifndef _XMLEXP_HXX\n#include \"xmlexp.hxx\"\n#endif\n\nusing namespace ::rtl;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\n\n\/\/ ---------------------------------------------------------------------\n\nSvXMLImportContext *SwXMLImport::CreateScriptContext(\n const OUString& rLocalName )\n{\n SvXMLImportContext *pContext = 0;\n\n if( !(IsStylesOnlyMode() || IsInsertMode()) )\n {\n pContext = new XMLScriptContext( *this,\n XML_NAMESPACE_OFFICE, rLocalName,\n GetModel() );\n }\n\n if( !pContext )\n pContext = new SvXMLImportContext( *this, XML_NAMESPACE_OFFICE,\n rLocalName );\n\n return pContext;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>INTEGRATION: CWS swwarnings (1.17.118); FILE MERGED 2007\/06\/01 07:17:42 tl 1.17.118.6: #i69287# warning-free code 2007\/05\/29 12:18:49 os 1.17.118.5: RESYNC: (1.17-1.18); FILE MERGED 2007\/04\/18 08:26:39 tl 1.17.118.4: #i69287# warning-free code 2007\/04\/13 11:15:25 tl 1.17.118.3: #i69287# warning-free code 2007\/03\/26 12:08:53 tl 1.17.118.2: #i69287# warning-free code 2007\/02\/26 15:59:12 os 1.17.118.1: #i69287# warnings removed<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/===- SubtargetFeature.cpp - CPU characteristics Implementation ----------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the SubtargetFeature interface.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/MC\/SubtargetFeature.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdlib>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Static Helper Functions\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ hasFlag - Determine if a feature has a flag; '+' or '-'\n\/\/\/\nstatic inline bool hasFlag(StringRef Feature) {\n assert(!Feature.empty() && \"Empty string\");\n \/\/ Get first character\n char Ch = Feature[0];\n \/\/ Check if first character is '+' or '-' flag\n return Ch == '+' || Ch =='-';\n}\n\n\/\/\/ StripFlag - Return string stripped of flag.\n\/\/\/\nstatic inline std::string StripFlag(StringRef Feature) {\n return hasFlag(Feature) ? Feature.substr(1) : Feature;\n}\n\n\/\/\/ isEnabled - Return true if enable flag; '+'.\n\/\/\/\nstatic inline bool isEnabled(StringRef Feature) {\n assert(!Feature.empty() && \"Empty string\");\n \/\/ Get first character\n char Ch = Feature[0];\n \/\/ Check if first character is '+' for enabled\n return Ch == '+';\n}\n\n\/\/\/ Split - Splits a string of comma separated items in to a vector of strings.\n\/\/\/\nstatic void Split(std::vector<std::string> &V, StringRef S) {\n SmallVector<StringRef, 3> Tmp;\n S.split(Tmp, \",\", -1, false \/* KeepEmpty *\/);\n V.assign(Tmp.begin(), Tmp.end());\n}\n\n\/\/\/ Join a vector of strings to a string with a comma separating each element.\n\/\/\/\nstatic std::string Join(const std::vector<std::string> &V) {\n \/\/ Start with empty string.\n std::string Result;\n \/\/ If the vector is not empty\n if (!V.empty()) {\n \/\/ Start with the first feature\n Result = V[0];\n \/\/ For each successive feature\n for (size_t i = 1; i < V.size(); i++) {\n \/\/ Add a comma\n Result += \",\";\n \/\/ Add the feature\n Result += V[i];\n }\n }\n \/\/ Return the features string\n return Result;\n}\n\n\/\/\/ Adding features.\nvoid SubtargetFeatures::AddFeature(StringRef String, bool Enable) {\n \/\/ Don't add empty features.\n if (!String.empty())\n \/\/ Convert to lowercase, prepend flag if we don't already have a flag.\n Features.push_back(hasFlag(String) ? String.lower()\n : (Enable ? \"+\" : \"-\") + String.lower());\n}\n\n\/\/\/ Find KV in array using binary search.\nstatic const SubtargetFeatureKV *Find(StringRef S,\n ArrayRef<SubtargetFeatureKV> A) {\n \/\/ Binary search the array\n auto F = std::lower_bound(A.begin(), A.end(), S);\n \/\/ If not found then return NULL\n if (F == A.end() || StringRef(F->Key) != S) return nullptr;\n \/\/ Return the found array item\n return F;\n}\n\n\/\/\/ getLongestEntryLength - Return the length of the longest entry in the table.\n\/\/\/\nstatic size_t getLongestEntryLength(ArrayRef<SubtargetFeatureKV> Table) {\n size_t MaxLen = 0;\n for (auto &I : Table)\n MaxLen = std::max(MaxLen, std::strlen(I.Key));\n return MaxLen;\n}\n\n\/\/\/ Display help for feature choices.\n\/\/\/\nstatic void Help(ArrayRef<SubtargetFeatureKV> CPUTable,\n ArrayRef<SubtargetFeatureKV> FeatTable) {\n \/\/ Determine the length of the longest CPU and Feature entries.\n unsigned MaxCPULen = getLongestEntryLength(CPUTable);\n unsigned MaxFeatLen = getLongestEntryLength(FeatTable);\n\n \/\/ Print the CPU table.\n errs() << \"Available CPUs for this target:\\n\\n\";\n for (auto &CPU : CPUTable)\n errs() << format(\" %-*s - %s.\\n\", MaxCPULen, CPU.Key, CPU.Desc);\n errs() << '\\n';\n\n \/\/ Print the Feature table.\n errs() << \"Available features for this target:\\n\\n\";\n for (auto &Feature : FeatTable)\n errs() << format(\" %-*s - %s.\\n\", MaxFeatLen, Feature.Key, Feature.Desc);\n errs() << '\\n';\n\n errs() << \"Use +feature to enable a feature, or -feature to disable it.\\n\"\n \"For example, llc -mcpu=mycpu -mattr=+feature1,-feature2\\n\";\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ SubtargetFeatures Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nSubtargetFeatures::SubtargetFeatures(StringRef Initial) {\n \/\/ Break up string into separate features\n Split(Features, Initial);\n}\n\n\nstd::string SubtargetFeatures::getString() const {\n return Join(Features);\n}\n\n\/\/\/ SetImpliedBits - For each feature that is (transitively) implied by this\n\/\/\/ feature, set it.\n\/\/\/\nstatic\nvoid SetImpliedBits(FeatureBitset &Bits, const SubtargetFeatureKV *FeatureEntry,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n for (auto &FE : FeatureTable) {\n if (FeatureEntry->Value == FE.Value) continue;\n\n if ((FeatureEntry->Implies & FE.Value).any()) {\n Bits |= FE.Value;\n SetImpliedBits(Bits, &FE, FeatureTable);\n }\n }\n}\n\n\/\/\/ ClearImpliedBits - For each feature that (transitively) implies this\n\/\/\/ feature, clear it.\n\/\/\/\nstatic\nvoid ClearImpliedBits(FeatureBitset &Bits, \n const SubtargetFeatureKV *FeatureEntry,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n for (auto &FE : FeatureTable) {\n if (FeatureEntry->Value == FE.Value) continue;\n\n if ((FE.Implies & FeatureEntry->Value).any()) {\n Bits &= ~FE.Value;\n ClearImpliedBits(Bits, &FE, FeatureTable);\n }\n }\n}\n\n\/\/\/ ToggleFeature - Toggle a feature and returns the newly updated feature\n\/\/\/ bits.\nFeatureBitset\nSubtargetFeatures::ToggleFeature(FeatureBitset Bits, StringRef Feature,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n\n \/\/ Find feature in table.\n const SubtargetFeatureKV *FeatureEntry =\n Find(StripFlag(Feature), FeatureTable);\n \/\/ If there is a match\n if (FeatureEntry) {\n if ((Bits & FeatureEntry->Value) == FeatureEntry->Value) {\n Bits &= ~FeatureEntry->Value;\n \/\/ For each feature that implies this, clear it.\n ClearImpliedBits(Bits, FeatureEntry, FeatureTable);\n } else {\n Bits |= FeatureEntry->Value;\n\n \/\/ For each feature that this implies, set it.\n SetImpliedBits(Bits, FeatureEntry, FeatureTable);\n }\n } else {\n errs() << \"'\" << Feature\n << \"' is not a recognized feature for this target\"\n << \" (ignoring feature)\\n\";\n }\n\n return Bits;\n}\n\n\n\/\/\/ getFeatureBits - Get feature bits a CPU.\n\/\/\/\nFeatureBitset\nSubtargetFeatures::getFeatureBits(StringRef CPU,\n ArrayRef<SubtargetFeatureKV> CPUTable,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n\n if (CPUTable.empty() || FeatureTable.empty())\n return FeatureBitset();\n\n#ifndef NDEBUG\n for (size_t i = 1, e = CPUTable.size(); i != e; ++i) {\n assert(strcmp(CPUTable[i - 1].Key, CPUTable[i].Key) < 0 &&\n \"CPU table is not sorted\");\n }\n for (size_t i = 1, e = FeatureTable.size(); i != e; ++i) {\n assert(strcmp(FeatureTable[i - 1].Key, FeatureTable[i].Key) < 0 &&\n \"CPU features table is not sorted\");\n }\n#endif\n \/\/ Resulting bits\n FeatureBitset Bits;\n\n \/\/ Check if help is needed\n if (CPU == \"help\")\n Help(CPUTable, FeatureTable);\n\n \/\/ Find CPU entry if CPU name is specified.\n else if (!CPU.empty()) {\n const SubtargetFeatureKV *CPUEntry = Find(CPU, CPUTable);\n\n \/\/ If there is a match\n if (CPUEntry) {\n \/\/ Set base feature bits\n Bits = CPUEntry->Value;\n\n \/\/ Set the feature implied by this CPU feature, if any.\n for (auto &FE : FeatureTable) {\n if ((CPUEntry->Value & FE.Value).any())\n SetImpliedBits(Bits, &FE, FeatureTable);\n }\n } else {\n errs() << \"'\" << CPU\n << \"' is not a recognized processor for this target\"\n << \" (ignoring processor)\\n\";\n }\n }\n\n \/\/ Iterate through each feature\n for (auto &Feature : Features) {\n \/\/ Check for help\n if (Feature == \"+help\")\n Help(CPUTable, FeatureTable);\n\n \/\/ Find feature in table.\n const SubtargetFeatureKV *FeatureEntry =\n Find(StripFlag(Feature), FeatureTable);\n \/\/ If there is a match\n if (FeatureEntry) {\n \/\/ Enable\/disable feature in bits\n if (isEnabled(Feature)) {\n Bits |= FeatureEntry->Value;\n\n \/\/ For each feature that this implies, set it.\n SetImpliedBits(Bits, FeatureEntry, FeatureTable);\n } else {\n Bits &= ~FeatureEntry->Value;\n\n \/\/ For each feature that implies this, clear it.\n ClearImpliedBits(Bits, FeatureEntry, FeatureTable);\n }\n } else {\n errs() << \"'\" << Feature\n << \"' is not a recognized feature for this target\"\n << \" (ignoring feature)\\n\";\n }\n }\n\n return Bits;\n}\n\n\/\/\/ print - Print feature string.\n\/\/\/\nvoid SubtargetFeatures::print(raw_ostream &OS) const {\n for (auto &F : Features)\n OS << F << \" \";\n OS << \"\\n\";\n}\n\n#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)\n\/\/\/ dump - Dump feature info.\n\/\/\/\nvoid SubtargetFeatures::dump() const {\n print(dbgs());\n}\n#endif\n\n\/\/\/ Adds the default features for the specified target triple.\n\/\/\/\n\/\/\/ FIXME: This is an inelegant way of specifying the features of a\n\/\/\/ subtarget. It would be better if we could encode this information\n\/\/\/ into the IR. See <rdar:\/\/5972456>.\n\/\/\/\nvoid SubtargetFeatures::getDefaultSubtargetFeatures(const Triple& Triple) {\n if (Triple.getVendor() == Triple::Apple) {\n if (Triple.getArch() == Triple::ppc) {\n \/\/ powerpc-apple-*\n AddFeature(\"altivec\");\n } else if (Triple.getArch() == Triple::ppc64) {\n \/\/ powerpc64-apple-*\n AddFeature(\"64bit\");\n AddFeature(\"altivec\");\n }\n }\n}\n<commit_msg>[MC] Replace custom string join function with the one from StringExtras.<commit_after>\/\/===- SubtargetFeature.cpp - CPU characteristics Implementation ----------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the SubtargetFeature interface.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/MC\/SubtargetFeature.h\"\n#include \"llvm\/ADT\/StringExtras.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cstdlib>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Static Helper Functions\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/\/ hasFlag - Determine if a feature has a flag; '+' or '-'\n\/\/\/\nstatic inline bool hasFlag(StringRef Feature) {\n assert(!Feature.empty() && \"Empty string\");\n \/\/ Get first character\n char Ch = Feature[0];\n \/\/ Check if first character is '+' or '-' flag\n return Ch == '+' || Ch =='-';\n}\n\n\/\/\/ StripFlag - Return string stripped of flag.\n\/\/\/\nstatic inline std::string StripFlag(StringRef Feature) {\n return hasFlag(Feature) ? Feature.substr(1) : Feature;\n}\n\n\/\/\/ isEnabled - Return true if enable flag; '+'.\n\/\/\/\nstatic inline bool isEnabled(StringRef Feature) {\n assert(!Feature.empty() && \"Empty string\");\n \/\/ Get first character\n char Ch = Feature[0];\n \/\/ Check if first character is '+' for enabled\n return Ch == '+';\n}\n\n\/\/\/ Split - Splits a string of comma separated items in to a vector of strings.\n\/\/\/\nstatic void Split(std::vector<std::string> &V, StringRef S) {\n SmallVector<StringRef, 3> Tmp;\n S.split(Tmp, \",\", -1, false \/* KeepEmpty *\/);\n V.assign(Tmp.begin(), Tmp.end());\n}\n\n\/\/\/ Adding features.\nvoid SubtargetFeatures::AddFeature(StringRef String, bool Enable) {\n \/\/ Don't add empty features.\n if (!String.empty())\n \/\/ Convert to lowercase, prepend flag if we don't already have a flag.\n Features.push_back(hasFlag(String) ? String.lower()\n : (Enable ? \"+\" : \"-\") + String.lower());\n}\n\n\/\/\/ Find KV in array using binary search.\nstatic const SubtargetFeatureKV *Find(StringRef S,\n ArrayRef<SubtargetFeatureKV> A) {\n \/\/ Binary search the array\n auto F = std::lower_bound(A.begin(), A.end(), S);\n \/\/ If not found then return NULL\n if (F == A.end() || StringRef(F->Key) != S) return nullptr;\n \/\/ Return the found array item\n return F;\n}\n\n\/\/\/ getLongestEntryLength - Return the length of the longest entry in the table.\n\/\/\/\nstatic size_t getLongestEntryLength(ArrayRef<SubtargetFeatureKV> Table) {\n size_t MaxLen = 0;\n for (auto &I : Table)\n MaxLen = std::max(MaxLen, std::strlen(I.Key));\n return MaxLen;\n}\n\n\/\/\/ Display help for feature choices.\n\/\/\/\nstatic void Help(ArrayRef<SubtargetFeatureKV> CPUTable,\n ArrayRef<SubtargetFeatureKV> FeatTable) {\n \/\/ Determine the length of the longest CPU and Feature entries.\n unsigned MaxCPULen = getLongestEntryLength(CPUTable);\n unsigned MaxFeatLen = getLongestEntryLength(FeatTable);\n\n \/\/ Print the CPU table.\n errs() << \"Available CPUs for this target:\\n\\n\";\n for (auto &CPU : CPUTable)\n errs() << format(\" %-*s - %s.\\n\", MaxCPULen, CPU.Key, CPU.Desc);\n errs() << '\\n';\n\n \/\/ Print the Feature table.\n errs() << \"Available features for this target:\\n\\n\";\n for (auto &Feature : FeatTable)\n errs() << format(\" %-*s - %s.\\n\", MaxFeatLen, Feature.Key, Feature.Desc);\n errs() << '\\n';\n\n errs() << \"Use +feature to enable a feature, or -feature to disable it.\\n\"\n \"For example, llc -mcpu=mycpu -mattr=+feature1,-feature2\\n\";\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ SubtargetFeatures Implementation\n\/\/===----------------------------------------------------------------------===\/\/\n\nSubtargetFeatures::SubtargetFeatures(StringRef Initial) {\n \/\/ Break up string into separate features\n Split(Features, Initial);\n}\n\n\nstd::string SubtargetFeatures::getString() const {\n return join(Features.begin(), Features.end(), \",\");\n}\n\n\/\/\/ SetImpliedBits - For each feature that is (transitively) implied by this\n\/\/\/ feature, set it.\n\/\/\/\nstatic\nvoid SetImpliedBits(FeatureBitset &Bits, const SubtargetFeatureKV *FeatureEntry,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n for (auto &FE : FeatureTable) {\n if (FeatureEntry->Value == FE.Value) continue;\n\n if ((FeatureEntry->Implies & FE.Value).any()) {\n Bits |= FE.Value;\n SetImpliedBits(Bits, &FE, FeatureTable);\n }\n }\n}\n\n\/\/\/ ClearImpliedBits - For each feature that (transitively) implies this\n\/\/\/ feature, clear it.\n\/\/\/\nstatic\nvoid ClearImpliedBits(FeatureBitset &Bits, \n const SubtargetFeatureKV *FeatureEntry,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n for (auto &FE : FeatureTable) {\n if (FeatureEntry->Value == FE.Value) continue;\n\n if ((FE.Implies & FeatureEntry->Value).any()) {\n Bits &= ~FE.Value;\n ClearImpliedBits(Bits, &FE, FeatureTable);\n }\n }\n}\n\n\/\/\/ ToggleFeature - Toggle a feature and returns the newly updated feature\n\/\/\/ bits.\nFeatureBitset\nSubtargetFeatures::ToggleFeature(FeatureBitset Bits, StringRef Feature,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n\n \/\/ Find feature in table.\n const SubtargetFeatureKV *FeatureEntry =\n Find(StripFlag(Feature), FeatureTable);\n \/\/ If there is a match\n if (FeatureEntry) {\n if ((Bits & FeatureEntry->Value) == FeatureEntry->Value) {\n Bits &= ~FeatureEntry->Value;\n \/\/ For each feature that implies this, clear it.\n ClearImpliedBits(Bits, FeatureEntry, FeatureTable);\n } else {\n Bits |= FeatureEntry->Value;\n\n \/\/ For each feature that this implies, set it.\n SetImpliedBits(Bits, FeatureEntry, FeatureTable);\n }\n } else {\n errs() << \"'\" << Feature\n << \"' is not a recognized feature for this target\"\n << \" (ignoring feature)\\n\";\n }\n\n return Bits;\n}\n\n\n\/\/\/ getFeatureBits - Get feature bits a CPU.\n\/\/\/\nFeatureBitset\nSubtargetFeatures::getFeatureBits(StringRef CPU,\n ArrayRef<SubtargetFeatureKV> CPUTable,\n ArrayRef<SubtargetFeatureKV> FeatureTable) {\n\n if (CPUTable.empty() || FeatureTable.empty())\n return FeatureBitset();\n\n#ifndef NDEBUG\n for (size_t i = 1, e = CPUTable.size(); i != e; ++i) {\n assert(strcmp(CPUTable[i - 1].Key, CPUTable[i].Key) < 0 &&\n \"CPU table is not sorted\");\n }\n for (size_t i = 1, e = FeatureTable.size(); i != e; ++i) {\n assert(strcmp(FeatureTable[i - 1].Key, FeatureTable[i].Key) < 0 &&\n \"CPU features table is not sorted\");\n }\n#endif\n \/\/ Resulting bits\n FeatureBitset Bits;\n\n \/\/ Check if help is needed\n if (CPU == \"help\")\n Help(CPUTable, FeatureTable);\n\n \/\/ Find CPU entry if CPU name is specified.\n else if (!CPU.empty()) {\n const SubtargetFeatureKV *CPUEntry = Find(CPU, CPUTable);\n\n \/\/ If there is a match\n if (CPUEntry) {\n \/\/ Set base feature bits\n Bits = CPUEntry->Value;\n\n \/\/ Set the feature implied by this CPU feature, if any.\n for (auto &FE : FeatureTable) {\n if ((CPUEntry->Value & FE.Value).any())\n SetImpliedBits(Bits, &FE, FeatureTable);\n }\n } else {\n errs() << \"'\" << CPU\n << \"' is not a recognized processor for this target\"\n << \" (ignoring processor)\\n\";\n }\n }\n\n \/\/ Iterate through each feature\n for (auto &Feature : Features) {\n \/\/ Check for help\n if (Feature == \"+help\")\n Help(CPUTable, FeatureTable);\n\n \/\/ Find feature in table.\n const SubtargetFeatureKV *FeatureEntry =\n Find(StripFlag(Feature), FeatureTable);\n \/\/ If there is a match\n if (FeatureEntry) {\n \/\/ Enable\/disable feature in bits\n if (isEnabled(Feature)) {\n Bits |= FeatureEntry->Value;\n\n \/\/ For each feature that this implies, set it.\n SetImpliedBits(Bits, FeatureEntry, FeatureTable);\n } else {\n Bits &= ~FeatureEntry->Value;\n\n \/\/ For each feature that implies this, clear it.\n ClearImpliedBits(Bits, FeatureEntry, FeatureTable);\n }\n } else {\n errs() << \"'\" << Feature\n << \"' is not a recognized feature for this target\"\n << \" (ignoring feature)\\n\";\n }\n }\n\n return Bits;\n}\n\n\/\/\/ print - Print feature string.\n\/\/\/\nvoid SubtargetFeatures::print(raw_ostream &OS) const {\n for (auto &F : Features)\n OS << F << \" \";\n OS << \"\\n\";\n}\n\n#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)\n\/\/\/ dump - Dump feature info.\n\/\/\/\nvoid SubtargetFeatures::dump() const {\n print(dbgs());\n}\n#endif\n\n\/\/\/ Adds the default features for the specified target triple.\n\/\/\/\n\/\/\/ FIXME: This is an inelegant way of specifying the features of a\n\/\/\/ subtarget. It would be better if we could encode this information\n\/\/\/ into the IR. See <rdar:\/\/5972456>.\n\/\/\/\nvoid SubtargetFeatures::getDefaultSubtargetFeatures(const Triple& Triple) {\n if (Triple.getVendor() == Triple::Apple) {\n if (Triple.getArch() == Triple::ppc) {\n \/\/ powerpc-apple-*\n AddFeature(\"altivec\");\n } else if (Triple.getArch() == Triple::ppc64) {\n \/\/ powerpc64-apple-*\n AddFeature(\"64bit\");\n AddFeature(\"altivec\");\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- ParseDecl.cpp - Swift Language Parser for #if directives -- ------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Conditional Compilation Block Parsing and AST Building\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Parse\/Parser.h\"\n#include \"swift\/Basic\/Defer.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/Version.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/SaveAndRestore.h\"\n\nusing namespace swift;\n\n\/\/\/ Parse and populate a list of #if\/#elseif\/#else\/#endif clauses.\n\/\/\/ Delegate callback function to parse elements in the blocks.\ntemplate <typename ElemTy, unsigned N>\nstatic ParserStatus parseIfConfig(\n Parser &P, SmallVectorImpl<IfConfigClause<ElemTy>> &Clauses,\n SourceLoc &EndLoc, bool HadMissingEnd,\n llvm::function_ref<void(SmallVectorImpl<ElemTy> &, bool)> parseElements) {\n Parser::StructureMarkerRAII ParsingDecl(\n P, P.Tok.getLoc(), Parser::StructureMarkerKind::IfConfig);\n\n bool foundActive = false;\n ConditionalCompilationExprState ConfigState;\n while (1) {\n bool isElse = P.Tok.is(tok::pound_else);\n SourceLoc ClauseLoc = P.consumeToken();\n Expr *Condition = nullptr;\n\n \/\/ Parse and evaluate the directive.\n if (isElse) {\n ConfigState.setConditionActive(!foundActive);\n } else {\n llvm::SaveAndRestore<bool> S(P.InPoundIfEnvironment, true);\n ParserResult<Expr> Result = P.parseExprSequence(diag::expected_expr,\n \/*isBasic*\/true,\n \/*isForDirective*\/true);\n if (Result.isNull())\n return makeParserError();\n\n Condition = Result.get();\n\n \/\/ Evaluate the condition, to validate it.\n ConfigState = P.classifyConditionalCompilationExpr(Condition, P.Context,\n P.Diags);\n if (foundActive)\n ConfigState.setConditionActive(false);\n }\n\n foundActive |= ConfigState.isConditionActive();\n\n if (!P.Tok.isAtStartOfLine() && P.Tok.isNot(tok::eof)) {\n P.diagnose(P.Tok.getLoc(),\n diag::extra_tokens_conditional_compilation_directive);\n }\n\n \/\/ Parse elements\n SmallVector<ElemTy, N> Elements;\n if (ConfigState.shouldParse()) {\n parseElements(Elements, ConfigState.isConditionActive());\n } else {\n DiagnosticTransaction DT(P.Diags);\n P.skipUntilConditionalBlockClose();\n DT.abort();\n }\n\n Clauses.push_back(IfConfigClause<ElemTy>(ClauseLoc, Condition,\n P.Context.AllocateCopy(Elements),\n ConfigState.isConditionActive()));\n\n if (P.Tok.isNot(tok::pound_elseif, tok::pound_else))\n break;\n\n if (isElse)\n P.diagnose(P.Tok, diag::expected_close_after_else_directive);\n }\n\n HadMissingEnd = P.parseEndIfDirective(EndLoc);\n return makeParserSuccess();\n}\n\nParserResult<IfConfigDecl> Parser::parseDeclIfConfig(ParseDeclOptions Flags) {\n SmallVector<IfConfigClause<Decl *>, 4> Clauses;\n SourceLoc EndLoc;\n bool HadMissingEnd = false;\n auto Status = parseIfConfig<Decl *, 8>(\n *this, Clauses, EndLoc, HadMissingEnd,\n [&](SmallVectorImpl<Decl *> &Decls, bool IsActive) {\n Optional<Scope> scope;\n if (!IsActive)\n scope.emplace(this, getScopeInfo().getCurrentScope()->getKind(),\n \/*inactiveConfigBlock=*\/true);\n\n ParserStatus Status;\n bool PreviousHadSemi = true;\n while (Tok.isNot(tok::pound_else, tok::pound_endif, tok::pound_elseif,\n tok::eof)) {\n if (Tok.is(tok::r_brace)) {\n diagnose(Tok.getLoc(),\n diag::unexpected_rbrace_in_conditional_compilation_block);\n \/\/ If we see '}', following declarations don't look like belong to\n \/\/ the current decl context; skip them.\n skipUntilConditionalBlockClose();\n break;\n }\n Status |= parseDeclItem(PreviousHadSemi, Flags,\n [&](Decl *D) {Decls.push_back(D);});\n }\n });\n if (Status.isError())\n return makeParserErrorResult<IfConfigDecl>();\n\n IfConfigDecl *ICD = new (Context) IfConfigDecl(CurDeclContext,\n Context.AllocateCopy(Clauses),\n EndLoc, HadMissingEnd);\n return makeParserResult(ICD);\n}\n\nParserResult<Stmt> Parser::parseStmtIfConfig(BraceItemListKind Kind) {\n SmallVector<IfConfigClause<ASTNode>, 4> Clauses;\n SourceLoc EndLoc;\n bool HadMissingEnd = false;\n auto Status = parseIfConfig<ASTNode, 16>(\n *this, Clauses, EndLoc, HadMissingEnd,\n [&](SmallVectorImpl<ASTNode> &Elements, bool IsActive) {\n parseBraceItems(Elements, Kind, IsActive\n ? BraceItemListKind::ActiveConditionalBlock\n : BraceItemListKind::InactiveConditionalBlock);\n });\n if (Status.isError())\n return makeParserErrorResult<Stmt>();\n\n auto *ICS = new (Context) IfConfigStmt(Context.AllocateCopy(Clauses),\n EndLoc, HadMissingEnd);\n return makeParserResult(ICS);\n}\n\n\/\/ Evaluate a subset of expression types suitable for build configuration\n\/\/ conditional expressions. The accepted expression types are:\n\/\/ - The magic constants \"true\" and \"false\".\n\/\/ - Named decl ref expressions (\"FOO\")\n\/\/ - Parenthesized expressions (\"(FOO)\")\n\/\/ - Binary \"&&\" or \"||\" operations applied to other build configuration\n\/\/ conditional expressions\n\/\/ - Unary \"!\" expressions applied to other build configuration conditional\n\/\/ expressions\n\/\/ - Single-argument call expressions, where the function being invoked is a\n\/\/ supported target configuration (currently \"os\", \"arch\", and\n\/\/ \"_compiler_version\"), and whose argument is a named decl ref expression\nConditionalCompilationExprState\nParser::classifyConditionalCompilationExpr(Expr *condition,\n ASTContext &Context,\n DiagnosticEngine &D) {\n assert(condition && \"Cannot classify a NULL condition expression!\");\n\n \/\/ Evaluate a ParenExpr.\n if (auto *PE = dyn_cast<ParenExpr>(condition))\n return classifyConditionalCompilationExpr(PE->getSubExpr(), Context, D);\n\n \/\/ Evaluate a \"&&\" or \"||\" expression.\n if (auto *SE = dyn_cast<SequenceExpr>(condition)) {\n \/\/ Check for '&&' or '||' as the expression type.\n if (SE->getNumElements() < 3) {\n D.diagnose(SE->getLoc(),\n diag::unsupported_conditional_compilation_binary_expression);\n return ConditionalCompilationExprState::error();\n }\n \/\/ Before type checking, chains of binary expressions will not be fully\n \/\/ parsed, so associativity has not yet been encoded in the subtree.\n auto elements = SE->getElements();\n auto numElements = SE->getNumElements();\n size_t iOperator = 1;\n size_t iOperand = 2;\n\n auto result = classifyConditionalCompilationExpr(elements[0], Context, D);\n\n while (iOperand < numElements) {\n\n if (auto *UDREOp = dyn_cast<UnresolvedDeclRefExpr>(elements[iOperator])) {\n auto name = UDREOp->getName().getBaseName().str();\n\n if (name.equals(\"||\") || name.equals(\"&&\")) {\n auto rhs = classifyConditionalCompilationExpr(elements[iOperand],\n Context, D);\n\n if (name.equals(\"||\")) {\n result = result || rhs;\n if (result.isConditionActive())\n break;\n }\n\n if (name.equals(\"&&\")) {\n result = result && rhs;\n if (!result.isConditionActive())\n break;\n }\n } else {\n D.diagnose(\n SE->getLoc(),\n diag::unsupported_conditional_compilation_binary_expression);\n return ConditionalCompilationExprState::error();\n }\n } else {\n \/\/ Swift3 didn't have this branch. the operator and the RHS are\n \/\/ silently ignored.\n if (!Context.isSwiftVersion3()) {\n D.diagnose(\n elements[iOperator]->getLoc(),\n diag::unsupported_conditional_compilation_expression_type);\n return ConditionalCompilationExprState::error();\n } else {\n SourceRange ignoredRange(elements[iOperator]->getLoc(),\n elements[iOperand]->getEndLoc());\n D.diagnose(\n elements[iOperator]->getLoc(),\n diag::swift3_unsupported_conditional_compilation_expression_type)\n .highlight(ignoredRange);\n }\n }\n\n iOperator += 2;\n iOperand += 2;\n }\n\n return result;\n }\n\n \/\/ Evaluate a named reference expression.\n if (auto *UDRE = dyn_cast<UnresolvedDeclRefExpr>(condition)) {\n auto name = UDRE->getName().getBaseName().str();\n return {Context.LangOpts.isCustomConditionalCompilationFlagSet(name),\n ConditionalCompilationExprKind::DeclRef};\n }\n\n \/\/ Evaluate a Boolean literal.\n if (auto *boolLit = dyn_cast<BooleanLiteralExpr>(condition)) {\n return {boolLit->getValue(), ConditionalCompilationExprKind::Boolean};\n }\n\n \/\/ Evaluate a negation (unary \"!\") expression.\n if (auto *PUE = dyn_cast<PrefixUnaryExpr>(condition)) {\n \/\/ If the PUE is not a negation expression, return false\n auto name =\n cast<UnresolvedDeclRefExpr>(PUE->getFn())->getName().getBaseName().str();\n if (name != \"!\") {\n D.diagnose(PUE->getLoc(),\n diag::unsupported_conditional_compilation_unary_expression);\n return ConditionalCompilationExprState::error();\n }\n\n return !classifyConditionalCompilationExpr(PUE->getArg(), Context, D);\n }\n\n \/\/ Evaluate a target config call expression.\n if (auto *CE = dyn_cast<CallExpr>(condition)) {\n \/\/ look up target config, and compare value\n auto fnNameExpr = dyn_cast<UnresolvedDeclRefExpr>(CE->getFn());\n\n \/\/ Get the arg, which should be in a paren expression.\n if (!fnNameExpr) {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_expression);\n return ConditionalCompilationExprState::error();\n }\n\n auto fnName = fnNameExpr->getName().getBaseName().str();\n\n auto *PE = dyn_cast<ParenExpr>(CE->getArg());\n if (!PE) {\n auto diag = D.diagnose(CE->getLoc(),\n diag::platform_condition_expected_one_argument);\n return ConditionalCompilationExprState::error();\n }\n\n if (!fnName.equals(\"arch\") && !fnName.equals(\"os\") &&\n !fnName.equals(\"_endian\") &&\n !fnName.equals(\"_runtime\") &&\n !fnName.equals(\"swift\") &&\n !fnName.equals(\"_compiler_version\")) {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_expression);\n return ConditionalCompilationExprState::error();\n }\n\n if (fnName.equals(\"_compiler_version\")) {\n if (auto SLE = dyn_cast<StringLiteralExpr>(PE->getSubExpr())) {\n if (SLE->getValue().empty()) {\n D.diagnose(CE->getLoc(), diag::empty_version_string);\n return ConditionalCompilationExprState::error();\n }\n auto versionRequirement =\n version::Version::parseCompilerVersionString(SLE->getValue(),\n SLE->getLoc(),\n &D);\n auto thisVersion = version::Version::getCurrentCompilerVersion();\n auto VersionNewEnough = thisVersion >= versionRequirement;\n return {VersionNewEnough,\n ConditionalCompilationExprKind::CompilerVersion};\n } else {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_argument,\n \"string literal\");\n return ConditionalCompilationExprState::error();\n }\n } else if (fnName.equals(\"swift\")) {\n auto PUE = dyn_cast<PrefixUnaryExpr>(PE->getSubExpr());\n if (!PUE) {\n D.diagnose(PE->getSubExpr()->getLoc(),\n diag::unsupported_platform_condition_argument,\n \"a unary comparison, such as '>=2.2'\");\n return ConditionalCompilationExprState::error();\n }\n\n auto prefix = dyn_cast<UnresolvedDeclRefExpr>(PUE->getFn());\n auto versionArg = PUE->getArg();\n auto versionStartLoc = versionArg->getStartLoc();\n auto endLoc = Lexer::getLocForEndOfToken(Context.SourceMgr,\n versionArg->getSourceRange().End);\n CharSourceRange versionCharRange(Context.SourceMgr, versionStartLoc,\n endLoc);\n auto versionString = Context.SourceMgr.extractText(versionCharRange);\n\n auto versionRequirement =\n version::Version::parseVersionString(versionString,\n versionStartLoc,\n &D);\n\n if (!versionRequirement.hasValue())\n return ConditionalCompilationExprState::error();\n\n auto thisVersion = Context.LangOpts.EffectiveLanguageVersion;\n\n if (!prefix->getName().getBaseName().str().equals(\">=\")) {\n D.diagnose(PUE->getFn()->getLoc(),\n diag::unexpected_version_comparison_operator)\n .fixItReplace(PUE->getFn()->getLoc(), \">=\");\n return ConditionalCompilationExprState::error();\n }\n\n auto VersionNewEnough = thisVersion >= versionRequirement.getValue();\n return {VersionNewEnough,\n ConditionalCompilationExprKind::LanguageVersion};\n } else {\n if (auto UDRE = dyn_cast<UnresolvedDeclRefExpr>(PE->getSubExpr())) {\n \/\/ The sub expression should be an UnresolvedDeclRefExpr (we won't\n \/\/ tolerate extra parens).\n auto argumentIdent = UDRE->getName().getBaseName();\n auto argument = argumentIdent.str();\n PlatformConditionKind Kind =\n llvm::StringSwitch<PlatformConditionKind>(fnName)\n .Case(\"os\", PlatformConditionKind::OS)\n .Case(\"arch\", PlatformConditionKind::Arch)\n .Case(\"_endian\", PlatformConditionKind::Endianness)\n .Case(\"_runtime\", PlatformConditionKind::Runtime);\n\n \/\/ FIXME: Perform the replacement macOS -> OSX elsewhere.\n if (Kind == PlatformConditionKind::OS && argument == \"macOS\")\n argument = \"OSX\";\n\n std::vector<StringRef> suggestions;\n if (!LangOptions::checkPlatformConditionSupported(Kind, argument,\n suggestions)) {\n if (Kind == PlatformConditionKind::Runtime) {\n \/\/ Error for _runtime()\n D.diagnose(UDRE->getLoc(),\n diag::unsupported_platform_runtime_condition_argument);\n return ConditionalCompilationExprState::error();\n }\n StringRef DiagName;\n switch (Kind) {\n case PlatformConditionKind::OS:\n DiagName = \"operating system\"; break;\n case PlatformConditionKind::Arch:\n DiagName = \"architecture\"; break;\n case PlatformConditionKind::Endianness:\n DiagName = \"endianness\"; break;\n case PlatformConditionKind::Runtime:\n llvm_unreachable(\"handled above\");\n }\n D.diagnose(UDRE->getLoc(), diag::unknown_platform_condition_argument,\n DiagName, fnName);\n for (const StringRef &suggestion : suggestions) {\n D.diagnose(UDRE->getLoc(), diag::note_typo_candidate, suggestion)\n .fixItReplace(UDRE->getSourceRange(), suggestion);\n }\n }\n\n auto target = Context.LangOpts.getPlatformConditionValue(Kind);\n return {target == argument, ConditionalCompilationExprKind::DeclRef};\n } else {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_argument,\n \"identifier\");\n return ConditionalCompilationExprState::error();\n }\n }\n }\n\n \/\/ \"#if 0\" isn't valid, but it is common, so recognize it and handle it\n \/\/ with a fixit elegantly.\n if (auto *IL = dyn_cast<IntegerLiteralExpr>(condition))\n if (IL->getDigitsText() == \"0\" || IL->getDigitsText() == \"1\") {\n StringRef replacement = IL->getDigitsText() == \"0\" ? \"false\" :\"true\";\n D.diagnose(IL->getLoc(), diag::unsupported_conditional_compilation_integer,\n IL->getDigitsText(), replacement)\n .fixItReplace(IL->getLoc(), replacement);\n return {IL->getDigitsText() == \"1\",\n ConditionalCompilationExprKind::Integer};\n }\n\n\n \/\/ If we've gotten here, it's an unsupported expression type.\n D.diagnose(condition->getLoc(),\n diag::unsupported_conditional_compilation_expression_type);\n return ConditionalCompilationExprState::error();\n}\n<commit_msg>[gardening] Fix incorrect file name in header<commit_after>\/\/===--- ParseIfConfig.cpp - Swift Language Parser for #if directives -----===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Conditional Compilation Block Parsing and AST Building\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/Parse\/Parser.h\"\n#include \"swift\/Basic\/Defer.h\"\n#include \"swift\/Basic\/LangOptions.h\"\n#include \"swift\/Basic\/Version.h\"\n#include \"swift\/Parse\/Lexer.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/Support\/SaveAndRestore.h\"\n\nusing namespace swift;\n\n\/\/\/ Parse and populate a list of #if\/#elseif\/#else\/#endif clauses.\n\/\/\/ Delegate callback function to parse elements in the blocks.\ntemplate <typename ElemTy, unsigned N>\nstatic ParserStatus parseIfConfig(\n Parser &P, SmallVectorImpl<IfConfigClause<ElemTy>> &Clauses,\n SourceLoc &EndLoc, bool HadMissingEnd,\n llvm::function_ref<void(SmallVectorImpl<ElemTy> &, bool)> parseElements) {\n Parser::StructureMarkerRAII ParsingDecl(\n P, P.Tok.getLoc(), Parser::StructureMarkerKind::IfConfig);\n\n bool foundActive = false;\n ConditionalCompilationExprState ConfigState;\n while (1) {\n bool isElse = P.Tok.is(tok::pound_else);\n SourceLoc ClauseLoc = P.consumeToken();\n Expr *Condition = nullptr;\n\n \/\/ Parse and evaluate the directive.\n if (isElse) {\n ConfigState.setConditionActive(!foundActive);\n } else {\n llvm::SaveAndRestore<bool> S(P.InPoundIfEnvironment, true);\n ParserResult<Expr> Result = P.parseExprSequence(diag::expected_expr,\n \/*isBasic*\/true,\n \/*isForDirective*\/true);\n if (Result.isNull())\n return makeParserError();\n\n Condition = Result.get();\n\n \/\/ Evaluate the condition, to validate it.\n ConfigState = P.classifyConditionalCompilationExpr(Condition, P.Context,\n P.Diags);\n if (foundActive)\n ConfigState.setConditionActive(false);\n }\n\n foundActive |= ConfigState.isConditionActive();\n\n if (!P.Tok.isAtStartOfLine() && P.Tok.isNot(tok::eof)) {\n P.diagnose(P.Tok.getLoc(),\n diag::extra_tokens_conditional_compilation_directive);\n }\n\n \/\/ Parse elements\n SmallVector<ElemTy, N> Elements;\n if (ConfigState.shouldParse()) {\n parseElements(Elements, ConfigState.isConditionActive());\n } else {\n DiagnosticTransaction DT(P.Diags);\n P.skipUntilConditionalBlockClose();\n DT.abort();\n }\n\n Clauses.push_back(IfConfigClause<ElemTy>(ClauseLoc, Condition,\n P.Context.AllocateCopy(Elements),\n ConfigState.isConditionActive()));\n\n if (P.Tok.isNot(tok::pound_elseif, tok::pound_else))\n break;\n\n if (isElse)\n P.diagnose(P.Tok, diag::expected_close_after_else_directive);\n }\n\n HadMissingEnd = P.parseEndIfDirective(EndLoc);\n return makeParserSuccess();\n}\n\nParserResult<IfConfigDecl> Parser::parseDeclIfConfig(ParseDeclOptions Flags) {\n SmallVector<IfConfigClause<Decl *>, 4> Clauses;\n SourceLoc EndLoc;\n bool HadMissingEnd = false;\n auto Status = parseIfConfig<Decl *, 8>(\n *this, Clauses, EndLoc, HadMissingEnd,\n [&](SmallVectorImpl<Decl *> &Decls, bool IsActive) {\n Optional<Scope> scope;\n if (!IsActive)\n scope.emplace(this, getScopeInfo().getCurrentScope()->getKind(),\n \/*inactiveConfigBlock=*\/true);\n\n ParserStatus Status;\n bool PreviousHadSemi = true;\n while (Tok.isNot(tok::pound_else, tok::pound_endif, tok::pound_elseif,\n tok::eof)) {\n if (Tok.is(tok::r_brace)) {\n diagnose(Tok.getLoc(),\n diag::unexpected_rbrace_in_conditional_compilation_block);\n \/\/ If we see '}', following declarations don't look like belong to\n \/\/ the current decl context; skip them.\n skipUntilConditionalBlockClose();\n break;\n }\n Status |= parseDeclItem(PreviousHadSemi, Flags,\n [&](Decl *D) {Decls.push_back(D);});\n }\n });\n if (Status.isError())\n return makeParserErrorResult<IfConfigDecl>();\n\n IfConfigDecl *ICD = new (Context) IfConfigDecl(CurDeclContext,\n Context.AllocateCopy(Clauses),\n EndLoc, HadMissingEnd);\n return makeParserResult(ICD);\n}\n\nParserResult<Stmt> Parser::parseStmtIfConfig(BraceItemListKind Kind) {\n SmallVector<IfConfigClause<ASTNode>, 4> Clauses;\n SourceLoc EndLoc;\n bool HadMissingEnd = false;\n auto Status = parseIfConfig<ASTNode, 16>(\n *this, Clauses, EndLoc, HadMissingEnd,\n [&](SmallVectorImpl<ASTNode> &Elements, bool IsActive) {\n parseBraceItems(Elements, Kind, IsActive\n ? BraceItemListKind::ActiveConditionalBlock\n : BraceItemListKind::InactiveConditionalBlock);\n });\n if (Status.isError())\n return makeParserErrorResult<Stmt>();\n\n auto *ICS = new (Context) IfConfigStmt(Context.AllocateCopy(Clauses),\n EndLoc, HadMissingEnd);\n return makeParserResult(ICS);\n}\n\n\/\/ Evaluate a subset of expression types suitable for build configuration\n\/\/ conditional expressions. The accepted expression types are:\n\/\/ - The magic constants \"true\" and \"false\".\n\/\/ - Named decl ref expressions (\"FOO\")\n\/\/ - Parenthesized expressions (\"(FOO)\")\n\/\/ - Binary \"&&\" or \"||\" operations applied to other build configuration\n\/\/ conditional expressions\n\/\/ - Unary \"!\" expressions applied to other build configuration conditional\n\/\/ expressions\n\/\/ - Single-argument call expressions, where the function being invoked is a\n\/\/ supported target configuration (currently \"os\", \"arch\", and\n\/\/ \"_compiler_version\"), and whose argument is a named decl ref expression\nConditionalCompilationExprState\nParser::classifyConditionalCompilationExpr(Expr *condition,\n ASTContext &Context,\n DiagnosticEngine &D) {\n assert(condition && \"Cannot classify a NULL condition expression!\");\n\n \/\/ Evaluate a ParenExpr.\n if (auto *PE = dyn_cast<ParenExpr>(condition))\n return classifyConditionalCompilationExpr(PE->getSubExpr(), Context, D);\n\n \/\/ Evaluate a \"&&\" or \"||\" expression.\n if (auto *SE = dyn_cast<SequenceExpr>(condition)) {\n \/\/ Check for '&&' or '||' as the expression type.\n if (SE->getNumElements() < 3) {\n D.diagnose(SE->getLoc(),\n diag::unsupported_conditional_compilation_binary_expression);\n return ConditionalCompilationExprState::error();\n }\n \/\/ Before type checking, chains of binary expressions will not be fully\n \/\/ parsed, so associativity has not yet been encoded in the subtree.\n auto elements = SE->getElements();\n auto numElements = SE->getNumElements();\n size_t iOperator = 1;\n size_t iOperand = 2;\n\n auto result = classifyConditionalCompilationExpr(elements[0], Context, D);\n\n while (iOperand < numElements) {\n\n if (auto *UDREOp = dyn_cast<UnresolvedDeclRefExpr>(elements[iOperator])) {\n auto name = UDREOp->getName().getBaseName().str();\n\n if (name.equals(\"||\") || name.equals(\"&&\")) {\n auto rhs = classifyConditionalCompilationExpr(elements[iOperand],\n Context, D);\n\n if (name.equals(\"||\")) {\n result = result || rhs;\n if (result.isConditionActive())\n break;\n }\n\n if (name.equals(\"&&\")) {\n result = result && rhs;\n if (!result.isConditionActive())\n break;\n }\n } else {\n D.diagnose(\n SE->getLoc(),\n diag::unsupported_conditional_compilation_binary_expression);\n return ConditionalCompilationExprState::error();\n }\n } else {\n \/\/ Swift3 didn't have this branch. the operator and the RHS are\n \/\/ silently ignored.\n if (!Context.isSwiftVersion3()) {\n D.diagnose(\n elements[iOperator]->getLoc(),\n diag::unsupported_conditional_compilation_expression_type);\n return ConditionalCompilationExprState::error();\n } else {\n SourceRange ignoredRange(elements[iOperator]->getLoc(),\n elements[iOperand]->getEndLoc());\n D.diagnose(\n elements[iOperator]->getLoc(),\n diag::swift3_unsupported_conditional_compilation_expression_type)\n .highlight(ignoredRange);\n }\n }\n\n iOperator += 2;\n iOperand += 2;\n }\n\n return result;\n }\n\n \/\/ Evaluate a named reference expression.\n if (auto *UDRE = dyn_cast<UnresolvedDeclRefExpr>(condition)) {\n auto name = UDRE->getName().getBaseName().str();\n return {Context.LangOpts.isCustomConditionalCompilationFlagSet(name),\n ConditionalCompilationExprKind::DeclRef};\n }\n\n \/\/ Evaluate a Boolean literal.\n if (auto *boolLit = dyn_cast<BooleanLiteralExpr>(condition)) {\n return {boolLit->getValue(), ConditionalCompilationExprKind::Boolean};\n }\n\n \/\/ Evaluate a negation (unary \"!\") expression.\n if (auto *PUE = dyn_cast<PrefixUnaryExpr>(condition)) {\n \/\/ If the PUE is not a negation expression, return false\n auto name =\n cast<UnresolvedDeclRefExpr>(PUE->getFn())->getName().getBaseName().str();\n if (name != \"!\") {\n D.diagnose(PUE->getLoc(),\n diag::unsupported_conditional_compilation_unary_expression);\n return ConditionalCompilationExprState::error();\n }\n\n return !classifyConditionalCompilationExpr(PUE->getArg(), Context, D);\n }\n\n \/\/ Evaluate a target config call expression.\n if (auto *CE = dyn_cast<CallExpr>(condition)) {\n \/\/ look up target config, and compare value\n auto fnNameExpr = dyn_cast<UnresolvedDeclRefExpr>(CE->getFn());\n\n \/\/ Get the arg, which should be in a paren expression.\n if (!fnNameExpr) {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_expression);\n return ConditionalCompilationExprState::error();\n }\n\n auto fnName = fnNameExpr->getName().getBaseName().str();\n\n auto *PE = dyn_cast<ParenExpr>(CE->getArg());\n if (!PE) {\n auto diag = D.diagnose(CE->getLoc(),\n diag::platform_condition_expected_one_argument);\n return ConditionalCompilationExprState::error();\n }\n\n if (!fnName.equals(\"arch\") && !fnName.equals(\"os\") &&\n !fnName.equals(\"_endian\") &&\n !fnName.equals(\"_runtime\") &&\n !fnName.equals(\"swift\") &&\n !fnName.equals(\"_compiler_version\")) {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_expression);\n return ConditionalCompilationExprState::error();\n }\n\n if (fnName.equals(\"_compiler_version\")) {\n if (auto SLE = dyn_cast<StringLiteralExpr>(PE->getSubExpr())) {\n if (SLE->getValue().empty()) {\n D.diagnose(CE->getLoc(), diag::empty_version_string);\n return ConditionalCompilationExprState::error();\n }\n auto versionRequirement =\n version::Version::parseCompilerVersionString(SLE->getValue(),\n SLE->getLoc(),\n &D);\n auto thisVersion = version::Version::getCurrentCompilerVersion();\n auto VersionNewEnough = thisVersion >= versionRequirement;\n return {VersionNewEnough,\n ConditionalCompilationExprKind::CompilerVersion};\n } else {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_argument,\n \"string literal\");\n return ConditionalCompilationExprState::error();\n }\n } else if (fnName.equals(\"swift\")) {\n auto PUE = dyn_cast<PrefixUnaryExpr>(PE->getSubExpr());\n if (!PUE) {\n D.diagnose(PE->getSubExpr()->getLoc(),\n diag::unsupported_platform_condition_argument,\n \"a unary comparison, such as '>=2.2'\");\n return ConditionalCompilationExprState::error();\n }\n\n auto prefix = dyn_cast<UnresolvedDeclRefExpr>(PUE->getFn());\n auto versionArg = PUE->getArg();\n auto versionStartLoc = versionArg->getStartLoc();\n auto endLoc = Lexer::getLocForEndOfToken(Context.SourceMgr,\n versionArg->getSourceRange().End);\n CharSourceRange versionCharRange(Context.SourceMgr, versionStartLoc,\n endLoc);\n auto versionString = Context.SourceMgr.extractText(versionCharRange);\n\n auto versionRequirement =\n version::Version::parseVersionString(versionString,\n versionStartLoc,\n &D);\n\n if (!versionRequirement.hasValue())\n return ConditionalCompilationExprState::error();\n\n auto thisVersion = Context.LangOpts.EffectiveLanguageVersion;\n\n if (!prefix->getName().getBaseName().str().equals(\">=\")) {\n D.diagnose(PUE->getFn()->getLoc(),\n diag::unexpected_version_comparison_operator)\n .fixItReplace(PUE->getFn()->getLoc(), \">=\");\n return ConditionalCompilationExprState::error();\n }\n\n auto VersionNewEnough = thisVersion >= versionRequirement.getValue();\n return {VersionNewEnough,\n ConditionalCompilationExprKind::LanguageVersion};\n } else {\n if (auto UDRE = dyn_cast<UnresolvedDeclRefExpr>(PE->getSubExpr())) {\n \/\/ The sub expression should be an UnresolvedDeclRefExpr (we won't\n \/\/ tolerate extra parens).\n auto argumentIdent = UDRE->getName().getBaseName();\n auto argument = argumentIdent.str();\n PlatformConditionKind Kind =\n llvm::StringSwitch<PlatformConditionKind>(fnName)\n .Case(\"os\", PlatformConditionKind::OS)\n .Case(\"arch\", PlatformConditionKind::Arch)\n .Case(\"_endian\", PlatformConditionKind::Endianness)\n .Case(\"_runtime\", PlatformConditionKind::Runtime);\n\n \/\/ FIXME: Perform the replacement macOS -> OSX elsewhere.\n if (Kind == PlatformConditionKind::OS && argument == \"macOS\")\n argument = \"OSX\";\n\n std::vector<StringRef> suggestions;\n if (!LangOptions::checkPlatformConditionSupported(Kind, argument,\n suggestions)) {\n if (Kind == PlatformConditionKind::Runtime) {\n \/\/ Error for _runtime()\n D.diagnose(UDRE->getLoc(),\n diag::unsupported_platform_runtime_condition_argument);\n return ConditionalCompilationExprState::error();\n }\n StringRef DiagName;\n switch (Kind) {\n case PlatformConditionKind::OS:\n DiagName = \"operating system\"; break;\n case PlatformConditionKind::Arch:\n DiagName = \"architecture\"; break;\n case PlatformConditionKind::Endianness:\n DiagName = \"endianness\"; break;\n case PlatformConditionKind::Runtime:\n llvm_unreachable(\"handled above\");\n }\n D.diagnose(UDRE->getLoc(), diag::unknown_platform_condition_argument,\n DiagName, fnName);\n for (const StringRef &suggestion : suggestions) {\n D.diagnose(UDRE->getLoc(), diag::note_typo_candidate, suggestion)\n .fixItReplace(UDRE->getSourceRange(), suggestion);\n }\n }\n\n auto target = Context.LangOpts.getPlatformConditionValue(Kind);\n return {target == argument, ConditionalCompilationExprKind::DeclRef};\n } else {\n D.diagnose(CE->getLoc(), diag::unsupported_platform_condition_argument,\n \"identifier\");\n return ConditionalCompilationExprState::error();\n }\n }\n }\n\n \/\/ \"#if 0\" isn't valid, but it is common, so recognize it and handle it\n \/\/ with a fixit elegantly.\n if (auto *IL = dyn_cast<IntegerLiteralExpr>(condition))\n if (IL->getDigitsText() == \"0\" || IL->getDigitsText() == \"1\") {\n StringRef replacement = IL->getDigitsText() == \"0\" ? \"false\" :\"true\";\n D.diagnose(IL->getLoc(), diag::unsupported_conditional_compilation_integer,\n IL->getDigitsText(), replacement)\n .fixItReplace(IL->getLoc(), replacement);\n return {IL->getDigitsText() == \"1\",\n ConditionalCompilationExprKind::Integer};\n }\n\n\n \/\/ If we've gotten here, it's an unsupported expression type.\n D.diagnose(condition->getLoc(),\n diag::unsupported_conditional_compilation_expression_type);\n return ConditionalCompilationExprState::error();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/== HTMLRewrite.cpp - Translate source code into prettified HTML --*- C++ -*-\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines the HTMLRewriter clas, which is used to translate the\n\/\/ text of a source file into prettified HTML.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Rewrite\/Rewriter.h\"\n#include \"clang\/Rewrite\/HTMLRewrite.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <sstream>\n\nusing namespace clang;\n\nvoid html::EscapeText(Rewriter& R, unsigned FileID, bool EscapeSpaces) {\n \n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* C = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n \n assert (C <= FileEnd);\n \n for (unsigned FilePos = 0; C != FileEnd ; ++C, ++FilePos) {\n \n switch (*C) {\n default: break;\n \n case ' ':\n if (EscapeSpaces) {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \" \", 6);\n }\n break;\n\n case '\\t': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \"    \", 6*4);\n break;\n }\n \n case '<': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \"<\", 4);\n break;\n }\n \n case '>': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \">\", 4);\n break;\n }\n \n case '&': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \"&\", 5);\n break;\n }\n }\n }\n}\n\nstd::string html::EscapeText(const std::string& s, bool EscapeSpaces) {\n \n unsigned len = s.size();\n std::ostringstream os;\n \n for (unsigned i = 0 ; i < len; ++i) {\n \n char c = s[i];\n \n switch (c) {\n default:\n os << c; break;\n \n case ' ':\n if (EscapeSpaces) os << \" \";\n else os << ' ';\n break;\n \n case '\\t': for (unsigned i = 0; i < 4; ++i) os << \" \"; break;\n case '<': os << \"<\"; break;\n case '>': os << \">\"; break;\n case '&': os << \"&\"; break;\n }\n }\n \n return os.str();\n}\n\nstatic void AddLineNumber(Rewriter& R, unsigned LineNo,\n SourceLocation B, SourceLocation E) {\n \n std::ostringstream os;\n os << \"<tr><td class=\\\"num\\\" id=\\\"LN\" << LineNo << \"\\\">\" \n << LineNo << \"<\/td><td class=\\\"line\\\">\";\n\n if (B == E) { \/\/ Handle empty lines.\n os << \" <\/td><\/tr>\";\n R.InsertStrBefore(B, os.str());\n }\n else {\n R.InsertStrBefore(B, os.str());\n R.InsertCStrBefore(E, \"<\/td><\/tr>\");\n }\n}\n\nvoid html::AddLineNumbers(Rewriter& R, unsigned FileID) {\n\n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* FileBeg = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n const char* C = FileBeg;\n \n assert (C <= FileEnd);\n \n unsigned LineNo = 0;\n unsigned FilePos = 0;\n \n while (C != FileEnd) { \n \n ++LineNo;\n unsigned LineStartPos = FilePos;\n unsigned LineEndPos = FileEnd - FileBeg;\n \n assert (FilePos <= LineEndPos);\n assert (C < FileEnd);\n \n \/\/ Scan until the newline (or end-of-file).\n \n while (C != FileEnd) {\n char c = *C;\n ++C;\n \n if (c == '\\n') {\n LineEndPos = FilePos++;\n break;\n }\n \n ++FilePos;\n }\n \n AddLineNumber(R, LineNo,\n SourceLocation::getFileLoc(FileID, LineStartPos),\n SourceLocation::getFileLoc(FileID, LineEndPos)); \n }\n \n \/\/ Add one big div tag that surrounds all of the code.\n \n R.InsertCStrBefore(SourceLocation::getFileLoc(FileID, 0),\n \"<table class=\\\"code\\\">\\n\");\n \n R.InsertCStrAfter(SourceLocation::getFileLoc(FileID, FileEnd - FileBeg),\n \"<\/table>\");\n}\n\nvoid html::AddHeaderFooterInternalBuiltinCSS(Rewriter& R, unsigned FileID) {\n\n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* FileStart = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n\n SourceLocation StartLoc = SourceLocation::getFileLoc(FileID, 0);\n SourceLocation EndLoc = SourceLocation::getFileLoc(FileID, FileEnd-FileStart);\n\n \/\/ Generate header\n\n {\n std::ostringstream os;\n \n os << \"<html>\\n<head>\\n\"\n << \"<style type=\\\"text\/css\\\">\\n\"\n << \" body { color:#000000; background-color:#ffffff }\\n\"\n << \" body { font-family:Helvetica, sans-serif; font-size:10pt }\\n\"\n << \" h1 { font-size:12pt }\\n\"\n << \" .code { border-spacing:0px; width:100%; }\\n\"\n << \" .code { font-family: \\\"Andale Mono\\\", monospace; font-size:10pt }\\n\"\n << \" .code { line-height: 1.2em }\\n\"\n << \" .num { width:2.5em; padding-right:2ex; background-color:#eeeeee }\\n\"\n << \" .num { text-align:right; font-size: smaller }\\n\"\n << \" .num { color:#444444 }\\n\"\n << \" .line { padding-left: 1ex; border-left: 3px solid #ccc }\\n\"\n << \" .line { white-space: pre }\\n\"\n << \" .msg { background-color:#fff8b4; color:#000000 }\\n\"\n << \" .msg { -webkit-box-shadow:1px 1px 7px #000 }\\n\"\n << \" .msg { -webkit-border-radius:5px }\\n\"\n << \" .msg { font-family:Helvetica, sans-serif; font-size: smaller }\\n\"\n << \" .msg { font-weight: bold }\\n\"\n << \" .msg { float:left }\\n\"\n << \" .msg { padding:0.5em 1ex 0.5em 1ex }\\n\"\n << \" .msg { margin-top:10px; margin-bottom:10px }\\n\"\n << \" .mrange { background-color:#dfddf3 }\\n\"\n << \" .mrange { border-bottom:1px solid #6F9DBE }\\n\"\n << \" .PathIndex { font-weight: bold }\\n\"\n << \"<\/style>\\n<\/head>\\n<body>\";\n \n R.InsertStrBefore(StartLoc, os.str());\n }\n \n \/\/ Generate footer\n \n {\n std::ostringstream os;\n \n os << \"<\/body><\/html>\\n\";\n R.InsertStrAfter(EndLoc, os.str());\n }\n}\n \n \n<commit_msg>When substituting tabs during HTMLification, only add \" \" when we are \"escaping\" spaces.<commit_after>\/\/== HTMLRewrite.cpp - Translate source code into prettified HTML --*- C++ -*-\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines the HTMLRewriter clas, which is used to translate the\n\/\/ text of a source file into prettified HTML.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"clang\/Rewrite\/Rewriter.h\"\n#include \"clang\/Rewrite\/HTMLRewrite.h\"\n#include \"clang\/Basic\/SourceManager.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include <sstream>\n\nusing namespace clang;\n\nvoid html::EscapeText(Rewriter& R, unsigned FileID, bool EscapeSpaces) {\n \n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* C = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n \n assert (C <= FileEnd);\n \n for (unsigned FilePos = 0; C != FileEnd ; ++C, ++FilePos) {\n \n switch (*C) {\n default: break;\n \n case ' ':\n if (EscapeSpaces) {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \" \", 6);\n }\n break;\n\n case '\\t': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n \n if (EscapeSpaces)\n R.ReplaceText(Loc, 1, \"    \", 6*4);\n else\n R.ReplaceText(Loc, 1, \" \", 4);\n \n break;\n }\n \n case '<': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \"<\", 4);\n break;\n }\n \n case '>': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \">\", 4);\n break;\n }\n \n case '&': {\n SourceLocation Loc = SourceLocation::getFileLoc(FileID, FilePos);\n R.ReplaceText(Loc, 1, \"&\", 5);\n break;\n }\n }\n }\n}\n\nstd::string html::EscapeText(const std::string& s, bool EscapeSpaces) {\n \n unsigned len = s.size();\n std::ostringstream os;\n \n for (unsigned i = 0 ; i < len; ++i) {\n \n char c = s[i];\n \n switch (c) {\n default:\n os << c; break;\n \n case ' ':\n if (EscapeSpaces) os << \" \";\n else os << ' ';\n break;\n \n case '\\t': for (unsigned i = 0; i < 4; ++i) os << \" \"; break;\n case '<': os << \"<\"; break;\n case '>': os << \">\"; break;\n case '&': os << \"&\"; break;\n }\n }\n \n return os.str();\n}\n\nstatic void AddLineNumber(Rewriter& R, unsigned LineNo,\n SourceLocation B, SourceLocation E) {\n \n std::ostringstream os;\n os << \"<tr><td class=\\\"num\\\" id=\\\"LN\" << LineNo << \"\\\">\" \n << LineNo << \"<\/td><td class=\\\"line\\\">\";\n\n if (B == E) { \/\/ Handle empty lines.\n os << \" <\/td><\/tr>\";\n R.InsertStrBefore(B, os.str());\n }\n else {\n R.InsertStrBefore(B, os.str());\n R.InsertCStrBefore(E, \"<\/td><\/tr>\");\n }\n}\n\nvoid html::AddLineNumbers(Rewriter& R, unsigned FileID) {\n\n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* FileBeg = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n const char* C = FileBeg;\n \n assert (C <= FileEnd);\n \n unsigned LineNo = 0;\n unsigned FilePos = 0;\n \n while (C != FileEnd) { \n \n ++LineNo;\n unsigned LineStartPos = FilePos;\n unsigned LineEndPos = FileEnd - FileBeg;\n \n assert (FilePos <= LineEndPos);\n assert (C < FileEnd);\n \n \/\/ Scan until the newline (or end-of-file).\n \n while (C != FileEnd) {\n char c = *C;\n ++C;\n \n if (c == '\\n') {\n LineEndPos = FilePos++;\n break;\n }\n \n ++FilePos;\n }\n \n AddLineNumber(R, LineNo,\n SourceLocation::getFileLoc(FileID, LineStartPos),\n SourceLocation::getFileLoc(FileID, LineEndPos)); \n }\n \n \/\/ Add one big div tag that surrounds all of the code.\n \n R.InsertCStrBefore(SourceLocation::getFileLoc(FileID, 0),\n \"<table class=\\\"code\\\">\\n\");\n \n R.InsertCStrAfter(SourceLocation::getFileLoc(FileID, FileEnd - FileBeg),\n \"<\/table>\");\n}\n\nvoid html::AddHeaderFooterInternalBuiltinCSS(Rewriter& R, unsigned FileID) {\n\n const llvm::MemoryBuffer *Buf = R.getSourceMgr().getBuffer(FileID);\n const char* FileStart = Buf->getBufferStart();\n const char* FileEnd = Buf->getBufferEnd();\n\n SourceLocation StartLoc = SourceLocation::getFileLoc(FileID, 0);\n SourceLocation EndLoc = SourceLocation::getFileLoc(FileID, FileEnd-FileStart);\n\n \/\/ Generate header\n\n {\n std::ostringstream os;\n \n os << \"<html>\\n<head>\\n\"\n << \"<style type=\\\"text\/css\\\">\\n\"\n << \" body { color:#000000; background-color:#ffffff }\\n\"\n << \" body { font-family:Helvetica, sans-serif; font-size:10pt }\\n\"\n << \" h1 { font-size:12pt }\\n\"\n << \" .code { border-spacing:0px; width:100%; }\\n\"\n << \" .code { font-family: \\\"Andale Mono\\\", monospace; font-size:10pt }\\n\"\n << \" .code { line-height: 1.2em }\\n\"\n << \" .num { width:2.5em; padding-right:2ex; background-color:#eeeeee }\\n\"\n << \" .num { text-align:right; font-size: smaller }\\n\"\n << \" .num { color:#444444 }\\n\"\n << \" .line { padding-left: 1ex; border-left: 3px solid #ccc }\\n\"\n << \" .line { white-space: pre }\\n\"\n << \" .msg { background-color:#fff8b4; color:#000000 }\\n\"\n << \" .msg { -webkit-box-shadow:1px 1px 7px #000 }\\n\"\n << \" .msg { -webkit-border-radius:5px }\\n\"\n << \" .msg { font-family:Helvetica, sans-serif; font-size: smaller }\\n\"\n << \" .msg { font-weight: bold }\\n\"\n << \" .msg { float:left }\\n\"\n << \" .msg { padding:0.5em 1ex 0.5em 1ex }\\n\"\n << \" .msg { margin-top:10px; margin-bottom:10px }\\n\"\n << \" .mrange { background-color:#dfddf3 }\\n\"\n << \" .mrange { border-bottom:1px solid #6F9DBE }\\n\"\n << \" .PathIndex { font-weight: bold }\\n\"\n << \"<\/style>\\n<\/head>\\n<body>\";\n \n R.InsertStrBefore(StartLoc, os.str());\n }\n \n \/\/ Generate footer\n \n {\n std::ostringstream os;\n \n os << \"<\/body><\/html>\\n\";\n R.InsertStrAfter(EndLoc, os.str());\n }\n}\n \n \n<|endoftext|>"} {"text":"<commit_before>\/\/===- SystemUtils.h - Utilities to do low-level system stuff --*- C++ -*--===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions used to do a variety of low-level, often\n\/\/ system-specific, tasks.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Support\/SystemUtils.h\"\n#include \"Config\/sys\/types.h\"\n#include \"Config\/sys\/stat.h\"\n#include \"Config\/fcntl.h\"\n#include \"Config\/sys\/wait.h\"\n#include \"Config\/unistd.h\"\n#include \"Config\/config.h\"\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <cstdlib>\n#include <cerrno>\nusing namespace llvm;\n\n\/\/\/ isExecutableFile - This function returns true if the filename specified\n\/\/\/ exists and is executable.\n\/\/\/\nbool llvm::isExecutableFile(const std::string &ExeFileName) {\n struct stat Buf;\n if (stat(ExeFileName.c_str(), &Buf))\n return false; \/\/ Must not be executable!\n\n if (!(Buf.st_mode & S_IFREG))\n return false; \/\/ Not a regular file?\n\n if (Buf.st_uid == getuid()) \/\/ Owner of file?\n return Buf.st_mode & S_IXUSR;\n else if (Buf.st_gid == getgid()) \/\/ In group of file?\n return Buf.st_mode & S_IXGRP;\n else \/\/ Unrelated to file?\n return Buf.st_mode & S_IXOTH;\n}\n\n\/\/\/ isStandardOutAConsole - Return true if we can tell that the standard output\n\/\/\/ stream goes to a terminal window or console.\nbool llvm::isStandardOutAConsole() {\n#if HAVE_ISATTY\n return isatty(1);\n#endif\n \/\/ If we don't have isatty, just return false.\n return false;\n}\n\n\n\/\/\/ FindExecutable - Find a named executable, giving the argv[0] of program\n\/\/\/ being executed. This allows us to find another LLVM tool if it is built\n\/\/\/ into the same directory, but that directory is neither the current\n\/\/\/ directory, nor in the PATH. If the executable cannot be found, return an\n\/\/\/ empty string.\n\/\/\/ \nstd::string llvm::FindExecutable(const std::string &ExeName,\n const std::string &ProgramPath) {\n \/\/ First check the directory that bugpoint is in. We can do this if\n \/\/ BugPointPath contains at least one \/ character, indicating that it is a\n \/\/ relative path to bugpoint itself.\n \/\/\n std::string Result = ProgramPath;\n while (!Result.empty() && Result[Result.size()-1] != '\/')\n Result.erase(Result.size()-1, 1);\n\n if (!Result.empty()) {\n Result += ExeName;\n if (isExecutableFile(Result)) return Result; \/\/ Found it?\n }\n\n \/\/ Okay, if the path to the program didn't tell us anything, try using the\n \/\/ PATH environment variable.\n const char *PathStr = getenv(\"PATH\");\n if (PathStr == 0) return \"\";\n\n \/\/ Now we have a colon separated list of directories to search... try them...\n unsigned PathLen = strlen(PathStr);\n while (PathLen) {\n \/\/ Find the first colon...\n const char *Colon = std::find(PathStr, PathStr+PathLen, ':');\n \n \/\/ Check to see if this first directory contains the executable...\n std::string FilePath = std::string(PathStr, Colon) + '\/' + ExeName;\n if (isExecutableFile(FilePath))\n return FilePath; \/\/ Found the executable!\n \n \/\/ Nope it wasn't in this directory, check the next range!\n PathLen -= Colon-PathStr;\n PathStr = Colon;\n while (*PathStr == ':') { \/\/ Advance past colons\n PathStr++;\n PathLen--;\n }\n }\n\n \/\/ If we fell out, we ran out of directories in PATH to search, return failure\n return \"\";\n}\n\nstatic void RedirectFD(const std::string &File, int FD) {\n if (File.empty()) return; \/\/ Noop\n\n \/\/ Open the file\n int InFD = open(File.c_str(), FD == 0 ? O_RDONLY : O_WRONLY|O_CREAT, 0666);\n if (InFD == -1) {\n std::cerr << \"Error opening file '\" << File << \"' for \"\n << (FD == 0 ? \"input\" : \"output\") << \"!\\n\";\n exit(1);\n }\n\n dup2(InFD, FD); \/\/ Install it as the requested FD\n close(InFD); \/\/ Close the original FD\n}\n\n\/\/\/ RunProgramWithTimeout - This function executes the specified program, with\n\/\/\/ the specified null-terminated argument array, with the stdin\/out\/err fd's\n\/\/\/ redirected, with a timeout specified on the command line. This terminates\n\/\/\/ the calling program if there is an error executing the specified program.\n\/\/\/ It returns the return value of the program, or -1 if a timeout is detected.\n\/\/\/\nint llvm::RunProgramWithTimeout(const std::string &ProgramPath,\n const char **Args,\n const std::string &StdInFile,\n const std::string &StdOutFile,\n const std::string &StdErrFile) {\n \/\/ FIXME: install sigalarm handler here for timeout...\n\n int Child = fork();\n switch (Child) {\n case -1:\n std::cerr << \"ERROR forking!\\n\";\n exit(1);\n case 0: \/\/ Child\n RedirectFD(StdInFile, 0); \/\/ Redirect file descriptors...\n RedirectFD(StdOutFile, 1);\n if (StdOutFile != StdErrFile)\n RedirectFD(StdErrFile, 2);\n else\n dup2(1, 2);\n\n execv(ProgramPath.c_str(), (char *const *)Args);\n std::cerr << \"Error executing program: '\" << ProgramPath;\n for (; *Args; ++Args)\n std::cerr << \" \" << *Args;\n std::cerr << \"'\\n\";\n exit(1);\n\n default: break;\n }\n\n \/\/ Make sure all output has been written while waiting\n std::cout << std::flush;\n\n int Status;\n if (wait(&Status) != Child) {\n if (errno == EINTR) {\n static bool FirstTimeout = true;\n if (FirstTimeout) {\n std::cout <<\n \"*** Program execution timed out! This mechanism is designed to handle\\n\"\n \" programs stuck in infinite loops gracefully. The -timeout option\\n\"\n \" can be used to change the timeout threshold or disable it completely\\n\"\n \" (with -timeout=0). This message is only displayed once.\\n\";\n FirstTimeout = false;\n }\n return -1; \/\/ Timeout detected\n }\n\n std::cerr << \"Error waiting for child process!\\n\";\n exit(1);\n }\n return Status;\n}\n\n\n\/\/\n\/\/ Function: ExecWait ()\n\/\/\n\/\/ Description:\n\/\/ This function executes a program with the specified arguments and\n\/\/ environment. It then waits for the progarm to termiante and then returns\n\/\/ to the caller.\n\/\/\n\/\/ Inputs:\n\/\/ argv - The arguments to the program as an array of C strings. The first\n\/\/ argument should be the name of the program to execute, and the\n\/\/ last argument should be a pointer to NULL.\n\/\/\n\/\/ envp - The environment passes to the program as an array of C strings in\n\/\/ the form of \"name=value\" pairs. The last element should be a\n\/\/ pointer to NULL.\n\/\/\n\/\/ Outputs:\n\/\/ None.\n\/\/\n\/\/ Return value:\n\/\/ 0 - No errors.\n\/\/ 1 - The program could not be executed.\n\/\/ 1 - The program returned a non-zero exit status.\n\/\/ 1 - The program terminated abnormally.\n\/\/\n\/\/ Notes:\n\/\/ The program will inherit the stdin, stdout, and stderr file descriptors\n\/\/ as well as other various configuration settings (umask).\n\/\/\n\/\/ This function should not print anything to stdout\/stderr on its own. It is\n\/\/ a generic library function. The caller or executed program should report\n\/\/ errors in the way it sees fit.\n\/\/\n\/\/ This function does not use $PATH to find programs.\n\/\/\nint llvm::ExecWait(const char * const old_argv[],\n const char * const old_envp[]) {\n \/\/ Child process ID\n register int child;\n\n \/\/ Status from child process when it exits\n int status;\n \n \/\/\n \/\/ Create local versions of the parameters that can be passed into execve()\n \/\/ without creating const problems.\n \/\/\n char ** const argv = (char ** const) old_argv;\n char ** const envp = (char ** const) old_envp;\n\n \/\/\n \/\/ Create a child process.\n \/\/\n switch (child=fork())\n {\n \/\/\n \/\/ An error occured: Return to the caller.\n \/\/\n case -1:\n return 1;\n break;\n\n \/\/\n \/\/ Child process: Execute the program.\n \/\/\n case 0:\n execve (argv[0], argv, envp);\n\n \/\/\n \/\/ If the execve() failed, we should exit and let the parent pick up\n \/\/ our non-zero exit status.\n \/\/\n exit (1);\n break;\n\n \/\/\n \/\/ Parent process: Break out of the switch to do our processing.\n \/\/\n default:\n break;\n }\n\n \/\/\n \/\/ Parent process: Wait for the child process to termiante.\n \/\/\n if ((wait (&status)) == -1)\n {\n return 1;\n }\n\n \/\/\n \/\/ If the program exited normally with a zero exit status, return success!\n \/\/\n if (WIFEXITED (status) && (WEXITSTATUS(status) == 0))\n {\n return 0;\n }\n\n \/\/\n \/\/ Otherwise, return failure.\n \/\/\n return 1;\n}\n<commit_msg>Changes to make libSupport build on systems that don't have the wait syscall.<commit_after>\/\/===- SystemUtils.h - Utilities to do low-level system stuff --*- C++ -*--===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions used to do a variety of low-level, often\n\/\/ system-specific, tasks.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"Support\/SystemUtils.h\"\n#include \"Config\/sys\/types.h\"\n#include \"Config\/sys\/stat.h\"\n#include \"Config\/fcntl.h\"\n#include \"Config\/sys\/wait.h\"\n#include \"Config\/unistd.h\"\n#include \"Config\/config.h\"\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <cstdlib>\n#include <cerrno>\nusing namespace llvm;\n\n\/\/\/ isExecutableFile - This function returns true if the filename specified\n\/\/\/ exists and is executable.\n\/\/\/\nbool llvm::isExecutableFile(const std::string &ExeFileName) {\n struct stat Buf;\n if (stat(ExeFileName.c_str(), &Buf))\n return false; \/\/ Must not be executable!\n\n if (!(Buf.st_mode & S_IFREG))\n return false; \/\/ Not a regular file?\n\n if (Buf.st_uid == getuid()) \/\/ Owner of file?\n return Buf.st_mode & S_IXUSR;\n else if (Buf.st_gid == getgid()) \/\/ In group of file?\n return Buf.st_mode & S_IXGRP;\n else \/\/ Unrelated to file?\n return Buf.st_mode & S_IXOTH;\n}\n\n\/\/\/ isStandardOutAConsole - Return true if we can tell that the standard output\n\/\/\/ stream goes to a terminal window or console.\nbool llvm::isStandardOutAConsole() {\n#if HAVE_ISATTY\n return isatty(1);\n#endif\n \/\/ If we don't have isatty, just return false.\n return false;\n}\n\n\n\/\/\/ FindExecutable - Find a named executable, giving the argv[0] of program\n\/\/\/ being executed. This allows us to find another LLVM tool if it is built\n\/\/\/ into the same directory, but that directory is neither the current\n\/\/\/ directory, nor in the PATH. If the executable cannot be found, return an\n\/\/\/ empty string.\n\/\/\/ \nstd::string llvm::FindExecutable(const std::string &ExeName,\n const std::string &ProgramPath) {\n \/\/ First check the directory that bugpoint is in. We can do this if\n \/\/ BugPointPath contains at least one \/ character, indicating that it is a\n \/\/ relative path to bugpoint itself.\n \/\/\n std::string Result = ProgramPath;\n while (!Result.empty() && Result[Result.size()-1] != '\/')\n Result.erase(Result.size()-1, 1);\n\n if (!Result.empty()) {\n Result += ExeName;\n if (isExecutableFile(Result)) return Result; \/\/ Found it?\n }\n\n \/\/ Okay, if the path to the program didn't tell us anything, try using the\n \/\/ PATH environment variable.\n const char *PathStr = getenv(\"PATH\");\n if (PathStr == 0) return \"\";\n\n \/\/ Now we have a colon separated list of directories to search... try them...\n unsigned PathLen = strlen(PathStr);\n while (PathLen) {\n \/\/ Find the first colon...\n const char *Colon = std::find(PathStr, PathStr+PathLen, ':');\n \n \/\/ Check to see if this first directory contains the executable...\n std::string FilePath = std::string(PathStr, Colon) + '\/' + ExeName;\n if (isExecutableFile(FilePath))\n return FilePath; \/\/ Found the executable!\n \n \/\/ Nope it wasn't in this directory, check the next range!\n PathLen -= Colon-PathStr;\n PathStr = Colon;\n while (*PathStr == ':') { \/\/ Advance past colons\n PathStr++;\n PathLen--;\n }\n }\n\n \/\/ If we fell out, we ran out of directories in PATH to search, return failure\n return \"\";\n}\n\nstatic void RedirectFD(const std::string &File, int FD) {\n if (File.empty()) return; \/\/ Noop\n\n \/\/ Open the file\n int InFD = open(File.c_str(), FD == 0 ? O_RDONLY : O_WRONLY|O_CREAT, 0666);\n if (InFD == -1) {\n std::cerr << \"Error opening file '\" << File << \"' for \"\n << (FD == 0 ? \"input\" : \"output\") << \"!\\n\";\n exit(1);\n }\n\n dup2(InFD, FD); \/\/ Install it as the requested FD\n close(InFD); \/\/ Close the original FD\n}\n\n\/\/\/ RunProgramWithTimeout - This function executes the specified program, with\n\/\/\/ the specified null-terminated argument array, with the stdin\/out\/err fd's\n\/\/\/ redirected, with a timeout specified on the command line. This terminates\n\/\/\/ the calling program if there is an error executing the specified program.\n\/\/\/ It returns the return value of the program, or -1 if a timeout is detected.\n\/\/\/\nint llvm::RunProgramWithTimeout(const std::string &ProgramPath,\n const char **Args,\n const std::string &StdInFile,\n const std::string &StdOutFile,\n const std::string &StdErrFile) {\n \/\/ FIXME: install sigalarm handler here for timeout...\n\n#ifdef HAVE_SYS_WAIT_H\n int Child = fork();\n switch (Child) {\n case -1:\n std::cerr << \"ERROR forking!\\n\";\n exit(1);\n case 0: \/\/ Child\n RedirectFD(StdInFile, 0); \/\/ Redirect file descriptors...\n RedirectFD(StdOutFile, 1);\n if (StdOutFile != StdErrFile)\n RedirectFD(StdErrFile, 2);\n else\n dup2(1, 2);\n\n execv(ProgramPath.c_str(), (char *const *)Args);\n std::cerr << \"Error executing program: '\" << ProgramPath;\n for (; *Args; ++Args)\n std::cerr << \" \" << *Args;\n std::cerr << \"'\\n\";\n exit(1);\n\n default: break;\n }\n\n \/\/ Make sure all output has been written while waiting\n std::cout << std::flush;\n\n int Status;\n if (wait(&Status) != Child) {\n if (errno == EINTR) {\n static bool FirstTimeout = true;\n if (FirstTimeout) {\n std::cout <<\n \"*** Program execution timed out! This mechanism is designed to handle\\n\"\n \" programs stuck in infinite loops gracefully. The -timeout option\\n\"\n \" can be used to change the timeout threshold or disable it completely\\n\"\n \" (with -timeout=0). This message is only displayed once.\\n\";\n FirstTimeout = false;\n }\n return -1; \/\/ Timeout detected\n }\n\n std::cerr << \"Error waiting for child process!\\n\";\n exit(1);\n }\n return Status;\n\n#else\n std::cerr << \"RunProgramWithTimeout not implemented on this platform!\\n\";\n return -1;\n#endif\n}\n\n\n\/\/\n\/\/ Function: ExecWait ()\n\/\/\n\/\/ Description:\n\/\/ This function executes a program with the specified arguments and\n\/\/ environment. It then waits for the progarm to termiante and then returns\n\/\/ to the caller.\n\/\/\n\/\/ Inputs:\n\/\/ argv - The arguments to the program as an array of C strings. The first\n\/\/ argument should be the name of the program to execute, and the\n\/\/ last argument should be a pointer to NULL.\n\/\/\n\/\/ envp - The environment passes to the program as an array of C strings in\n\/\/ the form of \"name=value\" pairs. The last element should be a\n\/\/ pointer to NULL.\n\/\/\n\/\/ Outputs:\n\/\/ None.\n\/\/\n\/\/ Return value:\n\/\/ 0 - No errors.\n\/\/ 1 - The program could not be executed.\n\/\/ 1 - The program returned a non-zero exit status.\n\/\/ 1 - The program terminated abnormally.\n\/\/\n\/\/ Notes:\n\/\/ The program will inherit the stdin, stdout, and stderr file descriptors\n\/\/ as well as other various configuration settings (umask).\n\/\/\n\/\/ This function should not print anything to stdout\/stderr on its own. It is\n\/\/ a generic library function. The caller or executed program should report\n\/\/ errors in the way it sees fit.\n\/\/\n\/\/ This function does not use $PATH to find programs.\n\/\/\nint llvm::ExecWait(const char * const old_argv[],\n const char * const old_envp[]) {\n#ifdef HAVE_SYS_WAIT_H\n \/\/\n \/\/ Create local versions of the parameters that can be passed into execve()\n \/\/ without creating const problems.\n \/\/\n char ** const argv = (char ** const) old_argv;\n char ** const envp = (char ** const) old_envp;\n\n \/\/ Create a child process.\n switch (fork()) {\n \/\/ An error occured: Return to the caller.\n case -1:\n return 1;\n break;\n\n \/\/ Child process: Execute the program.\n case 0:\n execve (argv[0], argv, envp);\n \/\/ If the execve() failed, we should exit and let the parent pick up\n \/\/ our non-zero exit status.\n exit (1);\n\n \/\/ Parent process: Break out of the switch to do our processing.\n default:\n break;\n }\n\n \/\/ Parent process: Wait for the child process to termiante.\n int status;\n if ((wait (&status)) == -1)\n return 1;\n\n \/\/ If the program exited normally with a zero exit status, return success!\n if (WIFEXITED (status) && (WEXITSTATUS(status) == 0))\n return 0;\n#else\n std::cerr << \"llvm::ExecWait not implemented on this platform!\\n\";\n#endif\n\n \/\/ Otherwise, return failure.\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- asan_malloc_win.cc ------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file is a part of AddressSanitizer, an address sanity checker.\n\/\/\n\/\/ Windows-specific malloc interception.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"sanitizer_common\/sanitizer_platform.h\"\n#if SANITIZER_WINDOWS\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n\n#include \"asan_allocator.h\"\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_stack.h\"\n#include \"interception\/interception.h\"\n\n#include <stddef.h>\n\nusing namespace __asan; \/\/ NOLINT\n\n\/\/ MT: Simply defining functions with the same signature in *.obj\n\/\/ files overrides the standard functions in the CRT.\n\/\/ MD: Memory allocation functions are defined in the CRT .dll,\n\/\/ so we have to intercept them before they are called for the first time.\n\n#if ASAN_DYNAMIC\n# define ALLOCATION_FUNCTION_ATTRIBUTE\n#else\n# define ALLOCATION_FUNCTION_ATTRIBUTE SANITIZER_INTERFACE_ATTRIBUTE\n#endif\n\nextern \"C\" {\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid free(void *ptr) {\n GET_STACK_TRACE_FREE;\n return asan_free(ptr, &stack, FROM_MALLOC);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid _free_dbg(void *ptr, int) {\n free(ptr);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid _free_base(void *ptr) {\n free(ptr);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *malloc(size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_malloc(size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_malloc_base(size_t size) {\n return malloc(size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_malloc_dbg(size_t size, int, const char *, int) {\n return malloc(size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *calloc(size_t nmemb, size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_calloc(nmemb, size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_base(size_t nmemb, size_t size) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_dbg(size_t nmemb, size_t size, int, const char *, int) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_impl(size_t nmemb, size_t size, int *errno_tmp) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *realloc(void *ptr, size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_realloc(ptr, size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_realloc_dbg(void *ptr, size_t size, int) {\n UNREACHABLE(\"_realloc_dbg should not exist!\");\n return 0;\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_realloc_base(void *ptr, size_t size) {\n return realloc(ptr, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_recalloc(void *p, size_t n, size_t elem_size) {\n if (!p)\n return calloc(n, elem_size);\n const size_t size = n * elem_size;\n if (elem_size != 0 && size \/ elem_size != n)\n return 0;\n return realloc(p, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_recalloc_base(void *p, size_t n, size_t elem_size) {\n return _recalloc(p, n, elem_size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nsize_t _msize(void *ptr) {\n GET_CURRENT_PC_BP_SP;\n (void)sp;\n return asan_malloc_usable_size(ptr, pc, bp);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_expand(void *memblock, size_t size) {\n \/\/ _expand is used in realloc-like functions to resize the buffer if possible.\n \/\/ We don't want memory to stand still while resizing buffers, so return 0.\n return 0;\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_expand_dbg(void *memblock, size_t size) {\n return _expand(memblock, size);\n}\n\n\/\/ TODO(timurrrr): Might want to add support for _aligned_* allocation\n\/\/ functions to detect a bit more bugs. Those functions seem to wrap malloc().\n\nint _CrtDbgReport(int, const char*, int,\n const char*, const char*, ...) {\n ShowStatsAndAbort();\n}\n\nint _CrtDbgReportW(int reportType, const wchar_t*, int,\n const wchar_t*, const wchar_t*, ...) {\n ShowStatsAndAbort();\n}\n\nint _CrtSetReportMode(int, int) {\n return 0;\n}\n} \/\/ extern \"C\"\n\nINTERCEPTOR_WINAPI(LPVOID, HeapAlloc, HANDLE hHeap, DWORD dwFlags,\n SIZE_T dwBytes) {\n GET_STACK_TRACE_MALLOC;\n void *p = asan_malloc(dwBytes, &stack);\n \/\/ Reading MSDN suggests that the *entire* usable allocation is zeroed out.\n \/\/ Otherwise it is difficult to HeapReAlloc with HEAP_ZERO_MEMORY.\n \/\/ https:\/\/blogs.msdn.microsoft.com\/oldnewthing\/20120316-00\/?p=8083\n if (dwFlags == HEAP_ZERO_MEMORY)\n internal_memset(p, 0, asan_mz_size(p));\n else\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n return p;\n}\n\nINTERCEPTOR_WINAPI(BOOL, HeapFree, HANDLE hHeap, DWORD dwFlags, LPVOID lpMem) {\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n GET_STACK_TRACE_FREE;\n asan_free(lpMem, &stack, FROM_MALLOC);\n return true;\n}\n\nINTERCEPTOR_WINAPI(LPVOID, HeapReAlloc, HANDLE hHeap, DWORD dwFlags,\n LPVOID lpMem, SIZE_T dwBytes) {\n GET_STACK_TRACE_MALLOC;\n \/\/ Realloc should never reallocate in place.\n if (dwFlags & HEAP_REALLOC_IN_PLACE_ONLY)\n return nullptr;\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n return asan_realloc(lpMem, dwBytes, &stack);\n}\n\nINTERCEPTOR_WINAPI(SIZE_T, HeapSize, HANDLE hHeap, DWORD dwFlags,\n LPCVOID lpMem) {\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n GET_CURRENT_PC_BP_SP;\n (void)sp;\n return asan_malloc_usable_size(lpMem, pc, bp);\n}\n\nnamespace __asan {\n\nstatic void TryToOverrideFunction(const char *fname, uptr new_func) {\n \/\/ Failure here is not fatal. The CRT may not be present, and different CRT\n \/\/ versions use different symbols.\n if (!__interception::OverrideFunction(fname, new_func))\n VPrintf(2, \"Failed to override function %s\\n\", fname);\n}\n\nvoid ReplaceSystemMalloc() {\n#if defined(ASAN_DYNAMIC)\n TryToOverrideFunction(\"free\", (uptr)free);\n TryToOverrideFunction(\"_free_base\", (uptr)free);\n TryToOverrideFunction(\"malloc\", (uptr)malloc);\n TryToOverrideFunction(\"_malloc_base\", (uptr)malloc);\n TryToOverrideFunction(\"_malloc_crt\", (uptr)malloc);\n TryToOverrideFunction(\"calloc\", (uptr)calloc);\n TryToOverrideFunction(\"_calloc_base\", (uptr)calloc);\n TryToOverrideFunction(\"_calloc_crt\", (uptr)calloc);\n TryToOverrideFunction(\"realloc\", (uptr)realloc);\n TryToOverrideFunction(\"_realloc_base\", (uptr)realloc);\n TryToOverrideFunction(\"_realloc_crt\", (uptr)realloc);\n TryToOverrideFunction(\"_recalloc\", (uptr)_recalloc);\n TryToOverrideFunction(\"_recalloc_base\", (uptr)_recalloc);\n TryToOverrideFunction(\"_recalloc_crt\", (uptr)_recalloc);\n TryToOverrideFunction(\"_msize\", (uptr)_msize);\n TryToOverrideFunction(\"_expand\", (uptr)_expand);\n TryToOverrideFunction(\"_expand_base\", (uptr)_expand);\n\n \/\/ Recent versions of ucrtbase.dll appear to be built with PGO and LTCG, which\n \/\/ enable cross-module inlining. This means our _malloc_base hook won't catch\n \/\/ all CRT allocations. This code here patches the import table of\n \/\/ ucrtbase.dll so that all attempts to use the lower-level win32 heap\n \/\/ allocation API will be directed to ASan's heap. We don't currently\n \/\/ intercept all calls to HeapAlloc. If we did, we would have to check on\n \/\/ HeapFree whether the pointer came from ASan of from the system.\n#define INTERCEPT_UCRT_FUNCTION(func) \\\n if (!INTERCEPT_FUNCTION_DLLIMPORT(\"ucrtbase.dll\", \\\n \"api-ms-win-core-heap-l1-1-0.dll\", func)) \\\n VPrintf(2, \"Failed to intercept ucrtbase.dll import %s\\n\", #func);\n INTERCEPT_UCRT_FUNCTION(HeapAlloc);\n INTERCEPT_UCRT_FUNCTION(HeapFree);\n INTERCEPT_UCRT_FUNCTION(HeapReAlloc);\n INTERCEPT_UCRT_FUNCTION(HeapSize);\n#undef INTERCEPT_UCRT_FUNCTION\n#endif\n}\n} \/\/ namespace __asan\n\n#endif \/\/ _WIN32\n<commit_msg>[ASan] [Windows] Avoid including windows.h in asan_malloc_win.cc<commit_after>\/\/===-- asan_malloc_win.cc ------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file is a part of AddressSanitizer, an address sanity checker.\n\/\/\n\/\/ Windows-specific malloc interception.\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"sanitizer_common\/sanitizer_platform.h\"\n#if SANITIZER_WINDOWS\n\/\/ Intentionally not including windows.h here, to avoid the risk of\n\/\/ pulling in conflicting declarations of these functions. (With mingw-w64,\n\/\/ there's a risk of windows.h pulling in stdint.h.)\ntypedef int BOOL;\ntypedef void *HANDLE;\ntypedef const void *LPCVOID;\ntypedef void *LPVOID;\n\n#define HEAP_ZERO_MEMORY 0x00000008\n#define HEAP_REALLOC_IN_PLACE_ONLY 0x00000010\n\n\n#include \"asan_allocator.h\"\n#include \"asan_interceptors.h\"\n#include \"asan_internal.h\"\n#include \"asan_stack.h\"\n#include \"interception\/interception.h\"\n\n#include <stddef.h>\n\nusing namespace __asan; \/\/ NOLINT\n\n\/\/ MT: Simply defining functions with the same signature in *.obj\n\/\/ files overrides the standard functions in the CRT.\n\/\/ MD: Memory allocation functions are defined in the CRT .dll,\n\/\/ so we have to intercept them before they are called for the first time.\n\n#if ASAN_DYNAMIC\n# define ALLOCATION_FUNCTION_ATTRIBUTE\n#else\n# define ALLOCATION_FUNCTION_ATTRIBUTE SANITIZER_INTERFACE_ATTRIBUTE\n#endif\n\nextern \"C\" {\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid free(void *ptr) {\n GET_STACK_TRACE_FREE;\n return asan_free(ptr, &stack, FROM_MALLOC);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid _free_dbg(void *ptr, int) {\n free(ptr);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid _free_base(void *ptr) {\n free(ptr);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *malloc(size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_malloc(size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_malloc_base(size_t size) {\n return malloc(size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_malloc_dbg(size_t size, int, const char *, int) {\n return malloc(size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *calloc(size_t nmemb, size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_calloc(nmemb, size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_base(size_t nmemb, size_t size) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_dbg(size_t nmemb, size_t size, int, const char *, int) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_calloc_impl(size_t nmemb, size_t size, int *errno_tmp) {\n return calloc(nmemb, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *realloc(void *ptr, size_t size) {\n GET_STACK_TRACE_MALLOC;\n return asan_realloc(ptr, size, &stack);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_realloc_dbg(void *ptr, size_t size, int) {\n UNREACHABLE(\"_realloc_dbg should not exist!\");\n return 0;\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_realloc_base(void *ptr, size_t size) {\n return realloc(ptr, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_recalloc(void *p, size_t n, size_t elem_size) {\n if (!p)\n return calloc(n, elem_size);\n const size_t size = n * elem_size;\n if (elem_size != 0 && size \/ elem_size != n)\n return 0;\n return realloc(p, size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_recalloc_base(void *p, size_t n, size_t elem_size) {\n return _recalloc(p, n, elem_size);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nsize_t _msize(void *ptr) {\n GET_CURRENT_PC_BP_SP;\n (void)sp;\n return asan_malloc_usable_size(ptr, pc, bp);\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_expand(void *memblock, size_t size) {\n \/\/ _expand is used in realloc-like functions to resize the buffer if possible.\n \/\/ We don't want memory to stand still while resizing buffers, so return 0.\n return 0;\n}\n\nALLOCATION_FUNCTION_ATTRIBUTE\nvoid *_expand_dbg(void *memblock, size_t size) {\n return _expand(memblock, size);\n}\n\n\/\/ TODO(timurrrr): Might want to add support for _aligned_* allocation\n\/\/ functions to detect a bit more bugs. Those functions seem to wrap malloc().\n\nint _CrtDbgReport(int, const char*, int,\n const char*, const char*, ...) {\n ShowStatsAndAbort();\n}\n\nint _CrtDbgReportW(int reportType, const wchar_t*, int,\n const wchar_t*, const wchar_t*, ...) {\n ShowStatsAndAbort();\n}\n\nint _CrtSetReportMode(int, int) {\n return 0;\n}\n} \/\/ extern \"C\"\n\nINTERCEPTOR_WINAPI(LPVOID, HeapAlloc, HANDLE hHeap, DWORD dwFlags,\n SIZE_T dwBytes) {\n GET_STACK_TRACE_MALLOC;\n void *p = asan_malloc(dwBytes, &stack);\n \/\/ Reading MSDN suggests that the *entire* usable allocation is zeroed out.\n \/\/ Otherwise it is difficult to HeapReAlloc with HEAP_ZERO_MEMORY.\n \/\/ https:\/\/blogs.msdn.microsoft.com\/oldnewthing\/20120316-00\/?p=8083\n if (dwFlags == HEAP_ZERO_MEMORY)\n internal_memset(p, 0, asan_mz_size(p));\n else\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n return p;\n}\n\nINTERCEPTOR_WINAPI(BOOL, HeapFree, HANDLE hHeap, DWORD dwFlags, LPVOID lpMem) {\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n GET_STACK_TRACE_FREE;\n asan_free(lpMem, &stack, FROM_MALLOC);\n return true;\n}\n\nINTERCEPTOR_WINAPI(LPVOID, HeapReAlloc, HANDLE hHeap, DWORD dwFlags,\n LPVOID lpMem, SIZE_T dwBytes) {\n GET_STACK_TRACE_MALLOC;\n \/\/ Realloc should never reallocate in place.\n if (dwFlags & HEAP_REALLOC_IN_PLACE_ONLY)\n return nullptr;\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n return asan_realloc(lpMem, dwBytes, &stack);\n}\n\nINTERCEPTOR_WINAPI(SIZE_T, HeapSize, HANDLE hHeap, DWORD dwFlags,\n LPCVOID lpMem) {\n CHECK(dwFlags == 0 && \"unsupported heap flags\");\n GET_CURRENT_PC_BP_SP;\n (void)sp;\n return asan_malloc_usable_size(lpMem, pc, bp);\n}\n\nnamespace __asan {\n\nstatic void TryToOverrideFunction(const char *fname, uptr new_func) {\n \/\/ Failure here is not fatal. The CRT may not be present, and different CRT\n \/\/ versions use different symbols.\n if (!__interception::OverrideFunction(fname, new_func))\n VPrintf(2, \"Failed to override function %s\\n\", fname);\n}\n\nvoid ReplaceSystemMalloc() {\n#if defined(ASAN_DYNAMIC)\n TryToOverrideFunction(\"free\", (uptr)free);\n TryToOverrideFunction(\"_free_base\", (uptr)free);\n TryToOverrideFunction(\"malloc\", (uptr)malloc);\n TryToOverrideFunction(\"_malloc_base\", (uptr)malloc);\n TryToOverrideFunction(\"_malloc_crt\", (uptr)malloc);\n TryToOverrideFunction(\"calloc\", (uptr)calloc);\n TryToOverrideFunction(\"_calloc_base\", (uptr)calloc);\n TryToOverrideFunction(\"_calloc_crt\", (uptr)calloc);\n TryToOverrideFunction(\"realloc\", (uptr)realloc);\n TryToOverrideFunction(\"_realloc_base\", (uptr)realloc);\n TryToOverrideFunction(\"_realloc_crt\", (uptr)realloc);\n TryToOverrideFunction(\"_recalloc\", (uptr)_recalloc);\n TryToOverrideFunction(\"_recalloc_base\", (uptr)_recalloc);\n TryToOverrideFunction(\"_recalloc_crt\", (uptr)_recalloc);\n TryToOverrideFunction(\"_msize\", (uptr)_msize);\n TryToOverrideFunction(\"_expand\", (uptr)_expand);\n TryToOverrideFunction(\"_expand_base\", (uptr)_expand);\n\n \/\/ Recent versions of ucrtbase.dll appear to be built with PGO and LTCG, which\n \/\/ enable cross-module inlining. This means our _malloc_base hook won't catch\n \/\/ all CRT allocations. This code here patches the import table of\n \/\/ ucrtbase.dll so that all attempts to use the lower-level win32 heap\n \/\/ allocation API will be directed to ASan's heap. We don't currently\n \/\/ intercept all calls to HeapAlloc. If we did, we would have to check on\n \/\/ HeapFree whether the pointer came from ASan of from the system.\n#define INTERCEPT_UCRT_FUNCTION(func) \\\n if (!INTERCEPT_FUNCTION_DLLIMPORT(\"ucrtbase.dll\", \\\n \"api-ms-win-core-heap-l1-1-0.dll\", func)) \\\n VPrintf(2, \"Failed to intercept ucrtbase.dll import %s\\n\", #func);\n INTERCEPT_UCRT_FUNCTION(HeapAlloc);\n INTERCEPT_UCRT_FUNCTION(HeapFree);\n INTERCEPT_UCRT_FUNCTION(HeapReAlloc);\n INTERCEPT_UCRT_FUNCTION(HeapSize);\n#undef INTERCEPT_UCRT_FUNCTION\n#endif\n}\n} \/\/ namespace __asan\n\n#endif \/\/ _WIN32\n<|endoftext|>"} {"text":"<commit_before>#include \"condor_common.h\"\n#include \"classad.h\"\n\nstatic char *_FileName_ = __FILE__;\n\nAttributeReference::\nAttributeReference()\n{\n\tnodeKind = ATTRREF_NODE;\n\texpr = NULL;\n\tattributeStr = NULL;\n\tabsolute = false;\n}\n\n\/\/ a private ctor for use in significant expr identification\nAttributeReference::\nAttributeReference( ExprTree *tree, char *attrname, bool absolut )\n{\n\tnodeKind = ATTRREF_NODE;\n\tattributeStr = strnewp( attrname );\n\texpr = tree;\n\tabsolute = absolut;\n}\n\nAttributeReference::\n~AttributeReference()\n{\n\tif( attributeStr ) delete []( attributeStr );\n\tif( expr ) delete expr;\n}\n\n\nAttributeReference *AttributeReference::\nCopy( )\n{\n\tAttributeReference *newTree = new AttributeReference ();\n\tif (newTree == 0) return NULL;\n\n\tif (attributeStr) newTree->attributeStr = strnewp( attributeStr );\n\tnewTree->attributeName = attributeName;\n\n\tif( expr && ( newTree->expr=expr->Copy( ) ) == NULL ) {\n\t\tdelete []( newTree->attributeStr );\n\t\tdelete newTree;\n\t\treturn NULL;\n\t}\n\n\tnewTree->nodeKind = nodeKind;\n\tnewTree->absolute = absolute;\n\n\treturn newTree;\n}\n\nvoid AttributeReference::\n_SetParentScope( ClassAd *parent ) \n{\n\tif( expr ) expr->SetParentScope( parent );\n}\n\n\nbool AttributeReference::\nToSink (Sink &s)\n{\n\tif( ( absolute \t&& !s.SendToSink( (void*)\".\", 1 ) )\t || ( expr \n\t\t\t&& ( !expr->ToSink( s ) || !s.SendToSink( (void*) \".\", 1 ) ) ) ||\n\t\t( attributeStr && \n\t\t\t!s.SendToSink((void*)attributeStr,strlen(attributeStr))))\n\t\t\t\treturn false;\n\t\t\n\treturn true;\n}\n\n\nbool AttributeReference::\n_Evaluate (EvalState &state, Value &val)\n{\n\tExprTree\t*tree, *dummy;\n\tClassAd\t\t*curAd;\n\tbool\t\trval;\n\n\t\/\/ find the expression and the evalstate\n\tcurAd = state.curAd;\n\tswitch( FindExpr( state, tree, dummy, false ) ) {\n\t\tcase EVAL_FAIL:\n\t\t\treturn false;\n\n\t\tcase EVAL_ERROR:\n\t\t\tval.SetErrorValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_UNDEF:\n\t\t\tval.SetUndefinedValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_OK:\n\t\t\trval = tree->Evaluate( state , val );\n\t\t\tstate.curAd = curAd;\n\t\t\treturn rval;\n\n\t\tdefault: EXCEPT( \"ClassAd: Should not reach here\" );\n\t}\n\treturn false;\n}\n\n\nbool AttributeReference::\n_Evaluate (EvalState &state, Value &val, ExprTree *&sig )\n{\n\tExprTree\t*tree;\n\tClassAd\t\t*curAd;\n\tbool\t\trval;\n\n\t\/\/ find the expression and the evalstate\n\tcurAd = state.curAd;\n\tswitch( FindExpr( state , tree , sig , true ) ) {\n\t\tcase EVAL_FAIL:\n\t\t\treturn false;\n\n\t\tcase EVAL_ERROR:\n\t\t\tval.SetErrorValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_UNDEF:\n\t\t\tval.SetUndefinedValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_OK:\n\t\t\trval = tree->Evaluate( state , val );\n\t\t\tstate.curAd = curAd;\n\t\t\treturn rval;\n\n\t\tdefault: EXCEPT( \"ClassAd: Should not reach here\" );\n\t}\n\treturn false;\n}\n\n\nbool AttributeReference::\n_Flatten( EvalState &state, Value &val, ExprTree*&ntree, OpKind*)\n{\n\tif( absolute ) {\n\t\tntree = Copy();\n\t\treturn( ntree != NULL );\n\t}\n\n\tif( !Evaluate( state, val ) ) {\n\t\treturn false;\n\t}\n\n\tif( val.IsClassAdValue() || val.IsListValue() || val.IsUndefinedValue() ) {\n\t\tntree = Copy();\n\t\treturn( ntree != NULL );\n\t} else {\n\t\tntree = NULL;\n\t}\n\treturn true;\n}\n\n\nint AttributeReference::\nFindExpr( EvalState &state, ExprTree *&tree, ExprTree *&sig, bool wantSig )\n{\n\tClassAd \t*current=NULL;\n\tExprTree\t*sigXpr = NULL;\n\tValue\t\tval;\n\tbool\t\trval;\n\n\tsig = NULL;\n\n\t\/\/ establish starting point for search\n\tif( expr == NULL ) {\n\t\t\/\/ \"attr\" and \".attr\"\n\t\tcurrent = absolute ? state.rootAd : state.curAd;\n\t} else {\n\t\t\/\/ \"expr.attr\"\n\t\trval=wantSig?expr->Evaluate(state,val,sigXpr):expr->Evaluate(state,val);\n\t\tif( !rval ) {\n\t\t\treturn( EVAL_FAIL );\n\t\t}\n\n\t\tif( val.IsUndefinedValue( ) ) {\n\t\t\tsig = sigXpr;\n\t\t\treturn( EVAL_UNDEF );\n\t\t}\n\t\tif( !val.IsClassAdValue( current ) ) {\n\t\t\tif( wantSig ) {\n\t\t\t\tif(!(sig=new AttributeReference(sigXpr,attributeStr,absolute))){\n\t\t\t\t\treturn( EVAL_FAIL );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn( EVAL_ERROR );\n\t\t}\n\t}\n\n\tif( wantSig ) {\n\t\tsig = new AttributeReference( sigXpr, attributeStr, absolute );\n\t}\n\n\t\/\/ lookup with scope; this may side-affect state\n\treturn( current->LookupInScope( attributeStr, tree, state ) );\n}\n\n\nvoid AttributeReference::\nSetReference (ExprTree *tree, char *attrStr, bool absolut)\n{\n\tif (expr) delete expr;\n\tif (attributeStr) delete [] (attributeStr);\n\n\texpr \t\t= tree;\n\tabsolute \t= absolut;\n\tattributeStr= attrStr ? strnewp(attrStr) : 0;\n}\n<commit_msg>Copy parent scope correctly in Copy() method.<commit_after>#include \"condor_common.h\"\n#include \"classad.h\"\n\nstatic char *_FileName_ = __FILE__;\n\nAttributeReference::\nAttributeReference()\n{\n\tnodeKind = ATTRREF_NODE;\n\texpr = NULL;\n\tattributeStr = NULL;\n\tabsolute = false;\n}\n\n\/\/ a private ctor for use in significant expr identification\nAttributeReference::\nAttributeReference( ExprTree *tree, char *attrname, bool absolut )\n{\n\tnodeKind = ATTRREF_NODE;\n\tattributeStr = strnewp( attrname );\n\texpr = tree;\n\tabsolute = absolut;\n}\n\nAttributeReference::\n~AttributeReference()\n{\n\tif( attributeStr ) delete []( attributeStr );\n\tif( expr ) delete expr;\n}\n\n\nAttributeReference *AttributeReference::\nCopy( )\n{\n\tAttributeReference *newTree = new AttributeReference ();\n\tif (newTree == 0) return NULL;\n\n\tif (attributeStr) newTree->attributeStr = strnewp( attributeStr );\n\tnewTree->attributeName = attributeName;\n\n\tif( expr && ( newTree->expr=expr->Copy( ) ) == NULL ) {\n\t\tdelete []( newTree->attributeStr );\n\t\tdelete newTree;\n\t\treturn NULL;\n\t}\n\n\tnewTree->nodeKind = nodeKind;\n\tnewTree->parentScope = parentScope;\n\tnewTree->absolute = absolute;\n\n\treturn newTree;\n}\n\nvoid AttributeReference::\n_SetParentScope( ClassAd *parent ) \n{\n\tif( expr ) expr->SetParentScope( parent );\n}\n\n\nbool AttributeReference::\nToSink (Sink &s)\n{\n\tif( ( absolute \t&& !s.SendToSink( (void*)\".\", 1 ) )\t || ( expr \n\t\t\t&& ( !expr->ToSink( s ) || !s.SendToSink( (void*) \".\", 1 ) ) ) ||\n\t\t( attributeStr && \n\t\t\t!s.SendToSink((void*)attributeStr,strlen(attributeStr))))\n\t\t\t\treturn false;\n\t\t\n\treturn true;\n}\n\n\nbool AttributeReference::\n_Evaluate (EvalState &state, Value &val)\n{\n\tExprTree\t*tree, *dummy;\n\tClassAd\t\t*curAd;\n\tbool\t\trval;\n\n\t\/\/ find the expression and the evalstate\n\tcurAd = state.curAd;\n\tswitch( FindExpr( state, tree, dummy, false ) ) {\n\t\tcase EVAL_FAIL:\n\t\t\treturn false;\n\n\t\tcase EVAL_ERROR:\n\t\t\tval.SetErrorValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_UNDEF:\n\t\t\tval.SetUndefinedValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_OK:\n\t\t\trval = tree->Evaluate( state , val );\n\t\t\tstate.curAd = curAd;\n\t\t\treturn rval;\n\n\t\tdefault: EXCEPT( \"ClassAd: Should not reach here\" );\n\t}\n\treturn false;\n}\n\n\nbool AttributeReference::\n_Evaluate (EvalState &state, Value &val, ExprTree *&sig )\n{\n\tExprTree\t*tree;\n\tClassAd\t\t*curAd;\n\tbool\t\trval;\n\n\t\/\/ find the expression and the evalstate\n\tcurAd = state.curAd;\n\tswitch( FindExpr( state , tree , sig , true ) ) {\n\t\tcase EVAL_FAIL:\n\t\t\treturn false;\n\n\t\tcase EVAL_ERROR:\n\t\t\tval.SetErrorValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_UNDEF:\n\t\t\tval.SetUndefinedValue();\n\t\t\tstate.curAd = curAd;\n\t\t\treturn true;\n\n\t\tcase EVAL_OK:\n\t\t\trval = tree->Evaluate( state , val );\n\t\t\tstate.curAd = curAd;\n\t\t\treturn rval;\n\n\t\tdefault: EXCEPT( \"ClassAd: Should not reach here\" );\n\t}\n\treturn false;\n}\n\n\nbool AttributeReference::\n_Flatten( EvalState &state, Value &val, ExprTree*&ntree, OpKind*)\n{\n\tif( absolute ) {\n\t\tntree = Copy();\n\t\treturn( ntree != NULL );\n\t}\n\n\tif( !Evaluate( state, val ) ) {\n\t\treturn false;\n\t}\n\n\tif( val.IsClassAdValue() || val.IsListValue() || val.IsUndefinedValue() ) {\n\t\tntree = Copy();\n\t\treturn( ntree != NULL );\n\t} else {\n\t\tntree = NULL;\n\t}\n\treturn true;\n}\n\n\nint AttributeReference::\nFindExpr( EvalState &state, ExprTree *&tree, ExprTree *&sig, bool wantSig )\n{\n\tClassAd \t*current=NULL;\n\tExprTree\t*sigXpr = NULL;\n\tValue\t\tval;\n\tbool\t\trval;\n\n\tsig = NULL;\n\n\t\/\/ establish starting point for search\n\tif( expr == NULL ) {\n\t\t\/\/ \"attr\" and \".attr\"\n\t\tcurrent = absolute ? state.rootAd : state.curAd;\n\t} else {\n\t\t\/\/ \"expr.attr\"\n\t\trval=wantSig?expr->Evaluate(state,val,sigXpr):expr->Evaluate(state,val);\n\t\tif( !rval ) {\n\t\t\treturn( EVAL_FAIL );\n\t\t}\n\n\t\tif( val.IsUndefinedValue( ) ) {\n\t\t\tsig = sigXpr;\n\t\t\treturn( EVAL_UNDEF );\n\t\t}\n\t\tif( !val.IsClassAdValue( current ) ) {\n\t\t\tif( wantSig ) {\n\t\t\t\tif(!(sig=new AttributeReference(sigXpr,attributeStr,absolute))){\n\t\t\t\t\treturn( EVAL_FAIL );\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn( EVAL_ERROR );\n\t\t}\n\t}\n\n\tif( wantSig ) {\n\t\tsig = new AttributeReference( sigXpr, attributeStr, absolute );\n\t}\n\n\t\/\/ lookup with scope; this may side-affect state\n\treturn( current->LookupInScope( attributeStr, tree, state ) );\n}\n\n\nvoid AttributeReference::\nSetReference (ExprTree *tree, char *attrStr, bool absolut)\n{\n\tif (expr) delete expr;\n\tif (attributeStr) delete [] (attributeStr);\n\n\texpr \t\t= tree;\n\tabsolute \t= absolut;\n\tattributeStr= attrStr ? strnewp(attrStr) : 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) .NET Foundation and contributors. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include <cassert>\n#include \"trace.h\"\n#include \"pal.h\"\n#include \"utils.h\"\n#include \"fx_ver.h\"\n#include \"fx_muxer.h\"\n#include \"error_codes.h\"\n#include \"libhost.h\"\n#include \"runtime_config.h\"\n\ntypedef int(*corehost_load_fn) (const host_interface_t* init);\ntypedef int(*corehost_main_fn) (const int argc, const pal::char_t* argv[]);\ntypedef int(*corehost_main_with_output_buffer_fn) (const int argc, const pal::char_t* argv[], pal::char_t buffer[], int32_t buffer_size, int32_t* required_buffer_size);\ntypedef int(*corehost_unload_fn) ();\n\nint load_host_library_common(\n const pal::string_t& lib_dir,\n pal::string_t& host_path,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_unload_fn* unload_fn)\n{\n if (!library_exists_in_dir(lib_dir, LIBHOSTPOLICY_NAME, &host_path))\n {\n return StatusCode::CoreHostLibMissingFailure;\n }\n\n \/\/ Load library\n if (!pal::load_library(&host_path, h_host))\n {\n trace::info(_X(\"Load library of %s failed\"), host_path.c_str());\n return StatusCode::CoreHostLibLoadFailure;\n }\n\n \/\/ Obtain entrypoint symbols\n *load_fn = (corehost_load_fn)pal::get_symbol(*h_host, \"corehost_load\");\n *unload_fn = (corehost_unload_fn)pal::get_symbol(*h_host, \"corehost_unload\");\n\n return (*load_fn) && (*unload_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint load_host_library(\n const pal::string_t& lib_dir,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_main_fn* main_fn,\n corehost_unload_fn* unload_fn)\n{\n pal::string_t host_path;\n int rc = load_host_library_common(lib_dir, host_path, h_host, load_fn, unload_fn);\n if (rc != StatusCode::Success)\n {\n return rc;\n }\n\n \/\/ Obtain entrypoint symbol\n *main_fn = (corehost_main_fn)pal::get_symbol(*h_host, \"corehost_main\");\n\n return (*main_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint load_host_library_with_return(\n const pal::string_t& lib_dir,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_main_with_output_buffer_fn* main_fn,\n corehost_unload_fn* unload_fn)\n{\n pal::string_t host_path;\n int rc = load_host_library_common(lib_dir, host_path, h_host, load_fn, unload_fn);\n if (rc != StatusCode::Success)\n {\n return rc;\n }\n\n \/\/ Obtain entrypoint symbol\n *main_fn = (corehost_main_with_output_buffer_fn)pal::get_symbol(*h_host, \"corehost_main_with_output_buffer\");\n\n return (*main_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint execute_app(\n const pal::string_t& impl_dll_dir,\n corehost_init_t* init,\n const int argc,\n const pal::char_t* argv[])\n{\n pal::dll_t corehost;\n corehost_main_fn host_main = nullptr;\n corehost_load_fn host_load = nullptr;\n corehost_unload_fn host_unload = nullptr;\n\n int code = load_host_library(impl_dll_dir, &corehost, &host_load, &host_main, &host_unload);\n if (code != StatusCode::Success)\n {\n trace::error(_X(\"An error occurred while loading required library %s from [%s]\"), LIBHOSTPOLICY_NAME, impl_dll_dir.c_str());\n return code;\n }\n\n \/\/ Previous hostfxr trace messages must be printed before calling trace::setup in hostpolicy\n trace::flush();\n\n const host_interface_t& intf = init->get_host_init_data();\n if ((code = host_load(&intf)) == 0)\n {\n code = host_main(argc, argv);\n (void)host_unload();\n }\n\n pal::unload_library(corehost);\n\n return code;\n}\n\nint execute_host_command(\n const pal::string_t& impl_dll_dir,\n corehost_init_t* init,\n const int argc,\n const pal::char_t* argv[],\n pal::char_t result_buffer[],\n int32_t buffer_size,\n int32_t* required_buffer_size)\n{\n pal::dll_t corehost;\n corehost_main_with_output_buffer_fn host_main = nullptr;\n corehost_load_fn host_load = nullptr;\n corehost_unload_fn host_unload = nullptr;\n\n int code = load_host_library_with_return(impl_dll_dir, &corehost, &host_load, &host_main, &host_unload);\n\n if (code != StatusCode::Success)\n {\n trace::error(_X(\"An error occurred while loading required library %s from [%s] for a host command\"), LIBHOSTPOLICY_NAME, impl_dll_dir.c_str());\n return code;\n }\n\n \/\/ Previous hostfxr trace messages must be printed before calling trace::setup in hostpolicy\n trace::flush();\n\n const host_interface_t& intf = init->get_host_init_data();\n if ((code = host_load(&intf)) == 0)\n {\n code = host_main(argc, argv, result_buffer, buffer_size, required_buffer_size);\n (void)host_unload();\n }\n\n pal::unload_library(corehost);\n\n return code;\n}\n\nSHARED_API int hostfxr_main(const int argc, const pal::char_t* argv[])\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr [commit hash: %s] main\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n fx_muxer_t muxer;\n return muxer.execute(pal::string_t(), argc, argv, nullptr, 0, nullptr);\n}\n\n\/\/\n\/\/ Determines the directory location of the SDK accounting for\n\/\/ global.json and multi-level lookup policy.\n\/\/\n\/\/ Invoked via MSBuild SDK resolver to locate SDK props and targets\n\/\/ from an msbuild other than the one bundled by the CLI.\n\/\/\n\/\/ Parameters:\n\/\/ exe_dir\n\/\/ The main directory where SDKs are located in sdk\\[version]\n\/\/ sub-folders. Pass the directory of a dotnet executable to\n\/\/ mimic how that executable would search in its own directory.\n\/\/ It is also valid to pass nullptr or empty, in which case\n\/\/ multi-level lookup can still search other locations if \n\/\/ it has not been disabled by the user's environment.\n\/\/\n\/\/ working_dir\n\/\/ The directory where the search for global.json (which can\n\/\/ control the resolved SDK version) starts and proceeds\n\/\/ upwards. \n\/\/\n\/\/ buffer\n\/\/ The buffer where the resolved SDK path will be written.\n\/\/\n\/\/ buffer_size\n\/\/ The size of the buffer argument in pal::char_t units.\n\/\/\n\/\/ Return value:\n\/\/ <0 - Invalid argument\n\/\/ 0 - SDK could not be found.\n\/\/ >0 - The number of characters (including null terminator)\n\/\/ required to store the located SDK.\n\/\/\n\/\/ If resolution succeeds and the positive return value is less than\n\/\/ or equal to buffer_size (i.e. the the buffer is large enough),\n\/\/ then the resolved SDK path is copied to the buffer and null\n\/\/ terminated. Otherwise, no data is written to the buffer.\n\/\/\n\/\/ String encoding:\n\/\/ Windows - UTF-16 (pal::char_t is 2 byte wchar_t)\n\/\/ Unix - UTF-8 (pal::char_t is 1 byte char)\n\/\/\nSHARED_API int32_t hostfxr_resolve_sdk(\n const pal::char_t* exe_dir,\n const pal::char_t* working_dir,\n pal::char_t buffer[],\n int32_t buffer_size)\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr [commit hash: %s] hostfxr_resolve_sdk\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n if (buffer_size < 0 || (buffer_size > 0 && buffer == nullptr))\n {\n trace::error(_X(\"hostfxr_resolve_sdk received an invalid argument.\"));\n return -1;\n }\n\n if (exe_dir == nullptr)\n {\n exe_dir = _X(\"\");\n }\n\n if (working_dir == nullptr)\n {\n working_dir = _X(\"\");\n }\n\n pal::string_t cli_sdk;\n if (!fx_muxer_t::resolve_sdk_dotnet_path(exe_dir, working_dir, &cli_sdk))\n {\n \/\/ fx_muxer_t::resolve_sdk_dotnet_path handles tracing for this error case.\n return 0;\n }\n\n if (cli_sdk.size() < buffer_size)\n {\n size_t length = cli_sdk.copy(buffer, buffer_size - 1);\n assert(length == cli_sdk.size());\n assert(length < buffer_size);\n buffer[length] = 0;\n }\n else\n {\n trace::info(_X(\"hostfxr_resolve_sdk received a buffer that is too small to hold the located SDK path.\"));\n }\n\n return cli_sdk.size() + 1;\n}\n\n\/\/\n\/\/ Returns the native directories of the runtime based upon\n\/\/ the specified app.\n\/\/\n\/\/ Returned format is a list of paths separated by PATH_SEPARATOR\n\/\/ which is a semicolon (;) on Windows and a colon (:) otherwise,\n\/\/\n\/\/ Invoked from ASP.NET in order to help load a native assembly\n\/\/ before the clr is initialized (through a custom host).\n\/\/\n\/\/ Parameters:\n\/\/ argc\n\/\/ The number of argv arguments\n\/\/\n\/\/ argv\n\/\/ The standard arguments normally passed to dotnet.exe\n\/\/ for launching the application.\n\/\/\n\/\/ buffer\n\/\/ The buffer where the native paths will be written.\n\/\/\n\/\/ buffer_size\n\/\/ The size of the buffer argument in pal::char_t units.\n\/\/\n\/\/ required_buffer_size\n\/\/ If the return value is HostApiBufferTooSmall, then\n\/\/ required_buffer_size is set to the minimium buffer\n\/\/ size necessary to contain the result.\n\/\/\n\/\/ Return value:\n\/\/ 0 on success, otherwise failure\n\/\/ 0x800080980 - Buffer is too small (HostApiBufferTooSmall)\n\/\/\n\/\/ String encoding:\n\/\/ Windows - UTF-16 (pal::char_t is 2 byte wchar_t)\n\/\/ Unix - UTF-8 (pal::char_t is 1 byte char)\n\/\/\nSHARED_API int32_t hostfxr_get_native_search_directories(const int argc, const pal::char_t* argv[], pal::char_t buffer[], int32_t buffer_size, int32_t* required_buffer_size)\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr_get_native_search_directories [commit hash: %s] main\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n if (buffer_size < 0 || (buffer_size > 0 && buffer == nullptr) || required_buffer_size == nullptr)\n {\n trace::error(_X(\"hostfxr_get_native_search_directories received an invalid argument.\"));\n return InvalidArgFailure;\n }\n\n fx_muxer_t muxer;\n int rc = muxer.execute(_X(\"get-native-search-directories\"), argc, argv, buffer, buffer_size, required_buffer_size);\n return rc;\n}\n<commit_msg>Update doc for hostfxr_get_native_search_directories (#3666)<commit_after>\/\/ Copyright (c) .NET Foundation and contributors. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include <cassert>\n#include \"trace.h\"\n#include \"pal.h\"\n#include \"utils.h\"\n#include \"fx_ver.h\"\n#include \"fx_muxer.h\"\n#include \"error_codes.h\"\n#include \"libhost.h\"\n#include \"runtime_config.h\"\n\ntypedef int(*corehost_load_fn) (const host_interface_t* init);\ntypedef int(*corehost_main_fn) (const int argc, const pal::char_t* argv[]);\ntypedef int(*corehost_main_with_output_buffer_fn) (const int argc, const pal::char_t* argv[], pal::char_t buffer[], int32_t buffer_size, int32_t* required_buffer_size);\ntypedef int(*corehost_unload_fn) ();\n\nint load_host_library_common(\n const pal::string_t& lib_dir,\n pal::string_t& host_path,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_unload_fn* unload_fn)\n{\n if (!library_exists_in_dir(lib_dir, LIBHOSTPOLICY_NAME, &host_path))\n {\n return StatusCode::CoreHostLibMissingFailure;\n }\n\n \/\/ Load library\n if (!pal::load_library(&host_path, h_host))\n {\n trace::info(_X(\"Load library of %s failed\"), host_path.c_str());\n return StatusCode::CoreHostLibLoadFailure;\n }\n\n \/\/ Obtain entrypoint symbols\n *load_fn = (corehost_load_fn)pal::get_symbol(*h_host, \"corehost_load\");\n *unload_fn = (corehost_unload_fn)pal::get_symbol(*h_host, \"corehost_unload\");\n\n return (*load_fn) && (*unload_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint load_host_library(\n const pal::string_t& lib_dir,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_main_fn* main_fn,\n corehost_unload_fn* unload_fn)\n{\n pal::string_t host_path;\n int rc = load_host_library_common(lib_dir, host_path, h_host, load_fn, unload_fn);\n if (rc != StatusCode::Success)\n {\n return rc;\n }\n\n \/\/ Obtain entrypoint symbol\n *main_fn = (corehost_main_fn)pal::get_symbol(*h_host, \"corehost_main\");\n\n return (*main_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint load_host_library_with_return(\n const pal::string_t& lib_dir,\n pal::dll_t* h_host,\n corehost_load_fn* load_fn,\n corehost_main_with_output_buffer_fn* main_fn,\n corehost_unload_fn* unload_fn)\n{\n pal::string_t host_path;\n int rc = load_host_library_common(lib_dir, host_path, h_host, load_fn, unload_fn);\n if (rc != StatusCode::Success)\n {\n return rc;\n }\n\n \/\/ Obtain entrypoint symbol\n *main_fn = (corehost_main_with_output_buffer_fn)pal::get_symbol(*h_host, \"corehost_main_with_output_buffer\");\n\n return (*main_fn)\n ? StatusCode::Success\n : StatusCode::CoreHostEntryPointFailure;\n}\n\nint execute_app(\n const pal::string_t& impl_dll_dir,\n corehost_init_t* init,\n const int argc,\n const pal::char_t* argv[])\n{\n pal::dll_t corehost;\n corehost_main_fn host_main = nullptr;\n corehost_load_fn host_load = nullptr;\n corehost_unload_fn host_unload = nullptr;\n\n int code = load_host_library(impl_dll_dir, &corehost, &host_load, &host_main, &host_unload);\n if (code != StatusCode::Success)\n {\n trace::error(_X(\"An error occurred while loading required library %s from [%s]\"), LIBHOSTPOLICY_NAME, impl_dll_dir.c_str());\n return code;\n }\n\n \/\/ Previous hostfxr trace messages must be printed before calling trace::setup in hostpolicy\n trace::flush();\n\n const host_interface_t& intf = init->get_host_init_data();\n if ((code = host_load(&intf)) == 0)\n {\n code = host_main(argc, argv);\n (void)host_unload();\n }\n\n pal::unload_library(corehost);\n\n return code;\n}\n\nint execute_host_command(\n const pal::string_t& impl_dll_dir,\n corehost_init_t* init,\n const int argc,\n const pal::char_t* argv[],\n pal::char_t result_buffer[],\n int32_t buffer_size,\n int32_t* required_buffer_size)\n{\n pal::dll_t corehost;\n corehost_main_with_output_buffer_fn host_main = nullptr;\n corehost_load_fn host_load = nullptr;\n corehost_unload_fn host_unload = nullptr;\n\n int code = load_host_library_with_return(impl_dll_dir, &corehost, &host_load, &host_main, &host_unload);\n\n if (code != StatusCode::Success)\n {\n trace::error(_X(\"An error occurred while loading required library %s from [%s] for a host command\"), LIBHOSTPOLICY_NAME, impl_dll_dir.c_str());\n return code;\n }\n\n \/\/ Previous hostfxr trace messages must be printed before calling trace::setup in hostpolicy\n trace::flush();\n\n const host_interface_t& intf = init->get_host_init_data();\n if ((code = host_load(&intf)) == 0)\n {\n code = host_main(argc, argv, result_buffer, buffer_size, required_buffer_size);\n (void)host_unload();\n }\n\n pal::unload_library(corehost);\n\n return code;\n}\n\nSHARED_API int hostfxr_main(const int argc, const pal::char_t* argv[])\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr [commit hash: %s] main\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n fx_muxer_t muxer;\n return muxer.execute(pal::string_t(), argc, argv, nullptr, 0, nullptr);\n}\n\n\/\/\n\/\/ Determines the directory location of the SDK accounting for\n\/\/ global.json and multi-level lookup policy.\n\/\/\n\/\/ Invoked via MSBuild SDK resolver to locate SDK props and targets\n\/\/ from an msbuild other than the one bundled by the CLI.\n\/\/\n\/\/ Parameters:\n\/\/ exe_dir\n\/\/ The main directory where SDKs are located in sdk\\[version]\n\/\/ sub-folders. Pass the directory of a dotnet executable to\n\/\/ mimic how that executable would search in its own directory.\n\/\/ It is also valid to pass nullptr or empty, in which case\n\/\/ multi-level lookup can still search other locations if \n\/\/ it has not been disabled by the user's environment.\n\/\/\n\/\/ working_dir\n\/\/ The directory where the search for global.json (which can\n\/\/ control the resolved SDK version) starts and proceeds\n\/\/ upwards. \n\/\/\n\/\/ buffer\n\/\/ The buffer where the resolved SDK path will be written.\n\/\/\n\/\/ buffer_size\n\/\/ The size of the buffer argument in pal::char_t units.\n\/\/\n\/\/ Return value:\n\/\/ <0 - Invalid argument\n\/\/ 0 - SDK could not be found.\n\/\/ >0 - The number of characters (including null terminator)\n\/\/ required to store the located SDK.\n\/\/\n\/\/ If resolution succeeds and the positive return value is less than\n\/\/ or equal to buffer_size (i.e. the the buffer is large enough),\n\/\/ then the resolved SDK path is copied to the buffer and null\n\/\/ terminated. Otherwise, no data is written to the buffer.\n\/\/\n\/\/ String encoding:\n\/\/ Windows - UTF-16 (pal::char_t is 2 byte wchar_t)\n\/\/ Unix - UTF-8 (pal::char_t is 1 byte char)\n\/\/\nSHARED_API int32_t hostfxr_resolve_sdk(\n const pal::char_t* exe_dir,\n const pal::char_t* working_dir,\n pal::char_t buffer[],\n int32_t buffer_size)\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr [commit hash: %s] hostfxr_resolve_sdk\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n if (buffer_size < 0 || (buffer_size > 0 && buffer == nullptr))\n {\n trace::error(_X(\"hostfxr_resolve_sdk received an invalid argument.\"));\n return -1;\n }\n\n if (exe_dir == nullptr)\n {\n exe_dir = _X(\"\");\n }\n\n if (working_dir == nullptr)\n {\n working_dir = _X(\"\");\n }\n\n pal::string_t cli_sdk;\n if (!fx_muxer_t::resolve_sdk_dotnet_path(exe_dir, working_dir, &cli_sdk))\n {\n \/\/ fx_muxer_t::resolve_sdk_dotnet_path handles tracing for this error case.\n return 0;\n }\n\n if (cli_sdk.size() < buffer_size)\n {\n size_t length = cli_sdk.copy(buffer, buffer_size - 1);\n assert(length == cli_sdk.size());\n assert(length < buffer_size);\n buffer[length] = 0;\n }\n else\n {\n trace::info(_X(\"hostfxr_resolve_sdk received a buffer that is too small to hold the located SDK path.\"));\n }\n\n return cli_sdk.size() + 1;\n}\n\n\/\/\n\/\/ Returns the native directories of the runtime based upon\n\/\/ the specified app.\n\/\/\n\/\/ Returned format is a list of paths separated by PATH_SEPARATOR\n\/\/ which is a semicolon (;) on Windows and a colon (:) otherwise.\n\/\/ The returned string is null-terminated.\n\/\/\n\/\/ Invoked from ASP.NET in order to help load a native assembly\n\/\/ before the clr is initialized (through a custom host).\n\/\/\n\/\/ Parameters:\n\/\/ argc\n\/\/ The number of argv arguments\n\/\/\n\/\/ argv\n\/\/ The standard arguments normally passed to dotnet.exe\n\/\/ for launching the application.\n\/\/\n\/\/ buffer\n\/\/ The buffer where the native paths and null terminator\n\/\/ will be written.\n\/\/\n\/\/ buffer_size\n\/\/ The size of the buffer argument in pal::char_t units.\n\/\/\n\/\/ required_buffer_size\n\/\/ If the return value is HostApiBufferTooSmall, then\n\/\/ required_buffer_size is set to the minimium buffer\n\/\/ size necessary to contain the result including the\n\/\/ null terminator.\n\/\/\n\/\/ Return value:\n\/\/ 0 on success, otherwise failure\n\/\/ 0x800080980 - Buffer is too small (HostApiBufferTooSmall)\n\/\/\n\/\/ String encoding:\n\/\/ Windows - UTF-16 (pal::char_t is 2 byte wchar_t)\n\/\/ Unix - UTF-8 (pal::char_t is 1 byte char)\n\/\/\nSHARED_API int32_t hostfxr_get_native_search_directories(const int argc, const pal::char_t* argv[], pal::char_t buffer[], int32_t buffer_size, int32_t* required_buffer_size)\n{\n trace::setup();\n\n trace::info(_X(\"--- Invoked hostfxr_get_native_search_directories [commit hash: %s] main\"), _STRINGIFY(REPO_COMMIT_HASH));\n\n if (buffer_size < 0 || (buffer_size > 0 && buffer == nullptr) || required_buffer_size == nullptr)\n {\n trace::error(_X(\"hostfxr_get_native_search_directories received an invalid argument.\"));\n return InvalidArgFailure;\n }\n\n fx_muxer_t muxer;\n int rc = muxer.execute(_X(\"get-native-search-directories\"), argc, argv, buffer, buffer_size, required_buffer_size);\n return rc;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fastuidraw\/tessellated_path: doxytag fix<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fix an unbelievably old typo in llkeyboardmacosx.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2012, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the copyright holder(s) nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n\n#include <sensor_msgs\/PointCloud2.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n#include <pcl\/filters\/radius_outlier_removal.h>\n#include <pcl\/filters\/statistical_outlier_removal.h>\n\nusing namespace pcl;\nusing namespace pcl::io;\nusing namespace pcl::console;\n\nstd::string default_method = \"radius\";\n\nint default_mean_k = 2;\ndouble default_std_dev_mul = 0.0;\nint default_negative = 1;\n\ndouble default_radius = 0.0;\nint default_min_pts = 0;\n\nvoid\nprintHelp (int, char **argv)\n{\n print_error (\"Syntax is: %s input.pcd output.pcd <options>\\n\", argv[0]);\n print_info (\" where options are:\\n\");\n print_info (\" -method X = the outlier removal method to be used (options: radius \/ statistical) (default: \");\n print_value (\"%s\", default_method.c_str ()); print_info (\")\\n\");\n print_info (\" -radius X = (RadiusOutlierRemoval) the sphere radius used for determining the k-nearest neighbors (default: \");\n print_value (\"%d\", default_min_pts); print_info (\")\\n\");\n print_info (\" -min_pts X = (RadiusOutlierRemoval) the minimum number of neighbors that a point needs to have in the given search radius in order to be considered an inlier (default: \");\n print_value (\"%d\", default_min_pts); print_info (\")\\n\");\n print_info (\" -mean_k X = (StatisticalOutlierRemoval only) the number of points to use for mean distance estimation (default: \");\n print_value (\"%d\", default_mean_k); print_info (\")\\n\");\n print_info (\" -std_dev_mul X = (StatisticalOutlierRemoval only) the standard deviation multiplier threshold (default: \");\n print_value (\"%f\", default_std_dev_mul); print_info (\")\\n\");\n print_info (\" -inliers X = (StatisticalOutlierRemoval only) decides whether the inliers should be returned (1), or the outliers (0). (default: \");\n print_value (\"%d\", default_negative); print_info (\")\\n\");\n print_info (\" -keep_organized = keep the filtered points in organized format.\\n\");\n}\n\nbool\nloadCloud (const std::string &filename, sensor_msgs::PointCloud2 &cloud)\n{\n TicToc tt;\n print_highlight (\"Loading \"); print_value (\"%s \", filename.c_str ());\n\n tt.tic ();\n if (loadPCDFile (filename, cloud) < 0)\n return (false);\n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", cloud.width * cloud.height); print_info (\" points]\\n\");\n print_info (\"Available dimensions: \"); print_value (\"%s\\n\", pcl::getFieldsList (cloud).c_str ());\n\n return (true);\n}\n\nvoid\ncompute (const sensor_msgs::PointCloud2::ConstPtr &input, sensor_msgs::PointCloud2 &output,\n std::string method,\n int min_pts, double radius,\n int mean_k, double std_dev_mul, bool negative, bool keep_organized)\n{\n\n PointCloud<PointXYZ>::Ptr xyz_cloud_pre (new pcl::PointCloud<PointXYZ> ()),\n xyz_cloud (new pcl::PointCloud<PointXYZ> ());\n fromROSMsg (*input, *xyz_cloud_pre);\n\n if (!keep_organized)\n {\n std::vector<int> index_vector;\n removeNaNFromPointCloud<PointXYZ> (*xyz_cloud_pre, *xyz_cloud, index_vector);\n }\n\n xyz_cloud = xyz_cloud_pre;\n \n TicToc tt;\n tt.tic ();\n PointCloud<PointXYZ>::Ptr xyz_cloud_filtered (new PointCloud<PointXYZ> ());\n if (method == \"statistical\")\n {\n StatisticalOutlierRemoval<PointXYZ> filter;\n filter.setInputCloud (xyz_cloud);\n filter.setMeanK (mean_k);\n filter.setStddevMulThresh (std_dev_mul);\n filter.setNegative (negative);\n filter.setKeepOrganized (keep_organized);\n PCL_INFO (\"Computing filtered cloud with mean_k %d, std_dev_mul %f, inliers %d\\n\", filter.getMeanK (), filter.getStddevMulThresh (), filter.getNegative ());\n filter.filter (*xyz_cloud_filtered);\n }\n else if (method == \"radius\")\n {\n RadiusOutlierRemoval<PointXYZ> filter;\n filter.setInputCloud (xyz_cloud);\n filter.setRadiusSearch (radius);\n filter.setMinNeighborsInRadius (min_pts);\n filter.setKeepOrganized (keep_organized);\n PCL_INFO (\"Computing filtered cloud with radius %f, min_pts %d\\n\", radius, min_pts);\n filter.filter (*xyz_cloud_filtered);\n }\n else\n {\n PCL_ERROR (\"%s is not a valid filter name! Quitting!\\n\", method.c_str ());\n return;\n }\n \n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", xyz_cloud_filtered->width * xyz_cloud_filtered->height); print_info (\" points]\\n\");\n\n toROSMsg (*xyz_cloud_filtered, output);\n}\n\nvoid\nsaveCloud (const std::string &filename, const sensor_msgs::PointCloud2 &output)\n{\n TicToc tt;\n tt.tic ();\n\n print_highlight (\"Saving \"); print_value (\"%s \", filename.c_str ());\n\n pcl::io::savePCDFile (filename, output, Eigen::Vector4f::Zero (),\n Eigen::Quaternionf::Identity (), true);\n\n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", output.width * output.height); print_info (\" points]\\n\");\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n print_info (\"Statistical Outlier Removal filtering of a point cloud. For more information, use: %s -h\\n\", argv[0]);\n\n if (argc < 3)\n {\n printHelp (argc, argv);\n return (-1);\n }\n\n \/\/ Parse the command line arguments for .pcd files\n std::vector<int> p_file_indices;\n p_file_indices = parse_file_extension_argument (argc, argv, \".pcd\");\n if (p_file_indices.size () != 2)\n {\n print_error (\"Need one input PCD file and one output PCD file to continue.\\n\");\n return (-1);\n }\n\n \/\/ Command line parsing\n std::string method = default_method;\n int min_pts = default_min_pts;\n double radius = default_radius;\n int mean_k = default_mean_k;\n double std_dev_mul = default_std_dev_mul;\n int negative = default_negative;\n \n\n parse_argument (argc, argv, \"-method\", method);\n parse_argument (argc, argv, \"-radius\", radius);\n parse_argument (argc, argv, \"-min_pts\", min_pts);\n parse_argument (argc, argv, \"-mean_k\", mean_k);\n parse_argument (argc, argv, \"-std_dev_mul\", std_dev_mul);\n parse_argument (argc, argv, \"-inliers\", negative);\n bool keep_organized = find_switch (argc, argv, \"-keep_organized\");\n\n \/\/ Load the first file\n sensor_msgs::PointCloud2::Ptr cloud (new sensor_msgs::PointCloud2);\n if (!loadCloud (argv[p_file_indices[0]], *cloud))\n return (-1);\n\n \/\/ Do the smoothing\n sensor_msgs::PointCloud2 output;\n compute (cloud, output, method, min_pts, radius, mean_k, std_dev_mul, negative, keep_organized);\n\n \/\/ Save into the second file\n saveCloud (argv[p_file_indices[1]], output);\n}\n<commit_msg>enhancements for the outlier removal command line tool<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2012, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the copyright holder(s) nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\n *\/\n\n#include <sensor_msgs\/PointCloud2.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n#include <pcl\/filters\/radius_outlier_removal.h>\n#include <pcl\/filters\/statistical_outlier_removal.h>\n#include <pcl\/filters\/extract_indices.h>\n\nusing namespace pcl;\nusing namespace pcl::io;\nusing namespace pcl::console;\n\nstd::string default_method = \"radius\";\n\nint default_mean_k = 2;\ndouble default_std_dev_mul = 0.0;\nint default_negative = 0;\n\ndouble default_radius = 0.0;\nint default_min_pts = 0;\n\nvoid\nprintHelp (int, char **argv)\n{\n print_error (\"Syntax is: %s input.pcd output.pcd <options>\\n\", argv[0]);\n print_info (\" where options are:\\n\");\n print_info (\" -method X = the outlier removal method to be used (options: radius \/ statistical) (default: \");\n print_value (\"%s\", default_method.c_str ()); print_info (\")\\n\");\n print_info (\" -radius X = (RadiusOutlierRemoval) the sphere radius used for determining the k-nearest neighbors (default: \");\n print_value (\"%d\", default_min_pts); print_info (\")\\n\");\n print_info (\" -min_pts X = (RadiusOutlierRemoval) the minimum number of neighbors that a point needs to have in the given search radius in order to be considered an inlier (default: \");\n print_value (\"%d\", default_min_pts); print_info (\")\\n\");\n print_info (\" -mean_k X = (StatisticalOutlierRemoval only) the number of points to use for mean distance estimation (default: \");\n print_value (\"%d\", default_mean_k); print_info (\")\\n\");\n print_info (\" -std_dev_mul X = (StatisticalOutlierRemoval only) the standard deviation multiplier threshold (default: \");\n print_value (\"%f\", default_std_dev_mul); print_info (\")\\n\\n\");\n print_info (\" -negative X = decides whether the inliers should be returned (1), or the outliers (0). (default: \");\n print_value (\"%d\", default_negative); print_info (\")\\n\");\n print_info (\" -keep_organized = keep the filtered points in organized format.\\n\");\n}\n\nbool\nloadCloud (const std::string &filename, sensor_msgs::PointCloud2 &cloud,\n Eigen::Vector4f &translation, Eigen::Quaternionf &orientation)\n{\n TicToc tt;\n print_highlight (\"Loading \"); print_value (\"%s \", filename.c_str ());\n\n tt.tic ();\n if (loadPCDFile (filename, cloud, translation, orientation) < 0)\n return (false);\n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", cloud.width * cloud.height); print_info (\" points]\\n\");\n print_info (\"Available dimensions: \"); print_value (\"%s\\n\", pcl::getFieldsList (cloud).c_str ());\n\n return (true);\n}\n\nvoid\ncompute (const sensor_msgs::PointCloud2::ConstPtr &input, sensor_msgs::PointCloud2 &output,\n std::string method,\n int min_pts, double radius,\n int mean_k, double std_dev_mul, bool negative, bool keep_organized)\n{\n\n PointCloud<PointXYZ>::Ptr xyz_cloud_pre (new pcl::PointCloud<PointXYZ> ()),\n xyz_cloud (new pcl::PointCloud<PointXYZ> ());\n fromROSMsg (*input, *xyz_cloud_pre);\n\n pcl::PointIndices::Ptr removed_indices (new PointIndices),\n indices (new PointIndices);\n std::vector<int> valid_indices;\n if (keep_organized)\n {\n xyz_cloud = xyz_cloud_pre;\n for (int i = 0; i < int (xyz_cloud->size ()); ++i)\n valid_indices.push_back (i);\n }\n else\n removeNaNFromPointCloud<PointXYZ> (*xyz_cloud_pre, *xyz_cloud, valid_indices);\n\n TicToc tt;\n tt.tic ();\n PointCloud<PointXYZ>::Ptr xyz_cloud_filtered (new PointCloud<PointXYZ> ());\n if (method == \"statistical\")\n {\n StatisticalOutlierRemoval<PointXYZ> filter (true);\n filter.setInputCloud (xyz_cloud);\n filter.setMeanK (mean_k);\n filter.setStddevMulThresh (std_dev_mul);\n filter.setNegative (negative);\n filter.setKeepOrganized (keep_organized);\n PCL_INFO (\"Computing filtered cloud from %zu points with mean_k %d, std_dev_mul %f, inliers %d ...\", xyz_cloud->size (), filter.getMeanK (), filter.getStddevMulThresh (), filter.getNegative ());\n filter.filter (*xyz_cloud_filtered);\n \/\/ Get the indices that have been explicitly removed\n filter.getRemovedIndices (*removed_indices);\n }\n else if (method == \"radius\")\n {\n RadiusOutlierRemoval<PointXYZ> filter (true);\n filter.setInputCloud (xyz_cloud);\n filter.setRadiusSearch (radius);\n filter.setMinNeighborsInRadius (min_pts);\n filter.setNegative (negative);\n filter.setKeepOrganized (keep_organized);\n PCL_INFO (\"Computing filtered cloud from %zu points with radius %f, min_pts %d ...\", xyz_cloud->size (), radius, min_pts);\n filter.filter (*xyz_cloud_filtered);\n \/\/ Get the indices that have been explicitly removed\n filter.getRemovedIndices (*removed_indices);\n }\n else\n {\n PCL_ERROR (\"%s is not a valid filter name! Quitting!\\n\", method.c_str ());\n return;\n }\n \n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", xyz_cloud_filtered->width * xyz_cloud_filtered->height); print_info (\" points, %zu indices removed]\\n\", removed_indices->indices.size ());\n\n if (keep_organized)\n {\n sensor_msgs::PointCloud2 output_filtered;\n toROSMsg (*xyz_cloud_filtered, output_filtered);\n concatenateFields (*input, output_filtered, output);\n }\n else \n {\n \/\/ Make sure we are addressing values in the original index vector\n for (size_t i = 0; i < removed_indices->indices.size (); ++i)\n indices->indices.push_back (valid_indices[removed_indices->indices[i]]);\n\n \/\/ Extract the indices of the remaining points\n pcl::ExtractIndices<sensor_msgs::PointCloud2> ei;\n ei.setInputCloud (input);\n ei.setIndices (indices);\n ei.setNegative (true);\n ei.filter (output);\n }\n}\n\nvoid\nsaveCloud (const std::string &filename, const sensor_msgs::PointCloud2 &output,\n const Eigen::Vector4f &translation, const Eigen::Quaternionf &rotation)\n{\n TicToc tt;\n tt.tic ();\n\n print_highlight (\"Saving \"); print_value (\"%s \", filename.c_str ());\n\n PCDWriter w;\n w.writeBinaryCompressed (filename, output, translation, rotation);\n\n print_info (\"[done, \"); print_value (\"%g\", tt.toc ()); print_info (\" ms : \"); print_value (\"%d\", output.width * output.height); print_info (\" points]\\n\");\n}\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n print_info (\"Statistical Outlier Removal filtering of a point cloud. For more information, use: %s -h\\n\", argv[0]);\n\n if (argc < 3)\n {\n printHelp (argc, argv);\n return (-1);\n }\n\n \/\/ Parse the command line arguments for .pcd files\n std::vector<int> p_file_indices;\n p_file_indices = parse_file_extension_argument (argc, argv, \".pcd\");\n if (p_file_indices.size () != 2)\n {\n print_error (\"Need one input PCD file and one output PCD file to continue.\\n\");\n return (-1);\n }\n\n \/\/ Command line parsing\n std::string method = default_method;\n int min_pts = default_min_pts;\n double radius = default_radius;\n int mean_k = default_mean_k;\n double std_dev_mul = default_std_dev_mul;\n int negative = default_negative;\n \n\n parse_argument (argc, argv, \"-method\", method);\n parse_argument (argc, argv, \"-radius\", radius);\n parse_argument (argc, argv, \"-min_pts\", min_pts);\n parse_argument (argc, argv, \"-mean_k\", mean_k);\n parse_argument (argc, argv, \"-std_dev_mul\", std_dev_mul);\n parse_argument (argc, argv, \"-negative\", negative);\n bool keep_organized = find_switch (argc, argv, \"-keep_organized\");\n\n \/\/ Load the first file\n Eigen::Vector4f translation;\n Eigen::Quaternionf rotation;\n sensor_msgs::PointCloud2::Ptr cloud (new sensor_msgs::PointCloud2);\n if (!loadCloud (argv[p_file_indices[0]], *cloud, translation, rotation))\n return (-1);\n \n if (keep_organized && cloud->height == 1)\n {\n print_error (\"Point cloud dataset (%s) is not organized (height = %d), but -keep_organized requested!\\n\", argv[p_file_indices[0]], cloud->height);\n return (-1);\n }\n\n \/\/ Do the smoothing\n sensor_msgs::PointCloud2 output;\n compute (cloud, output, method, min_pts, radius, mean_k, std_dev_mul, negative, keep_organized);\n\n \/\/ Save into the second file\n saveCloud (argv[p_file_indices[1]], output, translation, rotation);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 The Crashpad Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"client\/crashpad_info.h\"\n\n#include <mach-o\/loader.h>\n\n#include \"util\/stdlib\/cxx.h\"\n\n#if CXX_LIBRARY_VERSION >= 2011\n#include <type_traits>\n#endif\n\nnamespace {\n\nstatic const uint32_t kCrashpadInfoVersion = 1;\n\n} \/\/ namespace\n\nnamespace crashpad {\n\n#if CXX_LIBRARY_VERSION >= 2011 || DOXYGEN\n\/\/ In C++11, check that CrashpadInfo has standard layout, which is what is\n\/\/ actually important.\nstatic_assert(std::is_standard_layout<CrashpadInfo>::value,\n \"CrashpadInfo must be standard layout\");\n#else\n\/\/ In C++98 (ISO 14882), section 9.5.1 says that a union cannot have a member\n\/\/ with a non-trivial ctor, copy ctor, dtor, or assignment operator. Use this\n\/\/ property to ensure that CrashpadInfo remains POD. This doesn’t work for C++11\n\/\/ because the requirements for unions have been relaxed.\nunion Compile_Assert {\n CrashpadInfo Compile_Assert__CrashpadInfo_must_be_pod;\n};\n#endif\n\n\/\/ Put the structure in __DATA,__crashpad_info where it can be easily found\n\/\/ without having to consult the symbol table. The “used” attribute prevents it\n\/\/ from being dead-stripped. This isn’t placed in an unnamed namespace:\n\/\/ hopefully, this will catch attempts to place multiple copies of this\n\/\/ structure into the same module. If that’s attempted, and the name of the\n\/\/ symbol is the same in each translation unit, it will result in a linker\n\/\/ error, which is better than having multiple structures show up.\n\/\/\n\/\/ This may result in a static module initializer in debug-mode builds, but\n\/\/ because it’s POD, no code should need to run to initialize this under\n\/\/ release-mode optimization.\n__attribute__((section(SEG_DATA \",__crashpad_info\"),\n used,\n visibility(\"hidden\"))) CrashpadInfo g_crashpad_info;\n\n\/\/ static\nCrashpadInfo* CrashpadInfo::GetCrashpadInfo() {\n return &g_crashpad_info;\n}\n\nCrashpadInfo::CrashpadInfo()\n : signature_(kSignature),\n size_(sizeof(*this)),\n version_(kCrashpadInfoVersion),\n padding_0_(0),\n simple_annotations_(nullptr) {\n}\n\nconst uint32_t CrashpadInfo::kSignature;\n\n} \/\/ namespace crashpad\n<commit_msg>win: Get client\/crashpad_info.cc to compile<commit_after>\/\/ Copyright 2014 The Crashpad Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"client\/crashpad_info.h\"\n\n#include \"build\/build_config.h\"\n#include \"util\/stdlib\/cxx.h\"\n\n#if defined(OS_MACOSX)\n#include <mach-o\/loader.h>\n#endif\n\n#if CXX_LIBRARY_VERSION >= 2011\n#include <type_traits>\n#endif\n\nnamespace {\n\nstatic const uint32_t kCrashpadInfoVersion = 1;\n\n} \/\/ namespace\n\nnamespace crashpad {\n\n#if CXX_LIBRARY_VERSION >= 2011 || DOXYGEN\n\/\/ In C++11, check that CrashpadInfo has standard layout, which is what is\n\/\/ actually important.\nstatic_assert(std::is_standard_layout<CrashpadInfo>::value,\n \"CrashpadInfo must be standard layout\");\n#else\n\/\/ In C++98 (ISO 14882), section 9.5.1 says that a union cannot have a member\n\/\/ with a non-trivial ctor, copy ctor, dtor, or assignment operator. Use this\n\/\/ property to ensure that CrashpadInfo remains POD. This doesn’t work for C++11\n\/\/ because the requirements for unions have been relaxed.\nunion Compile_Assert {\n CrashpadInfo Compile_Assert__CrashpadInfo_must_be_pod;\n};\n#endif\n\n\/\/ This structure needs to be stored somewhere that is easy to find without\n\/\/ external information.\n\/\/\n\/\/ It isn’t placed in an unnamed namespace: hopefully, this will catch attempts\n\/\/ to place multiple copies of this structure into the same module. If that’s\n\/\/ attempted, and the name of the symbol is the same in each translation unit,\n\/\/ it will result in a linker error, which is better than having multiple\n\/\/ structures show up.\n\/\/\n\/\/ This may result in a static module initializer in debug-mode builds, but\n\/\/ because it’s POD, no code should need to run to initialize this under\n\/\/ release-mode optimization.\n#if defined(OS_MACOSX)\n\n\/\/ Put the structure in __DATA,__crashpad_info where it can be easily found\n\/\/ without having to consult the symbol table. The “used” attribute prevents it\n\/\/ from being dead-stripped.\n__attribute__((section(SEG_DATA \",__crashpad_info\"),\n used,\n visibility(\"hidden\"))) CrashpadInfo g_crashpad_info;\n\n#elif defined(OS_WIN)\n\n\/\/ TODO(scottmg): Tag in a way that makes it easy to locate on Windows.\nCrashpadInfo g_crashpad_info;\n\n#endif\n\n\/\/ static\nCrashpadInfo* CrashpadInfo::GetCrashpadInfo() {\n return &g_crashpad_info;\n}\n\nCrashpadInfo::CrashpadInfo()\n : signature_(kSignature),\n size_(sizeof(*this)),\n version_(kCrashpadInfoVersion),\n padding_0_(0),\n simple_annotations_(nullptr) {\n}\n\nconst uint32_t CrashpadInfo::kSignature;\n\n} \/\/ namespace crashpad\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the CN24 semantic segmentation software,\n * copyright (C) 2015 Clemens-Alexander Brust (ikosa dot de at gmail dot com).\n *\n * For licensing information, see the LICENSE file included with this project.\n *\/ \n\n#include <cn24.h>\n\n#include <iostream>\n#include <fstream>\n\nstruct CompressedTensor {\npublic:\n unsigned int compressed_length;\n void* compressed_data;\n};\n\nconst unsigned char rl_marker = 'X';\nconst unsigned char rl_doublemarker = 'X';\nconst unsigned char rl_rle = 'Y';\nconst unsigned int rl_bytes = 1;\nconst unsigned int chars_per_datum = sizeof(Conv::datum)\/sizeof(char);\nconst unsigned int rl_max = (unsigned int)((1L << (8L * (unsigned long)rl_bytes)) - 3L);\nconst unsigned int rl_min = 1 + (5 + rl_bytes) \/ chars_per_datum;\n\nvoid Compress(const Conv::Tensor& tensor, CompressedTensor* compressed);\nunsigned int Decompress(Conv::Tensor& tensor, CompressedTensor* compressed);\n\nint main(int argc, char** argv) {\n Conv::System::Init();\n \n if(argc != 2) {\n FATAL(\"Needs exactly two arguments!\");\n }\n \n LOGINFO << \"rl_bytes: \" << rl_bytes;\n LOGINFO << \"rl_max : \" << rl_max;\n LOGINFO << \"rl_min : \" << rl_min;\n \n CompressedTensor compressed;\n std::string input_file_name(argv[1]);\n \/\/std::string output_file_name(argv[2]);\n \n std::ifstream input_tensor_stream(input_file_name);\n \/\/std::ofstream output_tensor_stream(output_file_name);\n if(!input_tensor_stream.good())\n FATAL(\"Cannot open \" << input_file_name);\n \n long uncompressed_total = 0;\n long compressed_total = 0;\n \n Conv::Tensor tensor;\n while(!input_tensor_stream.eof()) {\n tensor.Deserialize(input_tensor_stream);\n \n LOGDEBUG << \"Input tensor: \" << tensor;\n \n LOGDEBUG << \"Size: \" << tensor.elements() * sizeof(Conv::datum)\/sizeof(char);\n \n Compress(tensor, &compressed);\n LOGDEBUG << \"RLE Size: \" << compressed.compressed_length;\n unsigned int bytes_out = Decompress(tensor, &compressed);\n \n \/\/tensor.Serialize(output_tensor_stream,false);\n \n free(compressed.compressed_data);\n \n if(bytes_out != (tensor.elements() * sizeof(Conv::datum)\/sizeof(char))) {\n FATAL(\"Size mismatch! Expected: \" << (tensor.elements() * sizeof(Conv::datum)\/sizeof(char)) << \", actual: \" << bytes_out);\n }\n \n LOGINFO << \"Ratio: \" << 100.0 * (double)compressed.compressed_length \/ (double)(tensor.elements() * sizeof(Conv::datum)\/sizeof(char)) << \"%\" << std::flush;\n compressed_total += compressed.compressed_length;\n uncompressed_total += tensor.elements() * sizeof(Conv::datum)\/sizeof(char);\n \n input_tensor_stream.peek();\n }\n LOGINFO << \"Overall ratio: \" << 100.0 * (double)compressed_total \/ (double)uncompressed_total << \"%\";\n LOGINFO << \"Uncompressed: \" << uncompressed_total;\n LOGINFO << \"Compressed : \" << compressed_total;\n LOGEND;\n}\n\n\n\n\nvoid Compress(const Conv::Tensor& tensor, CompressedTensor* compressed) {\n \n unsigned int bytes_out = 0;\n \n Conv::datum last_symbol = 0;\n unsigned int running_length = 0;\n \n unsigned char* output_ptr = new unsigned char[2 * tensor.elements() * chars_per_datum];\n compressed->compressed_data = (void*)output_ptr;\n for(unsigned int pos = 0; pos <= tensor.elements(); pos++) {\n Conv::datum current_symbol;\n if(pos < tensor.elements()) {\n current_symbol = tensor.data_ptr_const()[pos];\n if(current_symbol == last_symbol) {\n \/\/ Increase running length\n running_length++;\n }\n } else {\n \/\/ Force emission of last symbol\n }\n \n \n if(\n \/\/ EOF reached\n (pos == (tensor.elements())) ||\n \/\/ Different symbol\n (current_symbol != last_symbol) ||\n \/\/ Maxmimum run length reached\n (running_length == rl_max)) {\n \n \/\/ Emit...\n if(running_length > 0 && running_length < rl_min) {\n \/\/ Emit single symbol(s)\n for(unsigned int r = 0; r < running_length; r++) {\n for(unsigned int b = 0; b < chars_per_datum; b++) {\n char char_to_emit = ((char*)&last_symbol)[b];\n if(char_to_emit == rl_marker) {\n \/\/ Emit escaped\n *output_ptr = rl_marker;\n output_ptr++; bytes_out++;\n *output_ptr = rl_doublemarker;\n output_ptr++; bytes_out++;\n } else {\n \/\/ Emit directly\n *output_ptr = char_to_emit;\n output_ptr++; bytes_out++;\n }\n }\n }\n } else if(running_length >= rl_min) {\n \/\/ Emit encoded\n *output_ptr = rl_marker;\n output_ptr++; bytes_out++;\n *output_ptr = rl_rle;\n output_ptr++; bytes_out++;\n \n \/\/ Running length output\n for(unsigned int b = 0; b < rl_bytes; b++) {\n *output_ptr = (running_length >> ((rl_bytes - (b+1)) * 8)) & 0xFF;\n output_ptr++; bytes_out++;\n }\n \n for(unsigned int b = 0; b < chars_per_datum; b++) {\n unsigned char char_to_emit = ((char*)&last_symbol)[b];\n *output_ptr = char_to_emit;\n output_ptr++; bytes_out++;\n }\n }\n \n \/\/ ...and reset\n if(running_length == rl_max)\n running_length = 0;\n else\n running_length = 1;\n }\n \n last_symbol = current_symbol;\n }\n LOGDEBUG << \"Bytes out: \" << bytes_out;\n compressed->compressed_length = bytes_out;\n \n}\n\nunsigned int Decompress(Conv::Tensor& tensor, CompressedTensor* compressed) {\n unsigned int bytes_out = 0;\n unsigned char* output_ptr = (unsigned char*)tensor.data_ptr();\n const unsigned char* input_ptr = (const unsigned char*)compressed->compressed_data;\n \n for(unsigned int pos = 0; pos < compressed->compressed_length; pos++) {\n unsigned char current_symbol = input_ptr[pos];\n if(current_symbol == rl_marker) {\n pos++; current_symbol = input_ptr[pos];\n if(current_symbol == rl_doublemarker) {\n \/\/ Emit single marker\n *output_ptr = rl_marker;\n output_ptr++; bytes_out++;\n } else if(current_symbol == rl_rle) {\n unsigned int running_length = 0;\n \n \/\/ Running length input\n for(unsigned int b = 0; b < rl_bytes; b++) {\n pos++; current_symbol = input_ptr[pos];\n running_length += current_symbol;\n if((b+1) != rl_bytes)\n running_length <<= 8;\n }\n \n for(unsigned int r = 0; r < running_length; r++) {\n for(unsigned int b = 0; b < chars_per_datum; b++) {\n pos++; current_symbol = input_ptr[pos];\n *output_ptr = current_symbol;\n output_ptr++; bytes_out++;\n }\n pos -= chars_per_datum;\n }\n pos += chars_per_datum;\n } else {\n FATAL(\"Incorrect encoding!\");\n }\n } else {\n \/\/ Emit directly\n *output_ptr = current_symbol;\n output_ptr++; bytes_out++;\n }\n }\n LOGDEBUG << \"Bytes out: \" << bytes_out;\n return bytes_out;\n}<commit_msg>testCompression: Now serializes a compressed TensorStream<commit_after>\/*\n * This file is part of the CN24 semantic segmentation software,\n * copyright (C) 2015 Clemens-Alexander Brust (ikosa dot de at gmail dot com).\n *\n * For licensing information, see the LICENSE file included with this project.\n *\/ \n\n#include <cn24.h>\n\n#include <iostream>\n#include <fstream>\n\nint main(int argc, char** argv) {\n Conv::System::Init();\n \n if(argc != 3) {\n FATAL(\"Needs exactly two arguments\");\n }\n \n std::string input_file_name(argv[1]);\n std::string output_file_name(argv[2]);\n \n std::ifstream input_tensor_stream(input_file_name, std::ios::in | std::ios::binary);\n std::ofstream output_tensor_stream(output_file_name, std::ios::out | std::ios::binary);\n \n if(!input_tensor_stream.good())\n FATAL(\"Cannot open \" << input_file_name);\n \n if(!output_tensor_stream.good())\n FATAL(\"Cannot open \" << output_file_name);\n \n long uncompressed_total = 0;\n long compressed_total = 0;\n \n Conv::Tensor tensor;\n while(!input_tensor_stream.eof()) {\n tensor.Deserialize(input_tensor_stream);\n \n LOGDEBUG << \"Input tensor: \" << tensor;\n \n unsigned int original_size = tensor.elements() * sizeof(Conv::datum)\/sizeof(char);\n LOGDEBUG << \"Size: \" << original_size;\n \n Conv::CompressedTensor ctensor;\n ctensor.Compress(tensor);\n \n ctensor.Serialize(output_tensor_stream);\n \n LOGDEBUG << \"RLE Size: \" << ctensor.compressed_length();\n \n ctensor.Decompress(tensor);\n unsigned int bytes_out = tensor.elements() * sizeof(Conv::datum)\/sizeof(char);\n \n if(bytes_out != original_size) {\n FATAL(\"Size mismatch! Expected: \" << (tensor.elements() * sizeof(Conv::datum)\/sizeof(char)) << \", actual: \" << bytes_out);\n }\n \n LOGINFO << \"Ratio: \" << 100.0 * (double)ctensor.compressed_length() \/ (double)(tensor.elements() * sizeof(Conv::datum)\/sizeof(char)) << \"%\" << std::flush;\n compressed_total += ctensor.compressed_length();\n uncompressed_total += tensor.elements() * sizeof(Conv::datum)\/sizeof(char);\n \n input_tensor_stream.peek();\n }\n LOGINFO << \"Overall ratio: \" << 100.0 * (double)compressed_total \/ (double)uncompressed_total << \"%\";\n LOGINFO << \"Uncompressed: \" << uncompressed_total;\n LOGINFO << \"Compressed : \" << compressed_total;\n LOGEND;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/debug\/leak_annotations.h\"\n#include \"content\/common\/frame_messages.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/test\/frame_load_waiter.h\"\n#include \"content\/public\/test\/render_view_test.h\"\n#include \"content\/public\/test\/test_utils.h\"\n#include \"content\/renderer\/render_frame_impl.h\"\n#include \"content\/renderer\/render_view_impl.h\"\n#include \"content\/test\/fake_compositor_dependencies.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebURLRequest.h\"\n#include \"third_party\/WebKit\/public\/web\/WebLocalFrame.h\"\n\nnamespace {\nconst int32 kSubframeRouteId = 20;\nconst int32 kSubframeWidgetRouteId = 21;\nconst int32 kFrameProxyRouteId = 22;\nconst int32 kSubframeSurfaceId = 43;\n} \/\/ namespace\n\nnamespace content {\n\n\/\/ RenderFrameImplTest creates a RenderFrameImpl that is a child of the\n\/\/ main frame, and has its own RenderWidget. This behaves like an out\n\/\/ of process frame even though it is in the same process as its parent.\nclass RenderFrameImplTest : public RenderViewTest {\n public:\n ~RenderFrameImplTest() override {}\n\n void SetUp() override {\n RenderViewTest::SetUp();\n EXPECT_FALSE(static_cast<RenderFrameImpl*>(view_->GetMainRenderFrame())\n ->is_subframe_);\n\n FrameMsg_NewFrame_WidgetParams widget_params;\n widget_params.routing_id = kSubframeWidgetRouteId;\n widget_params.surface_id = kSubframeSurfaceId;\n widget_params.hidden = false;\n\n IsolateAllSitesForTesting(base::CommandLine::ForCurrentProcess());\n\n LoadHTML(\"Parent frame <iframe name='frame'><\/iframe>\");\n\n RenderFrameImpl::FromWebFrame(\n view_->GetMainRenderFrame()->GetWebFrame()->firstChild())\n ->OnSwapOut(kFrameProxyRouteId, false, FrameReplicationState());\n\n RenderFrameImpl::CreateFrame(kSubframeRouteId, kFrameProxyRouteId,\n MSG_ROUTING_NONE, MSG_ROUTING_NONE,\n FrameReplicationState(), &compositor_deps_,\n widget_params);\n\n frame_ = RenderFrameImpl::FromRoutingID(kSubframeRouteId);\n EXPECT_TRUE(frame_->is_subframe_);\n }\n\n void TearDown() override {\n#if defined(LEAK_SANITIZER)\n \/\/ Do this before shutting down V8 in RenderViewTest::TearDown().\n \/\/ http:\/\/crbug.com\/328552\n __lsan_do_leak_check();\n#endif\n RenderViewTest::TearDown();\n }\n\n RenderFrameImpl* frame() { return frame_; }\n\n content::RenderWidget* frame_widget() const {\n return frame_->render_widget_.get();\n }\n\n private:\n RenderFrameImpl* frame_;\n FakeCompositorDependencies compositor_deps_;\n};\n\nclass RenderFrameTestObserver : public RenderFrameObserver {\n public:\n explicit RenderFrameTestObserver(RenderFrame* render_frame)\n : RenderFrameObserver(render_frame), visible_(false) {}\n\n ~RenderFrameTestObserver() override {}\n\n void WasShown() override { visible_ = true; }\n void WasHidden() override { visible_ = false; }\n\n bool visible() { return visible_; }\n\n private:\n bool visible_;\n};\n\n#if defined(OS_ANDROID)\n\/\/ See https:\/\/crbug.com\/472717\n#define MAYBE_SubframeWidget DISABLED_SubframeWidget\n#define MAYBE_FrameResize DISABLED_FrameResize\n#define MAYBE_FrameWasShown DISABLED_FrameWasShown\n#else\n#define MAYBE_SubframeWidget SubframeWidget\n#define MAYBE_FrameResize FrameResize\n#define MAYBE_FrameWasShown FrameWasShown\n#endif\n\n\/\/ Verify that a frame with a RenderFrameProxy as a parent has its own\n\/\/ RenderWidget.\nTEST_F(RenderFrameImplTest, MAYBE_SubframeWidget) {\n EXPECT_TRUE(frame_widget());\n EXPECT_NE(frame_widget(), (content::RenderWidget*)view_);\n}\n\n\/\/ Verify a subframe RenderWidget properly processes its viewport being\n\/\/ resized.\nTEST_F(RenderFrameImplTest, MAYBE_FrameResize) {\n ViewMsg_Resize_Params resize_params;\n gfx::Size size(200, 200);\n resize_params.screen_info = blink::WebScreenInfo();\n resize_params.new_size = size;\n resize_params.physical_backing_size = size;\n resize_params.top_controls_height = 0.f;\n resize_params.top_controls_shrink_blink_size = false;\n resize_params.resizer_rect = gfx::Rect();\n resize_params.is_fullscreen_granted = false;\n\n ViewMsg_Resize resize_message(0, resize_params);\n frame_widget()->OnMessageReceived(resize_message);\n\n EXPECT_EQ(frame_widget()->webwidget()->size(), blink::WebSize(size));\n}\n\n\/\/ Verify a subframe RenderWidget properly processes a WasShown message.\nTEST_F(RenderFrameImplTest, MAYBE_FrameWasShown) {\n RenderFrameTestObserver observer(frame());\n\n ViewMsg_WasShown was_shown_message(0, true, ui::LatencyInfo());\n frame_widget()->OnMessageReceived(was_shown_message);\n\n EXPECT_FALSE(frame_widget()->is_hidden());\n EXPECT_TRUE(observer.visible());\n}\n\n} \/\/ namespace\n<commit_msg>Fix invalid C-style cast in RenderFrameImplTest.<commit_after>\/\/ Copyright 2015 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/command_line.h\"\n#include \"base\/debug\/leak_annotations.h\"\n#include \"content\/common\/frame_messages.h\"\n#include \"content\/common\/view_messages.h\"\n#include \"content\/public\/test\/frame_load_waiter.h\"\n#include \"content\/public\/test\/render_view_test.h\"\n#include \"content\/public\/test\/test_utils.h\"\n#include \"content\/renderer\/render_frame_impl.h\"\n#include \"content\/renderer\/render_view_impl.h\"\n#include \"content\/test\/fake_compositor_dependencies.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/WebKit\/public\/platform\/WebURLRequest.h\"\n#include \"third_party\/WebKit\/public\/web\/WebLocalFrame.h\"\n\nnamespace {\nconst int32 kSubframeRouteId = 20;\nconst int32 kSubframeWidgetRouteId = 21;\nconst int32 kFrameProxyRouteId = 22;\nconst int32 kSubframeSurfaceId = 43;\n} \/\/ namespace\n\nnamespace content {\n\n\/\/ RenderFrameImplTest creates a RenderFrameImpl that is a child of the\n\/\/ main frame, and has its own RenderWidget. This behaves like an out\n\/\/ of process frame even though it is in the same process as its parent.\nclass RenderFrameImplTest : public RenderViewTest {\n public:\n ~RenderFrameImplTest() override {}\n\n void SetUp() override {\n RenderViewTest::SetUp();\n EXPECT_FALSE(static_cast<RenderFrameImpl*>(view_->GetMainRenderFrame())\n ->is_subframe_);\n\n FrameMsg_NewFrame_WidgetParams widget_params;\n widget_params.routing_id = kSubframeWidgetRouteId;\n widget_params.surface_id = kSubframeSurfaceId;\n widget_params.hidden = false;\n\n IsolateAllSitesForTesting(base::CommandLine::ForCurrentProcess());\n\n LoadHTML(\"Parent frame <iframe name='frame'><\/iframe>\");\n\n RenderFrameImpl::FromWebFrame(\n view_->GetMainRenderFrame()->GetWebFrame()->firstChild())\n ->OnSwapOut(kFrameProxyRouteId, false, FrameReplicationState());\n\n RenderFrameImpl::CreateFrame(kSubframeRouteId, kFrameProxyRouteId,\n MSG_ROUTING_NONE, MSG_ROUTING_NONE,\n FrameReplicationState(), &compositor_deps_,\n widget_params);\n\n frame_ = RenderFrameImpl::FromRoutingID(kSubframeRouteId);\n EXPECT_TRUE(frame_->is_subframe_);\n }\n\n void TearDown() override {\n#if defined(LEAK_SANITIZER)\n \/\/ Do this before shutting down V8 in RenderViewTest::TearDown().\n \/\/ http:\/\/crbug.com\/328552\n __lsan_do_leak_check();\n#endif\n RenderViewTest::TearDown();\n }\n\n RenderFrameImpl* frame() { return frame_; }\n\n content::RenderWidget* frame_widget() const {\n return frame_->render_widget_.get();\n }\n\n private:\n RenderFrameImpl* frame_;\n FakeCompositorDependencies compositor_deps_;\n};\n\nclass RenderFrameTestObserver : public RenderFrameObserver {\n public:\n explicit RenderFrameTestObserver(RenderFrame* render_frame)\n : RenderFrameObserver(render_frame), visible_(false) {}\n\n ~RenderFrameTestObserver() override {}\n\n void WasShown() override { visible_ = true; }\n void WasHidden() override { visible_ = false; }\n\n bool visible() { return visible_; }\n\n private:\n bool visible_;\n};\n\n#if defined(OS_ANDROID)\n\/\/ See https:\/\/crbug.com\/472717\n#define MAYBE_SubframeWidget DISABLED_SubframeWidget\n#define MAYBE_FrameResize DISABLED_FrameResize\n#define MAYBE_FrameWasShown DISABLED_FrameWasShown\n#else\n#define MAYBE_SubframeWidget SubframeWidget\n#define MAYBE_FrameResize FrameResize\n#define MAYBE_FrameWasShown FrameWasShown\n#endif\n\n\/\/ Verify that a frame with a RenderFrameProxy as a parent has its own\n\/\/ RenderWidget.\nTEST_F(RenderFrameImplTest, MAYBE_SubframeWidget) {\n EXPECT_TRUE(frame_widget());\n \/\/ We can't convert to RenderWidget* directly, because\n \/\/ it and RenderView are two unrelated base classes\n \/\/ of RenderViewImpl. If a class has multiple base classes,\n \/\/ each base class pointer will be distinct, and direct casts\n \/\/ between unrelated base classes are undefined, even if they share\n \/\/ a common derived class. The compiler has no way in general of\n \/\/ determining the displacement between the two classes, so these\n \/\/ types of casts cannot be implemented in a type safe way.\n \/\/ To overcome this, we make two legal static casts:\n \/\/ first, downcast from RenderView* to RenderViewImpl*,\n \/\/ then upcast from RenderViewImpl* to RenderWidget*.\n EXPECT_NE(frame_widget(),\n static_cast<content::RenderWidget*>(\n static_cast<content::RenderViewImpl*>((view_))));\n}\n\n\/\/ Verify a subframe RenderWidget properly processes its viewport being\n\/\/ resized.\nTEST_F(RenderFrameImplTest, MAYBE_FrameResize) {\n ViewMsg_Resize_Params resize_params;\n gfx::Size size(200, 200);\n resize_params.screen_info = blink::WebScreenInfo();\n resize_params.new_size = size;\n resize_params.physical_backing_size = size;\n resize_params.top_controls_height = 0.f;\n resize_params.top_controls_shrink_blink_size = false;\n resize_params.resizer_rect = gfx::Rect();\n resize_params.is_fullscreen_granted = false;\n\n ViewMsg_Resize resize_message(0, resize_params);\n frame_widget()->OnMessageReceived(resize_message);\n\n EXPECT_EQ(frame_widget()->webwidget()->size(), blink::WebSize(size));\n}\n\n\/\/ Verify a subframe RenderWidget properly processes a WasShown message.\nTEST_F(RenderFrameImplTest, MAYBE_FrameWasShown) {\n RenderFrameTestObserver observer(frame());\n\n ViewMsg_WasShown was_shown_message(0, true, ui::LatencyInfo());\n frame_widget()->OnMessageReceived(was_shown_message);\n\n EXPECT_FALSE(frame_widget()->is_hidden());\n EXPECT_TRUE(observer.visible());\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 - 2018 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2005 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n\n#include \"COptMethodSteepestDescent.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n#include \"COptTask.h\"\n\n#include \"FminBrent.h\"\n\n#include \"copasi\/core\/CDataObjectReference.h\"\n\nCOptMethodSteepestDescent::COptMethodSteepestDescent(const CDataContainer * pParent,\n const CTaskEnum::Method & methodType,\n const CTaskEnum::Task & taskType):\n COptMethod(pParent, methodType, taskType),\n mIterations(100),\n mTolerance(1e-6),\n mContinue(true),\n mBestValue(std::numeric_limits< C_FLOAT64 >::infinity()),\n mValue(0.0),\n mVariableSize(0),\n mIndividual(0),\n mGradient(0),\n mpDescent(new FDescentTemplate<COptMethodSteepestDescent>(this, &COptMethodSteepestDescent::descentLine)),\n mCurrentIteration(0)\n{\n addParameter(\"Iteration Limit\", CCopasiParameter::Type::UINT, (unsigned C_INT32) 100);\n addParameter(\"Tolerance\", CCopasiParameter::Type::DOUBLE, (C_FLOAT64) 1e-6);\n}\n\nCOptMethodSteepestDescent::COptMethodSteepestDescent(const COptMethodSteepestDescent & src,\n const CDataContainer * pParent): COptMethod(src, pParent),\n mIterations(src.mIterations),\n mTolerance(src.mTolerance),\n mContinue(src.mContinue),\n mBestValue(src.mBestValue),\n mValue(src.mValue),\n mVariableSize(src.mVariableSize),\n mIndividual(src.mIndividual),\n mGradient(src.mGradient),\n mpDescent(new FDescentTemplate<COptMethodSteepestDescent>(this, &COptMethodSteepestDescent::descentLine)),\n mCurrentIteration(src.mCurrentIteration)\n{}\n\nCOptMethodSteepestDescent::~COptMethodSteepestDescent()\n{\n pdelete(mpDescent);\n\n cleanup();\n}\n\nbool COptMethodSteepestDescent::optimise()\n{\n if (!initialize()) return false;\n\n mMethodLog.enterLogItem(COptLogItem(COptLogItem::STD_start).with(\"Steepest_Descent\/\"));\n\n size_t i, k;\n C_FLOAT64 tmp, x0, alpha, mn, mx, fmn, fmx;\n bool calc_grad;\n\n \/\/ initial point is first guess but we have to make sure that we\n \/\/ are within the parameter domain\n bool pointInParameterDomain = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n switch (OptItem.checkConstraint(OptItem.getStartValue()))\n {\n case - 1:\n mIndividual[i] = *OptItem.getLowerBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 1:\n mIndividual[i] = *OptItem.getUpperBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 0:\n mIndividual[i] = OptItem.getStartValue();\n break;\n }\n\n *mContainerVariables[i] = mIndividual[i];\n }\n\n if (!pointInParameterDomain) mMethodLog.enterLogItem(COptLogItem(COptLogItem::STD_initial_point_out_of_domain));\n\n fmx = mBestValue = evaluate();\n\n mContinue = mpOptProblem->setSolution(mBestValue, mIndividual);\n\n \/\/ We found a new best value lets report it.\n \/\/if (mpReport) mpReport->printBody();\n mpParentTask->output(COutputInterface::DURING);\n\n bool SolutionFound = false;\n\n for (mCurrentIteration = 0; mCurrentIteration < mIterations && mContinue && !SolutionFound; mCurrentIteration++)\n {\n \/\/ calculate the direction of steepest descent\n \/\/ by central finite differences\n gradient();\n \/\/ minimise the function in this direction\n \/\/ find brackets for the minimisation\n \/\/ mn = 0.0; md = 1.0;\n \/\/ mnbrak(&mn, &md, &mx, &fmn, &fmd, &fmx, descent_line);\n \/\/ make sure that no parameter will exceed its bounds\n x0 = std::numeric_limits< C_FLOAT64 >::max();\n\n for (i = 0; i < mVariableSize; i++)\n {\n if (fabs(mGradient[i]) > std::numeric_limits< C_FLOAT64 >::epsilon())\n {\n if (mGradient[i] > 0)\n {\n tmp = *(*mpOptItem)[i]->getUpperBoundValue();\n }\n\n else\n {\n tmp = *(*mpOptItem)[i]->getLowerBoundValue();\n }\n\n \/\/ calculate the size of the largest jump\n tmp = (tmp - mIndividual[i]) \/ mGradient[i];\n\n \/\/ keep it if it is the smallest\n if (tmp < x0) x0 = tmp;\n }\n else mGradient[i] = 0.0;\n }\n\n if (x0 < mTolerance) x0 = mTolerance;\n\n \/\/ we will move at a rate of 1\/10 this size\n mn = mx = alpha = 0.0;\n\n for (k = 0, calc_grad = false; (k < 9) && !calc_grad && !SolutionFound; k++)\n {\n \/\/ set the minimum to the last successful step\n mn = mx;\n fmn = fmx;\n \/\/ increment alpha\n alpha += 0.1 * x0;\n \/\/ set the maximum to it\n mx = alpha;\n\n \/\/ take one step in that direction\n fmx = descentLine(alpha);\n\n fmx = evaluate();\n\n \/\/ if this was an upward step find the minimum\n if (fmx > fmn)\n {\n \/\/md = mn + (mx-mn)\/2;\n \/\/Brent(mn, md, mx, descent_line, &alpha, &tmp, 1e-6, 50);\n\n FminBrent(mn, mx, mpDescent, &alpha, &tmp, mTolerance, 5);\n\n \/\/ take one step in that direction\n fmx = descentLine(alpha);\n\n \/\/ time to evaluate the new steepest descent direction\n calc_grad = true;\n }\n\n if (fabs(fmx - mBestValue) < mTolerance)\n SolutionFound = true;\n }\n\n for (i = 0; i < mVariableSize; i++)\n mIndividual[i] = *(*mpOptItem)[i]->getObjectValue();\n\n if (fmx < mBestValue)\n {\n mBestValue = fmx;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mIndividual);\n\n \/\/ We found a new best value lets report it.\n \/\/if (mpReport) mpReport->printBody();\n mpParentTask->output(COutputInterface::DURING);\n }\n }\n\n mMethodLog.enterLogItem(COptLogItem(COptLogItem::STD_finish_x_of_max_iter).iter(mCurrentIteration).with(mIterations));\n\n return true;\n}\n\nbool COptMethodSteepestDescent::cleanup()\n{\n \/\/ pdelete all used variables\n return true;\n}\n\nbool COptMethodSteepestDescent::initialize()\n{\n cleanup();\n\n if (!COptMethod::initialize()) return false;\n\n mIterations = getValue< unsigned C_INT32 >(\"Iteration Limit\");\n mTolerance = getValue< C_FLOAT64 >(\"Tolerance\");\n\n mContinue = true;\n mVariableSize = mpOptItem->size();\n mIndividual.resize(mVariableSize);\n mGradient.resize(mVariableSize);\n\n mBestValue = std::numeric_limits<C_FLOAT64>::infinity();\n\n return true;\n}\n\nvoid COptMethodSteepestDescent::gradient()\n{\n\n C_FLOAT64 **ppContainerVariable = mContainerVariables.array();\n C_FLOAT64 **ppContainerVariableEnd = ppContainerVariable + mVariableSize;\n C_FLOAT64 * pGradient = mGradient.array();\n\n C_FLOAT64 y;\n C_FLOAT64 x;\n\n y = evaluate();\n\n for (; ppContainerVariable != ppContainerVariableEnd; ++ppContainerVariable, ++pGradient)\n {\n if ((x = **ppContainerVariable) != 0.0)\n {\n **ppContainerVariable = x * 1.001;\n *pGradient = (y - evaluate()) \/ (x * 0.001);\n }\n\n else\n {\n **ppContainerVariable = 1e-7;\n *pGradient = (y - evaluate()) \/ 1e-7;\n }\n\n **ppContainerVariable = x;\n }\n}\n\nC_FLOAT64 COptMethodSteepestDescent::descentLine(const C_FLOAT64 & x)\n{\n C_FLOAT64 **ppContainerVariable = mContainerVariables.array();\n C_FLOAT64 **ppContainerVariableEnd = ppContainerVariable + mVariableSize;\n C_FLOAT64 * pGradient = mGradient.array();\n C_FLOAT64 * pIndividual = mIndividual.array();\n\n for (; ppContainerVariable != ppContainerVariableEnd; ++ppContainerVariable, ++pIndividual, ++pGradient)\n {\n **ppContainerVariable = *pIndividual + x **pGradient;\n }\n\n return evaluate();\n}\n\n\/\/ evaluate the fitness of one individual\nconst C_FLOAT64 & COptMethodSteepestDescent::evaluate()\n{\n \/\/ evaluate the fitness\n mContinue = mpOptProblem->calculate();\n\n mValue = mpOptProblem->getCalculateValue();\n\n \/\/ when we leave the either the parameter or functional domain\n \/\/ we penalize the objective value by forcing it to be larger\n \/\/ than the best value recorded so far.\n if (mValue < mBestValue &&\n (!mpOptProblem->checkParametricConstraints() ||\n !mpOptProblem->checkFunctionalConstraints()))\n mValue = mBestValue + fabs(mBestValue - mValue);\n\n return mValue;\n}\n\nvoid COptMethodSteepestDescent::initObjects()\n{\n addObjectReference(\"Current Iteration\", mCurrentIteration, CDataObject::ValueInt);\n}\n\nunsigned C_INT32 COptMethodSteepestDescent::getMaxLogVerbosity() const\n{\n return 0;\n}\n<commit_msg>changed log messages to use COptLogEntry class<commit_after>\/\/ Copyright (C) 2017 - 2018 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2005 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n\n#include \"COptMethodSteepestDescent.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n#include \"COptTask.h\"\n\n#include \"FminBrent.h\"\n\n#include \"copasi\/core\/CDataObjectReference.h\"\n\nCOptMethodSteepestDescent::COptMethodSteepestDescent(const CDataContainer * pParent,\n const CTaskEnum::Method & methodType,\n const CTaskEnum::Task & taskType):\n COptMethod(pParent, methodType, taskType),\n mIterations(100),\n mTolerance(1e-6),\n mContinue(true),\n mBestValue(std::numeric_limits< C_FLOAT64 >::infinity()),\n mValue(0.0),\n mVariableSize(0),\n mIndividual(0),\n mGradient(0),\n mpDescent(new FDescentTemplate<COptMethodSteepestDescent>(this, &COptMethodSteepestDescent::descentLine)),\n mCurrentIteration(0)\n{\n addParameter(\"Iteration Limit\", CCopasiParameter::Type::UINT, (unsigned C_INT32) 100);\n addParameter(\"Tolerance\", CCopasiParameter::Type::DOUBLE, (C_FLOAT64) 1e-6);\n}\n\nCOptMethodSteepestDescent::COptMethodSteepestDescent(const COptMethodSteepestDescent & src,\n const CDataContainer * pParent): COptMethod(src, pParent),\n mIterations(src.mIterations),\n mTolerance(src.mTolerance),\n mContinue(src.mContinue),\n mBestValue(src.mBestValue),\n mValue(src.mValue),\n mVariableSize(src.mVariableSize),\n mIndividual(src.mIndividual),\n mGradient(src.mGradient),\n mpDescent(new FDescentTemplate<COptMethodSteepestDescent>(this, &COptMethodSteepestDescent::descentLine)),\n mCurrentIteration(src.mCurrentIteration)\n{}\n\nCOptMethodSteepestDescent::~COptMethodSteepestDescent()\n{\n pdelete(mpDescent);\n\n cleanup();\n}\n\nbool COptMethodSteepestDescent::optimise()\n{\n if (!initialize()) return false;\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\n \"Algorithm started.\",\n \"For more information about this method see: http:\/\/copasi.org\/Support\/User_Manual\/Methods\/Optimization_Methods\/Steepest_Descent\/\"\n )\n );\n\n size_t i, k;\n C_FLOAT64 tmp, x0, alpha, mn, mx, fmn, fmx;\n bool calc_grad;\n\n \/\/ initial point is first guess but we have to make sure that we\n \/\/ are within the parameter domain\n bool pointInParameterDomain = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n switch (OptItem.checkConstraint(OptItem.getStartValue()))\n {\n case - 1:\n mIndividual[i] = *OptItem.getLowerBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 1:\n mIndividual[i] = *OptItem.getUpperBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 0:\n mIndividual[i] = OptItem.getStartValue();\n break;\n }\n\n *mContainerVariables[i] = mIndividual[i];\n }\n\n if (!pointInParameterDomain && (mLogVerbosity > 0))\n mMethodLog.enterLogEntry(COptLogEntry(\"Initial point outside parameter domain.\"));\n\n fmx = mBestValue = evaluate();\n\n mContinue = mpOptProblem->setSolution(mBestValue, mIndividual);\n\n \/\/ We found a new best value lets report it.\n \/\/if (mpReport) mpReport->printBody();\n mpParentTask->output(COutputInterface::DURING);\n\n bool SolutionFound = false;\n\n for (mCurrentIteration = 0; mCurrentIteration < mIterations && mContinue && !SolutionFound; mCurrentIteration++)\n {\n \/\/ calculate the direction of steepest descent\n \/\/ by central finite differences\n gradient();\n \/\/ minimise the function in this direction\n \/\/ find brackets for the minimisation\n \/\/ mn = 0.0; md = 1.0;\n \/\/ mnbrak(&mn, &md, &mx, &fmn, &fmd, &fmx, descent_line);\n \/\/ make sure that no parameter will exceed its bounds\n x0 = std::numeric_limits< C_FLOAT64 >::max();\n\n for (i = 0; i < mVariableSize; i++)\n {\n if (fabs(mGradient[i]) > std::numeric_limits< C_FLOAT64 >::epsilon())\n {\n if (mGradient[i] > 0)\n {\n tmp = *(*mpOptItem)[i]->getUpperBoundValue();\n }\n\n else\n {\n tmp = *(*mpOptItem)[i]->getLowerBoundValue();\n }\n\n \/\/ calculate the size of the largest jump\n tmp = (tmp - mIndividual[i]) \/ mGradient[i];\n\n \/\/ keep it if it is the smallest\n if (tmp < x0) x0 = tmp;\n }\n else mGradient[i] = 0.0;\n }\n\n if (x0 < mTolerance) x0 = mTolerance;\n\n \/\/ we will move at a rate of 1\/10 this size\n mn = mx = alpha = 0.0;\n\n for (k = 0, calc_grad = false; (k < 9) && !calc_grad && !SolutionFound; k++)\n {\n \/\/ set the minimum to the last successful step\n mn = mx;\n fmn = fmx;\n \/\/ increment alpha\n alpha += 0.1 * x0;\n \/\/ set the maximum to it\n mx = alpha;\n\n \/\/ take one step in that direction\n fmx = descentLine(alpha);\n\n fmx = evaluate();\n\n \/\/ if this was an upward step find the minimum\n if (fmx > fmn)\n {\n \/\/md = mn + (mx-mn)\/2;\n \/\/Brent(mn, md, mx, descent_line, &alpha, &tmp, 1e-6, 50);\n\n FminBrent(mn, mx, mpDescent, &alpha, &tmp, mTolerance, 5);\n\n \/\/ take one step in that direction\n fmx = descentLine(alpha);\n\n \/\/ time to evaluate the new steepest descent direction\n calc_grad = true;\n }\n\n if (fabs(fmx - mBestValue) < mTolerance)\n SolutionFound = true;\n }\n\n for (i = 0; i < mVariableSize; i++)\n mIndividual[i] = *(*mpOptItem)[i]->getObjectValue();\n\n if (fmx < mBestValue)\n {\n mBestValue = fmx;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mIndividual);\n\n \/\/ We found a new best value lets report it.\n \/\/if (mpReport) mpReport->printBody();\n mpParentTask->output(COutputInterface::DURING);\n }\n }\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\"Algorithm finished.\",\n \"Terminated after \" + std::to_string(mCurrentIteration) + \" of \" + std::to_string(mIterations) + \" iterations.\"));\n\n return true;\n}\n\nbool COptMethodSteepestDescent::cleanup()\n{\n \/\/ pdelete all used variables\n return true;\n}\n\nbool COptMethodSteepestDescent::initialize()\n{\n cleanup();\n\n if (!COptMethod::initialize()) return false;\n\n mIterations = getValue< unsigned C_INT32 >(\"Iteration Limit\");\n mTolerance = getValue< C_FLOAT64 >(\"Tolerance\");\n\n mContinue = true;\n mVariableSize = mpOptItem->size();\n mIndividual.resize(mVariableSize);\n mGradient.resize(mVariableSize);\n\n mBestValue = std::numeric_limits<C_FLOAT64>::infinity();\n\n return true;\n}\n\nvoid COptMethodSteepestDescent::gradient()\n{\n\n C_FLOAT64 **ppContainerVariable = mContainerVariables.array();\n C_FLOAT64 **ppContainerVariableEnd = ppContainerVariable + mVariableSize;\n C_FLOAT64 * pGradient = mGradient.array();\n\n C_FLOAT64 y;\n C_FLOAT64 x;\n\n y = evaluate();\n\n for (; ppContainerVariable != ppContainerVariableEnd; ++ppContainerVariable, ++pGradient)\n {\n if ((x = **ppContainerVariable) != 0.0)\n {\n **ppContainerVariable = x * 1.001;\n *pGradient = (y - evaluate()) \/ (x * 0.001);\n }\n\n else\n {\n **ppContainerVariable = 1e-7;\n *pGradient = (y - evaluate()) \/ 1e-7;\n }\n\n **ppContainerVariable = x;\n }\n}\n\nC_FLOAT64 COptMethodSteepestDescent::descentLine(const C_FLOAT64 & x)\n{\n C_FLOAT64 **ppContainerVariable = mContainerVariables.array();\n C_FLOAT64 **ppContainerVariableEnd = ppContainerVariable + mVariableSize;\n C_FLOAT64 * pGradient = mGradient.array();\n C_FLOAT64 * pIndividual = mIndividual.array();\n\n for (; ppContainerVariable != ppContainerVariableEnd; ++ppContainerVariable, ++pIndividual, ++pGradient)\n {\n **ppContainerVariable = *pIndividual + x **pGradient;\n }\n\n return evaluate();\n}\n\n\/\/ evaluate the fitness of one individual\nconst C_FLOAT64 & COptMethodSteepestDescent::evaluate()\n{\n \/\/ evaluate the fitness\n mContinue = mpOptProblem->calculate();\n\n mValue = mpOptProblem->getCalculateValue();\n\n \/\/ when we leave the either the parameter or functional domain\n \/\/ we penalize the objective value by forcing it to be larger\n \/\/ than the best value recorded so far.\n if (mValue < mBestValue &&\n (!mpOptProblem->checkParametricConstraints() ||\n !mpOptProblem->checkFunctionalConstraints()))\n mValue = mBestValue + fabs(mBestValue - mValue);\n\n return mValue;\n}\n\nvoid COptMethodSteepestDescent::initObjects()\n{\n addObjectReference(\"Current Iteration\", mCurrentIteration, CDataObject::ValueInt);\n}\n\nunsigned C_INT32 COptMethodSteepestDescent::getMaxLogVerbosity() const\n{\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"rosplan_planning_system\/PlannerInterface\/FFPlannerInterface.h\"\n\nnamespace KCL_rosplan {\n\n\t\/*-------------*\/\n\t\/* constructor *\/\n\t\/*-------------*\/\n\n\tFFPlannerInterface::FFPlannerInterface(ros::NodeHandle& nh)\n\t{\n\t\tnode_handle = &nh;\n\n\t\tplan_server = new actionlib::SimpleActionServer<rosplan_dispatch_msgs::PlanAction>((*node_handle), \"start_planning\", boost::bind(&PlannerInterface::runPlanningServerAction, this, _1), false);\n\n\t\t\/\/ publishing raw planner output\n\t\tstd::string plannerTopic = \"planner_output\";\n\t\tnode_handle->getParam(\"planner_topic\", plannerTopic);\n\t\tplan_publisher = node_handle->advertise<std_msgs::String>(plannerTopic, 1, true);\n\n\t\t\/\/ start planning action server\n\t\tplan_server->start();\n\t}\n\t\n\tFFPlannerInterface::~FFPlannerInterface()\n\t{\n\t\tdelete plan_server;\n\t}\n\n\t\/**\n\t * Runs external commands\n\t *\/\n\tstd::string FFPlannerInterface::runCommand(std::string cmd) {\n\t\tstd::string data;\n\t\tFILE *stream;\n\t\tchar buffer[1000];\n\t\tstream = popen(cmd.c_str(), \"r\");\n\t\twhile ( fgets(buffer, 1000, stream) != NULL )\n\t\t\tdata.append(buffer);\n\t\tpclose(stream);\n\t\treturn data;\n\t}\n\n\t\/*------------------*\/\n\t\/* Plan and process *\/\n\t\/*------------------*\/\n\n\t\/**\n\t * passes the problem to the Planner; the plan to post-processing.\n\t *\/\n\tbool FFPlannerInterface::runPlanner() {\n\n\t\t\/\/ save problem to file for planner\n\t\tif(use_problem_topic && problem_instance_received) {\n\t\t\tROS_INFO(\"KCL: (%s) (%s) Writing problem to file.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\t\t\tstd::ofstream dest;\n\t\t\tdest.open((problem_path).c_str());\n\t\t\tdest << problem_instance;\n\t\t\tdest.close();\n\t\t}\n\n\t\t\/\/ prepare the planner command line\n\t\tstd::string str = planner_command;\n\t\tstd::size_t dit = str.find(\"DOMAIN\");\n\t\tif(dit!=std::string::npos) str.replace(dit,6,domain_path);\n\t\tstd::size_t pit = str.find(\"PROBLEM\");\n\t\tif(pit!=std::string::npos) str.replace(pit,7,problem_path);\n\t\tstd::string commandString = str + \" > \" + data_path + \"plan.pddl\";\n\n\t\t\/\/ call the planer\n\t\tROS_INFO(\"KCL: (%s) (%s) Running: %s\", ros::this_node::getName().c_str(), problem_name.c_str(), commandString.c_str());\n\t\tstd::string plan = runCommand(commandString.c_str());\n\t\tROS_INFO(\"KCL: (%s) (%s) Planning complete\", ros::this_node::getName().c_str(), problem_name.c_str());\n\n\t\t\/\/ check the planner solved the problem\n\t\tstd::ifstream planfile;\n\t\tplanfile.open((data_path + \"plan.pddl\").c_str());\n\t\tstd::string line;\n\t\tstd::stringstream ss;\n\n\t\tbool solved = false;\n\n\t\twhile (std::getline(planfile, line)) {\n\n\t\t\t\/\/ skip lines until there is a plan\n\t\t\tif(line.compare(\"ff: found legal plan as follows\") != 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t\/\/ skip the empty line\n\t\t\twhile (std::getline(planfile, line)) {\n\t\t\t\tif (line.length()<2) break;\n\t\t\t}\n\n\t\t\t\/\/ actions look like this:\n\t\t\t\/\/ step 0: got_place C1\n\t\t\t\/\/ 1: find_object V1 C1 \n\t\t\tsolved = true;\n\t\t\twhile (std::getline(planfile, line)) {\n\n\t\t\t\tif (line.length()<2) break;\n\n\t\t\t\tunsigned int pos = line.find(' ');\n\t\t\t\tbool action = false;\n\t\t\t\twhile(pos != std::string::npos && pos < line.length()) {\n\t\t\t\t\tif(line.substr(pos,1) != \" \") {\n\t\t\t\t\t\taction = true;\n\t\t\t\t\t\tline = line.substr(pos);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tpos++;\n\t\t\t\t}\n\t\t\t\tif(action) ss << line << \" [0.001]\" << std::endl;\n\t\t\t}\n\t\t\tplanner_output = ss.str();\n\t\t}\n\t\tplanfile.close();\n\n\t\tif(!solved) ROS_INFO(\"KCL: (%s) (%s) Plan was unsolvable.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\t\telse ROS_INFO(\"KCL: (%s) (%s) Plan was solved.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\n\t\treturn solved;\n\t}\n\n} \/\/ close namespace\n\n\t\/*-------------*\/\n\t\/* Main method *\/\n\t\/*-------------*\/\n\n\tint main(int argc, char **argv) {\n\n\t\tsrand (static_cast <unsigned> (time(0)));\n\n\t\tros::init(argc,argv,\"rosplan_planner_interface\");\n\t\tros::NodeHandle nh(\"~\");\n\n\t\tKCL_rosplan::FFPlannerInterface pi(nh);\n\t\t\n\t\t\/\/ subscribe to problem instance\n\t\tstd::string problemTopic = \"problem_instance\";\n\t\tnh.getParam(\"problem_topic\", problemTopic);\n\t\tros::Subscriber problem_sub = nh.subscribe(problemTopic, 1, &KCL_rosplan::PlannerInterface::problemCallback, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\n\t\t\/\/ start the planning services\n\t\tros::ServiceServer service1 = nh.advertiseService(\"planning_server\", &KCL_rosplan::PlannerInterface::runPlanningServerDefault, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\t\tros::ServiceServer service2 = nh.advertiseService(\"planning_server_params\", &KCL_rosplan::PlannerInterface::runPlanningServerParams, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\n\t\tROS_INFO(\"KCL: (%s) Ready to receive\", ros::this_node::getName().c_str());\n\t\tros::spin();\n\n\t\treturn 0;\n\t}\n<commit_msg>Fixed FF plan parser<commit_after>#include \"rosplan_planning_system\/PlannerInterface\/FFPlannerInterface.h\"\n\nnamespace KCL_rosplan {\n\n\t\/*-------------*\/\n\t\/* constructor *\/\n\t\/*-------------*\/\n\n\tFFPlannerInterface::FFPlannerInterface(ros::NodeHandle& nh)\n\t{\n\t\tnode_handle = &nh;\n\n\t\tplan_server = new actionlib::SimpleActionServer<rosplan_dispatch_msgs::PlanAction>((*node_handle), \"start_planning\", boost::bind(&PlannerInterface::runPlanningServerAction, this, _1), false);\n\n\t\t\/\/ publishing raw planner output\n\t\tstd::string plannerTopic = \"planner_output\";\n\t\tnode_handle->getParam(\"planner_topic\", plannerTopic);\n\t\tplan_publisher = node_handle->advertise<std_msgs::String>(plannerTopic, 1, true);\n\n\t\t\/\/ start planning action server\n\t\tplan_server->start();\n\t}\n\t\n\tFFPlannerInterface::~FFPlannerInterface()\n\t{\n\t\tdelete plan_server;\n\t}\n\n\t\/**\n\t * Runs external commands\n\t *\/\n\tstd::string FFPlannerInterface::runCommand(std::string cmd) {\n\t\tstd::string data;\n\t\tFILE *stream;\n\t\tchar buffer[1000];\n\t\tstream = popen(cmd.c_str(), \"r\");\n\t\twhile ( fgets(buffer, 1000, stream) != NULL )\n\t\t\tdata.append(buffer);\n\t\tpclose(stream);\n\t\treturn data;\n\t}\n\n\t\/*------------------*\/\n\t\/* Plan and process *\/\n\t\/*------------------*\/\n\n\t\/**\n\t * passes the problem to the Planner; the plan to post-processing.\n\t *\/\n\tbool FFPlannerInterface::runPlanner() {\n\n\t\t\/\/ save problem to file for planner\n\t\tif(use_problem_topic && problem_instance_received) {\n\t\t\tROS_INFO(\"KCL: (%s) (%s) Writing problem to file.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\t\t\tstd::ofstream dest;\n\t\t\tdest.open((problem_path).c_str());\n\t\t\tdest << problem_instance;\n\t\t\tdest.close();\n\t\t}\n\n\t\t\/\/ prepare the planner command line\n\t\tstd::string str = planner_command;\n\t\tstd::size_t dit = str.find(\"DOMAIN\");\n\t\tif(dit!=std::string::npos) str.replace(dit,6,domain_path);\n\t\tstd::size_t pit = str.find(\"PROBLEM\");\n\t\tif(pit!=std::string::npos) str.replace(pit,7,problem_path);\n\t\tstd::string commandString = str + \" > \" + data_path + \"plan.pddl\";\n\n\t\t\/\/ call the planer\n\t\tROS_INFO(\"KCL: (%s) (%s) Running: %s\", ros::this_node::getName().c_str(), problem_name.c_str(), commandString.c_str());\n\t\tstd::string plan = runCommand(commandString.c_str());\n\t\tROS_INFO(\"KCL: (%s) (%s) Planning complete\", ros::this_node::getName().c_str(), problem_name.c_str());\n\n\t\t\/\/ check the planner solved the problem\n\t\tstd::ifstream planfile;\n\t\tplanfile.open((data_path + \"plan.pddl\").c_str());\n\t\tstd::string line;\n\n\t\tbool solved = false;\n\t\twhile (not solved and std::getline(planfile, line)) {\n\t\t\t\/\/ skip lines until there is a plan\n\t\t\tif (line.compare(\"ff: found legal plan as follows\") == 0) {\n\t\t\t\tsolved = true;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Parse the solved plan\n\t\tif (solved) {\n\t\t\t\/\/ actions look like this:\n\t\t\t\/\/ step 0: got_place C1\n\t\t\t\/\/ 1: find_object V1 C1\n\t\t\t\/\/ plan cost: XX\n\t\t\twhile (std::getline(planfile, line)) { \/\/ Move to the beginning of the plan\n\t\t\t\tif (line.substr(0, 4) == \"step\") {\n\t\t\t\t\tline = line.substr(4); \/\/ Remove the step\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ First iteration line will be like 0: got_place C1\n\t\t\twhile (line.find(\"plan cost\") == line.npos and line.find(\"time spend\") == line.npos and line.size() > 0) {\n\t\t\t\tstd::stringstream ss(line); \/\/ To trim whitespaces\n\t\t\t\tstd::string aux;\n\t\t\t\t\/\/ Read the action number X:\n\t\t\t\tss >> aux;\n\t\t\t\tplanner_output += aux + \" (\"; \/\/ Add parenthesis before the action\n\t\t\t\twhile (ss >> aux) { \/\/ Read the rest\n\t\t\t\t\tplanner_output += aux;\n\t\t\t\t\tif (ss.good()) planner_output += \" \"; \/\/ Add a whitespace unless we have processed all the line\n\t\t\t\t}\n\t\t\t\tplanner_output += \") [0.001]\\n\"; \/\/ Close parenthesis and add duration\n\t\t\t\tstd::getline(planfile, line);\n\t\t\t}\n\t\t\t\/\/ Convert to lowercase as FF prints all the actions and parameters in uppercase\n\t\t\tstd::transform(planner_output.begin(), planner_output.end(), planner_output.begin(), ::tolower);\n\t\t}\n\t\tplanfile.close();\n\n\t\tif(!solved) ROS_INFO(\"KCL: (%s) (%s) Plan was unsolvable.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\t\telse ROS_INFO(\"KCL: (%s) (%s) Plan was solved.\", ros::this_node::getName().c_str(), problem_name.c_str());\n\n\t\treturn solved;\n\t}\n\n} \/\/ close namespace\n\n\t\/*-------------*\/\n\t\/* Main method *\/\n\t\/*-------------*\/\n\n\tint main(int argc, char **argv) {\n\n\t\tsrand (static_cast <unsigned> (time(0)));\n\n\t\tros::init(argc,argv,\"rosplan_planner_interface\");\n\t\tros::NodeHandle nh(\"~\");\n\n\t\tKCL_rosplan::FFPlannerInterface pi(nh);\n\n\t\t\/\/ subscribe to problem instance\n\t\tstd::string problemTopic = \"problem_instance\";\n\t\tnh.getParam(\"problem_topic\", problemTopic);\n\t\tros::Subscriber problem_sub = nh.subscribe(problemTopic, 1, &KCL_rosplan::PlannerInterface::problemCallback, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\n\t\t\/\/ start the planning services\n\t\tros::ServiceServer service1 = nh.advertiseService(\"planning_server\", &KCL_rosplan::PlannerInterface::runPlanningServerDefault, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\t\tros::ServiceServer service2 = nh.advertiseService(\"planning_server_params\", &KCL_rosplan::PlannerInterface::runPlanningServerParams, dynamic_cast<KCL_rosplan::PlannerInterface*>(&pi));\n\n\t\tROS_INFO(\"KCL: (%s) Ready to receive\", ros::this_node::getName().c_str());\n\t\tros::spin();\n\n\t\treturn 0;\n\t}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <algorithm>\n#include <chrono>\n#include <functional>\n#include <iostream>\n#include <set>\n#include <mutex>\n#include <thread>\n#include <Chaos\/Types.h>\n#include <Chaos\/Logging\/Logging.h>\n#include \"object.h\"\n#include \"parallel_sweep.h\"\n\nnamespace gc {\n\nclass Worker {\n int order_{};\n bool stop_{};\n bool run_tracing_{};\n std::mutex mutex_;\n std::unique_ptr<std::thread> thread_;\n std::vector<BaseObject*> roots_;\n std::vector<BaseObject*> mark_objects_;\n\n friend class ParallelSweep;\n\n void acquire_work(void) {\n if (!mark_objects_.empty())\n return;\n\n {\n std::unique_lock<std::mutex> g(mutex_);\n transfer(roots_.size() \/ 2, mark_objects_);\n }\n\n if (mark_objects_.empty())\n ParallelSweep::get_instance().acquire_work(order_, mark_objects_);\n }\n\n void perform_work(void) {\n while (!mark_objects_.empty()) {\n auto* obj = mark_objects_.back();\n mark_objects_.pop_back();\n\n obj->set_marked();\n if (obj->is_pair()) {\n auto append_fn = [this](BaseObject* o) {\n if (o != nullptr && !o->is_marked()) {\n o->set_marked(); mark_objects_.push_back(o);\n }\n };\n\n append_fn(Chaos::down_cast<Pair*>(obj)->first());\n append_fn(Chaos::down_cast<Pair*>(obj)->second());\n }\n }\n }\n\n void generate_work(void) {\n if (roots_.empty()) {\n std::unique_lock<std::mutex> g(mutex_);\n std::copy(mark_objects_.begin(),\n mark_objects_.end(), std::back_inserter(roots_));\n mark_objects_.clear();\n }\n }\n\n void worker_routine(void) {\n while (!stop_) {\n if (run_tracing_) {\n acquire_work();\n perform_work();\n generate_work();\n }\n if (run_tracing_ && mark_objects_.empty())\n run_tracing_ = false;\n\n std::this_thread::sleep_for(std::chrono::microseconds(10));\n }\n }\npublic:\n Worker(int order)\n : order_(order)\n , thread_(new std::thread(std::bind(&Worker::worker_routine, this)))\n {}\n ~Worker(void) { stop(); thread_->join(); }\n void stop(void) { stop_ = true; }\n void run_tracing(void) { run_tracing_ = true; }\n void put_in(BaseObject* obj) { roots_.push_back(obj); }\n\n BaseObject* fetch_out(void) {\n auto* obj = roots_.back();\n roots_.pop_back();\n return obj;\n }\n\n void transfer(std::size_t n, std::vector<BaseObject*>& objects) {\n std::copy_n(roots_.begin(), n, std::back_inserter(objects));\n roots_.erase(roots_.begin(), roots_.begin() + n);\n }\n};\n\nParallelSweep::ParallelSweep(void) {\n start_workers();\n}\n\nParallelSweep::~ParallelSweep(void) {\n stop_workers();\n}\n\nvoid ParallelSweep::start_workers(int nworkers) {\n nworkers_ = nworkers;\n for (auto i = 0; i < nworkers_; ++i)\n workers_.emplace_back(new Worker(i));\n}\n\nvoid ParallelSweep::stop_workers(void) {\n for (auto i = 0; i < nworkers_; ++i)\n workers_[i]->stop();\n}\n\nint ParallelSweep::put_in_order(void) {\n int r = order_;\n order_ = (order_ + 1) % nworkers_;\n return r;\n}\n\nint ParallelSweep::fetch_out_order(void) {\n order_ = (order_ - 1 + nworkers_) % nworkers_;\n return order_;\n}\n\nvoid ParallelSweep::sweep(void) {\n for (auto it = objects_.begin(); it != objects_.end();) {\n if (!(*it)->is_marked()) {\n delete *it;\n objects_.erase(it++);\n }\n else {\n (*it)->unset_marked();\n ++it;\n }\n }\n}\n\nParallelSweep& ParallelSweep::get_instance(void) {\n static ParallelSweep ins;\n return ins;\n}\n\nvoid ParallelSweep::acquire_work(\n int own_order, std::vector<BaseObject*>& objects) {\n for (auto i = 0; i < nworkers_; ++i) {\n if (i == own_order)\n continue;\n\n if (workers_[i]->mutex_.try_lock()) {\n workers_[i]->transfer(workers_[i]->roots_.size() \/ 2, objects);\n workers_[i]->mutex_.unlock();\n break;\n }\n }\n}\n\nvoid ParallelSweep::collect(void) {\n auto old_count = objects_.size();\n\n for (auto i = 0; i < nworkers_; ++i)\n workers_[i]->run_tracing();\n\n std::set<int> finished;\n while (true) {\n for (auto i = 0; i < nworkers_; ++i) {\n if (!workers_[i]->run_tracing_)\n finished.insert(i);\n }\n\n if (finished.size() == static_cast<std::size_t>(nworkers_))\n break;\n std::this_thread::sleep_for(std::chrono::microseconds(10));\n }\n finished.clear();\n\n sweep();\n\n std::cout\n << \"[\" << old_count - objects_.size() << \"] objects collected, \"\n << \"[\" << objects_.size() << \"] objects remaining.\" << std::endl;\n}\n\nBaseObject* ParallelSweep::put_in(int value) {\n if (objects_.size() >= kMaxObjects)\n collect();\n\n auto* obj = new Int();\n obj->set_value(value);\n\n auto order = put_in_order();\n workers_[order]->put_in(obj);\n objects_.push_back(obj);\n\n return obj;\n}\n\nBaseObject* ParallelSweep::put_in(BaseObject* first, BaseObject* second) {\n if (objects_.size() >= kMaxObjects)\n collect();\n\n auto* obj = new Pair();\n if (first != nullptr)\n obj->set_first(first);\n if (second != nullptr)\n obj->set_second(second);\n\n auto order = put_in_order();\n workers_[order]->put_in(obj);\n objects_.push_back(obj);\n\n return obj;\n}\n\nBaseObject* ParallelSweep::fetch_out(void) {\n auto order = fetch_out_order();\n return workers_[order]->fetch_out();\n}\n\n}\n<commit_msg>:bug: fix(ParallelSweep): fixed including error<commit_after>\/\/ Copyright (c) 2017 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include <algorithm>\n#include <chrono>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <set>\n#include <mutex>\n#include <thread>\n#include <Chaos\/Types.h>\n#include \"object.h\"\n#include \"parallel_sweep.h\"\n\nnamespace gc {\n\nclass Worker {\n int order_{};\n bool stop_{};\n bool run_tracing_{};\n std::mutex mutex_;\n std::unique_ptr<std::thread> thread_;\n std::vector<BaseObject*> roots_;\n std::vector<BaseObject*> mark_objects_;\n\n friend class ParallelSweep;\n\n void acquire_work(void) {\n if (!mark_objects_.empty())\n return;\n\n {\n std::unique_lock<std::mutex> g(mutex_);\n transfer(roots_.size() \/ 2, mark_objects_);\n }\n\n if (mark_objects_.empty())\n ParallelSweep::get_instance().acquire_work(order_, mark_objects_);\n }\n\n void perform_work(void) {\n while (!mark_objects_.empty()) {\n auto* obj = mark_objects_.back();\n mark_objects_.pop_back();\n\n obj->set_marked();\n if (obj->is_pair()) {\n auto append_fn = [this](BaseObject* o) {\n if (o != nullptr && !o->is_marked()) {\n o->set_marked(); mark_objects_.push_back(o);\n }\n };\n\n append_fn(Chaos::down_cast<Pair*>(obj)->first());\n append_fn(Chaos::down_cast<Pair*>(obj)->second());\n }\n }\n }\n\n void generate_work(void) {\n if (roots_.empty()) {\n std::unique_lock<std::mutex> g(mutex_);\n std::copy(mark_objects_.begin(),\n mark_objects_.end(), std::back_inserter(roots_));\n mark_objects_.clear();\n }\n }\n\n void worker_routine(void) {\n while (!stop_) {\n if (run_tracing_) {\n acquire_work();\n perform_work();\n generate_work();\n }\n if (run_tracing_ && mark_objects_.empty())\n run_tracing_ = false;\n\n std::this_thread::sleep_for(std::chrono::microseconds(10));\n }\n }\npublic:\n Worker(int order)\n : order_(order)\n , thread_(new std::thread(std::bind(&Worker::worker_routine, this)))\n {}\n ~Worker(void) { stop(); thread_->join(); }\n void stop(void) { stop_ = true; }\n void run_tracing(void) { run_tracing_ = true; }\n void put_in(BaseObject* obj) { roots_.push_back(obj); }\n\n BaseObject* fetch_out(void) {\n auto* obj = roots_.back();\n roots_.pop_back();\n return obj;\n }\n\n void transfer(std::size_t n, std::vector<BaseObject*>& objects) {\n std::copy_n(roots_.begin(), n, std::back_inserter(objects));\n roots_.erase(roots_.begin(), roots_.begin() + n);\n }\n};\n\nParallelSweep::ParallelSweep(void) {\n start_workers();\n}\n\nParallelSweep::~ParallelSweep(void) {\n stop_workers();\n}\n\nvoid ParallelSweep::start_workers(int nworkers) {\n nworkers_ = nworkers;\n for (auto i = 0; i < nworkers_; ++i)\n workers_.emplace_back(new Worker(i));\n}\n\nvoid ParallelSweep::stop_workers(void) {\n for (auto i = 0; i < nworkers_; ++i)\n workers_[i]->stop();\n}\n\nint ParallelSweep::put_in_order(void) {\n int r = order_;\n order_ = (order_ + 1) % nworkers_;\n return r;\n}\n\nint ParallelSweep::fetch_out_order(void) {\n order_ = (order_ - 1 + nworkers_) % nworkers_;\n return order_;\n}\n\nvoid ParallelSweep::sweep(void) {\n for (auto it = objects_.begin(); it != objects_.end();) {\n if (!(*it)->is_marked()) {\n delete *it;\n objects_.erase(it++);\n }\n else {\n (*it)->unset_marked();\n ++it;\n }\n }\n}\n\nParallelSweep& ParallelSweep::get_instance(void) {\n static ParallelSweep ins;\n return ins;\n}\n\nvoid ParallelSweep::acquire_work(\n int own_order, std::vector<BaseObject*>& objects) {\n for (auto i = 0; i < nworkers_; ++i) {\n if (i == own_order)\n continue;\n\n if (workers_[i]->mutex_.try_lock()) {\n workers_[i]->transfer(workers_[i]->roots_.size() \/ 2, objects);\n workers_[i]->mutex_.unlock();\n break;\n }\n }\n}\n\nvoid ParallelSweep::collect(void) {\n auto old_count = objects_.size();\n\n for (auto i = 0; i < nworkers_; ++i)\n workers_[i]->run_tracing();\n\n std::set<int> finished;\n while (true) {\n for (auto i = 0; i < nworkers_; ++i) {\n if (!workers_[i]->run_tracing_)\n finished.insert(i);\n }\n\n if (finished.size() == static_cast<std::size_t>(nworkers_))\n break;\n std::this_thread::sleep_for(std::chrono::microseconds(10));\n }\n finished.clear();\n\n sweep();\n\n std::cout\n << \"[\" << old_count - objects_.size() << \"] objects collected, \"\n << \"[\" << objects_.size() << \"] objects remaining.\" << std::endl;\n}\n\nBaseObject* ParallelSweep::put_in(int value) {\n if (objects_.size() >= kMaxObjects)\n collect();\n\n auto* obj = new Int();\n obj->set_value(value);\n\n auto order = put_in_order();\n workers_[order]->put_in(obj);\n objects_.push_back(obj);\n\n return obj;\n}\n\nBaseObject* ParallelSweep::put_in(BaseObject* first, BaseObject* second) {\n if (objects_.size() >= kMaxObjects)\n collect();\n\n auto* obj = new Pair();\n if (first != nullptr)\n obj->set_first(first);\n if (second != nullptr)\n obj->set_second(second);\n\n auto order = put_in_order();\n workers_[order]->put_in(obj);\n objects_.push_back(obj);\n\n return obj;\n}\n\nBaseObject* ParallelSweep::fetch_out(void) {\n auto order = fetch_out_order();\n return workers_[order]->fetch_out();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \\brief Utility for checking which ISBNS can be found on archive.org.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2021 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <atomic>\n#include <chrono>\n#include <iostream>\n#include <deque>\n#include <mutex>\n#include <thread>\n#include <cstdio>\n#include <cstdlib>\n#include \"Downloader.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"MARC.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n ::Usage(\"[--summarize-tags] [--verbose] worker_thread_count marc_data isbn_list_output\");\n}\n\n\nstd::atomic<bool> work_available(true);\n\n\nvoid WorkerThread(Downloader * const downloader, std::deque<std::set<std::string>> * const task_queue,\n std::mutex * const task_queue_mutex, unsigned * const isbn_found_count, File * const isbn_list_output,\n std::mutex * const output_mutex)\n{\n std::set<std::string> isbns;\n while (work_available) {\n {\n std::lock_guard<std::mutex> task_queue_mutex_locker(*task_queue_mutex);\n if (not task_queue->empty()) {\n isbns = task_queue->front();\n task_queue->pop_front();\n }\n }\n\n if (isbns.empty()) {\n std::this_thread::sleep_for(std::chrono::seconds(20));\n continue;\n }\n\n for (const auto &isbn : isbns) {\n const std::string url(\"https:\/\/archive.org\/metadata\/isbn_\" + isbn + \"\/created\");\n if (not downloader->newUrl(url)) {\n LOG_WARNING(\"URL \\\"\" + url + \" failed to download!\");\n continue;\n }\n\n if (downloader->getMessageBody().find(\"result\") != std::string::npos) {\n std::lock_guard<std::mutex> output_mutex_locker(*output_mutex);\n isbn_list_output->writeln(isbn);\n ++*isbn_found_count;\n std::cout << *isbn_found_count << '\\n';\n break;\n }\n }\n\n isbns.clear();\n }\n}\n\n\nvoid ProcessRecords(MARC::Reader * const marc_reader, std::deque<std::set<std::string>> * const task_queue,\n std::mutex * const task_queue_mutex, unsigned * const isbn_found_count)\n{\n Downloader downloader;\n unsigned record_count(0), monographs_with_isbns_found_count(0);\n while (const MARC::Record record = marc_reader->read()) {\n ++record_count;\n const auto isbns(record.getISBNs());\n if (isbns.empty())\n continue;\n\n ++monographs_with_isbns_found_count;\n\n std::lock_guard<std::mutex> task_queue_mutex_locker(*task_queue_mutex);\n task_queue->push_back(isbns);\n }\n work_available = false; \/\/ Let our worker threads return.\n\n LOG_INFO(\"Processed \" + std::to_string(record_count) + \" record(s) and found \"\n + std::to_string(*isbn_found_count) + \" ISBN('s) that are\/is present on archive.org.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 4)\n Usage();\n\n const unsigned WORKER_THREAD_COUNT(StringUtil::ToUnsigned(argv[1]));\n std::vector<std::thread> thread_pool((WORKER_THREAD_COUNT));\n std::deque<std::set<std::string>> task_queue;\n std::mutex task_queue_mutex, output_mutex;\n unsigned isbn_found_count(0);\n auto isbn_list_output(FileUtil::OpenOutputFileOrDie(argv[3]));\n for (size_t i(0); i < WORKER_THREAD_COUNT; ++i)\n thread_pool[i] = std::thread(WorkerThread, new Downloader(), &task_queue, &task_queue_mutex,\n &isbn_found_count, isbn_list_output.get(), &output_mutex);\n\n auto marc_reader(MARC::Reader::Factory(argv[2]));\n ProcessRecords(marc_reader.get(), &task_queue, &task_queue_mutex, &isbn_found_count);\n\n for (size_t i(0); i < WORKER_THREAD_COUNT; ++i)\n thread_pool[i].join();\n\n return EXIT_SUCCESS;\n}\n<commit_msg>This one actually seems to work.<commit_after>\/** \\brief Utility for checking which ISBNS can be found on archive.org.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2021 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <atomic>\n#include <chrono>\n#include <iostream>\n#include <deque>\n#include <mutex>\n#include <thread>\n#include <cstdio>\n#include <cstdlib>\n#include \"Downloader.h\"\n#include \"FileUtil.h\"\n#include \"StringUtil.h\"\n#include \"MARC.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\n[[noreturn]] void Usage() {\n ::Usage(\"[--summarize-tags] [--verbose] worker_thread_count marc_data isbn_list_output\");\n}\n\n\nstd::atomic<bool> work_available(true);\n\n\nvoid WorkerThread(Downloader * const downloader, std::deque<std::set<std::string>> * const task_queue,\n std::mutex * const task_queue_mutex, unsigned * const isbn_found_count, File * const isbn_list_output,\n std::mutex * const output_mutex)\n{\n std::set<std::string> isbns;\n for (;;) {\n {\n std::lock_guard<std::mutex> task_queue_mutex_locker(*task_queue_mutex);\n if (not task_queue->empty()) {\n isbns = task_queue->front();\n task_queue->pop_front();\n }\n }\n\n if (isbns.empty()) {\n if (not work_available)\n return;\n std::this_thread::sleep_for(std::chrono::seconds(20));\n continue;\n }\n\n for (const auto &isbn : isbns) {\n const std::string url(\"https:\/\/archive.org\/metadata\/isbn_\" + isbn + \"\/created\");\n if (not downloader->newUrl(url)) {\n std::lock_guard<std::mutex> output_mutex_locker(*output_mutex);\n LOG_WARNING(\"URL \\\"\" + url + \" failed to download! (\"\n + downloader->getLastErrorMessage() + \")\");\n continue;\n }\n\n if (downloader->getMessageBody().find(\"result\") != std::string::npos) {\n std::lock_guard<std::mutex> output_mutex_locker(*output_mutex);\n isbn_list_output->writeln(isbn);\n ++*isbn_found_count;\n std::cout << *isbn_found_count << '\\n';\n break;\n }\n }\n\n isbns.clear();\n }\n}\n\n\nvoid ProcessRecords(MARC::Reader * const marc_reader, std::deque<std::set<std::string>> * const task_queue,\n std::mutex * const task_queue_mutex)\n{\n unsigned record_count(0);\n while (const MARC::Record record = marc_reader->read()) {\n ++record_count;\n const auto isbns(record.getISBNs());\n if (isbns.empty())\n continue;\n\n std::lock_guard<std::mutex> task_queue_mutex_locker(*task_queue_mutex);\n task_queue->push_back(isbns);\n }\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 4)\n Usage();\n\n const unsigned WORKER_THREAD_COUNT(StringUtil::ToUnsigned(argv[1]));\n std::vector<std::thread> thread_pool((WORKER_THREAD_COUNT));\n std::deque<std::set<std::string>> task_queue;\n std::mutex task_queue_mutex, output_mutex;\n unsigned isbn_found_count(0);\n auto isbn_list_output(FileUtil::OpenOutputFileOrDie(argv[3]));\n for (size_t i(0); i < WORKER_THREAD_COUNT; ++i)\n thread_pool[i] = std::thread(WorkerThread, new Downloader(), &task_queue, &task_queue_mutex,\n &isbn_found_count, isbn_list_output.get(), &output_mutex);\n\n auto marc_reader(MARC::Reader::Factory(argv[2]));\n ProcessRecords(marc_reader.get(), &task_queue, &task_queue_mutex);\n\n work_available = false; \/\/ Let our worker threads return.\n for (size_t i(0); i < WORKER_THREAD_COUNT; ++i)\n thread_pool[i].join();\n LOG_INFO(\"Found \" + std::to_string(isbn_found_count) + \" monographs on Archive.org.\");\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2015 - present Advanced Micro Devices, Inc. All rights reserved.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <hip\/hip_runtime.h>\n#include <hip\/hcc_detail\/texture_types.h>\n#include \"hip_internal.hpp\"\n\nstruct hipTexture {\n hipResourceDesc resDesc;\n hipTextureDesc texDesc;\n hipResourceViewDesc resViewDesc;\n hsa_ext_image_t image;\n hsa_ext_sampler_t sampler;\n};\n\nhipError_t hipCreateTextureObject(hipTextureObject_t* pTexObject, const hipResourceDesc* pResDesc,\n const hipTextureDesc* pTexDesc,\n const hipResourceViewDesc* pResViewDesc) {\n HIP_INIT_API(pTexObject, pResDesc, pTexDesc, pResViewDesc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipDestroyTextureObject(hipTextureObject_t textureObject) {\n HIP_INIT_API(textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectResourceDesc(hipResourceDesc* pResDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pResDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectResourceViewDesc(hipResourceViewDesc* pResViewDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pResViewDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectTextureDesc(hipTextureDesc* pTexDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pTexDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTexture(size_t* offset, textureReference* tex, const void* devPtr,\n const hipChannelFormatDesc* desc, size_t size) {\n HIP_INIT_API(offset, tex, devPtr, desc, size);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTexture2D(size_t* offset, textureReference* tex, const void* devPtr,\n const hipChannelFormatDesc* desc, size_t width, size_t height,\n size_t pitch) {\n HIP_INIT_API(offset, tex, devPtr, desc, width, height, pitch);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTextureToArray(textureReference* tex, hipArray_const_t array,\n const hipChannelFormatDesc* desc) {\n HIP_INIT_API(tex, array, desc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTextureToMipmappedArray(textureReference* tex,\n hipMipmappedArray_const_t mipmappedArray,\n const hipChannelFormatDesc* desc) {\n HIP_INIT_API(tex, mipmappedArray, desc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipUnbindTexture(const textureReference* tex) {\n HIP_INIT_API(tex);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetChannelDesc(hipChannelFormatDesc* desc, hipArray_const_t array) {\n HIP_INIT_API(desc, array);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureAlignmentOffset(size_t* offset, const textureReference* tex) {\n HIP_INIT_API(offset, tex);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureReference(const textureReference** tex, const void* symbol) {\n HIP_INIT_API(tex, symbol);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFormat(textureReference* tex, hipArray_Format fmt, int NumPackedComponents) {\n HIP_INIT_API(tex, fmt, NumPackedComponents);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFlags(textureReference* tex, unsigned int flags) {\n HIP_INIT_API(tex, flags);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFilterMode(textureReference* tex, hipTextureFilterMode fm) {\n HIP_INIT_API(tex, fm);\n}\n\nhipError_t hipTexRefSetAddressMode(textureReference* tex, int dim, hipTextureAddressMode am) {\n HIP_INIT_API(tex, dim, am);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetArray(textureReference* tex, hipArray_const_t array, unsigned int flags) {\n HIP_INIT_API(tex, array, flags);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetAddress(size_t* offset, textureReference* tex, hipDeviceptr_t devPtr,\n size_t size) {\n HIP_INIT_API(offset, tex, devPtr, size);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetAddress2D(textureReference* tex, const HIP_ARRAY_DESCRIPTOR* desc,\n hipDeviceptr_t devPtr, size_t pitch) {\n HIP_INIT_API(tex, desc, devPtr, pitch);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}<commit_msg>P4 to Git Change 1537232 by skudchad@skudchad_rocm on 2018\/04\/05 15:00:24<commit_after>\/*\nCopyright (c) 2015 - present Advanced Micro Devices, Inc. All rights reserved.\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <hip\/hip_runtime.h>\n#include <hip\/hcc_detail\/texture_types.h>\n#include \"hip_internal.hpp\"\n\n\nhipError_t hipCreateTextureObject(hipTextureObject_t* pTexObject, const hipResourceDesc* pResDesc,\n const hipTextureDesc* pTexDesc,\n const hipResourceViewDesc* pResViewDesc) {\n HIP_INIT_API(pTexObject, pResDesc, pTexDesc, pResViewDesc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipDestroyTextureObject(hipTextureObject_t textureObject) {\n HIP_INIT_API(textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectResourceDesc(hipResourceDesc* pResDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pResDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectResourceViewDesc(hipResourceViewDesc* pResViewDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pResViewDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureObjectTextureDesc(hipTextureDesc* pTexDesc,\n hipTextureObject_t textureObject) {\n HIP_INIT_API(pTexDesc, textureObject);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTexture(size_t* offset, textureReference* tex, const void* devPtr,\n const hipChannelFormatDesc* desc, size_t size) {\n HIP_INIT_API(offset, tex, devPtr, desc, size);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTexture2D(size_t* offset, textureReference* tex, const void* devPtr,\n const hipChannelFormatDesc* desc, size_t width, size_t height,\n size_t pitch) {\n HIP_INIT_API(offset, tex, devPtr, desc, width, height, pitch);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTextureToArray(textureReference* tex, hipArray_const_t array,\n const hipChannelFormatDesc* desc) {\n HIP_INIT_API(tex, array, desc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipBindTextureToMipmappedArray(textureReference* tex,\n hipMipmappedArray_const_t mipmappedArray,\n const hipChannelFormatDesc* desc) {\n HIP_INIT_API(tex, mipmappedArray, desc);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipUnbindTexture(const textureReference* tex) {\n HIP_INIT_API(tex);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetChannelDesc(hipChannelFormatDesc* desc, hipArray_const_t array) {\n HIP_INIT_API(desc, array);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureAlignmentOffset(size_t* offset, const textureReference* tex) {\n HIP_INIT_API(offset, tex);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipGetTextureReference(const textureReference** tex, const void* symbol) {\n HIP_INIT_API(tex, symbol);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFormat(textureReference* tex, hipArray_Format fmt, int NumPackedComponents) {\n HIP_INIT_API(tex, fmt, NumPackedComponents);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFlags(textureReference* tex, unsigned int flags) {\n HIP_INIT_API(tex, flags);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetFilterMode(textureReference* tex, hipTextureFilterMode fm) {\n HIP_INIT_API(tex, fm);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown; \n}\n\nhipError_t hipTexRefSetAddressMode(textureReference* tex, int dim, hipTextureAddressMode am) {\n HIP_INIT_API(tex, dim, am);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetArray(textureReference* tex, hipArray_const_t array, unsigned int flags) {\n HIP_INIT_API(tex, array, flags);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetAddress(size_t* offset, textureReference* tex, hipDeviceptr_t devPtr,\n size_t size) {\n HIP_INIT_API(offset, tex, devPtr, size);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}\n\nhipError_t hipTexRefSetAddress2D(textureReference* tex, const HIP_ARRAY_DESCRIPTOR* desc,\n hipDeviceptr_t devPtr, size_t pitch) {\n HIP_INIT_API(tex, desc, devPtr, pitch);\n\n assert(0 && \"Unimplemented\");\n\n return hipErrorUnknown;\n}<|endoftext|>"} {"text":"<commit_before>#include <Windows.h>\n#include <stdint.h> \/\/ Types indpendent de la plateforme\n\n\/\/ Pour bien comprendre la diffrence de fonctionnement des variables statiques en C en fonction du scope\n#define internal static \/\/ fonctions non visible depuis l'extrieur de ce fichier\n#define local_persist static \/\/ variable visibles juste dans le scope o elle dfinie\n#define global_variable static \/\/ variable visible dans tous le fichiers (globale)\n\ntypedef unsigned char uint8;\ntypedef uint8_t uint8; \/\/ comme un unsigned char, un 8 bits\ntypedef int16_t uint16;\ntypedef int32_t uint32;\ntypedef int64_t uint64;\n\n\/* Struct sui reprsente un backbuffer qui nous permet de dessiner *\/\nstruct win32_offscreen_buffer {\n BITMAPINFO Info;\n void *Memory;\n int Width;\n int Height;\n int BytesPerPixel;\n int Pitch; \/\/ Pitch reprsente la taille d'une ligne en octets\n};\n\n\/\/ variables globales pour le moment, on grera autrement plus tard\nglobal_variable bool Running;\nglobal_variable win32_offscreen_buffer GlobalBackBuffer;\n\nstruct win32_window_dimension\n{\n int Width;\n int Height;\n};\n\nwin32_window_dimension\nWin32GetWindowDimension(HWND Window) {\n win32_window_dimension Result;\n RECT ClientRect;\n GetClientRect(Window, &ClientRect);\n Result.Width = ClientRect.right - ClientRect.left;\n Result.Height = ClientRect.bottom - ClientRect.top;\n return(Result);\n}\n\ninternal void\nRenderWeirdGradient(win32_offscreen_buffer *Buffer, int XOffset, int YOffset)\n{\n uint8 *Row = (uint8 *)Buffer->Memory; \/\/ on va se dplacer dans la mmoire par pas de 8 bits\n for (int Y = 0; Y < Buffer->Height; ++Y)\n {\n uint32 *Pixel = (uint32 *)Row; \/\/ Pixel par pixel, on commence par le premier de la ligne\n for (int X = 0; X < Buffer->Width; ++X)\n {\n \/*\n Pixels en little endian architecture\n 0 1 2 3 ...\n Pixels en mmoire : 00 00 00 00 ...\n Couleur BB GG RR XX\n en hexa: 0xXXRRGGBB\n *\/\n uint8 Blue = (X + XOffset);\n uint8 Green = (Y + YOffset);\n uint8 Red = (X + Y);\n \/\/ *Pixel = 0xFF00FF00;\n *Pixel++ = ((Red << 16) | (Green << 8) | Blue); \/\/ ce qui quivaut en hexa 0x00BBGG00\n }\n Row += Buffer->Pitch; \/\/ Ligne suivante\n }\n}\n\n\/**\n * DIB: Device Independent Bitmap\n **\/\ninternal void\nWin32ResizeDIBSection(win32_offscreen_buffer *Buffer, int Width, int Height)\n{\n if (Buffer->Memory)\n {\n VirtualFree(Buffer->Memory, 0, MEM_RELEASE); \/\/ cf. VirtualProtect, utile pour debug\n }\n\n Buffer->Width = Width;\n Buffer->Height = Height;\n Buffer->BytesPerPixel = 4;\n\n Buffer->Info.bmiHeader.biSize = sizeof(Buffer->Info.bmiHeader);\n Buffer->Info.bmiHeader.biWidth = Buffer->Width;\n Buffer->Info.bmiHeader.biHeight = -Buffer->Height; \/\/ Attention au sens des coordonnes, du bas vers le haut (d'o le moins)\n Buffer->Info.bmiHeader.biPlanes = 1;\n Buffer->Info.bmiHeader.biBitCount = 32;\n Buffer->Info.bmiHeader.biCompression = BI_RGB;\n \n int BitmapMemorySize = (Buffer->Width * Buffer->Height) * Buffer->BytesPerPixel;\n Buffer->Memory = VirtualAlloc(0, BitmapMemorySize, MEM_COMMIT, PAGE_READWRITE); \/\/ cf. aussi HeapAlloc\n\n Buffer->Pitch = Width * Buffer->BytesPerPixel;\n}\n\n\/**\n * Ici au dbut on passait ClientRect par rfrence avec un pointeur (*ClientRect)\n * cependant comme la structure est petite le passer par valeur est suffisant\n **\/\ninternal void\nWin32DisplayBufferInWindow(\n HDC DeviceContext,\n int WindowWidth,\n int WindowHeight,\n win32_offscreen_buffer *Buffer)\n{\n StretchDIBits( \/\/ copie d'un rectangle vers un autre (scaling si ncessaire, bit oprations...)\n DeviceContext,\n 0, 0, WindowWidth, WindowHeight,\n 0, 0, Buffer->Width, Buffer->Height,\n Buffer->Memory,\n &Buffer->Info,\n DIB_RGB_COLORS,\n SRCCOPY \/\/ BitBlt: bit-block transfer of the color data => voir les autres modes dans la MSDN\n );\n}\n\nLRESULT CALLBACK\nWin32MainWindowCallback(\n HWND Window,\n UINT Message,\n WPARAM WParam,\n LPARAM LParam)\n{\n LRESULT Result = 0;\n switch(Message)\n {\n case WM_SIZE:\n {\n OutputDebugStringA(\"WM_SIZE\\n\");\n }\n break;\n case WM_DESTROY:\n {\n \/\/ PostQuitMessage(0); \/\/ Va permettre de sortir de la boucle infinie en dessous\n Running = false;\n OutputDebugStringA(\"WM_DESTROY\\n\");\n }\n break;\n case WM_CLOSE:\n {\n \/\/ DestroyWindow(Window);\n Running = false;\n OutputDebugStringA(\"WM_CLOSE\\n\");\n }\n break;\n case WM_ACTIVATEAPP:\n {\n OutputDebugStringA(\"WM_ACTIVATEAPP\\n\");\n }\n break;\n case WM_PAINT:\n {\n PAINTSTRUCT Paint;\n HDC DeviceContext = BeginPaint(Window, &Paint);\n win32_window_dimension Dimension = Win32GetWindowDimension(Window);\n Win32DisplayBufferInWindow(DeviceContext, Dimension.Width, Dimension.Height, &GlobalBackBuffer);\n EndPaint(Window, &Paint);\n }\n break;\n default:\n {\n \/\/ OutputDebugStringA(\"default\\n\");\n Result = DefWindowProc(Window, Message, WParam, LParam);\n }\n break;\n }\n return(Result);\n}\n\nint CALLBACK\nWinMain(\n HINSTANCE Instance,\n HINSTANCE PrevInstance,\n LPSTR CommandLine,\n int ShowCode)\n{\n \/\/ Cration de la fentre principale\n WNDCLASSA WindowClass = {}; \/\/ initialisation par dfaut, ANSI version de WNDCLASSA\n\n Win32ResizeDIBSection(&GlobalBackBuffer, 800, 600);\n\n \/\/ On ne configure que les membres que l'on veut\n WindowClass.style = CS_HREDRAW|CS_VREDRAW|CS_OWNDC; \/\/ indique que l'on veut rafraichir la fentre entire lors d'un resize (horizontal et vertical)\n WindowClass.lpfnWndProc = Win32MainWindowCallback;\n WindowClass.hInstance = Instance;\n \/\/ WindowClass.hIcon;\n WindowClass.lpszClassName = \"FaitmainHerosWindowClass\"; \/\/ nom pour retrouver la fentre\n\n \/\/ Ouverture de la fentre\n if (RegisterClassA(&WindowClass))\n {\n HWND Window = CreateWindowExA( \/\/ ANSI version de CreateWindowEx\n 0, \/\/ dwExStyle : options de la fentre\n WindowClass.lpszClassName,\n \"FaitmainHeros\",\n WS_OVERLAPPEDWINDOW|WS_VISIBLE, \/\/dwStyle : overlapped window, visible par dfaut\n CW_USEDEFAULT, \/\/ X\n CW_USEDEFAULT, \/\/ Y\n CW_USEDEFAULT, \/\/ nWidth\n CW_USEDEFAULT, \/\/ nHeight\n 0, \/\/ hWndParent : 0 pour dire que c'est une fentre top\n 0, \/\/ hMenu : 0 pour dire pas de menu\n Instance,\n 0 \/\/ Pas de passage de paramtres la fentre\n );\n if (Window)\n {\n \/\/ Comme on a spcifi CS_OWNDC on peut initialiser un seul HDC\n \/\/ et s'en servir indfiniment car on ne le partage pas\n HDC DeviceContext = GetDC(Window);\n\n int XOffset = 0;\n int YOffset = 0;\n MSG Message;\n Running = true;\n \n while (Running) \/\/ boucle infinie pour traiter tous les messages\n {\n while(PeekMessageA(&Message, 0, 0, 0, PM_REMOVE)) \/\/ On utilise PeekMessage au lieu de GetMessage qui est bloquant\n {\n if (Message.message == WM_QUIT) Running = false;\n TranslateMessage(&Message); \/\/ On demande Windows de traiter le message\n DispatchMessage(&Message); \/\/ Envoie le message au main WindowCallback, que l'on a dfini et dclar au dessus\n }\n \n \/\/ Grce PeekMessage on a tout le temps CPU que l'on veut et on peut dessiner ici\n RenderWeirdGradient(&GlobalBackBuffer, XOffset, YOffset);\n ++XOffset;\n\n \/\/ On doit alors crire dans la fentre chaque fois que l'on veut rendre\n \/\/ On en fera une fonction propre\n win32_window_dimension Dimension = Win32GetWindowDimension(Window);\n Win32DisplayBufferInWindow(\n DeviceContext,\n Dimension.Width, Dimension.Height,\n &GlobalBackBuffer);\n ReleaseDC(Window, DeviceContext);\n\n \/\/ Pour animer diffremment le gradient\n ++XOffset;\n YOffset += 2;\n }\n }\n else\n {\n OutputDebugStringA(\"Error: CreateWindowEx\\n\");\n }\n }\n else\n {\n OutputDebugStringA(\"Error: RegisterClass\\n\");\n }\n\n return(0);\n};<commit_msg>Début de gestion de la manette<commit_after>#include <Windows.h>\n#include <stdint.h> \/\/ Types indpendent de la plateforme\n#include <Xinput.h> \/\/ Pour la gestion des entres (manette...)\n\n\/\/ Pour bien comprendre la diffrence de fonctionnement des variables statiques en C en fonction du scope\n#define internal static \/\/ fonctions non visible depuis l'extrieur de ce fichier\n#define local_persist static \/\/ variable visibles juste dans le scope o elle dfinie\n#define global_variable static \/\/ variable visible dans tous le fichiers (globale)\n\ntypedef unsigned char uint8;\ntypedef uint8_t uint8; \/\/ comme un unsigned char, un 8 bits\ntypedef int16_t uint16;\ntypedef int32_t uint32;\ntypedef int64_t uint64;\n\n\/* Struct sui reprsente un backbuffer qui nous permet de dessiner *\/\nstruct win32_offscreen_buffer {\n BITMAPINFO Info;\n void *Memory;\n int Width;\n int Height;\n int BytesPerPixel;\n int Pitch; \/\/ Pitch reprsente la taille d'une ligne en octets\n};\n\n\/\/ variables globales pour le moment, on grera autrement plus tard\nglobal_variable bool Running;\nglobal_variable win32_offscreen_buffer GlobalBackBuffer;\n\nstruct win32_window_dimension\n{\n int Width;\n int Height;\n};\n\nwin32_window_dimension\nWin32GetWindowDimension(HWND Window) {\n win32_window_dimension Result;\n RECT ClientRect;\n GetClientRect(Window, &ClientRect);\n Result.Width = ClientRect.right - ClientRect.left;\n Result.Height = ClientRect.bottom - ClientRect.top;\n return(Result);\n}\n\ninternal void\nRenderWeirdGradient(win32_offscreen_buffer *Buffer, int XOffset, int YOffset)\n{\n uint8 *Row = (uint8 *)Buffer->Memory; \/\/ on va se dplacer dans la mmoire par pas de 8 bits\n for (int Y = 0; Y < Buffer->Height; ++Y)\n {\n uint32 *Pixel = (uint32 *)Row; \/\/ Pixel par pixel, on commence par le premier de la ligne\n for (int X = 0; X < Buffer->Width; ++X)\n {\n \/*\n Pixels en little endian architecture\n 0 1 2 3 ...\n Pixels en mmoire : 00 00 00 00 ...\n Couleur BB GG RR XX\n en hexa: 0xXXRRGGBB\n *\/\n uint8 Blue = (X + XOffset);\n uint8 Green = (Y + YOffset);\n uint8 Red = (X + Y);\n \/\/ *Pixel = 0xFF00FF00;\n *Pixel++ = ((Red << 16) | (Green << 8) | Blue); \/\/ ce qui quivaut en hexa 0x00BBGG00\n }\n Row += Buffer->Pitch; \/\/ Ligne suivante\n }\n}\n\n\/**\n * DIB: Device Independent Bitmap\n **\/\ninternal void\nWin32ResizeDIBSection(win32_offscreen_buffer *Buffer, int Width, int Height)\n{\n if (Buffer->Memory)\n {\n VirtualFree(Buffer->Memory, 0, MEM_RELEASE); \/\/ cf. VirtualProtect, utile pour debug\n }\n\n Buffer->Width = Width;\n Buffer->Height = Height;\n Buffer->BytesPerPixel = 4;\n\n Buffer->Info.bmiHeader.biSize = sizeof(Buffer->Info.bmiHeader);\n Buffer->Info.bmiHeader.biWidth = Buffer->Width;\n Buffer->Info.bmiHeader.biHeight = -Buffer->Height; \/\/ Attention au sens des coordonnes, du bas vers le haut (d'o le moins)\n Buffer->Info.bmiHeader.biPlanes = 1;\n Buffer->Info.bmiHeader.biBitCount = 32;\n Buffer->Info.bmiHeader.biCompression = BI_RGB;\n \n int BitmapMemorySize = (Buffer->Width * Buffer->Height) * Buffer->BytesPerPixel;\n Buffer->Memory = VirtualAlloc(0, BitmapMemorySize, MEM_COMMIT, PAGE_READWRITE); \/\/ cf. aussi HeapAlloc\n\n Buffer->Pitch = Width * Buffer->BytesPerPixel;\n}\n\n\/**\n * Ici au dbut on passait ClientRect par rfrence avec un pointeur (*ClientRect)\n * cependant comme la structure est petite le passer par valeur est suffisant\n **\/\ninternal void\nWin32DisplayBufferInWindow(\n HDC DeviceContext,\n int WindowWidth,\n int WindowHeight,\n win32_offscreen_buffer *Buffer)\n{\n StretchDIBits( \/\/ copie d'un rectangle vers un autre (scaling si ncessaire, bit oprations...)\n DeviceContext,\n 0, 0, WindowWidth, WindowHeight,\n 0, 0, Buffer->Width, Buffer->Height,\n Buffer->Memory,\n &Buffer->Info,\n DIB_RGB_COLORS,\n SRCCOPY \/\/ BitBlt: bit-block transfer of the color data => voir les autres modes dans la MSDN\n );\n}\n\nLRESULT CALLBACK\nWin32MainWindowCallback(\n HWND Window,\n UINT Message,\n WPARAM WParam,\n LPARAM LParam)\n{\n LRESULT Result = 0;\n switch(Message)\n {\n case WM_SIZE:\n {\n OutputDebugStringA(\"WM_SIZE\\n\");\n }\n break;\n case WM_DESTROY:\n {\n \/\/ PostQuitMessage(0); \/\/ Va permettre de sortir de la boucle infinie en dessous\n Running = false;\n OutputDebugStringA(\"WM_DESTROY\\n\");\n }\n break;\n case WM_CLOSE:\n {\n \/\/ DestroyWindow(Window);\n Running = false;\n OutputDebugStringA(\"WM_CLOSE\\n\");\n }\n break;\n case WM_ACTIVATEAPP:\n {\n OutputDebugStringA(\"WM_ACTIVATEAPP\\n\");\n }\n break;\n case WM_PAINT:\n {\n PAINTSTRUCT Paint;\n HDC DeviceContext = BeginPaint(Window, &Paint);\n win32_window_dimension Dimension = Win32GetWindowDimension(Window);\n Win32DisplayBufferInWindow(DeviceContext, Dimension.Width, Dimension.Height, &GlobalBackBuffer);\n EndPaint(Window, &Paint);\n }\n break;\n default:\n {\n \/\/ OutputDebugStringA(\"default\\n\");\n Result = DefWindowProc(Window, Message, WParam, LParam);\n }\n break;\n }\n return(Result);\n}\n\nint CALLBACK\nWinMain(\n HINSTANCE Instance,\n HINSTANCE PrevInstance,\n LPSTR CommandLine,\n int ShowCode)\n{\n \/\/ Cration de la fentre principale\n WNDCLASSA WindowClass = {}; \/\/ initialisation par dfaut, ANSI version de WNDCLASSA\n\n Win32ResizeDIBSection(&GlobalBackBuffer, 800, 600);\n\n \/\/ On ne configure que les membres que l'on veut\n WindowClass.style = CS_HREDRAW|CS_VREDRAW|CS_OWNDC; \/\/ indique que l'on veut rafraichir la fentre entire lors d'un resize (horizontal et vertical)\n WindowClass.lpfnWndProc = Win32MainWindowCallback;\n WindowClass.hInstance = Instance;\n \/\/ WindowClass.hIcon;\n WindowClass.lpszClassName = \"FaitmainHerosWindowClass\"; \/\/ nom pour retrouver la fentre\n\n \/\/ Ouverture de la fentre\n if (RegisterClassA(&WindowClass))\n {\n HWND Window = CreateWindowExA( \/\/ ANSI version de CreateWindowEx\n 0, \/\/ dwExStyle : options de la fentre\n WindowClass.lpszClassName,\n \"FaitmainHeros\",\n WS_OVERLAPPEDWINDOW|WS_VISIBLE, \/\/dwStyle : overlapped window, visible par dfaut\n CW_USEDEFAULT, \/\/ X\n CW_USEDEFAULT, \/\/ Y\n CW_USEDEFAULT, \/\/ nWidth\n CW_USEDEFAULT, \/\/ nHeight\n 0, \/\/ hWndParent : 0 pour dire que c'est une fentre top\n 0, \/\/ hMenu : 0 pour dire pas de menu\n Instance,\n 0 \/\/ Pas de passage de paramtres la fentre\n );\n if (Window)\n {\n \/\/ Comme on a spcifi CS_OWNDC on peut initialiser un seul HDC\n \/\/ et s'en servir indfiniment car on ne le partage pas\n HDC DeviceContext = GetDC(Window);\n\n int XOffset = 0;\n int YOffset = 0;\n Running = true;\n \n while (Running) \/\/ boucle infinie pour traiter tous les messages\n {\n MSG Message;\n while(PeekMessageA(&Message, 0, 0, 0, PM_REMOVE)) \/\/ On utilise PeekMessage au lieu de GetMessage qui est bloquant\n {\n if (Message.message == WM_QUIT) Running = false;\n TranslateMessage(&Message); \/\/ On demande Windows de traiter le message\n DispatchMessage(&Message); \/\/ Envoie le message au main WindowCallback, que l'on a dfini et dclar au dessus\n }\n\n \/\/ Gestion des entres, pour le moment on gre a chaque image, il faudra peut-tre le faire plus frquemment\n \/\/ surtout si le nombre d'images par seconde chute\n for (DWORD ControllerIndex = 0; ControllerIndex < XUSER_MAX_COUNT; ++ControllerIndex)\n {\n XINPUT_STATE ControllerState;\n if (XInputGetState(ControllerIndex, &ControllerState) == ERROR_SUCCESS)\n {\n \/\/ Le controller est branch\n XINPUT_GAMEPAD *Pad = &ControllerState.Gamepad;\n\n bool Up = (Pad->wButtons & XINPUT_GAMEPAD_DPAD_UP);\n bool Down = (Pad->wButtons & XINPUT_GAMEPAD_DPAD_DOWN);\n bool Left = (Pad->wButtons & XINPUT_GAMEPAD_DPAD_LEFT);\n bool Right = (Pad->wButtons & XINPUT_GAMEPAD_DPAD_RIGHT);\n bool Start = (Pad->wButtons & XINPUT_GAMEPAD_START);\n bool Back = (Pad->wButtons & XINPUT_GAMEPAD_BACK);\n bool LeftShoulder = (Pad->wButtons & XINPUT_GAMEPAD_LEFT_SHOULDER);\n bool RightShoulder = (Pad->wButtons & XINPUT_GAMEPAD_RIGHT_SHOULDER);\n bool AButton = (Pad->wButtons & XINPUT_GAMEPAD_A);\n bool BButton = (Pad->wButtons & XINPUT_GAMEPAD_B);\n bool XButton = (Pad->wButtons & XINPUT_GAMEPAD_X);\n bool YButton = (Pad->wButtons & XINPUT_GAMEPAD_Y);\n\n uint16 StickX = Pad->sThumbLX;\n uint16 StickY = Pad->sThumbLY;\n }\n else\n {\n \/\/ Le controlleur n'est pas branch\n }\n }\n \n \/\/ Grce PeekMessage on a tout le temps CPU que l'on veut et on peut dessiner ici\n RenderWeirdGradient(&GlobalBackBuffer, XOffset, YOffset);\n ++XOffset;\n\n \/\/ On doit alors crire dans la fentre chaque fois que l'on veut rendre\n \/\/ On en fera une fonction propre\n win32_window_dimension Dimension = Win32GetWindowDimension(Window);\n Win32DisplayBufferInWindow(\n DeviceContext,\n Dimension.Width, Dimension.Height,\n &GlobalBackBuffer);\n ReleaseDC(Window, DeviceContext);\n\n \/\/ Pour animer diffremment le gradient\n ++XOffset;\n YOffset += 2;\n }\n }\n else\n {\n OutputDebugStringA(\"Error: CreateWindowEx\\n\");\n }\n }\n else\n {\n OutputDebugStringA(\"Error: RegisterClass\\n\");\n }\n\n return(0);\n};<|endoftext|>"} {"text":"<commit_before>\/*=============================================================================\n\n Library: CTK\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=============================================================================*\/\n\n#include \"ctkPluginContext.h\"\n#include \"ctkPluginContext_p.h\"\n\n#include \"ctkPluginPrivate_p.h\"\n#include \"ctkPluginFrameworkContext_p.h\"\n#include \"ctkServices_p.h\"\n#include \"ctkServiceRegistration.h\"\n#include \"ctkServiceReference.h\"\n#include \"ctkServiceReferencePrivate.h\"\n\n#include <stdexcept>\n\n\/\/----------------------------------------------------------------------------\nctkPluginContextPrivate::ctkPluginContextPrivate(ctkPluginPrivate* plugin)\n : plugin(plugin)\n{}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContextPrivate::isPluginContextValid() const\n{\n if (!plugin) {\n throw std::logic_error(\"This plugin context is no longer valid\");\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContextPrivate::invalidate()\n{\n plugin = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nctkPluginContext::ctkPluginContext(ctkPluginPrivate* plugin)\n : d_ptr(new ctkPluginContextPrivate(plugin))\n{}\n\n\/\/----------------------------------------------------------------------------\nctkPluginContext::~ctkPluginContext()\n{\n Q_D(ctkPluginContext);\n delete d;\n}\n\n\/\/----------------------------------------------------------------------------\nQVariant ctkPluginContext::getProperty(const QString& key) const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->props.value(key);\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::getPlugin() const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->q_func();\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::getPlugin(long id) const\n{\n Q_D(const ctkPluginContext);\n return d->plugin->fwCtx->plugins->getPlugin(id);\n}\n\n\/\/----------------------------------------------------------------------------\nQList<QSharedPointer<ctkPlugin> > ctkPluginContext::getPlugins() const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->plugins->getPlugins();\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::installPlugin(const QUrl& location, QIODevice* in)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->plugins->install(location, in);\n}\n\n\/\/----------------------------------------------------------------------------\nQFileInfo ctkPluginContext::getDataFile(const QString& filename)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n QDir dataRoot(d->plugin->getDataRoot().absolutePath());\n if (!dataRoot.exists())\n {\n if (!dataRoot.mkpath(dataRoot.absolutePath()))\n {\n qWarning() << \"Could not create persistent storage area:\" << dataRoot.absolutePath();\n }\n }\n\n return QFileInfo(dataRoot, filename);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceRegistration ctkPluginContext::registerService(const QStringList& clazzes, QObject* service, const ctkDictionary& properties)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->registerService(d->plugin, clazzes, service, properties);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceRegistration ctkPluginContext::registerService(const char* clazz, QObject* service, const ctkDictionary& properties)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n QStringList clazzes;\n clazzes.append(clazz);\n return d->plugin->fwCtx->services->registerService(d->plugin, clazzes, service, properties);\n}\n\n\/\/----------------------------------------------------------------------------\nQList<ctkServiceReference> ctkPluginContext::getServiceReferences(const QString& clazz, const QString& filter)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->get(clazz, filter, 0);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceReference ctkPluginContext::getServiceReference(const QString& clazz)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->get(d->plugin, clazz);\n}\n\n\/\/----------------------------------------------------------------------------\nQObject* ctkPluginContext::getService(const ctkServiceReference& reference)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n\n if (!reference)\n {\n throw std::invalid_argument(\"Default constructed ctkServiceReference is not a valid input to getService()\");\n }\n ctkServiceReference internalRef(reference);\n return internalRef.d_func()->getService(d->plugin->q_func());\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::ungetService(const ctkServiceReference& reference)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n ctkServiceReference ref = reference;\n return ref.d_func()->ungetService(d->plugin->q_func(), true);\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::connectPluginListener(const QObject* receiver, const char* method,\n Qt::ConnectionType type)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n \/\/ TODO check permissions for a direct connection\n if (type == Qt::DirectConnection || type == Qt::BlockingQueuedConnection)\n {\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(pluginChangedDirect(ctkPluginEvent)), method, type);\n }\n else if (type == Qt::QueuedConnection)\n {\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(pluginChangedQueued(ctkPluginEvent)), method, type);\n }\n else\n {\n throw std::invalid_argument(\"Only Qt::DirectConnection, Qt::QueuedConnection, or Qt::BlockingQueuedConnection are allowed as type argument.\");\n }\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::connectFrameworkListener(const QObject* receiver, const char* method, Qt::ConnectionType type)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n \/\/ TODO check permissions for a direct connection\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(frameworkEvent(ctkPluginFrameworkEvent)), method, type);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContext::connectServiceListener(QObject* receiver, const char* slot,\n const QString& filter)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n d->plugin->fwCtx->listeners.addServiceSlot(getPlugin(), receiver, slot, filter);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContext::disconnectServiceListener(QObject* receiver,\n const char* slot)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n d->plugin->fwCtx->listeners.removeServiceSlot(getPlugin(), receiver, slot);\n}\n<commit_msg>getDataFile() now returns the complete path (dropped last segment).<commit_after>\/*=============================================================================\n\n Library: CTK\n\n Copyright (c) German Cancer Research Center,\n Division of Medical and Biological Informatics\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=============================================================================*\/\n\n#include \"ctkPluginContext.h\"\n#include \"ctkPluginContext_p.h\"\n\n#include \"ctkPluginPrivate_p.h\"\n#include \"ctkPluginFrameworkContext_p.h\"\n#include \"ctkServices_p.h\"\n#include \"ctkServiceRegistration.h\"\n#include \"ctkServiceReference.h\"\n#include \"ctkServiceReferencePrivate.h\"\n\n#include <stdexcept>\n\n\/\/----------------------------------------------------------------------------\nctkPluginContextPrivate::ctkPluginContextPrivate(ctkPluginPrivate* plugin)\n : plugin(plugin)\n{}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContextPrivate::isPluginContextValid() const\n{\n if (!plugin) {\n throw std::logic_error(\"This plugin context is no longer valid\");\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContextPrivate::invalidate()\n{\n plugin = 0;\n}\n\n\/\/----------------------------------------------------------------------------\nctkPluginContext::ctkPluginContext(ctkPluginPrivate* plugin)\n : d_ptr(new ctkPluginContextPrivate(plugin))\n{}\n\n\/\/----------------------------------------------------------------------------\nctkPluginContext::~ctkPluginContext()\n{\n Q_D(ctkPluginContext);\n delete d;\n}\n\n\/\/----------------------------------------------------------------------------\nQVariant ctkPluginContext::getProperty(const QString& key) const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->props.value(key);\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::getPlugin() const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->q_func();\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::getPlugin(long id) const\n{\n Q_D(const ctkPluginContext);\n return d->plugin->fwCtx->plugins->getPlugin(id);\n}\n\n\/\/----------------------------------------------------------------------------\nQList<QSharedPointer<ctkPlugin> > ctkPluginContext::getPlugins() const\n{\n Q_D(const ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->plugins->getPlugins();\n}\n\n\/\/----------------------------------------------------------------------------\nQSharedPointer<ctkPlugin> ctkPluginContext::installPlugin(const QUrl& location, QIODevice* in)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->plugins->install(location, in);\n}\n\n\/\/----------------------------------------------------------------------------\nQFileInfo ctkPluginContext::getDataFile(const QString& filename)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n QDir dataRoot(d->plugin->getDataRoot().absoluteFilePath());\n if (!dataRoot.exists())\n {\n if (!dataRoot.mkpath(dataRoot.absolutePath()))\n {\n qWarning() << \"Could not create persistent storage area:\" << dataRoot.absolutePath();\n }\n }\n\n return QFileInfo(dataRoot, filename);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceRegistration ctkPluginContext::registerService(const QStringList& clazzes, QObject* service, const ctkDictionary& properties)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->registerService(d->plugin, clazzes, service, properties);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceRegistration ctkPluginContext::registerService(const char* clazz, QObject* service, const ctkDictionary& properties)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n QStringList clazzes;\n clazzes.append(clazz);\n return d->plugin->fwCtx->services->registerService(d->plugin, clazzes, service, properties);\n}\n\n\/\/----------------------------------------------------------------------------\nQList<ctkServiceReference> ctkPluginContext::getServiceReferences(const QString& clazz, const QString& filter)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->get(clazz, filter, 0);\n}\n\n\/\/----------------------------------------------------------------------------\nctkServiceReference ctkPluginContext::getServiceReference(const QString& clazz)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n return d->plugin->fwCtx->services->get(d->plugin, clazz);\n}\n\n\/\/----------------------------------------------------------------------------\nQObject* ctkPluginContext::getService(const ctkServiceReference& reference)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n\n if (!reference)\n {\n throw std::invalid_argument(\"Default constructed ctkServiceReference is not a valid input to getService()\");\n }\n ctkServiceReference internalRef(reference);\n return internalRef.d_func()->getService(d->plugin->q_func());\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::ungetService(const ctkServiceReference& reference)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n ctkServiceReference ref = reference;\n return ref.d_func()->ungetService(d->plugin->q_func(), true);\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::connectPluginListener(const QObject* receiver, const char* method,\n Qt::ConnectionType type)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n \/\/ TODO check permissions for a direct connection\n if (type == Qt::DirectConnection || type == Qt::BlockingQueuedConnection)\n {\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(pluginChangedDirect(ctkPluginEvent)), method, type);\n }\n else if (type == Qt::QueuedConnection)\n {\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(pluginChangedQueued(ctkPluginEvent)), method, type);\n }\n else\n {\n throw std::invalid_argument(\"Only Qt::DirectConnection, Qt::QueuedConnection, or Qt::BlockingQueuedConnection are allowed as type argument.\");\n }\n}\n\n\/\/----------------------------------------------------------------------------\nbool ctkPluginContext::connectFrameworkListener(const QObject* receiver, const char* method, Qt::ConnectionType type)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n \/\/ TODO check permissions for a direct connection\n return receiver->connect(&(d->plugin->fwCtx->listeners), SIGNAL(frameworkEvent(ctkPluginFrameworkEvent)), method, type);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContext::connectServiceListener(QObject* receiver, const char* slot,\n const QString& filter)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n d->plugin->fwCtx->listeners.addServiceSlot(getPlugin(), receiver, slot, filter);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid ctkPluginContext::disconnectServiceListener(QObject* receiver,\n const char* slot)\n{\n Q_D(ctkPluginContext);\n d->isPluginContextValid();\n d->plugin->fwCtx->listeners.removeServiceSlot(getPlugin(), receiver, slot);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE-CHROMIUM file.\n\n#include \"common\/main_delegate.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"common\/content_client.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n\nnamespace brightray {\n\nMainDelegate::MainDelegate() {\n}\n\nMainDelegate::~MainDelegate() {\n}\n\nscoped_ptr<ContentClient> MainDelegate::CreateContentClient() {\n return make_scoped_ptr(new ContentClient).Pass();\n}\n\nbool MainDelegate::BasicStartupComplete(int* exit_code) {\n content_client_ = CreateContentClient().Pass();\n SetContentClient(content_client_.get());\n#if defined(OS_MACOSX)\n OverrideChildProcessPath();\n OverrideFrameworkBundlePath();\n#endif\n return false;\n}\n\nvoid MainDelegate::PreSandboxStartup() {\n InitializeResourceBundle();\n}\n\nvoid MainDelegate::InitializeResourceBundle() {\n base::FilePath path;\n#if defined(OS_MACOSX)\n path = GetResourcesPakFilePath();\n#else\n base::FilePath pak_dir;\n PathService::Get(base::DIR_MODULE, &pak_dir);\n path = pak_dir.Append(FILE_PATH_LITERAL(\"content_shell.pak\"));\n#endif\n\n ui::ResourceBundle::InitSharedInstanceWithLocale(\"\", NULL,\n ui::ResourceBundle::DO_NOT_LOAD_COMMON_RESOURCES);\n ui::ResourceBundle::GetSharedInstance().AddDataPackFromPath(path, ui::SCALE_FACTOR_100P);\n AddDataPackFromPath(&ui::ResourceBundle::GetSharedInstance(), path.DirName());\n}\n\ncontent::ContentBrowserClient* MainDelegate::CreateContentBrowserClient() {\n browser_client_ = CreateBrowserClient().Pass();\n return browser_client_.get();\n}\n\nscoped_ptr<BrowserClient> MainDelegate::CreateBrowserClient() {\n return make_scoped_ptr(new BrowserClient).Pass();\n}\n\n} \/\/ namespace brightray\n<commit_msg>Load content_shell.pak for current scale factor<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE-CHROMIUM file.\n\n#include \"common\/main_delegate.h\"\n\n#include \"browser\/browser_client.h\"\n#include \"common\/content_client.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n\nnamespace brightray {\n\nMainDelegate::MainDelegate() {\n}\n\nMainDelegate::~MainDelegate() {\n}\n\nscoped_ptr<ContentClient> MainDelegate::CreateContentClient() {\n return make_scoped_ptr(new ContentClient).Pass();\n}\n\nbool MainDelegate::BasicStartupComplete(int* exit_code) {\n content_client_ = CreateContentClient().Pass();\n SetContentClient(content_client_.get());\n#if defined(OS_MACOSX)\n OverrideChildProcessPath();\n OverrideFrameworkBundlePath();\n#endif\n return false;\n}\n\nvoid MainDelegate::PreSandboxStartup() {\n InitializeResourceBundle();\n}\n\nvoid MainDelegate::InitializeResourceBundle() {\n base::FilePath path;\n#if defined(OS_MACOSX)\n path = GetResourcesPakFilePath();\n#else\n base::FilePath pak_dir;\n PathService::Get(base::DIR_MODULE, &pak_dir);\n path = pak_dir.Append(FILE_PATH_LITERAL(\"content_shell.pak\"));\n#endif\n\n ui::ResourceBundle::InitSharedInstanceWithLocale(\"\", nullptr,\n ui::ResourceBundle::DO_NOT_LOAD_COMMON_RESOURCES);\n ui::ResourceBundle::GetSharedInstance().AddDataPackFromPath(\n path, ui::GetSupportedScaleFactors()[0]);\n AddDataPackFromPath(&ui::ResourceBundle::GetSharedInstance(), path.DirName());\n}\n\ncontent::ContentBrowserClient* MainDelegate::CreateContentBrowserClient() {\n browser_client_ = CreateBrowserClient().Pass();\n return browser_client_.get();\n}\n\nscoped_ptr<BrowserClient> MainDelegate::CreateBrowserClient() {\n return make_scoped_ptr(new BrowserClient).Pass();\n}\n\n} \/\/ namespace brightray\n<|endoftext|>"} {"text":"<commit_before>#ifndef _PAR_UTIL_\n#define _PAR_UTIL_\n\n#include \"common.hpp\"\n#include \"math.h\"\n#include \"assert.h\"\n\n\/\/ Determine whether or not we should wait for tasks in hybrid parallelism.\nbool should_task_wait(int mults_per_step, int total_rec_steps, int steps_left,\n int start_index, int position, int num_threads) {\n assert(0 < position && position <= mults_per_step);\n\n#if defined(_PARALLEL_) && (_PARALLEL_ == _BFS_PAR_)\n return position == mults_per_step;\n#endif\n\n int total_multiplies = pow(mults_per_step, total_rec_steps);\n int extra_multiplies = total_multiplies % num_threads;\n\n if (position == mults_per_step) {\n \/\/ The last position always waits.\n return true;\n }\n\n int end_index = total_multiplies - extra_multiplies;\n \/\/ There is exactly one wait at the bottom level of the recursive tree.\n if (steps_left == 1 && start_index + position == end_index) {\n \/\/std::cout << \"End stop: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return true;\n }\n\n int num_from_end = extra_multiplies \/ mults_per_step;\n if (steps_left == 2 && mults_per_step - num_from_end == position) {\n \/\/std::cout << \"Early stop: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return true;\n }\n\n return false;\n}\n\n\/\/ Determine whether or not we should launch a task for hybrid parallelism.\nbool should_launch_task(int mults_per_step, int total_rec_steps, int steps_left,\n int start_index, int position, int num_threads) {\n assert(0 < position && position <= mults_per_step);\n\n#if defined(_PARALLEL_) && (_PARALLEL_ == _BFS_PAR_)\n return true;\n#endif\n\n int total_multiplies = pow(mults_per_step, total_rec_steps);\n int extra_multiplies = total_multiplies % num_threads;\n\n \/\/ If the number of threads is greater than the total number of multiplies,\n \/\/ then we just run parallel MKL.\n if (num_threads > total_multiplies) {\n return false;\n }\n\n int end_index = total_multiplies - extra_multiplies;\n if (steps_left == 1 && start_index + position > end_index) {\n \/\/std::cout << \"Not launching: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return false;\n }\n \n int num_from_end = extra_multiplies \/ mults_per_step;\n if (steps_left == 2 && mults_per_step - num_from_end < position) {\n \/\/std::cout << \"Not launching: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return false;\n }\n\n return true;\n}\n\nclass Lock {\npublic:\n Lock() { omp_init_lock(&lock_); }\n ~Lock() { omp_destroy_lock(&lock_); }\n\n void Acquire() { omp_set_lock(&lock_); }\n void Release() { omp_unset_lock(&lock_); }\n\nprivate:\n omp_lock_t lock_;\n};\n\n\nclass LockAndCounter {\npublic:\n LockAndCounter(int count) : count_(count) { lock_.Acquire(); }\n\n void decrement() {\n#pragma omp atomic update\n --count_;\n if (count_ == 0) {\n lock_.Release();\n }\n }\n\n Lock& lock() { return lock_; }\n int count() { return count_; }\n\nprivate:\n int count_;\n Lock lock_;\n};\n\n#endif \/\/ _PAR_UTIL_\n<commit_msg>Fix some of the integer arithmetic and add in additional locking stuff.<commit_after>#ifndef _PAR_UTIL_\n#define _PAR_UTIL_\n\n#include \"common.hpp\"\n#include \"math.h\"\n#include \"assert.h\"\n\nint earliest_leaf_start(int mults_per_step, int steps_left, int start_index, int position) {\n if (steps_left == 1) {\n\treturn start_index;\n }\n int earliest_child_start = (start_index + position - 1) * mults_per_step;\n return earliest_leaf_start(mults_per_step, steps_left - 1, earliest_child_start, 1);\n}\n\n\/\/ Determine whether or not we should wait for tasks in hybrid parallelism.\nbool should_task_wait(int mults_per_step, int total_rec_steps, int steps_left,\n int start_index, int position, int num_threads) {\n assert(0 < position && position <= mults_per_step);\n\n#if defined(_PARALLEL_) && (_PARALLEL_ == _BFS_PAR_)\n return position == mults_per_step;\n#endif\n\n int total_multiplies = pow(mults_per_step, total_rec_steps);\n int extra_multiplies = total_multiplies % num_threads;\n\n \/\/ HYBRID does all DFS, so no need to wait.\n if (num_threads > total_multiplies) {\n\treturn false;\n }\n\n if (position == mults_per_step) {\n \/\/ The last position always waits.\n return true;\n }\n\n int end_index = total_multiplies - extra_multiplies;\n \/\/ There is exactly one wait at the bottom level of the recursion tree.\n if (steps_left == 1 && start_index + position == end_index) {\n \/\/std::cout << \"End stop: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return true;\n }\n\n \/\/ There can be at most one wait at the second to last level of the recursion tree.\n int smallest_index = earliest_leaf_start(mults_per_step, steps_left, start_index, position);\n if (smallest_index >= end_index) {\n \/\/std::cout << \"Early stop: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return true;\n }\n\n return false;\n}\n\n\/\/ Determine whether or not we should launch a task for hybrid parallelism.\nbool should_launch_task(int mults_per_step, int total_rec_steps, int steps_left,\n int start_index, int position, int num_threads) {\n assert(0 < position && position <= mults_per_step);\n\n#if defined(_PARALLEL_) && (_PARALLEL_ == _BFS_PAR_)\n return true;\n#endif\n\n int total_multiplies = pow(mults_per_step, total_rec_steps);\n int extra_multiplies = total_multiplies % num_threads;\n\n \/\/ If the number of threads is greater than the total number of multiplies,\n \/\/ then we just run parallel MKL.\n if (num_threads > total_multiplies) {\n return false;\n }\n\n int end_index = total_multiplies - extra_multiplies;\n if (steps_left == 1 && start_index + position > end_index) {\n \/\/std::cout << \"Not launching: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return false;\n }\n \n int smallest_index = earliest_leaf_start(mults_per_step, steps_left, start_index, position);\n if (smallest_index >= end_index) {\n \/\/std::cout << \"Not launching: \" << steps_left << \" \" << start_index << \" \" << position << std::endl;\n return false;\n }\n\n return true;\n}\n\nclass Lock {\npublic:\n Lock() { omp_init_lock(&lock_); }\n ~Lock() { omp_destroy_lock(&lock_); }\n\n void Acquire() { omp_set_lock(&lock_); }\n bool Test() { return omp_test_lock(&lock_); }\n void Release() { omp_unset_lock(&lock_); }\n\nprivate:\n omp_lock_t lock_;\n};\n\n\nclass LockAndCounter {\npublic:\n LockAndCounter(int count) : count_(count) { lock_.Acquire(); }\n\n void Decrement() {\n #pragma omp critical\n\t{\n\t if (count_ > 0) {\n\t\t--count_;\n\t\tif (count_ == 0) {\n\t\t lock_.Release();\n\t\t}\n\t }\n\t}\n }\n\n \/\/ Non-blocking acquire that yields to other tasks.\n void Acquire() {\n\twhile (!lock_.Test()) {\n #pragma omp taskyield\n\t}\n }\n void Release() { lock_.Release(); }\n\nprivate:\n int count_;\n Lock lock_;\n};\n\n# if defined(_PARALLEL_) && (_PARALLEL_ == _HYBRID_PAR_)\n\/\/ Switch to DFS style sub-problems in the hybrid parallelism\nvoid SwitchToDFS(LockAndCounter& locker, int num_threads) {\n locker.Acquire();\n mkl_set_num_threads_local(num_threads);\n locker.Release();\n}\n#endif\n\n#endif \/\/ _PAR_UTIL_\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** Copyright (C) 2013 Openismus GmbH.\n** Authors: Peter Penz (ppenz@openismus.com)\n** Patricia Santana Cruz (patriciasantanacruz@gmail.com)\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"makefileparser.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QFile>\n#include <QDir>\n#include <QFileInfoList>\n#include <QMutexLocker>\n\nusing namespace AutotoolsProjectManager::Internal;\n\nMakefileParser::MakefileParser(const QString &makefile) :\n QObject(),\n m_success(false),\n m_cancel(false),\n m_mutex(),\n m_makefile(makefile),\n m_executable(),\n m_sources(),\n m_makefiles(),\n m_includePaths(),\n m_line(),\n m_textStream()\n{\n}\n\nMakefileParser::~MakefileParser()\n{\n delete m_textStream.device();\n}\n\nbool MakefileParser::parse()\n{\n m_mutex.lock();\n m_cancel = false;\n m_mutex.unlock(),\n\n m_success = true;\n m_executable.clear();\n m_sources.clear();\n m_makefiles.clear();\n\n QFile *file = new QFile(m_makefile);\n if (!file->open(QIODevice::ReadOnly | QIODevice::Text)) {\n qWarning(\"%s: %s\", qPrintable(m_makefile), qPrintable(file->errorString()));\n delete file;\n return false;\n }\n\n QFileInfo info(m_makefile);\n m_makefiles.append(info.fileName());\n\n emit status(tr(\"Parsing %1 in directory %2\").arg(info.fileName()).arg(info.absolutePath()));\n\n m_textStream.setDevice(file);\n\n do {\n m_line = m_textStream.readLine();\n switch (topTarget()) {\n case AmDefaultSourceExt: parseDefaultSourceExtensions(); break;\n case BinPrograms: parseBinPrograms(); break;\n case BuiltSources: break; \/\/ TODO: Add to m_sources?\n case Sources: parseSources(); break;\n case SubDirs: parseSubDirs(); break;\n case Undefined:\n default: break;\n }\n } while (!m_line.isNull());\n\n parseIncludePaths();\n\n return m_success;\n}\n\nQStringList MakefileParser::sources() const\n{\n return m_sources;\n}\n\nQStringList MakefileParser::makefiles() const\n{\n return m_makefiles;\n}\n\nQString MakefileParser::executable() const\n{\n return m_executable;\n}\n\nQStringList MakefileParser::includePaths() const\n{\n return m_includePaths;\n}\n\nvoid MakefileParser::cancel()\n{\n QMutexLocker locker(&m_mutex);\n m_cancel = true;\n}\n\nbool MakefileParser::isCanceled() const\n{\n QMutexLocker locker(&m_mutex);\n return m_cancel;\n}\n\nMakefileParser::TopTarget MakefileParser::topTarget() const\n{\n const QString line = m_line.simplified();\n\n if (line.isEmpty() || line.startsWith(QLatin1Char('#')))\n return Undefined;\n\n const QString id = parseIdentifierBeforeAssign(line);\n if (id.isEmpty())\n return Undefined;\n\n if (id == QLatin1String(\"AM_DEFAULT_SOURCE_EXT\"))\n return AmDefaultSourceExt;\n if (id == QLatin1String(\"bin_PROGRAMS\"))\n return BinPrograms;\n if (id == QLatin1String(\"BUILT_SOURCES\"))\n return BuiltSources;\n if (id == QLatin1String(\"SUBDIRS\") || id == QLatin1String(\"DIST_SUBDIRS\"))\n return SubDirs;\n if (id.endsWith(QLatin1String(\"_SOURCES\")))\n return Sources;\n\n return Undefined;\n}\n\nvoid MakefileParser::parseBinPrograms()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"bin_PROGRAMS\")), return);\n const QStringList binPrograms = targetValues();\n\n \/\/ TODO: are multiple values possible?\n if (binPrograms.size() == 1) {\n QFileInfo info(binPrograms.first());\n m_executable = info.fileName();\n }\n}\n\nvoid MakefileParser::parseSources()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"_SOURCES\")), return);\n\n bool hasVariables = false;\n m_sources.append(targetValues(&hasVariables));\n\n \/\/ Skip parsing of Makefile.am for getting the sub directories,\n \/\/ as variables have been used. As fallback all sources will be added.\n if (hasVariables)\n addAllSources();\n\n \/\/ Duplicates might be possible in combination with 'AM_DEFAULT_SOURCE_EXT ='\n m_sources.removeDuplicates();\n\n \/\/ TODO: Definitions like \"SOURCES = ..\/src.cpp\" are ignored currently.\n \/\/ This case must be handled correctly in MakefileParser::parseSubDirs(),\n \/\/ where the current sub directory must be shortened.\n QStringList::iterator it = m_sources.begin();\n while (it != m_sources.end()) {\n if ((*it).startsWith(QLatin1String(\"..\")))\n it = m_sources.erase(it);\n else\n ++it;\n }\n}\n\nvoid MakefileParser::parseDefaultSourceExtensions()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"AM_DEFAULT_SOURCE_EXT\")), return);\n const QStringList extensions = targetValues();\n if (extensions.isEmpty()) {\n m_success = false;\n return;\n }\n\n QFileInfo info(m_makefile);\n const QString dirName = info.absolutePath();\n m_sources.append(directorySources(dirName, extensions));\n\n \/\/ Duplicates might be possible in combination with '_SOURCES ='\n m_sources.removeDuplicates();\n}\n\nvoid MakefileParser::parseSubDirs()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"SUBDIRS\")), return);\n if (isCanceled()) {\n m_success = false;\n return;\n }\n\n QFileInfo info(m_makefile);\n const QString path = info.absolutePath();\n const QString makefileName = info.fileName();\n\n bool hasVariables = false;\n QStringList subDirs = targetValues(&hasVariables);\n if (hasVariables) {\n \/\/ Skip parsing of Makefile.am for getting the sub directories,\n \/\/ as variables have been used. As fallback all sources will be added.\n addAllSources();\n return;\n }\n\n \/\/ If the SUBDIRS values contain a '.' or a variable like $(test),\n \/\/ all the sub directories of the current folder must get parsed.\n bool hasDotSubDir = false;\n QStringList::iterator it = subDirs.begin();\n while (it != subDirs.end()) {\n \/\/ Erase all entries that represent a '.'\n if ((*it) == QLatin1String(\".\")) {\n hasDotSubDir = true;\n it = subDirs.erase(it);\n } else {\n ++it;\n }\n }\n if (hasDotSubDir) {\n \/\/ Add all sub directories of the current folder\n QDir dir(path);\n dir.setFilter(QDir::Dirs | QDir::NoDotAndDotDot);\n foreach (const QFileInfo& info, dir.entryInfoList()) {\n subDirs.append(info.fileName());\n }\n }\n subDirs.removeDuplicates();\n\n \/\/ Delegate the parsing of all sub directories to a local\n \/\/ makefile parser and merge the results\n foreach (const QString& subDir, subDirs) {\n const QChar slash = QLatin1Char('\/');\n const QString subDirMakefile = path + slash + subDir\n + slash + makefileName;\n\n \/\/ Parse sub directory\n QFile file(subDirMakefile);\n\n \/\/ Don't try to parse a file, that might not exist (e. g.\n \/\/ if SUBDIRS specifies a 'po' directory).\n if (!file.exists())\n continue;\n\n MakefileParser parser(subDirMakefile);\n connect(&parser, SIGNAL(status(QString)), this, SIGNAL(status(QString)));\n const bool success = parser.parse();\n\n \/\/ Don't return, try to parse as many sub directories\n \/\/ as possible\n if (!success)\n m_success = false;\n\n m_makefiles.append(subDir + slash + makefileName);\n\n \/\/ Append the sources of the sub directory to the\n \/\/ current sources\n foreach (const QString& source, parser.sources())\n m_sources.append(subDir + slash + source);\n\n \/\/ Duplicates might be possible in combination with several\n \/\/ \"..._SUBDIRS\" targets\n m_makefiles.removeDuplicates();\n m_sources.removeDuplicates();\n }\n\n if (subDirs.isEmpty())\n m_success = false;\n}\n\nQStringList MakefileParser::directorySources(const QString &directory,\n const QStringList &extensions)\n{\n if (isCanceled()) {\n m_success = false;\n return QStringList();\n }\n\n emit status(tr(\"Parsing directory %1\").arg(directory));\n\n QStringList list; \/\/ return value\n\n QDir dir(directory);\n dir.setFilter(QDir::Files | QDir::Dirs | QDir::NoDotAndDotDot);\n\n const QFileInfoList infos = dir.entryInfoList();\n foreach (const QFileInfo& info, infos) {\n if (info.isDir()) {\n \/\/ Append recursively sources from the sub directory\n const QStringList subDirSources = directorySources(info.absoluteFilePath(),\n extensions);\n const QString dirPath = info.fileName();\n foreach (const QString& subDirSource, subDirSources)\n list.append(dirPath + QLatin1Char('\/') + subDirSource);\n } else {\n \/\/ Check whether the file matches to an extension\n foreach (const QString& extension, extensions) {\n if (info.fileName().endsWith(extension)) {\n list.append(info.fileName());\n appendHeader(list, dir, info.baseName());\n break;\n }\n }\n }\n }\n\n return list;\n}\n\nQStringList MakefileParser::targetValues(bool *hasVariables)\n{\n QStringList values;\n if (hasVariables != 0)\n *hasVariables = false;\n\n const int index = m_line.indexOf(QLatin1Char('='));\n if (index < 0) {\n m_success = false;\n return QStringList();\n }\n\n m_line.remove(0, index + 1); \/\/ remove the 'target = ' prefix\n\n bool endReached = false;\n do {\n m_line = m_line.simplified();\n\n \/\/ Get all values of a line separated by spaces.\n \/\/ Values representing a variable like $(value) get\n \/\/ removed currently.\n QStringList lineValues = m_line.split(QLatin1Char(' '), QString::SkipEmptyParts);\n QStringList::iterator it = lineValues.begin();\n while (it != lineValues.end()) {\n if ((*it).startsWith(QLatin1String(\"$(\"))) {\n it = lineValues.erase(it);\n if (hasVariables != 0)\n *hasVariables = true;\n } else {\n ++it;\n }\n }\n\n endReached = lineValues.isEmpty();\n if (!endReached) {\n const QChar backSlash = QLatin1Char('\\\\');\n QString last = lineValues.last();\n if (last.endsWith(backSlash)) {\n \/\/ The last value contains a backslash. Remove the\n \/\/ backslash and replace the last value.\n lineValues.pop_back();\n last.remove(backSlash);\n if (!last.isEmpty())\n lineValues.push_back(last);\n\n values.append(lineValues);\n m_line = m_textStream.readLine();\n endReached = m_line.isNull();\n } else {\n values.append(lineValues);\n endReached = true;\n }\n }\n } while (!endReached);\n\n return values;\n}\n\nvoid MakefileParser::appendHeader(QStringList &list, const QDir &dir, const QString &fileName)\n{\n const char *const headerExtensions[] = { \".h\", \".hh\", \".hg\", \".hxx\", \".hpp\", 0 };\n int i = 0;\n while (headerExtensions[i] != 0) {\n const QString headerFile = fileName + QLatin1String(headerExtensions[i]);\n QFileInfo fileInfo(dir, headerFile);\n if (fileInfo.exists())\n list.append(headerFile);\n ++i;\n }\n}\n\nQString MakefileParser::parseIdentifierBeforeAssign(const QString &line)\n{\n int end = 0;\n for (; end < line.size(); ++end)\n if (!line[end].isLetterOrNumber() && line[end] != QLatin1Char('_'))\n break;\n\n QString ret = line.left(end);\n while (end < line.size() && line[end].isSpace())\n ++end;\n return (line[end] == QLatin1Char('=')) ? ret : QString();\n}\n\nvoid MakefileParser::addAllSources()\n{\n QStringList extensions;\n extensions << QLatin1String(\".c\")\n << QLatin1String(\".cpp\")\n << QLatin1String(\".cc\")\n << QLatin1String(\".cxx\")\n << QLatin1String(\".ccg\");\n QFileInfo info(m_makefile);\n m_sources.append(directorySources(info.absolutePath(), extensions));\n m_sources.removeDuplicates();\n}\n\nvoid MakefileParser::parseIncludePaths()\n{\n QFileInfo info(m_makefile);\n const QString dirName = info.absolutePath();\n\n QFile file(dirName + QLatin1String(\"\/Makefile\"));\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text))\n return;\n\n \/\/ TODO: The parsing is done very poor. Comments are ignored and targets\n \/\/ are ignored too. Whether it is worth to improve this, depends on whether\n \/\/ we want to parse the generated Makefile at all or whether we want to\n \/\/ improve the Makefile.am parsing to be aware of variables.\n QTextStream textStream(&file);\n QString line;\n do {\n line = textStream.readLine();\n QStringList terms = line.split(QLatin1Char(' '), QString::SkipEmptyParts);\n foreach (const QString &term, terms) {\n if (term.startsWith(QLatin1String(\"-I\"))) {\n QString includePath = term.right(term.length() - 2); \/\/ remove the \"-I\"\n if (includePath == QLatin1String(\".\"))\n includePath = dirName;\n if (!includePath.isEmpty())\n m_includePaths += includePath;\n }\n }\n } while (!line.isNull());\n\n m_includePaths.removeDuplicates();\n}\n<commit_msg>Autotools: fixed crash in Debug build<commit_after>\/**************************************************************************\n**\n** Copyright (C) 2013 Openismus GmbH.\n** Authors: Peter Penz (ppenz@openismus.com)\n** Patricia Santana Cruz (patriciasantanacruz@gmail.com)\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"makefileparser.h\"\n\n#include <utils\/qtcassert.h>\n\n#include <QFile>\n#include <QDir>\n#include <QFileInfoList>\n#include <QMutexLocker>\n\nusing namespace AutotoolsProjectManager::Internal;\n\nMakefileParser::MakefileParser(const QString &makefile) :\n QObject(),\n m_success(false),\n m_cancel(false),\n m_mutex(),\n m_makefile(makefile),\n m_executable(),\n m_sources(),\n m_makefiles(),\n m_includePaths(),\n m_line(),\n m_textStream()\n{\n}\n\nMakefileParser::~MakefileParser()\n{\n delete m_textStream.device();\n}\n\nbool MakefileParser::parse()\n{\n m_mutex.lock();\n m_cancel = false;\n m_mutex.unlock(),\n\n m_success = true;\n m_executable.clear();\n m_sources.clear();\n m_makefiles.clear();\n\n QFile *file = new QFile(m_makefile);\n if (!file->open(QIODevice::ReadOnly | QIODevice::Text)) {\n qWarning(\"%s: %s\", qPrintable(m_makefile), qPrintable(file->errorString()));\n delete file;\n return false;\n }\n\n QFileInfo info(m_makefile);\n m_makefiles.append(info.fileName());\n\n emit status(tr(\"Parsing %1 in directory %2\").arg(info.fileName()).arg(info.absolutePath()));\n\n m_textStream.setDevice(file);\n\n do {\n m_line = m_textStream.readLine();\n switch (topTarget()) {\n case AmDefaultSourceExt: parseDefaultSourceExtensions(); break;\n case BinPrograms: parseBinPrograms(); break;\n case BuiltSources: break; \/\/ TODO: Add to m_sources?\n case Sources: parseSources(); break;\n case SubDirs: parseSubDirs(); break;\n case Undefined:\n default: break;\n }\n } while (!m_line.isNull());\n\n parseIncludePaths();\n\n return m_success;\n}\n\nQStringList MakefileParser::sources() const\n{\n return m_sources;\n}\n\nQStringList MakefileParser::makefiles() const\n{\n return m_makefiles;\n}\n\nQString MakefileParser::executable() const\n{\n return m_executable;\n}\n\nQStringList MakefileParser::includePaths() const\n{\n return m_includePaths;\n}\n\nvoid MakefileParser::cancel()\n{\n QMutexLocker locker(&m_mutex);\n m_cancel = true;\n}\n\nbool MakefileParser::isCanceled() const\n{\n QMutexLocker locker(&m_mutex);\n return m_cancel;\n}\n\nMakefileParser::TopTarget MakefileParser::topTarget() const\n{\n const QString line = m_line.simplified();\n\n if (line.isEmpty() || line.startsWith(QLatin1Char('#')))\n return Undefined;\n\n const QString id = parseIdentifierBeforeAssign(line);\n if (id.isEmpty())\n return Undefined;\n\n if (id == QLatin1String(\"AM_DEFAULT_SOURCE_EXT\"))\n return AmDefaultSourceExt;\n if (id == QLatin1String(\"bin_PROGRAMS\"))\n return BinPrograms;\n if (id == QLatin1String(\"BUILT_SOURCES\"))\n return BuiltSources;\n if (id == QLatin1String(\"SUBDIRS\") || id == QLatin1String(\"DIST_SUBDIRS\"))\n return SubDirs;\n if (id.endsWith(QLatin1String(\"_SOURCES\")))\n return Sources;\n\n return Undefined;\n}\n\nvoid MakefileParser::parseBinPrograms()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"bin_PROGRAMS\")), return);\n const QStringList binPrograms = targetValues();\n\n \/\/ TODO: are multiple values possible?\n if (binPrograms.size() == 1) {\n QFileInfo info(binPrograms.first());\n m_executable = info.fileName();\n }\n}\n\nvoid MakefileParser::parseSources()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"_SOURCES\")), return);\n\n bool hasVariables = false;\n m_sources.append(targetValues(&hasVariables));\n\n \/\/ Skip parsing of Makefile.am for getting the sub directories,\n \/\/ as variables have been used. As fallback all sources will be added.\n if (hasVariables)\n addAllSources();\n\n \/\/ Duplicates might be possible in combination with 'AM_DEFAULT_SOURCE_EXT ='\n m_sources.removeDuplicates();\n\n \/\/ TODO: Definitions like \"SOURCES = ..\/src.cpp\" are ignored currently.\n \/\/ This case must be handled correctly in MakefileParser::parseSubDirs(),\n \/\/ where the current sub directory must be shortened.\n QStringList::iterator it = m_sources.begin();\n while (it != m_sources.end()) {\n if ((*it).startsWith(QLatin1String(\"..\")))\n it = m_sources.erase(it);\n else\n ++it;\n }\n}\n\nvoid MakefileParser::parseDefaultSourceExtensions()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"AM_DEFAULT_SOURCE_EXT\")), return);\n const QStringList extensions = targetValues();\n if (extensions.isEmpty()) {\n m_success = false;\n return;\n }\n\n QFileInfo info(m_makefile);\n const QString dirName = info.absolutePath();\n m_sources.append(directorySources(dirName, extensions));\n\n \/\/ Duplicates might be possible in combination with '_SOURCES ='\n m_sources.removeDuplicates();\n}\n\nvoid MakefileParser::parseSubDirs()\n{\n QTC_ASSERT(m_line.contains(QLatin1String(\"SUBDIRS\")), return);\n if (isCanceled()) {\n m_success = false;\n return;\n }\n\n QFileInfo info(m_makefile);\n const QString path = info.absolutePath();\n const QString makefileName = info.fileName();\n\n bool hasVariables = false;\n QStringList subDirs = targetValues(&hasVariables);\n if (hasVariables) {\n \/\/ Skip parsing of Makefile.am for getting the sub directories,\n \/\/ as variables have been used. As fallback all sources will be added.\n addAllSources();\n return;\n }\n\n \/\/ If the SUBDIRS values contain a '.' or a variable like $(test),\n \/\/ all the sub directories of the current folder must get parsed.\n bool hasDotSubDir = false;\n QStringList::iterator it = subDirs.begin();\n while (it != subDirs.end()) {\n \/\/ Erase all entries that represent a '.'\n if ((*it) == QLatin1String(\".\")) {\n hasDotSubDir = true;\n it = subDirs.erase(it);\n } else {\n ++it;\n }\n }\n if (hasDotSubDir) {\n \/\/ Add all sub directories of the current folder\n QDir dir(path);\n dir.setFilter(QDir::Dirs | QDir::NoDotAndDotDot);\n foreach (const QFileInfo& info, dir.entryInfoList()) {\n subDirs.append(info.fileName());\n }\n }\n subDirs.removeDuplicates();\n\n \/\/ Delegate the parsing of all sub directories to a local\n \/\/ makefile parser and merge the results\n foreach (const QString& subDir, subDirs) {\n const QChar slash = QLatin1Char('\/');\n const QString subDirMakefile = path + slash + subDir\n + slash + makefileName;\n\n \/\/ Parse sub directory\n QFile file(subDirMakefile);\n\n \/\/ Don't try to parse a file, that might not exist (e. g.\n \/\/ if SUBDIRS specifies a 'po' directory).\n if (!file.exists())\n continue;\n\n MakefileParser parser(subDirMakefile);\n connect(&parser, SIGNAL(status(QString)), this, SIGNAL(status(QString)));\n const bool success = parser.parse();\n\n \/\/ Don't return, try to parse as many sub directories\n \/\/ as possible\n if (!success)\n m_success = false;\n\n m_makefiles.append(subDir + slash + makefileName);\n\n \/\/ Append the sources of the sub directory to the\n \/\/ current sources\n foreach (const QString& source, parser.sources())\n m_sources.append(subDir + slash + source);\n\n \/\/ Duplicates might be possible in combination with several\n \/\/ \"..._SUBDIRS\" targets\n m_makefiles.removeDuplicates();\n m_sources.removeDuplicates();\n }\n\n if (subDirs.isEmpty())\n m_success = false;\n}\n\nQStringList MakefileParser::directorySources(const QString &directory,\n const QStringList &extensions)\n{\n if (isCanceled()) {\n m_success = false;\n return QStringList();\n }\n\n emit status(tr(\"Parsing directory %1\").arg(directory));\n\n QStringList list; \/\/ return value\n\n QDir dir(directory);\n dir.setFilter(QDir::Files | QDir::Dirs | QDir::NoDotAndDotDot);\n\n const QFileInfoList infos = dir.entryInfoList();\n foreach (const QFileInfo& info, infos) {\n if (info.isDir()) {\n \/\/ Append recursively sources from the sub directory\n const QStringList subDirSources = directorySources(info.absoluteFilePath(),\n extensions);\n const QString dirPath = info.fileName();\n foreach (const QString& subDirSource, subDirSources)\n list.append(dirPath + QLatin1Char('\/') + subDirSource);\n } else {\n \/\/ Check whether the file matches to an extension\n foreach (const QString& extension, extensions) {\n if (info.fileName().endsWith(extension)) {\n list.append(info.fileName());\n appendHeader(list, dir, info.baseName());\n break;\n }\n }\n }\n }\n\n return list;\n}\n\nQStringList MakefileParser::targetValues(bool *hasVariables)\n{\n QStringList values;\n if (hasVariables != 0)\n *hasVariables = false;\n\n const int index = m_line.indexOf(QLatin1Char('='));\n if (index < 0) {\n m_success = false;\n return QStringList();\n }\n\n m_line.remove(0, index + 1); \/\/ remove the 'target = ' prefix\n\n bool endReached = false;\n do {\n m_line = m_line.simplified();\n\n \/\/ Get all values of a line separated by spaces.\n \/\/ Values representing a variable like $(value) get\n \/\/ removed currently.\n QStringList lineValues = m_line.split(QLatin1Char(' '), QString::SkipEmptyParts);\n QStringList::iterator it = lineValues.begin();\n while (it != lineValues.end()) {\n if ((*it).startsWith(QLatin1String(\"$(\"))) {\n it = lineValues.erase(it);\n if (hasVariables != 0)\n *hasVariables = true;\n } else {\n ++it;\n }\n }\n\n endReached = lineValues.isEmpty();\n if (!endReached) {\n const QChar backSlash = QLatin1Char('\\\\');\n QString last = lineValues.last();\n if (last.endsWith(backSlash)) {\n \/\/ The last value contains a backslash. Remove the\n \/\/ backslash and replace the last value.\n lineValues.pop_back();\n last.remove(backSlash);\n if (!last.isEmpty())\n lineValues.push_back(last);\n\n values.append(lineValues);\n m_line = m_textStream.readLine();\n endReached = m_line.isNull();\n } else {\n values.append(lineValues);\n endReached = true;\n }\n }\n } while (!endReached);\n\n return values;\n}\n\nvoid MakefileParser::appendHeader(QStringList &list, const QDir &dir, const QString &fileName)\n{\n const char *const headerExtensions[] = { \".h\", \".hh\", \".hg\", \".hxx\", \".hpp\", 0 };\n int i = 0;\n while (headerExtensions[i] != 0) {\n const QString headerFile = fileName + QLatin1String(headerExtensions[i]);\n QFileInfo fileInfo(dir, headerFile);\n if (fileInfo.exists())\n list.append(headerFile);\n ++i;\n }\n}\n\nQString MakefileParser::parseIdentifierBeforeAssign(const QString &line)\n{\n int end = 0;\n for (; end < line.size(); ++end)\n if (!line[end].isLetterOrNumber() && line[end] != QLatin1Char('_'))\n break;\n\n QString ret = line.left(end);\n while (end < line.size() && line[end].isSpace())\n ++end;\n return (end < line.size() && line[end] == QLatin1Char('=')) ? ret : QString();\n}\n\nvoid MakefileParser::addAllSources()\n{\n QStringList extensions;\n extensions << QLatin1String(\".c\")\n << QLatin1String(\".cpp\")\n << QLatin1String(\".cc\")\n << QLatin1String(\".cxx\")\n << QLatin1String(\".ccg\");\n QFileInfo info(m_makefile);\n m_sources.append(directorySources(info.absolutePath(), extensions));\n m_sources.removeDuplicates();\n}\n\nvoid MakefileParser::parseIncludePaths()\n{\n QFileInfo info(m_makefile);\n const QString dirName = info.absolutePath();\n\n QFile file(dirName + QLatin1String(\"\/Makefile\"));\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text))\n return;\n\n \/\/ TODO: The parsing is done very poor. Comments are ignored and targets\n \/\/ are ignored too. Whether it is worth to improve this, depends on whether\n \/\/ we want to parse the generated Makefile at all or whether we want to\n \/\/ improve the Makefile.am parsing to be aware of variables.\n QTextStream textStream(&file);\n QString line;\n do {\n line = textStream.readLine();\n QStringList terms = line.split(QLatin1Char(' '), QString::SkipEmptyParts);\n foreach (const QString &term, terms) {\n if (term.startsWith(QLatin1String(\"-I\"))) {\n QString includePath = term.right(term.length() - 2); \/\/ remove the \"-I\"\n if (includePath == QLatin1String(\".\"))\n includePath = dirName;\n if (!includePath.isEmpty())\n m_includePaths += includePath;\n }\n }\n } while (!line.isNull());\n\n m_includePaths.removeDuplicates();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n\nLicensed to the OpenCOR team under one or more contributor license agreements.\nSee the NOTICE.txt file distributed with this work for additional information\nregarding copyright ownership. The OpenCOR team licenses this file to you under\nthe Apache License, Version 2.0 (the \"License\"); you may not use this file\nexcept in compliance with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software distributed\nunder the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\nCONDITIONS OF ANY KIND, either express or implied. See the License for the\nspecific language governing permissions and limitations under the License.\n\n*******************************************************************************\/\n\n\/\/==============================================================================\n\/\/ SampleView plugin\n\/\/==============================================================================\n\n#include \"sampleviewplugin.h\"\n#include \"sampleviewwidget.h\"\n\n\/\/==============================================================================\n\n#include <QMainWindow>\n\n\/\/==============================================================================\n\n#include <QIcon>\n\n\/\/==============================================================================\n\nnamespace OpenCOR {\nnamespace SampleView {\n\n\/\/==============================================================================\n\nPLUGININFO_FUNC SampleViewPluginInfo()\n{\n Descriptions descriptions;\n\n descriptions.insert(\"en\", QString::fromUtf8(\"a plugin that provides a test view.\"));\n descriptions.insert(\"fr\", QString::fromUtf8(\"une extension qui fournit une vue de test.\"));\n\n return new PluginInfo(PluginInfo::Sample, true, false,\n QStringList() << \"Core\" << \"Sample\",\n descriptions);\n}\n\n\/\/==============================================================================\n\nSampleViewPlugin::SampleViewPlugin() :\n mFileName(QString())\n{\n}\n\n\/\/==============================================================================\n\/\/ File handling interface\n\/\/==============================================================================\n\nbool SampleViewPlugin::saveFile(const QString &pOldFileName,\n const QString &pNewFileName)\n{\n Q_UNUSED(pOldFileName);\n Q_UNUSED(pNewFileName);\n\n \/\/ We don't handle this interface...\n\n return false;\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileOpened(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::filePermissionsChanged(const QString &pFileName)\n{\n \/\/ The given file has had its permissions changed, so re-initialise our\n \/\/ view widget, if needed\n\n if (!pFileName.compare(mFileName))\n mViewWidget->initialize(pFileName);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileModified(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileReloaded(const QString &pFileName)\n{\n \/\/ The given file has been reloaded, so re-initialise our view widget, if\n \/\/ needed\n\n if (!pFileName.compare(mFileName))\n mViewWidget->initialize(pFileName);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileRenamed(const QString &pOldFileName,\n const QString &pNewFileName)\n{\n Q_UNUSED(pOldFileName);\n\n \/\/ The given file has been renamed, so re-initialise our view widget\n\n if (!pOldFileName.compare(mFileName)) {\n mFileName = pNewFileName;\n\n mViewWidget->initialize(pNewFileName);\n }\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileClosed(const QString &pFileName)\n{\n \/\/ The given file has been closed, so update our internals, if needed\n\n if (!pFileName.compare(mFileName))\n mFileName = QString();\n}\n\n\/\/==============================================================================\n\/\/ I18n interface\n\/\/==============================================================================\n\nvoid SampleViewPlugin::retranslateUi()\n{\n \/\/ Retranslate our view widget\n\n mViewWidget->retranslateUi();\n}\n\n\/\/==============================================================================\n\/\/ Plugin interface\n\/\/==============================================================================\n\nvoid SampleViewPlugin::initializePlugin(QMainWindow *pMainWindow)\n{\n \/\/ Create our sample view widget\n\n mViewWidget = new SampleViewWidget(pMainWindow);\n\n \/\/ Hide our sample view widget since it may not initially be shown in our\n \/\/ central widget\n\n mViewWidget->setVisible(false);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::finalizePlugin()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::pluginInitialized(const Plugins &pLoadedPlugins)\n{\n Q_UNUSED(pLoadedPlugins);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::loadSettings(QSettings *pSettings)\n{\n Q_UNUSED(pSettings);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::saveSettings(QSettings *pSettings) const\n{\n Q_UNUSED(pSettings);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::handleAction(const QUrl &pUrl)\n{\n Q_UNUSED(pUrl);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\/\/ View interface\n\/\/==============================================================================\n\nViewInterface::Mode SampleViewPlugin::viewMode() const\n{\n \/\/ Return our mode\n\n return ViewInterface::Sample;\n}\n\n\/\/==============================================================================\n\nQStringList SampleViewPlugin::viewMimeTypes() const\n{\n \/\/ Return the MIME types we support\n \/\/ Note: we allow any kind of file, hence our empty string list...\n\n return QStringList();\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::initializeView()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::finalizeView()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nQWidget * SampleViewPlugin::viewWidget(const QString &pFileName,\n const bool &pCreate)\n{\n \/\/ Update our sample view widget using the given file\n\n if (pCreate) {\n mFileName = pFileName;\n\n mViewWidget->initialize(pFileName);\n\n return mViewWidget;\n } else {\n mFileName = QString();\n\n return 0;\n }\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::removeViewWidget(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nQString SampleViewPlugin::viewName() const\n{\n \/\/ Return our sample view's name\n\n return tr(\"Sample\");\n}\n\n\/\/==============================================================================\n\nQIcon SampleViewPlugin::fileTabIcon(const QString &pFileName) const\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n\n return QIcon();\n}\n\n\/\/==============================================================================\n\n} \/\/ namespace SampleView\n} \/\/ namespace OpenCOR\n\n\/\/==============================================================================\n\/\/ End of file\n\/\/==============================================================================\n<commit_msg>Some work towards writing some sample plugins (#337) [ci skip].<commit_after>\/*******************************************************************************\n\nLicensed to the OpenCOR team under one or more contributor license agreements.\nSee the NOTICE.txt file distributed with this work for additional information\nregarding copyright ownership. The OpenCOR team licenses this file to you under\nthe Apache License, Version 2.0 (the \"License\"); you may not use this file\nexcept in compliance with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software distributed\nunder the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\nCONDITIONS OF ANY KIND, either express or implied. See the License for the\nspecific language governing permissions and limitations under the License.\n\n*******************************************************************************\/\n\n\/\/==============================================================================\n\/\/ SampleView plugin\n\/\/==============================================================================\n\n#include \"sampleviewplugin.h\"\n#include \"sampleviewwidget.h\"\n\n\/\/==============================================================================\n\n#include <QMainWindow>\n\n\/\/==============================================================================\n\n#include <QIcon>\n\n\/\/==============================================================================\n\nnamespace OpenCOR {\nnamespace SampleView {\n\n\/\/==============================================================================\n\nPLUGININFO_FUNC SampleViewPluginInfo()\n{\n Descriptions descriptions;\n\n descriptions.insert(\"en\", QString::fromUtf8(\"a plugin that provides a test view.\"));\n descriptions.insert(\"fr\", QString::fromUtf8(\"une extension qui fournit une vue de test.\"));\n\n return new PluginInfo(PluginInfo::Sample, true, false,\n QStringList() << \"Core\" << \"Sample\",\n descriptions);\n}\n\n\/\/==============================================================================\n\nSampleViewPlugin::SampleViewPlugin() :\n mFileName(QString())\n{\n}\n\n\/\/==============================================================================\n\/\/ File handling interface\n\/\/==============================================================================\n\nbool SampleViewPlugin::saveFile(const QString &pOldFileName,\n const QString &pNewFileName)\n{\n Q_UNUSED(pOldFileName);\n Q_UNUSED(pNewFileName);\n\n \/\/ We don't handle this interface...\n\n return false;\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileOpened(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::filePermissionsChanged(const QString &pFileName)\n{\n \/\/ The given file has had its permissions changed, so re-initialise our\n \/\/ view widget, if needed\n\n if (!pFileName.compare(mFileName))\n mViewWidget->initialize(pFileName);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileModified(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileReloaded(const QString &pFileName)\n{\n \/\/ The given file has been reloaded, so re-initialise our view widget, if\n \/\/ needed\n\n if (!pFileName.compare(mFileName))\n mViewWidget->initialize(pFileName);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileRenamed(const QString &pOldFileName,\n const QString &pNewFileName)\n{\n Q_UNUSED(pOldFileName);\n\n \/\/ The given file has been renamed, so re-initialise our view widget\n\n if (!pOldFileName.compare(mFileName)) {\n mFileName = pNewFileName;\n\n mViewWidget->initialize(pNewFileName);\n }\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::fileClosed(const QString &pFileName)\n{\n \/\/ The given file has been closed, so update our internals, if needed\n\n if (!pFileName.compare(mFileName))\n mFileName = QString();\n}\n\n\/\/==============================================================================\n\/\/ I18n interface\n\/\/==============================================================================\n\nvoid SampleViewPlugin::retranslateUi()\n{\n \/\/ Retranslate our view widget, if needed\n\n if (!mFileName.isEmpty())\n mViewWidget->retranslateUi();\n}\n\n\/\/==============================================================================\n\/\/ Plugin interface\n\/\/==============================================================================\n\nvoid SampleViewPlugin::initializePlugin(QMainWindow *pMainWindow)\n{\n \/\/ Create our sample view widget\n\n mViewWidget = new SampleViewWidget(pMainWindow);\n\n \/\/ Hide our sample view widget since it may not initially be shown in our\n \/\/ central widget\n\n mViewWidget->setVisible(false);\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::finalizePlugin()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::pluginInitialized(const Plugins &pLoadedPlugins)\n{\n Q_UNUSED(pLoadedPlugins);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::loadSettings(QSettings *pSettings)\n{\n Q_UNUSED(pSettings);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::saveSettings(QSettings *pSettings) const\n{\n Q_UNUSED(pSettings);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::handleAction(const QUrl &pUrl)\n{\n Q_UNUSED(pUrl);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\/\/ View interface\n\/\/==============================================================================\n\nViewInterface::Mode SampleViewPlugin::viewMode() const\n{\n \/\/ Return our mode\n\n return ViewInterface::Sample;\n}\n\n\/\/==============================================================================\n\nQStringList SampleViewPlugin::viewMimeTypes() const\n{\n \/\/ Return the MIME types we support\n \/\/ Note: we allow any kind of file, hence our empty string list...\n\n return QStringList();\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::initializeView()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::finalizeView()\n{\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nQWidget * SampleViewPlugin::viewWidget(const QString &pFileName,\n const bool &pCreate)\n{\n \/\/ Update our sample view widget using the given file\n\n if (pCreate) {\n mFileName = pFileName;\n\n mViewWidget->initialize(pFileName);\n\n return mViewWidget;\n } else {\n mFileName = QString();\n\n return 0;\n }\n}\n\n\/\/==============================================================================\n\nvoid SampleViewPlugin::removeViewWidget(const QString &pFileName)\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n}\n\n\/\/==============================================================================\n\nQString SampleViewPlugin::viewName() const\n{\n \/\/ Return our sample view's name\n\n return tr(\"Sample\");\n}\n\n\/\/==============================================================================\n\nQIcon SampleViewPlugin::fileTabIcon(const QString &pFileName) const\n{\n Q_UNUSED(pFileName);\n\n \/\/ We don't handle this interface...\n\n return QIcon();\n}\n\n\/\/==============================================================================\n\n} \/\/ namespace SampleView\n} \/\/ namespace OpenCOR\n\n\/\/==============================================================================\n\/\/ End of file\n\/\/==============================================================================\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"types.hpp\"\n#include <mach\/mach_time.h>\n#include <optional>\n#include <pqrs\/dispatcher.hpp>\n#include <pqrs\/osx\/iokit_hid_device.hpp>\n\nnamespace krbn {\nclass hid_keyboard_caps_lock_led_state_manager final : public pqrs::dispatcher::extra::dispatcher_client {\npublic:\n hid_keyboard_caps_lock_led_state_manager(IOHIDDeviceRef device) : dispatcher_client(),\n device_(device),\n timer_(*this) {\n if (device_) {\n pqrs::osx::iokit_hid_device hid_device(*device_);\n for (const auto& e : hid_device.make_elements()) {\n auto usage_page = pqrs::osx::iokit_hid_usage_page(IOHIDElementGetUsagePage(*e));\n auto usage = pqrs::osx::iokit_hid_usage(IOHIDElementGetUsage(*e));\n\n if (usage_page == pqrs::osx::iokit_hid_usage_page_leds &&\n usage == pqrs::osx::iokit_hid_usage_led_caps_lock) {\n element_ = e;\n }\n }\n }\n }\n\n ~hid_keyboard_caps_lock_led_state_manager(void) {\n detach_from_dispatcher([this] {\n timer_.stop();\n });\n }\n\n void set_state(std::optional<led_state> value) {\n std::lock_guard<std::mutex> lock(state_mutex_);\n\n state_ = value;\n }\n\n void async_start(void) {\n timer_.start(\n [this] {\n update_caps_lock_led();\n },\n std::chrono::milliseconds(1000));\n }\n\n void async_stop(void) {\n timer_.stop();\n }\n\nprivate:\n void update_caps_lock_led(void) const {\n if (auto integer_value = make_integer_value()) {\n if (device_ && element_) {\n if (auto value = IOHIDValueCreateWithIntegerValue(kCFAllocatorDefault,\n *element_,\n mach_absolute_time(),\n *integer_value)) {\n IOHIDDeviceSetValue(*device_, *element_, value);\n\n CFRelease(value);\n }\n }\n }\n }\n\n std::optional<CFIndex> make_integer_value(void) const {\n std::lock_guard<std::mutex> lock(state_mutex_);\n\n if (state_ && element_) {\n if (*state_ == led_state::on) {\n return IOHIDElementGetLogicalMax(*element_);\n } else {\n return IOHIDElementGetLogicalMin(*element_);\n }\n }\n\n return std::nullopt;\n }\n\n pqrs::cf_ptr<IOHIDDeviceRef> device_;\n pqrs::cf_ptr<IOHIDElementRef> element_;\n std::optional<led_state> state_;\n mutable std::mutex state_mutex_;\n pqrs::dispatcher::extra::timer timer_;\n};\n} \/\/ namespace krbn\n<commit_msg>add comment<commit_after>#pragma once\n\n#include \"types.hpp\"\n#include <mach\/mach_time.h>\n#include <optional>\n#include <pqrs\/dispatcher.hpp>\n#include <pqrs\/osx\/iokit_hid_device.hpp>\n\nnamespace krbn {\nclass hid_keyboard_caps_lock_led_state_manager final : public pqrs::dispatcher::extra::dispatcher_client {\npublic:\n hid_keyboard_caps_lock_led_state_manager(IOHIDDeviceRef device) : dispatcher_client(),\n device_(device),\n timer_(*this) {\n if (device_) {\n pqrs::osx::iokit_hid_device hid_device(*device_);\n for (const auto& e : hid_device.make_elements()) {\n auto usage_page = pqrs::osx::iokit_hid_usage_page(IOHIDElementGetUsagePage(*e));\n auto usage = pqrs::osx::iokit_hid_usage(IOHIDElementGetUsage(*e));\n\n if (usage_page == pqrs::osx::iokit_hid_usage_page_leds &&\n usage == pqrs::osx::iokit_hid_usage_led_caps_lock) {\n element_ = e;\n }\n }\n }\n }\n\n ~hid_keyboard_caps_lock_led_state_manager(void) {\n detach_from_dispatcher([this] {\n timer_.stop();\n });\n }\n\n void set_state(std::optional<led_state> value) {\n std::lock_guard<std::mutex> lock(state_mutex_);\n\n state_ = value;\n }\n\n void async_start(void) {\n timer_.start(\n [this] {\n update_caps_lock_led();\n },\n std::chrono::milliseconds(1000));\n }\n\n void async_stop(void) {\n timer_.stop();\n }\n\nprivate:\n void update_caps_lock_led(void) const {\n \/\/ macOS 10.12 sometimes synchronize caps lock LED to internal keyboard caps lock state.\n \/\/ The behavior causes LED state mismatch because\n \/\/ the caps lock state of karabiner_grabber is independent from the hardware caps lock state.\n \/\/ Thus, we monitor the LED state and update it if needed.\n\n if (auto integer_value = make_integer_value()) {\n if (device_ && element_) {\n if (auto value = IOHIDValueCreateWithIntegerValue(kCFAllocatorDefault,\n *element_,\n mach_absolute_time(),\n *integer_value)) {\n IOHIDDeviceSetValue(*device_, *element_, value);\n\n CFRelease(value);\n }\n }\n }\n }\n\n std::optional<CFIndex> make_integer_value(void) const {\n std::lock_guard<std::mutex> lock(state_mutex_);\n\n if (state_ && element_) {\n if (*state_ == led_state::on) {\n return IOHIDElementGetLogicalMax(*element_);\n } else {\n return IOHIDElementGetLogicalMin(*element_);\n }\n }\n\n return std::nullopt;\n }\n\n pqrs::cf_ptr<IOHIDDeviceRef> device_;\n pqrs::cf_ptr<IOHIDElementRef> element_;\n std::optional<led_state> state_;\n mutable std::mutex state_mutex_;\n pqrs::dispatcher::extra::timer timer_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/proof:$Name: $:$Id: TProof.h,v 1.71 2005\/10\/27 23:28:33 rdm Exp $\n\/\/ Author: Paul Nilsson 7\/12\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TProofResourcesStatic \/\/\n\/\/ \/\/\n\/\/ Implementation of PROOF static resources. \/\/\n\/\/ The purpose of this class is to provide a standard interface to \/\/\n\/\/ static config files. It interprets Proof config files (proof.conf) \/\/\n\/\/ and sorts the contents into TProofNodeInfo objects. Master info will \/\/\n\/\/ be placed in fMaster (of type TProofNodeInfo). Submaster info will \/\/\n\/\/ be put in fSubmasterList (a TList of TProofNodeInfo objects), while \/\/\n\/\/ workers (and condorworkers) will be placed in fWorkerList (a TList \/\/\n\/\/ of TProofNodeInfo objects). \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Riostream.h\"\n#include \"TProofResourcesStatic.h\"\n#include \"TSystem.h\"\n#include \"TProofServ.h\"\n#include \"TProof.h\"\n#include \"TInetAddress.h\"\n#include \"TProofNodeInfo.h\"\n#include \"TProofDebug.h\"\n#include \"TUrl.h\"\n#include \"TObjArray.h\"\n#include \"TObjString.h\"\n#include \"TError.h\"\n\nClassImp(TProofResourcesStatic)\n\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::TProofResourcesStatic()\n{\n \/\/ This ctor is used in TProofServ::Setup() in combination with GetWorkDir()\n \/\/ for a quick scan of the config file to retrieve the work directory.\n\n \/\/ Create master node info and submaster\/worker lists, and set default values\n InitResources();\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::TProofResourcesStatic(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Using this ctor will retrieve all information in the config file\n \/\/ and store it in fMaster, fSubmasterList and fWorkerList,\n \/\/ condorworkers will be stored in the fWorkerList.\n\n \/\/ Create master node info and submaster\/worker lists, and set default values\n InitResources();\n\n \/\/ Open and read the PROOF config file\n if (!ReadConfigFile(confDir, fileName)) {\n Error(\"TProofResourcesStatic\", \"error encountered while reading config file\");\n fValid = kFALSE;\n }\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::~TProofResourcesStatic()\n{\n \/\/ Destructor.\n\n delete fSubmasterList;\n delete fWorkerList;\n delete fMaster;\n}\n\n\/\/______________________________________________________________________________\nvoid TProofResourcesStatic::InitResources()\n{\n \/\/ Create master node info and submaster\/worker lists,\n \/\/ and set default values.\n\n \/\/ Create master\n fMaster = new TProofNodeInfo();\n fMaster->fNodeType = TProofNodeInfo::GetNodeType(\"master\");\n fFoundMaster = kFALSE; \/\/ Set to kTRUE if the config file contains master info\n\n \/\/ Create workers\n fWorkerList = new TList();\n fWorkerList->SetOwner();\n\n \/\/ Create submaster\n fSubmasterList = new TList();\n fSubmasterList->SetOwner();\n\n \/\/ Assume that the config file will be ok\n fValid = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTProofNodeInfo *TProofResourcesStatic::GetMaster()\n{\n \/\/ Get the master node. Only return the master info if it was set\n \/\/ in the config file.\n\n if (fFoundMaster)\n return fMaster;\n\n return 0;\n}\n\n\/\/______________________________________________________________________________\nTList *TProofResourcesStatic::GetSubmasters()\n{\n \/\/ Get the list of submaster nodes.\n\n return fSubmasterList;\n}\n\n\/\/______________________________________________________________________________\nTList *TProofResourcesStatic::GetWorkers(void)\n{\n \/\/ Get the list of worker nodes.\n\n return fWorkerList;\n}\n\n\/\/______________________________________________________________________________\nBool_t TProofResourcesStatic::ReadConfigFile(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Read the PROOF config file and fill the master and worker list.\n\n Bool_t status = kTRUE;\n\n PDB(kGlobal,1)\n Info(\"ReadConfigFile\", \"using PROOF config file: %s\", fileName.Data());\n\n \/\/ Add a proper path to the file name\n fFileName.Form(\"%s\/.%s\", gSystem->Getenv(\"HOME\"), fileName.Data());\n PDB(kGlobal,2)\n Info(\"ReadConfigFile\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n fFileName.Form(\"%s\/proof\/etc\/%s\", confDir.Data(), fileName.Data());\n PDB(kGlobal,2)\n Info(\"ReadConfigFile\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n Error(\"ReadConfigFile\", \"no PROOF config file found\");\n return kFALSE;\n }\n }\n\n \/\/ Open the config file\n fstream infile(fFileName.Data(), std::ios::in);\n if (infile.is_open()) {\n Bool_t isMaster = kFALSE;\n Bool_t isSubmaster = kFALSE;\n Bool_t isWorker = kFALSE;\n\n \/\/ Each line in the file consists of several 'keywords', e.g.\n \/\/ line = \"master mypc image=local\"\n \/\/ keyword[0] = \"master\"\n \/\/ keyword[1] = \"mypc\"\n \/\/ keyword[2] = \"image=local\"\n \/\/ The last keyword has an option \"image\" with value \"local\"\n TString line = \"\";\n TString keyword = \"\";\n\n \/\/ Read the entire file into the allLines object\n TString allLines = \"\";\n allLines.ReadString(infile);\n TObjArray *lines = allLines.Tokenize(\"\\n\");\n Int_t numberOfLines = lines->GetEntries();\n\n \/\/ Process one line at the time\n for (Int_t j = 0; j < numberOfLines; j++) {\n TObjString *objLine = (TObjString *)lines->At(j);\n line = objLine->GetString();\n line = line.Strip(TString::kBoth);\n\n \/\/ Unless this line was empty or a comment, interpret the line\n if ( !((line(0,1) == \"#\") || (line == \"\")) ) {\n TProofNodeInfo *nodeinfo = 0;\n\n \/\/ Reset boolean (condorworkers are treated as a workers)\n isMaster = kFALSE;\n isSubmaster = kFALSE;\n isWorker = kFALSE;\n\n \/\/ Extract all words in the current line\n TObjArray *tokens = line.Tokenize(\" \");\n Int_t n = tokens->GetEntries();\n TString option;\n TString value;\n for (Int_t i = 0; i < n; i++) {\n\n \/\/ Extrace one word from the current line\n keyword = ((TObjString *)tokens->At(i))->GetString();\n\n \/\/ Interpret this keyword\n switch (GetInfoType(keyword)) {\n case kNodeType: {\n if (keyword == \"master\" || keyword == \"node\") {\n nodeinfo = fMaster;\n nodeinfo->fWorkDir = kPROOF_WorkDir;\n isMaster = kTRUE; \/\/ will be reset\n fFoundMaster = kTRUE; \/\/ will not be reset\n }\n \/\/ [either submaster, worker or condorworker]\n else if (keyword == \"submaster\") {\n \/\/ Get a submaster info node\n nodeinfo = CreateNodeInfo(keyword);\n isSubmaster = kTRUE;\n } else {\n \/\/ Get a worker or condorworker info node\n nodeinfo = CreateNodeInfo(keyword);\n isWorker = kTRUE;\n }\n break;\n }\n case kHost: {\n \/\/ Store the host name\n if (nodeinfo) {\n nodeinfo->fNodeName = keyword;\n\n \/\/ Set default image\n if (isMaster) {\n TString node = TUrl(nodeinfo->fNodeName).GetHost();\n nodeinfo->fImage = strstr(nodeinfo->fNodeName, node.Data());\n } else {\n \/\/ If the node name contains an '@' sign, it should be removed\n \/\/ before copying it into the [default] image info\n \/\/ On what position is the '@' sign? (if there is one)\n TString tmp = nodeinfo->fNodeName;\n const Ssiz_t equalPosition = tmp.Index(\"@\", 1, 0, TString::kExact);\n\n \/\/ Extract the host\n nodeinfo->fImage = tmp(equalPosition + 1, tmp.Length());\n }\n } else {\n Error(\"ReadConfigFile\",\"Command not recognized: %s (ignored)\",\n keyword.Data());\n }\n break;\n }\n case kOption: {\n \/\/ On what position is the '=' sign?\n const Ssiz_t equalPosition =\n keyword.Index(\"=\", 1, 0, TString::kExact);\n\n \/\/ Extract the option and its value\n TString tmp = keyword;\n option = tmp(0, equalPosition);\n value = tmp(equalPosition + 1, tmp.Length());\n\n \/\/ Set the node info options\n SetOption(nodeinfo, option, value);\n break;\n }\n default:\n break;\n } \/\/ end switch\n\n } \/\/ end if\n\n \/\/ Store the submaster, worker or condorworker\n if (isWorker) {\n fWorkerList->Add(nodeinfo);\n }\n else if (isSubmaster) {\n fSubmasterList->Add(nodeinfo);\n }\n } \/\/ else\n\n } \/\/ while (! infile.eof() )\n infile.close();\n\n \/\/ Did the config file contain appropriate master information?\n if (!fFoundMaster) {\n Error(\"ReadConfigFile\",\"No master info found in config file\");\n status = kFALSE;\n } else {\n \/\/ Check if the master can run on this node\n TString node = TUrl(fMaster->fNodeName).GetHost();\n TString host = gSystem->GetHostByName(gSystem->HostName()).GetHostName();\n TInetAddress inetaddr = gSystem->GetHostByName(node);\n if ( !(!host.CompareTo(inetaddr.GetHostName()) || (node == \"localhost\")) ) {\n Error(\"ReadConfigFile\",\"No appropriate master found in config file\");\n status = kFALSE;\n }\n\n \/\/ Check the master work directory\n if (strcmp(gSystem->ExpandPathName(fMaster->GetWorkDir()),\n gProofServ->GetWorkDir())) {\n Error(\"ReadConfigFile\",\"Bad work directory: %s\", fMaster->GetWorkDir().Data());\n status = kFALSE;\n }\n }\n } \/\/ end if (infile.is_open())\n else {\n \/\/ Error: could not open file\n status = kFALSE;\n }\n\n return status;\n}\n\n\/\/______________________________________________________________________________\nTString TProofResourcesStatic::GetWorkDir(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Read the working directory from the PROOF config file.\n \/\/ This method is used by TProofServ::Setup() rather than the full\n \/\/ interpretation of the config file as is done in ReadConfigFile().\n \/\/ If the workdir option is not specified in the config file,\n \/\/ GetWorkDir() will return an empty string.\n\n TString workDir;\n Bool_t status = kTRUE;\n\n PDB(kGlobal,1)\n Info(\"GetWorkDir\", \"using PROOF config file: %s\", fileName.Data());\n\n \/\/ Add a proper path to the file name\n fFileName.Form(\"%s\/.%s\", gSystem->Getenv(\"HOME\"), fileName.Data());\n PDB(kGlobal,2)\n Info(\"GetWorkDir\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n fFileName.Form(\"%s\/proof\/etc\/%s\", confDir.Data(), fileName.Data());\n PDB(kGlobal,2)\n Info(\"GetWorkDir\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n Error(\"GetWorkDir\", \"no PROOF config file found\");\n fValid = kFALSE;\n return kFALSE;\n }\n }\n\n \/\/ Open the config file\n fstream infile(fFileName.Data(), std::ios::in);\n if (infile.is_open()) {\n TProofNodeInfo *nodeinfo = 0;\n TString line = \"\";\n TString keyword = \"\";\n\n \/\/ Read the entire file into the allLines object\n TString allLines = \"\";\n allLines.ReadString(infile);\n TObjArray *lines = allLines.Tokenize(\"\\n\");\n Int_t numberOfLines = lines->GetEntries();\n\n \/\/ Process one line at the time\n for (Int_t j = 0; j < numberOfLines; j++) {\n\t line = ((TObjString *)lines->At(j))->GetString();\n line = line.Strip(TString::kBoth);\n\n \/\/ Unless this line was empty or a comment, interpret the line\n if ( !((line(0,1) == \"#\") || (line == \"\")) ) {\n\n \/\/ Extract all words in the current line\n TObjArray *tokens = line.Tokenize(\" \");\n Int_t n = tokens->GetEntries();\n TString option;\n TString value;\n for (Int_t i = 0; i < n; i++) {\n\n \/\/ Extrace one word from the current line\n keyword = ((TObjString *)tokens->At(i))->GetString();\n\n \/\/ Interpret this keyword\n switch (GetInfoType(keyword)) {\n case kNodeType: {\n if (keyword == \"master\" || keyword == \"node\") {\n nodeinfo = fMaster;\n fFoundMaster = kTRUE;\n }\n break;\n }\n case kOption: {\n \/\/ On what position is the '=' sign?\n const Ssiz_t equalPosition =\n keyword.Index(\"=\", 1, 0, TString::kExact);\n\n \/\/ Extract the option and its value\n TString tmp = keyword;\n option = tmp(0, equalPosition);\n\n if ((option == \"workdir\") &&\n (nodeinfo->fNodeType == TProofNodeInfo::GetNodeType(\"master\"))) {\n nodeinfo->fWorkDir = tmp(equalPosition + 1, tmp.Length());\n }\n\n break;\n }\n default:\n break;\n } \/\/ end switch\n\n } \/\/ end if\n\n } \/\/ else\n\n } \/\/ while (! infile.eof() )\n\n \/\/ Did the config file contain appropriate master information?\n if (fFoundMaster) {\n \/\/ Set the work directory\n workDir = fMaster->GetWorkDir();\n } else {\n Error(\"ReadConfigFile\",\"No master found in config file\");\n fValid = kFALSE;\n status = kFALSE;\n }\n } \/\/ end if (infile.is_open())\n else {\n \/\/ Error: could not open file\n status = kFALSE;\n fValid = kFALSE;\n }\n\n infile.close();\n\n return (status ? workDir : \"\");\n}\n\n\/\/______________________________________________________________________________\nvoid TProofResourcesStatic::SetOption(TProofNodeInfo *nodeinfo,\n const TString &option,\n const TString &value)\n{\n \/\/ Static method to set the node info options.\n\n if (option == \"workdir\") {\n nodeinfo->fWorkDir = value;\n } else if (option == \"image\") {\n nodeinfo->fImage = value;\n } else if (option == \"perf\") {\n nodeinfo->fPerfIndex = value.Atoi();\n } else if (option == \"config\") {\n nodeinfo->fConfig = value;\n } else if (option == \"msd\") {\n if (nodeinfo->fNodeType == TProofNodeInfo::GetNodeType(\"submaster\")) {\n nodeinfo->fMsd = value;\n } else {\n ::Error(\"SetOption\",\"msd only valid for submasters [ignored]\");\n }\n } else if (option == \"port\") {\n nodeinfo->fPort = value.Atoi();\n } else {\n ::Error(\"SetOption\",\"No such option [%s=%s]\",option.Data(),value.Data());\n }\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::EInfoType TProofResourcesStatic::GetInfoType(const TString &word)\n{\n \/\/ Static method to determine the info type.\n\n EInfoType type = kNodeType;\n\n if ((word == \"node\") || (word == \"master\") || (word == \"submaster\") ||\n (word == \"worker\") || (word == \"slave\") ||\n (word == \"condorworker\") || (word == \"condorslave\")) {\n type = kNodeType;\n }\n else if (word.Contains(\"=\", TString::kExact)) {\n type = kOption;\n } else {\n type = kHost;\n }\n\n return type;\n}\n\n\/\/______________________________________________________________________________\nTProofNodeInfo *TProofResourcesStatic::CreateNodeInfo(const TString &name)\n{\n \/\/ Fill out the preliminary TProofNodeInfo structure.\n\n TProofNodeInfo *nodeInfo = new TProofNodeInfo();\n nodeInfo->fNodeType = TProofNodeInfo::GetNodeType(name);\n nodeInfo->fNodeName = name;\n nodeInfo->fPort = -1;\n nodeInfo->fPerfIndex = 100;\n\n return nodeInfo;\n}\n<commit_msg>remove tab.<commit_after>\/\/ @(#)root\/proof:$Name: $:$Id: TProofResourcesStatic.cxx,v 1.1 2005\/12\/09 01:12:17 rdm Exp $\n\/\/ Author: Paul Nilsson 7\/12\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2005, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TProofResourcesStatic \/\/\n\/\/ \/\/\n\/\/ Implementation of PROOF static resources. \/\/\n\/\/ The purpose of this class is to provide a standard interface to \/\/\n\/\/ static config files. It interprets Proof config files (proof.conf) \/\/\n\/\/ and sorts the contents into TProofNodeInfo objects. Master info will \/\/\n\/\/ be placed in fMaster (of type TProofNodeInfo). Submaster info will \/\/\n\/\/ be put in fSubmasterList (a TList of TProofNodeInfo objects), while \/\/\n\/\/ workers (and condorworkers) will be placed in fWorkerList (a TList \/\/\n\/\/ of TProofNodeInfo objects). \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Riostream.h\"\n#include \"TProofResourcesStatic.h\"\n#include \"TSystem.h\"\n#include \"TProofServ.h\"\n#include \"TProof.h\"\n#include \"TInetAddress.h\"\n#include \"TProofNodeInfo.h\"\n#include \"TProofDebug.h\"\n#include \"TUrl.h\"\n#include \"TObjArray.h\"\n#include \"TObjString.h\"\n#include \"TError.h\"\n\nClassImp(TProofResourcesStatic)\n\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::TProofResourcesStatic()\n{\n \/\/ This ctor is used in TProofServ::Setup() in combination with GetWorkDir()\n \/\/ for a quick scan of the config file to retrieve the work directory.\n\n \/\/ Create master node info and submaster\/worker lists, and set default values\n InitResources();\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::TProofResourcesStatic(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Using this ctor will retrieve all information in the config file\n \/\/ and store it in fMaster, fSubmasterList and fWorkerList,\n \/\/ condorworkers will be stored in the fWorkerList.\n\n \/\/ Create master node info and submaster\/worker lists, and set default values\n InitResources();\n\n \/\/ Open and read the PROOF config file\n if (!ReadConfigFile(confDir, fileName)) {\n Error(\"TProofResourcesStatic\", \"error encountered while reading config file\");\n fValid = kFALSE;\n }\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::~TProofResourcesStatic()\n{\n \/\/ Destructor.\n\n delete fSubmasterList;\n delete fWorkerList;\n delete fMaster;\n}\n\n\/\/______________________________________________________________________________\nvoid TProofResourcesStatic::InitResources()\n{\n \/\/ Create master node info and submaster\/worker lists,\n \/\/ and set default values.\n\n \/\/ Create master\n fMaster = new TProofNodeInfo();\n fMaster->fNodeType = TProofNodeInfo::GetNodeType(\"master\");\n fFoundMaster = kFALSE; \/\/ Set to kTRUE if the config file contains master info\n\n \/\/ Create workers\n fWorkerList = new TList();\n fWorkerList->SetOwner();\n\n \/\/ Create submaster\n fSubmasterList = new TList();\n fSubmasterList->SetOwner();\n\n \/\/ Assume that the config file will be ok\n fValid = kTRUE;\n}\n\n\/\/______________________________________________________________________________\nTProofNodeInfo *TProofResourcesStatic::GetMaster()\n{\n \/\/ Get the master node. Only return the master info if it was set\n \/\/ in the config file.\n\n if (fFoundMaster)\n return fMaster;\n\n return 0;\n}\n\n\/\/______________________________________________________________________________\nTList *TProofResourcesStatic::GetSubmasters()\n{\n \/\/ Get the list of submaster nodes.\n\n return fSubmasterList;\n}\n\n\/\/______________________________________________________________________________\nTList *TProofResourcesStatic::GetWorkers(void)\n{\n \/\/ Get the list of worker nodes.\n\n return fWorkerList;\n}\n\n\/\/______________________________________________________________________________\nBool_t TProofResourcesStatic::ReadConfigFile(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Read the PROOF config file and fill the master and worker list.\n\n Bool_t status = kTRUE;\n\n PDB(kGlobal,1)\n Info(\"ReadConfigFile\", \"using PROOF config file: %s\", fileName.Data());\n\n \/\/ Add a proper path to the file name\n fFileName.Form(\"%s\/.%s\", gSystem->Getenv(\"HOME\"), fileName.Data());\n PDB(kGlobal,2)\n Info(\"ReadConfigFile\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n fFileName.Form(\"%s\/proof\/etc\/%s\", confDir.Data(), fileName.Data());\n PDB(kGlobal,2)\n Info(\"ReadConfigFile\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n Error(\"ReadConfigFile\", \"no PROOF config file found\");\n return kFALSE;\n }\n }\n\n \/\/ Open the config file\n fstream infile(fFileName.Data(), std::ios::in);\n if (infile.is_open()) {\n Bool_t isMaster = kFALSE;\n Bool_t isSubmaster = kFALSE;\n Bool_t isWorker = kFALSE;\n\n \/\/ Each line in the file consists of several 'keywords', e.g.\n \/\/ line = \"master mypc image=local\"\n \/\/ keyword[0] = \"master\"\n \/\/ keyword[1] = \"mypc\"\n \/\/ keyword[2] = \"image=local\"\n \/\/ The last keyword has an option \"image\" with value \"local\"\n TString line = \"\";\n TString keyword = \"\";\n\n \/\/ Read the entire file into the allLines object\n TString allLines = \"\";\n allLines.ReadString(infile);\n TObjArray *lines = allLines.Tokenize(\"\\n\");\n Int_t numberOfLines = lines->GetEntries();\n\n \/\/ Process one line at the time\n for (Int_t j = 0; j < numberOfLines; j++) {\n TObjString *objLine = (TObjString *)lines->At(j);\n line = objLine->GetString();\n line = line.Strip(TString::kBoth);\n\n \/\/ Unless this line was empty or a comment, interpret the line\n if ( !((line(0,1) == \"#\") || (line == \"\")) ) {\n TProofNodeInfo *nodeinfo = 0;\n\n \/\/ Reset boolean (condorworkers are treated as a workers)\n isMaster = kFALSE;\n isSubmaster = kFALSE;\n isWorker = kFALSE;\n\n \/\/ Extract all words in the current line\n TObjArray *tokens = line.Tokenize(\" \");\n Int_t n = tokens->GetEntries();\n TString option;\n TString value;\n for (Int_t i = 0; i < n; i++) {\n\n \/\/ Extrace one word from the current line\n keyword = ((TObjString *)tokens->At(i))->GetString();\n\n \/\/ Interpret this keyword\n switch (GetInfoType(keyword)) {\n case kNodeType: {\n if (keyword == \"master\" || keyword == \"node\") {\n nodeinfo = fMaster;\n nodeinfo->fWorkDir = kPROOF_WorkDir;\n isMaster = kTRUE; \/\/ will be reset\n fFoundMaster = kTRUE; \/\/ will not be reset\n }\n \/\/ [either submaster, worker or condorworker]\n else if (keyword == \"submaster\") {\n \/\/ Get a submaster info node\n nodeinfo = CreateNodeInfo(keyword);\n isSubmaster = kTRUE;\n } else {\n \/\/ Get a worker or condorworker info node\n nodeinfo = CreateNodeInfo(keyword);\n isWorker = kTRUE;\n }\n break;\n }\n case kHost: {\n \/\/ Store the host name\n if (nodeinfo) {\n nodeinfo->fNodeName = keyword;\n\n \/\/ Set default image\n if (isMaster) {\n TString node = TUrl(nodeinfo->fNodeName).GetHost();\n nodeinfo->fImage = strstr(nodeinfo->fNodeName, node.Data());\n } else {\n \/\/ If the node name contains an '@' sign, it should be removed\n \/\/ before copying it into the [default] image info\n \/\/ On what position is the '@' sign? (if there is one)\n TString tmp = nodeinfo->fNodeName;\n const Ssiz_t equalPosition = tmp.Index(\"@\", 1, 0, TString::kExact);\n\n \/\/ Extract the host\n nodeinfo->fImage = tmp(equalPosition + 1, tmp.Length());\n }\n } else {\n Error(\"ReadConfigFile\",\"Command not recognized: %s (ignored)\",\n keyword.Data());\n }\n break;\n }\n case kOption: {\n \/\/ On what position is the '=' sign?\n const Ssiz_t equalPosition =\n keyword.Index(\"=\", 1, 0, TString::kExact);\n\n \/\/ Extract the option and its value\n TString tmp = keyword;\n option = tmp(0, equalPosition);\n value = tmp(equalPosition + 1, tmp.Length());\n\n \/\/ Set the node info options\n SetOption(nodeinfo, option, value);\n break;\n }\n default:\n break;\n } \/\/ end switch\n\n } \/\/ end if\n\n \/\/ Store the submaster, worker or condorworker\n if (isWorker) {\n fWorkerList->Add(nodeinfo);\n }\n else if (isSubmaster) {\n fSubmasterList->Add(nodeinfo);\n }\n } \/\/ else\n\n } \/\/ while (! infile.eof() )\n infile.close();\n\n \/\/ Did the config file contain appropriate master information?\n if (!fFoundMaster) {\n Error(\"ReadConfigFile\",\"No master info found in config file\");\n status = kFALSE;\n } else {\n \/\/ Check if the master can run on this node\n TString node = TUrl(fMaster->fNodeName).GetHost();\n TString host = gSystem->GetHostByName(gSystem->HostName()).GetHostName();\n TInetAddress inetaddr = gSystem->GetHostByName(node);\n if ( !(!host.CompareTo(inetaddr.GetHostName()) || (node == \"localhost\")) ) {\n Error(\"ReadConfigFile\",\"No appropriate master found in config file\");\n status = kFALSE;\n }\n\n \/\/ Check the master work directory\n if (strcmp(gSystem->ExpandPathName(fMaster->GetWorkDir()),\n gProofServ->GetWorkDir())) {\n Error(\"ReadConfigFile\",\"Bad work directory: %s\", fMaster->GetWorkDir().Data());\n status = kFALSE;\n }\n }\n } \/\/ end if (infile.is_open())\n else {\n \/\/ Error: could not open file\n status = kFALSE;\n }\n\n return status;\n}\n\n\/\/______________________________________________________________________________\nTString TProofResourcesStatic::GetWorkDir(const TString &confDir,\n const TString &fileName)\n{\n \/\/ Read the working directory from the PROOF config file.\n \/\/ This method is used by TProofServ::Setup() rather than the full\n \/\/ interpretation of the config file as is done in ReadConfigFile().\n \/\/ If the workdir option is not specified in the config file,\n \/\/ GetWorkDir() will return an empty string.\n\n TString workDir;\n Bool_t status = kTRUE;\n\n PDB(kGlobal,1)\n Info(\"GetWorkDir\", \"using PROOF config file: %s\", fileName.Data());\n\n \/\/ Add a proper path to the file name\n fFileName.Form(\"%s\/.%s\", gSystem->Getenv(\"HOME\"), fileName.Data());\n PDB(kGlobal,2)\n Info(\"GetWorkDir\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n fFileName.Form(\"%s\/proof\/etc\/%s\", confDir.Data(), fileName.Data());\n PDB(kGlobal,2)\n Info(\"GetWorkDir\", \"checking PROOF config file %s\", fFileName.Data());\n if (gSystem->AccessPathName(fFileName, kReadPermission)) {\n Error(\"GetWorkDir\", \"no PROOF config file found\");\n fValid = kFALSE;\n return kFALSE;\n }\n }\n\n \/\/ Open the config file\n fstream infile(fFileName.Data(), std::ios::in);\n if (infile.is_open()) {\n TProofNodeInfo *nodeinfo = 0;\n TString line = \"\";\n TString keyword = \"\";\n\n \/\/ Read the entire file into the allLines object\n TString allLines = \"\";\n allLines.ReadString(infile);\n TObjArray *lines = allLines.Tokenize(\"\\n\");\n Int_t numberOfLines = lines->GetEntries();\n\n \/\/ Process one line at the time\n for (Int_t j = 0; j < numberOfLines; j++) {\n line = ((TObjString *)lines->At(j))->GetString();\n line = line.Strip(TString::kBoth);\n\n \/\/ Unless this line was empty or a comment, interpret the line\n if ( !((line(0,1) == \"#\") || (line == \"\")) ) {\n\n \/\/ Extract all words in the current line\n TObjArray *tokens = line.Tokenize(\" \");\n Int_t n = tokens->GetEntries();\n TString option;\n TString value;\n for (Int_t i = 0; i < n; i++) {\n\n \/\/ Extrace one word from the current line\n keyword = ((TObjString *)tokens->At(i))->GetString();\n\n \/\/ Interpret this keyword\n switch (GetInfoType(keyword)) {\n case kNodeType: {\n if (keyword == \"master\" || keyword == \"node\") {\n nodeinfo = fMaster;\n fFoundMaster = kTRUE;\n }\n break;\n }\n case kOption: {\n \/\/ On what position is the '=' sign?\n const Ssiz_t equalPosition =\n keyword.Index(\"=\", 1, 0, TString::kExact);\n\n \/\/ Extract the option and its value\n TString tmp = keyword;\n option = tmp(0, equalPosition);\n\n if ((option == \"workdir\") &&\n (nodeinfo->fNodeType == TProofNodeInfo::GetNodeType(\"master\"))) {\n nodeinfo->fWorkDir = tmp(equalPosition + 1, tmp.Length());\n }\n\n break;\n }\n default:\n break;\n } \/\/ end switch\n\n } \/\/ end if\n\n } \/\/ else\n\n } \/\/ while (! infile.eof() )\n\n \/\/ Did the config file contain appropriate master information?\n if (fFoundMaster) {\n \/\/ Set the work directory\n workDir = fMaster->GetWorkDir();\n } else {\n Error(\"ReadConfigFile\",\"No master found in config file\");\n fValid = kFALSE;\n status = kFALSE;\n }\n } \/\/ end if (infile.is_open())\n else {\n \/\/ Error: could not open file\n status = kFALSE;\n fValid = kFALSE;\n }\n\n infile.close();\n\n return (status ? workDir : \"\");\n}\n\n\/\/______________________________________________________________________________\nvoid TProofResourcesStatic::SetOption(TProofNodeInfo *nodeinfo,\n const TString &option,\n const TString &value)\n{\n \/\/ Static method to set the node info options.\n\n if (option == \"workdir\") {\n nodeinfo->fWorkDir = value;\n } else if (option == \"image\") {\n nodeinfo->fImage = value;\n } else if (option == \"perf\") {\n nodeinfo->fPerfIndex = value.Atoi();\n } else if (option == \"config\") {\n nodeinfo->fConfig = value;\n } else if (option == \"msd\") {\n if (nodeinfo->fNodeType == TProofNodeInfo::GetNodeType(\"submaster\")) {\n nodeinfo->fMsd = value;\n } else {\n ::Error(\"SetOption\",\"msd only valid for submasters [ignored]\");\n }\n } else if (option == \"port\") {\n nodeinfo->fPort = value.Atoi();\n } else {\n ::Error(\"SetOption\",\"No such option [%s=%s]\",option.Data(),value.Data());\n }\n}\n\n\/\/______________________________________________________________________________\nTProofResourcesStatic::EInfoType TProofResourcesStatic::GetInfoType(const TString &word)\n{\n \/\/ Static method to determine the info type.\n\n EInfoType type = kNodeType;\n\n if ((word == \"node\") || (word == \"master\") || (word == \"submaster\") ||\n (word == \"worker\") || (word == \"slave\") ||\n (word == \"condorworker\") || (word == \"condorslave\")) {\n type = kNodeType;\n }\n else if (word.Contains(\"=\", TString::kExact)) {\n type = kOption;\n } else {\n type = kHost;\n }\n\n return type;\n}\n\n\/\/______________________________________________________________________________\nTProofNodeInfo *TProofResourcesStatic::CreateNodeInfo(const TString &name)\n{\n \/\/ Fill out the preliminary TProofNodeInfo structure.\n\n TProofNodeInfo *nodeInfo = new TProofNodeInfo();\n nodeInfo->fNodeType = TProofNodeInfo::GetNodeType(name);\n nodeInfo->fNodeName = name;\n nodeInfo->fPort = -1;\n nodeInfo->fPerfIndex = 100;\n\n return nodeInfo;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QDebug>\n#include <QSettings>\n#include <QFileInfo>\n#include <QDir>\n#include <QThread>\n\n#include <coreplugin\/messagemanager.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <coreplugin\/progressmanager\/futureprogress.h>\n#include <utils\/macroexpander.h>\n\n#include \"CppcheckRunner.h\"\n#include \"Constants.h\"\n#include \"Settings.h\"\n\nusing namespace QtcCppcheck::Internal;\n\nnamespace {\n enum ErrorField {\n ErrorFieldFile = 0, ErrorFieldLine, ErrorFieldSeverity, ErrorFieldId,\n ErrorFieldMessage\n };\n}\n\nCppcheckRunner::CppcheckRunner (Settings *settings, QObject *parent) :\n QObject (parent), settings_ (settings), showOutput_ (false), showId_ (false), futureInterface_ (NULL),\n maxArgumentsLength_ (0) {\n#ifdef __linux__\n QProcess getConf;\n getConf.start (QLatin1String (\"getconf ARG_MAX\"));\n getConf.waitForFinished (2000);\n QByteArray argMax = getConf.readAllStandardOutput ().replace (\"\\n\", \"\");\n maxArgumentsLength_ = std::max (argMax.toInt (), 32000);\n#else\n maxArgumentsLength_ = 32767;\n#endif\n Q_ASSERT (settings_ != NULL);\n\n connect (&process_, SIGNAL (readyReadStandardOutput ()),\n SLOT (readOutput ()));\n connect (&process_, SIGNAL (readyReadStandardError ()),\n SLOT (readError ()));\n connect (&process_, SIGNAL (started ()),\n SLOT (started ()));\n connect (&process_, SIGNAL (error (QProcess::ProcessError)),\n SLOT (error (QProcess::ProcessError)));\n connect (&process_, SIGNAL (finished (int,QProcess::ExitStatus)),\n SLOT (finished (int,QProcess::ExitStatus)));\n\n \/\/ Restart checking if got queue.\n connect (&process_, SIGNAL (finished (int,QProcess::ExitStatus)),\n SLOT (checkQueuedFiles ()));\n}\n\nCppcheckRunner::~CppcheckRunner () {\n if (process_.isOpen ()) {\n process_.kill ();\n }\n queueTimer_.stop ();\n settings_ = NULL;\n delete futureInterface_;\n}\n\nvoid CppcheckRunner::updateSettings () {\n Q_ASSERT (settings_ != NULL);\n showOutput_ = settings_->showBinaryOutput ();\n showId_ = settings_->showId ();\n runArguments_.clear ();\n QString enabled = QLatin1String (\"--enable=warning,style,performance,\"\n \"portability,information,missingInclude\");\n \/\/ Overwrite enable with user parameters if present\n for (int i = runArguments_.size () - 1; i >= 0; --i) {\n if (runArguments_.at (i).startsWith (QLatin1String (\"--enable\"))) {\n enabled = runArguments_.takeAt (i);\n break;\n }\n }\n if (settings_->checkUnused ()) {\n enabled += QLatin1String (\",unusedFunction\");\n }\n else{ \/\/TODO always check with threads but rescan for unused after finish?\n runArguments_ << (QLatin1String (\"-j \") +\n QString::number (QThread::idealThreadCount ()));\n }\n runArguments_ << enabled;\n if (settings_->checkInconclusive ()) {\n runArguments_ << QLatin1String (\"--inconclusive\");\n }\n runArguments_ << QLatin1String (\"--template={file},{line},{severity},{id},{message}\");\n}\n\nvoid CppcheckRunner::setIncludePaths (const QStringList &paths) {\n includePaths_.clear ();\n includePaths_.reserve (paths.size ());\n for (const auto &i: paths) {\n includePaths_.append (QLatin1String (\"-I\") + i);\n }\n}\n\nvoid CppcheckRunner::checkFiles (const QStringList &fileNames) {\n Q_ASSERT (!fileNames.isEmpty ());\n fileCheckQueue_ += fileNames;\n fileCheckQueue_.removeDuplicates ();\n fileCheckQueue_.sort ();\n if (process_.isOpen ()) {\n if (fileCheckQueue_ == currentlyCheckingFiles_) {\n process_.kill ();\n \/\/ Rechecking will be restarted on finish signal.\n }\n return;\n }\n \/\/ Delay helps to avoid double checking same file on editor change.\n const int checkDelayInMs = 200;\n if (!queueTimer_.isActive ()) {\n queueTimer_.singleShot (checkDelayInMs, this, SLOT (checkQueuedFiles ()));\n }\n}\n\nvoid CppcheckRunner::stopChecking () {\n fileCheckQueue_.clear ();\n if (process_.isOpen ()) {\n process_.kill ();\n }\n}\n\nvoid CppcheckRunner::checkQueuedFiles () {\n if (fileCheckQueue_.isEmpty ()) {\n return;\n }\n QString binary = settings_->binaryFile ();\n if (binary.isEmpty ()) {\n return;\n }\n \/\/ Pass custom params BEFORE most of runner's to shadow if some repeat.\n auto expander = Utils::globalMacroExpander ();\n auto expanded = expander->expand (settings_->customParameters ());\n QStringList arguments (expanded.split (QLatin1Char (' '), QString::SkipEmptyParts));\n arguments += runArguments_;\n\n auto includes = !settings_->ignoreIncludePaths () ? includePaths_ : QStringList {};\n currentlyCheckingFiles_ = fileCheckQueue_;\n fileCheckQueue_.clear ();\n\n int argumentLength = arguments.join (QLatin1Literal (\" \")).length ();\n int filesLength = currentlyCheckingFiles_.join (QLatin1Literal (\" \")).length ();\n int includesLength = includes.join (QLatin1Literal (\" \")).length ();\n if (argumentLength + includesLength + filesLength >= maxArgumentsLength_) {\n if (fileListFileContents_ != currentlyCheckingFiles_) {\n fileListFileContents_ = currentlyCheckingFiles_;\n fileListFile_.resize (0);\n includeListFile_.resize (0);\n\n if (fileListFile_.open () && includeListFile_.open ()) {\n QByteArray filesArg = fileListFileContents_.join (QLatin1String (\"\\n\")).toLocal8Bit ();\n fileListFile_.write (filesArg);\n fileListFile_.close ();\n\n for (auto &i: includes) {\n i = i.mid (2);\n }\n QByteArray includesArg = includes.join (QLatin1String (\"\\n\")).toLocal8Bit ();\n includeListFile_.write (includesArg);\n includeListFile_.close ();\n }\n else{\n Core::MessageManager::write (tr (\"Failed to write cppcheck's argument files\"),\n Core::MessageManager::Silent);\n return;\n }\n }\n arguments << QString (QLatin1String (\"--file-list=%1\")).arg (fileListFile_.fileName ());\n arguments << QString (QLatin1String (\"--includes-file=%1\")).arg (includeListFile_.fileName ());\n }\n else{\n arguments += currentlyCheckingFiles_;\n arguments += includes;\n }\n emit startedChecking (currentlyCheckingFiles_);\n if (showOutput_) {\n Core::MessageManager::write (QString (\"Starting CppChecker with:%1, %2\")\n .arg (binary,arguments.join (\" \")), Core::MessageManager::WithFocus);\n }\n process_.start (binary, arguments);\n}\n\nvoid CppcheckRunner::readOutput () {\n if (!showOutput_) {\n return;\n }\n process_.setReadChannel (QProcess::StandardOutput);\n\n while (!process_.atEnd ()) {\n QByteArray rawLine = process_.readLine ();\n QString line = QString::fromUtf8 (rawLine).trimmed ();\n if (line.isEmpty ()) {\n continue;\n }\n const QString progressSample = QLatin1String (\"% done\");\n \/\/ check futureInterface because read can be triggered before started..\n if (line.endsWith (progressSample) && futureInterface_ != NULL) {\n int percentEndIndex = line.length () - progressSample.length ();\n int percentStartIndex = line.lastIndexOf (QLatin1String (\" \"), percentEndIndex);\n int done = line.mid (percentStartIndex, percentEndIndex - percentStartIndex).toInt ();\n futureInterface_->setProgressValue (done);\n }\n Core::MessageManager::write (line, Core::MessageManager::Silent);\n }\n}\n\nvoid CppcheckRunner::readError () {\n process_.setReadChannel (QProcess::StandardError);\n\n while (!process_.atEnd ()) {\n QByteArray rawLine = process_.readLine ();\n QString line = QString::fromUtf8 (rawLine).trimmed ();\n if (line.isEmpty ()) {\n continue;\n }\n if (showOutput_) {\n Core::MessageManager::write (line, Core::MessageManager::Silent);\n }\n QStringList details = line.split (QLatin1Char (','));\n if (details.size () <= ErrorFieldMessage) {\n continue;\n }\n QString file = QDir::fromNativeSeparators (details.at (ErrorFieldFile));\n int lineNumber = details.at (ErrorFieldLine).toInt ();\n char type = details.at (ErrorFieldSeverity).at (0).toLatin1 ();\n QString id = \"\";\n if (showId_) {\n id = details.at (ErrorFieldId);\n }\n QString description = line.mid (line.indexOf (details.at (ErrorFieldMessage)));\n emit newTask (type, id, description, file, lineNumber);\n }\n}\n\nvoid CppcheckRunner::started () {\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck started\"), Core::MessageManager::Silent);\n }\n\n using namespace Core;\n delete futureInterface_;\n futureInterface_ = new QFutureInterface<void>;\n FutureProgress *progress = ProgressManager::addTask (futureInterface_->future (),\n tr (\"Cppcheck\"), Constants::TASK_CHECKING);\n connect (progress, SIGNAL (canceled ()), SLOT (stopChecking ()));\n futureInterface_->setProgressRange (0, 100); \/\/ %\n futureInterface_->reportStarted ();\n}\n\nvoid CppcheckRunner::error (QProcess::ProcessError error) {\n Q_UNUSED (error);\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck error occured\"), Core::MessageManager::Silent);\n }\n if (error == QProcess::FailedToStart) {\n finished (-1, QProcess::CrashExit);\n }\n}\n\nvoid CppcheckRunner::finished (int exitCode, QProcess::ExitStatus exitStatus) {\n Q_UNUSED (exitCode);\n Q_UNUSED (exitStatus);\n if (futureInterface_ != NULL) {\n futureInterface_->reportFinished ();\n }\n process_.close ();\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck finished\"), Core::MessageManager::Silent);\n }\n}\n<commit_msg>Fixed partial line reads.<commit_after>#include <QDebug>\n#include <QSettings>\n#include <QFileInfo>\n#include <QDir>\n#include <QThread>\n\n#include <coreplugin\/messagemanager.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <coreplugin\/progressmanager\/futureprogress.h>\n#include <utils\/macroexpander.h>\n\n#include \"CppcheckRunner.h\"\n#include \"Constants.h\"\n#include \"Settings.h\"\n\nusing namespace QtcCppcheck::Internal;\n\nnamespace {\n enum ErrorField {\n ErrorFieldFile = 0, ErrorFieldLine, ErrorFieldSeverity, ErrorFieldId,\n ErrorFieldMessage\n };\n}\n\nCppcheckRunner::CppcheckRunner (Settings *settings, QObject *parent) :\n QObject (parent), settings_ (settings), showOutput_ (false), showId_ (false), futureInterface_ (NULL),\n maxArgumentsLength_ (0) {\n#ifdef __linux__\n QProcess getConf;\n getConf.start (QLatin1String (\"getconf ARG_MAX\"));\n getConf.waitForFinished (2000);\n QByteArray argMax = getConf.readAllStandardOutput ().replace (\"\\n\", \"\");\n maxArgumentsLength_ = std::max (argMax.toInt (), 32000);\n#else\n maxArgumentsLength_ = 32767;\n#endif\n Q_ASSERT (settings_ != NULL);\n\n connect (&process_, SIGNAL (readyReadStandardOutput ()),\n SLOT (readOutput ()));\n connect (&process_, SIGNAL (readyReadStandardError ()),\n SLOT (readError ()));\n connect (&process_, SIGNAL (started ()),\n SLOT (started ()));\n connect (&process_, SIGNAL (error (QProcess::ProcessError)),\n SLOT (error (QProcess::ProcessError)));\n connect (&process_, SIGNAL (finished (int,QProcess::ExitStatus)),\n SLOT (finished (int,QProcess::ExitStatus)));\n\n \/\/ Restart checking if got queue.\n connect (&process_, SIGNAL (finished (int,QProcess::ExitStatus)),\n SLOT (checkQueuedFiles ()));\n}\n\nCppcheckRunner::~CppcheckRunner () {\n if (process_.isOpen ()) {\n process_.kill ();\n }\n queueTimer_.stop ();\n settings_ = NULL;\n delete futureInterface_;\n}\n\nvoid CppcheckRunner::updateSettings () {\n Q_ASSERT (settings_ != NULL);\n showOutput_ = settings_->showBinaryOutput ();\n showId_ = settings_->showId ();\n runArguments_.clear ();\n QString enabled = QLatin1String (\"--enable=warning,style,performance,\"\n \"portability,information,missingInclude\");\n \/\/ Overwrite enable with user parameters if present\n for (int i = runArguments_.size () - 1; i >= 0; --i) {\n if (runArguments_.at (i).startsWith (QLatin1String (\"--enable\"))) {\n enabled = runArguments_.takeAt (i);\n break;\n }\n }\n if (settings_->checkUnused ()) {\n enabled += QLatin1String (\",unusedFunction\");\n }\n else{ \/\/TODO always check with threads but rescan for unused after finish?\n runArguments_ << (QLatin1String (\"-j \") +\n QString::number (QThread::idealThreadCount ()));\n }\n runArguments_ << enabled;\n if (settings_->checkInconclusive ()) {\n runArguments_ << QLatin1String (\"--inconclusive\");\n }\n runArguments_ << QLatin1String (\"--template={file},{line},{severity},{id},{message}\");\n}\n\nvoid CppcheckRunner::setIncludePaths (const QStringList &paths) {\n includePaths_.clear ();\n includePaths_.reserve (paths.size ());\n for (const auto &i: paths) {\n includePaths_.append (QLatin1String (\"-I\") + i);\n }\n}\n\nvoid CppcheckRunner::checkFiles (const QStringList &fileNames) {\n Q_ASSERT (!fileNames.isEmpty ());\n fileCheckQueue_ += fileNames;\n fileCheckQueue_.removeDuplicates ();\n fileCheckQueue_.sort ();\n if (process_.isOpen ()) {\n if (fileCheckQueue_ == currentlyCheckingFiles_) {\n process_.kill ();\n \/\/ Rechecking will be restarted on finish signal.\n }\n return;\n }\n \/\/ Delay helps to avoid double checking same file on editor change.\n const int checkDelayInMs = 200;\n if (!queueTimer_.isActive ()) {\n queueTimer_.singleShot (checkDelayInMs, this, SLOT (checkQueuedFiles ()));\n }\n}\n\nvoid CppcheckRunner::stopChecking () {\n fileCheckQueue_.clear ();\n if (process_.isOpen ()) {\n process_.kill ();\n }\n}\n\nvoid CppcheckRunner::checkQueuedFiles () {\n if (fileCheckQueue_.isEmpty ()) {\n return;\n }\n QString binary = settings_->binaryFile ();\n if (binary.isEmpty ()) {\n return;\n }\n \/\/ Pass custom params BEFORE most of runner's to shadow if some repeat.\n auto expander = Utils::globalMacroExpander ();\n auto expanded = expander->expand (settings_->customParameters ());\n QStringList arguments (expanded.split (QLatin1Char (' '), QString::SkipEmptyParts));\n arguments += runArguments_;\n\n auto includes = !settings_->ignoreIncludePaths () ? includePaths_ : QStringList {};\n currentlyCheckingFiles_ = fileCheckQueue_;\n fileCheckQueue_.clear ();\n\n int argumentLength = arguments.join (QLatin1Literal (\" \")).length ();\n int filesLength = currentlyCheckingFiles_.join (QLatin1Literal (\" \")).length ();\n int includesLength = includes.join (QLatin1Literal (\" \")).length ();\n if (argumentLength + includesLength + filesLength >= maxArgumentsLength_) {\n if (fileListFileContents_ != currentlyCheckingFiles_) {\n fileListFileContents_ = currentlyCheckingFiles_;\n fileListFile_.resize (0);\n includeListFile_.resize (0);\n\n if (fileListFile_.open () && includeListFile_.open ()) {\n QByteArray filesArg = fileListFileContents_.join (QLatin1String (\"\\n\")).toLocal8Bit ();\n fileListFile_.write (filesArg);\n fileListFile_.close ();\n\n for (auto &i: includes) {\n i = i.mid (2);\n }\n QByteArray includesArg = includes.join (QLatin1String (\"\\n\")).toLocal8Bit ();\n includeListFile_.write (includesArg);\n includeListFile_.close ();\n }\n else{\n Core::MessageManager::write (tr (\"Failed to write cppcheck's argument files\"),\n Core::MessageManager::Silent);\n return;\n }\n }\n arguments << QString (QLatin1String (\"--file-list=%1\")).arg (fileListFile_.fileName ());\n arguments << QString (QLatin1String (\"--includes-file=%1\")).arg (includeListFile_.fileName ());\n }\n else{\n arguments += currentlyCheckingFiles_;\n arguments += includes;\n }\n emit startedChecking (currentlyCheckingFiles_);\n if (showOutput_) {\n Core::MessageManager::write (QString (\"Starting CppChecker with:%1, %2\")\n .arg (binary,arguments.join (\" \")), Core::MessageManager::WithFocus);\n }\n process_.start (binary, arguments);\n}\n\nvoid CppcheckRunner::readOutput () {\n if (!showOutput_) {\n return;\n }\n process_.setReadChannel (QProcess::StandardOutput);\n\n while (!process_.atEnd () && process_.canReadLine ()) {\n QByteArray rawLine = process_.readLine ();\n QString line = QString::fromUtf8 (rawLine).trimmed ();\n if (line.isEmpty ()) {\n continue;\n }\n const QString progressSample = QLatin1String (\"% done\");\n \/\/ check futureInterface because read can be triggered before started..\n if (line.endsWith (progressSample) && futureInterface_ != NULL) {\n int percentEndIndex = line.length () - progressSample.length ();\n int percentStartIndex = line.lastIndexOf (QLatin1String (\" \"), percentEndIndex);\n int done = line.mid (percentStartIndex, percentEndIndex - percentStartIndex).toInt ();\n futureInterface_->setProgressValue (done);\n }\n Core::MessageManager::write (line, Core::MessageManager::Silent);\n }\n}\n\nvoid CppcheckRunner::readError () {\n process_.setReadChannel (QProcess::StandardError);\n\n while (!process_.atEnd () && process_.canReadLine ()) {\n QByteArray rawLine = process_.readLine ();\n QString line = QString::fromUtf8 (rawLine).trimmed ();\n if (line.isEmpty ()) {\n continue;\n }\n if (showOutput_) {\n Core::MessageManager::write (line, Core::MessageManager::Silent);\n }\n QStringList details = line.split (QLatin1Char (','));\n if (details.size () <= ErrorFieldMessage) {\n continue;\n }\n QString file = QDir::fromNativeSeparators (details.at (ErrorFieldFile));\n int lineNumber = details.at (ErrorFieldLine).toInt ();\n char type = details.at (ErrorFieldSeverity).at (0).toLatin1 ();\n QString id = \"\";\n if (showId_) {\n id = details.at (ErrorFieldId);\n }\n QString description = line.mid (line.indexOf (details.at (ErrorFieldMessage)));\n emit newTask (type, id, description, file, lineNumber);\n }\n}\n\nvoid CppcheckRunner::started () {\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck started\"), Core::MessageManager::Silent);\n }\n\n using namespace Core;\n delete futureInterface_;\n futureInterface_ = new QFutureInterface<void>;\n FutureProgress *progress = ProgressManager::addTask (futureInterface_->future (),\n tr (\"Cppcheck\"), Constants::TASK_CHECKING);\n connect (progress, SIGNAL (canceled ()), SLOT (stopChecking ()));\n futureInterface_->setProgressRange (0, 100); \/\/ %\n futureInterface_->reportStarted ();\n}\n\nvoid CppcheckRunner::error (QProcess::ProcessError error) {\n Q_UNUSED (error);\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck error occured\"), Core::MessageManager::Silent);\n }\n if (error == QProcess::FailedToStart) {\n finished (-1, QProcess::CrashExit);\n }\n}\n\nvoid CppcheckRunner::finished (int exitCode, QProcess::ExitStatus exitStatus) {\n Q_UNUSED (exitCode);\n Q_UNUSED (exitStatus);\n if (futureInterface_ != NULL) {\n futureInterface_->reportFinished ();\n }\n process_.close ();\n if (showOutput_) {\n Core::MessageManager::write (tr (\"Cppcheck finished\"), Core::MessageManager::Silent);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: CurrentMasterPagesSelector.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: ihi $ $Date: 2006-08-01 09:22:20 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_TOOLPANEL_CONTROLS_CURRENT_MASTER_PAGES_SELECTOR_HXX\n#define SD_TOOLPANEL_CONTROLS_CURRENT_MASTER_PAGES_SELECTOR_HXX\n\n#include \"MasterPagesSelector.hxx\"\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n\nnamespace sd { namespace tools { class EventMultiplexerEvent; } }\n\n\nnamespace sd { namespace toolpanel { namespace controls {\n\n\n\/** Show the master pages currently used by a SdDrawDocument.\n*\/\nclass CurrentMasterPagesSelector\n : public MasterPagesSelector\n{\npublic:\n CurrentMasterPagesSelector (\n TreeNode* pParent,\n SdDrawDocument& rDocument,\n ViewShellBase& rBase,\n const ::boost::shared_ptr<MasterPageContainer>& rpContainer);\n virtual ~CurrentMasterPagesSelector (void);\n\n virtual void LateInit (void);\n\n \/** Set the selection so that the master page is selected that is\n used by the currently selected page of the document in the\n center pane.\n *\/\n virtual void UpdateSelection (void);\n\n \/** Copy all master pages that are to be shown into the given list.\n *\/\n virtual void Fill (ItemList& rItemList);\n\nprotected:\n \/** Return the master page whose preview is currently selected in the\n value set control.\n @return\n The returned page belongs to the main document, not to the local\n document of the MasterPageContainer.\n *\/\n virtual SdPage* GetSelectedMasterPage (void);\n\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent>\n mxListener;\n\n DECL_LINK(EventMultiplexerListener,sd::tools::EventMultiplexerEvent*);\n};\n\n} } } \/\/ end of namespace ::sd::toolpanel::controls\n\n#endif\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.6.76); FILE MERGED 2006\/11\/27 13:48:13 cl 1.6.76.1: #i69285# warning free code changes for sd project<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: CurrentMasterPagesSelector.hxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: kz $ $Date: 2006-12-12 18:46:56 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_TOOLPANEL_CONTROLS_CURRENT_MASTER_PAGES_SELECTOR_HXX\n#define SD_TOOLPANEL_CONTROLS_CURRENT_MASTER_PAGES_SELECTOR_HXX\n\n#include \"MasterPagesSelector.hxx\"\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n\nnamespace sd { namespace tools { class EventMultiplexerEvent; } }\n\n\nnamespace sd { namespace toolpanel { namespace controls {\n\n\n\/** Show the master pages currently used by a SdDrawDocument.\n*\/\nclass CurrentMasterPagesSelector\n : public MasterPagesSelector\n{\npublic:\n CurrentMasterPagesSelector (\n TreeNode* pParent,\n SdDrawDocument& rDocument,\n ViewShellBase& rBase,\n const ::boost::shared_ptr<MasterPageContainer>& rpContainer);\n virtual ~CurrentMasterPagesSelector (void);\n\n virtual void LateInit (void);\n\n \/** Set the selection so that the master page is selected that is\n used by the currently selected page of the document in the\n center pane.\n *\/\n virtual void UpdateSelection (void);\n\n \/** Copy all master pages that are to be shown into the given list.\n *\/\n virtual void Fill (ItemList& rItemList);\n\n using sd::toolpanel::controls::MasterPagesSelector::Fill;\n\nprotected:\n \/** Return the master page whose preview is currently selected in the\n value set control.\n @return\n The returned page belongs to the main document, not to the local\n document of the MasterPageContainer.\n *\/\n virtual SdPage* GetSelectedMasterPage (void);\n\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XComponent>\n mxListener;\n\n DECL_LINK(EventMultiplexerListener,sd::tools::EventMultiplexerEvent*);\n};\n\n} } } \/\/ end of namespace ::sd::toolpanel::controls\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/\/\/ Copyright(c) 2020 Intel Corporation. All Rights Reserved.\n\n#include \"depth-to-rgb-calibration.h\"\n#include <librealsense2\/rs.hpp>\n#include \"core\/streaming.h\"\n#include \"context.h\"\n#include <direct.h>\n\n#define AC_LOG_PREFIX \"AC1: \"\n#define AC_LOG(TYPE,MSG) LOG_##TYPE( AC_LOG_PREFIX << MSG )\n\/\/#define AC_LOG(TYPE,MSG) LOG_ERROR( AC_LOG_PREFIX << MSG )\n\/\/#define AC_LOG(TYPE,MSG) std::cout << (std::string)( to_string() << \"-\" << #TYPE [0] << \"- \" << MSG ) << std::endl\n\n\nusing namespace librealsense;\nnamespace impl = librealsense::algo::depth_to_rgb_calibration;\n\ndepth_to_rgb_calibration::depth_to_rgb_calibration(\n rs2::frame depth,\n rs2::frame ir,\n rs2::frame yuy,\n rs2::frame prev_yuy\n)\n : _intr( yuy.get_profile().as< rs2::video_stream_profile >().get_intrinsics() )\n , _extr( depth.get_profile().get_extrinsics_to( yuy.get_profile()))\n , _depth_units(depth.as< rs2::depth_frame >().get_units())\n , _from( depth.get_profile().get()->profile )\n , _to( yuy.get_profile().get()->profile )\n{\n debug_calibration( \"old\" );\n\n AC_LOG( DEBUG, \"... setting yuy data\" );\n auto color_profile = yuy.get_profile().as< rs2::video_stream_profile >();\n auto yuy_data = (impl::yuy_t const *) yuy.get_data();\n auto prev_yuy_data = (impl::yuy_t const *) prev_yuy.get_data();\n impl::calib calibration( _intr, _extr );\n _algo.set_yuy_data(\n std::vector< impl::yuy_t >( yuy_data, yuy_data + yuy.get_data_size() \/ sizeof( impl::yuy_t )),\n std::vector< impl::yuy_t >( prev_yuy_data, prev_yuy_data + yuy.get_data_size() \/ sizeof( impl::yuy_t ) ),\n calibration\n );\n\n AC_LOG( DEBUG, \"... setting ir data\" );\n auto ir_profile = ir.get_profile().as< rs2::video_stream_profile >();\n auto ir_data = (impl::ir_t const *) ir.get_data();\n _algo.set_ir_data(\n std::vector< impl::ir_t >( ir_data, ir_data + ir.get_data_size() \/ sizeof( impl::ir_t )),\n ir_profile.width(), ir_profile.height()\n );\n\n AC_LOG( DEBUG, \"... setting z data\" );\n auto z_profile = depth.get_profile().as< rs2::video_stream_profile >();\n auto z_data = (impl::z_t const *) depth.get_data();\n _algo.set_z_data(\n std::vector< impl::z_t >( z_data, z_data + depth.get_data_size() \/ sizeof( impl::z_t ) ),\n z_profile.get_intrinsics(),\n depth.as< rs2::depth_frame >().get_units()\n );\n\n std::string dir = \"C:\\\\work\\\\autocal\\\\data\\\\\";\n dir += to_string() << depth.get_frame_number();\n if( _mkdir( dir.c_str() ) == 0 )\n _algo.write_data_to( dir );\n else\n AC_LOG( WARNING, \"Failed to write AC frame data to: \" << dir );\n}\n\n\nrs2_calibration_status depth_to_rgb_calibration::optimize()\n{\n try\n {\n AC_LOG( DEBUG, \"... checking scene validity\" );\n if( !_algo.is_scene_valid() )\n {\n AC_LOG( ERROR, \"Calibration scene was found invalid!\" );\n \/\/return RS2_CALIBRATION_SCENE_INVALID;\n }\n\n AC_LOG( DEBUG, \"... optimizing\" );\n auto n_iterations = _algo.optimize();\n if( !n_iterations )\n {\n \/\/AC_LOG( INFO, \"Calibration not necessary; nothing done\" );\n return RS2_CALIBRATION_NOT_NEEDED;\n }\n\n AC_LOG( DEBUG, \"... checking result validity\" );\n if( !_algo.is_valid_results() )\n ; \/\/ return RS2_CALIBRATION_BAD_RESULT;\n\n \/\/AC_LOG( INFO, \"Calibration finished; original cost= \" << original_cost << \" optimized cost= \" << params_curr.cost );\n\n _intr = _algo.get_calibration().get_intrinsics();\n _extr = _algo.get_calibration().get_extrinsics();\n debug_calibration( \"new\" );\n\n return RS2_CALIBRATION_SUCCESSFUL;\n }\n catch( std::exception const & e )\n {\n AC_LOG( ERROR, \"Calibration failed: \" << e.what() );\n return RS2_CALIBRATION_FAILED;\n }\n}\n\n\nvoid depth_to_rgb_calibration::debug_calibration( char const * prefix )\n{\n AC_LOG( DEBUG, prefix << \" intr\"\n << \": width: \" << _intr.width\n << \", height: \" << _intr.height\n << \", ppx: \" << _intr.ppx\n << \", ppy: \" << _intr.ppy\n << \", fx: \" << _intr.fx\n << \", fy: \" << _intr.fy\n << \", model: \" << int( _intr.model)\n << \", coeffs: [\"\n << _intr.coeffs[0] << \", \" << _intr.coeffs[1] << \", \" << _intr.coeffs[2] << \", \" << _intr.coeffs[3] << \", \" << _intr.coeffs[4]\n << \"]\" );\n AC_LOG( DEBUG, prefix << \" extr:\"\n << \" rotation: [\"\n << _extr.rotation[0] << \", \" << _extr.rotation[1] << \", \" << _extr.rotation[2] << \", \" << _extr.rotation[3] << \", \" << _extr.rotation[4] << \", \"\n << _extr.rotation[5] << \", \" << _extr.rotation[6] << \", \" << _extr.rotation[7] << \", \" << _extr.rotation[8]\n << \"] translation: [\"\n << _extr.translation[0] << \", \" << _extr.translation[1] << \", \" << _extr.translation[2]\n << \"]\" );\n}\n\n<commit_msg>nope... try with sys\/stat.h...<commit_after>\/\/\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/\/\/ Copyright(c) 2020 Intel Corporation. All Rights Reserved.\n\n#include \"depth-to-rgb-calibration.h\"\n#include <librealsense2\/rs.hpp>\n#include \"core\/streaming.h\"\n#include \"context.h\"\n#include <sys\/stat.h> \/\/ mkdir\n\n#define AC_LOG_PREFIX \"AC1: \"\n#define AC_LOG(TYPE,MSG) LOG_##TYPE( AC_LOG_PREFIX << MSG )\n\/\/#define AC_LOG(TYPE,MSG) LOG_ERROR( AC_LOG_PREFIX << MSG )\n\/\/#define AC_LOG(TYPE,MSG) std::cout << (std::string)( to_string() << \"-\" << #TYPE [0] << \"- \" << MSG ) << std::endl\n\n\nusing namespace librealsense;\nnamespace impl = librealsense::algo::depth_to_rgb_calibration;\n\ndepth_to_rgb_calibration::depth_to_rgb_calibration(\n rs2::frame depth,\n rs2::frame ir,\n rs2::frame yuy,\n rs2::frame prev_yuy\n)\n : _intr( yuy.get_profile().as< rs2::video_stream_profile >().get_intrinsics() )\n , _extr( depth.get_profile().get_extrinsics_to( yuy.get_profile()))\n , _depth_units(depth.as< rs2::depth_frame >().get_units())\n , _from( depth.get_profile().get()->profile )\n , _to( yuy.get_profile().get()->profile )\n{\n debug_calibration( \"old\" );\n\n AC_LOG( DEBUG, \"... setting yuy data\" );\n auto color_profile = yuy.get_profile().as< rs2::video_stream_profile >();\n auto yuy_data = (impl::yuy_t const *) yuy.get_data();\n auto prev_yuy_data = (impl::yuy_t const *) prev_yuy.get_data();\n impl::calib calibration( _intr, _extr );\n _algo.set_yuy_data(\n std::vector< impl::yuy_t >( yuy_data, yuy_data + yuy.get_data_size() \/ sizeof( impl::yuy_t )),\n std::vector< impl::yuy_t >( prev_yuy_data, prev_yuy_data + yuy.get_data_size() \/ sizeof( impl::yuy_t ) ),\n calibration\n );\n\n AC_LOG( DEBUG, \"... setting ir data\" );\n auto ir_profile = ir.get_profile().as< rs2::video_stream_profile >();\n auto ir_data = (impl::ir_t const *) ir.get_data();\n _algo.set_ir_data(\n std::vector< impl::ir_t >( ir_data, ir_data + ir.get_data_size() \/ sizeof( impl::ir_t )),\n ir_profile.width(), ir_profile.height()\n );\n\n AC_LOG( DEBUG, \"... setting z data\" );\n auto z_profile = depth.get_profile().as< rs2::video_stream_profile >();\n auto z_data = (impl::z_t const *) depth.get_data();\n _algo.set_z_data(\n std::vector< impl::z_t >( z_data, z_data + depth.get_data_size() \/ sizeof( impl::z_t ) ),\n z_profile.get_intrinsics(),\n depth.as< rs2::depth_frame >().get_units()\n );\n\n std::string dir = \"C:\\\\work\\\\autocal\\\\data\\\\\";\n dir += to_string() << depth.get_frame_number();\n if( mkdir( dir.c_str() ) == 0 )\n _algo.write_data_to( dir );\n else\n AC_LOG( WARNING, \"Failed to write AC frame data to: \" << dir );\n}\n\n\nrs2_calibration_status depth_to_rgb_calibration::optimize()\n{\n try\n {\n AC_LOG( DEBUG, \"... checking scene validity\" );\n if( !_algo.is_scene_valid() )\n {\n AC_LOG( ERROR, \"Calibration scene was found invalid!\" );\n \/\/return RS2_CALIBRATION_SCENE_INVALID;\n }\n\n AC_LOG( DEBUG, \"... optimizing\" );\n auto n_iterations = _algo.optimize();\n if( !n_iterations )\n {\n \/\/AC_LOG( INFO, \"Calibration not necessary; nothing done\" );\n return RS2_CALIBRATION_NOT_NEEDED;\n }\n\n AC_LOG( DEBUG, \"... checking result validity\" );\n if( !_algo.is_valid_results() )\n ; \/\/ return RS2_CALIBRATION_BAD_RESULT;\n\n \/\/AC_LOG( INFO, \"Calibration finished; original cost= \" << original_cost << \" optimized cost= \" << params_curr.cost );\n\n _intr = _algo.get_calibration().get_intrinsics();\n _extr = _algo.get_calibration().get_extrinsics();\n debug_calibration( \"new\" );\n\n return RS2_CALIBRATION_SUCCESSFUL;\n }\n catch( std::exception const & e )\n {\n AC_LOG( ERROR, \"Calibration failed: \" << e.what() );\n return RS2_CALIBRATION_FAILED;\n }\n}\n\n\nvoid depth_to_rgb_calibration::debug_calibration( char const * prefix )\n{\n AC_LOG( DEBUG, prefix << \" intr\"\n << \": width: \" << _intr.width\n << \", height: \" << _intr.height\n << \", ppx: \" << _intr.ppx\n << \", ppy: \" << _intr.ppy\n << \", fx: \" << _intr.fx\n << \", fy: \" << _intr.fy\n << \", model: \" << int( _intr.model)\n << \", coeffs: [\"\n << _intr.coeffs[0] << \", \" << _intr.coeffs[1] << \", \" << _intr.coeffs[2] << \", \" << _intr.coeffs[3] << \", \" << _intr.coeffs[4]\n << \"]\" );\n AC_LOG( DEBUG, prefix << \" extr:\"\n << \" rotation: [\"\n << _extr.rotation[0] << \", \" << _extr.rotation[1] << \", \" << _extr.rotation[2] << \", \" << _extr.rotation[3] << \", \" << _extr.rotation[4] << \", \"\n << _extr.rotation[5] << \", \" << _extr.rotation[6] << \", \" << _extr.rotation[7] << \", \" << _extr.rotation[8]\n << \"] translation: [\"\n << _extr.translation[0] << \", \" << _extr.translation[1] << \", \" << _extr.translation[2]\n << \"]\" );\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"devicedetectionprocessor.h\"\n#include \"config\/configuration.h\"\n#include \"events\/events.h\"\n#include \"sysex\/devicedetectionquery.h\"\n#include \"sysex\/midi.h\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QSettings>\n#include <iomanip>\n#include <unistd.h>\n\nDeviceDetectionProcessor::DeviceDetectionProcessor(QWidget *gui) : gui(gui) {\n\tstd::cout << \"create DeviceDetectionProcessor\" << std::endl;\n}\n\nDeviceDetectionProcessor::~DeviceDetectionProcessor() {\n if (Configuration::getInstance().getUsbDeviceDetection())\n libusb_exit(NULL);\n if (Configuration::getInstance().getMidiDeviceDetection()) {\n midiin = NULL;\n midiout = NULL;\n }\n}\n\nint DeviceDetectionProcessor::getMidiInPortCount() {\n if (midiin)\n return midiin->getPortCount();\n return 0;\n}\n\nint DeviceDetectionProcessor::getMddiOutPortCount() {\n if (midiout)\n return midiout->getPortCount();\n return 0;\n}\n\n\/* MIDI-methods *\/\n\nvoid DeviceDetectionProcessor::startDeviceDetection() {\n if (Configuration::getInstance().getMidiDeviceDetection()) {\n setupMidiPorts();\n detectDevices();\n }\n if (Configuration::getInstance().getUsbDeviceDetection()) {\n setupUSB();\n }\n}\n\nbool DeviceDetectionProcessor::isIconnectivityDevice(\n std::vector<unsigned char> *message) {\n int nMessageSize = message->size();\n return ((nMessageSize >= 16) && (message->at(0) == SYSEX_START) &&\n (message->at(1) == Device::MANUFACTURER_SYSEX_ID[0]) &&\n (message->at(2) == Device::MANUFACTURER_SYSEX_ID[1]) &&\n (message->at(3) == Device::MANUFACTURER_SYSEX_ID[2]) &&\n (message->at(15) == 0x02));\n}\n\nvoid DeviceDetectionProcessor::setupMidiPorts() {\n createMidiIn();\n createMidiOut();\n}\n\nvoid DeviceDetectionProcessor::sendProgressEvent(int progress) {\n ProgressEvent *e = new ProgressEvent();\n e->setValue(progress);\n QApplication::sendEvent(gui, e);\n}\n\nint DeviceDetectionProcessor::detectDevices() {\n\n int defaultDeviceSerialNumber =\n Configuration::getInstance().getDefaultDevice();\n int nOutPortCount = midiout->getPortCount();\n int nInPortCount = midiin->getPortCount();\n#ifdef __MIO_DEBUG__\n std::cout << \"Out ports: \" << std::dec << nOutPortCount\n << \", in ports: \" << nInPortCount\n << \" - combinations to probe: \" << nOutPortCount * nInPortCount\n << std::endl;\n#endif \/\/__MIO_DEBUG__\n DeviceDetectionQuery *q = new DeviceDetectionQuery();\n long serialNumber;\n BYTE_VECTOR *qMessage = q->getMIDISysExMessage();\n std::map<long, Device *> *devices = Configuration::getInstance().getDevices();\n \/\/ for each output signal\n for (int i = 0; i < nOutPortCount; i++) {\n midiout->openPort(i);\n \/\/ and each input signal\n for (int j = 0; j < nInPortCount; j++) {\n int progress = (i * nInPortCount) + j + 1;\n sendProgressEvent(progress);\n\t\t\tmidiin->openPort(j);\n\t\t\tmidiout->sendMessage(qMessage);\n \/\/ pause a little\n\t\t\tusleep(100000);\n\t\t\tBYTE_VECTOR *message = new BYTE_VECTOR;\n midiin->getMessage(message);\n unsigned int nMessageSize = message->size();\n if (nMessageSize > 0) {\n#ifdef __MIO_DEBUG__\n MIDI::printMessage(message);\n#endif \/\/__MIO_DEBUG__\n \/\/ test for iConnectivity device\n if (isIconnectivityDevice(message)) {\n serialNumber =\n MIDI::byteJoin(message, (unsigned int)7, (unsigned int)5);\n\t\t\t\t\tstd::cout << \"device with serial number \" << serialNumber\n\t\t\t\t\t\t\t\t\t\t<< \" detected... (\" << midiout->getPortName(i) << \"- \"\n\t\t\t\t\t\t\t\t\t\t<< midiin->getPortName(j) << \") \";\n midiin->closePort();\n\t\t\t\t\tmidiout->closePort();\n if (devices->find(serialNumber) == devices->end()) {\n int productId = MIDI::byteJoin(message, 5, 2);\n Device *device = new Device(j, i, serialNumber, productId);\n devices->insert(std::pair<long, Device *>(serialNumber, device));\n\t\t\t\t\t\tstd::cout << \"... and added to list of devices\" << std::endl;\n } else {\n\t\t\t\t\t\tstd::cout << \"... but it's already recognized\" << std::endl;\n }\n break;\n }\n#ifdef __MIO_DEBUG__\n else {\n std::cout << \"there is an answer from a device but no iConnectivity: \"\n << midiout->getPortName(i) << \" - \"\n << midiin->getPortName(j) << std::endl;\n }\n#endif \/\/ __MIO_DEBUG__\n }\n#ifdef __MIO_DEBUG__\n else {\n std::cout << \"no answer from any device: \" << midiout->getPortName(i)\n << \" - \" << midiin->getPortName(j) << std::endl;\n }\n#endif \/\/__MIO_DEBUG__\n\t\t\tmidiin->closePort();\n }\n\t\tif (midiout->isPortOpen())\n\t\t\tmidiout->closePort();\n ProgressEvent *e = new ProgressEvent();\n e->setValue(getMidiInPortCount() * getMddiOutPortCount());\n QApplication::sendEvent(gui, e);\n }\n#ifdef __MIO_SIMULATE__\n \/\/ if simulation is enabled, send some events to progress bar...\n int base = midiin->getPortCount() * midiout->getPortCount();\n for (int i = 0; i <= 27; i++) {\n sendProgressEvent(base + i);\n usleep(10000);\n }\n \/\/... and create two devices\n Device *ds = new Device(1, 1, 0x11, 0x0101, \"mio10\", \"Device 1\");\n devices->insert(std::pair<long, Device *>(0x11, ds));\n ds = new Device(2, 2, 0x12, 0x0201, \"mio2\", \"Device 2\");\n devices->insert(std::pair<long, Device *>(0x12, ds));\n#endif \/\/__MIO_SIMULATE__\n Device *d = 0;\n try {\n d = devices->at(defaultDeviceSerialNumber);\n d->setDefault(true);\n } catch (std::out_of_range) {\n d = devices->begin()->second;\n d->setDefault(true);\n defaultDeviceSerialNumber = d->getSerialNumber()->getLongValue();\n Configuration::getInstance().setDefaultDevice(defaultDeviceSerialNumber);\n }\n\n\tfor (Devices::iterator it = devices->begin(); it != devices->end(); ++it) {\n d = it->second;\n d->queryDeviceInfo();\n }\n Configuration::getInstance().setDevices(devices);\n return devices->size();\n}\n\ndouble DeviceDetectionProcessor::getMessage(BYTE_VECTOR *message) {\n double deltatime = midiin->getMessage(message);\n return deltatime;\n}\n\nvoid DeviceDetectionProcessor::createMidiIn() {\n midiin = MIDI::createMidiIn();\n#ifdef __MIO_DEBUG__\n unsigned int nPorts = midiin->getPortCount();\n std::cout << \"\\nThere are \" << nPorts << \" MIDI input sources available.\\n\";\n std::string portName;\n for (unsigned int i = 0; i < nPorts; i++) {\n try {\n portName = midiin->getPortName(i);\n } catch (RtMidiError &error) {\n error.printMessage();\n }\n std::cout << \" Input Port #\" << i + 1 << \": \" << portName.c_str() << \"\\n\";\n }\n#endif \/\/__MIO_DEBUG_\n}\n\nvoid DeviceDetectionProcessor::createMidiOut() {\n \/\/ RtMidiOut constructor\n midiout = MIDI::createMidiOut();\n\/\/ Check outputs.\n#ifdef __MIO_DEBUG__\n unsigned int nPorts = midiout->getPortCount();\n std::cout << \"\\nThere are \" << nPorts << \" MIDI output ports available.\\n\";\n std::string portName;\n for (unsigned int i = 0; i < nPorts; i++) {\n try {\n portName = midiout->getPortName(i);\n } catch (RtMidiError &error) {\n error.printMessage();\n }\n std::cout << \" Output Port #\" << i + 1 << \": \" << portName.c_str() << \"\\n\";\n }\n#endif \/\/__MIO_DEBUG__\n}\n\n\/* USB methods - currently not used *\/\nbool DeviceDetectionProcessor::setupUSB() {\n int r;\n\n r = libusb_init(NULL);\n if (r < 0)\n return false;\n\n return true;\n}\n\nvoid DeviceDetectionProcessor::printUSBDevs() {\n ssize_t cnt;\n libusb_device **devs;\n libusb_device *dev;\n int i = 0, j = 0;\n uint8_t path[8];\n\n cnt = libusb_get_device_list(NULL, &devs);\n if (cnt < 0)\n return;\n\n while ((dev = devs[i++]) != NULL) {\n struct libusb_device_descriptor desc;\n int r = libusb_get_device_descriptor(dev, &desc);\n if (r < 0) {\n fprintf(stderr, \"failed to get device descriptor\");\n return;\n }\n\n printf(\"%04x:%04x (bus %d, device %d)\", desc.idVendor, desc.idProduct,\n libusb_get_bus_number(dev), libusb_get_device_address(dev));\n if (desc.idVendor == Device::MANUFACTURER_USB_ID) {\n std::cout << \"Found iConnectivity Device\";\n }\n r = libusb_get_port_numbers(dev, path, sizeof(path));\n if (r > 0) {\n printf(\" path: %d\", path[0]);\n for (j = 1; j < r; j++)\n printf(\".%d\", path[j]);\n }\n printf(\"\\n\");\n }\n\n libusb_free_device_list(devs, 1);\n}\n<commit_msg>use macro for device dependend wait times correction for calculating the progress steps of device detection<commit_after>#include \"devicedetectionprocessor.h\"\n#include \"config\/configuration.h\"\n#include \"events\/events.h\"\n#include \"sysex\/devicedetectionquery.h\"\n#include \"sysex\/midi.h\"\n\n#include <QApplication>\n#include <QDebug>\n#include <QSettings>\n#include <iomanip>\n#include <unistd.h>\n\nDeviceDetectionProcessor::DeviceDetectionProcessor(QWidget *gui) : gui(gui) {\n\tif (Configuration::getInstance().getMidiDeviceDetection()) {\n\t\tsetupMidiPorts();\n\t}\n\tif (Configuration::getInstance().getUsbDeviceDetection()) {\n\t\tsetupUSB();\n\t}\n}\n\nDeviceDetectionProcessor::~DeviceDetectionProcessor() {\n if (Configuration::getInstance().getUsbDeviceDetection())\n libusb_exit(NULL);\n if (Configuration::getInstance().getMidiDeviceDetection()) {\n midiin = NULL;\n midiout = NULL;\n }\n}\n\nint DeviceDetectionProcessor::getMidiInPortCount() {\n if (midiin)\n return midiin->getPortCount();\n return 0;\n}\n\nint DeviceDetectionProcessor::getMddiOutPortCount() {\n if (midiout)\n return midiout->getPortCount();\n return 0;\n}\n\n\/* MIDI-methods *\/\n\nvoid DeviceDetectionProcessor::startDeviceDetection() {\n if (Configuration::getInstance().getMidiDeviceDetection()) {\n detectDevices();\n }\n}\n\nbool DeviceDetectionProcessor::isIconnectivityDevice(\n std::vector<unsigned char> *message) {\n int nMessageSize = message->size();\n return ((nMessageSize >= 16) && (message->at(0) == SYSEX_START) &&\n (message->at(1) == Device::MANUFACTURER_SYSEX_ID[0]) &&\n (message->at(2) == Device::MANUFACTURER_SYSEX_ID[1]) &&\n (message->at(3) == Device::MANUFACTURER_SYSEX_ID[2]) &&\n (message->at(15) == 0x02));\n}\n\nvoid DeviceDetectionProcessor::setupMidiPorts() {\n createMidiIn();\n createMidiOut();\n}\n\nvoid DeviceDetectionProcessor::sendProgressEvent(int progress) {\n ProgressEvent *e = new ProgressEvent();\n e->setValue(progress);\n QApplication::sendEvent(gui, e);\n}\n\nint DeviceDetectionProcessor::detectDevices() {\n\n int defaultDeviceSerialNumber =\n Configuration::getInstance().getDefaultDevice();\n int nOutPortCount = midiout->getPortCount();\n int nInPortCount = midiin->getPortCount();\n#ifdef __MIO_DEBUG__\n std::cout << \"Out ports: \" << std::dec << nOutPortCount\n << \", in ports: \" << nInPortCount\n << \" - combinations to probe: \" << nOutPortCount * nInPortCount\n << std::endl;\n#endif \/\/__MIO_DEBUG__\n DeviceDetectionQuery *q = new DeviceDetectionQuery();\n long serialNumber;\n BYTE_VECTOR *qMessage = q->getMIDISysExMessage();\n std::map<long, Device *> *devices = Configuration::getInstance().getDevices();\n \/\/ for each output signal\n for (int i = 0; i < nOutPortCount; i++) {\n midiout->openPort(i);\n \/\/ and each input signal\n for (int j = 0; j < nInPortCount; j++) {\n int progress = (i * nInPortCount) + j + 1;\n sendProgressEvent(progress);\n\t\t\tmidiin->openPort(j);\n\t\t\tmidiout->sendMessage(qMessage);\n \/\/ pause a little\n\t\t\tSLEEP(100);\n\t\t\tBYTE_VECTOR *message = new BYTE_VECTOR;\n midiin->getMessage(message);\n unsigned int nMessageSize = message->size();\n if (nMessageSize > 0) {\n#ifdef __MIO_DEBUG__\n MIDI::printMessage(message);\n#endif \/\/__MIO_DEBUG__\n \/\/ test for iConnectivity device\n if (isIconnectivityDevice(message)) {\n serialNumber =\n MIDI::byteJoin(message, (unsigned int)7, (unsigned int)5);\n\t\t\t\t\tstd::cout << \"device with serial number \" << serialNumber\n\t\t\t\t\t\t\t\t\t\t<< \" detected... (\" << midiout->getPortName(i) << \"- \"\n\t\t\t\t\t\t\t\t\t\t<< midiin->getPortName(j) << \") \";\n midiin->closePort();\n\t\t\t\t\tmidiout->closePort();\n if (devices->find(serialNumber) == devices->end()) {\n int productId = MIDI::byteJoin(message, 5, 2);\n Device *device = new Device(j, i, serialNumber, productId);\n devices->insert(std::pair<long, Device *>(serialNumber, device));\n\t\t\t\t\t\tstd::cout << \"... and added to list of devices\" << std::endl;\n } else {\n\t\t\t\t\t\tstd::cout << \"... but it's already recognized\" << std::endl;\n }\n break;\n }\n#ifdef __MIO_DEBUG__\n else {\n std::cout << \"there is an answer from a device but no iConnectivity: \"\n << midiout->getPortName(i) << \" - \"\n << midiin->getPortName(j) << std::endl;\n }\n#endif \/\/ __MIO_DEBUG__\n }\n#ifdef __MIO_DEBUG__\n else {\n std::cout << \"no answer from any device: \" << midiout->getPortName(i)\n << \" - \" << midiin->getPortName(j) << std::endl;\n }\n#endif \/\/__MIO_DEBUG__\n\t\t\tmidiin->closePort();\n }\n\t\tif (midiout->isPortOpen())\n\t\t\tmidiout->closePort();\n\t}\n\tsendProgressEvent(getMidiInPortCount() * getMddiOutPortCount());\n\n#ifdef __MIO_SIMULATE__\n \/\/ if simulation is enabled, send some events to progress bar...\n int base = midiin->getPortCount() * midiout->getPortCount();\n for (int i = 0; i <= 27; i++) {\n sendProgressEvent(base + i);\n\t\tSLEEP(10);\n }\n \/\/... and create two devices\n Device *ds = new Device(1, 1, 0x11, 0x0101, \"mio10\", \"Device 1\");\n devices->insert(std::pair<long, Device *>(0x11, ds));\n ds = new Device(2, 2, 0x12, 0x0201, \"mio2\", \"Device 2\");\n devices->insert(std::pair<long, Device *>(0x12, ds));\n#endif \/\/__MIO_SIMULATE__\n Device *d = 0;\n try {\n d = devices->at(defaultDeviceSerialNumber);\n d->setDefault(true);\n } catch (std::out_of_range) {\n d = devices->begin()->second;\n d->setDefault(true);\n defaultDeviceSerialNumber = d->getSerialNumber()->getLongValue();\n Configuration::getInstance().setDefaultDevice(defaultDeviceSerialNumber);\n }\n\n\tfor (Devices::iterator it = devices->begin(); it != devices->end(); ++it) {\n d = it->second;\n d->queryDeviceInfo();\n }\n Configuration::getInstance().setDevices(devices);\n return devices->size();\n}\n\ndouble DeviceDetectionProcessor::getMessage(BYTE_VECTOR *message) {\n double deltatime = midiin->getMessage(message);\n return deltatime;\n}\n\nvoid DeviceDetectionProcessor::createMidiIn() {\n midiin = MIDI::createMidiIn();\n#ifdef __MIO_DEBUG__\n unsigned int nPorts = midiin->getPortCount();\n std::cout << \"\\nThere are \" << nPorts << \" MIDI input sources available.\\n\";\n std::string portName;\n for (unsigned int i = 0; i < nPorts; i++) {\n try {\n portName = midiin->getPortName(i);\n } catch (RtMidiError &error) {\n error.printMessage();\n }\n std::cout << \" Input Port #\" << i + 1 << \": \" << portName.c_str() << \"\\n\";\n }\n#endif \/\/__MIO_DEBUG_\n}\n\nvoid DeviceDetectionProcessor::createMidiOut() {\n \/\/ RtMidiOut constructor\n midiout = MIDI::createMidiOut();\n\/\/ Check outputs.\n#ifdef __MIO_DEBUG__\n unsigned int nPorts = midiout->getPortCount();\n std::cout << \"\\nThere are \" << nPorts << \" MIDI output ports available.\\n\";\n std::string portName;\n for (unsigned int i = 0; i < nPorts; i++) {\n try {\n portName = midiout->getPortName(i);\n } catch (RtMidiError &error) {\n error.printMessage();\n }\n std::cout << \" Output Port #\" << i + 1 << \": \" << portName.c_str() << \"\\n\";\n }\n#endif \/\/__MIO_DEBUG__\n}\n\n\/* USB methods - currently not used *\/\nbool DeviceDetectionProcessor::setupUSB() {\n int r;\n\n r = libusb_init(NULL);\n if (r < 0)\n return false;\n\n return true;\n}\n\nvoid DeviceDetectionProcessor::printUSBDevs() {\n ssize_t cnt;\n libusb_device **devs;\n libusb_device *dev;\n int i = 0, j = 0;\n uint8_t path[8];\n\n cnt = libusb_get_device_list(NULL, &devs);\n if (cnt < 0)\n return;\n\n while ((dev = devs[i++]) != NULL) {\n struct libusb_device_descriptor desc;\n int r = libusb_get_device_descriptor(dev, &desc);\n if (r < 0) {\n fprintf(stderr, \"failed to get device descriptor\");\n return;\n }\n\n printf(\"%04x:%04x (bus %d, device %d)\", desc.idVendor, desc.idProduct,\n libusb_get_bus_number(dev), libusb_get_device_address(dev));\n if (desc.idVendor == Device::MANUFACTURER_USB_ID) {\n std::cout << \"Found iConnectivity Device\";\n }\n r = libusb_get_port_numbers(dev, path, sizeof(path));\n if (r > 0) {\n printf(\" path: %d\", path[0]);\n for (j = 1; j < r; j++)\n printf(\".%d\", path[j]);\n }\n printf(\"\\n\");\n }\n\n libusb_free_device_list(devs, 1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n open source routing machine\n Copyright (C) Dennis Luxen, others 2010\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU AFFERO General Public License as published by\nthe Free Software Foundation; either version 3 of the License, or\nany later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU Affero General Public License\nalong with this program; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\nor see http:\/\/www.gnu.org\/licenses\/agpl.txt.\n *\/\n#ifdef STXXL_VERBOSE_LEVEL\n#undef STXXL_VERBOSE_LEVEL\n#endif\n#define STXXL_VERBOSE_LEVEL -1000\n\n#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <libxml\/xmlreader.h>\n#include <google\/sparse_hash_map>\n#include <unistd.h>\n#include <stxxl.h>\n\n#include \"typedefs.h\"\n#include \"DataStructures\/InputReaderFactory.h\"\n#include \"DataStructures\/ExtractorCallBacks.h\"\n#include \"DataStructures\/ExtractorStructs.h\"\n#include \"DataStructures\/PBFParser.h\"\n#include \"DataStructures\/XMLParser.h\"\n#include \"Util\/BaseConfiguration.h\"\n#include \"Util\/InputFileUtil.h\"\n\ntypedef BaseConfiguration ExtractorConfiguration;\n\nunsigned globalRelationCounter = 0;\nExtractorCallbacks * extractCallBacks;\n\nbool nodeFunction(_Node n);\nbool adressFunction(_Node n, HashTable<std::string, std::string> keyVals);\nbool relationFunction(_Relation r);\nbool wayFunction(_Way w);\n\ntemplate<class ClassT>\nbool removeIfUnused(ClassT n) { return (false == n.used); }\n\nint main (int argc, char *argv[]) {\n if(argc <= 1) {\n std::cerr << \"usage: \" << endl << argv[0] << \" <file.osm>\" << std::endl;\n exit(-1);\n }\n\n std::cout << \"[extractor] extracting data from input file \" << argv[1] << std::endl;\n bool isPBF = false;\n std::string outputFileName(argv[1]);\n std::string::size_type pos = outputFileName.find(\".osm.bz2\");\n if(pos==string::npos) {\n pos = outputFileName.find(\".osm.pbf\");\n if(pos!=string::npos) {\n isPBF = true;\n }\n }\n if(pos!=string::npos) {\n outputFileName.replace(pos, 8, \".osrm\");\n } else {\n pos=outputFileName.find(\".osm\");\n if(pos!=string::npos) {\n outputFileName.replace(pos, 5, \".osrm\");\n } else {\n outputFileName.append(\".osrm\");\n }\n }\n std::string adressFileName(outputFileName);\n\n\n\n unsigned amountOfRAM = 1;\n unsigned installedRAM = (sysconf(_SC_PHYS_PAGES) * sysconf(_SC_PAGESIZE));\n if(installedRAM < 2097422336) {\n std::cout << \"[Warning] Machine has less than 2GB RAM.\" << std::endl;\n }\n if(testDataFile(\"extractor.ini\")) {\n ExtractorConfiguration extractorConfig(\"extractor.ini\");\n unsigned memoryAmountFromFile = atoi(extractorConfig.GetParameter(\"Memory\").c_str());\n if( memoryAmountFromFile != 0 && memoryAmountFromFile <= installedRAM\/(1024*1024*1024))\n amountOfRAM = memoryAmountFromFile;\n std::cout << \"[extractor] using \" << amountOfRAM << \" GB of RAM for buffers\" << std::endl;\n }\n\n STXXLNodeIDVector usedNodeIDs;\n STXXLNodeVector allNodes;\n STXXLEdgeVector allEdges;\n STXXLAddressVector adressVector;\n STXXLStringVector nameVector;\n unsigned usedNodeCounter = 0;\n unsigned usedEdgeCounter = 0;\n\n StringMap * stringMap = new StringMap();\n Settings settings;\n settings.speedProfile.names.insert(settings.speedProfile.names.begin(), names, names+14);\n settings.speedProfile.speed.insert(settings.speedProfile.speed.begin(), speeds, speeds+14);\n\n double time = get_timestamp();\n\n stringMap->set_empty_key(GetRandomString());\n stringMap->insert(std::make_pair(\"\", 0));\n extractCallBacks = new ExtractorCallbacks(&allNodes, &usedNodeIDs, &allEdges, &nameVector, &adressVector, settings, stringMap);\n\n BaseParser<_Node, _Relation, _Way> * parser;\n if(isPBF) {\n parser = new PBFParser(argv[1]);\n } else {\n parser = new XMLParser(argv[1]);\n }\n parser->RegisterCallbacks(&nodeFunction, &relationFunction, &wayFunction, &adressFunction);\n if(parser->Init()) {\n parser->Parse();\n } else {\n std::cerr << \"[error] parser not initialized!\" << std::endl;\n exit(-1);\n }\n delete parser;\n\n try {\n \/\/ std::cout << \"[info] raw no. of names: \" << nameVector.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of nodes: \" << allNodes.size() << std::endl;\n \/\/ std::cout << \"[info] no. of used nodes: \" << usedNodeIDs.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of edges: \" << allEdges.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of relations: \" << globalRelationCounter << std::endl;\n \/\/ std::cout << \"[info] raw no. of addresses: \" << adressVector.size() << std::endl;\n\n std::cout << \"[extractor] parsing finished after \" << get_timestamp() - time << \"seconds\" << std::endl;\n time = get_timestamp();\n unsigned memory_to_use = amountOfRAM * 1024 * 1024 * 1024;\n\n std::cout << \"[extractor] Sorting used nodes ... \" << std::flush;\n stxxl::sort(usedNodeIDs.begin(), usedNodeIDs.end(), Cmp(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n time = get_timestamp();\n std::cout << \"[extractor] Erasing duplicate nodes ... \" << std::flush;\n stxxl::vector<NodeID>::iterator NewEnd = unique ( usedNodeIDs.begin(),usedNodeIDs.end() ) ;\n usedNodeIDs.resize ( NewEnd - usedNodeIDs.begin() );\n cout << \"ok, after \" << get_timestamp() - time << \"s\" << endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Sorting all nodes ... \" << std::flush;\n stxxl::sort(allNodes.begin(), allNodes.end(), CmpNodeByID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::ofstream fout;\n fout.open(outputFileName.c_str(), std::ios::binary);\n fout.write((char*)&usedNodeCounter, sizeof(unsigned));\n\n std::cout << \"[extractor] Confirming used nodes ... \" << std::flush;\n STXXLNodeVector::iterator nodesIT = allNodes.begin();\n STXXLNodeIDVector::iterator usedNodeIDsIT = usedNodeIDs.begin();\n while(usedNodeIDsIT != usedNodeIDs.end() && nodesIT != allNodes.end()) {\n if(*usedNodeIDsIT < nodesIT->id){\n usedNodeIDsIT++;\n continue;\n }\n if(*usedNodeIDsIT > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(*usedNodeIDsIT == nodesIT->id) {\n fout.write((char*)&(nodesIT->id), sizeof(unsigned));\n fout.write((char*)&(nodesIT->lon), sizeof(int));\n fout.write((char*)&(nodesIT->lat), sizeof(int));\n usedNodeCounter++;\n usedNodeIDsIT++;\n nodesIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] setting number of nodes ... \" << std::flush;\n std::ios::pos_type positionInFile = fout.tellp();\n fout.seekp(std::ios::beg);\n fout.write((char*)&usedNodeCounter, sizeof(unsigned));\n fout.seekp(positionInFile);\n\n std::cout << \"ok\" << std::endl;\n time = get_timestamp();\n\n \/\/ Sort edges by start.\n std::cout << \"[extractor] Sorting edges by start ... \" << std::flush;\n stxxl::sort(allEdges.begin(), allEdges.end(), CmpEdgeByStartID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Setting start coords ... \" << std::flush;\n fout.write((char*)&usedEdgeCounter, sizeof(unsigned));\n \/\/ Traverse list of edges and nodes in parallel and set start coord\n nodesIT = allNodes.begin();\n STXXLEdgeVector::iterator edgeIT = allEdges.begin();\n while(edgeIT != allEdges.end() && nodesIT != allNodes.end()) {\n if(edgeIT->start < nodesIT->id){\n edgeIT++;\n continue;\n }\n if(edgeIT->start > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(edgeIT->start == nodesIT->id) {\n edgeIT->startCoord.lat = nodesIT->lat;\n edgeIT->startCoord.lon = nodesIT->lon;\n edgeIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n \/\/ Sort Edges by target\n std::cout << \"[extractor] Sorting edges by target ... \" << std::flush;\n stxxl::sort(allEdges.begin(), allEdges.end(), CmpEdgeByTargetID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Setting target coords ... \" << std::flush;\n \/\/ Traverse list of edges and nodes in parallel and set target coord\n nodesIT = allNodes.begin();\n edgeIT = allEdges.begin();\n while(edgeIT != allEdges.end() && nodesIT != allNodes.end()) {\n if(edgeIT->target < nodesIT->id){\n edgeIT++;\n continue;\n }\n if(edgeIT->target > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(edgeIT->startCoord.lat != INT_MIN && edgeIT->target == nodesIT->id) {\n edgeIT->targetCoord.lat = nodesIT->lat;\n edgeIT->targetCoord.lon = nodesIT->lon;\n\n double distance = ApproximateDistance(edgeIT->startCoord.lat, edgeIT->startCoord.lon, nodesIT->lat, nodesIT->lon);\n if(edgeIT->speed == -1)\n edgeIT->speed = settings.speedProfile.speed[edgeIT->type];\n double weight = ( distance * 10. ) \/ (edgeIT->speed \/ 3.6);\n int intWeight = max(1, (int) weight);\n int intDist = max(1, (int)distance);\n int ferryIndex = settings.indexInAccessListOf(\"ferry\");\n assert(ferryIndex != -1);\n short zero = 0;\n short one = 1;\n\n fout.write((char*)&edgeIT->start, sizeof(unsigned));\n fout.write((char*)&edgeIT->target, sizeof(unsigned));\n fout.write((char*)&intDist, sizeof(int));\n switch(edgeIT->direction) {\n case _Way::notSure:\n fout.write((char*)&zero, sizeof(short));\n break;\n case _Way::oneway:\n fout.write((char*)&one, sizeof(short));\n break;\n case _Way::bidirectional:\n fout.write((char*)&zero, sizeof(short));\n\n break;\n case _Way::opposite:\n fout.write((char*)&one, sizeof(short));\n break;\n default:\n std::cerr << \"[error] edge with no direction: \" << edgeIT->direction << std::endl;\n assert(false);\n break;\n }\n fout.write((char*)&intWeight, sizeof(int));\n short edgeType = edgeIT->type;\n fout.write((char*)&edgeType, sizeof(short));\n fout.write((char*)&edgeIT->nameID, sizeof(unsigned));\n\n usedEdgeCounter++;\n edgeIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] setting number of edges ... \" << std::flush;\n fout.seekp(positionInFile);\n fout.write((char*)&usedEdgeCounter, sizeof(unsigned));\n fout.close();\n std::cout << \"ok\" << std::endl;\n time = get_timestamp();\n\n\n std::cout << \"[extractor] writing street name index ... \" << std::flush;\n std::vector<unsigned> * nameIndex = new std::vector<unsigned>(nameVector.size()+1, 0);\n outputFileName.append(\".names\");\n std::ofstream nameOutFile(outputFileName.c_str(), std::ios::binary);\n unsigned sizeOfNameIndex = nameIndex->size();\n nameOutFile.write((char *)&(sizeOfNameIndex), sizeof(unsigned));\n\n for(STXXLStringVector::iterator it = nameVector.begin(); it != nameVector.end(); it++) {\n unsigned lengthOfRawString = strlen(it->c_str());\n nameOutFile.write((char *)&(lengthOfRawString), sizeof(unsigned));\n nameOutFile.write(it->c_str(), lengthOfRawString);\n }\n\n nameOutFile.close();\n delete nameIndex;\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n \/\/ time = get_timestamp();\n \/\/ std::cout << \"[extractor] writing address list ... \" << std::flush;\n \/\/\n \/\/ adressFileName.append(\".address\");\n \/\/ std::ofstream addressOutFile(adressFileName.c_str());\n \/\/ for(STXXLAddressVector::iterator it = adressVector.begin(); it != adressVector.end(); it++) {\n \/\/ addressOutFile << it->node.id << \"|\" << it->node.lat << \"|\" << it->node.lon << \"|\" << it->city << \"|\" << it->street << \"|\" << it->housenumber << \"|\" << it->state << \"|\" << it->country << \"\\n\";\n \/\/ }\n \/\/ addressOutFile.close();\n \/\/ std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n } catch ( const std::exception& e ) {\n std::cerr << \"Caught Execption:\" << e.what() << std::endl;\n return false;\n }\n\n delete extractCallBacks;\n std::cout << \"[extractor] finished.\" << std::endl;\n return 0;\n}\n\nbool nodeFunction(_Node n) {\n extractCallBacks->nodeFunction(n);\n return true;\n}\n\nbool adressFunction(_Node n, HashTable<std::string, std::string> keyVals){\n extractCallBacks->adressFunction(n, keyVals);\n return true;\n}\n\nbool relationFunction(_Relation r) {\n globalRelationCounter++;\n return true;\n}\nbool wayFunction(_Way w) {\n extractCallBacks->wayFunction(w);\n return true;\n}\n\n<commit_msg>fixing a silly endless loop that occurred when an edge had a starting node that was not present in node data (Thanks Frederik)<commit_after>\/*\n open source routing machine\n Copyright (C) Dennis Luxen, others 2010\n\nThis program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU AFFERO General Public License as published by\nthe Free Software Foundation; either version 3 of the License, or\nany later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU Affero General Public License\nalong with this program; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\nor see http:\/\/www.gnu.org\/licenses\/agpl.txt.\n *\/\n#ifdef STXXL_VERBOSE_LEVEL\n#undef STXXL_VERBOSE_LEVEL\n#endif\n#define STXXL_VERBOSE_LEVEL -1000\n\n#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include <libxml\/xmlreader.h>\n#include <google\/sparse_hash_map>\n#include <unistd.h>\n#include <stxxl.h>\n\n#include \"typedefs.h\"\n#include \"DataStructures\/InputReaderFactory.h\"\n#include \"DataStructures\/ExtractorCallBacks.h\"\n#include \"DataStructures\/ExtractorStructs.h\"\n#include \"DataStructures\/PBFParser.h\"\n#include \"DataStructures\/XMLParser.h\"\n#include \"Util\/BaseConfiguration.h\"\n#include \"Util\/InputFileUtil.h\"\n\ntypedef BaseConfiguration ExtractorConfiguration;\n\nunsigned globalRelationCounter = 0;\nExtractorCallbacks * extractCallBacks;\n\nbool nodeFunction(_Node n);\nbool adressFunction(_Node n, HashTable<std::string, std::string> keyVals);\nbool relationFunction(_Relation r);\nbool wayFunction(_Way w);\n\ntemplate<class ClassT>\nbool removeIfUnused(ClassT n) { return (false == n.used); }\n\nint main (int argc, char *argv[]) {\n if(argc <= 1) {\n std::cerr << \"usage: \" << endl << argv[0] << \" <file.osm>\" << std::endl;\n exit(-1);\n }\n\n std::cout << \"[extractor] extracting data from input file \" << argv[1] << std::endl;\n bool isPBF = false;\n std::string outputFileName(argv[1]);\n std::string::size_type pos = outputFileName.find(\".osm.bz2\");\n if(pos==string::npos) {\n pos = outputFileName.find(\".osm.pbf\");\n if(pos!=string::npos) {\n isPBF = true;\n }\n }\n if(pos!=string::npos) {\n outputFileName.replace(pos, 8, \".osrm\");\n } else {\n pos=outputFileName.find(\".osm\");\n if(pos!=string::npos) {\n outputFileName.replace(pos, 5, \".osrm\");\n } else {\n outputFileName.append(\".osrm\");\n }\n }\n std::string adressFileName(outputFileName);\n\n\n\n unsigned amountOfRAM = 1;\n unsigned installedRAM = (sysconf(_SC_PHYS_PAGES) * sysconf(_SC_PAGESIZE));\n if(installedRAM < 2097422336) {\n std::cout << \"[Warning] Machine has less than 2GB RAM.\" << std::endl;\n }\n if(testDataFile(\"extractor.ini\")) {\n ExtractorConfiguration extractorConfig(\"extractor.ini\");\n unsigned memoryAmountFromFile = atoi(extractorConfig.GetParameter(\"Memory\").c_str());\n if( memoryAmountFromFile != 0 && memoryAmountFromFile <= installedRAM\/(1024*1024*1024))\n amountOfRAM = memoryAmountFromFile;\n std::cout << \"[extractor] using \" << amountOfRAM << \" GB of RAM for buffers\" << std::endl;\n }\n\n STXXLNodeIDVector usedNodeIDs;\n STXXLNodeVector allNodes;\n STXXLEdgeVector allEdges;\n STXXLAddressVector adressVector;\n STXXLStringVector nameVector;\n unsigned usedNodeCounter = 0;\n unsigned usedEdgeCounter = 0;\n\n StringMap * stringMap = new StringMap();\n Settings settings;\n settings.speedProfile.names.insert(settings.speedProfile.names.begin(), names, names+14);\n settings.speedProfile.speed.insert(settings.speedProfile.speed.begin(), speeds, speeds+14);\n\n double time = get_timestamp();\n\n stringMap->set_empty_key(GetRandomString());\n stringMap->insert(std::make_pair(\"\", 0));\n extractCallBacks = new ExtractorCallbacks(&allNodes, &usedNodeIDs, &allEdges, &nameVector, &adressVector, settings, stringMap);\n\n BaseParser<_Node, _Relation, _Way> * parser;\n if(isPBF) {\n parser = new PBFParser(argv[1]);\n } else {\n parser = new XMLParser(argv[1]);\n }\n parser->RegisterCallbacks(&nodeFunction, &relationFunction, &wayFunction, &adressFunction);\n if(parser->Init()) {\n parser->Parse();\n } else {\n std::cerr << \"[error] parser not initialized!\" << std::endl;\n exit(-1);\n }\n delete parser;\n\n try {\n \/\/ std::cout << \"[info] raw no. of names: \" << nameVector.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of nodes: \" << allNodes.size() << std::endl;\n \/\/ std::cout << \"[info] no. of used nodes: \" << usedNodeIDs.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of edges: \" << allEdges.size() << std::endl;\n \/\/ std::cout << \"[info] raw no. of relations: \" << globalRelationCounter << std::endl;\n \/\/ std::cout << \"[info] raw no. of addresses: \" << adressVector.size() << std::endl;\n\n std::cout << \"[extractor] parsing finished after \" << get_timestamp() - time << \"seconds\" << std::endl;\n time = get_timestamp();\n unsigned memory_to_use = amountOfRAM * 1024 * 1024 * 1024;\n\n std::cout << \"[extractor] Sorting used nodes ... \" << std::flush;\n stxxl::sort(usedNodeIDs.begin(), usedNodeIDs.end(), Cmp(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n time = get_timestamp();\n std::cout << \"[extractor] Erasing duplicate nodes ... \" << std::flush;\n stxxl::vector<NodeID>::iterator NewEnd = unique ( usedNodeIDs.begin(),usedNodeIDs.end() ) ;\n usedNodeIDs.resize ( NewEnd - usedNodeIDs.begin() );\n cout << \"ok, after \" << get_timestamp() - time << \"s\" << endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Sorting all nodes ... \" << std::flush;\n stxxl::sort(allNodes.begin(), allNodes.end(), CmpNodeByID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::ofstream fout;\n fout.open(outputFileName.c_str(), std::ios::binary);\n fout.write((char*)&usedNodeCounter, sizeof(unsigned));\n\n std::cout << \"[extractor] Confirming used nodes ... \" << std::flush;\n STXXLNodeVector::iterator nodesIT = allNodes.begin();\n STXXLNodeIDVector::iterator usedNodeIDsIT = usedNodeIDs.begin();\n while(usedNodeIDsIT != usedNodeIDs.end() && nodesIT != allNodes.end()) {\n if(*usedNodeIDsIT < nodesIT->id){\n usedNodeIDsIT++;\n continue;\n }\n if(*usedNodeIDsIT > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(*usedNodeIDsIT == nodesIT->id) {\n fout.write((char*)&(nodesIT->id), sizeof(unsigned));\n fout.write((char*)&(nodesIT->lon), sizeof(int));\n fout.write((char*)&(nodesIT->lat), sizeof(int));\n usedNodeCounter++;\n usedNodeIDsIT++;\n nodesIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] setting number of nodes ... \" << std::flush;\n std::ios::pos_type positionInFile = fout.tellp();\n fout.seekp(std::ios::beg);\n fout.write((char*)&usedNodeCounter, sizeof(unsigned));\n fout.seekp(positionInFile);\n\n std::cout << \"ok\" << std::endl;\n time = get_timestamp();\n\n \/\/ Sort edges by start.\n std::cout << \"[extractor] Sorting edges by start ... \" << std::flush;\n stxxl::sort(allEdges.begin(), allEdges.end(), CmpEdgeByStartID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Setting start coords ... \" << std::flush;\n fout.write((char*)&usedEdgeCounter, sizeof(unsigned));\n \/\/ Traverse list of edges and nodes in parallel and set start coord\n nodesIT = allNodes.begin();\n STXXLEdgeVector::iterator edgeIT = allEdges.begin();\n while(edgeIT != allEdges.end() && nodesIT != allNodes.end()) {\n if(edgeIT->start < nodesIT->id){\n edgeIT++;\n continue;\n }\n if(edgeIT->start > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(edgeIT->start == nodesIT->id) {\n edgeIT->startCoord.lat = nodesIT->lat;\n edgeIT->startCoord.lon = nodesIT->lon;\n edgeIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n \/\/ Sort Edges by target\n std::cout << \"[extractor] Sorting edges by target ... \" << std::flush;\n stxxl::sort(allEdges.begin(), allEdges.end(), CmpEdgeByTargetID(), memory_to_use);\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] Setting target coords ... \" << std::flush;\n \/\/ Traverse list of edges and nodes in parallel and set target coord\n nodesIT = allNodes.begin();\n edgeIT = allEdges.begin();\n while(edgeIT != allEdges.end() && nodesIT != allNodes.end()) {\n if(edgeIT->target < nodesIT->id){\n edgeIT++;\n continue;\n }\n if(edgeIT->target > nodesIT->id) {\n nodesIT++;\n continue;\n }\n if(edgeIT->target == nodesIT->id) {\n if(edgeIT->startCoord.lat != INT_MIN) {\n edgeIT->targetCoord.lat = nodesIT->lat;\n edgeIT->targetCoord.lon = nodesIT->lon;\n\n double distance = ApproximateDistance(edgeIT->startCoord.lat, edgeIT->startCoord.lon, nodesIT->lat, nodesIT->lon);\n if(edgeIT->speed == -1)\n edgeIT->speed = settings.speedProfile.speed[edgeIT->type];\n double weight = ( distance * 10. ) \/ (edgeIT->speed \/ 3.6);\n int intWeight = max(1, (int) weight);\n int intDist = max(1, (int)distance);\n int ferryIndex = settings.indexInAccessListOf(\"ferry\");\n assert(ferryIndex != -1);\n short zero = 0;\n short one = 1;\n\n fout.write((char*)&edgeIT->start, sizeof(unsigned));\n fout.write((char*)&edgeIT->target, sizeof(unsigned));\n fout.write((char*)&intDist, sizeof(int));\n switch(edgeIT->direction) {\n case _Way::notSure:\n fout.write((char*)&zero, sizeof(short));\n break;\n case _Way::oneway:\n fout.write((char*)&one, sizeof(short));\n break;\n case _Way::bidirectional:\n fout.write((char*)&zero, sizeof(short));\n\n break;\n case _Way::opposite:\n fout.write((char*)&one, sizeof(short));\n break;\n default:\n std::cerr << \"[error] edge with no direction: \" << edgeIT->direction << std::endl;\n assert(false);\n break;\n }\n fout.write((char*)&intWeight, sizeof(int));\n short edgeType = edgeIT->type;\n fout.write((char*)&edgeType, sizeof(short));\n fout.write((char*)&edgeIT->nameID, sizeof(unsigned));\n }\n usedEdgeCounter++;\n edgeIT++;\n }\n }\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n time = get_timestamp();\n\n std::cout << \"[extractor] setting number of edges ... \" << std::flush;\n fout.seekp(positionInFile);\n fout.write((char*)&usedEdgeCounter, sizeof(unsigned));\n fout.close();\n std::cout << \"ok\" << std::endl;\n time = get_timestamp();\n\n\n std::cout << \"[extractor] writing street name index ... \" << std::flush;\n std::vector<unsigned> * nameIndex = new std::vector<unsigned>(nameVector.size()+1, 0);\n outputFileName.append(\".names\");\n std::ofstream nameOutFile(outputFileName.c_str(), std::ios::binary);\n unsigned sizeOfNameIndex = nameIndex->size();\n nameOutFile.write((char *)&(sizeOfNameIndex), sizeof(unsigned));\n\n for(STXXLStringVector::iterator it = nameVector.begin(); it != nameVector.end(); it++) {\n unsigned lengthOfRawString = strlen(it->c_str());\n nameOutFile.write((char *)&(lengthOfRawString), sizeof(unsigned));\n nameOutFile.write(it->c_str(), lengthOfRawString);\n }\n\n nameOutFile.close();\n delete nameIndex;\n std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n \/\/ time = get_timestamp();\n \/\/ std::cout << \"[extractor] writing address list ... \" << std::flush;\n \/\/\n \/\/ adressFileName.append(\".address\");\n \/\/ std::ofstream addressOutFile(adressFileName.c_str());\n \/\/ for(STXXLAddressVector::iterator it = adressVector.begin(); it != adressVector.end(); it++) {\n \/\/ addressOutFile << it->node.id << \"|\" << it->node.lat << \"|\" << it->node.lon << \"|\" << it->city << \"|\" << it->street << \"|\" << it->housenumber << \"|\" << it->state << \"|\" << it->country << \"\\n\";\n \/\/ }\n \/\/ addressOutFile.close();\n \/\/ std::cout << \"ok, after \" << get_timestamp() - time << \"s\" << std::endl;\n\n } catch ( const std::exception& e ) {\n std::cerr << \"Caught Execption:\" << e.what() << std::endl;\n return false;\n }\n\n delete extractCallBacks;\n std::cout << \"[extractor] finished.\" << std::endl;\n return 0;\n}\n\nbool nodeFunction(_Node n) {\n extractCallBacks->nodeFunction(n);\n return true;\n}\n\nbool adressFunction(_Node n, HashTable<std::string, std::string> keyVals){\n extractCallBacks->adressFunction(n, keyVals);\n return true;\n}\n\nbool relationFunction(_Relation r) {\n globalRelationCounter++;\n return true;\n}\nbool wayFunction(_Way w) {\n extractCallBacks->wayFunction(w);\n return true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ply2json\n *\n * The program is a ply file format to json file format converter for use\n * with three.js. The program uses the C++ libraries from the VTK toolkit\n * in order to read in a ply file and convert it into the json file format\n * which can be recongnized by three.js for rendering in the browsing.\n *\n * @Author Migara Liyanamage\n * @Date 19 June 2014\n * @Version 1.0\n *\n *\/\n\n\n\/\/ Import for VTK Libraries\n#include <vtkPLYReader.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkDecimatePro.h>\n\n\/\/ Import for standard C++ libraries\n#include <iostream>\n#include <fstream>\n\n\/\/ Import for program header\n#include \"ply2json.h\"\n\nusing namespace std;\n\n\/\/ stores the filename of the input file\nstatic string inputFilename;\n\n\/\/ store the filename of the output file\nstatic string outputFilename;\n\n\/\/ set amount to decimate by, if set to 1 no decimation occurs\nstatic double decAmount;\n\n\n\/*\n * Main Method\n *\n * This method reads in the file which is to be converted from the command line\n * and calls the appropriate methods to begin the conversion.\n *\n *\/\nint main( int argc, char ** argv )\n{\n if (argc < 3)\n {\n \/\/ Print Usage Message\n cout << \"Usage: \" << argv[0] << \" filename.ply outputName [decimate amount 0.0 .. 1.0]\" << endl;\n return EXIT_FAILURE;\n }\n\n if (argc == 4)\n {\n decAmount = atof(argv[3]);\n }\n else\n {\n decAmount = 1.0;\n }\n\n \/\/ Assign appropriate file names for the program\n inputFilename = argv[1];\n outputFilename = argv[2];\n\n \/\/ begin generation\n generateJSON();\n\n return EXIT_SUCCESS;\n}\n\n\/*\n * Generate JSON Method\n *\n * This method calls the appropriate methods in the vtk toolkit and outputs the\n * JSON file to the output file name specified\n *\n *\/\nvoid generateJSON()\n{\n \/\/ File stream for output file\n std::ofstream outputFile;\n outputFile.open(outputFilename.c_str());\n\n \/\/ begin the json file\n outputFile << \"{\\n\";\n\n \/\/ Reader to read in PLY File\n vtkSmartPointer<vtkPLYReader> reader =\n vtkSmartPointer<vtkPLYReader>::New();\n\n \/\/ Specify filename\n reader->SetFileName ( inputFilename.c_str() );\n\n \/\/ Call vtk pipeline to read in the file\n reader->Update();\n\n vtkDataSet * data;\n vtkIdType vert;\n vtkPolyData * pdata;\n vtkCellArray * faces;\n\n if (decAmount >= 1.0)\n {\n \/\/ Get the outpuyt for vertices\n data = reader->GetOutput();\n vert = data->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n pdata = reader->GetOutput();\n faces = pdata->GetPolys();\n\n }\n else if (decAmount < 0.0)\n {\n cout << \"Invalid Decimate Amount, Program will now exit\" << endl;\n exit(EXIT_FAILURE);\n } else\n {\n \/\/ create decimator\n vtkSmartPointer<vtkDecimatePro> decimate = vtkSmartPointer<vtkDecimatePro>::New();\n\n \/\/ set decimator to the selected file\n decimate->SetInputData(reader->GetOutput());\n\n \/\/ set target to reduce to, and set topology to be preserved\n decimate->PreserveTopologyOn();\n decimate->SetTargetReduction(decAmount);i\n\n \/\/ start decimation\n decimate->Update();\n\n\n\n\n }\n\n vtkIdType numCells = faces->GetNumberOfCells();\n vtkIdType cellLocation = 0;\n\n \/\/ Write the standard format header for the json file\n outputFile << \"\\\"metadata\\\":{\\\"formatVersion\\\":3,\\\"vertices\\\":\" << vert << \",\\\"faces\\\":\" << numCells << \",\\\"materials\\\":1},\\n\";\n outputFile << \"\\\"scale\\\":1.0,\\n\\\"materials\\\":[{\\\"DbgColor\\\":15658734,\\\"DbgIndex\\\":0,\\\"DbgName\\\":\\\"default\\\",\\\"vertexColors\\\": false}],\\n\";\n\n \/\/ Begin writing vertices\n outputFile << \"\\\"vertices\\\":[\";\n\n \/\/ Iterate over all the points and print them to the file\n for(vtkIdType i = 0; i < vert; i++)\n {\n double p[3];\n data->GetPoint(i, p);\n outputFile << p[0] << \",\" << p[1] << \",\" << p[2];\n if (i != vert - 1) outputFile << \",\"; \/\/ Avoid putting comma before end bracket\n }\n\n \/\/ End the vertices section\n outputFile << \"],\\n\";\n\n \/\/ Begin writing faces\n outputFile << \"\\\"faces\\\":[\";\n\n \/\/ Iterate over the faces and print them to file\n for (vtkIdType i = 0; i < numCells; i++)\n {\n vtkIdType numIDs;\n vtkIdType * pointIds;\n\n faces->GetCell(cellLocation, numIDs, pointIds);\n cellLocation += 1 + numIDs; \/\/ increment to include already printed faces\n\n for (vtkIdType j = 0; j < numIDs; j++)\n {\n \/\/ print to the file\n \/\/ printing the zero is for the bit mask signifying face type\n if (j == 0) outputFile << 0 << \",\";\n outputFile << pointIds[j];\n if (i != numCells - 1)\n {\n outputFile << \",\";\n }\n else\n {\n if(j != numIDs - 1) outputFile << \",\"; \/\/ avoid additional comma at end\n }\n }\n }\n\n \/\/ end faces section\n outputFile << \"]\\n\";\n\n \/\/ end the json file\n outputFile << \"}\\n\";\n\n \/\/ close file stream\n outputFile.close();\n}\n<commit_msg>finished decimate pro, now can decimate to output file<commit_after>\/*\n * ply2json\n *\n * The program is a ply file format to json file format converter for use\n * with three.js. The program uses the C++ libraries from the VTK toolkit\n * in order to read in a ply file and convert it into the json file format\n * which can be recongnized by three.js for rendering in the browsing.\n *\n * @Author Migara Liyanamage\n * @Date 19 June 2014\n * @Version 1.0\n *\n *\/\n\n\n\/\/ Import for VTK Libraries\n#include <vtkPLYReader.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkDecimatePro.h>\n\n\/\/ Import for standard C++ libraries\n#include <iostream>\n#include <fstream>\n\n\/\/ Import for program header\n#include \"ply2json.h\"\n\nusing namespace std;\n\n\/\/ stores the filename of the input file\nstatic string inputFilename;\n\n\/\/ store the filename of the output file\nstatic string outputFilename;\n\n\/\/ set amount to decimate by, if set to 1 no decimation occurs\nstatic double decAmount;\n\n\n\/*\n * Main Method\n *\n * This method reads in the file which is to be converted from the command line\n * and calls the appropriate methods to begin the conversion.\n *\n *\/\nint main( int argc, char ** argv )\n{\n if (argc < 3)\n {\n \/\/ Print Usage Message\n cout << \"Usage: \" << argv[0] << \" filename.ply outputName [decimate amount 0.0 .. 1.0]\" << endl;\n return EXIT_FAILURE;\n }\n\n if (argc == 4)\n {\n decAmount = atof(argv[3]);\n }\n else\n {\n decAmount = 1.0;\n }\n\n \/\/ Assign appropriate file names for the program\n inputFilename = argv[1];\n outputFilename = argv[2];\n\n \/\/ begin generation\n generateJSON();\n\n return EXIT_SUCCESS;\n}\n\n\/*\n * Generate JSON Method\n *\n * This method calls the appropriate methods in the vtk toolkit and outputs the\n * JSON file to the output file name specified\n *\n *\/\nvoid generateJSON()\n{\n \/\/ File stream for output file\n std::ofstream outputFile;\n outputFile.open(outputFilename.c_str());\n\n \/\/ begin the json file\n outputFile << \"{\\n\";\n\n \/\/ Reader to read in PLY File\n vtkSmartPointer<vtkPLYReader> reader =\n vtkSmartPointer<vtkPLYReader>::New();\n\n \/\/ Specify filename\n reader->SetFileName ( inputFilename.c_str() );\n\n \/\/ Call vtk pipeline to read in the file\n reader->Update();\n\n vtkDataSet * data;\n vtkIdType vert;\n vtkPolyData * pdata;\n vtkCellArray * faces;\n\n if (decAmount >= 1.0)\n {\n \/\/ Get the outpuyt for vertices\n data = reader->GetOutput();\n vert = data->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n pdata = reader->GetOutput();\n faces = pdata->GetPolys();\n\n }\n else if (decAmount < 0.0)\n {\n cout << \"Invalid Decimate Amount, Program will now exit\" << endl;\n exit(EXIT_FAILURE);\n } else\n {\n \/\/ create decimator\n vtkSmartPointer<vtkDecimatePro> decimate = vtkSmartPointer<vtkDecimatePro>::New();\n\n \/\/ set decimator to the selected file\n decimate->SetInputData(reader->GetOutput());\n\n \/\/ set target to reduce to, and set topology to be preserved\n decimate->PreserveTopologyOn();\n decimate->SetTargetReduction(decAmount);\n\n \/\/ start decimation\n decimate->Update();\n\n \/\/ Get the outpuyt for vertices\n data = decimate->GetOutput();\n vert = data->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n pdata = decimate->GetOutput();\n faces = pdata->GetPolys();\n }\n\n vtkIdType numCells = faces->GetNumberOfCells();\n vtkIdType cellLocation = 0;\n\n \/\/ Write the standard format header for the json file\n outputFile << \"\\\"metadata\\\":{\\\"formatVersion\\\":3,\\\"vertices\\\":\" << vert << \",\\\"faces\\\":\" << numCells << \",\\\"materials\\\":1},\\n\";\n outputFile << \"\\\"scale\\\":1.0,\\n\\\"materials\\\":[{\\\"DbgColor\\\":15658734,\\\"DbgIndex\\\":0,\\\"DbgName\\\":\\\"default\\\",\\\"vertexColors\\\": false}],\\n\";\n\n \/\/ Begin writing vertices\n outputFile << \"\\\"vertices\\\":[\";\n\n \/\/ Iterate over all the points and print them to the file\n for(vtkIdType i = 0; i < vert; i++)\n {\n double p[3];\n data->GetPoint(i, p);\n outputFile << p[0] << \",\" << p[1] << \",\" << p[2];\n if (i != vert - 1) outputFile << \",\"; \/\/ Avoid putting comma before end bracket\n }\n\n \/\/ End the vertices section\n outputFile << \"],\\n\";\n\n \/\/ Begin writing faces\n outputFile << \"\\\"faces\\\":[\";\n\n \/\/ Iterate over the faces and print them to file\n for (vtkIdType i = 0; i < numCells; i++)\n {\n vtkIdType numIDs;\n vtkIdType * pointIds;\n\n faces->GetCell(cellLocation, numIDs, pointIds);\n cellLocation += 1 + numIDs; \/\/ increment to include already printed faces\n\n for (vtkIdType j = 0; j < numIDs; j++)\n {\n \/\/ print to the file\n \/\/ printing the zero is for the bit mask signifying face type\n if (j == 0) outputFile << 0 << \",\";\n outputFile << pointIds[j];\n if (i != numCells - 1)\n {\n outputFile << \",\";\n }\n else\n {\n if(j != numIDs - 1) outputFile << \",\"; \/\/ avoid additional comma at end\n }\n }\n }\n\n \/\/ end faces section\n outputFile << \"]\\n\";\n\n \/\/ end the json file\n outputFile << \"}\\n\";\n\n \/\/ close file stream\n outputFile.close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Dr. Colin Hirsch and Daniel Frey\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/PEGTL\/\n\n#include <iostream>\n#include <string>\n#include <type_traits>\n#include <typeinfo>\n#include <vector>\n\n#include <tao\/pegtl.hpp>\n\nusing namespace tao::TAOCPP_PEGTL_NAMESPACE;\n\nnamespace parse_tree\n{\n template< typename >\n struct store_simple : std::false_type\n {\n };\n\n template< typename >\n struct store_content : std::false_type\n {\n };\n\n struct node\n {\n std::vector< std::unique_ptr< node > > children;\n const std::type_info* id = nullptr;\n const char* begin = nullptr;\n const char* end = nullptr;\n };\n\n struct state\n {\n std::vector< std::unique_ptr< node > > stack;\n\n state()\n {\n emplace_back();\n }\n\n const node& root() const\n {\n return *stack.front();\n }\n\n void emplace_back()\n {\n std::unique_ptr< node > r( new node );\n stack.emplace_back( std::move( r ) );\n }\n };\n\n template< typename Rule, bool = store_simple< Rule >::value, bool = store_content< Rule >::value >\n struct builder_impl;\n\n template< typename Rule >\n struct builder : builder_impl< Rule >\n {\n };\n\n template< typename Rule >\n struct builder_impl< Rule, false, false >\n : normal< Rule >\n {\n };\n\n template< typename Rule >\n struct builder_impl< Rule, true, true >\n : normal< Rule >\n {\n static_assert( sizeof( Rule ) == 0, \"error: both store_simple and store_content are set\" );\n };\n\n template< typename Rule >\n struct builder_impl< Rule, true, false >\n : normal< Rule >\n {\n template< typename Input >\n static void start( const Input&, state& s )\n {\n s.emplace_back();\n }\n\n template< typename Input >\n static void success( const Input&, state& s )\n {\n auto n = std::move( s.stack.back() );\n n->id = &typeid( Rule );\n s.stack.pop_back();\n s.stack.back()->children.emplace_back( std::move( n ) );\n }\n\n template< typename Input >\n static void failure( const Input&, state& s )\n {\n s.stack.pop_back();\n }\n };\n\n template< typename Rule >\n struct builder_impl< Rule, false, true >\n : normal< Rule >\n {\n template< typename Input >\n static void start( const Input& in, state& s )\n {\n s.emplace_back();\n s.stack.back()->begin = in.current();\n }\n\n template< typename Input >\n static void success( const Input& in, state& s )\n {\n auto n = std::move( s.stack.back() );\n n->id = &typeid( Rule );\n n->end = in.current();\n s.stack.pop_back();\n s.stack.back()->children.emplace_back( std::move( n ) );\n }\n\n template< typename Input >\n static void failure( const Input&, state& s )\n {\n s.stack.pop_back();\n }\n };\n\n void print_node( const node& n, const std::string& s = \"\" )\n {\n if( n.id ) {\n if( n.begin ) {\n std::cout << s << internal::demangle( n.id->name() ) << \" \\\"\" << std::string( n.begin, n.end ) << '\"' << std::endl;\n }\n else {\n std::cout << s << internal::demangle( n.id->name() ) << std::endl;\n }\n }\n else {\n std::cout << \"ROOT\" << std::endl;\n }\n if( !n.children.empty() ) {\n const auto s2 = s + \" \";\n for( auto& up : n.children ) {\n print_node( *up, s2 );\n }\n }\n }\n\n \/\/ clang-format off\n struct integer : plus< digit > {};\n struct variable : identifier {};\n\n struct plus : pad< one< '+' >, space > {};\n struct minus : pad< one< '-' >, space > {};\n struct multiply : pad< one< '*' >, space > {};\n struct divide : pad< one< '\/' >, space > {};\n\n struct open_bracket : seq< one< '(' >, star< space > > {};\n struct close_bracket : seq< star< space >, one< ')' > > {};\n\n struct expression;\n struct bracketed : seq< open_bracket, expression, close_bracket > {};\n struct value : sor< integer, variable, bracketed > {};\n struct product : list< value, sor< multiply, divide > > {};\n struct expression : list< product, sor< plus, minus > > {};\n\n struct grammar : must< expression, eof > {};\n\n template<> struct store_content< integer > : std::true_type {};\n template<> struct store_content< variable > : std::true_type {};\n template<> struct store_simple< plus > : std::true_type {};\n template<> struct store_simple< minus > : std::true_type {};\n template<> struct store_simple< multiply > : std::true_type {};\n template<> struct store_simple< divide > : std::true_type {};\n template<> struct store_simple< bracketed > : std::true_type {};\n template<> struct store_simple< product > : std::true_type {};\n template<> struct store_simple< expression > : std::true_type {};\n \/\/ clang-format on\n\n} \/\/ namespace parse_tree\n\nint main( int argc, char** argv )\n{\n for( int i = 1; i < argc; ++i ) {\n argv_input<> in( argv, i );\n\n parse_tree::state s;\n parse< parse_tree::grammar, nothing, parse_tree::builder >( in, s );\n print_node( s.root() );\n }\n return 0;\n}\n<commit_msg>Use actions to simplify\/transform the parse tree<commit_after>\/\/ Copyright (c) 2017 Dr. Colin Hirsch and Daniel Frey\n\/\/ Please see LICENSE for license or visit https:\/\/github.com\/taocpp\/PEGTL\/\n\n#include <iostream>\n#include <string>\n#include <type_traits>\n#include <typeinfo>\n#include <vector>\n\n#include <tao\/pegtl.hpp>\n\nusing namespace tao::TAOCPP_PEGTL_NAMESPACE;\n\nnamespace parse_tree\n{\n template< typename >\n struct store_simple : std::false_type\n {\n };\n\n template< typename >\n struct store_content : std::false_type\n {\n };\n\n struct node\n {\n std::vector< std::unique_ptr< node > > children;\n const std::type_info* id = nullptr;\n const char* begin = nullptr;\n const char* end = nullptr;\n };\n\n struct state\n {\n std::vector< std::unique_ptr< node > > stack;\n\n state()\n {\n emplace_back();\n }\n\n const node& root() const\n {\n return *stack.front();\n }\n\n void emplace_back()\n {\n std::unique_ptr< node > r( new node );\n stack.emplace_back( std::move( r ) );\n }\n };\n\n template< typename Rule, bool = store_simple< Rule >::value, bool = store_content< Rule >::value >\n struct builder_impl;\n\n template< typename Rule >\n struct builder : builder_impl< Rule >\n {\n };\n\n template< typename Rule >\n struct builder_impl< Rule, false, false >\n : normal< Rule >\n {\n };\n\n template< typename Rule >\n struct builder_impl< Rule, true, true >\n : normal< Rule >\n {\n static_assert( sizeof( Rule ) == 0, \"error: both store_simple and store_content are set\" );\n };\n\n template< typename Rule >\n struct builder_impl< Rule, true, false >\n : normal< Rule >\n {\n template< typename Input >\n static void start( const Input&, state& s )\n {\n s.emplace_back();\n }\n\n template< typename Input >\n static void success( const Input&, state& s )\n {\n auto n = std::move( s.stack.back() );\n n->id = &typeid( Rule );\n s.stack.pop_back();\n s.stack.back()->children.emplace_back( std::move( n ) );\n }\n\n template< typename Input >\n static void failure( const Input&, state& s )\n {\n s.stack.pop_back();\n }\n };\n\n template< typename Rule >\n struct action\n : nothing< Rule >\n {\n };\n\n template< typename Rule >\n struct builder_impl< Rule, false, true >\n : normal< Rule >\n {\n template< typename Input >\n static void start( const Input& in, state& s )\n {\n s.emplace_back();\n s.stack.back()->begin = in.current();\n }\n\n template< typename Input >\n static void success( const Input& in, state& s )\n {\n auto n = std::move( s.stack.back() );\n n->id = &typeid( Rule );\n n->end = in.current();\n s.stack.pop_back();\n s.stack.back()->children.emplace_back( std::move( n ) );\n }\n\n template< typename Input >\n static void failure( const Input&, state& s )\n {\n s.stack.pop_back();\n }\n };\n\n void print_node( const node& n, const std::string& s = \"\" )\n {\n if( n.id ) {\n if( n.begin ) {\n std::cout << s << internal::demangle( n.id->name() ) << \" \\\"\" << std::string( n.begin, n.end ) << '\"' << std::endl;\n }\n else {\n std::cout << s << internal::demangle( n.id->name() ) << std::endl;\n }\n }\n else {\n std::cout << \"ROOT\" << std::endl;\n }\n if( !n.children.empty() ) {\n const auto s2 = s + \" \";\n for( auto& up : n.children ) {\n print_node( *up, s2 );\n }\n }\n }\n\n \/\/ clang-format off\n struct integer : plus< digit > {};\n struct variable : identifier {};\n\n struct plus : pad< one< '+' >, space > {};\n struct minus : pad< one< '-' >, space > {};\n struct multiply : pad< one< '*' >, space > {};\n struct divide : pad< one< '\/' >, space > {};\n\n struct open_bracket : seq< one< '(' >, star< space > > {};\n struct close_bracket : seq< star< space >, one< ')' > > {};\n\n struct expression;\n struct bracketed : seq< open_bracket, expression, close_bracket > {};\n struct value : sor< integer, variable, bracketed > {};\n struct product : list< value, sor< multiply, divide > > {};\n struct expression : list< product, sor< plus, minus > > {};\n\n struct grammar : must< expression, eof > {};\n\n \/\/ select which rules in the grammar will produce parse tree nodes\n template<> struct store_content< integer > : std::true_type {};\n template<> struct store_content< variable > : std::true_type {};\n template<> struct store_simple< plus > : std::true_type {};\n template<> struct store_simple< minus > : std::true_type {};\n template<> struct store_simple< multiply > : std::true_type {};\n template<> struct store_simple< divide > : std::true_type {};\n template<> struct store_simple< product > : std::true_type {};\n template<> struct store_simple< expression > : std::true_type {};\n \/\/ clang-format on\n\n \/\/ use actions to transform the parse tree in order to simplify it\n template<>\n struct action< product >\n {\n template< typename Input >\n static void apply( const Input&, state& s )\n {\n auto& n = s.stack.back()->children.back();\n if( n->children.size() == 1 ) {\n n = std::move( n->children.back() );\n }\n }\n };\n\n} \/\/ namespace parse_tree\n\nint main( int argc, char** argv )\n{\n for( int i = 1; i < argc; ++i ) {\n argv_input<> in( argv, i );\n\n parse_tree::state s;\n parse< parse_tree::grammar, parse_tree::action, parse_tree::builder >( in, s );\n print_node( s.root() );\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ArcEmu MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.com\/>\n * Copyright (C) 2008 <http:\/\/www.ArcEmu.org\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n\/\/\n\/\/ MapCell.cpp\n\/\/\n#include \"StdAfx.h\"\n\nMapCell::~MapCell()\n{\n\tRemoveObjects();\n}\n\nvoid MapCell::Init(uint32 x, uint32 y, uint32 mapid, MapMgr *mapmgr)\n{\n\t_mapmgr = mapmgr;\n\t_active = false;\n\t_loaded = false;\n\t_playerCount = 0;\n\t_x=x;\n\t_y=y;\n\t_unloadpending=false;\n\t_objects.clear();\n}\n\nvoid MapCell::AddObject(Object *obj)\n{\n\tif(obj->IsPlayer())\n\t\t++_playerCount;\n\n\t_objects.insert(obj);\n}\n\nvoid MapCell::RemoveObject(Object *obj)\n{\n\tif(obj->IsPlayer())\n\t\t--_playerCount;\n\n\t_objects.erase(obj);\n}\n\nvoid MapCell::SetActivity(bool state)\n{\t\n\tif(!_active && state)\n\t{\n\t\t\/\/ Move all objects to active set.\n\t\tfor(ObjectSet::iterator itr = _objects.begin(); itr != _objects.end(); ++itr)\n\t\t{\n\t\t\tif(!(*itr)->Active && (*itr)->CanActivate())\n\t\t\t\t(*itr)->Activate(_mapmgr);\n\t\t}\n\n\t\tif(_unloadpending)\n\t\t\tCancelPendingUnload();\n\n\t\tif (sWorld.Collision) {\n\t\t\tCollideInterface.ActivateTile(_mapmgr->GetMapId(), _x\/8, _y\/8);\n\t\t}\n\t} else if(_active && !state)\n\t{\n\t\t\/\/ Move all objects from active set.\n\t\tfor(ObjectSet::iterator itr = _objects.begin(); itr != _objects.end(); ++itr)\n\t\t{\n\t\t\tif((*itr)->Active)\n\t\t\t\t(*itr)->Deactivate(_mapmgr);\n\t\t}\n\n\t\tif(sWorld.map_unload_time && !_unloadpending)\n\t\t\tQueueUnloadPending();\n\n\t\tif (sWorld.Collision) {\n\t\t\tCollideInterface.DeactivateTile(_mapmgr->GetMapId(), _x\/8, _y\/8);\n\t\t}\n\t}\n\n\t_active = state; \n\n}\nvoid MapCell::RemoveObjects()\n{\n\tObjectSet::iterator itr;\n\tuint32 count = 0;\n\t\/\/uint32 ltime = getMSTime();\n\n\t\/* delete objects in pending respawn state *\/\n\tfor(itr = _respawnObjects.begin(); itr != _respawnObjects.end(); ++itr)\n\t{\n\t\tswitch((*itr)->GetTypeId())\n\t\t{\n\t\tcase TYPEID_UNIT: {\n\t\t\t\tif( !(*itr)->IsPet() )\n\t\t\t\t{\n\t\t\t\t\t_mapmgr->_reusable_guids_creature.push_back( (*itr)->GetUIdFromGUID() );\n\t\t\t\t\tstatic_cast< Creature* >( *itr )->m_respawnCell=NULL;\n\t\t\t\t\tdelete static_cast< Creature* >( *itr );\n\t\t\t\t}\n\t\t\t}break;\n\n\t\tcase TYPEID_GAMEOBJECT: {\n\t\t\t_mapmgr->_reusable_guids_gameobject.push_back( (*itr)->GetUIdFromGUID() );\n\t\t\tstatic_cast< GameObject* >( *itr )->m_respawnCell=NULL;\n\t\t\tdelete static_cast< GameObject* >( *itr );\n\t\t\t}break;\n\t\t}\n\t}\n\t_respawnObjects.clear();\n\n\t\/\/This time it's simpler! We just remove everything :)\n\tfor(itr = _objects.begin(); itr != _objects.end(); )\n\t{\n\t\tcount++;\n\n\t\tObject *obj = (*itr);\n\n\t\titr++;\n\n\t\tif(!obj)\n\t\t\tcontinue;\n\n\t\tif( _unloadpending )\n\t\t{\n\t\t\tif(obj->GetTypeFromGUID() == HIGHGUID_TYPE_TRANSPORTER)\n\t\t\t\tcontinue;\n\n\t\t\tif(obj->GetTypeId()==TYPEID_CORPSE && obj->GetUInt32Value(CORPSE_FIELD_OWNER) != 0)\n\t\t\t\tcontinue;\n\n\t\t\tif(!obj->m_loadedFromDB)\n\t\t\t\tcontinue;\n\t\t}\n\n\n\n\t\tif( obj->Active )\n\t\t\tobj->Deactivate( _mapmgr );\n\n\t\tif( obj->IsInWorld() )\n\t\t\tobj->RemoveFromWorld( true );\n\n\t\tdelete obj;\n\t}\n\t_objects.clear();\n\n\t_playerCount = 0;\n\t_loaded = false;\n}\n\n\nvoid MapCell::LoadObjects(CellSpawns * sp)\n{\n\t_loaded = true;\n\tInstance * pInstance = _mapmgr->pInstance;\n\tInstanceBossInfoMap *bossInfoMap = objmgr.m_InstanceBossInfoMap[_mapmgr->GetMapId()];\n\n\tif(sp->CreatureSpawns.size())\/\/got creatures\n\t{\n\t\tfor(CreatureSpawnList::iterator i=sp->CreatureSpawns.begin();i!=sp->CreatureSpawns.end();i++)\n\t\t{\n\t\t\tuint32 respawnTimeOverride = 0;\n\t\t\tif(pInstance)\n\t\t\t{\n\t\t\t\tif(bossInfoMap != NULL && IS_PERSISTENT_INSTANCE(pInstance))\n\t\t\t\t{\n\t\t\t\t\tbool skip = false;\n\t\t\t\t\tfor(std::set<uint32>::iterator killedNpc = pInstance->m_killedNpcs.begin(); killedNpc != pInstance->m_killedNpcs.end(); ++killedNpc)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Do not spawn the killed boss.\n\t\t\t\t\t\tif((*killedNpc) == (*i)->entry)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tskip = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\/\/ Do not spawn the killed boss' trash.\n\t\t\t\t\t\tInstanceBossInfoMap::const_iterator bossInfo = bossInfoMap->find((*killedNpc));\n\t\t\t\t\t\tif (bossInfo != bossInfoMap->end() && bossInfo->second->trash.find((*i)->id) != bossInfo->second->trash.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tskip = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(skip)\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\tfor(InstanceBossInfoMap::iterator bossInfo = bossInfoMap->begin(); bossInfo != bossInfoMap->end(); ++bossInfo)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(pInstance->m_killedNpcs.find(bossInfo->second->creatureid) == pInstance->m_killedNpcs.end() && bossInfo->second->trash.find((*i)->id) != bossInfo->second->trash.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trespawnTimeOverride = bossInfo->second->trashRespawnOverride;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ No boss information available ... fallback ...\n\t\t\t\t\tif(pInstance->m_killedNpcs.find((*i)->id) != pInstance->m_killedNpcs.end())\n\t\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tCreature * c=_mapmgr->CreateCreature((*i)->entry);\n\n\t\t\tc->SetMapId(_mapmgr->GetMapId());\n\t\t\tc->SetInstanceID(_mapmgr->GetInstanceID());\n\t\t\tc->m_loadedFromDB = true;\n\t\t\tif(respawnTimeOverride > 0)\n\t\t\t\tc->m_respawnTimeOverride = respawnTimeOverride;\n\n if(c->Load(*i, _mapmgr->iInstanceMode, _mapmgr->GetMapInfo()))\n\t\t\t{\n\t\t\t\tif(!c->CanAddToWorld())\n\t\t\t\t\tdelete c;\n\n\t\t\t\tc->PushToWorld(_mapmgr);\n\t\t\t}\n\t\t\telse\n\t\t\t\tdelete c;\/\/missing proto or smth of that kind\n\t\t}\n\t}\n\n\tif(sp->GOSpawns.size())\/\/got GOs\n\t{\n\t\tfor(GOSpawnList::iterator i=sp->GOSpawns.begin();i!=sp->GOSpawns.end();i++)\n\t\t{\n\t\t\tGameObject * go=_mapmgr->CreateGameObject((*i)->entry);\n\t\t\tgo->SetInstanceID(_mapmgr->GetInstanceID());\n\t\t\tif(go->Load(*i))\n\t\t\t{\n\t\t\t\t\/\/uint32 state = go->GetUInt32Value(GAMEOBJECT_STATE);\n\n\t\t\t\t\/\/ FIXME - burlex\n\t\t\t\t\/*\n\t\t\t\tif(pInstance && pInstance->FindObject((*i)->stateNpcLink))\n\t\t\t\t{\n\t\t\t\t\tgo->SetUInt32Value(GAMEOBJECT_STATE, (state ? 0 : 1));\n\t\t\t\t}*\/\t\t\t \n\n\t\t\t\tgo->m_loadedFromDB = true;\n\t\t\t\tgo->PushToWorld(_mapmgr);\n\t\t\t}\n\t\t\telse\n\t\t\t\tdelete go;\/\/missing proto or smth of that kind\n\t\t}\n\t}\n}\n\n\nvoid MapCell::QueueUnloadPending()\n{\n\tif(_unloadpending)\n\t\treturn;\n\n\t_unloadpending = true;\n\t\/\/Log.Debug(\"MapCell\", \"Queueing pending unload of cell %u %u\", _x, _y);\n\tsEventMgr.AddEvent(_mapmgr, &MapMgr::UnloadCell,(uint32)_x,(uint32)_y,MAKE_CELL_EVENT(_x,_y),sWorld.map_unload_time * 1000,1,0);\n}\n\nvoid MapCell::CancelPendingUnload()\n{\n\t\/\/Log.Debug(\"MapCell\", \"Cancelling pending unload of cell %u %u\", _x, _y);\n\tif(!_unloadpending)\n\t\treturn;\n\n\tsEventMgr.RemoveEvents(_mapmgr,MAKE_CELL_EVENT(_x,_y));\n}\n\nvoid MapCell::Unload()\n{\n\t\/\/Log.Debug(\"MapCell\", \"Unloading cell %u %u\", _x, _y);\n\tASSERT(_unloadpending);\n\tif(_active)\n\t\treturn;\n\n\tRemoveObjects();\n\t_unloadpending=false;\n}\n<commit_msg>Crashfix by 0x0f7afc68<commit_after>\/*\n * ArcEmu MMORPG Server\n * Copyright (C) 2005-2007 Ascent Team <http:\/\/www.ascentemu.com\/>\n * Copyright (C) 2008 <http:\/\/www.ArcEmu.org\/>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n\/\/\n\/\/ MapCell.cpp\n\/\/\n#include \"StdAfx.h\"\n\nMapCell::~MapCell()\n{\n\tRemoveObjects();\n}\n\nvoid MapCell::Init(uint32 x, uint32 y, uint32 mapid, MapMgr *mapmgr)\n{\n\t_mapmgr = mapmgr;\n\t_active = false;\n\t_loaded = false;\n\t_playerCount = 0;\n\t_x=x;\n\t_y=y;\n\t_unloadpending=false;\n\t_objects.clear();\n}\n\nvoid MapCell::AddObject(Object *obj)\n{\n\tif(obj->IsPlayer())\n\t\t++_playerCount;\n\n\t_objects.insert(obj);\n}\n\nvoid MapCell::RemoveObject(Object *obj)\n{\n\tif(obj->IsPlayer())\n\t\t--_playerCount;\n\n\t_objects.erase(obj);\n}\n\nvoid MapCell::SetActivity(bool state)\n{\t\n\tif(!_active && state)\n\t{\n\t\t\/\/ Move all objects to active set.\n\t\tfor(ObjectSet::iterator itr = _objects.begin(); itr != _objects.end(); ++itr)\n\t\t{\n\t\t\tif(!(*itr)->Active && (*itr)->CanActivate())\n\t\t\t\t(*itr)->Activate(_mapmgr);\n\t\t}\n\n\t\tif(_unloadpending)\n\t\t\tCancelPendingUnload();\n\n\t\tif (sWorld.Collision) {\n\t\t\tCollideInterface.ActivateTile(_mapmgr->GetMapId(), _x\/8, _y\/8);\n\t\t}\n\t} else if(_active && !state)\n\t{\n\t\t\/\/ Move all objects from active set.\n\t\tfor(ObjectSet::iterator itr = _objects.begin(); itr != _objects.end(); ++itr)\n\t\t{\n\t\t\tif((*itr)->Active)\n\t\t\t\t(*itr)->Deactivate(_mapmgr);\n\t\t}\n\n\t\tif(sWorld.map_unload_time && !_unloadpending)\n\t\t\tQueueUnloadPending();\n\n\t\tif (sWorld.Collision) {\n\t\t\tCollideInterface.DeactivateTile(_mapmgr->GetMapId(), _x\/8, _y\/8);\n\t\t}\n\t}\n\n\t_active = state; \n\n}\nvoid MapCell::RemoveObjects()\n{\n\tObjectSet::iterator itr;\n\tuint32 count = 0;\n\t\/\/uint32 ltime = getMSTime();\n\n\t\/* delete objects in pending respawn state *\/\n\tfor(itr = _respawnObjects.begin(); itr != _respawnObjects.end(); ++itr)\n\t{\n\t\tswitch((*itr)->GetTypeId())\n\t\t{\n\t\tcase TYPEID_UNIT: {\n\t\t\t\tif( !(*itr)->IsPet() )\n\t\t\t\t{\n\t\t\t\t\t_mapmgr->_reusable_guids_creature.push_back( (*itr)->GetUIdFromGUID() );\n\t\t\t\t\tstatic_cast< Creature* >( *itr )->m_respawnCell=NULL;\n\t\t\t\t\tdelete static_cast< Creature* >( *itr );\n\t\t\t\t}\n\t\t\t}break;\n\n\t\tcase TYPEID_GAMEOBJECT: {\n\t\t\t_mapmgr->_reusable_guids_gameobject.push_back( (*itr)->GetUIdFromGUID() );\n\t\t\tstatic_cast< GameObject* >( *itr )->m_respawnCell=NULL;\n\t\t\tdelete static_cast< GameObject* >( *itr );\n\t\t\t}break;\n\t\t}\n\t}\n\t_respawnObjects.clear();\n\n\t\/\/This time it's simpler! We just remove everything :)\n\tfor(itr = _objects.begin(); itr != _objects.end(); )\n\t{\n\t\tcount++;\n\n\t\tObject *obj = (*itr);\n\n\t\titr++;\n\n\t\tif(!obj || _unloadpending)\n\t\t\tcontinue;\n\n\t\tif( obj->Active )\n\t\t\tobj->Deactivate( _mapmgr );\n\n\t\tif( obj->IsInWorld() )\n\t\t\tobj->RemoveFromWorld( true );\n\n\t\tdelete obj;\n\t}\n\t_objects.clear();\n\n\t_playerCount = 0;\n\t_loaded = false;\n}\n\n\nvoid MapCell::LoadObjects(CellSpawns * sp)\n{\n\t_loaded = true;\n\tInstance * pInstance = _mapmgr->pInstance;\n\tInstanceBossInfoMap *bossInfoMap = objmgr.m_InstanceBossInfoMap[_mapmgr->GetMapId()];\n\n\tif(sp->CreatureSpawns.size())\/\/got creatures\n\t{\n\t\tfor(CreatureSpawnList::iterator i=sp->CreatureSpawns.begin();i!=sp->CreatureSpawns.end();i++)\n\t\t{\n\t\t\tuint32 respawnTimeOverride = 0;\n\t\t\tif(pInstance)\n\t\t\t{\n\t\t\t\tif(bossInfoMap != NULL && IS_PERSISTENT_INSTANCE(pInstance))\n\t\t\t\t{\n\t\t\t\t\tbool skip = false;\n\t\t\t\t\tfor(std::set<uint32>::iterator killedNpc = pInstance->m_killedNpcs.begin(); killedNpc != pInstance->m_killedNpcs.end(); ++killedNpc)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Do not spawn the killed boss.\n\t\t\t\t\t\tif((*killedNpc) == (*i)->entry)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tskip = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\/\/ Do not spawn the killed boss' trash.\n\t\t\t\t\t\tInstanceBossInfoMap::const_iterator bossInfo = bossInfoMap->find((*killedNpc));\n\t\t\t\t\t\tif (bossInfo != bossInfoMap->end() && bossInfo->second->trash.find((*i)->id) != bossInfo->second->trash.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tskip = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(skip)\n\t\t\t\t\t\tcontinue;\n\n\t\t\t\t\tfor(InstanceBossInfoMap::iterator bossInfo = bossInfoMap->begin(); bossInfo != bossInfoMap->end(); ++bossInfo)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(pInstance->m_killedNpcs.find(bossInfo->second->creatureid) == pInstance->m_killedNpcs.end() && bossInfo->second->trash.find((*i)->id) != bossInfo->second->trash.end())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\trespawnTimeOverride = bossInfo->second->trashRespawnOverride;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ No boss information available ... fallback ...\n\t\t\t\t\tif(pInstance->m_killedNpcs.find((*i)->id) != pInstance->m_killedNpcs.end())\n\t\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tCreature * c=_mapmgr->CreateCreature((*i)->entry);\n\n\t\t\tc->SetMapId(_mapmgr->GetMapId());\n\t\t\tc->SetInstanceID(_mapmgr->GetInstanceID());\n\t\t\tc->m_loadedFromDB = true;\n\t\t\tif(respawnTimeOverride > 0)\n\t\t\t\tc->m_respawnTimeOverride = respawnTimeOverride;\n\n if(c->Load(*i, _mapmgr->iInstanceMode, _mapmgr->GetMapInfo()))\n\t\t\t{\n\t\t\t\tif(!c->CanAddToWorld())\n\t\t\t\t\tdelete c;\n\n\t\t\t\tc->PushToWorld(_mapmgr);\n\t\t\t}\n\t\t\telse\n\t\t\t\tdelete c;\/\/missing proto or smth of that kind\n\t\t}\n\t}\n\n\tif(sp->GOSpawns.size())\/\/got GOs\n\t{\n\t\tfor(GOSpawnList::iterator i=sp->GOSpawns.begin();i!=sp->GOSpawns.end();i++)\n\t\t{\n\t\t\tGameObject * go=_mapmgr->CreateGameObject((*i)->entry);\n\t\t\tgo->SetInstanceID(_mapmgr->GetInstanceID());\n\t\t\tif(go->Load(*i))\n\t\t\t{\n\t\t\t\t\/\/uint32 state = go->GetUInt32Value(GAMEOBJECT_STATE);\n\n\t\t\t\t\/\/ FIXME - burlex\n\t\t\t\t\/*\n\t\t\t\tif(pInstance && pInstance->FindObject((*i)->stateNpcLink))\n\t\t\t\t{\n\t\t\t\t\tgo->SetUInt32Value(GAMEOBJECT_STATE, (state ? 0 : 1));\n\t\t\t\t}*\/\t\t\t \n\n\t\t\t\tgo->m_loadedFromDB = true;\n\t\t\t\tgo->PushToWorld(_mapmgr);\n\t\t\t}\n\t\t\telse\n\t\t\t\tdelete go;\/\/missing proto or smth of that kind\n\t\t}\n\t}\n}\n\n\nvoid MapCell::QueueUnloadPending()\n{\n\tif(_unloadpending)\n\t\treturn;\n\n\t_unloadpending = true;\n\t\/\/Log.Debug(\"MapCell\", \"Queueing pending unload of cell %u %u\", _x, _y);\n\tsEventMgr.AddEvent(_mapmgr, &MapMgr::UnloadCell,(uint32)_x,(uint32)_y,MAKE_CELL_EVENT(_x,_y),sWorld.map_unload_time * 1000,1,0);\n}\n\nvoid MapCell::CancelPendingUnload()\n{\n\t\/\/Log.Debug(\"MapCell\", \"Cancelling pending unload of cell %u %u\", _x, _y);\n\tif(!_unloadpending)\n\t\treturn;\n\n\tsEventMgr.RemoveEvents(_mapmgr,MAKE_CELL_EVENT(_x,_y));\n}\n\nvoid MapCell::Unload()\n{\n\t\/\/Log.Debug(\"MapCell\", \"Unloading cell %u %u\", _x, _y);\n\tASSERT(_unloadpending);\n\tif(_active)\n\t\treturn;\n\n\tRemoveObjects();\n\t_unloadpending=false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Peloton\n\/\/\n\/\/ insert_executor.cpp\n\/\/\n\/\/ Identification: src\/executor\/insert_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"executor\/insert_executor.h\"\n\n#include \"catalog\/manager.h\"\n#include \"common\/logger.h\"\n#include \"common\/pool.h\"\n#include \"concurrency\/transaction_manager_factory.h\"\n#include \"executor\/logical_tile.h\"\n#include \"executor\/executor_context.h\"\n#include \"expression\/container_tuple.h\"\n#include \"planner\/insert_plan.h\"\n#include \"storage\/data_table.h\"\n#include \"storage\/tuple_iterator.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor for insert executor.\n * @param node Insert node corresponding to this executor.\n *\/\nInsertExecutor::InsertExecutor(const planner::AbstractPlan *node,\n ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool InsertExecutor::DInit() {\n PL_ASSERT(children_.size() == 0 || children_.size() == 1);\n PL_ASSERT(executor_context_);\n\n done_ = false;\n return true;\n}\n\n\/**\n * @brief Adds a column to the logical tile, using the position lists.\n * @return true on success, false otherwise.\n *\/\nbool InsertExecutor::DExecute() {\n if (done_) return false;\n\n PL_ASSERT(!done_);\n PL_ASSERT(executor_context_ != nullptr);\n\n const planner::InsertPlan &node = GetPlanNode<planner::InsertPlan>();\n storage::DataTable *target_table = node.GetTable();\n oid_t bulk_insert_count = node.GetBulkInsertCount();\n\n auto &transaction_manager =\n concurrency::TransactionManagerFactory::GetInstance();\n\n if(!target_table) {\n\t transaction_manager.SetTransactionResult(\n\t peloton::Result::RESULT_FAILURE);\n\t return false;\n }\n\n LOG_TRACE(\"Number of tuples in table before insert: %lu\",\n target_table->GetTupleCount());\n auto executor_pool = executor_context_->GetExecutorContextPool();\n\n \/\/ Inserting a logical tile.\n if (children_.size() == 1) {\n LOG_TRACE(\"Insert executor :: 1 child \");\n\n if (!children_[0]->Execute()) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> logical_tile(children_[0]->GetOutput());\n PL_ASSERT(logical_tile.get() != nullptr);\n auto target_table_schema = target_table->GetSchema();\n auto column_count = target_table_schema->GetColumnCount();\n\n std::unique_ptr<storage::Tuple> tuple(\n new storage::Tuple(target_table_schema, true));\n\n \/\/ Go over the logical tile\n for (oid_t tuple_id : *logical_tile) {\n expression::ContainerTuple<LogicalTile> cur_tuple(logical_tile.get(),\n tuple_id);\n\n \/\/ Materialize the logical tile tuple\n for (oid_t column_itr = 0; column_itr < column_count; column_itr++) {\n tuple->SetValue(column_itr, cur_tuple.GetValue(column_itr),\n executor_pool);\n }\n\n ItemPointer *index_entry_ptr = nullptr;\n peloton::ItemPointer location = target_table->InsertTuple(tuple.get(), &index_entry_ptr);\n\n if (location.block == INVALID_OID) {\n transaction_manager.SetTransactionResult(\n peloton::Result::RESULT_FAILURE);\n return false;\n }\n\n transaction_manager.PerformInsert(location, index_entry_ptr);\n\n executor_context_->num_processed += 1; \/\/ insert one\n }\n\n return true;\n }\n \/\/ Inserting a collection of tuples from plan node\n else if (children_.size() == 0) {\n LOG_TRACE(\"Insert executor :: 0 child \");\n\n \/\/ Extract expressions from plan node and construct the tuple.\n \/\/ For now we just handle a single tuple\n auto schema = target_table->GetSchema();\n auto project_info = node.GetProjectInfo();\n auto tuple = node.GetTuple();\n std::unique_ptr<storage::Tuple> project_tuple;\n\n \/\/ Check if this is not a raw tuple\n if (tuple == nullptr) {\n \/\/ Otherwise, there must exist a project info\n PL_ASSERT(project_info);\n \/\/ There should be no direct maps\n PL_ASSERT(project_info->GetDirectMapList().size() == 0);\n\n project_tuple.reset(new storage::Tuple(schema, true));\n\n for (auto target : project_info->GetTargetList()) {\n peloton::Value value =\n target.second->Evaluate(nullptr, nullptr, executor_context_);\n project_tuple->SetValue(target.first, value, executor_pool);\n }\n\n \/\/ Set tuple to point to temporary project tuple\n tuple = project_tuple.get();\n }\n\n \/\/ Bulk Insert Mode\n for (oid_t insert_itr = 0; insert_itr < bulk_insert_count; insert_itr++) {\n\n \/\/ Carry out insertion\n ItemPointer *index_entry_ptr = nullptr;\n ItemPointer location = target_table->InsertTuple(tuple, &index_entry_ptr);\n LOG_TRACE(\"Inserted into location: %u, %u\", location.block,\n location.offset);\n\n if (location.block == INVALID_OID) {\n LOG_TRACE(\"Failed to Insert. Set txn failure.\");\n transaction_manager.SetTransactionResult(Result::RESULT_FAILURE);\n return false;\n }\n\n transaction_manager.PerformInsert(location, index_entry_ptr);\n \n LOG_TRACE(\"Number of tuples in table after insert: %lu\",\n target_table->GetTupleCount());\n\n executor_context_->num_processed += 1; \/\/ insert one\n }\n\n done_ = true;\n return true;\n }\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<commit_msg>clean up insert_executor<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Peloton\n\/\/\n\/\/ insert_executor.cpp\n\/\/\n\/\/ Identification: src\/executor\/insert_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\n#include \"executor\/insert_executor.h\"\n\n#include \"catalog\/manager.h\"\n#include \"common\/logger.h\"\n#include \"common\/pool.h\"\n#include \"concurrency\/transaction_manager_factory.h\"\n#include \"executor\/logical_tile.h\"\n#include \"executor\/executor_context.h\"\n#include \"expression\/container_tuple.h\"\n#include \"planner\/insert_plan.h\"\n#include \"storage\/data_table.h\"\n#include \"storage\/tuple_iterator.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor for insert executor.\n * @param node Insert node corresponding to this executor.\n *\/\nInsertExecutor::InsertExecutor(const planner::AbstractPlan *node,\n ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool InsertExecutor::DInit() {\n PL_ASSERT(children_.size() == 0 || children_.size() == 1);\n PL_ASSERT(executor_context_);\n\n done_ = false;\n return true;\n}\n\n\/**\n * @brief Adds a column to the logical tile, using the position lists.\n * @return true on success, false otherwise.\n *\/\nbool InsertExecutor::DExecute() {\n if (done_) return false;\n\n PL_ASSERT(!done_);\n PL_ASSERT(executor_context_ != nullptr);\n\n const planner::InsertPlan &node = GetPlanNode<planner::InsertPlan>();\n storage::DataTable *target_table = node.GetTable();\n oid_t bulk_insert_count = node.GetBulkInsertCount();\n\n auto &transaction_manager =\n concurrency::TransactionManagerFactory::GetInstance();\n\n if(!target_table) {\n\t transaction_manager.SetTransactionResult(\n\t peloton::Result::RESULT_FAILURE);\n\t return false;\n }\n\n LOG_TRACE(\"Number of tuples in table before insert: %lu\",\n target_table->GetTupleCount());\n auto executor_pool = executor_context_->GetExecutorContextPool();\n\n \/\/ Inserting a logical tile.\n if (children_.size() == 1) {\n LOG_TRACE(\"Insert executor :: 1 child \");\n\n if (!children_[0]->Execute()) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> logical_tile(children_[0]->GetOutput());\n PL_ASSERT(logical_tile.get() != nullptr);\n auto target_table_schema = target_table->GetSchema();\n auto column_count = target_table_schema->GetColumnCount();\n\n std::unique_ptr<storage::Tuple> tuple(\n new storage::Tuple(target_table_schema, true));\n\n \/\/ Go over the logical tile\n for (oid_t tuple_id : *logical_tile) {\n expression::ContainerTuple<LogicalTile> cur_tuple(logical_tile.get(),\n tuple_id);\n\n \/\/ Materialize the logical tile tuple\n for (oid_t column_itr = 0; column_itr < column_count; column_itr++) {\n tuple->SetValue(column_itr, cur_tuple.GetValue(column_itr),\n executor_pool);\n }\n\n \/\/ insert tuple into the table.\n ItemPointer *index_entry_ptr = nullptr;\n peloton::ItemPointer location = target_table->InsertTuple(tuple.get(), &index_entry_ptr);\n\n \/\/ it is possible that some concurrent transactions have inserted the same tuple.\n \/\/ in this case, abort the transaction.\n if (location.block == INVALID_OID) {\n transaction_manager.SetTransactionResult(\n peloton::Result::RESULT_FAILURE);\n return false;\n }\n\n transaction_manager.PerformInsert(location, index_entry_ptr);\n\n executor_context_->num_processed += 1; \/\/ insert one\n }\n\n return true;\n }\n \/\/ Inserting a collection of tuples from plan node\n else if (children_.size() == 0) {\n LOG_TRACE(\"Insert executor :: 0 child \");\n\n \/\/ Extract expressions from plan node and construct the tuple.\n \/\/ For now we just handle a single tuple\n auto schema = target_table->GetSchema();\n auto project_info = node.GetProjectInfo();\n auto tuple = node.GetTuple();\n std::unique_ptr<storage::Tuple> project_tuple;\n\n \/\/ Check if this is not a raw tuple\n if (tuple == nullptr) {\n \/\/ Otherwise, there must exist a project info\n PL_ASSERT(project_info);\n \/\/ There should be no direct maps\n PL_ASSERT(project_info->GetDirectMapList().size() == 0);\n\n project_tuple.reset(new storage::Tuple(schema, true));\n\n for (auto target : project_info->GetTargetList()) {\n peloton::Value value =\n target.second->Evaluate(nullptr, nullptr, executor_context_);\n project_tuple->SetValue(target.first, value, executor_pool);\n }\n\n \/\/ Set tuple to point to temporary project tuple\n tuple = project_tuple.get();\n }\n\n \/\/ Bulk Insert Mode\n for (oid_t insert_itr = 0; insert_itr < bulk_insert_count; insert_itr++) {\n\n \/\/ Carry out insertion\n ItemPointer *index_entry_ptr = nullptr;\n ItemPointer location = target_table->InsertTuple(tuple, &index_entry_ptr);\n LOG_TRACE(\"Inserted into location: %u, %u\", location.block,\n location.offset);\n\n if (location.block == INVALID_OID) {\n LOG_TRACE(\"Failed to Insert. Set txn failure.\");\n transaction_manager.SetTransactionResult(Result::RESULT_FAILURE);\n return false;\n }\n\n transaction_manager.PerformInsert(location, index_entry_ptr);\n \n LOG_TRACE(\"Number of tuples in table after insert: %lu\",\n target_table->GetTupleCount());\n\n executor_context_->num_processed += 1; \/\/ insert one\n }\n\n done_ = true;\n return true;\n }\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2015 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"tessellation_cache.h\"\n\n#include <tbb\/scalable_allocator.h>\nusing namespace tbb;\n\nnamespace embree\n{\n\n#if defined (__MIC__)\n#define USE_TBB_ALLOCATOR 1\n#else\n#define USE_TBB_ALLOCATOR 0\n#endif\n\n \/\/void*scalable_aligned_malloc(size_t size, size_t align);\n \/\/void scalable_aligned_free(void* ptr );\n \/\/void*scalable_aligned_realloc(void* ptr,size_t size,size_t align);\n\n \n \/* alloc cache memory *\/\n float *alloc_tessellation_cache_mem(const size_t blocks)\n {\n \/\/DBG_PRINT(blocks);\n\n#if USE_TBB_ALLOCATOR == 1\n return (float*)scalable_aligned_malloc(64 * blocks,64);\n#else\n return (float*)_mm_malloc(64 * blocks,64);\n#endif\n }\n \n \/* free cache memory *\/\n void free_tessellation_cache_mem(void *mem, const size_t blocks)\n {\n assert(mem);\n#if USE_TBB_ALLOCATOR == 1\n scalable_aligned_free(mem);\n#else\n _mm_free(mem);\n#endif\n }\n\n \n AtomicCounter SharedTessellationCacheStats::cache_accesses = 0;\n AtomicCounter SharedTessellationCacheStats::cache_hits = 0;\n AtomicCounter SharedTessellationCacheStats::cache_misses = 0;\n AtomicCounter SharedTessellationCacheStats::cache_evictions = 0; \n \n void SharedTessellationCacheStats::printStats()\n {\n DBG_PRINT(cache_accesses);\n DBG_PRINT(cache_misses);\n DBG_PRINT(cache_hits);\n DBG_PRINT(cache_evictions);\n DBG_PRINT(100.0f * cache_hits \/ cache_accesses);\n assert(cache_hits + cache_misses == cache_accesses); \n }\n\n void SharedTessellationCacheStats::clearStats()\n {\n SharedTessellationCacheStats::cache_accesses = 0;\n SharedTessellationCacheStats::cache_hits = 0;\n SharedTessellationCacheStats::cache_misses = 0;\n SharedTessellationCacheStats::cache_evictions = 0; \n }\n\n\n\n AtomicCounter DistributedTessellationCacheStats::cache_accesses = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_hits = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_misses = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_evictions = 0; \n \n void DistributedTessellationCacheStats::printStats()\n {\n DBG_PRINT(cache_accesses);\n DBG_PRINT(cache_misses);\n DBG_PRINT(cache_hits);\n DBG_PRINT(cache_evictions);\n DBG_PRINT(100.0f * cache_hits \/ cache_accesses);\n assert(cache_hits + cache_misses == cache_accesses); \n }\n\n\n void DistributedTessellationCacheStats::clearStats()\n {\n DistributedTessellationCacheStats::cache_accesses = 0;\n DistributedTessellationCacheStats::cache_hits = 0;\n DistributedTessellationCacheStats::cache_misses = 0;\n DistributedTessellationCacheStats::cache_evictions = 0; \n }\n \n \/\/ AtomicCounter TessellationCache::cache_accesses = 0;\n \/\/ AtomicCounter TessellationCache::cache_hits = 0;\n \/\/ AtomicCounter TessellationCache::cache_misses = 0;\n \/\/ AtomicCounter TessellationCache::cache_clears = 0;\n \/\/ AtomicCounter TessellationCache::cache_evictions = 0; \n\n};\n\nextern \"C\" void printTessCacheStats()\n{\n DBG_PRINT(\"SHARED TESSELLATION CACHE\");\n embree::SharedTessellationCacheStats::printStats();\n embree::SharedTessellationCacheStats::clearStats();\n#if 1\n DBG_PRINT(\"PER THREAD TESSELLATION CACHE\"); \n embree::DistributedTessellationCacheStats::printStats();\n embree::DistributedTessellationCacheStats::clearStats();\n#else\n DBG_PRINT(\"PER THREAD TESSELLATION CACHE\"); \n embree::TessellationCache::printStats();\n embree::TessellationCache::clearStats();\n#endif \n}\n<commit_msg>complie fix<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2015 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#if defined (__MIC__)\n#define USE_TBB_ALLOCATOR 1\n#else\n#define USE_TBB_ALLOCATOR 0\n#endif\n\n#include \"tessellation_cache.h\"\n\n#if USE_TBB_ALLOCATOR == 1\n#include <tbb\/scalable_allocator.h>\nusing namespace tbb;\n#endif\n\nnamespace embree\n{\n\n\n \/\/void*scalable_aligned_malloc(size_t size, size_t align);\n \/\/void scalable_aligned_free(void* ptr );\n \/\/void*scalable_aligned_realloc(void* ptr,size_t size,size_t align);\n\n \n \/* alloc cache memory *\/\n float *alloc_tessellation_cache_mem(const size_t blocks)\n {\n \/\/DBG_PRINT(blocks);\n\n#if USE_TBB_ALLOCATOR == 1\n return (float*)scalable_aligned_malloc(64 * blocks,64);\n#else\n return (float*)_mm_malloc(64 * blocks,64);\n#endif\n }\n \n \/* free cache memory *\/\n void free_tessellation_cache_mem(void *mem, const size_t blocks)\n {\n assert(mem);\n#if USE_TBB_ALLOCATOR == 1\n scalable_aligned_free(mem);\n#else\n _mm_free(mem);\n#endif\n }\n\n \n AtomicCounter SharedTessellationCacheStats::cache_accesses = 0;\n AtomicCounter SharedTessellationCacheStats::cache_hits = 0;\n AtomicCounter SharedTessellationCacheStats::cache_misses = 0;\n AtomicCounter SharedTessellationCacheStats::cache_evictions = 0; \n \n void SharedTessellationCacheStats::printStats()\n {\n DBG_PRINT(cache_accesses);\n DBG_PRINT(cache_misses);\n DBG_PRINT(cache_hits);\n DBG_PRINT(cache_evictions);\n DBG_PRINT(100.0f * cache_hits \/ cache_accesses);\n assert(cache_hits + cache_misses == cache_accesses); \n }\n\n void SharedTessellationCacheStats::clearStats()\n {\n SharedTessellationCacheStats::cache_accesses = 0;\n SharedTessellationCacheStats::cache_hits = 0;\n SharedTessellationCacheStats::cache_misses = 0;\n SharedTessellationCacheStats::cache_evictions = 0; \n }\n\n\n\n AtomicCounter DistributedTessellationCacheStats::cache_accesses = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_hits = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_misses = 0;\n AtomicCounter DistributedTessellationCacheStats::cache_evictions = 0; \n \n void DistributedTessellationCacheStats::printStats()\n {\n DBG_PRINT(cache_accesses);\n DBG_PRINT(cache_misses);\n DBG_PRINT(cache_hits);\n DBG_PRINT(cache_evictions);\n DBG_PRINT(100.0f * cache_hits \/ cache_accesses);\n assert(cache_hits + cache_misses == cache_accesses); \n }\n\n\n void DistributedTessellationCacheStats::clearStats()\n {\n DistributedTessellationCacheStats::cache_accesses = 0;\n DistributedTessellationCacheStats::cache_hits = 0;\n DistributedTessellationCacheStats::cache_misses = 0;\n DistributedTessellationCacheStats::cache_evictions = 0; \n }\n \n \/\/ AtomicCounter TessellationCache::cache_accesses = 0;\n \/\/ AtomicCounter TessellationCache::cache_hits = 0;\n \/\/ AtomicCounter TessellationCache::cache_misses = 0;\n \/\/ AtomicCounter TessellationCache::cache_clears = 0;\n \/\/ AtomicCounter TessellationCache::cache_evictions = 0; \n\n};\n\nextern \"C\" void printTessCacheStats()\n{\n DBG_PRINT(\"SHARED TESSELLATION CACHE\");\n embree::SharedTessellationCacheStats::printStats();\n embree::SharedTessellationCacheStats::clearStats();\n#if 1\n DBG_PRINT(\"PER THREAD TESSELLATION CACHE\"); \n embree::DistributedTessellationCacheStats::printStats();\n embree::DistributedTessellationCacheStats::clearStats();\n#else\n DBG_PRINT(\"PER THREAD TESSELLATION CACHE\"); \n embree::TessellationCache::printStats();\n embree::TessellationCache::clearStats();\n#endif \n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qfeedbackplugininterfaces.h\"\n#include \"qfeedbackplugin_p.h\"\n#include \"qfeedbackeffect_p.h\"\n#include \"qmobilitypluginsearch.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QStringList>\n#include <QtCore\/QDir>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QHash>\n#include <QDebug>\n\nQTM_BEGIN_NAMESPACE\n\n\/*!\n \\class QFeedbackInterface\n \\ingroup feedback\n \\inmodule QtFeedback\n\n \\brief The QFeedbackInterface class is the base class for plugins providing feedback.\n\n This interface gives the possibility to report errors from within a backend plugin.\n*\/\n\n\/*!\n \\fn QFeedbackInterface::reportError(const QFeedbackEffect *effect, QFeedbackEffect::ErrorType error)\n\n Allows a plugin to report the specified \\a error whenever necessary. Errors most likely can happen\n trying to play or pause an effect, which should be supplied as the parameter \\a effect.\n*\/\n\n\/*!\n \\enum QFeedbackInterface::PluginPriority\n\n This enum describes the priority that the plugin should have in case more than one of the same type (Haptics or Theme) is found.\n If more than one plugin has the same priority, the first one that has been loaded will be used. However, multiple\n file effect plugins can be loaded at the same time.\n \n \\value PluginLowPriority The plugin will have a low priority. This is usually the case for\n platform specific-APIs.\n\n \\value PluginNormalPriority The plugin will have a normal priority. \n This is usually the case for advanced technologies.\n\n \\value PluginHighPriority The plugin will have higher priority. Use this priority if you \n want your own plugin to be used.\n*\/\n\n\nvoid QFeedbackInterface::reportError(const QFeedbackEffect *effect, QFeedbackEffect::ErrorType error)\n{\n if (effect)\n emit effect->error(error);\n}\n\n\n\/\/ These are really useless docs, so I've marked them as internal\n\/*!\n \\internal\n \\fn QFeedbackThemeInterface::~QFeedbackThemeInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackFileInterface::~QFeedbackFileInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackHapticsInterface::~QFeedbackHapticsInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\n\ntemplate <class T>\nclass BackendLoader\n{\npublic:\n BackendLoader() : inst(0) { }\n ~BackendLoader() { pl.unload(); }\n\n void setInstance(T *newInst) { inst = newInst; }\n T * instance() { return inst; }\n\n void tryLoad(QPluginLoader &loader)\n {\n if (T *newInst = qobject_cast<T*>(loader.instance())) {\n if (!inst || inst->pluginPriority() < newInst->pluginPriority()) {\n inst = newInst;\n pl.unload(); \/\/release any reference to a previous plugin instance\n pl.setFileName(loader.fileName());\n pl.load(); \/\/Adds a ref to the library\n }\n }\n }\n\n\nprivate:\n QPluginLoader pl;\n T *inst;\n};\n\n\nclass FileBackend : public QFeedbackFileInterface\n{\npublic:\n FileBackend()\n {\n }\n\n \/\/this class is used to redirect the calls to all the file backends available\n virtual void setLoaded(QFeedbackFileEffect *effect, bool load)\n {\n if (load) {\n \/\/start loading\n tryBackendLoad(effect);\n } else {\n \/\/unload \n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n subBackend->setLoaded(effect, load);\n QFeedbackFileEffectPrivate::get(effect)->loadFinished(false); \/\/ make sure it's marked unloaded [XXX this isn't allowed to fail!]\n }\n }\n\n virtual void setEffectState(QFeedbackFileEffect *effect, QFeedbackEffect::State state)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n subBackend->setEffectState(effect, state);\n\n QFeedbackInterface::reportError(effect, QFeedbackEffect::UnknownError);\n }\n\n virtual QFeedbackEffect::State effectState(const QFeedbackFileEffect *effect)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n return subBackend->effectState(effect);\n\n return QFeedbackEffect::Stopped;\n }\n\n virtual int effectDuration(const QFeedbackFileEffect *effect)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n return subBackend->effectDuration(effect);\n\n return 0;\n }\n\n virtual QStringList supportedMimeTypes()\n {\n QStringList ret;\n for (int i = 0; i < subBackends.count(); ++i) {\n ret += subBackends.at(i)->supportedMimeTypes();\n }\n return ret;\n }\n\n void addFileBackend(QFeedbackFileInterface *backend)\n {\n subBackends.append(backend);\n }\n\n void reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n {\n if (success) {\n \/\/the file was loaded by the current backend\n QFeedbackFileEffectPrivate::get(effect)->loadFinished(true);\n return;\n }\n\n \/\/let's try the next backend\n tryBackendLoad(effect);\n }\n\nprivate:\n QList<QFeedbackFileInterface*> subBackends; \n\n QFeedbackFileInterface *getBackend(const QFeedbackFileEffect *effect)\n {\n const QFeedbackFileEffectPrivate *priv = QFeedbackFileEffectPrivate::get(effect);\n if (priv->backendUsed >= 0 && priv->backendUsed < subBackends.count())\n return subBackends.at(priv->backendUsed);\n return 0;\n }\n\n void tryBackendLoad(QFeedbackFileEffect *effect)\n {\n QFeedbackFileEffectPrivate *p = QFeedbackFileEffectPrivate::get(effect);\n p->backendUsed++;\n\n \/\/let's try to load the file\n if (p->backendUsed >= subBackends.count()) {\n \/\/the file couldn't be loaded\n p->loadFinished(false);\n return;\n }\n\n subBackends.at(p->backendUsed)->setLoaded(effect, true);\n \/\/now we're waiting for the reply (call to asyncLoadFinished)\n }\n};\n\n\nclass BackendManager\n{\npublic:\n BackendManager()\n {\n QStringList pluginPaths = mobilityPlugins(QLatin1String(\"feedback\"));\n \/\/ Testing hook to force \"no plugin mode\"\n#ifdef QTM_BUILD_UNITTESTS\n if (qApp->property(\"QFEEDBACK_TEST_NO_PLUGINS\").isValid())\n pluginPaths.clear();\n#endif\n foreach (const QString& pluginPath, pluginPaths) {\n QPluginLoader loader(pluginPath);\n\n hapticsBackend.tryLoad(loader);\n themeBackend.tryLoad(loader);\n\n if (QFeedbackFileInterface *newFile = qobject_cast<QFeedbackFileInterface*>(loader.instance())) {\n fileBackend.addFileBackend(newFile);\n } else {\n loader.unload();\n }\n }\n\n if (!hapticsBackend.instance())\n hapticsBackend.setInstance(new QDummyBackend);\n }\n\n QFeedbackHapticsInterface* hapticsBackendInstance()\n {\n return hapticsBackend.instance();\n }\n\n QFeedbackThemeInterface* themeBackendInstance()\n {\n return themeBackend.instance();\n }\n\n FileBackend *fileBackendInstance()\n {\n return &fileBackend;\n }\n\nprivate:\n BackendLoader<QFeedbackHapticsInterface> hapticsBackend;\n BackendLoader<QFeedbackThemeInterface> themeBackend;\n FileBackend fileBackend;\n};\n\nQ_GLOBAL_STATIC(BackendManager, backendManager);\n\n\/*!\n \\class QFeedbackHapticsInterface\n \\ingroup feedback\n\n \\brief The QFeedbackHapticsInterface class is the base class for plugins providing custom haptics effects.\n\n This interface will be used to try to play custom effects with specific duration, intensity, envelope and period.\n An effect is always played on a specified actuator.\n*\/\n\n\n\/*!\n \\enum QFeedbackHapticsInterface::EffectProperty\n This enum describes all effect properties for haptics effects.\n\n \\value Duration The effect duration (in milliseconds)\n \\value Intensity The effect intensity\n \\value AttackTime The effect attack time (in milliseconds)\n \\value AttackIntensity The effect attack intensity\n \\value FadeTime The effect fade time (in milliseconds)\n \\value FadeIntensity The effect fade intensity\n \\value Period The effect period, this is an optional effect property.\n*\/\n\n\/*!\n \\enum QFeedbackHapticsInterface::ActuatorProperty\n This enum describes all actuator properties.\n\n \\value Name The actuator name.\n \\value State The actuator state.\n \\value Enabled The actuator enabled state.\n *\/\n\n\n\/*!\n \\fn QFeedbackHapticsInterface::actuators()\n\n Return the available actuators provided by this plugin. The ownership of the actuator objects stays with the plugin.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::pluginPriority()\n\n Returns the priority for the plugin.\n \\sa QFeedbackInterface::PluginPriority\n*\/\n\n\n\/\/ XXX TODO.. these should have been pointers to QFA :\/\n\/*!\n \\fn QFeedbackHapticsInterface::setActuatorProperty(const QFeedbackActuator& actuator, ActuatorProperty property, const QVariant & value)\n\n Sets a \\a value for \\a property on the \\a actuator.\n\n \\sa ActuatorProperty\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::actuatorProperty(const QFeedbackActuator & actuator, ActuatorProperty property)\n\n Returns the value for the \\a property for an \\a actuator.\n\n \\sa ActuatorProperty\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::isActuatorCapabilitySupported(const QFeedbackActuator &actuator, QFeedbackActuator::Capability capability)\n\n Returns true if the \\a actuator supports the \\a capability.\n*\/\n\n\n\/*!\n \\fn QFeedbackHapticsInterface::updateEffectProperty(const QFeedbackHapticsEffect *effect, EffectProperty property)\n\n Tells the backend that the \\a property has been updated for the supplied \\a effect.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::setEffectState(const QFeedbackHapticsEffect *effect, QFeedbackEffect::State state)\n\n Sets the state to \\a state for the effect \\a effect. If that fails the backend should report an error by\n calling reportError and \\a effect will in turn emit an error signal.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::effectState(const QFeedbackHapticsEffect *effect)\n\n Get the current state for the effect \\a effect.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackHapticsInterface::instance()\n\n Returns the instance of the object managing haptics custom effects.\n If no backend has been loaded, this will return a null pointer.\n*\/\nQFeedbackHapticsInterface *QFeedbackHapticsInterface::instance()\n{\n return backendManager()->hapticsBackendInstance();\n}\n\n\/*!\n \\fn QFeedbackHapticsInterface::createFeedbackActuator(QObject *parent, int id)\n\n Creates an instance of QFeedbackActuator with the identifier \\a id and parent \\a parent. This allows\n backends to create instances of actuators. It is then up to the each backend to manage\n the identifiers according to its needs.\n*\/\nQFeedbackActuator* QFeedbackHapticsInterface::createFeedbackActuator(QObject* parent, int id)\n{\n return new QFeedbackActuator(parent, id);\n}\n\n\/*!\n \\class QFeedbackThemeInterface\n \\ingroup feedback\n\n \\brief The QFeedbackThemeInterface class is the base class for plugins providing themed effects.\n\n They can be of any nature (tactile, audio...).\n This simple interface will be used to play those themed effects by a simple call to the play method.\n*\/\n\n\n\/*!\n \\fn QFeedbackThemeInterface::pluginPriority()\n\n Returns the priority for the plugin.\n*\/\n\n\/*!\n \\fn QFeedbackThemeInterface::play(QFeedbackEffect::ThemeEffect effect)\n\n Plays the theme effect \\a effect. Returns false in case of an error.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackThemeInterface::instance()\n\n Returns the instance of the object managing theme effects.\n If no backend has been loaded, this will return a null pointer.\n*\/\nQFeedbackThemeInterface *QFeedbackThemeInterface::instance()\n{\n return backendManager()->themeBackendInstance();\n}\n\n\/*!\n \\class QFeedbackFileInterface\n \\ingroup feedback\n\n \\brief The QFeedbackFileInterface class is the base class for plugins providing support for effects stored in files.\n\n They can be of any nature (tactile, audio...). As it is possible to load many different file types using\n different technologies, all the backend plugins exposing this interface will be loaded at the same time.\n When loading a file all the backend will be tried in order until one can load the file. It is thus very important\n that the backends return a load status as soon as possible to not take a too long time to load a file.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::setLoaded(QFeedbackFileEffect* effect, bool value)\n\n Sets the state of the effect \\a effect to be loaded if \\a value is true, otherwise unloaded.\n Loading a file is asynchronous. Once the backend knows if it has loaded or can't load the file, it must\n call the reportLoadFinished function.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::setEffectState(QFeedbackFileEffect *effect, QFeedbackEffect::State state)\n\n Sets the state of \\a effect to \\a state.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::effectState(const QFeedbackFileEffect *effect)\n\n Returns the current state of the effect \\a effect.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::effectDuration(const QFeedbackFileEffect *effect)\n\n Return the duration of \\a effect, in milliseconds.\n It should return \\l QFeedbackEffect::Infinite in case the duration is infinite, or 0 if undefined or unknown.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::supportedMimeTypes()\n\n Returns a list of the MIME types supported by this plugin.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackFileInterface::instance()\n\n Returns the instance of the object managing theme effects.\n Even if no backend has been loaded, this will never return a null pointer.\n*\/\nQFeedbackFileInterface *QFeedbackFileInterface::instance()\n{\n return backendManager()->fileBackendInstance();\n}\n\n\/*!\n \\fn QFeedbackFileInterface::reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n\n This is the function the backend should call when it has finished trying to load the effect \\a effect.\n As loading a file is asynchronous and multiple plugins are attempted after each other, the\n backend has to call this function in order for the process to perform smoothly.\n The success of the operation is indicated by the \\a success parameter.\n*\/\nvoid QFeedbackFileInterface::reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n{\n backendManager()->fileBackendInstance()->reportLoadFinished(effect, success);\n}\n\nQTM_END_NAMESPACE\n<commit_msg>Missing else meant that the error signal was emitted on state changes.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qfeedbackplugininterfaces.h\"\n#include \"qfeedbackplugin_p.h\"\n#include \"qfeedbackeffect_p.h\"\n#include \"qmobilitypluginsearch.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QStringList>\n#include <QtCore\/QDir>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QHash>\n#include <QDebug>\n\nQTM_BEGIN_NAMESPACE\n\n\/*!\n \\class QFeedbackInterface\n \\ingroup feedback\n \\inmodule QtFeedback\n\n \\brief The QFeedbackInterface class is the base class for plugins providing feedback.\n\n This interface gives the possibility to report errors from within a backend plugin.\n*\/\n\n\/*!\n \\fn QFeedbackInterface::reportError(const QFeedbackEffect *effect, QFeedbackEffect::ErrorType error)\n\n Allows a plugin to report the specified \\a error whenever necessary. Errors most likely can happen\n trying to play or pause an effect, which should be supplied as the parameter \\a effect.\n*\/\n\n\/*!\n \\enum QFeedbackInterface::PluginPriority\n\n This enum describes the priority that the plugin should have in case more than one of the same type (Haptics or Theme) is found.\n If more than one plugin has the same priority, the first one that has been loaded will be used. However, multiple\n file effect plugins can be loaded at the same time.\n \n \\value PluginLowPriority The plugin will have a low priority. This is usually the case for\n platform specific-APIs.\n\n \\value PluginNormalPriority The plugin will have a normal priority. \n This is usually the case for advanced technologies.\n\n \\value PluginHighPriority The plugin will have higher priority. Use this priority if you \n want your own plugin to be used.\n*\/\n\n\nvoid QFeedbackInterface::reportError(const QFeedbackEffect *effect, QFeedbackEffect::ErrorType error)\n{\n if (effect)\n emit effect->error(error);\n}\n\n\n\/\/ These are really useless docs, so I've marked them as internal\n\/*!\n \\internal\n \\fn QFeedbackThemeInterface::~QFeedbackThemeInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackFileInterface::~QFeedbackFileInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackHapticsInterface::~QFeedbackHapticsInterface()\n\n Destroys any resources used by this interface.\n*\/\n\n\n\ntemplate <class T>\nclass BackendLoader\n{\npublic:\n BackendLoader() : inst(0) { }\n ~BackendLoader() { pl.unload(); }\n\n void setInstance(T *newInst) { inst = newInst; }\n T * instance() { return inst; }\n\n void tryLoad(QPluginLoader &loader)\n {\n if (T *newInst = qobject_cast<T*>(loader.instance())) {\n if (!inst || inst->pluginPriority() < newInst->pluginPriority()) {\n inst = newInst;\n pl.unload(); \/\/release any reference to a previous plugin instance\n pl.setFileName(loader.fileName());\n pl.load(); \/\/Adds a ref to the library\n }\n }\n }\n\n\nprivate:\n QPluginLoader pl;\n T *inst;\n};\n\n\nclass FileBackend : public QFeedbackFileInterface\n{\npublic:\n FileBackend()\n {\n }\n\n \/\/this class is used to redirect the calls to all the file backends available\n virtual void setLoaded(QFeedbackFileEffect *effect, bool load)\n {\n if (load) {\n \/\/start loading\n tryBackendLoad(effect);\n } else {\n \/\/unload \n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n subBackend->setLoaded(effect, load);\n QFeedbackFileEffectPrivate::get(effect)->loadFinished(false); \/\/ make sure it's marked unloaded [XXX this isn't allowed to fail!]\n }\n }\n\n virtual void setEffectState(QFeedbackFileEffect *effect, QFeedbackEffect::State state)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n subBackend->setEffectState(effect, state);\n else\n QFeedbackInterface::reportError(effect, QFeedbackEffect::UnknownError);\n }\n\n virtual QFeedbackEffect::State effectState(const QFeedbackFileEffect *effect)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n return subBackend->effectState(effect);\n\n return QFeedbackEffect::Stopped;\n }\n\n virtual int effectDuration(const QFeedbackFileEffect *effect)\n {\n if (QFeedbackFileInterface *subBackend = getBackend(effect))\n return subBackend->effectDuration(effect);\n\n return 0;\n }\n\n virtual QStringList supportedMimeTypes()\n {\n QStringList ret;\n for (int i = 0; i < subBackends.count(); ++i) {\n ret += subBackends.at(i)->supportedMimeTypes();\n }\n return ret;\n }\n\n void addFileBackend(QFeedbackFileInterface *backend)\n {\n subBackends.append(backend);\n }\n\n void reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n {\n if (success) {\n \/\/the file was loaded by the current backend\n QFeedbackFileEffectPrivate::get(effect)->loadFinished(true);\n return;\n }\n\n \/\/let's try the next backend\n tryBackendLoad(effect);\n }\n\nprivate:\n QList<QFeedbackFileInterface*> subBackends; \n\n QFeedbackFileInterface *getBackend(const QFeedbackFileEffect *effect)\n {\n const QFeedbackFileEffectPrivate *priv = QFeedbackFileEffectPrivate::get(effect);\n if (priv->backendUsed >= 0 && priv->backendUsed < subBackends.count())\n return subBackends.at(priv->backendUsed);\n return 0;\n }\n\n void tryBackendLoad(QFeedbackFileEffect *effect)\n {\n QFeedbackFileEffectPrivate *p = QFeedbackFileEffectPrivate::get(effect);\n p->backendUsed++;\n\n \/\/let's try to load the file\n if (p->backendUsed >= subBackends.count()) {\n \/\/the file couldn't be loaded\n p->loadFinished(false);\n return;\n }\n\n subBackends.at(p->backendUsed)->setLoaded(effect, true);\n \/\/now we're waiting for the reply (call to asyncLoadFinished)\n }\n};\n\n\nclass BackendManager\n{\npublic:\n BackendManager()\n {\n QStringList pluginPaths = mobilityPlugins(QLatin1String(\"feedback\"));\n \/\/ Testing hook to force \"no plugin mode\"\n#ifdef QTM_BUILD_UNITTESTS\n if (qApp->property(\"QFEEDBACK_TEST_NO_PLUGINS\").isValid())\n pluginPaths.clear();\n#endif\n foreach (const QString& pluginPath, pluginPaths) {\n QPluginLoader loader(pluginPath);\n\n hapticsBackend.tryLoad(loader);\n themeBackend.tryLoad(loader);\n\n if (QFeedbackFileInterface *newFile = qobject_cast<QFeedbackFileInterface*>(loader.instance())) {\n fileBackend.addFileBackend(newFile);\n } else {\n loader.unload();\n }\n }\n\n if (!hapticsBackend.instance())\n hapticsBackend.setInstance(new QDummyBackend);\n }\n\n QFeedbackHapticsInterface* hapticsBackendInstance()\n {\n return hapticsBackend.instance();\n }\n\n QFeedbackThemeInterface* themeBackendInstance()\n {\n return themeBackend.instance();\n }\n\n FileBackend *fileBackendInstance()\n {\n return &fileBackend;\n }\n\nprivate:\n BackendLoader<QFeedbackHapticsInterface> hapticsBackend;\n BackendLoader<QFeedbackThemeInterface> themeBackend;\n FileBackend fileBackend;\n};\n\nQ_GLOBAL_STATIC(BackendManager, backendManager);\n\n\/*!\n \\class QFeedbackHapticsInterface\n \\ingroup feedback\n\n \\brief The QFeedbackHapticsInterface class is the base class for plugins providing custom haptics effects.\n\n This interface will be used to try to play custom effects with specific duration, intensity, envelope and period.\n An effect is always played on a specified actuator.\n*\/\n\n\n\/*!\n \\enum QFeedbackHapticsInterface::EffectProperty\n This enum describes all effect properties for haptics effects.\n\n \\value Duration The effect duration (in milliseconds)\n \\value Intensity The effect intensity\n \\value AttackTime The effect attack time (in milliseconds)\n \\value AttackIntensity The effect attack intensity\n \\value FadeTime The effect fade time (in milliseconds)\n \\value FadeIntensity The effect fade intensity\n \\value Period The effect period, this is an optional effect property.\n*\/\n\n\/*!\n \\enum QFeedbackHapticsInterface::ActuatorProperty\n This enum describes all actuator properties.\n\n \\value Name The actuator name.\n \\value State The actuator state.\n \\value Enabled The actuator enabled state.\n *\/\n\n\n\/*!\n \\fn QFeedbackHapticsInterface::actuators()\n\n Return the available actuators provided by this plugin. The ownership of the actuator objects stays with the plugin.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::pluginPriority()\n\n Returns the priority for the plugin.\n \\sa QFeedbackInterface::PluginPriority\n*\/\n\n\n\/\/ XXX TODO.. these should have been pointers to QFA :\/\n\/*!\n \\fn QFeedbackHapticsInterface::setActuatorProperty(const QFeedbackActuator& actuator, ActuatorProperty property, const QVariant & value)\n\n Sets a \\a value for \\a property on the \\a actuator.\n\n \\sa ActuatorProperty\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::actuatorProperty(const QFeedbackActuator & actuator, ActuatorProperty property)\n\n Returns the value for the \\a property for an \\a actuator.\n\n \\sa ActuatorProperty\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::isActuatorCapabilitySupported(const QFeedbackActuator &actuator, QFeedbackActuator::Capability capability)\n\n Returns true if the \\a actuator supports the \\a capability.\n*\/\n\n\n\/*!\n \\fn QFeedbackHapticsInterface::updateEffectProperty(const QFeedbackHapticsEffect *effect, EffectProperty property)\n\n Tells the backend that the \\a property has been updated for the supplied \\a effect.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::setEffectState(const QFeedbackHapticsEffect *effect, QFeedbackEffect::State state)\n\n Sets the state to \\a state for the effect \\a effect. If that fails the backend should report an error by\n calling reportError and \\a effect will in turn emit an error signal.\n*\/\n\n\/*!\n \\fn QFeedbackHapticsInterface::effectState(const QFeedbackHapticsEffect *effect)\n\n Get the current state for the effect \\a effect.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackHapticsInterface::instance()\n\n Returns the instance of the object managing haptics custom effects.\n If no backend has been loaded, this will return a null pointer.\n*\/\nQFeedbackHapticsInterface *QFeedbackHapticsInterface::instance()\n{\n return backendManager()->hapticsBackendInstance();\n}\n\n\/*!\n \\fn QFeedbackHapticsInterface::createFeedbackActuator(QObject *parent, int id)\n\n Creates an instance of QFeedbackActuator with the identifier \\a id and parent \\a parent. This allows\n backends to create instances of actuators. It is then up to the each backend to manage\n the identifiers according to its needs.\n*\/\nQFeedbackActuator* QFeedbackHapticsInterface::createFeedbackActuator(QObject* parent, int id)\n{\n return new QFeedbackActuator(parent, id);\n}\n\n\/*!\n \\class QFeedbackThemeInterface\n \\ingroup feedback\n\n \\brief The QFeedbackThemeInterface class is the base class for plugins providing themed effects.\n\n They can be of any nature (tactile, audio...).\n This simple interface will be used to play those themed effects by a simple call to the play method.\n*\/\n\n\n\/*!\n \\fn QFeedbackThemeInterface::pluginPriority()\n\n Returns the priority for the plugin.\n*\/\n\n\/*!\n \\fn QFeedbackThemeInterface::play(QFeedbackEffect::ThemeEffect effect)\n\n Plays the theme effect \\a effect. Returns false in case of an error.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackThemeInterface::instance()\n\n Returns the instance of the object managing theme effects.\n If no backend has been loaded, this will return a null pointer.\n*\/\nQFeedbackThemeInterface *QFeedbackThemeInterface::instance()\n{\n return backendManager()->themeBackendInstance();\n}\n\n\/*!\n \\class QFeedbackFileInterface\n \\ingroup feedback\n\n \\brief The QFeedbackFileInterface class is the base class for plugins providing support for effects stored in files.\n\n They can be of any nature (tactile, audio...). As it is possible to load many different file types using\n different technologies, all the backend plugins exposing this interface will be loaded at the same time.\n When loading a file all the backend will be tried in order until one can load the file. It is thus very important\n that the backends return a load status as soon as possible to not take a too long time to load a file.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::setLoaded(QFeedbackFileEffect* effect, bool value)\n\n Sets the state of the effect \\a effect to be loaded if \\a value is true, otherwise unloaded.\n Loading a file is asynchronous. Once the backend knows if it has loaded or can't load the file, it must\n call the reportLoadFinished function.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::setEffectState(QFeedbackFileEffect *effect, QFeedbackEffect::State state)\n\n Sets the state of \\a effect to \\a state.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::effectState(const QFeedbackFileEffect *effect)\n\n Returns the current state of the effect \\a effect.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::effectDuration(const QFeedbackFileEffect *effect)\n\n Return the duration of \\a effect, in milliseconds.\n It should return \\l QFeedbackEffect::Infinite in case the duration is infinite, or 0 if undefined or unknown.\n*\/\n\n\/*!\n \\fn QFeedbackFileInterface::supportedMimeTypes()\n\n Returns a list of the MIME types supported by this plugin.\n*\/\n\n\/*!\n \\internal\n \\fn QFeedbackFileInterface::instance()\n\n Returns the instance of the object managing theme effects.\n Even if no backend has been loaded, this will never return a null pointer.\n*\/\nQFeedbackFileInterface *QFeedbackFileInterface::instance()\n{\n return backendManager()->fileBackendInstance();\n}\n\n\/*!\n \\fn QFeedbackFileInterface::reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n\n This is the function the backend should call when it has finished trying to load the effect \\a effect.\n As loading a file is asynchronous and multiple plugins are attempted after each other, the\n backend has to call this function in order for the process to perform smoothly.\n The success of the operation is indicated by the \\a success parameter.\n*\/\nvoid QFeedbackFileInterface::reportLoadFinished(QFeedbackFileEffect *effect, bool success)\n{\n backendManager()->fileBackendInstance()->reportLoadFinished(effect, success);\n}\n\nQTM_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2009, Regents of the University of Alaska\n\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * 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.\n * Neither the name of the Geographic Information Network of Alaska nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nThis code was developed by Dan Stahlke for the Geographic Information Network of Alaska.\n*\/\n\n\n\n#include \"common.h\"\n#include \"polygon.h\"\n#include \"debugplot.h\"\n\nvoid plot_points(ring_t *pl, const char *fn);\n\nvoid usage(const char *cmdname) {\n\tprintf(\"Usage: %s [options] \\n\", cmdname);\n\tprintf(\" -s_wkt <fn> File containing WKT of source region\\n\");\n\tprintf(\" -t_bounds_wkt <fn> File containing WKT for valid region of target SRS (optional)\\n\");\n\tprintf(\" -s_srs <srs_def> Source SRS\\n\");\n\tprintf(\" -t_srs <srs_def> Target SRS\\n\");\n\tprintf(\" -report <out.ppm> Ouput a graphical report (optional)\\n\");\n\tprintf(\"\\nOutput is the envelope of the source region projected into the target SRS.\\n\");\n\tprintf(\"If the -t_bounds_wkt option is given it will be used as a clip mask in the\\n\");\n\tprintf(\"projected space.\\n\");\n\tprintf(\"\\n\");\n\t\n\texit(1);\n}\n\nint main(int argc, char **argv) {\n\tconst char *src_wkt_fn = NULL;\n\tconst char *t_bounds_wkt_fn = NULL;\n\tconst char *s_srs = NULL;\n\tconst char *t_srs = NULL;\n\tconst char *report_fn = NULL;\n\n\tif(argc == 1) usage(argv[0]);\n\n\tint argp = 1;\n\twhile(argp < argc) {\n\t\tchar *arg = argv[argp++];\n\t\t\/\/ FIXME - check duplicate values\n\t\tif(arg[0] == '-') {\n\t\t\tif(!strcmp(arg, \"-v\")) {\n\t\t\t\tVERBOSE++;\n\t\t\t} else if(!strcmp(arg, \"-s_wkt\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tsrc_wkt_fn = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-t_bounds_wkt\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tt_bounds_wkt_fn = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-s_srs\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\ts_srs = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-t_srs\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tt_srs = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-report\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\treport_fn = argv[argp++];\n\t\t\t} else usage(argv[0]);\n\t\t} else {\n\t\t\tusage(argv[0]);\n\t\t}\n\t}\n\n\tif(!src_wkt_fn || !s_srs || !t_srs) usage(argv[0]);\n\n\tGDALAllRegister();\n\n\tCPLPushErrorHandler(CPLQuietErrorHandler);\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tOGRSpatialReferenceH s_sref = OSRNewSpatialReference(NULL);\n\tif(OSRImportFromProj4(s_sref, s_srs) != OGRERR_NONE)\n\t\tfatal_error(\"cannot parse proj4 definition for -s_srs\");\n\n\tOGRSpatialReferenceH t_sref = OSRNewSpatialReference(NULL);\n\tif(OSRImportFromProj4(t_sref, t_srs) != OGRERR_NONE)\n\t\tfatal_error(\"cannot parse proj4 definition for -t_srs\");\n\n\tOGRCoordinateTransformationH fwd_xform = \n\t\tOCTNewCoordinateTransformation(s_sref, t_sref);\n\tOGRCoordinateTransformationH inv_xform = \n\t\tOCTNewCoordinateTransformation(t_sref, s_sref);\n\n\tmpoly_t src_mp = mpoly_from_wktfile(src_wkt_fn);\n\tbbox_t src_bbox = get_polygon_bbox(&src_mp);\n\n\tmpoly_t t_bounds_mp;\n\tbool use_t_bounds;\n\tbbox_t t_bounds_bbox;\n\tif(t_bounds_wkt_fn) {\n\t\tuse_t_bounds = 1;\n\t\tt_bounds_mp = mpoly_from_wktfile(t_bounds_wkt_fn);\n\t\tt_bounds_bbox = get_polygon_bbox(&t_bounds_mp);\n\t} else {\n\t\tuse_t_bounds = 0;\n\t\tt_bounds_bbox = (bbox_t){ 0, 0, 0, 0, 0 }; \/\/ prevents compiler warning\n\t}\n\n\tring_t pl;\n\tpl.pts = NULL; \n\tpl.npts = 0;\n\n\tint num_grid_steps = 100;\n\tfor(int grid_xi=0; grid_xi<=num_grid_steps; grid_xi++) {\n\t\tvertex_t src_pt;\n\t\tdouble alpha_x = (double)grid_xi \/ (double)num_grid_steps;\n\t\tsrc_pt.x = src_bbox.min_x + (src_bbox.max_x - src_bbox.min_x) * alpha_x;\n\t\tfor(int grid_yi=0; grid_yi<=num_grid_steps; grid_yi++) {\n\t\t\tdouble alpha_y = (double)grid_yi \/ (double)num_grid_steps;\n\t\t\tsrc_pt.y = src_bbox.min_y + (src_bbox.max_y - src_bbox.min_y) * alpha_y;\n\t\t\tif(!polygon_contains_point(&src_mp, src_pt.x, src_pt.y)) continue;\n\n\t\t\tvertex_t tgt_pt = src_pt;\n\t\t\tif(!OCTTransform(fwd_xform, 1, &tgt_pt.x, &tgt_pt.y, NULL)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(!use_t_bounds || polygon_contains_point(&t_bounds_mp, tgt_pt.x, tgt_pt.y)) {\n\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t}\n\t\t}\n\t}\n\n\tdouble max_step_len = MAX(\n\t\tsrc_bbox.max_x - src_bbox.min_x,\n\t\tsrc_bbox.max_y - src_bbox.min_y) \/ 1000.0;\n\tfor(int r_idx=0; r_idx<src_mp.num_rings; r_idx++) {\n\t\tring_t *ring = src_mp.rings + r_idx;\n\t\tfor(int v_idx=0; v_idx<ring->npts; v_idx++) {\n\t\t\tvertex_t v1 = ring->pts[v_idx];\n\t\t\tvertex_t v2 = ring->pts[(v_idx+1) % ring->npts];\n\t\t\tdouble dx = v2.x - v1.x;\n\t\t\tdouble dy = v2.y - v1.y;\n\t\t\tdouble len = sqrt(dx*dx + dy*dy);\n\t\t\tint num_steps = 1 + (int)(len \/ max_step_len);\n\t\t\tfor(int step=0; step<=num_steps; step++) {\n\t\t\t\tdouble alpha = (double)step \/ (double)num_steps;\n\t\t\t\tvertex_t src_pt;\n\t\t\t\tsrc_pt.x = v1.x + dx * alpha;\n\t\t\t\tsrc_pt.y = v1.y + dy * alpha;\n\n\t\t\t\tvertex_t tgt_pt = src_pt;\n\t\t\t\tif(!OCTTransform(fwd_xform, 1, &tgt_pt.x, &tgt_pt.y, NULL)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif(!use_t_bounds || polygon_contains_point(&t_bounds_mp, tgt_pt.x, tgt_pt.y)) {\n\t\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(use_t_bounds) {\n\t\tdouble max_step_len = MAX(\n\t\t\tt_bounds_bbox.max_x - t_bounds_bbox.min_x,\n\t\t\tt_bounds_bbox.max_y - t_bounds_bbox.min_y) \/ 1000.0;\n\t\tfor(int r_idx=0; r_idx<t_bounds_mp.num_rings; r_idx++) {\n\t\t\tring_t *ring = t_bounds_mp.rings + r_idx;\n\t\t\tfor(int v_idx=0; v_idx<ring->npts; v_idx++) {\n\t\t\t\tvertex_t v1 = ring->pts[v_idx];\n\t\t\t\tvertex_t v2 = ring->pts[(v_idx+1) % ring->npts];\n\t\t\t\tdouble dx = v2.x - v1.x;\n\t\t\t\tdouble dy = v2.y - v1.y;\n\t\t\t\tdouble len = sqrt(dx*dx + dy*dy);\n\t\t\t\tint num_steps = 1 + (int)(len \/ max_step_len);\n\t\t\t\tfor(int step=0; step<=num_steps; step++) {\n\t\t\t\t\tdouble alpha = (double)step \/ (double)num_steps;\n\t\t\t\t\tvertex_t tgt_pt;\n\t\t\t\t\ttgt_pt.x = v1.x + dx * alpha;\n\t\t\t\t\ttgt_pt.y = v1.y + dy * alpha;\n\n\t\t\t\t\tvertex_t src_pt = tgt_pt;\n\t\t\t\t\tif(!OCTTransform(inv_xform, 1, &src_pt.x, &src_pt.y, NULL)) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif(polygon_contains_point(&src_mp, src_pt.x, src_pt.y)) {\n\t\t\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/fprintf(stderr, \"got %d points\\n\", pl.npts);\n\tbbox_t bbox = get_ring_bbox(&pl);\n\tprintf(\"bounds:\\n\");\n\tprintf(\" min_e: %.15f\\n\", bbox.min_x);\n\tprintf(\" min_n: %.15f\\n\", bbox.min_y);\n\tprintf(\" max_e: %.15f\\n\", bbox.max_x);\n\tprintf(\" max_n: %.15f\\n\", bbox.max_y);\n\n\tif(report_fn) plot_points(&pl, report_fn);\n\n\treturn 0;\n}\n\nvoid plot_points(ring_t *pl, const char *fn) {\n\tbbox_t bbox = get_ring_bbox(pl);\n\tbbox.min_x -= (bbox.max_x - bbox.min_x) * .05;\n\tbbox.max_x += (bbox.max_x - bbox.min_x) * .05;\n\tbbox.min_y -= (bbox.max_y - bbox.min_y) * .05;\n\tbbox.max_y += (bbox.max_y - bbox.min_y) * .05;\n\tdouble W = bbox.max_x - bbox.min_x;\n\tdouble H = bbox.max_y - bbox.min_y;\n\treport_image_t *dbuf = create_plot(W, H);\n\tfor(int i=0; i<pl->npts; i++) {\n\t\tvertex_t v = pl->pts[i];\n\t\tdouble x = v.x - bbox.min_x;\n\t\tdouble y = bbox.max_y - v.y;\n\t\tplot_point(dbuf, x, y, 255, 255, 255);\n\t}\n\twrite_plot(dbuf, fn);\n}\n<commit_msg>better handling of troublesome projections<commit_after>\/*\nCopyright (c) 2009, Regents of the University of Alaska\n\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * 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.\n * Neither the name of the Geographic Information Network of Alaska nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\nCONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\nEXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\nPROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\nPROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\nNEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nThis code was developed by Dan Stahlke for the Geographic Information Network of Alaska.\n*\/\n\n\n\n#include \"common.h\"\n#include \"polygon.h\"\n#include \"debugplot.h\"\n\nvoid plot_points(ring_t *pl, const char *fn);\n\nstruct PointStats {\n\tPointStats() : \n\t\ttotal(0),\n\t\tproj_ok(0),\n\t\tcontained(0)\n\t{ }\n\n\tvoid printYaml(const char *label) {\n\t\tprintf(\"%s:\\n\", label);\n\t\tprintf(\" total: %d\\n\", total);\n\t\tprintf(\" proj_ok: %d\\n\", proj_ok);\n\t\tprintf(\" contained: %d\\n\", contained);\n\t}\n\n\tint total;\n\tint proj_ok;\n\tint contained;\n};\n\nvoid usage(const char *cmdname) {\n\tprintf(\"Usage: %s [options] \\n\", cmdname);\n\tprintf(\" -s_wkt <fn> File containing WKT of source region\\n\");\n\tprintf(\" -t_bounds_wkt <fn> File containing WKT for valid region of target SRS (optional)\\n\");\n\tprintf(\" -s_srs <srs_def> Source SRS\\n\");\n\tprintf(\" -t_srs <srs_def> Target SRS\\n\");\n\tprintf(\" -report <out.ppm> Ouput a graphical report (optional)\\n\");\n\tprintf(\"\\nOutput is the envelope of the source region projected into the target SRS.\\n\");\n\tprintf(\"If the -t_bounds_wkt option is given it will be used as a clip mask in the\\n\");\n\tprintf(\"projected space.\\n\");\n\tprintf(\"\\n\");\n\t\n\texit(1);\n}\n\n\/\/ This function transforms a point, and then as a check transforms it back to\n\/\/ see if it comes back to the same place. This allows us to detect cases\n\/\/ where OCTTransform reports success when really it just returned some\n\/\/ meaningless result.\nbool picky_transform(\n\tOGRCoordinateTransformationH fwd_xform,\n\tOGRCoordinateTransformationH inv_xform,\n\tvertex_t *v_in\n) {\n\t\/\/ tolerance in meters, could probably be much smaller\n\tconst double toler = 1.0;\n\n\tvertex_t v_out = *v_in;\n\tif(!OCTTransform(fwd_xform, 1, &v_out.x, &v_out.y, NULL)) {\n\t\treturn 0;\n\t}\n\n\tvertex_t v_back = v_out;\n\tif(!OCTTransform(inv_xform, 1, &v_back.x, &v_back.y, NULL)) {\n\t\treturn 0;\n\t}\n\n\tdouble err = hypot(v_in->x - v_back.x, v_in->y - v_back.y);\n\t\/\/fprintf(stderr, \"err=%g\\n\", err);\n\tif(err > toler) {\n\t\treturn 0;\n\t}\n\n\t*v_in = v_out;\n\treturn 1;\n}\n\nint main(int argc, char **argv) {\n\tconst char *src_wkt_fn = NULL;\n\tconst char *t_bounds_wkt_fn = NULL;\n\tconst char *s_srs = NULL;\n\tconst char *t_srs = NULL;\n\tconst char *report_fn = NULL;\n\n\tif(argc == 1) usage(argv[0]);\n\n\tint argp = 1;\n\twhile(argp < argc) {\n\t\tchar *arg = argv[argp++];\n\t\t\/\/ FIXME - check duplicate values\n\t\tif(arg[0] == '-') {\n\t\t\tif(!strcmp(arg, \"-v\")) {\n\t\t\t\tVERBOSE++;\n\t\t\t} else if(!strcmp(arg, \"-s_wkt\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tsrc_wkt_fn = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-t_bounds_wkt\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tt_bounds_wkt_fn = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-s_srs\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\ts_srs = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-t_srs\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\tt_srs = argv[argp++];\n\t\t\t} else if(!strcmp(arg, \"-report\")) {\n\t\t\t\tif(argp == argc) usage(argv[0]);\n\t\t\t\treport_fn = argv[argp++];\n\t\t\t} else usage(argv[0]);\n\t\t} else {\n\t\t\tusage(argv[0]);\n\t\t}\n\t}\n\n\tif(!src_wkt_fn || !s_srs || !t_srs) usage(argv[0]);\n\n\tGDALAllRegister();\n\n\tCPLPushErrorHandler(CPLQuietErrorHandler);\n\n\t\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\t\n\tOGRSpatialReferenceH s_sref = OSRNewSpatialReference(NULL);\n\tif(OSRImportFromProj4(s_sref, s_srs) != OGRERR_NONE)\n\t\tfatal_error(\"cannot parse proj4 definition for -s_srs\");\n\n\tOGRSpatialReferenceH t_sref = OSRNewSpatialReference(NULL);\n\tif(OSRImportFromProj4(t_sref, t_srs) != OGRERR_NONE)\n\t\tfatal_error(\"cannot parse proj4 definition for -t_srs\");\n\n\tOGRCoordinateTransformationH fwd_xform = \n\t\tOCTNewCoordinateTransformation(s_sref, t_sref);\n\tOGRCoordinateTransformationH inv_xform = \n\t\tOCTNewCoordinateTransformation(t_sref, s_sref);\n\n\tmpoly_t src_mp = mpoly_from_wktfile(src_wkt_fn);\n\tbbox_t src_bbox = get_polygon_bbox(&src_mp);\n\n\tmpoly_t t_bounds_mp;\n\tbool use_t_bounds;\n\tbbox_t t_bounds_bbox;\n\tif(t_bounds_wkt_fn) {\n\t\tuse_t_bounds = 1;\n\t\tt_bounds_mp = mpoly_from_wktfile(t_bounds_wkt_fn);\n\t\tt_bounds_bbox = get_polygon_bbox(&t_bounds_mp);\n\t} else {\n\t\tuse_t_bounds = 0;\n\t\tt_bounds_bbox = (bbox_t){ 0, 0, 0, 0, 0 }; \/\/ prevents compiler warning\n\t}\n\n\tring_t pl;\n\tpl.pts = NULL; \n\tpl.npts = 0;\n\n\tPointStats ps_border;\n\tPointStats ps_interior;\n\tPointStats ps_bounds;\n\n\t\/\/ Sample a regular grid of points, take the ones within the source region,\n\t\/\/ and project them to the target projection. This is done to handle the\n\t\/\/ cases where the projected border does not necessarily encircle the\n\t\/\/ source region (such as would be the case for a source region that\n\t\/\/ encircles the pole with a target lonlat projection).\n\tint num_grid_steps = 100;\n\tfor(int grid_xi=0; grid_xi<=num_grid_steps; grid_xi++) {\n\t\tvertex_t src_pt;\n\t\tdouble alpha_x = (double)grid_xi \/ (double)num_grid_steps;\n\t\tsrc_pt.x = src_bbox.min_x + (src_bbox.max_x - src_bbox.min_x) * alpha_x;\n\t\tfor(int grid_yi=0; grid_yi<=num_grid_steps; grid_yi++) {\n\t\t\tdouble alpha_y = (double)grid_yi \/ (double)num_grid_steps;\n\t\t\tsrc_pt.y = src_bbox.min_y + (src_bbox.max_y - src_bbox.min_y) * alpha_y;\n\t\t\tif(!polygon_contains_point(&src_mp, src_pt.x, src_pt.y)) continue;\n\n\t\t\tps_interior.total++;\n\n\t\t\tvertex_t tgt_pt = src_pt;\n\t\t\tif(!picky_transform(fwd_xform, inv_xform, &tgt_pt)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tps_interior.proj_ok++;\n\n\t\t\tif(!use_t_bounds || polygon_contains_point(&t_bounds_mp, tgt_pt.x, tgt_pt.y)) {\n\t\t\t\tps_interior.contained++;\n\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Project points along the source region border to the target projection.\n\tdouble max_step_len = MAX(\n\t\tsrc_bbox.max_x - src_bbox.min_x,\n\t\tsrc_bbox.max_y - src_bbox.min_y) \/ 1000.0;\n\tfor(int r_idx=0; r_idx<src_mp.num_rings; r_idx++) {\n\t\tring_t *ring = src_mp.rings + r_idx;\n\t\tfor(int v_idx=0; v_idx<ring->npts; v_idx++) {\n\t\t\tvertex_t v1 = ring->pts[v_idx];\n\t\t\tvertex_t v2 = ring->pts[(v_idx+1) % ring->npts];\n\t\t\tdouble dx = v2.x - v1.x;\n\t\t\tdouble dy = v2.y - v1.y;\n\t\t\tdouble len = sqrt(dx*dx + dy*dy);\n\t\t\tint num_steps = 1 + (int)(len \/ max_step_len);\n\t\t\tfor(int step=0; step<=num_steps; step++) {\n\t\t\t\tdouble alpha = (double)step \/ (double)num_steps;\n\t\t\t\tvertex_t src_pt;\n\t\t\t\tsrc_pt.x = v1.x + dx * alpha;\n\t\t\t\tsrc_pt.y = v1.y + dy * alpha;\n\n\t\t\t\tps_border.total++;\n\n\t\t\t\tvertex_t tgt_pt = src_pt;\n\t\t\t\tif(!picky_transform(fwd_xform, inv_xform, &tgt_pt)) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tps_border.proj_ok++;\n\n\t\t\t\tif(!use_t_bounds || polygon_contains_point(&t_bounds_mp, tgt_pt.x, tgt_pt.y)) {\n\t\t\t\t\tps_border.contained++;\n\t\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Take points along the border of the t_bounds clip shape that lie within the\n\t\/\/ source region.\n\tif(use_t_bounds) {\n\t\tdouble max_step_len = MAX(\n\t\t\tt_bounds_bbox.max_x - t_bounds_bbox.min_x,\n\t\t\tt_bounds_bbox.max_y - t_bounds_bbox.min_y) \/ 1000.0;\n\t\tfor(int r_idx=0; r_idx<t_bounds_mp.num_rings; r_idx++) {\n\t\t\tring_t *ring = t_bounds_mp.rings + r_idx;\n\t\t\tfor(int v_idx=0; v_idx<ring->npts; v_idx++) {\n\t\t\t\tvertex_t v1 = ring->pts[v_idx];\n\t\t\t\tvertex_t v2 = ring->pts[(v_idx+1) % ring->npts];\n\t\t\t\tdouble dx = v2.x - v1.x;\n\t\t\t\tdouble dy = v2.y - v1.y;\n\t\t\t\tdouble len = sqrt(dx*dx + dy*dy);\n\t\t\t\tint num_steps = 1 + (int)(len \/ max_step_len);\n\t\t\t\tfor(int step=0; step<=num_steps; step++) {\n\t\t\t\t\tdouble alpha = (double)step \/ (double)num_steps;\n\t\t\t\t\tvertex_t tgt_pt;\n\t\t\t\t\ttgt_pt.x = v1.x + dx * alpha;\n\t\t\t\t\ttgt_pt.y = v1.y + dy * alpha;\n\n\t\t\t\t\tps_bounds.total++;\n\n\t\t\t\t\tvertex_t src_pt = tgt_pt;\n\t\t\t\t\tif(!picky_transform(inv_xform, fwd_xform, &src_pt)) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tps_bounds.proj_ok++;\n\n\t\t\t\t\tif(polygon_contains_point(&src_mp, src_pt.x, src_pt.y)) {\n\t\t\t\t\t\tps_bounds.contained++;\n\t\t\t\t\t\tadd_point_to_ring(&pl, tgt_pt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/int debug = 1;\n\t\/\/if(debug) {\n\t\/\/\tps_border.printYaml(\"stats_border\");\n\t\/\/\tps_interior.printYaml(\"stats_interior\");\n\t\/\/\tps_bounds.printYaml(\"stats_bounds\");\n\t\/\/}\n\n\t\/\/fprintf(stderr, \"got %d points\\n\", pl.npts);\n\tbbox_t bbox = get_ring_bbox(&pl);\n\tprintf(\"bounds:\\n\");\n\tprintf(\" min_e: %.15f\\n\", bbox.min_x);\n\tprintf(\" min_n: %.15f\\n\", bbox.min_y);\n\tprintf(\" max_e: %.15f\\n\", bbox.max_x);\n\tprintf(\" max_n: %.15f\\n\", bbox.max_y);\n\n\tif(report_fn) plot_points(&pl, report_fn);\n\n\treturn 0;\n}\n\nvoid plot_points(ring_t *pl, const char *fn) {\n\tbbox_t bbox = get_ring_bbox(pl);\n\tbbox.min_x -= (bbox.max_x - bbox.min_x) * .05;\n\tbbox.max_x += (bbox.max_x - bbox.min_x) * .05;\n\tbbox.min_y -= (bbox.max_y - bbox.min_y) * .05;\n\tbbox.max_y += (bbox.max_y - bbox.min_y) * .05;\n\tdouble W = bbox.max_x - bbox.min_x;\n\tdouble H = bbox.max_y - bbox.min_y;\n\treport_image_t *dbuf = create_plot(W, H);\n\tfor(int i=0; i<pl->npts; i++) {\n\t\tvertex_t v = pl->pts[i];\n\t\tdouble x = v.x - bbox.min_x;\n\t\tdouble y = bbox.max_y - v.y;\n\t\tplot_point(dbuf, x, y, 255, 255, 255);\n\t}\n\twrite_plot(dbuf, fn);\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2010 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n\n#include \"GrBatchedTextContext.h\"\n#include \"GrContext.h\"\n#include \"GrDrawTarget.h\"\n#include \"GrIndexBuffer.h\"\n#include \"GrTextContext.h\"\n\n\nGrBatchedTextContext::GrBatchedTextContext() {\n}\n\nGrBatchedTextContext::~GrBatchedTextContext() {\n}\n\nvoid GrBatchedTextContext::init(GrContext* context,\n const GrPaint& grPaint,\n const GrMatrix* extMatrix) {\n this->INHERITED::init(context, grPaint, extMatrix);\n fGrPaint = grPaint;\n fDrawTarget = NULL;\n\n fMaxVertices = 0;\n fCurrTexture = NULL;\n fCurrVertex = 0;\n}\n\nvoid GrBatchedTextContext::finish() {\n GrAssert(fDrawTarget);\n if (fDrawTarget) {\n fDrawTarget->drawState()->disableStages();\n }\n fDrawTarget = NULL;\n\n this->INHERITED::finish();\n}\n\nvoid GrBatchedTextContext::reset() {\n GrAssert(this->isValid());\n GrAssert(fDrawTarget);\n fDrawTarget->resetVertexSource();\n fMaxVertices = 0;\n fCurrVertex = 0;\n fCurrTexture->unref();\n fCurrTexture = NULL;\n}\n\nvoid GrBatchedTextContext::prepareForGlyph(GrTexture* texture) {\n GrAssert(this->isValid());\n GrAssert(texture);\n if (fCurrTexture != texture || fCurrVertex + 4 > fMaxVertices) {\n this->flush();\n fCurrTexture = texture;\n fCurrTexture->ref();\n }\n}\n\nvoid GrBatchedTextContext::setupVertexBuff(void** vertexBuff,\n GrVertexLayout vertexLayout) {\n GrAssert(this->isValid());\n GrAssert(fDrawTarget);\n if (NULL == *vertexBuff) {\n \/\/ If we need to reserve vertices allow the draw target to suggest\n \/\/ a number of verts to reserve and whether to perform a flush.\n fMaxVertices = kMinRequestedVerts;\n bool flush = fDrawTarget->geometryHints(vertexLayout,\n &fMaxVertices,\n NULL);\n if (flush) {\n this->flush();\n fContext->flush();\n fDrawTarget = fContext->getTextTarget(fGrPaint);\n fMaxVertices = kDefaultRequestedVerts;\n \/\/ ignore return, no point in flushing again.\n fDrawTarget->geometryHints(vertexLayout,\n &fMaxVertices,\n NULL);\n }\n\n int maxQuadVertices = 4 * fContext->getQuadIndexBuffer()->maxQuads();\n if (fMaxVertices < kMinRequestedVerts) {\n fMaxVertices = kDefaultRequestedVerts;\n } else if (fMaxVertices > maxQuadVertices) {\n \/\/ don't exceed the limit of the index buffer\n fMaxVertices = maxQuadVertices;\n }\n bool success = fDrawTarget->reserveVertexAndIndexSpace(\n vertexLayout,\n fMaxVertices,\n 0,\n vertexBuff,\n NULL);\n GrAlwaysAssert(success);\n }\n}\n<commit_msg>In GrBatchedTextContext, use GrSafeSetNull(), for more safeness!<commit_after>\n\/*\n * Copyright 2010 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n\n#include \"GrBatchedTextContext.h\"\n#include \"GrContext.h\"\n#include \"GrDrawTarget.h\"\n#include \"GrIndexBuffer.h\"\n#include \"GrTextContext.h\"\n\n\nGrBatchedTextContext::GrBatchedTextContext() {\n}\n\nGrBatchedTextContext::~GrBatchedTextContext() {\n}\n\nvoid GrBatchedTextContext::init(GrContext* context,\n const GrPaint& grPaint,\n const GrMatrix* extMatrix) {\n this->INHERITED::init(context, grPaint, extMatrix);\n fGrPaint = grPaint;\n fDrawTarget = NULL;\n\n fMaxVertices = 0;\n fCurrTexture = NULL;\n fCurrVertex = 0;\n}\n\nvoid GrBatchedTextContext::finish() {\n GrAssert(fDrawTarget);\n if (fDrawTarget) {\n fDrawTarget->drawState()->disableStages();\n }\n fDrawTarget = NULL;\n\n this->INHERITED::finish();\n}\n\nvoid GrBatchedTextContext::reset() {\n GrAssert(this->isValid());\n GrAssert(fDrawTarget);\n fDrawTarget->resetVertexSource();\n fMaxVertices = 0;\n fCurrVertex = 0;\n GrSafeSetNull(fCurrTexture);\n}\n\nvoid GrBatchedTextContext::prepareForGlyph(GrTexture* texture) {\n GrAssert(this->isValid());\n GrAssert(texture);\n if (fCurrTexture != texture || fCurrVertex + 4 > fMaxVertices) {\n this->flush();\n fCurrTexture = texture;\n fCurrTexture->ref();\n }\n}\n\nvoid GrBatchedTextContext::setupVertexBuff(void** vertexBuff,\n GrVertexLayout vertexLayout) {\n GrAssert(this->isValid());\n GrAssert(fDrawTarget);\n if (NULL == *vertexBuff) {\n \/\/ If we need to reserve vertices allow the draw target to suggest\n \/\/ a number of verts to reserve and whether to perform a flush.\n fMaxVertices = kMinRequestedVerts;\n bool flush = fDrawTarget->geometryHints(vertexLayout,\n &fMaxVertices,\n NULL);\n if (flush) {\n this->flush();\n fContext->flush();\n fDrawTarget = fContext->getTextTarget(fGrPaint);\n fMaxVertices = kDefaultRequestedVerts;\n \/\/ ignore return, no point in flushing again.\n fDrawTarget->geometryHints(vertexLayout,\n &fMaxVertices,\n NULL);\n }\n\n int maxQuadVertices = 4 * fContext->getQuadIndexBuffer()->maxQuads();\n if (fMaxVertices < kMinRequestedVerts) {\n fMaxVertices = kDefaultRequestedVerts;\n } else if (fMaxVertices > maxQuadVertices) {\n \/\/ don't exceed the limit of the index buffer\n fMaxVertices = maxQuadVertices;\n }\n bool success = fDrawTarget->reserveVertexAndIndexSpace(\n vertexLayout,\n fMaxVertices,\n 0,\n vertexBuff,\n NULL);\n GrAlwaysAssert(success);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2015 Ahnaf Siddiqui\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"D_SDLRenderer2D.h\"\n\n#include \"D_Log.h\"\n#include \"D_SDLRenderComponent2D.h\"\n#include \"D_SDLTexture.h\"\n#include \"D_Transform2.h\"\n#include \"SDL_image.h\"\n#include <iostream>\n\nDiamond::SDLRenderer2D::SDLRenderer2D(const Config &config, bool &success)\n : m_window(nullptr), m_renderer(nullptr), m_bgColor({0, 0, 0, 100}),\n m_renderCompPool(config.max_gameobjects_estimate) {\n success = true;\n\n \/\/ Initialize SDL\n if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO) < 0) {\n Log::log(\"SDL failed to initialize! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n\n \/\/ Create window\n m_window = SDL_CreateWindow(\n config.game_name.c_str(), SDL_WINDOWPOS_UNDEFINED,\n SDL_WINDOWPOS_UNDEFINED, config.window_width, config.window_height,\n config.fullscreen || config.window_width <= 0 || config.window_height <= 0\n ? SDL_WINDOW_FULLSCREEN_DESKTOP\n : 0);\n if (m_window == nullptr) {\n Log::log(\"SDL failed to create window! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n\n \/\/ Create renderer\n m_renderer = SDL_CreateRenderer(\n m_window, -1,\n SDL_RENDERER_ACCELERATED |\n (config.vsync ? SDL_RENDERER_PRESENTVSYNC : 0x00000000));\n if (m_renderer == nullptr) {\n Log::log(\"SDL failed to create renderer! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n\n \/\/ Set background color\n m_bgColor = config.bg_color;\n\n \/\/ Initialize image loading\n int img_flags = IMG_INIT_JPG | IMG_INIT_PNG | IMG_INIT_TIF;\n if (IMG_Init(img_flags) != img_flags) {\n Log::log(\"SDL_image failed to initialize! SDL_image Error: \" +\n std::string(IMG_GetError()));\n \/\/ success = false; \/\/ TODO: what's wrong with SDL Image init on Android?\n }\n\n \/\/ Initialize text rendering\n if (TTF_Init() < 0) {\n Log::log(\"SDL_ttf failed to initialize! SDL_ttf Error: \" +\n std::string(TTF_GetError()));\n success = false;\n }\n\n if (success && config.optimize_render_layers) {\n m_render_objects.resize(config.num_render_layers_estimate);\n\n for (int i = 0; i < config.num_render_layers_estimate; ++i) {\n m_render_objects[i].data().reserve(config.max_gameobjects_estimate);\n }\n }\n}\n\nDiamond::SDLRenderer2D::~SDLRenderer2D() {\n SDL_DestroyRenderer(m_renderer);\n SDL_DestroyWindow(m_window);\n\n TTF_Quit();\n IMG_Quit();\n SDL_Quit();\n}\n\nvoid Diamond::SDLRenderer2D::renderAll() {\n \/\/ Render background\n SDL_SetRenderDrawColor(m_renderer, m_bgColor.r, m_bgColor.g, m_bgColor.b,\n m_bgColor.a);\n SDL_RenderClear(m_renderer);\n\n \/\/ Render sprites\n for (auto l = m_render_objects.begin(); l != m_render_objects.end(); ++l) {\n for (auto i = l->begin(); i != l->end(); ++i) {\n const auto &transform = i->getTransform();\n\n auto pivot = i->pivot();\n auto &clip = i->clip();\n\n pivot.x *= transform.scale.x;\n pivot.y *= transform.scale.y;\n\n SDL_Rect render_rect = {\n (int)(transform.position.x - pivot.x), \/\/ render position x\n (int)(transform.position.y - pivot.y), \/\/ render position y\n (int)(clip.w * transform.scale.x), \/\/ render width\n (int)(clip.h * transform.scale.y) \/\/ render height\n };\n\n \/\/ Set transparency\n const auto &color = i->color();\n SDL_SetTextureColorMod(i->texture(), color.r, color.g, color.b);\n SDL_SetTextureAlphaMod(i->texture(), i->alpha());\n\n SDL_RenderCopyEx(\n m_renderer, \/\/ The SDL backend renderer for this SDL instance.\n i->texture(), \/\/ sprite\n &clip, \/\/ source rect\n &render_rect, \/\/ destination rect\n transform.rotation, \/\/ rotation for destination rect in degrees\n &pivot, \/\/ rotation pivot location in local space\n i->getFlip() \/\/ current flip status\n );\n\n \/\/ Reset the texture's transparency before the next render\n SDL_SetTextureColorMod(i->texture(), 255, 255, 255);\n SDL_SetTextureAlphaMod(i->texture(), 255);\n }\n }\n\n \/\/ Render points\n for (SDLRenderablePoint point : m_render_points_queue) {\n SDL_SetRenderDrawColor(m_renderer, point.color.r, point.color.g,\n point.color.b, point.color.a);\n\n SDL_RenderDrawPoint(m_renderer, point.coords.x, point.coords.y);\n }\n\n m_render_points_queue.clear();\n\n \/\/ Render lines\n for (SDLRenderableLine line : m_render_lines_queue) {\n SDL_SetRenderDrawColor(m_renderer, line.color.r, line.color.g, line.color.b,\n line.color.a);\n\n SDL_RenderDrawLine(m_renderer, line.p1.x, line.p1.y, line.p2.x, line.p2.y);\n }\n\n m_render_lines_queue.clear();\n\n \/\/ Update screen\n SDL_RenderPresent(m_renderer);\n}\n\nDiamond::Vector2<int> Diamond::SDLRenderer2D::getScreenResolution() const {\n SDL_DisplayMode mode;\n SDL_GetCurrentDisplayMode(0, &mode);\n return Vector2<int>(mode.w, mode.h);\n}\n\nDiamond::Vector2<int> Diamond::SDLRenderer2D::getResolution() const {\n Vector2<int> r;\n SDL_GL_GetDrawableSize(m_window, &(r.x), &(r.y));\n return r;\n}\n\nint Diamond::SDLRenderer2D::getRefreshRate() const {\n SDL_DisplayMode mode;\n SDL_GetCurrentDisplayMode(0, &mode);\n return mode.refresh_rate;\n}\n\nDiamond::DumbPtr<Diamond::Font>\nDiamond::SDLRenderer2D::loadFont(const std::string &fontPath, int ptsize) {\n TTF_Font *font = TTF_OpenFont(fontPath.c_str(), ptsize);\n if (!font) {\n Log::log(\"Failed to load font \" + fontPath +\n \"! SDL_ttf Error: \" + std::string(TTF_GetError()));\n return nullptr;\n }\n return DumbPtr<Font>(new SDLFont(font));\n}\n\nDiamond::DumbPtr<Diamond::Texture>\nDiamond::SDLRenderer2D::loadTexture(std::string path) {\n SDL_Surface *surface = IMG_Load(path.c_str());\n if (surface == NULL) {\n Log::log(\"Failed to load image \" + path +\n \"! SDL_image Error: \" + std::string(IMG_GetError()));\n return nullptr;\n }\n\n SDL_Texture *texture = SDL_CreateTextureFromSurface(m_renderer, surface);\n if (texture == NULL) {\n Log::log(\"Failed to create texture from \" + path +\n \"! SDL Error: \" + std::string(SDL_GetError()));\n return nullptr;\n }\n int width = surface->w;\n int height = surface->h;\n\n SDL_FreeSurface(surface);\n return DumbPtr<Texture>(new SDLTexture(texture, width, height));\n}\n\nDiamond::DumbPtr<Diamond::Texture>\nDiamond::SDLRenderer2D::loadTextTexture(const std::string &text,\n const Font *font, const RGBA &color) {\n auto sdlfont = dynamic_cast<const SDLFont *>(font);\n if (sdlfont) {\n SDL_Color sdlcolor = {color.r, color.g, color.b, color.a};\n\n SDL_Surface *surface =\n TTF_RenderText_Solid(sdlfont->font, text.c_str(), sdlcolor);\n\n if (surface == NULL) {\n Log::log(\"Failed to load text \" + text +\n \". SDL_ttf Error: \" + std::string(TTF_GetError()));\n return nullptr;\n }\n\n SDL_Texture *texture = SDL_CreateTextureFromSurface(m_renderer, surface);\n if (texture == NULL) {\n Log::log(\"Failed to create texture for text \" + text +\n \". SDL Error: \" + std::string(SDL_GetError()));\n return nullptr;\n }\n int width = surface->w;\n int height = surface->h;\n\n SDL_FreeSurface(surface);\n \/\/ TODO: use memory pool!\n return DumbPtr<Texture>(new SDLTexture(texture, width, height));\n } else {\n Log::log(\"Given Font is not an SDLFont.\");\n }\n return nullptr;\n}\n\nDiamond::DumbPtr<Diamond::RenderComponent2D>\nDiamond::SDLRenderer2D::makeRenderComponent(const DTransform2 &transform,\n const Texture *texture,\n RenderLayer layer,\n const Vector2<tD_pos> &pivot) {\n \/\/ Make room for a new layer if necessary\n if ((int)layer > (int)m_render_objects.size() - 1) {\n m_render_objects.resize(layer + 1);\n }\n\n SDLrenderobj_id robj = m_render_objects[layer].emplace(\n transform, dynamic_cast<const SDLTexture *>(texture), pivot);\n\n return m_renderCompPool.make(*this, robj, texture, layer);\n}\n\nvoid Diamond::SDLRenderer2D::renderPoint(const Vector2<tD_pos> &coords,\n const RGBA &color) {\n m_render_points_queue.push_back({coords, color});\n}\n\nvoid Diamond::SDLRenderer2D::renderLine(const Vector2<tD_pos> &p1,\n const Vector2<tD_pos> &p2,\n const RGBA &color) {\n m_render_lines_queue.push_back({p1, p2, color});\n}\n\nDiamond::SDLrenderobj_id\nDiamond::SDLRenderer2D::changeLayer(RenderLayer curLayer, SDLrenderobj_id robj,\n RenderLayer newLayer) {\n \/\/ Make room for a new layer if necessary\n if (newLayer + 1 > m_render_objects.size()) {\n m_render_objects.resize(newLayer + 1);\n }\n\n SDLrenderobj_id newID = m_render_objects[newLayer].insert(\n std::move(m_render_objects[curLayer][robj]));\n m_render_objects[curLayer].erase(robj);\n\n return newID;\n}\n<commit_msg>Added High DPI support<commit_after>\/*\n Copyright 2015 Ahnaf Siddiqui\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"D_SDLRenderer2D.h\"\n\n#include \"D_Log.h\"\n#include \"D_SDLRenderComponent2D.h\"\n#include \"D_SDLTexture.h\"\n#include \"D_Transform2.h\"\n#include \"SDL_image.h\"\n#include <iostream>\n\nDiamond::SDLRenderer2D::SDLRenderer2D(const Config &config, bool &success)\n : m_window(nullptr), m_renderer(nullptr), m_bgColor({0, 0, 0, 100}),\n m_renderCompPool(config.max_gameobjects_estimate) {\n success = true;\n\n \/\/ Initialize SDL\n if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO) < 0) {\n Log::log(\"SDL failed to initialize! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n\n \/\/ Create window\n if (success) {\n auto flags = SDL_WINDOW_ALLOW_HIGHDPI;\n if (config.fullscreen || config.window_width <= 0 || config.window_height <= 0) {\n flags = (SDL_WindowFlags)(flags | SDL_WINDOW_FULLSCREEN_DESKTOP);\n }\n m_window = SDL_CreateWindow(\n config.game_name.c_str(), SDL_WINDOWPOS_UNDEFINED,\n SDL_WINDOWPOS_UNDEFINED, config.window_width, config.window_height,\n flags);\n if (m_window == nullptr) {\n Log::log(\"SDL failed to create window! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n }\n\n \/\/ Create renderer\n if (success) {\n m_renderer = SDL_CreateRenderer(\n m_window, -1,\n SDL_RENDERER_ACCELERATED |\n (config.vsync ? SDL_RENDERER_PRESENTVSYNC : 0x00000000));\n if (m_renderer == nullptr) {\n Log::log(\"SDL failed to create renderer! SDL Error: \" +\n std::string(SDL_GetError()));\n success = false;\n }\n }\n\n \/\/ Set background color\n m_bgColor = config.bg_color;\n\n \/\/ Initialize image loading\n int img_flags = IMG_INIT_JPG | IMG_INIT_PNG | IMG_INIT_TIF;\n if (IMG_Init(img_flags) != img_flags) {\n Log::log(\"SDL_image failed to initialize! SDL_image Error: \" +\n std::string(IMG_GetError()));\n \/\/ success = false; \/\/ TODO: what's wrong with SDL Image init on Android?\n }\n\n \/\/ Initialize text rendering\n if (TTF_Init() < 0) {\n Log::log(\"SDL_ttf failed to initialize! SDL_ttf Error: \" +\n std::string(TTF_GetError()));\n success = false;\n }\n\n if (success && config.optimize_render_layers) {\n m_render_objects.resize(config.num_render_layers_estimate);\n\n for (int i = 0; i < config.num_render_layers_estimate; ++i) {\n m_render_objects[i].data().reserve(config.max_gameobjects_estimate);\n }\n }\n}\n\nDiamond::SDLRenderer2D::~SDLRenderer2D() {\n SDL_DestroyRenderer(m_renderer);\n SDL_DestroyWindow(m_window);\n\n TTF_Quit();\n IMG_Quit();\n SDL_Quit();\n}\n\nvoid Diamond::SDLRenderer2D::renderAll() {\n \/\/ Render background\n SDL_SetRenderDrawColor(m_renderer, m_bgColor.r, m_bgColor.g, m_bgColor.b,\n m_bgColor.a);\n SDL_RenderClear(m_renderer);\n\n \/\/ Render sprites\n for (auto l = m_render_objects.begin(); l != m_render_objects.end(); ++l) {\n for (auto i = l->begin(); i != l->end(); ++i) {\n const auto &transform = i->getTransform();\n\n auto pivot = i->pivot();\n auto &clip = i->clip();\n\n pivot.x *= transform.scale.x;\n pivot.y *= transform.scale.y;\n\n SDL_Rect render_rect = {\n (int)(transform.position.x - pivot.x), \/\/ render position x\n (int)(transform.position.y - pivot.y), \/\/ render position y\n (int)(clip.w * transform.scale.x), \/\/ render width\n (int)(clip.h * transform.scale.y) \/\/ render height\n };\n\n \/\/ Set transparency\n const auto &color = i->color();\n SDL_SetTextureColorMod(i->texture(), color.r, color.g, color.b);\n SDL_SetTextureAlphaMod(i->texture(), i->alpha());\n\n SDL_RenderCopyEx(\n m_renderer, \/\/ The SDL backend renderer for this SDL instance.\n i->texture(), \/\/ sprite\n &clip, \/\/ source rect\n &render_rect, \/\/ destination rect\n transform.rotation, \/\/ rotation for destination rect in degrees\n &pivot, \/\/ rotation pivot location in local space\n i->getFlip() \/\/ current flip status\n );\n\n \/\/ Reset the texture's transparency before the next render\n SDL_SetTextureColorMod(i->texture(), 255, 255, 255);\n SDL_SetTextureAlphaMod(i->texture(), 255);\n }\n }\n\n \/\/ Render points\n for (SDLRenderablePoint point : m_render_points_queue) {\n SDL_SetRenderDrawColor(m_renderer, point.color.r, point.color.g,\n point.color.b, point.color.a);\n\n SDL_RenderDrawPoint(m_renderer, point.coords.x, point.coords.y);\n }\n\n m_render_points_queue.clear();\n\n \/\/ Render lines\n for (SDLRenderableLine line : m_render_lines_queue) {\n SDL_SetRenderDrawColor(m_renderer, line.color.r, line.color.g, line.color.b,\n line.color.a);\n\n SDL_RenderDrawLine(m_renderer, line.p1.x, line.p1.y, line.p2.x, line.p2.y);\n }\n\n m_render_lines_queue.clear();\n\n \/\/ Update screen\n SDL_RenderPresent(m_renderer);\n}\n\nDiamond::Vector2<int> Diamond::SDLRenderer2D::getScreenResolution() const {\n SDL_DisplayMode mode;\n SDL_GetCurrentDisplayMode(0, &mode);\n return Vector2<int>(mode.w, mode.h);\n}\n\nDiamond::Vector2<int> Diamond::SDLRenderer2D::getResolution() const {\n Vector2<int> r;\n SDL_GL_GetDrawableSize(m_window, &(r.x), &(r.y));\n return r;\n}\n\nint Diamond::SDLRenderer2D::getRefreshRate() const {\n SDL_DisplayMode mode;\n SDL_GetCurrentDisplayMode(0, &mode);\n return mode.refresh_rate;\n}\n\nDiamond::DumbPtr<Diamond::Font>\nDiamond::SDLRenderer2D::loadFont(const std::string &fontPath, int ptsize) {\n TTF_Font *font = TTF_OpenFont(fontPath.c_str(), ptsize);\n if (!font) {\n Log::log(\"Failed to load font \" + fontPath +\n \"! SDL_ttf Error: \" + std::string(TTF_GetError()));\n return nullptr;\n }\n return DumbPtr<Font>(new SDLFont(font));\n}\n\nDiamond::DumbPtr<Diamond::Texture>\nDiamond::SDLRenderer2D::loadTexture(std::string path) {\n SDL_Surface *surface = IMG_Load(path.c_str());\n if (surface == NULL) {\n Log::log(\"Failed to load image \" + path +\n \"! SDL_image Error: \" + std::string(IMG_GetError()));\n return nullptr;\n }\n\n SDL_Texture *texture = SDL_CreateTextureFromSurface(m_renderer, surface);\n if (texture == NULL) {\n Log::log(\"Failed to create texture from \" + path +\n \"! SDL Error: \" + std::string(SDL_GetError()));\n return nullptr;\n }\n int width = surface->w;\n int height = surface->h;\n\n SDL_FreeSurface(surface);\n return DumbPtr<Texture>(new SDLTexture(texture, width, height));\n}\n\nDiamond::DumbPtr<Diamond::Texture>\nDiamond::SDLRenderer2D::loadTextTexture(const std::string &text,\n const Font *font, const RGBA &color) {\n auto sdlfont = dynamic_cast<const SDLFont *>(font);\n if (sdlfont) {\n SDL_Color sdlcolor = {color.r, color.g, color.b, color.a};\n\n SDL_Surface *surface =\n TTF_RenderText_Solid(sdlfont->font, text.c_str(), sdlcolor);\n\n if (surface == NULL) {\n Log::log(\"Failed to load text \" + text +\n \". SDL_ttf Error: \" + std::string(TTF_GetError()));\n return nullptr;\n }\n\n SDL_Texture *texture = SDL_CreateTextureFromSurface(m_renderer, surface);\n if (texture == NULL) {\n Log::log(\"Failed to create texture for text \" + text +\n \". SDL Error: \" + std::string(SDL_GetError()));\n return nullptr;\n }\n int width = surface->w;\n int height = surface->h;\n\n SDL_FreeSurface(surface);\n \/\/ TODO: use memory pool!\n return DumbPtr<Texture>(new SDLTexture(texture, width, height));\n } else {\n Log::log(\"Given Font is not an SDLFont.\");\n }\n return nullptr;\n}\n\nDiamond::DumbPtr<Diamond::RenderComponent2D>\nDiamond::SDLRenderer2D::makeRenderComponent(const DTransform2 &transform,\n const Texture *texture,\n RenderLayer layer,\n const Vector2<tD_pos> &pivot) {\n \/\/ Make room for a new layer if necessary\n if ((int)layer > (int)m_render_objects.size() - 1) {\n m_render_objects.resize(layer + 1);\n }\n\n SDLrenderobj_id robj = m_render_objects[layer].emplace(\n transform, dynamic_cast<const SDLTexture *>(texture), pivot);\n\n return m_renderCompPool.make(*this, robj, texture, layer);\n}\n\nvoid Diamond::SDLRenderer2D::renderPoint(const Vector2<tD_pos> &coords,\n const RGBA &color) {\n m_render_points_queue.push_back({coords, color});\n}\n\nvoid Diamond::SDLRenderer2D::renderLine(const Vector2<tD_pos> &p1,\n const Vector2<tD_pos> &p2,\n const RGBA &color) {\n m_render_lines_queue.push_back({p1, p2, color});\n}\n\nDiamond::SDLrenderobj_id\nDiamond::SDLRenderer2D::changeLayer(RenderLayer curLayer, SDLrenderobj_id robj,\n RenderLayer newLayer) {\n \/\/ Make room for a new layer if necessary\n if (newLayer + 1 > m_render_objects.size()) {\n m_render_objects.resize(newLayer + 1);\n }\n\n SDLrenderobj_id newID = m_render_objects[newLayer].insert(\n std::move(m_render_objects[curLayer][robj]));\n m_render_objects[curLayer].erase(robj);\n\n return newID;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2018, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"filesystemwatcher.h\"\n#include \"abstractproject.h\"\n#include \"abstractresourceitem.h\"\n#include \"abstractresourcelist.h\"\n#include \"models\/common\/imagecache.h\"\n\n#include <QDebug>\n#include <QDir>\n#include <QFileInfo>\n#include <QLabel>\n#include <QMessageBox>\n\nusing namespace UnTech::GuiQt;\n\nFilesystemWatcher::FilesystemWatcher(AbstractProject* project)\n : QObject(project)\n , _project(project)\n , _watcher(new QFileSystemWatcher(this))\n , _projectWatcher(new QFileSystemWatcher(this))\n , _filesChangedDialogActive(false)\n , _filenameToItems()\n , _itemToFilenames()\n{\n Q_ASSERT(project);\n\n watchProjectFile();\n\n connect(_watcher, &QFileSystemWatcher::fileChanged,\n this, &FilesystemWatcher::onFileChanged);\n\n connect(_projectWatcher, &QFileSystemWatcher::fileChanged,\n this, &FilesystemWatcher::onProjectFileChanged);\n\n connect(_project, &AbstractProject::filenameChanged,\n this, &FilesystemWatcher::watchProjectFile);\n\n connect(_project, &AbstractProject::aboutToSaveProject,\n this, &FilesystemWatcher::onAboutToSaveProject);\n\n connect(_project, &AbstractProject::resourceItemCreated,\n this, &FilesystemWatcher::onResourceItemCreated);\n\n connect(_project, &AbstractProject::selectedResourceChanged,\n this, &FilesystemWatcher::onSelectedResourceChanged);\n\n connect(_project, &AbstractProject::resourceItemAboutToBeRemoved,\n this, &FilesystemWatcher::removeResourceItem);\n}\n\nvoid FilesystemWatcher::watchProjectFile()\n{\n QString fn = _project->filename();\n if (fn.isEmpty() == false) {\n fn = QDir::fromNativeSeparators(fn);\n }\n\n QStringList toRemove = _projectWatcher->files();\n toRemove << _projectWatcher->directories();\n\n if (toRemove.size() == 1 && toRemove.first() == fn) {\n \/\/ already watching project file\n return;\n }\n\n if (toRemove.isEmpty() == false) {\n _projectWatcher->removePaths(toRemove);\n }\n\n if (fn.isEmpty() == false && QFile::exists(fn)) {\n _projectWatcher->addPath(_project->filename());\n }\n}\n\nvoid FilesystemWatcher::onAboutToSaveProject()\n{\n _filesSavedLocally.append(_project->filename());\n}\n\nvoid FilesystemWatcher::onProjectFileChanged(const QString& path)\n{\n QString nativePath = QDir::toNativeSeparators(path);\n\n if (_filesSavedLocally.contains(nativePath)) {\n \/\/ Do not process items were saved by the editor\n _filesSavedLocally.removeAll(nativePath);\n\n \/\/ If the path was replaced we need to add it to the watcher again.\n watchProjectFile();\n return;\n }\n\n _project->undoStack()->resetClean();\n for (AbstractResourceList* rl : _project->resourceLists()) {\n for (AbstractResourceItem* item : rl->items()) {\n if (auto* inItem = qobject_cast<AbstractInternalResourceItem*>(item)) {\n inItem->undoStack()->resetClean();\n }\n }\n }\n\n QMessageBox::warning(\n nullptr, tr(\"Project File Changed\"),\n tr(\"The project file \\\"%1\\\" has been changed on disk.\\n\"\n \"Please save or discard changes manually.\")\n .arg(QFileInfo(path).fileName()));\n\n watchProjectFile();\n}\n\nvoid FilesystemWatcher::onResourceItemCreated(AbstractResourceItem* item)\n{\n updateWatcherAndMaps(item);\n\n connect(item, &AbstractResourceItem::externalFilesChanged,\n this, &FilesystemWatcher::onResourceItemExternalFilesChanged);\n\n if (auto* exItem = qobject_cast<AbstractExternalResourceItem*>(item)) {\n connect(exItem, &AbstractExternalResourceItem::aboutToSaveResource,\n this, &FilesystemWatcher::onAboutToSaveResource);\n }\n}\n\nvoid FilesystemWatcher::onSelectedResourceChanged()\n{\n \/\/ Reload the watcher when the selected item is changed.\n \/\/ Just in case a file that did not exist is now existing.\n\n if (auto* item = _project->selectedResource()) {\n updateWatcherAndMaps(item);\n }\n}\n\nvoid FilesystemWatcher::onResourceItemExternalFilesChanged()\n{\n auto* item = qobject_cast<AbstractResourceItem*>(sender());\n if (item) {\n updateWatcherAndMaps(item);\n }\n}\n\nstatic QStringList resourceNativeFilenames(const AbstractResourceItem* item)\n{\n QStringList nativeFilenames = item->externalFiles();\n\n if (auto* exItem = qobject_cast<const AbstractExternalResourceItem*>(item)) {\n nativeFilenames << exItem->filename();\n }\n\n nativeFilenames.removeAll(QString());\n\n for (QString& fn : nativeFilenames) {\n fn = QDir::toNativeSeparators(QFileInfo(fn).absoluteFilePath());\n }\n\n return nativeFilenames;\n}\n\nvoid FilesystemWatcher::updateWatcherAndMaps(AbstractResourceItem* item)\n{\n Q_ASSERT(item);\n\n const QStringList nativeFilenames = resourceNativeFilenames(item);\n const QStringList watchedFiles = _watcher->files();\n const QStringList previousFilenames = _itemToFilenames.value(item);\n\n bool emitModified = previousFilenames != nativeFilenames;\n\n {\n \/\/ Check the watched\/existing status of every filename.\n \/\/ It may not have existed in the past, but it could exist now.\n\n QStringList toWatch;\n toWatch.reserve(nativeFilenames.size());\n\n for (const QString& nativePath : nativeFilenames) {\n QString path = QDir::fromNativeSeparators(nativePath);\n\n bool fileUnwatched = watchedFiles.contains(path) == false;\n bool fileExists = QFile::exists(nativePath);\n\n if (fileUnwatched && fileExists) {\n toWatch << path;\n\n emitModified = true;\n }\n if (fileUnwatched || !fileExists) {\n ImageCache::invalidateFilename(nativePath.toStdString());\n }\n }\n\n if (toWatch.isEmpty() == false) {\n \/\/ This is more efficient then adding paths one at a time\n _watcher->addPaths(toWatch);\n }\n }\n\n QStringList toAdd = nativeFilenames;\n\n for (const QString& prevFilename : previousFilenames) {\n int i = toAdd.indexOf(prevFilename);\n if (i >= 0) {\n toAdd.removeAt(i);\n }\n else {\n removeFilenameItemMapping(prevFilename, item);\n }\n }\n\n for (const QString& filename : toAdd) {\n auto it = _filenameToItems.find(filename);\n if (it == _filenameToItems.end()) {\n it = _filenameToItems.insert(filename, {});\n }\n if (it->contains(item) == false) {\n it->append(item);\n }\n }\n\n if (nativeFilenames.isEmpty() == false) {\n _itemToFilenames.insert(item, nativeFilenames);\n }\n else {\n _itemToFilenames.remove(item);\n }\n\n if (emitModified) {\n emit item->externalFilesModified();\n\n item->markUnchecked();\n }\n}\n\nvoid FilesystemWatcher::removeResourceItem(AbstractResourceItem* item)\n{\n Q_ASSERT(item);\n\n const QStringList filenames = _itemToFilenames.value(item);\n for (const QString& fn : filenames) {\n removeFilenameItemMapping(fn, item);\n }\n\n _itemToFilenames.remove(item);\n}\n\nvoid FilesystemWatcher::removeFilenameItemMapping(const QString& filename, AbstractResourceItem* item)\n{\n auto it = _filenameToItems.find(filename);\n if (it != _filenameToItems.end()) {\n it->removeAll(item);\n if (it->isEmpty()) {\n _watcher->removePath(filename);\n\n _filenameToItems.remove(filename);\n }\n }\n}\n\nvoid FilesystemWatcher::onAboutToSaveResource()\n{\n auto* item = qobject_cast<AbstractExternalResourceItem*>(sender());\n if (item) {\n _filesSavedLocally.append(item->filename());\n }\n}\n\nvoid FilesystemWatcher::onFileChanged(const QString& path)\n{\n \/\/ If the path was replaced (ie, file copy or atomic write) then the\n \/\/ watcher will automatically remove the path and we need to add it back\n \/\/ again.\n if (_watcher->files().contains(path) == false) {\n if (QFile::exists(path)) {\n _watcher->addPath(path);\n }\n }\n\n QString nativePath = QDir::toNativeSeparators(path);\n\n ImageCache::invalidateFilename(nativePath.toStdString());\n\n if (_filesSavedLocally.contains(nativePath)) {\n \/\/ Do not process items were saved by the editor\n _filesSavedLocally.removeAll(nativePath);\n return;\n }\n\n auto it = _filenameToItems.find(nativePath);\n if (it != _filenameToItems.end()) {\n const auto& items = *it;\n\n for (AbstractResourceItem* item : items) {\n if (auto* exItem = qobject_cast<AbstractExternalResourceItem*>(item)) {\n if (nativePath == exItem->filename()) {\n resourceChangedOnDisk(exItem);\n continue;\n }\n }\n\n emit item->externalFilesModified();\n\n item->markUnchecked();\n }\n }\n else {\n qWarning() << nativePath << \"is not linked to a ResourceItem\";\n }\n}\n\nvoid FilesystemWatcher::resourceChangedOnDisk(AbstractExternalResourceItem* item)\n{\n if (_changedResources.contains(item) == false) {\n _changedResources.append(item);\n }\n if (_filesChangedDialogActive == false) {\n showFilesChangedDialog();\n }\n}\n\nvoid FilesystemWatcher::showFilesChangedDialog()\n{\n Q_ASSERT(_filesChangedDialogActive == false);\n _filesChangedDialogActive = true;\n\n QMessageBox dialog;\n\n dialog.setWindowTitle(tr(\"Changed Files\"));\n dialog.addButton(QMessageBox::Yes);\n dialog.addButton(QMessageBox::No);\n dialog.addButton(QMessageBox::NoToAll);\n dialog.setDefaultButton(QMessageBox::No);\n\n {\n \/\/ Set size of dialog so the buttons are always in the same place.\n\n \/\/ QMessageDialog setSize methods do not work,\n \/\/ however setting the size of the label does.\n\n QSize labelSize(dialog.fontMetrics().width('m') * 50,\n dialog.fontMetrics().height() * 5);\n\n for (QLabel* l : dialog.findChildren<QLabel*>()) {\n l->setFixedSize(labelSize);\n }\n }\n\n while (!_changedResources.empty()) {\n QPointer<AbstractExternalResourceItem> item = _changedResources.first();\n\n if (item) {\n dialog.setText(tr(\"The file \\\"%1\\\" has been changed on disk.\\n\"\n \"Do you want to reload it?\\n\\n\"\n \"You will not be able to undo this action.\")\n .arg(item->relativeFilePath()));\n\n dialog.exec();\n\n switch (dialog.result()) {\n case QMessageBox::Yes:\n if (item) {\n auto* newItem = item->resourceList()->revertResource(item);\n newItem->project()->setSelectedResource(newItem);\n }\n _changedResources.removeFirst();\n break;\n\n case QMessageBox::No:\n if (item) {\n item->undoStack()->resetClean();\n }\n _changedResources.removeFirst();\n break;\n\n case QMessageBox::NoToAll:\n for (auto& i : _changedResources) {\n if (i) {\n i->undoStack()->resetClean();\n }\n }\n _changedResources.clear();\n break;\n }\n }\n }\n\n _filesChangedDialogActive = false;\n}\n<commit_msg>Update onFileChanged to check the path status at the end of routine<commit_after>\/*\n * This file is part of the UnTech Editor Suite.\n * Copyright (c) 2016 - 2018, Marcus Rowe <undisbeliever@gmail.com>.\n * Distributed under The MIT License: https:\/\/opensource.org\/licenses\/MIT\n *\/\n\n#include \"filesystemwatcher.h\"\n#include \"abstractproject.h\"\n#include \"abstractresourceitem.h\"\n#include \"abstractresourcelist.h\"\n#include \"models\/common\/imagecache.h\"\n\n#include <QDebug>\n#include <QDir>\n#include <QFileInfo>\n#include <QLabel>\n#include <QMessageBox>\n\nusing namespace UnTech::GuiQt;\n\nFilesystemWatcher::FilesystemWatcher(AbstractProject* project)\n : QObject(project)\n , _project(project)\n , _watcher(new QFileSystemWatcher(this))\n , _projectWatcher(new QFileSystemWatcher(this))\n , _filesChangedDialogActive(false)\n , _filenameToItems()\n , _itemToFilenames()\n{\n Q_ASSERT(project);\n\n watchProjectFile();\n\n connect(_watcher, &QFileSystemWatcher::fileChanged,\n this, &FilesystemWatcher::onFileChanged);\n\n connect(_projectWatcher, &QFileSystemWatcher::fileChanged,\n this, &FilesystemWatcher::onProjectFileChanged);\n\n connect(_project, &AbstractProject::filenameChanged,\n this, &FilesystemWatcher::watchProjectFile);\n\n connect(_project, &AbstractProject::aboutToSaveProject,\n this, &FilesystemWatcher::onAboutToSaveProject);\n\n connect(_project, &AbstractProject::resourceItemCreated,\n this, &FilesystemWatcher::onResourceItemCreated);\n\n connect(_project, &AbstractProject::selectedResourceChanged,\n this, &FilesystemWatcher::onSelectedResourceChanged);\n\n connect(_project, &AbstractProject::resourceItemAboutToBeRemoved,\n this, &FilesystemWatcher::removeResourceItem);\n}\n\nvoid FilesystemWatcher::watchProjectFile()\n{\n QString fn = _project->filename();\n if (fn.isEmpty() == false) {\n fn = QDir::fromNativeSeparators(fn);\n }\n\n QStringList toRemove = _projectWatcher->files();\n toRemove << _projectWatcher->directories();\n\n if (toRemove.size() == 1 && toRemove.first() == fn) {\n \/\/ already watching project file\n return;\n }\n\n if (toRemove.isEmpty() == false) {\n _projectWatcher->removePaths(toRemove);\n }\n\n if (fn.isEmpty() == false && QFile::exists(fn)) {\n _projectWatcher->addPath(_project->filename());\n }\n}\n\nvoid FilesystemWatcher::onAboutToSaveProject()\n{\n _filesSavedLocally.append(_project->filename());\n}\n\nvoid FilesystemWatcher::onProjectFileChanged(const QString& path)\n{\n QString nativePath = QDir::toNativeSeparators(path);\n\n if (_filesSavedLocally.contains(nativePath)) {\n \/\/ Do not process items were saved by the editor\n _filesSavedLocally.removeAll(nativePath);\n\n \/\/ If the path was replaced we need to add it to the watcher again.\n watchProjectFile();\n return;\n }\n\n _project->undoStack()->resetClean();\n for (AbstractResourceList* rl : _project->resourceLists()) {\n for (AbstractResourceItem* item : rl->items()) {\n if (auto* inItem = qobject_cast<AbstractInternalResourceItem*>(item)) {\n inItem->undoStack()->resetClean();\n }\n }\n }\n\n QMessageBox::warning(\n nullptr, tr(\"Project File Changed\"),\n tr(\"The project file \\\"%1\\\" has been changed on disk.\\n\"\n \"Please save or discard changes manually.\")\n .arg(QFileInfo(path).fileName()));\n\n watchProjectFile();\n}\n\nvoid FilesystemWatcher::onResourceItemCreated(AbstractResourceItem* item)\n{\n updateWatcherAndMaps(item);\n\n connect(item, &AbstractResourceItem::externalFilesChanged,\n this, &FilesystemWatcher::onResourceItemExternalFilesChanged);\n\n if (auto* exItem = qobject_cast<AbstractExternalResourceItem*>(item)) {\n connect(exItem, &AbstractExternalResourceItem::aboutToSaveResource,\n this, &FilesystemWatcher::onAboutToSaveResource);\n }\n}\n\nvoid FilesystemWatcher::onSelectedResourceChanged()\n{\n \/\/ Reload the watcher when the selected item is changed.\n \/\/ Just in case a file that did not exist is now existing.\n\n if (auto* item = _project->selectedResource()) {\n updateWatcherAndMaps(item);\n }\n}\n\nvoid FilesystemWatcher::onResourceItemExternalFilesChanged()\n{\n auto* item = qobject_cast<AbstractResourceItem*>(sender());\n if (item) {\n updateWatcherAndMaps(item);\n }\n}\n\nstatic QStringList resourceNativeFilenames(const AbstractResourceItem* item)\n{\n QStringList nativeFilenames = item->externalFiles();\n\n if (auto* exItem = qobject_cast<const AbstractExternalResourceItem*>(item)) {\n nativeFilenames << exItem->filename();\n }\n\n nativeFilenames.removeAll(QString());\n\n for (QString& fn : nativeFilenames) {\n fn = QDir::toNativeSeparators(QFileInfo(fn).absoluteFilePath());\n }\n\n return nativeFilenames;\n}\n\nvoid FilesystemWatcher::updateWatcherAndMaps(AbstractResourceItem* item)\n{\n Q_ASSERT(item);\n\n const QStringList nativeFilenames = resourceNativeFilenames(item);\n const QStringList watchedFiles = _watcher->files();\n const QStringList previousFilenames = _itemToFilenames.value(item);\n\n bool emitModified = previousFilenames != nativeFilenames;\n\n {\n \/\/ Check the watched\/existing status of every filename.\n \/\/ It may not have existed in the past, but it could exist now.\n\n QStringList toWatch;\n toWatch.reserve(nativeFilenames.size());\n\n for (const QString& nativePath : nativeFilenames) {\n QString path = QDir::fromNativeSeparators(nativePath);\n\n bool fileUnwatched = watchedFiles.contains(path) == false;\n bool fileExists = QFile::exists(nativePath);\n\n if (fileUnwatched && fileExists) {\n toWatch << path;\n\n emitModified = true;\n }\n if (fileUnwatched || !fileExists) {\n ImageCache::invalidateFilename(nativePath.toStdString());\n }\n }\n\n if (toWatch.isEmpty() == false) {\n \/\/ This is more efficient then adding paths one at a time\n _watcher->addPaths(toWatch);\n }\n }\n\n QStringList toAdd = nativeFilenames;\n\n for (const QString& prevFilename : previousFilenames) {\n int i = toAdd.indexOf(prevFilename);\n if (i >= 0) {\n toAdd.removeAt(i);\n }\n else {\n removeFilenameItemMapping(prevFilename, item);\n }\n }\n\n for (const QString& filename : toAdd) {\n auto it = _filenameToItems.find(filename);\n if (it == _filenameToItems.end()) {\n it = _filenameToItems.insert(filename, {});\n }\n if (it->contains(item) == false) {\n it->append(item);\n }\n }\n\n if (nativeFilenames.isEmpty() == false) {\n _itemToFilenames.insert(item, nativeFilenames);\n }\n else {\n _itemToFilenames.remove(item);\n }\n\n if (emitModified) {\n emit item->externalFilesModified();\n\n item->markUnchecked();\n }\n}\n\nvoid FilesystemWatcher::removeResourceItem(AbstractResourceItem* item)\n{\n Q_ASSERT(item);\n\n const QStringList filenames = _itemToFilenames.value(item);\n for (const QString& fn : filenames) {\n removeFilenameItemMapping(fn, item);\n }\n\n _itemToFilenames.remove(item);\n}\n\nvoid FilesystemWatcher::removeFilenameItemMapping(const QString& filename, AbstractResourceItem* item)\n{\n auto it = _filenameToItems.find(filename);\n if (it != _filenameToItems.end()) {\n it->removeAll(item);\n if (it->isEmpty()) {\n _watcher->removePath(filename);\n\n _filenameToItems.remove(filename);\n }\n }\n}\n\nvoid FilesystemWatcher::onAboutToSaveResource()\n{\n auto* item = qobject_cast<AbstractExternalResourceItem*>(sender());\n if (item) {\n _filesSavedLocally.append(item->filename());\n }\n}\n\nvoid FilesystemWatcher::onFileChanged(const QString& path)\n{\n auto watchPathAgain = [&]() {\n \/\/ If the path was replaced (ie, file copy or atomic write) then the\n \/\/ watcher will automatically remove the path and we need to add it back\n \/\/ again.\n if (_watcher->files().contains(path) == false) {\n if (QFile::exists(path)) {\n _watcher->addPath(path);\n }\n }\n };\n\n QString nativePath = QDir::toNativeSeparators(path);\n\n ImageCache::invalidateFilename(nativePath.toStdString());\n\n if (_filesSavedLocally.contains(nativePath)) {\n \/\/ Do not process items were saved by the editor\n _filesSavedLocally.removeAll(nativePath);\n\n watchPathAgain();\n return;\n }\n\n auto it = _filenameToItems.find(nativePath);\n if (it != _filenameToItems.end()) {\n const auto& items = *it;\n\n for (AbstractResourceItem* item : items) {\n if (auto* exItem = qobject_cast<AbstractExternalResourceItem*>(item)) {\n if (nativePath == exItem->filename()) {\n resourceChangedOnDisk(exItem);\n continue;\n }\n }\n\n emit item->externalFilesModified();\n\n item->markUnchecked();\n }\n }\n else {\n qWarning() << nativePath << \"is not linked to a ResourceItem\";\n }\n\n watchPathAgain();\n}\n\nvoid FilesystemWatcher::resourceChangedOnDisk(AbstractExternalResourceItem* item)\n{\n if (_changedResources.contains(item) == false) {\n _changedResources.append(item);\n }\n if (_filesChangedDialogActive == false) {\n showFilesChangedDialog();\n }\n}\n\nvoid FilesystemWatcher::showFilesChangedDialog()\n{\n Q_ASSERT(_filesChangedDialogActive == false);\n _filesChangedDialogActive = true;\n\n QMessageBox dialog;\n\n dialog.setWindowTitle(tr(\"Changed Files\"));\n dialog.addButton(QMessageBox::Yes);\n dialog.addButton(QMessageBox::No);\n dialog.addButton(QMessageBox::NoToAll);\n dialog.setDefaultButton(QMessageBox::No);\n\n {\n \/\/ Set size of dialog so the buttons are always in the same place.\n\n \/\/ QMessageDialog setSize methods do not work,\n \/\/ however setting the size of the label does.\n\n QSize labelSize(dialog.fontMetrics().width('m') * 50,\n dialog.fontMetrics().height() * 5);\n\n for (QLabel* l : dialog.findChildren<QLabel*>()) {\n l->setFixedSize(labelSize);\n }\n }\n\n while (!_changedResources.empty()) {\n QPointer<AbstractExternalResourceItem> item = _changedResources.first();\n\n if (item) {\n dialog.setText(tr(\"The file \\\"%1\\\" has been changed on disk.\\n\"\n \"Do you want to reload it?\\n\\n\"\n \"You will not be able to undo this action.\")\n .arg(item->relativeFilePath()));\n\n dialog.exec();\n\n switch (dialog.result()) {\n case QMessageBox::Yes:\n if (item) {\n auto* newItem = item->resourceList()->revertResource(item);\n newItem->project()->setSelectedResource(newItem);\n }\n _changedResources.removeFirst();\n break;\n\n case QMessageBox::No:\n if (item) {\n item->undoStack()->resetClean();\n }\n _changedResources.removeFirst();\n break;\n\n case QMessageBox::NoToAll:\n for (auto& i : _changedResources) {\n if (i) {\n i->undoStack()->resetClean();\n }\n }\n _changedResources.clear();\n break;\n }\n }\n }\n\n _filesChangedDialogActive = false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Halide.h>\n#include <sys\/time.h>\n\nusing namespace Halide;\n\ndouble currentTime() {\n timeval t;\n gettimeofday(&t, NULL);\n return t.tv_sec * 1000.0 + t.tv_usec \/ 1000.0f;\n}\n\nint main(int argc, char **argv) {\n\n Func f, g, h; Var x, y;\n \n h(x) = x;\n g(x) = h(x-1) + h(x+1);\n f(x, y) = (g(x-1) + g(x+1)) + y;\n\n h.root();\n g.root();\n\n if (use_gpu()) {\n f.cudaTile(x, y, 16, 16);\n g.cudaTile(x, 128);\n h.cudaTile(x, 128);\n }\n\n Image<int> out = f.realize(32, 32);\n\n for (int y = 0; y < 32; y++) {\n for (int x = 0; x < 32; x++) {\n if (out(x, y) != x*4 + y) {\n printf(\"out(%d, %d) = %d instead of %d\\n\", x, y, out(x, y), x*4+y);\n return -1;\n }\n }\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<commit_msg>Clear spurious timing code from bounds_interence<commit_after>#include <Halide.h>\nusing namespace Halide;\n\nint main(int argc, char **argv) {\n\n Func f, g, h; Var x, y;\n \n h(x) = x;\n g(x) = h(x-1) + h(x+1);\n f(x, y) = (g(x-1) + g(x+1)) + y;\n\n h.root();\n g.root();\n\n if (use_gpu()) {\n f.cudaTile(x, y, 16, 16);\n g.cudaTile(x, 128);\n h.cudaTile(x, 128);\n }\n\n Image<int> out = f.realize(32, 32);\n\n for (int y = 0; y < 32; y++) {\n for (int x = 0; x < 32; x++) {\n if (out(x, y) != x*4 + y) {\n printf(\"out(%d, %d) = %d instead of %d\\n\", x, y, out(x, y), x*4+y);\n return -1;\n }\n }\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * XMLSaveHandler.cpp\n *\n * Created on: 29.05.2017\n * Author: Alexander\n *\/\n\n#include \"persistence\/xml\/XMLSaveHandler.hpp\"\n\n#ifdef NDEBUG\n#define MSG_DEBUG(a) \/**\/\n#else\n#define MSG_DEBUG(a) std::cout << \"| DEBUG | \" << a << std::endl\n#endif\n#define MSG_WARNING(a) std::cout << \"| WARNING | \"<< a << std::endl\n#define MSG_ERROR(a) std::cout << \"| ERROR | \" << a << std::endl\n#define MSG_FLF __FILE__ << \":\" << __LINE__ << \" \" << __FUNCTION__ << \"() \"\n\n#include <iostream>\n#include <sstream> \/\/ used for addReferences()\n\n#include \"boost\/algorithm\/string.hpp\" \/\/ used for string splitting\n#include \"ecore\/EObject.hpp\"\n#include \"persistence\/base\/HandlerHelper.hpp\"\n\n#include \"xerces\/XStr.hpp\"\n#include \"xerces\/WStr.hpp\"\n#include \"xercesc\/dom\/DOMException.hpp\"\n#include \"xercesc\/util\/OutOfMemoryException.hpp\"\n\nusing namespace persistence::xml;\n\nXMLSaveHandler::XMLSaveHandler ()\n{\n\tm_doc = nullptr;\n\tm_currentElement = nullptr;\n}\n\nXMLSaveHandler::~XMLSaveHandler ()\n{\n\tif ( m_doc )\n\t{\n\t\tm_doc->release();\n\t}\n}\n\n\/**\/\nDOMDocument *XMLSaveHandler::getDOMDocument ()\n{\n\treturn m_doc;\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& name, const std::string& ns_uri )\n{\n\treturn this->createRootNode( name, ns_uri, nullptr );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& prefix, const std::string& name, const std::string& ns_uri )\n{\n\treturn this->createRootNode( prefix, name, ns_uri, nullptr );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& prefix, const std::string& name, const std::string& ns_uri, DOMDocumentType *doctype )\n{\n\tm_rootPrefix = prefix;\n\treturn this->createRootNode( prefix + \":\" + name, ns_uri, doctype );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& name, const std::string& ns_uri, DOMDocumentType *doctype )\n{\n\tDOMImplementation* impl = DOMImplementationRegistry::getDOMImplementation( X( \"Core\" ) );\n\n\tif ( impl != NULL )\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_doc = impl->createDocument( (ns_uri.empty()) ? 0 : X( ns_uri ), \/\/ root element namespace URI.\n\t\t\tX( name ), \t\t\t\t\t\/\/ root element name\n\t\t\tdoctype ); \t \t\t\/\/ document type object (DTD).\n\n\t\t\tm_currentElement = m_doc->getDocumentElement(); \/\/ get root element\n\t\t\tm_currentElement->setAttribute(X(\"xmi:version\"), X(\"2.0\"));\n\t\t\tm_currentElement->setAttribute(X(\"xmlns:xmi\"), X(\"http:\/\/www.omg.org\/XMI\"));\n\t\t\tm_currentElement->setAttribute(X(\"xmlns:xsi\"), X(\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\"));\n\t\t}\n\t\tcatch ( const OutOfMemoryException& )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF << \"OutOfMemoryException\" );\n\t\t\t\/\/errorCode = 5;\n\t\t\treturn false;\n\t\t}\n\t\tcatch ( const DOMException& e )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t\t\t\/\/errorCode = 2;\n\t\t\treturn false;\n\t\t}\n\t\tcatch ( ... )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF <<\"An error occurred creating the document\" );\n\t\t\t\/\/errorCode = 3;\n\t\t\treturn false;\n\t\t}\n\t} \/\/ (impl != NULL)\n\telse\n\t{\n\t\tMSG_ERROR( MSG_FLF <<\"Requested implementation is not supported\" );\n\t\t\/\/errorCode = 4;\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool XMLSaveHandler::createAndAddElement ( const std::string& name )\n{\n\tif ( m_doc == nullptr )\n\t{\n\t\tMSG_ERROR( MSG_FLF <<\"No root-Element created first\" );\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\taddChild( m_currentElement, m_doc->createElement( X( name ) ) );\n\n\t\treturn true;\n\t}\n}\n\nvoid XMLSaveHandler::addChild ( DOMElement* parent_elem, DOMElement* child_elem )\n{\n\t\/\/ Add child to parent Element, and set child as current Element.\n\tm_currentElement = (DOMElement *) parent_elem->appendChild( child_elem );\n}\n\nvoid XMLSaveHandler::addAttribute ( const std::string& name, const std::string& value )\n{\n\ttry\n\t{\n\t\tm_currentElement->setAttribute( X( name ), X( value ) );\n\t}\n\tcatch ( const DOMException& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t}\n\tcatch ( std::exception& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Exception code is: \" << e.what() );\n\t}\n}\n\nvoid XMLSaveHandler::addReferences ( const std::string &name, std::shared_ptr<ecore::EObject> object )\n{\n\tif (object == nullptr)\n\t{\n\t\tstd::cerr << \"XMLSaveHandler::addReferences called with object == nullptr\" << std::endl;\n\t\treturn;\n\t}\n\ttry\n\t{\n\t\tstd::string ref = \"\";\n\t\tauto iter = m_refToObject_map.find(object);\n\t\tif (iter != m_refToObject_map.end())\n\t\t{\n\t\t\tref = iter->second;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tref = persistence::base::HandlerHelper::extractReference( object, m_rootObject, m_rootPrefix );\n\t\t}\n\n\t\tstd::stringstream ss;\n\t\tstd::string tmpStr = W( m_currentElement->getAttribute(X( name )) );\n\n\t\tif ( !tmpStr.empty() )\n\t\t{\n\t\t\tss << tmpStr << \" \";\n\t\t}\n\t\tss << ref;\n\n\t\taddAttribute( name, ss.str() );\n\t}\n\tcatch ( const DOMException& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t}\n\tcatch ( std::exception& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Exception code is: \" << e.what() );\n\t}\n}\n\nvoid XMLSaveHandler::release ()\n{\n\tif ( m_currentElement == nullptr )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Current DOMElement m_currentElement is nullptr\" );\n\t}\n\telse\n\t{\n\t\t\/\/ set m_currentElement's parent node as new m_currentElement (decrease depth)\n\t\tm_currentElement = (DOMElement*) m_currentElement->getParentNode();\n\t}\n}\n\n\nvoid XMLSaveHandler::addTypeReference(const std::string& href, const std::string& xmitype)\n{\n\tcreateAndAddElement(\"type\");\n\taddAttribute(\"href\", href);\n\taddAttribute(\"xmi:type\", xmitype);\n\trelease();\n}\n\n\nvoid XMLSaveHandler::addAttributeAsNode(const std::string& name, const std::string& value)\n{\n\tcreateAndAddElement(name);\n\tm_currentElement->setTextContent(X(value));\n\trelease();\n}\n<commit_msg>[persistence] save root id<commit_after>\/*\n * XMLSaveHandler.cpp\n *\n * Created on: 29.05.2017\n * Author: Alexander\n *\/\n\n#include \"persistence\/xml\/XMLSaveHandler.hpp\"\n\n#ifdef NDEBUG\n#define MSG_DEBUG(a) \/**\/\n#else\n#define MSG_DEBUG(a) std::cout << \"| DEBUG | \" << a << std::endl\n#endif\n#define MSG_WARNING(a) std::cout << \"| WARNING | \"<< a << std::endl\n#define MSG_ERROR(a) std::cout << \"| ERROR | \" << a << std::endl\n#define MSG_FLF __FILE__ << \":\" << __LINE__ << \" \" << __FUNCTION__ << \"() \"\n\n#include <iostream>\n#include <sstream> \/\/ used for addReferences()\n\n#include \"boost\/algorithm\/string.hpp\" \/\/ used for string splitting\n#include \"ecore\/EObject.hpp\"\n#include \"persistence\/base\/HandlerHelper.hpp\"\n\n#include \"xerces\/XStr.hpp\"\n#include \"xerces\/WStr.hpp\"\n#include \"xercesc\/dom\/DOMException.hpp\"\n#include \"xercesc\/util\/OutOfMemoryException.hpp\"\n\nusing namespace persistence::xml;\n\nXMLSaveHandler::XMLSaveHandler ()\n{\n\tm_doc = nullptr;\n\tm_currentElement = nullptr;\n}\n\nXMLSaveHandler::~XMLSaveHandler ()\n{\n\tif ( m_doc )\n\t{\n\t\tm_doc->release();\n\t}\n}\n\n\/**\/\nDOMDocument *XMLSaveHandler::getDOMDocument ()\n{\n\treturn m_doc;\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& name, const std::string& ns_uri )\n{\n\treturn this->createRootNode( name, ns_uri, nullptr );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& prefix, const std::string& name, const std::string& ns_uri )\n{\n\treturn this->createRootNode( prefix, name, ns_uri, nullptr );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& prefix, const std::string& name, const std::string& ns_uri, DOMDocumentType *doctype )\n{\n\tm_rootPrefix = prefix;\n\treturn this->createRootNode( prefix + \":\" + name, ns_uri, doctype );\n}\n\nbool XMLSaveHandler::createRootNode ( const std::string& name, const std::string& ns_uri, DOMDocumentType *doctype )\n{\n\tDOMImplementation* impl = DOMImplementationRegistry::getDOMImplementation( X( \"Core\" ) );\n\n\tif ( impl != NULL )\n\t{\n\t\ttry\n\t\t{\n\t\t\tm_doc = impl->createDocument( (ns_uri.empty()) ? 0 : X( ns_uri ), \/\/ root element namespace URI.\n\t\t\tX( name ), \t\t\t\t\t\/\/ root element name\n\t\t\tdoctype ); \t \t\t\/\/ document type object (DTD).\n\n\t\t\tm_currentElement = m_doc->getDocumentElement(); \/\/ get root element\n\t\t\tm_currentElement->setAttribute(X(\"xmi:version\"), X(\"2.0\"));\n\t\t\tm_currentElement->setAttribute(X(\"xmlns:xmi\"), X(\"http:\/\/www.omg.org\/XMI\"));\n\t\t\tm_currentElement->setAttribute(X(\"xmlns:xsi\"), X(\"http:\/\/www.w3.org\/2001\/XMLSchema-instance\"));\n\n\t\t\tif (!m_isXSIMode && m_rootObject != nullptr)\n\t\t\t{\n\t\t\t\tauto iter = m_refToObject_map.find(m_rootObject);\n\t\t\t\tif (iter != m_refToObject_map.end())\n\t\t\t\t{\n\t\t\t\t\taddAttribute(\"xmi:id\", iter->second);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tstd::cout << \"id not found for root element\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch ( const OutOfMemoryException& )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF << \"OutOfMemoryException\" );\n\t\t\t\/\/errorCode = 5;\n\t\t\treturn false;\n\t\t}\n\t\tcatch ( const DOMException& e )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t\t\t\/\/errorCode = 2;\n\t\t\treturn false;\n\t\t}\n\t\tcatch ( ... )\n\t\t{\n\t\t\tMSG_ERROR( MSG_FLF <<\"An error occurred creating the document\" );\n\t\t\t\/\/errorCode = 3;\n\t\t\treturn false;\n\t\t}\n\t} \/\/ (impl != NULL)\n\telse\n\t{\n\t\tMSG_ERROR( MSG_FLF <<\"Requested implementation is not supported\" );\n\t\t\/\/errorCode = 4;\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\nbool XMLSaveHandler::createAndAddElement ( const std::string& name )\n{\n\tif ( m_doc == nullptr )\n\t{\n\t\tMSG_ERROR( MSG_FLF <<\"No root-Element created first\" );\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\taddChild( m_currentElement, m_doc->createElement( X( name ) ) );\n\n\t\treturn true;\n\t}\n}\n\nvoid XMLSaveHandler::addChild ( DOMElement* parent_elem, DOMElement* child_elem )\n{\n\t\/\/ Add child to parent Element, and set child as current Element.\n\tm_currentElement = (DOMElement *) parent_elem->appendChild( child_elem );\n}\n\nvoid XMLSaveHandler::addAttribute ( const std::string& name, const std::string& value )\n{\n\ttry\n\t{\n\t\tm_currentElement->setAttribute( X( name ), X( value ) );\n\t}\n\tcatch ( const DOMException& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t}\n\tcatch ( std::exception& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Exception code is: \" << e.what() );\n\t}\n}\n\nvoid XMLSaveHandler::addReferences ( const std::string &name, std::shared_ptr<ecore::EObject> object )\n{\n\tif (object == nullptr)\n\t{\n\t\tstd::cerr << \"XMLSaveHandler::addReferences called with object == nullptr\" << std::endl;\n\t\treturn;\n\t}\n\ttry\n\t{\n\t\tstd::string ref = \"\";\n\t\tauto iter = m_refToObject_map.find(object);\n\t\tif (iter != m_refToObject_map.end())\n\t\t{\n\t\t\tref = iter->second;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tref = persistence::base::HandlerHelper::extractReference( object, m_rootObject, m_rootPrefix );\n\t\t}\n\n\t\tstd::stringstream ss;\n\t\tstd::string tmpStr = W( m_currentElement->getAttribute(X( name )) );\n\n\t\tif ( !tmpStr.empty() )\n\t\t{\n\t\t\tss << tmpStr << \" \";\n\t\t}\n\t\tss << ref;\n\n\t\taddAttribute( name, ss.str() );\n\t}\n\tcatch ( const DOMException& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"DOMException code is: \" << e.code << std::endl << W( e.getMessage() ) );\n\t}\n\tcatch ( std::exception& e )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Exception code is: \" << e.what() );\n\t}\n}\n\nvoid XMLSaveHandler::release ()\n{\n\tif ( m_currentElement == nullptr )\n\t{\n\t\tMSG_ERROR( MSG_FLF << \"Current DOMElement m_currentElement is nullptr\" );\n\t}\n\telse\n\t{\n\t\t\/\/ set m_currentElement's parent node as new m_currentElement (decrease depth)\n\t\tm_currentElement = (DOMElement*) m_currentElement->getParentNode();\n\t}\n}\n\n\nvoid XMLSaveHandler::addTypeReference(const std::string& href, const std::string& xmitype)\n{\n\tcreateAndAddElement(\"type\");\n\taddAttribute(\"href\", href);\n\taddAttribute(\"xmi:type\", xmitype);\n\trelease();\n}\n\n\nvoid XMLSaveHandler::addAttributeAsNode(const std::string& name, const std::string& value)\n{\n\tcreateAndAddElement(name);\n\tm_currentElement->setTextContent(X(value));\n\trelease();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <type_traits>\n#include <gtest\/gtest.h>\n#include <entt\/entity\/entity.hpp>\n#include <entt\/entity\/registry.hpp>\n\nstruct entity_id {\n using entity_type = typename entt::entt_traits<entt::entity>::entity_type;\n\n entity_id(entity_type value = entt::null)\n : entt{value}\n {}\n\n entity_id(const entity_id &other)\n : entt{other.entt}\n {}\n\n operator entity_type() const {\n return entt;\n }\n\nprivate:\n entity_type entt;\n};\n\ntemplate<>\nstruct entt::entt_traits<entity_id>: entt::entt_traits<entt::entity> {};\n\nTEST(Example, CustomIdentifier) {\n entt::basic_registry<entity_id> registry{};\n entity_id entity{};\n\n ASSERT_FALSE(registry.valid(entity));\n ASSERT_TRUE(entity == entt::null);\n\n entity = registry.create();\n\n ASSERT_TRUE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n\n ASSERT_FALSE((registry.all_of<int, char>(entity)));\n ASSERT_EQ(registry.try_get<int>(entity), nullptr);\n\n registry.emplace<int>(entity, 42);\n\n ASSERT_TRUE((registry.any_of<int, char>(entity)));\n ASSERT_EQ(registry.get<int>(entity), 42);\n\n registry.destroy(entity);\n\n ASSERT_FALSE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n\n entity = registry.create();\n\n ASSERT_TRUE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n}\n<commit_msg>test: refined custom id example<commit_after>#include <type_traits>\n#include <gtest\/gtest.h>\n#include <entt\/entity\/entity.hpp>\n#include <entt\/entity\/registry.hpp>\n\nstruct entity_id {\n using entity_type = typename entt::entt_traits<entt::entity>::entity_type;\n static constexpr auto null = entt::null;\n\n constexpr entity_id(entity_type value = null)\n : entt{value}\n {}\n\n constexpr entity_id(const entity_id &other)\n : entt{other.entt}\n {}\n\n constexpr operator entity_type() const {\n return entt;\n }\n\nprivate:\n entity_type entt;\n};\n\ntemplate<>\nstruct entt::entt_traits<entity_id>: entt::entt_traits<entt::entity> {};\n\nTEST(Example, CustomIdentifier) {\n entt::basic_registry<entity_id> registry{};\n entity_id entity{};\n\n ASSERT_FALSE(registry.valid(entity));\n ASSERT_TRUE(entity == entt::null);\n\n entity = registry.create();\n\n ASSERT_TRUE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n\n ASSERT_FALSE((registry.all_of<int, char>(entity)));\n ASSERT_EQ(registry.try_get<int>(entity), nullptr);\n\n registry.emplace<int>(entity, 42);\n\n ASSERT_TRUE((registry.any_of<int, char>(entity)));\n ASSERT_EQ(registry.get<int>(entity), 42);\n\n registry.destroy(entity);\n\n ASSERT_FALSE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n\n entity = registry.create();\n\n ASSERT_TRUE(registry.valid(entity));\n ASSERT_TRUE(entity != entt::null);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"HalideRuntime.h\"\n\n#include <math.h>\n#include <stdio.h>\n\n#include \"example.h\"\n#include \"static_image.h\"\n\nconst int kSize = 32;\n\nvoid verify(const Image<int> &img, float compiletime_factor, float runtime_factor, int channels) {\n for (int i = 0; i < kSize; i++) {\n for (int j = 0; j < kSize; j++) {\n for (int c = 0; c < channels; c++) {\n int expected = (int32_t)(compiletime_factor * runtime_factor * c * (i > j ? i : j));\n if (img(i, j, c) != expected) {\n printf(\"img[%d, %d, %d] = %d (expected %d)\\n\", i, j, c, img(i, j, c), expected);\n exit(-1);\n }\n }\n }\n }\n}\n\nint main(int argc, char **argv) {\n\n Image<int32_t> output(kSize, kSize, 3);\n\n \/\/ For Ahead-of-time compilation, we don't get to customize any GeneratorParams:\n \/\/ they were baked into the object code by our build system. These are the default values\n \/\/ for Example (replicated here to use in verify()).\n const float compiletime_factor = 1.0f;\n const int channels = 3;\n\n \/\/ We can, of course, pass whatever values for Param\/ImageParam that we like.\n example(3.3f, output);\n verify(output, compiletime_factor, 3.3f, channels);\n\n example(-1.234f, output);\n verify(output, compiletime_factor, -1.234f, channels);\n\n printf(\"Success!\\n\");\n return 0;\n}<commit_msg>Make floating point test more stable<commit_after>#include \"HalideRuntime.h\"\n\n#include <math.h>\n#include <stdio.h>\n\n#include \"example.h\"\n#include \"static_image.h\"\n\nconst int kSize = 32;\n\nvoid verify(const Image<int> &img, float compiletime_factor, float runtime_factor, int channels) {\n for (int i = 0; i < kSize; i++) {\n for (int j = 0; j < kSize; j++) {\n for (int c = 0; c < channels; c++) {\n int expected = (int32_t)(compiletime_factor * runtime_factor * c * (i > j ? i : j));\n if (img(i, j, c) != expected) {\n printf(\"img[%d, %d, %d] = %d (expected %d)\\n\", i, j, c, img(i, j, c), expected);\n exit(-1);\n }\n }\n }\n }\n}\n\nint main(int argc, char **argv) {\n\n Image<int32_t> output(kSize, kSize, 3);\n\n \/\/ For Ahead-of-time compilation, we don't get to customize any GeneratorParams:\n \/\/ they were baked into the object code by our build system. These are the default values\n \/\/ for Example (replicated here to use in verify()).\n const float compiletime_factor = 1.0f;\n const int channels = 3;\n\n \/\/ We can, of course, pass whatever values for Param\/ImageParam that we like.\n example(3.3245f, output);\n verify(output, compiletime_factor, 3.3245f, channels);\n\n example(-1.234f, output);\n verify(output, compiletime_factor, -1.234f, channels);\n\n printf(\"Success!\\n\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\/ @file ViewerManager.cpp Launches graphic viewers. Class definitions.\n\n\/\/============================================================================\n\/\/\n\/\/ This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/ The GPSTk is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser General Public License as published\n\/\/ by the Free Software Foundation; either version 2.1 of the License, or\n\/\/ any later version.\n\/\/\n\/\/ The GPSTk is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/ Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/ \n\/\/ Copyright 2004, The University of Texas at Austin\n\/\/\n\/\/============================================================================\n\n#include <iostream>\n#include <stdlib.h>\n#include \"ViewerManager.hpp\"\n\nnamespace vplot\n{\n ViewerManager::ViewerManager(const std::string& envVar)\n {\n const char* envVarValue = getenv(envVar.c_str());\n if (envVarValue!=NULL)\n viewerList.push_back(envVarValue);\n }\n\n void ViewerManager::registerViewer(const std::string& viewer)\n {\n using namespace std;\n \n list<string>::iterator it=find(viewerList.begin(), viewerList.end(), viewer);\n if (it==viewerList.end())\n viewerList.push_back(viewer); \n }\n\n bool ViewerManager::view(const std::string& fileName) throw (VPlotException)\n {\n using namespace std;\n bool worked=false;\n\n list<string>::iterator viewer;\n for (viewer=viewerList.begin(); viewer!=viewerList.end(); viewer++)\n {\n std::cout << \"Going to launch \" << *viewer << std::endl;\n string command = (*viewer) + \" \" + fileName;\n if (system(command.c_str())==0)\n\t {\n\t worked=true;\n\t break;\n }\n std::cout << \"... couldn't execute: \" << command << std::endl;\n }\n\n return worked;\n }\n \n\n} \/\/ namespace vplot\n\n<commit_msg>Added an include for the better, non-creative compilers.<commit_after>\n\/\/\/ @file ViewerManager.cpp Launches graphic viewers. Class definitions.\n\n\/\/============================================================================\n\/\/\n\/\/ This file is part of GPSTk, the GPS Toolkit.\n\/\/\n\/\/ The GPSTk is free software; you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU Lesser General Public License as published\n\/\/ by the Free Software Foundation; either version 2.1 of the License, or\n\/\/ any later version.\n\/\/\n\/\/ The GPSTk is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with GPSTk; if not, write to the Free Software Foundation,\n\/\/ Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/ \n\/\/ Copyright 2004, The University of Texas at Austin\n\/\/\n\/\/============================================================================\n\n#include <iostream>\n#include <stdlib.h>\n#include <algorithm>\n\n#include \"ViewerManager.hpp\"\n\nnamespace vplot\n{\n ViewerManager::ViewerManager(const std::string& envVar)\n {\n const char* envVarValue = getenv(envVar.c_str());\n if (envVarValue!=NULL)\n viewerList.push_back(envVarValue);\n }\n\n void ViewerManager::registerViewer(const std::string& viewer)\n {\n using namespace std;\n \n list<string>::iterator it=find(viewerList.begin(), viewerList.end(), viewer);\n if (it==viewerList.end())\n viewerList.push_back(viewer); \n }\n\n bool ViewerManager::view(const std::string& fileName) throw (VPlotException)\n {\n using namespace std;\n bool worked=false;\n\n list<string>::iterator viewer;\n for (viewer=viewerList.begin(); viewer!=viewerList.end(); viewer++)\n {\n std::cout << \"Going to launch \" << *viewer << std::endl;\n string command = (*viewer) + \" \" + fileName;\n if (system(command.c_str())==0)\n\t {\n\t worked=true;\n\t break;\n }\n std::cout << \"... couldn't execute: \" << command << std::endl;\n }\n\n return worked;\n }\n \n\n} \/\/ namespace vplot\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n *\/\n#pragma once\n\n#include \"libbirch\/external.hpp\"\n#include \"libbirch\/memory.hpp\"\n#include \"libbirch\/thread.hpp\"\n#include \"libbirch\/type.hpp\"\n#include \"libbirch\/Shape.hpp\"\n#include \"libbirch\/Iterator.hpp\"\n#include \"libbirch\/Eigen.hpp\"\n#include \"libbirch\/ReadersWriterLock.hpp\"\n\nnamespace libbirch {\n\/**\n * Array.\n *\n * @tparam T Value type.\n * @tparam F Shape type.\n *\/\ntemplate<class T, class F>\nclass Array {\n template<class U, class G> friend class Array;\npublic:\n using this_type = Array<T,F>;\n using value_type = T;\n using shape_type = F;\n using eigen_type = typename eigen_type<this_type>::type;\n using eigen_stride_type = typename eigen_stride_type<this_type>::type;\n\n \/**\n * Constructor.\n *\/\n Array() :\n shape(),\n buffer(nullptr),\n isView(false) {\n assert(shape.volume() == 0);\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n *\/\n Array(const F& shape) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n initialize();\n }\n\n \/**\n * Constructor.\n *\n * @tparam ...Args Constructor parameter types.\n *\n * @param shape Shape.\n * @param args Constructor arguments.\n *\/\n template<class... Args, std::enable_if_t<std::is_constructible<T,Args...>::value,int> = 0>\n Array(const F& shape, Args&&... args) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n initialize(std::forward<Args>(args)...);\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n * @param values Values.\n *\/\n template<class G = F, std::enable_if_t<G::count() == 1,int> = 0>\n Array(const std::initializer_list<T>& values) :\n shape(values.size()),\n buffer(nullptr),\n isView(false) {\n allocate();\n std::uninitialized_copy(values.begin(), values.end(), begin());\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n * @param values Values.\n *\/\n template<class G = F, std::enable_if_t<G::count() == 2,int> = 0>\n Array(const std::initializer_list<std::initializer_list<T>>& values) :\n shape(values.size(), values.begin()->size()),\n buffer(nullptr),\n isView(false) {\n allocate();\n auto ptr = buf();\n for (auto row : values) {\n for (auto value : row) {\n new (ptr++) T(value);\n }\n }\n }\n\n \/**\n * Constructor.\n *\n * @param l Lambda called to construct each element.\n * @param shape Shape.\n *\/\n template<class L>\n Array(const L& l, const F& shape) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n int64_t n = 0;\n for (auto iter = begin(); iter != end(); ++iter) {\n new (&*iter) T(l(n++));\n }\n }\n\n \/**\n * Copy constructor.\n *\/\n Array(const Array& o) :\n shape(o.shape.compact()),\n buffer(nullptr),\n isView(false) {\n allocate();\n uninitialized_copy(o);\n }\n\n \/**\n * Generic copy constructor.\n *\/\n template<class U, class G, std::enable_if_t<F::count() == G::count() &&\n std::is_convertible<U,T>::value,int> = 0>\n Array(const Array<U,G>& o) :\n shape(o.shape.compact()),\n buffer(nullptr),\n isView(false) {\n allocate();\n uninitialized_copy(o);\n }\n\n \/**\n * Move constructor.\n *\/\n Array(Array&& o) : Array() {\n if (!o.isView) {\n swap(o);\n } else {\n shape = o.shape.compact();\n allocate();\n uninitialized_copy(o);\n }\n }\n\n \/**\n * Destructor.\n *\/\n ~Array() {\n release();\n }\n\n \/**\n * Copy assignment.\n *\/\n Array& operator=(const Array& o) {\n assign(o);\n return *this;\n }\n\n \/**\n * Move assignment.\n *\/\n Array& operator=(Array&& o) {\n if (!isView && !o.isView) {\n swap(o);\n } else {\n assign(o);\n }\n return *this;\n }\n\n \/**\n * Copy assignment. For a view the shapes of the two arrays must\n * conform, otherwise a resize is permitted.\n *\/\n void assign(const Array<T,F>& o) {\n if (isView) {\n libbirch_assert_msg_(o.shape.conforms(shape), \"array sizes are different\");\n copy(o);\n } else {\n Array<T,F> tmp(o);\n swap(tmp);\n }\n }\n\n \/**\n * Number of elements.\n *\/\n auto size() const {\n return shape.size();\n }\n\n \/**\n * Number of elements allocated.\n *\/\n auto volume() const {\n return shape.volume();\n }\n\n \/**\n * @name Element access.\n *\/\n \/\/\/@{\n \/**\n * Iterator pointing to the first element.\n *\n * Iterators are used to access the elements of an array sequentially.\n * Elements are visited in the order in which they are stored in memory;\n * the rightmost dimension is the fastest moving (for a matrix, this is\n * \"row major\" order).\n *\/\n Iterator<T,F> begin() {\n return Iterator<T,F>(buf(), shape);\n }\n Iterator<T,F> begin() const {\n return Iterator<T,F>(buf(), shape);\n }\n Iterator<T,F> end() {\n return begin() + size();\n }\n Iterator<T,F> end() const {\n return begin() + size();\n }\n\n \/**\n * Slice.\n *\n * @tparam V Slice type.\n *\n * @param slice Slice.\n *\n * @return The resulting view or element.\n *\/\n template<class V, std::enable_if_t<V::rangeCount() != 0,int> = 0>\n auto slice(const V& slice) {\n return Array<T,decltype(shape(slice))>(shape(slice), buffer,\n shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() != 0,int> = 0>\n auto slice(const V& slice) const {\n return Array<T,decltype(shape(slice))>(shape(slice), buffer,\n shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() == 0,int> = 0>\n auto& slice(const V& slice) {\n return *(buf() + shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() == 0,int> = 0>\n auto slice(const V& slice) const {\n return *(buf() + shape.serial(slice));\n }\n\n \/**\n * Slice.\n *\n * @tparam ...Args Slice argument types.\n *\n * @param args... Slice arguments.\n *\n * @return The resulting view or element.\n *\/\n template<class... Args>\n decltype(auto) operator()(Args&&... args) {\n return slice(make_slice(std::forward<Args>(args)...));\n }\n template<class... Args>\n decltype(auto) operator()(Args&&... args) const {\n return slice(make_slice(std::forward<Args>(args)...));\n }\n \/\/\/@}\n\n \/**\n * Compare.\n *\/\n template<class U, class G>\n bool operator==(const Array<U,G>& o) const {\n return std::equal(begin(), end(), o.begin());\n }\n template<class U, class G>\n bool operator!=(const Array<U,G>& o) const {\n return !(*this == o);\n }\n\n \/**\n * @name Resize\n *\/\n \/\/\/@{\n \/**\n * For a one-dimensional array, push an element onto the end. This increases\n * the array size by one.\n *\n * @param x Value.\n *\/\n void push(const T& x) {\n insert(size(), x);\n }\n\n \/**\n * For a one-dimensional array, insert an element at a given position. This\n * increases the array size by one.\n *\n * @param i Position.\n * @param x Value.\n *\/\n void insert(const int64_t i, const T& x) {\n static_assert(F::count() == 1, \"can only enlarge one-dimensional arrays\");\n assert(!isView);\n\n auto n = size();\n auto s = F(n + 1);\n if (!buffer) {\n Array<T,F> tmp(s, x);\n swap(tmp);\n } else {\n buffer = (T*)std::realloc(buffer, s.volume()*sizeof(T));\n std::memmove((void*)(buf() + i + 1), (void*)(buf() + i), (n - i)*sizeof(T));\n new (buf() + i) T(x);\n shape = s;\n }\n }\n\n \/**\n * For a one-dimensional array, erase elements from a given position. This\n * decreases the array size by the number of elements.\n *\n * @param i Position.\n * @param len Number of elements to erase.\n *\/\n void erase(const int64_t i, const int64_t len = 1) {\n static_assert(F::count() == 1, \"can only shrink one-dimensional arrays\");\n assert(!isView);\n assert(len > 0);\n assert(size() >= len);\n\n auto n = size();\n auto s = F(n - len);\n if (s.size() == 0) {\n release();\n } else {\n for (int j = i; j < i + len; ++j) {\n buf()[j].~T();\n }\n std::memmove((void*)(buf() + i), (void*)(buf() + i + len), (n - len - i)*sizeof(T));\n buffer = (T*)std::realloc(buffer, s.volume()*sizeof(T));\n }\n shape = s;\n }\n \/\/\/@}\n\n \/**\n * @name Eigen integration\n *\/\n \/\/\/@{\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n operator eigen_type() const {\n return toEigen();\n }\n\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n auto toEigen() {\n return eigen_type(buf(), rows(), cols(), eigen_stride_type(rowStride(),\n colStride()));\n }\n\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n auto toEigen() const {\n return eigen_type(buf(), rows(), cols(), eigen_stride_type(rowStride(),\n colStride()));\n }\n\n \/**\n * Construct from Eigen Matrix expression.\n *\/\n template<class EigenType, std::enable_if_t<is_eigen_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::MatrixBase<EigenType>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Construct from Eigen DiagonalWrapper expression.\n *\/\n template<class EigenType, std::enable_if_t<is_diagonal_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::DiagonalWrapper<EigenType>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Construct from Eigen TriangularView expression.\n *\/\n template<class EigenType, unsigned Mode, std::enable_if_t<is_triangle_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::TriangularView<EigenType,Mode>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Number of rows. For a vectoor, this is the length.\n *\/\n auto rows() const {\n assert(1 <= F::count() && F::count() <= 2);\n return shape.length(0);\n }\n\n \/**\n * Number of columns. For a vector, this is 1.\n *\/\n auto cols() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? 1 : shape.length(1);\n }\n\n \/**\n * Stride between rows.\n *\/\n auto rowStride() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? shape.volume() : shape.stride(0);\n }\n\n \/**\n * Stride between columns.\n *\/\n auto colStride() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? shape.stride(0) : shape.stride(1);\n }\n \/\/\/@}\n\nprivate:\n \/**\n * Constructor for views.\n *\/\n Array(const F& shape, T* buffer, int64_t offset) :\n shape(shape),\n buffer(buffer + offset),\n isView(true) {\n \/\/\n }\n\n \/**\n * Raw pointer to underlying buffer.\n *\/\n T* buf() const {\n return buffer;\n }\n\n \/**\n * Swap with another array.\n *\/\n void swap(Array<T,F>& o) {\n assert(!isView);\n assert(!o.isView);\n std::swap(shape, o.shape);\n std::swap(buffer, o.buffer);\n }\n\n \/**\n * Allocate memory for array, leaving uninitialized.\n *\/\n void allocate() {\n assert(!buffer);\n size_t bytes = volume()*sizeof(T);\n if (bytes > 0) {\n buffer = (T*)std::malloc(bytes);\n }\n }\n\n \/**\n * Deallocate memory of array.\n *\/\n void release() {\n if (!isView) {\n size_t bytes = volume()*sizeof(T);\n if (bytes > 0) {\n std::destroy(begin(), end());\n std::free(buffer);\n buffer = nullptr;\n }\n }\n }\n\n \/**\n * Initialize allocated memory.\n *\n * @param args Constructor arguments.\n *\/\n template<class ... Args, std::enable_if_t<std::is_constructible<T,Args...>::value,int> = 0>\n void initialize(Args&&... args) {\n auto iter = begin();\n auto last = end();\n for (; iter != last; ++iter) {\n new (&*iter) T(std::forward<Args>(args)...);\n }\n }\n\n \/**\n * Assign from another array.\n *\/\n template<class U>\n void copy(const U& o) {\n auto n = std::min(size(), o.size());\n auto begin1 = o.begin();\n auto end1 = begin1 + n;\n auto begin2 = begin();\n auto end2 = begin2 + n;\n if (inside(begin1, end1, begin2)) {\n std::copy_backward(begin1, end1, end2);\n } else {\n std::copy(begin1, end1, begin2);\n }\n }\n\n \/**\n * Copy from another array.\n *\/\n template<class U>\n void uninitialized_copy(const U& o) {\n auto n = std::min(size(), o.size());\n auto begin1 = o.begin();\n auto end1 = begin1 + n;\n auto begin2 = begin();\n for (; begin1 != end1; ++begin1, ++begin2) {\n new (&*begin2) T(*begin1);\n }\n }\n\n \/**\n * Shape.\n *\/\n F shape;\n\n \/**\n * Buffer.\n *\/\n T* buffer;\n\n \/**\n * Is this a view of another array? A view has stricter assignment\n * semantics, as it cannot be resized or moved.\n *\/\n bool isView;\n};\n\n\/**\n * Default array for `D` dimensions.\n *\/\ntemplate<class T, int D>\nusing DefaultArray = Array<T,typename DefaultShape<D>::type>;\n\n}\n<commit_msg>Addressed compile warnings on use of realloc().<commit_after>\/**\n * @file\n *\/\n#pragma once\n\n#include \"libbirch\/external.hpp\"\n#include \"libbirch\/memory.hpp\"\n#include \"libbirch\/thread.hpp\"\n#include \"libbirch\/type.hpp\"\n#include \"libbirch\/Shape.hpp\"\n#include \"libbirch\/Iterator.hpp\"\n#include \"libbirch\/Eigen.hpp\"\n#include \"libbirch\/ReadersWriterLock.hpp\"\n\nnamespace libbirch {\n\/**\n * Array.\n *\n * @tparam T Value type.\n * @tparam F Shape type.\n *\/\ntemplate<class T, class F>\nclass Array {\n template<class U, class G> friend class Array;\npublic:\n using this_type = Array<T,F>;\n using value_type = T;\n using shape_type = F;\n using eigen_type = typename eigen_type<this_type>::type;\n using eigen_stride_type = typename eigen_stride_type<this_type>::type;\n\n \/**\n * Constructor.\n *\/\n Array() :\n shape(),\n buffer(nullptr),\n isView(false) {\n assert(shape.volume() == 0);\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n *\/\n Array(const F& shape) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n initialize();\n }\n\n \/**\n * Constructor.\n *\n * @tparam ...Args Constructor parameter types.\n *\n * @param shape Shape.\n * @param args Constructor arguments.\n *\/\n template<class... Args, std::enable_if_t<std::is_constructible<T,Args...>::value,int> = 0>\n Array(const F& shape, Args&&... args) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n initialize(std::forward<Args>(args)...);\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n * @param values Values.\n *\/\n template<class G = F, std::enable_if_t<G::count() == 1,int> = 0>\n Array(const std::initializer_list<T>& values) :\n shape(values.size()),\n buffer(nullptr),\n isView(false) {\n allocate();\n std::uninitialized_copy(values.begin(), values.end(), begin());\n }\n\n \/**\n * Constructor.\n *\n * @param shape Shape.\n * @param values Values.\n *\/\n template<class G = F, std::enable_if_t<G::count() == 2,int> = 0>\n Array(const std::initializer_list<std::initializer_list<T>>& values) :\n shape(values.size(), values.begin()->size()),\n buffer(nullptr),\n isView(false) {\n allocate();\n auto ptr = buf();\n for (auto row : values) {\n for (auto value : row) {\n new (ptr++) T(value);\n }\n }\n }\n\n \/**\n * Constructor.\n *\n * @param l Lambda called to construct each element.\n * @param shape Shape.\n *\/\n template<class L>\n Array(const L& l, const F& shape) :\n shape(shape),\n buffer(nullptr),\n isView(false) {\n allocate();\n int64_t n = 0;\n for (auto iter = begin(); iter != end(); ++iter) {\n new (&*iter) T(l(n++));\n }\n }\n\n \/**\n * Copy constructor.\n *\/\n Array(const Array& o) :\n shape(o.shape.compact()),\n buffer(nullptr),\n isView(false) {\n allocate();\n uninitialized_copy(o);\n }\n\n \/**\n * Generic copy constructor.\n *\/\n template<class U, class G, std::enable_if_t<F::count() == G::count() &&\n std::is_convertible<U,T>::value,int> = 0>\n Array(const Array<U,G>& o) :\n shape(o.shape.compact()),\n buffer(nullptr),\n isView(false) {\n allocate();\n uninitialized_copy(o);\n }\n\n \/**\n * Move constructor.\n *\/\n Array(Array&& o) : Array() {\n if (!o.isView) {\n swap(o);\n } else {\n shape = o.shape.compact();\n allocate();\n uninitialized_copy(o);\n }\n }\n\n \/**\n * Destructor.\n *\/\n ~Array() {\n release();\n }\n\n \/**\n * Copy assignment.\n *\/\n Array& operator=(const Array& o) {\n assign(o);\n return *this;\n }\n\n \/**\n * Move assignment.\n *\/\n Array& operator=(Array&& o) {\n if (!isView && !o.isView) {\n swap(o);\n } else {\n assign(o);\n }\n return *this;\n }\n\n \/**\n * Copy assignment. For a view the shapes of the two arrays must\n * conform, otherwise a resize is permitted.\n *\/\n void assign(const Array<T,F>& o) {\n if (isView) {\n libbirch_assert_msg_(o.shape.conforms(shape), \"array sizes are different\");\n copy(o);\n } else {\n Array<T,F> tmp(o);\n swap(tmp);\n }\n }\n\n \/**\n * Number of elements.\n *\/\n auto size() const {\n return shape.size();\n }\n\n \/**\n * Number of elements allocated.\n *\/\n auto volume() const {\n return shape.volume();\n }\n\n \/**\n * @name Element access.\n *\/\n \/\/\/@{\n \/**\n * Iterator pointing to the first element.\n *\n * Iterators are used to access the elements of an array sequentially.\n * Elements are visited in the order in which they are stored in memory;\n * the rightmost dimension is the fastest moving (for a matrix, this is\n * \"row major\" order).\n *\/\n Iterator<T,F> begin() {\n return Iterator<T,F>(buf(), shape);\n }\n Iterator<T,F> begin() const {\n return Iterator<T,F>(buf(), shape);\n }\n Iterator<T,F> end() {\n return begin() + size();\n }\n Iterator<T,F> end() const {\n return begin() + size();\n }\n\n \/**\n * Slice.\n *\n * @tparam V Slice type.\n *\n * @param slice Slice.\n *\n * @return The resulting view or element.\n *\/\n template<class V, std::enable_if_t<V::rangeCount() != 0,int> = 0>\n auto slice(const V& slice) {\n return Array<T,decltype(shape(slice))>(shape(slice), buffer,\n shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() != 0,int> = 0>\n auto slice(const V& slice) const {\n return Array<T,decltype(shape(slice))>(shape(slice), buffer,\n shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() == 0,int> = 0>\n auto& slice(const V& slice) {\n return *(buf() + shape.serial(slice));\n }\n template<class V, std::enable_if_t<V::rangeCount() == 0,int> = 0>\n auto slice(const V& slice) const {\n return *(buf() + shape.serial(slice));\n }\n\n \/**\n * Slice.\n *\n * @tparam ...Args Slice argument types.\n *\n * @param args... Slice arguments.\n *\n * @return The resulting view or element.\n *\/\n template<class... Args>\n decltype(auto) operator()(Args&&... args) {\n return slice(make_slice(std::forward<Args>(args)...));\n }\n template<class... Args>\n decltype(auto) operator()(Args&&... args) const {\n return slice(make_slice(std::forward<Args>(args)...));\n }\n \/\/\/@}\n\n \/**\n * Compare.\n *\/\n template<class U, class G>\n bool operator==(const Array<U,G>& o) const {\n return std::equal(begin(), end(), o.begin());\n }\n template<class U, class G>\n bool operator!=(const Array<U,G>& o) const {\n return !(*this == o);\n }\n\n \/**\n * @name Resize\n *\/\n \/\/\/@{\n \/**\n * For a one-dimensional array, push an element onto the end. This increases\n * the array size by one.\n *\n * @param x Value.\n *\/\n void push(const T& x) {\n insert(size(), x);\n }\n\n \/**\n * For a one-dimensional array, insert an element at a given position. This\n * increases the array size by one.\n *\n * @param i Position.\n * @param x Value.\n *\/\n void insert(const int64_t i, const T& x) {\n static_assert(F::count() == 1, \"can only enlarge one-dimensional arrays\");\n assert(!isView);\n\n auto n = size();\n auto s = F(n + 1);\n if (!buffer) {\n Array<T,F> tmp(s, x);\n swap(tmp);\n } else {\n buffer = (T*)std::realloc((void*)buffer, s.volume()*sizeof(T));\n std::memmove((void*)(buf() + i + 1), (void*)(buf() + i), (n - i)*sizeof(T));\n new (buf() + i) T(x);\n shape = s;\n }\n }\n\n \/**\n * For a one-dimensional array, erase elements from a given position. This\n * decreases the array size by the number of elements.\n *\n * @param i Position.\n * @param len Number of elements to erase.\n *\/\n void erase(const int64_t i, const int64_t len = 1) {\n static_assert(F::count() == 1, \"can only shrink one-dimensional arrays\");\n assert(!isView);\n assert(len > 0);\n assert(size() >= len);\n\n auto n = size();\n auto s = F(n - len);\n if (s.size() == 0) {\n release();\n } else {\n for (int j = i; j < i + len; ++j) {\n buf()[j].~T();\n }\n std::memmove((void*)(buf() + i), (void*)(buf() + i + len), (n - len - i)*sizeof(T));\n buffer = (T*)std::realloc((void*)buffer, s.volume()*sizeof(T));\n }\n shape = s;\n }\n \/\/\/@}\n\n \/**\n * @name Eigen integration\n *\/\n \/\/\/@{\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n operator eigen_type() const {\n return toEigen();\n }\n\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n auto toEigen() {\n return eigen_type(buf(), rows(), cols(), eigen_stride_type(rowStride(),\n colStride()));\n }\n\n template<class Check = T, std::enable_if_t<std::is_arithmetic<Check>::value,int> = 0>\n auto toEigen() const {\n return eigen_type(buf(), rows(), cols(), eigen_stride_type(rowStride(),\n colStride()));\n }\n\n \/**\n * Construct from Eigen Matrix expression.\n *\/\n template<class EigenType, std::enable_if_t<is_eigen_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::MatrixBase<EigenType>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Construct from Eigen DiagonalWrapper expression.\n *\/\n template<class EigenType, std::enable_if_t<is_diagonal_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::DiagonalWrapper<EigenType>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Construct from Eigen TriangularView expression.\n *\/\n template<class EigenType, unsigned Mode, std::enable_if_t<is_triangle_compatible<this_type,EigenType>::value,int> = 0>\n Array(const Eigen::TriangularView<EigenType,Mode>& o) :\n shape(o.rows(), o.cols()),\n buffer(nullptr),\n isView(false) {\n allocate();\n toEigen() = o;\n }\n\n \/**\n * Number of rows. For a vectoor, this is the length.\n *\/\n auto rows() const {\n assert(1 <= F::count() && F::count() <= 2);\n return shape.length(0);\n }\n\n \/**\n * Number of columns. For a vector, this is 1.\n *\/\n auto cols() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? 1 : shape.length(1);\n }\n\n \/**\n * Stride between rows.\n *\/\n auto rowStride() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? shape.volume() : shape.stride(0);\n }\n\n \/**\n * Stride between columns.\n *\/\n auto colStride() const {\n assert(1 <= F::count() && F::count() <= 2);\n return F::count() == 1 ? shape.stride(0) : shape.stride(1);\n }\n \/\/\/@}\n\nprivate:\n \/**\n * Constructor for views.\n *\/\n Array(const F& shape, T* buffer, int64_t offset) :\n shape(shape),\n buffer(buffer + offset),\n isView(true) {\n \/\/\n }\n\n \/**\n * Raw pointer to underlying buffer.\n *\/\n T* buf() const {\n return buffer;\n }\n\n \/**\n * Swap with another array.\n *\/\n void swap(Array<T,F>& o) {\n assert(!isView);\n assert(!o.isView);\n std::swap(shape, o.shape);\n std::swap(buffer, o.buffer);\n }\n\n \/**\n * Allocate memory for array, leaving uninitialized.\n *\/\n void allocate() {\n assert(!buffer);\n size_t bytes = volume()*sizeof(T);\n if (bytes > 0) {\n buffer = (T*)std::malloc(bytes);\n }\n }\n\n \/**\n * Deallocate memory of array.\n *\/\n void release() {\n if (!isView) {\n size_t bytes = volume()*sizeof(T);\n if (bytes > 0) {\n std::destroy(begin(), end());\n std::free(buffer);\n buffer = nullptr;\n }\n }\n }\n\n \/**\n * Initialize allocated memory.\n *\n * @param args Constructor arguments.\n *\/\n template<class ... Args, std::enable_if_t<std::is_constructible<T,Args...>::value,int> = 0>\n void initialize(Args&&... args) {\n auto iter = begin();\n auto last = end();\n for (; iter != last; ++iter) {\n new (&*iter) T(std::forward<Args>(args)...);\n }\n }\n\n \/**\n * Assign from another array.\n *\/\n template<class U>\n void copy(const U& o) {\n auto n = std::min(size(), o.size());\n auto begin1 = o.begin();\n auto end1 = begin1 + n;\n auto begin2 = begin();\n auto end2 = begin2 + n;\n if (inside(begin1, end1, begin2)) {\n std::copy_backward(begin1, end1, end2);\n } else {\n std::copy(begin1, end1, begin2);\n }\n }\n\n \/**\n * Copy from another array.\n *\/\n template<class U>\n void uninitialized_copy(const U& o) {\n auto n = std::min(size(), o.size());\n auto begin1 = o.begin();\n auto end1 = begin1 + n;\n auto begin2 = begin();\n for (; begin1 != end1; ++begin1, ++begin2) {\n new (&*begin2) T(*begin1);\n }\n }\n\n \/**\n * Shape.\n *\/\n F shape;\n\n \/**\n * Buffer.\n *\/\n T* buffer;\n\n \/**\n * Is this a view of another array? A view has stricter assignment\n * semantics, as it cannot be resized or moved.\n *\/\n bool isView;\n};\n\n\/**\n * Default array for `D` dimensions.\n *\/\ntemplate<class T, int D>\nusing DefaultArray = Array<T,typename DefaultShape<D>::type>;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"page_manager.h\"\n#include \"utils.h\"\n#include \"bloom_filter.h\"\n\n#include <mutex>\n#include <cstring>\n#include <cassert>\n\nusing namespace dariadb::storage;\n\ndariadb::storage::PageManager* PageManager::_instance=nullptr;\n#pragma pack(push, 1)\nstruct PageHader {\n\tuint32_t chunk_per_storage;\n\tuint32_t chunk_size;\n\n\tuint32_t pos_index;\n\tuint32_t pos_chunks;\n\n\tuint32_t count_readers;\n};\n\nstruct Page_ChunkIndex {\n\tChunkIndexInfo info;\n\tuint64_t offset;\n};\n#pragma pack(pop)\n\nstruct Page {\n\tuint8_t *region;\n\tPageHader *header;\n\tPage_ChunkIndex*index;\n\tuint8_t *chunks;\n\tstd::mutex lock;\n\n\tbool append(const Chunk_Ptr&ch) {\n\t\tstd::lock_guard<std::mutex> lg(lock);\n\n\t\tif (is_full()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tauto index_rec = (ChunkIndexInfo*)ch.get();\n\t\tauto buffer = ch->_buffer_t.data();\n\t\t\n\t\tassert(header->chunk_size == ch->_buffer_t.size());\n\n\t\tindex[header->pos_index].info = *index_rec;\n\t\tindex[header->pos_index].offset = header->pos_chunks;\n\t\tmemcpy(this->chunks+header->pos_chunks, buffer, sizeof(uint8_t)*header->chunk_size);\n\t\t\n\t\theader->pos_chunks += header->chunk_size;\n\t\theader->pos_index++;\n\t\treturn true;\n\t}\n\n\tbool is_full()const {\n\t\treturn !(header->pos_index < header->chunk_per_storage);\n\t}\n\n\tChuncksList get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\t\theader->count_readers++;\n\n\t\tChuncksList result{};\n\t\tauto index_end = index + header->chunk_per_storage;\n\t\tfor (auto index_it = index; index_it != index_end; ++index_it) {\n\t\t\tif ((ids.size() != 0) && (std::find(ids.begin(), ids.end(), index_it->info.first.id) == ids.end())) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (!dariadb::bloom_check(index_it->info.flag_bloom, flag)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((dariadb::utils::inInterval(from, to, index_it->info.minTime)) || (dariadb::utils::inInterval(from, to, index_it->info.maxTime))) {\n\t\t\t\tChunk_Ptr c=std::make_shared<Chunk>(index_it->info, chunks + index_it->offset,header->chunk_size);\n\t\t\t\tresult.push_back(c);\n\t\t\t}\n\t\t}\n\t\theader->count_readers--;\n\t\treturn result;\n\t}\n};\n\nclass PageManager::Private\n{\npublic:\n\tPrivate(size_t chunk_per_storage, size_t chunk_size) :\n\t\t_chunk_per_storage(static_cast<uint32_t>(chunk_per_storage)),\n\t\t_chunk_size(static_cast<uint32_t>(chunk_size)),\n\t\t_cur_page(nullptr)\n\t{}\n\n\t~Private() {\n\t\tif (_cur_page != nullptr) {\n\t\t\tdelete _cur_page->region;\n\t\t\tdelete _cur_page;\n\t\t\t_cur_page = nullptr;\n\t\t}\n\t}\n\n\tuint64_t calc_page_size()const {\n\t\tauto sz_index = sizeof(Page_ChunkIndex)*_chunk_per_storage;\n\t\tauto sz_buffers = _chunk_per_storage*_chunk_size;\n\t\treturn sizeof(PageHader)\n\t\t\t+ sz_index\n\t\t\t+ sz_buffers;\n\t}\n\n\tPage* create_page() {\n\t\tauto sz = calc_page_size();\n\t\tauto region = new uint8_t[sz];\n\t\tstd::fill(region, region + sz, 0);\n\n\t\tauto res = new Page;\n\t\tres->region = region;\n\t\tres->header = reinterpret_cast<PageHader*>(region);\n\t\tres->index = reinterpret_cast<Page_ChunkIndex*>(region+sizeof(PageHader));\n\t\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHader) + sizeof(Page_ChunkIndex)*_chunk_per_storage);\n\t\t\n\t\tres->header->chunk_per_storage = _chunk_per_storage;\n\t\tres->header->chunk_size = _chunk_size;\n\t\treturn res;\n\t\t\n\t}\n\n\tPage* get_cur_page() {\n\t\tif (_cur_page == nullptr) {\n\t\t\t_cur_page = create_page();\n\t\t}\n\t\treturn _cur_page;\n\t}\n\n\tbool append_chunk(const Chunk_Ptr&ch) {\n\t\tauto pg=get_cur_page();\n\t\treturn pg->append(ch);\n\t}\n\n\tChuncksList get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\t\tauto p = get_cur_page();\n\n\t\treturn p->get_chunks(ids, from, to, flag);\n\t}\n\nprotected:\n\tuint32_t _chunk_per_storage;\n\tuint32_t _chunk_size;\n\tPage* _cur_page;\n};\n\nPageManager::PageManager(size_t chunk_per_storage, size_t chunk_size):\n\timpl(new PageManager::Private{chunk_per_storage,chunk_size})\n{\n\t\n}\n\nPageManager::~PageManager() {\n}\n\nvoid PageManager::start(size_t chunk_per_storage, size_t chunk_size){\n if(PageManager::_instance==nullptr){\n PageManager::_instance=new PageManager(chunk_per_storage,chunk_size);\n }\n}\n\nvoid PageManager::stop(){\n if(_instance!=nullptr){\n delete PageManager::_instance;\n\t\t_instance = nullptr;\n }\n}\n\nPageManager* PageManager::instance(){\n return _instance;\n}\n\nbool PageManager::append_chunk(const Chunk_Ptr&ch) {\n\treturn impl->append_chunk(ch);\n}\n\nChuncksList PageManager::get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\treturn impl->get_chunks(ids, from, to, flag);\n}<commit_msg>strange msvc.<commit_after>#include \"page_manager.h\"\n#include \"utils.h\"\n#include \"bloom_filter.h\"\n\n#include <mutex>\n#include <cstring>\n#include <cassert>\n#include <algorithm>\n\nusing namespace dariadb::storage;\n\ndariadb::storage::PageManager* PageManager::_instance=nullptr;\n#pragma pack(push, 1)\nstruct PageHader {\n\tuint32_t chunk_per_storage;\n\tuint32_t chunk_size;\n\n\tuint32_t pos_index;\n\tuint32_t pos_chunks;\n\n\tuint32_t count_readers;\n};\n\nstruct Page_ChunkIndex {\n\tChunkIndexInfo info;\n\tuint64_t offset;\n};\n#pragma pack(pop)\n\nstruct Page {\n\tuint8_t *region;\n\tPageHader *header;\n\tPage_ChunkIndex*index;\n\tuint8_t *chunks;\n\tstd::mutex lock;\n\n\tbool append(const Chunk_Ptr&ch) {\n\t\tstd::lock_guard<std::mutex> lg(lock);\n\n\t\tif (is_full()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tauto index_rec = (ChunkIndexInfo*)ch.get();\n\t\tauto buffer = ch->_buffer_t.data();\n\t\t\n\t\tassert(header->chunk_size == ch->_buffer_t.size());\n\n\t\tindex[header->pos_index].info = *index_rec;\n\t\tindex[header->pos_index].offset = header->pos_chunks;\n\t\tmemcpy(this->chunks+header->pos_chunks, buffer, sizeof(uint8_t)*header->chunk_size);\n\t\t\n\t\theader->pos_chunks += header->chunk_size;\n\t\theader->pos_index++;\n\t\treturn true;\n\t}\n\n\tbool is_full()const {\n\t\treturn !(header->pos_index < header->chunk_per_storage);\n\t}\n\n\tChuncksList get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\t\theader->count_readers++;\n\n\t\tChuncksList result{};\n\t\tauto index_end = index + header->chunk_per_storage;\n\t\tfor (auto index_it = index; index_it != index_end; ++index_it) {\n\t\t\tif ((ids.size() != 0) && (std::find(ids.begin(), ids.end(), index_it->info.first.id) == ids.end())) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (!dariadb::bloom_check(index_it->info.flag_bloom, flag)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif ((dariadb::utils::inInterval(from, to, index_it->info.minTime)) || (dariadb::utils::inInterval(from, to, index_it->info.maxTime))) {\n\t\t\t\tChunk_Ptr c=std::make_shared<Chunk>(index_it->info, chunks + index_it->offset,header->chunk_size);\n\t\t\t\tresult.push_back(c);\n\t\t\t}\n\t\t}\n\t\theader->count_readers--;\n\t\treturn result;\n\t}\n};\n\nclass PageManager::Private\n{\npublic:\n\tPrivate(size_t chunk_per_storage, size_t chunk_size) :\n\t\t_chunk_per_storage(static_cast<uint32_t>(chunk_per_storage)),\n\t\t_chunk_size(static_cast<uint32_t>(chunk_size)),\n\t\t_cur_page(nullptr)\n\t{}\n\n\t~Private() {\n\t\tif (_cur_page != nullptr) {\n\t\t\tdelete _cur_page->region;\n\t\t\tdelete _cur_page;\n\t\t\t_cur_page = nullptr;\n\t\t}\n\t}\n\n\tuint64_t calc_page_size()const {\n\t\tauto sz_index = sizeof(Page_ChunkIndex)*_chunk_per_storage;\n\t\tauto sz_buffers = _chunk_per_storage*_chunk_size;\n\t\treturn sizeof(PageHader)\n\t\t\t+ sz_index\n\t\t\t+ sz_buffers;\n\t}\n\n\tPage* create_page() {\n\t\tauto sz = calc_page_size();\n\t\tauto region = new uint8_t[sz];\n\t\tstd::fill(region, region + sz, 0);\n\n\t\tauto res = new Page;\n\t\tres->region = region;\n\t\tres->header = reinterpret_cast<PageHader*>(region);\n\t\tres->index = reinterpret_cast<Page_ChunkIndex*>(region+sizeof(PageHader));\n\t\tres->chunks = reinterpret_cast<uint8_t*>(region + sizeof(PageHader) + sizeof(Page_ChunkIndex)*_chunk_per_storage);\n\t\t\n\t\tres->header->chunk_per_storage = _chunk_per_storage;\n\t\tres->header->chunk_size = _chunk_size;\n\t\treturn res;\n\t\t\n\t}\n\n\tPage* get_cur_page() {\n\t\tif (_cur_page == nullptr) {\n\t\t\t_cur_page = create_page();\n\t\t}\n\t\treturn _cur_page;\n\t}\n\n\tbool append_chunk(const Chunk_Ptr&ch) {\n\t\tauto pg=get_cur_page();\n\t\treturn pg->append(ch);\n\t}\n\n\tChuncksList get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\t\tauto p = get_cur_page();\n\n\t\treturn p->get_chunks(ids, from, to, flag);\n\t}\n\nprotected:\n\tuint32_t _chunk_per_storage;\n\tuint32_t _chunk_size;\n\tPage* _cur_page;\n};\n\nPageManager::PageManager(size_t chunk_per_storage, size_t chunk_size):\n\timpl(new PageManager::Private{chunk_per_storage,chunk_size})\n{\n\t\n}\n\nPageManager::~PageManager() {\n}\n\nvoid PageManager::start(size_t chunk_per_storage, size_t chunk_size){\n if(PageManager::_instance==nullptr){\n PageManager::_instance=new PageManager(chunk_per_storage,chunk_size);\n }\n}\n\nvoid PageManager::stop(){\n if(_instance!=nullptr){\n delete PageManager::_instance;\n\t\t_instance = nullptr;\n }\n}\n\nPageManager* PageManager::instance(){\n return _instance;\n}\n\nbool PageManager::append_chunk(const Chunk_Ptr&ch) {\n\treturn impl->append_chunk(ch);\n}\n\nChuncksList PageManager::get_chunks(const dariadb::IdArray&ids, dariadb::Time from, dariadb::Time to, dariadb::Flag flag) {\n\treturn impl->get_chunks(ids, from, to, flag);\n}<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of cpp-ethereum.\n\n cpp-ethereum is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n cpp-ethereum is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file FileSystem.cpp\n * @authors\n *\t Eric Lombrozo <elombrozo@gmail.com>\n *\t Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"FileSystem.h\"\n#include <libdevcore\/Common.h>\n#include <libdevcore\/Log.h>\n\n#ifdef _WIN32\n#include <shlobj.h>\n#endif\n#include <boost\/filesystem.hpp>\nusing namespace std;\nusing namespace dev;\n\nstd::string dev::getDataDir(std::string _prefix)\n{\n\tif (_prefix.empty())\n\t\t_prefix = \"ethereum\";\n#ifdef _WIN32\n\t_prefix[0] = toupper(_prefix[0]);\n\tchar path[1024] = \"\";\n\tif (SHGetSpecialFolderPathA(NULL, path, CSIDL_APPDATA, true))\n\t\treturn (boost::filesystem::path(path) \/ _prefix).string();\n\telse\n\t{\n\t#ifndef _MSC_VER \/\/ todo?\n\t\tcwarn << \"getDataDir(): SHGetSpecialFolderPathA() failed.\";\n\t#endif\n\t\tBOOST_THROW_EXCEPTION(std::runtime_error(\"getDataDir() - SHGetSpecialFolderPathA() failed.\"));\n\t}\n#else\n\tboost::filesystem::path dataDirPath;\n\tchar const* homeDir = getenv(\"HOME\");\n\tif (!homeDir || strlen(homeDir) == 0)\n\t\tdataDirPath = boost::filesystem::path(\"\/\");\n\telse\n\t\tdataDirPath = boost::filesystem::path(homeDir);\n\t\n#if defined(__APPLE__) && defined(__MACH__)\n\t\/\/ This eventually needs to be put in proper wrapper (to support sandboxing)\n\treturn (dataDirPath \/ \"Library\/Application Support\/Ethereum\").string();\n#else\n\treturn (dataDirPath \/ (\".\" + _prefix)).string();\n#endif\n#endif\n}\n<commit_msg>Fix for when macos doesn't set HOME environment variable.<commit_after>\/*\n This file is part of cpp-ethereum.\n\n cpp-ethereum is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n cpp-ethereum is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file FileSystem.cpp\n * @authors\n *\t Eric Lombrozo <elombrozo@gmail.com>\n *\t Gav Wood <i@gavwood.com>\n * @date 2014\n *\/\n\n#include \"FileSystem.h\"\n#include <libdevcore\/Common.h>\n#include <libdevcore\/Log.h>\n\n#if defined(_WIN32)\n#include <shlobj.h>\n#elif defined(__APPLE__)\n#include <stdlib.h>\n#include <stdio.h>\n#include <pwd.h>\n#include <unistd.h>\n#endif\n#include <boost\/filesystem.hpp>\nusing namespace std;\nusing namespace dev;\n\nstd::string dev::getDataDir(std::string _prefix)\n{\n\tif (_prefix.empty())\n\t\t_prefix = \"ethereum\";\n#ifdef _WIN32\n\t_prefix[0] = toupper(_prefix[0]);\n\tchar path[1024] = \"\";\n\tif (SHGetSpecialFolderPathA(NULL, path, CSIDL_APPDATA, true))\n\t\treturn (boost::filesystem::path(path) \/ _prefix).string();\n\telse\n\t{\n\t#ifndef _MSC_VER \/\/ todo?\n\t\tcwarn << \"getDataDir(): SHGetSpecialFolderPathA() failed.\";\n\t#endif\n\t\tBOOST_THROW_EXCEPTION(std::runtime_error(\"getDataDir() - SHGetSpecialFolderPathA() failed.\"));\n\t}\n#else\n\tboost::filesystem::path dataDirPath;\n\tchar const* homeDir = getenv(\"HOME\");\n#if defined(__APPLE__)\n\tif (!homeDir || strlen(homeDir) == 0)\n\t{\n\t\tstruct passwd* pwd = getpwuid(getuid());\n\t\tif (pwd)\n\t\t\thomeDir = pwd->pw_dir;\n\t}\n#endif\n\t\n\tif (!homeDir || strlen(homeDir) == 0)\n\t\tdataDirPath = boost::filesystem::path(\"\/\");\n\telse\n\t\tdataDirPath = boost::filesystem::path(homeDir);\n\t\n#if defined(__APPLE__) && defined(__MACH__)\n\t\/\/ This eventually needs to be put in proper wrapper (to support sandboxing)\n\treturn (dataDirPath \/ \"Library\/Application Support\/Ethereum\").string();\n#else\n\treturn (dataDirPath \/ (\".\" + _prefix)).string();\n#endif\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n kopetemessage.cpp - Base class for Kopete messages\n\n Copyright (c) 2002-2003 by Martijn Klingens <klingens@kde.org>\n\n Kopete (c) 2002-2003 by the Kopete developers <kopete-devel@kde.org>\n\n *************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n *************************************************************************\n*\/\n\n#include <stdlib.h>\n\n#include <qdatetime.h>\n#include <qfont.h>\n#include <qstylesheet.h>\n#include <qregexp.h>\n\n#include <kdebug.h>\n#include <kglobal.h>\n#include <klocale.h>\n#include <kiconloader.h>\n\n#include \"kopeteemoticons.h\"\n#include \"kopetemessage.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopeteonlinestatus.h\"\n#include \"kopeteaccount.h\"\n#include \"kopeteprefs.h\"\n#include \"kopetexsl.h\"\n\nstruct KopeteMessagePrivate\n{\n\tuint refCount;\n\n\tconst KopeteContact *from;\n\tKopeteContactPtrList to;\n\tQColor bgColor;\n\tQColor fgColor;\n\tQColor contactColor;\n\tQDomDocument xmlDoc;\n\tbool contentsModified;\n\tbool highlighted;\n\tQDateTime timeStamp;\n\tQFont font;\n\tQString body;\n\tQString subject;\n\tKopeteMessage::MessageDirection direction;\n\tKopeteMessage::MessageFormat format;\n\tKopeteMessage::MessageType type;\n\tKopeteMessage::MessageImportance importance;\n\n\tbool bgOverride;\n};\n\nKopeteMessage::KopeteMessage()\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), 0L, KopeteContactPtrList(), QString::null, QString::null, Internal, PlainText, Chat );\n}\n\nKopeteMessage::KopeteMessage( const KopeteContact *fromKC, const KopeteContactPtrList &toKC, const QString &body,\n\tMessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), fromKC, toKC, body, QString::null, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const KopeteContact *fromKC, const KopeteContactPtrList &toKC, const QString &body,\n\tconst QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), fromKC, toKC, body, subject, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const QDateTime &timeStamp, const KopeteContact *fromKC, const KopeteContactPtrList &toKC,\n\tconst QString &body, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( timeStamp, fromKC, toKC, body, QString::null, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const QDateTime &timeStamp, const KopeteContact *fromKC, const KopeteContactPtrList &toKC,\n\tconst QString &body, const QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( timeStamp, fromKC, toKC, body, subject, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const KopeteMessage &other )\n{\n\td = other.d;\n\td->refCount++;\n}\n\nKopeteMessage& KopeteMessage::operator=( const KopeteMessage &other )\n{\n\tif( other.d == d )\n\t\treturn *this;\n\n\tdetach();\n\tdelete d;\n\n\td = other.d;\n\td->refCount++;\n\n\treturn *this;\n}\n\nKopeteMessage::~KopeteMessage()\n{\n\td->refCount--;\n\tif( !d->refCount )\n\t\tdelete d;\n}\n\nvoid KopeteMessage::setBgOverride( bool enabled )\n{\n\tdetach();\n\td->bgOverride = enabled;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setFg( const QColor &color )\n{\n\tdetach();\n\td->fgColor = color;\n\tcompareColors( d->fgColor, d->bgColor );\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setBg( const QColor &color )\n{\n\tdetach();\n\td->bgColor = color;\n\tcompareColors( d->fgColor, d->bgColor );\n\tcompareColors( d->contactColor, d->bgColor );\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::compareColors( QColor &colorFg, QColor &colorBg )\n{\n\tint h1, s1, v1, h2, s2, v2, vDiff;\n\tcolorFg.hsv( &h1, &s1, &v1 );\n\tcolorBg.hsv( &h2, &s2, &v2 );\n\tvDiff = v1 - v2;\n\n\tif( h1 == s1 && h2 == s2 && ( abs( vDiff ) <= 150 ) )\n\t\tcolorFg = QColor( h2, s2, (v1 + 127) % 255, QColor::Hsv );\n}\n\nvoid KopeteMessage::setFont( const QFont &font )\n{\n\tdetach();\n\td->font = font;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::highlight()\n{\n\tdetach();\n\td->importance = Highlight;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setBody( const QString &body, MessageFormat f )\n{\n\tdetach();\n\td->body = body;\n\td->format = f;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::init( const QDateTime &timeStamp, const KopeteContact *from, const KopeteContactPtrList &to,\n\tconst QString &body, const QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\tstatic QMap<QString,QColor> colorMap;\n\tstatic int lastColor;\n\tconst QColor nameColors[] = {\n\t\tQt::red, Qt::green, Qt::blue, Qt::cyan, Qt::magenta,\n\t\tQt::darkRed, Qt::darkGreen, Qt::darkCyan, Qt::darkMagenta, Qt::darkYellow\n\t};\n\n\td->refCount = 1;\n\td->timeStamp = timeStamp;\n\td->from = from;\n\td->to = to;\n\td->subject = subject;\n\td->direction = direction;\n\td->fgColor = QColor();\n\td->bgColor = QColor();\n\td->font = QFont();\n\tsetBody( body, f );\n\td->bgOverride = false;\n\td->type = type;\n\t\/\/Importance to low in a multi chat\n\td->importance= (to.count() <= 1) ? Normal : Low ;\n\n\tif( from )\n\t{\n\t\tQString fromName = d->from->metaContact() ? d->from->metaContact()->displayName() : d->from->displayName();\n\n\t\tif( !colorMap.contains( fromName ) )\n\t\t{\n\t\t\tQColor newColor;\n\t\t\tif( direction == Outbound )\n\t\t\t\tnewColor = Qt::yellow;\n\t\t\telse\n\t\t\t\tnewColor = nameColors[(lastColor++) % (sizeof(nameColors) \/ sizeof(nameColors[0]))];\n\t\t\tcolorMap.insert( fromName, newColor );\n\t\t}\n\t\td->contactColor = colorMap[ fromName ];\n\n\t\t\/\/Highlight if the message contains the nickname (i think it should be place in the highlight plugin)\n\t\tif( KopetePrefs::prefs()->highlightEnabled() && from->account() && from->account()->myself() &&\n\t\t\td->body.contains( QRegExp(QString::fromLatin1(\"\\\\b(%1)\\\\b\").arg(from->account()->myself()->displayName()),false) ) )\n\t\t{\n\t\t\thighlight();\n\t\t}\n\t}\n\n\td->contentsModified = true;\n}\n\nQString KopeteMessage::plainBody() const\n{\n\tif( d->format & PlainText )\n\t\treturn d->body;\n\n\t\/\/FIXME: is there a better way to unescape HTML?\n\tQString r = d->body;\n\tr = r.replace( QRegExp( QString::fromLatin1( \"<br\/>\" ) ), QString::fromLatin1( \"\\n\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<br>\" ) ), QString::fromLatin1( \"\\n\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<[^>]*>\" ) ), QString::fromLatin1( \"\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \">\" ) ), QString::fromLatin1( \">\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<\" ) ), QString::fromLatin1( \"<\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \" \" ) ), QString::fromLatin1( \" \" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"&\" ) ), QString::fromLatin1( \"&\" ) );\n\n\treturn r;\n}\n\nQString KopeteMessage::escapedBody() const\n{\n\tif( d->format == PlainText )\n\t{\n\t\tQString parsedString = d->body;\n\n\t\t\/\/Replace carriage returns inside the text\n\t\tparsedString.replace( QRegExp( QString::fromLatin1( \"\\n\" ) ), QString::fromLatin1( \"<br\/>\" ) );\n\n\t\t\/\/Replace a tab with 4 spaces\n\t\tparsedString.replace( QRegExp( QString::fromLatin1( \"\\t\" ) ), QString::fromLatin1( \" \" ) );\n\n\t\t\/\/Escape CDATA end tags\n\t\tparsedString.replace( QRegExp( QString::fromLatin1(\"]]>\") ), QString::fromLatin1(\"]] >\") );\n\n\t\treturn parsedString;\n\t}\n\n\treturn d->body;\n}\n\nQString KopeteMessage::parsedBody() const\n{\n\tif( d->format == ParsedHTML )\n\t\treturn d->body;\n\n\treturn KopeteEmoticons::parseEmoticons(parseLinks(escapedBody()));\n}\n\nQString KopeteMessage::parseLinks( const QString &message ) const\n{\n\tQString result = message;\n\n\t\/\/Replace Email Links\n\tresult.replace( QRegExp( QString::fromLatin1(\"\\\\b([\\\\w\\\\.]+@([\\\\w\\\\.]+\\\\.\\\\w+)+)\\\\b\") ), QString::fromLatin1(\"<a href=\\\"mailto:\\\\1\\\">\\\\1<\/a>\") );\n\n\t\/\/Replace http\/https\/ftp links\n\tresult.replace( QRegExp( QString::fromLatin1(\"\\\\b((http:\/\/\\\\w|ftp:\/\/\\\\w|https:\/\/\\\\w|www\\\\.)[\\\\w\\\\.\/]*)\\\\b\") ), QString::fromLatin1(\"<a href=\\\"\\\\1\\\">\\\\1<\/a>\" ) );\n\n\treturn result;\n}\n\nQDomDocument KopeteMessage::asXML()\n{\n\tQDomDocument doc = d->xmlDoc;\n\tif( !doc.hasChildNodes() || d->contentsModified )\n\t{\n\t\tQDomElement messageNode = doc.createElement( QString::fromLatin1(\"message\") );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"timestamp\"), KGlobal::locale()->formatTime(d->timeStamp.time(), true) );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"importance\"), d->importance );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"subject\"), d->subject );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"direction\"), d->direction );\n\t\tdoc.appendChild( messageNode );\n\n\t\tQDomElement fromNode = doc.createElement( QString::fromLatin1(\"from\") );\n\t\tQDomElement cNode = doc.createElement( QString::fromLatin1(\"contact\") );\n\t\tcNode.setAttribute( QString::fromLatin1(\"contactDisplayName\"), d->from->displayName() );\n\t\tcNode.setAttribute( QString::fromLatin1(\"color\"), d->contactColor.name() );\n\t\tif( d->from->metaContact() )\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), d->from->metaContact()->displayName() );\n\t\telse\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), d->from->displayName() );\n\t\tfromNode.appendChild( cNode );\n\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"from\"), d->from->displayName() );\n\n\t\tQDomElement toNode = doc.createElement( QString::fromLatin1(\"to\") );\n\t\tfor( KopeteContact *c = d->to.first(); c; c = d->to.next() )\n\t\t{\n\t\t\tQDomElement cNode = doc.createElement( QString::fromLatin1(\"contact\") );\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"contactDisplayName\"), c->displayName() );\n\t\t\tif( c->metaContact() )\n\t\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), c->metaContact()->displayName() );\n\t\t\ttoNode.appendChild( cNode );\n\t\t}\n\n\t\tmessageNode.appendChild( fromNode );\n\t\tmessageNode.appendChild( toNode );\n\n\t\tQDomElement bodyNode = doc.createElement( QString::fromLatin1(\"body\") );\n\t\tif( d->bgColor.isValid() )\n\t\t\tbodyNode.setAttribute( QString::fromLatin1(\"bgcolor\"), d->bgColor.name() );\n\t\tif( d->fgColor.isValid() )\n\t\t\tbodyNode.setAttribute( QString::fromLatin1(\"color\"), d->fgColor.name() );\n\t\tbodyNode.setAttribute( QString::fromLatin1(\"font\"), d->font.family() );\n\n\t\tQDomCDATASection bodyText = doc.createCDATASection( KopeteEmoticons::parseEmoticons(parseLinks( escapedBody() )) );\n\t\tbodyNode.appendChild( bodyText );\n\n\t\tmessageNode.appendChild( bodyNode );\n\n\t\td->contentsModified = false;\n\t}\n\n\treturn doc;\n}\n\nQDateTime KopeteMessage::timestamp() const\n{\n\treturn d->timeStamp;\n}\n\nconst KopeteContact *KopeteMessage::from() const\n{\n\treturn d->from;\n}\n\nKopeteContactPtrList KopeteMessage::to() const\n{\n\treturn d->to;\n}\n\nKopeteMessage::MessageType KopeteMessage::type() const\n{\n\treturn d->type;\n}\n\nQColor KopeteMessage::fg() const\n{\n\treturn d->fgColor;\n}\n\nQColor KopeteMessage::bg() const\n{\n\treturn d->bgColor;\n}\n\nQFont KopeteMessage::font() const\n{\n\treturn d->font;\n}\n\nQString KopeteMessage::body() const\n{\n\treturn d->body;\n}\n\nQString KopeteMessage::subject() const\n{\n\treturn d->subject;\n}\n\nKopeteMessage::MessageFormat KopeteMessage::format() const\n{\n\treturn d->format;\n}\n\nKopeteMessage::MessageDirection KopeteMessage::direction() const\n{\n\treturn d->direction;\n}\n\nKopeteMessage::MessageImportance KopeteMessage::importance() const\n{\n\treturn d->importance;\n}\n\nvoid KopeteMessage::setImportance(KopeteMessage::MessageImportance i)\n{\n\td->importance=i;\n}\n\nvoid KopeteMessage::detach()\n{\n\tif( d->refCount == 1 )\n\t\treturn;\n\n\t\/\/ Warning: this only works as long as the private object doesn't contain pointers to allocated objects.\n\t\/\/ The from contact for example is fine, but it's a shallow copy this way.\n\tKopeteMessagePrivate *newD = new KopeteMessagePrivate(*d);\n\tnewD->refCount = 1;\n\td->refCount--;\n\n\td = newD;\n}\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<commit_msg>Allow \"to\" contacts to not have an MC as well, fall back on contact display name<commit_after>\/*\n kopetemessage.cpp - Base class for Kopete messages\n\n Copyright (c) 2002-2003 by Martijn Klingens <klingens@kde.org>\n\n Kopete (c) 2002-2003 by the Kopete developers <kopete-devel@kde.org>\n\n *************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n *************************************************************************\n*\/\n\n#include <stdlib.h>\n\n#include <qdatetime.h>\n#include <qfont.h>\n#include <qstylesheet.h>\n#include <qregexp.h>\n\n#include <kdebug.h>\n#include <kglobal.h>\n#include <klocale.h>\n#include <kiconloader.h>\n\n#include \"kopeteemoticons.h\"\n#include \"kopetemessage.h\"\n#include \"kopetemetacontact.h\"\n#include \"kopeteonlinestatus.h\"\n#include \"kopeteaccount.h\"\n#include \"kopeteprefs.h\"\n#include \"kopetexsl.h\"\n\nstruct KopeteMessagePrivate\n{\n\tuint refCount;\n\n\tconst KopeteContact *from;\n\tKopeteContactPtrList to;\n\tQColor bgColor;\n\tQColor fgColor;\n\tQColor contactColor;\n\tQDomDocument xmlDoc;\n\tbool contentsModified;\n\tbool highlighted;\n\tQDateTime timeStamp;\n\tQFont font;\n\tQString body;\n\tQString subject;\n\tKopeteMessage::MessageDirection direction;\n\tKopeteMessage::MessageFormat format;\n\tKopeteMessage::MessageType type;\n\tKopeteMessage::MessageImportance importance;\n\n\tbool bgOverride;\n};\n\nKopeteMessage::KopeteMessage()\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), 0L, KopeteContactPtrList(), QString::null, QString::null, Internal, PlainText, Chat );\n}\n\nKopeteMessage::KopeteMessage( const KopeteContact *fromKC, const KopeteContactPtrList &toKC, const QString &body,\n\tMessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), fromKC, toKC, body, QString::null, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const KopeteContact *fromKC, const KopeteContactPtrList &toKC, const QString &body,\n\tconst QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( QDateTime::currentDateTime(), fromKC, toKC, body, subject, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const QDateTime &timeStamp, const KopeteContact *fromKC, const KopeteContactPtrList &toKC,\n\tconst QString &body, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( timeStamp, fromKC, toKC, body, QString::null, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const QDateTime &timeStamp, const KopeteContact *fromKC, const KopeteContactPtrList &toKC,\n\tconst QString &body, const QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\td = new KopeteMessagePrivate;\n\n\tinit( timeStamp, fromKC, toKC, body, subject, direction, f, type );\n}\n\nKopeteMessage::KopeteMessage( const KopeteMessage &other )\n{\n\td = other.d;\n\td->refCount++;\n}\n\nKopeteMessage& KopeteMessage::operator=( const KopeteMessage &other )\n{\n\tif( other.d == d )\n\t\treturn *this;\n\n\tdetach();\n\tdelete d;\n\n\td = other.d;\n\td->refCount++;\n\n\treturn *this;\n}\n\nKopeteMessage::~KopeteMessage()\n{\n\td->refCount--;\n\tif( !d->refCount )\n\t\tdelete d;\n}\n\nvoid KopeteMessage::setBgOverride( bool enabled )\n{\n\tdetach();\n\td->bgOverride = enabled;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setFg( const QColor &color )\n{\n\tdetach();\n\td->fgColor = color;\n\tcompareColors( d->fgColor, d->bgColor );\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setBg( const QColor &color )\n{\n\tdetach();\n\td->bgColor = color;\n\tcompareColors( d->fgColor, d->bgColor );\n\tcompareColors( d->contactColor, d->bgColor );\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::compareColors( QColor &colorFg, QColor &colorBg )\n{\n\tint h1, s1, v1, h2, s2, v2, vDiff;\n\tcolorFg.hsv( &h1, &s1, &v1 );\n\tcolorBg.hsv( &h2, &s2, &v2 );\n\tvDiff = v1 - v2;\n\n\tif( h1 == s1 && h2 == s2 && ( abs( vDiff ) <= 150 ) )\n\t\tcolorFg = QColor( h2, s2, (v1 + 127) % 255, QColor::Hsv );\n}\n\nvoid KopeteMessage::setFont( const QFont &font )\n{\n\tdetach();\n\td->font = font;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::highlight()\n{\n\tdetach();\n\td->importance = Highlight;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::setBody( const QString &body, MessageFormat f )\n{\n\tdetach();\n\td->body = body;\n\td->format = f;\n\td->contentsModified = true;\n}\n\nvoid KopeteMessage::init( const QDateTime &timeStamp, const KopeteContact *from, const KopeteContactPtrList &to,\n\tconst QString &body, const QString &subject, MessageDirection direction, MessageFormat f, MessageType type )\n{\n\tstatic QMap<QString,QColor> colorMap;\n\tstatic int lastColor;\n\tconst QColor nameColors[] = {\n\t\tQt::red, Qt::green, Qt::blue, Qt::cyan, Qt::magenta,\n\t\tQt::darkRed, Qt::darkGreen, Qt::darkCyan, Qt::darkMagenta, Qt::darkYellow\n\t};\n\n\td->refCount = 1;\n\td->timeStamp = timeStamp;\n\td->from = from;\n\td->to = to;\n\td->subject = subject;\n\td->direction = direction;\n\td->fgColor = QColor();\n\td->bgColor = QColor();\n\td->font = QFont();\n\tsetBody( body, f );\n\td->bgOverride = false;\n\td->type = type;\n\t\/\/Importance to low in a multi chat\n\td->importance= (to.count() <= 1) ? Normal : Low ;\n\n\tif( from )\n\t{\n\t\tQString fromName = d->from->metaContact() ? d->from->metaContact()->displayName() : d->from->displayName();\n\n\t\tif( !colorMap.contains( fromName ) )\n\t\t{\n\t\t\tQColor newColor;\n\t\t\tif( direction == Outbound )\n\t\t\t\tnewColor = Qt::yellow;\n\t\t\telse\n\t\t\t\tnewColor = nameColors[(lastColor++) % (sizeof(nameColors) \/ sizeof(nameColors[0]))];\n\t\t\tcolorMap.insert( fromName, newColor );\n\t\t}\n\t\td->contactColor = colorMap[ fromName ];\n\n\t\t\/\/Highlight if the message contains the nickname (i think it should be place in the highlight plugin)\n\t\tif( KopetePrefs::prefs()->highlightEnabled() && from->account() && from->account()->myself() &&\n\t\t\td->body.contains( QRegExp(QString::fromLatin1(\"\\\\b(%1)\\\\b\").arg(from->account()->myself()->displayName()),false) ) )\n\t\t{\n\t\t\thighlight();\n\t\t}\n\t}\n\n\td->contentsModified = true;\n}\n\nQString KopeteMessage::plainBody() const\n{\n\tif( d->format & PlainText )\n\t\treturn d->body;\n\n\t\/\/FIXME: is there a better way to unescape HTML?\n\tQString r = d->body;\n\tr = r.replace( QRegExp( QString::fromLatin1( \"<br\/>\" ) ), QString::fromLatin1( \"\\n\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<br>\" ) ), QString::fromLatin1( \"\\n\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<[^>]*>\" ) ), QString::fromLatin1( \"\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \">\" ) ), QString::fromLatin1( \">\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"<\" ) ), QString::fromLatin1( \"<\" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \" \" ) ), QString::fromLatin1( \" \" ) ).\n\t\treplace( QRegExp( QString::fromLatin1( \"&\" ) ), QString::fromLatin1( \"&\" ) );\n\n\treturn r;\n}\n\nQString KopeteMessage::escapedBody() const\n{\n\tif( d->format == PlainText )\n\t{\n\t\tQString parsedString = d->body;\n\n\t\t\/\/Replace carriage returns inside the text\n\t\tparsedString.replace( QRegExp( QString::fromLatin1( \"\\n\" ) ), QString::fromLatin1( \"<br\/>\" ) );\n\n\t\t\/\/Replace a tab with 4 spaces\n\t\tparsedString.replace( QRegExp( QString::fromLatin1( \"\\t\" ) ), QString::fromLatin1( \" \" ) );\n\n\t\t\/\/Escape CDATA end tags\n\t\tparsedString.replace( QRegExp( QString::fromLatin1(\"]]>\") ), QString::fromLatin1(\"]] >\") );\n\n\t\treturn parsedString;\n\t}\n\n\treturn d->body;\n}\n\nQString KopeteMessage::parsedBody() const\n{\n\tif( d->format == ParsedHTML )\n\t\treturn d->body;\n\n\treturn KopeteEmoticons::parseEmoticons(parseLinks(escapedBody()));\n}\n\nQString KopeteMessage::parseLinks( const QString &message ) const\n{\n\tQString result = message;\n\n\t\/\/Replace Email Links\n\tresult.replace( QRegExp( QString::fromLatin1(\"\\\\b([\\\\w\\\\.]+@([\\\\w\\\\.]+\\\\.\\\\w+)+)\\\\b\") ), QString::fromLatin1(\"<a href=\\\"mailto:\\\\1\\\">\\\\1<\/a>\") );\n\n\t\/\/Replace http\/https\/ftp links\n\tresult.replace( QRegExp( QString::fromLatin1(\"\\\\b((http:\/\/\\\\w|ftp:\/\/\\\\w|https:\/\/\\\\w|www\\\\.)[\\\\w\\\\.\/]*)\\\\b\") ), QString::fromLatin1(\"<a href=\\\"\\\\1\\\">\\\\1<\/a>\" ) );\n\n\treturn result;\n}\n\nQDomDocument KopeteMessage::asXML()\n{\n\tQDomDocument doc = d->xmlDoc;\n\tif( !doc.hasChildNodes() || d->contentsModified )\n\t{\n\t\tQDomElement messageNode = doc.createElement( QString::fromLatin1(\"message\") );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"timestamp\"), KGlobal::locale()->formatTime(d->timeStamp.time(), true) );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"importance\"), d->importance );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"subject\"), d->subject );\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"direction\"), d->direction );\n\t\tdoc.appendChild( messageNode );\n\n\t\tQDomElement fromNode = doc.createElement( QString::fromLatin1(\"from\") );\n\t\tQDomElement cNode = doc.createElement( QString::fromLatin1(\"contact\") );\n\t\tcNode.setAttribute( QString::fromLatin1(\"contactDisplayName\"), d->from->displayName() );\n\t\tcNode.setAttribute( QString::fromLatin1(\"color\"), d->contactColor.name() );\n\t\tif( d->from->metaContact() )\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), d->from->metaContact()->displayName() );\n\t\telse\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), d->from->displayName() );\n\t\tfromNode.appendChild( cNode );\n\n\t\tmessageNode.setAttribute( QString::fromLatin1(\"from\"), d->from->displayName() );\n\n\t\tQDomElement toNode = doc.createElement( QString::fromLatin1(\"to\") );\n\t\tfor( KopeteContact *c = d->to.first(); c; c = d->to.next() )\n\t\t{\n\t\t\tQDomElement cNode = doc.createElement( QString::fromLatin1(\"contact\") );\n\t\t\tcNode.setAttribute( QString::fromLatin1(\"contactDisplayName\"), c->displayName() );\n\t\t\tif( c->metaContact() )\n\t\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), c->metaContact()->displayName() );\n\t\t\telse\n\t\t\t\tcNode.setAttribute( QString::fromLatin1(\"metaContactDisplayName\"), c->displayName() );\n\t\t\ttoNode.appendChild( cNode );\n\t\t}\n\n\t\tmessageNode.appendChild( fromNode );\n\t\tmessageNode.appendChild( toNode );\n\n\t\tQDomElement bodyNode = doc.createElement( QString::fromLatin1(\"body\") );\n\t\tif( d->bgColor.isValid() )\n\t\t\tbodyNode.setAttribute( QString::fromLatin1(\"bgcolor\"), d->bgColor.name() );\n\t\tif( d->fgColor.isValid() )\n\t\t\tbodyNode.setAttribute( QString::fromLatin1(\"color\"), d->fgColor.name() );\n\t\tbodyNode.setAttribute( QString::fromLatin1(\"font\"), d->font.family() );\n\n\t\tQDomCDATASection bodyText = doc.createCDATASection( KopeteEmoticons::parseEmoticons(parseLinks( escapedBody() )) );\n\t\tbodyNode.appendChild( bodyText );\n\n\t\tmessageNode.appendChild( bodyNode );\n\n\t\td->contentsModified = false;\n\t}\n\n\treturn doc;\n}\n\nQDateTime KopeteMessage::timestamp() const\n{\n\treturn d->timeStamp;\n}\n\nconst KopeteContact *KopeteMessage::from() const\n{\n\treturn d->from;\n}\n\nKopeteContactPtrList KopeteMessage::to() const\n{\n\treturn d->to;\n}\n\nKopeteMessage::MessageType KopeteMessage::type() const\n{\n\treturn d->type;\n}\n\nQColor KopeteMessage::fg() const\n{\n\treturn d->fgColor;\n}\n\nQColor KopeteMessage::bg() const\n{\n\treturn d->bgColor;\n}\n\nQFont KopeteMessage::font() const\n{\n\treturn d->font;\n}\n\nQString KopeteMessage::body() const\n{\n\treturn d->body;\n}\n\nQString KopeteMessage::subject() const\n{\n\treturn d->subject;\n}\n\nKopeteMessage::MessageFormat KopeteMessage::format() const\n{\n\treturn d->format;\n}\n\nKopeteMessage::MessageDirection KopeteMessage::direction() const\n{\n\treturn d->direction;\n}\n\nKopeteMessage::MessageImportance KopeteMessage::importance() const\n{\n\treturn d->importance;\n}\n\nvoid KopeteMessage::setImportance(KopeteMessage::MessageImportance i)\n{\n\td->importance=i;\n}\n\nvoid KopeteMessage::detach()\n{\n\tif( d->refCount == 1 )\n\t\treturn;\n\n\t\/\/ Warning: this only works as long as the private object doesn't contain pointers to allocated objects.\n\t\/\/ The from contact for example is fine, but it's a shallow copy this way.\n\tKopeteMessagePrivate *newD = new KopeteMessagePrivate(*d);\n\tnewD->refCount = 1;\n\td->refCount--;\n\n\td = newD;\n}\n\n\/\/ vim: set noet ts=4 sts=4 sw=4:\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nKSync - Client-Server synchronization system using rsync.\nCopyright (C) 2015 Matthew Scott Krafczyk\n\nThis program is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 2 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nWITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <nanomsg\/nn.h>\n#include <nanomsg\/pair.h>\n\n#include \"ksync\/logging.h\"\n#include \"ksync\/socket_ops.h\"\n\nnamespace KSync {\n\tnamespace SocketOps {\n\t\tint Create_Pair_Socket(int& socket) {\n\t\t\tsocket = nn_socket(AF_SP, NN_PAIR);\n\t\t\tif(socket < 0) {\n\t\t\t\tError(\"An error was encountered while creating the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Bind_Pair_Socket(int& endpoint, const int socket, const std::string socket_url) {\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tendpoint = nn_bind(socket, socket_url.c_str());\n\t\t\tprintf(\"Binding socket. The endpoint is: %i\\n\", endpoint);\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tif(endpoint < 0) {\n\t\t\t\tError(\"An error was encountered while trying to bind to the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Connect_Pair_Socket(int& endpoint, const int socket, const std::string socket_url) {\n\t\t\tprintf(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tprintf(\"Connecing socket. The endpoint is: %i\\n\", endpoint);\n\t\t\tprintf(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tendpoint = nn_connect(socket, socket_url.c_str());\n\t\t\tif(endpoint < 0) {\n\t\t\t\tError(\"An error was encountered while trying to bind to the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Set_Socket_Timeout(const int socket, const int to) {\n\t\t\tif(nn_setsockopt(socket, NN_SOL_SOCKET, NN_RCVTIMEO, &to, sizeof(to)) < 0) {\n\t\t\t\tError(\"An error was concountered while trying to set the timeout for the connection socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Create_And_Bind_Connection_Socket(int& socket, int& endpoint, const std::string connect_socket_url) {\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tif(Create_Pair_Socket(socket) < 0) {\n\t\t\t\tError(\"An error was encountered trying to create the connection socket!\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tif(Bind_Pair_Socket(endpoint, socket, connect_socket_url) < 0) {\n\t\t\t\tError(\"An error was encountered trying to bind to the connection socket!\\n\");\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\tif(Set_Socket_Timeout(socket, 100) < 0) {\n\t\t\t\tError(\"An error was encountered trying to set the connection socket's timeout!\\n\");\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\tDebug(\"Error: %i (%s)\\n\", nn_errno(), nn_strerror(nn_errno()));\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Create_And_Connect_Connection_Socket(int& socket, int& endpoint, const std::string connect_socket_url) {\n\t\t\tif(Create_Pair_Socket(socket) < 0) {\n\t\t\t\tError(\"An error was encountered trying to create the connection socket!\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Connect_Pair_Socket(endpoint, socket, connect_socket_url) < 0) {\n\t\t\t\tError(\"An error was encountered trying to bind to the connection socket!\\n\");\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\tif(Set_Socket_Timeout(socket, 100) < 0) {\n\t\t\t\tError(\"An error was encountered trying to set the connection socket's timeout!\\n\");\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Shutdown_Socket(const int socket, const int endpoint) {\n\t\t\tif(nn_shutdown(socket, endpoint) < 0) {\n\t\t\t\tError(\"An error was encountered while trying to shutdown an endpoint of a socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Receive_Message(std::string& message, const int socket) {\n\t\t\tchar* buf = NULL;\n\t\t\tif(nn_recv(socket, &buf, NN_MSG, 0) < 0) {\n\t\t\t\tif(nn_errno() == EAGAIN) {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tError(\"An error was encountered while trying to receive a message from a socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tmessage = buf;\n\t\t\tif(nn_freemsg(buf) < 0) {\n\t\t\t\tError(\"An error was encountered while trying to free a message buffer. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Send_Message(const std::string& message, const int socket) {\n\t\t\tint send_result = nn_send(socket, (void*) message.c_str(), message.size(), 0);\n\t\t\tif(send_result < 0) {\n\t\t\t\tError(\"An error was encountered while sending a message. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tif(send_result != (int) message.size()) {\n\n\t\t\t\tError(\"An error was encountered while sending a message. The size of the message sent does not match the size of the message we wanted to send.\\n\");\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n}\n<commit_msg>Revamp socket_ops module in libksync<commit_after>\/*\nKSync - Client-Server synchronization system using rsync.\nCopyright (C) 2015 Matthew Scott Krafczyk\n\nThis program is free software: you can redistribute it and\/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 2 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nWITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <string>\n\n#include <nanomsg\/nn.h>\n#include <nanomsg\/pair.h>\n\n#include \"ksync\/logging.h\"\n#include \"ksync\/utilities.h\"\n#include \"ksync\/socket_ops.h\"\n\nnamespace KSync {\n\tnamespace SocketOps {\n\t\tint Create_Pair_Socket(int& socket) {\n\t\t\tsocket = nn_socket(AF_SP, NN_PAIR);\n\t\t\tif(socket < 0) {\n\t\t\t\tError(\"An error was encountered while creating the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Bind_Pair_Socket(int& endpoint, const int socket, const std::string socket_url) {\n\t\t\tUtilities::reset_error();\n\t\t\tendpoint = nn_bind(socket, socket_url.c_str());\n\t\t\tif(endpoint < 0) {\n\t\t\t\tError(\"An error was encountered while trying to bind to the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Connect_Pair_Socket(int& endpoint, const int socket, const std::string socket_url) {\n\t\t\tUtilities::reset_error();\n\t\t\tendpoint = nn_connect(socket, socket_url.c_str());\n\t\t\tif(endpoint < 0) {\n\t\t\t\tError(\"An error was encountered while trying to bind to the socket. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Set_Socket_Timeout(const int socket, const int to) {\n\t\t\tUtilities::reset_error();\n\t\t\tif(nn_setsockopt(socket, NN_SOL_SOCKET, NN_RCVTIMEO, &to, sizeof(to)) < 0) {\n\t\t\t\tError(\"An error was concountered while trying to set the timeout for the connection socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Create_And_Bind_Connection_Socket(int& socket, int& endpoint, const std::string connect_socket_url) {\n\t\t\tif(Create_Pair_Socket(socket) < 0) {\n\t\t\t\tError(\"An error was encountered trying to create the connection socket!\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Bind_Pair_Socket(endpoint, socket, connect_socket_url) < 0) {\n\t\t\t\tError(\"An error was encountered trying to bind to the connection socket!\\n\");\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\tif(Set_Socket_Timeout(socket, 100) < 0) {\n\t\t\t\tError(\"An error was encountered trying to set the connection socket's timeout!\\n\");\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Create_And_Connect_Connection_Socket(int& socket, int& endpoint, const std::string connect_socket_url) {\n\t\t\tif(Create_Pair_Socket(socket) < 0) {\n\t\t\t\tError(\"An error was encountered trying to create the connection socket!\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Connect_Pair_Socket(endpoint, socket, connect_socket_url) < 0) {\n\t\t\t\tError(\"An error was encountered trying to bind to the connection socket!\\n\");\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\tif(Set_Socket_Timeout(socket, 100) < 0) {\n\t\t\t\tError(\"An error was encountered trying to set the connection socket's timeout!\\n\");\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Shutdown_Socket(const int socket, const int endpoint) {\n\t\t\tUtilities::reset_error();\n\t\t\tif(nn_shutdown(socket, endpoint) < 0) {\n\t\t\t\tError(\"An error was encountered while trying to shutdown an endpoint of a socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Receive_Message(std::string& message, const int socket) {\n\t\t\tchar* buf = NULL;\n\t\t\tUtilities::reset_error();\n\t\t\tif(nn_recv(socket, &buf, NN_MSG, 0) < 0) {\n\t\t\t\tif(nn_errno() == EAGAIN) {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tError(\"An error was encountered while trying to receive a message from a socket! (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\t\t\tmessage = buf;\n\t\t\tif(nn_freemsg(buf) < 0) {\n\t\t\t\tError(\"An error was encountered while trying to free a message buffer. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\tif(Utilities::check_error()) {\n\t\t\t\treturn -4;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\n\t\tint Send_Message(const std::string& message, const int socket) {\n\t\t\tUtilities::reset_error();\n\t\t\tint send_result = nn_send(socket, (void*) message.c_str(), message.size(), 0);\n\t\t\tif(send_result < 0) {\n\t\t\t\tError(\"An error was encountered while sending a message. (%s)\\n\", nn_strerror(nn_errno()));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif(Utilities::check_error() != 0) {\n\t\t\t\treturn -2;\n\t\t\t}\n\n\t\t\tif(send_result != (int) message.size()) {\n\n\t\t\t\tError(\"An error was encountered while sending a message. The size of the message sent does not match the size of the message we wanted to send.\\n\");\n\t\t\t\treturn -3;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011 Intel Corporation.\n *\n * This program is licensed under the terms and conditions of the\n * Apache License, version 2.0. The full text of the Apache License is at \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\/\n\n#include <QtDeclarative\/qdeclarative.h>\n#include <QDir>\n#include <QFileInfoList>\n#include <QFileSystemWatcher>\n#include <QRegExp>\n#include <mdesktopentry.h>\n\n#include \"applicationsmodel.h\"\n#include \"..\/kernel\/desktop.h\"\n#include \"favoriteapplicationsmodel.h\"\n#include \"recentapplicationsmodel.h\"\n#include \"appupappsmodel.h\"\n\nApplicationsModel::ApplicationsModel(QObject *parent) :\n QAbstractListModel(parent),\n m_type(\"Application\"),\n m_recents(new RecentApplicationsModel(this)),\n m_favorites(new FavoriteApplicationsModel(this)),\n m_featuredApps(0),\n m_updatedApps(0)\n\n{\n m_watcher = new QFileSystemWatcher(this);\n connect(m_watcher, SIGNAL(directoryChanged(QString)), this, SLOT(appsDirChanged(QString)));\n\n \/\/ Default dirs\n m_watcher->addPath(\"\/usr\/share\/applications\");\n m_watcher->addPath(\"\/usr\/share\/meego-ux-appgrid\/applications\");\n\n QHash<int, QByteArray> roles;\n roles[id]=\"id\";\n roles[name]=\"name\";\n roles[exec]=\"exec\";\n roles[custom]=\"custom\";\n\n setRoleNames(roles);\n\n}\n\nvoid ApplicationsModel::appsDirChanged(QString changedDir)\n{\n Q_UNUSED(changedDir);\n resetApps();\n emit appsChanged();\n}\n\nvoid ApplicationsModel::setDirectories(QStringList directories)\n{\n m_watcher->removePaths(m_watcher->directories());\n\n foreach(QString directory, directories)\n {\n QString path;\n if (directory.startsWith(\"~\"))\n path = QDir::homePath() + directory.remove(0, 1);\n else if (directory == \".\")\n path = QDir::currentPath();\n else\n path = directory;\n\n \/\/ If directory doesn't exist, then attempt to create it\n if (!QDir(path).exists())\n {\n QDir().mkpath(path);\n }\n\n m_watcher->addPath(path);\n }\n\n resetApps();\n}\n\nvoid ApplicationsModel::resetApps()\n{\n while (!m_apps.isEmpty())\n delete m_apps.takeFirst();\n\n QStringList addedDirectories;\n\n foreach (QString target, m_watcher->directories())\n {\n QDir dir(target);\n dir.setFilter(QDir::Files | QDir::NoSymLinks);\n\n QStringList filters;\n filters << \"*.desktop\";\n foreach (QFileInfo fileInfo, dir.entryInfoList(filters))\n {\n if(addedDirectories.contains(fileInfo.fileName()))\n continue;\n\n addedDirectories << fileInfo.fileName();\n\n Desktop *desktopEntry = new Desktop(fileInfo.absoluteFilePath());\n if (!desktopEntry->isValid() || (desktopEntry->type() != m_type))\n {\n delete desktopEntry;\n continue;\n }\n\n m_apps << desktopEntry;\n }\n }\n\n\n emit appsReset();\n}\n\nQVariant ApplicationsModel::data(const QModelIndex& index, int role) const\n{\n if(role == name)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->title();\n }\n }\n else if(role == exec)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->exec();\n }\n }\n else if(role == custom)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->value(m_customValue);\n }\n }\n return QVariant();\n}\n\nQDeclarativeListProperty<Desktop> ApplicationsModel::apps()\n{\n return QDeclarativeListProperty<Desktop>(this, m_apps);\n}\n\nRecentApplicationsModel *ApplicationsModel::recents()\n{\n return m_recents;\n}\n\nFavoriteApplicationsModel *ApplicationsModel::favorites()\n{\n return m_favorites;\n}\n\nAppUpAppsModel *ApplicationsModel::appupFeatured()\n{\n if (!m_featuredApps)\n m_featuredApps = new AppUpAppsModel(AppUpAppsModel::Featured, this);\n return m_featuredApps;\n}\n\nAppUpAppsModel *ApplicationsModel::appupUpdated()\n{\n if (!m_updatedApps)\n m_updatedApps = new AppUpAppsModel(AppUpAppsModel::Updated, this);\n return m_updatedApps;\n}\n\nQString ApplicationsModel::value(QString id, QString key)\n{\n foreach(Desktop* item, m_apps)\n {\n if(item->id() == id)\n return item->value(key);\n }\n return \"\";\n}\n\nvoid ApplicationsModel::launchDesktop(QObject *object)\n{\n\n Desktop *target = qobject_cast<Desktop *>(object);\n if (!target)\n return;\n\n m_favorites->append(target->filename());\n m_recents->append(target->filename());\n\n QString cmd = target->exec();\n\n \/\/ http:\/\/standards.freedesktop.org\/desktop-entry-spec\/latest\/ar01s06.html\n cmd.replace(QRegExp(\"%k\"), target->filename());\n cmd.replace(QRegExp(\"%i\"), QString(\"--icon \") + target->icon());\n cmd.replace(QRegExp(\"%c\"), target->title());\n cmd.replace(QRegExp(\"%[fFuU]\"), target->filename()); \/\/ stuff we don't handle\n\n QProcess::startDetached(cmd);\n\n emit startingApp(target->title(), target->icon());\n}\n\nvoid ApplicationsModel::launchDesktopByName(QString name)\n{\n\n if (m_apps.length() == 0)\n return;\n\n for (int i = 0; i < m_apps.length(); i++)\n {\n Desktop *d = m_apps[i];\n if (d->filename().contains(name))\n {\n launchDesktop(d);\n return;\n }\n }\n}\n\nvoid ApplicationsModel::launch(QString cmd)\n{\n QProcess::startDetached(cmd);\n}\n\nApplicationsModel::~ApplicationsModel()\n{\n while (!m_apps.isEmpty())\n delete m_apps.takeFirst();\n}\n\nQML_DECLARE_TYPE(ApplicationsModel);\n<commit_msg>- Fix for BMC#20409 - Applications model does not update with a change in locale. Signed-off-by: Benjamin T. Drucker <benjamin.t.drucker@intel.com><commit_after>\/*\n * Copyright 2011 Intel Corporation.\n *\n * This program is licensed under the terms and conditions of the\n * Apache License, version 2.0. The full text of the Apache License is at \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\/\n\n#include <QtDeclarative\/qdeclarative.h>\n#include <QDir>\n#include <QFileInfoList>\n#include <QFileSystemWatcher>\n#include <QRegExp>\n#include <mdesktopentry.h>\n\n#include \"applicationsmodel.h\"\n#include \"..\/kernel\/desktop.h\"\n#include \"favoriteapplicationsmodel.h\"\n#include \"recentapplicationsmodel.h\"\n#include \"appupappsmodel.h\"\n#include \"meegolocale.h\"\n\nApplicationsModel::ApplicationsModel(QObject *parent) :\n QAbstractListModel(parent),\n m_type(\"Application\"),\n m_recents(new RecentApplicationsModel(this)),\n m_favorites(new FavoriteApplicationsModel(this)),\n m_featuredApps(0),\n m_updatedApps(0)\n\n{\n m_watcher = new QFileSystemWatcher(this);\n connect(m_watcher, SIGNAL(directoryChanged(QString)), this, SLOT(appsDirChanged(QString)));\n\n \/\/ Default dirs\n m_watcher->addPath(\"\/usr\/share\/applications\");\n m_watcher->addPath(\"\/usr\/share\/meego-ux-appgrid\/applications\");\n\n QHash<int, QByteArray> roles;\n roles[id]=\"id\";\n roles[name]=\"name\";\n roles[exec]=\"exec\";\n roles[custom]=\"custom\";\n\n setRoleNames(roles);\n\n meego::Locale *pLocale = new meego::Locale(this);\n connect(pLocale, SIGNAL(localeChanged()), this, SLOT(resetApps()));\n}\n\nvoid ApplicationsModel::appsDirChanged(QString changedDir)\n{\n Q_UNUSED(changedDir);\n resetApps();\n emit appsChanged();\n}\n\nvoid ApplicationsModel::setDirectories(QStringList directories)\n{\n m_watcher->removePaths(m_watcher->directories());\n\n foreach(QString directory, directories)\n {\n QString path;\n if (directory.startsWith(\"~\"))\n path = QDir::homePath() + directory.remove(0, 1);\n else if (directory == \".\")\n path = QDir::currentPath();\n else\n path = directory;\n\n \/\/ If directory doesn't exist, then attempt to create it\n if (!QDir(path).exists())\n {\n QDir().mkpath(path);\n }\n\n m_watcher->addPath(path);\n }\n\n resetApps();\n}\n\nvoid ApplicationsModel::resetApps()\n{\n while (!m_apps.isEmpty())\n delete m_apps.takeFirst();\n\n QStringList addedDirectories;\n\n foreach (QString target, m_watcher->directories())\n {\n QDir dir(target);\n dir.setFilter(QDir::Files | QDir::NoSymLinks);\n\n QStringList filters;\n filters << \"*.desktop\";\n foreach (QFileInfo fileInfo, dir.entryInfoList(filters))\n {\n if(addedDirectories.contains(fileInfo.fileName()))\n continue;\n\n addedDirectories << fileInfo.fileName();\n\n Desktop *desktopEntry = new Desktop(fileInfo.absoluteFilePath());\n if (!desktopEntry->isValid() || (desktopEntry->type() != m_type))\n {\n delete desktopEntry;\n continue;\n }\n\n m_apps << desktopEntry;\n }\n }\n\n\n emit appsReset();\n emit appsChanged();\n}\n\nQVariant ApplicationsModel::data(const QModelIndex& index, int role) const\n{\n if(role == name)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->title();\n }\n }\n else if(role == exec)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->exec();\n }\n }\n else if(role == custom)\n {\n if(index.row() < m_apps.count())\n {\n return m_apps[index.row()]->value(m_customValue);\n }\n }\n return QVariant();\n}\n\nQDeclarativeListProperty<Desktop> ApplicationsModel::apps()\n{\n return QDeclarativeListProperty<Desktop>(this, m_apps);\n}\n\nRecentApplicationsModel *ApplicationsModel::recents()\n{\n return m_recents;\n}\n\nFavoriteApplicationsModel *ApplicationsModel::favorites()\n{\n return m_favorites;\n}\n\nAppUpAppsModel *ApplicationsModel::appupFeatured()\n{\n if (!m_featuredApps)\n m_featuredApps = new AppUpAppsModel(AppUpAppsModel::Featured, this);\n return m_featuredApps;\n}\n\nAppUpAppsModel *ApplicationsModel::appupUpdated()\n{\n if (!m_updatedApps)\n m_updatedApps = new AppUpAppsModel(AppUpAppsModel::Updated, this);\n return m_updatedApps;\n}\n\nQString ApplicationsModel::value(QString id, QString key)\n{\n foreach(Desktop* item, m_apps)\n {\n if(item->id() == id)\n return item->value(key);\n }\n return \"\";\n}\n\nvoid ApplicationsModel::launchDesktop(QObject *object)\n{\n\n Desktop *target = qobject_cast<Desktop *>(object);\n if (!target)\n return;\n\n m_favorites->append(target->filename());\n m_recents->append(target->filename());\n\n QString cmd = target->exec();\n\n \/\/ http:\/\/standards.freedesktop.org\/desktop-entry-spec\/latest\/ar01s06.html\n cmd.replace(QRegExp(\"%k\"), target->filename());\n cmd.replace(QRegExp(\"%i\"), QString(\"--icon \") + target->icon());\n cmd.replace(QRegExp(\"%c\"), target->title());\n cmd.replace(QRegExp(\"%[fFuU]\"), target->filename()); \/\/ stuff we don't handle\n\n QProcess::startDetached(cmd);\n\n emit startingApp(target->title(), target->icon());\n}\n\nvoid ApplicationsModel::launchDesktopByName(QString name)\n{\n\n if (m_apps.length() == 0)\n return;\n\n for (int i = 0; i < m_apps.length(); i++)\n {\n Desktop *d = m_apps[i];\n if (d->filename().contains(name))\n {\n launchDesktop(d);\n return;\n }\n }\n}\n\nvoid ApplicationsModel::launch(QString cmd)\n{\n QProcess::startDetached(cmd);\n}\n\nApplicationsModel::~ApplicationsModel()\n{\n while (!m_apps.isEmpty())\n delete m_apps.takeFirst();\n}\n\nQML_DECLARE_TYPE(ApplicationsModel);\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied. See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n#include \"kudu\/cfile\/type_encodings.h\"\n\n#include <cstddef>\n#include <memory>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n#include \"kudu\/cfile\/binary_dict_block.h\"\n#include \"kudu\/cfile\/binary_plain_block.h\"\n#include \"kudu\/cfile\/binary_prefix_block.h\"\n#include \"kudu\/cfile\/block_encodings.h\"\n#include \"kudu\/cfile\/bshuf_block.h\"\n#include \"kudu\/cfile\/plain_bitmap_block.h\"\n#include \"kudu\/cfile\/plain_block.h\"\n#include \"kudu\/cfile\/rle_block.h\"\n#include \"kudu\/common\/types.h\"\n#include \"kudu\/gutil\/port.h\"\n#include \"kudu\/gutil\/singleton.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/util\/slice.h\"\n\nusing std::make_pair;\nusing std::pair;\nusing std::unique_ptr;\nusing std::unordered_map;\n\nnamespace kudu {\nnamespace cfile {\n\ntemplate<DataType Type, EncodingType Encoding>\nstruct DataTypeEncodingTraits {};\n\n\/\/ Instantiate this template to get static access to the type traits.\ntemplate<DataType Type, EncodingType Encoding> struct TypeEncodingTraits\n : public DataTypeEncodingTraits<Type, Encoding> {\n\n static const EncodingType kEncodingType = Encoding;\n};\n\n\/\/ Generic, fallback, partial specialization that should work for all\n\/\/ fixed size types.\ntemplate<DataType Type>\nstruct DataTypeEncodingTraits<Type, PLAIN_ENCODING> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new PlainBlockBuilder<Type>(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new PlainBlockDecoder<Type>(slice));\n return Status::OK();\n }\n};\n\n\/\/ Generic, fallback, partial specialization that should work for all\n\/\/ fixed size types.\ntemplate<DataType Type>\nstruct DataTypeEncodingTraits<Type, BIT_SHUFFLE> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new BShufBlockBuilder<Type>(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new BShufBlockDecoder<Type>(slice));\n return Status::OK();\n }\n};\n\n\/\/ Template specialization for plain encoded string as they require a\n\/\/ specific encoder\/decoder.\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, PLAIN_ENCODING> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new BinaryPlainBlockBuilder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new BinaryPlainBlockDecoder(slice));\n return Status::OK();\n }\n};\n\n\/\/ Template specialization for packed bitmaps\ntemplate<>\nstruct DataTypeEncodingTraits<BOOL, PLAIN_ENCODING> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new PlainBitMapBlockBuilder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new PlainBitMapBlockDecoder(slice));\n return Status::OK();\n }\n};\n\n\n\/\/ Template specialization for RLE encoded bitmaps\ntemplate<>\nstruct DataTypeEncodingTraits<BOOL, RLE> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new RleBitMapBlockBuilder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new RleBitMapBlockDecoder(slice));\n return Status::OK();\n }\n};\n\n\/\/ Template specialization for plain encoded string as they require a\n\/\/ specific encoder \\\/decoder.\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, PREFIX_ENCODING> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new BinaryPrefixBlockBuilder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new BinaryPrefixBlockDecoder(slice));\n return Status::OK();\n }\n};\n\n\/\/ Template for dictionary encoding\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, DICT_ENCODING> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new BinaryDictBlockBuilder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* iter) {\n bd->reset(new BinaryDictBlockDecoder(slice, iter));\n return Status::OK();\n }\n};\n\ntemplate<DataType IntType>\nstruct DataTypeEncodingTraits<IntType, RLE> {\n\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new RleIntBlockBuilder<IntType>(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*iter*\/) {\n bd->reset(new RleIntBlockDecoder<IntType>(slice));\n return Status::OK();\n }\n};\n\n\ntemplate<typename TypeEncodingTraitsClass>\nTypeEncodingInfo::TypeEncodingInfo(TypeEncodingTraitsClass t)\n : encoding_type_(TypeEncodingTraitsClass::kEncodingType),\n create_builder_func_(TypeEncodingTraitsClass::CreateBlockBuilder),\n create_decoder_func_(TypeEncodingTraitsClass::CreateBlockDecoder) {\n}\n\nStatus TypeEncodingInfo::CreateBlockDecoder(unique_ptr<BlockDecoder>* bd,\n const Slice& slice,\n CFileIterator* parent_cfile_iter) const {\n return create_decoder_func_(bd, slice, parent_cfile_iter);\n}\n\nStatus TypeEncodingInfo::CreateBlockBuilder(\n unique_ptr<BlockBuilder>* bb, const WriterOptions* options) const {\n return create_builder_func_(bb, options);\n}\n\nstruct EncodingMapHash {\n size_t operator()(pair<DataType, EncodingType> pair) const {\n return (pair.first << 5) + pair.second;\n }\n};\n\n\/\/ A resolver for encodings, keeps all the allowed type<->encoding\n\/\/ combinations. The first combination to be added to the map\n\/\/ becomes the default encoding for the type.\nclass TypeEncodingResolver {\n public:\n Status GetTypeEncodingInfo(DataType t, EncodingType e,\n const TypeEncodingInfo** out) {\n if (e == AUTO_ENCODING) {\n e = GetDefaultEncoding(t);\n }\n const TypeEncodingInfo *type_info = mapping_[make_pair(t, e)].get();\n if (PREDICT_FALSE(type_info == nullptr)) {\n return Status::NotSupported(\n strings::Substitute(\"encoding $1 not supported for type $0\",\n DataType_Name(t),\n EncodingType_Name(e)));\n }\n *out = type_info;\n return Status::OK();\n }\n\n const EncodingType GetDefaultEncoding(DataType t) {\n return default_mapping_[t];\n }\n\n \/\/ Add the encoding mappings\n \/\/ the first encoder\/decoder to be\n \/\/ added to the mapping becomes the default\n private:\n TypeEncodingResolver() {\n AddMapping<UINT8, BIT_SHUFFLE>();\n AddMapping<UINT8, PLAIN_ENCODING>();\n AddMapping<UINT8, RLE>();\n AddMapping<INT8, BIT_SHUFFLE>();\n AddMapping<INT8, PLAIN_ENCODING>();\n AddMapping<INT8, RLE>();\n AddMapping<UINT16, BIT_SHUFFLE>();\n AddMapping<UINT16, PLAIN_ENCODING>();\n AddMapping<UINT16, RLE>();\n AddMapping<INT16, BIT_SHUFFLE>();\n AddMapping<INT16, PLAIN_ENCODING>();\n AddMapping<INT16, RLE>();\n AddMapping<UINT32, BIT_SHUFFLE>();\n AddMapping<UINT32, RLE>();\n AddMapping<UINT32, PLAIN_ENCODING>();\n AddMapping<INT32, BIT_SHUFFLE>();\n AddMapping<INT32, PLAIN_ENCODING>();\n AddMapping<INT32, RLE>();\n AddMapping<UINT64, BIT_SHUFFLE>();\n AddMapping<UINT64, PLAIN_ENCODING>();\n AddMapping<UINT64, RLE>();\n AddMapping<INT64, BIT_SHUFFLE>();\n AddMapping<INT64, PLAIN_ENCODING>();\n AddMapping<INT64, RLE>();\n AddMapping<FLOAT, BIT_SHUFFLE>();\n AddMapping<FLOAT, PLAIN_ENCODING>();\n AddMapping<DOUBLE, BIT_SHUFFLE>();\n AddMapping<DOUBLE, PLAIN_ENCODING>();\n AddMapping<BINARY, DICT_ENCODING>();\n AddMapping<BINARY, PLAIN_ENCODING>();\n AddMapping<BINARY, PREFIX_ENCODING>();\n AddMapping<BOOL, RLE>();\n AddMapping<BOOL, PLAIN_ENCODING>();\n AddMapping<INT128, BIT_SHUFFLE>();\n AddMapping<INT128, PLAIN_ENCODING>();\n \/\/ TODO: Add 128 bit support to RLE\n \/\/ AddMapping<INT128, RLE>();\n }\n\n template<DataType type, EncodingType encoding> void AddMapping() {\n TypeEncodingTraits<type, encoding> traits;\n \/\/ The first call to AddMapping() for a given data-type is always the default one.\n \/\/ emplace() will no-op if the data-type is already present, so we can blindly\n \/\/ call emplace() here(i.e. no need to call find() to check before inserting)\n default_mapping_.emplace(type, encoding);\n mapping_.emplace(make_pair(type, encoding),\n unique_ptr<TypeEncodingInfo>(new TypeEncodingInfo(traits)));\n }\n\n unordered_map<pair<DataType, EncodingType>,\n unique_ptr<const TypeEncodingInfo>,\n EncodingMapHash > mapping_;\n\n unordered_map<DataType, EncodingType, std::hash<size_t> > default_mapping_;\n\n friend class Singleton<TypeEncodingResolver>;\n DISALLOW_COPY_AND_ASSIGN(TypeEncodingResolver);\n};\n\nStatus TypeEncodingInfo::Get(const TypeInfo* typeinfo,\n EncodingType encoding,\n const TypeEncodingInfo** out) {\n return Singleton<TypeEncodingResolver>::get()->GetTypeEncodingInfo(typeinfo->physical_type(),\n encoding,\n out);\n}\n\nconst EncodingType TypeEncodingInfo::GetDefaultEncoding(const TypeInfo* typeinfo) {\n return Singleton<TypeEncodingResolver>::get()->GetDefaultEncoding(typeinfo->physical_type());\n}\n\n} \/\/ namespace cfile\n} \/\/ namespace kudu\n\n<commit_msg>[cfile] Add EncodingTraits to remove boiler plate code in type_encodings.cc<commit_after>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied. See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n#include \"kudu\/cfile\/type_encodings.h\"\n\n#include <cstddef>\n#include <memory>\n#include <unordered_map>\n#include <utility>\n\n#include \"kudu\/cfile\/binary_dict_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/binary_plain_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/binary_prefix_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/block_encodings.h\"\n#include \"kudu\/cfile\/bshuf_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/plain_bitmap_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/plain_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/cfile\/rle_block.h\" \/\/ IWYU pragma: keep\n#include \"kudu\/common\/types.h\"\n#include \"kudu\/gutil\/port.h\"\n#include \"kudu\/gutil\/singleton.h\"\n#include \"kudu\/gutil\/strings\/substitute.h\"\n#include \"kudu\/util\/slice.h\"\n\nusing std::make_pair;\nusing std::pair;\nusing std::unique_ptr;\nusing std::unordered_map;\n\nnamespace kudu {\nnamespace cfile {\n\n\/\/ Base template class to help instantiate classes with specific BlockBuilder and BlockDecoder\n\/\/ classes.\ntemplate<class Builder, class Decoder>\nstruct EncodingTraits {\n static Status CreateBlockBuilder(unique_ptr<BlockBuilder>* bb, const WriterOptions* options) {\n bb->reset(new Builder(options));\n return Status::OK();\n }\n\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* \/*parent_cfile_iter*\/) {\n bd->reset(new Decoder(slice));\n return Status::OK();\n }\n};\n\ntemplate<DataType Type, EncodingType Encoding>\nstruct DataTypeEncodingTraits {};\n\n\/\/ Instantiate this template to get static access to the type traits.\ntemplate<DataType Type, EncodingType Encoding> struct TypeEncodingTraits\n : public DataTypeEncodingTraits<Type, Encoding> {\n\n static const EncodingType kEncodingType = Encoding;\n};\n\n\/\/ Generic, fallback, partial specialization that should work for all\n\/\/ fixed size types.\ntemplate<DataType Type>\nstruct DataTypeEncodingTraits<Type, PLAIN_ENCODING>\n : public EncodingTraits<PlainBlockBuilder<Type>, PlainBlockDecoder<Type>> {};\n\n\/\/ Generic, fallback, partial specialization that should work for all\n\/\/ fixed size types.\ntemplate<DataType Type>\nstruct DataTypeEncodingTraits<Type, BIT_SHUFFLE>\n : public EncodingTraits<BShufBlockBuilder<Type>, BShufBlockDecoder<Type>> {};\n\n\/\/ Template specialization for plain encoded string as they require a\n\/\/ specific encoder\/decoder.\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, PLAIN_ENCODING>\n : public EncodingTraits<BinaryPlainBlockBuilder, BinaryPlainBlockDecoder> {};\n\n\/\/ Template specialization for packed bitmaps\ntemplate<>\nstruct DataTypeEncodingTraits<BOOL, PLAIN_ENCODING>\n : public EncodingTraits<PlainBitMapBlockBuilder, PlainBitMapBlockDecoder> {};\n\n\/\/ Template specialization for RLE encoded bitmaps\ntemplate<>\nstruct DataTypeEncodingTraits<BOOL, RLE>\n : public EncodingTraits<RleBitMapBlockBuilder, RleBitMapBlockDecoder> {};\n\n\/\/ Template specialization for plain encoded string as they require a\n\/\/ specific encoder \\\/decoder.\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, PREFIX_ENCODING>\n : public EncodingTraits<BinaryPrefixBlockBuilder, BinaryPrefixBlockDecoder> {};\n\n\/\/ Template for dictionary encoding\ntemplate<>\nstruct DataTypeEncodingTraits<BINARY, DICT_ENCODING>\n : public EncodingTraits<BinaryDictBlockBuilder, BinaryDictBlockDecoder> {\n static Status CreateBlockDecoder(unique_ptr<BlockDecoder>* bd, const Slice& slice,\n CFileIterator* parent_cfile_iter) {\n bd->reset(new BinaryDictBlockDecoder(slice, parent_cfile_iter));\n return Status::OK();\n }\n};\n\ntemplate<DataType IntType>\nstruct DataTypeEncodingTraits<IntType, RLE>\n : public EncodingTraits<RleIntBlockBuilder<IntType>, RleIntBlockDecoder<IntType>> {};\n\ntemplate<typename TypeEncodingTraitsClass>\nTypeEncodingInfo::TypeEncodingInfo(TypeEncodingTraitsClass \/*t*\/)\n : encoding_type_(TypeEncodingTraitsClass::kEncodingType),\n create_builder_func_(TypeEncodingTraitsClass::CreateBlockBuilder),\n create_decoder_func_(TypeEncodingTraitsClass::CreateBlockDecoder) {\n}\n\nStatus TypeEncodingInfo::CreateBlockDecoder(unique_ptr<BlockDecoder>* bd,\n const Slice& slice,\n CFileIterator* parent_cfile_iter) const {\n return create_decoder_func_(bd, slice, parent_cfile_iter);\n}\n\nStatus TypeEncodingInfo::CreateBlockBuilder(\n unique_ptr<BlockBuilder>* bb, const WriterOptions* options) const {\n return create_builder_func_(bb, options);\n}\n\nstruct EncodingMapHash {\n size_t operator()(pair<DataType, EncodingType> pair) const {\n return (pair.first << 5) + pair.second;\n }\n};\n\n\/\/ A resolver for encodings, keeps all the allowed type<->encoding\n\/\/ combinations. The first combination to be added to the map\n\/\/ becomes the default encoding for the type.\nclass TypeEncodingResolver {\n public:\n Status GetTypeEncodingInfo(DataType t, EncodingType e,\n const TypeEncodingInfo** out) {\n if (e == AUTO_ENCODING) {\n e = GetDefaultEncoding(t);\n }\n const TypeEncodingInfo *type_info = mapping_[make_pair(t, e)].get();\n if (PREDICT_FALSE(type_info == nullptr)) {\n return Status::NotSupported(\n strings::Substitute(\"encoding $1 not supported for type $0\",\n DataType_Name(t),\n EncodingType_Name(e)));\n }\n *out = type_info;\n return Status::OK();\n }\n\n const EncodingType GetDefaultEncoding(DataType t) {\n return default_mapping_[t];\n }\n\n \/\/ Add the encoding mappings\n \/\/ the first encoder\/decoder to be\n \/\/ added to the mapping becomes the default\n private:\n TypeEncodingResolver() {\n AddMapping<UINT8, BIT_SHUFFLE>();\n AddMapping<UINT8, PLAIN_ENCODING>();\n AddMapping<UINT8, RLE>();\n AddMapping<INT8, BIT_SHUFFLE>();\n AddMapping<INT8, PLAIN_ENCODING>();\n AddMapping<INT8, RLE>();\n AddMapping<UINT16, BIT_SHUFFLE>();\n AddMapping<UINT16, PLAIN_ENCODING>();\n AddMapping<UINT16, RLE>();\n AddMapping<INT16, BIT_SHUFFLE>();\n AddMapping<INT16, PLAIN_ENCODING>();\n AddMapping<INT16, RLE>();\n AddMapping<UINT32, BIT_SHUFFLE>();\n AddMapping<UINT32, RLE>();\n AddMapping<UINT32, PLAIN_ENCODING>();\n AddMapping<INT32, BIT_SHUFFLE>();\n AddMapping<INT32, PLAIN_ENCODING>();\n AddMapping<INT32, RLE>();\n AddMapping<UINT64, BIT_SHUFFLE>();\n AddMapping<UINT64, PLAIN_ENCODING>();\n AddMapping<UINT64, RLE>();\n AddMapping<INT64, BIT_SHUFFLE>();\n AddMapping<INT64, PLAIN_ENCODING>();\n AddMapping<INT64, RLE>();\n AddMapping<FLOAT, BIT_SHUFFLE>();\n AddMapping<FLOAT, PLAIN_ENCODING>();\n AddMapping<DOUBLE, BIT_SHUFFLE>();\n AddMapping<DOUBLE, PLAIN_ENCODING>();\n AddMapping<BINARY, DICT_ENCODING>();\n AddMapping<BINARY, PLAIN_ENCODING>();\n AddMapping<BINARY, PREFIX_ENCODING>();\n AddMapping<BOOL, RLE>();\n AddMapping<BOOL, PLAIN_ENCODING>();\n AddMapping<INT128, BIT_SHUFFLE>();\n AddMapping<INT128, PLAIN_ENCODING>();\n \/\/ TODO: Add 128 bit support to RLE\n \/\/ AddMapping<INT128, RLE>();\n }\n\n template<DataType type, EncodingType encoding> void AddMapping() {\n TypeEncodingTraits<type, encoding> traits;\n \/\/ The first call to AddMapping() for a given data-type is always the default one.\n \/\/ emplace() will no-op if the data-type is already present, so we can blindly\n \/\/ call emplace() here(i.e. no need to call find() to check before inserting)\n default_mapping_.emplace(type, encoding);\n mapping_.emplace(make_pair(type, encoding),\n unique_ptr<TypeEncodingInfo>(new TypeEncodingInfo(traits)));\n }\n\n unordered_map<pair<DataType, EncodingType>,\n unique_ptr<const TypeEncodingInfo>,\n EncodingMapHash > mapping_;\n\n unordered_map<DataType, EncodingType, std::hash<size_t> > default_mapping_;\n\n friend class Singleton<TypeEncodingResolver>;\n DISALLOW_COPY_AND_ASSIGN(TypeEncodingResolver);\n};\n\nStatus TypeEncodingInfo::Get(const TypeInfo* typeinfo,\n EncodingType encoding,\n const TypeEncodingInfo** out) {\n return Singleton<TypeEncodingResolver>::get()->GetTypeEncodingInfo(typeinfo->physical_type(),\n encoding,\n out);\n}\n\nconst EncodingType TypeEncodingInfo::GetDefaultEncoding(const TypeInfo* typeinfo) {\n return Singleton<TypeEncodingResolver>::get()->GetDefaultEncoding(typeinfo->physical_type());\n}\n\n} \/\/ namespace cfile\n} \/\/ namespace kudu\n\n<|endoftext|>"} {"text":"<commit_before>#include \"MeshParser.h\"\n#include \"Logger.h\"\n#include \"MathParser.h\"\n#include \"mesh\/MeshBase.h\"\n\n#include \"DataLisp.h\"\n\nnamespace PR {\n\ntemplate <int D>\nstatic bool loadAttribute(const std::string& attrname, const DL::DataGroup& grp, std::vector<float>& attr)\n{\n\tstatic_assert(D > 0 && D <= 3, \"Invalid dimension given\");\n\n\tattr.reserve(attr.size() + grp.anonymousCount() * D);\n\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::Data attrValD = grp.at(j);\n\t\tif (attrValD.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Mesh \" << attrname << \" attribute is invalid.\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool ok;\n\t\tVector3f v = MathParser::getVector(attrValD.getGroup(), ok);\n\n\t\tif (ok) {\n\t\t\tfor (int i = 0; i < D; ++i)\n\t\t\t\tattr.push_back(v[i]);\n\t\t} else {\n\t\t\tPR_LOG(L_ERROR) << \"Mesh \" << attrname << \" attribute entry is invalid.\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic inline std::optional<std::pair<size_t, size_t>> countTriQuad(const DL::DataGroup& grp)\n{\n\tsize_t triCount\t = 0;\n\tsize_t quadCount = 0;\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::Data iD = grp.at(j);\n\n\t\tif (iD.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Given face is invalid.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tDL::DataGroup arr = iD.getGroup();\n\n\t\tif (!arr.isArray()) {\n\t\t\tPR_LOG(L_ERROR) << \"Given face data is invalid.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tif (!arr.isAllOfType(DL::DT_Integer)) {\n\t\t\tPR_LOG(L_ERROR) << \"Given index is not integer.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tif (arr.anonymousCount() == 3) {\n\t\t\t++triCount;\n\t\t} else if (arr.anonymousCount() == 4) {\n\t\t\t++quadCount;\n\t\t} else {\n\t\t\tPR_LOG(L_ERROR) << \"Only triangle or quad faces are supported.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\t}\n\n\treturn { { triCount, quadCount } };\n}\n\n\/\/ Setup indices, vertex component indices will be handled special\nstatic bool setupIndices(MeshComponent component, MeshBase* me, const DL::DataGroup& grp)\n{\n\tconst size_t vertexCount = me->nodeCount();\n\tconst auto triQuadC\t\t = countTriQuad(grp);\n\tif (!triQuadC.has_value())\n\t\treturn false;\n\n\tconst size_t triCount = triQuadC.value().first;\n\tconst size_t quadCount = triQuadC.value().second;\n\n\tbool needsVPF\t = (component == MeshComponent::Vertex) && triCount != 0 && quadCount != 0;\n\tsize_t facecount = triCount + quadCount;\n\n\tstd::vector<uint32> indices;\n\tindices.reserve(triCount * 3 + quadCount * 4);\n\n\tstd::vector<uint8> verticesPerFace;\n\tif (needsVPF)\n\t\tverticesPerFace.reserve(facecount);\n\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::DataGroup arr = grp.at(j).getGroup();\n\n\t\tfor (size_t d = 0; d < arr.anonymousCount(); ++d) {\n\t\t\tint32 val = static_cast<int32>(arr.at(d).getInt());\n\n\t\t\tif (val < 0 || (size_t)val >= vertexCount) {\n\t\t\t\tPR_LOG(L_ERROR) << \"Given index range is invalid.\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tindices.push_back(static_cast<uint32>(val));\n\t\t}\n\n\t\tif (needsVPF)\n\t\t\tverticesPerFace.push_back(static_cast<uint8>(grp.anonymousCount()));\n\t}\n\n\tme->setVertexComponentIndices(component, std::move(indices));\n\n\t\/\/ Set face vertex count buffer if we deal with the vertex indices\n\tif (component == MeshComponent::Vertex) {\n\t\tif (!verticesPerFace.empty())\n\t\t\tme->setFaceVertexCount(std::move(verticesPerFace));\n\t\telse {\n\t\t\tif (quadCount == 0)\n\t\t\t\tme->assumeTriangular(facecount);\n\t\t\telse if (triCount == 0)\n\t\t\t\tme->assumeQuadrangular(facecount);\n\t\t\telse {\n\t\t\t\tPR_ASSERT(false, \"Should not be reached!\");\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nstd::unique_ptr<MeshBase> MeshParser::parse(const DL::DataGroup& group)\n{\n\tauto me = std::make_unique<MeshBase>();\n\n\t\/\/ First get vertex attributes\n\tfor (size_t i = 0; i < group.anonymousCount(); ++i) {\n\t\tDL::Data d = group.at(i);\n\t\tif (d.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Invalid entry in mesh description.\" << std::endl;\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tDL::DataGroup& grp = d.getGroup();\n\t\tif (grp.id() == \"attribute\") {\n\t\t\tDL::Data attrTypeD = grp.getFromKey(\"type\");\n\t\t\tif (attrTypeD.type() != DL::DT_String) {\n\t\t\t\tPR_LOG(L_ERROR) << \"Mesh attribute has no valid type.\" << std::endl;\n\t\t\t\treturn nullptr;\n\t\t\t} else if (attrTypeD.getString() == \"p\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"position\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Vertex, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"n\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"normal\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Normal, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"t\" || attrTypeD.getString() == \"uv\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<2>(\"texture\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Texture, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"w\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"weight\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Weight, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"dp\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"velocity\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Velocity, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"u\") {\n\t\t\t\tPR_LOG(L_WARNING) << \"User attributes currently not supported.\" << std::endl;\n\t\t\t} else {\n\t\t\t\tPR_LOG(L_ERROR) << \"Unknown mesh attribute '\" << attrTypeD.getString() << \"'.\" << std::endl;\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\t\/\/ Will not be used anywhere -> Clear for memory space\n\t\t\tgrp.clear();\n\t\t}\n\t}\n\n\t\/\/ Get face attributes\n\tfor (size_t i = 0; i < group.anonymousCount(); ++i) {\n\t\tDL::Data d = group.at(i);\n\t\tif (d.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Invalid entry in mesh description.\" << std::endl;\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tDL::DataGroup& grp = d.getGroup();\n\t\tif (grp.id() == \"faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Vertex, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"normal_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Normal, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"texture_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Texture, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"weight_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Weight, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"velocity_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Velocity, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"materials\") {\n\t\t\tstd::vector<uint32> materials;\n\t\t\tmaterials.reserve(grp.anonymousCount());\n\t\t\tfor (size_t j = 0; j < grp.anonymousCount(); j++) {\n\t\t\t\tDL::Data indexD = grp.at(j);\n\n\t\t\t\tif (indexD.type() != DL::DT_Integer) {\n\t\t\t\t\tPR_LOG(L_ERROR) << \"Given index is invalid.\" << std::endl;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tauto index = indexD.getInt();\n\n\t\t\t\tif (index < 0) {\n\t\t\t\t\tPR_LOG(L_ERROR) << \"Given index range is invalid.\" << std::endl;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tmaterials.push_back(static_cast<uint32>(index));\n\t\t\t}\n\t\t\tme->setMaterialSlots(std::move(materials));\n\t\t}\n\n\t\t\/\/ Will not be used anywhere -> Clear for memory space\n\t\tgrp.clear();\n\t}\n\n\tif (!me->isValid()) {\n\t\tPR_LOG(L_ERROR) << \"Loaded mesh is invalid.\" << std::endl;\n\t\treturn nullptr;\n\t}\n\n\treturn me;\n}\n} \/\/ namespace PR\n<commit_msg>Fixed windows build error<commit_after>#include \"MeshParser.h\"\n#include \"Logger.h\"\n#include \"MathParser.h\"\n#include \"mesh\/MeshBase.h\"\n\n#include \"DataLisp.h\"\n\n#include <optional>\n\nnamespace PR {\n\ntemplate <int D>\nstatic bool loadAttribute(const std::string& attrname, const DL::DataGroup& grp, std::vector<float>& attr)\n{\n\tstatic_assert(D > 0 && D <= 3, \"Invalid dimension given\");\n\n\tattr.reserve(attr.size() + grp.anonymousCount() * D);\n\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::Data attrValD = grp.at(j);\n\t\tif (attrValD.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Mesh \" << attrname << \" attribute is invalid.\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool ok;\n\t\tVector3f v = MathParser::getVector(attrValD.getGroup(), ok);\n\n\t\tif (ok) {\n\t\t\tfor (int i = 0; i < D; ++i)\n\t\t\t\tattr.push_back(v[i]);\n\t\t} else {\n\t\t\tPR_LOG(L_ERROR) << \"Mesh \" << attrname << \" attribute entry is invalid.\" << std::endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic inline std::optional<std::pair<size_t, size_t>> countTriQuad(const DL::DataGroup& grp)\n{\n\tsize_t triCount\t = 0;\n\tsize_t quadCount = 0;\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::Data iD = grp.at(j);\n\n\t\tif (iD.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Given face is invalid.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tDL::DataGroup arr = iD.getGroup();\n\n\t\tif (!arr.isArray()) {\n\t\t\tPR_LOG(L_ERROR) << \"Given face data is invalid.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tif (!arr.isAllOfType(DL::DT_Integer)) {\n\t\t\tPR_LOG(L_ERROR) << \"Given index is not integer.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\n\t\tif (arr.anonymousCount() == 3) {\n\t\t\t++triCount;\n\t\t} else if (arr.anonymousCount() == 4) {\n\t\t\t++quadCount;\n\t\t} else {\n\t\t\tPR_LOG(L_ERROR) << \"Only triangle or quad faces are supported.\" << std::endl;\n\t\t\treturn {};\n\t\t}\n\t}\n\n\treturn { { triCount, quadCount } };\n}\n\n\/\/ Setup indices, vertex component indices will be handled special\nstatic bool setupIndices(MeshComponent component, MeshBase* me, const DL::DataGroup& grp)\n{\n\tconst size_t vertexCount = me->nodeCount();\n\tconst auto triQuadC\t\t = countTriQuad(grp);\n\tif (!triQuadC.has_value())\n\t\treturn false;\n\n\tconst size_t triCount = triQuadC.value().first;\n\tconst size_t quadCount = triQuadC.value().second;\n\n\tbool needsVPF\t = (component == MeshComponent::Vertex) && triCount != 0 && quadCount != 0;\n\tsize_t facecount = triCount + quadCount;\n\n\tstd::vector<uint32> indices;\n\tindices.reserve(triCount * 3 + quadCount * 4);\n\n\tstd::vector<uint8> verticesPerFace;\n\tif (needsVPF)\n\t\tverticesPerFace.reserve(facecount);\n\n\tfor (size_t j = 0; j < grp.anonymousCount(); ++j) {\n\t\tDL::DataGroup arr = grp.at(j).getGroup();\n\n\t\tfor (size_t d = 0; d < arr.anonymousCount(); ++d) {\n\t\t\tint32 val = static_cast<int32>(arr.at(d).getInt());\n\n\t\t\tif (val < 0 || (size_t)val >= vertexCount) {\n\t\t\t\tPR_LOG(L_ERROR) << \"Given index range is invalid.\" << std::endl;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tindices.push_back(static_cast<uint32>(val));\n\t\t}\n\n\t\tif (needsVPF)\n\t\t\tverticesPerFace.push_back(static_cast<uint8>(grp.anonymousCount()));\n\t}\n\n\tme->setVertexComponentIndices(component, std::move(indices));\n\n\t\/\/ Set face vertex count buffer if we deal with the vertex indices\n\tif (component == MeshComponent::Vertex) {\n\t\tif (!verticesPerFace.empty())\n\t\t\tme->setFaceVertexCount(std::move(verticesPerFace));\n\t\telse {\n\t\t\tif (quadCount == 0)\n\t\t\t\tme->assumeTriangular(facecount);\n\t\t\telse if (triCount == 0)\n\t\t\t\tme->assumeQuadrangular(facecount);\n\t\t\telse {\n\t\t\t\tPR_ASSERT(false, \"Should not be reached!\");\n\t\t\t}\n\t\t}\n\t}\n\n\treturn true;\n}\n\nstd::unique_ptr<MeshBase> MeshParser::parse(const DL::DataGroup& group)\n{\n\tauto me = std::make_unique<MeshBase>();\n\n\t\/\/ First get vertex attributes\n\tfor (size_t i = 0; i < group.anonymousCount(); ++i) {\n\t\tDL::Data d = group.at(i);\n\t\tif (d.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Invalid entry in mesh description.\" << std::endl;\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tDL::DataGroup& grp = d.getGroup();\n\t\tif (grp.id() == \"attribute\") {\n\t\t\tDL::Data attrTypeD = grp.getFromKey(\"type\");\n\t\t\tif (attrTypeD.type() != DL::DT_String) {\n\t\t\t\tPR_LOG(L_ERROR) << \"Mesh attribute has no valid type.\" << std::endl;\n\t\t\t\treturn nullptr;\n\t\t\t} else if (attrTypeD.getString() == \"p\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"position\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Vertex, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"n\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"normal\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Normal, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"t\" || attrTypeD.getString() == \"uv\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<2>(\"texture\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Texture, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"w\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"weight\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Weight, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"dp\") {\n\t\t\t\tstd::vector<float> arr;\n\t\t\t\tif (!loadAttribute<3>(\"velocity\", grp, arr))\n\t\t\t\t\treturn nullptr;\n\t\t\t\tme->setVertexComponent(MeshComponent::Velocity, std::move(arr));\n\t\t\t} else if (attrTypeD.getString() == \"u\") {\n\t\t\t\tPR_LOG(L_WARNING) << \"User attributes currently not supported.\" << std::endl;\n\t\t\t} else {\n\t\t\t\tPR_LOG(L_ERROR) << \"Unknown mesh attribute '\" << attrTypeD.getString() << \"'.\" << std::endl;\n\t\t\t\treturn nullptr;\n\t\t\t}\n\n\t\t\t\/\/ Will not be used anywhere -> Clear for memory space\n\t\t\tgrp.clear();\n\t\t}\n\t}\n\n\t\/\/ Get face attributes\n\tfor (size_t i = 0; i < group.anonymousCount(); ++i) {\n\t\tDL::Data d = group.at(i);\n\t\tif (d.type() != DL::DT_Group) {\n\t\t\tPR_LOG(L_ERROR) << \"Invalid entry in mesh description.\" << std::endl;\n\t\t\treturn nullptr;\n\t\t}\n\n\t\tDL::DataGroup& grp = d.getGroup();\n\t\tif (grp.id() == \"faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Vertex, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"normal_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Normal, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"texture_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Texture, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"weight_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Weight, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"velocity_faces\") {\n\t\t\tif (!setupIndices(MeshComponent::Velocity, me.get(), grp))\n\t\t\t\treturn nullptr;\n\t\t} else if (grp.id() == \"materials\") {\n\t\t\tstd::vector<uint32> materials;\n\t\t\tmaterials.reserve(grp.anonymousCount());\n\t\t\tfor (size_t j = 0; j < grp.anonymousCount(); j++) {\n\t\t\t\tDL::Data indexD = grp.at(j);\n\n\t\t\t\tif (indexD.type() != DL::DT_Integer) {\n\t\t\t\t\tPR_LOG(L_ERROR) << \"Given index is invalid.\" << std::endl;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tauto index = indexD.getInt();\n\n\t\t\t\tif (index < 0) {\n\t\t\t\t\tPR_LOG(L_ERROR) << \"Given index range is invalid.\" << std::endl;\n\t\t\t\t\treturn nullptr;\n\t\t\t\t}\n\n\t\t\t\tmaterials.push_back(static_cast<uint32>(index));\n\t\t\t}\n\t\t\tme->setMaterialSlots(std::move(materials));\n\t\t}\n\n\t\t\/\/ Will not be used anywhere -> Clear for memory space\n\t\tgrp.clear();\n\t}\n\n\tif (!me->isValid()) {\n\t\tPR_LOG(L_ERROR) << \"Loaded mesh is invalid.\" << std::endl;\n\t\treturn nullptr;\n\t}\n\n\treturn me;\n}\n} \/\/ namespace PR\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <limits>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <functional>\n\nusing std::max;\nusing std::make_pair;\nusing std::min;\nusing std::abs;\nusing std::hypot;\nusing std::vector;\nusing std::map;\nusing std::function;\n\nnamespace search\n{\n \/\/\n \/\/ Lifelong planning \n \/\/\n namespace lp\n {\n constexpr auto infinity() -> int\n {\n return std::numeric_limits<int>::max();\n }\n constexpr auto cost() -> int\n {\n return 1;\n }\n\n struct Coordinate\n {\n const int x, y;\n \n friend auto operator== (Coordinate l, Coordinate r)\n {\n return l.x == r.x && l.y == r.y;\n }\n friend auto operator!= (Coordinate l, Coordinate r)\n {\n return !(l == r);\n }\n\n auto neighbours() const -> vector<Coordinate>\n {\n struct Directions : public map< char, function< Coordinate(Coordinate) >>\n {\n Directions()\n {\n (*this)['1'] = [](Coordinate c) -> Coordinate { return{ c.x - 1, c.y - 1 }; };\n (*this)['2'] = [](Coordinate c) -> Coordinate { return{ c.x - 0, c.y - 1 }; };\n (*this)['3'] = [](Coordinate c) -> Coordinate { return{ c.x + 1, c.y - 1 }; };\n (*this)['4'] = [](Coordinate c) -> Coordinate { return{ c.x - 1, c.y - 0 }; };\n (*this)['5'] = [](Coordinate c) -> Coordinate { return{ c.x + 1, c.y + 0 }; };\n (*this)['6'] = [](Coordinate c) -> Coordinate { return{ c.x - 1, c.y + 1 }; };\n (*this)['7'] = [](Coordinate c) -> Coordinate { return{ c.x - 0, c.y + 1 }; };\n (*this)['8'] = [](Coordinate c) -> Coordinate { return{ c.x + 1, c.y + 1 }; };\n }\n } static const directions;\n\n vector<Coordinate> result;\n for (auto n = '1'; n != '9'; ++n)\n result.push_back(directions.at(n)(*this));\n return result;\n }\n };\n\n struct LpState\n {\n struct Key\n {\n const int first, second;\n\n friend auto operator== (Key l, Key r) -> bool\n {\n return l.first == r.first && l.second == r.second;\n }\n friend auto operator < (Key l, Key r) -> bool\n {\n return (l.first < r.first) || (l.first == r.first && l.second < r.second);\n }\n };\n\n const Coordinate coordinate;\n int g, r;\n\n template<typename Hfunc>\n auto key(Hfunc h) const -> Key\n {\n return{ min(g, r + h(coordinate)), min(g, r) };\n }\n };\n\n struct LpManhattanDistance\n {\n const Coordinate goal;\n auto operator()(Coordinate c) const -> int\n {\n return max(abs(goal.x - c.x), abs(goal.y - c.y));\n }\n };\n\n struct LpEuclideanDistance\n {\n const Coordinate goal;\n auto operator()(Coordinate c) const -> int\n {\n auto result = hypot(abs(goal.x - c.x), abs(goal.y - c.y));\n return static_cast<int>(round(result));\n }\n };\n }\n}<commit_msg>remove return type<commit_after>#pragma once\n\n#include <limits>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <functional>\n\nusing std::max;\nusing std::make_pair;\nusing std::min;\nusing std::abs;\nusing std::hypot;\nusing std::vector;\nusing std::map;\nusing std::function;\n\nnamespace search\n{\n \/\/\n \/\/ Lifelong planning \n \/\/\n namespace lp\n {\n constexpr auto infinity() \n { \n return std::numeric_limits<int>::max(); \n }\n constexpr auto cost()\n {\n return 1;\n }\n\n struct Coordinate\n {\n const int x, y;\n \n friend auto operator== (Coordinate l, Coordinate r)\n {\n return l.x == r.x && l.y == r.y;\n }\n friend auto operator!= (Coordinate l, Coordinate r)\n {\n return !(l == r);\n }\n\n auto neighbours() const\n {\n struct Directions : public map< char, function< Coordinate(Coordinate) >>\n {\n Directions()\n {\n (*this)['1'] = [](Coordinate c) { return Coordinate{ c.x - 1, c.y - 1 }; };\n (*this)['2'] = [](Coordinate c) { return Coordinate{ c.x - 0, c.y - 1 }; };\n (*this)['3'] = [](Coordinate c) { return Coordinate{ c.x + 1, c.y - 1 }; };\n (*this)['4'] = [](Coordinate c) { return Coordinate{ c.x - 1, c.y - 0 }; };\n (*this)['5'] = [](Coordinate c) { return Coordinate{ c.x + 1, c.y + 0 }; };\n (*this)['6'] = [](Coordinate c) { return Coordinate{ c.x - 1, c.y + 1 }; };\n (*this)['7'] = [](Coordinate c) { return Coordinate{ c.x - 0, c.y + 1 }; };\n (*this)['8'] = [](Coordinate c) { return Coordinate{ c.x + 1, c.y + 1 }; };\n }\n } static const directions;\n\n vector<Coordinate> result;\n for (auto n = '1'; n != '9'; ++n)\n result.push_back(directions.at(n)(*this));\n return result;\n }\n };\n\n struct LpState\n {\n struct Key\n {\n const int first, second;\n\n friend auto operator== (Key l, Key r)\n {\n return l.first == r.first && l.second == r.second;\n }\n friend auto operator < (Key l, Key r)\n {\n return (l.first < r.first) || (l.first == r.first && l.second < r.second);\n }\n };\n\n const Coordinate coordinate;\n int g, r;\n\n template<typename Hfunc>\n auto key(Hfunc h) const\n {\n return Key{ min(g, r + h(coordinate)), min(g, r) };\n }\n };\n\n struct LpManhattanDistance\n {\n const Coordinate goal;\n auto operator()(Coordinate c) const\n {\n return max(abs(goal.x - c.x), abs(goal.y - c.y));\n }\n };\n\n struct LpEuclideanDistance\n {\n const Coordinate goal;\n auto operator()(Coordinate c) const\n {\n auto result = hypot(abs(goal.x - c.x), abs(goal.y - c.y));\n return static_cast<int>(round(result));\n }\n };\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * ply2json\n *\n * The program is a ply file format to json file format converter for use\n * with three.js. The program uses the C++ libraries from the VTK toolkit\n * in order to read in a ply file and convert it into the json file format\n * which can be recongnized by three.js for rendering in the browsing.\n *\n * @Author Migara Liyanamage\n * @Date 19 June 2014\n * @Version 1.0\n *\n *\/\n\n\n\/\/ Import for VTK Libraries\n#include <vtkPLYReader.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkDecimatePro.h>\n\n\/\/ Import for standard C++ libraries\n#include <iostream>\n#include <fstream>\n\n\/\/ Import for program header\n#include \"ply2json.h\"\n\nusing namespace std;\n\n\/\/ stores the filename of the input file\nstatic string inputFilename;\n\n\/\/ store the filename of the output file\nstatic string outputFilename;\n\n\/\/ set amount to decimate by, if set to 1 no decimation occurs\nstatic double decAmount;\n\n\n\/*\n * Main Method\n *\n * This method reads in the file which is to be converted from the command line\n * and calls the appropriate methods to begin the conversion.\n *\n *\/\nint main( int argc, char ** argv )\n{\n if (argc < 3)\n {\n \/\/ Print Usage Message\n cout << \"Usage: \" << argv[0] << \" filename.ply outputName [decimate amount 0.0 .. 1.0]\" << endl;\n return EXIT_FAILURE;\n }\n\n if (argc == 4)\n {\n decAmount = atof(argv[3]);\n }\n else\n {\n decAmount = 1.0;\n }\n\n \/\/ Assign appropriate file names for the program\n inputFilename = argv[1];\n outputFilename = argv[2];\n\n \/\/ begin generation\n generateJSON();\n\n return EXIT_SUCCESS;\n}\n\n\/*\n * Generate JSON Method\n *\n * This method calls the appropriate methods in the vtk toolkit and outputs the\n * JSON file to the output file name specified\n *\n *\/\nvoid generateJSON()\n{\n \/\/ File stream for output file\n std::ofstream outputFile;\n outputFile.open(outputFilename.c_str());\n\n \/\/ begin the json file\n outputFile << \"{\\n\";\n\n \/\/ Reader to read in PLY File\n vtkSmartPointer<vtkPLYReader> reader =\n vtkSmartPointer<vtkPLYReader>::New();\n\n \/\/ Specify filename\n reader->SetFileName ( inputFilename.c_str() );\n\n \/\/ Call vtk pipeline to read in the file\n reader->Update();\n\n vtkDataSet * data;\n vtkIdType vert;\n vtkPolyData * pdata;\n vtkCellArray * faces;\n vtkSmartPointer<vtkPolyData> decimated;\n\n if (decAmount >= 1.0)\n {\n \/\/ Get the outpuyt for vertices\n data = reader->GetOutput();\n vert = data->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n pdata = reader->GetOutput();\n faces = pdata->GetPolys();\n }\n else if (decAmount < 0.0)\n {\n cout << \"Invalid Decimate Amount, Program will now exit\" << endl;\n exit(EXIT_FAILURE);\n } else\n {\n \/\/ create decimator\n vtkSmartPointer<vtkDecimatePro> decimate = vtkSmartPointer<vtkDecimatePro>::New();\n\n \/\/ set decimator to the selected file\n decimate->SetInputData(reader->GetOutput());\n\n \/\/ set target to reduce to, and set topology to be preserved\n decimate->PreserveTopologyOn();\n decimate->SetTargetReduction(decAmount);\n\n \/\/ start decimation\n decimate->Update();\n\n decimated =\n vtkSmartPointer<vtkPolyData>::New();\n decimated->ShallowCopy(decimate->GetOutput());\n\n \/\/ Get the outpuyt for vertices\n data = decimated;\n vert = decimated->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n faces = decimated->GetPolys();\n }\n\n vtkIdType numCells = faces->GetNumberOfCells();\n\n vtkIdType cellLocation = 0;\n\n \/\/ Write the standard format header for the json file\n outputFile << \"\\\"metadata\\\":{\\\"formatVersion\\\":3,\\\"vertices\\\":\" << vert << \",\\\"faces\\\":\" << numCells << \",\\\"materials\\\":1},\\n\";\n outputFile << \"\\\"scale\\\":1.0,\\n\\\"materials\\\":[{\\\"DbgColor\\\":15658734,\\\"DbgIndex\\\":0,\\\"DbgName\\\":\\\"default\\\",\\\"vertexColors\\\": false}],\\n\";\n\n \/\/ Begin writing vertices\n outputFile << \"\\\"vertices\\\":[\";\n\n \/\/ Iterate over all the points and print them to the file\n for(vtkIdType i = 0; i < vert; i++)\n {\n double p[3];\n data->GetPoint(i, p);\n outputFile << p[0] << \",\" << p[1] << \",\" << p[2];\n if (i != vert - 1) outputFile << \",\"; \/\/ Avoid putting comma before end bracket\n }\n \/\/ End the vertices section\n outputFile << \"],\\n\";\n\n \/\/ Begin writing faces\n outputFile << \"\\\"faces\\\":[\";\n\n \/\/ Iterate over the faces and print them to file\n for (vtkIdType i = 0; i < numCells; i++)\n {\n vtkIdType numIDs;\n vtkIdType * pointIds;\n\n faces->GetCell(cellLocation, numIDs, pointIds);\n cellLocation += 1 + numIDs; \/\/ increment to include already printed faces\n\n for (vtkIdType j = 0; j < numIDs; j++)\n {\n \/\/ print to the file\n \/\/ printing the zero is for the bit mask signifying face type\n if (j == 0) outputFile << 0 << \",\";\n outputFile << pointIds[j];\n if (i != numCells - 1)\n {\n outputFile << \",\";\n }\n else\n {\n if(j != numIDs - 1) outputFile << \",\"; \/\/ avoid additional comma at end\n }\n }\n }\n\n \/\/ end faces section\n outputFile << \"]\\n\";\n\n \/\/ end the json file\n outputFile << \"}\\n\";\n\n \/\/ flush the file stream\n outputFile.flush();\n\n \/\/ close file stream\n outputFile.close();\n}\n<commit_msg>added more helpful message<commit_after>\/*\n * ply2json\n *\n * The program is a ply file format to json file format converter for use\n * with three.js. The program uses the C++ libraries from the VTK toolkit\n * in order to read in a ply file and convert it into the json file format\n * which can be recongnized by three.js for rendering in the browsing.\n *\n * @Author Migara Liyanamage\n * @Date 19 June 2014\n * @Version 1.0\n *\n *\/\n\n\n\/\/ Import for VTK Libraries\n#include <vtkPLYReader.h>\n#include <vtkSmartPointer.h>\n#include <vtkCellArray.h>\n#include <vtkDecimatePro.h>\n\n\/\/ Import for standard C++ libraries\n#include <iostream>\n#include <fstream>\n\n\/\/ Import for program header\n#include \"ply2json.h\"\n\nusing namespace std;\n\n\/\/ stores the filename of the input file\nstatic string inputFilename;\n\n\/\/ store the filename of the output file\nstatic string outputFilename;\n\n\/\/ set amount to decimate by, if set to 1 no decimation occurs\nstatic double decAmount;\n\n\n\/*\n * Main Method\n *\n * This method reads in the file which is to be converted from the command line\n * and calls the appropriate methods to begin the conversion.\n *\n *\/\nint main( int argc, char ** argv )\n{\n if (argc < 3)\n {\n \/\/ Print Usage Message\n cout << \"Usage: \" << argv[0] << \" filename.ply outputName [decimate amount 0.0 .. 1.0]\" << endl;\n cout << \"\\nfilename.ply - Name of PLY file to convert\" << endl;\n cout << \"outputName - Name of output file with extension\" << endl;\n cout << \"decimate amount - Amount to decimate image by, zero is no decimation, one is maximum\" << endl;\n return EXIT_FAILURE;\n }\n\n if (argc == 4)\n {\n decAmount = atof(argv[3]);\n }\n else\n {\n decAmount = 1.0;\n }\n\n \/\/ Assign appropriate file names for the program\n inputFilename = argv[1];\n outputFilename = argv[2];\n\n \/\/ begin generation\n generateJSON();\n\n return EXIT_SUCCESS;\n}\n\n\/*\n * Generate JSON Method\n *\n * This method calls the appropriate methods in the vtk toolkit and outputs the\n * JSON file to the output file name specified\n *\n *\/\nvoid generateJSON()\n{\n \/\/ File stream for output file\n std::ofstream outputFile;\n outputFile.open(outputFilename.c_str());\n\n \/\/ begin the json file\n outputFile << \"{\\n\";\n\n \/\/ Reader to read in PLY File\n vtkSmartPointer<vtkPLYReader> reader =\n vtkSmartPointer<vtkPLYReader>::New();\n\n \/\/ Specify filename\n reader->SetFileName ( inputFilename.c_str() );\n\n \/\/ Call vtk pipeline to read in the file\n reader->Update();\n\n vtkDataSet * data;\n vtkIdType vert;\n vtkPolyData * pdata;\n vtkCellArray * faces;\n vtkSmartPointer<vtkPolyData> decimated;\n\n if (decAmount >= 1.0)\n {\n \/\/ Get the outpuyt for vertices\n data = reader->GetOutput();\n vert = data->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n pdata = reader->GetOutput();\n faces = pdata->GetPolys();\n }\n else if (decAmount < 0.0)\n {\n cout << \"Invalid Decimate Amount, Program will now exit\" << endl;\n exit(EXIT_FAILURE);\n } else\n {\n \/\/ create decimator\n vtkSmartPointer<vtkDecimatePro> decimate = vtkSmartPointer<vtkDecimatePro>::New();\n\n \/\/ set decimator to the selected file\n decimate->SetInputData(reader->GetOutput());\n\n \/\/ set target to reduce to, and set topology to be preserved\n decimate->PreserveTopologyOn();\n decimate->SetTargetReduction(decAmount);\n\n \/\/ start decimation\n decimate->Update();\n\n decimated =\n vtkSmartPointer<vtkPolyData>::New();\n decimated->ShallowCopy(decimate->GetOutput());\n\n \/\/ Get the outpuyt for vertices\n data = decimated;\n vert = decimated->GetNumberOfPoints();\n\n \/\/ Get the output for polygons\n faces = decimated->GetPolys();\n }\n\n vtkIdType numCells = faces->GetNumberOfCells();\n\n vtkIdType cellLocation = 0;\n\n \/\/ Write the standard format header for the json file\n outputFile << \"\\\"metadata\\\":{\\\"formatVersion\\\":3,\\\"vertices\\\":\" << vert << \",\\\"faces\\\":\" << numCells << \",\\\"materials\\\":1},\\n\";\n outputFile << \"\\\"scale\\\":1.0,\\n\\\"materials\\\":[{\\\"DbgColor\\\":15658734,\\\"DbgIndex\\\":0,\\\"DbgName\\\":\\\"default\\\",\\\"vertexColors\\\": false}],\\n\";\n\n \/\/ Begin writing vertices\n outputFile << \"\\\"vertices\\\":[\";\n\n \/\/ Iterate over all the points and print them to the file\n for(vtkIdType i = 0; i < vert; i++)\n {\n double p[3];\n data->GetPoint(i, p);\n outputFile << p[0] << \",\" << p[1] << \",\" << p[2];\n if (i != vert - 1) outputFile << \",\"; \/\/ Avoid putting comma before end bracket\n }\n \/\/ End the vertices section\n outputFile << \"],\\n\";\n\n \/\/ Begin writing faces\n outputFile << \"\\\"faces\\\":[\";\n\n \/\/ Iterate over the faces and print them to file\n for (vtkIdType i = 0; i < numCells; i++)\n {\n vtkIdType numIDs;\n vtkIdType * pointIds;\n\n faces->GetCell(cellLocation, numIDs, pointIds);\n cellLocation += 1 + numIDs; \/\/ increment to include already printed faces\n\n for (vtkIdType j = 0; j < numIDs; j++)\n {\n \/\/ print to the file\n \/\/ printing the zero is for the bit mask signifying face type\n if (j == 0) outputFile << 0 << \",\";\n outputFile << pointIds[j];\n if (i != numCells - 1)\n {\n outputFile << \",\";\n }\n else\n {\n if(j != numIDs - 1) outputFile << \",\"; \/\/ avoid additional comma at end\n }\n }\n }\n\n \/\/ end faces section\n outputFile << \"]\\n\";\n\n \/\/ end the json file\n outputFile << \"}\\n\";\n\n \/\/ flush the file stream\n outputFile.flush();\n\n \/\/ close file stream\n outputFile.close();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"RecommendLister.h\"\n#include \"CategoryLister.h\"\n#include \"ListCollection.h\"\n\nusing namespace boost::program_options;\nusing namespace songtaste;\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n options_description desc(\"Usage\");\n desc.add_options()\n (\"help,h\", \"show help information\")\n (\"recommend\", \"get recommend list\")\n (\"category\", \"get category list\")\n (\"catsong\", \"get song list from a category, require --catid\")\n (\"catid\", value<unsigned int>(), \"category id\")\n (\"page\", value<unsigned int>(), \"page number, default to 1\");\n\n variables_map vm;\n try {\n store(parse_command_line(argc, argv, desc), vm);\n } catch (std::exception &ex) {\n cout << ex.what() << endl;\n return -1;\n }\n notify(vm);\n\n try {\n\n do {\n if (vm.count(\"help\") || argc == 1) {\n cout << desc;\n break;\n }\n\n if (vm.count(\"recommend\")) {\n unsigned int page = vm.count(\"page\") ? vm[\"page\"].as<unsigned int>() : 1;\n ILister *pLister = new RecommendLister;\n cout << pLister->getListAt(page)->toJsonString();\n SAFERELEASE(pLister);\n break;\n }\n\n if (vm.count(\"category\")) {\n ILister *lister = new CategoryLister;\n cout << lister->getListAt()->toJsonString();\n SAFERELEASE(lister);\n break;\n }\n\n if (vm.count(\"catsong\") && vm.count(\"catid\")) {\n unsigned int catid = vm[\"catid\"].as<unsigned int>();\n unsigned int page = vm.count(\"page\") ? vm[\"page\"].as<unsigned int>() : 1;\n CategoryLister *lister = new CategoryLister;\n cout << lister->getMusicByCatid(catid, page)->toJsonString();\n break;\n }\n\n } while (0);\n\n } catch (const exception &err) {\n cout << err.what() << endl;\n }\n\n return 0;\n}\n<commit_msg>修正一处内存泄漏<commit_after>#include <boost\/program_options.hpp>\n#include <iostream>\n#include \"RecommendLister.h\"\n#include \"CategoryLister.h\"\n#include \"ListCollection.h\"\n\nusing namespace boost::program_options;\nusing namespace songtaste;\nusing namespace std;\n\nint main(int argc, char *argv[])\n{\n options_description desc(\"Usage\");\n desc.add_options()\n (\"help,h\", \"show help information\")\n (\"recommend\", \"get recommend list\")\n (\"category\", \"get category list\")\n (\"catsong\", \"get song list from a category, require --catid\")\n (\"catid\", value<unsigned int>(), \"category id\")\n (\"page\", value<unsigned int>(), \"page number, default to 1\");\n\n variables_map vm;\n try {\n store(parse_command_line(argc, argv, desc), vm);\n } catch (std::exception &ex) {\n cout << ex.what() << endl;\n return -1;\n }\n notify(vm);\n\n try {\n\n do {\n if (vm.count(\"help\") || argc == 1) {\n cout << desc;\n break;\n }\n\n if (vm.count(\"recommend\")) {\n unsigned int page = vm.count(\"page\") ? vm[\"page\"].as<unsigned int>() : 1;\n ILister *pLister = new RecommendLister;\n cout << pLister->getListAt(page)->toJsonString();\n SAFERELEASE(pLister);\n break;\n }\n\n if (vm.count(\"category\")) {\n ILister *lister = new CategoryLister;\n cout << lister->getListAt()->toJsonString();\n SAFERELEASE(lister);\n break;\n }\n\n if (vm.count(\"catsong\") && vm.count(\"catid\")) {\n unsigned int catid = vm[\"catid\"].as<unsigned int>();\n unsigned int page = vm.count(\"page\") ? vm[\"page\"].as<unsigned int>() : 1;\n CategoryLister *lister = new CategoryLister;\n cout << lister->getMusicByCatid(catid, page)->toJsonString();\n SAFERELEASE(lister);\n break;\n }\n\n } while (0);\n\n } catch (const exception &err) {\n cout << err.what() << endl;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * qconnman - Connman Applet\n * Copyright (C) 2011 O.S. Systems\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"ipv4widget.h\"\n\n#include <QDebug>\n\n#include <qconnman\/service.h>\n\nIpv4Widget::Ipv4Widget(QWidget *parent):\n QFrame(parent)\n{\n ui.setupUi(this);\n}\n\nvoid Ipv4Widget::setSettings(IPV4Data *ipv4)\n{\n if (!ipv4)\n {\n ui.autoIpAddress->setChecked(true);\n ui.autoDns->setChecked(true);\n\n ui.address->clear();\n ui.netmask->clear();\n ui.gateway->clear();\n\n return;\n }\n\n ui.autoIpAddress->setChecked(ipv4->method() == \"dhcp\");\n ui.manualIpAddress->setChecked(ipv4->method() != \"dhcp\");\n\n ui.address->setText(ipv4->address());\n ui.netmask->setText(ipv4->netmask());\n if (ipv4->gateway() != \"0.0.0.0\")\n ui.gateway->setText(ipv4->gateway());\n}\n\nvoid Ipv4Widget::apply(Service *service)\n{\n QVariantMap map;\n\n if (ui.autoIpAddress->isChecked())\n {\n service->ipv4Configuration()->setMethod(\"dhcp\");\n }\n else if (ui.manualIpAddress->isChecked())\n {\n service->ipv4Configuration()->setMethod(\"manual\");\n service->ipv4Configuration()->setAddress(ui.address->text());\n service->ipv4Configuration()->setNetmask(ui.netmask->text());\n if (ui.gateway->text().isEmpty())\n service->ipv4Configuration()->setGateway(\"0.0.0.0\");\n else\n service->ipv4Configuration()->setGateway(ui.gateway->text());\n }\n}\n\nvoid Ipv4Widget::on_autoIpAddress_stateChanged(int state)\n{\n ui.manualIpAddress->setChecked(state == Qt::Checked ? false : true);\n}\n\nvoid Ipv4Widget::on_manualIpAddress_toggled(bool on)\n{\n ui.autoIpAddress->setCheckState(on ? Qt::Unchecked : Qt::Checked);\n if (on)\n ui.manualDns->setChecked(true);\n}\n\nvoid Ipv4Widget::on_autoDns_stateChanged(int state)\n{\n ui.manualDns->setChecked(state == Qt::Checked ? false : true);\n\n if (state == Qt::Checked)\n {\n ui.autoIpAddress->setCheckState(Qt::Checked);\n ui.preferredDns->clear();\n ui.alternateDns->clear();\n }\n}\n\nvoid Ipv4Widget::on_manualDns_toggled(bool on)\n{\n ui.autoDns->setCheckState(on ? Qt::Unchecked : Qt::Checked);\n}\n<commit_msg>Apply IPV4 configuration<commit_after>\/*\n * qconnman - Connman Applet\n * Copyright (C) 2011 O.S. Systems\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n*\/\n\n#include \"ipv4widget.h\"\n\n#include <QDebug>\n\n#include <qconnman\/service.h>\n\nIpv4Widget::Ipv4Widget(QWidget *parent):\n QFrame(parent)\n{\n ui.setupUi(this);\n}\n\nvoid Ipv4Widget::setSettings(IPV4Data *ipv4)\n{\n if (!ipv4)\n {\n ui.autoIpAddress->setChecked(true);\n ui.autoDns->setChecked(true);\n\n ui.address->clear();\n ui.netmask->clear();\n ui.gateway->clear();\n\n return;\n }\n\n ui.autoIpAddress->setChecked(ipv4->method() == \"dhcp\");\n ui.manualIpAddress->setChecked(ipv4->method() != \"dhcp\");\n\n ui.address->setText(ipv4->address());\n ui.netmask->setText(ipv4->netmask());\n if (ipv4->gateway() != \"0.0.0.0\")\n ui.gateway->setText(ipv4->gateway());\n}\n\nvoid Ipv4Widget::apply(Service *service)\n{\n if (ui.autoIpAddress->isChecked())\n {\n service->ipv4Configuration()->setMethod(\"dhcp\");\n }\n else if (ui.manualIpAddress->isChecked())\n {\n service->ipv4Configuration()->setMethod(\"manual\");\n service->ipv4Configuration()->setAddress(ui.address->text());\n service->ipv4Configuration()->setNetmask(ui.netmask->text());\n if (ui.gateway->text().isEmpty())\n service->ipv4Configuration()->setGateway(\"0.0.0.0\");\n else\n service->ipv4Configuration()->setGateway(ui.gateway->text());\n\n service->ipv4Configuration()->apply();\n }\n}\n\nvoid Ipv4Widget::on_autoIpAddress_stateChanged(int state)\n{\n ui.manualIpAddress->setChecked(state == Qt::Checked ? false : true);\n}\n\nvoid Ipv4Widget::on_manualIpAddress_toggled(bool on)\n{\n ui.autoIpAddress->setCheckState(on ? Qt::Unchecked : Qt::Checked);\n if (on)\n ui.manualDns->setChecked(true);\n}\n\nvoid Ipv4Widget::on_autoDns_stateChanged(int state)\n{\n ui.manualDns->setChecked(state == Qt::Checked ? false : true);\n\n if (state == Qt::Checked)\n {\n ui.autoIpAddress->setCheckState(Qt::Checked);\n ui.preferredDns->clear();\n ui.alternateDns->clear();\n }\n}\n\nvoid Ipv4Widget::on_manualDns_toggled(bool on)\n{\n ui.autoDns->setCheckState(on ? Qt::Unchecked : Qt::Checked);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: JoinDesignView.cxx,v $\n *\n * $Revision: 1.18 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 03:25:36 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef DBAUI_JOINDESIGNVIEW_HXX\n#include \"JoinDesignView.hxx\"\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n#ifndef DBAUI_JOINCONTROLLER_HXX\n#include \"JoinController.hxx\"\n#endif\n#ifndef _UNDO_HXX\n#include <svtools\/undo.hxx>\n#endif\n#ifndef DBAUI_QYDLGTAB_HXX\n#include \"adtabdlg.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef DBACCESS_UI_BROWSER_ID_HXX\n#include \"browserids.hxx\"\n#endif\n#ifndef _DBU_QRY_HRC_\n#include \"dbu_qry.hrc\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CONNECTIVITY_DBTOOLS_HXX_\n#include <connectivity\/dbtools.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_DATATYPE_HPP_\n#include <com\/sun\/star\/sdbc\/DataType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef DBAUI_TABLECONNECTION_HXX\n#include \"TableConnection.hxx\"\n#endif\n#ifndef DBAUI_CONNECTIONLINE_HXX\n#include \"ConnectionLine.hxx\"\n#endif\n#ifndef DBAUI_CONNECTIONLINEDATA_HXX\n#include \"ConnectionLineData.hxx\"\n#endif\n#ifndef DBAUI_TABLECONNECTIONDATA_HXX\n#include \"TableConnectionData.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.hxx>\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n\/\/ #include <com\/sun\/star\/util\/URL.hdl>\n\nusing namespace ::dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::i18n;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::util;\nDBG_NAME(OJoinDesignView)\n\nOJoinDesignView::OJoinDesignView(Window* _pParent, OJoinController* _pController,const Reference< XMultiServiceFactory >& _rFactory)\n :ODataView(_pParent,_pController,_rFactory)\n ,m_pTableView(NULL)\n ,m_pAddTabDlg(NULL)\n ,m_pController(_pController)\n{\n DBG_CTOR(OJoinDesignView,NULL);\n\n m_pScrollWindow = new OScrollWindowHelper(this);\n}\n\/\/ -----------------------------------------------------------------------------\nOJoinDesignView::~OJoinDesignView()\n{\n if ( m_pController )\n m_pController->clearAddTableDialog();\n ::std::auto_ptr<Window> aT3(m_pScrollWindow);\n m_pScrollWindow = NULL;\n ::std::auto_ptr<Window> aT2(m_pTableView);\n m_pTableView = NULL;\n ::std::auto_ptr<Window> aT1(m_pAddTabDlg);\n m_pAddTabDlg = NULL;\n\n DBG_DTOR(OJoinDesignView,NULL);\n}\n\/\/ -------------------------------------------------------------------------\nvoid OJoinDesignView::Construct()\n{\n m_pScrollWindow->setTableView(m_pTableView);\n m_pScrollWindow->Show();\n m_pTableView->Show();\n\n m_pAddTabDlg = new OAddTableDlg(m_pScrollWindow,m_pTableView);\n SetBackground( Wallpaper( Application::GetSettings().GetStyleSettings().GetFaceColor()) );\n\n ODataView::Construct();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::initialize()\n{\n \/\/ getAddTableDialog()->Update();\n}\n\/\/ -------------------------------------------------------------------------\nvoid OJoinDesignView::resizeDocumentView(Rectangle& _rPlayground)\n{\n m_pScrollWindow->SetPosSizePixel( _rPlayground.TopLeft(), _rPlayground.GetSize() );\n\n \/\/ just for completeness: there is no space left, we occupied it all ...\n _rPlayground.SetPos( _rPlayground.BottomRight() );\n _rPlayground.SetSize( Size( 0, 0 ) );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::setReadOnly(sal_Bool \/*_bReadOnly*\/)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::TableDeleted(const ::rtl::OUString& \/*rAliasName*\/)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::zoomTableView(const Fraction& _rFraction)\n{\n m_pTableView->SetZoom(_rFraction);\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::SaveUIConfig()\n{\n OJoinController* pCtrl = getController();\n if (pCtrl)\n pCtrl->SaveTabWinsPosSize( m_pTableView->GetTabWinMap(), m_pScrollWindow->GetHScrollBar()->GetThumbPos(), m_pScrollWindow->GetVScrollBar()->GetThumbPos() );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::SaveTabWinUIConfig(OTableWindow* pWin)\n{\n getController()->SaveTabWinPosSize(pWin, m_pScrollWindow->GetHScrollBar()->GetThumbPos(), m_pScrollWindow->GetVScrollBar()->GetThumbPos());\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::KeyInput( const KeyEvent& rEvt )\n{\n if ( m_pTableView && m_pTableView->IsVisible() )\n m_pTableView->KeyInput( rEvt );\n else\n ODataView::KeyInput(rEvt);\n}\n\/\/ -----------------------------------------------------------------------------\n<commit_msg>INTEGRATION: CWS qiq (1.17.118); FILE MERGED 2006\/06\/28 10:31:11 fs 1.17.118.4: #i10000# 2006\/06\/27 12:51:59 fs 1.17.118.3: RESYNC: (1.17-1.18); FILE MERGED 2006\/05\/17 11:45:29 fs 1.17.118.2: #i51143# AddTableDialog is now in the responsibility of the controller, not the view (allows late construction as needed) 2006\/05\/12 11:11:02 fs 1.17.118.1: #i51143# callback from the AddTabDialog now via dedicated interface<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: JoinDesignView.cxx,v $\n *\n * $Revision: 1.19 $\n *\n * last change: $Author: obo $ $Date: 2006-07-10 15:40:20 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef DBAUI_JOINDESIGNVIEW_HXX\n#include \"JoinDesignView.hxx\"\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n#ifndef DBAUI_JOINCONTROLLER_HXX\n#include \"JoinController.hxx\"\n#endif\n#ifndef _UNDO_HXX\n#include <svtools\/undo.hxx>\n#endif\n#ifndef DBAUI_QYDLGTAB_HXX\n#include \"adtabdlg.hxx\"\n#endif\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n#ifndef DBACCESS_UI_BROWSER_ID_HXX\n#include \"browserids.hxx\"\n#endif\n#ifndef _DBU_QRY_HRC_\n#include \"dbu_qry.hrc\"\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _CONNECTIVITY_DBTOOLS_HXX_\n#include <connectivity\/dbtools.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_DATATYPE_HPP_\n#include <com\/sun\/star\/sdbc\/DataType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef DBAUI_TABLECONNECTION_HXX\n#include \"TableConnection.hxx\"\n#endif\n#ifndef DBAUI_CONNECTIONLINE_HXX\n#include \"ConnectionLine.hxx\"\n#endif\n#ifndef DBAUI_CONNECTIONLINEDATA_HXX\n#include \"ConnectionLineData.hxx\"\n#endif\n#ifndef DBAUI_TABLECONNECTIONDATA_HXX\n#include \"TableConnectionData.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.hxx>\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n#ifndef DBAUI_JOINTABLEVIEW_HXX\n#include \"JoinTableView.hxx\"\n#endif\n\/\/ #include <com\/sun\/star\/util\/URL.hdl>\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::i18n;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::util;\n\nnamespace dbaui\n{\n\n\/\/ =============================================================================\n\/\/ = OJoinDesignView\n\/\/ =============================================================================\n\/\/ -----------------------------------------------------------------------------\nOJoinDesignView::OJoinDesignView(Window* _pParent, OJoinController* _pController,const Reference< XMultiServiceFactory >& _rFactory)\n :ODataView(_pParent,_pController,_rFactory)\n ,m_pTableView(NULL)\n ,m_pController(_pController)\n{\n m_pScrollWindow = new OScrollWindowHelper(this);\n}\n\/\/ -----------------------------------------------------------------------------\nOJoinDesignView::~OJoinDesignView()\n{\n ::std::auto_ptr<Window> aT3(m_pScrollWindow);\n m_pScrollWindow = NULL;\n ::std::auto_ptr<Window> aT2(m_pTableView);\n m_pTableView = NULL;\n}\n\/\/ -------------------------------------------------------------------------\nvoid OJoinDesignView::Construct()\n{\n m_pScrollWindow->setTableView(m_pTableView);\n m_pScrollWindow->Show();\n m_pTableView->Show();\n\n SetBackground( Wallpaper( Application::GetSettings().GetStyleSettings().GetFaceColor()) );\n\n ODataView::Construct();\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::initialize()\n{\n \/\/ getAddTableDialog()->Update();\n}\n\/\/ -------------------------------------------------------------------------\nvoid OJoinDesignView::resizeDocumentView(Rectangle& _rPlayground)\n{\n m_pScrollWindow->SetPosSizePixel( _rPlayground.TopLeft(), _rPlayground.GetSize() );\n\n \/\/ just for completeness: there is no space left, we occupied it all ...\n _rPlayground.SetPos( _rPlayground.BottomRight() );\n _rPlayground.SetSize( Size( 0, 0 ) );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::setReadOnly(sal_Bool \/*_bReadOnly*\/)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::TableDeleted(const ::rtl::OUString& \/*rAliasName*\/)\n{\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::zoomTableView(const Fraction& _rFraction)\n{\n m_pTableView->SetZoom(_rFraction);\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::SaveUIConfig()\n{\n OJoinController* pCtrl = getController();\n if (pCtrl)\n pCtrl->SaveTabWinsPosSize( m_pTableView->GetTabWinMap(), m_pScrollWindow->GetHScrollBar()->GetThumbPos(), m_pScrollWindow->GetVScrollBar()->GetThumbPos() );\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::SaveTabWinUIConfig(OTableWindow* pWin)\n{\n getController()->SaveTabWinPosSize(pWin, m_pScrollWindow->GetHScrollBar()->GetThumbPos(), m_pScrollWindow->GetVScrollBar()->GetThumbPos());\n}\n\/\/ -----------------------------------------------------------------------------\nvoid OJoinDesignView::KeyInput( const KeyEvent& rEvt )\n{\n if ( m_pTableView && m_pTableView->IsVisible() )\n m_pTableView->KeyInput( rEvt );\n else\n ODataView::KeyInput(rEvt);\n}\n\/\/ -----------------------------------------------------------------------------\n\n} \/\/ namespace dbaui\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Music.hpp\"\n\n\/\/#include <Plinth\/Generic.hpp>\n\nMusic::Music():\nm_track(Track::Ready),\nm_pMusic(&m_ready),\nm_isDimmed(false)\n{\n\tconst std::string resourcePath = \"resources\/\";\n\tif (!m_ready.openFromFile(resourcePath + \"puzza-ready.ogg\") ||\n\t\t!m_play.openFromFile(resourcePath + \"puzza-play.ogg\"))\n\t\tthrow(\"Could not find music.\");\n\n\tm_ready.setLoop(true);\n\tm_play.setLoop(true);\n}\n\nvoid Music::play(Track track)\n{\n\tm_track = track;\n\tm_pMusic->stop();\n\tswitch (m_track)\n\t{\n\tcase Track::Play:\n\t\tm_pMusic = &m_play;\n\t\tbreak;\n\tcase Track::Ready:\n\tdefault:\n\t\tm_pMusic = &m_ready;\n\t}\n\tm_pMusic->setVolume(0.f);\n\tm_pMusic->play();\n\tm_timer.restart();\n}\n\nvoid Music::update()\n{\n\tconst kairos::Duration fadeInLength(2.0); \/\/ in seconds\n\tfloat volume = 100.f;\n\tif (m_timer.getTime() < fadeInLength)\n\t\tvolume = static_cast<float>((m_timer.getTime().asSeconds() \/ fadeInLength.asSeconds()) * 100.0);\n\tif (m_isDimmed)\n\t\tvolume \/= 2.f;\n\tm_pMusic->setVolume(volume);\n}\n\nvoid Music::dim()\n{\n\tm_isDimmed = true;\n}\n\nvoid Music::undim()\n{\n\tm_isDimmed = false;\n}\n<commit_msg>add music permission info<commit_after>#include \"Music.hpp\"\n\n\/\/#include <Plinth\/Generic.hpp>\n\nMusic::Music():\nm_track(Track::Ready),\nm_pMusic(&m_ready),\nm_isDimmed(false)\n{\n\tconst std::string resourcePath = \"resources\/\";\n\t\/\/ music used with permission by Hapax Perplexia (https:\/\/soundcloud.com\/hapaxperplexia\/puzza-soundtrack)\n\tif (!m_ready.openFromFile(resourcePath + \"puzza-ready.ogg\") ||\n\t\t!m_play.openFromFile(resourcePath + \"puzza-play.ogg\"))\n\t\tthrow(\"Could not find music.\");\n\n\tm_ready.setLoop(true);\n\tm_play.setLoop(true);\n}\n\nvoid Music::play(Track track)\n{\n\tm_track = track;\n\tm_pMusic->stop();\n\tswitch (m_track)\n\t{\n\tcase Track::Play:\n\t\tm_pMusic = &m_play;\n\t\tbreak;\n\tcase Track::Ready:\n\tdefault:\n\t\tm_pMusic = &m_ready;\n\t}\n\tm_pMusic->setVolume(0.f);\n\tm_pMusic->play();\n\tm_timer.restart();\n}\n\nvoid Music::update()\n{\n\tconst kairos::Duration fadeInLength(2.0); \/\/ in seconds\n\tfloat volume = 100.f;\n\tif (m_timer.getTime() < fadeInLength)\n\t\tvolume = static_cast<float>((m_timer.getTime().asSeconds() \/ fadeInLength.asSeconds()) * 100.0);\n\tif (m_isDimmed)\n\t\tvolume \/= 2.f;\n\tm_pMusic->setVolume(volume);\n}\n\nvoid Music::dim()\n{\n\tm_isDimmed = true;\n}\n\nvoid Music::undim()\n{\n\tm_isDimmed = false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"matchstick.h\"\n#include \"types.h\"\n#include \"compile.h\"\n#include \"compile_consts.h\"\n\nnamespace _matchstick_compile {\n\n FSM_MATCH * const pick_special_match(MS_CHAR **cursor) {\n FSM_MATCH *match = NULL;\n MS_CHAR *pos;\n if ((pos = wcsrchr(SPECIAL_MATCH, **cursor))) {\n match = new FSM_MATCH_BASIC(SPECIAL_MATCH_TYPE[pos - SPECIAL_MATCH]);\n ++*cursor;\n }\n return match;\n }\n\n FSM_MATCH * const pick_special_slash_match(MS_CHAR **cursor, int in_charset) {\n FSM_MATCH *match = NULL;\n MS_CHAR *pos;\n MS_CHAR *temp_cursor = *cursor;\n if (**cursor == '\\\\') {\n ++temp_cursor;\n if (!(*temp_cursor == 'b' && in_charset) && (pos = wcsrchr(SPECIAL_SLASH_MATCH, **cursor))) {\n match = new FSM_MATCH_BASIC(SPECIAL_SLASH_MATCH_TYPE[pos - SPECIAL_SLASH_MATCH]);\n ++temp_cursor;\n *cursor = temp_cursor;\n }\n }\n return match;\n }\n\n const MS_CHAR pick_escaped_char(MS_CHAR **cursor, int in_charset) {\n MS_CHAR *pos;\n MS_CHAR *temp_cursor = *cursor;\n if (**cursor == '\\\\') {\n ++temp_cursor;\n if (!(*temp_cursor == 'b' && !in_charset) && (pos = wcsrchr(ESCAPE, **cursor))) {\n ++temp_cursor;\n *cursor = temp_cursor;\n return ESCAPE_DECODED[pos - ESCAPE];\n } else {\n return (MS_CHAR) 0;\n }\n } else {\n return (MS_CHAR) 0;\n }\n }\n\n const MS_CHAR pick_char(MS_CHAR **cursor, int in_charset) {\n MS_CHAR *pos;\n if (in_charset) {\n pos = wcsrchr(INVALID_CHAR_CHARSET, **cursor);\n } else {\n pos = wcsrchr(INVALID_CHAR_N_CHARSET, **cursor);\n }\n if (pos) {\n return (MS_CHAR) 0;\n } else {\n MS_CHAR ret;\n MS_CHAR *temp_cursor = *cursor;\n ret = pick_escaped_char(&temp_cursor, in_charset);\n if (temp_cursor == *cursor) {\n ++*cursor;\n return *temp_cursor;\n } else {\n *cursor = temp_cursor;\n return ret;\n }\n }\n }\n\n MS_CHAR * const pick_string(MS_CHAR **cursor) {\n MS_CHARS *chars = NULL;\n MS_CHARS *chars_cursor = NULL;\n unsigned int length = 0;\n MS_CHAR picked_char;\n MS_CHAR *temp_cursor = *cursor;\n do {\n *cursor = temp_cursor;\n picked_char = pick_char(&temp_cursor, 0);\n if (temp_cursor != *cursor) {\n if (chars_cursor) {\n chars_cursor->next = new MS_CHARS(picked_char);\n chars_cursor = chars_cursor->next;\n } else {\n chars_cursor = new MS_CHARS(picked_char);\n chars = chars_cursor;\n }\n ++length;\n }\n } while (temp_cursor != *cursor);\n if (chars) {\n MS_CHAR * str = new MS_CHAR[length + 1];\n for (int i = 0; i < length; ++i) {\n str[i] = chars -> value;\n chars = chars -> next;\n }\n str[length] = '\\0';\n return str;\n } else {\n return NULL;\n }\n }\n\n FSM_MATCH * const pick_range_match(MS_CHAR **cursor) {\n MS_CHAR * temp_cursor = *cursor;\n MS_CHAR min = pick_char(&temp_cursor, 1);\n MS_CHAR max;\n if (temp_cursor == *cursor || *temp_cursor != '-' || *temp_cursor == ']') {\n return NULL;\n } else {\n \/\/ to avoid CLion from thinking temp_cursor == temp_cursor2 to be always true\n MS_CHAR * temp_cursor2 = temp_cursor + 1;\n ++temp_cursor;\n if (*temp_cursor == ']') {\n return NULL;\n } else {\n max = pick_char(&temp_cursor2, 1);\n if (temp_cursor == temp_cursor2) {\n return NULL;\n } else {\n *cursor = temp_cursor2;\n FSM_MATCH_RANGE *match = new FSM_MATCH_RANGE(min, max);\n return static_cast<FSM_MATCH *> (match);\n }\n }\n }\n }\n\n \/\/ assumed to be in charset\n FSM_MATCH * const pick_char_match(MS_CHAR **cursor) {\n MS_CHAR * temp_cursor = *cursor;\n MS_CHAR c = pick_char(&temp_cursor, 1);\n if (temp_cursor == *cursor) {\n return NULL;\n } else {\n FSM_MATCH_EXACT * match = new FSM_MATCH_EXACT(c);\n return static_cast<FSM_MATCH *> (match);\n }\n }\n\n FSM_RULE * const pick_charset(MS_CHAR **cursor) {\n FSM_RULE_TYPE rule_type;\n FSM_RULE_BASIC * rule;\n FSM_MATCH * first_match = NULL;\n FSM_MATCH * match_cursor = NULL;\n if (**cursor != '[') {\n return NULL;\n } else {\n ++*cursor;\n if (**cursor == '^') {\n ++*cursor;\n rule_type = FSM_RULE_TYPE_EXCLUDE;\n } else {\n rule_type = FSM_RULE_TYPE_INCLUDE;\n }\n MS_CHAR * temp_cursor;\n FSM_MATCH * match;\n while (**cursor != ']') {\n match = NULL;\n temp_cursor = *cursor;\n if (temp_cursor == *cursor) {\n match = pick_range_match(cursor);\n }\n if (temp_cursor == *cursor) {\n match = pick_char_match(cursor);\n }\n if (!match) {\n if (first_match) {\n delete first_match;\n }\n return NULL;\n } else {\n if (match_cursor) {\n match_cursor->next_match = match;\n match_cursor = match_cursor->next_match;\n } else {\n match_cursor = match;\n first_match = match;\n }\n }\n }\n if (first_match) {\n rule = new FSM_RULE_BASIC(rule_type, first_match);\n return static_cast<FSM_RULE *> (rule);\n } else {\n return NULL;\n }\n }\n }\n unsigned int pick_number(MS_CHAR **cursor) {\n if (**cursor < '0' || **cursor > '9') {\n return INVALID_NUM;\n } else {\n unsigned int num = 0;\n while (**cursor >= '0' && **cursor <= '9') {\n num *= 10;\n num += **cursor - '0';\n ++*cursor;\n }\n return num;\n }\n }\n using namespace _matchstick;\n\n}\n<commit_msg>implement pick_counter_mode<commit_after>#include \"matchstick.h\"\n#include \"types.h\"\n#include \"compile.h\"\n#include \"compile_consts.h\"\n\nnamespace _matchstick_compile {\n\n FSM_MATCH * const pick_special_match(MS_CHAR **cursor) {\n FSM_MATCH *match = NULL;\n MS_CHAR *pos;\n if ((pos = wcsrchr(SPECIAL_MATCH, **cursor))) {\n match = new FSM_MATCH_BASIC(SPECIAL_MATCH_TYPE[pos - SPECIAL_MATCH]);\n ++*cursor;\n }\n return match;\n }\n\n FSM_MATCH * const pick_special_slash_match(MS_CHAR **cursor, int in_charset) {\n FSM_MATCH *match = NULL;\n MS_CHAR *pos;\n MS_CHAR *temp_cursor = *cursor;\n if (**cursor == '\\\\') {\n ++temp_cursor;\n if (!(*temp_cursor == 'b' && in_charset) && (pos = wcsrchr(SPECIAL_SLASH_MATCH, **cursor))) {\n match = new FSM_MATCH_BASIC(SPECIAL_SLASH_MATCH_TYPE[pos - SPECIAL_SLASH_MATCH]);\n ++temp_cursor;\n *cursor = temp_cursor;\n }\n }\n return match;\n }\n\n const MS_CHAR pick_escaped_char(MS_CHAR **cursor, int in_charset) {\n MS_CHAR *pos;\n MS_CHAR *temp_cursor = *cursor;\n if (**cursor == '\\\\') {\n ++temp_cursor;\n if (!(*temp_cursor == 'b' && !in_charset) && (pos = wcsrchr(ESCAPE, **cursor))) {\n ++temp_cursor;\n *cursor = temp_cursor;\n return ESCAPE_DECODED[pos - ESCAPE];\n } else {\n return (MS_CHAR) 0;\n }\n } else {\n return (MS_CHAR) 0;\n }\n }\n\n const MS_CHAR pick_char(MS_CHAR **cursor, int in_charset) {\n MS_CHAR *pos;\n if (in_charset) {\n pos = wcsrchr(INVALID_CHAR_CHARSET, **cursor);\n } else {\n pos = wcsrchr(INVALID_CHAR_N_CHARSET, **cursor);\n }\n if (pos) {\n return (MS_CHAR) 0;\n } else {\n MS_CHAR ret;\n MS_CHAR *temp_cursor = *cursor;\n ret = pick_escaped_char(&temp_cursor, in_charset);\n if (temp_cursor == *cursor) {\n ++*cursor;\n return *temp_cursor;\n } else {\n *cursor = temp_cursor;\n return ret;\n }\n }\n }\n\n MS_CHAR * const pick_string(MS_CHAR **cursor) {\n MS_CHARS *chars = NULL;\n MS_CHARS *chars_cursor = NULL;\n unsigned int length = 0;\n MS_CHAR picked_char;\n MS_CHAR *temp_cursor = *cursor;\n do {\n *cursor = temp_cursor;\n picked_char = pick_char(&temp_cursor, 0);\n if (temp_cursor != *cursor) {\n if (chars_cursor) {\n chars_cursor->next = new MS_CHARS(picked_char);\n chars_cursor = chars_cursor->next;\n } else {\n chars_cursor = new MS_CHARS(picked_char);\n chars = chars_cursor;\n }\n ++length;\n }\n } while (temp_cursor != *cursor);\n if (chars) {\n MS_CHAR * str = new MS_CHAR[length + 1];\n for (int i = 0; i < length; ++i) {\n str[i] = chars -> value;\n chars = chars -> next;\n }\n str[length] = '\\0';\n return str;\n } else {\n return NULL;\n }\n }\n\n FSM_MATCH * const pick_range_match(MS_CHAR **cursor) {\n MS_CHAR * temp_cursor = *cursor;\n MS_CHAR min = pick_char(&temp_cursor, 1);\n MS_CHAR max;\n if (temp_cursor == *cursor || *temp_cursor != '-' || *temp_cursor == ']') {\n return NULL;\n } else {\n \/\/ to avoid CLion from thinking temp_cursor == temp_cursor2 to be always true\n MS_CHAR * temp_cursor2 = temp_cursor + 1;\n ++temp_cursor;\n if (*temp_cursor == ']') {\n return NULL;\n } else {\n max = pick_char(&temp_cursor2, 1);\n if (temp_cursor == temp_cursor2) {\n return NULL;\n } else {\n *cursor = temp_cursor2;\n FSM_MATCH_RANGE *match = new FSM_MATCH_RANGE(min, max);\n return static_cast<FSM_MATCH *> (match);\n }\n }\n }\n }\n\n \/\/ assumed to be in charset\n FSM_MATCH * const pick_char_match(MS_CHAR **cursor) {\n MS_CHAR * temp_cursor = *cursor;\n MS_CHAR c = pick_char(&temp_cursor, 1);\n if (temp_cursor == *cursor) {\n return NULL;\n } else {\n FSM_MATCH_EXACT * match = new FSM_MATCH_EXACT(c);\n return static_cast<FSM_MATCH *> (match);\n }\n }\n\n FSM_RULE * const pick_charset(MS_CHAR **cursor) {\n FSM_RULE_TYPE rule_type;\n FSM_RULE_BASIC * rule;\n FSM_MATCH * first_match = NULL;\n FSM_MATCH * match_cursor = NULL;\n if (**cursor != '[') {\n return NULL;\n } else {\n ++*cursor;\n if (**cursor == '^') {\n ++*cursor;\n rule_type = FSM_RULE_TYPE_EXCLUDE;\n } else {\n rule_type = FSM_RULE_TYPE_INCLUDE;\n }\n MS_CHAR * temp_cursor;\n FSM_MATCH * match;\n while (**cursor != ']') {\n match = NULL;\n temp_cursor = *cursor;\n if (temp_cursor == *cursor) {\n match = pick_range_match(cursor);\n }\n if (temp_cursor == *cursor) {\n match = pick_char_match(cursor);\n }\n if (!match) {\n if (first_match) {\n delete first_match;\n }\n return NULL;\n } else {\n if (match_cursor) {\n match_cursor->next_match = match;\n match_cursor = match_cursor->next_match;\n } else {\n match_cursor = match;\n first_match = match;\n }\n }\n }\n if (first_match) {\n rule = new FSM_RULE_BASIC(rule_type, first_match);\n return static_cast<FSM_RULE *> (rule);\n } else {\n return NULL;\n }\n }\n }\n unsigned int pick_number(MS_CHAR **cursor) {\n if (**cursor < '0' || **cursor > '9') {\n return INVALID_NUM;\n } else {\n unsigned int num = 0;\n while (**cursor >= '0' && **cursor <= '9') {\n num *= 10;\n num += **cursor - '0';\n ++*cursor;\n }\n return num;\n }\n }\n\n enum FSM_COUNTER_MODE pick_counter_mode(MS_CHAR **cursor) {\n switch (**cursor) {\n case '?':\n ++*cursor;\n return FSM_COUNTER_MODE_RELUCTANT;\n break;\n case '+':\n ++*cursor;\n return FSM_COUNTER_MODE_POSSESSIVE;\n break;\n default:\n return FSM_COUNTER_MODE_GREEDY;\n }\n }\n using namespace _matchstick;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <tools\/string.hxx>\n\nstruct hw_pair\n{\n sal_Unicode nFrom;\n sal_Unicode nTo;\n};\n\n#define MAKE_PAIR(a,b) { a, b }\n\nstatic struct hw_pair aHWPairs[] =\n{\n MAKE_PAIR( 0xFF65, 0x30FB ), \/\/ HALFWIDTH KATAKANA MIDDLE DOT --> KATAKANA MIDDLE DOT\n MAKE_PAIR( 0xFF66, 0x30F2 ), \/\/ HALFWIDTH KATAKANA LETTER WO --> KATAKANA LETTER WO\n MAKE_PAIR( 0xFF67, 0x30A1 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL A --> KATAKANA LETTER SMALL A\n MAKE_PAIR( 0xFF68, 0x30A3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL I --> KATAKANA LETTER SMALL I\n MAKE_PAIR( 0xFF69, 0x30A5 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL U --> KATAKANA LETTER SMALL U\n MAKE_PAIR( 0xFF6A, 0x30A7 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL E --> KATAKANA LETTER SMALL E\n MAKE_PAIR( 0xFF6B, 0x30A9 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL O --> KATAKANA LETTER SMALL O\n MAKE_PAIR( 0xFF6C, 0x30E3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YA --> KATAKANA LETTER SMALL YA\n MAKE_PAIR( 0xFF6D, 0x30E5 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YU --> KATAKANA LETTER SMALL YU\n MAKE_PAIR( 0xFF6E, 0x30E7 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YO --> KATAKANA LETTER SMALL YO\n MAKE_PAIR( 0xFF6F, 0x30C3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL TU --> KATAKANA LETTER SMALL TU\n MAKE_PAIR( 0xFF70, 0x30FC ), \/\/ HALFWIDTH KATAKANA-HIRAGANA PROLONGED SOUND MARK --> KATAKANA-HIRAGANA PROLONGED SOUND MARK\n MAKE_PAIR( 0xFF71, 0x30A2 ), \/\/ HALFWIDTH KATAKANA LETTER A --> KATAKANA LETTER A\n MAKE_PAIR( 0xFF72, 0x30A4 ), \/\/ HALFWIDTH KATAKANA LETTER I --> KATAKANA LETTER I\n MAKE_PAIR( 0xFF73, 0x30A6 ), \/\/ HALFWIDTH KATAKANA LETTER U --> KATAKANA LETTER U\n MAKE_PAIR( 0xFF74, 0x30A8 ), \/\/ HALFWIDTH KATAKANA LETTER E --> KATAKANA LETTER E\n MAKE_PAIR( 0xFF75, 0x30AA ), \/\/ HALFWIDTH KATAKANA LETTER O --> KATAKANA LETTER O\n MAKE_PAIR( 0xFF76, 0x30AB ), \/\/ HALFWIDTH KATAKANA LETTER KA --> KATAKANA LETTER KA\n MAKE_PAIR( 0xFF77, 0x30AD ), \/\/ HALFWIDTH KATAKANA LETTER KI --> KATAKANA LETTER KI\n MAKE_PAIR( 0xFF78, 0x30AF ), \/\/ HALFWIDTH KATAKANA LETTER KU --> KATAKANA LETTER KU\n MAKE_PAIR( 0xFF79, 0x30B1 ), \/\/ HALFWIDTH KATAKANA LETTER KE --> KATAKANA LETTER KE\n MAKE_PAIR( 0xFF7A, 0x30B3 ), \/\/ HALFWIDTH KATAKANA LETTER KO --> KATAKANA LETTER KO\n MAKE_PAIR( 0xFF7B, 0x30B5 ), \/\/ HALFWIDTH KATAKANA LETTER SA --> KATAKANA LETTER SA\n MAKE_PAIR( 0xFF7C, 0x30B7 ), \/\/ HALFWIDTH KATAKANA LETTER SI --> KATAKANA LETTER SI\n MAKE_PAIR( 0xFF7D, 0x30B9 ), \/\/ HALFWIDTH KATAKANA LETTER SU --> KATAKANA LETTER SU\n MAKE_PAIR( 0xFF7E, 0x30BB ), \/\/ HALFWIDTH KATAKANA LETTER SE --> KATAKANA LETTER SE\n MAKE_PAIR( 0xFF7F, 0x30BD ), \/\/ HALFWIDTH KATAKANA LETTER SO --> KATAKANA LETTER SO\n MAKE_PAIR( 0xFF80, 0x30BF ), \/\/ HALFWIDTH KATAKANA LETTER TA --> KATAKANA LETTER TA\n MAKE_PAIR( 0xFF81, 0x30C1 ), \/\/ HALFWIDTH KATAKANA LETTER TI --> KATAKANA LETTER TI\n MAKE_PAIR( 0xFF82, 0x30C4 ), \/\/ HALFWIDTH KATAKANA LETTER TU --> KATAKANA LETTER TU\n MAKE_PAIR( 0xFF83, 0x30C6 ), \/\/ HALFWIDTH KATAKANA LETTER TE --> KATAKANA LETTER TE\n MAKE_PAIR( 0xFF84, 0x30C8 ), \/\/ HALFWIDTH KATAKANA LETTER TO --> KATAKANA LETTER TO\n MAKE_PAIR( 0xFF85, 0x30CA ), \/\/ HALFWIDTH KATAKANA LETTER NA --> KATAKANA LETTER NA\n MAKE_PAIR( 0xFF86, 0x30CB ), \/\/ HALFWIDTH KATAKANA LETTER NI --> KATAKANA LETTER NI\n MAKE_PAIR( 0xFF87, 0x30CC ), \/\/ HALFWIDTH KATAKANA LETTER NU --> KATAKANA LETTER NU\n MAKE_PAIR( 0xFF88, 0x30CD ), \/\/ HALFWIDTH KATAKANA LETTER NE --> KATAKANA LETTER NE\n MAKE_PAIR( 0xFF89, 0x30CE ), \/\/ HALFWIDTH KATAKANA LETTER NO --> KATAKANA LETTER NO\n MAKE_PAIR( 0xFF8A, 0x30CF ), \/\/ HALFWIDTH KATAKANA LETTER HA --> KATAKANA LETTER HA\n MAKE_PAIR( 0xFF8B, 0x30D2 ), \/\/ HALFWIDTH KATAKANA LETTER HI --> KATAKANA LETTER HI\n MAKE_PAIR( 0xFF8C, 0x30D5 ), \/\/ HALFWIDTH KATAKANA LETTER HU --> KATAKANA LETTER HU\n MAKE_PAIR( 0xFF8D, 0x30D8 ), \/\/ HALFWIDTH KATAKANA LETTER HE --> KATAKANA LETTER HE\n MAKE_PAIR( 0xFF8E, 0x30DB ), \/\/ HALFWIDTH KATAKANA LETTER HO --> KATAKANA LETTER HO\n MAKE_PAIR( 0xFF8F, 0x30DE ), \/\/ HALFWIDTH KATAKANA LETTER MA --> KATAKANA LETTER MA\n MAKE_PAIR( 0xFF90, 0x30DF ), \/\/ HALFWIDTH KATAKANA LETTER MI --> KATAKANA LETTER MI\n MAKE_PAIR( 0xFF91, 0x30E0 ), \/\/ HALFWIDTH KATAKANA LETTER MU --> KATAKANA LETTER MU\n MAKE_PAIR( 0xFF92, 0x30E1 ), \/\/ HALFWIDTH KATAKANA LETTER ME --> KATAKANA LETTER ME\n MAKE_PAIR( 0xFF93, 0x30E2 ), \/\/ HALFWIDTH KATAKANA LETTER MO --> KATAKANA LETTER MO\n MAKE_PAIR( 0xFF94, 0x30E4 ), \/\/ HALFWIDTH KATAKANA LETTER YA --> KATAKANA LETTER YA\n MAKE_PAIR( 0xFF95, 0x30E6 ), \/\/ HALFWIDTH KATAKANA LETTER YU --> KATAKANA LETTER YU\n MAKE_PAIR( 0xFF96, 0x30E8 ), \/\/ HALFWIDTH KATAKANA LETTER YO --> KATAKANA LETTER YO\n MAKE_PAIR( 0xFF97, 0x30E9 ), \/\/ HALFWIDTH KATAKANA LETTER RA --> KATAKANA LETTER RA\n MAKE_PAIR( 0xFF98, 0x30EA ), \/\/ HALFWIDTH KATAKANA LETTER RI --> KATAKANA LETTER RI\n MAKE_PAIR( 0xFF99, 0x30EB ), \/\/ HALFWIDTH KATAKANA LETTER RU --> KATAKANA LETTER RU\n MAKE_PAIR( 0xFF9A, 0x30EC ), \/\/ HALFWIDTH KATAKANA LETTER RE --> KATAKANA LETTER RE\n MAKE_PAIR( 0xFF9B, 0x30ED ), \/\/ HALFWIDTH KATAKANA LETTER RO --> KATAKANA LETTER RO\n MAKE_PAIR( 0xFF9C, 0x30EF ), \/\/ HALFWIDTH KATAKANA LETTER WA --> KATAKANA LETTER WA\n MAKE_PAIR( 0xFF9D, 0x30F3 ), \/\/ HALFWIDTH KATAKANA LETTER N --> KATAKANA LETTER N\n MAKE_PAIR( 0xFF9E, 0x3099 ), \/\/ HALFWIDTH KATAKANA VOICED SOUND MARK --> COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK\n MAKE_PAIR( 0xFF9F, 0x309A ) \/\/ HALFWIDTH KATAKANA SEMI-VOICED SOUND MARK --> COMBINING KATAKANA-\n};\n\n\nstatic struct hw_pair aCombine3099[] =\n{\n { 0x30a6, 0x30f4 },\n { 0x30ab, 0x30ac },\n { 0x30ad, 0x30ae },\n { 0x30af, 0x30b0 },\n { 0x30b1, 0x30b2 },\n { 0x30b3, 0x30b4 },\n { 0x30b5, 0x30b6 },\n { 0x30b7, 0x30b8 },\n { 0x30b9, 0x30ba },\n { 0x30bb, 0x30bc },\n { 0x30bd, 0x30be },\n { 0x30bf, 0x30c0 },\n { 0x30c1, 0x30c2 },\n { 0x30c4, 0x30c5 },\n { 0x30c6, 0x30c7 },\n { 0x30c8, 0x30c9 },\n { 0x30cf, 0x30d0 },\n { 0x30d2, 0x30d3 },\n { 0x30d5, 0x30d6 },\n { 0x30d8, 0x30d9 },\n { 0x30db, 0x30dc },\n { 0x30ef, 0x30f7 },\n { 0x30f0, 0x30f8 },\n { 0x30f1, 0x30f9 },\n { 0x30f2, 0x30fa },\n { 0x30fd, 0x30fe }\n};\n\nstatic struct hw_pair aCombine309A[] =\n{\n { 0x30cf, 0x30d1 },\n { 0x30d2, 0x30d4 },\n { 0x30d5, 0x30d7 },\n { 0x30d8, 0x30da },\n { 0x30db, 0x30dd }\n};\n\nint ImplReplaceFullWidth( sal_Unicode* pString, int nLen )\n{\n sal_Unicode* pRead = pString;\n sal_Unicode* pWrite = pRead;\n int nNewLen = nLen;\n\n while( (pRead - pString) < nLen )\n {\n if( pWrite != pRead )\n *pWrite = *pRead;\n\n if( *pRead >= 0xff65 && *pRead <= 0xff9f )\n {\n *pWrite = aHWPairs[ *pRead - 0xff65 ].nTo;\n\n struct hw_pair* pTable = NULL;\n int nTableEntries = 0;\n if( *pWrite == 0x3099 )\n {\n \/\/ replace 0x3099 combinations\n pTable = aCombine3099;\n nTableEntries = sizeof(aCombine3099)\/sizeof(aCombine3099[0]);\n }\n else if( *pWrite == 0x309a )\n {\n \/\/ replace 0x309a combinations\n pTable = aCombine309A;\n nTableEntries = sizeof(aCombine309A)\/sizeof(aCombine309A[0]);\n }\n if( pTable )\n {\n sal_Unicode c = pWrite[-1];\n for( int i = 0; i < nTableEntries; i++ )\n if( c == pTable[i].nFrom )\n {\n pWrite--;\n *pWrite = pTable[i].nTo;\n nNewLen--;\n break;\n }\n }\n }\n pRead++;\n pWrite++;\n }\n if( pWrite < pRead )\n *pWrite = 0;\n\n return nNewLen;\n}\n\nvoid ConvertHalfwitdhToFullwidth( String& rString )\n{\n int nNewLen = ImplReplaceFullWidth( rString.GetBufferAccess(), rString.Len() );\n rString.ReleaseBufferAccess( nNewLen );\n}\n<commit_msg>INTEGRATION: CWS warnings01 (1.1.252); FILE MERGED 2006\/03\/09 19:26:52 ihi 1.1.252.1: #i57362# Warning free wntmsci10<commit_after>#include <tools\/string.hxx>\n\nstruct hw_pair\n{\n sal_Unicode nFrom;\n sal_Unicode nTo;\n};\n\n#define MAKE_PAIR(a,b) { a, b }\n\nstatic struct hw_pair aHWPairs[] =\n{\n MAKE_PAIR( 0xFF65, 0x30FB ), \/\/ HALFWIDTH KATAKANA MIDDLE DOT --> KATAKANA MIDDLE DOT\n MAKE_PAIR( 0xFF66, 0x30F2 ), \/\/ HALFWIDTH KATAKANA LETTER WO --> KATAKANA LETTER WO\n MAKE_PAIR( 0xFF67, 0x30A1 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL A --> KATAKANA LETTER SMALL A\n MAKE_PAIR( 0xFF68, 0x30A3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL I --> KATAKANA LETTER SMALL I\n MAKE_PAIR( 0xFF69, 0x30A5 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL U --> KATAKANA LETTER SMALL U\n MAKE_PAIR( 0xFF6A, 0x30A7 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL E --> KATAKANA LETTER SMALL E\n MAKE_PAIR( 0xFF6B, 0x30A9 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL O --> KATAKANA LETTER SMALL O\n MAKE_PAIR( 0xFF6C, 0x30E3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YA --> KATAKANA LETTER SMALL YA\n MAKE_PAIR( 0xFF6D, 0x30E5 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YU --> KATAKANA LETTER SMALL YU\n MAKE_PAIR( 0xFF6E, 0x30E7 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL YO --> KATAKANA LETTER SMALL YO\n MAKE_PAIR( 0xFF6F, 0x30C3 ), \/\/ HALFWIDTH KATAKANA LETTER SMALL TU --> KATAKANA LETTER SMALL TU\n MAKE_PAIR( 0xFF70, 0x30FC ), \/\/ HALFWIDTH KATAKANA-HIRAGANA PROLONGED SOUND MARK --> KATAKANA-HIRAGANA PROLONGED SOUND MARK\n MAKE_PAIR( 0xFF71, 0x30A2 ), \/\/ HALFWIDTH KATAKANA LETTER A --> KATAKANA LETTER A\n MAKE_PAIR( 0xFF72, 0x30A4 ), \/\/ HALFWIDTH KATAKANA LETTER I --> KATAKANA LETTER I\n MAKE_PAIR( 0xFF73, 0x30A6 ), \/\/ HALFWIDTH KATAKANA LETTER U --> KATAKANA LETTER U\n MAKE_PAIR( 0xFF74, 0x30A8 ), \/\/ HALFWIDTH KATAKANA LETTER E --> KATAKANA LETTER E\n MAKE_PAIR( 0xFF75, 0x30AA ), \/\/ HALFWIDTH KATAKANA LETTER O --> KATAKANA LETTER O\n MAKE_PAIR( 0xFF76, 0x30AB ), \/\/ HALFWIDTH KATAKANA LETTER KA --> KATAKANA LETTER KA\n MAKE_PAIR( 0xFF77, 0x30AD ), \/\/ HALFWIDTH KATAKANA LETTER KI --> KATAKANA LETTER KI\n MAKE_PAIR( 0xFF78, 0x30AF ), \/\/ HALFWIDTH KATAKANA LETTER KU --> KATAKANA LETTER KU\n MAKE_PAIR( 0xFF79, 0x30B1 ), \/\/ HALFWIDTH KATAKANA LETTER KE --> KATAKANA LETTER KE\n MAKE_PAIR( 0xFF7A, 0x30B3 ), \/\/ HALFWIDTH KATAKANA LETTER KO --> KATAKANA LETTER KO\n MAKE_PAIR( 0xFF7B, 0x30B5 ), \/\/ HALFWIDTH KATAKANA LETTER SA --> KATAKANA LETTER SA\n MAKE_PAIR( 0xFF7C, 0x30B7 ), \/\/ HALFWIDTH KATAKANA LETTER SI --> KATAKANA LETTER SI\n MAKE_PAIR( 0xFF7D, 0x30B9 ), \/\/ HALFWIDTH KATAKANA LETTER SU --> KATAKANA LETTER SU\n MAKE_PAIR( 0xFF7E, 0x30BB ), \/\/ HALFWIDTH KATAKANA LETTER SE --> KATAKANA LETTER SE\n MAKE_PAIR( 0xFF7F, 0x30BD ), \/\/ HALFWIDTH KATAKANA LETTER SO --> KATAKANA LETTER SO\n MAKE_PAIR( 0xFF80, 0x30BF ), \/\/ HALFWIDTH KATAKANA LETTER TA --> KATAKANA LETTER TA\n MAKE_PAIR( 0xFF81, 0x30C1 ), \/\/ HALFWIDTH KATAKANA LETTER TI --> KATAKANA LETTER TI\n MAKE_PAIR( 0xFF82, 0x30C4 ), \/\/ HALFWIDTH KATAKANA LETTER TU --> KATAKANA LETTER TU\n MAKE_PAIR( 0xFF83, 0x30C6 ), \/\/ HALFWIDTH KATAKANA LETTER TE --> KATAKANA LETTER TE\n MAKE_PAIR( 0xFF84, 0x30C8 ), \/\/ HALFWIDTH KATAKANA LETTER TO --> KATAKANA LETTER TO\n MAKE_PAIR( 0xFF85, 0x30CA ), \/\/ HALFWIDTH KATAKANA LETTER NA --> KATAKANA LETTER NA\n MAKE_PAIR( 0xFF86, 0x30CB ), \/\/ HALFWIDTH KATAKANA LETTER NI --> KATAKANA LETTER NI\n MAKE_PAIR( 0xFF87, 0x30CC ), \/\/ HALFWIDTH KATAKANA LETTER NU --> KATAKANA LETTER NU\n MAKE_PAIR( 0xFF88, 0x30CD ), \/\/ HALFWIDTH KATAKANA LETTER NE --> KATAKANA LETTER NE\n MAKE_PAIR( 0xFF89, 0x30CE ), \/\/ HALFWIDTH KATAKANA LETTER NO --> KATAKANA LETTER NO\n MAKE_PAIR( 0xFF8A, 0x30CF ), \/\/ HALFWIDTH KATAKANA LETTER HA --> KATAKANA LETTER HA\n MAKE_PAIR( 0xFF8B, 0x30D2 ), \/\/ HALFWIDTH KATAKANA LETTER HI --> KATAKANA LETTER HI\n MAKE_PAIR( 0xFF8C, 0x30D5 ), \/\/ HALFWIDTH KATAKANA LETTER HU --> KATAKANA LETTER HU\n MAKE_PAIR( 0xFF8D, 0x30D8 ), \/\/ HALFWIDTH KATAKANA LETTER HE --> KATAKANA LETTER HE\n MAKE_PAIR( 0xFF8E, 0x30DB ), \/\/ HALFWIDTH KATAKANA LETTER HO --> KATAKANA LETTER HO\n MAKE_PAIR( 0xFF8F, 0x30DE ), \/\/ HALFWIDTH KATAKANA LETTER MA --> KATAKANA LETTER MA\n MAKE_PAIR( 0xFF90, 0x30DF ), \/\/ HALFWIDTH KATAKANA LETTER MI --> KATAKANA LETTER MI\n MAKE_PAIR( 0xFF91, 0x30E0 ), \/\/ HALFWIDTH KATAKANA LETTER MU --> KATAKANA LETTER MU\n MAKE_PAIR( 0xFF92, 0x30E1 ), \/\/ HALFWIDTH KATAKANA LETTER ME --> KATAKANA LETTER ME\n MAKE_PAIR( 0xFF93, 0x30E2 ), \/\/ HALFWIDTH KATAKANA LETTER MO --> KATAKANA LETTER MO\n MAKE_PAIR( 0xFF94, 0x30E4 ), \/\/ HALFWIDTH KATAKANA LETTER YA --> KATAKANA LETTER YA\n MAKE_PAIR( 0xFF95, 0x30E6 ), \/\/ HALFWIDTH KATAKANA LETTER YU --> KATAKANA LETTER YU\n MAKE_PAIR( 0xFF96, 0x30E8 ), \/\/ HALFWIDTH KATAKANA LETTER YO --> KATAKANA LETTER YO\n MAKE_PAIR( 0xFF97, 0x30E9 ), \/\/ HALFWIDTH KATAKANA LETTER RA --> KATAKANA LETTER RA\n MAKE_PAIR( 0xFF98, 0x30EA ), \/\/ HALFWIDTH KATAKANA LETTER RI --> KATAKANA LETTER RI\n MAKE_PAIR( 0xFF99, 0x30EB ), \/\/ HALFWIDTH KATAKANA LETTER RU --> KATAKANA LETTER RU\n MAKE_PAIR( 0xFF9A, 0x30EC ), \/\/ HALFWIDTH KATAKANA LETTER RE --> KATAKANA LETTER RE\n MAKE_PAIR( 0xFF9B, 0x30ED ), \/\/ HALFWIDTH KATAKANA LETTER RO --> KATAKANA LETTER RO\n MAKE_PAIR( 0xFF9C, 0x30EF ), \/\/ HALFWIDTH KATAKANA LETTER WA --> KATAKANA LETTER WA\n MAKE_PAIR( 0xFF9D, 0x30F3 ), \/\/ HALFWIDTH KATAKANA LETTER N --> KATAKANA LETTER N\n MAKE_PAIR( 0xFF9E, 0x3099 ), \/\/ HALFWIDTH KATAKANA VOICED SOUND MARK --> COMBINING KATAKANA-HIRAGANA VOICED SOUND MARK\n MAKE_PAIR( 0xFF9F, 0x309A ) \/\/ HALFWIDTH KATAKANA SEMI-VOICED SOUND MARK --> COMBINING KATAKANA-\n};\n\n\nstatic struct hw_pair aCombine3099[] =\n{\n { 0x30a6, 0x30f4 },\n { 0x30ab, 0x30ac },\n { 0x30ad, 0x30ae },\n { 0x30af, 0x30b0 },\n { 0x30b1, 0x30b2 },\n { 0x30b3, 0x30b4 },\n { 0x30b5, 0x30b6 },\n { 0x30b7, 0x30b8 },\n { 0x30b9, 0x30ba },\n { 0x30bb, 0x30bc },\n { 0x30bd, 0x30be },\n { 0x30bf, 0x30c0 },\n { 0x30c1, 0x30c2 },\n { 0x30c4, 0x30c5 },\n { 0x30c6, 0x30c7 },\n { 0x30c8, 0x30c9 },\n { 0x30cf, 0x30d0 },\n { 0x30d2, 0x30d3 },\n { 0x30d5, 0x30d6 },\n { 0x30d8, 0x30d9 },\n { 0x30db, 0x30dc },\n { 0x30ef, 0x30f7 },\n { 0x30f0, 0x30f8 },\n { 0x30f1, 0x30f9 },\n { 0x30f2, 0x30fa },\n { 0x30fd, 0x30fe }\n};\n\nstatic struct hw_pair aCombine309A[] =\n{\n { 0x30cf, 0x30d1 },\n { 0x30d2, 0x30d4 },\n { 0x30d5, 0x30d7 },\n { 0x30d8, 0x30da },\n { 0x30db, 0x30dd }\n};\n\nUSHORT ImplReplaceFullWidth( sal_Unicode* pString, USHORT nLen )\n{\n sal_Unicode* pRead = pString;\n sal_Unicode* pWrite = pRead;\n USHORT nNewLen = nLen;\n\n while( (pRead - pString) < nLen )\n {\n if( pWrite != pRead )\n *pWrite = *pRead;\n\n if( *pRead >= 0xff65 && *pRead <= 0xff9f )\n {\n *pWrite = aHWPairs[ *pRead - 0xff65 ].nTo;\n\n struct hw_pair* pTable = NULL;\n int nTableEntries = 0;\n if( *pWrite == 0x3099 )\n {\n \/\/ replace 0x3099 combinations\n pTable = aCombine3099;\n nTableEntries = sizeof(aCombine3099)\/sizeof(aCombine3099[0]);\n }\n else if( *pWrite == 0x309a )\n {\n \/\/ replace 0x309a combinations\n pTable = aCombine309A;\n nTableEntries = sizeof(aCombine309A)\/sizeof(aCombine309A[0]);\n }\n if( pTable )\n {\n sal_Unicode c = pWrite[-1];\n for( int i = 0; i < nTableEntries; i++ )\n if( c == pTable[i].nFrom )\n {\n pWrite--;\n *pWrite = pTable[i].nTo;\n nNewLen--;\n break;\n }\n }\n }\n pRead++;\n pWrite++;\n }\n if( pWrite < pRead )\n *pWrite = 0;\n\n return nNewLen;\n}\n\nvoid ConvertHalfwitdhToFullwidth( String& rString )\n{\n USHORT nNewLen = ImplReplaceFullWidth( rString.GetBufferAccess(), rString.Len() );\n rString.ReleaseBufferAccess( nNewLen );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"tink\/aead\/aes_ctr_hmac_aead_key_manager.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"tink\/config.h\"\n#include \"tink\/mac\/mac_config.h\"\n#include \"tink\/subtle\/aead_test_util.h\"\n#include \"tink\/subtle\/aes_ctr_boringssl.h\"\n#include \"tink\/subtle\/encrypt_then_authenticate.h\"\n#include \"tink\/subtle\/hmac_boringssl.h\"\n#include \"tink\/util\/enums.h\"\n#include \"tink\/util\/status.h\"\n#include \"tink\/util\/statusor.h\"\n#include \"tink\/util\/test_matchers.h\"\n#include \"proto\/aes_ctr_hmac_aead.pb.h\"\n#include \"proto\/aes_gcm.pb.h\"\n#include \"proto\/common.pb.h\"\n#include \"proto\/tink.pb.h\"\n\nnamespace crypto {\nnamespace tink {\n\nusing ::crypto::tink::test::IsOk;\nusing ::crypto::tink::test::StatusIs;\nusing ::crypto::tink::util::StatusOr;\nusing ::google::crypto::tink::AesCtrHmacAeadKey;\nusing ::google::crypto::tink::AesCtrHmacAeadKeyFormat;\nusing ::google::crypto::tink::HashType;\nusing ::google::crypto::tink::KeyData;\nusing ::testing::Eq;\nusing ::testing::Not;\nusing ::testing::SizeIs;\n\nnamespace {\n\nTEST(AesCtrHmacAeadKeyManagerTest, Basics) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().get_version(), Eq(0));\n EXPECT_THAT(AesCtrHmacAeadKeyManager().get_key_type(),\n Eq(\"type.googleapis.com\/google.crypto.tink.AesCtrHmacAeadKey\"));\n EXPECT_THAT(AesCtrHmacAeadKeyManager().key_material_type(),\n Eq(google::crypto::tink::KeyData::SYMMETRIC));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateEmptyKey) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(AesCtrHmacAeadKey()),\n StatusIs(util::error::INVALID_ARGUMENT));\n}\n\nAesCtrHmacAeadKey CreateValidKey() {\n AesCtrHmacAeadKey key;\n key.set_version(0);\n auto aes_ctr_key = key.mutable_aes_ctr_key();\n aes_ctr_key->set_key_value(std::string(16, 'a'));\n aes_ctr_key->mutable_params()->set_iv_size(12);\n auto hmac_key = key.mutable_hmac_key();\n hmac_key->set_key_value(std::string(16, 'b'));\n hmac_key->mutable_params()->set_hash(HashType::SHA1);\n hmac_key->mutable_params()->set_tag_size(10);\n return key;\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidKey) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(CreateValidKey()), IsOk());\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, AesKeySizes) {\n AesCtrHmacAeadKey key = CreateValidKey();\n for (int len = 0; len < 42; len++) {\n key.mutable_aes_ctr_key()->set_key_value(std::string(len, 'a'));\n if (len == 16 || len == 32) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), IsOk())\n << \" for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), Not(IsOk()))\n << \" for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, HmacKeySizes) {\n AesCtrHmacAeadKey key = CreateValidKey();\n for (int len = 0; len < 42; len++) {\n key.mutable_hmac_key()->set_key_value(std::string(len, 'b'));\n if (len >= 16) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), IsOk())\n << \" for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), Not(IsOk()))\n << \" for length \" << len;\n }\n }\n}\n\nAesCtrHmacAeadKeyFormat CreateValidKeyFormat() {\n AesCtrHmacAeadKeyFormat key_format;\n auto aes_ctr_key_format = key_format.mutable_aes_ctr_key_format();\n aes_ctr_key_format->set_key_size(16);\n aes_ctr_key_format->mutable_params()->set_iv_size(16);\n auto hmac_key_format = key_format.mutable_hmac_key_format();\n hmac_key_format->set_key_size(21);\n hmac_key_format->mutable_params()->set_hash(HashType::SHA256);\n hmac_key_format->mutable_params()->set_tag_size(16);\n return key_format;\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormat) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n EXPECT_THAT(\n AesCtrHmacAeadKeyManager().ValidateKeyFormat(CreateValidKeyFormat()),\n IsOk());\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateEmptyKeyFormat) {\n EXPECT_THAT(\n AesCtrHmacAeadKeyManager().ValidateKeyFormat(AesCtrHmacAeadKeyFormat()),\n Not(IsOk()));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormatKeySizes) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n for (int len = 0; len < 42; ++len) {\n key_format.mutable_aes_ctr_key_format()->set_key_size(len);\n if (len == 16 || len == 32) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n IsOk())\n << \"for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n Not(IsOk()))\n << \"for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormatHmacKeySizes) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n for (int len = 0; len < 42; ++len) {\n key_format.mutable_hmac_key_format()->set_key_size(len);\n if (len >= 16) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n IsOk())\n << \"for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n Not(IsOk()))\n << \"for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, CreateKey) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n StatusOr<AesCtrHmacAeadKey> key_or =\n AesCtrHmacAeadKeyManager().CreateKey(key_format);\n ASSERT_THAT(key_or.status(), IsOk());\n const AesCtrHmacAeadKey& key = key_or.ValueOrDie();\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key),\n IsOk());\n EXPECT_THAT(key.aes_ctr_key().params().iv_size(),\n Eq(key_format.aes_ctr_key_format().params().iv_size()));\n EXPECT_THAT(key.aes_ctr_key().key_value(),\n SizeIs(key_format.aes_ctr_key_format().key_size()));\n EXPECT_THAT(key.hmac_key().params().hash(),\n Eq(key_format.hmac_key_format().params().hash()));\n EXPECT_THAT(key.hmac_key().params().tag_size(),\n Eq(key_format.hmac_key_format().params().tag_size()));\n EXPECT_THAT(key.hmac_key().key_value(),\n SizeIs(key_format.hmac_key_format().key_size()));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, CreateAead) {\n AesCtrHmacAeadKey key = CreateValidKey();\n\n StatusOr<std::unique_ptr<Aead>> aead_or =\n AesCtrHmacAeadKeyManager().GetPrimitive<Aead>(key);\n ASSERT_THAT(aead_or.status(), IsOk());\n\n auto direct_aes_ctr_or = subtle::AesCtrBoringSsl::New(\n key.aes_ctr_key().key_value(), key.aes_ctr_key().params().iv_size());\n ASSERT_THAT(direct_aes_ctr_or.status(), IsOk());\n\n auto direct_hmac_or = subtle::HmacBoringSsl::New(\n util::Enums::ProtoToSubtle(key.hmac_key().params().hash()),\n key.hmac_key().params().tag_size(), key.hmac_key().key_value());\n ASSERT_THAT(direct_hmac_or.status(), IsOk());\n\n auto direct_aead_or = subtle::EncryptThenAuthenticate::New(\n std::move(direct_aes_ctr_or.ValueOrDie()),\n std::move(direct_hmac_or.ValueOrDie()),\n key.hmac_key().params().tag_size());\n ASSERT_THAT(direct_aead_or.status(), IsOk());\n\n EXPECT_THAT(EncryptThenDecrypt(aead_or.ValueOrDie().get(),\n direct_aead_or.ValueOrDie().get(),\n \"message\", \"aad\"),\n IsOk());\n}\n\n} \/\/ namespace\n} \/\/ namespace tink\n} \/\/ namespace crypto\n<commit_msg>Remove unused include.<commit_after>\/\/ Copyright 2017 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"tink\/aead\/aes_ctr_hmac_aead_key_manager.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"tink\/config.h\"\n#include \"tink\/mac\/mac_config.h\"\n#include \"tink\/subtle\/aead_test_util.h\"\n#include \"tink\/subtle\/aes_ctr_boringssl.h\"\n#include \"tink\/subtle\/encrypt_then_authenticate.h\"\n#include \"tink\/subtle\/hmac_boringssl.h\"\n#include \"tink\/util\/enums.h\"\n#include \"tink\/util\/status.h\"\n#include \"tink\/util\/statusor.h\"\n#include \"tink\/util\/test_matchers.h\"\n#include \"proto\/aes_ctr_hmac_aead.pb.h\"\n#include \"proto\/common.pb.h\"\n#include \"proto\/tink.pb.h\"\n\nnamespace crypto {\nnamespace tink {\n\nusing ::crypto::tink::test::IsOk;\nusing ::crypto::tink::test::StatusIs;\nusing ::crypto::tink::util::StatusOr;\nusing ::google::crypto::tink::AesCtrHmacAeadKey;\nusing ::google::crypto::tink::AesCtrHmacAeadKeyFormat;\nusing ::google::crypto::tink::HashType;\nusing ::google::crypto::tink::KeyData;\nusing ::testing::Eq;\nusing ::testing::Not;\nusing ::testing::SizeIs;\n\nnamespace {\n\nTEST(AesCtrHmacAeadKeyManagerTest, Basics) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().get_version(), Eq(0));\n EXPECT_THAT(AesCtrHmacAeadKeyManager().get_key_type(),\n Eq(\"type.googleapis.com\/google.crypto.tink.AesCtrHmacAeadKey\"));\n EXPECT_THAT(AesCtrHmacAeadKeyManager().key_material_type(),\n Eq(google::crypto::tink::KeyData::SYMMETRIC));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateEmptyKey) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(AesCtrHmacAeadKey()),\n StatusIs(util::error::INVALID_ARGUMENT));\n}\n\nAesCtrHmacAeadKey CreateValidKey() {\n AesCtrHmacAeadKey key;\n key.set_version(0);\n auto aes_ctr_key = key.mutable_aes_ctr_key();\n aes_ctr_key->set_key_value(std::string(16, 'a'));\n aes_ctr_key->mutable_params()->set_iv_size(12);\n auto hmac_key = key.mutable_hmac_key();\n hmac_key->set_key_value(std::string(16, 'b'));\n hmac_key->mutable_params()->set_hash(HashType::SHA1);\n hmac_key->mutable_params()->set_tag_size(10);\n return key;\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidKey) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(CreateValidKey()), IsOk());\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, AesKeySizes) {\n AesCtrHmacAeadKey key = CreateValidKey();\n for (int len = 0; len < 42; len++) {\n key.mutable_aes_ctr_key()->set_key_value(std::string(len, 'a'));\n if (len == 16 || len == 32) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), IsOk())\n << \" for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), Not(IsOk()))\n << \" for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, HmacKeySizes) {\n AesCtrHmacAeadKey key = CreateValidKey();\n for (int len = 0; len < 42; len++) {\n key.mutable_hmac_key()->set_key_value(std::string(len, 'b'));\n if (len >= 16) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), IsOk())\n << \" for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key), Not(IsOk()))\n << \" for length \" << len;\n }\n }\n}\n\nAesCtrHmacAeadKeyFormat CreateValidKeyFormat() {\n AesCtrHmacAeadKeyFormat key_format;\n auto aes_ctr_key_format = key_format.mutable_aes_ctr_key_format();\n aes_ctr_key_format->set_key_size(16);\n aes_ctr_key_format->mutable_params()->set_iv_size(16);\n auto hmac_key_format = key_format.mutable_hmac_key_format();\n hmac_key_format->set_key_size(21);\n hmac_key_format->mutable_params()->set_hash(HashType::SHA256);\n hmac_key_format->mutable_params()->set_tag_size(16);\n return key_format;\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormat) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n EXPECT_THAT(\n AesCtrHmacAeadKeyManager().ValidateKeyFormat(CreateValidKeyFormat()),\n IsOk());\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateEmptyKeyFormat) {\n EXPECT_THAT(\n AesCtrHmacAeadKeyManager().ValidateKeyFormat(AesCtrHmacAeadKeyFormat()),\n Not(IsOk()));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormatKeySizes) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n for (int len = 0; len < 42; ++len) {\n key_format.mutable_aes_ctr_key_format()->set_key_size(len);\n if (len == 16 || len == 32) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n IsOk())\n << \"for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n Not(IsOk()))\n << \"for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, ValidateKeyFormatHmacKeySizes) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n for (int len = 0; len < 42; ++len) {\n key_format.mutable_hmac_key_format()->set_key_size(len);\n if (len >= 16) {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n IsOk())\n << \"for length \" << len;\n } else {\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKeyFormat(key_format),\n Not(IsOk()))\n << \"for length \" << len;\n }\n }\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, CreateKey) {\n AesCtrHmacAeadKeyFormat key_format = CreateValidKeyFormat();\n StatusOr<AesCtrHmacAeadKey> key_or =\n AesCtrHmacAeadKeyManager().CreateKey(key_format);\n ASSERT_THAT(key_or.status(), IsOk());\n const AesCtrHmacAeadKey& key = key_or.ValueOrDie();\n EXPECT_THAT(AesCtrHmacAeadKeyManager().ValidateKey(key),\n IsOk());\n EXPECT_THAT(key.aes_ctr_key().params().iv_size(),\n Eq(key_format.aes_ctr_key_format().params().iv_size()));\n EXPECT_THAT(key.aes_ctr_key().key_value(),\n SizeIs(key_format.aes_ctr_key_format().key_size()));\n EXPECT_THAT(key.hmac_key().params().hash(),\n Eq(key_format.hmac_key_format().params().hash()));\n EXPECT_THAT(key.hmac_key().params().tag_size(),\n Eq(key_format.hmac_key_format().params().tag_size()));\n EXPECT_THAT(key.hmac_key().key_value(),\n SizeIs(key_format.hmac_key_format().key_size()));\n}\n\nTEST(AesCtrHmacAeadKeyManagerTest, CreateAead) {\n AesCtrHmacAeadKey key = CreateValidKey();\n\n StatusOr<std::unique_ptr<Aead>> aead_or =\n AesCtrHmacAeadKeyManager().GetPrimitive<Aead>(key);\n ASSERT_THAT(aead_or.status(), IsOk());\n\n auto direct_aes_ctr_or = subtle::AesCtrBoringSsl::New(\n key.aes_ctr_key().key_value(), key.aes_ctr_key().params().iv_size());\n ASSERT_THAT(direct_aes_ctr_or.status(), IsOk());\n\n auto direct_hmac_or = subtle::HmacBoringSsl::New(\n util::Enums::ProtoToSubtle(key.hmac_key().params().hash()),\n key.hmac_key().params().tag_size(), key.hmac_key().key_value());\n ASSERT_THAT(direct_hmac_or.status(), IsOk());\n\n auto direct_aead_or = subtle::EncryptThenAuthenticate::New(\n std::move(direct_aes_ctr_or.ValueOrDie()),\n std::move(direct_hmac_or.ValueOrDie()),\n key.hmac_key().params().tag_size());\n ASSERT_THAT(direct_aead_or.status(), IsOk());\n\n EXPECT_THAT(EncryptThenDecrypt(aead_or.ValueOrDie().get(),\n direct_aead_or.ValueOrDie().get(),\n \"message\", \"aad\"),\n IsOk());\n}\n\n} \/\/ namespace\n} \/\/ namespace tink\n} \/\/ namespace crypto\n<|endoftext|>"} {"text":"<commit_before>#ifndef UTILS_HPP_\n#define UTILS_HPP_\n#include \"basics.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include <boost\/math\/special_functions.hpp>\n\nnamespace NPDivs {\n\ntemplate <typename T>\nbool cmp_with_inf(T i, T j) { return boost::math::isinf(i) || i < j; }\n\ntemplate <typename T>\nstruct greater_than {\n greater_than(T x) : base(x) {}\n bool operator()(T y) { return y > base; }\n\n private:\n T base;\n};\n\ntemplate <typename T>\nvoid fix_terms(std::vector<T> &terms, double ub = .99) {\n \/* Takes a vector of elements and replaces any infinite or very-large\n * elements with the value of the highest non-very-large element, as well\n * as possibly changing the order. \"Very-large\" is defined as the ub-th\n * quantile if ub < 1, otherwise the largest non-inf element.\n *\/\n typedef typename std::vector<T>::size_type sz;\n\n using std::max_element;\n using std::nth_element;\n using std::replace_if;\n using std::remove_if;\n\n T cutoff;\n bool find_noninf_max = true;\n\n \/\/ throw away any nans\n remove_if(terms.begin(), terms.end(), boost::math::isnan<T>);\n\n \/\/ try finding the ub-th percentile\n if (ub < 1) {\n sz k = terms.size() * ub; \/\/ the index we want\n nth_element(terms.begin(), terms.begin() + k, terms.end());\n cutoff = terms[k];\n\n find_noninf_max = boost::math::isinf(cutoff);\n }\n\n \/\/ just use the highest non-inf element\n if (find_noninf_max) {\n cutoff = *max_element(terms.begin(), terms.end(), cmp_with_inf<T>);\n }\n\n \/\/ replace anything greater than cutoff with cutoff\n replace_if(terms.begin(), terms.end(), greater_than<T>(cutoff), cutoff);\n}\n\n}\n\n#endif\n<commit_msg>hoping against hope this will work with old boost<commit_after>#ifndef FIX_TERMS_HPP_\n#define FIX_TERMS_HPP_\n#include \"basics.hpp\"\n\n#include <algorithm>\n#include <vector>\n\n#include <boost\/math\/special_functions\/fpclassify.hpp>\n\nnamespace NPDivs {\n\ntemplate <typename T>\nbool cmp_with_inf(T i, T j) { return boost::math::isinf(i) || i < j; }\n\ntemplate <typename T>\nstruct greater_than {\n greater_than(T x) : base(x) {}\n bool operator()(T y) { return y > base; }\n\n private:\n T base;\n};\n\ntemplate <typename T>\nvoid fix_terms(std::vector<T> &terms, double ub = .99) {\n \/* Takes a vector of elements and replaces any infinite or very-large\n * elements with the value of the highest non-very-large element, as well\n * as throwing away any nan values, possibly changing the order.\n * \"Very-large\" is defined as the ub-th quantile if ub < 1, otherwise the\n * largest non-inf element. Note that values of -inf are not altered.\n *\/\n typedef typename std::vector<T>::size_type sz;\n\n using std::max_element;\n using std::nth_element;\n using std::replace_if;\n using std::remove_if;\n\n T cutoff;\n bool find_noninf_max = true;\n\n \/\/ throw away any nans\n remove_if(terms.begin(), terms.end(), boost::math::isnan<T>);\n\n \/\/ try finding the ub-th percentile\n if (ub < 1) {\n sz k = terms.size() * ub; \/\/ the index we want\n nth_element(terms.begin(), terms.begin() + k, terms.end());\n cutoff = terms[k];\n\n find_noninf_max = boost::math::isinf(cutoff);\n }\n\n \/\/ just use the highest non-inf element\n if (find_noninf_max) {\n cutoff = *max_element(terms.begin(), terms.end(), cmp_with_inf<T>);\n }\n\n \/\/ replace anything greater than cutoff with cutoff\n replace_if(terms.begin(), terms.end(), greater_than<T>(cutoff), cutoff);\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2008 George Goldberg <grundleborg@googlemail.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License version 2 as\n * published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Library General Public License for more details\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"presence.h\"\n\n#include <TelepathyQt4\/Client\/Account>\n#include <TelepathyQt4\/Client\/AccountManager>\n\n#include <KDebug>\n#include <KLocale>\n#include <KUrl>\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QTimer>\n\nclass PresenceEngine::PresenceEnginePrivate\n{\n\tPresenceEngine *parent;\npublic:\n\tPresenceEnginePrivate(PresenceEngine *p) : parent(p) {}\n\t\n\tTelepathy::Client::AccountManager * m_accountManager;\n\t\n\tvoid createAccountDataSource(const QDBusObjectPath &path)\n\t{\n\t\t\/\/ \\todo: FIXME\n\t\tkDebug() << \"createAccountDataSource called\";\n\t\tkDebug() << path.path();\n\t Telepathy::Client::Account *account = accountFromObjectPath(path);\n\n\t QString source;\n\t \/\/ \\todo: FIXME\n\t \/\/ source = account.uniqueIdentifier();\n\t Telepathy::SimplePresence sp = account->currentPresence();\n\t QVariant vsp;\n\t vsp.setValue(sp);\n\t parent->setData(source, \"current_presence\", vsp);\n\t \n\t\t\/\/ emit parent->sourceAdded(account->uniqueIdentifier());\n\n\t\t\/\/ \\todo: remove\n\/*\n\t\t\tQString source;\n\t\t source.setNum(handle);\n\t\t QVariantMap accountData = m_accountManager->queryAccount(handle);\n\t\t QMap<QString, QVariant>::const_iterator end( accountData.constEnd() );\n\t\t for(QMap<QString, QVariant>::const_iterator itr(accountData.constBegin()); itr != end; ++itr)\n\t\t {\n\t\t if(itr.key() == Decibel::name_current_presence)\n\t\t {\n\t\t QtTapioca::PresenceState ps = qdbus_cast<QtTapioca::PresenceState>(itr.value().value<QDBusArgument>());\n\t\t QVariant psv;\n\t\t psv.setValue(ps);\n\t\t setData(source, \"current_presence\", psv);\n\t\t continue;\n\t\t }\n\t\t else if(itr.key() == Decibel::name_presence_parameters)\n\t\t {\n\t\t setData(source, \"status_message\", itr.value().toMap().value(\"status_message\").toString());\n\t\t }\n\t\t }\n\t\t\n\t\temit parent->sourceAdded(account->uniqueIdentifier());\n*\/\n\t}\n\t\n\tvoid removeAccountDataSource(const QDBusObjectPath &path)\n\t{\n\t\tkDebug() << \"removeAccountDataSource called\";\n\t\tkDebug() << path.path();\n\t\t\n\t\tTelepathy::Client::Account *account = accountFromObjectPath(path);\n\t\t\n\t\t\/\/ \\todo: FIXME\n\/*\n\t\tQString identifier = account->uniqueIdentifier();\n\t\tparent->removeSource(identifier);\n\t\temit parent->sourceRemoved(identifier);\n*\/\n\t}\n\t\n\tTelepathy::Client::Account *accountFromObjectPath(const QDBusObjectPath &path)\n\t{\n\t\treturn m_accountManager->accountForPath(path);\n\t}\n};\n\n\/**\n * \\class PresenceEngine\n * \\ingroup presence\n * \\headerfile <presence.h>\n *\n * Object representing a Presence data source.\n *\/\n\n\/**\n * Construct a new PresenceEngine object.\n *\n * \\param parent Object parent.\n * \\param args QVariantList arguments.\n *\/\nPresenceEngine::PresenceEngine(QObject * parent, const QVariantList & args)\n : Plasma::DataEngine(parent, args),\n d(new PresenceEnginePrivate(this))\n{\n \/\/ Register custom types:\n Telepathy::registerTypes();\n setIcon(QString());\n}\n\n\/**\n * Class destructor\n *\/\nPresenceEngine::~PresenceEngine()\n{\n\t\/\/ \\todo: FIXME. Why there is a problem?\n\/\/\tdelete d->m_accountManager;\n\tdelete d;\n}\n\n\/**\n * Initialize Presence.\n *\/\nvoid PresenceEngine::init()\n{\n kDebug() << \"init() started\";\n \/*\n * check that we are connected to the session\n * bus OK.\n *\/\n if (!QDBusConnection::sessionBus().isConnected())\n {\n kDebug() << \"PresenceEngine::init(): cannot connect to session bus.\";\n }\n\n \/*\n * set up the dbus accountmanager object\n * which will provide all the data to this\n * data engine.\n *\/\n d->m_accountManager = \n \tnew Telepathy::Client::AccountManager(QDBusConnection::sessionBus());\n \n \/*\n * connect signal from the account manager\n * to waiting when it's ready\n *\/\n connect(d->m_accountManager->becomeReady(),\n \t\tSIGNAL(finished(Telepathy::Client::PendingOperation*)),\n \t\tthis,\n \t\tSLOT(onAccountReady(Telepathy::Client::PendingOperation*))\n \t\t);\n \n \/*\n * connect signals from the account manager\n * to slots within this data engine.\n *\n * we intentionally do this before processing\n * the accounts that are already created so\n * that if another is created while we are\n * processing them, we don't miss out on it.\n *\/\n connect(d->m_accountManager, SIGNAL(accountCreated(const QDBusObjectPath &)),\n this, SLOT(accountCreated(const QDBusObjectPath &)));\n connect(d->m_accountManager, SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)),\n this, SLOT(accountValidityChanged(const QDBusObjectPath &, bool)));\n connect(d->m_accountManager, SIGNAL(accountRemoved(const QDBusObjectPath &)),\n this, SLOT(accountRemoved(const QDBusObjectPath &)));\n}\n\n\/**\n * Return whether source exist.\n * \n * \\return \\c true if source exists.\n *\/\nbool PresenceEngine::sourceRequestEvent(const QString & name)\n{\n \/*\n * if the visualisation requests a\n * source that is not already there\n * then it doesn't exist, so return\n * false\n *\/\n Q_UNUSED(name);\n return false;\n}\n\nvoid PresenceEngine::onAccountReady(Telepathy::Client::PendingOperation *operation)\n{\n\tkDebug() << \"onAccountReady() called\";\n\tif(operation->isError())\n\t{\n\t\tkDebug() << operation->errorName() << \": \" << operation->errorMessage();\n\t\treturn;\n\t}\n\t\n Telepathy::ObjectPathList pathList = d->m_accountManager->allAccountPaths();\n kDebug() << \"All Account Paths: \" << pathList.size();\n \n \/*\n * get a list of all the accounts that\n * are all ready there\n *\/\n QList<Telepathy::Client::Account *> accounts = d->m_accountManager->allAccounts();\n kDebug() << \"accounts: \" << accounts.size();\n \n Telepathy::ObjectPathList objectPathList = d->m_accountManager->allAccountPaths();\n \n \/*\n * create a datasource for each\n * of the accounts we got in the list.\n *\/\n foreach(const QDBusObjectPath &path, objectPathList)\n {\n d->createAccountDataSource(path);\n }\n}\n\n\/**\n * Slot for new account.\n * \n * \\param path QDBusObjectPath to created account.\n *\/\nvoid PresenceEngine::accountCreated(const QDBusObjectPath &path)\n{\n kDebug() << \"accountCreated() called\";\n \/\/ Load the data for the new account. To avoid duplicating code, we treat\n \/\/ this just as if an account was updated, and call the method to handle\n \/\/ that.\n d->createAccountDataSource(path);\n}\n\n\/**\n * Slot for account data changed.\n * \n * \\param QDBusObjectPath Name of the account path.\n * \\param valid true if the account is valid.\n *\/\nvoid PresenceEngine::accountValidityChanged(const QDBusObjectPath &path, bool valid)\n{\n\tQ_UNUSED(valid);\n kDebug() << \"accountValidityChanged() called\";\n \/*\n * slot called when an account has\n * been updated.\n *\/\n d->createAccountDataSource(path);\n}\n\n\/**\n * Slot for account removed.\n * \n * \\param QDBusObjectPath Name of the account path.\n *\/\nvoid PresenceEngine::accountRemoved(const QDBusObjectPath &path)\n{\n kDebug() << \"uint handle() called\";\n \/*\n * slot called when an account has been deleted\n *\n * remove that source.\n *\/\n d->removeAccountDataSource(path);\n}\n\n#include \"presence.moc\"\n\n<commit_msg>add identifier for datasource<commit_after>\/*\n * Copyright (C) 2008 George Goldberg <grundleborg@googlemail.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License version 2 as\n * published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Library General Public License for more details\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"presence.h\"\n\n#include <TelepathyQt4\/Client\/Account>\n#include <TelepathyQt4\/Client\/AccountManager>\n\n#include <KDebug>\n#include <KLocale>\n#include <KUrl>\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QTimer>\n\nclass PresenceEngine::PresenceEnginePrivate\n{\n\tPresenceEngine *parent;\npublic:\n\tPresenceEnginePrivate(PresenceEngine *p) : parent(p) {}\n\t\n\tTelepathy::Client::AccountManager * m_accountManager;\n\t\n\tvoid createAccountDataSource(const QDBusObjectPath &path)\n\t{\n\t\t\/\/ \\todo: FIXME\n\t\tkDebug() << \"createAccountDataSource called\";\n\t\tkDebug() << path.path();\n\t Telepathy::Client::Account *account = accountFromObjectPath(path);\n\n\t QString source;\n\t \/\/ \\todo: FIXME\n\t \/\/ source = account.uniqueIdentifier();\n\t source = path.path();\n\t \n\t Telepathy::SimplePresence sp = account->currentPresence();\n\t QVariant vsp;\n\t vsp.setValue(sp);\n\t parent->setData(source, \"current_presence\", vsp);\n\t \n\t\t\/\/ \\todo: remove\n\/*\n\t\t\tQString source;\n\t\t source.setNum(handle);\n\t\t QVariantMap accountData = m_accountManager->queryAccount(handle);\n\t\t QMap<QString, QVariant>::const_iterator end( accountData.constEnd() );\n\t\t for(QMap<QString, QVariant>::const_iterator itr(accountData.constBegin()); itr != end; ++itr)\n\t\t {\n\t\t if(itr.key() == Decibel::name_current_presence)\n\t\t {\n\t\t QtTapioca::PresenceState ps = qdbus_cast<QtTapioca::PresenceState>(itr.value().value<QDBusArgument>());\n\t\t QVariant psv;\n\t\t psv.setValue(ps);\n\t\t setData(source, \"current_presence\", psv);\n\t\t continue;\n\t\t }\n\t\t else if(itr.key() == Decibel::name_presence_parameters)\n\t\t {\n\t\t setData(source, \"status_message\", itr.value().toMap().value(\"status_message\").toString());\n\t\t }\n\t\t }\n*\/\n\t}\n\t\n\tvoid removeAccountDataSource(const QDBusObjectPath &path)\n\t{\n\t\tkDebug() << \"removeAccountDataSource called\";\n\t\tkDebug() << path.path();\n\t\t\n\t\tTelepathy::Client::Account *account = accountFromObjectPath(path);\n\t\t\n\t\t\/\/ \\todo: FIXME\n\/*\n\t\tQString identifier = account->uniqueIdentifier();\n\t\tparent->removeSource(identifier);\n\t\temit parent->sourceRemoved(identifier);\n*\/\n\t\tQString identifier = path.path();\n\t\tparent->removeSource(identifier);\n\t}\n\t\n\tTelepathy::Client::Account *accountFromObjectPath(const QDBusObjectPath &path)\n\t{\n\t\treturn m_accountManager->accountForPath(path);\n\t}\n};\n\n\/**\n * \\class PresenceEngine\n * \\ingroup presence\n * \\headerfile <presence.h>\n *\n * Object representing a Presence data source.\n *\/\n\n\/**\n * Construct a new PresenceEngine object.\n *\n * \\param parent Object parent.\n * \\param args QVariantList arguments.\n *\/\nPresenceEngine::PresenceEngine(QObject * parent, const QVariantList & args)\n : Plasma::DataEngine(parent, args),\n d(new PresenceEnginePrivate(this))\n{\n \/\/ Register custom types:\n Telepathy::registerTypes();\n setIcon(QString());\n}\n\n\/**\n * Class destructor\n *\/\nPresenceEngine::~PresenceEngine()\n{\n\t\/\/ \\todo: FIXME. Why there is a problem?\n\/\/\tdelete d->m_accountManager;\n\tdelete d;\n}\n\n\/**\n * Initialize Presence.\n *\/\nvoid PresenceEngine::init()\n{\n kDebug() << \"init() started\";\n \/*\n * check that we are connected to the session\n * bus OK.\n *\/\n if (!QDBusConnection::sessionBus().isConnected())\n {\n kDebug() << \"PresenceEngine::init(): cannot connect to session bus.\";\n }\n\n \/*\n * set up the dbus accountmanager object\n * which will provide all the data to this\n * data engine.\n *\/\n d->m_accountManager = \n \tnew Telepathy::Client::AccountManager(QDBusConnection::sessionBus());\n \n \/*\n * connect signal from the account manager\n * to waiting when it's ready\n *\/\n connect(d->m_accountManager->becomeReady(),\n \t\tSIGNAL(finished(Telepathy::Client::PendingOperation*)),\n \t\tthis,\n \t\tSLOT(onAccountReady(Telepathy::Client::PendingOperation*))\n \t\t);\n \n \/*\n * connect signals from the account manager\n * to slots within this data engine.\n *\n * we intentionally do this before processing\n * the accounts that are already created so\n * that if another is created while we are\n * processing them, we don't miss out on it.\n *\/\n connect(d->m_accountManager, SIGNAL(accountCreated(const QDBusObjectPath &)),\n this, SLOT(accountCreated(const QDBusObjectPath &)));\n connect(d->m_accountManager, SIGNAL(accountValidityChanged(const QDBusObjectPath &, bool)),\n this, SLOT(accountValidityChanged(const QDBusObjectPath &, bool)));\n connect(d->m_accountManager, SIGNAL(accountRemoved(const QDBusObjectPath &)),\n this, SLOT(accountRemoved(const QDBusObjectPath &)));\n}\n\n\/**\n * Return whether source exist.\n * \n * \\return \\c true if source exists.\n *\/\nbool PresenceEngine::sourceRequestEvent(const QString & name)\n{\n\tkDebug() << \"sourceRequestEvent() called\";\n \/*\n * if the visualisation requests a\n * source that is not already there\n * then it doesn't exist, so return\n * false\n *\/\n Q_UNUSED(name);\n return false;\n}\n\nvoid PresenceEngine::onAccountReady(Telepathy::Client::PendingOperation *operation)\n{\n\tkDebug() << \"onAccountReady() called\";\n\tif(operation->isError())\n\t{\n\t\tkDebug() << operation->errorName() << \": \" << operation->errorMessage();\n\t\treturn;\n\t}\n\t\n Telepathy::ObjectPathList pathList = d->m_accountManager->allAccountPaths();\n kDebug() << \"All Account Paths: \" << pathList.size();\n \n \/*\n * get a list of all the accounts that\n * are all ready there\n *\/\n QList<Telepathy::Client::Account *> accounts = d->m_accountManager->allAccounts();\n kDebug() << \"accounts: \" << accounts.size();\n \n Telepathy::ObjectPathList objectPathList = d->m_accountManager->allAccountPaths();\n \n \/*\n * create a datasource for each\n * of the accounts we got in the list.\n *\/\n foreach(const QDBusObjectPath &path, objectPathList)\n {\n d->createAccountDataSource(path);\n }\n}\n\n\/**\n * Slot for new account.\n * \n * \\param path QDBusObjectPath to created account.\n *\/\nvoid PresenceEngine::accountCreated(const QDBusObjectPath &path)\n{\n kDebug() << \"accountCreated() called\";\n \/\/ Load the data for the new account. To avoid duplicating code, we treat\n \/\/ this just as if an account was updated, and call the method to handle\n \/\/ that.\n d->createAccountDataSource(path);\n}\n\n\/**\n * Slot for account data changed.\n * \n * \\param QDBusObjectPath Name of the account path.\n * \\param valid true if the account is valid.\n *\/\nvoid PresenceEngine::accountValidityChanged(const QDBusObjectPath &path, bool valid)\n{\n\tQ_UNUSED(valid);\n kDebug() << \"accountValidityChanged() called\";\n \/*\n * slot called when an account has\n * been updated.\n *\/\n d->createAccountDataSource(path);\n}\n\n\/**\n * Slot for account removed.\n * \n * \\param QDBusObjectPath Name of the account path.\n *\/\nvoid PresenceEngine::accountRemoved(const QDBusObjectPath &path)\n{\n kDebug() << \"accountRemoved() called\";\n \/*\n * slot called when an account has been deleted\n *\n * remove that source.\n *\/\n d->removeAccountDataSource(path);\n}\n\n#include \"presence.moc\"\n\n<|endoftext|>"} {"text":"<commit_before>#include \"GLFramebuffer.h\"\r\n\r\n#include \"GL.h\"\r\n#include \"GLRenderbuffer.h\"\r\n#include \"GLRenderTexture2D.h\"\r\n#include \"GLRenderTexture2DRectangle.h\"\r\n\r\n#include <iostream>\r\n#include \"GLUtility.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ Need to use this factory to create FBOs\r\nGLFramebuffer* GLFramebuffer::New(int width, int height) \r\n{\r\n\t\/\/ Check for framebuffer support\r\n\tif (!GLEW_EXT_framebuffer_object) \r\n\t{\r\n\t\t\/\/ Oops, not supported\r\n\t\tcerr << \"GLFramebuffer: Framebuffer objects not supported!\" << endl;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\t\/\/ Create and return new FBO\r\n\treturn new GLFramebuffer(width, height);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLFramebuffer::GLFramebuffer(int width, int height) \r\n: id(0), width(width), height(height), bound(false) \r\n{\r\n\t\/\/ Create the framebuffer\r\n\t\/\/cout << \"GLFramebuffer: Constructor\" << endl;\r\n\tglGenFramebuffersEXT(1, &id);\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: glGenFramebuffersEXT()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLFramebuffer::~GLFramebuffer() \r\n{\r\n\t\/\/cout << \"GLFramebuffer: Destructor\" << endl;\r\n\t\r\n\t\/\/ Delete all attachments\r\n\tfor (map<int, GLRendertarget*>::iterator i = attachments.begin(); i != attachments.end(); ) \r\n\t{\r\n\t\tint attachment = i->first;\r\n\t\ti++;\r\n\t\tGLRendertarget *rt = DetachRendertarget(attachment);\r\n\t\t\/\/ Delete the rendertarget if it's no longer attached anywhere\r\n\t\tif (rt->GetTimesAttached() == 0) delete rt;\r\n\t}\r\n\t\/\/ Delete the framebuffer\r\n\tglDeleteFramebuffersEXT(1, &id);\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: glDeleteFramebuffersEXT()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget *GLFramebuffer::AttachRendertarget(int attachment, GLRendertarget *rt) \r\n{\r\n\tif (!rt)\r\n\t{\r\n\t\treturn DetachRendertarget(attachment);\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn AttachRendertarget(attachment, *rt);\r\n\t}\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget *GLFramebuffer::AttachRendertarget(int attachment, GLRendertarget &rt) \r\n{\r\n\tif (!bound) Bind();\r\n\r\n\t\/\/ Remove the old render target (if any)\r\n\tGLRendertarget *oldRt = DetachRendertarget(attachment);\r\n\r\n\t\/\/ Attach the new target\r\n\trt.AttachToBoundFBO(attachment);\r\n\tattachments[attachment] = &rt;\r\n\r\n\t\/\/ Return the old attachment (or null)\r\n\treturn oldRt;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget* GLFramebuffer::DetachRendertarget(int attachment) \r\n{\r\n\tif (!bound) Bind();\r\n\r\n\t\/\/ Release the old render target (if any) to the caller and remove it from the map\r\n\tGLRendertarget *rt = 0;\r\n\tmap<int, GLRendertarget*>::iterator it = attachments.find(attachment);\r\n\tif (it != attachments.end()) \r\n\t{\r\n\t\trt = it->second;\r\n\t\trt->DetachFromBoundFBO(attachment);\r\n\t}\r\n\tattachments.erase(attachment);\r\n\r\n\treturn rt;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthBuffer(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorBuffer(GL_DEPTH_ATTACHMENT_EXT, format);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthTexture(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorTexture(GL_DEPTH_ATTACHMENT_EXT, \r\n\t\tformat, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthTextureRectangle(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorTextureRectangle(GL_DEPTH_ATTACHMENT_EXT, \r\n\t\tformat, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilBuffer() \r\n{\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderbuffer::New(width, height, GL_DEPTH24_STENCIL8_EXT);\r\n\tAttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tAttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilTexture() \r\n{\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\tif (!GLEW_ARB_depth_texture && !GLEW_SGIX_depth_texture) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderTexture2D::New(width, height, \r\n\t\tGL_DEPTH24_STENCIL8_EXT, GL_DEPTH_STENCIL_EXT, GL_UNSIGNED_INT_24_8_EXT);\r\n\tAttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tAttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilTextureRectangle() \r\n{\r\n\tif (!GLEW_ARB_texture_rectangle) return false;\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\tif (!GLEW_ARB_depth_texture && !GLEW_SGIX_depth_texture) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderTexture2DRectangle::New(width, height, \r\n\t\tGL_DEPTH24_STENCIL8_EXT, GL_DEPTH_STENCIL_EXT, GL_UNSIGNED_INT_24_8_EXT);\r\n\tAttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tAttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorBuffer(int attachment, int format)\r\n{\r\n\tGLRendertarget *colorbuffer = GLRenderbuffer::New(\r\n\t\twidth, height, format);\r\n\tAttachRendertarget(attachment, *colorbuffer);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorTexture(int attachment, \r\n\t\t\t\t\t\t\t\t\t int internalformat, \r\n\t\t\t\t\t\t\t\t\t int format, int type)\r\n{\r\n\tGLRendertarget *colorbuffer = GLRenderTexture2D::New(\r\n\t\twidth, height, internalformat, format, type);\r\n\tAttachRendertarget(attachment, *colorbuffer);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorTextureRectangle(int attachment, \r\n\t\t\t\t\t\t\t\t\t\t\t\tint internalformat, \r\n\t\t\t\t\t\t\t\t\t\t\t\tint format, int type)\r\n{\r\n\tif (!GLEW_ARB_texture_rectangle) return false;\r\n\r\n\tGLRendertarget *colorbuffer = GLRenderTexture2DRectangle::New(\r\n\t\twidth, height, internalformat, format, type);\r\n\tAttachRendertarget(attachment, *colorbuffer);\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nvoid GLFramebuffer::Bind() \r\n{\r\n\tif (bound) \r\n\t{\r\n\t\tcerr << \"GLFramebuffer: Bind() called, but framebuffer was already bound\" << endl;\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ Store old viewport\r\n\tglPushAttrib(GL_VIEWPORT_BIT);\r\n\t\/\/ Bind FBO\r\n\tglBindFramebufferEXT(GL_FRAMEBUFFER_EXT, id);\r\n\t\/\/ Set viewport\r\n\tglViewport(0, 0, width, height);\r\n\tbound = true;\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: Bind()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nvoid GLFramebuffer::Unbind() \r\n{\r\n\tglBindFramebufferEXT(GL_FRAMEBUFFER_EXT, 0);\r\n\t\r\n\tif (bound) \r\n\t{\r\n\t\t\/\/ Restore viewport\r\n\t\tglPopAttrib();\r\n\t} \r\n\telse \r\n\t{\r\n\t\tcerr << \"GLFramebuffer: Unbind() called, but framebuffer was not bound\" << endl;\r\n\t}\r\n\r\n\tbound = false;\r\n\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: Unbind()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nint GLFramebuffer::GetStatus() \r\n{\r\n\tif (!bound) Bind();\r\n\treturn glCheckFramebufferStatusEXT(GL_FRAMEBUFFER_EXT);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::IsOk() \r\n{\r\n\tint status = GetStatus();\r\n\tswitch (status) \r\n\t{\r\n\t\tcase GL_FRAMEBUFFER_COMPLETE_EXT:\r\n\t\t\treturn true;\r\n\t\t\tbreak;\r\n\t\tcase GL_FRAMEBUFFER_UNSUPPORTED_EXT:\r\n\t\t\treturn false;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\t\/\/assert(false); \/\/ Error in framebuffer code!\r\n\t\t\treturn false;\r\n\t\t\tbreak;\r\n\t}\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLTexture* GLFramebuffer::GetTexture2D(int attachment) \r\n{\r\n\t\/\/ Try to cast, return null if that attachment isn't a rendertarget\r\n\tGLRenderTexture2D *rt = dynamic_cast<GLRenderTexture2D*>(attachments[attachment]);\r\n\tif (!rt) return 0;\r\n\t\/\/ Return texture\r\n\treturn rt->GetTexture();\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nconst GLTexture* GLFramebuffer::GetTexture2D(int attachment) const\r\n{\r\n\t\/\/ Try to cast, return null if that attachment isn't a rendertarget\r\n\tmap<int, GLRendertarget*>::const_iterator atit = attachments.find(attachment);\r\n\tif (atit == attachments.end()) return 0;\r\n\tconst GLRenderTexture2D *rt = dynamic_cast<const GLRenderTexture2D*>(atit->second);\r\n\tif (!rt) return 0;\r\n\t\/\/ Return texture\r\n\treturn rt->GetTexture();\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::Resize(int width, int height)\r\n{\r\n\t\/\/ Resize all attachments\r\n\tfor (map<int, GLRendertarget*>::iterator i = attachments.begin(); i != attachments.end(); ) \r\n\t{\r\n\t\tint attachment = i->first;\r\n\t\ti++;\r\n\t\t\/\/ We need to detach, because the internal rendertarget might change\r\n\t\tGLRendertarget *rt = DetachRendertarget(attachment);\r\n\t\tif (!rt->Resize(width, height))\r\n\t\t{\r\n\t\t\tcerr << \"GLFrameBuffer: Resize failed for attachment \" << attachment << endl;\r\n\t\t\tdelete rt;\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\t\/\/ Re-attach the rendertarget\r\n\t\tAttachRendertarget(attachment, *rt);\r\n\t}\r\n\r\n\t\/\/ Update framebuffer size\r\n\tthis->width = width;\r\n\tthis->height = height;\r\n\r\n\t\/\/ Unbind the framebuffer if bound\r\n\tif (bound) Unbind();\r\n\r\n\treturn true;\r\n}\r\n<commit_msg>Fixed leak when utility functions were called twice (for the same target).<commit_after>#include \"GLFramebuffer.h\"\r\n\r\n#include \"GL.h\"\r\n#include \"GLRenderbuffer.h\"\r\n#include \"GLRenderTexture2D.h\"\r\n#include \"GLRenderTexture2DRectangle.h\"\r\n\r\n#include <iostream>\r\n#include \"GLUtility.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\n\/\/ Need to use this factory to create FBOs\r\nGLFramebuffer* GLFramebuffer::New(int width, int height) \r\n{\r\n\t\/\/ Check for framebuffer support\r\n\tif (!GLEW_EXT_framebuffer_object) \r\n\t{\r\n\t\t\/\/ Oops, not supported\r\n\t\tcerr << \"GLFramebuffer: Framebuffer objects not supported!\" << endl;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\t\/\/ Create and return new FBO\r\n\treturn new GLFramebuffer(width, height);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLFramebuffer::GLFramebuffer(int width, int height) \r\n: id(0), width(width), height(height), bound(false) \r\n{\r\n\t\/\/ Create the framebuffer\r\n\t\/\/cout << \"GLFramebuffer: Constructor\" << endl;\r\n\tglGenFramebuffersEXT(1, &id);\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: glGenFramebuffersEXT()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLFramebuffer::~GLFramebuffer() \r\n{\r\n\t\/\/cout << \"GLFramebuffer: Destructor\" << endl;\r\n\t\r\n\t\/\/ Delete all attachments\r\n\tfor (map<int, GLRendertarget*>::iterator i = attachments.begin(); i != attachments.end(); ) \r\n\t{\r\n\t\tint attachment = i->first;\r\n\t\ti++;\r\n\t\tGLRendertarget *rt = DetachRendertarget(attachment);\r\n\t\t\/\/ Delete the rendertarget if it's no longer attached anywhere\r\n\t\tif (rt->GetTimesAttached() == 0) delete rt;\r\n\t}\r\n\t\/\/ Delete the framebuffer\r\n\tglDeleteFramebuffersEXT(1, &id);\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: glDeleteFramebuffersEXT()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget *GLFramebuffer::AttachRendertarget(int attachment, GLRendertarget *rt) \r\n{\r\n\tif (!rt)\r\n\t{\r\n\t\treturn DetachRendertarget(attachment);\r\n\t}\r\n\telse\r\n\t{\r\n\t\treturn AttachRendertarget(attachment, *rt);\r\n\t}\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget *GLFramebuffer::AttachRendertarget(int attachment, GLRendertarget &rt) \r\n{\r\n\tif (!bound) Bind();\r\n\r\n\t\/\/ Remove the old render target (if any)\r\n\tGLRendertarget *oldRt = DetachRendertarget(attachment);\r\n\r\n\t\/\/ Attach the new target\r\n\trt.AttachToBoundFBO(attachment);\r\n\tattachments[attachment] = &rt;\r\n\r\n\t\/\/ Return the old attachment (or null)\r\n\treturn oldRt;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLRendertarget* GLFramebuffer::DetachRendertarget(int attachment) \r\n{\r\n\tif (!bound) Bind();\r\n\r\n\t\/\/ Release the old render target (if any) to the caller and remove it from the map\r\n\tGLRendertarget *rt = 0;\r\n\tmap<int, GLRendertarget*>::iterator it = attachments.find(attachment);\r\n\tif (it != attachments.end()) \r\n\t{\r\n\t\trt = it->second;\r\n\t\trt->DetachFromBoundFBO(attachment);\r\n\t}\r\n\tattachments.erase(attachment);\r\n\r\n\treturn rt;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthBuffer(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorBuffer(GL_DEPTH_ATTACHMENT_EXT, format);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthTexture(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorTexture(GL_DEPTH_ATTACHMENT_EXT, \r\n\t\tformat, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateDepthTextureRectangle(int format) \r\n{\r\n\t\/\/ Abuse the color buffer utility functions\r\n\treturn CreateColorTextureRectangle(GL_DEPTH_ATTACHMENT_EXT, \r\n\t\tformat, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilBuffer() \r\n{\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderbuffer::New(width, height, GL_DEPTH24_STENCIL8_EXT);\r\n\t\/\/ Attach as depth buffer\r\n\tGLRendertarget *old = AttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\t\/\/ Attach as stencil\r\n\told = AttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilTexture() \r\n{\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\tif (!GLEW_ARB_depth_texture && !GLEW_SGIX_depth_texture) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderTexture2D::New(width, height, \r\n\t\tGL_DEPTH24_STENCIL8_EXT, GL_DEPTH_STENCIL_EXT, GL_UNSIGNED_INT_24_8_EXT);\r\n\t\/\/ Attach as depth buffer\r\n\tGLRendertarget *old = AttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\t\/\/ Attach as stencil\r\n\told = AttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreatePackedDepthStencilTextureRectangle() \r\n{\r\n\tif (!GLEW_ARB_texture_rectangle) return false;\r\n\tif (!GLEW_EXT_packed_depth_stencil) return false;\r\n\tif (!GLEW_ARB_depth_texture && !GLEW_SGIX_depth_texture) return false;\r\n\r\n\tGLRendertarget *dsb = GLRenderTexture2DRectangle::New(width, height, \r\n\t\tGL_DEPTH24_STENCIL8_EXT, GL_DEPTH_STENCIL_EXT, GL_UNSIGNED_INT_24_8_EXT);\r\n\t\/\/ Attach as depth buffer\r\n\tGLRendertarget *old = AttachRendertarget(GL_DEPTH_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\t\/\/ Attach as stencil\r\n\told = AttachRendertarget(GL_STENCIL_ATTACHMENT_EXT, *dsb);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorBuffer(int attachment, int format)\r\n{\r\n\tGLRendertarget *buffer = GLRenderbuffer::New(\r\n\t\twidth, height, format);\r\n\t\/\/ Attach to target\r\n\tGLRendertarget *old = AttachRendertarget(attachment, *buffer);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorTexture(int attachment, \r\n\t\t\t\t\t\t\t\t\t int internalformat, \r\n\t\t\t\t\t\t\t\t\t int format, int type)\r\n{\r\n\tGLRendertarget *buffer = GLRenderTexture2D::New(\r\n\t\twidth, height, internalformat, format, type);\r\n\t\/\/ Attach to target\r\n\tGLRendertarget *old = AttachRendertarget(attachment, *buffer);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::CreateColorTextureRectangle(int attachment, \r\n\t\t\t\t\t\t\t\t\t\t\t\tint internalformat, \r\n\t\t\t\t\t\t\t\t\t\t\t\tint format, int type)\r\n{\r\n\tif (!GLEW_ARB_texture_rectangle) return false;\r\n\r\n\tGLRendertarget *buffer = GLRenderTexture2DRectangle::New(\r\n\t\twidth, height, internalformat, format, type);\r\n\t\/\/ Attach to target\r\n\tGLRendertarget *old = AttachRendertarget(attachment, *buffer);\r\n\tif (old)\r\n\t{\r\n\t\tif (old->GetTimesAttached() == 0) delete old;\r\n\t}\r\n\r\n\treturn true;\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nvoid GLFramebuffer::Bind() \r\n{\r\n\tif (bound) \r\n\t{\r\n\t\tcerr << \"GLFramebuffer: Bind() called, but framebuffer was already bound\" << endl;\r\n\t\treturn;\r\n\t}\r\n\r\n\t\/\/ Store old viewport\r\n\tglPushAttrib(GL_VIEWPORT_BIT);\r\n\t\/\/ Bind FBO\r\n\tglBindFramebufferEXT(GL_FRAMEBUFFER_EXT, id);\r\n\t\/\/ Set viewport\r\n\tglViewport(0, 0, width, height);\r\n\tbound = true;\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: Bind()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nvoid GLFramebuffer::Unbind() \r\n{\r\n\tglBindFramebufferEXT(GL_FRAMEBUFFER_EXT, 0);\r\n\t\r\n\tif (bound) \r\n\t{\r\n\t\t\/\/ Restore viewport\r\n\t\tglPopAttrib();\r\n\t} \r\n\telse \r\n\t{\r\n\t\tcerr << \"GLFramebuffer: Unbind() called, but framebuffer was not bound\" << endl;\r\n\t}\r\n\r\n\tbound = false;\r\n\r\n#ifndef NDEBUG\r\n\tGLUtility::CheckOpenGLError(\"GLFramebuffer: Unbind()\");\r\n#endif\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nint GLFramebuffer::GetStatus() \r\n{\r\n\tif (!bound) Bind();\r\n\treturn glCheckFramebufferStatusEXT(GL_FRAMEBUFFER_EXT);\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::IsOk() \r\n{\r\n\tint status = GetStatus();\r\n\tswitch (status) \r\n\t{\r\n\t\tcase GL_FRAMEBUFFER_COMPLETE_EXT:\r\n\t\t\treturn true;\r\n\t\t\tbreak;\r\n\t\tcase GL_FRAMEBUFFER_UNSUPPORTED_EXT:\r\n\t\t\treturn false;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\t\/\/assert(false); \/\/ Error in framebuffer code!\r\n\t\t\treturn false;\r\n\t\t\tbreak;\r\n\t}\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nGLTexture* GLFramebuffer::GetTexture2D(int attachment) \r\n{\r\n\t\/\/ Try to cast, return null if that attachment isn't a rendertarget\r\n\tGLRenderTexture2D *rt = dynamic_cast<GLRenderTexture2D*>(attachments[attachment]);\r\n\tif (!rt) return 0;\r\n\t\/\/ Return texture\r\n\treturn rt->GetTexture();\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nconst GLTexture* GLFramebuffer::GetTexture2D(int attachment) const\r\n{\r\n\t\/\/ Try to cast, return null if that attachment isn't a rendertarget\r\n\tmap<int, GLRendertarget*>::const_iterator atit = attachments.find(attachment);\r\n\tif (atit == attachments.end()) return 0;\r\n\tconst GLRenderTexture2D *rt = dynamic_cast<const GLRenderTexture2D*>(atit->second);\r\n\tif (!rt) return 0;\r\n\t\/\/ Return texture\r\n\treturn rt->GetTexture();\r\n}\r\n\r\n\/\/ ----------------------------------------------------------------------------\r\nbool GLFramebuffer::Resize(int width, int height)\r\n{\r\n\t\/\/ Resize all attachments\r\n\tfor (map<int, GLRendertarget*>::iterator i = attachments.begin(); i != attachments.end(); ) \r\n\t{\r\n\t\tint attachment = i->first;\r\n\t\ti++;\r\n\t\t\/\/ We need to detach, because the internal rendertarget might change\r\n\t\tGLRendertarget *rt = DetachRendertarget(attachment);\r\n\t\tif (!rt->Resize(width, height))\r\n\t\t{\r\n\t\t\tcerr << \"GLFrameBuffer: Resize failed for attachment \" << attachment << endl;\r\n\t\t\tdelete rt;\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\t\/\/ Re-attach the rendertarget\r\n\t\tAttachRendertarget(attachment, *rt);\r\n\t}\r\n\r\n\t\/\/ Update framebuffer size\r\n\tthis->width = width;\r\n\tthis->height = height;\r\n\r\n\t\/\/ Unbind the framebuffer if bound\r\n\tif (bound) Unbind();\r\n\r\n\treturn true;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2009-2010 Minor Gordon.\r\n\/\/ This source comes from the XtreemFS project. It is licensed under the GPLv2 (see COPYING for terms and conditions).\r\n\r\n#include \"xtreemfs\/main.h\"\r\n\r\n\r\nnamespace mkfs_xtreemfs\r\n{\r\n class Main : public xtreemfs::Main\r\n {\r\n public:\r\n Main()\r\n : xtreemfs::Main\n ( \n \"mkfs.xtreemfs\", \n \"create a new volume on a specified MRC\", \n \"[oncrpc:\/\/]<mrc host>[:port]\/<volume name>\" \n )\r\n {\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY, \n \"-a\", \n \"--access-control-policy\", \n \"NULL|POSIX|VOLUME\" \n );\r\n access_control_policy = org::xtreemfs::interfaces::ACCESS_CONTROL_POLICY_POSIX;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_MODE, \n \"-m\", \n \"--mode\", \n \"n\" \n );\r\n mode = YIELD::platform::Volume::DIRECTORY_MODE_DEFAULT;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID, \n \"-g\", \n \"--owner-group-id\", \n \"group id of owner\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_PASSWORD, \n \"--password\", NULL, \n \"MRC's administrator password\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY, \n \"-p\", \n \"--striping-policy\", \n \"NONE|RAID0\" \n );\r\n striping_policy = org::xtreemfs::interfaces::STRIPING_POLICY_RAID0;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE, \n \"-s\", \n \"--striping-policy-stripe-size\", \n \"n\" \n );\r\n striping_policy_stripe_size = 128;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_OWNER_USER_ID, \n \"-u\", \n \"--owner-user-id\", \n \"user id of owner\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH, \n \"-w\", \n \"--striping-policy-width\", \n \"n\" \n );\r\n striping_policy_width = 1;\r\n }\r\n\r\n private:\r\n enum\r\n {\r\n MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY = 20,\r\n MKFS_XTREEMFS_OPTION_MODE = 21,\r\n MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID = 22,\r\n MKFS_XTREEMFS_OPTION_OWNER_USER_ID = 23, \r\n MKFS_XTREEMFS_OPTION_PASSWORD = 24,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY = 25,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE = 26,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH = 27\r\n };\r\n\r\n org::xtreemfs::interfaces::AccessControlPolicyType access_control_policy;\r\n uint32_t mode;\r\n YIELD::ipc::auto_URI mrc_uri;\r\n std::string owner_group_id, owner_user_id;\r\n std::string password;\r\n org::xtreemfs::interfaces::StripingPolicyType striping_policy;\r\n uint32_t striping_policy_stripe_size;\r\n uint32_t striping_policy_width;\r\n std::string volume_name;\r\n\r\n \/\/ YIELD::Main\r\n int _main( int, char** )\r\n {\r\n createMRCProxy( *mrc_uri, password.c_str() )->xtreemfs_mkvol\n ( \r\n org::xtreemfs::interfaces::Volume\n (\r\n access_control_policy,\r\n org::xtreemfs::interfaces::StripingPolicy\n ( \n striping_policy, \n striping_policy_stripe_size, \n striping_policy_width \n ),\r\n std::string(),\r\n mode,\r\n volume_name,\r\n owner_group_id,\r\n owner_user_id\r\n )\r\n );\r\n return 0;\r\n }\r\n\r\n void parseOption( int id, char* arg )\r\n {\r\n if ( arg )\r\n {\r\n switch ( id )\r\n {\r\n case MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY:\r\n {\r\n if ( strcmp( arg, \"NULL\" ) == 0 )\r\n access_control_policy \n = org::xtreemfs::interfaces::ACCESS_CONTROL_POLICY_NULL;\n\r\n else if ( strcmp( arg, \"POSIX\" ) == 0 )\r\n access_control_policy \n = org::xtreemfs::interfaces::ACCESS_CONTROL_POLICY_POSIX;\n\r\n else if ( strcmp( arg, \"VOLUME\" ) == 0 )\r\n access_control_policy \n = org::xtreemfs::interfaces::ACCESS_CONTROL_POLICY_VOLUME;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_MODE:\r\n {\r\n mode = strtol( arg, NULL, 0 );\r\n if ( mode == 0 )\r\n mode = YIELD::platform::Volume::DIRECTORY_MODE_DEFAULT;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID: \n {\n owner_group_id = arg; \n }\n break;\n\r\n case MKFS_XTREEMFS_OPTION_OWNER_USER_ID: \n {\n owner_user_id = arg; \n }\n break;\n\r\n case MKFS_XTREEMFS_OPTION_PASSWORD:\n {\n password = arg; \n }\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY:\r\n {\r\n if ( strcmp( arg, \"RAID0\" ) == 0 )\r\n striping_policy \n = org::xtreemfs::interfaces::STRIPING_POLICY_RAID0;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE:\r\n {\r\n uint32_t new_striping_policy_stripe_size = atoi( arg );\r\n if ( new_striping_policy_stripe_size != 0 )\r\n striping_policy_stripe_size = new_striping_policy_stripe_size;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH:\r\n {\r\n uint32_t new_striping_policy_width \n = static_cast<uint16_t>( atoi( arg ) );\n\r\n if ( new_striping_policy_width != 0 )\r\n striping_policy_width = new_striping_policy_width;\r\n }\r\n break;\r\n\r\n default: xtreemfs::Main::parseOption( id, arg ); break;\r\n }\r\n }\r\n }\r\n\r\n void parseFiles( int files_count, char** files )\r\n {\r\n if ( files_count >= 1 )\r\n mrc_uri = parseVolumeURI( files[0], volume_name );\r\n else\r\n throw YIELD::platform::Exception\n ( \n \"must specify the MRC and volume name as a URI\" \n );\r\n }\r\n };\r\n};\r\n\r\nint main( int argc, char** argv )\r\n{\r\n return mkfs_xtreemfs::Main().main( argc, argv );\r\n}\r\n<commit_msg>client: mkfs takes a DIR URI and selects a random MRC or one passed via --mrc<commit_after>\/\/ Copyright 2009-2010 Minor Gordon.\r\n\/\/ This source comes from the XtreemFS project. It is licensed under the GPLv2 (see COPYING for terms and conditions).\r\n\r\n#include \"xtreemfs\/main.h\"\r\nusing namespace org::xtreemfs::interfaces;\r\nusing namespace xtreemfs;\r\n\r\n#include <cstdlib>\n#include <ctime>\n\r\n\r\nnamespace mkfs_xtreemfs\r\n{\r\n class Main : public xtreemfs::Main\r\n {\r\n public:\r\n Main()\r\n : xtreemfs::Main\n ( \n \"mkfs.xtreemfs\", \n \"create a new volume\", \n \"[oncrpc:\/\/]<dir host>[:port]\/<volume name>\" \n )\r\n {\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY, \n \"-a\", \n \"--access-control-policy\", \n \"NULL|POSIX|VOLUME\" \n );\r\n access_control_policy = ACCESS_CONTROL_POLICY_POSIX;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_MODE, \n \"-m\",\n \"--mode\", \n \"n\" \n );\r\n mode = YIELD::platform::Volume::DIRECTORY_MODE_DEFAULT;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID, \n \"-g\", \n \"--owner-group-id\", \n \"group id of owner\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_OWNER_USER_ID, \n \"-u\", \n \"--owner-user-id\", \n \"user id of owner\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_PASSWORD, \n \"--password\", NULL, \n \"MRC's administrator password\" \n );\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY, \n \"-p\", \n \"--striping-policy\", \n \"NONE|RAID0\" \n );\r\n striping_policy = STRIPING_POLICY_RAID0;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE, \n \"-s\", \n \"--striping-policy-stripe-size\", \n \"n\" \n );\r\n striping_policy_stripe_size = 128;\r\n\r\n addOption\n ( \n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH, \n \"-w\", \n \"--striping-policy-width\", \n \"n\" \n );\r\n striping_policy_width = 1;\r\n }\r\n\r\n private:\r\n enum\r\n {\r\n MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY = 20,\r\n MKFS_XTREEMFS_OPTION_MODE = 21,\r\n MKFS_XTREEMFS_OPTION_MRC = 22,\r\n MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID = 23,\r\n MKFS_XTREEMFS_OPTION_OWNER_USER_ID = 24, \r\n MKFS_XTREEMFS_OPTION_PASSWORD = 25,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY = 26,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE = 27,\r\n MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH = 28\r\n };\r\n\r\n AccessControlPolicyType access_control_policy;\r\n YIELD::ipc::auto_URI dir_uri;\r\n uint32_t mode;\r\n YIELD::ipc::auto_URI mrc_uri;\r\n std::string owner_group_id, owner_user_id;\r\n std::string password;\r\n StripingPolicyType striping_policy;\r\n uint32_t striping_policy_stripe_size;\r\n uint32_t striping_policy_width;\r\n std::string volume_name;\r\n\r\n \/\/ YIELD::Main\r\n int _main( int, char** )\r\n {\r\n if ( mrc_uri == NULL ) \/\/ No MRC selected\r\n {\r\n auto_DIRProxy dir_proxy( createDIRProxy( *dir_uri ) );\r\n\r\n \/\/ Get a list of all MRC services\r\n ServiceSet mrc_services;\r\n dir_proxy->xtreemfs_service_get_by_type\r\n (\r\n SERVICE_TYPE_MRC,\r\n mrc_services\r\n );\r\n\r\n \/\/ Select a random MRC\r\n std::srand( static_cast<unsigned int>( std::time( NULL ) ) );\r\n Service& mrc_service = mrc_services[std::rand() % mrc_services.size()];\r\n\r\n \/\/ Find an apppropriate address mapping\r\n yidl::runtime::auto_Object<AddressMappingSet> mrc_address_mappings\r\n = dir_proxy->getAddressMappingsFromUUID( mrc_service.get_uuid() );\r\n\r\n for\r\n ( \r\n AddressMappingSet::const_iterator mrc_address_mapping_i = \r\n mrc_address_mappings->begin();\r\n mrc_address_mapping_i != mrc_address_mappings->end();\r\n ++mrc_address_mapping_i\r\n )\r\n {\r\n if \r\n ( \r\n ( *mrc_address_mapping_i ).get_protocol() == \r\n dir_uri->get_scheme() \r\n )\r\n {\r\n mrc_uri \r\n = new YIELD::ipc::URI( ( *mrc_address_mapping_i ).get_uri() );\r\n break;\r\n }\r\n } \r\n\r\n if ( mrc_uri == NULL )\r\n {\r\n \/\/ No address mapping with the same scheme as the dir_uri\r\n \/\/ Default to SSL if we have an SSL context, otherwise TCP\r\n std::string match_protocol;\r\n if ( get_proxy_ssl_context() != NULL )\r\n match_protocol = ONCRPCS_SCHEME;\r\n else\r\n match_protocol = ONCRPC_SCHEME;\r\n\r\n for\r\n ( \r\n AddressMappingSet::const_iterator mrc_address_mapping_i = \r\n mrc_address_mappings->begin();\r\n mrc_address_mapping_i != mrc_address_mappings->end();\r\n ++mrc_address_mapping_i\r\n )\r\n {\r\n if ( ( *mrc_address_mapping_i ).get_protocol() == match_protocol )\r\n {\r\n mrc_uri \r\n = new YIELD::ipc::URI( ( *mrc_address_mapping_i ).get_uri() );\r\n break;\r\n }\r\n }\r\n\r\n if ( mrc_uri == NULL )\r\n throw YIELD::platform::Exception( \"could not find a suitable MRC\" );\r\n }\r\n }\r\n\r\n createMRCProxy( *mrc_uri, password.c_str() )->xtreemfs_mkvol\n ( \r\n org::xtreemfs::interfaces::Volume\n (\r\n access_control_policy,\r\n StripingPolicy\n ( \n striping_policy, \n striping_policy_stripe_size, \n striping_policy_width \n ),\r\n std::string(),\r\n mode,\r\n volume_name,\r\n owner_group_id,\r\n owner_user_id\r\n )\r\n );\r\n\r\n return 0;\r\n }\r\n\r\n void parseOption( int id, char* arg )\r\n {\r\n if ( arg )\r\n {\r\n switch ( id )\r\n {\r\n case MKFS_XTREEMFS_OPTION_ACCESS_CONTROL_POLICY:\r\n {\r\n if ( strcmp( arg, \"NULL\" ) == 0 )\r\n access_control_policy \n = ACCESS_CONTROL_POLICY_NULL;\n\r\n else if ( strcmp( arg, \"POSIX\" ) == 0 )\r\n access_control_policy \n = ACCESS_CONTROL_POLICY_POSIX;\n\r\n else if ( strcmp( arg, \"VOLUME\" ) == 0 )\r\n access_control_policy \n = ACCESS_CONTROL_POLICY_VOLUME;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_MODE:\r\n {\r\n mode = strtol( arg, NULL, 0 );\r\n if ( mode == 0 )\r\n mode = YIELD::platform::Volume::DIRECTORY_MODE_DEFAULT;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_MRC:\r\n {\r\n mrc_uri = parseURI( arg );\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_OWNER_GROUP_ID: \n {\n owner_group_id = arg; \n }\n break;\n\r\n case MKFS_XTREEMFS_OPTION_OWNER_USER_ID: \n {\n owner_user_id = arg; \n }\n break;\n\r\n case MKFS_XTREEMFS_OPTION_PASSWORD:\n {\n password = arg; \n }\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY:\r\n {\r\n if ( strcmp( arg, \"RAID0\" ) == 0 )\r\n striping_policy = STRIPING_POLICY_RAID0;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY_STRIPE_SIZE:\r\n {\r\n uint32_t new_striping_policy_stripe_size = atoi( arg );\r\n if ( new_striping_policy_stripe_size != 0 )\r\n striping_policy_stripe_size = new_striping_policy_stripe_size;\r\n }\r\n break;\r\n\r\n case MKFS_XTREEMFS_OPTION_STRIPING_POLICY_WIDTH:\r\n {\r\n uint32_t new_striping_policy_width \n = static_cast<uint16_t>( atoi( arg ) );\n\r\n if ( new_striping_policy_width != 0 )\r\n striping_policy_width = new_striping_policy_width;\r\n }\r\n break;\r\n\r\n default: xtreemfs::Main::parseOption( id, arg ); break;\r\n }\r\n }\r\n }\r\n\r\n void parseFiles( int files_count, char** files )\r\n {\r\n if ( files_count >= 1 )\r\n dir_uri = parseVolumeURI( files[0], volume_name );\r\n else\r\n throw YIELD::platform::Exception\n ( \n \"must specify the MRC and volume name as a URI\" \n );\r\n }\r\n };\r\n};\r\n\r\nint main( int argc, char** argv )\r\n{\r\n return mkfs_xtreemfs::Main().main( argc, argv );\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ keyvi - A key value store.\n\/\/\n\/\/ Copyright 2015 Hendrik Muhs<hendrik.muhs@gmail.com>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\/*\n * keyvicompiler.cpp\n *\n * Created on: May 13, 2014\n * Author: hendrik\n *\/\n\n#include <boost\/program_options.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/iostreams\/device\/file.hpp>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/range\/iterator_range.hpp>\n#include \"dictionary\/dictionary_compiler.h\"\n#include \"dictionary\/fsa\/internal\/sparse_array_persistence.h\"\n#include \"dictionary\/fsa\/internal\/int_value_store.h\"\n#include \"dictionary\/fsa\/internal\/string_value_store.h\"\n#include \"dictionary\/fsa\/internal\/json_value_store.h\"\n\ntypedef keyvi::dictionary::fsa::internal::IValueStoreWriter::vs_param_t vs_param_t;\n\nvoid callback (size_t added, size_t overall, void*) {\n std::cout << \"Processed \" << added << \"\/\" << overall << \"(\" << ((100 * added) \/ overall) << \"%).\" << std::endl;\n}\n\ntemplate<typename CompilerType, typename ValueType>\nvoid compile_multiple(CompilerType& compiler, std::function<std::pair<std::string, ValueType>(std::string)> parser,\n std::vector<std::string>& inputs)\n{\n boost::iostreams::filtering_istream input_stream;\n std::string line;\n\n for (auto input_as_string : inputs) {\n auto input = boost::filesystem::path(input_as_string);\n\n if(boost::filesystem::is_directory(input)) {\n int files_added = 0;\n for(auto& entry : boost::make_iterator_range(boost::filesystem::directory_iterator(input), {})) {\n if (entry.path().extension() == \".gz\") {\n input_stream.push(boost::iostreams::gzip_decompressor());\n }\n\n boost::iostreams::file_source file(entry.path().string(), std::ios_base::in | std::ios_base::binary);\n input_stream.push(file);\n ++files_added;\n while (std::getline(input_stream, line)) {\n\n auto parse_result = parser(line);\n if (parse_result.first.size() == 0) {\n continue;\n }\n\n compiler.Add(parse_result.first, parse_result.second);\n }\n input_stream.reset();\n }\n\n } else {\n if (input.extension() == \".gz\"){\n input_stream.push(boost::iostreams::gzip_decompressor());\n }\n\n boost::iostreams::file_source file(input.string(), std::ios_base::in | std::ios_base::binary);\n\n input_stream.push(file);\n while (std::getline(input_stream, line)) {\n auto parse_result = parser(line);\n compiler.Add(parse_result.first, parse_result.second);\n }\n input_stream.reset();\n }\n }\n}\n\ntemplate<typename CompilerType>\nvoid finalize_compile(CompilerType& compiler, std::string& output,\n size_t partition_size = 0, const std::string& manifest = \"\") {\n if (partition_size == 0) {\n std::ofstream out_stream(output, std::ios::binary);\n compiler.Compile(callback);\n try {\n compiler.SetManifestFromString(manifest);\n } catch(boost::property_tree::json_parser::json_parser_error const& error) {\n std::cout << \"Failed to set manifest: \" << manifest << std::endl;\n std::cout << error.what() << std::endl;\n }\n compiler.Write(out_stream);\n out_stream.close();\n } else {\n std::string output_part_zero = output + \".0\";\n int partition_number = 1;\n std::ofstream out_stream(output_part_zero, std::ios::binary);\n\n while (compiler.CompileNext(partition_size, out_stream, 2, callback)) {\n std::cout << \"Finalize partition \" << partition_number << std::endl;\n\n out_stream.close();\n out_stream.open(output + \".\" + std::to_string(partition_number),\n std::ios::binary);\n ++partition_number;\n }\n\n out_stream.close();\n }\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_integer(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::IntValueStoreWithInnerWeights> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, uint32_t>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n\n if (tab == std::string::npos)\n return std::pair<std::string, uint32_t>();\n\n std::string key = line.substr(0, tab);\n std::string value_as_string = line.substr(tab + 1);\n uint32_t value;\n\n try {\n value = boost::lexical_cast<uint32_t>(value_as_string);\n } catch (boost::bad_lexical_cast const&) {\n std::cout << \"Error: value was not valid: \" << line << std::endl;\n return std::pair<std::string, uint32_t>();\n }\n return std::pair<std::string, uint32_t>(key, value);\n };\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_strings(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::StringValueStore> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, std::string>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n if (tab == std::string::npos)\n return std::pair<std::string, std::string>();\n\n std::string key = line.substr(0, tab);\n std::string value = line.substr(tab + 1);\n\n return std::pair<std::string, std::string>(key, value);\n };\n\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_key_only(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, uint32_t>(std::string)> parser = [] (std::string line) {\n\n std::string key = line;\n size_t tab = line.find('\\t');\n\n if (tab != std::string::npos) {\n key = line.substr(0, tab);\n }\n\n return std::pair<std::string, uint32_t>(key, 0);\n };\n\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_json(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::JsonValueStore> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, std::string>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n if (tab == std::string::npos)\n return std::pair<std::string, std::string>();\n\n std::string key = line.substr(0, tab);\n std::string value = line.substr(tab + 1);\n\n return std::pair<std::string, std::string>(key, value);\n };\n\n compile_multiple(compiler, parser, input);\n\n \/\/input_stream.\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\n\/** Extracts the value store parameters. *\/\nvs_param_t extract_value_store_parameters(\n const boost::program_options::variables_map& vm) {\n vs_param_t ret;\n for (auto& v : vm[\"value-store-parameter\"].as<std::vector <std::string> >()) {\n std::vector<std::string> key_value;\n boost::split(key_value, v, boost::is_any_of(\"=\"));\n if (key_value.size() == 2) {\n ret[key_value[0]] = key_value[1];\n } else {\n throw std::invalid_argument(\"Invalid value store parameter format: \" + v);\n }\n }\n return ret;\n}\n\nint main(int argc, char** argv) {\n std::vector<std::string> input_files;\n std::string output_file;\n\n boost::program_options::options_description description(\n \"keyvi compiler options:\");\n\n description.add_options()(\"help,h\", \"Display this help message\")(\n \"version,v\", \"Display the version number\");\n\n description.add_options()(\"input-file,i\",\n boost::program_options::value<std::vector<std::string>>(),\n \"input file\");\n description.add_options()(\"output-file,o\",\n boost::program_options::value<std::string>(),\n \"output file\");\n description.add_options()(\"memory-limit,m\",\n boost::program_options::value<size_t>(),\n \"amount of main memory to use\");\n description.add_options()(\n \"dictionary-type,d\",\n boost::program_options::value<std::string>()->default_value(\"integer\"),\n \"type of dictionary (integer (default), string, key-only, json)\");\n description.add_options()(\"partition-size,p\",\n boost::program_options::value<size_t>(),\n \"create partitions with a maximum size\");\n description.add_options()(\"compact,c\", \"Compact Mode\");\n description.add_options()(\n \"value-store-parameter,V\",\n boost::program_options::value< std::vector<std::string> >()->default_value(std::vector<std::string>(), \"EMPTY\")->composing(),\n \"A value store option; format is -V xxx=yyy\");\n\n description.add_options()(\n \"manifest\",\n boost::program_options::value<std::string>()->default_value(\"\"),\n \"manifest to be embedded\");\n\n \/\/ Declare which options are positional\n boost::program_options::positional_options_description p;\n p.add(\"input-file\", -1);\n\n boost::program_options::variables_map vm;\n boost::program_options::store(\n boost::program_options::command_line_parser(argc, argv).options(\n description).run(),\n vm);\n boost::program_options::notify(vm);\n\n \/\/ parse positional options\n boost::program_options::store(\n boost::program_options::command_line_parser(argc, argv).options(\n description).positional(p).run(),\n vm);\n boost::program_options::notify(vm);\n if (vm.count(\"help\")) {\n std::cout << description;\n return 0;\n }\n\n size_t memory_limit = 1073741824;\n if (vm.count(\"memory-limit\")) {\n memory_limit = vm[\"memory-limit\"].as<size_t>();\n }\n\n bool compact = false;\n if (vm.count(\"compact\")) {\n compact = true;\n }\n\n size_t partition_size = 0;\n if (vm.count(\"partition-size\")) {\n partition_size = vm[\"partition-size\"].as<size_t>();\n }\n\n std::string manifest = vm[\"manifest\"].as<std::string>();\n std::cout << manifest << std::endl;\n\n vs_param_t value_store_params = extract_value_store_parameters(vm);\n\n if (vm.count(\"input-file\") && vm.count(\"output-file\")) {\n input_files = vm[\"input-file\"].as<std::vector<std::string>>();\n output_file = vm[\"output-file\"].as<std::string>();\n\n std::string dictionary_type = vm[\"dictionary-type\"].as<std::string>();\n if (dictionary_type == \"integer\") {\n if (compact){\n compile_integer<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_integer(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"string\") {\n if (compact){\n compile_strings<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_strings(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"key-only\") {\n if (compact){\n compile_key_only<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_key_only(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"json\") {\n if (compact){\n compile_json<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_json(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else {\n std::cout << \"ERROR: unknown dictionary type.\" << std::endl << std::endl;\n std::cout << description;\n return 1;\n }\n } else {\n std::cout << \"ERROR: arguments wrong or missing.\" << std::endl << std::endl;\n std::cout << description;\n return 1;\n }\n\n return 0;\n}\n<commit_msg>is_any_of -> equal_to<commit_after>\/\/\n\/\/ keyvi - A key value store.\n\/\/\n\/\/ Copyright 2015 Hendrik Muhs<hendrik.muhs@gmail.com>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\/*\n * keyvicompiler.cpp\n *\n * Created on: May 13, 2014\n * Author: hendrik\n *\/\n\n#include <boost\/program_options.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/iostreams\/device\/file.hpp>\n#include <boost\/iostreams\/filtering_stream.hpp>\n#include <boost\/iostreams\/filter\/gzip.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/range\/iterator_range.hpp>\n#include \"dictionary\/dictionary_compiler.h\"\n#include \"dictionary\/fsa\/internal\/sparse_array_persistence.h\"\n#include \"dictionary\/fsa\/internal\/int_value_store.h\"\n#include \"dictionary\/fsa\/internal\/string_value_store.h\"\n#include \"dictionary\/fsa\/internal\/json_value_store.h\"\n\ntypedef keyvi::dictionary::fsa::internal::IValueStoreWriter::vs_param_t vs_param_t;\n\nvoid callback (size_t added, size_t overall, void*) {\n std::cout << \"Processed \" << added << \"\/\" << overall << \"(\" << ((100 * added) \/ overall) << \"%).\" << std::endl;\n}\n\ntemplate<typename CompilerType, typename ValueType>\nvoid compile_multiple(CompilerType& compiler, std::function<std::pair<std::string, ValueType>(std::string)> parser,\n std::vector<std::string>& inputs)\n{\n boost::iostreams::filtering_istream input_stream;\n std::string line;\n\n for (auto input_as_string : inputs) {\n auto input = boost::filesystem::path(input_as_string);\n\n if(boost::filesystem::is_directory(input)) {\n int files_added = 0;\n for(auto& entry : boost::make_iterator_range(boost::filesystem::directory_iterator(input), {})) {\n if (entry.path().extension() == \".gz\") {\n input_stream.push(boost::iostreams::gzip_decompressor());\n }\n\n boost::iostreams::file_source file(entry.path().string(), std::ios_base::in | std::ios_base::binary);\n input_stream.push(file);\n ++files_added;\n while (std::getline(input_stream, line)) {\n\n auto parse_result = parser(line);\n if (parse_result.first.size() == 0) {\n continue;\n }\n\n compiler.Add(parse_result.first, parse_result.second);\n }\n input_stream.reset();\n }\n\n } else {\n if (input.extension() == \".gz\"){\n input_stream.push(boost::iostreams::gzip_decompressor());\n }\n\n boost::iostreams::file_source file(input.string(), std::ios_base::in | std::ios_base::binary);\n\n input_stream.push(file);\n while (std::getline(input_stream, line)) {\n auto parse_result = parser(line);\n compiler.Add(parse_result.first, parse_result.second);\n }\n input_stream.reset();\n }\n }\n}\n\ntemplate<typename CompilerType>\nvoid finalize_compile(CompilerType& compiler, std::string& output,\n size_t partition_size = 0, const std::string& manifest = \"\") {\n if (partition_size == 0) {\n std::ofstream out_stream(output, std::ios::binary);\n compiler.Compile(callback);\n try {\n compiler.SetManifestFromString(manifest);\n } catch(boost::property_tree::json_parser::json_parser_error const& error) {\n std::cout << \"Failed to set manifest: \" << manifest << std::endl;\n std::cout << error.what() << std::endl;\n }\n compiler.Write(out_stream);\n out_stream.close();\n } else {\n std::string output_part_zero = output + \".0\";\n int partition_number = 1;\n std::ofstream out_stream(output_part_zero, std::ios::binary);\n\n while (compiler.CompileNext(partition_size, out_stream, 2, callback)) {\n std::cout << \"Finalize partition \" << partition_number << std::endl;\n\n out_stream.close();\n out_stream.open(output + \".\" + std::to_string(partition_number),\n std::ios::binary);\n ++partition_number;\n }\n\n out_stream.close();\n }\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_integer(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::IntValueStoreWithInnerWeights> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, uint32_t>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n\n if (tab == std::string::npos)\n return std::pair<std::string, uint32_t>();\n\n std::string key = line.substr(0, tab);\n std::string value_as_string = line.substr(tab + 1);\n uint32_t value;\n\n try {\n value = boost::lexical_cast<uint32_t>(value_as_string);\n } catch (boost::bad_lexical_cast const&) {\n std::cout << \"Error: value was not valid: \" << line << std::endl;\n return std::pair<std::string, uint32_t>();\n }\n return std::pair<std::string, uint32_t>(key, value);\n };\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_strings(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::StringValueStore> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, std::string>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n if (tab == std::string::npos)\n return std::pair<std::string, std::string>();\n\n std::string key = line.substr(0, tab);\n std::string value = line.substr(tab + 1);\n\n return std::pair<std::string, std::string>(key, value);\n };\n\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_key_only(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, uint32_t>(std::string)> parser = [] (std::string line) {\n\n std::string key = line;\n size_t tab = line.find('\\t');\n\n if (tab != std::string::npos) {\n key = line.substr(0, tab);\n }\n\n return std::pair<std::string, uint32_t>(key, 0);\n };\n\n compile_multiple(compiler, parser, input);\n\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\ntemplate<class BucketT = uint32_t>\nvoid compile_json(std::vector<std::string>& input, std::string& output,\n size_t memory_limit, size_t partition_size = 0,\n const std::string& manifest = \"\",\n const vs_param_t& value_store_params = vs_param_t()) {\n keyvi::dictionary::DictionaryCompiler<\n keyvi::dictionary::fsa::internal::SparseArrayPersistence<BucketT>,\n keyvi::dictionary::fsa::internal::JsonValueStore> compiler(\n memory_limit, value_store_params);\n\n std::function<std::pair<std::string, std::string>(std::string)> parser = [] (std::string line) {\n size_t tab = line.find('\\t');\n if (tab == std::string::npos)\n return std::pair<std::string, std::string>();\n\n std::string key = line.substr(0, tab);\n std::string value = line.substr(tab + 1);\n\n return std::pair<std::string, std::string>(key, value);\n };\n\n compile_multiple(compiler, parser, input);\n\n \/\/input_stream.\n finalize_compile(compiler, output, partition_size, manifest);\n}\n\n\/** Extracts the value store parameters. *\/\nvs_param_t extract_value_store_parameters(\n const boost::program_options::variables_map& vm) {\n vs_param_t ret;\n for (auto& v : vm[\"value-store-parameter\"].as<std::vector <std::string> >()) {\n std::vector<std::string> key_value;\n boost::split(key_value, v, std::bind1st(std::equal_to<char>(), '='));\n if (key_value.size() == 2) {\n ret[key_value[0]] = key_value[1];\n } else {\n throw std::invalid_argument(\"Invalid value store parameter format: \" + v);\n }\n }\n return ret;\n}\n\nint main(int argc, char** argv) {\n std::vector<std::string> input_files;\n std::string output_file;\n\n boost::program_options::options_description description(\n \"keyvi compiler options:\");\n\n description.add_options()(\"help,h\", \"Display this help message\")(\n \"version,v\", \"Display the version number\");\n\n description.add_options()(\"input-file,i\",\n boost::program_options::value<std::vector<std::string>>(),\n \"input file\");\n description.add_options()(\"output-file,o\",\n boost::program_options::value<std::string>(),\n \"output file\");\n description.add_options()(\"memory-limit,m\",\n boost::program_options::value<size_t>(),\n \"amount of main memory to use\");\n description.add_options()(\n \"dictionary-type,d\",\n boost::program_options::value<std::string>()->default_value(\"integer\"),\n \"type of dictionary (integer (default), string, key-only, json)\");\n description.add_options()(\"partition-size,p\",\n boost::program_options::value<size_t>(),\n \"create partitions with a maximum size\");\n description.add_options()(\"compact,c\", \"Compact Mode\");\n description.add_options()(\n \"value-store-parameter,V\",\n boost::program_options::value< std::vector<std::string> >()->default_value(std::vector<std::string>(), \"EMPTY\")->composing(),\n \"A value store option; format is -V xxx=yyy\");\n\n description.add_options()(\n \"manifest\",\n boost::program_options::value<std::string>()->default_value(\"\"),\n \"manifest to be embedded\");\n\n \/\/ Declare which options are positional\n boost::program_options::positional_options_description p;\n p.add(\"input-file\", -1);\n\n boost::program_options::variables_map vm;\n boost::program_options::store(\n boost::program_options::command_line_parser(argc, argv).options(\n description).run(),\n vm);\n boost::program_options::notify(vm);\n\n \/\/ parse positional options\n boost::program_options::store(\n boost::program_options::command_line_parser(argc, argv).options(\n description).positional(p).run(),\n vm);\n boost::program_options::notify(vm);\n if (vm.count(\"help\")) {\n std::cout << description;\n return 0;\n }\n\n size_t memory_limit = 1073741824;\n if (vm.count(\"memory-limit\")) {\n memory_limit = vm[\"memory-limit\"].as<size_t>();\n }\n\n bool compact = false;\n if (vm.count(\"compact\")) {\n compact = true;\n }\n\n size_t partition_size = 0;\n if (vm.count(\"partition-size\")) {\n partition_size = vm[\"partition-size\"].as<size_t>();\n }\n\n std::string manifest = vm[\"manifest\"].as<std::string>();\n std::cout << manifest << std::endl;\n\n vs_param_t value_store_params = extract_value_store_parameters(vm);\n\n if (vm.count(\"input-file\") && vm.count(\"output-file\")) {\n input_files = vm[\"input-file\"].as<std::vector<std::string>>();\n output_file = vm[\"output-file\"].as<std::string>();\n\n std::string dictionary_type = vm[\"dictionary-type\"].as<std::string>();\n if (dictionary_type == \"integer\") {\n if (compact){\n compile_integer<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_integer(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"string\") {\n if (compact){\n compile_strings<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_strings(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"key-only\") {\n if (compact){\n compile_key_only<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_key_only(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else if (dictionary_type == \"json\") {\n if (compact){\n compile_json<uint16_t>(input_files, output_file, memory_limit,\n partition_size, manifest, value_store_params);\n } else {\n compile_json(input_files, output_file, memory_limit, partition_size,\n manifest, value_store_params);\n }\n } else {\n std::cout << \"ERROR: unknown dictionary type.\" << std::endl << std::endl;\n std::cout << description;\n return 1;\n }\n } else {\n std::cout << \"ERROR: arguments wrong or missing.\" << std::endl << std::endl;\n std::cout << description;\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ITER_DROPWHILE_H_\n#define ITER_DROPWHILE_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n template <typename FilterFunc, typename Container>\n class DropWhile;\n\n template <typename FilterFunc, typename Container>\n DropWhile<FilterFunc, Container> dropwhile(FilterFunc, Container&&);\n\n template <typename FilterFunc, typename T>\n DropWhile<FilterFunc, std::initializer_list<T>> dropwhile(\n FilterFunc, std::initializer_list<T>);\n\n template <typename FilterFunc, typename Container>\n class DropWhile {\n private:\n Container container;\n FilterFunc filter_func;\n\n friend DropWhile dropwhile<FilterFunc, Container>(\n FilterFunc, Container&&);\n\n template <typename FF, typename T>\n friend DropWhile<FF, std::initializer_list<T>> dropwhile(\n FF, std::initializer_list<T>);\n \n DropWhile(FilterFunc in_filter_func, Container&& in_container)\n : container(std::forward<Container>(in_container)),\n filter_func(in_filter_func)\n { }\n\n public:\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n private:\n iterator_type<Container> sub_iter;\n iterator_type<Container> sub_end;\n DerefHolder<iterator_deref<Container>> item;\n FilterFunc *filter_func;\n\n void inc_sub_iter() {\n ++this->sub_iter;\n if (this->sub_iter != this->sub_end) {\n this->item.reset(*this->sub_iter);\n }\n }\n\n \/\/ skip all values for which the predicate is true\n void skip_passes() { \n while (this->sub_iter != this->sub_end\n && (*this->filter_func)(this->item.get())) {\n this->inc_sub_iter();\n }\n }\n\n public:\n Iterator(iterator_type<Container>&& iter,\n iterator_type<Container>&& end,\n FilterFunc& in_filter_func)\n : sub_iter{std::move(iter)},\n sub_end{std::move(end)},\n filter_func(&in_filter_func)\n { \n if (this->sub_iter != this->sub_end) {\n this->item.reset(*this->sub_iter);\n }\n this->skip_passes();\n } \n\n iterator_deref<Container> operator*() {\n return this->item.pull();\n }\n\n Iterator& operator++() { \n this->inc_sub_iter();\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n };\n\n template <typename FilterFunc, typename Container>\n DropWhile<FilterFunc, Container> dropwhile(\n FilterFunc filter_func, Container&& container) {\n return {filter_func, std::forward<Container>(container)};\n }\n\n template <typename FilterFunc, typename T>\n DropWhile<FilterFunc, std::initializer_list<T>> dropwhile(\n FilterFunc filter_func, std::initializer_list<T> il)\n {\n return {filter_func, std::move(il)};\n }\n}\n\n#endif\n<commit_msg>dropwhile uses get() instead of pull()<commit_after>#ifndef ITER_DROPWHILE_H_\n#define ITER_DROPWHILE_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n template <typename FilterFunc, typename Container>\n class DropWhile;\n\n template <typename FilterFunc, typename Container>\n DropWhile<FilterFunc, Container> dropwhile(FilterFunc, Container&&);\n\n template <typename FilterFunc, typename T>\n DropWhile<FilterFunc, std::initializer_list<T>> dropwhile(\n FilterFunc, std::initializer_list<T>);\n\n template <typename FilterFunc, typename Container>\n class DropWhile {\n private:\n Container container;\n FilterFunc filter_func;\n\n friend DropWhile dropwhile<FilterFunc, Container>(\n FilterFunc, Container&&);\n\n template <typename FF, typename T>\n friend DropWhile<FF, std::initializer_list<T>> dropwhile(\n FF, std::initializer_list<T>);\n \n DropWhile(FilterFunc in_filter_func, Container&& in_container)\n : container(std::forward<Container>(in_container)),\n filter_func(in_filter_func)\n { }\n\n public:\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n private:\n using Holder = DerefHolder<iterator_deref<Container>>;\n iterator_type<Container> sub_iter;\n iterator_type<Container> sub_end;\n Holder item;\n FilterFunc *filter_func;\n\n void inc_sub_iter() {\n ++this->sub_iter;\n if (this->sub_iter != this->sub_end) {\n this->item.reset(*this->sub_iter);\n }\n }\n\n \/\/ skip all values for which the predicate is true\n void skip_passes() { \n while (this->sub_iter != this->sub_end\n && (*this->filter_func)(this->item.get())) {\n this->inc_sub_iter();\n }\n }\n\n public:\n Iterator(iterator_type<Container>&& iter,\n iterator_type<Container>&& end,\n FilterFunc& in_filter_func)\n : sub_iter{std::move(iter)},\n sub_end{std::move(end)},\n filter_func(&in_filter_func)\n { \n if (this->sub_iter != this->sub_end) {\n this->item.reset(*this->sub_iter);\n }\n this->skip_passes();\n } \n\n typename Holder::reference operator*() {\n return this->item.get();\n }\n\n Iterator& operator++() { \n this->inc_sub_iter();\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container),\n this->filter_func};\n }\n\n };\n\n template <typename FilterFunc, typename Container>\n DropWhile<FilterFunc, Container> dropwhile(\n FilterFunc filter_func, Container&& container) {\n return {filter_func, std::forward<Container>(container)};\n }\n\n template <typename FilterFunc, typename T>\n DropWhile<FilterFunc, std::initializer_list<T>> dropwhile(\n FilterFunc filter_func, std::initializer_list<T> il)\n {\n return {filter_func, std::move(il)};\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"j1App.h\"\n#include \"j1Textures.h\"\n#include \"j1Input.h\"\n#include \"j1Render.h\"\n#include \"j1Collision.h\"\n#include \"j1Player.h\"\n#include \"p2Log.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Gui.h\"\n#include \"j1Scene.h\"\n#include \"j1Audio.h\"\n#include \"j1entityManager.h\"\n#include \"j1Transitions.h\"\n#include \"j1PathFinding.h\"\n#include \"Brofiler\\Brofiler.h\"\n\n#include<stdio.h>\n\n\/\/ Reference at https:\/\/www.youtube.com\/watch?v=OEhmUuehGOA\n\nj1Player::j1Player() : Entity(\"player\")\n{\n\tname.create(\"player\");\n\n\t\/\/ Animations\n\tjump_cloud = LoadAnimation(\"animations\/player.tmx\", \"jump_cloud\");\n\tcloud_offset.x = -16;\n\tcloud_offset.y = 17;\n\n\tSSJ_aura = LoadAnimation(\"animations\/player.tmx\", \"SSJ_aura\");\n\taura_offset.x = -7;\n\taura_offset.y = -12;\n\n\ttype = PLAYER;\n}\n\nj1Player::~j1Player()\n{\n\tApp->tex->UnLoad(graphics);\n\tgraphics = nullptr;\n\tApp->tex->UnLoad(graphics_god);\n\tgraphics_god = nullptr;\n}\n\n\/\/ Load assets\nbool j1Player::Start()\n{\n\tLOG(\"Loading player\");\n\n\tif (graphics == nullptr)\n\t\tgraphics = App->tex->Load(\"textures\/character\/Character spritesheet.png\");\n\n\tif (graphics_god == nullptr)\n\t\tgraphics_god = App->tex->Load(\"textures\/character\/godmode_spritesheet.png\");\n\n\tif (collider == nullptr)\n\t\tcollider = App->collision->AddCollider({ 0, 0, 15, 29 }, COLLIDER_PLAYER, this);\n\telse\n\t\tcollider->SetPos(0, 0);\n\n\tcollider_offset.x = 3;\n\tcollider_offset.y = 2;\n\n\tcollidingFloor = nullptr;\n\tcolliding_bottom = false;\n\tcolliding_left = false;\n\tcolliding_right = false;\n\n\tgoing_right = false;\n\tgoing_left = false;\n\tgoing_down = false;\n\tjumping = false;\n\n\tdead = false;\n\tsound_one_time = false;\n\tloading = false;\n\twon = false;\n\n\told_savedCol = nullptr;\n\n\tv.x = 0;\n\tv.y = 0;\n\n\tif (lives <= 0)\n\t{\n\t\tscore = 0;\n\t\tlives = 3;\n\t\tcoins[0] = coins[1] = coins[2] = false;\n\t}\n\n\tanimation = idle_right;\n\n\tvirtualPosition.x = position.x;\n\tvirtualPosition.y = position.y;\n\n\tif (step_fx == 0)\n\t\tstep_fx = App->audio->LoadFx(\"audio\/fx\/step.wav\");\n\tif (jump_fx == 0)\n\t\tjump_fx = App->audio->LoadFx(\"audio\/fx\/jump.wav\");\n\tif (double_jump_fx == 0)\n\t\tdouble_jump_fx = App->audio->LoadFx(\"audio\/fx\/double_jump.wav\");\n\tif (landing_fx == 0)\n\t\tlanding_fx = App->audio->LoadFx(\"audio\/fx\/landing.wav\");\n\tif (die_fx == 0)\n\t\tdie_fx = App->audio->LoadFx(\"audio\/fx\/die.wav\");\n\tif (SSJ_transformation == 0)\n\t\tSSJ_transformation = App->audio->LoadFx(\"audio\/fx\/SSJ_transformation.wav\");\n\tif (SSJ_off == 0)\n\t\tSSJ_off = App->audio->LoadFx(\"audio\/fx\/SSJ_off.wav\");\n\tif (killed_fx == 0)\n\t\tkilled_fx = App->audio->LoadFx(\"audio\/fx\/killed_by_enemy.wav\");\n\n\treturn true;\n}\n\n\/\/ Update: draw background\nbool j1Player::Update(float dt)\n{\n\tBROFILER_CATEGORY(\"Player Update\", Profiler::Color::Red);\n\n\tif (!dead)\n\t{\n\t\tif (App->input->GetKey(SDL_SCANCODE_F10) == KEY_DOWN)\n\t\t{\n\t\t\tif (App->entityManager->player_god_mode)\n\t\t\t{\n\t\t\t\tApp->entityManager->player_god_mode = false;\n\t\t\t\tApp->audio->PlayFx(SSJ_off, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->entityManager->player_god_mode = true;\n\t\t\t\tApp->audio->PlayFx(SSJ_transformation, 0);\n\t\t\t}\n\t\t}\n\n\t\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t\t{\n\t\t\tv.x = -speed;\n\t\t\tgoing_left = true;\n\t\t\tif (state != JUMPING && state != DEAD)\n\t\t\t{\n\t\t\t\tstate = LEFT;\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_A) == KEY_UP)\n\t\t{\n\t\t\tgoing_left = false;\n\t\t\tif (state == LEFT)\n\t\t\t{\n\t\t\t\tv.x = 0;\n\t\t\t\tstate = IDLE;\n\t\t\t}\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_DOWN)\n\t\t{\n\t\t\tv.x = speed;\n\t\t\tgoing_right = true;\n\t\t\tif (state != JUMPING && state != DEAD)\n\t\t\t{\n\t\t\t\tstate = RIGHT;\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_D) == KEY_UP)\n\t\t{\n\t\t\tgoing_right = false;\n\t\t\tif (state == RIGHT)\n\t\t\t{\n\t\t\t\tv.x = 0;\n\t\t\t\tstate = IDLE;\n\t\t\t}\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_DOWN)\n\t\t{\n\t\t\tjumping = true;\n\t\t\tif (!double_jump)\n\t\t\t{\n\t\t\t\tif (state == JUMPING || state == FALLING)\n\t\t\t\t{\n\t\t\t\t\tdouble_jump = true;\n\t\t\t\t\tcloud_pos.x = position.x + cloud_offset.x;\n\t\t\t\t\tcloud_pos.y = position.y + cloud_offset.y;\n\t\t\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\t\t\tif (state == FALLING)\n\t\t\t\t\t{\n\t\t\t\t\t\tstate = JUMPING;\n\t\t\t\t\t}\n\t\t\t\t\tApp->audio->PlayFx(double_jump_fx, 0);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tv.y = jump_force;\n\t\t\t\t\tstate = JUMPING;\n\t\t\t\t\tApp->audio->PlayFx(jump_fx, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_UP)\n\t\t{\n\t\t\t\/\/ If player release space in mid jump, the character won't reach max height\n\t\t\tif (!double_jump && v.y > (jump_force * 2 \/ 3) \/ 2)\n\t\t\t{\n\t\t\t\tv.y = (jump_force * 2 \/ 3) \/ 2;\n\t\t\t}\n\t\t}\n\t}\n\tif (v.x != 0 && colliding_bottom && SDL_GetTicks() > step_time)\n\t{\n\t\tApp->audio->PlayFx(step_fx, 0);\n\t\tstep_time = SDL_GetTicks() + (1 \/ right->speed) + 450;\n\t}\n\n\treturn true;\n}\n\nbool j1Player::PostUpdate(float dt)\n{\n\tif (!dead)\n\t{\n\t\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_REPEAT && !colliding_right && v.x == 0)\n\t\t{\n\t\t\tv.x = speed;\n\t\t\tstate = RIGHT;\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_REPEAT && !colliding_left && v.x == 0)\n\t\t{\n\t\t\tv.x = -speed;\n\t\t\tstate = LEFT;\n\t\t}\n\t}\n\tif (App->paused)\n\t{\n\t\tv.x = 0;\n\t\tstate = IDLE;\n\t}\n\n\t\/\/ Win condition\n\tif ((((collider->rect.x + collider->rect.w) > App->scene->current_lvl->data->end_rect.x) && (position.y + collider->rect.h) < (App->scene->current_lvl->data->end_rect.y + App->scene->current_lvl->data->end_rect.h)) && !won && !loading)\n\t{\n\t\tif (end_reached == 0)\n\t\t{\n\t\t\twon = true;\n\t\t\tloading = true;\n\t\t\tApp->uiScene->pauseChronos();\n\t\t\tend_reached = SDL_GetTicks();\n\t\t\tif (App->scene->current_lvl == (App->scene->levels.end->prev))\n\t\t\t{\n\t\t\t\tApp->audio->PlayFx(App->scene->win_fx, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->audio->PlayFx(App->scene->complete_level_fx, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!App->paused)\n\t{\n\t\tif (won && loading && ((App->scene->current_lvl != App->scene->levels.end && SDL_GetTicks() > end_reached + 500)))\n\t\t{\n\t\t\tend_reached = 0;\n\t\t\twon = false;\n\t\t\tdead = false;\n\t\t\tApp->transitions->sceneTransition(0);\n\t\t}\n\n\t\t\/\/ Lose condition\n\t\t\/\/By enemyy\n\t\tif (dead && SDL_GetTicks() > killed_finished + 1500 && !won && loading)\n\t\t{\n\t\t\tloading = false;\n\t\t\tif (lives > 0)\n\t\t\t{\n\t\t\t\tApp->transitions->sceneTransition(App->scene->current_lvl->data->lvl);\n\t\t\t\tApp->scene->respawn_enemies = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->setSaveFileLoadable(false);\n\t\t\t\tApp->transitions->sceneTransition(1);\n\t\t\t}\n\n\t\t\tkilled_finished = 0;\n\t\t}\n\t\t\/\/By falling\n\t\tint win_scale = App->win->GetScale();\n\t\tif (position.y > App->win->screen_surface->h \/ win_scale + 50 && !won && !dead)\n\t\t{\n\t\t\tif (App->entityManager->player_god_mode)\n\t\t\t{\n\t\t\t\tApp->LoadGame(true);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlives--;\n\t\t\t\tdead = true;\n\n\t\t\t\tif (lives > 0)\n\t\t\t\t{\n\t\t\t\t\tApp->transitions->sceneTransition(App->scene->current_lvl->data->lvl);\n\t\t\t\t\tApp->scene->respawn_enemies = false;\n\t\t\t\t\tApp->audio->PlayFx(killed_fx, 0);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tApp->setSaveFileLoadable(false);\n\t\t\t\t\tApp->transitions->sceneTransition(1);\n\t\t\t\t\tApp->audio->PlayFx(die_fx, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse if (dead)\n\t{\n\t\tkilled_finished += dt * 1000;\n\t}\n\n\t\/\/When f10 is clicked he converts into super sayan (god mode)\n\tif (App->entityManager->player_god_mode)\n\t{\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura->GetCurrentFrame(dt));\n\t\tApp->render->Blit(graphics_god, position.x, position.y, &animation->GetCurrentFrame(dt));\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura->GetCurrentFrame(dt));\n\t}\n\telse if (App->entityManager->player_god_mode == false)\n\t{\n\t\tApp->render->Blit(graphics, position.x, position.y, &animation->GetCurrentFrame(dt));\n\t}\n\n\tif (double_jump)\n\t{\n\t\tApp->render->Blit(graphics, cloud_pos.x, cloud_pos.y, &jump_cloud->GetCurrentFrame(dt));\n\t}\n\n\treturn true;\n}\n\nvoid j1Player::OnCollision(Collider* c1, Collider* c2)\n{\n\tif (c2->type == COLLIDER_FLOOR || c2->type == COLLIDER_JUMPABLE)\n\t{\n\t\tif (Collision_from_bottom(c1, c2))\n\t\t{\n\t\t\tdouble_jump = false;\n\t\t\tjump_cloud->Reset();\n\t\t}\n\t}\n\n\t\/\/If player touches the charger he must die, if the player hits the bat from the top the bat must die\n\tif (!dead && c2->type == COLLIDER_ENEMY)\n\t{\n\t\tp2SString c2_name = c2->callback->name.GetString();\n\t\tif (c2_name == \"bat\" && Collision_from_bottom(c1, c2, 3) && v.y < 0)\n\t\t{\n\t\t\tscore += 250;\n\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\tc2->entity->dead = true;\n\t\t}\n\t\telse if (!App->entityManager->player_god_mode && (c2_name == \"charger\" || (c2_name == \"bat\" && !c2->entity->dead && !Collision_from_bottom(c1, c2, 3))))\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tdead = true;\n\t\t\tloading = true;\n\t\t\tif (!sound_one_time && killed_finished == 0)\n\t\t\t{\n\t\t\t\tlives--;\n\t\t\t\tkilled_finished = SDL_GetTicks();\n\t\t\t\tsound_one_time = true;\n\t\t\t\tif (lives > 0)\n\t\t\t\t\tApp->audio->PlayFx(killed_fx, 0);\n\t\t\t\telse\n\t\t\t\t\tApp->audio->PlayFx(die_fx, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tEntity_OnCollision(c1, c2);\n}\n\nbool j1Player::Load(pugi::xml_node& data)\n{\n\tApp->scene->respawn_enemies = false;\n\tApp->scene->LoadLvl(data.attribute(\"level\").as_int());\n\tlives = data.attribute(\"lives\").as_uint();\n\tvirtualPosition.x = data.attribute(\"position_x\").as_int();\n\tvirtualPosition.y = data.attribute(\"position_y\").as_int();\n\tcoins[0] = data.attribute(\"coin1\").as_bool();\n\tcoins[1] = data.attribute(\"coin2\").as_bool();\n\tcoins[2] = data.attribute(\"coin3\").as_bool();\n\tApp->render->virtualCamPos = -(virtualPosition.x * (int)App->win->GetScale() - 300);\n\tif (App->render->virtualCamPos > 0)\n\t{\n\t\tApp->render->virtualCamPos = 0;\n\t}\n\tif (App->render->virtualCamPos < App->scene->max_camera_pos)\n\t{\n\t\tApp->render->virtualCamPos = App->scene->max_camera_pos;\n\t}\n\n\treturn true;\n}\n\nbool j1Player::Save(pugi::xml_node& data) const\n{\n\tdata.append_attribute(\"position_x\") = position.x;\n\n\tdata.append_attribute(\"position_y\") = position.y - 8;\n\n\tdata.append_attribute(\"level\") = App->scene->current_lvl->data->lvl;\n\n\tdata.append_attribute(\"lives\") = lives;\n\n\tdata.append_attribute(\"coin1\") = coins[0];\n\n\tdata.append_attribute(\"coin2\") = coins[1];\n\n\tdata.append_attribute(\"coin3\") = coins[2];\n\n\treturn true;\n}<commit_msg>solved a bug with player load file<commit_after>#include \"j1App.h\"\n#include \"j1Textures.h\"\n#include \"j1Input.h\"\n#include \"j1Render.h\"\n#include \"j1Collision.h\"\n#include \"j1Player.h\"\n#include \"p2Log.h\"\n#include \"j1Window.h\"\n#include \"j1Map.h\"\n#include \"j1Gui.h\"\n#include \"j1Scene.h\"\n#include \"j1Audio.h\"\n#include \"j1entityManager.h\"\n#include \"j1Transitions.h\"\n#include \"j1PathFinding.h\"\n#include \"Brofiler\\Brofiler.h\"\n\n#include<stdio.h>\n\n\/\/ Reference at https:\/\/www.youtube.com\/watch?v=OEhmUuehGOA\n\nj1Player::j1Player() : Entity(\"player\")\n{\n\tname.create(\"player\");\n\n\t\/\/ Animations\n\tjump_cloud = LoadAnimation(\"animations\/player.tmx\", \"jump_cloud\");\n\tcloud_offset.x = -16;\n\tcloud_offset.y = 17;\n\n\tSSJ_aura = LoadAnimation(\"animations\/player.tmx\", \"SSJ_aura\");\n\taura_offset.x = -7;\n\taura_offset.y = -12;\n\n\ttype = PLAYER;\n}\n\nj1Player::~j1Player()\n{\n\tApp->tex->UnLoad(graphics);\n\tgraphics = nullptr;\n\tApp->tex->UnLoad(graphics_god);\n\tgraphics_god = nullptr;\n}\n\n\/\/ Load assets\nbool j1Player::Start()\n{\n\tLOG(\"Loading player\");\n\n\tif (graphics == nullptr)\n\t\tgraphics = App->tex->Load(\"textures\/character\/Character spritesheet.png\");\n\n\tif (graphics_god == nullptr)\n\t\tgraphics_god = App->tex->Load(\"textures\/character\/godmode_spritesheet.png\");\n\n\tif (collider == nullptr)\n\t\tcollider = App->collision->AddCollider({ 0, 0, 15, 29 }, COLLIDER_PLAYER, this);\n\telse\n\t\tcollider->SetPos(0, 0);\n\n\tcollider_offset.x = 3;\n\tcollider_offset.y = 2;\n\n\tcollidingFloor = nullptr;\n\tcolliding_bottom = false;\n\tcolliding_left = false;\n\tcolliding_right = false;\n\n\tgoing_right = false;\n\tgoing_left = false;\n\tgoing_down = false;\n\tjumping = false;\n\n\tdead = false;\n\tsound_one_time = false;\n\tloading = false;\n\twon = false;\n\n\told_savedCol = nullptr;\n\n\tv.x = 0;\n\tv.y = 0;\n\n\tif (lives <= 0)\n\t{\n\t\tscore = 0;\n\t\tlives = 3;\n\t\tcoins[0] = coins[1] = coins[2] = false;\n\t}\n\n\tanimation = idle_right;\n\n\tvirtualPosition.x = position.x;\n\tvirtualPosition.y = position.y;\n\n\tif (step_fx == 0)\n\t\tstep_fx = App->audio->LoadFx(\"audio\/fx\/step.wav\");\n\tif (jump_fx == 0)\n\t\tjump_fx = App->audio->LoadFx(\"audio\/fx\/jump.wav\");\n\tif (double_jump_fx == 0)\n\t\tdouble_jump_fx = App->audio->LoadFx(\"audio\/fx\/double_jump.wav\");\n\tif (landing_fx == 0)\n\t\tlanding_fx = App->audio->LoadFx(\"audio\/fx\/landing.wav\");\n\tif (die_fx == 0)\n\t\tdie_fx = App->audio->LoadFx(\"audio\/fx\/die.wav\");\n\tif (SSJ_transformation == 0)\n\t\tSSJ_transformation = App->audio->LoadFx(\"audio\/fx\/SSJ_transformation.wav\");\n\tif (SSJ_off == 0)\n\t\tSSJ_off = App->audio->LoadFx(\"audio\/fx\/SSJ_off.wav\");\n\tif (killed_fx == 0)\n\t\tkilled_fx = App->audio->LoadFx(\"audio\/fx\/killed_by_enemy.wav\");\n\n\treturn true;\n}\n\n\/\/ Update: draw background\nbool j1Player::Update(float dt)\n{\n\tBROFILER_CATEGORY(\"Player Update\", Profiler::Color::Red);\n\n\tif (!dead)\n\t{\n\t\tif (App->input->GetKey(SDL_SCANCODE_F10) == KEY_DOWN)\n\t\t{\n\t\t\tif (App->entityManager->player_god_mode)\n\t\t\t{\n\t\t\t\tApp->entityManager->player_god_mode = false;\n\t\t\t\tApp->audio->PlayFx(SSJ_off, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->entityManager->player_god_mode = true;\n\t\t\t\tApp->audio->PlayFx(SSJ_transformation, 0);\n\t\t\t}\n\t\t}\n\n\t\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_DOWN)\n\t\t{\n\t\t\tv.x = -speed;\n\t\t\tgoing_left = true;\n\t\t\tif (state != JUMPING && state != DEAD)\n\t\t\t{\n\t\t\t\tstate = LEFT;\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_A) == KEY_UP)\n\t\t{\n\t\t\tgoing_left = false;\n\t\t\tif (state == LEFT)\n\t\t\t{\n\t\t\t\tv.x = 0;\n\t\t\t\tstate = IDLE;\n\t\t\t}\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_DOWN)\n\t\t{\n\t\t\tv.x = speed;\n\t\t\tgoing_right = true;\n\t\t\tif (state != JUMPING && state != DEAD)\n\t\t\t{\n\t\t\t\tstate = RIGHT;\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_D) == KEY_UP)\n\t\t{\n\t\t\tgoing_right = false;\n\t\t\tif (state == RIGHT)\n\t\t\t{\n\t\t\t\tv.x = 0;\n\t\t\t\tstate = IDLE;\n\t\t\t}\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_DOWN)\n\t\t{\n\t\t\tjumping = true;\n\t\t\tif (!double_jump)\n\t\t\t{\n\t\t\t\tif (state == JUMPING || state == FALLING)\n\t\t\t\t{\n\t\t\t\t\tdouble_jump = true;\n\t\t\t\t\tcloud_pos.x = position.x + cloud_offset.x;\n\t\t\t\t\tcloud_pos.y = position.y + cloud_offset.y;\n\t\t\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\t\t\tif (state == FALLING)\n\t\t\t\t\t{\n\t\t\t\t\t\tstate = JUMPING;\n\t\t\t\t\t}\n\t\t\t\t\tApp->audio->PlayFx(double_jump_fx, 0);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tv.y = jump_force;\n\t\t\t\t\tstate = JUMPING;\n\t\t\t\t\tApp->audio->PlayFx(jump_fx, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if (App->input->GetKey(SDL_SCANCODE_SPACE) == KEY_UP)\n\t\t{\n\t\t\t\/\/ If player release space in mid jump, the character won't reach max height\n\t\t\tif (!double_jump && v.y > (jump_force * 2 \/ 3) \/ 2)\n\t\t\t{\n\t\t\t\tv.y = (jump_force * 2 \/ 3) \/ 2;\n\t\t\t}\n\t\t}\n\t}\n\tif (v.x != 0 && colliding_bottom && SDL_GetTicks() > step_time)\n\t{\n\t\tApp->audio->PlayFx(step_fx, 0);\n\t\tstep_time = SDL_GetTicks() + (1 \/ right->speed) + 450;\n\t}\n\n\treturn true;\n}\n\nbool j1Player::PostUpdate(float dt)\n{\n\tif (!dead)\n\t{\n\t\tif (App->input->GetKey(SDL_SCANCODE_D) == KEY_REPEAT && !colliding_right && v.x == 0)\n\t\t{\n\t\t\tv.x = speed;\n\t\t\tstate = RIGHT;\n\t\t}\n\t\tif (App->input->GetKey(SDL_SCANCODE_A) == KEY_REPEAT && !colliding_left && v.x == 0)\n\t\t{\n\t\t\tv.x = -speed;\n\t\t\tstate = LEFT;\n\t\t}\n\t}\n\tif (App->paused)\n\t{\n\t\tv.x = 0;\n\t\tstate = IDLE;\n\t}\n\n\t\/\/ Win condition\n\tif ((((collider->rect.x + collider->rect.w) > App->scene->current_lvl->data->end_rect.x) && (position.y + collider->rect.h) < (App->scene->current_lvl->data->end_rect.y + App->scene->current_lvl->data->end_rect.h)) && !won && !loading)\n\t{\n\t\tif (end_reached == 0)\n\t\t{\n\t\t\twon = true;\n\t\t\tloading = true;\n\t\t\tApp->uiScene->pauseChronos();\n\t\t\tend_reached = SDL_GetTicks();\n\t\t\tif (App->scene->current_lvl == (App->scene->levels.end->prev))\n\t\t\t{\n\t\t\t\tApp->audio->PlayFx(App->scene->win_fx, 0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->audio->PlayFx(App->scene->complete_level_fx, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!App->paused)\n\t{\n\t\tif (won && loading && ((App->scene->current_lvl != App->scene->levels.end && SDL_GetTicks() > end_reached + 500)))\n\t\t{\n\t\t\tend_reached = 0;\n\t\t\twon = false;\n\t\t\tdead = false;\n\t\t\tApp->transitions->sceneTransition(0);\n\t\t}\n\n\t\t\/\/ Lose condition\n\t\t\/\/By enemyy\n\t\tif (dead && SDL_GetTicks() > killed_finished + 1500 && !won && loading)\n\t\t{\n\t\t\tloading = false;\n\t\t\tif (lives > 0)\n\t\t\t{\n\t\t\t\tApp->transitions->sceneTransition(App->scene->current_lvl->data->lvl);\n\t\t\t\tApp->scene->respawn_enemies = false;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tApp->setSaveFileLoadable(false);\n\t\t\t\tApp->transitions->sceneTransition(1);\n\t\t\t}\n\n\t\t\tkilled_finished = 0;\n\t\t}\n\t\t\/\/By falling\n\t\tint win_scale = App->win->GetScale();\n\t\tif (position.y > App->win->screen_surface->h \/ win_scale + 50 && !won && !dead)\n\t\t{\n\t\t\tif (App->entityManager->player_god_mode)\n\t\t\t{\n\t\t\t\tApp->LoadGame(true);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlives--;\n\t\t\t\tdead = true;\n\n\t\t\t\tif (lives > 0)\n\t\t\t\t{\n\t\t\t\t\tApp->transitions->sceneTransition(App->scene->current_lvl->data->lvl);\n\t\t\t\t\tApp->scene->respawn_enemies = false;\n\t\t\t\t\tApp->audio->PlayFx(killed_fx, 0);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tApp->setSaveFileLoadable(false);\n\t\t\t\t\tApp->transitions->sceneTransition(1);\n\t\t\t\t\tApp->audio->PlayFx(die_fx, 0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\telse if (dead)\n\t{\n\t\tkilled_finished += dt * 1000;\n\t}\n\n\t\/\/When f10 is clicked he converts into super sayan (god mode)\n\tif (App->entityManager->player_god_mode)\n\t{\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura->GetCurrentFrame(dt));\n\t\tApp->render->Blit(graphics_god, position.x, position.y, &animation->GetCurrentFrame(dt));\n\t\tApp->render->Blit(graphics_god, position.x + aura_offset.x, position.y + aura_offset.y, &SSJ_aura->GetCurrentFrame(dt));\n\t}\n\telse if (App->entityManager->player_god_mode == false)\n\t{\n\t\tApp->render->Blit(graphics, position.x, position.y, &animation->GetCurrentFrame(dt));\n\t}\n\n\tif (double_jump)\n\t{\n\t\tApp->render->Blit(graphics, cloud_pos.x, cloud_pos.y, &jump_cloud->GetCurrentFrame(dt));\n\t}\n\n\treturn true;\n}\n\nvoid j1Player::OnCollision(Collider* c1, Collider* c2)\n{\n\tif (c2->type == COLLIDER_FLOOR || c2->type == COLLIDER_JUMPABLE)\n\t{\n\t\tif (Collision_from_bottom(c1, c2))\n\t\t{\n\t\t\tdouble_jump = false;\n\t\t\tjump_cloud->Reset();\n\t\t}\n\t}\n\n\t\/\/If player touches the charger he must die, if the player hits the bat from the top the bat must die\n\tif (!dead && c2->type == COLLIDER_ENEMY)\n\t{\n\t\tp2SString c2_name = c2->callback->name.GetString();\n\t\tif (c2_name == \"bat\" && Collision_from_bottom(c1, c2, 3) && v.y < 0)\n\t\t{\n\t\t\tscore += 250;\n\t\t\tv.y = (jump_force * 2 \/ 3);\n\t\t\tc2->entity->dead = true;\n\t\t}\n\t\telse if (!App->entityManager->player_god_mode && (c2_name == \"charger\" || (c2_name == \"bat\" && !c2->entity->dead && !Collision_from_bottom(c1, c2, 3))))\n\t\t{\n\t\t\tv.x = 0;\n\t\t\tdead = true;\n\t\t\tloading = true;\n\t\t\tif (!sound_one_time && killed_finished == 0)\n\t\t\t{\n\t\t\t\tlives--;\n\t\t\t\tkilled_finished = SDL_GetTicks();\n\t\t\t\tsound_one_time = true;\n\t\t\t\tif (lives > 0)\n\t\t\t\t\tApp->audio->PlayFx(killed_fx, 0);\n\t\t\t\telse\n\t\t\t\t\tApp->audio->PlayFx(die_fx, 0);\n\t\t\t}\n\t\t}\n\t}\n\n\tEntity_OnCollision(c1, c2);\n}\n\nbool j1Player::Load(pugi::xml_node& data)\n{\n\tlives = data.attribute(\"lives\").as_uint();\n\tscore = data.attribute(\"score\").as_int();\n\tcoins[0] = data.attribute(\"coin1\").as_bool();\n\tcoins[1] = data.attribute(\"coin2\").as_bool();\n\tcoins[2] = data.attribute(\"coin3\").as_bool();\n\tApp->scene->respawn_enemies = false;\n\tApp->scene->LoadLvl(data.attribute(\"level\").as_int());\n\tvirtualPosition.x = data.attribute(\"position_x\").as_int();\n\tvirtualPosition.y = data.attribute(\"position_y\").as_int();\n\tApp->render->virtualCamPos = -(virtualPosition.x * (int)App->win->GetScale() - 300);\n\tif (App->render->virtualCamPos > 0)\n\t{\n\t\tApp->render->virtualCamPos = 0;\n\t}\n\tif (App->render->virtualCamPos < App->scene->max_camera_pos)\n\t{\n\t\tApp->render->virtualCamPos = App->scene->max_camera_pos;\n\t}\n\n\treturn true;\n}\n\nbool j1Player::Save(pugi::xml_node& data) const\n{\n\tdata.append_attribute(\"position_x\") = position.x;\n\n\tdata.append_attribute(\"position_y\") = position.y - 8;\n\n\tdata.append_attribute(\"level\") = App->scene->current_lvl->data->lvl;\n\n\tdata.append_attribute(\"lives\") = lives;\n\n\tdata.append_attribute(\"score\") = score;\n\n\tdata.append_attribute(\"coin1\") = coins[0];\n\n\tdata.append_attribute(\"coin2\") = coins[1];\n\n\tdata.append_attribute(\"coin3\") = coins[2];\n\n\treturn true;\n}<|endoftext|>"} {"text":"<commit_before>\nusing System;\nint a = 100;\n\nif (int a != 600)\n{\n\nproject element static[object(slider) {\n\tslider.static.Movable.object(for {user::prefs} meta::element)\n} if [[element.slider: IOerror(pre: set, re-set: center)].post:'.\/makefile'];\nelse [[ property.element(construct::meta, _init_, propert: null, event: (ev:EventArgs()))\n\t\t]]\n\t try:\n\t const InitUI init;\n\n\n}\nnamespace userAuth\n{\n\t[SystemProperty]\n\t public class Property\n\t {\n\t\tSystemProperty property;\n\n\t\t[define]\n\t\t public enum ForEachProperty ()\n\t\t {\n\t\t\tconst property = DefineProperty.Android.StoreValue ();\n\t\t }\n\t };\n\n}\n\n<commit_msg>Modify File property.cpp<commit_after>\nusing System;\nint a = 100;\n\nif (int a != 600)\n{\n\nproject element static[object(slider) {\n\tslider.static.Movable.object(for {user::prefs} meta::element)\n} if [[element.slider: IOerror(pre: set, re-set: center)].post:'.\/makefile'];\nelse [[ property.element(construct::meta, _init_, propert: null, event: (ev:EventArgs()))\n\t\t]]\n\t try:\n\t const InitUI init;\n\n\n}\nnamespace userAuth\n{\n\t[SystemProperty]\n\t public class Property\n\t {\n\t\tSystemProperty property;\n\n\t\t[define]\n\t\t public enum ForEachProperty ()\n\t\t {\n\t\t\tconst property = DefineProperty.Android.StoreValue ();\n\t\t }\n\t\tcout << (\"This is System Property Element\") + property\n\t };\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * keyframe_object.cpp\n *\n * Copyright (c) 2014 Gareth Cross, Chao Qu. All rights reserved.\n *\/\n\n#include <rviz_ba_viewer\/keyframe_object.hpp>\n\n#include <OGRE\/OgreManualObject.h>\n#include <OGRE\/OgreSceneManager.h>\n#include <OGRE\/OgreSceneNode.h>\n\nOgre::TexturePtr textureFromMat(const cv::Mat& mat, const std::string& name) {\n assert(!mat.empty());\n \/\/ place mat data into a stream for ogre\n Ogre::TexturePtr texture;\n Ogre::DataStreamPtr data_stream;\n data_stream.bind(new Ogre::MemoryDataStream((void *)mat.data,\n mat.total() * mat.elemSize()));\n\n const Ogre::String res_group =\n Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME;\n Ogre::TextureManager &texture_manager = Ogre::TextureManager::getSingleton();\n \/\/ swap byte order when going to Ogre\n texture = texture_manager.loadRawData(name, res_group, data_stream,\n mat.cols, mat.rows,\n Ogre::PF_B8G8R8, Ogre::TEX_TYPE_2D, 0);\n \/\/std::cout << \"Created texture with dims: \" << mat.cols << \",\" << mat.rows << \"\\n\";\n return texture;\n}\n\nKeyFrameObject::KeyFrameObject(Ogre::SceneManager * scene_manager, int id) :\n id_(id), scene_manager_(scene_manager) {\n \n \/\/ create objects and nodes\n scene_node_ = scene_manager_->createSceneNode();\n scene_node_->setVisible(true);\n frustum_object_= scene_manager_->createManualObject();\n plane_object_ = scene_manager_->createManualObject();\n scene_node_->attachObject(frustum_object_);\n scene_node_->attachObject(plane_object_);\n \n \/\/ create a material\n const Ogre::String& group = \n Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME;\n Ogre::MaterialManager& man = Ogre::MaterialManager::getSingleton();\n \/\/ some boring settings...\n material_ = man.create(\"kf_mat_\" + std::to_string(id), group);\n material_->setReceiveShadows(false);\n material_->getTechnique(0)->setLightingEnabled(false);\n material_->setCullingMode(Ogre::CULL_NONE);\n material_->setDepthWriteEnabled(true);\n material_->setSceneBlending(Ogre::SBT_TRANSPARENT_ALPHA);\n \/\/material_->setSceneBlending(Ogre::SBT_REPLACE);\n \/\/material_->setDepthBias(-16.0f, 0.0f); \n \n frustum_material_ = man.create(\"kf_mat_frust_\" + std::to_string(id), group);\n frustum_material_->setReceiveShadows(false);\n frustum_material_->getTechnique(0)->setLightingEnabled(false);\n frustum_material_->setCullingMode(Ogre::CULL_NONE);\n frustum_material_->setDepthWriteEnabled(true);\n frustum_material_->setSceneBlending(Ogre::SBT_TRANSPARENT_ALPHA);\n}\n\nKeyFrameObject::~KeyFrameObject() {\n \/\/ teardown ogre objects\n scene_node_->detachAllObjects();\n scene_manager_->destroySceneNode(scene_node_);\n scene_manager_->destroyManualObject(frustum_object_);\n scene_manager_->destroyManualObject(plane_object_);\n}\n\nvoid KeyFrameObject::setImage(const cv::Mat& image) {\n image_ = image;\n \/\/ also re-create the ogre texture\n texture_ = textureFromMat(image, \"kf_tex_\" + std::to_string(id_));\n \/\/std::cout << \"Created texture \" << texture_->getName() << \"\\n\";\n \/\/std::cout << \"Dimensions: \" << texture_->getWidth() << \",\"\n \/\/ << texture_->getHeight() << std::endl;\n dirty_ = true;\n}\n\nvoid KeyFrameObject::setCameraModel(\n const image_geometry::PinholeCameraModel& model,\n int width, int height) {\n cam_model_ = model;\n width_ = width;\n height_ = height;\n dirty_ = true;\n}\n\nvoid KeyFrameObject::setPose(const Ogre::Vector3& position,\n const Ogre::Quaternion& orientation) {\n scene_node_->setPosition(position);\n scene_node_->setOrientation(orientation);\n}\n\nvoid KeyFrameObject::setColor(const Ogre::Vector4& color) { \n if (color_ != color) {\n color_ = color;\n dirty_ = true;\n }\n}\n\nvoid KeyFrameObject::setImageEnabled(bool imageEnabled) {\n if (imageEnabled != imageEnabled_) {\n imageEnabled_ = imageEnabled;\n dirty_ = true;\n }\n}\n\nvoid KeyFrameObject::createGeometry() {\n if (!dirty_) {\n return; \/\/ no need to re-create geometry\n }\n dirty_ = false;\n \n const double fx = cam_model_.fx(), fy = cam_model_.fy();\n const double cx = cam_model_.cx(), cy = cam_model_.cy();\n \/\/ generate coordinates of the frustum\n Ogre::Vector3 points[] = {{0,0,1}, \/\/ top left\n {0,height_,1}, \/\/ bottom left\n {width_,height_,1}, \/\/ bottom right\n {width_,0,1}}; \/\/ top right\n for (int i=0; i < 4; i++) {\n points[i].x = (points[i].x - cx) \/ fx;\n points[i].y = (points[i].y - cy) \/ fy;\n }\n const Ogre::Vector3 centre(0,0,0); \/\/ optical centre\n \n frustum_object_->setRenderQueueGroup(Ogre::RENDER_QUEUE_MAIN);\n frustum_object_->begin(frustum_material_->getName(),\n Ogre::RenderOperation::OT_LINE_LIST);\n {\n frustum_object_->colour(color_.x,color_.y,color_.z,color_.w);\n \/\/ left side\n frustum_object_->position(points[0]);\n frustum_object_->position(centre);\n frustum_object_->position(centre);\n frustum_object_->position(points[1]);\n \/\/ right side\n frustum_object_->position(points[2]);\n frustum_object_->position(centre);\n frustum_object_->position(centre);\n frustum_object_->position(points[3]);\n \/\/ front rectangle\n for (int i=0; i < 4; i++) {\n frustum_object_->position(points[i]);\n frustum_object_->position(points[(i+1) % 4]);\n }\n }\n frustum_object_->end();\n \n if (imageEnabled_ && texture_->isLoaded()) {\n \/\/ now the textured quad w\/ our image\n \/\/ first set up the material for textured drawing\n Ogre::Pass * pass = material_->getTechnique(0)->getPass(0);\n Ogre::TextureUnitState * tex_unit;\n if (pass->getNumTextureUnitStates() > 0) {\n tex_unit = pass->getTextureUnitState(0);\n } else {\n tex_unit = pass->createTextureUnitState();\n }\n tex_unit->setTextureName(texture_->getName());\n tex_unit->setTextureFiltering(Ogre::TFO_BILINEAR);\n tex_unit->setAlphaOperation(Ogre::LBX_SOURCE1, Ogre::LBS_MANUAL,\n Ogre::LBS_CURRENT, color_.w); \/\/ use alpha\n \n plane_object_->setRenderQueueGroup(Ogre::RENDER_QUEUE_MAIN);\n plane_object_->begin(material_->getName(),\n Ogre::RenderOperation::OT_TRIANGLE_LIST);\n {\n \/\/plane_object_->colour(1.0,0,0,1);\n plane_object_->position(points[0]); \/\/ top left\n plane_object_->textureCoord(0,0);\n \n plane_object_->position(points[1]); \/\/ bottom left\n plane_object_->textureCoord(0,1);\n \n plane_object_->position(points[2]); \/\/ bottom right\n plane_object_->textureCoord(1,1);\n \n plane_object_->position(points[2]); \/\/ bottom right\n plane_object_->textureCoord(1,1);\n \n plane_object_->position(points[3]); \/\/ top right\n plane_object_->textureCoord(1,0);\n \n plane_object_->position(points[0]); \/\/ top left\n plane_object_->textureCoord(0,0);\n }\n plane_object_->end();\n } else {\n plane_object_->clear(); \/\/ lazy: just clear it for now\n }\n}\n<commit_msg>Fixed null pointer crash<commit_after>\/*\n * keyframe_object.cpp\n *\n * Copyright (c) 2014 Gareth Cross, Chao Qu. All rights reserved.\n *\/\n\n#include <rviz_ba_viewer\/keyframe_object.hpp>\n\n#include <OGRE\/OgreManualObject.h>\n#include <OGRE\/OgreSceneManager.h>\n#include <OGRE\/OgreSceneNode.h>\n\nOgre::TexturePtr textureFromMat(const cv::Mat& mat, const std::string& name) {\n assert(!mat.empty());\n \/\/ place mat data into a stream for ogre\n Ogre::TexturePtr texture;\n Ogre::DataStreamPtr data_stream;\n data_stream.bind(new Ogre::MemoryDataStream((void *)mat.data,\n mat.total() * mat.elemSize()));\n\n const Ogre::String res_group =\n Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME;\n Ogre::TextureManager &texture_manager = Ogre::TextureManager::getSingleton();\n \/\/ swap byte order when going to Ogre\n texture = texture_manager.loadRawData(name, res_group, data_stream,\n mat.cols, mat.rows,\n Ogre::PF_B8G8R8, Ogre::TEX_TYPE_2D, 0);\n \/\/std::cout << \"Created texture with dims: \" << mat.cols << \",\" << mat.rows << \"\\n\";\n return texture;\n}\n\nKeyFrameObject::KeyFrameObject(Ogre::SceneManager * scene_manager, int id) :\n id_(id), scene_manager_(scene_manager) {\n \n \/\/ create objects and nodes\n scene_node_ = scene_manager_->createSceneNode();\n scene_node_->setVisible(true);\n frustum_object_= scene_manager_->createManualObject();\n plane_object_ = scene_manager_->createManualObject();\n scene_node_->attachObject(frustum_object_);\n scene_node_->attachObject(plane_object_);\n \n \/\/ create a material\n const Ogre::String& group = \n Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME;\n Ogre::MaterialManager& man = Ogre::MaterialManager::getSingleton();\n \/\/ some boring settings...\n material_ = man.create(\"kf_mat_\" + std::to_string(id), group);\n material_->setReceiveShadows(false);\n material_->getTechnique(0)->setLightingEnabled(false);\n material_->setCullingMode(Ogre::CULL_NONE);\n material_->setDepthWriteEnabled(true);\n material_->setSceneBlending(Ogre::SBT_TRANSPARENT_ALPHA);\n \/\/material_->setSceneBlending(Ogre::SBT_REPLACE);\n \/\/material_->setDepthBias(-16.0f, 0.0f); \n \n frustum_material_ = man.create(\"kf_mat_frust_\" + std::to_string(id), group);\n frustum_material_->setReceiveShadows(false);\n frustum_material_->getTechnique(0)->setLightingEnabled(false);\n frustum_material_->setCullingMode(Ogre::CULL_NONE);\n frustum_material_->setDepthWriteEnabled(true);\n frustum_material_->setSceneBlending(Ogre::SBT_TRANSPARENT_ALPHA);\n}\n\nKeyFrameObject::~KeyFrameObject() {\n \/\/ teardown ogre objects\n scene_node_->detachAllObjects();\n scene_manager_->destroySceneNode(scene_node_);\n scene_manager_->destroyManualObject(frustum_object_);\n scene_manager_->destroyManualObject(plane_object_);\n}\n\nvoid KeyFrameObject::setImage(const cv::Mat& image) {\n image_ = image;\n \/\/ also re-create the ogre texture\n texture_ = textureFromMat(image, \"kf_tex_\" + std::to_string(id_));\n \/\/std::cout << \"Created texture \" << texture_->getName() << \"\\n\";\n \/\/std::cout << \"Dimensions: \" << texture_->getWidth() << \",\"\n \/\/ << texture_->getHeight() << std::endl;\n dirty_ = true;\n}\n\nvoid KeyFrameObject::setCameraModel(\n const image_geometry::PinholeCameraModel& model,\n int width, int height) {\n cam_model_ = model;\n width_ = width;\n height_ = height;\n dirty_ = true;\n}\n\nvoid KeyFrameObject::setPose(const Ogre::Vector3& position,\n const Ogre::Quaternion& orientation) {\n scene_node_->setPosition(position);\n scene_node_->setOrientation(orientation);\n}\n\nvoid KeyFrameObject::setColor(const Ogre::Vector4& color) { \n if (color_ != color) {\n color_ = color;\n dirty_ = true;\n }\n}\n\nvoid KeyFrameObject::setImageEnabled(bool imageEnabled) {\n if (imageEnabled != imageEnabled_) {\n imageEnabled_ = imageEnabled;\n dirty_ = true;\n }\n}\n\nvoid KeyFrameObject::createGeometry() {\n if (!dirty_) {\n return; \/\/ no need to re-create geometry\n }\n dirty_ = false;\n \n const double fx = cam_model_.fx(), fy = cam_model_.fy();\n const double cx = cam_model_.cx(), cy = cam_model_.cy();\n \/\/ generate coordinates of the frustum\n Ogre::Vector3 points[] = {{0,0,1}, \/\/ top left\n {0,height_,1}, \/\/ bottom left\n {width_,height_,1}, \/\/ bottom right\n {width_,0,1}}; \/\/ top right\n for (int i=0; i < 4; i++) {\n points[i].x = (points[i].x - cx) \/ fx;\n points[i].y = (points[i].y - cy) \/ fy;\n }\n const Ogre::Vector3 centre(0,0,0); \/\/ optical centre\n \n frustum_object_->setRenderQueueGroup(Ogre::RENDER_QUEUE_MAIN);\n frustum_object_->begin(frustum_material_->getName(),\n Ogre::RenderOperation::OT_LINE_LIST);\n {\n frustum_object_->colour(color_.x,color_.y,color_.z,color_.w);\n \/\/ left side\n frustum_object_->position(points[0]);\n frustum_object_->position(centre);\n frustum_object_->position(centre);\n frustum_object_->position(points[1]);\n \/\/ right side\n frustum_object_->position(points[2]);\n frustum_object_->position(centre);\n frustum_object_->position(centre);\n frustum_object_->position(points[3]);\n \/\/ front rectangle\n for (int i=0; i < 4; i++) {\n frustum_object_->position(points[i]);\n frustum_object_->position(points[(i+1) % 4]);\n }\n }\n frustum_object_->end();\n \n if (imageEnabled_ && !texture_.isNull() && texture_->isLoaded()) {\n \/\/ now the textured quad w\/ our image\n \/\/ first set up the material for textured drawing\n Ogre::Pass * pass = material_->getTechnique(0)->getPass(0);\n Ogre::TextureUnitState * tex_unit;\n if (pass->getNumTextureUnitStates() > 0) {\n tex_unit = pass->getTextureUnitState(0);\n } else {\n tex_unit = pass->createTextureUnitState();\n }\n tex_unit->setTextureName(texture_->getName());\n tex_unit->setTextureFiltering(Ogre::TFO_BILINEAR);\n tex_unit->setAlphaOperation(Ogre::LBX_SOURCE1, Ogre::LBS_MANUAL,\n Ogre::LBS_CURRENT, color_.w); \/\/ use alpha\n \n plane_object_->setRenderQueueGroup(Ogre::RENDER_QUEUE_MAIN);\n plane_object_->begin(material_->getName(),\n Ogre::RenderOperation::OT_TRIANGLE_LIST);\n {\n \/\/plane_object_->colour(1.0,0,0,1);\n plane_object_->position(points[0]); \/\/ top left\n plane_object_->textureCoord(0,0);\n \n plane_object_->position(points[1]); \/\/ bottom left\n plane_object_->textureCoord(0,1);\n \n plane_object_->position(points[2]); \/\/ bottom right\n plane_object_->textureCoord(1,1);\n \n plane_object_->position(points[2]); \/\/ bottom right\n plane_object_->textureCoord(1,1);\n \n plane_object_->position(points[3]); \/\/ top right\n plane_object_->textureCoord(1,0);\n \n plane_object_->position(points[0]); \/\/ top left\n plane_object_->textureCoord(0,0);\n }\n plane_object_->end();\n } else {\n plane_object_->clear(); \/\/ lazy: just clear it for now\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * Copyright (C) 2009 by Lothar May *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the *\n * Free Software Foundation, Inc., *\n * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *\n ***************************************************************************\/\n\n#include <net\/downloaderthread.h>\n#include <net\/downloadhelper.h>\n#include <net\/netexception.h>\n#include <boost\/filesystem.hpp>\n#include <core\/loghelper.h>\n\n#include <fstream>\n#include <algorithm>\n\n#define DOWNLOAD_DELAY_MSEC\t\t\t\t\t10\n\nusing namespace std;\nusing namespace boost::filesystem;\n\n\nDownloaderThread::DownloaderThread()\n: m_downloadInProgress(false)\n{\n\tm_downloadHelper.reset(new DownloadHelper());\n}\n\nDownloaderThread::~DownloaderThread()\n{\n}\n\nvoid\nDownloaderThread::QueueDownload(unsigned downloadId, const std::string &url, const std::string &filename)\n{\n\tboost::mutex::scoped_lock lock(m_downloadQueueMutex);\n\tm_downloadQueue.push(DownloadData(downloadId, url, filename));\n}\n\nbool\nDownloaderThread::HasDownloadResult() const\n{\n\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\treturn !m_downloadDoneQueue.empty();\n}\n\nbool\nDownloaderThread::GetDownloadResult(unsigned &downloadId, std::vector<unsigned char> &filedata)\n{\n\tbool result = false;\n\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\tif (!m_downloadDoneQueue.empty())\n\t{\n\t\tconst ResultData &d = m_downloadDoneQueue.front();\n\t\tdownloadId = d.id;\n\t\tfiledata = d.data;\n\t\tm_downloadDoneQueue.pop();\n\t\tresult = true;\n\t}\n\treturn result;\n}\n\nvoid\nDownloaderThread::Main()\n{\n\twhile (!ShouldTerminate())\n\t{\n\t\ttry\n\t\t{\n\t\t\tif (m_downloadInProgress)\n\t\t\t{\n\t\t\t\tm_downloadInProgress = !m_downloadHelper->Process();\n\t\t\t}\n\n\t\t\tif (!m_downloadInProgress)\n\t\t\t{\n\t\t\t\t\/\/ Previous download was finished.\n\t\t\t\tif (m_curDownloadData)\n\t\t\t\t{\n\t\t\t\t\tpath filepath(m_curDownloadData->filename);\n\t\t\t\t\tifstream instream(filepath.file_string().c_str(), ios_base::in | ios_base::binary);\n\t\t\t\t\tvector<unsigned char> fileData;\n\t\t\t\t\tcopy(istream_iterator<unsigned char>(instream), istream_iterator<unsigned char>(), back_inserter(fileData));\n\t\t\t\t\tinstream.close();\n\t\t\t\t\tremove(filepath);\n\n\t\t\t\t\t{\n\t\t\t\t\t\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\t\t\t\t\t\tm_downloadDoneQueue.push(ResultData(m_curDownloadData->id, fileData));\n\t\t\t\t\t}\n\t\t\t\t\tm_curDownloadData.reset();\n\t\t\t\t}\n\n\t\t\t\t\/\/ Take a break.\n\t\t\t\tMsleep(DOWNLOAD_DELAY_MSEC);\n\n\t\t\t\t\/\/ Start next download.\n\t\t\t\t{\n\t\t\t\t\tboost::mutex::scoped_lock lock(m_downloadQueueMutex);\n\t\t\t\t\tif (!m_downloadQueue.empty())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_curDownloadData.reset(new DownloadData(m_downloadQueue.front()));\n\t\t\t\t\t\tm_downloadQueue.pop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (m_curDownloadData && !m_curDownloadData->filename.empty())\n\t\t\t\t{\n\t\t\t\t\tLOG_MSG(\"URL: \" + m_curDownloadData->address);\n\t\t\t\t\tLOG_MSG(\"File: \" + filepath.file_string());\n\t\t\t\t\tpath filepath(m_curDownloadData->filename);\n\t\t\t\t\tm_downloadHelper->Init(m_curDownloadData->address, filepath.file_string());\n\t\t\t\t\tm_downloadInProgress = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (const NetException &e)\n\t\t{\n\t\t\tLOG_ERROR(e.what());\n\t\t\tm_downloadInProgress = false;\n\t\t\tm_curDownloadData.reset();\n\t\t}\n\t}\n}\n\n<commit_msg>Fixed logging.<commit_after>\/***************************************************************************\n * Copyright (C) 2009 by Lothar May *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the *\n * Free Software Foundation, Inc., *\n * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *\n ***************************************************************************\/\n\n#include <net\/downloaderthread.h>\n#include <net\/downloadhelper.h>\n#include <net\/netexception.h>\n#include <boost\/filesystem.hpp>\n#include <core\/loghelper.h>\n\n#include <fstream>\n#include <algorithm>\n\n#define DOWNLOAD_DELAY_MSEC\t\t\t\t\t10\n\nusing namespace std;\nusing namespace boost::filesystem;\n\n\nDownloaderThread::DownloaderThread()\n: m_downloadInProgress(false)\n{\n\tm_downloadHelper.reset(new DownloadHelper());\n}\n\nDownloaderThread::~DownloaderThread()\n{\n}\n\nvoid\nDownloaderThread::QueueDownload(unsigned downloadId, const std::string &url, const std::string &filename)\n{\n\tboost::mutex::scoped_lock lock(m_downloadQueueMutex);\n\tm_downloadQueue.push(DownloadData(downloadId, url, filename));\n}\n\nbool\nDownloaderThread::HasDownloadResult() const\n{\n\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\treturn !m_downloadDoneQueue.empty();\n}\n\nbool\nDownloaderThread::GetDownloadResult(unsigned &downloadId, std::vector<unsigned char> &filedata)\n{\n\tbool result = false;\n\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\tif (!m_downloadDoneQueue.empty())\n\t{\n\t\tconst ResultData &d = m_downloadDoneQueue.front();\n\t\tdownloadId = d.id;\n\t\tfiledata = d.data;\n\t\tm_downloadDoneQueue.pop();\n\t\tresult = true;\n\t}\n\treturn result;\n}\n\nvoid\nDownloaderThread::Main()\n{\n\twhile (!ShouldTerminate())\n\t{\n\t\ttry\n\t\t{\n\t\t\tif (m_downloadInProgress)\n\t\t\t{\n\t\t\t\tm_downloadInProgress = !m_downloadHelper->Process();\n\t\t\t}\n\n\t\t\tif (!m_downloadInProgress)\n\t\t\t{\n\t\t\t\t\/\/ Previous download was finished.\n\t\t\t\tif (m_curDownloadData)\n\t\t\t\t{\n\t\t\t\t\tpath filepath(m_curDownloadData->filename);\n\t\t\t\t\tifstream instream(filepath.file_string().c_str(), ios_base::in | ios_base::binary);\n\t\t\t\t\tvector<unsigned char> fileData;\n\t\t\t\t\tcopy(istream_iterator<unsigned char>(instream), istream_iterator<unsigned char>(), back_inserter(fileData));\n\t\t\t\t\tinstream.close();\n\t\t\t\t\tremove(filepath);\n\n\t\t\t\t\t{\n\t\t\t\t\t\tboost::mutex::scoped_lock lock(m_downloadDoneQueueMutex);\n\t\t\t\t\t\tm_downloadDoneQueue.push(ResultData(m_curDownloadData->id, fileData));\n\t\t\t\t\t}\n\t\t\t\t\tm_curDownloadData.reset();\n\t\t\t\t}\n\n\t\t\t\t\/\/ Take a break.\n\t\t\t\tMsleep(DOWNLOAD_DELAY_MSEC);\n\n\t\t\t\t\/\/ Start next download.\n\t\t\t\t{\n\t\t\t\t\tboost::mutex::scoped_lock lock(m_downloadQueueMutex);\n\t\t\t\t\tif (!m_downloadQueue.empty())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_curDownloadData.reset(new DownloadData(m_downloadQueue.front()));\n\t\t\t\t\t\tm_downloadQueue.pop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (m_curDownloadData && !m_curDownloadData->filename.empty())\n\t\t\t\t{\n\t\t\t\t\tpath filepath(m_curDownloadData->filename);\n\t\t\t\t\tLOG_MSG(\"URL: \" + m_curDownloadData->address);\n\t\t\t\t\tLOG_MSG(\"File: \" + filepath.file_string());\n\t\t\t\t\tm_downloadHelper->Init(m_curDownloadData->address, filepath.file_string());\n\t\t\t\t\tm_downloadInProgress = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (const NetException &e)\n\t\t{\n\t\t\tLOG_ERROR(e.what());\n\t\t\tm_downloadInProgress = false;\n\t\t\tm_curDownloadData.reset();\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 - 2021 gary@drinkingtea.net\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <ox\/claw\/claw.hpp>\n#include <nostalgia\/core\/gfx.hpp>\n#include <nostalgia\/core\/gfx.hpp>\n\n#include \"gfx.hpp\"\n\nnamespace nostalgia::core {\n\nstatic ox::Result<ox::Vector<char>> readFile(Context *ctx, const ox::FileAddress &file) noexcept {\n\toxRequire(stat, ctx->rom->stat(file));\n\tox::Vector<char> buff(stat.size);\n\toxReturnError(ctx->rom->read(file, buff.data(), buff.size()));\n\treturn ox::move(buff);\n}\n\ntemplate<typename T>\nox::Result<T> readObj(Context *ctx, const ox::FileAddress &file) noexcept {\n\toxRequire(buff, readFile(ctx, file));\n\tT t;\n\toxReturnError(ox::readClaw(buff.data(), buff.size(), &t));\n\treturn ox::move(t);\n}\n\nox::Error initConsole(Context *ctx) noexcept {\n\tconstexpr auto TilesheetAddr = \"\/TileSheets\/Charset.ng\";\n\tconstexpr auto PaletteAddr = \"\/Palettes\/Charset.npal\";\n\tsetBgStatus(ctx, 0b0001);\n\treturn loadBgTileSheet(ctx, 0, TilesheetAddr, PaletteAddr);\n}\n\nox::Error loadSpriteTileSheet(Context*,\n int,\n ox::FileAddress,\n ox::FileAddress) noexcept {\n\treturn OxError(0);\n}\n\nox::Error loadBgTileSheet(Context *ctx,\n int section,\n ox::FileAddress tilesheetPath,\n ox::FileAddress palettePath) noexcept {\n\toxRequire(tilesheet, readObj<NostalgiaGraphic>(ctx, tilesheetPath));\n\tif (!palettePath) {\n\t\tpalettePath = tilesheet.defaultPalette;\n\t}\n\toxRequire(palette, readObj<NostalgiaPalette>(ctx, palettePath));\n\tconst unsigned bytesPerTile = tilesheet.bpp == 8 ? 64 : 32;\n\tconst auto tiles = tilesheet.pixels.size() \/ bytesPerTile;\n\tconstexpr int width = 8;\n\tconst int height = 8 * tiles;\n\tox::Vector<uint32_t> pixels;\n\tif (bytesPerTile == 64) { \/\/ 8 BPP\n\t\tpixels.resize(tilesheet.pixels.size());\n\t\tfor (std::size_t i = 0; i < tilesheet.pixels.size(); ++i) {\n\t\t\tpixels[i] = toColor32(palette.colors[tilesheet.pixels[i]]);\n\t\t}\n\t} else { \/\/ 4 BPP\n\t\tpixels.resize(tilesheet.pixels.size() * 2);\n\t\tfor (std::size_t i = 0; i < tilesheet.pixels.size(); ++i) {\n\t\t\tpixels[i * 2 + 0] = toColor32(palette.colors[tilesheet.pixels[i] & 0xF]);\n\t\t\tpixels[i * 2 + 1] = toColor32(palette.colors[tilesheet.pixels[i] >> 4]);\n\t\t}\n\t}\n\treturn renderer::loadBgTexture(ctx, section, pixels.data(), width, height);\n}\n\nvoid puts(Context *ctx, int column, int row, const char *str) noexcept {\n\tfor (int i = 0; str[i]; ++i) {\n\t\tsetTile(ctx, 0, column + i, row, static_cast<uint8_t>(charMap[static_cast<int>(str[i])]));\n\t}\n}\n\n}\n<commit_msg>[nostalgia\/core\/userland] Cleanup readObj<commit_after>\/*\n * Copyright 2016 - 2021 gary@drinkingtea.net\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <ox\/claw\/claw.hpp>\n#include <nostalgia\/core\/gfx.hpp>\n#include <nostalgia\/core\/gfx.hpp>\n\n#include \"gfx.hpp\"\n\nnamespace nostalgia::core {\n\ntemplate<typename T>\nstatic ox::Result<T> readObj(Context *ctx, const ox::FileAddress &file) noexcept {\n\toxRequire(buff, ctx->rom->read(file));\n\treturn ox::readClaw<T>(buff);\n}\n\nox::Error initConsole(Context *ctx) noexcept {\n\tconstexpr auto TilesheetAddr = \"\/TileSheets\/Charset.ng\";\n\tconstexpr auto PaletteAddr = \"\/Palettes\/Charset.npal\";\n\tsetBgStatus(ctx, 0b0001);\n\treturn loadBgTileSheet(ctx, 0, TilesheetAddr, PaletteAddr);\n}\n\nox::Error loadSpriteTileSheet(Context*,\n int,\n ox::FileAddress,\n ox::FileAddress) noexcept {\n\treturn OxError(0);\n}\n\nox::Error loadBgTileSheet(Context *ctx,\n int section,\n ox::FileAddress tilesheetPath,\n ox::FileAddress palettePath) noexcept {\n\toxRequire(tilesheet, readObj<NostalgiaGraphic>(ctx, tilesheetPath));\n\tif (!palettePath) {\n\t\tpalettePath = tilesheet.defaultPalette;\n\t}\n\toxRequire(palette, readObj<NostalgiaPalette>(ctx, palettePath));\n\tconst unsigned bytesPerTile = tilesheet.bpp == 8 ? 64 : 32;\n\tconst auto tiles = tilesheet.pixels.size() \/ bytesPerTile;\n\tconstexpr int width = 8;\n\tconst int height = 8 * tiles;\n\tox::Vector<uint32_t> pixels;\n\tif (bytesPerTile == 64) { \/\/ 8 BPP\n\t\tpixels.resize(tilesheet.pixels.size());\n\t\tfor (std::size_t i = 0; i < tilesheet.pixels.size(); ++i) {\n\t\t\tpixels[i] = toColor32(palette.colors[tilesheet.pixels[i]]);\n\t\t}\n\t} else { \/\/ 4 BPP\n\t\tpixels.resize(tilesheet.pixels.size() * 2);\n\t\tfor (std::size_t i = 0; i < tilesheet.pixels.size(); ++i) {\n\t\t\tpixels[i * 2 + 0] = toColor32(palette.colors[tilesheet.pixels[i] & 0xF]);\n\t\t\tpixels[i * 2 + 1] = toColor32(palette.colors[tilesheet.pixels[i] >> 4]);\n\t\t}\n\t}\n\treturn renderer::loadBgTexture(ctx, section, pixels.data(), width, height);\n}\n\nvoid puts(Context *ctx, int column, int row, const char *str) noexcept {\n\tfor (int i = 0; str[i]; ++i) {\n\t\tsetTile(ctx, 0, column + i, row, static_cast<uint8_t>(charMap[static_cast<int>(str[i])]));\n\t}\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * $Id$\n *\n * History:\n *\n * Bernd Wuebben, wuebben@math.cornell.edu:\n *\n * Much of this is taken from the pppd sources in particular\n * \/pppstat\/pppstat.c, and modified to suit the needs of kppp.\n *\n *\n * Here the original history of pppstat.c:\n *\n * perkins@cps.msu.edu: Added compression statistics and alternate\n * display. 11\/94\n *\n * Brad Parker (brad@cayman.com) 6\/92\n *\n * from the original \"slstats\" by Van Jaconson\n *\n * Copyright (c) 1989 Regents of the University of California.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms are permitted\n * provided that the above copyright notice and this paragraph are\n * duplicated in all such forms and that any documentation,\n * advertising materials, and other materials related to such\n * distribution and use acknowledge that the software was developed\n * by the University of California, Berkeley. The name of the\n * University may not be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\n *\tVan Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:\n *\t- Initial distribution.\n *\/\n\n#include <kdefakes.h>\n#include <config.h>\n\n#include <ctype.h>\n#include <errno.h>\n\n#include <stdio.h>\n#include <signal.h>\n#include <fcntl.h>\n#include <sys\/param.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <net\/ppp_defs.h>\n\n#include \"config.h\"\n#include \"config-kppp.h\"\n#include \"pppstats.h\"\n\n#ifndef STREAMS\n #if defined(__linux__) && defined(__powerpc__) \\\n && (__GLIBC__ == 2 && __GLIBC_MINOR__ == 0)\n \/* kludge alert! *\/\n #undef __GLIBC__\n #endif\n #include <sys\/socket.h>\t\t\/* *BSD, Linux, NeXT, Ultrix etc. *\/\n #ifndef HAVE_NET_IF_PPP_H\n #ifdef HAVE_LINUX_IF_PPP_H\n #include <linux\/if.h>\n #include <linux\/if_ppp.h>\n #endif\n #else\n #include <net\/if.h>\n #include <net\/if_ppp.h>\n #endif\n\n#else\t\/* STREAMS *\/\n #include <sys\/socket.h>\n #include <sys\/stropts.h>\t\/* SVR4, Solaris 2, SunOS 4, OSF\/1, etc. *\/\n #include <net\/ppp_defs.h>\n #include <net\/pppio.h>\n #include <net\/if.h>\n #include <sys\/sockio.h>\n\n#endif\t\/* STREAMS *\/\n\n#include <qtimer.h>\n#include <kdebug.h>\n\nPPPStats::PPPStats()\n{\n clear();\n timer = new QTimer;\n connect(timer, SIGNAL(timeout()), SLOT(timerClick()));\n}\n\n\nPPPStats::~PPPStats() {\n stop();\n delete timer;\n}\n\n\nvoid PPPStats::clear()\n{\n ibytes = 0;\n ipackets = 0;\n ibytes_last = 0;\n obytes_last = 0;\n compressedin = 0;\n uncompressedin = 0;\n errorin = 0;\n obytes = 0;\n opackets = 0;\n compressed = 0;\n packetsunc = 0;\n packetsoutunc = 0;\n ioStatus = BytesNone;\n}\n\nvoid PPPStats::timerClick() {\n enum IOStatus newStatus;\n\n doStats();\n\n if((ibytes != ibytes_last) && (obytes != obytes_last))\n newStatus = BytesBoth;\n else if(ibytes != ibytes_last)\n newStatus = BytesIn;\n else if(obytes != obytes_last)\n newStatus = BytesOut;\n else\n newStatus = BytesNone;\n\n if(newStatus != ioStatus)\n emit statsChanged(ioStatus = newStatus);\n\n ibytes_last = ibytes;\n obytes_last = obytes;\n}\n\nvoid PPPStats::setUnit(int u) {\n unit = u;\n sprintf(unitName, \"ppp%d\", unit);\n}\n\n\nvoid PPPStats::start() {\n timer->start(PPP_STATS_INTERVAL);\n}\n\n\nvoid PPPStats::stop() {\n emit statsChanged(BytesNone);\n timer->stop();\n}\n\n\nbool PPPStats::ifIsUp() {\n bool is_up;\n struct ifreq ifr;\n\n#if defined(__svr4__ )\n usleep(1000000); \/\/ Needed for Solaris ?!\n#endif\n\n#ifdef STREAMS\n if ((t = open(\"\/dev\/ppp\", O_RDONLY)) < 0) {\n\tperror(\"pppstats: Couldn't open \/dev\/ppp: \");\n\treturn false;\n }\n if (!strioctl(t, PPPIO_ATTACH, (char*)&unit, sizeof(int), 0)) {\n\tfprintf(stderr, \"pppstats: ppp%d is not available\\n\", unit);\n\t::close(t);\n\treturn false;\n }\n \/\/ TODO: close t somewhere again\n#endif\n if ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n\tperror(\"Couldn't create IP socket\");\n\treturn false;\n }\n\n strlcpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if(ioctl(s, SIOCGIFFLAGS, (caddr_t) &ifr) < 0) {\n if (errno)\n fprintf(stderr, \"Couldn't find interface %s: %s\\n\",\n unitName, strerror(errno));\n\t::close(s);\n\ts = 0;\n\treturn 0;\n }\n\n if ((ifr.ifr_flags & IFF_UP) && (ifr.ifr_flags & IFF_RUNNING)) {\n\tis_up = true;\n\tkDebug(5002) << \"Interface is up\" << endl;\n }\n else{\n is_up = false;\n ::close(s);\n s = 0;\n kDebug(5002) << \"Interface is down\" << endl;\n }\n\n return is_up;\n}\n\n\nbool PPPStats::initStats() {\n\n struct sockaddr_in *sinp;\n struct ifreq ifr;\n\n clear();\n\n strlcpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if (ioctl(s, SIOCGIFADDR, &ifr) < 0) {\n }\n\n sinp = (struct sockaddr_in*)&ifr.ifr_addr;\n\n if(sinp->sin_addr.s_addr)\n local_ip_address = inet_ntoa(sinp->sin_addr);\n else\n local_ip_address = \"\";\n kDebug(5002) << \"Local IP: \" << local_ip_address << endl;\n\n if (ioctl(s, SIOCGIFDSTADDR, &ifr) < 0)\n ;\n\n sinp = (struct sockaddr_in*)&ifr.ifr_dstaddr;\n\n if(sinp->sin_addr.s_addr)\n remote_ip_address = inet_ntoa(sinp->sin_addr);\n else\n remote_ip_address = \"\";\n kDebug(5002) << \"Remote IP: \" << remote_ip_address << endl;\n\n return true;\n\n}\n\n\nbool PPPStats::doStats() {\n struct ppp_stats cur;\n\n if(! get_ppp_stats(&cur)){\n return false;\n }\n\n \/\/ \"in\" \"pack\" \"comp\" \"uncomp\" \"err\"\n \/\/ IN PACK VJCOMP VJUNC VJERR\n\n ibytes = cur.p.ppp_ibytes; \t\t\t\/\/ bytes received\n ipackets = cur.p.ppp_ipackets; \t\t\/\/ packets received\n compressedin = cur.vj.vjs_compressedin; \t\/\/ inbound compressed packets\n uncompressedin = cur.vj.vjs_uncompressedin; \/\/ inbound uncompressed packets\n errorin = cur.vj.vjs_errorin; \t\t\/\/receive errors\n\n \/\/ \"out\" \"pack\" \"comp\" \"uncomp\" \"ip\"\n \/\/ OUT PACK JCOMP VJUNC NON-VJ\n\n obytes = cur.p.ppp_obytes; \t\t \t\/\/ raw bytes sent\n opackets = cur.p.ppp_opackets; \t\t\/\/ packets sent\n compressed = cur.vj.vjs_compressed; \t\t\/\/outbound compressed packets\n\n \/\/ outbound packets - outbound compressed packets\n packetsunc = cur.vj.vjs_packets - cur.vj.vjs_compressed;\n\n \/\/ packets sent - oubount compressed\n packetsoutunc = cur.p.ppp_opackets - cur.vj.vjs_packets;\n\n return true;\n}\n\n\n#ifndef STREAMS\nbool PPPStats::get_ppp_stats(struct ppp_stats *curp){\n\n struct ifpppstatsreq req;\n\n if(s==0)\n return false;\n\n#ifdef __linux__\n req.stats_ptr = (caddr_t) &req.stats;\n sprintf(req.ifr__name, \"ppp%d\", unit);\n#else\n sprintf(req.ifr_name, \"ppp%d\", unit);\n#endif\n if (ioctl(s, SIOCGPPPSTATS, &req) < 0) {\n\tif (errno == ENOTTY)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"ioctl(SIOCGPPPSTATS)\");\n\treturn false;\n }\n *curp = req.stats;\n return true;\n}\n\n#else\t\/* STREAMS *\/\nbool PPPStats::get_ppp_stats( struct ppp_stats *curp){\n\n if (!strioctl(t, PPPIO_GETSTAT, (char*)curp, 0, sizeof(*curp))) {\n\tif (errno == EINVAL)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"pppstats: Couldn't get statistics\");\n\treturn false;\n }\n return true;\n}\n\nbool PPPStats::strioctl(int fd, int cmd, char* ptr, int ilen, int olen){\n\n struct strioctl str;\n\n str.ic_cmd = cmd;\n str.ic_timout = 0;\n str.ic_len = ilen;\n str.ic_dp = ptr;\n if (ioctl(fd, I_STR, &str) == -1)\n\treturn false;\n if (str.ic_len != olen)\n\tfprintf(stderr, \"strioctl: expected %d bytes, got %d for cmd %x\\n\",\n\t olen, str.ic_len, cmd);\n return true;\n}\n#endif \/* STREAMS *\/\n\n#include \"pppstats.moc\"\n\n<commit_msg>avoid gcc empty body warning<commit_after>\/*\n *\n * $Id$\n *\n * History:\n *\n * Bernd Wuebben, wuebben@math.cornell.edu:\n *\n * Much of this is taken from the pppd sources in particular\n * \/pppstat\/pppstat.c, and modified to suit the needs of kppp.\n *\n *\n * Here the original history of pppstat.c:\n *\n * perkins@cps.msu.edu: Added compression statistics and alternate\n * display. 11\/94\n *\n * Brad Parker (brad@cayman.com) 6\/92\n *\n * from the original \"slstats\" by Van Jaconson\n *\n * Copyright (c) 1989 Regents of the University of California.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms are permitted\n * provided that the above copyright notice and this paragraph are\n * duplicated in all such forms and that any documentation,\n * advertising materials, and other materials related to such\n * distribution and use acknowledge that the software was developed\n * by the University of California, Berkeley. The name of the\n * University may not be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\n *\tVan Jacobson (van@helios.ee.lbl.gov), Dec 31, 1989:\n *\t- Initial distribution.\n *\/\n\n#include <kdefakes.h>\n#include <config.h>\n\n#include <ctype.h>\n#include <errno.h>\n\n#include <stdio.h>\n#include <signal.h>\n#include <fcntl.h>\n#include <sys\/param.h>\n#include <sys\/types.h>\n#include <sys\/ioctl.h>\n#include <string.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <netinet\/in.h>\n#include <net\/ppp_defs.h>\n\n#include \"config.h\"\n#include \"config-kppp.h\"\n#include \"pppstats.h\"\n\n#ifndef STREAMS\n #if defined(__linux__) && defined(__powerpc__) \\\n && (__GLIBC__ == 2 && __GLIBC_MINOR__ == 0)\n \/* kludge alert! *\/\n #undef __GLIBC__\n #endif\n #include <sys\/socket.h>\t\t\/* *BSD, Linux, NeXT, Ultrix etc. *\/\n #ifndef HAVE_NET_IF_PPP_H\n #ifdef HAVE_LINUX_IF_PPP_H\n #include <linux\/if.h>\n #include <linux\/if_ppp.h>\n #endif\n #else\n #include <net\/if.h>\n #include <net\/if_ppp.h>\n #endif\n\n#else\t\/* STREAMS *\/\n #include <sys\/socket.h>\n #include <sys\/stropts.h>\t\/* SVR4, Solaris 2, SunOS 4, OSF\/1, etc. *\/\n #include <net\/ppp_defs.h>\n #include <net\/pppio.h>\n #include <net\/if.h>\n #include <sys\/sockio.h>\n\n#endif\t\/* STREAMS *\/\n\n#include <qtimer.h>\n#include <kdebug.h>\n\nPPPStats::PPPStats()\n{\n clear();\n timer = new QTimer;\n connect(timer, SIGNAL(timeout()), SLOT(timerClick()));\n}\n\n\nPPPStats::~PPPStats() {\n stop();\n delete timer;\n}\n\n\nvoid PPPStats::clear()\n{\n ibytes = 0;\n ipackets = 0;\n ibytes_last = 0;\n obytes_last = 0;\n compressedin = 0;\n uncompressedin = 0;\n errorin = 0;\n obytes = 0;\n opackets = 0;\n compressed = 0;\n packetsunc = 0;\n packetsoutunc = 0;\n ioStatus = BytesNone;\n}\n\nvoid PPPStats::timerClick() {\n enum IOStatus newStatus;\n\n doStats();\n\n if((ibytes != ibytes_last) && (obytes != obytes_last))\n newStatus = BytesBoth;\n else if(ibytes != ibytes_last)\n newStatus = BytesIn;\n else if(obytes != obytes_last)\n newStatus = BytesOut;\n else\n newStatus = BytesNone;\n\n if(newStatus != ioStatus)\n emit statsChanged(ioStatus = newStatus);\n\n ibytes_last = ibytes;\n obytes_last = obytes;\n}\n\nvoid PPPStats::setUnit(int u) {\n unit = u;\n sprintf(unitName, \"ppp%d\", unit);\n}\n\n\nvoid PPPStats::start() {\n timer->start(PPP_STATS_INTERVAL);\n}\n\n\nvoid PPPStats::stop() {\n emit statsChanged(BytesNone);\n timer->stop();\n}\n\n\nbool PPPStats::ifIsUp() {\n bool is_up;\n struct ifreq ifr;\n\n#if defined(__svr4__ )\n usleep(1000000); \/\/ Needed for Solaris ?!\n#endif\n\n#ifdef STREAMS\n if ((t = open(\"\/dev\/ppp\", O_RDONLY)) < 0) {\n\tperror(\"pppstats: Couldn't open \/dev\/ppp: \");\n\treturn false;\n }\n if (!strioctl(t, PPPIO_ATTACH, (char*)&unit, sizeof(int), 0)) {\n\tfprintf(stderr, \"pppstats: ppp%d is not available\\n\", unit);\n\t::close(t);\n\treturn false;\n }\n \/\/ TODO: close t somewhere again\n#endif\n if ((s = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {\n\tperror(\"Couldn't create IP socket\");\n\treturn false;\n }\n\n strlcpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if(ioctl(s, SIOCGIFFLAGS, (caddr_t) &ifr) < 0) {\n if (errno)\n fprintf(stderr, \"Couldn't find interface %s: %s\\n\",\n unitName, strerror(errno));\n\t::close(s);\n\ts = 0;\n\treturn 0;\n }\n\n if ((ifr.ifr_flags & IFF_UP) && (ifr.ifr_flags & IFF_RUNNING)) {\n\tis_up = true;\n\tkDebug(5002) << \"Interface is up\" << endl;\n }\n else{\n is_up = false;\n ::close(s);\n s = 0;\n kDebug(5002) << \"Interface is down\" << endl;\n }\n\n return is_up;\n}\n\n\nbool PPPStats::initStats() {\n\n struct sockaddr_in *sinp;\n struct ifreq ifr;\n\n clear();\n\n strlcpy(ifr.ifr_name, unitName, sizeof(ifr.ifr_name));\n\n if (ioctl(s, SIOCGIFADDR, &ifr) < 0) {\n }\n\n sinp = (struct sockaddr_in*)&ifr.ifr_addr;\n\n if(sinp->sin_addr.s_addr)\n local_ip_address = inet_ntoa(sinp->sin_addr);\n else\n local_ip_address = \"\";\n kDebug(5002) << \"Local IP: \" << local_ip_address << endl;\n\n if (ioctl(s, SIOCGIFDSTADDR, &ifr) < 0) {\n }\n\n sinp = (struct sockaddr_in*)&ifr.ifr_dstaddr;\n\n if(sinp->sin_addr.s_addr)\n remote_ip_address = inet_ntoa(sinp->sin_addr);\n else\n remote_ip_address = \"\";\n kDebug(5002) << \"Remote IP: \" << remote_ip_address << endl;\n\n return true;\n\n}\n\n\nbool PPPStats::doStats() {\n struct ppp_stats cur;\n\n if(! get_ppp_stats(&cur)){\n return false;\n }\n\n \/\/ \"in\" \"pack\" \"comp\" \"uncomp\" \"err\"\n \/\/ IN PACK VJCOMP VJUNC VJERR\n\n ibytes = cur.p.ppp_ibytes; \t\t\t\/\/ bytes received\n ipackets = cur.p.ppp_ipackets; \t\t\/\/ packets received\n compressedin = cur.vj.vjs_compressedin; \t\/\/ inbound compressed packets\n uncompressedin = cur.vj.vjs_uncompressedin; \/\/ inbound uncompressed packets\n errorin = cur.vj.vjs_errorin; \t\t\/\/receive errors\n\n \/\/ \"out\" \"pack\" \"comp\" \"uncomp\" \"ip\"\n \/\/ OUT PACK JCOMP VJUNC NON-VJ\n\n obytes = cur.p.ppp_obytes; \t\t \t\/\/ raw bytes sent\n opackets = cur.p.ppp_opackets; \t\t\/\/ packets sent\n compressed = cur.vj.vjs_compressed; \t\t\/\/outbound compressed packets\n\n \/\/ outbound packets - outbound compressed packets\n packetsunc = cur.vj.vjs_packets - cur.vj.vjs_compressed;\n\n \/\/ packets sent - oubount compressed\n packetsoutunc = cur.p.ppp_opackets - cur.vj.vjs_packets;\n\n return true;\n}\n\n\n#ifndef STREAMS\nbool PPPStats::get_ppp_stats(struct ppp_stats *curp){\n\n struct ifpppstatsreq req;\n\n if(s==0)\n return false;\n\n#ifdef __linux__\n req.stats_ptr = (caddr_t) &req.stats;\n sprintf(req.ifr__name, \"ppp%d\", unit);\n#else\n sprintf(req.ifr_name, \"ppp%d\", unit);\n#endif\n if (ioctl(s, SIOCGPPPSTATS, &req) < 0) {\n\tif (errno == ENOTTY)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"ioctl(SIOCGPPPSTATS)\");\n\treturn false;\n }\n *curp = req.stats;\n return true;\n}\n\n#else\t\/* STREAMS *\/\nbool PPPStats::get_ppp_stats( struct ppp_stats *curp){\n\n if (!strioctl(t, PPPIO_GETSTAT, (char*)curp, 0, sizeof(*curp))) {\n\tif (errno == EINVAL)\n\t fprintf(stderr, \"pppstats: kernel support missing\\n\");\n\telse\n\t perror(\"pppstats: Couldn't get statistics\");\n\treturn false;\n }\n return true;\n}\n\nbool PPPStats::strioctl(int fd, int cmd, char* ptr, int ilen, int olen){\n\n struct strioctl str;\n\n str.ic_cmd = cmd;\n str.ic_timout = 0;\n str.ic_len = ilen;\n str.ic_dp = ptr;\n if (ioctl(fd, I_STR, &str) == -1)\n\treturn false;\n if (str.ic_len != olen)\n\tfprintf(stderr, \"strioctl: expected %d bytes, got %d for cmd %x\\n\",\n\t olen, str.ic_len, cmd);\n return true;\n}\n#endif \/* STREAMS *\/\n\n#include \"pppstats.moc\"\n\n<|endoftext|>"} {"text":"<commit_before>#include \"dynet\/init.h\"\n\n#include \"dynet\/aligned-mem-pool.h\"\n#include \"dynet\/dynet.h\"\n#include \"dynet\/weight-decay.h\"\n#include \"dynet\/globals.h\"\n#include \"dynet\/str-util.h\"\n#include \"dynet\/devices.h\"\n\n#include <iostream>\n#include <random>\n#include <cmath>\n\n#if HAVE_CUDA\n#include \"dynet\/cuda.h\"\n#include <device_launch_parameters.h>\n#endif\n\nusing namespace std;\n\nnamespace dynet {\n\nDynetParams::DynetParams() : random_seed(0), mem_descriptor(\"512\"), weight_decay(0), autobatch(0), profiling(0),\n shared_parameters(false), ngpus_requested(false), ids_requested(false), cpu_requested(false), requested_gpus(-1)\n{\n#if HAVE_CUDA\n gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n}\n\nDynetParams::~DynetParams()\n{\n}\n\nstatic bool has_arg(int argi, int argc, char** argv) {\n const std::string arg(argv[argi]);\n auto pos = arg.find('=');\n if (pos == std::string::npos) {\n if ((argi + 1) < argc) {\n const std::string argn(argv[argi + 1]);\n if (argn.size() < 2 || !(argn[0] == '-' && argn[1] == '-'))\n return true;\n }\n } else {\n \/\/ check that there is actually a string present\n if ((pos + 1) < arg.size()) {\n return true;\n }\n }\n return false;\n}\n\nstatic void remove_args(int& argc, char**& argv, int& argi, int n) {\n if (n == 2) {\n \/\/ when we want a single argument, check to see if it was specified with\n \/\/ an '=', if so decrement the argument count.\n const std::string arg(argv[argi]);\n if (arg.find('=') != std::string::npos) {\n --n;\n }\n }\n for (int i = argi + n; i < argc; ++i)\n argv[i - n] = argv[i];\n argc -= n;\n DYNET_ASSERT(argc >= 0, \"remove_args less than 0\");\n}\n\nstatic std::string get_arg(int argi, char** argv) {\n const std::string arg(argv[argi]);\n auto pos = arg.find('=');\n if (pos != std::string::npos) {\n return arg.substr(pos+1);\n }\n return argv[argi + 1];\n}\n\nDynetParams extract_dynet_params(int& argc,\n char**& argv, bool shared_parameters) {\n DynetParams params;\n params.shared_parameters = shared_parameters;\n\n int argi = 1;\n\n#if HAVE_CUDA\n params.gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n\n\n while (argi < argc) {\n string arg = argv[argi];\n\n \/\/ Memory\n if (startswith(arg, \"--dynet-mem\") || startswith(arg, \"--dynet_mem\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-mem expects an argument (the memory, in megabytes, to reserve)\");\n } else {\n params.mem_descriptor = get_arg(argi, argv);\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Weight decay\n else if (startswith(arg, \"--dynet-weight-decay\") ||\n startswith(arg, \"--dynet_weight_decay\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-weight-decay requires an argument (the weight decay per update)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream d(a2); d >> params.weight_decay;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Random seed\n else if (startswith(arg, \"--dynet-seed\") ||\n startswith(arg, \"--dynet_seed\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-seed expects an argument (the random number seed)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.random_seed;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Autobatching\n else if (startswith(arg, \"--dynet-autobatch\") ||\n startswith(arg, \"--dynet_autobatch\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-autobatch expects an argument (0 for none 1 for on)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.autobatch;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Profiling\n else if (startswith(arg, \"--dynet-profiling\") ||\n startswith(arg, \"--dynet_profiling\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-profiling expects an argument (0 for none 1 for on)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.profiling;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n#if HAVE_CUDA\n else if (startswith(arg, \"--dynet-gpus\") ||\n startswith(arg, \"--dynet_gpus\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-gpus expects an argument (number of GPUs to use)\");\n } else {\n if (params.ngpus_requested)\n throw std::invalid_argument(\"Multiple instances of --dynet-gpus\");\n params.ngpus_requested = true;\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.requested_gpus;\n remove_args(argc, argv, argi, 2);\n }\n }\n#endif\n\n \/\/ Devices\n else if (startswith(arg, \"--dynet-devices\") ||\n startswith(arg, \"--dynet_devices\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-devices expects an argument (comma separated list of CPU and physical GPU ids to use)\");\n } else {\n string devices_str = get_arg(argi, argv);\n if (params.ids_requested)\n throw std::invalid_argument(\"Multiple instances of --dynet-devices\");\n params.ids_requested = true;\n auto devices_info_lst = str_split(devices_str, ',');\n for (auto & devices_info : devices_info_lst) {\n if (startswith(devices_info, \"CPU:\")) {\n throw std::invalid_argument(\"DyNet doesn't support specifying CPU id\");\n } else if (startswith(devices_info, \"CPU\")) {\n if (params.cpu_requested)\n throw std::invalid_argument(\"Bad argument to --dynet-devices\");\n params.cpu_requested = true;\n } else if (startswith(devices_info, \"GPU:\")) {\n int gpu_id = std::stoi(devices_info.substr(4, devices_info.size() - 4));\n if (gpu_id >= 256) \/\/ MAX_GPUS\n throw std::runtime_error(\"DyNet hard limit on maximum number of GPUs (MAX_GPUS) exceeded. If you need more, modify the code to raise this hard limit.\");\n params.gpu_mask[gpu_id] ++;\n params.requested_gpus++;\n if (params.gpu_mask[gpu_id] != 1) {\n ostringstream oss; oss << \"Bad argument to --dynet-devices: \" << devices_info;\n throw std::invalid_argument(oss.str());\n }\n } else {\n throw std::invalid_argument(\"Bad argument to --dynet-devices\");\n }\n }\n params.cpu_requested = true;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Go to next argument\n else {\n argi++;\n }\n }\n\n#if HAVE_CUDA\n \/\/ Check for conflict between the two ways of requesting GPUs\n if (params.ids_requested && params.ngpus_requested)\n throw std::invalid_argument(\"Use only --dynet_gpus or --dynet_gpu_ids, not both\\n\");\n#endif\n\n return params;\n}\n\nvoid initialize(DynetParams& params) {\n if (default_device != nullptr) {\n cerr << \"WARNING: Attempting to initialize dynet twice. Ignoring duplicate initialization.\" << endl;\n return;\n }\n\n DeviceManager* device_manager = get_device_manager();\n\n \/\/ initialize CUDA\n vector<Device*> gpudevices;\n#if HAVE_CUDA\n if (!(params.cpu_requested && (params.requested_gpus == -1))) {\n cerr << \"[dynet] initializing CUDA\\n\";\n gpudevices = initialize_gpu(params);\n for (auto gpu : gpudevices)\n device_manager->add(gpu);\n }\n#endif\n\n \/\/ Set random seed\n if (params.random_seed == 0) {\n random_device rd;\n params.random_seed = rd();\n }\n cerr << \"[dynet] random seed: \" << params.random_seed << endl;\n reset_rng(params.random_seed);\n rndeng = new mt19937(params.random_seed);\n\n \/\/ Set weight decay rate\n if (params.weight_decay < 0 || params.weight_decay >= 1)\n throw std::invalid_argument(\"[dynet] weight decay parameter must be between 0 and 1 (probably very small like 1e-6)\\n\");\n default_weight_decay_lambda = params.weight_decay;\n\n \/\/ Set autobatch\n if(params.autobatch)\n cerr << \"[dynet] using autobatching\" << endl;\n autobatch_flag = params.autobatch;\n \n if(params.profiling)\n cerr << \"[dynet] using profiling level \" << params.profiling << endl;\n profiling_flag = params.profiling;\n\n \/\/ Allocate memory\n cerr << \"[dynet] allocating memory: \" << params.mem_descriptor << \"MB\\n\";\n int default_index = 0;\n\n Device *d;\n if (gpudevices.size()) {\n d = new Device_CPU(device_manager->num_devices(), std::string(\"128\"), params.shared_parameters);\n } else {\n d = new Device_CPU(device_manager->num_devices(), params.mem_descriptor, params.shared_parameters);\n }\n device_manager->add(d);\n default_device = device_manager->get(default_index);\n#if HAVE_CUDA\n if (default_device->type == DeviceType::GPU) {\n auto default_gpu_device = static_cast<Device_GPU *>(default_device);\n CUDA_CHECK(cudaSetDevice(default_gpu_device->cuda_device_id));\n }\n#endif\n\n \/\/ TODO these should be accessed through the relevant device and removed here\n kSCALAR_MINUSONE = default_device->kSCALAR_MINUSONE;\n kSCALAR_ONE = default_device->kSCALAR_ONE;\n kSCALAR_ZERO = default_device->kSCALAR_ZERO;\n cerr << \"[dynet] memory allocation done.\\n\";\n\n}\n\nvoid initialize(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params = extract_dynet_params(argc, argv, shared_parameters);\n initialize(params);\n}\n\nvoid cleanup() {\n delete rndeng;\n get_device_manager()->clear();\n default_device = nullptr;\n}\n\nvoid reset_rng(unsigned seed) {\n rndeng = new mt19937(seed);\n#if HAVE_CUDA\n DeviceManager* device_manager = get_device_manager();\n for (unsigned device_id=0; device_id < device_manager->num_devices(); device_id++){\n Device* dev = device_manager->get(device_id);\n if (dev->type == DeviceType::GPU) {\n Device_GPU* dev_gpu = (Device_GPU*)dev;\n dev_gpu->reset_rng(seed);\n }\n }\n#endif\n}\n\n} \/\/ namespace dynet\n<commit_msg>Update init.cc<commit_after>#include \"dynet\/init.h\"\n\n#include \"dynet\/aligned-mem-pool.h\"\n#include \"dynet\/dynet.h\"\n#include \"dynet\/weight-decay.h\"\n#include \"dynet\/globals.h\"\n#include \"dynet\/str-util.h\"\n#include \"dynet\/devices.h\"\n\n#include <iostream>\n#include <random>\n#include <cmath>\n\n#if HAVE_CUDA\n#include \"dynet\/cuda.h\"\n#include <device_launch_parameters.h>\n#endif\n\nusing namespace std;\n\nnamespace dynet {\n\nDynetParams::DynetParams() : random_seed(0), mem_descriptor(\"512\"), weight_decay(0), autobatch(0), profiling(0),\n shared_parameters(false), ngpus_requested(false), ids_requested(false), cpu_requested(false), requested_gpus(-1)\n{\n#if HAVE_CUDA\n gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n}\n\nDynetParams::~DynetParams()\n{\n}\n\nstatic bool has_arg(int argi, int argc, char** argv) {\n const std::string arg(argv[argi]);\n auto pos = arg.find('=');\n if (pos == std::string::npos) {\n if ((argi + 1) < argc) {\n const std::string argn(argv[argi + 1]);\n if (argn.size() < 2 || !(argn[0] == '-' && argn[1] == '-'))\n return true;\n }\n } else {\n \/\/ check that there is actually a string present\n if ((pos + 1) < arg.size()) {\n return true;\n }\n }\n return false;\n}\n\nstatic void remove_args(int& argc, char**& argv, int& argi, int n) {\n if (n == 2) {\n \/\/ when we want a single argument, check to see if it was specified with\n \/\/ an '=', if so decrement the argument count.\n const std::string arg(argv[argi]);\n if (arg.find('=') != std::string::npos) {\n --n;\n }\n }\n for (int i = argi + n; i < argc; ++i)\n argv[i - n] = argv[i];\n argc -= n;\n DYNET_ASSERT(argc >= 0, \"remove_args less than 0\");\n}\n\nstatic std::string get_arg(int argi, char** argv) {\n const std::string arg(argv[argi]);\n auto pos = arg.find('=');\n if (pos != std::string::npos) {\n return arg.substr(pos+1);\n }\n return argv[argi + 1];\n}\n\nDynetParams extract_dynet_params(int& argc,\n char**& argv, bool shared_parameters) {\n DynetParams params;\n params.shared_parameters = shared_parameters;\n\n int argi = 1;\n\n#if HAVE_CUDA\n params.gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n\n\n while (argi < argc) {\n string arg = argv[argi];\n\n \/\/ Memory\n if (startswith(arg, \"--dynet-mem\") || startswith(arg, \"--dynet_mem\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-mem expects an argument (the memory, in megabytes, to reserve)\");\n } else {\n params.mem_descriptor = get_arg(argi, argv);\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Weight decay\n else if (startswith(arg, \"--dynet-weight-decay\") ||\n startswith(arg, \"--dynet_weight_decay\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-weight-decay requires an argument (the weight decay per update)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream d(a2); d >> params.weight_decay;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Random seed\n else if (startswith(arg, \"--dynet-seed\") ||\n startswith(arg, \"--dynet_seed\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-seed expects an argument (the random number seed)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.random_seed;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Autobatching\n else if (startswith(arg, \"--dynet-autobatch\") ||\n startswith(arg, \"--dynet_autobatch\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-autobatch expects an argument (0 for none 1 for on)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.autobatch;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Profiling\n else if (startswith(arg, \"--dynet-profiling\") ||\n startswith(arg, \"--dynet_profiling\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-profiling expects an argument (0 for none 1 for on)\");\n } else {\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.profiling;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n#if HAVE_CUDA\n else if (startswith(arg, \"--dynet-gpus\") ||\n startswith(arg, \"--dynet_gpus\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-gpus expects an argument (number of GPUs to use)\");\n } else {\n if (params.ngpus_requested)\n throw std::invalid_argument(\"Multiple instances of --dynet-gpus\");\n params.ngpus_requested = true;\n string a2 = get_arg(argi, argv);\n istringstream c(a2); c >> params.requested_gpus;\n remove_args(argc, argv, argi, 2);\n }\n }\n#endif\n\n \/\/ Devices\n else if (startswith(arg, \"--dynet-devices\") ||\n startswith(arg, \"--dynet_devices\")) {\n if (!has_arg(argi, argc, argv)) {\n throw std::invalid_argument(\"[dynet] --dynet-devices expects an argument (comma separated list of CPU and physical GPU ids to use)\");\n } else {\n string devices_str = get_arg(argi, argv);\n if (params.ids_requested)\n throw std::invalid_argument(\"Multiple instances of --dynet-devices\");\n params.ids_requested = true;\n auto devices_info_lst = str_split(devices_str, ',');\n for (auto & devices_info : devices_info_lst) {\n if (startswith(devices_info, \"CPU:\")) {\n throw std::invalid_argument(\"DyNet doesn't support specifying CPU id\");\n } else if (startswith(devices_info, \"CPU\")) {\n if (params.cpu_requested)\n throw std::invalid_argument(\"Bad argument to --dynet-devices\");\n params.cpu_requested = true;\n } else if (startswith(devices_info, \"GPU:\")) {\n int gpu_id = std::stoi(devices_info.substr(4, devices_info.size() - 4));\n if (gpu_id >= 256) \/\/ MAX_GPUS\n throw std::runtime_error(\"DyNet hard limit on maximum number of GPUs (MAX_GPUS) exceeded. If you need more, modify the code to raise this hard limit.\");\n params.gpu_mask[gpu_id] ++;\n params.requested_gpus++;\n if (params.gpu_mask[gpu_id] != 1) {\n ostringstream oss; oss << \"Bad argument to --dynet-devices: \" << devices_info;\n throw std::invalid_argument(oss.str());\n }\n } else {\n throw std::invalid_argument(\"Bad argument to --dynet-devices\");\n }\n }\n params.cpu_requested = true;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Go to next argument\n else {\n argi++;\n }\n }\n\n#if HAVE_CUDA\n \/\/ Check for conflict between the two ways of requesting GPUs\n if (params.ids_requested && params.ngpus_requested)\n throw std::invalid_argument(\"Use only --dynet_gpus or --dynet_devices, not both\\n\");\n#endif\n\n return params;\n}\n\nvoid initialize(DynetParams& params) {\n if (default_device != nullptr) {\n cerr << \"WARNING: Attempting to initialize dynet twice. Ignoring duplicate initialization.\" << endl;\n return;\n }\n\n DeviceManager* device_manager = get_device_manager();\n\n \/\/ initialize CUDA\n vector<Device*> gpudevices;\n#if HAVE_CUDA\n if (!(params.cpu_requested && (params.requested_gpus == -1))) {\n cerr << \"[dynet] initializing CUDA\\n\";\n gpudevices = initialize_gpu(params);\n for (auto gpu : gpudevices)\n device_manager->add(gpu);\n }\n#endif\n\n \/\/ Set random seed\n if (params.random_seed == 0) {\n random_device rd;\n params.random_seed = rd();\n }\n cerr << \"[dynet] random seed: \" << params.random_seed << endl;\n reset_rng(params.random_seed);\n rndeng = new mt19937(params.random_seed);\n\n \/\/ Set weight decay rate\n if (params.weight_decay < 0 || params.weight_decay >= 1)\n throw std::invalid_argument(\"[dynet] weight decay parameter must be between 0 and 1 (probably very small like 1e-6)\\n\");\n default_weight_decay_lambda = params.weight_decay;\n\n \/\/ Set autobatch\n if(params.autobatch)\n cerr << \"[dynet] using autobatching\" << endl;\n autobatch_flag = params.autobatch;\n \n if(params.profiling)\n cerr << \"[dynet] using profiling level \" << params.profiling << endl;\n profiling_flag = params.profiling;\n\n \/\/ Allocate memory\n cerr << \"[dynet] allocating memory: \" << params.mem_descriptor << \"MB\\n\";\n int default_index = 0;\n\n Device *d;\n if (gpudevices.size()) {\n d = new Device_CPU(device_manager->num_devices(), std::string(\"128\"), params.shared_parameters);\n } else {\n d = new Device_CPU(device_manager->num_devices(), params.mem_descriptor, params.shared_parameters);\n }\n device_manager->add(d);\n default_device = device_manager->get(default_index);\n#if HAVE_CUDA\n if (default_device->type == DeviceType::GPU) {\n auto default_gpu_device = static_cast<Device_GPU *>(default_device);\n CUDA_CHECK(cudaSetDevice(default_gpu_device->cuda_device_id));\n }\n#endif\n\n \/\/ TODO these should be accessed through the relevant device and removed here\n kSCALAR_MINUSONE = default_device->kSCALAR_MINUSONE;\n kSCALAR_ONE = default_device->kSCALAR_ONE;\n kSCALAR_ZERO = default_device->kSCALAR_ZERO;\n cerr << \"[dynet] memory allocation done.\\n\";\n\n}\n\nvoid initialize(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params = extract_dynet_params(argc, argv, shared_parameters);\n initialize(params);\n}\n\nvoid cleanup() {\n delete rndeng;\n get_device_manager()->clear();\n default_device = nullptr;\n}\n\nvoid reset_rng(unsigned seed) {\n rndeng = new mt19937(seed);\n#if HAVE_CUDA\n DeviceManager* device_manager = get_device_manager();\n for (unsigned device_id=0; device_id < device_manager->num_devices(); device_id++){\n Device* dev = device_manager->get(device_id);\n if (dev->type == DeviceType::GPU) {\n Device_GPU* dev_gpu = (Device_GPU*)dev;\n dev_gpu->reset_rng(seed);\n }\n }\n#endif\n}\n\n} \/\/ namespace dynet\n<|endoftext|>"} {"text":"<commit_before>#include \"dynet\/init.h\"\n#include \"dynet\/aligned-mem-pool.h\"\n#include \"dynet\/dynet.h\"\n#include \"dynet\/weight-decay.h\"\n\n#include <iostream>\n#include <random>\n#include <cmath>\n\n#if HAVE_CUDA\n#include \"dynet\/cuda.h\"\n#include <device_launch_parameters.h>\n#endif\n\nusing namespace std;\n\nnamespace dynet {\n\nstatic void remove_args(int& argc, char**& argv, int& argi, int n) {\n for (int i = argi + n; i < argc; ++i)\n argv[i - n] = argv[i];\n argc -= n;\n assert(argc >= 0);\n}\n\nDynetParams extract_dynet_params(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params;\n params.shared_parameters = shared_parameters;\n\n int argi = 1;\n\n#if HAVE_CUDA\n params.gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n\n\n while (argi < argc) {\n string arg = argv[argi];\n\n \/\/ Memory\n if (arg == \"--dynet-mem\" || arg == \"--dynet_mem\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-mem expects an argument (the memory, in megabytes, to reserve)\\n\";\n abort();\n } else {\n params.mem_descriptor = argv[argi + 1];\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Weight decay\n else if (arg == \"--dynet-weight-decay\" || arg == \"--dynet_weight_decay\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-weight-decay requires an argument (the weight decay per update)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n istringstream d(a2); d >> params.weight_decay;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Random seed\n else if (arg == \"--dynet-seed\" || arg == \"--dynet_seed\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-seed expects an argument (the random number seed)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n istringstream c(a2); c >> params.random_seed;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n#if HAVE_CUDA\n \/\/ Number of GPUs\n else if (arg == \"--dynet_gpus\" || arg == \"--dynet-gpus\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-gpus expects an argument (number of GPUs to use)\\n\";\n abort();\n } else {\n if (params.ngpus_requested) {\n cerr << \"Multiple instances of --dynet-gpus\" << endl; abort();\n }\n params.ngpus_requested = true;\n string a2 = argv[argi + 1];\n istringstream c(a2); c >> params.requested_gpus;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ GPU ids\n else if (arg == \"--dynet_gpu_ids\" || arg == \"--dynet-gpu-ids\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-gpu-ids expects an argument (comma separated list of physical GPU ids to use)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n if (params.ids_requested) {\n cerr << \"Multiple instances of --dynet-gpu-ids\" << endl; abort();\n }\n params.ids_requested = true;\n if (a2.size() % 2 != 1) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n for (unsigned i = 0; i < a2.size(); ++i) {\n if ((i % 2 == 0 && (a2[i] < '0' || a2[i] > '9')) ||\n (i % 2 == 1 && a2[i] != ',')) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n if (i % 2 == 0) {\n int gpu_id = a2[i] - '0';\n if (gpu_id >= MAX_GPUS) { cerr << \"Raise MAX_GPUS\\n\"; abort(); }\n params.gpu_mask[gpu_id]++;\n params.requested_gpus++;\n if (params.gpu_mask[gpu_id] != 1) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n }\n }\n remove_args(argc, argv, argi, 2);\n }\n }\n#endif\n\n \/\/ Go to next argument\n else {\n argi++;\n }\n\n\n }\n\n#if HAVE_CUDA\n \/\/ Check for conflict between the two ways of requesting GPUs\n if (params.ids_requested && params.ngpus_requested) {\n cerr << \"Use only --dynet_gpus or --dynet_gpu_ids, not both\\n\";\n abort();\n }\n#endif\n\n return params;\n}\n\nvoid initialize(DynetParams params) {\n if (default_device != nullptr) {\n cerr << \"WARNING: Attempting to initialize dynet twice. Ignoring duplicate initialization.\" << endl;\n return;\n }\n\n \/\/ initialize CUDA\n vector<Device*> gpudevices;\n#if HAVE_CUDA\n cerr << \"[dynet] initializing CUDA\\n\";\n gpudevices = initialize_gpu(params);\n#endif\n\n \/\/ Set random seed\n if (params.random_seed == 0) {\n random_device rd;\n params.random_seed = rd();\n }\n cerr << \"[dynet] random seed: \" << params.random_seed << endl;\n rndeng = new mt19937(params.random_seed);\n\n \/\/ Set weight decay rate\n if (params.weight_decay < 0 || params.weight_decay >= 1) {\n cerr << \"[dynet] weight decay parameter must be between 0 and 1 (probably very small like 1e-6)\\n\";\n abort();\n }\n weight_decay_lambda = params.weight_decay;\n\n \/\/ Allocate memory\n cerr << \"[dynet] allocating memory: \" << params.mem_descriptor << \"MB\\n\";\n devices.push_back(new Device_CPU(devices.size(), params.mem_descriptor, params.shared_parameters));\n int default_index = 0;\n if (gpudevices.size() > 0) {\n for (auto gpu : gpudevices)\n devices.push_back(gpu);\n default_index++;\n }\n default_device = devices[default_index];\n\n \/\/ TODO these should be accessed through the relevant device and removed here\n kSCALAR_MINUSONE = default_device->kSCALAR_MINUSONE;\n kSCALAR_ONE = default_device->kSCALAR_ONE;\n kSCALAR_ZERO = default_device->kSCALAR_ZERO;\n cerr << \"[dynet] memory allocation done.\\n\";\n\n}\n\nvoid initialize(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params = extract_dynet_params(argc, argv, shared_parameters);\n initialize(params);\n}\n\nvoid cleanup() {\n delete rndeng;\n \/\/ TODO: Devices cannot be deleted at the moment\n \/\/ for(Device* device : devices) delete device;\n devices.clear();\n default_device = nullptr;\n}\n\n} \/\/ namespace dynet\n\n<commit_msg>Removed unnecessary CPU mem alloc when using GPU<commit_after>#include \"dynet\/init.h\"\n#include \"dynet\/aligned-mem-pool.h\"\n#include \"dynet\/dynet.h\"\n#include \"dynet\/weight-decay.h\"\n\n#include <iostream>\n#include <random>\n#include <cmath>\n\n#if HAVE_CUDA\n#include \"dynet\/cuda.h\"\n#include <device_launch_parameters.h>\n#endif\n\nusing namespace std;\n\nnamespace dynet {\n\nstatic void remove_args(int& argc, char**& argv, int& argi, int n) {\n for (int i = argi + n; i < argc; ++i)\n argv[i - n] = argv[i];\n argc -= n;\n assert(argc >= 0);\n}\n\nDynetParams extract_dynet_params(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params;\n params.shared_parameters = shared_parameters;\n\n int argi = 1;\n\n#if HAVE_CUDA\n params.gpu_mask = std::vector<int>(MAX_GPUS, 0);\n#endif\n\n\n while (argi < argc) {\n string arg = argv[argi];\n\n \/\/ Memory\n if (arg == \"--dynet-mem\" || arg == \"--dynet_mem\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-mem expects an argument (the memory, in megabytes, to reserve)\\n\";\n abort();\n } else {\n params.mem_descriptor = argv[argi + 1];\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Weight decay\n else if (arg == \"--dynet-weight-decay\" || arg == \"--dynet_weight_decay\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-weight-decay requires an argument (the weight decay per update)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n istringstream d(a2); d >> params.weight_decay;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ Random seed\n else if (arg == \"--dynet-seed\" || arg == \"--dynet_seed\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-seed expects an argument (the random number seed)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n istringstream c(a2); c >> params.random_seed;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n#if HAVE_CUDA\n \/\/ Number of GPUs\n else if (arg == \"--dynet_gpus\" || arg == \"--dynet-gpus\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-gpus expects an argument (number of GPUs to use)\\n\";\n abort();\n } else {\n if (params.ngpus_requested) {\n cerr << \"Multiple instances of --dynet-gpus\" << endl; abort();\n }\n params.ngpus_requested = true;\n string a2 = argv[argi + 1];\n istringstream c(a2); c >> params.requested_gpus;\n remove_args(argc, argv, argi, 2);\n }\n }\n\n \/\/ GPU ids\n else if (arg == \"--dynet_gpu_ids\" || arg == \"--dynet-gpu-ids\") {\n if ((argi + 1) > argc) {\n cerr << \"[dynet] --dynet-gpu-ids expects an argument (comma separated list of physical GPU ids to use)\\n\";\n abort();\n } else {\n string a2 = argv[argi + 1];\n if (params.ids_requested) {\n cerr << \"Multiple instances of --dynet-gpu-ids\" << endl; abort();\n }\n params.ids_requested = true;\n if (a2.size() % 2 != 1) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n for (unsigned i = 0; i < a2.size(); ++i) {\n if ((i % 2 == 0 && (a2[i] < '0' || a2[i] > '9')) ||\n (i % 2 == 1 && a2[i] != ',')) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n if (i % 2 == 0) {\n int gpu_id = a2[i] - '0';\n if (gpu_id >= MAX_GPUS) { cerr << \"Raise MAX_GPUS\\n\"; abort(); }\n params.gpu_mask[gpu_id]++;\n params.requested_gpus++;\n if (params.gpu_mask[gpu_id] != 1) {\n cerr << \"Bad argument to --dynet-gpu-ids: \" << a2 << endl; abort();\n }\n }\n }\n remove_args(argc, argv, argi, 2);\n }\n }\n#endif\n\n \/\/ Go to next argument\n else {\n argi++;\n }\n\n\n }\n\n#if HAVE_CUDA\n \/\/ Check for conflict between the two ways of requesting GPUs\n if (params.ids_requested && params.ngpus_requested) {\n cerr << \"Use only --dynet_gpus or --dynet_gpu_ids, not both\\n\";\n abort();\n }\n#endif\n\n return params;\n}\n\nvoid initialize(DynetParams params) {\n if (default_device != nullptr) {\n cerr << \"WARNING: Attempting to initialize dynet twice. Ignoring duplicate initialization.\" << endl;\n return;\n }\n\n \/\/ initialize CUDA\n vector<Device*> gpudevices;\n#if HAVE_CUDA\n cerr << \"[dynet] initializing CUDA\\n\";\n gpudevices = initialize_gpu(params);\n#endif\n\n \/\/ Set random seed\n if (params.random_seed == 0) {\n random_device rd;\n params.random_seed = rd();\n }\n cerr << \"[dynet] random seed: \" << params.random_seed << endl;\n rndeng = new mt19937(params.random_seed);\n\n \/\/ Set weight decay rate\n if (params.weight_decay < 0 || params.weight_decay >= 1) {\n cerr << \"[dynet] weight decay parameter must be between 0 and 1 (probably very small like 1e-6)\\n\";\n abort();\n }\n weight_decay_lambda = params.weight_decay;\n\n \/\/ Allocate memory\n cerr << \"[dynet] allocating memory: \" << params.mem_descriptor << \"MB\\n\";\n \/\/ TODO: Once multi-device support is added, we will potentially allocate both CPU\n \/\/ and GPU, not either-or\n int default_index = 0;\n if (gpudevices.size() > 0) {\n for (auto gpu : gpudevices)\n devices.push_back(gpu);\n } else {\n devices.push_back(new Device_CPU(devices.size(), params.mem_descriptor, params.shared_parameters));\n }\n default_device = devices[default_index];\n\n \/\/ TODO these should be accessed through the relevant device and removed here\n kSCALAR_MINUSONE = default_device->kSCALAR_MINUSONE;\n kSCALAR_ONE = default_device->kSCALAR_ONE;\n kSCALAR_ZERO = default_device->kSCALAR_ZERO;\n cerr << \"[dynet] memory allocation done.\\n\";\n\n}\n\nvoid initialize(int& argc, char**& argv, bool shared_parameters) {\n DynetParams params = extract_dynet_params(argc, argv, shared_parameters);\n initialize(params);\n}\n\nvoid cleanup() {\n delete rndeng;\n \/\/ TODO: Devices cannot be deleted at the moment\n \/\/ for(Device* device : devices) delete device;\n devices.clear();\n default_device = nullptr;\n}\n\n} \/\/ namespace dynet\n\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* bzflag special common - 1st one *\/\n#include \"common.h\"\n\n#include <iostream>\n#include <string>\n\n#include \"ActionBinding.h\"\n#include \"CommandManager.h\"\n#include \"KeyManager.h\"\n\n\/\/ initialize the singleton\ntemplate <>\nActionBinding* Singleton<ActionBinding>::_instance = (ActionBinding*)0;\n\n\nActionBinding::ActionBinding() {\n wayToBindActions.insert(std::make_pair(std::string(\"quit\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"fire\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drop\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"identify\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"jump\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send all\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send team\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send nemesis\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send recipient\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send admin\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayScore\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayBinoculars\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"pause\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"fullscreen\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"iconify\"), press));\n#ifdef SNAPPING\n wayToBindActions.insert(std::make_pair(std::string(\"screenshot\"), press));\n#endif\n wayToBindActions.insert(std::make_pair(std::string(\"time backward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"time forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleConsoleAndRadar\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleFlags radar\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleFlags main\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"silence\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayLabels\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"destruct\"), press));\n\n \/\/ Movement keys\n wayToBindActions.insert(std::make_pair(std::string(\"turn left\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"turn right\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drive forward\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drive reverse\"), both));\n \/\/ End movement keys\n\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle subject backward\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle subject forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle type forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom in\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom out\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom normal\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"servercommand\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayFlagHelp\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"scrollpanel up\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"scrollpanel down\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"radarZoom in\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"radarZoom out\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 0.25\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 0.5\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 1.0\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle slowKeyboard\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"hunt\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"restart\"), release));\n wayToBindActions.insert(std::make_pair(std::string(\"autopilot\"), press));\n\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel all\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel chat\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel server\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel misc\"),\n\t\t\t\t\t press));\n\n defaultBinding.insert(std::make_pair(std::string(\"F12\"), std::string(\"quit\")));\n defaultBinding.insert(std::make_pair(std::string(\"Left Mouse\"), std::string(\"fire\")));\n defaultBinding.insert(std::make_pair(std::string(\"Enter\"), std::string(\"fire\")));\n defaultBinding.insert(std::make_pair(std::string(\"Middle Mouse\"), std::string(\"drop\")));\n defaultBinding.insert(std::make_pair(std::string(\"Space\"), std::string(\"drop\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Mouse\"), std::string(\"identify\")));\n defaultBinding.insert(std::make_pair(std::string(\"I\"), std::string(\"identify\")));\n defaultBinding.insert(std::make_pair(std::string(\"Tab\"), std::string(\"jump\")));\n defaultBinding.insert(std::make_pair(std::string(\"N\"), std::string(\"send all\")));\n defaultBinding.insert(std::make_pair(std::string(\"M\"), std::string(\"send team\")));\n defaultBinding.insert(std::make_pair(std::string(\",\"), std::string(\"send nemesis\")));\n defaultBinding.insert(std::make_pair(std::string(\".\"), std::string(\"send recipient\")));\n defaultBinding.insert(std::make_pair(std::string(\"Z\"), std::string(\"send admin\")));\n defaultBinding.insert(std::make_pair(std::string(\"S\"), std::string(\"toggle displayScore\")));\n defaultBinding.insert(std::make_pair(std::string(\"B\"), std::string(\"toggle displayBinoculars\")));\n defaultBinding.insert(std::make_pair(std::string(\"Pause\"), std::string(\"pause\")));\n defaultBinding.insert(std::make_pair(std::string(\"P\"), std::string(\"pause\")));\n defaultBinding.insert(std::make_pair(std::string(\"F1\"), std::string(\"fullscreen\")));\n defaultBinding.insert(std::make_pair(std::string(\"F3\"), std::string(\"toggleConsoleAndRadar\")));\n defaultBinding.insert(std::make_pair(std::string(\"F4\"), std::string(\"iconify\")));\n#ifdef SNAPPING\n defaultBinding.insert(std::make_pair(std::string(\"F5\"), std::string(\"screenshot\")));\n#endif\n defaultBinding.insert(std::make_pair(std::string(\"-\"), std::string(\"time backward\")));\n defaultBinding.insert(std::make_pair(std::string(\"=\"), std::string(\"time forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"H\"), std::string(\"toggleFlags radar\")));\n defaultBinding.insert(std::make_pair(std::string(\"J\"), std::string(\"toggleFlags main\")));\n defaultBinding.insert(std::make_pair(std::string(\"K\"), std::string(\"silence\")));\n defaultBinding.insert(std::make_pair(std::string(\"L\"), std::string(\"toggle displayLabels\")));\n defaultBinding.insert(std::make_pair(std::string(\"Delete\"), std::string(\"destruct\")));\n\n \/\/ Default movement keys\n defaultBinding.insert(std::make_pair(std::string(\"Left Arrow\"),\n\t\t\t\t std::string(\"turn left\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Arrow\"),\n\t\t\t\t std::string(\"turn right\")));\n defaultBinding.insert(std::make_pair(std::string(\"Up Arrow\"),\n\t\t\t\t std::string(\"drive forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"Down Arrow\"),\n\t\t\t\t std::string(\"drive reverse\")));\n \/\/ End default movement keys\n\n defaultBinding.insert(std::make_pair(std::string(\"Wheel Up\"),\n\t\t\t\t std::string(\"radarZoom in\")));\n defaultBinding.insert(std::make_pair(std::string(\"Wheel Down\"),\n\t\t\t\t std::string(\"radarZoom out\")));\n\n\n defaultBinding.insert(std::make_pair(std::string(\"F6\"), std::string(\"roam cycle subject backward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F7\"), std::string(\"roam cycle subject forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F8\"), std::string(\"roam cycle type forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F9\"), std::string(\"roam zoom in\")));\n defaultBinding.insert(std::make_pair(std::string(\"F10\"), std::string(\"roam zoom out\")));\n defaultBinding.insert(std::make_pair(std::string(\"F11\"), std::string(\"roam zoom normal\")));\n defaultBinding.insert(std::make_pair(std::string(\"O\"), std::string(\"servercommand\")));\n defaultBinding.insert(std::make_pair(std::string(\"F\"), std::string(\"toggle displayFlagHelp\")));\n defaultBinding.insert(std::make_pair(std::string(\"Page Up\"), std::string(\"scrollpanel up\")));\n defaultBinding.insert(std::make_pair(std::string(\"Page Down\"), std::string(\"scrollpanel down\")));\n defaultBinding.insert(std::make_pair(std::string(\"1\"), std::string(\"set displayRadarRange 0.25\")));\n defaultBinding.insert(std::make_pair(std::string(\"2\"), std::string(\"set displayRadarRange 0.5\")));\n defaultBinding.insert(std::make_pair(std::string(\"3\"), std::string(\"set displayRadarRange 1.0\")));\n defaultBinding.insert(std::make_pair(std::string(\"A\"), std::string(\"toggle slowKeyboard\")));\n defaultBinding.insert(std::make_pair(std::string(\"U\"), std::string(\"hunt\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Mouse\"), std::string(\"restart\")));\n defaultBinding.insert(std::make_pair(std::string(\"I\"), std::string(\"restart\")));\n defaultBinding.insert(std::make_pair(std::string(\"9\"), std::string(\"autopilot\")));\n\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F1\"),\n\t\t\t\t std::string(\"messagepanel all\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F2\"),\n\t\t\t\t std::string(\"messagepanel chat\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F3\"),\n\t\t\t\t std::string(\"messagepanel server\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F4\"),\n\t\t\t\t std::string(\"messagepanel misc\")));\n}\n\nvoid ActionBinding::resetBindings() {\n BindingTable::const_iterator index;\n\n for (index = bindingTable.begin();\n index != bindingTable.end();\n ++index)\n unbind(index->second, index->first);\n\n bindingTable = defaultBinding;\n\n for (index = bindingTable.begin();\n index != bindingTable.end();\n ++index)\n bind(index->second, index->first);\n}\n\nvoid ActionBinding::getFromBindings() {\n bindingTable.clear();\n KEYMGR.iterate(&onScanCB, this);\n}\n\nvoid ActionBinding::onScanCB(const std::string& name, bool,\n\t\t\t const std::string& cmd, void*)\n{\n ActionBinding::instance().associate(name, cmd, false);\n}\n\nvoid ActionBinding::associate(std::string key,\n\t\t\t std::string action,\n\t\t\t bool keyBind) {\n BindingTable::iterator index, next;\n if (!wayToBindActions.count(action))\n return;\n PressStatusBind newStatusBind = wayToBindActions[action];\n for (index = bindingTable.lower_bound( key ); index != bindingTable.upper_bound( key ); index = next) {\n next = index;\n ++next;\n if (newStatusBind == both) {\n if (keyBind)\n\tunbind(index->second, key);\n bindingTable.erase(index);\n } else if (newStatusBind == press) {\n if (wayToBindActions[index->second] != release) {\n\tif (keyBind)\n\t unbind(index->second, key);\n\tbindingTable.erase(index);\n }\n } else {\n if (wayToBindActions[index->second] != press) {\n\tif (keyBind)\n\t unbind(index->second, key);\n\tbindingTable.erase(index);\n }\n }\n }\n bindingTable.insert(std::make_pair(key, action));\n if (keyBind)\n bind(action, key);\n};\n\nvoid ActionBinding::deassociate(std::string action) {\n BindingTable::iterator index, next;\n for (index = bindingTable.begin();\n index != bindingTable.end();\n index = next) {\n next = index;\n ++next;\n if (index->second == action) {\n unbind(action, index->first);\n bindingTable.erase(index);\n }\n }\n};\n\nvoid ActionBinding::bind(std::string action, std::string key) {\n PressStatusBind statusBind = wayToBindActions[action];\n std::string command;\n if (statusBind == press || statusBind == both) {\n command = \"bind \\\"\" + key + \"\\\" down \\\"\" + action + \"\\\"\";\n CMDMGR.run(command);\n };\n if (statusBind == release || statusBind == both) {\n command = \"bind \\\"\" + key + \"\\\" up \\\"\" + action + \"\\\"\";\n CMDMGR.run(command);\n };\n}\n\nvoid ActionBinding::unbind(std::string action, std::string key) {\n PressStatusBind statusBind = wayToBindActions[action];\n std::string command;\n if (statusBind == press || statusBind == both) {\n command = \"unbind \\\"\" + key + \"\\\" down\";\n CMDMGR.run(command);\n };\n if (statusBind == release || statusBind == both) {\n command = \"unbind \\\"\" + key + \"\\\" up\";\n CMDMGR.run(command);\n };\n}\n\n\/\/ Local Variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<commit_msg>Using wheel to scroll chat area, moving RadarZoom to Wheel+Shift<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* bzflag special common - 1st one *\/\n#include \"common.h\"\n\n#include <iostream>\n#include <string>\n\n#include \"ActionBinding.h\"\n#include \"CommandManager.h\"\n#include \"KeyManager.h\"\n\n\/\/ initialize the singleton\ntemplate <>\nActionBinding* Singleton<ActionBinding>::_instance = (ActionBinding*)0;\n\n\nActionBinding::ActionBinding() {\n wayToBindActions.insert(std::make_pair(std::string(\"quit\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"fire\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drop\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"identify\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"jump\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send all\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send team\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send nemesis\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send recipient\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"send admin\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayScore\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayBinoculars\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"pause\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"fullscreen\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"iconify\"), press));\n#ifdef SNAPPING\n wayToBindActions.insert(std::make_pair(std::string(\"screenshot\"), press));\n#endif\n wayToBindActions.insert(std::make_pair(std::string(\"time backward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"time forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleConsoleAndRadar\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleFlags radar\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggleFlags main\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"silence\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayLabels\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"destruct\"), press));\n\n \/\/ Movement keys\n wayToBindActions.insert(std::make_pair(std::string(\"turn left\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"turn right\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drive forward\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"drive reverse\"), both));\n \/\/ End movement keys\n\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle subject backward\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle subject forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam cycle type forward\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom in\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom out\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"roam zoom normal\"), both));\n wayToBindActions.insert(std::make_pair(std::string(\"servercommand\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle displayFlagHelp\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"scrollpanel up\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"scrollpanel down\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"radarZoom in\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"radarZoom out\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 0.25\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 0.5\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"set displayRadarRange 1.0\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"toggle slowKeyboard\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"hunt\"), press));\n wayToBindActions.insert(std::make_pair(std::string(\"restart\"), release));\n wayToBindActions.insert(std::make_pair(std::string(\"autopilot\"), press));\n\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel all\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel chat\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel server\"),\n\t\t\t\t\t press));\n wayToBindActions.insert(std::make_pair(std::string(\"messagepanel misc\"),\n\t\t\t\t\t press));\n\n defaultBinding.insert(std::make_pair(std::string(\"F12\"), std::string(\"quit\")));\n defaultBinding.insert(std::make_pair(std::string(\"Left Mouse\"), std::string(\"fire\")));\n defaultBinding.insert(std::make_pair(std::string(\"Enter\"), std::string(\"fire\")));\n defaultBinding.insert(std::make_pair(std::string(\"Middle Mouse\"), std::string(\"drop\")));\n defaultBinding.insert(std::make_pair(std::string(\"Space\"), std::string(\"drop\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Mouse\"), std::string(\"identify\")));\n defaultBinding.insert(std::make_pair(std::string(\"I\"), std::string(\"identify\")));\n defaultBinding.insert(std::make_pair(std::string(\"Tab\"), std::string(\"jump\")));\n defaultBinding.insert(std::make_pair(std::string(\"N\"), std::string(\"send all\")));\n defaultBinding.insert(std::make_pair(std::string(\"M\"), std::string(\"send team\")));\n defaultBinding.insert(std::make_pair(std::string(\",\"), std::string(\"send nemesis\")));\n defaultBinding.insert(std::make_pair(std::string(\".\"), std::string(\"send recipient\")));\n defaultBinding.insert(std::make_pair(std::string(\"Z\"), std::string(\"send admin\")));\n defaultBinding.insert(std::make_pair(std::string(\"S\"), std::string(\"toggle displayScore\")));\n defaultBinding.insert(std::make_pair(std::string(\"B\"), std::string(\"toggle displayBinoculars\")));\n defaultBinding.insert(std::make_pair(std::string(\"Pause\"), std::string(\"pause\")));\n defaultBinding.insert(std::make_pair(std::string(\"P\"), std::string(\"pause\")));\n defaultBinding.insert(std::make_pair(std::string(\"F1\"), std::string(\"fullscreen\")));\n defaultBinding.insert(std::make_pair(std::string(\"F3\"), std::string(\"toggleConsoleAndRadar\")));\n defaultBinding.insert(std::make_pair(std::string(\"F4\"), std::string(\"iconify\")));\n#ifdef SNAPPING\n defaultBinding.insert(std::make_pair(std::string(\"F5\"), std::string(\"screenshot\")));\n#endif\n defaultBinding.insert(std::make_pair(std::string(\"-\"), std::string(\"time backward\")));\n defaultBinding.insert(std::make_pair(std::string(\"=\"), std::string(\"time forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"H\"), std::string(\"toggleFlags radar\")));\n defaultBinding.insert(std::make_pair(std::string(\"J\"), std::string(\"toggleFlags main\")));\n defaultBinding.insert(std::make_pair(std::string(\"K\"), std::string(\"silence\")));\n defaultBinding.insert(std::make_pair(std::string(\"L\"), std::string(\"toggle displayLabels\")));\n defaultBinding.insert(std::make_pair(std::string(\"Delete\"), std::string(\"destruct\")));\n\n \/\/ Default movement keys\n defaultBinding.insert(std::make_pair(std::string(\"Left Arrow\"),\n\t\t\t\t std::string(\"turn left\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Arrow\"),\n\t\t\t\t std::string(\"turn right\")));\n defaultBinding.insert(std::make_pair(std::string(\"Up Arrow\"),\n\t\t\t\t std::string(\"drive forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"Down Arrow\"),\n\t\t\t\t std::string(\"drive reverse\")));\n \/\/ End default movement keys\n\n defaultBinding.insert(std::make_pair(std::string(\"Shift+Wheel Up\"),\n\t\t\t\t std::string(\"radarZoom in\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+Wheel Down\"),\n\t\t\t\t std::string(\"radarZoom out\")));\n\n\n defaultBinding.insert(std::make_pair(std::string(\"F6\"), std::string(\"roam cycle subject backward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F7\"), std::string(\"roam cycle subject forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F8\"), std::string(\"roam cycle type forward\")));\n defaultBinding.insert(std::make_pair(std::string(\"F9\"), std::string(\"roam zoom in\")));\n defaultBinding.insert(std::make_pair(std::string(\"F10\"), std::string(\"roam zoom out\")));\n defaultBinding.insert(std::make_pair(std::string(\"F11\"), std::string(\"roam zoom normal\")));\n defaultBinding.insert(std::make_pair(std::string(\"O\"), std::string(\"servercommand\")));\n defaultBinding.insert(std::make_pair(std::string(\"F\"), std::string(\"toggle displayFlagHelp\")));\n defaultBinding.insert(std::make_pair(std::string(\"Page Up\"),\n\t\t\t\t std::string(\"scrollpanel up\")));\n defaultBinding.insert(std::make_pair(std::string(\"Wheel Up\"),\n\t\t\t\t std::string(\"scrollpanel up\")));\n defaultBinding.insert(std::make_pair(std::string(\"Wheel Down\"),\n\t\t\t\t std::string(\"scrollpanel down\")));\n defaultBinding.insert(std::make_pair(std::string(\"1\"), std::string(\"set displayRadarRange 0.25\")));\n defaultBinding.insert(std::make_pair(std::string(\"2\"), std::string(\"set displayRadarRange 0.5\")));\n defaultBinding.insert(std::make_pair(std::string(\"3\"), std::string(\"set displayRadarRange 1.0\")));\n defaultBinding.insert(std::make_pair(std::string(\"A\"), std::string(\"toggle slowKeyboard\")));\n defaultBinding.insert(std::make_pair(std::string(\"U\"), std::string(\"hunt\")));\n defaultBinding.insert(std::make_pair(std::string(\"Right Mouse\"), std::string(\"restart\")));\n defaultBinding.insert(std::make_pair(std::string(\"I\"), std::string(\"restart\")));\n defaultBinding.insert(std::make_pair(std::string(\"9\"), std::string(\"autopilot\")));\n\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F1\"),\n\t\t\t\t std::string(\"messagepanel all\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F2\"),\n\t\t\t\t std::string(\"messagepanel chat\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F3\"),\n\t\t\t\t std::string(\"messagepanel server\")));\n defaultBinding.insert(std::make_pair(std::string(\"Shift+F4\"),\n\t\t\t\t std::string(\"messagepanel misc\")));\n}\n\nvoid ActionBinding::resetBindings() {\n BindingTable::const_iterator index;\n\n for (index = bindingTable.begin();\n index != bindingTable.end();\n ++index)\n unbind(index->second, index->first);\n\n bindingTable = defaultBinding;\n\n for (index = bindingTable.begin();\n index != bindingTable.end();\n ++index)\n bind(index->second, index->first);\n}\n\nvoid ActionBinding::getFromBindings() {\n bindingTable.clear();\n KEYMGR.iterate(&onScanCB, this);\n}\n\nvoid ActionBinding::onScanCB(const std::string& name, bool,\n\t\t\t const std::string& cmd, void*)\n{\n ActionBinding::instance().associate(name, cmd, false);\n}\n\nvoid ActionBinding::associate(std::string key,\n\t\t\t std::string action,\n\t\t\t bool keyBind) {\n BindingTable::iterator index, next;\n if (!wayToBindActions.count(action))\n return;\n PressStatusBind newStatusBind = wayToBindActions[action];\n for (index = bindingTable.lower_bound( key ); index != bindingTable.upper_bound( key ); index = next) {\n next = index;\n ++next;\n if (newStatusBind == both) {\n if (keyBind)\n\tunbind(index->second, key);\n bindingTable.erase(index);\n } else if (newStatusBind == press) {\n if (wayToBindActions[index->second] != release) {\n\tif (keyBind)\n\t unbind(index->second, key);\n\tbindingTable.erase(index);\n }\n } else {\n if (wayToBindActions[index->second] != press) {\n\tif (keyBind)\n\t unbind(index->second, key);\n\tbindingTable.erase(index);\n }\n }\n }\n bindingTable.insert(std::make_pair(key, action));\n if (keyBind)\n bind(action, key);\n};\n\nvoid ActionBinding::deassociate(std::string action) {\n BindingTable::iterator index, next;\n for (index = bindingTable.begin();\n index != bindingTable.end();\n index = next) {\n next = index;\n ++next;\n if (index->second == action) {\n unbind(action, index->first);\n bindingTable.erase(index);\n }\n }\n};\n\nvoid ActionBinding::bind(std::string action, std::string key) {\n PressStatusBind statusBind = wayToBindActions[action];\n std::string command;\n if (statusBind == press || statusBind == both) {\n command = \"bind \\\"\" + key + \"\\\" down \\\"\" + action + \"\\\"\";\n CMDMGR.run(command);\n };\n if (statusBind == release || statusBind == both) {\n command = \"bind \\\"\" + key + \"\\\" up \\\"\" + action + \"\\\"\";\n CMDMGR.run(command);\n };\n}\n\nvoid ActionBinding::unbind(std::string action, std::string key) {\n PressStatusBind statusBind = wayToBindActions[action];\n std::string command;\n if (statusBind == press || statusBind == both) {\n command = \"unbind \\\"\" + key + \"\\\" down\";\n CMDMGR.run(command);\n };\n if (statusBind == release || statusBind == both) {\n command = \"unbind \\\"\" + key + \"\\\" up\";\n CMDMGR.run(command);\n };\n}\n\n\/\/ Local Variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<|endoftext|>"} {"text":"<commit_before>#include <crpcut.hpp>\n#include <stdio.h>\n#include <pthread.h>\n\n#include <coincident\/coincident.h>\n\n\/*\n * The code below is not stupid, but VERY stupid.\n *\n * However, it's just for testing coincident.\n *\/\nint global;\n\nint add_val(int v)\n{\n\tglobal += v;\n\n\treturn global;\n}\n\nstatic int test_race(void *params)\n{\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\n\treturn 0;\n}\n\nstatic int test_pthreads_non_race(void *params)\n{\n\tpthread_mutex_t *mutex = (pthread_mutex_t *)params;\n\n\tpthread_mutex_lock(mutex);\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\tpthread_mutex_unlock(mutex);\n\n\treturn 0;\n}\n\nstatic int test_pthreads_race(void *params)\n{\n\tpthread_mutex_t *mutex = (pthread_mutex_t *)params;\n\n\tpthread_mutex_lock(mutex);\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\tpthread_mutex_unlock(mutex);\n\n\tpthread_mutex_lock(mutex);\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\tpthread_mutex_unlock(mutex);\n\n\treturn 0;\n}\n\n\/\/ Same as above, but without races (stack allocated stuff)\nint add_val_non_race(int *src, int v)\n{\n\t*src += v;\n\n\treturn *src;\n}\n\nstatic int test_non_race(void *params)\n{\n\tint src = 1;\n\n\tASSERT_TRUE(src == 1);\n\n\tint v = add_val_non_race(&src, 1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == src);\n\n\treturn 0;\n}\n\n\nTESTSUITE(coincident)\n{\n\tTEST(basic_race)\n\t{\n\t\tcoincident_add_thread(test_race, NULL);\n\t\tcoincident_add_thread(test_race, NULL);\n\n\t\tcoincident_set_run_limit(10);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(basic_non_race)\n\t{\n\t\tcoincident_add_thread(test_race, NULL);\n\t\tcoincident_add_thread(test_non_race, NULL);\n\t\tcoincident_add_thread(test_non_race, NULL);\n\n\t\t\/\/ Stop after 500 ms\n\t\tcoincident_set_time_limit(500);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(pthreads_non_race)\n\t{\n\t\tpthread_mutex_t mutex;\n\n\t\tpthread_mutex_init(&mutex, NULL);\n\n\t\tcoincident_add_thread(test_pthreads_non_race, &mutex);\n\t\tcoincident_add_thread(test_pthreads_non_race, &mutex);\n\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(pthreads_race)\n\t{\n\t\tpthread_mutex_t mutex;\n\n\t\tpthread_mutex_init(&mutex, NULL);\n\n\t\tcoincident_add_thread(test_pthreads_race, &mutex);\n\t\tcoincident_add_thread(test_pthreads_race, &mutex);\n\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n}\n\nint main(int argc, const char *argv[])\n{\n\t\/\/ We use random scheduling here, so this actually affects\n\t\/\/ the result\n\tsrand(time(NULL));\n\n\tcoincident_init();\n\n\treturn crpcut::run(argc, argv);\n}\n<commit_msg>self-test: Add gmock tests (to catch a pthread_self() error)<commit_after>#include <stdio.h>\n#include <pthread.h>\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n#include <crpcut.hpp>\n\n#include <coincident\/coincident.h>\n#include <coincident\/controller.hh>\n\nusing namespace testing;\n\n\/*\n * The code below is not stupid, but VERY stupid.\n *\n * However, it's just for testing coincident.\n *\/\nint global;\n\nint add_val(int v)\n{\n\tglobal += v;\n\n\treturn global;\n}\n\nstatic int test_race(void *params)\n{\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\n\treturn 0;\n}\n\nstatic int test_pthreads_non_race(void *params)\n{\n\tpthread_mutex_t *mutex = (pthread_mutex_t *)params;\n\n\tpthread_mutex_lock(mutex);\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\tpthread_mutex_unlock(mutex);\n\n\treturn 0;\n}\n\nstatic int test_pthreads_race(void *params)\n{\n\tpthread_mutex_t *mutex = (pthread_mutex_t *)params;\n\n\tpthread_mutex_lock(mutex);\n\tglobal = 1;\n\n\tASSERT_TRUE(global == 1);\n\tpthread_mutex_unlock(mutex);\n\n\tpthread_mutex_lock(mutex);\n\tint v = add_val(1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == global);\n\tpthread_mutex_unlock(mutex);\n\n\treturn 0;\n}\n\n\/\/ Same as above, but without races (stack allocated stuff)\nint add_val_non_race(int *src, int v)\n{\n\t*src += v;\n\n\treturn *src;\n}\n\nstatic int test_non_race(void *params)\n{\n\tint src = 1;\n\n\tASSERT_TRUE(src == 1);\n\n\tint v = add_val_non_race(&src, 1);\n\tASSERT_TRUE(v == 2);\n\n\tASSERT_TRUE(v == src);\n\n\treturn 0;\n}\n\nclass GMockTest\n{\npublic:\n\tMOCK_METHOD1(test1, void(int a));\n\tMOCK_METHOD0(test2, int());\n};\n\nstatic int test_gmock_mock_in_function(void *p)\n{\n\tGMockTest mock;\n\n\tEXPECT_CALL(mock, test1(_))\n\t.Times(AtLeast(1));\n\tEXPECT_CALL(mock, test2())\n\t.Times(AtLeast(1));\n\n\tmock.test1(5);\n\tmock.test2();\n\n\treturn 0;\n}\n\nstatic int test_gmock(void *p)\n{\n\tGMockTest *mock = (GMockTest *)p;\n\n\tmock->test1(5);\n\tmock->test2();\n\n\treturn 0;\n}\n\nstatic int test_gmock_expect_in_function(void *p)\n{\n\tGMockTest *mock = (GMockTest *)p;\n\n\tEXPECT_CALL(*mock, test1(_))\n\t.Times(AtLeast(1));\n\n\tmock->test1(5);\n\n\treturn 0;\n}\n\n\nTESTSUITE(coincident)\n{\n\tTEST(basic_race)\n\t{\n\t\tcoincident_add_thread(test_race, NULL);\n\t\tcoincident_add_thread(test_race, NULL);\n\n\t\tcoincident_set_run_limit(10);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(basic_non_race)\n\t{\n\t\tcoincident_add_thread(test_race, NULL);\n\t\tcoincident_add_thread(test_non_race, NULL);\n\t\tcoincident_add_thread(test_non_race, NULL);\n\n\t\t\/\/ Stop after 500 ms\n\t\tcoincident_set_time_limit(500);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(pthreads_non_race)\n\t{\n\t\tpthread_mutex_t mutex;\n\n\t\tpthread_mutex_init(&mutex, NULL);\n\n\t\tcoincident_add_thread(test_pthreads_non_race, &mutex);\n\t\tcoincident_add_thread(test_pthreads_non_race, &mutex);\n\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(pthreads_race)\n\t{\n\t\tpthread_mutex_t mutex;\n\n\t\tpthread_mutex_init(&mutex, NULL);\n\n\t\tcoincident_add_thread(test_pthreads_race, &mutex);\n\t\tcoincident_add_thread(test_pthreads_race, &mutex);\n\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(gmock_expectations_in_test_function)\n\t{\n\t\tGMockTest mock;\n\n\t\ttest_gmock_expect_in_function((void *)&mock);\n\n\t\tcoincident_add_thread(test_gmock_expect_in_function, (void *)&mock);\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tif (result != 0)\n\t\t\tprintf(\"ERROR: %s\\n\", coincident::IController::getInstance().getError());\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(gmock_expectations)\n\t{\n\t\tGMockTest mock;\n\n\t\tEXPECT_CALL(mock, test1(_))\n\t\t.Times(AtLeast(1));\n\n\t\tcoincident_add_thread(test_gmock, (void *)&mock);\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tif (result != 0)\n\t\t\tprintf(\"ERROR: %s\\n\", coincident::IController::getInstance().getError());\n\t\tASSERT_TRUE(result == 0);\n\t}\n\n\tTEST(gmock_mock_in_function)\n\t{\n\t\tcoincident_add_thread(test_gmock_mock_in_function, NULL);\n\t\tcoincident_set_time_limit(1000);\n\n\t\tint result = coincident_run();\n\t\tif (result != 0)\n\t\t\tprintf(\"ERROR: %s\\n\", coincident::IController::getInstance().getError());\n\t\tASSERT_TRUE(result == 0);\n\t}\n}\n\nint main(int argc, const char *argv[])\n{\n\t\/\/ We use random scheduling here, so this actually affects\n\t\/\/ the result\n\tsrand(time(NULL));\n\n\tcoincident_init();\n\n\treturn crpcut::run(argc, argv);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <coli\/debug.h>\n#include <coli\/core.h>\n\n#include <String.h>\n#include <Halide.h>\n\n\nint main(int argc, char **argv)\n{\n\t\/\/ Declare a library. A library is composed of a set of functions.\n\tcoli::library lib(\"library0\");\n\n\t\/\/ Declare a function in the library lib.\n\tcoli::function fct(\"function0\", &lib);\n\n\t\/\/ Declare the computations of the function fct.\n\t\/\/ To declare a computation, you need to provide:\n\t\/\/ (1) a Halide expression that represents the computation,\n\t\/\/ (2) an isl set representing the iteration space of the computation, and\n\t\/\/ (3) an isl context (which will be used by the ISL library calls).\n\tcoli::computation computation0(Halide::Expr((uint8_t) 3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\n\t\/\/ Create a memory buffer (2 dimensional).\n\tcoli::buffer buf0(\"buf0\", 2, {10,10}, Halide::Int(8), NULL, &fct);\n\n\t\/\/ Add the buffer as an argument to the function fct.\n\tfct.add_argument(buf0);\n\n\t\/\/ Map the computations to the buffers (i.e. where each computation\n\t\/\/ should be stored in the buffer).\n\tcomputation0.SetWriteAccess(\"{S0[i,j]->buf0[i, j]}\");\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.tile(0,1,32,32);\n\tcomputation0.tag_parallel_dimension(1);\n\n\t\/\/ Generate an AST (abstract Syntax Tree)\n\tlib.gen_isl_ast();\n\n\t\/\/ Generate Halide statement for each function in the library.\n\tlib.gen_halide_stmt();\n\n\t\/\/ If you want to get the generated halide statement, call\n\t\/\/ lib.get_halide_stmts(). This will return a vector of\n\t\/\/ Halide::Internal::Stmt*. Each one among these statements\n\t\/\/ represents a function in the library.\n\n\t\/\/ Dump the iteration space IR (input) and the the Halide IR (output)\n\t\/\/ for each function in the library.\n\tlib.dump_iteration_space_IR();\n\tlib.dump_halide_IR();\n\n\t\/\/ Generate an object file from the library lib. \n\tlib.gen_halide_obj(\"build\/generated_lib_tutorial_01.o\");\n\n\treturn 0;\n}\n<commit_msg>Update tutorial_01.cpp<commit_after>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <coli\/debug.h>\n#include <coli\/core.h>\n\n#include <String.h>\n#include <Halide.h>\n\n\nint main(int argc, char **argv)\n{\n\t\/\/ Declare a library. A library is composed of a set of functions.\n\tcoli::library lib(\"library0\");\n\n\t\/\/ Declare a function in the library lib.\n\tcoli::function fct(\"function0\", &lib);\n\n\t\/\/ Declare the computations of the function fct.\n\t\/\/ To declare a computation, you need to provide:\n\t\/\/ (1) a Halide expression that represents the computation,\n\t\/\/ (2) an isl set representing the iteration space of the computation, and\n\t\/\/ (3) an isl context (which will be used by the ISL library calls).\n\tcoli::computation computation0(Halide::Expr((uint8_t) 3), \"{S0[i,j]: 0<=i<=1000 and 0<=j<=1000}\", &fct);\n\n\t\/\/ Create a memory buffer (2 dimensional).\n\tcoli::buffer buf0(\"buf0\", 2, {10,10}, Halide::Int(8), NULL, &fct);\n\n\t\/\/ Add the buffer as an argument to the function fct.\n\tfct.add_argument(buf0);\n\n\t\/\/ Map the computations to the buffers (i.e. where each computation\n\t\/\/ should be stored in the buffer).\n\tcomputation0.SetWriteAccess(\"{S0[i,j]->buf0[i, j]}\");\n\n\t\/\/ Set the schedule of each computation.\n\tcomputation0.tile(0,1,32,32);\n\tcomputation0.tag_parallel_dimension(1);\n\n\t\/\/ Generate an AST (abstract Syntax Tree)\n\tlib.gen_isl_ast();\n\n\t\/\/ Generate Halide statement for each function in the library.\n\tlib.gen_halide_stmt();\n\n\t\/\/ If you want to get the generated halide statements, call\n\t\/\/ lib.get_halide_stmts(). This will return a vector of\n\t\/\/ Halide::Internal::Stmt*. Each one among these statements\n\t\/\/ represents a function in the library.\n\n\t\/\/ Dump the iteration space IR (input) and the the Halide IR (output)\n\t\/\/ for each function in the library.\n\tlib.dump_iteration_space_IR();\n\tlib.dump_halide_IR();\n\n\t\/\/ Generate an object file from the library lib. \n\tlib.gen_halide_obj(\"build\/generated_lib_tutorial_01.o\");\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Amity - cross-platform game engine\n\/\/ https:\/\/github.com\/aduros\/amity\/blob\/master\/LICENSE.txt\n\n#include \"canvas\/CanvasContext.h\"\n\n#include \"AmityContext.h\"\n\nCanvasContext::CanvasContext (AmityContext* amityCtx) : _amityCtx(amityCtx)\n{\n CanvasState state;\n state.alpha = 1;\n state.blendMode = BLEND_DEFAULT;\n\n \/\/ FIXME: Detect if this extension is supported.\n \/\/ SDL_GL_ExtensionSupported(\"GL_OES_draw_texture\") appears to return false on the N1 even\n \/\/ though it works fine.\n state.canDrawTexture = true;\n\n state.translateX = 0;\n state.translateY = 0;\n state.scaleX = 1;\n state.scaleY = 1;\n\n _states.push(state);\n}\n\nvoid CanvasContext::save ()\n{\n glPushMatrix();\n _states.push(_states.top());\n}\n\nvoid CanvasContext::restore ()\n{\n glPopMatrix();\n _states.pop();\n}\n\nvoid CanvasContext::scale (float x, float y)\n{\n CanvasState& state = _states.top();\n if (state.canDrawTexture) {\n state.scaleX *= x;\n state.scaleY *= y;\n }\n glScalef(x, y, 0); \/\/ TODO: Usually no need to modify GL matrix if using draw_texture\n}\n\nvoid CanvasContext::rotate (float angle)\n{\n CanvasState& state = _states.top();\n state.canDrawTexture = false;\n\n glRotatef(angle, 0, 0, 1);\n}\n\nvoid CanvasContext::translate (float x, float y)\n{\n CanvasState& state = _states.top();\n if (state.canDrawTexture) {\n state.translateX += x*state.scaleX;\n state.translateY += y*state.scaleY;\n }\n glTranslatef(x, y, 0); \/\/ TODO: Usually no need to modify GL matrix if using draw_texture\n}\n\nvoid CanvasContext::multiplyAlpha (float factor)\n{\n _states.top().alpha *= factor;\n}\n\nvoid CanvasContext::setBlendMode (CanvasBlendMode blendMode)\n{\n}\n\nvoid CanvasContext::drawImage (const Texture* texture,\n float destX, float destY, float sourceX, float sourceY, float sourceW, float sourceH)\n{\n const CanvasState& state = _states.top();\n\n prepare(texture);\n\n if (state.canDrawTexture) {\n \/\/ Use GL draw_texture\n int windowHeight;\n getSize(NULL, &windowHeight);\n float destW = state.scaleX * sourceW;\n float destH = state.scaleY * sourceH;\n GLfloat cropRect[] = {\n sourceX, sourceY + texture->getHeight(), sourceW, -sourceH\n };\n glTexParameterfv(GL_TEXTURE_2D, GL_TEXTURE_CROP_RECT_OES, cropRect);\n glDrawTexfOES(state.translateX + destX,\n windowHeight - destY - destH - state.translateY,\n 0, destW, destH);\n\n } else {\n \/\/ Use GL vertex arrays\n GLfloat verts[] = {\n destX, destY,\n destX + sourceW, destY,\n destX, destY + sourceH,\n destX + sourceW, destY + sourceH,\n };\n\n float inverseMaxU = texture->getMaxU();\n float inverseMaxV = texture->getMaxV();\n float x1 = sourceX\/texture->getWidth() * inverseMaxU;\n float y1 = sourceY\/texture->getHeight() * inverseMaxV;\n float x2 = x1 + sourceW\/texture->getWidth() * inverseMaxU;\n float y2 = y1 + sourceH\/texture->getHeight() * inverseMaxV;\n GLfloat uv[] = {\n x1, y1,\n x2, y1,\n x1, y2,\n x2, y2,\n };\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glTexCoordPointer(2, GL_FLOAT, 0, uv);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n }\n}\n\nvoid CanvasContext::drawPattern (\n const Texture* texture, float destX, float destY, float destW, float destH)\n{\n prepare(texture);\n\n float w = texture->getWidth();\n float h = texture->getHeight();\n\n GLfloat verts[] = {\n destX, destY,\n destX + destW, destY,\n destX, destY + destH,\n destX + destW, destY + destH,\n };\n GLfloat uv[] = {\n 0, 0,\n destW\/w, 0,\n 0, destH\/h,\n destW\/w, destH\/h,\n };\n\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glTexCoordPointer(2, GL_FLOAT, 0, uv);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n}\n\nvoid CanvasContext::fillRect (uint32_t color, float x, float y, float width, float height)\n{\n const CanvasState& state = _states.top();\n GLfloat verts[] = {\n x, y,\n x + width, y,\n x, y + height,\n x + width, y + height,\n };\n\n glDisable(GL_TEXTURE_2D);\n glColor4ub(\n color >> 16,\n color >> 8,\n color >> 0,\n 0xff * state.alpha);\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n glEnable(GL_TEXTURE_2D);\n}\n\nvoid CanvasContext::getSize (int* width, int* height) const\n{\n#if SDL_VERSION_ATLEAST(1,3,0)\n SDL_GetWindowSize(_amityCtx->window, width, height);\n#else\n if (width != NULL) {\n *width = _amityCtx->screen->w;\n }\n if (height != NULL) {\n *height = _amityCtx->screen->h;\n }\n#endif\n}\n\nvoid CanvasContext::prepare (const Texture* texture)\n{\n const CanvasState& state = _states.top();\n\n glBindTexture(GL_TEXTURE_2D, texture->getId());\n\n \/\/ TODO: Only bother turning on blending for textures with an alpha channel\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glTexEnvf(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\n glColor4f(1, 1, 1, state.alpha);\n}\n<commit_msg>Disable GL_OES_draw_texture rendering.<commit_after>\/\/\n\/\/ Amity - cross-platform game engine\n\/\/ https:\/\/github.com\/aduros\/amity\/blob\/master\/LICENSE.txt\n\n#include \"canvas\/CanvasContext.h\"\n\n#include \"AmityContext.h\"\n\nCanvasContext::CanvasContext (AmityContext* amityCtx) : _amityCtx(amityCtx)\n{\n CanvasState state;\n state.alpha = 1;\n state.blendMode = BLEND_DEFAULT;\n\n \/\/ FIXME: Detect if this extension is supported.\n \/\/ SDL_GL_ExtensionSupported(\"GL_OES_draw_texture\") appears to return false on the N1 even\n \/\/ though it works fine.\n \/\/ TODO: Setting this to true doesn't seem to be a performance win. Think about removing it.\n state.canDrawTexture = false;\n\n state.translateX = 0;\n state.translateY = 0;\n state.scaleX = 1;\n state.scaleY = 1;\n\n _states.push(state);\n}\n\nvoid CanvasContext::save ()\n{\n glPushMatrix();\n _states.push(_states.top());\n}\n\nvoid CanvasContext::restore ()\n{\n glPopMatrix();\n _states.pop();\n}\n\nvoid CanvasContext::scale (float x, float y)\n{\n CanvasState& state = _states.top();\n if (state.canDrawTexture) {\n state.scaleX *= x;\n state.scaleY *= y;\n }\n glScalef(x, y, 0); \/\/ TODO: Usually no need to modify GL matrix if using draw_texture\n}\n\nvoid CanvasContext::rotate (float angle)\n{\n CanvasState& state = _states.top();\n state.canDrawTexture = false;\n\n glRotatef(angle, 0, 0, 1);\n}\n\nvoid CanvasContext::translate (float x, float y)\n{\n CanvasState& state = _states.top();\n if (state.canDrawTexture) {\n state.translateX += x*state.scaleX;\n state.translateY += y*state.scaleY;\n }\n glTranslatef(x, y, 0); \/\/ TODO: Usually no need to modify GL matrix if using draw_texture\n}\n\nvoid CanvasContext::multiplyAlpha (float factor)\n{\n _states.top().alpha *= factor;\n}\n\nvoid CanvasContext::setBlendMode (CanvasBlendMode blendMode)\n{\n}\n\nvoid CanvasContext::drawImage (const Texture* texture,\n float destX, float destY, float sourceX, float sourceY, float sourceW, float sourceH)\n{\n const CanvasState& state = _states.top();\n\n prepare(texture);\n\n if (state.canDrawTexture) {\n \/\/ Use GL draw_texture\n int windowHeight;\n getSize(NULL, &windowHeight);\n float destW = state.scaleX * sourceW;\n float destH = state.scaleY * sourceH;\n GLfloat cropRect[] = {\n sourceX, sourceY + sourceH, sourceW, -sourceH\n };\n glTexParameterfv(GL_TEXTURE_2D, GL_TEXTURE_CROP_RECT_OES, cropRect);\n glDrawTexfOES(state.translateX + destX,\n windowHeight - destY - destH - state.translateY,\n 0, destW, destH);\n\n } else {\n \/\/ Use GL vertex arrays\n GLfloat verts[] = {\n destX, destY,\n destX + sourceW, destY,\n destX, destY + sourceH,\n destX + sourceW, destY + sourceH,\n };\n\n float inverseMaxU = texture->getMaxU();\n float inverseMaxV = texture->getMaxV();\n float x1 = sourceX\/texture->getWidth() * inverseMaxU;\n float y1 = sourceY\/texture->getHeight() * inverseMaxV;\n float x2 = x1 + sourceW\/texture->getWidth() * inverseMaxU;\n float y2 = y1 + sourceH\/texture->getHeight() * inverseMaxV;\n GLfloat uv[] = {\n x1, y1,\n x2, y1,\n x1, y2,\n x2, y2,\n };\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glTexCoordPointer(2, GL_FLOAT, 0, uv);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n }\n}\n\nvoid CanvasContext::drawPattern (\n const Texture* texture, float destX, float destY, float destW, float destH)\n{\n prepare(texture);\n\n float w = texture->getWidth();\n float h = texture->getHeight();\n\n GLfloat verts[] = {\n destX, destY,\n destX + destW, destY,\n destX, destY + destH,\n destX + destW, destY + destH,\n };\n GLfloat uv[] = {\n 0, 0,\n destW\/w, 0,\n 0, destH\/h,\n destW\/w, destH\/h,\n };\n\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glTexCoordPointer(2, GL_FLOAT, 0, uv);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n}\n\nvoid CanvasContext::fillRect (uint32_t color, float x, float y, float width, float height)\n{\n const CanvasState& state = _states.top();\n GLfloat verts[] = {\n x, y,\n x + width, y,\n x, y + height,\n x + width, y + height,\n };\n\n glDisable(GL_TEXTURE_2D);\n glColor4ub(\n color >> 16,\n color >> 8,\n color >> 0,\n 0xff * state.alpha);\n glVertexPointer(2, GL_FLOAT, 0, verts);\n glDrawArrays(GL_TRIANGLE_STRIP, 0, 4);\n glEnable(GL_TEXTURE_2D);\n}\n\nvoid CanvasContext::getSize (int* width, int* height) const\n{\n#if SDL_VERSION_ATLEAST(1,3,0)\n SDL_GetWindowSize(_amityCtx->window, width, height);\n#else\n if (width != NULL) {\n *width = _amityCtx->screen->w;\n }\n if (height != NULL) {\n *height = _amityCtx->screen->h;\n }\n#endif\n}\n\nvoid CanvasContext::prepare (const Texture* texture)\n{\n const CanvasState& state = _states.top();\n\n glBindTexture(GL_TEXTURE_2D, texture->getId());\n\n \/\/ TODO: Only bother turning on blending for textures with an alpha channel\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glTexEnvf(GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_MODULATE);\n glColor4f(1, 1, 1, state.alpha);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <tiramisu\/debug.h>\n#include <tiramisu\/core.h>\n\n#include <string.h>\n#include <Halide.h>\n\n#include \"wrapper_tutorial_09.h\"\n\nusing namespace tiramisu;\n\n\/**\n * A more complicated reduction.\n *\n * We want to represent the following program\n *\n * for y = 0 to 19\n * for x = 0 to 9\n * f(x, y) = 1\n *\n * for y = 0 to 19\n * g(y) = 0\n * for y = 0 to 19\n * for rx = 0 to 9\n * g(y) += f(y, rx)\n *\n *\n * In order to implement this program, we create the following\n * computations\n *\n * {f[x,y]: 0<=x<19 and 0<=y<9}: 1\n * {g[y,-1]: 0<=y<19}: 0\n * {g[y,rx]: 0<=y<19 and 0<=rx<9}: g(y,rx-1) + f(y,rx)\n *\n *\/\n\nvoid generate_function(std::string name, int size, int val0)\n{\n tiramisu::global::set_default_tiramisu_options();\n global::set_loop_iterator_type(p_int32);\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer I\n \/\/ -------------------------------------------------------\n\n\n tiramisu::function function0(name);\n\n tiramisu::var x = tiramisu::var(\"x\");\n tiramisu::var y = tiramisu::var(\"y\");\n tiramisu::var rx = tiramisu::var(\"rx\");\n\n tiramisu::computation f(\"{f[y,x]: 0<=y<19 and 0<=x<9}\", tiramisu::expr((uint8_t) 1), true, p_uint8, &function0);\n tiramisu::computation g(\"{g[y,-1]: 0<=y<19}\", tiramisu::expr((uint8_t) 0), true, p_uint8, &function0);\n g.add_definitions(\"{g[y,rx]: 0<=y<19 and 0<=rx<9}\", g(y,rx-1) + f(y,rx), true, p_uint8, &function0);\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer II\n \/\/ -------------------------------------------------------\n\n\n g.after(f, computation::root);\n g.get_update(1).after(g, computation::root);\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer III\n \/\/ -------------------------------------------------------\n\n\n tiramisu::buffer f_buff(\"f_buff\", {19,size}, tiramisu::p_uint8, a_temporary, &function0);\n tiramisu::buffer g_buff(\"g_buff\", {size}, tiramisu::p_uint8, a_output, &function0);\n \/\/ Important: note that the access relations of the two computation C and C2 are identical.\n \/\/ The Tiramisu code generator assumes that the access relations of computations that have the same\n \/\/ name are identical. In this case, the two relations are equal to \"{C[j,i]->C_buff[i]}\".\n f.set_access(\"{f[y,x]->f_buff[y,x]}\");\n g.set_access(\"{g[y,rx]->g_buff[y]}\");\n g.get_update(1).set_access(\"{g[y,rx]->g_buff[y]}\");\n\n\n\n \/\/ -------------------------------------------------------\n \/\/ Code Generation\n \/\/ -------------------------------------------------------\n\n\n function0.set_arguments({&g_buff});\n function0.gen_time_space_domain();\n function0.gen_isl_ast();\n function0.gen_halide_stmt();\n function0.gen_c_code();\n function0.gen_halide_obj(\"build\/generated_fct_tutorial_09.o\");\n}\n\nint main(int argc, char **argv)\n{\n generate_function(\"tiramisu_generated_code\", SIZE1, 0);\n\n return 0;\n}\n<commit_msg>Update tutorial_09.cpp<commit_after>#include <isl\/set.h>\n#include <isl\/union_map.h>\n#include <isl\/union_set.h>\n#include <isl\/ast_build.h>\n#include <isl\/schedule.h>\n#include <isl\/schedule_node.h>\n\n#include <tiramisu\/debug.h>\n#include <tiramisu\/core.h>\n\n#include <string.h>\n#include <Halide.h>\n\n#include \"wrapper_tutorial_09.h\"\n\nusing namespace tiramisu;\n\n\/**\n * A more complicated reduction.\n *\n * We want to represent the following program\n *\n * for y = 0 to 19\n * for x = 0 to 9\n * f(x, y) = 1\n *\n * for y = 0 to 19\n * g(y) = 0\n * for y = 0 to 19\n * for rx = 0 to 9\n * g(y) += f(y, rx)\n *\n *\n * In order to implement this program, we create the following\n * computations\n *\n * {f[x,y]: 0<=x<19 and 0<=y<9}: 1\n * {g[y,-1]: 0<=y<19}: 0\n * {g[y,rx]: 0<=y<19 and 0<=rx<9}: g(y,rx-1) + f(y,rx)\n *\n *\/\n\nvoid generate_function(std::string name, int size, int val0)\n{\n tiramisu::global::set_default_tiramisu_options();\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer I\n \/\/ -------------------------------------------------------\n\n\n tiramisu::function function0(name);\n\n tiramisu::var x = tiramisu::var(\"x\");\n tiramisu::var y = tiramisu::var(\"y\");\n tiramisu::var rx = tiramisu::var(\"rx\");\n\n tiramisu::computation f(\"{f[y,x]: 0<=y<19 and 0<=x<9}\", tiramisu::expr((uint8_t) 1), true, p_uint8, &function0);\n tiramisu::computation g(\"{g[y,-1]: 0<=y<19}\", tiramisu::expr((uint8_t) 0), true, p_uint8, &function0);\n g.add_definitions(\"{g[y,rx]: 0<=y<19 and 0<=rx<9}\", g(y,rx-1) + f(y,rx), true, p_uint8, &function0);\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer II\n \/\/ -------------------------------------------------------\n\n\n g.after(f, computation::root);\n g.get_update(1).after(g, computation::root);\n\n\n \/\/ -------------------------------------------------------\n \/\/ Layer III\n \/\/ -------------------------------------------------------\n\n\n tiramisu::buffer f_buff(\"f_buff\", {19,size}, tiramisu::p_uint8, a_temporary, &function0);\n tiramisu::buffer g_buff(\"g_buff\", {size}, tiramisu::p_uint8, a_output, &function0);\n \/\/ Important: note that the access relations of the two computation C and C2 are identical.\n \/\/ The Tiramisu code generator assumes that the access relations of computations that have the same\n \/\/ name are identical. In this case, the two relations are equal to \"{C[j,i]->C_buff[i]}\".\n f.set_access(\"{f[y,x]->f_buff[y,x]}\");\n g.set_access(\"{g[y,rx]->g_buff[y]}\");\n g.get_update(1).set_access(\"{g[y,rx]->g_buff[y]}\");\n\n\n\n \/\/ -------------------------------------------------------\n \/\/ Code Generation\n \/\/ -------------------------------------------------------\n\n\n function0.set_arguments({&g_buff});\n function0.gen_time_space_domain();\n function0.gen_isl_ast();\n function0.gen_halide_stmt();\n function0.gen_c_code();\n function0.gen_halide_obj(\"build\/generated_fct_tutorial_09.o\");\n}\n\nint main(int argc, char **argv)\n{\n generate_function(\"tiramisu_generated_code\", SIZE1, 0);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX621\/RX62N S12AD 定義\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2022 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/device.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief S12AD ベース定義\n\t\t@param[in]\tbase\tベース・アドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base>\n\tstruct s12ad_base_t {\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D コントロールレジスタ（ADCSR）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adcsr_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t <io_, bitpos::B0> EXTRG;\n\t\t\tbit_rw_t <io_, bitpos::B1> TRGE;\n\t\t\tbits_rw_t<io_, bitpos::B2, 2> CKS;\n\t\t\tbit_rw_t <io_, bitpos::B4> ADIE;\n\n\t\t\tbit_rw_t <io_, bitpos::B6> ADCS;\n\t\t\tbit_rw_t <io_, bitpos::B7> ADST;\n\t\t};\n\t\ttypedef adcsr_t<base + 0x00> ADCSR_;\n\t\tstatic ADCSR_ ADCSR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換値加算モード選択レジスタ（ADADS）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adads_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 8> ADS;\n\t\t};\n\t\ttypedef adads_t<base + 0x08> ADADS_;\n\t\tstatic ADADS_ ADADS;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換値加算 \/ 平均回数選択レジスタ（ADADC）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adadc_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 2> ADC;\n\t\t};\n\t\ttypedef adadc_t<base + 0x0C> ADADC_;\n\t\tstatic ADADC_ ADADC;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D コントロール拡張レジスタ（ADCER）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adcer_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t <io_, bitpos::B5> ACE;\n\n\t\t\tbit_rw_t <io_, bitpos::B15> ADRFMT;\n\t\t};\n\t\ttypedef adcer_t<base + 0x0E> ADCER_;\n\t\tstatic ADCER_ ADCER;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換開始トリガ選択レジスタ（ADSTRGR）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adstrgr_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 4> ADSTRS;\n\t\t};\n\t\ttypedef adstrgr_t<base + 0x10> ADSTRGR_;\n\t\tstatic ADSTRGR_ ADSTRGR;\n\t};\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADADS_ s12ad_base_t<base>::ADADS;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADADC_ s12ad_base_t<base>::ADADC;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADCER_ s12ad_base_t<base>::ADCER;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADSTRGR_ s12ad_base_t<base>::ADSTRGR;\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief S12AD 定義\n\t\t@param[in]\tbase\tベース・アドレス\n\t\t@param[in]\tper\t\tペリフェラル型\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base, peripheral per>\n\tstruct s12ad_t : public s12ad_base_t<base> {\n\n\t\tstatic constexpr auto PERIPHERAL = per; \t\t\t\t\/\/\/< ペリフェラル型\n\t\tstatic constexpr auto S12ADI = ICU::VECTOR::S12ADI0;\t\/\/\/< スキャン終了割り込みベクター\n\t\tstatic constexpr uint32_t ANALOG_NUM = 8;\t\/\/\/< アナログ入力数\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief アナログ入力型\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class ANALOG : uint8_t {\n\t\t\tAIN000,\n\t\t\tAIN001,\n\t\t\tAIN002,\n\t\t\tAIN003,\n\t\t\tAIN004,\n\t\t\tAIN005,\n\t\t\tAIN006,\n\t\t\tAIN007,\n\t\t};\n\n\t\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tポート設定と解除\n\t\t\t@param[in]\tan\tアナログ入力型\n\t\t\t@param[in]\tf\tポート無効の場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\t\t\n\t\tstatic void enable(ANALOG an, bool f = true)\n\t\t{\n\t\t\tswitch(an) {\n\t\t\tcase ANALOG::AIN000:\n\t\t\t\tPORT4::ICR.B0 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN001:\n\t\t\t\tPORT4::ICR.B1 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN002:\n\t\t\t\tPORT4::ICR.B2 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN003:\n\t\t\t\tPORT4::ICR.B3 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN004:\n\t\t\t\tPORT4::ICR.B4 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN005:\n\t\t\t\tPORT4::ICR.B5 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN006:\n\t\t\t\tPORT4::ICR.B6 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN007:\n\t\t\t\tPORT4::ICR.B7 = f;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief A\/D データレジスタ（ADDR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstruct addr_t {\n\n\t\t\t\/\/-------------------------------------------------------------\/\/\n\t\t\t\/*!\n\t\t\t\t@brief データレジスタアクセスオペレーター\n\t\t\t\t@param[in]\tan\tアナログ入力型\n\t\t\t\t@return A\/D データレジスタ値\n\t\t\t*\/\n\t\t\t\/\/-------------------------------------------------------------\/\/\n\t\t\tuint16_t operator() (ANALOG an) {\n\t\t\t\treturn rd16_(base + 0x20 + static_cast<uint32_t>(an) * 2);\n\t\t\t}\n\t\t};\n\t\ttypedef addr_t ADDR_;\n\t\tstatic ADDR_ ADDR;\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief A\/D チャネル選択レジスタ定義 (ADANS)\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adans_t {\n\t\t\tvoid set(ANALOG an, bool f = true) {\n\t\t\t\tauto n = static_cast<uint32_t>(an);\n\t\t\t\tif(f) {\n\t\t\t\t\twr16_(ofs, rd16_(ofs) | (static_cast<uint16_t>(1) << n));\n\t\t\t\t} else {\n\t\t\t\t\twr16_(ofs, rd16_(ofs) & ~(static_cast<uint16_t>(1) << n));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ チャネルビット取得\n\t\t\tbool operator() (ANALOG an) const {\n\t\t\t\tauto n = static_cast<uint32_t>(an);\n\t\t\t\treturn (rd16_(ofs) >> n) & 1;\n\t\t\t}\n\t\t};\n\t\ttypedef adans_t<base + 0x04> ADANS_;\n\t\tstatic ADANS_ ADANS;\n\t};\n\t template <uint32_t base, peripheral per> typename s12ad_t<base, per>::ADDR_ s12ad_t<base, per>::ADDR;\n\t template <uint32_t base, peripheral per> typename s12ad_t<base, per>::ADANS_ s12ad_t<base, per>::ADANS;\n\n\ttypedef s12ad_t<0x00089000, peripheral::S12AD> S12AD;\n}\n<commit_msg>Update: cleanup<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tRX621\/RX62N S12AD 定義\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2022 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/device.hpp\"\n\nnamespace device {\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief S12AD ベース定義\n\t\t@param[in]\tbase\tベース・アドレス\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base>\n\tstruct s12ad_base_t {\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D コントロールレジスタ（ADCSR）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adcsr_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t <io_, bitpos::B0> EXTRG;\n\t\t\tbit_rw_t <io_, bitpos::B1> TRGE;\n\t\t\tbits_rw_t<io_, bitpos::B2, 2> CKS;\n\t\t\tbit_rw_t <io_, bitpos::B4> ADIE;\n\n\t\t\tbit_rw_t <io_, bitpos::B6> ADCS;\n\t\t\tbit_rw_t <io_, bitpos::B7> ADST;\n\t\t};\n\t\ttypedef adcsr_t<base + 0x00> ADCSR_;\n\t\tstatic ADCSR_ ADCSR;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換値加算モード選択レジスタ（ADADS）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adads_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 8> ADS;\n\t\t};\n\t\ttypedef adads_t<base + 0x08> ADADS_;\n\t\tstatic ADADS_ ADADS;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換値加算 \/ 平均回数選択レジスタ（ADADC）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adadc_t : public rw8_t<ofs> {\n\t\t\ttypedef rw8_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 2> ADC;\n\t\t};\n\t\ttypedef adadc_t<base + 0x0C> ADADC_;\n\t\tstatic ADADC_ ADADC;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D コントロール拡張レジスタ（ADCER）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adcer_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbit_rw_t <io_, bitpos::B5> ACE;\n\n\t\t\tbit_rw_t <io_, bitpos::B15> ADRFMT;\n\t\t};\n\t\ttypedef adcer_t<base + 0x0E> ADCER_;\n\t\tstatic ADCER_ ADCER;\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tA\/D 変換開始トリガ選択レジスタ（ADSTRGR）\n\t\t\t@param[in]\tofs\tオフセット\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adstrgr_t : public rw16_t<ofs> {\n\t\t\ttypedef rw16_t<ofs> io_;\n\t\t\tusing io_::operator =;\n\t\t\tusing io_::operator ();\n\t\t\tusing io_::operator |=;\n\t\t\tusing io_::operator &=;\n\n\t\t\tbits_rw_t<io_, bitpos::B0, 4> ADSTRS;\n\t\t};\n\t\ttypedef adstrgr_t<base + 0x10> ADSTRGR_;\n\t\tstatic ADSTRGR_ ADSTRGR;\n\t};\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADADS_ s12ad_base_t<base>::ADADS;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADADC_ s12ad_base_t<base>::ADADC;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADCER_ s12ad_base_t<base>::ADCER;\n\ttemplate <uint32_t base> typename s12ad_base_t<base>::ADSTRGR_ s12ad_base_t<base>::ADSTRGR;\n\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief S12AD 定義\n\t\t@param[in]\tbase\tベース・アドレス\n\t\t@param[in]\tper\t\tペリフェラル型\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <uint32_t base, peripheral per>\n\tstruct s12ad_t : public s12ad_base_t<base> {\n\n\t\tstatic constexpr auto PERIPHERAL = per; \t\t\t\t\/\/\/< ペリフェラル型\n\t\tstatic constexpr auto S12ADI = ICU::VECTOR::S12ADI0;\t\/\/\/< スキャン終了割り込みベクター\n\t\tstatic constexpr uint32_t ANALOG_NUM = 8;\t\/\/\/< アナログ入力数\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief アナログ入力型\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\tenum class ANALOG : uint8_t {\n\t\t\tAIN000,\n\t\t\tAIN001,\n\t\t\tAIN002,\n\t\t\tAIN003,\n\t\t\tAIN004,\n\t\t\tAIN005,\n\t\t\tAIN006,\n\t\t\tAIN007,\n\t\t};\n\n\t\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief\tポート設定と解除\n\t\t\t@param[in]\tan\tアナログ入力型\n\t\t\t@param[in]\tf\tポート無効の場合「false」\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\t\t\n\t\tstatic void enable(ANALOG an, bool f = true)\n\t\t{\n\t\t\tswitch(an) {\n\t\t\tcase ANALOG::AIN000:\n\t\t\t\tPORT4::ICR.B0 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN001:\n\t\t\t\tPORT4::ICR.B1 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN002:\n\t\t\t\tPORT4::ICR.B2 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN003:\n\t\t\t\tPORT4::ICR.B3 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN004:\n\t\t\t\tPORT4::ICR.B4 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN005:\n\t\t\t\tPORT4::ICR.B5 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN006:\n\t\t\t\tPORT4::ICR.B6 = f;\n\t\t\t\tbreak;\n\t\t\tcase ANALOG::AIN007:\n\t\t\t\tPORT4::ICR.B7 = f;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief A\/D データレジスタ（ADDR）\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tstruct addr_t {\n\n\t\t\t\/\/-------------------------------------------------------------\/\/\n\t\t\t\/*!\n\t\t\t\t@brief データレジスタアクセスオペレーター\n\t\t\t\t@param[in]\tan\tアナログ入力型\n\t\t\t\t@return A\/D データレジスタ値\n\t\t\t*\/\n\t\t\t\/\/-------------------------------------------------------------\/\/\n\t\t\tuint16_t operator() (ANALOG an) {\n\t\t\t\treturn rd16_(base + 0x20 + static_cast<uint32_t>(an) * 2);\n\t\t\t}\n\t\t};\n\t\ttypedef addr_t ADDR_;\n\t\tstatic ADDR_ ADDR;\n\n\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\t\/*!\n\t\t\t@brief A\/D チャネル選択レジスタ定義 (ADANS)\n\t\t*\/\n\t\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\ttemplate <uint32_t ofs>\n\t\tstruct adans_t {\n\t\t\tvoid set(ANALOG an, bool f = true) {\n\t\t\t\tauto n = static_cast<uint32_t>(an);\n\t\t\t\tif(f) {\n\t\t\t\t\twr16_(ofs, rd16_(ofs) | (static_cast<uint16_t>(1) << n));\n\t\t\t\t} else {\n\t\t\t\t\twr16_(ofs, rd16_(ofs) & ~(static_cast<uint16_t>(1) << n));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ チャネルビット取得\n\t\t\tbool operator() (ANALOG an) const {\n\t\t\t\tauto n = static_cast<uint32_t>(an);\n\t\t\t\treturn (rd16_(ofs) >> n) & 1;\n\t\t\t}\n\t\t};\n\t\ttypedef adans_t<base + 0x04> ADANS_;\n\t\tstatic ADANS_ ADANS;\n\t};\n\ttemplate <uint32_t base, peripheral per> typename s12ad_t<base, per>::ADDR_ s12ad_t<base, per>::ADDR;\n\ttemplate <uint32_t base, peripheral per> typename s12ad_t<base, per>::ADANS_ s12ad_t<base, per>::ADANS;\n\n\ttypedef s12ad_t<0x0008'9000, peripheral::S12AD> S12AD;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <qif>\n#include <string>\n\nusing namespace qif;\nusing namespace qif::measure;\nusing namespace std;\n\nint usage() {\n\tcout\n\t\t<< \"Usage: geo-optimal <goal> <width> <height> <cell_size> <constraint> <hard_max_loss> [<prior_file>|uniform|random]\\n\\n\"\n\t\t<< \"goal: one of\\n\"\n\t\t<< \" min_loss_given_min_bayesrisk\\n\"\n\t\t<< \" min_loss_given_min_georisk\\n\"\n\t\t<< \" max_bayesrisk_given_max_loss\\n\"\n\t\t<< \" max_georisk_given_max_loss\\n\"\n\t\t<< \"width: width of grid\\n\"\n\t\t<< \"height: height of grid\\n\"\n\t\t<< \"cell_size: length of each cell\\n\"\n\t\t<< \"constraint: the bayesrisk, georisk or loss constraint, depending on the goal\\n\"\n\t\t<< \"hard_max_loss: C_xy is forced to 0 when loss(x,y) > hard_max_loss (can greatly reduce the problem size)\\n\"\n\t\t<< \"prior_file: file with a single line containing the prior. 'uniform' or 'random' prior can also be used\\n\";\n\treturn -1;\n}\n\nint main(int argc, char* argv[]) {\n\tqif::rng::set_seed_random();\t\t\/\/ RNG initialization\n\n\tif(argc != 8) return usage();\n\n\tstring goal = argv[1];\n\tuint width = std::stoi(argv[2]);\n\tuint height = std::stoi(argv[3]);\n\tuint n = width * height;\n\tdouble cell_size = std::stod(argv[4]);\n\n\tauto euclid = metric::euclidean<double, point>();\n\tauto loss = cell_size * metric::compose(euclid, geo::cell_to_point(width));\n\n\tdouble constraint = std::stod(argv[5]);\n\tdouble hard_max_loss = std::stod(argv[6]);\n\tstring pi_file = argv[7];\n\n\tprob pi;\n\tif(pi_file == \"uniform\")\n\t\tpi = probab::uniform(n);\n\telse if(pi_file == \"random\")\n\t\tpi = probab::randu(n);\n\telse {\n\t\tif(!pi.load(pi_file)) {\n\t\t\tcerr << \"cannot open \" << pi_file << \"\\n\";\n\t\t\treturn 1;\n\t\t}\n\t\tif(pi.n_elem != n) {\n\t\t\tcerr << \"prior should have size \" << n << \"\\n\";\n\t\t\treturn 1;\n\t\t}\n\t\tif(!probab::is_proper(pi))\n\t\t\tcerr << \"warning: prior is not a proper distribution\\n\";\n\t}\n\n\tlp::Defaults::msg_level = lp::MsgLevel::ALL;\n\n\tcout << \"computing optimal mechanism\\n\";\n\n\tchan C;\n\n\tif(goal == \"min_loss_given_min_bayesrisk\")\n\t\tC = mechanism::bayes_risk::min_loss_given_min_risk(pi, n, constraint, loss, hard_max_loss);\n\telse if(goal == \"min_loss_given_min_georisk\")\n\t\tC = mechanism::l_risk::min_loss_given_min_risk(pi, n, n, constraint, loss, loss, hard_max_loss);\n\telse if(goal == \"max_bayesrisk_given_max_loss\")\n\t\tC = mechanism::bayes_risk::max_risk_given_max_loss(pi, n, constraint, loss, hard_max_loss);\n\telse if(goal == \"max_georisk_given_max_loss\")\n\t\tC = mechanism::l_risk::max_risk_given_max_loss(pi, n, n, constraint, loss, loss, hard_max_loss);\n\telse\n\t\treturn usage();\n\n\tcout << \"done\\n\";\n\n\tif(C.is_empty()) {\n\t\tcout << \"no solution for given constraints\\n\";\n\t\treturn -1;\n\t}\n\n\tC.save(\"C\", arma::raw_ascii);\n\n\tcout << \"Channel size: \" << C.n_rows << \"x\" << C.n_cols << \"\\n\";\n\tcout << \"BayesRisk: \" << bayes_risk::posterior(pi, C) << \"\\n\";\n\tcout << \"GeoRisk: \" << l_risk::posterior(loss, pi, C) << \"\\n\";\n\tcout << \"Exp Util Loss: \" << utility::expected_distance(loss, pi, C) << \"\\n\";\n}\n<commit_msg>geo-optimal: add solver param<commit_after>#include <qif>\n#include <string>\n\nusing namespace qif;\nusing namespace qif::measure;\nusing namespace std;\n\nint usage() {\n\tcout\n\t\t<< \"Usage: geo-optimal <goal> <width> <height> <cell_size> <constraint> <hard_max_loss> <prior> <solver>\\n\\n\"\n\t\t<< \"goal: one of\\n\"\n\t\t<< \" min_loss_given_min_bayesrisk\\n\"\n\t\t<< \" min_loss_given_min_georisk\\n\"\n\t\t<< \" max_bayesrisk_given_max_loss\\n\"\n\t\t<< \" max_georisk_given_max_loss\\n\"\n\t\t<< \"width: width of grid\\n\"\n\t\t<< \"height: height of grid\\n\"\n\t\t<< \"cell_size: length of each cell\\n\"\n\t\t<< \"constraint: the bayesrisk, georisk or loss constraint, depending on the goal\\n\"\n\t\t<< \"hard_max_loss: C_xy is forced to 0 when loss(x,y) > hard_max_loss (can greatly reduce the problem size)\\n\"\n\t\t<< \"prior: file with a single line containing the prior | uniform | random\\n\"\n\t\t<< \"solver: CLP | GLOP | GLPK\\n\";\n\treturn -1;\n}\n\nint main(int argc, char* argv[]) {\n\tqif::rng::set_seed_random();\t\t\/\/ RNG initialization\n\n\tif(argc != 9) return usage();\n\n\tstring goal = argv[1];\n\tuint width = std::stoi(argv[2]);\n\tuint height = std::stoi(argv[3]);\n\tuint n = width * height;\n\tdouble cell_size = std::stod(argv[4]);\n\n\tauto euclid = metric::euclidean<double, point>();\n\tauto loss = cell_size * metric::compose(euclid, geo::cell_to_point(width));\n\n\tdouble constraint = std::stod(argv[5]);\n\tdouble hard_max_loss = std::stod(argv[6]);\n\tstring pi_file = argv[7];\n\tstring solver = argv[8];\n\n\tprob pi;\n\tif(pi_file == \"uniform\")\n\t\tpi = probab::uniform(n);\n\telse if(pi_file == \"random\")\n\t\tpi = probab::randu(n);\n\telse {\n\t\tif(!pi.load(pi_file)) {\n\t\t\tcerr << \"cannot open \" << pi_file << \"\\n\";\n\t\t\treturn 1;\n\t\t}\n\t\tif(pi.n_elem != n) {\n\t\t\tcerr << \"prior should have size \" << n << \"\\n\";\n\t\t\treturn 1;\n\t\t}\n\t\tif(!probab::is_proper(pi))\n\t\t\tcerr << \"warning: prior is not a proper distribution\\n\";\n\t}\n\n\tlp::Defaults::msg_level = lp::MsgLevel::ALL;\n\tlp::Defaults::solver = solver;\n\n\tcout << \"computing optimal mechanism\\n\";\n\n\tchan C;\n\n\tif(goal == \"min_loss_given_min_bayesrisk\")\n\t\tC = mechanism::bayes_risk::min_loss_given_min_risk(pi, n, constraint, loss, hard_max_loss);\n\telse if(goal == \"min_loss_given_min_georisk\")\n\t\tC = mechanism::l_risk::min_loss_given_min_risk(pi, n, n, constraint, loss, loss, hard_max_loss);\n\telse if(goal == \"max_bayesrisk_given_max_loss\")\n\t\tC = mechanism::bayes_risk::max_risk_given_max_loss(pi, n, constraint, loss, hard_max_loss);\n\telse if(goal == \"max_georisk_given_max_loss\")\n\t\tC = mechanism::l_risk::max_risk_given_max_loss(pi, n, n, constraint, loss, loss, hard_max_loss);\n\telse\n\t\treturn usage();\n\n\tcout << \"done\\n\";\n\n\tif(C.is_empty()) {\n\t\tcout << \"no solution for given constraints\\n\";\n\t\treturn -1;\n\t}\n\n\t\/\/ C.save(\"C\", arma::raw_ascii);\n\n\tcout << \"Channel size: \" << C.n_rows << \"x\" << C.n_cols << \"\\n\";\n\treturn 0;\n\tcout << \"BayesRisk: \" << bayes_risk::posterior(pi, C) << \"\\n\";\n\tcout << \"GeoRisk: \" << l_risk::posterior(loss, pi, C) << \"\\n\";\n\tcout << \"Exp Util Loss: \" << utility::expected_distance(loss, pi, C) << \"\\n\";\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>~30fps version<commit_after><|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkPNGImageIO.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nCopyright (c) 2001 Insight Consortium\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * The name of the Insight Consortium, nor the names of any consortium members,\n nor of any contributors, may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n#include \"itkPNGImageIO.h\"\n#include \"png.h\"\n\nnamespace itk\n{\n\n\/\/ simple class to call fopen on construct and\n\/\/ fclose on destruct\nstruct PNGFileWrapper\n{\n PNGFileWrapper(const char* fname)\n {\n m_FilePointer = fopen(fname, \"rb\");\n }\n FILE* m_FilePointer;\n ~PNGFileWrapper()\n {\n if(m_FilePointer)\n {\n fclose(m_FilePointer);\n }\n }\n};\n\n \n \nbool PNGImageIO::CanReadFile(const char* file) \n{ \n PNGFileWrapper pngfp(file);\n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n return false;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n return false;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n return false;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n return false;\n }\n \n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return false;\n }\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n \n return true;\n}\n \nconst std::type_info& PNGImageIO::GetPixelType() const\n{\n switch(m_PixelType)\n {\n case UCHAR:\n return typeid(unsigned char);\n case USHORT:\n return typeid(unsigned short);\n case CHAR:\n case SHORT:\n case UINT:\n case INT:\n case ULONG:\n case LONG:\n case FLOAT:\n case DOUBLE:\n {\n itkErrorMacro (\"Invalid type: \" << m_PixelType << \", only unsigned char and unsigned short are allowed.\");\n return this->ConvertToTypeInfo(m_PixelType); \n }\n default:\n return typeid(unsigned char);\n }\n}\n\n \nunsigned int PNGImageIO::GetComponentSize() const\n{\n switch(m_PixelType)\n {\n case UCHAR:\n return sizeof(unsigned char);\n case USHORT:\n return sizeof(unsigned short);\n case CHAR:\n case SHORT:\n case UINT:\n case INT:\n case ULONG:\n case LONG:\n case FLOAT:\n case DOUBLE:\n {\n itkErrorMacro (\"Invalid type: \" << m_PixelType << \", only unsigned char and unsigned short are allowed.\");\n return 0;\n }\n }\n return 1;\n}\n\n \nvoid PNGImageIO::Read(void* buffer)\n{\n \/\/ use this class so return will call close\n PNGFileWrapper pngfp(this->GetFileName()); \n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n itkErrorMacro(\"Error PNGImageIO could not open file: \" \n << this->GetFileName());\n return;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n\n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n\n png_read_info(png_ptr, info_ptr);\n\n png_uint_32 width, height;\n int bit_depth, color_type, interlace_type;\n int compression_type, filter_method;\n png_get_IHDR(png_ptr, info_ptr, \n &width, &height,\n &bit_depth, &color_type, &interlace_type,\n &compression_type, &filter_method);\n\n \/\/ convert palettes to RGB\n if (color_type == PNG_COLOR_TYPE_PALETTE)\n {\n png_set_palette_to_rgb(png_ptr);\n }\n\n \/\/ minimum of a byte per pixel\n if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8) \n {\n png_set_gray_1_2_4_to_8(png_ptr);\n }\n\n \/\/ add alpha if any alpha found\n if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) \n {\n png_set_tRNS_to_alpha(png_ptr);\n }\n\n if (bit_depth > 8)\n {\n#ifndef ITK_WORDS_BIGENDIAN\n png_set_swap(png_ptr);\n#endif\n }\n\n \/\/ have libpng handle interlacing\n \/\/int number_of_passes = png_set_interlace_handling(png_ptr);\n \/\/ update the info now that we have defined the filters\n png_read_update_info(png_ptr, info_ptr);\n\n unsigned long rowbytes = png_get_rowbytes(png_ptr, info_ptr);\n unsigned char *tempImage = static_cast<unsigned char*>(buffer);\n png_bytep *row_pointers = new png_bytep [height];\n for (unsigned int ui = 0; ui < height; ++ui)\n {\n row_pointers[ui] = tempImage + rowbytes*ui;\n }\n png_read_image(png_ptr, row_pointers);\n delete [] row_pointers;\n \/\/ close the file\n png_read_end(png_ptr, NULL);\n png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n\n m_Spacing[0] = 1.0; \/\/ Is there any spacing information\n m_Spacing[1] = 1.0; \/\/ in PNG ?\n\n m_Origin[0] = 0.0;\n m_Origin[1] = 0.0;\n}\n\n\nPNGImageIO::PNGImageIO()\n{\n this->SetNumberOfDimensions(2);\n m_PixelType = UCHAR;\n}\n\nPNGImageIO::~PNGImageIO()\n{\n}\n\nvoid PNGImageIO::PrintSelf(std::ostream& os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n os << indent << \"PixelType \" << m_PixelType << \"\\n\";\n}\n\n \n \nvoid PNGImageIO::ReadImageInformation()\n{\n \/\/ use this class so return will call close\n PNGFileWrapper pngfp(m_FileName.c_str());\n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n return;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n return;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n return;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n return;\n }\n\n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return;\n }\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n\n png_read_info(png_ptr, info_ptr);\n\n png_uint_32 width, height;\n int bit_depth, color_type, interlace_type;\n int compression_type, filter_method;\n png_get_IHDR(png_ptr, info_ptr, \n &width, &height,\n &bit_depth, &color_type, &interlace_type,\n &compression_type, &filter_method);\n\n \/\/ convert palettes to RGB\n if (color_type == PNG_COLOR_TYPE_PALETTE)\n {\n png_set_palette_to_rgb(png_ptr);\n }\n\n \/\/ minimum of a byte per pixel\n if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8) \n {\n png_set_gray_1_2_4_to_8(png_ptr);\n }\n\n \/\/ add alpha if any alpha found\n if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) \n {\n png_set_tRNS_to_alpha(png_ptr);\n }\n\n \/\/ update the info now that we have defined the filters\n png_read_update_info(png_ptr, info_ptr);\n this->SetNumberOfDimensions(2);\n this->m_Dimensions[0] = width;\n this->m_Dimensions[1] = height;\n if (bit_depth <= 8)\n {\n m_PixelType = UCHAR;\n }\n else\n {\n m_PixelType = USHORT;\n }\n this->SetNumberOfComponents(png_get_channels(png_ptr, info_ptr));\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return;\n}\n\n\n} \/\/ end namespace itk\n<commit_msg>ERR: switches missing enums.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkPNGImageIO.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\nCopyright (c) 2001 Insight Consortium\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * The name of the Insight Consortium, nor the names of any consortium members,\n nor of any contributors, may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n#include \"itkPNGImageIO.h\"\n#include \"png.h\"\n\nnamespace itk\n{\n\n\/\/ simple class to call fopen on construct and\n\/\/ fclose on destruct\nstruct PNGFileWrapper\n{\n PNGFileWrapper(const char* fname)\n {\n m_FilePointer = fopen(fname, \"rb\");\n }\n FILE* m_FilePointer;\n ~PNGFileWrapper()\n {\n if(m_FilePointer)\n {\n fclose(m_FilePointer);\n }\n }\n};\n\n \n \nbool PNGImageIO::CanReadFile(const char* file) \n{ \n PNGFileWrapper pngfp(file);\n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n return false;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n return false;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n return false;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n return false;\n }\n \n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return false;\n }\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n \n return true;\n}\n \nconst std::type_info& PNGImageIO::GetPixelType() const\n{\n switch(m_PixelType)\n {\n case UCHAR:\n return typeid(unsigned char);\n case USHORT:\n return typeid(unsigned short);\n case CHAR:\n case SHORT:\n case UINT:\n case INT:\n case ULONG:\n case LONG:\n case FLOAT:\n case DOUBLE:\n {\n itkErrorMacro (\"Invalid type: \" << m_PixelType << \", only unsigned char and unsigned short are allowed.\");\n return this->ConvertToTypeInfo(m_PixelType); \n }\n case UNKNOWN:\n itkErrorMacro (\"Unknown pixel type: \" << m_PixelType);\n }\n return typeid(ImageIOBase::UnknownType);\n}\n\n \nunsigned int PNGImageIO::GetComponentSize() const\n{\n switch(m_PixelType)\n {\n case UCHAR:\n return sizeof(unsigned char);\n case USHORT:\n return sizeof(unsigned short);\n case CHAR:\n case SHORT:\n case UINT:\n case INT:\n case ULONG:\n case LONG:\n case FLOAT:\n case DOUBLE:\n case UNKNOWN:\n {\n itkErrorMacro (\"Invalid type: \" << m_PixelType << \", only unsigned char and unsigned short are allowed.\");\n return 0;\n }\n }\n return 1;\n}\n\n \nvoid PNGImageIO::Read(void* buffer)\n{\n \/\/ use this class so return will call close\n PNGFileWrapper pngfp(this->GetFileName()); \n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n itkErrorMacro(\"Error PNGImageIO could not open file: \" \n << this->GetFileName());\n return;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n\n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n itkErrorMacro(\"Error File is not png type\" << this->GetFileName());\n return;\n }\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n\n png_read_info(png_ptr, info_ptr);\n\n png_uint_32 width, height;\n int bit_depth, color_type, interlace_type;\n int compression_type, filter_method;\n png_get_IHDR(png_ptr, info_ptr, \n &width, &height,\n &bit_depth, &color_type, &interlace_type,\n &compression_type, &filter_method);\n\n \/\/ convert palettes to RGB\n if (color_type == PNG_COLOR_TYPE_PALETTE)\n {\n png_set_palette_to_rgb(png_ptr);\n }\n\n \/\/ minimum of a byte per pixel\n if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8) \n {\n png_set_gray_1_2_4_to_8(png_ptr);\n }\n\n \/\/ add alpha if any alpha found\n if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) \n {\n png_set_tRNS_to_alpha(png_ptr);\n }\n\n if (bit_depth > 8)\n {\n#ifndef ITK_WORDS_BIGENDIAN\n png_set_swap(png_ptr);\n#endif\n }\n\n \/\/ have libpng handle interlacing\n \/\/int number_of_passes = png_set_interlace_handling(png_ptr);\n \/\/ update the info now that we have defined the filters\n png_read_update_info(png_ptr, info_ptr);\n\n unsigned long rowbytes = png_get_rowbytes(png_ptr, info_ptr);\n unsigned char *tempImage = static_cast<unsigned char*>(buffer);\n png_bytep *row_pointers = new png_bytep [height];\n for (unsigned int ui = 0; ui < height; ++ui)\n {\n row_pointers[ui] = tempImage + rowbytes*ui;\n }\n png_read_image(png_ptr, row_pointers);\n delete [] row_pointers;\n \/\/ close the file\n png_read_end(png_ptr, NULL);\n png_destroy_read_struct(&png_ptr, &info_ptr, &end_info);\n\n m_Spacing[0] = 1.0; \/\/ Is there any spacing information\n m_Spacing[1] = 1.0; \/\/ in PNG ?\n\n m_Origin[0] = 0.0;\n m_Origin[1] = 0.0;\n}\n\n\nPNGImageIO::PNGImageIO()\n{\n this->SetNumberOfDimensions(2);\n m_PixelType = UCHAR;\n}\n\nPNGImageIO::~PNGImageIO()\n{\n}\n\nvoid PNGImageIO::PrintSelf(std::ostream& os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n os << indent << \"PixelType \" << m_PixelType << \"\\n\";\n}\n\n \n \nvoid PNGImageIO::ReadImageInformation()\n{\n \/\/ use this class so return will call close\n PNGFileWrapper pngfp(m_FileName.c_str());\n FILE* fp = pngfp.m_FilePointer;\n if(!fp)\n {\n return;\n }\n unsigned char header[8];\n fread(header, 1, 8, fp);\n bool is_png = !png_sig_cmp(header, 0, 8);\n if(!is_png)\n {\n return;\n }\n png_structp png_ptr = png_create_read_struct\n (PNG_LIBPNG_VER_STRING, (png_voidp)NULL,\n NULL, NULL);\n if (!png_ptr)\n {\n return;\n }\n \n png_infop info_ptr = png_create_info_struct(png_ptr);\n if (!info_ptr)\n {\n png_destroy_read_struct(&png_ptr,\n (png_infopp)NULL, (png_infopp)NULL);\n return;\n }\n\n png_infop end_info = png_create_info_struct(png_ptr);\n if (!end_info)\n {\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return;\n }\n \n png_init_io(png_ptr, fp);\n png_set_sig_bytes(png_ptr, 8);\n\n png_read_info(png_ptr, info_ptr);\n\n png_uint_32 width, height;\n int bit_depth, color_type, interlace_type;\n int compression_type, filter_method;\n png_get_IHDR(png_ptr, info_ptr, \n &width, &height,\n &bit_depth, &color_type, &interlace_type,\n &compression_type, &filter_method);\n\n \/\/ convert palettes to RGB\n if (color_type == PNG_COLOR_TYPE_PALETTE)\n {\n png_set_palette_to_rgb(png_ptr);\n }\n\n \/\/ minimum of a byte per pixel\n if (color_type == PNG_COLOR_TYPE_GRAY && bit_depth < 8) \n {\n png_set_gray_1_2_4_to_8(png_ptr);\n }\n\n \/\/ add alpha if any alpha found\n if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS)) \n {\n png_set_tRNS_to_alpha(png_ptr);\n }\n\n \/\/ update the info now that we have defined the filters\n png_read_update_info(png_ptr, info_ptr);\n this->SetNumberOfDimensions(2);\n this->m_Dimensions[0] = width;\n this->m_Dimensions[1] = height;\n if (bit_depth <= 8)\n {\n m_PixelType = UCHAR;\n }\n else\n {\n m_PixelType = USHORT;\n }\n this->SetNumberOfComponents(png_get_channels(png_ptr, info_ptr));\n png_destroy_read_struct(&png_ptr, &info_ptr,\n (png_infopp)NULL);\n return;\n}\n\n\n} \/\/ end namespace itk\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <conio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\/\/Criao da estrutura para AP2\ntypedef struct\n{\n\tint codigo;\n\tchar raca[30], nome[100];\n} registro;\n\ntypedef struct\n{\n\tint codigo, offset;\n} indice1;\n\ntypedef struct\n{\n\tchar vacina[30];\n\tint offset;\n} indice2;\n\nint Menu();\nvoid AbreArquivos(FILE **AP1, FILE **AP2, FILE **IndPrim, FILE **IndSec1, FILE **IndSec2);\nvoid CadastraVacina(FILE **AP1, FILE **AP2);\nvoid CadastraCachorro(FILE **AP2);\nvoid AtualizaInfoIndice(char status, FILE **arq);\nint ExisteCachorro(int codigo, FILE **AP2);\nint ProcuraEspacoVazio(FILE **AP1, int tam_reg);\nvoid AlteraCachorro(FILE **AP2);\n\nint main() \n{\n int opcao;\n\tFILE *AP1, *AP2, *IndPrim, *IndSec1, *IndSec2;\n\t\n\tAbreArquivos(&AP1, &AP2, &IndPrim, &IndSec1, &IndSec2);\n\topcao = Menu();\n\twhile (1)\n\t{\n\t switch(opcao)\n\t {\n\t case 1: CadastraCachorro(&AP2); break;\n\t case 2: CadastraVacina(&AP1, &AP2); break;\n\t\t\tcase 3: AlteraCachorro(&AP2);\n break;\n\t case 0: printf(\"\\nSaindo do Programa...\"); \n \t fclose(AP1); fclose(AP2); \/\/fecha arquivos principais\n fclose(IndPrim); fclose(IndSec1); fclose(IndSec2); \/\/fecha ndices\n getch(); break;\n\t default: printf(\"\\nOpcao invalida!\"); getch(); break;\n }\n opcao = Menu();\n }\n return 0;\n}\n\n\/*\nDESCRIO: Exibe as opes do menu.\nRETORNO: O nmero da opo escolhida pelo usurio\n*\/\nint Menu()\n{\n\tint opcao;\n\t\n\tsystem(\"CLS\");\n printf(\"\\n 1 - Cadastra Cachorro\");\n printf(\"\\n 2 - Cadastra Vacina\");\n\tprintf(\"\\n3 - Altera Cachorro\");\n\tprintf(\"\\n 0 - Sair\");\n\tprintf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", &opcao);\n\t\n\treturn opcao;\n}\n\n\/*\nDESCRIO: Verifica os arquivos j foram criados.\n Se no, cria-os.\nPARMETROS: AP1 - Arquivo Principal 1\n AP2 - Arquivo Principal 2\n\t IndPrim - Arquivo de ndice (busca por chave primria)\n\t\t\tIndSec1 - Arquivo de ndice 1 (busca por chave secundria)\n\t\t\tIndSec2 - Arquivo de ndice 2 (busca por chave secundria)\n*\/\nvoid AbreArquivos(FILE **AP1, FILE **AP2, FILE **IndPrim, FILE **IndSec1, FILE **IndSec2)\n{\n int header = -1;\n \/*No primeiro caso, ele entra no if pois o arquivo ainda no existe \n (Com o uso do r+b o arquivo tem que existir). \n A ento ele cria o arquivo com w+b*\/\n if ((*AP1 = fopen(\"AP1.bin\", \"r+b\")) == NULL) \/\/se o arquivo no exisitr\n {\n *AP1 = fopen(\"AP1.bin\", \"w+b\"); \/\/cria um novo arquivo vazio (AP1)\n \tfwrite(&header, sizeof(int), 1, *AP1);\n \t*IndPrim = fopen(\"IndPrim.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndPrim);\n \t*IndSec1 = fopen(\"IndSec1.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndSec1);\n \t*IndSec2 = fopen(\"IndSec2.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndSec2);\n\t}\n\t\/*else if (ExigeRecriaIndice(IndPrim))\n\t{\n\t\tRecriaIndicePrim(AP1);\n\t\tQuickSortInd1(INDEX1, 0, tam1);\n\t}\n\telse\n\t{\n\t\tIndPrim = fopen(\"IndPrim.bin\", \"r+b\");\n\t\tCarregaIndice(IndPrim, 1);\n \tIndSec1 = fopen(\"IndSec1.bin\", \"r+b\");\n \tCarregaIndice(IndSec1, 2);\n \tIndSec2 = fopen(\"IndSec2.bin\", \"r+b\");\n \tCarregaIndice(IndSec2, 1);\n\t}*\/\n \t\n if ((*AP2 = fopen(\"AP2.bin\", \"r+b\")) == NULL) \/\/se o arquivo no existir\n *AP2 = fopen(\"AP2.bin\", \"w+b\"); \/\/cria um novo arquivo vazio (AP2)\n}\n\n\/*\nDESCRIO: Cadastra informaes de um cachorro no Arquivo Principal 2\nPARMETROS: AP2 - Arquivo Principal 2\n*\/\nvoid CadastraCachorro(FILE **AP2)\n{\n\tregistro reg;\n\t\n\tsystem(\"CLS\");\n\tprintf(\"\\nCodigo: \");\n\tscanf(\"%d\", ®.codigo);\n\twhile (ExisteCachorro(reg.codigo, AP2))\n\t{\n\t\tsystem(\"CLS\");\n\t\tprintf(\"\\nCodigo ja cadastrado. Digite novamente!\");\n\t\tgetch(); system(\"CLS\");\n\t\tprintf(\"\\nCodigo: \");\n scanf(\"%d\", ®.codigo);\n\t}\n\tfflush(stdin);\n\tprintf(\"Raca: \");\n\tgets(reg.raca);\n\tprintf(\"Nome do Cachorro: \");\n\tgets(reg.nome);\n\n\t\n\tfseek(*AP2, 0, SEEK_END); \/\/seta a posio para o fim do arquivo.\n\tfwrite(®, sizeof(reg), 1, *AP2); \/\/escreve no fim do arquivo.\n}\n\n\/*\nDESCRIO: Atualiza o header do ndice com o status de atualizao\nPARMETROS: status - '*' - ndice atualizado\n '!' - ndice desatualizado\n arq - ndice a ser atualizado\n*\/\nvoid AtualizaInfoIndice(char status, FILE **arq)\n{\n\tfseek(*arq, 0, SEEK_SET);\n\tfputc(status, *arq);\t\n}\n\n\/*\nDESCRIO: Verifica se o cdigo j existe no arquivo.\nPARMETROS: codigo - Cdigo a ser verificado\n AP2 - Arquivo Principal 2\nRETORNOS: 0 - No existe um cachorro com o cdigo passado por parmetro\n 1 - Existe um cachorro com o cdigo passado por parmetro\n*\/\nint ExisteCachorro(int codigo, FILE **AP2)\n{\n\tregistro reg;\n\t\n\trewind(*AP2);\n\twhile (fread(®, sizeof(registro), 1, *AP2))\n\t{\n\t\tif (reg.codigo == codigo)\n\t\t{\n\t\t\treturn 1;\n\t\t\tbreak;\n\t\t}\t\n\t}\n return 0;\t\n}\n\n\/*\nDESCRIO: Realiza o cadastro de vacinas\nPARMETROS: AP1 - Arquivo principal 1\n AP2 - Arquivo principal 2\n*\/\nvoid CadastraVacina(FILE **AP1, FILE **AP2)\n{\n int cod_controle = 0, cod_cachorro, tam_reg, posicao, aux = 0;\n char verificador = '*', vacina[30], data[6], respo[100], registro[255];\n \n system(\"CLS\");\n printf(\"\\n Digite o codigo do cachorro <-1 para cadastrar um cachorro>: \");\n scanf(\"%d\", &cod_cachorro);\n if (cod_cachorro == -1)\n CadastraCachorro(AP2);\n else\n {\n while (!ExisteCachorro(cod_cachorro, AP2))\n { \n if (!aux)\n printf(\"\\n Cachorro inexistente. Digite novamente!\");\n else\n printf(\"\\n Nova busca...\" );\n getch(); system(\"CLS\"); \n printf(\"\\n Digite o codigo do cachorro <-1 para cadastrar um cachorro>: \");\n scanf(\"%d\", &cod_cachorro);\n if (cod_cachorro == -1)\n {\n CadastraCachorro(AP2);\n aux = 1;\n }\n }\n system(\"CLS\");\n cod_controle++;\/\/cod_controle = pegar do INDEX1 ordenado;\n printf(\"\\n Codigo do cachorro: %d\", cod_cachorro);\n fflush(stdin);\n printf(\"\\n\\n Nome da vacina: \");\n gets(vacina);\n printf(\"\\n Data de vacinacao <MM\/AA>: \");\n gets(data);\n printf(\"\\n Responsavel pela aplicacao: \");\n gets(respo);\n \n sprintf(registro, \"%d|%d|%s|%s|%s|\", cod_controle, cod_cachorro, vacina, data, respo);\n tam_reg = strlen(registro);\n posicao = ProcuraEspacoVazio(AP1, tam_reg);\n if (posicao != -1)\n fseek(*AP1, posicao, SEEK_SET);\n else\n fseek(*AP1, 0, SEEK_END);\n fwrite(&tam_reg, sizeof(int), 1, *AP1);\n fwrite(&verificador, sizeof(char), 1, *AP1);\n fwrite(registro, sizeof(char), tam_reg, *AP1);\n }\n}\n\n\/*\nDESCRIO: Retorna o espao vazio encontrado no arquivo\nPARMETROS: AP1 - Arquivo principal 1\n tam_reg - tamanho do registro a ser inserido\nRETORNO: posio livre para ser escrita\n*\/\nint ProcuraEspacoVazio(FILE **AP1, int tam_reg)\n{\n int offset, tam, pos;\n char ch;\n \n rewind(*AP1);\n fread(&offset, sizeof(int), 1, *AP1);\n if (offset == -1)\n return -1;\n else\n {\n fseek(*AP1, offset, SEEK_SET);\n pos = ftell(*AP1);\n while (fread(&tam, sizeof(int), 1, *AP1))\n {\n if (tam == -1)\n {\n return -1;\n break;\n }\n else\n {\n ch = fgetc(*AP1);\n if ((tam > tam_reg) && (ch == '!'))\n {\n return pos;\n break; \n }\n else\n {\n fread(&offset, sizeof(int), 1, *AP1);\n fseek(*AP1, offset, SEEK_SET);\n } \n } \n } \n }\n}\n\n\/*\nDESCRIO: Altera dados de um cachorro\nPARMETRO: AP2 - arquivo principal 2\n*\/\nvoid AlteraCachorro(FILE **AP2)\n{\n int op, cod, i = 0;\n char raca[30], nome[100];\n registro reg;\n \n system(\"CLS\");\n printf(\"Digite o codigo do cachorro: \");\n scanf(\"%d\", &cod);\n while (!ExisteCachorro(cod, AP2))\n {\n system(\"CLS\"); \n printf(\"\\n\\nCachorro inexistente. Digite novamente!\");\n getch();\n system(\"CLS\");\n printf(\"\\n\\nDigite o codigo do cachorro: \");\n scanf(\"%d\", &cod); \n }\n \n rewind(*AP2);\n\twhile (fread(®, sizeof(reg), 1, *AP2))\n\t{\n\t\tif (reg.codigo == cod)\n\t\t break;\n\t\ti++;\n\t}\n\t\n system(\"CLS\");\n printf(\"Qual campo deseja alterar\");\n printf(\"\\n\\n1 - Raca\");\n printf(\"\\n2 - Nome\");\n printf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", &op);\n while ((op != 1) && (op != 2))\n {\n system(\"CLS\");\n printf(\"Opcao invalida. Digite novamente!\");\n getch();\n system(\"CLS\");\n printf(\"Qual campo deseja alterar\");\n printf(\"\\n\\n1 - Raca\");\n printf(\"\\n2 - Nome\");\n printf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", op); \n }\n \n fflush(stdin);\n system(\"CLS\");\n switch(op)\n {\n case 1: printf(\"Digite a nova raca: \");\n gets(raca);\n strcpy(reg.raca, raca);\n break;\n case 2: printf(\"Digite o novo nome: \");\n gets(nome);\n strcpy(reg.nome, nome);\n break;\n }\n \n fseek(*AP2, sizeof(reg)*i, SEEK_SET);\n\tfwrite(®, sizeof(reg), 1, *AP2);\n}\n\n<commit_msg>teste<commit_after>#include <stdio.h>\n#include <conio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\/\/Criao da estrutura para AP2\ntypedef struct\n{\n\tint codigo;\n\tchar raca[30], nome[100];\n} registro;\n\ntypedef struct\n{\n\tint codigo, offset;\n} indice1;\n\ntypedef struct\n{\n\tchar vacina[30];\n\tint offset;\n} indice2;\n\nint Menu();\nvoid AbreArquivos(FILE **AP1, FILE **AP2, FILE **IndPrim, FILE **IndSec1, FILE **IndSec2);\nvoid CadastraVacina(FILE **AP1, FILE **AP2);\nvoid CadastraCachorro(FILE **AP2);\nvoid AtualizaInfoIndice(char status, FILE **arq);\nint ExisteCachorro(int codigo, FILE **AP2);\nint ProcuraEspacoVazio(FILE **AP1, int tam_reg);\nvoid AlteraCachorro(FILE **AP2);\n\nint main() \n{\n int opcao;\n\tFILE *AP1, *AP2, *IndPrim, *IndSec1, *IndSec2;\n\t\n\tAbreArquivos(&AP1, &AP2, &IndPrim, &IndSec1, &IndSec2);\n\topcao = Menu();\n\twhile (1)\n\t{\n\t switch(opcao)\n\t {\n\t case 1: CadastraCachorro(&AP2); break;\n\t case 2: CadastraVacina(&AP1, &AP2); break;\n\t\t\tcase 3: AlteraCachorro(&AP2);\n break;\n\t case 0: printf(\"\\nSaindo do Programa...\"); \n \t fclose(AP1); fclose(AP2); \/\/fecha arquivos principais\n fclose(IndPrim); fclose(IndSec1); fclose(IndSec2); \/\/fecha ndices\n getch(); break;\n\t default: printf(\"\\nOpcao invalida!\"); getch(); break;\n }\n opcao = Menu();\n }\n return 0;\n}\n\n\/*\nDESCRIO: Exibe as opes do menu.\nRETORNO: O nmero da opo escolhida pelo usurio\n*\/\nint Menu()\n{\n\tint opcao;\n\t\n\tsystem(\"CLS\");\n printf(\"\\n 1 - Cadastra Cachorro\");\n printf(\"\\n 2 - Cadastra Vacina\");\n\tprintf(\"\\n3 - Altera Cachorro\");\n\tprintf(\"\\n 0 - Sair\");\n\tprintf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", &opcao);\n\t\n\treturn opcao;\n}\n\n\/*\nDESCRIO: Verifica esssss os arquivos j foram criados.\n Se no, cria-os.\nPARMETROS: AP1 - Arquivo Principal 1\n AP2 - Arquivo Principal 2\n\t IndPrim - Arquivo de ndice (busca por chave primria)\n\t\t\tIndSec1 - Arquivo de ndice 1 (busca por chave secundria)\n\t\t\tIndSec2 - Arquivo de ndice 2 (busca por chave secundria)\n*\/\nvoid AbreArquivos(FILE **AP1, FILE **AP2, FILE **IndPrim, FILE **IndSec1, FILE **IndSec2)\n{\n int header = -1;\n \/*No primeiro caso, ele entra no if pois o arquivo ainda no existe \n (Com o uso do r+b o arquivo tem que existir). \n A ento ele cria o arquivo com w+b*\/\n if ((*AP1 = fopen(\"AP1.bin\", \"r+b\")) == NULL) \/\/se o arquivo no exisitr\n {\n *AP1 = fopen(\"AP1.bin\", \"w+b\"); \/\/cria um novo arquivo vazio (AP1)\n \tfwrite(&header, sizeof(int), 1, *AP1);\n \t*IndPrim = fopen(\"IndPrim.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndPrim);\n \t*IndSec1 = fopen(\"IndSec1.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndSec1);\n \t*IndSec2 = fopen(\"IndSec2.bin\", \"w+b\");\n \tAtualizaInfoIndice('!', IndSec2);\n\t}\n\t\/*else if (ExigeRecriaIndice(IndPrim))\n\t{\n\t\tRecriaIndicePrim(AP1);\n\t\tQuickSortInd1(INDEX1, 0, tam1);\n\t}\n\telse\n\t{\n\t\tIndPrim = fopen(\"IndPrim.bin\", \"r+b\");\n\t\tCarregaIndice(IndPrim, 1);\n \tIndSec1 = fopen(\"IndSec1.bin\", \"r+b\");\n \tCarregaIndice(IndSec1, 2);\n \tIndSec2 = fopen(\"IndSec2.bin\", \"r+b\");\n \tCarregaIndice(IndSec2, 1);\n\t}*\/\n \t\n if ((*AP2 = fopen(\"AP2.bin\", \"r+b\")) == NULL) \/\/se o arquivo no existir\n *AP2 = fopen(\"AP2.bin\", \"w+b\"); \/\/cria um novo arquivo vazio (AP2)\n}\n\n\/*\nDESCRIO: Cadastra informaes de um cachorro no Arquivo Principal 2\nPARMETROS: AP2 - Arquivo Principal 2\n*\/\nvoid CadastraCachorro(FILE **AP2)\n{\n\tregistro reg;\n\t\n\tsystem(\"CLS\");\n\tprintf(\"\\nCodigo: \");\n\tscanf(\"%d\", ®.codigo);\n\twhile (ExisteCachorro(reg.codigo, AP2))\n\t{\n\t\tsystem(\"CLS\");\n\t\tprintf(\"\\nCodigo ja cadastrado. Digite novamente!\");\n\t\tgetch(); system(\"CLS\");\n\t\tprintf(\"\\nCodigo: \");\n scanf(\"%d\", ®.codigo);\n\t}\n\tfflush(stdin);\n\tprintf(\"Raca: \");\n\tgets(reg.raca);\n\tprintf(\"Nome do Cachorro: \");\n\tgets(reg.nome);\n\n\t\n\tfseek(*AP2, 0, SEEK_END); \/\/seta a posio para o fim do arquivo.\n\tfwrite(®, sizeof(reg), 1, *AP2); \/\/escreve no fim do arquivo.\n}\n\n\/*\nDESCRIO: Atualiza o header do ndice com o status de atualizao\nPARMETROS: status - '*' - ndice atualizado\n '!' - ndice desatualizado\n arq - ndice a ser atualizado\n*\/\nvoid AtualizaInfoIndice(char status, FILE **arq)\n{\n\tfseek(*arq, 0, SEEK_SET);\n\tfputc(status, *arq);\t\n}\n\n\/*\nDESCRIO: Verifica se o cdigo j existe no arquivo.\nPARMETROS: codigo - Cdigo a ser verificado\n AP2 - Arquivo Principal 2\nRETORNOS: 0 - No existe um cachorro com o cdigo passado por parmetro\n 1 - Existe um cachorro com o cdigo passado por parmetro\n*\/\nint ExisteCachorro(int codigo, FILE **AP2)\n{\n\tregistro reg;\n\t\n\trewind(*AP2);\n\twhile (fread(®, sizeof(registro), 1, *AP2))\n\t{\n\t\tif (reg.codigo == codigo)\n\t\t{\n\t\t\treturn 1;\n\t\t\tbreak;\n\t\t}\t\n\t}\n return 0;\t\n}\n\n\/*\nDESCRIO: Realiza o cadastro de vacinas\nPARMETROS: AP1 - Arquivo principal 1\n AP2 - Arquivo principal 2\n*\/\nvoid CadastraVacina(FILE **AP1, FILE **AP2)\n{\n int cod_controle = 0, cod_cachorro, tam_reg, posicao, aux = 0;\n char verificador = '*', vacina[30], data[6], respo[100], registro[255];\n \n system(\"CLS\");\n printf(\"\\n Digite o codigo do cachorro <-1 para cadastrar um cachorro>: \");\n scanf(\"%d\", &cod_cachorro);\n if (cod_cachorro == -1)\n CadastraCachorro(AP2);\n else\n {\n while (!ExisteCachorro(cod_cachorro, AP2))\n { \n if (!aux)\n printf(\"\\n Cachorro inexistente. Digite novamente!\");\n else\n printf(\"\\n Nova busca...\" );\n getch(); system(\"CLS\"); \n printf(\"\\n Digite o codigo do cachorro <-1 para cadastrar um cachorro>: \");\n scanf(\"%d\", &cod_cachorro);\n if (cod_cachorro == -1)\n {\n CadastraCachorro(AP2);\n aux = 1;\n }\n }\n system(\"CLS\");\n cod_controle++;\/\/cod_controle = pegar do INDEX1 ordenado;\n printf(\"\\n Codigo do cachorro: %d\", cod_cachorro);\n fflush(stdin);\n printf(\"\\n\\n Nome da vacina: \");\n gets(vacina);\n printf(\"\\n Data de vacinacao <MM\/AA>: \");\n gets(data);\n printf(\"\\n Responsavel pela aplicacao: \");\n gets(respo);\n \n sprintf(registro, \"%d|%d|%s|%s|%s|\", cod_controle, cod_cachorro, vacina, data, respo);\n tam_reg = strlen(registro);\n posicao = ProcuraEspacoVazio(AP1, tam_reg);\n if (posicao != -1)\n fseek(*AP1, posicao, SEEK_SET);\n else\n fseek(*AP1, 0, SEEK_END);\n fwrite(&tam_reg, sizeof(int), 1, *AP1);\n fwrite(&verificador, sizeof(char), 1, *AP1);\n fwrite(registro, sizeof(char), tam_reg, *AP1);\n }\n}\n\n\/*\nDESCRIO: Retorna o espao vazio encontrado no arquivo\nPARMETROS: AP1 - Arquivo principal 1\n tam_reg - tamanho do registro a ser inserido\nRETORNO: posio livre para ser escrita\n*\/\nint ProcuraEspacoVazio(FILE **AP1, int tam_reg)\n{\n int offset, tam, pos;\n char ch;\n \n rewind(*AP1);\n fread(&offset, sizeof(int), 1, *AP1);\n if (offset == -1)\n return -1;\n else\n {\n fseek(*AP1, offset, SEEK_SET);\n pos = ftell(*AP1);\n while (fread(&tam, sizeof(int), 1, *AP1))\n {\n if (tam == -1)\n {\n return -1;\n break;\n }\n else\n {\n ch = fgetc(*AP1);\n if ((tam > tam_reg) && (ch == '!'))\n {\n return pos;\n break; \n }\n else\n {\n fread(&offset, sizeof(int), 1, *AP1);\n fseek(*AP1, offset, SEEK_SET);\n } \n } \n } \n }\n}\n\n\/*\nDESCRIO: Altera dados de um cachorro\nPARMETRO: AP2 - arquivo principal 2\n*\/\nvoid AlteraCachorro(FILE **AP2)\n{\n int op, cod, i = 0;\n char raca[30], nome[100];\n registro reg;\n \n system(\"CLS\");\n printf(\"Digite o codigo do cachorro: \");\n scanf(\"%d\", &cod);\n while (!ExisteCachorro(cod, AP2))\n {\n system(\"CLS\"); \n printf(\"\\n\\nCachorro inexistente. Digite novamente!\");\n getch();\n system(\"CLS\");\n printf(\"\\n\\nDigite o codigo do cachorro: \");\n scanf(\"%d\", &cod); \n }\n \n rewind(*AP2);\n\twhile (fread(®, sizeof(reg), 1, *AP2))\n\t{\n\t\tif (reg.codigo == cod)\n\t\t break;\n\t\ti++;\n\t}\n\t\n system(\"CLS\");\n printf(\"Qual campo deseja alterar\");\n printf(\"\\n\\n1 - Raca\");\n printf(\"\\n2 - Nome\");\n printf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", &op);\n while ((op != 1) && (op != 2))\n {\n system(\"CLS\");\n printf(\"Opcao invalida. Digite novamente!\");\n getch();\n system(\"CLS\");\n printf(\"Qual campo deseja alterar\");\n printf(\"\\n\\n1 - Raca\");\n printf(\"\\n2 - Nome\");\n printf(\"\\n\\nEscolha a opcao: \");\n scanf(\"%d\", op); \n }\n \n fflush(stdin);\n system(\"CLS\");\n switch(op)\n {\n case 1: printf(\"Digite a nova raca: \");\n gets(raca);\n strcpy(reg.raca, raca);\n break;\n case 2: printf(\"Digite o novo nome: \");\n gets(nome);\n strcpy(reg.nome, nome);\n break;\n }\n \n fseek(*AP2, sizeof(reg)*i, SEEK_SET);\n\tfwrite(®, sizeof(reg), 1, *AP2);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Jamoma RampLib Base Class\n * Copyright © 2008, Tim Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#ifdef WIN_VERSION\n #pragma warning(disable:4083) \/\/warning C4083: expected 'newline'; found identifier 's'\n#endif \/\/ WIN_VERSION\n\n#include \"RampLib.h\"\n#include \"ext.h\"\n\n#define thisTTClass RampUnit\n\nRampUnit::RampUnit(const char* rampName, RampUnitCallback aCallbackMethod, void *aBaton)\n\t: TTObject(kTTValNONE), startValue(NULL), targetValue(NULL), currentValue(NULL), normalizedValue(0.0), numValues(0), functionUnit(NULL)\n{\n\tcallback = aCallbackMethod;\n\tbaton = aBaton;\n\tsetNumValues(1);\n\tcurrentValue[0] = 0.0;\n\ttargetValue[0] = 0.0;\n\tstartValue[0] = 0.0;\n\n\taddAttributeWithSetter(Function, kTypeSymbol);\n\tsetAttributeValue(TT(\"Function\"), TT(\"linear\"));\n}\n\n\nRampUnit::~RampUnit()\n{\n\tTTObjectRelease(&functionUnit);\n\tdelete [] currentValue;\n\tdelete [] targetValue;\n\tdelete [] startValue;\n}\n\n\nvoid RampUnit::set(TTUInt32 newNumValues, TTFloat64 *newValues)\n{\n\tTTUInt32 i;\n\t\n\tstop();\n\tsetNumValues(newNumValues);\n\tfor (i=0; i<newNumValues; i++)\n\t\tcurrentValue[i] = newValues[i];\n}\n\n\nTTErr RampUnit::setFunction(const TTValue& functionName)\n{\n\tTTErr\t\terr;\n\tTTSymbolPtr\tnewFunctionName = NULL;\n\t\n\tfunctionName.get(0, &newFunctionName);\n\t\n\tif (newFunctionName == TT(\"none\"))\n\t\tnewFunctionName = TT(\"linear\");\n\t\n\tif (newFunctionName == mFunction)\n\t\treturn kTTErrNone;\n\t\n\tmFunction = newFunctionName;\n\terr = FunctionLib::createUnit(mFunction, (TTObject**)&functionUnit);\n\tif (err)\n\t\tlogError(\"Jamoma ramp unit failed to load the requested FunctionUnit from TTBlue.\");\n\treturn err;\n}\n\n\nTTErr RampUnit::getFunctionParameterNames(TTValue& names)\n{\n\tfunctionUnit->getAttributeNames(names);\n\treturn kTTErrNone;\n}\n\n\nTTErr RampUnit::setFunctionParameterValue(TTSymbol* parameterName, TTValue& newValue)\n{\n\tfunctionUnit->setAttributeValue(parameterName, newValue);\n\treturn kTTErrNone;\n}\n\n\nTTErr RampUnit::getFunctionParameterValue(TTSymbol* parameterName, TTValue& value)\n{\n\tfunctionUnit->getAttributeValue(parameterName, value);\n\treturn kTTErrNone;\n}\n\n\nvoid RampUnit::setNumValues(TTUInt32 newNumValues)\n{\n\tif (newNumValues != numValues) {\n\t\tif (numValues != 0) {\n\t\t\tdelete [] currentValue;\n\t\t\tdelete [] targetValue;\n\t\t\tdelete [] startValue;\n\t\t}\n\t\t\n\t\tcurrentValue = new TTFloat64[newNumValues];\n\t\ttargetValue = new TTFloat64[newNumValues];\n\t\tstartValue = new TTFloat64[newNumValues];\n\t\tnumValues = newNumValues;\n\t}\n\tsendMessage(TT(\"numValuesChanged\"));\t\/\/ Notify sub-classes (if they respond to this message)\n}\n\n \n\/***************************************************************************\n\tRampLib\n ***************************************************************************\/\n\n#include \"AsyncRamp.h\"\n#include \"NoneRamp.h\"\n#include \"QueueRamp.h\"\n#include \"SchedulerRamp.h\"\n\n\nJamomaError RampLib::createUnit(const TTSymbol* unitName, RampUnit **unit, RampUnitCallback callback, void* baton)\n{\n\tif (*unit)\n\t\tdelete *unit;\n\n\t\/\/ These should be alphabetized\n\tif (unitName == TT(\"async\"))\n\t\t*unit = (RampUnit*) new AsyncRamp(callback, baton);\n\telse if (unitName == TT(\"none\"))\n\t\t*unit = (RampUnit*) new NoneRamp(callback, baton);\n\telse if (unitName == TT(\"queue\"))\n\t\t*unit = (RampUnit*) new QueueRamp(callback, baton);\n\telse if (unitName == TT(\"scheduler\"))\n\t\t*unit = (RampUnit*) new SchedulerRamp(callback, baton);\n\telse {\n\t\t\/\/ Invalid function specified default to linear\n\/\/\t\tTTLogError(\"rampLib: Invalid rampUnit: %s\", (char*)unitName);\n\t\terror(\"puke\");\n\t\t*unit = (RampUnit*) new NoneRamp(callback, baton);\n\t}\n\treturn JAMOMA_ERR_NONE;\n}\n\n\nvoid RampLib::getUnitNames(TTValue& unitNames)\n{\n\tunitNames.clear();\n\tunitNames.append(TT(\"async\"));\n\tunitNames.append(TT(\"none\"));\n\tunitNames.append(TT(\"queue\"));\n\tunitNames.append(TT(\"scheduler\"));\n}\n\n<commit_msg>RampUnit: fix for uninitialized member variable (mFunction) that, if the state of the computer's memory was just right (as it was in Bug #431 from Trond) would cause a comparison to pass when it should have failed.<commit_after>\/* \n * Jamoma RampLib Base Class\n * Copyright © 2008, Tim Place\n * \n * License: This code is licensed under the terms of the GNU LGPL\n * http:\/\/www.gnu.org\/licenses\/lgpl.html \n *\/\n\n#ifdef WIN_VERSION\n #pragma warning(disable:4083) \/\/warning C4083: expected 'newline'; found identifier 's'\n#endif \/\/ WIN_VERSION\n\n#include \"RampLib.h\"\n#include \"ext.h\"\n\n#define thisTTClass RampUnit\n\nRampUnit::RampUnit(const char* rampName, RampUnitCallback aCallbackMethod, void *aBaton) : \n\tTTObject(kTTValNONE),\n\tmFunction(NULL),\n\tcallback(aCallbackMethod),\n\tbaton(aBaton),\n\tstartValue(NULL),\n\ttargetValue(NULL),\n\tcurrentValue(NULL),\n\tnormalizedValue(0.0),\n\tnumValues(0),\n\tfunctionUnit(NULL)\n{\n\tsetNumValues(1);\n\tcurrentValue[0] = 0.0;\n\ttargetValue[0] = 0.0;\n\tstartValue[0] = 0.0;\n\n\taddAttributeWithSetter(Function, kTypeSymbol);\n\tsetAttributeValue(TT(\"Function\"), TT(\"linear\"));\n}\n\n\nRampUnit::~RampUnit()\n{\n\tTTObjectRelease(&functionUnit);\n\tdelete [] currentValue;\n\tdelete [] targetValue;\n\tdelete [] startValue;\n}\n\n\nvoid RampUnit::set(TTUInt32 newNumValues, TTFloat64 *newValues)\n{\n\tTTUInt32 i;\n\t\n\tstop();\n\tsetNumValues(newNumValues);\n\tfor (i=0; i<newNumValues; i++)\n\t\tcurrentValue[i] = newValues[i];\n}\n\n\nTTErr RampUnit::setFunction(const TTValue& functionName)\n{\n\tTTErr\t\terr;\n\tTTSymbolPtr\tnewFunctionName = NULL;\n\t\n\tfunctionName.get(0, &newFunctionName);\n\t\n\tif (newFunctionName == TT(\"none\"))\n\t\tnewFunctionName = TT(\"linear\");\n\t\n\tif (newFunctionName == mFunction)\n\t\treturn kTTErrNone;\n\t\n\tmFunction = newFunctionName;\n\terr = FunctionLib::createUnit(mFunction, (TTObject**)&functionUnit);\n\tif (err)\n\t\tlogError(\"Jamoma ramp unit failed to load the requested FunctionUnit from TTBlue.\");\n\treturn err;\n}\n\n\nTTErr RampUnit::getFunctionParameterNames(TTValue& names)\n{\n\tfunctionUnit->getAttributeNames(names);\n\treturn kTTErrNone;\n}\n\n\nTTErr RampUnit::setFunctionParameterValue(TTSymbol* parameterName, TTValue& newValue)\n{\n\tfunctionUnit->setAttributeValue(parameterName, newValue);\n\treturn kTTErrNone;\n}\n\n\nTTErr RampUnit::getFunctionParameterValue(TTSymbol* parameterName, TTValue& value)\n{\n\tfunctionUnit->getAttributeValue(parameterName, value);\n\treturn kTTErrNone;\n}\n\n\nvoid RampUnit::setNumValues(TTUInt32 newNumValues)\n{\n\tif (newNumValues != numValues) {\n\t\tif (numValues != 0) {\n\t\t\tdelete [] currentValue;\n\t\t\tdelete [] targetValue;\n\t\t\tdelete [] startValue;\n\t\t}\n\t\t\n\t\tcurrentValue = new TTFloat64[newNumValues];\n\t\ttargetValue = new TTFloat64[newNumValues];\n\t\tstartValue = new TTFloat64[newNumValues];\n\t\tnumValues = newNumValues;\n\t}\n\tsendMessage(TT(\"numValuesChanged\"));\t\/\/ Notify sub-classes (if they respond to this message)\n}\n\n \n\/***************************************************************************\n\tRampLib\n ***************************************************************************\/\n\n#include \"AsyncRamp.h\"\n#include \"NoneRamp.h\"\n#include \"QueueRamp.h\"\n#include \"SchedulerRamp.h\"\n\n\nJamomaError RampLib::createUnit(const TTSymbol* unitName, RampUnit **unit, RampUnitCallback callback, void* baton)\n{\n\tif (*unit)\n\t\tdelete *unit;\n\n\t\/\/ These should be alphabetized\n\tif (unitName == TT(\"async\"))\n\t\t*unit = (RampUnit*) new AsyncRamp(callback, baton);\n\telse if (unitName == TT(\"none\"))\n\t\t*unit = (RampUnit*) new NoneRamp(callback, baton);\n\telse if (unitName == TT(\"queue\"))\n\t\t*unit = (RampUnit*) new QueueRamp(callback, baton);\n\telse if (unitName == TT(\"scheduler\"))\n\t\t*unit = (RampUnit*) new SchedulerRamp(callback, baton);\n\telse {\n\t\t\/\/ Invalid function specified default to linear\n\/\/\t\tTTLogError(\"rampLib: Invalid rampUnit: %s\", (char*)unitName);\n\t\terror(\"puke\");\n\t\t*unit = (RampUnit*) new NoneRamp(callback, baton);\n\t}\n\treturn JAMOMA_ERR_NONE;\n}\n\n\nvoid RampLib::getUnitNames(TTValue& unitNames)\n{\n\tunitNames.clear();\n\tunitNames.append(TT(\"async\"));\n\tunitNames.append(TT(\"none\"));\n\tunitNames.append(TT(\"queue\"));\n\tunitNames.append(TT(\"scheduler\"));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*! \\file DegRateNuclide.cpp\n \\brief Implements the DegRateNuclide class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n#include <boost\/lexical_cast.hpp>\n\n#include \"CycException.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n#include \"DegRateNuclide.h\"\n#include \"Material.h\"\n\nusing namespace std;\nusing boost::lexical_cast;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::DegRateNuclide():\n deg_rate_(0),\n v_(0),\n tot_deg_(0),\n last_degraded_(0)\n{\n wastes_ = deque<mat_rsrc_ptr>();\n\n set_geom(GeometryPtr(new Geometry()));\n last_updated_=0;\n\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::DegRateNuclide(QueryEngine* qe):\n deg_rate_(0),\n v_(0),\n tot_deg_(0),\n last_degraded_(0)\n{\n wastes_ = deque<mat_rsrc_ptr>();\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n\n set_geom(GeometryPtr(new Geometry()));\n last_updated_=0;\n\n initModuleMembers(qe);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::~DegRateNuclide(){\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid DegRateNuclide::initModuleMembers(QueryEngine* qe){\n set_v(lexical_cast<double>(qe->getElementContent(\"advective_velocity\")));\n set_deg_rate(lexical_cast<double>(qe->getElementContent(\"degradation\")));\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"The DegRateNuclide Class initModuleMembers(qe) function has been called\";;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nNuclideModelPtr DegRateNuclide::copy(const NuclideModel& src){\n const DegRateNuclide* src_ptr = dynamic_cast<const DegRateNuclide*>(&src);\n\n set_v(src_ptr->v());\n set_deg_rate(src_ptr->deg_rate());\n set_tot_deg(0);\n set_last_degraded(TI->time());\n\n \/\/ copy the geometry AND the centroid. It should be reset later.\n set_geom(GeometryPtr(new Geometry()));\n geom_->copy(src_ptr->geom(), src_ptr->geom()->centroid());\n update(TI->time());\n\n wastes_ = deque<mat_rsrc_ptr>();\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n\n return shared_from_this();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update(int the_time){\n update_vec_hist(the_time);\n update_conc_hist(the_time);\n set_last_updated(the_time);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::print(){\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide Model\";;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::absorb(mat_rsrc_ptr matToAdd)\n{\n \/\/ Get the given DegRateNuclide's contaminant material.\n \/\/ add the material to it with the material absorb function.\n \/\/ each nuclide model should override this function\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide is absorbing material: \";\n matToAdd->print();\n wastes_.push_back(matToAdd);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nmat_rsrc_ptr DegRateNuclide::extract(const CompMapPtr comp_to_rem, double kg_to_rem)\n{\n \/\/ Get the given DegRateNuclide's contaminant material.\n \/\/ add the material to it with the material extract function.\n \/\/ each nuclide model should override this function\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide\" << \"is extracting composition: \";\n comp_to_rem->print() ;\n mat_rsrc_ptr to_ret = mat_rsrc_ptr(MatTools::extract(comp_to_rem, kg_to_rem, wastes_));\n update(last_updated());\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::transportNuclides(int the_time){\n \/\/ This should transport the nuclides through the component.\n \/\/ It will likely rely on the internal flux and will produce an external flux. \n update_degradation(the_time, deg_rate());\n update(the_time);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::set_deg_rate(double cur_rate){\n if( cur_rate < 0 || cur_rate > 1 ) {\n stringstream msg_ss;\n msg_ss << \"The DegRateNuclide degradation rate range is 0 to 1, inclusive.\";\n msg_ss << \" The value provided was \";\n msg_ss << cur_rate;\n msg_ss << \".\";\n LOG(LEV_ERROR,\"GRDRNuc\") << msg_ss.str();;\n throw CycRangeException(msg_ss.str());\n } else {\n deg_rate_ = cur_rate;\n }\n assert((cur_rate >=0) && (cur_rate <= 1));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble DegRateNuclide::contained_mass(){\n return shared_from_this()->contained_mass(last_degraded());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> DegRateNuclide::source_term_bc(){\n return make_pair(contained_vec(last_degraded()), \n tot_deg()*shared_from_this()->contained_mass(last_degraded()));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::dirichlet_bc(){\n IsoConcMap dirichlet, whole_vol;\n whole_vol = conc_hist(last_degraded());\n IsoConcMap::const_iterator it;\n for( it=whole_vol.begin(); it!=whole_vol.end(); ++it){\n dirichlet[(*it).first] = tot_deg()*(*it).second ;\n }\n return dirichlet;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nConcGradMap DegRateNuclide::neumann_bc(IsoConcMap c_ext, Radius r_ext){\n ConcGradMap to_ret;\n\n IsoConcMap c_int = conc_hist(last_degraded());\n Radius r_int = geom_->radial_midpoint();\n \n int iso;\n IsoConcMap::iterator it;\n for( it=c_int.begin(); it != c_int.end(); ++it){\n iso = (*it).first;\n if( c_ext.count(iso) != 0) { \n \/\/ in both\n to_ret[iso] = calc_conc_grad(c_ext[iso], c_int[iso]*tot_deg(), r_ext, r_int);\n } else { \n \/\/ in c_int_only\n to_ret[iso] = calc_conc_grad(0, c_int[iso]*tot_deg(), r_ext, r_int);\n }\n }\n for( it=c_ext.begin(); it != c_ext.end(); ++it){\n iso = (*it).first;\n if( c_int.count(iso) == 0) { \n \/\/ in c_ext only\n to_ret[iso] = calc_conc_grad(c_ext[iso], 0, r_ext, r_int);\n }\n }\n\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoFluxMap DegRateNuclide::cauchy_bc(IsoConcMap c_ext, Radius r_ext){\n \/\/ -D dC\/dx + v_xC = v_x C\n IsoFluxMap to_ret;\n ConcGradMap neumann = neumann_bc(c_ext, r_ext);\n ConcGradMap::iterator it;\n Iso iso;\n Elem elem;\n for( it = neumann.begin(); it != neumann.end(); ++it){\n iso = (*it).first;\n elem = iso\/1000;\n to_ret.insert(make_pair(iso, -mat_table_->D(elem)*(*it).second + v()*shared_from_this()->dirichlet_bc(iso)));\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::update_conc_hist(int the_time){\n return update_conc_hist(the_time, wastes_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::update_conc_hist(int the_time, deque<mat_rsrc_ptr> mats){\n assert(last_degraded() <= the_time);\n assert(last_updated() <= the_time);\n\n IsoConcMap to_ret;\n\n pair<IsoVector, double> sum_pair; \n sum_pair = vec_hist_[the_time];\n\n int iso;\n double conc;\n if(sum_pair.second != 0 && geom_->volume() != numeric_limits<double>::infinity()) { \n double scale = sum_pair.second\/geom_->volume();\n CompMapPtr curr_comp = sum_pair.first.comp();\n CompMap::const_iterator it;\n it=(*curr_comp).begin();\n while(it != (*curr_comp).end() ) {\n iso = (*it).first;\n conc = (*it).second;\n to_ret.insert(make_pair(iso, conc*scale));\n ++it;\n }\n } else {\n to_ret[ 92235 ] = 0; \n }\n conc_hist_[the_time] = to_ret ;\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble DegRateNuclide::update_degradation(int the_time, double cur_rate){\n assert(last_degraded() <= the_time);\n if(cur_rate != deg_rate()){\n set_deg_rate(cur_rate);\n };\n double total = tot_deg() + deg_rate()*(the_time - last_degraded());\n set_tot_deg(min(1.0, total));\n set_last_degraded(the_time);\n\n return tot_deg_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update_vec_hist(int the_time){\n vec_hist_[ the_time ] = MatTools::sum_mats(wastes_) ;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update_inner_bc(int the_time, std::vector<NuclideModelPtr> daughters){\n std::map<NuclideModelPtr, std::pair<IsoVector,double> > to_ret;\n std::vector<NuclideModelPtr>::iterator daughter;\n std::pair<IsoVector, double> source_term;\n for( daughter = daughters.begin(); daughter!=daughters.end(); ++daughter){\n source_term = (*daughter)->source_term_bc();\n if( source_term.second > 0 ){\n absorb((*daughter)->extract(source_term.first.comp(), source_term.second));\n }\n }\n}\n\n<commit_msg>reductio of variable scope<commit_after>\/*! \\file DegRateNuclide.cpp\n \\brief Implements the DegRateNuclide class used by the Generic Repository \n \\author Kathryn D. Huff\n *\/\n#include <iostream>\n#include <fstream>\n#include <deque>\n#include <time.h>\n#include <assert.h>\n#include <boost\/lexical_cast.hpp>\n\n#include \"CycException.h\"\n#include \"Logger.h\"\n#include \"Timer.h\"\n#include \"DegRateNuclide.h\"\n#include \"Material.h\"\n\nusing namespace std;\nusing boost::lexical_cast;\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::DegRateNuclide():\n deg_rate_(0),\n v_(0),\n tot_deg_(0),\n last_degraded_(0)\n{\n wastes_ = deque<mat_rsrc_ptr>();\n\n set_geom(GeometryPtr(new Geometry()));\n last_updated_=0;\n\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::DegRateNuclide(QueryEngine* qe):\n deg_rate_(0),\n v_(0),\n tot_deg_(0),\n last_degraded_(0)\n{\n wastes_ = deque<mat_rsrc_ptr>();\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n\n set_geom(GeometryPtr(new Geometry()));\n last_updated_=0;\n\n initModuleMembers(qe);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nDegRateNuclide::~DegRateNuclide(){\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nvoid DegRateNuclide::initModuleMembers(QueryEngine* qe){\n set_v(lexical_cast<double>(qe->getElementContent(\"advective_velocity\")));\n set_deg_rate(lexical_cast<double>(qe->getElementContent(\"degradation\")));\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"The DegRateNuclide Class initModuleMembers(qe) function has been called\";;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nNuclideModelPtr DegRateNuclide::copy(const NuclideModel& src){\n const DegRateNuclide* src_ptr = dynamic_cast<const DegRateNuclide*>(&src);\n\n set_v(src_ptr->v());\n set_deg_rate(src_ptr->deg_rate());\n set_tot_deg(0);\n set_last_degraded(TI->time());\n\n \/\/ copy the geometry AND the centroid. It should be reset later.\n set_geom(GeometryPtr(new Geometry()));\n geom_->copy(src_ptr->geom(), src_ptr->geom()->centroid());\n update(TI->time());\n\n wastes_ = deque<mat_rsrc_ptr>();\n vec_hist_ = VecHist();\n conc_hist_ = ConcHist();\n\n return shared_from_this();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update(int the_time){\n update_vec_hist(the_time);\n update_conc_hist(the_time);\n set_last_updated(the_time);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::print(){\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide Model\";;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::absorb(mat_rsrc_ptr matToAdd)\n{\n \/\/ Get the given DegRateNuclide's contaminant material.\n \/\/ add the material to it with the material absorb function.\n \/\/ each nuclide model should override this function\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide is absorbing material: \";\n matToAdd->print();\n wastes_.push_back(matToAdd);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\nmat_rsrc_ptr DegRateNuclide::extract(const CompMapPtr comp_to_rem, double kg_to_rem)\n{\n \/\/ Get the given DegRateNuclide's contaminant material.\n \/\/ add the material to it with the material extract function.\n \/\/ each nuclide model should override this function\n LOG(LEV_DEBUG2,\"GRDRNuc\") << \"DegRateNuclide\" << \"is extracting composition: \";\n comp_to_rem->print() ;\n mat_rsrc_ptr to_ret = mat_rsrc_ptr(MatTools::extract(comp_to_rem, kg_to_rem, wastes_));\n update(last_updated());\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::transportNuclides(int the_time){\n \/\/ This should transport the nuclides through the component.\n \/\/ It will likely rely on the internal flux and will produce an external flux. \n update_degradation(the_time, deg_rate());\n update(the_time);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::set_deg_rate(double cur_rate){\n if( cur_rate < 0 || cur_rate > 1 ) {\n stringstream msg_ss;\n msg_ss << \"The DegRateNuclide degradation rate range is 0 to 1, inclusive.\";\n msg_ss << \" The value provided was \";\n msg_ss << cur_rate;\n msg_ss << \".\";\n LOG(LEV_ERROR,\"GRDRNuc\") << msg_ss.str();;\n throw CycRangeException(msg_ss.str());\n } else {\n deg_rate_ = cur_rate;\n }\n assert((cur_rate >=0) && (cur_rate <= 1));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble DegRateNuclide::contained_mass(){\n return shared_from_this()->contained_mass(last_degraded());\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \npair<IsoVector, double> DegRateNuclide::source_term_bc(){\n return make_pair(contained_vec(last_degraded()), \n tot_deg()*shared_from_this()->contained_mass(last_degraded()));\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::dirichlet_bc(){\n IsoConcMap dirichlet, whole_vol;\n whole_vol = conc_hist(last_degraded());\n IsoConcMap::const_iterator it;\n for( it=whole_vol.begin(); it!=whole_vol.end(); ++it){\n dirichlet[(*it).first] = tot_deg()*(*it).second ;\n }\n return dirichlet;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nConcGradMap DegRateNuclide::neumann_bc(IsoConcMap c_ext, Radius r_ext){\n ConcGradMap to_ret;\n\n IsoConcMap c_int = conc_hist(last_degraded());\n Radius r_int = geom_->radial_midpoint();\n \n int iso;\n IsoConcMap::iterator it;\n for( it=c_int.begin(); it != c_int.end(); ++it){\n iso = (*it).first;\n if( c_ext.count(iso) != 0) { \n \/\/ in both\n to_ret[iso] = calc_conc_grad(c_ext[iso], c_int[iso]*tot_deg(), r_ext, r_int);\n } else { \n \/\/ in c_int_only\n to_ret[iso] = calc_conc_grad(0, c_int[iso]*tot_deg(), r_ext, r_int);\n }\n }\n for( it=c_ext.begin(); it != c_ext.end(); ++it){\n iso = (*it).first;\n if( c_int.count(iso) == 0) { \n \/\/ in c_ext only\n to_ret[iso] = calc_conc_grad(c_ext[iso], 0, r_ext, r_int);\n }\n }\n\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoFluxMap DegRateNuclide::cauchy_bc(IsoConcMap c_ext, Radius r_ext){\n \/\/ -D dC\/dx + v_xC = v_x C\n IsoFluxMap to_ret;\n ConcGradMap neumann = neumann_bc(c_ext, r_ext);\n ConcGradMap::iterator it;\n Iso iso;\n Elem elem;\n for( it = neumann.begin(); it != neumann.end(); ++it){\n iso = (*it).first;\n elem = iso\/1000;\n to_ret.insert(make_pair(iso, -mat_table_->D(elem)*(*it).second + v()*shared_from_this()->dirichlet_bc(iso)));\n }\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::update_conc_hist(int the_time){\n return update_conc_hist(the_time, wastes_);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nIsoConcMap DegRateNuclide::update_conc_hist(int the_time, deque<mat_rsrc_ptr> mats){\n assert(last_degraded() <= the_time);\n assert(last_updated() <= the_time);\n\n IsoConcMap to_ret;\n\n pair<IsoVector, double> sum_pair; \n sum_pair = vec_hist_[the_time];\n\n if(sum_pair.second != 0 && geom_->volume() != numeric_limits<double>::infinity()) { \n double scale = sum_pair.second\/geom_->volume();\n CompMapPtr curr_comp = sum_pair.first.comp();\n CompMap::const_iterator it;\n it=(*curr_comp).begin();\n while(it != (*curr_comp).end() ) {\n int iso((*it).first);\n double conc((*it).second);\n to_ret.insert(make_pair(iso, conc*scale));\n ++it;\n }\n } else {\n to_ret[ 92235 ] = 0; \n }\n conc_hist_[the_time] = to_ret ;\n return to_ret;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \ndouble DegRateNuclide::update_degradation(int the_time, double cur_rate){\n assert(last_degraded() <= the_time);\n if(cur_rate != deg_rate()){\n set_deg_rate(cur_rate);\n };\n double total = tot_deg() + deg_rate()*(the_time - last_degraded());\n set_tot_deg(min(1.0, total));\n set_last_degraded(the_time);\n\n return tot_deg_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update_vec_hist(int the_time){\n vec_hist_[ the_time ] = MatTools::sum_mats(wastes_) ;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid DegRateNuclide::update_inner_bc(int the_time, std::vector<NuclideModelPtr> daughters){\n std::map<NuclideModelPtr, std::pair<IsoVector,double> > to_ret;\n std::vector<NuclideModelPtr>::iterator daughter;\n std::pair<IsoVector, double> source_term;\n for( daughter = daughters.begin(); daughter!=daughters.end(); ++daughter){\n source_term = (*daughter)->source_term_bc();\n if( source_term.second > 0 ){\n absorb((*daughter)->extract(source_term.first.comp(), source_term.second));\n }\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/planning\/common\/planning_gflags.h\"\nDEFINE_int32(planning_loop_rate, 5, \"Loop rate for planning node\");\n\nDEFINE_string(rtk_trajectory_filename, \"modules\/planning\/data\/garage.csv\",\n \"Loop rate for planning node\");\n\nDEFINE_uint64(backward_trajectory_point_num, 10,\n \"The number of points to be included in planning trajectory \"\n \"before the matched point\");\n\nDEFINE_uint64(rtk_trajectory_forward, 800,\n \"The number of points to be included in RTK trajectory \"\n \"after the matched point\");\n\nDEFINE_double(trajectory_resolution, 0.01,\n \"The time resolution of \"\n \"output trajectory.\");\n\nDEFINE_double(\n look_backward_distance, 10,\n \"look backward this distance when creating reference line from routing\");\n\nDEFINE_double(\n look_forward_distance, 70,\n \"look forward this distance when creating reference line from routing\");\nDEFINE_bool(enable_smooth_reference_line, true,\n \"enable smooth the map reference line\");\n\nDEFINE_int32(max_history_frame_num, 5, \"The maximum history frame number\");\n\nDEFINE_double(max_collision_distance, 0.1,\n \"considered as collision if distance (meters) is smaller than or \"\n \"equal to this (meters)\");\n\nDEFINE_double(replan_distance_threshold, 5.0,\n \"The distance threshold of replan\");\n\nDEFINE_double(default_reference_line_width, 4.0,\n \"Default reference line width\");\n\nDEFINE_double(planning_upper_speed_limit, 10.0, \"Maximum speed in planning.\");\n\nDEFINE_double(planning_distance, 100, \"Planning distance\");\n\nDEFINE_double(trajectory_time_length, 8.0, \"Trajectory time length\");\nDEFINE_double(trajectory_time_resolution, 0.1,\n \"Trajectory time resolution in planning\");\nDEFINE_double(output_trajectory_time_resolution, 0.05,\n \"Trajectory time resolution when publish\");\n\nDEFINE_double(speed_lower_bound, 0.0, \"The lowest speed allowed.\");\nDEFINE_double(speed_upper_bound, 40.0, \"The highest speed allowed.\");\n\nDEFINE_double(longitudinal_acceleration_lower_bound, -4.5,\n \"The lowest longitudinal acceleration allowed.\");\nDEFINE_double(longitudinal_acceleration_upper_bound, 4.0,\n \"The highest longitudinal acceleration allowed.\");\n\nDEFINE_double(lateral_acceleration_bound, 4.5,\n \"Bound of lateral acceleration; symmetric for left and right\");\nDEFINE_double(lateral_jerk_bound, 4.0,\n \"Bound of lateral jerk; symmetric for left and right\");\n\nDEFINE_double(longitudinal_jerk_lower_bound, -4.0,\n \"The lower bound of longitudinal jerk.\");\nDEFINE_double(longitudinal_jerk_upper_bound, 4.0,\n \"The upper bound of longitudinal jerk.\");\n\nDEFINE_double(kappa_bound, 0.23, \"The bound for vehicle curvature\");\n\n\/\/ ST Boundary\nDEFINE_double(st_max_s, 80, \"the maximum s of st boundary\");\nDEFINE_double(st_max_t, 10, \"the maximum t of st boundary\");\n\n\/\/ Decision Part\nDEFINE_double(static_obstacle_speed_threshold, 1.0,\n \"obstacles are considered as static obstacle if its speed is \"\n \"less than this value (m\/s)\");\nDEFINE_bool(enable_nudge_decision, false, \"enable nudge decision\");\nDEFINE_double(static_decision_ignore_s_range, 3.0,\n \"threshold for judging nudge in dp path computing decision\");\nDEFINE_double(static_decision_nudge_l_buffer, 0.5, \"l buffer for nudge\");\nDEFINE_double(stop_distance_obstacle, 5.0,\n \"stop distance from in-lane obstacle (meters)\");\nDEFINE_double(destination_adjust_distance_buffer, 1.0,\n \"distance buffer when adjusting destination stop line\");\nDEFINE_double(min_driving_width, 2.5,\n \"minimum road width(meters) for adc to drive through\");\nDEFINE_double(nudge_distance_obstacle, 0.3,\n \"minimum distance to nudge a obstacle (meters)\");\nDEFINE_double(follow_min_distance, 10,\n \"min follow distance for vehicles\/bicycles\/moving objects\");\nDEFINE_double(stop_line_min_distance, 0.0,\n \"min distance (meters) to stop line for a valid stop\");\n\nDEFINE_string(destination_obstacle_id, \"DEST\",\n \"obstacle id for converting destination to an obstacle\");\nDEFINE_int32(virtual_obstacle_perception_id, -1,\n \"virtual obstacle perception id(a negative int)\");\nDEFINE_double(virtual_stop_wall_length, 0.1,\n \"virtual stop wall length (meters)\");\nDEFINE_double(virtual_stop_wall_width, 3.7, \"virtual stop wall width (meters)\");\nDEFINE_double(virtual_stop_wall_height, 2.0,\n \"virtual stop wall height (meters)\");\n\n\/\/ Prediction Part\nDEFINE_double(prediction_total_time, 5.0, \"Total prediction time\");\nDEFINE_bool(align_prediction_time, true,\n \"enable align prediction data based planning time\");\n\n\/\/ Trajectory\nDEFINE_bool(enable_rule_layer, true,\n \"enable rule for trajectory before model computation\");\n\n\/\/ Traffic decision\n\nDEFINE_string(planning_config_file,\n \"modules\/planning\/conf\/planning_config.pb.txt\",\n \"planning config file\");\n\nDEFINE_int32(trajectory_point_num_for_debug, 10,\n \"number of output trajectory points for debugging\");\n\nDEFINE_double(decision_valid_stop_range, 0.5,\n \"The valid stop range in decision.\");\nDEFINE_bool(enable_record_debug, true,\n \"True to enable record debug into debug protobuf.\");\nDEFINE_bool(enable_prediction, true, \"True to enable prediction input.\");\n<commit_msg>planning: increase stop distance.<commit_after>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/planning\/common\/planning_gflags.h\"\nDEFINE_int32(planning_loop_rate, 5, \"Loop rate for planning node\");\n\nDEFINE_string(rtk_trajectory_filename, \"modules\/planning\/data\/garage.csv\",\n \"Loop rate for planning node\");\n\nDEFINE_uint64(backward_trajectory_point_num, 10,\n \"The number of points to be included in planning trajectory \"\n \"before the matched point\");\n\nDEFINE_uint64(rtk_trajectory_forward, 800,\n \"The number of points to be included in RTK trajectory \"\n \"after the matched point\");\n\nDEFINE_double(trajectory_resolution, 0.01,\n \"The time resolution of \"\n \"output trajectory.\");\n\nDEFINE_double(\n look_backward_distance, 10,\n \"look backward this distance when creating reference line from routing\");\n\nDEFINE_double(\n look_forward_distance, 70,\n \"look forward this distance when creating reference line from routing\");\nDEFINE_bool(enable_smooth_reference_line, true,\n \"enable smooth the map reference line\");\n\nDEFINE_int32(max_history_frame_num, 5, \"The maximum history frame number\");\n\nDEFINE_double(max_collision_distance, 0.1,\n \"considered as collision if distance (meters) is smaller than or \"\n \"equal to this (meters)\");\n\nDEFINE_double(replan_distance_threshold, 5.0,\n \"The distance threshold of replan\");\n\nDEFINE_double(default_reference_line_width, 4.0,\n \"Default reference line width\");\n\nDEFINE_double(planning_upper_speed_limit, 10.0, \"Maximum speed in planning.\");\n\nDEFINE_double(planning_distance, 100, \"Planning distance\");\n\nDEFINE_double(trajectory_time_length, 8.0, \"Trajectory time length\");\nDEFINE_double(trajectory_time_resolution, 0.1,\n \"Trajectory time resolution in planning\");\nDEFINE_double(output_trajectory_time_resolution, 0.05,\n \"Trajectory time resolution when publish\");\n\nDEFINE_double(speed_lower_bound, 0.0, \"The lowest speed allowed.\");\nDEFINE_double(speed_upper_bound, 40.0, \"The highest speed allowed.\");\n\nDEFINE_double(longitudinal_acceleration_lower_bound, -4.5,\n \"The lowest longitudinal acceleration allowed.\");\nDEFINE_double(longitudinal_acceleration_upper_bound, 4.0,\n \"The highest longitudinal acceleration allowed.\");\n\nDEFINE_double(lateral_acceleration_bound, 4.5,\n \"Bound of lateral acceleration; symmetric for left and right\");\nDEFINE_double(lateral_jerk_bound, 4.0,\n \"Bound of lateral jerk; symmetric for left and right\");\n\nDEFINE_double(longitudinal_jerk_lower_bound, -4.0,\n \"The lower bound of longitudinal jerk.\");\nDEFINE_double(longitudinal_jerk_upper_bound, 4.0,\n \"The upper bound of longitudinal jerk.\");\n\nDEFINE_double(kappa_bound, 0.23, \"The bound for vehicle curvature\");\n\n\/\/ ST Boundary\nDEFINE_double(st_max_s, 80, \"the maximum s of st boundary\");\nDEFINE_double(st_max_t, 10, \"the maximum t of st boundary\");\n\n\/\/ Decision Part\nDEFINE_double(static_obstacle_speed_threshold, 1.0,\n \"obstacles are considered as static obstacle if its speed is \"\n \"less than this value (m\/s)\");\nDEFINE_bool(enable_nudge_decision, false, \"enable nudge decision\");\nDEFINE_double(static_decision_ignore_s_range, 3.0,\n \"threshold for judging nudge in dp path computing decision\");\nDEFINE_double(static_decision_nudge_l_buffer, 0.5, \"l buffer for nudge\");\nDEFINE_double(stop_distance_obstacle, 10.0,\n \"stop distance from in-lane obstacle (meters)\");\nDEFINE_double(destination_adjust_distance_buffer, 1.0,\n \"distance buffer when adjusting destination stop line\");\nDEFINE_double(min_driving_width, 2.5,\n \"minimum road width(meters) for adc to drive through\");\nDEFINE_double(nudge_distance_obstacle, 0.3,\n \"minimum distance to nudge a obstacle (meters)\");\nDEFINE_double(follow_min_distance, 10,\n \"min follow distance for vehicles\/bicycles\/moving objects\");\nDEFINE_double(stop_line_min_distance, 0.0,\n \"min distance (meters) to stop line for a valid stop\");\n\nDEFINE_string(destination_obstacle_id, \"DEST\",\n \"obstacle id for converting destination to an obstacle\");\nDEFINE_int32(virtual_obstacle_perception_id, -1,\n \"virtual obstacle perception id(a negative int)\");\nDEFINE_double(virtual_stop_wall_length, 0.1,\n \"virtual stop wall length (meters)\");\nDEFINE_double(virtual_stop_wall_width, 3.7, \"virtual stop wall width (meters)\");\nDEFINE_double(virtual_stop_wall_height, 2.0,\n \"virtual stop wall height (meters)\");\n\n\/\/ Prediction Part\nDEFINE_double(prediction_total_time, 5.0, \"Total prediction time\");\nDEFINE_bool(align_prediction_time, true,\n \"enable align prediction data based planning time\");\n\n\/\/ Trajectory\nDEFINE_bool(enable_rule_layer, true,\n \"enable rule for trajectory before model computation\");\n\n\/\/ Traffic decision\n\nDEFINE_string(planning_config_file,\n \"modules\/planning\/conf\/planning_config.pb.txt\",\n \"planning config file\");\n\nDEFINE_int32(trajectory_point_num_for_debug, 10,\n \"number of output trajectory points for debugging\");\n\nDEFINE_double(decision_valid_stop_range, 0.5,\n \"The valid stop range in decision.\");\nDEFINE_bool(enable_record_debug, true,\n \"True to enable record debug into debug protobuf.\");\nDEFINE_bool(enable_prediction, true, \"True to enable prediction input.\");\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/prediction\/prediction_component.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <memory>\n#include <vector>\n\n#include \"boost\/filesystem.hpp\"\n#include \"boost\/range\/iterator_range.hpp\"\n\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/time\/time.h\"\n#include \"modules\/common\/util\/file.h\"\n#include \"modules\/common\/util\/message_util.h\"\n#include \"modules\/prediction\/common\/feature_output.h\"\n#include \"modules\/prediction\/common\/prediction_gflags.h\"\n#include \"modules\/prediction\/common\/prediction_map.h\"\n#include \"modules\/prediction\/common\/validation_checker.h\"\n#include \"modules\/prediction\/container\/container_manager.h\"\n#include \"modules\/prediction\/container\/obstacles\/obstacles_container.h\"\n#include \"modules\/prediction\/container\/pose\/pose_container.h\"\n#include \"modules\/prediction\/evaluator\/evaluator_manager.h\"\n#include \"modules\/prediction\/predictor\/predictor_manager.h\"\n#include \"modules\/prediction\/proto\/prediction_obstacle.pb.h\"\n#include \"modules\/prediction\/scenario\/scenario_manager.h\"\n#include \"modules\/prediction\/util\/data_extraction.h\"\n\nnamespace apollo {\nnamespace prediction {\n\nusing apollo::common::ErrorCode;\nusing apollo::common::Status;\nusing apollo::common::TrajectoryPoint;\nusing apollo::common::adapter::AdapterConfig;\nusing apollo::common::math::Vec2d;\nusing apollo::common::time::Clock;\nusing apollo::common::util::DirectoryExists;\nusing apollo::common::util::Glob;\nusing apollo::localization::LocalizationEstimate;\nusing apollo::perception::PerceptionObstacle;\nusing apollo::perception::PerceptionObstacles;\nusing apollo::planning::ADCTrajectory;\n\nPredictionComponent::~PredictionComponent() { Stop(); }\n\nstd::string PredictionComponent::Name() const {\n return FLAGS_prediction_module_name;\n}\n\nvoid PredictionComponent::ProcessOfflineData(const std::string& filename) {\n \/\/ TODO(all) implement\n\n \/**\n const std::vector<std::string> topics{FLAGS_perception_obstacle_topic,\n FLAGS_localization_topic};\n rosbag::Bag bag;\n try {\n bag.open(filename, rosbag::bagmode::Read);\n } catch (const rosbag::BagIOException& e) {\n AERROR << \"BagIOException when open bag: \" << filename\n << \" Exception: \" << e.what();\n bag.close();\n return;\n } catch (...) {\n AERROR << \"Failed to open bag: \" << filename;\n bag.close();\n return;\n }\n rosbag::View view(bag, rosbag::TopicQuery(topics));\n for (auto it = view.begin(); it != view.end(); ++it) {\n if (it->getTopic() == FLAGS_localization_topic) {\n OnLocalization(*(it->instantiate<LocalizationEstimate>()));\n } else if (it->getTopic() == FLAGS_perception_obstacle_topic) {\n RunOnce(*(it->instantiate<PerceptionObstacles>()));\n }\n }\n bag.close();\n **\/\n}\n\nbool PredictionComponent::Init() {\n AINFO << \"Loading gflag from file: \" << ConfigFilePath();\n google::SetCommandLineOption(\"flagfile\", ConfigFilePath().c_str());\n\n component_start_time_ = Clock::NowInSeconds();\n\n \/\/ Load prediction conf\n prediction_conf_.Clear();\n if (!common::util::GetProtoFromFile(FLAGS_prediction_conf_file,\n &prediction_conf_)) {\n AERROR << \"Unable to load prediction conf file: \"\n << FLAGS_prediction_conf_file;\n return false;\n } else {\n ADEBUG << \"Prediction config file is loaded into: \"\n << prediction_conf_.ShortDebugString();\n }\n\n adapter_conf_.Clear();\n if (!common::util::GetProtoFromFile(FLAGS_prediction_adapter_config_filename,\n &adapter_conf_)) {\n AERROR << \"Unable to load adapter conf file: \"\n << FLAGS_prediction_adapter_config_filename;\n return false;\n } else {\n ADEBUG << \"Adapter config file is loaded into: \"\n << adapter_conf_.ShortDebugString();\n }\n\n planning_reader_ = node_->CreateReader<ADCTrajectory>(\n FLAGS_planning_trajectory_topic,\n [this](const std::shared_ptr<ADCTrajectory>& adc_trajectory) {\n ADEBUG << \"Received planning data: run planning callback.\";\n std::lock_guard<std::mutex> lock(mutex_);\n OnPlanning(*adc_trajectory);\n });\n\n \/\/ Initialization of all managers\n ContainerManager::Instance()->Init(adapter_conf_);\n EvaluatorManager::Instance()->Init(prediction_conf_);\n PredictorManager::Instance()->Init(prediction_conf_);\n\n if (!FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n AERROR << \"Map cannot be loaded.\";\n return false;\n }\n\n prediction_writer_ =\n node_->CreateWriter<PredictionObstacles>(FLAGS_prediction_topic);\n\n if (FLAGS_prediction_offline_mode) {\n if (!FeatureOutput::Ready()) {\n AERROR << \"Feature output is not ready.\";\n return false;\n }\n if (FLAGS_prediction_offline_bags.empty()) {\n return true; \/\/ use listen to ROS topic mode\n }\n std::vector<std::string> inputs;\n apollo::common::util::split(FLAGS_prediction_offline_bags, ':', &inputs);\n for (const auto& input : inputs) {\n std::vector<std::string> offline_bags;\n GetDataFileNames(boost::filesystem::path(input), &offline_bags);\n std::sort(offline_bags.begin(), offline_bags.end());\n AINFO << \"For input \" << input << \", found \" << offline_bags.size()\n << \" rosbags to process\";\n for (std::size_t i = 0; i < offline_bags.size(); ++i) {\n AINFO << \"\\tProcessing: [ \" << i << \" \/ \" << offline_bags.size()\n << \" ]: \" << offline_bags[i];\n ProcessOfflineData(offline_bags[i]);\n }\n }\n Stop();\n }\n return true;\n}\n\nvoid PredictionComponent::Stop() {\n if (FLAGS_prediction_offline_mode) {\n FeatureOutput::Close();\n }\n}\n\nvoid PredictionComponent::OnLocalization(\n const LocalizationEstimate& localization) {\n PoseContainer* pose_container = dynamic_cast<PoseContainer*>(\n ContainerManager::Instance()->GetContainer(AdapterConfig::LOCALIZATION));\n CHECK_NOTNULL(pose_container);\n pose_container->Insert(localization);\n\n ADEBUG << \"Received a localization message [\"\n << localization.ShortDebugString() << \"].\";\n}\n\nvoid PredictionComponent::OnPlanning(\n const planning::ADCTrajectory& adc_trajectory) {\n ADCTrajectoryContainer* adc_trajectory_container =\n dynamic_cast<ADCTrajectoryContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PLANNING_TRAJECTORY));\n CHECK_NOTNULL(adc_trajectory_container);\n adc_trajectory_container->Insert(adc_trajectory);\n\n ADEBUG << \"Received a planning message [\" << adc_trajectory.ShortDebugString()\n << \"].\";\n}\n\nbool PredictionComponent::Proc(\n const std::shared_ptr<PerceptionObstacles>& perception_obstacles,\n const std::shared_ptr<LocalizationEstimate>& localization) {\n if (FLAGS_prediction_test_mode &&\n (Clock::NowInSeconds() - component_start_time_ >\n FLAGS_prediction_test_duration)) {\n ADEBUG << \"Prediction finished running in test mode\";\n }\n\n \/\/ Update relative map if needed\n \/\/ AdapterManager::Observe();\n if (FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n AERROR << \"Relative map is empty.\";\n return false;\n }\n\n double start_timestamp = Clock::NowInSeconds();\n\n OnLocalization(*localization);\n\n \/\/ Insert obstacle\n ObstaclesContainer* obstacles_container = dynamic_cast<ObstaclesContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PERCEPTION_OBSTACLES));\n CHECK_NOTNULL(obstacles_container);\n obstacles_container->Insert(*perception_obstacles);\n\n \/\/ Scenario analysis\n ScenarioManager::Instance()->Run();\n\n obstacles_container->BuildLaneGraph();\n\n ADEBUG << \"Received a perception message [\"\n << perception_obstacles->ShortDebugString() << \"].\";\n\n \/\/ Update ADC status\n PoseContainer* pose_container = dynamic_cast<PoseContainer*>(\n ContainerManager::Instance()->GetContainer(AdapterConfig::LOCALIZATION));\n ADCTrajectoryContainer* adc_container = dynamic_cast<ADCTrajectoryContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PLANNING_TRAJECTORY));\n CHECK_NOTNULL(pose_container);\n CHECK_NOTNULL(adc_container);\n\n PerceptionObstacle* adc = pose_container->ToPerceptionObstacle();\n if (adc != nullptr) {\n obstacles_container->InsertPerceptionObstacle(*adc, adc->timestamp());\n double x = adc->position().x();\n double y = adc->position().y();\n ADEBUG << \"Get ADC position [\" << std::fixed << std::setprecision(6) << x\n << \", \" << std::fixed << std::setprecision(6) << y << \"].\";\n adc_container->SetPosition({x, y});\n }\n\n \/\/ Make evaluations\n EvaluatorManager::Instance()->Run(*perception_obstacles);\n\n \/\/ No prediction trajectories for offline mode\n if (FLAGS_prediction_offline_mode) {\n return true;\n }\n\n \/\/ Make predictions\n PredictorManager::Instance()->Run(*perception_obstacles);\n\n auto prediction_obstacles =\n PredictorManager::Instance()->prediction_obstacles();\n prediction_obstacles.set_start_timestamp(start_timestamp);\n prediction_obstacles.set_end_timestamp(Clock::NowInSeconds());\n prediction_obstacles.mutable_header()->set_lidar_timestamp(\n perception_obstacles->header().lidar_timestamp());\n prediction_obstacles.mutable_header()->set_camera_timestamp(\n perception_obstacles->header().camera_timestamp());\n prediction_obstacles.mutable_header()->set_radar_timestamp(\n perception_obstacles->header().radar_timestamp());\n\n if (FLAGS_prediction_test_mode) {\n for (auto const& prediction_obstacle :\n prediction_obstacles.prediction_obstacle()) {\n for (auto const& trajectory : prediction_obstacle.trajectory()) {\n for (auto const& trajectory_point : trajectory.trajectory_point()) {\n if (!ValidationChecker::ValidTrajectoryPoint(trajectory_point)) {\n AERROR << \"Invalid trajectory point [\"\n << trajectory_point.ShortDebugString() << \"]\";\n return false;\n }\n }\n }\n }\n }\n\n common::util::FillHeader(node_->Name(), &prediction_obstacles);\n\n prediction_writer_->Write(\n std::make_shared<PredictionObstacles>(prediction_obstacles));\n return true;\n}\n\n} \/\/ namespace prediction\n} \/\/ namespace apollo\n<commit_msg>Prediction: turn off scenrio manager tmp<commit_after>\/******************************************************************************\n * Copyright 2018 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include \"modules\/prediction\/prediction_component.h\"\n\n#include <algorithm>\n#include <cmath>\n#include <memory>\n#include <vector>\n\n#include \"boost\/filesystem.hpp\"\n#include \"boost\/range\/iterator_range.hpp\"\n\n#include \"modules\/common\/adapters\/adapter_gflags.h\"\n#include \"modules\/common\/math\/vec2d.h\"\n#include \"modules\/common\/time\/time.h\"\n#include \"modules\/common\/util\/file.h\"\n#include \"modules\/common\/util\/message_util.h\"\n#include \"modules\/prediction\/common\/feature_output.h\"\n#include \"modules\/prediction\/common\/prediction_gflags.h\"\n#include \"modules\/prediction\/common\/prediction_map.h\"\n#include \"modules\/prediction\/common\/validation_checker.h\"\n#include \"modules\/prediction\/container\/container_manager.h\"\n#include \"modules\/prediction\/container\/obstacles\/obstacles_container.h\"\n#include \"modules\/prediction\/container\/pose\/pose_container.h\"\n#include \"modules\/prediction\/evaluator\/evaluator_manager.h\"\n#include \"modules\/prediction\/predictor\/predictor_manager.h\"\n#include \"modules\/prediction\/proto\/prediction_obstacle.pb.h\"\n#include \"modules\/prediction\/scenario\/scenario_manager.h\"\n#include \"modules\/prediction\/util\/data_extraction.h\"\n\nnamespace apollo {\nnamespace prediction {\n\nusing apollo::common::ErrorCode;\nusing apollo::common::Status;\nusing apollo::common::TrajectoryPoint;\nusing apollo::common::adapter::AdapterConfig;\nusing apollo::common::math::Vec2d;\nusing apollo::common::time::Clock;\nusing apollo::common::util::DirectoryExists;\nusing apollo::common::util::Glob;\nusing apollo::localization::LocalizationEstimate;\nusing apollo::perception::PerceptionObstacle;\nusing apollo::perception::PerceptionObstacles;\nusing apollo::planning::ADCTrajectory;\n\nPredictionComponent::~PredictionComponent() { Stop(); }\n\nstd::string PredictionComponent::Name() const {\n return FLAGS_prediction_module_name;\n}\n\nvoid PredictionComponent::ProcessOfflineData(const std::string& filename) {\n \/\/ TODO(all) implement\n\n \/**\n const std::vector<std::string> topics{FLAGS_perception_obstacle_topic,\n FLAGS_localization_topic};\n rosbag::Bag bag;\n try {\n bag.open(filename, rosbag::bagmode::Read);\n } catch (const rosbag::BagIOException& e) {\n AERROR << \"BagIOException when open bag: \" << filename\n << \" Exception: \" << e.what();\n bag.close();\n return;\n } catch (...) {\n AERROR << \"Failed to open bag: \" << filename;\n bag.close();\n return;\n }\n rosbag::View view(bag, rosbag::TopicQuery(topics));\n for (auto it = view.begin(); it != view.end(); ++it) {\n if (it->getTopic() == FLAGS_localization_topic) {\n OnLocalization(*(it->instantiate<LocalizationEstimate>()));\n } else if (it->getTopic() == FLAGS_perception_obstacle_topic) {\n RunOnce(*(it->instantiate<PerceptionObstacles>()));\n }\n }\n bag.close();\n **\/\n}\n\nbool PredictionComponent::Init() {\n AINFO << \"Loading gflag from file: \" << ConfigFilePath();\n google::SetCommandLineOption(\"flagfile\", ConfigFilePath().c_str());\n\n component_start_time_ = Clock::NowInSeconds();\n\n \/\/ Load prediction conf\n prediction_conf_.Clear();\n if (!common::util::GetProtoFromFile(FLAGS_prediction_conf_file,\n &prediction_conf_)) {\n AERROR << \"Unable to load prediction conf file: \"\n << FLAGS_prediction_conf_file;\n return false;\n } else {\n ADEBUG << \"Prediction config file is loaded into: \"\n << prediction_conf_.ShortDebugString();\n }\n\n adapter_conf_.Clear();\n if (!common::util::GetProtoFromFile(FLAGS_prediction_adapter_config_filename,\n &adapter_conf_)) {\n AERROR << \"Unable to load adapter conf file: \"\n << FLAGS_prediction_adapter_config_filename;\n return false;\n } else {\n ADEBUG << \"Adapter config file is loaded into: \"\n << adapter_conf_.ShortDebugString();\n }\n\n planning_reader_ = node_->CreateReader<ADCTrajectory>(\n FLAGS_planning_trajectory_topic,\n [this](const std::shared_ptr<ADCTrajectory>& adc_trajectory) {\n ADEBUG << \"Received planning data: run planning callback.\";\n std::lock_guard<std::mutex> lock(mutex_);\n OnPlanning(*adc_trajectory);\n });\n\n \/\/ Initialization of all managers\n ContainerManager::Instance()->Init(adapter_conf_);\n EvaluatorManager::Instance()->Init(prediction_conf_);\n PredictorManager::Instance()->Init(prediction_conf_);\n\n if (!FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n AERROR << \"Map cannot be loaded.\";\n return false;\n }\n\n prediction_writer_ =\n node_->CreateWriter<PredictionObstacles>(FLAGS_prediction_topic);\n\n if (FLAGS_prediction_offline_mode) {\n if (!FeatureOutput::Ready()) {\n AERROR << \"Feature output is not ready.\";\n return false;\n }\n if (FLAGS_prediction_offline_bags.empty()) {\n return true; \/\/ use listen to ROS topic mode\n }\n std::vector<std::string> inputs;\n apollo::common::util::split(FLAGS_prediction_offline_bags, ':', &inputs);\n for (const auto& input : inputs) {\n std::vector<std::string> offline_bags;\n GetDataFileNames(boost::filesystem::path(input), &offline_bags);\n std::sort(offline_bags.begin(), offline_bags.end());\n AINFO << \"For input \" << input << \", found \" << offline_bags.size()\n << \" rosbags to process\";\n for (std::size_t i = 0; i < offline_bags.size(); ++i) {\n AINFO << \"\\tProcessing: [ \" << i << \" \/ \" << offline_bags.size()\n << \" ]: \" << offline_bags[i];\n ProcessOfflineData(offline_bags[i]);\n }\n }\n Stop();\n }\n return true;\n}\n\nvoid PredictionComponent::Stop() {\n if (FLAGS_prediction_offline_mode) {\n FeatureOutput::Close();\n }\n}\n\nvoid PredictionComponent::OnLocalization(\n const LocalizationEstimate& localization) {\n PoseContainer* pose_container = dynamic_cast<PoseContainer*>(\n ContainerManager::Instance()->GetContainer(AdapterConfig::LOCALIZATION));\n CHECK_NOTNULL(pose_container);\n pose_container->Insert(localization);\n\n ADEBUG << \"Received a localization message [\"\n << localization.ShortDebugString() << \"].\";\n}\n\nvoid PredictionComponent::OnPlanning(\n const planning::ADCTrajectory& adc_trajectory) {\n ADCTrajectoryContainer* adc_trajectory_container =\n dynamic_cast<ADCTrajectoryContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PLANNING_TRAJECTORY));\n CHECK_NOTNULL(adc_trajectory_container);\n adc_trajectory_container->Insert(adc_trajectory);\n\n ADEBUG << \"Received a planning message [\" << adc_trajectory.ShortDebugString()\n << \"].\";\n}\n\nbool PredictionComponent::Proc(\n const std::shared_ptr<PerceptionObstacles>& perception_obstacles,\n const std::shared_ptr<LocalizationEstimate>& localization) {\n if (FLAGS_prediction_test_mode &&\n (Clock::NowInSeconds() - component_start_time_ >\n FLAGS_prediction_test_duration)) {\n ADEBUG << \"Prediction finished running in test mode\";\n }\n\n \/\/ Update relative map if needed\n \/\/ AdapterManager::Observe();\n if (FLAGS_use_navigation_mode && !PredictionMap::Ready()) {\n AERROR << \"Relative map is empty.\";\n return false;\n }\n\n double start_timestamp = Clock::NowInSeconds();\n\n OnLocalization(*localization);\n\n \/\/ Insert obstacle\n ObstaclesContainer* obstacles_container = dynamic_cast<ObstaclesContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PERCEPTION_OBSTACLES));\n CHECK_NOTNULL(obstacles_container);\n obstacles_container->Insert(*perception_obstacles);\n\n \/\/ Scenario analysis\n \/\/ ScenarioManager::Instance()->Run();\n\n obstacles_container->BuildLaneGraph();\n\n ADEBUG << \"Received a perception message [\"\n << perception_obstacles->ShortDebugString() << \"].\";\n\n \/\/ Update ADC status\n PoseContainer* pose_container = dynamic_cast<PoseContainer*>(\n ContainerManager::Instance()->GetContainer(AdapterConfig::LOCALIZATION));\n ADCTrajectoryContainer* adc_container = dynamic_cast<ADCTrajectoryContainer*>(\n ContainerManager::Instance()->GetContainer(\n AdapterConfig::PLANNING_TRAJECTORY));\n CHECK_NOTNULL(pose_container);\n CHECK_NOTNULL(adc_container);\n\n PerceptionObstacle* adc = pose_container->ToPerceptionObstacle();\n if (adc != nullptr) {\n obstacles_container->InsertPerceptionObstacle(*adc, adc->timestamp());\n double x = adc->position().x();\n double y = adc->position().y();\n ADEBUG << \"Get ADC position [\" << std::fixed << std::setprecision(6) << x\n << \", \" << std::fixed << std::setprecision(6) << y << \"].\";\n adc_container->SetPosition({x, y});\n }\n\n \/\/ Make evaluations\n EvaluatorManager::Instance()->Run(*perception_obstacles);\n\n \/\/ No prediction trajectories for offline mode\n if (FLAGS_prediction_offline_mode) {\n return true;\n }\n\n \/\/ Make predictions\n PredictorManager::Instance()->Run(*perception_obstacles);\n\n auto prediction_obstacles =\n PredictorManager::Instance()->prediction_obstacles();\n prediction_obstacles.set_start_timestamp(start_timestamp);\n prediction_obstacles.set_end_timestamp(Clock::NowInSeconds());\n prediction_obstacles.mutable_header()->set_lidar_timestamp(\n perception_obstacles->header().lidar_timestamp());\n prediction_obstacles.mutable_header()->set_camera_timestamp(\n perception_obstacles->header().camera_timestamp());\n prediction_obstacles.mutable_header()->set_radar_timestamp(\n perception_obstacles->header().radar_timestamp());\n\n if (FLAGS_prediction_test_mode) {\n for (auto const& prediction_obstacle :\n prediction_obstacles.prediction_obstacle()) {\n for (auto const& trajectory : prediction_obstacle.trajectory()) {\n for (auto const& trajectory_point : trajectory.trajectory_point()) {\n if (!ValidationChecker::ValidTrajectoryPoint(trajectory_point)) {\n AERROR << \"Invalid trajectory point [\"\n << trajectory_point.ShortDebugString() << \"]\";\n return false;\n }\n }\n }\n }\n }\n\n common::util::FillHeader(node_->Name(), &prediction_obstacles);\n\n prediction_writer_->Write(\n std::make_shared<PredictionObstacles>(prediction_obstacles));\n return true;\n}\n\n} \/\/ namespace prediction\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Use the correct signal for the sync type combo box to indicate a change and make the apply button enabled<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2014 Arjan van der Velde, vandervelde.ag [at] gmail\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n#include <iostream>\n#include <algorithm>\n\n#include \"TwoBitSequence.hpp\"\n#include \"TwoBitFile.hpp\"\n#include \"TwoBitUtil.hpp\"\n\nnamespace TwoBit\n{\n\nconst uint32_t TwoBitSequence::BUFFER_SIZE;\n\nTwoBitSequence::TwoBitSequence(const std::string& name, const uint32_t offset,\n\t\tTwoBitFile& file) :\n\t\tname_(name), offset_(offset), filename_(file.filename_), swapped_(\n\t\t\t\tfile.swapped_), dnaSize_(0), dnaBytes_(0), packedpos_(0)\n{\n\topen();\n}\n\nTwoBitSequence::~TwoBitSequence()\n{\n\tclose();\n}\n\nvoid TwoBitSequence::readRegions(std::vector<Region>& out)\n{\n\tuint32_t count;\n\tcount = nextInt(file_, swapped_);\n\tstd::vector<uint32_t> starts;\n\tstd::vector<uint32_t> lengths;\n\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tstarts.emplace_back(nextInt(file_, swapped_));\n\t}\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tlengths.emplace_back(nextInt(file_, swapped_));\n\t}\n\n\tout.clear();\n\tout.reserve(count * 2);\n\tout.emplace_back(0, 0); \/\/ filler, makes logic a little easier\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tout.emplace_back(starts[i], 1);\n\t\tout.emplace_back(starts[i] + lengths[i], -1);\n\t}\n\n\tstd::sort(out.begin(), out.end(), [](const Region& a, const Region& b)\n\t{\n\t\treturn a.pos_ < b.pos_;\n\t});\n}\n\nvoid TwoBitSequence::open()\n{\n\t\/\/ open file, seek to offset and read sequence meta data.\n\tfile_.open(filename_, std::ios::in | std::ios::binary);\n\tfile_.seekg(offset_);\n\tdnaSize_ = nextInt(file_, swapped_); \/\/ length of sequence\n\tdnaBytes_ = dnaSize_ \/ 4 + (dnaSize_ % 4 > 0);\n\n\t\/\/ read nRegions.\n\treadRegions(nRegions); \/\/ N-regions\n\treadRegions(mRegions); \/\/ mask regions\n\n\t\/\/ check. this number should be zero as per the spec.\n\tif (0 != nextInt(file_, swapped_))\n\t{\n\t\tthrow Exception(\"Unexpected data. Bad 2-bit file.\");\n\t}\n\n\t\/\/ store start of packed data\n\tpackedpos_ = file_.tellg();\n}\n\nvoid TwoBitSequence::close()\n{\n\tfile_.close();\n}\n\nvoid TwoBitSequence::test()\n{\n\tstd::cout << \"name_: \" << name_ << std::endl;\n\tstd::cout << \"offset_: \" << offset_ << std::endl;\n\tstd::cout << \"swapped_: \" << swapped_ << std::endl;\n\tstd::cout << \"filename_: \" << filename_ << std::endl;\n}\n\nvoid TwoBitSequence::getSequence(std::vector<char>& buffer, uint32_t start, uint32_t end)\n{\n\t\/\/ alphabet for masked and unmasked sequence.\n\tconst char upper[5] = {'T', 'C', 'A', 'G', 'N'};\n\tconst char lower[5] = {'t', 'c', 'a', 'g', 'n'};\n\n\t\/\/ clean start and end (that is: start < end <= dnasize)\n\tuint32_t startNuc = std::min(dnaSize_ - 1, start);\n\tuint32_t endNuc = std::max(startNuc + 1, std::min(dnaSize_, end)); \/\/ < dnaSize, > startNuc.\n\t\n\t\/\/ calculate byte positions in file.\n\tuint32_t startByte = packedpos_ + (startNuc \/ 4);\n\tuint32_t endByte = packedpos_ + (endNuc \/ 4) + (endNuc % 4 > 0);\n\n\t\/\/ update start and end nucleotide to the ones we're actually reading (based on byte positions)\n\tstartNuc = (startByte - packedpos_) * 4;\n\tendNuc = (endByte - packedpos_) * 4;\n\t\n\tbuffer.clear();\n\tbuffer.reserve(endNuc - startNuc + 1); \/\/ +1?\n\n\t\/\/ reading starts here.\n\tuint32_t seqPos = startNuc;\n\tuint32_t filePos = startByte;\n\n\t\/\/ counters for N and mask regions\n\tint m = 0;\n\tint n = 0;\n\tuint32_t prevm = 0;\n\tuint32_t prevn = 0;\n\n\tfile_.seekg(filePos);\n\twhile (filePos < endByte) {\n\n\t\tfile_.read(buffer_, std::min(endByte - filePos, BUFFER_SIZE));\n\t\tfilePos += BUFFER_SIZE;\n\n\t\t\/\/ obtain sequence.\n\t\tfor (uint32_t i = 0; i < file_.gcount(); ++i)\n\t\t{\n\t\t\tfor (uint32_t j = 0; j < 8; j += 2)\n\t\t\t{\n\n\t\t\t\t\/\/ fast-forward N-regions to figure out whether we need to return N's or sequence.\n\t\t\t\twhile (prevn < nRegions.size() && nRegions[prevn].pos_ <= seqPos)\n\t\t\t\t{\n\t\t\t\t\tn += nRegions[prevn++].action_;\n\t\t\t\t}\n\n\t\t\t\t\/\/ fast-forward mask-regions to figure out whether or not we need to mask.\n\t\t\t\twhile (prevm < mRegions.size() && mRegions[prevm].pos_ <= seqPos)\n\t\t\t\t{\n\t\t\t\t\tm += mRegions[prevm++].action_;\n\t\t\t\t}\n\n\t\t\t\t\/\/ translate 2-bit to sequence.\n\t\t\t\tif (m == 0 && n == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ no mask, no N\n\t\t\t\t\tbuffer.push_back(upper[(buffer_[i] >> (6 - j)) & 0x03]);\n\t\t\t\t}\n\t\t\t\telse if (m == 0 && n > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ no mask, but N\n\t\t\t\t\tbuffer.push_back(upper[4]);\n\t\t\t\t}\n\t\t\t\telse if (m > 0 && n == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ mask, no N\n\t\t\t\t\tbuffer.push_back(lower[(buffer_[i] >> (6 - j)) & 0x03]);\n\t\t\t\t}\n\t\t\t\telse if (m > 0 && n > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ masked N (should not happen I guess)\n\t\t\t\t\tbuffer.push_back(lower[4]);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ negative values for m or n means something's not quite right.\n\t\t\t\t\tthrow Exception(\"Error parsing regions.\");\n\t\t\t\t}\n\t\t\t\tseqPos++;\n\t\t\t}\n\t\t}\n\t}\n}\n\n} \/\/ namespace TwoBit\n<commit_msg>not +1<commit_after>\/*\n Copyright 2014 Arjan van der Velde, vandervelde.ag [at] gmail\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n#include <iostream>\n#include <algorithm>\n\n#include \"TwoBitSequence.hpp\"\n#include \"TwoBitFile.hpp\"\n#include \"TwoBitUtil.hpp\"\n\nnamespace TwoBit\n{\n\nconst uint32_t TwoBitSequence::BUFFER_SIZE;\n\nTwoBitSequence::TwoBitSequence(const std::string& name, const uint32_t offset,\n\t\tTwoBitFile& file) :\n\t\tname_(name), offset_(offset), filename_(file.filename_), swapped_(\n\t\t\t\tfile.swapped_), dnaSize_(0), dnaBytes_(0), packedpos_(0)\n{\n\topen();\n}\n\nTwoBitSequence::~TwoBitSequence()\n{\n\tclose();\n}\n\nvoid TwoBitSequence::readRegions(std::vector<Region>& out)\n{\n\tuint32_t count;\n\tcount = nextInt(file_, swapped_);\n\tstd::vector<uint32_t> starts;\n\tstd::vector<uint32_t> lengths;\n\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tstarts.emplace_back(nextInt(file_, swapped_));\n\t}\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tlengths.emplace_back(nextInt(file_, swapped_));\n\t}\n\n\tout.clear();\n\tout.reserve(count * 2);\n\tout.emplace_back(0, 0); \/\/ filler, makes logic a little easier\n\tfor (uint32_t i = 0; i < count; ++i)\n\t{\n\t\tout.emplace_back(starts[i], 1);\n\t\tout.emplace_back(starts[i] + lengths[i], -1);\n\t}\n\n\tstd::sort(out.begin(), out.end(), [](const Region& a, const Region& b)\n\t{\n\t\treturn a.pos_ < b.pos_;\n\t});\n}\n\nvoid TwoBitSequence::open()\n{\n\t\/\/ open file, seek to offset and read sequence meta data.\n\tfile_.open(filename_, std::ios::in | std::ios::binary);\n\tfile_.seekg(offset_);\n\tdnaSize_ = nextInt(file_, swapped_); \/\/ length of sequence\n\tdnaBytes_ = dnaSize_ \/ 4 + (dnaSize_ % 4 > 0);\n\n\t\/\/ read nRegions.\n\treadRegions(nRegions); \/\/ N-regions\n\treadRegions(mRegions); \/\/ mask regions\n\n\t\/\/ check. this number should be zero as per the spec.\n\tif (0 != nextInt(file_, swapped_))\n\t{\n\t\tthrow Exception(\"Unexpected data. Bad 2-bit file.\");\n\t}\n\n\t\/\/ store start of packed data\n\tpackedpos_ = file_.tellg();\n}\n\nvoid TwoBitSequence::close()\n{\n\tfile_.close();\n}\n\nvoid TwoBitSequence::test()\n{\n\tstd::cout << \"name_: \" << name_ << std::endl;\n\tstd::cout << \"offset_: \" << offset_ << std::endl;\n\tstd::cout << \"swapped_: \" << swapped_ << std::endl;\n\tstd::cout << \"filename_: \" << filename_ << std::endl;\n}\n\nvoid TwoBitSequence::getSequence(std::vector<char>& buffer, uint32_t start, uint32_t end)\n{\n\t\/\/ alphabet for masked and unmasked sequence.\n\tconst char upper[5] = {'T', 'C', 'A', 'G', 'N'};\n\tconst char lower[5] = {'t', 'c', 'a', 'g', 'n'};\n\n\t\/\/ clean start and end (that is: start < end <= dnasize)\n\tuint32_t startNuc = std::min(dnaSize_ - 1, start);\n\tuint32_t endNuc = std::max(startNuc + 1, std::min(dnaSize_, end)); \/\/ < dnaSize, > startNuc.\n\t\n\t\/\/ calculate byte positions in file.\n\tuint32_t startByte = packedpos_ + (startNuc \/ 4);\n\tuint32_t endByte = packedpos_ + (endNuc \/ 4) + (endNuc % 4 > 0);\n\n\t\/\/ update start and end nucleotide to the ones we're actually reading (based on byte positions)\n\tstartNuc = (startByte - packedpos_) * 4;\n\tendNuc = (endByte - packedpos_) * 4;\n\t\n\t\/\/ nuke buffer and resize\n\tbuffer.clear();\n\tbuffer.reserve(endNuc - startNuc);\n\n\t\/\/ reading starts here.\n\tuint32_t seqPos = startNuc;\n\tuint32_t filePos = startByte;\n\n\t\/\/ counters for N and mask regions\n\tint m = 0;\n\tint n = 0;\n\tuint32_t prevm = 0;\n\tuint32_t prevn = 0;\n\n\tfile_.seekg(filePos);\n\twhile (filePos < endByte) {\n\n\t\tfile_.read(buffer_, std::min(endByte - filePos, BUFFER_SIZE));\n\t\tfilePos += BUFFER_SIZE;\n\n\t\t\/\/ obtain sequence.\n\t\tfor (uint32_t i = 0; i < file_.gcount(); ++i)\n\t\t{\n\t\t\tfor (uint32_t j = 0; j < 8; j += 2)\n\t\t\t{\n\n\t\t\t\t\/\/ fast-forward N-regions to figure out whether we need to return N's or sequence.\n\t\t\t\twhile (prevn < nRegions.size() && nRegions[prevn].pos_ <= seqPos)\n\t\t\t\t{\n\t\t\t\t\tn += nRegions[prevn++].action_;\n\t\t\t\t}\n\n\t\t\t\t\/\/ fast-forward mask-regions to figure out whether or not we need to mask.\n\t\t\t\twhile (prevm < mRegions.size() && mRegions[prevm].pos_ <= seqPos)\n\t\t\t\t{\n\t\t\t\t\tm += mRegions[prevm++].action_;\n\t\t\t\t}\n\n\t\t\t\t\/\/ translate 2-bit to sequence.\n\t\t\t\tif (m == 0 && n == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ no mask, no N\n\t\t\t\t\tbuffer.push_back(upper[(buffer_[i] >> (6 - j)) & 0x03]);\n\t\t\t\t}\n\t\t\t\telse if (m == 0 && n > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ no mask, but N\n\t\t\t\t\tbuffer.push_back(upper[4]);\n\t\t\t\t}\n\t\t\t\telse if (m > 0 && n == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ mask, no N\n\t\t\t\t\tbuffer.push_back(lower[(buffer_[i] >> (6 - j)) & 0x03]);\n\t\t\t\t}\n\t\t\t\telse if (m > 0 && n > 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/ masked N (should not happen I guess)\n\t\t\t\t\tbuffer.push_back(lower[4]);\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ negative values for m or n means something's not quite right.\n\t\t\t\t\tthrow Exception(\"Error parsing regions.\");\n\t\t\t\t}\n\t\t\t\tseqPos++;\n\t\t\t}\n\t\t}\n\t}\n}\n\n} \/\/ namespace TwoBit\n<|endoftext|>"} {"text":"<commit_before><commit_msg>first bad version<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"CL\/cl.h\"\n#include \"ocl.h\"\n#include \"tools.h\"\n#include \"utils.h\"\n#include \"data.h\"\n#include \"control.h\"\n#include \"profiler.h\"\n#include \"enums.h\"\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include \"windows.h\"\n#include \"shlwapi.h\"\n#include \"parallel.h\"\n#include \"sequential.h\"\n#include <fstream>\n\nControlClass::ControlClass()\n\t: GroupManager(\"Control\")\n\t, sample_data_(NULL)\n\t, sample_rate_input_(1000)\n\t, sample_rate_output_(500)\n\t, sample_data_input_file_(\"..\\\\data\\\\default.csv\")\n{\n\tgroups_ = GroupFactory();\n}\nControlClass* ControlObject;\n\nstd::map<int, ProblemGroup*> ControlClass::GroupFactory()\n{\n\tstd::map<int, ProblemGroup*> pgs;\n\n\tProblemGroup* InputControl = GroupManagerInputControlFactory();\n\tsize_t idx = InputControl->problems_.size();\n\tInputControl->problems_[++idx] = new Problem(&SetInputDataFile, \"Set the file path to read sample data from.\");\n\tInputControl->problems_[++idx] = new Problem(&SetSampleRates, \"Set the input and output sample rates.\");\n\tInputControl->problems_[++idx] = new Problem(&Test_LoadSampleData, \"Read and print sample data.\");\n\tpgs[InputControl->GroupNum()] = InputControl;\n\n\tProblemGroup* projectFuncs = new ProblemGroup(1, \"Control\");\n\tprojectFuncs->problems_[++idx] = new Problem(&exCL_Resample, \"OpenCL: Apply sixth-order polynomial\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_PolyEval, \"Test Polynomial Evaluation Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_QR, \"Test QR Decomposition Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_BackSub, \"Test Back Substitution Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_SignalGenerator, \"Test Signal Generator Function\");\n\tpgs[projectFuncs->GroupNum()] = projectFuncs;\n\treturn pgs;\n}\n\n\/\/ Attempts to read sample input data from provided data file\n\/\/ Expects to find one amplitude value per line\n\/\/ @return the number of data points read\nint ControlClass::LoadSampleData(bool printPoints)\n{\n\t\/\/ With help from:\n\t\/\/http:\/\/stackoverflow.com\/questions\/12774207\/fastest-way-to-check-if-a-file-exist-using-standard-c-c11-c\n\tstd::ifstream f(ControlObject->sample_data_input_file_.c_str());\n\tif (!f.good())\n\t\treturn -1;\n\tint pointCount = 0;\n\tstd::filebuf fb;\n\tstd::vector<float> points;\n\tif (fb.open(ControlObject->sample_data_input_file_, std::ios::in))\n\t{\n\t\tstd::istream is(&fb);\n\t\tchar point[256];\n\t\twhile (is.getline(point, 256))\n\t\t\tpoints.push_back(std::stof(point));\n\t\tfb.close();\n\t}\n\tif (printPoints)\n\t\tstd::cout << \"Read Points: \" << std::endl;\n\tsample_data_ = (float*)malloc(sizeof(float*)*points.size());\n\tfor (size_t i = 0; i < points.size(); ++i)\n\t{\n\t\tsample_data_[i] = points[i];\n\t\tif(printPoints)\n\t\t\tstd::cout << i << \": \" << points[i] << std::endl;\n\t}\n\n\treturn (int)points.size();\n}\n\n\/\/ Set the Input and Output sample rates\nint SetSampleRates(ResultsStruct* results)\n{\n\tstd::cout << \"Enter INPUT sample rate (currently \" << ControlObject->sample_rate_input_ << \"): \";\n\tstd::cin >> ControlObject->sample_rate_input_;\n\tstd::cout << \"Enter OUTPUT sample rate (currently \" << ControlObject->sample_rate_output_ << \"): \";\n\tstd::cin >> ControlObject->sample_rate_output_;\n\treturn 0;\n}\n\n\/\/ Set Input Data File path\nint SetInputDataFile(ResultsStruct* results)\n{\n\tstd::cout << \"Enter path to input sample file to (currently \" << ControlObject->sample_data_input_file_ << \"): \";\n\tstd::string s(ControlObject->sample_data_input_file_);\n\tstd::cin >> s;\n\tControlObject->sample_data_input_file_ = s;\n\tstd::ifstream f(ControlObject->sample_data_input_file_.c_str());\n\tif (!f.good())\n\t{\n\t\tstd::cout << \"WARNING: File does not exist: \" << ControlObject->sample_data_input_file_ << std::endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\/\/ Reads sample data and prints it to the screen\n\/\/ Uses LoadSampleData() function with optional print bool set to true\nint Test_LoadSampleData(ResultsStruct* results)\n{\n\t\/\/ returns number of loaded\n\tbool printPoints = true; \/\/ for test purposes\n\tsize_t loadCount = ControlObject->LoadSampleData(printPoints);\n\tstd::cout << \"Points Loaded: \" << loadCount << std::endl;\n\treturn (loadCount >= 0 ? 0 : -1);\n}\n\n<commit_msg>Fixed counter on problem after changes.<commit_after>#include \"CL\/cl.h\"\n#include \"ocl.h\"\n#include \"tools.h\"\n#include \"utils.h\"\n#include \"data.h\"\n#include \"control.h\"\n#include \"profiler.h\"\n#include \"enums.h\"\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include \"windows.h\"\n#include \"shlwapi.h\"\n#include \"parallel.h\"\n#include \"sequential.h\"\n#include <fstream>\n\nControlClass::ControlClass()\n\t: GroupManager(\"Control\")\n\t, sample_data_(NULL)\n\t, sample_rate_input_(1000)\n\t, sample_rate_output_(500)\n\t, sample_data_input_file_(\"..\\\\data\\\\default.csv\")\n{\n\tgroups_ = GroupFactory();\n}\nControlClass* ControlObject;\n\nstd::map<int, ProblemGroup*> ControlClass::GroupFactory()\n{\n\tstd::map<int, ProblemGroup*> pgs;\n\n\tProblemGroup* InputControl = GroupManagerInputControlFactory();\n\tsize_t idx = InputControl->problems_.size();\n\tInputControl->problems_[++idx] = new Problem(&SetInputDataFile, \"Set the file path to read sample data from.\");\n\tInputControl->problems_[++idx] = new Problem(&SetSampleRates, \"Set the input and output sample rates.\");\n\tInputControl->problems_[++idx] = new Problem(&Test_LoadSampleData, \"Read and print sample data.\");\n\tpgs[InputControl->GroupNum()] = InputControl;\n\n\tidx = 0; \/\/ reset counter\n\tProblemGroup* projectFuncs = new ProblemGroup(1, \"Control\");\n\tprojectFuncs->problems_[++idx] = new Problem(&exCL_Resample, \"OpenCL: Apply sixth-order polynomial\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_PolyEval, \"Test Polynomial Evaluation Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_QR, \"Test QR Decomposition Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_BackSub, \"Test Back Substitution Function\");\n\tprojectFuncs->problems_[++idx] = new Problem(&Test_SignalGenerator, \"Test Signal Generator Function\");\n\tpgs[projectFuncs->GroupNum()] = projectFuncs;\n\treturn pgs;\n}\n\n\/\/ Attempts to read sample input data from provided data file\n\/\/ Expects to find one amplitude value per line\n\/\/ @return the number of data points read\nint ControlClass::LoadSampleData(bool printPoints)\n{\n\t\/\/ With help from:\n\t\/\/http:\/\/stackoverflow.com\/questions\/12774207\/fastest-way-to-check-if-a-file-exist-using-standard-c-c11-c\n\tstd::ifstream f(ControlObject->sample_data_input_file_.c_str());\n\tif (!f.good())\n\t\treturn -1;\n\tint pointCount = 0;\n\tstd::filebuf fb;\n\tstd::vector<float> points;\n\tif (fb.open(ControlObject->sample_data_input_file_, std::ios::in))\n\t{\n\t\tstd::istream is(&fb);\n\t\tchar point[256];\n\t\twhile (is.getline(point, 256))\n\t\t\tpoints.push_back(std::stof(point));\n\t\tfb.close();\n\t}\n\tif (printPoints)\n\t\tstd::cout << \"Read Points: \" << std::endl;\n\tsample_data_ = (float*)malloc(sizeof(float*)*points.size());\n\tfor (size_t i = 0; i < points.size(); ++i)\n\t{\n\t\tsample_data_[i] = points[i];\n\t\tif(printPoints)\n\t\t\tstd::cout << i << \": \" << points[i] << std::endl;\n\t}\n\n\treturn (int)points.size();\n}\n\n\/\/ Set the Input and Output sample rates\nint SetSampleRates(ResultsStruct* results)\n{\n\tstd::cout << \"Enter INPUT sample rate (currently \" << ControlObject->sample_rate_input_ << \"): \";\n\tstd::cin >> ControlObject->sample_rate_input_;\n\tstd::cout << \"Enter OUTPUT sample rate (currently \" << ControlObject->sample_rate_output_ << \"): \";\n\tstd::cin >> ControlObject->sample_rate_output_;\n\treturn 0;\n}\n\n\/\/ Set Input Data File path\nint SetInputDataFile(ResultsStruct* results)\n{\n\tstd::cout << \"Enter path to input sample file to (currently \" << ControlObject->sample_data_input_file_ << \"): \";\n\tstd::string s(ControlObject->sample_data_input_file_);\n\tstd::cin >> s;\n\tControlObject->sample_data_input_file_ = s;\n\tstd::ifstream f(ControlObject->sample_data_input_file_.c_str());\n\tif (!f.good())\n\t{\n\t\tstd::cout << \"WARNING: File does not exist: \" << ControlObject->sample_data_input_file_ << std::endl;\n\t\treturn -1;\n\t}\n\treturn 0;\n}\n\n\/\/ Reads sample data and prints it to the screen\n\/\/ Uses LoadSampleData() function with optional print bool set to true\nint Test_LoadSampleData(ResultsStruct* results)\n{\n\t\/\/ returns number of loaded\n\tbool printPoints = true; \/\/ for test purposes\n\tsize_t loadCount = ControlObject->LoadSampleData(printPoints);\n\tstd::cout << \"Points Loaded: \" << loadCount << std::endl;\n\treturn (loadCount >= 0 ? 0 : -1);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/app_notification.h\"\n\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"chrome\/common\/guid.h\"\n\nnamespace {\n\nconst char* kIsLocalKey = \"is_local\";\nconst char* kGuidKey = \"guid\";\nconst char* kExtensionIdKey = \"extension_id\";\nconst char* kTitleKey = \"title\";\nconst char* kBodyKey = \"body\";\nconst char* kLinkUrlKey = \"link_url\";\nconst char* kLinkTextKey = \"link_text\";\n\n} \/\/ namespace\n\nAppNotification::AppNotification(bool is_local,\n const std::string& guid,\n const std::string& extension_id,\n const std::string& title,\n const std::string& body)\n : is_local_(is_local),\n extension_id_(extension_id),\n title_(title),\n body_(body) {\n guid_ = guid.empty() ? guid::GenerateGUID() : guid;\n}\n\nAppNotification::~AppNotification() {}\n\nAppNotification* AppNotification::Copy() {\n AppNotification* copy = new AppNotification(\n this->is_local(), this->guid(), this->extension_id(),\n this->title(), this->body());\n copy->set_link_url(this->link_url());\n copy->set_link_text(this->link_text());\n return copy;\n}\n\nvoid AppNotification::ToDictionaryValue(DictionaryValue* result) {\n CHECK(result);\n result->SetBoolean(kIsLocalKey, is_local_);\n if (!guid_.empty())\n result->SetString(kGuidKey, guid_);\n if (!extension_id_.empty())\n result->SetString(kExtensionIdKey, extension_id_);\n if (!title_.empty())\n result->SetString(kTitleKey, title_);\n if (!body_.empty())\n result->SetString(kBodyKey, body_);\n if (!link_url_.is_empty()) {\n result->SetString(kLinkUrlKey, link_url_.possibly_invalid_spec());\n result->SetString(kLinkTextKey, link_text_);\n }\n}\n\n\/\/ static\nAppNotification* AppNotification::FromDictionaryValue(\n const DictionaryValue& value) {\n scoped_ptr<AppNotification> result(new AppNotification(true, \"\", \"\", \"\", \"\"));\n\n if (value.HasKey(kIsLocalKey) && !value.GetBoolean(\n kIsLocalKey, &result->is_local_)) {\n return NULL;\n }\n if (value.HasKey(kGuidKey) && !value.GetString(kGuidKey, &result->guid_))\n return NULL;\n if (value.HasKey(kExtensionIdKey) &&\n !value.GetString(kExtensionIdKey, &result->extension_id_))\n return NULL;\n if (value.HasKey(kTitleKey) && !value.GetString(kTitleKey, &result->title_))\n return NULL;\n if (value.HasKey(kBodyKey) && !value.GetString(kBodyKey, &result->body_))\n return NULL;\n if (value.HasKey(kLinkUrlKey)) {\n if (!value.HasKey(kLinkTextKey))\n return NULL;\n std::string url;\n if (!value.GetString(kLinkUrlKey, &url) ||\n !value.GetString(kLinkTextKey, &result->link_text_))\n return NULL;\n GURL gurl(url);\n if (!gurl.is_valid())\n return NULL;\n result->set_link_url(gurl);\n }\n\n return result.release();\n}\n\nbool AppNotification::Equals(const AppNotification& other) const {\n return (is_local_ == other.is_local_ &&\n guid_ == other.guid_ &&\n extension_id_ == other.extension_id_ &&\n title_ == other.title_ &&\n body_ == other.body_ &&\n link_url_ == other.link_url_ &&\n link_text_ == other.link_text_);\n}\n\nAppNotificationList* CopyAppNotificationList(\n const AppNotificationList& source) {\n AppNotificationList* copy = new AppNotificationList();\n\n for (AppNotificationList::const_iterator iter = source.begin();\n iter != source.end(); ++iter) {\n copy->push_back(linked_ptr<AppNotification>(iter->get()->Copy()));\n }\n return copy;\n}\n<commit_msg>always read and write link url and link text independently without enforcing any semantics on them. If we load link url only if link text is not empty (and vice versa) when writing notifications JSON file then we get out of sync with sync database for a given notification. This can fail the model association when browser starts up next time and halt syncing of notifications in retail builds and crash in debug builds. Review URL: http:\/\/codereview.chromium.org\/8474008<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/app_notification.h\"\n\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"chrome\/common\/guid.h\"\n\nnamespace {\n\nconst char* kIsLocalKey = \"is_local\";\nconst char* kGuidKey = \"guid\";\nconst char* kExtensionIdKey = \"extension_id\";\nconst char* kTitleKey = \"title\";\nconst char* kBodyKey = \"body\";\nconst char* kLinkUrlKey = \"link_url\";\nconst char* kLinkTextKey = \"link_text\";\n\n} \/\/ namespace\n\nAppNotification::AppNotification(bool is_local,\n const std::string& guid,\n const std::string& extension_id,\n const std::string& title,\n const std::string& body)\n : is_local_(is_local),\n extension_id_(extension_id),\n title_(title),\n body_(body) {\n guid_ = guid.empty() ? guid::GenerateGUID() : guid;\n}\n\nAppNotification::~AppNotification() {}\n\nAppNotification* AppNotification::Copy() {\n AppNotification* copy = new AppNotification(\n this->is_local(), this->guid(), this->extension_id(),\n this->title(), this->body());\n copy->set_link_url(this->link_url());\n copy->set_link_text(this->link_text());\n return copy;\n}\n\nvoid AppNotification::ToDictionaryValue(DictionaryValue* result) {\n CHECK(result);\n result->SetBoolean(kIsLocalKey, is_local_);\n if (!guid_.empty())\n result->SetString(kGuidKey, guid_);\n if (!extension_id_.empty())\n result->SetString(kExtensionIdKey, extension_id_);\n if (!title_.empty())\n result->SetString(kTitleKey, title_);\n if (!body_.empty())\n result->SetString(kBodyKey, body_);\n if (!link_url_.is_empty())\n result->SetString(kLinkUrlKey, link_url_.possibly_invalid_spec());\n if (!link_text_.empty())\n result->SetString(kLinkTextKey, link_text_);\n}\n\n\/\/ static\nAppNotification* AppNotification::FromDictionaryValue(\n const DictionaryValue& value) {\n scoped_ptr<AppNotification> result(new AppNotification(true, \"\", \"\", \"\", \"\"));\n\n if (value.HasKey(kIsLocalKey) && !value.GetBoolean(\n kIsLocalKey, &result->is_local_)) {\n return NULL;\n }\n if (value.HasKey(kGuidKey) && !value.GetString(kGuidKey, &result->guid_))\n return NULL;\n if (value.HasKey(kExtensionIdKey) &&\n !value.GetString(kExtensionIdKey, &result->extension_id_))\n return NULL;\n if (value.HasKey(kTitleKey) && !value.GetString(kTitleKey, &result->title_))\n return NULL;\n if (value.HasKey(kBodyKey) && !value.GetString(kBodyKey, &result->body_))\n return NULL;\n if (value.HasKey(kLinkUrlKey)) {\n std::string url;\n if (!value.GetString(kLinkUrlKey, &url))\n return NULL;\n GURL gurl(url);\n if (!gurl.is_valid())\n return NULL;\n result->set_link_url(gurl);\n }\n if (value.HasKey(kLinkTextKey) &&\n !value.GetString(kLinkTextKey, &result->link_text_)) {\n return NULL;\n }\n\n return result.release();\n}\n\nbool AppNotification::Equals(const AppNotification& other) const {\n return (is_local_ == other.is_local_ &&\n guid_ == other.guid_ &&\n extension_id_ == other.extension_id_ &&\n title_ == other.title_ &&\n body_ == other.body_ &&\n link_url_ == other.link_url_ &&\n link_text_ == other.link_text_);\n}\n\nAppNotificationList* CopyAppNotificationList(\n const AppNotificationList& source) {\n AppNotificationList* copy = new AppNotificationList();\n\n for (AppNotificationList::const_iterator iter = source.begin();\n iter != source.end(); ++iter) {\n copy->push_back(linked_ptr<AppNotification>(iter->get()->Copy()));\n }\n return copy;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/instant\/instant_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"chrome\/browser\/metrics\/metrics_service.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n\nnamespace {\n\n\/\/ Field trial IDs of the control and experiment groups. Though they are not\n\/\/ literally \"const\", they are set only once, in Activate() below. See the .h\n\/\/ file for what these groups represent.\nint g_inactive = -1;\nint g_instant = 0;\nint g_suggest = 0;\nint g_hidden = 0;\nint g_silent = 0;\nint g_control = 0;\n\n}\n\n\/\/ static\nvoid InstantFieldTrial::Activate() {\n scoped_refptr<base::FieldTrial> trial(\n base::FieldTrialList::FactoryGetFieldTrial(\n \"Instant\", 1000, \"Inactive\", 2013, 7, 1, &g_inactive));\n\n \/\/ Try to give the user a consistent experience, if possible.\n if (base::FieldTrialList::IsOneTimeRandomizationEnabled())\n trial->UseOneTimeRandomization();\n\n g_instant = trial->AppendGroup(\"Instant\", 10); \/\/ 1%\n g_suggest = trial->AppendGroup(\"Suggest\", 10); \/\/ 1%\n g_hidden = trial->AppendGroup(\"Hidden\", 960); \/\/ 96%\n g_silent = trial->AppendGroup(\"Silent\", 10); \/\/ 1%\n g_control = trial->AppendGroup(\"Control\", 10); \/\/ 1%\n\n int group = 0;\n if (trial->group() == g_instant)\n group = 1;\n else if (trial->group() == g_suggest)\n group = 2;\n else if (trial->group() == g_hidden)\n group = 3;\n else if (trial->group() == g_silent)\n group = 4;\n else if (trial->group() == g_control)\n group = 5;\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Size\", group, 6);\n}\n\n\/\/ static\nInstantFieldTrial::Group InstantFieldTrial::GetGroup(Profile* profile) {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n if (command_line->HasSwitch(switches::kInstantFieldTrial)) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 1, 10);\n std::string switch_value =\n command_line->GetSwitchValueASCII(switches::kInstantFieldTrial);\n if (switch_value == switches::kInstantFieldTrialInstant)\n return INSTANT;\n if (switch_value == switches::kInstantFieldTrialSuggest)\n return SUGGEST;\n if (switch_value == switches::kInstantFieldTrialHidden)\n return HIDDEN;\n if (switch_value == switches::kInstantFieldTrialSilent)\n return SILENT;\n if (switch_value == switches::kInstantFieldTrialControl)\n return CONTROL;\n return INACTIVE;\n }\n\n const int group = base::FieldTrialList::FindValue(\"Instant\");\n if (group == base::FieldTrial::kNotFinalized || group == g_inactive) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 2, 10);\n return INACTIVE;\n }\n\n const PrefService* prefs = profile ? profile->GetPrefs() : NULL;\n if (!prefs) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 3, 10);\n return INACTIVE;\n }\n\n if (profile->IsOffTheRecord()) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 4, 10);\n return INACTIVE;\n }\n\n if (prefs->GetBoolean(prefs::kInstantEnabledOnce)) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 5, 10);\n return INACTIVE;\n }\n\n if (!prefs->GetBoolean(prefs::kSearchSuggestEnabled)) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 6, 10);\n return INACTIVE;\n }\n\n if (prefs->IsManagedPreference(prefs::kInstantEnabled)) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 7, 10);\n return INACTIVE;\n }\n\n if (!MetricsServiceHelper::IsMetricsReportingEnabled()) {\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 8, 10);\n return INACTIVE;\n }\n\n UMA_HISTOGRAM_ENUMERATION(\"Instant.FieldTrial.Reason\", 0, 10);\n\n if (group == g_instant)\n return INSTANT;\n if (group == g_suggest)\n return SUGGEST;\n if (group == g_hidden)\n return HIDDEN;\n if (group == g_silent)\n return SILENT;\n if (group == g_control)\n return CONTROL;\n\n NOTREACHED();\n return INACTIVE;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsInstantExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == INSTANT || group == SUGGEST || group == HIDDEN ||\n group == SILENT;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsHiddenExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == SUGGEST || group == HIDDEN || group == SILENT;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsSilentExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == SILENT;\n}\n\n\/\/ static\nstd::string InstantFieldTrial::GetGroupName(Profile* profile) {\n switch (GetGroup(profile)) {\n case INACTIVE: return std::string();\n case INSTANT: return \"_Instant\";\n case SUGGEST: return \"_Suggest\";\n case HIDDEN: return \"_Hidden\";\n case SILENT: return \"_Silent\";\n case CONTROL: return \"_Control\";\n }\n\n NOTREACHED();\n return std::string();\n}\n\n\/\/ static\nstd::string InstantFieldTrial::GetGroupAsUrlParam(Profile* profile) {\n switch (GetGroup(profile)) {\n case INACTIVE: return std::string();\n case INSTANT: return \"ix=i9&\";\n case SUGGEST: return \"ix=t9&\";\n case HIDDEN: return \"ix=h9&\";\n case SILENT: return \"ix=s9&\";\n case CONTROL: return \"ix=c9&\";\n }\n\n NOTREACHED();\n return std::string();\n}\n\n\/\/ static\nbool InstantFieldTrial::ShouldSetSuggestedText(Profile* profile) {\n Group group = GetGroup(profile);\n return group != HIDDEN && group != SILENT;\n}\n<commit_msg>Enable the HIDDEN mode for most users.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/instant\/instant_field_trial.h\"\n\n#include \"base\/command_line.h\"\n#include \"base\/metrics\/field_trial.h\"\n#include \"chrome\/browser\/metrics\/metrics_service.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/pref_names.h\"\n\nnamespace {\n\n\/\/ Field trial IDs of the control and experiment groups. Though they are not\n\/\/ literally \"const\", they are set only once, in Activate() below. See the .h\n\/\/ file for what these groups represent.\nint g_inactive = -1;\nint g_instant = 0;\nint g_suggest = 0;\nint g_hidden = 0;\nint g_silent = 0;\nint g_control = 0;\n\n}\n\n\/\/ static\nvoid InstantFieldTrial::Activate() {\n scoped_refptr<base::FieldTrial> trial(\n base::FieldTrialList::FactoryGetFieldTrial(\n \"Instant\", 1000, \"Inactive\", 2013, 7, 1, &g_inactive));\n\n \/\/ Try to give the user a consistent experience, if possible.\n if (base::FieldTrialList::IsOneTimeRandomizationEnabled())\n trial->UseOneTimeRandomization();\n\n g_instant = trial->AppendGroup(\"Instant\", 10); \/\/ 1%\n g_suggest = trial->AppendGroup(\"Suggest\", 10); \/\/ 1%\n g_hidden = trial->AppendGroup(\"Hidden\", 960); \/\/ 96%\n g_silent = trial->AppendGroup(\"Silent\", 10); \/\/ 1%\n g_control = trial->AppendGroup(\"Control\", 10); \/\/ 1%\n}\n\n\/\/ static\nInstantFieldTrial::Group InstantFieldTrial::GetGroup(Profile* profile) {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n if (command_line->HasSwitch(switches::kInstantFieldTrial)) {\n std::string switch_value =\n command_line->GetSwitchValueASCII(switches::kInstantFieldTrial);\n if (switch_value == switches::kInstantFieldTrialInstant)\n return INSTANT;\n if (switch_value == switches::kInstantFieldTrialSuggest)\n return SUGGEST;\n if (switch_value == switches::kInstantFieldTrialHidden)\n return HIDDEN;\n if (switch_value == switches::kInstantFieldTrialSilent)\n return SILENT;\n if (switch_value == switches::kInstantFieldTrialControl)\n return CONTROL;\n return INACTIVE;\n }\n\n const int group = base::FieldTrialList::FindValue(\"Instant\");\n if (group == base::FieldTrial::kNotFinalized || group == g_inactive)\n return INACTIVE;\n\n \/\/ CONTROL and SILENT are unconstrained.\n if (group == g_control)\n return CONTROL;\n if (group == g_silent)\n return SILENT;\n\n \/\/ HIDDEN, SUGGEST and INSTANT need non-incognito, suggest-enabled profiles.\n const PrefService* prefs = profile ? profile->GetPrefs() : NULL;\n if (!prefs || profile->IsOffTheRecord() ||\n !prefs->GetBoolean(prefs::kSearchSuggestEnabled)) {\n return INACTIVE;\n }\n\n if (group == g_hidden)\n return HIDDEN;\n\n \/\/ SUGGEST and INSTANT require UMA opt-in.\n if (!MetricsServiceHelper::IsMetricsReportingEnabled())\n return INACTIVE;\n\n if (group == g_suggest)\n return SUGGEST;\n\n \/\/ Disable INSTANT for group policy overrides and explicit opt-out.\n if (prefs->IsManagedPreference(prefs::kInstantEnabled) ||\n prefs->GetBoolean(prefs::kInstantEnabledOnce)) {\n return INACTIVE;\n }\n\n if (group == g_instant)\n return INSTANT;\n\n NOTREACHED();\n return INACTIVE;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsInstantExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == INSTANT || group == SUGGEST || group == HIDDEN ||\n group == SILENT;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsHiddenExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == SUGGEST || group == HIDDEN || group == SILENT;\n}\n\n\/\/ static\nbool InstantFieldTrial::IsSilentExperiment(Profile* profile) {\n Group group = GetGroup(profile);\n return group == SILENT;\n}\n\n\/\/ static\nstd::string InstantFieldTrial::GetGroupName(Profile* profile) {\n switch (GetGroup(profile)) {\n case INACTIVE: return std::string();\n case INSTANT: return \"_Instant\";\n case SUGGEST: return \"_Suggest\";\n case HIDDEN: return \"_Hidden\";\n case SILENT: return \"_Silent\";\n case CONTROL: return \"_Control\";\n }\n\n NOTREACHED();\n return std::string();\n}\n\n\/\/ static\nstd::string InstantFieldTrial::GetGroupAsUrlParam(Profile* profile) {\n switch (GetGroup(profile)) {\n case INACTIVE: return std::string();\n case INSTANT: return \"ix=i9&\";\n case SUGGEST: return \"ix=t9&\";\n case HIDDEN: return \"ix=h9&\";\n case SILENT: return \"ix=s9&\";\n case CONTROL: return \"ix=c9&\";\n }\n\n NOTREACHED();\n return std::string();\n}\n\n\/\/ static\nbool InstantFieldTrial::ShouldSetSuggestedText(Profile* profile) {\n Group group = GetGroup(profile);\n return group != HIDDEN && group != SILENT;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/policy\/device_token_fetcher.h\"\n\n#include <algorithm>\n\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/policy\/cloud_policy_cache_base.h\"\n#include \"chrome\/browser\/policy\/device_management_service.h\"\n#include \"chrome\/browser\/policy\/proto\/device_management_constants.h\"\n#include \"chrome\/browser\/policy\/proto\/device_management_local.pb.h\"\n\nnamespace {\n\n\/\/ Retry after 5 minutes (with exponential backoff) after token fetch errors.\nconst int64 kTokenFetchErrorDelayMilliseconds = 5 * 60 * 1000;\n\/\/ Retry after max 3 hours after token fetch errors.\nconst int64 kTokenFetchErrorMaxDelayMilliseconds = 3 * 60 * 60 * 1000;\n\/\/ For unmanaged devices, check once per day whether they're still unmanaged.\nconst int64 kUnmanagedDeviceRefreshRateMilliseconds = 24 * 60 * 60 * 1000;\n\n} \/\/ namespace\n\nnamespace policy {\n\nnamespace em = enterprise_management;\n\nDeviceTokenFetcher::DeviceTokenFetcher(\n DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier)\n : ALLOW_THIS_IN_INITIALIZER_LIST(method_factory_(this)) {\n Initialize(service,\n cache,\n notifier,\n kTokenFetchErrorDelayMilliseconds,\n kTokenFetchErrorMaxDelayMilliseconds,\n kUnmanagedDeviceRefreshRateMilliseconds);\n}\n\nDeviceTokenFetcher::DeviceTokenFetcher(\n DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier,\n int64 token_fetch_error_delay_ms,\n int64 token_fetch_error_max_delay_ms,\n int64 unmanaged_device_refresh_rate_ms)\n : ALLOW_THIS_IN_INITIALIZER_LIST(method_factory_(this)) {\n Initialize(service,\n cache,\n notifier,\n token_fetch_error_delay_ms,\n token_fetch_error_max_delay_ms,\n unmanaged_device_refresh_rate_ms);\n}\n\nDeviceTokenFetcher::~DeviceTokenFetcher() {\n CancelRetryTask();\n}\n\nvoid DeviceTokenFetcher::FetchToken(\n const std::string& auth_token,\n const std::string& device_id,\n em::DeviceRegisterRequest_Type policy_type,\n const std::string& machine_id,\n const std::string& machine_model) {\n SetState(STATE_INACTIVE);\n auth_token_ = auth_token;\n device_id_ = device_id;\n policy_type_ = policy_type;\n machine_id_ = machine_id;\n machine_model_ = machine_model;\n FetchTokenInternal();\n}\n\nvoid DeviceTokenFetcher::FetchTokenInternal() {\n DCHECK(state_ != STATE_TOKEN_AVAILABLE);\n if (auth_token_.empty() || device_id_.empty()) {\n \/\/ Maybe this device is unmanaged, just exit. The CloudPolicyController\n \/\/ will call FetchToken() again if something changes.\n return;\n }\n \/\/ Construct a new backend, which will discard any previous requests.\n backend_.reset(service_->CreateBackend());\n em::DeviceRegisterRequest request;\n request.set_type(policy_type_);\n if (!machine_id_.empty())\n request.set_machine_id(machine_id_);\n if (!machine_model_.empty())\n request.set_machine_model(machine_model_);\n backend_->ProcessRegisterRequest(auth_token_, device_id_, request, this);\n}\n\nvoid DeviceTokenFetcher::SetUnmanagedState() {\n \/\/ The call to |cache_->SetUnmanaged()| has to happen first because it sets\n \/\/ the timestamp that |SetState()| needs to determine the correct refresh\n \/\/ time.\n cache_->SetUnmanaged();\n SetState(STATE_UNMANAGED);\n}\n\nconst std::string& DeviceTokenFetcher::GetDeviceToken() {\n return device_token_;\n}\n\nvoid DeviceTokenFetcher::StopAutoRetry() {\n CancelRetryTask();\n backend_.reset();\n device_token_.clear();\n auth_token_.clear();\n device_id_.clear();\n}\n\nvoid DeviceTokenFetcher::AddObserver(DeviceTokenFetcher::Observer* observer) {\n observer_list_.AddObserver(observer);\n}\n\nvoid DeviceTokenFetcher::RemoveObserver(\n DeviceTokenFetcher::Observer* observer) {\n observer_list_.RemoveObserver(observer);\n}\n\nvoid DeviceTokenFetcher::HandleRegisterResponse(\n const em::DeviceRegisterResponse& response) {\n if (response.has_device_management_token()) {\n device_token_ = response.device_management_token();\n SetState(STATE_TOKEN_AVAILABLE);\n } else {\n NOTREACHED();\n SetState(STATE_ERROR);\n }\n}\n\nvoid DeviceTokenFetcher::OnError(DeviceManagementBackend::ErrorCode code) {\n switch (code) {\n case DeviceManagementBackend::kErrorServiceManagementNotSupported:\n cache_->SetUnmanaged();\n SetState(STATE_UNMANAGED);\n break;\n case DeviceManagementBackend::kErrorRequestFailed:\n case DeviceManagementBackend::kErrorTemporaryUnavailable:\n case DeviceManagementBackend::kErrorServiceDeviceNotFound:\n SetState(STATE_TEMPORARY_ERROR);\n break;\n case DeviceManagementBackend::kErrorServiceManagementTokenInvalid:\n \/\/ Most probably the GAIA auth cookie has expired. We can not do anything\n \/\/ until the user logs-in again.\n SetState(STATE_BAD_AUTH);\n break;\n default:\n SetState(STATE_ERROR);\n }\n}\n\nvoid DeviceTokenFetcher::Initialize(DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier,\n int64 token_fetch_error_delay_ms,\n int64 token_fetch_error_max_delay_ms,\n int64 unmanaged_device_refresh_rate_ms) {\n service_ = service;\n cache_ = cache;\n notifier_ = notifier;\n token_fetch_error_delay_ms_ = token_fetch_error_delay_ms;\n token_fetch_error_max_delay_ms_ = token_fetch_error_max_delay_ms;\n effective_token_fetch_error_delay_ms_ = token_fetch_error_delay_ms;\n unmanaged_device_refresh_rate_ms_ = unmanaged_device_refresh_rate_ms;\n state_ = STATE_INACTIVE;\n retry_task_ = NULL;\n\n if (cache_->is_unmanaged())\n SetState(STATE_UNMANAGED);\n}\n\nvoid DeviceTokenFetcher::SetState(FetcherState state) {\n state_ = state;\n if (state_ != STATE_ERROR)\n effective_token_fetch_error_delay_ms_ = token_fetch_error_delay_ms_;\n\n base::Time delayed_work_at;\n switch (state_) {\n case STATE_INACTIVE:\n device_token_.clear();\n auth_token_.clear();\n device_id_.clear();\n notifier_->Inform(CloudPolicySubsystem::UNENROLLED,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_TOKEN_AVAILABLE:\n FOR_EACH_OBSERVER(Observer, observer_list_, OnDeviceTokenAvailable());\n notifier_->Inform(CloudPolicySubsystem::SUCCESS,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_UNMANAGED:\n delayed_work_at = cache_->last_policy_refresh_time() +\n base::TimeDelta::FromMilliseconds(unmanaged_device_refresh_rate_ms_);\n notifier_->Inform(CloudPolicySubsystem::UNMANAGED,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_TEMPORARY_ERROR:\n delayed_work_at = base::Time::Now() +\n base::TimeDelta::FromMilliseconds(\n effective_token_fetch_error_delay_ms_);\n effective_token_fetch_error_delay_ms_ =\n std::min(effective_token_fetch_error_delay_ms_ * 2,\n token_fetch_error_max_delay_ms_);\n notifier_->Inform(CloudPolicySubsystem::NETWORK_ERROR,\n CloudPolicySubsystem::DMTOKEN_NETWORK_ERROR,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_ERROR:\n effective_token_fetch_error_delay_ms_ = token_fetch_error_max_delay_ms_;\n delayed_work_at = base::Time::Now() +\n base::TimeDelta::FromMilliseconds(\n effective_token_fetch_error_delay_ms_);\n notifier_->Inform(CloudPolicySubsystem::NETWORK_ERROR,\n CloudPolicySubsystem::DMTOKEN_NETWORK_ERROR,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_BAD_AUTH:\n \/\/ Can't do anything, need to wait for new credentials.\n notifier_->Inform(CloudPolicySubsystem::BAD_GAIA_TOKEN,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n }\n\n CancelRetryTask();\n if (!delayed_work_at.is_null()) {\n base::Time now(base::Time::Now());\n int64 delay = std::max<int64>((delayed_work_at - now).InMilliseconds(), 0);\n retry_task_ = method_factory_.NewRunnableMethod(\n &DeviceTokenFetcher::ExecuteRetryTask);\n MessageLoop::current()->PostDelayedTask(FROM_HERE, retry_task_,\n delay);\n }\n}\n\nvoid DeviceTokenFetcher::ExecuteRetryTask() {\n DCHECK(retry_task_);\n retry_task_ = NULL;\n\n switch (state_) {\n case STATE_INACTIVE:\n case STATE_TOKEN_AVAILABLE:\n break;\n case STATE_UNMANAGED:\n case STATE_ERROR:\n case STATE_TEMPORARY_ERROR:\n case STATE_BAD_AUTH:\n FetchTokenInternal();\n break;\n }\n}\n\nvoid DeviceTokenFetcher::CancelRetryTask() {\n if (retry_task_) {\n retry_task_->Cancel();\n retry_task_ = NULL;\n }\n}\n\n} \/\/ namespace policy\n<commit_msg>Fix the backing off in case of temp network errors in DeviceTokenFetcher.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/policy\/device_token_fetcher.h\"\n\n#include <algorithm>\n\n#include \"base\/message_loop.h\"\n#include \"chrome\/browser\/policy\/cloud_policy_cache_base.h\"\n#include \"chrome\/browser\/policy\/device_management_service.h\"\n#include \"chrome\/browser\/policy\/proto\/device_management_constants.h\"\n#include \"chrome\/browser\/policy\/proto\/device_management_local.pb.h\"\n\nnamespace {\n\n\/\/ Retry after 5 minutes (with exponential backoff) after token fetch errors.\nconst int64 kTokenFetchErrorDelayMilliseconds = 5 * 60 * 1000;\n\/\/ Retry after max 3 hours after token fetch errors.\nconst int64 kTokenFetchErrorMaxDelayMilliseconds = 3 * 60 * 60 * 1000;\n\/\/ For unmanaged devices, check once per day whether they're still unmanaged.\nconst int64 kUnmanagedDeviceRefreshRateMilliseconds = 24 * 60 * 60 * 1000;\n\n} \/\/ namespace\n\nnamespace policy {\n\nnamespace em = enterprise_management;\n\nDeviceTokenFetcher::DeviceTokenFetcher(\n DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier)\n : ALLOW_THIS_IN_INITIALIZER_LIST(method_factory_(this)) {\n Initialize(service,\n cache,\n notifier,\n kTokenFetchErrorDelayMilliseconds,\n kTokenFetchErrorMaxDelayMilliseconds,\n kUnmanagedDeviceRefreshRateMilliseconds);\n}\n\nDeviceTokenFetcher::DeviceTokenFetcher(\n DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier,\n int64 token_fetch_error_delay_ms,\n int64 token_fetch_error_max_delay_ms,\n int64 unmanaged_device_refresh_rate_ms)\n : ALLOW_THIS_IN_INITIALIZER_LIST(method_factory_(this)) {\n Initialize(service,\n cache,\n notifier,\n token_fetch_error_delay_ms,\n token_fetch_error_max_delay_ms,\n unmanaged_device_refresh_rate_ms);\n}\n\nDeviceTokenFetcher::~DeviceTokenFetcher() {\n CancelRetryTask();\n}\n\nvoid DeviceTokenFetcher::FetchToken(\n const std::string& auth_token,\n const std::string& device_id,\n em::DeviceRegisterRequest_Type policy_type,\n const std::string& machine_id,\n const std::string& machine_model) {\n SetState(STATE_INACTIVE);\n auth_token_ = auth_token;\n device_id_ = device_id;\n policy_type_ = policy_type;\n machine_id_ = machine_id;\n machine_model_ = machine_model;\n FetchTokenInternal();\n}\n\nvoid DeviceTokenFetcher::FetchTokenInternal() {\n DCHECK(state_ != STATE_TOKEN_AVAILABLE);\n if (auth_token_.empty() || device_id_.empty()) {\n \/\/ Maybe this device is unmanaged, just exit. The CloudPolicyController\n \/\/ will call FetchToken() again if something changes.\n return;\n }\n \/\/ Construct a new backend, which will discard any previous requests.\n backend_.reset(service_->CreateBackend());\n em::DeviceRegisterRequest request;\n request.set_type(policy_type_);\n if (!machine_id_.empty())\n request.set_machine_id(machine_id_);\n if (!machine_model_.empty())\n request.set_machine_model(machine_model_);\n backend_->ProcessRegisterRequest(auth_token_, device_id_, request, this);\n}\n\nvoid DeviceTokenFetcher::SetUnmanagedState() {\n \/\/ The call to |cache_->SetUnmanaged()| has to happen first because it sets\n \/\/ the timestamp that |SetState()| needs to determine the correct refresh\n \/\/ time.\n cache_->SetUnmanaged();\n SetState(STATE_UNMANAGED);\n}\n\nconst std::string& DeviceTokenFetcher::GetDeviceToken() {\n return device_token_;\n}\n\nvoid DeviceTokenFetcher::StopAutoRetry() {\n CancelRetryTask();\n backend_.reset();\n device_token_.clear();\n auth_token_.clear();\n device_id_.clear();\n}\n\nvoid DeviceTokenFetcher::AddObserver(DeviceTokenFetcher::Observer* observer) {\n observer_list_.AddObserver(observer);\n}\n\nvoid DeviceTokenFetcher::RemoveObserver(\n DeviceTokenFetcher::Observer* observer) {\n observer_list_.RemoveObserver(observer);\n}\n\nvoid DeviceTokenFetcher::HandleRegisterResponse(\n const em::DeviceRegisterResponse& response) {\n if (response.has_device_management_token()) {\n device_token_ = response.device_management_token();\n SetState(STATE_TOKEN_AVAILABLE);\n } else {\n NOTREACHED();\n SetState(STATE_ERROR);\n }\n}\n\nvoid DeviceTokenFetcher::OnError(DeviceManagementBackend::ErrorCode code) {\n switch (code) {\n case DeviceManagementBackend::kErrorServiceManagementNotSupported:\n cache_->SetUnmanaged();\n SetState(STATE_UNMANAGED);\n break;\n case DeviceManagementBackend::kErrorRequestFailed:\n case DeviceManagementBackend::kErrorTemporaryUnavailable:\n case DeviceManagementBackend::kErrorServiceDeviceNotFound:\n SetState(STATE_TEMPORARY_ERROR);\n break;\n case DeviceManagementBackend::kErrorServiceManagementTokenInvalid:\n \/\/ Most probably the GAIA auth cookie has expired. We can not do anything\n \/\/ until the user logs-in again.\n SetState(STATE_BAD_AUTH);\n break;\n default:\n SetState(STATE_ERROR);\n }\n}\n\nvoid DeviceTokenFetcher::Initialize(DeviceManagementService* service,\n CloudPolicyCacheBase* cache,\n PolicyNotifier* notifier,\n int64 token_fetch_error_delay_ms,\n int64 token_fetch_error_max_delay_ms,\n int64 unmanaged_device_refresh_rate_ms) {\n service_ = service;\n cache_ = cache;\n notifier_ = notifier;\n token_fetch_error_delay_ms_ = token_fetch_error_delay_ms;\n token_fetch_error_max_delay_ms_ = token_fetch_error_max_delay_ms;\n effective_token_fetch_error_delay_ms_ = token_fetch_error_delay_ms;\n unmanaged_device_refresh_rate_ms_ = unmanaged_device_refresh_rate_ms;\n state_ = STATE_INACTIVE;\n retry_task_ = NULL;\n\n if (cache_->is_unmanaged())\n SetState(STATE_UNMANAGED);\n}\n\nvoid DeviceTokenFetcher::SetState(FetcherState state) {\n state_ = state;\n if (state_ != STATE_TEMPORARY_ERROR)\n effective_token_fetch_error_delay_ms_ = token_fetch_error_delay_ms_;\n\n base::Time delayed_work_at;\n switch (state_) {\n case STATE_INACTIVE:\n device_token_.clear();\n auth_token_.clear();\n device_id_.clear();\n notifier_->Inform(CloudPolicySubsystem::UNENROLLED,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_TOKEN_AVAILABLE:\n FOR_EACH_OBSERVER(Observer, observer_list_, OnDeviceTokenAvailable());\n notifier_->Inform(CloudPolicySubsystem::SUCCESS,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_UNMANAGED:\n delayed_work_at = cache_->last_policy_refresh_time() +\n base::TimeDelta::FromMilliseconds(unmanaged_device_refresh_rate_ms_);\n notifier_->Inform(CloudPolicySubsystem::UNMANAGED,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_TEMPORARY_ERROR:\n delayed_work_at = base::Time::Now() +\n base::TimeDelta::FromMilliseconds(\n effective_token_fetch_error_delay_ms_);\n effective_token_fetch_error_delay_ms_ =\n std::min(effective_token_fetch_error_delay_ms_ * 2,\n token_fetch_error_max_delay_ms_);\n notifier_->Inform(CloudPolicySubsystem::NETWORK_ERROR,\n CloudPolicySubsystem::DMTOKEN_NETWORK_ERROR,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_ERROR:\n effective_token_fetch_error_delay_ms_ = token_fetch_error_max_delay_ms_;\n delayed_work_at = base::Time::Now() +\n base::TimeDelta::FromMilliseconds(\n effective_token_fetch_error_delay_ms_);\n notifier_->Inform(CloudPolicySubsystem::NETWORK_ERROR,\n CloudPolicySubsystem::DMTOKEN_NETWORK_ERROR,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n case STATE_BAD_AUTH:\n \/\/ Can't do anything, need to wait for new credentials.\n notifier_->Inform(CloudPolicySubsystem::BAD_GAIA_TOKEN,\n CloudPolicySubsystem::NO_DETAILS,\n PolicyNotifier::TOKEN_FETCHER);\n break;\n }\n\n CancelRetryTask();\n if (!delayed_work_at.is_null()) {\n base::Time now(base::Time::Now());\n int64 delay = std::max<int64>((delayed_work_at - now).InMilliseconds(), 0);\n retry_task_ = method_factory_.NewRunnableMethod(\n &DeviceTokenFetcher::ExecuteRetryTask);\n MessageLoop::current()->PostDelayedTask(FROM_HERE, retry_task_,\n delay);\n }\n}\n\nvoid DeviceTokenFetcher::ExecuteRetryTask() {\n DCHECK(retry_task_);\n retry_task_ = NULL;\n\n switch (state_) {\n case STATE_INACTIVE:\n case STATE_TOKEN_AVAILABLE:\n break;\n case STATE_UNMANAGED:\n case STATE_ERROR:\n case STATE_TEMPORARY_ERROR:\n case STATE_BAD_AUTH:\n FetchTokenInternal();\n break;\n }\n}\n\nvoid DeviceTokenFetcher::CancelRetryTask() {\n if (retry_task_) {\n retry_task_->Cancel();\n retry_task_ = NULL;\n }\n}\n\n} \/\/ namespace policy\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ PrecompData_test.cpp\r\n\r\n\/** Test the PrecompData class\r\n *\/\r\n\r\n#include \"PrecompData.h\"\r\n#include \"PrecompData_test.h\"\r\n#include <cmath>\r\n#include <iostream>\r\n#include <string>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nfloat TestFunc(float x) {\r\n\treturn sin(x);\r\n}\r\n\r\nfloat TestFuncLin(float x) { \/\/ y = 2x\r\n return 2*x;\r\n}\r\n\r\nfloat TestFuncNonLin1(float x) { \/\/ y = |x|\r\n return fabs(x);\r\n}\r\n\r\nfloat TestFuncNonLin2(float x) { \/\/ y = 1\/(|x-2| + 0.1)\r\n return 1\/(fabs(x - 2.0) + 0.1);\r\n}\r\n\r\n\r\nnamespace Utilities {\r\n\r\nPrecompData_test::PrecompData_test()\r\n{\r\n\tusing namespace Utilities;\r\n\r\n const int nValues = 10;\r\n\r\n\r\n\t{ \/\/ Test 1 - Interpolation\r\n cout << \"\\n\\nTest 1: Zero-degree (nearest-neighbor\/point sampling\/Voronoi) interpolation:\" << endl;\r\n\t\tconst string funcName = \"TestFunc\";\r\n\t\tPrecompData<float> itp(funcName);\r\n\t\titp.SetComment(\"TestFunc approximation\");\r\n\t\tconst float x0 = 0.0f, x1 = 6.28f;\r\n\t\tconst float step = 0.5*(x1 - x0)\/nValues;\r\n\t\titp.Set(&TestFunc, x0, x1, nValues);\r\n\t\tfloat x = x0;\r\n float err = 0.0;\r\n\t\tfor(int i = 0; i < nValues; ++i) {\r\n const float y = itp(x);\r\n err += fabs(TestFunc(x) - y);\r\n\t\t\tcout << i << \":\\t\" << funcName << \"(\" << x << \") = \" << TestFunc(x) << \" ~ \" << y << endl;\r\n\t\t\tx += step;\r\n\t\t}\r\n cout << \"Total error = \" << err << endl;\r\n\t}\r\n\r\n { \/\/ Test 2 - Interpolation\r\n cout << \"\\n\\nTest 2: Linear interpolation:\" << endl;\r\n const string funcName = \"TestFunc\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n const float step = 0.5*(x1 - x0)\/nValues;\r\n itp.Set(&TestFunc, x0, x1, nValues);\r\n float x = x0;\r\n float err = 0.0;\r\n itp.Interpolation(1);\r\n cout << \"Interpolation: \" << itp.Interpolation() << endl;\r\n for(int i = 0; i < nValues; ++i) {\r\n const float y = itp.Interpolate(x);\r\n err += fabs(TestFunc(x) - y);\r\n cout << i << \":\\t\" << funcName << \"(\" << x << \") = \" << TestFunc(x) << \" ~ \" << y << endl;\r\n x += step;\r\n }\r\n cout << \"Total error = \" << err << endl;\r\n }\r\n\r\n if(0) { \/\/ Test 3 - AutoSet: y = 2x\r\n cout << \"\\n\\nTest 3: Automatic irregular grid: y = 2x\" << endl;\r\n const string funcName = \"y = 2x\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n itp.AutoSet(&TestFuncLin, x0, x1, nValues);\r\n cerr << \"x0 = \" << x0 << \" x1 = \" << x1 << \" nValues = \" << nValues << endl; \/\/+T+\r\n std::vector<float> vx, vy;\r\n itp.Get(vx, vy);\r\n cout << \"Sizes: x = \" << vx.size() << \"; y = \" << vy.size() << endl;\r\n for(size_t i = 0; i < nValues; ++i) {\r\n cout << i << \": \" << vx[i] << \", \" << vy[i] << endl;\r\n }\r\n }\r\n\r\n if(0) { \/\/ Test 4 - AutoSet: y = 1\/(|x-2| + 0.1)\r\n cout << \"\\n\\nTest 4: Automatic irregular grid: y = 1\/(|x-2| + 0.1)\" << endl;\r\n const string funcName = \"y = 1\/(|x-2| + 0.1)\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n itp.AutoSet(&TestFuncNonLin2, x0, x1, nValues);\r\n cerr << \"x0 = \" << x0 << \" x1 = \" << x1 << \" nValues = \" << nValues << endl; \/\/+T+\r\n std::vector<float> vx, vy;\r\n itp.Get(vx, vy);\r\n cout << \"Sizes: x = \" << vx.size() << \"; y = \" << vy.size() << endl;\r\n for(size_t i = 0; i < nValues; ++i) {\r\n cout << i << \": \" << vx[i] << \", \" << vy[i] << endl;\r\n }\r\n }\r\n\r\n { \/\/ Test 5 - Derivatives\r\n cout << \"\\n\\nTest 5: Derivatives\" << endl;\r\n const string funcName = \"Derivatives\";\r\n float x1, y1, x2, y2, x3, y3, der1, der2, expRes;\r\n PrecompData<float> test;\r\n\r\n \/\/ First derivative\r\n x1 = 0.0; y1 = 0.0; x2 = 1.0; y2 = 0.0; expRes = 0.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 1\" << endl;\r\n }\r\n x1 = 0.0; y1 = 0.0; x2 = 1.0; y2 = 1.0; expRes = 1.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 2\" << endl;\r\n }\r\n x1 = 1.0; y1 = 0.0; x2 = 0.0; y2 = 1.0; expRes = -1.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 3\" << endl;\r\n }\r\n x1 = 0.0; y1 = 0.0; x2 = 2.0; y2 = 1.0; expRes = 0.5;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 4\" << endl;\r\n }\r\n x1 = 0.0; y1 = -1.0; x2 = 1.0; y2 = 1.0; expRes = 2.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 5\" << endl;\r\n }\r\n x1 = 0.0; y1 = 1.0; x2 = 1.0; y2 = 1.0; expRes = 0.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n cerr << \"Error - First derivative 6\" << endl;\r\n }\r\n\r\n \/\/ Second derivative\r\n\r\n }\r\n}\r\n\r\n\r\n} \/\/ Utilities\r\n\r\n\r\nint main()\r\n{\r\n using namespace Utilities;\r\n\r\n PrecompData_test test;\r\n\r\n return 0;\r\n}\r\n<commit_msg>- Count number of tests and number of failures.<commit_after>\/\/\/ PrecompData_test.cpp\r\n\r\n\/** Test the PrecompData class\r\n *\/\r\n\r\n#include \"PrecompData.h\"\r\n#include \"PrecompData_test.h\"\r\n#include <cmath>\r\n#include <iostream>\r\n#include <string>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nfloat TestFunc(float x) {\r\n\treturn sin(x);\r\n}\r\n\r\nfloat TestFuncLin(float x) { \/\/ y = 2x\r\n return 2*x;\r\n}\r\n\r\nfloat TestFuncNonLin1(float x) { \/\/ y = |x|\r\n return fabs(x);\r\n}\r\n\r\nfloat TestFuncNonLin2(float x) { \/\/ y = 1\/(|x-2| + 0.1)\r\n return 1\/(fabs(x - 2.0) + 0.1);\r\n}\r\n\r\n\r\nnamespace Utilities {\r\n\r\nPrecompData_test::PrecompData_test()\r\n{\r\n\tusing namespace Utilities;\r\n\r\n const int nValues = 10;\r\n\r\n\r\n\t{ \/\/ Test 1 - Interpolation\r\n cout << \"\\n\\nTest 1: Zero-degree (nearest-neighbor\/point sampling\/Voronoi) interpolation:\" << endl;\r\n\t\tconst string funcName = \"TestFunc\";\r\n\t\tPrecompData<float> itp(funcName);\r\n\t\titp.SetComment(\"TestFunc approximation\");\r\n\t\tconst float x0 = 0.0f, x1 = 6.28f;\r\n\t\tconst float step = 0.5*(x1 - x0)\/nValues;\r\n\t\titp.Set(&TestFunc, x0, x1, nValues);\r\n\t\tfloat x = x0;\r\n float err = 0.0;\r\n\t\tfor(int i = 0; i < nValues; ++i) {\r\n const float y = itp(x);\r\n err += fabs(TestFunc(x) - y);\r\n\t\t\tcout << i << \":\\t\" << funcName << \"(\" << x << \") = \" << TestFunc(x) << \" ~ \" << y << endl;\r\n\t\t\tx += step;\r\n\t\t}\r\n cout << \"Total error = \" << err << endl;\r\n\t}\r\n\r\n { \/\/ Test 2 - Interpolation\r\n cout << \"\\n\\nTest 2: Linear interpolation:\" << endl;\r\n const string funcName = \"TestFunc\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n const float step = 0.5*(x1 - x0)\/nValues;\r\n itp.Set(&TestFunc, x0, x1, nValues);\r\n float x = x0;\r\n float err = 0.0;\r\n itp.Interpolation(1);\r\n cout << \"Interpolation: \" << itp.Interpolation() << endl;\r\n for(int i = 0; i < nValues; ++i) {\r\n const float y = itp.Interpolate(x);\r\n err += fabs(TestFunc(x) - y);\r\n cout << i << \":\\t\" << funcName << \"(\" << x << \") = \" << TestFunc(x) << \" ~ \" << y << endl;\r\n x += step;\r\n }\r\n cout << \"Total error = \" << err << endl;\r\n }\r\n\r\n if(0) { \/\/ Test 3 - AutoSet: y = 2x\r\n cout << \"\\n\\nTest 3: Automatic irregular grid: y = 2x\" << endl;\r\n const string funcName = \"y = 2x\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n itp.AutoSet(&TestFuncLin, x0, x1, nValues);\r\n cerr << \"x0 = \" << x0 << \" x1 = \" << x1 << \" nValues = \" << nValues << endl; \/\/+T+\r\n std::vector<float> vx, vy;\r\n itp.Get(vx, vy);\r\n cout << \"Sizes: x = \" << vx.size() << \"; y = \" << vy.size() << endl;\r\n for(size_t i = 0; i < nValues; ++i) {\r\n cout << i << \": \" << vx[i] << \", \" << vy[i] << endl;\r\n }\r\n }\r\n\r\n if(0) { \/\/ Test 4 - AutoSet: y = 1\/(|x-2| + 0.1)\r\n cout << \"\\n\\nTest 4: Automatic irregular grid: y = 1\/(|x-2| + 0.1)\" << endl;\r\n const string funcName = \"y = 1\/(|x-2| + 0.1)\";\r\n PrecompData<float> itp(funcName);\r\n const float x0 = 0.0f, x1 = 6.28f;\r\n itp.AutoSet(&TestFuncNonLin2, x0, x1, nValues);\r\n cerr << \"x0 = \" << x0 << \" x1 = \" << x1 << \" nValues = \" << nValues << endl; \/\/+T+\r\n std::vector<float> vx, vy;\r\n itp.Get(vx, vy);\r\n cout << \"Sizes: x = \" << vx.size() << \"; y = \" << vy.size() << endl;\r\n for(size_t i = 0; i < nValues; ++i) {\r\n cout << i << \": \" << vx[i] << \", \" << vy[i] << endl;\r\n }\r\n }\r\n\r\n { \/\/ Test 5 - Derivatives\r\n cout << \"\\n\\nTest 5: Derivatives\" << endl;\r\n int nTests = 0, nFailed = 0;\r\n const string funcName = \"Derivatives\";\r\n float x1, y1, x2, y2, x3, y3, der1, der2, expRes;\r\n PrecompData<float> test;\r\n\r\n \/\/ First derivative\r\n x1 = 0.0; y1 = 0.0; x2 = 1.0; y2 = 0.0; expRes = 0.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 1\" << endl;\r\n }\r\n x1 = 0.0; y1 = 0.0; x2 = 1.0; y2 = 1.0; expRes = 1.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 2\" << endl;\r\n }\r\n x1 = 1.0; y1 = 0.0; x2 = 0.0; y2 = 1.0; expRes = -1.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 3\" << endl;\r\n }\r\n x1 = 0.0; y1 = 0.0; x2 = 2.0; y2 = 1.0; expRes = 0.5;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 4\" << endl;\r\n }\r\n x1 = 0.0; y1 = -1.0; x2 = 1.0; y2 = 1.0; expRes = 2.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 5\" << endl;\r\n }\r\n x1 = 0.0; y1 = 1.0; x2 = 1.0; y2 = 1.0; expRes = 0.0;\r\n der1 = test.FirstDerivative(x1, y1, x2, y2);\r\n ++nTests;\r\n if(fabs(der1 - expRes) > 0.0001) {\r\n ++nFailed;\r\n cerr << \"Error - First derivative 6\" << endl;\r\n }\r\n\r\n \/\/ Second derivative\r\n\r\n cout << \"Derivatives: Number of tests = \" << nTests << \"; Number of failures = \" << nFailed << endl;\r\n }\r\n}\r\n\r\n\r\n} \/\/ Utilities\r\n\r\n\r\nint main()\r\n{\r\n using namespace Utilities;\r\n\r\n PrecompData_test test;\r\n\r\n return 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * *****************************************************************************\/\n\n\/*****\n * Author: Sergey Shekyan sshekyan@qualys.com\n *\n * Slow HTTP attack vulnerability test tool\n * http:\/\/code.google.com\/p\/slowhttptest\/\n *****\/\n\n#include <errno.h>\n#include <fcntl.h>\n#include <netdb.h>\n#include <stdio.h>\n#include <string.h>\n#include <cmath>\n#include <string>\n\n#include <openssl\/ssl.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n\n#include \"slowlog.h\"\n#include \"slowsocket.h\"\n#include \"slowurl.h\"\n\nnamespace slowhttptest {\nSlowSocket::SlowSocket()\n : sockfd_(-1), requests_to_send_(0),\n followups_to_send_(0), last_followup_timing_(0),\n offset_(0), ssl_(0), buf_(0) {\n}\n\nSlowSocket::~SlowSocket() {\n close();\n}\n\nint SlowSocket::set_nonblocking() {\n int flags;\n\n if(-1 == (flags = fcntl(sockfd_, F_GETFL, 0))) {\n flags = 0;\n }\n return fcntl(sockfd_, F_SETFL, flags | O_NONBLOCK);\n}\n\nbool SlowSocket::init(addrinfo* addr, const Url* url, int& maxfd,\n int followups_to_send) {\n addrinfo* res;\n bool connected = false;\n for (res = addr; !connected && res; res = res->ai_next) {\n sockfd_ = socket(res->ai_family, res->ai_socktype,\n res->ai_protocol);\n if(-1 == sockfd_) {\n slowlog(LOG_ERROR, \"%s: Failed to create socket\\n\", __FUNCTION__);\n return false;\n }\n\n if(-1 == set_nonblocking()) {\n slowlog(LOG_ERROR, \"%s: Failed to set socket %d to non-blocking \\n\", __FUNCTION__,\n sockfd_);\n return false;\n }\n connected = url->isSSL() ? connect_ssl(addr) : connect_plain(addr); \n }\n\n\n followups_to_send_ = followups_to_send;\n requests_to_send_ = 1;\n\n if(sockfd_ > maxfd) {\n maxfd = sockfd_;\n }\n return true;\n}\n\nbool SlowSocket::connect_plain(addrinfo* addr) {\n errno = 0;\n\n if (connect(sockfd_, addr->ai_addr, addr->ai_addrlen) < 0\n && EINPROGRESS != errno) {\n slowlog(LOG_ERROR, \"%s: Cannot connect qsocket: %s %d \\n\", __FUNCTION__,\n strerror(errno), sockfd_);\n close();\n return false;\n }\n return true;\n}\n\nbool SlowSocket::connect_ssl(addrinfo* addr) {\n \/\/ Establish regular connection.\n if(!connect_plain(addr)) return false;\n \n \/\/ Init SSL related stuff.\n \/\/ TODO(vagababov): this is not thread safe of pretty.\n static bool ssl_is_initialized = false;\n if (!ssl_is_initialized) {\n SSL_library_init();\n ssl_is_initialized = true;\n }\n SSL_METHOD* method = NULL;\n SSL_CTX* ssl_ctx = NULL;\n method = SSLv23_client_method();\n ssl_ctx = SSL_CTX_new(method);\n if(!ssl_ctx) {\n slowlog(LOG_ERROR, \"%s: Cannot create new SSL context\\n\", __FUNCTION__);\n close();\n return false;\n }\n ssl_ = SSL_new(ssl_ctx);\n if(!ssl_) {\n slowlog(LOG_ERROR, \"%s: Cannot create SSL structure for a connection\\n\",\n __FUNCTION__);\n close();\n return false;\n }\n SSL_set_fd(ssl_, sockfd_);\n int ret = SSL_connect(ssl_);\n if(ret <= 0) {\n int err = SSL_get_error(ssl_, ret);\n slowlog(LOG_ERROR, \"%s: SSL connect error: %d\\n\", __FUNCTION__, err);\n if(SSL_ERROR_WANT_READ != err && SSL_ERROR_WANT_WRITE != err) {\n close();\n return false;\n }\n }\n slowlog(LOG_DEBUG, \"%s: SSL connection is using %s\\n\", __FUNCTION__,\n SSL_get_cipher(ssl_));\n return true;\n}\n\nint SlowSocket::recv_slow(void *buf, size_t len) {\n return ssl_ ? SSL_read(ssl_, buf, len)\n : recv(sockfd_, buf, len, 0);\n}\n\nint SlowSocket::send_slow(const void* buf, size_t len, const SendType type) {\n \/\/ VA: this is not good. create a \"prepare\" method.\n \/\/ initial send\n if(buf_ == 0) {\n buf_ = buf;\n offset_ = len;\n }\n\n int ret = ssl_ ? SSL_write(ssl_, buf_, offset_)\n : send(sockfd_, buf_, offset_, 0);\n\n \/\/ entire data was sent\n if(ret > 0 && ret == offset_) {\n if(eInitialSend == type) {\n --requests_to_send_;\n } else if(eFollowUpSend == type) {\n --followups_to_send_;\n }\n buf_ = 0;\n offset_ = 0;\n } else if(ret > 0 && ret < offset_) {\n buf_ = static_cast<const char*>(buf_) + ret;\n offset_ -= ret;\n } \n return ret;\n}\n\nvoid SlowSocket::close() {\n if (-1 == sockfd_) return;\n\n slowlog(LOG_DEBUG, \"closing slow, sock is %d\\n\", sockfd_);\n if(ssl_) {\n SSL_free(ssl_);\n ssl_ = NULL;\n }\n requests_to_send_ = 0;\n followups_to_send_ = 0;\n ::close(sockfd_);\n sockfd_ = -1;\n}\n\n} \/\/ namespace slowhttptest\n<commit_msg>fix warning on newer g++<commit_after>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * *****************************************************************************\/\n\n\/*****\n * Author: Sergey Shekyan sshekyan@qualys.com\n *\n * Slow HTTP attack vulnerability test tool\n * http:\/\/code.google.com\/p\/slowhttptest\/\n *****\/\n\n#include <errno.h>\n#include <fcntl.h>\n#include <netdb.h>\n#include <stdio.h>\n#include <string.h>\n#include <cmath>\n#include <string>\n\n#include <openssl\/ssl.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n\n#include \"slowlog.h\"\n#include \"slowsocket.h\"\n#include \"slowurl.h\"\n\nnamespace slowhttptest {\nSlowSocket::SlowSocket()\n : sockfd_(-1), requests_to_send_(0),\n followups_to_send_(0), last_followup_timing_(0),\n offset_(0), ssl_(0), buf_(0) {\n}\n\nSlowSocket::~SlowSocket() {\n close();\n}\n\nint SlowSocket::set_nonblocking() {\n int flags;\n\n if(-1 == (flags = fcntl(sockfd_, F_GETFL, 0))) {\n flags = 0;\n }\n return fcntl(sockfd_, F_SETFL, flags | O_NONBLOCK);\n}\n\nbool SlowSocket::init(addrinfo* addr, const Url* url, int& maxfd,\n int followups_to_send) {\n addrinfo* res;\n bool connected = false;\n for (res = addr; !connected && res; res = res->ai_next) {\n sockfd_ = socket(res->ai_family, res->ai_socktype,\n res->ai_protocol);\n if(-1 == sockfd_) {\n slowlog(LOG_ERROR, \"%s: Failed to create socket\\n\", __FUNCTION__);\n return false;\n }\n\n if(-1 == set_nonblocking()) {\n slowlog(LOG_ERROR, \"%s: Failed to set socket %d to non-blocking \\n\", __FUNCTION__,\n sockfd_);\n return false;\n }\n connected = url->isSSL() ? connect_ssl(addr) : connect_plain(addr); \n }\n\n\n followups_to_send_ = followups_to_send;\n requests_to_send_ = 1;\n\n if(sockfd_ > maxfd) {\n maxfd = sockfd_;\n }\n return true;\n}\n\nbool SlowSocket::connect_plain(addrinfo* addr) {\n errno = 0;\n\n if (connect(sockfd_, addr->ai_addr, addr->ai_addrlen) < 0\n && EINPROGRESS != errno) {\n slowlog(LOG_ERROR, \"%s: Cannot connect qsocket: %s %d \\n\", __FUNCTION__,\n strerror(errno), sockfd_);\n close();\n return false;\n }\n return true;\n}\n\nbool SlowSocket::connect_ssl(addrinfo* addr) {\n \/\/ Establish regular connection.\n if(!connect_plain(addr)) return false;\n \n \/\/ Init SSL related stuff.\n \/\/ TODO(vagababov): this is not thread safe of pretty.\n static bool ssl_is_initialized = false;\n if (!ssl_is_initialized) {\n SSL_library_init();\n ssl_is_initialized = true;\n }\n SSL_METHOD* method = NULL;\n SSL_CTX* ssl_ctx = NULL;\n method = (SSL_METHOD*)SSLv23_client_method();\n ssl_ctx = SSL_CTX_new(method);\n if(!ssl_ctx) {\n slowlog(LOG_ERROR, \"%s: Cannot create new SSL context\\n\", __FUNCTION__);\n close();\n return false;\n }\n ssl_ = SSL_new(ssl_ctx);\n if(!ssl_) {\n slowlog(LOG_ERROR, \"%s: Cannot create SSL structure for a connection\\n\",\n __FUNCTION__);\n close();\n return false;\n }\n SSL_set_fd(ssl_, sockfd_);\n int ret = SSL_connect(ssl_);\n if(ret <= 0) {\n int err = SSL_get_error(ssl_, ret);\n slowlog(LOG_ERROR, \"%s: SSL connect error: %d\\n\", __FUNCTION__, err);\n if(SSL_ERROR_WANT_READ != err && SSL_ERROR_WANT_WRITE != err) {\n close();\n return false;\n }\n }\n slowlog(LOG_DEBUG, \"%s: SSL connection is using %s\\n\", __FUNCTION__,\n SSL_get_cipher(ssl_));\n return true;\n}\n\nint SlowSocket::recv_slow(void *buf, size_t len) {\n return ssl_ ? SSL_read(ssl_, buf, len)\n : recv(sockfd_, buf, len, 0);\n}\n\nint SlowSocket::send_slow(const void* buf, size_t len, const SendType type) {\n \/\/ VA: this is not good. create a \"prepare\" method.\n \/\/ initial send\n if(buf_ == 0) {\n buf_ = buf;\n offset_ = len;\n }\n\n int ret = ssl_ ? SSL_write(ssl_, buf_, offset_)\n : send(sockfd_, buf_, offset_, 0);\n\n \/\/ entire data was sent\n if(ret > 0 && ret == offset_) {\n if(eInitialSend == type) {\n --requests_to_send_;\n } else if(eFollowUpSend == type) {\n --followups_to_send_;\n }\n buf_ = 0;\n offset_ = 0;\n } else if(ret > 0 && ret < offset_) {\n buf_ = static_cast<const char*>(buf_) + ret;\n offset_ -= ret;\n } \n return ret;\n}\n\nvoid SlowSocket::close() {\n if (-1 == sockfd_) return;\n\n slowlog(LOG_DEBUG, \"closing slow, sock is %d\\n\", sockfd_);\n if(ssl_) {\n SSL_free(ssl_);\n ssl_ = NULL;\n }\n requests_to_send_ = 0;\n followups_to_send_ = 0;\n ::close(sockfd_);\n sockfd_ = -1;\n}\n\n} \/\/ namespace slowhttptest\n<|endoftext|>"} {"text":"<commit_before>\/*$TET$odrhandling$!cpp-copyright!*\/\n\/*--------------------------------------------------------------------------*\/\n\/* Copyright 2015 Sergey Vostokin *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.*\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/*--------------------------------------------------------------------------*\/\n\/* *\/\n\/*\tBusiness process model : Customer Order procedure *\/\n\/* *\/\n\/*\tA Customer prepares an Order. *\/\n\/*\tHe \/ she sends the order to Order Handling. *\/\n\/*\tOrder Handling checks the order. *\/\n\/*\tIt sends an order confirmation to the Customer. *\/\n\/*\tThe Customer receives the order confirmation. *\/\n\/*\tThe Customer waits for the product. *\/\n\/*\tOrder Handling sends a delivery request to Shipment. Shipment receives *\/\n\/*\tthe request and sends the product delivery to the Customer. *\/\n\/*\tThe Customer receives the product delivery and checks the delivery. *\/\n\/* *\/\n\/*\tSource: S-BPM in the Wild.Practical Value Creation *\/\n\/*\t\t\thttp:\/\/www.springer.com\/de\/book\/9783319175416 (page 280) *\/\n\/*--------------------------------------------------------------------------*\/\n\/*$TET$*\/\n\n\/*$TET$odrhandling$!templet!*\/\n\/*\n~Customer_Order_handling=\n+\tPREPARES? order -> CHECKS;\n\tCHECKS! order_conformation -> RECEIVES; RECEIVES?.\n\n~Order_handling_Shipment=\n+\tSENDS? delivery_request -> RECIEVES; RECIEVES!.\n\n~Shipment_Customer=\n+\tSEND? product_delivery -> RECIEVES_AND_CHECKS; RECIEVES_AND_CHECKS!.\n\n*Customer=\n\torder_handling:Customer_Order_handling ! order_conformation->receive;\n\tshipment:Shipment_Customer ? product_delivery->recieves_and_checks;\n\n+\tprepare()->send; send(order_handling!order);\n\treceive(order_handling?order_conformation);\n\trecieves_and_checks(shipment?product_delivery).\n\n*Order_handling=\n\tcustomer:Customer_Order_handling ? order->check;\n\tshipment:Order_handling_Shipment !;\n\n\tcheck(customer?order, customer!order_conformation)->send;\n\tsend(shipment!delivery_request).\n\n*Shipment=\n\torder_handling:Order_handling_Shipment ?\n\tdelivery_request -> receive;\n\tcustomer:Shipment_Customer !;\n\n\treceive(order_handling?delivery_request) -> deliver;\n\tdeliver(customer!product_delivery).\n*\/\n\/*$TET$*\/\n\n#include \"odrhandling.h\"\n\n\/*$TET$odrhandling$!cpp-prologue!*\/\n#include <iostream>\nusing namespace std;\n#include <math.h>\n#include <time.h>\n\/*$TET$*\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Customer_Order_handling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCustomer_Order_handling::Customer_Order_handling(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Customer_Order_handling$!constructor!*\/\n\/*$TET$*\/\n}\n\nCustomer_Order_handling::~Customer_Order_handling()\n{\n\/*$TET$Customer_Order_handling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Order_handling_Shipment\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOrder_handling_Shipment::Order_handling_Shipment(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Order_handling_Shipment$!constructor!*\/\n\/*$TET$*\/\n}\n\nOrder_handling_Shipment::~Order_handling_Shipment()\n{\n\/*$TET$Order_handling_Shipment$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Shipment_Customer\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nShipment_Customer::Shipment_Customer(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Shipment_Customer$!constructor!*\/\n\/*$TET$*\/\n}\n\nShipment_Customer::~Shipment_Customer()\n{\n\/*$TET$Shipment_Customer$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Customer\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCustomer::Customer(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Customer$!constructor!*\/\n\/*$TET$*\/\n}\n\nCustomer::~Customer()\n{\n\/*$TET$Customer$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Customer$!usercode!*\/\n\/*$TET$*\/\n\nbool Customer::prepare()\n{\n\/*$TET$Customer$prepare*\/\n\t\tcout << \"\\tA Customer prepares an Order.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::send(\/*out*\/Customer_Order_handling::order*p1)\n{\n\/*$TET$Customer$send*\/\n\t\tcout << \"\\tHe\/she sends the order to Order Handling.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::receive(\/*in*\/Customer_Order_handling::order_conformation*p1)\n{\n\/*$TET$Customer$receive*\/\n\t\tcout << \"\\tThe Customer receives the order confirmation.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::recieves_and_checks(\/*in*\/Shipment_Customer::product_delivery*p1)\n{\n\/*$TET$Customer$recieves_and_checks*\/\n\t\tcout << \"\\tThe Customer receives the product delivery and checks the delivery.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Customer::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Customer$!run!*\/\n\t\tcout << \"Customer:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Order_handling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOrder_handling::Order_handling(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Order_handling$!constructor!*\/\n\/*$TET$*\/\n}\n\nOrder_handling::~Order_handling()\n{\n\/*$TET$Order_handling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Order_handling$!usercode!*\/\n\/*$TET$*\/\n\nbool Order_handling::check(\/*in*\/Customer_Order_handling::order*p1,\/*out*\/Customer_Order_handling::order_conformation*p2)\n{\n\/*$TET$Order_handling$check*\/\n\t\tcout << \"\\tOrder Handling checks the order. It sends an order confirmation to the Customer.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Order_handling::send(\/*out*\/Order_handling_Shipment::delivery_request*p1)\n{\n\/*$TET$Order_handling$send*\/\n\t\tcout << \"\\tOrder Handling sends a delivery request to Shipment.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Order_handling::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Order_handling$!run!*\/\n\t\tcout << \"Order handling:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Shipment\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nShipment::Shipment(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Shipment$!constructor!*\/\n\/*$TET$*\/\n}\n\nShipment::~Shipment()\n{\n\/*$TET$Shipment$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Shipment$!usercode!*\/\n\/*$TET$*\/\n\nbool Shipment::receive(\/*in*\/Order_handling_Shipment::delivery_request*p1)\n{\n\/*$TET$Shipment$receive*\/\n\t\tcout << \"\\tShipment receives the request\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Shipment::deliver(\/*out*\/Shipment_Customer::product_delivery*p1)\n{\n\/*$TET$Shipment$deliver*\/\n\t\tcout << \"\\t and sends the product delivery to the Customer.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Shipment::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Shipment$!run!*\/\n\t\tcout << \"Shipment:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class odrhandling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nodrhandling::odrhandling(int NT): TEMPLET_DBG::Assemble(NT)\n{\n\/*$TET$odrhandling$!constructor!*\/\n\/*$TET$*\/\n}\n\nodrhandling::~odrhandling()\n{\n\/*$TET$odrhandling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$odrhandling$!cpp-epilogue!*\/\nint main()\n{\n\todrhandling runtime(1);\n\n\tCustomer* customer = runtime.new_Customer();\n\tOrder_handling* order_handling = runtime.new_Order_handling();\n\tShipment* shipment = runtime.new_Shipment();\n\n\torder_handling->p_customer(customer->p_order_handling());\n\tshipment->p_order_handling(order_handling->p_shipment());\n\tcustomer->p_shipment(shipment->p_customer());\n\n\n\tcout << \"--Customer Order procedure--\" << endl;\n\tsrand(time(NULL));\/\/ to show different system behaviors (because of different times of message processing)\n\truntime.run();\n\n\treturn 0;\n}\n\/*$TET$*\/\n\n<commit_msg>Update odrhandling.cpp<commit_after>\/*$TET$odrhandling$!cpp-copyright!*\/\n\/*--------------------------------------------------------------------------*\/\n\/* Copyright 2015 Sergey Vostokin *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.*\/\n\/* See the License for the specific language governing permissions and *\/\n\/* limitations under the License. *\/\n\/*--------------------------------------------------------------------------*\/\n\/* *\/\n\/* Business process model : Customer Order procedure *\/\n\/* *\/\n\/* A Customer prepares an Order. *\/\n\/* He \/ she sends the order to Order Handling. *\/\n\/* Order Handling checks the order. *\/\n\/* It sends an order confirmation to the Customer. *\/\n\/* The Customer receives the order confirmation. *\/\n\/* The Customer waits for the product. *\/\n\/* Order Handling sends a delivery request to Shipment. Shipment receives *\/\n\/* the request and sends the product delivery to the Customer. *\/\n\/* The Customer receives the product delivery and checks the delivery. *\/\n\/* *\/\n\/* Source: S-BPM in the Wild.Practical Value Creation *\/\n\/* http:\/\/www.springer.com\/de\/book\/9783319175416 (page 280) *\/\n\/*--------------------------------------------------------------------------*\/\n\/*$TET$*\/\n\n\/*$TET$odrhandling$!templet!*\/\n\/*\n~Customer_Order_handling=\n+\tPREPARES? order -> CHECKS;\n\tCHECKS! order_conformation -> RECEIVES; RECEIVES?.\n\n~Order_handling_Shipment=\n+\tSENDS? delivery_request -> RECIEVES; RECIEVES!.\n\n~Shipment_Customer=\n+\tSEND? product_delivery -> RECIEVES_AND_CHECKS; RECIEVES_AND_CHECKS!.\n\n*Customer=\n\torder_handling:Customer_Order_handling ! order_conformation->receive;\n\tshipment:Shipment_Customer ? product_delivery->recieves_and_checks;\n\n+\tprepare()->send; send(order_handling!order);\n\treceive(order_handling?order_conformation);\n\trecieves_and_checks(shipment?product_delivery).\n\n*Order_handling=\n\tcustomer:Customer_Order_handling ? order->check;\n\tshipment:Order_handling_Shipment !;\n\n\tcheck(customer?order, customer!order_conformation)->send;\n\tsend(shipment!delivery_request).\n\n*Shipment=\n\torder_handling:Order_handling_Shipment ?\n\tdelivery_request -> receive;\n\tcustomer:Shipment_Customer !;\n\n\treceive(order_handling?delivery_request) -> deliver;\n\tdeliver(customer!product_delivery).\n*\/\n\/*$TET$*\/\n\n#include \"odrhandling.h\"\n\n\/*$TET$odrhandling$!cpp-prologue!*\/\n#include <iostream>\nusing namespace std;\n#include <math.h>\n#include <time.h>\n\/*$TET$*\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Customer_Order_handling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCustomer_Order_handling::Customer_Order_handling(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Customer_Order_handling$!constructor!*\/\n\/*$TET$*\/\n}\n\nCustomer_Order_handling::~Customer_Order_handling()\n{\n\/*$TET$Customer_Order_handling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Order_handling_Shipment\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOrder_handling_Shipment::Order_handling_Shipment(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Order_handling_Shipment$!constructor!*\/\n\/*$TET$*\/\n}\n\nOrder_handling_Shipment::~Order_handling_Shipment()\n{\n\/*$TET$Order_handling_Shipment$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Shipment_Customer\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nShipment_Customer::Shipment_Customer(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Channel(a)\n{\n\/*$TET$Shipment_Customer$!constructor!*\/\n\/*$TET$*\/\n}\n\nShipment_Customer::~Shipment_Customer()\n{\n\/*$TET$Shipment_Customer$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Customer\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCustomer::Customer(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Customer$!constructor!*\/\n\/*$TET$*\/\n}\n\nCustomer::~Customer()\n{\n\/*$TET$Customer$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Customer$!usercode!*\/\n\/*$TET$*\/\n\nbool Customer::prepare()\n{\n\/*$TET$Customer$prepare*\/\n\t\tcout << \"\\tA Customer prepares an Order.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::send(\/*out*\/Customer_Order_handling::order*p1)\n{\n\/*$TET$Customer$send*\/\n\t\tcout << \"\\tHe\/she sends the order to Order Handling.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::receive(\/*in*\/Customer_Order_handling::order_conformation*p1)\n{\n\/*$TET$Customer$receive*\/\n\t\tcout << \"\\tThe Customer receives the order confirmation.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Customer::recieves_and_checks(\/*in*\/Shipment_Customer::product_delivery*p1)\n{\n\/*$TET$Customer$recieves_and_checks*\/\n\t\tcout << \"\\tThe Customer receives the product delivery and checks the delivery.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Customer::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Customer$!run!*\/\n\t\tcout << \"Customer:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Order_handling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOrder_handling::Order_handling(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Order_handling$!constructor!*\/\n\/*$TET$*\/\n}\n\nOrder_handling::~Order_handling()\n{\n\/*$TET$Order_handling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Order_handling$!usercode!*\/\n\/*$TET$*\/\n\nbool Order_handling::check(\/*in*\/Customer_Order_handling::order*p1,\/*out*\/Customer_Order_handling::order_conformation*p2)\n{\n\/*$TET$Order_handling$check*\/\n\t\tcout << \"\\tOrder Handling checks the order. It sends an order confirmation to the Customer.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Order_handling::send(\/*out*\/Order_handling_Shipment::delivery_request*p1)\n{\n\/*$TET$Order_handling$send*\/\n\t\tcout << \"\\tOrder Handling sends a delivery request to Shipment.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Order_handling::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Order_handling$!run!*\/\n\t\tcout << \"Order handling:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class Shipment\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nShipment::Shipment(TEMPLET_DBG::Assemble*a):TEMPLET_DBG::Process(a)\n{\n\/*$TET$Shipment$!constructor!*\/\n\/*$TET$*\/\n}\n\nShipment::~Shipment()\n{\n\/*$TET$Shipment$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$Shipment$!usercode!*\/\n\/*$TET$*\/\n\nbool Shipment::receive(\/*in*\/Order_handling_Shipment::delivery_request*p1)\n{\n\/*$TET$Shipment$receive*\/\n\t\tcout << \"\\tShipment receives the request\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nbool Shipment::deliver(\/*out*\/Shipment_Customer::product_delivery*p1)\n{\n\/*$TET$Shipment$deliver*\/\n\t\tcout << \"\\t and sends the product delivery to the Customer.\" << endl;\n\t\treturn true;\n\/*$TET$*\/\n}\n\nvoid Shipment::_run(int _selector,TEMPLET_DBG::Channel*_channel)\n{\n\tbool res;\n\/*$TET$Shipment$!run!*\/\n\t\tcout << \"Shipment:\" << endl;\n\/*$TET$*\/\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/class odrhandling\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nodrhandling::odrhandling(int NT): TEMPLET_DBG::Assemble(NT)\n{\n\/*$TET$odrhandling$!constructor!*\/\n\/*$TET$*\/\n}\n\nodrhandling::~odrhandling()\n{\n\/*$TET$odrhandling$!destructor!*\/\n\/*$TET$*\/\n}\n\n\/*$TET$odrhandling$!cpp-epilogue!*\/\nint main()\n{\n\todrhandling runtime(1);\n\n\tCustomer* customer = runtime.new_Customer();\n\tOrder_handling* order_handling = runtime.new_Order_handling();\n\tShipment* shipment = runtime.new_Shipment();\n\n\torder_handling->p_customer(customer->p_order_handling());\n\tshipment->p_order_handling(order_handling->p_shipment());\n\tcustomer->p_shipment(shipment->p_customer());\n\n\n\tcout << \"--Customer Order procedure--\" << endl;\n\tsrand(time(NULL));\/\/ to show different system behaviors (because of different times of message processing)\n\truntime.run();\n\n\treturn 0;\n}\n\/*$TET$*\/\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nstatic void CaricaBmp(const char *Nome, unsigned char *header, unsigned int &dim_head_bmp, unsigned char * &image, unsigned int & sx, unsigned int & sy)\n{\n\tFILE *fHan = fopen(Nome, \"rb\"); \/\/Apertura del file in lettura\n\tif(fHan == NULL) {\n\t\tprintf(\"errore!\\n\");\n\t\texit(1);\n\t}\n fseek(fHan,14,0); \/\/Salta Header BMP\n fread(&dim_head_bmp,sizeof(int), 1, fHan); \/\/Lettura dimensione header\n fread(&sx,sizeof(int), 1, fHan); \/\/ lettura 18-esimo byte che contiene la larghezza [4byte]\n fread(&sy,sizeof(int), 1, fHan); \/\/ lettura 22-esimo byte che contiene l' altezza [4byte]\n dim_head_bmp += 14; \/\/Somma alla dimensione dell'header dell' immagine quella del formato\n rewind(fHan); \/\/ Resetta il puntatore al file\n\tfread(header, dim_head_bmp, 1, fHan); \/\/ Caricamento da file dell'header\n\timage = new unsigned char [sx*sy*3]; \/\/Creazione spazio nello heap per l' Immagine Sorgente\n\tfread(image, (sx * sy)*3, 1, fHan); \/\/Caricamento dei dati dell'Immagine Sorgente da file\n\tfclose(fHan); \/\/Chiusura del file\n}\n\nstatic void SalvaBmp(const char *Nome, unsigned char * header, const unsigned int dim_head_bmp, unsigned char *DaDove, int x, int y)\n{\n\tFILE *fHan = fopen(Nome, \"wb\"); \/\/Apertura del file in scrittura\n\tif(fHan == NULL) {\n\t\tprintf(\"errore!\\n\");\n\t\texit(1);\n\t}\n\n memcpy(header+18, &x, sizeof(unsigned int)); \/\/modifica larghezza\n memcpy(header+22, &y, sizeof(unsigned int)); \/\/modifica altezza\n fwrite(header, dim_head_bmp, 1, fHan); \/\/Scrittura del nuovo header\n\tfwrite(DaDove, (x * y)*3, 1, fHan); \/\/ Trasferimento dell' Immagine Destinazione su file\n\tfclose(fHan); \/\/ Chiusura del file\n}\n\nfloat Bilineare(unsigned char * source, unsigned int sx, unsigned int sy, float x, float y, int n_canali) {\n\n\tfloat v1, v2, v3, v4;\n\tint X = (int) x;\n\tint Y = (int) y;\n\n\tx -= X;\n\ty -= Y;\n\n\tif(X < 0) X = 0;\n\tif(X >= ((sx) - 1)) X = (sx) - 1;\n\tif(Y < 0) Y = 0;\n\tif(Y >= sy - 1) Y = sy - 1;\n\n \/\/Ogni coordinata viene moltiplicate per il numero di canali presenti\n v1 = source[X*n_canali + (sx * Y*n_canali) ];\n\tv2 = source[(X+1)*n_canali + (sx * Y*n_canali)];\n\tv3 = source[(X)*n_canali + (sx * ((Y+1)*n_canali))];\n\tv4 = source[(X+1)*n_canali + (sx * ((Y+1)*n_canali))];\n\n\treturn( ( v1 * (1 - x) * (1 - y)) +\n\t\t\t( v2 * x * (1 - y)) +\n\t\t\t( v3 * (1 - x) * y) +\n\t\t\t( v4 * x * y) );\n\n}\n\nvoid Ridimensiona(unsigned char * source, unsigned int sx, unsigned int sy, unsigned char * dest, unsigned int dx, unsigned int dy){\n\n float scalex = ((float)sx) \/ ((float)dx); \/\/Fattore di scala per la larghezza\n float scaley = ((float)sy) \/ ((float)dy); \/\/Fattore di scale per l'altezza\n float u, v; \/\/Coordinate da leggere in riferimento all'immagine sorgente\n\n printf(\"Fattore di Scala per X: %f\\nFattore di Scala per Y: %f\\n\",scalex,scaley);\n\n\/* Lettura Immagine\n B G R\n 0 1 2\n 0 | FF AF AA\n 1 | FF FF FF\n 2 | AA FF AA\n ..| .. .. ..\n dx*dy | FF FF FF\n\n*\/\n for(int c=0; c<3; c++){ \/\/ Canali\n for(int y = 0;y < dy;y++){ \/\/Altezza\n for(int x = 0;x < dx;x++) { \/\/ Larghezza\n u = x * scalex; \/\/Fattore di scala per coordinata X\n v = y * scaley; \/\/Fattore di scala per coordinata Y\n float int_canale = Bilineare((source+c),sx,sy,u,v,3); \/\/Ricampionamento con\n \/\/interpolazione bilineare\n if ( int_canale > 255 ) int_canale = 255; \/\/Clamping se maggiore di 255\n if ( int_canale < 0 ) int_canale = 0; \/\/Clamping se minore di 0\n dest[c + x*3 +y*dx*3 ] = int_canale; \/\/Scrittura del valore di intensità del canale\n \/\/sull'immagine di destinazione\n }\n }\n }\n}\n\n\/\/ kernel\n\n#define KD\t3\n#define OFS\t((KD - 1) \/ 2)\n\nint Kernel[KD * KD] = {\n\t 0,\t0, 0,\n\t-1,\t1, 0,\n\t 0,\t0, 0\n};\n\n\/*\nint Kernel[KD * KD] = {\n\t 0, 0, 0, 0, 0,\n 0, 0,-1, 0, 0,\n 0,-1, 5,-1, 0,\n 0, 0,-1, 0, 0,\n 0, 0, 0, 0, 0\n};*\/\n\n\/*\nint Kernel[KD * KD] = {\n\t0,\t0,\t1,\t0,\t0,\n\t0,\t1,\t2,\t1,\t0,\n\t1,\t2,\t3,\t2,\t1,\n\t0,\t1,\t2,\t1,\t0,\n\t0,\t0,\t1,\t0,\t0\n};\n*\/\n\nint Scala = 1;\n\nint Pixel(unsigned char *source,unsigned int sx, unsigned int sy, int x, int y){\n\tint u, v;\n\tint a;\n\tint p = 0;\n\n\tfor(v = -OFS;v <= OFS;v++) {\n\t\tif((y + v) < 0 || (y + v) >= sy) continue;\n\t\tfor(u = -OFS;u <= OFS;u++) {\n\t\t\tif((x + u)*3 < 0 || (x + u)*3 >= sx*3) continue;\n\n\t\t\ta = source[(x + u)*3 + ((y + v) * sx*3)];\n\t\t\tp += (a * Kernel[u + OFS + ((v + OFS) * KD)]);\n\t\t}\n\t}\n\n\tp \/= Scala;\n\n\tif(p < 0) p = 0;\n\tif(p > 255) p = 255;\n\n\treturn(p);\n}\n\nvoid Convoluzione(unsigned char * source, unsigned int sx, unsigned int sy, unsigned char * dest ) {\n\n\tint x, y, c;\n\n for(c=0;c<3;c++){\n for(y = 0;y < sy;y++) {\n for(x = 0;x < sx;x++) {\n dest[c + x*3 + y*sx*3] = Pixel(source+c, sx, sy, x, y);\n }\n }\n }\n\n}\n\nint main(int argc, char *argv[])\n{\n\tunsigned char header[54]; \/\/ Header\n\tunsigned int dim_head_bmp=0; \/\/Dimensione Header\n\tunsigned int sx=0; \/\/Larghezza Immagine Sorgente\n\tunsigned int sy=0; \/\/Altezza Immagine Sorgente\n unsigned int dx = 300; \/*atoi(argv[3]);*\/ \/\/Larghezza Immagine Destinazione\n unsigned int dy = 394; \/*atoi(argv[4]);*\/ \/\/Altezza Immagine Destinazione\n unsigned char *ImmagineS = NULL; \/\/Puntatore a Immagine Sorgente\n unsigned char *ImmagineD = new unsigned char[dx*dy*3]; \/\/Creazione spazio per Immagine di Destinazione\n\n\tCaricaBmp(\"acdc_red_ltoh.bmp\", header, dim_head_bmp, ImmagineS, sx, sy); \/\/Caricamento Immagine sorgente\n\n printf(\"Dimensione immagine: L %d x H %d\\n\", sx, sy);\n\n unsigned char *ImmagineF = new unsigned char [sx*sy*3];\n\n\tConvoluzione(ImmagineS, sx, sy, ImmagineF);\n\n\tRidimensiona(ImmagineF, sx, sy, ImmagineD, dx, dy); \/\/Ridimensionamento Immagine\n\n\tSalvaBmp(\"output.bmp\", header, dim_head_bmp, ImmagineD, dx, dy); \/\/Serializzazione Immagine\n\n\t\/\/Deallocazione memoria\n\tdelete[] ImmagineS;\n\tdelete[] ImmagineD;\n\tdelete[] ImmagineF;\n\treturn 0;\n\n}\n\n<commit_msg>Aggiunta gestione parametri, selezione filtro, gestione padding<commit_after>\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n\nstatic void CaricaBmp(const char *Nome, unsigned char *header, unsigned int &dim_head_bmp, unsigned char * &image, unsigned int & sx, unsigned int & sy)\n{\n\tFILE *fHan = fopen(Nome, \"rb\"); \/\/Apertura del file in lettura\n\tif(fHan == NULL) {\n\t\tprintf(\"errore!\\n\");\n\t\texit(1);\n\t}\n fseek(fHan,14,0); \/\/Salta Header BMP\n fread(&dim_head_bmp,sizeof(int), 1, fHan); \/\/Lettura dimensione header\n fread(&sx,sizeof(int), 1, fHan); \/\/ lettura 18-esimo byte che contiene la larghezza [4byte]\n fread(&sy,sizeof(int), 1, fHan); \/\/ lettura 22-esimo byte che contiene l' altezza [4byte]\n dim_head_bmp += 14; \/\/Somma alla dimensione dell'header dell' immagine quella del formato\n rewind(fHan); \/\/ Resetta il puntatore al file\n\tfread(header, dim_head_bmp, 1, fHan); \/\/ Caricamento da file dell'header\n\tint dim = sx*sy*3;\n\tif((sx*3)%4 != 0){\n dim += ((4 - (sx*3)%4) * sy);\n\t}\n\timage = new unsigned char [dim]; \/\/Creazione spazio nello heap per l' Immagine Sorgente\n\tfread(image, dim, 1, fHan); \/\/Caricamento dei dati dell'Immagine Sorgente da file\n\tfclose(fHan); \/\/Chiusura del file\n}\n\nstatic void SalvaBmp(const char *Nome, unsigned char * header, const unsigned int dim_head_bmp, unsigned char *DaDove, int x, int y)\n{\n\tFILE *fHan = fopen(Nome, \"wb\"); \/\/Apertura del file in scrittura\n\tif(fHan == NULL) {\n\t\tprintf(\"errore!\\n\");\n\t\texit(1);\n\t}\n\n memcpy(header+18, &x, sizeof(unsigned int)); \/\/modifica larghezza\n memcpy(header+22, &y, sizeof(unsigned int)); \/\/modifica altezza\n fwrite(header, dim_head_bmp, 1, fHan); \/\/Scrittura del nuovo header\n int dim = x*y*3;\n\tif((x*3)%4 != 0){\n dim += ((4 - (x*3)%4) * y);\n\t}\n\tfwrite(DaDove, dim, 1, fHan); \/\/ Trasferimento dell' Immagine Destinazione su file\n\tfclose(fHan); \/\/ Chiusura del file\n}\n\nvoid RimuoviPadding(unsigned char * source, int width, int height, int padding, unsigned char * dest){\n int offset = 0;\n for(int y=0; y<height; y++ ){\n for(int x=0; x<width*3; x++ ){\n dest[x + y*width*3] = source[x+offset + y*width*3];\n }\n offset += padding;\n }\n}\n\nvoid AggiungiPadding(unsigned char * source, int width, int height, int padding, unsigned char * dest){\n int offset = 0;\n for(int y=0; y<height; y++ ){\n for(int x=0; x<width*3; x++ ){\n dest[x+offset+ y*width*3] = source[x + y*width*3];\n }\n if(y>0){\n for(int p=0; p<padding; p++){\n dest[p + offset + y*width*3] = 0;\n }\n }\n offset += padding;\n }\n}\n\nfloat Bilineare(unsigned char * source, unsigned int sx, unsigned int sy, float x, float y, int n_canali) {\n\n\tfloat v1, v2, v3, v4;\n\tint X = (int) x;\n\tint Y = (int) y;\n\n\tx -= X;\n\ty -= Y;\n\n\tif(X < 0) X = 0;\n\tif(X >= ((sx) - 1)) X = (sx) - 1;\n\tif(Y < 0) Y = 0;\n\tif(Y >= sy - 1) Y = sy - 1;\n\n \/\/Ogni coordinata viene moltiplicate per il numero di canali presenti\n v1 = source[X*n_canali + (sx * Y*n_canali) ];\n\tv2 = source[(X+1)*n_canali + (sx * Y*n_canali)];\n\tv3 = source[(X)*n_canali + (sx * ((Y+1)*n_canali))];\n\tv4 = source[(X+1)*n_canali + (sx * ((Y+1)*n_canali))];\n\n\treturn( ( v1 * (1 - x) * (1 - y)) +\n\t\t\t( v2 * x * (1 - y)) +\n\t\t\t( v3 * (1 - x) * y) +\n\t\t\t( v4 * x * y) );\n\n}\n\nvoid Ridimensiona(unsigned char * source, unsigned int sx, unsigned int sy, unsigned char * dest, unsigned int dx, unsigned int dy){\n\n float scalex = ((float)sx) \/ ((float)dx); \/\/Fattore di scala per la larghezza\n float scaley = ((float)sy) \/ ((float)dy); \/\/Fattore di scale per l'altezza\n float u, v; \/\/Coordinate da leggere in riferimento all'immagine sorgente\n\n printf(\"Fattore di Scala per X: %f\\nFattore di Scala per Y: %f\\n\",scalex,scaley);\n\n\/* Lettura Immagine\n B G R\n 0 1 2\n 0 | FF AF AA\n 1 | FF FF FF\n 2 | AA FF AA\n ..| .. .. ..\n dx*dy | FF FF FF\n\n*\/\n for(int c=0; c<3; c++){ \/\/ Canali\n printf(\"C: %d\\n\",c);\n for(int y = 0;y < dy;y++){ \/\/Altezza\n for(int x = 0;x < dx;x++) { \/\/ Larghezza\n u = x * scalex; \/\/Fattore di scala per coordinata X\n v = y * scaley; \/\/Fattore di scala per coordinata Y\n float int_canale = Bilineare((source+c),sx,sy,u,v,3); \/\/Ricampionamento con\n \/\/interpolazione bilineare\n if ( int_canale > 255 ) int_canale = 255; \/\/Clamping se maggiore di 255\n if ( int_canale < 0 ) int_canale = 0; \/\/Clamping se minore di 0\n dest[c + x*3 +y*dx*3 ] = int_canale; \/\/Scrittura del valore di intensità del canale\n \/\/sull'immagine di destinazione\n }\n }\n }\n}\n\n\/\/ kernel\n\n#define OFS ((KD - 1) \/ 2)\n\nint *Kernel;\nint KD;\nchar* Filtri[4] = {\"sharpen\", \"blur\", \"bordi\", \"bassorilievo\"};\n\nint Sharpen[5 * 5] = {\n\t 0, 0, 0, 0, 0,\n 0, 0,-1, 0, 0,\n 0,-1, 5,-1, 0,\n 0, 0,-1, 0, 0,\n 0, 0, 0, 0, 0\n};\n\nint Blur[5 * 5] = {\n\t 0, 0, 0, 0, 0,\n 0, 1, 1, 1, 0,\n 0, 1, 1, 1, 0,\n 0, 1, 1, 1, 0,\n 0, 0, 0, 0, 0\n};\n\nint Bordi[3 * 3] = {\n 0, 1, 0,\n 1,-4, 1,\n 0, 1, 0\n};\n\nint BassoRilievo[3 * 3] = {\n -2,-1, 0,\n -1, 1, 1,\n 0, 1, 2\n};\n\n\n\/*\nint Kernel[KD * KD] = {\n\t0,\t0,\t1,\t0,\t0,\n\t0,\t1,\t2,\t1,\t0,\n\t1,\t2,\t3,\t2,\t1,\n\t0,\t1,\t2,\t1,\t0,\n\t0,\t0,\t1,\t0,\t0\n};\n*\/\n\nint Scala = 1;\n\nint Pixel(unsigned char *source,unsigned int sx, unsigned int sy, int x, int y){\n\n\tint u, v;\n\tint a;\n\tint p = 0;\n\n\tfor(v = -OFS;v <= OFS;v++) {\n\t\tif((y + v) < 0 || (y + v) >= sy) continue;\n\t\tfor(u = -OFS;u <= OFS;u++) {\n\t\t\tif((x + u)*3 < 0 || (x + u)*3 >= sx*3) continue;\n\n\t\t\ta = source[(x + u)*3 + ((y + v) * sx*3)];\n\t\t\tp += (a * Kernel[u + OFS + ((v + OFS) * KD)]);\n\t\t}\n\t}\n\n\tp \/= Scala;\n\n\tif(p < 0) p = 0;\n\tif(p > 255) p = 255;\n\n\treturn(p);\n}\n\nvoid Convoluzione(unsigned char * source, unsigned int sx, unsigned int sy, unsigned char * dest ) {\n\n\tint x, y, c;\n\n for(c=0;c<3;c++){\n for(y = 0;y < sy;y++) {\n for(x = 0;x < sx;x++) {\n dest[c + x*3 + y*sx*3] = Pixel(source+c, sx, sy, x, y);\n }\n }\n }\n\n}\n\nstatic void SelezioneFiltro(char * selezione){\n\n if(strcmp(selezione,Filtri[0]) == 0){\n KD = 5;\n Kernel = Sharpen;\n }else if(strcmp(selezione,Filtri[1]) == 0){\n KD = 5;\n Kernel = Blur;\n }else if(strcmp(selezione,Filtri[2]) == 0){\n KD = 3;\n Kernel = Bordi;\n }else if(strcmp(selezione,Filtri[3]) == 0){\n KD = 3;\n Kernel = BassoRilievo;\n }else{\n printf(\"Filtro non disponibile\");\n exit(1);\n }\n\n}\n\nvoid ControlloDimensioni(const char *in_dx, unsigned int &out_dx, const char *in_dy, unsigned int &out_dy){\n\n if(atoi(in_dx) > 0){\n out_dx = atoi(in_dx);\n }else{\n printf(\"Larghezza non valida\\n\");\n exit(1);\n }\n if(atoi(in_dy) > 0){\n out_dy = atoi(in_dy);\n }else{\n printf(\"Altezza non valida\\n\");\n exit(1);\n }\n\n}\n\nint main(int argc, char *argv[])\n{\n\tunsigned char header[54]; \/\/ Header\n\tunsigned int dim_head_bmp=0; \/\/Dimensione Header\n unsigned int paddingS = 0;\n unsigned int paddingD = 0;\n\tunsigned int sx=0; \/\/Larghezza Immagine Sorgente\n\tunsigned int sy=0; \/\/Altezza Immagine Sorgente\n unsigned int dx=0; \/\/Larghezza Immagine Destinazione\n unsigned int dy=0; \/\/Altezza Immagine Destinazione\n\n ControlloDimensioni(argv[3], dx, argv[4], dy);\n\n unsigned char *ImmagineS = NULL; \/\/Puntatore a Immagine Sorgente\n unsigned char *ImmagineD = new unsigned char[dx*dy*3]; \/\/Creazione spazio per Immagine di Destinazione\n\n\tCaricaBmp(argv[1], header, dim_head_bmp, ImmagineS, sx, sy); \/\/Caricamento Immagine sorgente\n\n printf(\"Dimensione immagine: L %d x H %d\\n\", sx, sy);\n\n unsigned char *ImmagineF = new unsigned char [sx*sy*3];\n\n SelezioneFiltro(argv[2]);\n\n unsigned char *ImmagineSNP;\n if((sx*3)%4 != 0){\n paddingS = 4 - (sx*3)%4;\n ImmagineSNP = new unsigned char [sx*sy*3];\n RimuoviPadding(ImmagineS, sx, sy, paddingS, ImmagineSNP);\n printf(\"Padding Rimosso\\n\");\n printf(\"PaddingS: %d\\n\",paddingS);\n Convoluzione(ImmagineSNP, sx, sy, ImmagineF);\n }else{\n Convoluzione(ImmagineS, sx, sy, ImmagineF);\n }\n\n unsigned char *ImmagineDP;\n\tif((dx*3)%4 != 0){\n paddingD = 4 - ((dx*3)%4);\n printf(\"PaddingD: %d\\n\", paddingD);\n ImmagineDP = new unsigned char [(dx*dy*3) + (paddingD*dy)];\n\t}\n\n if( (sx != dx) || (sy != dy) ){\n Ridimensiona(ImmagineF, sx, sy, ImmagineD, dx, dy); \/\/Ridimensionamento Immagine\n printf(\"Ridimensionato\\n\");\n if(paddingD != 0){\n AggiungiPadding(ImmagineD, dx, dy, paddingD, ImmagineDP);\n printf(\"Aggiunto Padding \\n\");\n SalvaBmp( argv[5], header, dim_head_bmp, ImmagineDP, dx, dy); \/\/Serializzazione Immagine\n }else{\n SalvaBmp( argv[5], header, dim_head_bmp, ImmagineD, dx, dy); \/\/Serializzazione Immagine\n }\n }else if( (sx == dx) && (sy == dy) ){\n if(paddingD != 0){\n AggiungiPadding(ImmagineF, dx, dy, paddingD, ImmagineDP);\n printf(\"Aggiunto Padding\\n\");\n SalvaBmp( argv[5], header, dim_head_bmp, ImmagineDP, dx, dy); \/\/Serializzazione Immagine\n }else{\n SalvaBmp( argv[5], header, dim_head_bmp, ImmagineF, dx, dy); \/\/Serializzazione Immagine\n }\n }\n\n\t\/\/Deallocazione memoria\n\tdelete[] ImmagineS;\n\tdelete[] ImmagineD;\n\tdelete[] ImmagineF;\n\tif (ImmagineSNP){\n delete[] ImmagineSNP;\n\t}\n\tif (ImmagineDP){\n delete[] ImmagineDP;\n\t}\n\treturn 0;\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/collections\/detail\/trie_ordered_multimap_impl.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace collections { namespace detail {\n\nvoid scalar_keyed_trie_ordered_multimap_impl::list_node::unlink_and_destruct(\n type_void_adapter const & type\n) const {\n if (m_plnNext) {\n m_plnNext->m_plnPrev = m_plnPrev;\n }\n if (m_plnPrev) {\n m_plnPrev->m_plnNext = m_plnNext;\n }\n type.destruct(value_ptr(type));\n memory::_raw_free(this);\n}\n\nvoid * scalar_keyed_trie_ordered_multimap_impl::list_node::value_ptr(\n type_void_adapter const & type\n) const {\n return type.align_pointer(&m_plnPrev + 1);\n}\n\n\nscalar_keyed_trie_ordered_multimap_impl::scalar_keyed_trie_ordered_multimap_impl(\n scalar_keyed_trie_ordered_multimap_impl && tommi\n) :\n m_pnRoot(tommi.m_pnRoot),\n m_cValues(tommi.m_cValues),\n mc_iTreeAnchorsLevel(tommi.mc_iTreeAnchorsLevel) {\n tommi.m_pnRoot = nullptr;\n tommi.m_cValues = 0;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::list_node * scalar_keyed_trie_ordered_multimap_impl::add(\n type_void_adapter const & typeValue, std::uintmax_t iKey, void const * pValue, bool bMove\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, iKey, pValue, bMove);\n\n tree_node * ptnParent;\n unsigned iBitsPermutation;\n\n \/\/ Descend into the tree, creating nodes as necessary until the path for iKey is complete.\n {\n \/\/ ppnChildInParent points to *ptnParent’s parent’s pointer to *ptnParent.\n node ** ppnChildInParent = &m_pnRoot;\n std::uintmax_t iKeyRemaining = iKey;\n std::size_t iLevel = 0;\n do {\n ptnParent = static_cast<tree_node *>(*ppnChildInParent);\n if (!ptnParent) {\n ptnParent = (iLevel == mc_iTreeAnchorsLevel ? new anchor_node() : new tree_node());\n *ppnChildInParent = ptnParent;\n }\n iBitsPermutation = static_cast<unsigned>(\n iKeyRemaining & (smc_cBitPermutationsPerLevel - 1)\n );\n iKeyRemaining >>= smc_cBitsPerLevel;\n ppnChildInParent = &ptnParent->m_apnChildren[iBitsPermutation];\n } while (++iLevel <= mc_iTreeAnchorsLevel);\n }\n\n \/\/ We got here, so *ptnParent is actually an anchor_node.\n anchor_node * panParent = static_cast<anchor_node *>(ptnParent);\n \/* To calculate the node size, add typeValue.size() bytes to the offset of the value in a node at\n address 0. This allows packing the node optimally even if the unpadded node size is e.g. 6\n (sizeof will return 8 for that) and typeValue.size() is 2, giving 8 instead of 10 (which would\n really mean at least 12 bytes, a 50% waste of memory). *\/\n std::unique_ptr<list_node, memory::freeing_deleter> pln(static_cast<list_node *>(\n memory::_raw_alloc(reinterpret_cast<std::size_t>(\n static_cast<list_node *>(0)->value_ptr(typeValue)\n ) + typeValue.size())\n ));\n void * pDst = pln->value_ptr(typeValue);\n if (bMove) {\n typeValue.move_construct(pDst, const_cast<void *>(pValue));\n } else {\n typeValue.copy_construct(pDst, pValue);\n }\n list_node * plnRet = pln.get(), * plnPrev = panParent->m_aplnChildrenLasts[iBitsPermutation];\n pln->m_plnPrev = plnPrev;\n pln->m_plnNext = nullptr;\n panParent->m_aplnChildrenLasts[iBitsPermutation] = plnRet;\n if (!panParent->m_apnChildren[iBitsPermutation]) {\n panParent->m_apnChildren[iBitsPermutation] = plnRet;\n }\n if (plnPrev) {\n plnPrev->m_plnNext = plnRet;\n }\n \/\/ Transfer ownership of the list_node to the list.\n pln.release();\n ++m_cValues;\n return plnRet;\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::clear(type_void_adapter const & typeValue) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/);\n\n if (m_pnRoot) {\n destruct_tree_node(typeValue, static_cast<tree_node *>(m_pnRoot), 0);\n m_pnRoot = nullptr;\n m_cValues = 0;\n }\n}\n\nscalar_keyed_trie_ordered_multimap_impl::indexed_anchor\nscalar_keyed_trie_ordered_multimap_impl::descend_to_anchor(std::uintmax_t iKey) const {\n ABC_TRACE_FUNC(this, iKey);\n\n std::uintmax_t iKeyRemaining = iKey;\n tree_node * ptnParent = static_cast<tree_node *>(m_pnRoot);\n std::size_t iLevel = 0;\n for (;;) {\n unsigned iBitsPermutation = static_cast<unsigned>(\n iKeyRemaining & (smc_cBitPermutationsPerLevel - 1)\n );\n if (iLevel == mc_iTreeAnchorsLevel) {\n \/\/ At this level, *ptnParent is an anchor.\n return indexed_anchor(static_cast<anchor_node *>(ptnParent), iBitsPermutation);\n } else if (!ptnParent) {\n return indexed_anchor(nullptr, 0);\n }\n iKeyRemaining >>= smc_cBitsPerLevel;\n ptnParent = static_cast<tree_node *>(ptnParent->m_apnChildren[iBitsPermutation]);\n ++iLevel;\n }\n\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_list(\n type_void_adapter const & type, list_node * pln\n) {\n ABC_TRACE_FUNC(this\/*, type*\/, pln);\n\n while (pln) {\n list_node * plnNext = pln->m_plnNext;\n type.destruct(pln->value_ptr(type));\n memory::_raw_free(pln);\n pln = plnNext;\n }\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_anchor_node(\n type_void_adapter const & typeValue, anchor_node * pan\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, pan);\n\n unsigned iBitsPermutation = 0;\n do {\n if (list_node * pln = static_cast<list_node *>(pan->m_apnChildren[iBitsPermutation])) {\n destruct_list(typeValue, pln);\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n delete pan;\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_tree_node(\n type_void_adapter const & typeValue, tree_node * ptn, unsigned iLevel\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, ptn, iLevel);\n\n ++iLevel;\n unsigned iBitsPermutation = 0;\n do {\n if (node * pn = ptn->m_apnChildren[iBitsPermutation]) {\n if (iLevel == mc_iTreeAnchorsLevel) {\n destruct_anchor_node(typeValue, static_cast<anchor_node *>(pn));\n } else {\n destruct_tree_node(typeValue, static_cast<tree_node *>(pn), iLevel);\n }\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n delete ptn;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::list_node * scalar_keyed_trie_ordered_multimap_impl::find(\n std::uintmax_t iKey\n) {\n ABC_TRACE_FUNC(this, iKey);\n\n indexed_anchor ia(descend_to_anchor(iKey));\n return ia.pan ? static_cast<list_node *>(ia.pan->m_apnChildren[ia.iBitsPermutation]) : nullptr;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::key_value_pair\nscalar_keyed_trie_ordered_multimap_impl::front() {\n ABC_TRACE_FUNC(this);\n\n node * pnChild;\n std::uintmax_t iKey = 0;\n\n \/\/ Descend into the tree.\n tree_node * ptnParent = static_cast<tree_node *>(m_pnRoot);\n std::size_t iLevel = 0;\n unsigned cNextLevelBitsShift = 0;\n do {\n if (!ptnParent) {\n return key_value_pair(0, nullptr);\n }\n \/\/ Look for the left-most branch to descend into.\n unsigned iBitsPermutation = 0;\n do {\n pnChild = ptnParent->m_apnChildren[iBitsPermutation];\n if (pnChild) {\n \/\/ Prepend the selected bit permutation to the key.\n iKey |= static_cast<std::uintmax_t>(iBitsPermutation) << cNextLevelBitsShift;\n cNextLevelBitsShift += smc_cBitsPerLevel;\n break;\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n ptnParent = static_cast<tree_node *>(pnChild);\n } while (++iLevel <= mc_iTreeAnchorsLevel);\n\n \/* We got here, so *pnChild is actually a value list’s first node, though pnChild might be\n nullptr. *\/\n return key_value_pair(iKey, static_cast<list_node *>(pnChild));\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::remove_value(\n type_void_adapter const & typeValue, std::uintmax_t iKey, list_node * pln\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, iKey, pln);\n\n if (!pln->m_plnNext || !pln->m_plnPrev) {\n \/\/ *pln is the first or the last node in its list, so we need to update the anchor.\n indexed_anchor ia(descend_to_anchor(iKey));\n if (!ia.pan) {\n \/\/ TODO: throw invalid_iterator.\n ABC_THROW(generic_error, ());\n }\n if (!pln->m_plnNext) {\n ia.pan->m_aplnChildrenLasts[ia.iBitsPermutation] = nullptr;\n }\n if (!pln->m_plnPrev) {\n ia.pan->m_apnChildren[ia.iBitsPermutation] = nullptr;\n }\n }\n pln->unlink_and_destruct(typeValue);\n --m_cValues;\n}\n\n}}} \/\/namespace abc::collections::detail\n<commit_msg>Fix unlinking list nodes from anchors<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/collections\/detail\/trie_ordered_multimap_impl.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc { namespace collections { namespace detail {\n\nvoid scalar_keyed_trie_ordered_multimap_impl::list_node::unlink_and_destruct(\n type_void_adapter const & type\n) const {\n if (m_plnNext) {\n m_plnNext->m_plnPrev = m_plnPrev;\n }\n if (m_plnPrev) {\n m_plnPrev->m_plnNext = m_plnNext;\n }\n type.destruct(value_ptr(type));\n memory::_raw_free(this);\n}\n\nvoid * scalar_keyed_trie_ordered_multimap_impl::list_node::value_ptr(\n type_void_adapter const & type\n) const {\n return type.align_pointer(&m_plnPrev + 1);\n}\n\n\nscalar_keyed_trie_ordered_multimap_impl::scalar_keyed_trie_ordered_multimap_impl(\n scalar_keyed_trie_ordered_multimap_impl && tommi\n) :\n m_pnRoot(tommi.m_pnRoot),\n m_cValues(tommi.m_cValues),\n mc_iTreeAnchorsLevel(tommi.mc_iTreeAnchorsLevel) {\n tommi.m_pnRoot = nullptr;\n tommi.m_cValues = 0;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::list_node * scalar_keyed_trie_ordered_multimap_impl::add(\n type_void_adapter const & typeValue, std::uintmax_t iKey, void const * pValue, bool bMove\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, iKey, pValue, bMove);\n\n tree_node * ptnParent;\n unsigned iBitsPermutation;\n\n \/\/ Descend into the tree, creating nodes as necessary until the path for iKey is complete.\n {\n \/\/ ppnChildInParent points to *ptnParent’s parent’s pointer to *ptnParent.\n node ** ppnChildInParent = &m_pnRoot;\n std::uintmax_t iKeyRemaining = iKey;\n std::size_t iLevel = 0;\n do {\n ptnParent = static_cast<tree_node *>(*ppnChildInParent);\n if (!ptnParent) {\n ptnParent = (iLevel == mc_iTreeAnchorsLevel ? new anchor_node() : new tree_node());\n *ppnChildInParent = ptnParent;\n }\n iBitsPermutation = static_cast<unsigned>(\n iKeyRemaining & (smc_cBitPermutationsPerLevel - 1)\n );\n iKeyRemaining >>= smc_cBitsPerLevel;\n ppnChildInParent = &ptnParent->m_apnChildren[iBitsPermutation];\n } while (++iLevel <= mc_iTreeAnchorsLevel);\n }\n\n \/\/ We got here, so *ptnParent is actually an anchor_node.\n anchor_node * panParent = static_cast<anchor_node *>(ptnParent);\n \/* To calculate the node size, add typeValue.size() bytes to the offset of the value in a node at\n address 0. This allows packing the node optimally even if the unpadded node size is e.g. 6\n (sizeof will return 8 for that) and typeValue.size() is 2, giving 8 instead of 10 (which would\n really mean at least 12 bytes, a 50% waste of memory). *\/\n std::unique_ptr<list_node, memory::freeing_deleter> pln(static_cast<list_node *>(\n memory::_raw_alloc(reinterpret_cast<std::size_t>(\n static_cast<list_node *>(0)->value_ptr(typeValue)\n ) + typeValue.size())\n ));\n void * pDst = pln->value_ptr(typeValue);\n if (bMove) {\n typeValue.move_construct(pDst, const_cast<void *>(pValue));\n } else {\n typeValue.copy_construct(pDst, pValue);\n }\n list_node * plnRet = pln.get(), * plnPrev = panParent->m_aplnChildrenLasts[iBitsPermutation];\n pln->m_plnPrev = plnPrev;\n pln->m_plnNext = nullptr;\n panParent->m_aplnChildrenLasts[iBitsPermutation] = plnRet;\n if (!panParent->m_apnChildren[iBitsPermutation]) {\n panParent->m_apnChildren[iBitsPermutation] = plnRet;\n }\n if (plnPrev) {\n plnPrev->m_plnNext = plnRet;\n }\n \/\/ Transfer ownership of the list_node to the list.\n pln.release();\n ++m_cValues;\n return plnRet;\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::clear(type_void_adapter const & typeValue) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/);\n\n if (m_pnRoot) {\n destruct_tree_node(typeValue, static_cast<tree_node *>(m_pnRoot), 0);\n m_pnRoot = nullptr;\n m_cValues = 0;\n }\n}\n\nscalar_keyed_trie_ordered_multimap_impl::indexed_anchor\nscalar_keyed_trie_ordered_multimap_impl::descend_to_anchor(std::uintmax_t iKey) const {\n ABC_TRACE_FUNC(this, iKey);\n\n std::uintmax_t iKeyRemaining = iKey;\n tree_node * ptnParent = static_cast<tree_node *>(m_pnRoot);\n std::size_t iLevel = 0;\n for (;;) {\n unsigned iBitsPermutation = static_cast<unsigned>(\n iKeyRemaining & (smc_cBitPermutationsPerLevel - 1)\n );\n if (iLevel == mc_iTreeAnchorsLevel) {\n \/\/ At this level, *ptnParent is an anchor.\n return indexed_anchor(static_cast<anchor_node *>(ptnParent), iBitsPermutation);\n } else if (!ptnParent) {\n return indexed_anchor(nullptr, 0);\n }\n iKeyRemaining >>= smc_cBitsPerLevel;\n ptnParent = static_cast<tree_node *>(ptnParent->m_apnChildren[iBitsPermutation]);\n ++iLevel;\n }\n\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_list(\n type_void_adapter const & type, list_node * pln\n) {\n ABC_TRACE_FUNC(this\/*, type*\/, pln);\n\n while (pln) {\n list_node * plnNext = pln->m_plnNext;\n type.destruct(pln->value_ptr(type));\n memory::_raw_free(pln);\n pln = plnNext;\n }\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_anchor_node(\n type_void_adapter const & typeValue, anchor_node * pan\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, pan);\n\n unsigned iBitsPermutation = 0;\n do {\n if (list_node * pln = static_cast<list_node *>(pan->m_apnChildren[iBitsPermutation])) {\n destruct_list(typeValue, pln);\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n delete pan;\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::destruct_tree_node(\n type_void_adapter const & typeValue, tree_node * ptn, unsigned iLevel\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, ptn, iLevel);\n\n ++iLevel;\n unsigned iBitsPermutation = 0;\n do {\n if (node * pn = ptn->m_apnChildren[iBitsPermutation]) {\n if (iLevel == mc_iTreeAnchorsLevel) {\n destruct_anchor_node(typeValue, static_cast<anchor_node *>(pn));\n } else {\n destruct_tree_node(typeValue, static_cast<tree_node *>(pn), iLevel);\n }\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n delete ptn;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::list_node * scalar_keyed_trie_ordered_multimap_impl::find(\n std::uintmax_t iKey\n) {\n ABC_TRACE_FUNC(this, iKey);\n\n indexed_anchor ia(descend_to_anchor(iKey));\n return ia.pan ? static_cast<list_node *>(ia.pan->m_apnChildren[ia.iBitsPermutation]) : nullptr;\n}\n\nscalar_keyed_trie_ordered_multimap_impl::key_value_pair\nscalar_keyed_trie_ordered_multimap_impl::front() {\n ABC_TRACE_FUNC(this);\n\n node * pnChild;\n std::uintmax_t iKey = 0;\n\n \/\/ Descend into the tree.\n tree_node * ptnParent = static_cast<tree_node *>(m_pnRoot);\n std::size_t iLevel = 0;\n unsigned cNextLevelBitsShift = 0;\n do {\n if (!ptnParent) {\n return key_value_pair(0, nullptr);\n }\n \/\/ Look for the left-most branch to descend into.\n unsigned iBitsPermutation = 0;\n do {\n pnChild = ptnParent->m_apnChildren[iBitsPermutation];\n if (pnChild) {\n \/\/ Prepend the selected bit permutation to the key.\n iKey |= static_cast<std::uintmax_t>(iBitsPermutation) << cNextLevelBitsShift;\n cNextLevelBitsShift += smc_cBitsPerLevel;\n break;\n }\n } while (++iBitsPermutation < smc_cBitPermutationsPerLevel);\n ptnParent = static_cast<tree_node *>(pnChild);\n } while (++iLevel <= mc_iTreeAnchorsLevel);\n\n \/* We got here, so *pnChild is actually a value list’s first node, though pnChild might be\n nullptr. *\/\n return key_value_pair(iKey, static_cast<list_node *>(pnChild));\n}\n\nvoid scalar_keyed_trie_ordered_multimap_impl::remove_value(\n type_void_adapter const & typeValue, std::uintmax_t iKey, list_node * pln\n) {\n ABC_TRACE_FUNC(this\/*, typeValue*\/, iKey, pln);\n\n if (!pln->m_plnNext || !pln->m_plnPrev) {\n \/\/ *pln is the first or the last node in its list, so we need to update the anchor.\n indexed_anchor ia(descend_to_anchor(iKey));\n if (!ia.pan) {\n \/\/ TODO: throw invalid_iterator.\n ABC_THROW(generic_error, ());\n }\n if (!pln->m_plnNext) {\n ia.pan->m_aplnChildrenLasts[ia.iBitsPermutation] = pln->m_plnPrev;\n }\n if (!pln->m_plnPrev) {\n ia.pan->m_apnChildren[ia.iBitsPermutation] = pln->m_plnNext;\n }\n }\n pln->unlink_and_destruct(typeValue);\n --m_cValues;\n}\n\n}}} \/\/namespace abc::collections::detail\n<|endoftext|>"} {"text":"<commit_before>#include \"bloomierHash.h\"\n#include <set>\n#include <bitset>\nBloomierHash::BloomierHash(size_t pModulo,size_t pNumberOfElements, size_t pBitVectorSize, size_t pHashSeed) {\n\tmModulo = pModulo;\n\tmNumberOfElements = pNumberOfElements;\n\t\/\/ mQ = pQ;\n\tmHash = new Hash();\n\tmBitVectorSize = pBitVectorSize;\n\tmHashSeed = pHashSeed + 5;\n \n};\nBloomierHash::~BloomierHash() {\n\n};\nbitVector* BloomierHash::getMask(size_t pKey) {\n\tbitVector* mask = new bitVector(mBitVectorSize);\n char foo;\n\tsrand(mHashSeed*pKey);\n\tsize_t randValue = rand();\/\/ % (255*mBitVectorSize);\n\t\/\/ std::cout << \"randValue: \" << randValue << std::endl;\n\tfor (size_t i = 0; i < mBitVectorSize; ++i) {\n\t\t(*mask)[i] = static_cast<unsigned char>((randValue >> (8*i))& 0b00000000000000000000000011111111);\n \/\/ (*mask)[i] = (*m\n \/\/ foo = static_cast<char>( randValue >> (8*i));\n \/\/ std::bitset<8> peter((*mask)[i]);\n \/\/ std::cout << \"peter: \" << peter << std::endl;\n\t\t\/\/ std::cout << \"randValue2: \" << std::bitset<bits>(*mask)[i]) << std::endl;\n\t\t\/\/ std::cout << \"randValueFoo: \" << static_cast<size_t>((*mask)[i]) << std::endl;\n \/\/ std::cout << \"sizeofMASK: \" << sizeof((*mask)[i]) << std::endl;\n \n \/\/ std::cout << \"sizeofFOO: \" << sizeof(foo) << std::endl;\n \n\t}\n\t\n\treturn mask;\n};\nvsize_t* BloomierHash::getKNeighbors(size_t pElement, size_t pSeed) {\n size_t seedValue = pSeed;\n if (seedValue == 0) {\n seedValue = mHashSeed;\n }\n\tvsize_t* kNeighbors = new vsize_t(mNumberOfElements);\n\tstd::set<size_t>* setOfNeighbors = new std::set<size_t>();\n\t\/\/ srand(pElement);\n size_t seedChange = 1;\n\tfor (size_t i = 0; i < mNumberOfElements; ++i) {\n \/\/ size_t neighbor = mHash->hash_cpp_lib(pElement+1, mHashSeed*seedValue, mModulo);\n\t\tsize_t neighbor = mHash->hash(pElement+1, mHashSeed+seedValue, mModulo);\n size_t size = setOfNeighbors->size();\n setOfNeighbors->insert(neighbor);\n while (size == setOfNeighbors->size()) {\n \/\/ std::cout << \"neighbor: \" << neighbor << std::endl;\n neighbor = mHash->hash(pElement+1, (mHashSeed+seedChange)*(mHashSeed+seedChange), mModulo);\n setOfNeighbors->insert(neighbor);\n \/\/ std::cout << \"neighbor2: \" << neighbor << std::endl;\n \n ++seedChange;\n }\n seedChange = 1;\n\t\t\/\/ std::cout << \"pElement+1: \" << pElement+1 << \" mHashSeed: \" << mHashSeed*mHashSeed << std::endl;\n\t\t\/\/ std::cout << \"neighbors: \" << neighbor << std::endl;\n\t\t(*kNeighbors)[i] = neighbor;\n\t\t++pElement;\n\t\t\n\t}\n\t\/\/ delete setOfNeighbors;\n\treturn kNeighbors;\n};\n\nsize_t BloomierHash::getHashSeed() {\n\treturn mHashSeed;\n};\n\nvoid BloomierHash::setHashSeed(size_t pHashSeed) {\n\tmHashSeed = pHashSeed;\n}<commit_msg>Bug fixing<commit_after>#include \"bloomierHash.h\"\n#include <set>\n#include <bitset>\nBloomierHash::BloomierHash(size_t pModulo,size_t pNumberOfElements, size_t pBitVectorSize, size_t pHashSeed) {\n\tmModulo = pModulo;\n\tmNumberOfElements = pNumberOfElements;\n\t\/\/ mQ = pQ;\n\tmHash = new Hash();\n\tmBitVectorSize = pBitVectorSize;\n\tmHashSeed = pHashSeed;\n \n};\nBloomierHash::~BloomierHash() {\n\n};\nbitVector* BloomierHash::getMask(size_t pKey) {\n\tbitVector* mask = new bitVector(mBitVectorSize);\n char foo;\n\tsrand(mHashSeed*pKey);\n\tsize_t randValue = rand();\/\/ % (255*mBitVectorSize);\n\t\/\/ std::cout << \"randValue: \" << randValue << std::endl;\n\tfor (size_t i = 0; i < mBitVectorSize; ++i) {\n\t\t(*mask)[i] = static_cast<unsigned char>((randValue >> (8*i))& 0b00000000000000000000000011111111);\n \/\/ (*mask)[i] = (*m\n \/\/ foo = static_cast<char>( randValue >> (8*i));\n \/\/ std::bitset<8> peter((*mask)[i]);\n \/\/ std::cout << \"peter: \" << peter << std::endl;\n\t\t\/\/ std::cout << \"randValue2: \" << std::bitset<bits>(*mask)[i]) << std::endl;\n\t\t\/\/ std::cout << \"randValueFoo: \" << static_cast<size_t>((*mask)[i]) << std::endl;\n \/\/ std::cout << \"sizeofMASK: \" << sizeof((*mask)[i]) << std::endl;\n \n \/\/ std::cout << \"sizeofFOO: \" << sizeof(foo) << std::endl;\n \n\t}\n\t\n\treturn mask;\n};\nvsize_t* BloomierHash::getKNeighbors(size_t pElement, size_t pSeed) {\n size_t seedValue = pSeed;\n if (seedValue == 0) {\n seedValue = mHashSeed;\n }\n\tvsize_t* kNeighbors = new vsize_t(mNumberOfElements);\n\tstd::set<size_t>* setOfNeighbors = new std::set<size_t>();\n\t\/\/ srand(pElement);\n size_t seedChange = 1;\n\tfor (size_t i = 0; i < mNumberOfElements; ++i) {\n \/\/ size_t neighbor = mHash->hash_cpp_lib(pElement+1, mHashSeed*seedValue, mModulo);\n\t\tsize_t neighbor = mHash->hash(pElement+1, seedValue+seedChange, mModulo);\n size_t size = setOfNeighbors->size();\n setOfNeighbors->insert(neighbor);\n while (size == setOfNeighbors->size()) {\n \/\/ std::cout << \"neighbor: \" << neighbor << std::endl;\n neighbor = mHash->hash(pElement+1, (seedValue+seedChange)*(seedValue+seedChange), mModulo);\n setOfNeighbors->insert(neighbor);\n \/\/ std::cout << \"neighbor2: \" << neighbor << std::endl;\n \n ++seedChange;\n }\n seedChange = 1;\n\t\t\/\/ std::cout << \"pElement+1: \" << pElement+1 << \" mHashSeed: \" << mHashSeed*mHashSeed << std::endl;\n\t\t\/\/ std::cout << \"neighbors: \" << neighbor << std::endl;\n\t\t(*kNeighbors)[i] = neighbor;\n\t\t++pElement;\n\t\t\n\t}\n\t\/\/ delete setOfNeighbors;\n\treturn kNeighbors;\n};\n\nsize_t BloomierHash::getHashSeed() {\n\treturn mHashSeed;\n};\n\nvoid BloomierHash::setHashSeed(size_t pHashSeed) {\n\tmHashSeed = pHashSeed;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013 Matthew Harvey\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * Generates source code by performing transformations on one or more\n * input files. Directory in which to write generated files is passed\n * as sole command line argument.\n *\/\n\n\/\/ TODO HIGH PRIORITY Use this instead of the Tcl script for generating\n\/\/ \"make_currencies_inc.hpp\". Incorporate compilation of this into the\n\/\/ prebuild step. This is desirable because it removes a dependency on\n\/\/ Tcl.\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n#include <jewel\/assert.hpp>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n\nusing std::cerr;\nusing std::endl;\nusing std::ifstream;\nusing std::ofstream;\nusing std::getline;\nusing std::string;\nusing std::vector;\nnamespace algorithm = boost::algorithm;\nnamespace filesystem = boost::filesystem;\n\nint main(int argc, char** argv)\n{\n\t\/\/ process command line arguments\n\tif (argc != 2)\n\t{\n\t\tcerr << \"Wrong number of command line parameters passed to \"\n\t\t << \"prebuild program.\"\n\t\t\t << endl;\n\t\treturn 1;\n\t}\n\tJEWEL_HARD_ASSERT (argc >= 2);\n\tstring const out_directory = argv[1];\n\n\t\/\/ construct input and output objects\n\tvector<string> row;\n\tifstream infile(\"currencies.csv\");\n\tfilesystem::path const outfile_path =\n\t\tout_directory \/ \"include\" \/ \"make_currencies_inc.hpp\";\n\tofstream outfile(outfile_path.string());\n\t\n\t\/\/ discard first line of input (column headers)\n\tif (!getline(infile, line))\n\t{\n\t\tcerr << \"Error parsing CSV file in prebuild: too few rows.\" << endl;\n\t\treturn 1;\n\t}\n\tJEWEL_HARD_ASSERT(line == \"Currency,Symbol,Precision\");\n\n\t\/\/ generate C++ code on the basis of CSV contents\n\tfor (string line; getline(infile, line); )\n\t{\n\t\talgorithm::split(row, line, [](char c){ return c == ','; });\n\t\tfor (auto& cell: row) algorithm::trim(cell);\n\t\tstring const& name = row.at(0);\n\t\tstring const& abbreviation = row.at(1);\n\t\tstring const& precision = row.at(2);\n\t\toutfile << \"\\t\\tvec.push_back(make_currency(dbc, \"\n\t\t << \"L\\\"\" << name << \"\\\"\"\n\t\t\t\t<< \"\\\"\" << abbreviation << \"\\\"\"\n\t\t\t\t<< precision\n\t\t\t\t<< \"));\";\n\t}\n\treturn 0;\n}\n<commit_msg>Improved error handling in \"prebuild.cpp\".<commit_after>\/*\n * Copyright 2013 Matthew Harvey\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * Generates source code by performing transformations on one or more\n * input files. Directory in which to write generated files is passed\n * as sole command line argument.\n *\/\n\n\/\/ TODO HIGH PRIORITY Use this instead of the Tcl script for generating\n\/\/ \"make_currencies_inc.hpp\". Incorporate compilation of this into the\n\/\/ prebuild step. This is desirable because it removes a dependency on\n\/\/ Tcl.\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/filesystem.hpp>\n#include <jewel\/assert.hpp>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n\nusing std::cerr;\nusing std::endl;\nusing std::ifstream;\nusing std::ofstream;\nusing std::getline;\nusing std::string;\nusing std::vector;\nnamespace algorithm = boost::algorithm;\nnamespace filesystem = boost::filesystem;\n\nint main(int argc, char** argv)\n{\n\t\/\/ process command line arguments\n\tif (argc != 2)\n\t{\n\t\tcerr << \"Wrong number of command line parameters passed to \"\n\t\t << \"prebuild program.\"\n\t\t\t << endl;\n\t\treturn 1;\n\t}\n\tJEWEL_HARD_ASSERT (argc >= 2);\n\tstring const out_directory = argv[1];\n\n\t\/\/ construct input and output objects\n\tvector<string> row;\n\tifstream infile(\"currencies.csv\");\n\tfilesystem::path const outfile_path =\n\t\tout_directory \/ \"include\" \/ \"make_currencies_inc.hpp\";\n\tofstream outfile(outfile_path.string());\n\t\n\t\/\/ discard first line of input (column headers)\n\tif (!getline(infile, line))\n\t{\n\t\tcerr << \"Error parsing CSV file in prebuild: too few rows.\" << endl;\n\t\treturn 1;\n\t}\n\tif (line != \"Currency,Symbol,Precision\")\n\t{\n\t\tcerr << \"Unexpected input from CSV file in prebuild: unexpected \"\n\t\t << \"column headers\"\n\t\t\t << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ generate C++ code on the basis of CSV contents\n\tfor (string line; getline(infile, line); )\n\t{\n\t\talgorithm::split(row, line, [](char c){ return c == ','; });\n\t\tstring::size_type const expected_num_columns = 3;\n\t\tif (line.size() != expected_num_columns)\n\t\t{\n\t\t\tcerr << \"Unexpected input from CSV file in prebuild: unexpected \"\n\t\t\t << \"number of columns in record (\"\n\t\t\t\t << \"expected \" << expected_num_columns\n\t\t\t\t << \" but found\" << line.size() \").\"\n\t\t\t\t << endl;\n\t\t\treturn 1;\n\t\t}\n\t\tfor (auto& cell: row) algorithm::trim(cell);\n\t\tstring const& name = row.at(0);\n\t\tstring const& abbreviation = row.at(1);\n\t\tstring const& precision = row.at(2);\n\t\toutfile << \"\\t\\tvec.push_back(make_currency(dbc, \"\n\t\t << \"L\\\"\" << name << \"\\\"\"\n\t\t\t\t<< \"\\\"\" << abbreviation << \"\\\"\"\n\t\t\t\t<< precision\n\t\t\t\t<< \"));\";\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2015 Virgil Security Inc.\n *\n * Lead Maintainer: Virgil Security Inc. <support@virgilsecurity.com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * (1) Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * (2) Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * (3) Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <fstream>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <tclap\/CmdLine.h>\n\n#include <cli\/ConfigFile.h>\n\n#include <cli\/version.h>\n#include <cli\/pair.h>\n#include <cli\/util.h>\n\nnamespace vsdk = virgil::sdk;\nnamespace vcli = virgil::cli;\n\n#ifdef SPLIT_CLI\n#define MAIN main\n#else\n#define MAIN config_main\n#endif\n\nint MAIN(int argc, char** argv) {\n try {\n std::string description = \"Get information about Virgil CLI configuration file.\\n\\n\";\n\n std::vector<std::string> examples;\n examples.push_back(\"Show path to the configuration file applied for all users:\\n\"\n \"virgil config --global\\n\\n\");\n\n examples.push_back(\"Show path to the configuration file applied for current user:\\n\"\n \"virgil config --local\\n\\n\");\n\n examples.push_back(\"Show configuration file template:\\n\"\n \"virgil config --template\\n\\n\");\n\n std::string descriptionMessage = virgil::cli::getDescriptionMessage(description, examples);\n\n \/\/ Parse arguments.\n TCLAP::CmdLine cmd(descriptionMessage, ' ', virgil::cli_version());\n\n TCLAP::ValueArg<std::string> outArg(\"o\", \"out\", \"If omitted, stdout is used.\\n\", false, \"\", \"file\");\n\n TCLAP::SwitchArg showGlobalConfigFilePathArg(\n \"g\", \"global\", \"Show path to the configuration file applied for all users.\", false);\n\n TCLAP::SwitchArg showLocalConfigFilePathArg(\n \"l\", \"local\", \"Show path to the configuration file applied for current user.\", false);\n\n TCLAP::SwitchArg showTemplateArg(\"t\", \"template\", \"Show configuration file template.\", false);\n\n cmd.add(showTemplateArg);\n cmd.add(showLocalConfigFilePathArg);\n cmd.add(showGlobalConfigFilePathArg);\n cmd.add(outArg);\n cmd.parse(argc, argv);\n\n std::string configFileName =\n#if defined(WIN32)\n \"\\\\virgil-cli.ini\";\n#else\n \"\/virgil-cli.conf\";\n#endif\n\n const bool showAll = !showGlobalConfigFilePathArg.getValue() && !showLocalConfigFilePathArg.getValue() &&\n !showTemplateArg.getValue();\n\n const bool isMultipleInfo = showAll ||\n (showGlobalConfigFilePathArg.getValue() && showLocalConfigFilePathArg.getValue()) ||\n (showGlobalConfigFilePathArg.getValue() && showTemplateArg.getValue()) ||\n (showLocalConfigFilePathArg.getValue() && showTemplateArg.getValue());\n\n std::string data;\n if (showGlobalConfigFilePathArg.getValue() || showAll) {\n std::string pathGlobalConfigFile = get_all_user_config_folder(\"virgil-cli\") + configFileName;\n data += (isMultipleInfo ? \"> Global configuration file path: \" : \"\") + pathGlobalConfigFile + \"\\n\";\n }\n\n if (showLocalConfigFilePathArg.getValue() || showAll) {\n std::string pathLocalConfigFile = get_user_config_folder(\"virgil-cli\") + configFileName;\n data += (isMultipleInfo ? \"> Local configuration file path: \" : \"\") + pathLocalConfigFile + \"\\n\";\n }\n\n if (showTemplateArg.getValue() || showAll) {\n vcli::ConfigFile defaultConfig;\n std::string config = isMultipleInfo ? \"> Configuration file template:\\n\" : \"\";\n config +=\n \"; First, you must create a free Virgil Security developer's account by signing up\\n\"\n \"; here - https:\/\/developer.virgilsecurity.com\/account\/signup. Once you have your\\n\"\n \"; account you can sign in and generate an access token for your application.\\n\"\n \";\\n\"\n \"; The access token provides authenticated secure access to Virgil Keys Services and is passed with\\n\"\n \"; every API call. The access token also allows the API to associate your app’s requests with your\\n\"\n \"; Virgil Security developer's account.\\n\\n\"\n\n \"[Virgil Access Token]\\n\";\n\n config += \"token=<VIRGIL_ACCESS_TOKEN>\\n\\n\";\n\n config += \"; This class provide base URIs for the Virgil Security services\\n\"\n \"[URI]\\n\\n\"\n\n \"; Base URI of the Virgil Identity Service\\n\"\n \"identity-service=\";\n\n config += defaultConfig.serviceUri.getIdentityService() + \"\\n\\n\";\n\n config += \"; base URI of the Virgil Keys Service\\n\"\n \"public-key-service=\";\n\n config += defaultConfig.serviceUri.getPublicKeyService() + \"\\n\\n\";\n\n config += \"; base URI of the Virgil Private Service\\n\"\n \"private-key-service=\";\n\n config += defaultConfig.serviceUri.getPrivateKeyService() + \"\\n\";\n\n data += config;\n }\n\n vcli::writeOutput(outArg.getValue(), data);\n\n } catch (TCLAP::ArgException& exception) {\n std::cerr << \"config. Error: \" << exception.error() << \" for arg \" << exception.argId() << std::endl;\n return EXIT_FAILURE;\n } catch (std::exception& exception) {\n std::cerr << \"config. Error: \" << exception.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<commit_msg>[CLI-84] Add improvement to the virgil config<commit_after>\/**\n * Copyright (C) 2015 Virgil Security Inc.\n *\n * Lead Maintainer: Virgil Security Inc. <support@virgilsecurity.com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * (1) Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * (2) Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * (3) Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <fstream>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <tclap\/CmdLine.h>\n\n#include <cli\/ConfigFile.h>\n\n#include <cli\/version.h>\n#include <cli\/pair.h>\n#include <cli\/util.h>\n\nnamespace vsdk = virgil::sdk;\nnamespace vcli = virgil::cli;\n\n#ifdef SPLIT_CLI\n#define MAIN main\n#else\n#define MAIN config_main\n#endif\n\nstatic std::string configFileName =\n#if defined(WIN32)\n \"\\\\virgil-cli.ini\";\n#else\n \"\/virgil-cli.conf\";\n#endif\n\nstatic std::string getTemplateConfig();\n\nstatic void createGlobalConfigFile(const bool verbose);\n\nstatic void createLocalConfigFile(const bool verbose);\n\nstatic std::string readGlobalConfigFile(const bool verbose);\n\nstatic std::string readLocalConfigFile(const bool verbose);\n\nint MAIN(int argc, char** argv) {\n try {\n std::string description = \"Get information about Virgil CLI configuration file.\\n\\n\";\n\n std::vector<std::string> examples;\n examples.push_back(\"Show path to the configuration file applied for all users:\\n\"\n \"virgil config --global --path\\n\\n\");\n\n examples.push_back(\"Show path to the configuration file applied for current user:\\n\"\n \"virgil config --local --path\\n\\n\");\n\n examples.push_back(\"Show configuration file template:\\n\"\n \"virgil config --template\\n\\n\");\n\n examples.push_back(\"Create a global configuration file from template:\\n\"\n \"virgil config --global --create\\n\\n\");\n\n examples.push_back(\"Create a local configuration file from template:\\n\"\n \"virgil config --local --create\\n\\n\");\n\n examples.push_back(\"Show the global configuration file:\\n\"\n \"virgil config --global --list\\n\\n\");\n\n examples.push_back(\"Show the local configuration file:\\n\"\n \"virgil config --local --list\\n\\n\");\n\n std::string descriptionMessage = virgil::cli::getDescriptionMessage(description, examples);\n\n \/\/ Parse arguments.\n TCLAP::CmdLine cmd(descriptionMessage, ' ', virgil::cli_version());\n\n TCLAP::SwitchArg isGlobalConfigFileArg(\"g\", \"global\", \"The configuration file applied for all users.\", false);\n\n TCLAP::SwitchArg isLocalConfigFileArg(\"l\", \"local\", \"The configuration file applied for current user.\", false);\n\n TCLAP::SwitchArg showTemplateArg(\"t\", \"template\", \"Show configuration file template.\", false);\n\n TCLAP::SwitchArg createConfigFileArg(\"c\", \"create\", \"Create a configuration file from template.\", false);\n\n TCLAP::SwitchArg showConfigFileArg(\"\", \"list\", \"Show the configuration file.\", false);\n\n TCLAP::SwitchArg showPathConfigFileArg(\"p\", \"path\", \"Show path to the configuration file.\", false);\n\n TCLAP::SwitchArg verboseArg(\"V\", \"VERBOSE\", \"Shows detailed information.\", false);\n\n cmd.add(verboseArg);\n cmd.add(showPathConfigFileArg);\n cmd.add(showConfigFileArg);\n cmd.add(createConfigFileArg);\n cmd.add(showTemplateArg);\n cmd.add(isLocalConfigFileArg);\n cmd.add(isGlobalConfigFileArg);\n cmd.parse(argc, argv);\n\n const bool all = isLocalConfigFileArg.getValue() && isGlobalConfigFileArg.getValue();\n\n if (showPathConfigFileArg.getValue()) {\n std::string pathLocalConfigFile = get_user_config_folder(\"virgil-cli\") + configFileName;\n std::string pathGlobalConfigFile = get_all_user_config_folder(\"virgil-cli\") + configFileName;\n\n if (all) {\n std::cout << \"> Local configuration file path: \" << pathLocalConfigFile << \"\\n\";\n std::cout << \"> Global configuration file path: \" << pathGlobalConfigFile << \"\\n\";\n } else if (isLocalConfigFileArg.getValue()) {\n std::cout << pathLocalConfigFile << \"\\n\";\n } else {\n \/\/ isGlobalConfigFileArg\n std::cout << pathGlobalConfigFile << \"\\n\";\n }\n }\n\n if (createConfigFileArg.getValue()) {\n if (all) {\n createLocalConfigFile(verboseArg.getValue());\n createGlobalConfigFile(verboseArg.getValue());\n } else if (isLocalConfigFileArg.getValue()) {\n createLocalConfigFile(verboseArg.getValue());\n } else {\n \/\/ isGlobalConfigFileArg\n createGlobalConfigFile(verboseArg.getValue());\n }\n }\n\n if (showConfigFileArg.getValue()) {\n if (all) {\n std::cout << readLocalConfigFile(verboseArg.getValue());\n std::cout << readGlobalConfigFile(verboseArg.getValue());\n } else if (isLocalConfigFileArg.getValue()) {\n std::cout << readLocalConfigFile(verboseArg.getValue());\n } else {\n \/\/ isGlobalConfigFileArg\n std::cout << readGlobalConfigFile(verboseArg.getValue());\n }\n }\n\n if (showTemplateArg.getValue()) {\n std::cout << getTemplateConfig();\n }\n\n } catch (TCLAP::ArgException& exception) {\n std::cerr << \"config. Error: \" << exception.error() << \" for arg \" << exception.argId() << std::endl;\n return EXIT_FAILURE;\n } catch (std::exception& exception) {\n std::cerr << \"config. Error: \" << exception.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\nstd::string getTemplateConfig() {\n vcli::ConfigFile defaultConfig;\n std::string config;\n config += \"; First, you must create a free Virgil Security developer's account by signing up\\n\"\n \"; here - https:\/\/developer.virgilsecurity.com\/account\/signup. Once you have your\\n\"\n \"; account you can sign in and generate an access token for your application.\\n\"\n \";\\n\"\n \"; The access token provides authenticated secure access to Virgil Keys Services and is passed with\\n\"\n \"; every API call. The access token also allows the API to associate your app’s requests with your\\n\"\n \"; Virgil Security developer's account.\\n\\n\"\n\n \"[Virgil Access Token]\\n\";\n config += \"token=<VIRGIL_ACCESS_TOKEN>\\n\\n\";\n\n config += \"; This class provide base URIs for the Virgil Security services\\n\"\n \"[URI]\\n\\n\"\n\n \"; Base URI of the Virgil Identity Service\\n\"\n \"identity-service=\";\n config += defaultConfig.serviceUri.getIdentityService() + \"\\n\\n\";\n\n config += \"; base URI of the Virgil Keys Service\\n\"\n \"public-key-service=\";\n config += defaultConfig.serviceUri.getPublicKeyService() + \"\\n\\n\";\n\n config += \"; base URI of the Virgil Private Service\\n\"\n \"private-key-service=\";\n config += defaultConfig.serviceUri.getPrivateKeyService() + \"\\n\";\n\n return config;\n}\n\nvoid createGlobalConfigFile(const bool verbose) {\n std::string pathGlobalConfigFile = get_all_user_config_folder(\"virgil-cli\") + configFileName;\n vcli::writeOutput(pathGlobalConfigFile, getTemplateConfig());\n if (verbose) {\n std::cout << \"Create a global configuration file from template by path:\" + pathGlobalConfigFile << \"\\n\";\n }\n}\n\nvoid createLocalConfigFile(const bool verbose) {\n std::string pathLocalConfigFile = get_user_config_folder(\"virgil-cli\") + configFileName;\n vcli::writeOutput(pathLocalConfigFile, getTemplateConfig());\n if (verbose) {\n std::cout << \"Create a local configuration file from template by path:\" + pathLocalConfigFile << \"\\n\";\n }\n}\n\nstd::string readGlobalConfigFile(const bool verbose) {\n std::string pathGlobalConfigFile = get_all_user_config_folder(\"virgil-cli\") + configFileName;\n std::ifstream inGlobalConfigFile(pathGlobalConfigFile, std::ios::in | std::ios::binary);\n if (!inGlobalConfigFile) {\n throw std::invalid_argument(\"Can't read a global configuration file by path:\" + pathGlobalConfigFile);\n }\n if (verbose) {\n std::cout << \"Read a global config file\"\n << \"\\n\";\n }\n return std::string((std::istreambuf_iterator<char>(inGlobalConfigFile)), std::istreambuf_iterator<char>());\n}\n\nstd::string readLocalConfigFile(const bool verbose) {\n std::string pathLocalConfigFile = get_user_config_folder(\"virgil-cli\") + configFileName;\n std::ifstream inLocalConfigFile(pathLocalConfigFile, std::ios::in | std::ios::binary);\n if (!inLocalConfigFile) {\n throw std::invalid_argument(\"Can't read a local configuration file by path:\" + pathLocalConfigFile);\n }\n if (verbose) {\n std::cout << \"Read a local configuration file\"\n << \"\\n\";\n }\n return std::string((std::istreambuf_iterator<char>(inLocalConfigFile)), std::istreambuf_iterator<char>());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"fish_detector\/common\/species_dialog.h\"\n#include \"ui_species_dialog.h\"\n\nnamespace fish_detector {\n\nSpeciesDialog::SpeciesDialog(QWidget *parent)\n : QDialog(parent) \n , ui_(new Ui::SpeciesDialog) {\n ui_->setupUi(this);\n}\n\nvoid SpeciesDialog::on_ok_clicked() {\n}\n\nvoid SpeciesDialog::on_cancel_clicked() {\n}\n\nvoid SpeciesDialog::on_removeSubspecies_clicked() {\n}\n\nvoid SpeciesDialog::on_addSubspecies_clicked() {\n}\n\nSpecies SpeciesDialog::getSpecies() {\n Species species;\n return species;\n}\n\n#include \"..\/..\/include\/fish_detector\/common\/moc_species_dialog.cpp\"\n\n} \/\/ namespace fish_detector\n<commit_msg>Add implementation for adding\/removing subspecies functions<commit_after>#include \"fish_detector\/common\/species_dialog.h\"\n#include \"ui_species_dialog.h\"\n\nnamespace fish_detector {\n\nSpeciesDialog::SpeciesDialog(QWidget *parent)\n : QDialog(parent) \n , ui_(new Ui::SpeciesDialog) {\n ui_->setupUi(this);\n}\n\nvoid SpeciesDialog::on_ok_clicked() {\n accept();\n}\n\nvoid SpeciesDialog::on_cancel_clicked() {\n reject();\n}\n\nvoid SpeciesDialog::on_removeSubspecies_clicked() {\n QListWidgetItem *current = ui_->subspeciesList->currentItem();\n if(current != nullptr) {\n delete current;\n }\n}\n\nvoid SpeciesDialog::on_addSubspecies_clicked() {\n QListWidgetItem *item = new QListWidgetItem(\"New subspecies\");\n item->setFlags(item->flags() | Qt::ItemIsEditable);\n ui_->subspeciesList->addItem(item);\n ui_->subspeciesList->editItem(item);\n}\n\nSpecies SpeciesDialog::getSpecies() {\n Species species;\n return species;\n}\n\n#include \"..\/..\/include\/fish_detector\/common\/moc_species_dialog.cpp\"\n\n} \/\/ namespace fish_detector\n<|endoftext|>"} {"text":"<commit_before>\/* **********************************************************\n * Copyright (c) 2018 Google LLC All rights reserved.\n * **********************************************************\/\n\n\/*\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Google, Inc. nor the names of its contributors may be\n * used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE LLC OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\/\n\n\/* This microbenchmark suffers from a significant number of last-level cache\n * (LLC) misses. SW prefetching can significantly improve its performance.\n *\n * The cache miss analyzer can be used to identify the load instruction that\n * is suffering from most of the LLC misses in this microbenchmark. The analyzer\n * can also produce prefetching hints for this microbenchmark. To run the\n * analyzer on this microbenchmark and write the prefetching hints in a text\n * file called \"rec.csv\", perform the following:\n * * Compile the microbenchmark. Assuming g++ is the compiler being used:\n * $ g++ -O3 -o stride_benchmark stride_benchmark.cpp\n * * Run the the analyzer:\n * $ bin64\/drrun -t drcachesim -simulator_type miss_analyzer -LL_miss_file rec.csv -- \\\n * stride_benchmark\n *\n *\/\n\n#include <stdint.h>\n#include <string.h>\n#include <iostream>\n\n#define MEM_BARRIER() __asm__ __volatile__(\"\" ::: \"memory\")\n\nint\nmain(int argc, const char *argv[])\n{\n \/\/ Cache line size in bytes.\n const int kLineSize = 64;\n \/\/ Number of cache lines skipped by the stream every iteration.\n const int kStride = 7;\n \/\/ Number of 1-byte elements in the array.\n \/\/ (200+ MiB to guarantee the array doesn't fit in Skylake caches)\n const size_t kArraySize = 256 * 1024 * 1024;\n \/\/ Number of iterations in the main loop.\n const int kIterations = 1000000;\n \/\/ The main vector\/array used for emulating pointer chasing.\n unsigned char *buffer = new unsigned char[kArraySize];\n memset(buffer, kStride, kArraySize);\n\n \/\/ Add a memory barrier so the call doesn't get optimized away or\n \/\/ reordered with respect to callers.\n MEM_BARRIER();\n\n int position = 0;\n\n \/\/ Here the code will pointer chase through the array skipping forward\n \/\/ kStride cache lines at a time. Since kStride is an odd number, the main\n \/\/ loop will touch different cache lines as it wraps around.\n for (int loop = 0; loop < kIterations; ++loop) {\n \/\/ This prefetching instruction results in a speedup of >2x\n \/\/ on a Skylake machine running Linux when compiled with g++ -O3.\n \/\/ const int prefetch_distance = 5 * kStride * kLineSize;\n \/\/ __builtin_prefetch(&buffer[position + prefetch_distance], 0, 0);\n\n position += (buffer[position] * kLineSize);\n position &= (kArraySize - 1);\n }\n\n \/\/ Add a memory barrier so the call doesn't get optimized away or\n \/\/ reordered with respect to callers.\n MEM_BARRIER();\n\n std::cerr << \"Value = \" << position << std::endl;\n\n return 0;\n}\n<commit_msg>i#3485: Cut down runtime of tool.drcachesim.miss_analyzer. (#3490)<commit_after>\/* **********************************************************\n * Copyright (c) 2018 Google LLC All rights reserved.\n * **********************************************************\/\n\n\/*\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Google, Inc. nor the names of its contributors may be\n * used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE LLC OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\/\n\n\/* This microbenchmark suffers from a significant number of last-level cache\n * (LLC) misses. SW prefetching can significantly improve its performance.\n *\n * The cache miss analyzer can be used to identify the load instruction that\n * is suffering from most of the LLC misses in this microbenchmark. The analyzer\n * can also produce prefetching hints for this microbenchmark. To run the\n * analyzer on this microbenchmark and write the prefetching hints in a text\n * file called \"rec.csv\", perform the following:\n * * Compile the microbenchmark. Assuming g++ is the compiler being used:\n * $ g++ -O3 -o stride_benchmark stride_benchmark.cpp\n * * Run the the analyzer:\n * $ bin64\/drrun -t drcachesim -simulator_type miss_analyzer -LL_miss_file rec.csv -- \\\n * stride_benchmark\n *\n *\/\n\n#include <stdint.h>\n#include <string.h>\n#include <iostream>\n\n#define MEM_BARRIER() __asm__ __volatile__(\"\" ::: \"memory\")\n\nint\nmain(int argc, const char *argv[])\n{\n \/\/ Cache line size in bytes.\n const int kLineSize = 64;\n \/\/ Number of cache lines skipped by the stream every iteration.\n const int kStride = 7;\n \/\/ Number of 1-byte elements in the array.\n \/\/ (200+ MiB to guarantee the array doesn't fit in Skylake caches)\n const size_t kArraySize = 64 * 1024 * 1024;\n \/\/ Number of iterations in the main loop.\n const int kIterations = 100000;\n \/\/ The main vector\/array used for emulating pointer chasing.\n unsigned char *buffer = new unsigned char[kArraySize];\n memset(buffer, kStride, kArraySize);\n\n \/\/ Add a memory barrier so the call doesn't get optimized away or\n \/\/ reordered with respect to callers.\n MEM_BARRIER();\n\n int position = 0;\n\n \/\/ Here the code will pointer chase through the array skipping forward\n \/\/ kStride cache lines at a time. Since kStride is an odd number, the main\n \/\/ loop will touch different cache lines as it wraps around.\n for (int loop = 0; loop < kIterations; ++loop) {\n \/\/ This prefetching instruction results in a speedup of >2x\n \/\/ on a Skylake machine running Linux when compiled with g++ -O3.\n \/\/ const int prefetch_distance = 5 * kStride * kLineSize;\n \/\/ __builtin_prefetch(&buffer[position + prefetch_distance], 0, 0);\n\n position += (buffer[position] * kLineSize);\n position &= (kArraySize - 1);\n }\n\n \/\/ Add a memory barrier so the call doesn't get optimized away or\n \/\/ reordered with respect to callers.\n MEM_BARRIER();\n\n std::cerr << \"Value = \" << position << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <type_traits>\n\n#include <utility>\n\n#include <new>\n\nnamespace generic\n{\n\ntemplate<typename F>\nclass forwarder;\n\ntemplate<typename R, typename ...A>\nclass forwarder<R (A...)>\n{\npublic:\n forwarder() = default;\n\n template<typename T>\n forwarder(T&& f) noexcept :\n stub_(new (&store_) handler<T>(::std::forward<T>(f)), handler<T>::invoke)\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n }\n\n forwarder& operator=(forwarder const&) = default;\n\n template <\n typename T,\n typename = typename ::std::enable_if<\n !::std::is_same<forwarder, typename ::std::decay<T>::type>{}\n >::type\n >\n forwarder& operator=(T&& f) noexcept\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n\n stub_ = handler<T>::invoke;\n\n return *this;\n }\n\n R operator() (A... args)\n {\n \/\/assert(stub_);\n return stub_(&store_, ::std::forward<A>(args)...);\n }\n\nprivate:\n template<typename T>\n struct handler\n {\n handler(T&& f) noexcept : f_(::std::forward<T>(f))\n {\n }\n\n static R invoke(void* ptr, A&&... args)\n {\n return static_cast<handler<T>*>(ptr)->f_(::std::forward<A>(args)...);\n }\n\n T f_;\n };\n\n#if defined(__clang__)\n using max_align_type = long double;\n#elif defined(__GNUC__)\n using max_align_type = ::max_align_t;\n#else\n using max_align_type = ::std::max_align_t;\n#endif\n\n alignas(max_align_type) ::std::uintptr_t store_;\n\n R (*stub_)(void*, A&&...){};\n};\n\n}\n<commit_msg>smoe fixes<commit_after>#include <cassert>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <type_traits>\n\n#include <utility>\n\n#include <new>\n\nnamespace generic\n{\n\ntemplate<typename F>\nclass forwarder;\n\ntemplate<typename R, typename ...A>\nclass forwarder<R (A...)>\n{\npublic:\n forwarder() = default;\n\n template<typename T>\n forwarder(T&& f) noexcept : stub_(handler<T>::invoke)\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n }\n\n forwarder& operator=(forwarder const&) = default;\n\n template <\n typename T,\n typename = typename ::std::enable_if<\n !::std::is_same<forwarder, typename ::std::decay<T>::type>{}\n >::type\n >\n forwarder& operator=(T&& f) noexcept\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n\n stub_ = handler<T>::invoke;\n\n return *this;\n }\n\n R operator() (A... args)\n {\n \/\/assert(stub_);\n return stub_(&store_, ::std::forward<A>(args)...);\n }\n\nprivate:\n template<typename T>\n struct handler\n {\n handler(T&& f) noexcept : f_(::std::forward<T>(f))\n {\n }\n\n static R invoke(void* ptr, A&&... args)\n {\n return static_cast<handler<T>*>(ptr)->f_(::std::forward<A>(args)...);\n }\n\n T f_;\n };\n\n#if defined(__clang__)\n using max_align_type = long double;\n#elif defined(__GNUC__)\n using max_align_type = ::max_align_t;\n#else\n using max_align_type = ::std::max_align_t;\n#endif\n\n alignas(max_align_type) ::std::uintptr_t store_;\n\n R (*stub_)(void*, A&&...){};\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>class Solution {\n public:\n string convert(string s, int nRows)\n {\n if(nRows == 1) return s;\n string result;\n result.reserve(s.size());\n int index = 0;\n while(index < s.size()){\n result.push_back(s[index]);\n index += (nRows+nRows-2);\n }\n\n for(int i = 1; i != nRows-1; ++i){\n index = i;\n while(index < s.size()){\n result.push_back(s[index]);\n int tmpIndex = index + (2*(nRows-i-1));\n if(tmpIndex < s.size())\n result.push_back(s[tmpIndex]);\n index += (nRows+nRows-2);\n }\n }\n\n index = nRows - 1;\n while(index < s.size()){\n result.push_back(s[index]);\n index += (nRows+nRows-2);\n }\n return result;\n }\n};\n<commit_msg>simplified code, but same idea<commit_after>class Solution {\n public:\n string convert(string s, int nRows)\n {\n if(nRows == 1) return s;\n string result;\n result.reserve(s.size());\n for(int i = 0; i != nRows; ++i){\n int index = i;\n while(index < s.size()){\n result.push_back(s[index]);\n if(i != 0 && i != nRows-1){\n int tmpIndex = index + (2*(nRows-i-1));\n if(tmpIndex < s.size())\n result.push_back(s[tmpIndex]);\n }\n index += (nRows+nRows-2);\n }\n }\n return result;\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2013-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file assert.hpp\n * \\brief Contains C++ assert utilities.\n *\/\n\n#ifndef CPP_UTILS_ASSERT_HPP\n#define CPP_UTILS_ASSERT_HPP\n\n#include <iostream>\n\n#ifdef CPP_UTILS_ASSERT_EXCEPTION\n#include <stdexcept>\n#endif\n\n#include \"likely.hpp\"\n\n#define cpp_unused(x) ((void)(x))\n\n#ifdef NDEBUG\n\n#define cpp_assert(condition, message) ((void)0)\n\n#if defined __clang__\n\n#if __has_builtin(__builtin_unreachable)\n#define cpp_unreachable(message) __builtin_unreachable();\n#else\n#define cpp_unreachable(message) ((void)0)\n#endif \/\/__has_builtin(__builtin_unreachable)\n\n#elif defined __GNUC__\n\n#define cpp_unreachable(message) __builtin_unreachable();\n\n#endif \/\/__clang__\n\n#else\n\n#ifdef CPP_UTILS_ASSERT_EXCEPTION\n\n#define cpp_assert(condition, message) \\\n if (cpp_likely(condition)) \\\n ((void)0); \\\n else \\\n throw std::runtime_error(\"Assertion failed\");\n\n#else\n\n#define cpp_assert(condition, message) (cpp_likely(condition) \\\n ? ((void)0) \\\n : ::cpp::assertion::detail::assertion_failed_msg(#condition, message, \\\n __PRETTY_FUNCTION__, __FILE__, __LINE__))\n\n#endif\n\n#if defined __clang__\n\n#if __has_builtin(__builtin_unreachable)\n#define cpp_unreachable(message) \\\n cpp_assert(false, message); \\\n __builtin_unreachable();\n#else\n#define cpp_unreachable(message) cpp_assert(false, message);\n#endif \/\/__has_builtin(__builtin_unreachable)\n\n#elif defined __GNUC__\n\n#define cpp_unreachable(message) \\\n cpp_assert(false, message); \\\n __builtin_unreachable();\n\n#endif \/\/__clang__\n\n#endif \/\/NDEBUG\n\nnamespace cpp {\nnamespace assertion {\nnamespace detail {\n\n\/*!\n * \\brief Function call when an assertion failed\n *\/\ntemplate <typename CharT>\nvoid assertion_failed_msg(const CharT* expr, const char* msg, const char* function, const char* file, long line) {\n std::cerr\n << \"***** Internal Program Error - assertion (\" << expr << \") failed in \"\n << function << \":\\n\"\n << file << '(' << line << \"): \" << msg << std::endl;\n std::abort();\n}\n\n} \/\/ end of detail namespace\n} \/\/ end of assertion namespace\n} \/\/ end of cpp namespace\n\n#endif \/\/CPP_UTILS_ASSERT_HPP\n<commit_msg>Use size_t in place of long for line<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2013-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file assert.hpp\n * \\brief Contains C++ assert utilities.\n *\/\n\n#ifndef CPP_UTILS_ASSERT_HPP\n#define CPP_UTILS_ASSERT_HPP\n\n#include <iostream>\n\n#ifdef CPP_UTILS_ASSERT_EXCEPTION\n#include <stdexcept>\n#endif\n\n#include \"likely.hpp\"\n\n#define cpp_unused(x) ((void)(x))\n\n#ifdef NDEBUG\n\n#define cpp_assert(condition, message) ((void)0)\n\n#if defined __clang__\n\n#if __has_builtin(__builtin_unreachable)\n#define cpp_unreachable(message) __builtin_unreachable();\n#else\n#define cpp_unreachable(message) ((void)0)\n#endif \/\/__has_builtin(__builtin_unreachable)\n\n#elif defined __GNUC__\n\n#define cpp_unreachable(message) __builtin_unreachable();\n\n#endif \/\/__clang__\n\n#else\n\n#ifdef CPP_UTILS_ASSERT_EXCEPTION\n\n#define cpp_assert(condition, message) \\\n if (cpp_likely(condition)) \\\n ((void)0); \\\n else \\\n throw std::runtime_error(\"Assertion failed\");\n\n#else\n\n#define cpp_assert(condition, message) (cpp_likely(condition) \\\n ? ((void)0) \\\n : ::cpp::assertion::detail::assertion_failed_msg(#condition, message, \\\n __PRETTY_FUNCTION__, __FILE__, __LINE__))\n\n#endif\n\n#if defined __clang__\n\n#if __has_builtin(__builtin_unreachable)\n#define cpp_unreachable(message) \\\n cpp_assert(false, message); \\\n __builtin_unreachable();\n#else\n#define cpp_unreachable(message) cpp_assert(false, message);\n#endif \/\/__has_builtin(__builtin_unreachable)\n\n#elif defined __GNUC__\n\n#define cpp_unreachable(message) \\\n cpp_assert(false, message); \\\n __builtin_unreachable();\n\n#endif \/\/__clang__\n\n#endif \/\/NDEBUG\n\nnamespace cpp {\nnamespace assertion {\nnamespace detail {\n\n\/*!\n * \\brief Function call when an assertion failed\n *\/\ntemplate <typename CharT>\nvoid assertion_failed_msg(const CharT* expr, const char* msg, const char* function, const char* file, size_t line) {\n std::cerr\n << \"***** Internal Program Error - assertion (\" << expr << \") failed in \"\n << function << \":\\n\"\n << file << '(' << line << \"): \" << msg << std::endl;\n std::abort();\n}\n\n} \/\/ end of detail namespace\n} \/\/ end of assertion namespace\n} \/\/ end of cpp namespace\n\n#endif \/\/CPP_UTILS_ASSERT_HPP\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n * Copyright (c) 2012-2017 by the DataTransferKit authors *\n * All rights reserved. *\n * *\n * This file is part of the DataTransferKit library. DataTransferKit is *\n * distributed under a BSD 3-clause license. For the licensing terms see *\n * the LICENSE file in the top-level directory. *\n ****************************************************************************\/\n\n#include <details\/DTK_DetailsDistributedSearchTreeImpl.hpp>\n\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Tpetra_Distributor.hpp>\n\n#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <random>\n#include <tuple>\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl, recv_from,\n DeviceType )\n{\n \/\/ Checking that it is not necessary to send ranks because it can be\n \/\/ inferred from getProcsFrom() and getLengthsFrom().\n Teuchos::RCP<const Teuchos::Comm<int>> comm =\n Teuchos::DefaultComm<int>::getComm();\n int const comm_rank = comm->getRank();\n int const comm_size = comm->getSize();\n\n std::vector<int> tn( comm_size + 1 );\n for ( int i = 0; i < comm_size + 1; ++i )\n tn[i] = i * ( i - 1 ) \/ 2;\n\n \/\/ First use send buffer to set up the communication plan. Sending 0\n \/\/ packet to rank 1, 1 packet to rank 1, 2 packets to rank 2, etc.\n int const n_exports = tn[comm_size];\n std::vector<int> exports( n_exports );\n for ( int i = 0; i < comm_size; ++i )\n for ( int j = tn[i]; j < tn[i + 1]; ++j )\n exports[j] = i;\n\n Tpetra::Distributor distributor( comm );\n int const n_imports = distributor.createFromSends(\n Teuchos::ArrayView<int>( exports.data(), exports.size() ) );\n TEUCHOS_ASSERT_EQUALITY( n_imports, comm_rank * comm_size );\n\n std::vector<int> imports( n_imports );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports.data(), exports.size() ), 1,\n Teuchos::ArrayView<int>( imports.data(), imports.size() ) );\n\n TEST_COMPARE_ARRAYS( imports, std::vector<int>( n_imports, comm_rank ) );\n\n \/\/ Then fill buffer with rank of the process that is sending packets.\n std::fill( exports.begin(), exports.end(), comm_rank );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports.data(), exports.size() ), 1,\n Teuchos::ArrayView<int>( imports.data(), imports.size() ) );\n\n auto procs_from = distributor.getProcsFrom();\n auto lengths_form = distributor.getLengthsFrom();\n TEST_EQUALITY( procs_from.size(), lengths_form.size() );\n std::vector<int> recv_from( n_imports, -1 );\n int count = 0;\n for ( auto i = 0; i < procs_from.size(); ++i )\n for ( auto j = 0; j < lengths_form[i]; ++j )\n recv_from[count++] = procs_from[i];\n TEST_EQUALITY( count, n_imports );\n TEST_COMPARE_ARRAYS( imports, recv_from );\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n sort_results, DeviceType )\n{\n std::vector<int> ids_ = {4, 3, 2, 1, 4, 3, 2, 4, 3, 4};\n std::vector<int> sorted_ids = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};\n std::vector<int> offset = {0, 1, 3, 6, 10};\n int const n = 10;\n int const m = 4;\n TEST_EQUALITY( ids_.size(), n );\n TEST_EQUALITY( sorted_ids.size(), n );\n TEST_EQUALITY( offset.size(), m + 1 );\n std::vector<int> results_ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n std::vector<std::set<int>> sorted_results = {\n {3}, {6, 2}, {8, 5, 1}, {9, 7, 4, 0},\n };\n std::vector<int> ranks_ = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};\n std::vector<std::set<int>> sorted_ranks = {\n {13}, {16, 12}, {18, 15, 11}, {19, 17, 14, 10},\n };\n TEST_EQUALITY( results_.size(), n );\n TEST_EQUALITY( ranks_.size(), n );\n\n Kokkos::View<int *, DeviceType> ids( \"query_ids\", n );\n auto ids_host = Kokkos::create_mirror_view( ids );\n for ( int i = 0; i < n; ++i )\n ids_host( i ) = ids_[i];\n Kokkos::deep_copy( ids, ids_host );\n\n Kokkos::View<int *, DeviceType> results( \"results\", n );\n auto results_host = Kokkos::create_mirror_view( results );\n for ( int i = 0; i < n; ++i )\n results_host( i ) = results_[i];\n Kokkos::deep_copy( results, results_host );\n\n Kokkos::View<int *, DeviceType> ranks( \"ranks\", n );\n auto ranks_host = Kokkos::create_mirror_view( ranks );\n for ( int i = 0; i < n; ++i )\n ranks_host( i ) = ranks_[i];\n Kokkos::deep_copy( ranks, ranks_host );\n\n DataTransferKit::DistributedSearchTreeImpl<DeviceType>::sort_results(\n ids, results, ranks );\n\n \/\/ COMMENT: ids are untouched\n Kokkos::deep_copy( ids_host, ids );\n TEST_COMPARE_ARRAYS( ids_host, ids_ );\n\n Kokkos::deep_copy( results_host, results );\n Kokkos::deep_copy( ranks_host, ranks );\n for ( int q = 0; q < m; ++q )\n for ( int i = offset[q]; i < offset[q + 1]; ++i )\n {\n TEST_EQUALITY( sorted_results[q].count( results_host[i] ), 1 );\n TEST_EQUALITY( sorted_ranks[q].count( ranks_host[i] ), 1 );\n }\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n count_results, DeviceType )\n{\n std::vector<int> ids_ref = {4, 3, 2, 1, 4, 3, 2, 4, 3, 4};\n std::vector<int> offset_ref = {\n 0, 0, 1, 3, 6, 10,\n };\n int const m = 5;\n int const nnz = 10;\n TEST_EQUALITY( ids_ref.size(), nnz );\n TEST_EQUALITY( offset_ref.size(), m + 1 );\n\n Kokkos::View<int *, DeviceType> ids( \"query_ids\", nnz );\n auto ids_host = Kokkos::create_mirror_view( ids );\n for ( int i = 0; i < nnz; ++i )\n ids_host( i ) = ids_ref[i];\n Kokkos::deep_copy( ids, ids_host );\n\n Kokkos::View<int *, DeviceType> offset( \"offset\" );\n\n DataTransferKit::DistributedSearchTreeImpl<DeviceType>::count_results(\n m, ids, offset );\n\n auto offset_host = Kokkos::create_mirror_view( offset );\n Kokkos::deep_copy( offset_host, offset );\n TEST_COMPARE_ARRAYS( offset_host, offset_ref );\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n tpetra_fixme, DeviceType )\n{\n Teuchos::RCP<const Teuchos::Comm<int>> comm =\n Teuchos::DefaultComm<int>::getComm();\n int const comm_rank = comm->getRank();\n int const comm_size = comm->getSize();\n\n Tpetra::Distributor distributor( comm );\n int const n = 3 * comm_size;\n Kokkos::View<int *, DeviceType> proc_ids( \"proc_ids\", n );\n int const n_exports = proc_ids.extent( 0 );\n using ExecutionSpace = typename DeviceType::execution_space;\n Kokkos::parallel_for(\n \"fill_proc_ids\", Kokkos::RangePolicy<ExecutionSpace>( 0, n ),\n KOKKOS_LAMBDA( int i ) { proc_ids( i ) = i % comm_size; } );\n Kokkos::fence();\n auto proc_ids_host = Kokkos::create_mirror_view( proc_ids );\n Kokkos::deep_copy( proc_ids_host, proc_ids );\n int const n_imports = distributor.createFromSends(\n Teuchos::ArrayView<int const>( proc_ids_host.data(), n_exports ) );\n Kokkos::View<int *, DeviceType> exports( \"exports\", n_exports );\n Kokkos::parallel_for(\n \"fill_exports\", Kokkos::RangePolicy<ExecutionSpace>( 0, n_exports ),\n KOKKOS_LAMBDA( int i ) { exports( i ) = comm_rank; } );\n Kokkos::fence();\n\n Kokkos::View<int *, DeviceType> imports( \"imports\", n_imports );\n\/\/ See https:\/\/github.com\/trilinos\/Trilinos\/issues\/1454\n\/\/ The code compiles with the patch that was submitted. Sticking with the\n\/\/ workaround for now until we figure out what version of Trilinos goes into out\n\/\/ Docker image.\n#define WORKAROUND 1\n#ifndef WORKAROUND\n distributor.doPostsAndWaits( exports, 1, imports );\n auto imports_host = Kokkos::create_mirror_view( imports );\n Kokkos::deep_copy( imports_host, imports );\n#else\n auto exports_host = Kokkos::create_mirror_view( exports );\n Kokkos::deep_copy( exports_host, exports );\n auto imports_host = Kokkos::create_mirror_view( imports );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports_host.data(), n_exports ), 1,\n Teuchos::ArrayView<int>( imports_host.data(), n_imports ) );\n Kokkos::deep_copy( imports, imports_host );\n#endif\n\n for ( int i = 0; i < n_imports; ++i )\n TEUCHOS_ASSERT_EQUALITY( imports_host( i ), i \/ 3 );\n}\n\n\/\/ Include the test macros.\n#include \"DataTransferKitSearch_ETIHelperMacros.h\"\n\n\/\/ Create the test group\n#define UNIT_TEST_GROUP( NODE ) \\\n using DeviceType##NODE = typename NODE::device_type; \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n recv_from, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n sort_results, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n count_results, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n tpetra_fixme, DeviceType##NODE )\n\n\/\/ Demangle the types\nDTK_ETI_MANGLING_TYPEDEFS()\n\n\/\/ Instantiate the tests\nDTK_INSTANTIATE_N( UNIT_TEST_GROUP )\n<commit_msg>Get rid of \"comparison between signed and unsigned integer expressions\" warning that slipped into last PR<commit_after>\/****************************************************************************\n * Copyright (c) 2012-2017 by the DataTransferKit authors *\n * All rights reserved. *\n * *\n * This file is part of the DataTransferKit library. DataTransferKit is *\n * distributed under a BSD 3-clause license. For the licensing terms see *\n * the LICENSE file in the top-level directory. *\n ****************************************************************************\/\n\n#include <details\/DTK_DetailsDistributedSearchTreeImpl.hpp>\n\n#include <Teuchos_DefaultComm.hpp>\n#include <Teuchos_UnitTestHarness.hpp>\n#include <Tpetra_Distributor.hpp>\n\n#include <algorithm>\n#include <bitset>\n#include <iostream>\n#include <random>\n#include <tuple>\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl, recv_from,\n DeviceType )\n{\n \/\/ Checking that it is not necessary to send ranks because it can be\n \/\/ inferred from getProcsFrom() and getLengthsFrom().\n Teuchos::RCP<const Teuchos::Comm<int>> comm =\n Teuchos::DefaultComm<int>::getComm();\n int const comm_rank = comm->getRank();\n int const comm_size = comm->getSize();\n\n std::vector<int> tn( comm_size + 1 );\n for ( int i = 0; i < comm_size + 1; ++i )\n tn[i] = i * ( i - 1 ) \/ 2;\n\n \/\/ First use send buffer to set up the communication plan. Sending 0\n \/\/ packet to rank 1, 1 packet to rank 1, 2 packets to rank 2, etc.\n int const n_exports = tn[comm_size];\n std::vector<int> exports( n_exports );\n for ( int i = 0; i < comm_size; ++i )\n for ( int j = tn[i]; j < tn[i + 1]; ++j )\n exports[j] = i;\n\n Tpetra::Distributor distributor( comm );\n int const n_imports = distributor.createFromSends(\n Teuchos::ArrayView<int>( exports.data(), exports.size() ) );\n TEUCHOS_ASSERT_EQUALITY( n_imports, comm_rank * comm_size );\n\n std::vector<int> imports( n_imports );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports.data(), exports.size() ), 1,\n Teuchos::ArrayView<int>( imports.data(), imports.size() ) );\n\n TEST_COMPARE_ARRAYS( imports, std::vector<int>( n_imports, comm_rank ) );\n\n \/\/ Then fill buffer with rank of the process that is sending packets.\n std::fill( exports.begin(), exports.end(), comm_rank );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports.data(), exports.size() ), 1,\n Teuchos::ArrayView<int>( imports.data(), imports.size() ) );\n\n auto procs_from = distributor.getProcsFrom();\n auto lengths_form = distributor.getLengthsFrom();\n TEST_EQUALITY( procs_from.size(), lengths_form.size() );\n std::vector<int> recv_from( n_imports, -1 );\n int count = 0;\n for ( auto i = 0; i < procs_from.size(); ++i )\n for ( size_t j = 0; j < lengths_form[i]; ++j )\n recv_from[count++] = procs_from[i];\n TEST_EQUALITY( count, n_imports );\n TEST_COMPARE_ARRAYS( imports, recv_from );\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n sort_results, DeviceType )\n{\n std::vector<int> ids_ = {4, 3, 2, 1, 4, 3, 2, 4, 3, 4};\n std::vector<int> sorted_ids = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4};\n std::vector<int> offset = {0, 1, 3, 6, 10};\n int const n = 10;\n int const m = 4;\n TEST_EQUALITY( ids_.size(), n );\n TEST_EQUALITY( sorted_ids.size(), n );\n TEST_EQUALITY( offset.size(), m + 1 );\n std::vector<int> results_ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n std::vector<std::set<int>> sorted_results = {\n {3}, {6, 2}, {8, 5, 1}, {9, 7, 4, 0},\n };\n std::vector<int> ranks_ = {10, 11, 12, 13, 14, 15, 16, 17, 18, 19};\n std::vector<std::set<int>> sorted_ranks = {\n {13}, {16, 12}, {18, 15, 11}, {19, 17, 14, 10},\n };\n TEST_EQUALITY( results_.size(), n );\n TEST_EQUALITY( ranks_.size(), n );\n\n Kokkos::View<int *, DeviceType> ids( \"query_ids\", n );\n auto ids_host = Kokkos::create_mirror_view( ids );\n for ( int i = 0; i < n; ++i )\n ids_host( i ) = ids_[i];\n Kokkos::deep_copy( ids, ids_host );\n\n Kokkos::View<int *, DeviceType> results( \"results\", n );\n auto results_host = Kokkos::create_mirror_view( results );\n for ( int i = 0; i < n; ++i )\n results_host( i ) = results_[i];\n Kokkos::deep_copy( results, results_host );\n\n Kokkos::View<int *, DeviceType> ranks( \"ranks\", n );\n auto ranks_host = Kokkos::create_mirror_view( ranks );\n for ( int i = 0; i < n; ++i )\n ranks_host( i ) = ranks_[i];\n Kokkos::deep_copy( ranks, ranks_host );\n\n DataTransferKit::DistributedSearchTreeImpl<DeviceType>::sort_results(\n ids, results, ranks );\n\n \/\/ COMMENT: ids are untouched\n Kokkos::deep_copy( ids_host, ids );\n TEST_COMPARE_ARRAYS( ids_host, ids_ );\n\n Kokkos::deep_copy( results_host, results );\n Kokkos::deep_copy( ranks_host, ranks );\n for ( int q = 0; q < m; ++q )\n for ( int i = offset[q]; i < offset[q + 1]; ++i )\n {\n TEST_EQUALITY( sorted_results[q].count( results_host[i] ), 1 );\n TEST_EQUALITY( sorted_ranks[q].count( ranks_host[i] ), 1 );\n }\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n count_results, DeviceType )\n{\n std::vector<int> ids_ref = {4, 3, 2, 1, 4, 3, 2, 4, 3, 4};\n std::vector<int> offset_ref = {\n 0, 0, 1, 3, 6, 10,\n };\n int const m = 5;\n int const nnz = 10;\n TEST_EQUALITY( ids_ref.size(), nnz );\n TEST_EQUALITY( offset_ref.size(), m + 1 );\n\n Kokkos::View<int *, DeviceType> ids( \"query_ids\", nnz );\n auto ids_host = Kokkos::create_mirror_view( ids );\n for ( int i = 0; i < nnz; ++i )\n ids_host( i ) = ids_ref[i];\n Kokkos::deep_copy( ids, ids_host );\n\n Kokkos::View<int *, DeviceType> offset( \"offset\" );\n\n DataTransferKit::DistributedSearchTreeImpl<DeviceType>::count_results(\n m, ids, offset );\n\n auto offset_host = Kokkos::create_mirror_view( offset );\n Kokkos::deep_copy( offset_host, offset );\n TEST_COMPARE_ARRAYS( offset_host, offset_ref );\n}\n\nTEUCHOS_UNIT_TEST_TEMPLATE_1_DECL( DetailsDistributedSearchTreeImpl,\n tpetra_fixme, DeviceType )\n{\n Teuchos::RCP<const Teuchos::Comm<int>> comm =\n Teuchos::DefaultComm<int>::getComm();\n int const comm_rank = comm->getRank();\n int const comm_size = comm->getSize();\n\n Tpetra::Distributor distributor( comm );\n int const n = 3 * comm_size;\n Kokkos::View<int *, DeviceType> proc_ids( \"proc_ids\", n );\n int const n_exports = proc_ids.extent( 0 );\n using ExecutionSpace = typename DeviceType::execution_space;\n Kokkos::parallel_for(\n \"fill_proc_ids\", Kokkos::RangePolicy<ExecutionSpace>( 0, n ),\n KOKKOS_LAMBDA( int i ) { proc_ids( i ) = i % comm_size; } );\n Kokkos::fence();\n auto proc_ids_host = Kokkos::create_mirror_view( proc_ids );\n Kokkos::deep_copy( proc_ids_host, proc_ids );\n int const n_imports = distributor.createFromSends(\n Teuchos::ArrayView<int const>( proc_ids_host.data(), n_exports ) );\n Kokkos::View<int *, DeviceType> exports( \"exports\", n_exports );\n Kokkos::parallel_for(\n \"fill_exports\", Kokkos::RangePolicy<ExecutionSpace>( 0, n_exports ),\n KOKKOS_LAMBDA( int i ) { exports( i ) = comm_rank; } );\n Kokkos::fence();\n\n Kokkos::View<int *, DeviceType> imports( \"imports\", n_imports );\n\/\/ See https:\/\/github.com\/trilinos\/Trilinos\/issues\/1454\n\/\/ The code compiles with the patch that was submitted. Sticking with the\n\/\/ workaround for now until we figure out what version of Trilinos goes into out\n\/\/ Docker image.\n#define WORKAROUND 1\n#ifndef WORKAROUND\n distributor.doPostsAndWaits( exports, 1, imports );\n auto imports_host = Kokkos::create_mirror_view( imports );\n Kokkos::deep_copy( imports_host, imports );\n#else\n auto exports_host = Kokkos::create_mirror_view( exports );\n Kokkos::deep_copy( exports_host, exports );\n auto imports_host = Kokkos::create_mirror_view( imports );\n distributor.doPostsAndWaits(\n Teuchos::ArrayView<int const>( exports_host.data(), n_exports ), 1,\n Teuchos::ArrayView<int>( imports_host.data(), n_imports ) );\n Kokkos::deep_copy( imports, imports_host );\n#endif\n\n for ( int i = 0; i < n_imports; ++i )\n TEUCHOS_ASSERT_EQUALITY( imports_host( i ), i \/ 3 );\n}\n\n\/\/ Include the test macros.\n#include \"DataTransferKitSearch_ETIHelperMacros.h\"\n\n\/\/ Create the test group\n#define UNIT_TEST_GROUP( NODE ) \\\n using DeviceType##NODE = typename NODE::device_type; \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n recv_from, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n sort_results, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n count_results, DeviceType##NODE ) \\\n TEUCHOS_UNIT_TEST_TEMPLATE_1_INSTANT( DetailsDistributedSearchTreeImpl, \\\n tpetra_fixme, DeviceType##NODE )\n\n\/\/ Demangle the types\nDTK_ETI_MANGLING_TYPEDEFS()\n\n\/\/ Instantiate the tests\nDTK_INSTANTIATE_N( UNIT_TEST_GROUP )\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ ResonantLowPassFilter.cpp\n\/\/ AudioKit Core\n\/\/\n\/\/ Created by Shane Dunne\n\/\/ Copyright © 2018 AudioKit and Apple.\n\/\/\n\/\/ ResonantLowPassFilter implements a simple digital low-pass filter with dynamically\n\/\/ adjustable cutoff frequency and resonance.\n\n#include \"ResonantLowPassFilter.hpp\"\n#include \"FunctionTable.hpp\"\n#include <math.h>\n\nnamespace AudioKitCore\n{\n \/\/ To avoid having to call sin() and cos() in setParams() (whenever filter parameters\n \/\/ are changed), we maintain this static sine lookup table.\n static FunctionTable sineTable;\n static float Sine(float phase) { return sineTable.interp_cyclic(phase); }\n static float Cosine(float phase) { return sineTable.interp_cyclic(phase + 0.25f); }\n\n static const float kMinCutoffHz = 12.0f;\n static const float kMinResLinear = 0.1f;\n static const float kMaxResLinear = 10.0f;\n \n ResonantLowPassFilter::ResonantLowPassFilter()\n {\n init(44100.0); \/\/ sensible guess, will be overridden by init() call anyway\n\n if (sineTable.pWaveTable == 0) \/\/ build sine table only once\n {\n sineTable.init(2048);\n sineTable.sinusoid();\n }\n }\n \n void ResonantLowPassFilter::init(double sampleRateHz)\n {\n this->sampleRateHz = sampleRateHz;\n x1 = x2 = y1 = y1 = 0.0;\n mLastCutoffHz = mLastResLinear = -1.0; \/\/ force recalc of coefficients\n }\n \n void ResonantLowPassFilter::setParams(double newCutoffHz, double newResLinear)\n {\n \/\/ only calculate the filter coefficients if the parameters have changed from last time\n if (newCutoffHz == mLastCutoffHz && newResLinear == mLastResLinear) return;\n \n if (newCutoffHz < kMinCutoffHz) newCutoffHz = kMinCutoffHz;\n if (newResLinear < kMinResLinear ) newResLinear = kMinResLinear;\n if (newResLinear > kMaxResLinear ) newResLinear = kMaxResLinear;\n \n \/\/ convert cutoff from Hz to 0->1 normalized frequency\n double cutoff = 2.0 * newCutoffHz \/ sampleRateHz;\n if (cutoff > 0.99) cutoff = 0.99; \/\/ clip\n \n mLastCutoffHz = newCutoffHz;\n mLastResLinear = newResLinear;\n\n double k = 0.5 * newResLinear * Sine(0.5 * cutoff);\n double c1 = 0.5 * (1.0 - k) \/ (1.0 + k);\n double c2 = (0.5 + c1) * Cosine(0.5 * cutoff);\n double c3 = (0.5 + c1 - c2) * 0.25;\n \n a0 = 2.0 * c3;\n a1 = 2.0 * 2.0 * c3;\n a2 = 2.0 * c3;\n b1 = 2.0 * -c2;\n b2 = 2.0 * c1;\n }\n \n void ResonantLowPassFilter::process(const float *sourceP, float *destP, int inFramesToProcess)\n {\n while (inFramesToProcess--)\n {\n float inputSample = *sourceP++;\n float outputSample = (float)(a0*inputSample + a1*x1 + a2*x2 - b1*y1 - b2*y2);\n if (!isnormal(outputSample))\n outputSample = 0.0f;\n\n x2 = x1;\n x1 = inputSample;\n y2 = y1;\n y1 = outputSample;\n \n *destP++ = outputSample;\n }\n }\n\n float ResonantLowPassFilter::process(float inputSample)\n {\n float outputSample = (float)(a0*inputSample + a1*x1 + a2*x2 - b1*y1 - b2*y2);\n if (!isnormal(outputSample))\n outputSample = 0.0f;\n\n x2 = x1;\n x1 = inputSample;\n y2 = y1;\n y1 = outputSample;\n\n return outputSample;\n }\n\n\n}\n<commit_msg>AudioKitCore::ResonantLowPassFilter CRITICAL BUG FIX<commit_after>\/\/\n\/\/ ResonantLowPassFilter.cpp\n\/\/ AudioKit Core\n\/\/\n\/\/ Created by Shane Dunne\n\/\/ Copyright © 2018 AudioKit and Apple.\n\/\/\n\/\/ ResonantLowPassFilter implements a simple digital low-pass filter with dynamically\n\/\/ adjustable cutoff frequency and resonance.\n\n#include \"ResonantLowPassFilter.hpp\"\n#include \"FunctionTable.hpp\"\n#include <math.h>\n\nnamespace AudioKitCore\n{\n \/\/ To avoid having to call sin() and cos() in setParams() (whenever filter parameters\n \/\/ are changed), we maintain this static sine lookup table.\n static FunctionTable sineTable;\n static float Sine(float phase) { return sineTable.interp_cyclic(phase); }\n static float Cosine(float phase) { return sineTable.interp_cyclic(phase + 0.25f); }\n\n static const float kMinCutoffHz = 12.0f;\n static const float kMinResLinear = 0.1f;\n static const float kMaxResLinear = 10.0f;\n \n ResonantLowPassFilter::ResonantLowPassFilter()\n {\n init(44100.0); \/\/ sensible guess, will be overridden by init() call anyway\n\n if (sineTable.pWaveTable == 0) \/\/ build sine table only once\n {\n sineTable.init(2048);\n sineTable.sinusoid();\n }\n }\n \n void ResonantLowPassFilter::init(double sampleRateHz)\n {\n this->sampleRateHz = sampleRateHz;\n x1 = x2 = y1 = y2 = 0.0;\n mLastCutoffHz = mLastResLinear = -1.0; \/\/ force recalc of coefficients\n }\n \n void ResonantLowPassFilter::setParams(double newCutoffHz, double newResLinear)\n {\n \/\/ only calculate the filter coefficients if the parameters have changed from last time\n if (newCutoffHz == mLastCutoffHz && newResLinear == mLastResLinear) return;\n \n if (newCutoffHz < kMinCutoffHz) newCutoffHz = kMinCutoffHz;\n if (newResLinear < kMinResLinear ) newResLinear = kMinResLinear;\n if (newResLinear > kMaxResLinear ) newResLinear = kMaxResLinear;\n \n \/\/ convert cutoff from Hz to 0->1 normalized frequency\n double cutoff = 2.0 * newCutoffHz \/ sampleRateHz;\n if (cutoff > 0.99) cutoff = 0.99; \/\/ clip\n \n mLastCutoffHz = newCutoffHz;\n mLastResLinear = newResLinear;\n\n double k = 0.5 * newResLinear * Sine(0.5 * cutoff);\n double c1 = 0.5 * (1.0 - k) \/ (1.0 + k);\n double c2 = (0.5 + c1) * Cosine(0.5 * cutoff);\n double c3 = (0.5 + c1 - c2) * 0.25;\n \n a0 = 2.0 * c3;\n a1 = 2.0 * 2.0 * c3;\n a2 = 2.0 * c3;\n b1 = 2.0 * -c2;\n b2 = 2.0 * c1;\n }\n \n void ResonantLowPassFilter::process(const float *sourceP, float *destP, int inFramesToProcess)\n {\n while (inFramesToProcess--)\n {\n float inputSample = *sourceP++;\n float outputSample = (float)(a0*inputSample + a1*x1 + a2*x2 - b1*y1 - b2*y2);\n if (!isnormal(outputSample))\n outputSample = 0.0f;\n\n x2 = x1;\n x1 = inputSample;\n y2 = y1;\n y1 = outputSample;\n \n *destP++ = outputSample;\n }\n }\n\n float ResonantLowPassFilter::process(float inputSample)\n {\n float outputSample = (float)(a0*inputSample + a1*x1 + a2*x2 - b1*y1 - b2*y2);\n if (!isnormal(outputSample))\n outputSample = 0.0f;\n\n x2 = x1;\n x1 = inputSample;\n y2 = y1;\n y1 = outputSample;\n\n return outputSample;\n }\n\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Bugfix: added missing `#include` line.<commit_after><|endoftext|>"} {"text":"<commit_before>\/** @file\n @brief Implementation\n\n @date 2015, 2016\n\n @author\n Sensics, Inc.\n <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015, 2016 Sensics, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Internal Includes\n#include \"PoseEstimator_RANSAC.h\"\n#include \"LED.h\"\n#include \"CameraParameters.h\"\n#include \"cvToEigen.h\"\n\n\/\/ Library\/third-party includes\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp>\n\n\/\/ Standard includes\n#include <algorithm>\n\nnamespace osvr {\nnamespace vbtracker {\n bool RANSACPoseEstimator::operator()(CameraParameters const &camParams,\n LedPtrList const &leds,\n BeaconStateVec const &beacons,\n std::vector<BeaconData> &beaconDebug,\n Eigen::Vector3d &outXlate,\n Eigen::Quaterniond &outQuat) {\n\n \/\/ We need to get a pair of matched vectors of points: 2D locations\n \/\/ with in the image and 3D locations in model space. There needs to\n \/\/ be a correspondence between the points in these vectors, such that\n \/\/ the ith element in one matches the ith element in the other. We\n \/\/ make these by looking up the locations of LEDs with known identifiers\n \/\/ and pushing both onto the vectors at the same time.\n\n std::vector<cv::Point3f> objectPoints;\n std::vector<cv::Point2f> imagePoints;\n std::vector<ZeroBasedBeaconId> beaconIds;\n for (auto const &led : leds) {\n auto id = makeZeroBased(led->getID());\n auto index = asIndex(id);\n beaconDebug[index].variance = -1;\n beaconDebug[index].measurement = led->getLocationForTracking();\n beaconIds.push_back(id);\n\n \/\/\/ Effectively invert the image points here so we get the output of\n \/\/\/ a coordinate system we want.\n imagePoints.push_back(led->getLocationForTracking());\n objectPoints.push_back(\n vec3dToCVPoint3f(beacons[index]->stateVector()));\n }\n\n \/\/ Make sure we have enough points to do our estimation.\n if (objectPoints.size() < m_permittedOutliers + m_requiredInliers) {\n return false;\n }\n\n \/\/ Produce an estimate of the translation and rotation needed to take\n \/\/ points from model space into camera space. We allow for at most\n \/\/ m_permittedOutliers outliers. Even in simulation data, we sometimes\n \/\/ find duplicate IDs for LEDs, indicating that we are getting\n \/\/ mis-identified ones sometimes.\n \/\/ We tried using the previous guess to reduce the amount of computation\n \/\/ being done, but this got us stuck in infinite locations. We seem to\n \/\/ do okay without using it, so leaving it out.\n \/\/ @todo Make number of iterations into a parameter.\n bool usePreviousGuess = false;\n int iterationsCount = 5;\n cv::Mat inlierIndices;\n\n cv::Mat rvec;\n cv::Mat tvec;\n#if CV_MAJOR_VERSION == 2\n cv::solvePnPRansac(\n objectPoints, imagePoints, camParams.cameraMatrix,\n camParams.distortionParameters, rvec, tvec, usePreviousGuess,\n iterationsCount, 8.0f,\n static_cast<int>(objectPoints.size() - m_permittedOutliers),\n inlierIndices);\n#elif CV_MAJOR_VERSION == 3\n \/\/ parameter added to the OpenCV 3.0 interface in place of the number of\n \/\/ inliers\n \/\/\/ @todo how to determine this requested confidence from the data we're\n \/\/\/ given?\n double confidence = 0.99;\n auto ransacResult = cv::solvePnPRansac(\n objectPoints, imagePoints, camParams.cameraMatrix,\n camParams.distortionParameters, rvec, tvec, usePreviousGuess,\n iterationsCount, 8.0f, confidence, inlierIndices);\n if (!ransacResult) {\n return false;\n }\n#else\n#error \"Unrecognized OpenCV version!\"\n#endif\n\n \/\/==========================================================================\n \/\/ Make sure we got all the inliers we needed. Otherwise, reject this\n \/\/ pose.\n if (inlierIndices.rows < static_cast<int>(m_requiredInliers)) {\n return false;\n }\n\n \/\/==========================================================================\n \/\/ Reproject the inliers into the image and make sure they are actually\n \/\/ close to the expected location; otherwise, we have a bad pose.\n const double pixelReprojectionErrorForSingleAxisMax = 4;\n if (inlierIndices.rows > 0) {\n std::vector<cv::Point3f> inlierObjectPoints;\n std::vector<cv::Point2f> inlierImagePoints;\n std::vector<ZeroBasedBeaconId> inlierBeaconIds;\n for (int i = 0; i < inlierIndices.rows; i++) {\n inlierObjectPoints.push_back(objectPoints[i]);\n inlierImagePoints.push_back(imagePoints[i]);\n inlierBeaconIds.push_back(beaconIds[i]);\n }\n std::vector<cv::Point2f> reprojectedPoints;\n cv::projectPoints(\n inlierObjectPoints, rvec, tvec, camParams.cameraMatrix,\n camParams.distortionParameters, reprojectedPoints);\n\n for (size_t i = 0; i < reprojectedPoints.size(); i++) {\n if (reprojectedPoints[i].x - inlierImagePoints[i].x >\n pixelReprojectionErrorForSingleAxisMax) {\n return false;\n }\n if (reprojectedPoints[i].y - inlierImagePoints[i].y >\n pixelReprojectionErrorForSingleAxisMax) {\n return false;\n }\n }\n\n \/\/\/ Now, we will sort that vector of inlier beacon IDs so we can\n \/\/\/ rapidly binary search it to flag the LEDs we used.\n\n \/\/ Need a custom comparator for the ID type.\n auto idComparator = [](ZeroBasedBeaconId const &lhs,\n ZeroBasedBeaconId const &rhs) {\n return lhs.value() < rhs.value();\n };\n std::sort(begin(inlierBeaconIds), end(inlierBeaconIds),\n idComparator);\n \/\/ This lambda wraps binary_search to do what it says: check to see\n \/\/ if a given beacon ID is in the list of inlier beacons.\n auto isAnInlierBeacon = [&inlierBeaconIds, &idComparator](\n ZeroBasedBeaconId const &needle) {\n return std::binary_search(begin(inlierBeaconIds),\n end(inlierBeaconIds), needle,\n idComparator);\n };\n for (auto &led : leds) {\n if (isAnInlierBeacon(led->getID())) {\n led->markAsUsed();\n }\n }\n }\n\n \/\/==========================================================================\n \/\/ Convert this into an OSVR representation of the transformation that\n \/\/ gives the pose of the HDK origin in the camera coordinate system,\n \/\/ switching units to meters and encoding the angle in a unit\n \/\/ quaternion.\n \/\/ The matrix described by rvec and tvec takes points in model space\n \/\/ (the space where the LEDs are defined, which is in mm away from an\n \/\/ implied origin) into a coordinate system where the center is at the\n \/\/ camera's origin, with X to the right, Y down, and Z in the direction\n \/\/ that the camera is facing (but still in the original units of mm):\n \/\/ |Xc| |r11 r12 r13 t1| |Xm|\n \/\/ |Yc| = |r21 r22 r23 t2|*|Ym|\n \/\/ |Zc| |r31 r32 r33 t3| |Zm|\n \/\/ |1 |\n \/\/ That is, it rotates into the camera coordinate system and then adds\n \/\/ the translation, which is in the camera coordinate system.\n \/\/ This is the transformation we want, since it reports the sensor's\n \/\/ position and orientation in camera space, except that we want to\n \/\/ convert\n \/\/ the units into meters and the orientation into a Quaternion.\n \/\/ NOTE: This is a right-handed coordinate system with X pointing\n \/\/ towards the right from the camera center of projection, Y pointing\n \/\/ down, and Z pointing along the camera viewing direction, if the input\n \/\/ points are not inverted.\n\n outXlate = cvToVector3d(tvec);\n outQuat = cvRotVecToQuat(rvec);\n return true;\n }\n\n \/\/\/ Variance in Meters^2\n static const double InitialPositionStateError = 0.;\n \/\/\/ Variance in Radians^2\n static const double InitialOrientationStateError = 0.5;\n static const double InitialVelocityStateError = 0.;\n static const double InitialAngVelStateError =0.;\n static const double InitialStateError[] = {\n InitialPositionStateError, InitialPositionStateError,\n InitialPositionStateError, InitialOrientationStateError,\n InitialOrientationStateError, InitialOrientationStateError,\n InitialVelocityStateError, InitialVelocityStateError,\n InitialVelocityStateError, InitialAngVelStateError,\n InitialAngVelStateError, InitialAngVelStateError};\n bool RANSACPoseEstimator::operator()(EstimatorInOutParams const &p,\n LedPtrList const &leds) {\n Eigen::Vector3d xlate;\n Eigen::Quaterniond quat;\n \/\/\/ Call the main pose estimation to get the vector and quat.\n {\n auto ret = (*this)(p.camParams, leds, p.beacons, p.beaconDebug,\n xlate, quat);\n if (!ret) {\n return false;\n }\n }\n \/\/\/ OK, so if we're here, estimation succeeded and we have valid data in\n \/\/\/ xlate and quat.\n p.state.position() = xlate;\n p.state.setQuaternion(quat);\n \/\/\/ Zero things we can't measure.\n#if 1\n p.state.incrementalOrientation() = Eigen::Vector3d::Zero();\n p.state.velocity() = Eigen::Vector3d::Zero();\n p.state.angularVelocity() = Eigen::Vector3d::Zero();\n#endif\n using StateVec = kalman::types::DimVector<BodyState>;\n using StateSquareMatrix = kalman::types::DimSquareMatrix<BodyState>;\n\n StateSquareMatrix covariance = StateVec(InitialStateError).asDiagonal();\n \/\/\/ @todo Copy the existing angular velocity error covariance\n \/*\n covariance.bottomRightCorner<3, 3>() =\n p.state.errorCovariance().bottomRightCorner<3, 3>();\n *\/\n p.state.setErrorCovariance(covariance);\n return true;\n }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<commit_msg>Style<commit_after>\/** @file\n @brief Implementation\n\n @date 2015, 2016\n\n @author\n Sensics, Inc.\n <http:\/\/sensics.com\/osvr>\n*\/\n\n\/\/ Copyright 2015, 2016 Sensics, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Internal Includes\n#include \"PoseEstimator_RANSAC.h\"\n#include \"LED.h\"\n#include \"CameraParameters.h\"\n#include \"cvToEigen.h\"\n\n\/\/ Library\/third-party includes\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp>\n\n\/\/ Standard includes\n#include <algorithm>\n\nnamespace osvr {\nnamespace vbtracker {\n bool RANSACPoseEstimator::operator()(CameraParameters const &camParams,\n LedPtrList const &leds,\n BeaconStateVec const &beacons,\n std::vector<BeaconData> &beaconDebug,\n Eigen::Vector3d &outXlate,\n Eigen::Quaterniond &outQuat) {\n\n \/\/ We need to get a pair of matched vectors of points: 2D locations\n \/\/ with in the image and 3D locations in model space. There needs to\n \/\/ be a correspondence between the points in these vectors, such that\n \/\/ the ith element in one matches the ith element in the other. We\n \/\/ make these by looking up the locations of LEDs with known identifiers\n \/\/ and pushing both onto the vectors at the same time.\n\n std::vector<cv::Point3f> objectPoints;\n std::vector<cv::Point2f> imagePoints;\n std::vector<ZeroBasedBeaconId> beaconIds;\n for (auto const &led : leds) {\n auto id = makeZeroBased(led->getID());\n auto index = asIndex(id);\n beaconDebug[index].variance = -1;\n beaconDebug[index].measurement = led->getLocationForTracking();\n beaconIds.push_back(id);\n\n \/\/\/ Effectively invert the image points here so we get the output of\n \/\/\/ a coordinate system we want.\n imagePoints.push_back(led->getLocationForTracking());\n objectPoints.push_back(\n vec3dToCVPoint3f(beacons[index]->stateVector()));\n }\n\n \/\/ Make sure we have enough points to do our estimation.\n if (objectPoints.size() < m_permittedOutliers + m_requiredInliers) {\n return false;\n }\n\n \/\/ Produce an estimate of the translation and rotation needed to take\n \/\/ points from model space into camera space. We allow for at most\n \/\/ m_permittedOutliers outliers. Even in simulation data, we sometimes\n \/\/ find duplicate IDs for LEDs, indicating that we are getting\n \/\/ mis-identified ones sometimes.\n \/\/ We tried using the previous guess to reduce the amount of computation\n \/\/ being done, but this got us stuck in infinite locations. We seem to\n \/\/ do okay without using it, so leaving it out.\n \/\/ @todo Make number of iterations into a parameter.\n bool usePreviousGuess = false;\n int iterationsCount = 5;\n cv::Mat inlierIndices;\n\n cv::Mat rvec;\n cv::Mat tvec;\n#if CV_MAJOR_VERSION == 2\n cv::solvePnPRansac(\n objectPoints, imagePoints, camParams.cameraMatrix,\n camParams.distortionParameters, rvec, tvec, usePreviousGuess,\n iterationsCount, 8.0f,\n static_cast<int>(objectPoints.size() - m_permittedOutliers),\n inlierIndices);\n#elif CV_MAJOR_VERSION == 3\n \/\/ parameter added to the OpenCV 3.0 interface in place of the number of\n \/\/ inliers\n \/\/\/ @todo how to determine this requested confidence from the data we're\n \/\/\/ given?\n double confidence = 0.99;\n auto ransacResult = cv::solvePnPRansac(\n objectPoints, imagePoints, camParams.cameraMatrix,\n camParams.distortionParameters, rvec, tvec, usePreviousGuess,\n iterationsCount, 8.0f, confidence, inlierIndices);\n if (!ransacResult) {\n return false;\n }\n#else\n#error \"Unrecognized OpenCV version!\"\n#endif\n\n \/\/==========================================================================\n \/\/ Make sure we got all the inliers we needed. Otherwise, reject this\n \/\/ pose.\n if (inlierIndices.rows < static_cast<int>(m_requiredInliers)) {\n return false;\n }\n\n \/\/==========================================================================\n \/\/ Reproject the inliers into the image and make sure they are actually\n \/\/ close to the expected location; otherwise, we have a bad pose.\n const double pixelReprojectionErrorForSingleAxisMax = 4;\n if (inlierIndices.rows > 0) {\n std::vector<cv::Point3f> inlierObjectPoints;\n std::vector<cv::Point2f> inlierImagePoints;\n std::vector<ZeroBasedBeaconId> inlierBeaconIds;\n for (int i = 0; i < inlierIndices.rows; i++) {\n inlierObjectPoints.push_back(objectPoints[i]);\n inlierImagePoints.push_back(imagePoints[i]);\n inlierBeaconIds.push_back(beaconIds[i]);\n }\n std::vector<cv::Point2f> reprojectedPoints;\n cv::projectPoints(\n inlierObjectPoints, rvec, tvec, camParams.cameraMatrix,\n camParams.distortionParameters, reprojectedPoints);\n\n for (size_t i = 0; i < reprojectedPoints.size(); i++) {\n if (reprojectedPoints[i].x - inlierImagePoints[i].x >\n pixelReprojectionErrorForSingleAxisMax) {\n return false;\n }\n if (reprojectedPoints[i].y - inlierImagePoints[i].y >\n pixelReprojectionErrorForSingleAxisMax) {\n return false;\n }\n }\n\n \/\/\/ Now, we will sort that vector of inlier beacon IDs so we can\n \/\/\/ rapidly binary search it to flag the LEDs we used.\n\n \/\/ Need a custom comparator for the ID type.\n auto idComparator = [](ZeroBasedBeaconId const &lhs,\n ZeroBasedBeaconId const &rhs) {\n return lhs.value() < rhs.value();\n };\n std::sort(begin(inlierBeaconIds), end(inlierBeaconIds),\n idComparator);\n \/\/ This lambda wraps binary_search to do what it says: check to see\n \/\/ if a given beacon ID is in the list of inlier beacons.\n auto isAnInlierBeacon = [&inlierBeaconIds, &idComparator](\n ZeroBasedBeaconId const &needle) {\n return std::binary_search(begin(inlierBeaconIds),\n end(inlierBeaconIds), needle,\n idComparator);\n };\n for (auto &led : leds) {\n if (isAnInlierBeacon(led->getID())) {\n led->markAsUsed();\n }\n }\n }\n\n \/\/==========================================================================\n \/\/ Convert this into an OSVR representation of the transformation that\n \/\/ gives the pose of the HDK origin in the camera coordinate system,\n \/\/ switching units to meters and encoding the angle in a unit\n \/\/ quaternion.\n \/\/ The matrix described by rvec and tvec takes points in model space\n \/\/ (the space where the LEDs are defined, which is in mm away from an\n \/\/ implied origin) into a coordinate system where the center is at the\n \/\/ camera's origin, with X to the right, Y down, and Z in the direction\n \/\/ that the camera is facing (but still in the original units of mm):\n \/\/ |Xc| |r11 r12 r13 t1| |Xm|\n \/\/ |Yc| = |r21 r22 r23 t2|*|Ym|\n \/\/ |Zc| |r31 r32 r33 t3| |Zm|\n \/\/ |1 |\n \/\/ That is, it rotates into the camera coordinate system and then adds\n \/\/ the translation, which is in the camera coordinate system.\n \/\/ This is the transformation we want, since it reports the sensor's\n \/\/ position and orientation in camera space, except that we want to\n \/\/ convert\n \/\/ the units into meters and the orientation into a Quaternion.\n \/\/ NOTE: This is a right-handed coordinate system with X pointing\n \/\/ towards the right from the camera center of projection, Y pointing\n \/\/ down, and Z pointing along the camera viewing direction, if the input\n \/\/ points are not inverted.\n\n outXlate = cvToVector3d(tvec);\n outQuat = cvRotVecToQuat(rvec);\n return true;\n }\n\n \/\/\/ Variance in Meters^2\n static const double InitialPositionStateError = 0.;\n \/\/\/ Variance in Radians^2\n static const double InitialOrientationStateError = 0.5;\n static const double InitialVelocityStateError = 0.;\n static const double InitialAngVelStateError = 0.;\n static const double InitialStateError[] = {\n InitialPositionStateError, InitialPositionStateError,\n InitialPositionStateError, InitialOrientationStateError,\n InitialOrientationStateError, InitialOrientationStateError,\n InitialVelocityStateError, InitialVelocityStateError,\n InitialVelocityStateError, InitialAngVelStateError,\n InitialAngVelStateError, InitialAngVelStateError};\n bool RANSACPoseEstimator::operator()(EstimatorInOutParams const &p,\n LedPtrList const &leds) {\n Eigen::Vector3d xlate;\n Eigen::Quaterniond quat;\n \/\/\/ Call the main pose estimation to get the vector and quat.\n {\n auto ret = (*this)(p.camParams, leds, p.beacons, p.beaconDebug,\n xlate, quat);\n if (!ret) {\n return false;\n }\n }\n \/\/\/ OK, so if we're here, estimation succeeded and we have valid data in\n \/\/\/ xlate and quat.\n p.state.position() = xlate;\n p.state.setQuaternion(quat);\n\/\/\/ Zero things we can't measure.\n#if 1\n p.state.incrementalOrientation() = Eigen::Vector3d::Zero();\n p.state.velocity() = Eigen::Vector3d::Zero();\n p.state.angularVelocity() = Eigen::Vector3d::Zero();\n#endif\n using StateVec = kalman::types::DimVector<BodyState>;\n using StateSquareMatrix = kalman::types::DimSquareMatrix<BodyState>;\n\n StateSquareMatrix covariance = StateVec(InitialStateError).asDiagonal();\n \/\/\/ @todo Copy the existing angular velocity error covariance\n \/*\n covariance.bottomRightCorner<3, 3>() =\n p.state.errorCovariance().bottomRightCorner<3, 3>();\n *\/\n p.state.setErrorCovariance(covariance);\n return true;\n }\n\n} \/\/ namespace vbtracker\n} \/\/ namespace osvr\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix for running externandnotdefined plugin on Ubuntu<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ MatrixKeyboard.hh\r\n\/*\r\n *\tA class that creates a simple matrix keyboard \r\n * \tusing the wiringPi library and the X11 Xtest \r\n * \textension.\r\n *\/\r\n\r\n\r\n#ifndef _MATRIX_KEYBOARD_HH\r\n#define _MATRIX_KEYBOARD_HH\r\n\r\n#include <wiringPi.h>\r\n#include <X11\/Xlib.h>\r\n#include <X11\/Intrinsic.h>\r\n#include <X11\/extensions\/XTest.h>\r\n\r\n#include <iostream>\r\n#include <chrono>\r\n#include <thread>\r\n\r\nusing namespace std;\r\nusing namespace std::chrono;\r\nusing namespace std::this_thread;\r\n\r\ntypedef unsigned int uInt;\r\nstruct Key\r\n{\r\n\tuInt rowPin;\r\n\tuInt colPin;\r\n\tKeySym keysym;\r\n\tuInt lastState;\r\n};\r\n\r\nstatic const bool KEY_DOWN = true;\r\nstatic const bool KEY_UP = false;\r\nstatic const uInt nRows = 1;\r\nstatic const uInt nCols = 2;\r\n\r\nclass MatrixKeyboard\r\n{\r\nprivate:\r\n\r\n\tDisplay * myXDisplay;\r\n\tKey keyboard[nRows][nCols];\r\n\r\npublic:\r\n\tMatrixKeyboard();\r\n\r\nprivate:\r\n\tvoid pressKey(KeySym keysym);\r\n\tvoid releaseKey(KeySym keysym);\r\n\r\npublic:\r\n\tvoid run();\r\n};\r\n\r\n#endif \/\/ ! _MATRIX_KEYBOARD_HH<commit_msg>Full reworked class<commit_after>#ifndef _MATRIX_KEYBOARD_HH\r\n#define _MATRIX_KEYBOARD_HH\r\n\r\n#include <wiringPi.h>\r\n#include <X11\/Xlib.h>\r\n#include <X11\/Intrinsic.h>\r\n#include <X11\/extensions\/XTest.h>\r\n\r\n#include <iostream>\r\n#include <chrono>\r\n#include <thread>\r\n#include <vector>\r\n\r\nusing namespace std;\r\nusing namespace std::chrono;\r\nusing namespace std::this_thread;\r\n\r\ntypedef unsigned int uInt; \r\n\r\nclass MatrixKeyboard\r\n{\r\nprivate:\r\n\tDisplay * myXDisplay;\r\n\tvector<uInt> rows;\r\n\tvector<uInt> cols;\r\n\tvector<KeySym> keys;\r\n\tvector<bool> lastStates;\r\n\tuInt delay;\r\n\r\npublic:\r\n\tMatrixKeyboard(vector<uInt> rows, vector<uInt> cols, vector<KeySym> keys);\r\n\tvoid run();\r\n\r\nprivate:\r\n\tvoid pressKey(KeySym keysym);\r\n\tvoid releaseKey(KeySym keysym);\r\n\r\n\r\n};\r\n\r\n#endif \/\/ ! _MATRIX_KEYBOARD_HH\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n knwidgets.cpp\n\n KNode, the KDE newsreader\n Copyright (c) 1999-2001 the KNode authors.\n See file AUTHORS for details\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, US\n*\/\n\n#include <qpainter.h>\n\n#include \"knwidgets.h\"\n\n\n\/\/====================================================================================\n\nKNListBoxItem::KNListBoxItem(const QString& text, QPixmap *pm)\n{\n p_m=pm;\n setText(text);\n}\n\n\nKNListBoxItem::~KNListBoxItem()\n{\n}\n\n\nvoid KNListBoxItem::paint(QPainter *p)\n{\n \n QFontMetrics fm = p->fontMetrics();\n \n int tYPos=0, tXPos=3, pYPos=0;\n \n tYPos = fm.ascent() + fm.leading()\/2; \/\/ vertical text position\n \n if(p_m) {\n \n tXPos=p_m->width() + 6;\n \n if ( p_m->height() < fm.height() ) {\n \/\/tYPos = fm.ascent() + fm.leading()\/2;\n pYPos = (fm.height() - p_m->height())\/2;}\n else {\n tYPos = p_m->height()\/2 - fm.height()\/2 + fm.ascent();\n pYPos = 0;\n }\n p->drawPixmap( 3, pYPos , *p_m );\n }\n \n\n p->drawText( tXPos, tYPos, text() );\n}\n\n\nint KNListBoxItem::height(const QListBox *lb) const\n{\n if(p_m)\n return QMAX( p_m->height(), lb->fontMetrics().lineSpacing() + 1 );\n else\n return (lb->fontMetrics().lineSpacing() + 1);\n}\n\n\nint KNListBoxItem::width(const QListBox *lb) const\n{\n if(p_m)\n return (p_m->width() + lb->fontMetrics().width( text() ) + 6);\n else\n return (lb->fontMetrics().width( text() ) + 6);\n}\n\n\n\/\/====================================================================================\n\n\/\/ **** listbox for dialogs **************************************************\n\nKNDialogListBox::KNDialogListBox(bool alwaysIgnore, QWidget * parent, const char * name)\n : QListBox(parent, name), a_lwaysIgnore(alwaysIgnore)\n{\n}\n\n\nKNDialogListBox::~KNDialogListBox()\n{\n}\n\n\nvoid KNDialogListBox::keyPressEvent(QKeyEvent *e)\n{\n if ((a_lwaysIgnore || !(hasFocus()&&isVisible()))&&((e->key()==Key_Enter)||(e->key()==Key_Return)))\n e->ignore();\n else\n QListBox::keyPressEvent(e);\n}\n\n\n\/\/====================================================================================\n\n\nKNProgress::KNProgress (int desiredHeight, int maxValue, int value, QWidget *parent, const char *name)\n : KProgress(parent, name), desHeight(desiredHeight)\n{\n setRange(0, maxValue);\n setValue(value);\n setFixedWidth(110);\n setFrameStyle(QFrame::Box | QFrame::Raised);\n setLineWidth(1);\n setBackgroundMode(QWidget::PaletteBackground);\n disableProgressBar();\n}\n\n\nKNProgress::~KNProgress()\n{}\n\n\n\/\/ 0% and no text\nvoid KNProgress::disableProgressBar()\n{\n setFormat(QString::null);\n setValue(0);\n repaint(false);\n}\n\n\n\/\/ manual operation\nvoid KNProgress::setProgressBar(int value,const QString& text)\n{\n setFormat(text);\n if (value>1000) {\n setValue(1000);\n update(); \/\/ circumvent the optimization of setValue\n } else\n setValue(value);\n}\n\n\nQSize KNProgress::sizeHint() const\n{\n return QSize(KProgress::sizeHint().width(),desHeight);\n}\n\n\n\/\/====================================================================================\n\n\nKNDockWidgetHeaderDrag::KNDockWidgetHeaderDrag(QWidget *focusWidget, KDockWidgetAbstractHeader* parent, KDockWidget* dock, const char* name )\n : KDockWidgetHeaderDrag(parent, dock, name), f_ocus(false)\n{\n connect(focusWidget, SIGNAL(focusChanged(QFocusEvent*)), SLOT(slotFocusChanged(QFocusEvent*)));\n}\n\n\nKNDockWidgetHeaderDrag::~KNDockWidgetHeaderDrag()\n{\n}\n\n\nvoid KNDockWidgetHeaderDrag::slotFocusChanged(QFocusEvent *e)\n{\n if(e->gotFocus()) {\n f_ocus = true;\n } else if(e->lostFocus()) {\n f_ocus = false;\n }\n update();\n}\n\n\nvoid KNDockWidgetHeaderDrag::paintEvent(QPaintEvent* ev)\n{\n if (!f_ocus) {\n KDockWidgetHeaderDrag::paintEvent(ev);\n return;\n }\n\n QPixmap drawBuffer(width(), height());\n QPainter paint;\n\n paint.begin(&drawBuffer);\n paint.fillRect(drawBuffer.rect(), QBrush(colorGroup().brush(QColorGroup::Background)));\n\n paint.setPen(palette().active().highlight());\n paint.drawLine(1, 2, width(), 2);\n paint.drawLine(1, 3, width(), 3);\n paint.drawLine(1, 5, width(), 5);\n paint.drawLine(1, 6, width(), 6);\n\n bitBlt( this,0,0,&drawBuffer,0,0,width(),height());\n paint.end();\n}\n\n\n\/\/====================================================================================\n\n#include \"knwidgets.moc\"\n<commit_msg>looks better with the new linespacing behaviour of Qt - setFrameStyle(QFrame::Box | QFrame::Raised); + setFrameStyle(QFrame::Box);<commit_after>\/*\n knwidgets.cpp\n\n KNode, the KDE newsreader\n Copyright (c) 1999-2001 the KNode authors.\n See file AUTHORS for details\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, US\n*\/\n\n#include <qpainter.h>\n\n#include \"knwidgets.h\"\n\n\n\/\/====================================================================================\n\nKNListBoxItem::KNListBoxItem(const QString& text, QPixmap *pm)\n{\n p_m=pm;\n setText(text);\n}\n\n\nKNListBoxItem::~KNListBoxItem()\n{\n}\n\n\nvoid KNListBoxItem::paint(QPainter *p)\n{\n \n QFontMetrics fm = p->fontMetrics();\n \n int tYPos=0, tXPos=3, pYPos=0;\n \n tYPos = fm.ascent() + fm.leading()\/2; \/\/ vertical text position\n \n if(p_m) {\n \n tXPos=p_m->width() + 6;\n \n if ( p_m->height() < fm.height() ) {\n \/\/tYPos = fm.ascent() + fm.leading()\/2;\n pYPos = (fm.height() - p_m->height())\/2;}\n else {\n tYPos = p_m->height()\/2 - fm.height()\/2 + fm.ascent();\n pYPos = 0;\n }\n p->drawPixmap( 3, pYPos , *p_m );\n }\n \n\n p->drawText( tXPos, tYPos, text() );\n}\n\n\nint KNListBoxItem::height(const QListBox *lb) const\n{\n if(p_m)\n return QMAX( p_m->height(), lb->fontMetrics().lineSpacing() + 1 );\n else\n return (lb->fontMetrics().lineSpacing() + 1);\n}\n\n\nint KNListBoxItem::width(const QListBox *lb) const\n{\n if(p_m)\n return (p_m->width() + lb->fontMetrics().width( text() ) + 6);\n else\n return (lb->fontMetrics().width( text() ) + 6);\n}\n\n\n\/\/====================================================================================\n\n\/\/ **** listbox for dialogs **************************************************\n\nKNDialogListBox::KNDialogListBox(bool alwaysIgnore, QWidget * parent, const char * name)\n : QListBox(parent, name), a_lwaysIgnore(alwaysIgnore)\n{\n}\n\n\nKNDialogListBox::~KNDialogListBox()\n{\n}\n\n\nvoid KNDialogListBox::keyPressEvent(QKeyEvent *e)\n{\n if ((a_lwaysIgnore || !(hasFocus()&&isVisible()))&&((e->key()==Key_Enter)||(e->key()==Key_Return)))\n e->ignore();\n else\n QListBox::keyPressEvent(e);\n}\n\n\n\/\/====================================================================================\n\n\nKNProgress::KNProgress (int desiredHeight, int maxValue, int value, QWidget *parent, const char *name)\n : KProgress(parent, name), desHeight(desiredHeight)\n{\n setRange(0, maxValue);\n setValue(value);\n setFixedWidth(110);\n setFrameStyle(QFrame::Box);\n setLineWidth(1);\n setBackgroundMode(QWidget::PaletteBackground);\n disableProgressBar();\n}\n\n\nKNProgress::~KNProgress()\n{}\n\n\n\/\/ 0% and no text\nvoid KNProgress::disableProgressBar()\n{\n setFormat(QString::null);\n setValue(0);\n repaint(false);\n}\n\n\n\/\/ manual operation\nvoid KNProgress::setProgressBar(int value,const QString& text)\n{\n setFormat(text);\n if (value>1000) {\n setValue(1000);\n update(); \/\/ circumvent the optimization of setValue\n } else\n setValue(value);\n}\n\n\nQSize KNProgress::sizeHint() const\n{\n return QSize(KProgress::sizeHint().width(),desHeight);\n}\n\n\n\/\/====================================================================================\n\n\nKNDockWidgetHeaderDrag::KNDockWidgetHeaderDrag(QWidget *focusWidget, KDockWidgetAbstractHeader* parent, KDockWidget* dock, const char* name )\n : KDockWidgetHeaderDrag(parent, dock, name), f_ocus(false)\n{\n connect(focusWidget, SIGNAL(focusChanged(QFocusEvent*)), SLOT(slotFocusChanged(QFocusEvent*)));\n}\n\n\nKNDockWidgetHeaderDrag::~KNDockWidgetHeaderDrag()\n{\n}\n\n\nvoid KNDockWidgetHeaderDrag::slotFocusChanged(QFocusEvent *e)\n{\n if(e->gotFocus()) {\n f_ocus = true;\n } else if(e->lostFocus()) {\n f_ocus = false;\n }\n update();\n}\n\n\nvoid KNDockWidgetHeaderDrag::paintEvent(QPaintEvent* ev)\n{\n if (!f_ocus) {\n KDockWidgetHeaderDrag::paintEvent(ev);\n return;\n }\n\n QPixmap drawBuffer(width(), height());\n QPainter paint;\n\n paint.begin(&drawBuffer);\n paint.fillRect(drawBuffer.rect(), QBrush(colorGroup().brush(QColorGroup::Background)));\n\n paint.setPen(palette().active().highlight());\n paint.drawLine(1, 2, width(), 2);\n paint.drawLine(1, 3, width(), 3);\n paint.drawLine(1, 5, width(), 5);\n paint.drawLine(1, 6, width(), 6);\n\n bitBlt( this,0,0,&drawBuffer,0,0,width(),height());\n paint.end();\n}\n\n\n\/\/====================================================================================\n\n#include \"knwidgets.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n\n#include \"DollhousePanel.h\"\n\n#include <Adafruit_TLC59711.h>\n#include <Adafruit_NeoPixel.h>\n#include <LiquidCrystal.h>\n#include <SPI.h>\n#include <Fsm.h>\n#include <EnableInterrupt.h>\n\nconst char NUM_TLC59711 = 1;\nconst char TLC_DATA = 12;\nconst char TLC_CLK = 13;\n\nconst char PIXEL_COUNT = 3;\nconst char PIXEL_PIN = 8;\n\nenum events {\n CHANGE_LIGHT_MODE,\n NEXT_ROOM,\n PREVIOUS_ROOM,\n RESET_ROOMS\n};\n\n\/\/ Lighting modes finite state machine\nState state_lighting_mode(on_lighting_mode_enter, NULL, &on_lighting_mode_exit);\nState state_party_mode(on_party_mode_enter, NULL, &on_party_mode_exit);\nState state_nitelite_mode(on_nitelite_mode_enter, NULL, &on_nitelite_mode_exit);\nState state_off_mode(on_off_mode_enter, NULL, &on_off_mode_exit);\nFsm modes(&state_off_mode);\n\nenum Modes {\n LIGHTING_MODE,\n PARTY_MODE,\n NITELITE_MODE,\n OFF_MODE\n};\n\nString modeNames[] = {\"Lighting\", \"Party\", \"Nitelite\", \"Off\"};\n\n\/\/ Rooms finite state machine\nState state_all_rooms(on_all_enter, NULL, &on_all_exit);\nState state_hall(on_hall_enter, NULL, &on_hall_exit);\nState state_living_room(on_living_room_enter, NULL, &on_living_room_exit);\nState state_kitchen(on_kitchen_enter, NULL, &on_kitchen_exit);\nState state_bedroom(on_bedroom_enter, NULL, &on_bedroom_exit);\nState state_bathroom(on_bathroom_enter, NULL, &on_bathroom_exit);\nState state_attic(on_attic_enter, NULL, &on_attic_exit);\nFsm rooms(&state_all_rooms);\n\n\/\/ LastROOM is included to make it easier to figure out the size of the enum\n\/\/ for things like sizing the brightness state array\nenum Rooms {\n ALL_ROOMS,\n LIVING_ROOM,\n HALL,\n KITCHEN,\n BEDROOM,\n BATHROOM,\n ATTIC,\n LastROOM\n};\n\nString roomNames[] = {\"All\", \"Living\", \"Hall\", \"Kitchen\", \"Bedroom\", \"Bathroom\", \"Attic\"};\n\n\/\/ NeoPixels (for the attic & !!!PARTY MODE!!!)\nAdafruit_NeoPixel strip = Adafruit_NeoPixel(PIXEL_COUNT, PIXEL_PIN, NEO_GRB + NEO_KHZ800);\n\n\/\/ PWM board (controls the room lights)\nAdafruit_TLC59711 tlc = Adafruit_TLC59711(NUM_TLC59711, TLC_CLK, TLC_DATA);\n\n\/\/ 16x2 LCD display\nLiquidCrystal lcd(7, 6, 5, 4, 3, 2);\n\n\/\/ Panel RGB LED pins\nconst char RED_PIN = 9;\nconst char GREEN_PIN = 10;\nconst char BLUE_PIN = 11;\n\nint brightness = 90;\nint deltaLevel = 30;\nint minLevel = 0;\nint maxLevel = 180;\nint roomBrightness[LastROOM];\nint currentRoom = ALL_ROOMS;\nint currentMode = OFF_MODE;\n\nint debounceDelay = 100;\n\nvoid setup() {\n \/\/ Fire up the LCD display\n lcd.begin(16, 2);\n lcd.print(\"Doll house\");\n lcd.setCursor(0,1);\n lcd.print(\"lighting!\");\n\n pinMode(RED_PIN, OUTPUT);\n pinMode(GREEN_PIN, OUTPUT);\n pinMode(BLUE_PIN, OUTPUT);\n\n \/\/ initialize the NeoPixel strand\n strip.begin();\n strip.show();\n\n \/\/ Initialize the PWM board\n tlc.begin();\n tlc.write();\n\n \/\/ set defualt room brightness\n setDefaultLightLevel();\n\n \/\/ enable interrupts on buttons\n \/\/ The button interface is a Smartmaker 5A5 (annoying, but it works)\n enableInterrupt(A0, handleButtonOne, FALLING);\n enableInterrupt(A1, handleButtonTwo, FALLING);\n enableInterrupt(A2, handleButtonThree, FALLING);\n enableInterrupt(A3, handleButtonFour, FALLING);\n enableInterrupt(A4, handleButtonFive, FALLING);\n\n \/\/ mode FSM transitions\n modes.add_transition(&state_off_mode, &state_lighting_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_lighting_mode, &state_party_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_party_mode, &state_nitelite_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_nitelite_mode, &state_off_mode, CHANGE_LIGHT_MODE, NULL);\n\n \/\/ rooms FSM transitions\n \/\/ looping \"forward\" through the rooms\n rooms.add_transition(&state_all_rooms, &state_hall, NEXT_ROOM, NULL);\n rooms.add_transition(&state_hall, &state_living_room, NEXT_ROOM, NULL);\n rooms.add_transition(&state_living_room, &state_kitchen, NEXT_ROOM, NULL);\n rooms.add_transition(&state_kitchen, &state_bedroom, NEXT_ROOM, NULL);\n rooms.add_transition(&state_bedroom, &state_bathroom, NEXT_ROOM, NULL);\n rooms.add_transition(&state_bathroom, &state_attic, NEXT_ROOM, NULL);\n rooms.add_transition(&state_attic, &state_all_rooms, NEXT_ROOM, NULL);\n\n \/\/ looping \"backward\" through the rooms\n rooms.add_transition(&state_all_rooms, &state_attic, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_attic, &state_bathroom, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_bathroom, &state_bedroom, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_bedroom, &state_kitchen, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_kitchen, &state_living_room, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_living_room, &state_hall, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_hall, &state_all_rooms, PREVIOUS_ROOM, NULL);\n\n \/\/ reseting to the default room (all rooms)\n rooms.add_transition(&state_hall, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_living_room, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_kitchen, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_bedroom, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_bathroom, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_attic, &state_all_rooms, RESET_ROOMS, NULL);\n}\n\n\/\/ ***** Button event handlers ***** \/\/\nvoid handleButtonOne() {\n lcd.clear();\n rooms.trigger(RESET_ROOMS);\n modes.trigger(CHANGE_LIGHT_MODE);\n delay(debounceDelay);\n}\n\nvoid handleButtonTwo() {\n setRoomBrightness(currentRoom, min(roomBrightness[currentRoom] + deltaLevel, maxLevel));\n printCurrentRoom();\n delay(debounceDelay);\n}\n\nvoid handleButtonThree() {\n lcd.clear();\n rooms.trigger(PREVIOUS_ROOM);\n delay(debounceDelay);\n}\n\nvoid handleButtonFour() {\n setRoomBrightness(currentRoom, max(roomBrightness[currentRoom] - deltaLevel, minLevel));\n printCurrentRoom();\n delay(debounceDelay);\n}\n\nvoid handleButtonFive() {\n lcd.clear();\n rooms.trigger(NEXT_ROOM);\n delay(debounceDelay);\n}\n\n\/\/ ***** helpers ***** \/\/\n\nvoid setRGBColor(int red, int green, int blue) {\n int myRed = constrain(red, 0, 255);\n int myGreen = constrain(green, 0, 255);\n int myBlue = constrain(blue, 0, 255);\n\n analogWrite(RED_PIN, myRed);\n analogWrite(GREEN_PIN, myGreen);\n analogWrite(BLUE_PIN, myBlue);\n}\n\nvoid setRoomBrightness(int room, int level) {\n setRGBColor(0,0,level);\n roomBrightness[room] = level;\n tlc.setPWM(room * 3, roomBrightness[room] * maxLevel);\n tlc.write();\n}\n\nvoid setDefaultLightLevel() {\n setRGBColor(0,0,brightness);\n for (int i = 0; i != LastROOM; i++) {\n roomBrightness[i] = brightness;\n }\n}\n\nvoid setCurrentMode(int mode) {\n currentMode = mode;\n printCurrentMode();\n}\n\nvoid printCurrentMode() {\n lcd.clear();\n lcd.print(\"Mode: \");\n lcd.print(modeNames[currentMode]);\n}\n\nvoid setCurrentRoom(int room) {\n currentRoom = room;\n setRGBColor(0,0,roomBrightness[room]);\n printCurrentRoom();\n}\n\nvoid printCurrentRoom() {\n lcd.clear();\n lcd.print(\"room: \");\n lcd.print(roomNames[currentRoom]);\n lcd.setCursor(0,1);\n lcd.print(\"brightness: \");\n lcd.print(roomBrightness[currentRoom]);\n}\n\n\/\/ ***** FSM event handlers ***** \/\/\n\n\/\/ ---- lighting mode states ---- \/\/\n\nvoid on_lighting_mode_enter(){\n setCurrentMode(LIGHTING_MODE);\n}\n\nvoid on_lighting_mode_exit(){\n \n}\n\nvoid on_party_mode_enter(){\n setCurrentMode(PARTY_MODE);\n}\n\nvoid on_party_mode_exit(){\n \n}\n\nvoid on_nitelite_mode_enter(){\n setCurrentMode(NITELITE_MODE); \n}\n\nvoid on_nitelite_mode_exit(){\n\n}\n\nvoid on_off_mode_enter(){\n setCurrentMode(OFF_MODE); \n}\n\nvoid on_off_mode_exit(){\n\n}\n\n\/\/ ---- room selection states ---- \/\/\nvoid on_all_enter() {\n setCurrentRoom(ALL_ROOMS);\n}\n\nvoid on_all_exit() {\n \n}\n\nvoid on_hall_enter() {\n setCurrentRoom(HALL);\n}\n\nvoid on_hall_exit() {\n \n}\n\nvoid on_living_room_enter() {\n setCurrentRoom(LIVING_ROOM);\n}\n\nvoid on_living_room_exit() {\n \n}\n\nvoid on_kitchen_enter() {\n setCurrentRoom(KITCHEN);\n}\n\nvoid on_kitchen_exit() {\n \n}\n\nvoid on_bathroom_enter() {\n setCurrentRoom(BATHROOM);\n}\n\nvoid on_bathroom_exit() {\n \n}\n\nvoid on_bedroom_enter() {\n setCurrentRoom(BEDROOM);\n}\n\nvoid on_bedroom_exit() {\n \n}\n\nvoid on_attic_enter() {\n setCurrentRoom(ATTIC);\n}\n\nvoid on_attic_exit() {\n \n}\n\nvoid loop() {\n \/\/ do nothing; everything is handled via FSM events.\n \/\/ We also don't need to call the \".run_machine\" methods of\n \/\/ the FSMs as there are no \"on_state\" handlers or timed transitions\n}\n<commit_msg>Add notes re button functions<commit_after>#include <Arduino.h>\n\n#include \"DollhousePanel.h\"\n\n#include <Adafruit_TLC59711.h>\n#include <Adafruit_NeoPixel.h>\n#include <LiquidCrystal.h>\n#include <SPI.h>\n#include <Fsm.h>\n#include <EnableInterrupt.h>\n\nconst char NUM_TLC59711 = 1;\nconst char TLC_DATA = 12;\nconst char TLC_CLK = 13;\n\nconst char PIXEL_COUNT = 3;\nconst char PIXEL_PIN = 8;\n\nenum events {\n CHANGE_LIGHT_MODE,\n NEXT_ROOM,\n PREVIOUS_ROOM,\n RESET_ROOMS\n};\n\n\/\/ Lighting modes finite state machine\nState state_lighting_mode(on_lighting_mode_enter, NULL, &on_lighting_mode_exit);\nState state_party_mode(on_party_mode_enter, NULL, &on_party_mode_exit);\nState state_nitelite_mode(on_nitelite_mode_enter, NULL, &on_nitelite_mode_exit);\nState state_off_mode(on_off_mode_enter, NULL, &on_off_mode_exit);\nFsm modes(&state_off_mode);\n\nenum Modes {\n LIGHTING_MODE,\n PARTY_MODE,\n NITELITE_MODE,\n OFF_MODE\n};\n\nString modeNames[] = {\"Lighting\", \"Party\", \"Nitelite\", \"Off\"};\n\n\/\/ Rooms finite state machine\nState state_all_rooms(on_all_enter, NULL, &on_all_exit);\nState state_hall(on_hall_enter, NULL, &on_hall_exit);\nState state_living_room(on_living_room_enter, NULL, &on_living_room_exit);\nState state_kitchen(on_kitchen_enter, NULL, &on_kitchen_exit);\nState state_bedroom(on_bedroom_enter, NULL, &on_bedroom_exit);\nState state_bathroom(on_bathroom_enter, NULL, &on_bathroom_exit);\nState state_attic(on_attic_enter, NULL, &on_attic_exit);\nFsm rooms(&state_all_rooms);\n\n\/\/ LastROOM is included to make it easier to figure out the size of the enum\n\/\/ for things like sizing the brightness state array\nenum Rooms {\n ALL_ROOMS,\n LIVING_ROOM,\n HALL,\n KITCHEN,\n BEDROOM,\n BATHROOM,\n ATTIC,\n LastROOM\n};\n\nString roomNames[] = {\"All\", \"Living\", \"Hall\", \"Kitchen\", \"Bedroom\", \"Bathroom\", \"Attic\"};\n\n\/\/ NeoPixels (for the attic & !!!PARTY MODE!!!)\nAdafruit_NeoPixel strip = Adafruit_NeoPixel(PIXEL_COUNT, PIXEL_PIN, NEO_GRB + NEO_KHZ800);\n\n\/\/ PWM board (controls the room lights)\nAdafruit_TLC59711 tlc = Adafruit_TLC59711(NUM_TLC59711, TLC_CLK, TLC_DATA);\n\n\/\/ 16x2 LCD display\nLiquidCrystal lcd(7, 6, 5, 4, 3, 2);\n\n\/\/ Panel RGB LED pins\nconst char RED_PIN = 9;\nconst char GREEN_PIN = 10;\nconst char BLUE_PIN = 11;\n\nint brightness = 90;\nint deltaLevel = 30;\nint minLevel = 0;\nint maxLevel = 180;\nint roomBrightness[LastROOM];\nint currentRoom = ALL_ROOMS;\nint currentMode = OFF_MODE;\n\nint debounceDelay = 100;\n\nvoid setup() {\n \/\/ Fire up the LCD display\n lcd.begin(16, 2);\n lcd.print(\"Doll house\");\n lcd.setCursor(0,1);\n lcd.print(\"lighting!\");\n\n pinMode(RED_PIN, OUTPUT);\n pinMode(GREEN_PIN, OUTPUT);\n pinMode(BLUE_PIN, OUTPUT);\n\n \/\/ initialize the NeoPixel strand\n strip.begin();\n strip.show();\n\n \/\/ Initialize the PWM board\n tlc.begin();\n tlc.write();\n\n \/\/ set defualt room brightness\n setDefaultLightLevel();\n\n \/\/ enable interrupts on buttons\n \/\/ The button interface is a Smartmaker 5A5 (annoying, but it works)\n enableInterrupt(A0, handleButtonOne, FALLING);\n enableInterrupt(A1, handleButtonTwo, FALLING);\n enableInterrupt(A2, handleButtonThree, FALLING);\n enableInterrupt(A3, handleButtonFour, FALLING);\n enableInterrupt(A4, handleButtonFive, FALLING);\n\n \/\/ mode FSM transitions\n modes.add_transition(&state_off_mode, &state_lighting_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_lighting_mode, &state_party_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_party_mode, &state_nitelite_mode, CHANGE_LIGHT_MODE, NULL);\n modes.add_transition(&state_nitelite_mode, &state_off_mode, CHANGE_LIGHT_MODE, NULL);\n\n \/\/ rooms FSM transitions\n \/\/ looping \"forward\" through the rooms\n rooms.add_transition(&state_all_rooms, &state_hall, NEXT_ROOM, NULL);\n rooms.add_transition(&state_hall, &state_living_room, NEXT_ROOM, NULL);\n rooms.add_transition(&state_living_room, &state_kitchen, NEXT_ROOM, NULL);\n rooms.add_transition(&state_kitchen, &state_bedroom, NEXT_ROOM, NULL);\n rooms.add_transition(&state_bedroom, &state_bathroom, NEXT_ROOM, NULL);\n rooms.add_transition(&state_bathroom, &state_attic, NEXT_ROOM, NULL);\n rooms.add_transition(&state_attic, &state_all_rooms, NEXT_ROOM, NULL);\n\n \/\/ looping \"backward\" through the rooms\n rooms.add_transition(&state_all_rooms, &state_attic, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_attic, &state_bathroom, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_bathroom, &state_bedroom, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_bedroom, &state_kitchen, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_kitchen, &state_living_room, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_living_room, &state_hall, PREVIOUS_ROOM, NULL);\n rooms.add_transition(&state_hall, &state_all_rooms, PREVIOUS_ROOM, NULL);\n\n \/\/ resetting to the default room (all rooms)\n rooms.add_transition(&state_hall, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_living_room, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_kitchen, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_bedroom, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_bathroom, &state_all_rooms, RESET_ROOMS, NULL);\n rooms.add_transition(&state_attic, &state_all_rooms, RESET_ROOMS, NULL);\n}\n\n\/\/ ***** Button event handlers ***** \/\/\n\n\/\/ Use button one to set the light mode for all rooms\nvoid handleButtonOne() {\n lcd.clear();\n rooms.trigger(RESET_ROOMS);\n modes.trigger(CHANGE_LIGHT_MODE);\n delay(debounceDelay);\n}\n\n\/\/ Use button two to increase brightness for the current room\nvoid handleButtonTwo() {\n setRoomBrightness(currentRoom, min(roomBrightness[currentRoom] + deltaLevel, maxLevel));\n printCurrentRoom();\n delay(debounceDelay);\n}\n\n\/\/ Use button three to select the previous room\nvoid handleButtonThree() {\n lcd.clear();\n rooms.trigger(PREVIOUS_ROOM);\n delay(debounceDelay);\n}\n\n\/\/ Use button four to decrease brightness for the current room\nvoid handleButtonFour() {\n setRoomBrightness(currentRoom, max(roomBrightness[currentRoom] - deltaLevel, minLevel));\n printCurrentRoom();\n delay(debounceDelay);\n}\n\n\/\/ Use button five to select the next room\nvoid handleButtonFive() {\n lcd.clear();\n rooms.trigger(NEXT_ROOM);\n delay(debounceDelay);\n}\n\n\/\/ ***** helpers ***** \/\/\n\nvoid setRGBColor(int red, int green, int blue) {\n int myRed = constrain(red, 0, 255);\n int myGreen = constrain(green, 0, 255);\n int myBlue = constrain(blue, 0, 255);\n\n analogWrite(RED_PIN, myRed);\n analogWrite(GREEN_PIN, myGreen);\n analogWrite(BLUE_PIN, myBlue);\n}\n\nvoid setRoomBrightness(int room, int level) {\n setRGBColor(0,0,level);\n roomBrightness[room] = level;\n tlc.setPWM(room * 3, roomBrightness[room] * maxLevel);\n tlc.write();\n}\n\nvoid setDefaultLightLevel() {\n setRGBColor(0,0,brightness);\n for (int i = 0; i != LastROOM; i++) {\n roomBrightness[i] = brightness;\n }\n}\n\nvoid setCurrentMode(int mode) {\n currentMode = mode;\n printCurrentMode();\n}\n\nvoid printCurrentMode() {\n lcd.clear();\n lcd.print(\"Mode: \");\n lcd.print(modeNames[currentMode]);\n}\n\nvoid setCurrentRoom(int room) {\n currentRoom = room;\n setRGBColor(0,0,roomBrightness[room]);\n printCurrentRoom();\n}\n\nvoid printCurrentRoom() {\n lcd.clear();\n lcd.print(\"room: \");\n lcd.print(roomNames[currentRoom]);\n lcd.setCursor(0,1);\n lcd.print(\"brightness: \");\n lcd.print(roomBrightness[currentRoom]);\n}\n\n\/\/ ***** FSM event handlers ***** \/\/\n\n\/\/ ---- lighting mode states ---- \/\/\n\nvoid on_lighting_mode_enter(){\n setCurrentMode(LIGHTING_MODE);\n}\n\nvoid on_lighting_mode_exit(){\n \n}\n\nvoid on_party_mode_enter(){\n setCurrentMode(PARTY_MODE);\n}\n\nvoid on_party_mode_exit(){\n \n}\n\nvoid on_nitelite_mode_enter(){\n setCurrentMode(NITELITE_MODE); \n}\n\nvoid on_nitelite_mode_exit(){\n\n}\n\nvoid on_off_mode_enter(){\n setCurrentMode(OFF_MODE); \n}\n\nvoid on_off_mode_exit(){\n\n}\n\n\/\/ ---- room selection states ---- \/\/\nvoid on_all_enter() {\n setCurrentRoom(ALL_ROOMS);\n}\n\nvoid on_all_exit() {\n \n}\n\nvoid on_hall_enter() {\n setCurrentRoom(HALL);\n}\n\nvoid on_hall_exit() {\n \n}\n\nvoid on_living_room_enter() {\n setCurrentRoom(LIVING_ROOM);\n}\n\nvoid on_living_room_exit() {\n \n}\n\nvoid on_kitchen_enter() {\n setCurrentRoom(KITCHEN);\n}\n\nvoid on_kitchen_exit() {\n \n}\n\nvoid on_bathroom_enter() {\n setCurrentRoom(BATHROOM);\n}\n\nvoid on_bathroom_exit() {\n \n}\n\nvoid on_bedroom_enter() {\n setCurrentRoom(BEDROOM);\n}\n\nvoid on_bedroom_exit() {\n \n}\n\nvoid on_attic_enter() {\n setCurrentRoom(ATTIC);\n}\n\nvoid on_attic_exit() {\n \n}\n\nvoid loop() {\n \/\/ do nothing; everything is handled via FSM events.\n \/\/ We also don't need to call the \".run_machine\" methods of\n \/\/ the FSMs as there are no \"on_state\" handlers or timed transitions\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The Cartographer Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"cartographer_ros\/offline_node.h\"\n\n#include <errno.h>\n#include <string.h>\n#include <sys\/resource.h>\n#include <time.h>\n#include <chrono>\n\n#include \"cartographer_ros\/node.h\"\n#include \"cartographer_ros\/playable_bag.h\"\n#include \"cartographer_ros\/split_string.h\"\n#include \"cartographer_ros\/urdf_reader.h\"\n#include \"gflags\/gflags.h\"\n#include \"ros\/callback_queue.h\"\n#include \"rosgraph_msgs\/Clock.h\"\n#include \"tf2_ros\/static_transform_broadcaster.h\"\n#include \"urdf\/model.h\"\n\nDEFINE_string(configuration_directory, \"\",\n \"First directory in which configuration files are searched, \"\n \"second is always the Cartographer installation to allow \"\n \"including files from there.\");\nDEFINE_string(\n configuration_basenames, \"\",\n \"Comma-separated list of basenames, i.e. not containing any \"\n \"directory prefix, of the configuration files for each trajectory. \"\n \"The first configuration file will be used for node options. \"\n \"If less configuration files are specified than trajectories, the \"\n \"first file will be used the remaining trajectories.\");\nDEFINE_string(\n bag_filenames, \"\",\n \"Comma-separated list of bags to process. One bag per trajectory. \"\n \"Any combination of simultaneous and sequential bags is supported.\");\nDEFINE_string(urdf_filenames, \"\",\n \"Comma-separated list of one or more URDF files that contain \"\n \"static links for the sensor configuration(s).\");\nDEFINE_bool(use_bag_transforms, true,\n \"Whether to read, use and republish transforms from bags.\");\nDEFINE_string(load_state_filename, \"\",\n \"If non-empty, filename of a .pbstream file to load, containing \"\n \"a saved SLAM state.\");\nDEFINE_bool(load_frozen_state, true,\n \"Load the saved state as frozen (non-optimized) trajectories.\");\nDEFINE_bool(keep_running, false,\n \"Keep running the offline node after all messages from the bag \"\n \"have been processed.\");\n\nnamespace cartographer_ros {\n\nconstexpr char kClockTopic[] = \"clock\";\nconstexpr char kTfStaticTopic[] = \"\/tf_static\";\nconstexpr char kTfTopic[] = \"tf\";\nconstexpr double kClockPublishFrequencySec = 1. \/ 30.;\nconstexpr int kSingleThreaded = 1;\n\/\/ We publish tf messages one second earlier than other messages. Under\n\/\/ the assumption of higher frequency tf this should ensure that tf can\n\/\/ always interpolate.\nconst ::ros::Duration kDelay = ::ros::Duration(1.0);\n\nvoid RunOfflineNode(const MapBuilderFactory& map_builder_factory) {\n CHECK(!FLAGS_configuration_directory.empty())\n << \"-configuration_directory is missing.\";\n CHECK(!FLAGS_configuration_basenames.empty())\n << \"-configuration_basenames is missing.\";\n CHECK(!(FLAGS_bag_filenames.empty() && FLAGS_load_state_filename.empty()))\n << \"-bag_filenames and -load_state_filename cannot both be unspecified.\";\n const auto bag_filenames =\n cartographer_ros::SplitString(FLAGS_bag_filenames, ',');\n cartographer_ros::NodeOptions node_options;\n const auto configuration_basenames =\n cartographer_ros::SplitString(FLAGS_configuration_basenames, ',');\n std::vector<TrajectoryOptions> bag_trajectory_options(1);\n std::tie(node_options, bag_trajectory_options.at(0)) =\n LoadOptions(FLAGS_configuration_directory, configuration_basenames.at(0));\n\n for (size_t bag_index = 1; bag_index < bag_filenames.size(); ++bag_index) {\n TrajectoryOptions current_trajectory_options;\n if (bag_index < configuration_basenames.size()) {\n std::tie(std::ignore, current_trajectory_options) = LoadOptions(\n FLAGS_configuration_directory, configuration_basenames.at(bag_index));\n } else {\n current_trajectory_options = bag_trajectory_options.at(0);\n }\n bag_trajectory_options.push_back(current_trajectory_options);\n }\n if (bag_filenames.size() > 0) {\n CHECK_EQ(bag_trajectory_options.size(), bag_filenames.size());\n }\n\n \/\/ Since we preload the transform buffer, we should never have to wait for a\n \/\/ transform. When we finish processing the bag, we will simply drop any\n \/\/ remaining sensor data that cannot be transformed due to missing transforms.\n node_options.lookup_transform_timeout_sec = 0.;\n\n auto map_builder = map_builder_factory(node_options.map_builder_options);\n\n const std::chrono::time_point<std::chrono::steady_clock> start_time =\n std::chrono::steady_clock::now();\n\n tf2_ros::Buffer tf_buffer;\n\n std::vector<geometry_msgs::TransformStamped> urdf_transforms;\n for (const std::string& urdf_filename :\n cartographer_ros::SplitString(FLAGS_urdf_filenames, ',')) {\n const auto current_urdf_transforms =\n ReadStaticTransformsFromUrdf(urdf_filename, &tf_buffer);\n urdf_transforms.insert(urdf_transforms.end(),\n current_urdf_transforms.begin(),\n current_urdf_transforms.end());\n }\n\n tf_buffer.setUsingDedicatedThread(true);\n\n Node node(node_options, std::move(map_builder), &tf_buffer);\n if (!FLAGS_load_state_filename.empty()) {\n node.LoadState(FLAGS_load_state_filename, FLAGS_load_frozen_state);\n }\n\n ::ros::Publisher tf_publisher =\n node.node_handle()->advertise<tf2_msgs::TFMessage>(\n kTfTopic, kLatestOnlyPublisherQueueSize);\n\n ::tf2_ros::StaticTransformBroadcaster static_tf_broadcaster;\n\n ::ros::Publisher clock_publisher =\n node.node_handle()->advertise<rosgraph_msgs::Clock>(\n kClockTopic, kLatestOnlyPublisherQueueSize);\n\n if (urdf_transforms.size() > 0) {\n static_tf_broadcaster.sendTransform(urdf_transforms);\n }\n\n ros::AsyncSpinner async_spinner(kSingleThreaded);\n async_spinner.start();\n rosgraph_msgs::Clock clock;\n auto clock_republish_timer = node.node_handle()->createWallTimer(\n ::ros::WallDuration(kClockPublishFrequencySec),\n [&clock_publisher, &clock](const ::ros::WallTimerEvent&) {\n clock_publisher.publish(clock);\n },\n false \/* oneshot *\/, false \/* autostart *\/);\n\n auto bag_expected_sensor_ids =\n node.ComputeDefaultSensorIdsForMultipleBags(bag_trajectory_options);\n std::map<std::pair<int \/* bag_index *\/, std::string>,\n cartographer::mapping::TrajectoryBuilderInterface::SensorId>\n bag_topic_to_sensor_id;\n PlayableBagMultiplexer playable_bag_multiplexer;\n for (size_t current_bag_index = 0; current_bag_index < bag_filenames.size();\n ++current_bag_index) {\n const std::string& bag_filename = bag_filenames.at(current_bag_index);\n if (!::ros::ok()) {\n return;\n }\n for (const auto& expected_sensor_id :\n bag_expected_sensor_ids.at(current_bag_index)) {\n const auto bag_resolved_topic = std::make_pair(\n static_cast<int>(current_bag_index),\n node.node_handle()->resolveName(expected_sensor_id.id));\n if (bag_topic_to_sensor_id.count(bag_resolved_topic) != 0) {\n LOG(ERROR) << \"Sensor \" << expected_sensor_id.id << \" of bag \"\n << current_bag_index << \" resolves to topic \"\n << bag_resolved_topic.second << \" which is already used by \"\n << \" sensor \"\n << bag_topic_to_sensor_id.at(bag_resolved_topic).id;\n }\n bag_topic_to_sensor_id[bag_resolved_topic] = expected_sensor_id;\n }\n\n playable_bag_multiplexer.AddPlayableBag(PlayableBag(\n bag_filename, current_bag_index, ros::TIME_MIN, ros::TIME_MAX, kDelay,\n \/\/ PlayableBag::FilteringEarlyMessageHandler is used to get an early\n \/\/ peek at the tf messages in the bag and insert them into 'tf_buffer'.\n \/\/ When a message is retrieved by GetNextMessage() further below,\n \/\/ we will have already inserted further 'kDelay' seconds worth of\n \/\/ transforms into 'tf_buffer' via this lambda.\n [&tf_publisher, &tf_buffer](const rosbag::MessageInstance& msg) {\n if (msg.isType<tf2_msgs::TFMessage>()) {\n if (FLAGS_use_bag_transforms) {\n const auto tf_message = msg.instantiate<tf2_msgs::TFMessage>();\n tf_publisher.publish(tf_message);\n\n for (const auto& transform : tf_message->transforms) {\n try {\n \/\/ We need to keep 'tf_buffer' small because it becomes very\n \/\/ inefficient otherwise. We make sure that tf_messages are\n \/\/ published before any data messages, so that tf lookups\n \/\/ always work.\n tf_buffer.setTransform(transform, \"unused_authority\",\n msg.getTopic() == kTfStaticTopic);\n } catch (const tf2::TransformException& ex) {\n LOG(WARNING) << ex.what();\n }\n }\n }\n \/\/ Tell 'PlayableBag' to filter the tf message since there is no\n \/\/ further use for it.\n return false;\n } else {\n return true;\n }\n }));\n }\n\n \/\/ TODO(gaschler): Warn if resolved topics are not in bags.\n std::unordered_map<int, int> bag_index_to_trajectory_id;\n while (playable_bag_multiplexer.IsMessageAvailable()) {\n const auto next_msg_tuple = playable_bag_multiplexer.GetNextMessage();\n const rosbag::MessageInstance& msg = std::get<0>(next_msg_tuple);\n const int bag_index = std::get<1>(next_msg_tuple);\n const bool is_last_message_in_bag = std::get<2>(next_msg_tuple);\n\n int trajectory_id;\n \/\/ Lazily add trajectories only when the first message arrives in order\n \/\/ to avoid blocking the sensor queue.\n if (bag_index_to_trajectory_id.count(bag_index) == 0) {\n trajectory_id =\n node.AddOfflineTrajectory(bag_expected_sensor_ids.at(bag_index),\n bag_trajectory_options.at(bag_index));\n CHECK(bag_index_to_trajectory_id\n .emplace(std::piecewise_construct,\n std::forward_as_tuple(bag_index),\n std::forward_as_tuple(trajectory_id))\n .second);\n LOG(INFO) << \"Assigned trajectory \" << trajectory_id << \" to bag \"\n << bag_filenames.at(bag_index);\n } else {\n trajectory_id = bag_index_to_trajectory_id.at(bag_index);\n }\n\n if (!::ros::ok()) {\n return;\n }\n const auto bag_topic = std::make_pair(\n bag_index,\n node.node_handle()->resolveName(msg.getTopic(), false \/* resolve *\/));\n auto it = bag_topic_to_sensor_id.find(bag_topic);\n if (it != bag_topic_to_sensor_id.end()) {\n const std::string& sensor_id = it->second.id;\n if (msg.isType<sensor_msgs::LaserScan>()) {\n node.HandleLaserScanMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::LaserScan>());\n }\n if (msg.isType<sensor_msgs::MultiEchoLaserScan>()) {\n node.HandleMultiEchoLaserScanMessage(\n trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::MultiEchoLaserScan>());\n }\n if (msg.isType<sensor_msgs::PointCloud2>()) {\n node.HandlePointCloud2Message(\n trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::PointCloud2>());\n }\n if (msg.isType<sensor_msgs::Imu>()) {\n node.HandleImuMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::Imu>());\n }\n if (msg.isType<nav_msgs::Odometry>()) {\n node.HandleOdometryMessage(trajectory_id, sensor_id,\n msg.instantiate<nav_msgs::Odometry>());\n }\n if (msg.isType<sensor_msgs::NavSatFix>()) {\n node.HandleNavSatFixMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::NavSatFix>());\n }\n }\n clock.clock = msg.getTime();\n clock_publisher.publish(clock);\n\n if (is_last_message_in_bag) {\n node.FinishTrajectory(trajectory_id);\n }\n }\n\n \/\/ Ensure the clock is republished after the bag has been finished, during the\n \/\/ final optimization, serialization, and optional indefinite spinning at the\n \/\/ end.\n clock_republish_timer.start();\n node.RunFinalOptimization();\n\n const std::chrono::time_point<std::chrono::steady_clock> end_time =\n std::chrono::steady_clock::now();\n const double wall_clock_seconds =\n std::chrono::duration_cast<std::chrono::duration<double>>(end_time -\n start_time)\n .count();\n\n LOG(INFO) << \"Elapsed wall clock time: \" << wall_clock_seconds << \" s\";\n#ifdef __linux__\n timespec cpu_timespec = {};\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &cpu_timespec);\n LOG(INFO) << \"Elapsed CPU time: \"\n << (cpu_timespec.tv_sec + 1e-9 * cpu_timespec.tv_nsec) << \" s\";\n rusage usage;\n CHECK_EQ(getrusage(RUSAGE_SELF, &usage), 0) << strerror(errno);\n LOG(INFO) << \"Peak memory usage: \" << usage.ru_maxrss << \" KiB\";\n#endif\n\n if (::ros::ok() && bag_filenames.size() > 0) {\n const std::string output_filename = bag_filenames.front();\n const std::string suffix = \".pbstream\";\n const std::string state_output_filename = output_filename + suffix;\n LOG(INFO) << \"Writing state to '\" << state_output_filename << \"'...\";\n node.SerializeState(state_output_filename);\n }\n if (FLAGS_keep_running) {\n ::ros::waitForShutdown();\n }\n}\n\n} \/\/ namespace cartographer_ros\n<commit_msg>Offline multi-trajectory: use topic names without 'bag_n_' prefix by default (#707)<commit_after>\/*\n * Copyright 2018 The Cartographer Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"cartographer_ros\/offline_node.h\"\n\n#include <errno.h>\n#include <string.h>\n#include <sys\/resource.h>\n#include <time.h>\n#include <chrono>\n\n#include \"cartographer_ros\/node.h\"\n#include \"cartographer_ros\/playable_bag.h\"\n#include \"cartographer_ros\/split_string.h\"\n#include \"cartographer_ros\/urdf_reader.h\"\n#include \"gflags\/gflags.h\"\n#include \"ros\/callback_queue.h\"\n#include \"rosgraph_msgs\/Clock.h\"\n#include \"tf2_ros\/static_transform_broadcaster.h\"\n#include \"urdf\/model.h\"\n\nDEFINE_string(configuration_directory, \"\",\n \"First directory in which configuration files are searched, \"\n \"second is always the Cartographer installation to allow \"\n \"including files from there.\");\nDEFINE_string(\n configuration_basenames, \"\",\n \"Comma-separated list of basenames, i.e. not containing any \"\n \"directory prefix, of the configuration files for each trajectory. \"\n \"The first configuration file will be used for node options. \"\n \"If less configuration files are specified than trajectories, the \"\n \"first file will be used the remaining trajectories.\");\nDEFINE_string(\n bag_filenames, \"\",\n \"Comma-separated list of bags to process. One bag per trajectory. \"\n \"Any combination of simultaneous and sequential bags is supported.\");\nDEFINE_string(urdf_filenames, \"\",\n \"Comma-separated list of one or more URDF files that contain \"\n \"static links for the sensor configuration(s).\");\nDEFINE_bool(use_bag_transforms, true,\n \"Whether to read, use and republish transforms from bags.\");\nDEFINE_string(load_state_filename, \"\",\n \"If non-empty, filename of a .pbstream file to load, containing \"\n \"a saved SLAM state.\");\nDEFINE_bool(load_frozen_state, true,\n \"Load the saved state as frozen (non-optimized) trajectories.\");\nDEFINE_bool(keep_running, false,\n \"Keep running the offline node after all messages from the bag \"\n \"have been processed.\");\n\nnamespace cartographer_ros {\n\nconstexpr char kClockTopic[] = \"clock\";\nconstexpr char kTfStaticTopic[] = \"\/tf_static\";\nconstexpr char kTfTopic[] = \"tf\";\nconstexpr double kClockPublishFrequencySec = 1. \/ 30.;\nconstexpr int kSingleThreaded = 1;\n\/\/ We publish tf messages one second earlier than other messages. Under\n\/\/ the assumption of higher frequency tf this should ensure that tf can\n\/\/ always interpolate.\nconst ::ros::Duration kDelay = ::ros::Duration(1.0);\n\nvoid RunOfflineNode(const MapBuilderFactory& map_builder_factory) {\n CHECK(!FLAGS_configuration_directory.empty())\n << \"-configuration_directory is missing.\";\n CHECK(!FLAGS_configuration_basenames.empty())\n << \"-configuration_basenames is missing.\";\n CHECK(!(FLAGS_bag_filenames.empty() && FLAGS_load_state_filename.empty()))\n << \"-bag_filenames and -load_state_filename cannot both be unspecified.\";\n const auto bag_filenames =\n cartographer_ros::SplitString(FLAGS_bag_filenames, ',');\n cartographer_ros::NodeOptions node_options;\n const auto configuration_basenames =\n cartographer_ros::SplitString(FLAGS_configuration_basenames, ',');\n std::vector<TrajectoryOptions> bag_trajectory_options(1);\n std::tie(node_options, bag_trajectory_options.at(0)) =\n LoadOptions(FLAGS_configuration_directory, configuration_basenames.at(0));\n\n for (size_t bag_index = 1; bag_index < bag_filenames.size(); ++bag_index) {\n TrajectoryOptions current_trajectory_options;\n if (bag_index < configuration_basenames.size()) {\n std::tie(std::ignore, current_trajectory_options) = LoadOptions(\n FLAGS_configuration_directory, configuration_basenames.at(bag_index));\n } else {\n current_trajectory_options = bag_trajectory_options.at(0);\n }\n bag_trajectory_options.push_back(current_trajectory_options);\n }\n if (bag_filenames.size() > 0) {\n CHECK_EQ(bag_trajectory_options.size(), bag_filenames.size());\n }\n\n \/\/ Since we preload the transform buffer, we should never have to wait for a\n \/\/ transform. When we finish processing the bag, we will simply drop any\n \/\/ remaining sensor data that cannot be transformed due to missing transforms.\n node_options.lookup_transform_timeout_sec = 0.;\n\n auto map_builder = map_builder_factory(node_options.map_builder_options);\n\n const std::chrono::time_point<std::chrono::steady_clock> start_time =\n std::chrono::steady_clock::now();\n\n tf2_ros::Buffer tf_buffer;\n\n std::vector<geometry_msgs::TransformStamped> urdf_transforms;\n for (const std::string& urdf_filename :\n cartographer_ros::SplitString(FLAGS_urdf_filenames, ',')) {\n const auto current_urdf_transforms =\n ReadStaticTransformsFromUrdf(urdf_filename, &tf_buffer);\n urdf_transforms.insert(urdf_transforms.end(),\n current_urdf_transforms.begin(),\n current_urdf_transforms.end());\n }\n\n tf_buffer.setUsingDedicatedThread(true);\n\n Node node(node_options, std::move(map_builder), &tf_buffer);\n if (!FLAGS_load_state_filename.empty()) {\n node.LoadState(FLAGS_load_state_filename, FLAGS_load_frozen_state);\n }\n\n ::ros::Publisher tf_publisher =\n node.node_handle()->advertise<tf2_msgs::TFMessage>(\n kTfTopic, kLatestOnlyPublisherQueueSize);\n\n ::tf2_ros::StaticTransformBroadcaster static_tf_broadcaster;\n\n ::ros::Publisher clock_publisher =\n node.node_handle()->advertise<rosgraph_msgs::Clock>(\n kClockTopic, kLatestOnlyPublisherQueueSize);\n\n if (urdf_transforms.size() > 0) {\n static_tf_broadcaster.sendTransform(urdf_transforms);\n }\n\n ros::AsyncSpinner async_spinner(kSingleThreaded);\n async_spinner.start();\n rosgraph_msgs::Clock clock;\n auto clock_republish_timer = node.node_handle()->createWallTimer(\n ::ros::WallDuration(kClockPublishFrequencySec),\n [&clock_publisher, &clock](const ::ros::WallTimerEvent&) {\n clock_publisher.publish(clock);\n },\n false \/* oneshot *\/, false \/* autostart *\/);\n\n std::vector<\n std::set<cartographer::mapping::TrajectoryBuilderInterface::SensorId>>\n bag_expected_sensor_ids;\n if (configuration_basenames.size() == 1) {\n const auto current_bag_expected_sensor_ids =\n node.ComputeDefaultSensorIdsForMultipleBags(\n {bag_trajectory_options.front()});\n bag_expected_sensor_ids = {bag_filenames.size(),\n current_bag_expected_sensor_ids.front()};\n } else {\n bag_expected_sensor_ids =\n node.ComputeDefaultSensorIdsForMultipleBags(bag_trajectory_options);\n }\n CHECK_EQ(bag_expected_sensor_ids.size(), bag_filenames.size());\n\n std::map<std::pair<int \/* bag_index *\/, std::string>,\n cartographer::mapping::TrajectoryBuilderInterface::SensorId>\n bag_topic_to_sensor_id;\n PlayableBagMultiplexer playable_bag_multiplexer;\n for (size_t current_bag_index = 0; current_bag_index < bag_filenames.size();\n ++current_bag_index) {\n const std::string& bag_filename = bag_filenames.at(current_bag_index);\n if (!::ros::ok()) {\n return;\n }\n for (const auto& expected_sensor_id :\n bag_expected_sensor_ids.at(current_bag_index)) {\n const auto bag_resolved_topic = std::make_pair(\n static_cast<int>(current_bag_index),\n node.node_handle()->resolveName(expected_sensor_id.id));\n if (bag_topic_to_sensor_id.count(bag_resolved_topic) != 0) {\n LOG(ERROR) << \"Sensor \" << expected_sensor_id.id << \" of bag \"\n << current_bag_index << \" resolves to topic \"\n << bag_resolved_topic.second << \" which is already used by \"\n << \" sensor \"\n << bag_topic_to_sensor_id.at(bag_resolved_topic).id;\n }\n bag_topic_to_sensor_id[bag_resolved_topic] = expected_sensor_id;\n }\n\n playable_bag_multiplexer.AddPlayableBag(PlayableBag(\n bag_filename, current_bag_index, ros::TIME_MIN, ros::TIME_MAX, kDelay,\n \/\/ PlayableBag::FilteringEarlyMessageHandler is used to get an early\n \/\/ peek at the tf messages in the bag and insert them into 'tf_buffer'.\n \/\/ When a message is retrieved by GetNextMessage() further below,\n \/\/ we will have already inserted further 'kDelay' seconds worth of\n \/\/ transforms into 'tf_buffer' via this lambda.\n [&tf_publisher, &tf_buffer](const rosbag::MessageInstance& msg) {\n if (msg.isType<tf2_msgs::TFMessage>()) {\n if (FLAGS_use_bag_transforms) {\n const auto tf_message = msg.instantiate<tf2_msgs::TFMessage>();\n tf_publisher.publish(tf_message);\n\n for (const auto& transform : tf_message->transforms) {\n try {\n \/\/ We need to keep 'tf_buffer' small because it becomes very\n \/\/ inefficient otherwise. We make sure that tf_messages are\n \/\/ published before any data messages, so that tf lookups\n \/\/ always work.\n tf_buffer.setTransform(transform, \"unused_authority\",\n msg.getTopic() == kTfStaticTopic);\n } catch (const tf2::TransformException& ex) {\n LOG(WARNING) << ex.what();\n }\n }\n }\n \/\/ Tell 'PlayableBag' to filter the tf message since there is no\n \/\/ further use for it.\n return false;\n } else {\n return true;\n }\n }));\n }\n\n \/\/ TODO(gaschler): Warn if resolved topics are not in bags.\n std::unordered_map<int, int> bag_index_to_trajectory_id;\n while (playable_bag_multiplexer.IsMessageAvailable()) {\n const auto next_msg_tuple = playable_bag_multiplexer.GetNextMessage();\n const rosbag::MessageInstance& msg = std::get<0>(next_msg_tuple);\n const int bag_index = std::get<1>(next_msg_tuple);\n const bool is_last_message_in_bag = std::get<2>(next_msg_tuple);\n\n int trajectory_id;\n \/\/ Lazily add trajectories only when the first message arrives in order\n \/\/ to avoid blocking the sensor queue.\n if (bag_index_to_trajectory_id.count(bag_index) == 0) {\n trajectory_id =\n node.AddOfflineTrajectory(bag_expected_sensor_ids.at(bag_index),\n bag_trajectory_options.at(bag_index));\n CHECK(bag_index_to_trajectory_id\n .emplace(std::piecewise_construct,\n std::forward_as_tuple(bag_index),\n std::forward_as_tuple(trajectory_id))\n .second);\n LOG(INFO) << \"Assigned trajectory \" << trajectory_id << \" to bag \"\n << bag_filenames.at(bag_index);\n } else {\n trajectory_id = bag_index_to_trajectory_id.at(bag_index);\n }\n\n if (!::ros::ok()) {\n return;\n }\n const auto bag_topic = std::make_pair(\n bag_index,\n node.node_handle()->resolveName(msg.getTopic(), false \/* resolve *\/));\n auto it = bag_topic_to_sensor_id.find(bag_topic);\n if (it != bag_topic_to_sensor_id.end()) {\n const std::string& sensor_id = it->second.id;\n if (msg.isType<sensor_msgs::LaserScan>()) {\n node.HandleLaserScanMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::LaserScan>());\n }\n if (msg.isType<sensor_msgs::MultiEchoLaserScan>()) {\n node.HandleMultiEchoLaserScanMessage(\n trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::MultiEchoLaserScan>());\n }\n if (msg.isType<sensor_msgs::PointCloud2>()) {\n node.HandlePointCloud2Message(\n trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::PointCloud2>());\n }\n if (msg.isType<sensor_msgs::Imu>()) {\n node.HandleImuMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::Imu>());\n }\n if (msg.isType<nav_msgs::Odometry>()) {\n node.HandleOdometryMessage(trajectory_id, sensor_id,\n msg.instantiate<nav_msgs::Odometry>());\n }\n if (msg.isType<sensor_msgs::NavSatFix>()) {\n node.HandleNavSatFixMessage(trajectory_id, sensor_id,\n msg.instantiate<sensor_msgs::NavSatFix>());\n }\n }\n clock.clock = msg.getTime();\n clock_publisher.publish(clock);\n\n if (is_last_message_in_bag) {\n node.FinishTrajectory(trajectory_id);\n }\n }\n\n \/\/ Ensure the clock is republished after the bag has been finished, during the\n \/\/ final optimization, serialization, and optional indefinite spinning at the\n \/\/ end.\n clock_republish_timer.start();\n node.RunFinalOptimization();\n\n const std::chrono::time_point<std::chrono::steady_clock> end_time =\n std::chrono::steady_clock::now();\n const double wall_clock_seconds =\n std::chrono::duration_cast<std::chrono::duration<double>>(end_time -\n start_time)\n .count();\n\n LOG(INFO) << \"Elapsed wall clock time: \" << wall_clock_seconds << \" s\";\n#ifdef __linux__\n timespec cpu_timespec = {};\n clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &cpu_timespec);\n LOG(INFO) << \"Elapsed CPU time: \"\n << (cpu_timespec.tv_sec + 1e-9 * cpu_timespec.tv_nsec) << \" s\";\n rusage usage;\n CHECK_EQ(getrusage(RUSAGE_SELF, &usage), 0) << strerror(errno);\n LOG(INFO) << \"Peak memory usage: \" << usage.ru_maxrss << \" KiB\";\n#endif\n\n if (::ros::ok() && bag_filenames.size() > 0) {\n const std::string output_filename = bag_filenames.front();\n const std::string suffix = \".pbstream\";\n const std::string state_output_filename = output_filename + suffix;\n LOG(INFO) << \"Writing state to '\" << state_output_filename << \"'...\";\n node.SerializeState(state_output_filename);\n }\n if (FLAGS_keep_running) {\n ::ros::waitForShutdown();\n }\n}\n\n} \/\/ namespace cartographer_ros\n<|endoftext|>"} {"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n * OpenSim: Controller.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2016 Stanford University and the Authors *\n * Author(s): Ajay Seth, Frank C. Anderson, Chand T. John, Samuel R. Hamner *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/\/=============================================================================\n\/\/ INCLUDES\n\/\/=============================================================================\n#include \"Controller.h\"\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Simulation\/Model\/Actuator.h>\n#include <OpenSim\/Common\/IO.h>\n\n\/\/=============================================================================\n\/\/ STATICS\n\/\/=============================================================================\n\nusing namespace OpenSim;\nusing namespace std;\n\n\n\/\/=============================================================================\n\/\/ CONSTRUCTOR(S) AND DESTRUCTOR\n\/\/=============================================================================\n\/\/_____________________________________________________________________________\n\/**\n * Default constructor.\n *\/\nController::Controller() \n{\n constructProperties();\n}\n\n\n\/\/=============================================================================\n\/\/ CONSTRUCTION\n\/\/=============================================================================\n\/\/_____________________________________________________________________________\n\/\/_____________________________________________________________________________\n\/**\n * Connect properties to local pointers.\n *\/\nvoid Controller::constructProperties()\n{\n setAuthors(\"Ajay Seth, Frank Anderson, Chand John, Samuel Hamner\");\n constructProperty_enabled(true);\n constructProperty_actuator_list();\n\n \/\/ Set is only a reference list, not ownership\n _actuatorSet.setMemoryOwner(false);\n}\n\nvoid Controller::updateFromXMLNode(SimTK::Xml::Element& node,\n int versionNumber) {\n if(versionNumber < XMLDocument::getLatestVersion()) {\n if(versionNumber < 30510) {\n \/\/ Rename property 'isDisabled' to 'appliesForce' and\n \/\/ negate the contained value.\n std::string oldName{\"isDisabled\"};\n std::string newName{\"enabled\"};\n if(node.hasElement(oldName)) {\n auto elem = node.getRequiredElement(oldName);\n elem.setElementTag(newName);\n if(elem.getValue().find(\"true\") != std::string::npos)\n elem.setValue(\"false\");\n else\n elem.setValue(\"true\");\n }\n }\n }\n\n Super::updateFromXMLNode(node, versionNumber);\n}\n\n\/\/=============================================================================\n\/\/ GET AND SET\n\/\/=============================================================================\n\n\/\/-----------------------------------------------------------------------------\n\/\/ ON\/OFF\n\/\/-----------------------------------------------------------------------------\n\/\/_____________________________________________________________________________\n\/**\n * Get whether or not this controller is enabled.\n *\/\nbool Controller::isEnabled() const\n{\n if( getModel().getAllControllersEnabled() ) {\n return( get_enabled() );\n } else {\n return( false );\n }\n}\n\/\/_____________________________________________________________________________\n\/**\n * Turn this controller on or off.\n *\/\nvoid Controller::setEnabled(bool aTrueFalse)\n{\n upd_enabled() = aTrueFalse;\n}\n\n\/\/ for any post XML deserialization initialization\nvoid Controller::extendConnectToModel(Model& model)\n{\n Super::extendConnectToModel(model);\n\n \/\/ TODO this custom connection code can all disappear\n \/\/ if we use a list Connector<Actuator> \n\n \/\/ make sure controller does not take ownership\n _actuatorSet.setMemoryOwner(false);\n _actuatorSet.setSize(0);\n\n int nac = getProperty_actuator_list().size();\n if (nac == 0)\n return;\n \n auto actuators = model.getComponentList<Actuator>();\n if (IO::Uppercase(get_actuator_list(0)) == \"ALL\"){\n for (auto& actuator : actuators) {\n _actuatorSet.adoptAndAppend(&actuator);\n }\n return;\n }\n else{\n for (int i = 0; i < nac; ++i) {\n bool found = false;\n for (auto& actuator : actuators) {\n if (get_actuator_list(i) == actuator.getName()) {\n _actuatorSet.adoptAndAppend(&actuator);\n found = true;\n break;\n }\n }\n if (!found) {\n cerr << \"WARN: Controller::connectToModel : Actuator \"\n << get_actuator_list(i) <<\n \" was not found and will be ignored.\" << endl;\n }\n }\n }\n}\n\n\/**\n * Create a Controller in the SimTK::System\n *\/\nvoid Controller::extendAddToSystem(SimTK::MultibodySystem& system) const\n{\n Super::extendAddToSystem(system);\n}\n\n\/\/ makes a request for which actuators a controller will control\nvoid Controller::setActuators(const Set<Actuator>& actuators)\n{\n \/\/TODO this needs to be setting a Connector list of Actuators\n\n \/\/ make sure controller does NOT assume ownership\n _actuatorSet.setMemoryOwner(false);\n \/\/Rebuild consistent set of actuator lists\n _actuatorSet.setSize(0);\n updProperty_actuator_list().clear();\n for (int i = 0; i< actuators.getSize(); i++){\n addActuator(actuators[i]);\n }\n}\n\n\nvoid Controller::addActuator(const Actuator& actuator)\n{\n _actuatorSet.adoptAndAppend(&actuator);\n\n int found = updProperty_actuator_list().findIndex(actuator.getName());\n if (found < 0) \/\/add if the actuator isn't already in the list\n updProperty_actuator_list().appendValue(actuator.getName());\n}\n\nSet<const Actuator>& Controller::updActuators() { return _actuatorSet; }\n\nconst Set<const Actuator>& Controller::getActuatorSet() const { return _actuatorSet; }\n<commit_msg>Toggle value only if there is one.<commit_after>\/* -------------------------------------------------------------------------- *\n * OpenSim: Controller.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2016 Stanford University and the Authors *\n * Author(s): Ajay Seth, Frank C. Anderson, Chand T. John, Samuel R. Hamner *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/\/=============================================================================\n\/\/ INCLUDES\n\/\/=============================================================================\n#include \"Controller.h\"\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Simulation\/Model\/Actuator.h>\n#include <OpenSim\/Common\/IO.h>\n\n\/\/=============================================================================\n\/\/ STATICS\n\/\/=============================================================================\n\nusing namespace OpenSim;\nusing namespace std;\n\n\n\/\/=============================================================================\n\/\/ CONSTRUCTOR(S) AND DESTRUCTOR\n\/\/=============================================================================\n\/\/_____________________________________________________________________________\n\/**\n * Default constructor.\n *\/\nController::Controller() \n{\n constructProperties();\n}\n\n\n\/\/=============================================================================\n\/\/ CONSTRUCTION\n\/\/=============================================================================\n\/\/_____________________________________________________________________________\n\/\/_____________________________________________________________________________\n\/**\n * Connect properties to local pointers.\n *\/\nvoid Controller::constructProperties()\n{\n setAuthors(\"Ajay Seth, Frank Anderson, Chand John, Samuel Hamner\");\n constructProperty_enabled(true);\n constructProperty_actuator_list();\n\n \/\/ Set is only a reference list, not ownership\n _actuatorSet.setMemoryOwner(false);\n}\n\nvoid Controller::updateFromXMLNode(SimTK::Xml::Element& node,\n int versionNumber) {\n if(versionNumber < XMLDocument::getLatestVersion()) {\n if(versionNumber < 30510) {\n \/\/ Rename property 'isDisabled' to 'appliesForce' and\n \/\/ negate the contained value.\n std::string oldName{\"isDisabled\"};\n std::string newName{\"enabled\"};\n if(node.hasElement(oldName)) {\n auto elem = node.getRequiredElement(oldName);\n elem.setElementTag(newName);\n if(elem.getValue().find(\"true\") != std::string::npos)\n elem.setValue(\"false\");\n else if(elem.getValue().find(\"false\") != std::string::npos)\n elem.setValue(\"true\");\n }\n }\n }\n\n Super::updateFromXMLNode(node, versionNumber);\n}\n\n\/\/=============================================================================\n\/\/ GET AND SET\n\/\/=============================================================================\n\n\/\/-----------------------------------------------------------------------------\n\/\/ ON\/OFF\n\/\/-----------------------------------------------------------------------------\n\/\/_____________________________________________________________________________\n\/**\n * Get whether or not this controller is enabled.\n *\/\nbool Controller::isEnabled() const\n{\n if( getModel().getAllControllersEnabled() ) {\n return( get_enabled() );\n } else {\n return( false );\n }\n}\n\/\/_____________________________________________________________________________\n\/**\n * Turn this controller on or off.\n *\/\nvoid Controller::setEnabled(bool aTrueFalse)\n{\n upd_enabled() = aTrueFalse;\n}\n\n\/\/ for any post XML deserialization initialization\nvoid Controller::extendConnectToModel(Model& model)\n{\n Super::extendConnectToModel(model);\n\n \/\/ TODO this custom connection code can all disappear\n \/\/ if we use a list Connector<Actuator> \n\n \/\/ make sure controller does not take ownership\n _actuatorSet.setMemoryOwner(false);\n _actuatorSet.setSize(0);\n\n int nac = getProperty_actuator_list().size();\n if (nac == 0)\n return;\n \n auto actuators = model.getComponentList<Actuator>();\n if (IO::Uppercase(get_actuator_list(0)) == \"ALL\"){\n for (auto& actuator : actuators) {\n _actuatorSet.adoptAndAppend(&actuator);\n }\n return;\n }\n else{\n for (int i = 0; i < nac; ++i) {\n bool found = false;\n for (auto& actuator : actuators) {\n if (get_actuator_list(i) == actuator.getName()) {\n _actuatorSet.adoptAndAppend(&actuator);\n found = true;\n break;\n }\n }\n if (!found) {\n cerr << \"WARN: Controller::connectToModel : Actuator \"\n << get_actuator_list(i) <<\n \" was not found and will be ignored.\" << endl;\n }\n }\n }\n}\n\n\/**\n * Create a Controller in the SimTK::System\n *\/\nvoid Controller::extendAddToSystem(SimTK::MultibodySystem& system) const\n{\n Super::extendAddToSystem(system);\n}\n\n\/\/ makes a request for which actuators a controller will control\nvoid Controller::setActuators(const Set<Actuator>& actuators)\n{\n \/\/TODO this needs to be setting a Connector list of Actuators\n\n \/\/ make sure controller does NOT assume ownership\n _actuatorSet.setMemoryOwner(false);\n \/\/Rebuild consistent set of actuator lists\n _actuatorSet.setSize(0);\n updProperty_actuator_list().clear();\n for (int i = 0; i< actuators.getSize(); i++){\n addActuator(actuators[i]);\n }\n}\n\n\nvoid Controller::addActuator(const Actuator& actuator)\n{\n _actuatorSet.adoptAndAppend(&actuator);\n\n int found = updProperty_actuator_list().findIndex(actuator.getName());\n if (found < 0) \/\/add if the actuator isn't already in the list\n updProperty_actuator_list().appendValue(actuator.getName());\n}\n\nSet<const Actuator>& Controller::updActuators() { return _actuatorSet; }\n\nconst Set<const Actuator>& Controller::getActuatorSet() const { return _actuatorSet; }\n<|endoftext|>"} {"text":"<commit_before>\n#include <cstring>\n\n#ifdef DEBUG\n#include <mutex>\n#endif\n\n#include \"result.h\"\n#include \"solutions.h\"\n\n#ifdef DEBUG\nextern std::mutex debug_mutex;\n#endif\n\nconst Result * Solutions::find(const double *ip, const Sense sense) const {\n bool t1,t3;\n for (auto& res: store_) {\n\n t1 = true;\n t3 = true;\n if (sense == MIN) {\n for (int i = 0; i < objective_count; i++){\n \/* t1: All values of candidate must be >= than ip *\/\n if (res->ip[i] < ip[i]) {\n t1 = false;\n break;\n }\n \/* t3: All values of candidate result must be <= than ip *\/\n if (!res->infeasible) {\n if (res->result[i] > ip[i]) {\n t3 = false;\n break;\n }\n }\n }\n } else {\n for (int i = 0; i < objective_count; i++){\n \/* t1: All values of candidate must be <= than ip *\/\n if (res->ip[i] > ip[i]) {\n t1 = false;\n break;\n }\n \/* t3: All values of candidate result must be >= than ip *\/\n if (!res->infeasible) {\n if (res->result[i] < ip[i]) {\n t3 = false;\n break;\n }\n }\n }\n }\n \/* If all conditions are met copy problem & solution and return *\/\n if (t1 && t3) {\n#ifdef DEBUG\n debug_mutex.lock();\n std::cout << \" relaxed to \";\n for(int i = 0; i < objective_count; ++i) {\n if (res->ip[i] > 1e19)\n std::cout << \"∞,\";\n else if (res->ip[i] < -1e19)\n std::cout << \"-∞,\";\n else\n std::cout << res->ip[i] << \",\";\n }\n std::cout << \" soln is \";\n if (res->infeasible) {\n std::cout << \"infeasible\";\n } else {\n for(int i = 0; i < objective_count; ++i) {\n std::cout << res->result[i] << \",\";\n }\n }\n std::cout << std::endl;\n debug_mutex.unlock();\n#endif\n return res;\n }\n }\n return nullptr;\n}\nvoid Solutions::insert(const double *lp, const int *result,\n const bool infeasible) {\n Result * r = new Result;\n r->objective_count = objective_count;\n r->ip = new double[objective_count];\n std::memcpy(r->ip, lp, objective_count * sizeof(double));\n if (infeasible) {\n r->infeasible = true;\n r->result = nullptr;\n } else {\n r->infeasible = false;\n r->result = new int[objective_count];\n std::memcpy(r->result, result, objective_count * sizeof(int));\n }\n store_.push_back(r);\n}\n\nSolutions::~Solutions() {\n for(auto r: store_) {\n delete[] r->ip;\n if (r->result)\n delete[] r->result;\n }\n}\n<commit_msg>Hide solution search information unless wanted<commit_after>\n#include <cstring>\n\n#ifdef DEBUG\n#include <mutex>\n#endif\n\n#include \"result.h\"\n#include \"solutions.h\"\n\n#ifdef DEBUG\nextern std::mutex debug_mutex;\n#endif\n\nconst Result * Solutions::find(const double *ip, const Sense sense) const {\n bool t1,t3;\n for (auto& res: store_) {\n\n t1 = true;\n t3 = true;\n if (sense == MIN) {\n for (int i = 0; i < objective_count; i++){\n \/* t1: All values of candidate must be >= than ip *\/\n if (res->ip[i] < ip[i]) {\n t1 = false;\n break;\n }\n \/* t3: All values of candidate result must be <= than ip *\/\n if (!res->infeasible) {\n if (res->result[i] > ip[i]) {\n t3 = false;\n break;\n }\n }\n }\n } else {\n for (int i = 0; i < objective_count; i++){\n \/* t1: All values of candidate must be <= than ip *\/\n if (res->ip[i] > ip[i]) {\n t1 = false;\n break;\n }\n \/* t3: All values of candidate result must be >= than ip *\/\n if (!res->infeasible) {\n if (res->result[i] < ip[i]) {\n t3 = false;\n break;\n }\n }\n }\n }\n \/* If all conditions are met copy problem & solution and return *\/\n if (t1 && t3) {\n#ifdef DEBUG_SOLUTION_SEARCH\n debug_mutex.lock();\n std::cout << \" relaxed to \";\n for(int i = 0; i < objective_count; ++i) {\n if (res->ip[i] > 1e19)\n std::cout << \"∞,\";\n else if (res->ip[i] < -1e19)\n std::cout << \"-∞,\";\n else\n std::cout << res->ip[i] << \",\";\n }\n std::cout << \" soln is \";\n if (res->infeasible) {\n std::cout << \"infeasible\";\n } else {\n for(int i = 0; i < objective_count; ++i) {\n std::cout << res->result[i] << \",\";\n }\n }\n std::cout << std::endl;\n debug_mutex.unlock();\n#endif\n return res;\n }\n }\n return nullptr;\n}\nvoid Solutions::insert(const double *lp, const int *result,\n const bool infeasible) {\n Result * r = new Result;\n r->objective_count = objective_count;\n r->ip = new double[objective_count];\n std::memcpy(r->ip, lp, objective_count * sizeof(double));\n if (infeasible) {\n r->infeasible = true;\n r->result = nullptr;\n } else {\n r->infeasible = false;\n r->result = new int[objective_count];\n std::memcpy(r->result, result, objective_count * sizeof(int));\n }\n store_.push_back(r);\n}\n\nSolutions::~Solutions() {\n for(auto r: store_) {\n delete[] r->ip;\n if (r->result)\n delete[] r->result;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file em_fit_impl.hpp\n * @author Ryan Curtin\n *\n * Implementation of EM algorithm for fitting GMMs.\n *\/\n#ifndef __MLPACK_METHODS_GMM_EM_FIT_IMPL_HPP\n#define __MLPACK_METHODS_GMM_EM_FIT_IMPL_HPP\n\n\/\/ In case it hasn't been included yet.\n#include \"em_fit.hpp\"\n\n\/\/ Definition of phi().\n#include \"phi.hpp\"\n\nnamespace mlpack {\nnamespace gmm {\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::Estimate(const arma::mat& observations,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n InitialClustering(observations, means, covariances, weights);\n\n double l = LogLikelihood(observations, means, covariances, weights);\n\n Log::Debug << \"EMFit::Estimate(): initial clustering log-likelihood: \"\n << l << std::endl;\n\n double lOld = -DBL_MAX;\n arma::mat condProb(observations.n_cols, means.size());\n\n \/\/ Iterate to update the model until no more improvement is found.\n size_t maxIterations = 300;\n size_t iteration = 0;\n while (std::abs(l - lOld) > 1e-10 && iteration < maxIterations)\n {\n \/\/ Calculate the conditional probabilities of choosing a particular\n \/\/ Gaussian given the observations and the present theta value.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Store conditional probabilities into condProb vector for each\n \/\/ Gaussian. First we make an alias of the condProb vector.\n arma::vec condProbAlias = condProb.unsafe_col(i);\n phi(observations, means[i], covariances[i], condProbAlias);\n condProbAlias *= weights[i];\n }\n\n \/\/ Normalize row-wise.\n for (size_t i = 0; i < condProb.n_rows; i++)\n condProb.row(i) \/= accu(condProb.row(i));\n\n \/\/ Store the sum of the probability of each state over all the observations.\n arma::vec probRowSums = trans(arma::sum(condProb, 0 \/* columnwise *\/));\n\n \/\/ Calculate the new value of the means using the updated conditional\n \/\/ probabilities.\n for (size_t i = 0; i < means.size(); i++)\n {\n means[i] = (observations * condProb.col(i)) \/ probRowSums[i];\n\n \/\/ Calculate the new value of the covariances using the updated\n \/\/ conditional probabilities and the updated means.\n arma::mat tmp = observations - (means[i] *\n arma::ones<arma::rowvec>(observations.n_cols));\n arma::mat tmpB = tmp % (arma::ones<arma::vec>(observations.n_rows) *\n trans(condProb.col(i)));\n\n covariances[i] = (tmp * trans(tmpB)) \/ probRowSums[i];\n\n if (accu(covariances[i]) == 0)\n {\n Log::Debug << \"Covariance \" << i << \" sums to zero! Adding \"\n << \" perturbation.\" << std::endl;\n covariances[i].diag() += 1e-50;\n }\n }\n\n \/\/ Calculate the new values for omega using the updated conditional\n \/\/ probabilities.\n weights = probRowSums \/ observations.n_cols;\n\n \/\/ Update values of l; calculate new log-likelihood.\n lOld = l;\n l = LogLikelihood(observations, means, covariances, weights);\n\n iteration++;\n }\n}\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::Estimate(const arma::mat& observations,\n const arma::vec& probabilities,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n InitialClustering(observations, means, covariances, weights);\n\n double l = LogLikelihood(observations, means, covariances, weights);\n\n Log::Debug << \"EMFit::Estimate(): initial clustering log-likelihood: \"\n << l << std::endl;\n\n double lOld = -DBL_MAX;\n arma::mat condProb(observations.n_cols, means.size());\n\n \/\/ Iterate to update the model until no more improvement is found.\n size_t maxIterations = 300;\n size_t iteration = 0;\n while (std::abs(l - lOld) > 1e-10 && iteration < maxIterations)\n {\n \/\/ Calculate the conditional probabilities of choosing a particular\n \/\/ Gaussian given the observations and the present theta value.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Store conditional probabilities into condProb vector for each\n \/\/ Gaussian. First we make an alias of the condProb vector.\n arma::vec condProbAlias = condProb.unsafe_col(i);\n phi(observations, means[i], covariances[i], condProbAlias);\n condProbAlias *= weights[i];\n }\n\n \/\/ Normalize row-wise.\n for (size_t i = 0; i < condProb.n_rows; i++)\n condProb.row(i) \/= accu(condProb.row(i));\n\n \/\/ This will store the sum of probabilities of each state over all the\n \/\/ observations.\n arma::vec probRowSums(means.size());\n\n \/\/ Calculate the new value of the means using the updated conditional\n \/\/ probabilities.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Calculate the sum of probabilities of points, which is the\n \/\/ conditional probability of each point being from Gaussian i\n \/\/ multiplied by the probability of the point being from this mixture\n \/\/ model.\n probRowSums[i] = accu(condProb.col(i) % probabilities);\n\n means[i] = (observations * (condProb.col(i) % probabilities)) \/\n probRowSums[i];\n\n \/\/ Calculate the new value of the covariances using the updated\n \/\/ conditional probabilities and the updated means.\n arma::mat tmp = observations - (means[i] *\n arma::ones<arma::rowvec>(observations.n_cols));\n arma::mat tmpB = tmp % (arma::ones<arma::vec>(observations.n_rows) *\n trans(condProb.col(i) % probabilities));\n\n covariances[i] = (tmp * trans(tmpB)) \/ probRowSums[i];\n\n if (accu(covariances[i]) == 0)\n {\n Log::Debug << \"Covariance \" << i << \" sums to zero! Adding \"\n << \" perturbation.\" << std::endl;\n covariances[i].diag() += 1e-50;\n }\n }\n\n \/\/ Calculate the new values for omega using the updated conditional\n \/\/ probabilities.\n weights = probRowSums \/ accu(probabilities);\n\n \/\/ Update values of l; calculate new log-likelihood.\n lOld = l;\n l = LogLikelihood(observations, means, covariances, weights);\n\n iteration++;\n }\n}\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::InitialClustering(\n const arma::mat& observations,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n \/\/ Assignments from clustering.\n arma::Col<size_t> assignments;\n\n \/\/ Run clustering algorithm.\n clusterer.Cluster(observations, means.size(), assignments);\n\n \/\/ Now calculate the means, covariances, and weights.\n weights.zeros();\n for (size_t i = 0; i < means.size(); ++i)\n {\n means[i].zeros();\n covariances[i].zeros();\n covariances[i].diag().fill(1e-50);\n }\n\n \/\/ From the assignments, generate our means, covariances, and weights.\n for (size_t i = 0; i < observations.n_cols; ++i)\n {\n size_t cluster = assignments[i];\n\n \/\/ Add this to the relevant mean.\n means[cluster] += observations.col(i);\n\n \/\/ Add this to the relevant covariance.\n covariances[cluster] += observations.col(i) * trans(observations.col(i));\n\n \/\/ Now add one to the weights (we will normalize).\n weights[cluster]++;\n }\n\n \/\/ Now normalize the mean and covariance.\n for (size_t i = 0; i < means.size(); ++i)\n {\n covariances[i] -= means[i] * trans(means[i]) \/ weights[i];\n\n means[i] \/= weights[i];\n covariances[i] \/= (weights[i] > 1) ? weights[i] : 1;\n\n if (accu(covariances[i]) == 0)\n {\n Log::Debug << \"Covariance \" << i << \" sums to zero! Adding perturbation.\"\n << std::endl;\n covariances[i].diag() += 1e-50;\n Log::Debug << covariances[i];\n }\n }\n\n \/\/ Finally, normalize weights.\n weights \/= accu(weights);\n}\n\ntemplate<typename InitialClusteringType>\ndouble EMFit<InitialClusteringType>::LogLikelihood(\n const arma::mat& observations,\n const std::vector<arma::vec>& means,\n const std::vector<arma::mat>& covariances,\n const arma::vec& weights) const\n{\n double logLikelihood = 0;\n\n arma::vec phis;\n arma::mat likelihoods(means.size(), observations.n_cols);\n for (size_t i = 0; i < means.size(); ++i)\n {\n phi(observations, means[i], covariances[i], phis);\n likelihoods.row(i) = weights(i) * trans(phis);\n }\n\n \/\/ Now sum over every point.\n for (size_t j = 0; j < observations.n_cols; ++j)\n logLikelihood += log(accu(likelihoods.col(j)));\n\n return logLikelihood;\n}\n\n}; \/\/ namespace gmm\n}; \/\/ namespace mlpack\n\n#endif\n<commit_msg>Zeroes in any element of a diagonal of a covariance matrix can cause problems.<commit_after>\/**\n * @file em_fit_impl.hpp\n * @author Ryan Curtin\n *\n * Implementation of EM algorithm for fitting GMMs.\n *\/\n#ifndef __MLPACK_METHODS_GMM_EM_FIT_IMPL_HPP\n#define __MLPACK_METHODS_GMM_EM_FIT_IMPL_HPP\n\n\/\/ In case it hasn't been included yet.\n#include \"em_fit.hpp\"\n\n\/\/ Definition of phi().\n#include \"phi.hpp\"\n\nnamespace mlpack {\nnamespace gmm {\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::Estimate(const arma::mat& observations,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n InitialClustering(observations, means, covariances, weights);\n\n double l = LogLikelihood(observations, means, covariances, weights);\n\n Log::Debug << \"EMFit::Estimate(): initial clustering log-likelihood: \"\n << l << std::endl;\n\n double lOld = -DBL_MAX;\n arma::mat condProb(observations.n_cols, means.size());\n\n \/\/ Iterate to update the model until no more improvement is found.\n size_t maxIterations = 300;\n size_t iteration = 0;\n while (std::abs(l - lOld) > 1e-10 && iteration < maxIterations)\n {\n \/\/ Calculate the conditional probabilities of choosing a particular\n \/\/ Gaussian given the observations and the present theta value.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Store conditional probabilities into condProb vector for each\n \/\/ Gaussian. First we make an alias of the condProb vector.\n arma::vec condProbAlias = condProb.unsafe_col(i);\n phi(observations, means[i], covariances[i], condProbAlias);\n condProbAlias *= weights[i];\n }\n\n \/\/ Normalize row-wise.\n for (size_t i = 0; i < condProb.n_rows; i++)\n condProb.row(i) \/= accu(condProb.row(i));\n\n \/\/ Store the sum of the probability of each state over all the observations.\n arma::vec probRowSums = trans(arma::sum(condProb, 0 \/* columnwise *\/));\n\n \/\/ Calculate the new value of the means using the updated conditional\n \/\/ probabilities.\n for (size_t i = 0; i < means.size(); i++)\n {\n means[i] = (observations * condProb.col(i)) \/ probRowSums[i];\n\n \/\/ Calculate the new value of the covariances using the updated\n \/\/ conditional probabilities and the updated means.\n arma::mat tmp = observations - (means[i] *\n arma::ones<arma::rowvec>(observations.n_cols));\n arma::mat tmpB = tmp % (arma::ones<arma::vec>(observations.n_rows) *\n trans(condProb.col(i)));\n\n covariances[i] = (tmp * trans(tmpB)) \/ probRowSums[i];\n\n for (size_t d = 0; d < covariances[i].n_rows; ++d)\n {\n if (covariances[i](d, d) == 0.0)\n {\n Log::Debug << \"Covariance \" << i << \" has zero in diagonal element \"\n << d << \"! Adding perturbation.\" << std::endl;\n covariances[i](d, d) += 1e-50;\n }\n }\n }\n\n \/\/ Calculate the new values for omega using the updated conditional\n \/\/ probabilities.\n weights = probRowSums \/ observations.n_cols;\n\n \/\/ Update values of l; calculate new log-likelihood.\n lOld = l;\n l = LogLikelihood(observations, means, covariances, weights);\n\n iteration++;\n }\n}\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::Estimate(const arma::mat& observations,\n const arma::vec& probabilities,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n InitialClustering(observations, means, covariances, weights);\n\n double l = LogLikelihood(observations, means, covariances, weights);\n\n Log::Debug << \"EMFit::Estimate(): initial clustering log-likelihood: \"\n << l << std::endl;\n\n double lOld = -DBL_MAX;\n arma::mat condProb(observations.n_cols, means.size());\n\n \/\/ Iterate to update the model until no more improvement is found.\n size_t maxIterations = 300;\n size_t iteration = 0;\n while (std::abs(l - lOld) > 1e-10 && iteration < maxIterations)\n {\n \/\/ Calculate the conditional probabilities of choosing a particular\n \/\/ Gaussian given the observations and the present theta value.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Store conditional probabilities into condProb vector for each\n \/\/ Gaussian. First we make an alias of the condProb vector.\n arma::vec condProbAlias = condProb.unsafe_col(i);\n phi(observations, means[i], covariances[i], condProbAlias);\n condProbAlias *= weights[i];\n }\n\n \/\/ Normalize row-wise.\n for (size_t i = 0; i < condProb.n_rows; i++)\n condProb.row(i) \/= accu(condProb.row(i));\n\n \/\/ This will store the sum of probabilities of each state over all the\n \/\/ observations.\n arma::vec probRowSums(means.size());\n\n \/\/ Calculate the new value of the means using the updated conditional\n \/\/ probabilities.\n for (size_t i = 0; i < means.size(); i++)\n {\n \/\/ Calculate the sum of probabilities of points, which is the\n \/\/ conditional probability of each point being from Gaussian i\n \/\/ multiplied by the probability of the point being from this mixture\n \/\/ model.\n probRowSums[i] = accu(condProb.col(i) % probabilities);\n\n means[i] = (observations * (condProb.col(i) % probabilities)) \/\n probRowSums[i];\n\n \/\/ Calculate the new value of the covariances using the updated\n \/\/ conditional probabilities and the updated means.\n arma::mat tmp = observations - (means[i] *\n arma::ones<arma::rowvec>(observations.n_cols));\n arma::mat tmpB = tmp % (arma::ones<arma::vec>(observations.n_rows) *\n trans(condProb.col(i) % probabilities));\n\n covariances[i] = (tmp * trans(tmpB)) \/ probRowSums[i];\n\n for (size_t d = 0; d < covariances[i].n_rows; ++d)\n {\n if (covariances[i](d, d) == 0.0)\n {\n Log::Debug << \"Covariance \" << i << \" has zero in diagonal element \"\n << d << \"! Adding perturbation.\" << std::endl;\n covariances[i](d, d) += 1e-50;\n }\n }\n }\n\n \/\/ Calculate the new values for omega using the updated conditional\n \/\/ probabilities.\n weights = probRowSums \/ accu(probabilities);\n\n \/\/ Update values of l; calculate new log-likelihood.\n lOld = l;\n l = LogLikelihood(observations, means, covariances, weights);\n\n iteration++;\n }\n}\n\ntemplate<typename InitialClusteringType>\nvoid EMFit<InitialClusteringType>::InitialClustering(\n const arma::mat& observations,\n std::vector<arma::vec>& means,\n std::vector<arma::mat>& covariances,\n arma::vec& weights)\n{\n \/\/ Assignments from clustering.\n arma::Col<size_t> assignments;\n\n \/\/ Run clustering algorithm.\n clusterer.Cluster(observations, means.size(), assignments);\n\n \/\/ Now calculate the means, covariances, and weights.\n weights.zeros();\n for (size_t i = 0; i < means.size(); ++i)\n {\n means[i].zeros();\n covariances[i].zeros();\n covariances[i].diag().fill(1e-50);\n }\n\n \/\/ From the assignments, generate our means, covariances, and weights.\n for (size_t i = 0; i < observations.n_cols; ++i)\n {\n size_t cluster = assignments[i];\n\n \/\/ Add this to the relevant mean.\n means[cluster] += observations.col(i);\n\n \/\/ Add this to the relevant covariance.\n covariances[cluster] += observations.col(i) * trans(observations.col(i));\n\n \/\/ Now add one to the weights (we will normalize).\n weights[cluster]++;\n }\n\n \/\/ Now normalize the mean and covariance.\n for (size_t i = 0; i < means.size(); ++i)\n {\n covariances[i] -= means[i] * trans(means[i]) \/ weights[i];\n\n means[i] \/= weights[i];\n covariances[i] \/= (weights[i] > 1) ? weights[i] : 1;\n\n for (size_t d = 0; d < covariances[i].n_rows; ++d)\n {\n if (covariances[i](d, d) == 0.0)\n {\n Log::Debug << \"Covariance \" << i << \" has zero in diagonal element \"\n << d << \"! Adding perturbation.\" << std::endl;\n covariances[i](d, d) += 1e-50;\n }\n }\n }\n\n \/\/ Finally, normalize weights.\n weights \/= accu(weights);\n}\n\ntemplate<typename InitialClusteringType>\ndouble EMFit<InitialClusteringType>::LogLikelihood(\n const arma::mat& observations,\n const std::vector<arma::vec>& means,\n const std::vector<arma::mat>& covariances,\n const arma::vec& weights) const\n{\n double logLikelihood = 0;\n\n arma::vec phis;\n arma::mat likelihoods(means.size(), observations.n_cols);\n for (size_t i = 0; i < means.size(); ++i)\n {\n phi(observations, means[i], covariances[i], phis);\n likelihoods.row(i) = weights(i) * trans(phis);\n }\n\n \/\/ Now sum over every point.\n for (size_t j = 0; j < observations.n_cols; ++j)\n logLikelihood += log(accu(likelihoods.col(j)));\n\n return logLikelihood;\n}\n\n}; \/\/ namespace gmm\n}; \/\/ namespace mlpack\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n\n#include \"GraphHandler.h\"\n#include \"Options.h\"\n\n#include <cinder\/app\/AppNative.h>\n#include <cinder\/params\/Params.h>\n#include <cinder\/qtime\/MovieWriter.h>\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass GraphStudioApp : public AppNative {\npublic:\n void prepareSettings(Settings *settings) override;\n void setup() override;\n void mouseDown(MouseEvent event) override;\n void keyDown(KeyEvent event) override;\n void update() override;\n void draw() override;\n void resize() override;\n void shutdown() override;\n\n const ColorScheme &getCurrentColorScheme();\nprivate:\n ci::params::InterfaceGlRef\tparams;\n qtime::MovieWriterRef\tmMovieWriter;\n std::map<std::string, ColorScheme> colorSchemes;\n std::vector<std::string> colorSchemeNames;\n GraphHandler gh;\n int prevColorSchemeIndex;\n void addNewColorScheme();\n void storeColorScheme();\n\n void loadSettings();\n void saveSettings();\n};\n\n\nvoid GraphStudioApp::prepareSettings(Settings *settings)\n{\n settings->enableConsoleWindow();\n settings->setWindowSize(800, 600);\n settings->setFrameRate(60.0f);\n}\n\n\nconst ColorScheme &GraphStudioApp::getCurrentColorScheme()\n{\n return colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n}\n\n\nvoid GraphStudioApp::addNewColorScheme()\n{\n auto &cs = Options::instance().currentColorScheme;\n cs = ColorScheme();\n bool freeNameFound = false;\n int freeNameIdx = 0;\n std::string newName;\n do\n {\n newName = \"ColorScheme #\" + std::to_string(++freeNameIdx);\n if (find(begin(colorSchemeNames), end(colorSchemeNames), newName) == colorSchemeNames.end())\n freeNameFound = true;\n } while (!freeNameFound);\n cs.name = newName;\n colorSchemeNames.push_back(cs.name);\n colorSchemes[cs.name] = cs;\n Options::instance().currentColorSchemeIdx = colorSchemes.size() - 1;\n params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n}\n\n\nvoid GraphStudioApp::storeColorScheme()\n{\n auto &cs = Options::instance().currentColorScheme;\n colorSchemes[cs.name] = cs;\n}\n\n\nvoid GraphStudioApp::saveSettings()\n{\n ci::XmlTree configXml(\"graphStudioSettings\", \"\");\n configXml.push_back(ci::XmlTree(\"nodeSize\", std::to_string(Options::instance().nodeSize)));\n configXml.push_back(ci::XmlTree(\"edgeWidth\", std::to_string(Options::instance().edgeWidth)));\n configXml.push_back(ci::XmlTree(\"highlightedEdgeWidth\", std::to_string(Options::instance().highlighedEdgeWidth)));\n configXml.push_back(ci::XmlTree(\"arrowLength\", std::to_string(Options::instance().arrowLength)));\n configXml.push_back(ci::XmlTree(\"arrowAngle\", std::to_string(Options::instance().arrowAngle)));\n configXml.push_back(ci::XmlTree(\"showEdgeWeights\", std::to_string(Options::instance().showEdgeWeights)));\n configXml.push_back(ci::XmlTree(\"showNodeWeights\", std::to_string(Options::instance().showNodeWeights)));\n configXml.push_back(ci::XmlTree(\"force\", std::to_string(Options::instance().force)));\n configXml.push_back(ci::XmlTree(\"speed\", std::to_string(Options::instance().speed)));\n configXml.push_back(ci::XmlTree(\"edgeWeightScale\", std::to_string(Options::instance().edgeWeightScale)));\n ci::XmlTree csList(\"colorSchemes\", \"\");\n for (const auto &cs : colorSchemes)\n {\n csList.push_back(cs.second.toXml());\n }\n configXml.push_back(csList);\n\n configXml.write(ci::writeFile(\"config.xml\"));\n}\n\n\nvoid GraphStudioApp::loadSettings()\n{\n ci::XmlTree configXml(ci::loadFile(\"config.xml\"));\n ci::XmlTree settings = configXml.getChild(\"graphStudioSettings\");\n Options::instance().nodeSize = settings.getChild(\"nodeSize\").getValue<float>();\n Options::instance().edgeWidth = settings.getChild(\"edgeWidth\").getValue<float>();\n Options::instance().highlighedEdgeWidth = settings.getChild(\"highlightedEdgeWidth\").getValue<float>();\n Options::instance().arrowLength = settings.getChild(\"arrowLength\").getValue<float>();\n Options::instance().arrowAngle = settings.getChild(\"arrowAngle\").getValue<float>();\n Options::instance().showEdgeWeights = settings.getChild(\"showEdgeWeights\").getValue<bool>();\n Options::instance().showNodeWeights = settings.getChild(\"showNodeWeights\").getValue<bool>();\n\n Options::instance().force = settings.getChild(\"force\").getValue<float>();\n Options::instance().speed = settings.getChild(\"speed\").getValue<int>();\n Options::instance().edgeWeightScale = settings.getChild(\"edgeWeightScale\").getValue<int>();\n\n ci::XmlTree csList = settings.getChild(\"colorSchemes\");\n for (auto csIt = csList.begin(); csIt != csList.end(); ++csIt)\n {\n ColorScheme cs = ColorScheme::fromXml(*csIt);\n colorSchemes[cs.name] = cs;\n colorSchemeNames.push_back(cs.name);\n }\n}\n\n\nvoid GraphStudioApp::setup()\n{ \n loadSettings();\n\n params = params::InterfaceGl::create(\"Graph Studio\", Vec2i(200, 310));\n params->addParam(\"Node Size\", &Options::instance().nodeSize, \"min=1.0 max=50.0 step=1.0\");\n params->addParam(\"Edge Width\", &Options::instance().edgeWidth, \"min=0.0 max=10.0 step=0.1\");\n params->addParam(\"Highlighted Edge Width\", &Options::instance().highlighedEdgeWidth, \"min=0.0 max=10.0 step=0.1\");\n params->addParam(\"Arrow Length\", &Options::instance().arrowLength, \"min=1.0 max=50.0 step=1.0\");\n params->addParam(\"Arrow Angle\", &Options::instance().arrowAngle, \"min=0.0 max=90.0 step=1.0\");\n params->addParam(\"Show Edge Weights\", &Options::instance().showEdgeWeights);\n params->addParam(\"Show Node Weights\", &Options::instance().showNodeWeights);\n params->addSeparator();\n params->addParam(\"Algorithm\", AlgorithmNames, &Options::instance().algorithm);\n params->addParam(\"Starting Node\", &Options::instance().startNode, \"min=1 step=1\");\n params->addSeparator();\n params->addParam(\"Force\", &Options::instance().force, \"min=1.0 max=300.0 step=1.0\");\n params->addParam(\"Speed\", &Options::instance().speed, \"min=1.0 max=300.0 step=1.0\");\n params->addParam(\"Edge Weight Scale\", &Options::instance().edgeWeightScale, \"min=1.0 max=1000.0 step=1.0\");\n params->addSeparator();\n params->addText(\"Colors\");\n params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n params->addParam(\"Background\", &Options::instance().currentColorScheme.backgroundColor);\n\n params->addParam(\"Node \", &Options::instance().currentColorScheme.nodeColor);\n params->addParam(\"Highlighted Node 1\", &Options::instance().currentColorScheme.highlightedNodeColor1);\n params->addParam(\"Highlighted Node 2\", &Options::instance().currentColorScheme.highlightedNodeColor2);\n params->addParam(\"Highlighted Node 3\", &Options::instance().currentColorScheme.highlightedNodeColor3);\n\n params->addParam(\"Edge \", &Options::instance().currentColorScheme.edgeColor);\n params->addParam(\"Highlighted Edge 1\", &Options::instance().currentColorScheme.highlightedEdgeColor1);\n params->addParam(\"Highlighted Edge 2\", &Options::instance().currentColorScheme.highlightedEdgeColor2);\n params->addParam(\"Highlighted Edge 3\", &Options::instance().currentColorScheme.highlightedEdgeColor3);\n\n params->addParam(\"Node Text\", &Options::instance().currentColorScheme.nodeTextColor);\n params->addParam(\"highlightednodeText\", &Options::instance().currentColorScheme.highlightednodeTextColor);\n params->addParam(\"Edge Text\", &Options::instance().currentColorScheme.edgeTextColor);\n params->addParam(\"Highlighted Edge Text\", &Options::instance().currentColorScheme.highlightedEdgeTextColor);\n\n params->addButton(\"New\", std::bind(&GraphStudioApp::addNewColorScheme, this));\n params->addSeparator();\n params->addText(\"Random Edge Weights\");\n params->addParam(\"Min\", &Options::instance().minRandomEdgeWeight, \"min=1, max=1000, step=1\");\n params->addParam(\"Max\", &Options::instance().maxRandomEdgeWeight, \"min=1, max=1000, step=1\");\n params->addButton(\"Generate Weights\", std::bind(&GraphHandler::setRandomEdgeWeights, &gh));\n params->addSeparator();\n params->addText(\"Generate Grid\");\n params->addParam(\"Columns\", &GraphParamsGrid::instance().columns, \"min=1 step=1\");\n params->addParam(\"Rows\", &GraphParamsGrid::instance().rows, \"min=1 step=1\");\n params->addParam(\"Directed\", &GraphParamsGrid::instance().directed);\n params->addParam(\"Horizontal Edges\", &GraphParamsGrid::instance().horizontal);\n params->addParam(\"Vertical Edges\", &GraphParamsGrid::instance().vertical);\n params->addParam(\"Diagonal \/\", &GraphParamsGrid::instance().upDiagonal);\n params->addParam(\"Diagonal \\\\\", &GraphParamsGrid::instance().downDiagonal);\n params->addButton(\"Generate grid\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::grid));\n params->addText(\"Generate Triangle Mesh\");\n params->addParam(\"Triangles\", &GraphParamsTriangleMesh::instance().triangles, \"min=1 step=1\");\n params->addParam(\"Randomness\", &GraphParamsTriangleMesh::instance().randomness, \"min=0.0 step=0.1\");\n params->addButton(\"Generate tri\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::triangleMesh));\n \n gh.setup(getWindow());\n \/*\n fs::path path = getSaveFilePath();\n if (path.empty())\n return; \/\/ user cancelled save\n qtime::MovieWriter::Format format;\n if (qtime::MovieWriter::getUserCompressionSettings(&format)) {\n mMovieWriter = qtime::MovieWriter::create(path, getWindowWidth(), getWindowHeight(), format);\n }\n *\/\n}\n\nvoid GraphStudioApp::shutdown()\n{\n saveSettings();\n}\n\nvoid GraphStudioApp::keyDown(KeyEvent event)\n{\n std::string nameBase = \"graph_small2\";\n if (event.getCode() == KeyEvent::KEY_SPACE)\n {\n \/\/ stop - play - pause - play - pause - play - until the last state is reached\n if (!Options::instance().animationPlaying)\n {\n Options::instance().animationPlaying = true;\n Options::instance().animationPaused = false;\n gh.animationPrepare();\n }\n else\n {\n Options::instance().animationPaused = !Options::instance().animationPaused;\n if (Options::instance().animationPaused)\n {\n gh.animationPause();\n }\n else\n {\n gh.animationResume();\n }\n }\n \n return;\n }\n else if (event.getCode() == KeyEvent::KEY_RIGHT)\n {\n gh.animationNext();\n return;\n }\n else if (event.getCode() == KeyEvent::KEY_LEFT)\n {\n gh.animationPrevious();\n return;\n }\n if (event.getChar() == 'm')\n {\n Options::instance().randomMovement = !Options::instance().randomMovement;\n if (Options::instance().randomMovement)\n Options::instance().animationPlaying = false;\n }\n if (event.getChar() == 's')\n {\n std::cout << \"Saving graph...\" << std::endl;\n gh.saveGraph(nameBase + \".txt\");\n gh.saveGraphPositions(nameBase + \".pos\");\n std::cout << \"Done\" << std::endl;\n }\n if (event.getChar() == 'l')\n {\n std::cout << \"Loading graph...\" << std::endl;\n \n gh.loadGraph(nameBase + \".txt\");\n gh.loadGraphPositions(nameBase + \".pos\");\n Options::instance().startNode = 1;\n gh.fitToWindow();\n std::cout << \"Done\" << std::endl;\n }\n if (event.getChar() == 'u')\n {\n gh.toggleAutomaticEdgeWeightUpdate();\n std::cout << \"automaticEdgeWeightUpdate = \" << gh.getAutomaticEdgeWeightUpdate() << std::endl;\n }\n if (event.getChar() == 'f')\n {\n gh.fitToWindow();\n }\n if (event.getChar() == 'r')\n {\n gh.reorderNodesSquare();\n }\n\n if (event.getChar() == 'q')\n {\n saveSettings();\n quit();\n }\n \n}\n\n\nvoid GraphStudioApp::mouseDown( MouseEvent event )\n{\n \/\/std::cout << \"GraphStudioApp::mouseDown\" << std::endl;\n}\n\n\nvoid GraphStudioApp::update()\n{\n gh.update();\n if (prevColorSchemeIndex != Options::instance().currentColorSchemeIdx)\n {\n prevColorSchemeIndex = Options::instance().currentColorSchemeIdx;\n Options::instance().currentColorScheme = colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n }\n else\n {\n storeColorScheme();\n }\n}\n\n\nvoid GraphStudioApp::draw()\n{\n \/\/ clear out the window with black\n gl::clear(Color(0, 0, 0));\n gh.draw();\n params->draw();\n \/*\n if (mMovieWriter)\n mMovieWriter->addFrame(copyWindowSurface());\n *\/\n}\n\nvoid GraphStudioApp::resize()\n{\n gh.resize(getWindowBounds());\n}\n\nCINDER_APP_NATIVE( GraphStudioApp, RendererGl )\n<commit_msg>Fixed wierd leaks caused by line width set to 0.0<commit_after>#include \"stdafx.h\"\n\n#include \"GraphHandler.h\"\n#include \"Options.h\"\n\n#include <cinder\/app\/AppNative.h>\n#include <cinder\/params\/Params.h>\n#include <cinder\/qtime\/MovieWriter.h>\n\nusing namespace ci;\nusing namespace ci::app;\n\nclass GraphStudioApp : public AppNative {\npublic:\n void prepareSettings(Settings *settings) override;\n void setup() override;\n void mouseDown(MouseEvent event) override;\n void keyDown(KeyEvent event) override;\n void update() override;\n void draw() override;\n void resize() override;\n void shutdown() override;\n\n const ColorScheme &getCurrentColorScheme();\nprivate:\n ci::params::InterfaceGlRef\tparams;\n qtime::MovieWriterRef\tmMovieWriter;\n std::map<std::string, ColorScheme> colorSchemes;\n std::vector<std::string> colorSchemeNames;\n GraphHandler gh;\n int prevColorSchemeIndex;\n void addNewColorScheme();\n void storeColorScheme();\n\n void loadSettings();\n void saveSettings();\n};\n\n\nvoid GraphStudioApp::prepareSettings(Settings *settings)\n{\n settings->enableConsoleWindow();\n settings->setWindowSize(800, 600);\n settings->setFrameRate(60.0f);\n}\n\n\nconst ColorScheme &GraphStudioApp::getCurrentColorScheme()\n{\n return colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n}\n\n\nvoid GraphStudioApp::addNewColorScheme()\n{\n auto &cs = Options::instance().currentColorScheme;\n cs = ColorScheme();\n bool freeNameFound = false;\n int freeNameIdx = 0;\n std::string newName;\n do\n {\n newName = \"ColorScheme #\" + std::to_string(++freeNameIdx);\n if (find(begin(colorSchemeNames), end(colorSchemeNames), newName) == colorSchemeNames.end())\n freeNameFound = true;\n } while (!freeNameFound);\n cs.name = newName;\n colorSchemeNames.push_back(cs.name);\n colorSchemes[cs.name] = cs;\n Options::instance().currentColorSchemeIdx = colorSchemes.size() - 1;\n params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n}\n\n\nvoid GraphStudioApp::storeColorScheme()\n{\n auto &cs = Options::instance().currentColorScheme;\n colorSchemes[cs.name] = cs;\n}\n\n\nvoid GraphStudioApp::saveSettings()\n{\n ci::XmlTree configXml(\"graphStudioSettings\", \"\");\n configXml.push_back(ci::XmlTree(\"nodeSize\", std::to_string(Options::instance().nodeSize)));\n configXml.push_back(ci::XmlTree(\"edgeWidth\", std::to_string(Options::instance().edgeWidth)));\n configXml.push_back(ci::XmlTree(\"highlightedEdgeWidth\", std::to_string(Options::instance().highlighedEdgeWidth)));\n configXml.push_back(ci::XmlTree(\"arrowLength\", std::to_string(Options::instance().arrowLength)));\n configXml.push_back(ci::XmlTree(\"arrowAngle\", std::to_string(Options::instance().arrowAngle)));\n configXml.push_back(ci::XmlTree(\"showEdgeWeights\", std::to_string(Options::instance().showEdgeWeights)));\n configXml.push_back(ci::XmlTree(\"showNodeWeights\", std::to_string(Options::instance().showNodeWeights)));\n configXml.push_back(ci::XmlTree(\"force\", std::to_string(Options::instance().force)));\n configXml.push_back(ci::XmlTree(\"speed\", std::to_string(Options::instance().speed)));\n configXml.push_back(ci::XmlTree(\"edgeWeightScale\", std::to_string(Options::instance().edgeWeightScale)));\n ci::XmlTree csList(\"colorSchemes\", \"\");\n for (const auto &cs : colorSchemes)\n {\n csList.push_back(cs.second.toXml());\n }\n configXml.push_back(csList);\n\n configXml.write(ci::writeFile(\"config.xml\"));\n}\n\n\nvoid GraphStudioApp::loadSettings()\n{\n ci::XmlTree configXml(ci::loadFile(\"config.xml\"));\n ci::XmlTree settings = configXml.getChild(\"graphStudioSettings\");\n Options::instance().nodeSize = settings.getChild(\"nodeSize\").getValue<float>();\n Options::instance().edgeWidth = settings.getChild(\"edgeWidth\").getValue<float>();\n Options::instance().highlighedEdgeWidth = settings.getChild(\"highlightedEdgeWidth\").getValue<float>();\n Options::instance().arrowLength = settings.getChild(\"arrowLength\").getValue<float>();\n Options::instance().arrowAngle = settings.getChild(\"arrowAngle\").getValue<float>();\n Options::instance().showEdgeWeights = settings.getChild(\"showEdgeWeights\").getValue<bool>();\n Options::instance().showNodeWeights = settings.getChild(\"showNodeWeights\").getValue<bool>();\n\n Options::instance().force = settings.getChild(\"force\").getValue<float>();\n Options::instance().speed = settings.getChild(\"speed\").getValue<int>();\n Options::instance().edgeWeightScale = settings.getChild(\"edgeWeightScale\").getValue<int>();\n\n ci::XmlTree csList = settings.getChild(\"colorSchemes\");\n for (auto csIt = csList.begin(); csIt != csList.end(); ++csIt)\n {\n ColorScheme cs = ColorScheme::fromXml(*csIt);\n colorSchemes[cs.name] = cs;\n colorSchemeNames.push_back(cs.name);\n }\n}\n\n\nvoid GraphStudioApp::setup()\n{ \n loadSettings();\n\n params = params::InterfaceGl::create(\"Graph Studio\", Vec2i(200, 310));\n params->addParam(\"Node Size\", &Options::instance().nodeSize, \"min=1.0 max=50.0 step=1.0\");\n params->addParam(\"Edge Width\", &Options::instance().edgeWidth, \"min=0.1 max=10.0 step=0.1\");\n params->addParam(\"Highlighted Edge Width\", &Options::instance().highlighedEdgeWidth, \"min=0.0 max=10.0 step=0.1\");\n params->addParam(\"Arrow Length\", &Options::instance().arrowLength, \"min=1.0 max=50.0 step=1.0\");\n params->addParam(\"Arrow Angle\", &Options::instance().arrowAngle, \"min=0.0 max=90.0 step=1.0\");\n params->addParam(\"Show Edge Weights\", &Options::instance().showEdgeWeights);\n params->addParam(\"Show Node Weights\", &Options::instance().showNodeWeights);\n params->addSeparator();\n params->addParam(\"Algorithm\", AlgorithmNames, &Options::instance().algorithm);\n params->addParam(\"Starting Node\", &Options::instance().startNode, \"min=1 step=1\");\n params->addSeparator();\n params->addParam(\"Force\", &Options::instance().force, \"min=1.0 max=300.0 step=1.0\");\n params->addParam(\"Speed\", &Options::instance().speed, \"min=1.0 max=300.0 step=1.0\");\n params->addParam(\"Edge Weight Scale\", &Options::instance().edgeWeightScale, \"min=1.0 max=1000.0 step=1.0\");\n params->addSeparator();\n params->addText(\"Colors\");\n params->addParam(\"ColorScheme\", colorSchemeNames, &Options::instance().currentColorSchemeIdx);\n params->addParam(\"Background\", &Options::instance().currentColorScheme.backgroundColor);\n\n params->addParam(\"Node \", &Options::instance().currentColorScheme.nodeColor);\n params->addParam(\"Highlighted Node 1\", &Options::instance().currentColorScheme.highlightedNodeColor1);\n params->addParam(\"Highlighted Node 2\", &Options::instance().currentColorScheme.highlightedNodeColor2);\n params->addParam(\"Highlighted Node 3\", &Options::instance().currentColorScheme.highlightedNodeColor3);\n\n params->addParam(\"Edge \", &Options::instance().currentColorScheme.edgeColor);\n params->addParam(\"Highlighted Edge 1\", &Options::instance().currentColorScheme.highlightedEdgeColor1);\n params->addParam(\"Highlighted Edge 2\", &Options::instance().currentColorScheme.highlightedEdgeColor2);\n params->addParam(\"Highlighted Edge 3\", &Options::instance().currentColorScheme.highlightedEdgeColor3);\n\n params->addParam(\"Node Text\", &Options::instance().currentColorScheme.nodeTextColor);\n params->addParam(\"highlightednodeText\", &Options::instance().currentColorScheme.highlightednodeTextColor);\n params->addParam(\"Edge Text\", &Options::instance().currentColorScheme.edgeTextColor);\n params->addParam(\"Highlighted Edge Text\", &Options::instance().currentColorScheme.highlightedEdgeTextColor);\n\n params->addButton(\"New\", std::bind(&GraphStudioApp::addNewColorScheme, this));\n params->addSeparator();\n params->addText(\"Random Edge Weights\");\n params->addParam(\"Min\", &Options::instance().minRandomEdgeWeight, \"min=1, max=1000, step=1\");\n params->addParam(\"Max\", &Options::instance().maxRandomEdgeWeight, \"min=1, max=1000, step=1\");\n params->addButton(\"Generate Weights\", std::bind(&GraphHandler::setRandomEdgeWeights, &gh));\n params->addSeparator();\n params->addText(\"Generate Grid\");\n params->addParam(\"Columns\", &GraphParamsGrid::instance().columns, \"min=1 step=1\");\n params->addParam(\"Rows\", &GraphParamsGrid::instance().rows, \"min=1 step=1\");\n params->addParam(\"Directed\", &GraphParamsGrid::instance().directed);\n params->addParam(\"Horizontal Edges\", &GraphParamsGrid::instance().horizontal);\n params->addParam(\"Vertical Edges\", &GraphParamsGrid::instance().vertical);\n params->addParam(\"Diagonal \/\", &GraphParamsGrid::instance().upDiagonal);\n params->addParam(\"Diagonal \\\\\", &GraphParamsGrid::instance().downDiagonal);\n params->addButton(\"Generate grid\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::grid));\n params->addText(\"Generate Triangle Mesh\");\n params->addParam(\"Triangles\", &GraphParamsTriangleMesh::instance().triangles, \"min=1 step=1\");\n params->addParam(\"Randomness\", &GraphParamsTriangleMesh::instance().randomness, \"min=0.0 step=0.1\");\n params->addButton(\"Generate tri\", std::bind(&GraphHandler::generateSpecialGraph, &gh, GraphHandler::GraphType::triangleMesh));\n \n gh.setup(getWindow());\n \/*\n fs::path path = getSaveFilePath();\n if (path.empty())\n return; \/\/ user cancelled save\n qtime::MovieWriter::Format format;\n if (qtime::MovieWriter::getUserCompressionSettings(&format)) {\n mMovieWriter = qtime::MovieWriter::create(path, getWindowWidth(), getWindowHeight(), format);\n }\n *\/\n}\n\nvoid GraphStudioApp::shutdown()\n{\n saveSettings();\n}\n\nvoid GraphStudioApp::keyDown(KeyEvent event)\n{\n std::string nameBase = \"graph_small2\";\n if (event.getCode() == KeyEvent::KEY_SPACE)\n {\n \/\/ stop - play - pause - play - pause - play - until the last state is reached\n if (!Options::instance().animationPlaying)\n {\n Options::instance().animationPlaying = true;\n Options::instance().animationPaused = false;\n gh.animationPrepare();\n }\n else\n {\n Options::instance().animationPaused = !Options::instance().animationPaused;\n if (Options::instance().animationPaused)\n {\n gh.animationPause();\n }\n else\n {\n gh.animationResume();\n }\n }\n \n return;\n }\n else if (event.getCode() == KeyEvent::KEY_RIGHT)\n {\n gh.animationNext();\n return;\n }\n else if (event.getCode() == KeyEvent::KEY_LEFT)\n {\n gh.animationPrevious();\n return;\n }\n if (event.getChar() == 'm')\n {\n Options::instance().randomMovement = !Options::instance().randomMovement;\n if (Options::instance().randomMovement)\n Options::instance().animationPlaying = false;\n }\n if (event.getChar() == 's')\n {\n std::cout << \"Saving graph...\" << std::endl;\n gh.saveGraph(nameBase + \".txt\");\n gh.saveGraphPositions(nameBase + \".pos\");\n std::cout << \"Done\" << std::endl;\n }\n if (event.getChar() == 'l')\n {\n std::cout << \"Loading graph...\" << std::endl;\n \n gh.loadGraph(nameBase + \".txt\");\n gh.loadGraphPositions(nameBase + \".pos\");\n Options::instance().startNode = 1;\n gh.fitToWindow();\n std::cout << \"Done\" << std::endl;\n }\n if (event.getChar() == 'u')\n {\n gh.toggleAutomaticEdgeWeightUpdate();\n std::cout << \"automaticEdgeWeightUpdate = \" << gh.getAutomaticEdgeWeightUpdate() << std::endl;\n }\n if (event.getChar() == 'f')\n {\n gh.fitToWindow();\n }\n if (event.getChar() == 'r')\n {\n gh.reorderNodesSquare();\n }\n\n if (event.getChar() == 'q')\n {\n saveSettings();\n quit();\n }\n \n}\n\n\nvoid GraphStudioApp::mouseDown( MouseEvent event )\n{\n \/\/std::cout << \"GraphStudioApp::mouseDown\" << std::endl;\n}\n\n\nvoid GraphStudioApp::update()\n{\n gh.update();\n if (prevColorSchemeIndex != Options::instance().currentColorSchemeIdx)\n {\n prevColorSchemeIndex = Options::instance().currentColorSchemeIdx;\n Options::instance().currentColorScheme = colorSchemes[colorSchemeNames[Options::instance().currentColorSchemeIdx]];\n }\n else\n {\n storeColorScheme();\n }\n}\n\n\nvoid GraphStudioApp::draw()\n{\n \/\/ clear out the window with black\n gl::clear(Color(0, 0, 0));\n gh.draw();\n params->draw();\n \/*\n if (mMovieWriter)\n mMovieWriter->addFrame(copyWindowSurface());\n *\/\n}\n\nvoid GraphStudioApp::resize()\n{\n gh.resize(getWindowBounds());\n}\n\nCINDER_APP_NATIVE( GraphStudioApp, RendererGl )\n<|endoftext|>"} {"text":"<commit_before>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2016 CStanKonrad\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*\/\n\n#include <cstdio>\n#include <vector>\n\nconst int MAX_NUM_OF_LEFT_V = 50000;\nconst int MAX_NUM_OF_RIGHT_V = 50000;\n\nstruct SLeftVerticle\n{\n\tstd::vector<int> adj;\t\/\/Adjacent\n\tbool isMatched = false;\n\tbool isVisited = false;\n} left[MAX_NUM_OF_LEFT_V + 7];\n\nint rightVertMatch[MAX_NUM_OF_RIGHT_V + 7];\t\/\/0 means unmatched else id of matched left verticle\n\nint n, m, p;\t\/\/number of left, right verticles and number of edges\n\nbool dfs(int _leftId)\n{\n\tleft[_leftId].isVisited = true;\n\tfor (unsigned i = 0, r; i < left[_leftId].adj.size(); ++i)\n\t{\n\t\tr = left[_leftId].adj[i];\n\t\tif (rightVertMatch[r] == false || (!left[rightVertMatch[r]].isVisited && dfs(rightVertMatch[r])))\n\t\t{\n\t\t\trightVertMatch[r] = _leftId;\n\t\t\tleft[_leftId].isMatched = true;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint turboMatching()\n{\n\tbool find;\n\tint maximumMatching = 0;\n\tdo\n\t{\n\t\tfind = false;\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t{\n\t\t\tif (!left[i].isVisited && !left[i].isMatched && dfs(i))\n\t\t\t{\n\t\t\t\t++maximumMatching;\n\t\t\t\tfind = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t\tleft[i].isVisited = false;\n\t\t\n\t} while(find == true);\t\/\/while I can extend matching\n\treturn maximumMatching;\n}\n\nint main()\n{\n\tscanf(\"%d%d%d\", &n, &m, &p);\n\tfor (int i = 1, l, r; i <= p; ++i)\n\t{\n\t\tscanf(\"%d%d\", &l, &r);\n\t\tleft[l].adj.push_back(r);\n\t}\n\tint maximumMatching = turboMatching();\t\/\/maximumNumberOfMatches\n\tprintf(\"%d\\n\", maximumMatching);\n\treturn 0;\n}<commit_msg>turbomatching description update<commit_after>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2016 CStanKonrad\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n\nBased on ILOCAMP lecture\n*\/\n\n#include <cstdio>\n#include <vector>\n\nconst int MAX_NUM_OF_LEFT_V = 50000;\nconst int MAX_NUM_OF_RIGHT_V = 50000;\n\nstruct SLeftVerticle\n{\n\tstd::vector<int> adj;\t\/\/Adjacent\n\tbool isMatched = false;\n\tbool isVisited = false;\n} left[MAX_NUM_OF_LEFT_V + 7];\n\nint rightVertMatch[MAX_NUM_OF_RIGHT_V + 7];\t\/\/0 means unmatched else id of matched left verticle\n\nint n, m, p;\t\/\/number of left, right verticles and number of edges\n\nbool dfs(int _leftId)\n{\n\tleft[_leftId].isVisited = true;\n\tfor (unsigned i = 0, r; i < left[_leftId].adj.size(); ++i)\n\t{\n\t\tr = left[_leftId].adj[i];\n\t\tif (rightVertMatch[r] == false || (!left[rightVertMatch[r]].isVisited && dfs(rightVertMatch[r])))\n\t\t{\n\t\t\trightVertMatch[r] = _leftId;\n\t\t\tleft[_leftId].isMatched = true;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nint turboMatching()\n{\n\tbool find;\n\tint maximumMatching = 0;\n\tdo\n\t{\n\t\tfind = false;\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t{\n\t\t\tif (!left[i].isVisited && !left[i].isMatched && dfs(i))\n\t\t\t{\n\t\t\t\t++maximumMatching;\n\t\t\t\tfind = true;\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 1; i <= n; ++i)\n\t\t\tleft[i].isVisited = false;\n\t\t\n\t} while(find == true);\t\/\/while I can extend matching\n\treturn maximumMatching;\n}\n\nint main()\n{\n\tscanf(\"%d%d%d\", &n, &m, &p);\n\tfor (int i = 1, l, r; i <= p; ++i)\n\t{\n\t\tscanf(\"%d%d\", &l, &r);\n\t\tleft[l].adj.push_back(r);\n\t}\n\tint maximumMatching = turboMatching();\t\/\/maximumNumberOfMatches\n\tprintf(\"%d\\n\", maximumMatching);\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project * \n\/\/* ALICE Experiment at CERN, All rights reserved. *\n\/\/* *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no> *\n\/\/* for The ALICE HLT Project. *\n\/\/* *\n\/\/* Permission to use, copy, modify and distribute this software and its *\n\/\/* documentation strictly for non-commercial purposes is hereby granted *\n\/\/* without fee, provided that the above copyright notice appears in all *\n\/\/* copies and that both the copyright notice and this permission notice *\n\/\/* appear in the supporting documentation. The authors make no claims *\n\/\/* about the suitability of this software for any purpose. It is *\n\/\/* provided \"as is\" without express or implied warranty. *\n\/\/**************************************************************************\n\n\/\/\/ @file AliHLTDataInflaterHuffman.cxx\n\/\/\/ @author Matthias Richter\n\/\/\/ @date 2011-09-01\n\/\/\/ @brief Data inflater implementation for huffman encoded data\n\/\/\/ @note \n\n#include \"AliHLTDataInflaterHuffman.h\"\n#include \"AliHLTHuffman.h\"\n#include \"TList.h\"\n\n\/** ROOT macro for the implementation of ROOT specific class methods *\/\nClassImp(AliHLTDataInflaterHuffman)\n\nAliHLTDataInflaterHuffman::AliHLTDataInflaterHuffman()\n : AliHLTDataInflater()\n , fHuffmanCoders()\n , fHuffmanCoderList(NULL)\n , fCurrentParameter(-1)\n , fLegacyMode(-1)\n{\n \/\/ see header file for class documentation\n \/\/ or\n \/\/ refer to README to build package\n \/\/ or\n \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n}\n\nAliHLTDataInflaterHuffman::~AliHLTDataInflaterHuffman()\n{\n \/\/ destructor\n}\n\nint AliHLTDataInflaterHuffman::AddParameterDefinition(const char* name, unsigned bitLength)\n{\n \/\/\/ search a parameter definition in the decoder configuration, and set the index\n \/\/\/ array, return reference id\n \/\/\/ TODO: this code is a copy of AliHLTDataDeflaterHuffman::AddParameterDefinition\n \/\/\/ make a common base class\n if (!name) return -EINVAL;\n if (!fHuffmanCoderList) return -ENODEV;\n TObject* pObj=fHuffmanCoderList->FindObject(name);\n if (!pObj) {\n HLTError(\"can not find decoder of id '%s'\", name);\n return -ENOENT;\n }\n AliHLTHuffman* pHuffman=dynamic_cast<AliHLTHuffman*>(pObj);\n if (!pHuffman) {\n HLTError(\"object %s has wrong type, expected AliHLTHuffman\", name);\n return -EBADF;\n }\n if (pHuffman->GetMaxBits()!=bitLength) {\n HLTError(\"mismatch in bitlengt: can not use decoder %s of length %d for encoding of %d bits\", pHuffman->GetName(), pHuffman->GetMaxBits(), bitLength);\n return -EPERM;\n }\n\n fHuffmanCoders.push_back(pHuffman);\n return fHuffmanCoders.size()-1;\n}\n\nint AliHLTDataInflaterHuffman::InitDecoders(TList* decoderlist)\n{\n \/\/\/ init list of decoders\n \/\/\/ expects to be an external pointer, valid throughout the livetime of\n \/\/\/ the instance\n \/\/\/ TODO: this code is a copy of AliHLTDataDeflaterHuffman::InitDecoders\n \/\/\/ make a common base class\n if (!decoderlist) return -EINVAL;\n if (!fHuffmanCoderList) {\n fHuffmanCoderList=new TList;\n } else {\n if (fHuffmanCoderList->GetEntries()>0 && fHuffmanCoderList->IsOwner()) {\n HLTWarning(\"list of decoders owns already %d object(s), but disabling ownership now because of new external pointers\");\n }\n }\n if (!fHuffmanCoderList) return -ENOMEM;\n fHuffmanCoderList->SetOwner(kFALSE);\n TIter next(decoderlist);\n TObject* pObj=NULL;\n while ((pObj=next())!=NULL) {\n if (dynamic_cast<AliHLTHuffman*>(pObj)==NULL) continue;\n if (fHuffmanCoderList->FindObject(pObj->GetName())) {\n HLTError(\"duplicate entry of name '%s'\", pObj->GetName());\n return -EEXIST;\n }\n fHuffmanCoderList->Add(pObj);\n }\n\n return fHuffmanCoderList->GetEntries();\n}\n\nbool AliHLTDataInflaterHuffman::NextValue(AliHLTUInt64_t& value, AliHLTUInt32_t& length)\n{\n \/\/\/ overloaded from AliHLTDataInflater\n \/\/\/ functions reads the sequence of parameters as defined by the decoder\n \/\/\/ list, than it starts at the first parameter again\n value=0;\n length=0;\n AliHLTUInt64_t input=0;\n AliHLTUInt32_t inputLength=64;\n if (GetRemainingBitDataSizeBytes()<=sizeof(AliHLTUInt64_t)) {\n inputLength=8*GetRemainingBitDataSizeBytes();\n inputLength-=(7-GetCurrentBitInputPosition());\n }\n if (!InputBits(input, inputLength)) return false;\n if (fLegacyMode!=0) {\n if ((++fCurrentParameter)>=(int)fHuffmanCoders.size()) fCurrentParameter=0;\n fLegacyMode=1;\n }\n if (fHuffmanCoders.size()==0 || fCurrentParameter<0) return false;\n \/\/ the huffman code is decoded from bit 0 corresponding to the top node and then to\n \/\/ the left. The bitstream stores the reversed huffman code from MSB to LSB to ensure\n \/\/ a continous bit stream, that's why then input word needs to be reversed before\n \/\/ decoding.\n \/\/ TODO: introducing DecodeReverse into AliHLTHuffman can speed up the reading\n std::bitset<64> bits;\n for (unsigned bit=0; bit<inputLength; bit++) {bits[inputLength-1-bit]=input&0x1;input>>=1;}\n AliHLTUInt32_t codeLength=0;\n if (!fHuffmanCoders[fCurrentParameter]->Decode(bits, value, length, codeLength)) return false;\n if (inputLength<codeLength) {\n HLTError(\"huffman decoder '%s' pretends to have %d bit(s) decoded, but only %d available\",\n\t fHuffmanCoders[fCurrentParameter]->GetName(), codeLength, inputLength);\n return false;\n }\n inputLength-=codeLength;\n RewindBitPosition(inputLength);\n\n return true;\n}\n<commit_msg>implementing cleanup functionality to use the same instance in multiple calls<commit_after>\/\/ $Id$\n\n\/\/**************************************************************************\n\/\/* This file is property of and copyright by the ALICE HLT Project * \n\/\/* ALICE Experiment at CERN, All rights reserved. *\n\/\/* *\n\/\/* Primary Authors: Matthias Richter <Matthias.Richter@ift.uib.no> *\n\/\/* for The ALICE HLT Project. *\n\/\/* *\n\/\/* Permission to use, copy, modify and distribute this software and its *\n\/\/* documentation strictly for non-commercial purposes is hereby granted *\n\/\/* without fee, provided that the above copyright notice appears in all *\n\/\/* copies and that both the copyright notice and this permission notice *\n\/\/* appear in the supporting documentation. The authors make no claims *\n\/\/* about the suitability of this software for any purpose. It is *\n\/\/* provided \"as is\" without express or implied warranty. *\n\/\/**************************************************************************\n\n\/\/\/ @file AliHLTDataInflaterHuffman.cxx\n\/\/\/ @author Matthias Richter\n\/\/\/ @date 2011-09-01\n\/\/\/ @brief Data inflater implementation for huffman encoded data\n\/\/\/ @note \n\n#include \"AliHLTDataInflaterHuffman.h\"\n#include \"AliHLTHuffman.h\"\n#include \"TList.h\"\n\n\/** ROOT macro for the implementation of ROOT specific class methods *\/\nClassImp(AliHLTDataInflaterHuffman)\n\nAliHLTDataInflaterHuffman::AliHLTDataInflaterHuffman()\n : AliHLTDataInflater()\n , fHuffmanCoders()\n , fHuffmanCoderList(NULL)\n , fCurrentParameter(-1)\n , fLegacyMode(-1)\n{\n \/\/ see header file for class documentation\n \/\/ or\n \/\/ refer to README to build package\n \/\/ or\n \/\/ visit http:\/\/web.ift.uib.no\/~kjeks\/doc\/alice-hlt\n}\n\nAliHLTDataInflaterHuffman::~AliHLTDataInflaterHuffman()\n{\n \/\/ destructor\n if (fHuffmanCoderList) delete fHuffmanCoderList;\n fHuffmanCoderList=NULL;\n}\n\nint AliHLTDataInflaterHuffman::AddParameterDefinition(const char* name, unsigned bitLength)\n{\n \/\/\/ search a parameter definition in the decoder configuration, and set the index\n \/\/\/ array, return reference id\n \/\/\/ TODO: this code is a copy of AliHLTDataDeflaterHuffman::AddParameterDefinition\n \/\/\/ make a common base class\n if (!name) return -EINVAL;\n if (!fHuffmanCoderList) return -ENODEV;\n TObject* pObj=fHuffmanCoderList->FindObject(name);\n if (!pObj) {\n HLTError(\"can not find decoder of id '%s'\", name);\n return -ENOENT;\n }\n AliHLTHuffman* pHuffman=dynamic_cast<AliHLTHuffman*>(pObj);\n if (!pHuffman) {\n HLTError(\"object %s has wrong type, expected AliHLTHuffman\", name);\n return -EBADF;\n }\n if (pHuffman->GetMaxBits()!=bitLength) {\n HLTError(\"mismatch in bitlengt: can not use decoder %s of length %d for encoding of %d bits\", pHuffman->GetName(), pHuffman->GetMaxBits(), bitLength);\n return -EPERM;\n }\n\n fHuffmanCoders.push_back(pHuffman);\n return fHuffmanCoders.size()-1;\n}\n\nint AliHLTDataInflaterHuffman::InitDecoders(TList* decoderlist)\n{\n \/\/\/ init list of decoders\n \/\/\/ expects to be an external pointer, valid throughout the livetime of\n \/\/\/ the instance\n \/\/\/ TODO: this code is a copy of AliHLTDataDeflaterHuffman::InitDecoders\n \/\/\/ make a common base class\n if (!decoderlist) return -EINVAL;\n if (!fHuffmanCoderList) {\n fHuffmanCoderList=new TList;\n } else {\n if (fHuffmanCoderList->GetEntries()>0 && fHuffmanCoderList->IsOwner()) {\n HLTWarning(\"list of decoders owns already %d object(s), but disabling ownership now because of new external pointers\");\n }\n }\n if (!fHuffmanCoderList) return -ENOMEM;\n fHuffmanCoderList->SetOwner(kFALSE);\n TIter next(decoderlist);\n TObject* pObj=NULL;\n while ((pObj=next())!=NULL) {\n if (dynamic_cast<AliHLTHuffman*>(pObj)==NULL) continue;\n if (fHuffmanCoderList->FindObject(pObj->GetName())) {\n HLTError(\"duplicate entry of name '%s'\", pObj->GetName());\n return -EEXIST;\n }\n fHuffmanCoderList->Add(pObj);\n }\n\n return fHuffmanCoderList->GetEntries();\n}\n\nbool AliHLTDataInflaterHuffman::NextValue(AliHLTUInt64_t& value, AliHLTUInt32_t& length)\n{\n \/\/\/ overloaded from AliHLTDataInflater\n \/\/\/ functions reads the sequence of parameters as defined by the decoder\n \/\/\/ list, than it starts at the first parameter again\n value=0;\n length=0;\n AliHLTUInt64_t input=0;\n AliHLTUInt32_t inputLength=64;\n if (GetRemainingBitDataSizeBytes()<=sizeof(AliHLTUInt64_t)) {\n inputLength=8*GetRemainingBitDataSizeBytes();\n inputLength-=(7-GetCurrentBitInputPosition());\n }\n if (!InputBits(input, inputLength)) return false;\n if (fLegacyMode!=0) {\n if ((++fCurrentParameter)>=(int)fHuffmanCoders.size()) fCurrentParameter=0;\n fLegacyMode=1;\n }\n if (fHuffmanCoders.size()==0 || fCurrentParameter<0) return false;\n \/\/ the huffman code is decoded from bit 0 corresponding to the top node and then to\n \/\/ the left. The bitstream stores the reversed huffman code from MSB to LSB to ensure\n \/\/ a continous bit stream, that's why then input word needs to be reversed before\n \/\/ decoding.\n \/\/ TODO: introducing DecodeReverse into AliHLTHuffman can speed up the reading\n std::bitset<64> bits;\n for (unsigned bit=0; bit<inputLength; bit++) {bits[inputLength-1-bit]=input&0x1;input>>=1;}\n AliHLTUInt32_t codeLength=0;\n if (!fHuffmanCoders[fCurrentParameter]->Decode(bits, value, length, codeLength)) return false;\n if (inputLength<codeLength) {\n HLTError(\"huffman decoder '%s' pretends to have %d bit(s) decoded, but only %d available\",\n\t fHuffmanCoders[fCurrentParameter]->GetName(), codeLength, inputLength);\n return false;\n }\n inputLength-=codeLength;\n RewindBitPosition(inputLength);\n\n return true;\n}\n\nvoid AliHLTDataInflaterHuffman::Clear(Option_t * option)\n{\n \/\/\/ clear the object\n fCurrentParameter=-1;\n\n if (strcmp(option, \"all\")==0) {\n fHuffmanCoders.clear();\n if (fHuffmanCoderList) delete fHuffmanCoderList;\n fHuffmanCoderList=NULL;\n }\n\n AliHLTDataInflater::Clear(option);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/webui_login_view.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/callback.h\"\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/chromeos\/accessibility\/accessibility_util.h\"\n#include \"chrome\/browser\/chromeos\/cros\/cros_library.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/session_manager_client.h\"\n#include \"chrome\/browser\/chromeos\/login\/proxy_settings_dialog.h\"\n#include \"chrome\/browser\/chromeos\/login\/webui_login_display.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view_chromeos.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/views\/dom_view.h\"\n#include \"chrome\/browser\/ui\/webui\/chromeos\/login\/oobe_ui.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/public\/browser\/render_view_host_observer.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/gfx\/size.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include \"chrome\/browser\/chromeos\/legacy_window_manager\/wm_ipc.h\"\n#include \"ui\/views\/widget\/native_widget_gtk.h\"\n#endif\n\n#if defined(USE_VIRTUAL_KEYBOARD)\n#include \"chrome\/browser\/ui\/virtual_keyboard\/virtual_keyboard_manager.h\"\n#endif\n\n#if defined(USE_AURA)\n#include \"chrome\/browser\/ui\/views\/aura\/chrome_shell_delegate.h\"\n#endif\n\nnamespace {\n\nconst char kViewClassName[] = \"browser\/chromeos\/login\/WebUILoginView\";\n\n\/\/ These strings must be kept in sync with handleAccelerator() in oobe.js.\nconst char kAccelNameAccessibility[] = \"accessibility\";\nconst char kAccelNameCancel[] = \"cancel\";\nconst char kAccelNameEnrollment[] = \"enrollment\";\n\n\/\/ Observes IPC messages from the FrameSniffer and notifies JS if error\n\/\/ appears.\nclass SnifferObserver : public content::RenderViewHostObserver {\n public:\n SnifferObserver(RenderViewHost* host, WebUI* webui)\n : content::RenderViewHostObserver(host), webui_(webui) {\n DCHECK(webui_);\n Send(new ChromeViewMsg_StartFrameSniffer(routing_id(),\n UTF8ToUTF16(\"gaia-frame\")));\n }\n\n virtual ~SnifferObserver() {}\n\n \/\/ IPC::Channel::Listener implementation.\n virtual bool OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(SnifferObserver, message)\n IPC_MESSAGE_HANDLER(ChromeViewHostMsg_FrameLoadingError, OnError)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n }\n\n private:\n void OnError(int error) {\n base::FundamentalValue error_value(error);\n webui_->CallJavascriptFunction(\"login.ErrorMessageScreen.onFrameError\",\n error_value);\n }\n\n WebUI* webui_;\n};\n\n\/\/ A View class which places its first child at the right most position.\nclass RightAlignedView : public views::View {\n public:\n virtual void Layout() OVERRIDE;\n virtual void ChildPreferredSizeChanged(View* child) OVERRIDE;\n};\n\nvoid RightAlignedView::Layout() {\n if (has_children()) {\n views::View* child = child_at(0);\n gfx::Size preferred_size = child->GetPreferredSize();\n child->SetBounds(width() - preferred_size.width(),\n 0, preferred_size.width(), preferred_size.height());\n }\n}\n\nvoid RightAlignedView::ChildPreferredSizeChanged(View* child) {\n Layout();\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ static\nconst int WebUILoginView::kStatusAreaCornerPadding = 5;\n\n\/\/ WebUILoginView public: ------------------------------------------------------\n\nWebUILoginView::WebUILoginView()\n : status_area_(NULL),\n webui_login_(NULL),\n login_window_(NULL),\n status_window_(NULL),\n host_window_frozen_(false),\n status_area_visibility_on_init_(true) {\n#if defined(USE_VIRTUAL_KEYBOARD)\n \/\/ Make sure the singleton VirtualKeyboardManager object is created.\n VirtualKeyboardManager::GetInstance();\n#endif\n accel_map_[ui::Accelerator(ui::VKEY_Z, false, true, true)] =\n kAccelNameAccessibility;\n accel_map_[ui::Accelerator(ui::VKEY_ESCAPE, false, false, false)] =\n kAccelNameCancel;\n accel_map_[ui::Accelerator(ui::VKEY_E, false, true, true)] =\n kAccelNameEnrollment;\n\n for (AccelMap::iterator i(accel_map_.begin()); i != accel_map_.end(); ++i)\n AddAccelerator(i->first);\n}\n\nWebUILoginView::~WebUILoginView() {\n if (status_window_)\n status_window_->CloseNow();\n status_window_ = NULL;\n}\n\nvoid WebUILoginView::Init(views::Widget* login_window) {\n login_window_ = login_window;\n webui_login_ = new DOMView();\n AddChildView(webui_login_);\n webui_login_->Init(ProfileManager::GetDefaultProfile(), NULL);\n webui_login_->SetVisible(true);\n\n TabContents* tab_contents = webui_login_->dom_contents()->tab_contents();\n tab_contents->set_delegate(this);\n\n tab_watcher_.reset(new TabFirstRenderWatcher(tab_contents, this));\n}\n\nstd::string WebUILoginView::GetClassName() const {\n return kViewClassName;\n}\n\nbool WebUILoginView::AcceleratorPressed(\n const ui::Accelerator& accelerator) {\n AccelMap::const_iterator entry = accel_map_.find(accelerator);\n if (entry == accel_map_.end())\n return false;\n\n if (!webui_login_)\n return true;\n\n WebUI* web_ui = GetWebUI();\n if (web_ui) {\n base::StringValue accel_name(entry->second);\n web_ui->CallJavascriptFunction(\"cr.ui.Oobe.handleAccelerator\",\n accel_name);\n }\n\n return true;\n}\n\ngfx::NativeWindow WebUILoginView::GetNativeWindow() const {\n return GetWidget()->GetNativeWindow();\n}\n\nvoid WebUILoginView::OnWindowCreated() {\n#if defined(TOOLKIT_USES_GTK)\n \/\/ Freezes host window update until the tab is rendered.\n host_window_frozen_ = static_cast<views::NativeWidgetGtk*>(\n GetWidget()->native_widget())->SuppressFreezeUpdates();\n#else\n \/\/ TODO(saintlou): Unclear if we need this for the !gtk case.\n \/\/ According to nkostylev it prevents the renderer from flashing with a\n \/\/ white solid background until the content is fully rendered.\n#endif\n}\n\nvoid WebUILoginView::UpdateWindowType() {\n#if defined(TOOLKIT_USES_GTK)\n std::vector<int> params;\n WmIpc::instance()->SetWindowType(\n GTK_WIDGET(GetNativeWindow()),\n WM_IPC_WINDOW_LOGIN_WEBUI,\n ¶ms);\n#endif\n}\n\nvoid WebUILoginView::LoadURL(const GURL & url) {\n webui_login_->LoadURL(url);\n webui_login_->RequestFocus();\n}\n\nWebUI* WebUILoginView::GetWebUI() {\n return webui_login_->dom_contents()->tab_contents()->web_ui();\n}\n\nvoid WebUILoginView::SetStatusAreaEnabled(bool enable) {\n if (status_area_)\n status_area_->MakeButtonsActive(enable);\n}\n\nvoid WebUILoginView::SetStatusAreaVisible(bool visible) {\n if (status_area_)\n status_area_->SetVisible(visible);\n else\n status_area_visibility_on_init_ = visible;\n}\n\n\/\/ WebUILoginView protected: ---------------------------------------------------\n\nvoid WebUILoginView::Layout() {\n DCHECK(webui_login_);\n webui_login_->SetBoundsRect(bounds());\n}\n\nvoid WebUILoginView::OnLocaleChanged() {\n \/\/ Proxy settings dialog contains localized strings.\n proxy_settings_dialog_.reset();\n SchedulePaint();\n}\n\nvoid WebUILoginView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\n\/\/ Overridden from StatusAreaButton::Delegate:\n\nbool WebUILoginView::ShouldExecuteStatusAreaCommand(\n const views::View* button_view, int command_id) const {\n if (command_id == StatusAreaButton::Delegate::SHOW_NETWORK_OPTIONS)\n return true;\n return false;\n}\n\nvoid WebUILoginView::ExecuteStatusAreaCommand(\n const views::View* button_view, int command_id) {\n if (command_id == StatusAreaButton::Delegate::SHOW_NETWORK_OPTIONS) {\n if (proxy_settings_dialog_.get() == NULL) {\n proxy_settings_dialog_.reset(new ProxySettingsDialog(NULL,\n GetNativeWindow()));\n }\n proxy_settings_dialog_->Show();\n }\n}\n\ngfx::Font WebUILoginView::GetStatusAreaFont(const gfx::Font& font) const {\n return font;\n}\n\nStatusAreaButton::TextStyle WebUILoginView::GetStatusAreaTextStyle() const {\n return StatusAreaButton::GRAY_PLAIN;\n}\n\nvoid WebUILoginView::ButtonVisibilityChanged(views::View* button_view) {\n status_area_->UpdateButtonVisibility();\n}\n\nvoid WebUILoginView::OnRenderHostCreated(RenderViewHost* host) {\n new SnifferObserver(host, GetWebUI());\n}\n\nvoid WebUILoginView::OnTabMainFrameLoaded() {\n VLOG(1) << \"WebUI login main frame loaded.\";\n}\n\nvoid WebUILoginView::OnTabMainFrameFirstRender() {\n VLOG(1) << \"WebUI login main frame rendered.\";\n StatusAreaViewChromeos::SetScreenMode(\n StatusAreaViewChromeos::LOGIN_MODE_WEBUI);\n \/\/ In aura there's a global status area shown already.\n#if defined(USE_AURA)\n status_area_ = ChromeShellDelegate::instance()->GetStatusArea();\n status_area_->SetVisible(status_area_visibility_on_init_);\n#else\n InitStatusArea();\n#endif\n\n#if defined(TOOLKIT_USES_GTK)\n if (host_window_frozen_) {\n host_window_frozen_ = false;\n\n \/\/ Unfreezes the host window since tab is rendered now.\n views::NativeWidgetGtk::UpdateFreezeUpdatesProperty(\n GetNativeWindow(), false);\n }\n#endif\n\n bool emit_login_visible = false;\n\n \/\/ In aura, there will be no window-manager. So chrome needs to emit the\n \/\/ 'login-prompt-visible' signal. This needs to happen here, after the page\n \/\/ has completed rendering itself.\n#if defined(USE_AURA)\n emit_login_visible = true;\n#endif\n if (emit_login_visible)\n chromeos::DBusThreadManager::Get()->GetSessionManagerClient()\n ->EmitLoginPromptVisible();\n\n OobeUI* oobe_ui = static_cast<OobeUI*>(GetWebUI());\n \/\/ Notify OOBE that the login frame has been rendered. Currently\n \/\/ this is used to start camera presence check.\n oobe_ui->OnLoginPromptVisible();\n}\n\nvoid WebUILoginView::InitStatusArea() {\n DCHECK(status_area_ == NULL);\n DCHECK(status_window_ == NULL);\n StatusAreaViewChromeos* status_area_chromeos = new StatusAreaViewChromeos();\n status_area_chromeos->Init(this);\n status_area_ = status_area_chromeos;\n status_area_->SetVisible(status_area_visibility_on_init_);\n\n \/\/ Width of |status_window| is meant to be large enough.\n \/\/ The current value of status_area_->GetPreferredSize().width()\n \/\/ will be too small when button status is changed.\n \/\/ (e.g. when CapsLock indicator appears)\n gfx::Size widget_size(width()\/2,\n status_area_->GetPreferredSize().height());\n const int widget_x = base::i18n::IsRTL() ?\n kStatusAreaCornerPadding :\n width() - widget_size.width() - kStatusAreaCornerPadding;\n gfx::Rect widget_bounds(widget_x, kStatusAreaCornerPadding,\n widget_size.width(), widget_size.height());\n \/\/ TODO(nkostylev|oshima): Make status area in the same window as\n \/\/ |webui_login_| once RenderWidgetHostViewViews and compositor are\n \/\/ ready.\n views::Widget::InitParams widget_params(\n views::Widget::InitParams::TYPE_WINDOW_FRAMELESS);\n widget_params.bounds = widget_bounds;\n widget_params.transparent = true;\n widget_params.parent_widget = login_window_;\n status_window_ = new views::Widget;\n status_window_->Init(widget_params);\n\n#if defined(TOOLKIT_USES_GTK)\n chromeos::WmIpc::instance()->SetWindowType(\n status_window_->GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n\n views::View* contents_view = new RightAlignedView;\n contents_view->AddChildView(status_area_);\n status_window_->SetContentsView(contents_view);\n status_window_->Show();\n}\n\n\/\/ WebUILoginView private: -----------------------------------------------------\n\nbool WebUILoginView::HandleContextMenu(const ContextMenuParams& params) {\n \/\/ Do not show the context menu.\n#ifndef NDEBUG\n return false;\n#else\n return true;\n#endif\n}\n\nbool WebUILoginView::IsPopupOrPanel(const TabContents* source) const {\n return true;\n}\n\nbool WebUILoginView::TakeFocus(bool reverse) {\n if (status_area_ && status_area_->IsVisible()) {\n \/\/ Forward the focus to the status area.\n base::Callback<void(bool)> return_focus_cb =\n base::Bind(&WebUILoginView::ReturnFocus, base::Unretained(this));\n status_area_->TakeFocus(reverse, return_focus_cb);\n status_area_->GetWidget()->Activate();\n }\n return true;\n}\n\nvoid WebUILoginView::ReturnFocus(bool reverse) {\n \/\/ Return the focus to the web contents.\n webui_login_->dom_contents()->tab_contents()->\n FocusThroughTabTraversal(reverse);\n GetWidget()->Activate();\n}\n\nvoid WebUILoginView::HandleKeyboardEvent(const NativeWebKeyboardEvent& event) {\n unhandled_keyboard_event_handler_.HandleKeyboardEvent(event,\n GetFocusManager());\n\n \/\/ Make sure error bubble is cleared on keyboard event. This is needed\n \/\/ when the focus is inside an iframe. Only clear on KeyDown to prevent hiding\n \/\/ an immediate authentication error (See crbug.com\/103643).\n if (event.type == WebKit::WebInputEvent::KeyDown) {\n WebUI* web_ui = GetWebUI();\n if (web_ui)\n web_ui->CallJavascriptFunction(\"cr.ui.Oobe.clearErrors\");\n }\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Protect status_area_ access<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/webui_login_view.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/callback.h\"\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/chromeos\/accessibility\/accessibility_util.h\"\n#include \"chrome\/browser\/chromeos\/cros\/cros_library.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/dbus_thread_manager.h\"\n#include \"chrome\/browser\/chromeos\/dbus\/session_manager_client.h\"\n#include \"chrome\/browser\/chromeos\/login\/proxy_settings_dialog.h\"\n#include \"chrome\/browser\/chromeos\/login\/webui_login_display.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view_chromeos.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/views\/dom_view.h\"\n#include \"chrome\/browser\/ui\/webui\/chromeos\/login\/oobe_ui.h\"\n#include \"chrome\/common\/render_messages.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/public\/browser\/render_view_host_observer.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/gfx\/size.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\n#if defined(TOOLKIT_USES_GTK)\n#include \"chrome\/browser\/chromeos\/legacy_window_manager\/wm_ipc.h\"\n#include \"ui\/views\/widget\/native_widget_gtk.h\"\n#endif\n\n#if defined(USE_VIRTUAL_KEYBOARD)\n#include \"chrome\/browser\/ui\/virtual_keyboard\/virtual_keyboard_manager.h\"\n#endif\n\n#if defined(USE_AURA)\n#include \"chrome\/browser\/ui\/views\/aura\/chrome_shell_delegate.h\"\n#endif\n\nnamespace {\n\nconst char kViewClassName[] = \"browser\/chromeos\/login\/WebUILoginView\";\n\n\/\/ These strings must be kept in sync with handleAccelerator() in oobe.js.\nconst char kAccelNameAccessibility[] = \"accessibility\";\nconst char kAccelNameCancel[] = \"cancel\";\nconst char kAccelNameEnrollment[] = \"enrollment\";\n\n\/\/ Observes IPC messages from the FrameSniffer and notifies JS if error\n\/\/ appears.\nclass SnifferObserver : public content::RenderViewHostObserver {\n public:\n SnifferObserver(RenderViewHost* host, WebUI* webui)\n : content::RenderViewHostObserver(host), webui_(webui) {\n DCHECK(webui_);\n Send(new ChromeViewMsg_StartFrameSniffer(routing_id(),\n UTF8ToUTF16(\"gaia-frame\")));\n }\n\n virtual ~SnifferObserver() {}\n\n \/\/ IPC::Channel::Listener implementation.\n virtual bool OnMessageReceived(const IPC::Message& message) {\n bool handled = true;\n IPC_BEGIN_MESSAGE_MAP(SnifferObserver, message)\n IPC_MESSAGE_HANDLER(ChromeViewHostMsg_FrameLoadingError, OnError)\n IPC_MESSAGE_UNHANDLED(handled = false)\n IPC_END_MESSAGE_MAP()\n return handled;\n }\n\n private:\n void OnError(int error) {\n base::FundamentalValue error_value(error);\n webui_->CallJavascriptFunction(\"login.ErrorMessageScreen.onFrameError\",\n error_value);\n }\n\n WebUI* webui_;\n};\n\n\/\/ A View class which places its first child at the right most position.\nclass RightAlignedView : public views::View {\n public:\n virtual void Layout() OVERRIDE;\n virtual void ChildPreferredSizeChanged(View* child) OVERRIDE;\n};\n\nvoid RightAlignedView::Layout() {\n if (has_children()) {\n views::View* child = child_at(0);\n gfx::Size preferred_size = child->GetPreferredSize();\n child->SetBounds(width() - preferred_size.width(),\n 0, preferred_size.width(), preferred_size.height());\n }\n}\n\nvoid RightAlignedView::ChildPreferredSizeChanged(View* child) {\n Layout();\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ static\nconst int WebUILoginView::kStatusAreaCornerPadding = 5;\n\n\/\/ WebUILoginView public: ------------------------------------------------------\n\nWebUILoginView::WebUILoginView()\n : status_area_(NULL),\n webui_login_(NULL),\n login_window_(NULL),\n status_window_(NULL),\n host_window_frozen_(false),\n status_area_visibility_on_init_(true) {\n#if defined(USE_VIRTUAL_KEYBOARD)\n \/\/ Make sure the singleton VirtualKeyboardManager object is created.\n VirtualKeyboardManager::GetInstance();\n#endif\n accel_map_[ui::Accelerator(ui::VKEY_Z, false, true, true)] =\n kAccelNameAccessibility;\n accel_map_[ui::Accelerator(ui::VKEY_ESCAPE, false, false, false)] =\n kAccelNameCancel;\n accel_map_[ui::Accelerator(ui::VKEY_E, false, true, true)] =\n kAccelNameEnrollment;\n\n for (AccelMap::iterator i(accel_map_.begin()); i != accel_map_.end(); ++i)\n AddAccelerator(i->first);\n}\n\nWebUILoginView::~WebUILoginView() {\n if (status_window_)\n status_window_->CloseNow();\n status_window_ = NULL;\n}\n\nvoid WebUILoginView::Init(views::Widget* login_window) {\n login_window_ = login_window;\n webui_login_ = new DOMView();\n AddChildView(webui_login_);\n webui_login_->Init(ProfileManager::GetDefaultProfile(), NULL);\n webui_login_->SetVisible(true);\n\n TabContents* tab_contents = webui_login_->dom_contents()->tab_contents();\n tab_contents->set_delegate(this);\n\n tab_watcher_.reset(new TabFirstRenderWatcher(tab_contents, this));\n}\n\nstd::string WebUILoginView::GetClassName() const {\n return kViewClassName;\n}\n\nbool WebUILoginView::AcceleratorPressed(\n const ui::Accelerator& accelerator) {\n AccelMap::const_iterator entry = accel_map_.find(accelerator);\n if (entry == accel_map_.end())\n return false;\n\n if (!webui_login_)\n return true;\n\n WebUI* web_ui = GetWebUI();\n if (web_ui) {\n base::StringValue accel_name(entry->second);\n web_ui->CallJavascriptFunction(\"cr.ui.Oobe.handleAccelerator\",\n accel_name);\n }\n\n return true;\n}\n\ngfx::NativeWindow WebUILoginView::GetNativeWindow() const {\n return GetWidget()->GetNativeWindow();\n}\n\nvoid WebUILoginView::OnWindowCreated() {\n#if defined(TOOLKIT_USES_GTK)\n \/\/ Freezes host window update until the tab is rendered.\n host_window_frozen_ = static_cast<views::NativeWidgetGtk*>(\n GetWidget()->native_widget())->SuppressFreezeUpdates();\n#else\n \/\/ TODO(saintlou): Unclear if we need this for the !gtk case.\n \/\/ According to nkostylev it prevents the renderer from flashing with a\n \/\/ white solid background until the content is fully rendered.\n#endif\n}\n\nvoid WebUILoginView::UpdateWindowType() {\n#if defined(TOOLKIT_USES_GTK)\n std::vector<int> params;\n WmIpc::instance()->SetWindowType(\n GTK_WIDGET(GetNativeWindow()),\n WM_IPC_WINDOW_LOGIN_WEBUI,\n ¶ms);\n#endif\n}\n\nvoid WebUILoginView::LoadURL(const GURL & url) {\n webui_login_->LoadURL(url);\n webui_login_->RequestFocus();\n}\n\nWebUI* WebUILoginView::GetWebUI() {\n return webui_login_->dom_contents()->tab_contents()->web_ui();\n}\n\nvoid WebUILoginView::SetStatusAreaEnabled(bool enable) {\n if (status_area_)\n status_area_->MakeButtonsActive(enable);\n}\n\nvoid WebUILoginView::SetStatusAreaVisible(bool visible) {\n if (status_area_)\n status_area_->SetVisible(visible);\n else\n status_area_visibility_on_init_ = visible;\n}\n\n\/\/ WebUILoginView protected: ---------------------------------------------------\n\nvoid WebUILoginView::Layout() {\n DCHECK(webui_login_);\n webui_login_->SetBoundsRect(bounds());\n}\n\nvoid WebUILoginView::OnLocaleChanged() {\n \/\/ Proxy settings dialog contains localized strings.\n proxy_settings_dialog_.reset();\n SchedulePaint();\n}\n\nvoid WebUILoginView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\n\/\/ Overridden from StatusAreaButton::Delegate:\n\nbool WebUILoginView::ShouldExecuteStatusAreaCommand(\n const views::View* button_view, int command_id) const {\n if (command_id == StatusAreaButton::Delegate::SHOW_NETWORK_OPTIONS)\n return true;\n return false;\n}\n\nvoid WebUILoginView::ExecuteStatusAreaCommand(\n const views::View* button_view, int command_id) {\n if (command_id == StatusAreaButton::Delegate::SHOW_NETWORK_OPTIONS) {\n if (proxy_settings_dialog_.get() == NULL) {\n proxy_settings_dialog_.reset(new ProxySettingsDialog(NULL,\n GetNativeWindow()));\n }\n proxy_settings_dialog_->Show();\n }\n}\n\ngfx::Font WebUILoginView::GetStatusAreaFont(const gfx::Font& font) const {\n return font;\n}\n\nStatusAreaButton::TextStyle WebUILoginView::GetStatusAreaTextStyle() const {\n return StatusAreaButton::GRAY_PLAIN;\n}\n\nvoid WebUILoginView::ButtonVisibilityChanged(views::View* button_view) {\n if (status_area_)\n status_area_->UpdateButtonVisibility();\n}\n\nvoid WebUILoginView::OnRenderHostCreated(RenderViewHost* host) {\n new SnifferObserver(host, GetWebUI());\n}\n\nvoid WebUILoginView::OnTabMainFrameLoaded() {\n VLOG(1) << \"WebUI login main frame loaded.\";\n}\n\nvoid WebUILoginView::OnTabMainFrameFirstRender() {\n VLOG(1) << \"WebUI login main frame rendered.\";\n StatusAreaViewChromeos::SetScreenMode(\n StatusAreaViewChromeos::LOGIN_MODE_WEBUI);\n \/\/ In aura there's a global status area shown already.\n#if defined(USE_AURA)\n status_area_ = ChromeShellDelegate::instance()->GetStatusArea();\n status_area_->SetVisible(status_area_visibility_on_init_);\n#else\n InitStatusArea();\n#endif\n\n#if defined(TOOLKIT_USES_GTK)\n if (host_window_frozen_) {\n host_window_frozen_ = false;\n\n \/\/ Unfreezes the host window since tab is rendered now.\n views::NativeWidgetGtk::UpdateFreezeUpdatesProperty(\n GetNativeWindow(), false);\n }\n#endif\n\n bool emit_login_visible = false;\n\n \/\/ In aura, there will be no window-manager. So chrome needs to emit the\n \/\/ 'login-prompt-visible' signal. This needs to happen here, after the page\n \/\/ has completed rendering itself.\n#if defined(USE_AURA)\n emit_login_visible = true;\n#endif\n if (emit_login_visible)\n chromeos::DBusThreadManager::Get()->GetSessionManagerClient()\n ->EmitLoginPromptVisible();\n\n OobeUI* oobe_ui = static_cast<OobeUI*>(GetWebUI());\n \/\/ Notify OOBE that the login frame has been rendered. Currently\n \/\/ this is used to start camera presence check.\n oobe_ui->OnLoginPromptVisible();\n}\n\nvoid WebUILoginView::InitStatusArea() {\n DCHECK(status_area_ == NULL);\n DCHECK(status_window_ == NULL);\n StatusAreaViewChromeos* status_area_chromeos = new StatusAreaViewChromeos();\n status_area_chromeos->Init(this);\n status_area_ = status_area_chromeos;\n status_area_->SetVisible(status_area_visibility_on_init_);\n\n \/\/ Width of |status_window| is meant to be large enough.\n \/\/ The current value of status_area_->GetPreferredSize().width()\n \/\/ will be too small when button status is changed.\n \/\/ (e.g. when CapsLock indicator appears)\n gfx::Size widget_size(width()\/2,\n status_area_->GetPreferredSize().height());\n const int widget_x = base::i18n::IsRTL() ?\n kStatusAreaCornerPadding :\n width() - widget_size.width() - kStatusAreaCornerPadding;\n gfx::Rect widget_bounds(widget_x, kStatusAreaCornerPadding,\n widget_size.width(), widget_size.height());\n \/\/ TODO(nkostylev|oshima): Make status area in the same window as\n \/\/ |webui_login_| once RenderWidgetHostViewViews and compositor are\n \/\/ ready.\n views::Widget::InitParams widget_params(\n views::Widget::InitParams::TYPE_WINDOW_FRAMELESS);\n widget_params.bounds = widget_bounds;\n widget_params.transparent = true;\n widget_params.parent_widget = login_window_;\n status_window_ = new views::Widget;\n status_window_->Init(widget_params);\n\n#if defined(TOOLKIT_USES_GTK)\n chromeos::WmIpc::instance()->SetWindowType(\n status_window_->GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n\n views::View* contents_view = new RightAlignedView;\n contents_view->AddChildView(status_area_);\n status_window_->SetContentsView(contents_view);\n status_window_->Show();\n}\n\n\/\/ WebUILoginView private: -----------------------------------------------------\n\nbool WebUILoginView::HandleContextMenu(const ContextMenuParams& params) {\n \/\/ Do not show the context menu.\n#ifndef NDEBUG\n return false;\n#else\n return true;\n#endif\n}\n\nbool WebUILoginView::IsPopupOrPanel(const TabContents* source) const {\n return true;\n}\n\nbool WebUILoginView::TakeFocus(bool reverse) {\n if (status_area_ && status_area_->IsVisible()) {\n \/\/ Forward the focus to the status area.\n base::Callback<void(bool)> return_focus_cb =\n base::Bind(&WebUILoginView::ReturnFocus, base::Unretained(this));\n status_area_->TakeFocus(reverse, return_focus_cb);\n status_area_->GetWidget()->Activate();\n }\n return true;\n}\n\nvoid WebUILoginView::ReturnFocus(bool reverse) {\n \/\/ Return the focus to the web contents.\n webui_login_->dom_contents()->tab_contents()->\n FocusThroughTabTraversal(reverse);\n GetWidget()->Activate();\n}\n\nvoid WebUILoginView::HandleKeyboardEvent(const NativeWebKeyboardEvent& event) {\n unhandled_keyboard_event_handler_.HandleKeyboardEvent(event,\n GetFocusManager());\n\n \/\/ Make sure error bubble is cleared on keyboard event. This is needed\n \/\/ when the focus is inside an iframe. Only clear on KeyDown to prevent hiding\n \/\/ an immediate authentication error (See crbug.com\/103643).\n if (event.type == WebKit::WebInputEvent::KeyDown) {\n WebUI* web_ui = GetWebUI();\n if (web_ui)\n web_ui->CallJavascriptFunction(\"cr.ui.Oobe.clearErrors\");\n }\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/webui_login_view.h\"\n\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_utils.h\"\n#include \"chrome\/browser\/chromeos\/login\/proxy_settings_dialog.h\"\n#include \"chrome\/browser\/chromeos\/status\/clock_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/input_method_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/network_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_views.h\"\n#include \"chrome\/browser\/ui\/touch\/frame\/keyboard_container_view.h\"\n#include \"chrome\/browser\/ui\/views\/dom_view.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/tab_contents_view_touch.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/common\/notification_service.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ui\/base\/x\/x11_util.h\"\n#include \"ui\/gfx\/transform.h\"\n#include \"views\/controls\/textfield\/textfield.h\"\n#include \"views\/widget\/widget.h\"\n\n\/\/ TODO(rharrison): Modify this class to support both touch and non-touch\n\nnamespace {\n\nconst int kKeyboardHeight = 300;\nconst int kKeyboardSlideDuration = 500; \/\/ In milliseconds\n\nPropertyAccessor<bool>* GetFocusedStateAccessor() {\n static PropertyAccessor<bool> state;\n return &state;\n}\n\nbool TabContentsHasFocus(const TabContents* contents) {\n views::View* view = static_cast<TabContentsViewTouch*>(contents->view());\n return view->Contains(view->GetFocusManager()->GetFocusedView());\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ static\nconst char WebUILoginView::kViewClassName[] =\n \"browser\/chromeos\/login\/WebUILoginView\";\n\n\/\/ WebUILoginView public: ------------------------------------------------------\n\nWebUILoginView::WebUILoginView()\n : profile_(NULL),\n status_area_(NULL),\n webui_login_(NULL),\n keyboard_showing_(false),\n focus_listener_added_(false),\n keyboard_(NULL) {\n}\n\nvoid WebUILoginView::Init(const GURL& login_url) {\n CHECK(!login_url.is_empty());\n\n profile_ = ProfileManager::GetDefaultProfile();\n\n webui_login_ = new DOMView();\n AddChildView(webui_login_);\n webui_login_->Init(profile_, NULL);\n webui_login_->LoadURL(login_url);\n webui_login_->SetVisible(true);\n\n InitStatusArea();\n\n registrar_.Add(this,\n NotificationType::FOCUS_CHANGED_IN_PAGE,\n NotificationService::AllSources());\n registrar_.Add(this,\n NotificationType::TAB_CONTENTS_DESTROYED,\n NotificationService::AllSources());\n}\n\n\/\/ static\nviews::Widget* WebUILoginView::CreateWindowContainingView(\n const gfx::Rect& bounds,\n const GURL& login_url,\n WebUILoginView** view) {\n views::Widget* window = new views::Widget;\n views::Widget::InitParams params(views::Widget::InitParams::TYPE_WINDOW);\n params.bounds = bounds;\n window->Init(params);\n *view = new WebUILoginView();\n (*view)->Init(login_url);\n\n window->SetContentsView(*view);\n\n (*view)->UpdateWindowType();\n\n return window;\n}\n\nstd::string WebUILoginView::GetClassName() const {\n return kViewClassName;\n}\n\ngfx::NativeWindow WebUILoginView::GetNativeWindow() const {\n return GetWidget()->GetNativeWindow();\n}\n\nvoid WebUILoginView::FocusWillChange(views::View* focused_before,\n views::View* focused_now) {\n VirtualKeyboardType before = DecideKeyboardStateForView(focused_before);\n VirtualKeyboardType now = DecideKeyboardStateForView(focused_now);\n if (before != now) {\n \/\/ TODO(varunjain): support other types of keyboard.\n UpdateKeyboardAndLayout(now == GENERIC);\n }\n}\n\n\/\/ WebUILoginView protected: ---------------------------------------------------\n\nvoid WebUILoginView::Layout() {\n const int kCornerPadding = 5;\n gfx::Size status_area_size = status_area_->GetPreferredSize();\n status_area_->SetBounds(\n width() - status_area_size.width() - kCornerPadding,\n kCornerPadding,\n status_area_size.width(),\n status_area_size.height());\n\n if (webui_login_)\n webui_login_->SetBoundsRect(bounds());\n\n \/\/ TODO(rharrison): Hide touch specific code behind TOUCH_UI defines\n if (!keyboard_)\n return;\n\n keyboard_->SetVisible(keyboard_showing_);\n gfx::Rect keyboard_bounds = bounds();\n keyboard_bounds.set_y(keyboard_bounds.height() - kKeyboardHeight);\n keyboard_bounds.set_height(kKeyboardHeight);\n keyboard_->SetBoundsRect(keyboard_bounds);\n}\n\nvoid WebUILoginView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\nProfile* WebUILoginView::GetProfile() const {\n return NULL;\n}\n\nvoid WebUILoginView::ExecuteBrowserCommand(int id) const {\n}\n\nbool WebUILoginView::ShouldOpenButtonOptions(\n const views::View* button_view) const {\n if (button_view == status_area_->network_view())\n return true;\n\n if (button_view == status_area_->clock_view() ||\n button_view == status_area_->input_method_view())\n return false;\n\n return true;\n}\n\nvoid WebUILoginView::OpenButtonOptions(const views::View* button_view) {\n if (button_view == status_area_->network_view()) {\n if (proxy_settings_dialog_.get() == NULL) {\n proxy_settings_dialog_.reset(new ProxySettingsDialog(\n this, GetNativeWindow()));\n }\n proxy_settings_dialog_->Show();\n }\n}\n\nStatusAreaHost::ScreenMode WebUILoginView::GetScreenMode() const {\n return kLoginMode;\n}\n\nStatusAreaHost::TextStyle WebUILoginView::GetTextStyle() const {\n return kWhitePlain;\n}\n\nvoid WebUILoginView::OnDialogClosed() {\n}\n\nvoid WebUILoginView::OnLocaleChanged() {\n \/\/ Proxy settings dialog contains localized strings.\n proxy_settings_dialog_.reset();\n SchedulePaint();\n}\n\n\/\/ WebUILoginView private: -----------------------------------------------------\n\nvoid WebUILoginView::InitStatusArea() {\n DCHECK(status_area_ == NULL);\n status_area_ = new StatusAreaView(this);\n status_area_->Init();\n AddChildView(status_area_);\n}\n\nvoid WebUILoginView::UpdateWindowType() {\n std::vector<int> params;\n WmIpc::instance()->SetWindowType(\n GTK_WIDGET(GetNativeWindow()),\n WM_IPC_WINDOW_LOGIN_WEBUI,\n ¶ms);\n}\n\nvoid WebUILoginView::InitVirtualKeyboard() {\n if (keyboard_)\n return;\n\n keyboard_ = new KeyboardContainerView(profile_, NULL);\n keyboard_->SetVisible(false);\n AddChildView(keyboard_);\n}\n\nvoid WebUILoginView::UpdateKeyboardAndLayout(bool should_show_keyboard) {\n if (should_show_keyboard)\n InitVirtualKeyboard();\n\n if (should_show_keyboard == keyboard_showing_)\n return;\n\n DCHECK(keyboard_);\n\n keyboard_showing_ = should_show_keyboard;\n Layout();\n}\n\nWebUILoginView::VirtualKeyboardType\n WebUILoginView::DecideKeyboardStateForView(views::View* view) {\n if (!view)\n return NONE;\n\n std::string cname = view->GetClassName();\n if (cname == views::Textfield::kViewClassName) {\n return GENERIC;\n } else if (cname == RenderWidgetHostViewViews::kViewClassName) {\n TabContents* contents = webui_login_->tab_contents();\n bool* editable = contents ? GetFocusedStateAccessor()->GetProperty(\n contents->property_bag()) : NULL;\n if (editable && *editable)\n return GENERIC;\n }\n return NONE;\n}\n\nvoid WebUILoginView::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::FOCUS_CHANGED_IN_PAGE) {\n \/\/ Only modify the keyboard state if the currently active tab sent the\n \/\/ notification.\n const TabContents* current_tab = webui_login_->tab_contents();\n TabContents* source_tab = Source<TabContents>(source).ptr();\n const bool editable = *Details<const bool>(details).ptr();\n\n if (current_tab == source_tab && TabContentsHasFocus(source_tab))\n UpdateKeyboardAndLayout(editable);\n\n \/\/ Save the state of the focused field so that the keyboard visibility\n \/\/ can be determined after tab switching.\n GetFocusedStateAccessor()->SetProperty(\n source_tab->property_bag(), editable);\n } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n GetFocusedStateAccessor()->DeleteProperty(\n Source<TabContents>(source).ptr()->property_bag());\n }\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Changed kKeyboardHeight in WebUILoginView to reflect change in TouchBrowserFrameView<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/webui_login_view.h\"\n\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_utils.h\"\n#include \"chrome\/browser\/chromeos\/login\/proxy_settings_dialog.h\"\n#include \"chrome\/browser\/chromeos\/status\/clock_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/input_method_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/network_menu_button.h\"\n#include \"chrome\/browser\/chromeos\/status\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/renderer_host\/render_widget_host_view_views.h\"\n#include \"chrome\/browser\/ui\/touch\/frame\/keyboard_container_view.h\"\n#include \"chrome\/browser\/ui\/views\/dom_view.h\"\n#include \"chrome\/browser\/ui\/views\/tab_contents\/tab_contents_view_touch.h\"\n#include \"content\/browser\/renderer_host\/render_view_host.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/common\/notification_service.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"ui\/base\/x\/x11_util.h\"\n#include \"ui\/gfx\/transform.h\"\n#include \"views\/controls\/textfield\/textfield.h\"\n#include \"views\/widget\/widget.h\"\n\n\/\/ TODO(rharrison): Modify this class to support both touch and non-touch\n\nnamespace {\n\nconst int kKeyboardHeight = 360;\nconst int kKeyboardSlideDuration = 500; \/\/ In milliseconds\n\nPropertyAccessor<bool>* GetFocusedStateAccessor() {\n static PropertyAccessor<bool> state;\n return &state;\n}\n\nbool TabContentsHasFocus(const TabContents* contents) {\n views::View* view = static_cast<TabContentsViewTouch*>(contents->view());\n return view->Contains(view->GetFocusManager()->GetFocusedView());\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ static\nconst char WebUILoginView::kViewClassName[] =\n \"browser\/chromeos\/login\/WebUILoginView\";\n\n\/\/ WebUILoginView public: ------------------------------------------------------\n\nWebUILoginView::WebUILoginView()\n : profile_(NULL),\n status_area_(NULL),\n webui_login_(NULL),\n keyboard_showing_(false),\n focus_listener_added_(false),\n keyboard_(NULL) {\n}\n\nvoid WebUILoginView::Init(const GURL& login_url) {\n CHECK(!login_url.is_empty());\n\n profile_ = ProfileManager::GetDefaultProfile();\n\n webui_login_ = new DOMView();\n AddChildView(webui_login_);\n webui_login_->Init(profile_, NULL);\n webui_login_->LoadURL(login_url);\n webui_login_->SetVisible(true);\n\n InitStatusArea();\n\n registrar_.Add(this,\n NotificationType::FOCUS_CHANGED_IN_PAGE,\n NotificationService::AllSources());\n registrar_.Add(this,\n NotificationType::TAB_CONTENTS_DESTROYED,\n NotificationService::AllSources());\n}\n\n\/\/ static\nviews::Widget* WebUILoginView::CreateWindowContainingView(\n const gfx::Rect& bounds,\n const GURL& login_url,\n WebUILoginView** view) {\n views::Widget* window = new views::Widget;\n views::Widget::InitParams params(views::Widget::InitParams::TYPE_WINDOW);\n params.bounds = bounds;\n window->Init(params);\n *view = new WebUILoginView();\n (*view)->Init(login_url);\n\n window->SetContentsView(*view);\n\n (*view)->UpdateWindowType();\n\n return window;\n}\n\nstd::string WebUILoginView::GetClassName() const {\n return kViewClassName;\n}\n\ngfx::NativeWindow WebUILoginView::GetNativeWindow() const {\n return GetWidget()->GetNativeWindow();\n}\n\nvoid WebUILoginView::FocusWillChange(views::View* focused_before,\n views::View* focused_now) {\n VirtualKeyboardType before = DecideKeyboardStateForView(focused_before);\n VirtualKeyboardType now = DecideKeyboardStateForView(focused_now);\n if (before != now) {\n \/\/ TODO(varunjain): support other types of keyboard.\n UpdateKeyboardAndLayout(now == GENERIC);\n }\n}\n\n\/\/ WebUILoginView protected: ---------------------------------------------------\n\nvoid WebUILoginView::Layout() {\n const int kCornerPadding = 5;\n gfx::Size status_area_size = status_area_->GetPreferredSize();\n status_area_->SetBounds(\n width() - status_area_size.width() - kCornerPadding,\n kCornerPadding,\n status_area_size.width(),\n status_area_size.height());\n\n if (webui_login_)\n webui_login_->SetBoundsRect(bounds());\n\n \/\/ TODO(rharrison): Hide touch specific code behind TOUCH_UI defines\n if (!keyboard_)\n return;\n\n keyboard_->SetVisible(keyboard_showing_);\n gfx::Rect keyboard_bounds = bounds();\n keyboard_bounds.set_y(keyboard_bounds.height() - kKeyboardHeight);\n keyboard_bounds.set_height(kKeyboardHeight);\n keyboard_->SetBoundsRect(keyboard_bounds);\n}\n\nvoid WebUILoginView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\nProfile* WebUILoginView::GetProfile() const {\n return NULL;\n}\n\nvoid WebUILoginView::ExecuteBrowserCommand(int id) const {\n}\n\nbool WebUILoginView::ShouldOpenButtonOptions(\n const views::View* button_view) const {\n if (button_view == status_area_->network_view())\n return true;\n\n if (button_view == status_area_->clock_view() ||\n button_view == status_area_->input_method_view())\n return false;\n\n return true;\n}\n\nvoid WebUILoginView::OpenButtonOptions(const views::View* button_view) {\n if (button_view == status_area_->network_view()) {\n if (proxy_settings_dialog_.get() == NULL) {\n proxy_settings_dialog_.reset(new ProxySettingsDialog(\n this, GetNativeWindow()));\n }\n proxy_settings_dialog_->Show();\n }\n}\n\nStatusAreaHost::ScreenMode WebUILoginView::GetScreenMode() const {\n return kLoginMode;\n}\n\nStatusAreaHost::TextStyle WebUILoginView::GetTextStyle() const {\n return kWhitePlain;\n}\n\nvoid WebUILoginView::OnDialogClosed() {\n}\n\nvoid WebUILoginView::OnLocaleChanged() {\n \/\/ Proxy settings dialog contains localized strings.\n proxy_settings_dialog_.reset();\n SchedulePaint();\n}\n\n\/\/ WebUILoginView private: -----------------------------------------------------\n\nvoid WebUILoginView::InitStatusArea() {\n DCHECK(status_area_ == NULL);\n status_area_ = new StatusAreaView(this);\n status_area_->Init();\n AddChildView(status_area_);\n}\n\nvoid WebUILoginView::UpdateWindowType() {\n std::vector<int> params;\n WmIpc::instance()->SetWindowType(\n GTK_WIDGET(GetNativeWindow()),\n WM_IPC_WINDOW_LOGIN_WEBUI,\n ¶ms);\n}\n\nvoid WebUILoginView::InitVirtualKeyboard() {\n if (keyboard_)\n return;\n\n keyboard_ = new KeyboardContainerView(profile_, NULL);\n keyboard_->SetVisible(false);\n AddChildView(keyboard_);\n}\n\nvoid WebUILoginView::UpdateKeyboardAndLayout(bool should_show_keyboard) {\n if (should_show_keyboard)\n InitVirtualKeyboard();\n\n if (should_show_keyboard == keyboard_showing_)\n return;\n\n DCHECK(keyboard_);\n\n keyboard_showing_ = should_show_keyboard;\n Layout();\n}\n\nWebUILoginView::VirtualKeyboardType\n WebUILoginView::DecideKeyboardStateForView(views::View* view) {\n if (!view)\n return NONE;\n\n std::string cname = view->GetClassName();\n if (cname == views::Textfield::kViewClassName) {\n return GENERIC;\n } else if (cname == RenderWidgetHostViewViews::kViewClassName) {\n TabContents* contents = webui_login_->tab_contents();\n bool* editable = contents ? GetFocusedStateAccessor()->GetProperty(\n contents->property_bag()) : NULL;\n if (editable && *editable)\n return GENERIC;\n }\n return NONE;\n}\n\nvoid WebUILoginView::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n if (type == NotificationType::FOCUS_CHANGED_IN_PAGE) {\n \/\/ Only modify the keyboard state if the currently active tab sent the\n \/\/ notification.\n const TabContents* current_tab = webui_login_->tab_contents();\n TabContents* source_tab = Source<TabContents>(source).ptr();\n const bool editable = *Details<const bool>(details).ptr();\n\n if (current_tab == source_tab && TabContentsHasFocus(source_tab))\n UpdateKeyboardAndLayout(editable);\n\n \/\/ Save the state of the focused field so that the keyboard visibility\n \/\/ can be determined after tab switching.\n GetFocusedStateAccessor()->SetProperty(\n source_tab->property_bag(), editable);\n } else if (type == NotificationType::TAB_CONTENTS_DESTROYED) {\n GetFocusedStateAccessor()->DeleteProperty(\n Source<TabContents>(source).ptr()->property_bag());\n }\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: intro.hxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 16:52:34 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _SFX_INTRO_HXX\n#define _SFX_INTRO_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#ifndef _SV_WRKWIN_HXX\n#include <vcl\/wrkwin.hxx>\n#endif\n#ifndef _SV_BITMAP_HXX\n#include <vcl\/bitmap.hxx>\n#endif\n\n\/\/ class IntroWindow_Impl ------------------------------------------------\n\nclass IntroWindow_Impl : public WorkWindow\n{\nprivate:\n Bitmap aIntroBmp;\n\n void Init();\n\npublic:\n IntroWindow_Impl( const Bitmap& rBmp );\n ~IntroWindow_Impl();\n\n virtual void Paint( const Rectangle& );\n\n void Slide();\n};\n\n#endif \/\/ #ifndef _SFX_INTRO_HXX\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.1086); FILE MERGED 2005\/09\/06 13:05:31 rt 1.1.1.1.1086.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: intro.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 19:04:44 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _SFX_INTRO_HXX\n#define _SFX_INTRO_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#ifndef _SV_WRKWIN_HXX\n#include <vcl\/wrkwin.hxx>\n#endif\n#ifndef _SV_BITMAP_HXX\n#include <vcl\/bitmap.hxx>\n#endif\n\n\/\/ class IntroWindow_Impl ------------------------------------------------\n\nclass IntroWindow_Impl : public WorkWindow\n{\nprivate:\n Bitmap aIntroBmp;\n\n void Init();\n\npublic:\n IntroWindow_Impl( const Bitmap& rBmp );\n ~IntroWindow_Impl();\n\n virtual void Paint( const Rectangle& );\n\n void Slide();\n};\n\n#endif \/\/ #ifndef _SFX_INTRO_HXX\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkFixedWidthTextReader.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*-------------------------------------------------------------------------\n Copyright 2008 Sandia Corporation.\n Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,\n the U.S. Government retains certain rights in this software.\n-------------------------------------------------------------------------*\/\n\n#include \"vtkFixedWidthTextReader.h\"\n#include \"vtkCommand.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkStdString.h\"\n#include \"vtkIOStream.h\"\n\n#include <vtksys\/stl\/algorithm>\n#include <vtksys\/stl\/vector>\n#include <vtksys\/ios\/fstream>\n\n#include <ctype.h>\n\nvtkStandardNewMacro(vtkFixedWidthTextReader);\n\n\/\/ Function body at bottom of file\nstatic int splitString(const vtkStdString& input,\n unsigned int fieldWidth,\n bool stripWhitespace,\n vtksys_stl::vector<vtkStdString>& results,\n bool includeEmpties=true);\n\n\n\/\/ I need a safe way to read a line of arbitrary length. It exists on\n\/\/ some platforms but not others so I'm afraid I have to write it\n\/\/ myself.\nstatic int my_getline(istream& stream, vtkStdString &output, char delim='\\n');\n\n\/\/ ----------------------------------------------------------------------\n\nvtkFixedWidthTextReader::vtkFixedWidthTextReader()\n{\n this->FileName = NULL;\n this->StripWhiteSpace = false;\n this->HaveHeaders = false;\n this->FieldWidth = 10;\n this->SetNumberOfInputPorts(0);\n this->SetNumberOfOutputPorts(1);\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvtkFixedWidthTextReader::~vtkFixedWidthTextReader()\n{\n this->SetFileName(0);\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvoid vtkFixedWidthTextReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n os << indent << \"FileName: \"\n << (this->FileName ? this->FileName : \"(none)\") << endl;\n os << indent << \"Field width: \" << this->FieldWidth << endl;\n os << indent << \"Strip leading\/trailing whitespace: \"\n << (this->StripWhiteSpace ? \"Yes\" : \"No\") << endl;\n os << indent << \"HaveHeaders: \"\n << (this->HaveHeaders ? \"Yes\" : \"No\") << endl;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nint vtkFixedWidthTextReader::RequestData(\n vtkInformation*,\n vtkInformationVector**,\n vtkInformationVector* outputVector)\n{\n int numLines = 0;\n\n \/\/ Check that the filename has been specified\n if (!this->FileName)\n {\n vtkErrorMacro(\"vtkFixedWidthTextReader: You must specify a filename!\");\n return 2;\n }\n\n vtksys_ios::ifstream infile(this->FileName, ios::in);\n if (!infile || infile.fail())\n {\n vtkErrorMacro(<<\"vtkFixedWidthTextReader: Couldn't open file!\");\n return 2;\n }\n\n \/\/ The first line of the file might contain the headers, so we want\n \/\/ to be a little bit careful about it. If we don't have headers\n \/\/ we'll have to make something up.\n vtksys_stl::vector<vtkStdString> headers;\n vtksys_stl::vector<vtkStdString> firstLineFields;\n vtkStdString firstLine;\n\n my_getline(infile, firstLine);\n\n\/\/ vtkDebugMacro(<<\"First line of file: \" << firstLine.c_str());\n\n if (this->HaveHeaders)\n {\n splitString(firstLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n headers);\n }\n else\n {\n splitString(firstLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n firstLineFields);\n\n for (unsigned int i = 0; i < firstLineFields.size(); ++i)\n {\n \/\/ I know it's not a great idea to use sprintf. It's safe right\n \/\/ here because an unsigned int will never take up enough\n \/\/ characters to fill up this buffer.\n char fieldName[64];\n sprintf(fieldName, \"Field %d\", i);\n headers.push_back(fieldName);\n }\n }\n\n vtkTable *table = vtkTable::GetData(outputVector);\n\n \/\/ Now we can create the arrays that will hold the data for each\n \/\/ field.\n vtksys_stl::vector<vtkStdString>::const_iterator fieldIter;\n for(fieldIter = headers.begin(); fieldIter != headers.end(); ++fieldIter)\n {\n vtkStringArray* array = vtkStringArray::New();\n array->SetName((*fieldIter).c_str());\n table->AddColumn(array);\n array->Delete();\n }\n\n \/\/ If the first line did not contain headers then we need to add it\n \/\/ to the table.\n if (!this->HaveHeaders)\n {\n vtkVariantArray* dataArray = vtkVariantArray::New();\n vtksys_stl::vector<vtkStdString>::const_iterator I;\n for(I = firstLineFields.begin(); I != firstLineFields.end(); ++I)\n {\n dataArray->InsertNextValue(vtkVariant(*I));\n }\n\n \/\/ Insert the data into the table\n table->InsertNextRow(dataArray);\n dataArray->Delete();\n }\n\n \/\/ Read the file line-by-line and add it to the table.\n vtkStdString nextLine;\n while (my_getline(infile, nextLine))\n {\n ++numLines;\n if (numLines > 0 && numLines % 100 == 0)\n {\n float numLinesRead = numLines;\n this->InvokeEvent(vtkCommand::ProgressEvent, &numLinesRead);\n }\n\n vtkDebugMacro(<<\"Next line: \" << nextLine.c_str());\n vtksys_stl::vector<vtkStdString> dataVector;\n\n \/\/ Split string on the delimiters\n splitString(nextLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n dataVector);\n\n vtkDebugMacro(<<\"Split into \" << dataVector.size() << \" fields\");\n \/\/ Add data to the output arrays\n\n \/\/ Convert from vector to variant array\n vtkVariantArray* dataArray = vtkVariantArray::New();\n vtksys_stl::vector<vtkStdString>::const_iterator I;\n for(I = dataVector.begin(); I != dataVector.end(); ++I)\n {\n dataArray->InsertNextValue(vtkVariant(*I));\n }\n\n \/\/ Pad out any missing columns\n while (dataArray->GetNumberOfTuples() < table->GetNumberOfColumns())\n {\n dataArray->InsertNextValue(vtkVariant());\n }\n\n \/\/ Insert the data into the table\n table->InsertNextRow(dataArray);\n dataArray->Delete();\n }\n\n infile.close();\n\n return 1;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nstatic int\nsplitString(const vtkStdString& input,\n unsigned int fieldWidth,\n bool stripWhitespace,\n vtksys_stl::vector<vtkStdString>& results,\n bool includeEmpties)\n{\n if (input.size() == 0)\n {\n return 0;\n }\n\n unsigned int thisField = 0;\n vtkStdString thisFieldText;\n vtkStdString parsedField;\n\n\n while (thisField * fieldWidth < input.size())\n {\n thisFieldText = input.substr(thisField*fieldWidth, fieldWidth);\n\n if (stripWhitespace)\n {\n unsigned int startIndex = 0, endIndex = static_cast<unsigned int>(thisFieldText.size()) - 1;\n while (startIndex < thisFieldText.size() &&\n isspace(static_cast<int>(thisFieldText.at(startIndex))))\n {\n ++startIndex;\n }\n while (endIndex > 0 &&\n isspace(static_cast<int>(thisFieldText.at(endIndex))))\n {\n -- endIndex;\n }\n\n if (startIndex <= endIndex)\n {\n parsedField =\n thisFieldText.substr(startIndex, (endIndex - startIndex) + 1);\n }\n else\n {\n parsedField = vtkStdString();\n }\n }\n else\n {\n parsedField = thisFieldText;\n }\n ++ thisField;\n if (parsedField.size() > 0 || includeEmpties)\n {\n results.push_back(parsedField);\n }\n }\n\n return static_cast<int>(results.size());\n}\n\n\/\/ ----------------------------------------------------------------------\n\nstatic int\nmy_getline(istream& in, vtkStdString &out, char delimiter)\n{\n out = vtkStdString();\n unsigned int numCharactersRead = 0;\n int nextValue = 0;\n\n while ((nextValue = in.get()) != EOF &&\n numCharactersRead < out.max_size())\n {\n ++numCharactersRead;\n\n char downcast = static_cast<char>(nextValue);\n if (downcast != delimiter && downcast != 0x0d)\n {\n out += downcast;\n }\n else\n {\n return numCharactersRead;\n }\n }\n\n return numCharactersRead;\n}\n\n\n\n<commit_msg>Fixed minor format string mismatch<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkFixedWidthTextReader.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n\/*-------------------------------------------------------------------------\n Copyright 2008 Sandia Corporation.\n Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,\n the U.S. Government retains certain rights in this software.\n-------------------------------------------------------------------------*\/\n\n#include \"vtkFixedWidthTextReader.h\"\n#include \"vtkCommand.h\"\n#include \"vtkTable.h\"\n#include \"vtkVariantArray.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkStdString.h\"\n#include \"vtkIOStream.h\"\n\n#include <vtksys\/stl\/algorithm>\n#include <vtksys\/stl\/vector>\n#include <vtksys\/ios\/fstream>\n\n#include <ctype.h>\n\nvtkStandardNewMacro(vtkFixedWidthTextReader);\n\n\/\/ Function body at bottom of file\nstatic int splitString(const vtkStdString& input,\n unsigned int fieldWidth,\n bool stripWhitespace,\n vtksys_stl::vector<vtkStdString>& results,\n bool includeEmpties=true);\n\n\n\/\/ I need a safe way to read a line of arbitrary length. It exists on\n\/\/ some platforms but not others so I'm afraid I have to write it\n\/\/ myself.\nstatic int my_getline(istream& stream, vtkStdString &output, char delim='\\n');\n\n\/\/ ----------------------------------------------------------------------\n\nvtkFixedWidthTextReader::vtkFixedWidthTextReader()\n{\n this->FileName = NULL;\n this->StripWhiteSpace = false;\n this->HaveHeaders = false;\n this->FieldWidth = 10;\n this->SetNumberOfInputPorts(0);\n this->SetNumberOfOutputPorts(1);\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvtkFixedWidthTextReader::~vtkFixedWidthTextReader()\n{\n this->SetFileName(0);\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvoid vtkFixedWidthTextReader::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os, indent);\n os << indent << \"FileName: \"\n << (this->FileName ? this->FileName : \"(none)\") << endl;\n os << indent << \"Field width: \" << this->FieldWidth << endl;\n os << indent << \"Strip leading\/trailing whitespace: \"\n << (this->StripWhiteSpace ? \"Yes\" : \"No\") << endl;\n os << indent << \"HaveHeaders: \"\n << (this->HaveHeaders ? \"Yes\" : \"No\") << endl;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nint vtkFixedWidthTextReader::RequestData(\n vtkInformation*,\n vtkInformationVector**,\n vtkInformationVector* outputVector)\n{\n int numLines = 0;\n\n \/\/ Check that the filename has been specified\n if (!this->FileName)\n {\n vtkErrorMacro(\"vtkFixedWidthTextReader: You must specify a filename!\");\n return 2;\n }\n\n vtksys_ios::ifstream infile(this->FileName, ios::in);\n if (!infile || infile.fail())\n {\n vtkErrorMacro(<<\"vtkFixedWidthTextReader: Couldn't open file!\");\n return 2;\n }\n\n \/\/ The first line of the file might contain the headers, so we want\n \/\/ to be a little bit careful about it. If we don't have headers\n \/\/ we'll have to make something up.\n vtksys_stl::vector<vtkStdString> headers;\n vtksys_stl::vector<vtkStdString> firstLineFields;\n vtkStdString firstLine;\n\n my_getline(infile, firstLine);\n\n\/\/ vtkDebugMacro(<<\"First line of file: \" << firstLine.c_str());\n\n if (this->HaveHeaders)\n {\n splitString(firstLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n headers);\n }\n else\n {\n splitString(firstLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n firstLineFields);\n\n for (unsigned int i = 0; i < firstLineFields.size(); ++i)\n {\n \/\/ I know it's not a great idea to use sprintf. It's safe right\n \/\/ here because an unsigned int will never take up enough\n \/\/ characters to fill up this buffer.\n char fieldName[64];\n sprintf(fieldName, \"Field %u\", i);\n headers.push_back(fieldName);\n }\n }\n\n vtkTable *table = vtkTable::GetData(outputVector);\n\n \/\/ Now we can create the arrays that will hold the data for each\n \/\/ field.\n vtksys_stl::vector<vtkStdString>::const_iterator fieldIter;\n for(fieldIter = headers.begin(); fieldIter != headers.end(); ++fieldIter)\n {\n vtkStringArray* array = vtkStringArray::New();\n array->SetName((*fieldIter).c_str());\n table->AddColumn(array);\n array->Delete();\n }\n\n \/\/ If the first line did not contain headers then we need to add it\n \/\/ to the table.\n if (!this->HaveHeaders)\n {\n vtkVariantArray* dataArray = vtkVariantArray::New();\n vtksys_stl::vector<vtkStdString>::const_iterator I;\n for(I = firstLineFields.begin(); I != firstLineFields.end(); ++I)\n {\n dataArray->InsertNextValue(vtkVariant(*I));\n }\n\n \/\/ Insert the data into the table\n table->InsertNextRow(dataArray);\n dataArray->Delete();\n }\n\n \/\/ Read the file line-by-line and add it to the table.\n vtkStdString nextLine;\n while (my_getline(infile, nextLine))\n {\n ++numLines;\n if (numLines > 0 && numLines % 100 == 0)\n {\n float numLinesRead = numLines;\n this->InvokeEvent(vtkCommand::ProgressEvent, &numLinesRead);\n }\n\n vtkDebugMacro(<<\"Next line: \" << nextLine.c_str());\n vtksys_stl::vector<vtkStdString> dataVector;\n\n \/\/ Split string on the delimiters\n splitString(nextLine,\n this->FieldWidth,\n this->StripWhiteSpace,\n dataVector);\n\n vtkDebugMacro(<<\"Split into \" << dataVector.size() << \" fields\");\n \/\/ Add data to the output arrays\n\n \/\/ Convert from vector to variant array\n vtkVariantArray* dataArray = vtkVariantArray::New();\n vtksys_stl::vector<vtkStdString>::const_iterator I;\n for(I = dataVector.begin(); I != dataVector.end(); ++I)\n {\n dataArray->InsertNextValue(vtkVariant(*I));\n }\n\n \/\/ Pad out any missing columns\n while (dataArray->GetNumberOfTuples() < table->GetNumberOfColumns())\n {\n dataArray->InsertNextValue(vtkVariant());\n }\n\n \/\/ Insert the data into the table\n table->InsertNextRow(dataArray);\n dataArray->Delete();\n }\n\n infile.close();\n\n return 1;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nstatic int\nsplitString(const vtkStdString& input,\n unsigned int fieldWidth,\n bool stripWhitespace,\n vtksys_stl::vector<vtkStdString>& results,\n bool includeEmpties)\n{\n if (input.size() == 0)\n {\n return 0;\n }\n\n unsigned int thisField = 0;\n vtkStdString thisFieldText;\n vtkStdString parsedField;\n\n\n while (thisField * fieldWidth < input.size())\n {\n thisFieldText = input.substr(thisField*fieldWidth, fieldWidth);\n\n if (stripWhitespace)\n {\n unsigned int startIndex = 0, endIndex = static_cast<unsigned int>(thisFieldText.size()) - 1;\n while (startIndex < thisFieldText.size() &&\n isspace(static_cast<int>(thisFieldText.at(startIndex))))\n {\n ++startIndex;\n }\n while (endIndex > 0 &&\n isspace(static_cast<int>(thisFieldText.at(endIndex))))\n {\n -- endIndex;\n }\n\n if (startIndex <= endIndex)\n {\n parsedField =\n thisFieldText.substr(startIndex, (endIndex - startIndex) + 1);\n }\n else\n {\n parsedField = vtkStdString();\n }\n }\n else\n {\n parsedField = thisFieldText;\n }\n ++ thisField;\n if (parsedField.size() > 0 || includeEmpties)\n {\n results.push_back(parsedField);\n }\n }\n\n return static_cast<int>(results.size());\n}\n\n\/\/ ----------------------------------------------------------------------\n\nstatic int\nmy_getline(istream& in, vtkStdString &out, char delimiter)\n{\n out = vtkStdString();\n unsigned int numCharactersRead = 0;\n int nextValue = 0;\n\n while ((nextValue = in.get()) != EOF &&\n numCharactersRead < out.max_size())\n {\n ++numCharactersRead;\n\n char downcast = static_cast<char>(nextValue);\n if (downcast != delimiter && downcast != 0x0d)\n {\n out += downcast;\n }\n else\n {\n return numCharactersRead;\n }\n }\n\n return numCharactersRead;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************\n *\n * Copyright (C) 1990-2020, Condor Team, Computer Sciences Department,\n * University of Wisconsin-Madison, WI.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\"); you\n * may not use this file except in compliance with the License. You may\n * obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ***************************************************************\/\n\n#include \"condor_common.h\"\n#include \"condor_config.h\"\n#include \"match_prefix.h\"\n#include <termios.h>\n#include <unistd.h>\n#include <grp.h>\n#include <signal.h>\n#include <algorithm>\n\n\/\/ condor_nsenter\n\/\/ \n\/\/ This is a replacement for the linux nsenter command to launch a\n\/\/ shell inside a container. We need this when running \n\/\/ condor_ssh_to_job to a job that has been launched inside singularity\n\/\/ Docker jobs use docker exec to enter the container, but there is no\n\/\/ equivalent in singularity. Standard nsenter isn't sufficient, as it\n\/\/ does not create a pty for the shell, and we need different command\n\/\/ line arguments to enter a non-setuid singularity container. This\n\/\/ is harder because the starter can't tell if singularity is setuid easily.\n\/\/\n\/\/ The architecture for ssh-to-job to a contained job is to land in an sshd\n\/\/ the starter forks *outside* the container. This is important because we\n\/\/ never want to assume anything about the container, even that there is an sshd\n\/\/ inside it. After the sshd starts, a script runs which runs condor_docker_enter\n\/\/ (even for singularity), which connects to a Unix Domain Socket, passes \n\/\/ stdin\/out\/err to the starter, which passes those to condor_nsenter, which \n\/\/ is runs as root. Rootly privilege is required to enter a setuid namespace\n\/\/ so this is how we acquire.\n\/\/\n\/\/ condor_nsenter enters the namespace, taking care to try to enter the user\n\/\/ namespace, which is only set up for non-setuid singularity, and drops\n\/\/ privileges to the uid and gid passed on the command line. It sets up\n\/\/ a pty for the shell to use, so all interactive processses will work.\n\/\/\n\/\/ A final problem is environment variables. Singularity, especially when\n\/\/ managing GPUs, sets some nvidia-related environment variables that the\n\/\/ condor starter doesn't know about. So, condor_nsenter extracts the environment\n\/\/ variables from the contained job process, and sets them in the shell\n\/\/ it spawns.\n\nvoid\nusage( char *cmd )\n{\n\tfprintf(stderr,\"Usage: %s [options] condor_* ....\\n\",cmd);\n\tfprintf(stderr,\"Where options are:\\n\");\n\tfprintf(stderr,\"-t target_pid:\\n\");\n\tfprintf(stderr,\"-S user_id:\\n\");\n\tfprintf(stderr,\"-G group_id:\\n\");\n\tfprintf(stderr,\" -help Display options\\n\");\n}\n\n\n\/\/ Before we exit, we need to reset the pty back to normal\n\/\/ if we put it in raw mode\n\nbool pty_is_raw = false;\nstruct termios old_tio;\nvoid reset_pty_and_exit(int signo) {\n\tif (pty_is_raw)\n\t\ttcsetattr(0, TCSAFLUSH, &old_tio);\n\texit(signo);\n}\n\nint main( int argc, char *argv[] )\n{\n\tstd::string condor_prefix;\n\tpid_t pid = 0;\n\tuid_t uid = 0;\n\tgid_t gid = 0;\n\n\t\/\/ parse command line args\n\tfor( int i=1; i<argc; i++ ) {\n\t\tif(is_arg_prefix(argv[i],\"-help\")) {\n\t\t\tusage(argv[0]);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ target pid to enter\n\t\tif(is_arg_prefix(argv[i],\"-t\")) {\n\t\t\tpid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ uid to switch to\n\t\tif(is_arg_prefix(argv[i],\"-S\")) {\n\t\t\tuid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ gid to switch to\n\t\tif(is_arg_prefix(argv[i],\"-G\")) {\n\t\t\tgid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t}\n\n\tif (pid < 1) {\n\t\tfprintf(stderr, \"missing -t argument > 1\\n\");\n\t\texit(1);\n\t}\t\n\n\tif (uid == 0) {\n\t\tfprintf(stderr, \"missing -S argument > 1\\n\");\n\t\texit(1);\n\t}\n\n\tif (gid == 0) {\n\t\tfprintf(stderr, \"missing -G argument > 1\\n\");\n\t\texit(1);\n\t}\n\n\t\/\/ slurp the enviroment out of our victim\n\tstd::string env;\n\tstd::string envfile;\n\tformatstr(envfile, \"\/proc\/%d\/environ\", pid);\n\t\n\tint e = open(envfile.c_str(), O_RDONLY);\n\tif (e < 0) {\n\t\tfprintf(stderr, \"Can't open %s %s\\n\", envfile.c_str(), strerror(errno));\n\t\texit(1);\n\t}\n\tchar buf[512];\n\tint bytesRead;\n\twhile ((bytesRead = read(e, &buf, 512)) > 0) {\n\t\tenv.append(buf, bytesRead);\n\t}\n\tclose(e);\n\t\n\t\/\/ make a vector to hold all the pointers to env entries\n\tstd::vector<const char *> envp;\n\n\t\/\/ the first one\n\tenvp.push_back(env.c_str());\n\tauto it = env.cbegin();\n\twhile (env.cend() != (it = std::find(it, env.cend(), '\\0'))) {\n\t\t\/\/ skip past null terminator\n\t\tit++;\t\n\t\tif (& (*it) != nullptr) {\n\t\t\tenvp.push_back(& (*it));\n\t\t}\n\t}\n\tenvp.push_back(nullptr);\n\tenvp.push_back(nullptr);\n\n\t\/\/ grab the fd for the cwd -- need to get this outside\n\t\/\/ but chdir inside the container\n\tstd::string cwdPath;\n\tformatstr(cwdPath, \"\/proc\/%d\/cwd\", pid);\n\tint rootFd = open(cwdPath.c_str(), O_RDONLY);\n\tif (rootFd < 0) {\n\t\tfprintf(stderr, \"Can't open %s\\n\", cwdPath.c_str());\n\t}\n\n\n\tstd::string filename;\n\n\t\/\/ start changing namespaces. Note that once we do this, things\n\t\/\/ get funny in this process\n\tformatstr(filename, \"\/proc\/%d\/ns\/uts\", pid);\n\tint fd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open uts namespace: %d %s\\n\", errno, strerror(errno));\n\t\texit(1);\n\t}\n\tint r = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\t\/\/ This means an unprivileged singularity, most likely\n\t\t\/\/ need to set user namespace instead.\n\t\tformatstr(filename, \"\/proc\/%d\/ns\/user\", pid);\n\t\tfd = open(filename.c_str(), O_RDONLY);\n\t\tif (fd < 0) {\n\t\t\tfprintf(stderr, \"Can't open user namespace: %d %s\\n\", errno, strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t\tr = setns(fd, 0);\n\t\tclose(fd);\n\t\tif (r < 0) {\n\t\t\tfprintf(stderr, \"Can't setns to user namespace: %s\\n\", strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t}\n\n\t\/\/ now the pid namespace\n\tformatstr(filename, \"\/proc\/%d\/ns\/pid\", pid);\n\tfd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open pid namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\tr = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setns to pid namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\n\t\/\/ finally the mnt namespace\n\tformatstr(filename, \"\/proc\/%d\/ns\/mnt\", pid);\n\tfd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open mnt namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\tr = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setns to mnt namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\n\tsetgroups(0, nullptr);\n\n\t\/\/ order matters!\n\tr = setgid(gid);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setgid to %d\\n\", gid);\n\t\texit(1);\n\t}\n\tr = setuid(uid);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setuid to %d\\n\", uid);\n\t\texit(1);\n\t}\n\n\tstruct winsize win;\n\tioctl(0, TIOCGWINSZ, &win);\n\n\t\/\/ now the pty handling\n\tint masterPty = -1;\n\tint workerPty = -1;\n\tmasterPty = open(\"\/dev\/ptmx\", O_RDWR);\n\tunlockpt(masterPty);\n\n\tif (masterPty < 0) {\n\t\tfprintf(stderr, \"Can't open master pty %s\\n\", strerror(errno));\n\t\texit(1);\n\t} else {\n\t\tworkerPty = open(ptsname(masterPty), O_RDWR);\n\t\tif (workerPty < 0) {\n\t\t\tfprintf(stderr, \"Can't open worker pty %s\\n\", strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t}\n\tint childpid = fork();\n\tif (childpid == 0) {\n\t\n\t\t\/\/ in the child -- \n\n\t\tclose(0);\n\t\tclose(1);\n\t\tclose(2);\n\t\tclose(masterPty);\n\n\t\tdup2(workerPty, 0);\n\t\tdup2(workerPty, 1);\n\t\tdup2(workerPty, 2);\n\n\t\t\/\/ chdir to existing cwd\n\t\tint ret = fchdir(rootFd);\n\t\tif (ret < 0) {\n\t\t\tfprintf(stderr, \"Can't open %s\\n\", cwdPath.c_str());\n\t\t}\n\t\tclose(rootFd);\n\n\t\t\/\/ make this process group leader so shell job control works\n\t\tsetsid();\n\n\t\t\/\/ Make the pty the controlling terminal\n\t\tioctl(workerPty, TIOCSCTTY, 0);\n\n\t\t\/\/ and make it the process group leader\n\t\ttcsetpgrp(workerPty, getpid());\n \n\t\t\/\/ and set the window size properly\n\t\tioctl(0, TIOCSWINSZ, &win);\n\n\t\t\/\/ Finally, launch the shell\n\t\texecle(\"\/bin\/sh\", \"\/bin\/sh\", \"-l\", \"-i\", nullptr, envp.data());\n \n\t\t\/\/ Only get here if exec fails\n\t\tfprintf(stderr, \"exec failed %d\\n\", errno);\n\t\texit(errno);\n\n\t} else {\n\n\t\t\/\/ the parent\n\t\tfd_set readfds, writefds, exceptfds;\n\t\tbool keepGoing = true;\n\n\t\t\/\/ put the pty in raw mode\n\t\tstruct termios tio;\n\t\ttcgetattr(0, &tio);\n\t\tpty_is_raw = true;\n\t\told_tio = tio;\n\t\ttio.c_oflag &= ~(OPOST);\n\t\ttio.c_cflag |= (CS8);\n\t\ttio.c_lflag &= ~(ECHO | ICANON | IEXTEN | ISIG);\n\t\ttio.c_cc[VMIN] = 1;\n\t\ttio.c_cc[VTIME] = 0;\n\t\ttcsetattr(0, TCSAFLUSH, &tio);\n\t\t\n\t\tstruct sigaction handler;\n\t\tstruct sigaction oldhandler;\n\t\thandler.sa_handler = reset_pty_and_exit;\n\t\thandler.sa_flags = 0;\n\n\t\tsigaction(SIGCHLD, &handler, &oldhandler);\n\n\t\twhile (keepGoing) {\n\t\t\tFD_ZERO(&readfds);\n\t\t\tFD_ZERO(&writefds);\n\t\t\tFD_ZERO(&exceptfds);\n\n\t\t\tFD_SET(0, &readfds);\n\t\t\tFD_SET(masterPty, &readfds);\n\n\t\t\tselect(masterPty + 1, &readfds, &writefds, &exceptfds, nullptr);\n\n\t\t\tif (FD_ISSET(masterPty, &readfds)) {\n\t\t\t\tchar buf;\n\t\t\t\tint r = read(masterPty, &buf, 1);\n\t\t\t\tif (r > 0) {\t\n\t\t\t\t\tint ret = write(1, &buf, 1);\n\t\t\t\t\tif (ret < 0) {\n\t\t\t\t\t\treset_pty_and_exit(0);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tkeepGoing = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (FD_ISSET(0, &readfds)) {\n\t\t\t\tchar buf;\n\t\t\t\tint r = read(0, &buf, 1);\n\t\t\t\tif (r > 0) {\t\n\t\t\t\t\tint ret = write(masterPty, &buf, 1);\n\t\t\t\t\tif (ret < 0) {\n\t\t\t\t\t\treset_pty_and_exit(0);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tkeepGoing = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint status;\n\t\twaitpid(childpid, &status, 0);\t\n\t}\n\treturn 0;\n}\n\n<commit_msg>Fully initialize signal handler #6992<commit_after>\/***************************************************************\n *\n * Copyright (C) 1990-2020, Condor Team, Computer Sciences Department,\n * University of Wisconsin-Madison, WI.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\"); you\n * may not use this file except in compliance with the License. You may\n * obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n ***************************************************************\/\n\n#include \"condor_common.h\"\n#include \"condor_config.h\"\n#include \"match_prefix.h\"\n#include <termios.h>\n#include <unistd.h>\n#include <grp.h>\n#include <signal.h>\n#include <algorithm>\n\n\/\/ condor_nsenter\n\/\/ \n\/\/ This is a replacement for the linux nsenter command to launch a\n\/\/ shell inside a container. We need this when running \n\/\/ condor_ssh_to_job to a job that has been launched inside singularity\n\/\/ Docker jobs use docker exec to enter the container, but there is no\n\/\/ equivalent in singularity. Standard nsenter isn't sufficient, as it\n\/\/ does not create a pty for the shell, and we need different command\n\/\/ line arguments to enter a non-setuid singularity container. This\n\/\/ is harder because the starter can't tell if singularity is setuid easily.\n\/\/\n\/\/ The architecture for ssh-to-job to a contained job is to land in an sshd\n\/\/ the starter forks *outside* the container. This is important because we\n\/\/ never want to assume anything about the container, even that there is an sshd\n\/\/ inside it. After the sshd starts, a script runs which runs condor_docker_enter\n\/\/ (even for singularity), which connects to a Unix Domain Socket, passes \n\/\/ stdin\/out\/err to the starter, which passes those to condor_nsenter, which \n\/\/ is runs as root. Rootly privilege is required to enter a setuid namespace\n\/\/ so this is how we acquire.\n\/\/\n\/\/ condor_nsenter enters the namespace, taking care to try to enter the user\n\/\/ namespace, which is only set up for non-setuid singularity, and drops\n\/\/ privileges to the uid and gid passed on the command line. It sets up\n\/\/ a pty for the shell to use, so all interactive processses will work.\n\/\/\n\/\/ A final problem is environment variables. Singularity, especially when\n\/\/ managing GPUs, sets some nvidia-related environment variables that the\n\/\/ condor starter doesn't know about. So, condor_nsenter extracts the environment\n\/\/ variables from the contained job process, and sets them in the shell\n\/\/ it spawns.\n\nvoid\nusage( char *cmd )\n{\n\tfprintf(stderr,\"Usage: %s [options] condor_* ....\\n\",cmd);\n\tfprintf(stderr,\"Where options are:\\n\");\n\tfprintf(stderr,\"-t target_pid:\\n\");\n\tfprintf(stderr,\"-S user_id:\\n\");\n\tfprintf(stderr,\"-G group_id:\\n\");\n\tfprintf(stderr,\" -help Display options\\n\");\n}\n\n\n\/\/ Before we exit, we need to reset the pty back to normal\n\/\/ if we put it in raw mode\n\nbool pty_is_raw = false;\nstruct termios old_tio;\nvoid reset_pty_and_exit(int signo) {\n\tif (pty_is_raw)\n\t\ttcsetattr(0, TCSAFLUSH, &old_tio);\n\texit(signo);\n}\n\nint main( int argc, char *argv[] )\n{\n\tstd::string condor_prefix;\n\tpid_t pid = 0;\n\tuid_t uid = 0;\n\tgid_t gid = 0;\n\n\t\/\/ parse command line args\n\tfor( int i=1; i<argc; i++ ) {\n\t\tif(is_arg_prefix(argv[i],\"-help\")) {\n\t\t\tusage(argv[0]);\n\t\t\texit(1);\n\t\t}\n\n\t\t\/\/ target pid to enter\n\t\tif(is_arg_prefix(argv[i],\"-t\")) {\n\t\t\tpid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ uid to switch to\n\t\tif(is_arg_prefix(argv[i],\"-S\")) {\n\t\t\tuid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\n\t\t\/\/ gid to switch to\n\t\tif(is_arg_prefix(argv[i],\"-G\")) {\n\t\t\tgid = atoi(argv[i + 1]);\n\t\t\ti++;\n\t\t}\n\t}\n\n\tif (pid < 1) {\n\t\tfprintf(stderr, \"missing -t argument > 1\\n\");\n\t\texit(1);\n\t}\t\n\n\tif (uid == 0) {\n\t\tfprintf(stderr, \"missing -S argument > 1\\n\");\n\t\texit(1);\n\t}\n\n\tif (gid == 0) {\n\t\tfprintf(stderr, \"missing -G argument > 1\\n\");\n\t\texit(1);\n\t}\n\n\t\/\/ slurp the enviroment out of our victim\n\tstd::string env;\n\tstd::string envfile;\n\tformatstr(envfile, \"\/proc\/%d\/environ\", pid);\n\t\n\tint e = open(envfile.c_str(), O_RDONLY);\n\tif (e < 0) {\n\t\tfprintf(stderr, \"Can't open %s %s\\n\", envfile.c_str(), strerror(errno));\n\t\texit(1);\n\t}\n\tchar buf[512];\n\tint bytesRead;\n\twhile ((bytesRead = read(e, &buf, 512)) > 0) {\n\t\tenv.append(buf, bytesRead);\n\t}\n\tclose(e);\n\t\n\t\/\/ make a vector to hold all the pointers to env entries\n\tstd::vector<const char *> envp;\n\n\t\/\/ the first one\n\tenvp.push_back(env.c_str());\n\tauto it = env.cbegin();\n\twhile (env.cend() != (it = std::find(it, env.cend(), '\\0'))) {\n\t\t\/\/ skip past null terminator\n\t\tit++;\t\n\t\tif (& (*it) != nullptr) {\n\t\t\tenvp.push_back(& (*it));\n\t\t}\n\t}\n\tenvp.push_back(nullptr);\n\tenvp.push_back(nullptr);\n\n\t\/\/ grab the fd for the cwd -- need to get this outside\n\t\/\/ but chdir inside the container\n\tstd::string cwdPath;\n\tformatstr(cwdPath, \"\/proc\/%d\/cwd\", pid);\n\tint rootFd = open(cwdPath.c_str(), O_RDONLY);\n\tif (rootFd < 0) {\n\t\tfprintf(stderr, \"Can't open %s\\n\", cwdPath.c_str());\n\t}\n\n\n\tstd::string filename;\n\n\t\/\/ start changing namespaces. Note that once we do this, things\n\t\/\/ get funny in this process\n\tformatstr(filename, \"\/proc\/%d\/ns\/uts\", pid);\n\tint fd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open uts namespace: %d %s\\n\", errno, strerror(errno));\n\t\texit(1);\n\t}\n\tint r = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\t\/\/ This means an unprivileged singularity, most likely\n\t\t\/\/ need to set user namespace instead.\n\t\tformatstr(filename, \"\/proc\/%d\/ns\/user\", pid);\n\t\tfd = open(filename.c_str(), O_RDONLY);\n\t\tif (fd < 0) {\n\t\t\tfprintf(stderr, \"Can't open user namespace: %d %s\\n\", errno, strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t\tr = setns(fd, 0);\n\t\tclose(fd);\n\t\tif (r < 0) {\n\t\t\tfprintf(stderr, \"Can't setns to user namespace: %s\\n\", strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t}\n\n\t\/\/ now the pid namespace\n\tformatstr(filename, \"\/proc\/%d\/ns\/pid\", pid);\n\tfd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open pid namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\tr = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setns to pid namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\n\t\/\/ finally the mnt namespace\n\tformatstr(filename, \"\/proc\/%d\/ns\/mnt\", pid);\n\tfd = open(filename.c_str(), O_RDONLY);\n\tif (fd < 0) {\n\t\tfprintf(stderr, \"Can't open mnt namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\tr = setns(fd, 0);\n\tclose(fd);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setns to mnt namespace: %s\\n\", strerror(errno));\n\t\texit(1);\n\t}\n\n\tsetgroups(0, nullptr);\n\n\t\/\/ order matters!\n\tr = setgid(gid);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setgid to %d\\n\", gid);\n\t\texit(1);\n\t}\n\tr = setuid(uid);\n\tif (r < 0) {\n\t\tfprintf(stderr, \"Can't setuid to %d\\n\", uid);\n\t\texit(1);\n\t}\n\n\tstruct winsize win;\n\tioctl(0, TIOCGWINSZ, &win);\n\n\t\/\/ now the pty handling\n\tint masterPty = -1;\n\tint workerPty = -1;\n\tmasterPty = open(\"\/dev\/ptmx\", O_RDWR);\n\tunlockpt(masterPty);\n\n\tif (masterPty < 0) {\n\t\tfprintf(stderr, \"Can't open master pty %s\\n\", strerror(errno));\n\t\texit(1);\n\t} else {\n\t\tworkerPty = open(ptsname(masterPty), O_RDWR);\n\t\tif (workerPty < 0) {\n\t\t\tfprintf(stderr, \"Can't open worker pty %s\\n\", strerror(errno));\n\t\t\texit(1);\n\t\t}\n\t}\n\tint childpid = fork();\n\tif (childpid == 0) {\n\t\n\t\t\/\/ in the child -- \n\n\t\tclose(0);\n\t\tclose(1);\n\t\tclose(2);\n\t\tclose(masterPty);\n\n\t\tdup2(workerPty, 0);\n\t\tdup2(workerPty, 1);\n\t\tdup2(workerPty, 2);\n\n\t\t\/\/ chdir to existing cwd\n\t\tint ret = fchdir(rootFd);\n\t\tif (ret < 0) {\n\t\t\tfprintf(stderr, \"Can't open %s\\n\", cwdPath.c_str());\n\t\t}\n\t\tclose(rootFd);\n\n\t\t\/\/ make this process group leader so shell job control works\n\t\tsetsid();\n\n\t\t\/\/ Make the pty the controlling terminal\n\t\tioctl(workerPty, TIOCSCTTY, 0);\n\n\t\t\/\/ and make it the process group leader\n\t\ttcsetpgrp(workerPty, getpid());\n \n\t\t\/\/ and set the window size properly\n\t\tioctl(0, TIOCSWINSZ, &win);\n\n\t\t\/\/ Finally, launch the shell\n\t\texecle(\"\/bin\/sh\", \"\/bin\/sh\", \"-l\", \"-i\", nullptr, envp.data());\n \n\t\t\/\/ Only get here if exec fails\n\t\tfprintf(stderr, \"exec failed %d\\n\", errno);\n\t\texit(errno);\n\n\t} else {\n\n\t\t\/\/ the parent\n\t\tfd_set readfds, writefds, exceptfds;\n\t\tbool keepGoing = true;\n\n\t\t\/\/ put the pty in raw mode\n\t\tstruct termios tio;\n\t\ttcgetattr(0, &tio);\n\t\tpty_is_raw = true;\n\t\told_tio = tio;\n\t\ttio.c_oflag &= ~(OPOST);\n\t\ttio.c_cflag |= (CS8);\n\t\ttio.c_lflag &= ~(ECHO | ICANON | IEXTEN | ISIG);\n\t\ttio.c_cc[VMIN] = 1;\n\t\ttio.c_cc[VTIME] = 0;\n\t\ttcsetattr(0, TCSAFLUSH, &tio);\n\t\t\n\t\tstruct sigaction handler;\n\t\tstruct sigaction oldhandler;\n\t\thandler.sa_handler = reset_pty_and_exit;\n\t\thandler.sa_flags = 0;\n\t\tsigemptyset(&handler.sa_mask);\n\n\n\t\tsigaction(SIGCHLD, &handler, &oldhandler);\n\n\t\twhile (keepGoing) {\n\t\t\tFD_ZERO(&readfds);\n\t\t\tFD_ZERO(&writefds);\n\t\t\tFD_ZERO(&exceptfds);\n\n\t\t\tFD_SET(0, &readfds);\n\t\t\tFD_SET(masterPty, &readfds);\n\n\t\t\tselect(masterPty + 1, &readfds, &writefds, &exceptfds, nullptr);\n\n\t\t\tif (FD_ISSET(masterPty, &readfds)) {\n\t\t\t\tchar buf;\n\t\t\t\tint r = read(masterPty, &buf, 1);\n\t\t\t\tif (r > 0) {\t\n\t\t\t\t\tint ret = write(1, &buf, 1);\n\t\t\t\t\tif (ret < 0) {\n\t\t\t\t\t\treset_pty_and_exit(0);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tkeepGoing = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (FD_ISSET(0, &readfds)) {\n\t\t\t\tchar buf;\n\t\t\t\tint r = read(0, &buf, 1);\n\t\t\t\tif (r > 0) {\t\n\t\t\t\t\tint ret = write(masterPty, &buf, 1);\n\t\t\t\t\tif (ret < 0) {\n\t\t\t\t\t\treset_pty_and_exit(0);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tkeepGoing = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint status;\n\t\twaitpid(childpid, &status, 0);\t\n\t}\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n\n#include <boost\/geometry\/index\/rtree.hpp>\n#include <boost\/mpl\/range_c.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\nnamespace bg = boost::geometry;\nnamespace bmpl = boost::mpl;\nnamespace bgi = bg::index;\n\n\/\/ Create a D dimensional point from an array of coordinates\ntemplate <size_t D>\nstruct point_setter {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n point_t& point;\n double *loc;\n\n point_setter(point_t& point, double *loc) : point(point), loc(loc)\n {}\n\n template< typename U > void operator()(U i)\n {\n bg::set<i>(point, loc[i]);\n }\n\n};\n\n\/\/ Calculate the square of the euclidian distance between two points\ntemplate <size_t D>\nstruct d2_calc {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n const point_t &p1;\n const point_t &p2;\n double &d2;\n\n d2_calc(const point_t &p1, const point_t &p2, double &d2) : p1(p1), p2(p2), d2(d2)\n {}\n\n template< typename U > void operator()(U i)\n {\n d2 += pow( bg::get<i>(p1) - bg::get<i>(p2), 2);\n }\n};\n\n\/\/ Add a scaler to all the coordinates of a point\ntemplate <size_t D>\nstruct add_scalar_to_point {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n point_t &p;\n double c;\n\n add_scalar_to_point(point_t &p, double c) : p(p), c(c)\n {}\n\n template< typename U > void operator()(U i)\n {\n double new_coord = bg::get<i>(p) + c;\n bg::set<i>(p, new_coord);\n }\n\n};\n\ntemplate <size_t D>\nstd::list< std::list<size_t> >\nfriends_of_friends_rtree(double *data, size_t npts, double linking_length)\n{\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n typedef std::pair<point_t, size_t> value_t;\n typedef bgi::rtree< value_t, bgi::rstar<16> > tree_t;\n typedef bmpl::range_c<size_t, 0, D> dim_range;\n\n std::vector< std::pair<point_t, size_t> > points;\n points.reserve(npts);\n\n for(size_t i = 0 ; i<npts ; ++i) {\n point_t point;\n bmpl::for_each< dim_range >( point_setter<D>(point, data + i*D) );\n points.push_back(std::make_pair(point, i));\n }\n\n tree_t tree(points.begin(), points.end());\n\n std::list< std::list< size_t > > groups;\n\n while( !tree.empty() ) {\n std::list< value_t > to_add;\n\n \/\/ Grab a point from the tree.\n to_add.push_back( *tree.qbegin( bgi::satisfies([](value_t const &){return true;})) );\n tree.remove( to_add.begin(), to_add.end() );\n\n for( auto it = to_add.begin() ; it != to_add.end() ; ++it ) {\n std::list< value_t > added;\n\n \/\/ Build box to query\n point_t lower = it->first;\n bmpl::for_each< dim_range >( add_scalar_to_point<D>(lower, -linking_length) );\n point_t upper = it->first;\n bmpl::for_each< dim_range >( add_scalar_to_point<D>(upper, +linking_length));\n\n bg::model::box< point_t > box( lower, upper );\n\n auto within_ball = [&it, linking_length](value_t const &v) {\n double d2 = 0.;\n bmpl::for_each< dim_range >( d2_calc<D>(it->first, v.first, d2) );\n return sqrt(d2) < linking_length;\n };\n\n \/\/ Find all points within a linking length of the current point.\n tree.query( bgi::within(box) && bgi::satisfies(within_ball), std::back_inserter(added) );\n\n \/\/ Remove any points we find from the tree as they have been assigned.\n tree.remove( added.begin(), added.end() );\n\n \/\/ Add the found points to the list so we can find their \"friends\" as well\n to_add.splice(to_add.end(), added);\n }\n\n std::list< size_t > group;\n for( auto p : to_add ) {\n group.push_back(p.second);\n }\n groups.push_back(group);\n }\n\n return groups;\n}\n\ninline double\ndist(double *p1, double *p2, size_t ndim)\n{\n double d2 = 0.;\n for(size_t i = 0 ; i < ndim ; ++i) {\n d2 += pow(p1[i] - p2[i], 2);\n }\n return sqrt(d2);\n}\n\n\/\/ A brute force friends of friends finder without the Rtree accelerator.\nstd::list< std::list<size_t> >\nfriends_of_friends_brute(double *data, size_t npts, size_t ndim, double linking_length)\n{\n std::cerr << \"Using non tree accelerated version\" << std::endl;\n typedef std::pair<size_t, double*> Point;\n\n \/\/Create list of unused points with indices\n std::list<Point> unused;\n std::list< std::list< size_t > > groups;\n for(size_t i=0 ; i<npts ; ++i) {\n unused.push_back(std::make_pair(i, data + i*ndim));\n }\n\n \/\/If there are unused points try to create a new group\n while( unused.size() > 0 ) {\n std::list<Point> toadd;\n toadd.push_back(unused.front());\n unused.pop_front();\n\n \/\/Look through all points found in the group and attempt to \n for(auto toadd_it = toadd.begin() ; toadd_it != toadd.end() ; ++toadd_it) {\n auto unused_it = unused.begin();\n while(unused_it != unused.end()) {\n if(dist(unused_it->second, toadd_it->second, ndim) < linking_length) {\n toadd.push_back(*unused_it);\n unused.erase(unused_it++);\n } else {\n ++unused_it;\n }\n }\n }\n\n std::list<size_t> group;\n for(const auto& p : toadd) {\n group.push_back(p.first);\n }\n groups.push_back(group);\n }\n\n return groups;\n}\n\nstd::list< std::list<size_t> >\nfriends_of_friends(double *data, size_t npts, size_t ndim, double linking_length)\n{\n switch(ndim) {\n case 1:\n return friends_of_friends_rtree<1>(data, npts, linking_length);\n break;\n case 2:\n return friends_of_friends_rtree<2>(data, npts, linking_length);\n break;\n case 3:\n return friends_of_friends_rtree<3>(data, npts, linking_length);\n break;\n case 4:\n return friends_of_friends_rtree<4>(data, npts, linking_length);\n break;\n default:\n return friends_of_friends_brute(data, npts, ndim, linking_length);\n break;\n }\n}\n\n<commit_msg>Make it compile with modern boost<commit_after>#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n\n#include <boost\/geometry\/geometry.hpp>\n#include <boost\/geometry\/index\/rtree.hpp>\n#include <boost\/mpl\/range_c.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\nnamespace bg = boost::geometry;\nnamespace bmpl = boost::mpl;\nnamespace bgi = bg::index;\n\n\/\/ Create a D dimensional point from an array of coordinates\ntemplate <size_t D>\nstruct point_setter {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n point_t& point;\n double *loc;\n\n point_setter(point_t& point, double *loc) : point(point), loc(loc)\n {}\n\n template< typename U > void operator()(U i)\n {\n bg::set<i>(point, loc[i]);\n }\n\n};\n\n\/\/ Calculate the square of the euclidian distance between two points\ntemplate <size_t D>\nstruct d2_calc {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n const point_t &p1;\n const point_t &p2;\n double &d2;\n\n d2_calc(const point_t &p1, const point_t &p2, double &d2) : p1(p1), p2(p2), d2(d2)\n {}\n\n template< typename U > void operator()(U i)\n {\n d2 += pow( bg::get<i>(p1) - bg::get<i>(p2), 2);\n }\n};\n\n\/\/ Add a scaler to all the coordinates of a point\ntemplate <size_t D>\nstruct add_scalar_to_point {\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n\n point_t &p;\n double c;\n\n add_scalar_to_point(point_t &p, double c) : p(p), c(c)\n {}\n\n template< typename U > void operator()(U i)\n {\n double new_coord = bg::get<i>(p) + c;\n bg::set<i>(p, new_coord);\n }\n\n};\n\ntemplate <size_t D>\nstd::list< std::list<size_t> >\nfriends_of_friends_rtree(double *data, size_t npts, double linking_length)\n{\n typedef bg::model::point<double, D, bg::cs::cartesian> point_t;\n typedef std::pair<point_t, size_t> value_t;\n using tree_t = bgi::rtree< value_t, bgi::linear<16> >;\n typedef bmpl::range_c<size_t, 0, D> dim_range;\n\n std::vector< std::pair<point_t, size_t> > points;\n points.reserve(npts);\n\n for(size_t i = 0 ; i<npts ; ++i) {\n point_t point;\n bmpl::for_each< dim_range >( point_setter<D>(point, data + i*D) );\n points.push_back(std::make_pair(point, i));\n }\n\n tree_t tree(points.begin(), points.end());\n\n std::list< std::list< size_t > > groups;\n\n while( !tree.empty() ) {\n std::list< value_t > to_add;\n\n \/\/ Grab a point from the tree.\n to_add.push_back( *tree.qbegin( bgi::satisfies([](value_t const &){return true;})) );\n tree.remove( to_add.begin(), to_add.end() );\n\n for( auto it = to_add.begin() ; it != to_add.end() ; ++it ) {\n std::list< value_t > added;\n\n \/\/ Build box to query\n point_t lower = it->first;\n bmpl::for_each< dim_range >( add_scalar_to_point<D>(lower, -linking_length) );\n point_t upper = it->first;\n bmpl::for_each< dim_range >( add_scalar_to_point<D>(upper, +linking_length));\n\n bg::model::box< point_t > box( lower, upper );\n\n auto within_ball = [&it, linking_length](value_t const &v) {\n double d2 = 0.;\n bmpl::for_each< dim_range >( d2_calc<D>(it->first, v.first, d2) );\n return sqrt(d2) < linking_length;\n };\n\n \/\/ Find all points within a linking length of the current point.\n tree.query( bgi::within(box) && bgi::satisfies(within_ball), std::back_inserter(added) );\n\n \/\/ Remove any points we find from the tree as they have been assigned.\n tree.remove( added.begin(), added.end() );\n\n \/\/ Add the found points to the list so we can find their \"friends\" as well\n to_add.splice(to_add.end(), added);\n }\n\n std::list< size_t > group;\n for( auto p : to_add ) {\n group.push_back(p.second);\n }\n groups.push_back(group);\n }\n\n return groups;\n}\n\ninline double\ndist(double *p1, double *p2, size_t ndim)\n{\n double d2 = 0.;\n for(size_t i = 0 ; i < ndim ; ++i) {\n d2 += pow(p1[i] - p2[i], 2);\n }\n return sqrt(d2);\n}\n\n\/\/ A brute force friends of friends finder without the Rtree accelerator.\nstd::list< std::list<size_t> >\nfriends_of_friends_brute(double *data, size_t npts, size_t ndim, double linking_length)\n{\n std::cerr << \"Using non tree accelerated version\" << std::endl;\n typedef std::pair<size_t, double*> Point;\n\n \/\/Create list of unused points with indices\n std::list<Point> unused;\n std::list< std::list< size_t > > groups;\n for(size_t i=0 ; i<npts ; ++i) {\n unused.push_back(std::make_pair(i, data + i*ndim));\n }\n\n \/\/If there are unused points try to create a new group\n while( unused.size() > 0 ) {\n std::list<Point> toadd;\n toadd.push_back(unused.front());\n unused.pop_front();\n\n \/\/Look through all points found in the group and attempt to \n for(auto toadd_it = toadd.begin() ; toadd_it != toadd.end() ; ++toadd_it) {\n auto unused_it = unused.begin();\n while(unused_it != unused.end()) {\n if(dist(unused_it->second, toadd_it->second, ndim) < linking_length) {\n toadd.push_back(*unused_it);\n unused.erase(unused_it++);\n } else {\n ++unused_it;\n }\n }\n }\n\n std::list<size_t> group;\n for(const auto& p : toadd) {\n group.push_back(p.first);\n }\n groups.push_back(group);\n }\n\n return groups;\n}\n\nstd::list< std::list<size_t> >\nfriends_of_friends(double *data, size_t npts, size_t ndim, double linking_length)\n{\n switch(ndim) {\n case 1:\n return friends_of_friends_rtree<1>(data, npts, linking_length);\n break;\n case 2:\n return friends_of_friends_rtree<2>(data, npts, linking_length);\n break;\n case 3:\n return friends_of_friends_rtree<3>(data, npts, linking_length);\n break;\n case 4:\n return friends_of_friends_rtree<4>(data, npts, linking_length);\n break;\n default:\n return friends_of_friends_brute(data, npts, ndim, linking_length);\n break;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/renderer_host\/web_cache_manager.h\"\n\n#include <algorithm>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/singleton.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/time.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/render_messages.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing WebKit::WebCache;\n\nstatic const unsigned int kReviseAllocationDelayMS = 200 \/* milliseconds *\/;\n\n\/\/ The default size limit of the in-memory cache is 8 MB\nstatic const int kDefaultMemoryCacheSize = 8 * 1024 * 1024;\n\nnamespace {\n\nint GetDefaultCacheSize() {\n \/\/ Start off with a modest default\n int default_cache_size = kDefaultMemoryCacheSize;\n\n \/\/ Check how much physical memory the OS has\n int mem_size_mb = base::SysInfo::AmountOfPhysicalMemoryMB();\n if (mem_size_mb >= 1000) \/\/ If we have a GB of memory, set a larger default.\n default_cache_size *= 4;\n else if (mem_size_mb >= 512) \/\/ With 512 MB, set a slightly larger default.\n default_cache_size *= 2;\n\n return default_cache_size;\n}\n\n} \/\/ anonymous namespace\n\n\/\/ static\nvoid WebCacheManager::RegisterPrefs(PrefService* prefs) {\n prefs->RegisterIntegerPref(prefs::kMemoryCacheSize, GetDefaultCacheSize());\n}\n\n\/\/ static\nWebCacheManager* WebCacheManager::GetInstance() {\n return Singleton<WebCacheManager>::get();\n}\n\nWebCacheManager::WebCacheManager()\n : global_size_limit_(GetDefaultGlobalSizeLimit()),\n ALLOW_THIS_IN_INITIALIZER_LIST(revise_allocation_factory_(this)) {\n}\n\nWebCacheManager::~WebCacheManager() {\n}\n\nvoid WebCacheManager::Add(int renderer_id) {\n DCHECK(inactive_renderers_.count(renderer_id) == 0);\n\n \/\/ It is tempting to make the following DCHECK here, but it fails when a new\n \/\/ tab is created as we observe activity from that tab because the\n \/\/ RenderProcessHost is recreated and adds itself.\n \/\/\n \/\/ DCHECK(active_renderers_.count(renderer_id) == 0);\n \/\/\n \/\/ However, there doesn't seem to be much harm in receiving the calls in this\n \/\/ order.\n\n active_renderers_.insert(renderer_id);\n\n RendererInfo* stats = &(stats_[renderer_id]);\n memset(stats, 0, sizeof(*stats));\n stats->access = Time::Now();\n\n \/\/ Revise our allocation strategy to account for this new renderer.\n ReviseAllocationStrategyLater();\n}\n\nvoid WebCacheManager::Remove(int renderer_id) {\n \/\/ Erase all knowledge of this renderer\n active_renderers_.erase(renderer_id);\n inactive_renderers_.erase(renderer_id);\n stats_.erase(renderer_id);\n\n \/\/ Reallocate the resources used by this renderer\n ReviseAllocationStrategyLater();\n}\n\nvoid WebCacheManager::ObserveActivity(int renderer_id) {\n StatsMap::iterator item = stats_.find(renderer_id);\n if (item == stats_.end())\n return; \/\/ We might see stats for a renderer that has been destroyed.\n\n \/\/ Record activity.\n active_renderers_.insert(renderer_id);\n item->second.access = Time::Now();\n\n std::set<int>::iterator elmt = inactive_renderers_.find(renderer_id);\n if (elmt != inactive_renderers_.end()) {\n inactive_renderers_.erase(elmt);\n\n \/\/ A renderer that was inactive, just became active. We should make sure\n \/\/ it is given a fair cache allocation, but we defer this for a bit in\n \/\/ order to make this function call cheap.\n ReviseAllocationStrategyLater();\n }\n}\n\nvoid WebCacheManager::ObserveStats(int renderer_id,\n const WebCache::UsageStats& stats) {\n StatsMap::iterator entry = stats_.find(renderer_id);\n if (entry == stats_.end())\n return; \/\/ We might see stats for a renderer that has been destroyed.\n\n \/\/ Record the updated stats.\n entry->second.capacity = stats.capacity;\n entry->second.deadSize = stats.deadSize;\n entry->second.liveSize = stats.liveSize;\n entry->second.maxDeadCapacity = stats.maxDeadCapacity;\n entry->second.minDeadCapacity = stats.minDeadCapacity;\n\n \/\/ trigger notification\n WebCache::UsageStats stats_details(stats);\n \/\/ &stats_details is only valid during the notification.\n \/\/ See notification_types.h.\n NotificationService::current()->Notify(\n NotificationType::WEB_CACHE_STATS_OBSERVED,\n Source<RenderProcessHost>(RenderProcessHost::FromID(renderer_id)),\n Details<WebCache::UsageStats>(&stats_details));\n}\n\nvoid WebCacheManager::SetGlobalSizeLimit(size_t bytes) {\n global_size_limit_ = bytes;\n ReviseAllocationStrategyLater();\n}\n\n\/\/ static\nsize_t WebCacheManager::GetDefaultGlobalSizeLimit() {\n PrefService* perf_service = g_browser_process->local_state();\n if (perf_service)\n return perf_service->GetInteger(prefs::kMemoryCacheSize);\n\n return GetDefaultCacheSize();\n}\n\nvoid WebCacheManager::GatherStats(const std::set<int>& renderers,\n WebCache::UsageStats* stats) {\n DCHECK(stats);\n\n memset(stats, 0, sizeof(WebCache::UsageStats));\n\n std::set<int>::const_iterator iter = renderers.begin();\n while (iter != renderers.end()) {\n StatsMap::iterator elmt = stats_.find(*iter);\n if (elmt != stats_.end()) {\n stats->minDeadCapacity += elmt->second.minDeadCapacity;\n stats->maxDeadCapacity += elmt->second.maxDeadCapacity;\n stats->capacity += elmt->second.capacity;\n stats->liveSize += elmt->second.liveSize;\n stats->deadSize += elmt->second.deadSize;\n }\n ++iter;\n }\n}\n\n\/\/ static\nsize_t WebCacheManager::GetSize(AllocationTactic tactic,\n const WebCache::UsageStats& stats) {\n switch (tactic) {\n case DIVIDE_EVENLY:\n \/\/ We aren't going to reserve any space for existing objects.\n return 0;\n case KEEP_CURRENT_WITH_HEADROOM:\n \/\/ We need enough space for our current objects, plus some headroom.\n return 3 * GetSize(KEEP_CURRENT, stats) \/ 2;\n case KEEP_CURRENT:\n \/\/ We need enough space to keep our current objects.\n return stats.liveSize + stats.deadSize;\n case KEEP_LIVE_WITH_HEADROOM:\n \/\/ We need enough space to keep out live resources, plus some headroom.\n return 3 * GetSize(KEEP_LIVE, stats) \/ 2;\n case KEEP_LIVE:\n \/\/ We need enough space to keep our live resources.\n return stats.liveSize;\n default:\n NOTREACHED() << \"Unknown cache allocation tactic\";\n return 0;\n }\n}\n\nbool WebCacheManager::AttemptTactic(\n AllocationTactic active_tactic,\n const WebCache::UsageStats& active_stats,\n AllocationTactic inactive_tactic,\n const WebCache::UsageStats& inactive_stats,\n AllocationStrategy* strategy) {\n DCHECK(strategy);\n\n size_t active_size = GetSize(active_tactic, active_stats);\n size_t inactive_size = GetSize(inactive_tactic, inactive_stats);\n\n \/\/ Give up if we don't have enough space to use this tactic.\n if (global_size_limit_ < active_size + inactive_size)\n return false;\n\n \/\/ Compute the unreserved space available.\n size_t total_extra = global_size_limit_ - (active_size + inactive_size);\n\n \/\/ The plan for the extra space is to divide it evenly amoung the active\n \/\/ renderers.\n size_t shares = active_renderers_.size();\n\n \/\/ The inactive renderers get one share of the extra memory to be divided\n \/\/ among themselves.\n size_t inactive_extra = 0;\n if (inactive_renderers_.size() > 0) {\n ++shares;\n inactive_extra = total_extra \/ shares;\n }\n\n \/\/ The remaining memory is allocated to the active renderers.\n size_t active_extra = total_extra - inactive_extra;\n\n \/\/ Actually compute the allocations for each renderer.\n AddToStrategy(active_renderers_, active_tactic, active_extra, strategy);\n AddToStrategy(inactive_renderers_, inactive_tactic, inactive_extra, strategy);\n\n \/\/ We succeeded in computing an allocation strategy.\n return true;\n}\n\nvoid WebCacheManager::AddToStrategy(std::set<int> renderers,\n AllocationTactic tactic,\n size_t extra_bytes_to_allocate,\n AllocationStrategy* strategy) {\n DCHECK(strategy);\n\n \/\/ Nothing to do if there are no renderers. It is common for there to be no\n \/\/ inactive renderers if there is a single active tab.\n if (renderers.size() == 0)\n return;\n\n \/\/ Divide the extra memory evenly among the renderers.\n size_t extra_each = extra_bytes_to_allocate \/ renderers.size();\n\n std::set<int>::const_iterator iter = renderers.begin();\n while (iter != renderers.end()) {\n size_t cache_size = extra_each;\n\n \/\/ Add in the space required to implement |tactic|.\n StatsMap::iterator elmt = stats_.find(*iter);\n if (elmt != stats_.end())\n cache_size += GetSize(tactic, elmt->second);\n\n \/\/ Record the allocation in our strategy.\n strategy->push_back(Allocation(*iter, cache_size));\n ++iter;\n }\n}\n\nvoid WebCacheManager::EnactStrategy(const AllocationStrategy& strategy) {\n \/\/ Inform each render process of its cache allocation.\n AllocationStrategy::const_iterator allocation = strategy.begin();\n while (allocation != strategy.end()) {\n RenderProcessHost* host = RenderProcessHost::FromID(allocation->first);\n if (host) {\n \/\/ This is the capacity this renderer has been allocated.\n size_t capacity = allocation->second;\n\n \/\/ We don't reserve any space for dead objects in the cache. Instead, we\n \/\/ prefer to keep live objects around. There is probably some performance\n \/\/ tuning to be done here.\n size_t min_dead_capacity = 0;\n\n \/\/ We allow the dead objects to consume all of the cache, if the renderer\n \/\/ so desires. If we wanted this memory, we would have set the total\n \/\/ capacity lower.\n size_t max_dead_capacity = capacity;\n\n host->Send(new ViewMsg_SetCacheCapacities(min_dead_capacity,\n max_dead_capacity,\n capacity));\n }\n ++allocation;\n }\n}\n\nvoid WebCacheManager::ReviseAllocationStrategy() {\n DCHECK(stats_.size() <=\n active_renderers_.size() + inactive_renderers_.size());\n\n \/\/ Check if renderers have gone inactive.\n FindInactiveRenderers();\n\n \/\/ Gather statistics\n WebCache::UsageStats active;\n WebCache::UsageStats inactive;\n GatherStats(active_renderers_, &active);\n GatherStats(inactive_renderers_, &inactive);\n\n \/\/ Compute an allocation strategy.\n \/\/\n \/\/ We attempt various tactics in order of preference. Our first preference\n \/\/ is not to evict any objects. If we don't have enough resources, we'll\n \/\/ first try to evict dead data only. If that fails, we'll just divide the\n \/\/ resources we have evenly.\n \/\/\n \/\/ We always try to give the active renderers some head room in their\n \/\/ allocations so they can take memory away from an inactive renderer with\n \/\/ a large cache allocation.\n \/\/\n \/\/ Notice the early exit will prevent attempting less desirable tactics once\n \/\/ we've found a workable strategy.\n AllocationStrategy strategy;\n if ( \/\/ Ideally, we'd like to give the active renderers some headroom and\n \/\/ keep all our current objects.\n AttemptTactic(KEEP_CURRENT_WITH_HEADROOM, active,\n KEEP_CURRENT, inactive, &strategy) ||\n \/\/ If we can't have that, then we first try to evict the dead objects in\n \/\/ the caches of inactive renderers.\n AttemptTactic(KEEP_CURRENT_WITH_HEADROOM, active,\n KEEP_LIVE, inactive, &strategy) ||\n \/\/ Next, we try to keep the live objects in the active renders (with some\n \/\/ room for new objects) and give whatever is left to the inactive\n \/\/ renderers.\n AttemptTactic(KEEP_LIVE_WITH_HEADROOM, active,\n DIVIDE_EVENLY, inactive, &strategy) ||\n \/\/ If we've gotten this far, then we are very tight on memory. Let's try\n \/\/ to at least keep around the live objects for the active renderers.\n AttemptTactic(KEEP_LIVE, active, DIVIDE_EVENLY, inactive, &strategy) ||\n \/\/ We're basically out of memory. The best we can do is just divide up\n \/\/ what we have and soldier on.\n AttemptTactic(DIVIDE_EVENLY, active, DIVIDE_EVENLY, inactive,\n &strategy)) {\n \/\/ Having found a workable strategy, we enact it.\n EnactStrategy(strategy);\n } else {\n \/\/ DIVIDE_EVENLY \/ DIVIDE_EVENLY should always succeed.\n NOTREACHED() << \"Unable to find a cache allocation\";\n }\n}\n\nvoid WebCacheManager::ReviseAllocationStrategyLater() {\n \/\/ Ask to be called back in a few milliseconds to actually recompute our\n \/\/ allocation.\n MessageLoop::current()->PostDelayedTask(FROM_HERE,\n revise_allocation_factory_.NewRunnableMethod(\n &WebCacheManager::ReviseAllocationStrategy),\n kReviseAllocationDelayMS);\n}\n\nvoid WebCacheManager::FindInactiveRenderers() {\n std::set<int>::const_iterator iter = active_renderers_.begin();\n while (iter != active_renderers_.end()) {\n StatsMap::iterator elmt = stats_.find(*iter);\n DCHECK(elmt != stats_.end());\n TimeDelta idle = Time::Now() - elmt->second.access;\n if (idle >= TimeDelta::FromMinutes(kRendererInactiveThresholdMinutes)) {\n \/\/ Moved to inactive status. This invalidates our iterator.\n inactive_renderers_.insert(*iter);\n active_renderers_.erase(*iter);\n iter = active_renderers_.begin();\n continue;\n }\n ++iter;\n }\n}\n<commit_msg>Add histograms for web cache manager.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/renderer_host\/web_cache_manager.h\"\n\n#include <algorithm>\n\n#include \"base\/compiler_specific.h\"\n#include \"base\/histogram.h\"\n#include \"base\/singleton.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/time.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/renderer_host\/render_process_host.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/render_messages.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing WebKit::WebCache;\n\nstatic const unsigned int kReviseAllocationDelayMS = 200 \/* milliseconds *\/;\n\n\/\/ The default size limit of the in-memory cache is 8 MB\nstatic const int kDefaultMemoryCacheSize = 8 * 1024 * 1024;\n\nnamespace {\n\nint GetDefaultCacheSize() {\n \/\/ Start off with a modest default\n int default_cache_size = kDefaultMemoryCacheSize;\n\n \/\/ Check how much physical memory the OS has\n int mem_size_mb = base::SysInfo::AmountOfPhysicalMemoryMB();\n if (mem_size_mb >= 1000) \/\/ If we have a GB of memory, set a larger default.\n default_cache_size *= 4;\n else if (mem_size_mb >= 512) \/\/ With 512 MB, set a slightly larger default.\n default_cache_size *= 2;\n\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.MaxCacheSizeMB\",\n default_cache_size \/ 1024 \/ 1024);\n\n return default_cache_size;\n}\n\n} \/\/ anonymous namespace\n\n\/\/ static\nvoid WebCacheManager::RegisterPrefs(PrefService* prefs) {\n prefs->RegisterIntegerPref(prefs::kMemoryCacheSize, GetDefaultCacheSize());\n}\n\n\/\/ static\nWebCacheManager* WebCacheManager::GetInstance() {\n return Singleton<WebCacheManager>::get();\n}\n\nWebCacheManager::WebCacheManager()\n : global_size_limit_(GetDefaultGlobalSizeLimit()),\n ALLOW_THIS_IN_INITIALIZER_LIST(revise_allocation_factory_(this)) {\n}\n\nWebCacheManager::~WebCacheManager() {\n}\n\nvoid WebCacheManager::Add(int renderer_id) {\n DCHECK(inactive_renderers_.count(renderer_id) == 0);\n\n \/\/ It is tempting to make the following DCHECK here, but it fails when a new\n \/\/ tab is created as we observe activity from that tab because the\n \/\/ RenderProcessHost is recreated and adds itself.\n \/\/\n \/\/ DCHECK(active_renderers_.count(renderer_id) == 0);\n \/\/\n \/\/ However, there doesn't seem to be much harm in receiving the calls in this\n \/\/ order.\n\n active_renderers_.insert(renderer_id);\n\n RendererInfo* stats = &(stats_[renderer_id]);\n memset(stats, 0, sizeof(*stats));\n stats->access = Time::Now();\n\n \/\/ Revise our allocation strategy to account for this new renderer.\n ReviseAllocationStrategyLater();\n}\n\nvoid WebCacheManager::Remove(int renderer_id) {\n \/\/ Erase all knowledge of this renderer\n active_renderers_.erase(renderer_id);\n inactive_renderers_.erase(renderer_id);\n stats_.erase(renderer_id);\n\n \/\/ Reallocate the resources used by this renderer\n ReviseAllocationStrategyLater();\n}\n\nvoid WebCacheManager::ObserveActivity(int renderer_id) {\n StatsMap::iterator item = stats_.find(renderer_id);\n if (item == stats_.end())\n return; \/\/ We might see stats for a renderer that has been destroyed.\n\n \/\/ Record activity.\n active_renderers_.insert(renderer_id);\n item->second.access = Time::Now();\n\n std::set<int>::iterator elmt = inactive_renderers_.find(renderer_id);\n if (elmt != inactive_renderers_.end()) {\n inactive_renderers_.erase(elmt);\n\n \/\/ A renderer that was inactive, just became active. We should make sure\n \/\/ it is given a fair cache allocation, but we defer this for a bit in\n \/\/ order to make this function call cheap.\n ReviseAllocationStrategyLater();\n }\n}\n\nvoid WebCacheManager::ObserveStats(int renderer_id,\n const WebCache::UsageStats& stats) {\n StatsMap::iterator entry = stats_.find(renderer_id);\n if (entry == stats_.end())\n return; \/\/ We might see stats for a renderer that has been destroyed.\n\n \/\/ Record the updated stats.\n entry->second.capacity = stats.capacity;\n entry->second.deadSize = stats.deadSize;\n entry->second.liveSize = stats.liveSize;\n entry->second.maxDeadCapacity = stats.maxDeadCapacity;\n entry->second.minDeadCapacity = stats.minDeadCapacity;\n\n \/\/ trigger notification\n WebCache::UsageStats stats_details(stats);\n \/\/ &stats_details is only valid during the notification.\n \/\/ See notification_types.h.\n NotificationService::current()->Notify(\n NotificationType::WEB_CACHE_STATS_OBSERVED,\n Source<RenderProcessHost>(RenderProcessHost::FromID(renderer_id)),\n Details<WebCache::UsageStats>(&stats_details));\n}\n\nvoid WebCacheManager::SetGlobalSizeLimit(size_t bytes) {\n global_size_limit_ = bytes;\n ReviseAllocationStrategyLater();\n}\n\n\/\/ static\nsize_t WebCacheManager::GetDefaultGlobalSizeLimit() {\n PrefService* perf_service = g_browser_process->local_state();\n if (perf_service)\n return perf_service->GetInteger(prefs::kMemoryCacheSize);\n\n return GetDefaultCacheSize();\n}\n\nvoid WebCacheManager::GatherStats(const std::set<int>& renderers,\n WebCache::UsageStats* stats) {\n DCHECK(stats);\n\n memset(stats, 0, sizeof(WebCache::UsageStats));\n\n std::set<int>::const_iterator iter = renderers.begin();\n while (iter != renderers.end()) {\n StatsMap::iterator elmt = stats_.find(*iter);\n if (elmt != stats_.end()) {\n stats->minDeadCapacity += elmt->second.minDeadCapacity;\n stats->maxDeadCapacity += elmt->second.maxDeadCapacity;\n stats->capacity += elmt->second.capacity;\n stats->liveSize += elmt->second.liveSize;\n stats->deadSize += elmt->second.deadSize;\n }\n ++iter;\n }\n}\n\n\/\/ static\nsize_t WebCacheManager::GetSize(AllocationTactic tactic,\n const WebCache::UsageStats& stats) {\n switch (tactic) {\n case DIVIDE_EVENLY:\n \/\/ We aren't going to reserve any space for existing objects.\n return 0;\n case KEEP_CURRENT_WITH_HEADROOM:\n \/\/ We need enough space for our current objects, plus some headroom.\n return 3 * GetSize(KEEP_CURRENT, stats) \/ 2;\n case KEEP_CURRENT:\n \/\/ We need enough space to keep our current objects.\n return stats.liveSize + stats.deadSize;\n case KEEP_LIVE_WITH_HEADROOM:\n \/\/ We need enough space to keep out live resources, plus some headroom.\n return 3 * GetSize(KEEP_LIVE, stats) \/ 2;\n case KEEP_LIVE:\n \/\/ We need enough space to keep our live resources.\n return stats.liveSize;\n default:\n NOTREACHED() << \"Unknown cache allocation tactic\";\n return 0;\n }\n}\n\nbool WebCacheManager::AttemptTactic(\n AllocationTactic active_tactic,\n const WebCache::UsageStats& active_stats,\n AllocationTactic inactive_tactic,\n const WebCache::UsageStats& inactive_stats,\n AllocationStrategy* strategy) {\n DCHECK(strategy);\n\n size_t active_size = GetSize(active_tactic, active_stats);\n size_t inactive_size = GetSize(inactive_tactic, inactive_stats);\n\n \/\/ Give up if we don't have enough space to use this tactic.\n if (global_size_limit_ < active_size + inactive_size)\n return false;\n\n \/\/ Compute the unreserved space available.\n size_t total_extra = global_size_limit_ - (active_size + inactive_size);\n\n \/\/ The plan for the extra space is to divide it evenly amoung the active\n \/\/ renderers.\n size_t shares = active_renderers_.size();\n\n \/\/ The inactive renderers get one share of the extra memory to be divided\n \/\/ among themselves.\n size_t inactive_extra = 0;\n if (inactive_renderers_.size() > 0) {\n ++shares;\n inactive_extra = total_extra \/ shares;\n }\n\n \/\/ The remaining memory is allocated to the active renderers.\n size_t active_extra = total_extra - inactive_extra;\n\n \/\/ Actually compute the allocations for each renderer.\n AddToStrategy(active_renderers_, active_tactic, active_extra, strategy);\n AddToStrategy(inactive_renderers_, inactive_tactic, inactive_extra, strategy);\n\n \/\/ We succeeded in computing an allocation strategy.\n return true;\n}\n\nvoid WebCacheManager::AddToStrategy(std::set<int> renderers,\n AllocationTactic tactic,\n size_t extra_bytes_to_allocate,\n AllocationStrategy* strategy) {\n DCHECK(strategy);\n\n \/\/ Nothing to do if there are no renderers. It is common for there to be no\n \/\/ inactive renderers if there is a single active tab.\n if (renderers.size() == 0)\n return;\n\n \/\/ Divide the extra memory evenly among the renderers.\n size_t extra_each = extra_bytes_to_allocate \/ renderers.size();\n\n std::set<int>::const_iterator iter = renderers.begin();\n while (iter != renderers.end()) {\n size_t cache_size = extra_each;\n\n \/\/ Add in the space required to implement |tactic|.\n StatsMap::iterator elmt = stats_.find(*iter);\n if (elmt != stats_.end())\n cache_size += GetSize(tactic, elmt->second);\n\n \/\/ Record the allocation in our strategy.\n strategy->push_back(Allocation(*iter, cache_size));\n ++iter;\n }\n}\n\nvoid WebCacheManager::EnactStrategy(const AllocationStrategy& strategy) {\n \/\/ Inform each render process of its cache allocation.\n AllocationStrategy::const_iterator allocation = strategy.begin();\n while (allocation != strategy.end()) {\n RenderProcessHost* host = RenderProcessHost::FromID(allocation->first);\n if (host) {\n \/\/ This is the capacity this renderer has been allocated.\n size_t capacity = allocation->second;\n\n \/\/ We don't reserve any space for dead objects in the cache. Instead, we\n \/\/ prefer to keep live objects around. There is probably some performance\n \/\/ tuning to be done here.\n size_t min_dead_capacity = 0;\n\n \/\/ We allow the dead objects to consume all of the cache, if the renderer\n \/\/ so desires. If we wanted this memory, we would have set the total\n \/\/ capacity lower.\n size_t max_dead_capacity = capacity;\n\n host->Send(new ViewMsg_SetCacheCapacities(min_dead_capacity,\n max_dead_capacity,\n capacity));\n }\n ++allocation;\n }\n}\n\nvoid WebCacheManager::ReviseAllocationStrategy() {\n DCHECK(stats_.size() <=\n active_renderers_.size() + inactive_renderers_.size());\n\n \/\/ Check if renderers have gone inactive.\n FindInactiveRenderers();\n\n \/\/ Gather statistics\n WebCache::UsageStats active;\n WebCache::UsageStats inactive;\n GatherStats(active_renderers_, &active);\n GatherStats(inactive_renderers_, &inactive);\n\n UMA_HISTOGRAM_COUNTS_100(\"Cache.ActiveTabs\", active_renderers_.size());\n UMA_HISTOGRAM_COUNTS_100(\"Cache.InactiveTabs\", inactive_renderers_.size());\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.ActiveCapacityMB\",\n active.capacity \/ 1024 \/ 1024);\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.ActiveDeadSizeMB\",\n active.deadSize \/ 1024 \/ 1024);\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.ActiveLiveSizeMB\",\n active.liveSize \/ 1024 \/ 1024);\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.InactiveCapacityMB\",\n inactive.capacity \/ 1024 \/ 1024);\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.InactiveDeadSizeMB\",\n inactive.deadSize \/ 1024 \/ 1024);\n UMA_HISTOGRAM_MEMORY_MB(\"Cache.InactiveLiveSizeMB\",\n inactive.liveSize \/ 1024 \/ 1024);\n\n \/\/ Compute an allocation strategy.\n \/\/\n \/\/ We attempt various tactics in order of preference. Our first preference\n \/\/ is not to evict any objects. If we don't have enough resources, we'll\n \/\/ first try to evict dead data only. If that fails, we'll just divide the\n \/\/ resources we have evenly.\n \/\/\n \/\/ We always try to give the active renderers some head room in their\n \/\/ allocations so they can take memory away from an inactive renderer with\n \/\/ a large cache allocation.\n \/\/\n \/\/ Notice the early exit will prevent attempting less desirable tactics once\n \/\/ we've found a workable strategy.\n AllocationStrategy strategy;\n if ( \/\/ Ideally, we'd like to give the active renderers some headroom and\n \/\/ keep all our current objects.\n AttemptTactic(KEEP_CURRENT_WITH_HEADROOM, active,\n KEEP_CURRENT, inactive, &strategy) ||\n \/\/ If we can't have that, then we first try to evict the dead objects in\n \/\/ the caches of inactive renderers.\n AttemptTactic(KEEP_CURRENT_WITH_HEADROOM, active,\n KEEP_LIVE, inactive, &strategy) ||\n \/\/ Next, we try to keep the live objects in the active renders (with some\n \/\/ room for new objects) and give whatever is left to the inactive\n \/\/ renderers.\n AttemptTactic(KEEP_LIVE_WITH_HEADROOM, active,\n DIVIDE_EVENLY, inactive, &strategy) ||\n \/\/ If we've gotten this far, then we are very tight on memory. Let's try\n \/\/ to at least keep around the live objects for the active renderers.\n AttemptTactic(KEEP_LIVE, active, DIVIDE_EVENLY, inactive, &strategy) ||\n \/\/ We're basically out of memory. The best we can do is just divide up\n \/\/ what we have and soldier on.\n AttemptTactic(DIVIDE_EVENLY, active, DIVIDE_EVENLY, inactive,\n &strategy)) {\n \/\/ Having found a workable strategy, we enact it.\n EnactStrategy(strategy);\n } else {\n \/\/ DIVIDE_EVENLY \/ DIVIDE_EVENLY should always succeed.\n NOTREACHED() << \"Unable to find a cache allocation\";\n }\n}\n\nvoid WebCacheManager::ReviseAllocationStrategyLater() {\n \/\/ Ask to be called back in a few milliseconds to actually recompute our\n \/\/ allocation.\n MessageLoop::current()->PostDelayedTask(FROM_HERE,\n revise_allocation_factory_.NewRunnableMethod(\n &WebCacheManager::ReviseAllocationStrategy),\n kReviseAllocationDelayMS);\n}\n\nvoid WebCacheManager::FindInactiveRenderers() {\n std::set<int>::const_iterator iter = active_renderers_.begin();\n while (iter != active_renderers_.end()) {\n StatsMap::iterator elmt = stats_.find(*iter);\n DCHECK(elmt != stats_.end());\n TimeDelta idle = Time::Now() - elmt->second.access;\n if (idle >= TimeDelta::FromMinutes(kRendererInactiveThresholdMinutes)) {\n \/\/ Moved to inactive status. This invalidates our iterator.\n inactive_renderers_.insert(*iter);\n active_renderers_.erase(*iter);\n iter = active_renderers_.begin();\n continue;\n }\n ++iter;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===------------------------ stdexcept.cpp -------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is dual licensed under the MIT and the University of Illinois Open\n\/\/ Source Licenses. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"stdexcept\"\n#include \"new\"\n#include \"string\"\n#include <cstdlib>\n#include <cstring>\n#include <cstdint>\n#include <cstddef>\n#include \"system_error\"\n\n#ifndef __has_include\n#define __has_include(inc) 0\n#endif\n\n#ifdef __APPLE__\n#include <cxxabi.h>\n#elif defined(LIBCXXRT) || __has_include(<cxxabi.h>)\n#include <cxxabi.h>\n#endif\n\n\/\/ Note: optimize for size\n\n#if ! defined(_LIBCPP_MSVC)\n#pragma GCC visibility push(hidden)\n#endif\n\nnamespace\n{\n\nclass __libcpp_nmstr\n{\nprivate:\n const char* str_;\n\n typedef std::size_t unused_t;\n typedef std::ptrdiff_t count_t;\n\n static const std::ptrdiff_t offset = static_cast<std::ptrdiff_t>(2*sizeof(unused_t) +\n sizeof(count_t));\n\n count_t& count() const _NOEXCEPT {return *const_cast<count_t *>(reinterpret_cast<const count_t *>(str_ - sizeof(count_t)));}\npublic:\n explicit __libcpp_nmstr(const char* msg);\n __libcpp_nmstr(const __libcpp_nmstr& s) _NOEXCEPT;\n __libcpp_nmstr& operator=(const __libcpp_nmstr& s) _NOEXCEPT;\n ~__libcpp_nmstr();\n const char* c_str() const _NOEXCEPT {return str_;}\n};\n\n__libcpp_nmstr::__libcpp_nmstr(const char* msg)\n{\n std::size_t len = strlen(msg);\n str_ = new char[len + 1 + offset];\n unused_t* c = reinterpret_cast<unused_t*>(const_cast<char *>(str_));\n c[0] = c[1] = len;\n str_ += offset;\n count() = 0;\n std::memcpy(const_cast<char*>(c_str()), msg, len + 1);\n}\n\ninline\n__libcpp_nmstr::__libcpp_nmstr(const __libcpp_nmstr& s) _NOEXCEPT\n : str_(s.str_)\n{\n __sync_add_and_fetch(&count(), 1);\n}\n\n__libcpp_nmstr&\n__libcpp_nmstr::operator=(const __libcpp_nmstr& s) _NOEXCEPT\n{\n const char* p = str_;\n str_ = s.str_;\n __sync_add_and_fetch(&count(), 1);\n if (__sync_add_and_fetch(reinterpret_cast<const count_t*>(p-sizeof(count_t)), count_t(-1)) < 0)\n delete [] (p-offset);\n return *this;\n}\n\ninline\n__libcpp_nmstr::~__libcpp_nmstr()\n{\n if (__sync_add_and_fetch(&count(), count_t(-1)) < 0)\n delete [] (str_ - offset);\n}\n\n}\n\n#if ! defined(_LIBCPP_MSVC)\n#pragma GCC visibility pop\n#endif\n\nnamespace std \/\/ purposefully not using versioning namespace\n{\n\nlogic_error::logic_error(const string& msg)\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n ::new(s) __libcpp_nmstr(msg.c_str());\n}\n\nlogic_error::logic_error(const char* msg)\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n ::new(s) __libcpp_nmstr(msg);\n}\n\nlogic_error::logic_error(const logic_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n const __libcpp_nmstr *s2 = static_cast<const __libcpp_nmstr *>(le.__imp_);\n ::new(s) __libcpp_nmstr(*s2);\n}\n\nlogic_error&\nlogic_error::operator=(const logic_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s1 = static_cast<__libcpp_nmstr *>(__imp_);\n const __libcpp_nmstr *s2 = static_cast<const __libcpp_nmstr *>(le.__imp_);\n *s1 = *s2;\n return *this;\n}\n\n#if !defined(_LIBCPPABI_VERSION) && !defined(LIBSTDCXX)\n\nlogic_error::~logic_error() _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n s->~__libcpp_nmstr();\n}\n\nconst char*\nlogic_error::what() const _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n return s->c_str();\n}\n\n#endif\n\nruntime_error::runtime_error(const string& msg)\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n ::new(s) __libcpp_nmstr(msg.c_str());\n}\n\nruntime_error::runtime_error(const char* msg)\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n ::new(s) __libcpp_nmstr(msg);\n}\n\nruntime_error::runtime_error(const runtime_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n const __libcpp_nmstr *s2 = static_cast<const __libcpp_nmstr *>(le.__imp_);\n ::new(s) __libcpp_nmstr(*s2);\n}\n\nruntime_error&\nruntime_error::operator=(const runtime_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s1 = static_cast<__libcpp_nmstr *>(__imp_);\n const __libcpp_nmstr *s2 = static_cast<const __libcpp_nmstr *>(le.__imp_);\n *s1 = *s2;\n return *this;\n}\n\n#if !defined(_LIBCPPABI_VERSION) && !defined(LIBSTDCXX)\n\nruntime_error::~runtime_error() _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n s->~__libcpp_nmstr();\n}\n\nconst char*\nruntime_error::what() const _NOEXCEPT\n{\n __libcpp_nmstr *s = static_cast<__libcpp_nmstr *>(__imp_);\n return s->c_str();\n}\n\ndomain_error::~domain_error() _NOEXCEPT {}\ninvalid_argument::~invalid_argument() _NOEXCEPT {}\nlength_error::~length_error() _NOEXCEPT {}\nout_of_range::~out_of_range() _NOEXCEPT {}\n\nrange_error::~range_error() _NOEXCEPT {}\noverflow_error::~overflow_error() _NOEXCEPT {}\nunderflow_error::~underflow_error() _NOEXCEPT {}\n\n#endif\n\n} \/\/ std\n<commit_msg>Replace casts of __impl_ with the correct reinterpret_cast of the address. Restores the assembly of before r198504.<commit_after>\/\/===------------------------ stdexcept.cpp -------------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is dual licensed under the MIT and the University of Illinois Open\n\/\/ Source Licenses. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"stdexcept\"\n#include \"new\"\n#include \"string\"\n#include <cstdlib>\n#include <cstring>\n#include <cstdint>\n#include <cstddef>\n#include \"system_error\"\n\n#ifndef __has_include\n#define __has_include(inc) 0\n#endif\n\n#ifdef __APPLE__\n#include <cxxabi.h>\n#elif defined(LIBCXXRT) || __has_include(<cxxabi.h>)\n#include <cxxabi.h>\n#endif\n\n\/\/ Note: optimize for size\n\n#if ! defined(_LIBCPP_MSVC)\n#pragma GCC visibility push(hidden)\n#endif\n\nnamespace\n{\n\nclass __libcpp_nmstr\n{\nprivate:\n const char* str_;\n\n typedef std::size_t unused_t;\n typedef std::ptrdiff_t count_t;\n\n static const std::ptrdiff_t offset = static_cast<std::ptrdiff_t>(2*sizeof(unused_t) +\n sizeof(count_t));\n\n count_t& count() const _NOEXCEPT {return *const_cast<count_t *>(reinterpret_cast<const count_t *>(str_ - sizeof(count_t)));}\npublic:\n explicit __libcpp_nmstr(const char* msg);\n __libcpp_nmstr(const __libcpp_nmstr& s) _NOEXCEPT;\n __libcpp_nmstr& operator=(const __libcpp_nmstr& s) _NOEXCEPT;\n ~__libcpp_nmstr();\n const char* c_str() const _NOEXCEPT {return str_;}\n};\n\n__libcpp_nmstr::__libcpp_nmstr(const char* msg)\n{\n std::size_t len = strlen(msg);\n str_ = new char[len + 1 + offset];\n unused_t* c = reinterpret_cast<unused_t*>(const_cast<char *>(str_));\n c[0] = c[1] = len;\n str_ += offset;\n count() = 0;\n std::memcpy(const_cast<char*>(c_str()), msg, len + 1);\n}\n\ninline\n__libcpp_nmstr::__libcpp_nmstr(const __libcpp_nmstr& s) _NOEXCEPT\n : str_(s.str_)\n{\n __sync_add_and_fetch(&count(), 1);\n}\n\n__libcpp_nmstr&\n__libcpp_nmstr::operator=(const __libcpp_nmstr& s) _NOEXCEPT\n{\n const char* p = str_;\n str_ = s.str_;\n __sync_add_and_fetch(&count(), 1);\n if (__sync_add_and_fetch(reinterpret_cast<const count_t*>(p-sizeof(count_t)), count_t(-1)) < 0)\n delete [] (p-offset);\n return *this;\n}\n\ninline\n__libcpp_nmstr::~__libcpp_nmstr()\n{\n if (__sync_add_and_fetch(&count(), count_t(-1)) < 0)\n delete [] (str_ - offset);\n}\n\n}\n\n#if ! defined(_LIBCPP_MSVC)\n#pragma GCC visibility pop\n#endif\n\nnamespace std \/\/ purposefully not using versioning namespace\n{\n\nlogic_error::logic_error(const string& msg)\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n ::new(s) __libcpp_nmstr(msg.c_str());\n}\n\nlogic_error::logic_error(const char* msg)\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n ::new(s) __libcpp_nmstr(msg);\n}\n\nlogic_error::logic_error(const logic_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n const __libcpp_nmstr *s2 = reinterpret_cast<const __libcpp_nmstr *>(&le.__imp_);\n ::new(s) __libcpp_nmstr(*s2);\n}\n\nlogic_error&\nlogic_error::operator=(const logic_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s1 = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n const __libcpp_nmstr *s2 = reinterpret_cast<const __libcpp_nmstr *>(&le.__imp_);\n *s1 = *s2;\n return *this;\n}\n\n#if !defined(_LIBCPPABI_VERSION) && !defined(LIBSTDCXX)\n\nlogic_error::~logic_error() _NOEXCEPT\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n s->~__libcpp_nmstr();\n}\n\nconst char*\nlogic_error::what() const _NOEXCEPT\n{\n const __libcpp_nmstr *s = reinterpret_cast<const __libcpp_nmstr *>(&__imp_);\n return s->c_str();\n}\n\n#endif\n\nruntime_error::runtime_error(const string& msg)\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n ::new(s) __libcpp_nmstr(msg.c_str());\n}\n\nruntime_error::runtime_error(const char* msg)\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n ::new(s) __libcpp_nmstr(msg);\n}\n\nruntime_error::runtime_error(const runtime_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n const __libcpp_nmstr *s2 = reinterpret_cast<const __libcpp_nmstr *>(&le.__imp_);\n ::new(s) __libcpp_nmstr(*s2);\n}\n\nruntime_error&\nruntime_error::operator=(const runtime_error& le) _NOEXCEPT\n{\n __libcpp_nmstr *s1 = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n const __libcpp_nmstr *s2 = reinterpret_cast<const __libcpp_nmstr *>(&le.__imp_);\n *s1 = *s2;\n return *this;\n}\n\n#if !defined(_LIBCPPABI_VERSION) && !defined(LIBSTDCXX)\n\nruntime_error::~runtime_error() _NOEXCEPT\n{\n __libcpp_nmstr *s = reinterpret_cast<__libcpp_nmstr *>(&__imp_);\n s->~__libcpp_nmstr();\n}\n\nconst char*\nruntime_error::what() const _NOEXCEPT\n{\n const __libcpp_nmstr *s = reinterpret_cast<const __libcpp_nmstr *>(&__imp_);\n return s->c_str();\n}\n\ndomain_error::~domain_error() _NOEXCEPT {}\ninvalid_argument::~invalid_argument() _NOEXCEPT {}\nlength_error::~length_error() _NOEXCEPT {}\nout_of_range::~out_of_range() _NOEXCEPT {}\n\nrange_error::~range_error() _NOEXCEPT {}\noverflow_error::~overflow_error() _NOEXCEPT {}\nunderflow_error::~underflow_error() _NOEXCEPT {}\n\n#endif\n\n} \/\/ std\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <type_traits>\n\n#include <utility>\n\n#include <new>\n\nnamespace generic\n{\n\ntemplate<typename F>\nclass forwarder;\n\ntemplate<typename R, typename ...A>\nclass forwarder<R (A...)>\n{\npublic:\n forwarder() = default;\n\n forwarder(forwarder const&) = default;\n\n template<typename T>\n forwarder(T&& f) noexcept : stub_(handler<T>::stub)\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n }\n\n forwarder& operator=(forwarder const&) = default;\n\n template <\n typename T,\n typename = typename ::std::enable_if<\n !::std::is_same<forwarder, typename ::std::decay<T>::type>{}\n >::type\n >\n forwarder& operator=(T&& f) noexcept\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n\n stub_ = handler<T>::stub;\n\n return *this;\n }\n\n R operator() (A... args)\n {\n \/\/assert(stub_);\n return stub_(&store_, ::std::forward<A>(args)...);\n }\n\nprivate:\n template<typename T>\n struct handler\n {\n handler(T&& f) noexcept : f_(::std::forward<T>(f))\n {\n }\n\n static R stub(void* ptr, A&&... args)\n {\n return static_cast<handler<T>*>(ptr)->f_(::std::forward<A>(args)...);\n }\n\n T f_;\n };\n\n#if defined(__clang__)\n using max_align_type = long double;\n#elif defined(__GNUC__)\n using max_align_type = ::max_align_t;\n#else\n using max_align_type = ::std::max_align_t;\n#endif\n\n alignas(max_align_type) ::std::uintptr_t store_;\n\n R (*stub_)(void*, A&&...){};\n};\n\n}\n<commit_msg>some fixes<commit_after>#include <cassert>\n\n#include <cstddef>\n\n#include <cstdint>\n\n#include <type_traits>\n\n#include <utility>\n\n#include <new>\n\nnamespace generic\n{\n\ntemplate<typename F>\nclass forwarder;\n\ntemplate<typename R, typename ...A>\nclass forwarder<R (A...)>\n{\npublic:\n forwarder() = default;\n\n forwarder(forwarder const&) = default;\n\n template<typename T>\n forwarder(T&& f) : stub_(handler<T>::stub)\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n }\n\n forwarder& operator=(forwarder const&) = default;\n\n template <\n typename T,\n typename = typename ::std::enable_if<\n !::std::is_same<forwarder, typename ::std::decay<T>::type>{}\n >::type\n >\n forwarder& operator=(T&& f)\n {\n static_assert(sizeof(T) <= sizeof(store_), \"functor too large\");\n static_assert(::std::is_trivially_destructible<T>::value,\n \"functor not trivially destructible\");\n new (&store_) handler<T>(::std::forward<T>(f));\n\n stub_ = handler<T>::stub;\n\n return *this;\n }\n\n R operator() (A... args)\n {\n \/\/assert(stub_);\n return stub_(&store_, ::std::forward<A>(args)...);\n }\n\nprivate:\n template<typename T>\n struct handler\n {\n handler(T&& f) noexcept : f_(::std::forward<T>(f))\n {\n }\n\n static R stub(void* ptr, A&&... args)\n {\n return static_cast<handler<T>*>(ptr)->f_(::std::forward<A>(args)...);\n }\n\n T f_;\n };\n\n#if defined(__clang__)\n using max_align_type = long double;\n#elif defined(__GNUC__)\n using max_align_type = ::max_align_t;\n#else\n using max_align_type = ::std::max_align_t;\n#endif\n\n alignas(max_align_type) ::std::uintptr_t store_;\n\n R (*stub_)(void*, A&&...){};\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ITER_ENUMERATE_H_\n#define ITER_ENUMERATE_H_\n\n#include \"internal\/iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <functional>\n#include <initializer_list>\n#include <type_traits>\n\nnamespace iter {\n namespace impl {\n template <typename Container, typename Index>\n class Enumerable;\n\n using EnumerateFn = IterToolFnOptionalBindSecond<Enumerable, std::size_t>;\n }\n constexpr impl::EnumerateFn enumerate{};\n}\n\ntemplate <typename Container, typename Index>\nclass iter::impl::Enumerable {\n private:\n Container container;\n const Index start;\n\n friend EnumerateFn;\n\n \/\/ for IterYield\n using BasePair = std::pair<Index, iterator_deref<Container>>;\n\n \/\/ Value constructor for use only in the enumerate function\n Enumerable(Container&& in_container, Index in_start)\n : container(std::forward<Container>(in_container)), start{in_start} {}\n\n public:\n Enumerable(Enumerable&&) = default;\n\n \/\/ \"yielded\" by the Enumerable::Iterator. Has a .index, and a\n \/\/ .element referencing the value yielded by the subiterator\n class IterYield : public BasePair {\n public:\n using BasePair::BasePair;\n typename BasePair::first_type& index = BasePair::first;\n typename BasePair::second_type& element = BasePair::second;\n };\n\n \/\/ Holds an iterator of the contained type and an Index for the\n \/\/ index. Each call to ++ increments both of these data members.\n \/\/ Each dereference returns an IterYield.\n class Iterator : public std::iterator<std::input_iterator_tag, IterYield> {\n private:\n iterator_type<Container> sub_iter;\n Index index;\n\n public:\n Iterator(iterator_type<Container>&& si, Index start)\n : sub_iter{std::move(si)}, index{start} {}\n\n IterYield operator*() {\n return {this->index, *this->sub_iter};\n }\n\n ArrowProxy<IterYield> operator->() {\n return {**this};\n }\n\n Iterator& operator++() {\n ++this->sub_iter;\n ++this->index;\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container), start};\n }\n\n Iterator end() {\n return {std::end(this->container), start};\n }\n};\n\n#endif\n<commit_msg>Supports different begin and end in enumerate<commit_after>#ifndef ITER_ENUMERATE_H_\n#define ITER_ENUMERATE_H_\n\n#include \"internal\/iterbase.hpp\"\n#include \"internal\/iterator_wrapper.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <functional>\n#include <initializer_list>\n#include <type_traits>\n\nnamespace iter {\n namespace impl {\n template <typename Container, typename Index>\n class Enumerable;\n\n using EnumerateFn = IterToolFnOptionalBindSecond<Enumerable, std::size_t>;\n }\n constexpr impl::EnumerateFn enumerate{};\n}\n\ntemplate <typename Container, typename Index>\nclass iter::impl::Enumerable {\n private:\n Container container;\n const Index start;\n\n friend EnumerateFn;\n\n \/\/ for IterYield\n using BasePair = std::pair<Index, iterator_deref<Container>>;\n\n \/\/ Value constructor for use only in the enumerate function\n Enumerable(Container&& in_container, Index in_start)\n : container(std::forward<Container>(in_container)), start{in_start} {}\n\n public:\n Enumerable(Enumerable&&) = default;\n\n \/\/ \"yielded\" by the Enumerable::Iterator. Has a .index, and a\n \/\/ .element referencing the value yielded by the subiterator\n class IterYield : public BasePair {\n public:\n using BasePair::BasePair;\n typename BasePair::first_type& index = BasePair::first;\n typename BasePair::second_type& element = BasePair::second;\n };\n\n \/\/ Holds an iterator of the contained type and an Index for the\n \/\/ index. Each call to ++ increments both of these data members.\n \/\/ Each dereference returns an IterYield.\n class Iterator : public std::iterator<std::input_iterator_tag, IterYield> {\n private:\n IteratorWrapper<Container> sub_iter;\n Index index;\n\n public:\n Iterator(IteratorWrapper<Container>&& si, Index start)\n : sub_iter{std::move(si)}, index{start} {}\n\n IterYield operator*() {\n return {this->index, *this->sub_iter};\n }\n\n ArrowProxy<IterYield> operator->() {\n return {**this};\n }\n\n Iterator& operator++() {\n ++this->sub_iter;\n ++this->index;\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container), start};\n }\n\n Iterator end() {\n return {std::end(this->container), start};\n }\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 1998, 2000-2007, 2010, 2011, 2012, 2013 SINTEF ICT,\n * Applied Mathematics, Norway.\n *\n * Contact information: E-mail: tor.dokken@sintef.no \n * SINTEF ICT, Department of Applied Mathematics, \n * P.O. Box 124 Blindern, \n * 0314 Oslo, Norway. \n *\n * This file is part of GoTools.\n *\n * GoTools is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version. \n *\n * GoTools is distributed in the hope that it will be useful, \n * but WITHOUT ANY WARRANTY; without even the implied warranty of \n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public\n * License along with GoTools. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\n * In accordance with Section 7(b) of the GNU Affero General Public\n * License, a covered work must retain the producer line in every data\n * file that is created or manipulated using GoTools.\n *\n * Other Usage\n * You can be released from the requirements of the license by purchasing\n * a commercial license. Buying such a license is mandatory as soon as you\n * develop commercial activities involving the GoTools library without\n * disclosing the source code of your own applications.\n *\n * This file may be used in accordance with the terms contained in a\n * written agreement between you and SINTEF ICT. \n *\/\n\n#include \"GoTools\/viewlib\/DefaultDataHandler.h\"\n\n#include \"GoTools\/viewlib\/vol_and_lr\/DataHandlerVolAndLR.h\"\n#include \"GoTools\/viewlib\/vol_and_lr\/RectangularVolumePropertySheet.h\"\n#include \"GoTools\/viewlib\/vol_and_lr\/gvRectangularVolumePaintable.h\"\n\n#include \"GoTools\/viewlib\/gvRectangularSurfacePaintable.h\"\n#include \"GoTools\/viewlib\/RectangularSurfacePropertySheet.h\"\n\n#include \"GoTools\/lrsplines2D\/LRSplineSurface.h\"\n#include \"GoTools\/trivariate\/SplineVolume.h\"\n#include \"GoTools\/trivariate\/RectangularVolumeTesselator.h\"\n#include \"GoTools\/tesselator\/RectangularSurfaceTesselator.h\"\n\n#include <GoTools\/geometry\/GoTools.h>\n#include \"GoTools\/geometry\/Factory.h\"\n\nusing namespace Go;\nusing std::vector;\n\/\/ using std::shared_ptr;\n\/\/ using dynamic_pointer_cast;\n\n\/\/===========================================================================\nDataHandlerVolAndLR::~DataHandlerVolAndLR()\n \/\/===========================================================================\n{\n}\n\n\/\/===========================================================================\nDataHandlerVolAndLR::DataHandlerVolAndLR()\n \/\/===========================================================================\n{\n \/\/ Create the default factory\n GoTools::init();\n Registrator<SplineVolume> r700;\n Registrator<LRSplineSurface> r293;\n\n \/\/ cout << \"Registering should be processed by now.\" << endl;\n}\n\n\n\/\/===========================================================================\nvoid DataHandlerVolAndLR::create(shared_ptr<GeomObject> obj,\n\t\t\t\tconst gvColor& col, int id)\n \/\/===========================================================================\n{\n \/\/ cout << \"DataHandlerVolAndLR::create... \" << flush;\n ClassType type = obj->instanceType();\n\n \/\/ Make unbounded elementary objects bounded with \"canonical\" parameter\n \/\/ bounds. This is ugly and arbitrary. We need this hack in order to\n \/\/ tesselate.\n switch (type) {\n case Class_LRSplineSurface:\n {\n\tconst ParamSurface& sf\n\t = dynamic_cast<const ParamSurface&>(*obj);\n\tif (sf.dimension() == 1)\n\t{\n\t LRSplineSurface& lr_sf\n\t\t= dynamic_cast<LRSplineSurface&>(*obj);\n#if 0\n\t MESSAGE(\"Setting parameter domain to the unit square!\");\n\t lr_sf.setParameterDomain(0.0, 1.0, 0.0, 1.0);\n#endif\n\t MESSAGE(\"Lifting lrspline_sf from 1D to 3D.\");\n\t lr_sf.to3D();\n\t}\n\n#if 0\n\t{\n\t LRSplineSurface& lr_sf\n\t\t= dynamic_cast<LRSplineSurface&>(*obj);\n\t MESSAGE(\"Translating the surface to the origin!\");\n\t BoundingBox bd_box = lr_sf.boundingBox();\n\t Point mid_pt = 0.5*(bd_box.low() + bd_box.high());\n\t Point transl_pt = -mid_pt;\n\t std::cout << \"transl_pt: (\" << transl_pt[0] << \", \" << transl_pt[1] << \", \" << transl_pt[2] << std::endl;\n\t lr_sf.translate(transl_pt);\n\t}\n#endif\n\n\tshared_ptr<RectangularSurfaceTesselator> te(new RectangularSurfaceTesselator(sf));\n\tshared_ptr<gvRectangularSurfacePaintable> pa\n\t (new gvRectangularSurfacePaintable(*(te->getMesh()), col, id));\n\tshared_ptr<ParamSurface> psf = \n\t dynamic_pointer_cast<ParamSurface, GeomObject>(obj);\n\tshared_ptr<gvPropertySheet> ps(new RectangularSurfacePropertySheet(te.get(), pa.get(), \n\t\t\t\t\t\t\t\t\t psf));\n\ttesselator_ = te;\n\tpaintable_ = pa;\n\tproperty_sheet_ = ps;\n\tbreak;\n }\n case Class_SplineVolume:\n {\n\/\/\tMESSAGE(\"SplineVolume support coming soon!\");\n\n\tconst SplineVolume& sv\n\t = dynamic_cast<const SplineVolume&>(*obj);\n\n\tshared_ptr<RectangularVolumeTesselator> te(new RectangularVolumeTesselator(sv));\n\tshared_ptr<gvRectangularVolumePaintable> pa\n\t (new gvRectangularVolumePaintable(*(te->getMesh()), col, id));\n\tshared_ptr<ParamVolume> pvol = \n\t dynamic_pointer_cast<ParamVolume, GeomObject>(obj);\n\tshared_ptr<gvPropertySheet> ps(new RectangularVolumePropertySheet(te.get(), pa.get(), \n\t\t\t\t\t\t\t\t\t pvol));\n\ttesselator_ = te;\n\tpaintable_ = pa;\n\tproperty_sheet_ = ps;\n\tbreak;\n\n }\n default:\n\tDefaultDataHandler::create(obj, col, id);\n }\n \/\/ cout << \"finished\" << endl;\n}\n\n<commit_msg>* Lifting 1D trimmed LRSplineSurface to 3D in viewlib data handler.<commit_after>\/*\n * Copyright (C) 1998, 2000-2007, 2010, 2011, 2012, 2013 SINTEF ICT,\n * Applied Mathematics, Norway.\n *\n * Contact information: E-mail: tor.dokken@sintef.no \n * SINTEF ICT, Department of Applied Mathematics, \n * P.O. Box 124 Blindern, \n * 0314 Oslo, Norway. \n *\n * This file is part of GoTools.\n *\n * GoTools is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version. \n *\n * GoTools is distributed in the hope that it will be useful, \n * but WITHOUT ANY WARRANTY; without even the implied warranty of \n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public\n * License along with GoTools. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\n * In accordance with Section 7(b) of the GNU Affero General Public\n * License, a covered work must retain the producer line in every data\n * file that is created or manipulated using GoTools.\n *\n * Other Usage\n * You can be released from the requirements of the license by purchasing\n * a commercial license. Buying such a license is mandatory as soon as you\n * develop commercial activities involving the GoTools library without\n * disclosing the source code of your own applications.\n *\n * This file may be used in accordance with the terms contained in a\n * written agreement between you and SINTEF ICT. \n *\/\n\n#include \"GoTools\/viewlib\/DefaultDataHandler.h\"\n\n#include \"GoTools\/viewlib\/vol_and_lr\/DataHandlerVolAndLR.h\"\n#include \"GoTools\/viewlib\/vol_and_lr\/RectangularVolumePropertySheet.h\"\n#include \"GoTools\/viewlib\/vol_and_lr\/gvRectangularVolumePaintable.h\"\n\n#include \"GoTools\/viewlib\/gvRectangularSurfacePaintable.h\"\n#include \"GoTools\/viewlib\/RectangularSurfacePropertySheet.h\"\n\n#include \"GoTools\/lrsplines2D\/LRSplineSurface.h\"\n#include \"GoTools\/trivariate\/SplineVolume.h\"\n#include \"GoTools\/trivariate\/RectangularVolumeTesselator.h\"\n#include \"GoTools\/tesselator\/RectangularSurfaceTesselator.h\"\n\n#include <GoTools\/geometry\/GoTools.h>\n#include \"GoTools\/geometry\/Factory.h\"\n\nusing namespace Go;\nusing std::vector;\n\/\/ using std::shared_ptr;\n\/\/ using dynamic_pointer_cast;\n\n\/\/===========================================================================\nDataHandlerVolAndLR::~DataHandlerVolAndLR()\n \/\/===========================================================================\n{\n}\n\n\/\/===========================================================================\nDataHandlerVolAndLR::DataHandlerVolAndLR()\n \/\/===========================================================================\n{\n \/\/ Create the default factory\n GoTools::init();\n Registrator<SplineVolume> r700;\n Registrator<LRSplineSurface> r293;\n\n \/\/ cout << \"Registering should be processed by now.\" << endl;\n}\n\n\n\/\/===========================================================================\nvoid DataHandlerVolAndLR::create(shared_ptr<GeomObject> obj,\n\t\t\t\tconst gvColor& col, int id)\n \/\/===========================================================================\n{\n \/\/ cout << \"DataHandlerVolAndLR::create... \" << flush;\n ClassType type = obj->instanceType();\n\n \/\/ Make unbounded elementary objects bounded with \"canonical\" parameter\n \/\/ bounds. This is ugly and arbitrary. We need this hack in order to\n \/\/ tesselate.\n switch (type) {\n case Class_LRSplineSurface:\n {\n\tconst ParamSurface& sf\n\t = dynamic_cast<const ParamSurface&>(*obj);\n\tif (sf.dimension() == 1)\n\t{\n\t LRSplineSurface& lr_sf\n\t\t= dynamic_cast<LRSplineSurface&>(*obj);\n#if 0\n\t MESSAGE(\"Setting parameter domain to the unit square!\");\n\t lr_sf.setParameterDomain(0.0, 1.0, 0.0, 1.0);\n#endif\n\t MESSAGE(\"Lifting lrspline_sf from 1D to 3D.\");\n\t lr_sf.to3D();\n\t}\n\n#if 0\n\t{\n\t LRSplineSurface& lr_sf\n\t\t= dynamic_cast<LRSplineSurface&>(*obj);\n\t MESSAGE(\"Translating the surface to the origin!\");\n\t BoundingBox bd_box = lr_sf.boundingBox();\n\t Point mid_pt = 0.5*(bd_box.low() + bd_box.high());\n\t Point transl_pt = -mid_pt;\n\t std::cout << \"transl_pt: (\" << transl_pt[0] << \", \" << transl_pt[1] << \", \" << transl_pt[2] << std::endl;\n\t lr_sf.translate(transl_pt);\n\t}\n#endif\n\n\tshared_ptr<RectangularSurfaceTesselator> te(new RectangularSurfaceTesselator(sf));\n\tshared_ptr<gvRectangularSurfacePaintable> pa\n\t (new gvRectangularSurfacePaintable(*(te->getMesh()), col, id));\n\tshared_ptr<ParamSurface> psf = \n\t dynamic_pointer_cast<ParamSurface, GeomObject>(obj);\n\tshared_ptr<gvPropertySheet> ps(new RectangularSurfacePropertySheet(te.get(), pa.get(), \n\t\t\t\t\t\t\t\t\t psf));\n\ttesselator_ = te;\n\tpaintable_ = pa;\n\tproperty_sheet_ = ps;\n\tbreak;\n }\n case Class_SplineVolume:\n {\n\/\/\tMESSAGE(\"SplineVolume support coming soon!\");\n\n\tconst SplineVolume& sv\n\t = dynamic_cast<const SplineVolume&>(*obj);\n\n\tshared_ptr<RectangularVolumeTesselator> te(new RectangularVolumeTesselator(sv));\n\tshared_ptr<gvRectangularVolumePaintable> pa\n\t (new gvRectangularVolumePaintable(*(te->getMesh()), col, id));\n\tshared_ptr<ParamVolume> pvol = \n\t dynamic_pointer_cast<ParamVolume, GeomObject>(obj);\n\tshared_ptr<gvPropertySheet> ps(new RectangularVolumePropertySheet(te.get(), pa.get(), \n\t\t\t\t\t\t\t\t\t pvol));\n\ttesselator_ = te;\n\tpaintable_ = pa;\n\tproperty_sheet_ = ps;\n\tbreak;\n\n }\n case Class_BoundedSurface:\n {\n\tBoundedSurface& sf\n\t = dynamic_cast<BoundedSurface&>(*obj);\n\tshared_ptr<ParamSurface> under_sf = sf.underlyingSurface();\n\tif (under_sf->instanceType() == Class_LRSplineSurface)\n\t{\n\t MESSAGE(\"Lifting underlying lrspline_sf from 1D to 3D.\");\n\t shared_ptr<LRSplineSurface> lr_sf = dynamic_pointer_cast<LRSplineSurface>(under_sf);\n\t lr_sf->to3D();\n\t}\n }\n default:\n\tDefaultDataHandler::create(obj, col, id);\n }\n \/\/ cout << \"finished\" << endl;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperQtWidgetParameterGroup.h\"\n#include \"otbWrapperQtWidgetChoiceParameter.h\"\n#include \"otbWrapperQtWidgetParameterLabel.h\"\n#include \"otbWrapperQtWidgetParameterFactory.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nQtWidgetParameterGroup::QtWidgetParameterGroup(ParameterGroup::Pointer paramList, QtWidgetModel* m)\n: QtWidgetParameterBase(paramList, m),\n m_ParamList(paramList)\n{\n}\n\nQtWidgetParameterGroup::~QtWidgetParameterGroup()\n{\n}\n\nvoid QtWidgetParameterGroup::DoUpdateGUI()\n{\n WidgetListIteratorType it = m_WidgetList.begin();\n for (it = m_WidgetList.begin(); it != m_WidgetList.end(); ++it)\n {\n (*it)->UpdateGUI();\n }\n}\n\nvoid QtWidgetParameterGroup::DoCreateWidget()\n{\n \/\/ a GridLayout with two columns : parameter label \/ parameter widget\n QGridLayout *gridLayout = new QGridLayout;\n gridLayout->setSpacing(1);\n gridLayout->setContentsMargins(0, 0, 0, 0);\n\n unsigned int nbParams = m_ParamList->GetNumberOfParameters();\n for (unsigned int i = 0; i < nbParams; ++i)\n {\n Parameter* param = m_ParamList->GetParameterByIndex(i);\n\n if (param != 0)\n {\n ParameterGroup* paramAsGroup = dynamic_cast<ParameterGroup*>(param);\n ChoiceParameter* paramAsChoice = dynamic_cast<ChoiceParameter*>(param);\n\n if (paramAsGroup == 0 && paramAsChoice == 0)\n {\n \/\/ Label (col 1)\n QWidget* label = new QtWidgetParameterLabel( param );\n gridLayout->addWidget(label, i, 1);\n\n \/\/ Parameter Widget (col 2)\n QtWidgetParameterBase* specificWidget = QtWidgetParameterFactory::CreateQtWidget( param, GetModel() );\n gridLayout->addWidget(specificWidget, i, 2 );\n\n \/\/ CheckBox (col 0)\n QCheckBox * checkBox = new QCheckBox;\n connect( checkBox, SIGNAL(clicked(bool)), specificWidget, SLOT(SetActivationState(bool)));\n connect( checkBox, SIGNAL(clicked(bool)), GetModel(), SLOT(NotifyUpdate()) );\n connect( specificWidget, SIGNAL(ParameterActiveStatus(bool)), checkBox, SLOT(setChecked(bool)));\n connect( specificWidget, SIGNAL(ParameterActiveStatus(bool)), specificWidget, SLOT(SetActivationState(bool)));\n\n \/\/ if Mandatory make the checkbox checked and deactivated\n if (param->GetMandatory())\n {\n checkBox->setCheckState(Qt::Checked);\n checkBox->setEnabled(false);\n specificWidget->setEnabled(true);\n }\n else\n {\n checkBox->setCheckState(Qt::Unchecked);\n checkBox->setEnabled(true);\n specificWidget->setEnabled(false);\n }\n gridLayout->addWidget(checkBox, i, 0);\n\n \/\/ Reset Button\n \/\/ Make sense only for NumericalParameter\n if (dynamic_cast<IntParameter*>(param)\n || dynamic_cast<FloatParameter*>(param)\n || dynamic_cast<RadiusParameter*>(param)\n \/*|| dynamic_cast<RAMParameter*>(param)*\/)\n {\n QPushButton* resetButton = new QPushButton;\n resetButton->setText(\"Reset\");\n resetButton->setToolTip(\"Reset the value of this parameter\");\n gridLayout->addWidget(resetButton, i, 3);\n \n \/\/ Slots to connect to the reset button\n connect( resetButton, SIGNAL(clicked()), specificWidget, SLOT(Reset()) );\n connect( resetButton, SIGNAL(clicked()), GetModel(), SLOT(NotifyUpdate()) );\n }\n\n m_WidgetList.push_back(specificWidget);\n }\n else\n {\n QtWidgetParameterBase* specificWidget = QtWidgetParameterFactory::CreateQtWidget( param, GetModel() );\n\n QVBoxLayout* vboxLayout = new QVBoxLayout;\n vboxLayout->addWidget(specificWidget);\n QGroupBox* group = new QGroupBox;\n group->setLayout(vboxLayout);\n\n \/\/ Make the paramter Group checkable when it is not mandatory\n if (!param->GetMandatory() )\n {\n group->setCheckable(true);\n group->setChecked(false);\n\n \/\/ Update iteratively the children status\n for (unsigned int idx = 0; idx < param->GetChildrenList().size(); ++idx)\n {\n \/\/ deactivate the children tree\n this->ProcessChild(param->GetChildrenList()[idx], false);\n }\n }\n else\n {\n param->SetActive(true);\n }\n connect(group, SIGNAL(clicked(bool)), specificWidget, SLOT(SetActivationState(bool)));\n\n group->setTitle(param->GetName());\n gridLayout->addWidget(group, i, 0, 1, -1);\n\n m_WidgetList.push_back(specificWidget);\n }\n }\n }\n\n this->setLayout(gridLayout);\n}\n\n\n\/\/ Slot connected to the signal emitted the checkBox relative to\n\/\/ current widget\nvoid QtWidgetParameterGroup::SetActivationState( bool value )\n{\n \/\/ First call the superclass implementation\n this->QtWidgetParameterBase::SetActivationState(value);\n\n \/\/ Update the Group status\n this->setEnabled(value);\n\n \/\/ Update iteratively the children status\n for (unsigned int idx = 0; idx < m_ParamList->GetChildrenList().size(); ++idx)\n {\n this->ProcessChild(m_ParamList->GetChildrenList()[idx], value);\n }\n}\n\n\/\/ Activate iteratively the children\nvoid QtWidgetParameterGroup::ProcessChild(Parameter* currentNode, bool status)\n{\n \/\/ Activate the current node if it was checked\n if ( currentNode->IsChecked() && status)\n {\n currentNode->SetActive(status);\n }\n\n \/\/ If the status is false (deactivating) deactivate all the children\n \/\/ tree\n if (!status)\n {\n currentNode->SetActive(status);\n }\n\n unsigned int counter = 0;\n while(counter < currentNode->GetChildrenList().size())\n {\n this->ProcessChild(currentNode->GetChildrenList()[counter], status);\n ++counter;\n }\n}\n\n\n}\n}\n<commit_msg>ENH: don't use Reset button for Role_Output param<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperQtWidgetParameterGroup.h\"\n#include \"otbWrapperQtWidgetChoiceParameter.h\"\n#include \"otbWrapperQtWidgetParameterLabel.h\"\n#include \"otbWrapperQtWidgetParameterFactory.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nQtWidgetParameterGroup::QtWidgetParameterGroup(ParameterGroup::Pointer paramList, QtWidgetModel* m)\n: QtWidgetParameterBase(paramList, m),\n m_ParamList(paramList)\n{\n}\n\nQtWidgetParameterGroup::~QtWidgetParameterGroup()\n{\n}\n\nvoid QtWidgetParameterGroup::DoUpdateGUI()\n{\n WidgetListIteratorType it = m_WidgetList.begin();\n for (it = m_WidgetList.begin(); it != m_WidgetList.end(); ++it)\n {\n (*it)->UpdateGUI();\n }\n}\n\nvoid QtWidgetParameterGroup::DoCreateWidget()\n{\n \/\/ a GridLayout with two columns : parameter label \/ parameter widget\n QGridLayout *gridLayout = new QGridLayout;\n gridLayout->setSpacing(1);\n gridLayout->setContentsMargins(0, 0, 0, 0);\n\n unsigned int nbParams = m_ParamList->GetNumberOfParameters();\n for (unsigned int i = 0; i < nbParams; ++i)\n {\n Parameter* param = m_ParamList->GetParameterByIndex(i);\n\n if (param != 0)\n {\n ParameterGroup* paramAsGroup = dynamic_cast<ParameterGroup*>(param);\n ChoiceParameter* paramAsChoice = dynamic_cast<ChoiceParameter*>(param);\n\n if (paramAsGroup == 0 && paramAsChoice == 0)\n {\n \/\/ Label (col 1)\n QWidget* label = new QtWidgetParameterLabel( param );\n gridLayout->addWidget(label, i, 1);\n\n \/\/ Parameter Widget (col 2)\n QtWidgetParameterBase* specificWidget = QtWidgetParameterFactory::CreateQtWidget( param, GetModel() );\n gridLayout->addWidget(specificWidget, i, 2 );\n\n \/\/ CheckBox (col 0)\n QCheckBox * checkBox = new QCheckBox;\n connect( checkBox, SIGNAL(clicked(bool)), specificWidget, SLOT(SetActivationState(bool)));\n connect( checkBox, SIGNAL(clicked(bool)), GetModel(), SLOT(NotifyUpdate()) );\n connect( specificWidget, SIGNAL(ParameterActiveStatus(bool)), checkBox, SLOT(setChecked(bool)));\n connect( specificWidget, SIGNAL(ParameterActiveStatus(bool)), specificWidget, SLOT(SetActivationState(bool)));\n\n \/\/ if Mandatory make the checkbox checked and deactivated\n if (param->GetMandatory())\n {\n checkBox->setCheckState(Qt::Checked);\n checkBox->setEnabled(false);\n specificWidget->setEnabled(true);\n }\n else\n {\n checkBox->setCheckState(Qt::Unchecked);\n checkBox->setEnabled(true);\n specificWidget->setEnabled(false);\n }\n gridLayout->addWidget(checkBox, i, 0);\n\n \/\/ Reset Button\n \/\/ Make sense only for NumericalParameter\n if (dynamic_cast<IntParameter*>(param)\n || dynamic_cast<FloatParameter*>(param)\n || dynamic_cast<RadiusParameter*>(param)\n \/*|| dynamic_cast<RAMParameter*>(param)*\/)\n {\n if( param->GetRole() != Role_Output )\n {\n QPushButton* resetButton = new QPushButton;\n resetButton->setText(\"Reset\");\n resetButton->setToolTip(\"Reset the value of this parameter\");\n gridLayout->addWidget(resetButton, i, 3);\n \n \/\/ Slots to connect to the reset button\n connect( resetButton, SIGNAL(clicked()), specificWidget, SLOT(Reset()) );\n connect( resetButton, SIGNAL(clicked()), GetModel(), SLOT(NotifyUpdate()) );\n }\n }\n\n m_WidgetList.push_back(specificWidget);\n }\n else\n {\n QtWidgetParameterBase* specificWidget = QtWidgetParameterFactory::CreateQtWidget( param, GetModel() );\n\n QVBoxLayout* vboxLayout = new QVBoxLayout;\n vboxLayout->addWidget(specificWidget);\n QGroupBox* group = new QGroupBox;\n group->setLayout(vboxLayout);\n\n \/\/ Make the paramter Group checkable when it is not mandatory\n if (!param->GetMandatory() )\n {\n group->setCheckable(true);\n group->setChecked(false);\n\n \/\/ Update iteratively the children status\n for (unsigned int idx = 0; idx < param->GetChildrenList().size(); ++idx)\n {\n \/\/ deactivate the children tree\n this->ProcessChild(param->GetChildrenList()[idx], false);\n }\n }\n else\n {\n param->SetActive(true);\n }\n connect(group, SIGNAL(clicked(bool)), specificWidget, SLOT(SetActivationState(bool)));\n\n group->setTitle(param->GetName());\n gridLayout->addWidget(group, i, 0, 1, -1);\n\n m_WidgetList.push_back(specificWidget);\n }\n }\n }\n\n this->setLayout(gridLayout);\n}\n\n\n\/\/ Slot connected to the signal emitted the checkBox relative to\n\/\/ current widget\nvoid QtWidgetParameterGroup::SetActivationState( bool value )\n{\n \/\/ First call the superclass implementation\n this->QtWidgetParameterBase::SetActivationState(value);\n\n \/\/ Update the Group status\n this->setEnabled(value);\n\n \/\/ Update iteratively the children status\n for (unsigned int idx = 0; idx < m_ParamList->GetChildrenList().size(); ++idx)\n {\n this->ProcessChild(m_ParamList->GetChildrenList()[idx], value);\n }\n}\n\n\/\/ Activate iteratively the children\nvoid QtWidgetParameterGroup::ProcessChild(Parameter* currentNode, bool status)\n{\n \/\/ Activate the current node if it was checked\n if ( currentNode->IsChecked() && status)\n {\n currentNode->SetActive(status);\n }\n\n \/\/ If the status is false (deactivating) deactivate all the children\n \/\/ tree\n if (!status)\n {\n currentNode->SetActive(status);\n }\n\n unsigned int counter = 0;\n while(counter < currentNode->GetChildrenList().size())\n {\n this->ProcessChild(currentNode->GetChildrenList()[counter], status);\n ++counter;\n }\n}\n\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\t\n * Author: Nico Blodow (blodow@cs.tum.edu)\n *\/\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/kinect_grabber.h>\n#include <pcl\/io\/kinect_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/octree\/octree.h>\n#include <pcl\/filters\/extract_indices.h>\n\nclass KinectChangeViewer\n{\n public:\n KinectChangeViewer (double resolution) \n : viewer (\"PCL Kinect Viewer\")\n {\n octree = new pcl::octree::OctreePointCloudChangeDetector<pcl::PointXYZ>(resolution);\n }\n\n void cloud_cb_ (const pcl::PointCloud<pcl::PointXYZ>::ConstPtr &cloud)\n {\n pcl::PointCloud<pcl::PointXYZ> filtered_cloud;\n pcl::ExtractIndices<pcl::PointXYZ> ei;\n ei.setInputCloud (cloud);\n ei.filter (filtered_cloud);\n\/\/ \/\/ assign point cloud to octree\n\/\/ octree->setInputCloud (cloud);\n\/\/\n\/\/ \/\/ add points from cloud to octree\n\/\/ octree->addPointsFromInputCloud ();\n\/\/\n std::vector<int> newPointIdxVector;\n\/\/\n\/\/ \/\/ get a vector of new points, which did not exist in previous buffer\n\/\/ octree->getPointIndicesFromNewVoxels (newPointIdxVector);\n\/\/\n std::cerr << newPointIdxVector.size() << std::endl;\n if (!viewer.wasStopped())\n viewer.showCloud (filtered_cloud);\n\/\/ \/\/ switch buffers - reset tree\n\/\/ octree->switchBuffers ();\n\n }\n \n void run ()\n {\n pcl::Grabber* interface = new pcl::OpenNIGrabber();\n\n boost::function<void (const pcl::PointCloud<pcl::PointXYZ>::ConstPtr&)> f = \n boost::bind (&KinectChangeViewer::cloud_cb_, this, _1);\n\n boost::signals2::connection c = interface->registerCallback (f);\n \n interface->start ();\n \n while (!viewer.wasStopped())\n {\n sleep (1);\n }\n\n interface->stop ();\n }\n\n pcl::octree::OctreePointCloudChangeDetector<pcl::PointXYZ> *octree;\n pcl_visualization::CloudViewer viewer;\n};\n\nint main (int argc, char* argv[])\n{\n double resolution = 0.05;\n if (argc > 1)\n resolution = atof (argv[1]);\n\n KinectChangeViewer v (resolution);\n v.run ();\n return 0;\n}\n\n\n<commit_msg>thank you julius<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\t\n * Author: Nico Blodow (blodow@cs.tum.edu)\n *\/\n\n#include <pcl\/point_cloud.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/kinect_grabber.h>\n#include <pcl\/io\/kinect_grabber.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <pcl\/octree\/octree.h>\n#include <pcl\/filters\/extract_indices.h>\n\nclass KinectChangeViewer\n{\n public:\n KinectChangeViewer (double resolution) \n : viewer (\"PCL Kinect Viewer\")\n {\n octree = new pcl::octree::OctreePointCloudChangeDetector<pcl::PointXYZRGB>(resolution);\n }\n\n void cloud_cb_ (const pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr &cloud)\n {\n std::cerr << cloud->points.size() << \" -- \";\n \n\n \/\/ assign point cloud to octree\n octree->setInputCloud (cloud);\n\n \/\/ add points from cloud to octree\n octree->addPointsFromInputCloud ();\n\n std::cerr << octree->getLeafCount() << \" -- \";\n boost::shared_ptr<std::vector<int> > newPointIdxVector (new std::vector<int>);\n\n \/\/ get a vector of new points, which did not exist in previous buffer\n octree->getPointIndicesFromNewVoxels (*newPointIdxVector);\n\n std::cerr << newPointIdxVector->size() << std::endl;\n\n \/\/\/\/ extract points from pointcloud\n pcl::PointCloud<pcl::PointXYZRGB> filtered_cloud (*cloud);\n \/\/pcl::ExtractIndices<pcl::PointXYZRGB> ei;\n \/\/ei.setInputCloud (cloud);\n \/\/ei.setIndices (newPointIdxVector);\n \/\/ei.filter (filtered_cloud);\n\n for (std::vector<int>::iterator it = newPointIdxVector->begin(); it != newPointIdxVector->end(); it++)\n filtered_cloud.points[*it].rgb = 255<<16; \n \n if (!viewer.wasStopped())\n viewer.showCloud (filtered_cloud);\n \n \/\/ switch buffers - reset tree\n octree->switchBuffers ();\n }\n \n void run ()\n {\n pcl::Grabber* interface = new pcl::OpenNIGrabber();\n\n boost::function<void (const pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr&)> f = \n boost::bind (&KinectChangeViewer::cloud_cb_, this, _1);\n\n boost::signals2::connection c = interface->registerCallback (f);\n \n interface->start ();\n \n while (!viewer.wasStopped())\n {\n sleep (1);\n }\n\n interface->stop ();\n }\n\n pcl::octree::OctreePointCloudChangeDetector<pcl::PointXYZRGB> *octree;\n pcl_visualization::CloudViewer viewer;\n};\n\nint main (int argc, char* argv[])\n{\n double resolution = 0.05;\n if (argc > 1)\n resolution = atof (argv[1]);\n\n KinectChangeViewer v (resolution);\n v.run ();\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\/*=========================================================================\n *\n * Portions of this file are subject to the VTK Toolkit Version 3 copyright.\n *\n * Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n *\n * For complete copyright, license and disclaimer of warranty information\n * please refer to the NOTICE file at the top of the ITK source tree.\n *\n *=========================================================================*\/\n#include \"itkMultiThreader.h\"\n#include \"itkNumericTraits.h\"\n#include <iostream>\n#include \"vcl_algorithm.h\"\n\n#if defined(ITK_USE_PTHREADS)\n#include \"itkMultiThreaderPThreads.cxx\"\n#elif defined(ITK_USE_WIN32_THREADS)\n#include \"itkMultiThreaderWinThreads.cxx\"\n#else\n#include \"itkMultiThreaderNoThreads.cxx\"\n#endif\n\nnamespace itk\n{\n\n\/\/ GlobalDefaultUseThreadPoolIsInitialized is used only in this\n\/\/ file to ensure that the ITK_USE_THREADPOOL environmenal variable\n\/\/ is only used as a fall back option. If the SetGlobalDefaultUseThreadPool\n\/\/ API is ever used by the developer, the developers choice is\n\/\/ respected over the environmental variable.\nstatic bool GlobalDefaultUseThreadPoolIsInitialized=false;\nstatic SimpleFastMutexLock globalDefaultInitializerLock;\n\nbool MultiThreader::m_GlobalDefaultUseThreadPool = false;\n\nvoid MultiThreader::SetGlobalDefaultUseThreadPool( const bool GlobalDefaultUseThreadPool )\n {\n m_GlobalDefaultUseThreadPool = GlobalDefaultUseThreadPool;\n GlobalDefaultUseThreadPoolIsInitialized=true;\n }\n\nbool MultiThreader::GetGlobalDefaultUseThreadPool( )\n {\n if( ! GlobalDefaultUseThreadPoolIsInitialized )\n {\n \/\/\n \/\/ look for runtime request to use thread pool\n std::string use_threadpool;\n if( itksys::SystemTools::GetEnv(\"ITK_USE_THREADPOOL\",use_threadpool) )\n {\n MutexLockHolder< SimpleFastMutexLock > lock(globalDefaultInitializerLock);\n use_threadpool = itksys::SystemTools::UpperCase(use_threadpool);\n \/\/NOTE: GlobalDefaultUseThreadPoolIsInitialized=true after this call\n if(use_threadpool != \"NO\" && use_threadpool != \"OFF\" && use_threadpool != \"FALSE\")\n {\n MultiThreader::SetGlobalDefaultUseThreadPool( true );\n }\n else\n {\n MultiThreader::SetGlobalDefaultUseThreadPool( false );\n }\n }\n }\n return m_GlobalDefaultUseThreadPool;\n }\n\n\/\/ Initialize static member that controls global maximum number of threads.\nThreadIdType MultiThreader::m_GlobalMaximumNumberOfThreads = ITK_MAX_THREADS;\n\n\/\/ Initialize static member that controls global default number of threads : 0\n\/\/ => Not initialized.\nThreadIdType MultiThreader::m_GlobalDefaultNumberOfThreads = 0;\n\nvoid MultiThreader::SetGlobalMaximumNumberOfThreads(ThreadIdType val)\n{\n m_GlobalMaximumNumberOfThreads = val;\n\n \/\/ clamp between 1 and ITK_MAX_THREADS\n m_GlobalMaximumNumberOfThreads = vcl_min( m_GlobalMaximumNumberOfThreads,\n (ThreadIdType) ITK_MAX_THREADS );\n m_GlobalMaximumNumberOfThreads = vcl_max( m_GlobalMaximumNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n \/\/ If necessary reset the default to be used from now on.\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads);\n}\n\nThreadIdType MultiThreader::GetGlobalMaximumNumberOfThreads()\n{\n return m_GlobalMaximumNumberOfThreads;\n}\n\nvoid MultiThreader::SetGlobalDefaultNumberOfThreads(ThreadIdType val)\n{\n m_GlobalDefaultNumberOfThreads = val;\n\n \/\/ clamp between 1 and m_GlobalMaximumNumberOfThreads\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n m_GlobalDefaultNumberOfThreads = vcl_max( m_GlobalDefaultNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n}\n\nvoid MultiThreader::SetNumberOfThreads(ThreadIdType numberOfThreads)\n{\n if( m_NumberOfThreads == numberOfThreads &&\n numberOfThreads <= m_GlobalMaximumNumberOfThreads )\n {\n return;\n }\n\n m_NumberOfThreads = numberOfThreads;\n\n \/\/ clamp between 1 and m_GlobalMaximumNumberOfThreads\n m_NumberOfThreads = vcl_min( m_NumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n m_NumberOfThreads = vcl_max( m_NumberOfThreads, NumericTraits<ThreadIdType>::OneValue() );\n\n}\n\nThreadIdType MultiThreader::GetGlobalDefaultNumberOfThreads()\n{\n \/\/ if default number has been set then don't try to update it; just\n \/\/ return the value\n if( m_GlobalDefaultNumberOfThreads != 0 )\n {\n return m_GlobalDefaultNumberOfThreads;\n }\n\n \/* The ITK_NUMBER_OF_THREADS_ENV_LIST contains is an\n * environmental variable that holds a ':' separated\n * list of environmental variables that whould be\n * queried in order for setting the m_GlobalMaximumNumberOfThreads.\n *\n * This is intended to be a mechanism suitable to easy\n * runtime modification to ease using the proper number\n * of threads for load balancing batch processing\n * systems where the number of threads\n * authorized for use may be less than the number\n * of physical processors on the computer.\n *\n * This list contains the Sun|Oracle Grid Engine\n * environmental variable \"NSLOTS\" by default\n *\/\n std::vector<std::string> ITK_NUMBER_OF_THREADS_ENV_LIST;\n itksys_stl::string itkNumberOfThreadsEvnListString = \"\";\n if( itksys::SystemTools::GetEnv(\"ITK_NUMBER_OF_THREADS_ENV_LIST\",\n itkNumberOfThreadsEvnListString) )\n {\n \/\/ NOTE: We always put \"ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\" at the end\n \/\/ unconditionally.\n itkNumberOfThreadsEvnListString += \":ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n }\n else\n {\n itkNumberOfThreadsEvnListString = \"NSLOTS:ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n }\n {\n std::stringstream numberOfThreadsEnvListStream(itkNumberOfThreadsEvnListString);\n std::string item;\n while( std::getline(numberOfThreadsEnvListStream, item, ':') )\n {\n if( item.size() > 0 ) \/\/ Do not add empty items.\n {\n ITK_NUMBER_OF_THREADS_ENV_LIST.push_back(item);\n }\n }\n }\n \/\/ first, check for environment variable\n itksys_stl::string itkGlobalDefaultNumberOfThreadsEnv = \"0\";\n for( std::vector<std::string>::const_iterator lit = ITK_NUMBER_OF_THREADS_ENV_LIST.begin();\n lit != ITK_NUMBER_OF_THREADS_ENV_LIST.end();\n ++lit )\n {\n if( itksys::SystemTools::GetEnv(lit->c_str(), itkGlobalDefaultNumberOfThreadsEnv) )\n {\n m_GlobalDefaultNumberOfThreads =\n static_cast<ThreadIdType>( atoi( itkGlobalDefaultNumberOfThreadsEnv.c_str() ) );\n }\n }\n\n \/\/ otherwise, set number of threads based on system information\n if( m_GlobalDefaultNumberOfThreads <= 0 )\n {\n const ThreadIdType num = GetGlobalDefaultNumberOfThreadsByPlatform();\n m_GlobalDefaultNumberOfThreads = num;\n }\n\n \/\/ limit the number of threads to m_GlobalMaximumNumberOfThreads\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n\n \/\/ verify that the default number of threads is larger than zero\n m_GlobalDefaultNumberOfThreads = vcl_max( m_GlobalDefaultNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n return m_GlobalDefaultNumberOfThreads;\n}\n\n\/\/ Constructor. Default all the methods to NULL. Since the\n\/\/ ThreadInfoArray is static, the ThreadIDs can be initialized here\n\/\/ and will not change.\n\nMultiThreader::MultiThreader() : m_ThreadPool(ThreadPool::GetInstance() ), m_UseThreadPool(false)\n{\n for( ThreadIdType i = 0; i < ITK_MAX_THREADS; ++i )\n {\n m_ThreadInfoArray[i].ThreadID = i;\n m_ThreadInfoArray[i].ActiveFlag = ITK_NULLPTR;\n m_ThreadInfoArray[i].ActiveFlagLock = ITK_NULLPTR;\n\n m_MultipleMethod[i] = ITK_NULLPTR;\n m_MultipleData[i] = ITK_NULLPTR;\n\n m_SpawnedThreadActiveFlag[i] = 0;\n m_SpawnedThreadActiveFlagLock[i] = ITK_NULLPTR;\n m_SpawnedThreadInfoArray[i].ThreadID = i;\n }\n\n m_SingleMethod = ITK_NULLPTR;\n m_SingleData = ITK_NULLPTR;\n m_NumberOfThreads = this->GetGlobalDefaultNumberOfThreads();\n\n this->SetUseThreadPool( MultiThreader::GetGlobalDefaultUseThreadPool() );\n}\n\nMultiThreader::~MultiThreader()\n{\n}\n\n\/\/ Set the user defined method that will be run on NumberOfThreads threads\n\/\/ when SingleMethodExecute is called.\nvoid MultiThreader::SetSingleMethod(ThreadFunctionType f, void *data)\n{\n m_SingleMethod = f;\n m_SingleData = data;\n}\n\n\/\/ Set one of the user defined methods that will be run on NumberOfThreads\n\/\/ threads when MultipleMethodExecute is called. This method should be\n\/\/ called with index = 0, 1, .., NumberOfThreads-1 to set up all the\n\/\/ required user defined methods\nvoid MultiThreader::SetMultipleMethod(ThreadIdType index, ThreadFunctionType f, void *data)\n{\n \/\/ You can only set the method for 0 through NumberOfThreads-1\n if( index >= m_NumberOfThreads )\n {\n itkExceptionMacro(<< \"Can't set method \" << index << \" with a thread count of \" << m_NumberOfThreads);\n }\n else\n {\n m_MultipleMethod[index] = f;\n m_MultipleData[index] = data;\n }\n}\n\n\/\/ Execute the method set as the SingleMethod on NumberOfThreads threads.\nvoid MultiThreader::SingleMethodExecute()\n{\n ThreadIdType thread_loop = 0;\n ThreadProcessIdType process_id[ITK_MAX_THREADS];\n\n if( !m_SingleMethod )\n {\n itkExceptionMacro(<< \"No single method set!\");\n }\n\n \/\/ obey the global maximum number of threads limit\n m_NumberOfThreads = vcl_min( m_GlobalMaximumNumberOfThreads, m_NumberOfThreads );\n\n \/\/ Spawn a set of threads through the SingleMethodProxy. Exceptions\n \/\/ thrown from a thread will be caught by the SingleMethodProxy. A\n \/\/ naive mechanism is in place for determining whether a thread\n \/\/ threw an exception.\n \/\/\n \/\/ Thanks to Hannu Helminen for suggestions on how to catch\n \/\/ exceptions thrown by threads.\n bool exceptionOccurred = false;\n std::string exceptionDetails;\n try\n {\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n m_ThreadInfoArray[thread_loop].UserData = m_SingleData;\n m_ThreadInfoArray[thread_loop].NumberOfThreads = m_NumberOfThreads;\n m_ThreadInfoArray[thread_loop].ThreadFunction = m_SingleMethod;\n\n process_id[thread_loop] =\n this->DispatchSingleMethodThread(&m_ThreadInfoArray[thread_loop]);\n }\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n \/\/ If creation of any thread failed, we must make sure that all\n \/\/ threads are correctly cleaned\n exceptionOccurred = true;\n }\n catch( ... )\n {\n \/\/ If creation of any thread failed, we must make sure that all\n \/\/ threads are correctly cleaned\n exceptionOccurred = true;\n }\n\n \/\/ Now, the parent thread calls this->SingleMethod() itself\n \/\/\n \/\/\n try\n {\n m_ThreadInfoArray[0].UserData = m_SingleData;\n m_ThreadInfoArray[0].NumberOfThreads = m_NumberOfThreads;\n m_SingleMethod( (void *)( &m_ThreadInfoArray[0] ) );\n }\n catch( ProcessAborted & )\n {\n \/\/ Need cleanup and rethrow ProcessAborted\n \/\/ close down other threads\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n try\n {\n this->WaitForSingleMethodThread(process_id[thread_loop]);\n }\n catch( ... )\n {\n }\n }\n \/\/ rethrow\n throw;\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n \/\/ if this method fails, we must make sure all threads are\n \/\/ correctly cleaned\n exceptionOccurred = true;\n }\n catch( ... )\n {\n \/\/ if this method fails, we must make sure all threads are\n \/\/ correctly cleaned\n exceptionOccurred = true;\n }\n \/\/ The parent thread has finished this->SingleMethod() - so now it\n \/\/ waits for each of the other processes to exit\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n try\n {\n this->WaitForSingleMethodThread(process_id[thread_loop]);\n if( m_ThreadInfoArray[thread_loop].ThreadExitCode\n != ThreadInfoStruct::SUCCESS )\n {\n exceptionOccurred = true;\n }\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n exceptionOccurred = true;\n }\n catch( ... )\n {\n exceptionOccurred = true;\n }\n }\n\n if( exceptionOccurred )\n {\n if( exceptionDetails.empty() )\n {\n itkExceptionMacro(\"Exception occurred during SingleMethodExecute\");\n }\n else\n {\n itkExceptionMacro(<< \"Exception occurred during SingleMethodExecute\" << std::endl << exceptionDetails);\n }\n }\n}\n\nITK_THREAD_RETURN_TYPE\nMultiThreader\n::SingleMethodProxy(void *arg)\n{\n \/\/ grab the ThreadInfoStruct originally prescribed\n MultiThreader::ThreadInfoStruct\n * threadInfoStruct =\n reinterpret_cast<MultiThreader::ThreadInfoStruct *>( arg );\n\n \/\/ execute the user specified threader callback, catching any exceptions\n try\n {\n ( *threadInfoStruct->ThreadFunction )(threadInfoStruct);\n threadInfoStruct->ThreadExitCode = MultiThreader::ThreadInfoStruct::SUCCESS;\n }\n catch( ProcessAborted & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::ITK_PROCESS_ABORTED_EXCEPTION;\n }\n catch( ExceptionObject & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::ITK_EXCEPTION;\n }\n catch( std::exception & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::STD_EXCEPTION;\n }\n catch( ... )\n {\n threadInfoStruct->ThreadExitCode = MultiThreader::ThreadInfoStruct::UNKNOWN;\n }\n\n return ITK_THREAD_RETURN_VALUE;\n}\n\nThreadProcessIdType\nMultiThreader\n::DispatchSingleMethodThread(ThreadInfoStruct *info)\n{\n if(this->m_UseThreadPool)\n {\n return this->ThreadPoolDispatchSingleMethodThread(info);\n }\n return this->SpawnDispatchSingleMethodThread(info);\n}\n\nvoid\nMultiThreader\n::WaitForSingleMethodThread(ThreadProcessIdType threadHandle)\n{\n if(this->m_UseThreadPool)\n {\n this->ThreadPoolWaitForSingleMethodThread(threadHandle);\n }\n else\n {\n this->SpawnWaitForSingleMethodThread(threadHandle);\n }\n}\n\n\/\/ Print method for the multithreader\nvoid MultiThreader::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Thread Count: \" << m_NumberOfThreads << \"\\n\";\n os << indent << \"Global Maximum Number Of Threads: \"\n << m_GlobalMaximumNumberOfThreads << std::endl;\n os << indent << \"Global Default Number Of Threads: \"\n << m_GlobalDefaultNumberOfThreads << std::endl;\n}\n\n}\n<commit_msg>BUG: Fix obscure race condition on access thread pool initialization<commit_after>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n\/*=========================================================================\n *\n * Portions of this file are subject to the VTK Toolkit Version 3 copyright.\n *\n * Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n *\n * For complete copyright, license and disclaimer of warranty information\n * please refer to the NOTICE file at the top of the ITK source tree.\n *\n *=========================================================================*\/\n#include \"itkMultiThreader.h\"\n#include \"itkNumericTraits.h\"\n#include <iostream>\n#include \"vcl_algorithm.h\"\n\n#if defined(ITK_USE_PTHREADS)\n#include \"itkMultiThreaderPThreads.cxx\"\n#elif defined(ITK_USE_WIN32_THREADS)\n#include \"itkMultiThreaderWinThreads.cxx\"\n#else\n#include \"itkMultiThreaderNoThreads.cxx\"\n#endif\n\nnamespace itk\n{\n\n\/\/ GlobalDefaultUseThreadPoolIsInitialized is used only in this\n\/\/ file to ensure that the ITK_USE_THREADPOOL environmenal variable\n\/\/ is only used as a fall back option. If the SetGlobalDefaultUseThreadPool\n\/\/ API is ever used by the developer, the developers choice is\n\/\/ respected over the environmental variable.\nstatic bool GlobalDefaultUseThreadPoolIsInitialized=false;\nstatic SimpleFastMutexLock globalDefaultInitializerLock;\n\nbool MultiThreader::m_GlobalDefaultUseThreadPool = false;\n\nvoid MultiThreader::SetGlobalDefaultUseThreadPool( const bool GlobalDefaultUseThreadPool )\n {\n m_GlobalDefaultUseThreadPool = GlobalDefaultUseThreadPool;\n GlobalDefaultUseThreadPoolIsInitialized=true;\n }\n\nbool MultiThreader::GetGlobalDefaultUseThreadPool( )\n {\n \/\/ This method must be concurrent thread safe\n\n if( !GlobalDefaultUseThreadPoolIsInitialized )\n {\n\n MutexLockHolder< SimpleFastMutexLock > lock(globalDefaultInitializerLock);\n\n \/\/ After we have the lock, double check the initialization\n \/\/ flag to ensure it hasn't been changed by another thread.\n\n if (!GlobalDefaultUseThreadPoolIsInitialized )\n {\n \/\/ look for runtime request to use thread pool\n std::string use_threadpool;\n\n if( itksys::SystemTools::GetEnv(\"ITK_USE_THREADPOOL\",use_threadpool) )\n {\n\n use_threadpool = itksys::SystemTools::UpperCase(use_threadpool);\n\n \/\/ NOTE: GlobalDefaultUseThreadPoolIsInitialized=true after this call\n if(use_threadpool != \"NO\" && use_threadpool != \"OFF\" && use_threadpool != \"FALSE\")\n {\n MultiThreader::SetGlobalDefaultUseThreadPool( true );\n }\n else\n {\n MultiThreader::SetGlobalDefaultUseThreadPool( false );\n }\n }\n\n \/\/ always set that we are initialized\n GlobalDefaultUseThreadPoolIsInitialized=true;\n }\n }\n return m_GlobalDefaultUseThreadPool;\n }\n\n\/\/ Initialize static member that controls global maximum number of threads.\nThreadIdType MultiThreader::m_GlobalMaximumNumberOfThreads = ITK_MAX_THREADS;\n\n\/\/ Initialize static member that controls global default number of threads : 0\n\/\/ => Not initialized.\nThreadIdType MultiThreader::m_GlobalDefaultNumberOfThreads = 0;\n\nvoid MultiThreader::SetGlobalMaximumNumberOfThreads(ThreadIdType val)\n{\n m_GlobalMaximumNumberOfThreads = val;\n\n \/\/ clamp between 1 and ITK_MAX_THREADS\n m_GlobalMaximumNumberOfThreads = vcl_min( m_GlobalMaximumNumberOfThreads,\n (ThreadIdType) ITK_MAX_THREADS );\n m_GlobalMaximumNumberOfThreads = vcl_max( m_GlobalMaximumNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n \/\/ If necessary reset the default to be used from now on.\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads);\n}\n\nThreadIdType MultiThreader::GetGlobalMaximumNumberOfThreads()\n{\n return m_GlobalMaximumNumberOfThreads;\n}\n\nvoid MultiThreader::SetGlobalDefaultNumberOfThreads(ThreadIdType val)\n{\n m_GlobalDefaultNumberOfThreads = val;\n\n \/\/ clamp between 1 and m_GlobalMaximumNumberOfThreads\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n m_GlobalDefaultNumberOfThreads = vcl_max( m_GlobalDefaultNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n}\n\nvoid MultiThreader::SetNumberOfThreads(ThreadIdType numberOfThreads)\n{\n if( m_NumberOfThreads == numberOfThreads &&\n numberOfThreads <= m_GlobalMaximumNumberOfThreads )\n {\n return;\n }\n\n m_NumberOfThreads = numberOfThreads;\n\n \/\/ clamp between 1 and m_GlobalMaximumNumberOfThreads\n m_NumberOfThreads = vcl_min( m_NumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n m_NumberOfThreads = vcl_max( m_NumberOfThreads, NumericTraits<ThreadIdType>::OneValue() );\n\n}\n\nThreadIdType MultiThreader::GetGlobalDefaultNumberOfThreads()\n{\n \/\/ if default number has been set then don't try to update it; just\n \/\/ return the value\n if( m_GlobalDefaultNumberOfThreads != 0 )\n {\n return m_GlobalDefaultNumberOfThreads;\n }\n\n \/* The ITK_NUMBER_OF_THREADS_ENV_LIST contains is an\n * environmental variable that holds a ':' separated\n * list of environmental variables that whould be\n * queried in order for setting the m_GlobalMaximumNumberOfThreads.\n *\n * This is intended to be a mechanism suitable to easy\n * runtime modification to ease using the proper number\n * of threads for load balancing batch processing\n * systems where the number of threads\n * authorized for use may be less than the number\n * of physical processors on the computer.\n *\n * This list contains the Sun|Oracle Grid Engine\n * environmental variable \"NSLOTS\" by default\n *\/\n std::vector<std::string> ITK_NUMBER_OF_THREADS_ENV_LIST;\n itksys_stl::string itkNumberOfThreadsEvnListString = \"\";\n if( itksys::SystemTools::GetEnv(\"ITK_NUMBER_OF_THREADS_ENV_LIST\",\n itkNumberOfThreadsEvnListString) )\n {\n \/\/ NOTE: We always put \"ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\" at the end\n \/\/ unconditionally.\n itkNumberOfThreadsEvnListString += \":ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n }\n else\n {\n itkNumberOfThreadsEvnListString = \"NSLOTS:ITK_GLOBAL_DEFAULT_NUMBER_OF_THREADS\";\n }\n {\n std::stringstream numberOfThreadsEnvListStream(itkNumberOfThreadsEvnListString);\n std::string item;\n while( std::getline(numberOfThreadsEnvListStream, item, ':') )\n {\n if( item.size() > 0 ) \/\/ Do not add empty items.\n {\n ITK_NUMBER_OF_THREADS_ENV_LIST.push_back(item);\n }\n }\n }\n \/\/ first, check for environment variable\n itksys_stl::string itkGlobalDefaultNumberOfThreadsEnv = \"0\";\n for( std::vector<std::string>::const_iterator lit = ITK_NUMBER_OF_THREADS_ENV_LIST.begin();\n lit != ITK_NUMBER_OF_THREADS_ENV_LIST.end();\n ++lit )\n {\n if( itksys::SystemTools::GetEnv(lit->c_str(), itkGlobalDefaultNumberOfThreadsEnv) )\n {\n m_GlobalDefaultNumberOfThreads =\n static_cast<ThreadIdType>( atoi( itkGlobalDefaultNumberOfThreadsEnv.c_str() ) );\n }\n }\n\n \/\/ otherwise, set number of threads based on system information\n if( m_GlobalDefaultNumberOfThreads <= 0 )\n {\n const ThreadIdType num = GetGlobalDefaultNumberOfThreadsByPlatform();\n m_GlobalDefaultNumberOfThreads = num;\n }\n\n \/\/ limit the number of threads to m_GlobalMaximumNumberOfThreads\n m_GlobalDefaultNumberOfThreads = vcl_min( m_GlobalDefaultNumberOfThreads,\n m_GlobalMaximumNumberOfThreads );\n\n \/\/ verify that the default number of threads is larger than zero\n m_GlobalDefaultNumberOfThreads = vcl_max( m_GlobalDefaultNumberOfThreads,\n NumericTraits<ThreadIdType>::OneValue() );\n\n return m_GlobalDefaultNumberOfThreads;\n}\n\n\/\/ Constructor. Default all the methods to NULL. Since the\n\/\/ ThreadInfoArray is static, the ThreadIDs can be initialized here\n\/\/ and will not change.\n\nMultiThreader::MultiThreader() :\n m_ThreadPool(ThreadPool::GetInstance() ),\n m_UseThreadPool( MultiThreader::GetGlobalDefaultUseThreadPool() )\n{\n for( ThreadIdType i = 0; i < ITK_MAX_THREADS; ++i )\n {\n m_ThreadInfoArray[i].ThreadID = i;\n m_ThreadInfoArray[i].ActiveFlag = ITK_NULLPTR;\n m_ThreadInfoArray[i].ActiveFlagLock = ITK_NULLPTR;\n\n m_MultipleMethod[i] = ITK_NULLPTR;\n m_MultipleData[i] = ITK_NULLPTR;\n\n m_SpawnedThreadActiveFlag[i] = 0;\n m_SpawnedThreadActiveFlagLock[i] = ITK_NULLPTR;\n m_SpawnedThreadInfoArray[i].ThreadID = i;\n }\n\n m_SingleMethod = ITK_NULLPTR;\n m_SingleData = ITK_NULLPTR;\n m_NumberOfThreads = this->GetGlobalDefaultNumberOfThreads();\n\n}\n\nMultiThreader::~MultiThreader()\n{\n}\n\n\/\/ Set the user defined method that will be run on NumberOfThreads threads\n\/\/ when SingleMethodExecute is called.\nvoid MultiThreader::SetSingleMethod(ThreadFunctionType f, void *data)\n{\n m_SingleMethod = f;\n m_SingleData = data;\n}\n\n\/\/ Set one of the user defined methods that will be run on NumberOfThreads\n\/\/ threads when MultipleMethodExecute is called. This method should be\n\/\/ called with index = 0, 1, .., NumberOfThreads-1 to set up all the\n\/\/ required user defined methods\nvoid MultiThreader::SetMultipleMethod(ThreadIdType index, ThreadFunctionType f, void *data)\n{\n \/\/ You can only set the method for 0 through NumberOfThreads-1\n if( index >= m_NumberOfThreads )\n {\n itkExceptionMacro(<< \"Can't set method \" << index << \" with a thread count of \" << m_NumberOfThreads);\n }\n else\n {\n m_MultipleMethod[index] = f;\n m_MultipleData[index] = data;\n }\n}\n\n\/\/ Execute the method set as the SingleMethod on NumberOfThreads threads.\nvoid MultiThreader::SingleMethodExecute()\n{\n ThreadIdType thread_loop = 0;\n ThreadProcessIdType process_id[ITK_MAX_THREADS];\n\n if( !m_SingleMethod )\n {\n itkExceptionMacro(<< \"No single method set!\");\n }\n\n \/\/ obey the global maximum number of threads limit\n m_NumberOfThreads = vcl_min( m_GlobalMaximumNumberOfThreads, m_NumberOfThreads );\n\n \/\/ Spawn a set of threads through the SingleMethodProxy. Exceptions\n \/\/ thrown from a thread will be caught by the SingleMethodProxy. A\n \/\/ naive mechanism is in place for determining whether a thread\n \/\/ threw an exception.\n \/\/\n \/\/ Thanks to Hannu Helminen for suggestions on how to catch\n \/\/ exceptions thrown by threads.\n bool exceptionOccurred = false;\n std::string exceptionDetails;\n try\n {\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n m_ThreadInfoArray[thread_loop].UserData = m_SingleData;\n m_ThreadInfoArray[thread_loop].NumberOfThreads = m_NumberOfThreads;\n m_ThreadInfoArray[thread_loop].ThreadFunction = m_SingleMethod;\n\n process_id[thread_loop] =\n this->DispatchSingleMethodThread(&m_ThreadInfoArray[thread_loop]);\n }\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n \/\/ If creation of any thread failed, we must make sure that all\n \/\/ threads are correctly cleaned\n exceptionOccurred = true;\n }\n catch( ... )\n {\n \/\/ If creation of any thread failed, we must make sure that all\n \/\/ threads are correctly cleaned\n exceptionOccurred = true;\n }\n\n \/\/ Now, the parent thread calls this->SingleMethod() itself\n \/\/\n \/\/\n try\n {\n m_ThreadInfoArray[0].UserData = m_SingleData;\n m_ThreadInfoArray[0].NumberOfThreads = m_NumberOfThreads;\n m_SingleMethod( (void *)( &m_ThreadInfoArray[0] ) );\n }\n catch( ProcessAborted & )\n {\n \/\/ Need cleanup and rethrow ProcessAborted\n \/\/ close down other threads\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n try\n {\n this->WaitForSingleMethodThread(process_id[thread_loop]);\n }\n catch( ... )\n {\n }\n }\n \/\/ rethrow\n throw;\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n \/\/ if this method fails, we must make sure all threads are\n \/\/ correctly cleaned\n exceptionOccurred = true;\n }\n catch( ... )\n {\n \/\/ if this method fails, we must make sure all threads are\n \/\/ correctly cleaned\n exceptionOccurred = true;\n }\n \/\/ The parent thread has finished this->SingleMethod() - so now it\n \/\/ waits for each of the other processes to exit\n for( thread_loop = 1; thread_loop < m_NumberOfThreads; ++thread_loop )\n {\n try\n {\n this->WaitForSingleMethodThread(process_id[thread_loop]);\n if( m_ThreadInfoArray[thread_loop].ThreadExitCode\n != ThreadInfoStruct::SUCCESS )\n {\n exceptionOccurred = true;\n }\n }\n catch( std::exception & e )\n {\n \/\/ get the details of the exception to rethrow them\n exceptionDetails = e.what();\n exceptionOccurred = true;\n }\n catch( ... )\n {\n exceptionOccurred = true;\n }\n }\n\n if( exceptionOccurred )\n {\n if( exceptionDetails.empty() )\n {\n itkExceptionMacro(\"Exception occurred during SingleMethodExecute\");\n }\n else\n {\n itkExceptionMacro(<< \"Exception occurred during SingleMethodExecute\" << std::endl << exceptionDetails);\n }\n }\n}\n\nITK_THREAD_RETURN_TYPE\nMultiThreader\n::SingleMethodProxy(void *arg)\n{\n \/\/ grab the ThreadInfoStruct originally prescribed\n MultiThreader::ThreadInfoStruct\n * threadInfoStruct =\n reinterpret_cast<MultiThreader::ThreadInfoStruct *>( arg );\n\n \/\/ execute the user specified threader callback, catching any exceptions\n try\n {\n ( *threadInfoStruct->ThreadFunction )(threadInfoStruct);\n threadInfoStruct->ThreadExitCode = MultiThreader::ThreadInfoStruct::SUCCESS;\n }\n catch( ProcessAborted & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::ITK_PROCESS_ABORTED_EXCEPTION;\n }\n catch( ExceptionObject & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::ITK_EXCEPTION;\n }\n catch( std::exception & )\n {\n threadInfoStruct->ThreadExitCode =\n MultiThreader::ThreadInfoStruct::STD_EXCEPTION;\n }\n catch( ... )\n {\n threadInfoStruct->ThreadExitCode = MultiThreader::ThreadInfoStruct::UNKNOWN;\n }\n\n return ITK_THREAD_RETURN_VALUE;\n}\n\nThreadProcessIdType\nMultiThreader\n::DispatchSingleMethodThread(ThreadInfoStruct *info)\n{\n if(this->m_UseThreadPool)\n {\n return this->ThreadPoolDispatchSingleMethodThread(info);\n }\n return this->SpawnDispatchSingleMethodThread(info);\n}\n\nvoid\nMultiThreader\n::WaitForSingleMethodThread(ThreadProcessIdType threadHandle)\n{\n if(this->m_UseThreadPool)\n {\n this->ThreadPoolWaitForSingleMethodThread(threadHandle);\n }\n else\n {\n this->SpawnWaitForSingleMethodThread(threadHandle);\n }\n}\n\n\/\/ Print method for the multithreader\nvoid MultiThreader::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n\n os << indent << \"Thread Count: \" << m_NumberOfThreads << \"\\n\";\n os << indent << \"Global Maximum Number Of Threads: \"\n << m_GlobalMaximumNumberOfThreads << std::endl;\n os << indent << \"Global Default Number Of Threads: \"\n << m_GlobalDefaultNumberOfThreads << std::endl;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Internal\/CharacterControlManagerImpl.hpp>\n#include <Internal\/PhysicsModuleImplementation.hpp>\nnamespace DoremiEngine\n{\n namespace Physics\n {\n CharacterControlManagerImpl::CharacterControlManagerImpl(InternalPhysicsUtils& p_utils) : m_utils(p_utils)\n {\n m_manager = PxCreateControllerManager(*m_utils.m_worldScene);\n }\n CharacterControlManagerImpl::~CharacterControlManagerImpl() {}\n\n int CharacterControlManagerImpl::AddController(int p_id, int p_matID, XMFLOAT3 p_position, XMFLOAT2 p_dimensions)\n {\n \/\/ Set start attributes of the controller\n PxCapsuleControllerDesc desc;\n desc.setToDefault();\n desc.position = PxExtendedVec3(p_position.x, p_position.y, p_position.z);\n desc.height = p_dimensions.x;\n desc.radius = p_dimensions.y;\n desc.material = m_utils.m_physicsMaterialManager->GetMaterial(p_matID); \/\/ DANGER! Assumes it already has material\n desc.stepOffset = 0.1;\n desc.reportCallback = m_controllerCallback;\n\n \/\/ Hard coded up vector\n desc.upDirection = PxVec3(0, 1, 0);\n\n bool derp = desc.isValid();\n\n m_controllers[p_id] = m_manager->createController(desc);\n m_IDsByControllers[m_controllers[p_id]] = p_id;\n\n SetCallback(p_id, (1 << 0), (1 << 0));\n\n \/\/ Redundant return?\n return p_id;\n }\n\n int CharacterControlManagerImpl::MoveController(int p_id, XMFLOAT3 p_discplacement, float p_dt)\n {\n \/*\n Some variable that apperas to define when the controller stops moving\n Tweak as necessary. Possibly could be moved to some other place.*\/\n float m_minDistTraveled = 0;\n \/\/ EMPTY FILTERS!\n PxControllerFilters filters;\n m_controllers[p_id]->move(PxVec3(p_discplacement.x, p_discplacement.y, p_discplacement.z), 0, p_dt, filters);\n \/\/ Redundant return?\n return p_id;\n }\n\n XMFLOAT3 CharacterControlManagerImpl::GetPosition(int p_id)\n {\n PxExtendedVec3 p = m_controllers[p_id]->getPosition();\n return XMFLOAT3(p.x, p.y, p.z);\n }\n\n XMFLOAT4 CharacterControlManagerImpl::GetOrientation(int p_id)\n {\n PxQuat q = m_controllers[p_id]->getActor()->getGlobalPose().q;\n return XMFLOAT4(q.x, q.y, q.z, q.w);\n }\n\n void CharacterControlManagerImpl::SetCallback(int p_bodyID, int p_filterGroup, int p_filterMask)\n {\n PxFilterData filterData;\n filterData.word0 = p_filterGroup; \/\/ Own ID\n filterData.word1 = p_filterMask; \/\/ ID mask to filter pairs that trigger contact callback\n PxRigidActor* actor = m_controllers[p_bodyID]->getActor();\n int numShapes = actor->getNbShapes();\n \/\/ Magic allocation of memory (i think)\n PxShape** shapes = (PxShape**)m_utils.m_allocator.allocate(sizeof(PxShape*) * numShapes, 0, __FILE__, __LINE__);\n actor->getShapes(shapes, numShapes);\n for(size_t i = 0; i < numShapes; i++)\n {\n PxShape* shape = shapes[i];\n shape->setSimulationFilterData(filterData);\n }\n if(shapes)\n {\n m_utils.m_allocator.deallocate(shapes);\n shapes = NULL;\n }\n }\n\n void CharacterControlManagerImpl::SetCallbackClass(PxUserControllerHitReport* p_callback) { m_controllerCallback = p_callback; }\n\n unordered_map<PxController*, int> CharacterControlManagerImpl::GetIdsByControllers() { return m_IDsByControllers; }\n }\n}<commit_msg>PhysicsModule: increased security of char control mngr<commit_after>#include <Internal\/CharacterControlManagerImpl.hpp>\n#include <Internal\/PhysicsModuleImplementation.hpp>\nnamespace DoremiEngine\n{\n namespace Physics\n {\n CharacterControlManagerImpl::CharacterControlManagerImpl(InternalPhysicsUtils& p_utils) : m_utils(p_utils)\n {\n m_manager = PxCreateControllerManager(*m_utils.m_worldScene);\n }\n CharacterControlManagerImpl::~CharacterControlManagerImpl() {}\n\n int CharacterControlManagerImpl::AddController(int p_id, int p_matID, XMFLOAT3 p_position, XMFLOAT2 p_dimensions)\n {\n \/\/ Set start attributes of the controller\n PxCapsuleControllerDesc desc;\n desc.setToDefault();\n desc.position = PxExtendedVec3(p_position.x, p_position.y, p_position.z);\n desc.height = p_dimensions.x;\n desc.radius = p_dimensions.y;\n desc.material = m_utils.m_physicsMaterialManager->GetMaterial(p_matID); \/\/ DANGER! Assumes it already has material\n if(desc.material == NULL)\n {\n throw std::runtime_error(\"No physics material exists with that ID\");\n }\n desc.stepOffset = 0.1;\n desc.reportCallback = m_controllerCallback;\n\n \/\/ Hard coded up vector\n desc.upDirection = PxVec3(0, 1, 0);\n\n m_controllers[p_id] = m_manager->createController(desc);\n m_IDsByControllers[m_controllers[p_id]] = p_id;\n\n SetCallback(p_id, (1 << 0), (1 << 0));\n\n \/\/ Redundant return?\n return p_id;\n }\n\n int CharacterControlManagerImpl::MoveController(int p_id, XMFLOAT3 p_discplacement, float p_dt)\n {\n \/*\n Some variable that apperas to define when the controller stops moving\n Tweak as necessary. Possibly could be moved to some other place.*\/\n float m_minDistTraveled = 0;\n \/\/ EMPTY FILTERS!\n PxControllerFilters filters;\n \/\/ Check if controller exists\n if(m_controllers.find(p_id) == m_controllers.end())\n {\n \/\/ Controller did not exist\n throw std::runtime_error(\"No controller exists with id: \" + p_id);\n }\n m_controllers[p_id]->move(PxVec3(p_discplacement.x, p_discplacement.y, p_discplacement.z), 0, p_dt, filters);\n \/\/ Redundant return?\n return p_id;\n }\n\n XMFLOAT3 CharacterControlManagerImpl::GetPosition(int p_id)\n {\n \/\/ Check if controller exists\n if(m_controllers.find(p_id) == m_controllers.end())\n {\n \/\/ Controller did not exist\n throw std::runtime_error(\"No controller exists with id: \" + p_id);\n }\n PxExtendedVec3 p = m_controllers[p_id]->getPosition();\n return XMFLOAT3(p.x, p.y, p.z);\n }\n\n XMFLOAT4 CharacterControlManagerImpl::GetOrientation(int p_id)\n {\n \/\/ Check if controller exists\n if(m_controllers.find(p_id) == m_controllers.end())\n {\n \/\/ Controller did not exist\n throw std::runtime_error(\"No controller exists with id: \" + p_id);\n }\n PxQuat q = m_controllers[p_id]->getActor()->getGlobalPose().q;\n return XMFLOAT4(q.x, q.y, q.z, q.w);\n }\n\n void CharacterControlManagerImpl::SetCallback(int p_bodyID, int p_filterGroup, int p_filterMask)\n {\n \/\/ Check if controller exists\n if(m_controllers.find(p_bodyID) == m_controllers.end())\n {\n \/\/ Controller did not exist\n throw std::runtime_error(\"No controller exists with id: \" + p_bodyID);\n }\n PxFilterData filterData;\n filterData.word0 = p_filterGroup; \/\/ Own ID\n filterData.word1 = p_filterMask; \/\/ ID mask to filter pairs that trigger contact callback\n PxRigidActor* actor = m_controllers[p_bodyID]->getActor();\n int numShapes = actor->getNbShapes();\n \/\/ Magic allocation of memory (i think)\n PxShape** shapes = (PxShape**)m_utils.m_allocator.allocate(sizeof(PxShape*) * numShapes, 0, __FILE__, __LINE__);\n actor->getShapes(shapes, numShapes);\n for(size_t i = 0; i < numShapes; i++)\n {\n PxShape* shape = shapes[i];\n shape->setSimulationFilterData(filterData);\n }\n if(shapes)\n {\n m_utils.m_allocator.deallocate(shapes);\n shapes = NULL;\n }\n }\n\n void CharacterControlManagerImpl::SetCallbackClass(PxUserControllerHitReport* p_callback) { m_controllerCallback = p_callback; }\n\n unordered_map<PxController*, int> CharacterControlManagerImpl::GetIdsByControllers() { return m_IDsByControllers; }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2008 Scientific Computing and Imaging Institute,\n University of Utah.\n\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n\/**\n \\file MultiplexOut.cpp\n \\author Jens Krueger\n SCI Institute\n University of Utah\n \\date September 2008\n*\/\n\n#include \"MultiplexOut.h\"\n\n#ifdef WIN32\n #include <windows.h>\n \/\/ undef stupid windows defines to max and min\n #ifdef max\n #undef max\n #endif\n\n #ifdef min\n #undef min\n #endif\n#endif\n\n#include <stdarg.h>\n#include <algorithm>\n\n#include <fstream>\nusing namespace std;\n\nMultiplexOut::~MultiplexOut() {\n for (size_t i = 0;i<m_vpDebugger.size();i++) {\n m_vpDebugger[i]->Message(_func_, \"(MultiplexOut::~MultiplexOut): Shutting down\");\n delete m_vpDebugger[i];\n }\n}\n\nvoid MultiplexOut::AddDebugOut(AbstrDebugOut* pDebugger) {\n m_vpDebugger.push_back(pDebugger);\n pDebugger->Message(_func_,\"Operating as part of a multiplexed debug out now.\");\n}\n\nvoid MultiplexOut::RemoveDebugOut(AbstrDebugOut* pDebugger) {\n std::vector<AbstrDebugOut*>::iterator del;\n\n del = std::find(m_vpDebugger.begin(), m_vpDebugger.end(), pDebugger);\n\n if(del != m_vpDebugger.end()) {\n delete *del;\n m_vpDebugger.erase(del);\n }\n}\n\n\nvoid MultiplexOut::printf(const char* format, ...) const\n{\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->printf(buff);\n}\n\nvoid MultiplexOut::Message(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Message(source,buff);\n}\n\nvoid MultiplexOut::Warning(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Warning(source,buff);\n}\n\nvoid MultiplexOut::Error(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Error(source,buff);\n}\n\nvoid MultiplexOut::SetShowMessages(bool bShowMessages) {\n AbstrDebugOut::SetShowMessages(bShowMessages);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowMessages(bShowMessages);\n}\n\nvoid MultiplexOut::SetShowWarnings(bool bShowWarnings) {\n AbstrDebugOut::SetShowWarnings(bShowWarnings);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowWarnings(bShowWarnings);\n}\n\nvoid MultiplexOut::SetShowErrors(bool bShowErrors) {\n AbstrDebugOut::SetShowErrors(bShowErrors);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowErrors(bShowErrors);\n}\n\nvoid MultiplexOut::SetShowOther(bool bShowOther) {\n AbstrDebugOut::SetShowOther(bShowOther);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowOther(bShowOther);\n}\n\ntemplate <class T>\nstruct deleter : std::unary_function<T, void> {\n void operator()(T* p) const {\n delete p;\n }\n};\n\nvoid MultiplexOut::clear()\n{\n std::for_each(m_vpDebugger.begin(), m_vpDebugger.end(),\n deleter<AbstrDebugOut>());\n m_vpDebugger.clear();\n}\n<commit_msg>Add missing include.<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2008 Scientific Computing and Imaging Institute,\n University of Utah.\n\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n\/**\n \\file MultiplexOut.cpp\n \\author Jens Krueger\n SCI Institute\n University of Utah\n \\date September 2008\n*\/\n\n#include <functional>\n#include \"MultiplexOut.h\"\n\n#ifdef WIN32\n #include <windows.h>\n \/\/ undef stupid windows defines to max and min\n #ifdef max\n #undef max\n #endif\n\n #ifdef min\n #undef min\n #endif\n#endif\n\n#include <stdarg.h>\n#include <algorithm>\n\n#include <fstream>\nusing namespace std;\n\nMultiplexOut::~MultiplexOut() {\n for (size_t i = 0;i<m_vpDebugger.size();i++) {\n m_vpDebugger[i]->Message(_func_, \"(MultiplexOut::~MultiplexOut): Shutting down\");\n delete m_vpDebugger[i];\n }\n}\n\nvoid MultiplexOut::AddDebugOut(AbstrDebugOut* pDebugger) {\n m_vpDebugger.push_back(pDebugger);\n pDebugger->Message(_func_,\"Operating as part of a multiplexed debug out now.\");\n}\n\nvoid MultiplexOut::RemoveDebugOut(AbstrDebugOut* pDebugger) {\n std::vector<AbstrDebugOut*>::iterator del;\n\n del = std::find(m_vpDebugger.begin(), m_vpDebugger.end(), pDebugger);\n\n if(del != m_vpDebugger.end()) {\n delete *del;\n m_vpDebugger.erase(del);\n }\n}\n\n\nvoid MultiplexOut::printf(const char* format, ...) const\n{\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->printf(buff);\n}\n\nvoid MultiplexOut::Message(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Message(source,buff);\n}\n\nvoid MultiplexOut::Warning(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Warning(source,buff);\n}\n\nvoid MultiplexOut::Error(const char* source, const char* format, ...) {\n char buff[16384];\n va_list args;\n va_start(args, format);\n#ifdef WIN32\n _vsnprintf_s( buff, 16384, sizeof(buff), format, args);\n#else\n vsnprintf( buff, sizeof(buff), format, args);\n#endif\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->Error(source,buff);\n}\n\nvoid MultiplexOut::SetShowMessages(bool bShowMessages) {\n AbstrDebugOut::SetShowMessages(bShowMessages);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowMessages(bShowMessages);\n}\n\nvoid MultiplexOut::SetShowWarnings(bool bShowWarnings) {\n AbstrDebugOut::SetShowWarnings(bShowWarnings);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowWarnings(bShowWarnings);\n}\n\nvoid MultiplexOut::SetShowErrors(bool bShowErrors) {\n AbstrDebugOut::SetShowErrors(bShowErrors);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowErrors(bShowErrors);\n}\n\nvoid MultiplexOut::SetShowOther(bool bShowOther) {\n AbstrDebugOut::SetShowOther(bShowOther);\n for (size_t i = 0;i<m_vpDebugger.size();i++) m_vpDebugger[i]->SetShowOther(bShowOther);\n}\n\ntemplate <class T>\nstruct deleter : std::unary_function<T, void> {\n void operator()(T* p) const {\n delete p;\n }\n};\n\nvoid MultiplexOut::clear()\n{\n std::for_each(m_vpDebugger.begin(), m_vpDebugger.end(),\n deleter<AbstrDebugOut>());\n m_vpDebugger.clear();\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <functional>\n#include <gsl\/span>\n#include <exception>\n\n#include \"core\/audio\/midi.hpp\"\n\n#include \"util\/audio.hpp\"\n\nnamespace top1 {\n \/**\n * Audio Processors are anything that can process audio\/midi.\n * They run on the audio thread, and are called by the audio system (Jack).\n * Formally, an audio processor is defined as having a method matching\n * this signature:\n *\n * ```\n * void process(const ProcessData&);\n * ```\n *\n * This method _must_ not be called from anywhere other than the main\n * audio system and it's deligates.\n *\n * If another thread needs access to any of this data, e.g. the audio\/midi data,\n * They need an audio processor to read it and store it. It is up to the module\n * in question to handle thread safety.\n *\/\n namespace audio {\n\n \/**\n * Checks if a type qualifies as an <AudioProcessor>\n *\/\n template<typename...>\n struct is_audio_processor {}; \/\/ TODO: Implementation\n\n template<typename T>\n struct audio_frame_channels {};\n\n template<int N>\n struct audio_frame_channels<std::array<float, N>> {\n static constexpr auto value = N;\n };\n\n\n namespace detail {\n \/\/ No including \"core\/globals.hpp\" in headers\n void registerAudioBufferResize(std::function<void(int)>);\n }\n\n \/**\n * A DynArray that resizes to fit the RealTime bufferSize.\n *\n * This is the container used in AudioProcessors, and it should be used\n * in any place where the realtime data is copied out. It is resized on\n * the bufferSizeChanged event\n *\/\n template<typename T, std::size_t factor = 1>\n class RTBuffer : public util::dyn_array<T> {\n public:\n\n RTBuffer(std::size_t initial_size = 0)\n : util::dyn_array<T>(initial_size * factor)\n {\n detail::registerAudioBufferResize([this] (std::size_t newSize) {\n resize(newSize);\n });\n }\n\n void resize(std::size_t new_size)\n {\n util::dyn_array<T>::resize(new_size * factor);\n }\n };\n\n template<int N>\n using ProcessBuffer = RTBuffer<std::array<float, N>, 1>;\n\n \/\/\/ Non-owning package of data passed to audio processors\n template<int N>\n struct ProcessData {\n static constexpr int channels = N;\n\n gsl::span<std::array<float, channels>> audio;\n gsl::span<midi::AnyMidiEvent> midi;\n\n long nframes;\n\n template<int outN = 0>\n ProcessData<outN> midi_only() {\n return {{nullptr, nullptr}, midi, nframes};\n }\n\n ProcessData audio_only() {\n return {audio, {nullptr, nullptr}, nframes};\n }\n\n template<typename T>\n auto redirect(T& buf) ->\n ProcessData<audio_frame_channels<std::remove_reference_t<\n decltype(buf[0])>>::value>\n {\n return ProcessData<audio_frame_channels<std::remove_reference_t<\n decltype(buf[0])>>::value>{{buf.data(), nframes}, midi, nframes};\n }\n\n \/\/\/ Get only a slice of the audio.\n \/\/\/\n \/\/\/ \\param first The index to start from\n \/\/\/ \\param length The number of frames to keep in the slice\n \/\/\/ If `length` is negative, `nframes - idx` will be used\n \/\/\/ \\requires parameter `idx` shall be in the range `[0, nframes)`, and\n \/\/\/ `length` shall be in range `[0, nframes - idx]` \n ProcessData slice(int idx, int length = -1) {\n auto res = *this;\n length = length < 0 ? nframes - idx : length;\n res.nframes = length;\n res.audio = {audio.data() + idx, length};\n return res;\n }\n\n decltype(auto) begin() { return audio.begin(); }\n decltype(auto) end() { return audio.end(); }\n decltype(auto) begin() const { return audio.begin(); }\n decltype(auto) end() const { return audio.end(); }\n };\n\n } \/\/ audio\n} \/\/ top1\n<commit_msg>Fix for gcc<commit_after>#pragma once\n\n#include <functional>\n#include <gsl\/span>\n#include <exception>\n\n#include \"core\/audio\/midi.hpp\"\n\n#include \"util\/audio.hpp\"\n\nnamespace top1 {\n \/**\n * Audio Processors are anything that can process audio\/midi.\n * They run on the audio thread, and are called by the audio system (Jack).\n * Formally, an audio processor is defined as having a method matching\n * this signature:\n *\n * ```\n * void process(const ProcessData&);\n * ```\n *\n * This method _must_ not be called from anywhere other than the main\n * audio system and it's deligates.\n *\n * If another thread needs access to any of this data, e.g. the audio\/midi data,\n * They need an audio processor to read it and store it. It is up to the module\n * in question to handle thread safety.\n *\/\n namespace audio {\n\n \/**\n * Checks if a type qualifies as an <AudioProcessor>\n *\/\n template<typename...>\n struct is_audio_processor {}; \/\/ TODO: Implementation\n\n template<typename T>\n struct audio_frame_channels;\n\n template<std::size_t N>\n struct audio_frame_channels<std::array<float, N>> {\n static constexpr auto value = N;\n };\n\n\n namespace detail {\n \/\/ No including \"core\/globals.hpp\" in headers\n void registerAudioBufferResize(std::function<void(int)>);\n }\n\n \/**\n * A DynArray that resizes to fit the RealTime bufferSize.\n *\n * This is the container used in AudioProcessors, and it should be used\n * in any place where the realtime data is copied out. It is resized on\n * the bufferSizeChanged event\n *\/\n template<typename T, std::size_t factor = 1>\n class RTBuffer : public util::dyn_array<T> {\n public:\n\n RTBuffer(std::size_t initial_size = 0)\n : util::dyn_array<T>(initial_size * factor)\n {\n detail::registerAudioBufferResize([this] (std::size_t newSize) {\n resize(newSize);\n });\n }\n\n void resize(std::size_t new_size)\n {\n util::dyn_array<T>::resize(new_size * factor);\n }\n };\n\n template<int N>\n using ProcessBuffer = RTBuffer<std::array<float, N>, 1>;\n\n \/\/\/ Non-owning package of data passed to audio processors\n template<int N>\n struct ProcessData {\n static constexpr int channels = N;\n\n gsl::span<std::array<float, channels>> audio;\n gsl::span<midi::AnyMidiEvent> midi;\n\n long nframes;\n\n template<int outN = 0>\n ProcessData<outN> midi_only() {\n return {{nullptr, nullptr}, midi, nframes};\n }\n\n ProcessData audio_only() {\n return {audio, {nullptr, nullptr}, nframes};\n }\n\n template<typename T>\n auto redirect(T& buf)\n {\n return ProcessData<audio_frame_channels<std::decay_t<\n decltype(buf[0])>>::value>{{buf.data(), nframes}, midi, nframes};\n }\n\n \/\/\/ Get only a slice of the audio.\n \/\/\/\n \/\/\/ \\param first The index to start from\n \/\/\/ \\param length The number of frames to keep in the slice\n \/\/\/ If `length` is negative, `nframes - idx` will be used\n \/\/\/ \\requires parameter `idx` shall be in the range `[0, nframes)`, and\n \/\/\/ `length` shall be in range `[0, nframes - idx]` \n ProcessData slice(int idx, int length = -1) {\n auto res = *this;\n length = length < 0 ? nframes - idx : length;\n res.nframes = length;\n res.audio = {audio.data() + idx, length};\n return res;\n }\n\n decltype(auto) begin() { return audio.begin(); }\n decltype(auto) end() { return audio.end(); }\n decltype(auto) begin() const { return audio.begin(); }\n decltype(auto) end() const { return audio.end(); }\n };\n\n } \/\/ audio\n} \/\/ top1\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QI_ACTOR_HPP_\n#define _QI_ACTOR_HPP_\n\n#include <qi\/strand.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/function.hpp>\n\nnamespace qi\n{\n\n\/** Class that represents an actor.\n *\n * Inherit from this class if you want your class to be an actor (as in the\n * actor model). This means that your class will receive \"messages\" and not be\n * called. In other words, there will never be to calls to your object in\n * parallel, they will be queued.\n *\n * \\includename{qi\/actor.hpp}\n *\/\nclass QI_API Actor\n{\npublic:\n Actor()\n : _strand()\n {}\n Actor(const Actor&)\n {}\n Actor(qi::ExecutionContext& ec)\n : _strand(ec)\n {}\n\n qi::Strand* strand() const\n {\n return &_strand;\n }\n\nprivate:\n mutable qi::Strand _strand;\n};\n\n}\n\n#endif \/\/ _QI_ACTOR_HPP_\n<commit_msg>Actor: add explicit constructor<commit_after>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QI_ACTOR_HPP_\n#define _QI_ACTOR_HPP_\n\n#include <qi\/strand.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/function.hpp>\n\nnamespace qi\n{\n\n\/** Class that represents an actor.\n *\n * Inherit from this class if you want your class to be an actor (as in the\n * actor model). This means that your class will receive \"messages\" and not be\n * called. In other words, there will never be to calls to your object in\n * parallel, they will be queued.\n *\n * \\includename{qi\/actor.hpp}\n *\/\nclass QI_API Actor\n{\npublic:\n Actor()\n : _strand()\n {}\n Actor(const Actor&)\n {}\n explicit Actor(qi::ExecutionContext& ec)\n : _strand(ec)\n {}\n\n qi::Strand* strand() const\n {\n return &_strand;\n }\n\nprivate:\n mutable qi::Strand _strand;\n};\n\n}\n\n#endif \/\/ _QI_ACTOR_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ SDL_gui.cpp\n\/\/ TestSDLimage\n\/\/\n\/\/ Created by Panutat Tejasen on 21\/12\/2561 BE.\n\/\/ Copyright © 2561 Jimmy Software Co., Ltd. All rights reserved.\n\/\/\n\n#include \"SDL_gui.h\"\n\nint GUI_physicalWindowWidth = 0;\nint GUI_physicalWindowHeight = 0;\n\nint GUI_windowWidth = 0;\nint GUI_windowHeight = 0;\n\nint GUI_expectedWidth = 0;\nint GUI_expectedHeight = 0;\n\nfloat GUI_scale = 1;\nfloat GUI_mouseScale = 1;\n\nstatic bool done = false;\nSDL_Renderer *GUI_renderer = NULL;\nSDL_Window *GUI_window = NULL;\nGUI_View *GUI_topView = NULL;\nGUI_View * GUI_mouseCapturedView = NULL;\n\nstatic std::function<bool(SDL_Event* ev)> user_handle_events = NULL;\n\nconst long MILLESECONDS_PER_FRAME = 1000\/60;\nstatic Uint32 timer_start = 0;\nstatic float frameCount = 0;\n\n\nstatic void GUI_Loop();\nstatic void handle_events(SDL_Event *ev);\n\nint GUI_Init( const char* title, int expectedWidth, int expectedHeight ) {\n \/\/ Get Sccreen size\n SDL_DisplayMode dm;\n if (SDL_GetDesktopDisplayMode(0, &dm) != 0)\n {\n SDL_Log(\"SDL_GetDesktopDisplayMode failed: %s\", SDL_GetError());\n exit(1);\n }\n SDL_Log(\"Display: %d %d\\n\", dm.w, dm.h);\n \n \/\/Now create a window with title \"SDL\" at 0, 0 on the screen with w:800 h:600 and show it\n \/\/ ::SDL_WINDOW_FULLSCREEN, ::SDL_WINDOW_OPENGL,\n \/\/ ::SDL_WINDOW_HIDDEN, ::SDL_WINDOW_BORDERLESS,\n \/\/ ::SDL_WINDOW_RESIZABLE, ::SDL_WINDOW_MAXIMIZED,\n \/\/ ::SDL_WINDOW_MINIMIZED, ::SDL_WINDOW_INPUT_GRABBED,\n \/\/ ::SDL_WINDOW_ALLOW_HIGHDPI.\n#if defined(__IPHONEOS__) || defined(__ANDROID__) || defined(__EMSCRIPTEN__)\n int style = SDL_WINDOW_OPENGL|SDL_WINDOW_ALLOW_HIGHDPI|SDL_WINDOW_BORDERLESS;\n int cx = 0;\n int cy = 0;\n#else\n int style = SDL_WINDOW_OPENGL|SDL_WINDOW_ALLOW_HIGHDPI|SDL_WINDOW_RESIZABLE;\n int cx = (dm.w - expectedWidth) \/ 2;\n int cy = (dm.h - expectedHeight) \/ 2;\n#endif\n GUI_window = SDL_CreateWindow(title, cx, cy, expectedWidth, expectedHeight, style);\n\n if (GUI_window == NULL) {\n printf(\"SDL_CreateRenderer Error\\n\");\n exit(1);\n }\n\n#if defined(WIN32)\n HICON hicon = LoadIcon(GetModuleHandle(NULL), MAKEINTRESOURCE(IDI_ICON1));\n\tSDL_SysWMinfo info = {0};\n\tSDL_VERSION(&info.version);\n\tSDL_GetWindowWMInfo(window, &info);\n\tHWND hwnd = info.info.win.window;\n\tSendMessage(hwnd, WM_SETICON, ICON_SMALL, (LPARAM)hicon);\n\tSendMessage(hwnd, WM_SETICON, ICON_BIG, (LPARAM)hicon);\n#endif\n\n \/\/Create a renderer that will draw to the window, -1 specifies that we want to load whichever\n \/\/video driver supports the flags we're passing\n \/\/Flags: SDL_RENDERER_ACCELERATED: We want to use hardware accelerated rendering\n \/\/SDL_RENDERER_PRESENTVSYNC: We want the renderer's present function (update screen) to be\n \/\/synchornized with the monitor's refresh rate\n GUI_renderer = SDL_CreateRenderer(GUI_window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (GUI_renderer == NULL) {\n SDL_Log(\"SDL_CreateRenderer Error\\n\");\n exit(1);\n }\n\n\n \n SDL_GetWindowSize(GUI_window, &GUI_windowWidth, &GUI_windowHeight);\n SDL_Log(\"given: %d %d\\n\", GUI_windowWidth, GUI_windowHeight);\n\n if( expectedWidth )\n GUI_expectedWidth = expectedWidth;\n else\n GUI_expectedWidth = GUI_windowWidth;\n\n if( expectedHeight )\n GUI_expectedHeight = expectedHeight;\n else\n GUI_expectedHeight = GUI_windowHeight;\n\n SDL_Log( \"!!! Expected: %i %i\\n\", GUI_expectedWidth, GUI_expectedHeight );\n GUI_updateScaleParameters();\n \n return 0;\n}\n\nextern void GUI_updateScaleParameters() {\n SDL_GL_GetDrawableSize(GUI_window, &GUI_physicalWindowWidth, &GUI_physicalWindowHeight);\n SDL_Log( \"Drawable: %i %i\\n\", GUI_physicalWindowWidth, GUI_physicalWindowHeight );\n \n#ifdef __ANDROID__\n SDL_Log( \"Expected: %i %i\\n\", GUI_expectedWidth, GUI_expectedHeight );\n \/\/ Android always get fullscreen with no retina\n int scalex = GUI_physicalWindowWidth \/ GUI_expectedWidth;\n int scaley = GUI_physicalWindowHeight \/ GUI_expectedHeight;\n SDL_Log( \"Calc scale: %i %i\\n\", scalex, scaley );\n#else\n int scalex = GUI_physicalWindowWidth \/ GUI_windowWidth;\n int scaley = GUI_physicalWindowHeight \/ GUI_windowHeight;\n#endif\n \n GUI_scale = (float)((scalex < scaley) ? scaley : scalex);\n if (GUI_scale < 1.0f) {\n GUI_scale = 1.0f;\n }\n SDL_Log( \"Scale: %0.2f\\n\", GUI_scale );\n SDL_Log( \"Mouse Scale: %0.2f\\n\", GUI_mouseScale );\n#ifdef __ANDROID__\n GUI_windowWidth = GUI_physicalWindowWidth \/ GUI_scale;\n GUI_windowHeight = GUI_physicalWindowHeight \/ GUI_scale;\n GUI_mouseScale = 1.0;\n#else\n if( GUI_windowWidth * GUI_scale != GUI_physicalWindowWidth ||\n GUI_windowHeight * GUI_scale != GUI_physicalWindowHeight ) {\n \n GUI_windowWidth = GUI_physicalWindowWidth \/ GUI_scale;\n GUI_windowHeight = GUI_physicalWindowHeight \/ GUI_scale;\n }\n GUI_mouseScale = GUI_scale;\n#endif\n SDL_Log(\"virtual: %d %d\\n\", GUI_windowWidth, GUI_windowHeight);\n}\n\nvoid GUI_Run(std::function<bool(SDL_Event* ev)> user_handle_ev) {\n user_handle_events = user_handle_ev;\n \n#ifdef __EMSCRIPTEN__\n \/\/ void emscripten_set_main_loop(em_callback_func func, int fps, int simulate_infinite_loop);\n emscripten_set_main_loop(GUI_Loop, 0, 1);\n#else\n timer_start = SDL_GetTicks();\n \/\/ main loop\n Uint32 startFrame = 0;\n Uint32 endFrame = 0;\n int delay;\n \n \/\/Uint32 timer_start = SDL_GetTicks();\n while (!done) {\n startFrame = SDL_GetTicks();\n GUI_Loop();\n endFrame = SDL_GetTicks();\n \/* figure out how much time we have left, and then sleep *\/\n \n delay = MILLESECONDS_PER_FRAME - (endFrame - startFrame);\n if (delay < 0) {\n delay = 0;\n } else if (delay > MILLESECONDS_PER_FRAME) {\n delay = MILLESECONDS_PER_FRAME;\n }\n SDL_Delay(delay);\n }\n#endif\n}\n\nvoid GUI_Destroy() {\n SDL_DestroyRenderer(GUI_renderer);\n SDL_DestroyWindow(GUI_window);\n}\n\n\n\n\n\nvoid GUI_Error(const char* fn, int result) {\n GUI_Log(\"SDL_gui ERROR: \\\"%s\\\" error: %x (%d).\\n\", fn, result, result);\n}\n\nstatic void GUI_Loop() {\n#ifdef __EMSCRIPTEN__\n SDL_Rect rect = {0, 0, GUI_physicalWindowWidth, GUI_physicalWindowHeight};\n SDL_RenderSetViewport(GUI_renderer, &rect);\n SDL_RenderSetClipRect(GUI_renderer, &rect);\n \n SDL_SetRenderDrawColor(GUI_renderer, 0x64, 0x95, 0xed, 0xff);\n SDL_RenderClear(GUI_renderer);\n#else\n SDL_RenderSetViewport(GUI_renderer, NULL);\n SDL_RenderSetClipRect(GUI_renderer, NULL);\n \n SDL_SetRenderDrawColor(GUI_renderer, 0x64, 0x95, 0xed, 0xff);\n SDL_RenderClear(GUI_renderer);\n#endif\n \n frameCount++;\n \n SDL_Event event;\n while (SDL_PollEvent(&event)) {\n switch( event.type ) {\n case SDL_QUIT:\n done = 1;\n break;\n \n case SDL_WINDOWEVENT:\n switch (event.window.event)\n {\n case SDL_WINDOWEVENT_RESIZED:\n case SDL_WINDOWEVENT_SIZE_CHANGED:\n SDL_Log( \"Event: Window Resized: %i, %i\\n\", event.window.data1, event.window.data2 );\n GUI_windowWidth = event.window.data1;\n GUI_windowHeight = event.window.data2;\n\n GUI_updateScaleParameters();\n if( GUI_topView ) {\n GUI_topView->updateLayout();\n }\n break;\n }\n break;\n }\n handle_events(&event);\n }\n event.type = GUI_EventUpdate;\n handle_events(&event);\n event.type = GUI_EventPaint;\n handle_events(&event);\n \n \/* update screen *\/\n SDL_RenderPresent(GUI_renderer);\n \n Uint32 duration = SDL_GetTicks()-timer_start;\n float fps = frameCount \/ duration * 1000.0f;\n \/\/printf( \"FPS: %0.2f\\n\", fps );\n}\n\nstatic void handle_events(SDL_Event *ev) {\n if (user_handle_events) {\n if (user_handle_events(ev))\n return;\n }\n if (GUI_mouseCapturedView) {\n switch (ev->type) {\n case SDL_FINGERDOWN:\n case SDL_MOUSEBUTTONDOWN:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n case SDL_FINGERMOTION:\n case SDL_MOUSEMOTION:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n case SDL_FINGERUP:\n case SDL_MOUSEBUTTONUP:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n }\n }\n if( GUI_topView ) {\n if( GUI_topView->eventHandler(ev) )\n return;\n }\n}\n\nvoid GUI_SetMouseCapture( GUI_View *v ) {\n GUI_mouseCapturedView = v;\n}\n\nGUI_View *GUI_createTopView(const char* t, int x, int y, int w, int h,\n std::function<bool(SDL_Event* ev)>userEventHandler) {\n if (GUI_topView) {\n GUI_Log(\"GUI_TopView existed\");\n printf(\"ERROR: GUI_TopView existed.\");\n exit(1);\n }\n \n GUI_topView = GUI_View::create(NULL, t, x, y, w, h, userEventHandler);\n \n GUI_topView->focusable = true;\n \n if (w == -1) {\n w = GUI_windowWidth - x;\n }\n \n if (h == -1) {\n h = GUI_windowHeight - y;\n }\n \n \/\/GUI_topView->resize(w, h);\n \/\/GUI_topView->setMargin(0, 0, 0, 0);\n \/\/GUI_topView->setPadding(0, 0, 0, 0);\n \/\/GUI_topView->setBorder(0);\n \/\/GUI_topView->bgcol = cWhite;\n \n return GUI_topView;\n}\n\n\n<commit_msg>Fixed emscripten bug<commit_after>\/\/\n\/\/ SDL_gui.cpp\n\/\/ TestSDLimage\n\/\/\n\/\/ Created by Panutat Tejasen on 21\/12\/2561 BE.\n\/\/ Copyright © 2561 Jimmy Software Co., Ltd. All rights reserved.\n\/\/\n\n#include \"SDL_gui.h\"\n\nint GUI_physicalWindowWidth = 0;\nint GUI_physicalWindowHeight = 0;\n\nint GUI_windowWidth = 0;\nint GUI_windowHeight = 0;\n\nint GUI_expectedWidth = 0;\nint GUI_expectedHeight = 0;\n\nfloat GUI_scale = 1;\nfloat GUI_mouseScale = 1;\n\nstatic bool done = false;\nSDL_Renderer *GUI_renderer = NULL;\nSDL_Window *GUI_window = NULL;\nGUI_View *GUI_topView = NULL;\nGUI_View * GUI_mouseCapturedView = NULL;\n\nstatic std::function<bool(SDL_Event* ev)> user_handle_events = NULL;\n\nconst long MILLESECONDS_PER_FRAME = 1000\/60;\nstatic Uint32 timer_start = 0;\nstatic float frameCount = 0;\n\n\nstatic void GUI_Loop();\nstatic void handle_events(SDL_Event *ev);\n\nint GUI_Init( const char* title, int expectedWidth, int expectedHeight ) {\n \/\/ Get Sccreen size\n SDL_DisplayMode dm;\n if (SDL_GetDesktopDisplayMode(0, &dm) != 0)\n {\n SDL_Log(\"SDL_GetDesktopDisplayMode failed: %s\", SDL_GetError());\n exit(1);\n }\n SDL_Log(\"Display: %d %d\\n\", dm.w, dm.h);\n \n \/\/Now create a window with title \"SDL\" at 0, 0 on the screen with w:800 h:600 and show it\n \/\/ ::SDL_WINDOW_FULLSCREEN, ::SDL_WINDOW_OPENGL,\n \/\/ ::SDL_WINDOW_HIDDEN, ::SDL_WINDOW_BORDERLESS,\n \/\/ ::SDL_WINDOW_RESIZABLE, ::SDL_WINDOW_MAXIMIZED,\n \/\/ ::SDL_WINDOW_MINIMIZED, ::SDL_WINDOW_INPUT_GRABBED,\n \/\/ ::SDL_WINDOW_ALLOW_HIGHDPI.\n#if defined(__IPHONEOS__) || defined(__ANDROID__) || defined(__EMSCRIPTEN__)\n int style = SDL_WINDOW_OPENGL|SDL_WINDOW_ALLOW_HIGHDPI|SDL_WINDOW_BORDERLESS;\n int cx = 0;\n int cy = 0;\n#else\n int style = SDL_WINDOW_OPENGL|SDL_WINDOW_ALLOW_HIGHDPI|SDL_WINDOW_RESIZABLE;\n int cx = (dm.w - expectedWidth) \/ 2;\n int cy = (dm.h - expectedHeight) \/ 2;\n#endif\n GUI_window = SDL_CreateWindow(title, cx, cy, expectedWidth, expectedHeight, style);\n\n if (GUI_window == NULL) {\n printf(\"SDL_CreateRenderer Error\\n\");\n exit(1);\n }\n\n#if defined(WIN32)\n HICON hicon = LoadIcon(GetModuleHandle(NULL), MAKEINTRESOURCE(IDI_ICON1));\n\tSDL_SysWMinfo info = {0};\n\tSDL_VERSION(&info.version);\n\tSDL_GetWindowWMInfo(window, &info);\n\tHWND hwnd = info.info.win.window;\n\tSendMessage(hwnd, WM_SETICON, ICON_SMALL, (LPARAM)hicon);\n\tSendMessage(hwnd, WM_SETICON, ICON_BIG, (LPARAM)hicon);\n#endif\n\n \/\/Create a renderer that will draw to the window, -1 specifies that we want to load whichever\n \/\/video driver supports the flags we're passing\n \/\/Flags: SDL_RENDERER_ACCELERATED: We want to use hardware accelerated rendering\n \/\/SDL_RENDERER_PRESENTVSYNC: We want the renderer's present function (update screen) to be\n \/\/synchornized with the monitor's refresh rate\n GUI_renderer = SDL_CreateRenderer(GUI_window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (GUI_renderer == NULL) {\n SDL_Log(\"SDL_CreateRenderer Error\\n\");\n exit(1);\n }\n\n\n \n SDL_GetWindowSize(GUI_window, &GUI_windowWidth, &GUI_windowHeight);\n SDL_Log(\"given: %d %d\\n\", GUI_windowWidth, GUI_windowHeight);\n\n if( expectedWidth )\n GUI_expectedWidth = expectedWidth;\n else\n GUI_expectedWidth = GUI_windowWidth;\n\n if( expectedHeight )\n GUI_expectedHeight = expectedHeight;\n else\n GUI_expectedHeight = GUI_windowHeight;\n\n SDL_Log( \"!!! Expected: %i %i\\n\", GUI_expectedWidth, GUI_expectedHeight );\n GUI_updateScaleParameters();\n \n return 0;\n}\n\nextern void GUI_updateScaleParameters() {\n SDL_GL_GetDrawableSize(GUI_window, &GUI_physicalWindowWidth, &GUI_physicalWindowHeight);\n SDL_Log( \"Drawable: %i %i\\n\", GUI_physicalWindowWidth, GUI_physicalWindowHeight );\n \n#ifdef __ANDROID__\n SDL_Log( \"Expected: %i %i\\n\", GUI_expectedWidth, GUI_expectedHeight );\n \/\/ Android always get fullscreen with no retina\n int scalex = GUI_physicalWindowWidth \/ GUI_expectedWidth;\n int scaley = GUI_physicalWindowHeight \/ GUI_expectedHeight;\n SDL_Log( \"Calc scale: %i %i\\n\", scalex, scaley );\n#else\n int scalex = GUI_physicalWindowWidth \/ GUI_windowWidth;\n int scaley = GUI_physicalWindowHeight \/ GUI_windowHeight;\n#endif\n \n GUI_scale = (float)((scalex < scaley) ? scaley : scalex);\n if (GUI_scale < 1.0f) {\n GUI_scale = 1.0f;\n }\n SDL_Log( \"Scale: %0.2f\\n\", GUI_scale );\n SDL_Log( \"Mouse Scale: %0.2f\\n\", GUI_mouseScale );\n#if defined(__ANDROID__) \n GUI_windowWidth = GUI_physicalWindowWidth \/ GUI_scale;\n GUI_windowHeight = GUI_physicalWindowHeight \/ GUI_scale;\n GUI_mouseScale = 1.0;\n#else\n if( GUI_windowWidth * GUI_scale != GUI_physicalWindowWidth ||\n GUI_windowHeight * GUI_scale != GUI_physicalWindowHeight ) {\n \n GUI_windowWidth = GUI_physicalWindowWidth \/ GUI_scale;\n GUI_windowHeight = GUI_physicalWindowHeight \/ GUI_scale;\n }\n GUI_mouseScale = GUI_scale;\n#endif\n SDL_Log(\"virtual: %d %d\\n\", GUI_windowWidth, GUI_windowHeight);\n}\n\nvoid GUI_Run(std::function<bool(SDL_Event* ev)> user_handle_ev) {\n user_handle_events = user_handle_ev;\n \n#ifdef __EMSCRIPTEN__\n \/\/ void emscripten_set_main_loop(em_callback_func func, int fps, int simulate_infinite_loop);\n emscripten_set_main_loop(GUI_Loop, 0, 1);\n#else\n timer_start = SDL_GetTicks();\n \/\/ main loop\n Uint32 startFrame = 0;\n Uint32 endFrame = 0;\n int delay;\n \n \/\/Uint32 timer_start = SDL_GetTicks();\n while (!done) {\n startFrame = SDL_GetTicks();\n GUI_Loop();\n endFrame = SDL_GetTicks();\n \/* figure out how much time we have left, and then sleep *\/\n \n delay = MILLESECONDS_PER_FRAME - (endFrame - startFrame);\n if (delay < 0) {\n delay = 0;\n } else if (delay > MILLESECONDS_PER_FRAME) {\n delay = MILLESECONDS_PER_FRAME;\n }\n SDL_Delay(delay);\n }\n#endif\n}\n\nvoid GUI_Destroy() {\n SDL_DestroyRenderer(GUI_renderer);\n SDL_DestroyWindow(GUI_window);\n}\n\n\n\n\n\nvoid GUI_Error(const char* fn, int result) {\n GUI_Log(\"SDL_gui ERROR: \\\"%s\\\" error: %x (%d).\\n\", fn, result, result);\n}\n\nstatic void GUI_Loop() {\n#ifdef __EMSCRIPTEN__\n SDL_Rect rect = {0, 0, GUI_physicalWindowWidth, GUI_physicalWindowHeight};\n SDL_RenderSetViewport(GUI_renderer, &rect);\n SDL_RenderSetClipRect(GUI_renderer, &rect);\n \n SDL_SetRenderDrawColor(GUI_renderer, 0x64, 0x95, 0xed, 0xff);\n SDL_RenderClear(GUI_renderer);\n#else\n SDL_RenderSetViewport(GUI_renderer, NULL);\n SDL_RenderSetClipRect(GUI_renderer, NULL);\n \n SDL_SetRenderDrawColor(GUI_renderer, 0x64, 0x95, 0xed, 0xff);\n SDL_RenderClear(GUI_renderer);\n#endif\n \n frameCount++;\n \n SDL_Event event;\n while (SDL_PollEvent(&event)) {\n switch( event.type ) {\n case SDL_QUIT:\n done = 1;\n break;\n \n case SDL_WINDOWEVENT:\n switch (event.window.event)\n {\n case SDL_WINDOWEVENT_RESIZED:\n case SDL_WINDOWEVENT_SIZE_CHANGED:\n SDL_Log( \"Event: Window Resized: %i, %i\\n\", event.window.data1, event.window.data2 );\n GUI_windowWidth = event.window.data1;\n GUI_windowHeight = event.window.data2;\n\n GUI_updateScaleParameters();\n if( GUI_topView ) {\n GUI_topView->updateLayout();\n }\n break;\n }\n break;\n }\n handle_events(&event);\n }\n event.type = GUI_EventUpdate;\n handle_events(&event);\n event.type = GUI_EventPaint;\n handle_events(&event);\n \n \/* update screen *\/\n SDL_RenderPresent(GUI_renderer);\n \n Uint32 duration = SDL_GetTicks()-timer_start;\n float fps = frameCount \/ duration * 1000.0f;\n \/\/printf( \"FPS: %0.2f\\n\", fps );\n}\n\nstatic void handle_events(SDL_Event *ev) {\n if (user_handle_events) {\n if (user_handle_events(ev))\n return;\n }\n if (GUI_mouseCapturedView) {\n switch (ev->type) {\n case SDL_FINGERDOWN:\n case SDL_MOUSEBUTTONDOWN:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n case SDL_FINGERMOTION:\n case SDL_MOUSEMOTION:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n case SDL_FINGERUP:\n case SDL_MOUSEBUTTONUP:\n if (GUI_mouseCapturedView->eventHandler(ev))\n return;\n break;\n }\n }\n if( GUI_topView ) {\n if( GUI_topView->eventHandler(ev) )\n return;\n }\n}\n\nvoid GUI_SetMouseCapture( GUI_View *v ) {\n GUI_mouseCapturedView = v;\n}\n\nGUI_View *GUI_createTopView(const char* t, int x, int y, int w, int h,\n std::function<bool(SDL_Event* ev)>userEventHandler) {\n if (GUI_topView) {\n GUI_Log(\"GUI_TopView existed\");\n printf(\"ERROR: GUI_TopView existed.\");\n exit(1);\n }\n \n GUI_topView = GUI_View::create(NULL, t, x, y, w, h, userEventHandler);\n \n GUI_topView->focusable = true;\n \n if (w == -1) {\n w = GUI_windowWidth - x;\n }\n \n if (h == -1) {\n h = GUI_windowHeight - y;\n }\n \n \/\/GUI_topView->resize(w, h);\n \/\/GUI_topView->setMargin(0, 0, 0, 0);\n \/\/GUI_topView->setPadding(0, 0, 0, 0);\n \/\/GUI_topView->setBorder(0);\n \/\/GUI_topView->bgcol = cWhite;\n \n return GUI_topView;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/service\/multi_output_fusion.h\"\n\n#include \"absl\/container\/flat_hash_set.h\"\n#include \"tensorflow\/compiler\/xla\/debug_options_flags.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_instruction.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_opcode.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_reachability.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace xla {\n\nStatusOr<bool> MultiOutputFusion::Run(HloModule* module) {\n bool changed = false;\n\n for (auto* computation : module->MakeNonfusionComputations()) {\n computation_ = computation;\n candidates_.clear();\n candidates_index_.clear();\n all_fusion_candidates_.clear();\n RecomputeReachability();\n\n int64 index = 0;\n for (auto it : computation_->MakeInstructionPostOrder()) {\n candidates_.emplace_back(it);\n InsertOrDie(&candidates_index_, it, index++);\n }\n\n \/\/ Create the initial candidate list for each Node.\n for (auto& node : candidates_) {\n HloInstruction* instruction = node.hlo;\n int64 instruction_id = get_candidate_id(instruction);\n FusionCandidate& instr_node = candidates_[instruction_id];\n if (!IsFusible(instruction)) {\n continue;\n }\n all_fusion_candidates_.push_back(instruction);\n\n std::vector<HloInstruction*> candidates;\n absl::flat_hash_set<HloInstruction*> candidates_set;\n VLOG(10) << \"Looking at instruction: \" << instruction->name();\n for (auto operand : instruction->operands()) {\n \/\/ Filter out the non-interesting instructions -- they\n \/\/ will not generate the savings.\n if (!IsProfitableOperand(operand)) {\n VLOG(10) << \"Operand not profitable: \" << operand->name();\n continue;\n }\n VLOG(10) << \"Operand profitable: \" << operand->name();\n for (auto user : operand->users()) {\n VLOG(10) << \"User: \" << user->name();\n if (user == instruction || !IsFusible(user)) {\n VLOG(10) << \"User is not fusible, or is the instruction itself: \"\n << user->name();\n continue;\n }\n int64 user_id = get_candidate_id(user);\n if (is_connected(instruction, user)) {\n VLOG(10) << \"User is connected: \" << user->name();\n continue;\n }\n if (instruction_id < user_id &&\n user->opcode() == HloOpcode::kFusion) {\n VLOG(10) << \"User ID for user: \" << user->name() << \" is \"\n << user_id << \" which is higher than \" << instruction_id;\n continue;\n }\n if (!LegalToFuse(instruction, user)) {\n VLOG(10) << \"User not legal to fuse: \" << user->name();\n continue;\n }\n if (candidates_set.insert(user).second) {\n VLOG(10) << \"User added to candidate list: \" << user->name();\n candidates.push_back(user);\n }\n }\n }\n\n \/\/ Iterate over candidates rather than candidates_set to avoid\n \/\/ nondeterminism.\n for (auto candidate : candidates) {\n int64 profit = GetProfit(instruction, candidate);\n if (profit > 0) {\n FusionCandidate& candidate_node =\n candidates_[get_candidate_id(candidate)];\n instr_node.fusibles.emplace_back(candidate, profit);\n candidate_node.fusibles.emplace_back(instruction, profit);\n worklist_.emplace(instruction, candidate, profit);\n }\n }\n }\n if (Perform()) {\n changed = true;\n }\n }\n return changed;\n}\n\nHloInstruction* MultiOutputFusion::Fuse(HloInstruction* instr1,\n HloInstruction* instr2) {\n HloInstruction* remaining = instr1;\n HloInstruction* fused = instr2;\n \/\/ Make sure that if only one of the instructions is a fusion, or if only one\n \/\/ of the instructions is a multi-output fusion, it's what will be fused into.\n if (fused->opcode() == HloOpcode::kFusion) {\n std::swap(remaining, fused);\n }\n if (fused->IsMultiOutputFusion()) {\n std::swap(remaining, fused);\n }\n if (fused->opcode() == HloOpcode::kFusion) {\n remaining->MergeFusionInstructionIntoMultiOutput(fused);\n } else {\n remaining->FuseInstructionIntoMultiOutput(fused);\n CHECK_EQ(0, fused->user_count());\n TF_CHECK_OK(computation()->RemoveInstruction(fused));\n }\n return remaining;\n}\n\nbool MultiOutputFusion::IsProfitableOperand(HloInstruction* instr) {\n \/\/ kConstant instruction will not have memory reads, so it won't be a profit\n \/\/ source. Skip them.\n if (instr->opcode() == HloOpcode::kConstant &&\n ShapeUtil::IsEffectiveScalar(instr->shape())) {\n return false;\n }\n \/\/ We don't target to fuse producer\/consumer instructions -- this should\n \/\/ be taken care of by the instruction_fusion pass. If instr has only\n \/\/ one user, it will not have sibling instructions. We won't consider it.\n if (instr->user_count() < 2) {\n return false;\n }\n return true;\n}\n\nvoid MultiOutputFusion::Update(HloInstruction* instr1, HloInstruction* instr2) {\n HloInstruction* fusion = instr1;\n HloInstruction* fused = instr2;\n if (is_fused(instr1)) {\n fusion = instr2;\n fused = instr1;\n }\n\n \/\/ Insert the newly created instruction (if any), to candidates_.\n for (auto use : fusion->users()) {\n if (candidates_index_.find(use) == candidates_index_.end()) {\n int64 index = candidates_.size();\n candidates_.emplace_back(use);\n InsertOrDie(&candidates_index_, use, index++);\n }\n }\n FusionCandidate& fusion_node = candidates_[get_candidate_id(fusion)];\n FusionCandidate& fused_node = candidates_[get_candidate_id(fused)];\n\n \/\/ Update the reachability graph.\n UpdateReachability(fusion, fused, all_fusion_candidates_,\n [this](HloInstruction* instr) { return is_fused(instr); });\n\n \/\/ Update the fusible list for fusion. Variable new_fusibles keeps\n \/\/ track of the new or changed entries.\n std::vector<std::pair<HloInstruction*, int64>> new_fusibles;\n absl::flat_hash_set<HloInstruction*> in_list;\n auto it = fusion_node.fusibles.begin();\n while (it != fusion_node.fusibles.end()) {\n HloInstruction* instr = it->first;\n if (is_fused(instr) || is_connected(fusion, instr)) {\n it = fusion_node.fusibles.erase(it);\n continue;\n }\n in_list.insert(instr);\n int64 profit = GetProfit(instr, fusion);\n if (profit > it->second) {\n it->second = profit;\n new_fusibles.emplace_back(instr, profit);\n }\n ++it;\n }\n\n \/\/ Fused_node has been fused into fusion_node. Take the fusion candidates\n \/\/ (fusibles) from fused_nodes and add them to the fusion_node's. Filter\n \/\/ out those fusibles that no longer valid (or already in the list).\n for (const auto& it : fused_node.fusibles) {\n HloInstruction* instr = it.first;\n if (instr == fusion || is_fused(instr) || is_connected(fusion, instr)) {\n continue;\n }\n if (in_list.contains(instr)) {\n continue;\n }\n int64 profit = GetProfit(instr, fusion);\n fusion_node.fusibles.emplace_back(instr, profit);\n new_fusibles.emplace_back(instr, profit);\n }\n fused_node.fusibles.clear();\n\n \/\/ Update the worklist_.\n for (auto it : new_fusibles) {\n worklist_.emplace(fusion, it.first, it.second);\n }\n}\n\nbool MultiOutputFusion::LegalToFuse(HloInstruction* instr1,\n HloInstruction* instr2) {\n if (instr1 == instr2) {\n return false;\n }\n if (instr1->opcode() != HloOpcode::kFusion) {\n return false;\n }\n\n \/\/ Fusing nodes with 0 users makes no sense and the rest of the implementation\n \/\/ doesn't support it either.\n if (instr1->user_count() == 0 || instr2->user_count() == 0) {\n return false;\n }\n\n \/\/ Check if the users of multioutput fusion is not a get-tuple-element.\n \/\/ If this is the case, we bail out because the transformation assumes\n \/\/ the users are get-tuple-element.\n auto multioutput_user_is_not_gte = [](HloInstruction* instr) {\n if (!instr->IsMultiOutputFusion()) {\n return false;\n }\n for (auto user : instr->users()) {\n if (user->opcode() != HloOpcode::kGetTupleElement) {\n return true;\n }\n }\n return false;\n };\n if (multioutput_user_is_not_gte(instr1) ||\n multioutput_user_is_not_gte(instr2)) {\n return false;\n }\n if (is_connected(instr1, instr2)) {\n return false;\n }\n if (!ShapesCompatibleForFusion(instr1, instr2)) {\n return false;\n }\n return true;\n}\n\nvoid MultiOutputFusion::RecomputeReachability() {\n \/\/ Free the memory used for the reachability map before computing a new one.\n reachability_.reset();\n reachability_ = HloReachabilityMap::Build(computation_);\n}\n\nvoid MultiOutputFusion::UpdateReachability(\n HloInstruction* instr1, HloInstruction* instr2,\n absl::Span<HloInstruction* const> instrs_to_update,\n const std::function<bool(HloInstruction*)>& skip) {\n for (auto instr : instrs_to_update) {\n if (skip != nullptr && skip(instr)) {\n continue;\n }\n if (reachability_->IsReachable(instr2, instr) &&\n reachability_->IsReachable(instr1, instr)) {\n \/\/ If a candidate was already reachable by both, no update needed.\n continue;\n }\n if (reachability_->IsReachable(instr2, instr)) {\n reachability_->FastSetReachabilityToUnion({instr, instr1}, instr);\n }\n if (reachability_->IsReachable(instr1, instr)) {\n reachability_->FastSetReachabilityToUnion({instr, instr2}, instr);\n }\n }\n}\n\nbool MultiOutputFusion::Perform() {\n int changed = false;\n \/\/ Pick the top candidate from queue and try to merge.\n while (!worklist_.empty()) {\n ToBeFused candidate = worklist_.top();\n worklist_.pop();\n\n HloInstruction* instr1 = candidate.instr1;\n HloInstruction* instr2 = candidate.instr2;\n\n if (is_fused(instr1) || is_fused(instr2)) {\n continue;\n }\n\n VLOG(1) << \"Considering candidate profit_score=\" << candidate.score\n << \"\\n\\t\\tinstr1 = \" << instr1->ToString()\n << \"\\n\\t\\tinstr2 = \" << instr2->ToString();\n\n if (LegalToFuse(instr1, instr2)) {\n if (!ConsumeFuel(name(), [&] {\n return absl::StrFormat(\"Not fusing %s and %s.\", instr1->ToString(),\n instr2->ToString());\n })) {\n break;\n }\n VLOG(1) << \"Fuse!\";\n VLOG(2) << \"Before multi_output_fusion:\";\n VLOG(2) << \"instr1: \" << instr1->ToString();\n VLOG(2) << \"\\n\"\n << instr1->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n VLOG(2) << \"instr2: \" << instr2->ToString();\n if (instr2->opcode() == HloOpcode::kFusion) {\n VLOG(2) << \"\\n\"\n << instr2->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n }\n Update(instr1, instr2);\n HloInstruction* ret = Fuse(instr1, instr2);\n set_is_fused(ret == instr1 ? instr2 : instr1);\n changed = true;\n VLOG(2) << \"After fusion, \\t this: \" << ret->name() << \"\\n\"\n << ret->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n }\n }\n if (DoProducerConsumerMultiOutputFusion()) {\n changed = true;\n }\n return changed;\n}\n\nbool MultiOutputFusion::DoProducerConsumerMultiOutputFusion() { return false; }\n\n} \/\/ namespace xla\n<commit_msg>[XLA] Reset the state of multioutput fusion after run since it may be inside an hlo pipeline.<commit_after>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/service\/multi_output_fusion.h\"\n\n#include \"absl\/container\/flat_hash_set.h\"\n#include \"tensorflow\/compiler\/xla\/debug_options_flags.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_instruction.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_opcode.h\"\n#include \"tensorflow\/compiler\/xla\/service\/hlo_reachability.h\"\n#include \"tensorflow\/compiler\/xla\/shape_util.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n\nnamespace xla {\n\nStatusOr<bool> MultiOutputFusion::Run(HloModule* module) {\n bool changed = false;\n\n for (auto* computation : module->MakeNonfusionComputations()) {\n computation_ = computation;\n candidates_.clear();\n candidates_index_.clear();\n all_fusion_candidates_.clear();\n RecomputeReachability();\n\n int64 index = 0;\n for (auto it : computation_->MakeInstructionPostOrder()) {\n candidates_.emplace_back(it);\n InsertOrDie(&candidates_index_, it, index++);\n }\n\n \/\/ Create the initial candidate list for each Node.\n for (auto& node : candidates_) {\n HloInstruction* instruction = node.hlo;\n int64 instruction_id = get_candidate_id(instruction);\n FusionCandidate& instr_node = candidates_[instruction_id];\n if (!IsFusible(instruction)) {\n continue;\n }\n all_fusion_candidates_.push_back(instruction);\n\n std::vector<HloInstruction*> candidates;\n absl::flat_hash_set<HloInstruction*> candidates_set;\n VLOG(10) << \"Looking at instruction: \" << instruction->name();\n for (auto operand : instruction->operands()) {\n \/\/ Filter out the non-interesting instructions -- they\n \/\/ will not generate the savings.\n if (!IsProfitableOperand(operand)) {\n VLOG(10) << \"Operand not profitable: \" << operand->name();\n continue;\n }\n VLOG(10) << \"Operand profitable: \" << operand->name();\n for (auto user : operand->users()) {\n VLOG(10) << \"User: \" << user->name();\n if (user == instruction || !IsFusible(user)) {\n VLOG(10) << \"User is not fusible, or is the instruction itself: \"\n << user->name();\n continue;\n }\n int64 user_id = get_candidate_id(user);\n if (is_connected(instruction, user)) {\n VLOG(10) << \"User is connected: \" << user->name();\n continue;\n }\n if (instruction_id < user_id &&\n user->opcode() == HloOpcode::kFusion) {\n VLOG(10) << \"User ID for user: \" << user->name() << \" is \"\n << user_id << \" which is higher than \" << instruction_id;\n continue;\n }\n if (!LegalToFuse(instruction, user)) {\n VLOG(10) << \"User not legal to fuse: \" << user->name();\n continue;\n }\n if (candidates_set.insert(user).second) {\n VLOG(10) << \"User added to candidate list: \" << user->name();\n candidates.push_back(user);\n }\n }\n }\n\n \/\/ Iterate over candidates rather than candidates_set to avoid\n \/\/ nondeterminism.\n for (auto candidate : candidates) {\n int64 profit = GetProfit(instruction, candidate);\n if (profit > 0) {\n FusionCandidate& candidate_node =\n candidates_[get_candidate_id(candidate)];\n instr_node.fusibles.emplace_back(candidate, profit);\n candidate_node.fusibles.emplace_back(instruction, profit);\n worklist_.emplace(instruction, candidate, profit);\n }\n }\n }\n if (Perform()) {\n changed = true;\n }\n }\n \/\/ Clean up state in case this pass is wrapped in an HloPassPipeline.\n candidates_.clear();\n candidates_index_.clear();\n all_fusion_candidates_.clear();\n reachability_.reset();\n return changed;\n}\n\nHloInstruction* MultiOutputFusion::Fuse(HloInstruction* instr1,\n HloInstruction* instr2) {\n HloInstruction* remaining = instr1;\n HloInstruction* fused = instr2;\n \/\/ Make sure that if only one of the instructions is a fusion, or if only one\n \/\/ of the instructions is a multi-output fusion, it's what will be fused into.\n if (fused->opcode() == HloOpcode::kFusion) {\n std::swap(remaining, fused);\n }\n if (fused->IsMultiOutputFusion()) {\n std::swap(remaining, fused);\n }\n if (fused->opcode() == HloOpcode::kFusion) {\n remaining->MergeFusionInstructionIntoMultiOutput(fused);\n } else {\n remaining->FuseInstructionIntoMultiOutput(fused);\n CHECK_EQ(0, fused->user_count());\n TF_CHECK_OK(computation()->RemoveInstruction(fused));\n }\n return remaining;\n}\n\nbool MultiOutputFusion::IsProfitableOperand(HloInstruction* instr) {\n \/\/ kConstant instruction will not have memory reads, so it won't be a profit\n \/\/ source. Skip them.\n if (instr->opcode() == HloOpcode::kConstant &&\n ShapeUtil::IsEffectiveScalar(instr->shape())) {\n return false;\n }\n \/\/ We don't target to fuse producer\/consumer instructions -- this should\n \/\/ be taken care of by the instruction_fusion pass. If instr has only\n \/\/ one user, it will not have sibling instructions. We won't consider it.\n if (instr->user_count() < 2) {\n return false;\n }\n return true;\n}\n\nvoid MultiOutputFusion::Update(HloInstruction* instr1, HloInstruction* instr2) {\n HloInstruction* fusion = instr1;\n HloInstruction* fused = instr2;\n if (is_fused(instr1)) {\n fusion = instr2;\n fused = instr1;\n }\n\n \/\/ Insert the newly created instruction (if any), to candidates_.\n for (auto use : fusion->users()) {\n if (candidates_index_.find(use) == candidates_index_.end()) {\n int64 index = candidates_.size();\n candidates_.emplace_back(use);\n InsertOrDie(&candidates_index_, use, index++);\n }\n }\n FusionCandidate& fusion_node = candidates_[get_candidate_id(fusion)];\n FusionCandidate& fused_node = candidates_[get_candidate_id(fused)];\n\n \/\/ Update the reachability graph.\n UpdateReachability(fusion, fused, all_fusion_candidates_,\n [this](HloInstruction* instr) { return is_fused(instr); });\n\n \/\/ Update the fusible list for fusion. Variable new_fusibles keeps\n \/\/ track of the new or changed entries.\n std::vector<std::pair<HloInstruction*, int64>> new_fusibles;\n absl::flat_hash_set<HloInstruction*> in_list;\n auto it = fusion_node.fusibles.begin();\n while (it != fusion_node.fusibles.end()) {\n HloInstruction* instr = it->first;\n if (is_fused(instr) || is_connected(fusion, instr)) {\n it = fusion_node.fusibles.erase(it);\n continue;\n }\n in_list.insert(instr);\n int64 profit = GetProfit(instr, fusion);\n if (profit > it->second) {\n it->second = profit;\n new_fusibles.emplace_back(instr, profit);\n }\n ++it;\n }\n\n \/\/ Fused_node has been fused into fusion_node. Take the fusion candidates\n \/\/ (fusibles) from fused_nodes and add them to the fusion_node's. Filter\n \/\/ out those fusibles that no longer valid (or already in the list).\n for (const auto& it : fused_node.fusibles) {\n HloInstruction* instr = it.first;\n if (instr == fusion || is_fused(instr) || is_connected(fusion, instr)) {\n continue;\n }\n if (in_list.contains(instr)) {\n continue;\n }\n int64 profit = GetProfit(instr, fusion);\n fusion_node.fusibles.emplace_back(instr, profit);\n new_fusibles.emplace_back(instr, profit);\n }\n fused_node.fusibles.clear();\n\n \/\/ Update the worklist_.\n for (auto it : new_fusibles) {\n worklist_.emplace(fusion, it.first, it.second);\n }\n}\n\nbool MultiOutputFusion::LegalToFuse(HloInstruction* instr1,\n HloInstruction* instr2) {\n if (instr1 == instr2) {\n return false;\n }\n if (instr1->opcode() != HloOpcode::kFusion) {\n return false;\n }\n\n \/\/ Fusing nodes with 0 users makes no sense and the rest of the implementation\n \/\/ doesn't support it either.\n if (instr1->user_count() == 0 || instr2->user_count() == 0) {\n return false;\n }\n\n \/\/ Check if the users of multioutput fusion is not a get-tuple-element.\n \/\/ If this is the case, we bail out because the transformation assumes\n \/\/ the users are get-tuple-element.\n auto multioutput_user_is_not_gte = [](HloInstruction* instr) {\n if (!instr->IsMultiOutputFusion()) {\n return false;\n }\n for (auto user : instr->users()) {\n if (user->opcode() != HloOpcode::kGetTupleElement) {\n return true;\n }\n }\n return false;\n };\n if (multioutput_user_is_not_gte(instr1) ||\n multioutput_user_is_not_gte(instr2)) {\n return false;\n }\n if (is_connected(instr1, instr2)) {\n return false;\n }\n if (!ShapesCompatibleForFusion(instr1, instr2)) {\n return false;\n }\n return true;\n}\n\nvoid MultiOutputFusion::RecomputeReachability() {\n \/\/ Free the memory used for the reachability map before computing a new one.\n reachability_.reset();\n reachability_ = HloReachabilityMap::Build(computation_);\n}\n\nvoid MultiOutputFusion::UpdateReachability(\n HloInstruction* instr1, HloInstruction* instr2,\n absl::Span<HloInstruction* const> instrs_to_update,\n const std::function<bool(HloInstruction*)>& skip) {\n for (auto instr : instrs_to_update) {\n if (skip != nullptr && skip(instr)) {\n continue;\n }\n if (reachability_->IsReachable(instr2, instr) &&\n reachability_->IsReachable(instr1, instr)) {\n \/\/ If a candidate was already reachable by both, no update needed.\n continue;\n }\n if (reachability_->IsReachable(instr2, instr)) {\n reachability_->FastSetReachabilityToUnion({instr, instr1}, instr);\n }\n if (reachability_->IsReachable(instr1, instr)) {\n reachability_->FastSetReachabilityToUnion({instr, instr2}, instr);\n }\n }\n}\n\nbool MultiOutputFusion::Perform() {\n int changed = false;\n \/\/ Pick the top candidate from queue and try to merge.\n while (!worklist_.empty()) {\n ToBeFused candidate = worklist_.top();\n worklist_.pop();\n\n HloInstruction* instr1 = candidate.instr1;\n HloInstruction* instr2 = candidate.instr2;\n\n if (is_fused(instr1) || is_fused(instr2)) {\n continue;\n }\n\n VLOG(1) << \"Considering candidate profit_score=\" << candidate.score\n << \"\\n\\t\\tinstr1 = \" << instr1->ToString()\n << \"\\n\\t\\tinstr2 = \" << instr2->ToString();\n\n if (LegalToFuse(instr1, instr2)) {\n if (!ConsumeFuel(name(), [&] {\n return absl::StrFormat(\"Not fusing %s and %s.\", instr1->ToString(),\n instr2->ToString());\n })) {\n break;\n }\n VLOG(1) << \"Fuse!\";\n VLOG(2) << \"Before multi_output_fusion:\";\n VLOG(2) << \"instr1: \" << instr1->ToString();\n VLOG(2) << \"\\n\"\n << instr1->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n VLOG(2) << \"instr2: \" << instr2->ToString();\n if (instr2->opcode() == HloOpcode::kFusion) {\n VLOG(2) << \"\\n\"\n << instr2->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n }\n Update(instr1, instr2);\n HloInstruction* ret = Fuse(instr1, instr2);\n set_is_fused(ret == instr1 ? instr2 : instr1);\n changed = true;\n VLOG(2) << \"After fusion, \\t this: \" << ret->name() << \"\\n\"\n << ret->fused_instructions_computation()->ToString(\n HloPrintOptions().set_indent_amount(1));\n }\n }\n if (DoProducerConsumerMultiOutputFusion()) {\n changed = true;\n }\n return changed;\n}\n\nbool MultiOutputFusion::DoProducerConsumerMultiOutputFusion() { return false; }\n\n} \/\/ namespace xla\n<|endoftext|>"} {"text":"<commit_before>\/*The following code simulates the Producer-Consumer problem using Standard Library threads. A producer thread produces a shared resource and then sleeps for a second.\nThe consumer thread consumes the resource and then sleeps for a second. How much of the resource is produced or consumed is dictated by a pseudo-random subroutine.*\/\n#include <iostream>\n#include <thread>\n#include <mutex>\n#include <random>\n#include <chrono>\n\nstd::mutex resourceMutex;\nsize_t resource = 5;\n\nsize_t toss(std::default_random_engine &seed)\n{\n\tstd::uniform_real_distribution<double> rnd(0.0, 1.0);\n\tdouble trial = rnd(seed);\n\treturn (trial < 0.5) ? 5 : 10;\n}\n\n\nvoid produce()\n{\n\tstd::default_random_engine seed;\n\twhile (resource > 0)\n\t{\n\t\tstd::unique_lock<std::mutex> lock(resourceMutex);\n\t\tsize_t units = toss(seed);\n\t\tresource += units;\n\t\tstd::cout << \"Produced \" << units << \" units.\" << std::endl;\n\t\tstd::cout << \"Total: \" << resource << \"\\n\\n\" << std::endl;\n\t\tlock.unlock();\n\t\t\n\t\tstd::this_thread::sleep_for(std::chrono::seconds(1));\n\t}\n}\n\nvoid consume()\n{\n\tstd::default_random_engine seed;\n\twhile (resource > 0)\n\t{\n\t\tstd::unique_lock<std::mutex> lock(resourceMutex);\n\t\tsize_t units = toss(seed);\n\t\tresource -= units;\n\t\tstd::cout << \"Consumed \" << units << \" units.\" << std::endl;\n\t\tstd::cout << \"Total: \" << resource << \"\\n\\n\" << std::endl;\n\t\tlock.unlock();\n\t\t\n\t\tstd::this_thread::sleep_for(std::chrono::seconds(1));\n\t}\n}\n\n\nint main()\n{\n\tstd::thread producer(produce);\n\tstd::thread consumer(consume);\n\t\n\tproducer.join();\n\tconsumer.join();\n}<commit_msg>Fixed a potential data race using atomics<commit_after>\/*The following code simulates the Producer-Consumer problem using Standard Library threads. A producer thread produces a shared resource and then sleeps for a second.\nThe consumer thread consumes the resource and then sleeps for a second. How much of the resource is produced or consumed is dictated by a pseudo-random subroutine.*\/\n#include <iostream>\n#include <thread>\n#include <mutex>\n#include <random>\n#include <chrono>\n#include <atomic>\n\nstd::mutex resourceMutex;\nstd::atomic<int> resource(1);\n\nsize_t toss(std::default_random_engine &seed)\n{\n\tstd::uniform_real_distribution<double> rnd(0.0, 1.0);\n\tdouble trial = rnd(seed);\n\treturn (trial < 0.5) ? 5 : 10;\n}\n\n\nvoid produce()\n{\n\tstd::default_random_engine seed;\n\twhile (resource > 0)\n\t{\n\t\tstd::unique_lock<std::mutex> lock(resourceMutex);\n\t\tsize_t units = toss(seed);\n\t\tresource += units;\n\t\tstd::cout << \"Produced \" << units << \" units.\" << std::endl;\n\t\tstd::cout << \"Total: \" << resource << \"\\n\\n\" << std::endl;\n\t\tlock.unlock();\n\t\t\n\t\tstd::this_thread::sleep_for(std::chrono::seconds(1));\n\t}\n}\n\nvoid consume()\n{\n\tstd::default_random_engine seed;\n\twhile (resource > 0)\n\t{\n\t\tstd::unique_lock<std::mutex> lock(resourceMutex);\n\t\tsize_t units = toss(seed);\n\t\tresource -= units;\n\t\tstd::cout << \"Consumed \" << units << \" units.\" << std::endl;\n\t\tstd::cout << \"Total: \" << resource << \"\\n\\n\" << std::endl;\n\t\tlock.unlock();\n\t\t\n\t\tstd::this_thread::sleep_for(std::chrono::seconds(1));\n\t}\n}\n\n\nint main()\n{\n\tstd::thread producer(produce);\n\tstd::thread consumer(consume);\n\t\n\tproducer.join();\n\tconsumer.join();\n}<|endoftext|>"} {"text":"<commit_before>#include \"OpcodeBase.hpp\"\n#include <map>\n#include <vector>\n\nusing namespace csound;\n\n\/\/ Define ENABLE_MIXER_IDEBUG to enable i-rate debug messages.\n\/\/#define ENABLE_MIXER_IDEBUG\n\n\/\/ Define ENABLE_MIXER_KDEBUG to enable -rate and a-rate debug messages.\n\/\/#define ENABLE_MIXER_KDEBUG\n\n\/**\n * The mixer busses are laid out:\n * busses[csound][bus][channel][frame].\n *\/\nstatic std::map<CSOUND *, std::map<size_t,\n std::vector< std::vector<MYFLT> > > > *busses = 0;\n\n\/**\n * The mixer send matrix is laid out:\n * matrix[csound][send][bus].\n *\/\nstatic std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > > *matrix = 0;\n\n\/**\n * Creates the buss if it does not already exist.\n *\/\nstatic void createBuss(CSOUND *csound, size_t buss)\n{\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: csound %p buss %d...\\n\", csound, buss);\n#endif\n if((*busses)[csound].find(buss) == (*busses)[csound].end()) {\n size_t channels = csound->GetNchnls(csound);\n size_t frames = csound->GetKsmps(csound);\n (*busses)[csound][buss].resize(channels);\n for(size_t channel = 0; channel < channels; channel++) {\n (*busses)[csound][buss][channel].resize(frames);\n }\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: created buss.\\n\");\n#endif\n } else {\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: buss already exists.\\n\");\n#endif\n }\n}\n\n\/**\n * MixerSetLevel isend, ibuss, kgain\n *\n * Controls the gain of any signal route from a send to a bus\n *\/\nstruct MixerSetLevel : public OpcodeBase<MixerSetLevel> {\n \/\/ No outputs.\n \/\/ Inputs.\n MYFLT *isend;\n MYFLT *ibuss;\n MYFLT *kgain;\n \/\/ State.\n size_t send;\n size_t buss;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSetLevel::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n (*matrix)[csound][send][buss] = *kgain;\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSetLevel::init: csound %p send %d buss %d gain %f\\n\",\n csound, send, buss, (*matrix)[csound][send][buss]);\n#endif\n return OK;\n }\n int kontrol(CSOUND *csound)\n {\n (*matrix)[csound][send][buss] = *kgain;\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSetLevel::kontrol: csound %p send %d buss \"\n \"%d gain %f\\n\", csound, send, buss, (*matrix)[csound][send][buss]);\n#endif\n return OK;\n }\n};\n\n\/**\n * kgain MixerGetLevel isend, ibuss\n *\n * Returns the gain of any signal route from a send to a bus.\n *\/\nstruct MixerGetLevel : public OpcodeBase<MixerGetLevel> {\n \/\/.\n MYFLT *kgain;\n \/\/ Inputs.\n MYFLT *isend;\n MYFLT *ibuss;\n \/\/ State.\n size_t send;\n size_t buss;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerGetLevel::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int kontrol(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerGetLevel::kontrol...\\n\");\n#endif\n *kgain = (*matrix)[csound][send][buss];\n return OK;\n }\n};\n\/**\n * MixerSend asignal, isend, ibus, ichannel\n *\n * Routes a signal from a send to a channel of a mixer bus.\n * The gain of the send is controlled by the previously set mixer level.\n *\/\nstruct MixerSend : public OpcodeBase<MixerSend> {\n \/\/ No outputs.\n \/\/ Inputs.\n MYFLT *ainput;\n MYFLT *isend;\n MYFLT *ibuss;\n MYFLT *ichannel;\n \/\/ State.\n size_t send;\n size_t buss;\n size_t channel;\n size_t frames;\n MYFLT *busspointer;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSend::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n channel = static_cast<size_t>(*ichannel);\n frames = opds.insdshead->ksmps;\n busspointer = &(*busses)[csound][buss][channel].front();\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSend::init: instance %p send %d buss \"\n \"%d channel %d frames %d busspointer %p\\n\",\n csound, send, buss, channel, frames, busspointer);\n#endif\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSend::audio...\\n\");\n#endif\n MYFLT gain = (*matrix)[csound][send][buss];\n for(size_t i = 0; i < frames; i++) {\n busspointer[i] += (ainput[i] * gain);\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSend::audio: instance %d send %d buss \"\n \"%d gain %f busspointer %p\\n\", csound, send, buss, gain, busspointer);\n#endif\n return OK;\n }\n};\n\n\/**\n * asignal MixerReceive ibuss, ichannel\n *\n * Receives a signal from a channel of a bus.\n * Obviously, instruments receiving signals must be numbered higher\n * than instruments sending those signals.\n *\/\nstruct MixerReceive : public OpcodeBase<MixerReceive> {\n \/\/ Output.\n MYFLT *aoutput;\n \/\/ Inputs.\n MYFLT *ibuss;\n MYFLT *ichannel;\n \/\/ State.\n size_t buss;\n size_t channel;\n size_t frames;\n MYFLT *busspointer;\n int init(CSOUND *csound)\n {\n buss = static_cast<size_t>(*ibuss);\n channel = static_cast<size_t>(*ichannel);\n frames = opds.insdshead->ksmps;\n createBuss(csound, buss);\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerReceive::init...\\n\");\n#endif\n busspointer = &(*busses)[csound][buss][channel].front();\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerReceive::init csound %p buss %d channel \"\n \"%d frames %d busspointer %p\\n\", csound, buss, channel,\n frames, busspointer);\n#endif\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerReceive::audio...\\n\");\n#endif\n for(size_t i = 0; i < frames; i++) {\n aoutput[i] = busspointer[i];\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerReceive::audio aoutput %p busspointer %p\\n\",\n aoutput, buss);\n#endif\n return OK;\n }\n};\n\n\/**\n * MixerClear\n *\n * Clears all busses. Must be invoked after last MixerReceive.\n * You should probably use a highest-numbered instrument\n * with an indefinite duration that invokes only this opcode.\n *\/\nstruct MixerClear : public OpcodeBase<MixerClear> {\n \/\/ No output.\n \/\/ No input.\n \/\/ No state.\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerClear::audio...\\n\")\n#endif\n for(std::map<size_t,\n std::vector< std::vector<MYFLT> > >::iterator\n busi = (*busses)[csound].begin();\n busi != (*busses)[csound].end(); ++busi) {\n for(std::vector< std::vector<MYFLT> >::iterator\n channeli = busi->second.begin();\n channeli != busi->second.end(); ++channeli) {\n for(std::vector<MYFLT>::iterator\n framei = (*channeli).begin();\n framei != (*channeli).end(); ++framei) {\n *framei = 0;\n }\n }\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerClear::audio\\n\")\n#endif\n return OK;\n }\n};\n\nextern \"C\"\n{\n\n static OENTRY localops[] = {\n {\n (char*)\"MixerSetLevel\",\n sizeof(MixerSetLevel),\n _CW,\n 3,\n (char*)\"\",\n (char*)\"iik\",\n (SUBR)&MixerSetLevel::init_,\n (SUBR)&MixerSetLevel::kontrol_,\n 0\n },\n {\n (char*)\"MixerSetLevel_i\",\n sizeof(MixerSetLevel),\n _CW,\n 1,\n (char*)\"\",\n (char*)\"iii\",\n (SUBR)&MixerSetLevel::init_,\n 0,\n 0\n },\n {\n (char*)\"MixerGetLevel\",\n sizeof(MixerGetLevel),\n _CR,\n 3,\n (char*)\"k\",\n (char*)\"ii\",\n (SUBR)&MixerGetLevel::init_,\n (SUBR)&MixerGetLevel::kontrol_,\n 0\n },\n {\n (char*)\"MixerSend\",\n sizeof(MixerSend),\n _CR,\n 5,\n (char*)\"\",\n (char*)\"aiii\",\n (SUBR)&MixerSend::init_,\n 0,\n (SUBR)&MixerSend::audio_\n },\n {\n (char*)\"MixerReceive\",\n sizeof(MixerReceive),\n _CW,\n 5,\n (char*)\"a\",\n (char*)\"ii\",\n (SUBR)&MixerReceive::init_,\n 0,\n (SUBR)&MixerReceive::audio_\n },\n {\n (char*)\"MixerClear\",\n sizeof(MixerClear),\n 0,\n 4,\n (char*)\"\",\n (char*)\"\",\n 0,\n 0,\n (SUBR)&MixerClear::audio_\n },\n { NULL, 0, 0, 0, NULL, NULL, (SUBR) NULL, (SUBR) NULL, (SUBR) NULL }\n };\n\n PUBLIC int csoundModuleCreate_mixer(CSOUND *csound)\n {\n busses = new std::map<CSOUND *,\n std::map<size_t, std::vector< std::vector<MYFLT> > >>;\n matrix = new std::map<CSOUND *,\n std::map<size_t, std::map<size_t, MYFLT> > >;\n return OK;\n }\n\n PUBLIC int csoundModuleInit_mixer(CSOUND *csound)\n {\n OENTRY *ep = (OENTRY*) &(localops[0]);\n int err = 0;\n\n while (ep->opname != NULL) {\n err |= csound->AppendOpcode(csound,\n ep->opname, ep->dsblksiz, ep->flags,\n ep->thread, ep->outypes, ep->intypes,\n (int (*)(CSOUND *, void*)) ep->iopadr,\n (int (*)(CSOUND *, void*)) ep->kopadr,\n (int (*)(CSOUND *, void*)) ep->aopadr);\n ep++;\n }\n return err;\n }\n\n \/*\n * The mixer busses are laid out:\n * busses[csound][bus][channel][frame].\n * std::map<CSOUND *, std::map<size_t,\n * std::vector< std::vector<MYFLT> > > > *busses = 0;\n * The mixer send matrix is laid out:\n * matrix[csound][send][bus].\n * std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > > *matrix = 0;\n *\/\n PUBLIC int csoundModuleDestroy_mixer(CSOUND *csound)\n {\n if(busses) {\n for(std::map<size_t,\n std::vector< std::vector<MYFLT> > >::iterator\n busi = (*busses)[csound].begin();\n busi != (*busses)[csound].end(); ++busi) {\n for(std::vector< std::vector<MYFLT> >::iterator\n channeli = busi->second.begin();\n channeli != busi->second.end(); ++channeli) {\n channeli->resize(0);\n }\n busi->second.clear();\n }\n busses->clear();\n delete busses;\n busses = 0;\n }\n if(matrix) {\n \/\/ std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > >\n for(std::map<size_t, std::map<size_t, MYFLT> >::iterator\n matrixi = (*matrix)[csound].begin();\n matrixi != (*matrix)[csound].end(); ++matrixi) {\n matrixi->second.clear();\n }\n matrix->clear();\n delete matrix;\n matrix = 0;\n }\n return OK;\n }\n\n\n#ifndef INIT_STATIC_MODULES\n PUBLIC int csoundModuleCreate(CSOUND *csound)\n {\n return csoundModuleCreate_mixer(csound);\n }\n\n PUBLIC int csoundModuleInit(CSOUND *csound)\n {\n return csoundModuleInit_mixer(csound);\n }\n\n PUBLIC int csoundModuleDestroy(CSOUND *csound)\n {\n return csoundModuleDestroy_mixer(csound);\n }\n#endif\n} \/\/ END EXTERN C\n\n<commit_msg>stupidity<commit_after>#include \"OpcodeBase.hpp\"\n#include <map>\n#include <vector>\n\nusing namespace csound;\n\n\/\/ Define ENABLE_MIXER_IDEBUG to enable i-rate debug messages.\n\/\/#define ENABLE_MIXER_IDEBUG\n\n\/\/ Define ENABLE_MIXER_KDEBUG to enable -rate and a-rate debug messages.\n\/\/#define ENABLE_MIXER_KDEBUG\n\n\/**\n * The mixer busses are laid out:\n * busses[csound][bus][channel][frame].\n *\/\nstatic std::map<CSOUND *, std::map<size_t,\n std::vector< std::vector<MYFLT> > > > *busses = 0;\n\n\/**\n * The mixer send matrix is laid out:\n * matrix[csound][send][bus].\n *\/\nstatic std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > > *matrix = 0;\n\n\/**\n * Creates the buss if it does not already exist.\n *\/\nstatic void createBuss(CSOUND *csound, size_t buss)\n{\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: csound %p buss %d...\\n\", csound, buss);\n#endif\n if((*busses)[csound].find(buss) == (*busses)[csound].end()) {\n size_t channels = csound->GetNchnls(csound);\n size_t frames = csound->GetKsmps(csound);\n (*busses)[csound][buss].resize(channels);\n for(size_t channel = 0; channel < channels; channel++) {\n (*busses)[csound][buss][channel].resize(frames);\n }\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: created buss.\\n\");\n#endif\n } else {\n#ifdef ENABLE_MIXER_IDEBUG\n csound->Message(csound, \"createBuss: buss already exists.\\n\");\n#endif\n }\n}\n\n\/**\n * MixerSetLevel isend, ibuss, kgain\n *\n * Controls the gain of any signal route from a send to a bus\n *\/\nstruct MixerSetLevel : public OpcodeBase<MixerSetLevel> {\n \/\/ No outputs.\n \/\/ Inputs.\n MYFLT *isend;\n MYFLT *ibuss;\n MYFLT *kgain;\n \/\/ State.\n size_t send;\n size_t buss;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSetLevel::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n (*matrix)[csound][send][buss] = *kgain;\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSetLevel::init: csound %p send %d buss %d gain %f\\n\",\n csound, send, buss, (*matrix)[csound][send][buss]);\n#endif\n return OK;\n }\n int kontrol(CSOUND *csound)\n {\n (*matrix)[csound][send][buss] = *kgain;\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSetLevel::kontrol: csound %p send %d buss \"\n \"%d gain %f\\n\", csound, send, buss, (*matrix)[csound][send][buss]);\n#endif\n return OK;\n }\n};\n\n\/**\n * kgain MixerGetLevel isend, ibuss\n *\n * Returns the gain of any signal route from a send to a bus.\n *\/\nstruct MixerGetLevel : public OpcodeBase<MixerGetLevel> {\n \/\/.\n MYFLT *kgain;\n \/\/ Inputs.\n MYFLT *isend;\n MYFLT *ibuss;\n \/\/ State.\n size_t send;\n size_t buss;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerGetLevel::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int kontrol(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerGetLevel::kontrol...\\n\");\n#endif\n *kgain = (*matrix)[csound][send][buss];\n return OK;\n }\n};\n\/**\n * MixerSend asignal, isend, ibus, ichannel\n *\n * Routes a signal from a send to a channel of a mixer bus.\n * The gain of the send is controlled by the previously set mixer level.\n *\/\nstruct MixerSend : public OpcodeBase<MixerSend> {\n \/\/ No outputs.\n \/\/ Inputs.\n MYFLT *ainput;\n MYFLT *isend;\n MYFLT *ibuss;\n MYFLT *ichannel;\n \/\/ State.\n size_t send;\n size_t buss;\n size_t channel;\n size_t frames;\n MYFLT *busspointer;\n int init(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSend::init...\\n\");\n#endif\n send = static_cast<size_t>(*isend);\n buss = static_cast<size_t>(*ibuss);\n createBuss(csound, buss);\n channel = static_cast<size_t>(*ichannel);\n frames = opds.insdshead->ksmps;\n busspointer = &(*busses)[csound][buss][channel].front();\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerSend::init: instance %p send %d buss \"\n \"%d channel %d frames %d busspointer %p\\n\",\n csound, send, buss, channel, frames, busspointer);\n#endif\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSend::audio...\\n\");\n#endif\n MYFLT gain = (*matrix)[csound][send][buss];\n for(size_t i = 0; i < frames; i++) {\n busspointer[i] += (ainput[i] * gain);\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerSend::audio: instance %d send %d buss \"\n \"%d gain %f busspointer %p\\n\", csound, send, buss, gain, busspointer);\n#endif\n return OK;\n }\n};\n\n\/**\n * asignal MixerReceive ibuss, ichannel\n *\n * Receives a signal from a channel of a bus.\n * Obviously, instruments receiving signals must be numbered higher\n * than instruments sending those signals.\n *\/\nstruct MixerReceive : public OpcodeBase<MixerReceive> {\n \/\/ Output.\n MYFLT *aoutput;\n \/\/ Inputs.\n MYFLT *ibuss;\n MYFLT *ichannel;\n \/\/ State.\n size_t buss;\n size_t channel;\n size_t frames;\n MYFLT *busspointer;\n int init(CSOUND *csound)\n {\n buss = static_cast<size_t>(*ibuss);\n channel = static_cast<size_t>(*ichannel);\n frames = opds.insdshead->ksmps;\n createBuss(csound, buss);\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerReceive::init...\\n\");\n#endif\n busspointer = &(*busses)[csound][buss][channel].front();\n#ifdef ENABLE_MIXER_IDEBUG\n warn(csound, \"MixerReceive::init csound %p buss %d channel \"\n \"%d frames %d busspointer %p\\n\", csound, buss, channel,\n frames, busspointer);\n#endif\n return OK;\n }\n int noteoff(CSOUND *)\n {\n return OK;\n }\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerReceive::audio...\\n\");\n#endif\n for(size_t i = 0; i < frames; i++) {\n aoutput[i] = busspointer[i];\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerReceive::audio aoutput %p busspointer %p\\n\",\n aoutput, buss);\n#endif\n return OK;\n }\n};\n\n\/**\n * MixerClear\n *\n * Clears all busses. Must be invoked after last MixerReceive.\n * You should probably use a highest-numbered instrument\n * with an indefinite duration that invokes only this opcode.\n *\/\nstruct MixerClear : public OpcodeBase<MixerClear> {\n \/\/ No output.\n \/\/ No input.\n \/\/ No state.\n int audio(CSOUND *csound)\n {\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerClear::audio...\\n\")\n#endif\n for(std::map<size_t,\n std::vector< std::vector<MYFLT> > >::iterator\n busi = (*busses)[csound].begin();\n busi != (*busses)[csound].end(); ++busi) {\n for(std::vector< std::vector<MYFLT> >::iterator\n channeli = busi->second.begin();\n channeli != busi->second.end(); ++channeli) {\n for(std::vector<MYFLT>::iterator\n framei = (*channeli).begin();\n framei != (*channeli).end(); ++framei) {\n *framei = 0;\n }\n }\n }\n#ifdef ENABLE_MIXER_KDEBUG\n warn(csound, \"MixerClear::audio\\n\")\n#endif\n return OK;\n }\n};\n\nextern \"C\"\n{\n\n static OENTRY localops[] = {\n {\n (char*)\"MixerSetLevel\",\n sizeof(MixerSetLevel),\n _CW,\n 3,\n (char*)\"\",\n (char*)\"iik\",\n (SUBR)&MixerSetLevel::init_,\n (SUBR)&MixerSetLevel::kontrol_,\n 0\n },\n {\n (char*)\"MixerSetLevel_i\",\n sizeof(MixerSetLevel),\n _CW,\n 1,\n (char*)\"\",\n (char*)\"iii\",\n (SUBR)&MixerSetLevel::init_,\n 0,\n 0\n },\n {\n (char*)\"MixerGetLevel\",\n sizeof(MixerGetLevel),\n _CR,\n 3,\n (char*)\"k\",\n (char*)\"ii\",\n (SUBR)&MixerGetLevel::init_,\n (SUBR)&MixerGetLevel::kontrol_,\n 0\n },\n {\n (char*)\"MixerSend\",\n sizeof(MixerSend),\n _CR,\n 5,\n (char*)\"\",\n (char*)\"aiii\",\n (SUBR)&MixerSend::init_,\n 0,\n (SUBR)&MixerSend::audio_\n },\n {\n (char*)\"MixerReceive\",\n sizeof(MixerReceive),\n _CW,\n 5,\n (char*)\"a\",\n (char*)\"ii\",\n (SUBR)&MixerReceive::init_,\n 0,\n (SUBR)&MixerReceive::audio_\n },\n {\n (char*)\"MixerClear\",\n sizeof(MixerClear),\n 0,\n 4,\n (char*)\"\",\n (char*)\"\",\n 0,\n 0,\n (SUBR)&MixerClear::audio_\n },\n { NULL, 0, 0, 0, NULL, NULL, (SUBR) NULL, (SUBR) NULL, (SUBR) NULL }\n };\n\n PUBLIC int csoundModuleCreate_mixer(CSOUND *csound)\n {\n busses = new std::map<CSOUND *,\n std::map<size_t, std::vector< std::vector<MYFLT> > > >;\n matrix = new std::map<CSOUND *,\n std::map<size_t, std::map<size_t, MYFLT> > >;\n return OK;\n }\n\n PUBLIC int csoundModuleInit_mixer(CSOUND *csound)\n {\n OENTRY *ep = (OENTRY*) &(localops[0]);\n int err = 0;\n\n while (ep->opname != NULL) {\n err |= csound->AppendOpcode(csound,\n ep->opname, ep->dsblksiz, ep->flags,\n ep->thread, ep->outypes, ep->intypes,\n (int (*)(CSOUND *, void*)) ep->iopadr,\n (int (*)(CSOUND *, void*)) ep->kopadr,\n (int (*)(CSOUND *, void*)) ep->aopadr);\n ep++;\n }\n return err;\n }\n\n \/*\n * The mixer busses are laid out:\n * busses[csound][bus][channel][frame].\n * std::map<CSOUND *, std::map<size_t,\n * std::vector< std::vector<MYFLT> > > > *busses = 0;\n * The mixer send matrix is laid out:\n * matrix[csound][send][bus].\n * std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > > *matrix = 0;\n *\/\n PUBLIC int csoundModuleDestroy_mixer(CSOUND *csound)\n {\n if(busses) {\n for(std::map<size_t,\n std::vector< std::vector<MYFLT> > >::iterator\n busi = (*busses)[csound].begin();\n busi != (*busses)[csound].end(); ++busi) {\n for(std::vector< std::vector<MYFLT> >::iterator\n channeli = busi->second.begin();\n channeli != busi->second.end(); ++channeli) {\n channeli->resize(0);\n }\n busi->second.clear();\n }\n busses->clear();\n delete busses;\n busses = 0;\n }\n if(matrix) {\n \/\/ std::map<CSOUND *, std::map<size_t, std::map<size_t, MYFLT> > >\n for(std::map<size_t, std::map<size_t, MYFLT> >::iterator\n matrixi = (*matrix)[csound].begin();\n matrixi != (*matrix)[csound].end(); ++matrixi) {\n matrixi->second.clear();\n }\n matrix->clear();\n delete matrix;\n matrix = 0;\n }\n return OK;\n }\n\n\n#ifndef INIT_STATIC_MODULES\n PUBLIC int csoundModuleCreate(CSOUND *csound)\n {\n return csoundModuleCreate_mixer(csound);\n }\n\n PUBLIC int csoundModuleInit(CSOUND *csound)\n {\n return csoundModuleInit_mixer(csound);\n }\n\n PUBLIC int csoundModuleDestroy(CSOUND *csound)\n {\n return csoundModuleDestroy_mixer(csound);\n }\n#endif\n} \/\/ END EXTERN C\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)alimdc:$Name$:$Id$\n\/\/ Author: Fons Rademakers 26\/11\/99\n\n\/**************************************************************************\n * Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ AliRunDB \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <TSystem.h>\n#include <TFile.h>\n#include <TString.h>\n#include <TDatime.h>\n#include <TSQLServer.h>\n#include <TSQLResult.h>\n#include <TGrid.h>\n\n#include \"AliStats.h\"\n#include \"AliRawDB.h\"\n\n#include \"AliRunDB.h\"\n\n\nClassImp(AliRunDB)\n\n\n\/\/______________________________________________________________________________\nAliRunDB::AliRunDB(const char* localFS, Bool_t rdbms,\n\t\t const char* alienHost, const char* alienDir) :\n fRunDB(NULL),\n fRDBMS(rdbms),\n fAlienHost(alienHost),\n fAlienDir(alienDir)\n{\n \/\/ Open run database, and get or create tree.\n\n if (!localFS) return;\n\n \/\/ Get hostname\n char hostname[64], filename[64];\n\n \/\/ check that fs exists (crude check fails if fs is a file)\n gSystem->MakeDirectory(localFS);\n\n \/\/ Put wide read-write permissions\n if(gSystem->Chmod(localFS,1023)) {\n Error(\"AliRunDB\",\"can't set permissions for run DB directory\");\n return;\n }\n\n strcpy(hostname, gSystem->HostName());\n\n char *s;\n if ((s = strchr(hostname, '.')))\n *s = 0;\n\n sprintf(filename, \"%s\/%s_rundb.root\", localFS, hostname);\n\n if (!gSystem->AccessPathName(filename, kFileExists))\n fRunDB = new TFile(filename, \"UPDATE\");\n else\n fRunDB = new TFile(filename, \"CREATE\", Form(\"ALICE MDC%d Run DB\", AliRawDB::kMDC));\n\n \/\/ Put wide read-write permissions\n if(gSystem->Chmod(filename,438)) {\n Error(\"AliRunDB\",\"can't set permissions for run DB file\");\n return;\n }\n}\n\n\/\/______________________________________________________________________________\nAliRunDB::AliRunDB(const AliRunDB& runDB): TObject(runDB)\n{\n\/\/ copy constructor\n\n Fatal(\"AliRunDB\", \"copy constructor not implemented\");\n}\n\n\/\/______________________________________________________________________________\nAliRunDB& AliRunDB::operator = (const AliRunDB& \/*runDB*\/)\n{\n\/\/ assignment operator\n\n Fatal(\"operator =\", \"assignment operator not implemented\");\n return *this;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::Update(AliStats *stats)\n{\n UpdateLocal(stats);\n UpdateRDBMS(stats);\n UpdateAliEn(stats);\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateLocal(AliStats *stats)\n{\n \/\/ Add stats object to database.\n\n if (!stats || !fRunDB) return;\n\n TDirectory *ds = gDirectory;\n fRunDB->cd();\n\n char sname[64];\n char *s = (char*)strrchr(stats->GetFileName(), '\/');\n if (s) {\n s++;\n strcpy(sname, s);\n } else\n strcpy(sname, stats->GetFileName());\n s = strchr(sname, '.');\n if (s) *s = 0;\n\n stats->Write(sname);\n\n ds->cd();\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateRDBMS(AliStats *stats)\n{\n \/\/ Add stats object to central MySQL DB.\n\n if (!stats || !fRDBMS) return;\n\n char sql[4096];\n char bt[25], et[25];\n\n strcpy(bt, stats->GetBeginTime().AsSQLString());\n strcpy(et, stats->GetEndTime().AsSQLString());\n\n sprintf(sql, \"INSERT INTO mdc%dcatalog VALUES (0, '%s', %d, \"\n \"%d, %d, %d, %d, %d, %d, %.2f, '%s', '%s', '%s')\", AliRawDB::kMDC,\n stats->GetFileName(), (int)stats->GetFileSize(), stats->GetEvents(),\n stats->GetFirstRun(), stats->GetFirstEvent(), stats->GetLastRun(),\n stats->GetLastEvent(), stats->GetCompressionMode(),\n stats->GetCompressionFactor(), stats->GetFilterState() ? \"on\" : \"off\",\n bt, et);\n\n \/\/ open connection to MySQL server on pcsalo\n TSQLServer *db = TSQLServer::Connect(\"mysql:\/\/pcsalo.cern.ch\/mdc\", \"alice\", \"amdc\");\n\n if (!db || db->IsZombie()) {\n Error(\"UpdateRDBMS\", \"failed to connect to MySQL server on pcsalo\");\n printf(\"%s\\n\", sql);\n delete db;\n return;\n }\n\n TSQLResult *res = db->Query(sql);\n\n if (!res) {\n Error(\"UpdateRDBMS\", Form(\"insert into mdc%dcatalog failed\", AliRawDB::kMDC));\n printf(\"%s\\n\", sql);\n }\n\n delete res;\n delete db;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateAliEn(AliStats *stats)\n{\n \/\/ Record file in AliEn catalog.\n\n if (!stats || fAlienHost.IsNull()) return;\n\n TGrid *g = TGrid::Connect(fAlienHost, \"\");\n\n \/\/Protection in case root is compiled without AliEn support\n if(!g) {\n Error(\"UpdateAliEn\", \"ROOT compiled without AliEn support\");\n return;\n }\n\n TString lfn = fAlienDir;\n TDatime dt;\n\n \/\/ make a subdirectory for each day\n lfn += \"\/adc-\";\n lfn += dt.GetDate();\n\n \/\/ check if directory exists, if not create it\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,0,0)\n Grid_ResultHandle_t res = 0;\n if (!(res = g->OpenDir(lfn))) {\n \/\/ directory does not exist, create it\n if (g->Mkdir(lfn) == -1) {\n Error(\"UpdateAliEn\", \"cannot create directory %s\", lfn.Data());\n lfn = fAlienDir;\n }\n }\n if (res) g->CloseResult(res);\n#else\n Error(\"UpdateAliEn\", \"needs to be ported to new TGrid\");\n#endif\n\n lfn += \"\/\";\n lfn += gSystem->BaseName(stats->GetFileName());\n\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,0,0)\n Int_t result = g->AddFile(lfn, stats->GetFileName(),\n\t\t\t (int)stats->GetFileSize());\n if (result == -1) {\n Error(\"UpdateAliEn\", \"error adding file to AliEn catalog\");\n printf(\"AliEn: AddFile(%s, %s, %d)\\n\", lfn.Data(), stats->GetFileName(),\n (int)stats->GetFileSize());\n }\n#else\n Error(\"UpdateAliEn\", \"needs to be ported to new TGrid\");\n#endif\n\n delete g;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::Close()\n{\n \/\/ Close run database.\n\n if (fRunDB) fRunDB->Close();\n delete fRunDB;\n}\n\n<commit_msg>Removing obsolete call to a SQL database<commit_after>\/\/ @(#)alimdc:$Name$:$Id$\n\/\/ Author: Fons Rademakers 26\/11\/99\n\n\/**************************************************************************\n * Copyright(c) 1998-2003, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ AliRunDB \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <TSystem.h>\n#include <TFile.h>\n#include <TString.h>\n#include <TDatime.h>\n#include <TSQLServer.h>\n#include <TSQLResult.h>\n#include <TGrid.h>\n\n#include \"AliStats.h\"\n#include \"AliRawDB.h\"\n\n#include \"AliRunDB.h\"\n\n\nClassImp(AliRunDB)\n\n\n\/\/______________________________________________________________________________\nAliRunDB::AliRunDB(const char* localFS, Bool_t rdbms,\n\t\t const char* alienHost, const char* alienDir) :\n fRunDB(NULL),\n fRDBMS(rdbms),\n fAlienHost(alienHost),\n fAlienDir(alienDir)\n{\n \/\/ Open run database, and get or create tree.\n\n if (!localFS) return;\n\n \/\/ Get hostname\n char hostname[64], filename[64];\n\n \/\/ check that fs exists (crude check fails if fs is a file)\n gSystem->MakeDirectory(localFS);\n\n \/\/ Put wide read-write permissions\n if(gSystem->Chmod(localFS,1023)) {\n Error(\"AliRunDB\",\"can't set permissions for run DB directory\");\n return;\n }\n\n strcpy(hostname, gSystem->HostName());\n\n char *s;\n if ((s = strchr(hostname, '.')))\n *s = 0;\n\n sprintf(filename, \"%s\/%s_rundb.root\", localFS, hostname);\n\n if (!gSystem->AccessPathName(filename, kFileExists))\n fRunDB = new TFile(filename, \"UPDATE\");\n else\n fRunDB = new TFile(filename, \"CREATE\", Form(\"ALICE MDC%d Run DB\", AliRawDB::kMDC));\n\n \/\/ Put wide read-write permissions\n if(gSystem->Chmod(filename,438)) {\n Error(\"AliRunDB\",\"can't set permissions for run DB file\");\n return;\n }\n}\n\n\/\/______________________________________________________________________________\nAliRunDB::AliRunDB(const AliRunDB& runDB): TObject(runDB)\n{\n\/\/ copy constructor\n\n Fatal(\"AliRunDB\", \"copy constructor not implemented\");\n}\n\n\/\/______________________________________________________________________________\nAliRunDB& AliRunDB::operator = (const AliRunDB& \/*runDB*\/)\n{\n\/\/ assignment operator\n\n Fatal(\"operator =\", \"assignment operator not implemented\");\n return *this;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::Update(AliStats *stats)\n{\n UpdateLocal(stats);\n UpdateRDBMS(stats);\n UpdateAliEn(stats);\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateLocal(AliStats *stats)\n{\n \/\/ Add stats object to database.\n\n if (!stats || !fRunDB) return;\n\n TDirectory *ds = gDirectory;\n fRunDB->cd();\n\n char sname[64];\n char *s = (char*)strrchr(stats->GetFileName(), '\/');\n if (s) {\n s++;\n strcpy(sname, s);\n } else\n strcpy(sname, stats->GetFileName());\n s = strchr(sname, '.');\n if (s) *s = 0;\n\n stats->Write(sname);\n\n ds->cd();\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateRDBMS(AliStats *stats)\n{\n \/\/ Add stats object to central MySQL DB.\n\n if (!stats || !fRDBMS) return;\n\n char sql[4096];\n char bt[25], et[25];\n\n strcpy(bt, stats->GetBeginTime().AsSQLString());\n strcpy(et, stats->GetEndTime().AsSQLString());\n\n sprintf(sql, \"INSERT INTO mdc%dcatalog VALUES (0, '%s', %d, \"\n \"%d, %d, %d, %d, %d, %d, %.2f, '%s', '%s', '%s')\", AliRawDB::kMDC,\n stats->GetFileName(), (int)stats->GetFileSize(), stats->GetEvents(),\n stats->GetFirstRun(), stats->GetFirstEvent(), stats->GetLastRun(),\n stats->GetLastEvent(), stats->GetCompressionMode(),\n stats->GetCompressionFactor(), stats->GetFilterState() ? \"on\" : \"off\",\n bt, et);\n\n \/\/ open connection to MySQL server on pcsalo\n\/\/ TSQLServer *db = TSQLServer::Connect(\"mysql:\/\/pcsalo.cern.ch\/mdc\", \"alice\", \"amdc\");\n\n\/\/ if (!db || db->IsZombie()) {\n\/\/ Error(\"UpdateRDBMS\", \"failed to connect to MySQL server on pcsalo\");\n\/\/ printf(\"%s\\n\", sql);\n\/\/ delete db;\n\/\/ return;\n\/\/ }\n\n\/\/ TSQLResult *res = db->Query(sql);\n\n\/\/ if (!res) {\n\/\/ Error(\"UpdateRDBMS\", Form(\"insert into mdc%dcatalog failed\", AliRawDB::kMDC));\n\/\/ printf(\"%s\\n\", sql);\n\/\/ }\n\n\/\/ delete res;\n\/\/ delete db;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::UpdateAliEn(AliStats *stats)\n{\n \/\/ Record file in AliEn catalog.\n\n if (!stats || fAlienHost.IsNull()) return;\n\n TGrid *g = TGrid::Connect(fAlienHost, \"\");\n\n \/\/Protection in case root is compiled without AliEn support\n if(!g) {\n Error(\"UpdateAliEn\", \"ROOT compiled without AliEn support\");\n return;\n }\n\n TString lfn = fAlienDir;\n TDatime dt;\n\n \/\/ make a subdirectory for each day\n lfn += \"\/adc-\";\n lfn += dt.GetDate();\n\n \/\/ check if directory exists, if not create it\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,0,0)\n Grid_ResultHandle_t res = 0;\n if (!(res = g->OpenDir(lfn))) {\n \/\/ directory does not exist, create it\n if (g->Mkdir(lfn) == -1) {\n Error(\"UpdateAliEn\", \"cannot create directory %s\", lfn.Data());\n lfn = fAlienDir;\n }\n }\n if (res) g->CloseResult(res);\n#else\n Error(\"UpdateAliEn\", \"needs to be ported to new TGrid\");\n#endif\n\n lfn += \"\/\";\n lfn += gSystem->BaseName(stats->GetFileName());\n\n#if ROOT_VERSION_CODE < ROOT_VERSION(5,0,0)\n Int_t result = g->AddFile(lfn, stats->GetFileName(),\n\t\t\t (int)stats->GetFileSize());\n if (result == -1) {\n Error(\"UpdateAliEn\", \"error adding file to AliEn catalog\");\n printf(\"AliEn: AddFile(%s, %s, %d)\\n\", lfn.Data(), stats->GetFileName(),\n (int)stats->GetFileSize());\n }\n#else\n Error(\"UpdateAliEn\", \"needs to be ported to new TGrid\");\n#endif\n\n delete g;\n}\n\n\/\/______________________________________________________________________________\nvoid AliRunDB::Close()\n{\n \/\/ Close run database.\n\n if (fRunDB) fRunDB->Close();\n delete fRunDB;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iomanip>\n\n#include <Windows.h>\n#include <ShlObj.h>\n\n#include <conio.h> \/\/ _getch()\n\n#include \"Osiris.hpp\"\n\n#include \"Modules\/OsirisModules.hpp\"\n\n#include <Utils\/Utils.hpp>\n\n#include <Ausar\\Ausar.hpp>\n\n#include <winnt.h>\n#include <winternl.h>\n\n#include <vector>\n#include <iterator>\n\nOsiris::Osiris()\n{\n wchar_t Buffer[MAX_PATH] = { 0 };\n SHGetSpecialFolderPathW(nullptr, Buffer, CSIDL_PROFILE, false);\n\n std::wstring UserFolder(Buffer);\n UserFolder += L\"\\\\AppData\\\\Local\\\\Packages\\\\Microsoft.Halo5Forge_8wekyb3d8bbwe\\\\LocalState\\\\Log.txt\";\n\n Util::Log::Instance()->SetFile(UserFolder);\n\n LOG << \"Osiris\" << \"---- \";\n LOG << '[' << __DATE__ << \" : \" << __TIME__ << ']' << std::endl;\n LOG << \"\\t-Wunkolo (Wunkolo@gmail.com)\\n\";\n LOG << std::wstring(80, '-') << std::endl;\n\n LOG << std::hex << std::uppercase << std::setfill(L'0')\n << \"Process Base: 0x\" << Util::Process::Base() << std::endl;\n LOG << \"Osiris Thread ID: 0x\" << Util::Thread::GetCurrentThreadId() << std::endl;\n LOG << \"Osiris Base: 0x\" << Util::Process::GetModuleBase(\"Osiris.dll\") << std::endl;\n\n const Ausar::ThreadTable *Table;\n\n Table = Util::Process::GetModuleBase()(0x58CA4B0).Point<Ausar::ThreadTable>();\n\n \/\/for( size_t i = 0; i < 64; i++ )\n \/\/{\n \/\/ if( Table->Entries[i].Active == 0 )\n \/\/ {\n \/\/ continue;\n \/\/ }\n \/\/ LOG << \"Thread Name: \" << reinterpret_cast<const char*>(Table->Entries[i].ThreadName) << std::endl;\n \/\/ LOG << \"Thread ID: \" << Table->Entries[i].ThreadID << std::endl;\n \/\/}\n\n uint64_t ThreadID = Table->GetThreadIDByName(\"MAIN\");\n\n LOG << \"Main Thread ID: \" << ThreadID << std::endl;\n\n typedef enum _THREADINFOCLASS {\n ThreadBasicInformation = 0,\n } THREADINFOCLASS;\n\n typedef LONG KPRIORITY;\n\n typedef struct _CLIENT_ID {\n HANDLE UniqueProcess;\n HANDLE UniqueThread;\n } CLIENT_ID;\n typedef CLIENT_ID *PCLIENT_ID;\n\n typedef struct _THREAD_BASIC_INFORMATION\n {\n NTSTATUS ExitStatus;\n PVOID TebBaseAddress;\n CLIENT_ID ClientId;\n KAFFINITY AffinityMask;\n KPRIORITY Priority;\n KPRIORITY BasePriority;\n } THREAD_BASIC_INFORMATION, *PTHREAD_BASIC_INFORMATION;\n\n typedef NTSTATUS(WINAPI *InfoThreadProc)(HANDLE, LONG, PVOID, ULONG, PULONG);\n\n HANDLE ThreadHandle = OpenThread(\n THREAD_ALL_ACCESS,\n false,\n static_cast<DWORD>(ThreadID)\n );\n\n Util::Pointer TEB(nullptr);\n\n InfoThreadProc NtQueryInformationThread = (InfoThreadProc)GetProcAddress(GetModuleHandleW(L\"ntdll.dll\"), \"NtQueryInformationThread\");\n\n THREAD_BASIC_INFORMATION ThreadInfo = { 0 };\n\n NTSTATUS ntStatus = NtQueryInformationThread(\n ThreadHandle,\n ThreadBasicInformation,\n &ThreadInfo,\n sizeof(THREAD_BASIC_INFORMATION),\n nullptr\n );\n\n LOG << ResumeThread(ThreadHandle) << std::endl;\n\n CloseHandle(ThreadHandle);\n\n TEB = Util::Pointer(ThreadInfo.TebBaseAddress)[0x58][0];\n\n LOG << \"Physics Constants: \" << TEB[0x2D30] << std::endl;\n LOG << \"DOF Globals: \" << TEB[0x49B0] << std::endl;\n LOG << \"DOF Data: \" << TEB[0x1310] << std::endl;\n LOG << \"Director globals: \" << TEB[0x198] << std::endl;\n LOG << \"Hue saturation control: \" << TEB[0x2FF8] << std::endl;\n LOG << \"Game engine globals: \" << TEB[0x13A8] << std::endl;\n LOG << \"Local Game engine globals: \" << TEB[0x13B0] << std::endl;\n LOG << \"Game engine render globals: \" << TEB[0x13B8] << std::endl;\n LOG << \"Game time globals: \" << TEB[0x12A8] << std::endl;\n LOG << \"Composer globals: \" << TEB[0x1C8] << std::endl;\n LOG << \"Fp weapons: \" << TEB[0x1260] << std::endl;\n LOG << \"Player Focus: \" << TEB[0x1320] << std::endl;\n LOG << \"Player Control Globals: \" << TEB[0x1340] << std::endl;\n LOG << \"Player Control Globals Deter.: \" << TEB[0x1348] << std::endl;\n LOG << \"Player Globals: \" << TEB[0x1370] << std::endl;\n\n LOG << \"AI Globals: \" << TEB[0x2E40] << std::endl;\n LOG << \"AI Player state Globals: \" << TEB[0x2E18] << std::endl;\n\n LOG << \"Interaction ripples: \" << TEB[0x4960] << std::endl;\n\n LOG << \"Rasterizer: \" << TEB[0x49A0] << std::endl;\n LOG << \"Render game globals: \" << TEB[0x49A8] << std::endl;\n LOG << \"fp orientations: \" << TEB[0x4A10] << std::endl;\n\n LOG << \"Objects: \" << TEB[0x4B18] << std::endl;\n LOG << \"Object name list: \" << TEB[0x4B20] << std::endl;\n LOG << \"Object placement globals: \" << TEB[0x4B58] << std::endl;\n LOG << \"Object globals: \" << TEB[0x4C08] << std::endl;\n LOG << \"orientations: \" << TEB[0x110] << std::endl;\n\n \/\/ Push Commands\n \/\/PushModule<Research>(\"research\");\n \/\/PushModule<Player>(\"player\");\n}\n\nOsiris::~Osiris()\n{\n}\n\nvoid Osiris::Tick(const std::chrono::high_resolution_clock::duration &DeltaTime)\n{\n for( std::pair<std::string, std::shared_ptr<OsirisModule>> Command : Commands )\n {\n if( Command.second )\n {\n Command.second->Tick(DeltaTime);\n }\n }\n}<commit_msg>Added more globals to draft, fixed tls name<commit_after>#include <iostream>\n#include <iomanip>\n\n#include <Windows.h>\n#include <ShlObj.h>\n\n#include <conio.h> \/\/ _getch()\n\n#include \"Osiris.hpp\"\n\n#include \"Modules\/OsirisModules.hpp\"\n\n#include <Utils\/Utils.hpp>\n\n#include <Ausar\\Ausar.hpp>\n\n#include <winnt.h>\n#include <winternl.h>\n\n#include <vector>\n#include <iterator>\n\nOsiris::Osiris()\n{\n wchar_t Buffer[MAX_PATH] = { 0 };\n SHGetSpecialFolderPathW(nullptr, Buffer, CSIDL_PROFILE, false);\n\n std::wstring UserFolder(Buffer);\n UserFolder += L\"\\\\AppData\\\\Local\\\\Packages\\\\Microsoft.Halo5Forge_8wekyb3d8bbwe\\\\LocalState\\\\Log.txt\";\n\n Util::Log::Instance()->SetFile(UserFolder);\n\n LOG << \"Osiris\" << \"---- \";\n LOG << '[' << __DATE__ << \" : \" << __TIME__ << ']' << std::endl;\n LOG << \"\\t-Wunkolo (Wunkolo@gmail.com)\\n\";\n LOG << std::wstring(80, '-') << std::endl;\n\n LOG << std::hex << std::uppercase << std::setfill(L'0')\n << \"Process Base: 0x\" << Util::Process::Base() << std::endl;\n LOG << \"Osiris Thread ID: 0x\" << Util::Thread::GetCurrentThreadId() << std::endl;\n LOG << \"Osiris Base: 0x\" << Util::Process::GetModuleBase(\"Osiris.dll\") << std::endl;\n\n const Ausar::ThreadTable *Table;\n\n Table = Util::Process::GetModuleBase()(0x58CA4B0).Point<Ausar::ThreadTable>();\n\n \/\/for( size_t i = 0; i < 64; i++ )\n \/\/{\n \/\/ if( Table->Entries[i].Active == 0 )\n \/\/ {\n \/\/ continue;\n \/\/ }\n \/\/ LOG << \"Thread Name: \" << reinterpret_cast<const char*>(Table->Entries[i].ThreadName) << std::endl;\n \/\/ LOG << \"Thread ID: \" << Table->Entries[i].ThreadID << std::endl;\n \/\/}\n\n uint64_t ThreadID = Table->GetThreadIDByName(\"MAIN\");\n\n LOG << \"Main Thread ID: \" << ThreadID << std::endl;\n\n typedef enum _THREADINFOCLASS {\n ThreadBasicInformation = 0,\n } THREADINFOCLASS;\n\n typedef LONG KPRIORITY;\n\n typedef struct _CLIENT_ID {\n HANDLE UniqueProcess;\n HANDLE UniqueThread;\n } CLIENT_ID;\n typedef CLIENT_ID *PCLIENT_ID;\n\n typedef struct _THREAD_BASIC_INFORMATION\n {\n NTSTATUS ExitStatus;\n PVOID TebBaseAddress;\n CLIENT_ID ClientId;\n KAFFINITY AffinityMask;\n KPRIORITY Priority;\n KPRIORITY BasePriority;\n } THREAD_BASIC_INFORMATION, *PTHREAD_BASIC_INFORMATION;\n\n typedef NTSTATUS(WINAPI *InfoThreadProc)(HANDLE, LONG, PVOID, ULONG, PULONG);\n\n HANDLE ThreadHandle = OpenThread(\n THREAD_ALL_ACCESS,\n false,\n static_cast<DWORD>(ThreadID)\n );\n\n Util::Pointer Tls(nullptr);\n\n InfoThreadProc NtQueryInformationThread = (InfoThreadProc)GetProcAddress(GetModuleHandleW(L\"ntdll.dll\"), \"NtQueryInformationThread\");\n\n THREAD_BASIC_INFORMATION ThreadInfo = { 0 };\n\n NTSTATUS ntStatus = NtQueryInformationThread(\n ThreadHandle,\n ThreadBasicInformation,\n &ThreadInfo,\n sizeof(THREAD_BASIC_INFORMATION),\n nullptr\n );\n\n LOG << ResumeThread(ThreadHandle) << std::endl;\n\n CloseHandle(ThreadHandle);\n\n Tls = Util::Pointer(ThreadInfo.TebBaseAddress)[0x58][0];\n\n LOG << \"Physics Constants: \" << Tls[0x2D30] << std::endl;\n LOG << \"userGraphicsScalingOptions: \" << Tls[0x3050] << std::endl;\n\n LOG << \"random math: \" << Tls[0x2C38] << std::endl;\n LOG << \"incident globals: \" << Tls[0x2C38] << std::endl;\n\n LOG << \"DOF Globals: \" << Tls[0x49B0] << std::endl;\n LOG << \"DOF Data: \" << Tls[0x1310] << std::endl;\n LOG << \"Director globals: \" << Tls[0x198] << std::endl;\n LOG << \"Hue saturation control: \" << Tls[0x2FF8] << std::endl;\n LOG << \"Game engine globals: \" << Tls[0x13A8] << std::endl;\n LOG << \"Local Game engine globals: \" << Tls[0x13B0] << std::endl;\n LOG << \"Game engine render globals: \" << Tls[0x13B8] << std::endl;\n LOG << \"Game time globals: \" << Tls[0x12A8] << std::endl;\n LOG << \"Composer globals: \" << Tls[0x1C8] << std::endl;\n LOG << \"Fp weapons: \" << Tls[0x1260] << std::endl;\n\n LOG << \"Player Focus: \" << Tls[0x1320] << std::endl;\n LOG << \"Player Control Globals: \" << Tls[0x1340] << std::endl;\n LOG << \"Player Control Globals Deter.: \" << Tls[0x1348] << std::endl;\n LOG << \"Player Globals: \" << Tls[0x1370] << std::endl;\n LOG << \"Player Mapping Globals: \" << Tls[0x1350] << std::endl;\n\n LOG << \"AI Globals: \" << Tls[0x2E40] << std::endl;\n LOG << \"AI Player state Globals: \" << Tls[0x2E18] << std::endl;\n\n LOG << \"Interaction ripples: \" << Tls[0x4960] << std::endl;\n\n LOG << \"Rasterizer: \" << Tls[0x49A0] << std::endl;\n LOG << \"Render game globals: \" << Tls[0x49A8] << std::endl;\n LOG << \"Render texture globals: \" << Tls[0x3058] << std::endl;\n LOG << \"atmosphere override settings: \" << Tls[0x4998] << std::endl;\n LOG << \"fp orientations: \" << Tls[0x4A10] << std::endl;\n\n LOG << \"Objects: \" << Tls[0x4B18] << std::endl;\n LOG << \"Object name list: \" << Tls[0x4B20] << std::endl;\n LOG << \"Object placement globals: \" << Tls[0x4B58] << std::endl;\n LOG << \"Object globals: \" << Tls[0x4C08] << std::endl;\n LOG << \"orientations: \" << Tls[0x110] << std::endl;\n\n \/\/ Push Commands\n \/\/PushModule<Research>(\"research\");\n \/\/PushModule<Player>(\"player\");\n}\n\nOsiris::~Osiris()\n{\n}\n\nvoid Osiris::Tick(const std::chrono::high_resolution_clock::duration &DeltaTime)\n{\n for( std::pair<std::string, std::shared_ptr<OsirisModule>> Command : Commands )\n {\n if( Command.second )\n {\n Command.second->Tick(DeltaTime);\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * MT_RobotFrameBase.cpp\n *\n * Created by Daniel Swain on 1\/4\/10.\n *\n *\/\n\n#include \"MT_RobotFrameBase.h\"\n\n#include \"MT\/MT_Robot\/robot\/SteeredRobot.h\"\n\nMT_RobotFrameBase::MT_RobotFrameBase(wxFrame* parent,\n wxWindowID id,\n const wxString& title,\n const wxPoint& pos, \n const wxSize& size, \n long style)\n : MT_TrackerFrameBase(parent, id, title, pos, size, style),\n m_pJoyStickFrame(NULL),\n m_bAutoIdentify(false),\n m_bRobotsIdentified(false),\n m_pRobotControlFrame(NULL), \n m_Robots(),\n m_pTrackedObjects(NULL)\n{\n}\n\nMT_RobotFrameBase::~MT_RobotFrameBase()\n{\n\n}\n\nvoid MT_RobotFrameBase::handleCommandLineArguments(int argc, wxChar** argv)\n{\n MT_TrackerFrameBase::handleCommandLineArguments(argc, argv);\n}\n\nvoid MT_RobotFrameBase::handleOpenWithFile(const wxString& filename)\n{\n MT_TrackerFrameBase::handleOpenWithFile(filename);\n}\n\nbool MT_RobotFrameBase::doKeyboardCallback(wxKeyEvent& event)\n{\n bool tresult = MT_TrackerFrameBase::doKeyboardCallback(event);\n return tresult && MT_DO_BASE_KEY;\n}\n\nbool MT_RobotFrameBase::doMouseCallback(wxMouseEvent& event, double viewport_x, double viewport_y)\n{\n bool tresult = MT_TrackerFrameBase::doMouseCallback(event, viewport_x, viewport_y);\n return tresult && MT_DO_BASE_MOUSE;\n}\n\n\nvoid MT_RobotFrameBase::onMenuRobotsConnect(wxCommandEvent& event)\n{\n MT_RobotConnectDialog* dlg = new MT_RobotConnectDialog(&m_Robots, NULL, this);\n registerDialogForXML(dlg);\n dlg->Show(true);\n}\n\nvoid MT_RobotFrameBase::onMenuRobotsJoystick(wxCommandEvent& event)\n{\n m_pJoyStickFrame->Show(true);\n registerDialogForXML(m_pJoyStickFrame);\n m_pJoyStickFrame->EnableEvents();\n}\n\nvoid MT_RobotFrameBase::onMenuRobotsCommand(wxCommandEvent& event)\n{\n MT_RobotCommandDialog* dlg = new MT_RobotCommandDialog(&m_Robots, this);\n registerDialogForXML(dlg);\n dlg->Show(true);\n}\n\nvoid MT_RobotFrameBase::readUserXML()\n{\n MT_TrackerFrameBase::readUserXML();\n\n MT_ReadRobotXML(&m_Robots, &m_XMLSettingsFile, false);\n\n}\n\nvoid MT_RobotFrameBase::writeUserXML()\n{\n MT_WriteRobotXML(&m_Robots, \n &m_XMLSettingsFile,\n false);\n MT_TrackerFrameBase::writeUserXML();\n}\n\nvoid MT_RobotFrameBase::initUserData()\n{\n MT_RobotFrameBase::initRobotFrameData();\n MT_TrackerFrameBase::initUserData();\n}\n\nvoid MT_RobotFrameBase::initRobotFrameData()\n{\n m_pJoyStickFrame = new MT_JoyStickFrame(this, &m_Robots);\n}\n\nvoid MT_RobotFrameBase::createUserMenus(wxMenuBar* menubar)\n{\n wxMenu* robot_menu = new wxMenu;\n makeRobotMenu(robot_menu);\n menubar->Append(robot_menu, wxT(\"Robots\"));\n\n \/* adds tracker menu *\/\n MT_TrackerFrameBase::createUserMenus(menubar);\n}\n\nvoid MT_RobotFrameBase::makeRobotMenu(wxMenu* robot_menu)\n{\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_CONNECT, wxT(\"&Connections...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_CONNECT, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsConnect));\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_JOYSTICK, wxT(\"&Joystick Control...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_JOYSTICK, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsJoystick));\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_COMMAND, wxT(\"&Send Command...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_COMMAND, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsCommand));\n}\n\nMT_ControlFrameBase* MT_RobotFrameBase::createControlDialog()\n{\n m_pRobotControlFrame = new MT_RobotControlFrameBase(this);\n m_pTrackerControlFrame = (MT_TrackerControlFrameBase *) m_pRobotControlFrame; \n return (MT_ControlFrameBase*) m_pRobotControlFrame;\n}\n\nvoid MT_RobotFrameBase::doUserTimedEvents()\n{\n\n}\n\nvoid MT_RobotFrameBase::doUserStep()\n{\n \/* do tracking first, then control *\/\n MT_TrackerFrameBase::doUserStep();\n\n if(m_bAutoIdentify)\n {\n doAutoIdentify();\n }\n\n updateRobotStatesFromTracker();\n\n doControl();\n}\n\nvoid MT_RobotFrameBase::updateRobotStatesFromTracker()\n{\n int ti;\n for(unsigned int i = 0; i < MT_MAX_NROBOTS; i++)\n {\n ti = m_Robots.TrackingIndex[i];\n if(ti != MT_NOT_TRACKED)\n {\n m_Robots.UpdateState(i, \n m_pTrackedObjects->getX(ti), \n m_pTrackedObjects->getY(ti), \n m_pTrackedObjects->getOrientation(ti));\n }\n }\n}\n\nvoid MT_RobotFrameBase::doControl()\n{\n doUserControl();\n}\n\nbool MT_RobotFrameBase::startTracking()\n{\n bool now_tracking = MT_TrackerFrameBase::startTracking();\n\n if(now_tracking && m_pTracker)\n {\n \/* grab the tracked objects from the tracker *\/\n m_pTrackedObjects = m_pTracker->getTrackedObjects();\n }\n\n return now_tracking;\n}\n\nbool MT_RobotFrameBase::toggleAutoIdentify()\n{\n\n \/\/ it only makes sense to do any of this if the tracker is up and running\n if(getIsTracking())\n {\n\n \/\/ toggle the value of the auto id flag \n if(m_bAutoIdentify)\n {\n m_bAutoIdentify = false;\n \/\/ stop the auto-id process\n doAutoIdentify(false);\n }\n else\n {\n m_bAutoIdentify = true;\n m_bRobotsIdentified = false;\n }\n\n }\n\n return m_bAutoIdentify;\n\n}\n\nvoid MT_RobotFrameBase::doAutoIdentify(bool DoAutoID)\n{\n\n \/* we'll want to know if this has changed *\/\n static int RobotToID = MT_NONE_AVAILABLE;\n\n \/* if we're flagged to stop, then stop whichever robot may be moving for autoID *\/\n if(!DoAutoID)\n {\n if(RobotToID != MT_NONE_AVAILABLE)\n {\n m_Robots.GetRobot(RobotToID)->SafeStop();\n }\n RobotToID = MT_NONE_AVAILABLE;\n return;\n }\n\n \/* first, make sure there's a robot to identify *\/\n int newRobotToID = m_Robots.GetNextUntracked();\n\n if(newRobotToID == MT_NONE_AVAILABLE)\n {\n \/* none available! *\/\n RobotToID = MT_NONE_AVAILABLE;\n m_bRobotsIdentified = true;\n m_bAutoIdentify = false;\n \/* change the label on the control frame *\/\n m_pRobotControlFrame->onAutoIDToggle(false);\n return;\n }\n\n \/* if the robots have been previously identified, reset the IDs *\/\n if(m_bRobotsIdentified)\n {\n m_Robots.ClearTrackingIDs();\n }\n\n \/* OK, now we've got a robot to identify\n if it's new, we want to start it moving slowly *\/\n if(newRobotToID != RobotToID)\n {\n \/* remember which robot for next time *\/\n RobotToID = newRobotToID;\n \/* start it moving *\/\n m_Robots.GetRobot(RobotToID)->AutoIDResponse();\n }\n\n \/* loop through tracked objects (until match is found) *\/\n for(unsigned int i = 0; i < m_pTrackedObjects->getNumObjects(); i++)\n {\n \/* if this TO has been in 5 or more frames and not attached to a robot\n and is moving *\/\n if( (m_pTrackedObjects->getNumConsecutiveFrames(i) > 5) && \n (m_pTrackedObjects->getRobotIndex(i) == MT_NO_ROBOT) &&\n (m_pTrackedObjects->getIsMoving(i)) )\n {\n \/* stop the robot *\/\n m_Robots.GetRobot(RobotToID)->SafeStop();\n \/* attach the current robot *\/\n m_pTrackedObjects->setRobotIndex(i, RobotToID);\n \/* assign the TO ID to the robot *\/\n m_Robots.TrackingIndex[RobotToID] = i;\n }\n }\n\n}\n\nvoid MT_RobotFrameBase::doUserQuit()\n{\n MT_TrackerFrameBase::doUserQuit();\n}\n\nvoid MT_RobotFrameBase::doUserGLDrawing()\n{\n MT_TrackerFrameBase::doUserGLDrawing();\n}\n\nMT_RobotBase* MT_RobotFrameBase::getNewRobot(const char* config, const char* name)\n{\n MT_RobotBase* thebot = new MT_SteeredRobot(config, name);\n ReadDataGroupFromXML(m_XMLSettingsFile, thebot->GetParameters());\n return thebot;\n}\n\nMT_RobotControlFrameBase::MT_RobotControlFrameBase(MT_RobotFrameBase* parent, \n const int Buttons,\n const wxPoint& pos, \n const wxSize& size)\n : MT_TrackerControlFrameBase(parent, Buttons, pos, size)\n{\n m_pParentRobotFrame = parent;\n}\n\nvoid MT_RobotControlFrameBase::doMasterInitialization()\n{\n MT_TrackerControlFrameBase::doMasterInitialization();\n}\n\nunsigned int MT_RobotControlFrameBase::createButtons(wxBoxSizer* pSizer, wxPanel* pPanel)\n{\n unsigned int nbuttons = MT_TrackerControlFrameBase::createButtons(pSizer, pPanel);\n\n if(getButtons() & MT_RCF_AUTOID)\n {\n m_pButtonAutoIdentify = new wxButton(pPanel, \n MT_RCF_ID_BUTTON_AUTOIDENTIFY, \n wxT(\"AutoID Robots\"));\n pSizer->Add(m_pButtonAutoIdentify, 0, wxALL | wxCENTER, 10);\n m_pButtonAutoIdentify->Disable();\n Connect(MT_RCF_ID_BUTTON_AUTOIDENTIFY, \n wxEVT_COMMAND_BUTTON_CLICKED,\n wxCommandEventHandler(\n MT_RobotControlFrameBase::onButtonAutoIdentifyPressed));\n nbuttons++;\n }\n return nbuttons;\n}\n\nvoid MT_RobotControlFrameBase::onButtonAutoIdentifyPressed(wxCommandEvent& WXUNUSED(event))\n{\n onAutoIDToggle(m_pParentRobotFrame->toggleAutoIdentify());\n}\n\nvoid MT_RobotControlFrameBase::onAutoIDToggle(bool AutoID)\n{\n\n if(AutoID == false)\n {\n m_pButtonAutoIdentify->SetLabel(wxT(\"Reset Auto Identify\"));\n }\n else\n {\n m_pButtonAutoIdentify->SetLabel(wxT(\"Stop Auto Identify\"));\n }\n\n}\n\nvoid MT_RobotControlFrameBase::onTrackingToggle(bool tracking)\n{\n\n MT_TrackerControlFrameBase::onTrackingToggle(tracking);\n\n if(m_pButtonAutoIdentify)\n {\n if(tracking)\n {\n m_pButtonAutoIdentify->Enable();\n }\n else\n {\n m_pButtonAutoIdentify->Disable();\n }\n }\n\n}\n\nvoid MT_RobotControlFrameBase::enableButtons()\n{\n if(m_pButtonAutoIdentify)\n {\n m_pButtonAutoIdentify->Enable();\n }\n MT_TrackerControlFrameBase::enableButtons();\n}\n<commit_msg>Fixed initialization of MT_RobotFrameBase<commit_after>\/*\n * MT_RobotFrameBase.cpp\n *\n * Created by Daniel Swain on 1\/4\/10.\n *\n *\/\n\n#include \"MT_RobotFrameBase.h\"\n\n#include \"MT\/MT_Robot\/robot\/SteeredRobot.h\"\n\nMT_RobotFrameBase::MT_RobotFrameBase(wxFrame* parent,\n wxWindowID id,\n const wxString& title,\n const wxPoint& pos, \n const wxSize& size, \n long style)\n : MT_TrackerFrameBase(parent, id, title, pos, size, style),\n m_pJoyStickFrame(NULL),\n m_bAutoIdentify(false),\n m_bRobotsIdentified(false),\n m_pRobotControlFrame(NULL), \n m_Robots(),\n m_pTrackedObjects(NULL)\n{\n}\n\nMT_RobotFrameBase::~MT_RobotFrameBase()\n{\n\n}\n\nvoid MT_RobotFrameBase::handleCommandLineArguments(int argc, wxChar** argv)\n{\n MT_TrackerFrameBase::handleCommandLineArguments(argc, argv);\n}\n\nvoid MT_RobotFrameBase::handleOpenWithFile(const wxString& filename)\n{\n MT_TrackerFrameBase::handleOpenWithFile(filename);\n}\n\nbool MT_RobotFrameBase::doKeyboardCallback(wxKeyEvent& event)\n{\n bool tresult = MT_TrackerFrameBase::doKeyboardCallback(event);\n return tresult && MT_DO_BASE_KEY;\n}\n\nbool MT_RobotFrameBase::doMouseCallback(wxMouseEvent& event, double viewport_x, double viewport_y)\n{\n bool tresult = MT_TrackerFrameBase::doMouseCallback(event, viewport_x, viewport_y);\n return tresult && MT_DO_BASE_MOUSE;\n}\n\n\nvoid MT_RobotFrameBase::onMenuRobotsConnect(wxCommandEvent& event)\n{\n MT_RobotConnectDialog* dlg = new MT_RobotConnectDialog(&m_Robots, NULL, this);\n registerDialogForXML(dlg);\n dlg->Show(true);\n}\n\nvoid MT_RobotFrameBase::onMenuRobotsJoystick(wxCommandEvent& event)\n{\n m_pJoyStickFrame->Show(true);\n registerDialogForXML(m_pJoyStickFrame);\n m_pJoyStickFrame->EnableEvents();\n}\n\nvoid MT_RobotFrameBase::onMenuRobotsCommand(wxCommandEvent& event)\n{\n MT_RobotCommandDialog* dlg = new MT_RobotCommandDialog(&m_Robots, this);\n registerDialogForXML(dlg);\n dlg->Show(true);\n}\n\nvoid MT_RobotFrameBase::readUserXML()\n{\n MT_TrackerFrameBase::readUserXML();\n\n MT_ReadRobotXML(&m_Robots, &m_XMLSettingsFile, false);\n\n}\n\nvoid MT_RobotFrameBase::writeUserXML()\n{\n MT_WriteRobotXML(&m_Robots, \n &m_XMLSettingsFile,\n false);\n MT_TrackerFrameBase::writeUserXML();\n}\n\nvoid MT_RobotFrameBase::initUserData()\n{\n MT_RobotFrameBase::initRobotFrameData();\n MT_TrackerFrameBase::initUserData();\n}\n\nvoid MT_RobotFrameBase::initRobotFrameData()\n{\n m_pJoyStickFrame = new MT_JoyStickFrame(this, &m_Robots);\n}\n\nvoid MT_RobotFrameBase::createUserMenus(wxMenuBar* menubar)\n{\n wxMenu* robot_menu = new wxMenu;\n makeRobotMenu(robot_menu);\n menubar->Append(robot_menu, wxT(\"Robots\"));\n\n \/* adds tracker menu *\/\n MT_TrackerFrameBase::createUserMenus(menubar);\n}\n\nvoid MT_RobotFrameBase::makeRobotMenu(wxMenu* robot_menu)\n{\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_CONNECT, wxT(\"&Connections...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_CONNECT, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsConnect));\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_JOYSTICK, wxT(\"&Joystick Control...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_JOYSTICK, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsJoystick));\n robot_menu->Append(MT_RFB_ID_MENU_ROBOTS_COMMAND, wxT(\"&Send Command...\"));\n Connect(MT_RFB_ID_MENU_ROBOTS_COMMAND, \n wxEVT_COMMAND_MENU_SELECTED, \n wxCommandEventHandler(MT_RobotFrameBase::onMenuRobotsCommand));\n}\n\nMT_ControlFrameBase* MT_RobotFrameBase::createControlDialog()\n{\n m_pRobotControlFrame = new MT_RobotControlFrameBase(this);\n m_pTrackerControlFrame = (MT_TrackerControlFrameBase *) m_pRobotControlFrame; \n return (MT_ControlFrameBase*) m_pRobotControlFrame;\n}\n\nvoid MT_RobotFrameBase::doUserTimedEvents()\n{\n\n}\n\nvoid MT_RobotFrameBase::doUserStep()\n{\n \/* do tracking first, then control *\/\n MT_TrackerFrameBase::doUserStep();\n\n if(m_bAutoIdentify)\n {\n doAutoIdentify();\n }\n\n updateRobotStatesFromTracker();\n\n doControl();\n}\n\nvoid MT_RobotFrameBase::updateRobotStatesFromTracker()\n{\n int ti;\n for(unsigned int i = 0; i < MT_MAX_NROBOTS; i++)\n {\n ti = m_Robots.TrackingIndex[i];\n if(ti != MT_NOT_TRACKED)\n {\n m_Robots.UpdateState(i, \n m_pTrackedObjects->getX(ti), \n m_pTrackedObjects->getY(ti), \n m_pTrackedObjects->getOrientation(ti));\n }\n }\n}\n\nvoid MT_RobotFrameBase::doControl()\n{\n doUserControl();\n}\n\nbool MT_RobotFrameBase::startTracking()\n{\n bool now_tracking = MT_TrackerFrameBase::startTracking();\n\n if(now_tracking && m_pTracker)\n {\n \/* grab the tracked objects from the tracker *\/\n m_pTrackedObjects = m_pTracker->getTrackedObjects();\n }\n\n return now_tracking;\n}\n\nbool MT_RobotFrameBase::toggleAutoIdentify()\n{\n\n \/\/ it only makes sense to do any of this if the tracker is up and running\n if(getIsTracking())\n {\n\n \/\/ toggle the value of the auto id flag \n if(m_bAutoIdentify)\n {\n m_bAutoIdentify = false;\n \/\/ stop the auto-id process\n doAutoIdentify(false);\n }\n else\n {\n m_bAutoIdentify = true;\n m_bRobotsIdentified = false;\n }\n\n }\n\n return m_bAutoIdentify;\n\n}\n\nvoid MT_RobotFrameBase::doAutoIdentify(bool DoAutoID)\n{\n\n \/* we'll want to know if this has changed *\/\n static int RobotToID = MT_NONE_AVAILABLE;\n\n \/* if we're flagged to stop, then stop whichever robot may be moving for autoID *\/\n if(!DoAutoID)\n {\n if(RobotToID != MT_NONE_AVAILABLE)\n {\n m_Robots.GetRobot(RobotToID)->SafeStop();\n }\n RobotToID = MT_NONE_AVAILABLE;\n return;\n }\n\n \/* first, make sure there's a robot to identify *\/\n int newRobotToID = m_Robots.GetNextUntracked();\n\n if(newRobotToID == MT_NONE_AVAILABLE)\n {\n \/* none available! *\/\n RobotToID = MT_NONE_AVAILABLE;\n m_bRobotsIdentified = true;\n m_bAutoIdentify = false;\n \/* change the label on the control frame *\/\n m_pRobotControlFrame->onAutoIDToggle(false);\n return;\n }\n\n \/* if the robots have been previously identified, reset the IDs *\/\n if(m_bRobotsIdentified)\n {\n m_Robots.ClearTrackingIDs();\n }\n\n \/* OK, now we've got a robot to identify\n if it's new, we want to start it moving slowly *\/\n if(newRobotToID != RobotToID)\n {\n \/* remember which robot for next time *\/\n RobotToID = newRobotToID;\n \/* start it moving *\/\n m_Robots.GetRobot(RobotToID)->AutoIDResponse();\n }\n\n \/* loop through tracked objects (until match is found) *\/\n for(unsigned int i = 0; i < m_pTrackedObjects->getNumObjects(); i++)\n {\n \/* if this TO has been in 5 or more frames and not attached to a robot\n and is moving *\/\n if( (m_pTrackedObjects->getNumConsecutiveFrames(i) > 5) && \n (m_pTrackedObjects->getRobotIndex(i) == MT_NO_ROBOT) &&\n (m_pTrackedObjects->getIsMoving(i)) )\n {\n \/* stop the robot *\/\n m_Robots.GetRobot(RobotToID)->SafeStop();\n \/* attach the current robot *\/\n m_pTrackedObjects->setRobotIndex(i, RobotToID);\n \/* assign the TO ID to the robot *\/\n m_Robots.TrackingIndex[RobotToID] = i;\n }\n }\n\n}\n\nvoid MT_RobotFrameBase::doUserQuit()\n{\n MT_TrackerFrameBase::doUserQuit();\n}\n\nvoid MT_RobotFrameBase::doUserGLDrawing()\n{\n MT_TrackerFrameBase::doUserGLDrawing();\n}\n\nMT_RobotBase* MT_RobotFrameBase::getNewRobot(const char* config, const char* name)\n{\n MT_RobotBase* thebot = new MT_SteeredRobot(config, name);\n ReadDataGroupFromXML(m_XMLSettingsFile, thebot->GetParameters());\n return thebot;\n}\n\nMT_RobotControlFrameBase::MT_RobotControlFrameBase(MT_RobotFrameBase* parent, \n const int Buttons,\n const wxPoint& pos, \n const wxSize& size)\n : MT_TrackerControlFrameBase(parent, Buttons, pos, size),\n m_pButtonAutoIdentify(NULL)\n{\n m_pParentRobotFrame = parent;\n}\n\nvoid MT_RobotControlFrameBase::doMasterInitialization()\n{\n MT_TrackerControlFrameBase::doMasterInitialization();\n}\n\nunsigned int MT_RobotControlFrameBase::createButtons(wxBoxSizer* pSizer, wxPanel* pPanel)\n{\n unsigned int nbuttons = MT_TrackerControlFrameBase::createButtons(pSizer, pPanel);\n\n if(getButtons() & MT_RCF_AUTOID)\n {\n m_pButtonAutoIdentify = new wxButton(pPanel, \n MT_RCF_ID_BUTTON_AUTOIDENTIFY, \n wxT(\"AutoID Robots\"));\n pSizer->Add(m_pButtonAutoIdentify, 0, wxALL | wxCENTER, 10);\n m_pButtonAutoIdentify->Disable();\n Connect(MT_RCF_ID_BUTTON_AUTOIDENTIFY, \n wxEVT_COMMAND_BUTTON_CLICKED,\n wxCommandEventHandler(\n MT_RobotControlFrameBase::onButtonAutoIdentifyPressed));\n nbuttons++;\n }\n return nbuttons;\n}\n\nvoid MT_RobotControlFrameBase::onButtonAutoIdentifyPressed(wxCommandEvent& WXUNUSED(event))\n{\n onAutoIDToggle(m_pParentRobotFrame->toggleAutoIdentify());\n}\n\nvoid MT_RobotControlFrameBase::onAutoIDToggle(bool AutoID)\n{\n\n if(AutoID == false)\n {\n m_pButtonAutoIdentify->SetLabel(wxT(\"Reset Auto Identify\"));\n }\n else\n {\n m_pButtonAutoIdentify->SetLabel(wxT(\"Stop Auto Identify\"));\n }\n\n}\n\nvoid MT_RobotControlFrameBase::onTrackingToggle(bool tracking)\n{\n\n MT_TrackerControlFrameBase::onTrackingToggle(tracking);\n\n if(m_pButtonAutoIdentify)\n {\n if(tracking)\n {\n m_pButtonAutoIdentify->Enable();\n }\n else\n {\n m_pButtonAutoIdentify->Disable();\n }\n }\n\n}\n\nvoid MT_RobotControlFrameBase::enableButtons()\n{\n if(m_pButtonAutoIdentify)\n {\n m_pButtonAutoIdentify->Enable();\n }\n MT_TrackerControlFrameBase::enableButtons();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <config.h>\n#include \"righthandside_assembler.hh\"\n\n#include <dune\/multiscale\/tools\/misc.hh>\n#include <dune\/multiscale\/hmm\/cell_problem_numbering.hh>\n#include <dune\/multiscale\/hmm\/cell_problem_solver.hh>\n#include <dune\/multiscale\/msfem\/localproblems\/localsolutionmanager.hh>\n#include <dune\/multiscale\/common\/dirichletconstraints.hh>\n#include <dune\/multiscale\/msfem\/localproblems\/subgrid-list.hh>\n#include <dune\/multiscale\/problems\/selector.hh>\n#include <dune\/stuff\/fem\/functions\/checks.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n for (const auto& entity : rhsVector.space()) {\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n const auto numDofs = elementOfRHS.numDofs();\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ the return values:\n RangeType f_x;\n std::vector<RangeType> phi_x(numDofs);\n \/\/ to save: A \\nabla PHI_H * \\nabla phi_h;\n const auto det = geometry.integrationElement(quadrature.point(quadraturePoint));\n\n f.evaluate(geometry.global(quadrature.point(quadraturePoint)), f_x);\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x[i]);\n }\n }\n }\n}\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, const Dune::Multiscale::CommonTraits::DiffusionType &A, const Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &dirichlet_extension, const Dune::Multiscale::CommonTraits::NeumannBCType &neumann_bc, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n\n for (const auto& entity : rhsVector.space()) {\n\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n\n const int numDofs = elementOfRHS.numDofs();\n\n std::vector<RangeType> phi_x(numDofs);\n \/\/ gradient of base function and gradient of old_u_H\n std::vector<JacobianRangeType> grad_phi_x(numDofs);\n\n const auto loc_dirichlet_extension = dirichlet_extension.localFunction(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n\n const auto& lagrangePointSet = rhsVector.space().lagrangePointSet(entity);\n\n for (const auto& intersection : DSC::intersectionRange(rhsVector.space().gridPart(), entity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const auto face = intersection.indexInInside();\n const auto faceQuadrature = make_quadrature(intersection, rhsVector.space(), quadratureOrder);\n const auto numFaceQuadraturePoints = faceQuadrature.nop();\n\n for (auto faceQuadraturePoint : DSC::valueRange(numFaceQuadraturePoints)) {\n baseSet.evaluateAll(faceQuadrature[faceQuadraturePoint], phi_x);\n baseSet.jacobianAll(faceQuadrature[faceQuadraturePoint], grad_phi_x);\n\n const auto local_point_entity = faceQuadrature.point(faceQuadraturePoint);\n const auto global_point = geometry.global(local_point_entity);\n const auto local_point_face = intersection.geometry().local(global_point);\n\n RangeType neumann_value(0.0);\n neumann_bc.evaluate(global_point, neumann_value);\n\n const double face_weight = intersection.geometry().integrationElement(local_point_face) *\n faceQuadrature.weight(faceQuadraturePoint);\n\n for (const auto& lp : DSC::lagrangePointSetRange(lagrangePointSet, face)) {\n elementOfRHS[lp] += neumann_value * face_weight * phi_x[lp];\n }\n }\n }\n }\n\n \/\/ the return values:\n RangeType f_x;\n\n JacobianRangeType gradient_dirichlet_extension;\n JacobianRangeType diffusive_flux_in_gradient_dirichlet_extension;\n\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_point = quadrature.point(quadraturePoint);\n const auto global_point = geometry.global(local_point);\n\n const double weight = geometry.integrationElement(local_point) * quadrature.weight(quadraturePoint);\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(global_point, f_x);\n \/\/ evaluate the current base function at the current quadrature point and save its value in 'z':\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x); \/\/ i = i'te Basisfunktion;\n \/\/ evaluate the gradient of the current base function at the current quadrature point and save its value in\n \/\/ 'returnGradient':\n baseSet.jacobianAll(quadrature[quadraturePoint], grad_phi_x);\n \/\/ get gradient of dirichlet extension:\n loc_dirichlet_extension.jacobian(quadrature[quadraturePoint], gradient_dirichlet_extension);\n A.diffusiveFlux(global_point, gradient_dirichlet_extension, diffusive_flux_in_gradient_dirichlet_extension);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += weight * (f_x * phi_x[i]);\n elementOfRHS[i] -= weight * (diffusive_flux_in_gradient_dirichlet_extension[0] * grad_phi_x[i][0]);\n }\n }\n }\n}\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble_for_MsFEM_symmetric(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::MsFEM::MacroMicroGridSpecifier &specifier, Dune::Multiscale::MsFEM::SubGridList &subgrid_list, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n\n \/\/ gather some problem data\n auto diffusionPtr = Problem::getDiffusion();\n const auto& diffusion = *diffusionPtr;\n auto neumannDataPtr = Problem::getNeumannData();\n const auto& neumannData = *neumannDataPtr;\n\n DiscreteFunctionType dirichletExtension(\"Dirichlet Extension\", specifier.fineSpace());\n dirichletExtension.clear();\n Dune::Multiscale::projectDirichletValues(rhsVector.space(), dirichletExtension);\n\n \/\/ set rhsVector to zero:\n rhsVector.clear();\n const auto& coarseGridLeafIndexSet = specifier.coarseSpace().gridPart().grid().leafIndexSet();\n RangeType f_x;\n for (const auto& coarse_grid_entity : rhsVector.space()) {\n const auto coarseEntityIndex = coarseGridLeafIndexSet.index(coarse_grid_entity);\n\n const auto& coarseGeometry = coarse_grid_entity.geometry();\n auto rhsLocalFunction = rhsVector.localFunction(coarse_grid_entity);\n const auto numLocalBaseFunctions = rhsLocalFunction.numDofs();\n const auto& coarse_grid_baseSet = specifier.coarseSpace().basisFunctionSet(coarse_grid_entity);\n\n \/\/ --------- add standard contribution of right hand side -------------------------\n {\n \/\/!\\TODO warum +5 ???\n const auto quadrature = make_quadrature(coarse_grid_entity, rhsVector.space(), quadratureOrder + 5);\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n const auto numQuadraturePoints = quadrature.nop();\n for (size_t quadraturePoint = 0; quadraturePoint < numQuadraturePoints; ++quadraturePoint) {\n const double det = coarseGeometry.integrationElement(quadrature.point(quadraturePoint));\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(coarseGeometry.global(quadrature.point(quadraturePoint)), f_x);\n coarse_grid_baseSet.evaluateAll(quadrature[quadraturePoint], phi_x_vec);\n for (int i = 0; i < numLocalBaseFunctions; ++i) {\n rhsLocalFunction[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x_vec[i]);\n }\n }\n }\n \/\/ ----------------------------------------------------------------------------------\n\n \/\/ --------- add corrector contribution of right hand side --------------------------\n \/\/ Load local solutions\n MsFEM::LocalSolutionManager localSolutionManager(coarse_grid_entity, subgrid_list, specifier);\n localSolutionManager.loadLocalSolutions();\n auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n \/\/ iterator for the micro grid ( grid for the reference element T_0 )\n const auto& subGrid = subgrid_list.getSubGrid(coarse_grid_entity);\n for (const auto& localEntity : DSC::viewRange(subGrid.leafView())) {\n const auto& hostCell = subGrid.template getHostEntity<0>(localEntity);\n const auto enclosingCoarseCellIndex = subgrid_list.getEnclosingMacroCellIndex(hostCell);\n auto dirichletExtensionLF = dirichletExtension.localFunction(*hostCell);\n if (enclosingCoarseCellIndex == coarseEntityIndex) {\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature =\n make_quadrature(localEntity, localSolutionManager.getLocalDiscreteFunctionSpace());\n\n \/\/ evaluate all local solutions and their jacobians in all quadrature points\n std::vector<std::vector<RangeType>> allLocalSolutionEvaluations(\n localSolutions.size(), std::vector<RangeType>(localQuadrature.nop(), 0.0));\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionJacobians(\n localSolutions.size(), std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(localSolutions.size())) {\n auto localFunction = localSolutions[lsNum]->localFunction(localEntity);\n \/\/ this evaluates the local solutions in all quadrature points...\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n \/\/ while this automatically evaluates their jacobians.\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionJacobians[lsNum]);\n\n const auto& subGridPart = localSolutionManager.getSubGridPart();\n for (const auto& intersection : DSC::intersectionRange(subGridPart.grid().leafView(), localEntity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const int orderOfIntegrand = (polynomialOrder - 1) + 2 * (polynomialOrder + 1);\n const int quadOrder = std::ceil((orderOfIntegrand + 1) \/ 2);\n \/\/ get type of face quadrature. Is done in this scope because Patricks methods use another type.\n const auto faceQuad = make_quadrature(intersection, localSolutions[lsNum]->space(), quadOrder);\n RangeType neumannValue(0.0);\n const auto numQuadPoints = faceQuad.nop();\n \/\/ loop over all quadrature points\n\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n std::vector<RangeType> localSolutionOnFace(numLocalBaseFunctions);\n localFunction.evaluateQuadrature(faceQuad, localSolutionOnFace);\n\n for (unsigned int iqP = 0; iqP < numQuadPoints; ++iqP) {\n \/\/ get local coordinate of quadrature point\n const auto& xLocal = faceQuad.localPoint(iqP);\n const auto& faceGeometry = intersection.geometry();\n\n \/\/ the following does not work because subgrid does not implement geometryInInside()\n \/\/ const auto& insideGeometry = intersection.geometryInInside();\n \/\/ const typename FaceQuadratureType::CoordinateType& xInInside = insideGeometry.global(xLocal);\n \/\/ therefore, we have to do stupid things:\n const auto& xGlobal = faceGeometry.global(xLocal);\n const auto& xInCoarseLocal = coarse_grid_entity.geometry().local(xGlobal);\n const double factor = faceGeometry.integrationElement(xLocal) * faceQuad.weight(iqP);\n\n neumannData.evaluate(xGlobal, neumannValue);\n coarse_grid_baseSet.evaluateAll(xInCoarseLocal, phi_x_vec);\n for (auto i : DSC::valueRange(numLocalBaseFunctions)) {\n assert((long long)i < (long long)phi_x_vec.size());\n assert(iqP < localSolutionOnFace.size());\n rhsLocalFunction[i] += factor * (neumannValue * (phi_x_vec[i] + localSolutionOnFace[iqP]));\n }\n }\n }\n }\n }\n\n const auto& localGeometry = localEntity.geometry();\n RangeType corrector_phi_x;\n for (size_t qP = 0; qP < localQuadrature.nop(); ++qP) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& quadPoint = localQuadrature.point(qP);\n const auto quadPointGlobal = localGeometry.global(quadPoint);\n\n const double quadWeight = localQuadrature.weight(qP) * localGeometry.integrationElement(quadPoint);\n\n for (int coarseBF = 0; coarseBF < numLocalBaseFunctions; ++coarseBF) {\n JacobianRangeType diffusive_flux(0.0);\n\n \/\/ evaluate gradient of basis function\n const auto quadPointLocalInCoarse = coarseGeometry.local(quadPointGlobal);\n std::vector<JacobianRangeType> gradient_Phi_vec(numLocalBaseFunctions);\n coarse_grid_baseSet.jacobianAll(quadPointLocalInCoarse, gradient_Phi_vec);\n\n JacobianRangeType reconstructionGradPhi(gradient_Phi_vec[coarseBF]);\n\n if (specifier.simplexCoarseGrid()) {\n assert(localSolutions.size() == GridSelector::dimgrid + localSolutionManager.numBoundaryCorrectors());\n DUNE_THROW(NotImplemented, \"Boundary values are not implemented for simplex grids yet!\");\n } else {\n assert(localSolutions.size() == numLocalBaseFunctions + localSolutionManager.numBoundaryCorrectors());\n \/\/ local corrector for coarse base func\n corrector_phi_x = allLocalSolutionEvaluations[coarseBF][qP];\n \/\/ element part of boundary conditions\n JacobianRangeType directionOfFlux(0.0);\n \/\/! @attention At this point we assume, that the quadrature points on the subgrid and hostgrid\n \/\/! are the same (dirichletExtensionLF is a localfunction on the hostgrid, quadPoint stems from\n \/\/! a quadrature on the subgrid)!!\n dirichletExtensionLF.jacobian(quadPoint, directionOfFlux);\n \/\/ add dirichlet-corrector\n directionOfFlux += allLocalSolutionJacobians[numLocalBaseFunctions + 1][qP];\n \/\/ subtract neumann-corrector\n \/\/ directionOfFlux -= allLocalSolutionJacobians[numLocalBaseFunctions][qP];\n\n diffusion.diffusiveFlux(quadPointGlobal, directionOfFlux, diffusive_flux);\n reconstructionGradPhi += allLocalSolutionJacobians[coarseBF][qP];\n }\n f.evaluate(quadPointGlobal, f_x);\n double val = quadWeight * (f_x * corrector_phi_x);\n rhsLocalFunction[coarseBF] += val;\n val = quadWeight * (diffusive_flux[0] * reconstructionGradPhi[0]);\n rhsLocalFunction[coarseBF] -= val;\n }\n }\n }\n }\n }\n\n \/\/ set dirichlet dofs to zero\n Dune::Multiscale::getConstraintsCoarse(rhsVector.space()).setValue(0.0, rhsVector);\n}\n<commit_msg>Removed \"debug\" code<commit_after>#include <config.h>\n#include \"righthandside_assembler.hh\"\n\n#include <dune\/multiscale\/tools\/misc.hh>\n#include <dune\/multiscale\/hmm\/cell_problem_numbering.hh>\n#include <dune\/multiscale\/hmm\/cell_problem_solver.hh>\n#include <dune\/multiscale\/msfem\/localproblems\/localsolutionmanager.hh>\n#include <dune\/multiscale\/common\/dirichletconstraints.hh>\n#include <dune\/multiscale\/msfem\/localproblems\/subgrid-list.hh>\n#include <dune\/multiscale\/problems\/selector.hh>\n#include <dune\/stuff\/fem\/functions\/checks.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/functions\/interfaces.hh>\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n for (const auto& entity : rhsVector.space()) {\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n const auto numDofs = elementOfRHS.numDofs();\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ the return values:\n RangeType f_x;\n std::vector<RangeType> phi_x(numDofs);\n \/\/ to save: A \\nabla PHI_H * \\nabla phi_h;\n const auto det = geometry.integrationElement(quadrature.point(quadraturePoint));\n\n f.evaluate(geometry.global(quadrature.point(quadraturePoint)), f_x);\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x[i]);\n }\n }\n }\n}\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, const Dune::Multiscale::CommonTraits::DiffusionType &A, const Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &dirichlet_extension, const Dune::Multiscale::CommonTraits::NeumannBCType &neumann_bc, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n\n for (const auto& entity : rhsVector.space()) {\n\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n\n const int numDofs = elementOfRHS.numDofs();\n\n std::vector<RangeType> phi_x(numDofs);\n \/\/ gradient of base function and gradient of old_u_H\n std::vector<JacobianRangeType> grad_phi_x(numDofs);\n\n const auto loc_dirichlet_extension = dirichlet_extension.localFunction(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n\n const auto& lagrangePointSet = rhsVector.space().lagrangePointSet(entity);\n\n for (const auto& intersection : DSC::intersectionRange(rhsVector.space().gridPart(), entity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const auto face = intersection.indexInInside();\n const auto faceQuadrature = make_quadrature(intersection, rhsVector.space(), quadratureOrder);\n const auto numFaceQuadraturePoints = faceQuadrature.nop();\n\n for (auto faceQuadraturePoint : DSC::valueRange(numFaceQuadraturePoints)) {\n baseSet.evaluateAll(faceQuadrature[faceQuadraturePoint], phi_x);\n baseSet.jacobianAll(faceQuadrature[faceQuadraturePoint], grad_phi_x);\n\n const auto local_point_entity = faceQuadrature.point(faceQuadraturePoint);\n const auto global_point = geometry.global(local_point_entity);\n const auto local_point_face = intersection.geometry().local(global_point);\n\n RangeType neumann_value(0.0);\n neumann_bc.evaluate(global_point, neumann_value);\n\n const double face_weight = intersection.geometry().integrationElement(local_point_face) *\n faceQuadrature.weight(faceQuadraturePoint);\n\n for (const auto& lp : DSC::lagrangePointSetRange(lagrangePointSet, face)) {\n elementOfRHS[lp] += neumann_value * face_weight * phi_x[lp];\n }\n }\n }\n }\n\n \/\/ the return values:\n RangeType f_x;\n\n JacobianRangeType gradient_dirichlet_extension;\n JacobianRangeType diffusive_flux_in_gradient_dirichlet_extension;\n\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_point = quadrature.point(quadraturePoint);\n const auto global_point = geometry.global(local_point);\n\n const double weight = geometry.integrationElement(local_point) * quadrature.weight(quadraturePoint);\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(global_point, f_x);\n \/\/ evaluate the current base function at the current quadrature point and save its value in 'z':\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x); \/\/ i = i'te Basisfunktion;\n \/\/ evaluate the gradient of the current base function at the current quadrature point and save its value in\n \/\/ 'returnGradient':\n baseSet.jacobianAll(quadrature[quadraturePoint], grad_phi_x);\n \/\/ get gradient of dirichlet extension:\n loc_dirichlet_extension.jacobian(quadrature[quadraturePoint], gradient_dirichlet_extension);\n A.diffusiveFlux(global_point, gradient_dirichlet_extension, diffusive_flux_in_gradient_dirichlet_extension);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += weight * (f_x * phi_x[i]);\n elementOfRHS[i] -= weight * (diffusive_flux_in_gradient_dirichlet_extension[0] * grad_phi_x[i][0]);\n }\n }\n }\n}\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble_for_MsFEM_symmetric(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::MsFEM::MacroMicroGridSpecifier &specifier, Dune::Multiscale::MsFEM::SubGridList &subgrid_list, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n\n \/\/ gather some problem data\n auto diffusionPtr = Problem::getDiffusion();\n const auto& diffusion = *diffusionPtr;\n auto neumannDataPtr = Problem::getNeumannData();\n const auto& neumannData = *neumannDataPtr;\n\n DiscreteFunctionType dirichletExtension(\"Dirichlet Extension\", specifier.fineSpace());\n dirichletExtension.clear();\n Dune::Multiscale::projectDirichletValues(rhsVector.space(), dirichletExtension);\n\n \/\/ set rhsVector to zero:\n rhsVector.clear();\n const auto& coarseGridLeafIndexSet = specifier.coarseSpace().gridPart().grid().leafIndexSet();\n RangeType f_x;\n for (const auto& coarse_grid_entity : rhsVector.space()) {\n const auto coarseEntityIndex = coarseGridLeafIndexSet.index(coarse_grid_entity);\n\n const auto& coarseGeometry = coarse_grid_entity.geometry();\n auto rhsLocalFunction = rhsVector.localFunction(coarse_grid_entity);\n const auto numLocalBaseFunctions = rhsLocalFunction.numDofs();\n const auto& coarse_grid_baseSet = specifier.coarseSpace().basisFunctionSet(coarse_grid_entity);\n\n \/\/ --------- add standard contribution of right hand side -------------------------\n {\n const auto quadrature = make_quadrature(coarse_grid_entity, rhsVector.space(), quadratureOrder);\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n const auto numQuadraturePoints = quadrature.nop();\n for (size_t quadraturePoint = 0; quadraturePoint < numQuadraturePoints; ++quadraturePoint) {\n const double det = coarseGeometry.integrationElement(quadrature.point(quadraturePoint));\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(coarseGeometry.global(quadrature.point(quadraturePoint)), f_x);\n coarse_grid_baseSet.evaluateAll(quadrature[quadraturePoint], phi_x_vec);\n for (int i = 0; i < numLocalBaseFunctions; ++i) {\n rhsLocalFunction[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x_vec[i]);\n }\n }\n }\n \/\/ ----------------------------------------------------------------------------------\n\n \/\/ --------- add corrector contribution of right hand side --------------------------\n \/\/ Load local solutions\n MsFEM::LocalSolutionManager localSolutionManager(coarse_grid_entity, subgrid_list, specifier);\n localSolutionManager.loadLocalSolutions();\n auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n \/\/ iterator for the micro grid ( grid for the reference element T_0 )\n const auto& subGrid = subgrid_list.getSubGrid(coarse_grid_entity);\n for (const auto& localEntity : DSC::viewRange(subGrid.leafView())) {\n const auto& hostCell = subGrid.template getHostEntity<0>(localEntity);\n const auto enclosingCoarseCellIndex = subgrid_list.getEnclosingMacroCellIndex(hostCell);\n auto dirichletExtensionLF = dirichletExtension.localFunction(*hostCell);\n if (enclosingCoarseCellIndex == coarseEntityIndex) {\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature =\n make_quadrature(localEntity, localSolutionManager.getLocalDiscreteFunctionSpace());\n\n \/\/ evaluate all local solutions and their jacobians in all quadrature points\n std::vector<std::vector<RangeType>> allLocalSolutionEvaluations(\n localSolutions.size(), std::vector<RangeType>(localQuadrature.nop(), 0.0));\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionJacobians(\n localSolutions.size(), std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(localSolutions.size())) {\n auto localFunction = localSolutions[lsNum]->localFunction(localEntity);\n \/\/ this evaluates the local solutions in all quadrature points...\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n \/\/ while this automatically evaluates their jacobians.\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionJacobians[lsNum]);\n\n const auto& subGridPart = localSolutionManager.getSubGridPart();\n for (const auto& intersection : DSC::intersectionRange(subGridPart.grid().leafView(), localEntity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const int orderOfIntegrand = (polynomialOrder - 1) + 2 * (polynomialOrder + 1);\n const int quadOrder = std::ceil((orderOfIntegrand + 1) \/ 2);\n \/\/ get type of face quadrature. Is done in this scope because Patricks methods use another type.\n const auto faceQuad = make_quadrature(intersection, localSolutions[lsNum]->space(), quadOrder);\n RangeType neumannValue(0.0);\n const auto numQuadPoints = faceQuad.nop();\n \/\/ loop over all quadrature points\n\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n std::vector<RangeType> localSolutionOnFace(numLocalBaseFunctions);\n localFunction.evaluateQuadrature(faceQuad, localSolutionOnFace);\n\n for (unsigned int iqP = 0; iqP < numQuadPoints; ++iqP) {\n \/\/ get local coordinate of quadrature point\n const auto& xLocal = faceQuad.localPoint(iqP);\n const auto& faceGeometry = intersection.geometry();\n\n \/\/ the following does not work because subgrid does not implement geometryInInside()\n \/\/ const auto& insideGeometry = intersection.geometryInInside();\n \/\/ const typename FaceQuadratureType::CoordinateType& xInInside = insideGeometry.global(xLocal);\n \/\/ therefore, we have to do stupid things:\n const auto& xGlobal = faceGeometry.global(xLocal);\n const auto& xInCoarseLocal = coarse_grid_entity.geometry().local(xGlobal);\n const double factor = faceGeometry.integrationElement(xLocal) * faceQuad.weight(iqP);\n\n neumannData.evaluate(xGlobal, neumannValue);\n coarse_grid_baseSet.evaluateAll(xInCoarseLocal, phi_x_vec);\n for (auto i : DSC::valueRange(numLocalBaseFunctions)) {\n assert((long long)i < (long long)phi_x_vec.size());\n assert(iqP < localSolutionOnFace.size());\n rhsLocalFunction[i] += factor * (neumannValue * (phi_x_vec[i] + localSolutionOnFace[iqP]));\n }\n }\n }\n }\n }\n\n const auto& localGeometry = localEntity.geometry();\n RangeType corrector_phi_x;\n for (size_t qP = 0; qP < localQuadrature.nop(); ++qP) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& quadPoint = localQuadrature.point(qP);\n const auto quadPointGlobal = localGeometry.global(quadPoint);\n\n const double quadWeight = localQuadrature.weight(qP) * localGeometry.integrationElement(quadPoint);\n\n for (int coarseBF = 0; coarseBF < numLocalBaseFunctions; ++coarseBF) {\n JacobianRangeType diffusive_flux(0.0);\n\n \/\/ evaluate gradient of basis function\n const auto quadPointLocalInCoarse = coarseGeometry.local(quadPointGlobal);\n std::vector<JacobianRangeType> gradient_Phi_vec(numLocalBaseFunctions);\n coarse_grid_baseSet.jacobianAll(quadPointLocalInCoarse, gradient_Phi_vec);\n\n JacobianRangeType reconstructionGradPhi(gradient_Phi_vec[coarseBF]);\n\n if (specifier.simplexCoarseGrid()) {\n assert(localSolutions.size() == GridSelector::dimgrid + localSolutionManager.numBoundaryCorrectors());\n DUNE_THROW(NotImplemented, \"Boundary values are not implemented for simplex grids yet!\");\n } else {\n assert(localSolutions.size() == numLocalBaseFunctions + localSolutionManager.numBoundaryCorrectors());\n \/\/ local corrector for coarse base func\n corrector_phi_x = allLocalSolutionEvaluations[coarseBF][qP];\n \/\/ element part of boundary conditions\n JacobianRangeType directionOfFlux(0.0);\n \/\/! @attention At this point we assume, that the quadrature points on the subgrid and hostgrid\n \/\/! are the same (dirichletExtensionLF is a localfunction on the hostgrid, quadPoint stems from\n \/\/! a quadrature on the subgrid)!!\n dirichletExtensionLF.jacobian(quadPoint, directionOfFlux);\n \/\/ add dirichlet-corrector\n directionOfFlux += allLocalSolutionJacobians[numLocalBaseFunctions + 1][qP];\n \/\/ subtract neumann-corrector\n \/\/ directionOfFlux -= allLocalSolutionJacobians[numLocalBaseFunctions][qP];\n\n diffusion.diffusiveFlux(quadPointGlobal, directionOfFlux, diffusive_flux);\n reconstructionGradPhi += allLocalSolutionJacobians[coarseBF][qP];\n }\n f.evaluate(quadPointGlobal, f_x);\n double val = quadWeight * (f_x * corrector_phi_x);\n rhsLocalFunction[coarseBF] += val;\n val = quadWeight * (diffusive_flux[0] * reconstructionGradPhi[0]);\n rhsLocalFunction[coarseBF] -= val;\n }\n }\n }\n }\n }\n\n \/\/ set dirichlet dofs to zero\n Dune::Multiscale::getConstraintsCoarse(rhsVector.space()).setValue(0.0, rhsVector);\n}\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 2014 ETH Zurich\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n** following conditions are met:\n**\n** * Redistributions of source code must retain the above copyright notice, this list of conditions and the following\n** disclaimer.\n** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n** following disclaimer in the documentation and\/or other materials provided with the distribution.\n** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n** derived from this software without specific prior written permission.\n**\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n**\n***********************************************************************************************************************\/\n\n#include \"DebugConnector.h\"\n\n#include \"Protocol.h\"\n#include \"Reply.h\"\n#include \"Command.h\"\n\n#include \"reply\/VersionInfo.h\"\n\nnamespace OODebug {\n\nDebugConnector::DebugConnector()\n{\n\tQObject::connect(tcpSocket_, static_cast<void (QTcpSocket::*)(QAbstractSocket::SocketError)>(&QTcpSocket::error),\n\t\t\t\t\t\t this, &DebugConnector::handleSocketError);\n}\n\nDebugConnector::~DebugConnector()\n{\n\ttcpSocket_->abort();\n\tdelete tcpSocket_;\n}\n\nvoid DebugConnector::connect(QString vmHostName, int vmHostPort)\n{\n\tif (tcpSocket_->isOpen())\n\t\ttcpSocket_->close();\n\t\/\/ The connection setup is handled here:\n\t\/\/ First when we are connected we have to send the handshake. For receiving the hanshake reply,\n\t\/\/ we use a dedicated function which disconnects itself and connects the actual read function\n\t\/\/ to the readyRead slot. In this way we don't have the handshake handling in the normal read function.\n\tQObject::connect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::readHandshake);\n\tQObject::connect(tcpSocket_, &QTcpSocket::connected, this, &DebugConnector::sendHandshake);\n\ttcpSocket_->connectToHost(vmHostName, vmHostPort);\n}\n\nvoid DebugConnector::handleSocketError(QAbstractSocket::SocketError socketError)\n{\n\tqDebug() << \"ERROR: \" << socketError;\n\tqWarning() << socketError;\n}\n\nvoid DebugConnector::read()\n{\n\tQByteArray read =\ttcpSocket_->readAll();\n\t\/\/ If we still have a part of a packet add it here.\n\tif (!incompleteData_.isEmpty()) {\n\t\tread.prepend(incompleteData_);\n\t\tincompleteData_ = QByteArray();\n\t}\n\t\/\/ If we haven't read enough retry later\n\tif (read.size() < int(sizeof(qint32))) {\n\t\tincompleteData_ = read;\n\t\treturn;\n\t}\n\t\/\/ check if the packet is complete\n\tQDataStream inStream(read);\n\tqint32 len;\n\tinStream >> len;\n\tif (len > read.length()) {\n\t\tincompleteData_ = read;\n\t\treturn;\n\t}\n\t\/\/ We have read the whole data for this message so handle it.\n\tqint32 id;\n\tinStream >> id;\n\thandlePacket(id, read);\n}\n\nvoid DebugConnector::sendCommand(Command& c, HandleFunction handler)\n{\n\thandlingMap_[c.id()] = handler;\n\tQByteArray raw;\n\tQDataStream stream(&raw, QIODevice::ReadWrite);\n\tstream << c;\n\ttcpSocket_->write(raw);\n}\n\nvoid DebugConnector::readHandshake()\n{\n\tQByteArray read =\ttcpSocket_->readAll();\n\tif (read == Protocol::handshake)\n\t{\n\t\tQObject::disconnect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::readHandshake);\n\t\tQObject::connect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::read);\n\t\t\/\/ TODO: This is just for testing now\n\t\tsendVersionRequest();\n\t}\n\telse\n\t{\n\t\tqWarning() << \"Handshake not received: \" << read;\n\t}\n}\n\nvoid DebugConnector::sendHandshake()\n{\n\ttcpSocket_->write(Protocol::handshake.toLatin1());\n}\n\nvoid DebugConnector::handlePacket(qint32 id, QByteArray data)\n{\n\tauto handlingFun = handlingMap_.take(id);\n\tif (handlingFun) \/\/ We received a reply\n\t{\n\t\t\/\/ check for an error\n\t\tauto r = makeReply<Reply>(data);\n\t\tif (Protocol::Error::NONE == r.error())\n\t\t{\n\t\t\thandlingFun(*this, data);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ TODO: handle this better\n\t\t\tqWarning() << \"Error received: \" << static_cast<int>(r.error());\n\t\t}\n\t}\n\telse \/\/ We received a command\n\t{\n\t\t\/\/ TODO: handle commands\n\t\tqWarning() << \"Command received \";\n\t}\n}\n\nvoid DebugConnector::sendVersionRequest()\n{\n\tCommand c(nextId(), Protocol::CommandSet::VirtualMachine, Protocol::VirtualMachineCommands::Version);\n\tsendCommand(c, &DebugConnector::handleVersion);\n}\n\nvoid DebugConnector::handleVersion(QByteArray data)\n{\n\tauto info = makeReply<VersionInfo>(data);\n\tqDebug() << \"VM-INFO: \" << info.jdwpMajor() << info.jdwpMinor();\n}\n\n} \/* namespace OODebug *\/\n<commit_msg>Add message length when sending a command<commit_after>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 2014 ETH Zurich\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n** following conditions are met:\n**\n** * Redistributions of source code must retain the above copyright notice, this list of conditions and the following\n** disclaimer.\n** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n** following disclaimer in the documentation and\/or other materials provided with the distribution.\n** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n** derived from this software without specific prior written permission.\n**\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n**\n***********************************************************************************************************************\/\n\n#include \"DebugConnector.h\"\n\n#include \"Protocol.h\"\n#include \"Reply.h\"\n#include \"Command.h\"\n\n#include \"reply\/VersionInfo.h\"\n\nnamespace OODebug {\n\nDebugConnector::DebugConnector()\n{\n\tQObject::connect(tcpSocket_, static_cast<void (QTcpSocket::*)(QAbstractSocket::SocketError)>(&QTcpSocket::error),\n\t\t\t\t\t\t this, &DebugConnector::handleSocketError);\n}\n\nDebugConnector::~DebugConnector()\n{\n\ttcpSocket_->abort();\n\tdelete tcpSocket_;\n}\n\nvoid DebugConnector::connect(QString vmHostName, int vmHostPort)\n{\n\tif (tcpSocket_->isOpen())\n\t\ttcpSocket_->close();\n\t\/\/ The connection setup is handled here:\n\t\/\/ First when we are connected we have to send the handshake. For receiving the hanshake reply,\n\t\/\/ we use a dedicated function which disconnects itself and connects the actual read function\n\t\/\/ to the readyRead slot. In this way we don't have the handshake handling in the normal read function.\n\tQObject::connect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::readHandshake);\n\tQObject::connect(tcpSocket_, &QTcpSocket::connected, this, &DebugConnector::sendHandshake);\n\ttcpSocket_->connectToHost(vmHostName, vmHostPort);\n}\n\nvoid DebugConnector::handleSocketError(QAbstractSocket::SocketError socketError)\n{\n\tqDebug() << \"ERROR: \" << socketError;\n\tqWarning() << socketError;\n}\n\nvoid DebugConnector::read()\n{\n\tQByteArray read =\ttcpSocket_->readAll();\n\t\/\/ If we still have a part of a packet add it here.\n\tif (!incompleteData_.isEmpty()) {\n\t\tread.prepend(incompleteData_);\n\t\tincompleteData_ = QByteArray();\n\t}\n\t\/\/ If we haven't read enough retry later\n\tif (read.size() < int(sizeof(qint32))) {\n\t\tincompleteData_ = read;\n\t\treturn;\n\t}\n\t\/\/ check if the packet is complete\n\tQDataStream inStream(read);\n\tqint32 len;\n\tinStream >> len;\n\tif (len > read.length()) {\n\t\tincompleteData_ = read;\n\t\treturn;\n\t}\n\t\/\/ We have read the whole data for this message so handle it.\n\tqint32 id;\n\tinStream >> id;\n\thandlePacket(id, read);\n}\n\nvoid DebugConnector::sendCommand(Command& c, HandleFunction handler)\n{\n\thandlingMap_[c.id()] = handler;\n\tQByteArray raw;\n\tQDataStream stream(&raw, QIODevice::ReadWrite);\n\tstream << c;\n\t\/\/ Insert the length, it is always at position 0\n\tQByteArray len;\n\tqint32 dataLen = raw.length();\n\tQDataStream lenStream(&len, QIODevice::ReadWrite);\n\tlenStream << dataLen;\n\traw.replace(0, len.length(), len);\n\ttcpSocket_->write(raw);\n}\n\nvoid DebugConnector::readHandshake()\n{\n\tQByteArray read =\ttcpSocket_->readAll();\n\tif (read == Protocol::handshake)\n\t{\n\t\tQObject::disconnect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::readHandshake);\n\t\tQObject::connect(tcpSocket_, &QTcpSocket::readyRead, this, &DebugConnector::read);\n\t\t\/\/ TODO: This is just for testing now\n\t\tsendVersionRequest();\n\t}\n\telse\n\t{\n\t\tqWarning() << \"Handshake not received: \" << read;\n\t}\n}\n\nvoid DebugConnector::sendHandshake()\n{\n\ttcpSocket_->write(Protocol::handshake.toLatin1());\n}\n\nvoid DebugConnector::handlePacket(qint32 id, QByteArray data)\n{\n\tauto handlingFun = handlingMap_.take(id);\n\tif (handlingFun) \/\/ We received a reply\n\t{\n\t\t\/\/ check for an error\n\t\tauto r = makeReply<Reply>(data);\n\t\tif (Protocol::Error::NONE == r.error())\n\t\t{\n\t\t\thandlingFun(*this, data);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ TODO: handle this better\n\t\t\tqWarning() << \"Error received: \" << static_cast<int>(r.error());\n\t\t}\n\t}\n\telse \/\/ We received a command\n\t{\n\t\t\/\/ TODO: handle commands\n\t\tqWarning() << \"Command received\" << data.toHex();\n\t}\n}\n\nvoid DebugConnector::sendVersionRequest()\n{\n\tCommand c(nextId(), Protocol::CommandSet::VirtualMachine, Protocol::VirtualMachineCommands::Version);\n\tsendCommand(c, &DebugConnector::handleVersion);\n}\n\nvoid DebugConnector::handleVersion(QByteArray data)\n{\n\tauto info = makeReply<VersionInfo>(data);\n\tqDebug() << \"VM-INFO: \" << info.jdwpMajor() << info.jdwpMinor();\n}\n\n} \/* namespace OODebug *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * File: main.cpp\n * Author: krr428\n *\n * Created on October 30, 2014, 7:36 PM\n *\/\n\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include \"secali.h\"\n#include <vector>\n#include <string>\n\nvoid get_reads_from_file(const std::string& fileReads, std::vector<std::string>& reads)\n{\n std::ifstream ifile(fileReads);\n while (ifile)\n {\n std::string line;\n std::getline(ifile, line);\n if (line != \"\\n\" && line != \"\")\n {\n reads.push_back(line);\n }\n }\n ifile.close();\n std::cout << \"Finished reading input file.\" << std::endl;\n}\n\nvoid compute_overlap_matrix(const std::vector<std::string>& reads, std::vector<int_fast16_t>& output_matrix)\n{\n uint_least64_t row = 0;\n for (std::string readA : reads)\n {\n for (std::string readB : reads)\n {\n int_fast16_t score = get_score(readA, readB, 2);\n output_matrix.push_back(score);\n }\n if (row % 1 == 0)\n {\n std::cout << \"Handled \" << row << \" of \" << reads.size() << std::endl;\n }\n row += 1;\n\n }\n}\n\nvoid write_matrix(const std::string& outfile, std::vector<int_fast16_t>& output_matrix, int num_cols)\n{\n int i = 0;\n std::ofstream ofile(outfile);\n for (int_fast16_t n : output_matrix)\n {\n ofile << n << ' ';\n if (i++ == num_cols)\n {\n ofile << std::endl;\n i = 0;\n }\n }\n ofile.close();\n}\n\n\/*\n *\n *\/\nint main(int argc, char** argv)\n{\n\/\/ const std::string input_file = \"..\/Fasta\/real.error.large.fasta.txt\";\n\/\/ const std::string input_file = \"..\/Fasta\/test.txt\";\n const std::string input_file(argv[1]);\n\n std::vector<int_fast16_t> output_matrix;\n std::vector<std::string> reads;\n\n get_reads_from_file(input_file, reads);\n compute_overlap_matrix(reads, output_matrix);\n write_matrix(std::string(argv[2]), output_matrix, reads.at(0).size());\n\n return 0;\n}\n\n<commit_msg>Every row is now written out in real time.<commit_after>\/*\n * File: main.cpp\n * Author: krr428\n *\n * Created on October 30, 2014, 7:36 PM\n *\/\n\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include \"secali.h\"\n#include <vector>\n#include <string>\n\nvoid get_reads_from_file(const std::string& fileReads, std::vector<std::string>& reads)\n{\n std::ifstream ifile(fileReads);\n while (ifile)\n {\n std::string line;\n std::getline(ifile, line);\n if (line != \"\\n\" && line != \"\")\n {\n reads.push_back(line);\n }\n }\n ifile.close();\n std::cout << \"Finished reading input file.\" << std::endl;\n}\n\nvoid compute_overlap_matrix(const std::vector<std::string>& reads, const std::string& output_file)\n{\n uint_least64_t row = 0;\n std::ofstream ofile(output_file);\n \n for (std::string readA : reads)\n {\n std::vector<int_fast16_t> output_row;\n for (std::string readB : reads)\n {\n int_fast16_t score = get_score(readA, readB, 2);\n output_row.push_back(score);\n }\n for (int_fast16_t n: output_row)\n {\n ofile << n << '\\t';\n }\n ofile << std::endl; \n std::cout << \"Handled \" << ++row << \" of \" << reads.size() << std::endl;\n\n }\n \n ofile.close();\n}\n\n\/\/void write_matrix(const std::string& outfile, std::vector<int_fast16_t>& output_matrix, int num_cols)\n\/\/{\n\/\/ int i = 0;\n\/\/ std::ofstream ofile(outfile);\n\/\/ for (int_fast16_t n : output_matrix)\n\/\/ {\n\/\/ ofile << n << ' ';\n\/\/ if (i++ == num_cols)\n\/\/ {\n\/\/ ofile << std::endl;\n\/\/ i = 0;\n\/\/ }\n\/\/ }\n\/\/ ofile.close();\n\/\/}\n\n\/*\n *\n *\/\nint main(int argc, char** argv)\n{\n\/\/ const std::string input_file = \"..\/Fasta\/real.error.large.fasta.txt\";\n\/\/ const std::string input_file = \"..\/Fasta\/test.txt\";\n const std::string input_file(argv[1]);\n\n std::vector<int_fast16_t> output_matrix;\n std::vector<std::string> reads;\n\n get_reads_from_file(input_file, reads);\n compute_overlap_matrix(reads, argv[2]);\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <config.h>\n#include <assert.h>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/multiscale\/problems\/selector.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <memory>\n\n#include \"dune\/multiscale\/common\/traits.hh\"\n#include \"dune\/multiscale\/common\/dirichletconstraints.hh\"\n#include \"dune\/multiscale\/msfem\/msfem_grid_specifier.hh\"\n#include \"dune\/multiscale\/msfem\/localproblems\/subgrid-list.hh\"\n#include \"dune\/multiscale\/msfem\/localproblems\/localsolutionmanager.hh\"\n#include \"righthandside_assembler.hh\"\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n for (const auto& entity : rhsVector.space()) {\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n const auto numDofs = elementOfRHS.numDofs();\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ the return values:\n RangeType f_x;\n std::vector<RangeType> phi_x(numDofs);\n \/\/ to save: A \\nabla PHI_H * \\nabla phi_h;\n const auto det = geometry.integrationElement(quadrature.point(quadraturePoint));\n\n f.evaluate(geometry.global(quadrature.point(quadraturePoint)), f_x);\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x[i]);\n }\n }\n }\n}\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(\n const Dune::Multiscale::CommonTraits::FirstSourceType &f,\n const Dune::Multiscale::CommonTraits::DiffusionType &A,\n const Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &\n dirichlet_extension,\n const Dune::Multiscale::CommonTraits::NeumannBCType &neumann_bc,\n Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n\n for (const auto& entity : rhsVector.space()) {\n\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n\n const int numDofs = elementOfRHS.numDofs();\n\n std::vector<RangeType> phi_x(numDofs);\n \/\/ gradient of base function and gradient of old_u_H\n std::vector<JacobianRangeType> grad_phi_x(numDofs);\n\n const auto loc_dirichlet_extension = dirichlet_extension.localFunction(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n\n const auto& lagrangePointSet = rhsVector.space().lagrangePointSet(entity);\n\n for (const auto& intersection : DSC::intersectionRange(rhsVector.space().gridPart(), entity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const auto face = intersection.indexInInside();\n const auto faceQuadrature = make_quadrature(intersection, rhsVector.space(), quadratureOrder);\n const auto numFaceQuadraturePoints = faceQuadrature.nop();\n\n for (auto faceQuadraturePoint : DSC::valueRange(numFaceQuadraturePoints)) {\n baseSet.evaluateAll(faceQuadrature[faceQuadraturePoint], phi_x);\n baseSet.jacobianAll(faceQuadrature[faceQuadraturePoint], grad_phi_x);\n\n const auto local_point_entity = faceQuadrature.point(faceQuadraturePoint);\n const auto global_point = geometry.global(local_point_entity);\n const auto local_point_face = intersection.geometry().local(global_point);\n\n RangeType neumann_value(0.0);\n neumann_bc.evaluate(global_point, neumann_value);\n\n const double face_weight = intersection.geometry().integrationElement(local_point_face) *\n faceQuadrature.weight(faceQuadraturePoint);\n\n for (const auto& lp : DSC::lagrangePointSetRange(lagrangePointSet, face)) {\n elementOfRHS[lp] += neumann_value * face_weight * phi_x[lp];\n }\n }\n }\n }\n\n \/\/ the return values:\n RangeType f_x;\n\n JacobianRangeType gradient_dirichlet_extension;\n JacobianRangeType diffusive_flux_in_gradient_dirichlet_extension;\n\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_point = quadrature.point(quadraturePoint);\n const auto global_point = geometry.global(local_point);\n\n const double weight = geometry.integrationElement(local_point) * quadrature.weight(quadraturePoint);\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(global_point, f_x);\n \/\/ evaluate the current base function at the current quadrature point and save its value in 'z':\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x); \/\/ i = i'te Basisfunktion;\n \/\/ evaluate the gradient of the current base function at the current quadrature point and save its value in\n \/\/ 'returnGradient':\n baseSet.jacobianAll(quadrature[quadraturePoint], grad_phi_x);\n \/\/ get gradient of dirichlet extension:\n loc_dirichlet_extension.jacobian(quadrature[quadraturePoint], gradient_dirichlet_extension);\n A.diffusiveFlux(global_point, gradient_dirichlet_extension, diffusive_flux_in_gradient_dirichlet_extension);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += weight * (f_x * phi_x[i]);\n elementOfRHS[i] -= weight * (diffusive_flux_in_gradient_dirichlet_extension[0] * grad_phi_x[i][0]);\n }\n }\n }\n}\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble_for_MsFEM_symmetric(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::MsFEM::MacroMicroGridSpecifier &specifier, Dune::Multiscale::MsFEM::SubGridList &subgrid_list, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n\n \/\/ gather some problem data\n auto diffusionPtr = Problem::getDiffusion();\n const auto& diffusion = *diffusionPtr;\n auto neumannDataPtr = Problem::getNeumannData();\n const auto& neumannData = *neumannDataPtr;\n\n DiscreteFunctionType dirichletExtension(\"Dirichlet Extension\", specifier.fineSpace());\n dirichletExtension.clear();\n Dune::Multiscale::projectDirichletValues(rhsVector.space(), dirichletExtension);\n\n \/\/ set rhsVector to zero:\n rhsVector.clear();\n const auto& coarseGridLeafIndexSet = specifier.coarseSpace().gridPart().grid().leafIndexSet();\n RangeType f_x;\n for (const auto& coarse_grid_entity : rhsVector.space()) {\n const auto coarseEntityIndex = coarseGridLeafIndexSet.index(coarse_grid_entity);\n\n const auto& coarseGeometry = coarse_grid_entity.geometry();\n auto rhsLocalFunction = rhsVector.localFunction(coarse_grid_entity);\n const auto numLocalBaseFunctions = rhsLocalFunction.numDofs();\n const auto& coarse_grid_baseSet = specifier.coarseSpace().basisFunctionSet(coarse_grid_entity);\n\n \/\/ --------- add standard contribution of right hand side -------------------------\n {\n const auto quadrature = make_quadrature(coarse_grid_entity, rhsVector.space(), quadratureOrder);\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n const auto numQuadraturePoints = quadrature.nop();\n for (size_t quadraturePoint = 0; quadraturePoint < numQuadraturePoints; ++quadraturePoint) {\n const double det = coarseGeometry.integrationElement(quadrature.point(quadraturePoint));\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(coarseGeometry.global(quadrature.point(quadraturePoint)), f_x);\n coarse_grid_baseSet.evaluateAll(quadrature[quadraturePoint], phi_x_vec);\n for (int i = 0; i < numLocalBaseFunctions; ++i) {\n rhsLocalFunction[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x_vec[i]);\n }\n }\n }\n \/\/ ----------------------------------------------------------------------------------\n\n \/\/ --------- add corrector contribution of right hand side --------------------------\n \/\/ Load local solutions\n MsFEM::LocalSolutionManager localSolutionManager(coarse_grid_entity, subgrid_list, specifier);\n localSolutionManager.loadLocalSolutions();\n auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n \/\/ iterator for the micro grid ( grid for the reference element T_0 )\n const auto& subGrid = subgrid_list.getSubGrid(coarse_grid_entity);\n for (const auto& localEntity : DSC::viewRange(subGrid.leafView())) {\n const auto& hostCell = subGrid.getHostEntity<0>(localEntity);\n const auto enclosingCoarseCellIndex = subgrid_list.getEnclosingMacroCellIndex(hostCell);\n auto dirichletExtensionLF = dirichletExtension.localFunction(*hostCell);\n if (enclosingCoarseCellIndex == coarseEntityIndex) {\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature =\n make_quadrature(localEntity, localSolutionManager.getLocalDiscreteFunctionSpace());\n\n \/\/ evaluate all local solutions and their jacobians in all quadrature points\n std::vector<std::vector<RangeType>> allLocalSolutionEvaluations(\n localSolutions.size(), std::vector<RangeType>(localQuadrature.nop(), 0.0));\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionJacobians(\n localSolutions.size(), std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(localSolutions.size())) {\n auto localFunction = localSolutions[lsNum]->localFunction(localEntity);\n \/\/ this evaluates the local solutions in all quadrature points...\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n \/\/ while this automatically evaluates their jacobians.\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionJacobians[lsNum]);\n\n const auto& subGridPart = localSolutionManager.getSubGridPart();\n for (const auto& intersection : DSC::intersectionRange(subGridPart.grid().leafView(), localEntity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const int orderOfIntegrand = (polynomialOrder - 1) + 2 * (polynomialOrder + 1);\n const int quadOrder = std::ceil((orderOfIntegrand + 1) \/ 2);\n \/\/ get type of face quadrature. Is done in this scope because Patricks methods use another type.\n const auto faceQuad = make_quadrature(intersection, localSolutions[lsNum]->space(), quadOrder);\n RangeType neumannValue(0.0);\n const auto numQuadPoints = faceQuad.nop();\n \/\/ loop over all quadrature points\n\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n std::vector<RangeType> localSolutionOnFace(numLocalBaseFunctions);\n localFunction.evaluateQuadrature(faceQuad, localSolutionOnFace);\n\n for (unsigned int iqP = 0; iqP < numQuadPoints; ++iqP) {\n \/\/ get local coordinate of quadrature point\n const auto& xLocal = faceQuad.localPoint(iqP);\n const auto& faceGeometry = intersection.geometry();\n\n \/\/ the following does not work because subgrid does not implement geometryInInside()\n \/\/ const auto& insideGeometry = intersection.geometryInInside();\n \/\/ const typename FaceQuadratureType::CoordinateType& xInInside = insideGeometry.global(xLocal);\n \/\/ therefore, we have to do stupid things:\n const auto& xGlobal = faceGeometry.global(xLocal);\n const auto& xInCoarseLocal = coarse_grid_entity.geometry().local(xGlobal);\n const double factor = faceGeometry.integrationElement(xLocal) * faceQuad.weight(iqP);\n\n neumannData.evaluate(xGlobal, neumannValue);\n coarse_grid_baseSet.evaluateAll(xInCoarseLocal, phi_x_vec);\n for (auto i : DSC::valueRange(numLocalBaseFunctions)) {\n assert((long long)i < (long long)phi_x_vec.size());\n assert(iqP < localSolutionOnFace.size());\n rhsLocalFunction[i] += factor * (neumannValue * (phi_x_vec[i] + localSolutionOnFace[iqP]));\n }\n }\n }\n }\n }\n\n const auto& localGeometry = localEntity.geometry();\n RangeType corrector_phi_x;\n for (size_t qP = 0; qP < localQuadrature.nop(); ++qP) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& quadPoint = localQuadrature.point(qP);\n const auto quadPointGlobal = localGeometry.global(quadPoint);\n\n const double quadWeight = localQuadrature.weight(qP) * localGeometry.integrationElement(quadPoint);\n\n for (int coarseBF = 0; coarseBF < numLocalBaseFunctions; ++coarseBF) {\n JacobianRangeType diffusive_flux(0.0);\n\n \/\/ evaluate gradient of basis function\n const auto quadPointLocalInCoarse = coarseGeometry.local(quadPointGlobal);\n std::vector<JacobianRangeType> gradient_Phi_vec(numLocalBaseFunctions);\n coarse_grid_baseSet.jacobianAll(quadPointLocalInCoarse, gradient_Phi_vec);\n\n JacobianRangeType reconstructionGradPhi(gradient_Phi_vec[coarseBF]);\n\n if (specifier.simplexCoarseGrid()) {\n assert(localSolutions.size() == GridSelector::dimgrid + localSolutionManager.numBoundaryCorrectors());\n DUNE_THROW(NotImplemented, \"Boundary values are not implemented for simplex grids yet!\");\n } else {\n assert(localSolutions.size() == numLocalBaseFunctions + localSolutionManager.numBoundaryCorrectors());\n \/\/ local corrector for coarse base func\n corrector_phi_x = allLocalSolutionEvaluations[coarseBF][qP];\n \/\/ element part of boundary conditions\n JacobianRangeType directionOfFlux(0.0);\n \/\/! @attention At this point we assume, that the quadrature points on the subgrid and hostgrid\n \/\/! are the same (dirichletExtensionLF is a localfunction on the hostgrid, quadPoint stems from\n \/\/! a quadrature on the subgrid)!!\n dirichletExtensionLF.jacobian(quadPoint, directionOfFlux);\n \/\/ add dirichlet-corrector\n directionOfFlux += allLocalSolutionJacobians[numLocalBaseFunctions + 1][qP];\n \/\/ subtract neumann-corrector\n \/\/ directionOfFlux -= allLocalSolutionJacobians[numLocalBaseFunctions][qP];\n\n diffusion.diffusiveFlux(quadPointGlobal, directionOfFlux, diffusive_flux);\n reconstructionGradPhi += allLocalSolutionJacobians[coarseBF][qP];\n }\n f.evaluate(quadPointGlobal, f_x);\n double val = quadWeight * (f_x * corrector_phi_x);\n rhsLocalFunction[coarseBF] += val;\n val = quadWeight * (diffusive_flux[0] * reconstructionGradPhi[0]);\n rhsLocalFunction[coarseBF] -= val;\n }\n }\n }\n }\n }\n\n \/\/ set dirichlet dofs to zero\n Dune::Multiscale::getConstraintsCoarse(rhsVector.space()).setValue(0.0, rhsVector);\n}\n<commit_msg>Rearranging loops to improve performance<commit_after>#include <config.h>\n#include <assert.h>\n#include <dune\/common\/exceptions.hh>\n#include <dune\/multiscale\/problems\/selector.hh>\n#include <dune\/stuff\/common\/ranges.hh>\n#include <memory>\n\n#include \"dune\/multiscale\/common\/traits.hh\"\n#include \"dune\/multiscale\/common\/dirichletconstraints.hh\"\n#include \"dune\/multiscale\/msfem\/msfem_grid_specifier.hh\"\n#include \"dune\/multiscale\/msfem\/localproblems\/subgrid-list.hh\"\n#include \"dune\/multiscale\/msfem\/localproblems\/localsolutionmanager.hh\"\n#include \"righthandside_assembler.hh\"\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n for (const auto& entity : rhsVector.space()) {\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n const auto numDofs = elementOfRHS.numDofs();\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ the return values:\n RangeType f_x;\n std::vector<RangeType> phi_x(numDofs);\n \/\/ to save: A \\nabla PHI_H * \\nabla phi_h;\n const auto det = geometry.integrationElement(quadrature.point(quadraturePoint));\n\n f.evaluate(geometry.global(quadrature.point(quadraturePoint)), f_x);\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x[i]);\n }\n }\n }\n}\n\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble(\n const Dune::Multiscale::CommonTraits::FirstSourceType &f,\n const Dune::Multiscale::CommonTraits::DiffusionType &A,\n const Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &\n dirichlet_extension,\n const Dune::Multiscale::CommonTraits::NeumannBCType &neumann_bc,\n Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n rhsVector.clear();\n\n for (const auto& entity : rhsVector.space()) {\n\n const auto& geometry = entity.geometry();\n auto elementOfRHS = rhsVector.localFunction(entity);\n const auto baseSet = rhsVector.space().basisFunctionSet(entity);\n\n const int numDofs = elementOfRHS.numDofs();\n\n std::vector<RangeType> phi_x(numDofs);\n \/\/ gradient of base function and gradient of old_u_H\n std::vector<JacobianRangeType> grad_phi_x(numDofs);\n\n const auto loc_dirichlet_extension = dirichlet_extension.localFunction(entity);\n const auto quadrature = make_quadrature(entity, rhsVector.space(), quadratureOrder);\n\n const auto& lagrangePointSet = rhsVector.space().lagrangePointSet(entity);\n\n for (const auto& intersection : DSC::intersectionRange(rhsVector.space().gridPart(), entity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const auto face = intersection.indexInInside();\n const auto faceQuadrature = make_quadrature(intersection, rhsVector.space(), quadratureOrder);\n const auto numFaceQuadraturePoints = faceQuadrature.nop();\n\n for (auto faceQuadraturePoint : DSC::valueRange(numFaceQuadraturePoints)) {\n baseSet.evaluateAll(faceQuadrature[faceQuadraturePoint], phi_x);\n baseSet.jacobianAll(faceQuadrature[faceQuadraturePoint], grad_phi_x);\n\n const auto local_point_entity = faceQuadrature.point(faceQuadraturePoint);\n const auto global_point = geometry.global(local_point_entity);\n const auto local_point_face = intersection.geometry().local(global_point);\n\n RangeType neumann_value(0.0);\n neumann_bc.evaluate(global_point, neumann_value);\n\n const double face_weight = intersection.geometry().integrationElement(local_point_face) *\n faceQuadrature.weight(faceQuadraturePoint);\n\n for (const auto& lp : DSC::lagrangePointSetRange(lagrangePointSet, face)) {\n elementOfRHS[lp] += neumann_value * face_weight * phi_x[lp];\n }\n }\n }\n }\n\n \/\/ the return values:\n RangeType f_x;\n\n JacobianRangeType gradient_dirichlet_extension;\n JacobianRangeType diffusive_flux_in_gradient_dirichlet_extension;\n\n for (auto quadraturePoint : DSC::valueRange(quadrature.nop())) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& local_point = quadrature.point(quadraturePoint);\n const auto global_point = geometry.global(local_point);\n\n const double weight = geometry.integrationElement(local_point) * quadrature.weight(quadraturePoint);\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(global_point, f_x);\n \/\/ evaluate the current base function at the current quadrature point and save its value in 'z':\n baseSet.evaluateAll(quadrature[quadraturePoint], phi_x); \/\/ i = i'te Basisfunktion;\n \/\/ evaluate the gradient of the current base function at the current quadrature point and save its value in\n \/\/ 'returnGradient':\n baseSet.jacobianAll(quadrature[quadraturePoint], grad_phi_x);\n \/\/ get gradient of dirichlet extension:\n loc_dirichlet_extension.jacobian(quadrature[quadraturePoint], gradient_dirichlet_extension);\n A.diffusiveFlux(global_point, gradient_dirichlet_extension, diffusive_flux_in_gradient_dirichlet_extension);\n\n for (int i = 0; i < numDofs; ++i) {\n elementOfRHS[i] += weight * (f_x * phi_x[i]);\n elementOfRHS[i] -= weight * (diffusive_flux_in_gradient_dirichlet_extension[0] * grad_phi_x[i][0]);\n }\n }\n }\n}\n\nvoid Dune::Multiscale::RightHandSideAssembler::assemble_for_MsFEM_symmetric(const Dune::Multiscale::CommonTraits::FirstSourceType &f, Dune::Multiscale::MsFEM::MacroMicroGridSpecifier &specifier, Dune::Multiscale::MsFEM::SubGridList &subgrid_list, Dune::Multiscale::RightHandSideAssembler::DiscreteFunctionType &rhsVector) {\n\n \/\/ gather some problem data\n auto diffusionPtr = Problem::getDiffusion();\n const auto& diffusion = *diffusionPtr;\n auto neumannDataPtr = Problem::getNeumannData();\n const auto& neumannData = *neumannDataPtr;\n\n DiscreteFunctionType dirichletExtension(\"Dirichlet Extension\", specifier.fineSpace());\n dirichletExtension.clear();\n Dune::Multiscale::projectDirichletValues(rhsVector.space(), dirichletExtension);\n\n \/\/ set rhsVector to zero:\n rhsVector.clear();\n const auto& coarseGridLeafIndexSet = specifier.coarseSpace().gridPart().grid().leafIndexSet();\n RangeType f_x;\n for (const auto& coarse_grid_entity : rhsVector.space()) {\n const auto coarseEntityIndex = coarseGridLeafIndexSet.index(coarse_grid_entity);\n\n const auto& coarseGeometry = coarse_grid_entity.geometry();\n auto rhsLocalFunction = rhsVector.localFunction(coarse_grid_entity);\n const auto numLocalBaseFunctions = rhsLocalFunction.numDofs();\n const auto& coarse_grid_baseSet = specifier.coarseSpace().basisFunctionSet(coarse_grid_entity);\n\n \/\/ --------- add standard contribution of right hand side -------------------------\n {\n const auto quadrature = make_quadrature(coarse_grid_entity, rhsVector.space(), quadratureOrder);\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n const auto numQuadraturePoints = quadrature.nop();\n for (size_t quadraturePoint = 0; quadraturePoint < numQuadraturePoints; ++quadraturePoint) {\n const double det = coarseGeometry.integrationElement(quadrature.point(quadraturePoint));\n \/\/ evaluate the Right Hand Side Function f at the current quadrature point and save its value in 'f_y':\n f.evaluate(coarseGeometry.global(quadrature.point(quadraturePoint)), f_x);\n coarse_grid_baseSet.evaluateAll(quadrature[quadraturePoint], phi_x_vec);\n for (int i = 0; i < numLocalBaseFunctions; ++i) {\n rhsLocalFunction[i] += det * quadrature.weight(quadraturePoint) * (f_x * phi_x_vec[i]);\n }\n }\n }\n \/\/ ----------------------------------------------------------------------------------\n\n \/\/ --------- add corrector contribution of right hand side --------------------------\n \/\/ Load local solutions\n MsFEM::LocalSolutionManager localSolutionManager(coarse_grid_entity, subgrid_list, specifier);\n localSolutionManager.loadLocalSolutions();\n auto& localSolutions = localSolutionManager.getLocalSolutions();\n assert(localSolutions.size() > 0);\n\n \/\/ iterator for the micro grid ( grid for the reference element T_0 )\n const auto& subGrid = subgrid_list.getSubGrid(coarse_grid_entity);\n for (const auto& localEntity : DSC::viewRange(subGrid.leafView())) {\n const auto& hostCell = subGrid.getHostEntity<0>(localEntity);\n const auto enclosingCoarseCellIndex = subgrid_list.getEnclosingMacroCellIndex(hostCell);\n auto dirichletExtensionLF = dirichletExtension.localFunction(*hostCell);\n if (enclosingCoarseCellIndex == coarseEntityIndex) {\n \/\/ higher order quadrature, since A^{\\epsilon} is highly variable\n const auto localQuadrature =\n make_quadrature(localEntity, localSolutionManager.getLocalDiscreteFunctionSpace());\n\n \/\/ evaluate all local solutions and their jacobians in all quadrature points\n std::vector<std::vector<RangeType>> allLocalSolutionEvaluations(\n localSolutions.size(), std::vector<RangeType>(localQuadrature.nop(), 0.0));\n std::vector<std::vector<JacobianRangeType>> allLocalSolutionJacobians(\n localSolutions.size(), std::vector<JacobianRangeType>(localQuadrature.nop(), JacobianRangeType(0.0)));\n for (auto lsNum : DSC::valueRange(localSolutions.size())) {\n auto localFunction = localSolutions[lsNum]->localFunction(localEntity);\n \/\/ this evaluates the local solutions in all quadrature points...\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionEvaluations[lsNum]);\n \/\/ while this automatically evaluates their jacobians.\n localFunction.evaluateQuadrature(localQuadrature, allLocalSolutionJacobians[lsNum]);\n\n const auto& subGridPart = localSolutionManager.getSubGridPart();\n for (const auto& intersection : DSC::intersectionRange(subGridPart.grid().leafView(), localEntity)) {\n if (Problem::isNeumannBoundary(intersection)) {\n const int orderOfIntegrand = (polynomialOrder - 1) + 2 * (polynomialOrder + 1);\n const int quadOrder = std::ceil((orderOfIntegrand + 1) \/ 2);\n \/\/ get type of face quadrature. Is done in this scope because Patricks methods use another type.\n const auto faceQuad = make_quadrature(intersection, localSolutions[lsNum]->space(), quadOrder);\n RangeType neumannValue(0.0);\n const auto numQuadPoints = faceQuad.nop();\n \/\/ loop over all quadrature points\n\n std::vector<RangeType> phi_x_vec(numLocalBaseFunctions);\n std::vector<RangeType> localSolutionOnFace(numLocalBaseFunctions);\n localFunction.evaluateQuadrature(faceQuad, localSolutionOnFace);\n\n for (unsigned int iqP = 0; iqP < numQuadPoints; ++iqP) {\n \/\/ get local coordinate of quadrature point\n const auto& xLocal = faceQuad.localPoint(iqP);\n const auto& faceGeometry = intersection.geometry();\n\n \/\/ the following does not work because subgrid does not implement geometryInInside()\n \/\/ const auto& insideGeometry = intersection.geometryInInside();\n \/\/ const typename FaceQuadratureType::CoordinateType& xInInside = insideGeometry.global(xLocal);\n \/\/ therefore, we have to do stupid things:\n const auto& xGlobal = faceGeometry.global(xLocal);\n const auto& xInCoarseLocal = coarse_grid_entity.geometry().local(xGlobal);\n const double factor = faceGeometry.integrationElement(xLocal) * faceQuad.weight(iqP);\n\n neumannData.evaluate(xGlobal, neumannValue);\n coarse_grid_baseSet.evaluateAll(xInCoarseLocal, phi_x_vec);\n for (auto i : DSC::valueRange(numLocalBaseFunctions)) {\n assert((long long)i < (long long)phi_x_vec.size());\n assert(iqP < localSolutionOnFace.size());\n rhsLocalFunction[i] += factor * (neumannValue * (phi_x_vec[i] + localSolutionOnFace[iqP]));\n }\n }\n }\n }\n }\n\n const auto& localGeometry = localEntity.geometry();\n RangeType corrector_phi_x;\n for (size_t qP = 0; qP < localQuadrature.nop(); ++qP) {\n \/\/ local (barycentric) coordinates (with respect to entity)\n const auto& quadPoint = localQuadrature.point(qP);\n const auto quadPointGlobal = localGeometry.global(quadPoint);\n\n const double quadWeight = localQuadrature.weight(qP) * localGeometry.integrationElement(quadPoint);\n\n \/\/ evaluate gradient of basis function\n const auto quadPointLocalInCoarse = coarseGeometry.local(quadPointGlobal);\n std::vector<JacobianRangeType> gradient_Phi_vec(numLocalBaseFunctions);\n coarse_grid_baseSet.jacobianAll(quadPointLocalInCoarse, gradient_Phi_vec);\n\n for (int coarseBF = 0; coarseBF < numLocalBaseFunctions; ++coarseBF) {\n JacobianRangeType diffusive_flux(0.0);\n\n JacobianRangeType reconstructionGradPhi(gradient_Phi_vec[coarseBF]);\n\n if (specifier.simplexCoarseGrid()) {\n assert(localSolutions.size() == GridSelector::dimgrid + localSolutionManager.numBoundaryCorrectors());\n DUNE_THROW(NotImplemented, \"Boundary values are not implemented for simplex grids yet!\");\n } else {\n assert(localSolutions.size() == numLocalBaseFunctions + localSolutionManager.numBoundaryCorrectors());\n \/\/ local corrector for coarse base func\n corrector_phi_x = allLocalSolutionEvaluations[coarseBF][qP];\n \/\/ element part of boundary conditions\n JacobianRangeType directionOfFlux(0.0);\n \/\/! @attention At this point we assume, that the quadrature points on the subgrid and hostgrid\n \/\/! are the same (dirichletExtensionLF is a localfunction on the hostgrid, quadPoint stems from\n \/\/! a quadrature on the subgrid)!!\n dirichletExtensionLF.jacobian(quadPoint, directionOfFlux);\n \/\/ add dirichlet-corrector\n directionOfFlux += allLocalSolutionJacobians[numLocalBaseFunctions + 1][qP];\n \/\/ subtract neumann-corrector\n \/\/ directionOfFlux -= allLocalSolutionJacobians[numLocalBaseFunctions][qP];\n\n diffusion.diffusiveFlux(quadPointGlobal, directionOfFlux, diffusive_flux);\n reconstructionGradPhi += allLocalSolutionJacobians[coarseBF][qP];\n }\n f.evaluate(quadPointGlobal, f_x);\n double val = quadWeight * (f_x * corrector_phi_x);\n rhsLocalFunction[coarseBF] += val;\n val = quadWeight * (diffusive_flux[0] * reconstructionGradPhi[0]);\n rhsLocalFunction[coarseBF] -= val;\n }\n }\n }\n }\n }\n\n \/\/ set dirichlet dofs to zero\n Dune::Multiscale::getConstraintsCoarse(rhsVector.space()).setValue(0.0, rhsVector);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"platform.h\"\n#include <stdlib.h>\n#include <boost\/filesystem.hpp>\n#include <iostream>\n\n#if defined(WIN32)\n\t#include <codecvt>\n#elif define(__linux__)\n\t#include <unistd.h>\n\t#include <sys\/reboot.h>\n#endif\n\nstd::string getConfigDirectory()\n{\n boost::filesystem::path path;\n#ifdef _WIN32\n#include <windows.h>\n#include <shlobj.h>\n CHAR my_documents[MAX_PATH];\n SHGetFolderPath(NULL, CSIDL_PRESONAL, NULL, SHGFP_TYPE_CURRENT, my_documents);\n path = boost::filesystem::path(my_documents) \/ \"EmulationStation\";\n#elif __APPLE__ && !defined(USE_XDG_OSX)\n const char* homePath = getenv(\"HOME\");\n path = boost::filesystem::path(homePath);\n path \/= \"Library\" \/ \"Application Support\" \/ \"org.emulationstation.EmulationStation\" ;\n#else\n const char* envXdgConfig = getenv(\"XDG_CONFIG_HOME\");\n if(envXdgConfig){\n path = boost::filesystem::path(envXdgConfig);\n } else {\n const char* homePath = getenv(\"HOME\");\n path = boost::filesystem::path(homePath);\n path \/= boost::filesystem::path(\".config\");\n }\n path \/= boost::filesystem::path(\"emulationstation\");\n#endif\n return path.generic_string();\n}\n\nstd::string getHomePath()\n{\n\tstd::string homePath;\n\n\t\/\/ this should give you something like \"\/home\/YOUR_USERNAME\" on Linux and \"C:\\Users\\YOUR_USERNAME\\\" on Windows\n\tconst char * envHome = getenv(\"HOME\");\n\tif(envHome != nullptr)\n\t{\n\t\thomePath = envHome;\n\t}\n\n#ifdef WIN32\n\t\/\/ but does not seem to work for Windows XP or Vista, so try something else\n\tif (homePath.empty()) {\n\t\tconst char * envDir = getenv(\"HOMEDRIVE\");\n\t\tconst char * envPath = getenv(\"HOMEPATH\");\n\t\tif (envDir != nullptr && envPath != nullptr) {\n\t\t\thomePath = envDir;\n\t\t\thomePath += envPath;\n\n\t\t\tfor(unsigned int i = 0; i < homePath.length(); i++)\n\t\t\t\tif(homePath[i] == '\\\\')\n\t\t\t\t\thomePath[i] = '\/';\n\t\t}\n\t}\n#endif\n\n\t\/\/ convert path to generic directory seperators\n\tboost::filesystem::path genericPath(homePath);\n\treturn genericPath.generic_string();\n}\n\nint runShutdownCommand()\n{\n#if defined(WIN32)\n\treturn system(\"shutdown -s -t 0\");\n#elif defined(__linux__)\n\tsync();\n\treturn reboot(RB_POWER_OFF);\n#else\n\treturn system(\"sudo shutdown -h now\");\n#endif\n}\n\nint runRestartCommand()\n{\n#if defined(WIN32)\n\treturn system(\"shutdown -r -t 0\");\n#elif defined(__linux__)\n\tsync();\n\treturn reboot(RB_AUTOBOOT);\n#else\n\treturn system(\"sudo shutdown -r now\");\n#endif\n}\n\nint runSystemCommand(const std::string& cmd_utf8)\n{\n#ifdef WIN32\n\t\/\/ on Windows we use _wsystem to support non-ASCII paths\n\t\/\/ which requires converting from utf8 to a wstring\n\ttypedef std::codecvt_utf8<wchar_t> convert_type;\n\tstd::wstring_convert<convert_type, wchar_t> converter;\n\tstd::wstring wchar_str = converter.from_bytes(cmd_utf8);\n\treturn _wsystem(wchar_str.c_str());\n#else\n\treturn system(cmd_utf8.c_str());\n#endif\n}\n<commit_msg>Fixed Linux Build<commit_after>#include \"platform.h\"\n#include <stdlib.h>\n#include <boost\/filesystem.hpp>\n#include <iostream>\n\n#if defined(WIN32)\n\t#include <codecvt>\n#elif defined(__linux__)\n\t#include <unistd.h>\n\t#include <sys\/reboot.h>\n#endif\n\nstd::string getConfigDirectory()\n{\n boost::filesystem::path path;\n#ifdef _WIN32\n#include <windows.h>\n#include <shlobj.h>\n CHAR my_documents[MAX_PATH];\n SHGetFolderPath(NULL, CSIDL_PRESONAL, NULL, SHGFP_TYPE_CURRENT, my_documents);\n path = boost::filesystem::path(my_documents) \/ \"EmulationStation\";\n#elif __APPLE__ && !defined(USE_XDG_OSX)\n const char* homePath = getenv(\"HOME\");\n path = boost::filesystem::path(homePath);\n path \/= \"Library\" \/ \"Application Support\" \/ \"org.emulationstation.EmulationStation\" ;\n#else\n const char* envXdgConfig = getenv(\"XDG_CONFIG_HOME\");\n if(envXdgConfig){\n path = boost::filesystem::path(envXdgConfig);\n } else {\n const char* homePath = getenv(\"HOME\");\n path = boost::filesystem::path(homePath);\n path \/= boost::filesystem::path(\".config\");\n }\n path \/= boost::filesystem::path(\"emulationstation\");\n#endif\n return path.generic_string();\n}\n\nstd::string getHomePath()\n{\n\tstd::string homePath;\n\n\t\/\/ this should give you something like \"\/home\/YOUR_USERNAME\" on Linux and \"C:\\Users\\YOUR_USERNAME\\\" on Windows\n\tconst char * envHome = getenv(\"HOME\");\n\tif(envHome != nullptr)\n\t{\n\t\thomePath = envHome;\n\t}\n\n#ifdef WIN32\n\t\/\/ but does not seem to work for Windows XP or Vista, so try something else\n\tif (homePath.empty()) {\n\t\tconst char * envDir = getenv(\"HOMEDRIVE\");\n\t\tconst char * envPath = getenv(\"HOMEPATH\");\n\t\tif (envDir != nullptr && envPath != nullptr) {\n\t\t\thomePath = envDir;\n\t\t\thomePath += envPath;\n\n\t\t\tfor(unsigned int i = 0; i < homePath.length(); i++)\n\t\t\t\tif(homePath[i] == '\\\\')\n\t\t\t\t\thomePath[i] = '\/';\n\t\t}\n\t}\n#endif\n\n\t\/\/ convert path to generic directory seperators\n\tboost::filesystem::path genericPath(homePath);\n\treturn genericPath.generic_string();\n}\n\nint runShutdownCommand()\n{\n#if defined(WIN32)\n\treturn system(\"shutdown -s -t 0\");\n#elif defined(__linux__)\n\tsync();\n\treturn reboot(RB_POWER_OFF);\n#else\n\treturn system(\"sudo shutdown -h now\");\n#endif\n}\n\nint runRestartCommand()\n{\n#if defined(WIN32)\n\treturn system(\"shutdown -r -t 0\");\n#elif defined(__linux__)\n\tsync();\n\treturn reboot(RB_AUTOBOOT);\n#else\n\treturn system(\"sudo shutdown -r now\");\n#endif\n}\n\nint runSystemCommand(const std::string& cmd_utf8)\n{\n#ifdef WIN32\n\t\/\/ on Windows we use _wsystem to support non-ASCII paths\n\t\/\/ which requires converting from utf8 to a wstring\n\ttypedef std::codecvt_utf8<wchar_t> convert_type;\n\tstd::wstring_convert<convert_type, wchar_t> converter;\n\tstd::wstring wchar_str = converter.from_bytes(cmd_utf8);\n\treturn _wsystem(wchar_str.c_str());\n#else\n\treturn system(cmd_utf8.c_str());\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QGuiApplication>\r\n#include <QQuickView>\r\n#include <QQmlEngine>\r\n#include <QQmlContext>\r\n#include <QTimer>\r\n#include <QPalette>\r\n#include <QFontDatabase>\r\n#include \"Comms.h\"\r\n#include \"Video_Decoder.h\"\r\n#include \"QMLMenus.h\"\r\n#include \"QMLVideoSurface.h\"\r\n#include \"QMLTelemetry.h\"\r\n\r\n\/\/#include \"Menu_System.h\"\r\n\/\/#include \"Splash_Menu_Page.h\"\r\n\r\n\/\/#include \"Main_Menu_Page.h\"\r\n\r\n#include \"utils\/Clock.h\"\r\n#include \"HAL.h\"\r\n\r\nnamespace silk\r\n{\r\n\r\nint s_version_major = 1;\r\nint s_version_minor = 0;\r\n\r\nstd::string s_program_path;\r\n\r\nsilk::HAL s_hal;\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/This prints an \"Assertion failed\" message and aborts.\r\nvoid __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function)\r\n{\r\n QASSERT_MSG(false, \"assert: {}:{}: {}: {}\", __file, __line, __function, __assertion);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nvoid signal_callback_handler(int signum)\r\n{\r\n printf(\"Caught signal %d\\n\", signum);\r\n silk::s_hal.shutdown();\r\n exit(signum);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n q::logging::add_logger(q::logging::Logger_uptr(new q::logging::Console_Logger()));\r\n q::logging::set_decorations(q::logging::Decorations(q::logging::Decoration::TIMESTAMP, q::logging::Decoration::LEVEL, q::logging::Decoration::TOPIC));\r\n\r\n\r\n \/\/ boost::shared_ptr<asio::io_service::work> work(new asio::io_service::work(s_async_io_service));\r\n \/\/ std::thread_group worker_threads;\r\n \/\/ for(int x = 0; x < 4; ++x)\r\n \/\/ {\r\n \/\/ worker_threads.create_thread(boost::bind(&asio::io_service::run, &s_async_io_service));\r\n \/\/ }\r\n\r\n signal(SIGHUP, signal_callback_handler);\r\n signal(SIGINT, signal_callback_handler);\r\n signal(SIGCONT, signal_callback_handler);\r\n signal(SIGTERM, signal_callback_handler);\r\n\r\n silk::s_program_path = argv[0];\r\n size_t off = silk::s_program_path.find_last_of('\/');\r\n if (off != std::string::npos)\r\n {\r\n silk::s_program_path = silk::s_program_path.substr(0, off);\r\n }\r\n QLOGI(\"Program path: {}.\", silk::s_program_path);\r\n\r\n\r\n silk::HAL& hal = silk::s_hal;\r\n ts::Result<void> result = hal.init();\r\n if (result != ts::success)\r\n {\r\n QLOGE(\"Cannot init hal: {}.\", result.error().what());\r\n exit(1);\r\n }\r\n\r\n Q_INIT_RESOURCE(res);\r\n\r\n QGuiApplication app(argc, argv);\r\n\r\n QCoreApplication::setOrganizationName(\"Silkopter\");\r\n QCoreApplication::setOrganizationDomain(\"silkopter.com\");\r\n QCoreApplication::setApplicationName(\"Silkopter\");\r\n\r\n QFontDatabase::addApplicationFont(\":\/fonts\/Play-Bold.ttf\");\r\n int id = QFontDatabase::addApplicationFont(\":\/fonts\/Play-Regular.ttf\");\r\n QString family = QFontDatabase::applicationFontFamilies(id).at(0);\r\n QFont font(family);\r\n QGuiApplication::setFont(font);\r\n\r\n app.setQuitOnLastWindowClosed(true);\r\n\r\n QPalette palette = app.palette();\r\n palette.setColor(QPalette::Window, QColor(53,53,53));\r\n palette.setColor(QPalette::WindowText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Base, QColor(25,25,25));\r\n palette.setColor(QPalette::AlternateBase, QColor(53,53,53));\r\n palette.setColor(QPalette::ToolTipBase, QColor(0xECF0F1));\r\n palette.setColor(QPalette::ToolTipText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Text, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Button, QColor(53,53,53));\r\n palette.setColor(QPalette::ButtonText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::BrightText, Qt::white);\r\n palette.setColor(QPalette::Link, QColor(42, 130, 218));\r\n\r\n palette.setColor(QPalette::Highlight, QColor(42, 130, 218));\r\n palette.setColor(QPalette::HighlightedText, Qt::black);\r\n\r\n app.setPalette(palette);\r\n\r\n QQuickView view;\r\n\r\n QMLMenus menus;\r\n menus.init(view);\r\n\r\n QMLTelemetry telemetry;\r\n\r\n qmlRegisterType<QMLTelemetry>(\"com.silk.Telemetry\", 1, 0, \"Telemetry\");\r\n view.engine()->rootContext()->setContextProperty(\"s_telemetry\", &telemetry);\r\n view.engine()->rootContext()->setContextProperty(\"s_menus\", &menus);\r\n qmlRegisterType<QMLVideoSurface>(\"com.silk.VideoSurface\", 0, 1, \"VideoSurface\");\r\n\r\n Video_Decoder decoder;\r\n\r\n size_t render_frames = 0;\r\n\r\n QObject::connect(&view, &QQuickView::frameSwapped, [&render_frames, &decoder]()\r\n {\r\n decoder.release_buffers();\r\n render_frames++;\r\n });\r\n\r\n QObject::connect(&view, &QQuickView::sceneGraphInitialized, [&decoder]()\r\n {\r\n decoder.init();\r\n QMLVideoSurface::init(decoder);\r\n });\r\n\r\n std::vector<uint8_t> video_data;\r\n math::vec2u16 resolution;\r\n QObject::connect(&view, &QQuickView::beforeRendering, [&video_data, &resolution, &decoder]()\r\n {\r\n decoder.decode_data(video_data.data(), video_data.size(), resolution);\r\n video_data.clear();\r\n QMLVideoSurface::setResolution(resolution);\r\n });\r\n\r\n QSurfaceFormat format = view.format();\r\n format.setAlphaBufferSize(0);\r\n format.setRedBufferSize(8);\r\n format.setGreenBufferSize(8);\r\n format.setBlueBufferSize(8);\r\n format.setSamples(1);\r\n format.setSwapBehavior(QSurfaceFormat::TripleBuffer);\r\n format.setSwapInterval(0);\r\n view.setFormat(format);\r\n\r\n view.setClearBeforeRendering(false);\r\n view.resize(800, 480);\r\n view.setResizeMode(QQuickView::SizeRootObjectToView);\r\n view.setPersistentOpenGLContext(true);\r\n view.create();\r\n view.show();\r\n\r\n menus.push(\"Splash.qml\");\r\n\r\n hal.get_comms().get_video_streamer().on_data_received = [&video_data, &resolution](void const* data, size_t size, math::vec2u16 const& res)\r\n {\r\n size_t offset = video_data.size();\r\n video_data.resize(offset + size);\r\n memcpy(video_data.data() + offset, data, size);\r\n resolution = res;\r\n };\r\n\r\n q::Clock::time_point last_tp = q::Clock::now();\r\n size_t process_frames = 0;\r\n\r\n while (true)\r\n {\r\n hal.process();\r\n app.processEvents();\r\n\r\n telemetry.setData(hal.get_comms().get_multirotor_state(), silk::stream::IMultirotor_Commands::Value());\r\n\r\n process_frames++;\r\n if (q::Clock::now() - last_tp >= std::chrono::seconds(1))\r\n {\r\n last_tp = q::Clock::now();\r\n QLOGI(\"P FPS: {}, R FPS: {}\", process_frames, render_frames);\r\n process_frames = 0;\r\n render_frames = 0;\r\n }\r\n\r\n \/\/std::this_thread::sleep_for(std::chrono::microseconds(1));\r\n }\r\n\r\n hal.shutdown();\r\n\r\n return 0;\r\n}\r\n<commit_msg>Added HUD<commit_after>#include <QGuiApplication>\r\n#include <QQuickView>\r\n#include <QQmlEngine>\r\n#include <QQmlContext>\r\n#include <QTimer>\r\n#include <QPalette>\r\n#include <QFontDatabase>\r\n#include \"Comms.h\"\r\n#include \"Video_Decoder.h\"\r\n#include \"QMLMenus.h\"\r\n#include \"QMLVideoSurface.h\"\r\n#include \"QMLHUD.h\"\r\n\r\n\/\/#include \"Menu_System.h\"\r\n\/\/#include \"Splash_Menu_Page.h\"\r\n\r\n\/\/#include \"Main_Menu_Page.h\"\r\n\r\n#include \"utils\/Clock.h\"\r\n#include \"HAL.h\"\r\n\r\nnamespace silk\r\n{\r\n\r\nint s_version_major = 1;\r\nint s_version_minor = 0;\r\n\r\nstd::string s_program_path;\r\n\r\nsilk::HAL s_hal;\r\n\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n\/\/This prints an \"Assertion failed\" message and aborts.\r\nvoid __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function)\r\n{\r\n QASSERT_MSG(false, \"assert: {}:{}: {}: {}\", __file, __line, __function, __assertion);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nvoid signal_callback_handler(int signum)\r\n{\r\n printf(\"Caught signal %d\\n\", signum);\r\n silk::s_hal.shutdown();\r\n exit(signum);\r\n}\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n q::logging::add_logger(q::logging::Logger_uptr(new q::logging::Console_Logger()));\r\n q::logging::set_decorations(q::logging::Decorations(q::logging::Decoration::TIMESTAMP, q::logging::Decoration::LEVEL, q::logging::Decoration::TOPIC));\r\n\r\n\r\n \/\/ boost::shared_ptr<asio::io_service::work> work(new asio::io_service::work(s_async_io_service));\r\n \/\/ std::thread_group worker_threads;\r\n \/\/ for(int x = 0; x < 4; ++x)\r\n \/\/ {\r\n \/\/ worker_threads.create_thread(boost::bind(&asio::io_service::run, &s_async_io_service));\r\n \/\/ }\r\n\r\n signal(SIGHUP, signal_callback_handler);\r\n signal(SIGINT, signal_callback_handler);\r\n signal(SIGCONT, signal_callback_handler);\r\n signal(SIGTERM, signal_callback_handler);\r\n\r\n silk::s_program_path = argv[0];\r\n size_t off = silk::s_program_path.find_last_of('\/');\r\n if (off != std::string::npos)\r\n {\r\n silk::s_program_path = silk::s_program_path.substr(0, off);\r\n }\r\n QLOGI(\"Program path: {}.\", silk::s_program_path);\r\n\r\n\r\n silk::HAL& hal = silk::s_hal;\r\n ts::Result<void> result = hal.init();\r\n if (result != ts::success)\r\n {\r\n QLOGE(\"Cannot init hal: {}.\", result.error().what());\r\n exit(1);\r\n }\r\n\r\n Q_INIT_RESOURCE(res);\r\n\r\n QGuiApplication app(argc, argv);\r\n\r\n QCoreApplication::setOrganizationName(\"Silkopter\");\r\n QCoreApplication::setOrganizationDomain(\"silkopter.com\");\r\n QCoreApplication::setApplicationName(\"Silkopter\");\r\n\r\n QFontDatabase::addApplicationFont(\":\/fonts\/Play-Bold.ttf\");\r\n int id = QFontDatabase::addApplicationFont(\":\/fonts\/Play-Regular.ttf\");\r\n QString family = QFontDatabase::applicationFontFamilies(id).at(0);\r\n QFont font(family);\r\n QGuiApplication::setFont(font);\r\n\r\n app.setQuitOnLastWindowClosed(true);\r\n\r\n QPalette palette = app.palette();\r\n palette.setColor(QPalette::Window, QColor(53,53,53));\r\n palette.setColor(QPalette::WindowText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Base, QColor(25,25,25));\r\n palette.setColor(QPalette::AlternateBase, QColor(53,53,53));\r\n palette.setColor(QPalette::ToolTipBase, QColor(0xECF0F1));\r\n palette.setColor(QPalette::ToolTipText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Text, QColor(0xECF0F1));\r\n palette.setColor(QPalette::Button, QColor(53,53,53));\r\n palette.setColor(QPalette::ButtonText, QColor(0xECF0F1));\r\n palette.setColor(QPalette::BrightText, Qt::white);\r\n palette.setColor(QPalette::Link, QColor(42, 130, 218));\r\n\r\n palette.setColor(QPalette::Highlight, QColor(42, 130, 218));\r\n palette.setColor(QPalette::HighlightedText, Qt::black);\r\n\r\n app.setPalette(palette);\r\n\r\n QQuickView view;\r\n\r\n QMLMenus menus;\r\n menus.init(view);\r\n\r\n QMLHUD hud;\r\n hud.init(hal);\r\n\r\n qmlRegisterType<QMLHUD>(\"com.silk.HUD\", 1, 0, \"HUD\");\r\n view.engine()->rootContext()->setContextProperty(\"s_hud\", &hud);\r\n view.engine()->rootContext()->setContextProperty(\"s_menus\", &menus);\r\n qmlRegisterType<QMLVideoSurface>(\"com.silk.VideoSurface\", 0, 1, \"VideoSurface\");\r\n\r\n Video_Decoder decoder;\r\n\r\n size_t render_frames = 0;\r\n\r\n q::Clock::time_point last_swapped_tp = q::Clock::now();\r\n QObject::connect(&view, &QQuickView::frameSwapped, [&render_frames, &decoder, &last_swapped_tp]()\r\n {\r\n\/\/ std::chrono::duration<float> dt = q::Clock::now() - last_swapped_tp;\r\n\/\/ last_swapped_tp = q::Clock::now();\r\n\/\/ QLOGI(\"Frame DT: {}\", dt.count());\r\n\r\n decoder.release_buffers();\r\n render_frames++;\r\n });\r\n\r\n QObject::connect(&view, &QQuickView::sceneGraphInitialized, [&decoder]()\r\n {\r\n decoder.init();\r\n QMLVideoSurface::init(decoder);\r\n });\r\n\r\n std::vector<uint8_t> video_data;\r\n math::vec2u16 resolution;\r\n QObject::connect(&view, &QQuickView::beforeRendering, [&video_data, &resolution, &decoder]()\r\n {\r\n decoder.decode_data(video_data.data(), video_data.size(), resolution);\r\n video_data.clear();\r\n QMLVideoSurface::setResolution(resolution);\r\n });\r\n\r\n QSurfaceFormat format = view.format();\r\n format.setAlphaBufferSize(0);\r\n format.setRedBufferSize(8);\r\n format.setGreenBufferSize(8);\r\n format.setBlueBufferSize(8);\r\n format.setSamples(1);\r\n format.setSwapBehavior(QSurfaceFormat::TripleBuffer);\r\n \/\/format.setSwapInterval(0);\r\n view.setFormat(format);\r\n\r\n view.setClearBeforeRendering(false);\r\n view.resize(800, 480);\r\n view.setResizeMode(QQuickView::SizeRootObjectToView);\r\n view.setPersistentOpenGLContext(true);\r\n view.create();\r\n view.show();\r\n\r\n menus.push(\"HUD.qml\");\r\n\r\n hal.get_comms().get_video_streamer().on_data_received = [&video_data, &resolution](void const* data, size_t size, math::vec2u16 const& res)\r\n {\r\n size_t offset = video_data.size();\r\n video_data.resize(offset + size);\r\n memcpy(video_data.data() + offset, data, size);\r\n resolution = res;\r\n };\r\n\r\n q::Clock::time_point last_tp = q::Clock::now();\r\n size_t process_frames = 0;\r\n\r\n while (true)\r\n {\r\n hal.process();\r\n hud.process();\r\n app.processEvents();\r\n\r\n process_frames++;\r\n if (q::Clock::now() - last_tp >= std::chrono::seconds(1))\r\n {\r\n last_tp = q::Clock::now();\r\n QLOGI(\"P FPS: {}, R FPS: {}\", process_frames, render_frames);\r\n process_frames = 0;\r\n render_frames = 0;\r\n }\r\n\r\n \/\/std::this_thread::sleep_for(std::chrono::microseconds(1));\r\n }\r\n\r\n hal.shutdown();\r\n\r\n return 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dbexception.hxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: obo $ $Date: 2006-07-10 14:16:08 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#define _DBHELPER_DBEXCEPTION_HXX_\n\n#ifndef _COM_SUN_STAR_SDBC_SQLEXCEPTION_HPP_\n#include <com\/sun\/star\/sdbc\/SQLException.hpp>\n#endif\n\nnamespace com\n{\n namespace sun\n {\n namespace star\n {\n namespace sdb\n {\n class SQLContext;\n struct SQLErrorEvent;\n }\n namespace sdbc\n {\n class SQLWarning;\n }\n }\n }\n}\n\/\/.........................................................................\nnamespace dbtools\n{\n\/\/.........................................................................\n\n\/\/----------------------------------------------------------------------------------\n\/** standard SQLStates to be used with an SQLException\n\n Extend this list whenever you need a new state ...\n\n @see http:\/\/msdn.microsoft.com\/library\/default.asp?url=\/library\/en-us\/odbc\/htm\/odbcodbc_error_codes.asp\n*\/\nenum StandardSQLState\n{\n SQL_WRONG_PARAMETER_NUMBER, \/\/ 07001\n SQL_INVALID_DESCRIPTOR_INDEX, \/\/ 07009\n SQL_UNABLE_TO_CONNECT, \/\/ 08001\n SQL_NUMERIC_OUT_OF_RANGE, \/\/ 22003\n SQL_INVALID_DATE_TIME, \/\/ 22007\n SQL_INVALID_CURSOR_STATE, \/\/ 24000\n SQL_TABLE_OR_VIEW_EXISTS, \/\/ 42S01\n SQL_TABLE_OR_VIEW_NOT_FOUND, \/\/ 42S02\n SQL_INDEX_ESISTS, \/\/ 42S11\n SQL_INDEX_NOT_FOUND, \/\/ 42S12\n SQL_COLUMN_EXISTS, \/\/ 42S21\n SQL_COLUMN_NOT_FOUND, \/\/ 42S22\n SQL_GENERAL_ERROR, \/\/ HY000\n SQL_OPERATION_CANCELED, \/\/ HY008\n SQL_FUNCTION_SEQUENCE_ERROR, \/\/ HY010\n SQL_INVALID_CURSOR_POSITION, \/\/ HY109\n SQL_INVALID_BOOKMARK_VALUE, \/\/ HY111\n SQL_FEATURE_NOT_IMPLEMENTED, \/\/ HYC00\n SQL_FUNCTION_NOT_SUPPORTED, \/\/ IM001\n SQL_CONNECTION_DOES_NOT_EXIST, \/\/ 08003\n\n SQL_CYCLIC_SUB_QUERIES, \/\/ OB001\n\n SQL_ERROR_UNSPECIFIED = SAL_MAX_ENUM \/\/ special value indicating that an SQLState is not to be specified\n};\n\n\/\/==============================================================================\n\/\/= SQLExceptionInfo - encapsulating the type info of an SQLException-derived class\n\/\/==============================================================================\n\nclass SQLExceptionInfo\n{\npublic:\n enum TYPE { SQL_EXCEPTION, SQL_WARNING, SQL_CONTEXT, UNDEFINED };\n\nprivate:\n ::com::sun::star::uno::Any m_aContent;\n TYPE m_eType; \/\/ redundant (could be derived from m_aContent.getValueType())\n\npublic:\n SQLExceptionInfo();\n SQLExceptionInfo(const ::com::sun::star::sdbc::SQLException& _rError);\n SQLExceptionInfo(const ::com::sun::star::sdbc::SQLWarning& _rError);\n SQLExceptionInfo(const ::com::sun::star::sdb::SQLContext& _rError);\n\n \/** convenience constructor\n\n If your error processing relies on SQLExceptions, and SQLExceptionInfos, you still may\n need to display an error which consists of a simple message string only.\n In those cases, you can use this constructor, which behaves as if you would have used\n an SQLException containing exactly the given error message.\n *\/\n SQLExceptionInfo( const ::rtl::OUString& _rSimpleErrorMessage );\n\n SQLExceptionInfo(const SQLExceptionInfo& _rCopySource);\n\n SQLExceptionInfo(const ::com::sun::star::sdb::SQLErrorEvent& _rError);\n \/\/ use for events got via XSQLErrorListener::errorOccured\n SQLExceptionInfo(const ::com::sun::star::uno::Any& _rError);\n \/\/ use with the Reason member of an SQLErrorEvent or with NextElement of an SQLException\n\n \/** prepends a plain error message to the chain of exceptions\n @param _rSimpleErrorMessage\n the error message to prepend\n @param _pAsciiSQLState\n the SQLState of the to-be-constructed SQLException, or NULL if this should be defaulted to HY000\n @param _nErrorCode\n the ErrorCode of the to-be-constructed SQLException\n *\/\n void prepend( const ::rtl::OUString& _rErrorMessage, const sal_Char* _pAsciiSQLState = NULL, const sal_Int32 _nErrorCode = 0 );\n\n \/** appends a plain message to the chain of exceptions\n @param _eType\n the type of exception to append. Must be SQL_EXCEPTION, SQL_WARNING, SQL_CONTEXT, for all other\n values, the behavior is undefined.\n @param _rErrorMessage\n the message to append\n @param _pAsciiSQLState\n the SQLState of the exception to append\n @param _nErrorCode\n the error code of the exception to append\n *\/\n void append( TYPE _eType, const ::rtl::OUString& _rErrorMessage, const sal_Char* _pAsciiSQLState = NULL, const sal_Int32 _nErrorCode = 0 );\n\n \/** throws (properly typed) the exception contained in the object\n @precond\n isValid() returns <TRUE\/>\n @throws SQLException\n @throws RuntimeException\n if the instance does not contain an SQLException\n *\/\n void doThrow();\n\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdbc::SQLException& _rError);\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdbc::SQLWarning& _rError);\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdb::SQLContext& _rError);\n\n sal_Bool isKindOf(TYPE _eType) const;\n \/\/ not just a simple comparisation ! e.g. getType() == SQL_CONTEXT implies isKindOf(SQL_EXCEPTION) == sal_True !\n sal_Bool isValid() const { return m_eType != UNDEFINED; }\n TYPE getType() const { return m_eType; }\n\n operator const ::com::sun::star::sdbc::SQLException* () const;\n operator const ::com::sun::star::sdbc::SQLWarning* () const;\n operator const ::com::sun::star::sdb::SQLContext* () const;\n\n const ::com::sun::star::uno::Any& get() const { return m_aContent; }\n\nprotected:\n void implDetermineType();\n};\n\n\/\/==============================================================================\n\/\/= SQLExceptionIteratorHelper - iterating through an SQLException chain\n\/\/==============================================================================\n\nclass SQLExceptionIteratorHelper\n{\nprotected:\n const ::com::sun::star::sdbc::SQLException* m_pCurrent;\n SQLExceptionInfo::TYPE m_eCurrentType;\n\npublic:\n \/** constructs an iterator instance from an SQLException\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdbc::SQLException& _rChainStart );\n\n \/** constructs an iterator instance from an SQLWarning\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdbc::SQLWarning& _rChainStart );\n\n \/** constructs an iterator instance from an SQLContext\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdb::SQLContext& _rChainStart );\n\n \/** constructs an iterator instance from an SQLExceptionInfo\n\n @param _rErrorInfo\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const SQLExceptionInfo& _rErrorInfo );\n\n \/** determines whether there are more elements in the exception chain\n *\/\n sal_Bool hasMoreElements() const { return ( m_pCurrent != NULL ); }\n\n \/** returns the type of the current element in the exception chain\n *\/\n SQLExceptionInfo::TYPE currentType() const { return m_eCurrentType; }\n\n \/** retrieves the current element in the chain, or <NULL\/> if the chain has been completely\n traveled.\n *\/\n const ::com::sun::star::sdbc::SQLException* current() const { return m_pCurrent; }\n\n \/** retrieves the current element in the chain, or <NULL\/> if the chain has been completely\n traveled.\n\n In opposite to the second <member>current<\/member>, this version allows typed access to\n the respective SQLException.\n *\/\n void current( SQLExceptionInfo& _out_rInfo ) const;\n\n \/** proceeds to the next element in the chain\n\n @return the current element in the chain, as <b>before<\/em> the chain move.\n *\/\n const ::com::sun::star::sdbc::SQLException* next();\n\n \/** proceeds to the next element in the chain\n\n In opposite to the second <member>current<\/member>, this version allows typed access to\n the respective SQLException.\n *\/\n void next( SQLExceptionInfo& _out_rInfo );\n};\n\n\/\/==================================================================================\n\/\/= StandardExceptions\n\/\/==================================================================================\n\/\/----------------------------------------------------------------------------------\n\/** returns a standard error string for a given SQLState\n\n @param _eState\n describes the state whose description is to retrieve. Must not be SQL_ERROR_UNSPECIFIED.\n @raises RuntimeException\n in case of an internal error\n*\/\n::rtl::OUString getStandardSQLState( StandardSQLState _eState );\n\n\/\/----------------------------------------------------------------------------------\n\/** returns a standard ASCII string for a given SQLState\n\n @param _eState\n describes the state whose description is to retrieve. Must not be SQL_ERROR_UNSPECIFIED.\n @return\n a non-<NULL\/> pointer to an ASCII character string denoting the requested SQLState\n @raises RuntimeException\n in case of an internal error\n*\/\nconst sal_Char* getStandardSQLStateAscii( StandardSQLState _eState );\n\n\/\/----------------------------------------------------------------------------------\nvoid throwFunctionNotSupportedException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an exception with SQL state IM001, saying that a certain function is not supported\n*\/\nvoid throwFunctionNotSupportedException(\n const sal_Char* _pAsciiFunctionName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throws a function sequence (HY010) exception\n*\/\nvoid throwFunctionSequenceException(\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a invalid index sqlexception\n*\/\nvoid throwInvalidIndexException(\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a generic SQLException, i.e. one with an SQLState of HY000, an ErrorCode of 0 and no NextException\n*\/\nvoid throwGenericSQLException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxSource\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a generic SQLException, i.e. one with an SQLState of HY000, an ErrorCode of 0 and no NextException\n*\/\nvoid throwGenericSQLException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxSource,\n const ::com::sun::star::uno::Any& _rNextException\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a SQLException with SQLState HYC00 (Optional feature not implemented)\n @param _pAsciiFeatureName\n an ASCII description of the feature which is not implemented. It's recommended that the feature\n name is built from the name of the interface plus its method, for instance \"XParameters::updateBinaryStream\"\n @param _rxContext\n the context of the exception\n @param _pNextException\n the next exception to chain into the thrown exception, if any\n*\/\nvoid throwFeatureNotImplementedException(\n const sal_Char* _pAsciiFeatureName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const sal_Char* _pAsciiMessage,\n const sal_Char* _pAsciiState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const sal_Char* _pAsciiMessage,\n StandardSQLState _eSQLState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const ::rtl::OUString& _rMessage,\n StandardSQLState _eSQLState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/.........................................................................\n} \/\/ namespace dbtools\n\/\/.........................................................................\n\n#endif \/\/ _DBHELPER_DBEXCEPTION_HXX_\n\n\n<commit_msg>INTEGRATION: CWS dba22a (1.16.66); FILE MERGED 2006\/11\/22 20:45:48 fs 1.16.66.1: #i71860# assignment from SQLErrorEvent and Any<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dbexception.hxx,v $\n *\n * $Revision: 1.17 $\n *\n * last change: $Author: rt $ $Date: 2006-12-01 16:49:28 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _DBHELPER_DBEXCEPTION_HXX_\n#define _DBHELPER_DBEXCEPTION_HXX_\n\n#ifndef _COM_SUN_STAR_SDBC_SQLEXCEPTION_HPP_\n#include <com\/sun\/star\/sdbc\/SQLException.hpp>\n#endif\n\nnamespace com\n{\n namespace sun\n {\n namespace star\n {\n namespace sdb\n {\n class SQLContext;\n struct SQLErrorEvent;\n }\n namespace sdbc\n {\n class SQLWarning;\n }\n }\n }\n}\n\/\/.........................................................................\nnamespace dbtools\n{\n\/\/.........................................................................\n\n\/\/----------------------------------------------------------------------------------\n\/** standard SQLStates to be used with an SQLException\n\n Extend this list whenever you need a new state ...\n\n @see http:\/\/msdn.microsoft.com\/library\/default.asp?url=\/library\/en-us\/odbc\/htm\/odbcodbc_error_codes.asp\n*\/\nenum StandardSQLState\n{\n SQL_WRONG_PARAMETER_NUMBER, \/\/ 07001\n SQL_INVALID_DESCRIPTOR_INDEX, \/\/ 07009\n SQL_UNABLE_TO_CONNECT, \/\/ 08001\n SQL_NUMERIC_OUT_OF_RANGE, \/\/ 22003\n SQL_INVALID_DATE_TIME, \/\/ 22007\n SQL_INVALID_CURSOR_STATE, \/\/ 24000\n SQL_TABLE_OR_VIEW_EXISTS, \/\/ 42S01\n SQL_TABLE_OR_VIEW_NOT_FOUND, \/\/ 42S02\n SQL_INDEX_ESISTS, \/\/ 42S11\n SQL_INDEX_NOT_FOUND, \/\/ 42S12\n SQL_COLUMN_EXISTS, \/\/ 42S21\n SQL_COLUMN_NOT_FOUND, \/\/ 42S22\n SQL_GENERAL_ERROR, \/\/ HY000\n SQL_OPERATION_CANCELED, \/\/ HY008\n SQL_FUNCTION_SEQUENCE_ERROR, \/\/ HY010\n SQL_INVALID_CURSOR_POSITION, \/\/ HY109\n SQL_INVALID_BOOKMARK_VALUE, \/\/ HY111\n SQL_FEATURE_NOT_IMPLEMENTED, \/\/ HYC00\n SQL_FUNCTION_NOT_SUPPORTED, \/\/ IM001\n SQL_CONNECTION_DOES_NOT_EXIST, \/\/ 08003\n\n SQL_CYCLIC_SUB_QUERIES, \/\/ OB001\n\n SQL_ERROR_UNSPECIFIED = SAL_MAX_ENUM \/\/ special value indicating that an SQLState is not to be specified\n};\n\n\/\/==============================================================================\n\/\/= SQLExceptionInfo - encapsulating the type info of an SQLException-derived class\n\/\/==============================================================================\n\nclass SQLExceptionInfo\n{\npublic:\n enum TYPE { SQL_EXCEPTION, SQL_WARNING, SQL_CONTEXT, UNDEFINED };\n\nprivate:\n ::com::sun::star::uno::Any m_aContent;\n TYPE m_eType; \/\/ redundant (could be derived from m_aContent.getValueType())\n\npublic:\n SQLExceptionInfo();\n SQLExceptionInfo(const ::com::sun::star::sdbc::SQLException& _rError);\n SQLExceptionInfo(const ::com::sun::star::sdbc::SQLWarning& _rError);\n SQLExceptionInfo(const ::com::sun::star::sdb::SQLContext& _rError);\n\n \/** convenience constructor\n\n If your error processing relies on SQLExceptions, and SQLExceptionInfos, you still may\n need to display an error which consists of a simple message string only.\n In those cases, you can use this constructor, which behaves as if you would have used\n an SQLException containing exactly the given error message.\n *\/\n SQLExceptionInfo( const ::rtl::OUString& _rSimpleErrorMessage );\n\n SQLExceptionInfo(const SQLExceptionInfo& _rCopySource);\n\n SQLExceptionInfo(const ::com::sun::star::sdb::SQLErrorEvent& _rError);\n \/\/ use for events got via XSQLErrorListener::errorOccured\n SQLExceptionInfo(const ::com::sun::star::uno::Any& _rError);\n \/\/ use with the Reason member of an SQLErrorEvent or with NextElement of an SQLException\n\n \/** prepends a plain error message to the chain of exceptions\n @param _rSimpleErrorMessage\n the error message to prepend\n @param _pAsciiSQLState\n the SQLState of the to-be-constructed SQLException, or NULL if this should be defaulted to HY000\n @param _nErrorCode\n the ErrorCode of the to-be-constructed SQLException\n *\/\n void prepend( const ::rtl::OUString& _rErrorMessage, const sal_Char* _pAsciiSQLState = NULL, const sal_Int32 _nErrorCode = 0 );\n\n \/** appends a plain message to the chain of exceptions\n @param _eType\n the type of exception to append. Must be SQL_EXCEPTION, SQL_WARNING, SQL_CONTEXT, for all other\n values, the behavior is undefined.\n @param _rErrorMessage\n the message to append\n @param _pAsciiSQLState\n the SQLState of the exception to append\n @param _nErrorCode\n the error code of the exception to append\n *\/\n void append( TYPE _eType, const ::rtl::OUString& _rErrorMessage, const sal_Char* _pAsciiSQLState = NULL, const sal_Int32 _nErrorCode = 0 );\n\n \/** throws (properly typed) the exception contained in the object\n @precond\n isValid() returns <TRUE\/>\n @throws SQLException\n @throws RuntimeException\n if the instance does not contain an SQLException\n *\/\n void doThrow();\n\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdbc::SQLException& _rError);\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdbc::SQLWarning& _rError);\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdb::SQLContext& _rError);\n const SQLExceptionInfo& operator=(const ::com::sun::star::sdb::SQLErrorEvent& _rErrorEvent);\n const SQLExceptionInfo& operator=(const ::com::sun::star::uno::Any& _rCaughtSQLException);\n\n sal_Bool isKindOf(TYPE _eType) const;\n \/\/ not just a simple comparisation ! e.g. getType() == SQL_CONTEXT implies isKindOf(SQL_EXCEPTION) == sal_True !\n sal_Bool isValid() const { return m_eType != UNDEFINED; }\n TYPE getType() const { return m_eType; }\n\n operator const ::com::sun::star::sdbc::SQLException* () const;\n operator const ::com::sun::star::sdbc::SQLWarning* () const;\n operator const ::com::sun::star::sdb::SQLContext* () const;\n\n const ::com::sun::star::uno::Any& get() const { return m_aContent; }\n\nprotected:\n void implDetermineType();\n};\n\n\/\/==============================================================================\n\/\/= SQLExceptionIteratorHelper - iterating through an SQLException chain\n\/\/==============================================================================\n\nclass SQLExceptionIteratorHelper\n{\nprotected:\n const ::com::sun::star::sdbc::SQLException* m_pCurrent;\n SQLExceptionInfo::TYPE m_eCurrentType;\n\npublic:\n \/** constructs an iterator instance from an SQLException\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdbc::SQLException& _rChainStart );\n\n \/** constructs an iterator instance from an SQLWarning\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdbc::SQLWarning& _rChainStart );\n\n \/** constructs an iterator instance from an SQLContext\n\n @param _rChainStart\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const ::com::sun::star::sdb::SQLContext& _rChainStart );\n\n \/** constructs an iterator instance from an SQLExceptionInfo\n\n @param _rErrorInfo\n the start of the exception chain to iterate. Must live as long as the iterator\n instances lives, at least.\n *\/\n SQLExceptionIteratorHelper( const SQLExceptionInfo& _rErrorInfo );\n\n \/** determines whether there are more elements in the exception chain\n *\/\n sal_Bool hasMoreElements() const { return ( m_pCurrent != NULL ); }\n\n \/** returns the type of the current element in the exception chain\n *\/\n SQLExceptionInfo::TYPE currentType() const { return m_eCurrentType; }\n\n \/** retrieves the current element in the chain, or <NULL\/> if the chain has been completely\n traveled.\n *\/\n const ::com::sun::star::sdbc::SQLException* current() const { return m_pCurrent; }\n\n \/** retrieves the current element in the chain, or <NULL\/> if the chain has been completely\n traveled.\n\n In opposite to the second <member>current<\/member>, this version allows typed access to\n the respective SQLException.\n *\/\n void current( SQLExceptionInfo& _out_rInfo ) const;\n\n \/** proceeds to the next element in the chain\n\n @return the current element in the chain, as <b>before<\/em> the chain move.\n *\/\n const ::com::sun::star::sdbc::SQLException* next();\n\n \/** proceeds to the next element in the chain\n\n In opposite to the second <member>current<\/member>, this version allows typed access to\n the respective SQLException.\n *\/\n void next( SQLExceptionInfo& _out_rInfo );\n};\n\n\/\/==================================================================================\n\/\/= StandardExceptions\n\/\/==================================================================================\n\/\/----------------------------------------------------------------------------------\n\/** returns a standard error string for a given SQLState\n\n @param _eState\n describes the state whose description is to retrieve. Must not be SQL_ERROR_UNSPECIFIED.\n @raises RuntimeException\n in case of an internal error\n*\/\n::rtl::OUString getStandardSQLState( StandardSQLState _eState );\n\n\/\/----------------------------------------------------------------------------------\n\/** returns a standard ASCII string for a given SQLState\n\n @param _eState\n describes the state whose description is to retrieve. Must not be SQL_ERROR_UNSPECIFIED.\n @return\n a non-<NULL\/> pointer to an ASCII character string denoting the requested SQLState\n @raises RuntimeException\n in case of an internal error\n*\/\nconst sal_Char* getStandardSQLStateAscii( StandardSQLState _eState );\n\n\/\/----------------------------------------------------------------------------------\nvoid throwFunctionNotSupportedException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an exception with SQL state IM001, saying that a certain function is not supported\n*\/\nvoid throwFunctionNotSupportedException(\n const sal_Char* _pAsciiFunctionName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throws a function sequence (HY010) exception\n*\/\nvoid throwFunctionSequenceException(\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a invalid index sqlexception\n*\/\nvoid throwInvalidIndexException(\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _Context,\n const ::com::sun::star::uno::Any& _Next = ::com::sun::star::uno::Any()\n )\n throw ( ::com::sun::star::sdbc::SQLException );\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a generic SQLException, i.e. one with an SQLState of HY000, an ErrorCode of 0 and no NextException\n*\/\nvoid throwGenericSQLException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxSource\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a generic SQLException, i.e. one with an SQLState of HY000, an ErrorCode of 0 and no NextException\n*\/\nvoid throwGenericSQLException(\n const ::rtl::OUString& _rMsg,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxSource,\n const ::com::sun::star::uno::Any& _rNextException\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throw a SQLException with SQLState HYC00 (Optional feature not implemented)\n @param _pAsciiFeatureName\n an ASCII description of the feature which is not implemented. It's recommended that the feature\n name is built from the name of the interface plus its method, for instance \"XParameters::updateBinaryStream\"\n @param _rxContext\n the context of the exception\n @param _pNextException\n the next exception to chain into the thrown exception, if any\n*\/\nvoid throwFeatureNotImplementedException(\n const sal_Char* _pAsciiFeatureName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const sal_Char* _pAsciiMessage,\n const sal_Char* _pAsciiState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const sal_Char* _pAsciiMessage,\n StandardSQLState _eSQLState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/----------------------------------------------------------------------------------\n\/** throws an SQLException\n*\/\nvoid throwSQLException(\n const ::rtl::OUString& _rMessage,\n StandardSQLState _eSQLState,\n const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface >& _rxContext,\n const sal_Int32 _nErrorCode = 0,\n const ::com::sun::star::uno::Any* _pNextException = NULL\n )\n throw (::com::sun::star::sdbc::SQLException);\n\n\/\/.........................................................................\n} \/\/ namespace dbtools\n\/\/.........................................................................\n\n#endif \/\/ _DBHELPER_DBEXCEPTION_HXX_\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2011 by Frank Richter\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public\n License along with this library; if not, write to the Free\n Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n\n#include \"csutil\/syspath.h\"\n\n#include \"csutil\/csuctransform.h\"\n\nstatic inline int CS_mkdir (const char* path)\n{\n#if defined (__CYGWIN32__)\n return mkdir(path, 0755);\n#else\n size_t pathLen (strlen (path));\n size_t pathWlen (pathLen + 1);\n CS_ALLOC_STACK_ARRAY(wchar_t, pathW, pathWlen);\n csUnicodeTransform::UTF8toWC (pathW, pathWlen,\n (utf8_char*)path, pathLen);\n return _wmkdir (pathW);\n#endif\n}\n\nnamespace CS\n{\n namespace Platform\n {\n int CreateDirectory (const char* path)\n {\n int olderrno (errno);\n int result (0);\n if (CS_mkdir (path) < 0)\n {\n result = errno;\n }\n errno = olderrno;\n return result;\n }\n } \/\/ namespace Platform\n} \/\/ namespace CS\n<commit_msg>Compile fix for mingw.<commit_after>\/*\n Copyright (C) 2011 by Frank Richter\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public\n License along with this library; if not, write to the Free\n Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"cssysdef.h\"\n\n#include \"csutil\/syspath.h\"\n\n#include \"csutil\/csuctransform.h\"\n\ninline int CS_mkdir (const char* path)\n{\n#if defined (__CYGWIN32__)\n return mkdir(path, 0755);\n#else\n size_t pathLen (strlen (path));\n size_t pathWlen (pathLen + 1);\n CS_ALLOC_STACK_ARRAY(wchar_t, pathW, pathWlen);\n csUnicodeTransform::UTF8toWC (pathW, pathWlen,\n (utf8_char*)path, pathLen);\n return _wmkdir (pathW);\n#endif\n}\n\nnamespace CS\n{\n namespace Platform\n {\n int CreateDirectory (const char* path)\n {\n int olderrno (errno);\n int result (0);\n if (CS_mkdir (path) < 0)\n {\n result = errno;\n }\n errno = olderrno;\n return result;\n }\n } \/\/ namespace Platform\n} \/\/ namespace CS\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_rsc.hxx\"\n#include <stdio.h>\n#include <ctype.h>\n#include <string.h>\n\n#include <tools\/rc.h>\n#include <tools\/list.hxx>\n#include <rscerror.h>\n#include <rsctools.hxx>\n#include <rscclass.hxx>\n#include <rsccont.hxx>\n#include <rsctree.hxx>\n#include <rscdb.hxx>\n#include <rscdef.hxx>\n#include <rscpar.hxx>\n\n#include \"rsclex.hxx\"\n\n\/************** V a r i a b l e n ****************************************\/\nObjectStack S;\nRscTop * pCurClass;\nsal_uInt32 nCurMask;\nchar szErrBuf[ 100 ];\n\n\/************** H i l f s F u n k t i o n e n ****************************\/\nRSCINST GetVarInst( const RSCINST & rInst, const char * pVarName )\n{\n RSCINST aInst;\n\n aInst = rInst.pClass->GetVariable( rInst, pHS->getID( pVarName ),\n RSCINST() );\n\n if( !aInst.pData )\n pTC->pEH->Error( ERR_NOVARIABLENAME, rInst.pClass, RscId() );\n\n return( aInst );\n}\n\nvoid SetNumber( const RSCINST & rInst, const char * pVarName, INT32 lValue )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n\n if( aInst.pData ){\n ERRTYPE aError;\n aError = aInst.pClass->SetNumber( aInst, lValue );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nvoid SetConst( const RSCINST & rInst, const char * pVarName,\n Atom nValueId, INT32 nVal )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n if( aInst.pData )\n {\n ERRTYPE aError;\n aError = aInst.pClass->SetConst( aInst, nValueId, nVal );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nvoid SetString( const RSCINST & rInst, const char * pVarName, const char * pStr )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n if( aInst.pData ){\n ERRTYPE aError;\n aError = aInst.pClass->SetString( aInst, pStr );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nRscId MakeRscId( RscExpType aExpType )\n{\n if( !aExpType.IsNothing() ){\n INT32 lValue;\n\n if( !aExpType.Evaluate( &lValue ) )\n pTC->pEH->Error( ERR_ZERODIVISION, NULL, RscId() );\n if( lValue < 1 || lValue > (INT32)0x7FFF )\n {\n pTC->pEH->Error( ERR_IDRANGE, NULL, RscId(),\n ByteString::CreateFromInt32( lValue ).GetBuffer() );\n }\n\n if( aExpType.IsDefinition() )\n return RscId( aExpType.aExp.pDef );\n else\n return RscId( lValue );\n }\n return RscId();\n}\n\nBOOL DoClassHeader( RSCHEADER * pHeader, BOOL bMember )\n{\n RSCINST aCopyInst;\n RscId aName1 = MakeRscId( pHeader->nName1 );\n RscId aName2 = MakeRscId( pHeader->nName2 );\n\n if( pHeader->pRefClass )\n aCopyInst.pClass = pHeader->pRefClass;\n else\n aCopyInst.pClass = pHeader->pClass;\n\n if( TYPE_COPY == pHeader->nTyp )\n {\n ObjNode * pCopyObj = aCopyInst.pClass->GetObjNode( aName2 );\n\n if( !pCopyObj )\n {\n ByteString aMsg( pHS->getString( aCopyInst.pClass->GetId() ) );\n aMsg += ' ';\n aMsg += aName2.GetName();\n pTC->pEH->Error( ERR_NOCOPYOBJ, pHeader->pClass, aName1,\n aMsg.GetBuffer() );\n }\n else\n aCopyInst.pData = pCopyObj->GetRscObj();\n }\n\n if( bMember )\n {\n \/\/ Angabe von Superklassen oder abgeleiteten Klassen ist jetzt erlaubt\n if( S.Top().pClass->InHierarchy( pHeader->pClass )\n || pHeader->pClass->InHierarchy( S.Top().pClass) )\n {\n if( aCopyInst.IsInst() )\n {\n RSCINST aTmpI( S.Top() );\n aTmpI.pClass->Destroy( aTmpI );\n aTmpI.pClass->Create( &aTmpI, aCopyInst );\n };\n }\n else\n pTC->pEH->Error( ERR_FALSETYPE, S.Top().pClass, aName1,\n pHS->getString( pHeader->pClass->GetId() ) );\n }\n else\n {\n if( S.IsEmpty() )\n {\n if( (INT32)aName1 < 256 )\n pTC->pEH->Error( WRN_GLOBALID, pHeader->pClass, aName1 );\n\n if( aCopyInst.IsInst() )\n S.Push( pHeader->pClass->Create( NULL, aCopyInst ) );\n else\n S.Push( pHeader->pClass->Create( NULL, RSCINST() ) );\n\n ObjNode * pNode = new ObjNode( aName1, S.Top().pData,\n pFI->GetFileIndex() );\n pTC->pEH->StdOut( \".\", RscVerbosityVerbose );\n\n if( !aName1.IsId() )\n pTC->pEH->Error( ERR_IDEXPECTED, pHeader->pClass, aName1 );\n else if( !pHeader->pClass->PutObjNode( pNode ) )\n pTC->pEH->Error( ERR_DOUBLEID, pHeader->pClass, aName1 );\n }\n else\n {\n RSCINST aTmpI;\n ERRTYPE aError;\n\n if( (INT32)aName1 >= 256 && aName1.IsId() )\n pTC->pEH->Error( WRN_LOCALID, pHeader->pClass, aName1 );\n aError = S.Top().pClass->GetElement( S.Top(), aName1,\n pHeader->pClass, aCopyInst, &aTmpI );\n\n if( aError.IsWarning() )\n pTC->pEH->Error( aError, pHeader->pClass, aName1 );\n else if( aError.IsError() )\n {\n if( ERR_CONT_INVALIDTYPE == aError )\n pTC->pEH->Error( aError, S.Top().pClass, aName1,\n pHS->getString( pHeader->pClass->GetId() ) );\n else\n pTC->pEH->Error( aError, S.Top().pClass, aName1 );\n S.Top().pClass->GetElement( S.Top(), RscId(),\n pHeader->pClass, RSCINST(), &aTmpI );\n\n if( !aTmpI.IsInst() )\n return( FALSE );\n }\n S.Push( aTmpI );\n };\n };\n if( TYPE_REF == pHeader->nTyp )\n {\n ERRTYPE aError;\n\n aError = S.Top().pClass->SetRef( S.Top(), aName2 );\n pTC->pEH->Error( aError, S.Top().pClass, aName1 );\n }\n\n return( TRUE );\n}\n\nRSCINST GetFirstTupelEle( const RSCINST & rTop )\n{ \/\/ Aufwaertskompatible, Tupel probieren\n RSCINST aInst;\n ERRTYPE aErr;\n\n aErr = rTop.pClass->GetElement( rTop, RscId(), NULL, RSCINST(), &aInst );\n if( !aErr.IsError() )\n aInst = aInst.pClass->GetTupelVar( aInst, 0, RSCINST() );\n return aInst;\n}\n\n\/************** Y a c c C o d e ****************************************\/\n\/\/#define YYDEBUG 1\n\n#define TYPE_Atom 0\n#define TYPE_RESID 1\n\n#ifdef UNX\n#define YYMAXDEPTH 2000\n#else\n#ifdef W30\n#define YYMAXDEPTH 300\n#else\n#define YYMAXDEPTH 800\n#endif\n#endif\n\n#if defined _MSC_VER\n#pragma warning(push, 1)\n#pragma warning(disable:4129 4273 4701)\n#endif\n#include \"yyrscyacc.cxx\"\n#if defined _MSC_VER\n#pragma warning(pop)\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>disable this warning for yacc code too<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_rsc.hxx\"\n#include <stdio.h>\n#include <ctype.h>\n#include <string.h>\n\n#include <tools\/rc.h>\n#include <tools\/list.hxx>\n#include <rscerror.h>\n#include <rsctools.hxx>\n#include <rscclass.hxx>\n#include <rsccont.hxx>\n#include <rsctree.hxx>\n#include <rscdb.hxx>\n#include <rscdef.hxx>\n#include <rscpar.hxx>\n\n#include \"rsclex.hxx\"\n\n\/************** V a r i a b l e n ****************************************\/\nObjectStack S;\nRscTop * pCurClass;\nsal_uInt32 nCurMask;\nchar szErrBuf[ 100 ];\n\n\/************** H i l f s F u n k t i o n e n ****************************\/\nRSCINST GetVarInst( const RSCINST & rInst, const char * pVarName )\n{\n RSCINST aInst;\n\n aInst = rInst.pClass->GetVariable( rInst, pHS->getID( pVarName ),\n RSCINST() );\n\n if( !aInst.pData )\n pTC->pEH->Error( ERR_NOVARIABLENAME, rInst.pClass, RscId() );\n\n return( aInst );\n}\n\nvoid SetNumber( const RSCINST & rInst, const char * pVarName, INT32 lValue )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n\n if( aInst.pData ){\n ERRTYPE aError;\n aError = aInst.pClass->SetNumber( aInst, lValue );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nvoid SetConst( const RSCINST & rInst, const char * pVarName,\n Atom nValueId, INT32 nVal )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n if( aInst.pData )\n {\n ERRTYPE aError;\n aError = aInst.pClass->SetConst( aInst, nValueId, nVal );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nvoid SetString( const RSCINST & rInst, const char * pVarName, const char * pStr )\n{\n RSCINST aInst;\n\n aInst = GetVarInst( rInst, pVarName );\n if( aInst.pData ){\n ERRTYPE aError;\n aError = aInst.pClass->SetString( aInst, pStr );\n\n if( aError.IsError() )\n pTC->pEH->Error( aError, aInst.pClass, RscId() );\n }\n}\n\nRscId MakeRscId( RscExpType aExpType )\n{\n if( !aExpType.IsNothing() ){\n INT32 lValue;\n\n if( !aExpType.Evaluate( &lValue ) )\n pTC->pEH->Error( ERR_ZERODIVISION, NULL, RscId() );\n if( lValue < 1 || lValue > (INT32)0x7FFF )\n {\n pTC->pEH->Error( ERR_IDRANGE, NULL, RscId(),\n ByteString::CreateFromInt32( lValue ).GetBuffer() );\n }\n\n if( aExpType.IsDefinition() )\n return RscId( aExpType.aExp.pDef );\n else\n return RscId( lValue );\n }\n return RscId();\n}\n\nBOOL DoClassHeader( RSCHEADER * pHeader, BOOL bMember )\n{\n RSCINST aCopyInst;\n RscId aName1 = MakeRscId( pHeader->nName1 );\n RscId aName2 = MakeRscId( pHeader->nName2 );\n\n if( pHeader->pRefClass )\n aCopyInst.pClass = pHeader->pRefClass;\n else\n aCopyInst.pClass = pHeader->pClass;\n\n if( TYPE_COPY == pHeader->nTyp )\n {\n ObjNode * pCopyObj = aCopyInst.pClass->GetObjNode( aName2 );\n\n if( !pCopyObj )\n {\n ByteString aMsg( pHS->getString( aCopyInst.pClass->GetId() ) );\n aMsg += ' ';\n aMsg += aName2.GetName();\n pTC->pEH->Error( ERR_NOCOPYOBJ, pHeader->pClass, aName1,\n aMsg.GetBuffer() );\n }\n else\n aCopyInst.pData = pCopyObj->GetRscObj();\n }\n\n if( bMember )\n {\n \/\/ Angabe von Superklassen oder abgeleiteten Klassen ist jetzt erlaubt\n if( S.Top().pClass->InHierarchy( pHeader->pClass )\n || pHeader->pClass->InHierarchy( S.Top().pClass) )\n {\n if( aCopyInst.IsInst() )\n {\n RSCINST aTmpI( S.Top() );\n aTmpI.pClass->Destroy( aTmpI );\n aTmpI.pClass->Create( &aTmpI, aCopyInst );\n };\n }\n else\n pTC->pEH->Error( ERR_FALSETYPE, S.Top().pClass, aName1,\n pHS->getString( pHeader->pClass->GetId() ) );\n }\n else\n {\n if( S.IsEmpty() )\n {\n if( (INT32)aName1 < 256 )\n pTC->pEH->Error( WRN_GLOBALID, pHeader->pClass, aName1 );\n\n if( aCopyInst.IsInst() )\n S.Push( pHeader->pClass->Create( NULL, aCopyInst ) );\n else\n S.Push( pHeader->pClass->Create( NULL, RSCINST() ) );\n\n ObjNode * pNode = new ObjNode( aName1, S.Top().pData,\n pFI->GetFileIndex() );\n pTC->pEH->StdOut( \".\", RscVerbosityVerbose );\n\n if( !aName1.IsId() )\n pTC->pEH->Error( ERR_IDEXPECTED, pHeader->pClass, aName1 );\n else if( !pHeader->pClass->PutObjNode( pNode ) )\n pTC->pEH->Error( ERR_DOUBLEID, pHeader->pClass, aName1 );\n }\n else\n {\n RSCINST aTmpI;\n ERRTYPE aError;\n\n if( (INT32)aName1 >= 256 && aName1.IsId() )\n pTC->pEH->Error( WRN_LOCALID, pHeader->pClass, aName1 );\n aError = S.Top().pClass->GetElement( S.Top(), aName1,\n pHeader->pClass, aCopyInst, &aTmpI );\n\n if( aError.IsWarning() )\n pTC->pEH->Error( aError, pHeader->pClass, aName1 );\n else if( aError.IsError() )\n {\n if( ERR_CONT_INVALIDTYPE == aError )\n pTC->pEH->Error( aError, S.Top().pClass, aName1,\n pHS->getString( pHeader->pClass->GetId() ) );\n else\n pTC->pEH->Error( aError, S.Top().pClass, aName1 );\n S.Top().pClass->GetElement( S.Top(), RscId(),\n pHeader->pClass, RSCINST(), &aTmpI );\n\n if( !aTmpI.IsInst() )\n return( FALSE );\n }\n S.Push( aTmpI );\n };\n };\n if( TYPE_REF == pHeader->nTyp )\n {\n ERRTYPE aError;\n\n aError = S.Top().pClass->SetRef( S.Top(), aName2 );\n pTC->pEH->Error( aError, S.Top().pClass, aName1 );\n }\n\n return( TRUE );\n}\n\nRSCINST GetFirstTupelEle( const RSCINST & rTop )\n{ \/\/ Aufwaertskompatible, Tupel probieren\n RSCINST aInst;\n ERRTYPE aErr;\n\n aErr = rTop.pClass->GetElement( rTop, RscId(), NULL, RSCINST(), &aInst );\n if( !aErr.IsError() )\n aInst = aInst.pClass->GetTupelVar( aInst, 0, RSCINST() );\n return aInst;\n}\n\n\/************** Y a c c C o d e ****************************************\/\n\/\/#define YYDEBUG 1\n\n#define TYPE_Atom 0\n#define TYPE_RESID 1\n\n#ifdef UNX\n#define YYMAXDEPTH 2000\n#else\n#ifdef W30\n#define YYMAXDEPTH 300\n#else\n#define YYMAXDEPTH 800\n#endif\n#endif\n\n#if defined _MSC_VER\n#pragma warning(push, 1)\n#pragma warning(disable:4129 4273 4701 4702)\n#endif\n#include \"yyrscyacc.cxx\"\n#if defined _MSC_VER\n#pragma warning(pop)\n#endif\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"kmmainwin.h\"\n#include \"kmmainwidget.h\"\n#include \"kstatusbar.h\"\n#include \"kmkernel.h\"\n#include \"kmsender.h\"\n#include \"kmbroadcaststatus.h\"\n#include \"kmglobal.h\"\n#include \"kapplication.h\"\n#include <klocale.h>\n#include <kedittoolbar.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n\n#include \"kmmainwin.moc\"\n\nKMMainWin::KMMainWin(QWidget *)\n\t: KMTopLevelWidget(\"kmail-mainwindow\")\n{\n mKMMainWidget = new KMMainWidget( this, \"KMMainWidget\", actionCollection() );\n mKMMainWidget->resize( 450, 600 );\n setCentralWidget(mKMMainWidget);\n setupStatusBar();\n\n#if KDE_IS_VERSION( 3, 1, 90 )\n createStandardStatusBarAction();\n setStandardToolBarMenuEnabled(true);\n#endif\n\n KStdAction::configureToolbars(this, SLOT(slotEditToolbars()),\n\t\t\t\tactionCollection(), \"kmail_configure_toolbars\" );\n\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction = KStdAction::showToolbar(this,\n\t\t\t\t\t SLOT(slotToggleToolBar()),\n\t\t\t\t\t actionCollection());\n mStatusbarAction = KStdAction::showStatusbar(this,\n\t\t\t\t\t SLOT(slotToggleStatusBar()),\n\t\t\t\t\t actionCollection());\n#endif\n\n KStdAction::quit( this, SLOT(slotQuit()), actionCollection());\n createGUI( \"kmmainwin.rc\", false );\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction->setChecked(!toolBar()->isHidden());\n mStatusbarAction->setChecked(!statusBar()->isHidden());\n#endif\n\n conserveMemory();\n applyMainWindowSettings(KMKernel::config(), \"Main Window\");\n connect(kernel->msgSender(), SIGNAL(statusMsg(const QString&)),\n\t this, SLOT(statusMsg(const QString&)));\n connect(mKMMainWidget->messageView(), SIGNAL(statusMsg(const QString&)),\n\t this, SLOT(htmlStatusMsg(const QString&)));\n connect(mKMMainWidget, SIGNAL(captionChangeRequest(const QString&)),\n\t SLOT(setCaption(const QString&)) );\n}\n\nKMMainWin::~KMMainWin()\n{\n saveMainWindowSettings(KMKernel::config(), \"Main Window\");\n KMKernel::config()->sync();\n}\n\nvoid KMMainWin::statusMsg(const QString& aText)\n{\n mLastStatusMsg = aText;\n displayStatusMsg(aText);\n}\n\nvoid KMMainWin::htmlStatusMsg(const QString& aText)\n{\n if (aText.isEmpty()) displayStatusMsg(mLastStatusMsg);\n else displayStatusMsg(aText);\n}\n\nvoid KMMainWin::displayStatusMsg(const QString& aText)\n{\n if ( !statusBar() || !littleProgress) return;\n QString text = \" \" + aText + \" \";\n int statusWidth = statusBar()->width() - littleProgress->width()\n - fontMetrics().maxWidth();\n\n while (!text.isEmpty() && fontMetrics().width( text ) >= statusWidth)\n text.truncate( text.length() - 1);\n\n \/\/ ### FIXME: We should disable richtext\/HTML (to avoid possible denial of service attacks),\n \/\/ but this code would double the size of the satus bar if the user hovers\n \/\/ over an <foo@bar.com>-style email address :-(\n\/\/ text.replace(\"&\", \"&\");\n\/\/ text.replace(\"<\", \"<\");\n\/\/ text.replace(\">\", \">\");\n\n statusBar()->changeItem(text, mMessageStatusId);\n}\n\nvoid KMMainWin::slotToggleToolBar()\n{\n#if !KDE_IS_VERSION( 3, 1, 90 )\n if(toolBar(\"mainToolBar\")->isVisible())\n toolBar(\"mainToolBar\")->hide();\n else\n toolBar(\"mainToolBar\")->show();\n#endif\n}\n\nvoid KMMainWin::slotToggleStatusBar()\n{\n#if !KDE_IS_VERSION( 3, 1, 90 )\n if (statusBar()->isVisible())\n statusBar()->hide();\n else\n statusBar()->show();\n#endif\n}\n\nvoid KMMainWin::slotEditToolbars()\n{\n saveMainWindowSettings(KMKernel::config(), \"MainWindow\");\n KEditToolbar dlg(actionCollection(), \"kmmainwin.rc\");\n\n connect( &dlg, SIGNAL(newToolbarConfig()),\n\t SLOT(slotUpdateToolbars()) );\n\n dlg.exec();\n}\n\nvoid KMMainWin::slotUpdateToolbars()\n{\n createGUI(\"kmmainwin.rc\");\n applyMainWindowSettings(KMKernel::config(), \"MainWindow\");\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction->setChecked(!toolBar()->isHidden());\n#endif\n}\n\nvoid KMMainWin::setupStatusBar()\n{\n mMessageStatusId = 1;\n littleProgress = mainKMWidget()->progressDialog();\n\n statusBar()->addWidget( littleProgress, 0 , true );\n statusBar()->insertItem(i18n(\" Initializing...\"), 1, 1 );\n statusBar()->setItemAlignment( 1, AlignLeft | AlignVCenter );\n littleProgress->show();\n}\n\n\/** Read configuration options after widgets are created. *\/\nvoid KMMainWin::readConfig(void)\n{\n mKMMainWidget->readConfig();\n}\n\n\/** Write configuration options. *\/\nvoid KMMainWin::writeConfig(void)\n{\n mKMMainWidget->writeConfig();\n}\n\nvoid KMMainWin::slotQuit()\n{\n close();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMMainWin::queryClose() {\n if (kernel->shuttingDown() || kapp->sessionSaving())\n return true;\n\n int ret = 0;\n QString str = i18n(\"Expire old messages from all folders? \"\n\t\t \"Expired messages are permanently deleted.\");\n KConfig *config = KMKernel::config();\n\n \/\/ Make sure this is the last window.\n KMainWindow *kmWin = 0;\n int num = 0;\n\n kernel->setCanExpire(false);\n for (kmWin = KMainWindow::memberList->first(); kmWin;\n kmWin = KMainWindow::memberList->next()) {\n if (kmWin->isA(\"KMMainWin\")) {\n num++;\n }\n }\n \/\/ If this isn't the last open window, don't do anything.\n if (num > 1) {\n return true;\n }\n\n KConfigGroupSaver saver(config, \"General\");\n if (config->readNumEntry(\"when-to-expire\", 0) != expireAtExit) {\n return true;\n }\n\n if (config->readBoolEntry(\"warn-before-expire\", true)) {\n ret = KMessageBox::warningYesNo(KMainWindow::memberList->first(),\n\t\t\t str, i18n(\"Expire Old Messages?\"), i18n(\"Expire\"), i18n(\"Leave Without\"));\n if (ret == KMessageBox::Continue) {\n kernel->setCanExpire(true);\n }\n }\n\n return true;\n}\n<commit_msg>Language cleanup, as discussed on kde-cvs<commit_after>#include \"kmmainwin.h\"\n#include \"kmmainwidget.h\"\n#include \"kstatusbar.h\"\n#include \"kmkernel.h\"\n#include \"kmsender.h\"\n#include \"kmbroadcaststatus.h\"\n#include \"kmglobal.h\"\n#include \"kapplication.h\"\n#include <klocale.h>\n#include <kedittoolbar.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n\n#include \"kmmainwin.moc\"\n\nKMMainWin::KMMainWin(QWidget *)\n\t: KMTopLevelWidget(\"kmail-mainwindow\")\n{\n mKMMainWidget = new KMMainWidget( this, \"KMMainWidget\", actionCollection() );\n mKMMainWidget->resize( 450, 600 );\n setCentralWidget(mKMMainWidget);\n setupStatusBar();\n\n#if KDE_IS_VERSION( 3, 1, 90 )\n createStandardStatusBarAction();\n setStandardToolBarMenuEnabled(true);\n#endif\n\n KStdAction::configureToolbars(this, SLOT(slotEditToolbars()),\n\t\t\t\tactionCollection(), \"kmail_configure_toolbars\" );\n\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction = KStdAction::showToolbar(this,\n\t\t\t\t\t SLOT(slotToggleToolBar()),\n\t\t\t\t\t actionCollection());\n mStatusbarAction = KStdAction::showStatusbar(this,\n\t\t\t\t\t SLOT(slotToggleStatusBar()),\n\t\t\t\t\t actionCollection());\n#endif\n\n KStdAction::quit( this, SLOT(slotQuit()), actionCollection());\n createGUI( \"kmmainwin.rc\", false );\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction->setChecked(!toolBar()->isHidden());\n mStatusbarAction->setChecked(!statusBar()->isHidden());\n#endif\n\n conserveMemory();\n applyMainWindowSettings(KMKernel::config(), \"Main Window\");\n connect(kernel->msgSender(), SIGNAL(statusMsg(const QString&)),\n\t this, SLOT(statusMsg(const QString&)));\n connect(mKMMainWidget->messageView(), SIGNAL(statusMsg(const QString&)),\n\t this, SLOT(htmlStatusMsg(const QString&)));\n connect(mKMMainWidget, SIGNAL(captionChangeRequest(const QString&)),\n\t SLOT(setCaption(const QString&)) );\n}\n\nKMMainWin::~KMMainWin()\n{\n saveMainWindowSettings(KMKernel::config(), \"Main Window\");\n KMKernel::config()->sync();\n}\n\nvoid KMMainWin::statusMsg(const QString& aText)\n{\n mLastStatusMsg = aText;\n displayStatusMsg(aText);\n}\n\nvoid KMMainWin::htmlStatusMsg(const QString& aText)\n{\n if (aText.isEmpty()) displayStatusMsg(mLastStatusMsg);\n else displayStatusMsg(aText);\n}\n\nvoid KMMainWin::displayStatusMsg(const QString& aText)\n{\n if ( !statusBar() || !littleProgress) return;\n QString text = \" \" + aText + \" \";\n int statusWidth = statusBar()->width() - littleProgress->width()\n - fontMetrics().maxWidth();\n\n while (!text.isEmpty() && fontMetrics().width( text ) >= statusWidth)\n text.truncate( text.length() - 1);\n\n \/\/ ### FIXME: We should disable richtext\/HTML (to avoid possible denial of service attacks),\n \/\/ but this code would double the size of the satus bar if the user hovers\n \/\/ over an <foo@bar.com>-style email address :-(\n\/\/ text.replace(\"&\", \"&\");\n\/\/ text.replace(\"<\", \"<\");\n\/\/ text.replace(\">\", \">\");\n\n statusBar()->changeItem(text, mMessageStatusId);\n}\n\nvoid KMMainWin::slotToggleToolBar()\n{\n#if !KDE_IS_VERSION( 3, 1, 90 )\n if(toolBar(\"mainToolBar\")->isVisible())\n toolBar(\"mainToolBar\")->hide();\n else\n toolBar(\"mainToolBar\")->show();\n#endif\n}\n\nvoid KMMainWin::slotToggleStatusBar()\n{\n#if !KDE_IS_VERSION( 3, 1, 90 )\n if (statusBar()->isVisible())\n statusBar()->hide();\n else\n statusBar()->show();\n#endif\n}\n\nvoid KMMainWin::slotEditToolbars()\n{\n saveMainWindowSettings(KMKernel::config(), \"MainWindow\");\n KEditToolbar dlg(actionCollection(), \"kmmainwin.rc\");\n\n connect( &dlg, SIGNAL(newToolbarConfig()),\n\t SLOT(slotUpdateToolbars()) );\n\n dlg.exec();\n}\n\nvoid KMMainWin::slotUpdateToolbars()\n{\n createGUI(\"kmmainwin.rc\");\n applyMainWindowSettings(KMKernel::config(), \"MainWindow\");\n#if !KDE_IS_VERSION( 3, 1, 90 )\n mToolbarAction->setChecked(!toolBar()->isHidden());\n#endif\n}\n\nvoid KMMainWin::setupStatusBar()\n{\n mMessageStatusId = 1;\n littleProgress = mainKMWidget()->progressDialog();\n\n statusBar()->addWidget( littleProgress, 0 , true );\n statusBar()->insertItem(i18n(\" Initializing...\"), 1, 1 );\n statusBar()->setItemAlignment( 1, AlignLeft | AlignVCenter );\n littleProgress->show();\n}\n\n\/** Read configuration options after widgets are created. *\/\nvoid KMMainWin::readConfig(void)\n{\n mKMMainWidget->readConfig();\n}\n\n\/** Write configuration options. *\/\nvoid KMMainWin::writeConfig(void)\n{\n mKMMainWidget->writeConfig();\n}\n\nvoid KMMainWin::slotQuit()\n{\n close();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMMainWin::queryClose() {\n if (kernel->shuttingDown() || kapp->sessionSaving())\n return true;\n\n int ret = 0;\n QString str = i18n(\"Expire old messages from all folders? \"\n\t\t \"Expired messages are permanently deleted.\");\n KConfig *config = KMKernel::config();\n\n \/\/ Make sure this is the last window.\n KMainWindow *kmWin = 0;\n int num = 0;\n\n kernel->setCanExpire(false);\n for (kmWin = KMainWindow::memberList->first(); kmWin;\n kmWin = KMainWindow::memberList->next()) {\n if (kmWin->isA(\"KMMainWin\")) {\n num++;\n }\n }\n \/\/ If this isn't the last open window, don't do anything.\n if (num > 1) {\n return true;\n }\n\n KConfigGroupSaver saver(config, \"General\");\n if (config->readNumEntry(\"when-to-expire\", 0) != expireAtExit) {\n return true;\n }\n\n if (config->readBoolEntry(\"warn-before-expire\", true)) {\n ret = KMessageBox::warningYesNo(KMainWindow::memberList->first(),\n\t\t\t str, i18n(\"Expire Old Messages?\"), i18n(\"Expire\"), i18n(\"Don't Expire\"));\n if (ret == KMessageBox::Continue) {\n kernel->setCanExpire(true);\n }\n }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"kmmainwin.h\"\n#include \"kmmainwidget.h\"\n#include \"kstatusbar.h\"\n#include \"messagesender.h\"\n#include \"progressdialog.h\"\n#include \"statusbarprogresswidget.h\"\n#include \"accountwizard.h\"\n#include \"broadcaststatus.h\"\n#include \"accountmanager.h\"\n#include \"kmtransport.h\"\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kedittoolbar.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n#include <kstringhandler.h>\n#include <kstandardaction.h>\n#include <kdebug.h>\n#include <ktip.h>\n#include <kicon.h>\n\n#include \"kmmainwin.moc\"\n\nKMMainWin::KMMainWin(QWidget *)\n : KMainWindow( 0 ),\n mReallyClose( false )\n{\n setObjectName(\"kmail-mainwindow#\");\n \/\/ Set this to be the group leader for all subdialogs - this means\n \/\/ modal subdialogs will only affect this dialog, not the other windows\n setAttribute( Qt::WA_GroupLeader );\n\n KGlobal::ref();\n\n KAction *action = new KAction(KIcon(\"window-new\"), i18n(\"New &Window\"), this);\n actionCollection()->addAction(\"new_mail_client\", action );\n connect(action, SIGNAL(triggered(bool) ), SLOT(slotNewMailReader()));\n\n mKMMainWidget = new KMMainWidget( this, \"KMMainWidget\", this, actionCollection() );\n mKMMainWidget->resize( 450, 600 );\n setCentralWidget(mKMMainWidget);\n setupStatusBar();\n if (kmkernel->xmlGuiInstance().isValid())\n setComponentData( kmkernel->xmlGuiInstance() );\n\n if ( kmkernel->firstInstance() )\n QTimer::singleShot( 200, this, SLOT(slotShowTipOnStart()) );\n\n setStandardToolBarMenuEnabled(true);\n\n KStandardAction::configureToolbars(this, SLOT(slotEditToolbars()),\n\t\t\t\tactionCollection());\n\n KStandardAction::keyBindings(mKMMainWidget, SLOT(slotEditKeys()),\n actionCollection());\n\n KStandardAction::quit( this, SLOT(slotQuit()), actionCollection());\n createGUI( \"kmmainwin.rc\" );\n \/\/ Don't use conserveMemory() because this renders dynamic plugging\n \/\/ of actions unusable!\n\n applyMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n\n connect( KPIM::BroadcastStatus::instance(), SIGNAL( statusMsg( const QString& ) ),\n this, SLOT( displayStatusMsg(const QString&) ) );\n\n connect(kmkernel, SIGNAL(configChanged()),\n this, SLOT(slotConfigChanged()));\n\n connect(mKMMainWidget, SIGNAL(captionChangeRequest(const QString&)),\n\t SLOT(setCaption(const QString&)) );\n\n \/\/ Enable mail checks again (see destructor)\n kmkernel->enableMailCheck();\n\n if ( kmkernel->firstStart() )\n AccountWizard::start( kmkernel, this );\n}\n\nKMMainWin::~KMMainWin()\n{\n saveMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n KMKernel::config()->sync();\n KGlobal::deref();\n\n if ( !kmkernel->haveSystemTrayApplet() ) {\n \/\/ Check if this was the last KMMainWin\n int not_withdrawn = 0;\n\tfor (int i = 0; i < KMainWindow::memberList().size(); ++i){\n\n if ( !KMainWindow::memberList().at(i)->isHidden() &&\n KMainWindow::memberList().at(i)->isTopLevel() &&\n KMainWindow::memberList().at(i) != this &&\n ::qobject_cast<KMMainWin *>( KMainWindow::memberList().at(i) )\n )\n not_withdrawn++;\n }\n\n if ( not_withdrawn == 0 ) {\n kDebug(5006) << \"Closing last KMMainWin: stopping mail check\" << endl;\n \/\/ Running KIO jobs prevent kapp from exiting, so we need to kill them\n \/\/ if they are only about checking mail (not important stuff like moving messages)\n kmkernel->abortMailCheck();\n kmkernel->acctMgr()->cancelMailCheck();\n }\n }\n}\n\nvoid KMMainWin::displayStatusMsg(const QString& aText)\n{\n if ( !statusBar() || !mLittleProgress) return;\n int statusWidth = statusBar()->width() - mLittleProgress->width()\n - fontMetrics().maxWidth();\n\n QString text = fontMetrics().elidedText( ' ' + aText, Qt::ElideRight,\n statusWidth );\n\n \/\/ ### FIXME: We should disable richtext\/HTML (to avoid possible denial of service attacks),\n \/\/ but this code would double the size of the satus bar if the user hovers\n \/\/ over an <foo@bar.com>-style email address :-(\n\/\/ text.replace(\"&\", \"&\");\n\/\/ text.replace(\"<\", \"<\");\n\/\/ text.replace(\">\", \">\");\n\n statusBar()->changeItem(text, mMessageStatusId);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMMainWin::slotNewMailReader()\n{\n KMMainWin *d;\n\n d = new KMMainWin();\n d->show();\n d->resize(d->size());\n}\n\n\nvoid KMMainWin::slotEditToolbars()\n{\n saveMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n KEditToolBar dlg(actionCollection(), this);\n\n connect( &dlg, SIGNAL(newToolbarConfig()),\n\t SLOT(slotUpdateToolbars()) );\n\n dlg.exec();\n}\n\nvoid KMMainWin::slotUpdateToolbars()\n{\n \/\/ remove dynamically created actions before editing\n mKMMainWidget->clearFilterActions();\n\n createGUI(\"kmmainwin.rc\");\n applyMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n\n \/\/ plug dynamically created actions again\n mKMMainWidget->initializeFilterActions();\n}\n\nvoid KMMainWin::setupStatusBar()\n{\n mMessageStatusId = 1;\n\n \/* Create a progress dialog and hide it. *\/\n mProgressDialog = new KPIM::ProgressDialog( statusBar(), this );\n mProgressDialog->hide();\n\n mLittleProgress = new StatusbarProgressWidget( mProgressDialog, statusBar() );\n mLittleProgress->show();\n\n statusBar()->addPermanentWidget( mLittleProgress, 0 );\n statusBar()->insertItem(i18n(\" Initializing...\"), 1, 1 );\n statusBar()->setItemAlignment( 1, Qt::AlignLeft | Qt::AlignVCenter );\n mLittleProgress->show();\n}\n\n\/** Read configuration options after widgets are created. *\/\nvoid KMMainWin::readConfig(void)\n{\n}\n\n\/** Write configuration options. *\/\nvoid KMMainWin::writeConfig(void)\n{\n mKMMainWidget->writeConfig();\n}\n\nvoid KMMainWin::slotQuit()\n{\n mReallyClose = true;\n close();\n}\n\nvoid KMMainWin::slotConfigChanged()\n{\n readConfig();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMMainWin::queryClose()\n{\n if ( kapp->sessionSaving() )\n writeConfig();\n\n if ( kmkernel->shuttingDown() || kapp->sessionSaving() || mReallyClose )\n return true;\n return kmkernel->canQueryClose();\n}\n\nvoid KMMainWin::slotShowTipOnStart()\n{\n KTipDialog::showTip( this );\n}\n\n\n<commit_msg>thanks aseigo. need to set the rc file name<commit_after>\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"kmmainwin.h\"\n#include \"kmmainwidget.h\"\n#include \"kstatusbar.h\"\n#include \"messagesender.h\"\n#include \"progressdialog.h\"\n#include \"statusbarprogresswidget.h\"\n#include \"accountwizard.h\"\n#include \"broadcaststatus.h\"\n#include \"accountmanager.h\"\n#include \"kmtransport.h\"\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kedittoolbar.h>\n#include <kconfig.h>\n#include <kmessagebox.h>\n#include <kstringhandler.h>\n#include <kstandardaction.h>\n#include <kdebug.h>\n#include <ktip.h>\n#include <kicon.h>\n\n#include \"kmmainwin.moc\"\n\nKMMainWin::KMMainWin(QWidget *)\n : KMainWindow( 0 ),\n mReallyClose( false )\n{\n setObjectName(\"kmail-mainwindow#\");\n \/\/ Set this to be the group leader for all subdialogs - this means\n \/\/ modal subdialogs will only affect this dialog, not the other windows\n setAttribute( Qt::WA_GroupLeader );\n\n KGlobal::ref();\n\n KAction *action = new KAction(KIcon(\"window-new\"), i18n(\"New &Window\"), this);\n actionCollection()->addAction(\"new_mail_client\", action );\n connect(action, SIGNAL(triggered(bool) ), SLOT(slotNewMailReader()));\n\n mKMMainWidget = new KMMainWidget( this, \"KMMainWidget\", this, actionCollection() );\n mKMMainWidget->resize( 450, 600 );\n setCentralWidget(mKMMainWidget);\n setupStatusBar();\n if (kmkernel->xmlGuiInstance().isValid())\n setComponentData( kmkernel->xmlGuiInstance() );\n\n if ( kmkernel->firstInstance() )\n QTimer::singleShot( 200, this, SLOT(slotShowTipOnStart()) );\n\n setStandardToolBarMenuEnabled(true);\n\n KStandardAction::configureToolbars(this, SLOT(slotEditToolbars()),\n\t\t\t\tactionCollection());\n\n KStandardAction::keyBindings(mKMMainWidget, SLOT(slotEditKeys()),\n actionCollection());\n\n KStandardAction::quit( this, SLOT(slotQuit()), actionCollection());\n createGUI( \"kmmainwin.rc\" );\n \/\/ Don't use conserveMemory() because this renders dynamic plugging\n \/\/ of actions unusable!\n\n applyMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n\n connect( KPIM::BroadcastStatus::instance(), SIGNAL( statusMsg( const QString& ) ),\n this, SLOT( displayStatusMsg(const QString&) ) );\n\n connect(kmkernel, SIGNAL(configChanged()),\n this, SLOT(slotConfigChanged()));\n\n connect(mKMMainWidget, SIGNAL(captionChangeRequest(const QString&)),\n\t SLOT(setCaption(const QString&)) );\n\n \/\/ Enable mail checks again (see destructor)\n kmkernel->enableMailCheck();\n\n if ( kmkernel->firstStart() )\n AccountWizard::start( kmkernel, this );\n}\n\nKMMainWin::~KMMainWin()\n{\n saveMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n KMKernel::config()->sync();\n KGlobal::deref();\n\n if ( !kmkernel->haveSystemTrayApplet() ) {\n \/\/ Check if this was the last KMMainWin\n int not_withdrawn = 0;\n\tfor (int i = 0; i < KMainWindow::memberList().size(); ++i){\n\n if ( !KMainWindow::memberList().at(i)->isHidden() &&\n KMainWindow::memberList().at(i)->isTopLevel() &&\n KMainWindow::memberList().at(i) != this &&\n ::qobject_cast<KMMainWin *>( KMainWindow::memberList().at(i) )\n )\n not_withdrawn++;\n }\n\n if ( not_withdrawn == 0 ) {\n kDebug(5006) << \"Closing last KMMainWin: stopping mail check\" << endl;\n \/\/ Running KIO jobs prevent kapp from exiting, so we need to kill them\n \/\/ if they are only about checking mail (not important stuff like moving messages)\n kmkernel->abortMailCheck();\n kmkernel->acctMgr()->cancelMailCheck();\n }\n }\n}\n\nvoid KMMainWin::displayStatusMsg(const QString& aText)\n{\n if ( !statusBar() || !mLittleProgress) return;\n int statusWidth = statusBar()->width() - mLittleProgress->width()\n - fontMetrics().maxWidth();\n\n QString text = fontMetrics().elidedText( ' ' + aText, Qt::ElideRight,\n statusWidth );\n\n \/\/ ### FIXME: We should disable richtext\/HTML (to avoid possible denial of service attacks),\n \/\/ but this code would double the size of the satus bar if the user hovers\n \/\/ over an <foo@bar.com>-style email address :-(\n\/\/ text.replace(\"&\", \"&\");\n\/\/ text.replace(\"<\", \"<\");\n\/\/ text.replace(\">\", \">\");\n\n statusBar()->changeItem(text, mMessageStatusId);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMMainWin::slotNewMailReader()\n{\n KMMainWin *d;\n\n d = new KMMainWin();\n d->show();\n d->resize(d->size());\n}\n\n\nvoid KMMainWin::slotEditToolbars()\n{\n saveMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n KEditToolBar dlg(actionCollection(), this);\n dlg.setResourceFile( \"kmmainwin.rc\" );\n\n connect( &dlg, SIGNAL(newToolbarConfig()),\n\t SLOT(slotUpdateToolbars()) );\n\n dlg.exec();\n}\n\nvoid KMMainWin::slotUpdateToolbars()\n{\n \/\/ remove dynamically created actions before editing\n mKMMainWidget->clearFilterActions();\n\n createGUI(\"kmmainwin.rc\");\n applyMainWindowSettings(KMKernel::config()->group( \"Main Window\") );\n\n \/\/ plug dynamically created actions again\n mKMMainWidget->initializeFilterActions();\n}\n\nvoid KMMainWin::setupStatusBar()\n{\n mMessageStatusId = 1;\n\n \/* Create a progress dialog and hide it. *\/\n mProgressDialog = new KPIM::ProgressDialog( statusBar(), this );\n mProgressDialog->hide();\n\n mLittleProgress = new StatusbarProgressWidget( mProgressDialog, statusBar() );\n mLittleProgress->show();\n\n statusBar()->addPermanentWidget( mLittleProgress, 0 );\n statusBar()->insertItem(i18n(\" Initializing...\"), 1, 1 );\n statusBar()->setItemAlignment( 1, Qt::AlignLeft | Qt::AlignVCenter );\n mLittleProgress->show();\n}\n\n\/** Read configuration options after widgets are created. *\/\nvoid KMMainWin::readConfig(void)\n{\n}\n\n\/** Write configuration options. *\/\nvoid KMMainWin::writeConfig(void)\n{\n mKMMainWidget->writeConfig();\n}\n\nvoid KMMainWin::slotQuit()\n{\n mReallyClose = true;\n close();\n}\n\nvoid KMMainWin::slotConfigChanged()\n{\n readConfig();\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMMainWin::queryClose()\n{\n if ( kapp->sessionSaving() )\n writeConfig();\n\n if ( kmkernel->shuttingDown() || kapp->sessionSaving() || mReallyClose )\n return true;\n return kmkernel->canQueryClose();\n}\n\nvoid KMMainWin::slotShowTipOnStart()\n{\n KTipDialog::showTip( this );\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\nAliAnalysisTaskGammaHadron* AddTaskGammaHadron(\n Bool_t InputGammaOrPi0 = 0, \/\/gamma analysis=0, pi0 analyis=1\n Bool_t InputSameEventAnalysis = 1, \/\/same event=1 mixed event =0 (currently only used to throw out event in Run() function)\n const char *trackName = \"usedefault\",\n const char *clusName = \"usedefault\",\n const char *cellName = \"usedefault\", \/\/probably delete this this is nowhere used\n Double_t trackptcut = 0.15,\n Double_t clusptcut = 0.30,\n const char *taskname = \"AliAnalysisTask\",\n const char *suffix = \"\"\n)\n{ \n \/\/cout<<\"in AddTaskGammaHadron.C(...)\"<<endl;\n \/\/ Get the pointer to the existing analysis manager via the static access method.\n \/\/==============================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr)\n {\n ::Error(\"AddTaskGammaHadron\", \"No analysis manager to connect to.\");\n return 0;\n } \n \n \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n \/\/==============================================================================\n AliVEventHandler* handler = mgr->GetInputEventHandler();\n if (!handler)\n {\n ::Error(\"AddTaskGammaHadron\", \"This task requires an input event handler\");\n return 0;\n }\n if (handler->InheritsFrom(\"AliESDInputHandler\"))\n {\n\t ::Error(\"AddTaskGammaHadron\", \"We have never taken care if this works for ESDs\");\n\t return 0;\n }\n\n \/\/in case of AOD the default names are:\n if(trackName==\"usedefault\")trackName = \"tracks\"; \/\/could be hybrid tracks\n if(clusName ==\"usedefault\")clusName = \"caloClusters\";\n if(cellName ==\"usedefault\")cellName = \"emcalCells\";\n\n \/\/-------------------------------------------------------\n \/\/ Built the name of the Task together\n \/\/-------------------------------------------------------\n TString GammaPi0Name;\n if(InputGammaOrPi0 == 0)\n {\n\t GammaPi0Name += \"GH\";\n }\n else\n {\n\t GammaPi0Name += \"Pi0H\";\n }\n TString SameMixName;\n if(InputSameEventAnalysis == 1)\n {\n\t SameMixName += \"SE\";\n }\n else\n {\n\t SameMixName += \"ME\";\n }\n\n TString combinedName;\n combinedName.Form(\"%s_%s_%s_%s_%s\",taskname,(const char*)GammaPi0Name,(const char*)SameMixName,trackName,clusName);\n if(suffix!=\"\")\n {\n\t combinedName += \"_\";\n\t combinedName += suffix;\n }\n cout<<\"combinedName: \"<<combinedName<<endl;\n\n \/\/-------------------------------------------------------\n \/\/ Init the task and do settings\n \/\/-------------------------------------------------------\n AliAnalysisTaskGammaHadron* AnalysisTask = new AliAnalysisTaskGammaHadron(InputGammaOrPi0,InputSameEventAnalysis);\n\n \/\/..Add the containers and set the names\n AnalysisTask->SetCaloCellsName(cellName);\n AnalysisTask->AddClusterContainer(clusName);\n\n if (trackName == \"mcparticles\")\n {\n\t AliMCParticleContainer* mcpartCont = AnalysisTask->AddMCParticleContainer(trackName);\n\t mcpartCont->SelectPhysicalPrimaries(kTRUE);\n }\n else if (trackName == \"tracks\")\n {\n\t AliTrackContainer* trackCont = AnalysisTask->AddTrackContainer(trackName);\n\t trackCont->SetFilterHybridTracks(kTRUE); \/\/gives me Hyprid tracks\n }\n \/\/..check that condition!! maybe for mixed events its different!!!!!!\n if(!AnalysisTask->GetTrackContainer(trackName) || !AnalysisTask->GetClusterContainer(clusName))\n {\n\t cout<<\"Task can not run like this!\"<<endl;\n\t return 0;\n }\n\n \/\/..Add some selection criteria\n AnalysisTask->SetVzRange(-10,10);\n if(AnalysisTask->GetTrackContainer(trackName))\n {\n\t AnalysisTask->GetTrackContainer(trackName)->SetParticlePtCut(trackptcut);\n }\n if(AnalysisTask->GetClusterContainer(clusName))\n {\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusECut(0); \/\/by default set to 0.15 always\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusPtCut(0); \/\/by default set to 0\n\t \/\/AnalysisTask->GetClusterContainer(clusName)->SetClusHadCorrEnergyCut(clusptcut);\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusUserDefEnergyCut(AliVCluster::kHadCorr,clusptcut);\n\t AnalysisTask->GetClusterContainer(clusName)->SetDefaultClusterEnergy(AliVCluster::kHadCorr);\n\t \/\/AnalysisTask->GetClusterContainer(clusName)->SetClusUserDefEnergyCut(AliVCluster::kNonLinCorr,clusptcut);\n\t \/\/AnalysisTask->GetClusterContainer(clusName)->SetDefaultClusterEnergy(AliVCluster::kNonLinCorr);\n }\n\n \/*\n \/\/ Used for physics selection\n task->SetUseAliAnaUtils(kTRUE);\n task->DoVertexRCut(doVertexRCut);\n *\/\n\n\n\n \/\/..some additional input for the analysis\n AnalysisTask->SetNeedEmcalGeom(kTRUE);\n \/\/for later AnalysisTask->SetEffHistGamma(THnF *h);\n \/\/for later AnalysisTask->SetEffHistHadron(THnF *h);\n\n \/\/-------------------------------------------------------\n \/\/ Final settings, pass to manager and set the containers\n \/\/-------------------------------------------------------\n mgr->AddTask(AnalysisTask);\n \n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput1 = mgr->GetCommonInputContainer() ;\n\n TString contName(combinedName);\n contName += \"_histos\";\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(contName.Data(), \n\t\t\t\t\t\t\t TList::Class(),AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t Form(\"%s\", AliAnalysisManager::GetCommonFileName()));\n mgr->ConnectInput (AnalysisTask, 0, cinput1 );\n mgr->ConnectOutput (AnalysisTask, 1, coutput1 );\n\n return AnalysisTask;\n}\n<commit_msg>Set an energy cut on the raw energy of the cluster<commit_after>\/\/ $Id$\n\nAliAnalysisTaskGammaHadron* AddTaskGammaHadron(\n Bool_t InputGammaOrPi0 = 0, \/\/gamma analysis=0, pi0 analyis=1\n Bool_t InputSameEventAnalysis = 1, \/\/same event=1 mixed event =0 (currently only used to throw out event in Run() function)\n const char *trackName = \"usedefault\",\n const char *clusName = \"usedefault\",\n const char *cellName = \"usedefault\", \/\/probably delete this this is nowhere used\n Double_t trackptcut = 0.15,\n Double_t clusptcut = 0.30,\n const char *taskname = \"AliAnalysisTask\",\n const char *suffix = \"\"\n)\n{ \n \/\/cout<<\"in AddTaskGammaHadron.C(...)\"<<endl;\n \/\/ Get the pointer to the existing analysis manager via the static access method.\n \/\/==============================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr)\n {\n ::Error(\"AddTaskGammaHadron\", \"No analysis manager to connect to.\");\n return 0;\n } \n \n \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n \/\/==============================================================================\n AliVEventHandler* handler = mgr->GetInputEventHandler();\n if (!handler)\n {\n ::Error(\"AddTaskGammaHadron\", \"This task requires an input event handler\");\n return 0;\n }\n if (handler->InheritsFrom(\"AliESDInputHandler\"))\n {\n\t ::Error(\"AddTaskGammaHadron\", \"We have never taken care if this works for ESDs\");\n\t return 0;\n }\n\n \/\/in case of AOD the default names are:\n if(trackName==\"usedefault\")trackName = \"tracks\"; \/\/could be hybrid tracks\n if(clusName ==\"usedefault\")clusName = \"caloClusters\";\n if(cellName ==\"usedefault\")cellName = \"emcalCells\";\n\n \/\/-------------------------------------------------------\n \/\/ Built the name of the Task together\n \/\/-------------------------------------------------------\n TString GammaPi0Name;\n if(InputGammaOrPi0 == 0)\n {\n\t GammaPi0Name += \"GH\";\n }\n else\n {\n\t GammaPi0Name += \"Pi0H\";\n }\n TString SameMixName;\n if(InputSameEventAnalysis == 1)\n {\n\t SameMixName += \"SE\";\n }\n else\n {\n\t SameMixName += \"ME\";\n }\n\n TString combinedName;\n combinedName.Form(\"%s_%s_%s_%s_%s\",taskname,(const char*)GammaPi0Name,(const char*)SameMixName,trackName,clusName);\n if(suffix!=\"\")\n {\n\t combinedName += \"_\";\n\t combinedName += suffix;\n }\n cout<<\"combinedName: \"<<combinedName<<endl;\n\n \/\/-------------------------------------------------------\n \/\/ Init the task and do settings\n \/\/-------------------------------------------------------\n AliAnalysisTaskGammaHadron* AnalysisTask = new AliAnalysisTaskGammaHadron(InputGammaOrPi0,InputSameEventAnalysis);\n\n \/\/..Add the containers and set the names\n AnalysisTask->SetCaloCellsName(cellName);\n AnalysisTask->AddClusterContainer(clusName);\n\n if (trackName == \"mcparticles\")\n {\n\t AliMCParticleContainer* mcpartCont = AnalysisTask->AddMCParticleContainer(trackName);\n\t mcpartCont->SelectPhysicalPrimaries(kTRUE);\n }\n else if (trackName == \"tracks\")\n {\n\t AliTrackContainer* trackCont = AnalysisTask->AddTrackContainer(trackName);\n\t trackCont->SetFilterHybridTracks(kTRUE); \/\/gives me Hyprid tracks\n }\n \/\/..check that condition!! maybe for mixed events its different!!!!!!\n if(!AnalysisTask->GetTrackContainer(trackName) || !AnalysisTask->GetClusterContainer(clusName))\n {\n\t cout<<\"Task can not run like this!\"<<endl;\n\t return 0;\n }\n\n \/\/..Add some selection criteria\n AnalysisTask->SetVzRange(-10,10);\n if(AnalysisTask->GetTrackContainer(trackName))\n {\n\t AnalysisTask->GetTrackContainer(trackName)->SetParticlePtCut(trackptcut);\n }\n if(AnalysisTask->GetClusterContainer(clusName))\n {\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusECut(0); \/\/by default set to 0\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusPtCut(0.3); \/\/by default set to 0.15\n\t AnalysisTask->GetClusterContainer(clusName)->SetClusUserDefEnergyCut(AliVCluster::kHadCorr,clusptcut);\n\t AnalysisTask->GetClusterContainer(clusName)->SetDefaultClusterEnergy(AliVCluster::kHadCorr);\n\t \/\/AnalysisTask->GetClusterContainer(clusName)->SetClusUserDefEnergyCut(AliVCluster::kNonLinCorr,clusptcut);\n\t \/\/AnalysisTask->GetClusterContainer(clusName)->SetDefaultClusterEnergy(AliVCluster::kNonLinCorr);\n }\n\n \/*\n \/\/ Used for physics selection\n task->SetUseAliAnaUtils(kTRUE);\n task->DoVertexRCut(doVertexRCut);\n *\/\n\n\n\n \/\/..some additional input for the analysis\n AnalysisTask->SetNeedEmcalGeom(kTRUE);\n \/\/for later AnalysisTask->SetEffHistGamma(THnF *h);\n \/\/for later AnalysisTask->SetEffHistHadron(THnF *h);\n\n \/\/-------------------------------------------------------\n \/\/ Final settings, pass to manager and set the containers\n \/\/-------------------------------------------------------\n mgr->AddTask(AnalysisTask);\n \n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput1 = mgr->GetCommonInputContainer() ;\n\n TString contName(combinedName);\n contName += \"_histos\";\n AliAnalysisDataContainer *coutput1 = mgr->CreateContainer(contName.Data(), \n\t\t\t\t\t\t\t TList::Class(),AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t Form(\"%s\", AliAnalysisManager::GetCommonFileName()));\n mgr->ConnectInput (AnalysisTask, 0, cinput1 );\n mgr->ConnectOutput (AnalysisTask, 1, coutput1 );\n\n return AnalysisTask;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <GarrysMod\/Lua\/Interface.h>\n#include <GarrysMod\/Lua\/LuaInterface.h>\n#include <SymbolFinder.hpp>\n#include <MologieDetours\/detours.h>\n#include <stdexcept>\n#include <stdint.h>\n#include <sha1.h>\n\n#if defined _WIN32\n\n#define snprintf _snprintf\n\n#define FASTCALL __fastcall\n#define THISCALL __thiscall\n\n#define SERVER_BINARY \"server.dll\"\n\n#define ADDORUPDATEFILE_SYM reinterpret_cast<const uint8_t *>( \"\\x55\\x8B\\xEC\\x83\\xEC\\x18\\x53\\x56\\x8B\\x75\\x08\\x83\\xC6\\x04\\x83\\x7E\" )\n#define ADDORUPDATEFILE_SYMLEN 16\n\n#elif defined __linux || defined __APPLE__\n\n#define CDECL __attribute__((cdecl))\n\n#if defined __linux\n\n#define SERVER_BINARY \"garrysmod\/bin\/server_srv.so\"\n\n#define SYMBOL_PREFIX \"@\"\n\n#else\n\n#define SERVER_BINARY \"garrysmod\/bin\/server.dylib\"\n\n#define SYMBOL_PREFIX \"@_\"\n\n#endif\n\n#define ADDORUPDATEFILE_SYM reinterpret_cast<const uint8_t *>( SYMBOL_PREFIX \"_ZN12GModDataPack15AddOrUpdateFileEP7LuaFileb\" )\n#define ADDORUPDATEFILE_SYMLEN 0\n\n#endif\n\nGarrysMod::Lua::ILuaInterface *lua = NULL;\n\nclass GModDataPack;\n\nstruct LuaFile\n{\n\tuint32_t skip;\n\tconst char *path;\n};\n\n#if defined _WIN32\n\ntypedef void ( THISCALL *AddOrUpdateFile_t ) ( GModDataPack *self, LuaFile *file, bool force );\n\n#elif defined __linux || defined __APPLE__\n\ntypedef void ( CDECL *AddOrUpdateFile_t ) ( GModDataPack *self, LuaFile *file, bool force );\n\n#endif\n \nAddOrUpdateFile_t AddOrUpdateFile = NULL;\nMologieDetours::Detour<AddOrUpdateFile_t> *AddOrUpdateFile_d = NULL;\n\n#if defined _WIN32\n\nvoid FASTCALL AddOrUpdateFile_h( GModDataPack *self, void *, LuaFile *file, bool b )\n\n#elif defined __linux || defined __APPLE__\n\nvoid CDECL AddOrUpdateFile_h( GModDataPack *self, LuaFile *file, bool b )\n\n#endif\n\n{\n\tlua->PushSpecial( GarrysMod::Lua::SPECIAL_GLOB );\n\tif( lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t{\n\t\tlua->GetField( -1, \"hook\" );\n\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t\t{\n\t\t\tlua->GetField( -1, \"Run\" );\n\t\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::FUNCTION ) )\n\t\t\t{\n\t\t\t\tlua->PushString( \"AddOrUpdateCSLuaFile\" );\n\n\t\t\t\tlua->PushString( file->path );\n\t\t\t\tlua->PushBool( b );\n\n\t\t\t\tif( lua->PCall( 3, 1, 0 ) != 0 )\n\t\t\t\t{\n\t\t\t\t\tlua->Msg( \"[luapack_internal] %s\\n\", lua->GetString( ) );\n\t\t\t\t\tlua->Pop( 3 );\n\t\t\t\t\treturn AddOrUpdateFile( self, file, b );\n\t\t\t\t}\n\n\t\t\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::BOOL ) && lua->GetBool( ) )\n\t\t\t\t{\n\t\t\t\t\tlua->Pop( 3 );\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tlua->Pop( 1 );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlua->Pop( 1 );\n\t\t\t}\n\t\t}\n\n\t\tlua->Pop( 1 );\n\t}\n\n\tlua->Pop( 1 );\n\treturn AddOrUpdateFile( self, file, b );\n}\n\n#define HASHER_METATABLE \"SHA1\"\n#define HASHER_TYPE 31\n\n#define THROW_ERROR( error ) ( LUA->ThrowError( error ), 0 )\n#define LUA_ERROR( ) THROW_ERROR( LUA->GetString( ) )\n\n#define GET_USERDATA( index ) reinterpret_cast<GarrysMod::Lua::UserData *>( LUA->GetUserdata( index ) )\n#define GET_HASHER( index ) reinterpret_cast<sha1_context *>( GET_USERDATA( index )->data )\n#define VALIDATE_HASHER( hasher ) if( hasher == 0 ) return THROW_ERROR( HASHER_METATABLE \" object is not valid\" )\n\nLUA_FUNCTION_STATIC( hasher__new )\n{\n\ttry\n\t{\n\t\tsha1_context *context = new sha1_context;\n\t\tsha1_starts( context );\n\n\t\tvoid *luadata = LUA->NewUserdata( sizeof( GarrysMod::Lua::UserData ) );\n\t\tGarrysMod::Lua::UserData *userdata = reinterpret_cast<GarrysMod::Lua::UserData *>( luadata );\n\t\tuserdata->data = context;\n\t\tuserdata->type = HASHER_TYPE;\n\n\t\tLUA->CreateMetaTableType( HASHER_METATABLE, HASHER_TYPE );\n\t\tLUA->SetMetaTable( -2 );\n\n\t\treturn 1;\n\t}\n\tcatch( std::exception &e )\n\t{\n\t\tLUA->PushString( e.what( ) );\n\t}\n \n\treturn LUA_ERROR( );\n}\n\nLUA_FUNCTION_STATIC( hasher__gc )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\n\tGarrysMod::Lua::UserData *userdata = GET_USERDATA( 1 );\n\tsha1_context *hasher = reinterpret_cast<sha1_context *>( userdata->data );\n\tVALIDATE_HASHER( hasher );\n\n\tuserdata->data = 0;\n\n\tdelete hasher;\n\treturn 0;\n}\n\nLUA_FUNCTION_STATIC( hasher_update )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\tLUA->CheckType( 2, GarrysMod::Lua::Type::STRING );\n\n\tsha1_context *hasher = GET_HASHER( 1 );\n\tVALIDATE_HASHER( hasher );\n\n\tuint32_t len = 0;\n\tconst uint8_t *data = reinterpret_cast<const uint8_t *>( LUA->GetString( 2, &len ) );\n\n\tsha1_update( hasher, data, len );\n\n\treturn 0;\n}\n\nLUA_FUNCTION_STATIC( hasher_final )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\n\tsha1_context *hasher = GET_HASHER( 1 );\n\tVALIDATE_HASHER( hasher );\n\n\tuint8_t digest[20];\n\tsha1_finish( hasher, digest );\n\n\tLUA->PushString( reinterpret_cast<const char *>( digest ), sizeof( digest ) );\n\treturn 1;\n}\n\nLUA_FUNCTION_STATIC( luapack_rename )\n{\n\tLUA->CheckType( 1, GarrysMod::Lua::Type::STRING );\n\n\tchar newto[70];\n\tsnprintf( newto, sizeof( newto ), \"garrysmod\/data\/luapack\/%s.dat\", LUA->GetString( 1 ) );\n\n\tLUA->PushBool( rename( \"garrysmod\/data\/luapack\/temp.dat\", newto ) == 0 );\n\treturn 1;\n}\n\nGMOD_MODULE_OPEN( )\n{\n\tlua = reinterpret_cast<GarrysMod::Lua::ILuaInterface *>( LUA );\n\n\ttry\n\t{\n\t\tlua->PushSpecial( GarrysMod::Lua::SPECIAL_GLOB );\n\n\t\tlua->GetField( -1, \"luapack\" );\n\t\tif( !lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t\t\tthrow std::exception( \"luapack table not found\" );\n\n\t\tlua->PushCFunction( luapack_rename );\n\t\tlua->SetField( -2, \"Rename\" );\n\n\t\tlua->PushCFunction( hasher__new );\n\t\tlua->SetField( -2, HASHER_METATABLE );\n\n\t\tLUA->CreateMetaTableType( HASHER_METATABLE, HASHER_TYPE );\n\n\t\tLUA->Push( -1 );\n\t\tLUA->SetField( -2, \"__index\" );\n\n\t\tLUA->PushCFunction( hasher__gc );\n\t\tLUA->SetField( -2, \"__gc\" );\n\n\t\tLUA->PushCFunction( hasher_update );\n\t\tLUA->SetField( -2, \"Update\" );\n\n\t\tLUA->PushCFunction( hasher_final );\n\t\tLUA->SetField( -2, \"Final\" );\n\n\t\tSymbolFinder symfinder;\n\n\t\tAddOrUpdateFile = reinterpret_cast<AddOrUpdateFile_t>( symfinder.ResolveOnBinary( SERVER_BINARY, ADDORUPDATEFILE_SYM, ADDORUPDATEFILE_SYMLEN ) );\n\t\tif( AddOrUpdateFile == NULL )\n\t\t\tthrow std::exception( \"GModDataPack::AddOrUpdateFile detour failed\" );\n\n\t\tAddOrUpdateFile_d = new MologieDetours::Detour<AddOrUpdateFile_t>( AddOrUpdateFile, reinterpret_cast<AddOrUpdateFile_t>( AddOrUpdateFile_h ) );\n\n\t\tAddOrUpdateFile = AddOrUpdateFile_d->GetOriginalFunction( );\n\n\t\tlua->Msg( \"[luapack_internal] GModDataPack::AddOrUpdateFile detoured.\\n\" );\n\n\t\treturn 0;\n\t}\n\tcatch( std::exception &e )\n\t{\n\t\tLUA->PushString( e.what( ) );\n\t}\n \n\treturn LUA_ERROR( );\n}\n \nGMOD_MODULE_CLOSE( )\n{\n\tdelete AddOrUpdateFile_d;\n\treturn 0;\n}<commit_msg>Linux fix.<commit_after>#include <GarrysMod\/Lua\/Interface.h>\n#include <GarrysMod\/Lua\/LuaInterface.h>\n#include <SymbolFinder.hpp>\n#include <MologieDetours\/detours.h>\n#include <stdexcept>\n#include <stdint.h>\n#include <stdio.h>\n#include <sha1.h>\n\n#if defined _WIN32\n\n#define snprintf _snprintf\n\n#define FASTCALL __fastcall\n#define THISCALL __thiscall\n\n#define SERVER_BINARY \"server.dll\"\n\n#define ADDORUPDATEFILE_SYM reinterpret_cast<const uint8_t *>( \"\\x55\\x8B\\xEC\\x83\\xEC\\x18\\x53\\x56\\x8B\\x75\\x08\\x83\\xC6\\x04\\x83\\x7E\" )\n#define ADDORUPDATEFILE_SYMLEN 16\n\n#elif defined __linux || defined __APPLE__\n\n#define CDECL __attribute__((cdecl))\n\n#if defined __linux\n\n#define SERVER_BINARY \"garrysmod\/bin\/server_srv.so\"\n\n#define SYMBOL_PREFIX \"@\"\n\n#else\n\n#define SERVER_BINARY \"garrysmod\/bin\/server.dylib\"\n\n#define SYMBOL_PREFIX \"@_\"\n\n#endif\n\n#define ADDORUPDATEFILE_SYM reinterpret_cast<const uint8_t *>( SYMBOL_PREFIX \"_ZN12GModDataPack15AddOrUpdateFileEP7LuaFileb\" )\n#define ADDORUPDATEFILE_SYMLEN 0\n\n#endif\n\nGarrysMod::Lua::ILuaInterface *lua = NULL;\n\nclass GModDataPack;\n\nstruct LuaFile\n{\n\tuint32_t skip;\n\tconst char *path;\n};\n\n#if defined _WIN32\n\ntypedef void ( THISCALL *AddOrUpdateFile_t ) ( GModDataPack *self, LuaFile *file, bool force );\n\n#elif defined __linux || defined __APPLE__\n\ntypedef void ( CDECL *AddOrUpdateFile_t ) ( GModDataPack *self, LuaFile *file, bool force );\n\n#endif\n \nAddOrUpdateFile_t AddOrUpdateFile = NULL;\nMologieDetours::Detour<AddOrUpdateFile_t> *AddOrUpdateFile_d = NULL;\n\n#if defined _WIN32\n\nvoid FASTCALL AddOrUpdateFile_h( GModDataPack *self, void *, LuaFile *file, bool b )\n\n#elif defined __linux || defined __APPLE__\n\nvoid CDECL AddOrUpdateFile_h( GModDataPack *self, LuaFile *file, bool b )\n\n#endif\n\n{\n\tlua->PushSpecial( GarrysMod::Lua::SPECIAL_GLOB );\n\tif( lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t{\n\t\tlua->GetField( -1, \"hook\" );\n\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t\t{\n\t\t\tlua->GetField( -1, \"Run\" );\n\t\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::FUNCTION ) )\n\t\t\t{\n\t\t\t\tlua->PushString( \"AddOrUpdateCSLuaFile\" );\n\n\t\t\t\tlua->PushString( file->path );\n\t\t\t\tlua->PushBool( b );\n\n\t\t\t\tif( lua->PCall( 3, 1, 0 ) != 0 )\n\t\t\t\t{\n\t\t\t\t\tlua->Msg( \"[luapack_internal] %s\\n\", lua->GetString( ) );\n\t\t\t\t\tlua->Pop( 3 );\n\t\t\t\t\treturn AddOrUpdateFile( self, file, b );\n\t\t\t\t}\n\n\t\t\t\tif( lua->IsType( -1, GarrysMod::Lua::Type::BOOL ) && lua->GetBool( ) )\n\t\t\t\t{\n\t\t\t\t\tlua->Pop( 3 );\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tlua->Pop( 1 );\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlua->Pop( 1 );\n\t\t\t}\n\t\t}\n\n\t\tlua->Pop( 1 );\n\t}\n\n\tlua->Pop( 1 );\n\treturn AddOrUpdateFile( self, file, b );\n}\n\n#define HASHER_METATABLE \"SHA1\"\n#define HASHER_TYPE 31\n\n#define THROW_ERROR( error ) ( LUA->ThrowError( error ), 0 )\n#define LUA_ERROR( ) THROW_ERROR( LUA->GetString( ) )\n\n#define GET_USERDATA( index ) reinterpret_cast<GarrysMod::Lua::UserData *>( LUA->GetUserdata( index ) )\n#define GET_HASHER( index ) reinterpret_cast<sha1_context *>( GET_USERDATA( index )->data )\n#define VALIDATE_HASHER( hasher ) if( hasher == 0 ) return THROW_ERROR( HASHER_METATABLE \" object is not valid\" )\n\nLUA_FUNCTION_STATIC( hasher__new )\n{\n\ttry\n\t{\n\t\tsha1_context *context = new sha1_context;\n\t\tsha1_starts( context );\n\n\t\tvoid *luadata = LUA->NewUserdata( sizeof( GarrysMod::Lua::UserData ) );\n\t\tGarrysMod::Lua::UserData *userdata = reinterpret_cast<GarrysMod::Lua::UserData *>( luadata );\n\t\tuserdata->data = context;\n\t\tuserdata->type = HASHER_TYPE;\n\n\t\tLUA->CreateMetaTableType( HASHER_METATABLE, HASHER_TYPE );\n\t\tLUA->SetMetaTable( -2 );\n\n\t\treturn 1;\n\t}\n\tcatch( std::exception &e )\n\t{\n\t\tLUA->PushString( e.what( ) );\n\t}\n \n\treturn LUA_ERROR( );\n}\n\nLUA_FUNCTION_STATIC( hasher__gc )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\n\tGarrysMod::Lua::UserData *userdata = GET_USERDATA( 1 );\n\tsha1_context *hasher = reinterpret_cast<sha1_context *>( userdata->data );\n\tVALIDATE_HASHER( hasher );\n\n\tuserdata->data = 0;\n\n\tdelete hasher;\n\treturn 0;\n}\n\nLUA_FUNCTION_STATIC( hasher_update )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\tLUA->CheckType( 2, GarrysMod::Lua::Type::STRING );\n\n\tsha1_context *hasher = GET_HASHER( 1 );\n\tVALIDATE_HASHER( hasher );\n\n\tuint32_t len = 0;\n\tconst uint8_t *data = reinterpret_cast<const uint8_t *>( LUA->GetString( 2, &len ) );\n\n\tsha1_update( hasher, data, len );\n\n\treturn 0;\n}\n\nLUA_FUNCTION_STATIC( hasher_final )\n{\n\tLUA->CheckType( 1, HASHER_TYPE );\n\n\tsha1_context *hasher = GET_HASHER( 1 );\n\tVALIDATE_HASHER( hasher );\n\n\tuint8_t digest[20];\n\tsha1_finish( hasher, digest );\n\n\tLUA->PushString( reinterpret_cast<const char *>( digest ), sizeof( digest ) );\n\treturn 1;\n}\n\nLUA_FUNCTION_STATIC( luapack_rename )\n{\n\tLUA->CheckType( 1, GarrysMod::Lua::Type::STRING );\n\n\tchar newto[70];\n\tsnprintf( newto, sizeof( newto ), \"garrysmod\/data\/luapack\/%s.dat\", LUA->GetString( 1 ) );\n\n\tLUA->PushBool( rename( \"garrysmod\/data\/luapack\/temp.dat\", newto ) == 0 );\n\treturn 1;\n}\n\nGMOD_MODULE_OPEN( )\n{\n\tlua = reinterpret_cast<GarrysMod::Lua::ILuaInterface *>( LUA );\n\n\ttry\n\t{\n\t\tlua->PushSpecial( GarrysMod::Lua::SPECIAL_GLOB );\n\n\t\tlua->GetField( -1, \"luapack\" );\n\t\tif( !lua->IsType( -1, GarrysMod::Lua::Type::TABLE ) )\n\t\t\tthrow std::exception( \"luapack table not found\" );\n\n\t\tlua->PushCFunction( luapack_rename );\n\t\tlua->SetField( -2, \"Rename\" );\n\n\t\tlua->PushCFunction( hasher__new );\n\t\tlua->SetField( -2, HASHER_METATABLE );\n\n\t\tLUA->CreateMetaTableType( HASHER_METATABLE, HASHER_TYPE );\n\n\t\tLUA->Push( -1 );\n\t\tLUA->SetField( -2, \"__index\" );\n\n\t\tLUA->PushCFunction( hasher__gc );\n\t\tLUA->SetField( -2, \"__gc\" );\n\n\t\tLUA->PushCFunction( hasher_update );\n\t\tLUA->SetField( -2, \"Update\" );\n\n\t\tLUA->PushCFunction( hasher_final );\n\t\tLUA->SetField( -2, \"Final\" );\n\n\t\tSymbolFinder symfinder;\n\n\t\tAddOrUpdateFile = reinterpret_cast<AddOrUpdateFile_t>( symfinder.ResolveOnBinary( SERVER_BINARY, ADDORUPDATEFILE_SYM, ADDORUPDATEFILE_SYMLEN ) );\n\t\tif( AddOrUpdateFile == NULL )\n\t\t\tthrow std::exception( \"GModDataPack::AddOrUpdateFile detour failed\" );\n\n\t\tAddOrUpdateFile_d = new MologieDetours::Detour<AddOrUpdateFile_t>( AddOrUpdateFile, reinterpret_cast<AddOrUpdateFile_t>( AddOrUpdateFile_h ) );\n\n\t\tAddOrUpdateFile = AddOrUpdateFile_d->GetOriginalFunction( );\n\n\t\tlua->Msg( \"[luapack_internal] GModDataPack::AddOrUpdateFile detoured.\\n\" );\n\n\t\treturn 0;\n\t}\n\tcatch( std::exception &e )\n\t{\n\t\tLUA->PushString( e.what( ) );\n\t}\n \n\treturn LUA_ERROR( );\n}\n \nGMOD_MODULE_CLOSE( )\n{\n\tdelete AddOrUpdateFile_d;\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/* \n * Copyright (c) 2010-2014, Delft University of Technology\n * Copyright (c) 2010-2014, K. Kumar (me@kartikkumar.com)\n * All rights reserved.\n * See http:\/\/bit.ly\/12SHPLR for license details.\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/timer\/timer.hpp>\n\n#include <Assist\/InputOutput\/basicInputOutput.h>\n\n#include <Tudat\/InputOutput\/dictionaryTools.h>\n#include <Tudat\/InputOutput\/fieldType.h>\n#include <Tudat\/InputOutput\/separatedParser.h>\n#include <Tudat\/InputOutput\/parsedDataVectorUtilities.h>\n\n#include \"Stomi\/ApplicationModes\/randomWalkDatabaseGenerator.h\"\n#include \"Stomi\/ApplicationModes\/randomWalkSimulator.h\" \n#include \"Stomi\/ApplicationModes\/testParticleDatabaseGenerator.h\"\n#include \"Stomi\/ApplicationModes\/testParticleSimulator.h\"\n#include \"Stomi\/InputOutput\/dictionaries.h\"\n\n\/\/! Execute Stomi.\nint main( const int numberOfInputs, const char* inputArguments[ ] )\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Start timer. Timer automatically ends when this object goes out of scope.\n boost::timer::auto_cpu_timer timer;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Declare using-statements.\n using std::cout;\n using std::endl;\n using std::runtime_error;\n using std::string;\n\n using boost::iequals;\n\n using namespace assist::input_output;\n\n using namespace tudat::input_output;\n using namespace tudat::input_output::dictionary;\n using namespace tudat::input_output::field_types::general;\n using namespace tudat::input_output::parsed_data_vector_utilities;\n\n using namespace stomi::application_modes;\n using namespace stomi::input_output;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Set up input deck.\n\n \/\/ Check number of input parameters is correct (the numberOfInputs variable includes the\n \/\/ application itself, so one is subtracted from this number).\n checkNumberOfInputArguments( numberOfInputs - 1 );\n\n \/\/ Read and filter input stream (this can't be declared const because the parser's parse\n \/\/ function is not const-correct at the moment).\n string filteredInput = readAndFilterInputFile( inputArguments[ 1 ] );\n\n \/\/ Declare a separated parser.\n SeparatedParser parser( string( \": \" ), 2, parameterName, parameterValue );\n\n \/\/ Parse filtered data.\n const ParsedDataVectorPtr parsedData = parser.parse( filteredInput );\n\n \/\/ Get general parameters dictionary.\n DictionaryPointer dictionary = getGeneralParametersDictionary( );\n\n \/\/ Extract application mode.\n const string applicationMode = extractParameterValue< string >(\n parsedData->begin( ), parsedData->end( ), findEntry( dictionary, \"MODE\" ) );\n\n const string databasePath = extractParameterValue< string >(\n parsedData->begin( ), parsedData->end( ), \n findEntry( dictionary, \"DATABASEPATH\" ) );\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Call selected application mode.\n cout << endl;\n cout << \"----------------------------------------------------------------------------\" << endl;\n cout << endl;\n cout << \" STOMI \" << endl;\n cout << \" 2.0.0 \" << endl;\n cout << endl;\n cout << \" Copyright (c) 2010-2014, Delft University of Technology \" << endl;\n cout << \" Copyright (c) 2010-2014, K. Kumar (me@kartikkumar.com) \" << endl;\n cout << \" Copyright (c) 2013-2014, S. Hirsh (sethhirsh@berkeley.edu) \" << endl;\n cout << endl;\n cout << \"----------------------------------------------------------------------------\" << endl;\n\n cout << endl;\n cout << \"****************************************************************************\" << endl;\n cout << \"Input parameters\" << endl;\n cout << \"****************************************************************************\" << endl;\n cout << endl;\n\n cout << endl;\n cout << \"Application mode \";\n\n if ( iequals( applicationMode, \"TPDB\" ) )\n {\n cout << \"TEST PARTICLE DATABASE GENERATOR\" << endl;\n executeTestParticleDatabaseGenerator( databasePath, parsedData );\n } \n\n else if ( iequals( applicationMode, \"TPSIM\" ) )\n {\n cout << \"TEST PARTICLE SIMULATOR\" << endl;\n executeTestParticleSimulator( databasePath, parsedData ); \n } \n\n else if ( iequals( applicationMode, \"RWDB\" ) )\n {\n cout << \"RANDOM WALK DATABASE GENERATOR\" << endl;\n executeRandomWalkDatabaseGenerator( databasePath, parsedData ); \n } \n\n else if ( iequals( applicationMode, \"RWSIM\" ) )\n {\n cout << \"RANDOM WALK SIMULATOR\" << endl;\n executeRandomWalkSimulator( databasePath, parsedData ); \n } \n\n else\n {\n throw runtime_error( \"ERROR: Application mode not recognized!\" );\n }\n\n cout << endl;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Print timing information.\n cout << \"Timing information: \";\n \n \/\/ If program is successfully completed, return 0.\n return EXIT_SUCCESS;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n}\n\n\/* \n * TODO:\n * - encapsulate code in try-catch blocks to capture exceptions.\n * - execute verification of existing data against input parameters provided to ensure\n * consistency of inputs and possibly warn user.\n * - expand code to enable interactive interface for user to provide inputs and select\n * options (capture command line user input). \n *\/ \n<commit_msg>Remove erroneous copyright statement.<commit_after>\/* \n * Copyright (c) 2010-2014, Delft University of Technology\n * Copyright (c) 2010-2014, K. Kumar (me@kartikkumar.com)\n * All rights reserved.\n * See http:\/\/bit.ly\/12SHPLR for license details.\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/timer\/timer.hpp>\n\n#include <Assist\/InputOutput\/basicInputOutput.h>\n\n#include <Tudat\/InputOutput\/dictionaryTools.h>\n#include <Tudat\/InputOutput\/fieldType.h>\n#include <Tudat\/InputOutput\/separatedParser.h>\n#include <Tudat\/InputOutput\/parsedDataVectorUtilities.h>\n\n#include \"Stomi\/ApplicationModes\/randomWalkDatabaseGenerator.h\"\n#include \"Stomi\/ApplicationModes\/randomWalkSimulator.h\" \n#include \"Stomi\/ApplicationModes\/testParticleDatabaseGenerator.h\"\n#include \"Stomi\/ApplicationModes\/testParticleSimulator.h\"\n#include \"Stomi\/InputOutput\/dictionaries.h\"\n\n\/\/! Execute Stomi.\nint main( const int numberOfInputs, const char* inputArguments[ ] )\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Start timer. Timer automatically ends when this object goes out of scope.\n boost::timer::auto_cpu_timer timer;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Declare using-statements.\n using std::cout;\n using std::endl;\n using std::runtime_error;\n using std::string;\n\n using boost::iequals;\n\n using namespace assist::input_output;\n\n using namespace tudat::input_output;\n using namespace tudat::input_output::dictionary;\n using namespace tudat::input_output::field_types::general;\n using namespace tudat::input_output::parsed_data_vector_utilities;\n\n using namespace stomi::application_modes;\n using namespace stomi::input_output;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Set up input deck.\n\n \/\/ Check number of input parameters is correct (the numberOfInputs variable includes the\n \/\/ application itself, so one is subtracted from this number).\n checkNumberOfInputArguments( numberOfInputs - 1 );\n\n \/\/ Read and filter input stream (this can't be declared const because the parser's parse\n \/\/ function is not const-correct at the moment).\n string filteredInput = readAndFilterInputFile( inputArguments[ 1 ] );\n\n \/\/ Declare a separated parser.\n SeparatedParser parser( string( \": \" ), 2, parameterName, parameterValue );\n\n \/\/ Parse filtered data.\n const ParsedDataVectorPtr parsedData = parser.parse( filteredInput );\n\n \/\/ Get general parameters dictionary.\n DictionaryPointer dictionary = getGeneralParametersDictionary( );\n\n \/\/ Extract application mode.\n const string applicationMode = extractParameterValue< string >(\n parsedData->begin( ), parsedData->end( ), findEntry( dictionary, \"MODE\" ) );\n\n const string databasePath = extractParameterValue< string >(\n parsedData->begin( ), parsedData->end( ), \n findEntry( dictionary, \"DATABASEPATH\" ) );\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Call selected application mode.\n cout << endl;\n cout << \"----------------------------------------------------------------------------\" << endl;\n cout << endl;\n cout << \" STOMI \" << endl;\n cout << \" 2.0.0 \" << endl;\n cout << endl;\n cout << \" Copyright (c) 2010-2014, Delft University of Technology \" << endl;\n cout << \" Copyright (c) 2010-2014, K. Kumar (me@kartikkumar.com) \" << endl;\n cout << endl;\n cout << \"----------------------------------------------------------------------------\" << endl;\n\n cout << endl;\n cout << \"****************************************************************************\" << endl;\n cout << \"Input parameters\" << endl;\n cout << \"****************************************************************************\" << endl;\n cout << endl;\n\n cout << endl;\n cout << \"Application mode \";\n\n if ( iequals( applicationMode, \"TPDB\" ) )\n {\n cout << \"TEST PARTICLE DATABASE GENERATOR\" << endl;\n executeTestParticleDatabaseGenerator( databasePath, parsedData );\n } \n\n else if ( iequals( applicationMode, \"TPSIM\" ) )\n {\n cout << \"TEST PARTICLE SIMULATOR\" << endl;\n executeTestParticleSimulator( databasePath, parsedData ); \n } \n\n else if ( iequals( applicationMode, \"RWDB\" ) )\n {\n cout << \"RANDOM WALK DATABASE GENERATOR\" << endl;\n executeRandomWalkDatabaseGenerator( databasePath, parsedData ); \n } \n\n else if ( iequals( applicationMode, \"RWSIM\" ) )\n {\n cout << \"RANDOM WALK SIMULATOR\" << endl;\n executeRandomWalkSimulator( databasePath, parsedData ); \n } \n\n else\n {\n throw runtime_error( \"ERROR: Application mode not recognized!\" );\n }\n\n cout << endl;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n \/\/ Print timing information.\n cout << \"Timing information: \";\n \n \/\/ If program is successfully completed, return 0.\n return EXIT_SUCCESS;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n}\n\n\/* \n * TODO:\n * - encapsulate code in try-catch blocks to capture exceptions.\n * - execute verification of existing data against input parameters provided to ensure\n * consistency of inputs and possibly warn user.\n * - expand code to enable interactive interface for user to provide inputs and select\n * options (capture command line user input). \n *\/ \n<|endoftext|>"} {"text":"<commit_before>\n\n\n#include \"TMainWindow.h\"\n#include <Application.h>\n#include <MenuItem.h>\n#include <MenuBar.h>\n#include <Menu.h>\n#include <Directory.h>\n#include <iostream>\n\nusing namespace org::toxic;\nusing namespace std;\n\n\nTMainWindow::TMainWindow(BRect frame): BWindow(frame,\"Guitar Master\",B_TITLED_WINDOW,B_NOT_ZOOMABLE | B_NOT_RESIZABLE)\n{\n\tcout<<\"Main window\"<<endl;\n\t\n\t\n\ttimer = new BMessageRunner(this,new BMessage(T_MSG_FRAME),50000,-1);\n\t\n\tBDirectory songs_dir(\"songs\");\n\t\n\tif(songs_dir.InitCheck()!=B_OK)\n\t{\n\t\tcout<<\"Songs dir not found\"<<endl;\t\n\t}\n\telse\n\t{\n\t\tcout<<\"Found :\"<<songs_dir.CountEntries()<<endl;\t\n\t}\n\t\n\tResizeTo(640,480);\n\t\n\tBRect bounds = Bounds();\n\tbounds.bottom = bounds.top + 15;\n\tBMenuBar * menubar = new BMenuBar(bounds,\"main menu\");\n\t\t\n\t\n\tBMenu * menu;\n\tBMenuItem * item;\n\t\n\t\/\/Game menu\n\tmenu = new BMenu(\"Game\");\n\t\/\/----items\n\titem = new BMenuItem(\"Quit\",new BMessage(B_QUIT_REQUESTED),'Q');\n\tmenu->AddItem(item);\n\t\n\tmenubar->AddItem(menu);\n\t\n\t\/\/Songs menu\n\tmenu = new BMenu(\"Songs\");\n\t\/\/ fill with available song list...\n\tmenubar->AddItem(menu);\n\t\n\tAddChild(menubar);\n\t\/\/menubar->ResizeToPreferred();\n\t\n\t\/\/BGLView\n\tbounds.top=menubar->Bounds().bottom+1;\n\tbounds.bottom = Bounds().bottom;\n\tgameview = new TGameView(bounds);\n\t\n\t\n\t\n\tAddChild(gameview);\n\tShow();\n}\n\n\nTMainWindow::~TMainWindow()\n{\n\t\n\tcout<<\"main window destructor\"<<endl;\n\tdelete timer;\n}\n\n\n\n\n\nvoid TMainWindow::MessageReceived(BMessage * mesg)\n{\n\tswitch(mesg->what)\n\t{\n\t\tcase T_MSG_FRAME:\n\t\t\tgameview->Render();\n\t\tbreak;\n\t\n\t\t\n\t}\t\n}\n\n\nbool TMainWindow::QuitRequested()\n{\n\tbe_app->PostMessage(B_QUIT_REQUESTED);\n\treturn true;\n}\n<commit_msg>Songs listed on bmenu<commit_after>\n\n\n#include \"TMainWindow.h\"\n#include <Application.h>\n#include <MenuItem.h>\n#include <MenuBar.h>\n#include <Menu.h>\n#include <Directory.h>\n#include <iostream>\n\nusing namespace org::toxic;\nusing namespace std;\n\n\nTMainWindow::TMainWindow(BRect frame): BWindow(frame,\"Guitar Master\",B_TITLED_WINDOW,B_NOT_ZOOMABLE | B_NOT_RESIZABLE)\n{\n\tcout<<\"Main window\"<<endl;\n\t\n\t\n\ttimer = new BMessageRunner(this,new BMessage(T_MSG_FRAME),50000,-1);\n\t\n\t\n\t\n\tResizeTo(640,480);\n\t\n\tBRect bounds = Bounds();\n\tbounds.bottom = bounds.top + 15;\n\tBMenuBar * menubar = new BMenuBar(bounds,\"main menu\");\n\t\t\n\t\n\tBMenu * menu;\n\tBMenuItem * item;\n\t\n\t\/\/Game menu\n\tmenu = new BMenu(\"Game\");\n\t\/\/----items\n\titem = new BMenuItem(\"Quit\",new BMessage(B_QUIT_REQUESTED),'Q');\n\tmenu->AddItem(item);\n\t\n\tmenubar->AddItem(menu);\n\t\n\t\/\/Songs menu\n\tmenu = new BMenu(\"Songs\");\n\t\/\/ fill with available song list...\n\tcout<<\"Reading songs directory...\"<<endl;\n\t\n\tBDirectory songs_dir(\"songs\");\n\tBEntry entry;\n\tchar str[B_FILE_NAME_LENGTH];\n\t\n\tif(songs_dir.InitCheck()!=B_OK)\n\t{\n\t\tcout<<\"Songs dir not found\"<<endl;\t\n\t}\n\telse\n\t{\n\t\tint num = songs_dir.CountEntries();\n\t\tcout<<\"Found :\"<<num<<endl;\n\t\t\n\t\tfor(int i=0;i<num;i++)\n\t\t{\n\t\t\tsongs_dir.GetNextEntry(&entry,false);\n\t\t\tentry.GetName(str);\n\t\t\tcout<<\"name: \"<<str<<endl;\n\t\t\t\n\t\t\titem = new BMenuItem(str,NULL);\n\t\t\tmenu->AddItem(item);\n\t\t\t\t\n\t\t}\t\n\t}\n\tmenubar->AddItem(menu);\n\t\n\t\/\/Play menu\n\tmenu = new BMenu(\"Play\");\n\titem = new BMenuItem(\"Easy\",NULL);\n\tmenu->AddItem(item);\n\titem = new BMenuItem(\"Normal\",NULL);\n\tmenu->AddItem(item);\n\titem = new BMenuItem(\"Amazing\",NULL);\n\tmenu->AddItem(item);\n\tmenubar->AddItem(menu);\n\t\n\t\n\tAddChild(menubar);\n\t\/\/menubar->ResizeToPreferred();\n\t\n\t\/\/BGLView\n\tbounds.top=menubar->Bounds().bottom+1;\n\tbounds.bottom = Bounds().bottom;\n\tgameview = new TGameView(bounds);\n\t\n\t\n\t\n\tAddChild(gameview);\n\tShow();\n}\n\n\nTMainWindow::~TMainWindow()\n{\n\t\n\tcout<<\"main window destructor\"<<endl;\n\tdelete timer;\n}\n\n\n\n\n\nvoid TMainWindow::MessageReceived(BMessage * mesg)\n{\n\tswitch(mesg->what)\n\t{\n\t\tcase T_MSG_FRAME:\n\t\t\tgameview->Render();\n\t\tbreak;\n\t\n\t\t\n\t}\t\n}\n\n\nbool TMainWindow::QuitRequested()\n{\n\tbe_app->PostMessage(B_QUIT_REQUESTED);\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nTPC DA for online calibration\n\nContact: Haavard.Helstrup@cern.ch\nLink: \nRun Type: PHYSICS STANDALONE DAQ\nDA Type: MON\nNumber of events needed: 500\nInput Files: \nOutput Files: tpcCE.root, to be exported to the DAQ FXS\nfileId: CE\nTrigger types used: PHYSICS_EVENT\n\n*\/\n\n\/*\n\nTPCCEda.cxx - calibration algorithm for TPC Central Electrode events\n\n10\/06\/2007 sylvain.chapeland@cern.ch : first version - clean skeleton based on DAQ DA case1\n06\/12\/2007 haavard.helstrup@cern.ch : created CE DA based on pulser code\n19\/09\/2008 J.Wiechula@gsi.de: Added support for configuration files.\n\ncontact: marian.ivanov@cern.ch\n\n\nThis process reads RAW data from the files provided as command line arguments\nand save results in a file (named from RESULT_FILE define - see below).\n\n*\/\n\n#define RESULT_FILE \"tpcCE.root\"\n#define FILE_ID \"CE\"\n#define MAPPING_FILE \"tpcMapping.root\"\n#define CONFIG_FILE \"TPCCEda.conf\"\n\n\n#include <daqDA.h>\n#include \"event.h\"\n#include \"monitor.h\"\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/\n\/\/Root includes\n\/\/\n#include <TFile.h>\n#include \"TROOT.h\"\n#include \"TPluginManager.h\"\n#include \"TSystem.h\"\n#include \"TString.h\"\n#include \"TObjString.h\"\n#include \"TDatime.h\"\n\/\/\n\/\/AliRoot includes\n\/\/\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliTPCmapper.h\"\n#include \"AliTPCRawStream.h\"\n#include \"AliTPCROC.h\"\n#include \"AliTPCCalROC.h\"\n#include \"AliTPCCalPad.h\"\n#include \"AliMathBase.h\"\n#include \"TTreeStream.h\"\n#include \"AliLog.h\"\n#include \"AliTPCConfigDA.h\"\n\/\/\n\/\/AMORE\n\/\/\n#include <AmoreDA.h>\n\/\/\n\/\/ TPC calibration algorithm includes\n\/\/\n#include \"AliTPCCalibCE.h\"\n\n\n\n\n\/* Main routine\n Arguments: list of DATE raw data files\n*\/\nint main(int argc, char **argv) {\n \/* log start of process *\/\n printf(\"TPC CE DA started - %s\\n\",__FILE__);\n\n if (argc<2) {\n printf(\"Wrong number of arguments\\n\");\n return -1;\n }\n \n AliLog::SetClassDebugLevel(\"AliTPCRawStream\",-5);\n AliLog::SetClassDebugLevel(\"AliRawReaderDate\",-5);\n AliLog::SetClassDebugLevel(\"AliTPCAltroMapping\",-5);\n AliLog::SetModuleDebugLevel(\"RAW\",-5);\n\n gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n \"*\",\n \"TStreamerInfo\",\n \"RIO\",\n \"TStreamerInfo()\");\n\n \/* declare monitoring program *\/\n int i,status;\n status=monitorDeclareMp( __FILE__ );\n if (status!=0) {\n printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n monitorSetNowait();\n monitorSetNoWaitNetworkTimeout(1000);\n\n \/\/variables \n AliTPCmapper *mapping = 0; \/\/ The TPC mapping\n char localfile[255];\n unsigned long32 runNb=0; \/\/run number\n \/\/ configuration options \n Bool_t fastDecoding = kFALSE;\n \n \/\/ if test setup get parameters from $DAQDA_TEST_DIR \n if (!mapping){\n \/* copy locally the mapping file from daq detector config db *\/\n sprintf(localfile,\".\/%s\",MAPPING_FILE);\n status = daqDA_DB_getFile(MAPPING_FILE,localfile);\n if (status) {\n printf(\"Failed to get mapping file (%s) from DAQdetDB, status=%d\\n\", MAPPING_FILE, status);\n return -1;\n }\n\n \/* open the mapping file and retrieve mapping object *\/\n TFile *fileMapping = new TFile(MAPPING_FILE, \"read\");\n mapping = (AliTPCmapper*) fileMapping->Get(\"tpcMapping\");\n delete fileMapping;\n }\n\n if (mapping == 0) {\n printf(\"Failed to get mapping object from %s. ...\\n\", MAPPING_FILE);\n return -1;\n } else {\n printf(\"Got mapping object from %s\\n\", MAPPING_FILE);\n }\n \n \/\/\n \/\/ DA configuration from configuration file\n \/\/\n \/\/retrieve configuration file\n sprintf(localfile,\".\/%s\",CONFIG_FILE);\n status = daqDA_DB_getFile(CONFIG_FILE,localfile);\n if (status) {\n printf(\"Failed to get configuration file (%s) from DAQdetDB, status=%d\\n\", CONFIG_FILE, status);\n return -1;\n }\n AliTPCConfigDA config(CONFIG_FILE);\n \/\/ check configuration\n if ( (Int_t)config.GetValue(\"UseFastDecoder\") == 1 ){\n printf(\"Info: The fast decoder will be used for the processing.\\n\");\n fastDecoding=kTRUE;\n }\n\n \/\/create calibration object \n AliTPCCalibCE calibCE(config.GetConfigurationMap()); \/\/ central electrode calibration\n calibCE.SetAltroMapping(mapping->GetAltroMapping()); \/\/ Use altro mapping we got from daqDetDb\n\n \/\/===========================\/\/\n \/\/ loop over RAW data files \/\/\n \/\/==========================\/\/\n int nevents=0;\n for ( i=1; i<argc; i++) {\n\n \/* define data source : this is argument i *\/\n printf(\"Processing file %s\\n\", argv[i]);\n status=monitorSetDataSource( argv[i] );\n if (status!=0) {\n printf(\"monitorSetDataSource() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n \/* read until EOF *\/\n while (true) {\n struct eventHeaderStruct *event;\n\n \/* check shutdown condition *\/\n if (daqDA_checkShutdown()) {break;}\n\n \/* get next event (blocking call until timeout) *\/\n status=monitorGetEventDynamic((void **)&event);\n if (status==MON_ERR_EOF) {\n printf (\"End of File %d detected\\n\",i);\n break; \/* end of monitoring file has been reached *\/\n }\n\n if (status!=0) {\n printf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n break;\n }\n \n \/* retry if got no event *\/\n if (event==NULL)\n continue;\n \n \/* skip start\/end of run events *\/\n if ( (event->eventType != physicsEvent) && (event->eventType != calibrationEvent) )\n continue;\n\n \n nevents++;\n \/\/ get the run number\n runNb = event->eventRunNb;\n \/\/ CE calibration\n calibCE.ProcessEvent(event);\n \n \/* free resources *\/\n free(event);\n }\n }\n\n \/\/\n \/\/ Analyse CE data and write them to rootfile\n \/\/\n calibCE.Analyse();\n printf (\"%d events processed\\n\",nevents);\n\n TFile * fileTPC = new TFile (RESULT_FILE,\"recreate\");\n calibCE.Write(\"tpcCalibCE\");\n delete fileTPC;\n printf(\"Wrote %s\\n\",RESULT_FILE);\n\n \/* store the result file on FES *\/\n\n status=daqDA_FES_storeFile(RESULT_FILE,FILE_ID);\n if (status) {\n status = -2;\n }\n\n \/\/\n \/\/Send objects to the AMORE DB\n \/\/\n printf (\"AMORE part\\n\");\n const char *amoreDANameorig=gSystem->Getenv(\"AMORE_DA_NAME\");\n \/\/cheet a little -- temporary solution (hopefully)\n \/\/\n \/\/currently amoreDA uses the environment variable AMORE_DA_NAME to create the mysql\n \/\/table in which the calib objects are stored. This table is dropped each time AmoreDA\n \/\/is initialised. This of course makes a problem if we would like to store different\n \/\/calibration entries in the AMORE DB. Therefore in each DA which writes to the AMORE DB\n \/\/the AMORE_DA_NAME env variable is overwritten. \n gSystem->Setenv(\"AMORE_DA_NAME\",Form(\"TPC-%s\",FILE_ID));\n \/\/\n \/\/ end cheet\n TDatime time;\n TObjString info(Form(\"Run: %u; Date: %s\",runNb,time.AsSQLString()));\n amore::da::AmoreDA amoreDA(amore::da::AmoreDA::kSender);\n Int_t statusDA=0;\n statusDA+=amoreDA.Send(\"CET0\",calibCE.GetCalPadT0());\n statusDA+=amoreDA.Send(\"CEQ\",calibCE.GetCalPadQ());\n statusDA+=amoreDA.Send(\"CERMS\",calibCE.GetCalPadRMS());\n statusDA+=amoreDA.Send(\"Info\",&info);\n if ( statusDA!=0 )\n printf(\"Waring: Failed to write one of the calib objects to the AMORE database\\n\");\n if (amoreDANameorig) gSystem->Setenv(\"AMORE_DA_NAME\",amoreDANameorig);\n\n return status;\n}\n<commit_msg>TPCCEda.cxx.diff update CEda for interleaved laser trigger running. Allow for minimum number of events in standalone. Using a ring buffer for the events arriving, second thread processes the events.<commit_after>\/*\nTPC DA for online calibration\n\nContact: Haavard.Helstrup@cern.ch\nLink: \nRun Type: PHYSICS STANDALONE DAQ\nDA Type: MON\nNumber of events needed: 500\nInput Files: \nOutput Files: tpcCE.root, to be exported to the DAQ FXS\nfileId: CE\nTrigger types used: PHYSICS_EVENT\n\n*\/\n\n\/*\n\nTPCCEda.cxx - calibration algorithm for TPC Central Electrode events\n\n10\/06\/2007 sylvain.chapeland@cern.ch : first version - clean skeleton based on DAQ DA case1\n06\/12\/2007 haavard.helstrup@cern.ch : created CE DA based on pulser code\n19\/09\/2008 J.Wiechula@gsi.de: Added support for configuration files.\n\ncontact: marian.ivanov@cern.ch\n\n\nThis process reads RAW data from the files provided as command line arguments\nand save results in a file (named from RESULT_FILE define - see below).\n\n*\/\n\n#define RESULT_FILE \"tpcCE.root\"\n#define FILE_ID \"CE\"\n#define MAPPING_FILE \"tpcMapping.root\"\n#define CONFIG_FILE \"TPCCEda.conf\"\n\n#include <daqDA.h>\n#include \"event.h\"\n#include \"monitor.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <pthread.h>\n#include <vector>\n\/\/\n\/\/Root includes\n\/\/\n#include <TFile.h>\n#include \"TROOT.h\"\n#include \"TPluginManager.h\"\n#include \"TSystem.h\"\n#include \"TString.h\"\n#include \"TObjString.h\"\n#include \"TDatime.h\"\n#include \"TMap.h\"\n#include \"TGraph.h\"\n#include \"TMath.h\"\n\/\/\n\/\/AliRoot includes\n\/\/\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliTPCmapper.h\"\n#include \"AliTPCRawStream.h\"\n#include \"AliTPCROC.h\"\n#include \"AliTPCCalROC.h\"\n#include \"AliTPCCalPad.h\"\n#include \"AliMathBase.h\"\n#include \"TTreeStream.h\"\n#include \"AliLog.h\"\n#include \"AliTPCConfigDA.h\"\n\/\/\n\/\/AMORE\n\/\/\n#include <AmoreDA.h>\n\/\/\n\/\/ TPC calibration algorithm includes\n\/\/\n#include \"AliTPCCalibCE.h\"\n\n\n\/\/functios, implementation below\nvoid SendToAmoreDB(AliTPCCalibCE &calibCE, unsigned long32 runNb);\n\/\/for threaded processing\nvoid *processEventBuffer(void *arg);\n\n\/\/common event processing variables for threaded processing\nstd::vector<eventHeaderStruct*> eventBuffer;\nvolatile int bStop = false;\nstruct timespec duree_nanosleep;\nInt_t forceNevents=-1;\nBool_t forceBufferEnds=kFALSE;\n\n\n\/* Main routine\n Arguments: list of DATE raw data files\n*\/\nint main(int argc, char **argv) {\n \/* log start of process *\/\n printf(\"TPC CE DA started - %s\\n\",__FILE__);\n \n if (argc<2) {\n printf(\"Wrong number of arguments\\n\");\n return -1;\n }\n \n AliLog::SetClassDebugLevel(\"AliTPCRawStream\",-5);\n AliLog::SetClassDebugLevel(\"AliRawReaderDate\",-5);\n AliLog::SetClassDebugLevel(\"AliTPCAltroMapping\",-5);\n AliLog::SetModuleDebugLevel(\"RAW\",-5);\n \n gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n \"*\",\n \"TStreamerInfo\",\n \"RIO\",\n \"TStreamerInfo()\");\n \n \/* declare monitoring program *\/\n int i,status;\n status=monitorDeclareMp( __FILE__ );\n if (status!=0) {\n printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n monitorSetNowait();\n monitorSetNoWaitNetworkTimeout(1000);\n\n \/\/variables\n AliTPCmapper *mapping = 0; \/\/ The TPC mapping\n char localfile[255];\n unsigned long32 runNb=0; \/\/run number\n \n \/\/\n \/\/ thread wait time\n \/\/\n duree_nanosleep.tv_sec=0;\n duree_nanosleep.tv_nsec=1000000; \/\/1 ms\n \n \/\/\n \/\/ DA configuration from configuration file\n \/\/\n \/\/retrieve configuration file\n sprintf(localfile,\".\/%s\",CONFIG_FILE);\n status = daqDA_DB_getFile(CONFIG_FILE,localfile);\n if (status) {\n printf(\"Failed to get configuration file (%s) from DAQdetDB, status=%d\\n\", CONFIG_FILE, status);\n return -1;\n }\n AliTPCConfigDA config(CONFIG_FILE);\n \/\/ check configuration options\n TString laserTriggerName(\"C0LSR-ABCE-NOPF-CENT\");\n size_t bufferSize=30;\n Int_t forceTriggerId=-1;\n Int_t forceNeventsStandalone=-1;\n Bool_t forceBufferEndsGlobal=kTRUE;\n\/\/ Bool_t forceBufferEndsGlobalDummy=kFALSE; \n if ( config.GetConfigurationMap()->GetValue(\"LaserTriggerName\") ) {\n laserTriggerName=config.GetConfigurationMap()->GetValue(\"LaserTriggerName\")->GetName();\n printf(\"Laser trigger class name set to: %s.\\n\",laserTriggerName.Data());\n }\n \n if ( config.GetConfigurationMap()->GetValue(\"BufferSize\") ) {\n bufferSize=(size_t)config.GetValue(\"BufferSize\");\n printf(\"Setting event buffer size to: %d.\\n\",bufferSize);\n }\n \n if ( config.GetConfigurationMap()->GetValue(\"ForceTriggerId\") ) {\n forceTriggerId=TMath::Nint(config.GetValue(\"ForceTriggerId\"));\n printf(\"Only processing triggers with Id: %d.\\n\",forceTriggerId);\n }\n \n if ( config.GetConfigurationMap()->GetValue(\"ForceBufferEndsGlobal\") ) {\n forceBufferEndsGlobal=config.GetValue(\"ForceBufferEndsGlobal\")!=0.;\n printf(\"Process all buffered events in global partition: %s.\\n\",forceBufferEndsGlobal?\"yes\":\"no\");\n }\n \n if ( config.GetConfigurationMap()->GetValue(\"ForceNMaxEvents\") ) {\n forceNevents=TMath::Nint(config.GetValue(\"ForceNMaxEvents\"));\n printf(\"Forcing maximum number of %d events.\\n\",forceNeventsStandalone);\n }\n \n \/\/subsribe to laser triggers only in physics partition\n \/\/if the trigger class is not available the return value is -1\n \/\/in this case we are most probably running as a standalone\n \/\/ laser run and should request all events\n unsigned char *classIdptr=0;\n int retClassId=daqDA_getClassIdFromName(laserTriggerName.Data(),classIdptr);\n if (retClassId==0){\n \/\/interleaved laser in physics runs\n char c[5];\n sprintf(c,\"%u\",*classIdptr);\n char *table[5] = {\"PHY\",\"Y\",\"*\",c,NULL};\n monitorDeclareTableExtended(table);\n printf(\"Using trigger class Id: %s\\n\",c);\n\/\/ forceBufferEndsGlobal=forceBufferEndsGlobalDummy;\n } else if (retClassId==-1){\n \/\/defaul case, accept all physics events\n char *table[3] = {\"PHY\",\"Y\",NULL};\n monitorDeclareTableExtended(table);\n printf(\"Using all trigger class Ids\\n\");\n\/\/ forceNevents=forceNeventsStandalone;\n } else {\n printf(\"Unknown return value of 'daqDA_getClassIdFromName': %d\\n\",retClassId);\n return -2;\n }\n\n \/\/see if we should force the trigger id\n if (forceTriggerId>-1){\n char c[5];\n sprintf(c,\"%d\",forceTriggerId);\n char *table[5] = {\"PHY\",\"Y\",\"*\",c,NULL};\n monitorDeclareTableExtended(table);\n\/\/ forceBufferEndsGlobal=forceBufferEndsGlobalDummy;\n }\n \n \n \/\/ if test setup get parameters from $DAQDA_TEST_DIR\n if (!mapping){\n \/* copy locally the mapping file from daq detector config db *\/\n sprintf(localfile,\".\/%s\",MAPPING_FILE);\n status = daqDA_DB_getFile(MAPPING_FILE,localfile);\n if (status) {\n printf(\"Failed to get mapping file (%s) from DAQdetDB, status=%d\\n\", MAPPING_FILE, status);\n return -1;\n }\n \n \/* open the mapping file and retrieve mapping object *\/\n TFile *fileMapping = new TFile(MAPPING_FILE, \"read\");\n mapping = (AliTPCmapper*) fileMapping->Get(\"tpcMapping\");\n delete fileMapping;\n }\n \n if (mapping == 0) {\n printf(\"Failed to get mapping object from %s. ...\\n\", MAPPING_FILE);\n return -1;\n } else {\n printf(\"Got mapping object from %s\\n\", MAPPING_FILE);\n }\n \n \n \/\/create calibration object\n AliTPCCalibCE calibCE(config.GetConfigurationMap()); \/\/ central electrode calibration\n calibCE.SetAltroMapping(mapping->GetAltroMapping()); \/\/ Use altro mapping we got from daqDetDb\n\n \/\/\n \/\/ start thread\n \/\/\n\/\/ sleep(5);\n pthread_t threadId=0;\n int threadStatus=0;\n threadStatus = pthread_create( &threadId, NULL, processEventBuffer, (void*)(&calibCE));\n eventBuffer.resize(bufferSize); \n struct timespec duree_out;\n \/\/===========================\/\/\n \/\/ loop over RAW data files \/\/\n \/\/==========================\/\/\n int nevents=0;\n size_t counter=0;\n for ( i=1; i<argc; i++) {\n \n \/* define data source : this is argument i *\/\n printf(\"Processing file %s\\n\", argv[i]);\n status=monitorSetDataSource( argv[i] );\n if (status!=0) {\n printf(\"monitorSetDataSource() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n \n \/* read until EOF *\/\n while (true) {\n struct eventHeaderStruct *event;\n \n \/* check shutdown condition *\/\n if (daqDA_checkShutdown()) {break;}\n\n \/\/check for predefined number of events\n if (forceNevents>0 && calibCE.GetNeventsProcessed()>=forceNevents) {\n printf(\"Requested number of events reached (%d).\\n\",forceNevents);\n break;\n }\n \n \/\/buffer events, only read them if a buffer position is free\n if (eventBuffer[counter]==0) {\n \n \/* get next event (blocking call until timeout) *\/\n status=monitorGetEventDynamic((void **)&event);\n if (status==MON_ERR_EOF) {\n printf (\"End of File %d detected\\n\",i);\n break; \/* end of monitoring file has been reached *\/\n }\n \n if (status!=0) {\n printf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n break;\n }\n \n \/* retry if got no event *\/\n if (event==NULL)\n continue;\n \n \/* skip start\/end of run events *\/\n if ( (event->eventType != physicsEvent) && (event->eventType != calibrationEvent) ){\n free(event);\n continue;\n }\n\n \n \/\/ get the run number\n runNb = event->eventRunNb;\n\n\/\/ printf(\" trigger (%05d-%03d) = %8.8x %8.8x - %02u\\n\",nevents, calibCE.GetNeventsProcessed(),\n\/\/ event->eventTriggerPattern[1], event->eventTriggerPattern[0],event->eventType);\n\n\/\/ printf(\"filling buffer %d\\n\",counter);\n eventBuffer[counter]=event;\n \n ++nevents;\n ++counter;\n if (counter >= eventBuffer.size()) {counter=0;}\n }else{\n\/\/ printf(\"buffer already used: %d\\n\",counter);\n nanosleep(&duree_nanosleep,&duree_out);\n }\n }\n }\n\n \/\/\n \/\/ wait for thread to end\n \/\/\n if (!forceBufferEndsGlobal) bStop = true;\n else forceBufferEnds=forceBufferEndsGlobal;\n \n pthread_join( threadId, NULL);\n\/\/ printf(\"Event Processing Thread ended with: %d\\n\",threadStatus);\n \n \/\/\n \/\/ free unprocessed events\n \/\/\n for (size_t i=0;i<eventBuffer.size();++i){\n if (eventBuffer[i]) {\n free(eventBuffer[i]);\n eventBuffer[i]=0;\n\/\/ printf(\"freeing buffer %d\\n\",i);\n }\n }\n\n \/\/\n \/\/ Analyse CE data and write them to rootfile\n \/\/\n calibCE.Analyse();\n printf (\"%d events processed, %d used\\n\",nevents,calibCE.GetNeventsProcessed());\n \n TFile * fileTPC = new TFile (RESULT_FILE,\"recreate\");\n calibCE.Write(\"tpcCalibCE\");\n delete fileTPC;\n printf(\"Wrote %s\\n\",RESULT_FILE);\n \n \/* store the result file on FES *\/\n \n status=daqDA_FES_storeFile(RESULT_FILE,FILE_ID);\n if (status) {\n status = -2;\n }\n \n SendToAmoreDB(calibCE,runNb);\n \n return status;\n}\n\nvoid *processEventBuffer(void *arg)\n{\n \/\/\n \/\/ event procssing thread functio\n \/\/\n\n \/\/cast argument\n AliTPCCalibCE *ce=(AliTPCCalibCE*)arg;\n AliTPCCalibCE &calibCE=*ce;\n\n size_t counter=0;\n unsigned long32 runNb=0;\n Bool_t published=kTRUE;\n struct timespec duree_out;\n \n struct eventHeaderStruct *event;\n\n \/\/wait for the first buffer to be filled\n while (!eventBuffer[0]) nanosleep(&duree_nanosleep,&duree_out);\n \/\/loop over buffer\n while (!bStop){\n\/\/ printf(\"testing buffer: %d\\n\",counter);\n if (eventBuffer[counter]) {\n event=eventBuffer[counter];\n runNb = event->eventRunNb;\n\/\/ printf(\"processing buffer: %d\\n\",counter);\n eventBuffer[counter]=0;\n calibCE.ProcessEvent(event);\n free(event);\n published=kFALSE;\n } else {\n \/\/in case of empty buffer publish the results it this was not done\n if (!published) {\n SendToAmoreDB(calibCE,runNb);\n published=kTRUE;\n }\n nanosleep(&duree_nanosleep,&duree_out);\n }\n ++counter;\n if (counter >= eventBuffer.size()) {\n counter=0;\n if (forceBufferEnds) break;\n }\n }\n}\n\nvoid SendToAmoreDB(AliTPCCalibCE &calibCE, unsigned long32 runNb)\n{\n \/\/AMORE\n printf (\"AMORE part\\n\");\n const char *amoreDANameorig=gSystem->Getenv(\"AMORE_DA_NAME\");\n \/\/cheet a little -- temporary solution (hopefully)\n \/\/\n \/\/currently amoreDA uses the environment variable AMORE_DA_NAME to create the mysql\n \/\/table in which the calib objects are stored. This table is dropped each time AmoreDA\n \/\/is initialised. This of course makes a problem if we would like to store different\n \/\/calibration entries in the AMORE DB. Therefore in each DA which writes to the AMORE DB\n \/\/the AMORE_DA_NAME env variable is overwritten.\n gSystem->Setenv(\"AMORE_DA_NAME\",Form(\"TPC-%s\",FILE_ID));\n \/\/\n \/\/ end cheet\n TGraph *grA=calibCE.MakeGraphTimeCE(-1,0,2);\n TGraph *grC=calibCE.MakeGraphTimeCE(-2,0,2);\n TDatime time;\n TObjString info(Form(\"Run: %u; Date: %s\",runNb,time.AsSQLString()));\n amore::da::AmoreDA amoreDA(amore::da::AmoreDA::kSender);\n Int_t statusDA=0;\n statusDA+=amoreDA.Send(\"CET0\",calibCE.GetCalPadT0());\n statusDA+=amoreDA.Send(\"CEQ\",calibCE.GetCalPadQ());\n statusDA+=amoreDA.Send(\"CERMS\",calibCE.GetCalPadRMS());\n statusDA+=amoreDA.Send(\"DriftA\",grA);\n statusDA+=amoreDA.Send(\"DriftC\",grC);\n statusDA+=amoreDA.Send(\"Info\",&info);\n if ( statusDA!=0 )\n printf(\"Waring: Failed to write one of the calib objects to the AMORE database\\n\");\n \/\/ reset env var\n if (amoreDANameorig) gSystem->Setenv(\"AMORE_DA_NAME\",amoreDANameorig);\n if (grA) delete grA;\n if (grC) delete grC;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <QFileDialog>\n#include <QMessageBox>\n#include \"..\/QSCPIDev\/qserial.h\"\n#include \"configui.h\"\n#include \"ui_configui.h\"\n\nConfigUI::ConfigUI(QWidget *parent) :\n QDialog(parent),\n config(),\n ui(new Ui::ConfigUI)\n{\n ui->setupUi(this);\n QStringList ports = QSerial::list();\n ui->eurothermPortComboBox->addItems(ports);\n ui->hp34970PortComboBox->addItems(ports);\n ui->msdpPortComboBox->addItems(ports);\n ui->ps6220PortComboBox->addItems(ports);\n\n ui->dataDirLineEdit->setText(config.dataDir());\n ui->eurothermPortComboBox->setEditText(config.eurothermPort());\n ui->eurothermSleaveSpinBox->setValue(config.eurothermSlave());\n ui->hp34970PortComboBox->setEditText(config.hp34970Port());\n ui->msdpPortComboBox->setEditText(config.msdpPort());\n ui->ps6220PortComboBox->setEditText(config.ps6220Port());\n\n ui->devicesTableWidget->setVisible(false);\n QSize s(size());\n s.setHeight(0);\n resize(s);\n}\n\nConfigUI::~ConfigUI()\n{\n delete ui;\n}\n\nvoid ConfigUI::accept()\n{\n QDir dataDir(ui->dataDirLineEdit->text());\n\n if (!dataDir.exists()) {\n QString msg(\"Directory: \\\"\" + dataDir.path() +\n \"\\\"\\ndoes not exists.\\nCreate this directory?\");\n if (QMessageBox::Yes != QMessageBox::question(\n this, \"Create data storage directory?\", msg,\n QMessageBox::Yes | QMessageBox::No)) {\n return;\n }\n if (!dataDir.mkpath(\".\")) {\n msg = \"Failed to create directory: \\\"\" + dataDir.path() + \"\\\"\";\n QMessageBox::critical(this, \"Failed to create directory.\", msg);\n return;\n }\n }\n\n config.setDataDir(dataDir.path());\n config.setEurothermPort(ui->eurothermPortComboBox->currentText());\n config.setEurothermSlave(ui->eurothermSleaveSpinBox->value());\n config.setHp34970Port(ui->hp34970PortComboBox->currentText());\n config.setMsdpPort(ui->msdpPortComboBox->currentText());\n config.setPs6220Port(ui->ps6220PortComboBox->currentText());\n\n QDialog::accept();\n}\n\nvoid ConfigUI::on_dataDirToolButton_clicked()\n{\n QString dirName = QFileDialog::getExistingDirectory(\n this, \"Directory to store experiment progress logs.\");\n if (dirName.isEmpty())\n return;\n\n ui->dataDirLineEdit->setText(dirName);\n}\n\nvoid ConfigUI::on_detectPushButton_clicked()\n{\n ui->detectPushButton->setVisible(false);\n ui->devicesTableWidget->setVisible(true);\n\n on_detectPushButton_clicked();\n}\n\nvoid ConfigUI::on_devicesRefreshToolButton_clicked()\n{\n ui->devicesTableWidget->setRowCount(0);\n const QSerialPortProbe::DeviceList &devices = probe.list();\n ui->devicesTableWidget->setRowCount(devices.size());\n\n int row(0);\n for (QSerialPortProbe::DeviceList::ConstIterator i(devices.begin());\n i != devices.end();\n ++i) {\n QTableWidgetItem *item;\n\n item = new QTableWidgetItem(i->port());\n ui->devicesTableWidget->setItem(row, 0, item);\n\n item = new QTableWidgetItem(i->protocolString());\n ui->devicesTableWidget->setItem(row, 1, item);\n\n item = new QTableWidgetItem(i->deviceName());\n ui->devicesTableWidget->setItem(row, 2, item);\n ++row;\n }\n}\n<commit_msg>simlify device listing<commit_after>#include <QFileDialog>\n#include <QMessageBox>\n#include \"..\/QSCPIDev\/qserial.h\"\n#include \"configui.h\"\n#include \"ui_configui.h\"\n\nConfigUI::ConfigUI(QWidget *parent) :\n QDialog(parent),\n config(),\n ui(new Ui::ConfigUI)\n{\n ui->setupUi(this);\n QStringList ports = QSerial::list();\n ui->eurothermPortComboBox->addItems(ports);\n ui->hp34970PortComboBox->addItems(ports);\n ui->msdpPortComboBox->addItems(ports);\n ui->ps6220PortComboBox->addItems(ports);\n\n ui->dataDirLineEdit->setText(config.dataDir());\n ui->eurothermPortComboBox->setEditText(config.eurothermPort());\n ui->eurothermSleaveSpinBox->setValue(config.eurothermSlave());\n ui->hp34970PortComboBox->setEditText(config.hp34970Port());\n ui->msdpPortComboBox->setEditText(config.msdpPort());\n ui->ps6220PortComboBox->setEditText(config.ps6220Port());\n\n ui->devicesTableWidget->setVisible(false);\n QSize s(size());\n s.setHeight(0);\n resize(s);\n}\n\nConfigUI::~ConfigUI()\n{\n delete ui;\n}\n\nvoid ConfigUI::accept()\n{\n QDir dataDir(ui->dataDirLineEdit->text());\n\n if (!dataDir.exists()) {\n QString msg(\"Directory: \\\"\" + dataDir.path() +\n \"\\\"\\ndoes not exists.\\nCreate this directory?\");\n if (QMessageBox::Yes != QMessageBox::question(\n this, \"Create data storage directory?\", msg,\n QMessageBox::Yes | QMessageBox::No)) {\n return;\n }\n if (!dataDir.mkpath(\".\")) {\n msg = \"Failed to create directory: \\\"\" + dataDir.path() + \"\\\"\";\n QMessageBox::critical(this, \"Failed to create directory.\", msg);\n return;\n }\n }\n\n config.setDataDir(dataDir.path());\n config.setEurothermPort(ui->eurothermPortComboBox->currentText());\n config.setEurothermSlave(ui->eurothermSleaveSpinBox->value());\n config.setHp34970Port(ui->hp34970PortComboBox->currentText());\n config.setMsdpPort(ui->msdpPortComboBox->currentText());\n config.setPs6220Port(ui->ps6220PortComboBox->currentText());\n\n QDialog::accept();\n}\n\nvoid ConfigUI::on_dataDirToolButton_clicked()\n{\n QString dirName = QFileDialog::getExistingDirectory(\n this, \"Directory to store experiment progress logs.\");\n if (dirName.isEmpty())\n return;\n\n ui->dataDirLineEdit->setText(dirName);\n}\n\nvoid ConfigUI::on_detectPushButton_clicked()\n{\n ui->detectPushButton->setVisible(false);\n ui->devicesTableWidget->setVisible(true);\n\n on_detectPushButton_clicked();\n}\n\nvoid ConfigUI::on_devicesRefreshToolButton_clicked()\n{\n ui->devicesTableWidget->setRowCount(0);\n const QSerialPortProbe::DeviceList &devices = probe.list();\n ui->devicesTableWidget->setRowCount(devices.size());\n\n for (int row(0); row < devices.size(); ++row) {\n const QSerialPortProbe::Device &device(devices[row]);\n QTableWidgetItem *item;\n\n item = new QTableWidgetItem(device.port());\n ui->devicesTableWidget->setItem(row, 0, item);\n\n item = new QTableWidgetItem(device.protocolString());\n ui->devicesTableWidget->setItem(row, 1, item);\n\n item = new QTableWidgetItem(device.deviceName());\n ui->devicesTableWidget->setItem(row, 2, item);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QVariant>\n#include <QSqlError>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/notification\/objects\/command.hh\"\n#include \"com\/centreon\/broker\/notification\/loaders\/command_loader.hh\"\n\nusing namespace com::centreon::broker::notification;\nusing namespace com::centreon::broker::notification::objects;\n\ncommand_loader::command_loader() {}\n\n\/**\n * Load the commands from the database.\n *\n * @param[in] db An open connection to the database.\n * @param[out] output A command builder object to register the commands.\n *\/\nvoid command_loader::load(QSqlDatabase* db, command_builder* output) {\n \/\/ If we don't have any db or output, don't do anything.\n if (!db || !output)\n return;\n\n logging::debug(logging::medium)\n << \"notification: loading commands from the database\";\n\n QSqlQuery query(*db);\n\n \/\/ Performance improvement, as we never go back.\n query.setForwardOnly(true);\n\n \/\/ Load the commands\n if (!query.exec(\"SELECT command_id, connector_id, command_name, command_line,\"\n \" command_example, command_type, enable_shell,\"\n \" command_comment, graph_id, cmd_cat_id\"\n \" FROM cfg_commands\"))\n throw (exceptions::msg()\n << \"notification: cannot load commands from database: \"\n << query.lastError().text());\n\n while (query.next()) {\n unsigned int id = query.value(0).toUInt();\n std::string base_command = query.value(3).toString().toStdString();\n command::ptr com(new command(base_command));\n com->set_name(query.value(2).toString().toStdString());\n\n output->add_command(id, com);\n }\n}\n<commit_msg>notification: do not read non-existent properties of cfg_commands.<commit_after>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QVariant>\n#include <QSqlError>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/notification\/objects\/command.hh\"\n#include \"com\/centreon\/broker\/notification\/loaders\/command_loader.hh\"\n\nusing namespace com::centreon::broker::notification;\nusing namespace com::centreon::broker::notification::objects;\n\ncommand_loader::command_loader() {}\n\n\/**\n * Load the commands from the database.\n *\n * @param[in] db An open connection to the database.\n * @param[out] output A command builder object to register the commands.\n *\/\nvoid command_loader::load(QSqlDatabase* db, command_builder* output) {\n \/\/ If we don't have any db or output, don't do anything.\n if (!db || !output)\n return;\n\n logging::debug(logging::medium)\n << \"notification: loading commands from the database\";\n\n QSqlQuery query(*db);\n\n \/\/ Performance improvement, as we never go back.\n query.setForwardOnly(true);\n\n \/\/ Load the commands\n if (!query.exec(\"SELECT command_id, connector_id, command_name, command_line,\"\n \" command_type, enable_shell\"\n \" FROM cfg_commands\"))\n throw (exceptions::msg()\n << \"notification: cannot load commands from database: \"\n << query.lastError().text());\n\n while (query.next()) {\n unsigned int id = query.value(0).toUInt();\n std::string base_command = query.value(3).toString().toStdString();\n command::ptr com(new command(base_command));\n com->set_name(query.value(2).toString().toStdString());\n\n output->add_command(id, com);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: lngprops.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2004-11-27 13:19:32 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _LINGUISTIC_LNGPROPS_HHX_\n#define _LINGUISTIC_LNGPROPS_HHX_\n\n#ifndef _SVTOOLS_LINGUPROPS_HXX_\n#include <svtools\/linguprops.hxx>\n#endif\n\n\/\/ maximal number of suggestions to be returned in spelling context-menu\n\/\/ (may not include results added by looking up user dictionaries)\n#define UPN_MAX_NUMBER_OF_SUGGESTIONS \"MaxNumberOfSuggestions\"\n\n\/\/ WIDs for property names\n\/\/!! Don't change values! They are used as the property handles in\n\/\/!! the service description\n#define WID_IS_GERMAN_PRE_REFORM UPH_IS_GERMAN_PRE_REFORM\n#define WID_IS_USE_DICTIONARY_LIST UPH_IS_USE_DICTIONARY_LIST\n#define WID_IS_IGNORE_CONTROL_CHARACTERS UPH_IS_IGNORE_CONTROL_CHARACTERS\n#define WID_IS_SPELL_UPPER_CASE UPH_IS_SPELL_UPPER_CASE\n#define WID_IS_SPELL_WITH_DIGITS UPH_IS_SPELL_WITH_DIGITS\n#define WID_IS_SPELL_CAPITALIZATION UPH_IS_SPELL_CAPITALIZATION\n#define WID_HYPH_MIN_LEADING UPH_HYPH_MIN_LEADING\n#define WID_HYPH_MIN_TRAILING UPH_HYPH_MIN_TRAILING\n#define WID_HYPH_MIN_WORD_LENGTH UPH_HYPH_MIN_WORD_LENGTH\n#define WID_DEFAULT_LOCALE UPH_DEFAULT_LOCALE\n#define WID_IS_SPELL_AUTO UPH_IS_SPELL_AUTO\n#define WID_IS_SPELL_HIDE UPH_IS_SPELL_HIDE\n#define WID_IS_SPELL_IN_ALL_LANGUAGES UPH_IS_SPELL_IN_ALL_LANGUAGES\n#define WID_IS_SPELL_SPECIAL UPH_IS_SPELL_SPECIAL\n#define WID_IS_HYPH_AUTO UPH_IS_HYPH_AUTO\n#define WID_IS_HYPH_SPECIAL UPH_IS_HYPH_SPECIAL\n#define WID_IS_WRAP_REVERSE UPH_IS_WRAP_REVERSE\n#define WID_DEFAULT_LANGUAGE UPH_DEFAULT_LANGUAGE\n#define WID_DEFAULT_LOCALE_CJK UPH_DEFAULT_LOCALE_CJK\n#define WID_DEFAULT_LOCALE_CTL UPH_DEFAULT_LOCALE_CTL\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.24); FILE MERGED 2005\/09\/05 17:29:31 rt 1.5.24.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: lngprops.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 19:46:35 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _LINGUISTIC_LNGPROPS_HHX_\n#define _LINGUISTIC_LNGPROPS_HHX_\n\n#ifndef _SVTOOLS_LINGUPROPS_HXX_\n#include <svtools\/linguprops.hxx>\n#endif\n\n\/\/ maximal number of suggestions to be returned in spelling context-menu\n\/\/ (may not include results added by looking up user dictionaries)\n#define UPN_MAX_NUMBER_OF_SUGGESTIONS \"MaxNumberOfSuggestions\"\n\n\/\/ WIDs for property names\n\/\/!! Don't change values! They are used as the property handles in\n\/\/!! the service description\n#define WID_IS_GERMAN_PRE_REFORM UPH_IS_GERMAN_PRE_REFORM\n#define WID_IS_USE_DICTIONARY_LIST UPH_IS_USE_DICTIONARY_LIST\n#define WID_IS_IGNORE_CONTROL_CHARACTERS UPH_IS_IGNORE_CONTROL_CHARACTERS\n#define WID_IS_SPELL_UPPER_CASE UPH_IS_SPELL_UPPER_CASE\n#define WID_IS_SPELL_WITH_DIGITS UPH_IS_SPELL_WITH_DIGITS\n#define WID_IS_SPELL_CAPITALIZATION UPH_IS_SPELL_CAPITALIZATION\n#define WID_HYPH_MIN_LEADING UPH_HYPH_MIN_LEADING\n#define WID_HYPH_MIN_TRAILING UPH_HYPH_MIN_TRAILING\n#define WID_HYPH_MIN_WORD_LENGTH UPH_HYPH_MIN_WORD_LENGTH\n#define WID_DEFAULT_LOCALE UPH_DEFAULT_LOCALE\n#define WID_IS_SPELL_AUTO UPH_IS_SPELL_AUTO\n#define WID_IS_SPELL_HIDE UPH_IS_SPELL_HIDE\n#define WID_IS_SPELL_IN_ALL_LANGUAGES UPH_IS_SPELL_IN_ALL_LANGUAGES\n#define WID_IS_SPELL_SPECIAL UPH_IS_SPELL_SPECIAL\n#define WID_IS_HYPH_AUTO UPH_IS_HYPH_AUTO\n#define WID_IS_HYPH_SPECIAL UPH_IS_HYPH_SPECIAL\n#define WID_IS_WRAP_REVERSE UPH_IS_WRAP_REVERSE\n#define WID_DEFAULT_LANGUAGE UPH_DEFAULT_LANGUAGE\n#define WID_DEFAULT_LOCALE_CJK UPH_DEFAULT_LOCALE_CJK\n#define WID_DEFAULT_LOCALE_CTL UPH_DEFAULT_LOCALE_CTL\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#include \"karabiner_virtual_hid_device_methods.hpp\"\n#include <CoreFoundation\/CoreFoundation.h>\n#include <IOKit\/IOKitLib.h>\n#include <IOKit\/hid\/IOHIDDevice.h>\n#include <IOKit\/hid\/IOHIDElement.h>\n#include <IOKit\/hid\/IOHIDManager.h>\n#include <IOKit\/hid\/IOHIDQueue.h>\n#include <IOKit\/hid\/IOHIDValue.h>\n#include <IOKit\/hidsystem\/IOHIDLib.h>\n#include <IOKit\/hidsystem\/IOHIDShared.h>\n#include <IOKit\/hidsystem\/ev_keymap.h>\n#include <SystemConfiguration\/SystemConfiguration.h>\n#include <cmath>\n#include <iostream>\n#include <thread>\n\nint main(int argc, const char* argv[]) {\n if (getuid() != 0) {\n std::cerr << \"modifier_flag_manipulate_example requires root privilege.\" << std::endl;\n }\n\n kern_return_t kr;\n io_connect_t connect = IO_OBJECT_NULL;\n auto service = IOServiceGetMatchingService(kIOMasterPortDefault, IOServiceNameMatching(pqrs::karabiner_virtual_hid_device::get_virtual_hid_root_name()));\n if (!service) {\n std::cerr << \"IOServiceGetMatchingService error\" << std::endl;\n goto finish;\n }\n\n kr = IOServiceOpen(service, mach_task_self(), kIOHIDServerConnectType, &connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOServiceOpen error\" << std::endl;\n goto finish;\n }\n\n kr = pqrs::karabiner_virtual_hid_device_methods::initialize_virtual_hid_keyboard(connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"initialize_virtual_hid_keyboard error\" << std::endl;\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(500));\n\n {\n std::cout << \"left control by virtual_hid_keyboard (3 seconds)\" << std::endl;\n\n pqrs::karabiner_virtual_hid_device::hid_report::keyboard_input report;\n report.modifiers = 0x01;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::post_keyboard_input_report(connect, report);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"post_keyboard_input_report error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n }\n\n {\n std::cout << \"left control by VirtualHIDEventService (3 seconds)\" << std::endl;\n\n pqrs::karabiner_virtual_hid_device::hid_event_service::keyboard_event keyboard_event;\n keyboard_event.usage = kHIDUsage_KeyboardRightControl;\n keyboard_event.value = 1;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::dispatch_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"dispatch_keyboard_event error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n keyboard_event.value = 0;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::dispatch_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"dispatch_keyboard_event error\" << std::endl;\n }\n }\n\n {\n std::cout << \"left control by post_keyboard_event (3 seconds)\" << std::endl;\n\n pqrs::karabiner_virtual_hid_device::keyboard_event keyboard_event;\n keyboard_event.event_type = pqrs::karabiner_virtual_hid_device::event_type::flags_changed;\n keyboard_event.key = 0x3b;\n keyboard_event.flags = 0x40001;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::post_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"post_keyboard_event error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n keyboard_event.flags = 0;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::post_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"post_keyboard_event error\" << std::endl;\n }\n }\n\n {\n std::cout << \"left control by IOHIDPostEvent (3 seconds)\" << std::endl;\n\n uid_t uid;\n if (auto user_name = SCDynamicStoreCopyConsoleUser(nullptr, &uid, nullptr)) {\n CFRelease(user_name);\n\n setuid(uid);\n\n if (auto hid_system = IOServiceGetMatchingService(kIOMasterPortDefault, IOServiceNameMatching(kIOHIDSystemClass))) {\n io_connect_t hid_system_connect = IO_OBJECT_NULL;\n kr = IOServiceOpen(hid_system, mach_task_self(), kIOHIDParamConnectType, &hid_system_connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOServiceOpen error\" << std::endl;\n } else {\n IOGPoint location{};\n NXEventData event_data{};\n event_data.key.keyCode = 0x3b;\n uint32_t event_data_version = kNXEventDataVersion;\n IOOptionBits event_flags = 0x40001;\n IOOptionBits options = kIOHIDSetGlobalEventFlags;\n\n kr = IOHIDPostEvent(hid_system_connect, NX_FLAGSCHANGED, location, &event_data, event_data_version, event_flags, options);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOHIDPostEvent error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n event_flags = 0;\n\n kr = IOHIDPostEvent(hid_system_connect, NX_FLAGSCHANGED, location, &event_data, event_data_version, event_flags, options);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOHIDPostEvent error\" << std::endl;\n }\n }\n }\n }\n }\n\n kr = pqrs::karabiner_virtual_hid_device_methods::terminate_virtual_hid_keyboard(connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"terminate_virtual_hid_keyboard error\" << std::endl;\n }\n\nfinish:\n if (connect) {\n IOServiceClose(connect);\n }\n if (service) {\n IOObjectRelease(service);\n }\n\n return 0;\n}\n<commit_msg>fix modifier_flag_manipulate_example<commit_after>#include \"karabiner_virtual_hid_device_methods.hpp\"\n#include <CoreFoundation\/CoreFoundation.h>\n#include <IOKit\/IOKitLib.h>\n#include <IOKit\/hid\/IOHIDDevice.h>\n#include <IOKit\/hid\/IOHIDElement.h>\n#include <IOKit\/hid\/IOHIDManager.h>\n#include <IOKit\/hid\/IOHIDQueue.h>\n#include <IOKit\/hid\/IOHIDValue.h>\n#include <IOKit\/hidsystem\/IOHIDLib.h>\n#include <IOKit\/hidsystem\/IOHIDShared.h>\n#include <IOKit\/hidsystem\/ev_keymap.h>\n#include <SystemConfiguration\/SystemConfiguration.h>\n#include <cmath>\n#include <iostream>\n#include <thread>\n\nint main(int argc, const char* argv[]) {\n if (getuid() != 0) {\n std::cerr << \"modifier_flag_manipulate_example requires root privilege.\" << std::endl;\n }\n\n kern_return_t kr;\n io_connect_t connect = IO_OBJECT_NULL;\n auto service = IOServiceGetMatchingService(kIOMasterPortDefault, IOServiceNameMatching(pqrs::karabiner_virtual_hid_device::get_virtual_hid_root_name()));\n if (!service) {\n std::cerr << \"IOServiceGetMatchingService error\" << std::endl;\n goto finish;\n }\n\n kr = IOServiceOpen(service, mach_task_self(), kIOHIDServerConnectType, &connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOServiceOpen error\" << std::endl;\n goto finish;\n }\n\n kr = pqrs::karabiner_virtual_hid_device_methods::initialize_virtual_hid_keyboard(connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"initialize_virtual_hid_keyboard error\" << std::endl;\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(500));\n\n {\n std::cout << \"left control by dispatch_keyboard_event (3 seconds)\" << std::endl;\n\n pqrs::karabiner_virtual_hid_device::hid_event_service::keyboard_event keyboard_event;\n keyboard_event.usage = kHIDUsage_KeyboardLeftControl;\n keyboard_event.value = 1;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::dispatch_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"dispatch_keyboard_event error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n keyboard_event.value = 0;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::dispatch_keyboard_event(connect, keyboard_event);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"dispatch_keyboard_event error\" << std::endl;\n }\n }\n\n {\n std::cout << \"left control by post_keyboard_input_report (3 seconds)\" << std::endl;\n\n pqrs::karabiner_virtual_hid_device::hid_report::keyboard_input report;\n report.modifiers = 0x01;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::post_keyboard_input_report(connect, report);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"post_keyboard_input_report error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n report.modifiers = 0;\n\n kr = pqrs::karabiner_virtual_hid_device_methods::post_keyboard_input_report(connect, report);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"post_keyboard_input_report error\" << std::endl;\n }\n }\n\n {\n std::cout << \"left control by IOHIDPostEvent (3 seconds)\" << std::endl;\n\n uid_t uid;\n if (auto user_name = SCDynamicStoreCopyConsoleUser(nullptr, &uid, nullptr)) {\n CFRelease(user_name);\n\n setuid(uid);\n\n if (auto hid_system = IOServiceGetMatchingService(kIOMasterPortDefault, IOServiceNameMatching(kIOHIDSystemClass))) {\n io_connect_t hid_system_connect = IO_OBJECT_NULL;\n kr = IOServiceOpen(hid_system, mach_task_self(), kIOHIDParamConnectType, &hid_system_connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOServiceOpen error\" << std::endl;\n } else {\n IOGPoint location{};\n NXEventData event_data{};\n event_data.key.keyCode = 0x3b;\n uint32_t event_data_version = kNXEventDataVersion;\n IOOptionBits event_flags = 0x40001;\n IOOptionBits options = kIOHIDSetGlobalEventFlags;\n\n kr = IOHIDPostEvent(hid_system_connect, NX_FLAGSCHANGED, location, &event_data, event_data_version, event_flags, options);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOHIDPostEvent error\" << std::endl;\n }\n\n for (int i = 0; i < 3; ++i) {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n std::cout << (i + 1) << std::endl;\n }\n\n event_flags = 0;\n\n kr = IOHIDPostEvent(hid_system_connect, NX_FLAGSCHANGED, location, &event_data, event_data_version, event_flags, options);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"IOHIDPostEvent error\" << std::endl;\n }\n }\n }\n }\n }\n\n kr = pqrs::karabiner_virtual_hid_device_methods::terminate_virtual_hid_keyboard(connect);\n if (kr != KERN_SUCCESS) {\n std::cerr << \"terminate_virtual_hid_keyboard error\" << std::endl;\n }\n\nfinish:\n if (connect) {\n IOServiceClose(connect);\n }\n if (service) {\n IOObjectRelease(service);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"iteration\/initializer\/initialize_fixed_terms_once.h\"\n\n#include <array>\n\n#include \"system\/system.h\"\n#include \"formulation\/updater\/tests\/fixed_updater_mock.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/test_helper_functions.h\"\n\nnamespace {\n\nusing namespace bart;\n\nusing ::testing::NiceMock, ::testing::Ref, ::testing::Return;\n\nclass IterationInitializerInitializeFixedTermsOnceTest : public ::testing::Test {\n protected:\n using InitializerType = iteration::initializer::InitializeFixedTermsOnce;\n using MockFixedUpdaterType = formulation::updater::FixedUpdaterMock;\n\n IterationInitializerInitializeFixedTermsOnceTest()\n : total_groups_(test_helpers::RandomDouble(1, 5)),\n total_angles_(test_helpers::RandomDouble(1, 5)) {}\n\n \/\/ Initializer to be tested\n std::unique_ptr<InitializerType> test_initializer_;\n\n \/\/ Supporting objects\n system::System test_system_;\n\n \/\/ Pointers for observing mocks owned by other objects\n MockFixedUpdaterType* updater_obs_ptr_ = nullptr;\n\n \/\/ Random values for testing\n const int total_groups_;\n const int total_angles_;\n\n void SetUp() override;\n};\n\nvoid IterationInitializerInitializeFixedTermsOnceTest::SetUp() {\n \/\/ Set up testing object\n auto mock_fixed_updater_ptr =\n std::make_unique<MockFixedUpdaterType>();\n updater_obs_ptr_ = mock_fixed_updater_ptr.get();\n\n test_initializer_ =\n std::make_unique<InitializerType>(std::move(mock_fixed_updater_ptr),\n total_groups_,\n total_angles_);\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, Constructor) {\n EXPECT_TRUE(updater_obs_ptr_ != nullptr);\n EXPECT_EQ(test_initializer_->total_angles(), total_angles_);\n EXPECT_EQ(test_initializer_->total_groups(), total_groups_);\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, ConstructorThrows) {\n \/\/ Constructor should throw if fixed updater ptr is null\n std::unique_ptr<MockFixedUpdaterType> null_fixed_updater = nullptr;\n EXPECT_ANY_THROW(InitializerType initializer(std::move(null_fixed_updater),\n total_groups_, total_angles_););\n\n \/\/ Constructor should throw for bad groups and angle values\n std::array<int, 2> bad_values = {0, -1};\n\n for (int value : bad_values) {\n auto fixed_updater = std::make_unique<MockFixedUpdaterType>();\n EXPECT_ANY_THROW(InitializerType initializer(std::move(fixed_updater),\n value, total_angles_););\n fixed_updater = std::make_unique<MockFixedUpdaterType>();\n EXPECT_ANY_THROW(InitializerType initializer(std::move(fixed_updater),\n total_groups_, value););\n }\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, Initialize) {\n \/\/ Initializer should access all left hand side terms (all groups\/angles)\n for (int group = 0; group < total_groups_; ++group) {\n for (int angle = 0; angle < total_angles_; ++angle) {\n system::EnergyGroup energy_group(group);\n quadrature::QuadraturePointIndex angle_index(angle);\n EXPECT_CALL(*updater_obs_ptr_, UpdateFixedTerms(Ref(test_system_),\n energy_group,\n angle_index));\n }\n }\n EXPECT_FALSE(test_initializer_->initialize_was_called());\n test_initializer_->Initialize(test_system_);\n\n \/\/ Initialize shouldn't do anything because initialize has been called\n EXPECT_TRUE(test_initializer_->initialize_was_called());\n test_initializer_->Initialize(test_system_);\n\n \/\/ Reset status of initialize called\n test_initializer_->set_initialize_was_called(false);\n for (int group = 0; group < total_groups_; ++group) {\n for (int angle = 0; angle < total_angles_; ++angle) {\n system::EnergyGroup energy_group(group);\n quadrature::QuadraturePointIndex angle_index(angle);\n EXPECT_CALL(*updater_obs_ptr_, UpdateFixedTerms(Ref(test_system_),\n energy_group,\n angle_index));\n }\n }\n test_initializer_->Initialize(test_system_);\n}\n\n} \/\/ namespace<commit_msg>removed extra EXPECT_CALL statements from tests<commit_after>#include \"iteration\/initializer\/initialize_fixed_terms_once.h\"\n\n#include <array>\n\n#include \"system\/system.h\"\n#include \"formulation\/updater\/tests\/fixed_updater_mock.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/test_helper_functions.h\"\n\nnamespace {\n\nusing namespace bart;\n\nusing ::testing::NiceMock, ::testing::Ref, ::testing::Return;\n\nclass IterationInitializerInitializeFixedTermsOnceTest : public ::testing::Test {\n protected:\n using InitializerType = iteration::initializer::InitializeFixedTermsOnce;\n using MockFixedUpdaterType = formulation::updater::FixedUpdaterMock;\n\n IterationInitializerInitializeFixedTermsOnceTest()\n : total_groups_(test_helpers::RandomDouble(1, 5)),\n total_angles_(test_helpers::RandomDouble(1, 5)) {}\n\n \/\/ Initializer to be tested\n std::unique_ptr<InitializerType> test_initializer_;\n\n \/\/ Supporting objects\n system::System test_system_;\n\n \/\/ Pointers for observing mocks owned by other objects\n MockFixedUpdaterType* updater_obs_ptr_ = nullptr;\n\n \/\/ Random values for testing\n const int total_groups_;\n const int total_angles_;\n\n void SetUp() override;\n};\n\nvoid IterationInitializerInitializeFixedTermsOnceTest::SetUp() {\n \/\/ Set up testing object\n auto mock_fixed_updater_ptr =\n std::make_unique<MockFixedUpdaterType>();\n updater_obs_ptr_ = mock_fixed_updater_ptr.get();\n\n test_initializer_ =\n std::make_unique<InitializerType>(std::move(mock_fixed_updater_ptr),\n total_groups_,\n total_angles_);\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, Constructor) {\n EXPECT_TRUE(updater_obs_ptr_ != nullptr);\n EXPECT_EQ(test_initializer_->total_angles(), total_angles_);\n EXPECT_EQ(test_initializer_->total_groups(), total_groups_);\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, ConstructorThrows) {\n \/\/ Constructor should throw if fixed updater ptr is null\n std::unique_ptr<MockFixedUpdaterType> null_fixed_updater = nullptr;\n EXPECT_ANY_THROW(InitializerType initializer(std::move(null_fixed_updater),\n total_groups_, total_angles_););\n\n \/\/ Constructor should throw for bad groups and angle values\n std::array<int, 2> bad_values = {0, -1};\n\n for (int value : bad_values) {\n auto fixed_updater = std::make_unique<MockFixedUpdaterType>();\n EXPECT_ANY_THROW(InitializerType initializer(std::move(fixed_updater),\n value, total_angles_););\n fixed_updater = std::make_unique<MockFixedUpdaterType>();\n EXPECT_ANY_THROW(InitializerType initializer(std::move(fixed_updater),\n total_groups_, value););\n }\n}\n\nTEST_F(IterationInitializerInitializeFixedTermsOnceTest, Initialize) {\n \/\/ Initializer should access all left hand side terms (all groups\/angles)\n \/\/ This will run only twice despite us calling it three times.\n for (int group = 0; group < total_groups_; ++group) {\n for (int angle = 0; angle < total_angles_; ++angle) {\n system::EnergyGroup energy_group(group);\n quadrature::QuadraturePointIndex angle_index(angle);\n EXPECT_CALL(*updater_obs_ptr_, UpdateFixedTerms(Ref(test_system_),\n energy_group,\n angle_index))\n .Times(2);\n }\n }\n EXPECT_FALSE(test_initializer_->initialize_was_called());\n test_initializer_->Initialize(test_system_);\n\n \/\/ Initialize shouldn't do anything because initialize has been called\n EXPECT_TRUE(test_initializer_->initialize_was_called());\n test_initializer_->Initialize(test_system_);\n\n \/\/ Reset status of initialize called\n test_initializer_->set_initialize_was_called(false);\n test_initializer_->Initialize(test_system_);\n EXPECT_TRUE(test_initializer_->initialize_was_called());\n}\n\n} \/\/ namespace<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\r\n#include \"CtrlrSlider.h\"\r\n#include \"CtrlrProcessor.h\"\r\n#include \"..\/CtrlrComponentTypeManager.h\"\r\n#include \"CtrlrPanel\/CtrlrPanelEditor.h\"\r\n#include \"CtrlrModulator\/CtrlrModulator.h\"\r\n#include \"Lua\/JuceClasses\/LLookAndFeel.h\"\r\n\r\nCtrlrSlider::CtrlrSlider (CtrlrModulator &owner)\r\n :\tCtrlrComponent(owner),\r\n\t\tlf(*this, componentTree),\r\n\t\tctrlrSlider (*this)\r\n{\r\n\tsetColour (TooltipWindow::textColourId, Colours::red);\r\n\taddAndMakeVisible (&ctrlrSlider);\r\n\r\n ctrlrSlider.setRange (1, 127, 1);\r\n ctrlrSlider.setSliderStyle (Slider::RotaryVerticalDrag);\r\n ctrlrSlider.setTextBoxStyle (Slider::TextBoxBelow, false, 64, 12);\r\n ctrlrSlider.addListener (this);\r\n\tctrlrSlider.setLookAndFeel (&lf);\r\n\tcomponentTree.addListener (this);\r\n\r\n\tsetProperty (Ids::uiSliderStyle, \"RotaryVerticalDrag\");\r\n\tsetProperty (Ids::uiSliderMin, 0);\r\n\tsetProperty (Ids::uiSliderMax, 127);\r\n\tsetProperty (Ids::uiSliderInterval, 1);\r\n\tsetProperty (Ids::uiSliderDoubleClickEnabled, true);\r\n\tsetProperty (Ids::uiSliderDoubleClickValue, 0);\r\n\tsetProperty (Ids::uiSliderValuePosition, (int)Slider::TextBoxBelow);\r\n\tsetProperty (Ids::uiSliderValueHeight, 12);\r\n\tsetProperty (Ids::uiSliderValueWidth, 64);\r\n\tsetProperty (Ids::uiSliderTrackCornerSize, 5);\r\n\tsetProperty (Ids::uiSliderThumbCornerSize, 3);\r\n\tsetProperty (Ids::uiSliderThumbWidth, 0);\r\n\tsetProperty (Ids::uiSliderThumbHeight, 0);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnLeft, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnRight, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnTop, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnBottom, false);\r\n\tsetProperty (Ids::uiSliderValueTextColour, \"0xff000000\");\r\n\tsetProperty (Ids::uiSliderValueBgColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderRotaryOutlineColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderRotaryFillColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderThumbColour, \"0xffff0000\");\r\n\tsetProperty (Ids::uiSliderValueHighlightColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderValueOutlineColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderTrackColour, \"0xff0f0f0f\");\r\n\tsetProperty (Ids::uiSliderIncDecButtonColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderIncDecTextColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderValueFont, FONT2STR (Font(12)));\r\n\tsetProperty (Ids::uiSliderValueTextJustification, \"centred\");\r\n\tsetProperty (Ids::uiSliderVelocitySensitivity, 1.0);\r\n\tsetProperty (Ids::uiSliderVelocityThreshold, 1);\r\n\tsetProperty (Ids::uiSliderVelocityOffset, 0.0);\r\n\tsetProperty (Ids::uiSliderVelocityMode, false);\r\n\tsetProperty (Ids::uiSliderVelocityModeKeyTrigger, true);\r\n\tsetProperty (Ids::uiSliderSpringMode, false);\r\n\tsetProperty (Ids::uiSliderSpringValue, 0);\r\n\tsetProperty (Ids::uiSliderMouseWheelInterval, 1);\r\n\tsetProperty (Ids::uiSliderPopupBubble, false);\r\n\r\n\r\n setSize (64, 64);\r\n}\r\n\r\nCtrlrSlider::~CtrlrSlider()\r\n{\r\n\tcomponentTree.removeListener (this);\r\n}\r\n\r\nvoid CtrlrSlider::resized()\r\n{\r\n\tif (restoreStateInProgress)\r\n\t\treturn;\r\n\tctrlrSlider.setBounds (getUsableRect());\r\n}\r\n\r\nvoid CtrlrSlider::sliderValueChanged (Slider* sliderThatWasMoved)\r\n{\r\n if (sliderThatWasMoved == &ctrlrSlider)\r\n {\r\n\t\tif ((bool)owner.getOwnerPanel().getEditor()->getProperty(Ids::uiPanelEditMode) == true)\r\n\t\t\treturn;\r\n\r\n\t\tsetComponentValue (ctrlrSlider.getValue(), true);\r\n }\r\n}\r\n\r\nvoid CtrlrSlider::mouseUp (const MouseEvent& e)\r\n{\r\n\tif ((bool)getProperty(Ids::uiSliderSpringMode) == true)\r\n\t{\r\n\t\tctrlrSlider.setValue ((double)getProperty(Ids::uiSliderSpringValue), sendNotificationSync);\r\n\t}\r\n}\r\n\r\ndouble CtrlrSlider::getComponentValue()\r\n{\r\n\treturn (ctrlrSlider.getValue());\r\n}\r\n\r\nint CtrlrSlider::getComponentMidiValue()\r\n{\r\n\treturn ((int)ctrlrSlider.getValue());\r\n}\r\n\r\ndouble CtrlrSlider::getComponentMaxValue()\r\n{\r\n\treturn (ctrlrSlider.getMaximum());\r\n}\r\n\r\nvoid CtrlrSlider::setComponentValue (const double newValue, const bool sendChangeMessage)\r\n{\r\n\tctrlrSlider.setValue (newValue, dontSendNotification);\r\n\tif (sendChangeMessage)\r\n\t{\r\n\t\towner.getProcessor().setValueGeneric (CtrlrModulatorValue(newValue,CtrlrModulatorValue::changedByGUI));\r\n\t}\r\n}\r\n\r\nconst Array<Font> CtrlrSlider::getFontList()\r\n{\r\n\tArray <Font> ret;\r\n\tFont f = STR2FONT(getProperty(Ids::uiSliderValueFont));\r\n\tif (f.getTypefaceName() != Font::getDefaultSerifFontName()\r\n\t\t&& f.getTypefaceName() != Font::getDefaultSansSerifFontName()\r\n\t\t&& f.getTypefaceName() != Font::getDefaultMonospacedFontName()\r\n\t\t&& f.getTypefaceName() != \"<Sans-Serif>\")\r\n\t{\r\n\t\tret.add (f);\r\n\t}\r\n\treturn (ret);\r\n}\r\n\r\nvoid CtrlrSlider::valueTreePropertyChanged (ValueTree &treeWhosePropertyHasChanged, const Identifier &property)\r\n{\r\n\tif (property == Ids::uiSliderStyle)\r\n\t{\r\n\t\tctrlrSlider.setSliderStyle ((Slider::SliderStyle)CtrlrComponentTypeManager::sliderStringToStyle (getProperty (Ids::uiSliderStyle)));\r\n\t}\r\n\telse if (property == Ids::uiSliderRotaryFillColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::rotarySliderFillColourId, VAR2COLOUR(getProperty (Ids::uiSliderRotaryFillColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderRotaryOutlineColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::rotarySliderOutlineColourId, VAR2COLOUR(getProperty (Ids::uiSliderRotaryOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueTextColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxTextColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueTextColour)) );\r\n\t}\r\n\r\n\telse if (property == Ids::uiSliderValueBgColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxBackgroundColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueBgColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderThumbColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::thumbColourId, VAR2COLOUR(getProperty (Ids::uiSliderThumbColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueHighlightColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxHighlightColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueOutlineColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxOutlineColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderTrackColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::trackColourId, VAR2COLOUR(getProperty (Ids::uiSliderTrackColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderInterval || property == Ids::uiSliderMax || property == Ids::uiSliderMin)\r\n\t{\r\n\t\tctrlrSlider.setRange ( (double) getProperty (Ids::uiSliderMin), (double) getProperty (Ids::uiSliderMax), (double) getProperty (Ids::uiSliderInterval) );\r\n\t\towner.setProperty (Ids::modulatorMax, ctrlrSlider.getMaximum());\r\n\t\towner.setProperty (Ids::modulatorMin, ctrlrSlider.getMinimum());\r\n\t}\r\n\telse if (property == Ids::uiSliderValuePosition || property == Ids::uiSliderValueHeight || property == Ids::uiSliderValueWidth)\r\n\t{\r\n\t\tctrlrSlider.setTextBoxStyle (\r\n\t\t\t(Slider::TextEntryBoxPosition)(int)getProperty (Ids::uiSliderValuePosition),\r\n\t\t\tfalse,\r\n\t\t\tgetProperty (Ids::uiSliderValueWidth, 64),\r\n\t\t\tgetProperty (Ids::uiSliderValueHeight, 12));\r\n\t}\r\n\telse if (property == Ids::uiSliderIncDecButtonColour\r\n\t\t\t|| property == Ids::uiSliderIncDecTextColour\r\n\t\t\t|| property == Ids::uiSliderValueFont\r\n\t\t\t|| property == Ids::uiSliderValueTextJustification)\r\n\t{\r\n\t\tctrlrSlider.setLookAndFeel (nullptr);\r\n\t\tctrlrSlider.setLookAndFeel (&lf);\r\n\t}\r\n\telse if (property == Ids::uiSliderVelocityMode\r\n\t\t|| property == Ids::uiSliderVelocityModeKeyTrigger\r\n\t\t|| property == Ids::uiSliderVelocitySensitivity\r\n\t\t|| property == Ids::uiSliderVelocityThreshold\r\n\t\t|| property == Ids::uiSliderVelocityOffset\r\n\t\t)\r\n\t{\r\n\t\tctrlrSlider.setVelocityBasedMode((bool)getProperty(Ids::uiSliderVelocityMode));\r\n\t\tctrlrSlider.setVelocityModeParameters ((double)getProperty(Ids::uiSliderVelocitySensitivity),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(int)getProperty(Ids::uiSliderVelocityThreshold),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(double)getProperty(Ids::uiSliderVelocityOffset),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(bool)getProperty(Ids::uiSliderVelocityModeKeyTrigger));\r\n\t}\r\n\telse if (property == Ids::uiSliderSpringValue)\r\n\t{\r\n\t\tctrlrSlider.setValue (getProperty(property), dontSendNotification);\r\n\t}\r\n\r\n\telse if (property == Ids::uiSliderDoubleClickValue\r\n\t\t\t|| property == Ids::uiSliderDoubleClickEnabled)\r\n\t{\r\n\t\tctrlrSlider.setDoubleClickReturnValue ((bool)getProperty(Ids::uiSliderDoubleClickEnabled), getProperty(Ids::uiSliderDoubleClickValue));\r\n\t}\r\n\telse if (property == Ids::uiSliderSpringMode)\r\n\t{\r\n\t\tif ((bool)getProperty(property) == true)\r\n\t\t{\r\n\t\t\tctrlrSlider.setValue (getProperty(Ids::uiSliderSpringValue), dontSendNotification);\r\n\t\t}\r\n\t}\r\n\telse if (property == Ids::uiSliderPopupBubble)\r\n\t{\r\n\t\tctrlrSlider.setPopupDisplayEnabled ((bool)getProperty(property), (bool)getProperty(property), owner.getOwnerPanel().getEditor());\r\n\t}\r\n\telse\r\n\t{\r\n\t\tCtrlrComponent::valueTreePropertyChanged(treeWhosePropertyHasChanged, property);\r\n\t}\r\n\r\n\tif (restoreStateInProgress == false)\r\n\t{\r\n\t\tresized();\r\n\t}\r\n}\r\n\r\nconst String CtrlrSlider::getComponentText()\r\n{\r\n\treturn (String(getComponentValue()));\r\n}\r\n\r\nvoid CtrlrSlider::customLookAndFeelChanged(LookAndFeelBase *customLookAndFeel)\r\n{\r\n if (customLookAndFeel == nullptr)\r\n ctrlrSlider.setLookAndFeel (&lf);\r\n else\r\n ctrlrSlider.setLookAndFeel (customLookAndFeel);\r\n}<commit_msg>Gracefully work when slider properties are not set up properly.<commit_after>#include \"stdafx.h\"\r\n#include \"CtrlrSlider.h\"\r\n#include \"CtrlrProcessor.h\"\r\n#include \"..\/CtrlrComponentTypeManager.h\"\r\n#include \"CtrlrPanel\/CtrlrPanelEditor.h\"\r\n#include \"CtrlrModulator\/CtrlrModulator.h\"\r\n#include \"Lua\/JuceClasses\/LLookAndFeel.h\"\r\n\r\nCtrlrSlider::CtrlrSlider (CtrlrModulator &owner)\r\n :\tCtrlrComponent(owner),\r\n\t\tlf(*this, componentTree),\r\n\t\tctrlrSlider (*this)\r\n{\r\n\tsetColour (TooltipWindow::textColourId, Colours::red);\r\n\taddAndMakeVisible (&ctrlrSlider);\r\n\r\n ctrlrSlider.setRange (1, 127, 1);\r\n ctrlrSlider.setSliderStyle (Slider::RotaryVerticalDrag);\r\n ctrlrSlider.setTextBoxStyle (Slider::TextBoxBelow, false, 64, 12);\r\n ctrlrSlider.addListener (this);\r\n\tctrlrSlider.setLookAndFeel (&lf);\r\n\tcomponentTree.addListener (this);\r\n\r\n\tsetProperty (Ids::uiSliderStyle, \"RotaryVerticalDrag\");\r\n\tsetProperty (Ids::uiSliderMin, 0);\r\n\tsetProperty (Ids::uiSliderMax, 127);\r\n\tsetProperty (Ids::uiSliderInterval, 1);\r\n\tsetProperty (Ids::uiSliderDoubleClickEnabled, true);\r\n\tsetProperty (Ids::uiSliderDoubleClickValue, 0);\r\n\tsetProperty (Ids::uiSliderValuePosition, (int)Slider::TextBoxBelow);\r\n\tsetProperty (Ids::uiSliderValueHeight, 12);\r\n\tsetProperty (Ids::uiSliderValueWidth, 64);\r\n\tsetProperty (Ids::uiSliderTrackCornerSize, 5);\r\n\tsetProperty (Ids::uiSliderThumbCornerSize, 3);\r\n\tsetProperty (Ids::uiSliderThumbWidth, 0);\r\n\tsetProperty (Ids::uiSliderThumbHeight, 0);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnLeft, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnRight, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnTop, false);\r\n\tsetProperty (Ids::uiSliderThumbFlatOnBottom, false);\r\n\tsetProperty (Ids::uiSliderValueTextColour, \"0xff000000\");\r\n\tsetProperty (Ids::uiSliderValueBgColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderRotaryOutlineColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderRotaryFillColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderThumbColour, \"0xffff0000\");\r\n\tsetProperty (Ids::uiSliderValueHighlightColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderValueOutlineColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderTrackColour, \"0xff0f0f0f\");\r\n\tsetProperty (Ids::uiSliderIncDecButtonColour, \"0xff0000ff\");\r\n\tsetProperty (Ids::uiSliderIncDecTextColour, \"0xffffffff\");\r\n\tsetProperty (Ids::uiSliderValueFont, FONT2STR (Font(12)));\r\n\tsetProperty (Ids::uiSliderValueTextJustification, \"centred\");\r\n\tsetProperty (Ids::uiSliderVelocitySensitivity, 1.0);\r\n\tsetProperty (Ids::uiSliderVelocityThreshold, 1);\r\n\tsetProperty (Ids::uiSliderVelocityOffset, 0.0);\r\n\tsetProperty (Ids::uiSliderVelocityMode, false);\r\n\tsetProperty (Ids::uiSliderVelocityModeKeyTrigger, true);\r\n\tsetProperty (Ids::uiSliderSpringMode, false);\r\n\tsetProperty (Ids::uiSliderSpringValue, 0);\r\n\tsetProperty (Ids::uiSliderMouseWheelInterval, 1);\r\n\tsetProperty (Ids::uiSliderPopupBubble, false);\r\n\r\n\r\n setSize (64, 64);\r\n}\r\n\r\nCtrlrSlider::~CtrlrSlider()\r\n{\r\n\tcomponentTree.removeListener (this);\r\n}\r\n\r\nvoid CtrlrSlider::resized()\r\n{\r\n\tif (restoreStateInProgress)\r\n\t\treturn;\r\n\tctrlrSlider.setBounds (getUsableRect());\r\n}\r\n\r\nvoid CtrlrSlider::sliderValueChanged (Slider* sliderThatWasMoved)\r\n{\r\n if (sliderThatWasMoved == &ctrlrSlider)\r\n {\r\n\t\tif ((bool)owner.getOwnerPanel().getEditor()->getProperty(Ids::uiPanelEditMode) == true)\r\n\t\t\treturn;\r\n\r\n\t\tsetComponentValue (ctrlrSlider.getValue(), true);\r\n }\r\n}\r\n\r\nvoid CtrlrSlider::mouseUp (const MouseEvent& e)\r\n{\r\n\tif ((bool)getProperty(Ids::uiSliderSpringMode) == true)\r\n\t{\r\n\t\tctrlrSlider.setValue ((double)getProperty(Ids::uiSliderSpringValue), sendNotificationSync);\r\n\t}\r\n}\r\n\r\ndouble CtrlrSlider::getComponentValue()\r\n{\r\n\treturn (ctrlrSlider.getValue());\r\n}\r\n\r\nint CtrlrSlider::getComponentMidiValue()\r\n{\r\n\treturn ((int)ctrlrSlider.getValue());\r\n}\r\n\r\ndouble CtrlrSlider::getComponentMaxValue()\r\n{\r\n\treturn (ctrlrSlider.getMaximum());\r\n}\r\n\r\nvoid CtrlrSlider::setComponentValue (const double newValue, const bool sendChangeMessage)\r\n{\r\n\tctrlrSlider.setValue (newValue, dontSendNotification);\r\n\tif (sendChangeMessage)\r\n\t{\r\n\t\towner.getProcessor().setValueGeneric (CtrlrModulatorValue(newValue,CtrlrModulatorValue::changedByGUI));\r\n\t}\r\n}\r\n\r\nconst Array<Font> CtrlrSlider::getFontList()\r\n{\r\n\tArray <Font> ret;\r\n\tFont f = STR2FONT(getProperty(Ids::uiSliderValueFont));\r\n\tif (f.getTypefaceName() != Font::getDefaultSerifFontName()\r\n\t\t&& f.getTypefaceName() != Font::getDefaultSansSerifFontName()\r\n\t\t&& f.getTypefaceName() != Font::getDefaultMonospacedFontName()\r\n\t\t&& f.getTypefaceName() != \"<Sans-Serif>\")\r\n\t{\r\n\t\tret.add (f);\r\n\t}\r\n\treturn (ret);\r\n}\r\n\r\nvoid CtrlrSlider::valueTreePropertyChanged (ValueTree &treeWhosePropertyHasChanged, const Identifier &property)\r\n{\r\n\tif (property == Ids::uiSliderStyle)\r\n\t{\r\n\t\tctrlrSlider.setSliderStyle ((Slider::SliderStyle)CtrlrComponentTypeManager::sliderStringToStyle (getProperty (Ids::uiSliderStyle)));\r\n\t}\r\n\telse if (property == Ids::uiSliderRotaryFillColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::rotarySliderFillColourId, VAR2COLOUR(getProperty (Ids::uiSliderRotaryFillColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderRotaryOutlineColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::rotarySliderOutlineColourId, VAR2COLOUR(getProperty (Ids::uiSliderRotaryOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueTextColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxTextColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueTextColour)) );\r\n\t}\r\n\r\n\telse if (property == Ids::uiSliderValueBgColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxBackgroundColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueBgColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderThumbColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::thumbColourId, VAR2COLOUR(getProperty (Ids::uiSliderThumbColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueHighlightColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxHighlightColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderValueOutlineColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::textBoxOutlineColourId, VAR2COLOUR(getProperty (Ids::uiSliderValueOutlineColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderTrackColour)\r\n\t{\r\n\t\tctrlrSlider.setColour (Slider::trackColourId, VAR2COLOUR(getProperty (Ids::uiSliderTrackColour)) );\r\n\t}\r\n\telse if (property == Ids::uiSliderInterval || property == Ids::uiSliderMax || property == Ids::uiSliderMin)\r\n\t{\r\n\t\tdouble max = getProperty (Ids::uiSliderMax);\r\n\t\tconst double min = getProperty (Ids::uiSliderMin);\r\n\t\tdouble interval = getProperty (Ids::uiSliderInterval);\r\n\t\tif (interval == 0)\r\n\t\t\tinterval = std::abs(max-min) + 1;\r\n\t\t\/\/ For JUCE MAX must be >= min\r\n\t\tif (max <= min) {\r\n\t\t\t\/\/ samething between 0.5 and 1 times the interval\r\n\t\t\t\/\/ to avoid rounding errors\r\n\t\t\tmax = min + interval * 0.66;\r\n\t\t}\r\n\t\tctrlrSlider.setRange ( min, max, interval );\r\n\t\towner.setProperty (Ids::modulatorMax, ctrlrSlider.getMaximum());\r\n\t\towner.setProperty (Ids::modulatorMin, ctrlrSlider.getMinimum());\r\n\t}\r\n\telse if (property == Ids::uiSliderValuePosition || property == Ids::uiSliderValueHeight || property == Ids::uiSliderValueWidth)\r\n\t{\r\n\t\tctrlrSlider.setTextBoxStyle (\r\n\t\t\t(Slider::TextEntryBoxPosition)(int)getProperty (Ids::uiSliderValuePosition),\r\n\t\t\tfalse,\r\n\t\t\tgetProperty (Ids::uiSliderValueWidth, 64),\r\n\t\t\tgetProperty (Ids::uiSliderValueHeight, 12));\r\n\t}\r\n\telse if (property == Ids::uiSliderIncDecButtonColour\r\n\t\t\t|| property == Ids::uiSliderIncDecTextColour\r\n\t\t\t|| property == Ids::uiSliderValueFont\r\n\t\t\t|| property == Ids::uiSliderValueTextJustification)\r\n\t{\r\n\t\tctrlrSlider.setLookAndFeel (nullptr);\r\n\t\tctrlrSlider.setLookAndFeel (&lf);\r\n\t}\r\n\telse if (property == Ids::uiSliderVelocityMode\r\n\t\t|| property == Ids::uiSliderVelocityModeKeyTrigger\r\n\t\t|| property == Ids::uiSliderVelocitySensitivity\r\n\t\t|| property == Ids::uiSliderVelocityThreshold\r\n\t\t|| property == Ids::uiSliderVelocityOffset\r\n\t\t)\r\n\t{\r\n\t\tctrlrSlider.setVelocityBasedMode((bool)getProperty(Ids::uiSliderVelocityMode));\r\n\t\tctrlrSlider.setVelocityModeParameters ((double)getProperty(Ids::uiSliderVelocitySensitivity),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(int)getProperty(Ids::uiSliderVelocityThreshold),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(double)getProperty(Ids::uiSliderVelocityOffset),\r\n\t\t\t\t\t\t\t\t\t\t\t\t(bool)getProperty(Ids::uiSliderVelocityModeKeyTrigger));\r\n\t}\r\n\telse if (property == Ids::uiSliderSpringValue)\r\n\t{\r\n\t\tctrlrSlider.setValue (getProperty(property), dontSendNotification);\r\n\t}\r\n\r\n\telse if (property == Ids::uiSliderDoubleClickValue\r\n\t\t\t|| property == Ids::uiSliderDoubleClickEnabled)\r\n\t{\r\n\t\tctrlrSlider.setDoubleClickReturnValue ((bool)getProperty(Ids::uiSliderDoubleClickEnabled), getProperty(Ids::uiSliderDoubleClickValue));\r\n\t}\r\n\telse if (property == Ids::uiSliderSpringMode)\r\n\t{\r\n\t\tif ((bool)getProperty(property) == true)\r\n\t\t{\r\n\t\t\tctrlrSlider.setValue (getProperty(Ids::uiSliderSpringValue), dontSendNotification);\r\n\t\t}\r\n\t}\r\n\telse if (property == Ids::uiSliderPopupBubble)\r\n\t{\r\n\t\tctrlrSlider.setPopupDisplayEnabled ((bool)getProperty(property), (bool)getProperty(property), owner.getOwnerPanel().getEditor());\r\n\t}\r\n\telse\r\n\t{\r\n\t\tCtrlrComponent::valueTreePropertyChanged(treeWhosePropertyHasChanged, property);\r\n\t}\r\n\r\n\tif (restoreStateInProgress == false)\r\n\t{\r\n\t\tresized();\r\n\t}\r\n}\r\n\r\nconst String CtrlrSlider::getComponentText()\r\n{\r\n\treturn (String(getComponentValue()));\r\n}\r\n\r\nvoid CtrlrSlider::customLookAndFeelChanged(LookAndFeelBase *customLookAndFeel)\r\n{\r\n if (customLookAndFeel == nullptr)\r\n ctrlrSlider.setLookAndFeel (&lf);\r\n else\r\n ctrlrSlider.setLookAndFeel (customLookAndFeel);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\n** Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include <gtest\/gtest.h>\n#include <vector>\n#include <iostream>\n#include <cmath>\n#include <qi\/transport\/zeromq\/zmqpublisher.hpp>\n#include <qi\/transport\/zeromq\/zmqsubscriber.hpp>\n#include <qi\/perf\/sleep.hpp>\n#include <boost\/timer.hpp>\n\nstruct SubscribePerfHandler : qi::transport::SubscribeHandler {\n int fCount;\n int fExpectedMessages;\n boost::timer timer;\n\n \/\/ conforms to ISubscriberHandler\n void subscribeHandler(const std::string& msg) {\n if (fCount == 0) {\n timer.restart();\n }\n fCount++;\n if (fCount != fExpectedMessages) {\n return;\n }\n \/\/ print results\n double elapsed = timer.elapsed();\n double msgPerSecond = 1.0 \/(elapsed \/ fExpectedMessages);\n std::cout << \"SUB: msg:\" << fCount << \" msg\/s: \" <<\n std::setprecision(12) << msgPerSecond << std::endl;\n }\n\n int getCount() {\n return fCount;\n }\n\n SubscribePerfHandler() : fCount(0) {}\n\n SubscribePerfHandler(int expectedMessages) :\n fCount(0),\n fExpectedMessages(expectedMessages) {}\n};\n\nTEST(TransportZMQPublisher , MillionPerSecond)\n{\n int numMillions = 1;\n int numMessages = numMillions * 1000000;\n\n SubscribePerfHandler handler(numMessages);\n \/\/qi::transport::ZMQPublisher publisher1(\"tcp:\/\/127.0.0.1:5556\");\n qi::transport::ZMQPublisher publisher(\"tcp:\/\/127.0.0.1:5555\");\n qi::transport::ZMQSubscriber subscriber(\"tcp:\/\/127.0.0.1:5555\");\n\n subscriber.setSubscribeHandler(&handler);\n subscriber.subscribe();\n std::string msg = \"Hello\";\n sleep(1);\n for (int i=0; i < numMessages; i++) {\n publisher.publish(msg);\n }\n\n sleep(2);\n int result = handler.getCount();\n ASSERT_EQ( numMessages, result) << \"Did not receive all messages\";\n}\n\n\n\nTEST(TransportZMQPublisher , MultipleSubscribers)\n{\n int numMessages = 100000;\n\n const int numSubscribers = 80;\n std::cout << \"Using \" << numSubscribers << \" subscribers\" << std::endl;\n std::vector<SubscribePerfHandler*> handlers;\n std::vector< qi::transport::ZMQSubscriber*> subscribers;\n \/\/boost::shared_ptr<zmq::context_t> subContext(new zmq::context_t(1));\n for (unsigned int i = 0; i < numSubscribers; ++i) {\n SubscribePerfHandler* hand = new SubscribePerfHandler(numMessages);\n qi::transport::ZMQSubscriber* sub = new qi::transport::ZMQSubscriber(\/*subContext, *\/\"tcp:\/\/127.0.0.1:5555\");\n sub->setSubscribeHandler(hand);\n sub->subscribe();\n handlers.push_back(hand);\n subscribers.push_back(sub);\n }\n sleep(2);\n qi::transport::ZMQPublisher publisher(\"tcp:\/\/127.0.0.1:5555\");\n\n sleep(1);\n std::string msg = \"Hello\";\n\n std::cout << \"Publishing...\";\n for (int i=0; i < numMessages; i++) {\n publisher.publish(msg);\n }\n std::cout << \" Done.\" << std::endl;\n sleep(3);\n int result = 0;\n for(unsigned int i=0; i < numSubscribers; ++i) {\n result += handlers[i]->getCount();\n }\n ASSERT_EQ( numMessages * numSubscribers, result) << \"Did not receive all messages\";\n}\n\n<commit_msg>Added delete for subscribers vector<commit_after>\/**\n** Copyright (C) 2010 Aldebaran Robotics\n*\/\n\n#include <gtest\/gtest.h>\n#include <vector>\n#include <iostream>\n#include <cmath>\n#include <qi\/transport\/zeromq\/zmqpublisher.hpp>\n#include <qi\/transport\/zeromq\/zmqsubscriber.hpp>\n#include <qi\/perf\/sleep.hpp>\n#include <boost\/timer.hpp>\n\nstruct SubscribePerfHandler : qi::transport::SubscribeHandler {\n int fCount;\n int fExpectedMessages;\n boost::timer timer;\n\n \/\/ conforms to ISubscriberHandler\n void subscribeHandler(const std::string& msg) {\n if (fCount == 0) {\n timer.restart();\n }\n fCount++;\n if (fCount != fExpectedMessages) {\n return;\n }\n \/\/ print results\n double elapsed = timer.elapsed();\n double msgPerSecond = 1.0 \/(elapsed \/ fExpectedMessages);\n std::cout << \"SUB: msg:\" << fCount << \" msg\/s: \" <<\n std::setprecision(12) << msgPerSecond << std::endl;\n }\n\n int getCount() {\n return fCount;\n }\n\n SubscribePerfHandler() : fCount(0) {}\n\n SubscribePerfHandler(int expectedMessages) :\n fCount(0),\n fExpectedMessages(expectedMessages) {}\n};\n\nTEST(TransportZMQPublisher , MillionPerSecond)\n{\n int numMillions = 1;\n int numMessages = numMillions * 1000000;\n\n SubscribePerfHandler handler(numMessages);\n \/\/qi::transport::ZMQPublisher publisher1(\"tcp:\/\/127.0.0.1:5556\");\n qi::transport::ZMQPublisher publisher(\"tcp:\/\/127.0.0.1:5555\");\n qi::transport::ZMQSubscriber subscriber(\"tcp:\/\/127.0.0.1:5555\");\n\n subscriber.setSubscribeHandler(&handler);\n subscriber.subscribe();\n std::string msg = \"Hello\";\n sleep(1);\n for (int i=0; i < numMessages; i++) {\n publisher.publish(msg);\n }\n\n sleep(2);\n int result = handler.getCount();\n ASSERT_EQ( numMessages, result) << \"Did not receive all messages\";\n}\n\n\n\nTEST(TransportZMQPublisher , MultipleSubscribers)\n{\n int numMessages = 100000;\n\n const int numSubscribers = 80;\n std::cout << \"Using \" << numSubscribers << \" subscribers\" << std::endl;\n std::vector<SubscribePerfHandler*> handlers;\n std::vector< qi::transport::ZMQSubscriber*> subscribers;\n \/\/boost::shared_ptr<zmq::context_t> subContext(new zmq::context_t(1));\n for (unsigned int i = 0; i < numSubscribers; ++i) {\n SubscribePerfHandler* hand = new SubscribePerfHandler(numMessages);\n qi::transport::ZMQSubscriber* sub = new qi::transport::ZMQSubscriber(\/*subContext, *\/\"tcp:\/\/127.0.0.1:5555\");\n sub->setSubscribeHandler(hand);\n sub->subscribe();\n handlers.push_back(hand);\n subscribers.push_back(sub);\n }\n sleep(2);\n qi::transport::ZMQPublisher publisher(\"tcp:\/\/127.0.0.1:5555\");\n\n sleep(1);\n std::string msg = \"Hello\";\n\n std::cout << \"Publishing...\";\n for (int i=0; i < numMessages; i++) {\n publisher.publish(msg);\n }\n std::cout << \" Done.\" << std::endl;\n sleep(3);\n int result = 0;\n for(unsigned int i=0; i < numSubscribers; ++i) {\n result += handlers[i]->getCount();\n }\n\n for(int i=0; i < numSubscribers; i++) {\n delete subscribers[i];\n }\n ASSERT_EQ( numMessages * numSubscribers, result) << \"Did not receive all messages\";\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2006, 2007, 2008, Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"platform\/fonts\/harfbuzz\/FontPlatformDataHarfBuzz.h\"\n\n#include \"RuntimeEnabledFeatures.h\"\n#include \"SkTypeface.h\"\n#include \"platform\/LayoutTestSupport.h\"\n#include \"platform\/NotImplemented.h\"\n#include \"platform\/fonts\/FontCache.h\"\n#include \"platform\/fonts\/harfbuzz\/HarfBuzzFace.h\"\n\n#include \"public\/platform\/linux\/WebFontInfo.h\"\n#include \"public\/platform\/linux\/WebFontRenderStyle.h\"\n#include \"public\/platform\/linux\/WebSandboxSupport.h\"\n#include \"public\/platform\/Platform.h\"\n#include \"wtf\/text\/WTFString.h\"\n\nnamespace WebCore {\n\nstatic SkPaint::Hinting skiaHinting = SkPaint::kNormal_Hinting;\nstatic bool useSkiaAutoHint = true;\nstatic bool useSkiaBitmaps = true;\nstatic bool useSkiaAntiAlias = true;\nstatic bool useSkiaSubpixelRendering = false;\n\nvoid FontPlatformData::setHinting(SkPaint::Hinting hinting)\n{\n skiaHinting = hinting;\n}\n\nvoid FontPlatformData::setAutoHint(bool useAutoHint)\n{\n useSkiaAutoHint = useAutoHint;\n}\n\nvoid FontPlatformData::setUseBitmaps(bool useBitmaps)\n{\n useSkiaBitmaps = useBitmaps;\n}\n\nvoid FontPlatformData::setAntiAlias(bool useAntiAlias)\n{\n useSkiaAntiAlias = useAntiAlias;\n}\n\nvoid FontPlatformData::setSubpixelRendering(bool useSubpixelRendering)\n{\n useSkiaSubpixelRendering = useSubpixelRendering;\n}\n\nFontPlatformData::FontPlatformData(WTF::HashTableDeletedValueType)\n : m_textSize(0)\n , m_syntheticBold(false)\n , m_syntheticItalic(false)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(true)\n{\n}\n\nFontPlatformData::FontPlatformData()\n : m_textSize(0)\n , m_syntheticBold(false)\n , m_syntheticItalic(false)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(float textSize, bool syntheticBold, bool syntheticItalic)\n : m_textSize(textSize)\n , m_syntheticBold(syntheticBold)\n , m_syntheticItalic(syntheticItalic)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(const FontPlatformData& src)\n : m_typeface(src.m_typeface)\n , m_family(src.m_family)\n , m_textSize(src.m_textSize)\n , m_syntheticBold(src.m_syntheticBold)\n , m_syntheticItalic(src.m_syntheticItalic)\n , m_orientation(src.m_orientation)\n , m_style(src.m_style)\n , m_harfBuzzFace(nullptr)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(PassRefPtr<SkTypeface> tf, const char* family, float textSize, bool syntheticBold, bool syntheticItalic, FontOrientation orientation, bool subpixelTextPosition)\n : m_typeface(tf)\n , m_family(family)\n , m_textSize(textSize)\n , m_syntheticBold(syntheticBold)\n , m_syntheticItalic(syntheticItalic)\n , m_orientation(orientation)\n , m_isHashTableDeletedValue(false)\n{\n querySystemForRenderStyle(subpixelTextPosition);\n}\n\nFontPlatformData::FontPlatformData(const FontPlatformData& src, float textSize)\n : m_typeface(src.m_typeface)\n , m_family(src.m_family)\n , m_textSize(textSize)\n , m_syntheticBold(src.m_syntheticBold)\n , m_syntheticItalic(src.m_syntheticItalic)\n , m_orientation(src.m_orientation)\n , m_harfBuzzFace(nullptr)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n querySystemForRenderStyle(FontDescription::subpixelPositioning());\n}\n\nFontPlatformData::~FontPlatformData()\n{\n}\n\nFontPlatformData& FontPlatformData::operator=(const FontPlatformData& src)\n{\n m_typeface = src.m_typeface;\n m_family = src.m_family;\n m_textSize = src.m_textSize;\n m_syntheticBold = src.m_syntheticBold;\n m_syntheticItalic = src.m_syntheticItalic;\n m_harfBuzzFace = nullptr;\n m_orientation = src.m_orientation;\n m_style = src.m_style;\n#if OS(WIN)\n m_minSizeForAntiAlias = src.m_minSizeForAntiAlias;\n#endif\n\n return *this;\n}\n\n#ifndef NDEBUG\nString FontPlatformData::description() const\n{\n return String();\n}\n#endif\n\nvoid FontPlatformData::setupPaint(SkPaint* paint, GraphicsContext*) const\n{\n paint->setAntiAlias(m_style.useAntiAlias);\n paint->setHinting(static_cast<SkPaint::Hinting>(m_style.hintStyle));\n paint->setEmbeddedBitmapText(m_style.useBitmaps);\n paint->setAutohinted(m_style.useAutoHint);\n if (m_style.useAntiAlias)\n paint->setLCDRenderText(m_style.useSubpixelRendering);\n\n \/\/ TestRunner specifically toggles the subpixel positioning flag.\n if (RuntimeEnabledFeatures::subpixelFontScalingEnabled() && !isRunningLayoutTest())\n paint->setSubpixelText(true);\n else\n paint->setSubpixelText(m_style.useSubpixelPositioning);\n\n const float ts = m_textSize >= 0 ? m_textSize : 12;\n paint->setTextSize(SkFloatToScalar(ts));\n paint->setTypeface(m_typeface.get());\n paint->setFakeBoldText(m_syntheticBold);\n paint->setTextSkewX(m_syntheticItalic ? -SK_Scalar1 \/ 4 : 0);\n}\n\nSkFontID FontPlatformData::uniqueID() const\n{\n return m_typeface->uniqueID();\n}\n\nString FontPlatformData::fontFamilyName() const\n{\n \/\/ FIXME(crbug.com\/326582): come up with a proper way of handling SVG.\n if (!this->typeface())\n return \"\";\n SkTypeface::LocalizedStrings* fontFamilyIterator = this->typeface()->createFamilyNameIterator();\n SkTypeface::LocalizedString localizedString;\n while (fontFamilyIterator->next(&localizedString) && !localizedString.fString.size()) { }\n fontFamilyIterator->unref();\n return String(localizedString.fString.c_str());\n}\n\nbool FontPlatformData::operator==(const FontPlatformData& a) const\n{\n \/\/ If either of the typeface pointers are null then we test for pointer\n \/\/ equality. Otherwise, we call SkTypeface::Equal on the valid pointers.\n bool typefacesEqual;\n if (!m_typeface || !a.m_typeface)\n typefacesEqual = m_typeface == a.m_typeface;\n else\n typefacesEqual = SkTypeface::Equal(m_typeface.get(), a.m_typeface.get());\n\n return typefacesEqual\n && m_textSize == a.m_textSize\n && m_syntheticBold == a.m_syntheticBold\n && m_syntheticItalic == a.m_syntheticItalic\n && m_orientation == a.m_orientation\n && m_style == a.m_style\n && m_isHashTableDeletedValue == a.m_isHashTableDeletedValue;\n}\n\nbool FontPlatformData::isFixedPitch() const\n{\n notImplemented();\n return false;\n}\n\nHarfBuzzFace* FontPlatformData::harfBuzzFace() const\n{\n if (!m_harfBuzzFace)\n m_harfBuzzFace = HarfBuzzFace::create(const_cast<FontPlatformData*>(this), uniqueID());\n\n return m_harfBuzzFace.get();\n}\n\nvoid FontPlatformData::getRenderStyleForStrike(const char* font, int sizeAndStyle)\n{\n blink::WebFontRenderStyle style;\n\n#if OS(ANDROID)\n style.setDefaults();\n#else\n if (!font || !*font)\n style.setDefaults(); \/\/ It's probably a webfont. Take the system defaults.\n else if (blink::Platform::current()->sandboxSupport())\n blink::Platform::current()->sandboxSupport()->getRenderStyleForStrike(font, sizeAndStyle, &style);\n else\n blink::WebFontInfo::renderStyleForStrike(font, sizeAndStyle, &style);\n#endif\n\n style.toFontRenderStyle(&m_style);\n}\n\nvoid FontPlatformData::querySystemForRenderStyle(bool useSkiaSubpixelPositioning)\n{\n getRenderStyleForStrike(m_family.data(), (((int)m_textSize) << 2) | (m_typeface->style() & 3));\n\n \/\/ Fix FontRenderStyle::NoPreference to actual styles.\n if (m_style.useAntiAlias == FontRenderStyle::NoPreference)\n m_style.useAntiAlias = useSkiaAntiAlias;\n\n if (!m_style.useHinting)\n m_style.hintStyle = SkPaint::kNo_Hinting;\n else if (m_style.useHinting == FontRenderStyle::NoPreference)\n m_style.hintStyle = skiaHinting;\n\n if (m_style.useBitmaps == FontRenderStyle::NoPreference)\n m_style.useBitmaps = useSkiaBitmaps;\n if (m_style.useAutoHint == FontRenderStyle::NoPreference)\n m_style.useAutoHint = useSkiaAutoHint;\n if (m_style.useAntiAlias == FontRenderStyle::NoPreference)\n m_style.useAntiAlias = useSkiaAntiAlias;\n if (m_style.useSubpixelRendering == FontRenderStyle::NoPreference)\n m_style.useSubpixelRendering = useSkiaSubpixelRendering;\n\n \/\/ TestRunner specifically toggles the subpixel positioning flag.\n if (m_style.useSubpixelPositioning == FontRenderStyle::NoPreference\n || isRunningLayoutTest())\n m_style.useSubpixelPositioning = useSkiaSubpixelPositioning;\n}\n\nbool FontPlatformData::defaultUseSubpixelPositioning()\n{\n return FontDescription::subpixelPositioning();\n}\n\n} \/\/ namespace WebCore\n<commit_msg>Implement FontPlatformData::isFixedPitch for linux<commit_after>\/*\n * Copyright (c) 2006, 2007, 2008, Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"platform\/fonts\/harfbuzz\/FontPlatformDataHarfBuzz.h\"\n\n#include \"RuntimeEnabledFeatures.h\"\n#include \"SkTypeface.h\"\n#include \"platform\/LayoutTestSupport.h\"\n#include \"platform\/NotImplemented.h\"\n#include \"platform\/fonts\/FontCache.h\"\n#include \"platform\/fonts\/harfbuzz\/HarfBuzzFace.h\"\n\n#include \"public\/platform\/linux\/WebFontInfo.h\"\n#include \"public\/platform\/linux\/WebFontRenderStyle.h\"\n#include \"public\/platform\/linux\/WebSandboxSupport.h\"\n#include \"public\/platform\/Platform.h\"\n#include \"wtf\/text\/WTFString.h\"\n\nnamespace WebCore {\n\nstatic SkPaint::Hinting skiaHinting = SkPaint::kNormal_Hinting;\nstatic bool useSkiaAutoHint = true;\nstatic bool useSkiaBitmaps = true;\nstatic bool useSkiaAntiAlias = true;\nstatic bool useSkiaSubpixelRendering = false;\n\nvoid FontPlatformData::setHinting(SkPaint::Hinting hinting)\n{\n skiaHinting = hinting;\n}\n\nvoid FontPlatformData::setAutoHint(bool useAutoHint)\n{\n useSkiaAutoHint = useAutoHint;\n}\n\nvoid FontPlatformData::setUseBitmaps(bool useBitmaps)\n{\n useSkiaBitmaps = useBitmaps;\n}\n\nvoid FontPlatformData::setAntiAlias(bool useAntiAlias)\n{\n useSkiaAntiAlias = useAntiAlias;\n}\n\nvoid FontPlatformData::setSubpixelRendering(bool useSubpixelRendering)\n{\n useSkiaSubpixelRendering = useSubpixelRendering;\n}\n\nFontPlatformData::FontPlatformData(WTF::HashTableDeletedValueType)\n : m_textSize(0)\n , m_syntheticBold(false)\n , m_syntheticItalic(false)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(true)\n{\n}\n\nFontPlatformData::FontPlatformData()\n : m_textSize(0)\n , m_syntheticBold(false)\n , m_syntheticItalic(false)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(float textSize, bool syntheticBold, bool syntheticItalic)\n : m_textSize(textSize)\n , m_syntheticBold(syntheticBold)\n , m_syntheticItalic(syntheticItalic)\n , m_orientation(Horizontal)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(const FontPlatformData& src)\n : m_typeface(src.m_typeface)\n , m_family(src.m_family)\n , m_textSize(src.m_textSize)\n , m_syntheticBold(src.m_syntheticBold)\n , m_syntheticItalic(src.m_syntheticItalic)\n , m_orientation(src.m_orientation)\n , m_style(src.m_style)\n , m_harfBuzzFace(nullptr)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n}\n\nFontPlatformData::FontPlatformData(PassRefPtr<SkTypeface> tf, const char* family, float textSize, bool syntheticBold, bool syntheticItalic, FontOrientation orientation, bool subpixelTextPosition)\n : m_typeface(tf)\n , m_family(family)\n , m_textSize(textSize)\n , m_syntheticBold(syntheticBold)\n , m_syntheticItalic(syntheticItalic)\n , m_orientation(orientation)\n , m_isHashTableDeletedValue(false)\n{\n querySystemForRenderStyle(subpixelTextPosition);\n}\n\nFontPlatformData::FontPlatformData(const FontPlatformData& src, float textSize)\n : m_typeface(src.m_typeface)\n , m_family(src.m_family)\n , m_textSize(textSize)\n , m_syntheticBold(src.m_syntheticBold)\n , m_syntheticItalic(src.m_syntheticItalic)\n , m_orientation(src.m_orientation)\n , m_harfBuzzFace(nullptr)\n , m_isHashTableDeletedValue(false)\n#if OS(WIN)\n , m_minSizeForAntiAlias(0)\n#endif\n{\n querySystemForRenderStyle(FontDescription::subpixelPositioning());\n}\n\nFontPlatformData::~FontPlatformData()\n{\n}\n\nFontPlatformData& FontPlatformData::operator=(const FontPlatformData& src)\n{\n m_typeface = src.m_typeface;\n m_family = src.m_family;\n m_textSize = src.m_textSize;\n m_syntheticBold = src.m_syntheticBold;\n m_syntheticItalic = src.m_syntheticItalic;\n m_harfBuzzFace = nullptr;\n m_orientation = src.m_orientation;\n m_style = src.m_style;\n#if OS(WIN)\n m_minSizeForAntiAlias = src.m_minSizeForAntiAlias;\n#endif\n\n return *this;\n}\n\n#ifndef NDEBUG\nString FontPlatformData::description() const\n{\n return String();\n}\n#endif\n\nvoid FontPlatformData::setupPaint(SkPaint* paint, GraphicsContext*) const\n{\n paint->setAntiAlias(m_style.useAntiAlias);\n paint->setHinting(static_cast<SkPaint::Hinting>(m_style.hintStyle));\n paint->setEmbeddedBitmapText(m_style.useBitmaps);\n paint->setAutohinted(m_style.useAutoHint);\n if (m_style.useAntiAlias)\n paint->setLCDRenderText(m_style.useSubpixelRendering);\n\n \/\/ TestRunner specifically toggles the subpixel positioning flag.\n if (RuntimeEnabledFeatures::subpixelFontScalingEnabled() && !isRunningLayoutTest())\n paint->setSubpixelText(true);\n else\n paint->setSubpixelText(m_style.useSubpixelPositioning);\n\n const float ts = m_textSize >= 0 ? m_textSize : 12;\n paint->setTextSize(SkFloatToScalar(ts));\n paint->setTypeface(m_typeface.get());\n paint->setFakeBoldText(m_syntheticBold);\n paint->setTextSkewX(m_syntheticItalic ? -SK_Scalar1 \/ 4 : 0);\n}\n\nSkFontID FontPlatformData::uniqueID() const\n{\n return m_typeface->uniqueID();\n}\n\nString FontPlatformData::fontFamilyName() const\n{\n \/\/ FIXME(crbug.com\/326582): come up with a proper way of handling SVG.\n if (!this->typeface())\n return \"\";\n SkTypeface::LocalizedStrings* fontFamilyIterator = this->typeface()->createFamilyNameIterator();\n SkTypeface::LocalizedString localizedString;\n while (fontFamilyIterator->next(&localizedString) && !localizedString.fString.size()) { }\n fontFamilyIterator->unref();\n return String(localizedString.fString.c_str());\n}\n\nbool FontPlatformData::operator==(const FontPlatformData& a) const\n{\n \/\/ If either of the typeface pointers are null then we test for pointer\n \/\/ equality. Otherwise, we call SkTypeface::Equal on the valid pointers.\n bool typefacesEqual;\n if (!m_typeface || !a.m_typeface)\n typefacesEqual = m_typeface == a.m_typeface;\n else\n typefacesEqual = SkTypeface::Equal(m_typeface.get(), a.m_typeface.get());\n\n return typefacesEqual\n && m_textSize == a.m_textSize\n && m_syntheticBold == a.m_syntheticBold\n && m_syntheticItalic == a.m_syntheticItalic\n && m_orientation == a.m_orientation\n && m_style == a.m_style\n && m_isHashTableDeletedValue == a.m_isHashTableDeletedValue;\n}\n\nbool FontPlatformData::isFixedPitch() const\n{\n return typeface() && typeface()->isFixedPitch();\n}\n\nHarfBuzzFace* FontPlatformData::harfBuzzFace() const\n{\n if (!m_harfBuzzFace)\n m_harfBuzzFace = HarfBuzzFace::create(const_cast<FontPlatformData*>(this), uniqueID());\n\n return m_harfBuzzFace.get();\n}\n\nvoid FontPlatformData::getRenderStyleForStrike(const char* font, int sizeAndStyle)\n{\n blink::WebFontRenderStyle style;\n\n#if OS(ANDROID)\n style.setDefaults();\n#else\n if (!font || !*font)\n style.setDefaults(); \/\/ It's probably a webfont. Take the system defaults.\n else if (blink::Platform::current()->sandboxSupport())\n blink::Platform::current()->sandboxSupport()->getRenderStyleForStrike(font, sizeAndStyle, &style);\n else\n blink::WebFontInfo::renderStyleForStrike(font, sizeAndStyle, &style);\n#endif\n\n style.toFontRenderStyle(&m_style);\n}\n\nvoid FontPlatformData::querySystemForRenderStyle(bool useSkiaSubpixelPositioning)\n{\n getRenderStyleForStrike(m_family.data(), (((int)m_textSize) << 2) | (m_typeface->style() & 3));\n\n \/\/ Fix FontRenderStyle::NoPreference to actual styles.\n if (m_style.useAntiAlias == FontRenderStyle::NoPreference)\n m_style.useAntiAlias = useSkiaAntiAlias;\n\n if (!m_style.useHinting)\n m_style.hintStyle = SkPaint::kNo_Hinting;\n else if (m_style.useHinting == FontRenderStyle::NoPreference)\n m_style.hintStyle = skiaHinting;\n\n if (m_style.useBitmaps == FontRenderStyle::NoPreference)\n m_style.useBitmaps = useSkiaBitmaps;\n if (m_style.useAutoHint == FontRenderStyle::NoPreference)\n m_style.useAutoHint = useSkiaAutoHint;\n if (m_style.useAntiAlias == FontRenderStyle::NoPreference)\n m_style.useAntiAlias = useSkiaAntiAlias;\n if (m_style.useSubpixelRendering == FontRenderStyle::NoPreference)\n m_style.useSubpixelRendering = useSkiaSubpixelRendering;\n\n \/\/ TestRunner specifically toggles the subpixel positioning flag.\n if (m_style.useSubpixelPositioning == FontRenderStyle::NoPreference\n || isRunningLayoutTest())\n m_style.useSubpixelPositioning = useSkiaSubpixelPositioning;\n}\n\nbool FontPlatformData::defaultUseSubpixelPositioning()\n{\n return FontDescription::subpixelPositioning();\n}\n\n} \/\/ namespace WebCore\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008 28msec, Inc.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * mapping to s3\n * directory:\n * - empty object with the name of the dir, e.g. \/testdir\n * - metadata: \n * - dir : 1\n * - mode_t : int\n * - gid : int\n * - oid : int\n * file:\n * - object with the path\/name of the file, e.g. \/testdir\/testfile\n * - metadata:\n * - file: 1\n * - mode_t : int\n * - gid : int\n * - oid : int\n *\/\n#include <errno.h>\n#include <fcntl.h>\n#include <string.h>\n#include <iostream>\n#include <vector>\n#include <sys\/stat.h>\n#include <map>\n#include <sstream>\n\n#define _FILE_OFFSET_BITS 64\n#define FUSE_USE_VERSION 26\n#include <fuse.h>\n#include <libaws\/aws.h>\n\nusing namespace aws;\n\n\nstatic AWSConnectionFactory* theFactory;\nstatic std::string theAccessKeyId;\nstatic std::string theSecretAccessKey;\nstatic std::string BUCKETNAME(\"msb\");\n\n\/**\n * accessor and release functions for S3 Connection objects\n *\/\nstatic S3ConnectionPtr getConnection() {\n return theFactory->createS3Connection(theAccessKeyId, theSecretAccessKey);\n}\n\nstatic void releaseConnection(const S3ConnectionPtr& aConnection) {\n}\n\n\/**\n * macro that should be used to exit a function\n * it releases the connection object used in the function and returns with the given return code\n *\/\n#define S3FS_EXIT(code) \\\n releaseConnection(lCon); \\\n return code;\n\n\/**\n * macros that should be used for try-catch combinations\n *\/\n#define S3FS_TRY try {\n\n#ifndef NDEBUG\n# define S3FS_CATCH(kind) \\\n } catch (kind ## Exception & s3Exception) { \\\n std::cerr << s3Exception.getErrorMessage() << std::endl; \\\n S3FS_EXIT(-ENOENT); \\\n } catch (AWSConnectionException & conException) { \\\n std::cerr << conException.what() << std::endl; \\\n S3FS_EXIT(-ECONNREFUSED); \\\n }\n#else\n# define S3FS_CATCH(kind) \\\n } catch (kind ## Exception & s3Exception) { \\\n std::cerr << s3Exception.what() << std::endl; \\\n S3FS_EXIT(-ENOENT); \\\n } catch (AWSConnectionException & conException) { \\\n std::cerr << conException.what() << std::endl; \\\n S3FS_EXIT(-ECONNREFUSED); \\\n }\n#endif\n\n\/\/ shorcuts\ntypedef std::map<std::string, std::string> map_t;\ntypedef std::pair<std::string, std::string> pair_t;\n\n\/** \n * helper functions\n *\/\nstatic mode_t\nto_int(const std::string s)\n{\n return (mode_t) atoi(s.c_str());\n}\n\nstatic std::string\nto_string(int i)\n{\n std::stringstream s;\n s << i;\n return s.str();\n}\n\nstatic void\nfill_stat(map_t& aMap, struct stat* stbuf, long long aContentLength)\n{\n stbuf->st_mode |= to_int(aMap[\"mode\"]);\n stbuf->st_gid |= to_int(aMap[\"gid\"]);\n stbuf->st_uid |= to_int(aMap[\"uid\"]);\n\n if (aMap.count(\"dir\") != 0) {\n stbuf->st_mode |= S_IFDIR;\n } else if (aMap.count(\"file\") != 0) {\n stbuf->st_mode |= S_IFREG;\n stbuf->st_size = 5;\n } \n \/\/ TODO date\n}\n\n\/** \n * operation functions\n *\/\nstatic int\ns3_getattr(const char *path, struct stat *stbuf)\n{\n#ifndef NDEBUG\n std::cerr << \"getattr path: \" << path << std::endl;\n#endif\n\n \/\/ we always immediately exit if the root dir is requested.\n if (strcmp(path, \"\/\") == 0) { \/* The root directory of our file system. *\/\n stbuf->st_mode = S_IFDIR | 0777;\n stbuf->st_nlink = 3;\n return 0;\n }\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n memset(stbuf, 0, sizeof(struct stat));\n\n \/\/ check if we have that path\n HeadResponsePtr lRes;\n lRes = lCon->head(BUCKETNAME, path);\n map_t lMap = lRes->getMetaData();\n#ifndef NDEBUG\n std::cerr << \" requested metadata for \" << path << std::endl;\n for (map_t::iterator lIter = lMap.begin(); lIter != lMap.end(); ++lIter) {\n std::cerr << \" got \" << (*lIter).first << \" : \" << (*lIter).second << std::endl;\n }\n std::cerr << \" content-length: \" << lRes->getContentLength() << std::endl;\n#endif\n\n \/\/ set the meta data in the stat struct\n fill_stat(lMap, stbuf, lRes->getContentLength());\n\n S3FS_EXIT(0);\n S3FS_CATCH(Head)\n}\n\nstatic int\ns3_mkdir(const char *path, mode_t mode)\n{\n#ifndef NDEBUG\n std::cerr << \"mkdir: \" << path << std::endl;\n std::cerr << \" mode: \" << mode << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n map_t lDirMap;\n lDirMap.insert(pair_t(\"dir\", \"1\"));\n lDirMap.insert(pair_t(\"gid\", to_string(getgid())));\n lDirMap.insert(pair_t(\"uid\", to_string(getuid())));\n lDirMap.insert(pair_t(\"mode\", to_string(mode)));\n PutResponsePtr lRes = lCon->put(BUCKETNAME, path, 0, \"text\/plain\", 0, &lDirMap);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n S3FS_EXIT(-ENOENT);\n}\n\nstatic int\ns3_rmdir(const char *path)\n{\n#ifndef NDEBUG\n std::cerr << \"rmdir: \" << path << std::endl;\n#endif\n S3ConnectionPtr lCon = getConnection();\n\n try {\n HeadResponsePtr lRes;\n lRes = lCon->head(BUCKETNAME, path);\n map_t lMap = lRes->getMetaData();\n if (lMap.count(\"dir\") == 0) {\n#ifndef NDEBUG\n std::cerr << \" not a directory\" << std::endl;\n#endif\n S3FS_EXIT(-ENOTTY); \n }\n } catch (HeadException &e) {\n if (e.getErrorCode() == aws::S3Exception::NoSuchKey) {\n#ifndef NDEBUG\n std::cerr << \" no such key\" << std::endl;\n#endif\n S3FS_EXIT(-ENOENT);\n }\n#ifndef NDEBU\n std::cerr << \" something unexpected happened: \" << e.getErrorMessage() << std::endl;\n#endif\n S3FS_EXIT(-ENOENT);\n }\n\n S3FS_TRY\n DeleteResponsePtr lRes = lCon->del(BUCKETNAME, path);\n S3FS_CATCH(Put)\n S3FS_EXIT(0);\n}\n\nstatic int\ns3_readdir(const char *path,\n void *buf,\n fuse_fill_dir_t filler,\n off_t offset,\n struct fuse_file_info *fi)\n{\n#ifndef NDEBUG\n std::cerr << \"readdir: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n\n filler(buf, \".\", NULL, 0);\n filler(buf, \"..\", NULL, 0);\n\n \/\/ TODO handle full buffer by remembering the marker\n\n std::string lPath(path);\n if (lPath.at(lPath.length()-1) != '\/')\n lPath += \"\/\";\n\n ListBucketResponsePtr lRes;\n S3FS_TRY\n std::string lMarker;\n do {\n lRes = lCon->listBucket(BUCKETNAME, lPath, lMarker, \"\/\", -1);\n lRes->open();\n ListBucketResponse::Object o;\n while (lRes->next(o)) {\n struct stat lStat;\n memset(&lStat, 0, sizeof(struct stat));\n\n#ifndef NDEBUG\n std::cerr << \" result: \" << o.KeyValue << std::endl;\n#endif\n std::string lTmp = o.KeyValue.replace(0, lPath.length(), \"\");\n filler(buf, lTmp.c_str(), &lStat, 0);\n lMarker = o.KeyValue;\n }\n lRes->close();\n } while (lRes->isTruncated());\n\n S3FS_EXIT(0);\n S3FS_CATCH(ListBucket);\n\n S3FS_EXIT(-ENOENT);\n}\n\nstatic int\ns3_create(const char *path, mode_t mode, struct fuse_file_info *fs)\n{\n#ifndef NDEBUG\n std::cerr << \"create: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n map_t lDirMap;\n lDirMap.insert(pair_t(\"file\", \"1\"));\n lDirMap.insert(pair_t(\"gid\", to_string(getgid())));\n lDirMap.insert(pair_t(\"uid\", to_string(getuid())));\n lDirMap.insert(pair_t(\"mode\", to_string(mode)));\n PutResponsePtr lRes = lCon->put(BUCKETNAME, path, 0, \"text\/plain\", 0, &lDirMap);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n S3FS_EXIT(-ENOENT);\n}\n\n\/\/ open, write, release\n\/\/ always use a temporary file\n\n\nstatic int\ns3_read(const char *path,\n char *buf,\n size_t size,\n off_t offset,\n struct fuse_file_info *fi)\n{\n#ifndef NDEBUG\n std::cerr << \"read: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n memcpy(buf, \"test\\n\", 5); \/* Provide the content. *\/\n return 5;\n#if 0\n GetResponsePtr lRes;\n S3FS_TRY\n lRes = lCon->get(BUCKETNAME, path);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n#endif\n}\n\n#if 0\nstatic int\ns3_release(const char *path, struct fuse_file_info *fi)\n{\n fprintf(stderr, \"release path: '%s'\\n\", path);\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_EXIT(0);\n}\n\nstatic int\ns3_opendir(const char *path, struct fuse_file_info *fi)\n{\n fprintf(stderr, \"opendir: '%s'\\n\", path);\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_EXIT(0);\n}\n#endif\n\n\n\n\nstatic struct fuse_operations s3_filesystem_operations;\n\nint\nmain(int argc, char **argv)\n{\n \/\/ set callback functions\n s3_filesystem_operations.getattr = s3_getattr;\n s3_filesystem_operations.mkdir = s3_mkdir;\n s3_filesystem_operations.rmdir = s3_rmdir;\n s3_filesystem_operations.readdir = s3_readdir;\n s3_filesystem_operations.create = s3_create;\n \/\/ can't be supported because s3 doesn't allow to change meta data without putting the object again\n s3_filesystem_operations.read = s3_read;\n\n \/\/ initialization\n theFactory = AWSConnectionFactory::getInstance();\n\n theAccessKeyId = getenv(\"AWS_ACCESS_KEY\");\n theSecretAccessKey = getenv(\"AWS_SECRET_ACCESS_KEY\");\n\n if (theAccessKeyId.length() == 0) {\n std::cerr << \"Please specify the AWS_ACCESS_KEY environment variable\" << std::endl;\n return 1;\n }\n if (theSecretAccessKey.length() == 0) {\n std::cerr << \"Please specify the AWS_SECRET_ACCESS_KEY environment variable\" << std::endl;\n return 2;\n }\n\n \/\/ let's get started\n return fuse_main(argc, argv, &s3_filesystem_operations, NULL);\n}\n<commit_msg>fix s3fs for linux<commit_after>\/*\n * Copyright 2008 28msec, Inc.\n * \n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/**\n * mapping to s3\n * directory:\n * - empty object with the name of the dir, e.g. \/testdir\n * - metadata: \n * - dir : 1\n * - mode_t : int\n * - gid : int\n * - oid : int\n * file:\n * - object with the path\/name of the file, e.g. \/testdir\/testfile\n * - metadata:\n * - file: 1\n * - mode_t : int\n * - gid : int\n * - oid : int\n *\/\n#define _FILE_OFFSET_BITS 64\n#define FUSE_USE_VERSION 26\n#include <fuse.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <string.h>\n#include <iostream>\n#include <vector>\n#include <sys\/stat.h>\n#include <map>\n#include <sstream>\n\n#include <libaws\/aws.h>\n\nusing namespace aws;\n\n\nstatic AWSConnectionFactory* theFactory;\nstatic std::string theAccessKeyId;\nstatic std::string theSecretAccessKey;\nstatic std::string BUCKETNAME(\"msb\");\n\n\/**\n * accessor and release functions for S3 Connection objects\n *\/\nstatic S3ConnectionPtr getConnection() {\n return theFactory->createS3Connection(theAccessKeyId, theSecretAccessKey);\n}\n\nstatic void releaseConnection(const S3ConnectionPtr& aConnection) {\n}\n\n\/**\n * macro that should be used to exit a function\n * it releases the connection object used in the function and returns with the given return code\n *\/\n#define S3FS_EXIT(code) \\\n releaseConnection(lCon); \\\n return code;\n\n\/**\n * macros that should be used for try-catch combinations\n *\/\n#define S3FS_TRY try {\n\n#ifndef NDEBUG\n# define S3FS_CATCH(kind) \\\n } catch (kind ## Exception & s3Exception) { \\\n std::cerr << s3Exception.getErrorMessage() << std::endl; \\\n S3FS_EXIT(-ENOENT); \\\n } catch (AWSConnectionException & conException) { \\\n std::cerr << conException.what() << std::endl; \\\n S3FS_EXIT(-ECONNREFUSED); \\\n }\n#else\n# define S3FS_CATCH(kind) \\\n } catch (kind ## Exception & s3Exception) { \\\n std::cerr << s3Exception.what() << std::endl; \\\n S3FS_EXIT(-ENOENT); \\\n } catch (AWSConnectionException & conException) { \\\n std::cerr << conException.what() << std::endl; \\\n S3FS_EXIT(-ECONNREFUSED); \\\n }\n#endif\n\n\/\/ shorcuts\ntypedef std::map<std::string, std::string> map_t;\ntypedef std::pair<std::string, std::string> pair_t;\n\n\/** \n * helper functions\n *\/\nstatic mode_t\nto_int(const std::string s)\n{\n return (mode_t) atoi(s.c_str());\n}\n\nstatic std::string\nto_string(int i)\n{\n std::stringstream s;\n s << i;\n return s.str();\n}\n\nstatic void\nfill_stat(map_t& aMap, struct stat* stbuf, long long aContentLength)\n{\n stbuf->st_mode |= to_int(aMap[\"mode\"]);\n stbuf->st_gid |= to_int(aMap[\"gid\"]);\n stbuf->st_uid |= to_int(aMap[\"uid\"]);\n\n if (aMap.count(\"dir\") != 0) {\n stbuf->st_mode |= S_IFDIR;\n stbuf->st_nlink = 1;\n } else if (aMap.count(\"file\") != 0) {\n stbuf->st_mode |= S_IFREG;\n stbuf->st_nlink = 1;\n stbuf->st_size = 5;\n } \n \/\/ TODO date\n}\n\n\/** \n * operation functions\n *\/\nstatic int\ns3_getattr(const char *path, struct stat *stbuf)\n{\n#ifndef NDEBUG\n std::cerr << \"getattr path: \" << path << std::endl;\n#endif\n\n memset(stbuf, 0, sizeof(struct stat));\n\n \/\/ we always immediately exit if the root dir is requested.\n if (strcmp(path, \"\/\") == 0) { \/* The root directory of our file system. *\/\n stbuf->st_mode = S_IFDIR | 0755;\n stbuf->st_nlink = 2;\n#ifndef NDEBUG\n std::cerr << \" requested getattr for \/\" << std::endl;\n#endif\n return 0;\n }\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n\n \/\/ check if we have that path\n HeadResponsePtr lRes;\n lRes = lCon->head(BUCKETNAME, path);\n map_t lMap = lRes->getMetaData();\n#ifndef NDEBUG\n std::cerr << \" requested metadata for \" << path << std::endl;\n for (map_t::iterator lIter = lMap.begin(); lIter != lMap.end(); ++lIter) {\n std::cerr << \" got \" << (*lIter).first << \" : \" << (*lIter).second << std::endl;\n }\n std::cerr << \" content-length: \" << lRes->getContentLength() << std::endl;\n#endif\n\n \/\/ set the meta data in the stat struct\n fill_stat(lMap, stbuf, lRes->getContentLength());\n\n S3FS_EXIT(0);\n S3FS_CATCH(Head)\n}\n\nstatic int\ns3_mkdir(const char *path, mode_t mode)\n{\n#ifndef NDEBUG\n std::cerr << \"mkdir: \" << path << std::endl;\n std::cerr << \" mode: \" << mode << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n map_t lDirMap;\n lDirMap.insert(pair_t(\"dir\", \"1\"));\n lDirMap.insert(pair_t(\"gid\", to_string(getgid())));\n lDirMap.insert(pair_t(\"uid\", to_string(getuid())));\n lDirMap.insert(pair_t(\"mode\", to_string(mode)));\n PutResponsePtr lRes = lCon->put(BUCKETNAME, path, 0, \"text\/plain\", 0, &lDirMap);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n S3FS_EXIT(-ENOENT);\n}\n\nstatic int\ns3_rmdir(const char *path)\n{\n#ifndef NDEBUG\n std::cerr << \"rmdir: \" << path << std::endl;\n#endif\n S3ConnectionPtr lCon = getConnection();\n\n try {\n HeadResponsePtr lRes;\n lRes = lCon->head(BUCKETNAME, path);\n map_t lMap = lRes->getMetaData();\n if (lMap.count(\"dir\") == 0) {\n#ifndef NDEBUG\n std::cerr << \" not a directory\" << std::endl;\n#endif\n S3FS_EXIT(-ENOTTY); \n }\n } catch (HeadException &e) {\n if (e.getErrorCode() == aws::S3Exception::NoSuchKey) {\n#ifndef NDEBUG\n std::cerr << \" no such key\" << std::endl;\n#endif\n S3FS_EXIT(-ENOENT);\n }\n#ifndef NDEBU\n std::cerr << \" something unexpected happened: \" << e.getErrorMessage() << std::endl;\n#endif\n S3FS_EXIT(-ENOENT);\n }\n\n S3FS_TRY\n DeleteResponsePtr lRes = lCon->del(BUCKETNAME, path);\n S3FS_CATCH(Put)\n S3FS_EXIT(0);\n}\n\nstatic int\ns3_readdir(const char *path,\n void *buf,\n fuse_fill_dir_t filler,\n off_t offset,\n struct fuse_file_info *fi)\n{\n#ifndef NDEBUG\n std::cerr << \"readdir: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n\n filler(buf, \".\", NULL, 0);\n filler(buf, \"..\", NULL, 0);\n\n \/\/ TODO handle full buffer by remembering the marker\n\n std::string lPath(path);\n if (lPath.at(lPath.length()-1) != '\/')\n lPath += \"\/\";\n\n ListBucketResponsePtr lRes;\n S3FS_TRY\n std::string lMarker;\n do {\n lRes = lCon->listBucket(BUCKETNAME, lPath, lMarker, \"\/\", -1);\n lRes->open();\n ListBucketResponse::Object o;\n while (lRes->next(o)) {\n struct stat lStat;\n memset(&lStat, 0, sizeof(struct stat));\n\n#ifndef NDEBUG\n std::cerr << \" result: \" << o.KeyValue << std::endl;\n#endif\n std::string lTmp = o.KeyValue.replace(0, lPath.length(), \"\");\n filler(buf, lTmp.c_str(), NULL, 0);\n lMarker = o.KeyValue;\n }\n lRes->close();\n } while (lRes->isTruncated());\n\n S3FS_EXIT(0);\n S3FS_CATCH(ListBucket);\n\n S3FS_EXIT(-ENOENT);\n}\n\nstatic int\ns3_create(const char *path, mode_t mode, struct fuse_file_info *fs)\n{\n#ifndef NDEBUG\n std::cerr << \"create: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_TRY\n map_t lDirMap;\n lDirMap.insert(pair_t(\"file\", \"1\"));\n lDirMap.insert(pair_t(\"gid\", to_string(getgid())));\n lDirMap.insert(pair_t(\"uid\", to_string(getuid())));\n lDirMap.insert(pair_t(\"mode\", to_string(mode)));\n PutResponsePtr lRes = lCon->put(BUCKETNAME, path, 0, \"text\/plain\", 0, &lDirMap);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n S3FS_EXIT(-ENOENT);\n}\n\n\/\/ open, write, release\n\/\/ always use a temporary file\n\n\nstatic int\ns3_read(const char *path,\n char *buf,\n size_t size,\n off_t offset,\n struct fuse_file_info *fi)\n{\n#ifndef NDEBUG\n std::cerr << \"read: \" << path << std::endl;\n#endif\n\n S3ConnectionPtr lCon = getConnection();\n memcpy(buf, \"test\\n\", 5); \/* Provide the content. *\/\n return 5;\n#if 0\n GetResponsePtr lRes;\n S3FS_TRY\n lRes = lCon->get(BUCKETNAME, path);\n S3FS_EXIT(0);\n S3FS_CATCH(Put)\n#endif\n}\n\n#if 0\nstatic int\ns3_release(const char *path, struct fuse_file_info *fi)\n{\n fprintf(stderr, \"release path: '%s'\\n\", path);\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_EXIT(0);\n}\n\nstatic int\ns3_opendir(const char *path, struct fuse_file_info *fi)\n{\n fprintf(stderr, \"opendir: '%s'\\n\", path);\n\n S3ConnectionPtr lCon = getConnection();\n S3FS_EXIT(0);\n}\n#endif\n\n\n\n\nstatic struct fuse_operations s3_filesystem_operations;\n\nint\nmain(int argc, char **argv)\n{\n \/\/ set callback functions\n s3_filesystem_operations.getattr = s3_getattr;\n s3_filesystem_operations.mkdir = s3_mkdir;\n s3_filesystem_operations.rmdir = s3_rmdir;\n s3_filesystem_operations.readdir = s3_readdir;\n s3_filesystem_operations.create = s3_create;\n \/\/ can't be supported because s3 doesn't allow to change meta data without putting the object again\n s3_filesystem_operations.read = s3_read;\n\n \/\/ initialization\n theFactory = AWSConnectionFactory::getInstance();\n\n theAccessKeyId = getenv(\"AWS_ACCESS_KEY\");\n theSecretAccessKey = getenv(\"AWS_SECRET_ACCESS_KEY\");\n\n if (theAccessKeyId.length() == 0) {\n std::cerr << \"Please specify the AWS_ACCESS_KEY environment variable\" << std::endl;\n return 1;\n }\n if (theSecretAccessKey.length() == 0) {\n std::cerr << \"Please specify the AWS_SECRET_ACCESS_KEY environment variable\" << std::endl;\n return 2;\n }\n\n \/\/ let's get started\n return fuse_main(argc, argv, &s3_filesystem_operations, NULL);\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ (c) COPYRIGHT URI\/MIT 1995-1996\n\/\/ Please read the full copyright statement in the file COPYRIGH. \n\/\/\n\/\/ Authors:\n\/\/ jhrg,jimg James Gallagher (jgallagher@gso.uri.edu)\n\n\/\/ Implementation for the class TestStructure. See TestByte.cc\n\/\/\n\/\/ jhrg 1\/12\/95\n\n\/\/ $Log: TestSequence.cc,v $\n\/\/ Revision 1.14 1996\/08\/13 20:50:47 jimg\n\/\/ Changed definition of the read member function.\n\/\/\n\/\/ Revision 1.13 1996\/05\/31 23:30:28 jimg\n\/\/ Updated copyright notice.\n\/\/\n\/\/ Revision 1.12 1996\/05\/29 22:08:50 jimg\n\/\/ Made changes necessary to support CEs that return the value of a function\n\/\/ instead of the value of a variable. This was done so that it would be\n\/\/ possible to translate Sequences into Arrays without first reading the\n\/\/ entire sequence over the network.\n\/\/\n\/\/ Revision 1.11 1996\/05\/22 18:05:27 jimg\n\/\/ Merged files from the old netio directory into the dap directory.\n\/\/ Removed the errmsg library from the software.\n\/\/\n\/\/ Revision 1.10 1996\/04\/05 00:21:58 jimg\n\/\/ Compiled with g++ -Wall and fixed various warnings.\n\/\/\n\/\/ Revision 1.9 1995\/12\/09 01:07:23 jimg\n\/\/ Added changes so that relational operators will work properly for all the\n\/\/ datatypes (including Sequences). The relational ops are evaluated in\n\/\/ DDS::eval_constraint() after being parsed by DDS::parse_constraint().\n\/\/\n\/\/ Revision 1.8 1995\/12\/06 19:55:26 jimg\n\/\/ Changes read() member function from three arguments to two.\n\/\/\n\/\/ Revision 1.7 1995\/08\/26 00:31:58 jimg\n\/\/ Removed code enclosed in #ifdef NEVER #endif.\n\/\/\n\/\/ Revision 1.6 1995\/07\/09 21:29:18 jimg\n\/\/ Added copyright notice.\n\/\/\n\/\/ Revision 1.5 1995\/05\/10 17:35:31 jimg\n\/\/ Removed the header file `Test.h' from the Test*.cc implementation files.\n\/\/\n\/\/ Revision 1.4 1995\/03\/04 14:38:08 jimg\n\/\/ Modified these so that they fit with the changes in the DAP classes.\n\/\/\n\/\/ Revision 1.3 1995\/02\/10 02:33:46 jimg\n\/\/ Modified Test<class>.h and .cc so that they used to new definitions of\n\/\/ read_val().\n\/\/ Modified the classes read() so that they are more in line with the\n\/\/ class library's intended use in a real subclass set.\n\/\/\n\/\/ Revision 1.2 1995\/01\/19 21:59:00 jimg\n\/\/ Added read_val from dummy_read.cc to the sample set of sub-class\n\/\/ implementations.\n\/\/ Changed the declaration of readVal in BaseType so that it names the\n\/\/ mfunc read_val (to be consistant with the other mfunc names).\n\/\/ Removed the unnecessary duplicate declaration of the abstract virtual\n\/\/ mfuncs read and (now) read_val from the classes Byte, ... Grid. The\n\/\/ declaration in BaseType is sufficient along with the decl and definition\n\/\/ in the *.cc,h files which contain the subclasses for Byte, ..., Grid.\n\/\/\n\/\/ Revision 1.1 1995\/01\/19 20:20:51 jimg\n\/\/ Created as an example of subclassing the class hierarchy rooted at\n\/\/ BaseType.\n\/\/\n\n#ifdef _GNUG_\n#pragma implementation\n#endif\n\n#include \"TestSequence.h\"\n\nSequence *\nNewSequence(const String &n)\n{\n return new TestSequence(n);\n}\n\nBaseType *\nTestSequence::ptr_duplicate()\n{\n return new TestSequence(*this);\n}\n\nTestSequence::TestSequence(const String &n) : Sequence(n)\n{\n}\n\nTestSequence::~TestSequence()\n{\n}\n\nbool \nTestSequence::read(const String &, int &)\n{\n if (read_p())\n\treturn true;\n\n set_read_p(true);\n \n return true;\n}\n\nunsigned int\nTestSequence::length()\n{\n return 0;\n}\n<commit_msg>Changed return type of length member function.<commit_after>\n\/\/ (c) COPYRIGHT URI\/MIT 1995-1996\n\/\/ Please read the full copyright statement in the file COPYRIGH. \n\/\/\n\/\/ Authors:\n\/\/ jhrg,jimg James Gallagher (jgallagher@gso.uri.edu)\n\n\/\/ Implementation for the class TestStructure. See TestByte.cc\n\/\/\n\/\/ jhrg 1\/12\/95\n\n\/\/ $Log: TestSequence.cc,v $\n\/\/ Revision 1.15 1997\/07\/15 21:54:57 jimg\n\/\/ Changed return type of length member function.\n\/\/\n\/\/ Revision 1.14 1996\/08\/13 20:50:47 jimg\n\/\/ Changed definition of the read member function.\n\/\/\n\/\/ Revision 1.13 1996\/05\/31 23:30:28 jimg\n\/\/ Updated copyright notice.\n\/\/\n\/\/ Revision 1.12 1996\/05\/29 22:08:50 jimg\n\/\/ Made changes necessary to support CEs that return the value of a function\n\/\/ instead of the value of a variable. This was done so that it would be\n\/\/ possible to translate Sequences into Arrays without first reading the\n\/\/ entire sequence over the network.\n\/\/\n\/\/ Revision 1.11 1996\/05\/22 18:05:27 jimg\n\/\/ Merged files from the old netio directory into the dap directory.\n\/\/ Removed the errmsg library from the software.\n\/\/\n\/\/ Revision 1.10 1996\/04\/05 00:21:58 jimg\n\/\/ Compiled with g++ -Wall and fixed various warnings.\n\/\/\n\/\/ Revision 1.9 1995\/12\/09 01:07:23 jimg\n\/\/ Added changes so that relational operators will work properly for all the\n\/\/ datatypes (including Sequences). The relational ops are evaluated in\n\/\/ DDS::eval_constraint() after being parsed by DDS::parse_constraint().\n\/\/\n\/\/ Revision 1.8 1995\/12\/06 19:55:26 jimg\n\/\/ Changes read() member function from three arguments to two.\n\/\/\n\/\/ Revision 1.7 1995\/08\/26 00:31:58 jimg\n\/\/ Removed code enclosed in #ifdef NEVER #endif.\n\/\/\n\/\/ Revision 1.6 1995\/07\/09 21:29:18 jimg\n\/\/ Added copyright notice.\n\/\/\n\/\/ Revision 1.5 1995\/05\/10 17:35:31 jimg\n\/\/ Removed the header file `Test.h' from the Test*.cc implementation files.\n\/\/\n\/\/ Revision 1.4 1995\/03\/04 14:38:08 jimg\n\/\/ Modified these so that they fit with the changes in the DAP classes.\n\/\/\n\/\/ Revision 1.3 1995\/02\/10 02:33:46 jimg\n\/\/ Modified Test<class>.h and .cc so that they used to new definitions of\n\/\/ read_val().\n\/\/ Modified the classes read() so that they are more in line with the\n\/\/ class library's intended use in a real subclass set.\n\/\/\n\/\/ Revision 1.2 1995\/01\/19 21:59:00 jimg\n\/\/ Added read_val from dummy_read.cc to the sample set of sub-class\n\/\/ implementations.\n\/\/ Changed the declaration of readVal in BaseType so that it names the\n\/\/ mfunc read_val (to be consistant with the other mfunc names).\n\/\/ Removed the unnecessary duplicate declaration of the abstract virtual\n\/\/ mfuncs read and (now) read_val from the classes Byte, ... Grid. The\n\/\/ declaration in BaseType is sufficient along with the decl and definition\n\/\/ in the *.cc,h files which contain the subclasses for Byte, ..., Grid.\n\/\/\n\/\/ Revision 1.1 1995\/01\/19 20:20:51 jimg\n\/\/ Created as an example of subclassing the class hierarchy rooted at\n\/\/ BaseType.\n\/\/\n\n#ifdef _GNUG_\n#pragma implementation\n#endif\n\n#include \"TestSequence.h\"\n\nSequence *\nNewSequence(const String &n)\n{\n return new TestSequence(n);\n}\n\nBaseType *\nTestSequence::ptr_duplicate()\n{\n return new TestSequence(*this);\n}\n\nTestSequence::TestSequence(const String &n) : Sequence(n)\n{\n}\n\nTestSequence::~TestSequence()\n{\n}\n\nbool \nTestSequence::read(const String &, int &)\n{\n if (read_p())\n\treturn true;\n\n set_read_p(true);\n \n return true;\n}\n\nint\nTestSequence::length()\n{\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ PNM Reader -- Written by Eric Sokolowsky\n\/\/ Reads Ascii and Binary files in the PPM, PGM, and PBM formats.\n\n#include <osg\/Image>\n#include <osg\/Notify>\n#include <osg\/Endian>\n\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/FileUtils>\n#include <osgDB\/fstream>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <sstream>\n\nusing namespace osg;\n\ntemplate <class T>\n unsigned char* read_bitmap_ascii(std::istream& fin, int width, int height)\n{\n T* data = new T[width*height];\n\n T* dst = data;\n T* end = data + width*height;\n T value = 0;\n unsigned long num;\n\n while(dst < end)\n {\n \/\/ read in characters looking for '0's and '1's, these\n \/\/ values map to 255 and 0. Any other characters\n \/\/ are silently ignored.\n fin >> num;\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n if (num == 1)\n {\n value = 0;\n break;\n }\n else if (num == 0)\n {\n value = 255;\n break;\n }\n\n \/\/ place value in the image\n *(dst++) = value;\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_grayscale_ascii(std::istream& fin, int width, int height)\n{\n T* data = new T[width*height];\n\n T* dst = data;\n T* end = data + width*height;\n T value = 0;\n unsigned long num;\n\n while(dst < end)\n {\n fin >> num;\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ place value in the image\n *(dst++) = value;\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_color_ascii(std::istream& fin, int width, int height)\n{\n T* data = new T[3*width*height];\n\n T* dst = data;\n T* end = data + 3*width*height;\n T value = 0;\n unsigned long num;\n\n while(dst < end)\n {\n fin >> num;\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ place value in the image\n *(dst++) = value;\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_bitmap_binary(std::istream& fin, int width, int height)\n{\n T* data = new T[width*height];\n\n for(int y = 0; y < height; y++)\n {\n T* dst = data + (y+0)*width;\n T* end = data + (y+1)*width;\n\n while(dst < end)\n {\n unsigned char b = (unsigned char) fin.get();\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n for(int i = 7; i >= 0 && dst < end; i--)\n {\n \/\/ 1 means black, 0 means white\n T data_value = (b & (1<<i)) ? 0 : 255;\n *(dst++) = data_value;\n }\n }\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_grayscale_binary(std::istream& fin, int width, int height)\n{\n unsigned char* data = new unsigned char[sizeof(T)*width*height];\n\n fin.read((char*)data, sizeof(T)*width*height);\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ if the machine is little endian swap the bytes around\n if (sizeof(T) == 2 && getCpuByteOrder() == osg::LittleEndian)\n {\n for(int i = 0; i < width*height; i++)\n {\n unsigned char* bs = (unsigned char*)(&data[i]);\n std::swap(bs[0], bs[1]);\n }\n }\n\n return data;\n}\n\ntemplate <class T>\n unsigned char* read_color_binary(std::istream& fin, int width, int height)\n{\n unsigned char* data = new unsigned char[sizeof(T)*3*width*height];\n\n fin.read((char*)data, sizeof(T)*3*width*height);\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ if the machine is little endian swap the bytes around\n if (sizeof(T) == 2 && getCpuByteOrder() == osg::LittleEndian)\n {\n for(int i = 0; i < 3*width*height; i++)\n {\n unsigned char* bs = (unsigned char*)(&data[i]);\n std::swap(bs[0], bs[1]);\n }\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\nclass ReaderWriterPNM : public osgDB::ReaderWriter\n{\n public:\n ReaderWriterPNM()\n {\n supportsExtension(\"pnm\",\"PNM Image format\");\n supportsExtension(\"ppm\",\"PNM Image format\");\n supportsExtension(\"pgm\",\"PNM Image format\");\n supportsExtension(\"pbm\",\"PNM Image format\");\n }\n \n virtual const char* className() const { return \"PNM Image Reader\/Writer\"; }\n\n virtual ReadResult readImage(std::istream& fin, const osgDB::ReaderWriter::Options* options=NULL) const\n {\n int ppmtype = 0; \/* P1, P2, etc. *\/\n int width = 0;\n int height = 0;\n int max_value = 0;\n\n \/\/ Read header items.\n std::string line;\n int row;\n for (row = 1; row <= 3; row++)\n {\n getline(fin, line);\n if (!fin.good())\n return ReadResult::ERROR_IN_READING_FILE;\n\n const char *cp = line.c_str();\n while (*cp && isspace(*cp))\n cp++;\n if (! *cp || *cp == '#')\n {\n \/\/ Skip comment lines.\n row--;\n }\n else if (row == 1)\n {\n \/\/ Get the image type.\n if (line[0] == 'p' || line[0] == 'P')\n {\n ppmtype = line[1] - '0';\n }\n }\n else if (row == 2)\n {\n std::istringstream istr(line);\n\n istr >> width;\n istr >> height;\n\n \/\/ pbm files don't have row 3\n if (ppmtype == 1 || ppmtype == 4)\n {\n max_value = 1;\n break;\n }\n }\n else if (row == 3)\n {\n \/\/ Get the maximum value\n std::istringstream istr(line);\n istr >> max_value;\n }\n }\n\n \/\/ Check for valid values.\n if (width <= 0 || height <= 0 ||\n max_value <= 0 || max_value > 65535 ||\n ppmtype < 1 || ppmtype > 6)\n {\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n int pixelFormat = 0;\n int dataType = 0;\n unsigned char* data = NULL;\n\n if (max_value > 255)\n {\n OSG_NOTICE<<\"OpenSceneGraph PPM reader: width=\"<<width<<\" height=\"<<height<<std::endl;\n dataType = GL_UNSIGNED_SHORT;\n switch(ppmtype)\n {\n case 1: \/\/ bitmap ascii\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_ascii<unsigned short>(fin, width, height);\n break;\n case 2: \/\/ grayscale ascii\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_ascii<unsigned short>(fin, width, height);\n break;\n case 3: \/\/ color ascii\n pixelFormat = GL_RGB;\n data = read_color_ascii<unsigned short>(fin, width, height);\n break;\n case 4: \/\/ bitmap binary\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_binary<unsigned short>(fin, width, height);\n break;\n case 5: \/\/ grayscale binary\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_binary<unsigned short>(fin, width, height);\n break;\n case 6: \/\/ color binary\n pixelFormat = GL_RGB;\n data = read_color_binary<unsigned short>(fin, width, height);\n break;\n }\n }\n else\n {\n dataType = GL_UNSIGNED_BYTE;\n switch(ppmtype)\n {\n case 1: \/\/ bitmap ascii\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_ascii<unsigned char>(fin, width, height);\n break;\n case 2: \/\/ grayscale ascii\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_ascii<unsigned char>(fin, width, height);\n break;\n case 3: \/\/ color ascii\n pixelFormat = GL_RGB;\n data = read_color_ascii<unsigned char>(fin, width, height);\n break;\n case 4: \/\/ bitmap binary\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_binary<unsigned char>(fin, width, height);\n break;\n case 5: \/\/ grayscale binary\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_binary<unsigned char>(fin, width, height);\n break;\n case 6: \/\/ color binary\n pixelFormat = GL_RGB;\n data = read_color_binary<unsigned char>(fin, width, height);\n break;\n }\n }\n\n if (data == NULL)\n {\n return ReadResult::FILE_NOT_HANDLED;\n }\n\n osg::Image* pOsgImage = new osg::Image();\n\n pOsgImage->setImage(width, height, 1,\n pixelFormat,\n pixelFormat,\n dataType,\n data,\n osg::Image::USE_NEW_DELETE);\n\n if (options && options->getOptionString().find(\"flip\")!=std::string::npos)\n {\n pOsgImage->flipVertical();\n }\n\n return pOsgImage;\n }\n\n virtual ReadResult readImage(const std::string& file, const osgDB::ReaderWriter::Options* options) const\n {\n std::string ext = osgDB::getLowerCaseFileExtension(file);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName = osgDB::findDataFile( file, options );\n if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n std::ifstream fin(fileName.c_str());\n if (!fin.good())\n return ReadResult::ERROR_IN_READING_FILE;\n\n ReadResult rr = readImage(fin, options);\n fin.close();\n if (rr.validImage()) rr.getImage()->setFileName(file);\n return rr;\n }\n\n virtual WriteResult writeImage(const osg::Image& image,std::ostream& fout,const osgDB::ReaderWriter::Options* options) const\n {\n bool ascii = (options && options->getOptionString().find(\"ascii\")!=std::string::npos);\n\n if (ascii)\n {\n \/\/ ascii ppm format.\n fout<<\"P3\"<<std::endl;\n fout<<image.s()<<\" \"<<image.t()<<std::endl;\n fout<<\"255\"<<std::endl;\n for(int row = image.t()-1; row >= 0; --row)\n {\n const unsigned char* ptr = image.data(0,row);\n for(int col = 0; col < image.s(); ++col)\n {\n fout<<static_cast<int>(*(ptr++));\n fout<<\" \"<<static_cast<int>(*(ptr++));\n fout<<\" \"<<static_cast<int>(*(ptr++))<<\" \";\n }\n fout<<std::endl;\n }\n }\n else\n {\n \/\/ binary ppm format \n fout<<\"P6\"<<std::endl;\n fout<<image.s()<<\" \"<<image.t()<<std::endl;\n fout<<\"255\"<<std::endl;\n for(int row = image.t()-1; row >= 0; --row)\n {\n const unsigned char* ptr = image.data(0,row);\n for(int col = 0; col < image.s(); ++col)\n {\n fout.put(*(ptr++));\n fout.put(*(ptr++));\n fout.put(*(ptr++));\n }\n }\n }\n return WriteResult::FILE_SAVED;\n }\n\n virtual WriteResult writeImage(const osg::Image& image,const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n {\n \/\/ Only ppm format output supported\n std::string ext = osgDB::getFileExtension(fileName);\n if ( !osgDB::equalCaseInsensitive(ext, \"ppm\") ) return WriteResult::FILE_NOT_HANDLED;\n \n \/\/ only support rgb images right now.\n if (image.getPixelFormat()!=GL_RGB || image.getDataType()!=GL_UNSIGNED_BYTE) return WriteResult(\"Error image pixel format not supported by pnm writer.\");\n\n osgDB::ofstream fout(fileName.c_str(), std::ios::out | std::ios::binary);\n if(!fout) return WriteResult::ERROR_IN_WRITING_FILE;\n\n return writeImage(image,fout,options);\n }\n\n\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(pnm, ReaderWriterPNM)\n<commit_msg>From Eric Sokolowsky, \"Attached is an updated PNM plugin for inclusion in both the trunk and for release version 2.8.5. The attached file fixes numerous bugs in reading 8-bit and 16-bit images, including loading the images upside-down. This file also incorporates trunk patch r12220 which updated the plugin for reading and writing images through streams instead of C-style FILE I\/O.\"<commit_after>\/\/ PNM Reader -- Written by Eric Sokolowsky\n\/\/ Reads Ascii and Binary files in the PPM, PGM, and PBM formats.\n\n#include <osg\/Image>\n#include <osg\/Notify>\n#include <osg\/Endian>\n\n#include <osgDB\/Registry>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/FileUtils>\n#include <osgDB\/fstream>\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <sstream>\n\nusing namespace osg;\n\ntemplate <class T>\n unsigned char* read_bitmap_ascii(std::istream& fin, int width, int height)\n{\n T* data = new T[width*height];\n\n\n {\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n {\n }\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n{\n T* data = new T[width*height];\n\n\n {\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ place value in the image\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n{\n T* data = new T[3*width*height];\n\n\n {\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n \/\/ place value in the image\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_bitmap_binary(std::istream& fin, int width, int height)\n{\n T* data = new T[width*height];\n\n {\n T* dst = data + (y+0)*width;\n T* end = data + (y+1)*width;\n\n while(dst < end)\n {\n unsigned char b = (unsigned char) fin.get();\n if (!fin.good())\n {\n delete [] data;\n return NULL;\n }\n\n for(int i = 7; i >= 0 && dst < end; i--)\n {\n \/\/ 1 means black, 0 means white\n T data_value = (b & (1<<i)) ? 0 : 255;\n *(dst++) = data_value;\n }\n }\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\ntemplate <class T>\n unsigned char* read_grayscale_binary(std::istream& fin, int width, int height)\n{\n\n {\n }\n\n \/\/ if the machine is little endian swap the bytes around\n if (sizeof(T) == 2 && getCpuByteOrder() == osg::LittleEndian)\n {\n {\n std::swap(bs[0], bs[1]);\n }\n }\n\n}\n\ntemplate <class T>\n unsigned char* read_color_binary(std::istream& fin, int width, int height)\n{\n\n {\n }\n\n \/\/ if the machine is little endian swap the bytes around\n if (sizeof(T) == 2 && getCpuByteOrder() == osg::LittleEndian)\n {\n {\n std::swap(bs[0], bs[1]);\n }\n }\n\n return reinterpret_cast<unsigned char*>(data);\n}\n\nclass ReaderWriterPNM : public osgDB::ReaderWriter\n{\n public:\n ReaderWriterPNM()\n {\n supportsExtension(\"pnm\",\"PNM Image format\");\n supportsExtension(\"ppm\",\"PNM Image format\");\n supportsExtension(\"pgm\",\"PNM Image format\");\n supportsExtension(\"pbm\",\"PNM Image format\");\n }\n \n virtual const char* className() const { return \"PNM Image Reader\/Writer\"; }\n\n virtual ReadResult readImage(std::istream& fin, const osgDB::ReaderWriter::Options* options=NULL) const\n {\n int ppmtype = 0; \/* P1, P2, etc. *\/\n int width = 0;\n int height = 0;\n int max_value = 0;\n\n \/\/ Read header items.\n std::string line;\n int row;\n for (row = 1; row <= 3; row++)\n {\n getline(fin, line);\n if (!fin.good())\n return ReadResult::ERROR_IN_READING_FILE;\n\n const char *cp = line.c_str();\n while (*cp && isspace(*cp))\n cp++;\n if (! *cp || *cp == '#')\n {\n \/\/ Skip comment lines.\n row--;\n }\n else if (row == 1)\n {\n \/\/ Get the image type.\n if (line[0] == 'p' || line[0] == 'P')\n {\n ppmtype = line[1] - '0';\n }\n }\n else if (row == 2)\n {\n std::istringstream istr(line);\n\n istr >> width;\n istr >> height;\n\n \/\/ pbm files don't have row 3\n if (ppmtype == 1 || ppmtype == 4)\n {\n max_value = 1;\n break;\n }\n }\n else if (row == 3)\n {\n \/\/ Get the maximum value\n std::istringstream istr(line);\n istr >> max_value;\n }\n }\n\n \/\/ Check for valid values.\n if (width <= 0 || height <= 0 ||\n max_value <= 0 || max_value > 65535 ||\n ppmtype < 1 || ppmtype > 6)\n {\n return ReadResult::ERROR_IN_READING_FILE;\n }\n\n int pixelFormat = 0;\n int dataType = 0;\n unsigned char* data = NULL;\n\n if (max_value > 255)\n {\n dataType = GL_UNSIGNED_SHORT;\n switch(ppmtype)\n {\n case 2: \/\/ grayscale ascii\n pixelFormat = GL_LUMINANCE;\n break;\n case 3: \/\/ color ascii\n pixelFormat = GL_RGB;\n break;\n case 5: \/\/ grayscale binary\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_binary<unsigned short>(fin, width, height);\n break;\n case 6: \/\/ color binary\n pixelFormat = GL_RGB;\n data = read_color_binary<unsigned short>(fin, width, height);\n break;\n }\n }\n else\n {\n dataType = GL_UNSIGNED_BYTE;\n switch(ppmtype)\n {\n case 1: \/\/ bitmap ascii\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_ascii<unsigned char>(fin, width, height);\n break;\n case 2: \/\/ grayscale ascii\n pixelFormat = GL_LUMINANCE;\n break;\n case 3: \/\/ color ascii\n pixelFormat = GL_RGB;\n break;\n case 4: \/\/ bitmap binary\n pixelFormat = GL_LUMINANCE;\n data = read_bitmap_binary<unsigned char>(fin, width, height);\n break;\n case 5: \/\/ grayscale binary\n pixelFormat = GL_LUMINANCE;\n data = read_grayscale_binary<unsigned char>(fin, width, height);\n break;\n case 6: \/\/ color binary\n pixelFormat = GL_RGB;\n data = read_color_binary<unsigned char>(fin, width, height);\n break;\n }\n }\n\n if (data == NULL)\n {\n return ReadResult::FILE_NOT_HANDLED;\n }\n\n osg::Image* pOsgImage = new osg::Image();\n\n pOsgImage->setImage(width, height, 1,\n pixelFormat,\n pixelFormat,\n dataType,\n data,\n osg::Image::USE_NEW_DELETE);\n\n if (options && options->getOptionString().find(\"flip\")!=std::string::npos)\n {\n pOsgImage->flipVertical();\n }\n\n return pOsgImage;\n }\n\n virtual ReadResult readImage(const std::string& file, const osgDB::ReaderWriter::Options* options) const\n {\n std::string ext = osgDB::getLowerCaseFileExtension(file);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName = osgDB::findDataFile( file, options );\n if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n std::ifstream fin(fileName.c_str());\n if (!fin.good())\n return ReadResult::ERROR_IN_READING_FILE;\n\n ReadResult rr = readImage(fin, options);\n fin.close();\n if (rr.validImage()) rr.getImage()->setFileName(file);\n return rr;\n }\n\n virtual WriteResult writeImage(const osg::Image& image,std::ostream& fout,const osgDB::ReaderWriter::Options* options) const\n {\n bool ascii = (options && options->getOptionString().find(\"ascii\")!=std::string::npos);\n\n if (ascii)\n {\n \/\/ ascii ppm format.\n fout<<\"P3\"<<std::endl;\n fout<<image.s()<<\" \"<<image.t()<<std::endl;\n fout<<\"255\"<<std::endl;\n for(int row = image.t()-1; row >= 0; --row)\n {\n const unsigned char* ptr = image.data(0,row);\n for(int col = 0; col < image.s(); ++col)\n {\n fout<<static_cast<int>(*(ptr++));\n fout<<\" \"<<static_cast<int>(*(ptr++));\n fout<<\" \"<<static_cast<int>(*(ptr++))<<\" \";\n }\n fout<<std::endl;\n }\n }\n else\n {\n \/\/ binary ppm format \n fout<<\"P6\"<<std::endl;\n fout<<image.s()<<\" \"<<image.t()<<std::endl;\n fout<<\"255\"<<std::endl;\n for(int row = image.t()-1; row >= 0; --row)\n {\n const unsigned char* ptr = image.data(0,row);\n for(int col = 0; col < image.s(); ++col)\n {\n fout.put(*(ptr++));\n fout.put(*(ptr++));\n fout.put(*(ptr++));\n }\n }\n }\n return WriteResult::FILE_SAVED;\n }\n\n virtual WriteResult writeImage(const osg::Image& image,const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n {\n \/\/ Only ppm format output supported\n std::string ext = osgDB::getFileExtension(fileName);\n if ( !osgDB::equalCaseInsensitive(ext, \"ppm\") ) return WriteResult::FILE_NOT_HANDLED;\n \n \/\/ only support rgb images right now.\n if (image.getPixelFormat()!=GL_RGB || image.getDataType()!=GL_UNSIGNED_BYTE) return WriteResult(\"Error image pixel format not supported by pnm writer.\");\n\n osgDB::ofstream fout(fileName.c_str(), std::ios::out | std::ios::binary);\n if(!fout) return WriteResult::ERROR_IN_WRITING_FILE;\n\n return writeImage(image,fout,options);\n }\n\n\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nREGISTER_OSGPLUGIN(pnm, ReaderWriterPNM)\n<|endoftext|>"} {"text":"<commit_before>#include \"Hotkeys.h\"\n\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"UIContext.h\"\n#include \"resource.h\"\n\nDLGPROC Hotkeys::Command(unsigned short nCode, unsigned short ctrlId) {\n switch (nCode) {\n case BN_CLICKED:\n break;\n\n case CBN_SELCHANGE:\n break;\n }\n\n return FALSE;\n}\n\nDLGPROC Hotkeys::Notification(NMHDR *nHdr) {\n return FALSE;\n}\n\nvoid Hotkeys::Initialize() {\n\n}\n\nvoid Hotkeys::LoadSettings() {\n Settings *settings = Settings::Instance();\n\n \/* Make highlighted items span the entire row in the list view *\/\n _ctxt->AddWindowExStyle(LST_KEYS, LVS_EX_FULLROWSELECT);\n\n RECT dims = _ctxt->GetWindowDimensions(LST_KEYS);\n int width = dims.right - dims.left;\n\n _ctxt->AddListColumn(LST_KEYS, 0, L\"Hotkeys\", (int) (width * .485));\n _ctxt->AddListColumn(LST_KEYS, 0, L\"Action\", (int) (width * .445));\n}\n\nvoid Hotkeys::SaveSettings() {\n if (_hWnd == NULL) {\n return;\n }\n\n CLOG(L\"Saving: Hotkeys\");\n Settings *settings = Settings::Instance();\n}\n\n<commit_msg>Include common controls<commit_after>#include \"Hotkeys.h\"\n\n#include <CommCtrl.h>\n\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"UIContext.h\"\n#include \"resource.h\"\n\nDLGPROC Hotkeys::Command(unsigned short nCode, unsigned short ctrlId) {\n switch (nCode) {\n case BN_CLICKED:\n break;\n\n case CBN_SELCHANGE:\n break;\n }\n\n return FALSE;\n}\n\nDLGPROC Hotkeys::Notification(NMHDR *nHdr) {\n return FALSE;\n}\n\nvoid Hotkeys::Initialize() {\n\n}\n\nvoid Hotkeys::LoadSettings() {\n Settings *settings = Settings::Instance();\n\n \/* Make highlighted items span the entire row in the list view *\/\n _ctxt->AddWindowExStyle(LST_KEYS, LVS_EX_FULLROWSELECT);\n\n RECT dims = _ctxt->GetWindowDimensions(LST_KEYS);\n int width = dims.right - dims.left;\n\n _ctxt->AddListColumn(LST_KEYS, 0, L\"Hotkeys\", (int) (width * .485));\n _ctxt->AddListColumn(LST_KEYS, 0, L\"Action\", (int) (width * .445));\n}\n\nvoid Hotkeys::SaveSettings() {\n if (_hWnd == NULL) {\n return;\n }\n\n CLOG(L\"Saving: Hotkeys\");\n Settings *settings = Settings::Instance();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Hotkeys.h\"\n\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"UIContext.h\"\n#include \"resource.h\"\n\nDLGPROC Hotkeys::Command(unsigned short nCode, unsigned short ctrlId) {\n switch (nCode) {\n case BN_CLICKED:\n break;\n\n case CBN_SELCHANGE:\n }\n\n return FALSE;\n}\n\nDLGPROC Hotkeys::Notification(NMHDR *nHdr) {\n return FALSE;\n}\n\nvoid Hotkeys::LoadSettings() {\n Settings *settings = Settings::Instance();\n}\n\nvoid Hotkeys::SaveSettings() {\n if (_hWnd == NULL) {\n return;\n }\n\n CLOG(L\"Saving: Hotkeys\");\n Settings *settings = Settings::Instance();\n\n}\n\n<commit_msg>It might be helpful if this actually compiled<commit_after>#include \"Hotkeys.h\"\n\n#include \"..\/3RVX\/Logger.h\"\n#include \"..\/3RVX\/Settings.h\"\n#include \"..\/3RVX\/SkinInfo.h\"\n\n#include \"UIContext.h\"\n#include \"resource.h\"\n\nDLGPROC Hotkeys::Command(unsigned short nCode, unsigned short ctrlId) {\n switch (nCode) {\n case BN_CLICKED:\n break;\n\n case CBN_SELCHANGE:\n break;\n }\n\n return FALSE;\n}\n\nDLGPROC Hotkeys::Notification(NMHDR *nHdr) {\n return FALSE;\n}\n\nvoid Hotkeys::LoadSettings() {\n Settings *settings = Settings::Instance();\n}\n\nvoid Hotkeys::SaveSettings() {\n if (_hWnd == NULL) {\n return;\n }\n\n CLOG(L\"Saving: Hotkeys\");\n Settings *settings = Settings::Instance();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <string>\n#include <cstdlib>\n\n\/\/Change these values according to your image\n#define IMAGE_HEIGHT 32 \n#define IMAGE_WIDTH 32\n\nvoid decode(std::string, int*, int*);\n\nint main()\n{\n\tstd::string line;\n\tstd::ifstream file (\"pic.txt\"); \/\/Input file\n\t\n\tif(!file.is_open())\n\t{\n\t\tstd::cout << \"Error opening file.\" << std::endl;\n\t\texit(1);\n\t}\n\n\tstd::string delimiter = \", \";\n\tsize_t pos = 0;\n\tstd::string token;\n\tint hex = 0x00, add = 128, counter = 0, inc = 0;\n\tint image_area = IMAGE_HEIGHT * IMAGE_WIDTH;\n\tint arr_size = image_area \/ 8;\n\t\n\tif(image_area % 8 > 0)\n\t\tarr_size += 1;\n\t\t\n\tint hexarr[arr_size]; \n\n\tfor(int i=0; i < IMAGE_HEIGHT; i++)\n\t{\n\t\tstd::getline(file, line);\n\n\t\twhile((pos = line.find(delimiter)) != std::string::npos)\n\t\t{\n\t\t\ttoken = line.substr(0, pos);\t\t\n\t\t\tdecode(token, &hex, &add);\n\t\t\t\n\t\t\tline.erase(0, pos + delimiter.length());\n\t\t\tif(counter < 7)\n\t\t\t{\t\t\t\n\t\t\t\tcounter++;\n\t\t\t\tadd \/= 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcounter = 0;\n\t\t\t\tadd = 128;\n\t\t\t\thexarr[inc++] = hex;\n\t\t\t\thex = 0;\n\t\t\t}\t\n\t\t}\n\n\t\tif(i == IMAGE_HEIGHT-1)\n\t\t{\n\t\t\tdecode(line, &hex, &add);\n\t\t\thexarr[inc] = hex;\n\n\t\t\tif(image_area % 8 > 0)\n\t\t\t\thexarr[inc] << image_area % 8;\n\t\t}\n\t\t\t\n\t\tstd::cout << \"\\n\";\n\t}\n\t\n\tfile.close();\n\n\tstd::ofstream outfile (\"hex.txt\"); \/\/Output file\n\n\tif(!outfile.is_open())\n\t{\n\t\tstd::cout << \"Error opening file.\" << std::endl;\n\t\texit(1);\n\t}\n\n\tfor(int i=0; i < arr_size; i++)\n\t{\n\t\tstd::cout << std::showbase << std::internal << std::setfill('0');\n\t\toutfile << std::showbase << std::internal << std::setfill('0');\n\t\tif(hexarr[i] != 0)\n\t\t{\n\t\t\tstd::cout << std::hex << std::setw(4) << hexarr[i] << \" \";\n\t\t\toutfile << std::hex << std::setw(4) << hexarr[i];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \"0x00 \";\n\t\t\toutfile << \"0x00\";\n\t\t}\n\t\toutfile << \", \";\n\t\tif((i+1) % 12 == 0)\n\t\t{\n\t\t\tstd::cout << \"\\n\";\n\t\t\toutfile << \"\\n\";\n\t\t}\n\t\telse if(i == arr_size - 1)\n\t\t\tstd::cout << \"\\n\";\n\t}\n\t\n\toutfile.close();\n\n\treturn 0;\t\n}\n\nvoid decode(std::string parsed_string, int *hex, int *add)\n{\n\tif(parsed_string == \"0x00000000\")\n\t{\n\t\tstd::cout << \"0\";\n\t}\n\telse if (parsed_string == \"0xff000000\")\n\t{\n\t\tstd::cout << \"1\";\n\t\t*hex += *add;\n\t}\n}\n<commit_msg>Update ArraytoHex.cpp<commit_after>#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <string>\n#include <cstdlib>\n\n\/\/Change these values according to your image\n#define IMAGE_HEIGHT 32 \n#define IMAGE_WIDTH 32\n\nvoid decode(std::string, int*, int*);\n\nint main()\n{\n\tstd::string line;\n\tstd::ifstream file (\"pic.txt\"); \/\/Input file\n\t\n\tif(!file.is_open())\n\t{\n\t\tstd::cout << \"Error opening file.\" << std::endl;\n\t\texit(1);\n\t}\n\n\tstd::string delimiter = \", \";\n\tsize_t pos = 0;\n\tstd::string token;\n\tint hex = 0x00, add = 128, counter = 0, inc = 0;\n\tint image_area = IMAGE_HEIGHT * IMAGE_WIDTH;\n\tint arr_size = image_area \/ 8;\n\t\n\tif(image_area % 8 > 0)\n\t\tarr_size += 1;\n\t\t\n\tint hexarr[arr_size]; \n\n\tfor(int i=0; i < IMAGE_HEIGHT; i++)\n\t{\n\t\tstd::getline(file, line);\n\n\t\twhile((pos = line.find(delimiter)) != std::string::npos)\n\t\t{\n\t\t\ttoken = line.substr(0, pos);\t\t\n\t\t\tdecode(token, &hex, &add);\n\t\t\t\n\t\t\tline.erase(0, pos + delimiter.length());\n\t\t\tif(counter < 7)\n\t\t\t{\t\t\t\n\t\t\t\tcounter++;\n\t\t\t\tadd \/= 2;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcounter = 0;\n\t\t\t\tadd = 128;\n\t\t\t\thexarr[inc++] = hex;\n\t\t\t\thex = 0;\n\t\t\t}\t\n\t\t}\n\n\t\tif(i == IMAGE_HEIGHT-1)\n\t\t{\n\t\t\tdecode(line, &hex, &add);\n\t\t\thexarr[inc] = hex;\n\n\t\t\tif(image_area % 8 > 0)\n\t\t\t\thexarr[inc] << image_area % 8;\n\t\t}\n\t\t\t\n\t\tstd::cout << \"\\n\";\n\t}\n\t\n\tfile.close();\n\n\tstd::ofstream outfile (\"hex.txt\"); \/\/Output file\n\n\tif(!outfile.is_open())\n\t{\n\t\tstd::cout << \"Error opening file.\" << std::endl;\n\t\texit(1);\n\t}\n\n\tfor(int i=0; i < arr_size; i++)\n\t{\n\t\tstd::cout << std::showbase << std::internal << std::setfill('0');\n\t\toutfile << std::showbase << std::internal << std::setfill('0');\n\t\tif(hexarr[i] != 0)\n\t\t{\n\t\t\tstd::cout << std::hex << std::setw(4) << hexarr[i] << \" \";\n\t\t\toutfile << std::hex << std::setw(4) << hexarr[i];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \"0x00 \";\n\t\t\toutfile << \"0x00\";\n\t\t}\n\t\toutfile << \", \";\n\t\tif((i+1) % 12 == 0)\n\t\t{\n\t\t\tstd::cout << \"\\n\";\n\t\t\toutfile << \"\\n\";\n\t\t}\n\t\telse if(i == arr_size - 1)\n\t\t\tstd::cout << \"\\n\";\n\t}\n\t\n\toutfile.close();\n\n\treturn 0;\t\n}\n\nvoid decode(std::string parsed_string, int *hex, int *add)\n{\n\tif(parsed_string == \"0x00000000\") \/\/Transparent\n\t{\n\t\tstd::cout << \"0\";\n\t}\n\telse if (parsed_string == \"0xff000000\") \/\/Black\n\t{\n\t\tstd::cout << \"1\";\n\t\t*hex += *add;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2008 Jens-Michael Hoffmann <jensmh@gmx.de>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n#include \"osm-namefinder\/NearestPlacesTagHandler.h\"\n\n#include <QtCore\/QDebug>\n\n#include \"GeoDataPlacemark.h\"\n#include \"GeoParser.h\"\n#include \"osm-namefinder\/ElementDictionary.h\"\n\nnamespace Marble\n{\nnamespace OsmNamefinder\n{\n\nstatic GeoTagHandlerRegistrar\ns_handler( GeoTagHandler::QualifiedName( tag_nearestplaces, tag_namespace ),\n new NearestPlacesTagHandler );\n\n\nGeoNode * NearestPlacesTagHandler::parse( GeoParser & parser ) const\n{\n Q_ASSERT( parser.isStartElement() && parser.isValidElement( tag_nearestplaces ));\n qDebug() << \"OnfNearestPlacesTagHandler\";\n\n GeoStackItem parentItem = parser.parentElement();\n GeoDataPlacemark * named = 0;\n if ( parentItem.represents( tag_named ))\n named = parentItem.nodeAs<GeoDataPlacemark>();\n return named;\n}\n\n}\n}\n<commit_msg>Fix debug output.<commit_after>\/*\n Copyright (C) 2008 Jens-Michael Hoffmann <jensmh@gmx.de>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n#include \"osm-namefinder\/NearestPlacesTagHandler.h\"\n\n#include <QtCore\/QDebug>\n\n#include \"GeoDataPlacemark.h\"\n#include \"GeoParser.h\"\n#include \"osm-namefinder\/ElementDictionary.h\"\n\nnamespace Marble\n{\nnamespace OsmNamefinder\n{\n\nstatic GeoTagHandlerRegistrar\ns_handler( GeoTagHandler::QualifiedName( tag_nearestplaces, tag_namespace ),\n new NearestPlacesTagHandler );\n\n\nGeoNode * NearestPlacesTagHandler::parse( GeoParser & parser ) const\n{\n Q_ASSERT( parser.isStartElement() && parser.isValidElement( tag_nearestplaces ));\n qDebug() << \"NearestPlacesTagHandler\";\n\n GeoStackItem parentItem = parser.parentElement();\n GeoDataPlacemark * named = 0;\n if ( parentItem.represents( tag_named ))\n named = parentItem.nodeAs<GeoDataPlacemark>();\n return named;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/includes\/Signstate.h\"\n#include <iostream>\n\nusing namespace std;\n\nSignstate::Signstate() {\n one = '0';\n two = '0';\n comment = 0;\n}\n\nSignstate::~Signstate() {\n}\n\nint Signstate::handle(char c){\n \/\/ logic of the state....\n\n if (comment == 1) {\n \/\/ Im Kommentar\n \/\/ cout << \"in the comment \" << c << \"\\n\";\n if (c == ':' && one == '*') {\n \/\/ raus aus Kommentar\n \/\/ cout << \"exit comment \" << c << \"\\n\";\n comment = 0;\n one = '0';\n two = '0';\n return 24;\n } else {\n one = '0';\n two = '0';\n }\n if (c == '*') {\n one = c;\n }\n if (c == '\\n') {\n return 23;\n }\n return 22;\n }\n\n \/\/ einteilige Zeichen\n if (one == '0' && two == '0') {\n switch (c) {\n case '+':\n return 30;\n break;\n case '-':\n return 31;\n break;\n case '<':\n return 34;\n break;\n case '>':\n return 35;\n break;\n case '!':\n return 39;\n break;\n case ';':\n return 41;\n break;\n case '(':\n return 42;\n break;\n case ')':\n return 43;\n break;\n case '{':\n return 44;\n break;\n case '}':\n return 45;\n break;\n case '[':\n return 46;\n break;\n case ']':\n return 47;\n break;\n }\n \/\/ if (c == '+' || c == '-' || c == '<' || c == '>' || c == '(' || c == ')' ||\n \/\/ c == '{' || c == '}' || c == '[' || c == ']' || c == '!' || c == ';') {\n \/\/ return 20;\n \/\/ }\n }\n \/\/ mehrteilige Zeichen\n switch (c) {\n case ':':\n if (one == '0') {\n one = c;\n return 1;\n } else if(one == '='){\n two = c;\n return 1;\n } else {\n one = '0';\n two = '0';\n return 32;\n }\n case '*':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == ':') {\n \/\/ Kommentar beginnt!\n comment = 1;\n one = '0';\n two = '0';\n return 1;\n }{\n \/\/TODO:CHECK!\n return 33;\n }\n case '=':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == ':') {\n one = '0';\n two = '0';\n return 37;\n } else if(one == '=' && two == ':'){\n one = '0';\n two = '0';\n return 38;\n } else {\n one = '0';\n two = '0';\n return 36;\n }\n case '&':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == '&') {\n one = '0';\n two = '0';\n return 40;\n } else {\n one = '0';\n two = '0';\n return 0;\n }\n default:\n one = '0';\n two = '0';\n return 0;\n }\n\n}\n<commit_msg>fix Comments at the end of a file<commit_after>#include \"..\/includes\/Signstate.h\"\n#include <iostream>\n\nusing namespace std;\n\nSignstate::Signstate() {\n one = '0';\n two = '0';\n comment = 0;\n}\n\nSignstate::~Signstate() {\n}\n\nint Signstate::handle(char c){\n \/\/ logic of the state....\n if (c == '\\0') {\n return -99;\n }\n\n if (comment == 1) {\n \/\/ Im Kommentar\n \/\/ cout << \"in the comment \" << c << \"\\n\";\n if (c == ':' && one == '*') {\n \/\/ raus aus Kommentar\n \/\/ cout << \"exit comment \" << c << \"\\n\";\n comment = 0;\n one = '0';\n two = '0';\n return 24;\n } else {\n one = '0';\n two = '0';\n }\n if (c == '*') {\n one = c;\n }\n if (c == '\\n') {\n return 23;\n }\n return 22;\n }\n\n \/\/ einteilige Zeichen\n if (one == '0' && two == '0') {\n switch (c) {\n case '+':\n return 30;\n break;\n case '-':\n return 31;\n break;\n case '<':\n return 34;\n break;\n case '>':\n return 35;\n break;\n case '!':\n return 39;\n break;\n case ';':\n return 41;\n break;\n case '(':\n return 42;\n break;\n case ')':\n return 43;\n break;\n case '{':\n return 44;\n break;\n case '}':\n return 45;\n break;\n case '[':\n return 46;\n break;\n case ']':\n return 47;\n break;\n }\n \/\/ if (c == '+' || c == '-' || c == '<' || c == '>' || c == '(' || c == ')' ||\n \/\/ c == '{' || c == '}' || c == '[' || c == ']' || c == '!' || c == ';') {\n \/\/ return 20;\n \/\/ }\n }\n \/\/ mehrteilige Zeichen\n switch (c) {\n case ':':\n if (one == '0') {\n one = c;\n return 1;\n } else if(one == '='){\n two = c;\n return 1;\n } else {\n one = '0';\n two = '0';\n return 32;\n }\n case '*':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == ':') {\n \/\/ Kommentar beginnt!\n comment = 1;\n one = '0';\n two = '0';\n return 1;\n }{\n \/\/TODO:CHECK!\n return 33;\n }\n case '=':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == ':') {\n one = '0';\n two = '0';\n return 37;\n } else if(one == '=' && two == ':'){\n one = '0';\n two = '0';\n return 38;\n } else {\n one = '0';\n two = '0';\n return 36;\n }\n case '&':\n if (one == '0') {\n one = c;\n return 1;\n } else if (one == '&') {\n one = '0';\n two = '0';\n return 40;\n } else {\n one = '0';\n two = '0';\n return 0;\n }\n default:\n one = '0';\n two = '0';\n return 0;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"RobotPosition.h\"\n#include \"DistanceCalculator.h\"\n\nextern DistanceCalculator gDistanceCalculator;\n\n\/\/RobotPosition::RobotPosition() {\n\/\/\tthis->polarMetricCoords = cv::Point(0, 0);\n\/\/} \n\nRobotPosition::RobotPosition(GatePosition &yellowGate, GatePosition &blueGate, cv::Point initialCoords):\nyellowGate(yellowGate), blueGate(blueGate), filter(initialCoords){\n\tthis->polarMetricCoords = cv::Point(0, 0);\n\tthis->fieldCoords = initialCoords;\n}\n\nRobotPosition::~RobotPosition()\n{\n}\n\nvoid RobotPosition::updateFieldCoordsNew(cv::Point orgin) {\n\n\n\tdouble d1 = blueGate.getDistance();\n\tdouble d2 = yellowGate.getDistance();\n\tdouble a1 = blueGate.getAngle();\n\tdouble a2 = yellowGate.getAngle();\n\tdouble a = a1 - a2;\n\tif (a < 0) a += 360;\n\n\tcv::Point pos;\n\tif (abs(a - 180) > 0){\n\t\tpos.x = a < 180 ? 1 : -1;\n\t}\n\tif (abs(d1 - d2) > 1){\n\t\tpos.y = d1 < d2 ? -1 : 1;\n\t}\n\tfieldCoords = cv::Point(60 * pos.x, 100 * pos.y);\n\tdouble aa = a > 180 ? a - 180: a;\n\tdouble a11 = asin(d2 * sin(abs(aa \/ 180 * CV_PI)) \/ 450) \/ CV_PI * 180;\n\tdouble a12 = asin(d1 * sin(abs(aa \/ 180 * CV_PI)) \/ 450) \/ CV_PI * 180;\n\tdouble a111 = pos.x < 0 ? a11 : 180 - a11;\n\tdouble a112 = pos.y > 0 ? a11 : 180 - a11;\n\tdouble a121 = pos.x < 0 ? a12 : 180 - a12;\n\tdouble a122 = pos.y > 0 ? a12 : 180 - a12;\n\tdouble dx1 = d1 * sin(a111 \/ 180 * CV_PI)*pos.x;\n\tdouble dy1 = d1 * cos(a112 \/ 180 * CV_PI)*pos.y;\n\tdouble dx2 = d2 * sin(a121 \/ 180 * CV_PI)*pos.x;\n\tdouble dy2 = d2 * cos(a122 \/ 180 * CV_PI)*-pos.y;\n\n\tdouble x1 = dx1 + blueGate.fieldCoords.x;\n\tdouble y1 = dy1 + blueGate.fieldCoords.y;\n\tdouble x2 = dx2 + yellowGate.fieldCoords.x;\n\tdouble y2 = dy2 + yellowGate.fieldCoords.y;\n\/\/\tx1 = x2; y1 = y2;\n\/\/\tx2 = x1; y2 = y1;\n\tfieldCoords.x = (x1 + x2) \/ 2;\n\tfieldCoords.y = (y1 + y2) \/ 2;\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = DistanceCalculator::angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = DistanceCalculator::angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto da1 = (angleToBlueGate - blueGate.getAngle());\n\tauto da2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (abs(da1 - da2) > 180) {\n\t\tif (da1 < 0) da1 = 360 + da1;\n\t\tif (da2< 0) da2 = 360 + da2;\n\t}\n\/\/\tif (da2 < 0) da2 += 360;\n\tpolarMetricCoords.y = (da1 + da2) \/ 2;\n\t\/\/polarMetricCoords.y = d1 > d2 ? da1 : da2;\n\n\t\/*\n\tif (d1 < d2) {\n\t\tif (a < 180) {\n\t\t\t\/\/ top right\n\t\t\tfieldCoords = { 60, -100 };\n\t\t}\n\t\telse {\n\t\t\t\/\/top bottom\n\t\t\tfieldCoords = { -60, -100 };\n\t\t}\n\t}\n\telse {\n\t\tif (a < 180 ) {\n\t\t\t\/\/ bottom right\n\t\t\tfieldCoords = { 60, 100 };\n\t\t}\n\t\telse {\n\t\t\t\/\/bottom bottom\n\t\t\tfieldCoords = { -60, 100 };\n\t\t}\n\n\t}\n\t*\/\n\t\/*\n\tif (a < 0) a = 360 + a;\n\tdouble a1, a2 = 0;\n\tint axis = 0;\n\tdouble err, lastErr = INT_MAX;\n\tdouble d;\n\tdo {\n\t\td = sqrt(pow(d1, 2) + pow(d2, 2) - 2 * d1 * d2*cos(a\/360*CV_PI));\n\t\terr = abs(d - 450);\n\t\tif (err < 10) break;\n\n\t\tif (err > lastErr) {\n\t\t\taxis = axis ^ 1;\n\t\t}\n\t\telse {\n\t\t\tif (axis == 0) d1 += err*0.1;\n\t\t\tif (axis == 1) d2 += err*0.1;\n\t\t\tlastErr = err;\n\t\t}\n\t} while (true);\n\tblueGate.polarMetricCoords.x = d1;\n\tyellowGate.polarMetricCoords.x = d2;\n\t*\/\n}\nvoid RobotPosition::updateFieldCoords(cv::Point orgin) {\n\n\tupdateFieldCoordsNew();\n\treturn;\n\n\tauto possiblePoints = intersectionOfTwoCircles(yellowGate.fieldCoords, yellowGate.getDistance(), blueGate.fieldCoords, blueGate.getDistance());\n\n\tif (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle())){\n\t\tif (possiblePoints.first.y > 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\telse {\n\t\tif (possiblePoints.first.y < 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\tfieldCoords = filter.doFiltering(rawFieldCoords);\n\t\/*double possiblePointDistance1 = cv::norm(possiblePoints.first - lastFieldCoords);\n\tdouble possiblePointDistance2 = cv::norm(possiblePoints.second - lastFieldCoords);\n\tif (possiblePointDistance1 < possiblePointDistance2) {\n\t\tthis->fieldCoords = possiblePoints.first;\n\t}\n\telse {\n\t\tthis->fieldCoords = possiblePoints.second;\n\t}*\/\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = DistanceCalculator::angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = DistanceCalculator::angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto a1 = (angleToBlueGate - blueGate.getAngle());\n\tauto a2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (a1 < 0) a1 += 360;\n\tif (a2 < 0) a2 += 360;\n\t\/\/polarMetricCoords.y = (a1 + a2) \/ 2;\n\tpolarMetricCoords.y = blueGate.getDistance() > yellowGate.getDistance() ? a1 : a2;\n\n\n}\n\nvoid RobotPosition::updatePolarCoords() {\n\treturn;\n}\n\nstd::pair<cv::Point, cv::Point> RobotPosition::intersectionOfTwoCircles(cv::Point circle1center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle1Rad, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcv::Point circle2center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle2Rad) {\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(circle1center - circle2center);\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > circle1Rad + circle2Rad) {\n\t\tcircle1Rad += 0.2*circle1Rad;\n\t\tcircle2Rad += 0.2*circle2Rad;\n\t}\n\n\t\/\/ calculating area and height of trianlge formed by points\n\tdouble a = (pow(circle1Rad,2) - pow(circle2Rad, 2) + pow(distance, 2)) \/ (2.0*distance);\n\tdouble h = sqrt(pow(circle1Rad, 2) - pow(a, 2));\n\n\t\/\/Calculate point p, where the line through the circle intersection points crosses the line between the circle centers. \n\tcv::Point p;\n\n\tp.x = (int)(circle1center.x + (a \/ distance) * (circle2center.x - circle1center.x));\n\tp.y = (int)(circle1center.y + (a \/ distance) * (circle2center.y - circle1center.y));\n\n\t\/\/ if has only one intersection point\n\tif (distance == circle1Rad + circle2Rad) {\n\t\treturn std::pair<cv::Point, cv::Point>(p, p);\n\t}\n\n\t\/\/ if has two intersection points\n\tcv::Point possible1;\n\tcv::Point possible2;\n\n\tpossible1.x = (int)(p.x + (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible1.y = (int)(p.y - (h \/ distance) * (circle2center.x - circle1center.x));\n\n\tpossible2.x = (int)(p.x - (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible2.y = (int)(p.y + (h \/ distance) * (circle2center.x - circle1center.x));\n\n\treturn std::pair<cv::Point, cv::Point>(possible1, possible2);\n}\n\ndouble RobotPosition::getAngle() {\n\treturn polarMetricCoords.y;\n}\n\nbool RobotPosition::isRobotAboveCenterLine(double yellowGoalAngle, double blueGoalAngle){\n\t\/*Calculation based on field: \n\t _________________\n\t | |\n\tB|]-------o-------[|Y\n\t |_________________|\n\t\n\t*\/\n\tdouble yellowToBlue = blueGoalAngle - yellowGoalAngle;\n\tif (yellowToBlue < 0)\n\t\tyellowToBlue += 360;\n\tdouble blueToYellow = yellowGoalAngle - blueGoalAngle;\n\tif (blueToYellow < 0)\n\t\tblueToYellow += 360;\n\tif (yellowToBlue < blueToYellow)\n\t\treturn true;\n\treturn false;\n}\n\n\/\/bluegoal 0 degrees, yellow 180 degrees\ndouble RobotPosition::getRobotDirection(){\n\n\t\/\/ we have triangle and two conrners are known, subtract those from full circle\n\treturn ((int)(yellowGate.getAngle() - blueGate.getAngle()) % 360); \/\/ <- this is not correct\n\t\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(yellowGate.fieldCoords - blueGate.fieldCoords);\n\tdouble yellowGoalDist = yellowGate.getDistance();\n\tdouble blueGoalDist = blueGate.getDistance();\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > yellowGoalDist + blueGoalDist) {\n\t\tyellowGoalDist++;\n\t\tblueGoalDist++;\n\t}\n\n\tdouble aSqr = blueGoalDist * blueGoalDist;\n\tdouble bSqr = 500.0 * 500.0;\n\tdouble cSqr = yellowGoalDist* yellowGoalDist;\n\tdouble ab2 = 2.0*blueGoalDist*500.0;\n\tdouble gammaCos = (aSqr + bSqr - cSqr) \/ ab2;\n\tdouble gammaRads = acos(gammaCos);\n\tdouble gammaDegrees = gammaRads*(180 \/ PI);\n\tdouble dir = gammaDegrees + (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle()) ? 0 : -360);\n\treturn blueGate.getAngle() + dir;\n\t\n}<commit_msg>cleanup<commit_after>#include \"RobotPosition.h\"\n#include \"DistanceCalculator.h\"\n\nextern DistanceCalculator gDistanceCalculator;\n\n\/\/RobotPosition::RobotPosition() {\n\/\/\tthis->polarMetricCoords = cv::Point(0, 0);\n\/\/} \n\nRobotPosition::RobotPosition(GatePosition &yellowGate, GatePosition &blueGate, cv::Point initialCoords):\nyellowGate(yellowGate), blueGate(blueGate), filter(initialCoords){\n\tthis->polarMetricCoords = cv::Point(0, 0);\n\tthis->fieldCoords = initialCoords;\n}\n\nRobotPosition::~RobotPosition()\n{\n}\n\nvoid RobotPosition::updateFieldCoordsNew(cv::Point orgin) {\n\n\n\tdouble d1 = blueGate.getDistance();\n\tdouble d2 = yellowGate.getDistance();\n\tdouble a1 = blueGate.getAngle();\n\tdouble a2 = yellowGate.getAngle();\n\tdouble a = a1 - a2;\n\tif (a < 0) a += 360;\n\n\tcv::Point pos;\n\tif (abs(a - 180) > 0){\n\t\tpos.x = a < 180 ? 1 : -1;\n\t}\n\tif (abs(d1 - d2) > 1){\n\t\tpos.y = d1 < d2 ? -1 : 1;\n\t}\n\tfieldCoords = cv::Point(60 * pos.x, 100 * pos.y);\n\tdouble aa = a > 180 ? a - 180: a;\n\tdouble a11 = asin(d2 * sin(abs(aa \/ 180 * CV_PI)) \/ 450) \/ CV_PI * 180;\n\tdouble a12 = asin(d1 * sin(abs(aa \/ 180 * CV_PI)) \/ 450) \/ CV_PI * 180;\n\tdouble a111 = pos.x < 0 ? a11 : 180 - a11;\n\tdouble a112 = pos.y > 0 ? a11 : 180 - a11;\n\tdouble a121 = pos.x < 0 ? a12 : 180 - a12;\n\tdouble a122 = pos.y > 0 ? a12 : 180 - a12;\n\tdouble dx1 = d1 * sin(a111 \/ 180 * CV_PI)*pos.x;\n\tdouble dy1 = d1 * cos(a112 \/ 180 * CV_PI)*pos.y;\n\tdouble dx2 = d2 * sin(a121 \/ 180 * CV_PI)*pos.x;\n\tdouble dy2 = d2 * cos(a122 \/ 180 * CV_PI)*-pos.y;\n\n\tdouble x1 = dx1 + blueGate.fieldCoords.x;\n\tdouble y1 = dy1 + blueGate.fieldCoords.y;\n\tdouble x2 = dx2 + yellowGate.fieldCoords.x;\n\tdouble y2 = dy2 + yellowGate.fieldCoords.y;\n\/\/\tx1 = x2; y1 = y2;\n\/\/\tx2 = x1; y2 = y1;\n\tfieldCoords.x = (x1 + x2) \/ 2;\n\tfieldCoords.y = (y1 + y2) \/ 2;\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = DistanceCalculator::angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = DistanceCalculator::angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto da1 = (angleToBlueGate - blueGate.getAngle());\n\tauto da2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (abs(da1 - da2) > 180) {\n\t\tif (da1 < 0) da1 = 360 + da1;\n\t\tif (da2< 0) da2 = 360 + da2;\n\t}\n\/\/\tif (da2 < 0) da2 += 360;\n\tpolarMetricCoords.y = (da1 + da2) \/ 2;\n\t\/\/polarMetricCoords.y = d1 > d2 ? da1 : da2;\n\n}\nvoid RobotPosition::updateFieldCoords(cv::Point orgin) {\n\n\tupdateFieldCoordsNew();\n\treturn;\n\n\tauto possiblePoints = intersectionOfTwoCircles(yellowGate.fieldCoords, yellowGate.getDistance(), blueGate.fieldCoords, blueGate.getDistance());\n\n\tif (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle())){\n\t\tif (possiblePoints.first.y > 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\telse {\n\t\tif (possiblePoints.first.y < 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\tfieldCoords = filter.doFiltering(rawFieldCoords);\n\t\/*double possiblePointDistance1 = cv::norm(possiblePoints.first - lastFieldCoords);\n\tdouble possiblePointDistance2 = cv::norm(possiblePoints.second - lastFieldCoords);\n\tif (possiblePointDistance1 < possiblePointDistance2) {\n\t\tthis->fieldCoords = possiblePoints.first;\n\t}\n\telse {\n\t\tthis->fieldCoords = possiblePoints.second;\n\t}*\/\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = DistanceCalculator::angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = DistanceCalculator::angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto a1 = (angleToBlueGate - blueGate.getAngle());\n\tauto a2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (a1 < 0) a1 += 360;\n\tif (a2 < 0) a2 += 360;\n\t\/\/polarMetricCoords.y = (a1 + a2) \/ 2;\n\tpolarMetricCoords.y = blueGate.getDistance() > yellowGate.getDistance() ? a1 : a2;\n\n\n}\n\nvoid RobotPosition::updatePolarCoords() {\n\treturn;\n}\n\nstd::pair<cv::Point, cv::Point> RobotPosition::intersectionOfTwoCircles(cv::Point circle1center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle1Rad, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcv::Point circle2center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle2Rad) {\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(circle1center - circle2center);\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > circle1Rad + circle2Rad) {\n\t\tcircle1Rad += 0.2*circle1Rad;\n\t\tcircle2Rad += 0.2*circle2Rad;\n\t}\n\n\t\/\/ calculating area and height of trianlge formed by points\n\tdouble a = (pow(circle1Rad,2) - pow(circle2Rad, 2) + pow(distance, 2)) \/ (2.0*distance);\n\tdouble h = sqrt(pow(circle1Rad, 2) - pow(a, 2));\n\n\t\/\/Calculate point p, where the line through the circle intersection points crosses the line between the circle centers. \n\tcv::Point p;\n\n\tp.x = (int)(circle1center.x + (a \/ distance) * (circle2center.x - circle1center.x));\n\tp.y = (int)(circle1center.y + (a \/ distance) * (circle2center.y - circle1center.y));\n\n\t\/\/ if has only one intersection point\n\tif (distance == circle1Rad + circle2Rad) {\n\t\treturn std::pair<cv::Point, cv::Point>(p, p);\n\t}\n\n\t\/\/ if has two intersection points\n\tcv::Point possible1;\n\tcv::Point possible2;\n\n\tpossible1.x = (int)(p.x + (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible1.y = (int)(p.y - (h \/ distance) * (circle2center.x - circle1center.x));\n\n\tpossible2.x = (int)(p.x - (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible2.y = (int)(p.y + (h \/ distance) * (circle2center.x - circle1center.x));\n\n\treturn std::pair<cv::Point, cv::Point>(possible1, possible2);\n}\n\ndouble RobotPosition::getAngle() {\n\treturn polarMetricCoords.y;\n}\n\nbool RobotPosition::isRobotAboveCenterLine(double yellowGoalAngle, double blueGoalAngle){\n\t\/*Calculation based on field: \n\t _________________\n\t | |\n\tB|]-------o-------[|Y\n\t |_________________|\n\t\n\t*\/\n\tdouble yellowToBlue = blueGoalAngle - yellowGoalAngle;\n\tif (yellowToBlue < 0)\n\t\tyellowToBlue += 360;\n\tdouble blueToYellow = yellowGoalAngle - blueGoalAngle;\n\tif (blueToYellow < 0)\n\t\tblueToYellow += 360;\n\tif (yellowToBlue < blueToYellow)\n\t\treturn true;\n\treturn false;\n}\n\n\/\/bluegoal 0 degrees, yellow 180 degrees\ndouble RobotPosition::getRobotDirection(){\n\n\t\/\/ we have triangle and two conrners are known, subtract those from full circle\n\treturn ((int)(yellowGate.getAngle() - blueGate.getAngle()) % 360); \/\/ <- this is not correct\n\t\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(yellowGate.fieldCoords - blueGate.fieldCoords);\n\tdouble yellowGoalDist = yellowGate.getDistance();\n\tdouble blueGoalDist = blueGate.getDistance();\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > yellowGoalDist + blueGoalDist) {\n\t\tyellowGoalDist++;\n\t\tblueGoalDist++;\n\t}\n\n\tdouble aSqr = blueGoalDist * blueGoalDist;\n\tdouble bSqr = 500.0 * 500.0;\n\tdouble cSqr = yellowGoalDist* yellowGoalDist;\n\tdouble ab2 = 2.0*blueGoalDist*500.0;\n\tdouble gammaCos = (aSqr + bSqr - cSqr) \/ ab2;\n\tdouble gammaRads = acos(gammaCos);\n\tdouble gammaDegrees = gammaRads*(180 \/ PI);\n\tdouble dir = gammaDegrees + (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle()) ? 0 : -360);\n\treturn blueGate.getAngle() + dir;\n\t\n}<|endoftext|>"} {"text":"<commit_before>#include \"RobotPosition.h\"\n\n\/\/RobotPosition::RobotPosition() {\n\/\/\tthis->polarMetricCoords = cv::Point(0, 0);\n\/\/} \n\nRobotPosition::RobotPosition(GatePosition &yellowGate, GatePosition &blueGate, cv::Point initialCoords):\nyellowGate(yellowGate), blueGate(blueGate), filter(initialCoords){\n\tthis->polarMetricCoords = cv::Point(0, 0);\n\tthis->fieldCoords = initialCoords;\n}\n\nRobotPosition::~RobotPosition()\n{\n}\n\nvoid RobotPosition::updateFieldCoords(cv::Point orgin) {\n\n\t\/\/we konw all angles of triangle and length of one side, use cosinus theorem to find\n\tconst int distanceBetweenGates = 450;\n\t\/\/ we have two equations\n\t\/\/ distanceBetweenGates^2 = distanceToBlueGate^2 + distanceToYellowGate^2 - 2*distanceToBlueGate*distanceToYellowGate*cos(robotAngle)\n\tdouble diff = INT_MAX;\n\tdouble w = 1; \n\tdouble a = 0.0001;\/\/learning rate\n\tdouble d1 = blueGate.getDistance();\n\tdouble d2 = yellowGate.getDistance();\n\tdouble g = abs(blueGate.getAngle() - yellowGate.getAngle());\n\tif (true || abs(g - 180) > 15) { \/\/ do not use this for wery acute triangles, floating point errors are big\n\t\twhile (d1 > 0 && d2 > 0 && diff > 1) {\n\t\t\tdiff = distanceBetweenGates - sqrt(pow(w*d1, 2) + pow(w*d2, 2) - 2 * w*d1*d2*cos(g));\n\t\t\tw += diff*a;\n\t\t}\n\t}\n\tw = 1;\n\tauto possiblePoints = intersectionOfTwoCircles(yellowGate.fieldCoords, w*d2, blueGate.fieldCoords, w*d1);\n\n\tif (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle())){\n\t\tif (possiblePoints.first.y > 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\telse {\n\t\tif (possiblePoints.first.y < 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\tfieldCoords = filter.doFiltering(rawFieldCoords);\n\t\/*double possiblePointDistance1 = cv::norm(possiblePoints.first - lastFieldCoords);\n\tdouble possiblePointDistance2 = cv::norm(possiblePoints.second - lastFieldCoords);\n\tif (possiblePointDistance1 < possiblePointDistance2) {\n\t\tthis->fieldCoords = possiblePoints.first;\n\t}\n\telse {\n\t\tthis->fieldCoords = possiblePoints.second;\n\t}*\/\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto a1 = (angleToBlueGate - blueGate.getAngle());\n\tauto a2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (a1 < 0) a1 += 360;\n\tif (a2 < 0) a2 += 360;\n\tpolarMetricCoords.y = (a1 + a2) \/ 2;\n\n\n}\n\nvoid RobotPosition::updatePolarCoords() {\n\treturn;\n}\n\nstd::pair<cv::Point, cv::Point> RobotPosition::intersectionOfTwoCircles(cv::Point circle1center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle1Rad, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcv::Point circle2center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle2Rad) {\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(circle1center - circle2center);\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > circle1Rad + circle2Rad) {\n\t\tcircle1Rad++;\n\t\tcircle2Rad++;\n\t}\n\n\t\/\/ calculating area and height of trianlge formed by points\n\tdouble a = (pow(circle1Rad,2) - pow(circle2Rad, 2) + pow(distance, 2)) \/ (2.0*distance);\n\tdouble h = sqrt(pow(circle1Rad, 2) - pow(a, 2));\n\n\t\/\/Calculate point p, where the line through the circle intersection points crosses the line between the circle centers. \n\tcv::Point p;\n\n\tp.x = (int)(circle1center.x + (a \/ distance) * (circle2center.x - circle1center.x));\n\tp.y = (int)(circle1center.y + (a \/ distance) * (circle2center.y - circle1center.y));\n\n\t\/\/ if has only one intersection point\n\tif (distance == circle1Rad + circle2Rad) {\n\t\treturn std::pair<cv::Point, cv::Point>(p, p);\n\t}\n\n\t\/\/ if has two intersection points\n\tcv::Point possible1;\n\tcv::Point possible2;\n\n\tpossible1.x = (int)(p.x + (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible1.y = (int)(p.y - (h \/ distance) * (circle2center.x - circle1center.x));\n\n\tpossible2.x = (int)(p.x - (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible2.y = (int)(p.y + (h \/ distance) * (circle2center.x - circle1center.x));\n\n\treturn std::pair<cv::Point, cv::Point>(possible1, possible2);\n}\n\ndouble RobotPosition::getAngle() {\n\treturn polarMetricCoords.y;\n}\n\nbool RobotPosition::isRobotAboveCenterLine(double yellowGoalAngle, double blueGoalAngle){\n\t\/*Calculation based on field: \n\t _________________\n\t | |\n\tB|]-------o-------[|Y\n\t |_________________|\n\t\n\t*\/\n\tdouble yellowToBlue = blueGoalAngle - yellowGoalAngle;\n\tif (yellowToBlue < 0)\n\t\tyellowToBlue += 360;\n\tdouble blueToYellow = yellowGoalAngle - blueGoalAngle;\n\tif (blueToYellow < 0)\n\t\tblueToYellow += 360;\n\tif (yellowToBlue < blueToYellow)\n\t\treturn true;\n\treturn false;\n}\n\n\/\/bluegoal 0 degrees, yellow 180 degrees\ndouble RobotPosition::getRobotDirection(){\n\n\t\/\/ we have triangle and two conrners are known, subtract those from full circle\n\treturn ((int)(yellowGate.getAngle() - blueGate.getAngle()) % 360); \/\/ <- this is not correct\n\t\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(yellowGate.fieldCoords - blueGate.fieldCoords);\n\tdouble yellowGoalDist = yellowGate.getDistance();\n\tdouble blueGoalDist = blueGate.getDistance();\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > yellowGoalDist + blueGoalDist) {\n\t\tyellowGoalDist++;\n\t\tblueGoalDist++;\n\t}\n\n\tdouble aSqr = blueGoalDist * blueGoalDist;\n\tdouble bSqr = 500.0 * 500.0;\n\tdouble cSqr = yellowGoalDist* yellowGoalDist;\n\tdouble ab2 = 2.0*blueGoalDist*500.0;\n\tdouble gammaCos = (aSqr + bSqr - cSqr) \/ ab2;\n\tdouble gammaRads = acos(gammaCos);\n\tdouble gammaDegrees = gammaRads*(180 \/ PI);\n\tdouble dir = gammaDegrees + (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle()) ? 0 : -360);\n\treturn blueGate.getAngle() + dir;\n\t\n}<commit_msg>minor improvements<commit_after>#include \"RobotPosition.h\"\n\n\/\/RobotPosition::RobotPosition() {\n\/\/\tthis->polarMetricCoords = cv::Point(0, 0);\n\/\/} \n\nRobotPosition::RobotPosition(GatePosition &yellowGate, GatePosition &blueGate, cv::Point initialCoords):\nyellowGate(yellowGate), blueGate(blueGate), filter(initialCoords){\n\tthis->polarMetricCoords = cv::Point(0, 0);\n\tthis->fieldCoords = initialCoords;\n}\n\nRobotPosition::~RobotPosition()\n{\n}\n\nvoid RobotPosition::updateFieldCoords(cv::Point orgin) {\n\n\t\/\/we konw all angles of triangle and length of one side, use cosinus theorem to find\n\tconst int distanceBetweenGates = 450;\n\t\/\/ we have two equations\n\t\/\/ distanceBetweenGates^2 = distanceToBlueGate^2 + distanceToYellowGate^2 - 2*distanceToBlueGate*distanceToYellowGate*cos(robotAngle)\n\tdouble diff = INT_MAX;\n\tdouble w = 1; \n\tdouble a = 0.0001;\/\/learning rate\n\tdouble d1 = blueGate.getDistance();\n\tdouble d2 = yellowGate.getDistance();\n\tdouble g = abs(blueGate.getAngle() - yellowGate.getAngle());\n\tif (true || abs(g - 180) > 15) { \/\/ do not use this for wery acute triangles, floating point errors are big\n\t\twhile (d1 > 0 && d2 > 0 && abs(diff) > 1) {\n\t\t\tdiff = distanceBetweenGates - sqrt(pow(w*d1, 2) + pow(w*d2, 2) - 2 * w*w*d1*d2*cos(g));\n\t\t\tw += diff*a;\n\t\t}\n\t}\n\t\/\/w = 1;\n\tauto possiblePoints = intersectionOfTwoCircles(yellowGate.fieldCoords, w*d2, blueGate.fieldCoords, w*d1);\n\n\tif (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle())){\n\t\tif (possiblePoints.first.y > 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\telse {\n\t\tif (possiblePoints.first.y < 155){\n\t\t\tthis->rawFieldCoords = possiblePoints.first;\n\t\t}else\n\t\t\tthis->rawFieldCoords = possiblePoints.second;\n\t}\n\tfieldCoords = filter.doFiltering(rawFieldCoords);\n\t\/*double possiblePointDistance1 = cv::norm(possiblePoints.first - lastFieldCoords);\n\tdouble possiblePointDistance2 = cv::norm(possiblePoints.second - lastFieldCoords);\n\tif (possiblePointDistance1 < possiblePointDistance2) {\n\t\tthis->fieldCoords = possiblePoints.first;\n\t}\n\telse {\n\t\tthis->fieldCoords = possiblePoints.second;\n\t}*\/\n\n\t\/\/ no that we know robot position, we can calculate it's angle to blue or yellow gate on the field\n\tdouble angleToBlueGate = angleBetween(fieldCoords - blueGate.fieldCoords, { 0, 1 });\n\tdouble angleToYellowGate = angleBetween(fieldCoords - yellowGate.fieldCoords, { 0, 1 });\n\t\/\/ now add real gate angle to this angle\n\tauto a1 = (angleToBlueGate - blueGate.getAngle());\n\tauto a2 = (angleToYellowGate - yellowGate.getAngle());\n\t\/\/ for taking average, they must have same sign\n\tif (a1 < 0) a1 += 360;\n\tif (a2 < 0) a2 += 360;\n\t\/\/polarMetricCoords.y = (a1 + a2) \/ 2;\n\tpolarMetricCoords.y = blueGate.getDistance() > yellowGate.getDistance() ? a1 : a2;\n\n\n}\n\nvoid RobotPosition::updatePolarCoords() {\n\treturn;\n}\n\nstd::pair<cv::Point, cv::Point> RobotPosition::intersectionOfTwoCircles(cv::Point circle1center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle1Rad, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tcv::Point circle2center, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t double circle2Rad) {\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(circle1center - circle2center);\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > circle1Rad + circle2Rad) {\n\t\tcircle1Rad++;\n\t\tcircle2Rad++;\n\t}\n\n\t\/\/ calculating area and height of trianlge formed by points\n\tdouble a = (pow(circle1Rad,2) - pow(circle2Rad, 2) + pow(distance, 2)) \/ (2.0*distance);\n\tdouble h = sqrt(pow(circle1Rad, 2) - pow(a, 2));\n\n\t\/\/Calculate point p, where the line through the circle intersection points crosses the line between the circle centers. \n\tcv::Point p;\n\n\tp.x = (int)(circle1center.x + (a \/ distance) * (circle2center.x - circle1center.x));\n\tp.y = (int)(circle1center.y + (a \/ distance) * (circle2center.y - circle1center.y));\n\n\t\/\/ if has only one intersection point\n\tif (distance == circle1Rad + circle2Rad) {\n\t\treturn std::pair<cv::Point, cv::Point>(p, p);\n\t}\n\n\t\/\/ if has two intersection points\n\tcv::Point possible1;\n\tcv::Point possible2;\n\n\tpossible1.x = (int)(p.x + (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible1.y = (int)(p.y - (h \/ distance) * (circle2center.x - circle1center.x));\n\n\tpossible2.x = (int)(p.x - (h \/ distance) * (circle2center.y - circle1center.y));\n\tpossible2.y = (int)(p.y + (h \/ distance) * (circle2center.x - circle1center.x));\n\n\treturn std::pair<cv::Point, cv::Point>(possible1, possible2);\n}\n\ndouble RobotPosition::getAngle() {\n\treturn polarMetricCoords.y;\n}\n\nbool RobotPosition::isRobotAboveCenterLine(double yellowGoalAngle, double blueGoalAngle){\n\t\/*Calculation based on field: \n\t _________________\n\t | |\n\tB|]-------o-------[|Y\n\t |_________________|\n\t\n\t*\/\n\tdouble yellowToBlue = blueGoalAngle - yellowGoalAngle;\n\tif (yellowToBlue < 0)\n\t\tyellowToBlue += 360;\n\tdouble blueToYellow = yellowGoalAngle - blueGoalAngle;\n\tif (blueToYellow < 0)\n\t\tblueToYellow += 360;\n\tif (yellowToBlue < blueToYellow)\n\t\treturn true;\n\treturn false;\n}\n\n\/\/bluegoal 0 degrees, yellow 180 degrees\ndouble RobotPosition::getRobotDirection(){\n\n\t\/\/ we have triangle and two conrners are known, subtract those from full circle\n\treturn ((int)(yellowGate.getAngle() - blueGate.getAngle()) % 360); \/\/ <- this is not correct\n\t\n\t\/\/ distance between the centers\n\tdouble distance = cv::norm(yellowGate.fieldCoords - blueGate.fieldCoords);\n\tdouble yellowGoalDist = yellowGate.getDistance();\n\tdouble blueGoalDist = blueGate.getDistance();\n\n\t\/\/ if two circle radiuses do not reach\n\twhile (distance > yellowGoalDist + blueGoalDist) {\n\t\tyellowGoalDist++;\n\t\tblueGoalDist++;\n\t}\n\n\tdouble aSqr = blueGoalDist * blueGoalDist;\n\tdouble bSqr = 500.0 * 500.0;\n\tdouble cSqr = yellowGoalDist* yellowGoalDist;\n\tdouble ab2 = 2.0*blueGoalDist*500.0;\n\tdouble gammaCos = (aSqr + bSqr - cSqr) \/ ab2;\n\tdouble gammaRads = acos(gammaCos);\n\tdouble gammaDegrees = gammaRads*(180 \/ PI);\n\tdouble dir = gammaDegrees + (isRobotAboveCenterLine(yellowGate.getAngle(), blueGate.getAngle()) ? 0 : -360);\n\treturn blueGate.getAngle() + dir;\n\t\n}<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include \".\/LFC\/LFC.h\"\n#include \".\/Tests\/Tests.h\"\n\nint main(int argc, char **argv)\n{\n\tlfc_init(); \/\/ lfc initialization\n\t\n\tStdOut::PrintLine(\"hello world\");\n\t\n\tif (TestText::PerformAnsi() != 0) {\n\t\tprintf(\"PerformAnsi error!\\r\\n\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestText::PerformWide() != 0) {\n\t\tprintf(\"PerformWide error!\\r\\n\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestDirectory::Perform() != 0) {\n\t\tprintf(\"TestDirectory::Perform error!\\r\\n\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestDateTime::Perform() != 0) {\n\t\tprintf(\"TestDateTime::Perform error!\\r\\n\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestAdministration::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestAdministration::Perform error!!!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestFile::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestFile::Perform error!!!\");\n\t\treturn -1;\n\t}\n\t\n\treturn 0;\n}\n<commit_msg>Code cleaning<commit_after>#include <stdio.h>\n#include \".\/LFC\/LFC.h\"\n#include \".\/Tests\/Tests.h\"\n\nint main(int argc, char **argv)\n{\n\tlfc_init(); \/\/ lfc initialization\n\t\n\tStdOut::PrintLine(\"hello world\");\n\t\n\tif (TestText::PerformAnsi() != 0) {\n\t\tStdOut::PrintLine(\"PerformAnsi error!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestText::PerformWide() != 0) {\n\t\tStdOut::PrintLine(\"PerformWide error!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestDirectory::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestDirectory::Perform error!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestDateTime::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestDateTime::Perform error!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestAdministration::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestAdministration::Perform error!!!\");\n\t\treturn -1;\n\t}\n\tStdOut::PrintLine();\n\t\n\tif (TestFile::Perform() != 0) {\n\t\tStdOut::PrintLine(\"TestFile::Perform error!!!\");\n\t\treturn -1;\n\t}\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"pxt.h\"\n#include \"Adafruit_SSD1306.h\"\n\nusing namespace pxt;\n\nnamespace OLED {\n\t#define SSD1306_ADDRESS 0x78\n\t#undef printf\n\n\t\/\/ maintain compatibility with pre-unicode versions of microbit\n\t#ifndef PXT_STRING_DATA\n\t#define PXT_STRING_DATA(str) str->data\n\t#endif\n\n\n\tMicroBitI2C i2c(I2C_SDA0, I2C_SCL0);\n\tAdafruit_SSD1306_I2c *oled;\n\n\tvoid init(int height, int width){\n\t\tif (oled != NULL) delete oled;\n\t\toled = new Adafruit_SSD1306_I2c(i2c, SSD1306_ADDRESS, height, width);\n\t\toled->splash();\n\t\toled->display();\n\t}\n\t\n\t\/\/%\n\tvoid init_terminal(int height, int width){\n\t\tif (oled != NULL) delete oled;\n\t\toled = new Adafruit_SSD1306_I2c(i2c, SSD1306_ADDRESS, height, width);\n\t\toled->clearDisplay();\n\t\toled->display();\n\t\toled->setTextCursor(0, 0);\n\t}\n\t\n\n\t\/\/%\n void showStringNoNewLine(String text) {\n\t\toled->printf(\"%s\", PXT_STRING_DATA(text));\n\t\toled->display();\n }\n\n\t\/\/%\n void showStringWithNewLine(String text) {\n\t\toled->printf(\"%s\\n\", PXT_STRING_DATA(text));\n\t\toled->display();\n }\n\t\n \/\/%\n void showNumberWithoutNewLine (int number) {\n\t\toled->printf(\"%d\", number);\n\t\toled->display();\n\t}\n\t\n\t\/\/%\n void showNumberWithNewLine (int number) {\n\t\toled->printf(\"%d\\n\", number);\n\t\toled->display();\n\t}\n\t\n \/\/%\n void NextLine () {\n\t\toled->printf(\"\\n\");\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid clearDisplay(){\n\t\toled->setTextCursor(0, 0);\n\t\toled->clearDisplay();\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid drawCircle(int x, int y, int r){\n\t\toled->drawCircle(x, y, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid fillCircle(int x, int y, int r){\n\t\toled->fillCircle(x, y, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid drawLine(int x0, int y0, int x1, int y1){\n\t\toled->drawLine(x0, y0, x1, y1, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid fillRect(int x, int y, int w, int h){\n\t\toled->fillRect(x, y, w, h, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n void drawRect(int x, int y, int w, int h){\n \toled->drawRect(x, y, w, h, 1);\n\t\toled->display();\n }\n\n \/\/%\n\tvoid fillRoundRect(int x, int y, int w, int h, int r){\n\t\toled->fillRoundRect(x, y, w, h, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n void drawRoundRect(int x, int y, int w, int h, int r){\n \toled->drawRoundRect(x, y, w, h, r, 1);\n\t\toled->display();\n }\n\n \/\/%\n void drawTriangle(int x0, int y0, int x1, int y1, int x2, int y2){\n \toled->drawTriangle(x0, y0, x1, y1, x2, y2, 1);\n\t\toled->display();\n }\n\n \/\/%\n void fillTriangle(int x0, int y0, int x1, int y1, int x2, int y2){\n \toled->fillTriangle(x0, y0, x1, y1, x2, y2, 1);\n\t\toled->display();\n }\n\t\t\n\t\/\/%\n\tvoid LoadingScreen() {\n\t\tint x,y = 0;\n\t\tint w = 21;\n\t\tint h = 64;\n\t\tfor (int i = 0; i < 6;i++){\n\t\t\tfillRect(x, y, w, h);\n\t\t\tx = x + 21;\n\t\t\toled->display();\n\t\t}\n\n\t}\n\n\t\/\/%\n\tvoid showProgress(int progress) {\n\t\toled->clearDisplay();\n\t\tdrawRect(0,21,128,21);\n\t\tfillRect(0,21,progress*128\/100,21);\n\t}\n #define printf(...) uBit.serial.printf(__VA_ARGS__)\n\n}\n<commit_msg>remove accidental extra line<commit_after>#include \"pxt.h\"\n#include \"Adafruit_SSD1306.h\"\n\nusing namespace pxt;\n\nnamespace OLED {\n\t#define SSD1306_ADDRESS 0x78\n\t#undef printf\n\n\t\/\/ maintain compatibility with pre-unicode versions of microbit\n\t#ifndef PXT_STRING_DATA\n\t#define PXT_STRING_DATA(str) str->data\n\t#endif\n\n\tMicroBitI2C i2c(I2C_SDA0, I2C_SCL0);\n\tAdafruit_SSD1306_I2c *oled;\n\n\tvoid init(int height, int width){\n\t\tif (oled != NULL) delete oled;\n\t\toled = new Adafruit_SSD1306_I2c(i2c, SSD1306_ADDRESS, height, width);\n\t\toled->splash();\n\t\toled->display();\n\t}\n\t\n\t\/\/%\n\tvoid init_terminal(int height, int width){\n\t\tif (oled != NULL) delete oled;\n\t\toled = new Adafruit_SSD1306_I2c(i2c, SSD1306_ADDRESS, height, width);\n\t\toled->clearDisplay();\n\t\toled->display();\n\t\toled->setTextCursor(0, 0);\n\t}\n\t\n\n\t\/\/%\n void showStringNoNewLine(String text) {\n\t\toled->printf(\"%s\", PXT_STRING_DATA(text));\n\t\toled->display();\n }\n\n\t\/\/%\n void showStringWithNewLine(String text) {\n\t\toled->printf(\"%s\\n\", PXT_STRING_DATA(text));\n\t\toled->display();\n }\n\t\n \/\/%\n void showNumberWithoutNewLine (int number) {\n\t\toled->printf(\"%d\", number);\n\t\toled->display();\n\t}\n\t\n\t\/\/%\n void showNumberWithNewLine (int number) {\n\t\toled->printf(\"%d\\n\", number);\n\t\toled->display();\n\t}\n\t\n \/\/%\n void NextLine () {\n\t\toled->printf(\"\\n\");\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid clearDisplay(){\n\t\toled->setTextCursor(0, 0);\n\t\toled->clearDisplay();\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid drawCircle(int x, int y, int r){\n\t\toled->drawCircle(x, y, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid fillCircle(int x, int y, int r){\n\t\toled->fillCircle(x, y, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid drawLine(int x0, int y0, int x1, int y1){\n\t\toled->drawLine(x0, y0, x1, y1, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n\tvoid fillRect(int x, int y, int w, int h){\n\t\toled->fillRect(x, y, w, h, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n void drawRect(int x, int y, int w, int h){\n \toled->drawRect(x, y, w, h, 1);\n\t\toled->display();\n }\n\n \/\/%\n\tvoid fillRoundRect(int x, int y, int w, int h, int r){\n\t\toled->fillRoundRect(x, y, w, h, r, 1);\n\t\toled->display();\n\t}\n\n\t\/\/%\n void drawRoundRect(int x, int y, int w, int h, int r){\n \toled->drawRoundRect(x, y, w, h, r, 1);\n\t\toled->display();\n }\n\n \/\/%\n void drawTriangle(int x0, int y0, int x1, int y1, int x2, int y2){\n \toled->drawTriangle(x0, y0, x1, y1, x2, y2, 1);\n\t\toled->display();\n }\n\n \/\/%\n void fillTriangle(int x0, int y0, int x1, int y1, int x2, int y2){\n \toled->fillTriangle(x0, y0, x1, y1, x2, y2, 1);\n\t\toled->display();\n }\n\t\t\n\t\/\/%\n\tvoid LoadingScreen() {\n\t\tint x,y = 0;\n\t\tint w = 21;\n\t\tint h = 64;\n\t\tfor (int i = 0; i < 6;i++){\n\t\t\tfillRect(x, y, w, h);\n\t\t\tx = x + 21;\n\t\t\toled->display();\n\t\t}\n\n\t}\n\n\t\/\/%\n\tvoid showProgress(int progress) {\n\t\toled->clearDisplay();\n\t\tdrawRect(0,21,128,21);\n\t\tfillRect(0,21,progress*128\/100,21);\n\t}\n #define printf(...) uBit.serial.printf(__VA_ARGS__)\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Defines main() function and command-line arguments used by ccons.\n\/\/\n\/\/ Part of ccons, the interactive console for the C programming language.\n\/\/\n\/\/ Copyright (c) 2009 Alexei Svitkine. This file is distributed under the\n\/\/ terms of MIT Open Source License. See file LICENSE for details.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/StringExtras.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/Signals.h>\n#include <llvm\/Target\/TargetSelect.h>\n\n#include \"Console.h\"\n#include \"EditLineReader.h\"\n#include \"InternalCommands.h\"\n#include \"RemoteConsole.h\"\n\nusing std::string;\nusing ccons::Console;\nusing ccons::IConsole;\nusing ccons::RemoteConsole;\nusing ccons::SerializedOutputConsole;\nusing ccons::LineReader;\nusing ccons::EditLineReader;\nusing ccons::StdInLineReader;\n\nstatic llvm::cl::opt<bool>\n\tDebugMode(\"ccons-debug\",\n\t\t\tllvm::cl::desc(\"Print debugging information\"));\nstatic llvm::cl::opt<bool>\n\tUseStdIo(\"ccons-use-std-io\",\n\t\t\tllvm::cl::desc(\"Use standard IO for input and output\"));\nstatic llvm::cl::opt<bool>\n\tSerializedOutput(\"ccons-serialized-output\",\n\t\t\tllvm::cl::desc(\"Output will be serialized\"));\nstatic llvm::cl::opt<bool>\n\tMultiProcess(\"ccons-multi-process\",\n\t\t\tllvm::cl::desc(\"Run in multi-process mode\"));\n\nstatic IConsole * createConsole()\n{\n\tif (MultiProcess)\n\t\treturn new RemoteConsole(DebugMode);\n\telse if (SerializedOutput)\n\t\treturn new SerializedOutputConsole(DebugMode);\t\t\n\telse\n\t\treturn new Console(DebugMode);\n}\n\nstatic LineReader * createReader()\n{\n\tif (UseStdIo)\n\t\treturn new StdInLineReader;\n\telse\n\t\treturn new EditLineReader;\n}\n\nextern \"C\" void LLVMInitializeX86TargetMC();\n\nint main(const int argc, char **argv)\n{\n\tllvm::cl::SetVersionPrinter(ccons::PrintVersionInformation);\n\tllvm::cl::ParseCommandLineOptions(argc, argv, \"ccons Interactive C Console\\n\",\n\t false\/*, \"ccons-\"*\/);\n\n\tif (DebugMode && !SerializedOutput) {\n\t\tstd::cerr << \"NOTE: Debugging information will be displayed.\\n\";\n\t\tllvm::sys::PrintStackTraceOnErrorSignal();\n\t}\n\n\tllvm::InitializeNativeTarget();\n\n\t\/\/ FIXME: This shouldn't be needed - it should have been done by llvm::InitializeNativeTarget().\n\tLLVMInitializeX86TargetMC();\n\n\tllvm::OwningPtr<IConsole> console(createConsole());\n\tllvm::OwningPtr<LineReader> reader(createReader());\n\n\tconst char *line = reader->readLine(console->prompt(), console->input());\n\twhile (line) {\n\t\tconsole->process(line);\n\t\tline = reader->readLine(console->prompt(), console->input());\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>add a TODO<commit_after>\/\/\n\/\/ Defines main() function and command-line arguments used by ccons.\n\/\/\n\/\/ Part of ccons, the interactive console for the C programming language.\n\/\/\n\/\/ Copyright (c) 2009 Alexei Svitkine. This file is distributed under the\n\/\/ terms of MIT Open Source License. See file LICENSE for details.\n\/\/\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n\n#include <llvm\/ADT\/OwningPtr.h>\n#include <llvm\/ADT\/StringExtras.h>\n#include <llvm\/Support\/CommandLine.h>\n#include <llvm\/Support\/Signals.h>\n#include <llvm\/Target\/TargetSelect.h>\n\n#include \"Console.h\"\n#include \"EditLineReader.h\"\n#include \"InternalCommands.h\"\n#include \"RemoteConsole.h\"\n\nusing std::string;\nusing ccons::Console;\nusing ccons::IConsole;\nusing ccons::RemoteConsole;\nusing ccons::SerializedOutputConsole;\nusing ccons::LineReader;\nusing ccons::EditLineReader;\nusing ccons::StdInLineReader;\n\nstatic llvm::cl::opt<bool>\n\tDebugMode(\"ccons-debug\",\n\t\t\tllvm::cl::desc(\"Print debugging information\"));\nstatic llvm::cl::opt<bool>\n\tUseStdIo(\"ccons-use-std-io\",\n\t\t\tllvm::cl::desc(\"Use standard IO for input and output\"));\nstatic llvm::cl::opt<bool>\n\tSerializedOutput(\"ccons-serialized-output\",\n\t\t\tllvm::cl::desc(\"Output will be serialized\"));\nstatic llvm::cl::opt<bool>\n\tMultiProcess(\"ccons-multi-process\",\n\t\t\tllvm::cl::desc(\"Run in multi-process mode\"));\n\nstatic IConsole * createConsole()\n{\n\tif (MultiProcess)\n\t\treturn new RemoteConsole(DebugMode);\n\telse if (SerializedOutput)\n\t\treturn new SerializedOutputConsole(DebugMode);\t\t\n\telse\n\t\treturn new Console(DebugMode);\n}\n\nstatic LineReader * createReader()\n{\n\tif (UseStdIo)\n\t\treturn new StdInLineReader;\n\telse\n\t\treturn new EditLineReader;\n}\n\nextern \"C\" void LLVMInitializeX86TargetMC();\n\nint main(const int argc, char **argv)\n{\n\tllvm::cl::SetVersionPrinter(ccons::PrintVersionInformation);\n\tllvm::cl::ParseCommandLineOptions(argc, argv, \"ccons Interactive C Console\\n\",\n\t false\/*, \"ccons-\"*\/);\n\n\tif (DebugMode && !SerializedOutput) {\n\t\tstd::cerr << \"NOTE: Debugging information will be displayed.\\n\";\n\t\tllvm::sys::PrintStackTraceOnErrorSignal();\n\t}\n\n\tllvm::InitializeNativeTarget();\n\n\t\/\/ FIXME: This shouldn't be needed - it should have been done by llvm::InitializeNativeTarget().\n\t\/\/ TODO: Bisect builds and report a bug to LLVM if this doesn't disappear soon. I noticed the breakage at r139193 of LLVM.\n\tLLVMInitializeX86TargetMC();\n\n\tllvm::OwningPtr<IConsole> console(createConsole());\n\tllvm::OwningPtr<LineReader> reader(createReader());\n\n\tconst char *line = reader->readLine(console->prompt(), console->input());\n\twhile (line) {\n\t\tconsole->process(line);\n\t\tline = reader->readLine(console->prompt(), console->input());\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Update AliAnalysisTaskCaloHFEpp.cxx<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>changed cuts on the associated tracks<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ $Id: options.C,v 1.6 2000\/02\/06 19:54:07 oliver Exp $ \n\n#include <BALL\/DATATYPE\/options.h>\n\n#include <stdlib.h>\n#include <errno.h>\n#include <stdio.h>\n#include <math.h>\n\n#include <fstream>\n#include <list>\n#include <algorithm>\n\nusing namespace std;\n\nnamespace BALL \n{\n\n\tOptions::Options()\n\t\t:\tStringHashMap<String>(),\n\t\t\tname_(\"\")\n\t{\n\t}\n\n\n\tOptions::Options(const Options& options, bool deep)\n\t\t:\tStringHashMap<String>(options, deep),\n\t\t\tname_(options.name_)\n\t{\n\t}\n\n\n\tOptions::~Options()\n\t{\n\t}\n\n\tbool Options::isReal(const String& key) const\n\t{\n\t\terrno = 0;\n\t\tchar*\tendptr;\n\t\tString value(get(key));\n\n\t\t\/\/ an empty String is no real number\n\t\tif (value ==\"\")\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\t\/\/ try to convert it to a number\n\t\tstrtod(value.c_str(), &endptr);\n\n\t\t\/\/ return and tell whether it happend to work\n\t\treturn (errno == 0) && (endptr != value.c_str());\n\t}\n\n\tbool Options::isVector(const String& key) const \n\t{\n\t\tfloat\tdummy;\n\t\t\n\t\tif (!has(key))\n\t\t\treturn false;\n\n\t\tif (sscanf(get(key).c_str(), \"(%f %f %f)\", &dummy, &dummy, &dummy) == 3)\n\t\t\treturn true;\n\t\t\n\t\treturn false;\n\t}\n\n\tbool Options::isBool(const String& key) const\n\t{\n\t\tString s = get(key);\n\t\tif (s == \"\")\n\t\t\treturn false;\n\n\t\ts.toLower();\n\t\treturn (s.compare(\"true\") == 0 || s.compare(\"false\") == 0);\n\t}\n\n\n\tbool Options::isSet(const String& key) const\n\t{\n\t\treturn (StringHashMap<String>::find(key) != StringHashMap<String>::end());\n\t}\n\n\tbool Options::isInteger(const String& key) const \n\t{\n\t\tdouble double_value;\n\t\tlong long_value;\n\n\t\t\/\/ if it cannot be read as a floating point number\n\t\t\/\/ it cannot be an integer\n\t\tif (!isReal(key))\n\t\t\treturn false;\n\t\t\t\t\t\n\t\t\n\t\t\/\/ check wheter it is an integer\n\t\tlong_value = atol(get(key).c_str());\n\t\tdouble_value = atof(get(key).c_str());\n\n\t\t\/\/ check if it is an integer (cutoff is 1e-7)\n\t\tif (fabs(double_value - ((double)long_value)) <= 1e-7)\n\t\t\treturn true;\n\n\t\t\/\/ it is a floating point number, but no integer\n\t\treturn false;\n\t}\n\n\tdouble Options::getReal(const String& key) const \n\t{\n\t\tdouble value;\n\n\t\terrno = 0;\n\t\tvalue = atof((*find(key)).second.c_str());\n\t\t\n\t\tif (errno == 0){\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn 0.0;\n\t\t}\n\t}\n\n\tVector3\tOptions::getVector(const String& key) const \n\t{\n\t\tVector3\th(0,0,0);\n\t\t\n\t\tif (!has(key))\n\t\t{\n\t\t\treturn h;\n\t\t}\n\n\t\tsscanf(get(key).c_str(), \"(%f %f %f)\", &(h.x), &(h.y), &(h.z));\n\t\t\n\t\treturn h;\n\t}\n\n\tbool Options::getBool(const String& key) const \n\t{\n\t\tConstIterator it = find(key);\n\t\tif ((it != end()) && (it->second == \"true\"))\n\t\t{\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tlong Options::getInteger(const String& key) const \n\t{\n\t\tlong value;\n\n\t\terrno = 0;\n\t\tConstIterator it = find(key);\n\t\tif (it == end())\n\t\t\treturn 0;\n\n\t\tvalue = atol((*it).second.c_str());\n\t\t\n\t\tif (errno == 0)\n\t\t{\n\t\t\treturn value;\n\t\t} else {\n\t\t\terrno = 0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\n\tvoid Options::set(const String& key, const String& value)\n\t{\n\t\t(*this)[key] = value;\n\t}\n\n\tvoid Options::setInteger(const String& key, const long value)\n\t{\n\t\tstatic char buffer[MaxEntryLength + 1];\n\n\t\tsprintf(buffer, \"%ld\", value);\n\t\t\t\t\t\n\t\tset(key, &(buffer[0]));\n\t}\n\n\tvoid Options::setReal(const String& key, const double value)\n\t{\n\t\tchar buffer[MaxEntryLength + 1];\n\t\t\t\t\t\n\t\tsprintf(buffer, \"%f\", value);\n\t\t\t\t\t\n\t\tset(key, buffer);\n\t}\n\n\tvoid Options::setVector(const String& key, const Vector3& value)\n\t{\n\t\tchar buffer[MaxEntryLength + 1];\n\n\t\tsprintf(buffer, \"(%f %f %f)\", value.x, value.y, value.z);\n\n\t\tset(key, buffer);\n\t}\n\n\tvoid Options::setBool(const String& key, const bool value)\n\t{\n\t\tif (value)\n\t\t{\n\t\t\tset(key, \"true\");\n\t\t} else {\n\t\t\tset(key, \"false\");\n\t\t}\n\t}\n\n\tString Options::setDefault(const String& key, const String& value)\n\t{\n\t\tif (!has(key))\n\t\t{\n\t\t\tset(key, value);\n\t\t\treturn key;\n\t\t} else {\n\t\t\treturn get(key);\n\t\t}\n\t}\n\t\t\n\tdouble Options::setDefaultReal(const String& key, const double value)\n\t{\n\t\tif (!has(key) || !isReal(key))\n\t\t{\n\t\t\tsetReal(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getReal(key);\n\t\t}\n\t}\n\n\tbool Options::setDefaultBool(const String& key, const bool value)\n\t{\n\t\tif (!has(key) || !isBool(key))\n\t\t{\n\t\t\tsetBool(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getBool(key);\n\t\t}\n\t}\n\n\n\tlong Options::setDefaultInteger(const String& key, const long value)\n\t{\n\t\tif (!has(key) || !isInteger(key))\n\t\t{\n\t\t\tsetInteger(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getInteger(key);\n\t\t}\n\t}\n\n\n\n\tvoid Options::setName(const String& name)\n\t{\n\t\tname_ = name;\n\t}\n\n\tconst String& Options::getName() const\n\t{\n\t\treturn name_;\n\t}\n\n\tString Options::get(const String& key) const\n\t{\n\t\tConstIterator it = find(key);\n\n\t\tif (it == end())\n\t\t{\n\t\t\treturn \"\";\n\t\t} else {\n\t\t\treturn (*it).second;\n\t\t}\n\t}\n\n\tbool Options::readOptionFile(const String& filename)\n\t{\n\t\tifstream\t\tinfile;\n\n\t\tinfile.open(filename.c_str(), ios::in);\n\t\tif (!infile)\n\t\t\treturn false;\n\n\t\tchar\t\tbuffer[MaxEntryLength + 1];\n\t\tString\ts, key;\n\t\twhile (infile.getline(buffer, MaxEntryLength))\n\t\t{\n\t\t\tif ((buffer[0] != '#') && (buffer[0] != '!') && (buffer[0] != ';')) \n\t\t\t{\n\t\t\t\ts = buffer;\n\t\t\t\tkey = s.getField(0, \" \");\n\t\t\t\ts = s.after(\" \");\n\t\t\t\tset(key, s);\n\t\t\t}\n\t\t}\n\t\t\t\t\t\n\t\tinfile.close();\n\n\t\treturn true;\n\t}\n\t\t\n\n\tvoid Options::dump (ostream& stream, Size \/* depth *\/) const\n\t{\n\t\tstd::list<String>\t\tentry_list;\n\t\tString\t\t\t\t\t\t\tentry;\n\n\t\tstream << \"[OptionsTable: \" << getName() << \" (\" << size() << \" entries)]\" << endl;\n\n\t\tStringHashMap<String>::ConstIterator\tit(begin());\n\t\tfor(; !(it == end()); ++it)\n\t\t{\n\t\t\tentry = (*it).first + ' ' + (*it).second;\n\t\t\tentry_list.push_back(entry);\n\t\t}\n\n\t\tentry_list.sort();\n\n\t\tstd::list<String>::iterator\tlist_it = entry_list.begin();\n\t\tfor (; list_it != entry_list.end(); ++list_it) \n\t\t{\n\t \tstream << *list_it << endl;\n\t\t}\n\n\t\tstream << \"-----------------------------------\" << endl;\n\n\t\tentry_list.clear();\n\t}\n\n\n} \/\/ namespace BALL\n<commit_msg>fixed: options now supports both single and double precision vectors (depending on the current definition of Vector3)<commit_after>\/\/ $Id: options.C,v 1.7 2000\/03\/17 11:23:26 oliver Exp $ \n\n#include <BALL\/DATATYPE\/options.h>\n\n#include <stdlib.h>\n#include <errno.h>\n#include <stdio.h>\n#include <math.h>\n\n#include <fstream>\n#include <list>\n#include <algorithm>\n\nusing namespace std;\n\nnamespace BALL \n{\n\n\tOptions::Options()\n\t\t:\tStringHashMap<String>(),\n\t\t\tname_(\"\")\n\t{\n\t}\n\n\n\tOptions::Options(const Options& options, bool deep)\n\t\t:\tStringHashMap<String>(options, deep),\n\t\t\tname_(options.name_)\n\t{\n\t}\n\n\n\tOptions::~Options()\n\t{\n\t}\n\n\tbool Options::isReal(const String& key) const\n\t{\n\t\terrno = 0;\n\t\tchar*\tendptr;\n\t\tString value(get(key));\n\n\t\t\/\/ an empty String is no real number\n\t\tif (value ==\"\")\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\t\/\/ try to convert it to a number\n\t\tstrtod(value.c_str(), &endptr);\n\n\t\t\/\/ return and tell whether it happend to work\n\t\treturn (errno == 0) && (endptr != value.c_str());\n\t}\n\n\tbool Options::isVector(const String& key) const \n\t{\n\t\t\/\/ if the key does not exist - then the nonexistent value\t\n\t\t\/\/ cannot contain a vector\n\t\tif (!has(key))\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ try to interpret the string as three double values\n\t\tdouble dummy;\n\t\tif (sscanf(get(key).c_str(), \"(%lf %lf %lf)\", &dummy, &dummy, &dummy) == 3)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t\t\n\t\treturn false;\n\t}\n\n\tbool Options::isBool(const String& key) const\n\t{\n\t\tString s = get(key);\n\t\tif (s == \"\")\n\t\t\treturn false;\n\n\t\ts.toLower();\n\t\treturn (s.compare(\"true\") == 0 || s.compare(\"false\") == 0);\n\t}\n\n\n\tbool Options::isSet(const String& key) const\n\t{\n\t\treturn (StringHashMap<String>::find(key) != StringHashMap<String>::end());\n\t}\n\n\tbool Options::isInteger(const String& key) const \n\t{\n\t\tdouble double_value;\n\t\tlong long_value;\n\n\t\t\/\/ if it cannot be read as a floating point number\n\t\t\/\/ it cannot be an integer\n\t\tif (!isReal(key))\n\t\t\treturn false;\n\t\t\t\t\t\n\t\t\n\t\t\/\/ check wheter it is an integer\n\t\tlong_value = atol(get(key).c_str());\n\t\tdouble_value = atof(get(key).c_str());\n\n\t\t\/\/ check if it is an integer (cutoff is 1e-7)\n\t\tif (fabs(double_value - ((double)long_value)) <= 1e-7)\n\t\t\treturn true;\n\n\t\t\/\/ it is a floating point number, but no integer\n\t\treturn false;\n\t}\n\n\tdouble Options::getReal(const String& key) const \n\t{\n\t\tdouble value;\n\n\t\terrno = 0;\n\t\tvalue = atof((*find(key)).second.c_str());\n\t\t\n\t\tif (errno == 0){\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn 0.0;\n\t\t}\n\t}\n\n\tVector3\tOptions::getVector(const String& key) const \n\t{\n\t\tVector3\th(0,0,0);\n\t\t\n\t\tif (!has(key))\n\t\t{\n\t\t\treturn h;\n\t\t}\n\t\t\n\t\t\/\/ use temporary variables of double precision\n\t\t\/\/ this avoids trouble if the definition of \n\t\t\/\/ Vector3 is changed between TVector3<float> and TVector3<double>\n\t\tdouble x, y, z;\n\t\t\n\t\t\/\/ try to interpret the option as a vector\n\t\tsscanf(get(key).c_str(), \"(%lf %lf %lf)\", &(h.x), &(h.y), &(h.z));\n\t\th.x = x; \n\t\th.y = y;\n\t\th.z = z;\n\n\t\treturn h;\n\t}\n\n\tbool Options::getBool(const String& key) const \n\t{\n\t\tConstIterator it = find(key);\n\t\tif ((it != end()) && (it->second == \"true\"))\n\t\t{\n\t\t\treturn true;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tlong Options::getInteger(const String& key) const \n\t{\n\t\tlong value;\n\n\t\terrno = 0;\n\t\tConstIterator it = find(key);\n\t\tif (it == end())\n\t\t\treturn 0;\n\n\t\tvalue = atol((*it).second.c_str());\n\t\t\n\t\tif (errno == 0)\n\t\t{\n\t\t\treturn value;\n\t\t} else {\n\t\t\terrno = 0;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\n\tvoid Options::set(const String& key, const String& value)\n\t{\n\t\t(*this)[key] = value;\n\t}\n\n\tvoid Options::setInteger(const String& key, const long value)\n\t{\n\t\tstatic char buffer[MaxEntryLength + 1];\n\n\t\tsprintf(buffer, \"%ld\", value);\n\t\t\t\t\t\n\t\tset(key, &(buffer[0]));\n\t}\n\n\tvoid Options::setReal(const String& key, const double value)\n\t{\n\t\tchar buffer[MaxEntryLength + 1];\n\t\t\t\t\t\n\t\tsprintf(buffer, \"%f\", value);\n\t\t\t\t\t\n\t\tset(key, buffer);\n\t}\n\n\tvoid Options::setVector(const String& key, const Vector3& value)\n\t{\n\t\tchar buffer[MaxEntryLength + 1];\n\n\t\tsprintf(buffer, \"(%f %f %f)\", value.x, value.y, value.z);\n\n\t\tset(key, buffer);\n\t}\n\n\tvoid Options::setBool(const String& key, const bool value)\n\t{\n\t\tif (value)\n\t\t{\n\t\t\tset(key, \"true\");\n\t\t} else {\n\t\t\tset(key, \"false\");\n\t\t}\n\t}\n\n\tString Options::setDefault(const String& key, const String& value)\n\t{\n\t\tif (!has(key))\n\t\t{\n\t\t\tset(key, value);\n\t\t\treturn key;\n\t\t} else {\n\t\t\treturn get(key);\n\t\t}\n\t}\n\t\t\n\tdouble Options::setDefaultReal(const String& key, const double value)\n\t{\n\t\tif (!has(key) || !isReal(key))\n\t\t{\n\t\t\tsetReal(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getReal(key);\n\t\t}\n\t}\n\n\tbool Options::setDefaultBool(const String& key, const bool value)\n\t{\n\t\tif (!has(key) || !isBool(key))\n\t\t{\n\t\t\tsetBool(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getBool(key);\n\t\t}\n\t}\n\n\n\tlong Options::setDefaultInteger(const String& key, const long value)\n\t{\n\t\tif (!has(key) || !isInteger(key))\n\t\t{\n\t\t\tsetInteger(key, value);\n\t\t\treturn value;\n\t\t} else {\n\t\t\treturn getInteger(key);\n\t\t}\n\t}\n\n\n\n\tvoid Options::setName(const String& name)\n\t{\n\t\tname_ = name;\n\t}\n\n\tconst String& Options::getName() const\n\t{\n\t\treturn name_;\n\t}\n\n\tString Options::get(const String& key) const\n\t{\n\t\tConstIterator it = find(key);\n\n\t\tif (it == end())\n\t\t{\n\t\t\treturn \"\";\n\t\t} else {\n\t\t\treturn (*it).second;\n\t\t}\n\t}\n\n\tbool Options::readOptionFile(const String& filename)\n\t{\n\t\tifstream\t\tinfile;\n\n\t\tinfile.open(filename.c_str(), ios::in);\n\t\tif (!infile)\n\t\t\treturn false;\n\n\t\tchar\t\tbuffer[MaxEntryLength + 1];\n\t\tString\ts, key;\n\t\twhile (infile.getline(buffer, MaxEntryLength))\n\t\t{\n\t\t\tif ((buffer[0] != '#') && (buffer[0] != '!') && (buffer[0] != ';')) \n\t\t\t{\n\t\t\t\ts = buffer;\n\t\t\t\tkey = s.getField(0, \" \");\n\t\t\t\ts = s.after(\" \");\n\t\t\t\tset(key, s);\n\t\t\t}\n\t\t}\n\t\t\t\t\t\n\t\tinfile.close();\n\n\t\treturn true;\n\t}\n\t\t\n\n\tvoid Options::dump (ostream& stream, Size \/* depth *\/) const\n\t{\n\t\tstd::list<String>\t\tentry_list;\n\t\tString\t\t\t\t\t\t\tentry;\n\n\t\tstream << \"[OptionsTable: \" << getName() << \" (\" << size() << \" entries)]\" << endl;\n\n\t\tStringHashMap<String>::ConstIterator\tit(begin());\n\t\tfor(; !(it == end()); ++it)\n\t\t{\n\t\t\tentry = (*it).first + ' ' + (*it).second;\n\t\t\tentry_list.push_back(entry);\n\t\t}\n\n\t\tentry_list.sort();\n\n\t\tstd::list<String>::iterator\tlist_it = entry_list.begin();\n\t\tfor (; list_it != entry_list.end(); ++list_it) \n\t\t{\n\t \tstream << *list_it << endl;\n\t\t}\n\n\t\tstream << \"-----------------------------------\" << endl;\n\n\t\tentry_list.clear();\n\t}\n\n\n} \/\/ namespace BALL\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2012.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <list>\n\n#include \"Type.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"GlobalContext.hpp\"\n#include \"Variable.hpp\"\n\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/LiveVariableAnalysisProblem.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Offset.hpp\"\n#include \"mtac\/Statement.hpp\"\n\n#include \"ltac\/Statement.hpp\"\n\nusing namespace eddic;\n\nbool mtac::dead_code_elimination::operator()(mtac::Function& function){\n bool optimized = false;\n\n mtac::LiveVariableAnalysisProblem problem;\n auto results = mtac::data_flow(function, problem);\n\n for(auto& block : function){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n auto statement = *it;\n\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n if(mtac::erase_result((*ptr)->op)){\n if(results->OUT_S[statement].values().find((*ptr)->result) == results->OUT_S[statement].values().end()){\n it.erase();\n optimized=true;\n continue;\n }\n }\n }\n\n ++it;\n }\n }\n\n std::unordered_set<Offset, mtac::OffsetHash> used_offsets;\n\n for(auto& block : function){\n for(auto& statement : block->statements){\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n auto quadruple = *ptr;\n\n if(quadruple->op == mtac::Operator::DOT || quadruple->op == mtac::Operator::FDOT || quadruple->op == mtac::Operator::PDOT){\n if(auto* var_ptr = boost::get<std::shared_ptr<Variable>>(&*quadruple->arg1)){\n if(auto* offset_ptr = boost::get<int>(&*quadruple->arg2)){\n mtac::Offset offset(*var_ptr, *offset_ptr);\n used_offsets.insert(offset);\n }\n }\n }\n }\n }\n }\n\n for(auto& block : function){\n auto it = block->statements.begin();\n auto end = block->statements.end();\n\n while(it != end){\n auto statement = *it;\n\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n auto quadruple = *ptr;\n\n if(quadruple->op == mtac::Operator::DOT_ASSIGN || quadruple->op == mtac::Operator::DOT_FASSIGN || quadruple->op == mtac::Operator::DOT_PASSIGN){\n \/\/Arrays are a problem because they are not considered as escaped after being passed in parameters\n if(!quadruple->result->type()->is_pointer() && !quadruple->result->type()->is_array()){\n if(auto* offset_ptr = boost::get<int>(&*quadruple->arg1)){\n if(quadruple->result->type()->is_custom_type() || quadruple->result->type()->is_template_type()){\n auto struct_type = function.context->global()->get_struct(quadruple->result->type()->mangle());\n auto member_type = function.context->global()->member_type(struct_type, *offset_ptr);\n\n if(member_type->is_pointer()){\n ++it;\n continue;\n }\n }\n\n mtac::Offset offset(quadruple->result, *offset_ptr);\n\n if(problem.pointer_escaped->find(quadruple->result) == problem.pointer_escaped->end() && used_offsets.find(offset) == used_offsets.end()){\n it = block->statements.erase(it);\n end = block->statements.end();\n optimized=true;\n continue;\n }\n }\n }\n }\n }\n\n ++it;\n }\n }\n\n return optimized;\n}\n<commit_msg>Fix DCE<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2012.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <list>\n\n#include \"Type.hpp\"\n#include \"FunctionContext.hpp\"\n#include \"GlobalContext.hpp\"\n#include \"Variable.hpp\"\n\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/LiveVariableAnalysisProblem.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Offset.hpp\"\n#include \"mtac\/Statement.hpp\"\n\n#include \"ltac\/Statement.hpp\"\n\nusing namespace eddic;\n\nbool mtac::dead_code_elimination::operator()(mtac::Function& function){\n bool optimized = false;\n\n mtac::LiveVariableAnalysisProblem problem;\n auto results = mtac::data_flow(function, problem);\n\n for(auto& block : function){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n auto statement = *it;\n\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n if(mtac::erase_result((*ptr)->op)){\n if(results->OUT_S[statement].top() || results->OUT_S[statement].values().find((*ptr)->result) == results->OUT_S[statement].values().end()){\n it.erase();\n optimized=true;\n continue;\n }\n }\n }\n\n ++it;\n }\n }\n\n std::unordered_set<Offset, mtac::OffsetHash> used_offsets;\n\n for(auto& block : function){\n for(auto& statement : block->statements){\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n auto quadruple = *ptr;\n\n if(quadruple->op == mtac::Operator::DOT || quadruple->op == mtac::Operator::FDOT || quadruple->op == mtac::Operator::PDOT){\n if(auto* var_ptr = boost::get<std::shared_ptr<Variable>>(&*quadruple->arg1)){\n if(auto* offset_ptr = boost::get<int>(&*quadruple->arg2)){\n mtac::Offset offset(*var_ptr, *offset_ptr);\n used_offsets.insert(offset);\n }\n }\n }\n }\n }\n }\n\n for(auto& block : function){\n auto it = block->statements.begin();\n auto end = block->statements.end();\n\n while(it != end){\n auto statement = *it;\n\n if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&statement)){\n auto quadruple = *ptr;\n\n if(quadruple->op == mtac::Operator::DOT_ASSIGN || quadruple->op == mtac::Operator::DOT_FASSIGN || quadruple->op == mtac::Operator::DOT_PASSIGN){\n \/\/Arrays are a problem because they are not considered as escaped after being passed in parameters\n if(!quadruple->result->type()->is_pointer() && !quadruple->result->type()->is_array()){\n if(auto* offset_ptr = boost::get<int>(&*quadruple->arg1)){\n if(quadruple->result->type()->is_custom_type() || quadruple->result->type()->is_template_type()){\n auto struct_type = function.context->global()->get_struct(quadruple->result->type()->mangle());\n auto member_type = function.context->global()->member_type(struct_type, *offset_ptr);\n\n if(member_type->is_pointer()){\n ++it;\n continue;\n }\n }\n\n mtac::Offset offset(quadruple->result, *offset_ptr);\n\n if(problem.pointer_escaped->find(quadruple->result) == problem.pointer_escaped->end() && used_offsets.find(offset) == used_offsets.end()){\n it = block->statements.erase(it);\n end = block->statements.end();\n optimized=true;\n continue;\n }\n }\n }\n }\n }\n\n ++it;\n }\n }\n\n return optimized;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <thrift\/conformance\/rpcclient\/GTestHarnessRPCClient.h>\n\n#include <chrono>\n#include <memory>\n#include <stdexcept>\n\n#include <fmt\/core.h>\n#include <folly\/Subprocess.h>\n#include <folly\/experimental\/coro\/AsyncGenerator.h>\n#include <folly\/experimental\/coro\/BlockingWait.h>\n#include <folly\/experimental\/coro\/Sleep.h>\n#include <folly\/futures\/Future.h>\n#include <thrift\/conformance\/RpcStructComparator.h>\n#include <thrift\/conformance\/Utils.h>\n#include <thrift\/conformance\/if\/gen-cpp2\/RPCConformanceService.h>\n#include <thrift\/lib\/cpp2\/async\/Sink.h>\n#include <thrift\/lib\/cpp2\/server\/BaseThriftServer.h>\n#include <thrift\/lib\/cpp2\/util\/ScopedServerInterfaceThread.h>\n\nnamespace apache::thrift::conformance {\n\nclass ConformanceVerificationServer\n : public apache::thrift::ServiceHandler<RPCConformanceService> {\n public:\n explicit ConformanceVerificationServer(const RpcTestCase& testCase)\n : testCase_(testCase) {}\n\n void getTestCase(RpcTestCase& testCase) override {\n testCase = testCase_;\n getTestReceivedPromise_.setValue();\n }\n\n void sendTestResult(std::unique_ptr<ClientTestResult> result) override {\n clientResultPromise_.setValue(*result);\n }\n\n \/\/ =================== Request-Response ===================\n void requestResponseBasic(\n Response& res, std::unique_ptr<Request> req) override {\n res =\n *testCase_.serverInstruction()->requestResponseBasic_ref()->response();\n serverResult_.requestResponseBasic_ref().emplace().request() = *req;\n }\n\n void requestResponseDeclaredException(std::unique_ptr<Request> req) override {\n serverResult_.requestResponseDeclaredException_ref().emplace().request() =\n *req;\n throw can_throw(*testCase_.serverInstruction()\n ->requestResponseDeclaredException_ref()\n ->userException());\n }\n\n void requestResponseUndeclaredException(\n std::unique_ptr<Request> req) override {\n serverResult_.requestResponseUndeclaredException_ref().emplace().request() =\n *req;\n throw std::runtime_error(*testCase_.serverInstruction()\n ->requestResponseUndeclaredException_ref()\n ->exceptionMessage());\n }\n\n void requestResponseNoArgVoidResponse() override {\n serverResult_.requestResponseNoArgVoidResponse_ref().emplace();\n }\n\n void requestResponseTimeout(\n Response&, std::unique_ptr<Request> req) override {\n serverResult_.requestResponseTimeout_ref().emplace().request() = *req;\n folly::coro::blockingWait([&]() -> folly::coro::Task<void> {\n co_await folly::coro::sleep(\n std::chrono::milliseconds(*testCase_.serverInstruction()\n ->requestResponseTimeout_ref()\n ->timeoutMs()));\n }());\n }\n\n \/\/ =================== Stream ===================\n apache::thrift::ServerStream<Response> streamBasic(\n std::unique_ptr<Request> req) override {\n serverResult_.streamBasic_ref().emplace().request() = *req;\n for (auto payload :\n *testCase_.serverInstruction()->streamBasic_ref()->streamPayloads()) {\n co_yield std::move(payload);\n }\n }\n\n apache::thrift::ServerStream<Response> streamChunkTimeout(\n std::unique_ptr<Request> req) override {\n serverResult_.streamChunkTimeout_ref().emplace().request() = *req;\n for (auto payload : *testCase_.serverInstruction()\n ->streamChunkTimeout_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n co_await folly::coro::sleep(\n std::chrono::milliseconds(*testCase_.serverInstruction()\n ->streamChunkTimeout_ref()\n ->chunkTimeoutMs()));\n }\n\n apache::thrift::ResponseAndServerStream<Response, Response>\n streamInitialResponse(std::unique_ptr<Request> req) override {\n serverResult_.streamInitialResponse_ref().emplace().request() = *req;\n auto stream = folly::coro::co_invoke(\n [&]() -> folly::coro::AsyncGenerator<Response&&> {\n for (auto payload : *testCase_.serverInstruction()\n ->streamInitialResponse_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n });\n\n return {\n *testCase_.serverInstruction()\n ->streamInitialResponse_ref()\n ->initialResponse(),\n std::move(stream)};\n }\n\n apache::thrift::ServerStream<Response> streamCreditTimeout(\n std::unique_ptr<Request> req) override {\n serverResult_.streamCreditTimeout_ref().emplace().request() = *req;\n for (auto payload : *testCase_.serverInstruction()\n ->streamCreditTimeout_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n }\n\n \/\/ =================== Sink ===================\n apache::thrift::SinkConsumer<Request, Response> sinkBasic(\n std::unique_ptr<Request> req) override {\n serverResult_.sinkBasic_ref().emplace().request() = *req;\n return apache::thrift::SinkConsumer<Request, Response>{\n [&](folly::coro::AsyncGenerator<Request&&> gen)\n -> folly::coro::Task<Response> {\n while (auto item = co_await gen.next()) {\n serverResult_.sinkBasic_ref()->sinkPayloads()->push_back(\n std::move(*item));\n }\n co_return *testCase_.serverInstruction()\n ->sinkBasic_ref()\n ->finalResponse();\n },\n static_cast<uint64_t>(\n *testCase_.serverInstruction()->sinkBasic_ref()->bufferSize())};\n }\n\n folly::SemiFuture<folly::Unit> getTestReceived() {\n return getTestReceivedPromise_.getSemiFuture();\n }\n\n folly::SemiFuture<ClientTestResult> clientResult() {\n return clientResultPromise_.getSemiFuture();\n }\n\n const ServerTestResult& serverResult() { return serverResult_; }\n\n private:\n const RpcTestCase& testCase_;\n folly::Promise<folly::Unit> getTestReceivedPromise_;\n folly::Promise<ClientTestResult> clientResultPromise_;\n ServerTestResult serverResult_;\n};\n\nclass RPCClientConformanceTest : public testing::Test {\n public:\n RPCClientConformanceTest(\n std::string_view clientCmd, const TestCase* testCase, bool conforming)\n : testCase_(*testCase),\n conforming_(conforming),\n handler_(std::make_shared<ConformanceVerificationServer>(\n *testCase_.rpc_ref())),\n server_(handler_) {\n clientProcess_ = folly::Subprocess(std::vector<std::string>{\n std::string(clientCmd),\n \"--port\",\n folly::to<std::string>(server_.getPort())});\n if (testCase_.rpc_ref()->serverInstruction()->streamCreditTimeout_ref()) {\n server_.getThriftServer().setStreamExpireTime(\n std::chrono::milliseconds{*testCase_.rpc_ref()\n ->serverInstruction()\n ->streamCreditTimeout_ref()\n ->streamExpireTime()});\n }\n }\n\n protected:\n void TestBody() override {\n \/\/ Wait for client to fetch test case\n bool getTestReceived =\n handler_->getTestReceived().wait(std::chrono::seconds(5));\n EXPECT_EQ(conforming_, getTestReceived);\n\n \/\/ End test if client was unable to fetch test case\n if (!getTestReceived) {\n return;\n }\n\n \/\/ Wait for result from client\n folly::Try<ClientTestResult> actualClientResult =\n handler_->clientResult().within(std::chrono::seconds(5)).getTry();\n\n \/\/ End test if result was not received\n if (actualClientResult.hasException()) {\n EXPECT_FALSE(conforming_);\n return;\n }\n\n auto& expectedClientResult = *testCase_.rpc_ref()->clientTestResult();\n if (!equal(*actualClientResult, expectedClientResult)) {\n EXPECT_FALSE(conforming_);\n }\n\n auto& actualServerResult = handler_->serverResult();\n auto& expectedServerResult = *testCase_.rpc_ref()->serverTestResult();\n if (actualServerResult != expectedServerResult) {\n EXPECT_FALSE(conforming_);\n }\n\n EXPECT_TRUE(conforming_);\n }\n\n void TearDown() override {\n clientProcess_.sendSignal(SIGINT);\n clientProcess_.waitOrTerminateOrKill(\n std::chrono::seconds(5), std::chrono::seconds(5));\n }\n\n private:\n const TestCase& testCase_;\n bool conforming_;\n std::shared_ptr<ConformanceVerificationServer> handler_;\n apache::thrift::ScopedServerInterfaceThread server_;\n folly::Subprocess clientProcess_;\n};\n\nvoid registerTests(\n std::string_view category,\n const TestSuite* suite,\n const std::set<std::string>& nonconforming,\n std::string_view clientCmd,\n const char* file,\n int line) {\n for (const auto& test : *suite->tests()) {\n for (const auto& testCase : *test.testCases()) {\n std::string suiteName =\n fmt::format(\"{}\/{}\/{}\", category, *suite->name(), *testCase.name());\n std::string fullName = fmt::format(\"{}.{}\", suiteName, *test.name());\n bool conforming = nonconforming.find(fullName) == nonconforming.end();\n registerTest(\n suiteName.c_str(),\n test.name()->c_str(),\n nullptr,\n conforming ? nullptr : \"nonconforming\",\n file,\n line,\n [&testCase, clientCmd, conforming]() {\n return new RPCClientConformanceTest(\n clientCmd, &testCase, conforming);\n });\n }\n }\n}\n\n} \/\/ namespace apache::thrift::conformance\n<commit_msg>Respect nonconforming in rpcclient test<commit_after>\/*\n * Copyright (c) Meta Platforms, Inc. and affiliates.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <thrift\/conformance\/rpcclient\/GTestHarnessRPCClient.h>\n\n#include <chrono>\n#include <memory>\n#include <stdexcept>\n\n#include <fmt\/core.h>\n#include <folly\/Subprocess.h>\n#include <folly\/experimental\/coro\/AsyncGenerator.h>\n#include <folly\/experimental\/coro\/BlockingWait.h>\n#include <folly\/experimental\/coro\/Sleep.h>\n#include <folly\/futures\/Future.h>\n#include <thrift\/conformance\/RpcStructComparator.h>\n#include <thrift\/conformance\/Utils.h>\n#include <thrift\/conformance\/if\/gen-cpp2\/RPCConformanceService.h>\n#include <thrift\/lib\/cpp2\/async\/Sink.h>\n#include <thrift\/lib\/cpp2\/server\/BaseThriftServer.h>\n#include <thrift\/lib\/cpp2\/util\/ScopedServerInterfaceThread.h>\n\nnamespace apache::thrift::conformance {\n\nclass ConformanceVerificationServer\n : public apache::thrift::ServiceHandler<RPCConformanceService> {\n public:\n explicit ConformanceVerificationServer(const RpcTestCase& testCase)\n : testCase_(testCase) {}\n\n void getTestCase(RpcTestCase& testCase) override {\n testCase = testCase_;\n getTestReceivedPromise_.setValue();\n }\n\n void sendTestResult(std::unique_ptr<ClientTestResult> result) override {\n clientResultPromise_.setValue(*result);\n }\n\n \/\/ =================== Request-Response ===================\n void requestResponseBasic(\n Response& res, std::unique_ptr<Request> req) override {\n res =\n *testCase_.serverInstruction()->requestResponseBasic_ref()->response();\n serverResult_.requestResponseBasic_ref().emplace().request() = *req;\n }\n\n void requestResponseDeclaredException(std::unique_ptr<Request> req) override {\n serverResult_.requestResponseDeclaredException_ref().emplace().request() =\n *req;\n throw can_throw(*testCase_.serverInstruction()\n ->requestResponseDeclaredException_ref()\n ->userException());\n }\n\n void requestResponseUndeclaredException(\n std::unique_ptr<Request> req) override {\n serverResult_.requestResponseUndeclaredException_ref().emplace().request() =\n *req;\n throw std::runtime_error(*testCase_.serverInstruction()\n ->requestResponseUndeclaredException_ref()\n ->exceptionMessage());\n }\n\n void requestResponseNoArgVoidResponse() override {\n serverResult_.requestResponseNoArgVoidResponse_ref().emplace();\n }\n\n void requestResponseTimeout(\n Response&, std::unique_ptr<Request> req) override {\n serverResult_.requestResponseTimeout_ref().emplace().request() = *req;\n folly::coro::blockingWait([&]() -> folly::coro::Task<void> {\n co_await folly::coro::sleep(\n std::chrono::milliseconds(*testCase_.serverInstruction()\n ->requestResponseTimeout_ref()\n ->timeoutMs()));\n }());\n }\n\n \/\/ =================== Stream ===================\n apache::thrift::ServerStream<Response> streamBasic(\n std::unique_ptr<Request> req) override {\n serverResult_.streamBasic_ref().emplace().request() = *req;\n for (auto payload :\n *testCase_.serverInstruction()->streamBasic_ref()->streamPayloads()) {\n co_yield std::move(payload);\n }\n }\n\n apache::thrift::ServerStream<Response> streamChunkTimeout(\n std::unique_ptr<Request> req) override {\n serverResult_.streamChunkTimeout_ref().emplace().request() = *req;\n for (auto payload : *testCase_.serverInstruction()\n ->streamChunkTimeout_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n co_await folly::coro::sleep(\n std::chrono::milliseconds(*testCase_.serverInstruction()\n ->streamChunkTimeout_ref()\n ->chunkTimeoutMs()));\n }\n\n apache::thrift::ResponseAndServerStream<Response, Response>\n streamInitialResponse(std::unique_ptr<Request> req) override {\n serverResult_.streamInitialResponse_ref().emplace().request() = *req;\n auto stream = folly::coro::co_invoke(\n [&]() -> folly::coro::AsyncGenerator<Response&&> {\n for (auto payload : *testCase_.serverInstruction()\n ->streamInitialResponse_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n });\n\n return {\n *testCase_.serverInstruction()\n ->streamInitialResponse_ref()\n ->initialResponse(),\n std::move(stream)};\n }\n\n apache::thrift::ServerStream<Response> streamCreditTimeout(\n std::unique_ptr<Request> req) override {\n serverResult_.streamCreditTimeout_ref().emplace().request() = *req;\n for (auto payload : *testCase_.serverInstruction()\n ->streamCreditTimeout_ref()\n ->streamPayloads()) {\n co_yield std::move(payload);\n }\n }\n\n \/\/ =================== Sink ===================\n apache::thrift::SinkConsumer<Request, Response> sinkBasic(\n std::unique_ptr<Request> req) override {\n serverResult_.sinkBasic_ref().emplace().request() = *req;\n return apache::thrift::SinkConsumer<Request, Response>{\n [&](folly::coro::AsyncGenerator<Request&&> gen)\n -> folly::coro::Task<Response> {\n while (auto item = co_await gen.next()) {\n serverResult_.sinkBasic_ref()->sinkPayloads()->push_back(\n std::move(*item));\n }\n co_return *testCase_.serverInstruction()\n ->sinkBasic_ref()\n ->finalResponse();\n },\n static_cast<uint64_t>(\n *testCase_.serverInstruction()->sinkBasic_ref()->bufferSize())};\n }\n\n folly::SemiFuture<folly::Unit> getTestReceived() {\n return getTestReceivedPromise_.getSemiFuture();\n }\n\n folly::SemiFuture<ClientTestResult> clientResult() {\n return clientResultPromise_.getSemiFuture();\n }\n\n const ServerTestResult& serverResult() { return serverResult_; }\n\n private:\n const RpcTestCase& testCase_;\n folly::Promise<folly::Unit> getTestReceivedPromise_;\n folly::Promise<ClientTestResult> clientResultPromise_;\n ServerTestResult serverResult_;\n};\n\nclass RPCClientConformanceTest : public testing::Test {\n public:\n RPCClientConformanceTest(\n std::string_view clientCmd, const TestCase* testCase, bool conforming)\n : testCase_(*testCase),\n conforming_(conforming),\n handler_(std::make_shared<ConformanceVerificationServer>(\n *testCase_.rpc_ref())),\n server_(handler_) {\n clientProcess_ = folly::Subprocess(std::vector<std::string>{\n std::string(clientCmd),\n \"--port\",\n folly::to<std::string>(server_.getPort())});\n if (testCase_.rpc_ref()->serverInstruction()->streamCreditTimeout_ref()) {\n server_.getThriftServer().setStreamExpireTime(\n std::chrono::milliseconds{*testCase_.rpc_ref()\n ->serverInstruction()\n ->streamCreditTimeout_ref()\n ->streamExpireTime()});\n }\n }\n\n protected:\n void TestBody() override {\n \/\/ Wait for client to fetch test case\n bool getTestReceived =\n handler_->getTestReceived().wait(std::chrono::seconds(5));\n\n \/\/ End test if client was unable to fetch test case\n if (!getTestReceived) {\n EXPECT_FALSE(conforming_);\n return;\n }\n\n \/\/ Wait for result from client\n folly::Try<ClientTestResult> actualClientResult =\n handler_->clientResult().within(std::chrono::seconds(5)).getTry();\n\n \/\/ End test if result was not received\n if (actualClientResult.hasException()) {\n EXPECT_FALSE(conforming_);\n return;\n }\n\n auto& expectedClientResult = *testCase_.rpc_ref()->clientTestResult();\n if (!equal(*actualClientResult, expectedClientResult)) {\n EXPECT_FALSE(conforming_);\n }\n\n auto& actualServerResult = handler_->serverResult();\n auto& expectedServerResult = *testCase_.rpc_ref()->serverTestResult();\n if (actualServerResult != expectedServerResult) {\n EXPECT_FALSE(conforming_);\n }\n\n EXPECT_TRUE(conforming_);\n }\n\n void TearDown() override {\n clientProcess_.sendSignal(SIGINT);\n clientProcess_.waitOrTerminateOrKill(\n std::chrono::seconds(5), std::chrono::seconds(5));\n }\n\n private:\n const TestCase& testCase_;\n bool conforming_;\n std::shared_ptr<ConformanceVerificationServer> handler_;\n apache::thrift::ScopedServerInterfaceThread server_;\n folly::Subprocess clientProcess_;\n};\n\nvoid registerTests(\n std::string_view category,\n const TestSuite* suite,\n const std::set<std::string>& nonconforming,\n std::string_view clientCmd,\n const char* file,\n int line) {\n for (const auto& test : *suite->tests()) {\n for (const auto& testCase : *test.testCases()) {\n std::string suiteName =\n fmt::format(\"{}\/{}\/{}\", category, *suite->name(), *testCase.name());\n std::string fullName = fmt::format(\"{}.{}\", suiteName, *test.name());\n bool conforming = nonconforming.find(fullName) == nonconforming.end();\n registerTest(\n suiteName.c_str(),\n test.name()->c_str(),\n nullptr,\n conforming ? nullptr : \"nonconforming\",\n file,\n line,\n [&testCase, clientCmd, conforming]() {\n return new RPCClientConformanceTest(\n clientCmd, &testCase, conforming);\n });\n }\n }\n}\n\n} \/\/ namespace apache::thrift::conformance\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (c) 2006 University of Edinburgh\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, \nare permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, \n\t\t\tthis list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, \n\t\t\tthis list of conditions and the following disclaimer in the documentation \n\t\t\tand\/or other materials provided with the distribution.\n * Neither the name of the University of Edinburgh nor the names of its contributors \n\t\t\tmay be used to endorse or promote products derived from this software \n\t\t\twithout specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, \nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR \nPURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS \nBE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER \nIN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \nPOSSIBILITY OF SUCH DAMAGE.\n***********************************************************************\/\n\n\/\/ example file on how to use moses library\n\n#ifdef WIN32\n\/\/ Include Visual Leak Detector\n#include <vld.h>\n#endif\n\n#include <fstream>\n#include \"Main.h\"\n#include \"LatticePath.h\"\n#include \"FactorCollection.h\"\n#include \"Manager.h\"\n#include \"Phrase.h\"\n#include \"Util.h\"\n#include \"LatticePathList.h\"\n#include \"Timer.h\"\n#include \"IOCommandLine.h\"\n#include \"IOFile.h\"\n#include \"Sentence.h\"\n#include \"ConfusionNet.h\"\n\n#if HAVE_CONFIG_H\n#include \"config.h\"\n# ifdef HAVE_MYSQLPP\n# define USE_MYSQL 1\n# endif\n#else\n\/\/ those not using autoconf have to build MySQL support for now\n# define USE_MYSQL 1\n#endif\n\n#undef USE_MYSQL\n#ifdef USE_MYSQL\n#include \"IOMySQL.h\"\n#endif\n\nusing namespace std;\nTimer timer;\n\nint main(int argc, char* argv[])\n{\n\ttimer.start(\"Starting...\");\n\n\tstd::cerr\n\t\t<<\"============================================================================\\n\"\n\t\t<<\"starting \"<<argv[0]<<\" (build on \"<<__DATE__<<\")\\n\"\n\t\t<<\"============================================================================\\n\"\n\t\t<<\"\\n\"\n <<\"the command line was: \\n\";\n\tfor(int i=0;i<argc;++i) std::cerr<<argv[i]<<\" \";\n std::cerr\n\t\t<<\"\\n\"\n\t\t<<\"============================================================================\\n\";\n\n\n\tStaticData staticData;\n\n\tif (!staticData.LoadParameters(argc, argv))\n\t\treturn EXIT_FAILURE;\n\n\t\/*\n\t * boost::shared_ptr<UnknownWordHandler> unknownWordHandler(new UnknownWordHandler);\n\tstaticData.SetUnknownWordHandler(unknownWordHandler);\n *\/\n\t\tif (staticData.GetVerboseLevel() > 0)\n\t\t{\n#if N_BEST\n\t\tstd::cerr << \"N_BEST=enabled\\n\";\n#else\n\t\tstd::cerr << \"N_BEST=disabled\\n\";\n#endif\n\t\t}\n\n\n\t\/\/ set up read\/writing class\n\tInputOutput *inputOutput = GetInputOutput(staticData);\n\n std::cerr << \"The score component vector looks like this:\\n\" << staticData.GetScoreIndexManager();\n\n\tif (inputOutput == NULL)\n\t\treturn EXIT_FAILURE;\n\n\t\/\/ read each sentence & decode\n\twhile(InputType *source = inputOutput->GetInput((staticData.GetInputType() ? \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t static_cast<InputType*>(new ConfusionNet) : \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t static_cast<InputType*>(new Sentence(Input)))))\n\t{\n\t\tTRACE_ERR(*source<<\"\\n\");\n\n\t\tTranslationOptionCollection *translationOptionCollection=source->CreateTranslationOptionCollection();\n\t\tassert(translationOptionCollection);\n\n\t\tstaticData.InitializeBeforeSentenceProcessing(*source);\n\t\tManager manager(*source, *translationOptionCollection, staticData);\n\t\tmanager.ProcessSentence();\n\t\tinputOutput->SetOutput(manager.GetBestHypothesis(), source->GetTranslationId(),\n staticData.GetReportSourceSpan(),\n staticData.GetReportAllFactors()\n );\n\n\t\t\/\/ n-best\n\t\tsize_t nBestSize = staticData.GetNBestSize();\n\t\tif (nBestSize > 0)\n\t\t{\n\t\t\tTRACE_ERR(nBestSize << \" \" << staticData.GetNBestFilePath() << endl);\n\t\t\tLatticePathList nBestList;\n\t\t\tmanager.CalcNBest(nBestSize, nBestList);\n\t\t\tinputOutput->SetNBest(nBestList, source->GetTranslationId());\n\t\t\tRemoveAllInColl< LatticePathList::iterator > (nBestList);\n\t\t}\n\n\t\t\/\/ delete source\n\t\t\/\/\t\tinputOutput->Release(source);\n\t\tstaticData.CleanUpAfterSentenceProcessing();\n\t\tdelete translationOptionCollection;\n\t\tdelete source;\n\t}\n\t\n\tdelete inputOutput;\n\n\n\ttimer.check(\"End.\");\n\treturn EXIT_SUCCESS;\n}\n\nInputOutput *GetInputOutput(StaticData &staticData)\n{\n\tInputOutput *inputOutput;\n\tconst std::vector<FactorType> &factorOrder = staticData.GetInputFactorOrder();\n\tFactorTypeSet inputFactorUsed(factorOrder);\n\n\t\/\/ io\n\tif (staticData.GetIOMethod() == IOMethodMySQL)\n\t{\n\t\tTRACE_ERR(\"IO from MySQL\" << endl);\n#if USE_MYSQL\n\t\tconst PARAM_VEC &mySQLParam = staticData.GetParam(\"mysql\");\n\t\tinputOutput = new IOMySQL(mySQLParam[0], mySQLParam[1], mySQLParam[2], mySQLParam[3]\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t, Scan<long>(mySQLParam[4]), Scan<long>(mySQLParam[5])\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t, factorOrder, inputFactorUsed, staticData.GetFactorCollection());\n\t\tstaticData.LoadPhraseTables();\n#else\n\t\tTRACE_ERR( \"moses was not built with mysql libraries, please configure\\n\"\n\t\t\t\t\t\t\t<< \" to use another input method.\\n\");\n\t\tinputOutput = NULL;\n#endif\n\t}\n\telse if (staticData.GetIOMethod() == IOMethodFile)\n\t{\n\t\tTRACE_ERR(\"IO from File\" << endl);\n\t\tstring\t\t\t\t\tinputFileHash;\n\t\tlist< Phrase >\tinputPhraseList;\n\t\tstring filePath = staticData.GetParam(\"input-file\")[0];\n\n\t\tTRACE_ERR(\"About to create ioFile\" << endl);\n\t\tIOFile *ioFile = new IOFile(factorOrder, inputFactorUsed\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetFactorCollection()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestSize()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestFilePath()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, filePath);\n\t\tif(staticData.GetInputType()) \n\t\t\t{\n\t\t\t\tTRACE_ERR(\"Do not read input phrases for confusion net translation\\n\");\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\t\tTRACE_ERR(\"About to GetInputPhrase\\n\");\n\t\t\t\tioFile->GetInputPhrase(inputPhraseList);\n\t\t\t}\n\t\tTRACE_ERR(\"After GetInputPhrase\" << endl);\n\t\tinputOutput = ioFile;\n\t\tinputFileHash = GetMD5Hash(filePath);\n\t\tTRACE_ERR(\"About to LoadPhraseTables\" << endl);\n\t\tstaticData.LoadPhraseTables(true, inputFileHash, inputPhraseList);\n\t\tioFile->ResetSentenceId();\n\t}\n\telse\n\t{\n\t\tTRACE_ERR(\"IO from STDOUT\/STDIN\" << endl);\n\t\tinputOutput = new IOCommandLine(factorOrder, inputFactorUsed\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetFactorCollection()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestSize()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestFilePath());\n\t\tstaticData.LoadPhraseTables();\n\t}\n\tstaticData.LoadMapping();\n\ttimer.check(\"Created input-output object\");\n\n\treturn inputOutput;\n}\n\n<commit_msg>add score logging<commit_after>\/\/ $Id$\n\n\/***********************************************************************\nMoses - factored phrase-based language decoder\nCopyright (c) 2006 University of Edinburgh\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without modification, \nare permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice, \n\t\t\tthis list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, \n\t\t\tthis list of conditions and the following disclaimer in the documentation \n\t\t\tand\/or other materials provided with the distribution.\n * Neither the name of the University of Edinburgh nor the names of its contributors \n\t\t\tmay be used to endorse or promote products derived from this software \n\t\t\twithout specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, \nTHE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR \nPURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS \nBE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR \nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER \nIN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \nPOSSIBILITY OF SUCH DAMAGE.\n***********************************************************************\/\n\n\/\/ example file on how to use moses library\n\n#ifdef WIN32\n\/\/ Include Visual Leak Detector\n#include <vld.h>\n#endif\n\n#include <fstream>\n#include \"Main.h\"\n#include \"LatticePath.h\"\n#include \"FactorCollection.h\"\n#include \"Manager.h\"\n#include \"Phrase.h\"\n#include \"Util.h\"\n#include \"LatticePathList.h\"\n#include \"Timer.h\"\n#include \"IOCommandLine.h\"\n#include \"IOFile.h\"\n#include \"Sentence.h\"\n#include \"ConfusionNet.h\"\n\n#if HAVE_CONFIG_H\n#include \"config.h\"\n# ifdef HAVE_MYSQLPP\n# define USE_MYSQL 1\n# endif\n#else\n\/\/ those not using autoconf have to build MySQL support for now\n# define USE_MYSQL 1\n#endif\n\n#undef USE_MYSQL\n#ifdef USE_MYSQL\n#include \"IOMySQL.h\"\n#endif\n\nusing namespace std;\nTimer timer;\n\nint main(int argc, char* argv[])\n{\n\ttimer.start(\"Starting...\");\n\n\tstd::cerr\n\t\t<<\"============================================================================\\n\"\n\t\t<<\"starting \"<<argv[0]<<\" (build on \"<<__DATE__<<\")\\n\"\n\t\t<<\"============================================================================\\n\"\n\t\t<<\"\\n\"\n <<\"the command line was: \\n\";\n\tfor(int i=0;i<argc;++i) std::cerr<<argv[i]<<\" \";\n std::cerr\n\t\t<<\"\\n\"\n\t\t<<\"============================================================================\\n\";\n\n\n\tStaticData staticData;\n\n\tif (!staticData.LoadParameters(argc, argv))\n\t\treturn EXIT_FAILURE;\n\n\t\/*\n\t * boost::shared_ptr<UnknownWordHandler> unknownWordHandler(new UnknownWordHandler);\n\tstaticData.SetUnknownWordHandler(unknownWordHandler);\n *\/\n\t\tif (staticData.GetVerboseLevel() > 0)\n\t\t{\n#if N_BEST\n\t\tstd::cerr << \"N_BEST=enabled\\n\";\n#else\n\t\tstd::cerr << \"N_BEST=disabled\\n\";\n#endif\n\t\t}\n\n\n\t\/\/ set up read\/writing class\n\tInputOutput *inputOutput = GetInputOutput(staticData);\n\n std::cerr << \"The score component vector looks like this:\\n\" << staticData.GetScoreIndexManager();\n std::cerr << \"The global weight vector looks like this:\\n\";\n\tvector<float> weights = staticData.GetAllWeights();\n\tstd::cerr << weights[0];\n\tfor (size_t j=1; j<weights.size(); j++) { std::cerr << \", \" << weights[j]; }\n\tstd::cerr << \"\\n\";\n\n\tif (inputOutput == NULL)\n\t\treturn EXIT_FAILURE;\n\n\t\/\/ read each sentence & decode\n\twhile(InputType *source = inputOutput->GetInput((staticData.GetInputType() ? \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t static_cast<InputType*>(new ConfusionNet) : \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t static_cast<InputType*>(new Sentence(Input)))))\n\t{\n\t\tTRACE_ERR(*source<<\"\\n\");\n\n\t\tTranslationOptionCollection *translationOptionCollection=source->CreateTranslationOptionCollection();\n\t\tassert(translationOptionCollection);\n\n\t\tstaticData.InitializeBeforeSentenceProcessing(*source);\n\t\tManager manager(*source, *translationOptionCollection, staticData);\n\t\tmanager.ProcessSentence();\n\t\tinputOutput->SetOutput(manager.GetBestHypothesis(), source->GetTranslationId(),\n staticData.GetReportSourceSpan(),\n staticData.GetReportAllFactors()\n );\n\n\t\t\/\/ n-best\n\t\tsize_t nBestSize = staticData.GetNBestSize();\n\t\tif (nBestSize > 0)\n\t\t{\n\t\t\tTRACE_ERR(nBestSize << \" \" << staticData.GetNBestFilePath() << endl);\n\t\t\tLatticePathList nBestList;\n\t\t\tmanager.CalcNBest(nBestSize, nBestList);\n\t\t\tinputOutput->SetNBest(nBestList, source->GetTranslationId());\n\t\t\tRemoveAllInColl< LatticePathList::iterator > (nBestList);\n\t\t}\n\n\t\t\/\/ delete source\n\t\t\/\/\t\tinputOutput->Release(source);\n\t\tstaticData.CleanUpAfterSentenceProcessing();\n\t\tdelete translationOptionCollection;\n\t\tdelete source;\n\t}\n\t\n\tdelete inputOutput;\n\n\n\ttimer.check(\"End.\");\n\treturn EXIT_SUCCESS;\n}\n\nInputOutput *GetInputOutput(StaticData &staticData)\n{\n\tInputOutput *inputOutput;\n\tconst std::vector<FactorType> &factorOrder = staticData.GetInputFactorOrder();\n\tFactorTypeSet inputFactorUsed(factorOrder);\n\n\t\/\/ io\n\tif (staticData.GetIOMethod() == IOMethodMySQL)\n\t{\n\t\tTRACE_ERR(\"IO from MySQL\" << endl);\n#if USE_MYSQL\n\t\tconst PARAM_VEC &mySQLParam = staticData.GetParam(\"mysql\");\n\t\tinputOutput = new IOMySQL(mySQLParam[0], mySQLParam[1], mySQLParam[2], mySQLParam[3]\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t, Scan<long>(mySQLParam[4]), Scan<long>(mySQLParam[5])\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t, factorOrder, inputFactorUsed, staticData.GetFactorCollection());\n\t\tstaticData.LoadPhraseTables();\n#else\n\t\tTRACE_ERR( \"moses was not built with mysql libraries, please configure\\n\"\n\t\t\t\t\t\t\t<< \" to use another input method.\\n\");\n\t\tinputOutput = NULL;\n#endif\n\t}\n\telse if (staticData.GetIOMethod() == IOMethodFile)\n\t{\n\t\tTRACE_ERR(\"IO from File\" << endl);\n\t\tstring\t\t\t\t\tinputFileHash;\n\t\tlist< Phrase >\tinputPhraseList;\n\t\tstring filePath = staticData.GetParam(\"input-file\")[0];\n\n\t\tTRACE_ERR(\"About to create ioFile\" << endl);\n\t\tIOFile *ioFile = new IOFile(factorOrder, inputFactorUsed\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetFactorCollection()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestSize()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestFilePath()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, filePath);\n\t\tif(staticData.GetInputType()) \n\t\t\t{\n\t\t\t\tTRACE_ERR(\"Do not read input phrases for confusion net translation\\n\");\n\t\t\t}\n\t\telse\n\t\t\t{\n\t\t\t\tTRACE_ERR(\"About to GetInputPhrase\\n\");\n\t\t\t\tioFile->GetInputPhrase(inputPhraseList);\n\t\t\t}\n\t\tTRACE_ERR(\"After GetInputPhrase\" << endl);\n\t\tinputOutput = ioFile;\n\t\tinputFileHash = GetMD5Hash(filePath);\n\t\tTRACE_ERR(\"About to LoadPhraseTables\" << endl);\n\t\tstaticData.LoadPhraseTables(true, inputFileHash, inputPhraseList);\n\t\tioFile->ResetSentenceId();\n\t}\n\telse\n\t{\n\t\tTRACE_ERR(\"IO from STDOUT\/STDIN\" << endl);\n\t\tinputOutput = new IOCommandLine(factorOrder, inputFactorUsed\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetFactorCollection()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestSize()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t, staticData.GetNBestFilePath());\n\t\tstaticData.LoadPhraseTables();\n\t}\n\tstaticData.LoadMapping();\n\ttimer.check(\"Created input-output object\");\n\n\treturn inputOutput;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"gm.h\"\n#include \"SkPicture.h\"\n#include \"SkRectShape.h\"\n#include \"SkGroupShape.h\"\n\nnamespace skiagm {\n\nstatic SkRect make_rect(int l, int t, int r, int b) {\n SkRect rect;\n rect.set(SkIntToScalar(l), SkIntToScalar(t),\n SkIntToScalar(r), SkIntToScalar(b));\n return rect;\n}\n\nstatic SkShape* make_shape0(bool red) {\n SkRectShape* s = new SkRectShape;\n s->setRect(make_rect(10, 10, 90, 90));\n if (red) {\n s->paint().setColor(SK_ColorRED);\n }\n return s;\n}\n\nstatic SkShape* make_shape1() {\n SkRectShape* s = new SkRectShape;\n s->setOval(make_rect(10, 10, 90, 90));\n s->paint().setColor(SK_ColorBLUE);\n return s;\n}\n\nstatic SkShape* make_shape2() {\n SkRectShape* s = new SkRectShape;\n s->setRRect(make_rect(10, 10, 90, 90),\n SkIntToScalar(20), SkIntToScalar(20));\n s->paint().setColor(SK_ColorGREEN);\n return s;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ShapesGM : public GM {\n SkGroupShape fGroup;\n SkMatrixRef* fMatrixRefs[4];\npublic:\n\tShapesGM() {\n SkMatrix m;\n fGroup.appendShape(make_shape0(false))->unref();\n m.setRotate(SkIntToScalar(30), SkIntToScalar(50), SkIntToScalar(50));\n m.postTranslate(0, SkIntToScalar(120));\n fGroup.appendShape(make_shape0(true), m)->unref();\n\n m.setTranslate(SkIntToScalar(120), 0);\n fGroup.appendShape(make_shape1(), m)->unref();\n m.postTranslate(0, SkIntToScalar(120));\n fGroup.appendShape(make_shape2(), m)->unref();\n \n for (size_t i = 0; i < SK_ARRAY_COUNT(fMatrixRefs); i++) {\n SkSafeRef(fMatrixRefs[i] = fGroup.getShapeMatrixRef(i));\n }\n }\n \n virtual ~ShapesGM() {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fMatrixRefs); i++) {\n SkSafeUnref(fMatrixRefs[i]);\n }\n }\n \nprotected:\n virtual SkString onShortName() {\n return SkString(\"shapes\");\n }\n \n\tvirtual SkISize onISize() {\n return make_isize(380, 480);\n }\n \n void drawBG(SkCanvas* canvas) {\n canvas->drawColor(0xFFDDDDDD);\n }\n \n virtual void onDraw(SkCanvas* canvas) {\n this->drawBG(canvas);\n \n SkMatrix saveM = *fMatrixRefs[3];\n SkScalar c = SkIntToScalar(50);\n fMatrixRefs[3]->preRotate(SkIntToScalar(30), c, c);\n \n SkMatrix matrix;\n \n SkGroupShape* gs = new SkGroupShape;\n SkAutoUnref aur(gs);\n gs->appendShape(&fGroup);\n matrix.setScale(-SK_Scalar1, SK_Scalar1);\n matrix.postTranslate(SkIntToScalar(220), SkIntToScalar(240));\n gs->appendShape(&fGroup, matrix);\n matrix.setTranslate(SkIntToScalar(240), 0);\n matrix.preScale(SK_Scalar1*2, SK_Scalar1*2);\n gs->appendShape(&fGroup, matrix);\n \n#if 0 \n canvas->drawShape(gs);\n#else\n SkPicture pict;\n SkCanvas* cv = pict.beginRecording(1000, 1000);\n cv->scale(SK_ScalarHalf, SK_ScalarHalf);\n cv->drawShape(gs);\n cv->translate(SkIntToScalar(680), SkIntToScalar(480));\n cv->scale(-SK_Scalar1, SK_Scalar1);\n cv->drawShape(gs);\n pict.endRecording();\n canvas->drawPicture(pict);\n#endif\n\n *fMatrixRefs[3] = saveM;\n}\n \nprivate:\n typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new ShapesGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n<commit_msg>fix refcount bug - as picture gets referenced by canvas when canvas is a picture-recording canvas, so it can't live on the stack. Probably a bug: nested pictures should probably ref some internal impl, so that callers can be free to use the stack when they want to.<commit_after>#include \"gm.h\"\n#include \"SkPicture.h\"\n#include \"SkRectShape.h\"\n#include \"SkGroupShape.h\"\n\nnamespace skiagm {\n\nstatic SkRect make_rect(int l, int t, int r, int b) {\n SkRect rect;\n rect.set(SkIntToScalar(l), SkIntToScalar(t),\n SkIntToScalar(r), SkIntToScalar(b));\n return rect;\n}\n\nstatic SkShape* make_shape0(bool red) {\n SkRectShape* s = new SkRectShape;\n s->setRect(make_rect(10, 10, 90, 90));\n if (red) {\n s->paint().setColor(SK_ColorRED);\n }\n return s;\n}\n\nstatic SkShape* make_shape1() {\n SkRectShape* s = new SkRectShape;\n s->setOval(make_rect(10, 10, 90, 90));\n s->paint().setColor(SK_ColorBLUE);\n return s;\n}\n\nstatic SkShape* make_shape2() {\n SkRectShape* s = new SkRectShape;\n s->setRRect(make_rect(10, 10, 90, 90),\n SkIntToScalar(20), SkIntToScalar(20));\n s->paint().setColor(SK_ColorGREEN);\n return s;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass ShapesGM : public GM {\n SkGroupShape fGroup;\n SkMatrixRef* fMatrixRefs[4];\npublic:\n\tShapesGM() {\n SkMatrix m;\n fGroup.appendShape(make_shape0(false))->unref();\n m.setRotate(SkIntToScalar(30), SkIntToScalar(50), SkIntToScalar(50));\n m.postTranslate(0, SkIntToScalar(120));\n fGroup.appendShape(make_shape0(true), m)->unref();\n\n m.setTranslate(SkIntToScalar(120), 0);\n fGroup.appendShape(make_shape1(), m)->unref();\n m.postTranslate(0, SkIntToScalar(120));\n fGroup.appendShape(make_shape2(), m)->unref();\n\n for (size_t i = 0; i < SK_ARRAY_COUNT(fMatrixRefs); i++) {\n SkSafeRef(fMatrixRefs[i] = fGroup.getShapeMatrixRef(i));\n }\n }\n\n virtual ~ShapesGM() {\n for (size_t i = 0; i < SK_ARRAY_COUNT(fMatrixRefs); i++) {\n SkSafeUnref(fMatrixRefs[i]);\n }\n }\n\nprotected:\n virtual SkString onShortName() {\n return SkString(\"shapes\");\n }\n\n\tvirtual SkISize onISize() {\n return make_isize(380, 480);\n }\n\n void drawBG(SkCanvas* canvas) {\n canvas->drawColor(0xFFDDDDDD);\n }\n\n virtual void onDraw(SkCanvas* canvas) {\n this->drawBG(canvas);\n\n SkMatrix saveM = *fMatrixRefs[3];\n SkScalar c = SkIntToScalar(50);\n fMatrixRefs[3]->preRotate(SkIntToScalar(30), c, c);\n\n SkMatrix matrix;\n\n SkGroupShape* gs = new SkGroupShape;\n SkAutoUnref aur(gs);\n gs->appendShape(&fGroup);\n matrix.setScale(-SK_Scalar1, SK_Scalar1);\n matrix.postTranslate(SkIntToScalar(220), SkIntToScalar(240));\n gs->appendShape(&fGroup, matrix);\n matrix.setTranslate(SkIntToScalar(240), 0);\n matrix.preScale(SK_Scalar1*2, SK_Scalar1*2);\n gs->appendShape(&fGroup, matrix);\n\n#if 0\n canvas->drawShape(gs);\n#else\n SkPicture* pict = new SkPicture;\n SkCanvas* cv = pict->beginRecording(1000, 1000);\n cv->scale(SK_ScalarHalf, SK_ScalarHalf);\n cv->drawShape(gs);\n cv->translate(SkIntToScalar(680), SkIntToScalar(480));\n cv->scale(-SK_Scalar1, SK_Scalar1);\n cv->drawShape(gs);\n pict->endRecording();\n canvas->drawPicture(*pict);\n pict->unref();\n#endif\n\n *fMatrixRefs[3] = saveM;\n}\n\nprivate:\n typedef GM INHERITED;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic GM* MyFactory(void*) { return new ShapesGM; }\nstatic GMRegistry reg(MyFactory);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by aj on 5\/17\/16.\n\/\/\n\n#include <libxml++\/libxml++.h>\n#include <iostream>\n#include \"XMLppTools.h\"\n\nusing namespace Glib;\nusing namespace xmlpp;\nusing namespace std;\n\n\/\/TODO: Handle error conditions\nvoid XMLppTools::populateGameFromScoreboardXML(Game * gameToPopulate, XMLMemoryUnit * scoreboardXMLMemory, Glib::ustring teamIDToFind) {\n \/\/Proof of concept XML parser\n try {\n DomParser parser;\n parser.parse_memory(*(scoreboardXMLMemory->memory));\n\n if(parser) {\n Node *root;\n root = parser.get_document()->get_root_node();\n\n NodeSet titles;\n titles = root->find(\"\/\/game\");\n\n for(NodeSet::iterator i = titles.begin(); i != titles.end(); i++) {\n Element *enode;\n enode = dynamic_cast<Element *>(*i);\n\n if(enode){\n ustring id = enode->get_attribute(\"id\")->get_value();\n\n if(id.find(teamIDToFind) != ustring::npos) {\n gameToPopulate->gameID = id;\n gameToPopulate->exists = true;\n }\n }\n }\n }\n } catch (std::exception &e) {\n cout << e.what() << endl;\n }\n}\n\nvoid XMLppTools::populateScoreboardXML(Game *gameObj, XMLMemoryUnit *xmlMem) {\n try {\n DomParser parser;\n parser.parse_memory(*(xmlMem->memory));\n\n if(parser) {\n Node * root;\n root = parser.get_document()->get_root_node();\n\n Element * rootElem;\n rootElem = dynamic_cast<Element *>(root);\n\n gameObj->away->code = rootElem->get_attribute(\"away_team_code\")->get_value();\n gameObj->home->code = rootElem->get_attribute(\"home_team_code\")->get_value();\n\n \/\/Parse linescore\n Node * linescore;\n linescore = root->get_first_child(\"linescore\");\n\n Element * linescoreElem;\n linescoreElem = dynamic_cast<Element *>(linescore);\n\n \/\/Retrieve base score\n gameObj->awayRun = atoi(linescoreElem->get_attribute(\"away_team_runs\")->get_value().c_str());\n gameObj->awayHit = atoi(linescoreElem->get_attribute(\"away_team_hits\")->get_value().c_str());\n gameObj->awayErr = atoi(linescoreElem->get_attribute(\"away_team_errors\")->get_value().c_str());\n gameObj->homeRun = atoi(linescoreElem->get_attribute(\"home_team_runs\")->get_value().c_str());\n gameObj->homeHit = atoi(linescoreElem->get_attribute(\"home_team_hits\")->get_value().c_str());\n gameObj->homeErr = atoi(linescoreElem->get_attribute(\"home_team_errors\")->get_value().c_str());\n\n \/\/Retrieve inning scores\n NodeSet innings;\n innings = linescore->find(\"\/\/inning_line_score\");\n\n for(NodeSet::iterator i = innings.begin(); i != innings.end(); i++) {\n Element * inningElem;\n inningElem = dynamic_cast<Element *>(*i);\n\n unsigned int inningNum = (unsigned)atoi(inningElem->get_attribute(\"inning\")->get_value().c_str());\n int awayInningRuns = atoi(inningElem->get_attribute(\"away\")->get_value().c_str());\n\n try {\n int homeInningRuns = atoi(inningElem->get_attribute(\"home\")->get_value().c_str());\n\n if (gameObj->homeScore->size() < inningNum) {\n gameObj->homeScore->resize(inningNum);\n }\n\n gameObj->homeScore->at(inningNum - 1) = homeInningRuns;\n } catch(std::exception &e) {\n \/\/Home hasn't played this inning so don't bother\n }\n\n\n \/\/Fixme: Check reserve to make sure this isn't hammering memory\n if(gameObj->awayScore->size() < inningNum) {\n gameObj->awayScore->resize(inningNum);\n }\n\n gameObj->awayScore->at(inningNum-1) = awayInningRuns;\n }\n }\n } catch (std::exception &e) {\n cout << e.what() << endl;\n }\n}\n\n\n\n\n\n<commit_msg>fixes segfaults related to various inning state conditions<commit_after>\/\/\n\/\/ Created by aj on 5\/17\/16.\n\/\/\n\n#include <libxml++\/libxml++.h>\n#include <iostream>\n#include \"XMLppTools.h\"\n\nusing namespace Glib;\nusing namespace xmlpp;\nusing namespace std;\n\n\/\/TODO: Handle error conditions\nvoid XMLppTools::populateGameFromScoreboardXML(Game * gameToPopulate, XMLMemoryUnit * scoreboardXMLMemory, Glib::ustring teamIDToFind) {\n \/\/Proof of concept XML parser\n try {\n DomParser parser;\n parser.parse_memory(*(scoreboardXMLMemory->memory));\n\n if(parser) {\n Node *root;\n root = parser.get_document()->get_root_node();\n\n NodeSet titles;\n titles = root->find(\"\/\/game\");\n\n for(NodeSet::iterator i = titles.begin(); i != titles.end(); i++) {\n Element *enode;\n enode = dynamic_cast<Element *>(*i);\n\n if(enode){\n ustring id = enode->get_attribute(\"id\")->get_value();\n\n if(id.find(teamIDToFind) != ustring::npos) {\n gameToPopulate->gameID = id;\n gameToPopulate->exists = true;\n }\n }\n }\n }\n } catch (std::exception &e) {\n cout << e.what() << endl;\n }\n}\n\nvoid XMLppTools::populateScoreboardXML(Game *gameObj, XMLMemoryUnit *xmlMem) {\n try {\n DomParser parser;\n parser.parse_memory(*(xmlMem->memory));\n\n if(parser) {\n Node * root;\n root = parser.get_document()->get_root_node();\n\n Element * rootElem;\n rootElem = dynamic_cast<Element *>(root);\n\n gameObj->away->code = rootElem->get_attribute(\"away_team_code\")->get_value();\n gameObj->home->code = rootElem->get_attribute(\"home_team_code\")->get_value();\n\n \/\/Parse linescore\n Node * linescore;\n linescore = root->get_first_child(\"linescore\");\n\n Element * linescoreElem;\n linescoreElem = dynamic_cast<Element *>(linescore);\n\n \/\/Retrieve base score\n gameObj->awayRun = atoi(linescoreElem->get_attribute(\"away_team_runs\")->get_value().c_str());\n gameObj->awayHit = atoi(linescoreElem->get_attribute(\"away_team_hits\")->get_value().c_str());\n gameObj->awayErr = atoi(linescoreElem->get_attribute(\"away_team_errors\")->get_value().c_str());\n gameObj->homeRun = atoi(linescoreElem->get_attribute(\"home_team_runs\")->get_value().c_str());\n gameObj->homeHit = atoi(linescoreElem->get_attribute(\"home_team_hits\")->get_value().c_str());\n gameObj->homeErr = atoi(linescoreElem->get_attribute(\"home_team_errors\")->get_value().c_str());\n\n \/\/Retrieve inning scores\n NodeSet innings;\n innings = linescore->find(\"\/\/inning_line_score\");\n\n for(NodeSet::iterator i = innings.begin(); i != innings.end(); i++) {\n Element * inningElem;\n inningElem = dynamic_cast<Element *>(*i);\n\n unsigned int inningNum = (unsigned)atoi(inningElem->get_attribute(\"inning\")->get_value().c_str());\n\n ustring awayRunStr = inningElem->get_attribute(\"away\")->get_value();\n\n \/* chaining if statements prevents a segfault when the end of an inning is reached\n * XML excerpt:\n * [...]\n * <inning_line_score away=\"0\" home=\"0\" inning=\"6\"\/>\n * <inning_line_score away=\"\" inning=\"7\"\/>\n * [...]\n *\/\n if(awayRunStr != \"\") {\n int awayInningRuns = atoi(awayRunStr.c_str());\n\n \/\/Fixme: Check reserve to make sure this isn't hammering memory\n if(gameObj->awayScore->size() < inningNum) {\n gameObj->awayScore->resize(inningNum);\n }\n\n gameObj->awayScore->at(inningNum-1) = awayInningRuns;\n\n ustring homeRunStr = inningElem->get_attribute(\"home\")->get_value();\n\n \/* handles middle of an inning\n * XML excerpt:\n * [...]\n * <inning_line_score away=\"0\" home=\"0\" inning=\"6\"\/>\n * <inning_line_score away=\"5\" home=\"\" inning=\"7\"\/>\n * [...]\n *\/\n if(homeRunStr != \"\") {\n int homeInningRuns = atoi(inningElem->get_attribute(\"home\")->get_value().c_str());\n\n if(gameObj->homeScore->size() < inningNum) {\n gameObj->homeScore->resize(inningNum);\n }\n\n gameObj->homeScore->at(inningNum-1) = homeInningRuns;\n }\n }\n }\n }\n } catch (std::exception &e) {\n cout << e.what() << endl;\n }\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016 SeNDA\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\/**\n * FILE adtnSender.cpp\n * AUTHOR Blackcatn13\n * DATE Apr 5, 2016\n * VERSION 1\n *\n *\/\n\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <string>\n#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <map>\n#include \"adtnSocket.h\"\n\nstatic void help(std::string program_name) {\n std::cout << program_name << \" is part of the SeNDA aDTNPlus platform\\n\"\n << \"Usage: \" << program_name << \" -i '127.0.0.1' -p '50000'\"\n << \" -d 'node2:50' -m 'This is a message for node2.'\\n\"\n << \"Required options:\\n\"\n << \" [-i | --listeningIP] Ip\\t\\t\\tIP of the listening node.\\n\"\n << \" [-p | --port] port\\t\\t\\tPort where the node is listening.\\n\"\n << \" [-d | --destination] destination node\\t\\t\\t\"\n << \"Which node is the destination.\\n\"\n << \" [-m | --message] message to send\\t\\t\\tThe message to send.\\n\"\n << \"Supported options:\\n\"\n << \" [-h | --help]\\t\\t\\t\\tShows this help message.\\n\"\n << std::endl;\n}\n\nint main(int argc, char **argv) {\n int opt = -1, option_index = 0;\n std::string ip = \"\";\n int port = -1;\n std::map<FirstFrameworkExtensionsIds, std::string> codes;\n std::map<FirstFrameworkExtensionsIds, std::string> files;\n std::string destination = \"\";\n std::string message = \"\";\n\n static struct option long_options[] = { { \"listeningIP\", required_argument, 0,\n 'i' }, { \"port\", required_argument, 0, 'p' }, { \"destination\",\n required_argument, 0, 'd' }, { \"message\", required_argument, 0, 'm' }, {\n \"create\", required_argument, 0, 'c' },\n { \"del\", required_argument, 0, 'e' },\n { \"dest\", required_argument, 0, 't' },\n { \"life\", required_argument, 0, 'l' },\n { \"fwd\", required_argument, 0, 'f' }, { \"createFile\", required_argument,\n 0, 'C' }, { \"delFile\", required_argument, 0, 'E' }, { \"destFile\",\n required_argument, 0, 'T' }, { \"lifeFile\", required_argument, 0, 'L' }, {\n \"fwdFile\", required_argument, 0, 'F' },\n { \"help\", no_argument, 0, 'h' }, { 0, 0, 0, 0 } };\n\n while ((opt = getopt_long(argc, argv, \"i:p:d:m:c:e:t:l:f:C:E:T:L:F:h\",\n long_options, &option_index))) {\n switch (opt) {\n case 'i':\n ip = std::string(optarg);\n break;\n case 'p':\n port = std::atoi(optarg);\n break;\n case 'd':\n destination = std::string(optarg);\n break;\n case 'm':\n message = std::string(optarg);\n break;\n case 'c':\n codes[FirstFrameworkExtensionsIds::CONTAINER_CREATION] = std::string(\n optarg);\n break;\n case 'C':\n files[FirstFrameworkExtensionsIds::CONTAINER_CREATION] = std::string(\n optarg);\n break;\n case 'e':\n codes[FirstFrameworkExtensionsIds::CONTAINER_DELETION] = std::string(\n optarg);\n break;\n case 'E':\n files[FirstFrameworkExtensionsIds::CONTAINER_DELETION] = std::string(\n optarg);\n break;\n case 't':\n codes[FirstFrameworkExtensionsIds::DESTINATION] = std::string(optarg);\n break;\n case 'T':\n files[FirstFrameworkExtensionsIds::DESTINATION] = std::string(optarg);\n break;\n case 'l':\n codes[FirstFrameworkExtensionsIds::LIFETIME] = std::string(optarg);\n break;\n case 'L':\n files[FirstFrameworkExtensionsIds::LIFETIME] = std::string(optarg);\n break;\n case 'f':\n codes[FirstFrameworkExtensionsIds::FORWARD] = std::string(optarg);\n break;\n case 'F':\n files[FirstFrameworkExtensionsIds::FORWARD] = std::string(optarg);\n break;\n case 'h':\n help(std::string(argv[0]));\n exit(0);\n default:\n break;\n }\n if (opt == -1)\n break;\n }\n if (ip == \"\" || port == -1 || destination == \"\" || message == \"\") {\n help(std::string(argv[0]));\n exit(0);\n }\n\n adtnSocket s = adtnSocket(ip, port);\n \/\/ Add the codes if any\n for (auto it = codes.begin(); it != codes.end(); ++it) {\n s.addFrameworkExtension(\n static_cast<uint8_t>(FrameworksIds::FIRST_FRAMEWORK),\n static_cast<uint8_t>(it->first), it->second);\n }\n for (auto it = files.begin(); it != files.end(); ++it) {\n std::ifstream codeFile(it->second);\n if (codeFile) {\n std::string code((std::istreambuf_iterator<char>(codeFile)),\n std::istreambuf_iterator<char>());\n s.addFrameworkExtension(\n static_cast<uint8_t>(FrameworksIds::FIRST_FRAMEWORK),\n static_cast<uint8_t>(it->first), code);\n codeFile.close();\n } else {\n std::cout << \"Cannot open the file \" << it->second << std::endl;\n }\n }\n try {\n s.send(destination, message);\n } catch (const std::exception &e) {\n std::cout << e.what() << std::endl;\n }\n return 0;\n}\n\n<commit_msg>Updates adtnSender help.<commit_after>\/*\n * Copyright (c) 2016 SeNDA\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\/**\n * FILE adtnSender.cpp\n * AUTHOR Blackcatn13\n * DATE Apr 5, 2016\n * VERSION 1\n *\n *\/\n\n#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <string>\n#include <iostream>\n#include <fstream>\n#include <cstring>\n#include <map>\n#include \"adtnSocket.h\"\n\nstatic void help(std::string program_name) {\n std::cout\n << program_name\n << \" is part of the SeNDA aDTNPlus platform\\n\"\n << \"Usage: \"\n << program_name\n << \" -i '127.0.0.1' -p '50000'\"\n << \" -d 'node2:50' -m 'This is a message for node2.'\\n\"\n << \"Required options:\\n\"\n << \" [-i | --listeningIP] Ip\\t\\t\\tIP of the listening node.\\n\"\n << \" [-p | --port] port\\t\\t\\t\\tPort where the node is listening.\\n\"\n << \" [-d | --destination] destination node\\t\"\n << \"Which node is the destination.\\n\"\n << \" [-m | --message] message to send\\t\\tThe message to send.\\n\"\n << \"Supported options:\\n\"\n << \" [-c | --create] creation code\\t\\tAdds the code to the \"\n \"CONTAINER_CREATION extension.\\n\"\n << \" [-C | --createFile] creation code in file\\tAdds the code from \"\n \"the file to the CONTAINER_CREATION extension.\\n\"\n << \" [-e | --del] deletion code\\t\\t\\tAdds the code to the \"\n \"CONTAINER_DELETION extension.\\n\"\n << \" [-E | --delFile] deletion code in file\\tAdds the code from the \"\n \"file to the CONTAINER_DELETION extension.\\n\"\n << \" [-t | --dest] destination code\\t\\tAdds the code to the \"\n \"DESTINATION extension.\\n\"\n << \" [-T | --destFile] destination code file\\tAdds the code from the \"\n \"file to the DESTINATION extension.\\n\"\n << \" [-l | --life] lifetime code\\t\\t\\tAdds the code to the \"\n \"LIFETIME extension.\\n\"\n << \" [-L | --lifeFile] lifetime code file\\t\\tAdds the code from the file \"\n \"to the LIFETIME extension.\\n\"\n << \" [-f | --fwd] forward code\\t\\t\\tAdds the code to the \"\n \"FORWARD extension.\\n\"\n << \" [-F | --fwdFile] forward code file\\t\\tAdds the code from the file \"\n \"to the FORWARD extension.\\n\"\n << \" [-h | --help]\\t\\t\\t\\tShows this help message.\\n\" << std::endl;\n}\n\nint main(int argc, char **argv) {\n int opt = -1, option_index = 0;\n std::string ip = \"\";\n int port = -1;\n std::map<FirstFrameworkExtensionsIds, std::string> codes;\n std::map<FirstFrameworkExtensionsIds, std::string> files;\n std::string destination = \"\";\n std::string message = \"\";\n\n static struct option long_options[] = { { \"listeningIP\", required_argument, 0,\n 'i' }, { \"port\", required_argument, 0, 'p' }, { \"destination\",\n required_argument, 0, 'd' }, { \"message\", required_argument, 0, 'm' }, {\n \"create\", required_argument, 0, 'c' },\n { \"del\", required_argument, 0, 'e' },\n { \"dest\", required_argument, 0, 't' },\n { \"life\", required_argument, 0, 'l' },\n { \"fwd\", required_argument, 0, 'f' }, { \"createFile\", required_argument,\n 0, 'C' }, { \"delFile\", required_argument, 0, 'E' }, { \"destFile\",\n required_argument, 0, 'T' }, { \"lifeFile\", required_argument, 0, 'L' }, {\n \"fwdFile\", required_argument, 0, 'F' },\n { \"help\", no_argument, 0, 'h' }, { 0, 0, 0, 0 } };\n\n while ((opt = getopt_long(argc, argv, \"i:p:d:m:c:e:t:l:f:C:E:T:L:F:h\",\n long_options, &option_index))) {\n switch (opt) {\n case 'i':\n ip = std::string(optarg);\n break;\n case 'p':\n port = std::atoi(optarg);\n break;\n case 'd':\n destination = std::string(optarg);\n break;\n case 'm':\n message = std::string(optarg);\n break;\n case 'c':\n codes[FirstFrameworkExtensionsIds::CONTAINER_CREATION] = std::string(\n optarg);\n break;\n case 'C':\n files[FirstFrameworkExtensionsIds::CONTAINER_CREATION] = std::string(\n optarg);\n break;\n case 'e':\n codes[FirstFrameworkExtensionsIds::CONTAINER_DELETION] = std::string(\n optarg);\n break;\n case 'E':\n files[FirstFrameworkExtensionsIds::CONTAINER_DELETION] = std::string(\n optarg);\n break;\n case 't':\n codes[FirstFrameworkExtensionsIds::DESTINATION] = std::string(optarg);\n break;\n case 'T':\n files[FirstFrameworkExtensionsIds::DESTINATION] = std::string(optarg);\n break;\n case 'l':\n codes[FirstFrameworkExtensionsIds::LIFETIME] = std::string(optarg);\n break;\n case 'L':\n files[FirstFrameworkExtensionsIds::LIFETIME] = std::string(optarg);\n break;\n case 'f':\n codes[FirstFrameworkExtensionsIds::FORWARD] = std::string(optarg);\n break;\n case 'F':\n files[FirstFrameworkExtensionsIds::FORWARD] = std::string(optarg);\n break;\n case 'h':\n help(std::string(argv[0]));\n exit(0);\n default:\n break;\n }\n if (opt == -1)\n break;\n }\n if (ip == \"\" || port == -1 || destination == \"\" || message == \"\") {\n help(std::string(argv[0]));\n exit(0);\n }\n\n adtnSocket s = adtnSocket(ip, port);\n \/\/ Add the codes if any\n for (auto it = codes.begin(); it != codes.end(); ++it) {\n s.addFrameworkExtension(\n static_cast<uint8_t>(FrameworksIds::FIRST_FRAMEWORK),\n static_cast<uint8_t>(it->first), it->second);\n }\n for (auto it = files.begin(); it != files.end(); ++it) {\n std::ifstream codeFile(it->second);\n if (codeFile) {\n std::string code((std::istreambuf_iterator<char>(codeFile)),\n std::istreambuf_iterator<char>());\n s.addFrameworkExtension(\n static_cast<uint8_t>(FrameworksIds::FIRST_FRAMEWORK),\n static_cast<uint8_t>(it->first), code);\n codeFile.close();\n } else {\n std::cout << \"Cannot open the file \" << it->second << std::endl;\n }\n }\n try {\n s.send(destination, message);\n } catch (const std::exception &e) {\n std::cout << e.what() << std::endl;\n }\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2007-2008 Martin Pieuchot \n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301\n * USA\n *\/\n\n#include \"wx\/ogre\/rendersystem.h\"\n\n#include \"wx\/ogre\/prerequisites.h\"\n#include \"wx\/ogre\/utils.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n #ifndef OGRE_PLUGINDIR\n #define OGRE_PLUGINDIR \"\"\n #endif\n#else \n #define OGRE_PLUGINDIR \"\"\n#endif\n\nIMPLEMENT_OGRE_SINGLETON(wxOgreRenderSystem)\n\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::wxOgreRenderSystem()\n{\n#ifndef WXOGRE_DEBUG\n\tm_root = new Ogre::Root(\"\", \"\", \"\");\n#else\n\tm_root = new Ogre::Root(\"\", \"\", \"boot.log\");\n#endif\n}\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::wxOgreRenderSystem(const Ogre::String& plugins,\n const Ogre::String& config, const Ogre::String& log)\n{\n\t\/\/ Create a new Ogre ROOT\n \/\/ Root(\"plugins.cfg\",\"config.cfg\",\"boot.log\");\n\tm_root = new Ogre::Root(plugins, config, log);\n}\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::~wxOgreRenderSystem()\n{\n delete m_root;\n m_root = 0;\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::LoadPlugin(const Ogre::String& plugin)\n{\n try {\n#if WXOGRE_DEBUG and OGRE_PLATFORM == OGRE_PLATFORM_WINDOWS\n\t\tm_root->loadPlugin(plugin + \"_d\");\n#else\n\t\tm_root->loadPlugin(plugin);\n#endif\n\t} catch (Ogre::Exception& e) {\n wxOgreExceptionBox(e);\n }\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::SelectOgreRenderSystem(const Ogre::String& render)\n{\n Ogre::RenderSystemList renderList;\n Ogre::RenderSystemList::iterator it;\n\n renderList = m_root->getAvailableRenderers();\n \/\/ check through all available renderers, if there is one the\n \/\/ string is \"render\"\n for (it = renderList.begin(); it != renderList.end(); ++it) {\n Ogre::RenderSystem* renderSys = *it;\n if (std::string (renderSys->getName()) == render) {\n m_root->setRenderSystem(renderSys);\n break;\n }\n }\n\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::Initialise()\n{\n m_root->initialise(false);\n}\n\/\/------------------------------------------------------------------------------\nbool wxOgreRenderSystem::HasCapability(const Ogre::Capabilities& c)\n{\n return m_root->getRenderSystem()->getCapabilities()->hasCapability(c);\n}\n\/\/------------------------------------------------------------------------------\n<commit_msg>ISIXE-909 fixed warning<commit_after>\/*\n * Copyright (C) 2007-2008 Martin Pieuchot \n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301\n * USA\n *\/\n\n#include \"wx\/ogre\/rendersystem.h\"\n\n#include \"wx\/ogre\/prerequisites.h\"\n#include \"wx\/ogre\/utils.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_LINUX\n #ifndef OGRE_PLUGINDIR\n #define OGRE_PLUGINDIR \"\"\n #endif\n#else \n #define OGRE_PLUGINDIR \"\"\n#endif\n\nIMPLEMENT_OGRE_SINGLETON(wxOgreRenderSystem)\n\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::wxOgreRenderSystem()\n{\n#ifndef WXOGRE_DEBUG\n\tm_root = new Ogre::Root(\"\", \"\", \"\");\n#else\n\tm_root = new Ogre::Root(\"\", \"\", \"boot.log\");\n#endif\n}\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::wxOgreRenderSystem(const Ogre::String& plugins,\n const Ogre::String& config, const Ogre::String& log)\n{\n\t\/\/ Create a new Ogre ROOT\n \/\/ Root(\"plugins.cfg\",\"config.cfg\",\"boot.log\");\n\tm_root = new Ogre::Root(plugins, config, log);\n}\n\/\/------------------------------------------------------------------------------\nwxOgreRenderSystem::~wxOgreRenderSystem()\n{\n delete m_root;\n m_root = 0;\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::LoadPlugin(const Ogre::String& plugin)\n{\n try {\n#if WXOGRE_DEBUG == 1\n\t\tm_root->loadPlugin(plugin + \"_d\");\n#else\n\t\tm_root->loadPlugin(plugin);\n#endif\n\t} catch (Ogre::Exception& e) {\n wxOgreExceptionBox(e);\n }\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::SelectOgreRenderSystem(const Ogre::String& render)\n{\n Ogre::RenderSystemList renderList;\n Ogre::RenderSystemList::iterator it;\n\n renderList = m_root->getAvailableRenderers();\n \/\/ check through all available renderers, if there is one the\n \/\/ string is \"render\"\n for (it = renderList.begin(); it != renderList.end(); ++it) {\n Ogre::RenderSystem* renderSys = *it;\n if (std::string (renderSys->getName()) == render) {\n m_root->setRenderSystem(renderSys);\n break;\n }\n }\n\n}\n\/\/------------------------------------------------------------------------------\nvoid wxOgreRenderSystem::Initialise()\n{\n m_root->initialise(false);\n}\n\/\/------------------------------------------------------------------------------\nbool wxOgreRenderSystem::HasCapability(const Ogre::Capabilities& c)\n{\n return m_root->getRenderSystem()->getCapabilities()->hasCapability(c);\n}\n\/\/------------------------------------------------------------------------------\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <optional>\n#include <tuple>\n#include <utility>\n\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wdocumentation-unknown-command\"\n#pragma GCC diagnostic ignored \"-Wextra-semi-stmt\" \/\/ fmt\/format.h:1242\n#pragma GCC diagnostic ignored \"-Wundefined-func-template\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\" \/\/ fmt\/format.h:2699\n#pragma GCC diagnostic ignored \"-Wdouble-promotion\" \/\/ fmt\/core.h:769\n#pragma GCC diagnostic ignored \"-Wsigned-enum-bitfield\" \/\/ fmt\/format.h\n#pragma GCC diagnostic ignored \"-Wshadow\" \/\/ fmt\/chrono.h\n#pragma GCC diagnostic ignored \"-Wshadow-field\" \/\/ fmt\/core.h\n#pragma GCC diagnostic ignored \"-Wundef\" \/\/ fmt\/core.h\n#pragma GCC diagnostic ignored \"-Wunused-template\" \/\/ fmt\/chrono.h\n#pragma GCC diagnostic ignored \"-Wnon-virtual-dtor\" \/\/ fmt\/core.h\n\n\/\/ clang 11\n#pragma GCC diagnostic ignored \"-Wsuggest-override\"\n#pragma GCC diagnostic ignored \"-Wsuggest-destructor-override\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n#endif\n\n#ifdef __GNUG__\n#pragma GCC diagnostic ignored \"-Wdeprecated\" \/\/ fmt\/format.h: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20\n#endif\n\n#include <fmt\/format.h>\n#include <fmt\/ranges.h>\n#include <fmt\/chrono.h>\n\n#pragma GCC diagnostic pop\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::fmt_helper\n{\n struct default_formatter\n {\n };\n\n struct float_formatter\n {\n };\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <> struct fmt::formatter<acmacs::fmt_helper::default_formatter>\n{\n template <typename ParseContext> constexpr auto parse(ParseContext& ctx)\n {\n return ctx.begin();\n }\n};\n\ntemplate <> struct fmt::formatter<acmacs::fmt_helper::float_formatter>\n{\n template <typename ParseContext> constexpr auto parse(ParseContext& ctx)\n {\n auto it = ctx.begin();\n if (it != ctx.end() && *it == ':')\n ++it;\n const auto end = std::find(it, ctx.end(), '}');\n format_ = fmt::format(\"{{:{}}}\", std::string(it, end));\n return end;\n }\n\n template <typename Val> std::string format_val(Val&& val)\n {\n return fmt::format(format_, std::forward<Val>(val));\n }\n\n template <typename Val, typename FormatContext> auto format_val(Val&& val, FormatContext& ctx)\n {\n return format_to(ctx.out(), format_, std::forward<Val>(val));\n }\n\n private:\n std::string format_;\n};\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename T> struct fmt::formatter<T, std::enable_if_t<std::is_base_of_v<std::exception, T>, char>> : fmt::formatter<const char*> {\n template <typename FormatCtx> auto format(const std::exception& err, FormatCtx& ctx) { return fmt::formatter<const char*>::format(err.what(), ctx); }\n};\n\n\/\/ template <> struct fmt::formatter<std::exception>\n\/\/ {\n\/\/ template <typename ParseContext> constexpr auto parse(ParseContext &ctx) { return ctx.begin(); }\n\/\/ template <typename FormatContext> auto format(const std::exception& err, FormatContext& ctx) { return format_to(ctx.out(), \"{}\", err.what()); }\n\/\/ };\n\n\/\/ template <> struct fmt::formatter<###> : fmt::formatter<acmacs::fmt_helper::default_formatter> {\n\/\/ template <typename FormatCtx> auto format(const ###& value, FormatCtx& ctx)\n\/\/ {\n\/\/ format_to(ctx.out(), \"{} {}\", );\n\/\/ return format_to(ctx.out(), \"{} {}\", );\n\/\/ return ctx.out();\n\/\/ }\n\/\/ };\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace fmt\n{\n template <typename T> std::string format(const std::vector<T>& collection, std::string_view entry_format, std::string_view entry_separator = \"\\n \")\n {\n return fmt::format(entry_format, fmt::join(collection, entry_separator));\n }\n\n} \/\/ namespace fmt\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace fmt\n{\n enum class if_no_substitution_found { leave_as_is, empty };\n\n std::vector<std::pair<std::string_view, std::string_view>> split_for_formatting(std::string_view source); \/\/ pair{key, format}: {\"key\", \"{key:03d}\"} {\"\", \"between-format\"}\n\n template <typename FormatMatched, typename FormatNoPattern, typename... Args>\n void substitute_to(FormatMatched&& format_matched, FormatNoPattern&& format_no_pattern, std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n const auto match_and_format = [&format_matched](std::string_view look_for, std::string_view pattern_arg, const auto& en) {\n if (look_for == std::get<0>(en)) {\n format_matched(pattern_arg, en);\n return true;\n }\n else\n return false;\n };\n\n for (const auto& [key, pattern_arg] : split_for_formatting(pattern)) {\n if (!key.empty()) {\n if (!(match_and_format(key, pattern_arg, args) || ...)) {\n \/\/ not matched\n switch (insf) {\n case if_no_substitution_found::leave_as_is:\n format_no_pattern(pattern_arg);\n break;\n case if_no_substitution_found::empty:\n break;\n }\n }\n }\n else\n format_no_pattern(pattern_arg);\n }\n }\n\n template <typename... Args> void substitute_to(memory_buffer& output, std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n const auto format_matched = [&output](std::string_view pattern_arg, const auto& key_value) {\n static_assert(std::is_same_v<std::decay_t<decltype(std::get<0>(key_value))>, const char*>);\n if constexpr (std::tuple_size<std::decay_t<decltype(key_value)>>::value == 2) {\n if constexpr (std::is_invocable_v<decltype(std::get<1>(key_value))>)\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::invoke(std::get<1>(key_value))));\n else\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::get<1>(key_value)));\n }\n else if constexpr (std::tuple_size<std::decay_t<decltype(key_value)>>::value == 4) {\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::get<1>(key_value)), arg(std::get<2>(key_value), std::get<3>(key_value)));\n }\n else\n static_assert(\n std::tuple_size<std::decay_t<decltype(key_value)>>::value == 0,\n \"fmt::substitute arg can be used in the following forms: std::pair<const char*, value>, std::pair<const char*, lambda>, std::tuple<const char*, value, const char*, value>\");\n };\n const auto format_no_pattern = [&output](std::string_view no_pattern) { output.append(no_pattern); };\n substitute_to(format_matched, format_no_pattern, pattern, insf, std::forward<Args>(args)...);\n }\n\n \/\/ see acmacs-chart-2\/cc\/name-format.cc for usage example\n\n template <typename... Args> std::string substitute(std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n memory_buffer output;\n substitute_to(output, pattern, insf, std::forward<Args>(args)...);\n return to_string(output);\n }\n\n template <typename... Args> std::string substitute(std::string_view pattern, Args&&... args) { return substitute(pattern, if_no_substitution_found::leave_as_is, std::forward<Args>(args)...); }\n\n} \/\/ namespace fmt\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>fmt::substitute description<commit_after>#pragma once\n\n#include <optional>\n#include <tuple>\n#include <utility>\n\n#pragma GCC diagnostic push\n#ifdef __clang__\n#pragma GCC diagnostic ignored \"-Wdocumentation-unknown-command\"\n#pragma GCC diagnostic ignored \"-Wextra-semi-stmt\" \/\/ fmt\/format.h:1242\n#pragma GCC diagnostic ignored \"-Wundefined-func-template\"\n#pragma GCC diagnostic ignored \"-Wsign-conversion\" \/\/ fmt\/format.h:2699\n#pragma GCC diagnostic ignored \"-Wdouble-promotion\" \/\/ fmt\/core.h:769\n#pragma GCC diagnostic ignored \"-Wsigned-enum-bitfield\" \/\/ fmt\/format.h\n#pragma GCC diagnostic ignored \"-Wshadow\" \/\/ fmt\/chrono.h\n#pragma GCC diagnostic ignored \"-Wshadow-field\" \/\/ fmt\/core.h\n#pragma GCC diagnostic ignored \"-Wundef\" \/\/ fmt\/core.h\n#pragma GCC diagnostic ignored \"-Wunused-template\" \/\/ fmt\/chrono.h\n#pragma GCC diagnostic ignored \"-Wnon-virtual-dtor\" \/\/ fmt\/core.h\n\n\/\/ clang 11\n#pragma GCC diagnostic ignored \"-Wsuggest-override\"\n#pragma GCC diagnostic ignored \"-Wsuggest-destructor-override\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n\/\/ #pragma GCC diagnostic ignored \"\"\n#endif\n\n#ifdef __GNUG__\n#pragma GCC diagnostic ignored \"-Wdeprecated\" \/\/ fmt\/format.h: implicit capture of ‘this’ via ‘[=]’ is deprecated in C++20\n#endif\n\n#include <fmt\/format.h>\n#include <fmt\/ranges.h>\n#include <fmt\/chrono.h>\n\n#pragma GCC diagnostic pop\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace acmacs::fmt_helper\n{\n struct default_formatter\n {\n };\n\n struct float_formatter\n {\n };\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <> struct fmt::formatter<acmacs::fmt_helper::default_formatter>\n{\n template <typename ParseContext> constexpr auto parse(ParseContext& ctx)\n {\n return ctx.begin();\n }\n};\n\ntemplate <> struct fmt::formatter<acmacs::fmt_helper::float_formatter>\n{\n template <typename ParseContext> constexpr auto parse(ParseContext& ctx)\n {\n auto it = ctx.begin();\n if (it != ctx.end() && *it == ':')\n ++it;\n const auto end = std::find(it, ctx.end(), '}');\n format_ = fmt::format(\"{{:{}}}\", std::string(it, end));\n return end;\n }\n\n template <typename Val> std::string format_val(Val&& val)\n {\n return fmt::format(format_, std::forward<Val>(val));\n }\n\n template <typename Val, typename FormatContext> auto format_val(Val&& val, FormatContext& ctx)\n {\n return format_to(ctx.out(), format_, std::forward<Val>(val));\n }\n\n private:\n std::string format_;\n};\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename T> struct fmt::formatter<T, std::enable_if_t<std::is_base_of_v<std::exception, T>, char>> : fmt::formatter<const char*> {\n template <typename FormatCtx> auto format(const std::exception& err, FormatCtx& ctx) { return fmt::formatter<const char*>::format(err.what(), ctx); }\n};\n\n\/\/ template <> struct fmt::formatter<std::exception>\n\/\/ {\n\/\/ template <typename ParseContext> constexpr auto parse(ParseContext &ctx) { return ctx.begin(); }\n\/\/ template <typename FormatContext> auto format(const std::exception& err, FormatContext& ctx) { return format_to(ctx.out(), \"{}\", err.what()); }\n\/\/ };\n\n\/\/ template <> struct fmt::formatter<###> : fmt::formatter<acmacs::fmt_helper::default_formatter> {\n\/\/ template <typename FormatCtx> auto format(const ###& value, FormatCtx& ctx)\n\/\/ {\n\/\/ format_to(ctx.out(), \"{} {}\", );\n\/\/ return format_to(ctx.out(), \"{} {}\", );\n\/\/ return ctx.out();\n\/\/ }\n\/\/ };\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace fmt\n{\n template <typename T> std::string format(const std::vector<T>& collection, std::string_view entry_format, std::string_view entry_separator = \"\\n \")\n {\n return fmt::format(entry_format, fmt::join(collection, entry_separator));\n }\n\n} \/\/ namespace fmt\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace fmt\n{\n enum class if_no_substitution_found { leave_as_is, empty };\n\n std::vector<std::pair<std::string_view, std::string_view>> split_for_formatting(std::string_view source); \/\/ pair{key, format}: {\"key\", \"{key:03d}\"} {\"\", \"between-format\"}\n\n template <typename FormatMatched, typename FormatNoPattern, typename... Args>\n void substitute_to(FormatMatched&& format_matched, FormatNoPattern&& format_no_pattern, std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n const auto match_and_format = [&format_matched](std::string_view look_for, std::string_view pattern_arg, const auto& en) {\n if (look_for == std::get<0>(en)) {\n format_matched(pattern_arg, en);\n return true;\n }\n else\n return false;\n };\n\n for (const auto& [key, pattern_arg] : split_for_formatting(pattern)) {\n if (!key.empty()) {\n if (!(match_and_format(key, pattern_arg, args) || ...)) {\n \/\/ not matched\n switch (insf) {\n case if_no_substitution_found::leave_as_is:\n format_no_pattern(pattern_arg);\n break;\n case if_no_substitution_found::empty:\n break;\n }\n }\n }\n else\n format_no_pattern(pattern_arg);\n }\n }\n\n \/\/ substitute_to args:\n \/\/ std::pair{\"name\", value} -- {name}, {name:3d}\n \/\/ std::pair{\"name\", []() -> decltype(value) { return value; }} -- {name}, {name:3d}\n \/\/ std::tuple{\"name1\", val1, \"name2\", val2} -- {name1:{name2}d}\n template <typename... Args> void substitute_to(memory_buffer& output, std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n const auto format_matched = [&output](std::string_view pattern_arg, const auto& key_value) {\n static_assert(std::is_same_v<std::decay_t<decltype(std::get<0>(key_value))>, const char*>);\n if constexpr (std::tuple_size<std::decay_t<decltype(key_value)>>::value == 2) {\n if constexpr (std::is_invocable_v<decltype(std::get<1>(key_value))>)\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::invoke(std::get<1>(key_value))));\n else\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::get<1>(key_value)));\n }\n else if constexpr (std::tuple_size<std::decay_t<decltype(key_value)>>::value == 4) {\n format_to(output, pattern_arg, arg(std::get<0>(key_value), std::get<1>(key_value)), arg(std::get<2>(key_value), std::get<3>(key_value)));\n }\n else\n static_assert(\n std::tuple_size<std::decay_t<decltype(key_value)>>::value == 0,\n \"fmt::substitute arg can be used in the following forms: std::pair<const char*, value>, std::pair<const char*, lambda>, std::tuple<const char*, value, const char*, value>\");\n };\n const auto format_no_pattern = [&output](std::string_view no_pattern) { output.append(no_pattern); };\n substitute_to(format_matched, format_no_pattern, pattern, insf, std::forward<Args>(args)...);\n }\n\n \/\/ see acmacs-chart-2\/cc\/name-format.cc for usage example\n\n template <typename... Args> std::string substitute(std::string_view pattern, if_no_substitution_found insf, Args&&... args)\n {\n memory_buffer output;\n substitute_to(output, pattern, insf, std::forward<Args>(args)...);\n return to_string(output);\n }\n\n template <typename... Args> std::string substitute(std::string_view pattern, Args&&... args) { return substitute(pattern, if_no_substitution_found::leave_as_is, std::forward<Args>(args)...); }\n\n} \/\/ namespace fmt\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <math.h>\r\n\/* Titolo: \r\n Autore: Marchetti Matteo\r\n Data: 16\/01\/2017\r\n Classe: 3INA\r\n Versione 1.0*\/\r\n\r\n int main(){\r\n \tint n1; \/\/ Numero preso in input che deve essere maggiore di 0 e minore di n2\r\n \tint n2; \/\/ Numero preso in input che deve essere minore di 1000 e maggiore di 0\r\n \tint n; \/\/ Numero compreso tra n1 e n2\r\n \tint I; \/\/ Contatore\r\n \tint somma1;\/\/ \r\n \tint somma; \/\/ Somma degli elementi pari\r\n \tint media; \/\/ Media degli elementi dispari\r\n \tint v[1000]; \/\/ vettore\r\n \t\r\n \tdo{\r\n \t\tprintf(\"Inserie n2 che deve essere minore di 1000 ma maggiore di 0\\n\"); \r\n \t\tscanf(\"%d\", &n2); \/\/ Controllo di n2\r\n\t }while(!(n2<1000)&&(n2>0));\r\n \tdo{\r\n \t\tprintf(\"Inserire n1 che deve essere maggiore di 0 ma deve essere minore di n2\\n\");\r\n \t\tscanf(\"%d\", &n1); \/\/ Controllo di n1\r\n\t }while(!(n1>0)&&(n1<n2));\r\n\tdo{\r\n\t\tprintf(\"Inserire n che deve essere compreso tra n1 e n2\\n\");\r\n\t\tscanf(\"%d\", &n); \/\/ Controllo di n\r\n\t }while(!(n1<n)&&(n<n2));\r\n\t \r\n\t for(I=0;I<n;I++){\r\n\t \t printf(\"Inserire un numero\\n\");\r\n\t \t scanf(\"%d\", &v[I]);\r\n\t \t if(I%2!=0){\r\n\t \t \tsomma1=somma1+v[I];\r\n\t \t \tmedia++;\r\n\t\t }\r\n\t\t if((v[I]%2==0)||(v[I]==0)){\r\n\t\t \t somma=somma+v[I];\r\n\t\t }\r\n\t }\r\n\t media=somma1\/media;\r\n\t printf(\"La somma degli elementi pari e':\\n%d\",somma);\r\n\t printf(\"La media degli elementi di posto dispari e':\\n%d\",media);\r\n }\r\n \r\n\r\n<commit_msg>Delete SenzaTitolo1.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2010, The Mineserver Project\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the The Mineserver Project nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/\/\n\/\/ Mineserver trxlogger.cpp\n\/\/\n\n#include <cstdio>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h>\n#include <vector>\n\n#include \"trxlogger.h\"\n#include \"logger.h\"\n#include \"config.h\"\n\nTrxLogger::TrxLogger (std::string filename) {\n log_stream.open(filename.c_str(), std::fstream::in | std::fstream::out );\n if (!log_stream.is_open()) {\n LOG(\"Problem opening binary log!\");\n } \n}\n\nTrxLogger &TrxLogger::get()\n{\n static TrxLogger instance(Conf::get().sValue(\"binlog\"));\n return instance;\n}\n\n\/\/ Log action to binary log \nvoid TrxLogger::log(event_t event)\n{\n if(log_stream.good()) {\n \n event.timestamp = time (NULL);\n log_stream.write(reinterpret_cast<char *>(&event), sizeof(event_t));\n } else {\n LOG(\"Binary log is bad!\");\n }\n}\n\n\/\/ Get logs based on nick and timestamp\nbool TrxLogger::getLogs(time_t t, std::string &nick, std::vector<event_t> *logs) {\n event_t event;\n log_stream.flush();\n log_stream.seekg(0, std::ios::beg);\n\n while(!log_stream.eof()) {\n log_stream.read(reinterpret_cast<char *>(&event), sizeof(event_t));\n\n if(event.timestamp < t && event.nick == nick) {\n logs->push_back(event); \n }\n }\n return true;\n}\n\n\/\/ Get logs based on timestamp\nbool TrxLogger::getLogs(time_t t, std::vector<event_t> *logs) {\n event_t event;\n log_stream.flush();\n log_stream.seekg(0, std::ios::beg);\n\n while(!log_stream.eof()) {\n log_stream.read(reinterpret_cast<char *>(&event), sizeof(event_t));\n\n if(event.timestamp < t) {\n logs->push_back(event);\n }\n }\n return true;\n}\n\nTrxLogger::~TrxLogger() {\n log_stream.close();\n}\n<commit_msg>Binary logging is working, however after running the \/rollback command the log_stream file object goes bad :[<commit_after>\/*\n Copyright (c) 2010, The Mineserver Project\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the The Mineserver Project nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY\n DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/\/\n\/\/ Mineserver trxlogger.cpp\n\/\/\n\n#include <cstdio>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h>\n#include <vector>\n\n#include \"trxlogger.h\"\n#include \"logger.h\"\n#include \"config.h\"\n\nTrxLogger::TrxLogger (std::string filename) {\n log_stream.open(filename.c_str(), std::fstream::in | std::fstream::out | std::fstream::binary );\n if (!log_stream.is_open()) {\n LOG(\"Problem opening binary log!\");\n } \n}\n\nTrxLogger &TrxLogger::get()\n{\n static TrxLogger instance(Conf::get().sValue(\"binlog\"));\n return instance;\n}\n\n\/\/ Log action to binary log \nvoid TrxLogger::log(event_t event)\n{\n if(log_stream.good()) {\n \n event.timestamp = time (NULL);\n log_stream.seekg(0, std::ios::end);\n log_stream.write(reinterpret_cast<char *>(&event), sizeof(event_t));\n\n } else {\n LOG(\"Binary log is bad!\");\n }\n}\n\n\/\/ Get logs based on nick and timestamp\nbool TrxLogger::getLogs(time_t t, std::string &nick, std::vector<event_t> *logs) {\n event_t event;\n log_stream.flush();\n log_stream.seekg(0, std::ios::beg);\n\n while(!log_stream.eof()) {\n log_stream.read(reinterpret_cast<char *>(&event), sizeof(event_t));\n\n if(event.timestamp < t && event.nick == nick) {\n logs->push_back(event); \n }\n }\n return true;\n}\n\n\/\/ Get logs based on timestamp\nbool TrxLogger::getLogs(time_t t, std::vector<event_t> *logs) {\n event_t event;\n log_stream.flush();\n log_stream.seekg(0, std::ios::beg);\n\n while(!log_stream.eof()) {\n log_stream.read(reinterpret_cast<char *>(&event), sizeof(event_t));\n\n if(event.timestamp < t) {\n logs->push_back(event);\n }\n }\n return true;\n}\n\nTrxLogger::~TrxLogger() {\n log_stream.close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* wcecompat: Windows CE C Runtime Library \"compatibility\" library.\n *\n * Copyright (C) 2001-2002 Essemer Pty Ltd. All rights reserved.\n * http:\/\/www.essemer.com.au\/\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n\n\n#include \"ts_string.h\"\n#include <string.h>\n#include <windows.h>\n\n\nvoid ascii2unicode(const char* ascii, WCHAR* unicode)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\twhile (*ascii != '\\0')\n\t\t\t*unicode++ = *ascii++;\n\t\t*unicode = '\\0';\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\twhile (*ascii != '\\0')\n\t\t{\n\t\t\t*(char*)unicode = *ascii++;\n\t\t\t*(((char*)unicode)+1) = 0;\n\t\t\tunicode++;\n\t\t}\n\t\t*(char*)unicode = 0;\n\t\t*(((char*)unicode)+1) = 0;\n\t}\n}\n\nvoid unicode2ascii(const WCHAR* unicode, char* ascii)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\twhile (*unicode != '\\0')\n\t\t\t*ascii++ = (char)*unicode++;\n\t\t*ascii = '\\0';\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\twhile (*(char*)unicode != 0 || *(((char*)unicode)+1) != 0)\n\t\t\t*ascii++ = *(char*)unicode++;\n\t\t*ascii = '\\0';\n\t}\n}\n\nvoid ascii2unicode(const char* ascii, WCHAR* unicode, int maxChars)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\tfor (int i=0; ascii[i] != 0 && i<maxChars; i++)\n\t\t\tunicode[i] = ascii[i];\n\t\tunicode[i] = 0;\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\tfor (int i=0; ascii[i] != 0 && i<maxChars; i++)\n\t\t{\n\t\t\t*(char*)&unicode[i] = ascii[i];\n\t\t\t*(((char*)&unicode[i])+1) = 0;\n\t\t\tunicode++;\n\t\t}\n\t\t*(char*)&unicode[i] = 0;\n\t\t*(((char*)&unicode[i])+1) = 0;\n\t}\n}\n\nvoid unicode2ascii(const WCHAR* unicode, char* ascii, int maxChars)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\tfor (int i=0; unicode[i] != 0 && i<maxChars; i++)\n\t\t\tascii[i] = (char)unicode[i];\n\t\tascii[i] = 0;\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\tfor (int i=0; (*(char*)&unicode[i] != 0 || *(((char*)&unicode[i])+1) != 0) && i<maxChars; i++)\n\t\t\tascii[i] = *(char*)&unicode[i];\n\t\tascii[i] = 0;\n\t}\n}\n\n\n\/\/\n\/\/ ascii\/unicode typesafe versions of strcat\n\/\/\n\nchar* ts_strcat(char* dest, const WCHAR* src)\n{\n\tchar* p = dest;\n\twhile (*p != '\\0')\n\t\tp++;\n\tunicode2ascii(src, p);\n\treturn dest;\n}\n\nWCHAR* ts_strcat(WCHAR* dest, const char* src)\n{\n\tWCHAR* p = dest;\n\twhile (*p != '\\0')\n\t\tp++;\n\tascii2unicode(src, p);\n\treturn dest;\n}\n\n\n\/\/\n\/\/ ascii\/unicode typesafe versions of strdup\n\/\/\n\nchar* ts_strdup_unicode_to_ascii(const WCHAR* str)\n{\n\tchar* result = (char*)malloc(wcslen(str)+1);\n\tif (result == NULL)\n\t\treturn NULL;\n\tunicode2ascii(str, result);\n\treturn result;\n}\n\nWCHAR* ts_strdup_ascii_to_unicode(const char* str)\n{\n\tWCHAR* result = (WCHAR*)malloc((strlen(str)+1)*2);\n\tif (result == NULL)\n\t\treturn NULL;\n\tascii2unicode(str, result);\n\treturn result;\n}\n<commit_msg>Move the declaration of i outside for loop to extend the scope.<commit_after>\/* wcecompat: Windows CE C Runtime Library \"compatibility\" library.\n *\n * Copyright (C) 2001-2002 Essemer Pty Ltd. All rights reserved.\n * http:\/\/www.essemer.com.au\/\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n *\/\n\n\n#include \"ts_string.h\"\n#include <string.h>\n#include <windows.h>\n\n\nvoid ascii2unicode(const char* ascii, WCHAR* unicode)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\twhile (*ascii != '\\0')\n\t\t\t*unicode++ = *ascii++;\n\t\t*unicode = '\\0';\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\twhile (*ascii != '\\0')\n\t\t{\n\t\t\t*(char*)unicode = *ascii++;\n\t\t\t*(((char*)unicode)+1) = 0;\n\t\t\tunicode++;\n\t\t}\n\t\t*(char*)unicode = 0;\n\t\t*(((char*)unicode)+1) = 0;\n\t}\n}\n\nvoid unicode2ascii(const WCHAR* unicode, char* ascii)\n{\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\twhile (*unicode != '\\0')\n\t\t\t*ascii++ = (char)*unicode++;\n\t\t*ascii = '\\0';\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\twhile (*(char*)unicode != 0 || *(((char*)unicode)+1) != 0)\n\t\t\t*ascii++ = *(char*)unicode++;\n\t\t*ascii = '\\0';\n\t}\n}\n\nvoid ascii2unicode(const char* ascii, WCHAR* unicode, int maxChars)\n{\n\tint i;\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\tfor (i=0; ascii[i] != 0 && i<maxChars; i++)\n\t\t\tunicode[i] = ascii[i];\n\t\tunicode[i] = 0;\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\tfor (i=0; ascii[i] != 0 && i<maxChars; i++)\n\t\t{\n\t\t\t*(char*)&unicode[i] = ascii[i];\n\t\t\t*(((char*)&unicode[i])+1) = 0;\n\t\t\tunicode++;\n\t\t}\n\t\t*(char*)&unicode[i] = 0;\n\t\t*(((char*)&unicode[i])+1) = 0;\n\t}\n}\n\nvoid unicode2ascii(const WCHAR* unicode, char* ascii, int maxChars)\n{\n\tint i;\n\tif (((unsigned int)unicode & 1) == 0)\n\t{\t\/\/ word-aligned\n\t\tfor (i=0; unicode[i] != 0 && i<maxChars; i++)\n\t\t\tascii[i] = (char)unicode[i];\n\t\tascii[i] = 0;\n\t}\n\telse\n\t{\t\/\/ not word-aligned\n\t\tfor (i=0; (*(char*)&unicode[i] != 0 || *(((char*)&unicode[i])+1) != 0) && i<maxChars; i++)\n\t\t\tascii[i] = *(char*)&unicode[i];\n\t\tascii[i] = 0;\n\t}\n}\n\n\n\/\/\n\/\/ ascii\/unicode typesafe versions of strcat\n\/\/\n\nchar* ts_strcat(char* dest, const WCHAR* src)\n{\n\tchar* p = dest;\n\twhile (*p != '\\0')\n\t\tp++;\n\tunicode2ascii(src, p);\n\treturn dest;\n}\n\nWCHAR* ts_strcat(WCHAR* dest, const char* src)\n{\n\tWCHAR* p = dest;\n\twhile (*p != '\\0')\n\t\tp++;\n\tascii2unicode(src, p);\n\treturn dest;\n}\n\n\n\/\/\n\/\/ ascii\/unicode typesafe versions of strdup\n\/\/\n\nchar* ts_strdup_unicode_to_ascii(const WCHAR* str)\n{\n\tchar* result = (char*)malloc(wcslen(str)+1);\n\tif (result == NULL)\n\t\treturn NULL;\n\tunicode2ascii(str, result);\n\treturn result;\n}\n\nWCHAR* ts_strdup_ascii_to_unicode(const char* str)\n{\n\tWCHAR* result = (WCHAR*)malloc((strlen(str)+1)*2);\n\tif (result == NULL)\n\t\treturn NULL;\n\tascii2unicode(str, result);\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"client.h\"\n#include \"util.h\"\n#include <thread>\n#include <sys\/time.h>\n#include \"unistd.h\"\n\nClient::Client(const std::string id, const User* user, uint16_t keepAlive, const Will* will) : pingDulation(0), Terminal(id, user, keepAlive, will) {}\n\nClient::~Client() {}\n\nMQTT_ERROR Client::ping() {\n MQTT_ERROR err = this->ct->sendMessage(new PingreqMessage());\n gettimeofday(&(this->timeOfPing), NULL);\n return err;\n}\n\nvoid pingLoop(Client* c) {\n while (c->isConnecting) {\n usleep(c->pingDulation);\n c->ct->sendMessage(new PingrespMessage());\n gettimeofday(&(c->timeOfPing), NULL);\n }\n}\n\nMQTT_ERROR Client::connect(const std::string addr, int port, bool cs) {\n if (this->ID.size() == 0 && !cs) {\n return CLEANSESSION_MUST_BE_TRUE;\n cs = true;\n }\n\n this->ct = new Transport(addr, port);\n this->ct->connectTarget();\n this->cleanSession = cs;\n MQTT_ERROR err = this->ct->sendMessage(new ConnectMessage(this->keepAlive, this->ID, this->cleanSession, this->will, this->user));\n if (err != NO_ERROR) {\n return err;\n }\n std::thread t(readLoop, this);\n t.join();\n this->readThread = &t;\n return err;\n}\n\nMQTT_ERROR Client::disconnectProcessing() {\n MQTT_ERROR err = NO_ERROR;\n if (this->isConnecting) {\n this->isConnecting = false; \/\/ this makes readLoop stop\n }\n err = this->disconnectBase();\n return err;\n}\n\nMQTT_ERROR Client::publish(const std::string topic, const std::string data, uint8_t qos, bool retain) {\n if (qos >= 3) {\n return INVALID_QOS_3;\n }\n \/\/if ()\n\n uint16_t id = 0;\n if (qos > 0) {\n MQTT_ERROR err = getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n }\n return this->sendMessage(new PublishMessage(false, qos, retain, id, topic, data));\n}\n\nMQTT_ERROR Client::subscribe(std::vector<SubscribeTopic*> topics) {\n uint16_t id = 0;\n MQTT_ERROR err = getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n for (int i = 0; i < topics.size(); i++) {\n std::vector<std::string> parts;\n split(topics[i]->topic, \"\/\", &parts);\n for (int j = 0; i < parts.size(); i++) {\n if (parts[j][0] == '#' && j != parts.size() - 1) {\n return MULTI_LEVEL_WILDCARD_MUST_BE_ON_TAIL;\n } else if (false) {\n } \/\/ has suffix of '#' and '+'\n }\n }\n return this->sendMessage(new SubscribeMessage(id, topics));\n}\n\nMQTT_ERROR Client::unsubscribe(std::vector<std::string> topics) {\n for (int i = 0; i < topics.size(); i++) {\n std::vector<std::string> parts;\n split(topics[i], \"\/\", &parts);\n for (int j = 0; j < parts.size(); j++) {\n if (parts[j][0] == '#' && j != parts.size() - 1) {\n return MULTI_LEVEL_WILDCARD_MUST_BE_ON_TAIL;\n } else if (parts[j][parts[j].size()-1] == '#' || parts[j][parts[j].size()-1] == '+') {\n return WILDCARD_MUST_NOT_BE_ADJACENT_TO_NAME;\n }\n }\n }\n uint16_t id = 0;\n MQTT_ERROR err = this->getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n return this->sendMessage(new UnsubscribeMessage(id, topics));\n}\n\nMQTT_ERROR Client::disconnect() {\n MQTT_ERROR err = this->sendMessage(new DisconnectMessage());\n \/\/ TODO : find out how to use thread\n \/\/std::thread t = std::thread([]{\n usleep(this->pingDulation*2);\n this->disconnectProcessing();\n \/\/});\n return err;\n}\n\nMQTT_ERROR Client::recvConnectMessage(ConnectMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvConnackMessage(ConnackMessage* m) {\n if (m->returnCode != CONNECT_ACCEPTED) {\n \/\/return m->ReturnCode;\n }\n\n this->isConnecting = true;\n if (this->keepAlive != 0) {\n std::thread t(pingLoop, this);\n t.join();\n }\n\n return this->redelivery();\n}\n\n\nMQTT_ERROR Client::recvPublishMessage(PublishMessage* m) {\n if (m->fh->dup) {\n \/\/ re-delivered;\n } else {\n \/\/ first time delivery\n }\n\n if (m->fh->retain) {\n \/\/ retained Message\n }\n\n switch (m->fh->qos) {\n case 0:\n if (m->fh->packetID != 0) {\n return PACKET_ID_SHOULD_BE_ZERO; \/\/ packet id should be zero\n }\n break;\n case 1:\n return this->sendMessage(new PubackMessage(m->fh->packetID));\n break;\n case 2:\n return this->sendMessage(new PubrecMessage(m->fh->packetID));\n break;\n }\n return NO_ERROR;\n}\n\n\nMQTT_ERROR Client::recvPubackMessage(PubackMessage* m) {\n if (m->fh->packetID > 0) {\n return this->ackMessage(m->fh->packetID);\n }\n return NO_ERROR;\n}\n\nMQTT_ERROR Client::recvPubrecMessage(PubrecMessage* m) {\n MQTT_ERROR err = this->ackMessage(m->fh->packetID);\n if (err < 0) {\n return err;\n }\n err = this->sendMessage(new PubrelMessage(m->fh->packetID));\n return err;\n}\nMQTT_ERROR Client::recvPubrelMessage(PubrelMessage* m) {\n MQTT_ERROR err = this->ackMessage(m->fh->packetID);\n if (err < 0) {\n return err;\n }\n err = this->sendMessage(new PubcompMessage(m->fh->packetID));\n return err;\n}\n\nMQTT_ERROR Client::recvPubcompMessage(PubcompMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvSubscribeMessage(SubscribeMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvSubackMessage(SubackMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvUnsubscribeMessage(UnsubscribeMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvUnsubackMessage(UnsubackMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvPingreqMessage(PingreqMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvPingrespMessage(PingrespMessage* m) {\n struct timeval tmp;\n gettimeofday(&tmp, NULL);\n this->pingDulation = (tmp.tv_sec - this->timeOfPing.tv_sec)*1000000 + (tmp.tv_usec - this->timeOfPing.tv_usec);\n if (this->pingDulation >= this->keepAlive) {\n this->sendMessage(new DisconnectMessage());\n return SERVER_TIMED_OUT;\n }\n return NO_ERROR;\n}\n\nMQTT_ERROR Client::recvDisconnectMessage(DisconnectMessage* m) {return INVALID_MESSAGE_CAME;}\n\n<commit_msg>avoid shortcut<commit_after>#include \"client.h\"\n#include \"util.h\"\n#include <thread>\n#include <sys\/time.h>\n#include \"unistd.h\"\n\nClient::Client(const std::string id, const User* user, uint16_t keepAlive, const Will* will) : pingDulation(0), Terminal(id, user, keepAlive, will) {}\n\nClient::~Client() {}\n\nMQTT_ERROR Client::ping() {\n MQTT_ERROR err = this->sendMessage(new PingreqMessage());\n gettimeofday(&(this->timeOfPing), NULL);\n return err;\n}\n\nvoid pingLoop(Client* c) {\n while (c->isConnecting) {\n usleep(c->pingDulation);\n c->sendMessage(new PingrespMessage());\n gettimeofday(&(c->timeOfPing), NULL);\n }\n}\n\nMQTT_ERROR Client::connect(const std::string addr, int port, bool cs) {\n if (this->ID.size() == 0 && !cs) {\n return CLEANSESSION_MUST_BE_TRUE;\n cs = true;\n }\n\n this->ct = new Transport(addr, port);\n this->ct->connectTarget();\n this->cleanSession = cs;\n MQTT_ERROR err = this->ct->sendMessage(new ConnectMessage(this->keepAlive, this->ID, this->cleanSession, this->will, this->user));\n if (err != NO_ERROR) {\n return err;\n }\n std::thread t(readLoop, this);\n t.join();\n this->readThread = &t;\n return err;\n}\n\nMQTT_ERROR Client::disconnectProcessing() {\n MQTT_ERROR err = NO_ERROR;\n if (this->isConnecting) {\n this->isConnecting = false; \/\/ this makes readLoop stop\n }\n err = this->disconnectBase();\n return err;\n}\n\nMQTT_ERROR Client::publish(const std::string topic, const std::string data, uint8_t qos, bool retain) {\n if (qos >= 3) {\n return INVALID_QOS_3;\n }\n \/\/if ()\n\n uint16_t id = 0;\n if (qos > 0) {\n MQTT_ERROR err = getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n }\n return this->sendMessage(new PublishMessage(false, qos, retain, id, topic, data));\n}\n\nMQTT_ERROR Client::subscribe(std::vector<SubscribeTopic*> topics) {\n uint16_t id = 0;\n MQTT_ERROR err = getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n for (int i = 0; i < topics.size(); i++) {\n std::vector<std::string> parts;\n split(topics[i]->topic, \"\/\", &parts);\n for (int j = 0; i < parts.size(); i++) {\n if (parts[j][0] == '#' && j != parts.size() - 1) {\n return MULTI_LEVEL_WILDCARD_MUST_BE_ON_TAIL;\n } else if (false) {\n } \/\/ has suffix of '#' and '+'\n }\n }\n return this->sendMessage(new SubscribeMessage(id, topics));\n}\n\nMQTT_ERROR Client::unsubscribe(std::vector<std::string> topics) {\n for (int i = 0; i < topics.size(); i++) {\n std::vector<std::string> parts;\n split(topics[i], \"\/\", &parts);\n for (int j = 0; j < parts.size(); j++) {\n if (parts[j][0] == '#' && j != parts.size() - 1) {\n return MULTI_LEVEL_WILDCARD_MUST_BE_ON_TAIL;\n } else if (parts[j][parts[j].size()-1] == '#' || parts[j][parts[j].size()-1] == '+') {\n return WILDCARD_MUST_NOT_BE_ADJACENT_TO_NAME;\n }\n }\n }\n uint16_t id = 0;\n MQTT_ERROR err = this->getUsablePacketID(&id);\n if (err != NO_ERROR) {\n return err;\n }\n return this->sendMessage(new UnsubscribeMessage(id, topics));\n}\n\nMQTT_ERROR Client::disconnect() {\n MQTT_ERROR err = this->sendMessage(new DisconnectMessage());\n \/\/ TODO : find out how to use thread\n \/\/std::thread t = std::thread([]{\n usleep(this->pingDulation*2);\n this->disconnectProcessing();\n \/\/});\n return err;\n}\n\nMQTT_ERROR Client::recvConnectMessage(ConnectMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvConnackMessage(ConnackMessage* m) {\n if (m->returnCode != CONNECT_ACCEPTED) {\n \/\/return m->ReturnCode;\n }\n\n this->isConnecting = true;\n if (this->keepAlive != 0) {\n std::thread t(pingLoop, this);\n t.join();\n }\n\n return this->redelivery();\n}\n\n\nMQTT_ERROR Client::recvPublishMessage(PublishMessage* m) {\n if (m->fh->dup) {\n \/\/ re-delivered;\n } else {\n \/\/ first time delivery\n }\n\n if (m->fh->retain) {\n \/\/ retained Message\n }\n\n switch (m->fh->qos) {\n case 0:\n if (m->fh->packetID != 0) {\n return PACKET_ID_SHOULD_BE_ZERO; \/\/ packet id should be zero\n }\n break;\n case 1:\n return this->sendMessage(new PubackMessage(m->fh->packetID));\n break;\n case 2:\n return this->sendMessage(new PubrecMessage(m->fh->packetID));\n break;\n }\n return NO_ERROR;\n}\n\n\nMQTT_ERROR Client::recvPubackMessage(PubackMessage* m) {\n if (m->fh->packetID > 0) {\n return this->ackMessage(m->fh->packetID);\n }\n return NO_ERROR;\n}\n\nMQTT_ERROR Client::recvPubrecMessage(PubrecMessage* m) {\n MQTT_ERROR err = this->ackMessage(m->fh->packetID);\n if (err < 0) {\n return err;\n }\n err = this->sendMessage(new PubrelMessage(m->fh->packetID));\n return err;\n}\nMQTT_ERROR Client::recvPubrelMessage(PubrelMessage* m) {\n MQTT_ERROR err = this->ackMessage(m->fh->packetID);\n if (err < 0) {\n return err;\n }\n err = this->sendMessage(new PubcompMessage(m->fh->packetID));\n return err;\n}\n\nMQTT_ERROR Client::recvPubcompMessage(PubcompMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvSubscribeMessage(SubscribeMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvSubackMessage(SubackMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvUnsubscribeMessage(UnsubscribeMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvUnsubackMessage(UnsubackMessage* m) {\n return this->ackMessage(m->fh->packetID);\n}\n\nMQTT_ERROR Client::recvPingreqMessage(PingreqMessage* m) {return INVALID_MESSAGE_CAME;}\n\nMQTT_ERROR Client::recvPingrespMessage(PingrespMessage* m) {\n struct timeval tmp;\n gettimeofday(&tmp, NULL);\n this->pingDulation = (tmp.tv_sec - this->timeOfPing.tv_sec)*1000000 + (tmp.tv_usec - this->timeOfPing.tv_usec);\n if (this->pingDulation >= this->keepAlive) {\n this->sendMessage(new DisconnectMessage());\n return SERVER_TIMED_OUT;\n }\n return NO_ERROR;\n}\n\nMQTT_ERROR Client::recvDisconnectMessage(DisconnectMessage* m) {return INVALID_MESSAGE_CAME;}\n\n<|endoftext|>"} {"text":"<commit_before>\/*!\n \\file thread.cpp\n \\brief Thread abstraction implementation\n \\author Ivan Shynkarenka\n \\date 27.01.2016\n \\copyright MIT License\n*\/\n\n#include \"threads\/thread.h\"\n\n#include \"errors\/exceptions.h\"\n#include \"time\/timestamp.h\"\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#undef Yield\n#define STATUS_SUCCESS 0x00000000\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n#include <errno.h>\n#include <pthread.h>\n#include <time.h>\n#endif\n\nnamespace CppCommon {\n\n\/\/! @cond\nnamespace Internals {\n\n#if defined(_WIN32) || defined(_WIN64)\n\/\/ Helper function to set minimum resolution of the Windows Timer\nuint64_t SetMinimumTimerResolution()\n{\n static NTSTATUS(__stdcall *NtQueryTimerResolution)(OUT PULONG MinimumResolution, OUT PULONG MaximumResolution, OUT PULONG ActualResolution) = (NTSTATUS(__stdcall*)(PULONG, PULONG, PULONG))GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtQueryTimerResolution\");\n static NTSTATUS(__stdcall *NtSetTimerResolution)(IN ULONG RequestedResolution, IN BOOLEAN Set, OUT PULONG ActualResolution) = (NTSTATUS(__stdcall*)(ULONG, BOOLEAN, PULONG))GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtSetTimerResolution\");\n\n if ((NtQueryTimerResolution == nullptr) || (NtSetTimerResolution == nullptr))\n return 0;\n\n ULONG MinimumResolution, MaximumResolution, ActualResolution;\n NTSTATUS ns = NtQueryTimerResolution(&MinimumResolution, &MaximumResolution, &ActualResolution);\n if (ns == STATUS_SUCCESS)\n {\n ns = NtSetTimerResolution(min(MinimumResolution, MaximumResolution), TRUE, &ActualResolution);\n if (ns == STATUS_SUCCESS)\n return (ActualResolution * 100);\n }\n return 1000000;\n}\n#endif\n\n} \/\/ namespace Internals\n\/\/! @endcond\n\nuint64_t Thread::CurrentThreadId() noexcept\n{\n#if defined(_WIN32) || defined(_WIN64)\n return GetCurrentThreadId();\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n return pthread_self();\n#endif\n}\n\nvoid Thread::SleepFor(const Timespan& timespan) noexcept\n{\n if (timespan < 0)\n return;\n if (timespan == 0)\n return Yield();\n#if defined(_WIN32) || defined(_WIN64)\n static NTSTATUS(__stdcall *NtDelayExecution)(IN BOOLEAN Alertable, IN PLARGE_INTEGER DelayInterval) = (NTSTATUS(__stdcall*)(BOOLEAN, PLARGE_INTEGER)) GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtDelayExecution\");\n\n \/\/ Update once and get Windows Timer resolution\n static int64_t resolution = Internals::SetMinimumTimerResolution();\n\n int64_t sleep = timespan.nanoseconds();\n int64_t yield = timespan.nanoseconds() % resolution;\n\n \/\/ Yield to other thread for a short time\n if (yield > 0)\n {\n int64_t current = Timestamp::nano();\n do\n {\n SwitchToThread();\n int64_t temp = Timestamp::nano() - current;\n sleep -= temp;\n yield -= temp;\n } while (yield > 0);\n }\n\n \/\/ Sleep if we have enough time\n if (sleep > 0)\n {\n if (NtDelayExecution != nullptr)\n {\n \/\/ Sleep with microsecond precision\n LARGE_INTEGER interval;\n interval.QuadPart = -sleep \/ 100;\n NtDelayExecution(FALSE, &interval);\n }\n else\n {\n \/\/ Sleep with millisecond precision\n Sleep(sleep \/ 1000000);\n }\n }\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n struct timespec req, rem;\n req.tv_sec = timespan.seconds();\n req.tv_nsec = timespan.nanoseconds() % 1000000000;\n\n \/\/ Call nanosleep() in loop until we have remaining time to sleep\n while (nanosleep(&req, &rem) == -1)\n {\n if (errno == EINTR)\n req = rem;\n else\n break;\n }\n#endif\n}\n\nvoid Thread::Yield() noexcept\n{\n#if defined(_WIN32) || defined(_WIN64)\n SwitchToThread();\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n pthread_yield();\n#endif\n}\n\nThreadPriority Thread::GetPriority()\n{\n#if defined(_WIN32) || defined(_WIN64)\n HANDLE hThread = GetCurrentThread();\n int priority = GetThreadPriority(hThread);\n if (priority == THREAD_PRIORITY_ERROR_RETURN)\n throwex SystemException(\"Failed to get the current thread priority!\");\n if (priority < THREAD_PRIORITY_LOWEST)\n return ThreadPriority::IDLE;\n else if (priority < THREAD_PRIORITY_BELOW_NORMAL)\n return ThreadPriority::LOWEST;\n else if (priority < THREAD_PRIORITY_NORMAL)\n return ThreadPriority::LOW;\n else if (priority < THREAD_PRIORITY_ABOVE_NORMAL)\n return ThreadPriority::NORMAL;\n else if (priority < THREAD_PRIORITY_HIGHEST)\n return ThreadPriority::HIGH;\n else if (priority < THREAD_PRIORITY_TIME_CRITICAL)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy;\n struct sched_param sched;\n int result = pthread_getschedparam(pthread_self(), &policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to get the current thread priority!\");\n if ((policy == SCHED_FIFO) || (policy == SCHED_RR))\n {\n if (sched.sched_priority < 15)\n return ThreadPriority::IDLE;\n else if (sched.sched_priority < 30)\n return ThreadPriority::LOWEST;\n else if (sched.sched_priority < 50)\n return ThreadPriority::LOW;\n else if (sched.sched_priority < 70)\n return ThreadPriority::NORMAL;\n else if (sched.sched_priority < 85)\n return ThreadPriority::HIGH;\n else if (sched.sched_priority < 99)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n }\n else\n return ThreadPriority::NORMAL;\n#endif\n}\n\nThreadPriority Thread::GetPriority(std::thread& thread)\n{\n#if defined(_WIN32) || defined(_WIN64)\n HANDLE hThread = thread.native_handle();\n int priority = GetThreadPriority(hThread);\n if (priority == THREAD_PRIORITY_ERROR_RETURN)\n throwex SystemException(\"Failed to get the given thread priority!\");\n if (priority < THREAD_PRIORITY_LOWEST)\n return ThreadPriority::IDLE;\n else if (priority < THREAD_PRIORITY_BELOW_NORMAL)\n return ThreadPriority::LOWEST;\n else if (priority < THREAD_PRIORITY_NORMAL)\n return ThreadPriority::LOW;\n else if (priority < THREAD_PRIORITY_ABOVE_NORMAL)\n return ThreadPriority::NORMAL;\n else if (priority < THREAD_PRIORITY_HIGHEST)\n return ThreadPriority::HIGH;\n else if (priority < THREAD_PRIORITY_TIME_CRITICAL)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy;\n struct sched_param sched;\n int result = pthread_getschedparam(thread.native_handle(), &policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to get the given thread priority!\");\n if ((policy == SCHED_FIFO) || (policy == SCHED_RR))\n {\n if (sched.sched_priority < 15)\n return ThreadPriority::IDLE;\n else if (sched.sched_priority < 30)\n return ThreadPriority::LOWEST;\n else if (sched.sched_priority < 50)\n return ThreadPriority::LOW;\n else if (sched.sched_priority < 70)\n return ThreadPriority::NORMAL;\n else if (sched.sched_priority < 85)\n return ThreadPriority::HIGH;\n else if (sched.sched_priority < 99)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n }\n else\n return ThreadPriority::NORMAL;\n#endif\n}\n\nvoid Thread::SetPriority(ThreadPriority priority)\n{\n#if defined(_WIN32) || defined(_WIN64)\n int nPriority = THREAD_PRIORITY_NORMAL;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = THREAD_PRIORITY_IDLE;\n break;\n case ThreadPriority::LOWEST:\n nPriority = THREAD_PRIORITY_LOWEST;\n break;\n case ThreadPriority::LOW:\n nPriority = THREAD_PRIORITY_BELOW_NORMAL;\n break;\n case ThreadPriority::NORMAL:\n nPriority = THREAD_PRIORITY_NORMAL;\n break;\n case ThreadPriority::HIGH:\n nPriority = THREAD_PRIORITY_ABOVE_NORMAL;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = THREAD_PRIORITY_HIGHEST;\n break;\n case ThreadPriority::REALTIME:\n nPriority = THREAD_PRIORITY_TIME_CRITICAL;\n break;\n }\n\n HANDLE hThread = GetCurrentThread();\n if (!SetThreadPriority(hThread, nPriority))\n throwex SystemException(\"Failed to set the current thread priority!\");\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy = SCHED_RR;\n struct sched_param sched;\n sched.sched_priority = 50;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = 1;\n break;\n case ThreadPriority::LOWEST:\n nPriority = 15;\n break;\n case ThreadPriority::LOW:\n nPriority = 30;\n break;\n case ThreadPriority::NORMAL:\n nPriority = 50;\n break;\n case ThreadPriority::HIGH:\n nPriority = 70;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = 85;\n break;\n case ThreadPriority::REALTIME:\n nPriority = 99;\n break;\n }\n\n int result = pthread_setschedparam(pthread_self(), policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to set the current thread priority!\");\n#endif\n}\n\nvoid Thread::SetPriority(std::thread& thread, ThreadPriority priority)\n{\n#if defined(_WIN32) || defined(_WIN64)\n int nPriority = THREAD_PRIORITY_NORMAL;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = THREAD_PRIORITY_IDLE;\n break;\n case ThreadPriority::LOWEST:\n nPriority = THREAD_PRIORITY_LOWEST;\n break;\n case ThreadPriority::LOW:\n nPriority = THREAD_PRIORITY_BELOW_NORMAL;\n break;\n case ThreadPriority::NORMAL:\n nPriority = THREAD_PRIORITY_NORMAL;\n break;\n case ThreadPriority::HIGH:\n nPriority = THREAD_PRIORITY_ABOVE_NORMAL;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = THREAD_PRIORITY_HIGHEST;\n break;\n case ThreadPriority::REALTIME:\n nPriority = THREAD_PRIORITY_TIME_CRITICAL;\n break;\n }\n\n HANDLE hThread = thread.native_handle();\n if (!SetThreadPriority(hThread, nPriority))\n throwex SystemException(\"Failed to set the given thread priority!\");\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy = SCHED_RR;\n struct sched_param sched;\n sched.sched_priority = 50;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = 1;\n break;\n case ThreadPriority::LOWEST:\n nPriority = 15;\n break;\n case ThreadPriority::LOW:\n nPriority = 30;\n break;\n case ThreadPriority::NORMAL:\n nPriority = 50;\n break;\n case ThreadPriority::HIGH:\n nPriority = 70;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = 85;\n break;\n case ThreadPriority::REALTIME:\n nPriority = 99;\n break;\n }\n\n int result = pthread_setschedparam(thread.native_handle(), policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to set the given thread priority!\");\n#endif\n}\n\n} \/\/ namespace CppCommon\n<commit_msg>Bugfixing<commit_after>\/*!\n \\file thread.cpp\n \\brief Thread abstraction implementation\n \\author Ivan Shynkarenka\n \\date 27.01.2016\n \\copyright MIT License\n*\/\n\n#include \"threads\/thread.h\"\n\n#include \"errors\/exceptions.h\"\n#include \"time\/timestamp.h\"\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <windows.h>\n#undef Yield\n#define STATUS_SUCCESS 0x00000000\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n#include <errno.h>\n#include <pthread.h>\n#include <time.h>\n#endif\n\nnamespace CppCommon {\n\n\/\/! @cond\nnamespace Internals {\n\n#if defined(_WIN32) || defined(_WIN64)\n\/\/ Helper function to set minimum resolution of the Windows Timer\nuint64_t SetMinimumTimerResolution()\n{\n static NTSTATUS(__stdcall *NtQueryTimerResolution)(OUT PULONG MinimumResolution, OUT PULONG MaximumResolution, OUT PULONG ActualResolution) = (NTSTATUS(__stdcall*)(PULONG, PULONG, PULONG))GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtQueryTimerResolution\");\n static NTSTATUS(__stdcall *NtSetTimerResolution)(IN ULONG RequestedResolution, IN BOOLEAN Set, OUT PULONG ActualResolution) = (NTSTATUS(__stdcall*)(ULONG, BOOLEAN, PULONG))GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtSetTimerResolution\");\n\n if ((NtQueryTimerResolution == nullptr) || (NtSetTimerResolution == nullptr))\n return 0;\n\n ULONG MinimumResolution, MaximumResolution, ActualResolution;\n NTSTATUS ns = NtQueryTimerResolution(&MinimumResolution, &MaximumResolution, &ActualResolution);\n if (ns == STATUS_SUCCESS)\n {\n ns = NtSetTimerResolution(min(MinimumResolution, MaximumResolution), TRUE, &ActualResolution);\n if (ns == STATUS_SUCCESS)\n return (ActualResolution * 100);\n }\n return 1000000;\n}\n#endif\n\n} \/\/ namespace Internals\n\/\/! @endcond\n\nuint64_t Thread::CurrentThreadId() noexcept\n{\n#if defined(_WIN32) || defined(_WIN64)\n return GetCurrentThreadId();\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n return pthread_self();\n#endif\n}\n\nvoid Thread::SleepFor(const Timespan& timespan) noexcept\n{\n if (timespan < 0)\n return;\n if (timespan == 0)\n return Yield();\n#if defined(_WIN32) || defined(_WIN64)\n static NTSTATUS(__stdcall *NtDelayExecution)(IN BOOLEAN Alertable, IN PLARGE_INTEGER DelayInterval) = (NTSTATUS(__stdcall*)(BOOLEAN, PLARGE_INTEGER)) GetProcAddress(GetModuleHandle(\"ntdll.dll\"), \"NtDelayExecution\");\n\n \/\/ Update once and get Windows Timer resolution\n static int64_t resolution = Internals::SetMinimumTimerResolution();\n\n int64_t sleep = timespan.nanoseconds();\n int64_t yield = timespan.nanoseconds() % resolution;\n\n \/\/ Yield to other thread for a short time\n if (yield > 0)\n {\n int64_t current = Timestamp::nano();\n do\n {\n SwitchToThread();\n int64_t temp = Timestamp::nano() - current;\n sleep -= temp;\n yield -= temp;\n } while (yield > 0);\n }\n\n \/\/ Sleep if we have enough time\n if (sleep > 0)\n {\n if (NtDelayExecution != nullptr)\n {\n \/\/ Sleep with microsecond precision\n LARGE_INTEGER interval;\n interval.QuadPart = -sleep \/ 100;\n NtDelayExecution(FALSE, &interval);\n }\n else\n {\n \/\/ Sleep with millisecond precision\n Sleep(sleep \/ 1000000);\n }\n }\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n struct timespec req, rem;\n req.tv_sec = timespan.seconds();\n req.tv_nsec = timespan.nanoseconds() % 1000000000;\n\n \/\/ Call nanosleep() in loop until we have remaining time to sleep\n while (nanosleep(&req, &rem) == -1)\n {\n if (errno == EINTR)\n req = rem;\n else\n break;\n }\n#endif\n}\n\nvoid Thread::Yield() noexcept\n{\n#if defined(_WIN32) || defined(_WIN64)\n SwitchToThread();\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n pthread_yield();\n#endif\n}\n\nThreadPriority Thread::GetPriority()\n{\n#if defined(_WIN32) || defined(_WIN64)\n HANDLE hThread = GetCurrentThread();\n int priority = GetThreadPriority(hThread);\n if (priority == THREAD_PRIORITY_ERROR_RETURN)\n throwex SystemException(\"Failed to get the current thread priority!\");\n if (priority < THREAD_PRIORITY_LOWEST)\n return ThreadPriority::IDLE;\n else if (priority < THREAD_PRIORITY_BELOW_NORMAL)\n return ThreadPriority::LOWEST;\n else if (priority < THREAD_PRIORITY_NORMAL)\n return ThreadPriority::LOW;\n else if (priority < THREAD_PRIORITY_ABOVE_NORMAL)\n return ThreadPriority::NORMAL;\n else if (priority < THREAD_PRIORITY_HIGHEST)\n return ThreadPriority::HIGH;\n else if (priority < THREAD_PRIORITY_TIME_CRITICAL)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy;\n struct sched_param sched;\n int result = pthread_getschedparam(pthread_self(), &policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to get the current thread priority!\");\n if ((policy == SCHED_FIFO) || (policy == SCHED_RR))\n {\n if (sched.sched_priority < 15)\n return ThreadPriority::IDLE;\n else if (sched.sched_priority < 30)\n return ThreadPriority::LOWEST;\n else if (sched.sched_priority < 50)\n return ThreadPriority::LOW;\n else if (sched.sched_priority < 70)\n return ThreadPriority::NORMAL;\n else if (sched.sched_priority < 85)\n return ThreadPriority::HIGH;\n else if (sched.sched_priority < 99)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n }\n else\n return ThreadPriority::NORMAL;\n#endif\n}\n\nThreadPriority Thread::GetPriority(std::thread& thread)\n{\n#if defined(_WIN32) || defined(_WIN64)\n HANDLE hThread = thread.native_handle();\n int priority = GetThreadPriority(hThread);\n if (priority == THREAD_PRIORITY_ERROR_RETURN)\n throwex SystemException(\"Failed to get the given thread priority!\");\n if (priority < THREAD_PRIORITY_LOWEST)\n return ThreadPriority::IDLE;\n else if (priority < THREAD_PRIORITY_BELOW_NORMAL)\n return ThreadPriority::LOWEST;\n else if (priority < THREAD_PRIORITY_NORMAL)\n return ThreadPriority::LOW;\n else if (priority < THREAD_PRIORITY_ABOVE_NORMAL)\n return ThreadPriority::NORMAL;\n else if (priority < THREAD_PRIORITY_HIGHEST)\n return ThreadPriority::HIGH;\n else if (priority < THREAD_PRIORITY_TIME_CRITICAL)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy;\n struct sched_param sched;\n int result = pthread_getschedparam(thread.native_handle(), &policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to get the given thread priority!\");\n if ((policy == SCHED_FIFO) || (policy == SCHED_RR))\n {\n if (sched.sched_priority < 15)\n return ThreadPriority::IDLE;\n else if (sched.sched_priority < 30)\n return ThreadPriority::LOWEST;\n else if (sched.sched_priority < 50)\n return ThreadPriority::LOW;\n else if (sched.sched_priority < 70)\n return ThreadPriority::NORMAL;\n else if (sched.sched_priority < 85)\n return ThreadPriority::HIGH;\n else if (sched.sched_priority < 99)\n return ThreadPriority::HIGHEST;\n else\n return ThreadPriority::REALTIME;\n }\n else\n return ThreadPriority::NORMAL;\n#endif\n}\n\nvoid Thread::SetPriority(ThreadPriority priority)\n{\n#if defined(_WIN32) || defined(_WIN64)\n int nPriority = THREAD_PRIORITY_NORMAL;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = THREAD_PRIORITY_IDLE;\n break;\n case ThreadPriority::LOWEST:\n nPriority = THREAD_PRIORITY_LOWEST;\n break;\n case ThreadPriority::LOW:\n nPriority = THREAD_PRIORITY_BELOW_NORMAL;\n break;\n case ThreadPriority::NORMAL:\n nPriority = THREAD_PRIORITY_NORMAL;\n break;\n case ThreadPriority::HIGH:\n nPriority = THREAD_PRIORITY_ABOVE_NORMAL;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = THREAD_PRIORITY_HIGHEST;\n break;\n case ThreadPriority::REALTIME:\n nPriority = THREAD_PRIORITY_TIME_CRITICAL;\n break;\n }\n\n HANDLE hThread = GetCurrentThread();\n if (!SetThreadPriority(hThread, nPriority))\n throwex SystemException(\"Failed to set the current thread priority!\");\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy = SCHED_RR;\n struct sched_param sched;\n sched.sched_priority = 50;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n sched.sched_priority = 1;\n break;\n case ThreadPriority::LOWEST:\n sched.sched_priority = 15;\n break;\n case ThreadPriority::LOW:\n sched.sched_priority = 30;\n break;\n case ThreadPriority::NORMAL:\n sched.sched_priority = 50;\n break;\n case ThreadPriority::HIGH:\n sched.sched_priority = 70;\n break;\n case ThreadPriority::HIGHEST:\n sched.sched_priority = 85;\n break;\n case ThreadPriority::REALTIME:\n sched.sched_priority = 99;\n break;\n }\n\n int result = pthread_setschedparam(pthread_self(), policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to set the current thread priority!\");\n#endif\n}\n\nvoid Thread::SetPriority(std::thread& thread, ThreadPriority priority)\n{\n#if defined(_WIN32) || defined(_WIN64)\n int nPriority = THREAD_PRIORITY_NORMAL;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n nPriority = THREAD_PRIORITY_IDLE;\n break;\n case ThreadPriority::LOWEST:\n nPriority = THREAD_PRIORITY_LOWEST;\n break;\n case ThreadPriority::LOW:\n nPriority = THREAD_PRIORITY_BELOW_NORMAL;\n break;\n case ThreadPriority::NORMAL:\n nPriority = THREAD_PRIORITY_NORMAL;\n break;\n case ThreadPriority::HIGH:\n nPriority = THREAD_PRIORITY_ABOVE_NORMAL;\n break;\n case ThreadPriority::HIGHEST:\n nPriority = THREAD_PRIORITY_HIGHEST;\n break;\n case ThreadPriority::REALTIME:\n nPriority = THREAD_PRIORITY_TIME_CRITICAL;\n break;\n }\n\n HANDLE hThread = thread.native_handle();\n if (!SetThreadPriority(hThread, nPriority))\n throwex SystemException(\"Failed to set the given thread priority!\");\n#elif defined(unix) || defined(__unix) || defined(__unix__)\n int policy = SCHED_RR;\n struct sched_param sched;\n sched.sched_priority = 50;\n switch (priority)\n {\n case ThreadPriority::IDLE:\n sched.sched_priority = 1;\n break;\n case ThreadPriority::LOWEST:\n sched.sched_priority = 15;\n break;\n case ThreadPriority::LOW:\n sched.sched_priority = 30;\n break;\n case ThreadPriority::NORMAL:\n sched.sched_priority = 50;\n break;\n case ThreadPriority::HIGH:\n sched.sched_priority = 70;\n break;\n case ThreadPriority::HIGHEST:\n sched.sched_priority = 85;\n break;\n case ThreadPriority::REALTIME:\n sched.sched_priority = 99;\n break;\n }\n\n int result = pthread_setschedparam(thread.native_handle(), policy, &sched);\n if (result != 0)\n throwex SystemException(\"Failed to set the given thread priority!\");\n#endif\n}\n\n} \/\/ namespace CppCommon\n<|endoftext|>"} {"text":"<commit_before>#include \"fenceview.h\"\n\/\/ OSG\n#include <osg\/ShapeDrawable>\n#include <osg\/Geode>\n#include <osg\/Group>\n#include <osg\/Vec4>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/ref_ptr>\n\/\/ troen\n#include \"..\/constants.h\"\n#include \"shaders.h\"\n#include \"..\/model\/fencemodel.h\"\n#include \"..\/controller\/fencecontroller.h\"\n\nusing namespace troen;\n\nFenceView::FenceView(FenceController* fenceController, osg::Vec3 color, std::shared_ptr<AbstractModel>& model) :\nAbstractView(),\nm_model(std::static_pointer_cast<FenceModel>(model)),\nm_playerColor(color),\nm_fenceController(fenceController)\n{\n\tinitializeFence();\n\tinitializeShader();\n}\n\nvoid FenceView::initializeFence()\n{\n\tm_fenceHeight = FENCE_HEIGHT_VIEW;\n\n\tm_coordinates = new osg::Vec3Array();\n\tm_coordinates->setDataVariance(osg::Object::DYNAMIC);\n\n\tm_relativeHeights = new osg::FloatArray();\n\tm_relativeHeights->setDataVariance(osg::Object::DYNAMIC);\n\n\t\/\/ this value could need adaption; will avoid time-intensive array resizing\n\tm_coordinates->reserveArray(10000);\n\tm_relativeHeights->reserveArray(10000);\n\n\tm_geometry = new osg::Geometry();\n\tm_geometry->setVertexArray(m_coordinates);\n\n\t\/\/ set the relative height between 0 and 1 as an additional vertex attribute\n\tm_geometry->setVertexAttribArray(5, m_relativeHeights);\n\tm_geometry->setVertexAttribBinding(5, osg::Geometry::BIND_PER_VERTEX);\n\n\t\/\/ seems to be important so that we won't crash after 683 fence parts\n\tm_geometry->setUseDisplayList(false);\n\n\t\/\/ use the shared normal array.\n\t\/\/ polyGeom->setNormalArray(shared_normals.get(), osg::Array::BIND_OVERALL);\n\n\tm_drawArrays = new osg::DrawArrays(osg::PrimitiveSet::QUAD_STRIP, 0, 0);\n\tm_geometry->addPrimitiveSet(m_drawArrays);\n\n\tm_geode = new osg::Geode();\n\tm_geode->addDrawable(m_geometry);\n\n\tm_node->addChild(m_geode);\n\tm_node->getOrCreateStateSet()->setMode(GL_CULL_FACE, osg::StateAttribute::OFF);\n\tm_node->setName(\"fenceGroup\");\n\n\tm_radarElementsGroup = new osg::Group();\n\tm_radarElementsGroup->setNodeMask(CAMERA_MASK_NONE);\n\tm_node->addChild(m_radarElementsGroup);\n}\n\nvoid FenceView::updateFadeOutFactor(float fadeOutFactor)\n{\n\tm_fadeOutFactorUniform->set(fadeOutFactor);\n}\n\nvoid FenceView::updateFenceGap(osg::Vec3 lastPosition, osg::Vec3 position)\n{\n\tif (m_coordinates->size() > 1) {\n\t\tm_coordinates->at(m_coordinates->size() - 2) = osg::Vec3(position.x(), position.y(), position.z());\n\t\tm_coordinates->at(m_coordinates->size() - 1) = osg::Vec3(position.x(), position.y(), position.z() + m_fenceHeight);\n\t\tm_relativeHeights->at(m_relativeHeights->size() - 2) = 0.f;\n\t\tm_relativeHeights->at(m_relativeHeights->size() - 1) = 1.f;\n\t}\n}\n\nvoid FenceView::initializeShader()\n{\n\tosg::ref_ptr<osg::StateSet> NodeState = m_node->getOrCreateStateSet();\n\t\n\tosg::Uniform* fenceColorU = new osg::Uniform(\"fenceColor\", m_playerColor);\n\tNodeState->addUniform(fenceColorU);\n\n\tosg::Uniform* modelIDU = new osg::Uniform(\"modelID\", GLOW);\n\tNodeState->addUniform(modelIDU);\n\n\tm_fadeOutFactorUniform = new osg::Uniform(\"fadeOutFactor\", 1.f);\n\tNodeState->addUniform(m_fadeOutFactorUniform);\n\n\tNodeState->setMode(GL_BLEND, osg::StateAttribute::ON);\n\tNodeState->setRenderingHint(osg::StateSet::TRANSPARENT_BIN);\n\tNodeState->setAttributeAndModes(shaders::m_allShaderPrograms[shaders::FENCE], osg::StateAttribute::ON);\n\n\tshaders::m_allShaderPrograms[shaders::FENCE]->addBindAttribLocation(\"a_relHeight\", 5);\n}\n\nvoid FenceView::addFencePart(osg::Vec3 lastPosition, osg::Vec3 currentPosition)\n{\n\n\tif (m_coordinates->size() == 0)\n\t{\n\t\tm_coordinates->push_back(lastPosition);\n\t\tm_coordinates->push_back(osg::Vec3(lastPosition.x(), lastPosition.y(), lastPosition.z() + m_fenceHeight));\n\t\tm_relativeHeights->push_back(0.f);\n\t\tm_relativeHeights->push_back(1.f);\n\t}\n\n\t\/\/ game fence part\n\tm_coordinates->push_back(currentPosition);\n\tm_coordinates->push_back(osg::Vec3(currentPosition.x(), currentPosition.y(), currentPosition.z() + m_fenceHeight));\n\tm_relativeHeights->push_back(0.f);\n\tm_relativeHeights->push_back(1.f);\n\n\n\tint currentFenceParts = (m_coordinates->size() - 2) \/ 2;\n\n\t\/\/ radar fence part\n\tif (currentFenceParts % FENCE_TO_MINIMAP_PARTS_RATIO == 0)\n\t{\n\t\tosg::ref_ptr<osg::Box> box\n\t\t\t= new osg::Box(osg::Vec3(0, 0, 0), 60, 60, 60);\n\t\tosg::ref_ptr<osg::ShapeDrawable> mark_shape = new osg::ShapeDrawable(box);\n\t\tmark_shape->setColor(osg::Vec4f(m_playerColor, 1));\n\t\tosg::ref_ptr<osg::Geode> mark_node = new osg::Geode;\n\t\tmark_node->addDrawable(mark_shape.get());\n\t\t\/\/mark_node->getOrCreateStateSet()->setRenderingHint(osg::StateSet::TRANSPARENT_BIN);\n\n\t\t\/\/ place objects in world space\n\t\tosg::Matrixd initialTransform;\n\t\t\/\/initialTransform.makeRotate(rotationQuatXY);\n\t\tinitialTransform *= initialTransform.translate((currentPosition + lastPosition) \/ 2);\n\n\t\tosg::ref_ptr<osg::MatrixTransform> matrixTransformRadar = new osg::MatrixTransform(initialTransform);\n\t\tmatrixTransformRadar->addChild(mark_node);\n\n\t\tm_radarElementsGroup->addChild(matrixTransformRadar);\n\t\tm_radarFenceBoxes.push_back(matrixTransformRadar);\n\t}\n\n\t\/\/ limit\n\tenforceFencePartsLimit();\n\n\t\/\/ TODO\n\t\/\/ remove if no disadvantages seem necessary?\n\t\/\/ m_geometry->dirtyBound();\n\tm_drawArrays->setCount(m_coordinates->size());\n}\n\nvoid FenceView::removeAllFences()\n{\n\tm_node->removeChild(m_geode);\n\tfor (auto radarFenceBox : m_radarFenceBoxes)\n\t{\n\t\tm_radarElementsGroup->removeChild(radarFenceBox);\n\t}\n\tm_radarFenceBoxes.clear();\n\tinitializeFence();\n}\n\nvoid FenceView::enforceFencePartsLimit()\n{\n\tint maxFenceParts = m_fenceController->getFenceLimit();\n\n\t\/\/ the quad strip contains two more vertices for the beginning of the fence\n\tint currentFenceParts = (m_coordinates->size() - 2) \/ 2;\n\n\tif (maxFenceParts != 0 && currentFenceParts > maxFenceParts)\n\t{\n\t\tfor (int i = 0; i < (currentFenceParts - maxFenceParts); i++)\n\t\t{\n\t\t\tm_coordinates->erase(m_coordinates->begin(), m_coordinates->begin() + 2);\n\t\t\tm_relativeHeights->erase(m_relativeHeights->begin(), m_relativeHeights->begin() + 2);\n\t\t}\n\t}\n\t\/\/ radar fence boxes\n\tif (maxFenceParts != 0 && m_radarFenceBoxes.size() > maxFenceParts \/ FENCE_TO_MINIMAP_PARTS_RATIO)\n\t{\n\t\tfor (int i = 0; i < (m_radarFenceBoxes.size() - maxFenceParts \/ FENCE_TO_MINIMAP_PARTS_RATIO); i++)\n\t\t{\n\t\t\tm_radarElementsGroup->removeChild(m_radarFenceBoxes.front());\n\t\t\tm_radarFenceBoxes.pop_front();\n\t\t}\n\t}\n}\n\nvoid FenceView::showFencesInRadarForPlayer(const int id)\n{\n\tosg::Node::NodeMask currentMask = m_radarElementsGroup->getNodeMask();\n\tosg::Node::NodeMask newMask = currentMask | CAMERA_MASK_PLAYER[id];\n\tm_radarElementsGroup->setNodeMask(newMask);\n}\n\nvoid FenceView::hideFencesInRadarForPlayer(const int id)\n{\n\tosg::Node::NodeMask currentMask = m_radarElementsGroup->getNodeMask();\n\tosg::Node::NodeMask newMask = currentMask & ~ CAMERA_MASK_PLAYER[id];\n\tm_radarElementsGroup->setNodeMask(newMask);\n}<commit_msg>fix for disappearing network fence<commit_after>#include \"fenceview.h\"\n\/\/ OSG\n#include <osg\/ShapeDrawable>\n#include <osg\/Geode>\n#include <osg\/Group>\n#include <osg\/Vec4>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/ref_ptr>\n\/\/ troen\n#include \"..\/constants.h\"\n#include \"shaders.h\"\n#include \"..\/model\/fencemodel.h\"\n#include \"..\/controller\/fencecontroller.h\"\n\nusing namespace troen;\n\nFenceView::FenceView(FenceController* fenceController, osg::Vec3 color, std::shared_ptr<AbstractModel>& model) :\nAbstractView(),\nm_model(std::static_pointer_cast<FenceModel>(model)),\nm_playerColor(color),\nm_fenceController(fenceController)\n{\n\tinitializeFence();\n\tinitializeShader();\n}\n\nvoid FenceView::initializeFence()\n{\n\tm_fenceHeight = FENCE_HEIGHT_VIEW;\n\n\tm_coordinates = new osg::Vec3Array();\n\tm_coordinates->setDataVariance(osg::Object::DYNAMIC);\n\n\tm_relativeHeights = new osg::FloatArray();\n\tm_relativeHeights->setDataVariance(osg::Object::DYNAMIC);\n\n\t\/\/ this value could need adaption; will avoid time-intensive array resizing\n\tm_coordinates->reserveArray(10000);\n\tm_relativeHeights->reserveArray(10000);\n\n\tm_geometry = new osg::Geometry();\n\tm_geometry->setVertexArray(m_coordinates);\n\n\t\/\/ set the relative height between 0 and 1 as an additional vertex attribute\n\tm_geometry->setVertexAttribArray(5, m_relativeHeights);\n\tm_geometry->setVertexAttribBinding(5, osg::Geometry::BIND_PER_VERTEX);\n\n\t\/\/ seems to be important so that we won't crash after 683 fence parts\n\tm_geometry->setUseDisplayList(false);\n\n\t\/\/ use the shared normal array.\n\t\/\/ polyGeom->setNormalArray(shared_normals.get(), osg::Array::BIND_OVERALL);\n\n\tm_drawArrays = new osg::DrawArrays(osg::PrimitiveSet::QUAD_STRIP, 0, 0);\n\tm_geometry->addPrimitiveSet(m_drawArrays);\n\n\tm_geode = new osg::Geode();\n\tm_geode->addDrawable(m_geometry);\n\n\tm_node->addChild(m_geode);\n\tm_node->getOrCreateStateSet()->setMode(GL_CULL_FACE, osg::StateAttribute::OFF);\n\tm_node->setName(\"fenceGroup\");\n\n\tm_radarElementsGroup = new osg::Group();\n\tm_radarElementsGroup->setNodeMask(CAMERA_MASK_NONE);\n\tm_node->addChild(m_radarElementsGroup);\n}\n\nvoid FenceView::updateFadeOutFactor(float fadeOutFactor)\n{\n\tm_fadeOutFactorUniform->set(fadeOutFactor);\n}\n\nvoid FenceView::updateFenceGap(osg::Vec3 lastPosition, osg::Vec3 position)\n{\n\tif (m_coordinates->size() > 1) {\n\t\tm_coordinates->at(m_coordinates->size() - 2) = osg::Vec3(position.x(), position.y(), position.z());\n\t\tm_coordinates->at(m_coordinates->size() - 1) = osg::Vec3(position.x(), position.y(), position.z() + m_fenceHeight);\n\t\tm_relativeHeights->at(m_relativeHeights->size() - 2) = 0.f;\n\t\tm_relativeHeights->at(m_relativeHeights->size() - 1) = 1.f;\n\t}\n}\n\nvoid FenceView::initializeShader()\n{\n\tosg::ref_ptr<osg::StateSet> NodeState = m_node->getOrCreateStateSet();\n\t\n\tosg::Uniform* fenceColorU = new osg::Uniform(\"fenceColor\", m_playerColor);\n\tNodeState->addUniform(fenceColorU);\n\n\tosg::Uniform* modelIDU = new osg::Uniform(\"modelID\", GLOW);\n\tNodeState->addUniform(modelIDU);\n\n\tm_fadeOutFactorUniform = new osg::Uniform(\"fadeOutFactor\", 1.f);\n\tNodeState->addUniform(m_fadeOutFactorUniform);\n\n\tNodeState->setMode(GL_BLEND, osg::StateAttribute::ON);\n\tNodeState->setRenderingHint(osg::StateSet::TRANSPARENT_BIN);\n\tNodeState->setAttributeAndModes(shaders::m_allShaderPrograms[shaders::FENCE], osg::StateAttribute::ON);\n\n\tshaders::m_allShaderPrograms[shaders::FENCE]->addBindAttribLocation(\"a_relHeight\", 5);\n}\n\nvoid FenceView::addFencePart(osg::Vec3 lastPosition, osg::Vec3 currentPosition)\n{\n\n\tif (m_coordinates->size() == 0)\n\t{\n\t\tm_coordinates->push_back(lastPosition);\n\t\tm_coordinates->push_back(osg::Vec3(lastPosition.x(), lastPosition.y(), lastPosition.z() + m_fenceHeight));\n\t\tm_relativeHeights->push_back(0.f);\n\t\tm_relativeHeights->push_back(1.f);\n\t}\n\n\t\/\/ game fence part\n\tm_coordinates->push_back(currentPosition);\n\tm_coordinates->push_back(osg::Vec3(currentPosition.x(), currentPosition.y(), currentPosition.z() + m_fenceHeight));\n\tm_relativeHeights->push_back(0.f);\n\tm_relativeHeights->push_back(1.f);\n\n\n\tint currentFenceParts = (m_coordinates->size() - 2) \/ 2;\n\n\t\/\/ radar fence part\n\tif (currentFenceParts % FENCE_TO_MINIMAP_PARTS_RATIO == 0)\n\t{\n\t\tosg::ref_ptr<osg::Box> box\n\t\t\t= new osg::Box(osg::Vec3(0, 0, 0), 60, 60, 60);\n\t\tosg::ref_ptr<osg::ShapeDrawable> mark_shape = new osg::ShapeDrawable(box);\n\t\tmark_shape->setColor(osg::Vec4f(m_playerColor, 1));\n\t\tosg::ref_ptr<osg::Geode> mark_node = new osg::Geode;\n\t\tmark_node->addDrawable(mark_shape.get());\n\t\t\/\/mark_node->getOrCreateStateSet()->setRenderingHint(osg::StateSet::TRANSPARENT_BIN);\n\n\t\t\/\/ place objects in world space\n\t\tosg::Matrixd initialTransform;\n\t\t\/\/initialTransform.makeRotate(rotationQuatXY);\n\t\tinitialTransform *= initialTransform.translate((currentPosition + lastPosition) \/ 2);\n\n\t\tosg::ref_ptr<osg::MatrixTransform> matrixTransformRadar = new osg::MatrixTransform(initialTransform);\n\t\tmatrixTransformRadar->addChild(mark_node);\n\n\t\tm_radarElementsGroup->addChild(matrixTransformRadar);\n\t\tm_radarFenceBoxes.push_back(matrixTransformRadar);\n\t}\n\n\t\/\/ limit\n\tenforceFencePartsLimit();\n\n\t\/\/necessary for network fences, because of unpredictable timings\n\tm_geometry->dirtyBound();\n\tm_drawArrays->setCount(m_coordinates->size());\n}\n\nvoid FenceView::removeAllFences()\n{\n\tm_node->removeChild(m_geode);\n\tfor (auto radarFenceBox : m_radarFenceBoxes)\n\t{\n\t\tm_radarElementsGroup->removeChild(radarFenceBox);\n\t}\n\tm_radarFenceBoxes.clear();\n\tinitializeFence();\n}\n\nvoid FenceView::enforceFencePartsLimit()\n{\n\tint maxFenceParts = m_fenceController->getFenceLimit();\n\n\t\/\/ the quad strip contains two more vertices for the beginning of the fence\n\tint currentFenceParts = (m_coordinates->size() - 2) \/ 2;\n\n\tif (maxFenceParts != 0 && currentFenceParts > maxFenceParts)\n\t{\n\t\tfor (int i = 0; i < (currentFenceParts - maxFenceParts); i++)\n\t\t{\n\t\t\tm_coordinates->erase(m_coordinates->begin(), m_coordinates->begin() + 2);\n\t\t\tm_relativeHeights->erase(m_relativeHeights->begin(), m_relativeHeights->begin() + 2);\n\t\t}\n\t}\n\t\/\/ radar fence boxes\n\tif (maxFenceParts != 0 && m_radarFenceBoxes.size() > maxFenceParts \/ FENCE_TO_MINIMAP_PARTS_RATIO)\n\t{\n\t\tfor (int i = 0; i < (m_radarFenceBoxes.size() - maxFenceParts \/ FENCE_TO_MINIMAP_PARTS_RATIO); i++)\n\t\t{\n\t\t\tm_radarElementsGroup->removeChild(m_radarFenceBoxes.front());\n\t\t\tm_radarFenceBoxes.pop_front();\n\t\t}\n\t}\n}\n\nvoid FenceView::showFencesInRadarForPlayer(const int id)\n{\n\tosg::Node::NodeMask currentMask = m_radarElementsGroup->getNodeMask();\n\tosg::Node::NodeMask newMask = currentMask | CAMERA_MASK_PLAYER[id];\n\tm_radarElementsGroup->setNodeMask(newMask);\n}\n\nvoid FenceView::hideFencesInRadarForPlayer(const int id)\n{\n\tosg::Node::NodeMask currentMask = m_radarElementsGroup->getNodeMask();\n\tosg::Node::NodeMask newMask = currentMask & ~ CAMERA_MASK_PLAYER[id];\n\tm_radarElementsGroup->setNodeMask(newMask);\n}<|endoftext|>"} {"text":"<commit_before>#include <shiny\/voodoo\/context.hpp>\r\n#include <shiny\/voodoo\/prime_thread.hpp>\r\n\r\n\/\/======================================================================\r\n\/\/ context creation\r\n\/\/======================================================================\r\nauto shiny::create_context(fooey::window_ptr const& window, uint32_t width, uint32_t height) -> shiny::context_ptr\r\n{\r\n\treturn context_ptr(new context_t(window, width, height));\r\n}\r\n\r\nusing shiny::context_t;\r\ncontext_t::context_t(fooey::window_ptr const& window, uint32_t width, uint32_t height)\r\n\t: window_(window), width_(width), height_(height), fullscreen_()\r\n{\r\n\tif (width_ == 0)\r\n\t\twidth_ = window_->width_in_pixels();\r\n\tif (height_ == 0)\r\n\t\theight_ = window_->height_in_pixels();\r\n\r\n\tATMA_ENSURE_IS(S_OK, voodoo::detail::d3d_device_->QueryInterface(__uuidof(IDXGIDevice1), (void**)&dxgi_device_));\r\n\tATMA_ENSURE_IS(S_OK, dxgi_device_->GetParent(__uuidof(IDXGIAdapter1), (void**)&dxgi_adapter_));\r\n\tATMA_ENSURE_IS(S_OK, dxgi_adapter_->GetParent(__uuidof(IDXGIFactory1), (void**)&dxgi_factory_));\r\n\r\n\tenumerate_backbuffers();\r\n\tcreate_swapchain();\r\n\r\n\tauto cptr = shared_from_this();\r\n\ton_resize_handle_ = window_->on_resize.connect([cptr](atma::event_flow_t& fc, uint32_t width, uint32_t height)\r\n\t{\r\n\t\tvoodoo::prime_thread::enqueue([&cptr, &fc, width, height]\r\n\t\t{\r\n\t\t\tif (!cptr->fullscreen_)\r\n\t\t\t{\r\n\t\t\t\tcptr->width_ = width;\r\n\t\t\t\tcptr->height_ = height;\r\n\t\t\t\tstd::cout << \"resizing to \" << cptr->width_ << \"x\" << cptr->height_ << std::endl;\r\n\t\t\t\tATMA_ENSURE_IS(S_OK, cptr->dxgi_swap_chain_->ResizeBuffers(3, cptr->width_, cptr->height_, DXGI_FORMAT_UNKNOWN, 0));\r\n\t\t\t}\r\n\t\t});\r\n\t});\r\n}\r\n\r\ncontext_t::~context_t()\r\n{\r\n\twindow_->on_resize.disconnect(on_resize_handle_);\r\n}\r\n\r\nauto context_t::enumerate_backbuffers() -> void\r\n{\r\n\tauto format = DXGI_FORMAT_R8G8B8A8_UNORM;\r\n\r\n\tIDXGIOutput* out = nullptr;\r\n\tATMA_ENSURE_IS(S_OK, dxgi_adapter_->EnumOutputs(1, &out));\r\n\r\n\tuint32_t mode_count = 0;\r\n\tATMA_ENSURE_IS(S_OK, out->GetDisplayModeList(format, 0, &mode_count, nullptr));\r\n\t\r\n\tauto modes = std::unique_ptr<DXGI_MODE_DESC[]>(new DXGI_MODE_DESC[mode_count]);\r\n\tATMA_ENSURE_IS(S_OK, out->GetDisplayModeList(format, 0, &mode_count, modes.get()));\r\n\t\r\n\t\/\/ convert dxgi format to shiny's format\r\n\tfor (auto i = modes.get(); i != modes.get() + mode_count; ++i)\r\n\t{\r\n\t\tbackbuffer_display_modes_.push_back({\r\n\t\t\ti->Width, i->Height,\r\n\t\t\ti->RefreshRate.Numerator, i->RefreshRate.Denominator,\r\n\t\t\tdisplay_format_t::r8g8b8a8_unorm\r\n\t\t});\r\n\t}\r\n}\r\n\r\nauto context_t::create_swapchain() -> void\r\n{\r\n\tauto format = closest_fullscreen_backbuffer_mode(width_, height_);\r\n\t\r\n\tauto desc = DXGI_SWAP_CHAIN_DESC{\r\n\t\t\/\/ DXGI_MODE_DESC\r\n\t\t{format.width, format.height, {format.refreshrate_frames, format.refreshrate_period}, DXGI_FORMAT_R8G8B8A8_UNORM_SRGB, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED},\r\n\t\t\/\/ DXGI_SAMPLE_DESC\r\n\t\t{1, 0},\r\n\t\t0, 3, window_->hwnd, TRUE, DXGI_SWAP_EFFECT_DISCARD, 0\r\n\t};\r\n\r\n\tATMA_ENSURE_IS(S_OK, dxgi_factory_->CreateSwapChain(voodoo::detail::d3d_device_, &desc, &dxgi_swap_chain_));\r\n}\r\n\r\n\r\n\r\nauto context_t::toggle_fullscreen() -> void\r\n{\r\n\tfullscreen_ = !fullscreen_;\r\n\r\n\tif (fullscreen_)\r\n\t{\r\n\t\tauto mode = closest_fullscreen_backbuffer_mode(width_, height_);\r\n\t\tauto dxgi_mode = DXGI_MODE_DESC{mode.width, mode.height, {mode.refreshrate_frames, mode.refreshrate_period}, DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED};\r\n\t\t\r\n\t\tstd::cout << \"going fullscreen to \" << mode.width << \"x\" << mode.height << std::endl;\r\n\t\tdxgi_swap_chain_->ResizeTarget(&dxgi_mode);\r\n\t\tdxgi_swap_chain_->SetFullscreenState(TRUE, nullptr);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tstd::cout << \"going windowed to \" << width_ << \"x\" << height_ << std::endl;\r\n\t\tauto dxgi_mode = DXGI_MODE_DESC{width_, height_, {0, 1}, DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED};\r\n\t\tdxgi_swap_chain_->ResizeTarget(&dxgi_mode);\r\n\t\tdxgi_swap_chain_->SetFullscreenState(FALSE, nullptr);\r\n\t\t\/\/window_->on_resize.fire(width_, height_);\r\n\t\t\/\/SendMessage(window_->hwnd, WM_SIZE, 0, ((uint16_t)height_ << 16) | (uint16_t)width_);\r\n\t\tRECT rect;\r\n\t\tGetWindowRect(window_->hwnd, &rect);\r\n\t\tSetWindowPos(window_->hwnd, HWND_TOPMOST, rect.left, rect.top, window_->width_in_pixels(), window_->height_in_pixels(), 0);\r\n\t}\r\n}\r\n\r\nauto context_t::closest_fullscreen_backbuffer_mode(uint32_t width, uint32_t height) -> shiny::display_mode_t\r\n{\r\n\tfor (auto const& x : backbuffer_display_modes_)\r\n\t{\r\n\t\tif (x.width > width && x.height > height)\r\n\t\t\treturn x;\r\n\t}\r\n\r\n\treturn backbuffer_display_modes_.back();\r\n}\r\n\r\nauto shiny::signal_fullscreen_toggle(context_ptr const& context) -> void\r\n{\r\n\tvoodoo::prime_thread::enqueue(std::bind(&context_t::toggle_fullscreen, context));\r\n}\r\n<commit_msg>context things<commit_after>#include <shiny\/voodoo\/context.hpp>\r\n#include <shiny\/voodoo\/prime_thread.hpp>\r\n\r\n\/\/======================================================================\r\n\/\/ context creation\r\n\/\/======================================================================\r\nauto shiny::create_context(fooey::window_ptr const& window, uint32_t width, uint32_t height) -> shiny::context_ptr\r\n{\r\n\treturn context_ptr(new context_t(window, width, height));\r\n}\r\n\r\nusing shiny::context_t;\r\ncontext_t::context_t(fooey::window_ptr const& window, uint32_t width, uint32_t height)\r\n\t: window_(window), width_(width), height_(height), fullscreen_()\r\n{\r\n\tif (width_ == 0)\r\n\t\twidth_ = window_->width_in_pixels();\r\n\tif (height_ == 0)\r\n\t\theight_ = window_->height_in_pixels();\r\n\r\n\tATMA_ENSURE_IS(S_OK, voodoo::detail::d3d_device_->QueryInterface(__uuidof(IDXGIDevice1), (void**)&dxgi_device_));\r\n\tATMA_ENSURE_IS(S_OK, dxgi_device_->GetParent(__uuidof(IDXGIAdapter1), (void**)&dxgi_adapter_));\r\n\tATMA_ENSURE_IS(S_OK, dxgi_adapter_->GetParent(__uuidof(IDXGIFactory1), (void**)&dxgi_factory_));\r\n\r\n\tenumerate_backbuffers();\r\n\tcreate_swapchain();\r\n\r\n\tauto cptr = shared_from_this();\r\n\ton_resize_handle_ = window_->on_resize.connect([cptr](atma::event_flow_t& fc, uint32_t width, uint32_t height)\r\n\t{\r\n\t\tvoodoo::prime_thread::enqueue([&cptr, &fc, width, height]\r\n\t\t{\r\n\t\t\tif (!cptr->fullscreen_)\r\n\t\t\t{\r\n\t\t\t\tcptr->width_ = width;\r\n\t\t\t\tcptr->height_ = height;\r\n\t\t\t\tstd::cout << \"resizing to \" << cptr->width_ << \"x\" << cptr->height_ << std::endl;\r\n\t\t\t\tATMA_ENSURE_IS(S_OK, cptr->dxgi_swap_chain_->ResizeBuffers(3, cptr->width_, cptr->height_, DXGI_FORMAT_UNKNOWN, 0));\r\n\t\t\t}\r\n\t\t});\r\n\t});\r\n}\r\n\r\ncontext_t::~context_t()\r\n{\r\n\twindow_->on_resize.disconnect(on_resize_handle_);\r\n}\r\n\r\nauto context_t::enumerate_backbuffers() -> void\r\n{\r\n\tauto format = DXGI_FORMAT_R8G8B8A8_UNORM;\r\n\r\n\tIDXGIOutput* out = nullptr;\r\n\tATMA_ENSURE_IS(S_OK, dxgi_adapter_->EnumOutputs(1, &out));\r\n\r\n\tuint32_t mode_count = 0;\r\n\tATMA_ENSURE_IS(S_OK, out->GetDisplayModeList(format, 0, &mode_count, nullptr));\r\n\t\r\n\tauto modes = std::unique_ptr<DXGI_MODE_DESC[]>(new DXGI_MODE_DESC[mode_count]);\r\n\tATMA_ENSURE_IS(S_OK, out->GetDisplayModeList(format, 0, &mode_count, modes.get()));\r\n\t\r\n\t\/\/ convert dxgi format to shiny's format\r\n\tfor (auto i = modes.get(); i != modes.get() + mode_count; ++i)\r\n\t{\r\n\t\tbackbuffer_display_modes_.push_back({\r\n\t\t\ti->Width, i->Height,\r\n\t\t\ti->RefreshRate.Numerator, i->RefreshRate.Denominator,\r\n\t\t\tdisplay_format_t::r8g8b8a8_unorm\r\n\t\t});\r\n\t}\r\n}\r\n\r\nauto context_t::create_swapchain() -> void\r\n{\r\n\tauto format = closest_fullscreen_backbuffer_mode(width_, height_);\r\n\t\r\n\tauto desc = DXGI_SWAP_CHAIN_DESC{\r\n\t\t\/\/ DXGI_MODE_DESC\r\n\t\t{format.width, format.height, {format.refreshrate_frames, format.refreshrate_period}, DXGI_FORMAT_R8G8B8A8_UNORM_SRGB, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED},\r\n\t\t\/\/ DXGI_SAMPLE_DESC\r\n\t\t{1, 0},\r\n\t\t0, 3, window_->hwnd, TRUE, DXGI_SWAP_EFFECT_DISCARD, 0\r\n\t};\r\n\r\n\tATMA_ENSURE_IS(S_OK, dxgi_factory_->CreateSwapChain(voodoo::detail::d3d_device_, &desc, &dxgi_swap_chain_));\r\n}\r\n\r\n\r\n\r\nauto context_t::toggle_fullscreen() -> void\r\n{\r\n\tfullscreen_ = !fullscreen_;\r\n\r\n\tif (fullscreen_)\r\n\t{\r\n\t\tauto mode = closest_fullscreen_backbuffer_mode(width_, height_);\r\n\t\tauto dxgi_mode = DXGI_MODE_DESC{mode.width, mode.height, {mode.refreshrate_frames, mode.refreshrate_period}, DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED};\r\n\t\t\r\n\t\tstd::cout << \"SHINY: going fullscreen to \" << mode.width << \"x\" << mode.height << std::endl;\r\n\t\tdxgi_swap_chain_->ResizeTarget(&dxgi_mode);\r\n\t\tdxgi_swap_chain_->SetFullscreenState(TRUE, nullptr);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tstd::cout << \"SHINY: going windowed to \" << width_ << \"x\" << height_ << std::endl;\r\n\t\tauto dxgi_mode = DXGI_MODE_DESC{width_, height_, {0, 1}, DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_MODE_SCANLINE_ORDER_PROGRESSIVE, DXGI_MODE_SCALING_UNSPECIFIED};\r\n\t\tdxgi_swap_chain_->ResizeTarget(&dxgi_mode);\r\n\t\tdxgi_swap_chain_->SetFullscreenState(FALSE, nullptr);\r\n\r\n\t\t\/\/fooey::signal_window_resize(window_, width_, height_);\r\n\t\t\r\n\t\tRECT rect;\r\n\t\tGetWindowRect(window_->hwnd, &rect);\r\n\t\tSetWindowPos(window_->hwnd, HWND_TOPMOST, rect.left, rect.top, window_->width_in_pixels(), window_->height_in_pixels(), 0);\r\n\t}\r\n}\r\n\r\nauto context_t::closest_fullscreen_backbuffer_mode(uint32_t width, uint32_t height) -> shiny::display_mode_t\r\n{\r\n\tfor (auto const& x : backbuffer_display_modes_)\r\n\t{\r\n\t\tif (x.width > width && x.height > height)\r\n\t\t\treturn x;\r\n\t}\r\n\r\n\treturn backbuffer_display_modes_.back();\r\n}\r\n\r\nauto shiny::signal_fullscreen_toggle(context_ptr const& context) -> void\r\n{\r\n\tvoodoo::prime_thread::enqueue(std::bind(&context_t::toggle_fullscreen, context));\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <osgUtil\/CubeMapGenerator>\n\n#include <memory>\n#ifndef __sgi\n#include <cstdlib>\n#else\n#include <stdlib.h>\n#endif\n\n\nusing namespace osgUtil;\n\nCubeMapGenerator::CubeMapGenerator(int texture_size)\n:\tosg::Referenced(),\n\ttexture_size_(texture_size)\n{\n\tfor (int i=0; i<6; ++i) {\t\t\t\t\n\t\tosg::ref_ptr<osg::Image> image = osgNew osg::Image;\n\t\t\/\/std::auto_ptr<unsigned char> data(static_cast<unsigned char *>(std::malloc(texture_size*texture_size*4)));\n\t\tstd::auto_ptr<unsigned char> data(new unsigned char[(texture_size*texture_size*4)]);\n\n\t\timage->setImage(texture_size, texture_size, 1, 4, GL_RGBA, GL_UNSIGNED_BYTE, data.get());\n\t\tdata.release();\n\t\timages_.push_back(image);\n\t}\n}\n\nCubeMapGenerator::CubeMapGenerator(const CubeMapGenerator ©, const osg::CopyOp ©op)\n:\tosg::Referenced(copy),\n\ttexture_size_(copy.texture_size_)\n{\n\tImage_list::const_iterator i;\n\tfor (i=copy.images_.begin(); i!=copy.images_.end(); ++i) {\n\t\timages_.push_back(static_cast<osg::Image *>(copyop(i->get())));\n\t}\n}\n\nvoid CubeMapGenerator::generateMap(bool use_osg_system)\n{\n\tconst float duv = 2.0f\/(texture_size_-1);\n\t\n\tfloat v = 1;\n\tfor (int i=0; i<texture_size_; ++i) {\n\t\tfloat u = 1;\n\t\tfor (int j=0; j<texture_size_; ++j) {\t\t\t\n\t\t\tif (use_osg_system) {\n\t\t\t\tset_pixel(0, j, i, compute_color(osg::Vec3(1, -u, v)));\n\t\t\t\tset_pixel(1, j, i, compute_color(osg::Vec3(-1, u, v)));\n\t\t\t\tset_pixel(2, j, i, compute_color(osg::Vec3(-u, v, 1)));\n\t\t\t\tset_pixel(3, j, i, compute_color(osg::Vec3(-u, -v, -1)));\n\t\t\t\tset_pixel(4, j, i, compute_color(osg::Vec3(-u, -1, v)));\n\t\t\t\tset_pixel(5, j, i, compute_color(osg::Vec3(u, 1, v)));\n\t\t\t} else {\n\t\t\t\tset_pixel(0, j, i, compute_color(osg::Vec3(1, v, -u)));\n\t\t\t\tset_pixel(1, j, i, compute_color(osg::Vec3(-1, v, u)));\n\t\t\t\tset_pixel(2, j, i, compute_color(osg::Vec3(-u, 1, v)));\n\t\t\t\tset_pixel(3, j, i, compute_color(osg::Vec3(-u, -1, -v)));\n\t\t\t\tset_pixel(4, j, i, compute_color(osg::Vec3(-u, v, -1)));\n\t\t\t\tset_pixel(5, j, i, compute_color(osg::Vec3(u, v, 1)));\n\t\t\t}\n\t\t\tu -= duv;\n\t\t}\n\t\tv -= duv;\n\t}\n}\n<commit_msg>Fixed memory allocation.<commit_after>#include <osgUtil\/CubeMapGenerator>\n#include <stdlib.h>\n\nusing namespace osgUtil;\n\nCubeMapGenerator::CubeMapGenerator(int texture_size)\n: osg::Referenced(),\n texture_size_(texture_size)\n{\n for (int i=0; i<6; ++i)\n { \n osg::ref_ptr<osg::Image> image = osgNew osg::Image;\n unsigned char* data = (static_cast<unsigned char *>(malloc(texture_size*texture_size*4)));\n image->setImage(texture_size, texture_size, 1, 4, GL_RGBA, GL_UNSIGNED_BYTE, data);\n images_.push_back(image);\n }\n}\n\nCubeMapGenerator::CubeMapGenerator(const CubeMapGenerator ©, const osg::CopyOp ©op)\n: osg::Referenced(copy),\n texture_size_(copy.texture_size_)\n{\n Image_list::const_iterator i;\n for (i=copy.images_.begin(); i!=copy.images_.end(); ++i)\n {\n images_.push_back(static_cast<osg::Image *>(copyop(i->get())));\n }\n}\n\nvoid CubeMapGenerator::generateMap(bool use_osg_system)\n{\n const float duv = 2.0f\/(texture_size_-1);\n \n float v = 1;\n for (int i=0; i<texture_size_; ++i) {\n float u = 1;\n for (int j=0; j<texture_size_; ++j) { \n if (use_osg_system) {\n set_pixel(0, j, i, compute_color(osg::Vec3(1, -u, v)));\n set_pixel(1, j, i, compute_color(osg::Vec3(-1, u, v)));\n set_pixel(2, j, i, compute_color(osg::Vec3(-u, v, 1)));\n set_pixel(3, j, i, compute_color(osg::Vec3(-u, -v, -1)));\n set_pixel(4, j, i, compute_color(osg::Vec3(-u, -1, v)));\n set_pixel(5, j, i, compute_color(osg::Vec3(u, 1, v)));\n } else {\n set_pixel(0, j, i, compute_color(osg::Vec3(1, v, -u)));\n set_pixel(1, j, i, compute_color(osg::Vec3(-1, v, u)));\n set_pixel(2, j, i, compute_color(osg::Vec3(-u, 1, v)));\n set_pixel(3, j, i, compute_color(osg::Vec3(-u, -1, -v)));\n set_pixel(4, j, i, compute_color(osg::Vec3(-u, v, -1)));\n set_pixel(5, j, i, compute_color(osg::Vec3(u, v, 1)));\n }\n u -= duv;\n }\n v -= duv;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ ***************************************************************************\n\/\/\n\/\/ Generated automatically by genwrapper.\n\/\/ Please DO NOT EDIT this file!\n\/\/\n\/\/ ***************************************************************************\n\n#include <osgIntrospection\/ReflectionMacros>\n#include <osgIntrospection\/TypedMethodInfo>\n#include <osgIntrospection\/Attributes>\n\n#include <osg\/CopyOp>\n#include <osg\/Object>\n#include <osg\/State>\n#include <osg\/StateAttribute>\n#include <osg\/StateSet>\n#include <osg\/Texture>\n#include <osg\/Vec2>\n#include <osgText\/Font>\n\n\/\/ Must undefine IN and OUT macros defined in Windows headers\n#ifdef IN\n#undef IN\n#endif\n#ifdef OUT\n#undef OUT\n#endif\n\nBEGIN_OBJECT_REFLECTOR(osgText::Font)\n\tI_BaseType(osg::Object);\n\tI_ConstructorWithDefaults1(IN, osgText::Font::FontImplementation *, implementation, 0);\n\tI_Method0(osg::Object *, cloneType);\n\tI_Method1(osg::Object *, clone, IN, const osg::CopyOp &, x);\n\tI_Method1(bool, isSameKindAs, IN, const osg::Object *, obj);\n\tI_Method0(const char *, className);\n\tI_Method0(const char *, libraryName);\n\tI_Method0(std::string, getFileName);\n\tI_Method2(void, setFontResolution, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method0(unsigned int, getFontWidth);\n\tI_Method0(unsigned int, getFontHeight);\n\tI_Method3(osg::Vec2, getKerning, IN, unsigned int, leftcharcode, IN, unsigned int, rightcharcode, IN, osgText::KerningType, kerningType);\n\tI_Method1(osgText::Font::Glyph *, getGlyph, IN, unsigned int, charcode);\n\tI_Method0(bool, hasVertical);\n\tI_Method1(void, setGlyphImageMargin, IN, unsigned int, margin);\n\tI_Method0(unsigned int, getGlyphImageMargin);\n\tI_Method2(void, setTextureSizeHint, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method0(unsigned int, getTextureWidthHint);\n\tI_Method0(unsigned int, getTextureHeightHint);\n\tI_Method1(void, setMinFilterHint, IN, osg::Texture::FilterMode, mode);\n\tI_Method0(osg::Texture::FilterMode, getMinFilterHint);\n\tI_Method1(void, setMagFilterHint, IN, osg::Texture::FilterMode, mode);\n\tI_Method0(osg::Texture::FilterMode, getMagFilterHint);\n\tI_Method1(void, setImplementation, IN, osgText::Font::FontImplementation *, implementation);\n\tI_Method0(osgText::Font::FontImplementation *, getImplementation);\n\tI_Method0(const osgText::Font::FontImplementation *, getImplementation);\n\tI_MethodWithDefaults1(void, releaseGLObjects, IN, osg::State *, state, 0);\n\tI_ReadOnlyProperty(std::string, FileName);\n\tI_ReadOnlyProperty(unsigned int, FontHeight);\n\tI_ReadOnlyProperty(unsigned int, FontWidth);\n\tI_Property(unsigned int, GlyphImageMargin);\n\tI_Property(osgText::Font::FontImplementation *, Implementation);\n\tI_Property(osg::Texture::FilterMode, MagFilterHint);\n\tI_Property(osg::Texture::FilterMode, MinFilterHint);\n\tI_ReadOnlyProperty(unsigned int, TextureHeightHint);\n\tI_ReadOnlyProperty(unsigned int, TextureWidthHint);\nEND_REFLECTOR\n\nBEGIN_ABSTRACT_OBJECT_REFLECTOR(osgText::Font::FontImplementation)\n\tI_BaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_Method0(std::string, getFileName);\n\tI_Method2(void, setFontResolution, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method1(osgText::Font::Glyph *, getGlyph, IN, unsigned int, charcode);\n\tI_Method3(osg::Vec2, getKerning, IN, unsigned int, leftcharcode, IN, unsigned int, rightcharcode, IN, osgText::KerningType, kerningType);\n\tI_Method0(bool, hasVertical);\n\tI_Method1(void, setFontWidth, IN, unsigned int, width);\n\tI_Method1(void, setFontHeight, IN, unsigned int, height);\n\tI_Method4(void, addGlyph, IN, unsigned int, width, IN, unsigned int, height, IN, unsigned int, charcode, IN, osgText::Font::Glyph *, glyph);\n\tI_ReadOnlyProperty(std::string, FileName);\n\tI_WriteOnlyProperty(unsigned int, FontHeight);\n\tI_WriteOnlyProperty(unsigned int, FontWidth);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osgText::Font::Glyph)\n\tI_BaseType(osg::Image);\n\tI_Constructor0();\n\tI_Method0(unsigned int, getGlyphCode);\n\tI_Method1(void, setHorizontalBearing, IN, const osg::Vec2 &, bearing);\n\tI_Method0(const osg::Vec2 &, getHorizontalBearing);\n\tI_Method1(void, setHorizontalAdvance, IN, float, advance);\n\tI_Method0(float, getHorizontalAdvance);\n\tI_Method1(void, setVerticalBearing, IN, const osg::Vec2 &, bearing);\n\tI_Method0(const osg::Vec2 &, getVerticalBearing);\n\tI_Method1(void, setVerticalAdvance, IN, float, advance);\n\tI_Method0(float, getVerticalAdvance);\n\tI_Method1(void, setTexture, IN, osgText::Font::GlyphTexture *, texture);\n\tI_Method0(osgText::Font::GlyphTexture *, getTexture);\n\tI_Method0(const osgText::Font::GlyphTexture *, getTexture);\n\tI_Method0(osg::StateSet *, getStateSet);\n\tI_Method0(const osg::StateSet *, getStateSet);\n\tI_Method2(void, setTexturePosition, IN, int, posX, IN, int, posY);\n\tI_Method0(int, getTexturePositionX);\n\tI_Method0(int, getTexturePositionY);\n\tI_Method1(void, setMinTexCoord, IN, const osg::Vec2 &, coord);\n\tI_Method0(const osg::Vec2 &, getMinTexCoord);\n\tI_Method1(void, setMaxTexCoord, IN, const osg::Vec2 &, coord);\n\tI_Method0(const osg::Vec2 &, getMaxTexCoord);\n\tI_Method0(void, subload);\n\tI_Method1(void, draw, IN, osg::State &, state);\n\tI_ReadOnlyProperty(unsigned int, GlyphCode);\n\tI_Property(float, HorizontalAdvance);\n\tI_Property(const osg::Vec2 &, HorizontalBearing);\n\tI_Property(const osg::Vec2 &, MaxTexCoord);\n\tI_Property(const osg::Vec2 &, MinTexCoord);\n\tI_ReadOnlyProperty(osg::StateSet *, StateSet);\n\tI_Property(osgText::Font::GlyphTexture *, Texture);\n\tI_ReadOnlyProperty(int, TexturePositionX);\n\tI_ReadOnlyProperty(int, TexturePositionY);\n\tI_Property(float, VerticalAdvance);\n\tI_Property(const osg::Vec2 &, VerticalBearing);\nEND_REFLECTOR\n\nBEGIN_ABSTRACT_OBJECT_REFLECTOR(osgText::Font::GlyphTexture)\n\tI_BaseType(osg::Texture2D);\n\tI_Constructor0();\n\tI_Method0(const char *, className);\n\tI_Method1(int, compare, IN, const osg::StateAttribute &, rhs);\n\tI_Method1(void, setStateSet, IN, osg::StateSet *, stateset);\n\tI_Method0(osg::StateSet *, getStateSet);\n\tI_Method0(const osg::StateSet *, getStateSet);\n\tI_Method1(void, setGlyphImageMargin, IN, unsigned int, margin);\n\tI_Method0(unsigned int, getGlyphImageMargin);\n\tI_Method3(bool, getSpaceForGlyph, IN, osgText::Font::Glyph *, glyph, IN, int &, posX, IN, int &, posY);\n\tI_Method3(void, addGlyph, IN, osgText::Font::Glyph *, glyph, IN, int, posX, IN, int, posY);\n\tI_Method1(void, apply, IN, osg::State &, state);\n\tI_Property(unsigned int, GlyphImageMargin);\n\tI_Property(osg::StateSet *, StateSet);\nEND_REFLECTOR\n\nBEGIN_ENUM_REFLECTOR(osgText::KerningType)\n\tI_EnumLabel(osgText::KERNING_DEFAULT);\n\tI_EnumLabel(osgText::KERNING_UNFITTED);\n\tI_EnumLabel(osgText::KERNING_NONE);\nEND_REFLECTOR\n\n<commit_msg>Updated wrappers.<commit_after>\/\/ ***************************************************************************\n\/\/\n\/\/ Generated automatically by genwrapper.\n\/\/ Please DO NOT EDIT this file!\n\/\/\n\/\/ ***************************************************************************\n\n#include <osgIntrospection\/ReflectionMacros>\n#include <osgIntrospection\/TypedMethodInfo>\n#include <osgIntrospection\/Attributes>\n\n#include <osg\/CopyOp>\n#include <osg\/Object>\n#include <osg\/State>\n#include <osg\/StateAttribute>\n#include <osg\/StateSet>\n#include <osg\/Texture>\n#include <osg\/Vec2>\n#include <osgText\/Font>\n\n\/\/ Must undefine IN and OUT macros defined in Windows headers\n#ifdef IN\n#undef IN\n#endif\n#ifdef OUT\n#undef OUT\n#endif\n\nBEGIN_OBJECT_REFLECTOR(osgText::Font)\n\tI_BaseType(osg::Object);\n\tI_ConstructorWithDefaults1(IN, osgText::Font::FontImplementation *, implementation, 0);\n\tI_Method0(osg::Object *, cloneType);\n\tI_Method1(osg::Object *, clone, IN, const osg::CopyOp &, x);\n\tI_Method1(bool, isSameKindAs, IN, const osg::Object *, obj);\n\tI_Method0(const char *, className);\n\tI_Method0(const char *, libraryName);\n\tI_Method0(std::string, getFileName);\n\tI_Method1(void, setStateSet, IN, osg::StateSet *, stateset);\n\tI_Method0(osg::StateSet *, getStateSet);\n\tI_Method0(const osg::StateSet *, getStateSet);\n\tI_Method2(void, setFontResolution, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method0(unsigned int, getFontWidth);\n\tI_Method0(unsigned int, getFontHeight);\n\tI_Method3(osg::Vec2, getKerning, IN, unsigned int, leftcharcode, IN, unsigned int, rightcharcode, IN, osgText::KerningType, kerningType);\n\tI_Method1(osgText::Font::Glyph *, getGlyph, IN, unsigned int, charcode);\n\tI_Method0(bool, hasVertical);\n\tI_Method1(void, setGlyphImageMargin, IN, unsigned int, margin);\n\tI_Method0(unsigned int, getGlyphImageMargin);\n\tI_Method2(void, setTextureSizeHint, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method0(unsigned int, getTextureWidthHint);\n\tI_Method0(unsigned int, getTextureHeightHint);\n\tI_Method1(void, setMinFilterHint, IN, osg::Texture::FilterMode, mode);\n\tI_Method0(osg::Texture::FilterMode, getMinFilterHint);\n\tI_Method1(void, setMagFilterHint, IN, osg::Texture::FilterMode, mode);\n\tI_Method0(osg::Texture::FilterMode, getMagFilterHint);\n\tI_Method1(void, setImplementation, IN, osgText::Font::FontImplementation *, implementation);\n\tI_Method0(osgText::Font::FontImplementation *, getImplementation);\n\tI_Method0(const osgText::Font::FontImplementation *, getImplementation);\n\tI_MethodWithDefaults1(void, releaseGLObjects, IN, osg::State *, state, 0);\n\tI_ReadOnlyProperty(std::string, FileName);\n\tI_ReadOnlyProperty(unsigned int, FontHeight);\n\tI_ReadOnlyProperty(unsigned int, FontWidth);\n\tI_Property(unsigned int, GlyphImageMargin);\n\tI_Property(osgText::Font::FontImplementation *, Implementation);\n\tI_Property(osg::Texture::FilterMode, MagFilterHint);\n\tI_Property(osg::Texture::FilterMode, MinFilterHint);\n\tI_Property(osg::StateSet *, StateSet);\n\tI_ReadOnlyProperty(unsigned int, TextureHeightHint);\n\tI_ReadOnlyProperty(unsigned int, TextureWidthHint);\nEND_REFLECTOR\n\nBEGIN_ABSTRACT_OBJECT_REFLECTOR(osgText::Font::FontImplementation)\n\tI_BaseType(osg::Referenced);\n\tI_Constructor0();\n\tI_Method0(std::string, getFileName);\n\tI_Method2(void, setFontResolution, IN, unsigned int, width, IN, unsigned int, height);\n\tI_Method1(osgText::Font::Glyph *, getGlyph, IN, unsigned int, charcode);\n\tI_Method3(osg::Vec2, getKerning, IN, unsigned int, leftcharcode, IN, unsigned int, rightcharcode, IN, osgText::KerningType, kerningType);\n\tI_Method0(bool, hasVertical);\n\tI_Method1(void, setFontWidth, IN, unsigned int, width);\n\tI_Method1(void, setFontHeight, IN, unsigned int, height);\n\tI_Method4(void, addGlyph, IN, unsigned int, width, IN, unsigned int, height, IN, unsigned int, charcode, IN, osgText::Font::Glyph *, glyph);\n\tI_ReadOnlyProperty(std::string, FileName);\n\tI_WriteOnlyProperty(unsigned int, FontHeight);\n\tI_WriteOnlyProperty(unsigned int, FontWidth);\nEND_REFLECTOR\n\nBEGIN_OBJECT_REFLECTOR(osgText::Font::Glyph)\n\tI_BaseType(osg::Image);\n\tI_Constructor0();\n\tI_Method0(unsigned int, getGlyphCode);\n\tI_Method1(void, setHorizontalBearing, IN, const osg::Vec2 &, bearing);\n\tI_Method0(const osg::Vec2 &, getHorizontalBearing);\n\tI_Method1(void, setHorizontalAdvance, IN, float, advance);\n\tI_Method0(float, getHorizontalAdvance);\n\tI_Method1(void, setVerticalBearing, IN, const osg::Vec2 &, bearing);\n\tI_Method0(const osg::Vec2 &, getVerticalBearing);\n\tI_Method1(void, setVerticalAdvance, IN, float, advance);\n\tI_Method0(float, getVerticalAdvance);\n\tI_Method1(void, setTexture, IN, osgText::Font::GlyphTexture *, texture);\n\tI_Method0(osgText::Font::GlyphTexture *, getTexture);\n\tI_Method0(const osgText::Font::GlyphTexture *, getTexture);\n\tI_Method0(osg::StateSet *, getStateSet);\n\tI_Method0(const osg::StateSet *, getStateSet);\n\tI_Method2(void, setTexturePosition, IN, int, posX, IN, int, posY);\n\tI_Method0(int, getTexturePositionX);\n\tI_Method0(int, getTexturePositionY);\n\tI_Method1(void, setMinTexCoord, IN, const osg::Vec2 &, coord);\n\tI_Method0(const osg::Vec2 &, getMinTexCoord);\n\tI_Method1(void, setMaxTexCoord, IN, const osg::Vec2 &, coord);\n\tI_Method0(const osg::Vec2 &, getMaxTexCoord);\n\tI_Method0(void, subload);\n\tI_Method1(void, draw, IN, osg::State &, state);\n\tI_ReadOnlyProperty(unsigned int, GlyphCode);\n\tI_Property(float, HorizontalAdvance);\n\tI_Property(const osg::Vec2 &, HorizontalBearing);\n\tI_Property(const osg::Vec2 &, MaxTexCoord);\n\tI_Property(const osg::Vec2 &, MinTexCoord);\n\tI_ReadOnlyProperty(osg::StateSet *, StateSet);\n\tI_Property(osgText::Font::GlyphTexture *, Texture);\n\tI_ReadOnlyProperty(int, TexturePositionX);\n\tI_ReadOnlyProperty(int, TexturePositionY);\n\tI_Property(float, VerticalAdvance);\n\tI_Property(const osg::Vec2 &, VerticalBearing);\nEND_REFLECTOR\n\nBEGIN_ABSTRACT_OBJECT_REFLECTOR(osgText::Font::GlyphTexture)\n\tI_BaseType(osg::Texture2D);\n\tI_Constructor0();\n\tI_Method0(const char *, className);\n\tI_Method1(int, compare, IN, const osg::StateAttribute &, rhs);\n\tI_Method1(void, setStateSet, IN, osg::StateSet *, stateset);\n\tI_Method0(osg::StateSet *, getStateSet);\n\tI_Method0(const osg::StateSet *, getStateSet);\n\tI_Method1(void, setGlyphImageMargin, IN, unsigned int, margin);\n\tI_Method0(unsigned int, getGlyphImageMargin);\n\tI_Method3(bool, getSpaceForGlyph, IN, osgText::Font::Glyph *, glyph, IN, int &, posX, IN, int &, posY);\n\tI_Method3(void, addGlyph, IN, osgText::Font::Glyph *, glyph, IN, int, posX, IN, int, posY);\n\tI_Method1(void, apply, IN, osg::State &, state);\n\tI_Property(unsigned int, GlyphImageMargin);\n\tI_Property(osg::StateSet *, StateSet);\nEND_REFLECTOR\n\nBEGIN_ENUM_REFLECTOR(osgText::KerningType)\n\tI_EnumLabel(osgText::KERNING_DEFAULT);\n\tI_EnumLabel(osgText::KERNING_UNFITTED);\n\tI_EnumLabel(osgText::KERNING_NONE);\nEND_REFLECTOR\n\n<|endoftext|>"} {"text":"<commit_before>#include \"DoorEntity.h\"\n\nDoorEntity::DoorEntity()\n{\n}\n\n\nDoorEntity::~DoorEntity()\n{\n}\n<commit_msg>ADD function declaration<commit_after>#include \"DoorEntity.h\"\n\nDoorEntity::DoorEntity()\n{\n}\n\n\nDoorEntity::~DoorEntity()\n{\n}\n\nint DoorEntity::Initialize(int entityID, PhysicsComponent * pComp, GraphicsComponent * gComp)\n{\n\tthis->InitializeBase(entityID, pComp, gComp);\n\n\treturn 0;\n}\n\nint DoorEntity::Update(float dT, InputHandler * inputHandler)\n{\n\treturn 0;\n}\n\nint DoorEntity::React(int entityID, EVENT reactEvent)\n{\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"DoorEntity.h\"\n\nDoorEntity::DoorEntity()\n{\n}\n\n\nDoorEntity::~DoorEntity()\n{\n}\n\nint DoorEntity::Initialize(int entityID, PhysicsComponent * pComp, GraphicsComponent * gComp, float minRotation, float maxRotation, float rotateTime)\n{\n\tthis->InitializeBase(entityID, pComp, gComp);\n\n\tthis->m_isOpened = false;\n\tthis->m_minRotation = minRotation;\n\tthis->m_maxRotation = maxRotation;\n\tthis->m_rotateTime = rotateTime;\n\tthis->m_rotatePerSec = (this->m_maxRotation - this->m_minRotation) \/ this->m_rotateTime;\n\tthis->SyncComponents();\n\n\treturn 0;\n}\n\nint DoorEntity::Update(float dT, InputHandler * inputHandler)\n{\n\tif (this->m_isOpened)\n\t{\n\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) < this->m_maxRotation)\n\t\t{\n\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, DirectX::XMVectorGetY(this->m_pComp->PC_rotation) + (this->m_rotatePerSec * dT));\n\t\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) > this->m_maxRotation)\n\t\t\t{\n\t\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, this->m_maxRotation);\n\t\t\t}\n\t\t\tthis->SyncComponents();\n\t\t}\n\t}\n\telse\n\t{\n\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) > this->m_minRotation)\n\t\t{\n\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, DirectX::XMVectorGetY(this->m_pComp->PC_rotation) - (this->m_rotatePerSec * dT));\n\t\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) < this->m_minRotation)\n\t\t\t{\n\t\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, this->m_minRotation);\n\t\t\t}\n\t\t\tthis->SyncComponents();\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}\n\nint DoorEntity::React(int entityID, EVENT reactEvent)\n{\n\tif (reactEvent == EVENT::BUTTON_PRESSED)\n\t{\n\t\tif (!this->m_isOpened)\n\t\t{\n\t\t\tthis->m_isOpened = true;\n\t\t\tthis->m_subject.Notify(this->m_entityID, EVENT::DOOR_OPENED);\n\t\t} \n\t\telse\n\t\t{\n\t\t\tthis->m_isOpened = false;\n\t\t\tthis->m_subject.Notify(this->m_entityID, EVENT::DOOR_CLOSED);\n\t\t}\n\t}\n\telse if (reactEvent == EVENT::WHEEL_0)\n\t{\n\t\tthis->m_isOpened = false;\n\t}\n\telse if (reactEvent == EVENT::WHEEL_100)\n\t{\n\t\tthis->m_isOpened = true;\n\t}\n\n\treturn 0;\n}\n\nbool DoorEntity::SetIsOpened(bool isOpened)\n{\n\tbool lastValue = this->m_isOpened;\n\tthis->m_isOpened = isOpened;\n\treturn lastValue;\n}\n\nbool DoorEntity::GetIsOpened()\n{\n\treturn this->m_isOpened;\n}\n<commit_msg>UPDATE DOOR now utilizes the new events correctly<commit_after>#include \"DoorEntity.h\"\n\nDoorEntity::DoorEntity()\n{\n}\n\n\nDoorEntity::~DoorEntity()\n{\n}\n\nint DoorEntity::Initialize(int entityID, PhysicsComponent * pComp, GraphicsComponent * gComp, float minRotation, float maxRotation, float rotateTime)\n{\n\tthis->InitializeBase(entityID, pComp, gComp);\n\n\tthis->m_isOpened = false;\n\tthis->m_minRotation = minRotation;\n\tthis->m_maxRotation = maxRotation;\n\tthis->m_rotateTime = rotateTime;\n\tthis->m_rotatePerSec = (this->m_maxRotation - this->m_minRotation) \/ this->m_rotateTime;\n\tthis->SyncComponents();\n\n\treturn 0;\n}\n\nint DoorEntity::Update(float dT, InputHandler * inputHandler)\n{\n\tif (this->m_isOpened)\n\t{\n\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) < this->m_maxRotation)\n\t\t{\n\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, DirectX::XMVectorGetY(this->m_pComp->PC_rotation) + (this->m_rotatePerSec * dT));\n\t\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) > this->m_maxRotation)\n\t\t\t{\n\t\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, this->m_maxRotation);\n\t\t\t}\n\t\t\tthis->SyncComponents();\n\t\t}\n\t}\n\telse\n\t{\n\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) > this->m_minRotation)\n\t\t{\n\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, DirectX::XMVectorGetY(this->m_pComp->PC_rotation) - (this->m_rotatePerSec * dT));\n\t\t\tif (DirectX::XMVectorGetY(this->m_pComp->PC_rotation) < this->m_minRotation)\n\t\t\t{\n\t\t\t\tthis->m_pComp->PC_rotation = DirectX::XMVectorSetY(this->m_pComp->PC_rotation, this->m_minRotation);\n\t\t\t}\n\t\t\tthis->SyncComponents();\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}\n\nint DoorEntity::React(int entityID, EVENT reactEvent)\n{\n\t\/\/Kims stuff, \"crazy but elegant\" - Oscar 2017-01-23\n\t\/\/this->m_isOpened = reactEvent == EVENT::BUTTON_ACTIVE;\n\tif (reactEvent == EVENT::BUTTON_ACTIVE)\n\t{\n\t\tthis->m_isOpened = true;\n\t\tthis->m_subject.Notify(this->m_entityID, EVENT::DOOR_OPENED);\n\t}\n\telse if(reactEvent == EVENT::BUTTON_DEACTIVE)\n\t{\n\t\tthis->m_isOpened = false;\n\t\tthis->m_subject.Notify(this->m_entityID, EVENT::DOOR_CLOSED);\n\t}\n\telse if (reactEvent == EVENT::WHEEL_0)\n\t{\n\t\tthis->m_isOpened = false;\n\t}\n\telse if (reactEvent == EVENT::WHEEL_100)\n\t{\n\t\tthis->m_isOpened = true;\n\t}\n\n\treturn 0;\n}\n\nbool DoorEntity::SetIsOpened(bool isOpened)\n{\n\tbool lastValue = this->m_isOpened;\n\tthis->m_isOpened = isOpened;\n\treturn lastValue;\n}\n\nbool DoorEntity::GetIsOpened()\n{\n\treturn this->m_isOpened;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- GraphChecker.cpp - Assert that various graph properties hold -------===\/\/\n\/\/\n\/\/ This pass is used to test DSA with regression tests. It can be used to check\n\/\/ that certain graph properties hold, such as two nodes being disjoint, whether\n\/\/ or not a node is collapsed, etc. These are the command line arguments that\n\/\/ it supports:\n\/\/\n\/\/ --dsgc-dsapass={local,bu,td} - Specify what flavor of graph to check\n\/\/ --dsgc-abort-if-any-collapsed - Abort if any collapsed nodes are found\n\/\/ --dsgc-abort-if-collapsed=<list> - Abort if a node pointed to by an SSA\n\/\/ value with name in <list> is collapsed\n\/\/ --dsgc-check-flags=<list> - Abort if the specified nodes have flags\n\/\/ that are not specified.\n\/\/ --dsgc-abort-if-merged=<list> - Abort if any of the named SSA values\n\/\/ point to the same node.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Value.h\"\n#include <set>\n\nnamespace {\n enum DSPass { local, bu, td };\n cl::opt<DSPass>\n DSPass(\"dsgc-dspass\", cl::Hidden,\n cl::desc(\"Specify which DSA pass the -datastructure-gc pass should use\"),\n cl::values(clEnumVal(local, \"Local pass\"),\n clEnumVal(bu, \"Bottom-up pass\"),\n clEnumVal(td, \"Top-down pass\"), 0), cl::init(local));\n\n cl::opt<bool>\n AbortIfAnyCollapsed(\"dsgc-abort-if-any-collapsed\", cl::Hidden,\n cl::desc(\"Abort if any collapsed nodes are found\"));\n cl::list<std::string>\n AbortIfCollapsed(\"dsgc-abort-if-collapsed\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Abort if any of the named symbols is collapsed\"));\n cl::list<std::string>\n CheckFlags(\"dsgc-check-flags\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Check that flags are specified for nodes\"));\n cl::list<std::string>\n AbortIfMerged(\"dsgc-abort-if-merged\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Abort if any of the named symbols are merged together\"));\n\n struct DSGC : public FunctionPass {\n DSGC();\n bool doFinalization(Module &M);\n bool runOnFunction(Function &F);\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n switch (DSPass) {\n case local: AU.addRequired<LocalDataStructures>(); break;\n case bu: AU.addRequired<BUDataStructures>(); break;\n case td: AU.addRequired<TDDataStructures>(); break;\n }\n AU.setPreservesAll();\n }\n void print(std::ostream &O, const Module *M) const {}\n\n private:\n void verify(const DSGraph &G);\n };\n\n RegisterAnalysis<DSGC> X(\"datastructure-gc\", \"DSA Graph Checking Pass\");\n}\n\nDSGC::DSGC() {\n if (!AbortIfAnyCollapsed && AbortIfCollapsed.empty() &&\n CheckFlags.empty() && AbortIfMerged.empty()) {\n std::cerr << \"The -datastructure-gc is useless if you don't specify any\"\n \" -dsgc-* options. See the -help-hidden output for a list.\\n\";\n abort();\n }\n}\n\n\n\/\/\/ doFinalization - Verify that the globals graph is in good shape...\n\/\/\/\nbool DSGC::doFinalization(Module &M) {\n switch (DSPass) {\n case local:verify(getAnalysis<LocalDataStructures>().getGlobalsGraph());break;\n case bu: verify(getAnalysis<BUDataStructures>().getGlobalsGraph()); break;\n case td: verify(getAnalysis<TDDataStructures>().getGlobalsGraph()); break;\n }\n return false;\n}\n\n\/\/\/ runOnFunction - Get the DSGraph for this function and verify that it is ok.\n\/\/\/\nbool DSGC::runOnFunction(Function &F) {\n switch (DSPass) {\n case local: verify(getAnalysis<LocalDataStructures>().getDSGraph(F)); break;\n case bu: verify(getAnalysis<BUDataStructures>().getDSGraph(F)); break;\n case td: verify(getAnalysis<TDDataStructures>().getDSGraph(F)); break;\n }\n\n return false;\n}\n\n\/\/\/ verify - This is the function which checks to make sure that all of the\n\/\/\/ invariants established on the command line are true.\n\/\/\/\nvoid DSGC::verify(const DSGraph &G) {\n \/\/ Loop over all of the nodes, checking to see if any are collapsed...\n if (AbortIfAnyCollapsed) {\n const std::vector<DSNode*> &Nodes = G.getNodes();\n for (unsigned i = 0, e = Nodes.size(); i != e; ++i)\n if (Nodes[i]->isNodeCompletelyFolded()) {\n std::cerr << \"Node is collapsed: \";\n Nodes[i]->print(std::cerr, &G);\n abort();\n }\n }\n\n if (!AbortIfCollapsed.empty() || !CheckFlags.empty() ||\n !AbortIfMerged.empty()) {\n \/\/ Convert from a list to a set, because we don't have cl::set's yet. FIXME\n std::set<std::string> AbortIfCollapsedS(AbortIfCollapsed.begin(),\n AbortIfCollapsed.end());\n std::set<std::string> AbortIfMergedS(AbortIfMerged.begin(),\n AbortIfMerged.end());\n std::map<std::string, unsigned> CheckFlagsM;\n \n for (cl::list<std::string>::iterator I = CheckFlags.begin(),\n E = CheckFlags.end(); I != E; ++I) {\n unsigned ColonPos = I->rfind(':');\n if (ColonPos == std::string::npos) {\n std::cerr << \"Error: '\" << *I\n << \"' is an invalid value for the --dsgc-check-flags option!\\n\";\n abort();\n }\n\n unsigned Flags = 0;\n for (unsigned C = ColonPos+1; C != I->size(); ++C)\n switch ((*I)[C]) {\n case 'S': Flags |= DSNode::AllocaNode; break;\n case 'H': Flags |= DSNode::HeapNode; break;\n case 'G': Flags |= DSNode::GlobalNode; break;\n case 'U': Flags |= DSNode::UnknownNode; break;\n case 'I': Flags |= DSNode::Incomplete; break;\n case 'M': Flags |= DSNode::Modified; break;\n case 'R': Flags |= DSNode::Read; break;\n case 'A': Flags |= DSNode::Array; break;\n default: std::cerr << \"Invalid DSNode flag!\\n\"; abort();\n }\n CheckFlagsM[std::string(I->begin(), I->begin()+ColonPos)] = Flags;\n }\n \n \/\/ Now we loop over all of the scalars, checking to see if any are collapsed\n \/\/ that are not supposed to be, or if any are merged together.\n const DSGraph::ScalarMapTy &SM = G.getScalarMap();\n std::map<DSNode*, std::string> AbortIfMergedNodes;\n \n for (DSGraph::ScalarMapTy::const_iterator I = SM.begin(), E = SM.end();\n I != E; ++I)\n if (I->first->hasName() && I->second.getNode()) {\n const std::string &Name = I->first->getName();\n DSNode *N = I->second.getNode();\n \n \/\/ Verify it is not collapsed if it is not supposed to be...\n if (N->isNodeCompletelyFolded() && AbortIfCollapsedS.count(Name)) {\n std::cerr << \"Node for value '%\" << Name << \"' is collapsed: \";\n N->print(std::cerr, &G);\n abort();\n }\n\n if (CheckFlagsM.count(Name) && CheckFlagsM[Name] != N->getNodeFlags()) {\n std::cerr << \"Node flags are not as expected for node: \" << Name\n << \"\\n\";\n N->print(std::cerr, &G);\n abort();\n }\n\n \/\/ Verify that it is not merged if it is not supposed to be...\n if (AbortIfMergedS.count(Name)) {\n if (AbortIfMergedNodes.count(N)) {\n std::cerr << \"Nodes for values '%\" << Name << \"' and '%\"\n << AbortIfMergedNodes[N] << \"' is merged: \";\n N->print(std::cerr, &G);\n abort();\n }\n AbortIfMergedNodes[N] = Name;\n }\n }\n }\n}\n<commit_msg>Use std::string::size_type for for ColonPos to stop gcc from giving a warning<commit_after>\/\/===- GraphChecker.cpp - Assert that various graph properties hold -------===\/\/\n\/\/\n\/\/ This pass is used to test DSA with regression tests. It can be used to check\n\/\/ that certain graph properties hold, such as two nodes being disjoint, whether\n\/\/ or not a node is collapsed, etc. These are the command line arguments that\n\/\/ it supports:\n\/\/\n\/\/ --dsgc-dsapass={local,bu,td} - Specify what flavor of graph to check\n\/\/ --dsgc-abort-if-any-collapsed - Abort if any collapsed nodes are found\n\/\/ --dsgc-abort-if-collapsed=<list> - Abort if a node pointed to by an SSA\n\/\/ value with name in <list> is collapsed\n\/\/ --dsgc-check-flags=<list> - Abort if the specified nodes have flags\n\/\/ that are not specified.\n\/\/ --dsgc-abort-if-merged=<list> - Abort if any of the named SSA values\n\/\/ point to the same node.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Analysis\/DataStructure.h\"\n#include \"llvm\/Analysis\/DSGraph.h\"\n#include \"Support\/CommandLine.h\"\n#include \"llvm\/Value.h\"\n#include <set>\n\nnamespace {\n enum DSPass { local, bu, td };\n cl::opt<DSPass>\n DSPass(\"dsgc-dspass\", cl::Hidden,\n cl::desc(\"Specify which DSA pass the -datastructure-gc pass should use\"),\n cl::values(clEnumVal(local, \"Local pass\"),\n clEnumVal(bu, \"Bottom-up pass\"),\n clEnumVal(td, \"Top-down pass\"), 0), cl::init(local));\n\n cl::opt<bool>\n AbortIfAnyCollapsed(\"dsgc-abort-if-any-collapsed\", cl::Hidden,\n cl::desc(\"Abort if any collapsed nodes are found\"));\n cl::list<std::string>\n AbortIfCollapsed(\"dsgc-abort-if-collapsed\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Abort if any of the named symbols is collapsed\"));\n cl::list<std::string>\n CheckFlags(\"dsgc-check-flags\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Check that flags are specified for nodes\"));\n cl::list<std::string>\n AbortIfMerged(\"dsgc-abort-if-merged\", cl::Hidden, cl::CommaSeparated,\n cl::desc(\"Abort if any of the named symbols are merged together\"));\n\n struct DSGC : public FunctionPass {\n DSGC();\n bool doFinalization(Module &M);\n bool runOnFunction(Function &F);\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n switch (DSPass) {\n case local: AU.addRequired<LocalDataStructures>(); break;\n case bu: AU.addRequired<BUDataStructures>(); break;\n case td: AU.addRequired<TDDataStructures>(); break;\n }\n AU.setPreservesAll();\n }\n void print(std::ostream &O, const Module *M) const {}\n\n private:\n void verify(const DSGraph &G);\n };\n\n RegisterAnalysis<DSGC> X(\"datastructure-gc\", \"DSA Graph Checking Pass\");\n}\n\nDSGC::DSGC() {\n if (!AbortIfAnyCollapsed && AbortIfCollapsed.empty() &&\n CheckFlags.empty() && AbortIfMerged.empty()) {\n std::cerr << \"The -datastructure-gc is useless if you don't specify any\"\n \" -dsgc-* options. See the -help-hidden output for a list.\\n\";\n abort();\n }\n}\n\n\n\/\/\/ doFinalization - Verify that the globals graph is in good shape...\n\/\/\/\nbool DSGC::doFinalization(Module &M) {\n switch (DSPass) {\n case local:verify(getAnalysis<LocalDataStructures>().getGlobalsGraph());break;\n case bu: verify(getAnalysis<BUDataStructures>().getGlobalsGraph()); break;\n case td: verify(getAnalysis<TDDataStructures>().getGlobalsGraph()); break;\n }\n return false;\n}\n\n\/\/\/ runOnFunction - Get the DSGraph for this function and verify that it is ok.\n\/\/\/\nbool DSGC::runOnFunction(Function &F) {\n switch (DSPass) {\n case local: verify(getAnalysis<LocalDataStructures>().getDSGraph(F)); break;\n case bu: verify(getAnalysis<BUDataStructures>().getDSGraph(F)); break;\n case td: verify(getAnalysis<TDDataStructures>().getDSGraph(F)); break;\n }\n\n return false;\n}\n\n\/\/\/ verify - This is the function which checks to make sure that all of the\n\/\/\/ invariants established on the command line are true.\n\/\/\/\nvoid DSGC::verify(const DSGraph &G) {\n \/\/ Loop over all of the nodes, checking to see if any are collapsed...\n if (AbortIfAnyCollapsed) {\n const std::vector<DSNode*> &Nodes = G.getNodes();\n for (unsigned i = 0, e = Nodes.size(); i != e; ++i)\n if (Nodes[i]->isNodeCompletelyFolded()) {\n std::cerr << \"Node is collapsed: \";\n Nodes[i]->print(std::cerr, &G);\n abort();\n }\n }\n\n if (!AbortIfCollapsed.empty() || !CheckFlags.empty() ||\n !AbortIfMerged.empty()) {\n \/\/ Convert from a list to a set, because we don't have cl::set's yet. FIXME\n std::set<std::string> AbortIfCollapsedS(AbortIfCollapsed.begin(),\n AbortIfCollapsed.end());\n std::set<std::string> AbortIfMergedS(AbortIfMerged.begin(),\n AbortIfMerged.end());\n std::map<std::string, unsigned> CheckFlagsM;\n \n for (cl::list<std::string>::iterator I = CheckFlags.begin(),\n E = CheckFlags.end(); I != E; ++I) {\n std::string::size_type ColonPos = I->rfind(':');\n if (ColonPos == std::string::npos) {\n std::cerr << \"Error: '\" << *I\n << \"' is an invalid value for the --dsgc-check-flags option!\\n\";\n abort();\n }\n\n unsigned Flags = 0;\n for (unsigned C = ColonPos+1; C != I->size(); ++C)\n switch ((*I)[C]) {\n case 'S': Flags |= DSNode::AllocaNode; break;\n case 'H': Flags |= DSNode::HeapNode; break;\n case 'G': Flags |= DSNode::GlobalNode; break;\n case 'U': Flags |= DSNode::UnknownNode; break;\n case 'I': Flags |= DSNode::Incomplete; break;\n case 'M': Flags |= DSNode::Modified; break;\n case 'R': Flags |= DSNode::Read; break;\n case 'A': Flags |= DSNode::Array; break;\n default: std::cerr << \"Invalid DSNode flag!\\n\"; abort();\n }\n CheckFlagsM[std::string(I->begin(), I->begin()+ColonPos)] = Flags;\n }\n \n \/\/ Now we loop over all of the scalars, checking to see if any are collapsed\n \/\/ that are not supposed to be, or if any are merged together.\n const DSGraph::ScalarMapTy &SM = G.getScalarMap();\n std::map<DSNode*, std::string> AbortIfMergedNodes;\n \n for (DSGraph::ScalarMapTy::const_iterator I = SM.begin(), E = SM.end();\n I != E; ++I)\n if (I->first->hasName() && I->second.getNode()) {\n const std::string &Name = I->first->getName();\n DSNode *N = I->second.getNode();\n \n \/\/ Verify it is not collapsed if it is not supposed to be...\n if (N->isNodeCompletelyFolded() && AbortIfCollapsedS.count(Name)) {\n std::cerr << \"Node for value '%\" << Name << \"' is collapsed: \";\n N->print(std::cerr, &G);\n abort();\n }\n\n if (CheckFlagsM.count(Name) && CheckFlagsM[Name] != N->getNodeFlags()) {\n std::cerr << \"Node flags are not as expected for node: \" << Name\n << \"\\n\";\n N->print(std::cerr, &G);\n abort();\n }\n\n \/\/ Verify that it is not merged if it is not supposed to be...\n if (AbortIfMergedS.count(Name)) {\n if (AbortIfMergedNodes.count(N)) {\n std::cerr << \"Nodes for values '%\" << Name << \"' and '%\"\n << AbortIfMergedNodes[N] << \"' is merged: \";\n N->print(std::cerr, &G);\n abort();\n }\n AbortIfMergedNodes[N] = Name;\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved\n *\/\n#include \"Stroika\/Frameworks\/StroikaPreComp.h\"\n\n#include <random>\n\n#include \"Stroika\/Foundation\/Characters\/String.h\"\n#include \"Stroika\/Foundation\/Common\/Property.h\"\n#include \"Stroika\/Foundation\/Containers\/Set.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/Schema.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/TableConnection.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/Versioning.h\"\n#include \"Stroika\/Foundation\/Debug\/Trace.h\"\n#include \"Stroika\/Foundation\/Execution\/Sleep.h\"\n#include \"Stroika\/Foundation\/Execution\/Thread.h\"\n#include \"Stroika\/Foundation\/IO\/FileSystem\/WellKnownLocations.h\"\n\n#include \"ORMEmployeesDB.h\"\n\nusing namespace std;\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Characters;\nusing namespace Stroika::Foundation::Common;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Database;\nusing namespace Stroika::Foundation::Debug;\nusing namespace Stroika::Foundation::Execution;\n\nusing namespace Database::SQL;\nusing namespace SQL::ORM;\n\nnamespace {\n\n struct Employee {\n optional<int> ID{};\n String fName;\n int fAge{};\n String fAddress;\n double fSalary{};\n bool fStillEmployed{};\n\n static const ConstantProperty<ObjectVariantMapper> kMapper;\n };\n const ConstantProperty<ObjectVariantMapper> Employee::kMapper{[] () {\n ObjectVariantMapper mapper;\n mapper.AddCommonType<optional<int>> ();\n mapper.AddClass<Employee> (initializer_list<ObjectVariantMapper::StructFieldInfo>{\n {L\"id\", StructFieldMetaInfo{&Employee::ID}},\n {L\"Name\", StructFieldMetaInfo{&Employee::fName}},\n {L\"Age\", StructFieldMetaInfo{&Employee::fAge}},\n {L\"Address\", StructFieldMetaInfo{&Employee::fAddress}},\n {L\"Salary\", StructFieldMetaInfo{&Employee::fSalary}},\n {L\"Still-Employed\", StructFieldMetaInfo{&Employee::fStillEmployed}},\n });\n return mapper;\n }};\n\n struct Paycheck {\n optional<int> ID{};\n int fEmployeeRef;\n double fAmount{};\n Time::Date fDate;\n\n static const ConstantProperty<ObjectVariantMapper> kMapper;\n };\n const ConstantProperty<ObjectVariantMapper> Paycheck::kMapper{[] () {\n ObjectVariantMapper mapper;\n mapper.AddCommonType<optional<int>> ();\n mapper.AddClass<Paycheck> (initializer_list<ObjectVariantMapper::StructFieldInfo>{\n {L\"id\", StructFieldMetaInfo{&Paycheck::ID}},\n {L\"Employee-Ref\", StructFieldMetaInfo{&Paycheck::fEmployeeRef}},\n {L\"Amount\", StructFieldMetaInfo{&Paycheck::fAmount}},\n {L\"Date\", StructFieldMetaInfo{&Paycheck::fDate}},\n });\n return mapper;\n }};\n\n \/**\n * Combine all the ObjectVariantMappers for the objects we use in this database into one, and\n * AMEND any mappers as needed to accomodate possible changes in the mappings (like represeting\n * some things as strings vs. BLOBs etc).\n *\/\n const ConstantProperty<ObjectVariantMapper> kDBObjectMapper_{[] () {\n ObjectVariantMapper mapper;\n mapper += Employee::kMapper;\n mapper += Paycheck::kMapper;\n return mapper;\n }};\n\n \/*\n * Define the schema, and how to map between the VariantValue objects and the database\n * for the EMPLOYEES table.\n *\/\n const Schema::Table kEmployeesTableSchema_{\n L\"EMPLOYEES\",\n \/*\n * use the same names as the ObjectVariantMapper for simpler mapping, or specify an alternate name\n * for ID, just as an example.\n *\/\n \/\/ clang-format off\n Collection<Schema::Field>{\n#if __cpp_designated_initializers\n {.fName = L\"ID\", .fVariantValueFieldName = L\"id\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger, .fIsKeyField = true, .fAutoIncrement = true}\n , {.fName = L\"NAME\", .fVariantValueFieldName = L\"Name\"sv, .fVariantType = VariantValue::eString}\n , {.fName = L\"AGE\", .fVariantValueFieldName = L\"Age\"sv, .fVariantType = VariantValue::eInteger}\n , {.fName = L\"ADDRESS\", .fVariantValueFieldName = L\"Address\"sv, .fVariantType = VariantValue::eString}\n , {.fName = L\"SALARY\", .fVariantValueFieldName = L\"Salary\"sv, .fVariantType = VariantValue::eFloat}\n , {.fName = L\"STILL_EMPLOYED\", .fVariantValueFieldName = L\"Still-Employed\"sv, .fVariantType = VariantValue::eInteger}\n#else\n {L\"ID\", L\"id\"sv, true, VariantValue::eInteger, nullopt, true, nullopt, nullopt, true}\n , {L\"name\", L\"Name\"sv, false, VariantValue::eString}\n , {L\"AGE\", L\"Age\"sv, false, VariantValue::eInteger}\n , {L\"ADDRESS\", L\"Address\"sv, false, VariantValue::eString}\n , {L\"SALARY\", L\"Salary\"sv, false, VariantValue::eFloat}\n , {L\"STILL_EMPLOYED\", L\"Still-Employed\"sv, false, VariantValue::eInteger}\n#endif\n },\n Schema::CatchAllField{}};\n\n \/*\n * Define the schema, and how to map between the VariantValue objects and the database\n * for the PAYCHECKS table.\n *\/\n const Schema::Table kPaychecksTableSchema_{\n L\"PAYCHECKS\",\n Collection<Schema::Field>{\n#if __cpp_designated_initializers\n {.fName = L\"ID\", .fVariantValueFieldName = L\"id\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger, .fIsKeyField = true, .fAutoIncrement = true}\n , {.fName = L\"EMPLOYEEREF\", .fVariantValueFieldName = L\"Employee-Ref\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger}\n , {.fName = L\"AMOUNT\", .fVariantValueFieldName = L\"Amount\"sv, .fVariantType = VariantValue::eFloat}\n , {.fName = L\"DATE\", .fVariantValueFieldName = L\"Date\"sv, .fVariantType = VariantValue::eDate}\n#else\n {L\"ID\", L\"id\"sv, true, VariantValue::eInteger, nullopt, true, nullopt, nullopt, true}\n , {L\"EMPLOYEEREF\", L\"Employee-Ref\"sv, true, VariantValue::eInteger, nullopt, false, nullopt, nullopt}\n , {L\"AMOUNT\", L\"Amount\"sv, false, VariantValue::eFloat}\n , {L\"DATE\", L\"Date\"sv, false, VariantValue::eDate}\n#endif\n }};\n \/\/ clang-format on\n\n \/*\n * Example thread making updates to the employees table.\n *\/\n void PeriodicallyUpdateEmployeesTable_ (Connection::Ptr conn)\n {\n TraceContextBumper ctx{\"{}::PeriodicallyUpdateEmployeesTable_\"};\n\n auto employeeTableConnection = make_unique<SQL::ORM::TableConnection<Employee>> (conn, kEmployeesTableSchema_, kDBObjectMapper_);\n\n \/\/ Add Initial Employees\n \/\/ @todo use __cpp_designated_initializers when we can assume it\n employeeTableConnection->AddNew (Employee{nullopt, L\"Paul\", 32, L\"California\", 20000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Allen\", 25, L\"Texas\", 15000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Teddy\", 23, L\"Norway\", 20000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Mark\", 25, L\"Rich-Mond\", 65000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"David\", 27, L\"Texas\", 85000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Kim\", 22, L\"South-Hall\", 45000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"James\", 24, L\"Houston\", 10000.00, true});\n\n default_random_engine generator;\n uniform_int_distribution<int> distribution{1, 6};\n\n \/\/ then keep adding\/removing people randomly (but dont really remove just mark no longer employed so we\n \/\/ can REF in paycheck table\n while (true) {\n static const Sequence<String> kNames_{L\"Joe\", L\"Phred\", L\"Barny\", L\"Sue\", L\"Anne\"};\n uniform_int_distribution<int> namesDistr{0, static_cast<int> (kNames_.size () - 1)};\n uniform_int_distribution<int> ageDistr{25, 50};\n static const Sequence<String> kAddresses{L\"Houston\", L\"Pittsburg\", L\"New York\", L\"Paris\", L\"California\"};\n uniform_int_distribution<int> addressesDistr{0, static_cast<int> (kAddresses.size () - 1)};\n uniform_real_distribution<float> salaryDistr{10000.00, 50000.00};\n\n try {\n uniform_int_distribution<int> whatTodoDistr{0, 3};\n switch (whatTodoDistr (generator)) {\n case 0:\n case 1: {\n String name = kNames_[namesDistr (generator)];\n DbgTrace (L\"Adding employee %s\", name.c_str ());\n employeeTableConnection->AddNew (Employee{nullopt, name, ageDistr (generator), kAddresses[addressesDistr (generator)], salaryDistr (generator), true});\n } break;\n case 2: {\n \/\/ Look somebody up, and fire them\n auto activeEmps = employeeTableConnection->GetAll ();\n if (not activeEmps.empty ()) {\n uniform_int_distribution<int> empDistr{0, static_cast<int> (activeEmps.size () - 1)};\n Employee killMe = activeEmps[empDistr (generator)];\n Assert (killMe.ID.has_value ());\n DbgTrace (L\"Firing employee: %d, %s\", *killMe.ID, killMe.fName.c_str ());\n killMe.fStillEmployed = false;\n employeeTableConnection->Update (killMe);\n }\n } break;\n }\n }\n catch (...) {\n \/\/ no need to check for ThreadAbort excepton, since Sleep is a cancelation point\n DbgTrace (L\"Exception processing SQL - this should generally not happen: %s\", Characters::ToString (current_exception ()).c_str ());\n }\n\n Sleep (1s); \/\/ **cancelation point**\n }\n }\n\n \/*\n * Example thread making updates to the paychecks table (while consulting the employees table).\n *\/\n void PeriodicallyWriteChecksForEmployeesTable_ (Connection::Ptr conn)\n {\n TraceContextBumper ctx{\"{}::PeriodicallyWriteChecksForEmployeesTable_\"};\n auto employeeTableConnection = make_unique<SQL::ORM::TableConnection<Employee>> (conn, kEmployeesTableSchema_, kDBObjectMapper_);\n auto paycheckTableConnection = make_unique<SQL::ORM::TableConnection<Paycheck>> (conn, kPaychecksTableSchema_, kDBObjectMapper_);\n while (true) {\n try {\n for (auto employee : employeeTableConnection->GetAll ()) {\n Assert (employee.ID != nullopt);\n DbgTrace (L\"Writing paycheck for employee #%d (%s) amount %f\", *employee.ID, employee.fName.c_str (), employee.fSalary);\n paycheckTableConnection->AddNew (Paycheck{nullopt, *employee.ID, employee.fSalary \/ 12, DateTime::Now ().GetDate ()});\n }\n }\n catch (...) {\n \/\/ no need to check for ThreadAbort excepton, since Sleep is a cancelation point\n DbgTrace (L\"Exception processing SQL - this should generally not happen: %s\", Characters::ToString (current_exception ()).c_str ());\n }\n Sleep (2s); \/\/ **cancelation point**\n }\n }\n}\n\nvoid Stroika::Samples::SQL::ORMEmployeesDB (const std::function<Connection::Ptr ()>& connectionFactory)\n{\n TraceContextBumper ctx{\"ORMEmployeesDB\"};\n\n Connection::Ptr conn1 = connectionFactory ();\n Connection::Ptr conn2 = connectionFactory ();\n\n \/\/ setup DB schema (on either connection) before running access threads\n constexpr Configuration::Version kCurrentVersion_ = Configuration::Version{1, 0, Configuration::VersionStage::Alpha, 0};\n ORM::ProvisionForVersion (conn1,\n kCurrentVersion_,\n Traversal::Iterable<ORM::Schema::Table>{kEmployeesTableSchema_, kPaychecksTableSchema_});\n\n \/*\n * Create threads for each of our activities.\n * When the waitable even times out, the threads will automatically be 'canceled' as they go out of scope.\n *\/\n Thread::CleanupPtr updateEmpDBThread{Thread::CleanupPtr::eAbortBeforeWaiting, Thread::New ([=] () { PeriodicallyUpdateEmployeesTable_ (conn1); }, Thread::eAutoStart, L\"Update Employee Table\")};\n Thread::CleanupPtr writeChecks{Thread::CleanupPtr::eAbortBeforeWaiting, Thread::New ([=] () { PeriodicallyWriteChecksForEmployeesTable_ (conn2); }, Thread::eAutoStart, L\"Write Checks\")};\n Execution::WaitableEvent{}.WaitQuietly (15s);\n}\n<commit_msg>adjust samples to accomodate recent ORM code change<commit_after>\/*\n * Copyright(c) Sophist Solutions, Inc. 1990-2021. All rights reserved\n *\/\n#include \"Stroika\/Frameworks\/StroikaPreComp.h\"\n\n#include <random>\n\n#include \"Stroika\/Foundation\/Characters\/String.h\"\n#include \"Stroika\/Foundation\/Common\/Property.h\"\n#include \"Stroika\/Foundation\/Containers\/Set.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/Schema.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/TableConnection.h\"\n#include \"Stroika\/Foundation\/Database\/SQL\/ORM\/Versioning.h\"\n#include \"Stroika\/Foundation\/Debug\/Trace.h\"\n#include \"Stroika\/Foundation\/Execution\/Sleep.h\"\n#include \"Stroika\/Foundation\/Execution\/Thread.h\"\n#include \"Stroika\/Foundation\/IO\/FileSystem\/WellKnownLocations.h\"\n\n#include \"ORMEmployeesDB.h\"\n\nusing namespace std;\n\nusing namespace Stroika::Foundation;\nusing namespace Stroika::Foundation::Characters;\nusing namespace Stroika::Foundation::Common;\nusing namespace Stroika::Foundation::Containers;\nusing namespace Stroika::Foundation::Database;\nusing namespace Stroika::Foundation::Debug;\nusing namespace Stroika::Foundation::Execution;\n\nusing namespace Database::SQL;\nusing namespace SQL::ORM;\n\nnamespace {\n\n struct Employee {\n optional<int> ID{};\n String fName;\n int fAge{};\n String fAddress;\n double fSalary{};\n bool fStillEmployed{};\n\n static const ConstantProperty<ObjectVariantMapper> kMapper;\n };\n const ConstantProperty<ObjectVariantMapper> Employee::kMapper{[] () {\n ObjectVariantMapper mapper;\n mapper.AddCommonType<optional<int>> ();\n mapper.AddClass<Employee> (initializer_list<ObjectVariantMapper::StructFieldInfo>{\n {L\"id\", StructFieldMetaInfo{&Employee::ID}},\n {L\"Name\", StructFieldMetaInfo{&Employee::fName}},\n {L\"Age\", StructFieldMetaInfo{&Employee::fAge}},\n {L\"Address\", StructFieldMetaInfo{&Employee::fAddress}},\n {L\"Salary\", StructFieldMetaInfo{&Employee::fSalary}},\n {L\"Still-Employed\", StructFieldMetaInfo{&Employee::fStillEmployed}},\n });\n return mapper;\n }};\n\n struct Paycheck {\n optional<int> ID{};\n int fEmployeeRef;\n double fAmount{};\n Time::Date fDate;\n\n static const ConstantProperty<ObjectVariantMapper> kMapper;\n };\n const ConstantProperty<ObjectVariantMapper> Paycheck::kMapper{[] () {\n ObjectVariantMapper mapper;\n mapper.AddCommonType<optional<int>> ();\n mapper.AddClass<Paycheck> (initializer_list<ObjectVariantMapper::StructFieldInfo>{\n {L\"id\", StructFieldMetaInfo{&Paycheck::ID}},\n {L\"Employee-Ref\", StructFieldMetaInfo{&Paycheck::fEmployeeRef}},\n {L\"Amount\", StructFieldMetaInfo{&Paycheck::fAmount}},\n {L\"Date\", StructFieldMetaInfo{&Paycheck::fDate}},\n });\n return mapper;\n }};\n\n \/**\n * Combine all the ObjectVariantMappers for the objects we use in this database into one, and\n * AMEND any mappers as needed to accomodate possible changes in the mappings (like represeting\n * some things as strings vs. BLOBs etc).\n *\/\n const ConstantProperty<ObjectVariantMapper> kDBObjectMapper_{[] () {\n ObjectVariantMapper mapper;\n mapper += Employee::kMapper;\n mapper += Paycheck::kMapper;\n return mapper;\n }};\n\n \/*\n * Define the schema, and how to map between the VariantValue objects and the database\n * for the EMPLOYEES table.\n *\/\n const Schema::Table kEmployeesTableSchema_{\n L\"EMPLOYEES\",\n \/*\n * use the same names as the ObjectVariantMapper for simpler mapping, or specify an alternate name\n * for ID, just as an example.\n *\/\n \/\/ clang-format off\n Collection<Schema::Field>{\n#if __cpp_designated_initializers\n {.fName = L\"ID\", .fVariantValueFieldName = L\"id\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger, .fIsKeyField = true, .fDefaultExpression = Schema::Field::kDefaultExpression_AutoIncrement}\n , {.fName = L\"NAME\", .fVariantValueFieldName = L\"Name\"sv, .fVariantType = VariantValue::eString}\n , {.fName = L\"AGE\", .fVariantValueFieldName = L\"Age\"sv, .fVariantType = VariantValue::eInteger}\n , {.fName = L\"ADDRESS\", .fVariantValueFieldName = L\"Address\"sv, .fVariantType = VariantValue::eString}\n , {.fName = L\"SALARY\", .fVariantValueFieldName = L\"Salary\"sv, .fVariantType = VariantValue::eFloat}\n , {.fName = L\"STILL_EMPLOYED\", .fVariantValueFieldName = L\"Still-Employed\"sv, .fVariantType = VariantValue::eInteger}\n#else\n {L\"ID\", L\"id\"sv, true, VariantValue::eInteger, nullopt, true, nullopt, Schema::Field::kDefaultExpression_AutoIncrement}\n , {L\"name\", L\"Name\"sv, false, VariantValue::eString}\n , {L\"AGE\", L\"Age\"sv, false, VariantValue::eInteger}\n , {L\"ADDRESS\", L\"Address\"sv, false, VariantValue::eString}\n , {L\"SALARY\", L\"Salary\"sv, false, VariantValue::eFloat}\n , {L\"STILL_EMPLOYED\", L\"Still-Employed\"sv, false, VariantValue::eInteger}\n#endif\n },\n Schema::CatchAllField{}};\n\n \/*\n * Define the schema, and how to map between the VariantValue objects and the database\n * for the PAYCHECKS table.\n *\/\n const Schema::Table kPaychecksTableSchema_{\n L\"PAYCHECKS\",\n Collection<Schema::Field>{\n#if __cpp_designated_initializers\n {.fName = L\"ID\", .fVariantValueFieldName = L\"id\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger, .fIsKeyField = true, .fDefaultExpression = Schema::Field::kDefaultExpression_AutoIncrement}\n , {.fName = L\"EMPLOYEEREF\", .fVariantValueFieldName = L\"Employee-Ref\"sv, .fRequired = true, .fVariantType = VariantValue::eInteger}\n , {.fName = L\"AMOUNT\", .fVariantValueFieldName = L\"Amount\"sv, .fVariantType = VariantValue::eFloat}\n , {.fName = L\"DATE\", .fVariantValueFieldName = L\"Date\"sv, .fVariantType = VariantValue::eDate}\n#else\n {L\"ID\", L\"id\"sv, true, VariantValue::eInteger, nullopt, true, nullopt, Schema::Field::kDefaultExpression_AutoIncrement}\n , {L\"EMPLOYEEREF\", L\"Employee-Ref\"sv, true, VariantValue::eInteger, nullopt, false, nullopt, nullopt}\n , {L\"AMOUNT\", L\"Amount\"sv, false, VariantValue::eFloat}\n , {L\"DATE\", L\"Date\"sv, false, VariantValue::eDate}\n#endif\n }};\n \/\/ clang-format on\n\n \/*\n * Example thread making updates to the employees table.\n *\/\n void PeriodicallyUpdateEmployeesTable_ (Connection::Ptr conn)\n {\n TraceContextBumper ctx{\"{}::PeriodicallyUpdateEmployeesTable_\"};\n\n auto employeeTableConnection = make_unique<SQL::ORM::TableConnection<Employee>> (conn, kEmployeesTableSchema_, kDBObjectMapper_);\n\n \/\/ Add Initial Employees\n \/\/ @todo use __cpp_designated_initializers when we can assume it\n employeeTableConnection->AddNew (Employee{nullopt, L\"Paul\", 32, L\"California\", 20000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Allen\", 25, L\"Texas\", 15000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Teddy\", 23, L\"Norway\", 20000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Mark\", 25, L\"Rich-Mond\", 65000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"David\", 27, L\"Texas\", 85000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"Kim\", 22, L\"South-Hall\", 45000.00, true});\n employeeTableConnection->AddNew (Employee{nullopt, L\"James\", 24, L\"Houston\", 10000.00, true});\n\n default_random_engine generator;\n uniform_int_distribution<int> distribution{1, 6};\n\n \/\/ then keep adding\/removing people randomly (but dont really remove just mark no longer employed so we\n \/\/ can REF in paycheck table\n while (true) {\n static const Sequence<String> kNames_{L\"Joe\", L\"Phred\", L\"Barny\", L\"Sue\", L\"Anne\"};\n uniform_int_distribution<int> namesDistr{0, static_cast<int> (kNames_.size () - 1)};\n uniform_int_distribution<int> ageDistr{25, 50};\n static const Sequence<String> kAddresses{L\"Houston\", L\"Pittsburg\", L\"New York\", L\"Paris\", L\"California\"};\n uniform_int_distribution<int> addressesDistr{0, static_cast<int> (kAddresses.size () - 1)};\n uniform_real_distribution<float> salaryDistr{10000.00, 50000.00};\n\n try {\n uniform_int_distribution<int> whatTodoDistr{0, 3};\n switch (whatTodoDistr (generator)) {\n case 0:\n case 1: {\n String name = kNames_[namesDistr (generator)];\n DbgTrace (L\"Adding employee %s\", name.c_str ());\n employeeTableConnection->AddNew (Employee{nullopt, name, ageDistr (generator), kAddresses[addressesDistr (generator)], salaryDistr (generator), true});\n } break;\n case 2: {\n \/\/ Look somebody up, and fire them\n auto activeEmps = employeeTableConnection->GetAll ();\n if (not activeEmps.empty ()) {\n uniform_int_distribution<int> empDistr{0, static_cast<int> (activeEmps.size () - 1)};\n Employee killMe = activeEmps[empDistr (generator)];\n Assert (killMe.ID.has_value ());\n DbgTrace (L\"Firing employee: %d, %s\", *killMe.ID, killMe.fName.c_str ());\n killMe.fStillEmployed = false;\n employeeTableConnection->Update (killMe);\n }\n } break;\n }\n }\n catch (...) {\n \/\/ no need to check for ThreadAbort excepton, since Sleep is a cancelation point\n DbgTrace (L\"Exception processing SQL - this should generally not happen: %s\", Characters::ToString (current_exception ()).c_str ());\n }\n\n Sleep (1s); \/\/ **cancelation point**\n }\n }\n\n \/*\n * Example thread making updates to the paychecks table (while consulting the employees table).\n *\/\n void PeriodicallyWriteChecksForEmployeesTable_ (Connection::Ptr conn)\n {\n TraceContextBumper ctx{\"{}::PeriodicallyWriteChecksForEmployeesTable_\"};\n auto employeeTableConnection = make_unique<SQL::ORM::TableConnection<Employee>> (conn, kEmployeesTableSchema_, kDBObjectMapper_);\n auto paycheckTableConnection = make_unique<SQL::ORM::TableConnection<Paycheck>> (conn, kPaychecksTableSchema_, kDBObjectMapper_);\n while (true) {\n try {\n for (auto employee : employeeTableConnection->GetAll ()) {\n Assert (employee.ID != nullopt);\n DbgTrace (L\"Writing paycheck for employee #%d (%s) amount %f\", *employee.ID, employee.fName.c_str (), employee.fSalary);\n paycheckTableConnection->AddNew (Paycheck{nullopt, *employee.ID, employee.fSalary \/ 12, DateTime::Now ().GetDate ()});\n }\n }\n catch (...) {\n \/\/ no need to check for ThreadAbort excepton, since Sleep is a cancelation point\n DbgTrace (L\"Exception processing SQL - this should generally not happen: %s\", Characters::ToString (current_exception ()).c_str ());\n }\n Sleep (2s); \/\/ **cancelation point**\n }\n }\n}\n\nvoid Stroika::Samples::SQL::ORMEmployeesDB (const std::function<Connection::Ptr ()>& connectionFactory)\n{\n TraceContextBumper ctx{\"ORMEmployeesDB\"};\n\n Connection::Ptr conn1 = connectionFactory ();\n Connection::Ptr conn2 = connectionFactory ();\n\n \/\/ setup DB schema (on either connection) before running access threads\n constexpr Configuration::Version kCurrentVersion_ = Configuration::Version{1, 0, Configuration::VersionStage::Alpha, 0};\n ORM::ProvisionForVersion (conn1,\n kCurrentVersion_,\n Traversal::Iterable<ORM::Schema::Table>{kEmployeesTableSchema_, kPaychecksTableSchema_});\n\n \/*\n * Create threads for each of our activities.\n * When the waitable even times out, the threads will automatically be 'canceled' as they go out of scope.\n *\/\n Thread::CleanupPtr updateEmpDBThread{Thread::CleanupPtr::eAbortBeforeWaiting, Thread::New ([=] () { PeriodicallyUpdateEmployeesTable_ (conn1); }, Thread::eAutoStart, L\"Update Employee Table\")};\n Thread::CleanupPtr writeChecks{Thread::CleanupPtr::eAbortBeforeWaiting, Thread::New ([=] () { PeriodicallyWriteChecksForEmployeesTable_ (conn2); }, Thread::eAutoStart, L\"Write Checks\")};\n Execution::WaitableEvent{}.WaitQuietly (15s);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* ****************************************************************************\r\n *\r\n * Copyright (c) Microsoft Corporation. \r\n *\r\n * This source code is subject to terms and conditions of the Apache License, Version 2.0. A \r\n * copy of the license can be found in the License.html file at the root of this distribution. If \r\n * you cannot locate the Apache License, Version 2.0, please send an email to \r\n * vspython@microsoft.com. By using this source code in any fashion, you are agreeing to be bound \r\n * by the terms of the Apache License, Version 2.0.\r\n *\r\n * You must not remove this notice, or any other, from this software.\r\n *\r\n * ***************************************************************************\/\r\n\r\n\/\/ dllmain.cpp : Defines the entry point for the DLL application.\r\n#include \"stdafx.h\"\r\n#include <stdio.h>\r\n\r\n\r\n\/\/ Used by debugger to detect when DLL is fully loaded and initialized and TraceFunc can be registered.\r\nextern \"C\" {\r\n __declspec(dllexport)\r\n volatile char isInitialized;\r\n\r\n __declspec(dllexport)\r\n void OnInitialized() {\r\n volatile char dummy = 0;\r\n }\r\n}\r\n\r\n\r\nBOOL APIENTRY DllMain(HMODULE hModule, DWORD ul_reason_for_call, LPVOID lpReserved) {\r\n if (ul_reason_for_call == DLL_PROCESS_ATTACH) {\r\n isInitialized = 1;\r\n OnInitialized();\r\n }\r\n\r\n return TRUE;\r\n}\r\n<commit_msg>Fix mixed-mode debugging on release PTVS builds.<commit_after>\/* ****************************************************************************\r\n *\r\n * Copyright (c) Microsoft Corporation. \r\n *\r\n * This source code is subject to terms and conditions of the Apache License, Version 2.0. A \r\n * copy of the license can be found in the License.html file at the root of this distribution. If \r\n * you cannot locate the Apache License, Version 2.0, please send an email to \r\n * vspython@microsoft.com. By using this source code in any fashion, you are agreeing to be bound \r\n * by the terms of the Apache License, Version 2.0.\r\n *\r\n * You must not remove this notice, or any other, from this software.\r\n *\r\n * ***************************************************************************\/\r\n\r\n\/\/ dllmain.cpp : Defines the entry point for the DLL application.\r\n#include \"stdafx.h\"\r\n#include <stdio.h>\r\n\r\n\r\n\/\/ Used by debugger to detect when DLL is fully loaded and initialized and TraceFunc can be registered.\r\nextern \"C\" {\r\n __declspec(dllexport)\r\n volatile char isInitialized;\r\n\r\n __declspec(dllexport) __declspec(noinline)\r\n void OnInitialized() {\r\n volatile char dummy = 0;\r\n }\r\n}\r\n\r\n\r\nBOOL APIENTRY DllMain(HMODULE hModule, DWORD ul_reason_for_call, LPVOID lpReserved) {\r\n if (ul_reason_for_call == DLL_PROCESS_ATTACH) {\r\n isInitialized = 1;\r\n OnInitialized();\r\n }\r\n\r\n return TRUE;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Copyright (c) 2012, Sergey Lisitsyn\n *\/\n\n#ifndef TAPKEE_GENERALIZED_EIGEN_EMBEDDING_H_\n#define TAPKEE_GENERALIZED_EIGEN_EMBEDDING_H_\n\n#include <shogun\/lib\/tapkee\/utils\/arpack_wrapper.hpp>\n#include <shogun\/lib\/tapkee\/routines\/matrix_operations.hpp>\n\nnamespace tapkee\n{\nnamespace tapkee_internal\n{\n\n\/\/! Templated implementation of eigendecomposition-based embedding. \ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation, int IMPLEMENTATION> \nstruct generalized_eigen_embedding_impl\n{\n\t\/** Construct embedding\n\t * @param wm weight matrix to eigendecompose\n\t * @param target_dimension target dimension of embedding (number of eigenvectors to find)\n\t * @param skip number of eigenvectors to skip\n\t *\/\n\tvirtual EmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip);\n};\n\n\/\/! ARPACK implementation of eigendecomposition-based embedding\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation> \nstruct generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, ARPACK>\n{\n\tEmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip)\n\t{\n\t\ttimed_context context(\"ARPACK DSXUPD generalized eigendecomposition\");\n\n\t\tArpackGeneralizedSelfAdjointEigenSolver<LMatrixType, RMatrixType, MatrixTypeOperation> arpack(lhs,rhs,target_dimension+skip,\"SM\");\n\n\t\tDenseMatrix embedding_feature_matrix = (arpack.eigenvectors()).block(0,skip,lhs.cols(),target_dimension);\n\n\t\treturn EmbeddingResult(embedding_feature_matrix,arpack.eigenvalues().tail(target_dimension));\n\t}\n};\n\n\/\/! Eigen library dense implementation of eigendecomposition\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation> \nstruct generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, EIGEN_DENSE_SELFADJOINT_SOLVER>\n{\n\tEmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip)\n\t{\n\t\ttimed_context context(\"Eigen dense generalized eigendecomposition\");\n\n\t\tDenseMatrix dense_lhs = lhs;\n\t\tDenseMatrix dense_rhs = rhs;\n\t\tEigen::GeneralizedSelfAdjointEigenSolver<DenseMatrix> solver(dense_lhs, dense_rhs);\n\n\t\tDenseMatrix embedding_feature_matrix = (solver.eigenvectors()).block(0,skip,lhs.cols(),target_dimension);\n\n\t\treturn EmbeddingResult(embedding_feature_matrix,solver.eigenvalues().tail(target_dimension));\n\t}\n};\n\n\/\/! Adapter method for various generalized eigendecomposition methods. Currently\n\/\/! supports two methods:\n\/\/! <ul>\n\/\/! <li> ARPACK_XSXUPD\n\/\/! <li> EIGEN_DENSE_SELFADJOINT_SOLVER\n\/\/! <\/ul>\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation>\nEmbeddingResult generalized_eigen_embedding(TAPKEE_EIGEN_EMBEDDING_METHOD method, const LMatrixType& lhs,\n const RMatrixType& rhs,\n unsigned int target_dimension, unsigned int skip)\n{\n\tswitch (method)\n\t{\n\t\tcase ARPACK: \n\t\t\treturn generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, \n\t\t\t\tARPACK>().embed(lhs, rhs, target_dimension, skip);\n\t\tcase EIGEN_DENSE_SELFADJOINT_SOLVER:\n\t\t\treturn generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation,\n\t\t\t\tEIGEN_DENSE_SELFADJOINT_SOLVER>().embed(lhs, rhs, target_dimension, skip);\n\t\tcase RANDOMIZED:\n\t\t\t\/\/ TODO fail here\n\t\t\treturn EmbeddingResult();\n\t\tdefault: break;\n\t}\n\treturn EmbeddingResult();\n};\n\n}\n}\n\n#endif\n<commit_msg>Added missed guard for case when ARPACK is not available<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Copyright (c) 2012, Sergey Lisitsyn\n *\/\n\n#ifndef TAPKEE_GENERALIZED_EIGEN_EMBEDDING_H_\n#define TAPKEE_GENERALIZED_EIGEN_EMBEDDING_H_\n\n#include <shogun\/lib\/tapkee\/utils\/arpack_wrapper.hpp>\n#include <shogun\/lib\/tapkee\/routines\/matrix_operations.hpp>\n\nnamespace tapkee\n{\nnamespace tapkee_internal\n{\n\n\/\/! Templated implementation of eigendecomposition-based embedding. \ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation, int IMPLEMENTATION> \nstruct generalized_eigen_embedding_impl\n{\n\t\/** Construct embedding\n\t * @param wm weight matrix to eigendecompose\n\t * @param target_dimension target dimension of embedding (number of eigenvectors to find)\n\t * @param skip number of eigenvectors to skip\n\t *\/\n\tvirtual EmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip);\n};\n\n\/\/! ARPACK implementation of eigendecomposition-based embedding\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation> \nstruct generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, ARPACK>\n{\n\tEmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip)\n\t{\n\t\ttimed_context context(\"ARPACK DSXUPD generalized eigendecomposition\");\n\n#ifndef TAPKEE_NO_ARPACK\n\t\tArpackGeneralizedSelfAdjointEigenSolver<LMatrixType, RMatrixType, MatrixTypeOperation> arpack(lhs,rhs,target_dimension+skip,\"SM\");\n\n\t\tDenseMatrix embedding_feature_matrix = (arpack.eigenvectors()).block(0,skip,lhs.cols(),target_dimension);\n\n\t\treturn EmbeddingResult(embedding_feature_matrix,arpack.eigenvalues().tail(target_dimension));\n#else\n\t\treturn EmbeddingResult();\n#endif\n\t}\n};\n\n\/\/! Eigen library dense implementation of eigendecomposition\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation> \nstruct generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, EIGEN_DENSE_SELFADJOINT_SOLVER>\n{\n\tEmbeddingResult embed(const LMatrixType& lhs, const RMatrixType& rhs, unsigned int target_dimension, unsigned int skip)\n\t{\n\t\ttimed_context context(\"Eigen dense generalized eigendecomposition\");\n\n\t\tDenseMatrix dense_lhs = lhs;\n\t\tDenseMatrix dense_rhs = rhs;\n\t\tEigen::GeneralizedSelfAdjointEigenSolver<DenseMatrix> solver(dense_lhs, dense_rhs);\n\n\t\tDenseMatrix embedding_feature_matrix = (solver.eigenvectors()).block(0,skip,lhs.cols(),target_dimension);\n\n\t\treturn EmbeddingResult(embedding_feature_matrix,solver.eigenvalues().tail(target_dimension));\n\t}\n};\n\n\/\/! Adapter method for various generalized eigendecomposition methods. Currently\n\/\/! supports two methods:\n\/\/! <ul>\n\/\/! <li> ARPACK_XSXUPD\n\/\/! <li> EIGEN_DENSE_SELFADJOINT_SOLVER\n\/\/! <\/ul>\ntemplate <class LMatrixType, class RMatrixType, class MatrixTypeOperation>\nEmbeddingResult generalized_eigen_embedding(TAPKEE_EIGEN_EMBEDDING_METHOD method, const LMatrixType& lhs,\n const RMatrixType& rhs,\n unsigned int target_dimension, unsigned int skip)\n{\n\tswitch (method)\n\t{\n#ifndef TAPKEE_NO_ARPACK\n\t\tcase ARPACK: \n\t\t\treturn generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation, \n\t\t\t\tARPACK>().embed(lhs, rhs, target_dimension, skip);\n#endif\n\t\tcase EIGEN_DENSE_SELFADJOINT_SOLVER:\n\t\t\treturn generalized_eigen_embedding_impl<LMatrixType, RMatrixType, MatrixTypeOperation,\n\t\t\t\tEIGEN_DENSE_SELFADJOINT_SOLVER>().embed(lhs, rhs, target_dimension, skip);\n\t\tcase RANDOMIZED:\n\t\t\t\/\/ TODO fail here\n\t\t\treturn EmbeddingResult();\n\t\tdefault: break;\n\t}\n\treturn EmbeddingResult();\n};\n\n}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <albert\/scraper.hpp>\n\n#include <iostream>\n#include <deque>\n#include <fstream>\n#include <boost\/locale.hpp>\n\n#include <albert\/parsers\/category_parser.hpp>\n#include <albert\/parsers\/subcategory_parser.hpp>\n#include <albert\/parsers\/product_parser.hpp>\n\nnamespace supermarx\n{\n\tscraper::scraper(callback_t _callback, unsigned int _ratelimit)\n\t: callback(_callback)\n\t, dl(\"supermarx albert\/1.0\", _ratelimit)\n\t{}\n\n\tvoid scraper::scrape()\n\t{\n\t\tstatic const std::string domain_uri = \"http:\/\/www.ah.nl\";\n\t\tstd::deque<std::string> todo;\n\n\t\tcategory_parser c_p(\n\t\t\t[&](const category_parser::category_uri_t c)\n\t\t{\n\t\t\tsubcategory_parser sc_p(\n\t\t\t\t[&](const subcategory_parser::subcategory_uri_t sc)\n\t\t\t{\n\t\t\t\ttodo.push_back(sc);\n\t\t\t});\n\n\t\t\tsc_p.parse(dl.fetch(domain_uri + c));\n\t\t});\n\n\t\tc_p.parse(dl.fetch(domain_uri + \"\/producten\"));\n\n\t\twhile(!todo.empty())\n\t\t{\n\t\t\tstd::string current_uri = todo.front();\n\t\t\ttodo.pop_front();\n\n\t\t\tproduct_parser p_p(\n\t\t\t[&](const std::string uri)\n\t\t\t{\n\t\t\t\ttodo.push_front(uri);\n\t\t\t},\n\t\t\tcallback);\n\n\t\t\tp_p.parse(dl.fetch(domain_uri + current_uri));\n\t\t}\n\t}\n}\n<commit_msg>Fixed scraper to use deep hierarchies<commit_after>#include <albert\/scraper.hpp>\n\n#include <iostream>\n#include <deque>\n#include <fstream>\n#include <boost\/locale.hpp>\n\n#include <albert\/parsers\/category_parser.hpp>\n#include <albert\/parsers\/subcategory_parser.hpp>\n#include <albert\/parsers\/product_parser.hpp>\n\nnamespace supermarx\n{\n\tscraper::scraper(callback_t _callback, unsigned int _ratelimit)\n\t: callback(_callback)\n\t, dl(\"supermarx albert\/1.0\", _ratelimit)\n\t{}\n\n\tvoid scraper::scrape()\n\t{\n\t\tstatic const std::string domain_uri = \"http:\/\/www.ah.nl\";\n\t\tstd::deque<std::string> todo;\n\n\t\tcategory_parser c_p(\n\t\t\t[&](const category_parser::category_uri_t c)\n\t\t{\n\t\t\ttodo.emplace_back(domain_uri + c);\n\t\t});\n\n\t\tc_p.parse(dl.fetch(domain_uri + \"\/producten\"));\n\n\t\twhile(!todo.empty())\n\t\t{\n\t\t\tsubcategory_parser sc_p(\n\t\t\t\t[&](const subcategory_parser::subcategory_uri_t sc)\n\t\t\t{\n\t\t\t\ttodo.push_back(domain_uri + sc);\n\t\t\t});\n\n\t\t\tproduct_parser p_p(\n\t\t\t[&](const std::string uri)\n\t\t\t{\n\t\t\t\ttodo.push_front(domain_uri + uri);\n\t\t\t},\n\t\t\tcallback);\n\n\t\t\tstd::string current_uri = todo.front();\n\t\t\ttodo.pop_front();\n\n\t\t\tstd::cerr << current_uri << std::endl;\n\n\t\t\tstd::string src = dl.fetch(current_uri);\n\n\t\t\tsc_p.parse(src);\n\t\t\tp_p.parse(src);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"instrument.h\"\n\n\nInstrument::Instrument()\n{\n name[0] = 'i';\n name[1] = 'n';\n name[2] = 's';\n name[3] = 't';\n waveIndex = 0;\n volEntries=1;\n volTable = new unsigned short[256];\/\/64 integers worth\n for(int i = 0; i < 256; i++)\n volTable[i]=0;\n volTable[0] = 0x3F00;\n}\n\nInstrument::~Instrument()\n{\n delete [] volTable;\n}\n\nInstrument::Instrument(std::istream &in)\n{\n volTable = NULL;\n input(in);\n}\nInstrument::Instrument(const Instrument &other)\n{\n waveIndex = other.waveIndex;\n volEntries = other.volEntries;\n volTable = new unsigned short[256];\/\/64 integers worth\n for(int i = 0; i < 255; i++)\n volTable[i] = other.volTable[i];\n\n}\n\n\nstd::ostream &Instrument::output(std::ostream &out) const\n{\n out.write(name, 23);\n out.write((char*)&waveIndex, sizeof(short));\n\n out.write((char*)&volEntries,1);\n out.write((char*)volTable, volEntries*2);\n \/\/out.write((char*)volDurTable, volEntries);\n\n return out;\t\n}\n\nstd::istream &Instrument::input(std::istream &in)\n{\n if(volTable)\n delete [] volTable;\n\n in.read(name,23);\n in.read((char*)&waveIndex, sizeof(short));\n in.read((char*)&volEntries, 1);\n volTable = new unsigned short[256];\n in.read((char*)volTable, volEntries*2);\n for(int i = volEntries; i < 256; i++)\n volTable[i] = 0;\n\n return in;\n}\n\nvoid Instrument::setVolTable(unsigned short *table)\n{\n for(int i = 0; i < 256; i++)\n volTable[i] = table[i];\n}\n\nunsigned char Instrument::getVolume(unsigned char &cur, unsigned char &seg, unsigned char &jump, unsigned char &last)\n{\n float desttime = (volTable[cur] &0x00FF);\n unsigned char dest = (volTable[cur] &0xFF00) >> 8;\n\n if(dest==0xFB || dest == 0xFD)\n {\n jump = desttime;\n if(cur < volEntries-1)\n {\n cur++;\n desttime = (volTable[cur] &0x00FF);\n dest = (volTable[cur] &0xFF00) >> 8;\n }\n }\n\n unsigned char depth = 0;\n\n while(dest==0xFF || dest == 0xFC || dest == 0xFE)\n {\n depth++;\n if(depth > 64)\n {\n last = 0;\n return 0;\n }\n if(dest == 0xFF)\n {\n cur = desttime;\n } else if (dest == 0xFC)\n {\n jump--;\n if(jump == 0 && cur < volEntries-1)\n cur++;\n else\n cur = desttime;\n } else if (dest == 0xFE)\n {\n cur = desttime+jump;\n }\n\n desttime = (volTable[cur] &0x00FF);\n dest = (volTable[cur] &0xFF00) >> 8;\n seg = 0;\n }\n\n\n if(seg >= desttime)\n {\n seg= 0;\n if(cur < volEntries-1)\n cur++;\n last = dest;\n return last;\n }\n \n\n\n \/\/Interpolate between the last volume and next over the duration\n if(cur >0)\n {\n \/\/interpolate\n last = last + ((static_cast<float>(dest) - last) * (seg\/desttime));\n return last; \n }\n last = dest;\n return last;\n}\n\n\n\nvoid Instrument::fixVolJumps(const unsigned char &index, short difference)\n{\n if(difference == 0)\n return;\n for(unsigned short i = 0; i < volEntries; i++)\n if((volTable[i] & 0xFF00) == 0xFF00)\/\/is jump, correct it\n {\n if(difference > 0)\n {\n unsigned char dest = volTable[i] & 0x00FF;\n if(dest >= index)\n {\n if(dest < 0xFF-difference)\n volTable[i] += difference;\n\n }\n }\n else\n {\n unsigned char dest = volTable[i] & 0xFF;\n if(dest >= index)\n {\n if(dest >= -difference)\n volTable[i] += difference;\n else volTable[i] = 0xFF00;\n\n }\n\n\n }\n }\n}\n\n\nbool Instrument::insertVolEntry(unsigned char index, unsigned short entry)\n{\n if(volEntries == 0xFFFF)\n return false;\n for(unsigned short last = ++volEntries; last > index; last--)\n volTable[last] = volTable[last-1];\n fixVolJumps(index, 1);\n volTable[index] = entry;\n return true;\n}\n\nbool Instrument::removeVolEntry(unsigned char index)\n{\n if(volEntries == 0)\n return false;\n\n for(unsigned short i = index+1; i < volEntries; i++)\n volTable[i-1] = volTable[i];\n fixVolJumps(index, -1);\n volTable[--volEntries] = 0;\n return true;\n}\n\n\n\n\n\n\n<commit_msg>Implemented pulse index changes<commit_after>#include \"instrument.h\"\n\n\nInstrument::Instrument()\n{\n name[0] = 'i';\n name[1] = 'n';\n name[2] = 's';\n name[3] = 't';\n waveIndex = 0;\n volEntries=1;\n volTable = new unsigned short[256];\/\/64 integers worth\n for(int i = 0; i < 256; i++)\n volTable[i]=0;\n volTable[0] = 0x3F00;\n pulseIndex = -1;\n}\n\nInstrument::~Instrument()\n{\n delete [] volTable;\n}\n\nInstrument::Instrument(std::istream &in)\n{\n volTable = NULL;\n input(in);\n}\nInstrument::Instrument(const Instrument &other)\n{\n waveIndex = other.waveIndex;\n volEntries = other.volEntries;\n volTable = new unsigned short[256];\/\/64 integers worth\n for(int i = 0; i < 255; i++)\n volTable[i] = other.volTable[i];\n\n}\n\n\nstd::ostream &Instrument::output(std::ostream &out) const\n{\n out.write(name, 23);\n out.write((char*)&waveIndex, sizeof(short));\n out.write((char*)&pulseIndex, sizeof(short));\n\n out.write((char*)&volEntries,1);\n out.write((char*)volTable, volEntries*2);\n\n return out;\t\n}\n\nstd::istream &Instrument::input(std::istream &in)\n{\n if(volTable)\n delete [] volTable;\n\n in.read(name,23);\n in.read((char*)&waveIndex, sizeof(short));\n in.read((char*)&pulseIndex, sizeof(short));\n in.read((char*)&volEntries, 1);\n volTable = new unsigned short[256];\n in.read((char*)volTable, volEntries*2);\n for(int i = volEntries; i < 256; i++)\n volTable[i] = 0;\n\n return in;\n}\n\nvoid Instrument::setVolTable(unsigned short *table)\n{\n for(int i = 0; i < 256; i++)\n volTable[i] = table[i];\n}\n\nunsigned char Instrument::getVolume(unsigned char &cur, unsigned char &seg, unsigned char &jump, unsigned char &last)\n{\n float desttime = (volTable[cur] &0x00FF);\n unsigned char dest = (volTable[cur] &0xFF00) >> 8;\n\n if(dest==0xFB || dest == 0xFD)\n {\n jump = desttime;\n if(cur < volEntries-1)\n {\n cur++;\n desttime = (volTable[cur] &0x00FF);\n dest = (volTable[cur] &0xFF00) >> 8;\n }\n }\n\n unsigned char depth = 0;\n\n while(dest==0xFF || dest == 0xFC || dest == 0xFE)\n {\n depth++;\n if(depth > 64)\n {\n last = 0;\n return 0;\n }\n if(dest == 0xFF)\n {\n cur = desttime;\n } else if (dest == 0xFC)\n {\n jump--;\n if(jump == 0 && cur < volEntries-1)\n cur++;\n else\n cur = desttime;\n } else if (dest == 0xFE)\n {\n cur = desttime+jump;\n }\n\n desttime = (volTable[cur] &0x00FF);\n dest = (volTable[cur] &0xFF00) >> 8;\n seg = 0;\n }\n\n\n if(seg >= desttime)\n {\n seg= 0;\n if(cur < volEntries-1)\n cur++;\n last = dest;\n return last;\n }\n \n\n\n \/\/Interpolate between the last volume and next over the duration\n if(cur >0)\n {\n \/\/interpolate\n last = last + ((static_cast<float>(dest) - last) * (seg\/desttime));\n return last; \n }\n last = dest;\n return last;\n}\n\n\n\nvoid Instrument::fixVolJumps(const unsigned char &index, short difference)\n{\n if(difference == 0)\n return;\n for(unsigned short i = 0; i < volEntries; i++)\n if((volTable[i] & 0xFF00) == 0xFF00)\/\/is jump, correct it\n {\n if(difference > 0)\n {\n unsigned char dest = volTable[i] & 0x00FF;\n if(dest >= index)\n {\n if(dest < 0xFF-difference)\n volTable[i] += difference;\n\n }\n }\n else\n {\n unsigned char dest = volTable[i] & 0xFF;\n if(dest >= index)\n {\n if(dest >= -difference)\n volTable[i] += difference;\n else volTable[i] = 0xFF00;\n\n }\n\n\n }\n }\n}\n\n\nbool Instrument::insertVolEntry(unsigned char index, unsigned short entry)\n{\n if(volEntries == 0xFFFF)\n return false;\n for(unsigned short last = ++volEntries; last > index; last--)\n volTable[last] = volTable[last-1];\n fixVolJumps(index, 1);\n volTable[index] = entry;\n return true;\n}\n\nbool Instrument::removeVolEntry(unsigned char index)\n{\n if(volEntries == 0)\n return false;\n\n for(unsigned short i = index+1; i < volEntries; i++)\n volTable[i-1] = volTable[i];\n fixVolJumps(index, -1);\n volTable[--volEntries] = 0;\n return true;\n}\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef __se3_crba2_hpp__\n#define __se3_crba_hpp__\n\n#include \"pinocchio\/multibody\/visitor.hpp\"\n#include \"pinocchio\/multibody\/model.hpp\"\n#include <iostream>\n \nnamespace se3\n{\n inline const Eigen::MatrixXd&\n crba(const Model & model, Data& data,\n const Eigen::VectorXd & q);\n\n} \/\/ namespace se3 \n\n\/* --- Details -------------------------------------------------------------------- *\/\nnamespace se3 \n{\n struct CrbaForwardStep : public fusion::JointVisitor<CrbaForwardStep>\n {\n typedef boost::fusion::vector< const se3::Model&,\n\t\t\t\t se3::Data&,\n\t\t\t\t const Eigen::VectorXd &\n\t\t\t\t > ArgsType;\n\n JOINT_VISITOR_INIT(CrbaForwardStep);\n\n template<typename JointModel>\n static void algo(const se3::JointModelBase<JointModel> & jmodel,\n\t\t se3::JointDataBase<typename JointModel::JointData> & jdata,\n\t\t const se3::Model& model,\n\t\t se3::Data& data,\n\t\t const Eigen::VectorXd & q)\n {\n using namespace Eigen;\n using namespace se3;\n\n const typename JointModel::Index & i = jmodel.id();\n jmodel.calc(jdata.derived(),q);\n \n data.liMi[i] = model.jointPlacements[i]*jdata.M();\n data.Ycrb[i] = model.inertias[i];\n }\n\n };\n\n namespace internal \n {\n\n template<typename Mat,typename MatRet, int NCOLS>\n struct ForceSetSe3Action\n {\n \/* Compute jF = jXi * iF, where jXi is the dual action matrix associated\n * with m, and iF, jF are matrices whose columns are forces. The resolution\n * is done by block operation. It is less efficient than the colwise\n * operation and should not be used. *\/ \n static void run( const SE3 & m, \n\t\t const Eigen::MatrixBase<Mat> & iF,\n\t\t Eigen::MatrixBase<MatRet> & jF );\n \/\/ {\n \/\/ typename Mat::template ConstNRowsBlockXpr<3>::Type linear = iF.template topRows<3>();\n \/\/ typename MatRet::template ConstNRowsBlockXpr<3>::Type angular = iF.template bottomRows<3>();\n \n \/\/ jF.template topRows <3>().noalias() = m.rotation()*linear;\n \/\/ jF.template bottomRows<3>().noalias()\n \/\/ \t= skew(m.translation())*jF.template topRows<3>() +\n \/\/ m.rotation()*angular;\n \/\/ }\n \n };\n\n template<typename Mat,typename MatRet>\n struct ForceSetSe3Action<Mat,MatRet,1>\n {\n \/* Compute jF = jXi * iF, where jXi is the dual action matrix associated with m,\n * and iF, jF are vectors. *\/\n static void run( const SE3 & m, \n\t\t const Eigen::MatrixBase<Mat> & iF,\n\t\t Eigen::MatrixBase<MatRet> & jF )\n { \n\tEIGEN_STATIC_ASSERT_VECTOR_ONLY(Mat);\n\tEIGEN_STATIC_ASSERT_VECTOR_ONLY(MatRet);\n\tEigen::VectorBlock<const Mat,3> linear = iF.template head<3>();\n\tEigen::VectorBlock<const Mat,3> angular = iF.template tail<3>();\n\t\n\tjF.template head <3>() = m.rotation()*linear;\n\tjF.template tail <3>() = (m.translation().cross(jF.template head<3>())\n\t\t\t\t + m.rotation()*angular);\n }\n };\n\n template<typename Mat,typename MatRet>\n static void se3Action( const SE3 & m, \n\t\t\t const Eigen::MatrixBase<Mat> & iF,\n\t\t\t Eigen::MatrixBase<MatRet> & jF )\n {\n ForceSetSe3Action<Mat,MatRet,Mat::ColsAtCompileTime>::run(m,iF,jF);\n }\n\n template<typename Mat,typename MatRet,int NCOLS>\n void ForceSetSe3Action<Mat,MatRet,NCOLS>::\n run( const SE3 & m, \n\t const Eigen::MatrixBase<Mat> & iF,\n\t Eigen::MatrixBase<MatRet> & jF )\n {\n for(int col=0;col<jF.cols();++col) \n\t{\n\t typename MatRet::ColXpr jFc = jF.col(col);\n\t se3Action(m,iF.col(col),jFc);\n\t}\n }\n \n } \/\/ namespace internal\n\n struct CrbaBackwardStep : public fusion::JointVisitor<CrbaBackwardStep>\n {\n typedef boost::fusion::vector<const Model&,\n\t\t\t\t Data&> ArgsType;\n \n JOINT_VISITOR_INIT(CrbaBackwardStep);\n\n template<typename JointModel>\n static void algo(const JointModelBase<JointModel> & jmodel,\n\t\t JointDataBase<typename JointModel::JointData> & jdata,\n\t\t const Model& model,\n\t\t Data& data)\n {\n \/*\n * F[1:6,i] = Y*S\n * M[i,SUBTREE] = S'*F[1:6,SUBTREE]\n * if li>0 \n * Yli += liXi Yi\n * F[1:6,SUBTREE] = liXi F[1:6,SUBTREE]\n *\/\n const Model::Index & i = jmodel.id();\n\n \/* F[1:6,i] = Y*S *\/\n data.Fcrb[i].block<6,JointModel::NV>(0,jmodel.idx_v()) = data.Ycrb[i] * jdata.S();\n\n \/* M[i,SUBTREE] = S'*F[1:6,SUBTREE] *\/\n data.M.block(jmodel.idx_v(),jmodel.idx_v(),jmodel.nv(),data.nvSubtree[i]) \n\t= jdata.S().transpose()*data.Fcrb[i].block(0,jmodel.idx_v(),6,data.nvSubtree[i]);\n\n const Model::Index & parent = model.parents[i];\n if(parent>0) \n\t{\n\t \/* Yli += liXi Yi *\/\n \t data.Ycrb[parent] += data.liMi[i].act(data.Ycrb[i]);\n\n\t \/* F[1:6,SUBTREE] = liXi F[1:6,SUBTREE] *\/\n\t Eigen::Block<typename Data::Matrix6x> jF\n\t = data.Fcrb[parent].block(0,jmodel.idx_v(),6,data.nvSubtree[i]);\n \t internal::se3Action(data.liMi[i],\n\t\t\t data.Fcrb[i].block(0,jmodel.idx_v(),6,data.nvSubtree[i]),\n\t\t\t jF);\n\t}\n \n \/\/ std::cout << \"iYi = \" << (Inertia::Matrix6)data.Ycrb[i] << std::endl;\n \/\/ std::cout << \"iSi = \" << ConstraintXd(jdata.S()).matrix() << std::endl;\n \/\/ std::cout << \"liFi = \" << jdata.F() << std::endl;\n \/\/ std::cout << \"M = \" << data.M << std::endl;\n }\n };\n\n inline const Eigen::MatrixXd&\n crba(const Model & model, Data& data,\n const Eigen::VectorXd & q)\n {\n for( int i=1;i<model.nbody;++i )\n {\n\tCrbaForwardStep::run(model.joints[i],data.joints[i],\n\t\t\t CrbaForwardStep::ArgsType(model,data,q));\n }\n \n for( int i=model.nbody-1;i>0;--i )\n {\n\tCrbaBackwardStep::run(model.joints[i],data.joints[i],\n\t\t\t CrbaBackwardStep::ArgsType(model,data));\n }\n\n return data.M;\n }\n} \/\/ namespace se3\n\n#endif \/\/ ifndef __se3_crba_hpp__\n\n<commit_msg>Modified CRBA to link properly with the new act-on-set. Timings untouched (4.5us).<commit_after>#ifndef __se3_crba_hpp__\n#define __se3_crba_hpp__\n\n#include \"pinocchio\/multibody\/visitor.hpp\"\n#include \"pinocchio\/multibody\/model.hpp\"\n#include \"pinocchio\/spatial\/act-on-set.hpp\"\n\n#include <iostream>\n \nnamespace se3\n{\n inline const Eigen::MatrixXd&\n crba(const Model & model, Data& data,\n const Eigen::VectorXd & q);\n\n} \/\/ namespace se3 \n\n\/* --- Details -------------------------------------------------------------------- *\/\nnamespace se3 \n{\n struct CrbaForwardStep : public fusion::JointVisitor<CrbaForwardStep>\n {\n typedef boost::fusion::vector< const se3::Model&,\n\t\t\t\t se3::Data&,\n\t\t\t\t const Eigen::VectorXd &\n\t\t\t\t > ArgsType;\n\n JOINT_VISITOR_INIT(CrbaForwardStep);\n\n template<typename JointModel>\n static void algo(const se3::JointModelBase<JointModel> & jmodel,\n\t\t se3::JointDataBase<typename JointModel::JointData> & jdata,\n\t\t const se3::Model& model,\n\t\t se3::Data& data,\n\t\t const Eigen::VectorXd & q)\n {\n using namespace Eigen;\n using namespace se3;\n\n const typename JointModel::Index & i = jmodel.id();\n jmodel.calc(jdata.derived(),q);\n \n data.liMi[i] = model.jointPlacements[i]*jdata.M();\n data.Ycrb[i] = model.inertias[i];\n }\n\n };\n\n struct CrbaBackwardStep : public fusion::JointVisitor<CrbaBackwardStep>\n {\n typedef boost::fusion::vector<const Model&,\n\t\t\t\t Data&> ArgsType;\n \n JOINT_VISITOR_INIT(CrbaBackwardStep);\n\n template<typename JointModel>\n static void algo(const JointModelBase<JointModel> & jmodel,\n\t\t JointDataBase<typename JointModel::JointData> & jdata,\n\t\t const Model& model,\n\t\t Data& data)\n {\n \/*\n * F[1:6,i] = Y*S\n * M[i,SUBTREE] = S'*F[1:6,SUBTREE]\n * if li>0 \n * Yli += liXi Yi\n * F[1:6,SUBTREE] = liXi F[1:6,SUBTREE]\n *\/\n const Model::Index & i = jmodel.id();\n\n \/* F[1:6,i] = Y*S *\/\n data.Fcrb[i].block<6,JointModel::NV>(0,jmodel.idx_v()) = data.Ycrb[i] * jdata.S();\n\n \/* M[i,SUBTREE] = S'*F[1:6,SUBTREE] *\/\n data.M.block(jmodel.idx_v(),jmodel.idx_v(),jmodel.nv(),data.nvSubtree[i]) \n\t= jdata.S().transpose()*data.Fcrb[i].block(0,jmodel.idx_v(),6,data.nvSubtree[i]);\n\n const Model::Index & parent = model.parents[i];\n if(parent>0) \n\t{\n\t \/* Yli += liXi Yi *\/\n \t data.Ycrb[parent] += data.liMi[i].act(data.Ycrb[i]);\n\n\t \/* F[1:6,SUBTREE] = liXi F[1:6,SUBTREE] *\/\n\t Eigen::Block<typename Data::Matrix6x> jF\n\t = data.Fcrb[parent].block(0,jmodel.idx_v(),6,data.nvSubtree[i]);\n \t forceSet::se3Action(data.liMi[i],\n\t\t\t data.Fcrb[i].block(0,jmodel.idx_v(),6,data.nvSubtree[i]),\n\t\t\t jF);\n\t}\n \n \/\/ std::cout << \"iYi = \" << (Inertia::Matrix6)data.Ycrb[i] << std::endl;\n \/\/ std::cout << \"iSi = \" << ConstraintXd(jdata.S()).matrix() << std::endl;\n \/\/ std::cout << \"liFi = \" << jdata.F() << std::endl;\n \/\/ std::cout << \"M = \" << data.M << std::endl;\n }\n };\n\n inline const Eigen::MatrixXd&\n crba(const Model & model, Data& data,\n const Eigen::VectorXd & q)\n {\n for( int i=1;i<model.nbody;++i )\n {\n\tCrbaForwardStep::run(model.joints[i],data.joints[i],\n\t\t\t CrbaForwardStep::ArgsType(model,data,q));\n }\n \n for( int i=model.nbody-1;i>0;--i )\n {\n\tCrbaBackwardStep::run(model.joints[i],data.joints[i],\n\t\t\t CrbaBackwardStep::ArgsType(model,data));\n }\n\n return data.M;\n }\n} \/\/ namespace se3\n\n#endif \/\/ ifndef __se3_crba_hpp__\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ i8255.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 01\/08\/2017.\n\/\/ Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef i8255_hpp\n#define i8255_hpp\n\nnamespace Intel {\nnamespace i8255 {\n\nclass PortHandler {\n\tpublic:\n\t\tvoid set_value(int port, uint8_t value) {}\n\t\tuint8_t get_value(int port) { return 0xff; }\n};\n\n\/\/ TODO: most of the implementation below. Right now it just blindly passes data in all directions,\n\/\/ ignoring operation mode. But at least it establishes proper ownership and hand-off of decision making.\ntemplate <class T> class i8255 {\n\tpublic:\n\t\ti8255(T &port_handler) : control_(0), outputs_{0, 0, 0}, port_handler_(port_handler) {}\n\n\t\tvoid set_register(int address, uint8_t value) {\n\t\t\tswitch(address & 3) {\n\t\t\t\tcase 0:\toutputs_[0] = value; port_handler_.set_value(0, value);\tbreak;\n\t\t\t\tcase 1:\toutputs_[1] = value; port_handler_.set_value(1, value);\tbreak;\n\t\t\t\tcase 2:\toutputs_[2] = value; port_handler_.set_value(2, value);\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tif(value & 0x80) {\n\t\t\t\t\t\tcontrol_ = value;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif(value & 1) {\n\t\t\t\t\t\t\toutputs_[2] |= 1 << ((value >> 1)&7);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\toutputs_[2] &= ~(1 << ((value >> 1)&7));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tupdate_outputs();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tuint8_t get_register(int address) {\n\t\t\tswitch(address & 3) {\n\t\t\t\tcase 0:\treturn port_handler_.get_value(0);\n\t\t\t\tcase 1:\treturn port_handler_.get_value(1);\n\t\t\t\tcase 2:\treturn port_handler_.get_value(2);\n\t\t\t\tcase 3:\treturn control_;\n\t\t\t}\n\t\t\treturn 0xff;\n\t\t}\n\n\tprivate:\n\t\tvoid update_outputs() {\n\t\t\tport_handler_.set_value(0, outputs_[0]);\n\t\t\tport_handler_.set_value(1, outputs_[1]);\n\t\t\tport_handler_.set_value(2, outputs_[2]);\n\t\t}\n\n\t\tuint8_t control_;\n\t\tuint8_t outputs_[3];\n\t\tT &port_handler_;\n};\n\n}\n}\n\n#endif \/* i8255_hpp *\/\n<commit_msg>Added port direction tests.<commit_after>\/\/\n\/\/ i8255.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 01\/08\/2017.\n\/\/ Copyright © 2017 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef i8255_hpp\n#define i8255_hpp\n\nnamespace Intel {\nnamespace i8255 {\n\nclass PortHandler {\n\tpublic:\n\t\tvoid set_value(int port, uint8_t value) {}\n\t\tuint8_t get_value(int port) { return 0xff; }\n};\n\n\/\/ TODO: most of the implementation below. Right now it just blindly passes data in all directions,\n\/\/ ignoring operation mode. But at least it establishes proper ownership and hand-off of decision making.\ntemplate <class T> class i8255 {\n\tpublic:\n\t\ti8255(T &port_handler) : control_(0), outputs_{0, 0, 0}, port_handler_(port_handler) {}\n\n\t\tvoid set_register(int address, uint8_t value) {\n\t\t\tswitch(address & 3) {\n\t\t\t\tcase 0:\toutputs_[0] = value; port_handler_.set_value(0, value);\tbreak;\n\t\t\t\tcase 1:\toutputs_[1] = value; port_handler_.set_value(1, value);\tbreak;\n\t\t\t\tcase 2:\toutputs_[2] = value; port_handler_.set_value(2, value);\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tif(value & 0x80) {\n\t\t\t\t\t\tcontrol_ = value;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif(value & 1) {\n\t\t\t\t\t\t\toutputs_[2] |= 1 << ((value >> 1)&7);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\toutputs_[2] &= ~(1 << ((value >> 1)&7));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tupdate_outputs();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tuint8_t get_register(int address) {\n\t\t\tswitch(address & 3) {\n\t\t\t\tcase 0:\treturn (control_ & 0x10) ? port_handler_.get_value(0) : outputs_[0];\n\t\t\t\tcase 1:\treturn (control_ & 0x02) ? port_handler_.get_value(1) : outputs_[1];\n\t\t\t\tcase 2:\t{\n\t\t\t\t\tif(!(control_ & 0x09)) return outputs_[2];\n\t\t\t\t\tuint8_t input = port_handler_.get_value(2);\n\t\t\t\t\treturn ((control_ & 0x01) ? (input & 0x0f) : (outputs_[2] & 0x0f)) | ((control_ & 0x08) ? (input & 0xf0) : (outputs_[2] & 0xf0));\n\t\t\t\t}\n\t\t\t\tcase 3:\treturn control_;\n\t\t\t}\n\t\t\treturn 0xff;\n\t\t}\n\n\tprivate:\n\t\tvoid update_outputs() {\n\t\t\tport_handler_.set_value(0, outputs_[0]);\n\t\t\tport_handler_.set_value(1, outputs_[1]);\n\t\t\tport_handler_.set_value(2, outputs_[2]);\n\t\t}\n\n\t\tuint8_t control_;\n\t\tuint8_t outputs_[3];\n\t\tT &port_handler_;\n};\n\n}\n}\n\n#endif \/* i8255_hpp *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"VMusic.h\"\n#include \"VInterpolate.h\"\n\nVMusic::VMusic() {}\nVMusic::~VMusic() {}\n\n\/**\n* Opens music data from file.\n*\/\nVMusic* VMusic::OpenMusicFile(const sf::String& filename)\n{\n\tif (music.openFromFile(filename))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn nullptr;\n}\n\n\/**\n* Opens music data from memory.\n*\/\nVMusic* VMusic::OpenMusicMemory(const void* data, size_t size)\n{\n\tif (music.openFromMemory(data, size))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn NULL;\n}\n\n\/**\n* Opens music data from a stream.\n*\/\nVMusic* VMusic::OpenMusicStream(sf::InputStream& stream)\n{\n\tif (music.openFromStream(stream))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn NULL;\n}\n\nvoid VMusic::Update(float dt)\n{\n\tif (!valid)\n\t\treturn;\n\n\tif (Status() == music.Playing)\n\t{\n\t\tif (fadein)\n\t\t{\n\t\t\tfadeTimer += dt \/ fadeTime;\n\t\t\tmusic.setVolume(VInterpolate::Float(startVolume, finishVolume, fadeTimer) * (masterVolume \/ 100.0f));\n\n\t\t\tif (fadeTimer > 1.0f)\n\t\t\t{\n\t\t\t\tfadein = false;\n\t\t\t\tfadeTimer = 0;\n\t\t\t}\n\t\t}\n\n\t\tif (fadeout)\n\t\t{\n\t\t\tfadeTimer += dt \/ fadeTime;\n\t\t\tmusic.setVolume(VInterpolate::Float(startVolume, finishVolume, fadeTimer) * (masterVolume \/ 100.0f));\n\n\t\t\tif (fadeTimer > 1.0f)\n\t\t\t{\n\t\t\t\tfadeout = false;\n\t\t\t\tfadeTimer = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tfadein = false;\n\t\tfadeout = false;\n\t}\n}\n\nvoid VMusic::Play()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.play();\n}\n\nvoid VMusic::Pause()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.pause();\n}\n\nvoid VMusic::Stop()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.stop();\n}\n\nvoid VMusic::Fade(bool fadeIn, float fadeLength, float maxVolume, float minVolume)\n{\n\tif ((fadeIn && !fadein) || (!fadeIn && !fadeout))\n\t{\n\t\tfadeTime = fadeLength;\n\t\tfadeTimer = 0;\n\n\t\tif (fadeIn)\n\t\t{\n\t\t\tstartVolume = minVolume;\n\t\t\tfinishVolume = maxVolume;\n\t\t\tfadein = true;\n\t\t\tfadeout = false;\n\t\t\tmusic.setVolume(minVolume * (masterVolume \/ 100.0f));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstartVolume = maxVolume;\n\t\t\tfinishVolume = minVolume;\n\t\t\tfadein = false;\n\t\t\tfadeout = true;\n\t\t\tmusic.setVolume(maxVolume * (masterVolume \/ 100.0f));\n\t\t}\n\t}\n}\n\nsf::Time VMusic::Duration() \n{\n\tif (!valid)\n\t\treturn sf::Time::Zero;\n\n\treturn music.getDuration();\n}\n\nunsigned int VMusic::ChannelCount() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getChannelCount();\n}\n\nunsigned int VMusic::SampleRate() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getSampleRate();\n}\n\nsf::SoundStream::Status VMusic::Status() \n{\n\tif (!valid)\n\t\treturn sf::SoundStream::Stopped;\n\n\treturn music.getStatus();\n}\n\nfloat VMusic::Attenuation() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getAttenuation();\n}\n\nbool VMusic::Loop()\n{\n\tif (!valid)\n\t\treturn false;\n\n\treturn music.getLoop();\n}\n\nfloat VMusic::Pitch()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getPitch();\n}\n\nfloat VMusic::Volume()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn masterVolume;\n}\n\nsf::Vector3f VMusic::Position()\n{\n\tif (!valid)\n\t\treturn sf::Vector3f();\n\n\treturn music.getPosition();\n}\n\nbool VMusic::RelativeToListener()\n{\n\tif (!valid)\n\t\treturn false;\n\n\treturn music.isRelativeToListener();\n}\n\nfloat VMusic::MinDistance()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getMinDistance();\n}\n\nfloat VMusic::PlayOffset()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getPlayingOffset().asSeconds();\n}\n\nvoid VMusic::SetAttenuation(float attenuation)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setAttenuation(attenuation);\n}\n\nvoid VMusic::SetLoop(bool loop, float loopStart, float loopEnd)\n{\n\tif (!valid)\n\t\treturn;\n\n\t\/*looping = loop;\n\tloopStartPoint = loopStart;\n\tif (loopEnd == 0)\n\t\tloopEndPoint = music.getDuration().asSeconds();*\/\n\n\tsf::Music::TimeSpan timespan = sf::Music::TimeSpan(sf::seconds(loopStart), sf::seconds(loopEnd - loopStart));\t\n\tmusic.setLoopPoints(timespan);\n\tmusic.setLoop(loop);\n}\n\nvoid VMusic::SetPitch(float pitch)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPitch(pitch);\n}\n\nvoid VMusic::SetVolume(float volume)\n{\n\tif (volume < 0)\n\t\tvolume = 0;\n\n\tmasterVolume = volume;\n\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setVolume(masterVolume);\n}\n\nvoid VMusic::SetPosition(float x, float y, float z)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPosition(x, y, z);\n}\n\nvoid VMusic::SetPosition(const sf::Vector3f& position)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPosition(position);\n}\n\nvoid VMusic::SetRelativeToListener(bool relative)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setRelativeToListener(relative);\n}\n\nvoid VMusic::SetMinDistance(float distance)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setMinDistance(distance);\n}\n\nvoid VMusic::SetPlayOffset(float offset)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPlayingOffset(sf::seconds(offset));\n}<commit_msg>Prevent loop points if end point is zero.<commit_after>#include \"VMusic.h\"\n#include \"VInterpolate.h\"\n\nVMusic::VMusic() {}\nVMusic::~VMusic() {}\n\n\/**\n* Opens music data from file.\n*\/\nVMusic* VMusic::OpenMusicFile(const sf::String& filename)\n{\n\tif (music.openFromFile(filename))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn nullptr;\n}\n\n\/**\n* Opens music data from memory.\n*\/\nVMusic* VMusic::OpenMusicMemory(const void* data, size_t size)\n{\n\tif (music.openFromMemory(data, size))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn NULL;\n}\n\n\/**\n* Opens music data from a stream.\n*\/\nVMusic* VMusic::OpenMusicStream(sf::InputStream& stream)\n{\n\tif (music.openFromStream(stream))\n\t{\n\t\tmusic.setVolume(masterVolume);\n\t\tvalid = true;\n\t\treturn this;\n\t}\n\n\tvalid = false;\n\treturn NULL;\n}\n\nvoid VMusic::Update(float dt)\n{\n\tif (!valid)\n\t\treturn;\n\n\tif (Status() == music.Playing)\n\t{\n\t\tif (fadein)\n\t\t{\n\t\t\tfadeTimer += dt \/ fadeTime;\n\t\t\tmusic.setVolume(VInterpolate::Float(startVolume, finishVolume, fadeTimer) * (masterVolume \/ 100.0f));\n\n\t\t\tif (fadeTimer > 1.0f)\n\t\t\t{\n\t\t\t\tfadein = false;\n\t\t\t\tfadeTimer = 0;\n\t\t\t}\n\t\t}\n\n\t\tif (fadeout)\n\t\t{\n\t\t\tfadeTimer += dt \/ fadeTime;\n\t\t\tmusic.setVolume(VInterpolate::Float(startVolume, finishVolume, fadeTimer) * (masterVolume \/ 100.0f));\n\n\t\t\tif (fadeTimer > 1.0f)\n\t\t\t{\n\t\t\t\tfadeout = false;\n\t\t\t\tfadeTimer = 0;\n\t\t\t}\n\t\t}\n\t}\n\telse\n\t{\n\t\tfadein = false;\n\t\tfadeout = false;\n\t}\n}\n\nvoid VMusic::Play()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.play();\n}\n\nvoid VMusic::Pause()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.pause();\n}\n\nvoid VMusic::Stop()\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.stop();\n}\n\nvoid VMusic::Fade(bool fadeIn, float fadeLength, float maxVolume, float minVolume)\n{\n\tif ((fadeIn && !fadein) || (!fadeIn && !fadeout))\n\t{\n\t\tfadeTime = fadeLength;\n\t\tfadeTimer = 0;\n\n\t\tif (fadeIn)\n\t\t{\n\t\t\tstartVolume = minVolume;\n\t\t\tfinishVolume = maxVolume;\n\t\t\tfadein = true;\n\t\t\tfadeout = false;\n\t\t\tmusic.setVolume(minVolume * (masterVolume \/ 100.0f));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstartVolume = maxVolume;\n\t\t\tfinishVolume = minVolume;\n\t\t\tfadein = false;\n\t\t\tfadeout = true;\n\t\t\tmusic.setVolume(maxVolume * (masterVolume \/ 100.0f));\n\t\t}\n\t}\n}\n\nsf::Time VMusic::Duration() \n{\n\tif (!valid)\n\t\treturn sf::Time::Zero;\n\n\treturn music.getDuration();\n}\n\nunsigned int VMusic::ChannelCount() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getChannelCount();\n}\n\nunsigned int VMusic::SampleRate() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getSampleRate();\n}\n\nsf::SoundStream::Status VMusic::Status() \n{\n\tif (!valid)\n\t\treturn sf::SoundStream::Stopped;\n\n\treturn music.getStatus();\n}\n\nfloat VMusic::Attenuation() \n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getAttenuation();\n}\n\nbool VMusic::Loop()\n{\n\tif (!valid)\n\t\treturn false;\n\n\treturn music.getLoop();\n}\n\nfloat VMusic::Pitch()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getPitch();\n}\n\nfloat VMusic::Volume()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn masterVolume;\n}\n\nsf::Vector3f VMusic::Position()\n{\n\tif (!valid)\n\t\treturn sf::Vector3f();\n\n\treturn music.getPosition();\n}\n\nbool VMusic::RelativeToListener()\n{\n\tif (!valid)\n\t\treturn false;\n\n\treturn music.isRelativeToListener();\n}\n\nfloat VMusic::MinDistance()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getMinDistance();\n}\n\nfloat VMusic::PlayOffset()\n{\n\tif (!valid)\n\t\treturn 0;\n\n\treturn music.getPlayingOffset().asSeconds();\n}\n\nvoid VMusic::SetAttenuation(float attenuation)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setAttenuation(attenuation);\n}\n\nvoid VMusic::SetLoop(bool loop, float loopStart, float loopEnd)\n{\n\tif (!valid)\n\t\treturn;\n\n\t\/*looping = loop;\n\tloopStartPoint = loopStart;\n\tif (loopEnd == 0)\n\t\tloopEndPoint = music.getDuration().asSeconds();*\/\n\n\tif (loopEnd != 0)\n\t{\n\t\tsf::Music::TimeSpan timespan = sf::Music::TimeSpan(sf::seconds(loopStart), sf::seconds(loopEnd - loopStart));\n\t\tmusic.setLoopPoints(timespan);\n\t}\n\n\tmusic.setLoop(loop);\n}\n\nvoid VMusic::SetPitch(float pitch)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPitch(pitch);\n}\n\nvoid VMusic::SetVolume(float volume)\n{\n\tif (volume < 0)\n\t\tvolume = 0;\n\n\tmasterVolume = volume;\n\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setVolume(masterVolume);\n}\n\nvoid VMusic::SetPosition(float x, float y, float z)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPosition(x, y, z);\n}\n\nvoid VMusic::SetPosition(const sf::Vector3f& position)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPosition(position);\n}\n\nvoid VMusic::SetRelativeToListener(bool relative)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setRelativeToListener(relative);\n}\n\nvoid VMusic::SetMinDistance(float distance)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setMinDistance(distance);\n}\n\nvoid VMusic::SetPlayOffset(float offset)\n{\n\tif (!valid)\n\t\treturn;\n\n\tmusic.setPlayingOffset(sf::seconds(offset));\n}<|endoftext|>"} {"text":"<commit_before>#include \"VectorDefiner.h\"\n#include <algorithm>\n#include <cctype>\n\n#include <iostream>\n#include <fstream>\n\n\/\/yes\nVectorDefiner::VectorDefiner()\n{\n\tthis->eqr = NULL;\n\tthis->vectors = NULL;\n}\n\n\nVectorDefiner::~VectorDefiner()\n{\n\tdelete this->eqr;\n\tdelete this->vectors;\n}\n\nvoid VectorDefiner::give_input(std::string str){\n\t\/\/supposedly removes whitespace from the string, effectively trimming it\n\tstd::string* mystr = new std::string(str);\n\tmystr->erase(std::remove_if(mystr->begin(), mystr->end(), isspace), mystr->end());\n\tthis->is_file = false;\n\tswitch(str[0]){\n\t\tcase 'a':\n\t\tcase 'b':\n\t\tcase 'c':\n\t\tcase 'd':\n\t\tcase 'e':\n\t\tcase 'f':\n\t\tcase 'g':\n\t\tcase 'h':\n\t\tcase 'i':\n\t\tcase 'j':\n\t\tcase 'k':\n\t\tcase 'l':\n\t\tcase 'm':\n\t\tcase 'n':\n\t\tcase 'o':\n\t\tcase 'p':\n\t\tcase 'q':\n\t\tcase 'r':\n\t\tcase 's':\n\t\tcase 't':\n\t\tcase 'u':\n\t\tcase 'v':\n\t\tcase 'w':\n\t\tcase 'x':\n\t\tcase 'y':\n\t\tcase 'z':\n\t\tcase 'A':\n\t\tcase 'B':\n\t\tcase 'C':\n\t\tcase 'D':\n\t\tcase 'E':\n\t\tcase 'F':\n\t\tcase 'G':\n\t\tcase 'H':\n\t\tcase 'I':\n\t\tcase 'J':\n\t\tcase 'K':\n\t\tcase 'L':\n\t\tcase 'M':\n\t\tcase 'N':\n\t\tcase 'O':\n\t\tcase 'P':\n\t\tcase 'Q':\n\t\tcase 'R':\n\t\tcase 'S':\n\t\tcase 'T':\n\t\tcase 'U':\n\t\tcase 'V':\n\t\tcase 'W':\n\t\tcase 'X':\n\t\tcase 'Y':\n\t\tcase 'Z':\n\t\tcase '~':\n\t\tcase '\/':\n\t\t\tthis->is_file = true;\n\t}\n\t\n\tif(this->is_file){\n\t\tthis->filename = mystr;\n\t}else{\n\t\tequation_factory eqrf;\n\t\tthis->eqr = eqrf.vector_equation(str);\n\t}\n\n}\n\nvoid VectorDefiner::populate(std::vector<vector3d*>* space){\n\tif(this->is_file){\n\t\t\/\/I mean, Ideally, the file would be formatted as: x_space,y_space,z_space,x_vector,y_vector,z_vector\\n\n\t\t\/\/I can deal with whitespace, actually\n\t\t\/\/std::string the_file = *(this->filename);\t\n\t\tstd::string line;\n\t\tstd::ifstream csv(this->filename->c_str());\n\t\tif(csv.is_open()){\n\t\t\twhile(std::getline(csv, line)){\n\t\t\t\t\/\/line has the data inside of it now. like a civilized language and library should\n\t\t\t\t\n\t\t\t}\n\t\t\tcsv.close();\/\/be polite\n\t\t}\n\t}else{\n\t\tfloat* f = new float[3];\n\t\t\t\n\t\tif(this->vectors != NULL){\n\t\t\tdelete this->vectors;\n\t\t}\n\t\tthis->vectors = new std::vector<vector3d*>();\n\t\n\t\tfor(unsigned int i=0; i<space->size(); ++i){\n\t\t\tfloat* temp = space->at(i)->xyz(); \/\/ get the spacial point\n\t\t\tf = eqr->eval(temp[0],temp[1],temp[2],f); \/\/eval field at that point\n\t\t\tvector3d* vvv = new vector3d(f[0],f[1],f[2]); \/\/make new vector to represent vector at that point in field\n\t\t\tthis->vectors->push_back(vvv); \/\/add it to out list of vectors\n\t\t}\n\n\t\tdelete f;\n\t}\n}\n\nstd::vector<vector3d*>* VectorDefiner::cull_vectors(float xmin, float xmax, float ymin, float ymax, float zmin, float zmax){\n\tstd::vector<vector3d*>* vec = new std::vector<vector3d*>();\n\n\tfor(unsigned int i=0; i<this->vectors->size(); ++i){\n\t\tvector3d* v = this->vectors->at(i);\n\t\tfloat* f = v->xyz();\n\t\tif(xmin < f[0] && f[0] < xmax){\n\t\t\tif(ymin < f[1] && f[1] < ymax){\n\t\t\t\tif(zmin < f[2] && f[2] < zmax){\n\t\t\t\t\tvec->push_back(v); \/\/vector is in bounds, yay!\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn vec;\n}\n\nstd::vector<vector3d*>* VectorDefiner::cull_space(std::vector<vector3d*>* space, float xmin, float xmax, float ymin, float ymax, float zmin, float zmax){\n\tstd::vector<vector3d*>* vec = new std::vector<vector3d*>();\n\n\tfor(unsigned int i=0; i<this->vectors->size(); ++i){\n\t\tvector3d* v = this->vectors->at(i);\n\t\tvector3d* space_v = space->at(i);\n\t\tfloat* f = v->xyz();\n\t\tif(xmin < f[0] && f[0] < xmax){\n\t\t\tif(ymin < f[1] && f[1] < ymax){\n\t\t\t\tif(zmin < f[2] && f[2] < zmax){\n\t\t\t\t\tvec->push_back(space_v); \/\/vector is in bounds, yay!\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn vec;\n}\n\n\/*void VectorDefiner::Define(char input[50], struct node nodes[NODE_MAX][NODE_MAX][NODE_MAX])\n{\n\n}*\/\n<commit_msg>So, VectorDefiner no longer has a memory leak. But same time, still needs to read from CSV file properly.<commit_after>#include \"VectorDefiner.h\"\n#include <algorithm>\n#include <cctype>\n\n#include <iostream>\n#include <fstream>\n\n\/\/yes\nVectorDefiner::VectorDefiner()\n{\n\tthis->eqr = NULL;\n\tthis->vectors = NULL;\n\tthis->is_file = false;\n}\n\n\nVectorDefiner::~VectorDefiner()\n{\n\tdelete this->eqr;\n\tdelete this->vectors;\n}\n\nvoid VectorDefiner::give_input(std::string str){\n\t\/\/supposedly removes whitespace from the string, effectively trimming it\n\tstd::string* mystr = new std::string(str);\n\tmystr->erase(std::remove_if(mystr->begin(), mystr->end(), isspace), mystr->end());\n\tthis->is_file = false;\n\tswitch(str[0]){\n\t\tcase 'a':\n\t\tcase 'b':\n\t\tcase 'c':\n\t\tcase 'd':\n\t\tcase 'e':\n\t\tcase 'f':\n\t\tcase 'g':\n\t\tcase 'h':\n\t\tcase 'i':\n\t\tcase 'j':\n\t\tcase 'k':\n\t\tcase 'l':\n\t\tcase 'm':\n\t\tcase 'n':\n\t\tcase 'o':\n\t\tcase 'p':\n\t\tcase 'q':\n\t\tcase 'r':\n\t\tcase 's':\n\t\tcase 't':\n\t\tcase 'u':\n\t\tcase 'v':\n\t\tcase 'w':\n\t\tcase 'x':\n\t\tcase 'y':\n\t\tcase 'z':\n\t\tcase 'A':\n\t\tcase 'B':\n\t\tcase 'C':\n\t\tcase 'D':\n\t\tcase 'E':\n\t\tcase 'F':\n\t\tcase 'G':\n\t\tcase 'H':\n\t\tcase 'I':\n\t\tcase 'J':\n\t\tcase 'K':\n\t\tcase 'L':\n\t\tcase 'M':\n\t\tcase 'N':\n\t\tcase 'O':\n\t\tcase 'P':\n\t\tcase 'Q':\n\t\tcase 'R':\n\t\tcase 'S':\n\t\tcase 'T':\n\t\tcase 'U':\n\t\tcase 'V':\n\t\tcase 'W':\n\t\tcase 'X':\n\t\tcase 'Y':\n\t\tcase 'Z':\n\t\tcase '~':\n\t\tcase '\/':\n\t\t\tthis->is_file = true;\n\t}\n\t\n\tif(this->is_file){\n\t\tthis->filename = mystr;\n\t}else{\n\t\tdelete mystr;\n\t\tequation_factory eqrf;\n\t\tthis->eqr = eqrf.vector_equation(str);\n\t}\n\n}\n\nvoid VectorDefiner::populate(std::vector<vector3d*>* space){\n\tif(this->is_file){\n\t\t\/\/I mean, Ideally, the file would be formatted as: x_space,y_space,z_space,x_vector,y_vector,z_vector\\n\n\t\t\/\/I can deal with whitespace, actually\n\t\t\/\/std::string the_file = *(this->filename);\t\n\t\tstd::string line;\n\t\tstd::ifstream csv(this->filename->c_str());\n\t\tif(csv.is_open()){\n\t\t\twhile(std::getline(csv, line)){\n\t\t\t\t\/\/line has the data inside of it now. like a civilized language and library should\n\t\t\t\t\n\t\t\t}\n\t\t\tcsv.close();\/\/be polite\n\t\t}\n\t}else{\n\t\tfloat* f = new float[3];\n\t\t\t\n\t\tif(this->vectors != NULL){\n\t\t\tdelete this->vectors;\n\t\t}\n\t\tthis->vectors = new std::vector<vector3d*>();\n\t\n\t\tfor(unsigned int i=0; i<space->size(); ++i){\n\t\t\tfloat* temp = space->at(i)->xyz(); \/\/ get the spacial point\n\t\t\tf = eqr->eval(temp[0],temp[1],temp[2],f); \/\/eval field at that point\n\t\t\tvector3d* vvv = new vector3d(f[0],f[1],f[2]); \/\/make new vector to represent vector at that point in field\n\t\t\tthis->vectors->push_back(vvv); \/\/add it to out list of vectors\n\t\t}\n\n\t\tdelete f;\n\t}\n}\n\nstd::vector<vector3d*>* VectorDefiner::cull_vectors(float xmin, float xmax, float ymin, float ymax, float zmin, float zmax){\n\tstd::vector<vector3d*>* vec = new std::vector<vector3d*>();\n\n\tfor(unsigned int i=0; i<this->vectors->size(); ++i){\n\t\tvector3d* v = this->vectors->at(i);\n\t\tfloat* f = v->xyz();\n\t\tif(xmin < f[0] && f[0] < xmax){\n\t\t\tif(ymin < f[1] && f[1] < ymax){\n\t\t\t\tif(zmin < f[2] && f[2] < zmax){\n\t\t\t\t\tvec->push_back(v); \/\/vector is in bounds, yay!\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn vec;\n}\n\nstd::vector<vector3d*>* VectorDefiner::cull_space(std::vector<vector3d*>* space, float xmin, float xmax, float ymin, float ymax, float zmin, float zmax){\n\tstd::vector<vector3d*>* vec = new std::vector<vector3d*>();\n\n\tfor(unsigned int i=0; i<this->vectors->size(); ++i){\n\t\tvector3d* v = this->vectors->at(i);\n\t\tvector3d* space_v = space->at(i);\n\t\tfloat* f = v->xyz();\n\t\tif(xmin < f[0] && f[0] < xmax){\n\t\t\tif(ymin < f[1] && f[1] < ymax){\n\t\t\t\tif(zmin < f[2] && f[2] < zmax){\n\t\t\t\t\tvec->push_back(space_v); \/\/vector is in bounds, yay!\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn vec;\n}\n\n\/*void VectorDefiner::Define(char input[50], struct node nodes[NODE_MAX][NODE_MAX][NODE_MAX])\n{\n\n}*\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014, Juan Carlos Rueda (juancarlosrueda@icloud.com) All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the skywarp++ or skywarp_cpp Project nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL JUAN CARLOS RUEDA BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include <json\/json.h>\n#include <iostream>\n#include <exception>\n\n#include \"JsonSerializer.h\"\n\nnamespace skywarp {\n\n JsonSerializer::JsonSerializer() {\n }\n\n JsonSerializer::~JsonSerializer() {\n }\n\n string JsonSerializer::serializeRPCResult(string requestId, Json::Value appMessage) {\n try {\n Json::Value JsonRPCResult = generateResultEnvelope(requestId, appMessage);\n Json::FastWriter writer;\n string serializedJsonRPCResult = writer.write(JsonRPCResult);\n return serializedJsonRPCResult;\n } catch (std::exception& e) {\n cout << \"Exception serializing: \" << e.what() << endl;\n std::cerr << \"Exception serializing: \" << e.what();\n }\n\n }\n\n Json::Value JsonSerializer::generateResultEnvelope(string requestId, Json::Value appMessage) {\n try {\n Json::Value JsonRPCResult;\n JsonRPCResult[\"jsonrpc\"] = \"2.0\";\n JsonRPCResult[\"result\"] = appMessage;\n JsonRPCResult[\"id\"] = requestId;\n return JsonRPCResult;\n } catch (...) {\n \/\/ pending exception handling\n }\n }\n}<commit_msg>introduction of serializeRPCError<commit_after>\/*\n * Copyright (c) 2014, Juan Carlos Rueda (juancarlosrueda@icloud.com) All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the skywarp++ or skywarp_cpp Project nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL JUAN CARLOS RUEDA BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include <json\/json.h>\n#include <iostream>\n#include <exception>\n\n#include \"JsonSerializer.h\"\n\nnamespace skywarp {\n\n JsonSerializer::JsonSerializer() {\n }\n\n JsonSerializer::~JsonSerializer() {\n }\n\n string JsonSerializer::serializeRPCResult(string requestId, Json::Value appMessage) {\n try {\n Json::Value JsonRPCResult = generateResultEnvelope(requestId, appMessage);\n Json::FastWriter writer;\n string serializedJsonRPCResult = writer.write(JsonRPCResult);\n return serializedJsonRPCResult;\n } catch (std::exception& e) {\n cout << \"Exception serializing: \" << e.what() << endl;\n std::cerr << \"Exception serializing: \" << e.what();\n }\n\n }\n\n string JsonSerializer::serializeRPCError(string requestId, int errCode, string errMessage) {\n try {\n Json::Value jsonRPCError;\n Json::Value errorData;\n\n errorData[\"code\"] = errCode;\n errorData[\"message\"] = errMessage;\n\n jsonRPCError[\"jsonrpc\"] = \"2.0\";\n jsonRPCError[\"error\"] = errorData;\n jsonRPCError[\"id\"] = requestId;\n\n Json::FastWriter writer;\n string serializedJsonRPCError = writer.write(jsonRPCError);\n return serializedJsonRPCError;\n } catch (...) {\n \/\/ pending exception handling\n }\n }\n\n Json::Value JsonSerializer::generateResultEnvelope(string requestId, Json::Value appMessage) {\n try {\n Json::Value JsonRPCResult;\n JsonRPCResult[\"jsonrpc\"] = \"2.0\";\n JsonRPCResult[\"result\"] = appMessage;\n JsonRPCResult[\"id\"] = requestId;\n return JsonRPCResult;\n } catch (...) {\n \/\/ pending exception handling\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>#include <plasp\/pddl\/TranslatorASP.h>\n\n#include <boost\/assert.hpp>\n\n#include <plasp\/pddl\/expressions\/And.h>\n#include <plasp\/pddl\/expressions\/Not.h>\n#include <plasp\/pddl\/expressions\/Predicate.h>\n#include <plasp\/utils\/Formatting.h>\n#include <plasp\/utils\/IO.h>\n#include <plasp\/utils\/TranslatorException.h>\n\nnamespace plasp\n{\nnamespace pddl\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ TranslatorASP\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTranslatorASP::TranslatorASP(const Description &description, utils::LogStream &outputStream)\n:\tm_description(description),\n\tm_outputStream(outputStream)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translate() const\n{\n\ttranslateDomain();\n\n\tif (m_description.containsProblem())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateProblem();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateDomain() const\n{\n\tm_outputStream << utils::Heading1(\"domain\");\n\n\tconst auto &domain = m_description.domain();\n\n\t\/\/ Types\n\tm_outputStream << std::endl;\n\ttranslateTypes();\n\n\t\/\/ Constants\n\tif (!domain.constants().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateConstants(\"constants\", domain.constants());\n\t}\n\n\t\/\/ Predicates\n\tif (!domain.predicates().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslatePredicates();\n\t}\n\n\t\/\/ Actions\n\tif (!domain.actions().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateActions();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateTypes() const\n{\n\tm_outputStream << utils::Heading2(\"types\");\n\n\tm_outputStream << std::endl;\n\n\tconst auto &types = m_description.domain().types();\n\n\tif (types.empty())\n\t{\n\t\tm_outputStream\n\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t<< utils::Keyword(\"type\") << \"(object)).\" << std::endl;\n\n\t\treturn;\n\t}\n\n\tstd::for_each(types.cbegin(), types.cend(),\n\t\t[&](const auto &type)\n\t\t{\n\t\t\tconst auto typeName = utils::escapeASP(type->name());\n\n\t\t\tm_outputStream\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t\t<< typeName << \")).\" << std::endl;\n\n\t\t\tconst auto &parentTypes = type->parentTypes();\n\n\t\t\tstd::for_each(parentTypes.cbegin(), parentTypes.cend(),\n\t\t\t\t[&](const auto &parentType)\n\t\t\t\t{\n\t\t\t\t\tconst auto parentTypeName = utils::escapeASP(parentType->name());\n\n\t\t\t\t\tm_outputStream\n\t\t\t\t\t\t<< utils::Keyword(\"inherits\") << \"(\" << utils::Keyword(\"type\")\n\t\t\t\t\t\t<< \"(\" << typeName << \"), \" << utils::Keyword(\"type\")\n\t\t\t\t\t\t<< \"(\" << parentTypeName << \")).\" << std::endl\n\n\t\t\t\t\t\t<< utils::Keyword(\"has\") << \"(\" << utils::Variable(\"X\") << \", \"\n\t\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << parentTypeName << \")) :- \"\n\t\t\t\t\t\t<< utils::Keyword(\"has\") << \"(\" << utils::Variable(\"X\") << \", \"\n\t\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << typeName << \")).\" << std::endl;\n\t\t\t\t});\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translatePredicates() const\n{\n\tm_outputStream << utils::Heading2(\"predicates\");\n\n\tconst auto &predicates = m_description.domain().predicates();\n\n\tstd::for_each(predicates.cbegin(), predicates.cend(),\n\t\t[&](const auto &predicate)\n\t\t{\n\t\t\tm_outputStream << std::endl;\n\n\t\t\tm_outputStream << utils::Keyword(\"predicate\") << \"(\" << utils::escapeASP(predicate->name());\n\n\t\t\tthis->translateVariablesHead(predicate->arguments());\n\n\t\t\tm_outputStream << \")\";\n\n\t\t\tthis->translateVariablesBody(predicate->arguments());\n\n\t\t\tm_outputStream << \".\";\n\t\t});\n\n\tm_outputStream << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateActions() const\n{\n\tm_outputStream << utils::Heading2(\"actions\");\n\n\tconst auto &actions = m_description.domain().actions();\n\n\tconst auto printActionName =\n\t\t[&](const auto &action)\n\t\t{\n\t\t\tm_outputStream << utils::Keyword(\"action\") << \"(\" << utils::escapeASP(action.name());\n\n\t\t\tthis->translateVariablesHead(action.parameters());\n\n\t\t\tm_outputStream << \")\";\n\t\t};\n\n\tstd::for_each(actions.cbegin(), actions.cend(),\n\t\t[&](const auto &action)\n\t\t{\n\t\t\tconst auto translateLiteral =\n\t\t\t\t[&](const auto &ruleHead, const auto &literal)\n\t\t\t\t{\n\t\t\t\t\tm_outputStream << std::endl << utils::Keyword(ruleHead) << \"(\";\n\n\t\t\t\t\tprintActionName(*action);\n\n\t\t\t\t\tm_outputStream << \", \";\n\n\t\t\t\t\tthis->translateLiteral(literal);\n\n\t\t\t\t\tm_outputStream << \") :- \";\n\n\t\t\t\t\tprintActionName(*action);\n\n\t\t\t\t\tm_outputStream << \".\";\n\t\t\t\t};\n\n\t\t\tm_outputStream << std::endl;\n\n\t\t\t\/\/ Name\n\t\t\tprintActionName(*action);\n\n\t\t\tthis->translateVariablesBody(action->parameters());\n\n\t\t\tm_outputStream << \".\";\n\n\t\t\t\/\/ Precondition\n\t\t\tif (action->precondition())\n\t\t\t{\n\t\t\t\tconst auto &precondition = *action->precondition();\n\n\t\t\t\tif (precondition.expressionType() == Expression::Type::Predicate\n\t\t\t\t\t|| precondition.expressionType() == Expression::Type::Not)\n\t\t\t\t{\n\t\t\t\t\ttranslateLiteral(\"precondition\", precondition);\n\t\t\t\t}\n\t\t\t\t\/\/ Assuming a conjunction\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (precondition.expressionType() != Expression::Type::And)\n\t\t\t\t\t\tthrow utils::TranslatorException(\"only “and” expressions and (negated) predicates supported as action preconditions currently\");\n\n\t\t\t\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(precondition);\n\n\t\t\t\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t\t\t\t[&](const auto *argument)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttranslateLiteral(\"precondition\", *argument);\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Effect\n\t\t\tif (action->effect())\n\t\t\t{\n\t\t\t\tconst auto &effect = *action->effect();\n\n\t\t\t\tif (effect.expressionType() == Expression::Type::Predicate\n\t\t\t\t\t|| effect.expressionType() == Expression::Type::Not)\n\t\t\t\t{\n\t\t\t\t\ttranslateLiteral(\"postcondition\", effect);\n\t\t\t\t}\n\t\t\t\t\/\/ Assuming a conjunction\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (effect.expressionType() != Expression::Type::And)\n\t\t\t\t\t\tthrow utils::TranslatorException(\"only “and” expressions and (negated) predicates supported as action effects currently\");\n\n\t\t\t\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(effect);\n\n\t\t\t\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t\t\t\t[&](const auto *argument)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttranslateLiteral(\"postcondition\", *argument);\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tm_outputStream << std::endl;\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateConstants(const std::string &heading, const expressions::Constants &constants) const\n{\n\tm_outputStream << utils::Heading2(heading);\n\n\tstd::for_each(constants.cbegin(), constants.cend(),\n\t\t[&](const auto &constant)\n\t\t{\n\t\t\tconst auto constantName = utils::escapeASP(constant->name());\n\n\t\t\tm_outputStream << std::endl << utils::Keyword(\"constant\")\n\t\t\t\t<< \"(\" << constantName << \").\" << std::endl;\n\n\t\t\tconst auto *type = constant->type();\n\n\t\t\tif (type != nullptr)\n\t\t\t{\n\t\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t\t<< utils::Keyword(\"constant\") << \"(\" << constantName << \"), \"\n\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << utils::escapeASP(type->name()) << \")).\" << std::endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t\t<< utils::Keyword(\"constant\") << \"(\" << constantName << \"), \"\n\t\t\t\t\t<< utils::Keyword(\"type\") << \"(object)).\" << std::endl;\n\t\t\t}\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateVariablesHead(const expressions::Variables &variables) const\n{\n\tif (variables.empty())\n\t\treturn;\n\n\tm_outputStream << \"(\";\n\n\tfor (auto i = variables.cbegin(); i != variables.cend(); i++)\n\t{\n\t\tif (i != variables.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tconst auto &variable = **i;\n\n\t\tm_outputStream << utils::Variable(utils::escapeASPVariable(variable.name()));\n\t}\n\n\tm_outputStream << \")\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateVariablesBody(const expressions::Variables &variables) const\n{\n\tif (variables.empty())\n\t\treturn;\n\n\tm_outputStream << \" :- \";\n\n\tfor (auto i = variables.cbegin(); i != variables.cend(); i++)\n\t{\n\t\tconst auto &variable = **i;\n\n\t\tif (i != variables.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tif (variable.type() != nullptr)\n\t\t{\n\t\t\tif (variable.type()->expressionType() != Expression::Type::PrimitiveType)\n\t\t\t\tthrow utils::TranslatorException(\"only primitive types supported currently\");\n\n\t\t\tconst auto &type = *dynamic_cast<const expressions::PrimitiveType *>(variable.type());\n\n\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t<< utils::Variable(utils::escapeASPVariable(variable.name())) << \", \"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << utils::escapeASP(type.name()) << \"))\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t<< utils::Variable(utils::escapeASPVariable(variable.name())) << \", \"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(object))\";\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateLiteral(const Expression &literal) const\n{\n\t\/\/ Translate single predicate\n\tif (literal.expressionType() == Expression::Type::Predicate)\n\t{\n\t\tthis->translatePredicate(dynamic_cast<const expressions::Predicate &>(literal));\n\t\tm_outputStream << \", \" << utils::Keyword(\"true\");\n\t}\n\t\/\/ Assuming that \"not\" expression may only contain a predicate\n\telse if (literal.expressionType() == Expression::Type::Not)\n\t{\n\t\tconst auto ¬Expression = dynamic_cast<const expressions::Not &>(literal);\n\t\tconst auto &predicate = dynamic_cast<const expressions::Predicate &>(*notExpression.argument());\n\n\t\tthis->translatePredicate(predicate);\n\t\tm_outputStream << \", \" << utils::Keyword(\"false\");\n\t}\n\telse\n\t\tthrow utils::TranslatorException(\"only primitive predicates and their negations supported as literals currently\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translatePredicate(const expressions::Predicate &predicate) const\n{\n\tm_outputStream << utils::Keyword(\"predicate\") << \"(\" << utils::escapeASP(predicate.name());\n\n\tconst auto &arguments = predicate.arguments();\n\n\tif (arguments.empty())\n\t{\n\t\tm_outputStream << \")\";\n\t\treturn;\n\t}\n\n\tm_outputStream << \"(\";\n\n\tfor (auto i = arguments.cbegin(); i != arguments.cend(); i++)\n\t{\n\t\tif (i != arguments.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tif ((*i)->expressionType() == Expression::Type::Constant)\n\t\t{\n\t\t\tconst auto &constant = dynamic_cast<const expressions::Constant &>(**i);\n\n\t\t\tm_outputStream << utils::Keyword(\"constant\") << \"(\" << utils::escapeASP(constant.name()) << \")\";\n\t\t}\n\t\telse if ((*i)->expressionType() == Expression::Type::Variable)\n\t\t{\n\t\t\tconst auto &variable = dynamic_cast<const expressions::Variable &>(**i);\n\n\t\t\tm_outputStream << utils::Variable(utils::escapeASPVariable(variable.name()));\n\t\t}\n\t\telse\n\t\t\tthrow utils::TranslatorException(\"only variables and constants supported in predicates currently\");\n\t}\n\n\tm_outputStream << \"))\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateProblem() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading1(\"problem\");\n\n\tconst auto &problem = m_description.problem();\n\n\t\/\/ Objects\n\tif (!problem.objects().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateConstants(\"objects\", problem.objects());\n\t}\n\n\t\/\/ Initial State\n\tm_outputStream << std::endl;\n\ttranslateInitialState();\n\n\t\/\/ Goal\n\tm_outputStream << std::endl;\n\ttranslateGoal();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateInitialState() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading2(\"initial state\");\n\n\tconst auto &initialStateFacts = m_description.problem().initialState().facts();\n\n\tstd::for_each(initialStateFacts.cbegin(), initialStateFacts.cend(),\n\t\t[&](const auto &fact)\n\t\t{\n\t\t\tm_outputStream << std::endl << utils::Keyword(\"initialState\") << \"(\";\n\n\t\t\t\/\/ Translate single predicate\n\t\t\tif (fact->expressionType() == Expression::Type::Predicate)\n\t\t\t\tthis->translatePredicate(dynamic_cast<const expressions::Predicate &>(*fact));\n\t\t\t\/\/ Assuming that \"not\" expression may only contain a predicate\n\t\t\telse if (fact->expressionType() == Expression::Type::Not)\n\t\t\t{\n\t\t\t\tconst auto ¬Expression = dynamic_cast<const expressions::Not &>(*fact);\n\n\t\t\t\tif (notExpression.argument()->expressionType() != Expression::Type::Predicate)\n\t\t\t\t\tthrow utils::TranslatorException(\"only negations of simple predicates supported in initial state currently\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow utils::TranslatorException(\"only predicates and their negations supported in initial state currently\");\n\n\t\t\tm_outputStream << \").\";\n\t\t});\n\n\tm_outputStream << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateGoal() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading2(\"goal\");\n\n\tconst auto &goal = m_description.problem().goal();\n\n\tif (goal.expressionType() == Expression::Type::Predicate\n\t\t|| goal.expressionType() == Expression::Type::Not)\n\t{\n\t\tm_outputStream << std::endl << utils::Keyword(\"goal\") << \"(\";\n\n\t\ttranslateLiteral(goal);\n\n\t\tm_outputStream << \").\";\n\t}\n\telse if (goal.expressionType() == Expression::Type::And)\n\t{\n\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(goal);\n\n\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t[&](const auto *argument)\n\t\t\t{\n\t\t\t\tm_outputStream << std::endl << utils::Keyword(\"goal\") << \"(\";\n\n\t\t\t\tthis->translateLiteral(*argument);\n\n\t\t\t\tm_outputStream << \").\";\n\t\t\t});\n\t}\n\telse\n\t\tthrow utils::TranslatorException(\"only single predicates, their negations, and conjunctions are currently supported in the goal\");\n\n\tm_outputStream << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n}\n<commit_msg>Started turning translated PDDL predicates into unified variable format.<commit_after>#include <plasp\/pddl\/TranslatorASP.h>\n\n#include <boost\/assert.hpp>\n\n#include <plasp\/pddl\/expressions\/And.h>\n#include <plasp\/pddl\/expressions\/Not.h>\n#include <plasp\/pddl\/expressions\/Predicate.h>\n#include <plasp\/utils\/Formatting.h>\n#include <plasp\/utils\/IO.h>\n#include <plasp\/utils\/TranslatorException.h>\n\nnamespace plasp\n{\nnamespace pddl\n{\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ TranslatorASP\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTranslatorASP::TranslatorASP(const Description &description, utils::LogStream &outputStream)\n:\tm_description(description),\n\tm_outputStream(outputStream)\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translate() const\n{\n\ttranslateDomain();\n\n\tif (m_description.containsProblem())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateProblem();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateDomain() const\n{\n\tm_outputStream << utils::Heading1(\"domain\");\n\n\tconst auto &domain = m_description.domain();\n\n\t\/\/ Types\n\tm_outputStream << std::endl;\n\ttranslateTypes();\n\n\t\/\/ Constants\n\tif (!domain.constants().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateConstants(\"constants\", domain.constants());\n\t}\n\n\t\/\/ Predicates\n\tif (!domain.predicates().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslatePredicates();\n\t}\n\n\t\/\/ Actions\n\tif (!domain.actions().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateActions();\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateTypes() const\n{\n\tm_outputStream << utils::Heading2(\"types\");\n\n\tm_outputStream << std::endl;\n\n\tconst auto &types = m_description.domain().types();\n\n\tif (types.empty())\n\t{\n\t\tm_outputStream\n\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t<< utils::Keyword(\"type\") << \"(object)).\" << std::endl;\n\n\t\treturn;\n\t}\n\n\tstd::for_each(types.cbegin(), types.cend(),\n\t\t[&](const auto &type)\n\t\t{\n\t\t\tconst auto typeName = utils::escapeASP(type->name());\n\n\t\t\tm_outputStream\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\"\n\t\t\t\t<< typeName << \")).\" << std::endl;\n\n\t\t\tconst auto &parentTypes = type->parentTypes();\n\n\t\t\tstd::for_each(parentTypes.cbegin(), parentTypes.cend(),\n\t\t\t\t[&](const auto &parentType)\n\t\t\t\t{\n\t\t\t\t\tconst auto parentTypeName = utils::escapeASP(parentType->name());\n\n\t\t\t\t\tm_outputStream\n\t\t\t\t\t\t<< utils::Keyword(\"inherits\") << \"(\" << utils::Keyword(\"type\")\n\t\t\t\t\t\t<< \"(\" << typeName << \"), \" << utils::Keyword(\"type\")\n\t\t\t\t\t\t<< \"(\" << parentTypeName << \")).\" << std::endl\n\n\t\t\t\t\t\t<< utils::Keyword(\"has\") << \"(\" << utils::Variable(\"X\") << \", \"\n\t\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << parentTypeName << \")) :- \"\n\t\t\t\t\t\t<< utils::Keyword(\"has\") << \"(\" << utils::Variable(\"X\") << \", \"\n\t\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << typeName << \")).\" << std::endl;\n\t\t\t\t});\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translatePredicates() const\n{\n\tm_outputStream << utils::Heading2(\"predicates\");\n\n\tconst auto &predicates = m_description.domain().predicates();\n\n\tconst auto printPredicateName =\n\t\t[&](const auto &predicate)\n\t\t{\n\t\t\tm_outputStream\n\t\t\t\t<< utils::escapeASP(predicate->name());\n\n\t\t\tthis->translateVariablesHead(predicate->arguments());\n\t\t};\n\n\tconst auto printValueRule =\n\t\t[&](const auto &predicate, const auto &value)\n\t\t{\n\t\t\tm_outputStream\n\t\t\t\t<< utils::Keyword(\"contains\") << \"(\"\n\t\t\t\t<< utils::Keyword(\"variable\") << \"(\";\n\n\t\t\tprintPredicateName(predicate);\n\n\t\t\tm_outputStream\n\t\t\t\t<< \"), \" << utils::Keyword(\"value\") << \"(\";\n\n\t\t\tprintPredicateName(predicate);\n\n\t\t\tm_outputStream << \", \" << utils::Keyword(value) << \")\";\n\n\t\t\tthis->translateVariablesBody(predicate->arguments());\n\n\t\t\tm_outputStream << \".\" << std::endl;\n\t\t};\n\n\tstd::for_each(predicates.cbegin(), predicates.cend(),\n\t\t[&](const auto &predicate)\n\t\t{\n\t\t\tm_outputStream\n\t\t\t\t<< std::endl\n\t\t\t\t<< utils::Keyword(\"variable\") << \"(\"\n\t\t\t\t<< utils::Keyword(\"variable\") << \"(\";\n\n\t\t\tprintPredicateName(predicate);\n\n\t\t\tm_outputStream << \"))\";\n\n\t\t\tthis->translateVariablesBody(predicate->arguments());\n\n\t\t\tm_outputStream << \".\" << std::endl;\n\n\t\t\tprintValueRule(predicate, \"true\");\n\t\t\tprintValueRule(predicate, \"false\");\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateActions() const\n{\n\tm_outputStream << utils::Heading2(\"actions\");\n\n\tconst auto &actions = m_description.domain().actions();\n\n\tconst auto printActionName =\n\t\t[&](const auto &action)\n\t\t{\n\t\t\tm_outputStream << utils::Keyword(\"action\") << \"(\" << utils::escapeASP(action.name());\n\n\t\t\tthis->translateVariablesHead(action.parameters());\n\n\t\t\tm_outputStream << \")\";\n\t\t};\n\n\tstd::for_each(actions.cbegin(), actions.cend(),\n\t\t[&](const auto &action)\n\t\t{\n\t\t\tconst auto translateLiteral =\n\t\t\t\t[&](const auto &ruleHead, const auto &literal)\n\t\t\t\t{\n\t\t\t\t\tm_outputStream << std::endl << utils::Keyword(ruleHead) << \"(\";\n\n\t\t\t\t\tprintActionName(*action);\n\n\t\t\t\t\tm_outputStream << \", \";\n\n\t\t\t\t\tthis->translateLiteral(literal);\n\n\t\t\t\t\tm_outputStream << \") :- \";\n\n\t\t\t\t\tprintActionName(*action);\n\n\t\t\t\t\tm_outputStream << \".\";\n\t\t\t\t};\n\n\t\t\tm_outputStream << std::endl;\n\n\t\t\t\/\/ Name\n\t\t\tprintActionName(*action);\n\n\t\t\tthis->translateVariablesBody(action->parameters());\n\n\t\t\tm_outputStream << \".\";\n\n\t\t\t\/\/ Precondition\n\t\t\tif (action->precondition())\n\t\t\t{\n\t\t\t\tconst auto &precondition = *action->precondition();\n\n\t\t\t\tif (precondition.expressionType() == Expression::Type::Predicate\n\t\t\t\t\t|| precondition.expressionType() == Expression::Type::Not)\n\t\t\t\t{\n\t\t\t\t\ttranslateLiteral(\"precondition\", precondition);\n\t\t\t\t}\n\t\t\t\t\/\/ Assuming a conjunction\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (precondition.expressionType() != Expression::Type::And)\n\t\t\t\t\t\tthrow utils::TranslatorException(\"only “and” expressions and (negated) predicates supported as action preconditions currently\");\n\n\t\t\t\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(precondition);\n\n\t\t\t\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t\t\t\t[&](const auto *argument)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttranslateLiteral(\"precondition\", *argument);\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Effect\n\t\t\tif (action->effect())\n\t\t\t{\n\t\t\t\tconst auto &effect = *action->effect();\n\n\t\t\t\tif (effect.expressionType() == Expression::Type::Predicate\n\t\t\t\t\t|| effect.expressionType() == Expression::Type::Not)\n\t\t\t\t{\n\t\t\t\t\ttranslateLiteral(\"postcondition\", effect);\n\t\t\t\t}\n\t\t\t\t\/\/ Assuming a conjunction\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (effect.expressionType() != Expression::Type::And)\n\t\t\t\t\t\tthrow utils::TranslatorException(\"only “and” expressions and (negated) predicates supported as action effects currently\");\n\n\t\t\t\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(effect);\n\n\t\t\t\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t\t\t\t[&](const auto *argument)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\ttranslateLiteral(\"postcondition\", *argument);\n\t\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tm_outputStream << std::endl;\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateConstants(const std::string &heading, const expressions::Constants &constants) const\n{\n\tm_outputStream << utils::Heading2(heading);\n\n\tstd::for_each(constants.cbegin(), constants.cend(),\n\t\t[&](const auto &constant)\n\t\t{\n\t\t\tconst auto constantName = utils::escapeASP(constant->name());\n\n\t\t\tm_outputStream << std::endl << utils::Keyword(\"constant\")\n\t\t\t\t<< \"(\" << constantName << \").\" << std::endl;\n\n\t\t\tconst auto *type = constant->type();\n\n\t\t\tif (type != nullptr)\n\t\t\t{\n\t\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t\t<< utils::Keyword(\"constant\") << \"(\" << constantName << \"), \"\n\t\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << utils::escapeASP(type->name()) << \")).\" << std::endl;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t\t<< utils::Keyword(\"constant\") << \"(\" << constantName << \"), \"\n\t\t\t\t\t<< utils::Keyword(\"type\") << \"(object)).\" << std::endl;\n\t\t\t}\n\t\t});\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateVariablesHead(const expressions::Variables &variables) const\n{\n\tif (variables.empty())\n\t\treturn;\n\n\tm_outputStream << \"(\";\n\n\tfor (auto i = variables.cbegin(); i != variables.cend(); i++)\n\t{\n\t\tif (i != variables.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tconst auto &variable = **i;\n\n\t\tm_outputStream << utils::Variable(utils::escapeASPVariable(variable.name()));\n\t}\n\n\tm_outputStream << \")\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateVariablesBody(const expressions::Variables &variables) const\n{\n\tif (variables.empty())\n\t\treturn;\n\n\tm_outputStream << \" :- \";\n\n\tfor (auto i = variables.cbegin(); i != variables.cend(); i++)\n\t{\n\t\tconst auto &variable = **i;\n\n\t\tif (i != variables.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tif (variable.type() != nullptr)\n\t\t{\n\t\t\tif (variable.type()->expressionType() != Expression::Type::PrimitiveType)\n\t\t\t\tthrow utils::TranslatorException(\"only primitive types supported currently\");\n\n\t\t\tconst auto &type = *dynamic_cast<const expressions::PrimitiveType *>(variable.type());\n\n\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t<< utils::Variable(utils::escapeASPVariable(variable.name())) << \", \"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(\" << utils::escapeASP(type.name()) << \"))\";\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_outputStream << utils::Keyword(\"has\") << \"(\"\n\t\t\t\t<< utils::Variable(utils::escapeASPVariable(variable.name())) << \", \"\n\t\t\t\t<< utils::Keyword(\"type\") << \"(object))\";\n\t\t}\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateLiteral(const Expression &literal) const\n{\n\t\/\/ Translate single predicate\n\tif (literal.expressionType() == Expression::Type::Predicate)\n\t{\n\t\tthis->translatePredicate(dynamic_cast<const expressions::Predicate &>(literal));\n\t\tm_outputStream << \", \" << utils::Keyword(\"true\");\n\t}\n\t\/\/ Assuming that \"not\" expression may only contain a predicate\n\telse if (literal.expressionType() == Expression::Type::Not)\n\t{\n\t\tconst auto ¬Expression = dynamic_cast<const expressions::Not &>(literal);\n\t\tconst auto &predicate = dynamic_cast<const expressions::Predicate &>(*notExpression.argument());\n\n\t\tthis->translatePredicate(predicate);\n\t\tm_outputStream << \", \" << utils::Keyword(\"false\");\n\t}\n\telse\n\t\tthrow utils::TranslatorException(\"only primitive predicates and their negations supported as literals currently\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translatePredicate(const expressions::Predicate &predicate) const\n{\n\tm_outputStream << utils::Keyword(\"predicate\") << \"(\" << utils::escapeASP(predicate.name());\n\n\tconst auto &arguments = predicate.arguments();\n\n\tif (arguments.empty())\n\t{\n\t\tm_outputStream << \")\";\n\t\treturn;\n\t}\n\n\tm_outputStream << \"(\";\n\n\tfor (auto i = arguments.cbegin(); i != arguments.cend(); i++)\n\t{\n\t\tif (i != arguments.cbegin())\n\t\t\tm_outputStream << \", \";\n\n\t\tif ((*i)->expressionType() == Expression::Type::Constant)\n\t\t{\n\t\t\tconst auto &constant = dynamic_cast<const expressions::Constant &>(**i);\n\n\t\t\tm_outputStream << utils::Keyword(\"constant\") << \"(\" << utils::escapeASP(constant.name()) << \")\";\n\t\t}\n\t\telse if ((*i)->expressionType() == Expression::Type::Variable)\n\t\t{\n\t\t\tconst auto &variable = dynamic_cast<const expressions::Variable &>(**i);\n\n\t\t\tm_outputStream << utils::Variable(utils::escapeASPVariable(variable.name()));\n\t\t}\n\t\telse\n\t\t\tthrow utils::TranslatorException(\"only variables and constants supported in predicates currently\");\n\t}\n\n\tm_outputStream << \"))\";\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateProblem() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading1(\"problem\");\n\n\tconst auto &problem = m_description.problem();\n\n\t\/\/ Objects\n\tif (!problem.objects().empty())\n\t{\n\t\tm_outputStream << std::endl;\n\t\ttranslateConstants(\"objects\", problem.objects());\n\t}\n\n\t\/\/ Initial State\n\tm_outputStream << std::endl;\n\ttranslateInitialState();\n\n\t\/\/ Goal\n\tm_outputStream << std::endl;\n\ttranslateGoal();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateInitialState() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading2(\"initial state\");\n\n\tconst auto &initialStateFacts = m_description.problem().initialState().facts();\n\n\tstd::for_each(initialStateFacts.cbegin(), initialStateFacts.cend(),\n\t\t[&](const auto &fact)\n\t\t{\n\t\t\tm_outputStream << std::endl << utils::Keyword(\"initialState\") << \"(\";\n\n\t\t\t\/\/ Translate single predicate\n\t\t\tif (fact->expressionType() == Expression::Type::Predicate)\n\t\t\t\tthis->translatePredicate(dynamic_cast<const expressions::Predicate &>(*fact));\n\t\t\t\/\/ Assuming that \"not\" expression may only contain a predicate\n\t\t\telse if (fact->expressionType() == Expression::Type::Not)\n\t\t\t{\n\t\t\t\tconst auto ¬Expression = dynamic_cast<const expressions::Not &>(*fact);\n\n\t\t\t\tif (notExpression.argument()->expressionType() != Expression::Type::Predicate)\n\t\t\t\t\tthrow utils::TranslatorException(\"only negations of simple predicates supported in initial state currently\");\n\t\t\t}\n\t\t\telse\n\t\t\t\tthrow utils::TranslatorException(\"only predicates and their negations supported in initial state currently\");\n\n\t\t\tm_outputStream << \").\";\n\t\t});\n\n\tm_outputStream << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TranslatorASP::translateGoal() const\n{\n\tBOOST_ASSERT(m_description.containsProblem());\n\n\tm_outputStream << utils::Heading2(\"goal\");\n\n\tconst auto &goal = m_description.problem().goal();\n\n\tif (goal.expressionType() == Expression::Type::Predicate\n\t\t|| goal.expressionType() == Expression::Type::Not)\n\t{\n\t\tm_outputStream << std::endl << utils::Keyword(\"goal\") << \"(\";\n\n\t\ttranslateLiteral(goal);\n\n\t\tm_outputStream << \").\";\n\t}\n\telse if (goal.expressionType() == Expression::Type::And)\n\t{\n\t\tconst auto &andExpression = dynamic_cast<const expressions::And &>(goal);\n\n\t\tstd::for_each(andExpression.arguments().cbegin(), andExpression.arguments().cend(),\n\t\t\t[&](const auto *argument)\n\t\t\t{\n\t\t\t\tm_outputStream << std::endl << utils::Keyword(\"goal\") << \"(\";\n\n\t\t\t\tthis->translateLiteral(*argument);\n\n\t\t\t\tm_outputStream << \").\";\n\t\t\t});\n\t}\n\telse\n\t\tthrow utils::TranslatorException(\"only single predicates, their negations, and conjunctions are currently supported in the goal\");\n\n\tm_outputStream << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <map>\n#include <stdarg.h> \/\/ for va_start\/va_end\n#include <thread>\n#include <mutex>\n#include <functional>\n#include <iostream>\n#include <ostream>\n#include <sstream>\n#include <sys\/time.h>\n#include <unistd.h>\n#include <netdb.h>\n#include <arpa\/inet.h>\n#include <zmq.hpp>\n#include \"chlog.hpp\"\n\nusing namespace std;\nusing namespace ch_frb_io;\n\nnamespace ch_frb_io {\n#if 0\n}; \/\/ pacify emacs c-mode\n#endif\n\nstatic string \nvstringprintf(const char* format, va_list lst) {\n char temps[256];\n \/\/ truncates if length > size of 'temps'\n int n = vsnprintf(temps, sizeof(temps), format, lst);\n if (n < 0)\n throw runtime_error(\"vstringprintf failed: \" + string(strerror(errno)));\n if (n < 256)\n return string(temps);\n \/\/ Try again with larger temp buffer\n char* temp2 = new char[n+1];\n n = vsnprintf(temp2, n+1, format, lst);\n if (n < 0)\n throw runtime_error(\"vstringprintf(2) failed: \" + string(strerror(errno)));\n string s(temp2);\n delete[] temp2;\n return s;\n}\n\nstd::string \n__attribute__ ((format(printf,1,2)))\nstringprintf(const char* format, ...) {\n va_list lst;\n va_start(lst, format);\n string s = vstringprintf(format, lst);\n va_end(lst);\n return s;\n}\n\n\n\/\/ Holds a ZeroMQ socket that is used to talk to multiple logging\n\/\/ servers.\nclass chime_log_socket {\n typedef std::lock_guard<std::mutex> scoped_lock;\n\npublic:\n chime_log_socket() :\n _ctx(NULL),\n _socket(NULL),\n _mutex(),\n _local(true),\n _name(),\n _threadnames()\n {}\n\n ~chime_log_socket() {\n if (_socket)\n delete _socket;\n if (_ctx)\n delete _ctx;\n }\n\n void set_local(bool loc) {\n scoped_lock l(_mutex);\n _local = loc;\n }\n\n void set_name(const std::string &name) {\n scoped_lock l(_mutex);\n _name = name;\n }\n\n void set_thread_name(const std::string &name) {\n scoped_lock l(_mutex);\n _threadnames[std::this_thread::get_id()] = name;\n }\n\n void open_socket(zmq::context_t* ctx) {\n scoped_lock l(_mutex);\n if (_socket)\n throw runtime_error(\"chime_log_socket::open_socket called but socket is already open.\");\n if (!ctx)\n ctx = _ctx = new zmq::context_t();\n _socket = new zmq::socket_t(*ctx, ZMQ_PUB);\n\n if (!_name.length()) {\n char tmp[256];\n gethostname(tmp, 256);\n _name = tmp;\n cout << \"Set hostname: \" << _name << endl;\n }\n \/\/ Send buffer: ZMQ_SNDHWM: default 1000 messages\n }\n\n void close_socket() {\n scoped_lock l(_mutex);\n if (_socket)\n delete _socket;\n _socket = NULL;\n }\n \n void add_server(const std::string &port) {\n scoped_lock l(_mutex);\n if (!_socket)\n throw runtime_error(\"chime_log_socket::add_server called but socket has not been initialized.\");\n _socket->connect(port.c_str());\n }\n\n void remove_server(const std::string &port) {\n scoped_lock l(_mutex);\n if (!_socket)\n throw runtime_error(\"chime_log_socket::remove_server called but socket has not been initialized.\");\n _socket->disconnect(port.c_str());\n }\n\n void send(std::string header, std::string msg, bool do_assert) {\n scoped_lock l(_mutex);\n string tname = get_thread_name();\n if (_local) {\n if (do_assert)\n \/\/ Assume we want to know where it was...\n cout << header << endl;\n cout << \"[\" << tname << \"] \" << msg << endl;\n }\n if (!_socket)\n return;\n msg = _name + \" \" + tname + \" \" + header + \" \" + msg;\n _socket->send(static_cast<const void*>(msg.data()), msg.size());\n }\n\nprotected:\n std::string get_thread_name() {\n std::thread::id tid = std::this_thread::get_id();\n auto it = _threadnames.find(tid);\n if (it == _threadnames.end()) {\n std::ostringstream ss;\n ss << \"Thread-\" << tid;\n return ss.str();\n }\n return it->second;\n }\n\n zmq::context_t* _ctx;\n zmq::socket_t* _socket;\n\n \/\/ Mutex used to protect the socket (and also _socket\/_ctx state)\n std::mutex _mutex;\n\n \/\/ Print to cout also?\n bool _local;\n\n \/\/ Client name to send\n std::string _name;\n\n \/\/ Thread name map\n std::map<std::thread::id, std::string> _threadnames;\n};\n\n\n\/\/ GLOBALS for logging.\nstatic chime_log_socket logsock;\n\nvoid chime_log_open_socket(zmq::context_t* ctx) {\n logsock.open_socket(ctx);\n}\n\nvoid chime_log_close_socket() {\n logsock.close_socket();\n}\n\nvoid chime_log_local(bool loc) {\n logsock.set_local(loc);\n}\n\nvoid chime_log_set_name(const std::string &name) {\n logsock.set_name(name);\n}\n\nvoid chime_log_set_thread_name(const std::string &name) {\n logsock.set_thread_name(name);\n}\n\nvoid chime_log_add_server(const std::string &port) {\n logsock.add_server(port);\n}\n\nvoid chime_log_remove_server(const std::string &port) {\n logsock.remove_server(port);\n}\n\nvoid chime_log(log_level lev, const char* file, int line, const char* function,\n const std::string &msg, bool do_assert) {\n struct timeval tv;\n string datestring;\n if (gettimeofday(&tv, NULL)) {\n cout << \"Error calling gettimeofday(): \" << strerror(errno) << endl;\n } else {\n struct tm cal;\n if (!gmtime_r(&tv.tv_sec, &cal)) {\n cout << \"Error calling gmtime_r(): \" << strerror(errno) << endl;\n } else {\n datestring = stringprintf(\"%04i-%02i-%02i-%02i:%02i:%02i.%03i\",\n cal.tm_year + 1900, cal.tm_mon + 1, cal.tm_mday,\n cal.tm_hour, cal.tm_min, cal.tm_sec,\n int(tv.tv_usec \/ 1000));\n }\n }\n string levstring = (lev == log_level_debug ? \"DEBUG\" :\n (lev == log_level_info ? \"INFO\" :\n (lev == log_level_warn ? \"WARN\" :\n (lev == log_level_err ? \"ERROR\" : \"XXX\"))));\n string header = (levstring +\n stringprintf(\" %s:%i [%s] \", file, line, function) +\n datestring);\n logsock.send(header, msg, do_assert);\n}\n\nvoid\n__attribute__ ((format(printf,5,6)))\nchime_logf(enum log_level lev, const char* file, int line, const char* function, const char* pattern, ...) {\n va_list lst;\n va_start(lst, pattern);\n string s = vstringprintf(pattern, lst);\n va_end(lst);\n chime_log(lev, file, line, function, s);\n}\n\n\n\nchime_log_server::chime_log_server(std::ostream& out,\n zmq::context_t* ctx,\n const std::string &hostname,\n int port) :\n _out(out),\n _quit(false)\n{\n if (!ctx)\n ctx = _ctx = new zmq::context_t();\n _socket = new zmq::socket_t(*ctx, ZMQ_SUB);\n _socket->setsockopt(ZMQ_SUBSCRIBE, \"\", 0);\n\n string addr = \"tcp:\/\/\" + hostname + \":\";\n if (port == -1)\n addr = addr + \"*\";\n else\n addr = addr + std::to_string(port);\n\n _socket->bind(addr.c_str());\n\n char addrx[256];\n size_t addrsz = 256;\n _socket->getsockopt(ZMQ_LAST_ENDPOINT,\n reinterpret_cast<void*>(addrx), &addrsz);\n _address = string(addrx);\n \/\/cout << \"Bound to address \" << _address << endl;\n\n \/\/ When binding \"*\", the returned address is like \"tcp:\/\/0.0.0.0:6534\".\n \/\/ Replace \"0.0.0.0\" by my IP address\n size_t i = _address.find(\"0.0.0.0\");\n if (i != std::string::npos) {\n string ipaddress = \"0.0.0.0\";\n char name[256];\n if (gethostname(name, 256)) {\n cout << \"Failed to gethostname(): \" << strerror(errno) << endl;\n } else {\n \/\/cout << \"Hostname: \" << name << endl;\n struct addrinfo* addrs = NULL;\n if (getaddrinfo(name, NULL, NULL, &addrs)) {\n cout << \"Failed to getaddrinfo(): \" << gai_strerror(errno) << endl;\n } else {\n struct addrinfo* a;\n for(a = addrs; a != NULL; a = a->ai_next) {\n if (a->ai_family != AF_INET)\n continue;\n char dots[INET_ADDRSTRLEN];\n struct sockaddr_in* sin = reinterpret_cast<struct sockaddr_in*>(a->ai_addr);\n if (!inet_ntop(AF_INET, &(sin->sin_addr), dots, INET_ADDRSTRLEN)) {\n cout << \"Failed to inet_ntop: \" << strerror(errno) << endl;\n } else {\n ipaddress = dots;\n \/\/cout << \"My address: \" << dots << endl;\n break;\n }\n }\n freeaddrinfo(addrs);\n }\n }\n _address.replace(i, 7, ipaddress);\n \/\/cout << \"Replaced address: \" << _address << endl;\n }\n}\n\nchime_log_server::~chime_log_server() {\n delete _socket;\n if (_ctx) {\n delete _ctx;\n }\n}\n\nstd::string chime_log_server::get_address() {\n return _address;\n}\n\nstatic string msg_string(zmq::message_t &msg) {\n return string(static_cast<const char*>(msg.data()), msg.size());\n}\n\nvoid chime_log_server::run() {\n\n void* p_sock = _socket->operator void*();\n zmq_pollitem_t pollitems[] = {\n { p_sock, 0, ZMQ_POLLIN, 0 },\n };\n\n for (;;) {\n zmq::message_t msg;\n try {\n\n int r = zmq::poll(pollitems, 1, 1000);\n if (r == -1) {\n cout << \"log server: zmq::poll error: \" << strerror(errno) << endl;\n break;\n }\n\n if (_quit) {\n cout << \"log server: _quit!\" << endl;\n break;\n }\n\n if (!pollitems[0].revents & ZMQ_POLLIN) {\n cout << \"log server: no input ready\" << endl;\n continue;\n }\n\n if (!_socket->recv(&msg)) {\n _out << \"log server: failed to receive message\" << endl;\n break;\n }\n } catch (const zmq::error_t& e) {\n _out << \"log server: error receiving message: \" << e.what() << endl;\n break;\n }\n _out << msg_string(msg) << endl;\n }\n cout << \"log server: exiting\" << endl;\n}\n\n\/\/ Starts a new thread to run this server.\nstd::thread chime_log_server::start() {\n thread t(std::bind(&chime_log_server::run, this));\n t.detach();\n return t;\n}\n\nvoid chime_log_server::stop() {\n _quit = true;\n}\n\n\n} \/\/ namespace\n\n<commit_msg>add parens for ambiguous statement<commit_after>#include <cstdlib>\n#include <map>\n#include <stdarg.h> \/\/ for va_start\/va_end\n#include <thread>\n#include <mutex>\n#include <functional>\n#include <iostream>\n#include <ostream>\n#include <sstream>\n#include <sys\/time.h>\n#include <unistd.h>\n#include <netdb.h>\n#include <arpa\/inet.h>\n#include <zmq.hpp>\n#include \"chlog.hpp\"\n\nusing namespace std;\nusing namespace ch_frb_io;\n\nnamespace ch_frb_io {\n#if 0\n}; \/\/ pacify emacs c-mode\n#endif\n\nstatic string \nvstringprintf(const char* format, va_list lst) {\n char temps[256];\n \/\/ truncates if length > size of 'temps'\n int n = vsnprintf(temps, sizeof(temps), format, lst);\n if (n < 0)\n throw runtime_error(\"vstringprintf failed: \" + string(strerror(errno)));\n if (n < 256)\n return string(temps);\n \/\/ Try again with larger temp buffer\n char* temp2 = new char[n+1];\n n = vsnprintf(temp2, n+1, format, lst);\n if (n < 0)\n throw runtime_error(\"vstringprintf(2) failed: \" + string(strerror(errno)));\n string s(temp2);\n delete[] temp2;\n return s;\n}\n\nstd::string \n__attribute__ ((format(printf,1,2)))\nstringprintf(const char* format, ...) {\n va_list lst;\n va_start(lst, format);\n string s = vstringprintf(format, lst);\n va_end(lst);\n return s;\n}\n\n\n\/\/ Holds a ZeroMQ socket that is used to talk to multiple logging\n\/\/ servers.\nclass chime_log_socket {\n typedef std::lock_guard<std::mutex> scoped_lock;\n\npublic:\n chime_log_socket() :\n _ctx(NULL),\n _socket(NULL),\n _mutex(),\n _local(true),\n _name(),\n _threadnames()\n {}\n\n ~chime_log_socket() {\n if (_socket)\n delete _socket;\n if (_ctx)\n delete _ctx;\n }\n\n void set_local(bool loc) {\n scoped_lock l(_mutex);\n _local = loc;\n }\n\n void set_name(const std::string &name) {\n scoped_lock l(_mutex);\n _name = name;\n }\n\n void set_thread_name(const std::string &name) {\n scoped_lock l(_mutex);\n _threadnames[std::this_thread::get_id()] = name;\n }\n\n void open_socket(zmq::context_t* ctx) {\n scoped_lock l(_mutex);\n if (_socket)\n throw runtime_error(\"chime_log_socket::open_socket called but socket is already open.\");\n if (!ctx)\n ctx = _ctx = new zmq::context_t();\n _socket = new zmq::socket_t(*ctx, ZMQ_PUB);\n\n if (!_name.length()) {\n char tmp[256];\n gethostname(tmp, 256);\n _name = tmp;\n cout << \"Set hostname: \" << _name << endl;\n }\n \/\/ Send buffer: ZMQ_SNDHWM: default 1000 messages\n }\n\n void close_socket() {\n scoped_lock l(_mutex);\n if (_socket)\n delete _socket;\n _socket = NULL;\n }\n \n void add_server(const std::string &port) {\n scoped_lock l(_mutex);\n if (!_socket)\n throw runtime_error(\"chime_log_socket::add_server called but socket has not been initialized.\");\n _socket->connect(port.c_str());\n }\n\n void remove_server(const std::string &port) {\n scoped_lock l(_mutex);\n if (!_socket)\n throw runtime_error(\"chime_log_socket::remove_server called but socket has not been initialized.\");\n _socket->disconnect(port.c_str());\n }\n\n void send(std::string header, std::string msg, bool do_assert) {\n scoped_lock l(_mutex);\n string tname = get_thread_name();\n if (_local) {\n if (do_assert)\n \/\/ Assume we want to know where it was...\n cout << header << endl;\n cout << \"[\" << tname << \"] \" << msg << endl;\n }\n if (!_socket)\n return;\n msg = _name + \" \" + tname + \" \" + header + \" \" + msg;\n _socket->send(static_cast<const void*>(msg.data()), msg.size());\n }\n\nprotected:\n std::string get_thread_name() {\n std::thread::id tid = std::this_thread::get_id();\n auto it = _threadnames.find(tid);\n if (it == _threadnames.end()) {\n std::ostringstream ss;\n ss << \"Thread-\" << tid;\n return ss.str();\n }\n return it->second;\n }\n\n zmq::context_t* _ctx;\n zmq::socket_t* _socket;\n\n \/\/ Mutex used to protect the socket (and also _socket\/_ctx state)\n std::mutex _mutex;\n\n \/\/ Print to cout also?\n bool _local;\n\n \/\/ Client name to send\n std::string _name;\n\n \/\/ Thread name map\n std::map<std::thread::id, std::string> _threadnames;\n};\n\n\n\/\/ GLOBALS for logging.\nstatic chime_log_socket logsock;\n\nvoid chime_log_open_socket(zmq::context_t* ctx) {\n logsock.open_socket(ctx);\n}\n\nvoid chime_log_close_socket() {\n logsock.close_socket();\n}\n\nvoid chime_log_local(bool loc) {\n logsock.set_local(loc);\n}\n\nvoid chime_log_set_name(const std::string &name) {\n logsock.set_name(name);\n}\n\nvoid chime_log_set_thread_name(const std::string &name) {\n logsock.set_thread_name(name);\n}\n\nvoid chime_log_add_server(const std::string &port) {\n logsock.add_server(port);\n}\n\nvoid chime_log_remove_server(const std::string &port) {\n logsock.remove_server(port);\n}\n\nvoid chime_log(log_level lev, const char* file, int line, const char* function,\n const std::string &msg, bool do_assert) {\n struct timeval tv;\n string datestring;\n if (gettimeofday(&tv, NULL)) {\n cout << \"Error calling gettimeofday(): \" << strerror(errno) << endl;\n } else {\n struct tm cal;\n if (!gmtime_r(&tv.tv_sec, &cal)) {\n cout << \"Error calling gmtime_r(): \" << strerror(errno) << endl;\n } else {\n datestring = stringprintf(\"%04i-%02i-%02i-%02i:%02i:%02i.%03i\",\n cal.tm_year + 1900, cal.tm_mon + 1, cal.tm_mday,\n cal.tm_hour, cal.tm_min, cal.tm_sec,\n int(tv.tv_usec \/ 1000));\n }\n }\n string levstring = (lev == log_level_debug ? \"DEBUG\" :\n (lev == log_level_info ? \"INFO\" :\n (lev == log_level_warn ? \"WARN\" :\n (lev == log_level_err ? \"ERROR\" : \"XXX\"))));\n string header = (levstring +\n stringprintf(\" %s:%i [%s] \", file, line, function) +\n datestring);\n logsock.send(header, msg, do_assert);\n}\n\nvoid\n__attribute__ ((format(printf,5,6)))\nchime_logf(enum log_level lev, const char* file, int line, const char* function, const char* pattern, ...) {\n va_list lst;\n va_start(lst, pattern);\n string s = vstringprintf(pattern, lst);\n va_end(lst);\n chime_log(lev, file, line, function, s);\n}\n\n\n\nchime_log_server::chime_log_server(std::ostream& out,\n zmq::context_t* ctx,\n const std::string &hostname,\n int port) :\n _out(out),\n _quit(false)\n{\n if (!ctx)\n ctx = _ctx = new zmq::context_t();\n _socket = new zmq::socket_t(*ctx, ZMQ_SUB);\n _socket->setsockopt(ZMQ_SUBSCRIBE, \"\", 0);\n\n string addr = \"tcp:\/\/\" + hostname + \":\";\n if (port == -1)\n addr = addr + \"*\";\n else\n addr = addr + std::to_string(port);\n\n _socket->bind(addr.c_str());\n\n char addrx[256];\n size_t addrsz = 256;\n _socket->getsockopt(ZMQ_LAST_ENDPOINT,\n reinterpret_cast<void*>(addrx), &addrsz);\n _address = string(addrx);\n \/\/cout << \"Bound to address \" << _address << endl;\n\n \/\/ When binding \"*\", the returned address is like \"tcp:\/\/0.0.0.0:6534\".\n \/\/ Replace \"0.0.0.0\" by my IP address\n size_t i = _address.find(\"0.0.0.0\");\n if (i != std::string::npos) {\n string ipaddress = \"0.0.0.0\";\n char name[256];\n if (gethostname(name, 256)) {\n cout << \"Failed to gethostname(): \" << strerror(errno) << endl;\n } else {\n \/\/cout << \"Hostname: \" << name << endl;\n struct addrinfo* addrs = NULL;\n if (getaddrinfo(name, NULL, NULL, &addrs)) {\n cout << \"Failed to getaddrinfo(): \" << gai_strerror(errno) << endl;\n } else {\n struct addrinfo* a;\n for(a = addrs; a != NULL; a = a->ai_next) {\n if (a->ai_family != AF_INET)\n continue;\n char dots[INET_ADDRSTRLEN];\n struct sockaddr_in* sin = reinterpret_cast<struct sockaddr_in*>(a->ai_addr);\n if (!inet_ntop(AF_INET, &(sin->sin_addr), dots, INET_ADDRSTRLEN)) {\n cout << \"Failed to inet_ntop: \" << strerror(errno) << endl;\n } else {\n ipaddress = dots;\n \/\/cout << \"My address: \" << dots << endl;\n break;\n }\n }\n freeaddrinfo(addrs);\n }\n }\n _address.replace(i, 7, ipaddress);\n \/\/cout << \"Replaced address: \" << _address << endl;\n }\n}\n\nchime_log_server::~chime_log_server() {\n delete _socket;\n if (_ctx) {\n delete _ctx;\n }\n}\n\nstd::string chime_log_server::get_address() {\n return _address;\n}\n\nstatic string msg_string(zmq::message_t &msg) {\n return string(static_cast<const char*>(msg.data()), msg.size());\n}\n\nvoid chime_log_server::run() {\n\n void* p_sock = _socket->operator void*();\n zmq_pollitem_t pollitems[] = {\n { p_sock, 0, ZMQ_POLLIN, 0 },\n };\n\n for (;;) {\n zmq::message_t msg;\n try {\n\n int r = zmq::poll(pollitems, 1, 1000);\n if (r == -1) {\n cout << \"log server: zmq::poll error: \" << strerror(errno) << endl;\n break;\n }\n\n if (_quit) {\n cout << \"log server: _quit!\" << endl;\n break;\n }\n\n if (!(pollitems[0].revents & ZMQ_POLLIN)) {\n cout << \"log server: no input ready\" << endl;\n continue;\n }\n\n if (!_socket->recv(&msg)) {\n _out << \"log server: failed to receive message\" << endl;\n break;\n }\n } catch (const zmq::error_t& e) {\n _out << \"log server: error receiving message: \" << e.what() << endl;\n break;\n }\n _out << msg_string(msg) << endl;\n }\n cout << \"log server: exiting\" << endl;\n}\n\n\/\/ Starts a new thread to run this server.\nstd::thread chime_log_server::start() {\n thread t(std::bind(&chime_log_server::run, this));\n t.detach();\n return t;\n}\n\nvoid chime_log_server::stop() {\n _quit = true;\n}\n\n\n} \/\/ namespace\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 - 2018 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n\n#include \"COptMethodTruncatedNewton.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n#include \"COptTask.h\"\n\n#include \"parameterFitting\/CFitProblem.h\"\n#include \"copasi\/core\/CDataObjectReference.h\"\n\nCOptMethodTruncatedNewton::COptMethodTruncatedNewton(const CDataContainer * pParent,\n const CTaskEnum::Method & methodType,\n const CTaskEnum::Task & taskType):\n COptMethod(pParent, methodType, taskType),\n mpTruncatedNewton(new FTruncatedNewtonTemplate<COptMethodTruncatedNewton>(this, &COptMethodTruncatedNewton::sFun)),\n mpCTruncatedNewton(new CTruncatedNewton())\n{\n initObjects();\n}\n\nCOptMethodTruncatedNewton::COptMethodTruncatedNewton(const COptMethodTruncatedNewton & src,\n const CDataContainer * pParent):\n COptMethod(src, pParent),\n mpTruncatedNewton(new FTruncatedNewtonTemplate<COptMethodTruncatedNewton>(this, &COptMethodTruncatedNewton::sFun)),\n mpCTruncatedNewton(new CTruncatedNewton())\n{initObjects();}\n\nCOptMethodTruncatedNewton::~COptMethodTruncatedNewton()\n{\n pdelete(mpTruncatedNewton);\n pdelete(mpCTruncatedNewton);\n cleanup();\n}\n\nvoid COptMethodTruncatedNewton::initObjects()\n{\n addObjectReference(\"Current Iteration\", mIteration, CDataObject::ValueInt);\n}\n\nbool COptMethodTruncatedNewton::optimise()\n{\n if (!initialize()) return false;\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\n \"Truncated Newton algorithm started\",\n \"For more information about this method see: http:\/\/copasi.org\/Support\/User_Manual\/Methods\/Optimization_Methods\/Truncated_Newton\/\"\n )\n );\n\n C_FLOAT64 fest;\n C_INT lw, ierror = 0;\n lw = 14 * mVariableSize;\n\n CVector< C_FLOAT64 > up(mVariableSize);\n CVector< C_FLOAT64 > low(mVariableSize);\n CVector< C_INT > iPivot(mVariableSize);\n CVector< C_FLOAT64 > dwork(lw);\n\n up = std::numeric_limits< C_FLOAT64 >::max();\n low = - std::numeric_limits< C_FLOAT64 >::max();\n\n \/\/ initial point is the first guess but we have to make sure that\n \/\/ we are within the parameter domain\n C_INT i, repeat;\n bool pointInParameterDomain = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n \/\/ :TODO: In COPASI the bounds are not necessarry fixed.\n \/\/ Since evaluate checks for boundaries and constraints this is not\n \/\/ needed. The question remaining is how does tnbc_ handle unconstraint problems?\n \/\/ low[i] = *OptItem.getLowerBoundValue();\n \/\/ up[i] = *OptItem.getUpperBoundValue();\n\n mCurrent[i] = OptItem.getStartValue();\n\n switch (OptItem.checkConstraint(mCurrent[i]))\n {\n case - 1:\n mCurrent[i] = *OptItem.getLowerBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 1:\n mCurrent[i] = *OptItem.getUpperBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 0:\n break;\n }\n\n \/\/ set the value\n *mContainerVariables[i] = (mCurrent[i]);\n }\n\n if (!pointInParameterDomain && (mLogVerbosity > 0))\n mMethodLog.enterLogEntry(COptLogEntry(\"Initial point outside parameter domain.\"));\n\n \/\/ Report the first value as the current best\n mBestValue = evaluate();\n mBest = mCurrent;\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n repeat = 0;\n\n \/\/tnbc_ wants a signed int for loglevel...\n C_INT msglvl;\n msglvl = (int) mLogVerbosity;\n\n while (repeat < 10 && mContinue)\n {\n repeat++;\n\n \/\/ estimate minimum is 1\/10 initial function value\n fest = (1 - pow(0.9, (C_FLOAT64) repeat)) * mEvaluationValue;\n ierror = 0;\n\n \/\/ minimise\n try\n {\n mpCTruncatedNewton->tnbc_(&ierror,\n &mVariableSize,\n mCurrent.array(),\n &fest,\n mGradient.array(),\n dwork.array(),\n &lw,\n mpTruncatedNewton,\n low.array(),\n up.array(),\n iPivot.array(),\n &msglvl,\n &mMethodLog);\n\n mEvaluationValue = fest;\n }\n\n \/\/ This signals that the user opted to interrupt\n catch (bool)\n {\n break;\n }\n\n if (ierror < 0)\n fatalError(); \/\/ Invalid parameter values.\n\n \/\/ The way the method is currently implemented may lead to parameters just outside the boundaries.\n \/\/ We need to check whether the current value is within the boundaries or whether the corrected\n \/\/ leads to an improved solution.\n\n bool withinBounds = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n \/\/force it to be within the bounds\n switch (OptItem.checkConstraint(mCurrent[i]))\n {\n case - 1:\n withinBounds = false;\n mCurrent[i] = *OptItem.getLowerBoundValue();\n break;\n\n case 1:\n withinBounds = false;\n mCurrent[i] = *OptItem.getUpperBoundValue();\n break;\n\n case 0:\n break;\n }\n\n *mContainerVariables[i] = (mCurrent[i]);\n }\n\n evaluate();\n\n \/\/ Is the corrected value better than solution?\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n mBest = mCurrent;\n mBestValue = mEvaluationValue;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n\n \/\/ We found a solution\n if (withinBounds)\n break;\n\n \/\/ Choosing another starting point will be left to the user\n#ifdef XXXX\n\n \/\/ Try another starting point\n for (i = 0; i < mVariableSize; i++)\n {\n mCurrent[i] *= 1.2;\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n \/\/force it to be within the bounds\n switch (OptItem.checkConstraint(mCurrent[i]))\n {\n case - 1:\n mCurrent[i] = *OptItem.getLowerBoundValue();\n break;\n\n case 1:\n mCurrent[i] = *OptItem.getUpperBoundValue();\n break;\n\n case 0:\n break;\n }\n\n *mContainerVariables[i] = (mCurrent[i]);\n }\n\n evaluate();\n\n \/\/ Check whether we improved\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n mBest = mCurrent;\n mBestValue = mEvaluationValue;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n\n#endif \/\/ XXXX\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\n \"Solution parameters outside of the boundaries. Repeating calculations from current border position (\"\n + std::to_string(repeat) + \")\")\n );\n }\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(COptLogEntry(\"Algorithm finished.\"));\n\n return true;\n}\n\nbool COptMethodTruncatedNewton::initialize()\n{\n cleanup();\n\n if (!COptMethod::initialize()) return false;\n\n mVariableSize = (C_INT) mpOptItem->size();\n mCurrent.resize(mVariableSize);\n mBest.resize(mVariableSize);\n\n mContinue = true;\n mBestValue = std::numeric_limits<C_FLOAT64>::infinity();\n mGradient.resize(mVariableSize);\n\n return true;\n}\n\nbool COptMethodTruncatedNewton::cleanup()\n{\n return true;\n}\n\n\/\/ callback function, evaluate the value of the objective function and its gradient\n\/\/(by finite differences), translated by f2c, edited by Pedro and then modified for COPASI by Joseph\nC_INT COptMethodTruncatedNewton::sFun(C_INT *n, C_FLOAT64 *x, C_FLOAT64 *f, C_FLOAT64 *g)\n{\n C_INT i;\n\n \/\/ set the parameter values\n for (i = 0; i < *n; i++)\n *mContainerVariables[i] = (x[i]);\n\n \/\/carry out the function evaluation\n *f = evaluate();\n\n \/\/ Check whether we improved\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n for (i = 0; i < *n; i++)\n mBest[i] = x[i];\n\n mBestValue = mEvaluationValue;\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n\n \/\/ Calculate the gradient\n for (i = 0; i < *n && mContinue; i++)\n {\n if (x[i] != 0.0)\n {\n *mContainerVariables[i] = (x[i] * 1.001);\n g[i] = (evaluate() - *f) \/ (x[i] * 0.001);\n else\n {\n \/\/ why use 1e-7? shouldn't this be epsilon, or something like that?\n *mContainerVariables[i] = (1e-7);\n g[i] = (evaluate() - *f) \/ 1e-7;\n\n if (mLogVerbosity > 2)\n {\n std::ostringstream auxStream;\n auxStream << \"Calculating gradient for zero valued parameter \" << i << \", using 1e-7, results in \" << g[i] << \".\";\n mMethodLog.enterLogEntry(COptLogEntry(auxStream.str()));\n }\n }\n\n *mContainerVariables[i] = (x[i]);\n }\n\n if (!mContinue)\n throw bool(mContinue);\n\n return 0;\n }\n\n const C_FLOAT64 & COptMethodTruncatedNewton::evaluate()\n {\n \/\/ We do not need to check whether the parametric constraints are fulfilled\n \/\/ since the parameters are created within the bounds.\n mContinue = mpOptProblem->calculate();\n mEvaluationValue = mpOptProblem->getCalculateValue();\n\n \/\/ when we leave the either the parameter or functional domain\n \/\/ we penalize the objective value by forcing it to be larger\n \/\/ than the best value recorded so far.\n if (mEvaluationValue < mBestValue &&\n (!mpOptProblem->checkParametricConstraints() ||\n !mpOptProblem->checkFunctionalConstraints()))\n mEvaluationValue = mBestValue + mBestValue - mEvaluationValue;\n\n return mEvaluationValue;\n }\n\n unsigned C_INT32 COptMethodTruncatedNewton::getMaxLogVerbosity() const\n {\n return 1;\n }\n<commit_msg>removed cyclic call to tnbc_, now only one call<commit_after>\/\/ Copyright (C) 2017 - 2018 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and University of\n\/\/ of Connecticut School of Medicine.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n\n#include \"COptMethodTruncatedNewton.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n#include \"COptTask.h\"\n\n#include \"parameterFitting\/CFitProblem.h\"\n#include \"copasi\/core\/CDataObjectReference.h\"\n\nCOptMethodTruncatedNewton::COptMethodTruncatedNewton(const CDataContainer * pParent,\n const CTaskEnum::Method & methodType,\n const CTaskEnum::Task & taskType):\n COptMethod(pParent, methodType, taskType),\n mpTruncatedNewton(new FTruncatedNewtonTemplate<COptMethodTruncatedNewton>(this, &COptMethodTruncatedNewton::sFun)),\n mpCTruncatedNewton(new CTruncatedNewton())\n{\n initObjects();\n}\n\nCOptMethodTruncatedNewton::COptMethodTruncatedNewton(const COptMethodTruncatedNewton & src,\n const CDataContainer * pParent):\n COptMethod(src, pParent),\n mpTruncatedNewton(new FTruncatedNewtonTemplate<COptMethodTruncatedNewton>(this, &COptMethodTruncatedNewton::sFun)),\n mpCTruncatedNewton(new CTruncatedNewton())\n{initObjects();}\n\nCOptMethodTruncatedNewton::~COptMethodTruncatedNewton()\n{\n pdelete(mpTruncatedNewton);\n pdelete(mpCTruncatedNewton);\n cleanup();\n}\n\nvoid COptMethodTruncatedNewton::initObjects()\n{\n addObjectReference(\"Current Iteration\", mIteration, CDataObject::ValueInt);\n}\n\nbool COptMethodTruncatedNewton::optimise()\n{\n if (!initialize()) return false;\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\n \"Truncated Newton algorithm started\",\n \"For more information about this method see: http:\/\/copasi.org\/Support\/User_Manual\/Methods\/Optimization_Methods\/Truncated_Newton\/\"\n )\n );\n\n C_FLOAT64 fest;\n C_INT lw, ierror = 0;\n lw = 14 * mVariableSize;\n\n CVector< C_FLOAT64 > up(mVariableSize);\n CVector< C_FLOAT64 > low(mVariableSize);\n CVector< C_INT > iPivot(mVariableSize);\n CVector< C_FLOAT64 > dwork(lw);\n\n up = std::numeric_limits< C_FLOAT64 >::max();\n low = - std::numeric_limits< C_FLOAT64 >::max();\n\n \/\/ initial point is the first guess but we have to make sure that\n \/\/ we are within the parameter domain\n C_INT i, repeat;\n bool pointInParameterDomain = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n \/\/ :TODO: In COPASI the bounds are not necessarry fixed.\n \/\/ Since evaluate checks for boundaries and constraints this is not\n \/\/ needed. The question remaining is how does tnbc_ handle unconstraint problems?\n \/\/ low[i] = *OptItem.getLowerBoundValue();\n \/\/ up[i] = *OptItem.getUpperBoundValue();\n\n mCurrent[i] = OptItem.getStartValue();\n\n switch (OptItem.checkConstraint(mCurrent[i]))\n {\n case - 1:\n mCurrent[i] = *OptItem.getLowerBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 1:\n mCurrent[i] = *OptItem.getUpperBoundValue();\n pointInParameterDomain = false;\n break;\n\n case 0:\n break;\n }\n\n \/\/ set the value\n *mContainerVariables[i] = (mCurrent[i]);\n }\n\n if (!pointInParameterDomain && (mLogVerbosity > 0))\n mMethodLog.enterLogEntry(COptLogEntry(\"Initial point outside parameter domain.\"));\n\n \/\/ Report the first value as the current best\n mBestValue = evaluate();\n mBest = mCurrent;\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/tnbc_ wants a signed int for loglevel...\n C_INT msglvl;\n msglvl = (int) mLogVerbosity;\n\n \/\/ estimate minimum is 1\/10 initial function value (which is now in mBestValue)\n fest = 0.1 * mBestValue;\n ierror = 0;\n\n \/\/ minimise\n try\n {\n mpCTruncatedNewton->tnbc_(&ierror,\n &mVariableSize,\n mCurrent.array(),\n &fest,\n mGradient.array(),\n dwork.array(),\n &lw,\n mpTruncatedNewton,\n low.array(),\n up.array(),\n iPivot.array(),\n &msglvl,\n &mMethodLog);\n mEvaluationValue = fest;\n\n \/\/ Is the corrected value better than solution?\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n mBest = mCurrent;\n mBestValue = mEvaluationValue;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n }\n \/\/ This signals that the user opted to interrupt\n catch (bool)\n {\n break;\n }\n\n if (ierror < 0)\n fatalError(); \/\/ Invalid parameter values.\n\n \/*\n * TODO: THIS SEEMS TO BE FALSE; THIS TEST SHOULD NOT BE DONE!\n * THIS SECTION CANDIDATE FOR REMOVAL!\n *\/\n\n \/\/ The way the method is currently implemented may lead to parameters just outside the boundaries.\n \/\/ We need to check whether the current value is within the boundaries or whether the corrected\n \/\/ leads to an improved solution.\n bool withinBounds = true;\n\n for (i = 0; i < mVariableSize; i++)\n {\n const COptItem & OptItem = *(*mpOptItem)[i];\n\n \/\/force it to be within the bounds\n switch (OptItem.checkConstraint(mCurrent[i]))\n {\n case - 1:\n withinBounds = false;\n mCurrent[i] = *OptItem.getLowerBoundValue();\n\n if (mLogVerbosity > 1)\n mMethodLog.enterLogEntry(COptLogEntry(\"Parameter \" + std::to_string(i) + \" below lower bound. Reseting.\"));\n\n break;\n\n case 1:\n withinBounds = false;\n mCurrent[i] = *OptItem.getUpperBoundValue();\n\n if (mLogVerbosity > 1)\n mMethodLog.enterLogEntry(COptLogEntry(\"Parameter \" + std::to_string(i) + \" above upper bound. Reseting.\"));\n\n break;\n\n case 0:\n break;\n }\n\n *mContainerVariables[i] = (mCurrent[i]);\n }\n\n if (!withinBounds)\n {\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(\n COptLogEntry(\"Solution parameters outside of the boundaries. Repeating calculations from current border position.\"));\n\n evaluate();\n\n \/\/ Is the corrected value better than solution?\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n mBest = mCurrent;\n mBestValue = mEvaluationValue;\n\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n }\n\n \/*\n * END OF SECTION CANDIDATE FOR REMOVAL\n *\/\n\n if (mLogVerbosity > 0)\n mMethodLog.enterLogEntry(COptLogEntry(\"Algorithm finished.\"));\n\n return true;\n}\n\nbool COptMethodTruncatedNewton::initialize()\n{\n cleanup();\n\n if (!COptMethod::initialize()) return false;\n\n mVariableSize = (C_INT) mpOptItem->size();\n mCurrent.resize(mVariableSize);\n mBest.resize(mVariableSize);\n\n mContinue = true;\n mBestValue = std::numeric_limits<C_FLOAT64>::infinity();\n mGradient.resize(mVariableSize);\n\n return true;\n}\n\nbool COptMethodTruncatedNewton::cleanup()\n{\n return true;\n}\n\n\/\/ callback function, evaluate the value of the objective function and its gradient\n\/\/(by finite differences), translated by f2c, edited by Pedro and then modified for COPASI by Joseph\nC_INT COptMethodTruncatedNewton::sFun(C_INT *n, C_FLOAT64 *x, C_FLOAT64 *f, C_FLOAT64 *g)\n{\n C_INT i;\n\n \/\/ set the parameter values\n for (i = 0; i < *n; i++)\n *mContainerVariables[i] = (x[i]);\n\n \/\/carry out the function evaluation\n *f = evaluate();\n\n \/\/ Check whether we improved\n if (mEvaluationValue < mBestValue)\n {\n \/\/ We found a new best value lets report it.\n \/\/ and store that value\n for (i = 0; i < *n; i++)\n mBest[i] = x[i];\n\n mBestValue = mEvaluationValue;\n mContinue = mpOptProblem->setSolution(mBestValue, mBest);\n\n \/\/ We found a new best value lets report it.\n mpParentTask->output(COutputInterface::DURING);\n }\n\n \/\/ Calculate the gradient\n for (i = 0; i < *n && mContinue; i++)\n {\n if (x[i] != 0.0)\n {\n *mContainerVariables[i] = (x[i] * 1.001);\n g[i] = (evaluate() - *f) \/ (x[i] * 0.001);\n else\n {\n \/\/ why use 1e-7? shouldn't this be epsilon, or something like that?\n *mContainerVariables[i] = (1e-7);\n g[i] = (evaluate() - *f) \/ 1e-7;\n\n if (mLogVerbosity > 2)\n {\n std::ostringstream auxStream;\n auxStream << \"Calculating gradient for zero valued parameter \" << i << \", using 1e-7, results in \" << g[i] << \".\";\n mMethodLog.enterLogEntry(COptLogEntry(auxStream.str()));\n }\n }\n\n *mContainerVariables[i] = (x[i]);\n }\n\n if (!mContinue)\n throw bool(mContinue);\n\n return 0;\n }\n\n const C_FLOAT64 & COptMethodTruncatedNewton::evaluate()\n {\n \/\/ We do not need to check whether the parametric constraints are fulfilled\n \/\/ since the parameters are created within the bounds.\n mContinue = mpOptProblem->calculate();\n mEvaluationValue = mpOptProblem->getCalculateValue();\n\n \/\/ when we leave the either the parameter or functional domain\n \/\/ we penalize the objective value by forcing it to be larger\n \/\/ than the best value recorded so far.\n if (mEvaluationValue < mBestValue &&\n (!mpOptProblem->checkParametricConstraints() ||\n !mpOptProblem->checkFunctionalConstraints()))\n mEvaluationValue = mBestValue + mBestValue - mEvaluationValue;\n\n return mEvaluationValue;\n }\n\n unsigned C_INT32 COptMethodTruncatedNewton::getMaxLogVerbosity() const\n {\n return 1;\n }\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"helpviewer.h\"\n\n#if defined(QT_NO_WEBKIT)\n\n#include \"helpconstants.h\"\n#include \"helpviewer_p.h\"\n#include \"helpmanager.h\"\n\n#include <QtGui\/QApplication>\n#include <QtGui\/QClipboard>\n#include <QtGui\/QContextMenuEvent>\n#include <QtGui\/QKeyEvent>\n#include <QtGui\/QMenu>\n\n#include <QtHelp\/QHelpEngineCore>\n\nusing namespace Find;\nusing namespace Help;\nusing namespace Help::Internal;\n\n\/\/ -- HelpViewer\n\nHelpViewer::HelpViewer(qreal zoom, QWidget *parent)\n : QTextBrowser(parent)\n , d(new HelpViewerPrivate(zoom))\n{\n QPalette p = palette();\n p.setColor(QPalette::Inactive, QPalette::Highlight,\n p.color(QPalette::Active, QPalette::Highlight));\n p.setColor(QPalette::Inactive, QPalette::HighlightedText,\n p.color(QPalette::Active, QPalette::HighlightedText));\n setPalette(p);\n\n installEventFilter(this);\n document()->setDocumentMargin(8);\n\n QFont font = viewerFont();\n font.setPointSize(int(font.pointSize() + zoom));\n setViewerFont(font);\n\n connect(this, SIGNAL(sourceChanged(QUrl)), this, SIGNAL(titleChanged()));\n connect(this, SIGNAL(loadFinished(bool)), this, SLOT(setLoadFinished(bool)));\n}\n\nHelpViewer::~HelpViewer()\n{\n delete d;\n}\n\nQFont HelpViewer::viewerFont() const\n{\n const QHelpEngineCore &engine = HelpManager::helpEngineCore();\n return qVariantValue<QFont>(engine.customValue(QLatin1String(\"font\"),\n qApp->font()));\n}\n\nvoid HelpViewer::setViewerFont(const QFont &newFont)\n{\n if (font() != newFont) {\n d->forceFont = true;\n setFont(newFont);\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::scaleUp()\n{\n if (d->zoomCount < 10) {\n d->zoomCount++;\n d->forceFont = true;\n zoomIn();\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::scaleDown()\n{\n if (d->zoomCount > -5) {\n d->zoomCount--;\n d->forceFont = true;\n zoomOut();\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::resetScale()\n{\n if (d->zoomCount != 0) {\n d->forceFont = true;\n zoomOut(d->zoomCount);\n d->forceFont = false;\n }\n d->zoomCount = 0;\n}\n\nqreal HelpViewer::scale() const\n{\n return d->zoomCount;\n}\n\nQString HelpViewer::title() const\n{\n return documentTitle();\n}\n\nvoid HelpViewer::setTitle(const QString &title)\n{\n setDocumentTitle(title);\n}\n\nQUrl HelpViewer::source() const\n{\n return QTextBrowser::source();\n}\n\nvoid HelpViewer::setSource(const QUrl &url)\n{\n const QString &string = url.toString();\n if (url.isValid() && string != QLatin1String(\"help\")) {\n if (launchWithExternalApp(url))\n return;\n\n const QHelpEngineCore &engine = HelpManager::instance().helpEngineCore();\n const QUrl &resolvedUrl = engine.findFile(url);\n if (resolvedUrl.isValid()) {\n QTextBrowser::setSource(resolvedUrl);\n emit loadFinished(true);\n return;\n }\n }\n\n QTextBrowser::setSource(url);\n setHtml(string == Help::Constants::AboutBlank ? AboutBlankPage\n : PageNotFoundMessage.arg(url.toString()));\n emit loadFinished(true);\n}\n\nQString HelpViewer::selectedText() const\n{\n return textCursor().selectedText();\n}\n\nbool HelpViewer::isForwardAvailable() const\n{\n return QTextBrowser::isForwardAvailable();\n}\n\nbool HelpViewer::isBackwardAvailable() const\n{\n return QTextBrowser::isBackwardAvailable();\n}\n\nbool HelpViewer::findText(const QString &text, IFindSupport::FindFlags flags,\n bool incremental, bool fromSearch)\n{\n QTextDocument *doc = document();\n QTextCursor cursor = textCursor();\n if (!doc || cursor.isNull())\n return false;\n\n const int position = cursor.selectionStart();\n if (incremental)\n cursor.setPosition(position);\n\n QTextDocument::FindFlags f = IFindSupport::textDocumentFlagsForFindFlags(flags);\n QTextCursor found = doc->find(text, cursor, f);\n if (found.isNull()) {\n if ((flags & Find::IFindSupport::FindBackward) == 0)\n cursor.movePosition(QTextCursor::Start);\n else\n cursor.movePosition(QTextCursor::End);\n found = doc->find(text, cursor, f);\n }\n\n if (fromSearch) {\n cursor.beginEditBlock();\n viewport()->setUpdatesEnabled(false);\n\n QTextCharFormat marker;\n marker.setForeground(Qt::red);\n cursor.movePosition(QTextCursor::Start);\n setTextCursor(cursor);\n\n while (find(text)) {\n QTextCursor hit = textCursor();\n hit.mergeCharFormat(marker);\n }\n\n viewport()->setUpdatesEnabled(true);\n cursor.endEditBlock();\n }\n\n bool cursorIsNull = found.isNull();\n if (cursorIsNull) {\n found = textCursor();\n found.setPosition(position);\n }\n setTextCursor(found);\n return cursorIsNull;\n}\n\n\/\/ -- public slots\n\nvoid HelpViewer::copy()\n{\n QTextBrowser::copy();\n}\n\nvoid HelpViewer::forward()\n{\n QTextBrowser::forward();\n}\n\nvoid HelpViewer::backward()\n{\n QTextBrowser::backward();\n}\n\n\/\/ -- protected\n\nvoid HelpViewer::keyPressEvent(QKeyEvent *e)\n{\n if ((e->key() == Qt::Key_Home && e->modifiers() != Qt::NoModifier)\n || (e->key() == Qt::Key_End && e->modifiers() != Qt::NoModifier)) {\n QKeyEvent* event = new QKeyEvent(e->type(), e->key(), Qt::NoModifier,\n e->text(), e->isAutoRepeat(), e->count());\n e = event;\n }\n QTextBrowser::keyPressEvent(e);\n}\n\nvoid HelpViewer::wheelEvent(QWheelEvent *e)\n{\n if (e->modifiers() == Qt::ControlModifier) {\n e->accept();\n e->delta() > 0 ? scaleUp() : scaleDown();\n } else {\n QTextBrowser::wheelEvent(e);\n }\n}\n\nvoid HelpViewer::mousePressEvent(QMouseEvent *e)\n{\n#ifdef Q_OS_LINUX\n if (handleForwardBackwardMouseButtons(e))\n return;\n#endif\n QTextBrowser::mousePressEvent(e);\n}\n\nvoid HelpViewer::mouseReleaseEvent(QMouseEvent *e)\n{\n#ifndef Q_OS_LINUX\n if (handleForwardBackwardMouseButtons(e))\n return;\n#endif\n\n bool controlPressed = e->modifiers() & Qt::ControlModifier;\n if ((controlPressed && d->hasAnchorAt(this, e->pos())) ||\n (e->button() == Qt::MidButton && d->hasAnchorAt(this, e->pos()))) {\n d->openLinkInNewPage();\n return;\n }\n\n QTextBrowser::mouseReleaseEvent(e);\n}\n\n\/\/ -- private slots\n\nvoid HelpViewer::actionChanged()\n{\n \/\/ stub\n}\n\nvoid HelpViewer::setLoadFinished(bool ok)\n{\n Q_UNUSED(ok)\n emit sourceChanged(source());\n}\n\n\/\/ -- private\n\nbool HelpViewer::eventFilter(QObject *obj, QEvent *event)\n{\n if (event->type() == QEvent::FontChange && !d->forceFont)\n return true;\n return QTextBrowser::eventFilter(obj, event);\n}\n\nvoid HelpViewer::contextMenuEvent(QContextMenuEvent *event)\n{\n QMenu menu(QLatin1String(\"\"), 0);\n\n QUrl link;\n QAction *copyAnchorAction = 0;\n if (d->hasAnchorAt(this, event->pos())) {\n link = anchorAt(event->pos());\n if (link.isRelative())\n link = source().resolved(link);\n menu.addAction(tr(\"Open Link\"), d, SLOT(openLink()));\n menu.addAction(tr(\"Open Link as New Page\"), d, SLOT(openLinkInNewPage()));\n\n if (!link.isEmpty() && link.isValid())\n copyAnchorAction = menu.addAction(tr(\"Copy Link\"));\n } else if (!selectedText().isEmpty()) {\n menu.addAction(tr(\"Copy\"), this, SLOT(copy()));\n } else {\n menu.addAction(tr(\"Reload\"), this, SLOT(reload()));\n }\n\n if (copyAnchorAction == menu.exec(event->globalPos()))\n QApplication::clipboard()->setText(link.toString());\n}\n\nQVariant HelpViewer::loadResource(int type, const QUrl &name)\n{\n QByteArray ba;\n if (type < 4) {\n const QHelpEngineCore &engine = HelpManager::instance().helpEngineCore();\n ba = engine.fileData(name);\n if (name.toString().endsWith(QLatin1String(\".svg\"), Qt::CaseInsensitive)) {\n QImage image;\n image.loadFromData(ba, \"svg\");\n if (!image.isNull())\n return image;\n }\n }\n return ba;\n}\n\n#endif \/\/ QT_NO_WEBKIT\n<commit_msg>The return value was reversed, though not checked really.<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"helpviewer.h\"\n\n#if defined(QT_NO_WEBKIT)\n\n#include \"helpconstants.h\"\n#include \"helpviewer_p.h\"\n#include \"helpmanager.h\"\n\n#include <QtGui\/QApplication>\n#include <QtGui\/QClipboard>\n#include <QtGui\/QContextMenuEvent>\n#include <QtGui\/QKeyEvent>\n#include <QtGui\/QMenu>\n\n#include <QtHelp\/QHelpEngineCore>\n\nusing namespace Find;\nusing namespace Help;\nusing namespace Help::Internal;\n\n\/\/ -- HelpViewer\n\nHelpViewer::HelpViewer(qreal zoom, QWidget *parent)\n : QTextBrowser(parent)\n , d(new HelpViewerPrivate(zoom))\n{\n QPalette p = palette();\n p.setColor(QPalette::Inactive, QPalette::Highlight,\n p.color(QPalette::Active, QPalette::Highlight));\n p.setColor(QPalette::Inactive, QPalette::HighlightedText,\n p.color(QPalette::Active, QPalette::HighlightedText));\n setPalette(p);\n\n installEventFilter(this);\n document()->setDocumentMargin(8);\n\n QFont font = viewerFont();\n font.setPointSize(int(font.pointSize() + zoom));\n setViewerFont(font);\n\n connect(this, SIGNAL(sourceChanged(QUrl)), this, SIGNAL(titleChanged()));\n connect(this, SIGNAL(loadFinished(bool)), this, SLOT(setLoadFinished(bool)));\n}\n\nHelpViewer::~HelpViewer()\n{\n delete d;\n}\n\nQFont HelpViewer::viewerFont() const\n{\n const QHelpEngineCore &engine = HelpManager::helpEngineCore();\n return qVariantValue<QFont>(engine.customValue(QLatin1String(\"font\"),\n qApp->font()));\n}\n\nvoid HelpViewer::setViewerFont(const QFont &newFont)\n{\n if (font() != newFont) {\n d->forceFont = true;\n setFont(newFont);\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::scaleUp()\n{\n if (d->zoomCount < 10) {\n d->zoomCount++;\n d->forceFont = true;\n zoomIn();\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::scaleDown()\n{\n if (d->zoomCount > -5) {\n d->zoomCount--;\n d->forceFont = true;\n zoomOut();\n d->forceFont = false;\n }\n}\n\nvoid HelpViewer::resetScale()\n{\n if (d->zoomCount != 0) {\n d->forceFont = true;\n zoomOut(d->zoomCount);\n d->forceFont = false;\n }\n d->zoomCount = 0;\n}\n\nqreal HelpViewer::scale() const\n{\n return d->zoomCount;\n}\n\nQString HelpViewer::title() const\n{\n return documentTitle();\n}\n\nvoid HelpViewer::setTitle(const QString &title)\n{\n setDocumentTitle(title);\n}\n\nQUrl HelpViewer::source() const\n{\n return QTextBrowser::source();\n}\n\nvoid HelpViewer::setSource(const QUrl &url)\n{\n const QString &string = url.toString();\n if (url.isValid() && string != QLatin1String(\"help\")) {\n if (launchWithExternalApp(url))\n return;\n\n const QHelpEngineCore &engine = HelpManager::instance().helpEngineCore();\n const QUrl &resolvedUrl = engine.findFile(url);\n if (resolvedUrl.isValid()) {\n QTextBrowser::setSource(resolvedUrl);\n emit loadFinished(true);\n return;\n }\n }\n\n QTextBrowser::setSource(url);\n setHtml(string == Help::Constants::AboutBlank ? AboutBlankPage\n : PageNotFoundMessage.arg(url.toString()));\n emit loadFinished(true);\n}\n\nQString HelpViewer::selectedText() const\n{\n return textCursor().selectedText();\n}\n\nbool HelpViewer::isForwardAvailable() const\n{\n return QTextBrowser::isForwardAvailable();\n}\n\nbool HelpViewer::isBackwardAvailable() const\n{\n return QTextBrowser::isBackwardAvailable();\n}\n\nbool HelpViewer::findText(const QString &text, IFindSupport::FindFlags flags,\n bool incremental, bool fromSearch)\n{\n QTextDocument *doc = document();\n QTextCursor cursor = textCursor();\n if (!doc || cursor.isNull())\n return false;\n\n const int position = cursor.selectionStart();\n if (incremental)\n cursor.setPosition(position);\n\n QTextDocument::FindFlags f = IFindSupport::textDocumentFlagsForFindFlags(flags);\n QTextCursor found = doc->find(text, cursor, f);\n if (found.isNull()) {\n if ((flags & Find::IFindSupport::FindBackward) == 0)\n cursor.movePosition(QTextCursor::Start);\n else\n cursor.movePosition(QTextCursor::End);\n found = doc->find(text, cursor, f);\n }\n\n if (fromSearch) {\n cursor.beginEditBlock();\n viewport()->setUpdatesEnabled(false);\n\n QTextCharFormat marker;\n marker.setForeground(Qt::red);\n cursor.movePosition(QTextCursor::Start);\n setTextCursor(cursor);\n\n while (find(text)) {\n QTextCursor hit = textCursor();\n hit.mergeCharFormat(marker);\n }\n\n viewport()->setUpdatesEnabled(true);\n cursor.endEditBlock();\n }\n\n bool cursorIsNull = found.isNull();\n if (cursorIsNull) {\n found = textCursor();\n found.setPosition(position);\n }\n setTextCursor(found);\n return !cursorIsNull;\n}\n\n\/\/ -- public slots\n\nvoid HelpViewer::copy()\n{\n QTextBrowser::copy();\n}\n\nvoid HelpViewer::forward()\n{\n QTextBrowser::forward();\n}\n\nvoid HelpViewer::backward()\n{\n QTextBrowser::backward();\n}\n\n\/\/ -- protected\n\nvoid HelpViewer::keyPressEvent(QKeyEvent *e)\n{\n if ((e->key() == Qt::Key_Home && e->modifiers() != Qt::NoModifier)\n || (e->key() == Qt::Key_End && e->modifiers() != Qt::NoModifier)) {\n QKeyEvent* event = new QKeyEvent(e->type(), e->key(), Qt::NoModifier,\n e->text(), e->isAutoRepeat(), e->count());\n e = event;\n }\n QTextBrowser::keyPressEvent(e);\n}\n\nvoid HelpViewer::wheelEvent(QWheelEvent *e)\n{\n if (e->modifiers() == Qt::ControlModifier) {\n e->accept();\n e->delta() > 0 ? scaleUp() : scaleDown();\n } else {\n QTextBrowser::wheelEvent(e);\n }\n}\n\nvoid HelpViewer::mousePressEvent(QMouseEvent *e)\n{\n#ifdef Q_OS_LINUX\n if (handleForwardBackwardMouseButtons(e))\n return;\n#endif\n QTextBrowser::mousePressEvent(e);\n}\n\nvoid HelpViewer::mouseReleaseEvent(QMouseEvent *e)\n{\n#ifndef Q_OS_LINUX\n if (handleForwardBackwardMouseButtons(e))\n return;\n#endif\n\n bool controlPressed = e->modifiers() & Qt::ControlModifier;\n if ((controlPressed && d->hasAnchorAt(this, e->pos())) ||\n (e->button() == Qt::MidButton && d->hasAnchorAt(this, e->pos()))) {\n d->openLinkInNewPage();\n return;\n }\n\n QTextBrowser::mouseReleaseEvent(e);\n}\n\n\/\/ -- private slots\n\nvoid HelpViewer::actionChanged()\n{\n \/\/ stub\n}\n\nvoid HelpViewer::setLoadFinished(bool ok)\n{\n Q_UNUSED(ok)\n emit sourceChanged(source());\n}\n\n\/\/ -- private\n\nbool HelpViewer::eventFilter(QObject *obj, QEvent *event)\n{\n if (event->type() == QEvent::FontChange && !d->forceFont)\n return true;\n return QTextBrowser::eventFilter(obj, event);\n}\n\nvoid HelpViewer::contextMenuEvent(QContextMenuEvent *event)\n{\n QMenu menu(QLatin1String(\"\"), 0);\n\n QUrl link;\n QAction *copyAnchorAction = 0;\n if (d->hasAnchorAt(this, event->pos())) {\n link = anchorAt(event->pos());\n if (link.isRelative())\n link = source().resolved(link);\n menu.addAction(tr(\"Open Link\"), d, SLOT(openLink()));\n menu.addAction(tr(\"Open Link as New Page\"), d, SLOT(openLinkInNewPage()));\n\n if (!link.isEmpty() && link.isValid())\n copyAnchorAction = menu.addAction(tr(\"Copy Link\"));\n } else if (!selectedText().isEmpty()) {\n menu.addAction(tr(\"Copy\"), this, SLOT(copy()));\n } else {\n menu.addAction(tr(\"Reload\"), this, SLOT(reload()));\n }\n\n if (copyAnchorAction == menu.exec(event->globalPos()))\n QApplication::clipboard()->setText(link.toString());\n}\n\nQVariant HelpViewer::loadResource(int type, const QUrl &name)\n{\n QByteArray ba;\n if (type < 4) {\n const QHelpEngineCore &engine = HelpManager::instance().helpEngineCore();\n ba = engine.fileData(name);\n if (name.toString().endsWith(QLatin1String(\".svg\"), Qt::CaseInsensitive)) {\n QImage image;\n image.loadFromData(ba, \"svg\");\n if (!image.isNull())\n return image;\n }\n }\n return ba;\n}\n\n#endif \/\/ QT_NO_WEBKIT\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2008-2016 the Urho3D project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/IO\/Log.h\"\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n#include \"..\/Physics\/PhysicsEvents.h\"\n#endif\n#include \"..\/Scene\/LogicComponent.h\"\n#include \"..\/Scene\/Scene.h\"\n#include \"..\/Scene\/SceneEvents.h\"\n\nnamespace Urho3D\n{\n\nLogicComponent::LogicComponent(Context* context) :\n Component(context),\n updateEventMask_(USE_UPDATE | USE_POSTUPDATE | USE_FIXEDUPDATE | USE_FIXEDPOSTUPDATE),\n currentEventMask_(0),\n delayedStartCalled_(false)\n{\n}\n\nLogicComponent::~LogicComponent()\n{\n}\n\nvoid LogicComponent::OnSetEnabled()\n{\n UpdateEventSubscription();\n}\n\nvoid LogicComponent::Update(float timeStep)\n{\n}\n\nvoid LogicComponent::PostUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::FixedUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::FixedPostUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::SetUpdateEventMask(unsigned char mask)\n{\n if (updateEventMask_ != mask)\n {\n updateEventMask_ = mask;\n UpdateEventSubscription();\n }\n}\n\nvoid LogicComponent::OnNodeSet(Node* node)\n{\n if (node)\n {\n \/\/ Execute the user-defined start function\n Start();\n }\n else\n {\n \/\/ We are being detached from a node: execute user-defined stop function and prepare for destruction\n Stop();\n }\n}\n\nvoid LogicComponent::OnSceneSet(Scene* scene)\n{\n if (scene)\n UpdateEventSubscription();\n else\n {\n UnsubscribeFromEvent(E_SCENEUPDATE);\n UnsubscribeFromEvent(E_SCENEPOSTUPDATE);\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n UnsubscribeFromEvent(E_PHYSICSPRESTEP);\n UnsubscribeFromEvent(E_PHYSICSPOSTSTEP);\n#endif\n currentEventMask_ = 0;\n }\n}\n\nvoid LogicComponent::UpdateEventSubscription()\n{\n Scene* scene = GetScene();\n if (!scene)\n return;\n\n bool enabled = IsEnabledEffective();\n\n bool needUpdate = enabled && ((updateEventMask_ & USE_UPDATE) || !delayedStartCalled_);\n if (needUpdate && !(currentEventMask_ & USE_UPDATE))\n {\n SubscribeToEvent(scene, E_SCENEUPDATE, URHO3D_HANDLER(LogicComponent, HandleSceneUpdate));\n currentEventMask_ |= USE_UPDATE;\n }\n else if (!needUpdate && (currentEventMask_ & USE_UPDATE))\n {\n UnsubscribeFromEvent(scene, E_SCENEUPDATE);\n currentEventMask_ &= ~USE_UPDATE;\n }\n\n bool needPostUpdate = enabled && (updateEventMask_ & USE_POSTUPDATE);\n if (needPostUpdate && !(currentEventMask_ & USE_POSTUPDATE))\n {\n SubscribeToEvent(scene, E_SCENEPOSTUPDATE, URHO3D_HANDLER(LogicComponent, HandleScenePostUpdate));\n currentEventMask_ |= USE_POSTUPDATE;\n }\n else if (!needUpdate && (currentEventMask_ & USE_POSTUPDATE))\n {\n UnsubscribeFromEvent(scene, E_SCENEPOSTUPDATE);\n currentEventMask_ &= ~USE_POSTUPDATE;\n }\n\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n Component* world = GetFixedUpdateSource();\n if (!world)\n return;\n\n bool needFixedUpdate = enabled && (updateEventMask_ & USE_FIXEDUPDATE);\n if (needFixedUpdate && !(currentEventMask_ & USE_FIXEDUPDATE))\n {\n SubscribeToEvent(world, E_PHYSICSPRESTEP, URHO3D_HANDLER(LogicComponent, HandlePhysicsPreStep));\n currentEventMask_ |= USE_FIXEDUPDATE;\n }\n else if (!needFixedUpdate && (currentEventMask_ & USE_FIXEDUPDATE))\n {\n UnsubscribeFromEvent(world, E_PHYSICSPRESTEP);\n currentEventMask_ &= ~USE_FIXEDUPDATE;\n }\n\n bool needFixedPostUpdate = enabled && (updateEventMask_ & USE_FIXEDPOSTUPDATE);\n if (needFixedPostUpdate && !(currentEventMask_ & USE_FIXEDPOSTUPDATE))\n {\n SubscribeToEvent(world, E_PHYSICSPOSTSTEP, URHO3D_HANDLER(LogicComponent, HandlePhysicsPostStep));\n currentEventMask_ |= USE_FIXEDPOSTUPDATE;\n }\n else if (!needFixedPostUpdate && (currentEventMask_ & USE_FIXEDPOSTUPDATE))\n {\n UnsubscribeFromEvent(world, E_PHYSICSPOSTSTEP);\n currentEventMask_ &= ~USE_FIXEDPOSTUPDATE;\n }\n#endif\n}\n\nvoid LogicComponent::HandleSceneUpdate(StringHash eventType, VariantMap& eventData)\n{\n using namespace SceneUpdate;\n\n \/\/ Execute user-defined delayed start function before first update\n if (!delayedStartCalled_)\n {\n DelayedStart();\n delayedStartCalled_ = true;\n\n \/\/ If did not need actual update events, unsubscribe now\n if (!(updateEventMask_ & USE_UPDATE))\n {\n UnsubscribeFromEvent(GetScene(), E_SCENEUPDATE);\n currentEventMask_ &= ~USE_UPDATE;\n return;\n }\n }\n\n \/\/ Then execute user-defined update function\n Update(eventData[P_TIMESTEP].GetFloat());\n}\n\nvoid LogicComponent::HandleScenePostUpdate(StringHash eventType, VariantMap& eventData)\n{\n using namespace ScenePostUpdate;\n\n \/\/ Execute user-defined post-update function\n PostUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n\nvoid LogicComponent::HandlePhysicsPreStep(StringHash eventType, VariantMap& eventData)\n{\n using namespace PhysicsPreStep;\n\n \/\/ Execute user-defined delayed start function before first fixed update if not called yet\n if (!delayedStartCalled_)\n {\n DelayedStart();\n delayedStartCalled_ = true;\n }\n\n \/\/ Execute user-defined fixed update function\n FixedUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\nvoid LogicComponent::HandlePhysicsPostStep(StringHash eventType, VariantMap& eventData)\n{\n using namespace PhysicsPostStep;\n\n \/\/ Execute user-defined fixed post-update function\n FixedPostUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\n#endif\n\n}\n<commit_msg>Fix wrong bool check.<commit_after>\/\/\n\/\/ Copyright (c) 2008-2016 the Urho3D project.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n#include \"..\/Precompiled.h\"\n\n#include \"..\/IO\/Log.h\"\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n#include \"..\/Physics\/PhysicsEvents.h\"\n#endif\n#include \"..\/Scene\/LogicComponent.h\"\n#include \"..\/Scene\/Scene.h\"\n#include \"..\/Scene\/SceneEvents.h\"\n\nnamespace Urho3D\n{\n\nLogicComponent::LogicComponent(Context* context) :\n Component(context),\n updateEventMask_(USE_UPDATE | USE_POSTUPDATE | USE_FIXEDUPDATE | USE_FIXEDPOSTUPDATE),\n currentEventMask_(0),\n delayedStartCalled_(false)\n{\n}\n\nLogicComponent::~LogicComponent()\n{\n}\n\nvoid LogicComponent::OnSetEnabled()\n{\n UpdateEventSubscription();\n}\n\nvoid LogicComponent::Update(float timeStep)\n{\n}\n\nvoid LogicComponent::PostUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::FixedUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::FixedPostUpdate(float timeStep)\n{\n}\n\nvoid LogicComponent::SetUpdateEventMask(unsigned char mask)\n{\n if (updateEventMask_ != mask)\n {\n updateEventMask_ = mask;\n UpdateEventSubscription();\n }\n}\n\nvoid LogicComponent::OnNodeSet(Node* node)\n{\n if (node)\n {\n \/\/ Execute the user-defined start function\n Start();\n }\n else\n {\n \/\/ We are being detached from a node: execute user-defined stop function and prepare for destruction\n Stop();\n }\n}\n\nvoid LogicComponent::OnSceneSet(Scene* scene)\n{\n if (scene)\n UpdateEventSubscription();\n else\n {\n UnsubscribeFromEvent(E_SCENEUPDATE);\n UnsubscribeFromEvent(E_SCENEPOSTUPDATE);\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n UnsubscribeFromEvent(E_PHYSICSPRESTEP);\n UnsubscribeFromEvent(E_PHYSICSPOSTSTEP);\n#endif\n currentEventMask_ = 0;\n }\n}\n\nvoid LogicComponent::UpdateEventSubscription()\n{\n Scene* scene = GetScene();\n if (!scene)\n return;\n\n bool enabled = IsEnabledEffective();\n\n bool needUpdate = enabled && ((updateEventMask_ & USE_UPDATE) || !delayedStartCalled_);\n if (needUpdate && !(currentEventMask_ & USE_UPDATE))\n {\n SubscribeToEvent(scene, E_SCENEUPDATE, URHO3D_HANDLER(LogicComponent, HandleSceneUpdate));\n currentEventMask_ |= USE_UPDATE;\n }\n else if (!needUpdate && (currentEventMask_ & USE_UPDATE))\n {\n UnsubscribeFromEvent(scene, E_SCENEUPDATE);\n currentEventMask_ &= ~USE_UPDATE;\n }\n\n bool needPostUpdate = enabled && (updateEventMask_ & USE_POSTUPDATE);\n if (needPostUpdate && !(currentEventMask_ & USE_POSTUPDATE))\n {\n SubscribeToEvent(scene, E_SCENEPOSTUPDATE, URHO3D_HANDLER(LogicComponent, HandleScenePostUpdate));\n currentEventMask_ |= USE_POSTUPDATE;\n }\n else if (!needPostUpdate && (currentEventMask_ & USE_POSTUPDATE))\n {\n UnsubscribeFromEvent(scene, E_SCENEPOSTUPDATE);\n currentEventMask_ &= ~USE_POSTUPDATE;\n }\n\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n Component* world = GetFixedUpdateSource();\n if (!world)\n return;\n\n bool needFixedUpdate = enabled && (updateEventMask_ & USE_FIXEDUPDATE);\n if (needFixedUpdate && !(currentEventMask_ & USE_FIXEDUPDATE))\n {\n SubscribeToEvent(world, E_PHYSICSPRESTEP, URHO3D_HANDLER(LogicComponent, HandlePhysicsPreStep));\n currentEventMask_ |= USE_FIXEDUPDATE;\n }\n else if (!needFixedUpdate && (currentEventMask_ & USE_FIXEDUPDATE))\n {\n UnsubscribeFromEvent(world, E_PHYSICSPRESTEP);\n currentEventMask_ &= ~USE_FIXEDUPDATE;\n }\n\n bool needFixedPostUpdate = enabled && (updateEventMask_ & USE_FIXEDPOSTUPDATE);\n if (needFixedPostUpdate && !(currentEventMask_ & USE_FIXEDPOSTUPDATE))\n {\n SubscribeToEvent(world, E_PHYSICSPOSTSTEP, URHO3D_HANDLER(LogicComponent, HandlePhysicsPostStep));\n currentEventMask_ |= USE_FIXEDPOSTUPDATE;\n }\n else if (!needFixedPostUpdate && (currentEventMask_ & USE_FIXEDPOSTUPDATE))\n {\n UnsubscribeFromEvent(world, E_PHYSICSPOSTSTEP);\n currentEventMask_ &= ~USE_FIXEDPOSTUPDATE;\n }\n#endif\n}\n\nvoid LogicComponent::HandleSceneUpdate(StringHash eventType, VariantMap& eventData)\n{\n using namespace SceneUpdate;\n\n \/\/ Execute user-defined delayed start function before first update\n if (!delayedStartCalled_)\n {\n DelayedStart();\n delayedStartCalled_ = true;\n\n \/\/ If did not need actual update events, unsubscribe now\n if (!(updateEventMask_ & USE_UPDATE))\n {\n UnsubscribeFromEvent(GetScene(), E_SCENEUPDATE);\n currentEventMask_ &= ~USE_UPDATE;\n return;\n }\n }\n\n \/\/ Then execute user-defined update function\n Update(eventData[P_TIMESTEP].GetFloat());\n}\n\nvoid LogicComponent::HandleScenePostUpdate(StringHash eventType, VariantMap& eventData)\n{\n using namespace ScenePostUpdate;\n\n \/\/ Execute user-defined post-update function\n PostUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\n#if defined(URHO3D_PHYSICS) || defined(URHO3D_URHO2D)\n\nvoid LogicComponent::HandlePhysicsPreStep(StringHash eventType, VariantMap& eventData)\n{\n using namespace PhysicsPreStep;\n\n \/\/ Execute user-defined delayed start function before first fixed update if not called yet\n if (!delayedStartCalled_)\n {\n DelayedStart();\n delayedStartCalled_ = true;\n }\n\n \/\/ Execute user-defined fixed update function\n FixedUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\nvoid LogicComponent::HandlePhysicsPostStep(StringHash eventType, VariantMap& eventData)\n{\n using namespace PhysicsPostStep;\n\n \/\/ Execute user-defined fixed post-update function\n FixedPostUpdate(eventData[P_TIMESTEP].GetFloat());\n}\n\n#endif\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2013-2015 Jeffrey Pfau\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. *\/\n#include \"InputProfile.h\"\n\n#include \"InputController.h\"\n\n#include <QRegExp>\n\nusing namespace QGBA;\n\nconst InputProfile InputProfile::s_defaultMaps[] = {\n\t{\n\t\t\"XInput Controller #\\\\d+\", \/\/ XInput (Windows)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 11,\n\t\t\/*keyB *\/ 10,\n\t\t\/*keySelect *\/ 5,\n\t\t\/*keyStart *\/ 4,\n\t\t\/*keyRight *\/ 3,\n\t\t\/*keyLeft *\/ 2,\n\t\t\/*keyUp *\/ 0,\n\t\t\/*keyDown *\/ 1,\n\t\t\/*keyR *\/ 9,\n\t\t\/*keyL *\/ 8\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 12},\n\t\t\t{\"saveState\", 13},\n\t\t\t{}\n\t\t},\n\t\t(ShortcutAxis[]) {\n\t\t\t{\"holdFastForward\", GamepadAxisEvent::Direction::POSITIVE, 5},\n\t\t\t{\"holdRewind\", GamepadAxisEvent::Direction::POSITIVE, 4},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"Controller\", \/\/ The Xbox 360 controller drivers on OS X are vague...\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 1,\n\t\t\/*keyB *\/ 0,\n\t\t\/*keySelect *\/ 9,\n\t\t\/*keyStart *\/ 8,\n\t\t\/*keyRight *\/ 14,\n\t\t\/*keyLeft *\/ 13,\n\t\t\/*keyUp *\/ 11,\n\t\t\/*keyDown *\/ 12,\n\t\t\/*keyR *\/ 5,\n\t\t\/*keyL *\/ 4\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 2},\n\t\t\t{\"saveState\", 3},\n\t\t\t{}\n\t\t},\n\t\t(ShortcutAxis[]) {\n\t\t\t{\"holdFastForward\", GamepadAxisEvent::Direction::POSITIVE, 5},\n\t\t\t{\"holdRewind\", GamepadAxisEvent::Direction::POSITIVE, 2},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"PLAYSTATION\\\\(R\\\\)3 Controller\", \/\/ DualShock 3 (OS X)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 13,\n\t\t\/*keyB *\/ 14,\n\t\t\/*keySelect *\/ 0,\n\t\t\/*keyStart *\/ 3,\n\t\t\/*keyRight *\/ 5,\n\t\t\/*keyLeft *\/ 7,\n\t\t\/*keyUp *\/ 4,\n\t\t\/*keyDown *\/ 6,\n\t\t\/*keyR *\/ 11,\n\t\t\/*keyL *\/ 10\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 15},\n\t\t\t{\"saveState\", 12},\n\t\t\t{\"holdFastForward\", 9},\n\t\t\t{\"holdRewind\", 8},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"Wiimote \\\\(..-..-..-..-..-..\\\\)\", \/\/ WJoy (OS X)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 15,\n\t\t\/*keyB *\/ 16,\n\t\t\/*keySelect *\/ 7,\n\t\t\/*keyStart *\/ 6,\n\t\t\/*keyRight *\/ 14,\n\t\t\/*keyLeft *\/ 13,\n\t\t\/*keyUp *\/ 11,\n\t\t\/*keyDown *\/ 12,\n\t\t\/*keyR *\/ 20,\n\t\t\/*keyL *\/ 19\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 18},\n\t\t\t{\"saveState\", 17},\n\t\t\t{\"holdFastForward\", 22},\n\t\t\t{\"holdRewind\", 21},\n\t\t\t{}\n\t\t}\n\t},\n};\n\nconstexpr InputProfile::InputProfile(const char* name,\n int keys[GBA_KEY_MAX],\n const ShortcutButton* shortcutButtons,\n const ShortcutAxis* shortcutAxes,\n AxisValue axes[GBA_KEY_MAX],\n const struct Coord& tiltAxis,\n const struct Coord& gyroAxis,\n float gyroSensitivity)\n\t: m_profileName(name)\n\t, m_keys {\n\t\tkeys[GBA_KEY_A],\n\t\tkeys[GBA_KEY_B],\n\t\tkeys[GBA_KEY_SELECT],\n\t\tkeys[GBA_KEY_START],\n\t\tkeys[GBA_KEY_RIGHT],\n\t\tkeys[GBA_KEY_LEFT],\n\t\tkeys[GBA_KEY_UP],\n\t\tkeys[GBA_KEY_DOWN],\n\t\tkeys[GBA_KEY_R],\n\t\tkeys[GBA_KEY_L]\n\t}\n\t, m_shortcutButtons(shortcutButtons)\n\t, m_shortcutAxes(shortcutAxes)\n\t, m_axes {\n\t\taxes[GBA_KEY_A],\n\t\taxes[GBA_KEY_B],\n\t\taxes[GBA_KEY_SELECT],\n\t\taxes[GBA_KEY_START],\n\t\taxes[GBA_KEY_RIGHT],\n\t\taxes[GBA_KEY_LEFT],\n\t\taxes[GBA_KEY_UP],\n\t\taxes[GBA_KEY_DOWN],\n\t\taxes[GBA_KEY_R],\n\t\taxes[GBA_KEY_L]\n\t}\n\t, m_tiltAxis(tiltAxis)\n\t, m_gyroAxis(gyroAxis)\n\t, m_gyroSensitivity(gyroSensitivity)\n{\n}\n\nconst InputProfile* InputProfile::findProfile(const QString& name) {\n\tfor (size_t i = 0; i < sizeof(s_defaultMaps) \/ sizeof(*s_defaultMaps); ++i) {\n\t\tQRegExp re(s_defaultMaps[i].m_profileName);\n\t\tif (re.exactMatch(name)) {\n\t\t\treturn &s_defaultMaps[i];\n\t\t}\n\t}\n\treturn nullptr;\n}\n\nvoid InputProfile::apply(InputController* controller) const {\n\tfor (size_t i = 0; i < GBA_KEY_MAX; ++i) {\n#ifdef BUILD_SDL\n\t\tcontroller->bindKey(SDL_BINDING_BUTTON, m_keys[i], static_cast<GBAKey>(i));\n\t\tcontroller->bindAxis(SDL_BINDING_BUTTON, m_axes[i].axis, m_axes[i].direction, static_cast<GBAKey>(i));\n#endif\n\t}\n\tcontroller->registerTiltAxisX(m_tiltAxis.x);\n\tcontroller->registerTiltAxisY(m_tiltAxis.y);\n\tcontroller->registerGyroAxisX(m_gyroAxis.x);\n\tcontroller->registerGyroAxisY(m_gyroAxis.y);\n\tcontroller->setGyroSensitivity(m_gyroSensitivity);\n}\n\nbool InputProfile::lookupShortcutButton(const QString& shortcutName, int* button) const {\n\tfor (size_t i = 0; m_shortcutButtons[i].shortcut; ++i) {\n\t\tconst ShortcutButton& shortcut = m_shortcutButtons[i];\n\t\tif (QLatin1String(shortcut.shortcut) == shortcutName) {\n\t\t\t*button = shortcut.button;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool InputProfile::lookupShortcutAxis(const QString& shortcutName, int* axis, GamepadAxisEvent::Direction* direction) const {\n\tfor (size_t i = 0; m_shortcutAxes[i].shortcut; ++i) {\n\t\tconst ShortcutAxis& shortcut = m_shortcutAxes[i];\n\t\tif (QLatin1String(shortcut.shortcut) == shortcutName) {\n\t\t\t*axis = shortcut.axis;\n\t\t\t*direction = shortcut.direction;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n<commit_msg>Qt: Add 360 profile for Linux<commit_after>\/* Copyright (c) 2013-2015 Jeffrey Pfau\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. *\/\n#include \"InputProfile.h\"\n\n#include \"InputController.h\"\n\n#include <QRegExp>\n\nusing namespace QGBA;\n\nconst InputProfile InputProfile::s_defaultMaps[] = {\n\t{\n\t\t\"XInput Controller #\\\\d+\", \/\/ XInput (Windows)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 11,\n\t\t\/*keyB *\/ 10,\n\t\t\/*keySelect *\/ 5,\n\t\t\/*keyStart *\/ 4,\n\t\t\/*keyRight *\/ 3,\n\t\t\/*keyLeft *\/ 2,\n\t\t\/*keyUp *\/ 0,\n\t\t\/*keyDown *\/ 1,\n\t\t\/*keyR *\/ 9,\n\t\t\/*keyL *\/ 8\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 12},\n\t\t\t{\"saveState\", 13},\n\t\t\t{}\n\t\t},\n\t\t(ShortcutAxis[]) {\n\t\t\t{\"holdFastForward\", GamepadAxisEvent::Direction::POSITIVE, 5},\n\t\t\t{\"holdRewind\", GamepadAxisEvent::Direction::POSITIVE, 4},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"(Microsoft X-Box 360 pad|Xbox Gamepad \\\\(userspace driver\\\\))\", \/\/ Linux\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 1,\n\t\t\/*keyB *\/ 0,\n\t\t\/*keySelect *\/ 6,\n\t\t\/*keyStart *\/ 7,\n\t\t\/*keyRight *\/ -1,\n\t\t\/*keyLeft *\/ -1,\n\t\t\/*keyUp *\/ -1,\n\t\t\/*keyDown *\/ -1,\n\t\t\/*keyR *\/ 5,\n\t\t\/*keyL *\/ 4\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 2},\n\t\t\t{\"saveState\", 3},\n\t\t\t{}\n\t\t},\n\t\t(ShortcutAxis[]) {\n\t\t\t{\"holdFastForward\", GamepadAxisEvent::Direction::POSITIVE, 5},\n\t\t\t{\"holdRewind\", GamepadAxisEvent::Direction::POSITIVE, 2},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"Controller\", \/\/ The Xbox 360 controller drivers on OS X are vague...\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 1,\n\t\t\/*keyB *\/ 0,\n\t\t\/*keySelect *\/ 9,\n\t\t\/*keyStart *\/ 8,\n\t\t\/*keyRight *\/ 14,\n\t\t\/*keyLeft *\/ 13,\n\t\t\/*keyUp *\/ 11,\n\t\t\/*keyDown *\/ 12,\n\t\t\/*keyR *\/ 5,\n\t\t\/*keyL *\/ 4\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 2},\n\t\t\t{\"saveState\", 3},\n\t\t\t{}\n\t\t},\n\t\t(ShortcutAxis[]) {\n\t\t\t{\"holdFastForward\", GamepadAxisEvent::Direction::POSITIVE, 5},\n\t\t\t{\"holdRewind\", GamepadAxisEvent::Direction::POSITIVE, 2},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"PLAYSTATION\\\\(R\\\\)3 Controller\", \/\/ DualShock 3 (OS X)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 13,\n\t\t\/*keyB *\/ 14,\n\t\t\/*keySelect *\/ 0,\n\t\t\/*keyStart *\/ 3,\n\t\t\/*keyRight *\/ 5,\n\t\t\/*keyLeft *\/ 7,\n\t\t\/*keyUp *\/ 4,\n\t\t\/*keyDown *\/ 6,\n\t\t\/*keyR *\/ 11,\n\t\t\/*keyL *\/ 10\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 15},\n\t\t\t{\"saveState\", 12},\n\t\t\t{\"holdFastForward\", 9},\n\t\t\t{\"holdRewind\", 8},\n\t\t\t{}\n\t\t}\n\t},\n\t{\n\t\t\"Wiimote \\\\(..-..-..-..-..-..\\\\)\", \/\/ WJoy (OS X)\n\t\t(int[GBA_KEY_MAX]) {\n\t\t\/*keyA *\/ 15,\n\t\t\/*keyB *\/ 16,\n\t\t\/*keySelect *\/ 7,\n\t\t\/*keyStart *\/ 6,\n\t\t\/*keyRight *\/ 14,\n\t\t\/*keyLeft *\/ 13,\n\t\t\/*keyUp *\/ 11,\n\t\t\/*keyDown *\/ 12,\n\t\t\/*keyR *\/ 20,\n\t\t\/*keyL *\/ 19\n\t\t},\n\t\t(ShortcutButton[]) {\n\t\t\t{\"loadState\", 18},\n\t\t\t{\"saveState\", 17},\n\t\t\t{\"holdFastForward\", 22},\n\t\t\t{\"holdRewind\", 21},\n\t\t\t{}\n\t\t}\n\t},\n};\n\nconstexpr InputProfile::InputProfile(const char* name,\n int keys[GBA_KEY_MAX],\n const ShortcutButton* shortcutButtons,\n const ShortcutAxis* shortcutAxes,\n AxisValue axes[GBA_KEY_MAX],\n const struct Coord& tiltAxis,\n const struct Coord& gyroAxis,\n float gyroSensitivity)\n\t: m_profileName(name)\n\t, m_keys {\n\t\tkeys[GBA_KEY_A],\n\t\tkeys[GBA_KEY_B],\n\t\tkeys[GBA_KEY_SELECT],\n\t\tkeys[GBA_KEY_START],\n\t\tkeys[GBA_KEY_RIGHT],\n\t\tkeys[GBA_KEY_LEFT],\n\t\tkeys[GBA_KEY_UP],\n\t\tkeys[GBA_KEY_DOWN],\n\t\tkeys[GBA_KEY_R],\n\t\tkeys[GBA_KEY_L]\n\t}\n\t, m_shortcutButtons(shortcutButtons)\n\t, m_shortcutAxes(shortcutAxes)\n\t, m_axes {\n\t\taxes[GBA_KEY_A],\n\t\taxes[GBA_KEY_B],\n\t\taxes[GBA_KEY_SELECT],\n\t\taxes[GBA_KEY_START],\n\t\taxes[GBA_KEY_RIGHT],\n\t\taxes[GBA_KEY_LEFT],\n\t\taxes[GBA_KEY_UP],\n\t\taxes[GBA_KEY_DOWN],\n\t\taxes[GBA_KEY_R],\n\t\taxes[GBA_KEY_L]\n\t}\n\t, m_tiltAxis(tiltAxis)\n\t, m_gyroAxis(gyroAxis)\n\t, m_gyroSensitivity(gyroSensitivity)\n{\n}\n\nconst InputProfile* InputProfile::findProfile(const QString& name) {\n\tfor (size_t i = 0; i < sizeof(s_defaultMaps) \/ sizeof(*s_defaultMaps); ++i) {\n\t\tQRegExp re(s_defaultMaps[i].m_profileName);\n\t\tif (re.exactMatch(name)) {\n\t\t\treturn &s_defaultMaps[i];\n\t\t}\n\t}\n\treturn nullptr;\n}\n\nvoid InputProfile::apply(InputController* controller) const {\n\tfor (size_t i = 0; i < GBA_KEY_MAX; ++i) {\n#ifdef BUILD_SDL\n\t\tcontroller->bindKey(SDL_BINDING_BUTTON, m_keys[i], static_cast<GBAKey>(i));\n\t\tcontroller->bindAxis(SDL_BINDING_BUTTON, m_axes[i].axis, m_axes[i].direction, static_cast<GBAKey>(i));\n#endif\n\t}\n\tcontroller->registerTiltAxisX(m_tiltAxis.x);\n\tcontroller->registerTiltAxisY(m_tiltAxis.y);\n\tcontroller->registerGyroAxisX(m_gyroAxis.x);\n\tcontroller->registerGyroAxisY(m_gyroAxis.y);\n\tcontroller->setGyroSensitivity(m_gyroSensitivity);\n}\n\nbool InputProfile::lookupShortcutButton(const QString& shortcutName, int* button) const {\n\tfor (size_t i = 0; m_shortcutButtons[i].shortcut; ++i) {\n\t\tconst ShortcutButton& shortcut = m_shortcutButtons[i];\n\t\tif (QLatin1String(shortcut.shortcut) == shortcutName) {\n\t\t\t*button = shortcut.button;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\nbool InputProfile::lookupShortcutAxis(const QString& shortcutName, int* axis, GamepadAxisEvent::Direction* direction) const {\n\tfor (size_t i = 0; m_shortcutAxes[i].shortcut; ++i) {\n\t\tconst ShortcutAxis& shortcut = m_shortcutAxes[i];\n\t\tif (QLatin1String(shortcut.shortcut) == shortcutName) {\n\t\t\t*axis = shortcut.axis;\n\t\t\t*direction = shortcut.direction;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Copyright (c) 2013 Opposite Renderer\n * For the full copyright and license information, please view the LICENSE.txt\n * file that was distributed with this source code.\n*\/\n\n#include \"StandaloneRenderManager.hxx\"\n#include \"renderer\/PPMOptixRenderer.h\"\n#include \"renderer\/PMOptixRenderer.h\"\n#include <QThread>\n#include \"renderer\/Camera.h\"\n#include <QTime>\n#include \"scene\/Scene.h\"\n#include \"clientserver\/RenderServerRenderRequest.h\"\n#include <QCoreApplication>\n#include <QApplication>\n#include \"Application.hxx\"\n\nStandaloneRenderManager::StandaloneRenderManager(QApplication & qApplication, Application & application, const ComputeDevice& device) :\n m_device(device),\n m_renderer(new PMOptixRenderer()), \n m_nextIterationNumber(0),\n m_outputBuffer(NULL),\n m_currentScene(NULL),\n m_compileScene(false),\n m_application(application),\n m_noEmittedSignals(true),\n\tm_logger()\n{\n connect(&application, SIGNAL(sequenceNumberIncremented()), this, SLOT(onSequenceNumberIncremented()));\n connect(&application, SIGNAL(runningStatusChanged()), this, SLOT(onRunningStatusChanged()));\n connect(&application.getSceneManager(), SIGNAL(sceneLoadingNew()), this, SLOT(onSceneLoadingNew()));\n connect(&application.getSceneManager(), SIGNAL(sceneUpdated()), this, SLOT(onSceneUpdated()));\n\n onSceneUpdated();\n\n connect(this, SIGNAL(continueRayTracing()), \n this, SLOT(onContinueRayTracing()), \n Qt::QueuedConnection);\n}\n\nSignalLogger& StandaloneRenderManager::logger()\n{\n\treturn m_logger;\n}\n\nStandaloneRenderManager::~StandaloneRenderManager()\n{\n if(m_outputBuffer != NULL)\n {\n delete[] m_outputBuffer;\n m_outputBuffer = NULL;\n }\n}\n\nvoid StandaloneRenderManager::start()\n{\n m_application.setRendererStatus(RendererStatus::INITIALIZING_ENGINE);\n\tm_renderer->initialize(m_device, &m_logger);\n}\n\nvoid StandaloneRenderManager::onContinueRayTracing()\n{\n renderNextIteration();\n continueRayTracingIfRunningAsync();\n}\n\nvoid StandaloneRenderManager::renderNextIteration()\n{\n try\n {\n if(m_application.getRunningStatus() == RunningStatus::RUNNING && m_currentScene != NULL)\n {\n m_noEmittedSignals = true;\n\n if(m_compileScene)\n {\n m_application.setRendererStatus(RendererStatus::INITIALIZING_SCENE);\n m_renderer->initScene(*m_currentScene);\n m_compileScene = false;\n m_application.setRendererStatus(RendererStatus::RENDERING);\n }\n\n \/\/ We only diplay one every X frames on screen (to make fair comparison with distributed renderer)\n bool shouldOutputIteration = m_nextIterationNumber % 1 == 0;\n\n const double PPMAlpha = 2.0\/3.0;\n QVector<unsigned long long> iterationNumbers;\n QVector<double> ppmRadii;\n\n RenderServerRenderRequestDetails details (m_camera, QByteArray(m_currentScene->getSceneName()), \n m_application.getRenderMethod(), m_application.getWidth(), m_application.getHeight(), PPMAlpha);\n\n RenderServerRenderRequest renderRequest (m_application.getSequenceNumber(), iterationNumbers, ppmRadii, details);\n\n m_renderer->renderNextIteration(m_nextIterationNumber, m_nextIterationNumber, m_PPMRadius, shouldOutputIteration, renderRequest.getDetails());\n const double ppmRadiusSquared = m_PPMRadius*m_PPMRadius;\n const double ppmRadiusSquaredNew = ppmRadiusSquared*(m_nextIterationNumber+PPMAlpha)\/double(m_nextIterationNumber+1);\n m_PPMRadius = sqrt(ppmRadiusSquaredNew);\n\n \/\/ Transfer the output buffer to CPU and signal ready for display\n\n if(shouldOutputIteration)\n {\n if(m_outputBuffer == NULL)\n {\n m_outputBuffer = new float[2000*2000*3];\n }\n m_renderer->getOutputBuffer(m_outputBuffer);\n emit newFrameReadyForDisplay(m_outputBuffer, m_nextIterationNumber);\n }\n\n fillRenderStatistics();\n m_nextIterationNumber++;\n\t\t\t\/\/m_application.setRunningStatus(RunningStatus::PAUSE);\n }\n }\n catch(const std::exception & E)\n {\n m_application.setRunningStatus(RunningStatus::PAUSE);\n QString error = QString(\"%1\").arg(E.what());\n emit renderManagerError(error);\n }\n}\n\n\/*\nunsigned long long StandaloneRenderManager::getIterationNumber() const\n{\n return m_nextIterationNumber-1;\n}*\/\n\nvoid StandaloneRenderManager::fillRenderStatistics()\n{\n m_application.getRenderStatisticsModel().setNumIterations(m_nextIterationNumber);\n m_application.getRenderStatisticsModel().setCurrentPPMRadius(m_PPMRadius);\n\n if(m_application.getRenderMethod() == RenderMethod::PROGRESSIVE_PHOTON_MAPPING)\n {\n m_application.getRenderStatisticsModel().setNumEmittedPhotonsPerIteration(PMOptixRenderer::EMITTED_PHOTONS_PER_ITERATION);\n m_application.getRenderStatisticsModel().setNumEmittedPhotons(PMOptixRenderer::EMITTED_PHOTONS_PER_ITERATION*m_nextIterationNumber);\n }\n else\n {\n m_application.getRenderStatisticsModel().setNumEmittedPhotonsPerIteration(0);\n m_application.getRenderStatisticsModel().setNumEmittedPhotons(0);\n\n }\n\n}\n\n\/\/ TODO this may be called very often for rapid camera changes.\nvoid StandaloneRenderManager::onSequenceNumberIncremented()\n{\n m_nextIterationNumber = 0;\n m_PPMRadius = m_application.getPPMSettingsModel().getPPMInitialRadius();\n m_camera = m_application.getCamera();\n continueRayTracingIfRunningAsync();\n}\n\nvoid StandaloneRenderManager::onSceneLoadingNew()\n{\n \/\/m_currentScene = NULL;\n}\n\nvoid StandaloneRenderManager::onSceneUpdated()\n{\n IScene* scene = m_application.getSceneManager().getScene();\n if(scene != m_currentScene)\n {\n m_compileScene = true;\n m_currentScene = scene;\n }\n}\n\nvoid StandaloneRenderManager::wait()\n{\n printf(\"StandaloneRenderManager::wait\\n\");\n \/*m_thread->exit();\n m_thread->wait();*\/\n}\n\nvoid StandaloneRenderManager::continueRayTracingIfRunningAsync()\n{\n if(m_application.getRunningStatus() == RunningStatus::RUNNING && m_noEmittedSignals)\n {\n m_noEmittedSignals = false;\n emit continueRayTracing();\n }\n}\n\nvoid StandaloneRenderManager::onRunningStatusChanged()\n{\n continueRayTracingIfRunningAsync();\n}<commit_msg>Simplify RenderManager due to unused variables (e.g iterationNumber, PPMradius)<commit_after>\/* \n * Copyright (c) 2013 Opposite Renderer\n * For the full copyright and license information, please view the LICENSE.txt\n * file that was distributed with this source code.\n*\/\n\n#include \"StandaloneRenderManager.hxx\"\n#include \"renderer\/PPMOptixRenderer.h\"\n#include \"renderer\/PMOptixRenderer.h\"\n#include <QThread>\n#include \"renderer\/Camera.h\"\n#include <QTime>\n#include \"scene\/Scene.h\"\n#include \"clientserver\/RenderServerRenderRequest.h\"\n#include <QCoreApplication>\n#include <QApplication>\n#include \"Application.hxx\"\n\nStandaloneRenderManager::StandaloneRenderManager(QApplication & qApplication, Application & application, const ComputeDevice& device) :\n m_device(device),\n m_renderer(new PMOptixRenderer()), \n m_nextIterationNumber(0),\n m_outputBuffer(NULL),\n m_currentScene(NULL),\n m_compileScene(false),\n m_application(application),\n m_noEmittedSignals(true),\n\tm_logger()\n{\n connect(&application, SIGNAL(sequenceNumberIncremented()), this, SLOT(onSequenceNumberIncremented()));\n connect(&application, SIGNAL(runningStatusChanged()), this, SLOT(onRunningStatusChanged()));\n connect(&application.getSceneManager(), SIGNAL(sceneLoadingNew()), this, SLOT(onSceneLoadingNew()));\n connect(&application.getSceneManager(), SIGNAL(sceneUpdated()), this, SLOT(onSceneUpdated()));\n\n onSceneUpdated();\n\n connect(this, SIGNAL(continueRayTracing()), \n this, SLOT(onContinueRayTracing()), \n Qt::QueuedConnection);\n}\n\nSignalLogger& StandaloneRenderManager::logger()\n{\n\treturn m_logger;\n}\n\nStandaloneRenderManager::~StandaloneRenderManager()\n{\n if(m_outputBuffer != NULL)\n {\n delete[] m_outputBuffer;\n m_outputBuffer = NULL;\n }\n}\n\nvoid StandaloneRenderManager::start()\n{\n m_application.setRendererStatus(RendererStatus::INITIALIZING_ENGINE);\n\tm_renderer->initialize(m_device, &m_logger);\n}\n\nvoid StandaloneRenderManager::onContinueRayTracing()\n{\n renderNextIteration();\n continueRayTracingIfRunningAsync();\n}\n\nvoid StandaloneRenderManager::renderNextIteration()\n{\n try\n {\n if(m_application.getRunningStatus() == RunningStatus::RUNNING && m_currentScene != NULL)\n {\n m_noEmittedSignals = true;\n\n if(m_compileScene)\n {\n m_application.setRendererStatus(RendererStatus::INITIALIZING_SCENE);\n m_renderer->initScene(*m_currentScene);\n m_compileScene = false;\n m_application.setRendererStatus(RendererStatus::RENDERING);\n }\n\n const double PPMAlpha = 2.0\/3.0;\n QVector<unsigned long long> iterationNumbers;\n QVector<double> ppmRadii;\n\n RenderServerRenderRequestDetails details (m_camera, QByteArray(m_currentScene->getSceneName()), \n m_application.getRenderMethod(), m_application.getWidth(), m_application.getHeight(), PPMAlpha);\n\n RenderServerRenderRequest renderRequest (m_application.getSequenceNumber(), iterationNumbers, ppmRadii, details);\n\n m_renderer->renderNextIteration(0, 0, m_PPMRadius, true, renderRequest.getDetails());\n\n \/\/ Transfer the output buffer to CPU and signal ready for display\n if(m_outputBuffer == NULL)\n {\n m_outputBuffer = new float[2000*2000*3];\n }\n m_renderer->getOutputBuffer(m_outputBuffer);\n emit newFrameReadyForDisplay(m_outputBuffer, m_nextIterationNumber);\n\n \/\/fillRenderStatistics();\n m_nextIterationNumber++;\n\t\t\t\/\/m_application.setRunningStatus(RunningStatus::PAUSE);\n }\n }\n catch(const std::exception & E)\n {\n m_application.setRunningStatus(RunningStatus::PAUSE);\n QString error = QString(\"%1\").arg(E.what());\n emit renderManagerError(error);\n }\n}\n\n\/*\nunsigned long long StandaloneRenderManager::getIterationNumber() const\n{\n return m_nextIterationNumber-1;\n}*\/\n\nvoid StandaloneRenderManager::fillRenderStatistics()\n{\n m_application.getRenderStatisticsModel().setNumIterations(m_nextIterationNumber);\n m_application.getRenderStatisticsModel().setCurrentPPMRadius(m_PPMRadius);\n\n if(m_application.getRenderMethod() == RenderMethod::PROGRESSIVE_PHOTON_MAPPING)\n {\n m_application.getRenderStatisticsModel().setNumEmittedPhotonsPerIteration(PMOptixRenderer::EMITTED_PHOTONS_PER_ITERATION);\n m_application.getRenderStatisticsModel().setNumEmittedPhotons(PMOptixRenderer::EMITTED_PHOTONS_PER_ITERATION*m_nextIterationNumber);\n }\n else\n {\n m_application.getRenderStatisticsModel().setNumEmittedPhotonsPerIteration(0);\n m_application.getRenderStatisticsModel().setNumEmittedPhotons(0);\n\n }\n\n}\n\n\/\/ TODO this may be called very often for rapid camera changes.\nvoid StandaloneRenderManager::onSequenceNumberIncremented()\n{\n m_nextIterationNumber = 0;\n m_PPMRadius = m_application.getPPMSettingsModel().getPPMInitialRadius();\n m_camera = m_application.getCamera();\n continueRayTracingIfRunningAsync();\n}\n\nvoid StandaloneRenderManager::onSceneLoadingNew()\n{\n \/\/m_currentScene = NULL;\n}\n\nvoid StandaloneRenderManager::onSceneUpdated()\n{\n IScene* scene = m_application.getSceneManager().getScene();\n if(scene != m_currentScene)\n {\n m_compileScene = true;\n m_currentScene = scene;\n }\n}\n\nvoid StandaloneRenderManager::wait()\n{\n printf(\"StandaloneRenderManager::wait\\n\");\n \/*m_thread->exit();\n m_thread->wait();*\/\n}\n\nvoid StandaloneRenderManager::continueRayTracingIfRunningAsync()\n{\n if(m_application.getRunningStatus() == RunningStatus::RUNNING && m_noEmittedSignals)\n {\n m_noEmittedSignals = false;\n emit continueRayTracing();\n }\n}\n\nvoid StandaloneRenderManager::onRunningStatusChanged()\n{\n continueRayTracingIfRunningAsync();\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 Yangqing Jia\n\/\/ This program converts a set of images to a leveldb by storing them as Datum\n\/\/ proto buffers.\n\/\/ Usage:\n\/\/ convert_dataset ROOTFOLDER LISTFILE DB_NAME\n\/\/ where ROOTFOLDER is the root folder that holds all the images, and LISTFILE\n\/\/ should be a list of files as well as their labels, in the format as\n\/\/ subfolder1\/file1.JPEG 0\n\/\/ ....\n\n#include <glog\/logging.h>\n#include <leveldb\/db.h>\n\n#include <string>\n#include <iostream>\n#include <fstream>\n\n#include \"caffe\/proto\/caffe.pb.h\"\n#include \"caffe\/util\/io.hpp\"\n\nusing namespace caffe;\nusing std::string;\n\n\/\/ A utility function to generate random strings\nvoid GenerateRandomPrefix(const int n, string* key) {\n const char* kCHARS = \"abcdefghijklmnopqrstuvwxyz\";\n key->clear();\n for (int i = 0; i < n; ++i) {\n key->push_back(kCHARS[rand() % 26]);\n }\n key->push_back('_');\n}\n\nint main(int argc, char** argv) {\n ::google::InitGoogleLogging(argv[0]);\n std::ifstream infile(argv[2]);\n leveldb::DB* db;\n leveldb::Options options;\n options.error_if_exists = true;\n options.create_if_missing = true;\n LOG(INFO) << \"Opening leveldb \" << argv[3];\n leveldb::Status status = leveldb::DB::Open(\n options, argv[3], &db);\n CHECK(status.ok()) << \"Failed to open leveldb \" << argv[3];\n\n string root_folder(argv[1]);\n string filename;\n int label;\n Datum datum;\n string key;\n string value;\n while (infile >> filename >> label) {\n ReadImageToDatum(root_folder + filename, label, &datum);\n \/\/ get the key, and add a random string so the leveldb will have permuted\n \/\/ data\n GenerateRandomPrefix(8, &key);\n key += filename;\n \/\/ get the value\n datum.SerializeToString(&value);\n db->Put(leveldb::WriteOptions(), key, value);\n LOG(ERROR) << \"Writing \" << key;\n }\n\n delete db;\n return 0;\n}\n<commit_msg>scripts to convert dataset<commit_after>\/\/ Copyright 2013 Yangqing Jia\n\/\/ This program converts a set of images to a leveldb by storing them as Datum\n\/\/ proto buffers.\n\/\/ Usage:\n\/\/ convert_dataset ROOTFOLDER LISTFILE DB_NAME\n\/\/ where ROOTFOLDER is the root folder that holds all the images, and LISTFILE\n\/\/ should be a list of files as well as their labels, in the format as\n\/\/ subfolder1\/file1.JPEG 0\n\/\/ ....\n\/\/ You are responsible for shuffling the files yourself.\n\n#include <glog\/logging.h>\n#include <leveldb\/db.h>\n\n#include <string>\n#include <iostream>\n#include <fstream>\n\n#include \"caffe\/proto\/caffe.pb.h\"\n#include \"caffe\/util\/io.hpp\"\n\nusing namespace caffe;\nusing std::string;\nusing std::stringstream;\n\n\/\/ A utility function to generate random strings\nvoid GenerateRandomPrefix(const int n, string* key) {\n const char* kCHARS = \"abcdefghijklmnopqrstuvwxyz\";\n key->clear();\n for (int i = 0; i < n; ++i) {\n key->push_back(kCHARS[rand() % 26]);\n }\n key->push_back('_');\n}\n\nint main(int argc, char** argv) {\n ::google::InitGoogleLogging(argv[0]);\n std::ifstream infile(argv[2]);\n leveldb::DB* db;\n leveldb::Options options;\n options.error_if_exists = true;\n options.create_if_missing = true;\n LOG(INFO) << \"Opening leveldb \" << argv[3];\n leveldb::Status status = leveldb::DB::Open(\n options, argv[3], &db);\n CHECK(status.ok()) << \"Failed to open leveldb \" << argv[3];\n\n string root_folder(argv[1]);\n string filename;\n int label;\n Datum datum;\n int count = 0;\n char key_cstr[100];\n while (infile >> filename >> label) {\n ReadImageToDatum(root_folder + filename, label, &datum);\n sprintf(key_cstr, \"%08d_%s\", count, filename.c_str());\n string key(key_cstr);\n string value;\n \/\/ get the value\n datum.SerializeToString(&value);\n db->Put(leveldb::WriteOptions(), key, value);\n if (++count % 1000 == 0) {\n LOG(ERROR) << \"Processed \" << count << \" files.\";\n }\n }\n\n delete db;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <iostream>\n#include <map>\n#include <vector>\n\n#include \"Helper.h\"\n#include \"Notation.h\"\n\n\/\/ The number of iterations to do the EM training.\n#define NUMBER_ITERATIONS 100\n\n\/\/ TODO: Reorganize and use Notation::GIVEN_DELIM. http:\/\/bit.ly\/15rbAom\n#define GIVEN_DELIM \"|\"\n#define AND_DELIM \",\"\n#define SEQ_DELIM \"\"\n\nusing namespace std;\n\nconst string X = \"X\";\nconst string Y = \"Y\";\nconst string A = \"A\";\nconst string B = \"B\";\nconst vector<string> TAG_LIST{X, Y};\nconst vector<string> OBSERVED_DATA{A, B, A};\n\/\/ Enumerate all possible tag sequences for the brute force method.\nconst vector<string> TAG_SEQUENCES{X+X+X, X+X+Y, X+Y+X, X+Y+Y,\n Y+X+X, Y+X+Y, Y+Y+X, Y+Y+Y};\n\n\/\/ For output.\nvector<double> saved_pABA_results;\n\n\/\/ Known probabilities:\nNotation pX(\"P\", {X}); \/\/ \"probability of x\"\nNotation pY(\"P\", {Y});\nNotation pXGivenX(\"P\", {X}, GIVEN_DELIM, {X});\nNotation pYGivenX(\"P\", {Y}, GIVEN_DELIM, {X});\nNotation pXGivenY(\"P\", {X}, GIVEN_DELIM, {Y});\nNotation pYGivenY(\"P\", {Y}, GIVEN_DELIM, {Y});\n\/\/ Objectives:\nNotation pABA(\"P\", {A,B,A}, SEQ_DELIM);\nNotation pAGivenX(\"P\", {A}, GIVEN_DELIM, {X});\nNotation pAGivenY(\"P\", {A}, GIVEN_DELIM, {Y});\nNotation pBGivenX(\"P\", {B}, GIVEN_DELIM, {X});\nNotation pBGivenY(\"P\", {B}, GIVEN_DELIM, {Y});\nNotation cXA(\"C\", {X, A}, AND_DELIM); \/\/ \"count of x and a\"\nNotation cXB(\"C\", {X, B}, AND_DELIM);\nNotation cYA(\"C\", {Y, A}, AND_DELIM);\nNotation cYB(\"C\", {Y, B}, AND_DELIM);\n\nvoid PrepareInitialData(map<string, double> *data) {\n \/\/ Given data.\n data->emplace(pX.repr(), .6);\n data->emplace(pY.repr(), .4);\n data->emplace(pXGivenX.repr(), .6);\n data->emplace(pYGivenX.repr(), .4);\n data->emplace(pXGivenY.repr(), .9);\n data->emplace(pYGivenY.repr(), .1);\n\n \/\/ Initial value for unknowns. We improve upon these.\n double initVal = .5;\n data->emplace(pAGivenX.repr(), initVal);\n data->emplace(pAGivenY.repr(), initVal);\n data->emplace(pBGivenX.repr(), initVal);\n data->emplace(pBGivenY.repr(), initVal);\n}\n\nvoid ComputeDataWithBruteForce(map<string, double> *data) {\n saved_pABA_results.push_back((*data)[pABA.repr()]);\n cout << \"Initially: \\n\";\n cout << cXA << \": \" << (*data)[cXA.repr()] << endl;\n cout << cXB << \": \" << (*data)[cXB.repr()] << endl;\n cout << cYA << \": \" << (*data)[cYA.repr()] << endl;\n cout << cYB << \": \" << (*data)[cYB.repr()] << endl;\n cout << pABA << \": \" << (*data)[pABA.repr()] << endl << endl;\n \n for (int i = 0; i < NUMBER_ITERATIONS; ++i) {\n cout << \"#\" << i+1 << \":\\n\";\n \/\/ Reset counts to zero.\n (*data)[cXA.repr()] = 0;\n (*data)[cXB.repr()] = 0;\n (*data)[cYA.repr()] = 0;\n (*data)[cYB.repr()] = 0;\n\n \/\/ Get norm P(t,w) and counts.\n for (string seq : TAG_SEQUENCES) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n double normalizedProb = Calculator::ComputeNormalizedProbability(pTW,\n *data, TAG_LIST.size(), OBSERVED_DATA.size());\n (*data)[pTW.repr()] = normalizedProb;\n\n \/\/ Get counts.\n (*data)[cXA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cXA);\n (*data)[cXB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cXB);\n (*data)[cYA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cYA);\n (*data)[cYB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cYB);\n }\n \/\/ Update the unknown probabilities that we want to find. Use them in the\n \/\/ next iteration.\n (*data)[pAGivenX.repr()] = (*data)[cXA.repr()]\/( (*data)[cXA.repr()] +\n (*data)[cXB.repr()] );\n (*data)[pBGivenX.repr()] = (*data)[cXB.repr()]\/( (*data)[cXB.repr()] +\n (*data)[cXA.repr()] );\n (*data)[pAGivenY.repr()] = (*data)[cYA.repr()]\/( (*data)[cYA.repr()] +\n (*data)[cYB.repr()] );\n (*data)[pBGivenY.repr()] = (*data)[cYB.repr()]\/( (*data)[cYB.repr()] +\n (*data)[cYA.repr()] );\n\n \/\/ The ultimate value we want to maximize. This should increase with each\n \/\/ iteration.\n Calculator::UpdateProbOfObsDataSeq(pABA, data, TAG_SEQUENCES);\n cout << \"--Summary of iteration \" << i+1 << \"--\\n\";\n cout << cXA << \": \" << (*data)[cXA.repr()] << endl;\n cout << cXB << \": \" << (*data)[cXB.repr()] << endl;\n cout << cYA << \": \" << (*data)[cYA.repr()] << endl;\n cout << cYB << \": \" << (*data)[cYB.repr()] << endl;\n cout << pAGivenX << \": \" << (*data)[pAGivenX.repr()] << endl;\n cout << pBGivenX << \": \" << (*data)[pBGivenX.repr()] << endl;\n cout << pAGivenY << \": \" << (*data)[pAGivenY.repr()] << endl;\n cout << pBGivenY << \": \" << (*data)[pBGivenY.repr()] << endl;\n cout << pABA << \": \" << (*data)[pABA.repr()] << endl;\n cout << endl;\n saved_pABA_results.push_back((*data)[pABA.repr()]);\n }\n}\n\nint main() {\n map<string, double> data;\n PrepareInitialData(&data);\n ComputeDataWithBruteForce(&data);\n \n \/\/ Goal:\n cout << \"--Results based on \" << NUMBER_ITERATIONS << \" iterations--\\n\";\n cout << pABA << \": \";\n for (int i = 0; i < saved_pABA_results.size(); ++i) {\n cout << saved_pABA_results[i] << \" \";\n }\n cout << endl;\n cout << \"Final \" << pABA << \": \" << data[pABA.repr()] << endl << endl;\n\n cout << \"Determining the best matching tag sequence:\\n\";\n vector<string> tags = NotationHelper::Individualize(TAG_SEQUENCES[0]);\n Notation pTW_first(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation *best_pTW = NULL;\n string best_match_string_repr = pTW_first.repr();\n for (string seq : TAG_SEQUENCES) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n cout << pTW << \": \" << data[pTW.repr()] << endl;\n if (data[pTW.repr()] > data[best_match_string_repr]) {\n best_match_string_repr = pTW.repr();\n delete best_pTW;\n best_pTW = new Notation(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n }\n }\n cout << \"The highest probability found belongs to \" << best_match_string_repr\n << \": \" << data[best_match_string_repr] << endl;\n cout << \"The best matching tag sequence is \" <<\n NotationHelper::Combine(best_pTW->second) << endl;\n delete best_pTW;\n\n return 0;\n}\n<commit_msg>small cleanup of output<commit_after>#include <cassert>\n#include <iostream>\n#include <map>\n#include <vector>\n\n#include \"Helper.h\"\n#include \"Notation.h\"\n\n\/\/ The number of iterations to do the EM training.\n#define NUMBER_ITERATIONS 100\n\n\/\/ TODO: Reorganize and use Notation::GIVEN_DELIM. http:\/\/bit.ly\/15rbAom\n#define GIVEN_DELIM \"|\"\n#define AND_DELIM \",\"\n#define SEQ_DELIM \"\"\n\nusing namespace std;\n\nconst string X = \"X\";\nconst string Y = \"Y\";\nconst string A = \"A\";\nconst string B = \"B\";\nconst vector<string> TAG_LIST{X, Y};\nconst vector<string> OBSERVED_DATA{A, B, A};\n\/\/ Enumerate all possible tag sequences for the brute force method.\nconst vector<string> TAG_SEQUENCES{X+X+X, X+X+Y, X+Y+X, X+Y+Y,\n Y+X+X, Y+X+Y, Y+Y+X, Y+Y+Y};\n\n\/\/ For output.\nvector<double> saved_pABA_results;\n\n\/\/ Known probabilities:\nNotation pX(\"P\", {X}); \/\/ \"probability of x\"\nNotation pY(\"P\", {Y});\nNotation pXGivenX(\"P\", {X}, GIVEN_DELIM, {X});\nNotation pYGivenX(\"P\", {Y}, GIVEN_DELIM, {X});\nNotation pXGivenY(\"P\", {X}, GIVEN_DELIM, {Y});\nNotation pYGivenY(\"P\", {Y}, GIVEN_DELIM, {Y});\n\/\/ Objectives:\nNotation pABA(\"P\", {A,B,A}, SEQ_DELIM);\nNotation pAGivenX(\"P\", {A}, GIVEN_DELIM, {X});\nNotation pAGivenY(\"P\", {A}, GIVEN_DELIM, {Y});\nNotation pBGivenX(\"P\", {B}, GIVEN_DELIM, {X});\nNotation pBGivenY(\"P\", {B}, GIVEN_DELIM, {Y});\nNotation cXA(\"C\", {X, A}, AND_DELIM); \/\/ \"count of x and a\"\nNotation cXB(\"C\", {X, B}, AND_DELIM);\nNotation cYA(\"C\", {Y, A}, AND_DELIM);\nNotation cYB(\"C\", {Y, B}, AND_DELIM);\n\nvoid PrepareInitialData(map<string, double> *data) {\n \/\/ Given data.\n data->emplace(pX.repr(), .6);\n data->emplace(pY.repr(), .4);\n data->emplace(pXGivenX.repr(), .6);\n data->emplace(pYGivenX.repr(), .4);\n data->emplace(pXGivenY.repr(), .9);\n data->emplace(pYGivenY.repr(), .1);\n\n \/\/ Initial value for unknowns. We improve upon these.\n \/\/ TODO\n double initVal = .5;\n data->emplace(pAGivenX.repr(), initVal);\n data->emplace(pAGivenY.repr(), initVal);\n data->emplace(pBGivenX.repr(), initVal);\n data->emplace(pBGivenY.repr(), initVal);\n}\n\nvoid ComputeDataWithBruteForce(map<string, double> *data) {\n saved_pABA_results.push_back((*data)[pABA.repr()]); \/\/ push back initial 0\n cout << \"Initially: \\n\";\n cout << cXA << \": \" << (*data)[cXA.repr()] << endl;\n cout << cXB << \": \" << (*data)[cXB.repr()] << endl;\n cout << cYA << \": \" << (*data)[cYA.repr()] << endl;\n cout << cYB << \": \" << (*data)[cYB.repr()] << endl;\n cout << pABA << \": \" << (*data)[pABA.repr()] << endl << endl;\n \n for (int i = 0; i < NUMBER_ITERATIONS; ++i) {\n cout << \"#\" << i+1 << \":\\n\";\n \/\/ Reset counts to zero.\n (*data)[cXA.repr()] = 0;\n (*data)[cXB.repr()] = 0;\n (*data)[cYA.repr()] = 0;\n (*data)[cYB.repr()] = 0;\n\n \/\/ Get norm P(t,w) and counts.\n for (string seq : TAG_SEQUENCES) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n double normalizedProb = Calculator::ComputeNormalizedProbability(pTW,\n *data, TAG_LIST.size(), OBSERVED_DATA.size());\n (*data)[pTW.repr()] = normalizedProb;\n\n \/\/ Get counts.\n (*data)[cXA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cXA);\n (*data)[cXB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cXB);\n (*data)[cYA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cYA);\n (*data)[cYB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cYB);\n }\n \/\/ Update the unknown probabilities that we want to find. Use them in the\n \/\/ next iteration.\n (*data)[pAGivenX.repr()] = (*data)[cXA.repr()]\/( (*data)[cXA.repr()] +\n (*data)[cXB.repr()] );\n (*data)[pBGivenX.repr()] = (*data)[cXB.repr()]\/( (*data)[cXB.repr()] +\n (*data)[cXA.repr()] );\n (*data)[pAGivenY.repr()] = (*data)[cYA.repr()]\/( (*data)[cYA.repr()] +\n (*data)[cYB.repr()] );\n (*data)[pBGivenY.repr()] = (*data)[cYB.repr()]\/( (*data)[cYB.repr()] +\n (*data)[cYA.repr()] );\n\n \/\/ The ultimate value we want to maximize. This should increase with each\n \/\/ iteration.\n Calculator::UpdateProbOfObsDataSeq(pABA, data, TAG_SEQUENCES);\n cout << \"--Summary of iteration \" << i+1 << \"--\\n\";\n cout << cXA << \": \" << (*data)[cXA.repr()] << endl;\n cout << cXB << \": \" << (*data)[cXB.repr()] << endl;\n cout << cYA << \": \" << (*data)[cYA.repr()] << endl;\n cout << cYB << \": \" << (*data)[cYB.repr()] << endl;\n cout << pAGivenX << \": \" << (*data)[pAGivenX.repr()] << endl;\n cout << pBGivenX << \": \" << (*data)[pBGivenX.repr()] << endl;\n cout << pAGivenY << \": \" << (*data)[pAGivenY.repr()] << endl;\n cout << pBGivenY << \": \" << (*data)[pBGivenY.repr()] << endl;\n cout << pABA << \": \" << (*data)[pABA.repr()] << endl;\n cout << endl;\n saved_pABA_results.push_back((*data)[pABA.repr()]);\n }\n}\n\nint main() {\n map<string, double> data;\n PrepareInitialData(&data);\n ComputeDataWithBruteForce(&data);\n \n \/\/ Goal:\n cout << \"--Results based on \" << NUMBER_ITERATIONS << \" iterations--\\n\";\n cout << pABA << \": \";\n for (int i = 0; i < saved_pABA_results.size(); ++i) {\n cout << saved_pABA_results[i] << \" \";\n }\n cout << endl;\n cout << \"Final \" << pABA << \": \" << data[pABA.repr()] << endl << endl;\n\n cout << \"Determining the best matching tag sequence:\\n\";\n vector<string> tags = NotationHelper::Individualize(TAG_SEQUENCES[0]);\n Notation pTW_first(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation *best_pTGivenW = NULL;\n string best_match_string_repr = pTW_first.repr();\n for (string seq : TAG_SEQUENCES) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n\n \/\/ Compute P(t|w). Technically not used because divided values seem to\n \/\/ incorrectly yield >1 (decimals too small, possibly).\n Notation pTGivenW(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n data[pTGivenW.repr()] = data[pTW.repr()] \/ data[pABA.repr()];\n cout << pTW << \": \" << data[pTW.repr()] << endl; \/\/ \", \" << pTGivenW << \": \" <<\n \/\/ data[pTGivenW.repr()] << endl;\n if (data[pTW.repr()] > data[best_match_string_repr]) {\n best_match_string_repr = pTW.repr();\n delete best_pTGivenW;\n \/\/ Same as pTGivenW.\n best_pTGivenW = new Notation(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n }\n }\n string pTAndWRepr = best_match_string_repr;\n cout << \"The highest probability found belongs to \" << pTAndWRepr << \": \" <<\n data[pTAndWRepr] << endl;\n cout << \"The best matching tag sequence is \" <<\n NotationHelper::Combine(best_pTGivenW->first) << endl;\n delete best_pTGivenW;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"musicsongtag.h\"\n#include \"musictime.h\"\n#include \"musicformats.h\"\n#include \"musicversion.h\"\n#include \"musiccoreutils.h\"\n#include \"musicwidgetutils.h\"\n\n#include <QStringList>\n#include <QPluginLoader>\n#include <QFileInfo>\n\/\/\/qmmp incldue\n#include \"tagreadandwrite.h\"\n#include \"decoderfactory.h\"\n#include \"metadatamodel.h\"\n#include \"decoder.h\"\n\nMusicSongTag::MusicSongTag()\n{\n\n}\n\nMusicSongTag::MusicSongTag(const QString &file)\n : MusicSongTag()\n{\n read(file);\n}\n\nQString MusicSongTag::getClassName()\n{\n return \"MusicSongTag\";\n}\n\nbool MusicSongTag::read(const QString &file)\n{\n QFile f(file);\n if(!f.exists() || f.size() <= 0)\n {\n return false;\n }\n\n m_filePath = file;\n return readOtherTaglib();\n}\n\nbool MusicSongTag::save()\n{\n return saveOtherTaglib();\n}\n\nQString MusicSongTag::getDecoder() const\n{\n QString v = findPluginPath();\n return QFileInfo(v).baseName();\n}\n\nQString MusicSongTag::getFilePath() const\n{\n return m_filePath;\n}\n\nQString MusicSongTag::getArtist() const\n{\n return m_parameters[TagReadAndWrite::TAG_ARTIST].toString();\n}\n\nQString MusicSongTag::getTitle() const\n{\n return m_parameters[TagReadAndWrite::TAG_TITLE].toString();\n}\n\nQString MusicSongTag::getAlbum() const\n{\n return m_parameters[TagReadAndWrite::TAG_ALBUM].toString();\n}\n\nQString MusicSongTag::getComment() const\n{\n return m_parameters[TagReadAndWrite::TAG_COMMENT].toString();\n}\n\nQString MusicSongTag::getYear() const\n{\n return m_parameters[TagReadAndWrite::TAG_YEAR].toString();\n}\n\nQString MusicSongTag::getTrackNum() const\n{\n QString v = m_parameters[TagReadAndWrite::TAG_TRACK].toString();\n bool ok = true;\n if(v.toInt(&ok) > 0)\n {\n return !ok ? \"-\" : v;\n }\n return \"-\";\n}\n\nQString MusicSongTag::getGenre() const\n{\n return m_parameters[TagReadAndWrite::TAG_GENRE].toString();\n}\n\nQString MusicSongTag::getAlbumArtist() const\n{\n return m_parameters[TagReadAndWrite::TAG_ALBUMARTIST].toString();\n}\n\nQString MusicSongTag::getComposer() const\n{\n return m_parameters[TagReadAndWrite::TAG_COMPOSER].toString();\n}\n\nQString MusicSongTag::getChannel() const\n{\n return m_parameters[TagReadAndWrite::TAG_CHANNEL].toString();\n}\n\nQString MusicSongTag::getURL() const\n{\n return m_parameters[TagReadAndWrite::TAG_URL].toString();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MusicSongTag::setArtist(const QString &artist)\n{\n m_parameters[TagReadAndWrite::TAG_ARTIST] = artist;\n}\n\nvoid MusicSongTag::setTitle(const QString &title)\n{\n m_parameters[TagReadAndWrite::TAG_TITLE] = title;\n}\n\nvoid MusicSongTag::setAlbum(const QString &album)\n{\n m_parameters[TagReadAndWrite::TAG_ALBUM] = album;\n}\n\nvoid MusicSongTag::setComment(const QString &comment)\n{\n m_parameters[TagReadAndWrite::TAG_COMMENT] = comment;\n}\n\nvoid MusicSongTag::setYear(const QString &year)\n{\n m_parameters[TagReadAndWrite::TAG_YEAR] = year;\n}\n\nvoid MusicSongTag::setTrackNum(const QString &track)\n{\n m_parameters[TagReadAndWrite::TAG_TRACK] = track;\n}\n\nvoid MusicSongTag::setGenre(const QString &genre)\n{\n m_parameters[TagReadAndWrite::TAG_GENRE] = genre;\n}\n\nvoid MusicSongTag::setCover(const QPixmap &pix)\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n m_parameters[TagReadAndWrite::TAG_COVER] = pix;\n#else\n Q_UNUSED(data);\n#endif\n}\n\nvoid MusicSongTag::setCover(const QByteArray &data)\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n QPixmap pix;\n pix.loadFromData(data);\n m_parameters[TagReadAndWrite::TAG_COVER] = pix;\n#else\n Q_UNUSED(data);\n#endif\n}\n\nQPixmap MusicSongTag::getCover() const\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n return m_parameters[TagReadAndWrite::TAG_COVER].value<QPixmap>();\n#else\n return QPixmap();\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString MusicSongTag::getSamplingRate() const\n{\n return m_parameters[TagReadAndWrite::TAG_SAMPLERATE].toString();\n}\n\nQString MusicSongTag::getFormat() const\n{\n return m_parameters[TagReadAndWrite::TAG_FORMAT].toString();\n}\n\nQString MusicSongTag::getMode() const\n{\n return m_parameters[TagReadAndWrite::TAG_MODE].toString();\n}\n\nQString MusicSongTag::getBitrate() const\n{\n return m_parameters[TagReadAndWrite::TAG_BITRATE].toString();\n}\n\nQString MusicSongTag::getLengthString() const\n{\n return MusicTime::msecTime2LabelJustified(\n m_parameters[TagReadAndWrite::TAG_LENGTH].toULongLong());\n}\n\nQString MusicSongTag::findPluginPath() const\n{\n QString suffix = QFileInfo(m_filePath).suffix().toLower();\n\n MusicObject::MStringsListMap formats(MusicFormats::supportFormatsStringMap());\n foreach(const QString &key, formats.keys())\n {\n if(formats.value(key).contains(suffix))\n {\n return MusicUtils::Core::pluginPath(\"Input\", key);\n }\n }\n\n return QString();\n}\n\nbool MusicSongTag::readOtherTaglib()\n{\n QPluginLoader loader;\n loader.setFileName(findPluginPath());\n\n QObject *obj = loader.instance();\n DecoderFactory *decoderfac = nullptr;\n if(obj && (decoderfac = MObject_cast(DecoderFactory*, obj)) )\n {\n int length = 0;\n MetaDataModel *model = decoderfac->createMetaDataModel(m_filePath);\n if(model != nullptr)\n {\n QHash<QString, QString> datas = model->audioProperties();\n MusicTime t = MusicTime::fromString(datas.value(\"Length\"), QString(\"m:ss\"));\n length = t.getTimeStamp(MusicTime::All_Msec);\n if(length != 0)\n {\n m_parameters.insert(TagReadAndWrite::TAG_LENGTH, QString::number(length));\n }\n m_parameters.insert(TagReadAndWrite::TAG_SAMPLERATE, datas.value(\"Sample rate\"));\n m_parameters.insert(TagReadAndWrite::TAG_BITRATE, datas.value(\"Bitrate\"));\n m_parameters.insert(TagReadAndWrite::TAG_CHANNEL, datas.value(\"Channels\"));\n\n m_parameters.insert(TagReadAndWrite::TAG_COVER, model->cover());\n\n QList<TagModel* > tags = model->tags();\n if(!tags.isEmpty())\n {\n TagModel *tagModel = tags.first();\n if(tags.count() == 3)\n {\n tagModel = tags[1]; \/\/id3v2 mode tag\n }\n\n m_parameters[TagReadAndWrite::TAG_TITLE] = tagModel->value(Qmmp::TITLE);\n m_parameters[TagReadAndWrite::TAG_ARTIST] = tagModel->value(Qmmp::ARTIST);\n m_parameters[TagReadAndWrite::TAG_ALBUM] = tagModel->value(Qmmp::ALBUM);\n m_parameters[TagReadAndWrite::TAG_YEAR] = tagModel->value(Qmmp::YEAR);\n m_parameters[TagReadAndWrite::TAG_COMMENT] = tagModel->value(Qmmp::COMMENT);\n m_parameters[TagReadAndWrite::TAG_TRACK] = tagModel->value(Qmmp::TRACK);\n m_parameters[TagReadAndWrite::TAG_GENRE] = tagModel->value(Qmmp::GENRE);\n }\n }\n\n if(length == 0)\n {\n QList<FileInfo*> infos(decoderfac->createPlayList(m_filePath, true, 0));\n if(!infos.isEmpty())\n {\n length = infos.first()->length()*MT_S2MS;\n }\n qDeleteAll(infos);\n\n if(length == 0)\n {\n TagReadAndWrite tag;\n if(tag.readFile(m_filePath))\n {\n QMap<TagReadAndWrite::MusicTag, QString> data = tag.getMusicTags();\n length = data[TagReadAndWrite::TAG_LENGTH].toInt();\n }\n }\n\n m_parameters[TagReadAndWrite::TAG_LENGTH] = QString::number(length);\n }\n\n delete model;\n loader.unload();\n }\n\n return !m_parameters.isEmpty();\n}\n\nbool MusicSongTag::saveOtherTaglib()\n{\n QPluginLoader loader;\n loader.setFileName(findPluginPath());\n\n bool status = false;\n QObject *obj = loader.instance();\n DecoderFactory *decoderfac = nullptr;\n if(obj && (decoderfac = MObject_cast(DecoderFactory*, obj)) )\n {\n status = true;\n MetaDataModel *model = decoderfac->createMetaDataModel(m_filePath);\n if(model)\n {\n QList<TagModel* > tags = model->tags();\n if(!tags.isEmpty())\n {\n TagModel *tagModel = tags.first();\n if(tags.count() == 3)\n {\n tagModel = tags[1]; \/\/id3v2 mode tag\n }\n\n tagModel->setValue(Qmmp::ALBUM, getAlbum());\n tagModel->setValue(Qmmp::ARTIST, getArtist());\n tagModel->setValue(Qmmp::TITLE, getTitle());\n tagModel->setValue(Qmmp::YEAR, getYear());\n tagModel->setValue(Qmmp::GENRE, getGenre());\n tagModel->save();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n model->setCover(MusicUtils::Widget::getPixmapData(getCover()));\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n }\n delete model;\n loader.unload();\n }\n\n return status;\n}\n<commit_msg>Skip the empty pixmap[016223]<commit_after>#include \"musicsongtag.h\"\n#include \"musictime.h\"\n#include \"musicformats.h\"\n#include \"musicversion.h\"\n#include \"musiccoreutils.h\"\n#include \"musicwidgetutils.h\"\n\n#include <QStringList>\n#include <QPluginLoader>\n#include <QFileInfo>\n\/\/\/qmmp incldue\n#include \"tagreadandwrite.h\"\n#include \"decoderfactory.h\"\n#include \"metadatamodel.h\"\n#include \"decoder.h\"\n\nMusicSongTag::MusicSongTag()\n{\n\n}\n\nMusicSongTag::MusicSongTag(const QString &file)\n : MusicSongTag()\n{\n read(file);\n}\n\nQString MusicSongTag::getClassName()\n{\n return \"MusicSongTag\";\n}\n\nbool MusicSongTag::read(const QString &file)\n{\n QFile f(file);\n if(!f.exists() || f.size() <= 0)\n {\n return false;\n }\n\n m_filePath = file;\n return readOtherTaglib();\n}\n\nbool MusicSongTag::save()\n{\n return saveOtherTaglib();\n}\n\nQString MusicSongTag::getDecoder() const\n{\n QString v = findPluginPath();\n return QFileInfo(v).baseName();\n}\n\nQString MusicSongTag::getFilePath() const\n{\n return m_filePath;\n}\n\nQString MusicSongTag::getArtist() const\n{\n return m_parameters[TagReadAndWrite::TAG_ARTIST].toString();\n}\n\nQString MusicSongTag::getTitle() const\n{\n return m_parameters[TagReadAndWrite::TAG_TITLE].toString();\n}\n\nQString MusicSongTag::getAlbum() const\n{\n return m_parameters[TagReadAndWrite::TAG_ALBUM].toString();\n}\n\nQString MusicSongTag::getComment() const\n{\n return m_parameters[TagReadAndWrite::TAG_COMMENT].toString();\n}\n\nQString MusicSongTag::getYear() const\n{\n return m_parameters[TagReadAndWrite::TAG_YEAR].toString();\n}\n\nQString MusicSongTag::getTrackNum() const\n{\n QString v = m_parameters[TagReadAndWrite::TAG_TRACK].toString();\n bool ok = true;\n if(v.toInt(&ok) > 0)\n {\n return !ok ? \"-\" : v;\n }\n return \"-\";\n}\n\nQString MusicSongTag::getGenre() const\n{\n return m_parameters[TagReadAndWrite::TAG_GENRE].toString();\n}\n\nQString MusicSongTag::getAlbumArtist() const\n{\n return m_parameters[TagReadAndWrite::TAG_ALBUMARTIST].toString();\n}\n\nQString MusicSongTag::getComposer() const\n{\n return m_parameters[TagReadAndWrite::TAG_COMPOSER].toString();\n}\n\nQString MusicSongTag::getChannel() const\n{\n return m_parameters[TagReadAndWrite::TAG_CHANNEL].toString();\n}\n\nQString MusicSongTag::getURL() const\n{\n return m_parameters[TagReadAndWrite::TAG_URL].toString();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid MusicSongTag::setArtist(const QString &artist)\n{\n m_parameters[TagReadAndWrite::TAG_ARTIST] = artist;\n}\n\nvoid MusicSongTag::setTitle(const QString &title)\n{\n m_parameters[TagReadAndWrite::TAG_TITLE] = title;\n}\n\nvoid MusicSongTag::setAlbum(const QString &album)\n{\n m_parameters[TagReadAndWrite::TAG_ALBUM] = album;\n}\n\nvoid MusicSongTag::setComment(const QString &comment)\n{\n m_parameters[TagReadAndWrite::TAG_COMMENT] = comment;\n}\n\nvoid MusicSongTag::setYear(const QString &year)\n{\n m_parameters[TagReadAndWrite::TAG_YEAR] = year;\n}\n\nvoid MusicSongTag::setTrackNum(const QString &track)\n{\n m_parameters[TagReadAndWrite::TAG_TRACK] = track;\n}\n\nvoid MusicSongTag::setGenre(const QString &genre)\n{\n m_parameters[TagReadAndWrite::TAG_GENRE] = genre;\n}\n\nvoid MusicSongTag::setCover(const QPixmap &pix)\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n m_parameters[TagReadAndWrite::TAG_COVER] = pix;\n#else\n Q_UNUSED(data);\n#endif\n}\n\nvoid MusicSongTag::setCover(const QByteArray &data)\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n QPixmap pix;\n pix.loadFromData(data);\n m_parameters[TagReadAndWrite::TAG_COVER] = pix;\n#else\n Q_UNUSED(data);\n#endif\n}\n\nQPixmap MusicSongTag::getCover() const\n{\n#if TTKMUSIC_VERSION >= TTKMUSIC_VERSION_CHECK(2,5,3,0)\n return m_parameters[TagReadAndWrite::TAG_COVER].value<QPixmap>();\n#else\n return QPixmap();\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nQString MusicSongTag::getSamplingRate() const\n{\n return m_parameters[TagReadAndWrite::TAG_SAMPLERATE].toString();\n}\n\nQString MusicSongTag::getFormat() const\n{\n return m_parameters[TagReadAndWrite::TAG_FORMAT].toString();\n}\n\nQString MusicSongTag::getMode() const\n{\n return m_parameters[TagReadAndWrite::TAG_MODE].toString();\n}\n\nQString MusicSongTag::getBitrate() const\n{\n return m_parameters[TagReadAndWrite::TAG_BITRATE].toString();\n}\n\nQString MusicSongTag::getLengthString() const\n{\n return MusicTime::msecTime2LabelJustified(\n m_parameters[TagReadAndWrite::TAG_LENGTH].toULongLong());\n}\n\nQString MusicSongTag::findPluginPath() const\n{\n QString suffix = QFileInfo(m_filePath).suffix().toLower();\n\n MusicObject::MStringsListMap formats(MusicFormats::supportFormatsStringMap());\n foreach(const QString &key, formats.keys())\n {\n if(formats.value(key).contains(suffix))\n {\n return MusicUtils::Core::pluginPath(\"Input\", key);\n }\n }\n\n return QString();\n}\n\nbool MusicSongTag::readOtherTaglib()\n{\n QPluginLoader loader;\n loader.setFileName(findPluginPath());\n\n QObject *obj = loader.instance();\n DecoderFactory *decoderfac = nullptr;\n if(obj && (decoderfac = MObject_cast(DecoderFactory*, obj)) )\n {\n int length = 0;\n MetaDataModel *model = decoderfac->createMetaDataModel(m_filePath);\n if(model != nullptr)\n {\n QHash<QString, QString> datas = model->audioProperties();\n MusicTime t = MusicTime::fromString(datas.value(\"Length\"), QString(\"m:ss\"));\n length = t.getTimeStamp(MusicTime::All_Msec);\n if(length != 0)\n {\n m_parameters.insert(TagReadAndWrite::TAG_LENGTH, QString::number(length));\n }\n m_parameters.insert(TagReadAndWrite::TAG_SAMPLERATE, datas.value(\"Sample rate\"));\n m_parameters.insert(TagReadAndWrite::TAG_BITRATE, datas.value(\"Bitrate\"));\n m_parameters.insert(TagReadAndWrite::TAG_CHANNEL, datas.value(\"Channels\"));\n\n m_parameters.insert(TagReadAndWrite::TAG_COVER, model->cover());\n\n QList<TagModel* > tags = model->tags();\n if(!tags.isEmpty())\n {\n TagModel *tagModel = tags.first();\n if(tags.count() == 3)\n {\n tagModel = tags[1]; \/\/id3v2 mode tag\n }\n\n m_parameters[TagReadAndWrite::TAG_TITLE] = tagModel->value(Qmmp::TITLE);\n m_parameters[TagReadAndWrite::TAG_ARTIST] = tagModel->value(Qmmp::ARTIST);\n m_parameters[TagReadAndWrite::TAG_ALBUM] = tagModel->value(Qmmp::ALBUM);\n m_parameters[TagReadAndWrite::TAG_YEAR] = tagModel->value(Qmmp::YEAR);\n m_parameters[TagReadAndWrite::TAG_COMMENT] = tagModel->value(Qmmp::COMMENT);\n m_parameters[TagReadAndWrite::TAG_TRACK] = tagModel->value(Qmmp::TRACK);\n m_parameters[TagReadAndWrite::TAG_GENRE] = tagModel->value(Qmmp::GENRE);\n }\n }\n\n if(length == 0)\n {\n QList<FileInfo*> infos(decoderfac->createPlayList(m_filePath, true, 0));\n if(!infos.isEmpty())\n {\n length = infos.first()->length()*MT_S2MS;\n }\n qDeleteAll(infos);\n\n if(length == 0)\n {\n TagReadAndWrite tag;\n if(tag.readFile(m_filePath))\n {\n QMap<TagReadAndWrite::MusicTag, QString> data = tag.getMusicTags();\n length = data[TagReadAndWrite::TAG_LENGTH].toInt();\n }\n }\n\n m_parameters[TagReadAndWrite::TAG_LENGTH] = QString::number(length);\n }\n\n delete model;\n loader.unload();\n }\n\n return !m_parameters.isEmpty();\n}\n\nbool MusicSongTag::saveOtherTaglib()\n{\n QPluginLoader loader;\n loader.setFileName(findPluginPath());\n\n bool status = false;\n QObject *obj = loader.instance();\n DecoderFactory *decoderfac = nullptr;\n if(obj && (decoderfac = MObject_cast(DecoderFactory*, obj)) )\n {\n status = true;\n MetaDataModel *model = decoderfac->createMetaDataModel(m_filePath);\n if(model)\n {\n QList<TagModel* > tags = model->tags();\n if(!tags.isEmpty())\n {\n TagModel *tagModel = tags.first();\n if(tags.count() == 3)\n {\n tagModel = tags[1]; \/\/id3v2 mode tag\n }\n\n tagModel->setValue(Qmmp::ALBUM, getAlbum());\n tagModel->setValue(Qmmp::ARTIST, getArtist());\n tagModel->setValue(Qmmp::TITLE, getTitle());\n tagModel->setValue(Qmmp::YEAR, getYear());\n tagModel->setValue(Qmmp::GENRE, getGenre());\n tagModel->save();\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n QPixmap pix = getCover();\n if(!pix.isNull())\n {\n model->setCover(MusicUtils::Widget::getPixmapData(pix));\n }\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n }\n delete model;\n loader.unload();\n }\n\n return status;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <vector>\n\n#include \"NLPHelper.h\"\n#include \"Notation.h\"\n\n\/* SETTINGS *\/\n\/\/ The number of iterations to do the EM training.\n#define NUMBER_ITERATIONS 100\n\n\/\/ Two ways to run this program: with a short or a long observed sequence.\n#define DO_SHORT_SEQ true\n\/* END SETTINGS *\/\n\n\/\/ TODO: Reorganize and use Notation::GIVEN_DELIM. http:\/\/bit.ly\/15rbAom\n#define GIVEN_DELIM \"|\"\n#define AND_DELIM \",\"\n#define SEQ_DELIM \"\"\n\nusing namespace std;\n\nconst string X = \"X\";\nconst string Y = \"Y\";\nconst string A = \"A\";\nconst string B = \"B\";\nconst vector<string> TAG_LIST{X, Y};\n#if DO_SHORT_SEQ\nconst vector<string> OBSERVED_DATA{A, B, A};\n#else\nconst vector<string> OBSERVED_DATA{A,A,A,B,A,A,B,A,A};\n#endif\n\n\/\/ For output. Saves the changing values of pABA (or the longer seq).\nvector<double> saved_obs_seq_probs;\n\n\/\/ Known probabilities:\nNotation pX(\"P\", {X}); \/\/ \"probability of x\"\nNotation pY(\"P\", {Y});\nNotation pXGivenX(\"P\", {X}, GIVEN_DELIM, {X});\nNotation pYGivenX(\"P\", {Y}, GIVEN_DELIM, {X});\nNotation pXGivenY(\"P\", {X}, GIVEN_DELIM, {Y});\nNotation pYGivenY(\"P\", {Y}, GIVEN_DELIM, {Y});\n\/\/ Objectives:\n\/\/ Short seq type.\nNotation pABA(\"P\", {A,B,A}, SEQ_DELIM);\nNotation pAGivenX(\"P\", {A}, GIVEN_DELIM, {X});\nNotation pAGivenY(\"P\", {A}, GIVEN_DELIM, {Y});\nNotation pBGivenX(\"P\", {B}, GIVEN_DELIM, {X});\nNotation pBGivenY(\"P\", {B}, GIVEN_DELIM, {Y});\nNotation cXA(\"C\", {X, A}, AND_DELIM); \/\/ \"count of x and a\"\nNotation cXB(\"C\", {X, B}, AND_DELIM);\nNotation cYA(\"C\", {Y, A}, AND_DELIM);\nNotation cYB(\"C\", {Y, B}, AND_DELIM);\n\/\/ Long seq type.\nNotation pLong(\"P\", {A,A,A,B,A,A,B,A,A}, SEQ_DELIM);\n\nvoid PrepareInitialData(map<string, double> *data) {\n \/\/ Given data.\n data->emplace(pX.repr(), .6);\n data->emplace(pY.repr(), .4);\n data->emplace(pXGivenX.repr(), .6);\n data->emplace(pYGivenX.repr(), .4);\n data->emplace(pXGivenY.repr(), .9);\n data->emplace(pYGivenY.repr(), .1);\n\n \/\/ Initial value for unknowns. We improve upon these.\n double initVal = .5;\n data->emplace(pAGivenX.repr(), initVal);\n data->emplace(pAGivenY.repr(), initVal);\n data->emplace(pBGivenX.repr(), initVal);\n data->emplace(pBGivenY.repr(), initVal);\n\n \/\/ Initial counts can be set to 0.\n data->emplace(cXA.repr(), 0);\n data->emplace(cYA.repr(), 0);\n data->emplace(cXB.repr(), 0);\n data->emplace(cYB.repr(), 0);\n}\n\nvoid ComputeDataWithBruteForce(map<string, double> *data, const Notation &n,\n const vector<string> &tag_sequences) {\n saved_obs_seq_probs.push_back((*data)[n.repr()]); \/\/ push back initial 0\n\n vector<Notation> rowOfNots{cXA, cXB, pAGivenX, pBGivenX, cYA, cYB, pAGivenY,\n pBGivenY, n};\n OutputHelper::PrintHeader(rowOfNots);\n OutputHelper::PrintDataRow(0, rowOfNots, *data);\n\n for (int i = 0; i < NUMBER_ITERATIONS; ++i) {\n \/\/ Reset counts to zero.\n (*data)[cXA.repr()] = 0;\n (*data)[cXB.repr()] = 0;\n (*data)[cYA.repr()] = 0;\n (*data)[cYB.repr()] = 0;\n\n \/\/ Get norm P(t,w) and counts.\n for (string seq : tag_sequences) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n double normalizedProb = Calculator::ComputeNormalizedProbability(pTW,\n *data, TAG_LIST.size(), OBSERVED_DATA.size());\n (*data)[pTW.repr()] = normalizedProb;\n\n \/\/ Get counts.\n (*data)[cXA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cXA);\n (*data)[cXB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cXB);\n (*data)[cYA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cYA);\n (*data)[cYB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cYB);\n }\n \/\/ Update the unknown probabilities that we want to find. Use them in the\n \/\/ next iteration.\n (*data)[pAGivenX.repr()] = (*data)[cXA.repr()]\/( (*data)[cXA.repr()] +\n (*data)[cXB.repr()] );\n (*data)[pBGivenX.repr()] = (*data)[cXB.repr()]\/( (*data)[cXB.repr()] +\n (*data)[cXA.repr()] );\n (*data)[pAGivenY.repr()] = (*data)[cYA.repr()]\/( (*data)[cYA.repr()] +\n (*data)[cYB.repr()] );\n (*data)[pBGivenY.repr()] = (*data)[cYB.repr()]\/( (*data)[cYB.repr()] +\n (*data)[cYA.repr()] );\n\n \/\/ The ultimate value we want to maximize. This should increase with each\n \/\/ iteration.\n Calculator::UpdateProbOfObsDataSeq(n, data, tag_sequences);\n saved_obs_seq_probs.push_back((*data)[n.repr()]);\n OutputHelper::PrintDataRow(i + 1, rowOfNots, *data);\n }\n}\n\nvoid OutputResults(map<string, double> &data, Notation n, const vector<string>\n &tag_sequences) {\n cout << \"\\n--Results based on \" << NUMBER_ITERATIONS << \" iterations--\\n\";\n ofstream fout(\"observed_data_probabilities.txt\");\n for (int i = 0; i < saved_obs_seq_probs.size(); ++i) {\n fout << saved_obs_seq_probs[i] << endl;\n }\n cout << \"Values of \" << n << \" have been written to \"\n \"observed_data_probabilities.txt.\" << endl << endl;\n\n cout << \"Final \" << n << \": \" << data[n.repr()] << endl;\n cout << \"Final \" << pAGivenX << \": \" << data[pAGivenX.repr()] << endl;\n cout << \"Final \" << pBGivenX << \": \" << data[pBGivenX.repr()] << endl;\n cout << \"Final \" << pAGivenY << \": \" << data[pAGivenY.repr()] << endl;\n cout << \"Final \" << pBGivenY << \": \" << data[pBGivenY.repr()] << endl << endl;\n\n cout << \"Determining the best matching tag sequence:\\n\";\n vector<string> tags = NotationHelper::Individualize(tag_sequences.at(0));\n Notation pTW_first(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation *best_pTGivenW = NULL;\n string best_match_string_repr = pTW_first.repr();\n for (string seq : tag_sequences) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation pTGivenW(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n \/\/ Compute P(t|w). Technically not used because divided values seem to\n \/\/ incorrectly yield >1 (decimals too small, possibly).\n data[pTGivenW.repr()] = data[pTW.repr()] \/ data[n.repr()];\n if (DO_SHORT_SEQ) { \/\/ Only print for short seq; long seq has too many.\n cout << pTW << \": \" << data[pTW.repr()] << endl;\n }\n if (data[pTW.repr()] > data[best_match_string_repr]) {\n best_match_string_repr = pTW.repr();\n delete best_pTGivenW;\n \/\/ Same as pTGivenW.\n best_pTGivenW = new Notation(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n }\n }\n string pTAndWRepr = best_match_string_repr;\n cout << \"The highest probability found belongs to \" << pTAndWRepr << \": \" <<\n data[pTAndWRepr] << endl;\n cout << \"The best matching tag sequence is \" <<\n NotationHelper::Combine(best_pTGivenW->first) << endl;\n delete best_pTGivenW;\n}\n\nint main() {\n map<string, double> data;\n PrepareInitialData(&data);\n vector<string> tag_sequences = TagHandler::GenerateTagSequences(TAG_LIST,\n OBSERVED_DATA.size());\n if (DO_SHORT_SEQ) {\n ComputeDataWithBruteForce(&data, pABA, tag_sequences);\n OutputResults(data, pABA, tag_sequences);\n } else {\n ComputeDataWithBruteForce(&data, pLong, tag_sequences);\n OutputResults(data, pLong, tag_sequences);\n }\n return 0;\n}\n<commit_msg>created options for initial values<commit_after>#include <cassert>\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <vector>\n\n#include \"NLPHelper.h\"\n#include \"Notation.h\"\n\n\/* SETTINGS *\/\n\/\/ The number of iterations to do the EM training.\n#define NUMBER_ITERATIONS 100\n\n\/\/ Two ways to run this program: with a short or a long observed sequence.\n#define DO_SHORT_SEQ false\n\n\/\/ Initial values.\n#define INIT_VAL_pAGivenX .5\n#define INIT_VAL_pAGivenY .5\n#define INIT_VAL_pBGivenX .5\n#define INIT_VAL_pBGivenY .5\n\/* END SETTINGS *\/\n\n\/\/ TODO: Reorganize and use Notation::GIVEN_DELIM. http:\/\/bit.ly\/15rbAom\n#define GIVEN_DELIM \"|\"\n#define AND_DELIM \",\"\n#define SEQ_DELIM \"\"\n\nusing namespace std;\n\nconst string X = \"X\";\nconst string Y = \"Y\";\nconst string A = \"A\";\nconst string B = \"B\";\nconst vector<string> TAG_LIST{X, Y};\n#if DO_SHORT_SEQ\nconst vector<string> OBSERVED_DATA{A, B, A};\n#else\nconst vector<string> OBSERVED_DATA{A,A,A,B,A,A,B,A,A};\n#endif\n\n\/\/ For output. Saves the changing values of pABA (or the longer seq).\nvector<double> saved_obs_seq_probs;\n\n\/\/ Known probabilities:\nNotation pX(\"P\", {X}); \/\/ \"probability of x\"\nNotation pY(\"P\", {Y});\nNotation pXGivenX(\"P\", {X}, GIVEN_DELIM, {X});\nNotation pYGivenX(\"P\", {Y}, GIVEN_DELIM, {X});\nNotation pXGivenY(\"P\", {X}, GIVEN_DELIM, {Y});\nNotation pYGivenY(\"P\", {Y}, GIVEN_DELIM, {Y});\n\/\/ Objectives:\n\/\/ Short seq type.\nNotation pABA(\"P\", {A,B,A}, SEQ_DELIM);\nNotation pAGivenX(\"P\", {A}, GIVEN_DELIM, {X});\nNotation pAGivenY(\"P\", {A}, GIVEN_DELIM, {Y});\nNotation pBGivenX(\"P\", {B}, GIVEN_DELIM, {X});\nNotation pBGivenY(\"P\", {B}, GIVEN_DELIM, {Y});\nNotation cXA(\"C\", {X, A}, AND_DELIM); \/\/ \"count of x and a\"\nNotation cXB(\"C\", {X, B}, AND_DELIM);\nNotation cYA(\"C\", {Y, A}, AND_DELIM);\nNotation cYB(\"C\", {Y, B}, AND_DELIM);\n\/\/ Long seq type.\nNotation pLong(\"P\", {A,A,A,B,A,A,B,A,A}, SEQ_DELIM);\n\nvoid PrepareInitialData(map<string, double> *data) {\n \/\/ Given data.\n data->emplace(pX.repr(), .6);\n data->emplace(pY.repr(), .4);\n data->emplace(pXGivenX.repr(), .6);\n data->emplace(pYGivenX.repr(), .4);\n data->emplace(pXGivenY.repr(), .9);\n data->emplace(pYGivenY.repr(), .1);\n\n \/\/ Initial value for unknowns. We improve upon these.\n data->emplace(pAGivenX.repr(), INIT_VAL_pAGivenX);\n data->emplace(pAGivenY.repr(), INIT_VAL_pAGivenY);\n data->emplace(pBGivenX.repr(), INIT_VAL_pBGivenX);\n data->emplace(pBGivenY.repr(), INIT_VAL_pBGivenY);\n\n \/\/ Initial counts can be set to 0.\n data->emplace(cXA.repr(), 0);\n data->emplace(cYA.repr(), 0);\n data->emplace(cXB.repr(), 0);\n data->emplace(cYB.repr(), 0);\n}\n\nvoid ComputeDataWithBruteForce(map<string, double> *data, const Notation &n,\n const vector<string> &tag_sequences) {\n saved_obs_seq_probs.push_back((*data)[n.repr()]); \/\/ push back initial 0\n\n vector<Notation> rowOfNots{cXA, cXB, pAGivenX, pBGivenX, cYA, cYB, pAGivenY,\n pBGivenY, n};\n OutputHelper::PrintHeader(rowOfNots);\n OutputHelper::PrintDataRow(0, rowOfNots, *data);\n\n for (int i = 0; i < NUMBER_ITERATIONS; ++i) {\n \/\/ Reset counts to zero.\n (*data)[cXA.repr()] = 0;\n (*data)[cXB.repr()] = 0;\n (*data)[cYA.repr()] = 0;\n (*data)[cYB.repr()] = 0;\n\n \/\/ Get norm P(t,w) and counts.\n for (string seq : tag_sequences) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n double normalizedProb = Calculator::ComputeNormalizedProbability(pTW,\n *data, TAG_LIST.size(), OBSERVED_DATA.size());\n (*data)[pTW.repr()] = normalizedProb;\n\n \/\/ Get counts.\n (*data)[cXA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cXA);\n (*data)[cXB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cXB);\n (*data)[cYA.repr()] += Calculator::NormProbFactor(normalizedProb, pTW,\n cYA);\n (*data)[cYB.repr()] +=\n Calculator::NormProbFactor(normalizedProb, pTW, cYB);\n }\n \/\/ Update the unknown probabilities that we want to find. Use them in the\n \/\/ next iteration.\n (*data)[pAGivenX.repr()] = (*data)[cXA.repr()]\/( (*data)[cXA.repr()] +\n (*data)[cXB.repr()] );\n (*data)[pBGivenX.repr()] = (*data)[cXB.repr()]\/( (*data)[cXB.repr()] +\n (*data)[cXA.repr()] );\n (*data)[pAGivenY.repr()] = (*data)[cYA.repr()]\/( (*data)[cYA.repr()] +\n (*data)[cYB.repr()] );\n (*data)[pBGivenY.repr()] = (*data)[cYB.repr()]\/( (*data)[cYB.repr()] +\n (*data)[cYA.repr()] );\n\n \/\/ The ultimate value we want to maximize. This should increase with each\n \/\/ iteration.\n Calculator::UpdateProbOfObsDataSeq(n, data, tag_sequences);\n saved_obs_seq_probs.push_back((*data)[n.repr()]);\n OutputHelper::PrintDataRow(i + 1, rowOfNots, *data);\n }\n}\n\nvoid OutputResults(map<string, double> &data, Notation n, const vector<string>\n &tag_sequences) {\n cout << \"\\n--Results based on \" << NUMBER_ITERATIONS << \" iterations--\\n\";\n ofstream fout(\"observed_data_probabilities.txt\");\n for (int i = 0; i < saved_obs_seq_probs.size(); ++i) {\n fout << saved_obs_seq_probs[i] << endl;\n }\n cout << \"Values of \" << n << \" have been written to \"\n \"observed_data_probabilities.txt.\" << endl << endl;\n\n cout << \"Final \" << n << \": \" << data[n.repr()] << endl;\n cout << \"Final \" << pAGivenX << \": \" << data[pAGivenX.repr()] << endl;\n cout << \"Final \" << pBGivenX << \": \" << data[pBGivenX.repr()] << endl;\n cout << \"Final \" << pAGivenY << \": \" << data[pAGivenY.repr()] << endl;\n cout << \"Final \" << pBGivenY << \": \" << data[pBGivenY.repr()] << endl << endl;\n\n cout << \"Determining the best matching tag sequence:\\n\";\n vector<string> tags = NotationHelper::Individualize(tag_sequences.at(0));\n Notation pTW_first(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation *best_pTGivenW = NULL;\n string best_match_string_repr = pTW_first.repr();\n for (string seq : tag_sequences) {\n vector<string> tags = NotationHelper::Individualize(seq);\n Notation pTW(\"P\", OBSERVED_DATA, AND_DELIM, tags);\n Notation pTGivenW(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n \/\/ Compute P(t|w). Technically not used because divided values seem to\n \/\/ incorrectly yield >1 (decimals too small, possibly).\n data[pTGivenW.repr()] = data[pTW.repr()] \/ data[n.repr()];\n if (DO_SHORT_SEQ) { \/\/ Only print for short seq; long seq has too many.\n cout << pTW << \": \" << data[pTW.repr()] << endl;\n }\n if (data[pTW.repr()] > data[best_match_string_repr]) {\n best_match_string_repr = pTW.repr();\n delete best_pTGivenW;\n \/\/ Same as pTGivenW.\n best_pTGivenW = new Notation(\"P\", tags, GIVEN_DELIM, OBSERVED_DATA);\n }\n }\n string pTAndWRepr = best_match_string_repr;\n cout << \"The highest probability found belongs to \" << pTAndWRepr << \": \" <<\n data[pTAndWRepr] << endl;\n cout << \"The best matching tag sequence is \" <<\n NotationHelper::Combine(best_pTGivenW->first) << endl;\n delete best_pTGivenW;\n}\n\nint main() {\n map<string, double> data;\n PrepareInitialData(&data);\n vector<string> tag_sequences = TagHandler::GenerateTagSequences(TAG_LIST,\n OBSERVED_DATA.size());\n if (DO_SHORT_SEQ) {\n ComputeDataWithBruteForce(&data, pABA, tag_sequences);\n OutputResults(data, pABA, tag_sequences);\n } else {\n ComputeDataWithBruteForce(&data, pLong, tag_sequences);\n OutputResults(data, pLong, tag_sequences);\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2022 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/qt\/editor\/workspacegridview.h>\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/common\/inviwomodule.h>\n#include <inviwo\/core\/network\/workspaceannotations.h>\n#include <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/util\/stdextensions.h>\n#include <modules\/qtwidgets\/inviwoqtutils.h>\n\n#include <inviwo\/qt\/editor\/workspacemodelroles.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <QStyledItemDelegate>\n#include <QPainter>\n#include <QStyle>\n#include <QApplication>\n#include <QSortFilterProxyModel>\n#include <QHeaderView>\n#include <QPainterPath>\n#include <QIdentityProxyModel>\n#include <QHash>\n#include <QResizeEvent>\n#include <QPersistentModelIndex>\n#include <QScrollBar>\n#include <warn\/pop>\n\nnamespace inviwo {\n\nusing Role = WorkspaceModelRole;\nusing Type = WorkspaceModelType;\n\nnamespace {\n\nclass SectionDelegate : public QStyledItemDelegate {\npublic:\n SectionDelegate(int itemSize, QWidget* parent = nullptr);\n virtual ~SectionDelegate() override = default;\n\n virtual void paint(QPainter* painter, const QStyleOptionViewItem& option,\n const QModelIndex& index) const override;\n QSize sizeHint(const QStyleOptionViewItem& option, const QModelIndex& index) const override;\n\nprivate:\n QImage rightArrow;\n QImage downArrow;\n int itemSize_;\n};\n\nSectionDelegate::SectionDelegate(int itemSize, QWidget* parent)\n : QStyledItemDelegate(parent)\n , rightArrow{\":\/svgicons\/arrow-right-enabled.svg\"}\n , downArrow{\":\/svgicons\/arrow-down-enabled.svg\"}\n , itemSize_(itemSize) {}\n\nvoid SectionDelegate::paint(QPainter* painter, const QStyleOptionViewItem& o,\n const QModelIndex& index) const {\n\n auto option = o;\n initStyleOption(&option, index);\n painter->setRenderHints(QPainter::Antialiasing | QPainter::TextAntialiasing |\n QPainter::SmoothPixmapTransform);\n\n painter->save();\n if (utilqt::getData(index, Role::Type) == Type::File) {\n\n option.text = \"\";\n QStyle* style = option.widget ? option.widget->style() : QApplication::style();\n style->drawControl(QStyle::CE_ItemViewItem, &option, painter, option.widget);\n\n const auto name = utilqt::getData(index, Qt::DisplayRole).toString();\n const auto path = utilqt::getData(index, Role::Path).toString();\n const auto image = utilqt::getData(index, Role::PrimaryImage).value<QImage>();\n\n const auto margin = utilqt::emToPx(option.fontMetrics, 0.5);\n\n const auto baseRect = option.rect.adjusted(margin, margin, -margin, -margin);\n\n const auto txtHeight = baseRect.height() \/ 4;\n const auto imgCenter = baseRect.adjusted(0, 0, 0, -txtHeight - margin).center();\n const auto w = std::min(baseRect.width(), baseRect.height() - txtHeight - margin) \/ 2;\n const auto imgRect = QRect{imgCenter, QSize{0, 0}}.adjusted(-w, -w, w, w);\n\n QPainterPath border;\n border.addRoundedRect(imgRect, 35, 35, Qt::RelativeSize);\n\n const auto is = std::min(image.rect().width(), image.rect().height()) \/ 2;\n const auto sourceRect =\n QRect{image.rect().center(), QSize{0, 0}}.adjusted(-is, -is, is, is);\n painter->setClipPath(border, Qt::ReplaceClip);\n painter->drawImage(imgRect, image, sourceRect);\n painter->setClipPath(border, Qt::NoClip);\n\n painter->setPen(QPen{option.palette.text().color(), 1.5});\n painter->drawPath(border);\n\n const auto nameRect = baseRect.adjusted(0, baseRect.height() - txtHeight, 0, 0);\n painter->setPen(option.palette.text().color().lighter());\n painter->drawText(nameRect, Qt::AlignHCenter | Qt::AlignTop | Qt::TextWrapAnywhere, name);\n\n } else if (index.column() == 0) {\n \/\/ enlarge and emphasize font of section headers\n option.font.setBold(true);\n option.font.setPointSizeF(option.font.pointSizeF() * 1.2);\n\n option.text = \"\";\n QStyle* style = option.widget ? option.widget->style() : QApplication::style();\n style->drawControl(QStyle::CE_ItemViewItem, &option, painter, option.widget);\n\n painter->setClipping(false);\n\n const auto name = utilqt::getData(index, Qt::DisplayRole).toString();\n\n const auto& img = option.state & QStyle::State_Open ? downArrow : rightArrow;\n\n const auto indent = style->pixelMetric(QStyle::PM_TreeViewIndentation, 0, option.widget);\n\n const auto level = [&]() {\n auto i = index.parent();\n int l = 0;\n while (i.isValid()) {\n i = i.parent();\n ++l;\n }\n return l;\n }();\n\n auto rect = option.rect;\n const auto imgRect = QRect{\n QPoint{level * indent, rect.center().y() - img.rect().center().y()}, img.rect().size()};\n painter->drawImage(imgRect, img, img.rect());\n\n auto nameRect = option.rect;\n nameRect.adjust(level * indent + rect.height(), 0, 0, 0);\n\n painter->setFont(option.font);\n painter->drawText(nameRect,\n Qt::AlignLeft | Qt::AlignVCenter | Qt::TextDontClip | Qt::TextSingleLine,\n name);\n }\n painter->restore();\n}\n\nQSize SectionDelegate::sizeHint(const QStyleOptionViewItem& o, const QModelIndex& index) const {\n if (!index.isValid()) return QSize();\n\n auto size = QStyledItemDelegate::sizeHint(o, index);\n if (utilqt::getData(index, Role::Type) == Type::File) {\n size.setHeight(itemSize_);\n }\n return size;\n}\n\n} \/\/ namespace\n\nclass ChunkProxyModel : public QAbstractProxyModel {\npublic:\n ChunkProxyModel(QAbstractItemModel* model, int chunkSize, QObject* parent)\n : QAbstractProxyModel(parent), chunkSize_{chunkSize} {\n\n setSourceModel(model);\n auto reset = [this]() {\n beginResetModel();\n sourceIndexMapping_.clear();\n endResetModel();\n };\n connect(model, &QAbstractItemModel::rowsAboutToBeInserted, this, reset);\n connect(model, &QAbstractItemModel::rowsAboutToBeRemoved, this, reset);\n connect(model, &QAbstractItemModel::rowsAboutToBeMoved, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeInserted, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeRemoved, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeMoved, this, reset);\n connect(model, &QAbstractItemModel::modelAboutToBeReset, this, reset);\n connect(model, &QAbstractItemModel::layoutAboutToBeChanged, this, reset);\n\n connect(\n model, &QAbstractItemModel::dataChanged, this,\n [this](const QModelIndex& topLeft, const QModelIndex& bottomRight, const auto& roles) {\n for (int i = topLeft.row(); i <= bottomRight.row(); ++i) {\n auto changed = mapFromSource(sourceModel()->index(i, 0, topLeft.parent()));\n dataChanged(changed, changed, roles);\n }\n });\n }\n\n virtual int columnCount(\n [[maybe_unused]] const QModelIndex& parent = QModelIndex()) const override {\n return chunkSize_;\n }\n virtual int rowCount(const QModelIndex& parent = QModelIndex()) const override {\n auto sourceParent = mapToSource(parent);\n auto sourceRows = sourceModel()->rowCount(sourceParent);\n\n if (utilqt::getData(sourceParent, Role::Type) == Type::SubSection) {\n auto chunkedRows = (sourceRows + chunkSize_ - 1) \/ chunkSize_;\n return chunkedRows;\n } else {\n return sourceRows;\n }\n }\n\n QModelIndex mapFromSource(const QModelIndex& sourceIndex) const override {\n if (!sourceIndex.isValid()) return {};\n\n auto map = mapping(sourceIndex);\n if (utilqt::getData(sourceIndex, Role::Type) == Type::File) {\n const auto row = sourceIndex.row() \/ chunkSize_;\n const auto col = sourceIndex.row() % chunkSize_;\n return createIndex(row, col, map);\n } else {\n return createIndex(sourceIndex.row(), sourceIndex.column(), map);\n }\n }\n\n QModelIndex mapToSource(const QModelIndex& proxyIndex) const override {\n if (!proxyIndex.isValid()) return {};\n\n auto m = static_cast<const Mapping*>(proxyIndex.internalPointer());\n return sourceModel()->index(m->sourceRow, m->sourceCol, m->sourceParent);\n }\n\n QModelIndex parent(const QModelIndex& child) const override {\n const QModelIndex sourceIndex = mapToSource(child);\n const QModelIndex sourceParent = sourceIndex.parent();\n return mapFromSource(sourceParent);\n }\n\n QModelIndex index(int row, int column, const QModelIndex& parent) const override {\n const QModelIndex sourceParent = mapToSource(parent);\n\n if (utilqt::getData(sourceParent, Role::Type) == Type::SubSection) {\n const int sourceRow = row * chunkSize_ + column;\n return mapFromSource(sourceModel()->index(sourceRow, 0, sourceParent));\n } else {\n return mapFromSource(sourceModel()->index(row, column, sourceParent));\n }\n }\n\n QModelIndex sibling(int row, int column, const QModelIndex& idx) const override {\n if (!idx.isValid()) return {};\n return index(row, column, idx.parent());\n }\n\n void setChunkSize(int chunkSize) {\n if (chunkSize_ == chunkSize) return;\n\n beginResetModel();\n chunkSize_ = chunkSize;\n sourceIndexMapping_.clear();\n endResetModel();\n }\n\n int chunkSize() const { return chunkSize_; }\n\nprivate:\n struct Hash {\n size_t operator()(const QModelIndex& idx, size_t seed = std::hash<int>{}(0)) const {\n return qHash(idx, seed);\n }\n };\n struct Mapping {\n int sourceRow;\n int sourceCol;\n QPersistentModelIndex sourceParent;\n };\n using IndexMap = std::unordered_map<QModelIndex, Mapping, Hash>;\n\n Mapping* mapping(const QModelIndex& sourceIndex) const {\n auto [it, inserted] = sourceIndexMapping_.try_emplace(sourceIndex);\n if (inserted) {\n it->second.sourceRow = sourceIndex.row();\n it->second.sourceCol = sourceIndex.column();\n it->second.sourceParent = sourceIndex.parent();\n }\n return &(it->second);\n }\n mutable IndexMap sourceIndexMapping_;\n int chunkSize_;\n};\n\nWorkspaceGridView::WorkspaceGridView(QAbstractItemModel* theModel, QWidget* parent)\n : QTreeView{parent}\n , itemSize_{utilqt::emToPx(this, 14)}\n , proxy_{new ChunkProxyModel{theModel, 3, this}} {\n\n setModel(proxy_);\n\n setHeaderHidden(true);\n setSelectionBehavior(QAbstractItemView::SelectItems);\n setSelectionMode(QAbstractItemView::SelectionMode::SingleSelection);\n setItemDelegate(new SectionDelegate(itemSize_, this));\n setIndentation(0);\n\n#if defined(WIN32)\n \/\/ Scrolling on Windows is set to scroll per item by default. Also need to adjust the step size\n \/\/ since the default appears to be based on the number of items in the view.\n setVerticalScrollMode(ScrollPerPixel);\n verticalScrollBar()->setSingleStep(utilqt::emToPx(parent, 1.5));\n#endif\n\n connect(this, &QTreeView::doubleClicked, this, [this](const QModelIndex& index) {\n if (index.isValid() && (utilqt::getData(index, Role::Type) == Type::File)) {\n const auto filename = utilqt::getData(index, Role::FilePath).toString();\n const auto isExample = utilqt::getData(index, Role::isExample).toBool();\n emit loadFile(filename, isExample);\n }\n });\n\n connect(this, &QTreeView::clicked, this, [this](const QModelIndex& index) {\n if (index.isValid() && (utilqt::getData(index, Role::Type) != Type::File)) {\n\n if (QGuiApplication::keyboardModifiers() & Qt::ControlModifier) {\n isExpanded(index) ? collapseRecursively(index) : expandRecursively(index);\n } else {\n setExpanded(index, !isExpanded(index));\n }\n }\n });\n\n connect(selectionModel(), &QItemSelectionModel::currentChanged, this,\n [this](const QModelIndex& current, const QModelIndex&) {\n if (current.isValid() && (utilqt::getData(current, Role::Type) == Type::File)) {\n emit selectFile(current);\n } else {\n emit selectFile(QModelIndex{});\n }\n });\n\n header()->setSectionResizeMode(QHeaderView::Stretch);\n}\n\nconst QAbstractProxyModel& WorkspaceGridView::proxy() const { return *proxy_; }\n\nvoid WorkspaceGridView::resizeEvent(QResizeEvent* event) {\n QTreeView::resizeEvent(event);\n\n const int newChunkSize = event->size().width() \/ itemSize_;\n\n if (newChunkSize != proxy_->chunkSize()) {\n std::vector<QModelIndex> expanded;\n auto findExpaned = [&](auto& self, const QModelIndex& parent) -> void {\n auto rows = proxy_->rowCount(parent);\n for (int i = 0; i < rows; ++i) {\n auto index = proxy_->index(i, 0, parent);\n if (isExpanded(index)) {\n expanded.push_back(proxy_->mapToSource(index));\n self(self, index);\n }\n }\n };\n findExpaned(findExpaned, QModelIndex{});\n proxy_->setChunkSize(event->size().width() \/ itemSize_);\n for (const auto& idx : expanded) {\n expand(proxy_->mapFromSource(idx));\n }\n }\n}\n\n#if QT_VERSION < QT_VERSION_CHECK(5, 13, 0)\n\/\/ QTreeView::expandRecursively() was introduced in Qt 5.13\n\/\/ see https:\/\/doc.qt.io\/qt-5\/qtreeview.html#expandRecursively\nvoid WorkspaceGridView::expandRecursively(const QModelIndex& index) {\n if (index.isValid()) {\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n expandRecursively(index.child(i, 0));\n }\n if (!isExpanded(index)) {\n expand(index);\n }\n }\n}\n#endif\n\nvoid WorkspaceGridView::collapseRecursively(const QModelIndex& index) {\n if (index.isValid()) {\n for (int i = 0; i < model()->rowCount(index); ++i) {\n collapseRecursively(model()->index(i, 0, index));\n }\n if (isExpanded(index)) {\n collapse(index);\n }\n }\n}\n\n} \/\/ namespace inviwo\n<commit_msg>Qt: clang fix, #1284<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2022 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/qt\/editor\/workspacegridview.h>\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/common\/inviwomodule.h>\n#include <inviwo\/core\/network\/workspaceannotations.h>\n#include <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/util\/stdextensions.h>\n#include <modules\/qtwidgets\/inviwoqtutils.h>\n\n#include <inviwo\/qt\/editor\/workspacemodelroles.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <QStyledItemDelegate>\n#include <QPainter>\n#include <QStyle>\n#include <QApplication>\n#include <QSortFilterProxyModel>\n#include <QHeaderView>\n#include <QPainterPath>\n#include <QIdentityProxyModel>\n#include <QHash>\n#include <QResizeEvent>\n#include <QPersistentModelIndex>\n#include <QScrollBar>\n#include <warn\/pop>\n\nnamespace inviwo {\n\nusing Role = WorkspaceModelRole;\nusing Type = WorkspaceModelType;\n\nnamespace {\n\nclass SectionDelegate : public QStyledItemDelegate {\npublic:\n SectionDelegate(int itemSize, QWidget* parent = nullptr);\n virtual ~SectionDelegate() override = default;\n\n virtual void paint(QPainter* painter, const QStyleOptionViewItem& option,\n const QModelIndex& index) const override;\n QSize sizeHint(const QStyleOptionViewItem& option, const QModelIndex& index) const override;\n\nprivate:\n QImage rightArrow;\n QImage downArrow;\n int itemSize_;\n};\n\nSectionDelegate::SectionDelegate(int itemSize, QWidget* parent)\n : QStyledItemDelegate(parent)\n , rightArrow{\":\/svgicons\/arrow-right-enabled.svg\"}\n , downArrow{\":\/svgicons\/arrow-down-enabled.svg\"}\n , itemSize_(itemSize) {}\n\nvoid SectionDelegate::paint(QPainter* painter, const QStyleOptionViewItem& o,\n const QModelIndex& index) const {\n\n auto option = o;\n initStyleOption(&option, index);\n painter->setRenderHints(QPainter::Antialiasing | QPainter::TextAntialiasing |\n QPainter::SmoothPixmapTransform);\n\n painter->save();\n if (utilqt::getData(index, Role::Type) == Type::File) {\n\n option.text = \"\";\n QStyle* style = option.widget ? option.widget->style() : QApplication::style();\n style->drawControl(QStyle::CE_ItemViewItem, &option, painter, option.widget);\n\n const auto name = utilqt::getData(index, Qt::DisplayRole).toString();\n const auto path = utilqt::getData(index, Role::Path).toString();\n const auto image = utilqt::getData(index, Role::PrimaryImage).value<QImage>();\n\n const auto margin = utilqt::emToPx(option.fontMetrics, 0.5);\n\n const auto baseRect = option.rect.adjusted(margin, margin, -margin, -margin);\n\n const auto txtHeight = baseRect.height() \/ 4;\n const auto imgCenter = baseRect.adjusted(0, 0, 0, -txtHeight - margin).center();\n const auto w = std::min(baseRect.width(), baseRect.height() - txtHeight - margin) \/ 2;\n const auto imgRect = QRect{imgCenter, QSize{0, 0}}.adjusted(-w, -w, w, w);\n\n QPainterPath border;\n border.addRoundedRect(imgRect, 35, 35, Qt::RelativeSize);\n\n const auto is = std::min(image.rect().width(), image.rect().height()) \/ 2;\n const auto sourceRect =\n QRect{image.rect().center(), QSize{0, 0}}.adjusted(-is, -is, is, is);\n painter->setClipPath(border, Qt::ReplaceClip);\n painter->drawImage(imgRect, image, sourceRect);\n painter->setClipPath(border, Qt::NoClip);\n\n painter->setPen(QPen{option.palette.text().color(), 1.5});\n painter->drawPath(border);\n\n const auto nameRect = baseRect.adjusted(0, baseRect.height() - txtHeight, 0, 0);\n painter->setPen(option.palette.text().color().lighter());\n painter->drawText(nameRect, Qt::AlignHCenter | Qt::AlignTop | Qt::TextWrapAnywhere, name);\n\n } else if (index.column() == 0) {\n \/\/ enlarge and emphasize font of section headers\n option.font.setBold(true);\n option.font.setPointSizeF(option.font.pointSizeF() * 1.2);\n\n option.text = \"\";\n QStyle* style = option.widget ? option.widget->style() : QApplication::style();\n style->drawControl(QStyle::CE_ItemViewItem, &option, painter, option.widget);\n\n painter->setClipping(false);\n\n const auto name = utilqt::getData(index, Qt::DisplayRole).toString();\n\n const auto& img = option.state & QStyle::State_Open ? downArrow : rightArrow;\n\n const auto indent = style->pixelMetric(QStyle::PM_TreeViewIndentation, 0, option.widget);\n\n const auto level = [&]() {\n auto i = index.parent();\n int l = 0;\n while (i.isValid()) {\n i = i.parent();\n ++l;\n }\n return l;\n }();\n\n auto rect = option.rect;\n const auto imgRect = QRect{\n QPoint{level * indent, rect.center().y() - img.rect().center().y()}, img.rect().size()};\n painter->drawImage(imgRect, img, img.rect());\n\n auto nameRect = option.rect;\n nameRect.adjust(level * indent + rect.height(), 0, 0, 0);\n\n painter->setFont(option.font);\n painter->drawText(nameRect,\n Qt::AlignLeft | Qt::AlignVCenter | Qt::TextDontClip | Qt::TextSingleLine,\n name);\n }\n painter->restore();\n}\n\nQSize SectionDelegate::sizeHint(const QStyleOptionViewItem& o, const QModelIndex& index) const {\n if (!index.isValid()) return QSize();\n\n auto size = QStyledItemDelegate::sizeHint(o, index);\n if (utilqt::getData(index, Role::Type) == Type::File) {\n size.setHeight(itemSize_);\n }\n return size;\n}\n\n} \/\/ namespace\n\nclass ChunkProxyModel : public QAbstractProxyModel {\npublic:\n ChunkProxyModel(QAbstractItemModel* model, int chunkSize, QObject* parent)\n : QAbstractProxyModel(parent), chunkSize_{chunkSize} {\n\n setSourceModel(model);\n auto reset = [this]() {\n beginResetModel();\n sourceIndexMapping_.clear();\n endResetModel();\n };\n connect(model, &QAbstractItemModel::rowsAboutToBeInserted, this, reset);\n connect(model, &QAbstractItemModel::rowsAboutToBeRemoved, this, reset);\n connect(model, &QAbstractItemModel::rowsAboutToBeMoved, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeInserted, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeRemoved, this, reset);\n connect(model, &QAbstractItemModel::columnsAboutToBeMoved, this, reset);\n connect(model, &QAbstractItemModel::modelAboutToBeReset, this, reset);\n connect(model, &QAbstractItemModel::layoutAboutToBeChanged, this, reset);\n\n connect(\n model, &QAbstractItemModel::dataChanged, this,\n [this](const QModelIndex& topLeft, const QModelIndex& bottomRight, const auto& roles) {\n for (int i = topLeft.row(); i <= bottomRight.row(); ++i) {\n auto changed = mapFromSource(sourceModel()->index(i, 0, topLeft.parent()));\n dataChanged(changed, changed, roles);\n }\n });\n }\n\n virtual int columnCount(\n [[maybe_unused]] const QModelIndex& parent = QModelIndex()) const override {\n return chunkSize_;\n }\n virtual int rowCount(const QModelIndex& parent = QModelIndex()) const override {\n auto sourceParent = mapToSource(parent);\n auto sourceRows = sourceModel()->rowCount(sourceParent);\n\n if (utilqt::getData(sourceParent, Role::Type) == Type::SubSection) {\n auto chunkedRows = (sourceRows + chunkSize_ - 1) \/ chunkSize_;\n return chunkedRows;\n } else {\n return sourceRows;\n }\n }\n\n QModelIndex mapFromSource(const QModelIndex& sourceIndex) const override {\n if (!sourceIndex.isValid()) return {};\n\n auto map = mapping(sourceIndex);\n if (utilqt::getData(sourceIndex, Role::Type) == Type::File) {\n const auto row = sourceIndex.row() \/ chunkSize_;\n const auto col = sourceIndex.row() % chunkSize_;\n return createIndex(row, col, map);\n } else {\n return createIndex(sourceIndex.row(), sourceIndex.column(), map);\n }\n }\n\n QModelIndex mapToSource(const QModelIndex& proxyIndex) const override {\n if (!proxyIndex.isValid()) return {};\n\n auto m = static_cast<const Mapping*>(proxyIndex.internalPointer());\n return sourceModel()->index(m->sourceRow, m->sourceCol, m->sourceParent);\n }\n\n QModelIndex parent(const QModelIndex& child) const override {\n const QModelIndex sourceIndex = mapToSource(child);\n const QModelIndex sourceParent = sourceIndex.parent();\n return mapFromSource(sourceParent);\n }\n\n QModelIndex index(int row, int column, const QModelIndex& parent) const override {\n const QModelIndex sourceParent = mapToSource(parent);\n\n if (utilqt::getData(sourceParent, Role::Type) == Type::SubSection) {\n const int sourceRow = row * chunkSize_ + column;\n return mapFromSource(sourceModel()->index(sourceRow, 0, sourceParent));\n } else {\n return mapFromSource(sourceModel()->index(row, column, sourceParent));\n }\n }\n\n QModelIndex sibling(int row, int column, const QModelIndex& idx) const override {\n if (!idx.isValid()) return {};\n return index(row, column, idx.parent());\n }\n\n void setChunkSize(int chunkSize) {\n if (chunkSize_ == chunkSize) return;\n\n beginResetModel();\n chunkSize_ = chunkSize;\n sourceIndexMapping_.clear();\n endResetModel();\n }\n\n int chunkSize() const { return chunkSize_; }\n\nprivate:\n struct Hash {\n size_t operator()(const QModelIndex& idx) const { return qHash(idx, std::hash<int>{}(0)); }\n };\n struct Mapping {\n int sourceRow;\n int sourceCol;\n QPersistentModelIndex sourceParent;\n };\n using IndexMap = std::unordered_map<QModelIndex, Mapping, Hash>;\n\n Mapping* mapping(const QModelIndex& sourceIndex) const {\n auto [it, inserted] = sourceIndexMapping_.try_emplace(sourceIndex);\n if (inserted) {\n it->second.sourceRow = sourceIndex.row();\n it->second.sourceCol = sourceIndex.column();\n it->second.sourceParent = sourceIndex.parent();\n }\n return &(it->second);\n }\n mutable IndexMap sourceIndexMapping_;\n int chunkSize_;\n};\n\nWorkspaceGridView::WorkspaceGridView(QAbstractItemModel* theModel, QWidget* parent)\n : QTreeView{parent}\n , itemSize_{utilqt::emToPx(this, 14)}\n , proxy_{new ChunkProxyModel{theModel, 3, this}} {\n\n setModel(proxy_);\n\n setHeaderHidden(true);\n setSelectionBehavior(QAbstractItemView::SelectItems);\n setSelectionMode(QAbstractItemView::SelectionMode::SingleSelection);\n setItemDelegate(new SectionDelegate(itemSize_, this));\n setIndentation(0);\n\n#if defined(WIN32)\n \/\/ Scrolling on Windows is set to scroll per item by default. Also need to adjust the step size\n \/\/ since the default appears to be based on the number of items in the view.\n setVerticalScrollMode(ScrollPerPixel);\n verticalScrollBar()->setSingleStep(utilqt::emToPx(parent, 1.5));\n#endif\n\n connect(this, &QTreeView::doubleClicked, this, [this](const QModelIndex& index) {\n if (index.isValid() && (utilqt::getData(index, Role::Type) == Type::File)) {\n const auto filename = utilqt::getData(index, Role::FilePath).toString();\n const auto isExample = utilqt::getData(index, Role::isExample).toBool();\n emit loadFile(filename, isExample);\n }\n });\n\n connect(this, &QTreeView::clicked, this, [this](const QModelIndex& index) {\n if (index.isValid() && (utilqt::getData(index, Role::Type) != Type::File)) {\n\n if (QGuiApplication::keyboardModifiers() & Qt::ControlModifier) {\n isExpanded(index) ? collapseRecursively(index) : expandRecursively(index);\n } else {\n setExpanded(index, !isExpanded(index));\n }\n }\n });\n\n connect(selectionModel(), &QItemSelectionModel::currentChanged, this,\n [this](const QModelIndex& current, const QModelIndex&) {\n if (current.isValid() && (utilqt::getData(current, Role::Type) == Type::File)) {\n emit selectFile(current);\n } else {\n emit selectFile(QModelIndex{});\n }\n });\n\n header()->setSectionResizeMode(QHeaderView::Stretch);\n}\n\nconst QAbstractProxyModel& WorkspaceGridView::proxy() const { return *proxy_; }\n\nvoid WorkspaceGridView::resizeEvent(QResizeEvent* event) {\n QTreeView::resizeEvent(event);\n\n const int newChunkSize = event->size().width() \/ itemSize_;\n\n if (newChunkSize != proxy_->chunkSize()) {\n std::vector<QModelIndex> expanded;\n auto findExpaned = [&](auto& self, const QModelIndex& parent) -> void {\n auto rows = proxy_->rowCount(parent);\n for (int i = 0; i < rows; ++i) {\n auto index = proxy_->index(i, 0, parent);\n if (isExpanded(index)) {\n expanded.push_back(proxy_->mapToSource(index));\n self(self, index);\n }\n }\n };\n findExpaned(findExpaned, QModelIndex{});\n proxy_->setChunkSize(event->size().width() \/ itemSize_);\n for (const auto& idx : expanded) {\n expand(proxy_->mapFromSource(idx));\n }\n }\n}\n\n#if QT_VERSION < QT_VERSION_CHECK(5, 13, 0)\n\/\/ QTreeView::expandRecursively() was introduced in Qt 5.13\n\/\/ see https:\/\/doc.qt.io\/qt-5\/qtreeview.html#expandRecursively\nvoid WorkspaceGridView::expandRecursively(const QModelIndex& index) {\n if (index.isValid()) {\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n expandRecursively(index.child(i, 0));\n }\n if (!isExpanded(index)) {\n expand(index);\n }\n }\n}\n#endif\n\nvoid WorkspaceGridView::collapseRecursively(const QModelIndex& index) {\n if (index.isValid()) {\n for (int i = 0; i < model()->rowCount(index); ++i) {\n collapseRecursively(model()->index(i, 0, index));\n }\n if (isExpanded(index)) {\n collapse(index);\n }\n }\n}\n\n} \/\/ namespace inviwo\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <vector>\n#include <iterator>\n\n#include <sstream>\n#include <vector>\n#include <memory>\n#include <regex>\n#include <map>\n#include <algorithm>\n#include <functional>\n\nusing namespace std;\n\nwstringstream program_test(L\" 10 ( hello?) (hello -5) ( hi ( one two)) \");\nwstringstream program_norwig(L\"(begin (define r 10) (* pi (* r r)))\");\n\ntypedef wstring Token;\ntypedef vector<Token>::iterator TokenItr;\n\nconst Token openParen = L\"(\";\nconst Token closeParen = L\")\";\n\nbool IsNumber(const Token& token)\n{\n\treturn regex_match(token, wregex(L\"[(-|+)|][0-9]+\"));\n}\n\nvector<Token> tokenize(wistream& program)\n{\n\tvector<Token> tokens;\n\n\tistreambuf_iterator<wchar_t> itr(program);\n\tistreambuf_iterator<wchar_t> eos;\n\n\twhile(itr != eos)\n\t{\n\t\twhile(itr != eos && iswspace(*itr))\n\t\t\titr++;\n\n\t\ttokens.emplace_back();\n\n\t\tif(*itr == '(')\n\t\t{\n\t\t\ttokens.back() = openParen;\n\t\t\titr++;\n\t\t}\n\t\telse if(*itr == ')')\n\t\t{\n\t\t\ttokens.back() = closeParen;\n\t\t\titr++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\twhile(itr != eos && !iswspace(*itr) && !(*itr == ')') && !(*itr == '('))\n\t\t\t{\n\t\t\t\ttokens.back().push_back(*itr);\n\t\t\t\titr++;\n\t\t\t}\n\t\t}\n\n\t\twhile(itr != eos && iswspace(*itr))\n\t\t\titr++;\n\t}\n\n\treturn tokens;\n}\n\n\n\ntemplate<typename T>\nvoid print(const T& x, wostream& os)\n{\n\t\/\/os << x << '\\n';\n\tos << x ;\n}\n\nclass Context;\n\nstruct Expression\n{\n\ttemplate<typename T>\n\tExpression(const T& src):Expression_(new Impl<T>(src))\n\t{\n\t}\n\n\tExpression(const Expression& src):Expression_(src.Expression_){}\n\n\tfriend void print(const Expression& x, wostream& os) \n\t{\n\t\tx.Expression_->print_(os);\n\t}\n\n\ttemplate<typename T>\n\tT get() const\n\t{\n\t\tauto impl = dynamic_cast<Impl<T>*>(Expression_.get());\n\t\tif(impl)\n\t\t{\n\t\t\treturn impl->mData;\n\t\t}\n\n\t\tthrow;\n\t}\n\nprivate:\n\tstruct Concept\n\t{\n\t\tvirtual void print_(wostream&) const = 0;\n\t\tvirtual Expression eval(const Context& context) const = 0;\n\t};\n\t\n\ttemplate<typename T>\n\tstruct Impl : public Concept\n\t{\n\t\tImpl(const T& data):mData(data){}\n\n\t\tvoid print_(wostream& os) const override\n\t\t{\n\t\t\tprint(mData, os);\n\t\t}\n\n\t\tT mData;\n\t};\n\n\nprivate:\n\tshared_ptr<Concept> Expression_;\n};\n\n\nstruct Number\n{\n\tNumber(int value): value_(value){}\n\n\tExpression eval() const { return Expression(*this); }\n\n\toperator int() const { return value_; }\n\n\tvoid print_(wostream& os) const\n\t{\n\t\tos << value_;\n\t}\n\nprivate:\n\tint value_;\n};\n\nExpression make_atom(Token token)\n{\n\tif(IsNumber(token))\n\t{\n\t\twstringstream ss(token);\n\t\t\n\t\tint num = 0;\n\t\t\n\t\tss >> num;\n\n\t\treturn num;\n\t}\n\telse\n\t{\n\t\treturn token;\n\t}\n}\n\n\nstruct List\n{\n\tList(vector<Token>::iterator& itr, const vector<Token>::iterator& last)\n\t{\n\t\twhile(itr != last)\n\t\t{\n\t\t\tif(*itr == openParen)\n\t\t\t{\n\t\t\t\tlist_.emplace_back(List(++itr, last));\n\t\t\t}\n\t\t\telse if(*itr == closeParen)\n\t\t\t{\n\t\t\t\titr++;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlist_.push_back(make_atom(*itr));\n\t\t\t\titr++;\n\t\t\t}\n\t\t}\n\t}\n\n\tExpression eval() const { return Expression(0); }\n\n\tvoid print_(wostream& os) const\n\t{\n\t\tos << \"[\";\n\n\t\tfor(const auto& expr : list_)\n\t\t{\n\t\t\tprint(expr, os);\n\t\t\tos << ' ';\n\t\t}\n\n\t\tos << \"]\";\n\t}\n\nprivate:\n\tvector<Expression> list_;\n};\n\nwostream& operator<<(wostream& os, const List& listExpr)\n{\n\tlistExpr.print_(os);\n\n\treturn os;\n}\n\ntypedef map<wstring, Expression> Context;\n\n\n\n\nstruct OpPlus\n{\n\tvoid print_(wostream& os) const\n\t{\n\t\tos << L\"+\";\n\t}\n\n\tExpression operator()(vector<Expression> operands)\n\t{\n\t\tint sum = 0;\n\n\t\tfor(const auto& operand : operands)\n\t\t{\n\t\t\tsum += operand.get<int>();\n\t\t}\n\n\t\treturn sum;\n\t}\n\n};\n\nwostream& operator<<(wostream& os, const OpPlus& op)\n{\n\top.print_(os);\n\n\treturn os;\n}\n\n\n\n\n\n\ntypedef vector<Expression> Program;\n\n\n\nint main(int argc, char** argv)\n{\n\tContext gContext;\n\n\tgContext.emplace(wstring(L\"+\"), Expression(OpPlus()));\n\n\tProgram program;\n\n\tprogram.push_back(1);\n\tprogram.push_back(wstring(L\"Hello\"));\n\tprogram.push_back(Number(5));\n\n\n\tfor(const auto& aExpr : program)\n\t{\n\t\tprint(aExpr, wcout);\n\t}\n\n\twcout << program.front().get<int>() << '\\n';\n\n\t\/\/Program toSum = { 1, 2, 3 , wstring(L\"Hello\")};\n\tProgram toSum = { 1, 2, 3 };\n\n\tauto op = OpPlus();\n\n\tauto sumExpr = op(toSum);\n\n\twcout << L\"sum = \";\n\t\n\tprint(sumExpr, wcout);\n\t\n\twcout << '\\n';\n\n\tauto aTokens = tokenize(program_norwig);\n\n\tauto myList = List(aTokens.begin(), aTokens.end());\n\n\tprint(myList, wcout);\n\n\twcout << '\\n';\n\n\taTokens = tokenize(program_test);\n\n\tauto myList2 = List(aTokens.begin(), aTokens.end());\n\n\tprint(myList2, wcout);\n\n\twcout << '\\n';\n\n\n\n\n\treturn 0;\n}\n<commit_msg>wtf concepts<commit_after>#include <iostream>\n#include <string>\n#include <vector>\n#include <iterator>\n\n#include <sstream>\n#include <vector>\n#include <memory>\n#include <regex>\n#include <map>\n#include <algorithm>\n#include <functional>\n\nusing namespace std;\n\nwstringstream program_test(L\" 10 ( hello?) (hello -5) ( hi ( one two)) \");\nwstringstream program_norwig(L\"(begin (define r 10) (* pi (* r r)))\");\n\ntypedef wstring Token;\ntypedef vector<Token>::iterator TokenItr;\n\nconst Token openParen = L\"(\";\nconst Token closeParen = L\")\";\n\nbool IsNumber(const Token& token)\n{\n\treturn regex_match(token, wregex(L\"[(-|+)|][0-9]+\"));\n}\n\nvector<Token> tokenize(wistream& program)\n{\n\tvector<Token> tokens;\n\n\tistreambuf_iterator<wchar_t> itr(program);\n\tistreambuf_iterator<wchar_t> eos;\n\n\twhile(itr != eos)\n\t{\n\t\twhile(itr != eos && iswspace(*itr))\n\t\t\titr++;\n\n\t\ttokens.emplace_back();\n\n\t\tif(*itr == '(')\n\t\t{\n\t\t\ttokens.back() = openParen;\n\t\t\titr++;\n\t\t}\n\t\telse if(*itr == ')')\n\t\t{\n\t\t\ttokens.back() = closeParen;\n\t\t\titr++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\twhile(itr != eos && !iswspace(*itr) && !(*itr == ')') && !(*itr == '('))\n\t\t\t{\n\t\t\t\ttokens.back().push_back(*itr);\n\t\t\t\titr++;\n\t\t\t}\n\t\t}\n\n\t\twhile(itr != eos && iswspace(*itr))\n\t\t\titr++;\n\t}\n\n\treturn tokens;\n}\n\n\n\ntemplate<typename T>\nvoid print(const T& x, wostream& os)\n{\n\t\/\/os << x << '\\n';\n\tos << x ;\n}\n\n\nstruct Context;\n\nstruct Expression\n{\n\ttemplate<typename T>\n\tExpression(const T& src):Expression_(new Impl<T>(src))\n\t{\n\t}\n\n\tExpression(const Expression& src):Expression_(src.Expression_){}\n\n\tfriend void print(const Expression& x, std::wostream& os) \n\t{\n\t\tx.Expression_->print_(os);\n\t}\n\n\tfriend Expression eval(const Expression& e, const Context& context)\n\t{\n\t\treturn e.Expression_->eval(context);\n\t}\n\n\ttemplate<typename T>\n\tT get() const\n\t{\n\t\tauto impl = dynamic_cast<Impl<T>*>(Expression_.get());\n\t\tif(impl)\n\t\t{\n\t\t\treturn impl->mData;\n\t\t}\n\n\t\tthrow;\n\t}\n\nprivate:\n\tstruct Concept\n\t{\n\t\tvirtual void print_(std::wostream&) const = 0;\n\t\tvirtual Expression eval(const Context& context) const = 0;\n\t};\n\t\n\ttemplate<typename T>\n\tstruct Impl : public Concept\n\t{\n\t\tImpl(const T& data):mData(data){}\n\n\t\tvoid print_(wostream& os) const override\n\t\t{\n\t\t\tprint(mData, os);\n\t\t}\n\n\t\tExpression eval(const Context& context) const override\n\t\t{\n\t\t\treturn *this;\n\t\t}\n\n\t\tT mData;\n\t};\n\n\nprivate:\n\tshared_ptr<Concept> Expression_;\n};\n\nstruct Number\n{\n\tNumber(int value): value_(value){}\n\n\tExpression eval(const Context& context) const { return Expression(*this); }\n\n\toperator int() const { return value_; }\n\n\tvoid print_(std::wostream& os) const\n\t{\n\t\tos << value_;\n\t}\n\nprivate:\n\tint value_;\n};\n\nwostream& operator<<(wostream& os, const Number& num)\n{\n\tnum.print_(os);\n\n\treturn os;\n};\n\n\n\nstruct Symbol\n{\n\tSymbol(wstring value): value_(value){}\n\n\tExpression eval(const Context& context) const { return Expression(*this); }\n\n\toperator wstring() const { return value_; }\n\n\tvoid print_(std::wostream& os) const\n\t{\n\t\tos << value_;\n\t}\n\nprivate:\n\twstring value_;\n};\n\nwostream& operator<<(wostream& os, const Symbol& symbol)\n{\n\tsymbol.print_(os);\n\n\treturn os;\n};\n\nExpression make_atom(Token token)\n{\n\tif(IsNumber(token))\n\t{\n\t\twstringstream ss(token);\n\t\t\n\t\tint num = 0;\n\t\t\n\t\tss >> num;\n\n\t\treturn Number(num);\n\t}\n\telse\n\t{\n\t\treturn Symbol(token);\n\t}\n}\n\ntypedef unary_function<vector<Expression>&, Expression> Op;\n\n\nstruct OpPlus : public Op\n{\n\tvoid print_(wostream& os) const\n\t{\n\t\tos << L\"+\";\n\t}\n\n\tExpression operator()(vector<Expression>& operands) const\n\t{\n\t\tint sum = 0;\n\n\t\tfor(const auto& operand : operands)\n\t\t{\n\t\t\tsum += operand.get<Number>();\n\t\t}\n\n\t\treturn sum;\n\t}\n\n\tExpression eval(const Context& context) const\n\t{\n\t\treturn Expression(0);\n\t}\n\n};\n\nstruct List\n{\n\tList(vector<Token>::iterator& itr, const vector<Token>::iterator& last)\n\t{\n\t\twhile(itr != last)\n\t\t{\n\t\t\tif(*itr == openParen)\n\t\t\t{\n\t\t\t\tlist_.emplace_back(List(++itr, last));\n\t\t\t}\n\t\t\telse if(*itr == closeParen)\n\t\t\t{\n\t\t\t\titr++;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlist_.push_back(make_atom(*itr));\n\t\t\t\titr++;\n\t\t\t}\n\t\t}\n\t}\n\n\tExpression eval(const Context& context) const\n\t{\n\t\tOpPlus op = list_.front().get<OpPlus>();\n\n\t\tvector<Expression> args(++list_.begin(), list_.end());\n\n\t\treturn op(args);\n\t}\n\n\tvoid print_(wostream& os) const\n\t{\n\t\tos << \"[\";\n\n\t\tfor(const auto& expr : list_)\n\t\t{\n\t\t\tprint(expr, os);\n\t\t\tos << ' ';\n\t\t}\n\n\t\tos << \"]\";\n\t}\n\nprivate:\n\tvector<Expression> list_;\n};\n\nwostream& operator<<(wostream& os, const List& listExpr)\n{\n\tlistExpr.print_(os);\n\n\treturn os;\n}\n\nstruct Context\n{\n\tExpression Find(const Token& token) const\n\t{\n\t\tauto ret = map_.find(token);\n\t\tif(ret != map_.end())\n\t\t{\n\t\t\treturn ret->second;\n\t\t}\n\n\t\tthrow \"Undefined symbol\";\n\t}\n\n\tmap<Token, Expression> map_;\n};\n\n\nwostream& operator<<(wostream& os, const OpPlus& op)\n{\n\top.print_(os);\n\n\treturn os;\n}\n\n\n\n\n\n\ntypedef vector<Expression> Program;\n\n\n\nint main(int argc, char** argv)\n{\n\tContext gContext;\n\n\tgContext.map_.emplace(wstring(L\"+\"), Expression(OpPlus()));\n\n\tProgram program;\n\n\t\/\/program.push_back(Number(1));\n\t\/\/program.push_back(wstring(L\"Hello\"));\n\t\/\/program.push_back(Number(5));\n\n\n\tfor(const auto& aExpr : program)\n\t{\n\t\tprint(aExpr, wcout);\n\t}\n\n\t\/\/wcout << program.front().get<Number>() << '\\n';\n\n\t\/\/Program toSum = { 1, 2, 3 , wstring(L\"Hello\")};\n\t\/\/Program toSum = { 1, 2, 3 };\n\n\t\/\/auto op = OpPlus();\n\n\t\/\/auto sumExpr = op(toSum);\n\n\t\/\/wcout << L\"sum = \";\n\t\n\t\/\/print(sumExpr, wcout);\n\t\n\twcout << '\\n';\n\n\tauto aTokens = tokenize(program_norwig);\n\n\tauto myList = List(aTokens.begin(), aTokens.end());\n\n\tprint(myList, wcout);\n\n\twcout << '\\n';\n\n\taTokens = tokenize(program_test);\n\n\tauto myList2 = List(aTokens.begin(), aTokens.end());\n\n\tprint(myList2, wcout);\n\n\twcout << '\\n';\n\n\n\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\n#include <string>\n#include <iostream>\n#include <math.h>\n#include <algorithm>\n\n#include \"io.hh\"\n#include \"str.hh\"\n#include \"conf.hh\"\n#include \"HmmSet.hh\"\n#include \"util.hh\"\n\nusing namespace aku;\n\nconf::Config config;\n\n\nHmmSet model1;\nHmmSet model2;\n\n\nint\nmain(int argc, char *argv[])\n{\n std::string m1_gk, m1_mc, m1_ph;\n std::string m2_gk, m2_mc;\n std::string out_base;\n try {\n config(\"usage: clskld [OPTION...]\\n\")\n ('h', \"help\", \"\", \"\", \"display help\")\n ('\\0', \"base1=BASENAME\", \"arg\", \"\", \"base filename for the source model\")\n ('\\0', \"gk1=FILE\", \"arg\", \"\", \"Mixture base distributions for the source model\")\n ('\\0', \"mc1=FILE\", \"arg\", \"\", \"Mixture coefficients for the states of the source model\")\n ('\\0', \"ph1=FILE\", \"arg\", \"\", \"HMM definitions for the source model\")\n ('\\0', \"base2=BASENAME\", \"arg\", \"\", \"base filename for the updated model\")\n ('\\0', \"gk2=FILE\", \"arg\", \"\", \"Mixture base distributions for the updated model\")\n ('\\0', \"mc2=FILE\", \"arg\", \"\", \"Mixture coefficients for the states of the updated model\")\n ('\\0', \"ph2=FILE\", \"arg\", \"\", \"HMM definitions for the updated model\")\n ('w', \"mixtures\", \"\", \"\", \"Print KLDs of mixture weights\")\n ('m', \"means\", \"\", \"\", \"Print KLDs of Gaussian means\")\n ('c', \"covs\", \"\", \"\", \"Print KLDs of Gaussian covariances\")\n ;\n config.default_parse(argc, argv);\n \n \/\/ Load the first model\n if (config[\"base1\"].specified)\n {\n model1.read_all(config[\"base1\"].get_str());\n }\n else if (config[\"gk1\"].specified && config[\"mc1\"].specified &&\n config[\"ph1\"].specified)\n {\n model1.read_gk(config[\"gk1\"].get_str());\n model1.read_mc(config[\"mc1\"].get_str());\n model1.read_ph(config[\"ph1\"].get_str());\n }\n else\n throw std::string(\"Must give either --base1 or all --gk1, --mc1 and --ph1\");\n\n \/\/ Load the second model\n if (config[\"base2\"].specified)\n {\n model2.read_all(config[\"base2\"].get_str());\n }\n else if (config[\"gk2\"].specified && config[\"mc2\"].specified &&\n config[\"ph2\"].specified)\n {\n model2.read_gk(config[\"gk2\"].get_str());\n model2.read_mc(config[\"mc2\"].get_str());\n model2.read_ph(config[\"ph2\"].get_str());\n }\n else\n throw std::string(\"Must give either --base2 or all --gk2, --mc2 and --ph2\");\n\n \/\/ Model similarity check\n if (model1.num_emission_pdfs() != model2.num_emission_pdfs())\n throw std::string(\"Both models must have the same number of mixtures\");\n if (model1.num_pool_pdfs() != model2.num_pool_pdfs())\n throw std::string(\"Both models must have the same number of Gaussians\");\n\n\n if (config[\"mixtures\"].specified)\n {\n for (int i = 0; i < model1.num_emission_pdfs(); i++)\n {\n Mixture *m1 = model1.get_emission_pdf(i);\n Mixture *m2 = model2.get_emission_pdf(i);\n \/\/assert( m1->size() == m2->size() );\n if (m1->size() != m2->size())\n continue;\n\n double kld = 0;\n for (int j = 0; j < m1->size(); j++)\n {\n double w1 = m1->get_mixture_coefficient(j);\n double w2 = m2->get_mixture_coefficient(j);\n kld += w2*log(w2\/w1);\n }\n printf(\"%g\\n\", kld);\n }\n }\n if (config[\"means\"].specified)\n {\n PDFPool *pool1 = model1.get_pool();\n PDFPool *pool2 = model2.get_pool();\n\n for (int i = 0; i < pool1->size(); i++)\n {\n Gaussian *pdf1 = dynamic_cast< Gaussian* >(pool1->get_pdf(i));\n Gaussian *pdf2 = dynamic_cast< Gaussian* >(pool2->get_pdf(i));\n if (pdf1 == NULL || pdf2 == NULL)\n throw std::string(\"Only Gaussian PDFs are supported!\");\n\n Vector mean1;\n Vector mean2;\n Vector cov;\n pdf1->get_mean(mean1);\n pdf2->get_mean(mean2);\n pdf1->get_covariance(cov);\n\n int dim = mean1.size();\n double kld = 0;\n for (int j = 0; j < dim; j++)\n {\n double d = mean2(j)-mean1(j);\n kld += d*d\/cov(j);\n }\n kld \/= 2.0;\n printf(\"%g\\n\", kld);\n }\n }\n\n if (config[\"covs\"].specified)\n {\n PDFPool *pool1 = model1.get_pool();\n PDFPool *pool2 = model2.get_pool();\n\n for (int i = 0; i < pool1->size(); i++)\n {\n Gaussian *pdf1 = dynamic_cast< Gaussian* >(pool1->get_pdf(i));\n Gaussian *pdf2 = dynamic_cast< Gaussian* >(pool2->get_pdf(i));\n if (pdf1 == NULL || pdf2 == NULL)\n throw std::string(\"Only Gaussian PDFs are supported!\");\n\n Vector cov1;\n Vector cov2;\n pdf1->get_covariance(cov1);\n pdf2->get_covariance(cov2);\n\n int dim = cov1.size();\n double kld = 0;\n for (int j = 0; j < dim; j++)\n kld += cov2(j)\/cov1(j) + log(cov1(j)\/cov2(j));\n kld = (kld - dim)\/2.0;\n printf(\"%g\\n\", kld);\n }\n }\n }\n\n \/\/ Handle errors\n catch (std::exception &e) {\n fprintf(stderr, \"exception: %s\\n\", e.what());\n abort();\n }\n\n catch (std::string &str) {\n fprintf(stderr, \"exception: %s\\n\", str.c_str());\n abort();\n }\n\n}\n<commit_msg>Gaussian KLD evaluation<commit_after>#include <fstream>\n#include <string>\n#include <iostream>\n#include <math.h>\n#include <algorithm>\n\n#include \"io.hh\"\n#include \"str.hh\"\n#include \"conf.hh\"\n#include \"HmmSet.hh\"\n#include \"util.hh\"\n\nusing namespace aku;\n\nconf::Config config;\n\n\nHmmSet model1;\nHmmSet model2;\n\n\nint\nmain(int argc, char *argv[])\n{\n std::string m1_gk, m1_mc, m1_ph;\n std::string m2_gk, m2_mc;\n std::string out_base;\n try {\n config(\"usage: clskld [OPTION...]\\n\")\n ('h', \"help\", \"\", \"\", \"display help\")\n ('\\0', \"base1=BASENAME\", \"arg\", \"\", \"base filename for the source model\")\n ('\\0', \"gk1=FILE\", \"arg\", \"\", \"Mixture base distributions for the source model\")\n ('\\0', \"mc1=FILE\", \"arg\", \"\", \"Mixture coefficients for the states of the source model\")\n ('\\0', \"ph1=FILE\", \"arg\", \"\", \"HMM definitions for the source model\")\n ('\\0', \"base2=BASENAME\", \"arg\", \"\", \"base filename for the updated model\")\n ('\\0', \"gk2=FILE\", \"arg\", \"\", \"Mixture base distributions for the updated model\")\n ('\\0', \"mc2=FILE\", \"arg\", \"\", \"Mixture coefficients for the states of the updated model\")\n ('\\0', \"ph2=FILE\", \"arg\", \"\", \"HMM definitions for the updated model\")\n ('w', \"mixtures\", \"\", \"\", \"Print KLDs of mixture weights\")\n ('g', \"gaussians\", \"\", \"\", \"Print KLDs of Gaussians\")\n ('m', \"means\", \"\", \"\", \"Print KLDs of Gaussian means\")\n ('c', \"covs\", \"\", \"\", \"Print KLDs of Gaussian covariances\")\n ;\n config.default_parse(argc, argv);\n \n \/\/ Load the first model\n if (config[\"base1\"].specified)\n {\n model1.read_all(config[\"base1\"].get_str());\n }\n else if (config[\"gk1\"].specified && config[\"mc1\"].specified &&\n config[\"ph1\"].specified)\n {\n model1.read_gk(config[\"gk1\"].get_str());\n model1.read_mc(config[\"mc1\"].get_str());\n model1.read_ph(config[\"ph1\"].get_str());\n }\n else\n throw std::string(\"Must give either --base1 or all --gk1, --mc1 and --ph1\");\n\n \/\/ Load the second model\n if (config[\"base2\"].specified)\n {\n model2.read_all(config[\"base2\"].get_str());\n }\n else if (config[\"gk2\"].specified && config[\"mc2\"].specified &&\n config[\"ph2\"].specified)\n {\n model2.read_gk(config[\"gk2\"].get_str());\n model2.read_mc(config[\"mc2\"].get_str());\n model2.read_ph(config[\"ph2\"].get_str());\n }\n else\n throw std::string(\"Must give either --base2 or all --gk2, --mc2 and --ph2\");\n\n \/\/ Model similarity check\n if (model1.num_emission_pdfs() != model2.num_emission_pdfs())\n throw std::string(\"Both models must have the same number of mixtures\");\n if (model1.num_pool_pdfs() != model2.num_pool_pdfs())\n throw std::string(\"Both models must have the same number of Gaussians\");\n\n\n if (config[\"mixtures\"].specified)\n {\n for (int i = 0; i < model1.num_emission_pdfs(); i++)\n {\n Mixture *m1 = model1.get_emission_pdf(i);\n Mixture *m2 = model2.get_emission_pdf(i);\n \/\/assert( m1->size() == m2->size() );\n if (m1->size() != m2->size())\n continue;\n\n double kld = 0;\n for (int j = 0; j < m1->size(); j++)\n {\n double w1 = m1->get_mixture_coefficient(j);\n double w2 = m2->get_mixture_coefficient(j);\n kld += w2*log(w2\/w1);\n }\n printf(\"%g\\n\", kld);\n }\n }\n if (config[\"gaussians\"].specified)\n {\n PDFPool *pool1 = model1.get_pool();\n PDFPool *pool2 = model2.get_pool();\n\n for (int i = 0; i < pool1->size(); i++)\n {\n Gaussian *pdf1 = dynamic_cast< Gaussian* >(pool1->get_pdf(i));\n Gaussian *pdf2 = dynamic_cast< Gaussian* >(pool2->get_pdf(i));\n if (pdf1 == NULL || pdf2 == NULL)\n throw std::string(\"Only Gaussian PDFs are supported!\");\n\n Vector mean1;\n Vector mean2;\n Vector cov1;\n Vector cov2;\n pdf1->get_mean(mean1);\n pdf2->get_mean(mean2);\n pdf1->get_covariance(cov1);\n pdf2->get_covariance(cov2);\n int dim = cov1.size();\n double kld = 0;\n for (int j = 0; j < dim; j++)\n {\n double d = mean2(j)-mean1(j);\n kld += d*d\/cov1(j);\n kld += cov2(j)\/cov1(j) + log(cov1(j)\/cov2(j));\n }\n kld = (kld - dim)\/2.0;\n printf(\"%g\\n\", kld);\n }\n }\n \n if (config[\"means\"].specified)\n {\n PDFPool *pool1 = model1.get_pool();\n PDFPool *pool2 = model2.get_pool();\n\n for (int i = 0; i < pool1->size(); i++)\n {\n Gaussian *pdf1 = dynamic_cast< Gaussian* >(pool1->get_pdf(i));\n Gaussian *pdf2 = dynamic_cast< Gaussian* >(pool2->get_pdf(i));\n if (pdf1 == NULL || pdf2 == NULL)\n throw std::string(\"Only Gaussian PDFs are supported!\");\n\n Vector mean1;\n Vector mean2;\n Vector cov;\n pdf1->get_mean(mean1);\n pdf2->get_mean(mean2);\n pdf1->get_covariance(cov);\n\n int dim = mean1.size();\n double kld = 0;\n for (int j = 0; j < dim; j++)\n {\n double d = mean2(j)-mean1(j);\n kld += d*d\/cov(j);\n }\n kld \/= 2.0;\n printf(\"%g\\n\", kld);\n }\n }\n\n if (config[\"covs\"].specified)\n {\n PDFPool *pool1 = model1.get_pool();\n PDFPool *pool2 = model2.get_pool();\n\n for (int i = 0; i < pool1->size(); i++)\n {\n Gaussian *pdf1 = dynamic_cast< Gaussian* >(pool1->get_pdf(i));\n Gaussian *pdf2 = dynamic_cast< Gaussian* >(pool2->get_pdf(i));\n if (pdf1 == NULL || pdf2 == NULL)\n throw std::string(\"Only Gaussian PDFs are supported!\");\n\n Vector cov1;\n Vector cov2;\n pdf1->get_covariance(cov1);\n pdf2->get_covariance(cov2);\n\n int dim = cov1.size();\n double kld = 0;\n for (int j = 0; j < dim; j++)\n kld += cov2(j)\/cov1(j) + log(cov1(j)\/cov2(j));\n kld = (kld - dim)\/2.0;\n printf(\"%g\\n\", kld);\n }\n }\n }\n\n \/\/ Handle errors\n catch (std::exception &e) {\n fprintf(stderr, \"exception: %s\\n\", e.what());\n abort();\n }\n\n catch (std::string &str) {\n fprintf(stderr, \"exception: %s\\n\", str.c_str());\n abort();\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * #%L\n * %%\n * Copyright (C) 2011 - 2016 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n#include \"runtimes\/libjoynr-runtime\/LibJoynrRuntime.h\"\n\n#include <cassert>\n#include <vector>\n\n#include \"joynr\/Dispatcher.h\"\n#include \"joynr\/InProcessDispatcher.h\"\n#include \"joynr\/system\/RoutingTypes\/CommonApiDbusAddress.h\"\n#include \"joynr\/PublicationManager.h\"\n#include \"joynr\/SubscriptionManager.h\"\n#include \"joynr\/InProcessPublicationSender.h\"\n#include \"joynr\/JoynrMessageSender.h\"\n#include \"joynr\/MessageRouter.h\"\n#include \"libjoynr\/in-process\/InProcessLibJoynrMessagingSkeleton.h\"\n#include \"joynr\/InProcessMessagingAddress.h\"\n#include \"joynr\/MessagingStubFactory.h\"\n#include \"libjoynr\/in-process\/InProcessMessagingStubFactory.h\"\n#include \"joynr\/system\/DiscoveryProxy.h\"\n#include \"joynr\/TypeUtil.h\"\n#include \"joynr\/Util.h\"\n#include \"joynr\/Settings.h\"\n\nnamespace joynr\n{\n\nLibJoynrRuntime::LibJoynrRuntime(Settings* settings)\n : JoynrRuntime(*settings),\n subscriptionManager(nullptr),\n inProcessPublicationSender(nullptr),\n inProcessConnectorFactory(nullptr),\n joynrMessagingConnectorFactory(nullptr),\n joynrMessagingSendStub(nullptr),\n joynrMessageSender(nullptr),\n joynrDispatcher(nullptr),\n inProcessDispatcher(nullptr),\n settings(settings),\n libjoynrSettings(new LibjoynrSettings(*settings)),\n dispatcherMessagingSkeleton(nullptr),\n runtimeExecutor(nullptr)\n{\n libjoynrSettings->printSettings();\n}\n\nLibJoynrRuntime::~LibJoynrRuntime()\n{\n delete proxyFactory;\n delete inProcessDispatcher;\n delete joynrMessageSender;\n delete joynrDispatcher;\n delete libjoynrSettings;\n libjoynrSettings = nullptr;\n delete settings;\n}\n\nvoid LibJoynrRuntime::init(\n std::shared_ptr<IMiddlewareMessagingStubFactory> middlewareMessagingStubFactory,\n std::shared_ptr<const joynr::system::RoutingTypes::Address> libjoynrMessagingAddress,\n std::shared_ptr<const joynr::system::RoutingTypes::Address> ccMessagingAddress)\n{\n \/\/ create messaging stub factory\n auto messagingStubFactory = std::make_shared<MessagingStubFactory>();\n middlewareMessagingStubFactory->registerOnMessagingStubClosedCallback([messagingStubFactory](\n const std::shared_ptr<const joynr::system::RoutingTypes::Address>& destinationAddress) {\n messagingStubFactory->remove(destinationAddress);\n });\n messagingStubFactory->registerStubFactory(middlewareMessagingStubFactory);\n messagingStubFactory->registerStubFactory(std::make_shared<InProcessMessagingStubFactory>());\n\n \/\/ create message router\n messageRouter = std::make_shared<MessageRouter>(std::move(messagingStubFactory),\n libjoynrMessagingAddress,\n singleThreadIOService.getIOService());\n\n startLibJoynrMessagingSkeleton(messageRouter);\n\n joynrMessageSender = new JoynrMessageSender(messageRouter);\n joynrDispatcher = new Dispatcher(joynrMessageSender, singleThreadIOService.getIOService());\n joynrMessageSender->registerDispatcher(joynrDispatcher);\n\n \/\/ create the inprocess skeleton for the dispatcher\n dispatcherMessagingSkeleton =\n std::make_shared<InProcessLibJoynrMessagingSkeleton>(joynrDispatcher);\n dispatcherAddress = std::make_shared<InProcessMessagingAddress>(dispatcherMessagingSkeleton);\n\n publicationManager = new PublicationManager(singleThreadIOService.getIOService());\n subscriptionManager = new SubscriptionManager(singleThreadIOService.getIOService());\n inProcessDispatcher = new InProcessDispatcher(singleThreadIOService.getIOService());\n\n inProcessPublicationSender = new InProcessPublicationSender(subscriptionManager);\n inProcessConnectorFactory = new InProcessConnectorFactory(\n subscriptionManager,\n publicationManager,\n inProcessPublicationSender,\n dynamic_cast<IRequestCallerDirectory*>(inProcessDispatcher));\n joynrMessagingConnectorFactory =\n new JoynrMessagingConnectorFactory(joynrMessageSender, subscriptionManager);\n\n auto connectorFactory = std::make_unique<ConnectorFactory>(\n inProcessConnectorFactory, joynrMessagingConnectorFactory);\n proxyFactory = new ProxyFactory(libjoynrMessagingAddress, std::move(connectorFactory), nullptr);\n\n \/\/ Set up the persistence file for storing provider participant ids\n std::string persistenceFilename = libjoynrSettings->getParticipantIdsPersistenceFilename();\n participantIdStorage = std::make_shared<ParticipantIdStorage>(persistenceFilename);\n\n \/\/ initialize the dispatchers\n std::vector<IDispatcher*> dispatcherList;\n dispatcherList.push_back(inProcessDispatcher);\n dispatcherList.push_back(joynrDispatcher);\n\n joynrDispatcher->registerPublicationManager(publicationManager);\n joynrDispatcher->registerSubscriptionManager(subscriptionManager);\n\n discoveryProxy = std::make_unique<LocalDiscoveryAggregator>(systemServicesSettings);\n requestCallerDirectory = dynamic_cast<IRequestCallerDirectory*>(inProcessDispatcher);\n\n std::string systemServicesDomain = systemServicesSettings.getDomain();\n std::string routingProviderParticipantId =\n systemServicesSettings.getCcRoutingProviderParticipantId();\n\n DiscoveryQos routingProviderDiscoveryQos;\n routingProviderDiscoveryQos.setCacheMaxAgeMs(1000);\n routingProviderDiscoveryQos.setArbitrationStrategy(\n DiscoveryQos::ArbitrationStrategy::FIXED_PARTICIPANT);\n routingProviderDiscoveryQos.addCustomParameter(\n \"fixedParticipantId\", routingProviderParticipantId);\n routingProviderDiscoveryQos.setDiscoveryTimeoutMs(50);\n\n std::unique_ptr<ProxyBuilder<joynr::system::RoutingProxy>> routingProxyBuilder(\n createProxyBuilder<joynr::system::RoutingProxy>(systemServicesDomain));\n auto routingProxy = routingProxyBuilder->setMessagingQos(MessagingQos(10000))\n ->setCached(false)\n ->setDiscoveryQos(routingProviderDiscoveryQos)\n ->build();\n messageRouter->setParentRouter(std::unique_ptr<system::RoutingProxy>(routingProxy),\n ccMessagingAddress,\n routingProviderParticipantId);\n\n \/\/ setup discovery\n std::string discoveryProviderParticipantId =\n systemServicesSettings.getCcDiscoveryProviderParticipantId();\n DiscoveryQos discoveryProviderDiscoveryQos;\n discoveryProviderDiscoveryQos.setCacheMaxAgeMs(1000);\n discoveryProviderDiscoveryQos.setArbitrationStrategy(\n DiscoveryQos::ArbitrationStrategy::FIXED_PARTICIPANT);\n discoveryProviderDiscoveryQos.addCustomParameter(\n \"fixedParticipantId\", discoveryProviderParticipantId);\n discoveryProviderDiscoveryQos.setDiscoveryTimeoutMs(1000);\n\n std::unique_ptr<ProxyBuilder<joynr::system::DiscoveryProxy>> discoveryProxyBuilder(\n createProxyBuilder<joynr::system::DiscoveryProxy>(systemServicesDomain));\n joynr::system::IDiscoverySync* proxy =\n discoveryProxyBuilder->setMessagingQos(MessagingQos(40000))\n ->setCached(false)\n ->setDiscoveryQos(discoveryProviderDiscoveryQos)\n ->build();\n discoveryProxy->setDiscoveryProxy(std::unique_ptr<joynr::system::IDiscoverySync>(proxy));\n capabilitiesRegistrar = std::make_unique<CapabilitiesRegistrar>(\n dispatcherList,\n *discoveryProxy,\n participantIdStorage,\n dispatcherAddress,\n messageRouter,\n messagingSettings.getDiscoveryEntryExpiryIntervalMs());\n}\n\nvoid LibJoynrRuntime::unregisterProvider(const std::string& participantId)\n{\n assert(capabilitiesRegistrar);\n capabilitiesRegistrar->remove(participantId);\n}\n\nvoid LibJoynrRuntime::setRuntimeExecutor(JoynrRuntimeExecutor* runtimeExecutor)\n{\n this->runtimeExecutor = std::unique_ptr<JoynrRuntimeExecutor>(runtimeExecutor);\n}\n\nLibJoynrRuntime* LibJoynrRuntime::create(JoynrRuntimeExecutor* runtimeExecutor)\n{\n LibJoynrRuntime* runtime = runtimeExecutor->getRuntime();\n runtime->setRuntimeExecutor(runtimeExecutor);\n return runtime;\n}\n\n} \/\/ namespace joynr\n<commit_msg>[C++] Ensure the libjoynr runtime is loading persisted subscriptions<commit_after>\/*\n * #%L\n * %%\n * Copyright (C) 2011 - 2016 BMW Car IT GmbH\n * %%\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * #L%\n *\/\n#include \"runtimes\/libjoynr-runtime\/LibJoynrRuntime.h\"\n\n#include <cassert>\n#include <vector>\n\n#include \"joynr\/Dispatcher.h\"\n#include \"joynr\/InProcessDispatcher.h\"\n#include \"joynr\/system\/RoutingTypes\/CommonApiDbusAddress.h\"\n#include \"joynr\/PublicationManager.h\"\n#include \"joynr\/SubscriptionManager.h\"\n#include \"joynr\/InProcessPublicationSender.h\"\n#include \"joynr\/JoynrMessageSender.h\"\n#include \"joynr\/MessageRouter.h\"\n#include \"libjoynr\/in-process\/InProcessLibJoynrMessagingSkeleton.h\"\n#include \"joynr\/InProcessMessagingAddress.h\"\n#include \"joynr\/MessagingStubFactory.h\"\n#include \"libjoynr\/in-process\/InProcessMessagingStubFactory.h\"\n#include \"joynr\/system\/DiscoveryProxy.h\"\n#include \"joynr\/TypeUtil.h\"\n#include \"joynr\/Util.h\"\n#include \"joynr\/Settings.h\"\n\nnamespace joynr\n{\n\nLibJoynrRuntime::LibJoynrRuntime(Settings* settings)\n : JoynrRuntime(*settings),\n subscriptionManager(nullptr),\n inProcessPublicationSender(nullptr),\n inProcessConnectorFactory(nullptr),\n joynrMessagingConnectorFactory(nullptr),\n joynrMessagingSendStub(nullptr),\n joynrMessageSender(nullptr),\n joynrDispatcher(nullptr),\n inProcessDispatcher(nullptr),\n settings(settings),\n libjoynrSettings(new LibjoynrSettings(*settings)),\n dispatcherMessagingSkeleton(nullptr),\n runtimeExecutor(nullptr)\n{\n libjoynrSettings->printSettings();\n}\n\nLibJoynrRuntime::~LibJoynrRuntime()\n{\n delete proxyFactory;\n delete inProcessDispatcher;\n delete joynrMessageSender;\n delete joynrDispatcher;\n delete libjoynrSettings;\n libjoynrSettings = nullptr;\n delete settings;\n}\n\nvoid LibJoynrRuntime::init(\n std::shared_ptr<IMiddlewareMessagingStubFactory> middlewareMessagingStubFactory,\n std::shared_ptr<const joynr::system::RoutingTypes::Address> libjoynrMessagingAddress,\n std::shared_ptr<const joynr::system::RoutingTypes::Address> ccMessagingAddress)\n{\n \/\/ create messaging stub factory\n auto messagingStubFactory = std::make_shared<MessagingStubFactory>();\n middlewareMessagingStubFactory->registerOnMessagingStubClosedCallback([messagingStubFactory](\n const std::shared_ptr<const joynr::system::RoutingTypes::Address>& destinationAddress) {\n messagingStubFactory->remove(destinationAddress);\n });\n messagingStubFactory->registerStubFactory(middlewareMessagingStubFactory);\n messagingStubFactory->registerStubFactory(std::make_shared<InProcessMessagingStubFactory>());\n\n \/\/ create message router\n messageRouter = std::make_shared<MessageRouter>(std::move(messagingStubFactory),\n libjoynrMessagingAddress,\n singleThreadIOService.getIOService());\n\n startLibJoynrMessagingSkeleton(messageRouter);\n\n joynrMessageSender = new JoynrMessageSender(messageRouter);\n joynrDispatcher = new Dispatcher(joynrMessageSender, singleThreadIOService.getIOService());\n joynrMessageSender->registerDispatcher(joynrDispatcher);\n\n \/\/ create the inprocess skeleton for the dispatcher\n dispatcherMessagingSkeleton =\n std::make_shared<InProcessLibJoynrMessagingSkeleton>(joynrDispatcher);\n dispatcherAddress = std::make_shared<InProcessMessagingAddress>(dispatcherMessagingSkeleton);\n\n publicationManager = new PublicationManager(singleThreadIOService.getIOService());\n publicationManager->loadSavedAttributeSubscriptionRequestsMap(\n libjoynrSettings->getSubscriptionRequestPersistenceFilename());\n publicationManager->loadSavedBroadcastSubscriptionRequestsMap(\n libjoynrSettings->getBroadcastSubscriptionRequestPersistenceFilename());\n subscriptionManager = new SubscriptionManager(singleThreadIOService.getIOService());\n inProcessDispatcher = new InProcessDispatcher(singleThreadIOService.getIOService());\n\n inProcessPublicationSender = new InProcessPublicationSender(subscriptionManager);\n inProcessConnectorFactory = new InProcessConnectorFactory(\n subscriptionManager,\n publicationManager,\n inProcessPublicationSender,\n dynamic_cast<IRequestCallerDirectory*>(inProcessDispatcher));\n joynrMessagingConnectorFactory =\n new JoynrMessagingConnectorFactory(joynrMessageSender, subscriptionManager);\n\n auto connectorFactory = std::make_unique<ConnectorFactory>(\n inProcessConnectorFactory, joynrMessagingConnectorFactory);\n proxyFactory = new ProxyFactory(libjoynrMessagingAddress, std::move(connectorFactory), nullptr);\n\n \/\/ Set up the persistence file for storing provider participant ids\n std::string persistenceFilename = libjoynrSettings->getParticipantIdsPersistenceFilename();\n participantIdStorage = std::make_shared<ParticipantIdStorage>(persistenceFilename);\n\n \/\/ initialize the dispatchers\n std::vector<IDispatcher*> dispatcherList;\n dispatcherList.push_back(inProcessDispatcher);\n dispatcherList.push_back(joynrDispatcher);\n\n joynrDispatcher->registerPublicationManager(publicationManager);\n joynrDispatcher->registerSubscriptionManager(subscriptionManager);\n\n discoveryProxy = std::make_unique<LocalDiscoveryAggregator>(systemServicesSettings);\n requestCallerDirectory = dynamic_cast<IRequestCallerDirectory*>(inProcessDispatcher);\n\n std::string systemServicesDomain = systemServicesSettings.getDomain();\n std::string routingProviderParticipantId =\n systemServicesSettings.getCcRoutingProviderParticipantId();\n\n DiscoveryQos routingProviderDiscoveryQos;\n routingProviderDiscoveryQos.setCacheMaxAgeMs(1000);\n routingProviderDiscoveryQos.setArbitrationStrategy(\n DiscoveryQos::ArbitrationStrategy::FIXED_PARTICIPANT);\n routingProviderDiscoveryQos.addCustomParameter(\n \"fixedParticipantId\", routingProviderParticipantId);\n routingProviderDiscoveryQos.setDiscoveryTimeoutMs(50);\n\n std::unique_ptr<ProxyBuilder<joynr::system::RoutingProxy>> routingProxyBuilder(\n createProxyBuilder<joynr::system::RoutingProxy>(systemServicesDomain));\n auto routingProxy = routingProxyBuilder->setMessagingQos(MessagingQos(10000))\n ->setCached(false)\n ->setDiscoveryQos(routingProviderDiscoveryQos)\n ->build();\n messageRouter->setParentRouter(std::unique_ptr<system::RoutingProxy>(routingProxy),\n ccMessagingAddress,\n routingProviderParticipantId);\n\n \/\/ setup discovery\n std::string discoveryProviderParticipantId =\n systemServicesSettings.getCcDiscoveryProviderParticipantId();\n DiscoveryQos discoveryProviderDiscoveryQos;\n discoveryProviderDiscoveryQos.setCacheMaxAgeMs(1000);\n discoveryProviderDiscoveryQos.setArbitrationStrategy(\n DiscoveryQos::ArbitrationStrategy::FIXED_PARTICIPANT);\n discoveryProviderDiscoveryQos.addCustomParameter(\n \"fixedParticipantId\", discoveryProviderParticipantId);\n discoveryProviderDiscoveryQos.setDiscoveryTimeoutMs(1000);\n\n std::unique_ptr<ProxyBuilder<joynr::system::DiscoveryProxy>> discoveryProxyBuilder(\n createProxyBuilder<joynr::system::DiscoveryProxy>(systemServicesDomain));\n joynr::system::IDiscoverySync* proxy =\n discoveryProxyBuilder->setMessagingQos(MessagingQos(40000))\n ->setCached(false)\n ->setDiscoveryQos(discoveryProviderDiscoveryQos)\n ->build();\n discoveryProxy->setDiscoveryProxy(std::unique_ptr<joynr::system::IDiscoverySync>(proxy));\n capabilitiesRegistrar = std::make_unique<CapabilitiesRegistrar>(\n dispatcherList,\n *discoveryProxy,\n participantIdStorage,\n dispatcherAddress,\n messageRouter,\n messagingSettings.getDiscoveryEntryExpiryIntervalMs());\n}\n\nvoid LibJoynrRuntime::unregisterProvider(const std::string& participantId)\n{\n assert(capabilitiesRegistrar);\n capabilitiesRegistrar->remove(participantId);\n}\n\nvoid LibJoynrRuntime::setRuntimeExecutor(JoynrRuntimeExecutor* runtimeExecutor)\n{\n this->runtimeExecutor = std::unique_ptr<JoynrRuntimeExecutor>(runtimeExecutor);\n}\n\nLibJoynrRuntime* LibJoynrRuntime::create(JoynrRuntimeExecutor* runtimeExecutor)\n{\n LibJoynrRuntime* runtime = runtimeExecutor->getRuntime();\n runtime->setRuntimeExecutor(runtimeExecutor);\n return runtime;\n}\n\n} \/\/ namespace joynr\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2006 Apple Computer, Inc. All rights reserved.\n * Copyright (C) 2006 Justin Haygood <jhaygood@spsu.edu>.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \n *\/\n\n#include \"config.h\"\n#include \"ScrollView.h\"\n\n#include <algorithm>\n#include \"FloatRect.h\"\n#include \"IntRect.h\"\n#include <windows.h>\n\nusing namespace std;\n\nnamespace WebCore {\n\nclass ScrollView::ScrollViewPrivate {\npublic:\n ScrollViewPrivate()\n : hasStaticBackground(false)\n , suppressScrollBars(false)\n , vScrollBarMode(ScrollBarAuto)\n , hScrollBarMode(ScrollBarAuto)\n {\n }\n IntSize scrollOffset;\n IntSize contentsSize;\n bool hasStaticBackground;\n bool suppressScrollBars;\n ScrollBarMode vScrollBarMode;\n ScrollBarMode hScrollBarMode;\n};\n\nScrollView::ScrollView()\n : m_data(new ScrollViewPrivate())\n{\n}\n\nScrollView::~ScrollView()\n{\n delete m_data;\n}\n\nvoid ScrollView::updateContents(const IntRect& updateRect, bool now)\n{\n IntRect adjustedDirtyRect(updateRect);\n adjustedDirtyRect.move(-m_data->scrollOffset);\n\n RECT dirtyRect = RECT(adjustedDirtyRect);\n#if PAINT_FLASHING_DEBUG\n HDC dc = GetDC(containingWindow());\n FillRect(dc, &dirtyRect, (HBRUSH)GetStockObject(BLACK_BRUSH));\n ReleaseDC(containingWindow(), dc);\n#endif\n\n InvalidateRect(containingWindow(), &dirtyRect, true);\n if (now)\n UpdateWindow(containingWindow());\n}\n\nint ScrollView::visibleWidth() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n return (bounds.right - bounds.left);\n}\n\nint ScrollView::visibleHeight() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n return (bounds.bottom - bounds.top);\n}\n\nFloatRect ScrollView::visibleContentRect() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n FloatRect contentRect = bounds;\n contentRect.move(m_data->scrollOffset);\n return contentRect;\n}\n\nvoid ScrollView::setContentsPos(int newX, int newY)\n{\n int dx = newX - contentsX();\n int dy = newY - contentsY();\n scrollBy(dx, dy);\n}\n\nvoid ScrollView::resizeContents(int w,int h)\n{\n IntSize newSize(w,h);\n if (m_data->contentsSize != newSize) {\n m_data->contentsSize = newSize;\n updateScrollBars(m_data->scrollOffset);\n } \n}\n\nint ScrollView::contentsX() const\n{\n return scrollOffset().width();\n}\n\nint ScrollView::contentsY() const\n{\n return scrollOffset().height();\n}\n\nint ScrollView::contentsWidth() const\n{\n return m_data->contentsSize.width();\n}\n\nint ScrollView::contentsHeight() const\n{\n return m_data->contentsSize.height();\n}\n\nIntPoint ScrollView::convertToContainingWindow(const IntPoint& point) const\n{\n return point - scrollOffset();\n}\n\nIntPoint ScrollView::convertFromContainingWindow(const IntPoint& point) const\n{\n return point + scrollOffset();\n}\n\nIntSize ScrollView::scrollOffset() const\n{\n return m_data->scrollOffset;\n}\n\nIntSize ScrollView::maximumScroll() const\n{\n IntSize delta = m_data->contentsSize - m_data->scrollOffset;\n delta.clampNegativeToZero();\n return delta;\n}\n\nvoid ScrollView::scrollBy(int dx, int dy)\n{\n IntSize scrollOffset = m_data->scrollOffset;\n IntSize maxScroll = maximumScroll();\n IntSize newScrollOffset = scrollOffset + IntSize(dx, dy);\n newScrollOffset.clampNegativeToZero();\n\n if (newScrollOffset != scrollOffset) {\n m_data->scrollOffset = newScrollOffset;\n updateScrollBars(m_data->scrollOffset);\n \/\/ ScrollBar updates can fail, so we check the final delta before scrolling\n IntSize scrollDelta = m_data->scrollOffset - scrollOffset;\n if (scrollDelta == IntSize())\n return;\n if (!m_data->hasStaticBackground)\n \/\/ FIXME: This could be made more efficient by passing a valid clip rect for only the document content.\n ScrollWindowEx(containingWindow(), -scrollDelta.width(), -scrollDelta.height(), 0, 0, 0, 0, SW_INVALIDATE);\n else\n InvalidateRect(containingWindow(), 0, true);\n }\n}\n\nWebCore::ScrollBarMode ScrollView::hScrollBarMode() const\n{\n return m_data->hScrollBarMode;\n}\n\nWebCore::ScrollBarMode ScrollView::vScrollBarMode() const\n{\n return m_data->vScrollBarMode;\n}\n\nvoid ScrollView::suppressScrollBars(bool suppressed, bool repaintOnSuppress)\n{\n m_data->suppressScrollBars = suppressed;\n if (repaintOnSuppress)\n updateScrollBars(m_data->scrollOffset);\n}\n\nvoid ScrollView::setHScrollBarMode(ScrollBarMode newMode)\n{\n if (m_data->hScrollBarMode != newMode) {\n m_data->hScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n }\n}\n\nvoid ScrollView::setVScrollBarMode(ScrollBarMode newMode)\n{\n if (m_data->vScrollBarMode != newMode) {\n m_data->vScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n }\n}\n\nvoid ScrollView::setScrollBarsMode(ScrollBarMode newMode)\n{\n m_data->hScrollBarMode = m_data->vScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n}\n\nvoid ScrollView::setStaticBackground(bool flag)\n{\n m_data->hasStaticBackground = flag;\n}\n\nstatic int updateScrollInfo(ScrollView* view, short type, int current, int max, int pageSize)\n{\n SCROLLINFO si;\n si.cbSize = sizeof(si);\n si.fMask = SIF_RANGE | SIF_PAGE | SIF_POS;\n si.nMin = 0;\n si.nMax = max;\n si.nPage = pageSize;\n si.nPos = current;\n SetScrollInfo(view->containingWindow(), type, &si, TRUE);\n GetScrollInfo(view->containingWindow(), type, &si);\n return si.nPos;\n}\n\nvoid ScrollView::updateScrollBars(const IntPoint&)\n{ \n IntSize maxScrollPosition(contentsWidth(), contentsHeight());\n IntSize scroll = scrollOffset().shrunkTo(maxScrollPosition);\n scroll.clampNegativeToZero();\n\n m_data->scrollOffset = \n IntSize(updateScrollInfo(this, SB_HORZ, scroll.width(), contentsWidth() - 1, width()),\n updateScrollInfo(this, SB_VERT, scroll.height(), contentsHeight() - 1, height()));\n\n if (m_data->hScrollBarMode != ScrollBarAuto || m_data->suppressScrollBars)\n ShowScrollBar(containingWindow(), SB_HORZ, (m_data->hScrollBarMode != ScrollBarAlwaysOff) && !m_data->suppressScrollBars);\n if (m_data->vScrollBarMode != ScrollBarAuto || m_data->suppressScrollBars)\n ShowScrollBar(containingWindow(), SB_VERT, (m_data->vScrollBarMode != ScrollBarAlwaysOff) && !m_data->suppressScrollBars);\n}\n\n}\n<commit_msg>Fix Win32 bustage.<commit_after>\/*\n * Copyright (C) 2006 Apple Computer, Inc. All rights reserved.\n * Copyright (C) 2006 Justin Haygood <jhaygood@spsu.edu>.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. \n *\/\n\n#include \"config.h\"\n#include \"ScrollView.h\"\n\n#include <algorithm>\n#include \"FloatRect.h\"\n#include \"IntRect.h\"\n#include <windows.h>\n\nusing namespace std;\n\nnamespace WebCore {\n\nclass ScrollView::ScrollViewPrivate {\npublic:\n ScrollViewPrivate()\n : hasStaticBackground(false)\n , suppressScrollBars(false)\n , vScrollBarMode(ScrollBarAuto)\n , hScrollBarMode(ScrollBarAuto)\n {\n }\n IntSize scrollOffset;\n IntSize contentsSize;\n bool hasStaticBackground;\n bool suppressScrollBars;\n ScrollBarMode vScrollBarMode;\n ScrollBarMode hScrollBarMode;\n};\n\nScrollView::ScrollView()\n : m_data(new ScrollViewPrivate())\n{\n}\n\nScrollView::~ScrollView()\n{\n delete m_data;\n}\n\nvoid ScrollView::updateContents(const IntRect& updateRect, bool now)\n{\n IntRect adjustedDirtyRect(updateRect);\n adjustedDirtyRect.move(-m_data->scrollOffset);\n\n RECT dirtyRect = RECT(adjustedDirtyRect);\n#if PAINT_FLASHING_DEBUG\n HDC dc = GetDC(containingWindow());\n FillRect(dc, &dirtyRect, (HBRUSH)GetStockObject(BLACK_BRUSH));\n ReleaseDC(containingWindow(), dc);\n#endif\n\n InvalidateRect(containingWindow(), &dirtyRect, true);\n if (now)\n UpdateWindow(containingWindow());\n}\n\nint ScrollView::visibleWidth() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n return (bounds.right - bounds.left);\n}\n\nint ScrollView::visibleHeight() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n return (bounds.bottom - bounds.top);\n}\n\nFloatRect ScrollView::visibleContentRect() const\n{\n RECT bounds;\n GetClientRect(containingWindow(), &bounds);\n FloatRect contentRect = bounds;\n contentRect.move(m_data->scrollOffset);\n return contentRect;\n}\n\nvoid ScrollView::setContentsPos(int newX, int newY)\n{\n int dx = newX - contentsX();\n int dy = newY - contentsY();\n scrollBy(dx, dy);\n}\n\nvoid ScrollView::resizeContents(int w,int h)\n{\n IntSize newSize(w,h);\n if (m_data->contentsSize != newSize) {\n m_data->contentsSize = newSize;\n updateScrollBars(m_data->scrollOffset);\n } \n}\n\nint ScrollView::contentsX() const\n{\n return scrollOffset().width();\n}\n\nint ScrollView::contentsY() const\n{\n return scrollOffset().height();\n}\n\nint ScrollView::contentsWidth() const\n{\n return m_data->contentsSize.width();\n}\n\nint ScrollView::contentsHeight() const\n{\n return m_data->contentsSize.height();\n}\n\nIntPoint ScrollView::contentsToWindow(const IntPoint& point) const\n{\n return point - scrollOffset();\n}\n\nIntPoint ScrollView::windowToContents(const IntPoint& point) const\n{\n return point + scrollOffset();\n}\n\nIntSize ScrollView::scrollOffset() const\n{\n return m_data->scrollOffset;\n}\n\nIntSize ScrollView::maximumScroll() const\n{\n IntSize delta = m_data->contentsSize - m_data->scrollOffset;\n delta.clampNegativeToZero();\n return delta;\n}\n\nvoid ScrollView::scrollBy(int dx, int dy)\n{\n IntSize scrollOffset = m_data->scrollOffset;\n IntSize maxScroll = maximumScroll();\n IntSize newScrollOffset = scrollOffset + IntSize(dx, dy);\n newScrollOffset.clampNegativeToZero();\n\n if (newScrollOffset != scrollOffset) {\n m_data->scrollOffset = newScrollOffset;\n updateScrollBars(m_data->scrollOffset);\n \/\/ ScrollBar updates can fail, so we check the final delta before scrolling\n IntSize scrollDelta = m_data->scrollOffset - scrollOffset;\n if (scrollDelta == IntSize())\n return;\n if (!m_data->hasStaticBackground)\n \/\/ FIXME: This could be made more efficient by passing a valid clip rect for only the document content.\n ScrollWindowEx(containingWindow(), -scrollDelta.width(), -scrollDelta.height(), 0, 0, 0, 0, SW_INVALIDATE);\n else\n InvalidateRect(containingWindow(), 0, true);\n }\n}\n\nWebCore::ScrollBarMode ScrollView::hScrollBarMode() const\n{\n return m_data->hScrollBarMode;\n}\n\nWebCore::ScrollBarMode ScrollView::vScrollBarMode() const\n{\n return m_data->vScrollBarMode;\n}\n\nvoid ScrollView::suppressScrollBars(bool suppressed, bool repaintOnSuppress)\n{\n m_data->suppressScrollBars = suppressed;\n if (repaintOnSuppress)\n updateScrollBars(m_data->scrollOffset);\n}\n\nvoid ScrollView::setHScrollBarMode(ScrollBarMode newMode)\n{\n if (m_data->hScrollBarMode != newMode) {\n m_data->hScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n }\n}\n\nvoid ScrollView::setVScrollBarMode(ScrollBarMode newMode)\n{\n if (m_data->vScrollBarMode != newMode) {\n m_data->vScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n }\n}\n\nvoid ScrollView::setScrollBarsMode(ScrollBarMode newMode)\n{\n m_data->hScrollBarMode = m_data->vScrollBarMode = newMode;\n updateScrollBars(m_data->scrollOffset);\n}\n\nvoid ScrollView::setStaticBackground(bool flag)\n{\n m_data->hasStaticBackground = flag;\n}\n\nstatic int updateScrollInfo(ScrollView* view, short type, int current, int max, int pageSize)\n{\n SCROLLINFO si;\n si.cbSize = sizeof(si);\n si.fMask = SIF_RANGE | SIF_PAGE | SIF_POS;\n si.nMin = 0;\n si.nMax = max;\n si.nPage = pageSize;\n si.nPos = current;\n SetScrollInfo(view->containingWindow(), type, &si, TRUE);\n GetScrollInfo(view->containingWindow(), type, &si);\n return si.nPos;\n}\n\nvoid ScrollView::updateScrollBars(const IntPoint&)\n{ \n IntSize maxScrollPosition(contentsWidth(), contentsHeight());\n IntSize scroll = scrollOffset().shrunkTo(maxScrollPosition);\n scroll.clampNegativeToZero();\n\n m_data->scrollOffset = \n IntSize(updateScrollInfo(this, SB_HORZ, scroll.width(), contentsWidth() - 1, width()),\n updateScrollInfo(this, SB_VERT, scroll.height(), contentsHeight() - 1, height()));\n\n if (m_data->hScrollBarMode != ScrollBarAuto || m_data->suppressScrollBars)\n ShowScrollBar(containingWindow(), SB_HORZ, (m_data->hScrollBarMode != ScrollBarAlwaysOff) && !m_data->suppressScrollBars);\n if (m_data->vScrollBarMode != ScrollBarAuto || m_data->suppressScrollBars)\n ShowScrollBar(containingWindow(), SB_VERT, (m_data->vScrollBarMode != ScrollBarAlwaysOff) && !m_data->suppressScrollBars);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ created by : Timothée Feuillet\n\/\/ date: 2022-7-10\n\/\/\n\/\/\n\/\/ Copyright (c) 2022 Timothée Feuillet\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\n#pragma once\n\n#include <cstdint>\n#include <utility>\n\nnamespace neam::ct\n{\n static constexpr uint64_t combine(uint64_t a, uint64_t b)\n {\n return (a ^ (b + 0x9e3779b97f4a7c15 + (a << 6) + (a >> 2)));\n }\n static constexpr uint32_t combine(uint32_t a, uint32_t b)\n {\n return (a ^ (b + 0x9e3779b9 + (a << 6) + (a >> 2)));\n }\n\n static constexpr uint32_t fold32(uint64_t id)\n {\n return uint32_t(((id >> 32) ^ id) & 0xFFFFFFFF);\n }\n static constexpr uint32_t fold31(uint64_t id)\n {\n return uint32_t(((id >> 32) * id) & 0x7FFFFFFF);\n }\n}\n\n<commit_msg>Add bit scrambles from murmur<commit_after>\/\/\n\/\/ created by : Timothée Feuillet\n\/\/ date: 2022-7-10\n\/\/\n\/\/\n\/\/ Copyright (c) 2022 Timothée Feuillet\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\n#pragma once\n\n#include <cstdint>\n#include <utility>\n\nnamespace neam::ct\n{\n static constexpr uint64_t combine(uint64_t a, uint64_t b)\n {\n return (a ^ (b + 0x9e3779b97f4a7c15 + (a << 6) + (a >> 2)));\n }\n static constexpr uint32_t combine(uint32_t a, uint32_t b)\n {\n return (a ^ (b + 0x9e3779b9 + (a << 6) + (a >> 2)));\n }\n\n static constexpr uint32_t fold32(uint64_t id)\n {\n return uint32_t(((id >> 32) ^ id) & 0xFFFFFFFF);\n }\n static constexpr uint32_t fold31(uint64_t id)\n {\n return uint32_t(((id >> 32) ^ id) & 0x7FFFFFFF);\n }\n\n static constexpr uint64_t murmur_scramble(uint64_t h)\n {\n h ^= h >> 33;\n h *= 0xff51afd7ed558ccd;\n h ^= h >> 33;\n h *= 0xc4ceb9fe1a85ec53;\n h ^= h >> 33;\n return h;\n }\n static constexpr uint32_t murmur_scramble(uint32_t h)\n {\n h ^= h >> 16;\n h *= 0x85ebca6b;\n h ^= h >> 13;\n h *= 0xc2b2ae35;\n h ^= h >> 16;\n return h;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file S2LoadBalancer.cpp\n\/\/\/ @brief The S2LoadBalancer evenly distributes the work load between\n\/\/\/ the threads in the computation of the special leaves.\n\/\/\/\n\/\/\/ Simply parallelizing the computation of the special leaves in the\n\/\/\/ Lagarias-Miller-Odlyzko and Deleglise-Rivat algorithms by\n\/\/\/ subdividing the sieve interval by the number of threads into\n\/\/\/ equally sized subintervals does not scale because the distribution\n\/\/\/ of the special leaves is highly skewed and most special leaves are\n\/\/\/ in the first few segments whereas later on there are very few\n\/\/\/ special leaves.\n\/\/\/\n\/\/\/ Based on the above observations it is clear that we need some kind\n\/\/\/ of load balancing in order to scale our parallel algorithm for\n\/\/\/ computing special leaves. Below are the ideas I used to develop a\n\/\/\/ load balancing algorithm that achieves a high load balance by\n\/\/\/ dynamically increasing or decreasing the interval size based on\n\/\/\/ the relative standard deviation of the thread run-times.\n\/\/\/\n\/\/\/ 1) Start with a tiny segment size of x^(1\/3) \/ (log x * log log x)\n\/\/\/ and one segment per thread. Our algorithm uses equally sized\n\/\/\/ intervals, for each thread the interval_size is\n\/\/\/ segment_size * segments_per_thread and the threads process\n\/\/\/ adjacent intervals i.e.\n\/\/\/ [base + interval_size * thread_id, base + interval_size * (thread_id + 1)].\n\/\/\/\n\/\/\/ 2) If the relative standard deviation of the thread run-times is\n\/\/\/ large then we know the special leaves are distributed unevenly,\n\/\/\/ else if the relative standard deviation is low the special\n\/\/\/ leaves are more evenly distributed.\n\/\/\/\n\/\/\/ 3) If the special leaves are distributed unevenly then we can\n\/\/\/ increase the load balance by decreasing the interval_size.\n\/\/\/ Contrary if the special leaves are more evenly distributed\n\/\/\/ we can increase the interval_size in order to improve the\n\/\/\/ algorithm's efficiency.\n\/\/\/\n\/\/\/ 4) We can't use a static threshold for as to when the relative\n\/\/\/ standard deviation is low or large as this threshold varies for\n\/\/\/ different PC architectures. So instead we compare the current\n\/\/\/ relative standard deviation to the previous one in order to\n\/\/\/ decide whether to increase or decrease the interval_size.\n\/\/\/\n\/\/\/ Copyright (C) 2016 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include <S2LoadBalancer.hpp>\n#include <primecount-internal.hpp>\n#include <aligned_vector.hpp>\n#include <pmath.hpp>\n#include <int128.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ndouble get_average(aligned_vector<double>& timings)\n{\n size_t n = timings.size();\n double sum = 0;\n\n for (size_t i = 0; i < n; i++)\n sum += timings[i];\n\n return sum \/ n;\n}\n\ndouble relative_standard_deviation(aligned_vector<double>& timings)\n{\n size_t n = timings.size();\n double average = get_average(timings);\n double sum = 0;\n\n if (average == 0)\n return 0;\n\n for (size_t i = 0; i < n; i++)\n {\n double mean = timings[i] - average;\n sum += mean * mean;\n }\n\n double std_dev = sqrt(sum \/ max(1.0, n - 1.0));\n double rsd = 100 * std_dev \/ average;\n\n return rsd;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nS2LoadBalancer::S2LoadBalancer(maxint_t x,\n int64_t y,\n int64_t z,\n int64_t threads) :\n x_((double) x),\n y_((double) y),\n z_((double) z),\n rsd_(40),\n avg_seconds_(0),\n count_(0),\n sqrtz_(isqrt(z))\n{\n init(x, y, threads);\n}\n\nS2LoadBalancer::S2LoadBalancer(maxint_t x,\n int64_t y,\n int64_t z,\n int64_t threads,\n double rsd) :\n x_((double) x),\n y_((double) y),\n z_((double) z),\n rsd_(rsd),\n avg_seconds_(0),\n count_(0),\n sqrtz_(isqrt(z))\n{\n init(x, y, threads);\n}\n\nvoid S2LoadBalancer::init(maxint_t x,\n int64_t y,\n int64_t threads)\n{\n \/\/ determined by benchmarking\n double log_threads = max(1.0, log((double) threads));\n decrease_dividend_ = max(0.5, log_threads \/ 3);\n\n min_seconds_ = 0.02 * log_threads;\n double divisor = log(log(x_)) * log(x_);\n update_min_size(divisor);\n\n double alpha = get_alpha(x, y);\n smallest_hard_leaf_ = (int64_t) (x \/ (y * sqrt(alpha) * iroot<6>(x)));\n}\n\ndouble S2LoadBalancer::get_rsd() const\n{\n return rsd_;\n}\n\nint64_t S2LoadBalancer::get_min_segment_size() const\n{\n return min_size_;\n}\n\nbool S2LoadBalancer::increase_size(double seconds,\n double decrease) const\n{\n return seconds < avg_seconds_ &&\n !decrease_size(seconds, decrease);\n}\n\nbool S2LoadBalancer::decrease_size(double seconds,\n double decrease) const\n{\n return seconds > min_seconds_ &&\n rsd_ > decrease;\n}\n\ndouble S2LoadBalancer::get_decrease_threshold(double seconds) const\n{\n double log_seconds = max(min_seconds_, log(seconds));\n double dont_decrease = min(decrease_dividend_ \/ (seconds * log_seconds), rsd_);\n return rsd_ + dont_decrease;\n}\n\nvoid S2LoadBalancer::update_avg_seconds(double seconds)\n{\n seconds = max(seconds, min_seconds_);\n double dividend = avg_seconds_ * count_ + seconds;\n avg_seconds_ = dividend \/ ++count_;\n}\n\nvoid S2LoadBalancer::update_min_size(double divisor)\n{\n int64_t size = (int64_t) (sqrtz_ \/ max(1.0, divisor));\n int64_t min_size = 1 << 9;\n min_size_ = max(size, min_size);\n min_size_ = next_power_of_2(min_size_);\n}\n\n\/\/\/ Balance the load in the computation of the special leaves\n\/\/\/ by dynamically adjusting the segment_size and segments_per_thread.\n\/\/\/ @param timings Timings of the threads.\n\/\/\/\nvoid S2LoadBalancer::update(int64_t low,\n int64_t threads,\n int64_t* segment_size,\n int64_t* segments_per_thread,\n aligned_vector<double>& timings)\n{\n double seconds = get_average(timings);\n update_avg_seconds(seconds);\n double decrease_threshold = get_decrease_threshold(seconds);\n rsd_ = max(0.1, relative_standard_deviation(timings));\n\n \/\/ 1 segment per thread\n if (*segment_size < sqrtz_)\n {\n if (increase_size(seconds, decrease_threshold))\n *segment_size <<= 1;\n else if (decrease_size(seconds, decrease_threshold))\n if (*segment_size > min_size_)\n *segment_size >>= 1;\n }\n \/\/ many segments per thread\n else if (low > smallest_hard_leaf_)\n update(segments_per_thread, decrease_threshold, seconds);\n\n int64_t thread_distance = *segment_size * *segments_per_thread;\n int64_t high = low + thread_distance * threads;\n\n \/\/ near smallest_hard_leaf_ the hard special leaves\n \/\/ are distributed unevenly so use min_size_\n if (low <= smallest_hard_leaf_ && \n high > smallest_hard_leaf_)\n {\n *segment_size = min_size_;\n thread_distance = *segment_size * *segments_per_thread;\n high = low + thread_distance * threads;\n }\n\n \/\/ slightly increase min_size_\n if (high >= smallest_hard_leaf_)\n {\n update_min_size(log(y_));\n *segment_size = max(min_size_, *segment_size);\n }\n}\n\n\/\/\/ Increase the number of segments per thread if the previous\n\/\/\/ thread run-times are close, otherwise decrease the\n\/\/\/ number of segments per thread.\n\/\/\/\nvoid S2LoadBalancer::update(int64_t* segments_per_thread,\n double decrease_threshold,\n double seconds)\n{\n double factor = decrease_threshold \/ rsd_;\n factor = in_between(0.5, factor, 2);\n double n = *segments_per_thread * factor;\n n = max(1.0, n);\n\n if ((n < *segments_per_thread && seconds > min_seconds_) ||\n (n > *segments_per_thread && seconds < avg_seconds_))\n {\n *segments_per_thread = (int64_t) n;\n }\n}\n\n} \/\/ namespace\n<commit_msg>Refactor<commit_after>\/\/\/\n\/\/\/ @file S2LoadBalancer.cpp\n\/\/\/ @brief The S2LoadBalancer evenly distributes the work load between\n\/\/\/ the threads in the computation of the special leaves.\n\/\/\/\n\/\/\/ Simply parallelizing the computation of the special leaves in the\n\/\/\/ Lagarias-Miller-Odlyzko and Deleglise-Rivat algorithms by\n\/\/\/ subdividing the sieve interval by the number of threads into\n\/\/\/ equally sized subintervals does not scale because the distribution\n\/\/\/ of the special leaves is highly skewed and most special leaves are\n\/\/\/ in the first few segments whereas later on there are very few\n\/\/\/ special leaves.\n\/\/\/\n\/\/\/ Based on the above observations it is clear that we need some kind\n\/\/\/ of load balancing in order to scale our parallel algorithm for\n\/\/\/ computing special leaves. Below are the ideas I used to develop a\n\/\/\/ load balancing algorithm that achieves a high load balance by\n\/\/\/ dynamically increasing or decreasing the interval size based on\n\/\/\/ the relative standard deviation of the thread run-times.\n\/\/\/\n\/\/\/ 1) Start with a tiny segment size of x^(1\/3) \/ (log x * log log x)\n\/\/\/ and one segment per thread. Our algorithm uses equally sized\n\/\/\/ intervals, for each thread the interval_size is\n\/\/\/ segment_size * segments_per_thread and the threads process\n\/\/\/ adjacent intervals i.e.\n\/\/\/ [base + interval_size * thread_id, base + interval_size * (thread_id + 1)].\n\/\/\/\n\/\/\/ 2) If the relative standard deviation of the thread run-times is\n\/\/\/ large then we know the special leaves are distributed unevenly,\n\/\/\/ else if the relative standard deviation is low the special\n\/\/\/ leaves are more evenly distributed.\n\/\/\/\n\/\/\/ 3) If the special leaves are distributed unevenly then we can\n\/\/\/ increase the load balance by decreasing the interval_size.\n\/\/\/ Contrary if the special leaves are more evenly distributed\n\/\/\/ we can increase the interval_size in order to improve the\n\/\/\/ algorithm's efficiency.\n\/\/\/\n\/\/\/ 4) We can't use a static threshold for as to when the relative\n\/\/\/ standard deviation is low or large as this threshold varies for\n\/\/\/ different PC architectures. So instead we compare the current\n\/\/\/ relative standard deviation to the previous one in order to\n\/\/\/ decide whether to increase or decrease the interval_size.\n\/\/\/\n\/\/\/ Copyright (C) 2016 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include <S2LoadBalancer.hpp>\n#include <primecount-internal.hpp>\n#include <aligned_vector.hpp>\n#include <pmath.hpp>\n#include <int128.hpp>\n\n#include <stdint.h>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\nusing namespace primecount;\n\nnamespace {\n\ndouble get_average(aligned_vector<double>& timings)\n{\n size_t n = timings.size();\n double sum = 0;\n\n for (size_t i = 0; i < n; i++)\n sum += timings[i];\n\n return sum \/ n;\n}\n\n\/\/\/ Relative standard deviation\ndouble rel_std_dev(aligned_vector<double>& timings)\n{\n size_t n = timings.size();\n double avg = get_average(timings);\n double sum = 0;\n\n if (avg == 0)\n return 0;\n\n for (size_t i = 0; i < n; i++)\n {\n double mean = timings[i] - avg;\n sum += mean * mean;\n }\n\n double std_dev = sqrt(sum \/ max(1.0, n - 1.0));\n double rsd = 100 * std_dev \/ avg;\n\n return rsd;\n}\n\n} \/\/ namespace\n\nnamespace primecount {\n\nS2LoadBalancer::S2LoadBalancer(maxint_t x,\n int64_t y,\n int64_t z,\n int64_t threads) :\n x_((double) x),\n y_((double) y),\n z_((double) z),\n rsd_(40),\n avg_seconds_(0),\n count_(0),\n sqrtz_(isqrt(z))\n{\n init(x, y, threads);\n}\n\nS2LoadBalancer::S2LoadBalancer(maxint_t x,\n int64_t y,\n int64_t z,\n int64_t threads,\n double rsd) :\n x_((double) x),\n y_((double) y),\n z_((double) z),\n rsd_(rsd),\n avg_seconds_(0),\n count_(0),\n sqrtz_(isqrt(z))\n{\n init(x, y, threads);\n}\n\nvoid S2LoadBalancer::init(maxint_t x,\n int64_t y,\n int64_t threads)\n{\n \/\/ determined by benchmarking\n double log_threads = max(1.0, log((double) threads));\n decrease_dividend_ = max(0.5, log_threads \/ 3);\n\n min_seconds_ = 0.02 * log_threads;\n double divisor = log(log(x_)) * log(x_);\n update_min_size(divisor);\n\n double alpha = get_alpha(x, y);\n smallest_hard_leaf_ = (int64_t) (x \/ (y * sqrt(alpha) * iroot<6>(x)));\n}\n\ndouble S2LoadBalancer::get_rsd() const\n{\n return rsd_;\n}\n\nint64_t S2LoadBalancer::get_min_segment_size() const\n{\n return min_size_;\n}\n\nbool S2LoadBalancer::increase_size(double seconds,\n double decrease) const\n{\n return seconds < avg_seconds_ &&\n !decrease_size(seconds, decrease);\n}\n\nbool S2LoadBalancer::decrease_size(double seconds,\n double decrease) const\n{\n return seconds > min_seconds_ &&\n rsd_ > decrease;\n}\n\ndouble S2LoadBalancer::get_decrease_threshold(double seconds) const\n{\n double log_seconds = max(min_seconds_, log(seconds));\n double dont_decrease = min(decrease_dividend_ \/ (seconds * log_seconds), rsd_);\n return rsd_ + dont_decrease;\n}\n\nvoid S2LoadBalancer::update_avg_seconds(double seconds)\n{\n seconds = max(seconds, min_seconds_);\n double dividend = avg_seconds_ * count_ + seconds;\n avg_seconds_ = dividend \/ ++count_;\n}\n\nvoid S2LoadBalancer::update_min_size(double divisor)\n{\n int64_t size = (int64_t) (sqrtz_ \/ max(1.0, divisor));\n int64_t min_size = 1 << 9;\n min_size_ = max(size, min_size);\n min_size_ = next_power_of_2(min_size_);\n}\n\n\/\/\/ Balance the load in the computation of the special leaves\n\/\/\/ by dynamically adjusting the segment_size and segments_per_thread.\n\/\/\/ @param timings Timings of the threads.\n\/\/\/\nvoid S2LoadBalancer::update(int64_t low,\n int64_t threads,\n int64_t* segment_size,\n int64_t* segments_per_thread,\n aligned_vector<double>& timings)\n{\n double seconds = get_average(timings);\n update_avg_seconds(seconds);\n double decrease_threshold = get_decrease_threshold(seconds);\n rsd_ = max(0.1, rel_std_dev(timings));\n\n \/\/ 1 segment per thread\n if (*segment_size < sqrtz_)\n {\n if (increase_size(seconds, decrease_threshold))\n *segment_size <<= 1;\n else if (decrease_size(seconds, decrease_threshold))\n if (*segment_size > min_size_)\n *segment_size >>= 1;\n }\n \/\/ many segments per thread\n else if (low > smallest_hard_leaf_)\n update(segments_per_thread, decrease_threshold, seconds);\n\n int64_t thread_distance = *segment_size * *segments_per_thread;\n int64_t high = low + thread_distance * threads;\n\n \/\/ near smallest_hard_leaf_ the hard special leaves\n \/\/ are distributed unevenly so use min_size_\n if (low <= smallest_hard_leaf_ && \n high > smallest_hard_leaf_)\n {\n *segment_size = min_size_;\n thread_distance = *segment_size * *segments_per_thread;\n high = low + thread_distance * threads;\n }\n\n \/\/ slightly increase min_size_\n if (high >= smallest_hard_leaf_)\n {\n update_min_size(log(y_));\n *segment_size = max(min_size_, *segment_size);\n }\n}\n\n\/\/\/ Increase the number of segments per thread if the previous\n\/\/\/ thread run-times are close, otherwise decrease the\n\/\/\/ number of segments per thread.\n\/\/\/\nvoid S2LoadBalancer::update(int64_t* segments_per_thread,\n double decrease_threshold,\n double seconds)\n{\n double factor = decrease_threshold \/ rsd_;\n factor = in_between(0.5, factor, 2);\n double n = *segments_per_thread * factor;\n n = max(1.0, n);\n\n if ((n < *segments_per_thread && seconds > min_seconds_) ||\n (n > *segments_per_thread && seconds < avg_seconds_))\n {\n *segments_per_thread = (int64_t) n;\n }\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of SpeakEasy.\n * Copyright (C) 2011-2012 Lambert Clara <lambert.clara@yahoo.fr>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * @file SE_CLogManager.cpp\n * @brief Logging class\n *\n * @author Lambert Clara <lambert.clara@yahoo.fr>\n * @date Created : 2011-08-21\n *\/\n\n#include \"SE_CLogManager.h\"\n\n#include \"SE_ConsoleColors.h\"\n\n#include <cassert>\n\n\/\/ define the static member\nSE_CLogManager *SE_CLogManager::ms_pInstance = nullptr;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSE_CLogManager::SE_CLogManager(std::ostream &inOutStream):\n m_outputStream(inOutStream),\n m_currentLogLevel(kNone)\n{\n (void)_pad;\n\n \/\/ because this class is meant to be used as singleton,\n \/\/ m_pInstance MUST be nullptr here\n assert(!ms_pInstance);\n\n \/\/ set the static instance to this\n ms_pInstance = this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSE_CLogManager::~SE_CLogManager()\n{\n ms_pInstance = nullptr;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool SE_CLogManager::startUp(const ELogLevel inLogLevel)\n{\n m_currentLogLevel = inLogLevel;\n seLogInfo(\"SE_CLogManager successfully started with logLevel set to \",\n static_cast<U32>(inLogLevel));\n m_initSuccess = true;\n return m_initSuccess;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool SE_CLogManager::shutDown()\n{\n seLogInfo(\"SE_CLogManager successfully shut downed\");\n return true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SE_CLogManager::logLevelToSStream(const ELogLevel inLevel,\n std::ostringstream &ioStringStream)\n{\n ioStringStream << COL_BEGIN;\n switch(inLevel)\n {\n case kNone: ioStringStream << WHITE << \" kNone \"; break;\n case kDebug: ioStringStream << BLUE << \" kDebug \"; break;\n case kInformation: ioStringStream << GREEN << \" kInformation \"; break;\n case kWarning: ioStringStream << YELLOW << \" kWarning \"; break;\n case kError: ioStringStream << RED << \" kError \"; break;\n default: ioStringStream << WHITE << \" Unknown ! \"; break;\n }\n ioStringStream << COL_END;\n}\n\n<commit_msg>Prevent clang to emit a warning.<commit_after>\/*\n * This file is part of SpeakEasy.\n * Copyright (C) 2011-2012 Lambert Clara <lambert.clara@yahoo.fr>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * @file SE_CLogManager.cpp\n * @brief Logging class\n *\n * @author Lambert Clara <lambert.clara@yahoo.fr>\n * @date Created : 2011-08-21\n *\/\n\n#include \"SE_CLogManager.h\"\n\n#include \"SE_ConsoleColors.h\"\n\n#include <cassert>\n\n\/\/ define the static member\nSE_CLogManager *SE_CLogManager::ms_pInstance = nullptr;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSE_CLogManager::SE_CLogManager(std::ostream &inOutStream):\n m_outputStream(inOutStream),\n m_currentLogLevel(kNone)\n{\n (void)_pad;\n\n \/\/ because this class is meant to be used as singleton,\n \/\/ m_pInstance MUST be nullptr here\n assert(!ms_pInstance);\n\n \/\/ set the static instance to this\n ms_pInstance = this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSE_CLogManager::~SE_CLogManager()\n{\n ms_pInstance = nullptr;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool SE_CLogManager::startUp(const ELogLevel inLogLevel)\n{\n m_currentLogLevel = inLogLevel;\n seLogInfo(\"SE_CLogManager successfully started with logLevel set to \",\n static_cast<U32>(inLogLevel));\n m_initSuccess = true;\n return m_initSuccess;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nbool SE_CLogManager::shutDown()\n{\n seLogInfo(\"SE_CLogManager successfully shut downed\");\n return true;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SE_CLogManager::logLevelToSStream(const ELogLevel inLevel,\n std::ostringstream &ioStringStream)\n{\n ioStringStream << COL_BEGIN;\n switch(inLevel)\n {\n case kNone: ioStringStream << WHITE << \" kNone \"; break;\n case kDebug: ioStringStream << BLUE << \" kDebug \"; break;\n case kInformation: ioStringStream << GREEN << \" kInformation \"; break;\n case kWarning: ioStringStream << YELLOW << \" kWarning \"; break;\n case kError: ioStringStream << RED << \" kError \"; break;\n#ifndef __clang__\n \/\/ prevent clang to emit a warning when all enum values are covered\n \/\/ but a default case is also present\n default: ioStringStream << WHITE << \" Unknown ! \"; break;\n#endif \/\/ ifndef __clang__\n }\n ioStringStream << COL_END;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"VirtualMachine.h\"\n\nVirtualMachine::VirtualMachine()\n{\n \/\/ctor\n stackSize = 0;\n}\n\nVirtualMachine::~VirtualMachine()\n{\n \/\/dtor\n}\n\nvoid VirtualMachine::interpret(unsigned char bytecode[], int byteSize)\n{\n for(int a = 0; a < byteSize; a++)\n {\n int currentInstruction = bytecode[a];\n switch(currentInstruction)\n {\n case Instruction::CONSOLE_OUT:\n {\n Type variable = pop();\n switch(variable.type)\n {\n case DataType::INT:\n std::cout << variable.intData;\n break;\n case DataType::CHAR:\n std::cout << variable.charData;\n break;\n case DataType::BOOL:\n std::cout << variable.boolData;\n break;\n case DataType::STRING:\n std::cout << *variable.stringData;\n break;\n default:\n throwError(std::string(\"Failed to CONSOLE_OUT, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n }\n }\n break;\n case Instruction::CREATE_INT:\n push_integer(bytecode[++a]);\n break;\n case Instruction::CREATE_CHAR:\n push_char(bytecode[++a]);\n break;\n case Instruction::CREATE_BOOL:\n push_bool(bytecode[++a]);\n break;\n case Instruction::CREATE_STRING:\n {\n unsigned int stringSize = bytecode[++a]; \/\/String length stored in next byte\n std::string *wholeString = new std::string; \/\/Allocate memory on heap for the string\n wholeString->resize(stringSize);\n for(unsigned int cChar = 0; cChar < stringSize; cChar++) \/\/Read in the string from the bytecode into the allocated memory\n (*wholeString)[cChar] = bytecode[++a];\n\n push_string(wholeString); \/\/Push the resulting char*\n break;\n }\n case Instruction::GOTO:\n a = static_cast<int>(bytecode[a+1])-1;\n break;\n case Instruction::CONSOLE_IN:\n {\n Type &variable = stack[bytecode[++a]];\n switch(variable.type)\n {\n case DataType::INT:\n std::cin >> variable.intData;\n break;\n case DataType::CHAR:\n std::cin >> variable.charData;\n break;\n case DataType::BOOL:\n std::cin >> variable.boolData;\n break;\n case DataType::STRING:\n std::getline(std::cin, *variable.stringData);\n break;\n default:\n throwError(std::string(\"Failed to CONSOLE_IN, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n }\n break;\n }\n case Instruction::MATH_ADD:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to add from bytecode\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and add to 'result'\n result += pop().intData;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_SUBTRACT:\n {\n \/\/TEMPORARY\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n std::vector<int> values;\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n values.emplace_back(pop().intData);\n result = values.back();\n values.pop_back();\n for(auto iter = values.rbegin(); iter != values.rend(); iter++)\n result -= *iter;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_MULTIPLY:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to multiply from bytecode\n int result = 1;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and multiply by result\n result *= pop().intData;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_DIVIDE:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to divide from bytecode\n int result = 1;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and divide\n result \/= pop().intData;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_MOD:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to add mod bytecode\n int result = 1;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and add to 'result'\n result %= pop().intData;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::CLONE_TOP:\n {\n push_type(stack[bytecode[++a]]); \/\/Clone a variable from a position in the stack to the top of the stack\n break;\n }\n\n\n default:\n throwError(\"Unknown instruction '\" + std::to_string(currentInstruction) + \"'\");\n }\n }\n}\n\nvoid VirtualMachine::push_integer(int value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_char(unsigned char value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_bool(bool value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_string(std::string* value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_type(Type value)\n{\n pushStackCheck();\n\n stack[stackSize++] = value;\n}\n\nType VirtualMachine::pop()\n{\n popStackCheck();\n\n return stack[--stackSize];\n}\n\nvoid VirtualMachine::popStackCheck()\n{\n if(stackSize == 0)\n {\n throwError(\"\\nCouldn't pop from stack, stack empty!\");\n }\n}\n\nvoid VirtualMachine::pushStackCheck()\n{\n if(stackSize == maxStackSize)\n {\n throwError(\"\\nCouldn't push to stack, stack full!\");\n }\n}\n\nvoid VirtualMachine::throwError(const std::string& reason)\n{\n throw std::string(reason);\n}\n<commit_msg>Fixed some more math<commit_after>#include \"VirtualMachine.h\"\n\nVirtualMachine::VirtualMachine()\n{\n \/\/ctor\n stackSize = 0;\n}\n\nVirtualMachine::~VirtualMachine()\n{\n \/\/dtor\n}\n\nvoid VirtualMachine::interpret(unsigned char bytecode[], int byteSize)\n{\n for(int a = 0; a < byteSize; a++)\n {\n int currentInstruction = bytecode[a];\n switch(currentInstruction)\n {\n case Instruction::CONSOLE_OUT:\n {\n Type variable = pop();\n switch(variable.type)\n {\n case DataType::INT:\n std::cout << variable.intData;\n break;\n case DataType::CHAR:\n std::cout << variable.charData;\n break;\n case DataType::BOOL:\n std::cout << variable.boolData;\n break;\n case DataType::STRING:\n std::cout << *variable.stringData;\n break;\n default:\n throwError(std::string(\"Failed to CONSOLE_OUT, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n }\n }\n break;\n case Instruction::CREATE_INT:\n push_integer(bytecode[++a]);\n break;\n case Instruction::CREATE_CHAR:\n push_char(bytecode[++a]);\n break;\n case Instruction::CREATE_BOOL:\n push_bool(bytecode[++a]);\n break;\n case Instruction::CREATE_STRING:\n {\n unsigned int stringSize = bytecode[++a]; \/\/String length stored in next byte\n std::string *wholeString = new std::string; \/\/Allocate memory on heap for the string\n wholeString->resize(stringSize);\n for(unsigned int cChar = 0; cChar < stringSize; cChar++) \/\/Read in the string from the bytecode into the allocated memory\n (*wholeString)[cChar] = bytecode[++a];\n\n push_string(wholeString); \/\/Push the resulting char*\n break;\n }\n case Instruction::GOTO:\n a = static_cast<int>(bytecode[a+1])-1;\n break;\n case Instruction::CONSOLE_IN:\n {\n Type &variable = stack[bytecode[++a]];\n switch(variable.type)\n {\n case DataType::INT:\n std::cin >> variable.intData;\n break;\n case DataType::CHAR:\n std::cin >> variable.charData;\n break;\n case DataType::BOOL:\n std::cin >> variable.boolData;\n break;\n case DataType::STRING:\n std::getline(std::cin, *variable.stringData);\n break;\n default:\n throwError(std::string(\"Failed to CONSOLE_IN, Unknown data type '\" + std::to_string(variable.type) + \"'\"));\n }\n break;\n }\n case Instruction::MATH_ADD:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to add from bytecode\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and add to 'result'\n result += pop().intData;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_SUBTRACT:\n {\n \/\/TEMPORARY\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n std::vector<int> values;\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n values.emplace_back(pop().intData);\n result = values.back();\n values.pop_back();\n for(auto iter = values.rbegin(); iter != values.rend(); iter++)\n result -= *iter;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_MULTIPLY:\n {\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n std::vector<int> values;\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n values.emplace_back(pop().intData);\n result = values.back();\n values.pop_back();\n for(auto iter = values.rbegin(); iter != values.rend(); iter++)\n result *= *iter;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_DIVIDE:\n {\n \/\/TEMPORARY\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n std::vector<int> values;\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n values.emplace_back(pop().intData);\n result = values.back();\n values.pop_back();\n for(auto iter = values.rbegin(); iter != values.rend(); iter++)\n result \/= *iter;\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::MATH_MOD:\n {\n \/\/TEMPORARY\n unsigned int numberCount = bytecode[++a]; \/\/Get number of bytes to subtract from bytecode\n std::vector<int> values;\n int result = 0;\n for(unsigned int a = 0; a < numberCount; a++) \/\/For the number of arguments specified, pop them all off the stack and subtract from 'result'\n values.emplace_back(pop().intData);\n result = values.back();\n values.pop_back();\n for(auto iter = values.rbegin(); iter != values.rend(); iter++)\n {\n result %= *iter;\n }\n push_integer(result); \/\/Push the result to the stack\n break;\n }\n case Instruction::CLONE_TOP:\n {\n push_type(stack[bytecode[++a]]); \/\/Clone a variable from a position in the stack to the top of the stack\n break;\n }\n\n\n default:\n throwError(\"Unknown instruction '\" + std::to_string(currentInstruction) + \"'\");\n }\n }\n}\n\nvoid VirtualMachine::push_integer(int value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_char(unsigned char value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_bool(bool value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_string(std::string* value)\n{\n pushStackCheck();\n\n stack[stackSize++] = Type(value);\n}\n\nvoid VirtualMachine::push_type(Type value)\n{\n pushStackCheck();\n\n stack[stackSize++] = value;\n}\n\nType VirtualMachine::pop()\n{\n popStackCheck();\n\n return stack[--stackSize];\n}\n\nvoid VirtualMachine::popStackCheck()\n{\n if(stackSize == 0)\n {\n throwError(\"\\nCouldn't pop from stack, stack empty!\");\n }\n}\n\nvoid VirtualMachine::pushStackCheck()\n{\n if(stackSize == maxStackSize)\n {\n throwError(\"\\nCouldn't push to stack, stack full!\");\n }\n}\n\nvoid VirtualMachine::throwError(const std::string& reason)\n{\n throw std::string(reason);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ofdpa_bridge.hpp\"\n\n#include \"roflibs\/netlink\/clogging.hpp\"\n\n#include <cassert>\n#include <map>\n#include <cstring>\n\n#include <rofl\/common\/openflow\/cofport.h>\n\nnamespace basebox {\n\nofdpa_bridge::ofdpa_bridge(rofl::rofl_ofdpa_fm_driver &fm_driver)\n : ingress_vlan_filtered(true), egress_vlan_filtered(false),\n fm_driver(fm_driver) {}\n\nofdpa_bridge::~ofdpa_bridge() {}\n\nvoid ofdpa_bridge::set_bridge_interface(const rofcore::crtlink &rtl) {\n if (AF_BRIDGE != rtl.get_family() || 0 != rtl.get_master()) {\n rofcore::logging::error << __PRETTY_FUNCTION__\n << \" not a bridge master: \" << rtl << std::endl;\n return;\n }\n\n this->bridge = rtl;\n fm_driver.enable_policy_arp(1, 1);\n}\n\nstatic int find_next_bit(int i, uint32_t x) {\n int j;\n\n if (i >= 32)\n return -1;\n\n \/* find first bit *\/\n if (i < 0)\n return __builtin_ffs(x);\n\n \/* mask off prior finds to get next *\/\n j = __builtin_ffs(x >> i);\n return j ? j + i : 0;\n}\n\nvoid ofdpa_bridge::add_interface(const rofcore::crtlink &rtl) {\n\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot attach interface without bridge: \" << rtl\n << std::endl;\n return;\n }\n if (AF_BRIDGE != rtl.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a bridge interface \" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != rtl.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a slave of this bridge interface \" << std::endl;\n return;\n }\n\n if (not ingress_vlan_filtered) {\n \/\/ ingress\n fm_driver.enable_port_vid_allow_all(rtl.get_devname());\n }\n\n if (not egress_vlan_filtered) {\n \/\/ egress\n uint32_t group = fm_driver.enable_port_unfiltered_egress(rtl.get_devname());\n l2_domain[0].push_back(group);\n }\n\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n const struct rtnl_link_bridge_vlan *br_vlan = rtl.get_br_vlan();\n\n for (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n int base_bit;\n uint32_t a = br_vlan->vlan_bitmap[k];\n\n base_bit = k * 32;\n int i = -1;\n int done = 0;\n while (!done) {\n int j = find_next_bit(i, a);\n if (j > 0) {\n int vid = j - 1 + base_bit;\n bool egress_untagged = false;\n\n \/\/ check if egress is untagged\n if (br_vlan->untagged_bitmap[k] & 1 << (j - 1)) {\n egress_untagged = true;\n }\n\n if (egress_vlan_filtered) {\n uint32_t group = fm_driver.enable_port_vid_egress(\n rtl.get_devname(), vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to set vid on egress \" << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].push_back(group);\n }\n\n if (ingress_vlan_filtered) {\n if (br_vlan->pvid == vid) {\n fm_driver.enable_port_pvid_ingress(rtl.get_devname(), vid);\n } else {\n fm_driver.enable_port_vid_ingress(rtl.get_devname(), vid);\n }\n }\n\n \/\/ \/\/ todo check if vid is okay as an id as well\n \/\/ group = fm_driver.enable_group_l2_multicast(vid, vid,\n \/\/ l2_domain[vid],\n \/\/ 1 !=\n \/\/ l2_domain[vid].size());\n \/\/\n \/\/ if (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n \/\/ fm_driver.enable_policy_arp(vid, group);\n \/\/ }\n\n i = j;\n } else {\n done = 1;\n }\n }\n }\n}\n\nvoid ofdpa_bridge::update_vlans(const std::string &devname,\n const rtnl_link_bridge_vlan *old_br_vlan,\n const rtnl_link_bridge_vlan *new_br_vlan) {\n using rofcore::logging;\n for (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n int base_bit;\n uint32_t a = old_br_vlan->vlan_bitmap[k];\n uint32_t b = new_br_vlan->vlan_bitmap[k];\n\n uint32_t c = old_br_vlan->untagged_bitmap[k];\n uint32_t d = new_br_vlan->untagged_bitmap[k];\n\n uint32_t vlan_diff = a ^ b;\n uint32_t untagged_diff = c ^ d;\n\n base_bit = k * 32;\n int i = -1;\n int done = 0;\n while (!done) {\n int j = find_next_bit(i, vlan_diff);\n if (j > 0) {\n \/\/ vlan added or removed\n int vid = j - 1 + base_bit;\n bool egress_untagged = false;\n\n \/\/ check if egress is untagged\n if (new_br_vlan->untagged_bitmap[k] & 1 << (j - 1)) {\n egress_untagged = true;\n\n \/\/ clear untagged_diff bit\n untagged_diff &= ~((uint32_t)1 << (j - 1));\n }\n\n if (new_br_vlan->vlan_bitmap[k] & 1 << (j - 1)) {\n \/\/ vlan added\n\n if (egress_vlan_filtered) {\n try {\n uint32_t group = fm_driver.enable_port_vid_egress(\n devname, vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to set vid on egress \" << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].push_back(group);\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error1:\" << e.what() << std::endl;\n }\n }\n\n if (ingress_vlan_filtered) {\n try {\n if (new_br_vlan->pvid == vid) {\n \/\/ todo check for existing pvid?\n fm_driver.enable_port_pvid_ingress(devname, vid);\n } else {\n fm_driver.enable_port_vid_ingress(devname, vid);\n }\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error2:\" << e.what() << std::endl;\n }\n }\n\n \/\/ todo check if vid is okay as an id as well\n \/\/ group = fm_driver.enable_group_l2_multicast(vid, vid,\n \/\/ l2_domain[vid],\n \/\/ 1 !=\n \/\/ l2_domain[vid].size());\n \/\/ \/\/ enable arp flooding as well\n \/\/ #if DISABLED_TO_TEST\n \/\/ if (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n \/\/ fm_driver.enable_policy_arp(vid, group);\n \/\/ }\n \/\/ #endif\n\n } else {\n \/\/ vlan removed\n\n if (ingress_vlan_filtered) {\n try {\n if (old_br_vlan->pvid == vid) {\n fm_driver.disable_port_pvid_ingress(devname, vid);\n } else {\n fm_driver.disable_port_vid_ingress(devname, vid);\n }\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error3:\" << e.what() << std::endl;\n }\n }\n\n if (egress_vlan_filtered) {\n try {\n uint32_t group = fm_driver.disable_port_vid_egress(\n devname, vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to remove vid on egress \" << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].remove(group);\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error4:\" << e.what() << std::endl;\n }\n }\n }\n\n i = j;\n } else {\n done = 1;\n }\n }\n\n#if 0 \/\/ not yet implemented the update\n\t\tdone = 0;\n\t\ti = -1;\n\t\twhile (!done) {\n\t\t\t\/\/ vlan is existing, but swapping egress tagged\/untagged\n\t\t\tint j = find_next_bit(i, untagged_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ egress untagged changed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\t\/\/ XXX implement update\n\t\t\t\tfm_driver.update_port_vid_egress(devname, vid, egress_untagged);\n\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n#endif\n }\n}\n\nvoid ofdpa_bridge::update_interface(const rofcore::crtlink &oldlink,\n const rofcore::crtlink &newlink) {\n using rofcore::crtlink;\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot update interface without bridge\" << std::endl;\n return;\n }\n if (AF_BRIDGE != newlink.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a bridge interface\" << std::endl;\n return;\n }\n \/\/ if (AF_BRIDGE != oldlink.get_family()) {\n \/\/ logging::error << __PRETTY_FUNCTION__ << oldlink << \" is\n \/\/ not a bridge interface\" << std::endl;\n \/\/ return;\n \/\/ }\n if (bridge.get_ifindex() != newlink.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a slave of this bridge interface\" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != oldlink.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a slave of this bridge interface\" << std::endl;\n return;\n }\n\n if (newlink.get_devname().compare(oldlink.get_devname())) {\n logging::info << __PRETTY_FUNCTION__\n << \" interface rename currently ignored \" << std::endl;\n \/\/ FIXME this has to be handled differently\n return;\n }\n\n \/\/ handle VLANs\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n if (not crtlink::are_br_vlan_equal(newlink.get_br_vlan(),\n oldlink.get_br_vlan())) {\n \/\/ vlan updated\n update_vlans(oldlink.get_devname(), oldlink.get_br_vlan(),\n newlink.get_br_vlan());\n }\n}\n\nvoid ofdpa_bridge::delete_interface(const rofcore::crtlink &rtl) {\n using rofcore::crtlink;\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot attach interface without bridge: \" << rtl\n << std::endl;\n return;\n }\n if (AF_BRIDGE != rtl.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a bridge interface \" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != rtl.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a slave of this bridge interface \" << std::endl;\n return;\n }\n\n if (not ingress_vlan_filtered) {\n \/\/ ingress\n fm_driver.disable_port_vid_allow_all(rtl.get_devname());\n }\n\n if (not egress_vlan_filtered) {\n \/\/ egress\n uint32_t group =\n fm_driver.disable_port_unfiltered_egress(rtl.get_devname());\n l2_domain[0].remove(group);\n }\n\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n const struct rtnl_link_bridge_vlan *br_vlan = rtl.get_br_vlan();\n struct rtnl_link_bridge_vlan br_vlan_empty;\n memset(&br_vlan_empty, 0, sizeof(struct rtnl_link_bridge_vlan));\n\n if (not crtlink::are_br_vlan_equal(br_vlan, &br_vlan_empty)) {\n \/\/ vlan updated\n update_vlans(rtl.get_devname(), br_vlan, &br_vlan_empty);\n }\n}\n\nvoid ofdpa_bridge::add_mac_to_fdb(const uint32_t of_port_no,\n const uint16_t vlan,\n const rofl::cmacaddr &mac, bool permanent) {\n fm_driver.add_bridging_unicast_vlan(mac, vlan, of_port_no, permanent,\n egress_vlan_filtered);\n}\n\nvoid ofdpa_bridge::remove_mac_from_fdb(const uint32_t of_port_no, uint16_t vid,\n const rofl::cmacaddr &mac) {\n fm_driver.remove_bridging_unicast_vlan(mac, vid, of_port_no);\n}\n\n} \/* namespace basebox *\/\n<commit_msg>indentation\/cleanup<commit_after>#include \"ofdpa_bridge.hpp\"\n\n#include \"roflibs\/netlink\/clogging.hpp\"\n\n#include <cassert>\n#include <map>\n#include <cstring>\n\n#include <rofl\/common\/openflow\/cofport.h>\n\nnamespace basebox {\n\nofdpa_bridge::ofdpa_bridge(rofl::rofl_ofdpa_fm_driver &fm_driver)\n : ingress_vlan_filtered(true), egress_vlan_filtered(false),\n fm_driver(fm_driver) {}\n\nofdpa_bridge::~ofdpa_bridge() {}\n\nvoid ofdpa_bridge::set_bridge_interface(const rofcore::crtlink &rtl) {\n if (AF_BRIDGE != rtl.get_family() || 0 != rtl.get_master()) {\n rofcore::logging::error << __PRETTY_FUNCTION__\n << \" not a bridge master: \" << rtl << std::endl;\n return;\n }\n\n this->bridge = rtl;\n fm_driver.enable_policy_arp(1, 1);\n}\n\nstatic int find_next_bit(int i, uint32_t x) {\n int j;\n\n if (i >= 32)\n return -1;\n\n \/* find first bit *\/\n if (i < 0)\n return __builtin_ffs(x);\n\n \/* mask off prior finds to get next *\/\n j = __builtin_ffs(x >> i);\n return j ? j + i : 0;\n}\n\nvoid ofdpa_bridge::add_interface(const rofcore::crtlink &rtl) {\n\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot attach interface without bridge: \" << rtl\n << std::endl;\n return;\n }\n if (AF_BRIDGE != rtl.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a bridge interface \" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != rtl.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a slave of this bridge interface \" << std::endl;\n return;\n }\n\n if (not ingress_vlan_filtered) {\n \/\/ ingress\n fm_driver.enable_port_vid_allow_all(rtl.get_devname());\n }\n\n if (not egress_vlan_filtered) {\n \/\/ egress\n uint32_t group = fm_driver.enable_port_unfiltered_egress(rtl.get_devname());\n l2_domain[0].push_back(group);\n }\n\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n const struct rtnl_link_bridge_vlan *br_vlan = rtl.get_br_vlan();\n\n for (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n int base_bit;\n uint32_t a = br_vlan->vlan_bitmap[k];\n\n base_bit = k * 32;\n int i = -1;\n int done = 0;\n while (!done) {\n int j = find_next_bit(i, a);\n if (j > 0) {\n int vid = j - 1 + base_bit;\n bool egress_untagged = false;\n\n \/\/ check if egress is untagged\n if (br_vlan->untagged_bitmap[k] & 1 << (j - 1)) {\n egress_untagged = true;\n }\n\n if (egress_vlan_filtered) {\n uint32_t group = fm_driver.enable_port_vid_egress(\n rtl.get_devname(), vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to set vid on egress \" << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].push_back(group);\n }\n\n if (ingress_vlan_filtered) {\n if (br_vlan->pvid == vid) {\n fm_driver.enable_port_pvid_ingress(rtl.get_devname(), vid);\n } else {\n fm_driver.enable_port_vid_ingress(rtl.get_devname(), vid);\n }\n }\n\n \/\/ \/\/ todo check if vid is okay as an id as well\n \/\/ group = fm_driver.enable_group_l2_multicast(vid, vid,\n \/\/ l2_domain[vid],\n \/\/ 1 !=\n \/\/ l2_domain[vid].size());\n \/\/\n \/\/ if (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n \/\/ fm_driver.enable_policy_arp(vid, group);\n \/\/ }\n\n i = j;\n } else {\n done = 1;\n }\n }\n }\n}\n\nvoid ofdpa_bridge::update_vlans(const std::string &devname,\n const rtnl_link_bridge_vlan *old_br_vlan,\n const rtnl_link_bridge_vlan *new_br_vlan) {\n using rofcore::logging;\n for (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n int base_bit;\n uint32_t a = old_br_vlan->vlan_bitmap[k];\n uint32_t b = new_br_vlan->vlan_bitmap[k];\n\n uint32_t c = old_br_vlan->untagged_bitmap[k];\n uint32_t d = new_br_vlan->untagged_bitmap[k];\n\n uint32_t vlan_diff = a ^ b;\n uint32_t untagged_diff = c ^ d;\n\n base_bit = k * 32;\n int i = -1;\n int done = 0;\n while (!done) {\n int j = find_next_bit(i, vlan_diff);\n if (j > 0) {\n \/\/ vlan added or removed\n int vid = j - 1 + base_bit;\n bool egress_untagged = false;\n\n \/\/ check if egress is untagged\n if (new_br_vlan->untagged_bitmap[k] & 1 << (j - 1)) {\n egress_untagged = true;\n\n \/\/ clear untagged_diff bit\n untagged_diff &= ~((uint32_t)1 << (j - 1));\n }\n\n if (new_br_vlan->vlan_bitmap[k] & 1 << (j - 1)) {\n \/\/ vlan added\n\n if (egress_vlan_filtered) {\n try {\n uint32_t group = fm_driver.enable_port_vid_egress(\n devname, vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to set vid on egress\" << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].push_back(group);\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error1:\" << e.what() << std::endl;\n }\n }\n\n if (ingress_vlan_filtered) {\n try {\n if (new_br_vlan->pvid == vid) {\n \/\/ todo check for existing pvid?\n fm_driver.enable_port_pvid_ingress(devname, vid);\n } else {\n fm_driver.enable_port_vid_ingress(devname, vid);\n }\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error2:\" << e.what() << std::endl;\n }\n }\n\n \/\/ todo check if vid is okay as an id as well\n \/\/ group = fm_driver.enable_group_l2_multicast(vid, vid,\n \/\/ l2_domain[vid],\n \/\/ 1 !=\n \/\/ l2_domain[vid].size());\n \/\/ \/\/ enable arp flooding as well\n \/\/ #if DISABLED_TO_TEST\n \/\/ if (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n \/\/ fm_driver.enable_policy_arp(vid, group);\n \/\/ }\n \/\/ #endif\n\n } else {\n \/\/ vlan removed\n\n if (ingress_vlan_filtered) {\n try {\n if (old_br_vlan->pvid == vid) {\n fm_driver.disable_port_pvid_ingress(devname, vid);\n } else {\n fm_driver.disable_port_vid_ingress(devname, vid);\n }\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error3:\" << e.what() << std::endl;\n }\n }\n\n if (egress_vlan_filtered) {\n try {\n \/\/ XXX delete all FM pointing to this group first\n uint32_t group = fm_driver.disable_port_vid_egress(\n devname, vid, egress_untagged);\n assert(group && \"invalid group identifier\");\n if (rofl::openflow::OFPG_MAX == group) {\n logging::error << __PRETTY_FUNCTION__\n << \" failed to remove vid on egress\"\n << std::endl;\n i = j;\n continue;\n }\n l2_domain[vid].remove(group);\n } catch (std::exception &e) {\n logging::error << __PRETTY_FUNCTION__\n << \" caught error4:\" << e.what() << std::endl;\n }\n }\n }\n\n i = j;\n } else {\n done = 1;\n }\n }\n\n#if 0 \/\/ not yet implemented the update\n\t\tdone = 0;\n\t\ti = -1;\n\t\twhile (!done) {\n\t\t\t\/\/ vlan is existing, but swapping egress tagged\/untagged\n\t\t\tint j = find_next_bit(i, untagged_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ egress untagged changed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\t\/\/ XXX implement update\n\t\t\t\tfm_driver.update_port_vid_egress(devname, vid, egress_untagged);\n\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n#endif\n }\n}\n\nvoid ofdpa_bridge::update_interface(const rofcore::crtlink &oldlink,\n const rofcore::crtlink &newlink) {\n using rofcore::crtlink;\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot update interface without bridge\" << std::endl;\n return;\n }\n if (AF_BRIDGE != newlink.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a bridge interface\" << std::endl;\n return;\n }\n \/\/ if (AF_BRIDGE != oldlink.get_family()) {\n \/\/ logging::error << __PRETTY_FUNCTION__ << oldlink << \" is\n \/\/ not a bridge interface\" << std::endl;\n \/\/ return;\n \/\/ }\n if (bridge.get_ifindex() != newlink.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a slave of this bridge interface\" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != oldlink.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << newlink\n << \" is not a slave of this bridge interface\" << std::endl;\n return;\n }\n\n if (newlink.get_devname().compare(oldlink.get_devname())) {\n logging::info << __PRETTY_FUNCTION__\n << \" interface rename currently ignored \" << std::endl;\n \/\/ FIXME this has to be handled differently\n return;\n }\n\n \/\/ handle VLANs\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n if (not crtlink::are_br_vlan_equal(newlink.get_br_vlan(),\n oldlink.get_br_vlan())) {\n \/\/ vlan updated\n update_vlans(oldlink.get_devname(), oldlink.get_br_vlan(),\n newlink.get_br_vlan());\n }\n}\n\nvoid ofdpa_bridge::delete_interface(const rofcore::crtlink &rtl) {\n using rofcore::crtlink;\n using rofcore::logging;\n\n \/\/ sanity checks\n if (0 == bridge.get_ifindex()) {\n logging::error << __PRETTY_FUNCTION__\n << \" cannot attach interface without bridge: \" << rtl\n << std::endl;\n return;\n }\n if (AF_BRIDGE != rtl.get_family()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a bridge interface \" << std::endl;\n return;\n }\n if (bridge.get_ifindex() != rtl.get_master()) {\n logging::error << __PRETTY_FUNCTION__ << rtl\n << \" is not a slave of this bridge interface \" << std::endl;\n return;\n }\n\n if (not ingress_vlan_filtered) {\n \/\/ ingress\n fm_driver.disable_port_vid_allow_all(rtl.get_devname());\n }\n\n if (not egress_vlan_filtered) {\n \/\/ egress\n uint32_t group =\n fm_driver.disable_port_unfiltered_egress(rtl.get_devname());\n l2_domain[0].remove(group);\n }\n\n if (not ingress_vlan_filtered && not egress_vlan_filtered) {\n return;\n }\n\n const struct rtnl_link_bridge_vlan *br_vlan = rtl.get_br_vlan();\n struct rtnl_link_bridge_vlan br_vlan_empty;\n memset(&br_vlan_empty, 0, sizeof(struct rtnl_link_bridge_vlan));\n\n if (not crtlink::are_br_vlan_equal(br_vlan, &br_vlan_empty)) {\n \/\/ vlan updated\n update_vlans(rtl.get_devname(), br_vlan, &br_vlan_empty);\n }\n}\n\nvoid ofdpa_bridge::add_mac_to_fdb(const uint32_t of_port_no,\n const uint16_t vlan,\n const rofl::cmacaddr &mac, bool permanent) {\n fm_driver.add_bridging_unicast_vlan(mac, vlan, of_port_no, permanent,\n egress_vlan_filtered);\n}\n\nvoid ofdpa_bridge::remove_mac_from_fdb(const uint32_t of_port_no, uint16_t vid,\n const rofl::cmacaddr &mac) {\n fm_driver.remove_bridging_unicast_vlan(mac, vid, of_port_no);\n}\n\n} \/* namespace basebox *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"ofdpa_bridge.hpp\"\n\n#include \"roflibs\/netlink\/clogging.hpp\"\n\n#include <cassert>\n#include <map>\n\n#include <rofl\/common\/openflow\/cofport.h>\n\n\nnamespace basebox {\n\nofdpa_bridge::ofdpa_bridge(rofl::rofl_ofdpa_fm_driver &fm_driver) :\n\t\tfm_driver(fm_driver)\n{\n}\n\nofdpa_bridge::~ofdpa_bridge()\n{\n}\n\nvoid\nofdpa_bridge::set_bridge_interface(const rofcore::crtlink& rtl)\n{\n\tif (AF_BRIDGE != rtl.get_family() || 0 != rtl.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" not a bridge master: \" << rtl << std::endl;\n\t\treturn;\n\t}\n\n\tthis->bridge = rtl;\n}\n\nstatic int find_next_bit(int i, uint32_t x)\n{\n\tint j;\n\n\tif (i >= 32)\n\t\treturn -1;\n\n\t\/* find first bit *\/\n\tif (i < 0)\n\t\treturn __builtin_ffs(x);\n\n\t\/* mask off prior finds to get next *\/\n\tj = __builtin_ffs(x >> i);\n\treturn j ? j + i : 0;\n}\n\nvoid\nofdpa_bridge::add_interface(const rofcore::crtlink& rtl)\n{\n\t\/\/ sanity checks\n\tif (0 == bridge.get_ifindex()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" cannot attach interface without bridge: \" << rtl << std::endl;\n\t\treturn;\n\t}\n\tif (AF_BRIDGE != rtl.get_family()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << rtl << \" is not a bridge interface \" << std::endl;\n\t\treturn;\n\t}\n\tif (bridge.get_ifindex() != rtl.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << rtl << \" is not a slave of this bridge interface \" << std::endl;\n\t\treturn;\n\t}\n\n\tconst struct rtnl_link_bridge_vlan* br_vlan = rtl.get_br_vlan();\n\n\tfor (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n\t\tint base_bit;\n\t\tuint32_t a = br_vlan->vlan_bitmap[k];\n\n\t\tbase_bit = k * 32;\n\t\tint i = -1;\n\t\tint done = 0;\n\t\twhile (!done) {\n\t\t\tint j = find_next_bit(i, a);\n\t\t\tif (j > 0) {\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\tuint32_t group = fm_driver.enable_port_vid_egress(rtl.get_devname(), vid, egress_untagged);\n\t\t\t\tassert(group && \"invalid group identifier\");\n\t\t\t\tif (rofl::openflow::OFPG_MAX == group) {\n\t\t\t\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" failed to set vid on egress \" << std::endl;\n\t\t\t\t\ti = j;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tl2_domain[vid].push_back(group);\n\n\t\t\t\tif (br_vlan->pvid == vid) {\n\t\t\t\t\tfm_driver.enable_port_pvid_ingress(rtl.get_devname(), vid);\n\t\t\t\t} else {\n\t\t\t\t\tfm_driver.enable_port_vid_ingress(rtl.get_devname(), vid);\n\t\t\t\t}\n\n\t\t\t\t\/\/ todo check if vid is okay as an id as well\n\t\t\t\tgroup = fm_driver.enable_group_l2_multicast(vid, vid, l2_domain[vid], 1 != l2_domain[vid].size());\n\t\t\t\t\/\/ enable arp flooding as well\n\n\t\t\t\tif (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n\t\t\t\t\tfm_driver.enable_policy_arp(vid, group);\n\t\t\t\t}\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid\nofdpa_bridge::update_vlans(const std::string &devname,\n\t\t\tconst rtnl_link_bridge_vlan *old_br_vlan,\n\t\t\tconst rtnl_link_bridge_vlan *new_br_vlan)\n{\n\tfor (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n\t\tint base_bit;\n\t\tuint32_t a = old_br_vlan->vlan_bitmap[k];\n\t\tuint32_t b = new_br_vlan->vlan_bitmap[k];\n\n\t\tuint32_t c = old_br_vlan->untagged_bitmap[k];\n\t\tuint32_t d = new_br_vlan->untagged_bitmap[k];\n\n\t\tuint32_t vlan_diff = a ^ b;\n\t\tuint32_t untagged_diff = c ^ d;\n\n\t\tbase_bit = k * 32;\n\t\tint i = -1;\n\t\tint done = 0;\n\t\twhile (!done) {\n\t\t\tint j = find_next_bit(i, vlan_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ vlan added or removed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\n\t\t\t\t\t\/\/ clear untagged_diff bit\n\t\t\t\t\tuntagged_diff &= ~((uint32_t)1 << (j-1));\n\t\t\t\t}\n\n\t\t\t\tif (new_br_vlan->vlan_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\t\/\/ vlan added\n\n\t\t\t\t\tuint32_t group = fm_driver.enable_port_vid_egress(devname, vid, egress_untagged);\n\t\t\t\t\tassert(group && \"invalid group identifier\");\n\t\t\t\t\tif (rofl::openflow::OFPG_MAX == group) {\n\t\t\t\t\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" failed to set vid on egress \" << std::endl;\n\t\t\t\t\t\ti = j;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tl2_domain[vid].push_back(group);\n\n\t\t\t\t\tif (new_br_vlan->pvid == vid) {\n\t\t\t\t\t\t\/\/ todo check for existing pvid?\n\t\t\t\t\t\tfm_driver.enable_port_pvid_ingress(devname, vid);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfm_driver.enable_port_vid_ingress(devname, vid);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ todo check if vid is okay as an id as well\n\t\t\t\t\tgroup = fm_driver.enable_group_l2_multicast(vid, vid, l2_domain[vid], 1 != l2_domain[vid].size());\n\t\t\t\t\t\/\/ enable arp flooding as well\n#if DISABLED_TO_TEST\n\t\t\t\t\tif (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n\t\t\t\t\t\tfm_driver.enable_policy_arp(vid, group);\n\t\t\t\t\t}\n#endif\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ vlan removed\n\t\t\t\t}\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n\n#if 0 \/\/ not yet implemented the update\n\t\tdone = 0;\n\t\ti = -1;\n\t\twhile (!done) {\n\t\t\t\/\/ vlan is existing, but swapping egress tagged\/untagged\n\t\t\tint j = find_next_bit(i, untagged_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ egress untagged changed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\t\/\/ xxx implement update\n\t\t\t\tfm_driver.update_port_vid_egress(devname, vid, egress_untagged);\n\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n#endif\n\t}\n}\n\nvoid\nofdpa_bridge::update_interface(const rofcore::crtlink& oldlink, const rofcore::crtlink& newlink)\n{\n\tusing rofcore::crtlink;\n\n\t\/\/ sanity checks\n\tif (0 == bridge.get_ifindex()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" cannot update interface without bridge\" << std::endl;\n\t\treturn;\n\t}\n\tif (AF_BRIDGE != newlink.get_family()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\/\/\tif (AF_BRIDGE != oldlink.get_family()) {\n\/\/\t\trofcore::logging::error << __PRETTY_FUNCTION__ << oldlink << \" is not a bridge interface\" << std::endl;\n\/\/\t\treturn;\n\/\/\t}\n\tif (bridge.get_ifindex() != newlink.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a slave of this bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\tif (bridge.get_ifindex() != oldlink.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a slave of this bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\n\tif (newlink.get_devname().compare(oldlink.get_devname())) {\n\t\trofcore::logging::info << __PRETTY_FUNCTION__ << \" interface rename currently ignored \" << std::endl;\n\t\t\/\/ FIXME this has to be handled differently\n\t\treturn;\n\t}\n\n\tif (not crtlink::are_br_vlan_equal(newlink.get_br_vlan(), oldlink.get_br_vlan())) {\n\t\t\/\/ vlan updated\n\t\tupdate_vlans(oldlink.get_devname(), oldlink.get_br_vlan(), newlink.get_br_vlan());\n\t}\n\n}\n\nvoid\nofdpa_bridge::delete_interface(const rofcore::crtlink& rtl)\n{\n\t\/\/ fixme update L2 Multicast Group\n}\n\n\nvoid\nofdpa_bridge::add_mac_to_fdb(const uint32_t of_port_no, const uint16_t vlan, const rofl::cmacaddr &mac, bool permanent)\n{\n\tfm_driver.add_bridging_unicast_vlan(mac, vlan, of_port_no, permanent);\n}\n\nvoid ofdpa_bridge::remove_mac_from_fdb(const uint32_t of_port_no, uint16_t vid,\n\t\tconst rofl::cmacaddr& mac)\n{\n\tfm_driver.remove_bridging_unicast_vlan(mac, vid, of_port_no);\n}\n\n} \/* namespace basebox *\/\n<commit_msg>added comments<commit_after>#include \"ofdpa_bridge.hpp\"\n\n#include \"roflibs\/netlink\/clogging.hpp\"\n\n#include <cassert>\n#include <map>\n\n#include <rofl\/common\/openflow\/cofport.h>\n\n\nnamespace basebox {\n\nofdpa_bridge::ofdpa_bridge(rofl::rofl_ofdpa_fm_driver &fm_driver) :\n\t\tfm_driver(fm_driver)\n{\n}\n\nofdpa_bridge::~ofdpa_bridge()\n{\n}\n\nvoid\nofdpa_bridge::set_bridge_interface(const rofcore::crtlink& rtl)\n{\n\tif (AF_BRIDGE != rtl.get_family() || 0 != rtl.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" not a bridge master: \" << rtl << std::endl;\n\t\treturn;\n\t}\n\n\tthis->bridge = rtl;\n}\n\nstatic int find_next_bit(int i, uint32_t x)\n{\n\tint j;\n\n\tif (i >= 32)\n\t\treturn -1;\n\n\t\/* find first bit *\/\n\tif (i < 0)\n\t\treturn __builtin_ffs(x);\n\n\t\/* mask off prior finds to get next *\/\n\tj = __builtin_ffs(x >> i);\n\treturn j ? j + i : 0;\n}\n\nvoid\nofdpa_bridge::add_interface(const rofcore::crtlink& rtl)\n{\n\t\/\/ sanity checks\n\tif (0 == bridge.get_ifindex()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" cannot attach interface without bridge: \" << rtl << std::endl;\n\t\treturn;\n\t}\n\tif (AF_BRIDGE != rtl.get_family()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << rtl << \" is not a bridge interface \" << std::endl;\n\t\treturn;\n\t}\n\tif (bridge.get_ifindex() != rtl.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << rtl << \" is not a slave of this bridge interface \" << std::endl;\n\t\treturn;\n\t}\n\n\tconst struct rtnl_link_bridge_vlan* br_vlan = rtl.get_br_vlan();\n\n\tfor (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n\t\tint base_bit;\n\t\tuint32_t a = br_vlan->vlan_bitmap[k];\n\n\t\tbase_bit = k * 32;\n\t\tint i = -1;\n\t\tint done = 0;\n\t\twhile (!done) {\n\t\t\tint j = find_next_bit(i, a);\n\t\t\tif (j > 0) {\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\tuint32_t group = fm_driver.enable_port_vid_egress(rtl.get_devname(), vid, egress_untagged);\n\t\t\t\tassert(group && \"invalid group identifier\");\n\t\t\t\tif (rofl::openflow::OFPG_MAX == group) {\n\t\t\t\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" failed to set vid on egress \" << std::endl;\n\t\t\t\t\ti = j;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tl2_domain[vid].push_back(group);\n\n\t\t\t\tif (br_vlan->pvid == vid) {\n\t\t\t\t\tfm_driver.enable_port_pvid_ingress(rtl.get_devname(), vid);\n\t\t\t\t} else {\n\t\t\t\t\tfm_driver.enable_port_vid_ingress(rtl.get_devname(), vid);\n\t\t\t\t}\n\n\t\t\t\t\/\/ todo check if vid is okay as an id as well\n\t\t\t\tgroup = fm_driver.enable_group_l2_multicast(vid, vid, l2_domain[vid], 1 != l2_domain[vid].size());\n\n\t\t\t\tif (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n\t\t\t\t\tfm_driver.enable_policy_arp(vid, group);\n\t\t\t\t}\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid\nofdpa_bridge::update_vlans(const std::string &devname,\n\t\t\tconst rtnl_link_bridge_vlan *old_br_vlan,\n\t\t\tconst rtnl_link_bridge_vlan *new_br_vlan)\n{\n\tfor (int k = 0; k < RTNL_LINK_BRIDGE_VLAN_BITMAP_LEN; k++) {\n\t\tint base_bit;\n\t\tuint32_t a = old_br_vlan->vlan_bitmap[k];\n\t\tuint32_t b = new_br_vlan->vlan_bitmap[k];\n\n\t\tuint32_t c = old_br_vlan->untagged_bitmap[k];\n\t\tuint32_t d = new_br_vlan->untagged_bitmap[k];\n\n\t\tuint32_t vlan_diff = a ^ b;\n\t\tuint32_t untagged_diff = c ^ d;\n\n\t\tbase_bit = k * 32;\n\t\tint i = -1;\n\t\tint done = 0;\n\t\twhile (!done) {\n\t\t\tint j = find_next_bit(i, vlan_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ vlan added or removed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\n\t\t\t\t\t\/\/ clear untagged_diff bit\n\t\t\t\t\tuntagged_diff &= ~((uint32_t)1 << (j-1));\n\t\t\t\t}\n\n\t\t\t\tif (new_br_vlan->vlan_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\t\/\/ vlan added\n\n\t\t\t\t\tuint32_t group = fm_driver.enable_port_vid_egress(devname, vid, egress_untagged);\n\t\t\t\t\tassert(group && \"invalid group identifier\");\n\t\t\t\t\tif (rofl::openflow::OFPG_MAX == group) {\n\t\t\t\t\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" failed to set vid on egress \" << std::endl;\n\t\t\t\t\t\ti = j;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tl2_domain[vid].push_back(group);\n\n\t\t\t\t\tif (new_br_vlan->pvid == vid) {\n\t\t\t\t\t\t\/\/ todo check for existing pvid?\n\t\t\t\t\t\tfm_driver.enable_port_pvid_ingress(devname, vid);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tfm_driver.enable_port_vid_ingress(devname, vid);\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ todo check if vid is okay as an id as well\n\t\t\t\t\tgroup = fm_driver.enable_group_l2_multicast(vid, vid, l2_domain[vid], 1 != l2_domain[vid].size());\n\t\t\t\t\t\/\/ enable arp flooding as well\n#if DISABLED_TO_TEST\n\t\t\t\t\tif (1 == l2_domain[vid].size()) { \/\/ todo maybe unnecessary\n\t\t\t\t\t\tfm_driver.enable_policy_arp(vid, group);\n\t\t\t\t\t}\n#endif\n\t\t\t\t} else {\n\t\t\t\t\t\/\/ vlan removed\n\t\t\t\t}\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n\n#if 0 \/\/ not yet implemented the update\n\t\tdone = 0;\n\t\ti = -1;\n\t\twhile (!done) {\n\t\t\t\/\/ vlan is existing, but swapping egress tagged\/untagged\n\t\t\tint j = find_next_bit(i, untagged_diff);\n\t\t\tif (j > 0) {\n\t\t\t\t\/\/ egress untagged changed\n\t\t\t\tint vid = j - 1 + base_bit;\n\t\t\t\tbool egress_untagged = false;\n\n\t\t\t\t\/\/ check if egress is untagged\n\t\t\t\tif (new_br_vlan->untagged_bitmap[k] & 1 << (j-1)) {\n\t\t\t\t\tegress_untagged = true;\n\t\t\t\t}\n\n\t\t\t\t\/\/ xxx implement update\n\t\t\t\tfm_driver.update_port_vid_egress(devname, vid, egress_untagged);\n\n\n\t\t\t\ti = j;\n\t\t\t} else {\n\t\t\t\tdone = 1;\n\t\t\t}\n\t\t}\n#endif\n\t}\n}\n\nvoid\nofdpa_bridge::update_interface(const rofcore::crtlink& oldlink, const rofcore::crtlink& newlink)\n{\n\tusing rofcore::crtlink;\n\n\t\/\/ sanity checks\n\tif (0 == bridge.get_ifindex()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << \" cannot update interface without bridge\" << std::endl;\n\t\treturn;\n\t}\n\tif (AF_BRIDGE != newlink.get_family()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\/\/\tif (AF_BRIDGE != oldlink.get_family()) {\n\/\/\t\trofcore::logging::error << __PRETTY_FUNCTION__ << oldlink << \" is not a bridge interface\" << std::endl;\n\/\/\t\treturn;\n\/\/\t}\n\tif (bridge.get_ifindex() != newlink.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a slave of this bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\tif (bridge.get_ifindex() != oldlink.get_master()) {\n\t\trofcore::logging::error << __PRETTY_FUNCTION__ << newlink << \" is not a slave of this bridge interface\" << std::endl;\n\t\treturn;\n\t}\n\n\tif (newlink.get_devname().compare(oldlink.get_devname())) {\n\t\trofcore::logging::info << __PRETTY_FUNCTION__ << \" interface rename currently ignored \" << std::endl;\n\t\t\/\/ FIXME this has to be handled differently\n\t\treturn;\n\t}\n\n\tif (not crtlink::are_br_vlan_equal(newlink.get_br_vlan(), oldlink.get_br_vlan())) {\n\t\t\/\/ vlan updated\n\t\tupdate_vlans(oldlink.get_devname(), oldlink.get_br_vlan(), newlink.get_br_vlan());\n\t}\n\n}\n\nvoid\nofdpa_bridge::delete_interface(const rofcore::crtlink& rtl)\n{\n\t\/\/ XXX update L2 Multicast Group\n\n \/\/ get group id\n\n \/\/ remove id from l2_domain\n\n \/\/ update enable_group_l2_multicast\n}\n\n\nvoid\nofdpa_bridge::add_mac_to_fdb(const uint32_t of_port_no, const uint16_t vlan, const rofl::cmacaddr &mac, bool permanent)\n{\n\tfm_driver.add_bridging_unicast_vlan(mac, vlan, of_port_no, permanent);\n}\n\nvoid ofdpa_bridge::remove_mac_from_fdb(const uint32_t of_port_no, uint16_t vid,\n\t\tconst rofl::cmacaddr& mac)\n{\n\tfm_driver.remove_bridging_unicast_vlan(mac, vid, of_port_no);\n}\n\n} \/* namespace basebox *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"rpc\/connectivity\/multiplexer.hpp\"\n\n#include \"errors.hpp\"\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n\n#include \"rpc\/connectivity\/connectivity.hpp\"\n\n\n#define MAX_OUTSTANDING_WRITES_PER_MULTIPLEXER_CLIENT_THREAD 16\n\n\nmessage_multiplexer_t::run_t::run_t(message_multiplexer_t *p) : parent(p) {\n guarantee(parent->run == NULL);\n parent->run = this;\n#ifndef NDEBUG\n for (int i = 0; i < max_tag; i++) {\n if (parent->clients[i]) {\n rassert(parent->clients[i]->run);\n }\n }\n#endif \/\/ NDEBUG\n}\n\nmessage_multiplexer_t::run_t::~run_t() {\n guarantee(parent->run == this);\n parent->run = NULL;\n}\n\nvoid message_multiplexer_t::run_t::on_message(peer_id_t source, string_read_stream_t *stream) {\n tag_t tag;\n archive_result_t res = deserialize(stream, &tag);\n if (res) { throw fake_archive_exc_t(); }\n client_t *client = parent->clients[tag];\n guarantee(client != NULL, \"Got a message for an unfamiliar tag. Apparently \"\n \"we aren't compatible with the cluster on the other end.\");\n client->run->message_handler->on_message(source, stream);\n}\n\nmessage_multiplexer_t::client_t::run_t::run_t(client_t *c, message_handler_t *m) :\n parent(c), message_handler(m)\n{\n guarantee(parent->parent->run == NULL);\n guarantee(parent->run == NULL);\n parent->run = this;\n}\n\nmessage_multiplexer_t::client_t::run_t::~run_t() {\n guarantee(parent->parent->run == NULL);\n guarantee(parent->run == this);\n parent->run = NULL;\n}\n\nmessage_multiplexer_t::client_t::client_t(message_multiplexer_t *p, tag_t t) :\n parent(p),\n tag(t),\n run(NULL),\n outstanding_writes_semaphores(MAX_OUTSTANDING_WRITES_PER_MULTIPLEXER_CLIENT_THREAD)\n{\n guarantee(parent->run == NULL);\n guarantee(parent->clients[tag] == NULL);\n parent->clients[tag] = this;\n}\n\nmessage_multiplexer_t::client_t::~client_t() {\n guarantee(parent->run == NULL);\n guarantee(parent->clients[tag] == this);\n parent->clients[tag] = NULL;\n}\n\nconnectivity_service_t *message_multiplexer_t::client_t::get_connectivity_service() {\n return parent->message_service->get_connectivity_service();\n}\n\nclass tagged_message_writer_t : public send_message_write_callback_t {\npublic:\n tagged_message_writer_t(message_multiplexer_t::tag_t _tag, send_message_write_callback_t *_subwriter) :\n tag(_tag), subwriter(_subwriter) { }\n virtual ~tagged_message_writer_t() { }\n\n void write(write_stream_t *os) {\n write_message_t msg;\n msg << tag;\n int res = send_write_message(os, &msg);\n if (res) { throw fake_archive_exc_t(); }\n subwriter->write(os);\n }\n\nprivate:\n message_multiplexer_t::tag_t tag;\n send_message_write_callback_t *subwriter;\n};\n\nvoid message_multiplexer_t::client_t::send_message(peer_id_t dest, send_message_write_callback_t *callback) {\n tagged_message_writer_t writer(tag, callback);\n {\n semaphore_acq_t outstanding_write_acq (outstanding_writes_semaphores.get());\n parent->message_service->send_message(dest, &writer);\n \/\/ Release outstanding_writes_semaphore\n }\n}\n\nvoid message_multiplexer_t::client_t::kill_connection(peer_id_t peer) {\n parent->message_service->kill_connection(peer);\n}\n\nmessage_multiplexer_t::message_multiplexer_t(message_service_t *super_ms) :\n message_service(super_ms), run(NULL)\n{\n for (int i = 0; i < max_tag; i++) {\n clients[i] = NULL;\n }\n}\n\nmessage_multiplexer_t::~message_multiplexer_t() {\n guarantee(run == NULL);\n for (int i = 0; i < max_tag; i++) {\n guarantee(clients[i] == NULL);\n }\n}\n<commit_msg>Ok, actually in release it seems better with a smaller limit. Revert \"Increased multiplexer client outstanding write limit. Seems faster that way.\"<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"rpc\/connectivity\/multiplexer.hpp\"\n\n#include \"errors.hpp\"\n#include <boost\/bind.hpp>\n#include <boost\/function.hpp>\n\n#include \"rpc\/connectivity\/connectivity.hpp\"\n\n\n#define MAX_OUTSTANDING_WRITES_PER_MULTIPLEXER_CLIENT_THREAD 4\n\n\nmessage_multiplexer_t::run_t::run_t(message_multiplexer_t *p) : parent(p) {\n guarantee(parent->run == NULL);\n parent->run = this;\n#ifndef NDEBUG\n for (int i = 0; i < max_tag; i++) {\n if (parent->clients[i]) {\n rassert(parent->clients[i]->run);\n }\n }\n#endif \/\/ NDEBUG\n}\n\nmessage_multiplexer_t::run_t::~run_t() {\n guarantee(parent->run == this);\n parent->run = NULL;\n}\n\nvoid message_multiplexer_t::run_t::on_message(peer_id_t source, string_read_stream_t *stream) {\n tag_t tag;\n archive_result_t res = deserialize(stream, &tag);\n if (res) { throw fake_archive_exc_t(); }\n client_t *client = parent->clients[tag];\n guarantee(client != NULL, \"Got a message for an unfamiliar tag. Apparently \"\n \"we aren't compatible with the cluster on the other end.\");\n client->run->message_handler->on_message(source, stream);\n}\n\nmessage_multiplexer_t::client_t::run_t::run_t(client_t *c, message_handler_t *m) :\n parent(c), message_handler(m)\n{\n guarantee(parent->parent->run == NULL);\n guarantee(parent->run == NULL);\n parent->run = this;\n}\n\nmessage_multiplexer_t::client_t::run_t::~run_t() {\n guarantee(parent->parent->run == NULL);\n guarantee(parent->run == this);\n parent->run = NULL;\n}\n\nmessage_multiplexer_t::client_t::client_t(message_multiplexer_t *p, tag_t t) :\n parent(p),\n tag(t),\n run(NULL),\n outstanding_writes_semaphores(MAX_OUTSTANDING_WRITES_PER_MULTIPLEXER_CLIENT_THREAD)\n{\n guarantee(parent->run == NULL);\n guarantee(parent->clients[tag] == NULL);\n parent->clients[tag] = this;\n}\n\nmessage_multiplexer_t::client_t::~client_t() {\n guarantee(parent->run == NULL);\n guarantee(parent->clients[tag] == this);\n parent->clients[tag] = NULL;\n}\n\nconnectivity_service_t *message_multiplexer_t::client_t::get_connectivity_service() {\n return parent->message_service->get_connectivity_service();\n}\n\nclass tagged_message_writer_t : public send_message_write_callback_t {\npublic:\n tagged_message_writer_t(message_multiplexer_t::tag_t _tag, send_message_write_callback_t *_subwriter) :\n tag(_tag), subwriter(_subwriter) { }\n virtual ~tagged_message_writer_t() { }\n\n void write(write_stream_t *os) {\n write_message_t msg;\n msg << tag;\n int res = send_write_message(os, &msg);\n if (res) { throw fake_archive_exc_t(); }\n subwriter->write(os);\n }\n\nprivate:\n message_multiplexer_t::tag_t tag;\n send_message_write_callback_t *subwriter;\n};\n\nvoid message_multiplexer_t::client_t::send_message(peer_id_t dest, send_message_write_callback_t *callback) {\n tagged_message_writer_t writer(tag, callback);\n {\n semaphore_acq_t outstanding_write_acq (outstanding_writes_semaphores.get());\n parent->message_service->send_message(dest, &writer);\n \/\/ Release outstanding_writes_semaphore\n }\n}\n\nvoid message_multiplexer_t::client_t::kill_connection(peer_id_t peer) {\n parent->message_service->kill_connection(peer);\n}\n\nmessage_multiplexer_t::message_multiplexer_t(message_service_t *super_ms) :\n message_service(super_ms), run(NULL)\n{\n for (int i = 0; i < max_tag; i++) {\n clients[i] = NULL;\n }\n}\n\nmessage_multiplexer_t::~message_multiplexer_t() {\n guarantee(run == NULL);\n for (int i = 0; i < max_tag; i++) {\n guarantee(clients[i] == NULL);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Tree View\/Editable Cells\n *\n * This demo demonstrates the use of editable cells in a Gtk::TreeView. If\n * you're new to the Gtk::TreeView widgets and associates, look into\n * the Gtk::ListStore example first.\n *\n *\/\n\n#include <cstdlib>\n#include <gtkmm.h>\n\nclass CellItem_Product\n{\npublic:\n CellItem_Product();\n CellItem_Product(const CellItem_Product& src);\n ~CellItem_Product();\n CellItem_Product& operator=(const CellItem_Product& src);\n\n int m_number;\n Glib::ustring m_product;\n};\n\nclass Example_TreeView_EditableCells : public Gtk::Window\n{\npublic:\n Example_TreeView_EditableCells();\n ~Example_TreeView_EditableCells() override;\n\nprotected:\n \/\/signal handlers:\n virtual void on_button_add_clicked();\n virtual void on_button_remove_clicked();\n\n virtual void create_model();\n virtual void add_columns();\n virtual void add_items();\n virtual void liststore_add_item(const CellItem_Product& foo);\n\n \/\/We only have these signal handlers here, because the append_column_editable() convenience methods do not work with\n \/\/the IRIX MipsPro compiler.\n virtual void on_column_number_edited(const Glib::ustring& path_string, const Glib::ustring& new_text);\n virtual void on_column_product_edited(const Glib::ustring& path_string, const Glib::ustring& new_text);\n\n \/\/Member widgets:\n Gtk::Box m_VBox;\n Gtk::ScrolledWindow m_ScrolledWindow;\n Gtk::Label m_Label;\n Gtk::TreeView m_TreeView;\n Glib::RefPtr<Gtk::ListStore> m_refListStore;\n Gtk::Box m_HBox;\n Gtk::Button m_Button_Add, m_Button_Remove;\n\n typedef std::vector<CellItem_Product> type_vecItems;\n type_vecItems m_vecItems;\n\n struct ModelColumns : public Gtk::TreeModelColumnRecord\n {\n Gtk::TreeModelColumn<int> number;\n Gtk::TreeModelColumn<Glib::ustring> product;\n\n ModelColumns() { add(number); add(product); }\n };\n\n const ModelColumns m_columns;\n};\n\n\nCellItem_Product::CellItem_Product()\n{\n m_number = 0;\n}\n\nCellItem_Product::CellItem_Product(const CellItem_Product& src)\n{\n operator=(src);\n}\n\nCellItem_Product::~CellItem_Product()\n{\n}\n\nCellItem_Product& CellItem_Product::operator=(const CellItem_Product& src)\n{\n m_number = src.m_number;\n m_product = src.m_product;\n\n return *this;\n}\n\n\n\/\/Called by DemoWindow;\nGtk::Window* do_treeview_editable_cells()\n{\n return new Example_TreeView_EditableCells();\n}\n\n\nExample_TreeView_EditableCells::Example_TreeView_EditableCells()\n: m_VBox(Gtk::ORIENTATION_VERTICAL, 5),\n m_Label(\"Shopping list (you can edit the cells!)\"),\n m_HBox(Gtk::ORIENTATION_HORIZONTAL, 4),\n m_Button_Add(\"Add item\"),\n m_Button_Remove(\"Remove item\")\n{\n set_title(\"Shopping List\");\n set_border_width(5);\n set_default_size(320, 200);\n\n add(m_VBox);\n m_VBox.pack_start(m_Label, Gtk::PACK_SHRINK);\n\n m_ScrolledWindow.set_shadow_type(Gtk::SHADOW_ETCHED_IN);\n m_ScrolledWindow.set_policy(Gtk::POLICY_AUTOMATIC, Gtk::POLICY_AUTOMATIC);\n m_VBox.pack_start(m_ScrolledWindow);\n\n \/* create model *\/\n create_model();\n\n \/* create tree view *\/\n m_TreeView.set_model(m_refListStore);\n Glib::RefPtr<Gtk::TreeSelection> refTreeSelection = m_TreeView.get_selection();\n refTreeSelection->set_mode(Gtk::SELECTION_SINGLE);\n\n add_columns();\n m_ScrolledWindow.add(m_TreeView);\n\n \/* some buttons *\/\n m_VBox.pack_start(m_HBox, Gtk::PACK_SHRINK);\n\n m_HBox.pack_start(m_Button_Add);\n m_Button_Add.signal_clicked().connect(\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_button_add_clicked));\n\n m_HBox.pack_start(m_Button_Remove);\n m_Button_Remove.signal_clicked().connect(\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_button_remove_clicked));\n\n show_all();\n}\n\nExample_TreeView_EditableCells::~Example_TreeView_EditableCells()\n{\n}\n\nvoid Example_TreeView_EditableCells::add_items()\n{\n CellItem_Product foo;\n\n foo.m_number = 3;\n foo.m_product = \"bottles of coke\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 5;\n foo.m_product = \"packages of noodles\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 2;\n foo.m_product = \"packages of chocolate chip cookies\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 1;\n foo.m_product = \"can vanilla ice cream\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 6;\n foo.m_product = \"eggs\";\n m_vecItems.push_back(foo);\n}\n\nvoid Example_TreeView_EditableCells::create_model()\n{\n m_refListStore = Gtk::ListStore::create(m_columns);\n\n \/* add items *\/\n add_items();\n\n std::for_each(\n m_vecItems.begin(), m_vecItems.end(),\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::liststore_add_item));\n}\n\nvoid Example_TreeView_EditableCells::liststore_add_item(const CellItem_Product& foo)\n{\n Gtk::TreeRow row = *(m_refListStore->append());\n\n row[m_columns.number] = foo.m_number;\n row[m_columns.product] = foo.m_product;\n}\n\n\/\/We only have these signal handlers here, because the append_column_editable() convenience methods do not work with\n\/\/the IRIX MipsPro compiler.\nvoid Example_TreeView_EditableCells::on_column_number_edited(const Glib::ustring& path_string, const Glib::ustring& new_text)\n{\n Gtk::TreePath path(path_string);\n\n \/\/Get the row from the path:\n Glib::RefPtr<Gtk::TreeModel> refModel = m_TreeView.get_model();\n if(refModel)\n {\n Gtk::TreeModel::iterator iter = refModel->get_iter(path);\n if(iter)\n {\n \/\/Convert the text to a number, using the same logic used by GtkCellRendererText when it stores numbers.\n auto new_value = std::stoi(new_text);\n\n \/\/Store the user's new text in the model:\n Gtk::TreeRow row = *iter;\n row[m_columns.number] = new_value;\n }\n }\n}\n\nvoid Example_TreeView_EditableCells::on_column_product_edited(const Glib::ustring& path_string, const Glib::ustring& new_text)\n{\n Gtk::TreePath path(path_string);\n\n \/\/Get the row from the path:\n Glib::RefPtr<Gtk::TreeModel> refModel = m_TreeView.get_model();\n if(refModel)\n {\n Gtk::TreeModel::iterator iter = refModel->get_iter(path);\n if(iter)\n {\n \/\/Store the user's new text in the model:\n Gtk::TreeRow row = *iter;\n row[m_columns.product] = new_text;\n }\n }\n}\n\nvoid Example_TreeView_EditableCells::add_columns()\n{\n \/\/This is the wasy way:\n \/\/ number column:\n \/\/m_TreeView.append_column_editable(\"Number\", m_columns.number);\n \/\/\n \/\/ product column:\n \/\/m_TreeView.append_column_editable(\"Product\", m_columns.product);\n\n \/\/And this is the way that works with the IRIX MipsPro compiler too:\n {\n Gtk::TreeView::Column* pViewColumn = Gtk::manage(new Gtk::TreeView::Column(\"Number\", m_columns.number));\n\n \/\/connect signal handlers for auto-storing of edited cell data\n Gtk::CellRenderer* pCellRenderer = pViewColumn->get_first_cell();\n Gtk::CellRendererText* pCellRenderText = dynamic_cast<Gtk::CellRendererText*>(pCellRenderer);\n if(pCellRenderText)\n {\n \/\/Set the appropriate property,\n pCellRenderText->property_editable() = true;\n\n \/\/Connect to the appropriate signal, sending the model_column too,\n pCellRenderText->signal_edited().connect( sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_column_number_edited) );\n }\n\n m_TreeView.append_column(*pViewColumn);\n }\n\n {\n Gtk::TreeView::Column* pViewColumn = Gtk::manage(new Gtk::TreeView::Column(\"Product\", m_columns.product));\n\n \/\/connect signal handlers for auto-storing of edited cell data\n Gtk::CellRenderer* pCellRenderer = pViewColumn->get_first_cell();\n Gtk::CellRendererText* pCellRenderText = dynamic_cast<Gtk::CellRendererText*>(pCellRenderer);\n if(pCellRenderText)\n {\n \/\/Set the appropriate property,\n pCellRenderText->property_editable() = true;\n\n \/\/Connect to the appropriate signal, sending the model_column too,\n pCellRenderText->signal_edited().connect( sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_column_product_edited) );\n }\n\n m_TreeView.append_column(*pViewColumn);\n }\n\n\n}\n\n\nvoid Example_TreeView_EditableCells::on_button_add_clicked()\n{\n CellItem_Product foo;\n foo.m_number = 0;\n foo.m_product = \"Description here\";\n m_vecItems.push_back(foo);\n\n liststore_add_item(foo);\n}\n\nvoid Example_TreeView_EditableCells::on_button_remove_clicked()\n{\n Glib::RefPtr<Gtk::TreeSelection> refSelection = m_TreeView.get_selection();\n\n if(const Gtk::TreeModel::iterator iter = refSelection->get_selected())\n {\n const Gtk::TreeModel::Path path(iter);\n const unsigned int index = path.front();\n\n \/\/ Remove item from ListStore:\n m_refListStore->erase(iter);\n\n \/\/ Remove item from vecItems.\n if(index < m_vecItems.size())\n m_vecItems.erase(m_vecItems.begin() + index);\n }\n}\n<commit_msg>treeview_editable_cells demo: Catch exception from std::stoi<commit_after>\/* Tree View\/Editable Cells\n *\n * This demo demonstrates the use of editable cells in a Gtk::TreeView. If\n * you're new to the Gtk::TreeView widgets and associates, look into\n * the Gtk::ListStore example first.\n *\n *\/\n\n#include <cstdlib>\n#include <iostream>\n#include <gtkmm.h>\n\nclass CellItem_Product\n{\npublic:\n CellItem_Product();\n CellItem_Product(const CellItem_Product& src);\n ~CellItem_Product();\n CellItem_Product& operator=(const CellItem_Product& src);\n\n int m_number;\n Glib::ustring m_product;\n};\n\nclass Example_TreeView_EditableCells : public Gtk::Window\n{\npublic:\n Example_TreeView_EditableCells();\n ~Example_TreeView_EditableCells() override;\n\nprotected:\n \/\/signal handlers:\n virtual void on_button_add_clicked();\n virtual void on_button_remove_clicked();\n\n virtual void create_model();\n virtual void add_columns();\n virtual void add_items();\n virtual void liststore_add_item(const CellItem_Product& foo);\n\n \/\/We only have these signal handlers here, because the append_column_editable() convenience methods do not work with\n \/\/the IRIX MipsPro compiler.\n virtual void on_column_number_edited(const Glib::ustring& path_string, const Glib::ustring& new_text);\n virtual void on_column_product_edited(const Glib::ustring& path_string, const Glib::ustring& new_text);\n\n \/\/Member widgets:\n Gtk::Box m_VBox;\n Gtk::ScrolledWindow m_ScrolledWindow;\n Gtk::Label m_Label;\n Gtk::TreeView m_TreeView;\n Glib::RefPtr<Gtk::ListStore> m_refListStore;\n Gtk::Box m_HBox;\n Gtk::Button m_Button_Add, m_Button_Remove;\n\n typedef std::vector<CellItem_Product> type_vecItems;\n type_vecItems m_vecItems;\n\n struct ModelColumns : public Gtk::TreeModelColumnRecord\n {\n Gtk::TreeModelColumn<int> number;\n Gtk::TreeModelColumn<Glib::ustring> product;\n\n ModelColumns() { add(number); add(product); }\n };\n\n const ModelColumns m_columns;\n};\n\n\nCellItem_Product::CellItem_Product()\n{\n m_number = 0;\n}\n\nCellItem_Product::CellItem_Product(const CellItem_Product& src)\n{\n operator=(src);\n}\n\nCellItem_Product::~CellItem_Product()\n{\n}\n\nCellItem_Product& CellItem_Product::operator=(const CellItem_Product& src)\n{\n m_number = src.m_number;\n m_product = src.m_product;\n\n return *this;\n}\n\n\n\/\/Called by DemoWindow;\nGtk::Window* do_treeview_editable_cells()\n{\n return new Example_TreeView_EditableCells();\n}\n\n\nExample_TreeView_EditableCells::Example_TreeView_EditableCells()\n: m_VBox(Gtk::ORIENTATION_VERTICAL, 5),\n m_Label(\"Shopping list (you can edit the cells!)\"),\n m_HBox(Gtk::ORIENTATION_HORIZONTAL, 4),\n m_Button_Add(\"Add item\"),\n m_Button_Remove(\"Remove item\")\n{\n set_title(\"Shopping List\");\n set_border_width(5);\n set_default_size(320, 200);\n\n add(m_VBox);\n m_VBox.pack_start(m_Label, Gtk::PACK_SHRINK);\n\n m_ScrolledWindow.set_shadow_type(Gtk::SHADOW_ETCHED_IN);\n m_ScrolledWindow.set_policy(Gtk::POLICY_AUTOMATIC, Gtk::POLICY_AUTOMATIC);\n m_VBox.pack_start(m_ScrolledWindow);\n\n \/* create model *\/\n create_model();\n\n \/* create tree view *\/\n m_TreeView.set_model(m_refListStore);\n Glib::RefPtr<Gtk::TreeSelection> refTreeSelection = m_TreeView.get_selection();\n refTreeSelection->set_mode(Gtk::SELECTION_SINGLE);\n\n add_columns();\n m_ScrolledWindow.add(m_TreeView);\n\n \/* some buttons *\/\n m_VBox.pack_start(m_HBox, Gtk::PACK_SHRINK);\n\n m_HBox.pack_start(m_Button_Add);\n m_Button_Add.signal_clicked().connect(\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_button_add_clicked));\n\n m_HBox.pack_start(m_Button_Remove);\n m_Button_Remove.signal_clicked().connect(\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_button_remove_clicked));\n\n show_all();\n}\n\nExample_TreeView_EditableCells::~Example_TreeView_EditableCells()\n{\n}\n\nvoid Example_TreeView_EditableCells::add_items()\n{\n CellItem_Product foo;\n\n foo.m_number = 3;\n foo.m_product = \"bottles of coke\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 5;\n foo.m_product = \"packages of noodles\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 2;\n foo.m_product = \"packages of chocolate chip cookies\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 1;\n foo.m_product = \"can vanilla ice cream\";\n m_vecItems.push_back(foo);\n\n foo.m_number = 6;\n foo.m_product = \"eggs\";\n m_vecItems.push_back(foo);\n}\n\nvoid Example_TreeView_EditableCells::create_model()\n{\n m_refListStore = Gtk::ListStore::create(m_columns);\n\n \/* add items *\/\n add_items();\n\n std::for_each(\n m_vecItems.begin(), m_vecItems.end(),\n sigc::mem_fun(*this, &Example_TreeView_EditableCells::liststore_add_item));\n}\n\nvoid Example_TreeView_EditableCells::liststore_add_item(const CellItem_Product& foo)\n{\n Gtk::TreeRow row = *(m_refListStore->append());\n\n row[m_columns.number] = foo.m_number;\n row[m_columns.product] = foo.m_product;\n}\n\n\/\/We only have these signal handlers here, because the append_column_editable() convenience methods do not work with\n\/\/the IRIX MipsPro compiler.\nvoid Example_TreeView_EditableCells::on_column_number_edited(const Glib::ustring& path_string, const Glib::ustring& new_text)\n{\n Gtk::TreePath path(path_string);\n\n \/\/Get the row from the path:\n Glib::RefPtr<Gtk::TreeModel> refModel = m_TreeView.get_model();\n if(refModel)\n {\n Gtk::TreeModel::iterator iter = refModel->get_iter(path);\n if(iter)\n {\n \/\/Convert the text to a number, using the same logic used by GtkCellRendererText when it stores numbers.\n int new_value = 0;\n try\n {\n new_value = std::stoi(new_text);\n }\n catch (const std::exception& err)\n {\n std::cout << \"Could not convert \\\"\" << new_text << \"\\\" to an integer. (\"\n << err.what() << \")\" << std::endl;\n }\n\n \/\/Store the user's new text in the model:\n Gtk::TreeRow row = *iter;\n row[m_columns.number] = new_value;\n }\n }\n}\n\nvoid Example_TreeView_EditableCells::on_column_product_edited(const Glib::ustring& path_string, const Glib::ustring& new_text)\n{\n Gtk::TreePath path(path_string);\n\n \/\/Get the row from the path:\n Glib::RefPtr<Gtk::TreeModel> refModel = m_TreeView.get_model();\n if(refModel)\n {\n Gtk::TreeModel::iterator iter = refModel->get_iter(path);\n if(iter)\n {\n \/\/Store the user's new text in the model:\n Gtk::TreeRow row = *iter;\n row[m_columns.product] = new_text;\n }\n }\n}\n\nvoid Example_TreeView_EditableCells::add_columns()\n{\n \/\/This is the wasy way:\n \/\/ number column:\n \/\/m_TreeView.append_column_editable(\"Number\", m_columns.number);\n \/\/\n \/\/ product column:\n \/\/m_TreeView.append_column_editable(\"Product\", m_columns.product);\n\n \/\/And this is the way that works with the IRIX MipsPro compiler too:\n {\n Gtk::TreeView::Column* pViewColumn = Gtk::manage(new Gtk::TreeView::Column(\"Number\", m_columns.number));\n\n \/\/connect signal handlers for auto-storing of edited cell data\n Gtk::CellRenderer* pCellRenderer = pViewColumn->get_first_cell();\n Gtk::CellRendererText* pCellRenderText = dynamic_cast<Gtk::CellRendererText*>(pCellRenderer);\n if(pCellRenderText)\n {\n \/\/Set the appropriate property,\n pCellRenderText->property_editable() = true;\n\n \/\/Connect to the appropriate signal, sending the model_column too,\n pCellRenderText->signal_edited().connect( sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_column_number_edited) );\n }\n\n m_TreeView.append_column(*pViewColumn);\n }\n\n {\n Gtk::TreeView::Column* pViewColumn = Gtk::manage(new Gtk::TreeView::Column(\"Product\", m_columns.product));\n\n \/\/connect signal handlers for auto-storing of edited cell data\n Gtk::CellRenderer* pCellRenderer = pViewColumn->get_first_cell();\n Gtk::CellRendererText* pCellRenderText = dynamic_cast<Gtk::CellRendererText*>(pCellRenderer);\n if(pCellRenderText)\n {\n \/\/Set the appropriate property,\n pCellRenderText->property_editable() = true;\n\n \/\/Connect to the appropriate signal, sending the model_column too,\n pCellRenderText->signal_edited().connect( sigc::mem_fun(*this, &Example_TreeView_EditableCells::on_column_product_edited) );\n }\n\n m_TreeView.append_column(*pViewColumn);\n }\n\n\n}\n\n\nvoid Example_TreeView_EditableCells::on_button_add_clicked()\n{\n CellItem_Product foo;\n foo.m_number = 0;\n foo.m_product = \"Description here\";\n m_vecItems.push_back(foo);\n\n liststore_add_item(foo);\n}\n\nvoid Example_TreeView_EditableCells::on_button_remove_clicked()\n{\n Glib::RefPtr<Gtk::TreeSelection> refSelection = m_TreeView.get_selection();\n\n if(const Gtk::TreeModel::iterator iter = refSelection->get_selected())\n {\n const Gtk::TreeModel::Path path(iter);\n const unsigned int index = path.front();\n\n \/\/ Remove item from ListStore:\n m_refListStore->erase(iter);\n\n \/\/ Remove item from vecItems.\n if(index < m_vecItems.size())\n m_vecItems.erase(m_vecItems.begin() + index);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"itkWin32Header.h\"\n#include <iostream>\n#include <fstream>\n#include \"itkNumericTraits.h\"\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkExtractImageFilter.h\"\n#include \"itkDifferenceImageFilter.h\"\n\nusing namespace std;\n\n#define ITK_TEST_DIMENSION_MAX 6\n\nint RegressionTestImage(const char *, const char *, int, bool);\n\nint main(int argc, char * *argv)\n{\n if( argc < 3 )\n {\n cerr << \"Usage:\" << endl;\n cerr << \"testImage, baselineImage1, [baselineImage2, baselineImage3, ...]\" << endl;\n cerr << \"Note that if you supply more than one baselineImage, this test will pass if any\" << endl;\n cerr << \"of them match the testImage\" << endl;\n return -1;\n }\n int bestBaselineStatus = 2001;\n int bestBaseline = 2;\n try\n {\n if( argc == 3 )\n {\n bestBaselineStatus = RegressionTestImage(argv[1], argv[2], 0, false);\n }\n else\n {\n int currentStatus = 2001;\n for( int i = 2; i < argc; i++ )\n {\n currentStatus = RegressionTestImage(argv[1], argv[i], 0, false);\n if( currentStatus < bestBaselineStatus )\n {\n bestBaselineStatus = currentStatus;\n bestBaseline = i;\n }\n if( bestBaselineStatus == 0 )\n {\n break;\n }\n }\n }\n \/\/ generate images of our closest match\n if( bestBaselineStatus == 0 )\n {\n RegressionTestImage(argv[1], argv[bestBaseline], 1, false);\n }\n else\n {\n RegressionTestImage(argv[1], argv[bestBaseline], 1, true);\n }\n }\n catch( const itk::ExceptionObject& e )\n {\n std::cerr << \"ITK test driver caught an ITK exception:\\n\";\n std::cerr << e.GetFile() << \":\" << e.GetLine() << \":\\n\"\n << e.GetDescription() << \"\\n\";\n bestBaselineStatus = -1;\n }\n catch( const std::exception& e )\n {\n std::cerr << \"ITK test driver caught an exception:\\n\";\n std::cerr << e.what() << \"\\n\";\n bestBaselineStatus = -1;\n }\n catch( ... )\n {\n std::cerr << \"ITK test driver caught an unknown exception!!!\\n\";\n bestBaselineStatus = -1;\n }\n cout << bestBaselineStatus << endl;\n return bestBaselineStatus;\n}\n\n\/\/ Regression Testing Code\nint RegressionTestImage(const char *testImageFilename, const char *baselineImageFilename,\n int reportErrors, bool differences)\n{\n \/\/ Use the factory mechanism to read the test and baseline files and convert them to double\n typedef itk::Image<double, ITK_TEST_DIMENSION_MAX> ImageType;\n typedef itk::Image<unsigned char, ITK_TEST_DIMENSION_MAX> OutputType;\n typedef itk::Image<unsigned char, 2> DiffOutputType;\n typedef itk::ImageFileReader<ImageType> ReaderType;\n\n \/\/ Read the baseline file\n ReaderType::Pointer baselineReader = ReaderType::New();\n baselineReader->SetFileName(baselineImageFilename);\n try\n {\n baselineReader->UpdateLargestPossibleRegion();\n }\n catch( itk::ExceptionObject& e )\n {\n std::cerr << \"Exception detected while reading \" << baselineImageFilename << \" : \" << e.GetDescription();\n return 1000;\n }\n\n \/\/ Read the file generated by the test\n ReaderType::Pointer testReader = ReaderType::New();\n testReader->SetFileName(testImageFilename);\n try\n {\n testReader->UpdateLargestPossibleRegion();\n }\n catch( itk::ExceptionObject& e )\n {\n std::cerr << \"Exception detected while reading \" << testImageFilename << \" : \" << e.GetDescription() << std::endl;\n return 1000;\n }\n\n \/\/ The sizes of the baseline and test image must match\n ImageType::SizeType baselineSize;\n baselineSize = baselineReader->GetOutput()->GetLargestPossibleRegion().GetSize();\n ImageType::SizeType testSize;\n testSize = testReader->GetOutput()->GetLargestPossibleRegion().GetSize();\n\n if( baselineSize != testSize )\n {\n std::cerr << \"The size of the Baseline image and Test image do not match!\" << std::endl;\n std::cerr << \"Baseline image: \" << baselineImageFilename\n << \" has size \" << baselineSize << std::endl;\n std::cerr << \"Test image: \" << testImageFilename\n << \" has size \" << testSize << std::endl;\n return 1;\n }\n\n \/\/ Now compare the two images\n typedef itk::DifferenceImageFilter<ImageType, ImageType> DiffType;\n DiffType::Pointer diff = DiffType::New();\n diff->SetValidInput(baselineReader->GetOutput() );\n diff->SetTestInput(testReader->GetOutput() );\n diff->SetDifferenceThreshold(2.0);\n diff->UpdateLargestPossibleRegion();\n\n double status = diff->GetTotalDifference();\n\n if( reportErrors )\n {\n typedef itk::RescaleIntensityImageFilter<ImageType, OutputType> RescaleType;\n typedef itk::ExtractImageFilter<OutputType, DiffOutputType> ExtractType;\n typedef itk::ImageFileWriter<DiffOutputType> WriterType;\n typedef itk::ImageRegion<ITK_TEST_DIMENSION_MAX> RegionType;\n OutputType::IndexType index; index.Fill(0);\n OutputType::SizeType size; size.Fill(0);\n\n RescaleType::Pointer rescale = RescaleType::New();\n rescale->SetOutputMinimum(itk::NumericTraits<unsigned char>::NonpositiveMin() );\n rescale->SetOutputMaximum(itk::NumericTraits<unsigned char>::max() );\n rescale->SetInput(diff->GetOutput() );\n rescale->UpdateLargestPossibleRegion();\n\n RegionType region;\n region.SetIndex(index);\n\n size = rescale->GetOutput()->GetLargestPossibleRegion().GetSize();\n for( unsigned int i = 2; i < ITK_TEST_DIMENSION_MAX; i++ )\n {\n size[i] = 0;\n }\n region.SetSize(size);\n\n ExtractType::Pointer extract = ExtractType::New();\n extract->SetInput(rescale->GetOutput() );\n extract->SetExtractionRegion(region);\n\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput(extract->GetOutput() );\n if( differences )\n {\n \/\/ if there are discrepencies, create an diff image\n std::cout << \"<DartMeasurement name=\\\"ImageError\\\" type=\\\"numeric\/double\\\">\";\n std::cout << status;\n std::cout << \"<\/DartMeasurement>\" << std::endl;\n\n std::ostringstream diffName;\n diffName << testImageFilename << \".diff.png\";\n try\n {\n rescale->SetInput(diff->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << diffName.str() << std::endl;\n }\n writer->SetFileName(diffName.str().c_str() );\n try\n {\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << diffName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"DifferenceImage\\\" type=\\\"image\/png\\\">\";\n std::cout << diffName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n }\n std::ostringstream baseName;\n baseName << testImageFilename << \".base.png\";\n try\n {\n rescale->SetInput(baselineReader->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << baseName.str() << std::endl;\n }\n try\n {\n writer->SetFileName(baseName.str().c_str() );\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << baseName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"BaselineImage\\\" type=\\\"image\/png\\\">\";\n std::cout << baseName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n\n std::ostringstream testName;\n testName << testImageFilename << \".test.png\";\n try\n {\n rescale->SetInput(testReader->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << testName.str()\n << std::endl;\n }\n try\n {\n writer->SetFileName(testName.str().c_str() );\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << testName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"TestImage\\\" type=\\\"image\/png\\\">\";\n std::cout << testName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n }\n return (status != 0) ? 1 : 0;\n}\n<commit_msg>COMP: ITKv4 compatibility<commit_after>#include \"itkWin32Header.h\"\n#include <iostream>\n#include <fstream>\n#include \"itkNumericTraits.h\"\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkRescaleIntensityImageFilter.h\"\n#include \"itkExtractImageFilter.h\"\n#include \"itkTestingComparisonImageFilter.h\"\n\nusing namespace std;\n\n#define ITK_TEST_DIMENSION_MAX 6\n\nint RegressionTestImage(const char *, const char *, int, bool);\n\nint main(int argc, char * *argv)\n{\n if( argc < 3 )\n {\n cerr << \"Usage:\" << endl;\n cerr << \"testImage, baselineImage1, [baselineImage2, baselineImage3, ...]\" << endl;\n cerr << \"Note that if you supply more than one baselineImage, this test will pass if any\" << endl;\n cerr << \"of them match the testImage\" << endl;\n return -1;\n }\n int bestBaselineStatus = 2001;\n int bestBaseline = 2;\n try\n {\n if( argc == 3 )\n {\n bestBaselineStatus = RegressionTestImage(argv[1], argv[2], 0, false);\n }\n else\n {\n int currentStatus = 2001;\n for( int i = 2; i < argc; i++ )\n {\n currentStatus = RegressionTestImage(argv[1], argv[i], 0, false);\n if( currentStatus < bestBaselineStatus )\n {\n bestBaselineStatus = currentStatus;\n bestBaseline = i;\n }\n if( bestBaselineStatus == 0 )\n {\n break;\n }\n }\n }\n \/\/ generate images of our closest match\n if( bestBaselineStatus == 0 )\n {\n RegressionTestImage(argv[1], argv[bestBaseline], 1, false);\n }\n else\n {\n RegressionTestImage(argv[1], argv[bestBaseline], 1, true);\n }\n }\n catch( const itk::ExceptionObject& e )\n {\n std::cerr << \"ITK test driver caught an ITK exception:\\n\";\n std::cerr << e.GetFile() << \":\" << e.GetLine() << \":\\n\"\n << e.GetDescription() << \"\\n\";\n bestBaselineStatus = -1;\n }\n catch( const std::exception& e )\n {\n std::cerr << \"ITK test driver caught an exception:\\n\";\n std::cerr << e.what() << \"\\n\";\n bestBaselineStatus = -1;\n }\n catch( ... )\n {\n std::cerr << \"ITK test driver caught an unknown exception!!!\\n\";\n bestBaselineStatus = -1;\n }\n cout << bestBaselineStatus << endl;\n return bestBaselineStatus;\n}\n\n\/\/ Regression Testing Code\nint RegressionTestImage(const char *testImageFilename, const char *baselineImageFilename,\n int reportErrors, bool differences)\n{\n \/\/ Use the factory mechanism to read the test and baseline files and convert them to double\n typedef itk::Image<double, ITK_TEST_DIMENSION_MAX> ImageType;\n typedef itk::Image<unsigned char, ITK_TEST_DIMENSION_MAX> OutputType;\n typedef itk::Image<unsigned char, 2> DiffOutputType;\n typedef itk::ImageFileReader<ImageType> ReaderType;\n\n \/\/ Read the baseline file\n ReaderType::Pointer baselineReader = ReaderType::New();\n baselineReader->SetFileName(baselineImageFilename);\n try\n {\n baselineReader->UpdateLargestPossibleRegion();\n }\n catch( itk::ExceptionObject& e )\n {\n std::cerr << \"Exception detected while reading \" << baselineImageFilename << \" : \" << e.GetDescription();\n return 1000;\n }\n\n \/\/ Read the file generated by the test\n ReaderType::Pointer testReader = ReaderType::New();\n testReader->SetFileName(testImageFilename);\n try\n {\n testReader->UpdateLargestPossibleRegion();\n }\n catch( itk::ExceptionObject& e )\n {\n std::cerr << \"Exception detected while reading \" << testImageFilename << \" : \" << e.GetDescription() << std::endl;\n return 1000;\n }\n\n \/\/ The sizes of the baseline and test image must match\n ImageType::SizeType baselineSize;\n baselineSize = baselineReader->GetOutput()->GetLargestPossibleRegion().GetSize();\n ImageType::SizeType testSize;\n testSize = testReader->GetOutput()->GetLargestPossibleRegion().GetSize();\n\n if( baselineSize != testSize )\n {\n std::cerr << \"The size of the Baseline image and Test image do not match!\" << std::endl;\n std::cerr << \"Baseline image: \" << baselineImageFilename\n << \" has size \" << baselineSize << std::endl;\n std::cerr << \"Test image: \" << testImageFilename\n << \" has size \" << testSize << std::endl;\n return 1;\n }\n\n \/\/ Now compare the two images\n typedef itk::Testing::ComparisonImageFilter<ImageType, ImageType> DiffType;\n DiffType::Pointer diff = DiffType::New();\n diff->SetValidInput(baselineReader->GetOutput() );\n diff->SetTestInput(testReader->GetOutput() );\n diff->SetDifferenceThreshold(2.0);\n diff->UpdateLargestPossibleRegion();\n\n double status = diff->GetTotalDifference();\n\n if( reportErrors )\n {\n typedef itk::RescaleIntensityImageFilter<ImageType, OutputType> RescaleType;\n typedef itk::ExtractImageFilter<OutputType, DiffOutputType> ExtractType;\n typedef itk::ImageFileWriter<DiffOutputType> WriterType;\n typedef itk::ImageRegion<ITK_TEST_DIMENSION_MAX> RegionType;\n OutputType::IndexType index; index.Fill(0);\n OutputType::SizeType size; size.Fill(0);\n\n RescaleType::Pointer rescale = RescaleType::New();\n rescale->SetOutputMinimum(itk::NumericTraits<unsigned char>::NonpositiveMin() );\n rescale->SetOutputMaximum(itk::NumericTraits<unsigned char>::max() );\n rescale->SetInput(diff->GetOutput() );\n rescale->UpdateLargestPossibleRegion();\n\n RegionType region;\n region.SetIndex(index);\n\n size = rescale->GetOutput()->GetLargestPossibleRegion().GetSize();\n for( unsigned int i = 2; i < ITK_TEST_DIMENSION_MAX; i++ )\n {\n size[i] = 0;\n }\n region.SetSize(size);\n\n ExtractType::Pointer extract = ExtractType::New();\n extract->SetInput(rescale->GetOutput() );\n extract->SetExtractionRegion(region);\n\n WriterType::Pointer writer = WriterType::New();\n writer->SetInput(extract->GetOutput() );\n if( differences )\n {\n \/\/ if there are discrepencies, create an diff image\n std::cout << \"<DartMeasurement name=\\\"ImageError\\\" type=\\\"numeric\/double\\\">\";\n std::cout << status;\n std::cout << \"<\/DartMeasurement>\" << std::endl;\n\n std::ostringstream diffName;\n diffName << testImageFilename << \".diff.png\";\n try\n {\n rescale->SetInput(diff->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << diffName.str() << std::endl;\n }\n writer->SetFileName(diffName.str().c_str() );\n try\n {\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << diffName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"DifferenceImage\\\" type=\\\"image\/png\\\">\";\n std::cout << diffName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n }\n std::ostringstream baseName;\n baseName << testImageFilename << \".base.png\";\n try\n {\n rescale->SetInput(baselineReader->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << baseName.str() << std::endl;\n }\n try\n {\n writer->SetFileName(baseName.str().c_str() );\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << baseName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"BaselineImage\\\" type=\\\"image\/png\\\">\";\n std::cout << baseName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n\n std::ostringstream testName;\n testName << testImageFilename << \".test.png\";\n try\n {\n rescale->SetInput(testReader->GetOutput() );\n rescale->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during rescale of \" << testName.str()\n << std::endl;\n }\n try\n {\n writer->SetFileName(testName.str().c_str() );\n writer->Update();\n }\n catch( ... )\n {\n std::cerr << \"Error during write of \" << testName.str() << std::endl;\n }\n\n std::cout << \"<DartMeasurementFile name=\\\"TestImage\\\" type=\\\"image\/png\\\">\";\n std::cout << testName.str();\n std::cout << \"<\/DartMeasurementFile>\" << std::endl;\n }\n return (status != 0) ? 1 : 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file cmdoptions.cpp\n\/\/\/ @brief Parse command-line options for the primecount console\n\/\/\/ (terminal) application.\n\/\/\/\n\/\/\/ Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include \"cmdoptions.hpp\"\n#include <primecount-internal.hpp>\n#include <int128.hpp>\n\n#include <stdint.h>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <map>\n#include <exception>\n#include <cstdlib>\n#include <cstddef>\n\nusing std::string;\nusing std::istringstream;\n\nnamespace primecount {\n\nvoid help();\nvoid version();\nbool test();\n\ndouble to_double(const string& s)\n{\n istringstream i(s);\n double x;\n if (!(i >> x))\n throw primecount_error(\"failed to convert \\\"\" + s + \"\\\" to double\");\n return x;\n}\n\n\/\/\/ e.g. id = \"--threads\", value = \"4\"\nstruct Option\n{\n string id;\n string value;\n template <typename T>\n T getValue() const\n {\n return (T) to_maxint(value);\n }\n};\n\n\/\/\/ Command-line options\nstd::map<string, OptionValues> optionMap;\n\nvoid initOptionMap()\n{\n optionMap[\"-a\"] = OPTION_ALPHA;\n optionMap[\"--alpha\"] = OPTION_ALPHA;\n optionMap[\"-d\"] = OPTION_DELEGLISE_RIVAT;\n optionMap[\"--deleglise_rivat\"] = OPTION_DELEGLISE_RIVAT;\n optionMap[\"--deleglise_rivat1\"] = OPTION_DELEGLISE_RIVAT1;\n optionMap[\"--deleglise_rivat2\"] = OPTION_DELEGLISE_RIVAT2;\n optionMap[\"--deleglise_rivat_parallel1\"] = OPTION_DELEGLISE_RIVAT_PARALLEL1;\n optionMap[\"--deleglise_rivat_parallel2\"] = OPTION_DELEGLISE_RIVAT_PARALLEL2;\n optionMap[\"--deleglise_rivat_parallel3\"] = OPTION_DELEGLISE_RIVAT_PARALLEL3;\n optionMap[\"-h\"] = OPTION_HELP;\n optionMap[\"--help\"] = OPTION_HELP;\n optionMap[\"--legendre\"] = OPTION_LEGENDRE;\n optionMap[\"--lehmer\"] = OPTION_LEHMER;\n optionMap[\"--lehmer2\"] = OPTION_LEHMER2;\n optionMap[\"-l\"] = OPTION_LMO;\n optionMap[\"--lmo\"] = OPTION_LMO;\n optionMap[\"--lmo1\"] = OPTION_LMO1;\n optionMap[\"--lmo2\"] = OPTION_LMO2;\n optionMap[\"--lmo3\"] = OPTION_LMO3;\n optionMap[\"--lmo4\"] = OPTION_LMO4;\n optionMap[\"--lmo5\"] = OPTION_LMO5;\n optionMap[\"--lmo_parallel1\"] = OPTION_LMO_PARALLEL1;\n optionMap[\"--lmo_parallel2\"] = OPTION_LMO_PARALLEL2;\n optionMap[\"--lmo_parallel3\"] = OPTION_LMO_PARALLEL3;\n optionMap[\"--Li\"] = OPTION_LI;\n optionMap[\"--Li_inverse\"] = OPTION_LIINV;\n optionMap[\"-m\"] = OPTION_MEISSEL;\n optionMap[\"--meissel\"] = OPTION_MEISSEL;\n optionMap[\"-n\"] = OPTION_NTHPRIME;\n optionMap[\"--nthprime\"] = OPTION_NTHPRIME;\n optionMap[\"--number\"] = OPTION_NUMBER;\n optionMap[\"--pi\"] = OPTION_PI;\n optionMap[\"-p\"] = OPTION_PRIMESIEVE;\n optionMap[\"--primesieve\"] = OPTION_PRIMESIEVE;\n optionMap[\"-s\"] = OPTION_STATUS;\n optionMap[\"--status\"] = OPTION_STATUS;\n optionMap[\"--test\"] = OPTION_TEST;\n optionMap[\"--time\"] = OPTION_TIME;\n optionMap[\"-t\"] = OPTION_THREADS;\n optionMap[\"--threads\"] = OPTION_THREADS;\n optionMap[\"-v\"] = OPTION_VERSION;\n optionMap[\"--version\"] = OPTION_VERSION;\n}\n\n\/\/\/ e.g. \"--threads=8\" -> { id = \"--threads\", value = \"8\" }\nOption makeOption(const string& str)\n{\n Option option;\n size_t delimiter = string::npos;\n if (optionMap.count(str) == 0)\n delimiter = str.find_first_of(\"=0123456789\");\n\n if (delimiter == string::npos)\n option.id = str;\n else\n {\n option.id = str.substr(0, delimiter);\n option.value = str.substr(delimiter + (str.at(delimiter) == '=' ? 1 : 0));\n }\n if (option.id.empty() && !option.value.empty())\n option.id = \"--number\";\n if (optionMap.count(option.id) == 0)\n option.id = \"--help\";\n\n return option;\n}\n\nPrimeCountOptions parseOptions(int argc, char** argv)\n{\n initOptionMap();\n PrimeCountOptions pco;\n std::vector<maxint_t> numbers;\n\n try\n {\n \/\/ iterate over the command-line options\n for (int i = 1; i < argc; i++)\n {\n Option option = makeOption(argv[i]);\n switch (optionMap[option.id])\n {\n case OPTION_ALPHA: set_alpha(to_double(option.value)); break;\n case OPTION_NUMBER: numbers.push_back(option.getValue<maxint_t>()); break;\n case OPTION_THREADS: pco.threads = option.getValue<int>(); break;\n case OPTION_HELP: help(); break;\n case OPTION_STATUS: set_print_status(true); pco.time = true; break;\n case OPTION_TIME: pco.time = true; break;\n case OPTION_TEST: if (test()) exit(0); exit(1);\n case OPTION_VERSION: version(); break;\n default: pco.option = optionMap[option.id];\n }\n }\n }\n catch (std::exception&)\n {\n help();\n }\n\n if (numbers.size() == 1)\n pco.x = numbers[0];\n else\n help();\n\n return pco;\n}\n\n} \/\/ namespace primecount\n<commit_msg>Add more options<commit_after>\/\/\/\n\/\/\/ @file cmdoptions.cpp\n\/\/\/ @brief Parse command-line options for the primecount console\n\/\/\/ (terminal) application.\n\/\/\/\n\/\/\/ Copyright (C) 2015 Kim Walisch, <kim.walisch@gmail.com>\n\/\/\/\n\/\/\/ This file is distributed under the BSD License. See the COPYING\n\/\/\/ file in the top level directory.\n\/\/\/\n\n#include \"cmdoptions.hpp\"\n#include <primecount-internal.hpp>\n#include <int128.hpp>\n\n#include <stdint.h>\n#include <vector>\n#include <string>\n#include <sstream>\n#include <map>\n#include <exception>\n#include <cstdlib>\n#include <cstddef>\n\nusing std::string;\nusing std::istringstream;\n\nnamespace primecount {\n\nvoid help();\nvoid version();\nbool test();\n\ndouble to_double(const string& s)\n{\n istringstream i(s);\n double x;\n if (!(i >> x))\n throw primecount_error(\"failed to convert \\\"\" + s + \"\\\" to double\");\n return x;\n}\n\n\/\/\/ e.g. id = \"--threads\", value = \"4\"\nstruct Option\n{\n string id;\n string value;\n template <typename T>\n T getValue() const\n {\n return (T) to_maxint(value);\n }\n};\n\n\/\/\/ Command-line options\nstd::map<string, OptionValues> optionMap;\n\nvoid initOptionMap()\n{\n optionMap[\"-a\"] = OPTION_ALPHA;\n optionMap[\"--alpha\"] = OPTION_ALPHA;\n optionMap[\"-d\"] = OPTION_DELEGLISE_RIVAT;\n optionMap[\"--deleglise_rivat\"] = OPTION_DELEGLISE_RIVAT;\n optionMap[\"--deleglise_rivat1\"] = OPTION_DELEGLISE_RIVAT1;\n optionMap[\"--deleglise_rivat2\"] = OPTION_DELEGLISE_RIVAT2;\n optionMap[\"--deleglise_rivat_parallel1\"] = OPTION_DELEGLISE_RIVAT_PARALLEL1;\n optionMap[\"--deleglise_rivat_parallel2\"] = OPTION_DELEGLISE_RIVAT_PARALLEL2;\n optionMap[\"--deleglise_rivat_parallel3\"] = OPTION_DELEGLISE_RIVAT_PARALLEL3;\n optionMap[\"-h\"] = OPTION_HELP;\n optionMap[\"--help\"] = OPTION_HELP;\n optionMap[\"--legendre\"] = OPTION_LEGENDRE;\n optionMap[\"--lehmer\"] = OPTION_LEHMER;\n optionMap[\"--lehmer2\"] = OPTION_LEHMER2;\n optionMap[\"-l\"] = OPTION_LMO;\n optionMap[\"--lmo\"] = OPTION_LMO;\n optionMap[\"--lmo1\"] = OPTION_LMO1;\n optionMap[\"--lmo2\"] = OPTION_LMO2;\n optionMap[\"--lmo3\"] = OPTION_LMO3;\n optionMap[\"--lmo4\"] = OPTION_LMO4;\n optionMap[\"--lmo5\"] = OPTION_LMO5;\n optionMap[\"--lmo_parallel1\"] = OPTION_LMO_PARALLEL1;\n optionMap[\"--lmo_parallel2\"] = OPTION_LMO_PARALLEL2;\n optionMap[\"--lmo_parallel3\"] = OPTION_LMO_PARALLEL3;\n optionMap[\"--Li\"] = OPTION_LI;\n optionMap[\"--Li_inverse\"] = OPTION_LIINV;\n optionMap[\"-m\"] = OPTION_MEISSEL;\n optionMap[\"--meissel\"] = OPTION_MEISSEL;\n optionMap[\"-n\"] = OPTION_NTHPRIME;\n optionMap[\"--nthprime\"] = OPTION_NTHPRIME;\n optionMap[\"--number\"] = OPTION_NUMBER;\n optionMap[\"--p2\"] = OPTION_P2;\n optionMap[\"--pi\"] = OPTION_PI;\n optionMap[\"-p\"] = OPTION_PRIMESIEVE;\n optionMap[\"--primesieve\"] = OPTION_PRIMESIEVE;\n optionMap[\"--s1\"] = OPTION_S1;\n optionMap[\"--s2_easy\"] = OPTION_S2_EASY;\n optionMap[\"--s2_hard\"] = OPTION_S2_HARD;\n optionMap[\"--s2_trivial\"] = OPTION_S2_TRIVIAL;\n optionMap[\"-s\"] = OPTION_STATUS;\n optionMap[\"--status\"] = OPTION_STATUS;\n optionMap[\"--test\"] = OPTION_TEST;\n optionMap[\"--time\"] = OPTION_TIME;\n optionMap[\"-t\"] = OPTION_THREADS;\n optionMap[\"--threads\"] = OPTION_THREADS;\n optionMap[\"-v\"] = OPTION_VERSION;\n optionMap[\"--version\"] = OPTION_VERSION;\n}\n\n\/\/\/ e.g. \"--threads=8\" -> { id = \"--threads\", value = \"8\" }\nOption makeOption(const string& str)\n{\n Option option;\n size_t delimiter = string::npos;\n if (optionMap.count(str) == 0)\n delimiter = str.find_first_of(\"=0123456789\");\n\n if (delimiter == string::npos)\n option.id = str;\n else\n {\n option.id = str.substr(0, delimiter);\n option.value = str.substr(delimiter + (str.at(delimiter) == '=' ? 1 : 0));\n }\n if (option.id.empty() && !option.value.empty())\n option.id = \"--number\";\n if (optionMap.count(option.id) == 0)\n option.id = \"--help\";\n\n return option;\n}\n\nPrimeCountOptions parseOptions(int argc, char** argv)\n{\n initOptionMap();\n PrimeCountOptions pco;\n std::vector<maxint_t> numbers;\n\n try\n {\n \/\/ iterate over the command-line options\n for (int i = 1; i < argc; i++)\n {\n Option option = makeOption(argv[i]);\n switch (optionMap[option.id])\n {\n case OPTION_ALPHA: set_alpha(to_double(option.value)); break;\n case OPTION_NUMBER: numbers.push_back(option.getValue<maxint_t>()); break;\n case OPTION_THREADS: pco.threads = option.getValue<int>(); break;\n case OPTION_HELP: help(); break;\n case OPTION_STATUS: set_print_status(true); pco.time = true; break;\n case OPTION_TIME: pco.time = true; break;\n case OPTION_TEST: if (test()) exit(0); exit(1);\n case OPTION_VERSION: version(); break;\n default: pco.option = optionMap[option.id];\n }\n }\n }\n catch (std::exception&)\n {\n help();\n }\n\n if (numbers.size() == 1)\n pco.x = numbers[0];\n else\n help();\n\n return pco;\n}\n\n} \/\/ namespace primecount\n<|endoftext|>"} {"text":"<commit_before>#include \"app\/view\/arena.h\"\n\n#include \"core\/base\/bean_factory.h\"\n#include \"core\/util\/bean_utils.h\"\n#include \"core\/util\/holder_util.h\"\n#include \"core\/util\/log.h\"\n\n#include \"graphics\/base\/layer.h\"\n#include \"graphics\/base\/render_layer.h\"\n\n#include \"app\/base\/application_context.h\"\n#include \"app\/impl\/event_listener\/event_listener_list.h\"\n\n\nnamespace ark {\n\nArena::Arena(const sp<ViewGroup>& view, const sp<ResourceLoader>& resourceLoader)\n : _event_listeners(new EventListenerList()), _view_group(view), _resource_loader(resourceLoader)\n{\n DCHECK(_view_group, \"Arena's renderer delegate must be ViewGroup\");\n}\n\nArena::~Arena()\n{\n LOGD(\"\");\n}\n\nvoid Arena::addRenderer(const sp<Renderer>& renderer)\n{\n DASSERT(_view_group);\n _view_group->addRenderer(renderer);\n}\n\nvoid Arena::render(RenderRequest& renderRequest, const V3& position)\n{\n DASSERT(_view_group);\n _view_group->render(renderRequest, position);\n for(const sp<Renderer>& i : _layers.update(renderRequest.timestamp()))\n i->render(renderRequest, position);\n}\n\nbool Arena::onEvent(const Event& event)\n{\n DASSERT(_view_group);\n return _view_group->onEvent(event, 0.0f, 0.0f, true) || _event_listeners->onEvent(event);\n}\n\nvoid Arena::traverse(const Holder::Visitor& visitor)\n{\n HolderUtil::visit(_view_group, visitor);\n for(const auto& i : _layers.items())\n HolderUtil::visit(i._item, visitor);\n}\n\nsp<Renderer> Arena::loadRenderer(const String& name, const Scope& args)\n{\n const sp<Renderer> renderer = load<Renderer>(name, args);\n addRenderer(renderer);\n return renderer;\n}\n\nBox Arena::getReference(const String& id) const\n{\n return _resource_loader->refs()->get(id);\n}\n\nconst sp<ResourceLoader>& Arena::resourceLoader() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader;\n}\n\nsp<BoxBundle> Arena::refs() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->refs();\n}\n\nsp<BoxBundle> Arena::layers() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->layers();\n}\n\nsp<BoxBundle> Arena::renderLayers() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->renderLayers();\n}\n\nsp<BoxBundle> Arena::packages() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->packages();\n}\n\nvoid Arena::addEventListener(const sp<EventListener>& eventListener, int32_t priority)\n{\n _event_listeners->addEventListener(eventListener, priority);\n}\n\nvoid Arena::addLayer(const sp<Renderer>& layer)\n{\n _layers.push_back(layer);\n}\n\nvoid Arena::setView(const sp<Renderer>& view)\n{\n DCHECK(view.is<ViewGroup>(), \"Arena's renderer delegate must be ViewGroup\");\n _view_group = view.as<ViewGroup>();\n}\n\nconst sp<ViewGroup>& Arena::view() const\n{\n return _view_group;\n}\n\ntemplate<typename T> void addDecoratedLayer(Arena& arena, BeanFactory& factory, const document& manifest, const Scope& args)\n{\n const sp<Renderer> layer = factory.build<Renderer>(manifest, args);\n if(layer)\n arena.addLayer(layer);\n else\n arena.addLayer(factory.ensureDecorated<Renderer, T>(manifest, args));\n}\n\nArena::BUILDER::BUILDER(BeanFactory& factory, const document& manifest)\n : _factory(factory), _manifest(manifest), _resource_loader(factory.getBuilder<ResourceLoader>(manifest, \"resource-loader\")),\n _layout(factory.getBuilder<Layout>(manifest, Constants::Attributes::LAYOUT)),\n _layout_param(factory.ensureBuilder<LayoutParam>(manifest)),\n _background(Documents::getAttribute(manifest, Constants::Attributes::BACKGROUND)),\n _view(Documents::getAttribute(manifest, Constants::Attributes::VIEW))\n{\n}\n\nsp<Arena> Arena::BUILDER::build(const Scope& args)\n{\n const sp<ResourceLoader> r1 = _resource_loader->build(args);\n const sp<ResourceLoader> resourceLoader = r1 ? r1 : sp<ResourceLoader>::make(_factory);\n const sp<Renderer> background = _background.empty() ? nullptr : resourceLoader->load<Renderer>(_background, args);\n const sp<Renderer> view = _view ? resourceLoader->load<Renderer>(_view, args) : nullptr;\n DCHECK(view || background, \"Either \\\"view\\\" or \\\"background\\\" must be specified\");\n const sp<Arena> arena = sp<Arena>::make(view ? view : sp<ViewGroup>::make(background, _layout->build(args), nullptr, _layout_param->build(args)).cast<Renderer>(), resourceLoader);\n\n BeanFactory& factory = resourceLoader->beanFactory();\n for(const document& i : _manifest->children())\n {\n const String& name = i->name();\n if(name == Constants::Attributes::EVENT_LISTENER)\n arena->addEventListener(factory.ensure<EventListener>(i, args));\n else if(name == Constants::Attributes::RENDER_LAYER)\n addDecoratedLayer<RenderLayer>(arena, factory, i, args);\n else if(name == Constants::Attributes::LAYER)\n addDecoratedLayer<Layer>(arena, factory, i, args);\n else\n {\n DWARN(name == Constants::Attributes::RENDERER || name == Constants::Attributes::VIEW, \"[Renderer, RenderLayer, Layer, View] expected, \\\"%s\\\" found\", name.c_str());\n arena->addRenderer(factory.ensure<Renderer>(i, args));\n }\n }\n return arena;\n}\n\n}\n<commit_msg>Update arena.cpp<commit_after>#include \"app\/view\/arena.h\"\n\n#include \"core\/base\/bean_factory.h\"\n#include \"core\/util\/bean_utils.h\"\n#include \"core\/util\/holder_util.h\"\n#include \"core\/util\/log.h\"\n\n#include \"graphics\/base\/layer.h\"\n#include \"graphics\/base\/render_layer.h\"\n\n#include \"app\/base\/application_context.h\"\n#include \"app\/impl\/event_listener\/event_listener_list.h\"\n\n\nnamespace ark {\n\nArena::Arena(const sp<ViewGroup>& view, const sp<ResourceLoader>& resourceLoader)\n : _event_listeners(new EventListenerList()), _view_group(view), _resource_loader(resourceLoader)\n{\n DCHECK(_view_group, \"Arena's renderer delegate must be ViewGroup\");\n}\n\nArena::~Arena()\n{\n LOGD(\"\");\n}\n\nvoid Arena::addRenderer(const sp<Renderer>& renderer)\n{\n DASSERT(_view_group);\n _view_group->addRenderer(renderer);\n}\n\nvoid Arena::render(RenderRequest& renderRequest, const V3& position)\n{\n DASSERT(_view_group);\n _view_group->render(renderRequest, position);\n for(const sp<Renderer>& i : _layers.update(renderRequest.timestamp()))\n i->render(renderRequest, position);\n}\n\nbool Arena::onEvent(const Event& event)\n{\n DASSERT(_view_group);\n return _view_group->onEvent(event, 0.0f, 0.0f, true) || _event_listeners->onEvent(event);\n}\n\nvoid Arena::traverse(const Holder::Visitor& visitor)\n{\n HolderUtil::visit(_view_group, visitor);\n for(const auto& i : _layers.items())\n HolderUtil::visit(i._item, visitor);\n}\n\nsp<Renderer> Arena::loadRenderer(const String& name, const Scope& args)\n{\n const sp<Renderer> renderer = load<Renderer>(name, args);\n addRenderer(renderer);\n return renderer;\n}\n\nBox Arena::getReference(const String& id) const\n{\n return _resource_loader->refs()->get(id);\n}\n\nconst sp<ResourceLoader>& Arena::resourceLoader() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader;\n}\n\nsp<BoxBundle> Arena::refs() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->refs();\n}\n\nsp<BoxBundle> Arena::layers() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->layers();\n}\n\nsp<BoxBundle> Arena::renderLayers() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->renderLayers();\n}\n\nsp<BoxBundle> Arena::packages() const\n{\n DCHECK(_resource_loader, \"Trying to get ResourceLoader on a disposed Arena\");\n return _resource_loader->packages();\n}\n\nvoid Arena::addEventListener(const sp<EventListener>& eventListener, int32_t priority)\n{\n _event_listeners->addEventListener(eventListener, priority);\n}\n\nvoid Arena::addLayer(const sp<Renderer>& layer)\n{\n _layers.push_back(layer);\n}\n\nvoid Arena::setView(const sp<Renderer>& view)\n{\n DCHECK(view.is<ViewGroup>(), \"Arena's renderer delegate must be ViewGroup\");\n _view_group = view.as<ViewGroup>();\n}\n\nconst sp<ViewGroup>& Arena::view() const\n{\n return _view_group;\n}\n\ntemplate<typename T> void addDecoratedLayer(Arena& arena, BeanFactory& factory, const document& manifest, const Scope& args)\n{\n const sp<Renderer> layer = factory.build<Renderer>(manifest, args);\n if(layer)\n arena.addLayer(layer);\n else\n arena.addLayer(factory.ensureDecorated<Renderer, T>(manifest, args));\n}\n\nArena::BUILDER::BUILDER(BeanFactory& factory, const document& manifest)\n : _factory(factory), _manifest(manifest), _resource_loader(factory.getBuilder<ResourceLoader>(manifest, \"resource-loader\")),\n _layout(factory.getBuilder<Layout>(manifest, Constants::Attributes::LAYOUT)),\n _layout_param(factory.ensureBuilder<LayoutParam>(manifest)),\n _background(Documents::getAttribute(manifest, Constants::Attributes::BACKGROUND)),\n _view(Documents::getAttribute(manifest, Constants::Attributes::VIEW))\n{\n}\n\nsp<Arena> Arena::BUILDER::build(const Scope& args)\n{\n const sp<ResourceLoader> r1 = _resource_loader->build(args);\n const sp<ResourceLoader> resourceLoader = r1 ? r1 : sp<ResourceLoader>::make(_factory);\n const sp<Renderer> background = _background.empty() ? nullptr : resourceLoader->load<Renderer>(_background, args);\n const sp<Renderer> view = _view ? resourceLoader->load<Renderer>(_view, args) : nullptr;\n const sp<Arena> arena = sp<Arena>::make(view ? view : sp<ViewGroup>::make(background, _layout->build(args), nullptr, _layout_param->build(args)).cast<Renderer>(), resourceLoader);\n\n BeanFactory& factory = resourceLoader->beanFactory();\n for(const document& i : _manifest->children())\n {\n const String& name = i->name();\n if(name == Constants::Attributes::EVENT_LISTENER)\n arena->addEventListener(factory.ensure<EventListener>(i, args));\n else if(name == Constants::Attributes::RENDER_LAYER)\n addDecoratedLayer<RenderLayer>(arena, factory, i, args);\n else if(name == Constants::Attributes::LAYER)\n addDecoratedLayer<Layer>(arena, factory, i, args);\n else\n {\n DWARN(name == Constants::Attributes::RENDERER || name == Constants::Attributes::VIEW, \"[Renderer, RenderLayer, Layer, View] expected, \\\"%s\\\" found\", name.c_str());\n arena->addRenderer(factory.ensure<Renderer>(i, args));\n }\n }\n return arena;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2007 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"arch\/x86\/faults.hh\"\n\n#include \"arch\/x86\/generated\/decoder.hh\"\n#include \"arch\/x86\/insts\/static_inst.hh\"\n#include \"arch\/x86\/mmu.hh\"\n#include \"arch\/x86\/regs\/misc.hh\"\n#include \"base\/loader\/symtab.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/thread_context.hh\"\n#include \"debug\/Faults.hh\"\n#include \"sim\/full_system.hh\"\n#include \"sim\/process.hh\"\n\nnamespace gem5\n{\n\nnamespace X86ISA\n{\n\nvoid\nX86FaultBase::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (!FullSystem) {\n FaultBase::invoke(tc, inst);\n return;\n }\n\n PCState pc = tc->pcState().as<PCState>();\n DPRINTF(Faults, \"RIP %#x: vector %d: %s\\n\", pc.pc(), vector, describe());\n using namespace X86ISAInst::rom_labels;\n HandyM5Reg m5reg = tc->readMiscRegNoEffect(MISCREG_M5_REG);\n MicroPC entry;\n if (m5reg.mode == LongMode) {\n entry = extern_label_longModeInterrupt;\n } else {\n if (m5reg.submode == RealMode)\n entry = extern_label_realModeInterrupt;\n else\n entry = extern_label_legacyModeInterrupt;\n }\n tc->setIntReg(INTREG_MICRO(1), vector);\n tc->setIntReg(INTREG_MICRO(7), pc.pc());\n if (errorCode != (uint64_t)(-1)) {\n if (m5reg.mode == LongMode) {\n entry = extern_label_longModeInterruptWithError;\n } else {\n panic(\"Legacy mode interrupts with error codes \"\n \"aren't implemented.\");\n }\n tc->setIntReg(INTREG_MICRO(15), errorCode);\n }\n pc.upc(romMicroPC(entry));\n pc.nupc(romMicroPC(entry) + 1);\n tc->pcState(pc);\n}\n\nstd::string\nX86FaultBase::describe() const\n{\n std::stringstream ss;\n ccprintf(ss, \"%s\", mnemonic());\n if (errorCode != (uint64_t)(-1))\n ccprintf(ss, \"(%#x)\", errorCode);\n\n return ss.str();\n}\n\nvoid\nX86Trap::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n \/\/ This is the same as a fault, but it happens -after- the\n \/\/ instruction.\n X86FaultBase::invoke(tc);\n}\n\nvoid\nX86Abort::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n panic(\"Abort exception!\");\n}\n\nvoid\nInvalidOpcode::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (FullSystem) {\n X86Fault::invoke(tc, inst);\n } else {\n auto *xsi = static_cast<X86StaticInst *>(inst.get());\n panic(\"Unrecognized\/invalid instruction executed:\\n %s\",\n xsi->machInst);\n }\n}\n\nvoid\nPageFault::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (FullSystem) {\n \/\/ Invalidate any matching TLB entries before handling the page fault.\n tc->getMMUPtr()->demapPage(addr, 0);\n HandyM5Reg m5reg = tc->readMiscRegNoEffect(MISCREG_M5_REG);\n X86FaultBase::invoke(tc);\n \/\/ If something bad happens while trying to enter the page fault\n \/\/ handler, I'm pretty sure that's a double fault and then all\n \/\/ bets are off. That means it should be safe to update this\n \/\/ state now.\n if (m5reg.mode == LongMode)\n tc->setMiscReg(MISCREG_CR2, addr);\n else\n tc->setMiscReg(MISCREG_CR2, (uint32_t)addr);\n } else if (!tc->getProcessPtr()->fixupFault(addr)) {\n PageFaultErrorCode code = errorCode;\n const char *modeStr = \"\";\n if (code.fetch)\n modeStr = \"execute\";\n else if (code.write)\n modeStr = \"write\";\n else\n modeStr = \"read\";\n\n \/\/ print information about what we are panic'ing on\n if (!inst) {\n panic(\"Tried to %s unmapped address %#x.\", modeStr, addr);\n } else {\n panic(\"Tried to %s unmapped address %#x.\\nPC: %#x, Instr: %s\",\n modeStr, addr, tc->pcState(),\n inst->disassemble(tc->pcState().instAddr(),\n &loader::debugSymbolTable));\n }\n }\n}\n\nstd::string\nPageFault::describe() const\n{\n std::stringstream ss;\n ccprintf(ss, \"%s at %#x\", X86FaultBase::describe(), addr);\n return ss.str();\n}\n\nvoid\nInitInterrupt::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n DPRINTF(Faults, \"Init interrupt.\\n\");\n \/\/ The otherwise unmodified integer registers should be set to 0.\n for (int index = 0; index < NUM_ARCH_INTREGS; index++) {\n tc->setIntReg(index, 0);\n }\n\n CR0 cr0 = tc->readMiscReg(MISCREG_CR0);\n CR0 newCR0 = 1 << 4;\n newCR0.cd = cr0.cd;\n newCR0.nw = cr0.nw;\n tc->setMiscReg(MISCREG_CR0, newCR0);\n tc->setMiscReg(MISCREG_CR2, 0);\n tc->setMiscReg(MISCREG_CR3, 0);\n tc->setMiscReg(MISCREG_CR4, 0);\n\n tc->setMiscReg(MISCREG_RFLAGS, 0x0000000000000002ULL);\n\n tc->setMiscReg(MISCREG_EFER, 0);\n\n SegAttr dataAttr = 0;\n dataAttr.dpl = 0;\n dataAttr.unusable = 0;\n dataAttr.defaultSize = 0;\n dataAttr.longMode = 0;\n dataAttr.avl = 0;\n dataAttr.granularity = 0;\n dataAttr.present = 1;\n dataAttr.type = 3;\n dataAttr.writable = 1;\n dataAttr.readable = 1;\n dataAttr.expandDown = 0;\n dataAttr.system = 1;\n\n for (int seg = 0; seg != NUM_SEGMENTREGS; seg++) {\n tc->setMiscReg(MISCREG_SEG_SEL(seg), 0);\n tc->setMiscReg(MISCREG_SEG_BASE(seg), 0);\n tc->setMiscReg(MISCREG_SEG_EFF_BASE(seg), 0);\n tc->setMiscReg(MISCREG_SEG_LIMIT(seg), 0xffff);\n tc->setMiscReg(MISCREG_SEG_ATTR(seg), dataAttr);\n }\n\n SegAttr codeAttr = 0;\n codeAttr.dpl = 0;\n codeAttr.unusable = 0;\n codeAttr.defaultSize = 0;\n codeAttr.longMode = 0;\n codeAttr.avl = 0;\n codeAttr.granularity = 0;\n codeAttr.present = 1;\n codeAttr.type = 10;\n codeAttr.writable = 0;\n codeAttr.readable = 1;\n codeAttr.expandDown = 0;\n codeAttr.system = 1;\n\n tc->setMiscReg(MISCREG_CS, 0xf000);\n tc->setMiscReg(MISCREG_CS_BASE,\n 0x00000000ffff0000ULL);\n tc->setMiscReg(MISCREG_CS_EFF_BASE,\n 0x00000000ffff0000ULL);\n \/\/ This has the base value pre-added.\n tc->setMiscReg(MISCREG_CS_LIMIT, 0xffffffff);\n tc->setMiscReg(MISCREG_CS_ATTR, codeAttr);\n\n PCState pc(0x000000000000fff0ULL + tc->readMiscReg(MISCREG_CS_BASE));\n tc->pcState(pc);\n\n tc->setMiscReg(MISCREG_TSG_BASE, 0);\n tc->setMiscReg(MISCREG_TSG_LIMIT, 0xffff);\n\n tc->setMiscReg(MISCREG_IDTR_BASE, 0);\n tc->setMiscReg(MISCREG_IDTR_LIMIT, 0xffff);\n\n SegAttr tslAttr = 0;\n tslAttr.unusable = 1;\n tslAttr.present = 1;\n tslAttr.type = 2; \/\/ LDT\n tc->setMiscReg(MISCREG_TSL, 0);\n tc->setMiscReg(MISCREG_TSL_BASE, 0);\n tc->setMiscReg(MISCREG_TSL_LIMIT, 0xffff);\n tc->setMiscReg(MISCREG_TSL_ATTR, tslAttr);\n\n SegAttr trAttr = 0;\n trAttr.unusable = 0;\n trAttr.present = 1;\n trAttr.type = 3; \/\/ Busy 16-bit TSS\n tc->setMiscReg(MISCREG_TR, 0);\n tc->setMiscReg(MISCREG_TR_BASE, 0);\n tc->setMiscReg(MISCREG_TR_LIMIT, 0xffff);\n tc->setMiscReg(MISCREG_TR_ATTR, trAttr);\n\n \/\/ This value should be the family\/model\/stepping of the processor.\n \/\/ (page 418). It should be consistent with the value from CPUID, but\n \/\/ the actual value probably doesn't matter much.\n tc->setIntReg(INTREG_RDX, 0);\n\n tc->setMiscReg(MISCREG_DR0, 0);\n tc->setMiscReg(MISCREG_DR1, 0);\n tc->setMiscReg(MISCREG_DR2, 0);\n tc->setMiscReg(MISCREG_DR3, 0);\n\n tc->setMiscReg(MISCREG_DR6, 0x00000000ffff0ff0ULL);\n tc->setMiscReg(MISCREG_DR7, 0x0000000000000400ULL);\n\n tc->setMiscReg(MISCREG_MXCSR, 0x1f80);\n\n \/\/ Flag all elements on the x87 stack as empty.\n tc->setMiscReg(MISCREG_FTW, 0xFFFF);\n\n \/\/ Update the handy M5 Reg.\n tc->setMiscReg(MISCREG_M5_REG, 0);\n MicroPC entry = X86ISAInst::rom_labels::extern_label_initIntHalt;\n pc.upc(romMicroPC(entry));\n pc.nupc(romMicroPC(entry) + 1);\n tc->pcState(pc);\n}\n\nvoid\nStartupInterrupt::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n DPRINTF(Faults, \"Startup interrupt with vector %#x.\\n\", vector);\n HandyM5Reg m5Reg = tc->readMiscReg(MISCREG_M5_REG);\n if (m5Reg.mode != LegacyMode || m5Reg.submode != RealMode) {\n panic(\"Startup IPI recived outside of real mode. \"\n \"Don't know what to do. %d, %d\", m5Reg.mode, m5Reg.submode);\n }\n\n tc->setMiscReg(MISCREG_CS, vector << 8);\n tc->setMiscReg(MISCREG_CS_BASE, vector << 12);\n tc->setMiscReg(MISCREG_CS_EFF_BASE, vector << 12);\n \/\/ This has the base value pre-added.\n tc->setMiscReg(MISCREG_CS_LIMIT, 0xffff);\n\n tc->pcState(tc->readMiscReg(MISCREG_CS_BASE));\n}\n\n} \/\/ namespace X86ISA\n} \/\/ namespace gem5\n<commit_msg>arch-x86: Subtract the base from the PC when entering faults.<commit_after>\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2007 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"arch\/x86\/faults.hh\"\n\n#include \"arch\/x86\/generated\/decoder.hh\"\n#include \"arch\/x86\/insts\/static_inst.hh\"\n#include \"arch\/x86\/mmu.hh\"\n#include \"arch\/x86\/regs\/misc.hh\"\n#include \"base\/loader\/symtab.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/thread_context.hh\"\n#include \"debug\/Faults.hh\"\n#include \"sim\/full_system.hh\"\n#include \"sim\/process.hh\"\n\nnamespace gem5\n{\n\nnamespace X86ISA\n{\n\nvoid\nX86FaultBase::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (!FullSystem) {\n FaultBase::invoke(tc, inst);\n return;\n }\n\n PCState pc = tc->pcState().as<PCState>();\n DPRINTF(Faults, \"RIP %#x: vector %d: %s\\n\", pc.pc(), vector, describe());\n using namespace X86ISAInst::rom_labels;\n HandyM5Reg m5reg = tc->readMiscRegNoEffect(MISCREG_M5_REG);\n MicroPC entry;\n if (m5reg.mode == LongMode) {\n entry = extern_label_longModeInterrupt;\n } else {\n if (m5reg.submode == RealMode)\n entry = extern_label_realModeInterrupt;\n else\n entry = extern_label_legacyModeInterrupt;\n }\n tc->setIntReg(INTREG_MICRO(1), vector);\n Addr cs_base = tc->readMiscRegNoEffect(MISCREG_CS_EFF_BASE);\n tc->setIntReg(INTREG_MICRO(7), pc.pc() - cs_base);\n if (errorCode != (uint64_t)(-1)) {\n if (m5reg.mode == LongMode) {\n entry = extern_label_longModeInterruptWithError;\n } else {\n panic(\"Legacy mode interrupts with error codes \"\n \"aren't implemented.\");\n }\n tc->setIntReg(INTREG_MICRO(15), errorCode);\n }\n pc.upc(romMicroPC(entry));\n pc.nupc(romMicroPC(entry) + 1);\n tc->pcState(pc);\n}\n\nstd::string\nX86FaultBase::describe() const\n{\n std::stringstream ss;\n ccprintf(ss, \"%s\", mnemonic());\n if (errorCode != (uint64_t)(-1))\n ccprintf(ss, \"(%#x)\", errorCode);\n\n return ss.str();\n}\n\nvoid\nX86Trap::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n \/\/ This is the same as a fault, but it happens -after- the\n \/\/ instruction.\n X86FaultBase::invoke(tc);\n}\n\nvoid\nX86Abort::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n panic(\"Abort exception!\");\n}\n\nvoid\nInvalidOpcode::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (FullSystem) {\n X86Fault::invoke(tc, inst);\n } else {\n auto *xsi = static_cast<X86StaticInst *>(inst.get());\n panic(\"Unrecognized\/invalid instruction executed:\\n %s\",\n xsi->machInst);\n }\n}\n\nvoid\nPageFault::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n if (FullSystem) {\n \/\/ Invalidate any matching TLB entries before handling the page fault.\n tc->getMMUPtr()->demapPage(addr, 0);\n HandyM5Reg m5reg = tc->readMiscRegNoEffect(MISCREG_M5_REG);\n X86FaultBase::invoke(tc);\n \/\/ If something bad happens while trying to enter the page fault\n \/\/ handler, I'm pretty sure that's a double fault and then all\n \/\/ bets are off. That means it should be safe to update this\n \/\/ state now.\n if (m5reg.mode == LongMode)\n tc->setMiscReg(MISCREG_CR2, addr);\n else\n tc->setMiscReg(MISCREG_CR2, (uint32_t)addr);\n } else if (!tc->getProcessPtr()->fixupFault(addr)) {\n PageFaultErrorCode code = errorCode;\n const char *modeStr = \"\";\n if (code.fetch)\n modeStr = \"execute\";\n else if (code.write)\n modeStr = \"write\";\n else\n modeStr = \"read\";\n\n \/\/ print information about what we are panic'ing on\n if (!inst) {\n panic(\"Tried to %s unmapped address %#x.\", modeStr, addr);\n } else {\n panic(\"Tried to %s unmapped address %#x.\\nPC: %#x, Instr: %s\",\n modeStr, addr, tc->pcState(),\n inst->disassemble(tc->pcState().instAddr(),\n &loader::debugSymbolTable));\n }\n }\n}\n\nstd::string\nPageFault::describe() const\n{\n std::stringstream ss;\n ccprintf(ss, \"%s at %#x\", X86FaultBase::describe(), addr);\n return ss.str();\n}\n\nvoid\nInitInterrupt::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n DPRINTF(Faults, \"Init interrupt.\\n\");\n \/\/ The otherwise unmodified integer registers should be set to 0.\n for (int index = 0; index < NUM_ARCH_INTREGS; index++) {\n tc->setIntReg(index, 0);\n }\n\n CR0 cr0 = tc->readMiscReg(MISCREG_CR0);\n CR0 newCR0 = 1 << 4;\n newCR0.cd = cr0.cd;\n newCR0.nw = cr0.nw;\n tc->setMiscReg(MISCREG_CR0, newCR0);\n tc->setMiscReg(MISCREG_CR2, 0);\n tc->setMiscReg(MISCREG_CR3, 0);\n tc->setMiscReg(MISCREG_CR4, 0);\n\n tc->setMiscReg(MISCREG_RFLAGS, 0x0000000000000002ULL);\n\n tc->setMiscReg(MISCREG_EFER, 0);\n\n SegAttr dataAttr = 0;\n dataAttr.dpl = 0;\n dataAttr.unusable = 0;\n dataAttr.defaultSize = 0;\n dataAttr.longMode = 0;\n dataAttr.avl = 0;\n dataAttr.granularity = 0;\n dataAttr.present = 1;\n dataAttr.type = 3;\n dataAttr.writable = 1;\n dataAttr.readable = 1;\n dataAttr.expandDown = 0;\n dataAttr.system = 1;\n\n for (int seg = 0; seg != NUM_SEGMENTREGS; seg++) {\n tc->setMiscReg(MISCREG_SEG_SEL(seg), 0);\n tc->setMiscReg(MISCREG_SEG_BASE(seg), 0);\n tc->setMiscReg(MISCREG_SEG_EFF_BASE(seg), 0);\n tc->setMiscReg(MISCREG_SEG_LIMIT(seg), 0xffff);\n tc->setMiscReg(MISCREG_SEG_ATTR(seg), dataAttr);\n }\n\n SegAttr codeAttr = 0;\n codeAttr.dpl = 0;\n codeAttr.unusable = 0;\n codeAttr.defaultSize = 0;\n codeAttr.longMode = 0;\n codeAttr.avl = 0;\n codeAttr.granularity = 0;\n codeAttr.present = 1;\n codeAttr.type = 10;\n codeAttr.writable = 0;\n codeAttr.readable = 1;\n codeAttr.expandDown = 0;\n codeAttr.system = 1;\n\n tc->setMiscReg(MISCREG_CS, 0xf000);\n tc->setMiscReg(MISCREG_CS_BASE,\n 0x00000000ffff0000ULL);\n tc->setMiscReg(MISCREG_CS_EFF_BASE,\n 0x00000000ffff0000ULL);\n \/\/ This has the base value pre-added.\n tc->setMiscReg(MISCREG_CS_LIMIT, 0xffffffff);\n tc->setMiscReg(MISCREG_CS_ATTR, codeAttr);\n\n PCState pc(0x000000000000fff0ULL + tc->readMiscReg(MISCREG_CS_BASE));\n tc->pcState(pc);\n\n tc->setMiscReg(MISCREG_TSG_BASE, 0);\n tc->setMiscReg(MISCREG_TSG_LIMIT, 0xffff);\n\n tc->setMiscReg(MISCREG_IDTR_BASE, 0);\n tc->setMiscReg(MISCREG_IDTR_LIMIT, 0xffff);\n\n SegAttr tslAttr = 0;\n tslAttr.unusable = 1;\n tslAttr.present = 1;\n tslAttr.type = 2; \/\/ LDT\n tc->setMiscReg(MISCREG_TSL, 0);\n tc->setMiscReg(MISCREG_TSL_BASE, 0);\n tc->setMiscReg(MISCREG_TSL_LIMIT, 0xffff);\n tc->setMiscReg(MISCREG_TSL_ATTR, tslAttr);\n\n SegAttr trAttr = 0;\n trAttr.unusable = 0;\n trAttr.present = 1;\n trAttr.type = 3; \/\/ Busy 16-bit TSS\n tc->setMiscReg(MISCREG_TR, 0);\n tc->setMiscReg(MISCREG_TR_BASE, 0);\n tc->setMiscReg(MISCREG_TR_LIMIT, 0xffff);\n tc->setMiscReg(MISCREG_TR_ATTR, trAttr);\n\n \/\/ This value should be the family\/model\/stepping of the processor.\n \/\/ (page 418). It should be consistent with the value from CPUID, but\n \/\/ the actual value probably doesn't matter much.\n tc->setIntReg(INTREG_RDX, 0);\n\n tc->setMiscReg(MISCREG_DR0, 0);\n tc->setMiscReg(MISCREG_DR1, 0);\n tc->setMiscReg(MISCREG_DR2, 0);\n tc->setMiscReg(MISCREG_DR3, 0);\n\n tc->setMiscReg(MISCREG_DR6, 0x00000000ffff0ff0ULL);\n tc->setMiscReg(MISCREG_DR7, 0x0000000000000400ULL);\n\n tc->setMiscReg(MISCREG_MXCSR, 0x1f80);\n\n \/\/ Flag all elements on the x87 stack as empty.\n tc->setMiscReg(MISCREG_FTW, 0xFFFF);\n\n \/\/ Update the handy M5 Reg.\n tc->setMiscReg(MISCREG_M5_REG, 0);\n MicroPC entry = X86ISAInst::rom_labels::extern_label_initIntHalt;\n pc.upc(romMicroPC(entry));\n pc.nupc(romMicroPC(entry) + 1);\n tc->pcState(pc);\n}\n\nvoid\nStartupInterrupt::invoke(ThreadContext *tc, const StaticInstPtr &inst)\n{\n DPRINTF(Faults, \"Startup interrupt with vector %#x.\\n\", vector);\n HandyM5Reg m5Reg = tc->readMiscReg(MISCREG_M5_REG);\n if (m5Reg.mode != LegacyMode || m5Reg.submode != RealMode) {\n panic(\"Startup IPI recived outside of real mode. \"\n \"Don't know what to do. %d, %d\", m5Reg.mode, m5Reg.submode);\n }\n\n tc->setMiscReg(MISCREG_CS, vector << 8);\n tc->setMiscReg(MISCREG_CS_BASE, vector << 12);\n tc->setMiscReg(MISCREG_CS_EFF_BASE, vector << 12);\n \/\/ This has the base value pre-added.\n tc->setMiscReg(MISCREG_CS_LIMIT, 0xffff);\n\n tc->pcState(tc->readMiscReg(MISCREG_CS_BASE));\n}\n\n} \/\/ namespace X86ISA\n} \/\/ namespace gem5\n<|endoftext|>"} {"text":"<commit_before>\/*\n * illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of illarionserver.\n *\n * illarionserver is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * illarionserver is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Character.hpp\"\n#include \"Player.hpp\"\n#include \"globals.hpp\"\n#include <luabind\/adopt_policy.hpp>\n#include <luabind\/out_value_policy.hpp>\n#include <script\/forwarder.hpp>\n#include <data\/Data.hpp>\n#include \"script\/binding\/binding.hpp\"\n\nnamespace binding {\n\n luabind::scope character() {\n using ::position;\n\n luabind::value_vector skills;\n\n for (const auto &skill: Data::Skills) {\n skills.push_back(luabind::value(skill.second.serverName.c_str(), skill.first));\n }\n\n luabind::value_vector races;\n\n for (const auto &race: Data::Races) {\n races.push_back(luabind::value(race.second.serverName.c_str(), race.first));\n }\n\n return luabind::class_<Character>(\"Character\")\n .def(\"isNewPlayer\", &Character::isNewPlayer)\n .def(\"pageGM\", &Character::pageGM)\n .def(\"requestInputDialog\", &Character::requestInputDialog, luabind::adopt(_2))\n .def(\"requestMessageDialog\", &Character::requestMessageDialog, luabind::adopt(_2))\n .def(\"requestMerchantDialog\", &Character::requestMerchantDialog, luabind::adopt(_2))\n .def(\"requestSelectionDialog\", &Character::requestSelectionDialog, luabind::adopt(_2))\n .def(\"requestCraftingDialog\", &Character::requestCraftingDialog, luabind::adopt(_2))\n .def(\"idleTime\", &Character::idleTime)\n .def(\"sendBook\", &Character::sendBook)\n .def(\"updateAppearance\", &Character::forceUpdateAppearanceForAll)\n .def(\"performAnimation\", &Character::performAnimation)\n .def(\"alterSpokenMessage\", &Character::alterSpokenMessage)\n .def(\"actionRunning\", &Character::actionRunning)\n .def(\"changeQualityAt\", &Character::changeQualityAt)\n .def(\"isAdmin\", &Character::isAdmin)\n .def(\"talk\", (void(Character:: *)(Character::talk_type, const std::string &))&Character::talk)\n .def(\"talk\", (void(Character:: *)(Character::talk_type, const std::string &, const std::string &))&Character::talk)\n .def(\"sendCharDescription\", &Character::sendCharDescription)\n .def(\"startAction\", &Character::startAction)\n .def(\"abortAction\", &Character::abortAction)\n .def(\"successAction\", &Character::successAction)\n .def(\"disturbAction\", &Character::actionDisturbed)\n .def(\"changeSource\", (void(Character:: *)(Character *))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(const ScriptItem &))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(const position &))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(void))&Character::changeSource)\n .def(\"changeTarget\", (void(Character:: *)(Character *))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(const ScriptItem &))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(const position &))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(void))&Character::changeTarget)\n .def(\"inform\", inform_lua1)\n .def(\"inform\", inform_lua2)\n .def(\"inform\", inform_lua3)\n .def(\"inform\", inform_lua4)\n .def(\"introduce\", &Character::introducePlayer)\n .def(\"move\", &Character::move)\n .def(\"turn\", (void(Character:: *)(direction))&Character::turn)\n .def(\"turn\", (void(Character:: *)(const position &))&Character::turn)\n .def(\"getNextStepDir\", &Character::getNextStepDir, luabind::pure_out_value(_3))\n .def(\"setRace\", &Character::changeRace)\n .def(\"getRace\", &Character::getRace)\n .def(\"getFaceTo\", &Character::getFaceTo)\n .def(\"getType\", &Character::getType)\n .def(\"createItem\", create_item)\n .def(\"getLoot\", getLoot)\n .def(\"increasePoisonValue\", &Character::increasePoisonValue)\n .def(\"getPoisonValue\", &Character::getPoisonValue)\n .def(\"setPoisonValue\", &Character::setPoisonValue)\n .def(\"getMentalCapacity\", &Character::getMentalCapacity)\n .def(\"setMentalCapacity\", &Character::setMentalCapacity)\n .def(\"increaseMentalCapacity\", &Character::increaseMentalCapacity)\n .def(\"setClippingActive\", &Character::setClippingActive)\n .def(\"getClippingActive\", &Character::getClippingActive)\n .def(\"countItem\", &Character::countItem)\n .def(\"countItemAt\", count_item_at1)\n .def(\"countItemAt\", count_item_at2)\n .def(\"eraseItem\", erase_item1)\n .def(\"eraseItem\", erase_item2)\n .def(\"increaseAtPos\", &Character::increaseAtPos)\n .def(\"swapAtPos\", &Character::swapAtPos)\n .def(\"createAtPos\", &Character::createAtPos)\n .def(\"getItemAt\", &Character::GetItemAt)\n .enum_(\"skills\")\n [\n skills\n ]\n .def(\"getSkillName\", &Character::getSkillName)\n .def(\"getSkill\", &Character::getSkill)\n .def(\"getMinorSkill\", &Character::getMinorSkill)\n .def(\"increaseAttrib\", &Character::increaseAttrib)\n .def(\"setAttrib\", &Character::setAttrib)\n .def(\"isBaseAttributeValid\", &Character::isBaseAttribValid)\n .def(\"getBaseAttributeSum\", &Character::getBaseAttributeSum)\n .def(\"getMaxAttributePoints\", &Character::getMaxAttributePoints)\n .def(\"saveBaseAttributes\", &Character::saveBaseAttributes)\n .def(\"setBaseAttribute\", &Character::setBaseAttrib)\n .def(\"getBaseAttribute\", &Character::getBaseAttrib)\n .def(\"increaseBaseAttribute\", &Character::increaseBaseAttrib)\n .def(\"increaseSkill\", &Character::increaseSkill)\n .def(\"increaseMinorSkill\", &Character::increaseMinorSkill)\n .def(\"setSkill\", &Character::setSkill)\n .def(\"setSkinColour\", &Character::setSkinColour)\n .def(\"getSkinColour\", &Character::getSkinColour)\n .def(\"setHairColour\", &Character::setHairColour)\n .def(\"getHairColour\", &Character::getHairColour)\n .def(\"setHair\", &Character::setHair)\n .def(\"getHair\", &Character::getHair)\n .def(\"setBeard\", &Character::setBeard)\n .def(\"getBeard\", &Character::getBeard)\n .def(\"learn\", &Character::learn)\n .def(\"getSkillValue\",&Character::getSkillValue)\n .def(\"teachMagic\", &Character::teachMagic)\n .def(\"isInRange\", &Character::isInRange)\n .def(\"isInRangeToPosition\", &Character::isInRangeToField)\n .def(\"distanceMetric\", &Character::distanceMetric)\n .def(\"distanceMetricToPosition\", &Character::distanceMetricToPosition)\n .def(\"getMagicType\", &Character::getMagicType)\n .def(\"setMagicType\", &Character::setMagicType)\n .def(\"getMagicFlags\", &Character::getMagicFlags)\n .def(\"warp\", &Character::Warp)\n .def(\"forceWarp\", &Character::forceWarp)\n .def(\"startMusic\", &Character::startMusic)\n .def(\"defaultMusic\", &Character::defaultMusic)\n .def(\"callAttackScript\", &Character::callAttackScript)\n .def(\"getItemList\", character_getItemList)\n .property(\"lastSpokenText\", &Character::getLastSpokenText)\n .def(\"getPlayerLanguage\", getPlayerLanguageLua)\n .def(\"getBackPack\", &Character::GetBackPack)\n .def(\"getDepot\", &Character::GetDepot)\n .def(\"setQuestProgress\", &Character::setQuestProgress)\n .def(\"getQuestProgress\", &Character::getQuestProgress, luabind::pure_out_value(_3))\n .def(\"getOnRoute\",&Character::getOnRoute)\n .def(\"setOnRoute\",&Character::setOnRoute)\n .def(\"getMonsterType\", &Character::getMonsterType)\n .def(\"logAdmin\", &Character::logAdmin)\n .def_readonly(\"effects\", &Character::effects)\n .def_readonly(\"waypoints\", &Character::waypoints)\n .property(\"pos\", &Character::getPosition)\n .property(\"name\", &Character::getName)\n .property(\"id\", &Character::getId)\n .property(\"activeLanguage\", &Character::getActiveLanguage, &Character::setActiveLanguage)\n .property(\"movepoints\", &Character::getActionPoints, &Character::setActionPoints)\n .property(\"fightpoints\", &Character::getFightPoints, &Character::setFightPoints)\n .property(\"isinvisible\", &Character::isInvisible, &Character::setInvisible)\n .property(\"attackmode\", &Character::getAttackMode)\n \/\/.def_readonly(\"isTarget\", &Character::isTarget)\n .enum_(\"body_pos\")\n [\n luabind::value(\"backpack\", BACKPACK),\n luabind::value(\"head\", HEAD),\n luabind::value(\"neck\", NECK),\n luabind::value(\"breast\", BREAST),\n luabind::value(\"hands\", HANDS),\n luabind::value(\"left_tool\", LEFT_TOOL),\n luabind::value(\"right_tool\", RIGHT_TOOL),\n luabind::value(\"finger_left_hand\", FINGER_LEFT_HAND),\n luabind::value(\"finger_right_hand\", FINGER_RIGHT_HAND),\n luabind::value(\"legs\", LEGS),\n luabind::value(\"feet\", FEET),\n luabind::value(\"coat\", COAT),\n luabind::value(\"belt_pos_1\", MAX_BODY_ITEMS),\n luabind::value(\"belt_pos_2\", MAX_BODY_ITEMS + 1),\n luabind::value(\"belt_pos_3\", MAX_BODY_ITEMS + 2),\n luabind::value(\"belt_pos_4\", MAX_BODY_ITEMS + 3),\n luabind::value(\"belt_pos_5\", MAX_BODY_ITEMS + 4),\n luabind::value(\"belt_pos_6\", MAX_BODY_ITEMS + 5)\n ]\n .enum_(\"magic_flags\")\n [\n luabind::value(\"mage\", MAGE),\n luabind::value(\"priest\", PRIEST),\n luabind::value(\"bard\", BARD),\n luabind::value(\"druid\", DRUID)\n ]\n .enum_(\"talk_type\")\n [\n luabind::value(\"say\", Character::tt_say),\n luabind::value(\"whisper\", Character::tt_whisper),\n luabind::value(\"yell\", Character::tt_yell)\n ]\n .enum_(\"direction\")\n [\n luabind::value(\"dir_north\", dir_north),\n luabind::value(\"dir_northeast\", dir_northeast),\n luabind::value(\"dir_east\", dir_east),\n luabind::value(\"dir_southeast\", dir_southeast),\n luabind::value(\"dir_south\", dir_south),\n luabind::value(\"dir_southwest\", dir_southwest),\n luabind::value(\"dir_west\", dir_west),\n luabind::value(\"dir_northwest\", dir_northwest),\n luabind::value(\"dir_up\", dir_up),\n luabind::value(\"dir_down\", dir_down)\n ]\n .enum_(\"character_type\")\n [\n luabind::value(\"player\", Character::player),\n luabind::value(\"monster\", Character::monster),\n luabind::value(\"npc\", Character::npc)\n ]\n .enum_(\"sex_type\")\n [\n luabind::value(\"male\", Character::male),\n luabind::value(\"female\", Character::female)\n ]\n .enum_(\"face_to\")\n [\n luabind::value(\"north\", Character::north),\n luabind::value(\"northeast\", Character::northeast),\n luabind::value(\"east\", Character::east),\n luabind::value(\"southeast\", Character::southeast),\n luabind::value(\"south\", Character::west),\n luabind::value(\"southwest\", Character::southwest),\n luabind::value(\"west\", Character::west),\n luabind::value(\"northwest\", Character::northwest)\n ]\n .enum_(\"race_type\")\n [\n races\n ]\n .enum_(\"inform_type\")\n [\n luabind::value(\"lowPriority\", Character::informScriptLowPriority),\n luabind::value(\"mediumPriority\", Character::informScriptMediumPriority),\n luabind::value(\"highPriority\", Character::informScriptHighPriority)\n ];\n }\n\n}\n<commit_msg>Fix Lua binding of Character::south<commit_after>\/*\n * illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of illarionserver.\n *\n * illarionserver is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * illarionserver is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Character.hpp\"\n#include \"Player.hpp\"\n#include \"globals.hpp\"\n#include <luabind\/adopt_policy.hpp>\n#include <luabind\/out_value_policy.hpp>\n#include <script\/forwarder.hpp>\n#include <data\/Data.hpp>\n#include \"script\/binding\/binding.hpp\"\n\nnamespace binding {\n\n luabind::scope character() {\n using ::position;\n\n luabind::value_vector skills;\n\n for (const auto &skill: Data::Skills) {\n skills.push_back(luabind::value(skill.second.serverName.c_str(), skill.first));\n }\n\n luabind::value_vector races;\n\n for (const auto &race: Data::Races) {\n races.push_back(luabind::value(race.second.serverName.c_str(), race.first));\n }\n\n return luabind::class_<Character>(\"Character\")\n .def(\"isNewPlayer\", &Character::isNewPlayer)\n .def(\"pageGM\", &Character::pageGM)\n .def(\"requestInputDialog\", &Character::requestInputDialog, luabind::adopt(_2))\n .def(\"requestMessageDialog\", &Character::requestMessageDialog, luabind::adopt(_2))\n .def(\"requestMerchantDialog\", &Character::requestMerchantDialog, luabind::adopt(_2))\n .def(\"requestSelectionDialog\", &Character::requestSelectionDialog, luabind::adopt(_2))\n .def(\"requestCraftingDialog\", &Character::requestCraftingDialog, luabind::adopt(_2))\n .def(\"idleTime\", &Character::idleTime)\n .def(\"sendBook\", &Character::sendBook)\n .def(\"updateAppearance\", &Character::forceUpdateAppearanceForAll)\n .def(\"performAnimation\", &Character::performAnimation)\n .def(\"alterSpokenMessage\", &Character::alterSpokenMessage)\n .def(\"actionRunning\", &Character::actionRunning)\n .def(\"changeQualityAt\", &Character::changeQualityAt)\n .def(\"isAdmin\", &Character::isAdmin)\n .def(\"talk\", (void(Character:: *)(Character::talk_type, const std::string &))&Character::talk)\n .def(\"talk\", (void(Character:: *)(Character::talk_type, const std::string &, const std::string &))&Character::talk)\n .def(\"sendCharDescription\", &Character::sendCharDescription)\n .def(\"startAction\", &Character::startAction)\n .def(\"abortAction\", &Character::abortAction)\n .def(\"successAction\", &Character::successAction)\n .def(\"disturbAction\", &Character::actionDisturbed)\n .def(\"changeSource\", (void(Character:: *)(Character *))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(const ScriptItem &))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(const position &))&Character::changeSource)\n .def(\"changeSource\", (void(Character:: *)(void))&Character::changeSource)\n .def(\"changeTarget\", (void(Character:: *)(Character *))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(const ScriptItem &))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(const position &))&Character::changeTarget)\n .def(\"changeTarget\", (void(Character:: *)(void))&Character::changeTarget)\n .def(\"inform\", inform_lua1)\n .def(\"inform\", inform_lua2)\n .def(\"inform\", inform_lua3)\n .def(\"inform\", inform_lua4)\n .def(\"introduce\", &Character::introducePlayer)\n .def(\"move\", &Character::move)\n .def(\"turn\", (void(Character:: *)(direction))&Character::turn)\n .def(\"turn\", (void(Character:: *)(const position &))&Character::turn)\n .def(\"getNextStepDir\", &Character::getNextStepDir, luabind::pure_out_value(_3))\n .def(\"setRace\", &Character::changeRace)\n .def(\"getRace\", &Character::getRace)\n .def(\"getFaceTo\", &Character::getFaceTo)\n .def(\"getType\", &Character::getType)\n .def(\"createItem\", create_item)\n .def(\"getLoot\", getLoot)\n .def(\"increasePoisonValue\", &Character::increasePoisonValue)\n .def(\"getPoisonValue\", &Character::getPoisonValue)\n .def(\"setPoisonValue\", &Character::setPoisonValue)\n .def(\"getMentalCapacity\", &Character::getMentalCapacity)\n .def(\"setMentalCapacity\", &Character::setMentalCapacity)\n .def(\"increaseMentalCapacity\", &Character::increaseMentalCapacity)\n .def(\"setClippingActive\", &Character::setClippingActive)\n .def(\"getClippingActive\", &Character::getClippingActive)\n .def(\"countItem\", &Character::countItem)\n .def(\"countItemAt\", count_item_at1)\n .def(\"countItemAt\", count_item_at2)\n .def(\"eraseItem\", erase_item1)\n .def(\"eraseItem\", erase_item2)\n .def(\"increaseAtPos\", &Character::increaseAtPos)\n .def(\"swapAtPos\", &Character::swapAtPos)\n .def(\"createAtPos\", &Character::createAtPos)\n .def(\"getItemAt\", &Character::GetItemAt)\n .enum_(\"skills\")\n [\n skills\n ]\n .def(\"getSkillName\", &Character::getSkillName)\n .def(\"getSkill\", &Character::getSkill)\n .def(\"getMinorSkill\", &Character::getMinorSkill)\n .def(\"increaseAttrib\", &Character::increaseAttrib)\n .def(\"setAttrib\", &Character::setAttrib)\n .def(\"isBaseAttributeValid\", &Character::isBaseAttribValid)\n .def(\"getBaseAttributeSum\", &Character::getBaseAttributeSum)\n .def(\"getMaxAttributePoints\", &Character::getMaxAttributePoints)\n .def(\"saveBaseAttributes\", &Character::saveBaseAttributes)\n .def(\"setBaseAttribute\", &Character::setBaseAttrib)\n .def(\"getBaseAttribute\", &Character::getBaseAttrib)\n .def(\"increaseBaseAttribute\", &Character::increaseBaseAttrib)\n .def(\"increaseSkill\", &Character::increaseSkill)\n .def(\"increaseMinorSkill\", &Character::increaseMinorSkill)\n .def(\"setSkill\", &Character::setSkill)\n .def(\"setSkinColour\", &Character::setSkinColour)\n .def(\"getSkinColour\", &Character::getSkinColour)\n .def(\"setHairColour\", &Character::setHairColour)\n .def(\"getHairColour\", &Character::getHairColour)\n .def(\"setHair\", &Character::setHair)\n .def(\"getHair\", &Character::getHair)\n .def(\"setBeard\", &Character::setBeard)\n .def(\"getBeard\", &Character::getBeard)\n .def(\"learn\", &Character::learn)\n .def(\"getSkillValue\",&Character::getSkillValue)\n .def(\"teachMagic\", &Character::teachMagic)\n .def(\"isInRange\", &Character::isInRange)\n .def(\"isInRangeToPosition\", &Character::isInRangeToField)\n .def(\"distanceMetric\", &Character::distanceMetric)\n .def(\"distanceMetricToPosition\", &Character::distanceMetricToPosition)\n .def(\"getMagicType\", &Character::getMagicType)\n .def(\"setMagicType\", &Character::setMagicType)\n .def(\"getMagicFlags\", &Character::getMagicFlags)\n .def(\"warp\", &Character::Warp)\n .def(\"forceWarp\", &Character::forceWarp)\n .def(\"startMusic\", &Character::startMusic)\n .def(\"defaultMusic\", &Character::defaultMusic)\n .def(\"callAttackScript\", &Character::callAttackScript)\n .def(\"getItemList\", character_getItemList)\n .property(\"lastSpokenText\", &Character::getLastSpokenText)\n .def(\"getPlayerLanguage\", getPlayerLanguageLua)\n .def(\"getBackPack\", &Character::GetBackPack)\n .def(\"getDepot\", &Character::GetDepot)\n .def(\"setQuestProgress\", &Character::setQuestProgress)\n .def(\"getQuestProgress\", &Character::getQuestProgress, luabind::pure_out_value(_3))\n .def(\"getOnRoute\",&Character::getOnRoute)\n .def(\"setOnRoute\",&Character::setOnRoute)\n .def(\"getMonsterType\", &Character::getMonsterType)\n .def(\"logAdmin\", &Character::logAdmin)\n .def_readonly(\"effects\", &Character::effects)\n .def_readonly(\"waypoints\", &Character::waypoints)\n .property(\"pos\", &Character::getPosition)\n .property(\"name\", &Character::getName)\n .property(\"id\", &Character::getId)\n .property(\"activeLanguage\", &Character::getActiveLanguage, &Character::setActiveLanguage)\n .property(\"movepoints\", &Character::getActionPoints, &Character::setActionPoints)\n .property(\"fightpoints\", &Character::getFightPoints, &Character::setFightPoints)\n .property(\"isinvisible\", &Character::isInvisible, &Character::setInvisible)\n .property(\"attackmode\", &Character::getAttackMode)\n \/\/.def_readonly(\"isTarget\", &Character::isTarget)\n .enum_(\"body_pos\")\n [\n luabind::value(\"backpack\", BACKPACK),\n luabind::value(\"head\", HEAD),\n luabind::value(\"neck\", NECK),\n luabind::value(\"breast\", BREAST),\n luabind::value(\"hands\", HANDS),\n luabind::value(\"left_tool\", LEFT_TOOL),\n luabind::value(\"right_tool\", RIGHT_TOOL),\n luabind::value(\"finger_left_hand\", FINGER_LEFT_HAND),\n luabind::value(\"finger_right_hand\", FINGER_RIGHT_HAND),\n luabind::value(\"legs\", LEGS),\n luabind::value(\"feet\", FEET),\n luabind::value(\"coat\", COAT),\n luabind::value(\"belt_pos_1\", MAX_BODY_ITEMS),\n luabind::value(\"belt_pos_2\", MAX_BODY_ITEMS + 1),\n luabind::value(\"belt_pos_3\", MAX_BODY_ITEMS + 2),\n luabind::value(\"belt_pos_4\", MAX_BODY_ITEMS + 3),\n luabind::value(\"belt_pos_5\", MAX_BODY_ITEMS + 4),\n luabind::value(\"belt_pos_6\", MAX_BODY_ITEMS + 5)\n ]\n .enum_(\"magic_flags\")\n [\n luabind::value(\"mage\", MAGE),\n luabind::value(\"priest\", PRIEST),\n luabind::value(\"bard\", BARD),\n luabind::value(\"druid\", DRUID)\n ]\n .enum_(\"talk_type\")\n [\n luabind::value(\"say\", Character::tt_say),\n luabind::value(\"whisper\", Character::tt_whisper),\n luabind::value(\"yell\", Character::tt_yell)\n ]\n .enum_(\"direction\")\n [\n luabind::value(\"dir_north\", dir_north),\n luabind::value(\"dir_northeast\", dir_northeast),\n luabind::value(\"dir_east\", dir_east),\n luabind::value(\"dir_southeast\", dir_southeast),\n luabind::value(\"dir_south\", dir_south),\n luabind::value(\"dir_southwest\", dir_southwest),\n luabind::value(\"dir_west\", dir_west),\n luabind::value(\"dir_northwest\", dir_northwest),\n luabind::value(\"dir_up\", dir_up),\n luabind::value(\"dir_down\", dir_down)\n ]\n .enum_(\"character_type\")\n [\n luabind::value(\"player\", Character::player),\n luabind::value(\"monster\", Character::monster),\n luabind::value(\"npc\", Character::npc)\n ]\n .enum_(\"sex_type\")\n [\n luabind::value(\"male\", Character::male),\n luabind::value(\"female\", Character::female)\n ]\n .enum_(\"face_to\")\n [\n luabind::value(\"north\", Character::north),\n luabind::value(\"northeast\", Character::northeast),\n luabind::value(\"east\", Character::east),\n luabind::value(\"southeast\", Character::southeast),\n luabind::value(\"south\", Character::south),\n luabind::value(\"southwest\", Character::southwest),\n luabind::value(\"west\", Character::west),\n luabind::value(\"northwest\", Character::northwest)\n ]\n .enum_(\"race_type\")\n [\n races\n ]\n .enum_(\"inform_type\")\n [\n luabind::value(\"lowPriority\", Character::informScriptLowPriority),\n luabind::value(\"mediumPriority\", Character::informScriptMediumPriority),\n luabind::value(\"highPriority\", Character::informScriptHighPriority)\n ];\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <curses.h>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <boost\/circular_buffer.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/weak_ptr.hpp>\n#include <boost\/noncopyable.hpp>\n\n#include \"logger.hh\"\n\n#define KEY_ESCAPE 27\n#define BLOCKS 1\n#define BLOCKSMOVE 100\n\nclass Actor;\ntypedef std::vector<Actor*> ActorPtrs;\ntypedef boost::ptr_vector<Actor> Actors;\n\ntypedef boost::circular_buffer_space_optimized<std::string> MsgBuffer;\n\n\/\/\/ Tiles\n\nstruct Tile {\n\tconst static int TRANSPARENT = 255;\n\tchar ch;\n\tint color;\n\tstd::string desc;\n\tbool explored;\n\tbool visible;\n\tbool blocks_movement;\n\tint blocks_vision_dist;\n\tActor* actor;\n\n\tTile(char ch = ' ', int color = 0, int blocker = BLOCKS):\n\tch(ch), color(color), explored(false), visible(false),\n\tblocks_movement(blocker), blocks_vision_dist(blocker ? (blocker == BLOCKSMOVE ? TRANSPARENT : 0) : TRANSPARENT), actor(NULL) {}\n\n\tbool isFree() const { return (!blocks_movement) && (actor == NULL); }\n\n\tbool operator==(const Tile& rhs) {\n\t\treturn ch == rhs.ch && color == rhs.color;\n\t}\n\tbool operator!=(const Tile& rhs) { return !(*this==rhs); }\n};\n\ntypedef std::vector<Tile> tilerow;\ntypedef std::vector<tilerow> tilearray;\n\nTile TileBuilder(std::string type);\n\n\n\/\/\/ Math\n\ntemplate<typename T>\nstd::string num2str(T i) { std::ostringstream oss; oss << i; return oss.str(); }\n\nbool inline randbool() { return rand() % 2 == 0; }\n\nint inline randint(int hi) { return rand() % hi; }\n\nint inline randint(int lo, int hi) {\n\treturn (rand() % (hi - lo + 1)) + lo;\n}\n\ntemplate<typename T> T distance2d(T x1, T y1, T x2, T y2) {\n\treturn sqrt( (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1) );\n}\n\n\/** Implement C99 mathematical rounding (which C++ unfortunately currently lacks) **\/\ntemplate <typename T> T round(T val) { return int(val + (val >= 0 ? 0.5 : -0.5)); }\n\n\/** Limit val to range [min, max] **\/\ntemplate <typename T> T clamp(T val, T min = 0, T max = 1) {\n\tif (min > max) throw std::logic_error(\"min > max\");\n\tif (val < min) return min;\n\tif (val > max) return max;\n\treturn val;\n}\n\n\/\/\/ Console\n\nvoid setColor(WINDOW* scr, int color);\n\nvoid setColor(int color);\n\nvoid addcstr(std::string str);\n\nvoid box2(int x, int y, int w, int h);\n\nbool toggleDefaultColors();\n<commit_msg>Random direction utils.<commit_after>#pragma once\n\n#include <curses.h>\n#include <cstdlib>\n#include <cmath>\n#include <cstring>\n#include <vector>\n#include <sstream>\n#include <boost\/circular_buffer.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/weak_ptr.hpp>\n#include <boost\/noncopyable.hpp>\n\n#include \"logger.hh\"\n\n#define KEY_ESCAPE 27\n#define BLOCKS 1\n#define BLOCKSMOVE 100\n\nclass Actor;\ntypedef std::vector<Actor*> ActorPtrs;\ntypedef boost::ptr_vector<Actor> Actors;\n\ntypedef boost::circular_buffer_space_optimized<std::string> MsgBuffer;\n\n\/\/\/ Tiles\n\nstruct Tile {\n\tconst static int TRANSPARENT = 255;\n\tchar ch;\n\tint color;\n\tstd::string desc;\n\tbool explored;\n\tbool visible;\n\tbool blocks_movement;\n\tint blocks_vision_dist;\n\tActor* actor;\n\n\tTile(char ch = ' ', int color = 0, int blocker = BLOCKS):\n\tch(ch), color(color), explored(false), visible(false),\n\tblocks_movement(blocker), blocks_vision_dist(blocker ? (blocker == BLOCKSMOVE ? TRANSPARENT : 0) : TRANSPARENT), actor(NULL) {}\n\n\tbool isFree() const { return (!blocks_movement) && (actor == NULL); }\n\n\tbool operator==(const Tile& rhs) {\n\t\treturn ch == rhs.ch && color == rhs.color;\n\t}\n\tbool operator!=(const Tile& rhs) { return !(*this==rhs); }\n};\n\ntypedef std::vector<Tile> tilerow;\ntypedef std::vector<tilerow> tilearray;\n\nTile TileBuilder(std::string type);\n\n\n\/\/\/ Math\n\ntemplate<typename T>\nstd::string num2str(T i) { std::ostringstream oss; oss << i; return oss.str(); }\n\nbool inline randbool() { return rand() % 2 == 0; }\n\nint inline randint(int hi) { return rand() % hi; }\n\nint inline randint(int lo, int hi) {\n\treturn (rand() % (hi - lo + 1)) + lo;\n}\n\nint inline randdir() { return randbool() ? 1 : -1; }\nvoid inline swapdir(int& dir) { if (dir == 1) dir = -1; else dir = 1; }\nvoid inline randdir(int& dx, int &dy) {\n\tif (randbool()) { dx = randdir(); dy = randint(-1,1); }\n\telse { dx = randint(-1,1); dy = randdir(); }\n}\n\ntemplate<typename T> T distance2d(T x1, T y1, T x2, T y2) {\n\treturn sqrt( (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1) );\n}\n\n\/** Implement C99 mathematical rounding (which C++ unfortunately currently lacks) **\/\ntemplate <typename T> T round(T val) { return int(val + (val >= 0 ? 0.5 : -0.5)); }\n\n\/** Limit val to range [min, max] **\/\ntemplate <typename T> T clamp(T val, T min = 0, T max = 1) {\n\tif (min > max) throw std::logic_error(\"min > max\");\n\tif (val < min) return min;\n\tif (val > max) return max;\n\treturn val;\n}\n\n\/\/\/ Console\n\nvoid setColor(WINDOW* scr, int color);\n\nvoid setColor(int color);\n\nvoid addcstr(std::string str);\n\nvoid box2(int x, int y, int w, int h);\n\nbool toggleDefaultColors();\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2018 ARM Limited\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright 2015 LabWare\n * Copyright 2014 Google, Inc.\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef __REMOTE_GDB_HH__\n#define __REMOTE_GDB_HH__\n\n#include <sys\/signal.h>\n\n#include <cstdint>\n#include <exception>\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"arch\/types.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/pollevent.hh\"\n#include \"base\/socket.hh\"\n#include \"base\/types.hh\"\n#include \"cpu\/pc_event.hh\"\n#include \"sim\/eventq.hh\"\n\nclass System;\nclass ThreadContext;\n\nclass BaseRemoteGDB;\nclass HardBreakpoint;\n\n\/**\n * Concrete subclasses of this abstract class represent how the\n * register values are transmitted on the wire. Usually each\n * architecture should define one subclass, but there can be more\n * if there is more than one possible wire format. For example,\n * ARM defines both AArch32GdbRegCache and AArch64GdbRegCache.\n *\/\nclass BaseGdbRegCache\n{\n public:\n\n \/**\n * Return the pointer to the raw bytes buffer containing the\n * register values. Each byte of this buffer is literally\n * encoded as two hex digits in the g or G RSP packet.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual char *data() const = 0;\n\n \/**\n * Return the size of the raw buffer, in bytes\n * (i.e., half of the number of digits in the g\/G packet).\n *\n * @ingroup api_remote_gdb\n *\/\n virtual size_t size() const = 0;\n\n \/**\n * Fill the raw buffer from the registers in the ThreadContext.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual void getRegs(ThreadContext*) = 0;\n\n \/**\n * Set the ThreadContext's registers from the values\n * in the raw buffer.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual void setRegs(ThreadContext*) const = 0;\n\n \/**\n * Return the name to use in places like DPRINTF.\n * Having each concrete superclass redefine this member\n * is useful in situations where the class of the regCache\n * can change on the fly.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual const std::string name() const = 0;\n\n \/**\n * @ingroup api_remote_gdb\n *\/\n BaseGdbRegCache(BaseRemoteGDB *g) : gdb(g)\n {}\n virtual ~BaseGdbRegCache()\n {}\n\n protected:\n BaseRemoteGDB *gdb;\n};\n\nclass BaseRemoteGDB\n{\n friend class HardBreakpoint;\n public:\n\n \/**\n * @ingroup api_remote_gdb\n * @{\n *\/\n\n \/**\n * Interface to other parts of the simulator.\n *\/\n BaseRemoteGDB(System *system, ThreadContext *context, int _port);\n virtual ~BaseRemoteGDB();\n\n std::string name();\n\n void listen();\n void connect();\n\n int port() const;\n\n void attach(int fd);\n void detach();\n bool isAttached() { return attached; }\n\n void replaceThreadContext(ThreadContext *_tc) { tc = _tc; }\n\n bool trap(int type);\n\n \/** @} *\/ \/\/ end of api_remote_gdb\n\n private:\n \/*\n * Connection to the external GDB.\n *\/\n void incomingData(int revent);\n void connectWrapper(int revent) { connect(); }\n\n template <void (BaseRemoteGDB::*F)(int revent)>\n class SocketEvent : public PollEvent\n {\n protected:\n BaseRemoteGDB *gdb;\n\n public:\n SocketEvent(BaseRemoteGDB *gdb, int fd, int e) :\n PollEvent(fd, e), gdb(gdb)\n {}\n\n void process(int revent) { (gdb->*F)(revent); }\n };\n\n typedef SocketEvent<&BaseRemoteGDB::connectWrapper> ConnectEvent;\n typedef SocketEvent<&BaseRemoteGDB::incomingData> DataEvent;\n\n friend ConnectEvent;\n friend DataEvent;\n\n ConnectEvent *connectEvent;\n DataEvent *dataEvent;\n\n ListenSocket listener;\n int _port;\n\n \/\/ The socket commands come in through.\n int fd;\n\n \/\/ Transfer data to\/from GDB.\n uint8_t getbyte();\n void putbyte(uint8_t b);\n\n void recv(std::vector<char> &bp);\n void send(const char *data);\n void send(const std::string &data) { send(data.c_str()); }\n\n template <typename ...Args>\n void\n send(const char *format, const Args &...args)\n {\n send(csprintf(format, args...));\n }\n\n \/*\n * Simulator side debugger state.\n *\/\n bool active;\n bool attached;\n\n System *sys;\n ThreadContext *tc;\n\n BaseGdbRegCache *regCachePtr;\n\n class TrapEvent : public Event\n {\n protected:\n int _type;\n BaseRemoteGDB *gdb;\n\n public:\n TrapEvent(BaseRemoteGDB *g) : gdb(g)\n {}\n\n void type(int t) { _type = t; }\n void process() { gdb->trap(_type); }\n } trapEvent;\n\n \/*\n * The interface to the simulated system.\n *\/\n \/\/ Machine memory.\n bool read(Addr addr, size_t size, char *data);\n bool write(Addr addr, size_t size, const char *data);\n\n template <class T> T read(Addr addr);\n template <class T> void write(Addr addr, T data);\n\n \/\/ Single step.\n void singleStep();\n EventWrapper<BaseRemoteGDB, &BaseRemoteGDB::singleStep> singleStepEvent;\n\n void clearSingleStep();\n void setSingleStep();\n\n \/\/\/ Schedule an event which will be triggered \"delta\" instructions later.\n void scheduleInstCommitEvent(Event *ev, int delta);\n \/\/\/ Deschedule an instruction count based event.\n void descheduleInstCommitEvent(Event *ev);\n\n \/\/ Breakpoints.\n void insertSoftBreak(Addr addr, size_t len);\n void removeSoftBreak(Addr addr, size_t len);\n void insertHardBreak(Addr addr, size_t len);\n void removeHardBreak(Addr addr, size_t len);\n\n \/*\n * GDB commands.\n *\/\n struct GdbCommand\n {\n public:\n struct Context\n {\n const GdbCommand *cmd;\n char cmdByte;\n int type;\n char *data;\n int len;\n };\n\n typedef bool (BaseRemoteGDB::*Func)(Context &ctx);\n\n const char * const name;\n const Func func;\n\n GdbCommand(const char *_name, Func _func) : name(_name), func(_func) {}\n };\n\n static std::map<char, GdbCommand> commandMap;\n\n bool cmdUnsupported(GdbCommand::Context &ctx);\n\n bool cmdSignal(GdbCommand::Context &ctx);\n bool cmdCont(GdbCommand::Context &ctx);\n bool cmdAsyncCont(GdbCommand::Context &ctx);\n bool cmdDetach(GdbCommand::Context &ctx);\n bool cmdRegR(GdbCommand::Context &ctx);\n bool cmdRegW(GdbCommand::Context &ctx);\n bool cmdSetThread(GdbCommand::Context &ctx);\n bool cmdMemR(GdbCommand::Context &ctx);\n bool cmdMemW(GdbCommand::Context &ctx);\n bool cmdQueryVar(GdbCommand::Context &ctx);\n bool cmdStep(GdbCommand::Context &ctx);\n bool cmdAsyncStep(GdbCommand::Context &ctx);\n bool cmdClrHwBkpt(GdbCommand::Context &ctx);\n bool cmdSetHwBkpt(GdbCommand::Context &ctx);\n\n struct QuerySetCommand\n {\n struct Context\n {\n const std::string &name;\n std::vector<std::string> args;\n\n Context(const std::string &_name) : name(_name) {}\n };\n\n using Func = void (BaseRemoteGDB::*)(Context &ctx);\n\n const char * const argSep;\n const Func func;\n\n QuerySetCommand(Func _func, const char *_argSep=nullptr) :\n argSep(_argSep), func(_func)\n {}\n };\n\n static std::map<std::string, QuerySetCommand> queryMap;\n\n void queryC(QuerySetCommand::Context &ctx);\n void querySupported(QuerySetCommand::Context &ctx);\n void queryXfer(QuerySetCommand::Context &ctx);\n void queryFThreadInfo(QuerySetCommand::Context &ctx);\n void querySThreadInfo(QuerySetCommand::Context &ctx);\n\n protected:\n ThreadContext *context() { return tc; }\n System *system() { return sys; }\n\n void encodeBinaryData(const std::string &unencoded,\n std::string &encoded) const;\n\n void encodeXferResponse(const std::string &unencoded,\n std::string &encoded, size_t offset, size_t unencoded_length) const;\n\n \/\/ To be implemented by subclasses.\n virtual bool checkBpLen(size_t len);\n\n virtual BaseGdbRegCache *gdbRegs() = 0;\n\n virtual bool acc(Addr addr, size_t len) = 0;\n\n virtual std::vector<std::string> availableFeatures() const;\n\n \/**\n * Get an XML target description.\n *\n * @param[in] annex the XML filename\n * @param[out] output set to the decoded XML\n * @return true if the given annex was found\n *\/\n virtual bool getXferFeaturesRead(const std::string &annex,\n std::string &output);\n};\n\ntemplate <class T>\ninline T\nBaseRemoteGDB::read(Addr addr)\n{\n T temp;\n read(addr, sizeof(T), (char *)&temp);\n return temp;\n}\n\ntemplate <class T>\ninline void\nBaseRemoteGDB::write(Addr addr, T data)\n{\n write(addr, sizeof(T), (const char *)&data);\n}\n\n#endif \/* __REMOTE_GDB_H__ *\/\n<commit_msg>base: Add a link to documentation in the remote GDB header file.<commit_after>\/*\n * Copyright (c) 2018 ARM Limited\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright 2015 LabWare\n * Copyright 2014 Google, Inc.\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifndef __REMOTE_GDB_HH__\n#define __REMOTE_GDB_HH__\n\n#include <sys\/signal.h>\n\n#include <cstdint>\n#include <exception>\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"arch\/types.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/pollevent.hh\"\n#include \"base\/socket.hh\"\n#include \"base\/types.hh\"\n#include \"cpu\/pc_event.hh\"\n#include \"sim\/eventq.hh\"\n\n\/*\n * This file implements a client for the GDB remote serial protocol as\n * described in this official documentation:\n *\n * https:\/\/sourceware.org\/gdb\/current\/onlinedocs\/gdb\/Remote-Protocol.html\n *\/\n\nclass System;\nclass ThreadContext;\n\nclass BaseRemoteGDB;\nclass HardBreakpoint;\n\n\/**\n * Concrete subclasses of this abstract class represent how the\n * register values are transmitted on the wire. Usually each\n * architecture should define one subclass, but there can be more\n * if there is more than one possible wire format. For example,\n * ARM defines both AArch32GdbRegCache and AArch64GdbRegCache.\n *\/\nclass BaseGdbRegCache\n{\n public:\n\n \/**\n * Return the pointer to the raw bytes buffer containing the\n * register values. Each byte of this buffer is literally\n * encoded as two hex digits in the g or G RSP packet.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual char *data() const = 0;\n\n \/**\n * Return the size of the raw buffer, in bytes\n * (i.e., half of the number of digits in the g\/G packet).\n *\n * @ingroup api_remote_gdb\n *\/\n virtual size_t size() const = 0;\n\n \/**\n * Fill the raw buffer from the registers in the ThreadContext.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual void getRegs(ThreadContext*) = 0;\n\n \/**\n * Set the ThreadContext's registers from the values\n * in the raw buffer.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual void setRegs(ThreadContext*) const = 0;\n\n \/**\n * Return the name to use in places like DPRINTF.\n * Having each concrete superclass redefine this member\n * is useful in situations where the class of the regCache\n * can change on the fly.\n *\n * @ingroup api_remote_gdb\n *\/\n virtual const std::string name() const = 0;\n\n \/**\n * @ingroup api_remote_gdb\n *\/\n BaseGdbRegCache(BaseRemoteGDB *g) : gdb(g)\n {}\n virtual ~BaseGdbRegCache()\n {}\n\n protected:\n BaseRemoteGDB *gdb;\n};\n\nclass BaseRemoteGDB\n{\n friend class HardBreakpoint;\n public:\n\n \/**\n * @ingroup api_remote_gdb\n * @{\n *\/\n\n \/**\n * Interface to other parts of the simulator.\n *\/\n BaseRemoteGDB(System *system, ThreadContext *context, int _port);\n virtual ~BaseRemoteGDB();\n\n std::string name();\n\n void listen();\n void connect();\n\n int port() const;\n\n void attach(int fd);\n void detach();\n bool isAttached() { return attached; }\n\n void replaceThreadContext(ThreadContext *_tc) { tc = _tc; }\n\n bool trap(int type);\n\n \/** @} *\/ \/\/ end of api_remote_gdb\n\n private:\n \/*\n * Connection to the external GDB.\n *\/\n void incomingData(int revent);\n void connectWrapper(int revent) { connect(); }\n\n template <void (BaseRemoteGDB::*F)(int revent)>\n class SocketEvent : public PollEvent\n {\n protected:\n BaseRemoteGDB *gdb;\n\n public:\n SocketEvent(BaseRemoteGDB *gdb, int fd, int e) :\n PollEvent(fd, e), gdb(gdb)\n {}\n\n void process(int revent) { (gdb->*F)(revent); }\n };\n\n typedef SocketEvent<&BaseRemoteGDB::connectWrapper> ConnectEvent;\n typedef SocketEvent<&BaseRemoteGDB::incomingData> DataEvent;\n\n friend ConnectEvent;\n friend DataEvent;\n\n ConnectEvent *connectEvent;\n DataEvent *dataEvent;\n\n ListenSocket listener;\n int _port;\n\n \/\/ The socket commands come in through.\n int fd;\n\n \/\/ Transfer data to\/from GDB.\n uint8_t getbyte();\n void putbyte(uint8_t b);\n\n void recv(std::vector<char> &bp);\n void send(const char *data);\n void send(const std::string &data) { send(data.c_str()); }\n\n template <typename ...Args>\n void\n send(const char *format, const Args &...args)\n {\n send(csprintf(format, args...));\n }\n\n \/*\n * Simulator side debugger state.\n *\/\n bool active;\n bool attached;\n\n System *sys;\n ThreadContext *tc;\n\n BaseGdbRegCache *regCachePtr;\n\n class TrapEvent : public Event\n {\n protected:\n int _type;\n BaseRemoteGDB *gdb;\n\n public:\n TrapEvent(BaseRemoteGDB *g) : gdb(g)\n {}\n\n void type(int t) { _type = t; }\n void process() { gdb->trap(_type); }\n } trapEvent;\n\n \/*\n * The interface to the simulated system.\n *\/\n \/\/ Machine memory.\n bool read(Addr addr, size_t size, char *data);\n bool write(Addr addr, size_t size, const char *data);\n\n template <class T> T read(Addr addr);\n template <class T> void write(Addr addr, T data);\n\n \/\/ Single step.\n void singleStep();\n EventWrapper<BaseRemoteGDB, &BaseRemoteGDB::singleStep> singleStepEvent;\n\n void clearSingleStep();\n void setSingleStep();\n\n \/\/\/ Schedule an event which will be triggered \"delta\" instructions later.\n void scheduleInstCommitEvent(Event *ev, int delta);\n \/\/\/ Deschedule an instruction count based event.\n void descheduleInstCommitEvent(Event *ev);\n\n \/\/ Breakpoints.\n void insertSoftBreak(Addr addr, size_t len);\n void removeSoftBreak(Addr addr, size_t len);\n void insertHardBreak(Addr addr, size_t len);\n void removeHardBreak(Addr addr, size_t len);\n\n \/*\n * GDB commands.\n *\/\n struct GdbCommand\n {\n public:\n struct Context\n {\n const GdbCommand *cmd;\n char cmdByte;\n int type;\n char *data;\n int len;\n };\n\n typedef bool (BaseRemoteGDB::*Func)(Context &ctx);\n\n const char * const name;\n const Func func;\n\n GdbCommand(const char *_name, Func _func) : name(_name), func(_func) {}\n };\n\n static std::map<char, GdbCommand> commandMap;\n\n bool cmdUnsupported(GdbCommand::Context &ctx);\n\n bool cmdSignal(GdbCommand::Context &ctx);\n bool cmdCont(GdbCommand::Context &ctx);\n bool cmdAsyncCont(GdbCommand::Context &ctx);\n bool cmdDetach(GdbCommand::Context &ctx);\n bool cmdRegR(GdbCommand::Context &ctx);\n bool cmdRegW(GdbCommand::Context &ctx);\n bool cmdSetThread(GdbCommand::Context &ctx);\n bool cmdMemR(GdbCommand::Context &ctx);\n bool cmdMemW(GdbCommand::Context &ctx);\n bool cmdQueryVar(GdbCommand::Context &ctx);\n bool cmdStep(GdbCommand::Context &ctx);\n bool cmdAsyncStep(GdbCommand::Context &ctx);\n bool cmdClrHwBkpt(GdbCommand::Context &ctx);\n bool cmdSetHwBkpt(GdbCommand::Context &ctx);\n\n struct QuerySetCommand\n {\n struct Context\n {\n const std::string &name;\n std::vector<std::string> args;\n\n Context(const std::string &_name) : name(_name) {}\n };\n\n using Func = void (BaseRemoteGDB::*)(Context &ctx);\n\n const char * const argSep;\n const Func func;\n\n QuerySetCommand(Func _func, const char *_argSep=nullptr) :\n argSep(_argSep), func(_func)\n {}\n };\n\n static std::map<std::string, QuerySetCommand> queryMap;\n\n void queryC(QuerySetCommand::Context &ctx);\n void querySupported(QuerySetCommand::Context &ctx);\n void queryXfer(QuerySetCommand::Context &ctx);\n void queryFThreadInfo(QuerySetCommand::Context &ctx);\n void querySThreadInfo(QuerySetCommand::Context &ctx);\n\n protected:\n ThreadContext *context() { return tc; }\n System *system() { return sys; }\n\n void encodeBinaryData(const std::string &unencoded,\n std::string &encoded) const;\n\n void encodeXferResponse(const std::string &unencoded,\n std::string &encoded, size_t offset, size_t unencoded_length) const;\n\n \/\/ To be implemented by subclasses.\n virtual bool checkBpLen(size_t len);\n\n virtual BaseGdbRegCache *gdbRegs() = 0;\n\n virtual bool acc(Addr addr, size_t len) = 0;\n\n virtual std::vector<std::string> availableFeatures() const;\n\n \/**\n * Get an XML target description.\n *\n * @param[in] annex the XML filename\n * @param[out] output set to the decoded XML\n * @return true if the given annex was found\n *\/\n virtual bool getXferFeaturesRead(const std::string &annex,\n std::string &output);\n};\n\ntemplate <class T>\ninline T\nBaseRemoteGDB::read(Addr addr)\n{\n T temp;\n read(addr, sizeof(T), (char *)&temp);\n return temp;\n}\n\ntemplate <class T>\ninline void\nBaseRemoteGDB::write(Addr addr, T data)\n{\n write(addr, sizeof(T), (const char *)&data);\n}\n\n#endif \/* __REMOTE_GDB_H__ *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <iostream>\n\n#include <bench\/bench.h>\n#include <hash.h>\n#include <crypto\/chacha20.h>\n\n\/* Number of bytes to process per iteration *\/\nstatic const uint64_t BUFFER_SIZE_TINY = 64;\nstatic const uint64_t BUFFER_SIZE_SMALL = 256;\nstatic const uint64_t BUFFER_SIZE_LARGE = 1024*1024;\n\nstatic void CHACHA20(benchmark::State& state, size_t buffersize)\n{\n std::vector<uint8_t> key(32,0);\n ChaCha20 ctx(key.data(), key.size());\n ctx.SetIV(0);\n ctx.Seek(0);\n std::vector<uint8_t> in(buffersize,0);\n std::vector<uint8_t> out(buffersize,0);\n while (state.KeepRunning()) {\n ctx.Crypt(in.data(), out.data(), in.size());\n }\n}\n\nstatic void CHACHA20_64BYTES(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_TINY);\n}\n\nstatic void CHACHA20_256BYTES(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_SMALL);\n}\n\nstatic void CHACHA20_1MB(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_LARGE);\n}\n\nBENCHMARK(CHACHA20_64BYTES, 500000);\nBENCHMARK(CHACHA20_256BYTES, 250000);\nBENCHMARK(CHACHA20_1MB, 340);\n<commit_msg>Use old BENCHMARK setup<commit_after>\/\/ Copyright (c) 2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <iostream>\n\n#include <bench\/bench.h>\n#include <hash.h>\n#include <crypto\/chacha20.h>\n\n\/* Number of bytes to process per iteration *\/\nstatic const uint64_t BUFFER_SIZE_TINY = 64;\nstatic const uint64_t BUFFER_SIZE_SMALL = 256;\nstatic const uint64_t BUFFER_SIZE_LARGE = 1024*1024;\n\nstatic void CHACHA20(benchmark::State& state, size_t buffersize)\n{\n std::vector<uint8_t> key(32,0);\n ChaCha20 ctx(key.data(), key.size());\n ctx.SetIV(0);\n ctx.Seek(0);\n std::vector<uint8_t> in(buffersize,0);\n std::vector<uint8_t> out(buffersize,0);\n while (state.KeepRunning()) {\n ctx.Crypt(in.data(), out.data(), in.size());\n }\n}\n\nstatic void CHACHA20_64BYTES(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_TINY);\n}\n\nstatic void CHACHA20_256BYTES(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_SMALL);\n}\n\nstatic void CHACHA20_1MB(benchmark::State& state)\n{\n CHACHA20(state, BUFFER_SIZE_LARGE);\n}\n\n\/\/TODO add back below once benchmarking backports are done\n\/\/BENCHMARK(CHACHA20_64BYTES, 500000);\n\/\/BENCHMARK(CHACHA20_256BYTES, 250000);\n\/\/BENCHMARK(CHACHA20_1MB, 340);\nBENCHMARK(CHACHA20_64BYTES);\nBENCHMARK(CHACHA20_256BYTES);\nBENCHMARK(CHACHA20_1MB);<|endoftext|>"} {"text":"<commit_before>\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_SFM_IO_H\n#define OPENMVG_SFM_IO_H\n\n#include \"openMVG\/numeric\/numeric.h\"\n#include \"openMVG\/split\/split.hpp\"\n\n#include <fstream>\n#include <iterator>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\nnamespace openMVG{\nnamespace SfMIO{\n\nstruct CameraInfo\n{\n std::string m_sImageName;\n size_t m_intrinsicId;\n};\n\nstruct IntrinsicCameraInfo\n{\n size_t m_w, m_h;\n float m_focal;\n Mat3 m_K;\n bool m_bKnownIntrinsic; \/\/ true if 11 or 6, else false\n std::string m_sCameraMaker, m_sCameraModel;\n\n bool operator() (IntrinsicCameraInfo const &ci1, IntrinsicCameraInfo const &ci2)const\n {\n bool bequal = false;\n if ( ci1.m_sCameraMaker.compare(\"\") != 0 && ci1.m_sCameraModel.compare(\"\") != 0 )\n {\n if ( ci1.m_sCameraMaker.compare(ci2.m_sCameraMaker) == 0\n && ci1.m_sCameraModel.compare(ci2.m_sCameraModel) == 0\n && ci1.m_w == ci2.m_w\n && ci1.m_h == ci2.m_h\n && ci1.m_focal == ci2.m_focal )\n {\n bequal = true;\n }\n else\n {\n if(m_bKnownIntrinsic)\n bequal = ci1.m_K == ci2.m_K;\n }\n }\n return !bequal;\n }\n};\n\n\n\n\/\/ Load an image file list\n\/\/ One basename per line.\n\/\/ It handle different scenario based on the intrinsic info of the tested image\n\/\/ - a camera without exif data\n\/\/ - a camera with exif data found in the database\n\/\/ - a camera with exif data not found in the database\n\/\/ - a camera with known intrinsic\nstatic bool loadImageList( std::vector<CameraInfo> & vec_camImageName,\n std::vector<IntrinsicCameraInfo> & vec_focalGroup,\n std::string sFileName,\n bool bVerbose = true )\n{\n typedef std::set<IntrinsicCameraInfo, IntrinsicCameraInfo> setIntrinsicCameraInfo;\n setIntrinsicCameraInfo set_focalGroup;\n\n std::ifstream in(sFileName.c_str());\n if(!in.is_open()) {\n std::cerr << std::endl\n << \"Impossible to read the specified file.\" << std::endl;\n }\n std::string sValue;\n std::vector<std::string> vec_str;\n while(getline( in, sValue ) )\n {\n vec_str.clear();\n IntrinsicCameraInfo intrinsicCamInfo;\n split( sValue, \";\", vec_str );\n if (vec_str.size() == 1)\n {\n std::cerr << \"Invalid input file\" << std::endl;\n in.close();\n return false;\n }\n std::stringstream oss;\n oss.clear(); oss.str(vec_str[1]);\n size_t width, height;\n oss >> width;\n oss.clear(); oss.str(vec_str[2]);\n oss >> height;\n\n intrinsicCamInfo.m_w = width;\n intrinsicCamInfo.m_h = height;\n\n switch ( vec_str.size() )\n {\n case 3 : \/\/ a camera without exif data\n {\n intrinsicCamInfo.m_focal = -1;\n intrinsicCamInfo.m_bKnownIntrinsic = false;\n intrinsicCamInfo.m_sCameraMaker = \"\";\n intrinsicCamInfo.m_sCameraModel = \"\";\n }\n break;\n case 5 : \/\/ a camera with exif data found in the database\n {\n intrinsicCamInfo.m_focal = -1;\n intrinsicCamInfo.m_bKnownIntrinsic = false;\n intrinsicCamInfo.m_sCameraMaker = vec_str[3];\n intrinsicCamInfo.m_sCameraModel = vec_str[4];\n }\n break;\n case 6 : \/\/ a camera with exif data not found in the database\n {\n oss.clear(); oss.str(vec_str[3]);\n float focal;\n oss >> focal;\n intrinsicCamInfo.m_focal = focal;\n intrinsicCamInfo.m_bKnownIntrinsic = true;\n intrinsicCamInfo.m_sCameraMaker = vec_str[4];\n intrinsicCamInfo.m_sCameraModel = vec_str[5];\n\n Mat3 K;\n K << focal, 0, float(width) \/ 2.f,\n 0, focal, float(height) \/ 2.f,\n 0, 0, 1;\n intrinsicCamInfo.m_K = K;\n\n }\n break;\n case 12 : \/\/ a camera with known intrinsic\n {\n intrinsicCamInfo.m_bKnownIntrinsic = true;\n intrinsicCamInfo.m_sCameraMaker = intrinsicCamInfo.m_sCameraModel = \"\";\n\n Mat3 K = Mat3::Identity();\n\n oss.clear(); oss.str(vec_str[3]);\n oss >> K(0,0);\n oss.clear(); oss.str(vec_str[4]);\n oss >> K(0,1);\n oss.clear(); oss.str(vec_str[5]);\n oss >> K(0,2);\n oss.clear(); oss.str(vec_str[6]);\n oss >> K(1,0);\n oss.clear(); oss.str(vec_str[7]);\n oss >> K(1,1);\n oss.clear(); oss.str(vec_str[8]);\n oss >> K(1,2);\n oss.clear(); oss.str(vec_str[9]);\n oss >> K(2,0);\n oss.clear(); oss.str(vec_str[10]);\n oss >> K(2,1);\n oss.clear(); oss.str(vec_str[11]);\n oss >> K(2,2);\n\n intrinsicCamInfo.m_K = K;\n intrinsicCamInfo.m_focal = static_cast<float>(K(0,0)); \/\/ unkown sensor size;\r\n }\n break;\n default :\n {\n std::cerr << \"Invalid line : wrong number of arguments\" << std::endl;\n }\n }\n\n std::pair<setIntrinsicCameraInfo::iterator, bool> ret = set_focalGroup.insert(intrinsicCamInfo);\n if ( ret.second )\n {\n vec_focalGroup.push_back(intrinsicCamInfo);\n }\n size_t id = std::distance( ret.first, set_focalGroup.end()) - 1;\n CameraInfo camInfo;\n camInfo.m_sImageName = vec_str[0];\n camInfo.m_intrinsicId = id;\n vec_camImageName.push_back(camInfo);\n\n vec_str.clear();\n }\n in.close();\n return !(vec_camImageName.empty());\n}\n\n\/\/-- Load an image list file but only return camera image names\nstatic bool loadImageList( std::vector<std::string> & vec_camImageName,\n std::string sListFileName,\n bool bVerbose = true )\n{\n vec_camImageName.clear();\n std::vector<openMVG::SfMIO::CameraInfo> vec_camImageIntrinsicInfo;\n std::vector<openMVG::SfMIO::IntrinsicCameraInfo> vec_focalGroup;\n if (loadImageList( vec_camImageIntrinsicInfo,\n vec_focalGroup,\n sListFileName,\n bVerbose) )\n {\n for ( std::vector<openMVG::SfMIO::CameraInfo>::const_iterator\n iter_camInfo = vec_camImageIntrinsicInfo.begin();\n iter_camInfo != vec_camImageIntrinsicInfo.end();\n iter_camInfo++ )\n {\n vec_camImageName.push_back( iter_camInfo->m_sImageName );\n }\n }\n return (!vec_camImageName.empty());\n}\n\n} \/\/ namespace SfMIO\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_SFM_INCREMENTAL_ENGINE_H\n\n<commit_msg>[SfM] better handle bad line reading in lists.txt. #157<commit_after>\n\/\/ Copyright (c) 2012, 2013 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#ifndef OPENMVG_SFM_IO_H\n#define OPENMVG_SFM_IO_H\n\n#include \"openMVG\/numeric\/numeric.h\"\n#include \"openMVG\/split\/split.hpp\"\n\n#include <fstream>\n#include <iterator>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n\nnamespace openMVG{\nnamespace SfMIO{\n\nstruct CameraInfo\n{\n std::string m_sImageName;\n size_t m_intrinsicId;\n};\n\nstruct IntrinsicCameraInfo\n{\n size_t m_w, m_h;\n float m_focal;\n Mat3 m_K;\n bool m_bKnownIntrinsic; \/\/ true if 11 or 6, else false\n std::string m_sCameraMaker, m_sCameraModel;\n\n bool operator() (IntrinsicCameraInfo const &ci1, IntrinsicCameraInfo const &ci2)const\n {\n bool bequal = false;\n if ( ci1.m_sCameraMaker.compare(\"\") != 0 && ci1.m_sCameraModel.compare(\"\") != 0 )\n {\n if ( ci1.m_sCameraMaker.compare(ci2.m_sCameraMaker) == 0\n && ci1.m_sCameraModel.compare(ci2.m_sCameraModel) == 0\n && ci1.m_w == ci2.m_w\n && ci1.m_h == ci2.m_h\n && ci1.m_focal == ci2.m_focal )\n {\n bequal = true;\n }\n else\n {\n if(m_bKnownIntrinsic)\n bequal = ci1.m_K == ci2.m_K;\n }\n }\n return !bequal;\n }\n};\n\n\n\n\/\/ Load an image file list\n\/\/ One basename per line.\n\/\/ It handle different scenario based on the intrinsic info of the tested image\n\/\/ - a camera without exif data\n\/\/ - a camera with exif data found in the database\n\/\/ - a camera with exif data not found in the database\n\/\/ - a camera with known intrinsic\nstatic bool loadImageList( std::vector<CameraInfo> & vec_camImageName,\n std::vector<IntrinsicCameraInfo> & vec_focalGroup,\n std::string sFileName,\n bool bVerbose = true )\n{\n typedef std::set<IntrinsicCameraInfo, IntrinsicCameraInfo> setIntrinsicCameraInfo;\n setIntrinsicCameraInfo set_focalGroup;\n\n std::ifstream in(sFileName.c_str());\n if(!in.is_open()) {\n std::cerr << std::endl\n << \"Impossible to read the specified file.\" << std::endl;\n }\n std::string sValue;\n std::vector<std::string> vec_str;\n while(getline( in, sValue ) )\n {\n vec_str.clear();\n IntrinsicCameraInfo intrinsicCamInfo;\n split( sValue, \";\", vec_str );\n if (vec_str.size() == 1)\n {\n std::cerr << \"Invalid input file\" << std::endl;\n in.close();\n return false;\n }\n std::stringstream oss;\n oss.clear(); oss.str(vec_str[1]);\n size_t width, height;\n oss >> width;\n oss.clear(); oss.str(vec_str[2]);\n oss >> height;\n\n intrinsicCamInfo.m_w = width;\n intrinsicCamInfo.m_h = height;\n\n switch ( vec_str.size() )\n {\n case 3 : \/\/ a camera without exif data\n {\n intrinsicCamInfo.m_focal = -1;\n intrinsicCamInfo.m_bKnownIntrinsic = false;\n intrinsicCamInfo.m_sCameraMaker = \"\";\n intrinsicCamInfo.m_sCameraModel = \"\";\n }\n break;\n case 5 : \/\/ a camera with exif data found in the database\n {\n intrinsicCamInfo.m_focal = -1;\n intrinsicCamInfo.m_bKnownIntrinsic = false;\n intrinsicCamInfo.m_sCameraMaker = vec_str[3];\n intrinsicCamInfo.m_sCameraModel = vec_str[4];\n }\n break;\n case 6 : \/\/ a camera with exif data not found in the database\n {\n oss.clear(); oss.str(vec_str[3]);\n float focal;\n oss >> focal;\n intrinsicCamInfo.m_focal = focal;\n intrinsicCamInfo.m_bKnownIntrinsic = true;\n intrinsicCamInfo.m_sCameraMaker = vec_str[4];\n intrinsicCamInfo.m_sCameraModel = vec_str[5];\n\n Mat3 K;\n K << focal, 0, float(width) \/ 2.f,\n 0, focal, float(height) \/ 2.f,\n 0, 0, 1;\n intrinsicCamInfo.m_K = K;\n\n }\n break;\n case 12 : \/\/ a camera with known intrinsic\n {\n intrinsicCamInfo.m_bKnownIntrinsic = true;\n intrinsicCamInfo.m_sCameraMaker = intrinsicCamInfo.m_sCameraModel = \"\";\n\n Mat3 K = Mat3::Identity();\n\n oss.clear(); oss.str(vec_str[3]);\n oss >> K(0,0);\n oss.clear(); oss.str(vec_str[4]);\n oss >> K(0,1);\n oss.clear(); oss.str(vec_str[5]);\n oss >> K(0,2);\n oss.clear(); oss.str(vec_str[6]);\n oss >> K(1,0);\n oss.clear(); oss.str(vec_str[7]);\n oss >> K(1,1);\n oss.clear(); oss.str(vec_str[8]);\n oss >> K(1,2);\n oss.clear(); oss.str(vec_str[9]);\n oss >> K(2,0);\n oss.clear(); oss.str(vec_str[10]);\n oss >> K(2,1);\n oss.clear(); oss.str(vec_str[11]);\n oss >> K(2,2);\n\n intrinsicCamInfo.m_K = K;\n intrinsicCamInfo.m_focal = static_cast<float>(K(0,0)); \/\/ unkown sensor size;\r\n }\n break;\n default :\n {\n std::cerr << \"Invalid image list line: wrong number of arguments\" << std::endl;\n in.close();\n return false;\n }\n }\n\n std::pair<setIntrinsicCameraInfo::iterator, bool> ret = set_focalGroup.insert(intrinsicCamInfo);\n if ( ret.second )\n {\n vec_focalGroup.push_back(intrinsicCamInfo);\n }\n size_t id = std::distance( ret.first, set_focalGroup.end()) - 1;\n CameraInfo camInfo;\n camInfo.m_sImageName = vec_str[0];\n camInfo.m_intrinsicId = id;\n vec_camImageName.push_back(camInfo);\n\n vec_str.clear();\n }\n in.close();\n return !(vec_camImageName.empty());\n}\n\n\/\/-- Load an image list file but only return camera image names\nstatic bool loadImageList( std::vector<std::string> & vec_camImageName,\n std::string sListFileName,\n bool bVerbose = true )\n{\n vec_camImageName.clear();\n std::vector<openMVG::SfMIO::CameraInfo> vec_camImageIntrinsicInfo;\n std::vector<openMVG::SfMIO::IntrinsicCameraInfo> vec_focalGroup;\n if (loadImageList( vec_camImageIntrinsicInfo,\n vec_focalGroup,\n sListFileName,\n bVerbose) )\n {\n for ( std::vector<openMVG::SfMIO::CameraInfo>::const_iterator\n iter_camInfo = vec_camImageIntrinsicInfo.begin();\n iter_camInfo != vec_camImageIntrinsicInfo.end();\n iter_camInfo++ )\n {\n vec_camImageName.push_back( iter_camInfo->m_sImageName );\n }\n }\n return (!vec_camImageName.empty());\n}\n\n} \/\/ namespace SfMIO\n} \/\/ namespace openMVG\n\n#endif \/\/ OPENMVG_SFM_INCREMENTAL_ENGINE_H\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nThis file is part of VROOM.\n\nCopyright (c) 2015-2018, Julien Coupey.\nAll rights reserved (see LICENSE).\n\n*\/\n\n#include \"vehicle.h\"\n\nvehicle_t::vehicle_t(ID_t id,\n const boost::optional<location_t>& start,\n const boost::optional<location_t>& end)\n : vehicle_t(id, start, end, boost::none) {\n}\n\nvehicle_t::vehicle_t(ID_t id,\n const boost::optional<location_t>& start,\n const boost::optional<location_t>& end,\n const boost::optional<amount_t>& capacity)\n : id(id), start(start), end(end), capacity(capacity) {\n if ((start == boost::none) and (end == boost::none)) {\n throw custom_exception(\"No start or end specified for vehicle \" +\n std::to_string(id) + '.');\n }\n}\n\nbool vehicle_t::has_start() const {\n return start != boost::none;\n}\n\nbool vehicle_t::has_end() const {\n return end != boost::none;\n}\n\nbool vehicle_t::has_capacity() const {\n return capacity != boost::none;\n}\n<commit_msg>Remove checks against boost::none.<commit_after>\/*\n\nThis file is part of VROOM.\n\nCopyright (c) 2015-2018, Julien Coupey.\nAll rights reserved (see LICENSE).\n\n*\/\n\n#include \"vehicle.h\"\n\nvehicle_t::vehicle_t(ID_t id,\n const boost::optional<location_t>& start,\n const boost::optional<location_t>& end)\n : vehicle_t(id, start, end, boost::none) {\n}\n\nvehicle_t::vehicle_t(ID_t id,\n const boost::optional<location_t>& start,\n const boost::optional<location_t>& end,\n const boost::optional<amount_t>& capacity)\n : id(id), start(start), end(end), capacity(capacity) {\n if (!static_cast<bool>(start) and !static_cast<bool>(end)) {\n throw custom_exception(\"No start or end specified for vehicle \" +\n std::to_string(id) + '.');\n }\n}\n\nbool vehicle_t::has_start() const {\n return static_cast<bool>(start);\n}\n\nbool vehicle_t::has_end() const {\n return static_cast<bool>(end);\n}\n\nbool vehicle_t::has_capacity() const {\n return static_cast<bool>(capacity);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <getopt.h>\n#include \"subcommand.hpp\"\n#include \"index.hpp\"\n#include \"stream.hpp\"\n#include \"genotyper.hpp\"\n#include \"genotypekit.hpp\"\n#include \"stream.hpp\"\n\/**\n* GAM sort main\n*\/\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\nvoid help_genotype(char** argv) {\n cerr << \"usage: \" << argv[0] << \" genotype [options] <graph.vg> [reads.index\/] > <calls.vcf>\" << endl\n << \"Compute genotypes from a graph and an indexed collection of reads\" << endl\n << endl\n << \"options:\" << endl\n << \" -j, --json output in JSON\" << endl\n << \" -v, --vcf output in VCF\" << endl\n << \" -G, --gam GAM a GAM file to use with variant recall (or in place of index)\" << endl\n << \" -V, --recall-vcf VCF recall variants in a specific VCF file.\" << endl\n << \" -F, --fasta FASTA\" << endl\n << \" -I, --insertions INS\" << endl\n << \" -r, --ref PATH use the given path name as the reference path\" << std::endl\n << \" -c, --contig NAME use the given name as the VCF contig name\" << std::endl\n << \" -s, --sample NAME name the sample in the VCF with the given name\" << std::endl\n << \" -o, --offset INT offset variant positions by this amount\" << std::endl\n << \" -l, --length INT override total sequence length\" << std::endl\n << \" -a, --augmented FILE dump augmented graph to FILE\" << std::endl\n << \" -q, --use_mapq use mapping qualities\" << std::endl\n << \" -S, --subset-graph only use the reference and areas of the graph with read support\" << std::endl\n << \" -i, --realign_indels realign at indels\" << std::endl\n << \" -d, --het_prior_denom denominator for prior probability of heterozygousness\" << std::endl\n << \" -P, --min_per_strand min consistent reads per strand for an allele\" << std::endl\n << \" -p, --progress show progress\" << endl\n << \" -t, --threads N number of threads to use\" << endl;\n}\n\nint main_genotype(int argc, char** argv) {\n\n if (argc <= 2) {\n help_genotype(argv);\n return 1;\n }\n \/\/ Should we output genotypes in JSON (true) or Protobuf (false)?\n bool output_json = false;\n \/\/ Should we output VCF instead of protobuf?\n bool output_vcf = false;\n \/\/ Should we show progress with a progress bar?\n bool show_progress = false;\n \/\/ How many threads should we use?\n int thread_count = 0;\n\n \/\/ What reference path should we use\n string ref_path_name;\n \/\/ What sample name should we use for output\n string sample_name;\n \/\/ What contig name override do we want?\n string contig_name;\n \/\/ What offset should we add to coordinates\n int64_t variant_offset = 0;\n \/\/ What length override should we use\n int64_t length_override = 0;\n\n \/\/ Should we we just do a quick variant recall,\n \/\/ based on this VCF and GAM, then exit?\n string recall_vcf;\n string gam_file;\n string fasta;\n string insertions_file;\n bool useindex = true;\n\n \/\/ Should we use mapping qualities?\n bool use_mapq = false;\n \/\/ Should we do indel realignment?\n bool realign_indels = false;\n\n \/\/ Should we dump the augmented graph to a file?\n string augmented_file_name;\n\n \/\/ Should we find superbubbles on the supported subset (true) or the whole graph (false)?\n bool subset_graph = false;\n \/\/ What should the heterozygous genotype prior be? (1\/this)\n double het_prior_denominator = 10.0;\n \/\/ At least how many reads must be consistent per strand for a call?\n size_t min_consistent_per_strand = 2;\n\n bool just_call = false;\n int c;\n optind = 2; \/\/ force optind past command positional arguments\n while (true) {\n static struct option long_options[] =\n {\n {\"json\", no_argument, 0, 'j'},\n {\"vcf\", no_argument, 0, 'v'},\n {\"ref\", required_argument, 0, 'r'},\n {\"contig\", required_argument, 0, 'c'},\n {\"sample\", required_argument, 0, 's'},\n {\"offset\", required_argument, 0, 'o'},\n {\"length\", required_argument, 0, 'l'},\n {\"augmented\", required_argument, 0, 'a'},\n {\"use_mapq\", no_argument, 0, 'q'},\n {\"subset-graph\", no_argument, 0, 'S'},\n {\"realign_indels\", no_argument, 0, 'i'},\n {\"het_prior_denom\", required_argument, 0, 'd'},\n {\"min_per_strand\", required_argument, 0, 'P'},\n {\"progress\", no_argument, 0, 'p'},\n {\"threads\", required_argument, 0, 't'},\n {\"recall-vcf\", required_argument, 0, 'V'},\n {\"gam\", required_argument, 0, 'G'},\n {\"fasta\", required_argument, 0, 'F'},\n {\"insertions\", required_argument, 0, 'I'},\n {\"call\", no_argument, 0, 'z'},\n {0, 0, 0, 0}\n };\n\n int option_index = 0;\n c = getopt_long (argc, argv, \"hjvr:c:s:o:l:a:qSid:P:pt:V:I:G:F:z\",\n long_options, &option_index);\n\n \/* Detect the end of the options. *\/\n if (c == -1)\n break;\n\n switch (c)\n {\n case 'j':\n output_json = true;\n break;\n case 'v':\n output_vcf = true;\n break;\n case 'r':\n \/\/ Set the reference path name\n ref_path_name = optarg;\n break;\n case 'c':\n \/\/ Set the contig name for output\n contig_name = optarg;\n break;\n case 's':\n \/\/ Set the sample name\n sample_name = optarg;\n break;\n case 'o':\n \/\/ Offset variants\n variant_offset = std::stoll(optarg);\n break;\n case 'l':\n \/\/ Set a length override\n length_override = std::stoll(optarg);\n break;\n case 'a':\n \/\/ Dump augmented graph\n augmented_file_name = optarg;\n break;\n case 'q':\n \/\/ Use mapping qualities\n use_mapq = true;\n break;\n case 'S':\n \/\/ Find sites on the graph subset with any read support\n subset_graph = true;\n break;\n case 'z':\n just_call = true;\n break;\n case 'i':\n \/\/ Do indel realignment\n realign_indels = true;\n break;\n case 'd':\n \/\/ Set heterozygous genotype prior denominator\n het_prior_denominator = std::stod(optarg);\n break;\n case 'P':\n \/\/ Set min consistent reads per strand required to keep an allele\n min_consistent_per_strand = std::stoll(optarg);\n break;\n case 'p':\n show_progress = true;\n break;\n case 't':\n thread_count = atoi(optarg);\n break;\n case 'V':\n recall_vcf = optarg;\n break;\n case 'I':\n insertions_file = optarg;\n break;\n case 'F':\n fasta = optarg;\n break;\n case 'G':\n gam_file = optarg;\n useindex = false;\n break;\n case 'h':\n case '?':\n \/* getopt_long already printed an error message. *\/\n help_genotype(argv);\n exit(1);\n break;\n default:\n abort ();\n }\n }\n\n if(thread_count > 0) {\n omp_set_num_threads(thread_count);\n }\n\n \/\/ read the graph\n if (optind >= argc) {\n help_genotype(argv);\n return 1;\n }\n\n if (show_progress) {\n cerr << \"Reading input graph...\" << endl;\n }\n VG* graph;\n get_input_file(optind, argc, argv, [&](istream& in) {\n graph = new VG(in);\n });\n\n if (just_call){\n Genotyper gt;\n string gamfi(gam_file);\n string rstr(ref_path_name);\n gt.genotype_svs(graph, gamfi, rstr);\n exit(0);\n }\n\n \/\/ setup reads index\n if (optind >= argc) {\n help_genotype(argv);\n return 1;\n }\n\n string reads_index_name = \"\";\n if (optind < argc){\n reads_index_name = get_input_file_name(optind, argc, argv);\n\n }\n \/\/ This holds the RocksDB index that has all our reads, indexed by the nodes they visit.\n Index index;\n if (useindex){\n index.open_read_only(reads_index_name);\n gam_file = reads_index_name;\n }\n\n \/\/ Build the set of all the node IDs to operate on\n vector<vg::id_t> graph_ids;\n graph->for_each_node([&](Node* node) {\n \/\/ Put all the ids in the set\n graph_ids.push_back(node->id());\n });\n\n if (!(recall_vcf.empty() || fasta.empty())){\n Genotyper gt;\n vcflib::VariantCallFile* vars = new vcflib::VariantCallFile();\n vars->open(recall_vcf);\n FastaReference* lin_ref = new FastaReference();\n lin_ref->open(fasta);\n\n vector<FastaReference*> insertions;\n if (!insertions_file.empty()){\n FastaReference* ins = new FastaReference();\n insertions.emplace_back(ins);\n ins->open(insertions_file);\n }\n gt.variant_recall(graph, vars, lin_ref, insertions, gam_file, useindex);\n return 0;\n\n }\n\n \/\/ Load all the reads matching the graph into memory\n vector<Alignment> alignments;\n\n if(show_progress) {\n cerr << \"Loading reads...\" << endl;\n }\n\n function<bool(const Alignment&)> alignment_contained = [&graph](const Alignment& alignment) {\n for(size_t i = 0; i < alignment.path().mapping_size(); i++) {\n if(!graph->has_node(alignment.path().mapping(i).position().node_id())) {\n return false;\n }\n }\n return alignment.path().mapping_size() > 0;\n };\n\n if (useindex) {\n \/\/ Extract all the alignments\n index.for_alignment_to_nodes(graph_ids, [&](const Alignment& alignment) {\n \/\/ Only take alignments that don't visit nodes not in the graph\n if (alignment_contained(alignment)) {\n alignments.push_back(alignment);\n }\n });\n } else {\n \/\/ load in all reads (activated by passing GAM directly with -G).\n \/\/ This is used by, ex., toil-vg, which has already used the gam index\n \/\/ to extract relevant reads\n ifstream gam_reads(gam_file.c_str());\n if (!gam_reads) {\n cerr << \"[vg genotype] Error opening gam: \" << gam_file << endl;\n return 1;\n }\n stream::for_each<Alignment>(gam_reads, [&alignments, &alignment_contained](Alignment& alignment) {\n if (alignment_contained(alignment)) {\n alignments.push_back(alignment);\n }\n });\n }\n \n if(show_progress) {\n cerr << \"Loaded \" << alignments.size() << \" alignments\" << endl;\n }\n\n \/\/ Make a Genotyper to do the genotyping\n Genotyper genotyper;\n \/\/ Configure it\n genotyper.use_mapq = use_mapq;\n genotyper.realign_indels = realign_indels;\n assert(het_prior_denominator > 0);\n genotyper.het_prior_logprob = prob_to_logprob(1.0\/het_prior_denominator);\n genotyper.min_consistent_per_strand = min_consistent_per_strand;\n \/\/ TODO: move arguments below up into configuration\n genotyper.run(*graph,\n alignments,\n cout,\n ref_path_name,\n contig_name,\n sample_name,\n augmented_file_name,\n subset_graph,\n show_progress,\n output_vcf,\n output_json,\n length_override,\n variant_offset);\n\n delete graph;\n\n return 0;\n}\n\n\nstatic Subcommand vg_genotype(\"genotype\", \"Genotype (or type) graphs, GAMS, and VCFs.\", main_genotype);\n<commit_msg>make index argument optional<commit_after>\n#include <getopt.h>\n#include \"subcommand.hpp\"\n#include \"index.hpp\"\n#include \"stream.hpp\"\n#include \"genotyper.hpp\"\n#include \"genotypekit.hpp\"\n#include \"stream.hpp\"\n\/**\n* GAM sort main\n*\/\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\nvoid help_genotype(char** argv) {\n cerr << \"usage: \" << argv[0] << \" genotype [options] <graph.vg> [reads.index\/] > <calls.vcf>\" << endl\n << \"Compute genotypes from a graph and an indexed collection of reads\" << endl\n << endl\n << \"options:\" << endl\n << \" -j, --json output in JSON\" << endl\n << \" -v, --vcf output in VCF\" << endl\n << \" -G, --gam GAM a GAM file to use with variant recall (or in place of index)\" << endl\n << \" -V, --recall-vcf VCF recall variants in a specific VCF file.\" << endl\n << \" -F, --fasta FASTA\" << endl\n << \" -I, --insertions INS\" << endl\n << \" -r, --ref PATH use the given path name as the reference path\" << std::endl\n << \" -c, --contig NAME use the given name as the VCF contig name\" << std::endl\n << \" -s, --sample NAME name the sample in the VCF with the given name\" << std::endl\n << \" -o, --offset INT offset variant positions by this amount\" << std::endl\n << \" -l, --length INT override total sequence length\" << std::endl\n << \" -a, --augmented FILE dump augmented graph to FILE\" << std::endl\n << \" -q, --use_mapq use mapping qualities\" << std::endl\n << \" -S, --subset-graph only use the reference and areas of the graph with read support\" << std::endl\n << \" -i, --realign_indels realign at indels\" << std::endl\n << \" -d, --het_prior_denom denominator for prior probability of heterozygousness\" << std::endl\n << \" -P, --min_per_strand min consistent reads per strand for an allele\" << std::endl\n << \" -p, --progress show progress\" << endl\n << \" -t, --threads N number of threads to use\" << endl;\n}\n\nint main_genotype(int argc, char** argv) {\n\n if (argc <= 2) {\n help_genotype(argv);\n return 1;\n }\n \/\/ Should we output genotypes in JSON (true) or Protobuf (false)?\n bool output_json = false;\n \/\/ Should we output VCF instead of protobuf?\n bool output_vcf = false;\n \/\/ Should we show progress with a progress bar?\n bool show_progress = false;\n \/\/ How many threads should we use?\n int thread_count = 0;\n\n \/\/ What reference path should we use\n string ref_path_name;\n \/\/ What sample name should we use for output\n string sample_name;\n \/\/ What contig name override do we want?\n string contig_name;\n \/\/ What offset should we add to coordinates\n int64_t variant_offset = 0;\n \/\/ What length override should we use\n int64_t length_override = 0;\n\n \/\/ Should we we just do a quick variant recall,\n \/\/ based on this VCF and GAM, then exit?\n string recall_vcf;\n string gam_file;\n string fasta;\n string insertions_file;\n bool useindex = true;\n\n \/\/ Should we use mapping qualities?\n bool use_mapq = false;\n \/\/ Should we do indel realignment?\n bool realign_indels = false;\n\n \/\/ Should we dump the augmented graph to a file?\n string augmented_file_name;\n\n \/\/ Should we find superbubbles on the supported subset (true) or the whole graph (false)?\n bool subset_graph = false;\n \/\/ What should the heterozygous genotype prior be? (1\/this)\n double het_prior_denominator = 10.0;\n \/\/ At least how many reads must be consistent per strand for a call?\n size_t min_consistent_per_strand = 2;\n\n bool just_call = false;\n int c;\n optind = 2; \/\/ force optind past command positional arguments\n while (true) {\n static struct option long_options[] =\n {\n {\"json\", no_argument, 0, 'j'},\n {\"vcf\", no_argument, 0, 'v'},\n {\"ref\", required_argument, 0, 'r'},\n {\"contig\", required_argument, 0, 'c'},\n {\"sample\", required_argument, 0, 's'},\n {\"offset\", required_argument, 0, 'o'},\n {\"length\", required_argument, 0, 'l'},\n {\"augmented\", required_argument, 0, 'a'},\n {\"use_mapq\", no_argument, 0, 'q'},\n {\"subset-graph\", no_argument, 0, 'S'},\n {\"realign_indels\", no_argument, 0, 'i'},\n {\"het_prior_denom\", required_argument, 0, 'd'},\n {\"min_per_strand\", required_argument, 0, 'P'},\n {\"progress\", no_argument, 0, 'p'},\n {\"threads\", required_argument, 0, 't'},\n {\"recall-vcf\", required_argument, 0, 'V'},\n {\"gam\", required_argument, 0, 'G'},\n {\"fasta\", required_argument, 0, 'F'},\n {\"insertions\", required_argument, 0, 'I'},\n {\"call\", no_argument, 0, 'z'},\n {0, 0, 0, 0}\n };\n\n int option_index = 0;\n c = getopt_long (argc, argv, \"hjvr:c:s:o:l:a:qSid:P:pt:V:I:G:F:z\",\n long_options, &option_index);\n\n \/* Detect the end of the options. *\/\n if (c == -1)\n break;\n\n switch (c)\n {\n case 'j':\n output_json = true;\n break;\n case 'v':\n output_vcf = true;\n break;\n case 'r':\n \/\/ Set the reference path name\n ref_path_name = optarg;\n break;\n case 'c':\n \/\/ Set the contig name for output\n contig_name = optarg;\n break;\n case 's':\n \/\/ Set the sample name\n sample_name = optarg;\n break;\n case 'o':\n \/\/ Offset variants\n variant_offset = std::stoll(optarg);\n break;\n case 'l':\n \/\/ Set a length override\n length_override = std::stoll(optarg);\n break;\n case 'a':\n \/\/ Dump augmented graph\n augmented_file_name = optarg;\n break;\n case 'q':\n \/\/ Use mapping qualities\n use_mapq = true;\n break;\n case 'S':\n \/\/ Find sites on the graph subset with any read support\n subset_graph = true;\n break;\n case 'z':\n just_call = true;\n break;\n case 'i':\n \/\/ Do indel realignment\n realign_indels = true;\n break;\n case 'd':\n \/\/ Set heterozygous genotype prior denominator\n het_prior_denominator = std::stod(optarg);\n break;\n case 'P':\n \/\/ Set min consistent reads per strand required to keep an allele\n min_consistent_per_strand = std::stoll(optarg);\n break;\n case 'p':\n show_progress = true;\n break;\n case 't':\n thread_count = atoi(optarg);\n break;\n case 'V':\n recall_vcf = optarg;\n break;\n case 'I':\n insertions_file = optarg;\n break;\n case 'F':\n fasta = optarg;\n break;\n case 'G':\n gam_file = optarg;\n useindex = false;\n break;\n case 'h':\n case '?':\n \/* getopt_long already printed an error message. *\/\n help_genotype(argv);\n exit(1);\n break;\n default:\n abort ();\n }\n }\n\n if(thread_count > 0) {\n omp_set_num_threads(thread_count);\n }\n\n \/\/ read the graph\n if (optind >= argc) {\n help_genotype(argv);\n return 1;\n }\n\n if (show_progress) {\n cerr << \"Reading input graph...\" << endl;\n }\n VG* graph;\n get_input_file(optind, argc, argv, [&](istream& in) {\n graph = new VG(in);\n });\n\n if (just_call){\n Genotyper gt;\n string gamfi(gam_file);\n string rstr(ref_path_name);\n gt.genotype_svs(graph, gamfi, rstr);\n exit(0);\n }\n\n \/\/ setup reads index\n string reads_index_name = \"\";\n if (optind < argc){\n reads_index_name = get_input_file_name(optind, argc, argv);\n\n } else {\n if (gam_file.empty()) {\n cerr << \"[vg genotype] Index argument must be specified when not using -G\" << endl;\n return 1;\n }\n }\n \n \/\/ This holds the RocksDB index that has all our reads, indexed by the nodes they visit.\n Index index;\n if (useindex){\n index.open_read_only(reads_index_name);\n gam_file = reads_index_name;\n }\n\n \/\/ Build the set of all the node IDs to operate on\n vector<vg::id_t> graph_ids;\n graph->for_each_node([&](Node* node) {\n \/\/ Put all the ids in the set\n graph_ids.push_back(node->id());\n });\n\n if (!(recall_vcf.empty() || fasta.empty())){\n Genotyper gt;\n vcflib::VariantCallFile* vars = new vcflib::VariantCallFile();\n vars->open(recall_vcf);\n FastaReference* lin_ref = new FastaReference();\n lin_ref->open(fasta);\n\n vector<FastaReference*> insertions;\n if (!insertions_file.empty()){\n FastaReference* ins = new FastaReference();\n insertions.emplace_back(ins);\n ins->open(insertions_file);\n }\n gt.variant_recall(graph, vars, lin_ref, insertions, gam_file, useindex);\n return 0;\n\n }\n\n \/\/ Load all the reads matching the graph into memory\n vector<Alignment> alignments;\n\n if(show_progress) {\n cerr << \"Loading reads...\" << endl;\n }\n\n function<bool(const Alignment&)> alignment_contained = [&graph](const Alignment& alignment) {\n for(size_t i = 0; i < alignment.path().mapping_size(); i++) {\n if(!graph->has_node(alignment.path().mapping(i).position().node_id())) {\n return false;\n }\n }\n return alignment.path().mapping_size() > 0;\n };\n\n if (useindex) {\n \/\/ Extract all the alignments\n index.for_alignment_to_nodes(graph_ids, [&](const Alignment& alignment) {\n \/\/ Only take alignments that don't visit nodes not in the graph\n if (alignment_contained(alignment)) {\n alignments.push_back(alignment);\n }\n });\n } else {\n \/\/ load in all reads (activated by passing GAM directly with -G).\n \/\/ This is used by, ex., toil-vg, which has already used the gam index\n \/\/ to extract relevant reads\n ifstream gam_reads(gam_file.c_str());\n if (!gam_reads) {\n cerr << \"[vg genotype] Error opening gam: \" << gam_file << endl;\n return 1;\n }\n stream::for_each<Alignment>(gam_reads, [&alignments, &alignment_contained](Alignment& alignment) {\n if (alignment_contained(alignment)) {\n alignments.push_back(alignment);\n }\n });\n }\n \n if(show_progress) {\n cerr << \"Loaded \" << alignments.size() << \" alignments\" << endl;\n }\n\n \/\/ Make a Genotyper to do the genotyping\n Genotyper genotyper;\n \/\/ Configure it\n genotyper.use_mapq = use_mapq;\n genotyper.realign_indels = realign_indels;\n assert(het_prior_denominator > 0);\n genotyper.het_prior_logprob = prob_to_logprob(1.0\/het_prior_denominator);\n genotyper.min_consistent_per_strand = min_consistent_per_strand;\n \/\/ TODO: move arguments below up into configuration\n genotyper.run(*graph,\n alignments,\n cout,\n ref_path_name,\n contig_name,\n sample_name,\n augmented_file_name,\n subset_graph,\n show_progress,\n output_vcf,\n output_json,\n length_override,\n variant_offset);\n\n delete graph;\n\n return 0;\n}\n\n\nstatic Subcommand vg_genotype(\"genotype\", \"Genotype (or type) graphs, GAMS, and VCFs.\", main_genotype);\n<|endoftext|>"} {"text":"<commit_before>#include \"test_slitherlink_field.h\"\r\n#include \"test.h\"\r\n\r\n#include <cassert>\r\n#include <vector>\r\n\r\n#include \"..\/slitherlink\/sl_field.h\"\r\n#include \"..\/slitherlink\/sl_database.h\"\r\n\r\nnamespace\r\n{\r\n\/\/ Place clues and check edges\r\nvoid DoAddClueTest(penciloid::Y height, penciloid::X width, std::vector<const char*> test_target, penciloid::slitherlink::Database *db)\r\n{\r\n\tusing namespace penciloid;\r\n\tusing namespace penciloid::slitherlink;\r\n\r\n\tField field(height, width);\r\n\tfield.SetDatabase(db);\r\n\r\n\tfor (Y y = 0; y < height; ++y) {\r\n\t\tfor (X x = 0; x < width; ++x) {\r\n\t\t\tif ('0' <= test_target[y * 2 + 1][x * 2 + 1] && test_target[y * 2 + 1][x * 2 + 1] <= '3') {\r\n\t\t\t\tfield.AddClue(Position(y, x), test_target[y * 2 + 1][x * 2 + 1] - '0');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfor (Y y = 0; y <= 2 * height; ++y) {\r\n\t\tfor (X x = 0; x <= 2 * width; ++x) {\r\n\t\t\tif (y % 2 != x % 2) {\r\n\t\t\t\tField::EdgeState expected;\r\n\t\t\t\tif (test_target[y][x] == 'x') expected = Field::EDGE_BLANK;\r\n\t\t\t\telse if (test_target[y][x] == ' ') expected = Field::EDGE_UNDECIDED;\r\n\t\t\t\telse expected = Field::EDGE_LINE;\r\n\r\n\t\t\t\tif (field.GetEdge(Position(y, x)) != expected) {\r\n\t\t\t\t\ty = y;\r\n\t\t\t\t}\r\n\t\t\t\tassert(field.GetEdge(Position(y, x)) == expected);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n}\r\n\r\nnamespace penciloid\r\n{\r\nnamespace test\r\n{\r\nvoid RunAllSlitherlinkFieldTest()\r\n{\r\n\tSlitherlinkFieldAddClue();\r\n\tSlitherlinkFieldTheorem();\r\n}\r\nvoid SlitherlinkFieldAddClue()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" x0x \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+ + +\",\r\n\t\t\"x1 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ +-+ +\",\r\n\t\t\" 2 \",\r\n\t\t\"+ + + +\",\r\n\t\t\"| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+ + +\",\r\n\t\t\"|3 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+x+-+\",\r\n\t\t\"x0x2| |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"x | x |\",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+ +\",\r\n\t\t\"| x \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+-+\",\r\n\t\t\"| x2| x\",\r\n\t\t\"+ +-+x+\",\r\n\t\t\" x x\",\r\n\t\t\"+ +x+x+\",\r\n\t}, &db);\r\n}\r\nvoid SlitherlinkFieldTheorem()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t\t\"|3|3| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 4, {\r\n\t\t\"+ + +-+x+\",\r\n\t\t\" 3| x\",\r\n\t\t\"+ + + + +\",\r\n\t\t\" |3 \",\r\n\t\t\"+x+-+ + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + + +\",\r\n\t}, &db);\r\n}\r\n}\r\n}\r\n<commit_msg>Slitherlink: add a test case<commit_after>#include \"test_slitherlink_field.h\"\r\n#include \"test.h\"\r\n\r\n#include <cassert>\r\n#include <vector>\r\n\r\n#include \"..\/slitherlink\/sl_field.h\"\r\n#include \"..\/slitherlink\/sl_database.h\"\r\n\r\nnamespace\r\n{\r\n\/\/ Place clues and check edges\r\nvoid DoAddClueTest(penciloid::Y height, penciloid::X width, std::vector<const char*> test_target, penciloid::slitherlink::Database *db)\r\n{\r\n\tusing namespace penciloid;\r\n\tusing namespace penciloid::slitherlink;\r\n\r\n\tField field(height, width);\r\n\tfield.SetDatabase(db);\r\n\r\n\tfor (Y y = 0; y < height; ++y) {\r\n\t\tfor (X x = 0; x < width; ++x) {\r\n\t\t\tif ('0' <= test_target[y * 2 + 1][x * 2 + 1] && test_target[y * 2 + 1][x * 2 + 1] <= '3') {\r\n\t\t\t\tfield.AddClue(Position(y, x), test_target[y * 2 + 1][x * 2 + 1] - '0');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfor (Y y = 0; y <= 2 * height; ++y) {\r\n\t\tfor (X x = 0; x <= 2 * width; ++x) {\r\n\t\t\tif (y % 2 != x % 2) {\r\n\t\t\t\tField::EdgeState expected;\r\n\t\t\t\tif (test_target[y][x] == 'x') expected = Field::EDGE_BLANK;\r\n\t\t\t\telse if (test_target[y][x] == ' ') expected = Field::EDGE_UNDECIDED;\r\n\t\t\t\telse expected = Field::EDGE_LINE;\r\n\r\n\t\t\t\tif (field.GetEdge(Position(y, x)) != expected) {\r\n\t\t\t\t\ty = y;\r\n\t\t\t\t}\r\n\t\t\t\tassert(field.GetEdge(Position(y, x)) == expected);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n}\r\n\r\nnamespace penciloid\r\n{\r\nnamespace test\r\n{\r\nvoid RunAllSlitherlinkFieldTest()\r\n{\r\n\tSlitherlinkFieldAddClue();\r\n\tSlitherlinkFieldTheorem();\r\n}\r\nvoid SlitherlinkFieldAddClue()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" x0x \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+ + +\",\r\n\t\t\"x1 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ +-+ +\",\r\n\t\t\" 2 \",\r\n\t\t\"+ + + +\",\r\n\t\t\"| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+ + +\",\r\n\t\t\"|3 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+x+-+\",\r\n\t\t\"x0x2| |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"x | x |\",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+ +\",\r\n\t\t\"| x \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+-+\",\r\n\t\t\"| x2| x\",\r\n\t\t\"+ +-+x+\",\r\n\t\t\" x x\",\r\n\t\t\"+ +x+x+\",\r\n\t}, &db);\r\n}\r\nvoid SlitherlinkFieldTheorem()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t\t\"|3|3| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 4, {\r\n\t\t\"+ + +-+x+\",\r\n\t\t\" 3| x\",\r\n\t\t\"+ + + + +\",\r\n\t\t\" |3 \",\r\n\t\t\"+x+-+ + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"| x x |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"|3|3| |\",\r\n\t\t\"+-+x+ +\",\r\n\t\t\"x1x \",\r\n\t\t\"+x+x+ +\",\r\n\t}, &db);\r\n}\r\n}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/* Finds the distance between the origin and a polytope (defined by its vertices) using bullet's low level functions. Uses GJK and EPA algorithms.\n\nAuthor: Anirudha Majumdar\nDate: Nov 8 2013\n*\/\n\n\n\/\/\/We need internal access to bullet\n\/\/ #include \"GL_Simplex1to4.h\"\n#include \"LinearMath\/btTransform.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btVoronoiSimplexSolver.h\"\n\n#include \"BulletCollision\/CollisionShapes\/btSphereShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btBoxShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btConvexHullShape.h\"\n\/\/ #include <iostream>\n\/\/ #include <chrono>\n\/\/ #include <ctime>\n\/\/ #include <time.h>\n\n#include \"BulletCollision\/NarrowPhaseCollision\/btGjkPairDetector.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btPointCollector.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btVoronoiSimplexSolver.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btConvexPenetrationDepthSolver.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btGjkEpaPenetrationDepthSolver.h\"\n#include \"LinearMath\/btTransformUtil.h\"\n\n#include <mex.h>\n#include <drakeMexUtil.h>\n\nusing namespace std;\n\n\/\/ Set solvers\nstatic btVoronoiSimplexSolver sGjkSimplexSolver;\nstatic btGjkEpaPenetrationDepthSolver epaSolver;\n\n\/*Sphere of radius r representing the point. \nWe could probably make the radius 0 and be ok, but I'm not sure if bullet expects things to be non-degenrate.\n*\/\nstatic const double radius = 0.5;\nstatic btSphereShape* point = new btSphereShape(radius); \n\nvoid mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[])\n{\n\t \/\/ Check for proper number of arguments.\n \t if(nrhs!=1) {\n\t mexErrMsgIdAndTxt( \"MATLAB:ptToPolyDist:invalidNumInputs\",\n \t \"One input required.\");\n\t } else if(nlhs>1) {\n \t mexErrMsgIdAndTxt( \"MATLAB:ptToPolyDist:maxlhs\",\n \t \"Too many output arguments.\");\n\t }\n\n\t\/\/ Get inputs\n\t double *vertsPr;\n\t vertsPr = mxGetPrSafe(prhs[0]);\n\t const int nRows = mxGetM(prhs[0]); \/\/ number of rows\n\t const int nCols = mxGetN(prhs[0]); \/\/ number of columns\n\n\t \/\/ Check to see if number of rows of vertices is 3\n\t if(nRows != 3){\n\t mexErrMsgIdAndTxt( \"MATLAB:ptToPolyDist:invalidInputs\",\n\t\t \"Input should be 3 x N\");\n\t }\n\n\n\t\/\/ Initialize polytope object with single point\n\tbtConvexHullShape polytope(btVector3(vertsPr[0],vertsPr[1],vertsPr[2]), 1);\n\n\t\/\/ Add rest of the points (note the indexing starts from 1 on the loop)\n\tfor(int i=1;i<nCols;i++){\n\t\t\tpolytope.addPoint(btVector3(vertsPr[i*nRows],vertsPr[i*nRows+1],vertsPr[i*nRows+2]));\n\n\t\/*\n\tmexPrintf(\"i: %d\\n\", i);\n\tmexPrintf(\"x: %f\", vertsPr[i*nRows]);\n\tmexPrintf(\"y: %f\", vertsPr[i*nRows+1]);\n\tmexPrintf(\"z: %f\\n\", vertsPr[i*nRows+2]);*\/\n\n\n\t}\n\n\n\t\/\/ btConvexHullShape polytope(&points0[0].getX(),6);\n\n\t \/\/ Assign elements of verts (input) to polytope\n\tbtTransform tr;\n\tbtGjkPairDetector::ClosestPointInput input; \n\ttr.setIdentity();\n\tinput.m_transformA = tr;\n\tinput.m_transformB = tr;\n\n\tbtGjkPairDetector convexConvex(point,&polytope,&sGjkSimplexSolver,&epaSolver);\n\t\t\n\t\/\/ Output\n\tbtPointCollector gjkOutput; \n\n\tconvexConvex.getClosestPoints(input, gjkOutput, 0);\n\t\n\t\/\/ mexPrintf(\"Hello!\\n\");\n\n\tplhs[0] = mxCreateDoubleScalar(gjkOutput.m_distance + radius + CONVEX_DISTANCE_MARGIN);\n\n \/\/ cout << gjkOutput.m_distance + radius + CONVEX_DISTANCE_MARGIN << endl;\n\n}\n\n\n<commit_msg>mex errors are now Drake errors instead of MATLAB errors<commit_after>\/* Finds the distance between the origin and a polytope (defined by its vertices) using bullet's low level functions. Uses GJK and EPA algorithms.\n\nAuthor: Anirudha Majumdar\nDate: Nov 8 2013\n*\/\n\n\n\/\/\/We need internal access to bullet\n\/\/ #include \"GL_Simplex1to4.h\"\n#include \"LinearMath\/btTransform.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btVoronoiSimplexSolver.h\"\n\n#include \"BulletCollision\/CollisionShapes\/btSphereShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btBoxShape.h\"\n#include \"BulletCollision\/CollisionShapes\/btConvexHullShape.h\"\n\/\/ #include <iostream>\n\/\/ #include <chrono>\n\/\/ #include <ctime>\n\/\/ #include <time.h>\n\n#include \"BulletCollision\/NarrowPhaseCollision\/btGjkPairDetector.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btPointCollector.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btVoronoiSimplexSolver.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btConvexPenetrationDepthSolver.h\"\n#include \"BulletCollision\/NarrowPhaseCollision\/btGjkEpaPenetrationDepthSolver.h\"\n#include \"LinearMath\/btTransformUtil.h\"\n\n#include <mex.h>\n#include <drakeMexUtil.h>\n\nusing namespace std;\n\n\/\/ Set solvers\nstatic btVoronoiSimplexSolver sGjkSimplexSolver;\nstatic btGjkEpaPenetrationDepthSolver epaSolver;\n\n\/*Sphere of radius r representing the point. \nWe could probably make the radius 0 and be ok, but I'm not sure if bullet expects things to be non-degenrate.\n*\/\nstatic const double radius = 0.5;\nstatic btSphereShape* point = new btSphereShape(radius); \n\nvoid mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[])\n{\n\t \/\/ Check for proper number of arguments.\n \t if(nrhs!=1) {\n\t mexErrMsgIdAndTxt( \"Drake:ptToPolyDist:invalidNumInputs\",\n \t \"One input required.\");\n\t } else if(nlhs>1) {\n \t mexErrMsgIdAndTxt( \"Drake:ptToPolyDist:maxlhs\",\n \t \"Too many output arguments.\");\n\t }\n\n\t\/\/ Get inputs\n\t double *vertsPr;\n\t vertsPr = mxGetPrSafe(prhs[0]);\n\t const int nRows = mxGetM(prhs[0]); \/\/ number of rows\n\t const int nCols = mxGetN(prhs[0]); \/\/ number of columns\n\n\t \/\/ Check to see if number of rows of vertices is 3\n\t if(nRows != 3){\n\t mexErrMsgIdAndTxt( \"Drake:ptToPolyDist:invalidInputs\",\n\t\t \"Input should be 3 x N\");\n\t }\n\n\n\t\/\/ Initialize polytope object with single point\n\tbtConvexHullShape polytope(btVector3(vertsPr[0],vertsPr[1],vertsPr[2]), 1);\n\n\t\/\/ Add rest of the points (note the indexing starts from 1 on the loop)\n\tfor(int i=1;i<nCols;i++){\n\t\t\tpolytope.addPoint(btVector3(vertsPr[i*nRows],vertsPr[i*nRows+1],vertsPr[i*nRows+2]));\n\n\t\/*\n\tmexPrintf(\"i: %d\\n\", i);\n\tmexPrintf(\"x: %f\", vertsPr[i*nRows]);\n\tmexPrintf(\"y: %f\", vertsPr[i*nRows+1]);\n\tmexPrintf(\"z: %f\\n\", vertsPr[i*nRows+2]);*\/\n\n\n\t}\n\n\n\t\/\/ btConvexHullShape polytope(&points0[0].getX(),6);\n\n\t \/\/ Assign elements of verts (input) to polytope\n\tbtTransform tr;\n\tbtGjkPairDetector::ClosestPointInput input; \n\ttr.setIdentity();\n\tinput.m_transformA = tr;\n\tinput.m_transformB = tr;\n\n\tbtGjkPairDetector convexConvex(point,&polytope,&sGjkSimplexSolver,&epaSolver);\n\t\t\n\t\/\/ Output\n\tbtPointCollector gjkOutput; \n\n\tconvexConvex.getClosestPoints(input, gjkOutput, 0);\n\t\n\t\/\/ mexPrintf(\"Hello!\\n\");\n\n\tplhs[0] = mxCreateDoubleScalar(gjkOutput.m_distance + radius + CONVEX_DISTANCE_MARGIN);\n\n \/\/ cout << gjkOutput.m_distance + radius + CONVEX_DISTANCE_MARGIN << endl;\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"BBNodeManagerAIG.h\"\n\nnamespace BEEV\n{\n\n void\n BBNodeManagerAIG::toCNF(const BBNodeAIG& top, Cnf_Dat_t*& cnfData, ToSATBase::ASTNodeToSATVar& nodeToVar, const UserDefinedFlags& uf)\n {\n assert(cnfData == NULL);\n\n Aig_ObjCreatePo(aigMgr, top.n);\n Aig_ManCleanup(aigMgr); \/\/ remove nodes not connected to the PO.\n Aig_ManCheck(aigMgr); \/\/ check that AIG looks ok.\n\n assert(Aig_ManPoNum(aigMgr) == 1);\n\n \/\/ UseZeroes gives assertion errors.\n \/\/ Rewriting is sometimes very slow. Can it be configured to be faster?\n \/\/ What about refactoring???\n\n int nodeCount = aigMgr->nObjs[AIG_OBJ_AND];\n if (uf.stats_flag)\n cerr << \"Nodes before AIG rewrite:\" << nodeCount <<endl;\n\n\n if (uf.enable_AIG_rewrites_flag && aigMgr->nObjs[AIG_OBJ_AND] < 5000)\n {\n Dar_LibStart();\n Aig_Man_t * pTemp;\n Dar_RwrPar_t Pars, * pPars = &Pars;\n Dar_ManDefaultRwrParams( pPars );\n\n \/\/ Assertion errors occur with this enabled.\n \/\/ pPars->fUseZeros = 1;\n\n \/\/ For mul63bit.smt2 with iterations =3 & nCutsMax = 8\n \/\/ CNF generation was taking 139 seconds, solving 10 seconds.\n\n \/\/ With nCutsMax =2, CNF generation takes 16 seconds, solving 10 seconds.\n \/\/ The rewriting doesn't remove as many nodes of course..\n int iterations = 3;\n\n for (int i=0; i < iterations;i++)\n {\n aigMgr = Aig_ManDup( pTemp = aigMgr, 0 );\n Aig_ManStop( pTemp );\n Dar_ManRewrite( aigMgr, pPars );\n\n aigMgr = Aig_ManDup( pTemp = aigMgr, 0 );\n Aig_ManStop( pTemp );\n\n if (uf.stats_flag)\n cerr << \"After rewrite [\" << i << \"] nodes:\" << aigMgr->nObjs[AIG_OBJ_AND] << endl;\n\n if (nodeCount == aigMgr->nObjs[AIG_OBJ_AND])\n break;\n }\n }\n cnfData = Cnf_Derive(aigMgr, 0);\n\n BBNodeManagerAIG::SymbolToBBNode::const_iterator it;\n\n assert(nodeToVar.size() ==0);\n\n \/\/ Each symbol maps to a vector of CNF variables.\n for (it = symbolToBBNode.begin(); it != symbolToBBNode.end(); it++)\n {\n const ASTNode& n = it->first;\n const vector<BBNodeAIG> &b = it->second;\n assert (nodeToVar.find(n) == nodeToVar.end());\n\n const int width = (n.GetType() == BOOLEAN_TYPE) ? 1: n.GetValueWidth();\n\n \/\/ INT_MAX for parts of symbols that didn't get encoded.\n vector<unsigned> v(width, ~((unsigned) 0));\n\n for (unsigned i = 0; i < b.size(); i++)\n {\n if (!b[i].IsNull())\n {\n Aig_Obj_t * pObj;\n pObj = (Aig_Obj_t*)Vec_PtrEntry( aigMgr->vPis, b[i].symbol_index );\n v[i] = cnfData->pVarNums[pObj->Id];\n }\n }\n\n nodeToVar.insert(make_pair(n, v));\n }\n assert(cnfData != NULL);\n }\n}\n\n\n<commit_msg>When encoding to CNF via ABC, use the simple mapping if there are more than 10M nodes. This is because currently ABC seems to have a 4GB memory limit internally. So any more than about 10M nodes maxes out the memory.<commit_after>#include \"BBNodeManagerAIG.h\"\n\nnamespace BEEV\n{\n\n void\n BBNodeManagerAIG::toCNF(const BBNodeAIG& top, Cnf_Dat_t*& cnfData, ToSATBase::ASTNodeToSATVar& nodeToVar, const UserDefinedFlags& uf)\n {\n assert(cnfData == NULL);\n\n Aig_ObjCreatePo(aigMgr, top.n);\n Aig_ManCleanup(aigMgr); \/\/ remove nodes not connected to the PO.\n Aig_ManCheck(aigMgr); \/\/ check that AIG looks ok.\n\n assert(Aig_ManPoNum(aigMgr) == 1);\n\n \/\/ UseZeroes gives assertion errors.\n \/\/ Rewriting is sometimes very slow. Can it be configured to be faster?\n \/\/ What about refactoring???\n\n int nodeCount = aigMgr->nObjs[AIG_OBJ_AND];\n if (uf.stats_flag)\n cerr << \"Nodes before AIG rewrite:\" << nodeCount <<endl;\n\n\n if (uf.enable_AIG_rewrites_flag && aigMgr->nObjs[AIG_OBJ_AND] < 5000)\n {\n Dar_LibStart();\n Aig_Man_t * pTemp;\n Dar_RwrPar_t Pars, * pPars = &Pars;\n Dar_ManDefaultRwrParams( pPars );\n\n \/\/ Assertion errors occur with this enabled.\n \/\/ pPars->fUseZeros = 1;\n\n \/\/ For mul63bit.smt2 with iterations =3 & nCutsMax = 8\n \/\/ CNF generation was taking 139 seconds, solving 10 seconds.\n\n \/\/ With nCutsMax =2, CNF generation takes 16 seconds, solving 10 seconds.\n \/\/ The rewriting doesn't remove as many nodes of course..\n int iterations = 3;\n\n for (int i=0; i < iterations;i++)\n {\n aigMgr = Aig_ManDup( pTemp = aigMgr, 0 );\n Aig_ManStop( pTemp );\n Dar_ManRewrite( aigMgr, pPars );\n\n aigMgr = Aig_ManDup( pTemp = aigMgr, 0 );\n Aig_ManStop( pTemp );\n\n if (uf.stats_flag)\n cerr << \"After rewrite [\" << i << \"] nodes:\" << aigMgr->nObjs[AIG_OBJ_AND] << endl;\n\n if (nodeCount == aigMgr->nObjs[AIG_OBJ_AND])\n break;\n }\n }\n if (aigMgr->nObjs[AIG_OBJ_AND] < 10000000)\n cnfData = Cnf_Derive(aigMgr, 0);\n else\n cnfData = Cnf_DeriveSimple(aigMgr, 0);\n\n BBNodeManagerAIG::SymbolToBBNode::const_iterator it;\n\n assert(nodeToVar.size() ==0);\n\n \/\/ Each symbol maps to a vector of CNF variables.\n for (it = symbolToBBNode.begin(); it != symbolToBBNode.end(); it++)\n {\n const ASTNode& n = it->first;\n const vector<BBNodeAIG> &b = it->second;\n assert (nodeToVar.find(n) == nodeToVar.end());\n\n const int width = (n.GetType() == BOOLEAN_TYPE) ? 1: n.GetValueWidth();\n\n \/\/ INT_MAX for parts of symbols that didn't get encoded.\n vector<unsigned> v(width, ~((unsigned) 0));\n\n for (unsigned i = 0; i < b.size(); i++)\n {\n if (!b[i].IsNull())\n {\n Aig_Obj_t * pObj;\n pObj = (Aig_Obj_t*)Vec_PtrEntry( aigMgr->vPis, b[i].symbol_index );\n v[i] = cnfData->pVarNums[pObj->Id];\n }\n }\n\n nodeToVar.insert(make_pair(n, v));\n }\n assert(cnfData != NULL);\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2016 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ Authors:\n\/\/ Felix Schindler (2016)\n\n#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/assembler\/system.hh>\n#include <dune\/gdt\/discretizations\/default.hh>\n#include <dune\/gdt\/functionals\/elliptic-ipdg.hh>\n#include <dune\/gdt\/operators\/elliptic-ipdg.hh>\n#include <dune\/gdt\/spaces\/dg.hh>\n\n#include \"..\/problems\/interface.hh\"\n#include \"base.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\brief Discretizes a linear elliptic PDE using an interior penalty discontinuous Galerkin Finite Element method.\n *\/\ntemplate <class GridType,\n XT::Grid::Layers layer = XT::Grid::Layers::leaf,\n ChooseSpaceBackend spacebackend = default_dg_backend,\n XT::LA::Backends la = XT::LA::default_sparse_backend,\n int pol = 1,\n class RangeFieldType = double,\n size_t dimRange = 1,\n LocalEllipticIpdgIntegrands::Method method = LocalEllipticIpdgIntegrands::default_method>\nclass IpdgDiscretizer\n{\npublic:\n typedef ProblemInterface<typename GridType::template Codim<0>::Entity,\n typename GridType::ctype,\n GridType::dimension,\n RangeFieldType,\n dimRange>\n ProblemType;\n typedef DgSpaceProvider<GridType, layer, spacebackend, pol, RangeFieldType, dimRange> SpaceProvider;\n typedef typename SpaceProvider::Type SpaceType;\n typedef typename XT::LA::Container<RangeFieldType, la>::MatrixType MatrixType;\n typedef typename XT::LA::Container<RangeFieldType, la>::VectorType VectorType;\n typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n DiscretizationType;\n static const constexpr ChooseDiscretizer type = ChooseDiscretizer::swipdg;\n static const constexpr XT::LA::Backends la_backend = la;\n static const int polOrder = pol;\n\n static std::string static_id() \/\/ int() needed, otherwise we\n { \/\/ get a linker error\n return std::string(\"gdt.linearelliptic.discretization.swipdg.order_\") + Dune::XT::Common::to_string(int(polOrder));\n }\n\n static DiscretizationType\n discretize(XT::Grid::GridProvider<GridType>& grid_provider, const ProblemType& problem, const int level = 0)\n {\n auto logger = XT::Common::TimedLogger().get(static_id());\n logger.info() << \"Creating space... \" << std::endl;\n auto space = SpaceProvider::create(grid_provider, level);\n logger.debug() << \"grid has \" << space.grid_view().indexSet().size(0) << \" elements\" << std::endl;\n typedef typename SpaceType::GridViewType GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n auto boundary_info = XT::Grid::BoundaryInfoFactory<IntersectionType>::create(problem.boundary_info_cfg());\n logger.info() << \"Assembling... \" << std::endl;\n VectorType rhs_vector(space.mapper().size(), 0.0);\n auto ipdg_operator = make_elliptic_ipdg_matrix_operator<MatrixType, method>(\n problem.diffusion_factor(), problem.diffusion_tensor(), *boundary_info, space);\n auto ipdg_boundary_functional = make_elliptic_ipdg_dirichlet_vector_functional<method>(\n problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor(), *boundary_info, rhs_vector, space);\n auto l2_force_functional = make_l2_volume_vector_functional(problem.force(), rhs_vector, space);\n auto l2_neumann_functional =\n make_l2_face_vector_functional(problem.neumann(),\n rhs_vector,\n space,\n new XT::Grid::ApplyOn::NeumannIntersections<GridViewType>(*boundary_info));\n \/\/ register everything for assembly in one grid walk\n SystemAssembler<SpaceType> assembler(space);\n assembler.add(*ipdg_operator);\n assembler.add(*ipdg_boundary_functional);\n assembler.add(*l2_force_functional);\n assembler.add(*l2_neumann_functional);\n assembler.assemble();\n \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n return DiscretizationType(problem, space, ipdg_operator->matrix(), rhs_vector);\n } \/\/ ... discretize(...)\n}; \/\/ class IpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n<commit_msg>[test...linearelliptic.ipdg] add missing include<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2016 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ Authors:\n\/\/ Felix Schindler (2016)\n\n#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/assembler\/system.hh>\n#include <dune\/gdt\/discretizations\/default.hh>\n#include <dune\/gdt\/functionals\/elliptic-ipdg.hh>\n#include <dune\/gdt\/functionals\/l2.hh>\n#include <dune\/gdt\/operators\/elliptic-ipdg.hh>\n#include <dune\/gdt\/spaces\/dg.hh>\n\n#include \"..\/problems\/interface.hh\"\n#include \"base.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\brief Discretizes a linear elliptic PDE using an interior penalty discontinuous Galerkin Finite Element method.\n *\/\ntemplate <class GridType,\n XT::Grid::Layers layer = XT::Grid::Layers::leaf,\n ChooseSpaceBackend spacebackend = default_dg_backend,\n XT::LA::Backends la = XT::LA::default_sparse_backend,\n int pol = 1,\n class RangeFieldType = double,\n size_t dimRange = 1,\n LocalEllipticIpdgIntegrands::Method method = LocalEllipticIpdgIntegrands::default_method>\nclass IpdgDiscretizer\n{\npublic:\n typedef ProblemInterface<typename GridType::template Codim<0>::Entity,\n typename GridType::ctype,\n GridType::dimension,\n RangeFieldType,\n dimRange>\n ProblemType;\n typedef DgSpaceProvider<GridType, layer, spacebackend, pol, RangeFieldType, dimRange> SpaceProvider;\n typedef typename SpaceProvider::Type SpaceType;\n typedef typename XT::LA::Container<RangeFieldType, la>::MatrixType MatrixType;\n typedef typename XT::LA::Container<RangeFieldType, la>::VectorType VectorType;\n typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n DiscretizationType;\n static const constexpr ChooseDiscretizer type = ChooseDiscretizer::swipdg;\n static const constexpr XT::LA::Backends la_backend = la;\n static const int polOrder = pol;\n\n static std::string static_id() \/\/ int() needed, otherwise we\n { \/\/ get a linker error\n return std::string(\"gdt.linearelliptic.discretization.swipdg.order_\") + Dune::XT::Common::to_string(int(polOrder));\n }\n\n static DiscretizationType\n discretize(XT::Grid::GridProvider<GridType>& grid_provider, const ProblemType& problem, const int level = 0)\n {\n auto logger = XT::Common::TimedLogger().get(static_id());\n logger.info() << \"Creating space... \" << std::endl;\n auto space = SpaceProvider::create(grid_provider, level);\n logger.debug() << \"grid has \" << space.grid_view().indexSet().size(0) << \" elements\" << std::endl;\n typedef typename SpaceType::GridViewType GridViewType;\n typedef typename GridViewType::Intersection IntersectionType;\n auto boundary_info = XT::Grid::BoundaryInfoFactory<IntersectionType>::create(problem.boundary_info_cfg());\n logger.info() << \"Assembling... \" << std::endl;\n VectorType rhs_vector(space.mapper().size(), 0.0);\n auto ipdg_operator = make_elliptic_ipdg_matrix_operator<MatrixType, method>(\n problem.diffusion_factor(), problem.diffusion_tensor(), *boundary_info, space);\n auto ipdg_boundary_functional = make_elliptic_ipdg_dirichlet_vector_functional<method>(\n problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor(), *boundary_info, rhs_vector, space);\n auto l2_force_functional = make_l2_volume_vector_functional(problem.force(), rhs_vector, space);\n auto l2_neumann_functional =\n make_l2_face_vector_functional(problem.neumann(),\n rhs_vector,\n space,\n new XT::Grid::ApplyOn::NeumannIntersections<GridViewType>(*boundary_info));\n \/\/ register everything for assembly in one grid walk\n SystemAssembler<SpaceType> assembler(space);\n assembler.add(*ipdg_operator);\n assembler.add(*ipdg_boundary_functional);\n assembler.add(*l2_force_functional);\n assembler.add(*l2_neumann_functional);\n assembler.assemble();\n \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n return DiscretizationType(problem, space, ipdg_operator->matrix(), rhs_vector);\n } \/\/ ... discretize(...)\n}; \/\/ class IpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_IPDG_HH\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* All contents are licensed under LGPL V2.1 *\/\n\/* See LICENSE for full restrictions *\/\n\/****************************************************************\/\n\n#include \"SinkMapUserObject.h\"\n#include \"MooseMesh.h\"\n#include \"GaussianUserObject.h\"\n\n\/\/ libmesh includes\n#include \"libmesh\/quadrature.h\"\n\ntemplate<>\nInputParameters validParams<SinkMapUserObject>()\n{\n MooseEnum sink_placement(\"corner inside\", \"corner\");\n MooseEnum sink_shape_3d(\"spheres lines\", \"lines\");\n\n InputParameters params = validParams<ElementUserObject>();\n params.addRequiredParam<Real>(\"spacing\", \"Distance to space sink centers\");\n params.addRequiredParam<Real>(\"strength\", \"Average strength of the overall sink map.\");\n params.addRequiredParam<UserObjectName>(\"gaussian_user_object\", \"Name of the GaussianUserObject to use for sink shapes.\");\n params.addParam<MooseEnum>(\"sink_placement\", sink_placement, \"How to place sinks on domain, choices are 'corner' to place them in the corners (and wrap around), and 'inside' to keep them away from edges.\");\n params.addParam<MooseEnum>(\"sink_shape_3d\", sink_shape_3d, \"Shape to use for sinks in 3D, choices are 'spheres' or 'lines'.\");\n params.addCoupledVar(\"periodic_variable\", \"Use the periodicity settings of this variable to populate the grain map\");\n\n MultiMooseEnum setup_options(SetupInterface::getExecuteOptions());\n \/\/ the mapping needs to run at timestep begin, which is after the adaptivity\n \/\/ run of the previous timestep.\n setup_options = \"timestep_begin\";\n params.set<MultiMooseEnum>(\"execute_on\") = setup_options;\n return params;\n}\n\nSinkMapUserObject::SinkMapUserObject(const InputParameters & parameters) :\n ElementUserObject(parameters),\n _spacing(getParam<Real>(\"spacing\")),\n _strength(getParam<Real>(\"strength\")),\n _gaussian_user_object_ptr(NULL),\n _sink_placement(getParam<MooseEnum>(\"sink_placement\")),\n _sink_shape_3d(getParam<MooseEnum>(\"sink_shape_3d\")),\n _periodic_var(isCoupled(\"periodic_variable\") ? coupled(\"periodic_variable\") : -1),\n _dim(_mesh.dimension()),\n _mesh_changed(true)\n{\n _zero_map.assign(_fe_problem.getMaxQps(), 0.0);\n}\n\nvoid\nSinkMapUserObject::initialSetup()\n{\n \/\/ get sink sigma\n _gaussian_user_object_ptr = &getUserObject<GaussianUserObject>(\"gaussian_user_object\");\n _sigma = _gaussian_user_object_ptr->getSigma();\n\n \/\/ calculate sink locations\n if (_sink_placement == \"corner\")\n {\n \/\/ yes this is dumb, but it works\n for (Real x_center = _mesh.getMinInDimension(0); x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0); x_center += _spacing)\n for (Real y_center = _mesh.getMinInDimension(1); y_center <= _mesh.getMinInDimension(1) + _mesh.dimensionWidth(1); y_center += _spacing)\n if ((_dim == 3) && (_sink_shape_3d == \"spheres\"))\n for (Real z_center = _mesh.getMinInDimension(2); z_center <= _mesh.getMinInDimension(2) + _mesh.dimensionWidth(2); z_center += _spacing)\n _sink_location_list.push_back(Point(x_center, y_center, z_center));\n else\n _sink_location_list.push_back(Point(x_center, y_center, 0.0));\n }\n else \/\/ centered sink placement\n {\n if (_dim == 1)\n for (Real x_center = _mesh.getMinInDimension(0) + _spacing\/2.0; x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0) - _spacing\/2.0; x_center += _spacing)\n _sink_location_list.push_back(Point(x_center, 0.0, 0.0));\n else\n for (Real x_center = _mesh.getMinInDimension(0) + _spacing\/2.0; x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0) - _spacing\/2.0; x_center += _spacing)\n for (Real y_center = _mesh.getMinInDimension(1) + _spacing\/2.0; y_center <= _mesh.getMinInDimension(1) + _mesh.dimensionWidth(1) - _spacing\/2.0; y_center += _spacing)\n if ((_dim == 3) && (_sink_shape_3d == \"spheres\"))\n for (Real z_center = _mesh.getMinInDimension(2) + _spacing\/2.0; z_center <= _mesh.getMinInDimension(2) + _mesh.dimensionWidth(2) - _spacing\/2.0; z_center += _spacing)\n _sink_location_list.push_back(Point(x_center, y_center, z_center));\n else\n _sink_location_list.push_back(Point(x_center, y_center, 0.0));\n }\n\n \/\/ compute normalization constant\n _norm = _strength*std::pow(_spacing, (double) _dim);\n\n \/\/ normalization constant from GaussianUserObject has an additional 1\/(sigma*sqrt(2*pi)) since mesh is in 3D but lines are in 2D\n if ((_dim == 3) && (_sink_shape_3d == \"lines\"))\n _norm *= _sigma*std::sqrt(2.0*libMesh::pi);\n\n \/\/ print sink centers\n for (unsigned int i=0; i<_sink_location_list.size(); i++)\n _console << _sink_location_list[i] << std::endl;\n}\n\nvoid\nSinkMapUserObject::initialize()\n{\n if (_mesh_changed)\n {\n _rebuild_map = true;\n _sink_strength_map.clear();\n }\n else\n _rebuild_map = false;\n\n _mesh_changed = false;\n}\n\nvoid\nSinkMapUserObject::execute()\n{\n if (_rebuild_map)\n {\n \/\/ reserve space for each quadrature point in the element\n _elem_map.assign(_qrule->n_points(), 0);\n\n \/\/ loop over quadrature points in this element\n for (unsigned int qp = 0; qp < _qrule->n_points(); ++qp)\n {\n \/\/ find distance to nearest sink from this point\n Real rmin = getDistanceToNearestSink(_q_point[qp]);\n\n \/\/ compute sink strength at this location\n _elem_map[qp] = _norm*_gaussian_user_object_ptr->value(rmin);\n }\n\n \/\/ insert vector into map\n _sink_strength_map.insert(std::pair<dof_id_type, std::vector<Real> >(_current_elem->id(), _elem_map));\n }\n}\n\nvoid\nSinkMapUserObject::threadJoin(const UserObject &y)\n{\n \/\/ if the map needs to be updated we merge the maps from all threads\n if (_rebuild_map)\n {\n const SinkMapUserObject & uo = static_cast<const SinkMapUserObject &>(y);\n _sink_strength_map.insert(uo._sink_strength_map.begin(), uo._sink_strength_map.end());\n }\n}\n\nvoid\nSinkMapUserObject::meshChanged()\n{\n _mesh_changed = true;\n}\n\nconst std::vector<Real> &\nSinkMapUserObject::getLocalSinkMap(const Elem * elem) const\n{\n SinkMap::const_iterator i = _sink_strength_map.find(elem->id());\n\n \/\/ if no entry in the map was found then something went wrong\n if (i == _sink_strength_map.end())\n mooseError(\"no sinks found in element \" << elem->id());\n\n return i->second;\n}\n\nReal\nSinkMapUserObject::getDistanceToNearestSink(const Point & p) const\n{\n Real r, rmin = std::numeric_limits<Real>::max();\n\n \/\/ to do 3D lines, need to change z-component of point to that of a sink\n \/\/ so the distance to the line is based on the xy-plane distance\n Point new_p;\n if ((_dim == 3) && (_sink_shape_3d == \"lines\"))\n new_p = Point(p(0), p(1), 0.0);\n else\n new_p = p;\n\n \/\/ find the distance to the closest sink location\n for (unsigned i = 0; i < _sink_location_list.size(); ++i)\n {\n \/\/ use a non-periodic or periodic distance\n r = _periodic_var < 0 ?\n (new_p - _sink_location_list[i]).norm() :\n _mesh.minPeriodicDistance(_periodic_var, new_p, _sink_location_list[i]);\n if (r < rmin)\n rmin = r;\n }\n return rmin;\n}\n<commit_msg>typo in SinkMapUserObject.C, closes #42<commit_after>\/****************************************************************\/\n\/* MOOSE - Multiphysics Object Oriented Simulation Environment *\/\n\/* *\/\n\/* All contents are licensed under LGPL V2.1 *\/\n\/* See LICENSE for full restrictions *\/\n\/****************************************************************\/\n\n#include \"SinkMapUserObject.h\"\n#include \"MooseMesh.h\"\n#include \"GaussianUserObject.h\"\n\n\/\/ libmesh includes\n#include \"libmesh\/quadrature.h\"\n\ntemplate<>\nInputParameters validParams<SinkMapUserObject>()\n{\n MooseEnum sink_placement(\"corner inside\", \"corner\");\n MooseEnum sink_shape_3d(\"spheres lines\", \"lines\");\n\n InputParameters params = validParams<ElementUserObject>();\n params.addRequiredParam<Real>(\"spacing\", \"Distance to space sink centers\");\n params.addRequiredParam<Real>(\"strength\", \"Average strength of the overall sink map.\");\n params.addRequiredParam<UserObjectName>(\"gaussian_user_object\", \"Name of the GaussianUserObject to use for sink shapes.\");\n params.addParam<MooseEnum>(\"sink_placement\", sink_placement, \"How to place sinks on domain, choices are 'corner' to place them in the corners (and wrap around), and 'inside' to keep them away from edges.\");\n params.addParam<MooseEnum>(\"sink_shape_3d\", sink_shape_3d, \"Shape to use for sinks in 3D, choices are 'spheres' or 'lines'.\");\n params.addCoupledVar(\"periodic_variable\", \"Use the periodicity settings of this variable to populate the sink map\");\n\n MultiMooseEnum setup_options(SetupInterface::getExecuteOptions());\n \/\/ the mapping needs to run at timestep begin, which is after the adaptivity\n \/\/ run of the previous timestep.\n setup_options = \"timestep_begin\";\n params.set<MultiMooseEnum>(\"execute_on\") = setup_options;\n return params;\n}\n\nSinkMapUserObject::SinkMapUserObject(const InputParameters & parameters) :\n ElementUserObject(parameters),\n _spacing(getParam<Real>(\"spacing\")),\n _strength(getParam<Real>(\"strength\")),\n _gaussian_user_object_ptr(NULL),\n _sink_placement(getParam<MooseEnum>(\"sink_placement\")),\n _sink_shape_3d(getParam<MooseEnum>(\"sink_shape_3d\")),\n _periodic_var(isCoupled(\"periodic_variable\") ? coupled(\"periodic_variable\") : -1),\n _dim(_mesh.dimension()),\n _mesh_changed(true)\n{\n _zero_map.assign(_fe_problem.getMaxQps(), 0.0);\n}\n\nvoid\nSinkMapUserObject::initialSetup()\n{\n \/\/ get sink sigma\n _gaussian_user_object_ptr = &getUserObject<GaussianUserObject>(\"gaussian_user_object\");\n _sigma = _gaussian_user_object_ptr->getSigma();\n\n \/\/ calculate sink locations\n if (_sink_placement == \"corner\")\n {\n \/\/ yes this is dumb, but it works\n for (Real x_center = _mesh.getMinInDimension(0); x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0); x_center += _spacing)\n for (Real y_center = _mesh.getMinInDimension(1); y_center <= _mesh.getMinInDimension(1) + _mesh.dimensionWidth(1); y_center += _spacing)\n if ((_dim == 3) && (_sink_shape_3d == \"spheres\"))\n for (Real z_center = _mesh.getMinInDimension(2); z_center <= _mesh.getMinInDimension(2) + _mesh.dimensionWidth(2); z_center += _spacing)\n _sink_location_list.push_back(Point(x_center, y_center, z_center));\n else\n _sink_location_list.push_back(Point(x_center, y_center, 0.0));\n }\n else \/\/ centered sink placement\n {\n if (_dim == 1)\n for (Real x_center = _mesh.getMinInDimension(0) + _spacing\/2.0; x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0) - _spacing\/2.0; x_center += _spacing)\n _sink_location_list.push_back(Point(x_center, 0.0, 0.0));\n else\n for (Real x_center = _mesh.getMinInDimension(0) + _spacing\/2.0; x_center <= _mesh.getMinInDimension(0) + _mesh.dimensionWidth(0) - _spacing\/2.0; x_center += _spacing)\n for (Real y_center = _mesh.getMinInDimension(1) + _spacing\/2.0; y_center <= _mesh.getMinInDimension(1) + _mesh.dimensionWidth(1) - _spacing\/2.0; y_center += _spacing)\n if ((_dim == 3) && (_sink_shape_3d == \"spheres\"))\n for (Real z_center = _mesh.getMinInDimension(2) + _spacing\/2.0; z_center <= _mesh.getMinInDimension(2) + _mesh.dimensionWidth(2) - _spacing\/2.0; z_center += _spacing)\n _sink_location_list.push_back(Point(x_center, y_center, z_center));\n else\n _sink_location_list.push_back(Point(x_center, y_center, 0.0));\n }\n\n \/\/ compute normalization constant\n _norm = _strength*std::pow(_spacing, (double) _dim);\n\n \/\/ normalization constant from GaussianUserObject has an additional 1\/(sigma*sqrt(2*pi)) since mesh is in 3D but lines are in 2D\n if ((_dim == 3) && (_sink_shape_3d == \"lines\"))\n _norm *= _sigma*std::sqrt(2.0*libMesh::pi);\n\n \/\/ print sink centers\n for (unsigned int i=0; i<_sink_location_list.size(); i++)\n _console << _sink_location_list[i] << std::endl;\n}\n\nvoid\nSinkMapUserObject::initialize()\n{\n if (_mesh_changed)\n {\n _rebuild_map = true;\n _sink_strength_map.clear();\n }\n else\n _rebuild_map = false;\n\n _mesh_changed = false;\n}\n\nvoid\nSinkMapUserObject::execute()\n{\n if (_rebuild_map)\n {\n \/\/ reserve space for each quadrature point in the element\n _elem_map.assign(_qrule->n_points(), 0);\n\n \/\/ loop over quadrature points in this element\n for (unsigned int qp = 0; qp < _qrule->n_points(); ++qp)\n {\n \/\/ find distance to nearest sink from this point\n Real rmin = getDistanceToNearestSink(_q_point[qp]);\n\n \/\/ compute sink strength at this location\n _elem_map[qp] = _norm*_gaussian_user_object_ptr->value(rmin);\n }\n\n \/\/ insert vector into map\n _sink_strength_map.insert(std::pair<dof_id_type, std::vector<Real> >(_current_elem->id(), _elem_map));\n }\n}\n\nvoid\nSinkMapUserObject::threadJoin(const UserObject &y)\n{\n \/\/ if the map needs to be updated we merge the maps from all threads\n if (_rebuild_map)\n {\n const SinkMapUserObject & uo = static_cast<const SinkMapUserObject &>(y);\n _sink_strength_map.insert(uo._sink_strength_map.begin(), uo._sink_strength_map.end());\n }\n}\n\nvoid\nSinkMapUserObject::meshChanged()\n{\n _mesh_changed = true;\n}\n\nconst std::vector<Real> &\nSinkMapUserObject::getLocalSinkMap(const Elem * elem) const\n{\n SinkMap::const_iterator i = _sink_strength_map.find(elem->id());\n\n \/\/ if no entry in the map was found then something went wrong\n if (i == _sink_strength_map.end())\n mooseError(\"no sinks found in element \" << elem->id());\n\n return i->second;\n}\n\nReal\nSinkMapUserObject::getDistanceToNearestSink(const Point & p) const\n{\n Real r, rmin = std::numeric_limits<Real>::max();\n\n \/\/ to do 3D lines, need to change z-component of point to that of a sink\n \/\/ so the distance to the line is based on the xy-plane distance\n Point new_p;\n if ((_dim == 3) && (_sink_shape_3d == \"lines\"))\n new_p = Point(p(0), p(1), 0.0);\n else\n new_p = p;\n\n \/\/ find the distance to the closest sink location\n for (unsigned i = 0; i < _sink_location_list.size(); ++i)\n {\n \/\/ use a non-periodic or periodic distance\n r = _periodic_var < 0 ?\n (new_p - _sink_location_list[i]).norm() :\n _mesh.minPeriodicDistance(_periodic_var, new_p, _sink_location_list[i]);\n if (r < rmin)\n rmin = r;\n }\n return rmin;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DOMNamedNodeMap_HEADER_GUARD_\n#define DOMNamedNodeMap_HEADER_GUARD_\n\n\n\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001-2002 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\nclass DOMNode;\n\n\/**\n * <code>DOMNamedNodeMap<\/code>s are used to\n * represent collections of nodes that can be accessed by name.\n *\n * Note that <code>DOMNamedNodeMap<\/code> does not inherit from <code>DOMNodeList<\/code>;\n * <code>DOMNamedNodeMap<\/code>s are not maintained in any particular order.\n * Nodes contained in a <code>DOMNamedNodeMap<\/code> may\n * also be accessed by an ordinal index, but this is simply to allow\n * convenient enumeration of the contents, and\n * does not imply that the DOM specifies an order to these Nodes.\n *\n * @since DOM Level 1\n *\/\nclass CDOM_EXPORT DOMNamedNodeMap {\nprotected:\n \/\/ -----------------------------------------------------------------------\n \/\/ Hidden constructors\n \/\/ -----------------------------------------------------------------------\n \/** @name Hidden constructors *\/\n \/\/@{\n DOMNamedNodeMap() {};\n DOMNamedNodeMap(const DOMNamedNodeMap &) {};\n DOMNamedNodeMap & operator = (const DOMNamedNodeMap &) {return *this;};\n \/\/@}\n\npublic:\n \/\/ -----------------------------------------------------------------------\n \/\/ All constructors are hidden, just the destructor is available\n \/\/ -----------------------------------------------------------------------\n \/** @name Destructor *\/\n \/\/@{\n \/**\n * Destructor\n *\n *\/\n virtual ~DOMNamedNodeMap() {};\n \/\/@}\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Virtual DOMNamedNodeMap interface\n \/\/ -----------------------------------------------------------------------\n \/** @name Functions introduced in DOM Level 1 *\/\n \/\/@{\n \/\/ -----------------------------------------------------------------------\n \/\/ Setter methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Adds a node using its <code>nodeName<\/code> attribute.\n *\n * <br>As the <code>nodeName<\/code> attribute is used to derive the name\n * which the node must be stored under, multiple nodes of certain types\n * (those that have a \"special\" string value) cannot be stored as the names\n * would clash. This is seen as preferable to allowing nodes to be aliased.\n * @param arg A node to store in a named node map. The node will later be\n * accessible using the value of the <code>nodeName<\/code> attribute of\n * the node. If a node with that name is already present in the map, it\n * is replaced by the new one.\n * @return If the new <code>DOMNode<\/code> replaces an existing node the\n * replaced <code>DOMNode<\/code> is returned,\n * otherwise <code>null<\/code> is returned.\n * @exception DOMException\n * WRONG_DOCUMENT_ERR: Raised if <code>arg<\/code> was created from a\n * different document than the one that created the\n * <code>DOMNamedNodeMap<\/code>.\n * <br>NO_MODIFICATION_ALLOWED_ERR: Raised if this\n * <code>DOMNamedNodeMap<\/code> is readonly.\n * <br>INUSE_ATTRIBUTE_ERR: Raised if <code>arg<\/code> is an\n * <code>DOMAttr<\/code> that is already an attribute of another\n * <code>DOMElement<\/code> object. The DOM user must explicitly clone\n * <code>DOMAttr<\/code> nodes to re-use them in other elements.\n * @since DOM Level 1\n *\/\n virtual DOMNode *setNamedItem(DOMNode *arg) = 0;\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Getter methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Returns the <code>index<\/code>th item in the map.\n *\n * If <code>index<\/code>\n * is greater than or equal to the number of nodes in the map, this returns\n * <code>null<\/code>.\n * @param index Index into the map.\n * @return The node at the <code>index<\/code>th position in the\n * <code>DOMNamedNodeMap<\/code>, or <code>null<\/code> if that is not a valid\n * index.\n * @since DOM Level 1\n *\/\n virtual DOMNode *item(XMLSize_t index) const = 0;\n\n \/**\n * Retrieves a node specified by name.\n *\n * @param name The <code>nodeName<\/code> of a node to retrieve.\n * @return A <code>DOMNode<\/code> (of any type) with the specified <code>nodeName<\/code>, or\n * <code>null<\/code> if it does not identify any node in\n * the map.\n * @since DOM Level 1\n *\/\n virtual DOMNode *getNamedItem(const XMLCh *name) const = 0;\n\n \/**\n * The number of nodes in the map.\n *\n * The range of valid child node indices is\n * 0 to <code>length-1<\/code> inclusive.\n * @since DOM Level 1\n *\/\n virtual XMLSize_t getLength() const = 0;\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Node methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Removes a node specified by name.\n *\n * If the removed node is an\n * <code>DOMAttr<\/code> with a default value it is immediately replaced.\n * @param name The <code>nodeName<\/code> of a node to remove.\n * @return The node removed from the map or <code>null<\/code> if no node\n * with such a name exists.\n * @exception DOMException\n * NOT_FOUND_ERR: Raised if there is no node named <code>name<\/code> in\n * the map.\n * <br>\n * NO_MODIFICATION_ALLOWED_ERR: Raised if this <code>DOMNamedNodeMap<\/code>\n * is readonly.\n * @since DOM Level 1\n *\/\n virtual DOMNode *removeNamedItem(const XMLCh *name) = 0;\n \/\/@}\n\n \/** @name Functions introduced in DOM Level 1 *\/\n \/\/@{\n \/**\n * Retrieves a node specified by local name and namespace URI.\n *\n * @param namespaceURI The <em>namespace URI<\/em> of\n * the node to retrieve.\n * @param localName The <em>local name<\/em> of the node to retrieve.\n * @return A <code>DOMNode<\/code> (of any type) with the specified\n * local name and namespace URI, or <code>null<\/code> if they do not\n * identify any node in the map.\n * @since DOM Level 2\n *\/\n virtual DOMNode *getNamedItemNS(const XMLCh *namespaceURI,\n\t const XMLCh *localName) const = 0;\n\n \/**\n * Adds a node using its <CODE>namespaceURI<\/CODE> and <CODE>localName<\/CODE>.\n *\n * @param arg A node to store in a named node map. The node will later be\n * accessible using the value of the <CODE>namespaceURI<\/CODE> and\n * <CODE>localName<\/CODE> attribute of the node. If a node with those\n * namespace URI and local name is already present in the map, it is\n * replaced by the new one.\n * @return If the new <code>DOMNode<\/code> replaces an existing node the\n * replaced <code>DOMNode<\/code> is returned,\n * otherwise <code>null<\/code> is returned.\n * @exception DOMException\n * WRONG_DOCUMENT_ERR: Raised if <code>arg<\/code> was created from a\n * different document than the one that created the\n * <code>DOMNamedNodeMap<\/code>.\n * <br>NO_MODIFICATION_ALLOWED_ERR: Raised if this\n * <code>DOMNamedNodeMap<\/code> is readonly.\n * <br>INUSE_ATTRIBUTE_ERR: Raised if <code>arg<\/code> is an\n * <code>DOMAttr<\/code> that is already an attribute of another\n * <code>DOMElement<\/code> object. The DOM user must explicitly clone\n * <code>DOMAttr<\/code> nodes to re-use them in other elements.\n * @since DOM Level 2\n *\/\n virtual DOMNode *setNamedItemNS(DOMNode *arg) = 0;\n\n \/**\n * Removes a node specified by local name and namespace URI.\n *\n * @param namespaceURI The <em>namespace URI<\/em> of\n * the node to remove.\n * @param localName The <em>local name<\/em> of the\n * node to remove. When this <code>DOMNamedNodeMap<\/code> contains the\n * attributes attached to an element, as returned by the attributes\n * attribute of the <code>DOMNode<\/code> interface, if the removed\n * attribute is known to have a default value, an attribute\n * immediately appears containing the default value\n * as well as the corresponding namespace URI, local name, and prefix.\n * @return The node removed from the map if a node with such a local name\n * and namespace URI exists.\n * @exception DOMException\n * NOT_FOUND_ERR: Raised if there is no node named <code>name<\/code> in\n * the map.\n * <br>\n * NO_MODIFICATION_ALLOWED_ERR: Raised if this <code>DOMNamedNodeMap<\/code>\n * is readonly.\n * @since DOM Level 2\n *\/\n virtual DOMNode *removeNamedItemNS(const XMLCh *namespaceURI,\n\t const XMLCh *localName) = 0;\n \/\/@}\n\n};\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n\n<commit_msg>[Bug 13751] Documentation for DOMNamedNodeMap incorrect.<commit_after>#ifndef DOMNamedNodeMap_HEADER_GUARD_\n#define DOMNamedNodeMap_HEADER_GUARD_\n\n\n\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001-2002 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n *\/\n\n#include <xercesc\/util\/XercesDefs.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\nclass DOMNode;\n\n\/**\n * <code>DOMNamedNodeMap<\/code>s are used to\n * represent collections of nodes that can be accessed by name.\n *\n * Note that <code>DOMNamedNodeMap<\/code> does not inherit from <code>DOMNodeList<\/code>;\n * <code>DOMNamedNodeMap<\/code>s are not maintained in any particular order.\n * Nodes contained in a <code>DOMNamedNodeMap<\/code> may\n * also be accessed by an ordinal index, but this is simply to allow\n * convenient enumeration of the contents, and\n * does not imply that the DOM specifies an order to these Nodes.\n *\n * @since DOM Level 1\n *\/\nclass CDOM_EXPORT DOMNamedNodeMap {\nprotected:\n \/\/ -----------------------------------------------------------------------\n \/\/ Hidden constructors\n \/\/ -----------------------------------------------------------------------\n \/** @name Hidden constructors *\/\n \/\/@{\n DOMNamedNodeMap() {};\n DOMNamedNodeMap(const DOMNamedNodeMap &) {};\n DOMNamedNodeMap & operator = (const DOMNamedNodeMap &) {return *this;};\n \/\/@}\n\npublic:\n \/\/ -----------------------------------------------------------------------\n \/\/ All constructors are hidden, just the destructor is available\n \/\/ -----------------------------------------------------------------------\n \/** @name Destructor *\/\n \/\/@{\n \/**\n * Destructor\n *\n *\/\n virtual ~DOMNamedNodeMap() {};\n \/\/@}\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Virtual DOMNamedNodeMap interface\n \/\/ -----------------------------------------------------------------------\n \/** @name Functions introduced in DOM Level 1 *\/\n \/\/@{\n \/\/ -----------------------------------------------------------------------\n \/\/ Setter methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Adds a node using its <code>nodeName<\/code> attribute.\n *\n * <br>As the <code>nodeName<\/code> attribute is used to derive the name\n * which the node must be stored under, multiple nodes of certain types\n * (those that have a \"special\" string value) cannot be stored as the names\n * would clash. This is seen as preferable to allowing nodes to be aliased.\n * @param arg A node to store in a named node map. The node will later be\n * accessible using the value of the <code>nodeName<\/code> attribute of\n * the node. If a node with that name is already present in the map, it\n * is replaced by the new one.\n * @return If the new <code>DOMNode<\/code> replaces an existing node the\n * replaced <code>DOMNode<\/code> is returned,\n * otherwise <code>null<\/code> is returned.\n * @exception DOMException\n * WRONG_DOCUMENT_ERR: Raised if <code>arg<\/code> was created from a\n * different document than the one that created the\n * <code>DOMNamedNodeMap<\/code>.\n * <br>NO_MODIFICATION_ALLOWED_ERR: Raised if this\n * <code>DOMNamedNodeMap<\/code> is readonly.\n * <br>INUSE_ATTRIBUTE_ERR: Raised if <code>arg<\/code> is an\n * <code>DOMAttr<\/code> that is already an attribute of another\n * <code>DOMElement<\/code> object. The DOM user must explicitly clone\n * <code>DOMAttr<\/code> nodes to re-use them in other elements.\n * @since DOM Level 1\n *\/\n virtual DOMNode *setNamedItem(DOMNode *arg) = 0;\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Getter methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Returns the <code>index<\/code>th item in the map.\n *\n * If <code>index<\/code>\n * is greater than or equal to the number of nodes in the map, this returns\n * <code>null<\/code>.\n * @param index Index into the map.\n * @return The node at the <code>index<\/code>th position in the\n * <code>DOMNamedNodeMap<\/code>, or <code>null<\/code> if that is not a valid\n * index.\n * @since DOM Level 1\n *\/\n virtual DOMNode *item(XMLSize_t index) const = 0;\n\n \/**\n * Retrieves a node specified by name.\n *\n * @param name The <code>nodeName<\/code> of a node to retrieve.\n * @return A <code>DOMNode<\/code> (of any type) with the specified <code>nodeName<\/code>, or\n * <code>null<\/code> if it does not identify any node in\n * the map.\n * @since DOM Level 1\n *\/\n virtual DOMNode *getNamedItem(const XMLCh *name) const = 0;\n\n \/**\n * The number of nodes in the map.\n *\n * The range of valid child node indices is\n * 0 to <code>length-1<\/code> inclusive.\n * @since DOM Level 1\n *\/\n virtual XMLSize_t getLength() const = 0;\n\n \/\/ -----------------------------------------------------------------------\n \/\/ Node methods\n \/\/ -----------------------------------------------------------------------\n \/**\n * Removes a node specified by name.\n *\n * If the removed node is an\n * <code>DOMAttr<\/code> with a default value it is immediately replaced.\n * @param name The <code>nodeName<\/code> of a node to remove.\n * @return The node removed from the map if a node with such a name exists.\n * @exception DOMException\n * NOT_FOUND_ERR: Raised if there is no node named <code>name<\/code> in\n * the map.\n * <br>\n * NO_MODIFICATION_ALLOWED_ERR: Raised if this <code>DOMNamedNodeMap<\/code>\n * is readonly.\n * @since DOM Level 1\n *\/\n virtual DOMNode *removeNamedItem(const XMLCh *name) = 0;\n \/\/@}\n\n \/** @name Functions introduced in DOM Level 2 *\/\n \/\/@{\n \/**\n * Retrieves a node specified by local name and namespace URI.\n *\n * @param namespaceURI The <em>namespace URI<\/em> of\n * the node to retrieve.\n * @param localName The <em>local name<\/em> of the node to retrieve.\n * @return A <code>DOMNode<\/code> (of any type) with the specified\n * local name and namespace URI, or <code>null<\/code> if they do not\n * identify any node in the map.\n * @since DOM Level 2\n *\/\n virtual DOMNode *getNamedItemNS(const XMLCh *namespaceURI,\n\t const XMLCh *localName) const = 0;\n\n \/**\n * Adds a node using its <CODE>namespaceURI<\/CODE> and <CODE>localName<\/CODE>.\n *\n * @param arg A node to store in a named node map. The node will later be\n * accessible using the value of the <CODE>namespaceURI<\/CODE> and\n * <CODE>localName<\/CODE> attribute of the node. If a node with those\n * namespace URI and local name is already present in the map, it is\n * replaced by the new one.\n * @return If the new <code>DOMNode<\/code> replaces an existing node the\n * replaced <code>DOMNode<\/code> is returned,\n * otherwise <code>null<\/code> is returned.\n * @exception DOMException\n * WRONG_DOCUMENT_ERR: Raised if <code>arg<\/code> was created from a\n * different document than the one that created the\n * <code>DOMNamedNodeMap<\/code>.\n * <br>NO_MODIFICATION_ALLOWED_ERR: Raised if this\n * <code>DOMNamedNodeMap<\/code> is readonly.\n * <br>INUSE_ATTRIBUTE_ERR: Raised if <code>arg<\/code> is an\n * <code>DOMAttr<\/code> that is already an attribute of another\n * <code>DOMElement<\/code> object. The DOM user must explicitly clone\n * <code>DOMAttr<\/code> nodes to re-use them in other elements.\n * @since DOM Level 2\n *\/\n virtual DOMNode *setNamedItemNS(DOMNode *arg) = 0;\n\n \/**\n * Removes a node specified by local name and namespace URI.\n *\n * @param namespaceURI The <em>namespace URI<\/em> of\n * the node to remove.\n * @param localName The <em>local name<\/em> of the\n * node to remove. When this <code>DOMNamedNodeMap<\/code> contains the\n * attributes attached to an element, as returned by the attributes\n * attribute of the <code>DOMNode<\/code> interface, if the removed\n * attribute is known to have a default value, an attribute\n * immediately appears containing the default value\n * as well as the corresponding namespace URI, local name, and prefix.\n * @return The node removed from the map if a node with such a local name\n * and namespace URI exists.\n * @exception DOMException\n * NOT_FOUND_ERR: Raised if there is no node named <code>name<\/code> in\n * the map.\n * <br>\n * NO_MODIFICATION_ALLOWED_ERR: Raised if this <code>DOMNamedNodeMap<\/code>\n * is readonly.\n * @since DOM Level 2\n *\/\n virtual DOMNode *removeNamedItemNS(const XMLCh *namespaceURI,\n\t const XMLCh *localName) = 0;\n \/\/@}\n\n};\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n SDL - Simple DirectMedia Layer\n Copyright (C) 1997-2006 Sam Lantinga\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n\n Sam Lantinga\n slouken@libsdl.org\n*\/\n#include \"SDL_config.h\"\n\n\/* Qtopia based framebuffer implementation *\/\n\n#include <unistd.h>\n\n#include <qapplication.h>\n#include <qpe\/qpeapplication.h>\n\n#include \"SDL_timer.h\"\n\n#include \"SDL_QWin.h\"\n\nextern \"C\"\n{\n\n#include \"..\/SDL_sysvideo.h\"\n#include \"..\/..\/events\/SDL_events_c.h\"\n#include \"SDL_sysevents_c.h\"\n#include \"SDL_sysmouse_c.h\"\n#include \"SDL_syswm_c.h\"\n#include \"SDL_lowvideo.h\"\n\n \/\/#define QTOPIA_DEBUG\n#define QT_HIDDEN_SIZE\t32 \/* starting hidden window size *\/\n\n \/* Name of the environment variable used to invert the screen rotation or not:\n Possible values:\n !=0 : Screen is 270 rotated\n 0: Screen is 90 rotated *\/\n#define SDL_QT_ROTATION_ENV_NAME \"SDL_QT_INVERT_ROTATION\"\n\n \/* Initialization\/Query functions *\/\n static int QT_VideoInit(_THIS, SDL_PixelFormat * vformat);\n static SDL_Rect **QT_ListModes(_THIS, SDL_PixelFormat * format,\n Uint32 flags);\n static SDL_Surface *QT_SetVideoMode(_THIS, SDL_Surface * current,\n int width, int height, int bpp,\n Uint32 flags);\n static void QT_UpdateMouse(_THIS);\n static int QT_SetColors(_THIS, int firstcolor, int ncolors,\n SDL_Color * colors);\n static void QT_VideoQuit(_THIS);\n\n \/* Hardware surface functions *\/\n static int QT_AllocHWSurface(_THIS, SDL_Surface * surface);\n static int QT_LockHWSurface(_THIS, SDL_Surface * surface);\n static void QT_UnlockHWSurface(_THIS, SDL_Surface * surface);\n static void QT_FreeHWSurface(_THIS, SDL_Surface * surface);\n\n static int QT_ToggleFullScreen(_THIS, int fullscreen);\n\n static int QT_IconifyWindow(_THIS);\n static SDL_GrabMode QT_GrabInput(_THIS, SDL_GrabMode mode);\n\n \/* FB driver bootstrap functions *\/\n\n static int QT_Available(void)\n {\n return (1);\n }\n\n static void QT_DeleteDevice(SDL_VideoDevice * device)\n {\n SDL_free(device->hidden);\n SDL_free(device);\n }\n\n static SDL_VideoDevice *QT_CreateDevice(int devindex)\n {\n SDL_VideoDevice *device;\n\n \/* Initialize all variables that we clean on shutdown *\/\n device = (SDL_VideoDevice *) SDL_malloc(sizeof(SDL_VideoDevice));\n if (device) {\n SDL_memset(device, 0, (sizeof *device));\n device->hidden = (struct SDL_PrivateVideoData *)\n SDL_malloc((sizeof *device->hidden));\n }\n if ((device == NULL) || (device->hidden == NULL)) {\n SDL_OutOfMemory();\n if (device) {\n SDL_free(device);\n }\n return (0);\n }\n SDL_memset(device->hidden, 0, (sizeof *device->hidden));\n\n \/* Set the function pointers *\/\n device->VideoInit = QT_VideoInit;\n device->ListModes = QT_ListModes;\n device->SetVideoMode = QT_SetVideoMode;\n device->UpdateMouse = QT_UpdateMouse;\n device->SetColors = QT_SetColors;\n device->UpdateRects = NULL;\n device->VideoQuit = QT_VideoQuit;\n device->AllocHWSurface = QT_AllocHWSurface;\n device->CheckHWBlit = NULL;\n device->FillHWRect = NULL;\n device->SetHWColorKey = NULL;\n device->SetHWAlpha = NULL;\n device->LockHWSurface = QT_LockHWSurface;\n device->UnlockHWSurface = QT_UnlockHWSurface;\n device->FlipHWSurface = NULL;\n device->FreeHWSurface = QT_FreeHWSurface;\n device->SetIcon = NULL;\n device->SetCaption = QT_SetWMCaption;\n device->IconifyWindow = QT_IconifyWindow;\n device->GrabInput = QT_GrabInput;\n device->GetWMInfo = NULL;\n device->FreeWMCursor = QT_FreeWMCursor;\n device->CreateWMCursor = QT_CreateWMCursor;\n device->ShowWMCursor = QT_ShowWMCursor;\n device->WarpWMCursor = QT_WarpWMCursor;\n device->InitOSKeymap = QT_InitOSKeymap;\n device->PumpEvents = QT_PumpEvents;\n\n device->free = QT_DeleteDevice;\n device->ToggleFullScreen = QT_ToggleFullScreen;\n\n \/* Set the driver flags *\/\n device->handles_any_size = 0;\n\n return device;\n }\n\n VideoBootStrap Qtopia_bootstrap = {\n \"qtopia\", \"Qtopia \/ QPE graphics\",\n QT_Available, QT_CreateDevice\n };\n\n \/* Function to sort the display_list *\/\n static int CompareModes(const void *A, const void *B)\n {\n#if 0\n const display_mode *a = (display_mode *) A;\n const display_mode *b = (display_mode *) B;\n\n if (a->space == b->space) {\n return ((b->virtual_width * b->virtual_height) -\n (a->virtual_width * a->virtual_height));\n } else {\n return (ColorSpaceToBitsPerPixel(b->space) -\n ColorSpaceToBitsPerPixel(a->space));\n }\n#endif\n return 0;\n }\n\n \/* Yes, this isn't the fastest it could be, but it works nicely *\/\n static int QT_AddMode(_THIS, int index, unsigned int w, unsigned int h)\n {\n SDL_Rect *mode;\n int i;\n int next_mode;\n\n \/* Check to see if we already have this mode *\/\n if (SDL_nummodes[index] > 0) {\n for (i = SDL_nummodes[index] - 1; i >= 0; --i) {\n mode = SDL_modelist[index][i];\n if ((mode->w == w) && (mode->h == h)) {\n return (0);\n }\n }\n }\n\n \/* Set up the new video mode rectangle *\/\n mode = (SDL_Rect *) SDL_malloc(sizeof *mode);\n if (mode == NULL) {\n SDL_OutOfMemory();\n return (-1);\n }\n mode->x = 0;\n mode->y = 0;\n mode->w = w;\n mode->h = h;\n#ifdef QTOPIA_DEBUG\n fprintf(stderr, \"Adding mode %dx%d at %d bytes per pixel\\n\", w, h,\n index + 1);\n#endif\n\n \/* Allocate the new list of modes, and fill in the new mode *\/\n next_mode = SDL_nummodes[index];\n SDL_modelist[index] = (SDL_Rect **)\n SDL_realloc(SDL_modelist[index],\n (1 + next_mode + 1) * sizeof(SDL_Rect *));\n if (SDL_modelist[index] == NULL) {\n SDL_OutOfMemory();\n SDL_nummodes[index] = 0;\n SDL_free(mode);\n return (-1);\n }\n SDL_modelist[index][next_mode] = mode;\n SDL_modelist[index][next_mode + 1] = NULL;\n SDL_nummodes[index]++;\n\n return (0);\n }\n\n int QT_VideoInit(_THIS, SDL_PixelFormat * vformat)\n {\n \/* Initialize the QPE Application *\/\n \/* Determine the screen depth *\/\n vformat->BitsPerPixel = QPixmap::defaultDepth();\n\n \/\/ For now we hardcode the current depth because anything else\n \/\/ might as well be emulated by SDL rather than by Qtopia.\n\n QSize desktop_size = qApp->desktop()->size();\n QT_AddMode(_this, ((vformat->BitsPerPixel + 7) \/ 8) - 1,\n desktop_size.width(), desktop_size.height());\n QT_AddMode(_this, ((vformat->BitsPerPixel + 7) \/ 8) - 1,\n desktop_size.height(), desktop_size.width());\n\n \/* Determine the current screen size *\/\n this->info.current_w = desktop_size.width();\n this->info.current_h = desktop_size.height();\n\n \/* Create the window \/ widget *\/\n SDL_Win = new SDL_QWin(QSize(QT_HIDDEN_SIZE, QT_HIDDEN_SIZE));\n ((QPEApplication *) qApp)->showMainWidget(SDL_Win);\n \/* Fill in some window manager capabilities *\/\n _this->info.wm_available = 0;\n\n \/* We're done! *\/\n return (0);\n }\n\n \/* We support any dimension at our bit-depth *\/\n SDL_Rect **QT_ListModes(_THIS, SDL_PixelFormat * format, Uint32 flags)\n {\n SDL_Rect **modes;\n\n modes = ((SDL_Rect **) 0);\n if ((flags & SDL_FULLSCREEN) == SDL_FULLSCREEN) {\n modes = SDL_modelist[((format->BitsPerPixel + 7) \/ 8) - 1];\n } else {\n if (format->BitsPerPixel == _this->screen->format->BitsPerPixel) {\n modes = ((SDL_Rect **) - 1);\n }\n }\n return (modes);\n }\n\n \/* Various screen update functions available *\/\n static void QT_NormalUpdate(_THIS, int numrects, SDL_Rect * rects);\n\n\n static int QT_SetFullScreen(_THIS, SDL_Surface * screen, int fullscreen)\n {\n return -1;\n }\n\n static int QT_ToggleFullScreen(_THIS, int fullscreen)\n {\n return -1;\n }\n\n \/* FIXME: check return values and cleanup here *\/\n SDL_Surface *QT_SetVideoMode(_THIS, SDL_Surface * current,\n int width, int height, int bpp, Uint32 flags)\n {\n\n QImage *qimage;\n QSize desktop_size = qApp->desktop()->size();\n\n\n current->flags = 0; \/\/SDL_FULLSCREEN; \/\/ We always run fullscreen.\n\n if (width <= desktop_size.width()\n && height <= desktop_size.height()) {\n current->w = desktop_size.width();\n current->h = desktop_size.height();\n } else if (width <= desktop_size.height()\n && height <= desktop_size.width()) {\n \/\/ Landscape mode\n char *envString = SDL_getenv(SDL_QT_ROTATION_ENV_NAME);\n int envValue = envString ? atoi(envString) : 0;\n screenRotation =\n envValue ? SDL_QT_ROTATION_270 : SDL_QT_ROTATION_90;\n current->h = desktop_size.width();\n current->w = desktop_size.height();\n } else {\n SDL_SetError(\"Unsupported resolution, %dx%d\\n\", width, height);\n }\n if (flags & SDL_INTERNALOPENGL) {\n SDL_SetError(\"OpenGL not supported\");\n return (NULL);\n }\n \/* Create the QImage framebuffer *\/\n qimage = new QImage(current->w, current->h, bpp);\n if (qimage->isNull()) {\n SDL_SetError(\"Couldn't create screen bitmap\");\n delete qimage;\n return (NULL);\n }\n current->pitch = qimage->bytesPerLine();\n current->pixels = (void *) qimage->bits();\n SDL_Win->setImage(qimage);\n _this->UpdateRects = QT_NormalUpdate;\n SDL_Win->setFullscreen(true);\n \/* We're done *\/\n return (current);\n }\n\n \/* Update the current mouse state and position *\/\n void QT_UpdateMouse(_THIS)\n {\n QPoint point(-1, -1);\n if (SDL_Win->isActiveWindow()) {\n point = SDL_Win->mousePos();\n }\n\n if ((point.x() >= 0) && (point.x() < SDL_VideoSurface->w) &&\n (point.y() >= 0) && (point.y() < SDL_VideoSurface->h)) {\n SDL_PrivateAppActive(1, SDL_APPMOUSEFOCUS);\n SDL_PrivateMouseMotion(0, 0,\n (Sint16) point.x(), (Sint16) point.y());\n } else {\n SDL_PrivateAppActive(0, SDL_APPMOUSEFOCUS);\n }\n }\n\n \/* We don't actually allow hardware surfaces other than the main one *\/\n static int QT_AllocHWSurface(_THIS, SDL_Surface * surface)\n {\n return (-1);\n }\n static void QT_FreeHWSurface(_THIS, SDL_Surface * surface)\n {\n return;\n }\n static int QT_LockHWSurface(_THIS, SDL_Surface * surface)\n {\n return (0);\n }\n static void QT_UnlockHWSurface(_THIS, SDL_Surface * surface)\n {\n return;\n }\n\n static void QT_NormalUpdate(_THIS, int numrects, SDL_Rect * rects)\n {\n if (SDL_Win->lockScreen()) {\n for (int i = 0; i < numrects; ++i) {\n QRect rect(rects[i].x, rects[i].y, rects[i].w, rects[i].h);\n SDL_Win->repaintRect(rect);\n }\n SDL_Win->unlockScreen();\n }\n }\n \/* Is the system palette settable? *\/\n int QT_SetColors(_THIS, int firstcolor, int ncolors, SDL_Color * colors)\n {\n return -1;\n }\n\n void QT_VideoQuit(_THIS)\n {\n \/\/ This is dumb, but if I free this, the app doesn't exit correctly.\n \/\/ Of course, this will leak memory if init video is done more than once.\n \/\/ Sucks but such is life.\n\n \/\/ -- David Hedbor\n \/\/ delete SDL_Win; \n \/\/ SDL_Win = 0;\n _this->screen->pixels = NULL;\n QT_GrabInput(_this, SDL_GRAB_OFF);\n }\n\n static int QT_IconifyWindow(_THIS)\n {\n SDL_Win->hide();\n\n return true;\n }\n\n static SDL_GrabMode QT_GrabInput(_THIS, SDL_GrabMode mode)\n {\n if (mode == SDL_GRAB_OFF) {\n QPEApplication::grabKeyboard();\n qApp->processEvents();\n QPEApplication::ungrabKeyboard();\n } else {\n QPEApplication::grabKeyboard();\n }\n qApp->processEvents();\n return mode;\n }\n\n}; \/* Extern C *\/\n\n\/* vi: set ts=4 sw=4 expandtab: *\/\n<commit_msg>Patch from 1.2 branch...fix compilation on Qtopia video target (reference Bugzilla #285).<commit_after>\/*\n SDL - Simple DirectMedia Layer\n Copyright (C) 1997-2006 Sam Lantinga\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n\n Sam Lantinga\n slouken@libsdl.org\n*\/\n#include \"SDL_config.h\"\n\n\/* Qtopia based framebuffer implementation *\/\n\n#include <unistd.h>\n\n#include <qapplication.h>\n#include <qpe\/qpeapplication.h>\n\n#include \"SDL_timer.h\"\n\n#include \"SDL_QWin.h\"\n\nextern \"C\"\n{\n\n#include \"..\/SDL_sysvideo.h\"\n#include \"..\/..\/events\/SDL_events_c.h\"\n#include \"SDL_sysevents_c.h\"\n#include \"SDL_sysmouse_c.h\"\n#include \"SDL_syswm_c.h\"\n#include \"SDL_lowvideo.h\"\n\n \/\/#define QTOPIA_DEBUG\n#define QT_HIDDEN_SIZE\t32 \/* starting hidden window size *\/\n\n \/* Name of the environment variable used to invert the screen rotation or not:\n Possible values:\n !=0 : Screen is 270 rotated\n 0: Screen is 90 rotated *\/\n#define SDL_QT_ROTATION_ENV_NAME \"SDL_QT_INVERT_ROTATION\"\n\n \/* Initialization\/Query functions *\/\n static int QT_VideoInit(_THIS, SDL_PixelFormat * vformat);\n static SDL_Rect **QT_ListModes(_THIS, SDL_PixelFormat * format,\n Uint32 flags);\n static SDL_Surface *QT_SetVideoMode(_THIS, SDL_Surface * current,\n int width, int height, int bpp,\n Uint32 flags);\n static void QT_UpdateMouse(_THIS);\n static int QT_SetColors(_THIS, int firstcolor, int ncolors,\n SDL_Color * colors);\n static void QT_VideoQuit(_THIS);\n\n \/* Hardware surface functions *\/\n static int QT_AllocHWSurface(_THIS, SDL_Surface * surface);\n static int QT_LockHWSurface(_THIS, SDL_Surface * surface);\n static void QT_UnlockHWSurface(_THIS, SDL_Surface * surface);\n static void QT_FreeHWSurface(_THIS, SDL_Surface * surface);\n\n static int QT_ToggleFullScreen(_THIS, int fullscreen);\n\n static int QT_IconifyWindow(_THIS);\n static SDL_GrabMode QT_GrabInput(_THIS, SDL_GrabMode mode);\n\n \/* FB driver bootstrap functions *\/\n\n static int QT_Available(void)\n {\n return (1);\n }\n\n static void QT_DeleteDevice(SDL_VideoDevice * device)\n {\n SDL_free(device->hidden);\n SDL_free(device);\n }\n\n static SDL_VideoDevice *QT_CreateDevice(int devindex)\n {\n SDL_VideoDevice *device;\n\n \/* Initialize all variables that we clean on shutdown *\/\n device = (SDL_VideoDevice *) SDL_malloc(sizeof(SDL_VideoDevice));\n if (device) {\n SDL_memset(device, 0, (sizeof *device));\n device->hidden = (struct SDL_PrivateVideoData *)\n SDL_malloc((sizeof *device->hidden));\n }\n if ((device == NULL) || (device->hidden == NULL)) {\n SDL_OutOfMemory();\n if (device) {\n SDL_free(device);\n }\n return (0);\n }\n SDL_memset(device->hidden, 0, (sizeof *device->hidden));\n\n \/* Set the function pointers *\/\n device->VideoInit = QT_VideoInit;\n device->ListModes = QT_ListModes;\n device->SetVideoMode = QT_SetVideoMode;\n device->UpdateMouse = QT_UpdateMouse;\n device->SetColors = QT_SetColors;\n device->UpdateRects = NULL;\n device->VideoQuit = QT_VideoQuit;\n device->AllocHWSurface = QT_AllocHWSurface;\n device->CheckHWBlit = NULL;\n device->FillHWRect = NULL;\n device->SetHWColorKey = NULL;\n device->SetHWAlpha = NULL;\n device->LockHWSurface = QT_LockHWSurface;\n device->UnlockHWSurface = QT_UnlockHWSurface;\n device->FlipHWSurface = NULL;\n device->FreeHWSurface = QT_FreeHWSurface;\n device->SetIcon = NULL;\n device->SetCaption = QT_SetWMCaption;\n device->IconifyWindow = QT_IconifyWindow;\n device->GrabInput = QT_GrabInput;\n device->GetWMInfo = NULL;\n device->FreeWMCursor = QT_FreeWMCursor;\n device->CreateWMCursor = QT_CreateWMCursor;\n device->ShowWMCursor = QT_ShowWMCursor;\n device->WarpWMCursor = QT_WarpWMCursor;\n device->InitOSKeymap = QT_InitOSKeymap;\n device->PumpEvents = QT_PumpEvents;\n\n device->free = QT_DeleteDevice;\n device->ToggleFullScreen = QT_ToggleFullScreen;\n\n \/* Set the driver flags *\/\n device->handles_any_size = 0;\n\n return device;\n }\n\n VideoBootStrap Qtopia_bootstrap = {\n \"qtopia\", \"Qtopia \/ QPE graphics\",\n QT_Available, QT_CreateDevice\n };\n\n \/* Function to sort the display_list *\/\n static int CompareModes(const void *A, const void *B)\n {\n#if 0\n const display_mode *a = (display_mode *) A;\n const display_mode *b = (display_mode *) B;\n\n if (a->space == b->space) {\n return ((b->virtual_width * b->virtual_height) -\n (a->virtual_width * a->virtual_height));\n } else {\n return (ColorSpaceToBitsPerPixel(b->space) -\n ColorSpaceToBitsPerPixel(a->space));\n }\n#endif\n return 0;\n }\n\n \/* Yes, this isn't the fastest it could be, but it works nicely *\/\n static int QT_AddMode(_THIS, int index, unsigned int w, unsigned int h)\n {\n SDL_Rect *mode;\n int i;\n int next_mode;\n\n \/* Check to see if we already have this mode *\/\n if (SDL_nummodes[index] > 0) {\n for (i = SDL_nummodes[index] - 1; i >= 0; --i) {\n mode = SDL_modelist[index][i];\n if ((mode->w == w) && (mode->h == h)) {\n return (0);\n }\n }\n }\n\n \/* Set up the new video mode rectangle *\/\n mode = (SDL_Rect *) SDL_malloc(sizeof *mode);\n if (mode == NULL) {\n SDL_OutOfMemory();\n return (-1);\n }\n mode->x = 0;\n mode->y = 0;\n mode->w = w;\n mode->h = h;\n#ifdef QTOPIA_DEBUG\n fprintf(stderr, \"Adding mode %dx%d at %d bytes per pixel\\n\", w, h,\n index + 1);\n#endif\n\n \/* Allocate the new list of modes, and fill in the new mode *\/\n next_mode = SDL_nummodes[index];\n SDL_modelist[index] = (SDL_Rect **)\n SDL_realloc(SDL_modelist[index],\n (1 + next_mode + 1) * sizeof(SDL_Rect *));\n if (SDL_modelist[index] == NULL) {\n SDL_OutOfMemory();\n SDL_nummodes[index] = 0;\n SDL_free(mode);\n return (-1);\n }\n SDL_modelist[index][next_mode] = mode;\n SDL_modelist[index][next_mode + 1] = NULL;\n SDL_nummodes[index]++;\n\n return (0);\n }\n\n int QT_VideoInit(_THIS, SDL_PixelFormat * vformat)\n {\n \/* Initialize the QPE Application *\/\n \/* Determine the screen depth *\/\n vformat->BitsPerPixel = QPixmap::defaultDepth();\n\n \/\/ For now we hardcode the current depth because anything else\n \/\/ might as well be emulated by SDL rather than by Qtopia.\n\n QSize desktop_size = qApp->desktop()->size();\n QT_AddMode(_this, ((vformat->BitsPerPixel + 7) \/ 8) - 1,\n desktop_size.width(), desktop_size.height());\n QT_AddMode(_this, ((vformat->BitsPerPixel + 7) \/ 8) - 1,\n desktop_size.height(), desktop_size.width());\n\n \/* Determine the current screen size *\/\n _this->info.current_w = desktop_size.width();\n _this->info.current_h = desktop_size.height();\n\n \/* Create the window \/ widget *\/\n SDL_Win = new SDL_QWin(QSize(QT_HIDDEN_SIZE, QT_HIDDEN_SIZE));\n ((QPEApplication *) qApp)->showMainWidget(SDL_Win);\n \/* Fill in some window manager capabilities *\/\n _this->info.wm_available = 0;\n\n \/* We're done! *\/\n return (0);\n }\n\n \/* We support any dimension at our bit-depth *\/\n SDL_Rect **QT_ListModes(_THIS, SDL_PixelFormat * format, Uint32 flags)\n {\n SDL_Rect **modes;\n\n modes = ((SDL_Rect **) 0);\n if ((flags & SDL_FULLSCREEN) == SDL_FULLSCREEN) {\n modes = SDL_modelist[((format->BitsPerPixel + 7) \/ 8) - 1];\n } else {\n if (format->BitsPerPixel == _this->screen->format->BitsPerPixel) {\n modes = ((SDL_Rect **) - 1);\n }\n }\n return (modes);\n }\n\n \/* Various screen update functions available *\/\n static void QT_NormalUpdate(_THIS, int numrects, SDL_Rect * rects);\n\n\n static int QT_SetFullScreen(_THIS, SDL_Surface * screen, int fullscreen)\n {\n return -1;\n }\n\n static int QT_ToggleFullScreen(_THIS, int fullscreen)\n {\n return -1;\n }\n\n \/* FIXME: check return values and cleanup here *\/\n SDL_Surface *QT_SetVideoMode(_THIS, SDL_Surface * current,\n int width, int height, int bpp, Uint32 flags)\n {\n\n QImage *qimage;\n QSize desktop_size = qApp->desktop()->size();\n\n\n current->flags = 0; \/\/SDL_FULLSCREEN; \/\/ We always run fullscreen.\n\n if (width <= desktop_size.width()\n && height <= desktop_size.height()) {\n current->w = desktop_size.width();\n current->h = desktop_size.height();\n } else if (width <= desktop_size.height()\n && height <= desktop_size.width()) {\n \/\/ Landscape mode\n char *envString = SDL_getenv(SDL_QT_ROTATION_ENV_NAME);\n int envValue = envString ? atoi(envString) : 0;\n screenRotation =\n envValue ? SDL_QT_ROTATION_270 : SDL_QT_ROTATION_90;\n current->h = desktop_size.width();\n current->w = desktop_size.height();\n } else {\n SDL_SetError(\"Unsupported resolution, %dx%d\\n\", width, height);\n }\n if (flags & SDL_INTERNALOPENGL) {\n SDL_SetError(\"OpenGL not supported\");\n return (NULL);\n }\n \/* Create the QImage framebuffer *\/\n qimage = new QImage(current->w, current->h, bpp);\n if (qimage->isNull()) {\n SDL_SetError(\"Couldn't create screen bitmap\");\n delete qimage;\n return (NULL);\n }\n current->pitch = qimage->bytesPerLine();\n current->pixels = (void *) qimage->bits();\n SDL_Win->setImage(qimage);\n _this->UpdateRects = QT_NormalUpdate;\n SDL_Win->setFullscreen(true);\n \/* We're done *\/\n return (current);\n }\n\n \/* Update the current mouse state and position *\/\n void QT_UpdateMouse(_THIS)\n {\n QPoint point(-1, -1);\n if (SDL_Win->isActiveWindow()) {\n point = SDL_Win->mousePos();\n }\n\n if ((point.x() >= 0) && (point.x() < SDL_VideoSurface->w) &&\n (point.y() >= 0) && (point.y() < SDL_VideoSurface->h)) {\n SDL_PrivateAppActive(1, SDL_APPMOUSEFOCUS);\n SDL_PrivateMouseMotion(0, 0,\n (Sint16) point.x(), (Sint16) point.y());\n } else {\n SDL_PrivateAppActive(0, SDL_APPMOUSEFOCUS);\n }\n }\n\n \/* We don't actually allow hardware surfaces other than the main one *\/\n static int QT_AllocHWSurface(_THIS, SDL_Surface * surface)\n {\n return (-1);\n }\n static void QT_FreeHWSurface(_THIS, SDL_Surface * surface)\n {\n return;\n }\n static int QT_LockHWSurface(_THIS, SDL_Surface * surface)\n {\n return (0);\n }\n static void QT_UnlockHWSurface(_THIS, SDL_Surface * surface)\n {\n return;\n }\n\n static void QT_NormalUpdate(_THIS, int numrects, SDL_Rect * rects)\n {\n if (SDL_Win->lockScreen()) {\n for (int i = 0; i < numrects; ++i) {\n QRect rect(rects[i].x, rects[i].y, rects[i].w, rects[i].h);\n SDL_Win->repaintRect(rect);\n }\n SDL_Win->unlockScreen();\n }\n }\n \/* Is the system palette settable? *\/\n int QT_SetColors(_THIS, int firstcolor, int ncolors, SDL_Color * colors)\n {\n return -1;\n }\n\n void QT_VideoQuit(_THIS)\n {\n \/\/ This is dumb, but if I free this, the app doesn't exit correctly.\n \/\/ Of course, this will leak memory if init video is done more than once.\n \/\/ Sucks but such is life.\n\n \/\/ -- David Hedbor\n \/\/ delete SDL_Win; \n \/\/ SDL_Win = 0;\n _this->screen->pixels = NULL;\n QT_GrabInput(_this, SDL_GRAB_OFF);\n }\n\n static int QT_IconifyWindow(_THIS)\n {\n SDL_Win->hide();\n\n return true;\n }\n\n static SDL_GrabMode QT_GrabInput(_THIS, SDL_GrabMode mode)\n {\n if (mode == SDL_GRAB_OFF) {\n QPEApplication::grabKeyboard();\n qApp->processEvents();\n QPEApplication::ungrabKeyboard();\n } else {\n QPEApplication::grabKeyboard();\n }\n qApp->processEvents();\n return mode;\n }\n\n}; \/* Extern C *\/\n\n\/* vi: set ts=4 sw=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.7 2003\/12\/17 00:18:37 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.6 2003\/05\/18 14:02:06 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.5 2003\/05\/16 00:03:10 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4 2003\/05\/15 18:42:54 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/11\/04 15:17:00 tng\n * C++ Namespace Support.\n *\n * Revision 1.2 2002\/03\/18 19:29:53 knoaman\n * Change constant names to eliminate possible conflict with user defined ones.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:29 peiyongz\n * sane_include\n *\n * Revision 1.3 2001\/06\/07 20:55:36 tng\n * Fix no newline at the end warning. By Pei Yong Zhang.\n *\n * Revision 1.2 2001\/05\/11 13:26:43 tng\n * Copyright update.\n *\n * Revision 1.1 2001\/03\/02 19:22:48 knoaman\n * Schema: Regular expression handling part I\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/regx\/OpFactory.hpp>\n#include <xercesc\/util\/regx\/Op.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ OpFactory: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nOpFactory::OpFactory(MemoryManager* const manager) :\n fOpVector(0)\n , fMemoryManager(manager)\n{\n fOpVector = new (fMemoryManager) RefVectorOf<Op>(16, true, fMemoryManager);\n}\n\nOpFactory::~OpFactory() {\n\n\tdelete fOpVector;\n\tfOpVector = 0;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ OpFactory - Factory methods\n\/\/ ---------------------------------------------------------------------------\nOp* OpFactory::createDotOp() {\n\n\tOp* tmpOp = new (fMemoryManager) Op(Op::O_DOT, fMemoryManager);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createCharOp(int data) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_CHAR, data, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createAnchorOp(int data) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_ANCHOR, data, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createCaptureOp(int number, const Op* const next) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_CAPTURE, number, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nUnionOp* OpFactory::createUnionOp(int size) {\n\n\tUnionOp* tmpOp = new (fMemoryManager) UnionOp(Op::O_UNION, size, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createClosureOp(int id) {\n\n\tModifierOp* tmpOp = new (fMemoryManager) ModifierOp(Op::O_CLOSURE, id, -1, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createNonGreedyClosureOp() {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(Op::O_NONGREEDYCLOSURE, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createQuestionOp(bool nonGreedy) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(nonGreedy ? Op::O_NONGREEDYQUESTION :\n\t\t\t\t\t\t\t\t\t\t\t Op::O_QUESTION, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nRangeOp* OpFactory::createRangeOp(const Token* const token) {\n\n\tRangeOp* tmpOp = new (fMemoryManager) RangeOp(Op::O_RANGE, token, fMemoryManager);\n\t\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createLookOp(const short type, const Op* const next,\n\t\t\t\t\t\t const Op* const branch) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(type, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createBackReferenceOp(int refNo) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_BACKREFERENCE, refNo, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nStringOp* OpFactory::createStringOp(const XMLCh* const literal) {\n\n\tStringOp* tmpOp = new (fMemoryManager) StringOp(Op::O_STRING, literal, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createIndependentOp(const Op* const next,\n\t\t\t\t\t\t\t const Op* const branch) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(Op::O_INDEPENDENT, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nModifierOp* OpFactory::createModifierOp(const Op* const next,\n const Op* const branch,\n const int add, const int mask) {\n\n\tModifierOp* tmpOp = new (fMemoryManager) ModifierOp(Op::O_MODIFIER, add, mask, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\treturn tmpOp;\n}\n\t\nConditionOp* OpFactory::createConditionOp(const Op* const next, const int ref,\n\t\t\t\t\t\t\t\t const Op* const conditionFlow,\n\t\t\t\t\t\t\t\t const Op* const yesFlow,\n\t\t\t\t\t\t\t\t const Op* const noFlow) {\n\n\tConditionOp* tmpOp = new (fMemoryManager) ConditionOp(Op::O_CONDITION, ref, conditionFlow,\n\t\t\t\t\t\t\t\t\t\t yesFlow, noFlow, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\treturn tmpOp;\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n * End of file OpFactory.cpp\n *\/\n<commit_msg>Fixed warning with gcc 3.3<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.8 2004\/02\/16 10:11:28 amassari\n * Fixed warning with gcc 3.3\n *\n * Revision 1.7 2003\/12\/17 00:18:37 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.6 2003\/05\/18 14:02:06 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.5 2003\/05\/16 00:03:10 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.4 2003\/05\/15 18:42:54 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/11\/04 15:17:00 tng\n * C++ Namespace Support.\n *\n * Revision 1.2 2002\/03\/18 19:29:53 knoaman\n * Change constant names to eliminate possible conflict with user defined ones.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:29 peiyongz\n * sane_include\n *\n * Revision 1.3 2001\/06\/07 20:55:36 tng\n * Fix no newline at the end warning. By Pei Yong Zhang.\n *\n * Revision 1.2 2001\/05\/11 13:26:43 tng\n * Copyright update.\n *\n * Revision 1.1 2001\/03\/02 19:22:48 knoaman\n * Schema: Regular expression handling part I\n *\n *\/\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/regx\/Op.hpp>\n#include <xercesc\/util\/regx\/OpFactory.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ OpFactory: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nOpFactory::OpFactory(MemoryManager* const manager) :\n fOpVector(0)\n , fMemoryManager(manager)\n{\n fOpVector = new (fMemoryManager) RefVectorOf<Op>(16, true, fMemoryManager);\n}\n\nOpFactory::~OpFactory() {\n\n\tdelete fOpVector;\n\tfOpVector = 0;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ OpFactory - Factory methods\n\/\/ ---------------------------------------------------------------------------\nOp* OpFactory::createDotOp() {\n\n\tOp* tmpOp = new (fMemoryManager) Op(Op::O_DOT, fMemoryManager);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createCharOp(int data) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_CHAR, data, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createAnchorOp(int data) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_ANCHOR, data, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createCaptureOp(int number, const Op* const next) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_CAPTURE, number, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nUnionOp* OpFactory::createUnionOp(int size) {\n\n\tUnionOp* tmpOp = new (fMemoryManager) UnionOp(Op::O_UNION, size, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createClosureOp(int id) {\n\n\tModifierOp* tmpOp = new (fMemoryManager) ModifierOp(Op::O_CLOSURE, id, -1, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createNonGreedyClosureOp() {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(Op::O_NONGREEDYCLOSURE, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createQuestionOp(bool nonGreedy) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(nonGreedy ? Op::O_NONGREEDYQUESTION :\n\t\t\t\t\t\t\t\t\t\t\t Op::O_QUESTION, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nRangeOp* OpFactory::createRangeOp(const Token* const token) {\n\n\tRangeOp* tmpOp = new (fMemoryManager) RangeOp(Op::O_RANGE, token, fMemoryManager);\n\t\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createLookOp(const short type, const Op* const next,\n\t\t\t\t\t\t const Op* const branch) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(type, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nCharOp* OpFactory::createBackReferenceOp(int refNo) {\n\n\tCharOp* tmpOp = new (fMemoryManager) CharOp(Op::O_BACKREFERENCE, refNo, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nStringOp* OpFactory::createStringOp(const XMLCh* const literal) {\n\n\tStringOp* tmpOp = new (fMemoryManager) StringOp(Op::O_STRING, literal, fMemoryManager);\n\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nChildOp* OpFactory::createIndependentOp(const Op* const next,\n\t\t\t\t\t\t\t const Op* const branch) {\n\n\tChildOp* tmpOp = new (fMemoryManager) ChildOp(Op::O_INDEPENDENT, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\tfOpVector->addElement(tmpOp);\n\treturn tmpOp;\n}\n\nModifierOp* OpFactory::createModifierOp(const Op* const next,\n const Op* const branch,\n const int add, const int mask) {\n\n\tModifierOp* tmpOp = new (fMemoryManager) ModifierOp(Op::O_MODIFIER, add, mask, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\ttmpOp->setChild(branch);\n\treturn tmpOp;\n}\n\t\nConditionOp* OpFactory::createConditionOp(const Op* const next, const int ref,\n\t\t\t\t\t\t\t\t const Op* const conditionFlow,\n\t\t\t\t\t\t\t\t const Op* const yesFlow,\n\t\t\t\t\t\t\t\t const Op* const noFlow) {\n\n\tConditionOp* tmpOp = new (fMemoryManager) ConditionOp(Op::O_CONDITION, ref, conditionFlow,\n\t\t\t\t\t\t\t\t\t\t yesFlow, noFlow, fMemoryManager);\n\n\ttmpOp->setNextOp(next);\n\treturn tmpOp;\n}\n\nXERCES_CPP_NAMESPACE_END\n\n\/**\n * End of file OpFactory.cpp\n *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * THE NEW CHRONOTEXT TOOLKIT: https:\/\/github.com\/arielm\/new-chronotext-toolkit\n * COPYRIGHT (C) 2012-2014, ARIEL MALKA ALL RIGHTS RESERVED.\n *\n * THE FOLLOWING SOURCE-CODE IS DISTRIBUTED UNDER THE MODIFIED BSD LICENSE:\n * https:\/\/github.com\/arielm\/new-chronotext-toolkit\/blob\/master\/LICENSE.md\n *\/\n\n#include \"chronotext\/Log.h\"\n\n#if defined(CINDER_MSW)\n#include \"cinder\/msw\/OutputDebugStringStream.h\"\n#elif defined(CINDER_ANDROID)\n#include \"cinder\/android\/LogStream.h\"\n#elif defined(CINDER_MAC) && defined(FORCE_SYSLOG)\n#include \"chronotext\/utils\/SyslogStringStream.h\"\n#endif\n\nusing namespace std;\nusing namespace ci;\n\nnamespace chronotext\n{\n namespace log\n {\n std::ostream& cout()\n {\n#if defined(CINDER_MSW)\n static msw::dostream COUT;\n return COUT;\n#elif defined(CINDER_ANDROID)\n static android::dostream COUT;\n return COUT;\n#elif defined(CINDER_MAC) && defined(FORCE_SYSLOG)\n static mac::dostream COUT;\n return COUT;\n#else\n return std::cout;\n#endif\n }\n }\n \n Log& Log::instance()\n {\n static Log instance;\n return instance;\n }\n \n Log& Log::operator<<(Tag tag)\n {\n boost::mutex::scoped_lock lock(mtx);\n \n log::cout() << \"[\" << tag.value << \"] \";\n return *this;\n }\n \n Log& Log::operator<<(ostream_manipulator manip)\n {\n boost::mutex::scoped_lock lock(mtx);\n\n log::cout() << endl;\n return *this;\n }\n}\n<commit_msg>ContextRework: MAKING IT CLEAR THAT THE NEW Log SUPPORTS ALL THE std::ostream “MANIPULATORS” (I.E. NOT ONLY std::endl)<commit_after>\/*\n * THE NEW CHRONOTEXT TOOLKIT: https:\/\/github.com\/arielm\/new-chronotext-toolkit\n * COPYRIGHT (C) 2012-2014, ARIEL MALKA ALL RIGHTS RESERVED.\n *\n * THE FOLLOWING SOURCE-CODE IS DISTRIBUTED UNDER THE MODIFIED BSD LICENSE:\n * https:\/\/github.com\/arielm\/new-chronotext-toolkit\/blob\/master\/LICENSE.md\n *\/\n\n#include \"chronotext\/Log.h\"\n\n#if defined(CINDER_MSW)\n#include \"cinder\/msw\/OutputDebugStringStream.h\"\n#elif defined(CINDER_ANDROID)\n#include \"cinder\/android\/LogStream.h\"\n#elif defined(CINDER_MAC) && defined(FORCE_SYSLOG)\n#include \"chronotext\/utils\/SyslogStringStream.h\"\n#endif\n\nusing namespace std;\nusing namespace ci;\n\nnamespace chronotext\n{\n namespace log\n {\n std::ostream& cout()\n {\n#if defined(CINDER_MSW)\n static msw::dostream COUT;\n return COUT;\n#elif defined(CINDER_ANDROID)\n static android::dostream COUT;\n return COUT;\n#elif defined(CINDER_MAC) && defined(FORCE_SYSLOG)\n static mac::dostream COUT;\n return COUT;\n#else\n return std::cout;\n#endif\n }\n }\n \n Log& Log::instance()\n {\n static Log instance;\n return instance;\n }\n \n Log& Log::operator<<(Tag tag)\n {\n boost::mutex::scoped_lock lock(mtx);\n \n log::cout() << \"[\" << tag.value << \"] \";\n return *this;\n }\n \n Log& Log::operator<<(ostream_manipulator manip)\n {\n boost::mutex::scoped_lock lock(mtx);\n\n log::cout() << manip;\n return *this;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"deviceinfowidget.h\"\n#include \"..\/sysex\/commands.h\"\n#include \"ui_deviceinfowidget.h\"\n\n#include <QHeaderView>\n#include <QListWidgetItem>\n#include <QTableWidget>\n\nDeviceInfoWidget::DeviceInfoWidget(MioMain *parent, Device *device,\n DeviceInfo *deviceInfo, QString windowTitle)\n : MultiInfoWidget(parent, device, windowTitle), deviceInfo(deviceInfo) {\n infoSections = std::vector<std::string>();\n if (device->getCommands()->isCommandSupported(SysExMessage::GET_INFO_LIST))\n infoSections.push_back(\"Global\");\n if (device->getCommands()->isCommandSupported(\n SysExMessage::GET_ETHERNET_PORT_INFO))\n infoSections.push_back(\"Network\");\n}\n\nDeviceInfoWidget::~DeviceInfoWidget() {}\n\nQWidget *DeviceInfoWidget::createWidget(std::string infoName) {\n if (infoName == \"Global\") {\n QWidget *w = new QWidget(this->parentWidget());\n QGridLayout *lo = new QGridLayout();\n w->setLayout(lo);\n if (this->deviceInfo) {\n std::vector<InfoItem> *infoItems = this->deviceInfo->getDeviceInfos();\n QTableWidget *tw = new QTableWidget(infoItems->size(), 2, this);\n tw->horizontalHeader()->setSectionResizeMode(QHeaderView::Stretch);\n for (unsigned int i = 0; i < infoItems->size(); i++) {\n InfoItem infoItem = infoItems->at(i);\n tw->setItem(i, 0, new QTableWidgetItem(infoItem.name.c_str()));\n tw->setItem(i, 1, new QTableWidgetItem(infoItem.value.c_str()));\n }\n lo->addWidget(tw, 0, 0);\n }\n return w;\n } else {\n QWidget *w = new QWidget(this->parentWidget());\n QGridLayout *lo = new QGridLayout();\n w->setLayout(lo);\n QLabel *l = new QLabel(w);\n l->setText(QString::fromStdString(infoName));\n lo->addWidget(l, 0, 0);\n return w;\n }\n}\n<commit_msg>Set headers in deviceInfoTable, mark read only cells<commit_after>#include \"deviceinfowidget.h\"\n#include \"..\/sysex\/commands.h\"\n#include \"ui_deviceinfowidget.h\"\n\n#include <QHeaderView>\n#include <QListWidgetItem>\n#include <QTableWidget>\n\nDeviceInfoWidget::DeviceInfoWidget(MioMain *parent, Device *device,\n DeviceInfo *deviceInfo, QString windowTitle)\n : MultiInfoWidget(parent, device, windowTitle), deviceInfo(deviceInfo) {\n infoSections = std::vector<std::string>();\n if (device->getCommands()->isCommandSupported(SysExMessage::GET_INFO_LIST))\n infoSections.push_back(\"Global\");\n if (device->getCommands()->isCommandSupported(\n SysExMessage::GET_ETHERNET_PORT_INFO))\n infoSections.push_back(\"Network\");\n}\n\nDeviceInfoWidget::~DeviceInfoWidget() {}\n\nQWidget *DeviceInfoWidget::createWidget(std::string infoName) {\n if (infoName == \"Global\") {\n QWidget *w = new QWidget(this->parentWidget());\n QGridLayout *lo = new QGridLayout();\n QPalette qp;\n\n w->setLayout(lo);\n if (this->deviceInfo) {\n std::vector<InfoItem> *infoItems = this->deviceInfo->getDeviceInfos();\n QTableWidget *tw = new QTableWidget(infoItems->size(), 2, this);\n tw->setHorizontalHeaderItem(0, new QTableWidgetItem(tr(\"Name\")));\n tw->setHorizontalHeaderItem(1, new QTableWidgetItem(tr(\"Value\")));\n tw->verticalHeader()->hide();\n tw->horizontalHeader()->setSectionResizeMode(QHeaderView::Stretch);\n for (unsigned int i = 0; i < infoItems->size(); i++) {\n InfoItem infoItem = infoItems->at(i);\n QTableWidgetItem *name = new QTableWidgetItem(infoItem.name.c_str());\n name->setForeground(qp.dark());\n QTableWidgetItem *value = new QTableWidgetItem(infoItem.value.c_str());\n name->setFlags(name->flags() & ~Qt::ItemIsEditable);\n if (!infoItem.editable) {\n value->setFlags(value->flags() & ~Qt::ItemIsEditable);\n value->setForeground(qp.dark());\n }\n tw->setItem(i, 0, name);\n tw->setItem(i, 1, value);\n }\n lo->addWidget(tw, 0, 0);\n }\n return w;\n } else {\n QWidget *w = new QWidget(this->parentWidget());\n QGridLayout *lo = new QGridLayout();\n w->setLayout(lo);\n QLabel *l = new QLabel(w);\n l->setText(QString::fromStdString(infoName));\n lo->addWidget(l, 0, 0);\n return w;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n ******************************************************************************\r\n * Xenia : Xbox 360 Emulator Research Project *\r\n ******************************************************************************\r\n * Copyright 2013 Ben Vanik. All rights reserved. *\r\n * Released under the BSD license - see LICENSE in the root for more details. *\r\n ******************************************************************************\r\n *\/\r\n\r\n#include <xenia\/gpu\/graphics_system.h>\r\n\r\n#include <xenia\/cpu\/processor.h>\r\n#include <xenia\/gpu\/graphics_driver.h>\r\n#include <xenia\/gpu\/ring_buffer_worker.h>\r\n#include <xenia\/gpu\/xenos\/registers.h>\r\n\r\n\r\nusing namespace xe;\r\nusing namespace xe::gpu;\r\nusing namespace xe::gpu::xenos;\r\n\r\n\r\nGraphicsSystem::GraphicsSystem(const CreationParams* params) :\r\n interrupt_callback_(0), interrupt_callback_data_(0),\r\n last_interrupt_time_(0), swap_pending_(false) {\r\n memory_ = xe_memory_retain(params->memory);\r\n\r\n worker_ = new RingBufferWorker(memory_);\r\n\r\n \/\/ Set during Initialize();\r\n driver_ = 0;\r\n\r\n \/\/ Create the run loop used for any windows\/etc.\r\n \/\/ This must be done on the thread we create the driver.\r\n run_loop_ = xe_run_loop_create();\r\n\r\n \/\/ Create worker thread.\r\n \/\/ This will initialize the graphics system.\r\n \/\/ Init needs to happen there so that any thread-local stuff\r\n \/\/ is created on the right thread.\r\n running_ = true;\r\n thread_ = xe_thread_create(\r\n \"GraphicsSystem\",\r\n (xe_thread_callback)ThreadStartThunk, this);\r\n xe_thread_start(thread_);\r\n}\r\n\r\nGraphicsSystem::~GraphicsSystem() {\r\n \/\/ TODO(benvanik): thread join.\r\n running_ = false;\r\n xe_thread_release(thread_);\r\n\r\n \/\/ TODO(benvanik): worker join\/etc.\r\n delete worker_;\r\n\r\n xe_run_loop_release(run_loop_);\r\n xe_memory_release(memory_);\r\n}\r\n\r\nxe_memory_ref GraphicsSystem::memory() {\r\n return xe_memory_retain(memory_);\r\n}\r\n\r\nshared_ptr<cpu::Processor> GraphicsSystem::processor() {\r\n return processor_;\r\n}\r\n\r\nvoid GraphicsSystem::set_processor(shared_ptr<cpu::Processor> processor) {\r\n processor_ = processor;\r\n}\r\n\r\nvoid GraphicsSystem::ThreadStart() {\r\n xe_run_loop_ref run_loop = xe_run_loop_retain(run_loop_);\r\n\r\n \/\/ Initialize driver and ringbuffer.\r\n Initialize();\r\n XEASSERTNOTNULL(driver_);\r\n\r\n \/\/ Main run loop.\r\n while (running_) {\r\n \/\/ Peek main run loop.\r\n if (xe_run_loop_pump(run_loop)) {\r\n break;\r\n }\r\n if (!running_) {\r\n break;\r\n }\r\n\r\n \/\/ Pump worker.\r\n worker_->Pump();\r\n\r\n \/\/ Pump graphics system.\r\n Pump();\r\n }\r\n running_ = false;\r\n\r\n Shutdown();\r\n\r\n xe_run_loop_release(run_loop);\r\n\r\n \/\/ TODO(benvanik): call module API to kill?\r\n}\r\n\r\nvoid GraphicsSystem::Initialize() {\r\n}\r\n\r\nvoid GraphicsSystem::Shutdown() {\r\n}\r\n\r\nvoid GraphicsSystem::SetInterruptCallback(uint32_t callback,\r\n uint32_t user_data) {\r\n interrupt_callback_ = callback;\r\n interrupt_callback_data_ = user_data;\r\n XELOGGPU(\"SetInterruptCallback(%.4X, %.4X)\", callback, user_data);\r\n}\r\n\r\nvoid GraphicsSystem::InitializeRingBuffer(uint32_t ptr, uint32_t page_count) {\r\n XEASSERTNOTNULL(driver_);\r\n worker_->Initialize(driver_, ptr, page_count);\r\n}\r\n\r\nvoid GraphicsSystem::EnableReadPointerWriteBack(uint32_t ptr,\r\n uint32_t block_size) {\r\n worker_->EnableReadPointerWriteBack(ptr, block_size);\r\n}\r\n\r\nuint64_t GraphicsSystem::ReadRegister(uint32_t r) {\r\n XELOGGPU(\"ReadRegister(%.4X)\", r);\r\n\r\n RegisterFile* regs = driver_->register_file();\r\n\r\n switch (r) {\r\n case 0x6544: \/\/ ? vblank pending?\r\n return 1;\r\n }\r\n\r\n XEASSERT(r >= 0 && r < kXEGpuRegisterCount);\r\n return regs->values[r].u32;\r\n}\r\n\r\nvoid GraphicsSystem::WriteRegister(uint32_t r, uint64_t value) {\r\n XELOGGPU(\"WriteRegister(%.4X, %.8X)\", r, value);\r\n\r\n RegisterFile* regs = driver_->register_file();\r\n\r\n switch (r) {\r\n case 0x0714: \/\/ CP_RB_WPTR\r\n worker_->UpdateWritePointer((uint32_t)value);\r\n break;\r\n default:\r\n XELOGW(\"Unknown GPU register %.4X write: %.8X\", r, value);\r\n break;\r\n }\r\n\r\n XEASSERT(r >= 0 && r < kXEGpuRegisterCount);\r\n regs->values[r].u32 = (uint32_t)value;\r\n}\r\n\r\nvoid GraphicsSystem::DispatchInterruptCallback() {\r\n \/\/ NOTE: we may be executing in some random thread.\r\n last_interrupt_time_ = xe_pal_now();\r\n if (!interrupt_callback_) {\r\n return;\r\n }\r\n processor_->ExecuteInterrupt(\r\n interrupt_callback_, 0, interrupt_callback_data_);\r\n}\r\n<commit_msg>Wait until the ringbuffer thread is spun up. This could be made much nicer.<commit_after>\/**\r\n ******************************************************************************\r\n * Xenia : Xbox 360 Emulator Research Project *\r\n ******************************************************************************\r\n * Copyright 2013 Ben Vanik. All rights reserved. *\r\n * Released under the BSD license - see LICENSE in the root for more details. *\r\n ******************************************************************************\r\n *\/\r\n\r\n#include <xenia\/gpu\/graphics_system.h>\r\n\r\n#include <xenia\/cpu\/processor.h>\r\n#include <xenia\/gpu\/graphics_driver.h>\r\n#include <xenia\/gpu\/ring_buffer_worker.h>\r\n#include <xenia\/gpu\/xenos\/registers.h>\r\n\r\n\r\nusing namespace xe;\r\nusing namespace xe::gpu;\r\nusing namespace xe::gpu::xenos;\r\n\r\n\r\nGraphicsSystem::GraphicsSystem(const CreationParams* params) :\r\n interrupt_callback_(0), interrupt_callback_data_(0),\r\n last_interrupt_time_(0), swap_pending_(false) {\r\n memory_ = xe_memory_retain(params->memory);\r\n\r\n worker_ = new RingBufferWorker(memory_);\r\n\r\n \/\/ Set during Initialize();\r\n driver_ = 0;\r\n\r\n \/\/ Create the run loop used for any windows\/etc.\r\n \/\/ This must be done on the thread we create the driver.\r\n run_loop_ = xe_run_loop_create();\r\n\r\n \/\/ Create worker thread.\r\n \/\/ This will initialize the graphics system.\r\n \/\/ Init needs to happen there so that any thread-local stuff\r\n \/\/ is created on the right thread.\r\n running_ = true;\r\n thread_ = xe_thread_create(\r\n \"GraphicsSystem\",\r\n (xe_thread_callback)ThreadStartThunk, this);\r\n xe_thread_start(thread_);\r\n}\r\n\r\nGraphicsSystem::~GraphicsSystem() {\r\n \/\/ TODO(benvanik): thread join.\r\n running_ = false;\r\n xe_thread_release(thread_);\r\n\r\n \/\/ TODO(benvanik): worker join\/etc.\r\n delete worker_;\r\n\r\n xe_run_loop_release(run_loop_);\r\n xe_memory_release(memory_);\r\n}\r\n\r\nxe_memory_ref GraphicsSystem::memory() {\r\n return xe_memory_retain(memory_);\r\n}\r\n\r\nshared_ptr<cpu::Processor> GraphicsSystem::processor() {\r\n return processor_;\r\n}\r\n\r\nvoid GraphicsSystem::set_processor(shared_ptr<cpu::Processor> processor) {\r\n processor_ = processor;\r\n}\r\n\r\nvoid GraphicsSystem::ThreadStart() {\r\n xe_run_loop_ref run_loop = xe_run_loop_retain(run_loop_);\r\n\r\n \/\/ Initialize driver and ringbuffer.\r\n Initialize();\r\n XEASSERTNOTNULL(driver_);\r\n\r\n \/\/ Main run loop.\r\n while (running_) {\r\n \/\/ Peek main run loop.\r\n if (xe_run_loop_pump(run_loop)) {\r\n break;\r\n }\r\n if (!running_) {\r\n break;\r\n }\r\n\r\n \/\/ Pump worker.\r\n worker_->Pump();\r\n\r\n \/\/ Pump graphics system.\r\n Pump();\r\n }\r\n running_ = false;\r\n\r\n Shutdown();\r\n\r\n xe_run_loop_release(run_loop);\r\n\r\n \/\/ TODO(benvanik): call module API to kill?\r\n}\r\n\r\nvoid GraphicsSystem::Initialize() {\r\n}\r\n\r\nvoid GraphicsSystem::Shutdown() {\r\n}\r\n\r\nvoid GraphicsSystem::SetInterruptCallback(uint32_t callback,\r\n uint32_t user_data) {\r\n interrupt_callback_ = callback;\r\n interrupt_callback_data_ = user_data;\r\n XELOGGPU(\"SetInterruptCallback(%.4X, %.4X)\", callback, user_data);\r\n}\r\n\r\nvoid GraphicsSystem::InitializeRingBuffer(uint32_t ptr, uint32_t page_count) {\r\n \/\/ TODO(benvanik): an event?\r\n while (!driver_) {\r\n Sleep(0);\r\n }\r\n XEASSERTNOTNULL(driver_);\r\n worker_->Initialize(driver_, ptr, page_count);\r\n}\r\n\r\nvoid GraphicsSystem::EnableReadPointerWriteBack(uint32_t ptr,\r\n uint32_t block_size) {\r\n worker_->EnableReadPointerWriteBack(ptr, block_size);\r\n}\r\n\r\nuint64_t GraphicsSystem::ReadRegister(uint32_t r) {\r\n XELOGGPU(\"ReadRegister(%.4X)\", r);\r\n\r\n RegisterFile* regs = driver_->register_file();\r\n\r\n switch (r) {\r\n case 0x6544: \/\/ ? vblank pending?\r\n return 1;\r\n }\r\n\r\n XEASSERT(r >= 0 && r < kXEGpuRegisterCount);\r\n return regs->values[r].u32;\r\n}\r\n\r\nvoid GraphicsSystem::WriteRegister(uint32_t r, uint64_t value) {\r\n XELOGGPU(\"WriteRegister(%.4X, %.8X)\", r, value);\r\n\r\n RegisterFile* regs = driver_->register_file();\r\n\r\n switch (r) {\r\n case 0x0714: \/\/ CP_RB_WPTR\r\n worker_->UpdateWritePointer((uint32_t)value);\r\n break;\r\n default:\r\n XELOGW(\"Unknown GPU register %.4X write: %.8X\", r, value);\r\n break;\r\n }\r\n\r\n XEASSERT(r >= 0 && r < kXEGpuRegisterCount);\r\n regs->values[r].u32 = (uint32_t)value;\r\n}\r\n\r\nvoid GraphicsSystem::DispatchInterruptCallback() {\r\n \/\/ NOTE: we may be executing in some random thread.\r\n last_interrupt_time_ = xe_pal_now();\r\n if (!interrupt_callback_) {\r\n return;\r\n }\r\n processor_->ExecuteInterrupt(\r\n interrupt_callback_, 0, interrupt_callback_data_);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"logging.h\"\n#include \"common\/config.h\"\n#include \"spdlog\/sinks\/null_sink.h\"\n\nstd::shared_ptr<spdlog::logger> stderrLogger(\n const std::string& name,\n const std::string& pattern,\n const std::vector<std::string>& files,\n bool quiet) {\n std::vector<spdlog::sink_ptr> sinks;\n\n auto stderr_sink = spdlog::sinks::stderr_sink_mt::instance();\n\n if(!quiet)\n sinks.push_back(stderr_sink);\n\n for(auto&& file : files) {\n auto file_sink\n = std::make_shared<spdlog::sinks::simple_file_sink_st>(file, true);\n sinks.push_back(file_sink);\n }\n\n auto logger\n = std::make_shared<spdlog::logger>(name, begin(sinks), end(sinks));\n\n spdlog::register_logger(logger);\n logger->set_pattern(pattern);\n return logger;\n}\n\nbool\nset_loglevel(spdlog::logger& logger, std::string const level) {\n if (level == \"trace\")\n logger.set_level(spdlog::level::trace);\n else if (level == \"debug\")\n logger.set_level(spdlog::level::debug);\n else if (level == \"info\")\n logger.set_level(spdlog::level::info);\n else if (level == \"err\" or level == \"error\")\n logger.set_level(spdlog::level::err);\n else if (level == \"critical\")\n logger.set_level(spdlog::level::critical);\n else if (level == \"off\")\n logger.set_level(spdlog::level::off);\n else {\n logger.warn(\"Unknown log level '{}' for logger '{}'\",\n level.c_str(), logger.name().c_str());\n return false;\n }\n return true;\n}\n\nLogger checkedLog(std::string logger) {\n Logger ret = spdlog::get(logger);\n if(ret) {\n return ret;\n }\n else {\n auto null_sink = std::make_shared<spdlog::sinks::null_sink_st>();\n return std::make_shared<spdlog::logger>(\"null_logger\", null_sink);\n }\n}\n\nvoid createLoggers(const marian::Config* options) {\n std::vector<std::string> generalLogs;\n std::vector<std::string> validLogs;\n if(options && options->has(\"log\")) {\n generalLogs.push_back(options->get<std::string>(\"log\"));\n validLogs.push_back(options->get<std::string>(\"log\"));\n }\n\n if(options && options->has(\"valid-log\")) {\n validLogs.push_back(options->get<std::string>(\"valid-log\"));\n }\n\n bool quiet = options->get<bool>(\"quiet\");\n Logger info{stderrLogger(\"info\", \"[%Y-%m-%d %T] %v\", generalLogs, quiet)};\n Logger warn{stderrLogger(\"warn\", \"[%Y-%m-%d %T] [warn] %v\", generalLogs, quiet)};\n Logger config{stderrLogger(\"config\", \"[%Y-%m-%d %T] [config] %v\", generalLogs, quiet)};\n Logger memory{stderrLogger(\"memory\", \"[%Y-%m-%d %T] [memory] %v\", generalLogs, quiet)};\n Logger data{stderrLogger(\"data\", \"[%Y-%m-%d %T] [data] %v\", generalLogs, quiet)};\n Logger valid{stderrLogger(\"valid\", \"[%Y-%m-%d %T] [valid] %v\", validLogs, quiet)};\n Logger translate{stderrLogger(\"translate\", \"%v\", generalLogs, quiet)};\n Logger devnull{stderrLogger(\"devnull\", \"%v\", {}, quiet)};\n devnull->set_level(spdlog::level::off);\n\n if(options && options->has(\"log-level\")) {\n std::string loglevel = options->get<std::string>(\"log-level\");\n if (!set_loglevel(*info, loglevel)) return;\n set_loglevel(*warn, loglevel);\n set_loglevel(*config, loglevel);\n set_loglevel(*memory, loglevel);\n set_loglevel(*data, loglevel);\n set_loglevel(*valid, loglevel);\n set_loglevel(*translate, loglevel);\n }\n\n}\n<commit_msg>Fix createLoggers with no arguments<commit_after>#include \"logging.h\"\n#include \"common\/config.h\"\n#include \"spdlog\/sinks\/null_sink.h\"\n\nstd::shared_ptr<spdlog::logger> stderrLogger(\n const std::string& name,\n const std::string& pattern,\n const std::vector<std::string>& files,\n bool quiet) {\n std::vector<spdlog::sink_ptr> sinks;\n\n auto stderr_sink = spdlog::sinks::stderr_sink_mt::instance();\n\n if(!quiet)\n sinks.push_back(stderr_sink);\n\n for(auto&& file : files) {\n auto file_sink\n = std::make_shared<spdlog::sinks::simple_file_sink_st>(file, true);\n sinks.push_back(file_sink);\n }\n\n auto logger\n = std::make_shared<spdlog::logger>(name, begin(sinks), end(sinks));\n\n spdlog::register_logger(logger);\n logger->set_pattern(pattern);\n return logger;\n}\n\nbool\nset_loglevel(spdlog::logger& logger, std::string const level) {\n if (level == \"trace\")\n logger.set_level(spdlog::level::trace);\n else if (level == \"debug\")\n logger.set_level(spdlog::level::debug);\n else if (level == \"info\")\n logger.set_level(spdlog::level::info);\n else if (level == \"err\" or level == \"error\")\n logger.set_level(spdlog::level::err);\n else if (level == \"critical\")\n logger.set_level(spdlog::level::critical);\n else if (level == \"off\")\n logger.set_level(spdlog::level::off);\n else {\n logger.warn(\"Unknown log level '{}' for logger '{}'\",\n level.c_str(), logger.name().c_str());\n return false;\n }\n return true;\n}\n\nLogger checkedLog(std::string logger) {\n Logger ret = spdlog::get(logger);\n if(ret) {\n return ret;\n }\n else {\n auto null_sink = std::make_shared<spdlog::sinks::null_sink_st>();\n return std::make_shared<spdlog::logger>(\"null_logger\", null_sink);\n }\n}\n\nvoid createLoggers(const marian::Config* options) {\n std::vector<std::string> generalLogs;\n std::vector<std::string> validLogs;\n if(options && options->has(\"log\")) {\n generalLogs.push_back(options->get<std::string>(\"log\"));\n validLogs.push_back(options->get<std::string>(\"log\"));\n }\n\n if(options && options->has(\"valid-log\")) {\n validLogs.push_back(options->get<std::string>(\"valid-log\"));\n }\n\n bool quiet = options && options->get<bool>(\"quiet\");\n Logger info{stderrLogger(\"info\", \"[%Y-%m-%d %T] %v\", generalLogs, quiet)};\n Logger warn{stderrLogger(\"warn\", \"[%Y-%m-%d %T] [warn] %v\", generalLogs, quiet)};\n Logger config{stderrLogger(\"config\", \"[%Y-%m-%d %T] [config] %v\", generalLogs, quiet)};\n Logger memory{stderrLogger(\"memory\", \"[%Y-%m-%d %T] [memory] %v\", generalLogs, quiet)};\n Logger data{stderrLogger(\"data\", \"[%Y-%m-%d %T] [data] %v\", generalLogs, quiet)};\n Logger valid{stderrLogger(\"valid\", \"[%Y-%m-%d %T] [valid] %v\", validLogs, quiet)};\n Logger translate{stderrLogger(\"translate\", \"%v\", generalLogs, quiet)};\n Logger devnull{stderrLogger(\"devnull\", \"%v\", {}, quiet)};\n devnull->set_level(spdlog::level::off);\n\n if(options && options->has(\"log-level\")) {\n std::string loglevel = options->get<std::string>(\"log-level\");\n if (!set_loglevel(*info, loglevel)) return;\n set_loglevel(*warn, loglevel);\n set_loglevel(*config, loglevel);\n set_loglevel(*memory, loglevel);\n set_loglevel(*data, loglevel);\n set_loglevel(*valid, loglevel);\n set_loglevel(*translate, loglevel);\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/stat.h>\n\n#include <glog\/logging.h>\n\n#include \"fatal.hpp\"\n#include \"logging.hpp\"\n\nusing std::string;\n\nusing namespace mesos::internal;\n\n\nvoid Logging::registerOptions(Configurator* conf)\n{\n conf->addOption<bool>(\"quiet\", 'q', \"Disable logging to stderr\", false);\n conf->addOption<string>(\"log_dir\",\n \"Where to put logs (default: MESOS_HOME\/logs)\");\n}\n\n\nvoid Logging::init(const char* programName, const Params& conf)\n{\n \/\/ Set glog's parameters through Google Flags variables\n string logDir = getLogDir(conf);\n if (logDir != \"\") {\n if (mkdir(logDir.c_str(), 0755) < 0 && errno != EEXIST) {\n fatalerror(\"Failed to create log directory %s\", logDir.c_str());\n }\n FLAGS_log_dir = logDir;\n }\n FLAGS_logbufsecs = 1;\n google::InitGoogleLogging(programName);\n\n if (!isQuiet(conf))\n google::SetStderrLogging(google::INFO);\n\n LOG(INFO) << \"Logging to \" << FLAGS_log_dir;\n}\n\n\nstring Logging::getLogDir(const Params& conf)\n{\n if (conf.contains(\"log_dir\"))\n return conf.get(\"log_dir\", \"\");\n else if (conf.contains(\"home\"))\n return conf.get(\"home\", \"\") + \"\/logs\";\n else\n return \"\";\n}\n\n\nbool Logging::isQuiet(const Params& conf)\n{\n return conf.get<bool>(\"quiet\", false);\n}\n<commit_msg>Made log buffer interval configurable and made it default to 0 seconds. This makes Mesos behave more as expected out of the box, outputting all lines to the log file when they are written. Unfortunately, the old default logbufsecs value of 1 didn't do this because Google Log doesn't actually flush logs this often if you aren't repeatedly writing messages (see http:\/\/code.google.com\/p\/google-glog\/issues\/detail?id=52). It might be nice to have a thread periodically flush the log until glog fixes this issue, but for now it's good to have a default behavior that's sensible.<commit_after>#include <sys\/stat.h>\n\n#include <glog\/logging.h>\n\n#include \"fatal.hpp\"\n#include \"logging.hpp\"\n\nusing std::string;\n\nusing namespace mesos::internal;\n\n\nvoid Logging::registerOptions(Configurator* conf)\n{\n conf->addOption<bool>(\"quiet\", 'q', \"Disable logging to stderr\", false);\n conf->addOption<string>(\"log_dir\",\n \"Where to put logs (default: MESOS_HOME\/logs)\");\n conf->addOption<int>(\"log_buf_secs\",\n \"How many seconds to buffer log messages for\\n\",\n 0);\n}\n\n\nvoid Logging::init(const char* programName, const Params& conf)\n{\n \/\/ Set glog's parameters through Google Flags variables\n string logDir = getLogDir(conf);\n if (logDir != \"\") {\n if (mkdir(logDir.c_str(), 0755) < 0 && errno != EEXIST) {\n fatalerror(\"Failed to create log directory %s\", logDir.c_str());\n }\n FLAGS_log_dir = logDir;\n }\n FLAGS_logbufsecs = conf.get<int>(\"log_buf_secs\", 0);\n google::InitGoogleLogging(programName);\n\n if (!isQuiet(conf))\n google::SetStderrLogging(google::INFO);\n\n LOG(INFO) << \"Logging to \" << FLAGS_log_dir;\n}\n\n\nstring Logging::getLogDir(const Params& conf)\n{\n if (conf.contains(\"log_dir\"))\n return conf.get(\"log_dir\", \"\");\n else if (conf.contains(\"home\"))\n return conf.get(\"home\", \"\") + \"\/logs\";\n else\n return \"\";\n}\n\n\nbool Logging::isQuiet(const Params& conf)\n{\n return conf.get<bool>(\"quiet\", false);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2011 Joe Hermaszewski. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY JOE HERMASZEWSKI \"AS IS\" AND ANY EXPRESS OR\n IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n EVENT SHALL JOE HERMASZEWSKI OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n The views and conclusions contained in the software and documentation are\n those of the authors and should not be interpreted as representing official\n policies, either expressed or implied, of Joe Hermaszewski.\n*\/\n\n#include \"lexer.hpp\"\n\n#include <cassert>\n#include <algorithm>\n#include <functional>\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <compiler\/terminal_types.hpp>\n\nnamespace JoeLang\n{\nnamespace Compiler\n{\n\n\n\/\/------------------------------------------------------------------------------\n\/\/ Lexer\n\/\/------------------------------------------------------------------------------\n\nLexer::Lexer( std::string string )\n :m_string( std::move( string ) )\n ,m_position( m_string.begin() )\n{\n ConsumeIgnoredTerminals();\n}\n\nTerminalType Lexer::ReadPunctuationTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal type in the punctuation terminal map\n std::map<TerminalType, LiteralTerminal>::const_iterator literal_iterator =\n g_punctuationTerminals.find( terminal );\n\n \/\/ If it wasn't in the map, return UNKNOWN_CHARACTER\n if( literal_iterator == g_punctuationTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and read this terminal\n const LiteralTerminal& terminal_reader = literal_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ If it didn't match, return UNKNOWN_CHARACTER\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Check that this terminal isn't also matched by something longer\n for( const auto& c: g_punctuationTerminals )\n if( c.second.matched_string.size() >\n terminal_reader.matched_string.size() &&\n c.second.Read( m_position, m_string.end() ) )\n return c.first;\n\n \/\/ Fill up string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nTerminalType Lexer::ReadLiteralTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal type in the literal terminal map\n std::map<TerminalType, FunctionalTerminal>::const_iterator\n functional_iterator = g_literalTerminals.find(terminal);\n\n \/\/ If it wasn't in the map, return UNKNOWN_CHARACTER\n if( functional_iterator == g_literalTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and match this terminal\n const FunctionalTerminal& terminal_reader = functional_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ if it didn't match return\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ fill up string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nTerminalType Lexer::ReadKeywordTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal in the punctuation terminal map\n std::map<TerminalType, LiteralTerminal>::const_iterator literal_iterator =\n g_keywordTerminals.find(terminal);\n\n \/\/ If it wasn't in the map return\n if( literal_iterator == g_keywordTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and read this terminal\n const LiteralTerminal& terminal_reader = literal_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ If it didn't match return\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Check that this terminal isn't also matched by something longer\n for( const auto& c: g_keywordTerminals )\n if( c.second.matched_string.size() >\n terminal_reader.matched_string.size() &&\n c.second.Read( m_position, m_string.end() ) )\n return c.first;\n\n \/\/ fill up the string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nbool Lexer::Expect( TerminalType terminal_type, std::string& string )\n{\n \/\/ If we've reached the end of the string\n if( terminal_type == TerminalType::END_OF_INPUT &&\n m_position == m_string.end() )\n return true;\n\n TerminalType t;\n\n \/\/ See if it's a punctuation terminal\n t = ReadPunctuationTerminal( terminal_type, string );\n\n \/\/ If it wasn't matched by the punctuation try and match it as a literal\n if( t == TerminalType::UNKNOWN_CHARACTER )\n t = ReadLiteralTerminal( terminal_type, string );\n\n \/\/ If it wasn't matched try and match a keyword\n if( t == TerminalType::UNKNOWN_CHARACTER )\n t = ReadKeywordTerminal( terminal_type, string );\n\n \/\/ If we've found a map, advance the position and clean up any whitespace\n if( t == terminal_type )\n {\n ReadChars( string.size() );\n ConsumeIgnoredTerminals();\n return true;\n }\n return false;\n}\n\nTerminalType Lexer::PeekNextTerminal( std::string& string ) const\n{\n \/\/ Try and match any punctuation terminals\n for( const auto& t_reader : g_punctuationTerminals )\n {\n TerminalType t = ReadPunctuationTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ Try and match any literal terminals\n for( const auto& t_reader : g_literalTerminals )\n {\n TerminalType t = ReadLiteralTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ Try and match any keyword terminals\n for( const auto& t_reader : g_keywordTerminals )\n {\n TerminalType t = ReadPunctuationTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ If it's anything else\n return TerminalType::UNKNOWN_CHARACTER;\n}\n\nbool Lexer::PeekIdentifier( std::string& string ) const\n{\n return ReadLiteralTerminal( TerminalType::IDENTIFIER, string ) ==\n TerminalType::IDENTIFIER;\n}\n\nstd::size_t Lexer::GetPosition() const\n{\n return m_position - m_string.begin();\n}\n\nstd::size_t Lexer::GetColumnNumber() const\n{\n return m_columnNumber;\n}\n\nstd::size_t Lexer::GetLineNumber() const\n{\n return m_lineNumber;\n}\n\nvoid Lexer::ConsumeIgnoredTerminals()\n{\n int chars_read = 0;\n \/\/ While we keep having eaten something, try and parse the next terminal\n do\n {\n for( const auto& terminal_reader : g_ignoredTerminals )\n {\n chars_read = terminal_reader.second.Read( m_position,\n m_string.end() );\n if( chars_read )\n break;\n }\n ReadChars( chars_read );\n } while( chars_read );\n}\n\nvoid Lexer::ReadChars( std::size_t num_chars )\n{\n std::string::const_iterator end = m_position + num_chars;\n assert( end <= m_string.end() &&\n \"Trying to advance the lexer past the end of the file\" );\n while( m_position < end )\n {\n if( *m_position == '\\n' )\n {\n ++m_lineNumber;\n m_columnNumber = 0;\n }\n ++m_columnNumber;\n ++m_position;\n }\n}\n\n} \/\/ namespace Compiler\n} \/\/ namespace JoeLang\n<commit_msg>[!] reading keywords in peek terminal<commit_after>\/*\n Copyright 2011 Joe Hermaszewski. All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n 2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY JOE HERMASZEWSKI \"AS IS\" AND ANY EXPRESS OR\n IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n EVENT SHALL JOE HERMASZEWSKI OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n The views and conclusions contained in the software and documentation are\n those of the authors and should not be interpreted as representing official\n policies, either expressed or implied, of Joe Hermaszewski.\n*\/\n\n#include \"lexer.hpp\"\n\n#include <cassert>\n#include <algorithm>\n#include <functional>\n#include <map>\n#include <memory>\n#include <string>\n#include <utility>\n\n#include <compiler\/terminal_types.hpp>\n\nnamespace JoeLang\n{\nnamespace Compiler\n{\n\n\n\/\/------------------------------------------------------------------------------\n\/\/ Lexer\n\/\/------------------------------------------------------------------------------\n\nLexer::Lexer( std::string string )\n :m_string( std::move( string ) )\n ,m_position( m_string.begin() )\n{\n ConsumeIgnoredTerminals();\n}\n\nTerminalType Lexer::ReadPunctuationTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal type in the punctuation terminal map\n std::map<TerminalType, LiteralTerminal>::const_iterator literal_iterator =\n g_punctuationTerminals.find( terminal );\n\n \/\/ If it wasn't in the map, return UNKNOWN_CHARACTER\n if( literal_iterator == g_punctuationTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and read this terminal\n const LiteralTerminal& terminal_reader = literal_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ If it didn't match, return UNKNOWN_CHARACTER\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Check that this terminal isn't also matched by something longer\n for( const auto& c: g_punctuationTerminals )\n if( c.second.matched_string.size() >\n terminal_reader.matched_string.size() &&\n c.second.Read( m_position, m_string.end() ) )\n return c.first;\n\n \/\/ Fill up string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nTerminalType Lexer::ReadLiteralTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal type in the literal terminal map\n std::map<TerminalType, FunctionalTerminal>::const_iterator\n functional_iterator = g_literalTerminals.find(terminal);\n\n \/\/ If it wasn't in the map, return UNKNOWN_CHARACTER\n if( functional_iterator == g_literalTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and match this terminal\n const FunctionalTerminal& terminal_reader = functional_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ if it didn't match return\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ fill up string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nTerminalType Lexer::ReadKeywordTerminal( TerminalType terminal,\n std::string& string ) const\n{\n \/\/ Find this terminal in the punctuation terminal map\n std::map<TerminalType, LiteralTerminal>::const_iterator literal_iterator =\n g_keywordTerminals.find(terminal);\n\n \/\/ If it wasn't in the map return\n if( literal_iterator == g_keywordTerminals.end() )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Try and read this terminal\n const LiteralTerminal& terminal_reader = literal_iterator->second;\n std::size_t chars_read = terminal_reader.Read( m_position, m_string.end() );\n\n \/\/ If it didn't match return\n if( !chars_read )\n return TerminalType::UNKNOWN_CHARACTER;\n\n \/\/ Check that this terminal isn't also matched by something longer\n for( const auto& c: g_keywordTerminals )\n if( c.second.matched_string.size() >\n terminal_reader.matched_string.size() &&\n c.second.Read( m_position, m_string.end() ) )\n return c.first;\n\n \/\/ fill up the string\n string = std::string( m_position, m_position + chars_read );\n return terminal;\n}\n\nbool Lexer::Expect( TerminalType terminal_type, std::string& string )\n{\n \/\/ If we've reached the end of the string\n if( terminal_type == TerminalType::END_OF_INPUT &&\n m_position == m_string.end() )\n return true;\n\n TerminalType t;\n\n \/\/ See if it's a punctuation terminal\n t = ReadPunctuationTerminal( terminal_type, string );\n\n \/\/ If it wasn't matched by the punctuation try and match it as a literal\n if( t == TerminalType::UNKNOWN_CHARACTER )\n t = ReadLiteralTerminal( terminal_type, string );\n\n \/\/ If it wasn't matched try and match a keyword\n if( t == TerminalType::UNKNOWN_CHARACTER )\n t = ReadKeywordTerminal( terminal_type, string );\n\n \/\/ If we've found a map, advance the position and clean up any whitespace\n if( t == terminal_type )\n {\n ReadChars( string.size() );\n ConsumeIgnoredTerminals();\n return true;\n }\n return false;\n}\n\nTerminalType Lexer::PeekNextTerminal( std::string& string ) const\n{\n \/\/ Try and match any punctuation terminals\n for( const auto& t_reader : g_punctuationTerminals )\n {\n TerminalType t = ReadPunctuationTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ Try and match any literal terminals\n for( const auto& t_reader : g_literalTerminals )\n {\n TerminalType t = ReadLiteralTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ Try and match any keyword terminals\n for( const auto& t_reader : g_keywordTerminals )\n {\n TerminalType t = ReadKeywordTerminal( t_reader.first, string );\n if( t != TerminalType::UNKNOWN_CHARACTER )\n return t;\n }\n\n \/\/ If it's anything else\n return TerminalType::UNKNOWN_CHARACTER;\n}\n\nbool Lexer::PeekIdentifier( std::string& string ) const\n{\n return ReadLiteralTerminal( TerminalType::IDENTIFIER, string ) ==\n TerminalType::IDENTIFIER;\n}\n\nstd::size_t Lexer::GetPosition() const\n{\n return m_position - m_string.begin();\n}\n\nstd::size_t Lexer::GetColumnNumber() const\n{\n return m_columnNumber;\n}\n\nstd::size_t Lexer::GetLineNumber() const\n{\n return m_lineNumber;\n}\n\nvoid Lexer::ConsumeIgnoredTerminals()\n{\n int chars_read = 0;\n \/\/ While we keep having eaten something, try and parse the next terminal\n do\n {\n for( const auto& terminal_reader : g_ignoredTerminals )\n {\n chars_read = terminal_reader.second.Read( m_position,\n m_string.end() );\n if( chars_read )\n break;\n }\n ReadChars( chars_read );\n } while( chars_read );\n}\n\nvoid Lexer::ReadChars( std::size_t num_chars )\n{\n std::string::const_iterator end = m_position + num_chars;\n assert( end <= m_string.end() &&\n \"Trying to advance the lexer past the end of the file\" );\n while( m_position < end )\n {\n if( *m_position == '\\n' )\n {\n ++m_lineNumber;\n m_columnNumber = 0;\n }\n ++m_columnNumber;\n ++m_position;\n }\n}\n\n} \/\/ namespace Compiler\n} \/\/ namespace JoeLang\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n\nnamespace uih::ole {\n\nCLIPFORMAT get_clipboard_format_drop_description()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(CFSTR_DROPDESCRIPTION);\n return cfRet;\n}\n\nCLIPFORMAT DragWindowFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"DragWindow\");\n return cfRet;\n}\n\nCLIPFORMAT IsShowingLayeredFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsShowingLayered\");\n return cfRet;\n}\n\nCLIPFORMAT IsShowingTextFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsShowingText\");\n return cfRet;\n}\n\nCLIPFORMAT DisableDragTextFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"DisableDragText\");\n return cfRet;\n}\n\nCLIPFORMAT IsComputingImageFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsComutingImage\");\n return cfRet;\n}\n\nCLIPFORMAT UsingDefaultDragImageFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"UsingDefaultDragImage\");\n return cfRet;\n}\n\nCLIPFORMAT PreferredDropEffectFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(CFSTR_PREFERREDDROPEFFECT);\n return cfRet;\n}\n\ntemplate <typename T>\nHRESULT GetDataObjectDataSimple(IDataObject* pDataObj, CLIPFORMAT cf, T& p_out)\n{\n HRESULT hr;\n\n FORMATETC fe = {0};\n fe.cfFormat = cf;\n fe.dwAspect = DVASPECT_CONTENT;\n fe.lindex = -1;\n fe.tymed = TYMED_HGLOBAL;\n\n STGMEDIUM stgm = {0};\n if (SUCCEEDED(hr = pDataObj->GetData(&fe, &stgm))) {\n void* pData = GlobalLock(stgm.hGlobal);\n if (pData) {\n p_out = *static_cast<T*>(pData);\n GlobalUnlock(pData);\n }\n ReleaseStgMedium(&stgm);\n }\n return hr;\n}\n\nHRESULT GetDragWindow(IDataObject* pDataObj, HWND& p_wnd)\n{\n HRESULT hr;\n DWORD dw;\n if (SUCCEEDED(hr = GetDataObjectDataSimple(pDataObj, DragWindowFormat(), dw)))\n p_wnd = (HWND)ULongToHandle(dw);\n\n return hr;\n}\n\nHRESULT GetIsShowingLayered(IDataObject* pDataObj, BOOL& p_out)\n{\n return GetDataObjectDataSimple(pDataObj, IsShowingLayeredFormat(), p_out);\n}\n\nHRESULT set_blob(IDataObject* pdtobj, CLIPFORMAT cf, const void* pvBlob, UINT cbBlob)\n{\n HRESULT hr = E_OUTOFMEMORY;\n void* pv = GlobalAlloc(GPTR, cbBlob);\n if (pv) {\n CopyMemory(pv, pvBlob, cbBlob);\n\n FORMATETC fmte = {cf, nullptr, DVASPECT_CONTENT, -1, TYMED_HGLOBAL};\n\n \/\/ The STGMEDIUM structure is used to define how to handle a global memory transfer.\n \/\/ This structure includes a flag, tymed, which indicates the medium\n \/\/ to be used, and a union comprising pointers and a handle for getting whichever\n \/\/ medium is specified in tymed.\n STGMEDIUM medium = {0};\n medium.tymed = TYMED_HGLOBAL;\n medium.hGlobal = pv;\n\n hr = pdtobj->SetData(&fmte, &medium, TRUE);\n if (FAILED(hr)) {\n GlobalFree(pv);\n }\n }\n return hr;\n}\n\nHRESULT set_drop_description(IDataObject* pdtobj, DROPIMAGETYPE dit, const char* msg, const char* insert)\n{\n if (mmh::is_windows_vista_or_newer()) {\n DROPDESCRIPTION dd_prev;\n memset(&dd_prev, 0, sizeof(dd_prev));\n\n bool dd_prev_valid\n = (SUCCEEDED(GetDataObjectDataSimple(pdtobj, get_clipboard_format_drop_description(), dd_prev)));\n\n pfc::stringcvt::string_os_from_utf8 wmsg(msg);\n pfc::stringcvt::string_os_from_utf8 winsert(insert);\n\n \/\/ Only set the drop description if it has actually changed (otherwise things get a bit crazy near the edge of\n \/\/ the screen).\n if (!dd_prev_valid || dd_prev.type != dit || wcscmp(dd_prev.szInsert, winsert)\n || wcscmp(dd_prev.szMessage, wmsg)) {\n DROPDESCRIPTION dd;\n dd.type = dit;\n wcscpy_s(dd.szMessage, wmsg.get_ptr());\n wcscpy_s(dd.szInsert, winsert.get_ptr());\n return set_blob(pdtobj, get_clipboard_format_drop_description(), &dd, sizeof(dd));\n }\n return S_OK;\n }\n return E_NOTIMPL;\n}\n\nHRESULT set_using_default_drag_image(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, UsingDefaultDragImageFormat(), &value, sizeof(value));\n}\n\nHRESULT set_is_showing_text(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, IsShowingTextFormat(), &value, sizeof(value));\n}\n\nHRESULT set_disable_drag_text(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, DisableDragTextFormat(), &value, sizeof(value));\n}\n\nHRESULT set_is_computing_image(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, IsComputingImageFormat(), &value, sizeof(value));\n}\n\nHRESULT SetPreferredDropEffect(IDataObject* pdtobj, DWORD effect)\n{\n return set_blob(pdtobj, PreferredDropEffectFormat(), &effect, sizeof(effect));\n}\n\nHRESULT do_drag_drop(HWND wnd, WPARAM initialKeyState, IDataObject* pDataObject, DWORD dwEffect, DWORD preferredEffect,\n DWORD* pdwEffect, SHDRAGIMAGE* lpsdi)\n{\n if (preferredEffect)\n SetPreferredDropEffect(pDataObject, preferredEffect);\n\n mmh::ComPtr<IDropSource> pDropSource;\n \/\/ if (!IsVistaOrNewer())\n pDropSource = new uih::ole::IDropSourceGeneric(wnd, pDataObject, initialKeyState, true, lpsdi);\n return SHDoDragDrop(wnd, pDataObject, pDropSource, dwEffect, pdwEffect);\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::QueryInterface(REFIID iid, void** ppvObject)\n{\n if (ppvObject == nullptr)\n return E_INVALIDARG;\n\n *ppvObject = nullptr;\n\n if (iid == IID_IUnknown) {\n AddRef();\n *ppvObject = (IUnknown*)this;\n return S_OK;\n }\n\n if (iid == IID_IDropSource) {\n AddRef();\n *ppvObject = (IDropSource*)this;\n return S_OK;\n }\n return E_NOINTERFACE;\n}\nULONG STDMETHODCALLTYPE IDropSourceGeneric::AddRef()\n{\n return InterlockedIncrement(&m_refcount);\n}\nULONG STDMETHODCALLTYPE IDropSourceGeneric::Release()\n{\n LONG rv = InterlockedDecrement(&m_refcount);\n if (!rv) {\n delete this;\n }\n return rv;\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::QueryContinueDrag(BOOL fEscapePressed, DWORD grfKeyState)\n{\n if (fEscapePressed || ((m_initial_key_state & MK_LBUTTON) && (grfKeyState & MK_RBUTTON))) {\n return DRAGDROP_S_CANCEL;\n }\n\n if (((m_initial_key_state & MK_LBUTTON) && !(grfKeyState & MK_LBUTTON))\n || ((m_initial_key_state & MK_RBUTTON) && !(grfKeyState & MK_RBUTTON))) {\n return DRAGDROP_S_DROP;\n }\n return S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::GiveFeedback(DWORD dwEffect)\n{\n HWND wnd_drag = nullptr;\n BOOL isShowingLayered = FALSE;\n if (IsThemeActive())\n GetIsShowingLayered(m_data_object, isShowingLayered);\n\n if (SUCCEEDED(GetDragWindow(m_data_object, wnd_drag)) && wnd_drag)\n PostMessage(wnd_drag, DDWM_UPDATEWINDOW, NULL, NULL);\n\n if (isShowingLayered) {\n if (!m_prev_is_showing_layered) {\n auto cursor = LoadCursor(nullptr, IDC_ARROW);\n SetCursor(cursor);\n }\n if (wnd_drag) {\n WPARAM wp = 1;\n if (dwEffect & DROPEFFECT_COPY)\n wp = 3;\n else if (dwEffect & DROPEFFECT_MOVE)\n wp = 2;\n else if (dwEffect & DROPEFFECT_LINK)\n wp = 4;\n\n PostMessage(wnd_drag, WM_USER + 2, wp, NULL);\n }\n }\n\n m_prev_is_showing_layered = isShowingLayered != 0;\n\n return isShowingLayered ? S_OK : DRAGDROP_S_USEDEFAULTCURSORS;\n}\n\nIDropSourceGeneric::IDropSourceGeneric(\n HWND wnd, IDataObject* pDataObj, DWORD initial_key_state, bool b_allowdropdescriptiontext, SHDRAGIMAGE* lpsdi)\n : m_refcount(0), m_initial_key_state(initial_key_state), m_prev_is_showing_layered(false), m_data_object(pDataObj)\n{\n HRESULT hr;\n\n if (b_allowdropdescriptiontext) {\n if (SUCCEEDED(m_drag_source_helper.instantiate(CLSID_DragDropHelper, nullptr, CLSCTX_INPROC_SERVER))) {\n mmh::ComPtr<IDragSourceHelper2> pDragSourceHelper2 = m_drag_source_helper;\n if (pDragSourceHelper2.is_valid()) {\n hr = pDragSourceHelper2->SetFlags(DSH_ALLOWDROPDESCRIPTIONTEXT);\n }\n if (lpsdi) {\n hr = m_drag_source_helper->InitializeFromBitmap(lpsdi, pDataObj);\n if (FAILED(hr) && lpsdi->hbmpDragImage) {\n DeleteObject(lpsdi->hbmpDragImage);\n lpsdi->hbmpDragImage = nullptr;\n }\n } else\n hr = m_drag_source_helper->InitializeFromWindow(wnd, nullptr, pDataObj);\n if (IsThemeActive() && IsAppThemed()) {\n set_using_default_drag_image(pDataObj);\n }\n }\n }\n}\n} \/\/ namespace uih::ole\n<commit_msg>Avoid crash in ole::set_drop_description() with long strings<commit_after>#include \"stdafx.h\"\n\nnamespace uih::ole {\n\nCLIPFORMAT get_clipboard_format_drop_description()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(CFSTR_DROPDESCRIPTION);\n return cfRet;\n}\n\nCLIPFORMAT DragWindowFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"DragWindow\");\n return cfRet;\n}\n\nCLIPFORMAT IsShowingLayeredFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsShowingLayered\");\n return cfRet;\n}\n\nCLIPFORMAT IsShowingTextFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsShowingText\");\n return cfRet;\n}\n\nCLIPFORMAT DisableDragTextFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"DisableDragText\");\n return cfRet;\n}\n\nCLIPFORMAT IsComputingImageFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"IsComutingImage\");\n return cfRet;\n}\n\nCLIPFORMAT UsingDefaultDragImageFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(L\"UsingDefaultDragImage\");\n return cfRet;\n}\n\nCLIPFORMAT PreferredDropEffectFormat()\n{\n static const auto cfRet = (CLIPFORMAT)RegisterClipboardFormat(CFSTR_PREFERREDDROPEFFECT);\n return cfRet;\n}\n\ntemplate <typename T>\nHRESULT GetDataObjectDataSimple(IDataObject* pDataObj, CLIPFORMAT cf, T& p_out)\n{\n HRESULT hr;\n\n FORMATETC fe = {0};\n fe.cfFormat = cf;\n fe.dwAspect = DVASPECT_CONTENT;\n fe.lindex = -1;\n fe.tymed = TYMED_HGLOBAL;\n\n STGMEDIUM stgm = {0};\n if (SUCCEEDED(hr = pDataObj->GetData(&fe, &stgm))) {\n void* pData = GlobalLock(stgm.hGlobal);\n if (pData) {\n p_out = *static_cast<T*>(pData);\n GlobalUnlock(pData);\n }\n ReleaseStgMedium(&stgm);\n }\n return hr;\n}\n\nHRESULT GetDragWindow(IDataObject* pDataObj, HWND& p_wnd)\n{\n HRESULT hr;\n DWORD dw;\n if (SUCCEEDED(hr = GetDataObjectDataSimple(pDataObj, DragWindowFormat(), dw)))\n p_wnd = (HWND)ULongToHandle(dw);\n\n return hr;\n}\n\nHRESULT GetIsShowingLayered(IDataObject* pDataObj, BOOL& p_out)\n{\n return GetDataObjectDataSimple(pDataObj, IsShowingLayeredFormat(), p_out);\n}\n\nHRESULT set_blob(IDataObject* pdtobj, CLIPFORMAT cf, const void* pvBlob, UINT cbBlob)\n{\n HRESULT hr = E_OUTOFMEMORY;\n void* pv = GlobalAlloc(GPTR, cbBlob);\n if (pv) {\n CopyMemory(pv, pvBlob, cbBlob);\n\n FORMATETC fmte = {cf, nullptr, DVASPECT_CONTENT, -1, TYMED_HGLOBAL};\n\n \/\/ The STGMEDIUM structure is used to define how to handle a global memory transfer.\n \/\/ This structure includes a flag, tymed, which indicates the medium\n \/\/ to be used, and a union comprising pointers and a handle for getting whichever\n \/\/ medium is specified in tymed.\n STGMEDIUM medium = {0};\n medium.tymed = TYMED_HGLOBAL;\n medium.hGlobal = pv;\n\n hr = pdtobj->SetData(&fmte, &medium, TRUE);\n if (FAILED(hr)) {\n GlobalFree(pv);\n }\n }\n return hr;\n}\n\nHRESULT set_drop_description(IDataObject* pdtobj, DROPIMAGETYPE dit, const char* msg, const char* insert)\n{\n if (mmh::is_windows_vista_or_newer()) {\n DROPDESCRIPTION dd_prev;\n memset(&dd_prev, 0, sizeof(dd_prev));\n\n bool dd_prev_valid\n = (SUCCEEDED(GetDataObjectDataSimple(pdtobj, get_clipboard_format_drop_description(), dd_prev)));\n\n pfc::stringcvt::string_os_from_utf8 wmsg(msg);\n pfc::stringcvt::string_os_from_utf8 winsert(insert);\n\n \/\/ Only set the drop description if it has actually changed (otherwise things get a bit crazy near the edge of\n \/\/ the screen).\n if (!dd_prev_valid || dd_prev.type != dit || wcscmp(dd_prev.szInsert, winsert)\n || wcscmp(dd_prev.szMessage, wmsg)) {\n DROPDESCRIPTION dd;\n dd.type = dit;\n wcsncpy_s(dd.szMessage, wmsg.get_ptr(), _TRUNCATE);\n wcsncpy_s(dd.szInsert, winsert.get_ptr(), _TRUNCATE);\n return set_blob(pdtobj, get_clipboard_format_drop_description(), &dd, sizeof(dd));\n }\n return S_OK;\n }\n return E_NOTIMPL;\n}\n\nHRESULT set_using_default_drag_image(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, UsingDefaultDragImageFormat(), &value, sizeof(value));\n}\n\nHRESULT set_is_showing_text(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, IsShowingTextFormat(), &value, sizeof(value));\n}\n\nHRESULT set_disable_drag_text(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, DisableDragTextFormat(), &value, sizeof(value));\n}\n\nHRESULT set_is_computing_image(IDataObject* pdtobj, BOOL value)\n{\n return set_blob(pdtobj, IsComputingImageFormat(), &value, sizeof(value));\n}\n\nHRESULT SetPreferredDropEffect(IDataObject* pdtobj, DWORD effect)\n{\n return set_blob(pdtobj, PreferredDropEffectFormat(), &effect, sizeof(effect));\n}\n\nHRESULT do_drag_drop(HWND wnd, WPARAM initialKeyState, IDataObject* pDataObject, DWORD dwEffect, DWORD preferredEffect,\n DWORD* pdwEffect, SHDRAGIMAGE* lpsdi)\n{\n if (preferredEffect)\n SetPreferredDropEffect(pDataObject, preferredEffect);\n\n mmh::ComPtr<IDropSource> pDropSource;\n \/\/ if (!IsVistaOrNewer())\n pDropSource = new uih::ole::IDropSourceGeneric(wnd, pDataObject, initialKeyState, true, lpsdi);\n return SHDoDragDrop(wnd, pDataObject, pDropSource, dwEffect, pdwEffect);\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::QueryInterface(REFIID iid, void** ppvObject)\n{\n if (ppvObject == nullptr)\n return E_INVALIDARG;\n\n *ppvObject = nullptr;\n\n if (iid == IID_IUnknown) {\n AddRef();\n *ppvObject = (IUnknown*)this;\n return S_OK;\n }\n\n if (iid == IID_IDropSource) {\n AddRef();\n *ppvObject = (IDropSource*)this;\n return S_OK;\n }\n return E_NOINTERFACE;\n}\nULONG STDMETHODCALLTYPE IDropSourceGeneric::AddRef()\n{\n return InterlockedIncrement(&m_refcount);\n}\nULONG STDMETHODCALLTYPE IDropSourceGeneric::Release()\n{\n LONG rv = InterlockedDecrement(&m_refcount);\n if (!rv) {\n delete this;\n }\n return rv;\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::QueryContinueDrag(BOOL fEscapePressed, DWORD grfKeyState)\n{\n if (fEscapePressed || ((m_initial_key_state & MK_LBUTTON) && (grfKeyState & MK_RBUTTON))) {\n return DRAGDROP_S_CANCEL;\n }\n\n if (((m_initial_key_state & MK_LBUTTON) && !(grfKeyState & MK_LBUTTON))\n || ((m_initial_key_state & MK_RBUTTON) && !(grfKeyState & MK_RBUTTON))) {\n return DRAGDROP_S_DROP;\n }\n return S_OK;\n}\n\nHRESULT STDMETHODCALLTYPE IDropSourceGeneric::GiveFeedback(DWORD dwEffect)\n{\n HWND wnd_drag = nullptr;\n BOOL isShowingLayered = FALSE;\n if (IsThemeActive())\n GetIsShowingLayered(m_data_object, isShowingLayered);\n\n if (SUCCEEDED(GetDragWindow(m_data_object, wnd_drag)) && wnd_drag)\n PostMessage(wnd_drag, DDWM_UPDATEWINDOW, NULL, NULL);\n\n if (isShowingLayered) {\n if (!m_prev_is_showing_layered) {\n auto cursor = LoadCursor(nullptr, IDC_ARROW);\n SetCursor(cursor);\n }\n if (wnd_drag) {\n WPARAM wp = 1;\n if (dwEffect & DROPEFFECT_COPY)\n wp = 3;\n else if (dwEffect & DROPEFFECT_MOVE)\n wp = 2;\n else if (dwEffect & DROPEFFECT_LINK)\n wp = 4;\n\n PostMessage(wnd_drag, WM_USER + 2, wp, NULL);\n }\n }\n\n m_prev_is_showing_layered = isShowingLayered != 0;\n\n return isShowingLayered ? S_OK : DRAGDROP_S_USEDEFAULTCURSORS;\n}\n\nIDropSourceGeneric::IDropSourceGeneric(\n HWND wnd, IDataObject* pDataObj, DWORD initial_key_state, bool b_allowdropdescriptiontext, SHDRAGIMAGE* lpsdi)\n : m_refcount(0), m_initial_key_state(initial_key_state), m_prev_is_showing_layered(false), m_data_object(pDataObj)\n{\n HRESULT hr;\n\n if (b_allowdropdescriptiontext) {\n if (SUCCEEDED(m_drag_source_helper.instantiate(CLSID_DragDropHelper, nullptr, CLSCTX_INPROC_SERVER))) {\n mmh::ComPtr<IDragSourceHelper2> pDragSourceHelper2 = m_drag_source_helper;\n if (pDragSourceHelper2.is_valid()) {\n hr = pDragSourceHelper2->SetFlags(DSH_ALLOWDROPDESCRIPTIONTEXT);\n }\n if (lpsdi) {\n hr = m_drag_source_helper->InitializeFromBitmap(lpsdi, pDataObj);\n if (FAILED(hr) && lpsdi->hbmpDragImage) {\n DeleteObject(lpsdi->hbmpDragImage);\n lpsdi->hbmpDragImage = nullptr;\n }\n } else\n hr = m_drag_source_helper->InitializeFromWindow(wnd, nullptr, pDataObj);\n if (IsThemeActive() && IsAppThemed()) {\n set_using_default_drag_image(pDataObj);\n }\n }\n }\n}\n} \/\/ namespace uih::ole\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: pathoptions.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2008-03-25 16:45:56 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#define INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n#ifndef INCLUDED_SVLDLLAPI_H\n#include \"svtools\/svldllapi.h\"\n#endif\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_LANG_LOCALE_HPP_\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#endif\n#ifndef INCLUDED_SVTOOLS_OPTIONS_HXX\n#include <svtools\/options.hxx>\n#endif\n\n#define SVT_SEARCHPATH_DELIMITER ';'\n\n\/\/ class SvtPathOptions --------------------------------------------------\n\nclass SvtPathOptions_Impl;\nclass SVL_DLLPUBLIC SvtPathOptions: public svt::detail::Options\n{\nprivate:\n SvtPathOptions_Impl* pImp;\n\npublic:\n enum Pathes\n {\n PATH_ADDIN,\n PATH_AUTOCORRECT,\n PATH_AUTOTEXT,\n PATH_BACKUP,\n PATH_BASIC,\n PATH_BITMAP,\n PATH_CONFIG,\n PATH_DICTIONARY,\n PATH_FAVORITES,\n PATH_FILTER,\n PATH_GALLERY,\n PATH_GRAPHIC,\n PATH_HELP,\n PATH_LINGUISTIC,\n PATH_MODULE,\n PATH_PALETTE,\n PATH_PLUGIN,\n PATH_STORAGE,\n PATH_TEMP,\n PATH_TEMPLATE,\n PATH_USERCONFIG,\n PATH_WORK,\n PATH_UICONFIG,\n PATH_FINGERPRINT,\n PATH_COUNT \/\/ should always be the last element\n };\n\n SvtPathOptions();\n virtual ~SvtPathOptions();\n\n \/\/ get the pathes, not const because of using a mutex\n const String& GetAddinPath() const;\n const String& GetAutoCorrectPath() const;\n const String& GetAutoTextPath() const;\n const String& GetBackupPath() const;\n const String& GetBasicPath() const;\n const String& GetBitmapPath() const;\n const String& GetConfigPath() const;\n const String& GetDictionaryPath() const;\n const String& GetFavoritesPath() const;\n const String& GetFilterPath() const;\n const String& GetGalleryPath() const;\n const String& GetGraphicPath() const;\n const String& GetHelpPath() const;\n const String& GetLinguisticPath() const;\n const String& GetModulePath() const;\n const String& GetPalettePath() const;\n const String& GetPluginPath() const;\n const String& GetStoragePath() const;\n const String& GetTempPath() const;\n const String& GetTemplatePath() const;\n const String& GetUserConfigPath() const;\n const String& GetWorkPath() const;\n const String& GetUIConfigPath() const;\n const String& GetFingerprintPath() const;\n\n BOOL IsPathReadonly(Pathes ePath)const;\n const String& GetPath(Pathes ePath) const;\n\n \/\/ set the pathes\n void SetAddinPath( const String& rPath );\n void SetAutoCorrectPath( const String& rPath );\n void SetAutoTextPath( const String& rPath );\n void SetBackupPath( const String& rPath );\n void SetBasicPath( const String& rPath );\n void SetBitmapPath( const String& rPath );\n void SetConfigPath( const String& rPath );\n void SetDictionaryPath( const String& rPath );\n void SetFavoritesPath( const String& rPath );\n void SetFilterPath( const String& rPath );\n void SetGalleryPath( const String& rPath );\n void SetGraphicPath( const String& rPath );\n void SetHelpPath( const String& rPath );\n void SetLinguisticPath( const String& rPath );\n void SetModulePath( const String& rPath );\n void SetPalettePath( const String& rPath );\n void SetPluginPath( const String& rPath );\n void SetStoragePath( const String& rPath );\n void SetTempPath( const String& rPath );\n void SetTemplatePath( const String& rPath );\n void SetUserConfigPath( const String& rPath );\n void SetWorkPath( const String& rPath );\n void SetPath( SvtPathOptions::Pathes ePath, const String& rNewPath );\n\n String SubstituteVariable( const String& rVar );\n String UseVariable( const String& rVar );\n sal_Bool SearchFile( String& rIniFile, Pathes ePath = PATH_USERCONFIG );\n ::com::sun::star::lang::Locale GetLocale() const;\n sal_Bool IsReadonly() const;\n};\n\n#endif \/\/ #ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.2); FILE MERGED 2008\/04\/01 15:44:33 thb 1.4.2.3: #i85898# Stripping all external header guards 2008\/04\/01 12:43:14 thb 1.4.2.2: #i85898# Stripping all external header guards 2008\/03\/31 13:01:07 rt 1.4.2.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: pathoptions.hxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#define INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n#include \"svtools\/svldllapi.h\"\n#include <tools\/string.hxx>\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#include <svtools\/options.hxx>\n\n#define SVT_SEARCHPATH_DELIMITER ';'\n\n\/\/ class SvtPathOptions --------------------------------------------------\n\nclass SvtPathOptions_Impl;\nclass SVL_DLLPUBLIC SvtPathOptions: public svt::detail::Options\n{\nprivate:\n SvtPathOptions_Impl* pImp;\n\npublic:\n enum Pathes\n {\n PATH_ADDIN,\n PATH_AUTOCORRECT,\n PATH_AUTOTEXT,\n PATH_BACKUP,\n PATH_BASIC,\n PATH_BITMAP,\n PATH_CONFIG,\n PATH_DICTIONARY,\n PATH_FAVORITES,\n PATH_FILTER,\n PATH_GALLERY,\n PATH_GRAPHIC,\n PATH_HELP,\n PATH_LINGUISTIC,\n PATH_MODULE,\n PATH_PALETTE,\n PATH_PLUGIN,\n PATH_STORAGE,\n PATH_TEMP,\n PATH_TEMPLATE,\n PATH_USERCONFIG,\n PATH_WORK,\n PATH_UICONFIG,\n PATH_FINGERPRINT,\n PATH_COUNT \/\/ should always be the last element\n };\n\n SvtPathOptions();\n virtual ~SvtPathOptions();\n\n \/\/ get the pathes, not const because of using a mutex\n const String& GetAddinPath() const;\n const String& GetAutoCorrectPath() const;\n const String& GetAutoTextPath() const;\n const String& GetBackupPath() const;\n const String& GetBasicPath() const;\n const String& GetBitmapPath() const;\n const String& GetConfigPath() const;\n const String& GetDictionaryPath() const;\n const String& GetFavoritesPath() const;\n const String& GetFilterPath() const;\n const String& GetGalleryPath() const;\n const String& GetGraphicPath() const;\n const String& GetHelpPath() const;\n const String& GetLinguisticPath() const;\n const String& GetModulePath() const;\n const String& GetPalettePath() const;\n const String& GetPluginPath() const;\n const String& GetStoragePath() const;\n const String& GetTempPath() const;\n const String& GetTemplatePath() const;\n const String& GetUserConfigPath() const;\n const String& GetWorkPath() const;\n const String& GetUIConfigPath() const;\n const String& GetFingerprintPath() const;\n\n BOOL IsPathReadonly(Pathes ePath)const;\n const String& GetPath(Pathes ePath) const;\n\n \/\/ set the pathes\n void SetAddinPath( const String& rPath );\n void SetAutoCorrectPath( const String& rPath );\n void SetAutoTextPath( const String& rPath );\n void SetBackupPath( const String& rPath );\n void SetBasicPath( const String& rPath );\n void SetBitmapPath( const String& rPath );\n void SetConfigPath( const String& rPath );\n void SetDictionaryPath( const String& rPath );\n void SetFavoritesPath( const String& rPath );\n void SetFilterPath( const String& rPath );\n void SetGalleryPath( const String& rPath );\n void SetGraphicPath( const String& rPath );\n void SetHelpPath( const String& rPath );\n void SetLinguisticPath( const String& rPath );\n void SetModulePath( const String& rPath );\n void SetPalettePath( const String& rPath );\n void SetPluginPath( const String& rPath );\n void SetStoragePath( const String& rPath );\n void SetTempPath( const String& rPath );\n void SetTemplatePath( const String& rPath );\n void SetUserConfigPath( const String& rPath );\n void SetWorkPath( const String& rPath );\n void SetPath( SvtPathOptions::Pathes ePath, const String& rNewPath );\n\n String SubstituteVariable( const String& rVar );\n String UseVariable( const String& rVar );\n sal_Bool SearchFile( String& rIniFile, Pathes ePath = PATH_USERCONFIG );\n ::com::sun::star::lang::Locale GetLocale() const;\n sal_Bool IsReadonly() const;\n};\n\n#endif \/\/ #ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: pathoptions.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2007-04-11 19:31:05 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#define INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n#ifndef INCLUDED_SVLDLLAPI_H\n#include \"svtools\/svldllapi.h\"\n#endif\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_LANG_LOCALE_HPP_\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#endif\n#ifndef INCLUDED_SVTOOLS_OPTIONS_HXX\n#include <svtools\/options.hxx>\n#endif\n\n#define SVT_SEARCHPATH_DELIMITER ';'\n\n\/\/ class SvtPathOptions --------------------------------------------------\n\nclass SvtPathOptions_Impl;\nclass SVL_DLLPUBLIC SvtPathOptions: public svt::detail::Options\n{\nprivate:\n SvtPathOptions_Impl* pImp;\n\npublic:\n enum Pathes\n {\n PATH_ADDIN,\n PATH_AUTOCORRECT,\n PATH_AUTOTEXT,\n PATH_BACKUP,\n PATH_BASIC,\n PATH_BITMAP,\n PATH_CONFIG,\n PATH_DICTIONARY,\n PATH_FAVORITES,\n PATH_FILTER,\n PATH_GALLERY,\n PATH_GRAPHIC,\n PATH_HELP,\n PATH_LINGUISTIC,\n PATH_MODULE,\n PATH_PALETTE,\n PATH_PLUGIN,\n PATH_STORAGE,\n PATH_TEMP,\n PATH_TEMPLATE,\n PATH_USERCONFIG,\n PATH_USERDICTIONARY,\n PATH_WORK,\n PATH_UICONFIG,\n PATH_COUNT \/\/ should always be the last element\n };\n\n SvtPathOptions();\n virtual ~SvtPathOptions();\n\n \/\/ get the pathes, not const because of using a mutex\n const String& GetAddinPath() const;\n const String& GetAutoCorrectPath() const;\n const String& GetAutoTextPath() const;\n const String& GetBackupPath() const;\n const String& GetBasicPath() const;\n const String& GetBitmapPath() const;\n const String& GetConfigPath() const;\n const String& GetDictionaryPath() const;\n const String& GetFavoritesPath() const;\n const String& GetFilterPath() const;\n const String& GetGalleryPath() const;\n const String& GetGraphicPath() const;\n const String& GetHelpPath() const;\n const String& GetLinguisticPath() const;\n const String& GetModulePath() const;\n const String& GetPalettePath() const;\n const String& GetPluginPath() const;\n const String& GetStoragePath() const;\n const String& GetTempPath() const;\n const String& GetTemplatePath() const;\n const String& GetUserConfigPath() const;\n const String& GetUserDictionaryPath() const;\n const String& GetWorkPath() const;\n const String& GetUIConfigPath() const;\n\n BOOL IsPathReadonly(Pathes ePath)const;\n const String& GetPath(Pathes ePath) const;\n\n \/\/ set the pathes\n void SetAddinPath( const String& rPath );\n void SetAutoCorrectPath( const String& rPath );\n void SetAutoTextPath( const String& rPath );\n void SetBackupPath( const String& rPath );\n void SetBasicPath( const String& rPath );\n void SetBitmapPath( const String& rPath );\n void SetConfigPath( const String& rPath );\n void SetDictionaryPath( const String& rPath );\n void SetFavoritesPath( const String& rPath );\n void SetFilterPath( const String& rPath );\n void SetGalleryPath( const String& rPath );\n void SetGraphicPath( const String& rPath );\n void SetHelpPath( const String& rPath );\n void SetLinguisticPath( const String& rPath );\n void SetModulePath( const String& rPath );\n void SetPalettePath( const String& rPath );\n void SetPluginPath( const String& rPath );\n void SetStoragePath( const String& rPath );\n void SetTempPath( const String& rPath );\n void SetTemplatePath( const String& rPath );\n void SetUserConfigPath( const String& rPath );\n void SetUserDictionaryPath( const String& rPath );\n void SetWorkPath( const String& rPath );\n void SetPath( SvtPathOptions::Pathes ePath, const String& rNewPath );\n\n String SubstituteVariable( const String& rVar );\n String UseVariable( const String& rVar );\n sal_Bool SearchFile( String& rIniFile, Pathes ePath = PATH_USERCONFIG );\n ::com::sun::star::lang::Locale GetLocale() const;\n sal_Bool IsReadonly() const;\n};\n\n#endif \/\/ #ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n<commit_msg>INTEGRATION: CWS languageguessing (1.2.6); FILE MERGED 2007\/04\/24 10:44:06 tl 1.2.6.1: #i73173# moved header file patched<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: pathoptions.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2007-06-19 15:59:17 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n#define INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n#ifndef INCLUDED_SVLDLLAPI_H\n#include \"svtools\/svldllapi.h\"\n#endif\n\n#ifndef _STRING_HXX\n#include <tools\/string.hxx>\n#endif\n#ifndef _COM_SUN_STAR_LANG_LOCALE_HPP_\n#include <com\/sun\/star\/lang\/Locale.hpp>\n#endif\n#ifndef INCLUDED_SVTOOLS_OPTIONS_HXX\n#include <svtools\/options.hxx>\n#endif\n\n#define SVT_SEARCHPATH_DELIMITER ';'\n\n\/\/ class SvtPathOptions --------------------------------------------------\n\nclass SvtPathOptions_Impl;\nclass SVL_DLLPUBLIC SvtPathOptions: public svt::detail::Options\n{\nprivate:\n SvtPathOptions_Impl* pImp;\n\npublic:\n enum Pathes\n {\n PATH_ADDIN,\n PATH_AUTOCORRECT,\n PATH_AUTOTEXT,\n PATH_BACKUP,\n PATH_BASIC,\n PATH_BITMAP,\n PATH_CONFIG,\n PATH_DICTIONARY,\n PATH_FAVORITES,\n PATH_FILTER,\n PATH_GALLERY,\n PATH_GRAPHIC,\n PATH_HELP,\n PATH_LINGUISTIC,\n PATH_MODULE,\n PATH_PALETTE,\n PATH_PLUGIN,\n PATH_STORAGE,\n PATH_TEMP,\n PATH_TEMPLATE,\n PATH_USERCONFIG,\n PATH_USERDICTIONARY,\n PATH_WORK,\n PATH_UICONFIG,\n PATH_FINGERPRINT,\n PATH_COUNT \/\/ should always be the last element\n };\n\n SvtPathOptions();\n virtual ~SvtPathOptions();\n\n \/\/ get the pathes, not const because of using a mutex\n const String& GetAddinPath() const;\n const String& GetAutoCorrectPath() const;\n const String& GetAutoTextPath() const;\n const String& GetBackupPath() const;\n const String& GetBasicPath() const;\n const String& GetBitmapPath() const;\n const String& GetConfigPath() const;\n const String& GetDictionaryPath() const;\n const String& GetFavoritesPath() const;\n const String& GetFilterPath() const;\n const String& GetGalleryPath() const;\n const String& GetGraphicPath() const;\n const String& GetHelpPath() const;\n const String& GetLinguisticPath() const;\n const String& GetModulePath() const;\n const String& GetPalettePath() const;\n const String& GetPluginPath() const;\n const String& GetStoragePath() const;\n const String& GetTempPath() const;\n const String& GetTemplatePath() const;\n const String& GetUserConfigPath() const;\n const String& GetUserDictionaryPath() const;\n const String& GetWorkPath() const;\n const String& GetUIConfigPath() const;\n const String& GetFingerprintPath() const;\n\n BOOL IsPathReadonly(Pathes ePath)const;\n const String& GetPath(Pathes ePath) const;\n\n \/\/ set the pathes\n void SetAddinPath( const String& rPath );\n void SetAutoCorrectPath( const String& rPath );\n void SetAutoTextPath( const String& rPath );\n void SetBackupPath( const String& rPath );\n void SetBasicPath( const String& rPath );\n void SetBitmapPath( const String& rPath );\n void SetConfigPath( const String& rPath );\n void SetDictionaryPath( const String& rPath );\n void SetFavoritesPath( const String& rPath );\n void SetFilterPath( const String& rPath );\n void SetGalleryPath( const String& rPath );\n void SetGraphicPath( const String& rPath );\n void SetHelpPath( const String& rPath );\n void SetLinguisticPath( const String& rPath );\n void SetModulePath( const String& rPath );\n void SetPalettePath( const String& rPath );\n void SetPluginPath( const String& rPath );\n void SetStoragePath( const String& rPath );\n void SetTempPath( const String& rPath );\n void SetTemplatePath( const String& rPath );\n void SetUserConfigPath( const String& rPath );\n void SetUserDictionaryPath( const String& rPath );\n void SetWorkPath( const String& rPath );\n void SetPath( SvtPathOptions::Pathes ePath, const String& rNewPath );\n\n String SubstituteVariable( const String& rVar );\n String UseVariable( const String& rVar );\n sal_Bool SearchFile( String& rIniFile, Pathes ePath = PATH_USERCONFIG );\n ::com::sun::star::lang::Locale GetLocale() const;\n sal_Bool IsReadonly() const;\n};\n\n#endif \/\/ #ifndef INCLUDED_SVTOOLS_PATHOPTIONS_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: logindlg.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: fs $ $Date: 2000-10-09 06:50:10 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVT_FILEDLG_HXX\n#include <svtools\/filedlg.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n#ifndef _SVTOOLS_LOGINDLG_HXX_\n#include \"logindlg.hxx\"\n#endif\n\n#ifndef _SVTOOLS_LOGINDLG_HRC_\n#include \"logindlg.hrc\"\n#endif\n#ifndef _SVTOOLS_HRC\n#include \"svtools.hrc\"\n#endif\n\n#ifndef _SVTOOLS_SVTDATA_HXX\n#include \"svtdata.hxx\"\n#endif\n\n#ifdef UNX\n#include <limits.h>\n#define _MAX_PATH PATH_MAX\n#endif\n\n\/\/ LoginDialog -------------------------------------------------------\n\n\/\/............................................................................\nnamespace svt\n{\n\/\/............................................................................\n\nvoid LoginDialog::HideControls_Impl( USHORT nFlags )\n{\n FASTBOOL bPathHide = FALSE;\n FASTBOOL bErrorHide = FALSE;\n FASTBOOL bAccountHide = FALSE;\n\n if ( ( nFlags & LF_NO_PATH ) == LF_NO_PATH )\n {\n aPathFT.Hide();\n aPathED.Hide();\n aPathBtn.Hide();\n bPathHide = TRUE;\n }\n else if ( ( nFlags & LF_PATH_READONLY ) == LF_PATH_READONLY )\n {\n aPathED.Hide();\n aPathInfo.Show();\n aPathBtn.Hide();\n }\n\n if ( ( nFlags & LF_NO_USERNAME ) == LF_NO_USERNAME )\n {\n aNameFT.Hide();\n aNameED.Hide();\n }\n else if ( ( nFlags & LF_USERNAME_READONLY ) == LF_USERNAME_READONLY )\n {\n aNameED.Hide();\n aNameInfo.Show();\n }\n\n if ( ( nFlags & LF_NO_PASSWORD ) == LF_NO_PASSWORD )\n {\n aPasswordFT.Hide();\n aPasswordED.Hide();\n }\n\n if ( ( nFlags & LF_NO_SAVEPASSWORD ) == LF_NO_SAVEPASSWORD )\n aSavePasswdBtn.Hide();\n\n if ( ( nFlags & LF_NO_ERRORTEXT ) == LF_NO_ERRORTEXT )\n {\n aErrorInfo.Hide();\n aErrorGB.Hide();\n bErrorHide = TRUE;\n }\n\n if ( ( nFlags & LF_NO_ACCOUNT ) == LF_NO_ACCOUNT )\n {\n aAccountFT.Hide();\n aAccountED.Hide();\n bAccountHide = TRUE;\n }\n\n if ( bErrorHide )\n {\n long nOffset = aLoginGB.GetPosPixel().Y() -\n aErrorGB.GetPosPixel().Y();\n Point aNewPnt = aRequestInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aRequestInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPathFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathFT.SetPosPixel( aNewPnt );\n aNewPnt = aPathED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathED.SetPosPixel( aNewPnt );\n aNewPnt = aPathInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPathBtn.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathBtn.SetPosPixel( aNewPnt );\n aNewPnt = aNameFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameFT.SetPosPixel( aNewPnt );\n aNewPnt = aNameED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameED.SetPosPixel( aNewPnt );\n aNewPnt = aNameInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPasswordFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPasswordFT.SetPosPixel( aNewPnt );\n aNewPnt = aPasswordED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPasswordED.SetPosPixel( aNewPnt );\n aNewPnt = aAccountFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aAccountFT.SetPosPixel( aNewPnt );\n aNewPnt = aAccountED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aAccountED.SetPosPixel( aNewPnt );\n aNewPnt = aSavePasswdBtn.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aNewPnt );\n aNewPnt = aLoginGB.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aLoginGB.SetPosPixel( aNewPnt );\n Size aNewSiz = GetSizePixel();\n aNewSiz.Height() -= nOffset;\n SetSizePixel( aNewSiz );\n }\n\n if ( bPathHide )\n {\n long nOffset = aNameED.GetPosPixel().Y() -\n aPathED.GetPosPixel().Y();\n\n Point aTmpPnt1 = aNameFT.GetPosPixel();\n Point aTmpPnt2 = aPasswordFT.GetPosPixel();\n aNameFT.SetPosPixel( aPathFT.GetPosPixel() );\n aPasswordFT.SetPosPixel( aTmpPnt1 );\n aAccountFT.SetPosPixel( aTmpPnt2 );\n aTmpPnt1 = aNameED.GetPosPixel();\n aTmpPnt2 = aPasswordED.GetPosPixel();\n aNameED.SetPosPixel( aPathED.GetPosPixel() );\n aPasswordED.SetPosPixel( aTmpPnt1 );\n aAccountED.SetPosPixel( aTmpPnt2 );\n aNameInfo.SetPosPixel( aPathInfo.GetPosPixel() );\n aTmpPnt1 = aSavePasswdBtn.GetPosPixel();\n aTmpPnt1.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aTmpPnt1 );\n Size aNewSz = aLoginGB.GetSizePixel();\n aNewSz.Height() -= nOffset;\n aLoginGB.SetSizePixel( aNewSz );\n aNewSz = GetSizePixel();\n aNewSz.Height() -= nOffset;\n SetSizePixel( aNewSz );\n }\n\n if ( bAccountHide )\n {\n long nOffset = aAccountED.GetPosPixel().Y() - aPasswordED.GetPosPixel().Y();\n\n Point aTmpPnt = aSavePasswdBtn.GetPosPixel();\n aTmpPnt.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aTmpPnt );\n Size aNewSz = aLoginGB.GetSizePixel();\n aNewSz.Height() -= nOffset;\n aLoginGB.SetSizePixel( aNewSz );\n aNewSz = GetSizePixel();\n aNewSz.Height() -= nOffset;\n SetSizePixel( aNewSz );\n }\n};\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( LoginDialog, OKHdl_Impl, OKButton *, EMPTYARG )\n{\n \/\/ trim the strings\n aNameED.SetText( aNameED.GetText().EraseLeadingChars().\n EraseTrailingChars() );\n aPasswordED.SetText( aPasswordED.GetText().EraseLeadingChars().\n EraseTrailingChars() );\n EndDialog( RET_OK );\n return 1;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( LoginDialog, PathHdl_Impl, PushButton *, EMPTYARG )\n{\n PathDialog* pDlg = new PathDialog( this, WB_SVLOOK );\n\/\/ DirEntry aEntry;\n\/\/ aEntry.ToAbs();\n\/\/ pDlg->SetPath( aEntry.GetFull() );\n\n if ( pDlg->Execute() == RET_OK )\n aPathED.SetText( pDlg->GetPath() );\n\n delete pDlg;\n return 1;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLoginDialog::LoginDialog\n(\n Window* pParent,\n USHORT nFlags,\n const String& rServer,\n const String* pRealm\n) :\n\n ModalDialog( pParent, SvtResId( DLG_LOGIN ) ),\n\n aErrorInfo ( this, ResId( INFO_LOGIN_ERROR ) ),\n aErrorGB ( this, ResId( GB_LOGIN_ERROR ) ),\n aRequestInfo ( this, ResId( INFO_LOGIN_REQUEST ) ),\n aPathFT ( this, ResId( FT_LOGIN_PATH ) ),\n aPathED ( this, ResId( ED_LOGIN_PATH ) ),\n aPathInfo ( this, ResId( INFO_LOGIN_PATH ) ),\n aPathBtn ( this, ResId( BTN_LOGIN_PATH ) ),\n aNameFT ( this, ResId( FT_LOGIN_USERNAME ) ),\n aNameED ( this, ResId( ED_LOGIN_USERNAME ) ),\n aNameInfo ( this, ResId( INFO_LOGIN_USERNAME ) ),\n aPasswordFT ( this, ResId( FT_LOGIN_PASSWORD ) ),\n aPasswordED ( this, ResId( ED_LOGIN_PASSWORD ) ),\n aAccountFT ( this, ResId( FT_LOGIN_ACCOUNT ) ),\n aAccountED ( this, ResId( ED_LOGIN_ACCOUNT ) ),\n aSavePasswdBtn ( this, ResId( CB_LOGIN_SAVEPASSWORD ) ),\n aLoginGB ( this, ResId( GB_LOGIN_LOGIN ) ),\n aOKBtn ( this, ResId( BTN_LOGIN_OK ) ),\n aCancelBtn ( this, ResId( BTN_LOGIN_CANCEL ) ),\n aHelpBtn ( this, ResId( BTN_LOGIN_HELP ) )\n\n{\n \/\/ Einlog-Ort eintragen\n String aServer;\n\n if ( ( ( nFlags & LF_NO_ACCOUNT ) == LF_NO_ACCOUNT ) && pRealm && pRealm->Len() )\n {\n aServer = *pRealm;\n ( ( aServer += ' ' ) += String( ResId( STR_LOGIN_AT ) ) ) += ' ';\n }\n aServer += rServer;\n String aTxt = aRequestInfo.GetText();\n aTxt.SearchAndReplaceAscii( \"%1\", aServer );\n aRequestInfo.SetText( aTxt );\n\n FreeResource();\n\n aPathED.SetMaxTextLen( _MAX_PATH );\n aNameED.SetMaxTextLen( _MAX_PATH );\n\n aOKBtn.SetClickHdl( LINK( this, LoginDialog, OKHdl_Impl ) );\n aPathBtn.SetClickHdl( LINK( this, LoginDialog, PathHdl_Impl ) );\n\n HideControls_Impl( nFlags );\n};\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::SetName( const String& rNewName )\n{\n aNameED.SetText( rNewName );\n aNameInfo.SetText( rNewName );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::ClearPassword()\n{\n aPasswordED.SetText( String() );\n\n if ( 0 == aNameED.GetText().Len() )\n aNameED.GrabFocus();\n else\n aPasswordED.GrabFocus();\n};\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::ClearAccount()\n{\n aAccountED.SetText( String() );\n aAccountED.GrabFocus();\n};\n\n\/\/............................................................................\n} \/\/ namespace svt\n\/\/............................................................................\n<commit_msg>Changed #include <svtools\/XXX.hxx> into #include <XXX.hxx> since this file is now in the svtools project.<commit_after>\/*************************************************************************\n *\n * $RCSfile: logindlg.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: pluby $ $Date: 2000-10-19 22:47:11 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVT_FILEDLG_HXX\n#include <filedlg.hxx>\n#endif\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n#ifndef _SVTOOLS_LOGINDLG_HXX_\n#include \"logindlg.hxx\"\n#endif\n\n#ifndef _SVTOOLS_LOGINDLG_HRC_\n#include \"logindlg.hrc\"\n#endif\n#ifndef _SVTOOLS_HRC\n#include \"svtools.hrc\"\n#endif\n\n#ifndef _SVTOOLS_SVTDATA_HXX\n#include \"svtdata.hxx\"\n#endif\n\n#ifdef UNX\n#include <limits.h>\n#define _MAX_PATH PATH_MAX\n#endif\n\n\/\/ LoginDialog -------------------------------------------------------\n\n\/\/............................................................................\nnamespace svt\n{\n\/\/............................................................................\n\nvoid LoginDialog::HideControls_Impl( USHORT nFlags )\n{\n FASTBOOL bPathHide = FALSE;\n FASTBOOL bErrorHide = FALSE;\n FASTBOOL bAccountHide = FALSE;\n\n if ( ( nFlags & LF_NO_PATH ) == LF_NO_PATH )\n {\n aPathFT.Hide();\n aPathED.Hide();\n aPathBtn.Hide();\n bPathHide = TRUE;\n }\n else if ( ( nFlags & LF_PATH_READONLY ) == LF_PATH_READONLY )\n {\n aPathED.Hide();\n aPathInfo.Show();\n aPathBtn.Hide();\n }\n\n if ( ( nFlags & LF_NO_USERNAME ) == LF_NO_USERNAME )\n {\n aNameFT.Hide();\n aNameED.Hide();\n }\n else if ( ( nFlags & LF_USERNAME_READONLY ) == LF_USERNAME_READONLY )\n {\n aNameED.Hide();\n aNameInfo.Show();\n }\n\n if ( ( nFlags & LF_NO_PASSWORD ) == LF_NO_PASSWORD )\n {\n aPasswordFT.Hide();\n aPasswordED.Hide();\n }\n\n if ( ( nFlags & LF_NO_SAVEPASSWORD ) == LF_NO_SAVEPASSWORD )\n aSavePasswdBtn.Hide();\n\n if ( ( nFlags & LF_NO_ERRORTEXT ) == LF_NO_ERRORTEXT )\n {\n aErrorInfo.Hide();\n aErrorGB.Hide();\n bErrorHide = TRUE;\n }\n\n if ( ( nFlags & LF_NO_ACCOUNT ) == LF_NO_ACCOUNT )\n {\n aAccountFT.Hide();\n aAccountED.Hide();\n bAccountHide = TRUE;\n }\n\n if ( bErrorHide )\n {\n long nOffset = aLoginGB.GetPosPixel().Y() -\n aErrorGB.GetPosPixel().Y();\n Point aNewPnt = aRequestInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aRequestInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPathFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathFT.SetPosPixel( aNewPnt );\n aNewPnt = aPathED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathED.SetPosPixel( aNewPnt );\n aNewPnt = aPathInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPathBtn.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPathBtn.SetPosPixel( aNewPnt );\n aNewPnt = aNameFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameFT.SetPosPixel( aNewPnt );\n aNewPnt = aNameED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameED.SetPosPixel( aNewPnt );\n aNewPnt = aNameInfo.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aNameInfo.SetPosPixel( aNewPnt );\n aNewPnt = aPasswordFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPasswordFT.SetPosPixel( aNewPnt );\n aNewPnt = aPasswordED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aPasswordED.SetPosPixel( aNewPnt );\n aNewPnt = aAccountFT.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aAccountFT.SetPosPixel( aNewPnt );\n aNewPnt = aAccountED.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aAccountED.SetPosPixel( aNewPnt );\n aNewPnt = aSavePasswdBtn.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aNewPnt );\n aNewPnt = aLoginGB.GetPosPixel();\n aNewPnt.Y() -= nOffset;\n aLoginGB.SetPosPixel( aNewPnt );\n Size aNewSiz = GetSizePixel();\n aNewSiz.Height() -= nOffset;\n SetSizePixel( aNewSiz );\n }\n\n if ( bPathHide )\n {\n long nOffset = aNameED.GetPosPixel().Y() -\n aPathED.GetPosPixel().Y();\n\n Point aTmpPnt1 = aNameFT.GetPosPixel();\n Point aTmpPnt2 = aPasswordFT.GetPosPixel();\n aNameFT.SetPosPixel( aPathFT.GetPosPixel() );\n aPasswordFT.SetPosPixel( aTmpPnt1 );\n aAccountFT.SetPosPixel( aTmpPnt2 );\n aTmpPnt1 = aNameED.GetPosPixel();\n aTmpPnt2 = aPasswordED.GetPosPixel();\n aNameED.SetPosPixel( aPathED.GetPosPixel() );\n aPasswordED.SetPosPixel( aTmpPnt1 );\n aAccountED.SetPosPixel( aTmpPnt2 );\n aNameInfo.SetPosPixel( aPathInfo.GetPosPixel() );\n aTmpPnt1 = aSavePasswdBtn.GetPosPixel();\n aTmpPnt1.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aTmpPnt1 );\n Size aNewSz = aLoginGB.GetSizePixel();\n aNewSz.Height() -= nOffset;\n aLoginGB.SetSizePixel( aNewSz );\n aNewSz = GetSizePixel();\n aNewSz.Height() -= nOffset;\n SetSizePixel( aNewSz );\n }\n\n if ( bAccountHide )\n {\n long nOffset = aAccountED.GetPosPixel().Y() - aPasswordED.GetPosPixel().Y();\n\n Point aTmpPnt = aSavePasswdBtn.GetPosPixel();\n aTmpPnt.Y() -= nOffset;\n aSavePasswdBtn.SetPosPixel( aTmpPnt );\n Size aNewSz = aLoginGB.GetSizePixel();\n aNewSz.Height() -= nOffset;\n aLoginGB.SetSizePixel( aNewSz );\n aNewSz = GetSizePixel();\n aNewSz.Height() -= nOffset;\n SetSizePixel( aNewSz );\n }\n};\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( LoginDialog, OKHdl_Impl, OKButton *, EMPTYARG )\n{\n \/\/ trim the strings\n aNameED.SetText( aNameED.GetText().EraseLeadingChars().\n EraseTrailingChars() );\n aPasswordED.SetText( aPasswordED.GetText().EraseLeadingChars().\n EraseTrailingChars() );\n EndDialog( RET_OK );\n return 1;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK( LoginDialog, PathHdl_Impl, PushButton *, EMPTYARG )\n{\n PathDialog* pDlg = new PathDialog( this, WB_SVLOOK );\n\/\/ DirEntry aEntry;\n\/\/ aEntry.ToAbs();\n\/\/ pDlg->SetPath( aEntry.GetFull() );\n\n if ( pDlg->Execute() == RET_OK )\n aPathED.SetText( pDlg->GetPath() );\n\n delete pDlg;\n return 1;\n}\n\n\/\/ -----------------------------------------------------------------------\n\nLoginDialog::LoginDialog\n(\n Window* pParent,\n USHORT nFlags,\n const String& rServer,\n const String* pRealm\n) :\n\n ModalDialog( pParent, SvtResId( DLG_LOGIN ) ),\n\n aErrorInfo ( this, ResId( INFO_LOGIN_ERROR ) ),\n aErrorGB ( this, ResId( GB_LOGIN_ERROR ) ),\n aRequestInfo ( this, ResId( INFO_LOGIN_REQUEST ) ),\n aPathFT ( this, ResId( FT_LOGIN_PATH ) ),\n aPathED ( this, ResId( ED_LOGIN_PATH ) ),\n aPathInfo ( this, ResId( INFO_LOGIN_PATH ) ),\n aPathBtn ( this, ResId( BTN_LOGIN_PATH ) ),\n aNameFT ( this, ResId( FT_LOGIN_USERNAME ) ),\n aNameED ( this, ResId( ED_LOGIN_USERNAME ) ),\n aNameInfo ( this, ResId( INFO_LOGIN_USERNAME ) ),\n aPasswordFT ( this, ResId( FT_LOGIN_PASSWORD ) ),\n aPasswordED ( this, ResId( ED_LOGIN_PASSWORD ) ),\n aAccountFT ( this, ResId( FT_LOGIN_ACCOUNT ) ),\n aAccountED ( this, ResId( ED_LOGIN_ACCOUNT ) ),\n aSavePasswdBtn ( this, ResId( CB_LOGIN_SAVEPASSWORD ) ),\n aLoginGB ( this, ResId( GB_LOGIN_LOGIN ) ),\n aOKBtn ( this, ResId( BTN_LOGIN_OK ) ),\n aCancelBtn ( this, ResId( BTN_LOGIN_CANCEL ) ),\n aHelpBtn ( this, ResId( BTN_LOGIN_HELP ) )\n\n{\n \/\/ Einlog-Ort eintragen\n String aServer;\n\n if ( ( ( nFlags & LF_NO_ACCOUNT ) == LF_NO_ACCOUNT ) && pRealm && pRealm->Len() )\n {\n aServer = *pRealm;\n ( ( aServer += ' ' ) += String( ResId( STR_LOGIN_AT ) ) ) += ' ';\n }\n aServer += rServer;\n String aTxt = aRequestInfo.GetText();\n aTxt.SearchAndReplaceAscii( \"%1\", aServer );\n aRequestInfo.SetText( aTxt );\n\n FreeResource();\n\n aPathED.SetMaxTextLen( _MAX_PATH );\n aNameED.SetMaxTextLen( _MAX_PATH );\n\n aOKBtn.SetClickHdl( LINK( this, LoginDialog, OKHdl_Impl ) );\n aPathBtn.SetClickHdl( LINK( this, LoginDialog, PathHdl_Impl ) );\n\n HideControls_Impl( nFlags );\n};\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::SetName( const String& rNewName )\n{\n aNameED.SetText( rNewName );\n aNameInfo.SetText( rNewName );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::ClearPassword()\n{\n aPasswordED.SetText( String() );\n\n if ( 0 == aNameED.GetText().Len() )\n aNameED.GrabFocus();\n else\n aPasswordED.GrabFocus();\n};\n\n\/\/ -----------------------------------------------------------------------\n\nvoid LoginDialog::ClearAccount()\n{\n aAccountED.SetText( String() );\n aAccountED.GrabFocus();\n};\n\n\/\/............................................................................\n} \/\/ namespace svt\n\/\/............................................................................\n<|endoftext|>"} {"text":"<commit_before><commit_msg>remove copypasta<commit_after><|endoftext|>"} {"text":"<commit_before>#include <log2plot\/config_manager.h>\n#include <math.h>\n\nnamespace log2plot\n{\n\nvoid ConfigManager::updateFrom(int argc, char **argv, bool warn)\n{\n for(int i = 0; i < (argc-1)\/2; i+=2)\n {\n const auto tags = toTags(argv[2*i+1]);\n if(has(tags))\n finalNode(tags, config) = std::string(argv[2*i+2]);\n else if(warn)\n std::cout << \"log2plot: Passed argument '\" << argv[2*i+1] << \"' is not a configuration tag\" << std::endl;\n }\n}\n\nstd::vector<std::string> ConfigManager::toTags(std::string tag) const\n{\n std::vector<std::string> tags;\n std::string out;\n std::istringstream iss(tag);\n while(std::getline(iss, out, ':'))\n tags.push_back(out);\n\n return tags;\n}\n\nvoid ConfigManager::addConditionalNameElement(std::string strTrue, bool condition, std::string strFalse)\n{\n if(condition)\n addNameElement(strTrue);\n else\n addNameElement(strFalse);\n}\n\nvoid ConfigManager::addNameElement(std::string str)\n{\n if(str.size())\n {\n if(base_name.size())\n base_name += \"_\";\n base_name += str;\n }\n}\n\n\/\/ print tag error\nstd::string ConfigManager::tagPathMessage(TagList tags, std::string msg) const\n{\n std::string ret(msg + \"\\n - file: \" + config_file + \"\\n - tag: \");\n\n for(size_t idx = 0; idx < tags.size()-1; ++idx)\n ret += tags[idx] + \":\";\n return ret + tags.back();\n}\n\nYAML::Node ConfigManager::finalNode(TagList tags, const YAML::Node &node, size_t idx) const\n{ \n const auto& tag = tags[idx];\n const auto &child = node[tag];\n if(!child)\n throw std::runtime_error(tagPathMessage(tags, \"tag does not exist\"));\n\n if(idx == tags.size()-1)\n return child;\n\n return finalNode(tags, child, idx+1);\n\n}\n\ndouble ConfigManager::str2double(std::string s)\n{\n if(s.size() > 1)\n {\n \/\/ look for fractions of pi\n for(const auto denum: {2, 3, 4, 6, 1})\n {\n for(const auto sign: {1, -1})\n {\n for(const auto pi: {\"PI\", \"pi\"})\n {\n \/\/ build string to be searched\n std::stringstream ss;\n if(sign == -1)\n ss << \"-\";\n ss << pi;\n if(denum != 1)\n ss << \"\/\" << denum;\n if(s == ss.str())\n return sign * M_PI\/denum;\n }\n }\n }\n }\n return atof(s.c_str());\n}\n\n}\n\n\n<commit_msg>offset bug in cmd line parser<commit_after>#include <log2plot\/config_manager.h>\n#include <math.h>\n\nnamespace log2plot\n{\n\nvoid ConfigManager::updateFrom(int argc, char **argv, bool warn)\n{\n for(int i = 0; i < (argc-1)\/2; i++)\n {\n const auto tags = toTags(argv[2*i+1]);\n if(has(tags))\n finalNode(tags, config) = std::string(argv[2*i+2]);\n else if(warn)\n std::cout << \"log2plot: Passed argument '\" << argv[2*i+1] << \"' is not a configuration tag\" << std::endl;\n }\n}\n\nstd::vector<std::string> ConfigManager::toTags(std::string tag) const\n{\n std::vector<std::string> tags;\n std::string out;\n std::istringstream iss(tag);\n while(std::getline(iss, out, ':'))\n tags.push_back(out);\n\n return tags;\n}\n\nvoid ConfigManager::addConditionalNameElement(std::string strTrue, bool condition, std::string strFalse)\n{\n if(condition)\n addNameElement(strTrue);\n else\n addNameElement(strFalse);\n}\n\nvoid ConfigManager::addNameElement(std::string str)\n{\n if(str.size())\n {\n if(base_name.size())\n base_name += \"_\";\n base_name += str;\n }\n}\n\n\/\/ print tag error\nstd::string ConfigManager::tagPathMessage(TagList tags, std::string msg) const\n{\n std::string ret(msg + \"\\n - file: \" + config_file + \"\\n - tag: \");\n\n for(size_t idx = 0; idx < tags.size()-1; ++idx)\n ret += tags[idx] + \":\";\n return ret + tags.back();\n}\n\nYAML::Node ConfigManager::finalNode(TagList tags, const YAML::Node &node, size_t idx) const\n{ \n const auto& tag = tags[idx];\n const auto &child = node[tag];\n if(!child)\n throw std::runtime_error(tagPathMessage(tags, \"tag does not exist\"));\n\n if(idx == tags.size()-1)\n return child;\n\n return finalNode(tags, child, idx+1);\n\n}\n\ndouble ConfigManager::str2double(std::string s)\n{\n if(s.size() > 1)\n {\n \/\/ look for fractions of pi\n for(const auto denum: {2, 3, 4, 6, 1})\n {\n for(const auto sign: {1, -1})\n {\n for(const auto pi: {\"PI\", \"pi\"})\n {\n \/\/ build string to be searched\n std::stringstream ss;\n if(sign == -1)\n ss << \"-\";\n ss << pi;\n if(denum != 1)\n ss << \"\/\" << denum;\n if(s == ss.str())\n return sign * M_PI\/denum;\n }\n }\n }\n }\n return atof(s.c_str());\n}\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright 2019 ScyllaDB\n *\/\n\n#include <boost\/intrusive\/parent_from_member.hpp>\n#include <seastar\/core\/fair_queue.hh>\n#include <seastar\/core\/future.hh>\n#include <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/circular_buffer.hh>\n#include <seastar\/util\/noncopyable_function.hh>\n#include <seastar\/core\/reactor.hh>\n#include <queue>\n#include <chrono>\n#include <unordered_set>\n#include <cmath>\n\n#include \"fmt\/format.h\"\n#include \"fmt\/ostream.h\"\n\nnamespace seastar {\n\nstatic_assert(sizeof(fair_queue_ticket) == sizeof(uint64_t), \"unexpected fair_queue_ticket size\");\nstatic_assert(sizeof(fair_queue_entry) <= 3 * sizeof(void*), \"unexpected fair_queue_entry::_hook size\");\nstatic_assert(sizeof(fair_queue_entry::container_list_t) == 2 * sizeof(void*), \"unexpected priority_class::_queue size\");\n\nfair_queue_ticket::fair_queue_ticket(uint32_t weight, uint32_t size) noexcept\n : _weight(weight)\n , _size(size)\n{}\n\nfloat fair_queue_ticket::normalize(fair_queue_ticket denominator) const noexcept {\n return float(_weight) \/ denominator._weight + float(_size) \/ denominator._size;\n}\n\nfair_queue_ticket fair_queue_ticket::operator+(fair_queue_ticket desc) const noexcept {\n return fair_queue_ticket(_weight + desc._weight, _size + desc._size);\n}\n\nfair_queue_ticket& fair_queue_ticket::operator+=(fair_queue_ticket desc) noexcept {\n _weight += desc._weight;\n _size += desc._size;\n return *this;\n}\n\nfair_queue_ticket fair_queue_ticket::operator-(fair_queue_ticket desc) const noexcept {\n return fair_queue_ticket(_weight - desc._weight, _size - desc._size);\n}\n\nfair_queue_ticket& fair_queue_ticket::operator-=(fair_queue_ticket desc) noexcept {\n _weight -= desc._weight;\n _size -= desc._size;\n return *this;\n}\n\nfair_queue_ticket::operator bool() const noexcept {\n return (_weight > 0) || (_size > 0);\n}\n\nbool fair_queue_ticket::operator==(const fair_queue_ticket& o) const noexcept {\n return _weight == o._weight && _size == o._size;\n}\n\nstd::ostream& operator<<(std::ostream& os, fair_queue_ticket t) {\n return os << t._weight << \":\" << t._size;\n}\n\nfair_group_rover::fair_group_rover(uint32_t weight, uint32_t size) noexcept\n : _weight(weight)\n , _size(size)\n{}\n\nfair_queue_ticket fair_group_rover::maybe_ahead_of(const fair_group_rover& other) const noexcept {\n return fair_queue_ticket(std::max<int32_t>(_weight - other._weight, 0),\n std::max<int32_t>(_size - other._size, 0));\n}\n\nfair_group_rover fair_group_rover::operator+(fair_queue_ticket t) const noexcept {\n return fair_group_rover(_weight + t._weight, _size + t._size);\n}\n\nfair_group_rover& fair_group_rover::operator+=(fair_queue_ticket t) noexcept {\n _weight += t._weight;\n _size += t._size;\n return *this;\n}\n\nstd::ostream& operator<<(std::ostream& os, fair_group_rover r) {\n return os << r._weight << \":\" << r._size;\n}\n\nfair_group::fair_group(config cfg) noexcept\n : _capacity_tail(fair_group_rover(0, 0))\n , _capacity_head(fair_group_rover(cfg.max_req_count, cfg.max_bytes_count))\n , _maximum_capacity(cfg.max_req_count, cfg.max_bytes_count)\n{\n assert(!_capacity_tail.load(std::memory_order_relaxed)\n .maybe_ahead_of(_capacity_head.load(std::memory_order_relaxed)));\n seastar_logger.debug(\"Created fair group, capacity {}:{}\", cfg.max_req_count, cfg.max_bytes_count);\n}\n\nfair_group_rover fair_group::grab_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover cur = _capacity_tail.load(std::memory_order_relaxed);\n while (!_capacity_tail.compare_exchange_weak(cur, cur + cap)) ;\n return cur;\n}\n\nvoid fair_group::release_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover cur = _capacity_head.load(std::memory_order_relaxed);\n while (!_capacity_head.compare_exchange_weak(cur, cur + cap)) ;\n}\n\nfair_queue::fair_queue(fair_group& group, config cfg)\n : _config(std::move(cfg))\n , _group(group)\n , _base(std::chrono::steady_clock::now())\n{\n seastar_logger.debug(\"Created fair queue, ticket pace {}:{}\", cfg.ticket_weight_pace, cfg.ticket_size_pace);\n}\n\nvoid fair_queue::push_priority_class(priority_class_ptr pc) {\n if (!pc->_queued) {\n _handles.push(pc);\n pc->_queued = true;\n }\n}\n\npriority_class_ptr fair_queue::peek_priority_class() {\n assert(!_handles.empty());\n return _handles.top();\n}\n\nvoid fair_queue::pop_priority_class(priority_class_ptr pc) {\n assert(pc->_queued);\n pc->_queued = false;\n _handles.pop();\n}\n\npriority_class::accumulator_t fair_queue::normalize_factor() const {\n return std::numeric_limits<priority_class::accumulator_t>::min();\n}\n\nvoid fair_queue::normalize_stats() {\n auto time_delta = std::log(normalize_factor()) * _config.tau;\n \/\/ time_delta is negative; and this may advance _base into the future\n _base -= std::chrono::duration_cast<clock_type::duration>(time_delta);\n for (auto& pc: _all_classes) {\n pc->_accumulated *= normalize_factor();\n }\n}\n\nstd::chrono::microseconds fair_queue_ticket::duration_at_pace(float weight_pace, float size_pace) const noexcept {\n unsigned long dur = ((_weight * weight_pace) + (_size * size_pace));\n return std::chrono::microseconds(dur);\n}\n\nbool fair_queue::grab_pending_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover pending_head = _pending->orig_tail + cap;\n if (pending_head.maybe_ahead_of(_group.head())) {\n return false;\n }\n\n if (cap == _pending->cap) {\n _pending.reset();\n } else {\n \/*\n * This branch is called when the fair queue decides to\n * submit not the same request that entered it into the\n * pending state and this new request crawls through the\n * expected head value.\n *\/\n _group.grab_capacity(cap);\n _pending->orig_tail += cap;\n }\n\n return true;\n}\n\nbool fair_queue::grab_capacity(fair_queue_ticket cap) noexcept {\n if (_pending) {\n return grab_pending_capacity(cap);\n }\n\n fair_group_rover orig_tail = _group.grab_capacity(cap);\n if ((orig_tail + cap).maybe_ahead_of(_group.head())) {\n _pending.emplace(orig_tail, cap);\n return false;\n }\n\n return true;\n}\n\npriority_class_ptr fair_queue::register_priority_class(uint32_t shares) {\n priority_class_ptr pclass = make_lw_shared<priority_class>(shares);\n _all_classes.insert(pclass);\n return pclass;\n}\n\nvoid fair_queue::unregister_priority_class(priority_class_ptr pclass) {\n assert(pclass->_queue.empty());\n _all_classes.erase(pclass);\n}\n\nsize_t fair_queue::waiters() const {\n return _requests_queued;\n}\n\nsize_t fair_queue::requests_currently_executing() const {\n return _requests_executing;\n}\n\nfair_queue_ticket fair_queue::resources_currently_waiting() const {\n return _resources_queued;\n}\n\nfair_queue_ticket fair_queue::resources_currently_executing() const {\n return _resources_executing;\n}\n\nvoid fair_queue::queue(priority_class_ptr pc, fair_queue_entry& ent) {\n \/\/ We need to return a future in this function on which the caller can wait.\n \/\/ Since we don't know which queue we will use to execute the next request - if ours or\n \/\/ someone else's, we need a separate promise at this point.\n push_priority_class(pc);\n pc->_queue.push_back(ent);\n _resources_queued += ent._ticket;\n _requests_queued++;\n}\n\nvoid fair_queue::notify_requests_finished(fair_queue_ticket desc, unsigned nr) noexcept {\n _resources_executing -= desc;\n _requests_executing -= nr;\n _group.release_capacity(desc);\n}\n\nvoid fair_queue::notify_request_cancelled(fair_queue_entry& ent) noexcept {\n _resources_queued -= ent._ticket;\n ent._ticket = fair_queue_ticket();\n}\n\nvoid fair_queue::dispatch_requests(std::function<void(fair_queue_entry&)> cb) {\n while (_requests_queued) {\n priority_class_ptr h;\n\n while (true) {\n h = peek_priority_class();\n if (!h->_queue.empty()) {\n break;\n }\n pop_priority_class(h);\n }\n\n auto& req = h->_queue.front();\n if (!grab_capacity(req._ticket)) {\n break;\n }\n\n pop_priority_class(h);\n h->_queue.pop_front();\n\n _resources_executing += req._ticket;\n _resources_queued -= req._ticket;\n _requests_executing++;\n _requests_queued--;\n\n auto delta = std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::steady_clock::now() - _base);\n auto req_cost = req._ticket.normalize(_group.maximum_capacity()) \/ h->_shares;\n auto cost = exp(priority_class::accumulator_t(1.0f\/_config.tau.count() * delta.count())) * req_cost;\n priority_class::accumulator_t next_accumulated = h->_accumulated + cost;\n while (std::isinf(next_accumulated)) {\n normalize_stats();\n \/\/ If we have renormalized, our time base will have changed. This should happen very infrequently\n delta = std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::steady_clock::now() - _base);\n cost = exp(priority_class::accumulator_t(1.0f\/_config.tau.count() * delta.count())) * req_cost;\n next_accumulated = h->_accumulated + cost;\n }\n h->_accumulated = next_accumulated;\n\n if (!h->_queue.empty()) {\n push_priority_class(h);\n }\n\n cb(req);\n }\n}\n\n}\n<commit_msg>fair_queue: Simplify base re-evaluation<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright 2019 ScyllaDB\n *\/\n\n#include <boost\/intrusive\/parent_from_member.hpp>\n#include <seastar\/core\/fair_queue.hh>\n#include <seastar\/core\/future.hh>\n#include <seastar\/core\/shared_ptr.hh>\n#include <seastar\/core\/circular_buffer.hh>\n#include <seastar\/util\/noncopyable_function.hh>\n#include <seastar\/core\/reactor.hh>\n#include <queue>\n#include <chrono>\n#include <unordered_set>\n#include <cmath>\n\n#include \"fmt\/format.h\"\n#include \"fmt\/ostream.h\"\n\nnamespace seastar {\n\nstatic_assert(sizeof(fair_queue_ticket) == sizeof(uint64_t), \"unexpected fair_queue_ticket size\");\nstatic_assert(sizeof(fair_queue_entry) <= 3 * sizeof(void*), \"unexpected fair_queue_entry::_hook size\");\nstatic_assert(sizeof(fair_queue_entry::container_list_t) == 2 * sizeof(void*), \"unexpected priority_class::_queue size\");\n\nfair_queue_ticket::fair_queue_ticket(uint32_t weight, uint32_t size) noexcept\n : _weight(weight)\n , _size(size)\n{}\n\nfloat fair_queue_ticket::normalize(fair_queue_ticket denominator) const noexcept {\n return float(_weight) \/ denominator._weight + float(_size) \/ denominator._size;\n}\n\nfair_queue_ticket fair_queue_ticket::operator+(fair_queue_ticket desc) const noexcept {\n return fair_queue_ticket(_weight + desc._weight, _size + desc._size);\n}\n\nfair_queue_ticket& fair_queue_ticket::operator+=(fair_queue_ticket desc) noexcept {\n _weight += desc._weight;\n _size += desc._size;\n return *this;\n}\n\nfair_queue_ticket fair_queue_ticket::operator-(fair_queue_ticket desc) const noexcept {\n return fair_queue_ticket(_weight - desc._weight, _size - desc._size);\n}\n\nfair_queue_ticket& fair_queue_ticket::operator-=(fair_queue_ticket desc) noexcept {\n _weight -= desc._weight;\n _size -= desc._size;\n return *this;\n}\n\nfair_queue_ticket::operator bool() const noexcept {\n return (_weight > 0) || (_size > 0);\n}\n\nbool fair_queue_ticket::operator==(const fair_queue_ticket& o) const noexcept {\n return _weight == o._weight && _size == o._size;\n}\n\nstd::ostream& operator<<(std::ostream& os, fair_queue_ticket t) {\n return os << t._weight << \":\" << t._size;\n}\n\nfair_group_rover::fair_group_rover(uint32_t weight, uint32_t size) noexcept\n : _weight(weight)\n , _size(size)\n{}\n\nfair_queue_ticket fair_group_rover::maybe_ahead_of(const fair_group_rover& other) const noexcept {\n return fair_queue_ticket(std::max<int32_t>(_weight - other._weight, 0),\n std::max<int32_t>(_size - other._size, 0));\n}\n\nfair_group_rover fair_group_rover::operator+(fair_queue_ticket t) const noexcept {\n return fair_group_rover(_weight + t._weight, _size + t._size);\n}\n\nfair_group_rover& fair_group_rover::operator+=(fair_queue_ticket t) noexcept {\n _weight += t._weight;\n _size += t._size;\n return *this;\n}\n\nstd::ostream& operator<<(std::ostream& os, fair_group_rover r) {\n return os << r._weight << \":\" << r._size;\n}\n\nfair_group::fair_group(config cfg) noexcept\n : _capacity_tail(fair_group_rover(0, 0))\n , _capacity_head(fair_group_rover(cfg.max_req_count, cfg.max_bytes_count))\n , _maximum_capacity(cfg.max_req_count, cfg.max_bytes_count)\n{\n assert(!_capacity_tail.load(std::memory_order_relaxed)\n .maybe_ahead_of(_capacity_head.load(std::memory_order_relaxed)));\n seastar_logger.debug(\"Created fair group, capacity {}:{}\", cfg.max_req_count, cfg.max_bytes_count);\n}\n\nfair_group_rover fair_group::grab_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover cur = _capacity_tail.load(std::memory_order_relaxed);\n while (!_capacity_tail.compare_exchange_weak(cur, cur + cap)) ;\n return cur;\n}\n\nvoid fair_group::release_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover cur = _capacity_head.load(std::memory_order_relaxed);\n while (!_capacity_head.compare_exchange_weak(cur, cur + cap)) ;\n}\n\nfair_queue::fair_queue(fair_group& group, config cfg)\n : _config(std::move(cfg))\n , _group(group)\n , _base(std::chrono::steady_clock::now())\n{\n seastar_logger.debug(\"Created fair queue, ticket pace {}:{}\", cfg.ticket_weight_pace, cfg.ticket_size_pace);\n}\n\nvoid fair_queue::push_priority_class(priority_class_ptr pc) {\n if (!pc->_queued) {\n _handles.push(pc);\n pc->_queued = true;\n }\n}\n\npriority_class_ptr fair_queue::peek_priority_class() {\n assert(!_handles.empty());\n return _handles.top();\n}\n\nvoid fair_queue::pop_priority_class(priority_class_ptr pc) {\n assert(pc->_queued);\n pc->_queued = false;\n _handles.pop();\n}\n\npriority_class::accumulator_t fair_queue::normalize_factor() const {\n return std::numeric_limits<priority_class::accumulator_t>::min();\n}\n\nvoid fair_queue::normalize_stats() {\n _base = std::chrono::steady_clock::now() - _config.tau;\n for (auto& pc: _all_classes) {\n pc->_accumulated *= normalize_factor();\n }\n}\n\nstd::chrono::microseconds fair_queue_ticket::duration_at_pace(float weight_pace, float size_pace) const noexcept {\n unsigned long dur = ((_weight * weight_pace) + (_size * size_pace));\n return std::chrono::microseconds(dur);\n}\n\nbool fair_queue::grab_pending_capacity(fair_queue_ticket cap) noexcept {\n fair_group_rover pending_head = _pending->orig_tail + cap;\n if (pending_head.maybe_ahead_of(_group.head())) {\n return false;\n }\n\n if (cap == _pending->cap) {\n _pending.reset();\n } else {\n \/*\n * This branch is called when the fair queue decides to\n * submit not the same request that entered it into the\n * pending state and this new request crawls through the\n * expected head value.\n *\/\n _group.grab_capacity(cap);\n _pending->orig_tail += cap;\n }\n\n return true;\n}\n\nbool fair_queue::grab_capacity(fair_queue_ticket cap) noexcept {\n if (_pending) {\n return grab_pending_capacity(cap);\n }\n\n fair_group_rover orig_tail = _group.grab_capacity(cap);\n if ((orig_tail + cap).maybe_ahead_of(_group.head())) {\n _pending.emplace(orig_tail, cap);\n return false;\n }\n\n return true;\n}\n\npriority_class_ptr fair_queue::register_priority_class(uint32_t shares) {\n priority_class_ptr pclass = make_lw_shared<priority_class>(shares);\n _all_classes.insert(pclass);\n return pclass;\n}\n\nvoid fair_queue::unregister_priority_class(priority_class_ptr pclass) {\n assert(pclass->_queue.empty());\n _all_classes.erase(pclass);\n}\n\nsize_t fair_queue::waiters() const {\n return _requests_queued;\n}\n\nsize_t fair_queue::requests_currently_executing() const {\n return _requests_executing;\n}\n\nfair_queue_ticket fair_queue::resources_currently_waiting() const {\n return _resources_queued;\n}\n\nfair_queue_ticket fair_queue::resources_currently_executing() const {\n return _resources_executing;\n}\n\nvoid fair_queue::queue(priority_class_ptr pc, fair_queue_entry& ent) {\n \/\/ We need to return a future in this function on which the caller can wait.\n \/\/ Since we don't know which queue we will use to execute the next request - if ours or\n \/\/ someone else's, we need a separate promise at this point.\n push_priority_class(pc);\n pc->_queue.push_back(ent);\n _resources_queued += ent._ticket;\n _requests_queued++;\n}\n\nvoid fair_queue::notify_requests_finished(fair_queue_ticket desc, unsigned nr) noexcept {\n _resources_executing -= desc;\n _requests_executing -= nr;\n _group.release_capacity(desc);\n}\n\nvoid fair_queue::notify_request_cancelled(fair_queue_entry& ent) noexcept {\n _resources_queued -= ent._ticket;\n ent._ticket = fair_queue_ticket();\n}\n\nvoid fair_queue::dispatch_requests(std::function<void(fair_queue_entry&)> cb) {\n while (_requests_queued) {\n priority_class_ptr h;\n\n while (true) {\n h = peek_priority_class();\n if (!h->_queue.empty()) {\n break;\n }\n pop_priority_class(h);\n }\n\n auto& req = h->_queue.front();\n if (!grab_capacity(req._ticket)) {\n break;\n }\n\n pop_priority_class(h);\n h->_queue.pop_front();\n\n _resources_executing += req._ticket;\n _resources_queued -= req._ticket;\n _requests_executing++;\n _requests_queued--;\n\n auto delta = std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::steady_clock::now() - _base);\n auto req_cost = req._ticket.normalize(_group.maximum_capacity()) \/ h->_shares;\n auto cost = exp(priority_class::accumulator_t(1.0f\/_config.tau.count() * delta.count())) * req_cost;\n priority_class::accumulator_t next_accumulated = h->_accumulated + cost;\n while (std::isinf(next_accumulated)) {\n normalize_stats();\n \/\/ If we have renormalized, our time base will have changed. This should happen very infrequently\n delta = std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::steady_clock::now() - _base);\n cost = exp(priority_class::accumulator_t(1.0f\/_config.tau.count() * delta.count())) * req_cost;\n next_accumulated = h->_accumulated + cost;\n }\n h->_accumulated = next_accumulated;\n\n if (!h->_queue.empty()) {\n push_priority_class(h);\n }\n\n cb(req);\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of Illarionserver.\n *\n * Illarionserver is free software: you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation, either version 3 of the License, or (at your option) any\n * later version.\n *\n * Illarionserver is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License along with\n * Illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"RaceTable.hpp\"\n\nauto RaceTable::getTableName() -> std::string { return \"race\"; }\n\nauto RaceTable::getColumnNames() -> std::vector<std::string> {\n return {\"race_id\",\n \"race_name\",\n \"race_height_min\",\n \"race_height_max\",\n \"race_agility_min\",\n \"race_agility_max\",\n \"race_constitution_min\",\n \"race_constitution_max\",\n \"race_dexterity_min\",\n \"race_dexterity_max\",\n \"race_essence_min\",\n \"race_essence_max\",\n \"race_intelligence_min\",\n \"race_intelligence_max\",\n \"race_perception_min\",\n \"race_perception_max\",\n \"race_strength_min\",\n \"race_strength_max\",\n \"race_willpower_min\",\n \"race_willpower_max\",\n \"race_attribute_points_max\"};\n}\n\nauto RaceTable::assignId(const Database::ResultTuple &row) -> TYPE_OF_ITEM_ID {\n return uint16_t(row[\"race_id\"].as<int32_t>());\n}\n\nauto RaceTable::assignTable(const Database::ResultTuple &row) -> RaceStruct {\n RaceStruct race;\n race.serverName = row[\"race_name\"].as<std::string>(\"unknown\");\n race.minSize = uint16_t(row[\"race_height_min\"].as<int32_t>(RaceStruct::defaultMinHeight));\n race.maxSize = uint16_t(row[\"race_height_max\"].as<int32_t>(RaceStruct::defaultMaxHeight));\n race.minAgility = uint8_t(row[\"race_agility_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxAgility = uint8_t(row[\"race_agility_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minConstitution = uint8_t(row[\"race_constitution_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxConstitution = uint8_t(row[\"race_constitution_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minDexterity = uint8_t(row[\"race_dexterity_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxDexterity = uint8_t(row[\"race_dexterity_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minEssence = uint8_t(row[\"race_essence_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxEssence = uint8_t(row[\"race_essence_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minIntelligence = uint8_t(row[\"race_intelligence_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxIntelligence = uint8_t(row[\"race_intelligence_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minPerception = uint8_t(row[\"race_perception_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxPerception = uint8_t(row[\"race_perception_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minStrength = uint8_t(row[\"race_strength_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxStrength = uint8_t(row[\"race_strength_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minWillpower = uint8_t(row[\"race_willpower_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxWillpower = uint8_t(row[\"race_willpower_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.maxAttribs = uint8_t(row[\"race_attribute_points_max\"].as<int16_t>(RaceStruct::defaultMaxAttributePoints));\n return race;\n}\n\nauto RaceTable::getRelativeSize(TYPE_OF_RACE_ID race, uint16_t size) const -> uint8_t {\n \/\/ relative size is between 40 and 120 (in percent) and a linear interpolation between min and max size\n constexpr auto defaultRelativeSize = 100;\n\n if (!exists(race)) {\n return defaultRelativeSize;\n }\n\n const auto &sizes = this->get(race);\n\n const auto minSize = sizes.minSize;\n\n const auto maxSize = sizes.maxSize;\n\n constexpr auto minRelativeSize = 80;\n constexpr auto maxRelativeSize = 120;\n\n if (size < minSize) {\n return minRelativeSize;\n }\n\n if (size > maxSize) {\n return maxRelativeSize;\n }\n\n return uint8_t(((maxRelativeSize - minRelativeSize) * (size - minSize)) \/ (maxSize - minSize) + minRelativeSize);\n}\n\nauto RaceTable::isBaseAttributeInLimits(TYPE_OF_RACE_ID race, Character::attributeIndex attribute,\n Attribute::attribute_t value) const -> bool {\n if (!exists(race)) {\n return false;\n }\n\n const auto &attributes = this->get(race);\n\n switch (attribute) {\n case Character::agility:\n return value >= attributes.minAgility && value <= attributes.maxAgility;\n\n case Character::constitution:\n return value >= attributes.minConstitution && value <= attributes.maxConstitution;\n\n case Character::dexterity:\n return value >= attributes.minDexterity && value <= attributes.maxDexterity;\n\n case Character::essence:\n return value >= attributes.minEssence && value <= attributes.maxEssence;\n\n case Character::intelligence:\n return value >= attributes.minIntelligence && value <= attributes.maxIntelligence;\n\n case Character::perception:\n return value >= attributes.minPerception && value <= attributes.maxPerception;\n\n case Character::strength:\n return value >= attributes.minStrength && value <= attributes.maxStrength;\n\n case Character::willpower:\n return value >= attributes.minWillpower && value <= attributes.maxWillpower;\n\n default:\n return false;\n }\n}\n\nauto RaceTable::getMaxAttributePoints(TYPE_OF_RACE_ID race) const -> uint8_t {\n if (!exists(race)) {\n return 0;\n }\n\n const auto &attributes = this->get(race);\n return attributes.maxAttribs;\n}\n<commit_msg>Use default character height, if a character's height is not set<commit_after>\/*\n * Illarionserver - server for the game Illarion\n * Copyright 2011 Illarion e.V.\n *\n * This file is part of Illarionserver.\n *\n * Illarionserver is free software: you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation, either version 3 of the License, or (at your option) any\n * later version.\n *\n * Illarionserver is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more\n * details.\n *\n * You should have received a copy of the GNU Affero General Public License along with\n * Illarionserver. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"RaceTable.hpp\"\n\nauto RaceTable::getTableName() -> std::string { return \"race\"; }\n\nauto RaceTable::getColumnNames() -> std::vector<std::string> {\n return {\"race_id\",\n \"race_name\",\n \"race_height_min\",\n \"race_height_max\",\n \"race_agility_min\",\n \"race_agility_max\",\n \"race_constitution_min\",\n \"race_constitution_max\",\n \"race_dexterity_min\",\n \"race_dexterity_max\",\n \"race_essence_min\",\n \"race_essence_max\",\n \"race_intelligence_min\",\n \"race_intelligence_max\",\n \"race_perception_min\",\n \"race_perception_max\",\n \"race_strength_min\",\n \"race_strength_max\",\n \"race_willpower_min\",\n \"race_willpower_max\",\n \"race_attribute_points_max\"};\n}\n\nauto RaceTable::assignId(const Database::ResultTuple &row) -> TYPE_OF_ITEM_ID {\n return uint16_t(row[\"race_id\"].as<int32_t>());\n}\n\nauto RaceTable::assignTable(const Database::ResultTuple &row) -> RaceStruct {\n RaceStruct race;\n race.serverName = row[\"race_name\"].as<std::string>(\"unknown\");\n race.minSize = uint16_t(row[\"race_height_min\"].as<int32_t>(RaceStruct::defaultMinHeight));\n race.maxSize = uint16_t(row[\"race_height_max\"].as<int32_t>(RaceStruct::defaultMaxHeight));\n race.minAgility = uint8_t(row[\"race_agility_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxAgility = uint8_t(row[\"race_agility_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minConstitution = uint8_t(row[\"race_constitution_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxConstitution = uint8_t(row[\"race_constitution_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minDexterity = uint8_t(row[\"race_dexterity_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxDexterity = uint8_t(row[\"race_dexterity_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minEssence = uint8_t(row[\"race_essence_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxEssence = uint8_t(row[\"race_essence_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minIntelligence = uint8_t(row[\"race_intelligence_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxIntelligence = uint8_t(row[\"race_intelligence_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minPerception = uint8_t(row[\"race_perception_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxPerception = uint8_t(row[\"race_perception_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minStrength = uint8_t(row[\"race_strength_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxStrength = uint8_t(row[\"race_strength_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.minWillpower = uint8_t(row[\"race_willpower_min\"].as<int32_t>(RaceStruct::defaultMinAttribute));\n race.maxWillpower = uint8_t(row[\"race_willpower_max\"].as<int32_t>(RaceStruct::defaultMaxAttribute));\n race.maxAttribs = uint8_t(row[\"race_attribute_points_max\"].as<int16_t>(RaceStruct::defaultMaxAttributePoints));\n return race;\n}\n\nauto RaceTable::getRelativeSize(TYPE_OF_RACE_ID race, uint16_t size) const -> uint8_t {\n \/\/ relative size is between 40 and 120 (in percent) and a linear interpolation between min and max size\n constexpr auto defaultRelativeSize = 100;\n\n if (size == 0) {\n \/\/ size not set\n return defaultRelativeSize;\n }\n\n if (!exists(race)) {\n return defaultRelativeSize;\n }\n\n const auto &sizes = this->get(race);\n\n const auto minSize = sizes.minSize;\n\n const auto maxSize = sizes.maxSize;\n\n constexpr auto minRelativeSize = 80;\n constexpr auto maxRelativeSize = 120;\n\n if (size < minSize) {\n return minRelativeSize;\n }\n\n if (size > maxSize) {\n return maxRelativeSize;\n }\n\n return uint8_t(((maxRelativeSize - minRelativeSize) * (size - minSize)) \/ (maxSize - minSize) + minRelativeSize);\n}\n\nauto RaceTable::isBaseAttributeInLimits(TYPE_OF_RACE_ID race, Character::attributeIndex attribute,\n Attribute::attribute_t value) const -> bool {\n if (!exists(race)) {\n return false;\n }\n\n const auto &attributes = this->get(race);\n\n switch (attribute) {\n case Character::agility:\n return value >= attributes.minAgility && value <= attributes.maxAgility;\n\n case Character::constitution:\n return value >= attributes.minConstitution && value <= attributes.maxConstitution;\n\n case Character::dexterity:\n return value >= attributes.minDexterity && value <= attributes.maxDexterity;\n\n case Character::essence:\n return value >= attributes.minEssence && value <= attributes.maxEssence;\n\n case Character::intelligence:\n return value >= attributes.minIntelligence && value <= attributes.maxIntelligence;\n\n case Character::perception:\n return value >= attributes.minPerception && value <= attributes.maxPerception;\n\n case Character::strength:\n return value >= attributes.minStrength && value <= attributes.maxStrength;\n\n case Character::willpower:\n return value >= attributes.minWillpower && value <= attributes.maxWillpower;\n\n default:\n return false;\n }\n}\n\nauto RaceTable::getMaxAttributePoints(TYPE_OF_RACE_ID race) const -> uint8_t {\n if (!exists(race)) {\n return 0;\n }\n\n const auto &attributes = this->get(race);\n return attributes.maxAttribs;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef SERVER_RESPONSE_HPP\n#define SERVER_RESPONSE_HPP\n\n#include \"http\/inc\/response.hpp\"\n#include \"http\/inc\/mime_types.hpp\"\n#include \"cookie.hpp\"\n#include <fs\/filesystem.hpp>\n#include <net\/tcp\/connection.hpp>\n#include <utility\/async.hpp>\n\n#include <string>\n#include <vector>\n#include <time.h>\n#include <chrono>\n\nusing namespace cookie;\n\nstruct File {\n\n File(fs::Disk_ptr dptr, const fs::Dirent& ent)\n : disk(dptr)\n {\n assert(ent.is_file());\n entry = ent;\n }\n\n fs::Dirent entry;\n fs::Disk_ptr disk;\n};\n\nnamespace server {\n\nclass Response;\nusing Response_ptr = std::shared_ptr<Response>;\n\nclass Response : public http::Response {\nprivate:\n using Code = http::status_t;\n using Connection_ptr = net::tcp::Connection_ptr;\n using OnSent = std::function<void(size_t)>;\n\npublic:\n\n struct Error {\n Code code;\n std::string type;\n std::string message;\n\n Error() : code{http::Bad_Request} {}\n\n Error(std::string&& type, std::string&& msg)\n : code{http::Bad_Request}, type{type}, message{msg}\n {}\n\n Error(const Code code, std::string&& type, std::string&& msg)\n : code{code}, type{type}, message{msg}\n {}\n\n \/\/ TODO: NotLikeThis\n std::string json() const {\n return \"{ \\\"type\\\" : \\\"\" + type + \"\\\", \\\"message\\\" : \\\"\" + message + \"\\\" }\";\n }\n };\n\n Response(Connection_ptr conn);\n\n \/*\n Send only status code\n *\/\n void send_code(const Code, bool close = true);\n\n \/*\n Send the Response\n *\/\n void send(bool close = false);\n\n \/*\n Send a file\n *\/\n void send_file(const File&);\n\n void send_json(const std::string&);\n\n \/* Cookie-support start *\/\n\n void cookie(const Cookie& c);\n\n void cookie(const std::string& name, const std::string& value);\n\n void cookie(const std::string& name, const std::string& value, const std::vector<std::string>& options);\n\n void update_cookie(const std::string& name, const std::string& old_path, const std::string& old_domain,\n const std::string& new_value);\n\n void update_cookie(const std::string& name, const std::string& old_path, const std::string& old_domain,\n const std::string& new_value, const std::vector<std::string>& new_options);\n\n void clear_cookie(const std::string& name, const std::string& path, const std::string& domain);\n\n \/* Cookie-support end *\/\n\n \/**\n * @brief Send an error response\n * @details Sends an error response together with the given status code.\n *\n * @param e Response::Error\n *\/\n void error(Error&&);\n\n \/*\n \"End\" the response\n *\/\n void end() const;\n\n static void on_sent(OnSent cb)\n { on_sent_ = cb; }\n\n ~Response();\n\nprivate:\n Connection_ptr conn_;\n\n static OnSent on_sent_;\n\n bool keep_alive = true;\n\n void write_to_conn(bool close_on_written = false);\n\n}; \/\/ server::Response\n\n\n} \/\/ < server\n\n#endif\n<commit_msg>Response: Refactored utility to util in IncludeOS<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef SERVER_RESPONSE_HPP\n#define SERVER_RESPONSE_HPP\n\n#include \"http\/inc\/response.hpp\"\n#include \"http\/inc\/mime_types.hpp\"\n#include \"cookie.hpp\"\n#include <fs\/filesystem.hpp>\n#include <net\/tcp\/connection.hpp>\n#include <util\/async.hpp>\n\n#include <string>\n#include <vector>\n#include <time.h>\n#include <chrono>\n\nusing namespace cookie;\n\nstruct File {\n\n File(fs::Disk_ptr dptr, const fs::Dirent& ent)\n : disk(dptr)\n {\n assert(ent.is_file());\n entry = ent;\n }\n\n fs::Dirent entry;\n fs::Disk_ptr disk;\n};\n\nnamespace server {\n\nclass Response;\nusing Response_ptr = std::shared_ptr<Response>;\n\nclass Response : public http::Response {\nprivate:\n using Code = http::status_t;\n using Connection_ptr = net::tcp::Connection_ptr;\n using OnSent = std::function<void(size_t)>;\n\npublic:\n\n struct Error {\n Code code;\n std::string type;\n std::string message;\n\n Error() : code{http::Bad_Request} {}\n\n Error(std::string&& type, std::string&& msg)\n : code{http::Bad_Request}, type{type}, message{msg}\n {}\n\n Error(const Code code, std::string&& type, std::string&& msg)\n : code{code}, type{type}, message{msg}\n {}\n\n \/\/ TODO: NotLikeThis\n std::string json() const {\n return \"{ \\\"type\\\" : \\\"\" + type + \"\\\", \\\"message\\\" : \\\"\" + message + \"\\\" }\";\n }\n };\n\n Response(Connection_ptr conn);\n\n \/*\n Send only status code\n *\/\n void send_code(const Code, bool close = true);\n\n \/*\n Send the Response\n *\/\n void send(bool close = false);\n\n \/*\n Send a file\n *\/\n void send_file(const File&);\n\n void send_json(const std::string&);\n\n \/* Cookie-support start *\/\n\n void cookie(const Cookie& c);\n\n void cookie(const std::string& name, const std::string& value);\n\n void cookie(const std::string& name, const std::string& value, const std::vector<std::string>& options);\n\n void update_cookie(const std::string& name, const std::string& old_path, const std::string& old_domain,\n const std::string& new_value);\n\n void update_cookie(const std::string& name, const std::string& old_path, const std::string& old_domain,\n const std::string& new_value, const std::vector<std::string>& new_options);\n\n void clear_cookie(const std::string& name, const std::string& path, const std::string& domain);\n\n \/* Cookie-support end *\/\n\n \/**\n * @brief Send an error response\n * @details Sends an error response together with the given status code.\n *\n * @param e Response::Error\n *\/\n void error(Error&&);\n\n \/*\n \"End\" the response\n *\/\n void end() const;\n\n static void on_sent(OnSent cb)\n { on_sent_ = cb; }\n\n ~Response();\n\nprivate:\n Connection_ptr conn_;\n\n static OnSent on_sent_;\n\n bool keep_alive = true;\n\n void write_to_conn(bool close_on_written = false);\n\n}; \/\/ server::Response\n\n\n} \/\/ < server\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n#include <string>\n\n#include \"lukki-db-application.h\"\n#include \"vtrc-common\/vtrc-thread-pool.h\"\n#include \"vtrc-common\/vtrc-rpc-service-wrapper.h\"\n#include \"vtrc-common\/vtrc-connection-iface.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n\n#include \"vtrc-common\/vtrc-rpc-channel.h\"\n\n#include \"vtrc-server\/vtrc-channels.h\"\n\n#include \"protocol\/lukkidb.pb.h\"\n\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"vtrc-bind.h\"\n#include \"vtrc-ref.h\"\n\n#include \"boost\/asio.hpp\"\n\nnamespace lukki_db {\n\n using namespace vtrc;\n\n namespace {\n\n typedef std::map<std::string, vtrc_example::lukki_string_list> db_type;\n\n class lukki_db_impl: public vtrc_example::lukki_db {\n\n typedef lukki_db_impl this_type;\n\n application &app_;\n common::connection_iface *connection_;\n\n public:\n\n lukki_db_impl( application &app, common::connection_iface *c)\n :app_(app)\n ,connection_(c)\n { }\n\n private:\n\n static void yks_closure( bool success, const std::string &mess,\n ::google::protobuf::RpcController* controller,\n vtrc::shared_ptr<common::closure_holder> holder)\n {\n if( !success ) {\n controller->SetFailed( mess );\n }\n }\n\n void init(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::empty* \/*request*\/,\n ::vtrc_example::empty* \/*response*\/,\n ::google::protobuf::Closure* done)\n {\n done->Run( );\n }\n\n void set(::google::protobuf::RpcController* controller,\n const ::vtrc_example::value_set_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n app_.set( request->name( ), request->value( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n }\n\n void upd(::google::protobuf::RpcController* controller,\n const ::vtrc_example::value_set_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n app_.upd( request->name( ), request->value( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n }\n\n void del(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n app_.del( request->name( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n\n }\n\n template <typename ResType>\n static void mess_closure( bool success, const std::string &mess,\n vtrc::shared_ptr<ResType> res, ResType* response,\n ::google::protobuf::RpcController* controller,\n vtrc::shared_ptr<common::closure_holder> holder )\n {\n if( !success ) {\n controller->SetFailed( mess );\n } else {\n response->Swap( res.get( ) );\n }\n }\n\n void get(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::lukki_string_list* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::lukki_string_list res_type;\n\n vtrc::shared_ptr<res_type> res(new res_type);\n\n app_.get( request->name( ), res,\n vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder) );\n }\n\n void stat(::google::protobuf::RpcController* controller,\n const ::vtrc_example::empty* request,\n ::vtrc_example::db_stat* response,\n ::google::protobuf::Closure* done)\n {\n\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::db_stat res_type;\n\n vtrc::shared_ptr<res_type> res(new res_type);\n app_.stat( res, vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder) );\n }\n\n void exist(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::exist_res* response,\n ::google::protobuf::Closure* done )\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::exist_res res_type;\n vtrc::shared_ptr<res_type> res (new res_type);\n app_.exist( request->name( ), res,\n vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder ));\n\n }\n void subscribe(::google::protobuf::RpcController* controller,\n const ::vtrc_example::empty* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n common::closure_holder holder(done);\n app_.subscribe_client( connection_ );\n }\n };\n }\n\n struct application::impl {\n\n enum { RECORD_DELETED, RECORD_ADDED, RECORD_CHANGED };\n\n common::thread_pool db_thread_;\n db_type db_;\n vtrc_example::db_stat db_stat_;\n boost::asio::io_service::strand event_queue_;\n\n std::vector<server::listener_sptr> listeners_;\n\n typedef vtrc::shared_ptr<common::rpc_channel> channel_sptr;\n typedef std::pair<\n common::connection_iface_wptr, channel_sptr\n > connection_channel_pair;\n\n typedef std::list<connection_channel_pair> subscriber_list_type;\n\n subscriber_list_type subscribers_;\n\n impl( boost::asio::io_service &rpc_service )\n :db_thread_(1)\n ,event_queue_(rpc_service)\n { }\n\n void on_new_connection( server::listener_sptr l,\n const common::connection_iface *c )\n {\n std::cout << \"New connection: \"\n << \"\\n\\tep: \" << l->name( )\n << \"\\n\\tclient: \" << c->name( )\n << \"\\n\"\n ;\n }\n\n void on_stop_connection( server::listener_sptr l,\n const common::connection_iface *c )\n {\n std::cout << \"Close connection: \"\n << c->name( ) << \"\\n\";\n }\n\n void set( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n if( db_.find( name ) != db_.end( ) ) {\n if( closure ) closure( false, \"Record already exists\" );\n } else {\n db_stat_.set_set_requests( db_stat_.set_requests( ) + 1 );\n db_[name] = value;\n db_stat_.set_total_records( db_.size( ) );\n send_event( name , RECORD_ADDED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void upd( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n db_stat_.set_upd_requests( db_stat_.upd_requests( ) + 1 );\n db_type::iterator f( db_.find( name ));\n\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n f->second.CopyFrom( value );\n send_event( name , RECORD_CHANGED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void get( const std::string &name,\n vtrc::shared_ptr<vtrc_example::lukki_string_list> value,\n const operation_closure &closure)\n {\n db_stat_.set_get_requests( db_stat_.get_requests( ) + 1 );\n db_type::const_iterator f( db_.find( name ));\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n value->CopyFrom( f->second );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void del( const std::string &name,\n const operation_closure &closure)\n {\n db_stat_.set_del_requests( db_stat_.del_requests( ) + 1 );\n db_type::iterator f( db_.find( name ));\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n db_.erase( f );\n send_event( name , RECORD_DELETED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void stat( vtrc::shared_ptr<vtrc_example::db_stat> stat,\n const operation_closure &closure)\n {\n stat->CopyFrom( db_stat_ );\n if( closure ) closure( true, \"Success\" );\n }\n\n void exist( const std::string &name,\n vtrc::shared_ptr<vtrc_example::exist_res> res,\n const operation_closure &closure)\n {\n res->set_value( db_.find( name ) != db_.end( ) );\n if( closure ) closure( true, \"Success\" );\n }\n\n \/\/\/ events\n void send_event( const std::string &record, unsigned changed )\n {\n event_queue_.post( vtrc::bind( &impl::send_event_impl, this,\n record, changed ) );\n }\n\n void send_event( vtrc::shared_ptr<common::rpc_channel> channel,\n const std::string &record, unsigned changed)\n {\n try {\n\n vtrc_example::lukki_events_Stub s(channel.get( ));\n vtrc_example::name_req req;\n\n req.set_name( record );\n switch (changed) {\n case RECORD_DELETED:\n s.value_removed( NULL, &req, NULL, NULL );\n break;\n case RECORD_CHANGED:\n s.value_changed( NULL, &req, NULL, NULL );\n break;\n case RECORD_ADDED:\n s.new_value( NULL, &req, NULL, NULL );\n break;\n default:\n break;\n }\n } catch( ... ) {\n ;;;\n }\n }\n\n void send_event_impl( const std::string &record, unsigned changed )\n {\n subscriber_list_type::iterator b(subscribers_.begin( ));\n while( b != subscribers_.end( ) ) {\n common::connection_iface_sptr lck(b->first.lock( ));\n if( lck ) {\n send_event( b->second, record, changed );\n ++b;\n } else {\n b = subscribers_.erase( b );\n }\n }\n }\n\n void send_subscribed( common::rpc_channel &channel )\n {\n try {\n vtrc_example::lukki_events_Stub s(&channel);\n vtrc_example::empty r;\n s.subscribed( NULL, &r, &r, NULL );\n } catch( ... ) {\n ;;;\n }\n }\n\n void subscribe_impl( common::connection_iface_wptr conn )\n {\n common::connection_iface_sptr lck(conn.lock( ));\n if( lck ) {\n vtrc::shared_ptr<common::rpc_channel> channel\n (server::channels::unicast::create_event_channel\n ( lck, true ));\n subscribers_.push_back( std::make_pair(conn, channel) );\n send_subscribed( *channel );\n }\n }\n\n void subscribe_client( vtrc::common::connection_iface* conn )\n {\n event_queue_.post( vtrc::bind(&impl::subscribe_impl, this,\n conn->weak_from_this( ) ));\n }\n\n };\n\n application::application( vtrc::common::pool_pair &pp )\n :vtrc::server::application(pp)\n ,impl_(new impl(pp.get_rpc_service( )))\n {\n\n }\n\n application::~application( )\n {\n delete impl_;\n }\n\n vtrc::shared_ptr<common::rpc_service_wrapper>\n application::get_service_by_name( vtrc::common::connection_iface* conn,\n const std::string &service_name )\n {\n if( service_name == lukki_db_impl::descriptor( )->full_name( ) ) {\n return vtrc::make_shared<common::rpc_service_wrapper>\n ( new lukki_db_impl( *this, conn ) );\n }\n return vtrc::shared_ptr<common::rpc_service_wrapper>( );\n }\n\n void application::attach_start_listener( server::listener_sptr listen )\n {\n listen->get_on_new_connection( ).connect(\n vtrc::bind( &impl::on_new_connection, impl_, listen, _1 ));\n\n listen->get_on_stop_connection( ).connect(\n vtrc::bind( &impl::on_stop_connection, impl_, listen, _1 ));\n\n listen->start( );\n impl_->listeners_.push_back( listen );\n }\n\n void application::set( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::set, impl_,name, value, closure));\n }\n\n void application::upd( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::upd, impl_,name, value, closure));\n }\n\n void application::get( const std::string &name,\n vtrc::shared_ptr<vtrc_example::lukki_string_list> value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::get, impl_, name,\n value, closure));\n }\n\n void application::del( const std::string &name,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::del, impl_, name, closure));\n }\n\n void application::stat(vtrc::shared_ptr<vtrc_example::db_stat> stat,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::stat, impl_, stat, closure));\n }\n\n void application::exist( const std::string &name,\n vtrc::shared_ptr<vtrc_example::exist_res> res,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::exist, impl_, name, res, closure));\n }\n\n void application::subscribe_client( vtrc::common::connection_iface* conn )\n {\n impl_->subscribe_client( conn );\n }\n\n}\n\n<commit_msg>examples<commit_after>#include <map>\n#include <string>\n\n#include \"lukki-db-application.h\"\n#include \"vtrc-common\/vtrc-thread-pool.h\"\n#include \"vtrc-common\/vtrc-rpc-service-wrapper.h\"\n#include \"vtrc-common\/vtrc-connection-iface.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n\n#include \"vtrc-common\/vtrc-rpc-channel.h\"\n\n#include \"vtrc-server\/vtrc-channels.h\"\n\n#include \"protocol\/lukkidb.pb.h\"\n\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"vtrc-bind.h\"\n#include \"vtrc-ref.h\"\n\n#include \"boost\/asio.hpp\"\n\nnamespace lukki_db {\n\n using namespace vtrc;\n\n namespace {\n\n typedef std::map<std::string, vtrc_example::lukki_string_list> db_type;\n\n class lukki_db_impl: public vtrc_example::lukki_db {\n\n typedef lukki_db_impl this_type;\n\n application &app_;\n common::connection_iface *connection_;\n\n public:\n\n lukki_db_impl( application &app, common::connection_iface *c)\n :app_(app)\n ,connection_(c)\n { }\n\n private:\n\n static void yks_closure( bool success, const std::string &mess,\n ::google::protobuf::RpcController* controller,\n vtrc::shared_ptr<common::closure_holder> holder)\n {\n if( !success ) {\n controller->SetFailed( mess );\n }\n }\n\n void init(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::empty* \/*request*\/,\n ::vtrc_example::empty* \/*response*\/,\n ::google::protobuf::Closure* done)\n {\n done->Run( );\n }\n\n void set(::google::protobuf::RpcController* controller,\n const ::vtrc_example::value_set_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n app_.set( request->name( ), request->value( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n }\n\n void upd(::google::protobuf::RpcController* controller,\n const ::vtrc_example::value_set_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n app_.upd( request->name( ), request->value( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n }\n\n void del(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n app_.del( request->name( ),\n vtrc::bind( &this_type::yks_closure,\n _1, _2, controller, holder) );\n\n }\n\n template <typename ResType>\n static void mess_closure( bool success, const std::string &mess,\n vtrc::shared_ptr<ResType> res, ResType* response,\n ::google::protobuf::RpcController* controller,\n vtrc::shared_ptr<common::closure_holder> holder )\n {\n if( !success ) {\n controller->SetFailed( mess );\n } else {\n response->Swap( res.get( ) );\n }\n }\n\n void get(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::lukki_string_list* response,\n ::google::protobuf::Closure* done)\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::lukki_string_list res_type;\n\n vtrc::shared_ptr<res_type> res(new res_type);\n\n app_.get( request->name( ), res,\n vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder) );\n }\n\n void stat(::google::protobuf::RpcController* controller,\n const ::vtrc_example::empty* request,\n ::vtrc_example::db_stat* response,\n ::google::protobuf::Closure* done)\n {\n\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::db_stat res_type;\n\n vtrc::shared_ptr<res_type> res(new res_type);\n app_.stat( res, vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder) );\n }\n\n void exist(::google::protobuf::RpcController* controller,\n const ::vtrc_example::name_req* request,\n ::vtrc_example::exist_res* response,\n ::google::protobuf::Closure* done )\n {\n vtrc::shared_ptr<common::closure_holder> holder(\n common::closure_holder::create(done) );\n\n typedef vtrc_example::exist_res res_type;\n vtrc::shared_ptr<res_type> res (new res_type);\n app_.exist( request->name( ), res,\n vtrc::bind( &this_type::mess_closure<res_type>,\n _1, _2,\n res, response, controller, holder ));\n\n }\n void subscribe(::google::protobuf::RpcController* controller,\n const ::vtrc_example::empty* request,\n ::vtrc_example::empty* response,\n ::google::protobuf::Closure* done)\n {\n common::closure_holder holder(done);\n app_.subscribe_client( connection_ );\n }\n };\n }\n\n struct application::impl {\n\n enum { RECORD_DELETED, RECORD_ADDED, RECORD_CHANGED };\n\n common::thread_pool db_thread_;\n db_type db_;\n vtrc_example::db_stat db_stat_;\n boost::asio::io_service::strand event_queue_;\n\n std::vector<server::listener_sptr> listeners_;\n\n typedef vtrc::shared_ptr<common::rpc_channel> channel_sptr;\n typedef std::pair<\n common::connection_iface_wptr, channel_sptr\n > connection_channel_pair;\n\n typedef std::list<connection_channel_pair> subscriber_list_type;\n\n subscriber_list_type subscribers_;\n\n impl( boost::asio::io_service &rpc_service )\n :db_thread_(1)\n ,event_queue_(rpc_service)\n { }\n\n void on_new_connection( server::listener_sptr l,\n const common::connection_iface *c )\n {\n std::cout << \"New connection: \"\n << \"\\n\\tep: \" << l->name( )\n << \"\\n\\tclient: \" << c->name( )\n << \"\\n\"\n ;\n }\n\n void on_stop_connection( server::listener_sptr l,\n const common::connection_iface *c )\n {\n std::cout << \"Close connection: \"\n << c->name( ) << \"\\n\";\n }\n\n void set( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n if( db_.find( name ) != db_.end( ) ) {\n if( closure ) closure( false, \"Record already exists\" );\n } else {\n db_stat_.set_set_requests( db_stat_.set_requests( ) + 1 );\n db_[name] = value;\n db_stat_.set_total_records( db_.size( ) );\n send_event( name , RECORD_ADDED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void upd( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n db_stat_.set_upd_requests( db_stat_.upd_requests( ) + 1 );\n db_type::iterator f( db_.find( name ));\n\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n f->second.CopyFrom( value );\n send_event( name , RECORD_CHANGED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void get( const std::string &name,\n vtrc::shared_ptr<vtrc_example::lukki_string_list> value,\n const operation_closure &closure)\n {\n db_stat_.set_get_requests( db_stat_.get_requests( ) + 1 );\n db_type::const_iterator f( db_.find( name ));\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n value->CopyFrom( f->second );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void del( const std::string &name,\n const operation_closure &closure)\n {\n db_stat_.set_del_requests( db_stat_.del_requests( ) + 1 );\n db_type::iterator f( db_.find( name ));\n if( f == db_.end( ) ) {\n if( closure ) closure( false, \"Record was not found\" );\n } else {\n db_.erase( f );\n send_event( name , RECORD_DELETED );\n if( closure ) closure( true, \"Success\" );\n }\n }\n\n void stat( vtrc::shared_ptr<vtrc_example::db_stat> stat,\n const operation_closure &closure)\n {\n stat->CopyFrom( db_stat_ );\n if( closure ) closure( true, \"Success\" );\n }\n\n void exist( const std::string &name,\n vtrc::shared_ptr<vtrc_example::exist_res> res,\n const operation_closure &closure)\n {\n res->set_value( db_.find( name ) != db_.end( ) );\n if( closure ) closure( true, \"Success\" );\n }\n\n \/\/\/ events\n void send_event( const std::string &record, unsigned changed )\n {\n event_queue_.post( vtrc::bind( &impl::send_event_impl, this,\n record, changed ) );\n }\n\n void send_event( vtrc::shared_ptr<common::rpc_channel> channel,\n const std::string &record, unsigned changed)\n {\n try {\n\n vtrc_example::lukki_events_Stub s(channel.get( ));\n vtrc_example::name_req req;\n\n req.set_name( record );\n switch (changed) {\n case RECORD_DELETED:\n s.value_removed( NULL, &req, NULL, NULL );\n break;\n case RECORD_CHANGED:\n s.value_changed( NULL, &req, NULL, NULL );\n break;\n case RECORD_ADDED:\n s.new_value( NULL, &req, NULL, NULL );\n break;\n default:\n break;\n }\n } catch( ... ) {\n ;;;\n }\n }\n\n void send_event_impl( const std::string &record, unsigned changed )\n {\n subscriber_list_type::iterator b(subscribers_.begin( ));\n while( b != subscribers_.end( ) ) {\n common::connection_iface_sptr lck(b->first.lock( ));\n if( lck ) {\n send_event( b->second, record, changed );\n ++b;\n } else {\n b = subscribers_.erase( b );\n }\n }\n }\n\n void send_subscribed( common::rpc_channel &channel )\n {\n try {\n vtrc_example::lukki_events_Stub s(&channel);\n vtrc_example::empty r;\n s.subscribed( NULL, &r, &r, NULL );\n } catch( ... ) {\n ;;;\n }\n }\n\n void subscribe_impl( common::connection_iface_wptr conn )\n {\n common::connection_iface_sptr lck(conn.lock( ));\n if( lck ) {\n vtrc::shared_ptr<common::rpc_channel> channel\n (server::channels::unicast::create_event_channel\n ( lck, true ));\n subscribers_.push_back( std::make_pair(conn, channel) );\n send_subscribed( *channel );\n }\n }\n\n void subscribe_client( vtrc::common::connection_iface* conn )\n {\n event_queue_.post( vtrc::bind(&impl::subscribe_impl, this,\n conn->weak_from_this( ) ));\n }\n\n };\n\n application::application( vtrc::common::pool_pair &pp )\n :vtrc::server::application(pp)\n ,impl_(new impl(pp.get_rpc_service( )))\n {\n\n }\n\n application::~application( )\n {\n delete impl_;\n }\n\n vtrc::shared_ptr<common::rpc_service_wrapper>\n application::get_service_by_name( vtrc::common::connection_iface* conn,\n const std::string &service_name )\n {\n if( service_name == lukki_db_impl::descriptor( )->full_name( ) ) {\n return vtrc::make_shared<common::rpc_service_wrapper>\n ( new lukki_db_impl( *this, conn ) );\n }\n return vtrc::shared_ptr<common::rpc_service_wrapper>( );\n }\n\n void application::attach_start_listener( server::listener_sptr listen )\n {\n listen->get_on_new_connection( ).connect(\n vtrc::bind( &impl::on_new_connection, impl_, listen, _1 ));\n\n listen->get_on_stop_connection( ).connect(\n vtrc::bind( &impl::on_stop_connection, impl_, listen, _1 ));\n\n listen->start( );\n impl_->listeners_.push_back( listen );\n }\n\n void application::set( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::set, impl_,name, value, closure));\n }\n\n void application::upd( const std::string &name,\n const vtrc_example::lukki_string_list &value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::upd, impl_,name, value, closure));\n }\n\n void application::get( const std::string &name,\n vtrc::shared_ptr<vtrc_example::lukki_string_list> value,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::get, impl_, name, value, closure));\n }\n\n void application::del( const std::string &name,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::del, impl_, name, closure));\n }\n\n void application::stat(vtrc::shared_ptr<vtrc_example::db_stat> stat,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::stat, impl_, stat, closure));\n }\n\n void application::exist( const std::string &name,\n vtrc::shared_ptr<vtrc_example::exist_res> res,\n const operation_closure &closure)\n {\n impl_->db_thread_.get_io_service( ).post(\n vtrc::bind( &impl::exist, impl_, name, res, closure));\n }\n\n void application::subscribe_client( vtrc::common::connection_iface* conn )\n {\n impl_->subscribe_client( conn );\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * c7a\/data\/data_manager.hpp\n *\n ******************************************************************************\/\n\n#ifndef C7A_DATA_DATA_MANAGER_HEADER\n#define C7A_DATA_DATA_MANAGER_HEADER\n\n#include <map>\n#include <functional>\n#include <stdexcept>\n#include <memory> \/\/unique_ptr\n#include \"block_iterator.hpp\"\n#include \"..\/common\/logger.hpp\"\n\nnamespace c7a {\nnamespace data {\n\n\/\/! Identification for DIAs\ntypedef int DIAId;\n\n\/\/! function Signature for an emitt function\ntemplate<typename T>\nusing BlockEmitter = std::function<void(T)>;\n\n\/\/! Stores in-memory data\n\/\/!\n\/\/! Future versions: Provide access to remote DIAs\nclass DataManager\n{\npublic:\n\n DataManager() : nextId_(0) { }\n\n DataManager(const DataManager&) = delete;\n DataManager & operator=(const DataManager&) = delete;\n\n \/\/! returns iterator on requested partition\n \/\/!\n \/\/! \\param id ID of the DIA\n template<class T>\n BlockIterator<T> GetLocalBlocks(DIAId id) {\n if (!Contains(id)) {\n throw std::runtime_error(\"target dia id unknown.\");\n }\n return BlockIterator<T>(data_[id]);\n }\n\n \/\/! returns true if the manager holds data of given DIA\n \/\/!\n \/\/! \\param id ID of the DIA\n bool Contains(DIAId id) {\n \/\/return data_.find(id) != data_.end();\n return data_.size() > id && id >= 0;\n }\n\n DIAId AllocateDIA() {\n SpacingLogger(true) << \"Allocate DIA\" << nextId_;\n \/\/data_[nextId_] = std::unique_ptr<std::vector<Blob>>( new std::vector<Blob>() );\n data_.push_back( std::vector<Blob>() );\n return data_.size() - 1;\n \/\/return nextId_++;\n }\n\n template<class T>\n BlockEmitter<T> GetLocalEmitter(DIAId id) {\n if (!Contains(id)) {\n throw std::runtime_error(\"target dia id unknown.\");\n }\n auto& target = data_[id]; \/\/yes. const ref to an unique_ptr\n return [& target](T elem){ target.push_back(Serialize(elem)); };\n }\n\nprivate:\n DIAId nextId_;\n\n \/\/YES I COULD just use a map of (int, vector) BUT then I have a weird\n \/\/behaviour of std::map on inserts. Sometimes it randomly kills itself.\n \/\/May depend on the compiler. Google it.\n \/\/std::map<DIAId, std::unique_ptr<std::vector<Blob>>> data_;\n std::vector<std::vector<Blob>> data_;\n};\n\n}\n}\n\n#endif \/\/ !C7A_DATA_DATA_MANAGER_HEADER\n\n\/******************************************************************************\/\n<commit_msg>fix data manager allocate dia logger<commit_after>\/*******************************************************************************\n * c7a\/data\/data_manager.hpp\n *\n ******************************************************************************\/\n\n#ifndef C7A_DATA_DATA_MANAGER_HEADER\n#define C7A_DATA_DATA_MANAGER_HEADER\n\n#include <map>\n#include <functional>\n#include <stdexcept>\n#include <memory> \/\/unique_ptr\n#include \"block_iterator.hpp\"\n#include \"..\/common\/logger.hpp\"\n\nnamespace c7a {\nnamespace data {\n\n\/\/! Identification for DIAs\ntypedef int DIAId;\n\n\/\/! function Signature for an emitt function\ntemplate<typename T>\nusing BlockEmitter = std::function<void(T)>;\n\n\/\/! Stores in-memory data\n\/\/!\n\/\/! Future versions: Provide access to remote DIAs\nclass DataManager\n{\npublic:\n\n DataManager() : nextId_(0) { }\n\n DataManager(const DataManager&) = delete;\n DataManager & operator=(const DataManager&) = delete;\n\n \/\/! returns iterator on requested partition\n \/\/!\n \/\/! \\param id ID of the DIA\n template<class T>\n BlockIterator<T> GetLocalBlocks(DIAId id) {\n if (!Contains(id)) {\n throw std::runtime_error(\"target dia id unknown.\");\n }\n return BlockIterator<T>(data_[id]);\n }\n\n \/\/! returns true if the manager holds data of given DIA\n \/\/!\n \/\/! \\param id ID of the DIA\n bool Contains(DIAId id) {\n \/\/return data_.find(id) != data_.end();\n return data_.size() > id && id >= 0;\n }\n\n DIAId AllocateDIA() {\n SpacingLogger(true) << \"Allocate DIA\" << data_.size() - 1;\n \/\/data_[nextId_] = std::unique_ptr<std::vector<Blob>>( new std::vector<Blob>() );\n data_.push_back( std::vector<Blob>() );\n return data_.size() - 1;\n \/\/return nextId_++;\n }\n\n template<class T>\n BlockEmitter<T> GetLocalEmitter(DIAId id) {\n if (!Contains(id)) {\n throw std::runtime_error(\"target dia id unknown.\");\n }\n auto& target = data_[id]; \/\/yes. const ref to an unique_ptr\n return [& target](T elem){ target.push_back(Serialize(elem)); };\n }\n\nprivate:\n DIAId nextId_;\n\n \/\/YES I COULD just use a map of (int, vector) BUT then I have a weird\n \/\/behaviour of std::map on inserts. Sometimes it randomly kills itself.\n \/\/May depend on the compiler. Google it. \/\/std::map<DIAId, std::unique_ptr<std::vector<Blob>>> data_;\n std::vector<std::vector<Blob>> data_;\n};\n\n}\n}\n\n#endif \/\/ !C7A_DATA_DATA_MANAGER_HEADER\n\n\/******************************************************************************\/\n<|endoftext|>"} {"text":"<commit_before>#include \"SerialServiceHandler.h\"\n#include \"SerialMessageProcessor.h\"\n#include \"protocol\/AmmoMessages.pb.h\"\n\n#ifdef WIN32\n #include <windows.h>\n #include <time.h>\n#else\n #include <termios.h>\n #include <unistd.h>\n#endif\n\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <string.h>\n\n\n#include <iostream>\n\n#include \"log.h\"\n\nusing namespace std;\n\nextern std::string gatewayAddress;\nextern int gatewayPort;\n\nSerialServiceHandler::SerialServiceHandler() : \nmessageProcessor(NULL),\nsendQueueMutex(), \nreceiveQueueMutex()\n{\n#ifdef WIN32\n this->hComm = NULL;\n#endif\n}\n\n\nint SerialServiceHandler::open(void *ptr)\n{\n \n \/\/ Open the serial port.\n#ifdef WIN32\n this->hComm = CreateFile( (const char*) ptr,\n GENERIC_READ | GENERIC_WRITE,\n 0,\n\t\t\t\t\t\t 0,\n\t\t\t\t\t\t OPEN_EXISTING,\n\t\t\t\t\t\t 0,\n\t\t\t\t\t\t 0);\n if (this->hComm == INVALID_HANDLE_VALUE) {\n int err = GetLastError();\n printf( \"open %s error code: %d\\n\\n\", (const char*) ptr, err );\n exit( -1 );\n }\n#else\n \/\/ Open the port\n gFD = ::open( (const char *)ptr, O_RDWR | O_NOCTTY );\/\/ | O_NONBLOCK );\n if ( gFD == -1 )\n {\n printf( \"open %s: error: %s\\n\\n\", (const char *)ptr, strerror(errno) );\n exit( -1 );\n }\n#endif\n \n \/\/ Configure the serial port.\n#ifdef WIN32\n DCB dcb;\n\n FillMemory(&dcb, sizeof(dcb), 0);\n dcb.DCBlength = sizeof(dcb);\n\n if (!BuildCommDCB(\"9600,n,8,1\", &dcb)) { \n printf(\"could not build dcb: error %d\\n\", GetLastError());\n exit(-1);\n }\n\n if (!SetCommState(this->hComm, &dcb)) {\n printf(\"could not set comm state: error %d\\n\", GetLastError());\n CloseHandle(this->hComm);\n exit(-1);\n }\n#else\n \/\/ Get the attributes for the port\n \/\/ struct termios config;\n \/\/ int result = tcgetattr( gFD, &config );\n \/\/ if ( result == -1 )\n \/\/ {\n \/\/ perror( \"tcgetattr\" );\n \/\/ exit( -1 );\n \/\/ }\n \n \/\/ \/\/ Set baud rate and 8, NONE, 1\n \n \/\/ \/\/ SETTING KEY:\n \/\/ \/\/ 1 -- ignore BREAK condition\n \/\/ \/\/ 2 -- map BREAK to SIGINTR\n \/\/ \/\/ 3 -- mark parity and framing errors\n \/\/ \/\/ 4 -- strip the 8th bit off chars\n \/\/ \/\/ 5 -- map NL to CR\n \/\/ \/\/ 6 -- ignore CR\n \/\/ \/\/ 7 -- map CR to NL\n \/\/ \/\/ 8 -- enable output flow control (software flow control)\n \/\/ \/\/ 9 -- enable input flow control (software flow control)\n \/\/ \/\/ 10-- any char will restart after stop (software flow control)\n \/\/ \/\/ 11-- postprocess output (not set = raw output)\n \/\/ \/\/ 12-- enable echoing of input characters\n \/\/ \/\/ 13-- echo NL\n \/\/ \/\/ 14-- enable canonical input (else raw)\n \/\/ \/\/ 15-- enable SIGINTR, SIGSUSP, SIGDSUSP, and SIGQUIT signals\n \/\/ \/\/ 16-- enable extended functions\n \/\/ \/\/ 17-- parity enable\n \/\/ \/\/ 18-- send 2 stop bits\n \/\/ \/\/ 19-- character size mask\n \/\/ \/\/ 20-- 8 bits\n \/\/ \/\/ 21-- enable follwing output processing\n \n \/\/ \/\/\t\t 1 2 3 4 5 6 7 8 9 10\n \/\/ config.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP|INLCR|IGNCR|ICRNL|IXON|IXOFF|IXANY);\n \/\/ \/\/ 11\n \/\/ config.c_oflag &= ~OPOST;\n \/\/ \/\/ 12 13 14 15 16\n \/\/ config.c_lflag &= ~(ECHO|ECHONL|ICANON|ISIG|IEXTEN);\n \/\/ \/\/\t\t 17 18 19\n \/\/ \/\/ 20\n \/\/ config.c_cflag |= CS8;\n \/\/ \/\/ 21\n \/\/ config.c_cflag |= CRTSCTS;\n \n \/\/ config.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP|INLCR|IGNCR|ICRNL|IXON|IXOFF|IXANY);\n \/\/ config.c_lflag &= ~(ECHO|ECHONL|ICANON|ISIG|IEXTEN);\n \/\/ config.c_cflag &= ~(PARENB|CSTOPB|CSIZE);\n \/\/ config.c_cflag |= CS8;\n \n \/\/ \tspeed_t speed = B9600;\n \n \/\/ cfsetispeed(&config, speed);\n \/\/ cfsetospeed(&config, speed);\n \n \/\/ bzero(&config, sizeof(config) );\n \/\/ config.c_cflag = B9600 | CRTSCTS | CS8 | CLOCAL | CREAD;\n \/\/ config.c_iflag = IGNPAR | ICRNL;\n \/\/ config.c_oflag = 0;\n \/\/ \/\/config.c_lflag = ICANON;\n \/\/ config.c_cc[VMIN] = 1;\t\/\/ blocking read until 1 character arrives\n \n struct termios cfg;\n \n if (tcgetattr(gFD, &cfg))\n {\n close(gFD);\n \/\/ TODO: throw an exception\n return 0;\n }\n \n \/\/ Set baud rate\n cfsetispeed( &cfg, B9600 );\n cfsetospeed( &cfg, B9600 );\n \n cfmakeraw( &cfg );\n \n \/\/ Always set these\n cfg.c_cflag |= (CLOCAL | CREAD);\n \n \/\/ Set 8, None, 1\n cfg.c_cflag &= ~PARENB;\n cfg.c_cflag &= ~CSTOPB;\n cfg.c_cflag &= ~CSIZE;\n cfg.c_cflag |= CS8;\n \n \/\/ Enable hardware flow control\n cfg.c_cflag |= CRTSCTS;\n \n \/\/ Use raw input rather than canonical (line-oriented)\n cfg.c_lflag &= ~(ICANON | ECHO | ECHOE | ISIG);\n \n \/\/ Disable software flow control\n cfg.c_iflag &= ~(IXON | IXOFF | IXANY);\n \n \/\/ Use raw output rather than processed (line-oriented)\n cfg.c_oflag &= ~OPOST;\n \n \/\/ Read one character at a time. VTIME defaults to zero, so reads will\n \/\/ block indefinitely.\n cfg.c_cc[VMIN] = 1;\n \n \/\/ Other \"c\" bits\n \/\/cfg.c_iflag |= IGNBRK; \/\/ Ignore break condition\n \/\/ The constant IUCLC is not present on OSX, so we only use it on non-OSX\n \/\/ platforms (where __APPLE__ is not defined).\n #ifndef __APPLE__\n cfg.c_iflag &= ~( IGNBRK | BRKINT | IGNPAR | PARMRK | INPCK | ISTRIP | INLCR | IGNCR | ICRNL | IUCLC );\n #else \n cfg.c_iflag &= ~( IGNBRK | BRKINT | IGNPAR | PARMRK | INPCK | ISTRIP | INLCR | IGNCR | ICRNL );\n #endif\n \n \/\/ Other \"l\" bits\n cfg.c_lflag &= ~IEXTEN;\n \n \n \/\/ Old, bad code. Sort of works, but was using canonical mode, which\n \/\/ we don't want.\n \n \/\/struct termios config;\n \/\/memset( &config, 0, sizeof(config) );\n \/\/config.c_cflag = B9600 | CRTSCTS | CS8 | CLOCAL | CREAD;\n \/\/config.c_iflag = IGNPAR | ICRNL;\n \/\/config.c_oflag = 0;\n \/\/config.c_cc[VMIN] = 1;\n \n tcflush( gFD, TCIFLUSH );\n \n if (tcsetattr(gFD, TCSANOW, &cfg))\n {\n close(gFD);\n \/* TODO: throw an exception *\/\n return 0;\n }\n \n \/\/ tcflush( gFD, TCIFLUSH );\n \/\/ tcsetattr( gFD, TCSANOW, &config );\n#endif\n \n \/\/ Configure internal service handler state.\n \n state = READING_HEADER;\n collectedData = NULL;\n position = 0;\n \n dataToSend = NULL;\n position = 0;\n \n messageHeader.magicNumber = 0;\n messageHeader.size = 0;\n messageHeader.checksum = 0;\n messageHeader.headerChecksum = 0;\n \n sentMessageCount = 0;\n receivedMessageCount = 0;\n \n connectionClosing = false;\n \n \n messageProcessor = new SerialMessageProcessor(this);\n messageProcessor->activate();\n \n return 0;\n}\n\n#ifdef WIN32\n#define DELTA_EPOCH_IN_MICROSECONDS 11644473600000000ULL\nint gettimeofday(struct timeval* tv, struct timezone* tz)\n{\n FILETIME ft;\n unsigned __int64 tmpres = 0;\n static int tzflag;\n\n if (NULL != tv) {\n GetSystemTimeAsFileTime(&ft);\n\n\ttmpres |= ft.dwHighDateTime;\n\ttmpres <<= 32;\n\ttmpres |= ft.dwLowDateTime;\n\n\ttmpres -= DELTA_EPOCH_IN_MICROSECONDS;\n\ttmpres \/= 10;\n\ttv->tv_sec = (long) (tmpres \/ 1000000UL);\n\ttv->tv_usec = (long) (tmpres % 1000000UL);\n }\n\n return 0;\n}\n#endif\n\nvoid SerialServiceHandler::receiveData() {\n \n char phone_id = 127;\n short size = 0;\n int state = 0;\n unsigned char c = 0;\n char buf[1024] = { '\\0' };\n struct timeval tv;\n \n while ( true )\n {\n switch ( state )\n {\n case 0:\n \/\/ printf( \"Waiting for magic.\\n\" ); fflush(stdout);\n c = read_a_char();\n if ( c == 0xef )\n state = c;\n break;\n \n case 0xef:\n c = read_a_char();\n if ( c == 0xbe || c == 0xef )\n state = c;\n else\n state = 0;\n break;\n \n case 0xbe:\n c = read_a_char();\n if ( c == 0xed )\n state = 1;\n else if ( c == 0xef )\n state = c;\n else\n state = 0;\n break;\n \n case 1:\n {\n for ( int i = 0; i < 13; ++i )\n {\n c = read_a_char();\n buf[i+3] = c;\n }\n phone_id = buf[3] & 0x3F;\n size = *(short *)&buf[4];\n \n state = 2;\n }\n break;\n \n case 2:\n\t printf(\"SLOT[%2d],Len[%3d]: \", phone_id, size);\n\t \n\t for ( int i = 0; i < size; ++i )\n\t {\n\t c = read_a_char();\n\t buf[i+16] = c;\n\t }\n\t {\n\t int result = gettimeofday( &tv, NULL );\n\t if ( result == -1 )\n\t {\n\t printf( \"gettimeofday() failed\\n\" );\n\t break;\n\t }\n\t \n\t long ts = *(long *)&buf[8];\n\t long rts = tv.tv_sec*1000 + tv.tv_usec \/ 1000; \n\t printf( \" Tdt(%ld),Thh(%ld),Tdel(%8ld)\\n\", rts, ts, rts-ts );\n\t }\n\t \n\t processData(&buf[16], size, *(short *)&buf[6], 0); \/\/ process the message\n\t state = 0;\n\t break;\n\t \n\t default:\n\t printf( \"Something f-ed up.\\n\" );\n\t }\n\t}\n\t\n\t\n}\n\n\nunsigned char SerialServiceHandler::read_a_char()\n{\n unsigned char temp;\n \n while ( true )\n {\n \/\/ printf( \"about to read()...\" );\n#ifdef WIN32\n DWORD count = 0;\n \n\twhile (count == 0) {\n if (!ReadFile(this->hComm, &temp, 1, &count, NULL)) {\n int err = GetLastError();\n printf(\"ReadFile failed with error code: %d\", err);\n\t exit(-1);\n }\n\t Sleep(1);\n\t}\n#else\n ssize_t count = read( gFD, &temp, 1 );\n#endif\n\n if ( count == -1 )\n {\n perror( \"read\" );\n exit( -1 );\n }\n else if ( count >= 1 )\n {\n break;\n }\n else if ( count == 0 )\n {\n perror( \"read count 0\" );\n exit( -1 );\n }\n }\n return temp;\n}\n\n\nint SerialServiceHandler::processData(char *data, unsigned int messageSize, unsigned int messageChecksum, char priority) {\n \/\/Validate checksum\n unsigned int calculatedChecksum = ACE::crc32(data, messageSize);\n if( (calculatedChecksum & 0xffff) != (messageChecksum & 0xffff) ) {\n LOG_ERROR((long) this << \" Mismatched checksum \" << std::hex << calculatedChecksum << \" : \" << messageChecksum);\n LOG_ERROR((long) this << \" size \" << std::dec << messageSize ); \/\/ << \" payload: \" < );\n return -1;\n }\n \n \/\/checksum is valid; parse the data\n ammo::protocol::MessageWrapper *msg = new ammo::protocol::MessageWrapper();\n bool result = msg->ParseFromArray(data, messageSize);\n if(result == false) {\n LOG_ERROR((long) this << \" MessageWrapper could not be deserialized.\");\n LOG_ERROR((long) this << \" Client must have sent something that isn't a protocol buffer (or the wrong type).\");\n delete msg;\n return -1;\n }\n addReceivedMessage(msg, priority);\n messageProcessor->signalNewMessageAvailable();\n \n return 0;\n}\n\nvoid SerialServiceHandler::sendMessage(ammo::protocol::MessageWrapper *msg, char priority) {\n}\n\nvoid SerialServiceHandler::sendErrorPacket(char errorCode) {\n}\n\nammo::protocol::MessageWrapper *SerialServiceHandler::getNextMessageToSend() {\n ammo::protocol::MessageWrapper *msg = NULL;\n return msg;\n}\n\nammo::protocol::MessageWrapper *SerialServiceHandler::getNextReceivedMessage() {\n ammo::protocol::MessageWrapper *msg = NULL;\n receiveQueueMutex.acquire();\n if(!receiveQueue.empty()) {\n msg = receiveQueue.top().message;\n receiveQueue.pop();\n }\n receiveQueueMutex.release();\n \n return msg;\n}\n\nvoid SerialServiceHandler::addReceivedMessage(ammo::protocol::MessageWrapper *msg, char priority) {\n QueuedMessage queuedMsg;\n queuedMsg.priority = priority;\n queuedMsg.message = msg;\n \n if(priority != msg->message_priority()) {\n LOG_WARN((long) this << \" Priority mismatch on received message: Header = \" << (int) priority << \", Message = \" << msg->message_priority());\n }\n \n receiveQueueMutex.acquire();\n queuedMsg.messageCount = receivedMessageCount;\n receivedMessageCount++;\n receiveQueue.push(queuedMsg);\n receiveQueueMutex.release();\n}\n\nSerialServiceHandler::~SerialServiceHandler() {\n LOG_TRACE((long) this << \" In ~SerialServiceHandler\");\n delete messageProcessor;\n}\n<commit_msg>Fix buffer overflow if size is greater than maximum packet size (1024); convert printf logging to use gateway logging<commit_after>#include \"SerialServiceHandler.h\"\n#include \"SerialMessageProcessor.h\"\n#include \"protocol\/AmmoMessages.pb.h\"\n\n#ifdef WIN32\n #include <windows.h>\n #include <time.h>\n#else\n #include <termios.h>\n #include <unistd.h>\n#endif\n\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <string.h>\n\n\n#include <iostream>\n\n#include \"log.h\"\n\nconst size_t MAX_PAYLOAD_SIZE = 1024;\n\nusing namespace std;\n\nextern std::string gatewayAddress;\nextern int gatewayPort;\n\nSerialServiceHandler::SerialServiceHandler() : \nmessageProcessor(NULL),\nsendQueueMutex(), \nreceiveQueueMutex()\n{\n#ifdef WIN32\n this->hComm = NULL;\n#endif\n}\n\n\nint SerialServiceHandler::open(void *ptr)\n{\n \n \/\/ Open the serial port.\n#ifdef WIN32\n this->hComm = CreateFile( (const char*) ptr,\n GENERIC_READ | GENERIC_WRITE,\n 0,\n\t\t\t\t\t\t 0,\n\t\t\t\t\t\t OPEN_EXISTING,\n\t\t\t\t\t\t 0,\n\t\t\t\t\t\t 0);\n if (this->hComm == INVALID_HANDLE_VALUE) {\n int err = GetLastError();\n LOG_ERROR(\"open \"<< (const char *) ptr << \" error code: \" << err );\n exit( -1 );\n }\n#else\n \/\/ Open the port\n gFD = ::open( (const char *)ptr, O_RDWR | O_NOCTTY );\/\/ | O_NONBLOCK );\n if ( gFD == -1 )\n {\n LOG_ERROR(\"open \"<< (const char *) ptr << \": error: \" << strerror(errno));\n exit( -1 );\n }\n#endif\n \n \/\/ Configure the serial port.\n#ifdef WIN32\n DCB dcb;\n\n FillMemory(&dcb, sizeof(dcb), 0);\n dcb.DCBlength = sizeof(dcb);\n\n if (!BuildCommDCB(\"9600,n,8,1\", &dcb)) { \n LOG_ERROR(\"could not build dcb: error \" << GetLastError());\n exit(-1);\n }\n\n if (!SetCommState(this->hComm, &dcb)) {\n LOG_ERROR(\"could not set comm state: error \" << GetLastError());\n CloseHandle(this->hComm);\n exit(-1);\n }\n#else\n \/\/ Get the attributes for the port\n \/\/ struct termios config;\n \/\/ int result = tcgetattr( gFD, &config );\n \/\/ if ( result == -1 )\n \/\/ {\n \/\/ perror( \"tcgetattr\" );\n \/\/ exit( -1 );\n \/\/ }\n \n \/\/ \/\/ Set baud rate and 8, NONE, 1\n \n \/\/ \/\/ SETTING KEY:\n \/\/ \/\/ 1 -- ignore BREAK condition\n \/\/ \/\/ 2 -- map BREAK to SIGINTR\n \/\/ \/\/ 3 -- mark parity and framing errors\n \/\/ \/\/ 4 -- strip the 8th bit off chars\n \/\/ \/\/ 5 -- map NL to CR\n \/\/ \/\/ 6 -- ignore CR\n \/\/ \/\/ 7 -- map CR to NL\n \/\/ \/\/ 8 -- enable output flow control (software flow control)\n \/\/ \/\/ 9 -- enable input flow control (software flow control)\n \/\/ \/\/ 10-- any char will restart after stop (software flow control)\n \/\/ \/\/ 11-- postprocess output (not set = raw output)\n \/\/ \/\/ 12-- enable echoing of input characters\n \/\/ \/\/ 13-- echo NL\n \/\/ \/\/ 14-- enable canonical input (else raw)\n \/\/ \/\/ 15-- enable SIGINTR, SIGSUSP, SIGDSUSP, and SIGQUIT signals\n \/\/ \/\/ 16-- enable extended functions\n \/\/ \/\/ 17-- parity enable\n \/\/ \/\/ 18-- send 2 stop bits\n \/\/ \/\/ 19-- character size mask\n \/\/ \/\/ 20-- 8 bits\n \/\/ \/\/ 21-- enable follwing output processing\n \n \/\/ \/\/\t\t 1 2 3 4 5 6 7 8 9 10\n \/\/ config.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP|INLCR|IGNCR|ICRNL|IXON|IXOFF|IXANY);\n \/\/ \/\/ 11\n \/\/ config.c_oflag &= ~OPOST;\n \/\/ \/\/ 12 13 14 15 16\n \/\/ config.c_lflag &= ~(ECHO|ECHONL|ICANON|ISIG|IEXTEN);\n \/\/ \/\/\t\t 17 18 19\n \/\/ \/\/ 20\n \/\/ config.c_cflag |= CS8;\n \/\/ \/\/ 21\n \/\/ config.c_cflag |= CRTSCTS;\n \n \/\/ config.c_iflag &= ~(IGNBRK|BRKINT|PARMRK|ISTRIP|INLCR|IGNCR|ICRNL|IXON|IXOFF|IXANY);\n \/\/ config.c_lflag &= ~(ECHO|ECHONL|ICANON|ISIG|IEXTEN);\n \/\/ config.c_cflag &= ~(PARENB|CSTOPB|CSIZE);\n \/\/ config.c_cflag |= CS8;\n \n \/\/ \tspeed_t speed = B9600;\n \n \/\/ cfsetispeed(&config, speed);\n \/\/ cfsetospeed(&config, speed);\n \n \/\/ bzero(&config, sizeof(config) );\n \/\/ config.c_cflag = B9600 | CRTSCTS | CS8 | CLOCAL | CREAD;\n \/\/ config.c_iflag = IGNPAR | ICRNL;\n \/\/ config.c_oflag = 0;\n \/\/ \/\/config.c_lflag = ICANON;\n \/\/ config.c_cc[VMIN] = 1;\t\/\/ blocking read until 1 character arrives\n \n struct termios cfg;\n \n if (tcgetattr(gFD, &cfg))\n {\n close(gFD);\n \/\/ TODO: throw an exception\n return 0;\n }\n \n \/\/ Set baud rate\n cfsetispeed( &cfg, B9600 );\n cfsetospeed( &cfg, B9600 );\n \n cfmakeraw( &cfg );\n \n \/\/ Always set these\n cfg.c_cflag |= (CLOCAL | CREAD);\n \n \/\/ Set 8, None, 1\n cfg.c_cflag &= ~PARENB;\n cfg.c_cflag &= ~CSTOPB;\n cfg.c_cflag &= ~CSIZE;\n cfg.c_cflag |= CS8;\n \n \/\/ Enable hardware flow control\n cfg.c_cflag |= CRTSCTS;\n \n \/\/ Use raw input rather than canonical (line-oriented)\n cfg.c_lflag &= ~(ICANON | ECHO | ECHOE | ISIG);\n \n \/\/ Disable software flow control\n cfg.c_iflag &= ~(IXON | IXOFF | IXANY);\n \n \/\/ Use raw output rather than processed (line-oriented)\n cfg.c_oflag &= ~OPOST;\n \n \/\/ Read one character at a time. VTIME defaults to zero, so reads will\n \/\/ block indefinitely.\n cfg.c_cc[VMIN] = 1;\n \n \/\/ Other \"c\" bits\n \/\/cfg.c_iflag |= IGNBRK; \/\/ Ignore break condition\n \/\/ The constant IUCLC is not present on OSX, so we only use it on non-OSX\n \/\/ platforms (where __APPLE__ is not defined).\n #ifndef __APPLE__\n cfg.c_iflag &= ~( IGNBRK | BRKINT | IGNPAR | PARMRK | INPCK | ISTRIP | INLCR | IGNCR | ICRNL | IUCLC );\n #else \n cfg.c_iflag &= ~( IGNBRK | BRKINT | IGNPAR | PARMRK | INPCK | ISTRIP | INLCR | IGNCR | ICRNL );\n #endif\n \n \/\/ Other \"l\" bits\n cfg.c_lflag &= ~IEXTEN;\n \n \n \/\/ Old, bad code. Sort of works, but was using canonical mode, which\n \/\/ we don't want.\n \n \/\/struct termios config;\n \/\/memset( &config, 0, sizeof(config) );\n \/\/config.c_cflag = B9600 | CRTSCTS | CS8 | CLOCAL | CREAD;\n \/\/config.c_iflag = IGNPAR | ICRNL;\n \/\/config.c_oflag = 0;\n \/\/config.c_cc[VMIN] = 1;\n \n tcflush( gFD, TCIFLUSH );\n \n if (tcsetattr(gFD, TCSANOW, &cfg))\n {\n close(gFD);\n \/* TODO: throw an exception *\/\n return 0;\n }\n \n \/\/ tcflush( gFD, TCIFLUSH );\n \/\/ tcsetattr( gFD, TCSANOW, &config );\n#endif\n \n \/\/ Configure internal service handler state.\n \n state = READING_HEADER;\n collectedData = NULL;\n position = 0;\n \n dataToSend = NULL;\n position = 0;\n \n messageHeader.magicNumber = 0;\n messageHeader.size = 0;\n messageHeader.checksum = 0;\n messageHeader.headerChecksum = 0;\n \n sentMessageCount = 0;\n receivedMessageCount = 0;\n \n connectionClosing = false;\n \n \n messageProcessor = new SerialMessageProcessor(this);\n messageProcessor->activate();\n \n return 0;\n}\n\n\n\/\/TODO: ACE provides gettimeofday; we shouldn't reimplement it\n#ifdef WIN32\n#define DELTA_EPOCH_IN_MICROSECONDS 11644473600000000ULL\nint gettimeofday(struct timeval* tv, struct timezone* tz)\n{\n FILETIME ft;\n unsigned __int64 tmpres = 0;\n static int tzflag;\n\n if (NULL != tv) {\n GetSystemTimeAsFileTime(&ft);\n\n\ttmpres |= ft.dwHighDateTime;\n\ttmpres <<= 32;\n\ttmpres |= ft.dwLowDateTime;\n\n\ttmpres -= DELTA_EPOCH_IN_MICROSECONDS;\n\ttmpres \/= 10;\n\ttv->tv_sec = (long) (tmpres \/ 1000000UL);\n\ttv->tv_usec = (long) (tmpres % 1000000UL);\n }\n\n return 0;\n}\n#endif\n\nvoid SerialServiceHandler::receiveData() {\n \n char phone_id = 127;\n unsigned short size = 0;\n int state = 0;\n unsigned char c = 0;\n char buf[MAX_PAYLOAD_SIZE] = { '\\0' };\n struct timeval tv;\n \n while ( true )\n {\n switch ( state )\n {\n case 0:\n \/\/ printf( \"Waiting for magic.\\n\" ); fflush(stdout);\n c = read_a_char();\n if ( c == 0xef )\n state = c;\n break;\n \n case 0xef:\n c = read_a_char();\n if ( c == 0xbe || c == 0xef )\n state = c;\n else\n state = 0;\n break;\n \n case 0xbe:\n c = read_a_char();\n if ( c == 0xed )\n state = 1;\n else if ( c == 0xef )\n state = c;\n else\n state = 0;\n break;\n \n case 1:\n {\n for ( int i = 0; i < 13; ++i )\n {\n c = read_a_char();\n buf[i+3] = c;\n }\n phone_id = buf[3] & 0x3F;\n size = *(short *)&buf[4];\n \n state = 2;\n }\n break;\n \n case 2:\n\t LOG_DEBUG(\"SLOT[\" << phone_id << \"],Len[\" << size << \"]: \");\n\t \n\t if(size < MAX_PAYLOAD_SIZE - 16) {\n for (unsigned short i = 0; i < size; ++i)\n {\n c = read_a_char();\n buf[i+16] = c;\n }\n {\n int result = gettimeofday( &tv, NULL );\n if ( result == -1 )\n {\n LOG_ERROR(\"gettimeofday() failed\\n\" );\n break;\n }\n \n long ts = *(long *)&buf[8];\n long rts = tv.tv_sec*1000 + tv.tv_usec \/ 1000; \n LOG_DEBUG(\" Tdt(\" << rts << \"),Thh(\" << ts << \"),Tdel(\" << rts - ts << \")\");\n }\n \n processData(&buf[16], size, *(short *)&buf[6], 0); \/\/ process the message\n\t } else {\n\t LOG_ERROR(\"Received packet of invalid size: \" << size);\n\t }\n\t state = 0;\n\t break;\n\t \n\t default:\n\t LOG_ERROR(\"SerialServiceHandler: unknown state\");\n\t }\n\t}\n\t\n\t\n}\n\n\nunsigned char SerialServiceHandler::read_a_char()\n{\n unsigned char temp;\n \n while ( true )\n {\n \/\/ printf( \"about to read()...\" );\n#ifdef WIN32\n DWORD count = 0;\n \n\twhile (count == 0) {\n if (!ReadFile(this->hComm, &temp, 1, &count, NULL)) {\n int err = GetLastError();\n LOG_ERROR(\"ReadFile failed with error code: \" << err);\n\t exit(-1);\n }\n\t Sleep(1);\n\t}\n#else\n ssize_t count = read( gFD, &temp, 1 );\n#endif\n\n if ( count == -1 )\n {\n LOG_ERROR( \"Read returned -1\" );\n exit( -1 );\n }\n else if ( count >= 1 )\n {\n break;\n }\n else if ( count == 0 )\n {\n LOG_ERROR( \"Read returned 0\" );\n exit( -1 );\n }\n }\n return temp;\n}\n\n\nint SerialServiceHandler::processData(char *data, unsigned int messageSize, unsigned int messageChecksum, char priority) {\n \/\/Validate checksum\n unsigned int calculatedChecksum = ACE::crc32(data, messageSize);\n if( (calculatedChecksum & 0xffff) != (messageChecksum & 0xffff) ) {\n LOG_ERROR((long) this << \" Mismatched checksum \" << std::hex << calculatedChecksum << \" : \" << messageChecksum);\n LOG_ERROR((long) this << \" size \" << std::dec << messageSize ); \/\/ << \" payload: \" < );\n return -1;\n }\n \n \/\/checksum is valid; parse the data\n ammo::protocol::MessageWrapper *msg = new ammo::protocol::MessageWrapper();\n bool result = msg->ParseFromArray(data, messageSize);\n if(result == false) {\n LOG_ERROR((long) this << \" MessageWrapper could not be deserialized.\");\n LOG_ERROR((long) this << \" Client must have sent something that isn't a protocol buffer (or the wrong type).\");\n delete msg;\n return -1;\n }\n addReceivedMessage(msg, priority);\n messageProcessor->signalNewMessageAvailable();\n \n return 0;\n}\n\nvoid SerialServiceHandler::sendMessage(ammo::protocol::MessageWrapper *msg, char priority) {\n}\n\nvoid SerialServiceHandler::sendErrorPacket(char errorCode) {\n}\n\nammo::protocol::MessageWrapper *SerialServiceHandler::getNextMessageToSend() {\n ammo::protocol::MessageWrapper *msg = NULL;\n return msg;\n}\n\nammo::protocol::MessageWrapper *SerialServiceHandler::getNextReceivedMessage() {\n ammo::protocol::MessageWrapper *msg = NULL;\n receiveQueueMutex.acquire();\n if(!receiveQueue.empty()) {\n msg = receiveQueue.top().message;\n receiveQueue.pop();\n }\n receiveQueueMutex.release();\n \n return msg;\n}\n\nvoid SerialServiceHandler::addReceivedMessage(ammo::protocol::MessageWrapper *msg, char priority) {\n QueuedMessage queuedMsg;\n queuedMsg.priority = priority;\n queuedMsg.message = msg;\n \n if(priority != msg->message_priority()) {\n LOG_WARN((long) this << \" Priority mismatch on received message: Header = \" << (int) priority << \", Message = \" << msg->message_priority());\n }\n \n receiveQueueMutex.acquire();\n queuedMsg.messageCount = receivedMessageCount;\n receivedMessageCount++;\n receiveQueue.push(queuedMsg);\n receiveQueueMutex.release();\n}\n\nSerialServiceHandler::~SerialServiceHandler() {\n LOG_TRACE((long) this << \" In ~SerialServiceHandler\");\n delete messageProcessor;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2018 Nicholas Frechette & Animation Compression Library contributors\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <catch.hpp>\n\n#include <acl\/math\/scalar_32.h>\n#include <acl\/math\/scalar_64.h>\n\n#include <limits>\n\nusing namespace acl;\n\ntemplate<typename FloatType>\nstatic void TestScalarImpl(const FloatType pi, const FloatType threshold)\n{\n\tconst FloatType half_pi = pi * FloatType(0.5);\n\tconst FloatType two_pi = pi * FloatType(2.0);\n\n\tREQUIRE(acl::floor(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::floor(FloatType(0.5)) == FloatType(0.0));\n\tREQUIRE(acl::floor(FloatType(2.5)) == FloatType(2.0));\n\tREQUIRE(acl::floor(FloatType(3.0)) == FloatType(3.0));\n\tREQUIRE(acl::floor(FloatType(-0.5)) == FloatType(-1.0));\n\tREQUIRE(acl::floor(FloatType(-2.5)) == FloatType(-3.0));\n\tREQUIRE(acl::floor(FloatType(-3.0)) == FloatType(-3.0));\n\n\tREQUIRE(acl::ceil(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::ceil(FloatType(0.5)) == FloatType(1.0));\n\tREQUIRE(acl::ceil(FloatType(2.5)) == FloatType(3.0));\n\tREQUIRE(acl::ceil(FloatType(3.0)) == FloatType(3.0));\n\tREQUIRE(acl::ceil(FloatType(-0.5)) == FloatType(0.0));\n\tREQUIRE(acl::ceil(FloatType(-2.5)) == FloatType(-2.0));\n\tREQUIRE(acl::ceil(FloatType(-3.0)) == FloatType(-3.0));\n\n\tREQUIRE(clamp(FloatType(0.5), FloatType(0.0), FloatType(1.0)) == FloatType(0.5));\n\tREQUIRE(clamp(FloatType(-0.5), FloatType(0.0), FloatType(1.0)) == FloatType(0.0));\n\tREQUIRE(clamp(FloatType(1.5), FloatType(0.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(acl::abs(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::abs(FloatType(2.0)) == FloatType(2.0));\n\tREQUIRE(acl::abs(FloatType(-2.0)) == FloatType(2.0));\n\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.0), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.000001), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(0.999999), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.001), FloatType(0.00001)) == false);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(0.999), FloatType(0.00001)) == false);\n\n\tREQUIRE(acl::sqrt(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(acl::sqrt(FloatType(0.5)), std::sqrt(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::sqrt(FloatType(32.5)), std::sqrt(FloatType(32.5)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::sqrt_reciprocal(FloatType(0.5)), FloatType(1.0) \/ std::sqrt(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::sqrt_reciprocal(FloatType(32.5)), FloatType(1.0) \/ std::sqrt(FloatType(32.5)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(0.5)), FloatType(1.0 \/ 0.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(32.5)), FloatType(1.0 \/ 32.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(-0.5)), FloatType(1.0 \/ -0.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(-32.5)), FloatType(1.0 \/ -32.5), threshold));\n\n\tconst FloatType angles[] = { FloatType(0.0), pi, -pi, half_pi, -half_pi, FloatType(0.5), FloatType(32.5), FloatType(-0.5), FloatType(-32.5) };\n\n\tfor (const FloatType angle : angles)\n\t{\n\t\tREQUIRE(scalar_near_equal(acl::sin(angle), std::sin(angle), threshold));\n\t\tREQUIRE(scalar_near_equal(acl::cos(angle), std::cos(angle), threshold));\n\n\t\tFloatType sin_result;\n\t\tFloatType cos_result;\n\t\tacl::sincos(angle, sin_result, cos_result);\n\t\tREQUIRE(scalar_near_equal(sin_result, std::sin(angle), threshold));\n\t\tREQUIRE(scalar_near_equal(cos_result, std::cos(angle), threshold));\n\t}\n\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-1.0)), std::acos(FloatType(-1.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.75)), std::acos(FloatType(-0.75)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.5)), std::acos(FloatType(-0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.25)), std::acos(-FloatType(0.25)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.0)), std::acos(FloatType(0.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.25)), std::acos(FloatType(0.25)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.5)), std::acos(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.75)), std::acos(FloatType(0.75)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(1.0)), std::acos(FloatType(1.0)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-2.0), FloatType(-2.0)), std::atan2(FloatType(-2.0), FloatType(-2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-1.0), FloatType(-2.0)), std::atan2(FloatType(-1.0), FloatType(-2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-2.0), FloatType(-1.0)), std::atan2(FloatType(-2.0), FloatType(-1.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(2.0), FloatType(2.0)), std::atan2(FloatType(2.0), FloatType(2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(1.0), FloatType(2.0)), std::atan2(FloatType(1.0), FloatType(2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(2.0), FloatType(1.0)), std::atan2(FloatType(2.0), FloatType(1.0)), threshold));\n\n\tREQUIRE(acl::min(FloatType(-0.5), FloatType(1.0)) == FloatType(-0.5));\n\tREQUIRE(acl::min(FloatType(1.0), FloatType(-0.5)) == FloatType(-0.5));\n\tREQUIRE(acl::min(FloatType(1.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(acl::max(FloatType(-0.5), FloatType(1.0)) == FloatType(1.0));\n\tREQUIRE(acl::max(FloatType(1.0), FloatType(-0.5)) == FloatType(1.0));\n\tREQUIRE(acl::max(FloatType(1.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(deg2rad(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(90.0)), half_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-90.0)), -half_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(180.0)), pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-180.0)), -pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(360.0)), two_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-360.0)), -two_pi, threshold));\n\n\tREQUIRE(acl::is_finite(FloatType(0.0)) == true);\n\tREQUIRE(acl::is_finite(FloatType(32.0)) == true);\n\tREQUIRE(acl::is_finite(FloatType(-32.0)) == true);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::infinity()) == false);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::quiet_NaN()) == false);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::signaling_NaN()) == false);\n\n\tREQUIRE(symmetric_round(FloatType(-1.75)) == FloatType(-2.0));\n\tREQUIRE(symmetric_round(FloatType(-1.5)) == FloatType(-2.0));\n\tREQUIRE(symmetric_round(FloatType(-1.4999)) == FloatType(-1.0));\n\tREQUIRE(symmetric_round(FloatType(-0.5)) == FloatType(-1.0));\n\tREQUIRE(symmetric_round(FloatType(-0.4999)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.4999)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.5)) == FloatType(1.0));\n\tREQUIRE(symmetric_round(FloatType(1.4999)) == FloatType(1.0));\n\tREQUIRE(symmetric_round(FloatType(1.5)) == FloatType(2.0));\n\tREQUIRE(symmetric_round(FloatType(1.75)) == FloatType(2.0));\n\n\tREQUIRE(fraction(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(fraction(FloatType(1.0)) == FloatType(0.0));\n\tREQUIRE(fraction(FloatType(-1.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.25)), FloatType(0.25), threshold));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.5)), FloatType(0.5), threshold));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.75)), FloatType(0.75), threshold));\n}\n\nTEST_CASE(\"scalar 32 math\", \"[math][scalar]\")\n{\n\tTestScalarImpl<float>(acl::k_pi_32, 1.0e-6f);\n}\n\nTEST_CASE(\"scalar 64 math\", \"[math][scalar]\")\n{\n\tTestScalarImpl<double>(acl::k_pi_64, 1.0e-9);\n}\n<commit_msg>Renamed function to be consistent with naming convention.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2018 Nicholas Frechette & Animation Compression Library contributors\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <catch.hpp>\n\n#include <acl\/math\/scalar_32.h>\n#include <acl\/math\/scalar_64.h>\n\n#include <limits>\n\nusing namespace acl;\n\ntemplate<typename FloatType>\nstatic void test_scalar_impl(const FloatType pi, const FloatType threshold)\n{\n\tconst FloatType half_pi = pi * FloatType(0.5);\n\tconst FloatType two_pi = pi * FloatType(2.0);\n\n\tREQUIRE(acl::floor(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::floor(FloatType(0.5)) == FloatType(0.0));\n\tREQUIRE(acl::floor(FloatType(2.5)) == FloatType(2.0));\n\tREQUIRE(acl::floor(FloatType(3.0)) == FloatType(3.0));\n\tREQUIRE(acl::floor(FloatType(-0.5)) == FloatType(-1.0));\n\tREQUIRE(acl::floor(FloatType(-2.5)) == FloatType(-3.0));\n\tREQUIRE(acl::floor(FloatType(-3.0)) == FloatType(-3.0));\n\n\tREQUIRE(acl::ceil(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::ceil(FloatType(0.5)) == FloatType(1.0));\n\tREQUIRE(acl::ceil(FloatType(2.5)) == FloatType(3.0));\n\tREQUIRE(acl::ceil(FloatType(3.0)) == FloatType(3.0));\n\tREQUIRE(acl::ceil(FloatType(-0.5)) == FloatType(0.0));\n\tREQUIRE(acl::ceil(FloatType(-2.5)) == FloatType(-2.0));\n\tREQUIRE(acl::ceil(FloatType(-3.0)) == FloatType(-3.0));\n\n\tREQUIRE(clamp(FloatType(0.5), FloatType(0.0), FloatType(1.0)) == FloatType(0.5));\n\tREQUIRE(clamp(FloatType(-0.5), FloatType(0.0), FloatType(1.0)) == FloatType(0.0));\n\tREQUIRE(clamp(FloatType(1.5), FloatType(0.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(acl::abs(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(acl::abs(FloatType(2.0)) == FloatType(2.0));\n\tREQUIRE(acl::abs(FloatType(-2.0)) == FloatType(2.0));\n\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.0), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.000001), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(0.999999), FloatType(0.00001)) == true);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(1.001), FloatType(0.00001)) == false);\n\tREQUIRE(scalar_near_equal(FloatType(1.0), FloatType(0.999), FloatType(0.00001)) == false);\n\n\tREQUIRE(acl::sqrt(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(acl::sqrt(FloatType(0.5)), std::sqrt(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::sqrt(FloatType(32.5)), std::sqrt(FloatType(32.5)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::sqrt_reciprocal(FloatType(0.5)), FloatType(1.0) \/ std::sqrt(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::sqrt_reciprocal(FloatType(32.5)), FloatType(1.0) \/ std::sqrt(FloatType(32.5)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(0.5)), FloatType(1.0 \/ 0.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(32.5)), FloatType(1.0 \/ 32.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(-0.5)), FloatType(1.0 \/ -0.5), threshold));\n\tREQUIRE(scalar_near_equal(acl::reciprocal(FloatType(-32.5)), FloatType(1.0 \/ -32.5), threshold));\n\n\tconst FloatType angles[] = { FloatType(0.0), pi, -pi, half_pi, -half_pi, FloatType(0.5), FloatType(32.5), FloatType(-0.5), FloatType(-32.5) };\n\n\tfor (const FloatType angle : angles)\n\t{\n\t\tREQUIRE(scalar_near_equal(acl::sin(angle), std::sin(angle), threshold));\n\t\tREQUIRE(scalar_near_equal(acl::cos(angle), std::cos(angle), threshold));\n\n\t\tFloatType sin_result;\n\t\tFloatType cos_result;\n\t\tacl::sincos(angle, sin_result, cos_result);\n\t\tREQUIRE(scalar_near_equal(sin_result, std::sin(angle), threshold));\n\t\tREQUIRE(scalar_near_equal(cos_result, std::cos(angle), threshold));\n\t}\n\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-1.0)), std::acos(FloatType(-1.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.75)), std::acos(FloatType(-0.75)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.5)), std::acos(FloatType(-0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(-0.25)), std::acos(-FloatType(0.25)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.0)), std::acos(FloatType(0.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.25)), std::acos(FloatType(0.25)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.5)), std::acos(FloatType(0.5)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(0.75)), std::acos(FloatType(0.75)), threshold));\n\tREQUIRE(scalar_near_equal(acl::acos(FloatType(1.0)), std::acos(FloatType(1.0)), threshold));\n\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-2.0), FloatType(-2.0)), std::atan2(FloatType(-2.0), FloatType(-2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-1.0), FloatType(-2.0)), std::atan2(FloatType(-1.0), FloatType(-2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(-2.0), FloatType(-1.0)), std::atan2(FloatType(-2.0), FloatType(-1.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(2.0), FloatType(2.0)), std::atan2(FloatType(2.0), FloatType(2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(1.0), FloatType(2.0)), std::atan2(FloatType(1.0), FloatType(2.0)), threshold));\n\tREQUIRE(scalar_near_equal(acl::atan2(FloatType(2.0), FloatType(1.0)), std::atan2(FloatType(2.0), FloatType(1.0)), threshold));\n\n\tREQUIRE(acl::min(FloatType(-0.5), FloatType(1.0)) == FloatType(-0.5));\n\tREQUIRE(acl::min(FloatType(1.0), FloatType(-0.5)) == FloatType(-0.5));\n\tREQUIRE(acl::min(FloatType(1.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(acl::max(FloatType(-0.5), FloatType(1.0)) == FloatType(1.0));\n\tREQUIRE(acl::max(FloatType(1.0), FloatType(-0.5)) == FloatType(1.0));\n\tREQUIRE(acl::max(FloatType(1.0), FloatType(1.0)) == FloatType(1.0));\n\n\tREQUIRE(deg2rad(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(90.0)), half_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-90.0)), -half_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(180.0)), pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-180.0)), -pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(360.0)), two_pi, threshold));\n\tREQUIRE(scalar_near_equal(deg2rad(FloatType(-360.0)), -two_pi, threshold));\n\n\tREQUIRE(acl::is_finite(FloatType(0.0)) == true);\n\tREQUIRE(acl::is_finite(FloatType(32.0)) == true);\n\tREQUIRE(acl::is_finite(FloatType(-32.0)) == true);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::infinity()) == false);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::quiet_NaN()) == false);\n\tREQUIRE(acl::is_finite(std::numeric_limits<FloatType>::signaling_NaN()) == false);\n\n\tREQUIRE(symmetric_round(FloatType(-1.75)) == FloatType(-2.0));\n\tREQUIRE(symmetric_round(FloatType(-1.5)) == FloatType(-2.0));\n\tREQUIRE(symmetric_round(FloatType(-1.4999)) == FloatType(-1.0));\n\tREQUIRE(symmetric_round(FloatType(-0.5)) == FloatType(-1.0));\n\tREQUIRE(symmetric_round(FloatType(-0.4999)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.4999)) == FloatType(0.0));\n\tREQUIRE(symmetric_round(FloatType(0.5)) == FloatType(1.0));\n\tREQUIRE(symmetric_round(FloatType(1.4999)) == FloatType(1.0));\n\tREQUIRE(symmetric_round(FloatType(1.5)) == FloatType(2.0));\n\tREQUIRE(symmetric_round(FloatType(1.75)) == FloatType(2.0));\n\n\tREQUIRE(fraction(FloatType(0.0)) == FloatType(0.0));\n\tREQUIRE(fraction(FloatType(1.0)) == FloatType(0.0));\n\tREQUIRE(fraction(FloatType(-1.0)) == FloatType(0.0));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.25)), FloatType(0.25), threshold));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.5)), FloatType(0.5), threshold));\n\tREQUIRE(scalar_near_equal(fraction(FloatType(0.75)), FloatType(0.75), threshold));\n}\n\nTEST_CASE(\"scalar 32 math\", \"[math][scalar]\")\n{\n\ttest_scalar_impl<float>(acl::k_pi_32, 1.0e-6f);\n}\n\nTEST_CASE(\"scalar 64 math\", \"[math][scalar]\")\n{\n\ttest_scalar_impl<double>(acl::k_pi_64, 1.0e-9);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <iostream>\n#include \"log4cpp\/FixedContextCategory.hh\"\n#include \"log4cpp\/Appender.hh\"\n#include \"log4cpp\/OstreamAppender.hh\"\n#include \"log4cpp\/Layout.hh\"\n#include \"log4cpp\/BasicLayout.hh\"\n#include \"log4cpp\/Priority.hh\"\n#include \"log4cpp\/NDC.hh\"\n\nint main(int argc, char** argv) { \n log4cpp::Appender* appender = \n new log4cpp::OstreamAppender(\"default\", &std::cout);\n\n log4cpp::Layout* layout = new log4cpp::BasicLayout();\n appender->setLayout(layout);\n\n log4cpp::Category& root = log4cpp::Category::getRoot();\n root.setAppender(appender);\n root.setPriority(log4cpp::Priority::ERROR);\n \n log4cpp::FixedContextCategory sub1 = \n log4cpp::FixedContextCategory(std::string(\"sub1\"), std::string(\"context1\"));\n\n log4cpp::FixedContextCategory sub1_2 = \n log4cpp::FixedContextCategory(std::string(\"sub1\"), std::string(\"context1_2\"));\n\n log4cpp::FixedContextCategory sub2 = \n log4cpp::FixedContextCategory(std::string(\"sub1.sub2\"), std::string(\"context2\"));\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub1_2.error(\"sub1 error\");\n sub1_2.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n \n log4cpp::Category::getInstance(std::string(\"sub1\")).\n setPriority(log4cpp::Priority::INFO);\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n std::cout << \"priority info\" << std::endl;\n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n sub2.error(\"%s %s %d\", \"test\", \"vform\", 123);\n sub2.warnStream() << \"streamed warn\";\n\n sub2 << log4cpp::Priority::WARN << \"warn2..\" << \"..warn3..value=\" << 0 << \n log4cpp::CategoryStream::ENDLINE << \"..warn4\";\n\n log4cpp::Category::shutdown();\n\n return 0;\n}\n<commit_msg>Use contructor for FixedContextCategory instead of assignment.<commit_after>#include <stdio.h>\n#include <iostream>\n#include \"log4cpp\/FixedContextCategory.hh\"\n#include \"log4cpp\/Appender.hh\"\n#include \"log4cpp\/OstreamAppender.hh\"\n#include \"log4cpp\/Layout.hh\"\n#include \"log4cpp\/BasicLayout.hh\"\n#include \"log4cpp\/Priority.hh\"\n#include \"log4cpp\/NDC.hh\"\n\nint main(int argc, char** argv) { \n log4cpp::Appender* appender = \n new log4cpp::OstreamAppender(\"default\", &std::cout);\n\n log4cpp::Layout* layout = new log4cpp::BasicLayout();\n appender->setLayout(layout);\n\n log4cpp::Category& root = log4cpp::Category::getRoot();\n root.setAppender(appender);\n root.setPriority(log4cpp::Priority::ERROR);\n \n log4cpp::FixedContextCategory sub1(std::string(\"sub1\"), std::string(\"context1\"));\n\n log4cpp::FixedContextCategory sub1_2(std::string(\"sub1\"), std::string(\"context1_2\"));\n\n log4cpp::FixedContextCategory sub2(std::string(\"sub1.sub2\"), std::string(\"context2\"));\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub1_2.error(\"sub1 error\");\n sub1_2.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n \n log4cpp::Category::getInstance(std::string(\"sub1\")).\n setPriority(log4cpp::Priority::INFO);\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n std::cout << \"priority info\" << std::endl;\n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n sub2.error(\"%s %s %d\", \"test\", \"vform\", 123);\n sub2.warnStream() << \"streamed warn\";\n\n sub2 << log4cpp::Priority::WARN << \"warn2..\" << \"..warn3..value=\" << 0 << \n log4cpp::CategoryStream::ENDLINE << \"..warn4\";\n\n log4cpp::Category::shutdown();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace mfem;\n\nnamespace ea_kernels\n{\n\nvoid velocity_function(const Vector &x, Vector &v)\n{\n int dim = x.Size();\n switch (dim)\n {\n case 1: v(0) = 1.0; break;\n case 2: v(0) = x(1); v(1) = -x(0); break;\n case 3: v(0) = x(1); v(1) = -x(0); v(2) = x(0); break;\n }\n}\n\nvoid AddConvectionIntegrators(BilinearForm &k, VectorCoefficient &velocity,\n bool dg)\n{\n k.AddDomainIntegrator(new ConvectionIntegrator(velocity, -1.0));\n\n if (dg)\n {\n k.AddInteriorFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n k.AddBdrFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n }\n}\n\nvoid test_ea(Mesh &&mesh, int order, bool dg, const int pb)\n{\n mesh.EnsureNodes();\n mesh.SetCurvature(mesh.GetNodalFESpace()->GetOrder(0));\n int dim = mesh.Dimension();\n\n FiniteElementCollection *fec;\n if (dg)\n {\n fec = new L2_FECollection(order, dim, BasisType::GaussLobatto);\n }\n else\n {\n fec = new H1_FECollection(order, dim);\n }\n\n FiniteElementSpace fespace(&mesh, fec);\n\n BilinearForm k_ea(&fespace);\n BilinearForm k_fa(&fespace);\n\n ConstantCoefficient one(1.0);\n VectorFunctionCoefficient vel_coeff(dim, velocity_function);\n\n if (pb==0)\/\/ Mass\n {\n k_fa.AddDomainIntegrator(new MassIntegrator(one));\n k_ea.AddDomainIntegrator(new MassIntegrator(one));\n }\n else if(pb==1)\/\/ Convection\n {\n AddConvectionIntegrators(k_fa, vel_coeff, dg);\n AddConvectionIntegrators(k_ea, vel_coeff, dg);\n }\n else if(pb==2)\/\/ Diffusion\n {\n k_fa.AddDomainIntegrator(new DiffusionIntegrator(one));\n k_ea.AddDomainIntegrator(new DiffusionIntegrator(one));\n }\n\n k_fa.Assemble();\n k_fa.Finalize();\n\n k_ea.SetAssemblyLevel(AssemblyLevel::ELEMENT);\n k_ea.Assemble();\n\n GridFunction x(&fespace), y_fa(&fespace), y_ea(&fespace);\n\n x.Randomize(1);\n\n k_fa.Mult(x,y_fa);\n k_ea.Mult(x,y_ea);\n\n y_ea -= y_fa;\n\n REQUIRE(y_ea.Norml2() < 1.e-12);\n\n delete fec;\n}\n\n\/\/Basic unit test for convection\nTEST_CASE(\"Element Assembly\", \"[ElementAssembly]\")\n{\n for(int pb : {0, 1, 2})\n {\n for (bool dg : {true, false})\n {\n SECTION(\"2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_ea(Mesh(\"..\/..\/data\/periodic-square.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1), order, dg, pb);\n }\n }\n\n SECTION(\"3D\")\n {\n int order = 2;\n test_ea(Mesh(\"..\/..\/data\/periodic-cube.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1), order, dg, pb);\n }\n }\n\n \/\/ Test AMR cases (DG not implemented)\n SECTION(\"AMR 2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_ea(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1), order, false, 0);\n }\n }\n SECTION(\"AMR 3D\")\n {\n int order = 2;\n test_ea(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1), order, false, 0);\n }\n }\n}\/\/test case\n\n}\/\/ namespace pa_kernels\n<commit_msg>make style<commit_after>\/\/ Copyright (c) 2010-2020, Lawrence Livermore National Security, LLC. Produced\n\/\/ at the Lawrence Livermore National Laboratory. All Rights reserved. See files\n\/\/ LICENSE and NOTICE for details. LLNL-CODE-806117.\n\/\/\n\/\/ This file is part of the MFEM library. For more information and source code\n\/\/ availability visit https:\/\/mfem.org.\n\/\/\n\/\/ MFEM is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the BSD-3 license. We welcome feedback and contributions, see file\n\/\/ CONTRIBUTING.md for details.\n\n#include \"catch.hpp\"\n#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\nusing namespace mfem;\n\nnamespace ea_kernels\n{\n\nvoid velocity_function(const Vector &x, Vector &v)\n{\n int dim = x.Size();\n switch (dim)\n {\n case 1: v(0) = 1.0; break;\n case 2: v(0) = x(1); v(1) = -x(0); break;\n case 3: v(0) = x(1); v(1) = -x(0); v(2) = x(0); break;\n }\n}\n\nvoid AddConvectionIntegrators(BilinearForm &k, VectorCoefficient &velocity,\n bool dg)\n{\n k.AddDomainIntegrator(new ConvectionIntegrator(velocity, -1.0));\n\n if (dg)\n {\n k.AddInteriorFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n k.AddBdrFaceIntegrator(\n new TransposeIntegrator(new DGTraceIntegrator(velocity, 1.0, -0.5)));\n }\n}\n\nvoid test_ea(Mesh &&mesh, int order, bool dg, const int pb)\n{\n mesh.EnsureNodes();\n mesh.SetCurvature(mesh.GetNodalFESpace()->GetOrder(0));\n int dim = mesh.Dimension();\n\n FiniteElementCollection *fec;\n if (dg)\n {\n fec = new L2_FECollection(order, dim, BasisType::GaussLobatto);\n }\n else\n {\n fec = new H1_FECollection(order, dim);\n }\n\n FiniteElementSpace fespace(&mesh, fec);\n\n BilinearForm k_ea(&fespace);\n BilinearForm k_fa(&fespace);\n\n ConstantCoefficient one(1.0);\n VectorFunctionCoefficient vel_coeff(dim, velocity_function);\n\n if (pb==0) \/\/ Mass\n {\n k_fa.AddDomainIntegrator(new MassIntegrator(one));\n k_ea.AddDomainIntegrator(new MassIntegrator(one));\n }\n else if(pb==1) \/\/ Convection\n {\n AddConvectionIntegrators(k_fa, vel_coeff, dg);\n AddConvectionIntegrators(k_ea, vel_coeff, dg);\n }\n else if(pb==2) \/\/ Diffusion\n {\n k_fa.AddDomainIntegrator(new DiffusionIntegrator(one));\n k_ea.AddDomainIntegrator(new DiffusionIntegrator(one));\n }\n\n k_fa.Assemble();\n k_fa.Finalize();\n\n k_ea.SetAssemblyLevel(AssemblyLevel::ELEMENT);\n k_ea.Assemble();\n\n GridFunction x(&fespace), y_fa(&fespace), y_ea(&fespace);\n\n x.Randomize(1);\n\n k_fa.Mult(x,y_fa);\n k_ea.Mult(x,y_ea);\n\n y_ea -= y_fa;\n\n REQUIRE(y_ea.Norml2() < 1.e-12);\n\n delete fec;\n}\n\n\/\/Basic unit test for convection\nTEST_CASE(\"Element Assembly\", \"[ElementAssembly]\")\n{\n for (int pb : {0, 1, 2})\n {\n for (bool dg : {true, false})\n {\n SECTION(\"2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_ea(Mesh(\"..\/..\/data\/periodic-square.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/periodic-hexagon.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/star-q3.mesh\", 1, 1), order, dg, pb);\n }\n }\n\n SECTION(\"3D\")\n {\n int order = 2;\n test_ea(Mesh(\"..\/..\/data\/periodic-cube.mesh\", 1, 1), order, dg, pb);\n test_ea(Mesh(\"..\/..\/data\/fichera-q3.mesh\", 1, 1), order, dg, pb);\n }\n }\n\n \/\/ Test AMR cases (DG not implemented)\n SECTION(\"AMR 2D\")\n {\n for (int order : {2, 3, 4})\n {\n test_ea(Mesh(\"..\/..\/data\/amr-quad.mesh\", 1, 1), order, false, 0);\n }\n }\n SECTION(\"AMR 3D\")\n {\n int order = 2;\n test_ea(Mesh(\"..\/..\/data\/fichera-amr.mesh\", 1, 1), order, false, 0);\n }\n }\n}\/\/test case\n\n}\/\/ namespace pa_kernels\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <eosio\/chain\/action.hpp>\n#include <eosio\/chain\/action_receipt.hpp>\n#include <eosio\/chain\/block.hpp>\n\nnamespace eosio { namespace chain {\n\n struct account_delta {\n account_delta( const account_name& n, int64_t d):account(n),delta(d){}\n account_delta(){}\n\n account_name account;\n int64_t delta = 0;\n\n friend bool operator<( const account_delta& lhs, const account_delta& rhs ) { return lhs.account < rhs.account; }\n };\n\n struct transaction_trace;\n using transaction_trace_ptr = std::shared_ptr<transaction_trace>;\n\n struct action_trace {\n action_trace( const transaction_trace& trace, const action& act, account_name receiver, bool context_free,\n uint32_t action_ordinal, uint32_t creator_action_ordinal,\n uint32_t closest_unnotified_ancestor_action_ordinal );\n action_trace( const transaction_trace& trace, action&& act, account_name receiver, bool context_free,\n uint32_t action_ordinal, uint32_t creator_action_ordinal,\n uint32_t closest_unnotified_ancestor_action_ordinal );\n action_trace(){}\n\n fc::unsigned_int action_ordinal;\n fc::unsigned_int creator_action_ordinal;\n fc::unsigned_int closest_unnotified_ancestor_action_ordinal;\n fc::optional<action_receipt> receipt;\n action_name receiver;\n action act;\n bool context_free = false;\n fc::microseconds elapsed;\n string console;\n transaction_id_type trx_id; \/\/\/< the transaction that generated this action\n uint32_t block_num = 0;\n block_timestamp_type block_time;\n fc::optional<block_id_type> producer_block_id;\n flat_set<account_delta> account_ram_deltas;\n fc::optional<fc::exception> except;\n fc::optional<uint64_t> error_code;\n std::vector<char> return_value;\n };\n\n struct transaction_trace {\n transaction_id_type id;\n uint32_t block_num = 0;\n block_timestamp_type block_time;\n fc::optional<block_id_type> producer_block_id;\n fc::optional<transaction_receipt_header> receipt;\n fc::microseconds elapsed;\n uint64_t net_usage = 0;\n bool scheduled = false;\n vector<action_trace> action_traces;\n fc::optional<account_delta> account_ram_delta;\n\n transaction_trace_ptr failed_dtrx_trace;\n fc::optional<fc::exception> except;\n fc::optional<uint64_t> error_code;\n std::exception_ptr except_ptr;\n };\n\n #define RAM_EVENT_ID( FORMAT, ... ) \\\n fc::format_string( FORMAT, fc::mutable_variant_object()__VA_ARGS__ )\n\n struct ram_trace {\n public:\n ram_trace(uint32_t action_id, const char* event_id, const char* family, const char* operation, const char* legacy_tag)\n :action_id(action_id),event_id(event_id),family(family),operation(operation),legacy_tag(legacy_tag)\n {}\n\n uint32_t action_id = 0;\n const char* event_id = \"generic\";\n const char* family = \"generic\";\n const char* operation = \"generic\";\n const char* legacy_tag = \"generic\";\n\n private:\n ram_trace(uint32_t action_id)\n :action_id(action_id)\n {}\n\n friend ram_trace generic_ram_trace(uint32_t);\n };\n\n inline ram_trace generic_ram_trace(uint32_t action_id) {\n return {action_id};\n }\n\n \/\/ struct ram_trace {\n \/\/ public:\n \/\/ ram_trace(uint32_t action_id, const char* event_id, const char* family, const char* operation, const char* legacy_tag);\n\n \/\/ inline uint32_t get_action_id() const { return action_id; }\n \/\/ inline const char* get_event_id() const { return event_id; }\n \/\/ inline const char* get_family() const { return family; }\n \/\/ inline const char* get_operation() const { return operation; }\n \/\/ inline const char* get_legacy_tag() const { return legacy_tag; }\n\n \/\/ protected:\n \/\/ ram_trace();\n\n \/\/ private:\n \/\/ uint32_t action_id;\n \/\/ const char* event_id;\n \/\/ const char* family;\n \/\/ const char* operation;\n \/\/ const char* legacy_tag;\n \/\/ };\n\n \/\/ struct generic_ram_trace: public ram_trace {\n \/\/ generic_ram_trace(): ram_trace() {}\n \/\/ };\n\n} } \/\/\/ namespace eosio::chain\n\nFC_REFLECT( eosio::chain::account_delta,\n (account)(delta) )\n\nFC_REFLECT( eosio::chain::action_trace,\n (action_ordinal)(creator_action_ordinal)(closest_unnotified_ancestor_action_ordinal)(receipt)\n (receiver)(act)(context_free)(elapsed)(console)(trx_id)(block_num)(block_time)\n (producer_block_id)(account_ram_deltas)(except)(error_code)(return_value) )\n\nFC_REFLECT( eosio::chain::transaction_trace, (id)(block_num)(block_time)(producer_block_id)\n (receipt)(elapsed)(net_usage)(scheduled)\n (action_traces)(account_ram_delta)(failed_dtrx_trace)(except)(error_code) )\n<commit_msg>Removed left over commented code<commit_after>#pragma once\n\n#include <eosio\/chain\/action.hpp>\n#include <eosio\/chain\/action_receipt.hpp>\n#include <eosio\/chain\/block.hpp>\n\nnamespace eosio { namespace chain {\n\n struct account_delta {\n account_delta( const account_name& n, int64_t d):account(n),delta(d){}\n account_delta(){}\n\n account_name account;\n int64_t delta = 0;\n\n friend bool operator<( const account_delta& lhs, const account_delta& rhs ) { return lhs.account < rhs.account; }\n };\n\n struct transaction_trace;\n using transaction_trace_ptr = std::shared_ptr<transaction_trace>;\n\n struct action_trace {\n action_trace( const transaction_trace& trace, const action& act, account_name receiver, bool context_free,\n uint32_t action_ordinal, uint32_t creator_action_ordinal,\n uint32_t closest_unnotified_ancestor_action_ordinal );\n action_trace( const transaction_trace& trace, action&& act, account_name receiver, bool context_free,\n uint32_t action_ordinal, uint32_t creator_action_ordinal,\n uint32_t closest_unnotified_ancestor_action_ordinal );\n action_trace(){}\n\n fc::unsigned_int action_ordinal;\n fc::unsigned_int creator_action_ordinal;\n fc::unsigned_int closest_unnotified_ancestor_action_ordinal;\n fc::optional<action_receipt> receipt;\n action_name receiver;\n action act;\n bool context_free = false;\n fc::microseconds elapsed;\n string console;\n transaction_id_type trx_id; \/\/\/< the transaction that generated this action\n uint32_t block_num = 0;\n block_timestamp_type block_time;\n fc::optional<block_id_type> producer_block_id;\n flat_set<account_delta> account_ram_deltas;\n fc::optional<fc::exception> except;\n fc::optional<uint64_t> error_code;\n std::vector<char> return_value;\n };\n\n struct transaction_trace {\n transaction_id_type id;\n uint32_t block_num = 0;\n block_timestamp_type block_time;\n fc::optional<block_id_type> producer_block_id;\n fc::optional<transaction_receipt_header> receipt;\n fc::microseconds elapsed;\n uint64_t net_usage = 0;\n bool scheduled = false;\n vector<action_trace> action_traces;\n fc::optional<account_delta> account_ram_delta;\n\n transaction_trace_ptr failed_dtrx_trace;\n fc::optional<fc::exception> except;\n fc::optional<uint64_t> error_code;\n std::exception_ptr except_ptr;\n };\n\n #define RAM_EVENT_ID( FORMAT, ... ) \\\n fc::format_string( FORMAT, fc::mutable_variant_object()__VA_ARGS__ )\n\n struct ram_trace {\n public:\n ram_trace(uint32_t action_id, const char* event_id, const char* family, const char* operation, const char* legacy_tag)\n :action_id(action_id),event_id(event_id),family(family),operation(operation),legacy_tag(legacy_tag)\n {}\n\n uint32_t action_id = 0;\n const char* event_id = \"generic\";\n const char* family = \"generic\";\n const char* operation = \"generic\";\n const char* legacy_tag = \"generic\";\n\n private:\n ram_trace(uint32_t action_id)\n :action_id(action_id)\n {}\n\n friend ram_trace generic_ram_trace(uint32_t);\n };\n\n inline ram_trace generic_ram_trace(uint32_t action_id) {\n return {action_id};\n }\n\n} } \/\/\/ namespace eosio::chain\n\nFC_REFLECT( eosio::chain::account_delta,\n (account)(delta) )\n\nFC_REFLECT( eosio::chain::action_trace,\n (action_ordinal)(creator_action_ordinal)(closest_unnotified_ancestor_action_ordinal)(receipt)\n (receiver)(act)(context_free)(elapsed)(console)(trx_id)(block_num)(block_time)\n (producer_block_id)(account_ram_deltas)(except)(error_code)(return_value) )\n\nFC_REFLECT( eosio::chain::transaction_trace, (id)(block_num)(block_time)(producer_block_id)\n (receipt)(elapsed)(net_usage)(scheduled)\n (action_traces)(account_ram_delta)(failed_dtrx_trace)(except)(error_code) )\n<|endoftext|>"} {"text":"<commit_before>#include <type\/class.hh>\n\nnamespace type\n{\n Class::Class(const std::string& name)\n : name_(name)\n {}\n\n Class::~Class()\n {}\n\n const std::string& Class::name_get() const\n {\n return name_;\n }\n\n ast::Ast* Class::component_get(const std::string& name)\n {\n return content_.at(name);\n }\n\n bool Class::component_add(const std::string& name, ast::Ast* dec)\n {\n \/\/ Component already exists\n if (!content_.at(name))\n return false;\n\n content_[name] = dec;\n\n return true;\n }\n\n std::ostream& Class::dump(std::ostream& o) const\n {\n o << \"Class (\" << name_ << \")\";\n\n return o;\n }\n\n std::string Class::cpp_type() const\n {\n return name_ + \"*\";\n }\n} \/\/ namespace type\n<commit_msg>[TYPE] Correct unexpected throw on class type<commit_after>#include <type\/class.hh>\n\nnamespace type\n{\n Class::Class(const std::string& name)\n : name_(name)\n {}\n\n Class::~Class()\n {}\n\n const std::string& Class::name_get() const\n {\n return name_;\n }\n\n ast::Ast* Class::component_get(const std::string& name)\n {\n return content_[name];\n }\n\n bool Class::component_add(const std::string& name, ast::Ast* dec)\n {\n \/\/ Component already exists\n if (!content_[name])\n return false;\n\n content_[name] = dec;\n\n return true;\n }\n\n std::ostream& Class::dump(std::ostream& o) const\n {\n o << \"Class (\" << name_ << \")\";\n\n return o;\n }\n\n std::string Class::cpp_type() const\n {\n return name_ + \"*\";\n }\n} \/\/ namespace type\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\n#include \"base64.h\"\nusing namespace std;\nusing namespace dev;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent = \" \";\n\t\tbool hexInts = false;\n\t\tbool forceString = false;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = false;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt())\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire)));\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData())\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << toHex(_d.data());\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\tif (encoding == Encoding::Auto)\n\t{\n\t\tencoding = Encoding::Hex;\n\t\tfor (char b: in)\n\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t{\n\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t{\n\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t}\n\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t{\n\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tbytes b;\n\tswitch (encoding)\n\t{\n\tcase Encoding::Hex:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromHex(s);\n\t\tbreak;\n\t}\n\tcase Encoding::Base64:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = base64_decode(s);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tswap(b, in);\n\t\tbreak;\n\t}\n\n\ttry\n\t{\n\tRLP rlp(b);\n\tswitch (mode)\n\t{\n\tcase Mode::ListArchive:\n\t{\n\t\tif (!rlp.isList())\n\t\t{\n\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\texit(1);\n\t\t}\n\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\tfor (auto i: rlp)\n\t\t{\n\t\t\tif (!i.isData())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\tif (!lenience)\n\t\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t}\n\t\tbreak;\n\t}\n\tcase Mode::ExtractArchive:\n\t{\n\t\tif (!rlp.isList())\n\t\t{\n\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\texit(1);\n\t\t}\n\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\tfor (auto i: rlp)\n\t\t{\n\t\t\tif (!i.isData())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\tif (!lenience)\n\t\t\t\t\texit(1);\n\t\t\t}\n\t\t\tofstream fout;\n\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t}\n\t\tbreak;\n\t}\n\tcase Mode::Render:\n\t{\n\t\tRLPStreamer s(cout, prefs);\n\t\ts.output(rlp);\n\t\tcout << endl;\n\t\tbreak;\n\t}\n\tdefault:;\n\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<commit_msg>Improvements to help text of RLP.<commit_after>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include <libdevcore\/Common.h>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\n#include \"base64.h\"\nusing namespace std;\nusing namespace dev;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -r,--render Render the given RLP. Options:\" << endl\n\t\t<< \" --indent <string> Use string as the level indentation (default ' ').\" << endl\n\t\t<< \" --hex-ints Render integers in hex.\" << endl\n\t\t<< \" --force-string Force all data to be rendered as C-style strings.\" << endl\n\t\t<< \" --force-escape When rendering as C-style strings, force all characters to be escaped.\" << endl\n\t\t<< \" --force-hex Force all data to be rendered as raw hex.\" << endl\n\t\t<< \" -l,--list-archive List the items in the RLP list by hash and size.\" << endl\n\t\t<< \" -e,--extract-archive Extract all items in the RLP list, named by hash.\" << endl\n\t\t<< \"General options:\" << endl\n\t\t<< \" -L,--lenience Try not to bomb out early if possible.\" << endl\n\t\t<< \" -x,--hex,--base-16 Treat input RLP as hex encoded data.\" << endl\n\t\t<< \" --64,--base-64 Treat input RLP as base-64 encoded data.\" << endl\n\t\t<< \" -b,--bin,--base-256 Treat input RLP as raw binary data.\" << endl\n\t\t<< \" -h,--help Print this help message and exit.\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent = \" \";\n\t\tbool hexInts = false;\n\t\tbool forceString = false;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = false;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt())\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire), 1), 1);\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData())\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << toHex(_d.data());\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\tif (encoding == Encoding::Auto)\n\t{\n\t\tencoding = Encoding::Hex;\n\t\tfor (char b: in)\n\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t{\n\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t{\n\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t}\n\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t{\n\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tbytes b;\n\tswitch (encoding)\n\t{\n\tcase Encoding::Hex:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromHex(s);\n\t\tbreak;\n\t}\n\tcase Encoding::Base64:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = base64_decode(s);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tswap(b, in);\n\t\tbreak;\n\t}\n\n\ttry\n\t{\n\tRLP rlp(b);\n\tswitch (mode)\n\t{\n\tcase Mode::ListArchive:\n\t{\n\t\tif (!rlp.isList())\n\t\t{\n\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\texit(1);\n\t\t}\n\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\tfor (auto i: rlp)\n\t\t{\n\t\t\tif (!i.isData())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\tif (!lenience)\n\t\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t}\n\t\tbreak;\n\t}\n\tcase Mode::ExtractArchive:\n\t{\n\t\tif (!rlp.isList())\n\t\t{\n\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\texit(1);\n\t\t}\n\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\tfor (auto i: rlp)\n\t\t{\n\t\t\tif (!i.isData())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\tif (!lenience)\n\t\t\t\t\texit(1);\n\t\t\t}\n\t\t\tofstream fout;\n\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t}\n\t\tbreak;\n\t}\n\tcase Mode::Render:\n\t{\n\t\tRLPStreamer s(cout, prefs);\n\t\ts.output(rlp);\n\t\tcout << endl;\n\t\tbreak;\n\t}\n\tdefault:;\n\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"formeditorplugin.h\"\n\n#if QT_VERSION < 0x050000\n#include <QtTest>\n#else\n#include \"formeditorw.h\"\n\n#include <coreplugin\/testdatadir.h>\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <cpptools\/cppmodelmanager.h>\n#include <cpptools\/cpptoolseditorsupport.h>\n\n#include <cplusplus\/CppDocument.h>\n#include <cplusplus\/Overview.h>\n#include <utils\/fileutils.h>\n\n#include <QDesignerFormEditorInterface>\n#include <QDesignerIntegrationInterface>\n#include <QStringList>\n#include <QtTest>\n\nusing namespace Core;\nusing namespace Core::Internal::Tests;\nusing namespace CppTools;\nusing namespace CPlusPlus;\nusing namespace Designer;\nusing namespace Designer::Internal;\n\nnamespace {\n\nclass MyTestDataDir : public Core::Internal::Tests::TestDataDir {\npublic:\n MyTestDataDir(const QString &dir)\n : TestDataDir(QLatin1String(SRCDIR \"\/..\/..\/..\/tests\/designer\/\") + dir)\n {}\n};\n\nQString expectedContentsForFile(const QString &filePath)\n{\n QFileInfo fi(filePath);\n const QString referenceFileName = QLatin1String(\"reference_\") + fi.fileName();\n const QString referenceFilePath = fi.dir().absoluteFilePath(referenceFileName);\n\n Utils::FileReader fileReader;\n const bool isFetchOk = fileReader.fetch(referenceFilePath);\n if (isFetchOk)\n return QString::fromUtf8(fileReader.data());\n return QString();\n}\n\nclass GoToSlotTest\n{\npublic:\n GoToSlotTest(const QStringList &files)\n : m_files(files)\n , m_modelManager(CppModelManagerInterface::instance())\n {\n QCOMPARE(files.size(), 3);\n cleanup();\n }\n ~GoToSlotTest() { cleanup(); }\n\n void run() const\n {\n QList<TextEditor::BaseTextEditor *> editors;\n foreach (const QString &file, m_files) {\n IEditor *editor = EditorManager::openEditor(file);\n TextEditor::BaseTextEditor *e = qobject_cast<TextEditor::BaseTextEditor *>(editor);\n QVERIFY(e);\n editors << e;\n }\n TextEditor::BaseTextEditor *cppFileEditor = editors.at(0);\n TextEditor::BaseTextEditor *hFileEditor = editors.at(1);\n\n const QString cppFile = m_files.at(0);\n const QString hFile = m_files.at(1);\n\n QCOMPARE(EditorManager::documentModel()->openedDocuments().size(), m_files.size());\n while (!m_modelManager->snapshot().contains(cppFile)\n || !m_modelManager->snapshot().contains(hFile)) {\n QApplication::processEvents();\n }\n\n \/\/ Execute \"Go To Slot\"\n FormEditorW *few = FormEditorW::instance();\n QDesignerIntegrationInterface *integration = few->designerEditor()->integration();\n QVERIFY(integration);\n integration->emitNavigateToSlot(QLatin1String(\"pushButton\"), QLatin1String(\"clicked()\"),\n QStringList());\n\n QCOMPARE(EditorManager::currentDocument()->filePath(), cppFile);\n QVERIFY(EditorManager::currentDocument()->isModified());\n\n \/\/ Wait for updated documents\n foreach (TextEditor::BaseTextEditor *editor, editors) {\n if (CppEditorSupport *editorSupport = m_modelManager->cppEditorSupport(editor)) {\n while (editorSupport->isUpdatingDocument())\n QApplication::processEvents();\n }\n }\n\n \/\/ Compare\n QCOMPARE(cppFileEditor->textDocument()->contents(), expectedContentsForFile(cppFile));\n QCOMPARE(hFileEditor->textDocument()->contents(), expectedContentsForFile(hFile));\n }\n\nprivate:\n void cleanup()\n {\n EditorManager::closeAllEditors(\/*askAboutModifiedEditors =*\/ false);\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n QStringList m_files;\n CppModelManagerInterface *m_modelManager;\n};\n\n} \/\/ anonymous namespace\n#endif\n\n\/\/\/ Check: Executes \"Go To Slot...\" on a QPushButton in a *.ui file and checks if the respective\n\/\/\/ header and source files are updated.\nvoid Designer::Internal::FormEditorPlugin::test_gotoslot()\n{\n#if QT_VERSION >= 0x050000\n QFETCH(QStringList, files);\n\n GoToSlotTest test(files);\n test.run();\n#else\n QSKIP(\"Available only with >= Qt5\", SkipSingle);\n#endif\n}\n\nvoid FormEditorPlugin::test_gotoslot_data()\n{\n typedef QLatin1String _;\n QTest::addColumn<QStringList>(\"files\");\n\n MyTestDataDir testData(QLatin1String(\"gotoslot_withoutProject\"));\n QTest::newRow(\"withoutProject\")\n << (QStringList()\n << testData.file(_(\"form.cpp\"))\n << testData.file(_(\"form.h\"))\n << testData.file(_(\"form.ui\")));\n}\n<commit_msg>Designer: Tests: Fix compilation with Qt4<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"formeditorplugin.h\"\n\n#if QT_VERSION < 0x050000\n#include <QtTest>\n#else\n#include \"formeditorw.h\"\n\n#include <coreplugin\/testdatadir.h>\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <cpptools\/cppmodelmanager.h>\n#include <cpptools\/cpptoolseditorsupport.h>\n\n#include <cplusplus\/CppDocument.h>\n#include <cplusplus\/Overview.h>\n#include <utils\/fileutils.h>\n\n#include <QDesignerFormEditorInterface>\n#include <QDesignerIntegrationInterface>\n#include <QStringList>\n#include <QtTest>\n\nusing namespace Core;\nusing namespace Core::Internal::Tests;\nusing namespace CppTools;\nusing namespace CPlusPlus;\nusing namespace Designer;\nusing namespace Designer::Internal;\n\nnamespace {\n\nclass MyTestDataDir : public Core::Internal::Tests::TestDataDir {\npublic:\n MyTestDataDir(const QString &dir)\n : TestDataDir(QLatin1String(SRCDIR \"\/..\/..\/..\/tests\/designer\/\") + dir)\n {}\n};\n\nQString expectedContentsForFile(const QString &filePath)\n{\n QFileInfo fi(filePath);\n const QString referenceFileName = QLatin1String(\"reference_\") + fi.fileName();\n const QString referenceFilePath = fi.dir().absoluteFilePath(referenceFileName);\n\n Utils::FileReader fileReader;\n const bool isFetchOk = fileReader.fetch(referenceFilePath);\n if (isFetchOk)\n return QString::fromUtf8(fileReader.data());\n return QString();\n}\n\nclass GoToSlotTest\n{\npublic:\n GoToSlotTest(const QStringList &files)\n : m_files(files)\n , m_modelManager(CppModelManagerInterface::instance())\n {\n QCOMPARE(files.size(), 3);\n cleanup();\n }\n ~GoToSlotTest() { cleanup(); }\n\n void run() const\n {\n QList<TextEditor::BaseTextEditor *> editors;\n foreach (const QString &file, m_files) {\n IEditor *editor = EditorManager::openEditor(file);\n TextEditor::BaseTextEditor *e = qobject_cast<TextEditor::BaseTextEditor *>(editor);\n QVERIFY(e);\n editors << e;\n }\n TextEditor::BaseTextEditor *cppFileEditor = editors.at(0);\n TextEditor::BaseTextEditor *hFileEditor = editors.at(1);\n\n const QString cppFile = m_files.at(0);\n const QString hFile = m_files.at(1);\n\n QCOMPARE(EditorManager::documentModel()->openedDocuments().size(), m_files.size());\n while (!m_modelManager->snapshot().contains(cppFile)\n || !m_modelManager->snapshot().contains(hFile)) {\n QApplication::processEvents();\n }\n\n \/\/ Execute \"Go To Slot\"\n FormEditorW *few = FormEditorW::instance();\n QDesignerIntegrationInterface *integration = few->designerEditor()->integration();\n QVERIFY(integration);\n integration->emitNavigateToSlot(QLatin1String(\"pushButton\"), QLatin1String(\"clicked()\"),\n QStringList());\n\n QCOMPARE(EditorManager::currentDocument()->filePath(), cppFile);\n QVERIFY(EditorManager::currentDocument()->isModified());\n\n \/\/ Wait for updated documents\n foreach (TextEditor::BaseTextEditor *editor, editors) {\n if (CppEditorSupport *editorSupport = m_modelManager->cppEditorSupport(editor)) {\n while (editorSupport->isUpdatingDocument())\n QApplication::processEvents();\n }\n }\n\n \/\/ Compare\n QCOMPARE(cppFileEditor->textDocument()->contents(), expectedContentsForFile(cppFile));\n QCOMPARE(hFileEditor->textDocument()->contents(), expectedContentsForFile(hFile));\n }\n\nprivate:\n void cleanup()\n {\n EditorManager::closeAllEditors(\/*askAboutModifiedEditors =*\/ false);\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n QStringList m_files;\n CppModelManagerInterface *m_modelManager;\n};\n\n} \/\/ anonymous namespace\n#endif\n\n\/\/\/ Check: Executes \"Go To Slot...\" on a QPushButton in a *.ui file and checks if the respective\n\/\/\/ header and source files are updated.\nvoid Designer::Internal::FormEditorPlugin::test_gotoslot()\n{\n#if QT_VERSION >= 0x050000\n QFETCH(QStringList, files);\n\n GoToSlotTest test(files);\n test.run();\n#else\n QSKIP(\"Available only with >= Qt5\", SkipSingle);\n#endif\n}\n\nvoid Designer::Internal::FormEditorPlugin::test_gotoslot_data()\n{\n#if QT_VERSION >= 0x050000\n typedef QLatin1String _;\n QTest::addColumn<QStringList>(\"files\");\n\n MyTestDataDir testData(QLatin1String(\"gotoslot_withoutProject\"));\n QTest::newRow(\"withoutProject\")\n << (QStringList()\n << testData.file(_(\"form.cpp\"))\n << testData.file(_(\"form.h\"))\n << testData.file(_(\"form.ui\")));\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/**@file Logical Channel. *\/\n\n\/*\n* Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.\n* Copyright 2010 Kestrel Signal Processing, Inc.\n* Copyright 2011 Range Networks, Inc.\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n\n\n#include \"GSML3RRElements.h\"\n#include \"GSML3Message.h\"\n#include \"GSML3RRMessages.h\"\n#include \"GSMLogicalChannel.h\"\n#include \"GSMConfig.h\"\n\n#include <TransactionTable.h>\n#include <SMSControl.h>\n#include <ControlCommon.h>\n\n#include <Logger.h>\n#undef WARNING\n\nusing namespace std;\nusing namespace GSM;\n\n\n\nvoid LogicalChannel::open()\n{\n\tLOG(INFO);\n\tif (mSACCH) mSACCH->open();\n\tif (mL1) mL1->open();\n\tfor (int s=0; s<4; s++) {\n\t\tif (mL2[s]) mL2[s]->open();\n\t}\n\t\/\/ Empty any stray transactions in the FIFO from the SIP layer.\n\twhile (true) {\n\t\tControl::TransactionEntry *trans = mTransactionFIFO.readNoBlock();\n\t\tif (!trans) break;\n\t\tLOG(WARNING) << \"flushing stray transaction \" << *trans;\n\t}\n}\n\n\nvoid LogicalChannel::connect()\n{\n\tmMux.downstream(mL1);\n\tif (mL1) mL1->upstream(&mMux);\n\tfor (int s=0; s<4; s++) {\n\t\tmMux.upstream(mL2[s],s);\n\t\tif (mL2[s]) mL2[s]->downstream(&mMux);\n\t}\n}\n\n\nvoid LogicalChannel::downstream(ARFCNManager* radio)\n{\n\tassert(mL1);\n\tmL1->downstream(radio);\n\tif (mSACCH) mSACCH->downstream(radio);\n}\n\n\n\n\/\/ Serialize and send an L3Message with a given primitive.\nvoid LogicalChannel::send(const L3Message& msg,\n\t\tconst GSM::Primitive& prim,\n\t\tunsigned SAPI)\n{\n\tLOG(INFO) << \"L3 SAP\" << SAPI << \" sending \" << msg;\n\tsend(L3Frame(msg,prim), SAPI);\n}\n\n\n\n\nCCCHLogicalChannel::CCCHLogicalChannel(const TDMAMapping& wMapping)\n\t:mRunning(false)\n{\n\tmL1 = new CCCHL1FEC(wMapping);\n\tmL2[0] = new CCCHL2;\n\tconnect();\n}\n\n\nvoid CCCHLogicalChannel::open()\n{\n\tLogicalChannel::open();\n\tif (!mRunning) {\n\t\tmRunning=true;\n\t\tmServiceThread.start((void*(*)(void*))CCCHLogicalChannelServiceLoopAdapter,this);\n\t}\n}\n\n\nvoid CCCHLogicalChannel::serviceLoop() \n{\n\t\/\/ build the idle frame\n\tstatic const L3PagingRequestType1 filler;\n\tstatic const L3Frame idleFrame(filler,UNIT_DATA);\n\t\/\/ prime the first idle frame\n\tLogicalChannel::send(idleFrame);\n\t\/\/ run the loop\n\twhile (true) {\n\t\tL3Frame* frame = mQ.read();\n\t\tif (frame) {\n\t\t\tLogicalChannel::send(*frame);\n\t\t\tOBJLOG(DEBUG) << \"CCCHLogicalChannel::serviceLoop sending \" << *frame;\n\t\t\tdelete frame;\n\t\t}\n\t\tif (mQ.size()==0) {\n\t\t\tLogicalChannel::send(idleFrame);\n\t\t\tOBJLOG(DEBUG) << \"CCCHLogicalChannel::serviceLoop sending idle frame\";\n\t\t}\n\t}\n}\n\n\nvoid *GSM::CCCHLogicalChannelServiceLoopAdapter(CCCHLogicalChannel* chan)\n{\n\tchan->serviceLoop();\n\treturn NULL;\n}\n\n\n\nL3ChannelDescription LogicalChannel::channelDescription() const\n{\n\t\/\/ In some debug cases, L1 may not exist, so we fake this information.\n\tif (mL1==NULL) return L3ChannelDescription(TDMA_MISC,0,0,0);\n\n\t\/\/ In normal cases, we get this information from L1.\n\treturn L3ChannelDescription(\n\t\tmL1->typeAndOffset(),\n\t\tmL1->TN(),\n\t\tmL1->TSC(),\n\t\tmL1->ARFCN()\n\t);\n}\n\n\n\n\nSDCCHLogicalChannel::SDCCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst CompleteMapping& wMapping)\n{\n\tmL1 = new SDCCHL1FEC(wCN,wTN,wMapping.LCH());\n\t\/\/ SAP0 is RR\/MM\/CC, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tL2LAPDm *SAP0L2 = new SDCCHL2(1,0);\n\tL2LAPDm *SAP3L2 = new SDCCHL2(1,3);\n\tLOG(DEBUG) << \"LAPDm pairs SAP0=\" << SAP0L2 << \" SAP3=\" << SAP3L2;\n\tSAP3L2->master(SAP0L2);\n\tmL2[0] = SAP0L2;\n\tmL2[3] = SAP3L2;\n\tmSACCH = new SACCHLogicalChannel(wCN,wTN,wMapping.SACCH());\n\tconnect();\n}\n\n\n\n\n\nSACCHLogicalChannel::SACCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst MappingPair& wMapping)\n\t\t: mRunning(false)\n{\n\tmSACCHL1 = new SACCHL1FEC(wCN,wTN,wMapping);\n\tmL1 = mSACCHL1;\n\t\/\/ SAP0 is RR, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tmL2[0] = new SACCHL2(1,0);\n\tmL2[3] = new SACCHL2(1,3);\n\tconnect();\n\tassert(mSACCH==NULL);\n}\n\n\nvoid SACCHLogicalChannel::open()\n{\n\tLogicalChannel::open();\n\tif (!mRunning) {\n\t\tmRunning=true;\n\t\tmServiceThread.start((void*(*)(void*))SACCHLogicalChannelServiceLoopAdapter,this);\n\t}\n}\n\n\n\nL3Message* processSACCHMessage(L3Frame *l3frame)\n{\n\tif (!l3frame) return NULL;\n\tLOG(DEBUG) << *l3frame;\n\tPrimitive prim = l3frame->primitive();\n\tif ((prim!=DATA) && (prim!=UNIT_DATA)) {\n\t\tLOG(INFO) << \"non-data primitive \" << prim;\n\t\treturn NULL;\n\t}\n\t\/\/ FIXME -- Why, again, do we need to do this?\n\/\/\tL3Frame realFrame = l3frame->segment(24, l3frame->size()-24);\n\tL3Message* message = parseL3(*l3frame);\n\tif (!message) {\n\t\tLOG(WARNING) << \"SACCH recevied unparsable L3 frame \" << *l3frame;\n\t}\n\treturn message;\n}\n\n\nvoid SACCHLogicalChannel::serviceLoop()\n{\n\t\/\/ run the loop\n\tunsigned count = 0;\n\twhile (true) {\n\n\t\t\/\/ Throttle back if not active.\n\t\tif (!active()) {\n\t\t\tOBJLOG(DEBUG) << \"SACCH sleeping\";\n\t\t\tsleepFrames(51);\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ TODO SMS -- Check to see if the tx queues are empty. If so, send SI5\/6,\n\t\t\/\/ otherwise sleep and continue;\n\n\t\t\/\/ Send alternating SI5\/SI6.\n\t\tOBJLOG(DEBUG) << \"sending SI5\/6 on SACCH\";\n\t\tif (count%2) LogicalChannel::send(gBTS.SI5Frame());\n\t\telse LogicalChannel::send(gBTS.SI6Frame());\n\t\tcount++;\n\n\t\t\/\/ Receive inbound messages.\n\t\t\/\/ This read loop flushes stray reports quickly.\n\t\twhile (true) {\n\n\t\t\tOBJLOG(DEBUG) << \"polling SACCH for inbound messages\";\n\t\t\tbool nothing = true;\n\n\t\t\t\/\/ Process SAP0 -- RR Measurement reports\n\t\t\tL3Frame *rrFrame = LogicalChannel::recv(0,0);\n\t\t\tif (rrFrame) nothing=false;\n\t\t\tL3Message* rrMessage = processSACCHMessage(rrFrame);\n\t\t\tdelete rrFrame;\n\t\t\tif (rrMessage) {\n\t\t\t\tL3MeasurementReport* measurement = dynamic_cast<L3MeasurementReport*>(rrMessage);\n\t\t\t\tif (measurement) {\n\t\t\t\t\tmMeasurementResults = measurement->results();\n\t\t\t\t\tOBJLOG(DEBUG) << \"SACCH measurement report \" << mMeasurementResults;\n\t\t\t\t\t\/\/ Add the measurement results to the table\n\t\t\t\t\t\/\/ Note that the typeAndOffset of a SACCH match the host channel.\n\t\t\t\t\tgPhysStatus.setPhysical(this, mMeasurementResults);\n\t\t\t\t} else {\n\t\t\t\t\tOBJLOG(NOTICE) << \"SACCH SAP0 sent unaticipated message \" << rrMessage;\n\t\t\t\t}\n\t\t\t\tdelete rrMessage;\n\t\t\t}\n\n\t\t\t\/\/ Process SAP3 -- SMS\n\t\t\tL3Frame *smsFrame = LogicalChannel::recv(0,3);\n\t\t\tif (smsFrame) nothing=false;\n\t\t\tL3Message* smsMessage = processSACCHMessage(smsFrame);\n\t\t\tdelete smsFrame;\n\t\t\tif (smsMessage) {\n\t\t\t\tconst SMS::CPData* cpData = dynamic_cast<const SMS::CPData*>(smsMessage);\n\t\t\t\tif (cpData) {\n\t\t\t\t\tOBJLOG(INFO) << \"SMS CPDU \" << *cpData;\n\t\t\t\t\tControl::TransactionEntry *transaction = gTransactionTable.find(this);\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif (transaction) {\n\t\t\t\t\t\t\tControl::InCallMOSMSController(cpData,transaction,this);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tOBJLOG(WARNING) << \"in-call MOSMS CP-DATA with no corresponding transaction\";\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (Control::ControlLayerException e) {\n\t\t\t\t\t\t\/\/LogicalChannel::send(RELEASE,3);\n\t\t\t\t\t\tgTransactionTable.remove(e.transactionID());\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tOBJLOG(NOTICE) << \"SACCH SAP3 sent unaticipated message \" << rrMessage;\n\t\t\t\t}\n\t\t\t\tdelete smsMessage;\n\t\t\t}\n\n\t\t\t\/\/ Anything from the SIP side?\n\t\t\t\/\/ MTSMS (delivery from SIP to the MS)\n\t\t\tControl::TransactionEntry *sipTransaction = mTransactionFIFO.readNoBlock();\n\t\t\tif (sipTransaction) {\n\t\t\t\tOBJLOG(INFO) << \"SIP-side transaction: \" << sipTransaction;\n\t\t\t\tassert(sipTransaction->service() == L3CMServiceType::MobileTerminatedShortMessage);\n\t\t\t\ttry {\n\t\t\t\t\tControl::MTSMSController(sipTransaction,this);\n\t\t\t\t} catch (Control::ControlLayerException e) {\n\t\t\t\t\t\/\/LogicalChannel::send(RELEASE,3);\n\t\t\t\t\tgTransactionTable.remove(e.transactionID());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Nothing happened?\n\t\t\tif (nothing) break;\n\t\t}\n\n\t}\n}\n\n\nvoid *GSM::SACCHLogicalChannelServiceLoopAdapter(SACCHLogicalChannel* chan)\n{\n\tchan->serviceLoop();\n\treturn NULL;\n}\n\n\n\/\/ These have to go into the .cpp file to prevent an illegal forward reference.\nvoid LogicalChannel::setPhy(float wRSSI, float wTimingError)\n\t{ assert(mSACCH); mSACCH->setPhy(wRSSI,wTimingError); }\nvoid LogicalChannel::setPhy(const LogicalChannel& other)\n\t{ assert(mSACCH); mSACCH->setPhy(*other.SACCH()); }\nfloat LogicalChannel::RSSI() const\n\t{ assert(mSACCH); return mSACCH->RSSI(); }\nfloat LogicalChannel::timingError() const\n\t{ assert(mSACCH); return mSACCH->timingError(); }\nint LogicalChannel::actualMSPower() const\n\t{ assert(mSACCH); return mSACCH->actualMSPower(); }\nint LogicalChannel::actualMSTiming() const\n\t{ assert(mSACCH); return mSACCH->actualMSTiming(); }\n\n\n\nTCHFACCHLogicalChannel::TCHFACCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst CompleteMapping& wMapping)\n{\n\tmTCHL1 = new TCHFACCHL1FEC(wCN,wTN,wMapping.LCH());\n\tmL1 = mTCHL1;\n\t\/\/ SAP0 is RR\/MM\/CC, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tmL2[0] = new FACCHL2(1,0);\n\tmL2[3] = new FACCHL2(1,3);\n\tmSACCH = new SACCHLogicalChannel(wCN,wTN,wMapping.SACCH());\n\tconnect();\n}\n\n\n\n\n\n\nbool LogicalChannel::waitForPrimitive(Primitive primitive, unsigned timeout_ms)\n{\n\tbool waiting = true;\n\twhile (waiting) {\n\t\tL3Frame *req = recv(timeout_ms);\n\t\tif (req==NULL) {\n\t\t\tLOG(NOTICE) << \"timeout at uptime \" << gBTS.uptime() << \" frame \" << gBTS.time();\n\t\t\treturn false;\n\t\t}\n\t\twaiting = (req->primitive()!=primitive);\n\t\tdelete req;\n\t}\n\treturn true;\n}\n\n\nvoid LogicalChannel::waitForPrimitive(Primitive primitive)\n{\n\tbool waiting = true;\n\twhile (waiting) {\n\t\tL3Frame *req = recv();\n\t\tif (req==NULL) continue;\n\t\twaiting = (req->primitive()!=primitive);\n\t\tdelete req;\n\t}\n}\n\n\nostream& GSM::operator<<(ostream& os, const LogicalChannel& chan)\n{\n\tos << chan.descriptiveString();\n\treturn os;\n}\n\n\nvoid LogicalChannel::addTransaction(Control::TransactionEntry *transaction)\n{\n\tassert(transaction->channel()==this);\n\tmTransactionFIFO.write(transaction);\n}\n\n\/\/ vim: ts=4 sw=4\n\n<commit_msg>r4226 in private: Added a comment pointing out a potential memory leak.<commit_after>\/**@file Logical Channel. *\/\n\n\/*\n* Copyright 2008, 2009, 2010, 2011 Free Software Foundation, Inc.\n* Copyright 2010 Kestrel Signal Processing, Inc.\n* Copyright 2011 Range Networks, Inc.\n*\n* This software is distributed under the terms of the GNU Affero Public License.\n* See the COPYING file in the main directory for details.\n*\n* This use of this software may be subject to additional restrictions.\n* See the LEGAL file in the main directory for details.\n\n\tThis program is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU Affero General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tThis program is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU Affero General Public License for more details.\n\n\tYou should have received a copy of the GNU Affero General Public License\n\talong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n\n\n#include \"GSML3RRElements.h\"\n#include \"GSML3Message.h\"\n#include \"GSML3RRMessages.h\"\n#include \"GSMLogicalChannel.h\"\n#include \"GSMConfig.h\"\n\n#include <TransactionTable.h>\n#include <SMSControl.h>\n#include <ControlCommon.h>\n\n#include <Logger.h>\n#undef WARNING\n\nusing namespace std;\nusing namespace GSM;\n\n\n\nvoid LogicalChannel::open()\n{\n\tLOG(INFO);\n\tif (mSACCH) mSACCH->open();\n\tif (mL1) mL1->open();\n\tfor (int s=0; s<4; s++) {\n\t\tif (mL2[s]) mL2[s]->open();\n\t}\n\t\/\/ Empty any stray transactions in the FIFO from the SIP layer.\n\twhile (true) {\n\t\tControl::TransactionEntry *trans = mTransactionFIFO.readNoBlock();\n\t\tif (!trans) break;\n\t\tLOG(WARNING) << \"flushing stray transaction \" << *trans;\n\t\t\/\/ FIXME -- Shouldn't we be deleting these?\n\t}\n}\n\n\nvoid LogicalChannel::connect()\n{\n\tmMux.downstream(mL1);\n\tif (mL1) mL1->upstream(&mMux);\n\tfor (int s=0; s<4; s++) {\n\t\tmMux.upstream(mL2[s],s);\n\t\tif (mL2[s]) mL2[s]->downstream(&mMux);\n\t}\n}\n\n\nvoid LogicalChannel::downstream(ARFCNManager* radio)\n{\n\tassert(mL1);\n\tmL1->downstream(radio);\n\tif (mSACCH) mSACCH->downstream(radio);\n}\n\n\n\n\/\/ Serialize and send an L3Message with a given primitive.\nvoid LogicalChannel::send(const L3Message& msg,\n\t\tconst GSM::Primitive& prim,\n\t\tunsigned SAPI)\n{\n\tLOG(INFO) << \"L3 SAP\" << SAPI << \" sending \" << msg;\n\tsend(L3Frame(msg,prim), SAPI);\n}\n\n\n\n\nCCCHLogicalChannel::CCCHLogicalChannel(const TDMAMapping& wMapping)\n\t:mRunning(false)\n{\n\tmL1 = new CCCHL1FEC(wMapping);\n\tmL2[0] = new CCCHL2;\n\tconnect();\n}\n\n\nvoid CCCHLogicalChannel::open()\n{\n\tLogicalChannel::open();\n\tif (!mRunning) {\n\t\tmRunning=true;\n\t\tmServiceThread.start((void*(*)(void*))CCCHLogicalChannelServiceLoopAdapter,this);\n\t}\n}\n\n\nvoid CCCHLogicalChannel::serviceLoop() \n{\n\t\/\/ build the idle frame\n\tstatic const L3PagingRequestType1 filler;\n\tstatic const L3Frame idleFrame(filler,UNIT_DATA);\n\t\/\/ prime the first idle frame\n\tLogicalChannel::send(idleFrame);\n\t\/\/ run the loop\n\twhile (true) {\n\t\tL3Frame* frame = mQ.read();\n\t\tif (frame) {\n\t\t\tLogicalChannel::send(*frame);\n\t\t\tOBJLOG(DEBUG) << \"CCCHLogicalChannel::serviceLoop sending \" << *frame;\n\t\t\tdelete frame;\n\t\t}\n\t\tif (mQ.size()==0) {\n\t\t\tLogicalChannel::send(idleFrame);\n\t\t\tOBJLOG(DEBUG) << \"CCCHLogicalChannel::serviceLoop sending idle frame\";\n\t\t}\n\t}\n}\n\n\nvoid *GSM::CCCHLogicalChannelServiceLoopAdapter(CCCHLogicalChannel* chan)\n{\n\tchan->serviceLoop();\n\treturn NULL;\n}\n\n\n\nL3ChannelDescription LogicalChannel::channelDescription() const\n{\n\t\/\/ In some debug cases, L1 may not exist, so we fake this information.\n\tif (mL1==NULL) return L3ChannelDescription(TDMA_MISC,0,0,0);\n\n\t\/\/ In normal cases, we get this information from L1.\n\treturn L3ChannelDescription(\n\t\tmL1->typeAndOffset(),\n\t\tmL1->TN(),\n\t\tmL1->TSC(),\n\t\tmL1->ARFCN()\n\t);\n}\n\n\n\n\nSDCCHLogicalChannel::SDCCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst CompleteMapping& wMapping)\n{\n\tmL1 = new SDCCHL1FEC(wCN,wTN,wMapping.LCH());\n\t\/\/ SAP0 is RR\/MM\/CC, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tL2LAPDm *SAP0L2 = new SDCCHL2(1,0);\n\tL2LAPDm *SAP3L2 = new SDCCHL2(1,3);\n\tLOG(DEBUG) << \"LAPDm pairs SAP0=\" << SAP0L2 << \" SAP3=\" << SAP3L2;\n\tSAP3L2->master(SAP0L2);\n\tmL2[0] = SAP0L2;\n\tmL2[3] = SAP3L2;\n\tmSACCH = new SACCHLogicalChannel(wCN,wTN,wMapping.SACCH());\n\tconnect();\n}\n\n\n\n\n\nSACCHLogicalChannel::SACCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst MappingPair& wMapping)\n\t\t: mRunning(false)\n{\n\tmSACCHL1 = new SACCHL1FEC(wCN,wTN,wMapping);\n\tmL1 = mSACCHL1;\n\t\/\/ SAP0 is RR, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tmL2[0] = new SACCHL2(1,0);\n\tmL2[3] = new SACCHL2(1,3);\n\tconnect();\n\tassert(mSACCH==NULL);\n}\n\n\nvoid SACCHLogicalChannel::open()\n{\n\tLogicalChannel::open();\n\tif (!mRunning) {\n\t\tmRunning=true;\n\t\tmServiceThread.start((void*(*)(void*))SACCHLogicalChannelServiceLoopAdapter,this);\n\t}\n}\n\n\n\nL3Message* processSACCHMessage(L3Frame *l3frame)\n{\n\tif (!l3frame) return NULL;\n\tLOG(DEBUG) << *l3frame;\n\tPrimitive prim = l3frame->primitive();\n\tif ((prim!=DATA) && (prim!=UNIT_DATA)) {\n\t\tLOG(INFO) << \"non-data primitive \" << prim;\n\t\treturn NULL;\n\t}\n\t\/\/ FIXME -- Why, again, do we need to do this?\n\/\/\tL3Frame realFrame = l3frame->segment(24, l3frame->size()-24);\n\tL3Message* message = parseL3(*l3frame);\n\tif (!message) {\n\t\tLOG(WARNING) << \"SACCH recevied unparsable L3 frame \" << *l3frame;\n\t}\n\treturn message;\n}\n\n\nvoid SACCHLogicalChannel::serviceLoop()\n{\n\t\/\/ run the loop\n\tunsigned count = 0;\n\twhile (true) {\n\n\t\t\/\/ Throttle back if not active.\n\t\tif (!active()) {\n\t\t\tOBJLOG(DEBUG) << \"SACCH sleeping\";\n\t\t\tsleepFrames(51);\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ TODO SMS -- Check to see if the tx queues are empty. If so, send SI5\/6,\n\t\t\/\/ otherwise sleep and continue;\n\n\t\t\/\/ Send alternating SI5\/SI6.\n\t\tOBJLOG(DEBUG) << \"sending SI5\/6 on SACCH\";\n\t\tif (count%2) LogicalChannel::send(gBTS.SI5Frame());\n\t\telse LogicalChannel::send(gBTS.SI6Frame());\n\t\tcount++;\n\n\t\t\/\/ Receive inbound messages.\n\t\t\/\/ This read loop flushes stray reports quickly.\n\t\twhile (true) {\n\n\t\t\tOBJLOG(DEBUG) << \"polling SACCH for inbound messages\";\n\t\t\tbool nothing = true;\n\n\t\t\t\/\/ Process SAP0 -- RR Measurement reports\n\t\t\tL3Frame *rrFrame = LogicalChannel::recv(0,0);\n\t\t\tif (rrFrame) nothing=false;\n\t\t\tL3Message* rrMessage = processSACCHMessage(rrFrame);\n\t\t\tdelete rrFrame;\n\t\t\tif (rrMessage) {\n\t\t\t\tL3MeasurementReport* measurement = dynamic_cast<L3MeasurementReport*>(rrMessage);\n\t\t\t\tif (measurement) {\n\t\t\t\t\tmMeasurementResults = measurement->results();\n\t\t\t\t\tOBJLOG(DEBUG) << \"SACCH measurement report \" << mMeasurementResults;\n\t\t\t\t\t\/\/ Add the measurement results to the table\n\t\t\t\t\t\/\/ Note that the typeAndOffset of a SACCH match the host channel.\n\t\t\t\t\tgPhysStatus.setPhysical(this, mMeasurementResults);\n\t\t\t\t} else {\n\t\t\t\t\tOBJLOG(NOTICE) << \"SACCH SAP0 sent unaticipated message \" << rrMessage;\n\t\t\t\t}\n\t\t\t\tdelete rrMessage;\n\t\t\t}\n\n\t\t\t\/\/ Process SAP3 -- SMS\n\t\t\tL3Frame *smsFrame = LogicalChannel::recv(0,3);\n\t\t\tif (smsFrame) nothing=false;\n\t\t\tL3Message* smsMessage = processSACCHMessage(smsFrame);\n\t\t\tdelete smsFrame;\n\t\t\tif (smsMessage) {\n\t\t\t\tconst SMS::CPData* cpData = dynamic_cast<const SMS::CPData*>(smsMessage);\n\t\t\t\tif (cpData) {\n\t\t\t\t\tOBJLOG(INFO) << \"SMS CPDU \" << *cpData;\n\t\t\t\t\tControl::TransactionEntry *transaction = gTransactionTable.find(this);\n\t\t\t\t\ttry {\n\t\t\t\t\t\tif (transaction) {\n\t\t\t\t\t\t\tControl::InCallMOSMSController(cpData,transaction,this);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tOBJLOG(WARNING) << \"in-call MOSMS CP-DATA with no corresponding transaction\";\n\t\t\t\t\t\t}\n\t\t\t\t\t} catch (Control::ControlLayerException e) {\n\t\t\t\t\t\t\/\/LogicalChannel::send(RELEASE,3);\n\t\t\t\t\t\tgTransactionTable.remove(e.transactionID());\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tOBJLOG(NOTICE) << \"SACCH SAP3 sent unaticipated message \" << rrMessage;\n\t\t\t\t}\n\t\t\t\tdelete smsMessage;\n\t\t\t}\n\n\t\t\t\/\/ Anything from the SIP side?\n\t\t\t\/\/ MTSMS (delivery from SIP to the MS)\n\t\t\tControl::TransactionEntry *sipTransaction = mTransactionFIFO.readNoBlock();\n\t\t\tif (sipTransaction) {\n\t\t\t\tOBJLOG(INFO) << \"SIP-side transaction: \" << sipTransaction;\n\t\t\t\tassert(sipTransaction->service() == L3CMServiceType::MobileTerminatedShortMessage);\n\t\t\t\ttry {\n\t\t\t\t\tControl::MTSMSController(sipTransaction,this);\n\t\t\t\t} catch (Control::ControlLayerException e) {\n\t\t\t\t\t\/\/LogicalChannel::send(RELEASE,3);\n\t\t\t\t\tgTransactionTable.remove(e.transactionID());\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ Nothing happened?\n\t\t\tif (nothing) break;\n\t\t}\n\n\t}\n}\n\n\nvoid *GSM::SACCHLogicalChannelServiceLoopAdapter(SACCHLogicalChannel* chan)\n{\n\tchan->serviceLoop();\n\treturn NULL;\n}\n\n\n\/\/ These have to go into the .cpp file to prevent an illegal forward reference.\nvoid LogicalChannel::setPhy(float wRSSI, float wTimingError)\n\t{ assert(mSACCH); mSACCH->setPhy(wRSSI,wTimingError); }\nvoid LogicalChannel::setPhy(const LogicalChannel& other)\n\t{ assert(mSACCH); mSACCH->setPhy(*other.SACCH()); }\nfloat LogicalChannel::RSSI() const\n\t{ assert(mSACCH); return mSACCH->RSSI(); }\nfloat LogicalChannel::timingError() const\n\t{ assert(mSACCH); return mSACCH->timingError(); }\nint LogicalChannel::actualMSPower() const\n\t{ assert(mSACCH); return mSACCH->actualMSPower(); }\nint LogicalChannel::actualMSTiming() const\n\t{ assert(mSACCH); return mSACCH->actualMSTiming(); }\n\n\n\nTCHFACCHLogicalChannel::TCHFACCHLogicalChannel(\n\t\tunsigned wCN,\n\t\tunsigned wTN,\n\t\tconst CompleteMapping& wMapping)\n{\n\tmTCHL1 = new TCHFACCHL1FEC(wCN,wTN,wMapping.LCH());\n\tmL1 = mTCHL1;\n\t\/\/ SAP0 is RR\/MM\/CC, SAP3 is SMS\n\t\/\/ SAP1 and SAP2 are not used.\n\tmL2[0] = new FACCHL2(1,0);\n\tmL2[3] = new FACCHL2(1,3);\n\tmSACCH = new SACCHLogicalChannel(wCN,wTN,wMapping.SACCH());\n\tconnect();\n}\n\n\n\n\n\n\nbool LogicalChannel::waitForPrimitive(Primitive primitive, unsigned timeout_ms)\n{\n\tbool waiting = true;\n\twhile (waiting) {\n\t\tL3Frame *req = recv(timeout_ms);\n\t\tif (req==NULL) {\n\t\t\tLOG(NOTICE) << \"timeout at uptime \" << gBTS.uptime() << \" frame \" << gBTS.time();\n\t\t\treturn false;\n\t\t}\n\t\twaiting = (req->primitive()!=primitive);\n\t\tdelete req;\n\t}\n\treturn true;\n}\n\n\nvoid LogicalChannel::waitForPrimitive(Primitive primitive)\n{\n\tbool waiting = true;\n\twhile (waiting) {\n\t\tL3Frame *req = recv();\n\t\tif (req==NULL) continue;\n\t\twaiting = (req->primitive()!=primitive);\n\t\tdelete req;\n\t}\n}\n\n\nostream& GSM::operator<<(ostream& os, const LogicalChannel& chan)\n{\n\tos << chan.descriptiveString();\n\treturn os;\n}\n\n\nvoid LogicalChannel::addTransaction(Control::TransactionEntry *transaction)\n{\n\tassert(transaction->channel()==this);\n\tmTransactionFIFO.write(transaction);\n}\n\n\/\/ vim: ts=4 sw=4\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\nusing namespace std;\nusing namespace dev;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -r,--render Render the given RLP. Options:\" << endl\n\t\t<< \" --indent <string> Use string as the level indentation (default ' ').\" << endl\n\t\t<< \" --hex-ints Render integers in hex.\" << endl\n\t\t<< \" --force-string Force all data to be rendered as C-style strings.\" << endl\n\t\t<< \" --force-escape When rendering as C-style strings, force all characters to be escaped.\" << endl\n\t\t<< \" --force-hex Force all data to be rendered as raw hex.\" << endl\n\t\t<< \" -l,--list-archive List the items in the RLP list by hash and size.\" << endl\n\t\t<< \" -e,--extract-archive Extract all items in the RLP list, named by hash.\" << endl\n\t\t<< \"General options:\" << endl\n\t\t<< \" -L,--lenience Try not to bomb out early if possible.\" << endl\n\t\t<< \" -x,--hex,--base-16 Treat input RLP as hex encoded data.\" << endl\n\t\t<< \" --64,--base-64 Treat input RLP as base-64 encoded data.\" << endl\n\t\t<< \" -b,--bin,--base-256 Treat input RLP as raw binary data.\" << endl\n\t\t<< \" -h,--help Print this help message and exit.\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent = \" \";\n\t\tbool hexInts = false;\n\t\tbool forceString = false;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = false;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt())\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire), 1), 1);\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData())\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << toHex(_d.data());\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\tif (encoding == Encoding::Auto)\n\t{\n\t\tencoding = Encoding::Hex;\n\t\tfor (char b: in)\n\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t{\n\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t{\n\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t}\n\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t{\n\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tbytes b;\n\tswitch (encoding)\n\t{\n\tcase Encoding::Hex:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromHex(s);\n\t\tbreak;\n\t}\n\tcase Encoding::Base64:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromBase64(s);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tswap(b, in);\n\t\tbreak;\n\t}\n\n\ttry\n\t{\n\t\tRLP rlp(b);\n\t\tswitch (mode)\n\t\t{\n\t\tcase Mode::ListArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::ExtractArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tofstream fout;\n\t\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Render:\n\t\t{\n\t\t\tRLPStreamer s(cout, prefs);\n\t\t\ts.output(rlp);\n\t\t\tcout << endl;\n\t\t\tbreak;\n\t\t}\n\t\tdefault:;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<commit_msg>Make RLP JSON compatible by default.<commit_after>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\nusing namespace std;\nusing namespace dev;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -r,--render Render the given RLP. Options:\" << endl\n\t\t<< \" --indent <string> Use string as the level indentation (default ' ').\" << endl\n\t\t<< \" --hex-ints Render integers in hex.\" << endl\n\t\t<< \" --ascii-strings Render data as C-style strings or hex depending on content being ASCII.\" << endl\n\t\t<< \" --force-string Force all data to be rendered as C-style strings.\" << endl\n\t\t<< \" --force-escape When rendering as C-style strings, force all characters to be escaped.\" << endl\n\t\t<< \" --force-hex Force all data to be rendered as raw hex.\" << endl\n\t\t<< \" -l,--list-archive List the items in the RLP list by hash and size.\" << endl\n\t\t<< \" -e,--extract-archive Extract all items in the RLP list, named by hash.\" << endl\n\t\t<< \"General options:\" << endl\n\t\t<< \" -L,--lenience Try not to bomb out early if possible.\" << endl\n\t\t<< \" -x,--hex,--base-16 Treat input RLP as hex encoded data.\" << endl\n\t\t<< \" --64,--base-64 Treat input RLP as base-64 encoded data.\" << endl\n\t\t<< \" -b,--bin,--base-256 Treat input RLP as raw binary data.\" << endl\n\t\t<< \" -h,--help Print this help message and exit.\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent = \" \";\n\t\tbool hexInts = false;\n\t\tbool forceString = true;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = false;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt())\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire), 1), 1);\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData())\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << toHex(_d.data());\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--ascii-strings\")\n\t\t\tprefs.forceString = prefs.forceHex = false;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\tif (encoding == Encoding::Auto)\n\t{\n\t\tencoding = Encoding::Hex;\n\t\tfor (char b: in)\n\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t{\n\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t{\n\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t}\n\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t{\n\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tbytes b;\n\tswitch (encoding)\n\t{\n\tcase Encoding::Hex:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromHex(s);\n\t\tbreak;\n\t}\n\tcase Encoding::Base64:\n\t{\n\t\tstring s = asString(in);\n\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\tb = fromBase64(s);\n\t\tbreak;\n\t}\n\tdefault:\n\t\tswap(b, in);\n\t\tbreak;\n\t}\n\n\ttry\n\t{\n\t\tRLP rlp(b);\n\t\tswitch (mode)\n\t\t{\n\t\tcase Mode::ListArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::ExtractArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tofstream fout;\n\t\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Render:\n\t\t{\n\t\t\tRLPStreamer s(cout, prefs);\n\t\t\ts.output(rlp);\n\t\t\tcout << endl;\n\t\t\tbreak;\n\t\t}\n\t\tdefault:;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: fieldwnd.hxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: hr $ $Date: 2003-03-26 18:06:10 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SC_FIELDWND_HXX\n#define SC_FIELDWND_HXX\n\n\n#ifndef _SV_CTRL_HXX\n#include <vcl\/ctrl.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n\n#define MAX_LABELS 256\n#define PAGE_SIZE 16 \/\/ count of visible fields for scrollbar\n#define LINE_SIZE 8 \/\/ count of fields per column for scrollbar\n#define MAX_FIELDS 8 \/\/ maximum count of fields for row\/col\/data area\n\n#define OWIDTH PivotGlobal::nObjWidth\n#define OHEIGHT PivotGlobal::nObjHeight\n#define SSPACE PivotGlobal::nSelSpace\n\nclass ScDPLayoutDlg;\nclass ScAccessibleDataPilotControl;\n\n\/\/===================================================================\n\n\/** Type of content area. *\/\nenum ScDPFieldType\n{\n TYPE_ROW, \/\/\/ Area for all row fields.\n TYPE_COL, \/\/\/ Area for all column fields.\n TYPE_DATA, \/\/\/ Area for all data fields.\n TYPE_SELECT \/\/\/ Selection area with all fields.\n};\n\n\/\/-------------------------------------------------------------------\n\n\/** Represents a field area in the DataPilot layout dialog. *\/\nclass ScDPFieldWindow : public Control\n{\nprivate:\n String aName; \/\/\/ name of the control, used in Accessibility\n ScDPLayoutDlg* pDlg; \/\/\/ Parent dialog.\n Rectangle aWndRect; \/\/\/ Area rectangle in pixels.\n FixedText* pFtCaption; \/\/\/ FixedText containing the name of the control.\n Point aTextPos; \/\/\/ Position of the caption text.\n String** aFieldArr; \/\/\/ Pointer to string array of the field names.\n ScDPFieldType eType; \/\/\/ Type of this area.\n Color aFaceColor; \/\/\/ Color for dialog background.\n Color aWinColor; \/\/\/ Color for window background.\n Color aTextColor; \/\/\/ Color for text in buttons.\n Color aWinTextColor; \/\/\/ Color for text in field windows.\n long nFieldSize; \/\/\/ Maximum count of fields.\n long nFieldCount; \/\/\/ Count of existing fields.\n long nFieldSelected; \/\/\/ Currently selected field.\n bool mbAppRTL; \/\/\/ true = Application in RTL display mode.\n\n com::sun::star::uno::WeakReference< ::drafts::com::sun::star::accessibility::XAccessible > xAccessible;\n ScAccessibleDataPilotControl* pAccessible;\n\n \/** Initilize the object. *\/\n void Init();\n\n \/** Reads all needed style settings. *\/\n void GetStyleSettings();\n\n \/** Draws the background. *\/\n void DrawBackground( OutputDevice& rDev );\n \/** Draws a field into the specified rectangle. *\/\n void DrawField(\n OutputDevice& rDev,\n const Rectangle& rRect,\n const String& rText,\n BOOL bSelected );\n\n \/** @return TRUE, if the field index is inside of the control area. *\/\n BOOL IsValidIndex( long nIndex ) const;\n \/** @return TRUE, if the field with the given index exists. *\/\n BOOL IsExistingIndex( long nIndex ) const;\n \/** @return The new selection index after moving to the given direction. *\/\n long CalcNewFieldIndex( short nDX, short nDY ) const;\n\n \/** Sets selection to the field with index nIndex. *\/\n void SetSelection( long nIndex );\n \/** Sets selection to first field. *\/\n void SetSelectionHome();\n \/** Sets selection to last field. *\/\n void SetSelectionEnd();\n \/** Sets selection to new position relative to current. *\/\n void MoveSelection( USHORT nKeyCode, short nDX, short nDY );\n\n \/** Moves the selected field to nDestIndex. *\/\n void MoveField( long nDestIndex );\n \/** Moves the selected field to the given direction. *\/\n void MoveFieldRel( short nDX, short nDY );\n\nprotected:\n virtual void Paint( const Rectangle& rRect );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n virtual void MouseButtonDown( const MouseEvent& rMEvt );\n virtual void MouseButtonUp( const MouseEvent& rMEvt );\n virtual void MouseMove( const MouseEvent& rMEvt );\n virtual void KeyInput( const KeyEvent& rKEvt );\n virtual void GetFocus();\n virtual void LoseFocus();\n virtual ::com::sun::star::uno::Reference< ::drafts::com::sun::star::accessibility::XAccessible > CreateAccessible();\n\npublic:\n ScDPFieldWindow(\n ScDPLayoutDlg* pDialog,\n const ResId& rResId,\n ScDPFieldType eFieldType,\n FixedText* pFtFieldCaption );\n ScDPFieldWindow(\n ScDPLayoutDlg* pDialog,\n const ResId& rResId,\n ScDPFieldType eFieldType,\n const String& aName );\n virtual ~ScDPFieldWindow();\n\n \/** Draws the complete control. *\/\n void Redraw();\n\n \/** @return The pixel position of a field (without bound check). *\/\n Point GetFieldPosition( long nIndex ) const;\n \/** @return The pixel size of a field. *\/\n Size GetFieldSize() const;\n\n \/** @return The index of the selected field. *\/\n inline BOOL IsEmpty() const { return nFieldCount == 0; }\n \/** @return The index of the selected field. *\/\n inline long GetSelectedField() const { return nFieldSelected; }\n \/** @return The pixel position of the last possible field. *\/\n Point GetLastPosition() const;\n\n \/** @return The count of existing fields. *\/\n long GetFieldCount() const { return nFieldCount; }\n \/** Inserts a field to the specified index. *\/\n void AddField( const String& rText, long nNewIndex );\n \/** Removes a field from the specified index. *\/\n void DelField( long nDelIndex );\n \/** Removes all fields. *\/\n void ClearFields();\n \/** Changes the text on an existing field. *\/\n void SetFieldText( const String& rText, long nIndex );\n \/** Returns the text of an existing field. *\/\n const String& GetFieldText(long nIndex) const;\n\n \/** Inserts a field using the specified pixel position.\n @param rPos The coordinates to insert the field.\n @param rnIndex The new index of the field is returned here.\n @return TRUE, if the field has been created. *\/\n BOOL AddField( const String& rText, const Point& rPos, long& rnIndex );\n \/** Calculates the field index at a specific pixel position.\n @param rnIndex The index of the field is returned here.\n @return TRUE, if the index value is valid. *\/\n BOOL GetFieldIndex( const Point& rPos, long& rnIndex ) const;\n \/** Calculates a field index at a specific pixel position. Returns in every\n case the index of an existing field.\n @param rnIndex The index of the field is returned here.\n @return TRUE, if the index value is valid. *\/\n void GetExistingIndex( const Point& rPos, long& rnIndex );\n\n \/** Notifies this control that the offset of the first field has been changed.\n The control has to adjust the selection to keep the same field selected\n on scrolling with scrollbar. *\/\n void ModifySelectionOffset( long nOffsetDiff );\n \/** Selects the next field. Called i.e. after moving a field from SELECT area. *\/\n void SelectNext();\n\n \/** @return The name of the control without shortcut. *\/\n String GetName()const { return aName; }\n\n \/** @return The description of the control which is used for the accessibility objects. *\/\n String GetDescription()const;\n\n \/** Grabs focus and sets new selection. *\/\n void GrabFocusWithSel( long nIndex );\n\n \/** @return The type of the FieldWindow. *\/\n ScDPFieldType GetType() const { return eType; }\n};\n\n\/\/===================================================================\n\n#endif \/\/ SC_FIELDWND_HXX\n<commit_msg>INTEGRATION: CWS vcl08 (1.6.2.1.20); FILE MERGED 2003\/04\/09 10:19:45 dr 1.6.2.1.20.1: #108669# mirrored UI: swap left\/right cursor done in VCL<commit_after>\/*************************************************************************\n *\n * $RCSfile: fieldwnd.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: rt $ $Date: 2003-04-17 15:09:36 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SC_FIELDWND_HXX\n#define SC_FIELDWND_HXX\n\n\n#ifndef _SV_CTRL_HXX\n#include <vcl\/ctrl.hxx>\n#endif\n#ifndef _SV_FIXED_HXX\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _CPPUHELPER_WEAKREF_HXX_\n#include <cppuhelper\/weakref.hxx>\n#endif\n\n#define MAX_LABELS 256\n#define PAGE_SIZE 16 \/\/ count of visible fields for scrollbar\n#define LINE_SIZE 8 \/\/ count of fields per column for scrollbar\n#define MAX_FIELDS 8 \/\/ maximum count of fields for row\/col\/data area\n\n#define OWIDTH PivotGlobal::nObjWidth\n#define OHEIGHT PivotGlobal::nObjHeight\n#define SSPACE PivotGlobal::nSelSpace\n\nclass ScDPLayoutDlg;\nclass ScAccessibleDataPilotControl;\n\n\/\/===================================================================\n\n\/** Type of content area. *\/\nenum ScDPFieldType\n{\n TYPE_ROW, \/\/\/ Area for all row fields.\n TYPE_COL, \/\/\/ Area for all column fields.\n TYPE_DATA, \/\/\/ Area for all data fields.\n TYPE_SELECT \/\/\/ Selection area with all fields.\n};\n\n\/\/-------------------------------------------------------------------\n\n\/** Represents a field area in the DataPilot layout dialog. *\/\nclass ScDPFieldWindow : public Control\n{\nprivate:\n String aName; \/\/\/ name of the control, used in Accessibility\n ScDPLayoutDlg* pDlg; \/\/\/ Parent dialog.\n Rectangle aWndRect; \/\/\/ Area rectangle in pixels.\n FixedText* pFtCaption; \/\/\/ FixedText containing the name of the control.\n Point aTextPos; \/\/\/ Position of the caption text.\n String** aFieldArr; \/\/\/ Pointer to string array of the field names.\n ScDPFieldType eType; \/\/\/ Type of this area.\n Color aFaceColor; \/\/\/ Color for dialog background.\n Color aWinColor; \/\/\/ Color for window background.\n Color aTextColor; \/\/\/ Color for text in buttons.\n Color aWinTextColor; \/\/\/ Color for text in field windows.\n long nFieldSize; \/\/\/ Maximum count of fields.\n long nFieldCount; \/\/\/ Count of existing fields.\n long nFieldSelected; \/\/\/ Currently selected field.\n\n com::sun::star::uno::WeakReference< ::drafts::com::sun::star::accessibility::XAccessible > xAccessible;\n ScAccessibleDataPilotControl* pAccessible;\n\n \/** Initilize the object. *\/\n void Init();\n\n \/** Reads all needed style settings. *\/\n void GetStyleSettings();\n\n \/** Draws the background. *\/\n void DrawBackground( OutputDevice& rDev );\n \/** Draws a field into the specified rectangle. *\/\n void DrawField(\n OutputDevice& rDev,\n const Rectangle& rRect,\n const String& rText,\n BOOL bSelected );\n\n \/** @return TRUE, if the field index is inside of the control area. *\/\n BOOL IsValidIndex( long nIndex ) const;\n \/** @return TRUE, if the field with the given index exists. *\/\n BOOL IsExistingIndex( long nIndex ) const;\n \/** @return The new selection index after moving to the given direction. *\/\n long CalcNewFieldIndex( short nDX, short nDY ) const;\n\n \/** Sets selection to the field with index nIndex. *\/\n void SetSelection( long nIndex );\n \/** Sets selection to first field. *\/\n void SetSelectionHome();\n \/** Sets selection to last field. *\/\n void SetSelectionEnd();\n \/** Sets selection to new position relative to current. *\/\n void MoveSelection( USHORT nKeyCode, short nDX, short nDY );\n\n \/** Moves the selected field to nDestIndex. *\/\n void MoveField( long nDestIndex );\n \/** Moves the selected field to the given direction. *\/\n void MoveFieldRel( short nDX, short nDY );\n\nprotected:\n virtual void Paint( const Rectangle& rRect );\n virtual void DataChanged( const DataChangedEvent& rDCEvt );\n virtual void MouseButtonDown( const MouseEvent& rMEvt );\n virtual void MouseButtonUp( const MouseEvent& rMEvt );\n virtual void MouseMove( const MouseEvent& rMEvt );\n virtual void KeyInput( const KeyEvent& rKEvt );\n virtual void GetFocus();\n virtual void LoseFocus();\n virtual ::com::sun::star::uno::Reference< ::drafts::com::sun::star::accessibility::XAccessible > CreateAccessible();\n\npublic:\n ScDPFieldWindow(\n ScDPLayoutDlg* pDialog,\n const ResId& rResId,\n ScDPFieldType eFieldType,\n FixedText* pFtFieldCaption );\n ScDPFieldWindow(\n ScDPLayoutDlg* pDialog,\n const ResId& rResId,\n ScDPFieldType eFieldType,\n const String& aName );\n virtual ~ScDPFieldWindow();\n\n \/** Draws the complete control. *\/\n void Redraw();\n\n \/** @return The pixel position of a field (without bound check). *\/\n Point GetFieldPosition( long nIndex ) const;\n \/** @return The pixel size of a field. *\/\n Size GetFieldSize() const;\n\n \/** @return The index of the selected field. *\/\n inline BOOL IsEmpty() const { return nFieldCount == 0; }\n \/** @return The index of the selected field. *\/\n inline long GetSelectedField() const { return nFieldSelected; }\n \/** @return The pixel position of the last possible field. *\/\n Point GetLastPosition() const;\n\n \/** @return The count of existing fields. *\/\n long GetFieldCount() const { return nFieldCount; }\n \/** Inserts a field to the specified index. *\/\n void AddField( const String& rText, long nNewIndex );\n \/** Removes a field from the specified index. *\/\n void DelField( long nDelIndex );\n \/** Removes all fields. *\/\n void ClearFields();\n \/** Changes the text on an existing field. *\/\n void SetFieldText( const String& rText, long nIndex );\n \/** Returns the text of an existing field. *\/\n const String& GetFieldText(long nIndex) const;\n\n \/** Inserts a field using the specified pixel position.\n @param rPos The coordinates to insert the field.\n @param rnIndex The new index of the field is returned here.\n @return TRUE, if the field has been created. *\/\n BOOL AddField( const String& rText, const Point& rPos, long& rnIndex );\n \/** Calculates the field index at a specific pixel position.\n @param rnIndex The index of the field is returned here.\n @return TRUE, if the index value is valid. *\/\n BOOL GetFieldIndex( const Point& rPos, long& rnIndex ) const;\n \/** Calculates a field index at a specific pixel position. Returns in every\n case the index of an existing field.\n @param rnIndex The index of the field is returned here.\n @return TRUE, if the index value is valid. *\/\n void GetExistingIndex( const Point& rPos, long& rnIndex );\n\n \/** Notifies this control that the offset of the first field has been changed.\n The control has to adjust the selection to keep the same field selected\n on scrolling with scrollbar. *\/\n void ModifySelectionOffset( long nOffsetDiff );\n \/** Selects the next field. Called i.e. after moving a field from SELECT area. *\/\n void SelectNext();\n\n \/** @return The name of the control without shortcut. *\/\n String GetName()const { return aName; }\n\n \/** @return The description of the control which is used for the accessibility objects. *\/\n String GetDescription()const;\n\n \/** Grabs focus and sets new selection. *\/\n void GrabFocusWithSel( long nIndex );\n\n \/** @return The type of the FieldWindow. *\/\n ScDPFieldType GetType() const { return eType; }\n};\n\n\/\/===================================================================\n\n#endif \/\/ SC_FIELDWND_HXX\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010 Apple Inc. All Rights Reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include \"config.h\"\n#include \"platform\/weborigin\/SchemeRegistry.h\"\n\n#include \"wtf\/MainThread.h\"\n#include \"wtf\/text\/StringBuilder.h\"\n\nnamespace blink {\n\nstatic URLSchemesSet& localURLSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, localSchemes, ());\n\n if (localSchemes.isEmpty())\n localSchemes.add(\"file\");\n\n return localSchemes;\n}\n\nstatic URLSchemesSet& displayIsolatedURLSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, displayIsolatedSchemes, ());\n return displayIsolatedSchemes;\n}\n\nstatic URLSchemesSet& secureSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, secureSchemes, ());\n\n if (secureSchemes.isEmpty()) {\n secureSchemes.add(\"https\");\n secureSchemes.add(\"about\");\n secureSchemes.add(\"data\");\n secureSchemes.add(\"wss\");\n }\n\n return secureSchemes;\n}\n\nstatic URLSchemesSet& schemesWithUniqueOrigins()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, schemesWithUniqueOrigins, ());\n\n if (schemesWithUniqueOrigins.isEmpty()) {\n schemesWithUniqueOrigins.add(\"about\");\n schemesWithUniqueOrigins.add(\"javascript\");\n \/\/ This is a willful violation of HTML5.\n \/\/ See https:\/\/bugs.webkit.org\/show_bug.cgi?id=11885\n schemesWithUniqueOrigins.add(\"data\");\n }\n\n return schemesWithUniqueOrigins;\n}\n\nstatic URLSchemesSet& emptyDocumentSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, emptyDocumentSchemes, ());\n\n if (emptyDocumentSchemes.isEmpty())\n emptyDocumentSchemes.add(\"about\");\n\n return emptyDocumentSchemes;\n}\n\nstatic HashSet<String>& schemesForbiddenFromDomainRelaxation()\n{\n DEFINE_STATIC_LOCAL(HashSet<String>, schemes, ());\n return schemes;\n}\n\nstatic URLSchemesSet& canDisplayOnlyIfCanRequestSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, canDisplayOnlyIfCanRequestSchemes, ());\n\n if (canDisplayOnlyIfCanRequestSchemes.isEmpty()) {\n canDisplayOnlyIfCanRequestSchemes.add(\"blob\");\n canDisplayOnlyIfCanRequestSchemes.add(\"filesystem\");\n }\n\n return canDisplayOnlyIfCanRequestSchemes;\n}\n\nstatic URLSchemesSet& notAllowingJavascriptURLsSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, notAllowingJavascriptURLsSchemes, ());\n return notAllowingJavascriptURLsSchemes;\n}\n\nvoid SchemeRegistry::registerURLSchemeAsLocal(const String& scheme)\n{\n localURLSchemes().add(scheme);\n}\n\nvoid SchemeRegistry::removeURLSchemeRegisteredAsLocal(const String& scheme)\n{\n if (scheme == \"file\")\n return;\n localURLSchemes().remove(scheme);\n}\n\nconst URLSchemesSet& SchemeRegistry::localSchemes()\n{\n return localURLSchemes();\n}\n\nstatic URLSchemesSet& CORSEnabledSchemes()\n{\n \/\/ FIXME: http:\/\/bugs.webkit.org\/show_bug.cgi?id=77160\n DEFINE_STATIC_LOCAL(URLSchemesSet, CORSEnabledSchemes, ());\n\n if (CORSEnabledSchemes.isEmpty()) {\n CORSEnabledSchemes.add(\"http\");\n CORSEnabledSchemes.add(\"https\");\n CORSEnabledSchemes.add(\"data\");\n }\n\n return CORSEnabledSchemes;\n}\n\nstatic URLSchemesSet& LegacySchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, LegacySchemes, ());\n\n if (LegacySchemes.isEmpty()) {\n LegacySchemes.add(\"ftp\");\n LegacySchemes.add(\"gopher\");\n }\n\n return LegacySchemes;\n}\n\nstatic URLSchemesMap<SchemeRegistry::PolicyAreas>& ContentSecurityPolicyBypassingSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesMap<SchemeRegistry::PolicyAreas>, schemes, ());\n return schemes;\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsLocal(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return localURLSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsNoAccess(const String& scheme)\n{\n schemesWithUniqueOrigins().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsNoAccess(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return schemesWithUniqueOrigins().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsDisplayIsolated(const String& scheme)\n{\n displayIsolatedURLSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsDisplayIsolated(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return displayIsolatedURLSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsSecure(const String& scheme)\n{\n secureSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsSecure(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return secureSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsEmptyDocument(const String& scheme)\n{\n emptyDocumentSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldLoadURLSchemeAsEmptyDocument(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return emptyDocumentSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::setDomainRelaxationForbiddenForURLScheme(bool forbidden, const String& scheme)\n{\n if (scheme.isEmpty())\n return;\n\n if (forbidden)\n schemesForbiddenFromDomainRelaxation().add(scheme);\n else\n schemesForbiddenFromDomainRelaxation().remove(scheme);\n}\n\nbool SchemeRegistry::isDomainRelaxationForbiddenForURLScheme(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return schemesForbiddenFromDomainRelaxation().contains(scheme);\n}\n\nbool SchemeRegistry::canDisplayOnlyIfCanRequest(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return canDisplayOnlyIfCanRequestSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerAsCanDisplayOnlyIfCanRequest(const String& scheme)\n{\n canDisplayOnlyIfCanRequestSchemes().add(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsNotAllowingJavascriptURLs(const String& scheme)\n{\n notAllowingJavascriptURLsSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsNotAllowingJavascriptURLs(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return notAllowingJavascriptURLsSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsCORSEnabled(const String& scheme)\n{\n CORSEnabledSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsCORSEnabled(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return CORSEnabledSchemes().contains(scheme);\n}\n\nString SchemeRegistry::listOfCORSEnabledURLSchemes()\n{\n StringBuilder builder;\n bool addSeparator = false;\n for (const auto& scheme : CORSEnabledSchemes()) {\n if (addSeparator)\n builder.appendLiteral(\", \");\n else\n addSeparator = true;\n\n builder.append(scheme);\n }\n return builder.toString();\n}\n\nvoid SchemeRegistry::registerURLSchemeAsLegacy(const String& scheme)\n{\n LegacySchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsLegacy(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return LegacySchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsBypassingContentSecurityPolicy(const String& scheme, PolicyAreas policyAreas)\n{\n ContentSecurityPolicyBypassingSchemes().add(scheme, policyAreas);\n}\n\nvoid SchemeRegistry::removeURLSchemeRegisteredAsBypassingContentSecurityPolicy(const String& scheme)\n{\n ContentSecurityPolicyBypassingSchemes().remove(scheme);\n}\n\nbool SchemeRegistry::schemeShouldBypassContentSecurityPolicy(const String& scheme, PolicyAreas policyAreas)\n{\n ASSERT(policyAreas != PolicyAreaNone);\n if (scheme.isEmpty() || policyAreas == PolicyAreaNone)\n return false;\n\n \/\/ get() returns 0 (PolicyAreaNone) if there is no entry in the map.\n \/\/ Thus by default, schemes do not bypass CSP.\n return (ContentSecurityPolicyBypassingSchemes().get(scheme) & policyAreas) == policyAreas;\n}\n\n} \/\/ namespace blink\n<commit_msg>treat app protocol as local scheme<commit_after>\/*\n * Copyright (C) 2010 Apple Inc. All Rights Reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY APPLE, INC. ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *\/\n\n#include \"config.h\"\n#include \"platform\/weborigin\/SchemeRegistry.h\"\n\n#include \"wtf\/MainThread.h\"\n#include \"wtf\/text\/StringBuilder.h\"\n\nnamespace blink {\n\nstatic URLSchemesSet& localURLSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, localSchemes, ());\n\n if (localSchemes.isEmpty()) {\n localSchemes.add(\"file\");\n localSchemes.add(\"app\");\n }\n\n return localSchemes;\n}\n\nstatic URLSchemesSet& displayIsolatedURLSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, displayIsolatedSchemes, ());\n return displayIsolatedSchemes;\n}\n\nstatic URLSchemesSet& secureSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, secureSchemes, ());\n\n if (secureSchemes.isEmpty()) {\n secureSchemes.add(\"https\");\n secureSchemes.add(\"about\");\n secureSchemes.add(\"data\");\n secureSchemes.add(\"wss\");\n }\n\n return secureSchemes;\n}\n\nstatic URLSchemesSet& schemesWithUniqueOrigins()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, schemesWithUniqueOrigins, ());\n\n if (schemesWithUniqueOrigins.isEmpty()) {\n schemesWithUniqueOrigins.add(\"about\");\n schemesWithUniqueOrigins.add(\"javascript\");\n \/\/ This is a willful violation of HTML5.\n \/\/ See https:\/\/bugs.webkit.org\/show_bug.cgi?id=11885\n schemesWithUniqueOrigins.add(\"data\");\n }\n\n return schemesWithUniqueOrigins;\n}\n\nstatic URLSchemesSet& emptyDocumentSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, emptyDocumentSchemes, ());\n\n if (emptyDocumentSchemes.isEmpty())\n emptyDocumentSchemes.add(\"about\");\n\n return emptyDocumentSchemes;\n}\n\nstatic HashSet<String>& schemesForbiddenFromDomainRelaxation()\n{\n DEFINE_STATIC_LOCAL(HashSet<String>, schemes, ());\n return schemes;\n}\n\nstatic URLSchemesSet& canDisplayOnlyIfCanRequestSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, canDisplayOnlyIfCanRequestSchemes, ());\n\n if (canDisplayOnlyIfCanRequestSchemes.isEmpty()) {\n canDisplayOnlyIfCanRequestSchemes.add(\"blob\");\n canDisplayOnlyIfCanRequestSchemes.add(\"filesystem\");\n }\n\n return canDisplayOnlyIfCanRequestSchemes;\n}\n\nstatic URLSchemesSet& notAllowingJavascriptURLsSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, notAllowingJavascriptURLsSchemes, ());\n return notAllowingJavascriptURLsSchemes;\n}\n\nvoid SchemeRegistry::registerURLSchemeAsLocal(const String& scheme)\n{\n localURLSchemes().add(scheme);\n}\n\nvoid SchemeRegistry::removeURLSchemeRegisteredAsLocal(const String& scheme)\n{\n if (scheme == \"file\")\n return;\n localURLSchemes().remove(scheme);\n}\n\nconst URLSchemesSet& SchemeRegistry::localSchemes()\n{\n return localURLSchemes();\n}\n\nstatic URLSchemesSet& CORSEnabledSchemes()\n{\n \/\/ FIXME: http:\/\/bugs.webkit.org\/show_bug.cgi?id=77160\n DEFINE_STATIC_LOCAL(URLSchemesSet, CORSEnabledSchemes, ());\n\n if (CORSEnabledSchemes.isEmpty()) {\n CORSEnabledSchemes.add(\"http\");\n CORSEnabledSchemes.add(\"https\");\n CORSEnabledSchemes.add(\"data\");\n }\n\n return CORSEnabledSchemes;\n}\n\nstatic URLSchemesSet& LegacySchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesSet, LegacySchemes, ());\n\n if (LegacySchemes.isEmpty()) {\n LegacySchemes.add(\"ftp\");\n LegacySchemes.add(\"gopher\");\n }\n\n return LegacySchemes;\n}\n\nstatic URLSchemesMap<SchemeRegistry::PolicyAreas>& ContentSecurityPolicyBypassingSchemes()\n{\n DEFINE_STATIC_LOCAL(URLSchemesMap<SchemeRegistry::PolicyAreas>, schemes, ());\n return schemes;\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsLocal(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return localURLSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsNoAccess(const String& scheme)\n{\n schemesWithUniqueOrigins().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsNoAccess(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return schemesWithUniqueOrigins().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsDisplayIsolated(const String& scheme)\n{\n displayIsolatedURLSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsDisplayIsolated(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return displayIsolatedURLSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsSecure(const String& scheme)\n{\n secureSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsSecure(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return secureSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsEmptyDocument(const String& scheme)\n{\n emptyDocumentSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldLoadURLSchemeAsEmptyDocument(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return emptyDocumentSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::setDomainRelaxationForbiddenForURLScheme(bool forbidden, const String& scheme)\n{\n if (scheme.isEmpty())\n return;\n\n if (forbidden)\n schemesForbiddenFromDomainRelaxation().add(scheme);\n else\n schemesForbiddenFromDomainRelaxation().remove(scheme);\n}\n\nbool SchemeRegistry::isDomainRelaxationForbiddenForURLScheme(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return schemesForbiddenFromDomainRelaxation().contains(scheme);\n}\n\nbool SchemeRegistry::canDisplayOnlyIfCanRequest(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return canDisplayOnlyIfCanRequestSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerAsCanDisplayOnlyIfCanRequest(const String& scheme)\n{\n canDisplayOnlyIfCanRequestSchemes().add(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsNotAllowingJavascriptURLs(const String& scheme)\n{\n notAllowingJavascriptURLsSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsNotAllowingJavascriptURLs(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return notAllowingJavascriptURLsSchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsCORSEnabled(const String& scheme)\n{\n CORSEnabledSchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsCORSEnabled(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return CORSEnabledSchemes().contains(scheme);\n}\n\nString SchemeRegistry::listOfCORSEnabledURLSchemes()\n{\n StringBuilder builder;\n bool addSeparator = false;\n for (const auto& scheme : CORSEnabledSchemes()) {\n if (addSeparator)\n builder.appendLiteral(\", \");\n else\n addSeparator = true;\n\n builder.append(scheme);\n }\n return builder.toString();\n}\n\nvoid SchemeRegistry::registerURLSchemeAsLegacy(const String& scheme)\n{\n LegacySchemes().add(scheme);\n}\n\nbool SchemeRegistry::shouldTreatURLSchemeAsLegacy(const String& scheme)\n{\n if (scheme.isEmpty())\n return false;\n return LegacySchemes().contains(scheme);\n}\n\nvoid SchemeRegistry::registerURLSchemeAsBypassingContentSecurityPolicy(const String& scheme, PolicyAreas policyAreas)\n{\n ContentSecurityPolicyBypassingSchemes().add(scheme, policyAreas);\n}\n\nvoid SchemeRegistry::removeURLSchemeRegisteredAsBypassingContentSecurityPolicy(const String& scheme)\n{\n ContentSecurityPolicyBypassingSchemes().remove(scheme);\n}\n\nbool SchemeRegistry::schemeShouldBypassContentSecurityPolicy(const String& scheme, PolicyAreas policyAreas)\n{\n ASSERT(policyAreas != PolicyAreaNone);\n if (scheme.isEmpty() || policyAreas == PolicyAreaNone)\n return false;\n\n \/\/ get() returns 0 (PolicyAreaNone) if there is no entry in the map.\n \/\/ Thus by default, schemes do not bypass CSP.\n return (ContentSecurityPolicyBypassingSchemes().get(scheme) & policyAreas) == policyAreas;\n}\n\n} \/\/ namespace blink\n<|endoftext|>"} {"text":"<commit_before>#include <armadillo>\n#include <gnuplot-iostream.h>\n\nusing namespace arma;\nusing namespace std;\n\nnamespace ic {\n\nclass SOM {\npublic:\n \/\/ Constructores\n SOM(const mat& patrones, pair<int, int> dimensiones);\n\n \/\/ Interfaz\n void entrenar(int nEpocas,\n double velocidadInicial,\n double velocidadFinal,\n int vecindadInicial,\n int vecindadFinal);\n void graficar(Gnuplot& gp) const;\n\n \/\/ Acceso a miembros\n const field<rowvec>& mapa() const { return m_mapa; };\n const mat& patrones() const { return m_patrones; };\n\nprivate:\n field<rowvec> m_mapa;\n const mat m_patrones;\n};\n\nSOM::SOM(const mat& patrones, pair<int, int> dimensiones)\n : m_patrones{patrones}\n{\n m_mapa = field<rowvec>(dimensiones.first, dimensiones.second);\n\n \/\/ Inicializar mapa\n for (unsigned int i = 0; i < m_mapa.n_rows; ++i) {\n for (unsigned int j = 0; j < m_mapa.n_cols; ++j) {\n m_mapa(i, j) = randu<rowvec>(patrones.n_cols) - 0.5;\n }\n }\n}\n\nvoid SOM::entrenar(int nEpocas,\n double velocidadInicial,\n double velocidadFinal,\n int vecindadInicial,\n int vecindadFinal)\n{\n const vec velocidad = linspace(velocidadInicial, velocidadFinal, nEpocas);\n \/\/ Redondeamos la vecindad porque necesitamos que tenga valores enteros\n const vec vecindad = round(linspace(vecindadInicial, vecindadFinal, nEpocas));\n\n for (int epoca = 0; epoca < nEpocas; ++epoca) {\n for (unsigned int n = 0; n < m_patrones.n_rows; ++n) {\n\n \/\/ Buscamos la neurona ganadora\n pair<int, int> coordGanadora;\n double distanciaGanadora = numeric_limits<double>::max();\n\n for (unsigned int j = 0; j < m_mapa.n_rows; ++j) {\n for (unsigned int k = 0; k < m_mapa.n_cols; ++k) {\n const double distancia = norm(m_patrones.row(n) - m_mapa(j, k));\n\n if (distancia < distanciaGanadora) {\n distanciaGanadora = distancia;\n coordGanadora = {j, k};\n }\n }\n }\n\n \/\/ Adaptación de pesos\n const int maxX = int(m_mapa.n_rows - 1);\n const int maxY = int(m_mapa.n_cols - 1);\n const int xInicial = (coordGanadora.first - vecindad(epoca) < 0) ? 0 : (coordGanadora.first - vecindad(epoca));\n const int xFinal = (coordGanadora.first + vecindad(epoca) > maxX) ? maxX : (coordGanadora.first + vecindad(epoca));\n const int yInicial = (coordGanadora.second - vecindad(epoca) < 0) ? 0 : (coordGanadora.second - vecindad(epoca));\n const int yFinal = (coordGanadora.second + vecindad(epoca) > maxY) ? maxY : (coordGanadora.second + vecindad(epoca));\n\n for (int x = xInicial; x <= xFinal; ++x) {\n for (int y = yInicial; y <= yFinal; ++y) {\n m_mapa(x, y) += velocidad(epoca) * (m_patrones.row(n) - m_mapa(x, y));\n }\n }\n }\n }\n}\n\nvoid SOM::graficar(gnuplotio::Gnuplot& gp) const\n{\n gp << \"set key box opaque width 3\" << endl\n << \"set xlabel 'x_1' font ',11'\" << endl\n << \"set ylabel 'x_2' font ',11'\" << endl\n << \"plot \";\n \/\/ Graficar neuronas del mapa\n for (unsigned int x = 0; x < m_mapa.n_rows; ++x) {\n for (unsigned int y = 0; y < m_mapa.n_cols; ++y) {\n gp << gp.file1d(m_mapa(x, y).eval()) << \"notitle with points ps 2 pt 1 lt -1 lw 3, \";\n\n \/\/ Graficar conexiones con las vecinas\n if (x != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y)).eval()) << \"notitle with lines lt -1, \";\n if (y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x, y + 1)).eval()) << \"notitle with lines lt -1, \";\n \/\/ Graficar conexiones con las vecinas diagonales\n if (x != 0 && y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != 0 && y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y + 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1 && y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1 && y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y + 1)).eval()) << \"notitle with lines lt -1, \";\n }\n }\n\n \/\/ Graficar patrones\n gp << gp.file1d(m_patrones) << \"title 'Patrones' with points pt 2 ps 1 lt rgb 'blue', \"\n << \"NaN title 'Neuronas' with points ps 2 pt 1 lt -1 lw 3\" << endl;\n}\n}\n<commit_msg>Guia 2 - SOM: Modificaciones cosméticas al código de SOM::graficar()<commit_after>#include <armadillo>\n#include <gnuplot-iostream.h>\n\nusing namespace arma;\nusing namespace std;\n\nnamespace ic {\n\nclass SOM {\npublic:\n \/\/ Constructores\n SOM(const mat& patrones, pair<int, int> dimensiones);\n\n \/\/ Interfaz\n void entrenar(int nEpocas,\n double velocidadInicial,\n double velocidadFinal,\n int vecindadInicial,\n int vecindadFinal);\n void graficar(Gnuplot& gp) const;\n\n \/\/ Acceso a miembros\n const field<rowvec>& mapa() const { return m_mapa; };\n const mat& patrones() const { return m_patrones; };\n\nprivate:\n field<rowvec> m_mapa;\n const mat m_patrones;\n};\n\nSOM::SOM(const mat& patrones, pair<int, int> dimensiones)\n : m_patrones{patrones}\n{\n m_mapa = field<rowvec>(dimensiones.first, dimensiones.second);\n\n \/\/ Inicializar mapa\n for (unsigned int i = 0; i < m_mapa.n_rows; ++i) {\n for (unsigned int j = 0; j < m_mapa.n_cols; ++j) {\n m_mapa(i, j) = randu<rowvec>(patrones.n_cols) - 0.5;\n }\n }\n}\n\nvoid SOM::entrenar(int nEpocas,\n double velocidadInicial,\n double velocidadFinal,\n int vecindadInicial,\n int vecindadFinal)\n{\n const vec velocidad = linspace(velocidadInicial, velocidadFinal, nEpocas);\n \/\/ Redondeamos la vecindad porque necesitamos que tenga valores enteros\n const vec vecindad = round(linspace(vecindadInicial, vecindadFinal, nEpocas));\n\n for (int epoca = 0; epoca < nEpocas; ++epoca) {\n for (unsigned int n = 0; n < m_patrones.n_rows; ++n) {\n\n \/\/ Buscamos la neurona ganadora\n pair<int, int> coordGanadora;\n double distanciaGanadora = numeric_limits<double>::max();\n\n for (unsigned int j = 0; j < m_mapa.n_rows; ++j) {\n for (unsigned int k = 0; k < m_mapa.n_cols; ++k) {\n const double distancia = norm(m_patrones.row(n) - m_mapa(j, k));\n\n if (distancia < distanciaGanadora) {\n distanciaGanadora = distancia;\n coordGanadora = {j, k};\n }\n }\n }\n\n \/\/ Adaptación de pesos\n const int maxX = int(m_mapa.n_rows - 1);\n const int maxY = int(m_mapa.n_cols - 1);\n const int xInicial = (coordGanadora.first - vecindad(epoca) < 0) ? 0 : (coordGanadora.first - vecindad(epoca));\n const int xFinal = (coordGanadora.first + vecindad(epoca) > maxX) ? maxX : (coordGanadora.first + vecindad(epoca));\n const int yInicial = (coordGanadora.second - vecindad(epoca) < 0) ? 0 : (coordGanadora.second - vecindad(epoca));\n const int yFinal = (coordGanadora.second + vecindad(epoca) > maxY) ? maxY : (coordGanadora.second + vecindad(epoca));\n\n for (int x = xInicial; x <= xFinal; ++x) {\n for (int y = yInicial; y <= yFinal; ++y) {\n m_mapa(x, y) += velocidad(epoca) * (m_patrones.row(n) - m_mapa(x, y));\n }\n }\n }\n }\n}\n\nvoid SOM::graficar(Gnuplot& gp) const\n{\n gp << \"set key box opaque width 3\" << endl\n << \"set xlabel 'x_1' font ',11'\" << endl\n << \"set ylabel 'x_2' font ',11'\" << endl\n << \"plot \";\n\n \/\/ Graficar neuronas del mapa y las conexiones\n for (unsigned int x = 0; x < m_mapa.n_rows; ++x) {\n for (unsigned int y = 0; y < m_mapa.n_cols; ++y) {\n \/\/ Graficar la neurona\n gp << gp.file1d(m_mapa(x, y).eval()) << \"notitle with points ps 2 pt 1 lt -1 lw 3, \";\n\n \/\/ Graficar conexiones con las vecinas horizontales y verticales\n if (x != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y)).eval()) << \"notitle with lines lt -1, \";\n if (y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x, y + 1)).eval()) << \"notitle with lines lt -1, \";\n\n \/\/ Graficar conexiones con las vecinas diagonales\n if (x != 0 && y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != 0 && y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x - 1, y + 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1 && y != 0)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y - 1)).eval()) << \"notitle with lines lt -1, \";\n if (x != m_mapa.n_rows - 1 && y != m_mapa.n_cols - 1)\n gp << gp.file1d(join_vert(m_mapa(x, y), m_mapa(x + 1, y + 1)).eval()) << \"notitle with lines lt -1, \";\n }\n }\n\n \/\/ Graficar patrones\n gp << gp.file1d(m_patrones) << \"title 'Patrones' with points pt 2 ps 1 lt rgb 'blue', \"\n << \"NaN title 'Neuronas' with points ps 2 pt 1 lt -1 lw 3\" << endl;\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <debugger\/impl.h>\n#include <debugger\/path.h>\n#include <base\/util\/unicode.h>\n#include <base\/util\/dynarray.h>\n#include <deque>\n#include <regex>\n\nnamespace vscode\n{\n\tstatic bool match_sourcemap(const std::string& srv, std::string& cli, const std::string& srvmatch, const std::string& climatch)\n\t{\n\t\tsize_t i = 0;\n\t\tfor (; i < srvmatch.size(); ++i) {\n\t\t\tif (i >= srv.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (path::tochar(srvmatch[i]) == path::tochar(srv[i])) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tcli = climatch + srv.substr(i);\n\t\treturn true;\n\t}\n\n\tvoid debugger_impl::initialize_pathconvert(config& config)\n\t{\n\t\tsourceMap_.clear();\n\t\tauto& sourceMaps = config.get(\"sourceMaps\", rapidjson::kArrayType);\n\t\tfor (auto& e : sourceMaps.GetArray())\n\t\t{\n\t\t\tif (!e.IsArray())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tauto eary = e.GetArray();\n\t\t\tif (eary.Size() < 2 || !eary[0].IsString() || !eary[1].IsString())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsourceMap_.push_back(std::make_pair(eary[0].Get<std::string>(), eary[1].Get<std::string>()));\n\t\t}\n\t\tauto& skipFiles = config.get(\"skipFiles\", rapidjson::kArrayType);\n\t\tfor (auto& e : skipFiles.GetArray())\n\t\t{\n\t\t\tif (!e.IsString())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tskipFiles_.push_back(e.Get<std::string>());\n\t\t}\n\t\tworkspaceFolder_ = config.get(\"workspaceFolder\", rapidjson::kStringType).Get<std::string>();\n\t}\n\n\tbool debugger_impl::path_server2client(const std::string& server, std::string& client)\n\t{\n\t\tfor (auto& it : skipFiles_)\n\t\t{\n\t\t\tif (path::glob_match(it, server))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& it : sourceMap_)\n\t\t{\n\t\t\tif (match_sourcemap(server, client, it.first, it.second))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tclient = server;\n\t\treturn true;\n\t}\n\n\tbool debugger_impl::path_source2server(const std::string& source, std::string& server)\n\t{\n\t\tif (custom_) {\n\t\t\treturn custom_->path_convert(source, server);\n\t\t}\n\t\tif (source[0] != '@') {\n\t\t\treturn false;\n\t\t}\n\t\tserver = sourceCoding_ == eCoding::utf8\n\t\t\t? source.substr(1)\n\t\t\t: base::a2u(base::strview(source.data() + 1, source.size() - 1))\n\t\t\t;\n\t\treturn true;\n\t}\n\n\tbool debugger_impl::path_source2client(const std::string& source, std::string& client)\n\t{\n\t\tstd::string server;\n\t\treturn path_source2server(source, server) && path_server2client(server, client);\n\t}\n\n\tbool debugger_impl::path_convert(const std::string& source, std::string& client)\n\t{\n\t\tauto it = source2client_.find(source);\n\t\tif (it != source2client_.end()) {\n\t\t\tclient = it->second;\n\t\t\treturn !client.empty();\n\t\t}\n\t\tbool ok = path_source2client(source, client);\n\t\tsource2client_[source] = client;\n\t\treturn ok;\n\t}\n\n\tstd::string debugger_impl::path_exception(const std::string& str)\n\t{\n\t\tif (sourceCoding_ == eCoding::utf8) {\n\t\t\treturn str;\n\t\t}\n\t\tstd::regex re(R\"(([^\\r\\n]+)(\\:[0-9]+\\:[^\\r\\n]+))\");\n\t\tstd::string res;\n\t\tstd::smatch m;\n\t\tauto it = str.begin();\n\t\tfor (; std::regex_search(it, str.end(), m, re); it = m[0].second) {\n\t\t\tres += std::string(it, m[0].first);\n\t\t\tres += base::a2u(std::string(m[1].first, m[1].second));\n\t\t\tres += std::string(m[2].first, m[2].second);\n\t\t}\n\t\tres += std::string(it, str.end());\n\t\treturn res;\n\t}\n\n\tstd::string debugger_impl::path_clientrelative(const std::string& path) {\n\t\tif (workspaceFolder_.empty()) {\n\t\t\treturn path;\n\t\t}\n\t\treturn path::relative(path, workspaceFolder_, '\/');\n\t}\n}\n<commit_msg>Revert \"转换失败时不改变路径\"<commit_after>#include <debugger\/impl.h>\n#include <debugger\/path.h>\n#include <base\/util\/unicode.h>\n#include <base\/util\/dynarray.h>\n#include <deque>\n#include <regex>\n\nnamespace vscode\n{\n\tstatic bool match_sourcemap(const std::string& srv, std::string& cli, const std::string& srvmatch, const std::string& climatch)\n\t{\n\t\tsize_t i = 0;\n\t\tfor (; i < srvmatch.size(); ++i) {\n\t\t\tif (i >= srv.size()) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (path::tochar(srvmatch[i]) == path::tochar(srv[i])) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\tcli = climatch + srv.substr(i);\n\t\treturn true;\n\t}\n\n\tvoid debugger_impl::initialize_pathconvert(config& config)\n\t{\n\t\tsourceMap_.clear();\n\t\tauto& sourceMaps = config.get(\"sourceMaps\", rapidjson::kArrayType);\n\t\tfor (auto& e : sourceMaps.GetArray())\n\t\t{\n\t\t\tif (!e.IsArray())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tauto eary = e.GetArray();\n\t\t\tif (eary.Size() < 2 || !eary[0].IsString() || !eary[1].IsString())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tsourceMap_.push_back(std::make_pair(eary[0].Get<std::string>(), eary[1].Get<std::string>()));\n\t\t}\n\t\tauto& skipFiles = config.get(\"skipFiles\", rapidjson::kArrayType);\n\t\tfor (auto& e : skipFiles.GetArray())\n\t\t{\n\t\t\tif (!e.IsString())\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tskipFiles_.push_back(e.Get<std::string>());\n\t\t}\n\t\tworkspaceFolder_ = config.get(\"workspaceFolder\", rapidjson::kStringType).Get<std::string>();\n\t}\n\n\tbool debugger_impl::path_server2client(const std::string& server, std::string& client)\n\t{\n\t\tfor (auto& it : skipFiles_)\n\t\t{\n\t\t\tif (path::glob_match(it, server))\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (auto& it : sourceMap_)\n\t\t{\n\t\t\tif (match_sourcemap(server, client, it.first, it.second))\n\t\t\t{\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tclient = path::normalize(server, '\/');\n\t\treturn true;\n\t}\n\n\tbool debugger_impl::path_source2server(const std::string& source, std::string& server)\n\t{\n\t\tif (custom_) {\n\t\t\treturn custom_->path_convert(source, server);\n\t\t}\n\t\tif (source[0] != '@') {\n\t\t\treturn false;\n\t\t}\n\t\tserver = sourceCoding_ == eCoding::utf8\n\t\t\t? source.substr(1)\n\t\t\t: base::a2u(base::strview(source.data() + 1, source.size() - 1))\n\t\t\t;\n\t\treturn true;\n\t}\n\n\tbool debugger_impl::path_source2client(const std::string& source, std::string& client)\n\t{\n\t\tstd::string server;\n\t\treturn path_source2server(source, server) && path_server2client(server, client);\n\t}\n\n\tbool debugger_impl::path_convert(const std::string& source, std::string& client)\n\t{\n\t\tauto it = source2client_.find(source);\n\t\tif (it != source2client_.end()) {\n\t\t\tclient = it->second;\n\t\t\treturn !client.empty();\n\t\t}\n\t\tbool ok = path_source2client(source, client);\n\t\tsource2client_[source] = client;\n\t\treturn ok;\n\t}\n\n\tstd::string debugger_impl::path_exception(const std::string& str)\n\t{\n\t\tif (sourceCoding_ == eCoding::utf8) {\n\t\t\treturn str;\n\t\t}\n\t\tstd::regex re(R\"(([^\\r\\n]+)(\\:[0-9]+\\:[^\\r\\n]+))\");\n\t\tstd::string res;\n\t\tstd::smatch m;\n\t\tauto it = str.begin();\n\t\tfor (; std::regex_search(it, str.end(), m, re); it = m[0].second) {\n\t\t\tres += std::string(it, m[0].first);\n\t\t\tres += base::a2u(std::string(m[1].first, m[1].second));\n\t\t\tres += std::string(m[2].first, m[2].second);\n\t\t}\n\t\tres += std::string(it, str.end());\n\t\treturn res;\n\t}\n\n\tstd::string debugger_impl::path_clientrelative(const std::string& path) {\n\t\tif (workspaceFolder_.empty()) {\n\t\t\treturn path;\n\t\t}\n\t\treturn path::relative(path, workspaceFolder_, '\/');\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Part: fix missing signal disconnect in TaskFaceColors<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ManifestExport.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: mtg $ $Date: 2001-07-04 14:56:22 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n\n#ifndef _MANIFEST_EXPORT_HXX\n#include <ManifestExport.hxx>\n#endif\n#ifndef _ATTRIBUTE_LIST_HXX\n#include <AttributeList.hxx>\n#endif\n#ifndef _MANIFEST_DEFINES_HXX\n#include <ManifestDefines.hxx>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HXX\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n#ifndef _BASE64_CODEC_HXX_\n#include <Base64Codec.hxx>\n#endif\n\nusing namespace rtl;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::xml::sax;\n\nManifestExport::ManifestExport(Reference < XDocumentHandler > xHandler, const Sequence < Sequence < PropertyValue > > &rManList)\n{\n const OUString sFileEntryElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_FILE_ENTRY ) );\n const OUString sManifestElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_MANIFEST ) );\n const OUString sEncryptionDataElement( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_ENCRYPTION_DATA ) );\n const OUString sAlgorithmElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_ALGORITHM ) );\n const OUString sKeyDerivationElement( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_KEY_DERIVATION ) );\n\n const OUString sCdataAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_CDATA ) );\n const OUString sMediaTypeAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_MEDIA_TYPE ) );\n const OUString sFullPathAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_FULL_PATH ) );\n const OUString sSizeAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_SIZE ) );\n const OUString sSaltAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_SALT ) );\n const OUString sInitialisationVectorAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_INITIALISATION_VECTOR ) );\n const OUString sIterationCountAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_ITERATION_COUNT ) );\n const OUString sAlgorithmNameAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_ALGORITHM_NAME ) );\n const OUString sKeyDerivationNameAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_KEY_DERIVATION_NAME ) );\n\n const OUString sFullPathProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"FullPath\" ) );\n const OUString sMediaTypeProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"MediaType\" ) );\n const OUString sIterationCountProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"IterationCount\" ) );\n const OUString sSaltProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"Salt\" ) );\n const OUString sInitialisationVectorProperty( RTL_CONSTASCII_USTRINGPARAM ( \"InitialisationVector\" ) );\n const OUString sSizeProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"Size\" ) );\n\n const OUString sWhiteSpace ( RTL_CONSTASCII_USTRINGPARAM ( \" \" ) );\n const OUString sBlowfish ( RTL_CONSTASCII_USTRINGPARAM ( \"Blowfish CFB\" ) );\n const OUString sPBKDF2 ( RTL_CONSTASCII_USTRINGPARAM ( \"PBKDF2\" ) );\n\n AttributeList * pRootAttrList = new AttributeList;\n pRootAttrList->AddAttribute ( OUString( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_XMLNS ) ),\n sCdataAttribute,\n OUString( RTL_CONSTASCII_USTRINGPARAM ( MANIFEST_NAMESPACE ) ) );\n\n Reference < XAttributeList > xRootAttrList (pRootAttrList);\n\n xHandler->startDocument();\n Reference < XExtendedDocumentHandler > xExtHandler ( xHandler, UNO_QUERY );\n if (xExtHandler.is())\n {\n OUString aDocType ( RTL_CONSTASCII_USTRINGPARAM ( MANIFEST_DOCTYPE ) );\n xExtHandler->unknown ( aDocType );\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sManifestElement, xRootAttrList );\n\n const Sequence < PropertyValue > *pSequence = rManList.getConstArray();\n\n for (sal_uInt32 i = 0, nEnd = rManList.getLength() ; i < nEnd ; i++)\n {\n AttributeList *pAttrList = new AttributeList;\n const PropertyValue *pValue = pSequence->getConstArray();\n OUString aString;\n const PropertyValue *pVector = NULL, *pSalt = NULL, *pIterationCount = NULL;\n for (sal_uInt32 j = 0, nNum = pSequence->getLength(); j < nNum; j++, pValue++)\n {\n if (pValue->Name.equals (sMediaTypeProperty) )\n {\n pValue->Value >>= aString;\n pAttrList->AddAttribute ( sMediaTypeAttribute, sCdataAttribute, aString );\n }\n else if (pValue->Name.equals (sFullPathProperty) )\n {\n pValue->Value >>= aString;\n pAttrList->AddAttribute ( sFullPathAttribute, sCdataAttribute, aString );\n }\n else if (pValue->Name.equals (sSizeProperty) )\n {\n sal_Int32 nSize;\n pValue->Value >>= nSize;\n OUStringBuffer aBuffer;\n aBuffer.append ( nSize );\n pAttrList->AddAttribute ( sSizeAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n }\n else if (pValue->Name.equals (sInitialisationVectorProperty) )\n pVector = pValue;\n else if (pValue->Name.equals (sSaltProperty) )\n pSalt = pValue;\n else if (pValue->Name.equals (sIterationCountProperty) )\n pIterationCount = pValue;\n }\n Reference < XAttributeList > xAttrList = pAttrList;\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sFileEntryElement , xAttrList);\n if ( pVector && pSalt && pIterationCount )\n {\n AttributeList * pAttrList = new AttributeList;\n Reference < XAttributeList > xAttrList (pAttrList);\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sEncryptionDataElement , xAttrList);\n\n pAttrList = new AttributeList;\n xAttrList = pAttrList;\n\n pAttrList->AddAttribute ( sAlgorithmNameAttribute, sCdataAttribute, sBlowfish );\n\n OUStringBuffer aBuffer;\n Sequence < sal_uInt8 > aSequence;\n pVector->Value >>= aSequence;\n Base64Codec::encodeBase64 ( aBuffer, aSequence );\n pAttrList->AddAttribute ( sInitialisationVectorAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sAlgorithmElement , xAttrList);\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sAlgorithmElement );\n\n pAttrList = new AttributeList;\n xAttrList = pAttrList;\n\n pAttrList->AddAttribute ( sKeyDerivationNameAttribute, sCdataAttribute, sPBKDF2 );\n\n sal_Int32 nCount;\n pIterationCount->Value >>= nCount;\n aBuffer.append (nCount);\n pAttrList->AddAttribute ( sIterationCountAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n pSalt->Value >>= aSequence;\n Base64Codec::encodeBase64 ( aBuffer, aSequence );\n pAttrList->AddAttribute ( sSaltAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sKeyDerivationElement , xAttrList);\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sKeyDerivationElement );\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sEncryptionDataElement );\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sFileEntryElement );\n pSequence++;\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sManifestElement );\n xHandler->endDocument();\n}\n<commit_msg>#90699# Export MD5 of decrypted stream<commit_after>\/*************************************************************************\n *\n * $RCSfile: ManifestExport.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: mtg $ $Date: 2001-09-05 19:21:21 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n\n#ifndef _MANIFEST_EXPORT_HXX\n#include <ManifestExport.hxx>\n#endif\n#ifndef _ATTRIBUTE_LIST_HXX\n#include <AttributeList.hxx>\n#endif\n#ifndef _MANIFEST_DEFINES_HXX\n#include <ManifestDefines.hxx>\n#endif\n#ifndef _COM_SUN_STAR_XML_SAX_XATTRIBUTELIST_HXX\n#include <com\/sun\/star\/xml\/sax\/XAttributeList.hpp>\n#endif\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n#ifndef _BASE64_CODEC_HXX_\n#include <Base64Codec.hxx>\n#endif\n\nusing namespace rtl;\nusing namespace com::sun::star::beans;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::xml::sax;\n\nManifestExport::ManifestExport(Reference < XDocumentHandler > xHandler, const Sequence < Sequence < PropertyValue > > &rManList)\n{\n const OUString sFileEntryElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_FILE_ENTRY ) );\n const OUString sManifestElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_MANIFEST ) );\n const OUString sEncryptionDataElement( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_ENCRYPTION_DATA ) );\n const OUString sAlgorithmElement ( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_ALGORITHM ) );\n const OUString sKeyDerivationElement( RTL_CONSTASCII_USTRINGPARAM ( ELEMENT_KEY_DERIVATION ) );\n\n const OUString sCdataAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_CDATA ) );\n const OUString sMediaTypeAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_MEDIA_TYPE ) );\n const OUString sFullPathAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_FULL_PATH ) );\n const OUString sSizeAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_SIZE ) );\n const OUString sSaltAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_SALT ) );\n const OUString sInitialisationVectorAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_INITIALISATION_VECTOR ) );\n const OUString sIterationCountAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_ITERATION_COUNT ) );\n const OUString sAlgorithmNameAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_ALGORITHM_NAME ) );\n const OUString sKeyDerivationNameAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_KEY_DERIVATION_NAME ) );\n const OUString sChecksumTypeAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_CHECKSUM_TYPE ) );\n const OUString sChecksumAttribute ( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_CHECKSUM) );\n\n const OUString sFullPathProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"FullPath\" ) );\n const OUString sMediaTypeProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"MediaType\" ) );\n const OUString sIterationCountProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"IterationCount\" ) );\n const OUString sSaltProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"Salt\" ) );\n const OUString sInitialisationVectorProperty( RTL_CONSTASCII_USTRINGPARAM ( \"InitialisationVector\" ) );\n const OUString sSizeProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"Size\" ) );\n const OUString sDigestProperty ( RTL_CONSTASCII_USTRINGPARAM ( \"Digest\" ) );\n\n const OUString sWhiteSpace ( RTL_CONSTASCII_USTRINGPARAM ( \" \" ) );\n const OUString sBlowfish ( RTL_CONSTASCII_USTRINGPARAM ( \"Blowfish CFB\" ) );\n const OUString sPBKDF2 ( RTL_CONSTASCII_USTRINGPARAM ( \"PBKDF2\" ) );\n const OUString sMD5 ( RTL_CONSTASCII_USTRINGPARAM ( \"MD5\" ) );\n\n AttributeList * pRootAttrList = new AttributeList;\n pRootAttrList->AddAttribute ( OUString( RTL_CONSTASCII_USTRINGPARAM ( ATTRIBUTE_XMLNS ) ),\n sCdataAttribute,\n OUString( RTL_CONSTASCII_USTRINGPARAM ( MANIFEST_NAMESPACE ) ) );\n\n Reference < XAttributeList > xRootAttrList (pRootAttrList);\n\n xHandler->startDocument();\n Reference < XExtendedDocumentHandler > xExtHandler ( xHandler, UNO_QUERY );\n if (xExtHandler.is())\n {\n OUString aDocType ( RTL_CONSTASCII_USTRINGPARAM ( MANIFEST_DOCTYPE ) );\n xExtHandler->unknown ( aDocType );\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sManifestElement, xRootAttrList );\n\n const Sequence < PropertyValue > *pSequence = rManList.getConstArray();\n\n for (sal_uInt32 i = 0, nEnd = rManList.getLength() ; i < nEnd ; i++)\n {\n AttributeList *pAttrList = new AttributeList;\n const PropertyValue *pValue = pSequence->getConstArray();\n OUString aString;\n const PropertyValue *pVector = NULL, *pSalt = NULL, *pIterationCount = NULL, *pDigest = NULL;\n for (sal_uInt32 j = 0, nNum = pSequence->getLength(); j < nNum; j++, pValue++)\n {\n if (pValue->Name.equals (sMediaTypeProperty) )\n {\n pValue->Value >>= aString;\n pAttrList->AddAttribute ( sMediaTypeAttribute, sCdataAttribute, aString );\n }\n else if (pValue->Name.equals (sFullPathProperty) )\n {\n pValue->Value >>= aString;\n pAttrList->AddAttribute ( sFullPathAttribute, sCdataAttribute, aString );\n }\n else if (pValue->Name.equals (sSizeProperty) )\n {\n sal_Int32 nSize;\n pValue->Value >>= nSize;\n OUStringBuffer aBuffer;\n aBuffer.append ( nSize );\n pAttrList->AddAttribute ( sSizeAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n }\n else if (pValue->Name.equals (sInitialisationVectorProperty) )\n pVector = pValue;\n else if (pValue->Name.equals (sSaltProperty) )\n pSalt = pValue;\n else if (pValue->Name.equals (sIterationCountProperty) )\n pIterationCount = pValue;\n else if (pValue->Name.equals ( sDigestProperty ) )\n pDigest = pValue;\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n Reference < XAttributeList > xAttrList ( pAttrList );\n xHandler->startElement( sFileEntryElement , xAttrList);\n if ( pVector && pSalt && pIterationCount )\n {\n AttributeList * pAttrList = new AttributeList;\n Reference < XAttributeList > xAttrList (pAttrList);\n OUStringBuffer aBuffer;\n Sequence < sal_uInt8 > aSequence;\n\n xHandler->ignorableWhitespace ( sWhiteSpace );\n if ( pDigest )\n {\n pAttrList->AddAttribute ( sChecksumTypeAttribute, sCdataAttribute, sMD5 );\n pDigest->Value >>= aSequence;\n Base64Codec::encodeBase64 ( aBuffer, aSequence );\n pAttrList->AddAttribute ( sChecksumAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n }\n xHandler->startElement( sEncryptionDataElement , xAttrList);\n\n pAttrList = new AttributeList;\n xAttrList = pAttrList;\n\n pAttrList->AddAttribute ( sAlgorithmNameAttribute, sCdataAttribute, sBlowfish );\n\n pVector->Value >>= aSequence;\n Base64Codec::encodeBase64 ( aBuffer, aSequence );\n pAttrList->AddAttribute ( sInitialisationVectorAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sAlgorithmElement , xAttrList);\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sAlgorithmElement );\n\n pAttrList = new AttributeList;\n xAttrList = pAttrList;\n\n pAttrList->AddAttribute ( sKeyDerivationNameAttribute, sCdataAttribute, sPBKDF2 );\n\n sal_Int32 nCount;\n pIterationCount->Value >>= nCount;\n aBuffer.append (nCount);\n pAttrList->AddAttribute ( sIterationCountAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n pSalt->Value >>= aSequence;\n Base64Codec::encodeBase64 ( aBuffer, aSequence );\n pAttrList->AddAttribute ( sSaltAttribute, sCdataAttribute, aBuffer.makeStringAndClear() );\n\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->startElement( sKeyDerivationElement , xAttrList);\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sKeyDerivationElement );\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sEncryptionDataElement );\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sFileEntryElement );\n pSequence++;\n }\n xHandler->ignorableWhitespace ( sWhiteSpace );\n xHandler->endElement( sManifestElement );\n xHandler->endDocument();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @cond ___LICENSE___\n *\n * Copyright (c) 2016 Koen Visscher, Paul Visscher and individual contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @endcond\n *\/\n\n#include \"math\/mathf.h\"\n\n#include <assert.h>\n#include <cstdlib>\n#include <limits>\n\n#define _USE_MATH_DEFINES\n#include <math.h>\n\nF32 Mathf::GetEpsilon()\n{\n return std::numeric_limits<F32>::epsilon();\n}\n\nF32 Mathf::GetPi()\n{\n return ( F32 )M_PI;\n}\n\nF32 Mathf::Get2Pi()\n{\n return ( F32 )M_PI_2;\n}\n\nF32 Mathf::GetSqrt2()\n{\n return ( F32 )M_SQRT2;\n}\n\nF32 Mathf::GetE()\n{\n return ( F32 )M_E;\n}\n\nF32 Mathf::GetLog2E()\n{\n return ( F32 )M_LOG2E;\n}\n\nF32 Mathf::GetLog10E()\n{\n return ( F32 )M_LOG10E;\n}\n\nF32 Mathf::GetLn2()\n{\n return ( F32 )M_LN2;\n}\n\nF32 Mathf::GetLn10()\n{\n return ( F32 )M_LN10;\n}\n\nF32 Mathf::Abs( const F32 f )\n{\n return fabsf( f );\n}\n\nU32 Mathf::Abs( const U32 f )\n{\n return abs( ( int )f );\n}\n\nF32 Mathf::Acos( const F32 f )\n{\n assert( f >= -1.0f && f <= 1.0f );\n return acosf( f );\n}\n\nF32 Mathf::Asin( const F32 f )\n{\n assert( f >= -1.0f && f <= 1.0f );\n return asinf( f );\n}\n\nF32 Mathf::Atan( const F32 f )\n{\n return atanf( f );\n}\n\nF32 Mathf::Atan2( const F32 x, const F32 y )\n{\n return atan2f( x, y );\n}\n\nF32 Mathf::Cos( const F32 f )\n{\n return cosf( f );\n}\n\nF32 Mathf::Sin( const F32 f )\n{\n return sinf( f );\n}\n\nF32 Mathf::Tan( const F32 f )\n{\n return tanf( f );\n}\n\nF32 Mathf::Exp( const F32 f )\n{\n return expf( f );\n}\n\nF32 Mathf::Ceil( const F32 f )\n{\n return ceilf( f );\n}\n\nF32 Mathf::Floor( const F32 f )\n{\n return floorf( f );\n}\n\nF32 Mathf::Round( const F32 f )\n{\n return f >= 0.0 ? f + 0.5f : ( ( f - ( F32 )( S32 )f ) <= -0.5 ? f : f - 0.5f );\n}\n\nF32 Mathf::FMod( const F32 f, const F32 m )\n{\n return std::fmodf( f, m );\n}\n\nF32 Mathf::Log( const F32 f )\n{\n assert( f > 0.0f );\n return logf( f );\n}\n\nF32 Mathf::Log2( const F32 f )\n{\n assert( f > 0.0f );\n return logf( f ) \/ logf( 2 );\n}\n\nU32 Mathf::Log2( U64 n )\n{\n static const U32 tab64[64] =\n {\n 0, 58, 1, 59, 47, 53, 2, 60, 39, 48, 27, 54, 33, 42, 3, 61,\n 51, 37, 40, 49, 18, 28, 20, 55, 30, 34, 11, 43, 14, 22, 4, 62,\n 57, 46, 52, 38, 26, 32, 41, 50, 36, 17, 19, 29, 10, 13, 21, 56,\n 45, 25, 31, 35, 16, 9, 12, 44, 24, 15, 8, 23, 7, 6, 5, 63\n };\n\n n |= n >> 1;\n n |= n >> 2;\n n |= n >> 4;\n n |= n >> 8;\n n |= n >> 16;\n n |= n >> 32;\n return tab64[( n * 0x03f6eaf2cd271461 ) >> 58];\n}\n\nU32 Mathf::Log2( U32 f )\n{\n U32 s, t;\n\n t = ( f > 0xffff ) << 4;\n f >>= t;\n s = ( f > 0xff ) << 3;\n f >>= s, t |= s;\n s = ( f > 0xf ) << 2;\n f >>= s, t |= s;\n s = ( f > 0x3 ) << 1;\n f >>= s, t |= s;\n\n return ( t | ( f >> 1 ) );\n}\n\n\nF32 Mathf::Log10( const F32 f )\n{\n assert( f > 0.0f );\n return log10f( f );\n}\n\nF32 Mathf::Pow( const F32 base, const F32 exp )\n{\n return powf( base, exp );\n}\n\nF32 Mathf::Sqrt( const F32 f )\n{\n assert( f >= 0.0f );\n return sqrtf( f );\n}\n\nF32 Mathf::Square( F32 f )\n{\n return f * f;\n}\n\nF32 Mathf::Clamp( const F32 f, const F32 min, const F32 max )\n{\n return f < min ? min : ( f > max ? max : f );\n}\n\nF32 Mathf::RadToDeg( const F32 f )\n{\n return f * 180.0f \/ GetPi();\n}\n\nF32 Mathf::DegToRad( const F32 f )\n{\n return f * GetPi() \/ 180.0f;\n}\n\nF32 Mathf::Lerp( const F32 a, const F32 b, const F32 t )\n{\n return a + ( b - a ) * t;\n}\n\nbool Mathf::IsPow2( const U32 n )\n{\n return ( !( n & ( n - 1 ) ) && n );\n}\n\nU32 Mathf::NextPow2( const U32 x )\n{\n U32 y = x - 1;\n y |= y >> 1;\n y |= y >> 2;\n y |= y >> 4;\n y |= y >> 8;\n y |= y >> 16;\n return ++y;\n}\n\nbool Mathf::Equal( const F32 a, const F32 b )\n{\n return fabs( a - b ) < GetEpsilon();\n}\n<commit_msg>Fixed namespace<commit_after>\/**\n * @cond ___LICENSE___\n *\n * Copyright (c) 2016 Koen Visscher, Paul Visscher and individual contributors.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @endcond\n *\/\n\n#include \"math\/mathf.h\"\n\n#include <assert.h>\n#include <cstdlib>\n#include <limits>\n\n#define _USE_MATH_DEFINES\n#include <math.h>\n\nF32 Mathf::GetEpsilon()\n{\n return std::numeric_limits<F32>::epsilon();\n}\n\nF32 Mathf::GetPi()\n{\n return ( F32 )M_PI;\n}\n\nF32 Mathf::Get2Pi()\n{\n return ( F32 )M_PI_2;\n}\n\nF32 Mathf::GetSqrt2()\n{\n return ( F32 )M_SQRT2;\n}\n\nF32 Mathf::GetE()\n{\n return ( F32 )M_E;\n}\n\nF32 Mathf::GetLog2E()\n{\n return ( F32 )M_LOG2E;\n}\n\nF32 Mathf::GetLog10E()\n{\n return ( F32 )M_LOG10E;\n}\n\nF32 Mathf::GetLn2()\n{\n return ( F32 )M_LN2;\n}\n\nF32 Mathf::GetLn10()\n{\n return ( F32 )M_LN10;\n}\n\nF32 Mathf::Abs( const F32 f )\n{\n return fabsf( f );\n}\n\nU32 Mathf::Abs( const U32 f )\n{\n return abs( ( int )f );\n}\n\nF32 Mathf::Acos( const F32 f )\n{\n assert( f >= -1.0f && f <= 1.0f );\n return acosf( f );\n}\n\nF32 Mathf::Asin( const F32 f )\n{\n assert( f >= -1.0f && f <= 1.0f );\n return asinf( f );\n}\n\nF32 Mathf::Atan( const F32 f )\n{\n return atanf( f );\n}\n\nF32 Mathf::Atan2( const F32 x, const F32 y )\n{\n return atan2f( x, y );\n}\n\nF32 Mathf::Cos( const F32 f )\n{\n return cosf( f );\n}\n\nF32 Mathf::Sin( const F32 f )\n{\n return sinf( f );\n}\n\nF32 Mathf::Tan( const F32 f )\n{\n return tanf( f );\n}\n\nF32 Mathf::Exp( const F32 f )\n{\n return expf( f );\n}\n\nF32 Mathf::Ceil( const F32 f )\n{\n return ceilf( f );\n}\n\nF32 Mathf::Floor( const F32 f )\n{\n return floorf( f );\n}\n\nF32 Mathf::Round( const F32 f )\n{\n return f >= 0.0 ? f + 0.5f : ( ( f - ( F32 )( S32 )f ) <= -0.5 ? f : f - 0.5f );\n}\n\nF32 Mathf::FMod( const F32 f, const F32 m )\n{\n return fmodf( f, m );\n}\n\nF32 Mathf::Log( const F32 f )\n{\n assert( f > 0.0f );\n return logf( f );\n}\n\nF32 Mathf::Log2( const F32 f )\n{\n assert( f > 0.0f );\n return logf( f ) \/ logf( 2 );\n}\n\nU32 Mathf::Log2( U64 n )\n{\n static const U32 tab64[64] =\n {\n 0, 58, 1, 59, 47, 53, 2, 60, 39, 48, 27, 54, 33, 42, 3, 61,\n 51, 37, 40, 49, 18, 28, 20, 55, 30, 34, 11, 43, 14, 22, 4, 62,\n 57, 46, 52, 38, 26, 32, 41, 50, 36, 17, 19, 29, 10, 13, 21, 56,\n 45, 25, 31, 35, 16, 9, 12, 44, 24, 15, 8, 23, 7, 6, 5, 63\n };\n\n n |= n >> 1;\n n |= n >> 2;\n n |= n >> 4;\n n |= n >> 8;\n n |= n >> 16;\n n |= n >> 32;\n return tab64[( n * 0x03f6eaf2cd271461 ) >> 58];\n}\n\nU32 Mathf::Log2( U32 f )\n{\n U32 s, t;\n\n t = ( f > 0xffff ) << 4;\n f >>= t;\n s = ( f > 0xff ) << 3;\n f >>= s, t |= s;\n s = ( f > 0xf ) << 2;\n f >>= s, t |= s;\n s = ( f > 0x3 ) << 1;\n f >>= s, t |= s;\n\n return ( t | ( f >> 1 ) );\n}\n\n\nF32 Mathf::Log10( const F32 f )\n{\n assert( f > 0.0f );\n return log10f( f );\n}\n\nF32 Mathf::Pow( const F32 base, const F32 exp )\n{\n return powf( base, exp );\n}\n\nF32 Mathf::Sqrt( const F32 f )\n{\n assert( f >= 0.0f );\n return sqrtf( f );\n}\n\nF32 Mathf::Square( F32 f )\n{\n return f * f;\n}\n\nF32 Mathf::Clamp( const F32 f, const F32 min, const F32 max )\n{\n return f < min ? min : ( f > max ? max : f );\n}\n\nF32 Mathf::RadToDeg( const F32 f )\n{\n return f * 180.0f \/ GetPi();\n}\n\nF32 Mathf::DegToRad( const F32 f )\n{\n return f * GetPi() \/ 180.0f;\n}\n\nF32 Mathf::Lerp( const F32 a, const F32 b, const F32 t )\n{\n return a + ( b - a ) * t;\n}\n\nbool Mathf::IsPow2( const U32 n )\n{\n return ( !( n & ( n - 1 ) ) && n );\n}\n\nU32 Mathf::NextPow2( const U32 x )\n{\n U32 y = x - 1;\n y |= y >> 1;\n y |= y >> 2;\n y |= y >> 4;\n y |= y >> 8;\n y |= y >> 16;\n return ++y;\n}\n\nbool Mathf::Equal( const F32 a, const F32 b )\n{\n return fabs( a - b ) < GetEpsilon();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2000 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/**\n * $Log$\n * Revision 1.4 2000\/02\/06 07:47:28 rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.3 2000\/02\/04 05:46:31 andyh\n * Change offsets and lengths form signed to unsigned\n *\n * Revision 1.2 2000\/01\/05 01:16:06 andyh\n * DOM Level 2 core, namespace support added.\n *\n * Revision 1.1.1.1 1999\/11\/09 01:08:53 twl\n * Initial checkin\n *\n * Revision 1.3 1999\/11\/08 20:44:14 rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n#ifndef DOMException_HEADER_GUARD_\n#define DOMException_HEADER_GUARD_\n\n#include <util\/XML4CDefs.hpp>\n#include <dom\/DOMString.hpp>\n\n\/**\n * Encapsulate a general DOM error or warning.\n *\n * <p> The DOM will create and throw an instance of DOMException\n * when an error condition is detected. Exceptions can occur\n * when an application directly manipulates the DOM document\n * tree that is produced by the parser, or when a document tree\n * is created from scratch using the DOM API. DOM exceptions will\n * not be generated by the parser while constructing a document\n * tree from an XML source document.\n *\n * <p>Unlike the other classes in the C++ DOM API, DOM_DOMException\n * is NOT a reference to an underlying implementation class, and\n * does not provide automatic memory management. Code that catches\n * a DOM exception is responsible for deleting it, or otherwise\n * arranging for its disposal.\n *\n *\/\nclass CDOM_EXPORT DOM_DOMException {\npublic:\n enum ExceptionCode {\n INDEX_SIZE_ERR = 1,\n DOMSTRING_SIZE_ERR = 2,\n HIERARCHY_REQUEST_ERR = 3,\n WRONG_DOCUMENT_ERR = 4,\n INVALID_CHARACTER_ERR = 5,\n NO_DATA_ALLOWED_ERR = 6,\n NO_MODIFICATION_ALLOWED_ERR = 7,\n NOT_FOUND_ERR = 8,\n NOT_SUPPORTED_ERR = 9,\n INUSE_ATTRIBUTE_ERR = 10,\n INVALID_STATE_ERR = 11,\n\t \tSYNTAX_ERR\t = 12,\n \t\tINVALID_MODIFICATION_ERR = 13,\n \t\tNAMESPACE_ERR\t = 14,\n \t\tINVALID_ACCESS_ERR = 15\n };\npublic:\n \/** @name Constructors and assignment operator *\/\n \/\/@{\n \/**\n * Default constructor for DOM_DOMException.\n *\n *\/\n DOM_DOMException();\n\n \/**\n * Constructor which takes an error code and a message.\n *\n * @param code The error code which indicates the exception\n * @param message The string containing the error message\n *\/\n DOM_DOMException(short code, const DOMString &message);\n\n \/**\n * Copy constructor.\n *\n * @param other The object to be copied.\n *\/\n DOM_DOMException(const DOM_DOMException &other);\n\n \/\/@}\n \/** @name Destructor. *\/\n \/\/@{\n\t \/**\n\t * Destructor for DOM_DOMException. Applications are responsible\n * for deleting DOM_Exception objects that they catch after they\n * have completed their exception processing.\n\t *\n\t *\/\n virtual ~DOM_DOMException();\n \/\/@}\n\n \/** @name Public variables. *\/\n \/\/@{\n\t \/**\n\t * A code value, from the set defined by the ExceptionCode enum,\n * indicating the type of error that occured.\n\t *\/\n ExceptionCode code;\n\n\t \/**\n\t * A string value. Applications may use this field to hold an error\n * message. The field value is not set by the DOM implementation,\n * meaning that the string will be empty when an exception is first\n * thrown.\n\t *\/\n DOMString msg;\n \/\/@}\n\n};\n\n#endif\n\n<commit_msg>Added docs for enum<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 1999-2000 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/**\n * $Log$\n * Revision 1.5 2000\/02\/10 19:52:08 abagchi\n * Added docs for enum\n *\n * Revision 1.4 2000\/02\/06 07:47:28 rahulj\n * Year 2K copyright swat.\n *\n * Revision 1.3 2000\/02\/04 05:46:31 andyh\n * Change offsets and lengths form signed to unsigned\n *\n * Revision 1.2 2000\/01\/05 01:16:06 andyh\n * DOM Level 2 core, namespace support added.\n *\n * Revision 1.1.1.1 1999\/11\/09 01:08:53 twl\n * Initial checkin\n *\n * Revision 1.3 1999\/11\/08 20:44:14 rahul\n * Swat for adding in Product name and CVS comment log variable.\n *\n *\/\n\n#ifndef DOMException_HEADER_GUARD_\n#define DOMException_HEADER_GUARD_\n\n#include <util\/XML4CDefs.hpp>\n#include <dom\/DOMString.hpp>\n\n\/**\n * Encapsulate a general DOM error or warning.\n *\n * <p> The DOM will create and throw an instance of DOMException\n * when an error condition is detected. Exceptions can occur\n * when an application directly manipulates the DOM document\n * tree that is produced by the parser, or when a document tree\n * is created from scratch using the DOM API. DOM exceptions will\n * not be generated by the parser while constructing a document\n * tree from an XML source document.\n *\n * <p>Unlike the other classes in the C++ DOM API, DOM_DOMException\n * is NOT a reference to an underlying implementation class, and\n * does not provide automatic memory management. Code that catches\n * a DOM exception is responsible for deleting it, or otherwise\n * arranging for its disposal.\n *\n *\/\nclass CDOM_EXPORT DOM_DOMException {\npublic:\n \/** @name Enumerators for DOM Exceptions *\/\n \/\/@{\n enum ExceptionCode {\n INDEX_SIZE_ERR = 1,\n DOMSTRING_SIZE_ERR = 2,\n HIERARCHY_REQUEST_ERR = 3,\n WRONG_DOCUMENT_ERR = 4,\n INVALID_CHARACTER_ERR = 5,\n NO_DATA_ALLOWED_ERR = 6,\n NO_MODIFICATION_ALLOWED_ERR = 7,\n NOT_FOUND_ERR = 8,\n NOT_SUPPORTED_ERR = 9,\n INUSE_ATTRIBUTE_ERR = 10,\n INVALID_STATE_ERR = 11,\n\t \tSYNTAX_ERR\t = 12,\n \tINVALID_MODIFICATION_ERR = 13,\n \tNAMESPACE_ERR\t = 14,\n \tINVALID_ACCESS_ERR = 15\n };\n \/\/@}\npublic:\n \/** @name Constructors and assignment operator *\/\n \/\/@{\n \/**\n * Default constructor for DOM_DOMException.\n *\n *\/\n DOM_DOMException();\n\n \/**\n * Constructor which takes an error code and a message.\n *\n * @param code The error code which indicates the exception\n * @param message The string containing the error message\n *\/\n DOM_DOMException(short code, const DOMString &message);\n\n \/**\n * Copy constructor.\n *\n * @param other The object to be copied.\n *\/\n DOM_DOMException(const DOM_DOMException &other);\n\n \/\/@}\n \/** @name Destructor. *\/\n \/\/@{\n\t \/**\n\t * Destructor for DOM_DOMException. Applications are responsible\n * for deleting DOM_Exception objects that they catch after they\n * have completed their exception processing.\n\t *\n\t *\/\n virtual ~DOM_DOMException();\n \/\/@}\n\n \/** @name Public variables. *\/\n \/\/@{\n\t \/**\n\t * A code value, from the set defined by the ExceptionCode enum,\n * indicating the type of error that occured.\n\t *\/\n ExceptionCode code;\n\n\t \/**\n\t * A string value. Applications may use this field to hold an error\n * message. The field value is not set by the DOM implementation,\n * meaning that the string will be empty when an exception is first\n * thrown.\n\t *\/\n DOMString msg;\n \/\/@}\n\n};\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/* HamiltonianPath.cpp\n**\n** finds Hamiltonian Path if exists. returns as a list of vertices, which indicates the path from source to the final destination.\n** takes AdjacencyMatrix as input.\n** \n** Note that all vertices number starts from 0 (inclusive), to match with the index numbers of arrays.\n**\n** worked find in original projects but not tested after extracted to here. (I must check...)\n**\n** All compiled and tested with g++ 6.2.0 MinGW-W64\n**\n** MIT License \n** Copyright (c) 2017 636F57@GitHub \n** See more detail at https:\/\/github.com\/636F57\/Algos\/blob\/master\/LICENSE \n*\/\n\n#include <cstdlib> \n#include <vector>\n#include <deque>\n#include <iostream>\n\nclass HamiltonianPath\n{\nprivate:\n\tstruct pathstatus\n\t{\n\t\tint end_vertex; \/\/ current vertex\n\t\tstd::vector<int> vUsed; \/\/ array to store the previous vertex of when visited, otherwise -1.\n\t\tint usedcnt; \/\/ number of used vertecies\n\t};\n\npublic:\n\tHamiltonianPath(){}\n\t~HamiltonianPath(){}\n\t\n\tstatic std::vector<std::vector<int>> getHamiltonianPath(std::vector<std::vector<bool>>& vAdjacencyMatrix, int nStartVertex)\n\t{\n\t\tint nVertexNum = vAdjacencyMatrix.size();\n\t\t\n\t\tstd::vector<std::vector<int>> vHamiltonianPathList;\n\t\tstd::vector<int> vTmpHamiltonianPath(nVertexNum);\n\t\tstd::vector<int> vUsed(nVertexNum, -1);\t\n\t\t\n\t\tvUsed[nStartVertex] = -2; \/\/ previous vertex not available as starting vertex\n\t\tpathstatus tmpstatus, currentstatus;\n\t\ttmpstatus.end_vertex = nStartVertex;\n\t\ttmpstatus.usedcnt = 1;\n\t\ttmpstatus.vUsed.assign(vUsed.begin(),vUsed.end());\n\t\tstd::deque<pathstatus> dqTmpPath({tmpstatus});\n\t\t\n\t\tint i, j, nCurrentVertex;\n\t\t\n\t\twhile (dqTmpPath.size() > 0)\n\t\t{\n\t\t\tcurrentstatus = dqTmpPath.front();\n\t\t\tdqTmpPath.pop_front();\n\t\t\tnCurrentVertex = currentstatus.end_vertex;\n\t\t\t\n\t\t\tif (currentstatus.usedcnt == nVertexNum) \/\/ Hamiltonian path found.\n\t\t\t{\n\t\t\t\tvTmpHamiltonianPath[nVertexNum-1] = nCurrentVertex;\n\t\t\t\tfor (i=nVertexNum-2; i>=0; i--)\n\t\t\t\t{\n\t\t\t\t\tvTmpHamiltonianPath[i] = currentstatus.vUsed[vTmpHamiltonianPath[i+1]];\n\t\t\t\t}\n\t\t\t\tvHamiltonianPathList.push_back(vTmpHamiltonianPath);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ go to the next vertex which is not used yet\n\t\t\tfor (i=0; i<nVertexNum; i++)\n\t\t\t{\n\t\t\t\tif (vAdjacencyMatrix[nCurrentVertex][i] == false)\n\t\t\t\t\tcontinue;\n\t\t\t\t\t\n\t\t\t\tif (currentstatus.vUsed[i] != -1)\n\t\t\t\t\tcontinue;\n\t\t\t\t\t\n\t\t\t\ttmpstatus.end_vertex = i;\n\t\t\t\ttmpstatus.usedcnt = currentstatus.usedcnt + 1;\n\t\t\t\ttmpstatus.vUsed.assign(currentstatus.vUsed.begin(), currentstatus.vUsed.end());\n\t\t\t\ttmpstatus.vUsed[i] = nCurrentVertex;\n\t\t\t\tdqTmpPath.push_back(tmpstatus);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn vHamiltonianPathList;\n\t}\n};\n\nint main() \/\/ sample vAdjacencyMatrix is not yet implemented...\n{\t\n\tstd::vector<std::vector<bool>> vAdjacencyMatrix; \n\t\n\tstd::vector<std::vector<int>> vHamiltonianPathList = HamiltonianPath::getHamiltonianPath(vAdjacencyMatrix, 0);\n\t\n\t\t\n\tfor (int k=0; k<vHamiltonianPathList.size(); k++)\n\t{\n\t\tfor (int j=0; j<vHamiltonianPathList[k].size() - 1; j++)\n\t\t\tstd::cout << std::to_string(vHamiltonianPathList[k][j]) + \" -> \";\n\n\t\tstd::cout << std::to_string(vHamiltonianPathList[k].back()) + \"\\n\";\n\t}\n\t\n\treturn 0;\n}<commit_msg>add HamiltonianCycle finder and a sample graph<commit_after>\/* HamiltonianPath.cpp\n**\n** finds Hamiltonian Path if it exists. returns as a list of vertices, which indicates the path from source to the final destination.\n** takes AdjacencyMatrix as input.\n** \n** Note that all vertices number starts from 0 (inclusive), to match with the index numbers of arrays.\n**\n** worked find in original projects but not tested after extracted to here. (I must check...)\n**\n** All compiled and tested with g++ 6.2.0 MinGW-W64\n**\n** MIT License \n** Copyright (c) 2017 636F57@GitHub \n** See more detail at https:\/\/github.com\/636F57\/Algos\/blob\/master\/LICENSE \n*\/\n\n#include <cstdlib> \n#include <vector>\n#include <deque>\n#include <iostream>\n\nclass HamiltonianPath\n{\nprivate:\n\tstruct pathstatus\n\t{\n\t\tint end_vertex; \t\/\/ current vertex\n\t\tstd::vector<int> vVisited; \/\/ array to store the previous vertex of the time when it is visited, otherwise -1.\n\t\tint visitedcnt; \/\/ number of visited vertecies\n\t};\n\npublic:\n\tHamiltonianPath(){}\n\t~HamiltonianPath(){}\n\t\n\tstatic std::vector<std::vector<int>> getHamiltonianPath(std::vector<std::vector<bool>>& vAdjacencyMatrix, int nStartVertex)\n\t{\n\t\tint nVertexNum = vAdjacencyMatrix.size();\n\t\t\n\t\tstd::vector<std::vector<int>> vHamiltonianPathList;\n\t\tstd::vector<int> vTmpHamiltonianPath(nVertexNum);\n\t\tstd::vector<int> vVisited(nVertexNum, -1);\t\n\t\t\n\t\tvVisited[nStartVertex] = -2; \/\/ previous vertex not available as starting vertex\n\t\tpathstatus tmpstatus, currentstatus;\n\t\ttmpstatus.end_vertex = nStartVertex;\n\t\ttmpstatus.visitedcnt = 1;\n\t\ttmpstatus.vVisited.assign(vVisited.begin(),vVisited.end());\n\t\tstd::deque<pathstatus> dqTmpPath({tmpstatus});\n\t\t\n\t\tint i, j, nCurrentVertex;\n\t\t\n\t\twhile (dqTmpPath.size() > 0)\n\t\t{\n\t\t\tcurrentstatus = dqTmpPath.front();\n\t\t\tdqTmpPath.pop_front();\n\t\t\tnCurrentVertex = currentstatus.end_vertex;\n\t\t\t\n\t\t\tif (currentstatus.visitedcnt == nVertexNum) \/\/ Hamiltonian path found.\n\t\t\t{\n\t\t\t\tvTmpHamiltonianPath[nVertexNum-1] = nCurrentVertex;\n\t\t\t\tfor (i=nVertexNum-2; i>=0; i--)\n\t\t\t\t{\n\t\t\t\t\tvTmpHamiltonianPath[i] = currentstatus.vVisited[vTmpHamiltonianPath[i+1]];\n\t\t\t\t}\n\t\t\t\tvHamiltonianPathList.push_back(vTmpHamiltonianPath);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ go to the next vertex which is not visited yet\n\t\t\tfor (i=0; i<nVertexNum; i++)\n\t\t\t{\n\t\t\t\tif (vAdjacencyMatrix[nCurrentVertex][i] == false)\n\t\t\t\t\tcontinue;\n\t\t\t\t\t\n\t\t\t\tif (currentstatus.vVisited[i] != -1)\n\t\t\t\t\tcontinue;\n\t\t\t\t\t\n\t\t\t\ttmpstatus.end_vertex = i;\n\t\t\t\ttmpstatus.visitedcnt = currentstatus.visitedcnt + 1;\n\t\t\t\ttmpstatus.vVisited.assign(currentstatus.vVisited.begin(), currentstatus.vVisited.end());\n\t\t\t\ttmpstatus.vVisited[i] = nCurrentVertex;\n\t\t\t\tdqTmpPath.push_back(tmpstatus);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn vHamiltonianPathList;\n\t}\n\t\n\tstatic std::vector<std::vector<int>> getHamiltonianCycle(std::vector<std::vector<bool>>& vAdjacencyMatrix, int nStartVertex)\n\t{\n\t\tstd::vector<std::vector<int>> vHamiltonianCycleList;\n\t\tstd::vector<std::vector<int>> vHamiltonianPathList = getHamiltonianPath(vAdjacencyMatrix, 0);\n\t\t\n\t\tfor (int i=0; i<vHamiltonianPathList.size(); i++)\n\t\t{\n\t\t\tif (vAdjacencyMatrix[nStartVertex][vHamiltonianPathList[i].back()] == true)\n\t\t\t{\n\t\t\t\tvHamiltonianPathList[i].push_back(nStartVertex);\n\t\t\t\tvHamiltonianCycleList.push_back(vHamiltonianPathList[i]);\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn vHamiltonianCycleList;\n\t}\n};\n\nint main() \n{\t\n\t\/* sample graph\n\t \/| \\ \n\t \/ | \\ \n\t \/ \/ \\ \\\n\t \/ \/ \\ \\\n\t\/ \/ \\ \\\n --- ---\n\t\\ \\ \/ \/\n \\ \\ \/ \/\n \\ -- \/\n\t \\\/\t\\\/ \n\t\t-----\n\t*\/\n\tstd::vector<std::vector<bool>> vAdjacencyMatrix(10); \n\tvAdjacencyMatrix[0] = {0,1,0,0,1,1,0,0,0,0}; \n\tvAdjacencyMatrix[1] = {1,0,1,0,0,0,1,0,0,0};\n\tvAdjacencyMatrix[2] = {0,1,0,1,0,0,0,1,0,0};\n\tvAdjacencyMatrix[3] = {0,0,1,0,1,0,0,0,1,0};\n\tvAdjacencyMatrix[4] = {1,0,0,1,0,0,0,0,0,1};\n\tvAdjacencyMatrix[5] = {1,0,0,0,0,0,1,0,0,1};\n\tvAdjacencyMatrix[6] = {0,1,0,0,0,1,0,1,0,0};\n\tvAdjacencyMatrix[7] = {0,0,1,0,0,0,1,0,1,0};\n\tvAdjacencyMatrix[8] = {0,0,0,1,0,0,0,1,0,1};\n\tvAdjacencyMatrix[9] = {0,0,0,0,1,1,0,0,1,0};\n\t\n\t\n\tstd::vector<std::vector<int>> vHamiltonianPathList = HamiltonianPath::getHamiltonianPath(vAdjacencyMatrix, 0);\n\t\n\tstd::cout << \"Number of Hamiltonian paths : \" << std::to_string(vHamiltonianPathList.size()) << \"\\n\";\t\n\tfor (int k=0; k<vHamiltonianPathList.size(); k++)\n\t{\n\t\tfor (int j=0; j<vHamiltonianPathList[k].size() - 1; j++)\n\t\t\tstd::cout << std::to_string(vHamiltonianPathList[k][j]) + \" -> \";\n\n\t\tstd::cout << std::to_string(vHamiltonianPathList[k].back()) + \"\\n\";\n\t}\n\t\n\tstd::vector<std::vector<int>> vHamiltonianCycleList = HamiltonianPath::getHamiltonianCycle(vAdjacencyMatrix, 0 );\n\tstd::cout << \"\\nNumber of Hamiltonian cycles : \" << std::to_string(vHamiltonianCycleList.size()) << \"\\n\";\n\tfor (int k=0; k<vHamiltonianCycleList.size(); k++)\n\t{\n\t\tfor (int j=0; j<vHamiltonianCycleList[k].size() - 1; j++)\n\t\t\tstd::cout << std::to_string(vHamiltonianCycleList[k][j]) + \" -> \";\n\n\t\tstd::cout << std::to_string(vHamiltonianCycleList[k].back()) + \"\\n\";\n\t}\n\t\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"sdb-antigenic-maps-draw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nAntigenicMapsDrawBase::~AntigenicMapsDrawBase()\n{\n}\n\n\/\/ ----------------------------------------------------------------------\n\nAntigenicMapsDrawBase* make_antigenic_maps_draw(std::string aChartFilename, Surface& aSurface, Tree& aTree, HzSections& aHzSections, SignaturePageDrawSettings& aSignaturePageDrawSettings, AntigenicMapsDrawSettings& aSettings)\n{\n try {\n return new sdb::AntigenicMapsDraw(aSurface, aTree, sdb::read_chart_from_sdb(aChartFilename), aHzSections, aSignaturePageDrawSettings, aSettings);\n }\n catch (ChartReadError& err) {\n std::cerr << \"Cannot read sdb chart\" << std::endl;\n throw;\n }\n\n} \/\/ make_antigenic_maps_draw\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>using ace chart development<commit_after>#include <typeinfo>\n\n#include \"acmacs-chart\/ace.hh\"\n#include \"sdb-antigenic-maps-draw.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\nAntigenicMapsDrawBase::~AntigenicMapsDrawBase()\n{\n}\n\n\/\/ ----------------------------------------------------------------------\n\nAntigenicMapsDrawBase* make_antigenic_maps_draw(std::string aChartFilename, Surface& aSurface, Tree& aTree, HzSections& aHzSections, SignaturePageDrawSettings& aSignaturePageDrawSettings, AntigenicMapsDrawSettings& aSettings)\n{\n try {\n auto* chart = import_chart(aChartFilename);\n }\n catch (AceChartReadError& err) {\n std::cerr << \"Cannot read ace chart: \" << err.what() << std::endl;\n throw;\n }\n try {\n return new sdb::AntigenicMapsDraw(aSurface, aTree, sdb::read_chart_from_sdb(aChartFilename), aHzSections, aSignaturePageDrawSettings, aSettings);\n }\n catch (ChartReadError& err) {\n std::cerr << \"Cannot read sdb chart\" << std::endl;\n throw;\n }\n\n} \/\/ make_antigenic_maps_draw\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before><commit_msg>update animation<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\author Alexey Vasilyev <alexa.infra@gmail.com>\n * \\copyright MIT License\n **\/\n#include \"sdlapp.h\"\n\n#ifdef OS_WIN\n# define SDL_MAIN_HANDLED\n#endif\n\n#include <SDL.h>\n\n#include <iostream>\n#include <string>\n#include <assert.h>\n\n#include \"GL\/glew.h\"\n#include \"renderer\/statistics.h\"\n\nSDLApp::SDLApp()\n : mainwindow_( NULL )\n , run_( true )\n , capture_( false )\n , width_( 640 )\n , height_( 480 )\n{\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MAJOR_VERSION, 3 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MINOR_VERSION, 3 );\n \/\/ see SDL_GLprofile enumeration\n \/\/ e.g. SDL_GL_CONTEXT_PROFILE_ES2 for GLES\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE );\n \/\/ debug flag\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_FLAGS, SDL_GL_CONTEXT_DEBUG_FLAG );\n SDL_GL_SetAttribute( SDL_GL_DOUBLEBUFFER, 1 );\n SDL_GL_SetAttribute( SDL_GL_DEPTH_SIZE, 24 );\n SDL_GL_SetAttribute( SDL_GL_ALPHA_SIZE, 8 );\n\n if ( SDL_Init( SDL_INIT_VIDEO ) < 0 ) {\n std::cout << \"Unable to init SDL: \" << SDL_GetError() << std::endl;\n assert( false );\n }\n\n mainwindow_ = SDL_CreateWindow(\n \"SDL Demo\",\n SDL_WINDOWPOS_CENTERED,\n SDL_WINDOWPOS_CENTERED,\n width_, height_,\n SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN\n );\n maincontext_ = SDL_GL_CreateContext( mainwindow_ );\n glewExperimental = GL_TRUE;\n GLenum err = glewInit();\n\n if ( GLEW_OK != err ) {\n std::cout << glewGetErrorString( err ) << std::endl;\n assert( false );\n }\n\n if ( !GLEW_VERSION_3_3 ) {\n std::cout << \"OpenGL 3.3 is not supported.\" << std::endl;\n \/\/ assert(false);\n }\n\n const GLubyte* version = glGetString( GL_VERSION );\n\n std::cout << \"Current OpenGL version: \" << version << std::endl;\n\n assert( glGetError() == GL_NO_ERROR );\n\n SDL_GL_SetSwapInterval( 1 );\n\n Stats::init();\n}\n\nSDLApp::~SDLApp()\n{\n Stats::shutdown();\n SDL_GL_DeleteContext( maincontext_ );\n SDL_DestroyWindow( mainwindow_ );\n SDL_Quit();\n}\n\nvoid SDLApp::Pump()\n{\n SDL_PumpEvents();\n SDL_Event event;\n\n while ( SDL_PollEvent( &event ) ) {\n switch( event.type ) {\n case SDL_QUIT:\n run_ = false;\n break;\n case SDL_MOUSEBUTTONUP:\n\n if ( event.button.button == SDL_BUTTON_LEFT ) {\n capture_ = false;\n SDL_ShowCursor( 1 );\n }\n\n break;\n case SDL_MOUSEBUTTONDOWN:\n\n if ( event.button.button == SDL_BUTTON_LEFT ) {\n capture_ = true;\n SDL_ShowCursor( 0 );\n }\n\n break;\n case SDL_MOUSEMOTION:\n\n if ( capture_ ) {\n if ( event.motion.x != width_ \/ 2. ||\n event.motion.y != height_ \/ 2. ) {\n OnMotion( event.motion.x,\n event.motion.y,\n event.motion.xrel,\n event.motion.yrel );\n SDL_WarpMouseInWindow( mainwindow_,\n width_ \/ 2, height_ \/ 2 );\n }\n }\n\n break;\n case SDL_KEYDOWN:\n OnKeyboardDown( ( u8 )event.key.keysym.sym );\n break;\n case SDL_KEYUP:\n OnKeyboardUp( ( u8 )event.key.keysym.sym );\n break;\n default:\n break;\n }\n }\n}\n\nvoid SDLApp::Run()\n{\n Pump();\n\n while( run_ ) {\n OnFrame();\n Pump();\n }\n}\n\nvoid SDLApp::OnFrame()\n{\n \/* Swap our back buffer to the front *\/\n SDL_GL_SwapWindow( mainwindow_ );\n Stats::reset_frame();\n}\n\nvoid SDLApp::OnMotion( i32 x, i32 y, i32 dx, i32 dy )\n{\n}\n\nvoid SDLApp::OnReshape( i32 width, i32 height )\n{\n}\n<commit_msg>fix sdl initialization<commit_after>\/**\n * \\file\n * \\author Alexey Vasilyev <alexa.infra@gmail.com>\n * \\copyright MIT License\n **\/\n#include \"sdlapp.h\"\n\n#ifdef OS_WIN\n# define SDL_MAIN_HANDLED\n#endif\n\n#include <SDL.h>\n\n#include <iostream>\n#include <string>\n#include <assert.h>\n\n#include \"GL\/glew.h\"\n#include \"GL\/wglew.h\"\n#include \"renderer\/statistics.h\"\n\nSDLApp::SDLApp()\n : mainwindow_( NULL )\n , run_( true )\n , capture_( false )\n , width_( 640 )\n , height_( 480 )\n{\n if ( SDL_Init( SDL_INIT_VIDEO ) < 0 ) {\n std::cout << \"Unable to init SDL: \" << SDL_GetError() << std::endl;\n assert( false );\n }\n\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MAJOR_VERSION, 3 );\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_MINOR_VERSION, 3 );\n \/\/ see SDL_GLprofile enumeration\n \/\/ e.g. SDL_GL_CONTEXT_PROFILE_ES2 for GLES\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE );\n \/\/ debug flag\n SDL_GL_SetAttribute( SDL_GL_CONTEXT_FLAGS, SDL_GL_CONTEXT_DEBUG_FLAG );\n SDL_GL_SetAttribute( SDL_GL_DOUBLEBUFFER, 1 );\n SDL_GL_SetAttribute( SDL_GL_DEPTH_SIZE, 24 );\n SDL_GL_SetAttribute( SDL_GL_ALPHA_SIZE, 8 );\n\n mainwindow_ = SDL_CreateWindow(\n \"SDL Demo\",\n SDL_WINDOWPOS_CENTERED,\n SDL_WINDOWPOS_CENTERED,\n width_, height_,\n SDL_WINDOW_OPENGL | SDL_WINDOW_SHOWN\n );\n maincontext_ = SDL_GL_CreateContext( mainwindow_ );\n glewExperimental = GL_TRUE;\n GLenum err = glewInit();\n\n if ( GLEW_OK != err ) {\n std::cout << glewGetErrorString( err ) << std::endl;\n assert( false );\n }\n\n if ( !GLEW_VERSION_3_3 ) {\n std::cout << \"OpenGL 3.3 is not supported.\" << std::endl;\n \/\/ assert(false);\n }\n\n const GLubyte* version = glGetString( GL_VERSION );\n\n std::cout << \"Current OpenGL version: \" << version << std::endl;\n\n assert( glGetError() == GL_NO_ERROR );\n\n SDL_GL_SetSwapInterval( 1 );\n\n Stats::init();\n}\n\nSDLApp::~SDLApp()\n{\n Stats::shutdown();\n SDL_GL_DeleteContext( maincontext_ );\n SDL_DestroyWindow( mainwindow_ );\n SDL_Quit();\n}\n\nvoid SDLApp::Pump()\n{\n SDL_PumpEvents();\n SDL_Event event;\n\n while ( SDL_PollEvent( &event ) ) {\n switch( event.type ) {\n case SDL_QUIT:\n run_ = false;\n break;\n case SDL_MOUSEBUTTONUP:\n\n if ( event.button.button == SDL_BUTTON_LEFT ) {\n capture_ = false;\n SDL_ShowCursor( 1 );\n }\n\n break;\n case SDL_MOUSEBUTTONDOWN:\n\n if ( event.button.button == SDL_BUTTON_LEFT ) {\n capture_ = true;\n SDL_ShowCursor( 0 );\n }\n\n break;\n case SDL_MOUSEMOTION:\n\n if ( capture_ ) {\n if ( event.motion.x != width_ \/ 2. ||\n event.motion.y != height_ \/ 2. ) {\n OnMotion( event.motion.x,\n event.motion.y,\n event.motion.xrel,\n event.motion.yrel );\n SDL_WarpMouseInWindow( mainwindow_,\n width_ \/ 2, height_ \/ 2 );\n }\n }\n\n break;\n case SDL_KEYDOWN:\n OnKeyboardDown( ( u8 )event.key.keysym.sym );\n break;\n case SDL_KEYUP:\n OnKeyboardUp( ( u8 )event.key.keysym.sym );\n break;\n default:\n break;\n }\n }\n}\n\nvoid SDLApp::Run()\n{\n Pump();\n\n while( run_ ) {\n OnFrame();\n Pump();\n }\n}\n\nvoid SDLApp::OnFrame()\n{\n \/* Swap our back buffer to the front *\/\n SDL_GL_SwapWindow( mainwindow_ );\n Stats::reset_frame();\n}\n\nvoid SDLApp::OnMotion( i32 x, i32 y, i32 dx, i32 dy )\n{\n}\n\nvoid SDLApp::OnReshape( i32 width, i32 height )\n{\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011-2013 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QDomDocument>\n#include <QDomElement>\n#include \"com\/centreon\/broker\/config\/state.hh\"\n#include \"com\/centreon\/broker\/correlation\/correlator.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/multiplexing\/engine.hh\"\n\nusing namespace com::centreon::broker;\n\nCCB_BEGIN()\nnamespace correlation {\n \/\/ Load count.\n static unsigned int instances(0);\n\n \/\/ Correlation object.\n static misc::shared_ptr<multiplexing::hooker> obj;\n\n \/**\n * Module deinitialization routine.\n *\/\n void module_deinit() {\n \/\/ Decrement instance number.\n if (!--correlation::instances) {\n \/\/ Unregister correlation object.\n multiplexing::engine::instance().unhook(*correlation::obj);\n correlation::obj.clear();\n }\n return ;\n }\n\n \/**\n * Module initialization routine.\n *\n * @param[in] arg Configuration argument.\n *\/\n void module_init(void const* arg) {\n \/\/ Increment instance number.\n if (!correlation::instances++) {\n \/\/ Check that correlation is enabled.\n config::state const& cfg(*static_cast<config::state const*>(arg));\n bool loaded(false);\n QMap<QString, QString>::const_iterator\n it(cfg.params().find(\"correlation\"));\n if (it != cfg.params().end()) {\n \/\/ Parameters.\n QString correlation_file;\n QString retention_file;\n\n \/\/ Parse XML.\n QDomDocument d;\n if (d.setContent(it.value())) {\n \/\/ Browse first-level elements.\n QDomElement root(d.documentElement());\n QDomNodeList level1(root.childNodes());\n for (int i = 0, len = level1.size(); i < len; ++i) {\n QDomElement elem(level1.item(i).toElement());\n if (!elem.isNull()) {\n QString name(elem.tagName());\n if (name == \"file\")\n correlation_file = elem.text();\n else if (name == \"retention\")\n retention_file = elem.text();\n }\n }\n }\n\n \/\/ File exists, load it.\n if (!correlation_file.isEmpty()) {\n \/\/ Create and register correlation object.\n misc::shared_ptr<correlation::correlator>\n crltr(new correlation::correlator);\n try {\n crltr->load(correlation_file, retention_file);\n correlation::obj = crltr.staticCast<multiplexing::hooker>();\n multiplexing::engine::instance().hook(*correlation::obj);\n loaded = true;\n }\n catch (std::exception const& e) {\n logging::config(logging::high) << \"correlation: \" \\\n \"configuration loading error: \" << e.what();\n }\n catch (...) {\n logging::config(logging::high) << \"correlation: \" \\\n \"configuration loading error\";\n }\n }\n }\n if (!loaded)\n logging::config(logging::high) << \"correlation: invalid \" \\\n \"correlation configuration, correlation engine is NOT loaded\";\n }\n return ;\n }\n}\nCCB_END()\n\nextern \"C\" {\n \/**\n * Module deinitialization routine.\n *\/\n void broker_module_deinit() {\n correlation::module_deinit();\n return ;\n }\n\n \/**\n * Module initialization routine redirector.\n *\n * @param[in] arg Configuration argument.\n *\/\n void broker_module_init(void const* arg) {\n correlation::module_init(arg);\n return ;\n }\n\n \/**\n * Module update routine.\n *\n * @param[in] arg Configuration argument.\n *\/\n void broker_module_update(void const* arg) {\n correlation::module_deinit();\n correlation::module_init(arg);\n return ;\n }\n}\n<commit_msg>correlation: disable and then reenable the correlation engine during a configuration update request. This fixes #4272.<commit_after>\/*\n** Copyright 2011-2013 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <QDomDocument>\n#include <QDomElement>\n#include \"com\/centreon\/broker\/config\/state.hh\"\n#include \"com\/centreon\/broker\/correlation\/correlator.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/multiplexing\/engine.hh\"\n\nusing namespace com::centreon::broker;\n\nCCB_BEGIN()\nnamespace correlation {\n \/\/ Load count.\n static unsigned int instances(0);\n\n \/\/ Correlation object.\n static misc::shared_ptr<multiplexing::hooker> obj;\n\n \/**\n * Module deinitialization routine.\n *\/\n void module_deinit() {\n \/\/ Decrement instance number.\n if (!--correlation::instances) {\n \/\/ Unregister correlation object.\n multiplexing::engine::instance().unhook(*correlation::obj);\n correlation::obj.clear();\n }\n return ;\n }\n\n \/**\n * Module initialization routine.\n *\n * @param[in] arg Configuration argument.\n *\/\n void module_init(void const* arg) {\n \/\/ Increment instance number.\n if (!correlation::instances++) {\n \/\/ Check that correlation is enabled.\n config::state const& cfg(*static_cast<config::state const*>(arg));\n bool loaded(false);\n QMap<QString, QString>::const_iterator\n it(cfg.params().find(\"correlation\"));\n if (it != cfg.params().end()) {\n \/\/ Parameters.\n QString correlation_file;\n QString retention_file;\n\n \/\/ Parse XML.\n QDomDocument d;\n if (d.setContent(it.value())) {\n \/\/ Browse first-level elements.\n QDomElement root(d.documentElement());\n QDomNodeList level1(root.childNodes());\n for (int i = 0, len = level1.size(); i < len; ++i) {\n QDomElement elem(level1.item(i).toElement());\n if (!elem.isNull()) {\n QString name(elem.tagName());\n if (name == \"file\")\n correlation_file = elem.text();\n else if (name == \"retention\")\n retention_file = elem.text();\n }\n }\n }\n\n \/\/ File exists, load it.\n if (!correlation_file.isEmpty()) {\n \/\/ Create and register correlation object.\n misc::shared_ptr<correlation::correlator>\n crltr(new correlation::correlator);\n try {\n crltr->load(correlation_file, retention_file);\n correlation::obj = crltr.staticCast<multiplexing::hooker>();\n multiplexing::engine::instance().hook(*correlation::obj);\n loaded = true;\n }\n catch (std::exception const& e) {\n logging::config(logging::high) << \"correlation: \" \\\n \"configuration loading error: \" << e.what();\n }\n catch (...) {\n logging::config(logging::high) << \"correlation: \" \\\n \"configuration loading error\";\n }\n }\n }\n if (!loaded)\n logging::config(logging::high) << \"correlation: invalid \" \\\n \"correlation configuration, correlation engine is NOT loaded\";\n }\n return ;\n }\n}\nCCB_END()\n\nextern \"C\" {\n \/**\n * Module deinitialization routine.\n *\/\n void broker_module_deinit() {\n correlation::module_deinit();\n return ;\n }\n\n \/**\n * Module initialization routine redirector.\n *\n * @param[in] arg Configuration argument.\n *\/\n void broker_module_init(void const* arg) {\n correlation::module_init(arg);\n return ;\n }\n\n \/**\n * Module update routine.\n *\n * @param[in] arg Configuration argument.\n *\/\n void broker_module_update(void const* arg) {\n if (!correlation::obj.isNull())\n correlation::obj->stopping();\n correlation::module_deinit();\n correlation::module_init(arg);\n correlation::obj->starting();\n return ;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:4; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n\/**\n * \n * @ingroup rd_programs\n * \\defgroup robotDevastation robotDevastation\n *\n * @brief The Robot Devastation PC client. Creates an instance of the RobotDevastation class.\n *\n * @section legal Legal\n *\n * Copyright: ASROB 2012-2014 (C) Robotics Society of the Universidad Carlos III de Madrid (http:\/\/asrob.uc3m.es)\n * Robot Devastation project\n *\n * Authors:\n * <a href=\"https:\/\/plus.google.com\/+davidestevezfernandez\">David Estevez<\/a> (2014-present),\n * <a href=\"http:\/\/roboticslab.uc3m.es\/roboticslab\/people\/jg-victores\">Juan G. Victores<\/a> (2012-present),\n * <a href=\"http:\/\/www.mendeley.com\/profiles\/santiago-morante-cendrero\/\">Santiago Morante<\/a> (2012-2014).\n *\n * CopyPolicy: Released under the terms of the LGPLv2.1 or later, see $RD_ROOT\/main\/doc\/LGPL.TXT\n *\n * @section installation Installation\n *\n * The module is compiled when ENABLE_robotDevastation is activated (default: ON). For further\n * installation steps refer to <a class=\"el\" href=\"pages.html\">your own system installation guidelines<\/a>.\n *\n * @section running Running (assuming correct installation, see previous section)\n * \n * It should be straightforward to run the default test mode. Just click on the icon or open a terminal and write:\n *\n\\verbatim\nrdClient\n\\endverbatim\n *\n * @section interfacing Interfacing with robotDevastation\n *\n * Press 'space' to shoot!\n *\n * @section modify Modify\n * \n * This file can be edited at \n * $RD_ROOT\/src\/programs\/robotDevastation\/main.cpp\n *\n *\/\n\n#include <iostream>\n\n#include <yarp\/os\/Network.h>\n\n#include \"RdUtils.hpp\"\n#include \"RobotDevastation.hpp\"\n\nint main(int argc, char *argv[]) {\n\n printf(\"--------------------------------------------------------------\\n\");\n printf(\"Robot Devastation @ ASROB 2014 (C) Robotics Society of the Universidad Carlos III de Madrid\\n\");\n printf(\"Welcome to Robot Devastation v0.2, developed by David Estevez and Juan G Victores.\\n\");\n printf(\"Based on Robot Devastation v0.1, developed by Santiago Morante and Juan G Victores.\\n\");\n printf(GREEN);\n printf(\" ____ _ _ ____ _ _ _ \\n\");\n printf(\"| _ \\\\ ___ | |__ ___ | |_| _ \\\\ _____ ____ _ ___| |_ __ _| |_(_) ___ _ __ \\n\");\n printf(\"| |_) \/ _ \\\\| '_ \\\\ \/ _ \\\\| __| | | |\/ _ \\\\ \\\\ \/ \/ _` \/ __| __\/ _` | __| |\/ _ \\\\| '_ \\\\ \\n\");\n printf(\"| _ < (_) | |_) | (_) | |_| |_| | __\/\\\\ V \/ (_| \\\\__ \\\\ || (_| | |_| | (_) | | | |\\n\");\n printf(\"|_| \\\\_\\\\___\/|_.__\/ \\\\___\/ \\\\__|____\/ \\\\___| \\\\_\/ \\\\__,_|___\/\\\\__\\\\__,_|\\\\__|_|\\\\___\/|_| |_|\\n\");\n printf(RESET);\n printf(\"\\n\");\n printf(\"Fire with 'space'. Reload with 'r'. Move with 'Left, Up, Down, Right'. Run \\\"robotDevastation --help\\\" for help.\\n\");\n printf(\"For a full description, please visit http:\/\/asrob.uc3m.es\/rddoc\/group__robotDevastation.html.\\n\");\n printf(\"--------------------------------------------------------------\\n\");\n\n yarp::os::ResourceFinder rf;\n rf.setVerbose(false);\n rf.setDefaultContext(\"robotDevastation\");\n rf.setDefaultConfigFile(\"robotDevastation.ini\");\n rf.configure(argc, argv);\n\n if(rf.check(\"help\"))\n {\n printf(\"RobotDevastation optional parameters:\\n\");\n printf(\"\\t--help (this help)\\t--from [file.ini]\\t--context [path]\\n\");\n printf(\"\\t--mockupRobotManager \/\/-- Fake robot motors\\n\");\n printf(\"\\t--mockupImageManager \/\/-- Fake robot camera\\n\");\n printf(\"\\t--yarpLocalImageManager \/\/-- Local webcam as camera\\n\");\n return 0;\n }\n\n rd::RobotDevastation robotDevastation;\n return robotDevastation.runModule(rf); \/\/-- Internally calls rd::RobotDevastation::configure(yarp::os::ResourceFinder &rf)\n\n}\n\n<commit_msg>document --fullscreen parameter (experimental)<commit_after>\/\/ -*- mode:C++; tab-width:4; c-basic-offset:4; indent-tabs-mode:nil -*-\n\n\/**\n * \n * @ingroup rd_programs\n * \\defgroup robotDevastation robotDevastation\n *\n * @brief The Robot Devastation PC client. Creates an instance of the RobotDevastation class.\n *\n * @section legal Legal\n *\n * Copyright: ASROB 2012-2014 (C) Robotics Society of the Universidad Carlos III de Madrid (http:\/\/asrob.uc3m.es)\n * Robot Devastation project\n *\n * Authors:\n * <a href=\"https:\/\/plus.google.com\/+davidestevezfernandez\">David Estevez<\/a> (2014-present),\n * <a href=\"http:\/\/roboticslab.uc3m.es\/roboticslab\/people\/jg-victores\">Juan G. Victores<\/a> (2012-present),\n * <a href=\"http:\/\/www.mendeley.com\/profiles\/santiago-morante-cendrero\/\">Santiago Morante<\/a> (2012-2014).\n *\n * CopyPolicy: Released under the terms of the LGPLv2.1 or later, see $RD_ROOT\/main\/doc\/LGPL.TXT\n *\n * @section installation Installation\n *\n * The module is compiled when ENABLE_robotDevastation is activated (default: ON). For further\n * installation steps refer to <a class=\"el\" href=\"pages.html\">your own system installation guidelines<\/a>.\n *\n * @section running Running (assuming correct installation, see previous section)\n * \n * It should be straightforward to run the default test mode. Just click on the icon or open a terminal and write:\n *\n\\verbatim\nrdClient\n\\endverbatim\n *\n * @section interfacing Interfacing with robotDevastation\n *\n * Press 'space' to shoot!\n *\n * @section modify Modify\n * \n * This file can be edited at \n * $RD_ROOT\/src\/programs\/robotDevastation\/main.cpp\n *\n *\/\n\n#include <iostream>\n\n#include <yarp\/os\/Network.h>\n\n#include \"RdUtils.hpp\"\n#include \"RobotDevastation.hpp\"\n\nint main(int argc, char *argv[]) {\n\n printf(\"--------------------------------------------------------------\\n\");\n printf(\"Robot Devastation @ ASROB 2014 (C) Robotics Society of the Universidad Carlos III de Madrid\\n\");\n printf(\"Welcome to Robot Devastation v0.2, developed by David Estevez and Juan G Victores.\\n\");\n printf(\"Based on Robot Devastation v0.1, developed by Santiago Morante and Juan G Victores.\\n\");\n printf(GREEN);\n printf(\" ____ _ _ ____ _ _ _ \\n\");\n printf(\"| _ \\\\ ___ | |__ ___ | |_| _ \\\\ _____ ____ _ ___| |_ __ _| |_(_) ___ _ __ \\n\");\n printf(\"| |_) \/ _ \\\\| '_ \\\\ \/ _ \\\\| __| | | |\/ _ \\\\ \\\\ \/ \/ _` \/ __| __\/ _` | __| |\/ _ \\\\| '_ \\\\ \\n\");\n printf(\"| _ < (_) | |_) | (_) | |_| |_| | __\/\\\\ V \/ (_| \\\\__ \\\\ || (_| | |_| | (_) | | | |\\n\");\n printf(\"|_| \\\\_\\\\___\/|_.__\/ \\\\___\/ \\\\__|____\/ \\\\___| \\\\_\/ \\\\__,_|___\/\\\\__\\\\__,_|\\\\__|_|\\\\___\/|_| |_|\\n\");\n printf(RESET);\n printf(\"\\n\");\n printf(\"Fire with 'space'. Reload with 'r'. Move with 'Left, Up, Down, Right'. Run \\\"robotDevastation --help\\\" for help.\\n\");\n printf(\"For a full description, please visit http:\/\/asrob.uc3m.es\/rddoc\/group__robotDevastation.html.\\n\");\n printf(\"--------------------------------------------------------------\\n\");\n\n yarp::os::ResourceFinder rf;\n rf.setVerbose(false);\n rf.setDefaultContext(\"robotDevastation\");\n rf.setDefaultConfigFile(\"robotDevastation.ini\");\n rf.configure(argc, argv);\n\n if(rf.check(\"help\"))\n {\n printf(\"RobotDevastation optional parameters:\\n\");\n printf(\"\\t--help (this help)\\t--from [file.ini]\\t--context [path]\\n\");\n printf(\"\\t--mockupRobotManager \/\/-- Fake robot motors\\n\");\n printf(\"\\t--mockupImageManager \/\/-- Fake robot camera\\n\");\n printf(\"\\t--yarpLocalImageManager \/\/-- Local webcam as camera\\n\");\n printf(\"\\t--fullscreen \/\/-- Fullscreen mode (experimental)\\n\");\n return 0;\n }\n\n rd::RobotDevastation robotDevastation;\n return robotDevastation.runModule(rf); \/\/-- Internally calls rd::RobotDevastation::configure(yarp::os::ResourceFinder &rf)\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=============================================================================\n\tCopyright (c) 2012-2013 Richard Otis\n\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n\/\/ N-Dimensional uniform grid\n\n#ifndef INCLUDED_NDGRID\n#define INCLUDED_NDGRID\n\n#include <vector>\n#include <utility>\n\nstruct NDGrid {\n\ttemplate <typename Func> static void sample(\n\t\t\tconst std::vector<std::pair<double,double> > &extents,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func,\n\t\t\tstd::vector<double>& address) {\n\t\tif (address.size() == extents.size()) {\n\t\t\t\/\/ terminating condition; address is complete\n\t\t\tfunc(address);\n\t\t}\n\t\telse {\n\t\t\tconst double max_extent = extents[address.size()].second;\n\t\t\tconst double min_extent = extents[address.size()].first;\n\t\t\tdouble step = (max_extent - min_extent) \/ grid_points_per_major_axis;\n\t\t\tfor (auto j = 0; j <= grid_points_per_major_axis; ++j) {\n\t\t\t\tdouble location = step*j + min_extent;\n\t\t\t\taddress.push_back(location);\n\t\t\t\t\/\/ recursive step\n\t\t\t\tNDGrid::sample(extents, grid_points_per_major_axis, func, address);\n\t\t\t\taddress.pop_back(); \/\/ remove the element we just added (this way avoids copying)\n\t\t\t}\n\t\t}\n\t}\n\ttemplate <typename Func> static inline void sample(\n\t\t\tconst std::vector<std::pair<double,double> > &extents,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func) {\n\t\tstd::vector<double> address;\n\t\tNDGrid::sample(extents, grid_points_per_major_axis, func, address);\n\t}\n\ttemplate <typename Func> static void sample(\n\t\t\tconst double min_extent,\n\t\t\tconst double max_extent,\n\t\t\tconst std::size_t dimension,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func,\n\t\t\tstd::vector<double>& address) {\n\t\tif (address.size() == dimension) {\n\t\t\t\/\/ terminating condition; address is complete\n\t\t\tfunc(address);\n\t\t}\n\t\telse {\n\t\t\tdouble step = (max_extent - min_extent) \/ grid_points_per_major_axis;\n\t\t\tfor (auto j = 0; j <= grid_points_per_major_axis; ++j) {\n\t\t\t\tdouble location = step*j + min_extent;\n\t\t\t\taddress.push_back(location);\n\t\t\t\t\/\/ recursive step\n\t\t\t\tNDGrid::sample(min_extent, max_extent, dimension, grid_points_per_major_axis, func, address);\n\t\t\t\taddress.pop_back(); \/\/ remove the element we just added (this way avoids copying)\n\t\t\t}\n\t\t}\n\t}\n\ttemplate <typename Func> static inline void sample(\n\t\t\tconst double min_extent,\n\t\t\tconst double max_extent,\n\t\t\tconst std::size_t dimension,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func) {\n\t\tstd::vector<double> address;\n\t\tNDGrid::sample(min_extent, max_extent, dimension, grid_points_per_major_axis, func, address);\n\t}\n};\n\n#endif\n<commit_msg>Prevent duplicate point generation for fixed variables<commit_after>\/*=============================================================================\n\tCopyright (c) 2012-2013 Richard Otis\n\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n=============================================================================*\/\n\n\/\/ N-Dimensional uniform grid\n\n#ifndef INCLUDED_NDGRID\n#define INCLUDED_NDGRID\n\n#include <vector>\n#include <utility>\n\nstruct NDGrid {\n\ttemplate <typename Func> static void sample(\n\t\t\tconst std::vector<std::pair<double,double> > &extents,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func,\n\t\t\tstd::vector<double>& address) {\n\t\tif (address.size() == extents.size()) {\n\t\t\t\/\/ terminating condition; address is complete\n\t\t\tfunc(address);\n\t\t}\n\t\telse {\n\t\t\tconst double max_extent = extents[address.size()].second;\n\t\t\tconst double min_extent = extents[address.size()].first;\n\t\t\tdouble step = (max_extent - min_extent) \/ grid_points_per_major_axis;\n\t\t\tfor (auto j = 0; j <= grid_points_per_major_axis; ++j) {\n\t\t\t\tdouble location = step*j + min_extent;\n\t\t\t\taddress.push_back(location);\n\t\t\t\t\/\/ recursive step\n\t\t\t\tNDGrid::sample(extents, grid_points_per_major_axis, func, address);\n\t\t\t\taddress.pop_back(); \/\/ remove the element we just added (this way avoids copying)\n\t\t\t\tif (step == 0) break; \/\/ don't generate duplicate points\n\t\t\t}\n\t\t}\n\t}\n\ttemplate <typename Func> static inline void sample(\n\t\t\tconst std::vector<std::pair<double,double> > &extents,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func) {\n\t\tstd::vector<double> address;\n\t\tNDGrid::sample(extents, grid_points_per_major_axis, func, address);\n\t}\n\ttemplate <typename Func> static void sample(\n\t\t\tconst double min_extent,\n\t\t\tconst double max_extent,\n\t\t\tconst std::size_t dimension,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func,\n\t\t\tstd::vector<double>& address) {\n\t\tif (address.size() == dimension) {\n\t\t\t\/\/ terminating condition; address is complete\n\t\t\tfunc(address);\n\t\t}\n\t\telse {\n\t\t\tdouble step = (max_extent - min_extent) \/ grid_points_per_major_axis;\n\t\t\tfor (auto j = 0; j <= grid_points_per_major_axis; ++j) {\n\t\t\t\tdouble location = step*j + min_extent;\n\t\t\t\taddress.push_back(location);\n\t\t\t\t\/\/ recursive step\n\t\t\t\tNDGrid::sample(min_extent, max_extent, dimension, grid_points_per_major_axis, func, address);\n\t\t\t\taddress.pop_back(); \/\/ remove the element we just added (this way avoids copying)\n\t\t\t\tif (step == 0) break; \/\/ don't generate duplicate points\n\t\t\t}\n\t\t}\n\t}\n\ttemplate <typename Func> static inline void sample(\n\t\t\tconst double min_extent,\n\t\t\tconst double max_extent,\n\t\t\tconst std::size_t dimension,\n\t\t\tconst double grid_points_per_major_axis,\n\t\t\tconst Func &func) {\n\t\tstd::vector<double> address;\n\t\tNDGrid::sample(min_extent, max_extent, dimension, grid_points_per_major_axis, func, address);\n\t}\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>refactor(map): changing map.at() by map.find()<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\n#include <mutex>\n\nnamespace Doremi\n{\n namespace Utilities\n {\n namespace IO\n {\n class Mutex : public std::mutex\n {\n public:\n \/**\n Returns true if successfully initialized\n *\/\n virtual bool Initialize(const std::string& p_name) = 0;\n\n virtual void lock() = 0;\n\n virtual bool try_lock() = 0;\n\n virtual bool try_lock(const uint32_t& p_timeout) = 0;\n\n virtual void unlock() = 0;\n };\n }\n }\n}<commit_msg>Added ~virtual destructor to Mutex interface<commit_after>#pragma once\n#include <mutex>\n\nnamespace Doremi\n{\n namespace Utilities\n {\n namespace IO\n {\n class Mutex : public std::mutex\n {\n public:\n virtual ~Mutex() {}\n\n \/**\n Returns true if successfully initialized\n *\/\n virtual bool Initialize(const std::string& p_name) = 0;\n\n virtual void lock() = 0;\n\n virtual bool try_lock() = 0;\n\n virtual bool try_lock(const uint32_t& p_timeout) = 0;\n\n virtual void unlock() = 0;\n };\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"utilities.h\"\n\n#include <stdexcept>\n#include <iomanip>\n#include <sstream>\n\nnamespace libcellml {\n\nbool convertToDouble(const std::string &candidate, double *value)\n{\n bool canConvert = false;\n \/\/ Try to convert the input string to double.\n try\n {\n double tmp = std::stod(candidate);\n if (value) {\n *value = tmp;\n }\n canConvert = true;\n } catch (...) {\n canConvert = false;\n }\n\n return canConvert;\n}\n\nbool hasNonWhitespaceCharacters(const std::string &input)\n{\n return input.find_first_not_of(\" \\t\\n\\v\\f\\r\") != input.npos;;\n}\n\nstd::string convertDoubleToString(double value)\n{\n std::ostringstream strs;\n strs << std::setprecision(std::numeric_limits<double>::digits10) << value;\n return strs.str();\n}\n\n}\n<commit_msg>Add limits header include.<commit_after>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"utilities.h\"\n\n#include <stdexcept>\n#include <iomanip>\n#include <limits>\n#include <sstream>\n\nnamespace libcellml {\n\nbool convertToDouble(const std::string &candidate, double *value)\n{\n bool canConvert = false;\n \/\/ Try to convert the input string to double.\n try\n {\n double tmp = std::stod(candidate);\n if (value) {\n *value = tmp;\n }\n canConvert = true;\n } catch (...) {\n canConvert = false;\n }\n\n return canConvert;\n}\n\nbool hasNonWhitespaceCharacters(const std::string &input)\n{\n return input.find_first_not_of(\" \\t\\n\\v\\f\\r\") != input.npos;;\n}\n\nstd::string convertDoubleToString(double value)\n{\n std::ostringstream strs;\n strs << std::setprecision(std::numeric_limits<double>::digits10) << value;\n return strs.str();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>MAVLink FTP: Update implementation according to updates specs The MAVLink specs for CreateFile in MAVLink FTP were updated on Dec 23, 2020 (today) with a behavior change to truncate a file if it already existed, following the UNIX standard behavior: https:\/\/pubs.opengroup.org\/onlinepubs\/9699919799\/functions\/creat.html. This change is tracking that spec change. While it is a functional change, the limited usage of the FTP protocol and the fact that implementations should not rely on error states to determine wether to truncate a file or not makes this a viable change.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 The Flutter Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <chrono>\n#include <thread>\n\n#include \"flutter\/fml\/synchronization\/count_down_latch.h\"\n#include \"flutter\/fml\/thread.h\"\n#include \"flutter\/testing\/testing.h\"\n\nnamespace fml {\n\nTEST(CountDownLatchTest, CanWaitOnZero) {\n CountDownLatch latch(0);\n latch.Wait();\n}\n\nTEST(CountDownLatchTest, CanWait) {\n fml::Thread thread(\"test_thread\");\n const size_t count = 100;\n size_t current_count = 0;\n CountDownLatch latch(count);\n auto decrement_latch_on_thread = [runner = thread.GetTaskRunner(), &latch,\n ¤t_count]() {\n runner->PostTask([&latch, ¤t_count]() {\n std::this_thread::sleep_for(std::chrono::microseconds(100));\n current_count++;\n latch.CountDown();\n });\n };\n for (size_t i = 0; i < count; ++i) {\n decrement_latch_on_thread();\n }\n latch.Wait();\n ASSERT_EQ(current_count, count);\n}\n\n} \/\/ namespace fml\n<commit_msg>Disable flakey CountDownLatchTest.CanWait unit test on Fuchsia (#15982)<commit_after>\/\/ Copyright 2013 The Flutter Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <chrono>\n#include <thread>\n\n#include \"flutter\/fml\/build_config.h\"\n#include \"flutter\/fml\/synchronization\/count_down_latch.h\"\n#include \"flutter\/fml\/thread.h\"\n#include \"flutter\/testing\/testing.h\"\n\nnamespace fml {\n\nTEST(CountDownLatchTest, CanWaitOnZero) {\n CountDownLatch latch(0);\n latch.Wait();\n}\n\n#if OS_FUCHSIA\n#define CanWait DISABLED_CanWait\n#else\n#define CanWait CanWait\n#endif\nTEST(CountDownLatchTest, CanWait) {\n fml::Thread thread(\"test_thread\");\n const size_t count = 100;\n size_t current_count = 0;\n CountDownLatch latch(count);\n auto decrement_latch_on_thread = [runner = thread.GetTaskRunner(), &latch,\n ¤t_count]() {\n runner->PostTask([&latch, ¤t_count]() {\n std::this_thread::sleep_for(std::chrono::microseconds(100));\n current_count++;\n latch.CountDown();\n });\n };\n for (size_t i = 0; i < count; ++i) {\n decrement_latch_on_thread();\n }\n latch.Wait();\n ASSERT_EQ(current_count, count);\n}\n\n} \/\/ namespace fml\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: progressbarwrapper.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: obo $ $Date: 2004-09-09 17:11:14 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRUNTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRUNTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef __FRAMEWORK_UIELEMENT_PROGRESSBARWRAPPER_HXX_\n#include <uielement\/progressbarwrapper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_HELPER_STATUSINDICATOR_HXX_\n#include <helper\/statusindicator.hxx>\n#endif\n#ifndef __FRAMEWORK_THREADHELP_RESETABLEGUARD_HXX_\n#include <threadhelp\/resetableguard.hxx>\n#endif\n#ifndef __FRAMEWORK_UIELEMENT_STATUSINDICATORINTERFACEWRAPPER_HXX_\n#include <uielement\/statusindicatorinterfacewrapper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _DRAFTS_COM_SUN_STAR_UI_UIELEMENTTYPE_HPP_\n#include <drafts\/com\/sun\/star\/ui\/UIElementType.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\nusing namespace ::com::sun::star;\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ non exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ non exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ declarations\n\/\/_________________________________________________________________________________________________________________\n\nProgressBarWrapper::ProgressBarWrapper() :\nUIElementWrapperBase( ::drafts::com::sun::star::ui::UIElementType::PROGRESSBAR )\n , m_bOwnsInstance( sal_False )\n , m_nRange( 100 )\n , m_nValue( 0 )\n{\n}\n\nProgressBarWrapper::~ProgressBarWrapper()\n{\n}\n\n\/\/ public interfaces\nvoid ProgressBarWrapper::setStatusBar( const uno::Reference< awt::XWindow >& rStatusBar, sal_Bool bOwnsInstance )\n{\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n if ( m_bOwnsInstance )\n {\n \/\/ dispose XWindow reference our our status bar\n uno::Reference< lang::XComponent > xComponent( m_xStatusBar, uno::UNO_QUERY );\n try\n {\n if ( xComponent.is() )\n xComponent->dispose();\n }\n catch ( uno::Exception& )\n {\n }\n m_xStatusBar.clear();\n }\n\n m_bOwnsInstance = bOwnsInstance;\n m_xStatusBar = rStatusBar;\n}\n\nuno::Reference< awt::XWindow > ProgressBarWrapper::getStatusBar() const\n{\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return uno::Reference< awt::XWindow >();\n\n return m_xStatusBar;\n}\n\n\/\/ wrapped methods of ::com::sun::star::task::XStatusIndicator\nvoid ProgressBarWrapper::start( const ::rtl::OUString& Text, ::sal_Int32 Range )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_nValue = 0;\n m_nRange = Range;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( !pStatusBar->IsProgressMode() )\n pStatusBar->StartProgressMode( Text );\n else\n pStatusBar->SetText( Text );\n }\n }\n}\n\nvoid ProgressBarWrapper::end()\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_nRange = 100;\n m_nValue = 0;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( pStatusBar->IsProgressMode() )\n pStatusBar->EndProgressMode();\n }\n }\n}\n\nvoid ProgressBarWrapper::setText( const ::rtl::OUString& Text )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n sal_Int32 nValue( 0 );\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_aText = Text;\n nValue = m_nValue;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if( pStatusBar->IsProgressMode() )\n {\n pStatusBar->SetUpdateMode( FALSE );\n pStatusBar->EndProgressMode();\n pStatusBar->StartProgressMode( Text );\n pStatusBar->SetProgressValue( USHORT( nValue ));\n pStatusBar->SetUpdateMode( TRUE );\n }\n else\n pStatusBar->SetText( Text );\n }\n }\n}\n\nvoid ProgressBarWrapper::setValue( ::sal_Int32 nValue )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n rtl::OUString aText;\n sal_Bool bSetValue( sal_False );\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n\n double fVal( 0 );\n if ( m_nRange > 0 )\n {\n fVal = ( double( nValue ) \/ double( m_nRange )) * 100;\n fVal = std::max( double( 0 ), std::min( fVal, double( 100 )));\n }\n\n if ( m_nValue != sal_Int32( fVal ))\n {\n m_nValue = sal_Int32( fVal );\n bSetValue = sal_True;\n }\n\n nValue = m_nValue;\n aText = m_aText;\n }\n\n if ( xWindow.is() && bSetValue )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( !pStatusBar->IsProgressMode() )\n pStatusBar->StartProgressMode( aText );\n pStatusBar->SetProgressValue( USHORT( nValue ));\n }\n }\n}\n\nvoid ProgressBarWrapper::reset()\nthrow (uno::RuntimeException)\n{\n setText( rtl::OUString() );\n setValue( 0 );\n}\n\n\/\/ XInitialization\nvoid SAL_CALL ProgressBarWrapper::initialize( const uno::Sequence< uno::Any >& aArguments )\nthrow (uno::Exception, uno::RuntimeException)\n{\n \/\/ dummy - do nothing\n}\n\n\/\/ XUpdatable\nvoid SAL_CALL ProgressBarWrapper::update()\nthrow (uno::RuntimeException)\n{\n \/\/ dummy - do nothing\n}\n\n\/\/ XComponent\nvoid SAL_CALL ProgressBarWrapper::dispose()\nthrow (uno::RuntimeException)\n{\n uno::Reference< lang::XComponent > xThis(\n static_cast< cppu::OWeakObject* >(this),\n uno::UNO_QUERY );\n\n {\n ResetableGuard aLock( m_aLock );\n\n if ( m_bDisposed )\n return;\n }\n\n {\n lang::EventObject aEvent( xThis );\n m_aListenerContainer.disposeAndClear( aEvent );\n\n ResetableGuard aLock( m_aLock );\n if ( m_bOwnsInstance )\n {\n try\n {\n uno::Reference< lang::XComponent > xComponent( m_xStatusBar, uno::UNO_QUERY );\n if ( xComponent.is() )\n xComponent->dispose();\n }\n catch ( lang::DisposedException& )\n {\n }\n }\n\n m_xStatusBar.clear();\n m_bDisposed = sal_True;\n }\n}\n\n\/\/ XUIElement\nuno::Reference< uno::XInterface > SAL_CALL ProgressBarWrapper::getRealInterface()\nthrow (uno::RuntimeException)\n{\n \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n \/\/ Ready for multithreading\n ResetableGuard aLock( m_aLock );\n\n if ( m_bDisposed )\n return uno::Reference< uno::XInterface >();\n else\n {\n uno::Reference< uno::XInterface > xComp( m_xProgressBarIfacWrapper );\n if ( !xComp.is() )\n {\n StatusIndicatorInterfaceWrapper* pWrapper =\n new StatusIndicatorInterfaceWrapper(\n uno::Reference< lang::XComponent >(\n static_cast< cppu::OWeakObject* >( this ),\n uno::UNO_QUERY ));\n xComp = uno::Reference< uno::XInterface >(\n static_cast< cppu::OWeakObject* >( pWrapper ),\n uno::UNO_QUERY );\n m_xProgressBarIfacWrapper = xComp;\n }\n\n return xComp;\n }\n}\n\n} \/\/ namespace framework\n<commit_msg>INTEGRATION: CWS removedrafts (1.2.114); FILE MERGED 2005\/02\/17 12:47:49 cd 1.2.114.1: #i42557# move UNOIDL types from drafts to com<commit_after>\/*************************************************************************\n *\n * $RCSfile: progressbarwrapper.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2005-03-01 19:43:01 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRUNTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRUNTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef __FRAMEWORK_UIELEMENT_PROGRESSBARWRAPPER_HXX_\n#include <uielement\/progressbarwrapper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_HELPER_STATUSINDICATOR_HXX_\n#include <helper\/statusindicator.hxx>\n#endif\n#ifndef __FRAMEWORK_THREADHELP_RESETABLEGUARD_HXX_\n#include <threadhelp\/resetableguard.hxx>\n#endif\n#ifndef __FRAMEWORK_UIELEMENT_STATUSINDICATORINTERFACEWRAPPER_HXX_\n#include <uielement\/statusindicatorinterfacewrapper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_UI_UIELEMENTTYPE_HPP_\n#include <com\/sun\/star\/ui\/UIElementType.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ includes of other projects\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\nusing namespace ::com::sun::star;\n\nnamespace framework{\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ non exported const\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ non exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ declarations\n\/\/_________________________________________________________________________________________________________________\n\nProgressBarWrapper::ProgressBarWrapper() :\nUIElementWrapperBase( ::com::sun::star::ui::UIElementType::PROGRESSBAR )\n , m_bOwnsInstance( sal_False )\n , m_nRange( 100 )\n , m_nValue( 0 )\n{\n}\n\nProgressBarWrapper::~ProgressBarWrapper()\n{\n}\n\n\/\/ public interfaces\nvoid ProgressBarWrapper::setStatusBar( const uno::Reference< awt::XWindow >& rStatusBar, sal_Bool bOwnsInstance )\n{\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n if ( m_bOwnsInstance )\n {\n \/\/ dispose XWindow reference our our status bar\n uno::Reference< lang::XComponent > xComponent( m_xStatusBar, uno::UNO_QUERY );\n try\n {\n if ( xComponent.is() )\n xComponent->dispose();\n }\n catch ( uno::Exception& )\n {\n }\n m_xStatusBar.clear();\n }\n\n m_bOwnsInstance = bOwnsInstance;\n m_xStatusBar = rStatusBar;\n}\n\nuno::Reference< awt::XWindow > ProgressBarWrapper::getStatusBar() const\n{\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return uno::Reference< awt::XWindow >();\n\n return m_xStatusBar;\n}\n\n\/\/ wrapped methods of ::com::sun::star::task::XStatusIndicator\nvoid ProgressBarWrapper::start( const ::rtl::OUString& Text, ::sal_Int32 Range )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_nValue = 0;\n m_nRange = Range;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( !pStatusBar->IsProgressMode() )\n pStatusBar->StartProgressMode( Text );\n else\n pStatusBar->SetText( Text );\n }\n }\n}\n\nvoid ProgressBarWrapper::end()\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_nRange = 100;\n m_nValue = 0;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( pStatusBar->IsProgressMode() )\n pStatusBar->EndProgressMode();\n }\n }\n}\n\nvoid ProgressBarWrapper::setText( const ::rtl::OUString& Text )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n sal_Int32 nValue( 0 );\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n m_aText = Text;\n nValue = m_nValue;\n }\n\n if ( xWindow.is() )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if( pStatusBar->IsProgressMode() )\n {\n pStatusBar->SetUpdateMode( FALSE );\n pStatusBar->EndProgressMode();\n pStatusBar->StartProgressMode( Text );\n pStatusBar->SetProgressValue( USHORT( nValue ));\n pStatusBar->SetUpdateMode( TRUE );\n }\n else\n pStatusBar->SetText( Text );\n }\n }\n}\n\nvoid ProgressBarWrapper::setValue( ::sal_Int32 nValue )\nthrow (uno::RuntimeException)\n{\n uno::Reference< awt::XWindow > xWindow;\n rtl::OUString aText;\n sal_Bool bSetValue( sal_False );\n\n {\n ResetableGuard aGuard( m_aLock );\n\n if ( m_bDisposed )\n return;\n\n xWindow = m_xStatusBar;\n\n double fVal( 0 );\n if ( m_nRange > 0 )\n {\n fVal = ( double( nValue ) \/ double( m_nRange )) * 100;\n fVal = std::max( double( 0 ), std::min( fVal, double( 100 )));\n }\n\n if ( m_nValue != sal_Int32( fVal ))\n {\n m_nValue = sal_Int32( fVal );\n bSetValue = sal_True;\n }\n\n nValue = m_nValue;\n aText = m_aText;\n }\n\n if ( xWindow.is() && bSetValue )\n {\n vos::OGuard aSolarMutexGuard( Application::GetSolarMutex() );\n Window* pWindow = VCLUnoHelper::GetWindow( xWindow );\n if ( pWindow && pWindow->GetType() == WINDOW_STATUSBAR )\n {\n StatusBar* pStatusBar = (StatusBar *)pWindow;\n if ( !pStatusBar->IsProgressMode() )\n pStatusBar->StartProgressMode( aText );\n pStatusBar->SetProgressValue( USHORT( nValue ));\n }\n }\n}\n\nvoid ProgressBarWrapper::reset()\nthrow (uno::RuntimeException)\n{\n setText( rtl::OUString() );\n setValue( 0 );\n}\n\n\/\/ XInitialization\nvoid SAL_CALL ProgressBarWrapper::initialize( const uno::Sequence< uno::Any >& aArguments )\nthrow (uno::Exception, uno::RuntimeException)\n{\n \/\/ dummy - do nothing\n}\n\n\/\/ XUpdatable\nvoid SAL_CALL ProgressBarWrapper::update()\nthrow (uno::RuntimeException)\n{\n \/\/ dummy - do nothing\n}\n\n\/\/ XComponent\nvoid SAL_CALL ProgressBarWrapper::dispose()\nthrow (uno::RuntimeException)\n{\n uno::Reference< lang::XComponent > xThis(\n static_cast< cppu::OWeakObject* >(this),\n uno::UNO_QUERY );\n\n {\n ResetableGuard aLock( m_aLock );\n\n if ( m_bDisposed )\n return;\n }\n\n {\n lang::EventObject aEvent( xThis );\n m_aListenerContainer.disposeAndClear( aEvent );\n\n ResetableGuard aLock( m_aLock );\n if ( m_bOwnsInstance )\n {\n try\n {\n uno::Reference< lang::XComponent > xComponent( m_xStatusBar, uno::UNO_QUERY );\n if ( xComponent.is() )\n xComponent->dispose();\n }\n catch ( lang::DisposedException& )\n {\n }\n }\n\n m_xStatusBar.clear();\n m_bDisposed = sal_True;\n }\n}\n\n\/\/ XUIElement\nuno::Reference< uno::XInterface > SAL_CALL ProgressBarWrapper::getRealInterface()\nthrow (uno::RuntimeException)\n{\n \/* SAFE AREA ----------------------------------------------------------------------------------------------- *\/\n \/\/ Ready for multithreading\n ResetableGuard aLock( m_aLock );\n\n if ( m_bDisposed )\n return uno::Reference< uno::XInterface >();\n else\n {\n uno::Reference< uno::XInterface > xComp( m_xProgressBarIfacWrapper );\n if ( !xComp.is() )\n {\n StatusIndicatorInterfaceWrapper* pWrapper =\n new StatusIndicatorInterfaceWrapper(\n uno::Reference< lang::XComponent >(\n static_cast< cppu::OWeakObject* >( this ),\n uno::UNO_QUERY ));\n xComp = uno::Reference< uno::XInterface >(\n static_cast< cppu::OWeakObject* >( pWrapper ),\n uno::UNO_QUERY );\n m_xProgressBarIfacWrapper = xComp;\n }\n\n return xComp;\n }\n}\n\n} \/\/ namespace framework\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\r\n#include \"ogglength.h\"\r\n#include <vorbis\/vorbisfile.h>\r\n#include \"utilities.h\"\r\n#include <vector>\r\n#include <cstdio>\r\n#include <string>\r\n#include <exception>\r\n#include <boost\/lexical_cast.hpp>\r\n\r\n\/\/ Automatically link to libogg, libvorbis, and libvorbis file if using MSVC.\r\n\/\/ Use the dynamic versions if OGG_DYNAMIC is defined, use the static versions if OGG_STATIC is defined or neither is defined.\r\n\/\/ If linking statically, the libraries must have been compiled with the same standard library settings (debug vs. release)\r\n#ifdef _MSC_VER\r\n#if defined(OGG_STATIC) && defined(OGG_DYNAMIC)\r\n#error Ogg static or Ogg dynamic - pick one, not both\r\n#endif\r\n#ifdef OGG_DYNAMIC\r\n#pragma comment(lib, \"libogg.lib\")\r\n#pragma comment(lib, \"libvorbis.lib\")\r\n#pragma comment(lib, \"libvorbisfile.lib\")\r\n#else\r\n#pragma comment(lib, \"libogg_static.lib\")\r\n#pragma comment(lib, \"libvorbis_static.lib\")\r\n#pragma comment(lib, \"libvorbisfile_static.lib\")\r\n#endif\r\n#endif\r\n\r\nusing namespace std;\r\nusing namespace boost;\r\nusing namespace lhcutilities;\r\n\r\nnamespace ogglength\r\n{\r\n\r\nOggVorbisFile::OggVorbisFile(const char* filePath) : m_handle(new _OggVorbisFile())\r\n{\r\n\t\/\/ ov_fopen taking a char* instead of a const char* is an acknowledged bug in the API\r\n\tint openResult = ov_fopen(const_cast<char*>(filePath), &(m_handle->file));\r\n\tif(openResult != 0)\r\n\t{\r\n\t\tthrow OggVorbisError(\"Error opening Ogg Vorbis file.\");\r\n\t}\r\n\t\r\n\tm_handle->opened = true;\r\n}\r\n\r\nOggVorbis_File* OggVorbisFile::get()\r\n{\r\n\treturn &(m_handle->file);\r\n}\r\n\r\ndouble GetReportedTime(const char* filePath)\r\n{\r\n\tOggVorbisFile oggFile(filePath);\r\n\tdouble reportedTime = ov_time_total(oggFile.get(), -1);\r\n\tif(reportedTime == OV_EINVAL) \/\/ I think this can happen if the file is marked as unseekable in the Vorbis headers?\r\n\t{\r\n\t\tthrow OggVorbisError(\"Ogg Vorbis file is not seekable.\"); \r\n\t}\r\n\treturn reportedTime;\r\n}\r\n\r\ndouble GetRealTime(const char* filePath)\r\n{\r\n\tOggVorbisFile oggFile(filePath);\r\n\tdouble totalTimeRead = 0;\r\n\tchar buffer[4096];\r\n\tint logicalBitstreamRead = -555;\r\n\tint logicalBitstreamReading = -1;\r\n\r\n\tlong totalBytesRead = 0;\r\n\tlong totalSamplesRead = 0;\r\n\r\n\tlong bytesRead;\r\n\tint pcmWordSize = 2; \/\/ 16-bit samples\r\n\twhile((bytesRead = ov_read(oggFile.get(), buffer, 4096, 0, pcmWordSize, 1, &logicalBitstreamRead)) > 0)\r\n\t{\r\n\t\tif(logicalBitstreamReading == -1)\r\n\t\t{\r\n\t\t\tlogicalBitstreamReading = logicalBitstreamRead;\r\n\t\t}\r\n\t\telse if(logicalBitstreamReading != logicalBitstreamRead)\r\n\t\t{\r\n\t\t\tthrow OggVorbisError(\"More than one logical bitstream in the file. Can't handle that currently.\");\r\n\t\t}\r\n\t\tlong samplesRead = bytesRead \/ pcmWordSize;\r\n\t\tdouble timeRead = (double)(samplesRead) \/ oggFile.get()->vi[logicalBitstreamRead].rate;\r\n\t\tint numChannels = oggFile.get()->vi[logicalBitstreamRead].channels;\r\n\t\ttimeRead \/= numChannels;\r\n\r\n\t\ttotalBytesRead += bytesRead;\r\n\t\ttotalSamplesRead += samplesRead;\r\n\t\ttotalTimeRead += timeRead;\r\n\t}\r\n\r\n\tif(bytesRead < 0)\r\n\t{\r\n\t\tthrow OggVorbisError(\"Error while decoding. The file may be corrupt.\");\r\n\t}\r\n\r\n\treturn totalTimeRead;\r\n}\r\n\r\n\r\n\r\n\/\/ Sets the length of an Ogg Vorbis file in samples.\r\n\/\/ This is done by changing the granule position field of the last Ogg page.\r\n\/\/ The file is assumed to be a normal Ogg Vorbis file (1 logical bitstream).\r\n\/\/ If the file is not an Ogg file, a logic_error will be thrown.\r\n\/\/ If the file is an Ogg file but not a file containing only a Vorbis bitstream, behavior is undefined.\r\n\/\/ ogglength::OggVorbisError will be thrown if the he file could not be opened or some other IO error occurs\r\n\/\/ or the file does not appear to be an Ogg Vorbis file or seems corrupt.\r\n\/\/ If the function returns without throwing an exception, it succeeded.\r\nvoid ChangeSongLength(const char* filePath, double numSeconds)\r\n{\r\n\tFILE* file = NULL;\r\n\ttry\r\n\t{\r\n\t\tfile = OpenOrDie(filePath, \"r+b\");\r\n\r\n\t\tunsigned char version; \/\/ Version field of an Ogg page\r\n\t\tunsigned char headerType; \/\/ Header type field of an Ogg page.\r\n\t\togg_uint32_t sampleRate = 0;\r\n\t\togg_int32_t savedBitstreamSerialNumber;\r\n\r\n\t\t\/\/ Read Ogg pages until we get to the last page. Have the seek pointer at granule position then.\r\n\t\twhile(true)\r\n\t\t{\r\n\t\t\t\/\/ All Ogg pages begin with the bytes \"OggS\"\r\n\t\t\tvector<unsigned char> buffer = ReadBytesOrDie(file, 4);\r\n\t\t\tif(buffer[0] != 'O' || buffer[1] != 'g' || buffer[2] != 'g' || buffer[3] != 'S')\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"File does not appear to be an Ogg file or is corrupted.\");\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Ogg version field. Currently should always be 0.\r\n\t\t\tversion = ReadOrDie<unsigned char>(file);\r\n\t\t\tif(version != 0)\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"Ogg version is \" + lexical_cast<string>((unsigned int)(version)) + \". Don't know how to handle versions other than 0.\");\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Header type field indicates if this page is the beginning,\r\n\t\t\t\/\/ end, or middle of an Ogg logical bitstream.\r\n\t\t\t\/\/ It is permitted for a page to be both beginning and end - that means it's the only page.\r\n\t\t\theaderType = ReadOrDie<unsigned char>(file);\r\n\t\t\tbool continuation = CheckBit(headerType, 0);\r\n\t\t\tbool beginningOfStream = CheckBit(headerType, 1);\r\n\t\t\tbool endOfStream = CheckBit(headerType, 2);\r\n\r\n\t\t\t\/\/ End of stream bit was set in the header type field - this is the last page of the logical bitstream\r\n\t\t\tif(endOfStream)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\/\/ In Vorbis logical bitstreams, the granule position is the number of the last sample\r\n\t\t\t\/\/ contained in this frame.\r\n\t\t\togg_int64_t granulePosition = ReadOrDie<ogg_int64_t>(file);\r\n\t\t\t\/\/ Bitstream serial number might be of interest if we wanted to be able to handle Ogg files with\r\n\t\t\t\/\/ multiple logical bitstreams...but we don't care.\r\n\t\t\togg_int32_t bitstreamSerialNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\tif(sampleRate != 0 && bitstreamSerialNumber != savedBitstreamSerialNumber)\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"More than one logical bitstream in the file. Can't handle that currently.\");\r\n\t\t\t}\r\n\t\t\tsavedBitstreamSerialNumber = bitstreamSerialNumber;\r\n\r\n\t\t\togg_int32_t pageSequenceNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\togg_int32_t checksum = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\tunsigned char numSegments = ReadOrDie<unsigned char>(file);\r\n\r\n\t\t\tif(sampleRate == 0)\r\n\t\t\t{\r\n\t\t\t\tvector<unsigned char> segmentSizes = ReadBytesOrDie(file, numSegments);\r\n\t\t\t\togg_uint32_t vorbisHeaderPacketSize = 0;\r\n\t\t\t\tfor(int segIndex = 0; segIndex < numSegments; segIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tvorbisHeaderPacketSize += segmentSizes[segIndex];\r\n\t\t\t\t\tif(segmentSizes[segIndex] < 255)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif(vorbisHeaderPacketSize < 16)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Couldn't read Vorbis header.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tunsigned char packetType = ReadOrDie<unsigned char>(file);\r\n\t\t\t\tif(packetType != 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Does not appear to be an Ogg Vorbis file.\");\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tvector<unsigned char> vorbisString = ReadBytesOrDie(file, 6);\r\n\t\t\t\tif(vorbisString[0] != 'v' || vorbisString[1] != 'o' || vorbisString[2] != 'r' \r\n\t\t\t\t|| vorbisString[3] != 'b' || vorbisString[4] != 'i' || vorbisString[5] != 's')\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Does not appear to be an Ogg Vorbis file.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_uint32_t vorbisVersion = ReadOrDie<ogg_uint32_t>(file);\r\n\t\t\t\tif(vorbisVersion != 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Vorbis version is not 0, don't know how to handle other version.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tunsigned char numChannels = ReadOrDie<unsigned char>(file);\r\n\t\t\t\tsampleRate = ReadOrDie<ogg_uint32_t>(file);\r\n\t\t\t\tif(sampleRate == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"File has a sample rate of 0. O_o\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_int32_t pageDataSize = 0;\r\n\t\t\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tunsigned char segmentSize = segmentSizes[segmentIndex];\r\n\t\t\t\t\tpageDataSize += segmentSize;\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_int32_t unreadDataBytes = pageDataSize - 16;\r\n\t\t\t\tSeekOrDie(file, unreadDataBytes, Seek_Cur);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t\/\/ We're not reading the data portion of the page, so we don't need to know how\r\n\t\t\t\t\/\/ large each segment is, just the total size.\r\n\t\t\t\togg_int32_t pageDataSize = 0;\r\n\t\t\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tunsigned char segmentSize = ReadOrDie<unsigned char>(file);\r\n\t\t\t\t\tpageDataSize += segmentSize;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t\/\/ Skip the data of the page, we're not interested in it.\r\n\t\t\t\tSeekOrDie(file, pageDataSize, Seek_Cur);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\r\n\t\t\/\/ Converting from seconds to samples might cause the result to be off be 1 if the number of seconds\r\n\t\t\/\/ came from GetRealTime().\r\n\t\togg_int64_t numSamples = (ogg_int64_t)(numSeconds * sampleRate);\r\n\r\n\t\t\/\/ Remember where the granule position field is, we're going to edit it later.\r\n\t\t\/\/ For now, we're reading the entire page so we can calculate what the checksum\r\n\t\t\/\/ should be after we change the granule position field.\r\n\t\tlong granulePositionPosition = TellOrDie(file);\r\n\r\n\t\togg_int64_t granulePosition = ReadOrDie<ogg_int64_t>(file);\r\n\t\tgranulePosition = numSamples; \/\/ Set to what it will be for checksum calculation\r\n\r\n\t\togg_int32_t bitstreamSerialNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\togg_int32_t pageSequenceNumber = ReadOrDie<ogg_int32_t>(file);\r\n\r\n\t\togg_int32_t checksum = ReadOrDie<ogg_int32_t>(file);\r\n\t\tchecksum = 0; \/\/ Set to 0 for checksum calculation\r\n\r\n\t\tunsigned char numSegments = ReadOrDie<unsigned char>(file);\r\n\r\n\t\tvector<unsigned char> segmentSizes = ReadBytesOrDie(file, numSegments);\r\n\r\n\t\t\/\/ Reconstruct the header (with the new granule position) as a byte vector for checksumming\r\n\t\tvector<unsigned char> headerBytes;\r\n\t\theaderBytes.push_back('O');\r\n\t\theaderBytes.push_back('g');\r\n\t\theaderBytes.push_back('g');\r\n\t\theaderBytes.push_back('S');\r\n\t\theaderBytes.push_back(version);\r\n\t\theaderBytes.push_back(headerType);\r\n\t\tAppendBytes(headerBytes, granulePosition);\r\n\t\tAppendBytes(headerBytes, bitstreamSerialNumber);\r\n\t\tAppendBytes(headerBytes, pageSequenceNumber);\r\n\t\tAppendBytes(headerBytes, checksum);\r\n\t\theaderBytes.push_back(numSegments);\r\n\t\theaderBytes.insert(headerBytes.end(), segmentSizes.begin(), segmentSizes.end());\r\n\r\n\t\t\r\n\t\t\/\/ Calculate the size of the data part of the page\r\n\t\togg_int32_t pageDataSize = 0;\r\n\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t{\r\n\t\t\tunsigned char segmentSize = segmentSizes[segmentIndex];\r\n\t\t\tpageDataSize += segmentSize;\r\n\t\t}\r\n\r\n\t\t\/\/ Read the entire data part of the page into a byte vector for checksumming\r\n\t\tvector<unsigned char> dataBytes = ReadBytesOrDie(file, pageDataSize);\r\n\r\n\r\n\t\togg_page page;\r\n\t\tpage.header_len = headerBytes.size();\r\n\t\tpage.header = &(headerBytes[0]);\r\n\t\tpage.body_len = dataBytes.size();\r\n\t\tif(dataBytes.size() > 0)\r\n\t\t{\r\n\t\t\tpage.body = &(dataBytes[0]);\r\n\t\t}\r\n\r\n\t\t\/\/ Let libogg do the tricky CRC stuff\r\n\t\togg_page_checksum_set(&page);\r\n\t\tchecksum = GetFromBytes<ogg_int32_t>(headerBytes, 22);\r\n\r\n\t\t\/\/ Finally, write the updated granule position and checksum. We're not changing the file\r\n\t\t\/\/ size or moving anything around, so we can just edit the file in place.\r\n\t\tSeekOrDie(file, granulePositionPosition, Seek_Set);\r\n\t\tWriteOrDie(file, granulePosition);\r\n\t\tSeekOrDie(file, 8, Seek_Cur);\r\n\t\tWriteOrDie(file, checksum);\r\n\t}\r\n\tcatch(IoError& ex)\r\n\t{\r\n\t\tif(file != NULL)\r\n\t\t{\r\n\t\t\tfclose(file); \/\/ Clean up if something went wrong\r\n\t\t\tthrow OggVorbisError(ex.what());\r\n\t\t}\r\n\t}\r\n\tcatch(OggVorbisError&)\r\n\t{\r\n\t\tif(file != NULL)\r\n\t\t{\r\n\t\t\tfclose(file); \/\/ Clean up if something went wrong\r\n\t\t\tthrow;\r\n\t\t}\r\n\t}\r\n\r\n\tfclose(file); \/\/ Clean up\r\n}\r\n\r\n} \/\/ end namespace ogglength\r\n<commit_msg>Protection against a divide by zero crash if the number of channels reported by a file is 0. libvorbis might error out if it sees that, but just in case.<commit_after>#include \"stdafx.h\"\r\n#include \"ogglength.h\"\r\n#include <vorbis\/vorbisfile.h>\r\n#include \"utilities.h\"\r\n#include <vector>\r\n#include <cstdio>\r\n#include <string>\r\n#include <exception>\r\n#include <boost\/lexical_cast.hpp>\r\n\r\n\/\/ Automatically link to libogg, libvorbis, and libvorbis file if using MSVC.\r\n\/\/ Use the dynamic versions if OGG_DYNAMIC is defined, use the static versions if OGG_STATIC is defined or neither is defined.\r\n\/\/ If linking statically, the libraries must have been compiled with the same standard library settings (debug vs. release)\r\n#ifdef _MSC_VER\r\n#if defined(OGG_STATIC) && defined(OGG_DYNAMIC)\r\n#error Ogg static or Ogg dynamic - pick one, not both\r\n#endif\r\n#ifdef OGG_DYNAMIC\r\n#pragma comment(lib, \"libogg.lib\")\r\n#pragma comment(lib, \"libvorbis.lib\")\r\n#pragma comment(lib, \"libvorbisfile.lib\")\r\n#else\r\n#pragma comment(lib, \"libogg_static.lib\")\r\n#pragma comment(lib, \"libvorbis_static.lib\")\r\n#pragma comment(lib, \"libvorbisfile_static.lib\")\r\n#endif\r\n#endif\r\n\r\nusing namespace std;\r\nusing namespace boost;\r\nusing namespace lhcutilities;\r\n\r\nnamespace ogglength\r\n{\r\n\r\nOggVorbisFile::OggVorbisFile(const char* filePath) : m_handle(new _OggVorbisFile())\r\n{\r\n\t\/\/ ov_fopen taking a char* instead of a const char* is an acknowledged bug in the API\r\n\tint openResult = ov_fopen(const_cast<char*>(filePath), &(m_handle->file));\r\n\tif(openResult != 0)\r\n\t{\r\n\t\tthrow OggVorbisError(\"Error opening Ogg Vorbis file.\");\r\n\t}\r\n\t\r\n\tm_handle->opened = true;\r\n}\r\n\r\nOggVorbis_File* OggVorbisFile::get()\r\n{\r\n\treturn &(m_handle->file);\r\n}\r\n\r\ndouble GetReportedTime(const char* filePath)\r\n{\r\n\tOggVorbisFile oggFile(filePath);\r\n\tdouble reportedTime = ov_time_total(oggFile.get(), -1);\r\n\tif(reportedTime == OV_EINVAL) \/\/ I think this can happen if the file is marked as unseekable in the Vorbis headers?\r\n\t{\r\n\t\tthrow OggVorbisError(\"Ogg Vorbis file is not seekable.\"); \r\n\t}\r\n\treturn reportedTime;\r\n}\r\n\r\ndouble GetRealTime(const char* filePath)\r\n{\r\n\tOggVorbisFile oggFile(filePath);\r\n\tdouble totalTimeRead = 0;\r\n\tchar buffer[4096];\r\n\tint logicalBitstreamRead = -555;\r\n\tint logicalBitstreamReading = -1;\r\n\r\n\tlong totalBytesRead = 0;\r\n\tlong totalSamplesRead = 0;\r\n\r\n\tlong bytesRead;\r\n\tint pcmWordSize = 2; \/\/ 16-bit samples\r\n\twhile((bytesRead = ov_read(oggFile.get(), buffer, 4096, 0, pcmWordSize, 1, &logicalBitstreamRead)) > 0)\r\n\t{\r\n\t\tif(logicalBitstreamReading == -1)\r\n\t\t{\r\n\t\t\tlogicalBitstreamReading = logicalBitstreamRead;\r\n\t\t}\r\n\t\telse if(logicalBitstreamReading != logicalBitstreamRead)\r\n\t\t{\r\n\t\t\tthrow OggVorbisError(\"More than one logical bitstream in the file. Can't handle that currently.\");\r\n\t\t}\r\n\t\tlong samplesRead = bytesRead \/ pcmWordSize;\r\n\t\tdouble timeRead = (double)(samplesRead) \/ oggFile.get()->vi[logicalBitstreamRead].rate;\r\n\t\tint numChannels = oggFile.get()->vi[logicalBitstreamRead].channels;\r\n\t\tif(numChannels <= 0)\r\n\t\t{\r\n\t\t\tthrow OggVorbisError(\"Number of channels is not a positive number.\");\r\n\t\t}\r\n\t\ttimeRead \/= numChannels;\r\n\r\n\t\ttotalBytesRead += bytesRead;\r\n\t\ttotalSamplesRead += samplesRead;\r\n\t\ttotalTimeRead += timeRead;\r\n\t}\r\n\r\n\tif(bytesRead < 0)\r\n\t{\r\n\t\tthrow OggVorbisError(\"Error while decoding. The file may be corrupt.\");\r\n\t}\r\n\r\n\treturn totalTimeRead;\r\n}\r\n\r\n\r\n\r\n\/\/ Sets the length of an Ogg Vorbis file in samples.\r\n\/\/ This is done by changing the granule position field of the last Ogg page.\r\n\/\/ The file is assumed to be a normal Ogg Vorbis file (1 logical bitstream).\r\n\/\/ If the file is not an Ogg file, a logic_error will be thrown.\r\n\/\/ If the file is an Ogg file but not a file containing only a Vorbis bitstream, behavior is undefined.\r\n\/\/ ogglength::OggVorbisError will be thrown if the he file could not be opened or some other IO error occurs\r\n\/\/ or the file does not appear to be an Ogg Vorbis file or seems corrupt.\r\n\/\/ If the function returns without throwing an exception, it succeeded.\r\nvoid ChangeSongLength(const char* filePath, double numSeconds)\r\n{\r\n\tFILE* file = NULL;\r\n\ttry\r\n\t{\r\n\t\tfile = OpenOrDie(filePath, \"r+b\");\r\n\r\n\t\tunsigned char version; \/\/ Version field of an Ogg page\r\n\t\tunsigned char headerType; \/\/ Header type field of an Ogg page.\r\n\t\togg_uint32_t sampleRate = 0;\r\n\t\togg_int32_t savedBitstreamSerialNumber;\r\n\r\n\t\t\/\/ Read Ogg pages until we get to the last page. Have the seek pointer at granule position then.\r\n\t\twhile(true)\r\n\t\t{\r\n\t\t\t\/\/ All Ogg pages begin with the bytes \"OggS\"\r\n\t\t\tvector<unsigned char> buffer = ReadBytesOrDie(file, 4);\r\n\t\t\tif(buffer[0] != 'O' || buffer[1] != 'g' || buffer[2] != 'g' || buffer[3] != 'S')\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"File does not appear to be an Ogg file or is corrupted.\");\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Ogg version field. Currently should always be 0.\r\n\t\t\tversion = ReadOrDie<unsigned char>(file);\r\n\t\t\tif(version != 0)\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"Ogg version is \" + lexical_cast<string>((unsigned int)(version)) + \". Don't know how to handle versions other than 0.\");\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ Header type field indicates if this page is the beginning,\r\n\t\t\t\/\/ end, or middle of an Ogg logical bitstream.\r\n\t\t\t\/\/ It is permitted for a page to be both beginning and end - that means it's the only page.\r\n\t\t\theaderType = ReadOrDie<unsigned char>(file);\r\n\t\t\tbool continuation = CheckBit(headerType, 0);\r\n\t\t\tbool beginningOfStream = CheckBit(headerType, 1);\r\n\t\t\tbool endOfStream = CheckBit(headerType, 2);\r\n\r\n\t\t\t\/\/ End of stream bit was set in the header type field - this is the last page of the logical bitstream\r\n\t\t\tif(endOfStream)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\/\/ In Vorbis logical bitstreams, the granule position is the number of the last sample\r\n\t\t\t\/\/ contained in this frame.\r\n\t\t\togg_int64_t granulePosition = ReadOrDie<ogg_int64_t>(file);\r\n\t\t\t\/\/ Bitstream serial number might be of interest if we wanted to be able to handle Ogg files with\r\n\t\t\t\/\/ multiple logical bitstreams...but we don't care.\r\n\t\t\togg_int32_t bitstreamSerialNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\tif(sampleRate != 0 && bitstreamSerialNumber != savedBitstreamSerialNumber)\r\n\t\t\t{\r\n\t\t\t\tthrow OggVorbisError(\"More than one logical bitstream in the file. Can't handle that currently.\");\r\n\t\t\t}\r\n\t\t\tsavedBitstreamSerialNumber = bitstreamSerialNumber;\r\n\r\n\t\t\togg_int32_t pageSequenceNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\togg_int32_t checksum = ReadOrDie<ogg_int32_t>(file);\r\n\t\t\tunsigned char numSegments = ReadOrDie<unsigned char>(file);\r\n\r\n\t\t\tif(sampleRate == 0)\r\n\t\t\t{\r\n\t\t\t\tvector<unsigned char> segmentSizes = ReadBytesOrDie(file, numSegments);\r\n\t\t\t\togg_uint32_t vorbisHeaderPacketSize = 0;\r\n\t\t\t\tfor(int segIndex = 0; segIndex < numSegments; segIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tvorbisHeaderPacketSize += segmentSizes[segIndex];\r\n\t\t\t\t\tif(segmentSizes[segIndex] < 255)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif(vorbisHeaderPacketSize < 16)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Couldn't read Vorbis header.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tunsigned char packetType = ReadOrDie<unsigned char>(file);\r\n\t\t\t\tif(packetType != 1)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Does not appear to be an Ogg Vorbis file.\");\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tvector<unsigned char> vorbisString = ReadBytesOrDie(file, 6);\r\n\t\t\t\tif(vorbisString[0] != 'v' || vorbisString[1] != 'o' || vorbisString[2] != 'r' \r\n\t\t\t\t|| vorbisString[3] != 'b' || vorbisString[4] != 'i' || vorbisString[5] != 's')\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Does not appear to be an Ogg Vorbis file.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_uint32_t vorbisVersion = ReadOrDie<ogg_uint32_t>(file);\r\n\t\t\t\tif(vorbisVersion != 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"Vorbis version is not 0, don't know how to handle other version.\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\tunsigned char numChannels = ReadOrDie<unsigned char>(file);\r\n\t\t\t\tsampleRate = ReadOrDie<ogg_uint32_t>(file);\r\n\t\t\t\tif(sampleRate == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tthrow OggVorbisError(\"File has a sample rate of 0. O_o\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_int32_t pageDataSize = 0;\r\n\t\t\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tunsigned char segmentSize = segmentSizes[segmentIndex];\r\n\t\t\t\t\tpageDataSize += segmentSize;\r\n\t\t\t\t}\r\n\r\n\t\t\t\togg_int32_t unreadDataBytes = pageDataSize - 16;\r\n\t\t\t\tSeekOrDie(file, unreadDataBytes, Seek_Cur);\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\t\/\/ We're not reading the data portion of the page, so we don't need to know how\r\n\t\t\t\t\/\/ large each segment is, just the total size.\r\n\t\t\t\togg_int32_t pageDataSize = 0;\r\n\t\t\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t\t\t{\r\n\t\t\t\t\tunsigned char segmentSize = ReadOrDie<unsigned char>(file);\r\n\t\t\t\t\tpageDataSize += segmentSize;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t\/\/ Skip the data of the page, we're not interested in it.\r\n\t\t\t\tSeekOrDie(file, pageDataSize, Seek_Cur);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\r\n\t\t\/\/ Converting from seconds to samples might cause the result to be off be 1 if the number of seconds\r\n\t\t\/\/ came from GetRealTime().\r\n\t\togg_int64_t numSamples = (ogg_int64_t)(numSeconds * sampleRate);\r\n\r\n\t\t\/\/ Remember where the granule position field is, we're going to edit it later.\r\n\t\t\/\/ For now, we're reading the entire page so we can calculate what the checksum\r\n\t\t\/\/ should be after we change the granule position field.\r\n\t\tlong granulePositionPosition = TellOrDie(file);\r\n\r\n\t\togg_int64_t granulePosition = ReadOrDie<ogg_int64_t>(file);\r\n\t\tgranulePosition = numSamples; \/\/ Set to what it will be for checksum calculation\r\n\r\n\t\togg_int32_t bitstreamSerialNumber = ReadOrDie<ogg_int32_t>(file);\r\n\t\togg_int32_t pageSequenceNumber = ReadOrDie<ogg_int32_t>(file);\r\n\r\n\t\togg_int32_t checksum = ReadOrDie<ogg_int32_t>(file);\r\n\t\tchecksum = 0; \/\/ Set to 0 for checksum calculation\r\n\r\n\t\tunsigned char numSegments = ReadOrDie<unsigned char>(file);\r\n\r\n\t\tvector<unsigned char> segmentSizes = ReadBytesOrDie(file, numSegments);\r\n\r\n\t\t\/\/ Reconstruct the header (with the new granule position) as a byte vector for checksumming\r\n\t\tvector<unsigned char> headerBytes;\r\n\t\theaderBytes.push_back('O');\r\n\t\theaderBytes.push_back('g');\r\n\t\theaderBytes.push_back('g');\r\n\t\theaderBytes.push_back('S');\r\n\t\theaderBytes.push_back(version);\r\n\t\theaderBytes.push_back(headerType);\r\n\t\tAppendBytes(headerBytes, granulePosition);\r\n\t\tAppendBytes(headerBytes, bitstreamSerialNumber);\r\n\t\tAppendBytes(headerBytes, pageSequenceNumber);\r\n\t\tAppendBytes(headerBytes, checksum);\r\n\t\theaderBytes.push_back(numSegments);\r\n\t\theaderBytes.insert(headerBytes.end(), segmentSizes.begin(), segmentSizes.end());\r\n\r\n\t\t\r\n\t\t\/\/ Calculate the size of the data part of the page\r\n\t\togg_int32_t pageDataSize = 0;\r\n\t\tfor(unsigned char segmentIndex = 0; segmentIndex < numSegments; segmentIndex++)\r\n\t\t{\r\n\t\t\tunsigned char segmentSize = segmentSizes[segmentIndex];\r\n\t\t\tpageDataSize += segmentSize;\r\n\t\t}\r\n\r\n\t\t\/\/ Read the entire data part of the page into a byte vector for checksumming\r\n\t\tvector<unsigned char> dataBytes = ReadBytesOrDie(file, pageDataSize);\r\n\r\n\r\n\t\togg_page page;\r\n\t\tpage.header_len = headerBytes.size();\r\n\t\tpage.header = &(headerBytes[0]);\r\n\t\tpage.body_len = dataBytes.size();\r\n\t\tif(dataBytes.size() > 0)\r\n\t\t{\r\n\t\t\tpage.body = &(dataBytes[0]);\r\n\t\t}\r\n\r\n\t\t\/\/ Let libogg do the tricky CRC stuff\r\n\t\togg_page_checksum_set(&page);\r\n\t\tchecksum = GetFromBytes<ogg_int32_t>(headerBytes, 22);\r\n\r\n\t\t\/\/ Finally, write the updated granule position and checksum. We're not changing the file\r\n\t\t\/\/ size or moving anything around, so we can just edit the file in place.\r\n\t\tSeekOrDie(file, granulePositionPosition, Seek_Set);\r\n\t\tWriteOrDie(file, granulePosition);\r\n\t\tSeekOrDie(file, 8, Seek_Cur);\r\n\t\tWriteOrDie(file, checksum);\r\n\t}\r\n\tcatch(IoError& ex)\r\n\t{\r\n\t\tif(file != NULL)\r\n\t\t{\r\n\t\t\tfclose(file); \/\/ Clean up if something went wrong\r\n\t\t\tthrow OggVorbisError(ex.what());\r\n\t\t}\r\n\t}\r\n\tcatch(OggVorbisError&)\r\n\t{\r\n\t\tif(file != NULL)\r\n\t\t{\r\n\t\t\tfclose(file); \/\/ Clean up if something went wrong\r\n\t\t\tthrow;\r\n\t\t}\r\n\t}\r\n\r\n\tfclose(file); \/\/ Clean up\r\n}\r\n\r\n} \/\/ end namespace ogglength\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Common.hpp\n *\n * Created on: 26 kwi 2014\n * Author: Lech Kulina\n * E-Mail: kulinalech@gmail.com\n *\/\n\n#ifndef COMMON_HPP_\n#define COMMON_HPP_\n\n#include <boost\/utility.hpp>\n#include <boost\/signals2.hpp>\n\n#define COSMIC_UNUSED(x) (void)x\n\nnamespace Cosmic {\n\nnamespace Common {\n\n template<class S>\n class SignalAdapter {\n public:\n typedef S Signal;\n typedef typename Signal::slot_type Slot;\n typedef boost::signals2::connection Connection;\n\n explicit SignalAdapter(Signal& signal);\n\n Connection connect(const Slot& slot);\n void disconnect(const Slot& slot);\n\n private:\n Signal& signal;\n };\n\n template<class S>\n SignalAdapter<S>::SignalAdapter(Signal& signal) :\n signal(signal) {}\n\n template<class S>\n inline typename SignalAdapter<S>::Connection\n SignalAdapter<S>::connect(const typename SignalAdapter<S>::Slot& slot) {\n return signal.connect(slot);\n }\n\n template<class S>\n inline void SignalAdapter<S>::disconnect(const Slot& slot) {\n signal.disconnect(slot);\n }\n}\n\n}\n\n#endif \/* COMMON_HPP_ *\/\n<commit_msg>Disable signal adapters copy ctor and assign op<commit_after>\/*\n * Common.hpp\n *\n * Created on: 26 kwi 2014\n * Author: Lech Kulina\n * E-Mail: kulinalech@gmail.com\n *\/\n\n#ifndef COMMON_HPP_\n#define COMMON_HPP_\n\n#include <boost\/utility.hpp>\n#include <boost\/signals2.hpp>\n\n#define COSMIC_UNUSED(x) (void)x\n\nnamespace Cosmic {\n\nnamespace Common {\n\n template<class S>\n class SignalAdapter {\n public:\n typedef S Signal;\n typedef typename Signal::slot_type Slot;\n typedef boost::signals2::connection Connection;\n\n explicit SignalAdapter(Signal& signal);\n SignalAdapter(const SignalAdapter&) = delete;\n SignalAdapter& operator=(const SignalAdapter&) = delete;\n\n Connection connect(const Slot& slot);\n void disconnect(const Slot& slot);\n\n private:\n Signal& signal;\n };\n\n template<class S>\n SignalAdapter<S>::SignalAdapter(Signal& signal) :\n signal(signal) {}\n\n template<class S>\n inline typename SignalAdapter<S>::Connection\n SignalAdapter<S>::connect(const typename SignalAdapter<S>::Slot& slot) {\n return signal.connect(slot);\n }\n\n template<class S>\n inline void SignalAdapter<S>::disconnect(const Slot& slot) {\n signal.disconnect(slot);\n }\n}\n\n}\n\n#endif \/* COMMON_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"sqltenging.h\"\n\nsqltenging::sqltenging()\n{\n _db = QSqlDatabase::addDatabase(\"QSQLITE\");\n QString dbName = \"vln1.sqlite\";\n _db.setDatabaseName(dbName);\n _db.open();\n}\n\/\/ VELAR\nvector<velar> sqltenging::lesaVelar()\n{\n string sql = \"SELECT * FROM TolvuVelar\";\n\n return selectVelar(sql);\n}\n\nvoid sqltenging::baetaVidVel(string nafn, int bAr, bool byggd, string tegund)\n{\n string sql = \"INSERT INTO TolvuVelar(Nafn, Byggingarar, Byggd, Tegund)\"\n \"VALUES('\" + nafn + \"',\" + to_string(bAr) + \",\" + to_string(byggd) + \",'\" + tegund + \"')\";\n udiSkipun(sql);\n}\n\nvoid sqltenging::eydaVel(int id)\n{\n\n string sql = \"DELETE FROM TolvuVelar WHERE ID = \" + to_string(id);\n udiSkipun(sql);\n}\n\nvoid sqltenging::uppfaeraVel(int id, string nafn, int bAr, bool byggd, string tegund)\n{\n string sql = \"UPDATE TolvuVelar \"\n \"SET nafn = '\" + nafn + \"'\"\n \", byggingarar = \" + to_string(bAr) +\n \", byggd = \" + to_string(byggd) +\n \", tegund = '\" + tegund + \"'\"\n \"WHERE ID = \" + to_string(id);\n\n udiSkipun(sql);\n}\n\nvoid sqltenging::tortimaVelum()\n{\n string terminator = \"DELETE FROM TolvuVelar\";\n udiSkipun(terminator);\n}\n\n\n\n\n\/\/ FOLK\nvector<tolvufolk> sqltenging::lesaFolk() const\n{\n string sql = \"SELECT * FROM TolvuFolk\";\n\n return selectFolk(sql);\n}\n\nvoid sqltenging::baetaVidFolk(string fNafn, string eNafn, char kyn, int fAr, int dAr)\n{\n string sql = \"INSERT INTO TolvuFolk(ForNafn, EftirNafn, Kyn, FaedingarAr, DanarAr)\"\n \"VALUES('\" + fNafn + \"','\" + eNafn + \"','\" + kyn + \"',\" + to_string(fAr) + \",\" + to_string(dAr) + \")\";\n udiSkipun(sql);\n}\nvoid sqltenging::eydaFolk(int id)\n{\n\n string sql = \"DELETE FROM TolvuFolk WHERE ID = \" + to_string(id);\n udiSkipun(sql);\n}\n\nvoid sqltenging::uppfaeraFolk(int id, string fNafn, string eNafn, char kyn, int fAr, int dAr)\n{\n string sql = \"UPDATE TolvuFolk \"\n \"SET fornafn = '\" + fNafn + \"'\"\n \", eftirnafn = '\" + eNafn + \"'\"\n \", kyn = '\" + kyn + \"'\"\n \", faedingarAr = \" + to_string(fAr) +\n \", danarAr = \" + to_string(dAr) + \" \"\n \"WHERE ID = \" + to_string(id);\n\n udiSkipun(sql);\n}\n\nvoid sqltenging::tortimaFolki()\n{\n string terminator = \"DELETE FROM tolvufolk\";\n udiSkipun(terminator);\n}\n\n\/\/Vensl\n\nvector<velar> sqltenging::venslNafn(int id, string nafn)\n{\n string sql = \"SELECT f.fornafn, f.eftirnafn t.nafn FROM TolvuFolk f\"\n \"INNER JOIN VenslFolkVelar v ON v.folk_id = f.id\"\n \"INNER JOIN tolvuvelar t ON v.vel_id = t.id\"\n \"WHERE ID = '\" + nafn \"'.\" + to_string(id);\n\n\n return selectVelar(sql);\n}\n\n\n\n\n\/\/ Private Functions\nvector<tolvufolk> sqltenging::selectFolk(string sql) const\n{\n vector<tolvufolk> t;\n QSqlQuery query(_db);\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n query.exec(cstr);\n\n while(query.next())\n {\n int id = query.value(\"id\").toUInt();\n string fornafn = query.value(\"fornafn\").toString().toStdString();\n string eftirnafn = query.value(\"eftirnafn\").toString().toStdString();\n char kyn = query.value(\"kyn\").toString().toStdString()[0];\n int faedingarar = query.value(\"faedingarar\").toUInt();\n int danarar = query.value(\"danarar\").toUInt();\n\n t.push_back(tolvufolk(id, fornafn, eftirnafn, kyn, faedingarar, danarar));\n }\n\n return t;\n}\n\nvector<velar> sqltenging::selectVelar(string sql) const\n{\n vector<velar> v;\n QSqlQuery query(_db);\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n query.exec(cstr);\n\n while(query.next())\n {\n int id = query.value(\"id\").toUInt();\n string nafn = query.value(\"Nafn\").toString().toStdString();\n int ar = query.value(\"byggingarar\").toUInt();\n bool byggd = query.value(\"byggd\").toBool();\n string tegund = query.value(\"tegund\").toString().toStdString();\n\n v.push_back(velar(id, nafn, ar, tegund, byggd));\n }\n\n return v;\n}\n\nvoid sqltenging::udiSkipun(string sql)\n{\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n QSqlQuery query(_db);\n query.exec(cstr);\n delete[] cstr;\n}\n\/\/ End of private functions\n<commit_msg>conflict fix<commit_after>#include \"sqltenging.h\"\n\nsqltenging::sqltenging()\n{\n _db = QSqlDatabase::addDatabase(\"QSQLITE\");\n QString dbName = \"vln1.sqlite\";\n _db.setDatabaseName(dbName);\n _db.open();\n}\n\/\/ VELAR\nvector<velar> sqltenging::lesaVelar()\n{\n string sql = \"SELECT * FROM TolvuVelar\";\n\n return selectVelar(sql);\n}\n\nvoid sqltenging::baetaVidVel(string nafn, int bAr, bool byggd, string tegund)\n{\n string sql = \"INSERT INTO TolvuVelar(Nafn, Byggingarar, Byggd, Tegund)\"\n \"VALUES('\" + nafn + \"',\" + to_string(bAr) + \",\" + to_string(byggd) + \",'\" + tegund + \"')\";\n udiSkipun(sql);\n}\n\nvoid sqltenging::eydaVel(int id)\n{\n\n string sql = \"DELETE FROM TolvuVelar WHERE ID = \" + to_string(id);\n udiSkipun(sql);\n}\n\nvoid sqltenging::uppfaeraVel(int id, string nafn, int bAr, bool byggd, string tegund)\n{\n string sql = \"UPDATE TolvuVelar \"\n \"SET nafn = '\" + nafn + \"'\"\n \", byggingarar = \" + to_string(bAr) +\n \", byggd = \" + to_string(byggd) +\n \", tegund = '\" + tegund + \"'\"\n \"WHERE ID = \" + to_string(id);\n\n udiSkipun(sql);\n}\n\nvoid sqltenging::tortimaVelum()\n{\n string terminator = \"DELETE FROM TolvuVelar\";\n udiSkipun(terminator);\n}\n\n\n\n\n\/\/ FOLK\nvector<tolvufolk> sqltenging::lesaFolk() const\n{\n string sql = \"SELECT * FROM TolvuFolk\";\n\n return selectFolk(sql);\n}\n\nvoid sqltenging::baetaVidFolk(string fNafn, string eNafn, char kyn, int fAr, int dAr)\n{\n string sql = \"INSERT INTO TolvuFolk(ForNafn, EftirNafn, Kyn, FaedingarAr, DanarAr)\"\n \"VALUES('\" + fNafn + \"','\" + eNafn + \"','\" + kyn + \"',\" + to_string(fAr) + \",\" + to_string(dAr) + \")\";\n udiSkipun(sql);\n}\nvoid sqltenging::eydaFolk(int id)\n{\n\n string sql = \"DELETE FROM TolvuFolk WHERE ID = \" + to_string(id);\n udiSkipun(sql);\n}\n\nvoid sqltenging::uppfaeraFolk(int id, string fNafn, string eNafn, char kyn, int fAr, int dAr)\n{\n string sql = \"UPDATE TolvuFolk \"\n \"SET fornafn = '\" + fNafn + \"'\"\n \", eftirnafn = '\" + eNafn + \"'\"\n \", kyn = '\" + kyn + \"'\"\n \", faedingarAr = \" + to_string(fAr) +\n \", danarAr = \" + to_string(dAr) + \" \"\n \"WHERE ID = \" + to_string(id);\n\n udiSkipun(sql);\n}\n\nvoid sqltenging::tortimaFolki()\n{\n string terminator = \"DELETE FROM tolvufolk\";\n udiSkipun(terminator);\n}\n\n\/\/Vensl\n\n\n\n\n\n\/\/ Private Functions\nvector<tolvufolk> sqltenging::selectFolk(string sql) const\n{\n vector<tolvufolk> t;\n QSqlQuery query(_db);\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n query.exec(cstr);\n\n while(query.next())\n {\n int id = query.value(\"id\").toUInt();\n string fornafn = query.value(\"fornafn\").toString().toStdString();\n string eftirnafn = query.value(\"eftirnafn\").toString().toStdString();\n char kyn = query.value(\"kyn\").toString().toStdString()[0];\n int faedingarar = query.value(\"faedingarar\").toUInt();\n int danarar = query.value(\"danarar\").toUInt();\n\n t.push_back(tolvufolk(id, fornafn, eftirnafn, kyn, faedingarar, danarar));\n }\n\n return t;\n}\n\nvector<velar> sqltenging::selectVelar(string sql) const\n{\n vector<velar> v;\n QSqlQuery query(_db);\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n query.exec(cstr);\n\n while(query.next())\n {\n int id = query.value(\"id\").toUInt();\n string nafn = query.value(\"Nafn\").toString().toStdString();\n int ar = query.value(\"byggingarar\").toUInt();\n bool byggd = query.value(\"byggd\").toBool();\n string tegund = query.value(\"tegund\").toString().toStdString();\n\n v.push_back(velar(id, nafn, ar, tegund, byggd));\n }\n\n return v;\n}\n\nvoid sqltenging::udiSkipun(string sql)\n{\n char* cstr = new char[sql.length()+1];\n strcpy(cstr, sql.c_str());\n QSqlQuery query(_db);\n query.exec(cstr);\n delete[] cstr;\n}\n\/\/ End of private functions\n<|endoftext|>"} {"text":"<commit_before>\/*\n * CommHandler.cpp\n *\n * Objectified access to the subscribe ports of the main control thread which other units may use to access messages.\n *\n * Created on: Jan 10, 2013\n * Author: maestro\n *\/\n\n#include <iostream>\n#include \"CommHandler.h\"\n\nusing namespace std;\n\n\tCommHandler::CommHandler (InputPort<hubomsg::CanMessage>* port1,\n\t\t\tInputPort<hubomsg::HuboCmd>* port2,\n\t\t\tInputPort<hubomsg::HuboState>* port3){\n\t\tcanPort = port1;\n\t\torPort = port2;\n\t\tachPort = port3;\n\n\t\tnewCanData = false;\n\t\tnewAchData = false;\n\t}\n\n\tvoid CommHandler::update(){\n\t\thubomsg::HuboCmd huboCmd = hubomsg::HuboCmd();\n\t\thubomsg::CanMessage canMessage = hubomsg::CanMessage();\n\n\t\tif (NewData == this->canPort->read(canMessage)){\n\t\t\t\/\/Received update from CanGateway\n\t\t\tthis->newCanData = true;\n\t\t\tthis->currMessage = canMessage;\n\n\t\t}\n\t\tif (NewData == this->orPort->read(huboCmd)){\n\t\t\tthis->newORData = true;\n\t\t\tthis->currCmd = huboCmd;\n\t\t}\n\t\tif (NewData == this->achPort->read(achState)){\n\t\t\tthis->newAchData = true;\n\t\t\tthis->currState = achState;\n\t\t}\n\t}\n\n\thubomsg::CanMessage CommHandler::getMessage(){\n\t\tnewCanData = false;\n\t\treturn currMessage;\n\t}\n\n\thubomsg::HuboCmd CommHandler::getCmd(){\n\t\tnewORData = false;\n\t\treturn currCmd;\n\t}\n\n\thubomsg::HuboState CommHandler::getState(){\n\t\tnewAchData = false;\n\t\treturn currState;\n\t}\n\n\tbool CommHandler::isNew(int port){\n\t\tswitch (port){\n\t\tcase 1:\n\t\t\treturn newCanData;\n\t\tcase 2:\n\t\t\treturn newORData;\n\t\tcase 3:\n\t\t\treturn newAchData;\n\t\t}\n\t\treturn false;\n\t}\n\n<commit_msg>Added in variable declaration.<commit_after>\/*\n * CommHandler.cpp\n *\n * Objectified access to the subscribe ports of the main control thread which other units may use to access messages.\n *\n * Created on: Jan 10, 2013\n * Author: maestro\n *\/\n\n#include <iostream>\n#include \"CommHandler.h\"\n\nusing namespace std;\n\n\tCommHandler::CommHandler (InputPort<hubomsg::CanMessage>* port1,\n\t\t\tInputPort<hubomsg::HuboCmd>* port2,\n\t\t\tInputPort<hubomsg::HuboState>* port3){\n\t\tcanPort = port1;\n\t\torPort = port2;\n\t\tachPort = port3;\n\n\t\tnewCanData = false;\n\t\tnewAchData = false;\n\t}\n\n\tvoid CommHandler::update(){\n\t\thubomsg::HuboCmd huboCmd = hubomsg::HuboCmd();\n\t\thubomsg::CanMessage canMessage = hubomsg::CanMessage();\n\t\thubomsg::HuboState achState = hubomsg::HuboState();\n\n\t\tif (NewData == this->canPort->read(canMessage)){\n\t\t\t\/\/Received update from CanGateway\n\t\t\tthis->newCanData = true;\n\t\t\tthis->currMessage = canMessage;\n\n\t\t}\n\t\tif (NewData == this->orPort->read(huboCmd)){\n\t\t\tthis->newORData = true;\n\t\t\tthis->currCmd = huboCmd;\n\t\t}\n\t\tif (NewData == this->achPort->read(achState)){\n\t\t\tthis->newAchData = true;\n\t\t\tthis->currState = achState;\n\t\t}\n\t}\n\n\thubomsg::CanMessage CommHandler::getMessage(){\n\t\tnewCanData = false;\n\t\treturn currMessage;\n\t}\n\n\thubomsg::HuboCmd CommHandler::getCmd(){\n\t\tnewORData = false;\n\t\treturn currCmd;\n\t}\n\n\thubomsg::HuboState CommHandler::getState(){\n\t\tnewAchData = false;\n\t\treturn currState;\n\t}\n\n\tbool CommHandler::isNew(int port){\n\t\tswitch (port){\n\t\tcase 1:\n\t\t\treturn newCanData;\n\t\tcase 2:\n\t\t\treturn newORData;\n\t\tcase 3:\n\t\t\treturn newAchData;\n\t\t}\n\t\treturn false;\n\t}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n#include <structmember.h>\n\n\/* Wrapper classes for internal objects are defined in python. They must have __slots__ defined.\n * A slot can be accessed in O(1) once detect_class(...) and slot_offset(...) is called.\n *\/\n\n#define SLOT(obj, type, offset) (*(type **)((char *)obj + offset))\n\n\/* Shortcuts *\/\n\n#define NEW_REF(obj) (Py_INCREF(obj), obj)\n\n\/* Classes defined in python must be instantiated using new_object(...)\n * The allocated memory is initialized to zero.\n * Slots can be set using the SLOT(...) macro.\n *\/\ninline PyObject * _new_object(PyTypeObject * type) {\n PyObject * res = 0;\n Py_INCREF(type);\n if (type->tp_flags & Py_TPFLAGS_HAVE_GC) {\n res = PyObject_GC_New(PyObject, type);\n } else {\n res = PyObject_New(PyObject, type);\n }\n \/\/ PyObject_GC_Track(wrapper);\n memset((char *)res + sizeof(PyObject), 0, type->tp_basicsize - sizeof(PyObject));\n return res;\n}\n\n#define new_object(type, typeobj) (type *)_new_object(typeobj)\n#define call_function(function, ...) PyObject_CallFunctionObjArgs(function, __VA_ARGS__, (void *)0)\n\ninline void replace_object(PyObject *& src, PyObject * dst) {\n Py_INCREF(dst);\n Py_DECREF(src);\n src = dst;\n}\n<commit_msg>fix memset<commit_after>#pragma once\n#define PY_SSIZE_T_CLEAN\n#include <Python.h>\n#include <structmember.h>\n\n\/* Wrapper classes for internal objects are defined in python. They must have __slots__ defined.\n * A slot can be accessed in O(1) once detect_class(...) and slot_offset(...) is called.\n *\/\n\n#define SLOT(obj, type, offset) (*(type **)((char *)obj + offset))\n\n\/* Shortcuts *\/\n\n#define NEW_REF(obj) (Py_INCREF(obj), obj)\n\n\/* Classes defined in python must be instantiated using new_object(...)\n * The allocated memory is initialized to zero.\n * Slots can be set using the SLOT(...) macro.\n *\/\ninline PyObject * _new_object(PyTypeObject * type, int size) {\n PyObject * res = 0;\n Py_INCREF(type);\n if (type->tp_flags & Py_TPFLAGS_HAVE_GC) {\n res = PyObject_GC_New(PyObject, type);\n } else {\n res = PyObject_New(PyObject, type);\n }\n \/\/ PyObject_GC_Track(wrapper);\n memset((char *)res + sizeof(PyObject), 0, size - sizeof(PyObject));\n return res;\n}\n\n#define new_object(type, typeobj) (type *)_new_object(typeobj, sizeof(type))\n#define call_function(function, ...) PyObject_CallFunctionObjArgs(function, __VA_ARGS__, (void *)0)\n\ninline void replace_object(PyObject *& src, PyObject * dst) {\n Py_INCREF(dst);\n Py_DECREF(src);\n src = dst;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/\t@file\thttp_protocol_module_base.cpp\n\/\/\t@brief\tshared object http protocol module absctract class\n\/\/\n\/\/\tDistributed under the Boost Software License, Version 1.0.(See accompanying\n\/\/\tfile LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt\n\/\/\n#include <boost\/xpressive\/xpressive.hpp>\n\n#include \"http_protocol_module_base.h\"\n\nusing namespace boost::xpressive;\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_http_method(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tmethod_regex\n\t\t= (\tas_xpr(\"GET\")\t\t| as_xpr(\"HEAD\")\t\t| as_xpr(\"POST\")\t\t|\n\t\t\tas_xpr(\"PUT\")\t\t| as_xpr(\"PROPFIND\")\t| as_xpr(\"PROPPATCH\")\t|\n\t\t\tas_xpr(\"OPTIONS\")\t| as_xpr(\"CONNECT\")\t\t| as_xpr(\"COPY\")\t\t|\n\t\t\tas_xpr(\"TRACE\")\t\t| as_xpr(\"DELETE\")\t\t| as_xpr(\"LOCK\")\t\t|\n\t\t\tas_xpr(\"UNLOCK\")\t| as_xpr(\"MOVE\")\t\t| as_xpr(\"MKCOL\")) >> _s >>\n\t\t\t+~_s >> _s >>\n\t\t\t\"HTTP\/\" >> _d >> \".\" >> _d;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, method_regex )){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_http_version(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tversion_regex_request\n\t\t=\t+alpha >> _s >>\n\t\t\t+~_s >> _s >>\n\t\t\t\"HTTP\/\" >> (as_xpr(\"1.0\")|as_xpr(\"1.1\"));\n\n\tcregex\tversion_regex_response\n\t\t=\t\"HTTP\/\" >> (as_xpr(\"1.0\")|as_xpr(\"1.1\")) >> _s >>\n\t\t\trepeat<3>(_d) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, version_regex_request ) &&\n\t\t\t\t\t!regex_match( check_string, version_regex_response ) ){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_status_code(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tstatus_code_regex\n \t\t=\t\"HTTP\/\" >> _d >> \".\" >> _d >> _s >>\n\t\t\trange('1', '3') >> repeat<2>(_d) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, status_code_regex )){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_uri(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& uri_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& uri_len){\n\n\tbool\tfind_result\t= true;\n\n\tchar*\tfind_string\t= NULL;\n\tsize_t\tline_length\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\turi_regex\n\t\t=\t+alpha >> _s >>\n\t\t\t(s1 = +~_s) >> _s >>\n\t\t\t\"HTTP\/\" >> _d >> \".\" >> _d;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tfind_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer, line_length );\n\t\n\t\t\t\tfind_string[line_length] = '\\0';\n\t\n\t\t\t\tfind_result = regex_search( find_string, result, uri_regex );\n\t\n\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\turi_offset\t= result.position(1);\n\t\n\t\t\t\t\turi_len\t\t= result.length(1);\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result = false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result = false;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tfind_result = false;\n\n\t}\n\n\treturn find_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_status_code(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& status_code_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& status_code_len){\n\n\tbool\tfind_result\t= true;\n\n\tchar*\tfind_string\t= NULL;\n\tsize_t\tline_length\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\tstatus_code_regex\n\t\t=\t\"HTTP\/\" >> _d >> \".\" >> _d >> _s >>\n\t\t\t(s1 = repeat<3>(_d)) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tfind_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer, line_length );\n\t\n\t\t\t\tfind_string[line_length] = '\\0';\n\t\n\t\t\t\tfind_result = regex_search( find_string, result, status_code_regex );\n\t\n\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\tstatus_code_offset\t= result.position(1);\n\t\n\t\t\t\t\tstatus_code_len\t\t= result.length(1);\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result = false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result = false;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tfind_result = false;\n\n\t}\n\n\treturn find_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_http_header(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst std::string& http_header_name,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& http_header_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& http_header_len ){\n\n\tbool\tfind_result\t\t\t= true;\n\n\tchar*\tfind_string\t\t\t= NULL;\n\tsize_t\tcount\t\t\t\t= 0;\n\tsize_t\theader_begin\t\t= 0;\n\tsize_t\theader_end\t\t\t= 0;\n\tsize_t\theader_length\t\t= 0;\n\n\tint\t\theader_begin_flag\t= 0;\n\tint\t\theader_end_flag\t\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\thttp_header_regex;\n\n\tif( buffer != NULL ){\n\n\t\tfor( count = 0; count < buffer_len; count++ ){\n\n\t\t\tif( buffer[count] == '\\r' || buffer[count] == '\\n' ){\n\n\t\t\t\tif( header_begin_flag == 0 ){\n\n\t\t\t\t\theader_begin = count;\n\t\t\t\t\theader_begin_flag = 1;\n\n\t\t\t\t}\n\n\t\t\t\tif( count > 0 ){\n\n\t\t\t\t\tif(\t( buffer[count-1] == '\\r' && buffer[count] == '\\r' ) ||\n\t\t\t\t\t\t( buffer[count-1] == '\\n' && buffer[count] == '\\n' )\t){\n\n\t\t\t\t\t\theader_end = count;\n\t\t\t\t\t\theader_end_flag = 1;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif( count > 2 ){\n\n\t\t\t\t\tif(\tbuffer[count-3] == '\\r' && buffer[count-2] == '\\n' &&\n\t\t\t\t\t\tbuffer[count-1] == '\\r' && buffer[count] == '\\n'\t){\n\n\t\t\t\t\t\theader_end = count;\n\t\t\t\t\t\theader_end_flag = 1;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif( header_begin_flag == 1 && header_end_flag == 1 ){\n\n\t\t\theader_length = header_end - header_begin + 1;\n\n\t\t\tfind_string = (char*)malloc( header_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer + header_begin, header_length );\n\t\n\t\t\t\tfind_string[header_length] = '\\0';\n\t\n\t\t\t\tif( http_header_name.length() > 0 ){\n\t\n\t\t\t\t\thttp_header_regex = _ln >> (s1 = http_header_name >> _ >> _s >> *~_ln);\n\t\n\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\thttp_header_len\t\t= result.length(1);\n\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\n\t\t\t\t\thttp_header_regex = _ln >> (s1 = *_ >> ~_ln) >> repeat<2>(_ln);\n\t\n\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\thttp_header_len\t\t= result.length(1);\n\t\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\n\t\t\t\t\t\thttp_header_regex = _ln >> (s1 = _ln);\n\t\n\t\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\t\thttp_header_len\t\t= 0;\n\t\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result\t= false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result\t= false;\n\n\t\t}\n\t}\n\telse{\n\n\t\tfind_result\t= false;\n\n\t}\n\n\treturn find_result;\n\n}\n<commit_msg>大文字小文字検索追加<commit_after>\/\/\n\/\/\t@file\thttp_protocol_module_base.cpp\n\/\/\t@brief\tshared object http protocol module absctract class\n\/\/\n\/\/\tDistributed under the Boost Software License, Version 1.0.(See accompanying\n\/\/\tfile LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt\n\/\/\n#include <boost\/xpressive\/xpressive.hpp>\n\n#include \"http_protocol_module_base.h\"\n\nusing namespace boost::xpressive;\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_http_method(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tmethod_regex\n\t\t= (\tas_xpr(\"GET\")\t\t| as_xpr(\"HEAD\")\t\t| as_xpr(\"POST\")\t\t|\n\t\t\tas_xpr(\"PUT\")\t\t| as_xpr(\"PROPFIND\")\t| as_xpr(\"PROPPATCH\")\t|\n\t\t\tas_xpr(\"OPTIONS\")\t| as_xpr(\"CONNECT\")\t\t| as_xpr(\"COPY\")\t\t|\n\t\t\tas_xpr(\"TRACE\")\t\t| as_xpr(\"DELETE\")\t\t| as_xpr(\"LOCK\")\t\t|\n\t\t\tas_xpr(\"UNLOCK\")\t| as_xpr(\"MOVE\")\t\t| as_xpr(\"MKCOL\")) >> _s >>\n\t\t\t+~_s >> _s >>\n\t\t\t\"HTTP\/\" >> _d >> \".\" >> _d;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, method_regex )){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_http_version(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tversion_regex_request\n\t\t=\t+alpha >> _s >>\n\t\t\t+~_s >> _s >>\n\t\t\t\"HTTP\/\" >> (as_xpr(\"1.0\")|as_xpr(\"1.1\"));\n\n\tcregex\tversion_regex_response\n\t\t=\t\"HTTP\/\" >> (as_xpr(\"1.0\")|as_xpr(\"1.1\")) >> _s >>\n\t\t\trepeat<3>(_d) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, version_regex_request ) &&\n\t\t\t\t\t!regex_match( check_string, version_regex_response ) ){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\n\nl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tl7vs::http_protocol_module_base::check_status_code(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len ) const {\n\n\tl7vs::http_protocol_module_base::CHECK_RESULT_TAG\tcheck_result = CHECK_OK;\n\n\tchar*\tcheck_string\t= NULL;\n\tsize_t\tline_length\t\t= 0;\n\n\tcregex\tstatus_code_regex\n \t\t=\t\"HTTP\/\" >> _d >> \".\" >> _d >> _s >>\n\t\t\trange('1', '3') >> repeat<2>(_d) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tcheck_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( check_string != NULL ){\n\n\t\t\t\tmemcpy( check_string, buffer, line_length );\n\t\n\t\t\t\tcheck_string[line_length] = '\\0';\n\t\n\t\t\t\tif( !regex_match( check_string, status_code_regex )){\n\t\n\t\t\t\t\tcheck_result = CHECK_NG;\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( check_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tcheck_result = CHECK_NG;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tcheck_result = CHECK_INPOSSIBLE;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tcheck_result = CHECK_NG;\n\n\t}\n\n\treturn check_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_uri(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& uri_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& uri_len){\n\n\tbool\tfind_result\t= true;\n\n\tchar*\tfind_string\t= NULL;\n\tsize_t\tline_length\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\turi_regex\n\t\t=\t+alpha >> _s >>\n\t\t\t(s1 = +~_s) >> _s >>\n\t\t\t\"HTTP\/\" >> _d >> \".\" >> _d;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tfind_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer, line_length );\n\t\n\t\t\t\tfind_string[line_length] = '\\0';\n\t\n\t\t\t\tfind_result = regex_search( find_string, result, uri_regex );\n\t\n\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\turi_offset\t= result.position(1);\n\t\n\t\t\t\t\turi_len\t\t= result.length(1);\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result = false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result = false;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tfind_result = false;\n\n\t}\n\n\treturn find_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_status_code(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& status_code_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& status_code_len){\n\n\tbool\tfind_result\t= true;\n\n\tchar*\tfind_string\t= NULL;\n\tsize_t\tline_length\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\tstatus_code_regex\n\t\t=\t\"HTTP\/\" >> _d >> \".\" >> _d >> _s >>\n\t\t\t(s1 = repeat<3>(_d)) >> _s >>\n\t\t\t*_;\n\n\tif( buffer != NULL ){\n\n\t\tfor( line_length = 0; line_length < buffer_len; line_length++ ){\n\n\t\t\tif( buffer[line_length] == '\\r' || buffer[line_length] == '\\n' ){\n\n\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif( line_length < buffer_len ){\n\n\t\t\tfind_string = (char*)malloc( line_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer, line_length );\n\t\n\t\t\t\tfind_string[line_length] = '\\0';\n\t\n\t\t\t\tfind_result = regex_search( find_string, result, status_code_regex );\n\t\n\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\tstatus_code_offset\t= result.position(1);\n\t\n\t\t\t\t\tstatus_code_len\t\t= result.length(1);\n\t\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result = false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result = false;\n\n\t\t}\n\n\t}\n\telse{\n\n\t\tfind_result = false;\n\n\t}\n\n\treturn find_result;\n\n}\n\n\nbool\tl7vs::http_protocol_module_base::find_http_header(\tconst char* buffer,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst size_t buffer_len,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tconst std::string& http_header_name,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& http_header_offset,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsize_t& http_header_len ){\n\n\tbool\tfind_result\t\t\t= true;\n\n\tchar*\tfind_string\t\t\t= NULL;\n\tsize_t\tcount\t\t\t\t= 0;\n\tsize_t\theader_begin\t\t= 0;\n\tsize_t\theader_end\t\t\t= 0;\n\tsize_t\theader_length\t\t= 0;\n\n\tint\t\theader_begin_flag\t= 0;\n\tint\t\theader_end_flag\t\t= 0;\n\n\tmatch_results< const char* >\tresult;\n\n\tcregex\thttp_header_regex;\n\n\tif( buffer != NULL ){\n\n\t\tfor( count = 0; count < buffer_len; count++ ){\n\n\t\t\tif( buffer[count] == '\\r' || buffer[count] == '\\n' ){\n\n\t\t\t\tif( header_begin_flag == 0 ){\n\n\t\t\t\t\theader_begin = count;\n\t\t\t\t\theader_begin_flag = 1;\n\n\t\t\t\t}\n\n\t\t\t\tif( count > 0 ){\n\n\t\t\t\t\tif(\t( buffer[count-1] == '\\r' && buffer[count] == '\\r' ) ||\n\t\t\t\t\t\t( buffer[count-1] == '\\n' && buffer[count] == '\\n' )\t){\n\n\t\t\t\t\t\theader_end = count;\n\t\t\t\t\t\theader_end_flag = 1;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif( count > 2 ){\n\n\t\t\t\t\tif(\tbuffer[count-3] == '\\r' && buffer[count-2] == '\\n' &&\n\t\t\t\t\t\tbuffer[count-1] == '\\r' && buffer[count] == '\\n'\t){\n\n\t\t\t\t\t\theader_end = count;\n\t\t\t\t\t\theader_end_flag = 1;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif( header_begin_flag == 1 && header_end_flag == 1 ){\n\n\t\t\theader_length = header_end - header_begin + 1;\n\n\t\t\tfind_string = (char*)malloc( header_length + 1 );\n\n\t\t\tif( find_string != NULL ){\n\n\t\t\t\tmemcpy( find_string, buffer + header_begin, header_length );\n\t\n\t\t\t\tfind_string[header_length] = '\\0';\n\t\n\t\t\t\tif( http_header_name.length() > 0 ){\n\t\n\t\t\t\t\thttp_header_regex = _ln >> (s1 = icase(http_header_name) >> \":\" >> *~_ln);\n\t\n\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\thttp_header_len\t\t= result.length(1);\n\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\n\t\t\t\t\thttp_header_regex = _ln >> (s1 = *_ >> ~_ln) >> repeat<2>(_ln);\n\t\n\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\thttp_header_len\t\t= result.length(1);\n\t\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\n\t\t\t\t\t\thttp_header_regex = _ln >> (s1 = _ln);\n\t\n\t\t\t\t\t\tfind_result = regex_search( find_string, result, http_header_regex );\n\t\n\t\t\t\t\t\tif( find_result == true ){\n\t\n\t\t\t\t\t\t\thttp_header_offset\t= result.position(1) + header_begin;\n\t\t\t\t\t\t\thttp_header_len\t\t= 0;\n\t\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\t\tfree( find_string );\n\n\t\t\t}\n\t\t\telse{\n\n\t\t\t\tfind_result\t= false;\n\n\t\t\t}\n\n\t\t}\n\t\telse{\n\n\t\t\tfind_result\t= false;\n\n\t\t}\n\t}\n\telse{\n\n\t\tfind_result\t= false;\n\n\t}\n\n\treturn find_result;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @copyright Copyright 2016 The J-PET Framework Authors. All rights reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may find a copy of the License in the LICENCE file.\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @file JPetTaskIO.cpp\n *\/\n\n#include \"JPetTaskIO.h\"\n#include <cassert>\n#include \"..\/JPetReader\/JPetReader.h\"\n#include \"..\/JPetTreeHeader\/JPetTreeHeader.h\"\n#include \"..\/JPetTask\/JPetTask.h\"\n#include \"..\/JPetHLDReader\/JPetHLDReader.h\"\n#include \"..\/CommonTools\/CommonTools.h\"\n\n#include \"..\/JPetLoggerInclude.h\"\n\n\nJPetTaskIO::JPetTaskIO():\n fTask(0),\n fEventNb(-1),\n fWriter(0),\n fReader(0),\n fHeader(0),\n fStatistics(0),\n fParamManager(0)\n{\n}\n\nvoid JPetTaskIO::init(const JPetOptions::Options& opts)\n{\n setOptions(JPetOptions(opts));\n auto inputFilename = fOptions.getInputFile();\n auto outputFilename = fOptions.getOutputFile();\n createInputObjects(inputFilename);\n createOutputObjects(outputFilename);\n}\n\n\nvoid JPetTaskIO::exec()\n{\n assert(fTask);\n assert(fReader);\n assert(fParamManager);\n fTask->setParamManager(fParamManager);\n JPetTaskInterface::Options emptyOpts;\n fTask->init(emptyOpts); \/\/prepare current task for file\n auto totalEvents = 0ll;\n if (fReader) {\n totalEvents = fReader->getNbOfAllEvents();\n } else {\n WARNING(\"no JPETReader set totalEvents set to -1\");\n totalEvents - 1;\n }\n auto firstEvent = 0ll;\n auto lastEvent = 0ll;\n setUserLimits(fOptions, totalEvents, firstEvent, lastEvent);\n assert(lastEvent >= 0);\n for (auto i = firstEvent; i <= lastEvent; i++) {\n fTask->setEvent(&(static_cast<TNamed&>(fReader->getCurrentEvent())));\n if (fOptions.isProgressBar()) {\n manageProgressBar(i, lastEvent);\n }\n fTask->exec();\n fReader->nextEvent();\n }\n fTask->terminate();\n}\n\nvoid JPetTaskIO::terminate()\n{\n assert(fReader);\n assert(fWriter);\n assert(fHeader);\n assert(fStatistics);\n\n fWriter->writeHeader(fHeader);\n\n fWriter->writeObject(fStatistics->getHistogramsTable(), \"Stats\");\n\n \/\/ store the parametric objects in the ouptut ROOT file\n getParamManager().saveParametersToFile(\n fWriter);\n getParamManager().clearParameters();\n\n fWriter->closeFile();\n fReader->closeFile();\n\n}\nvoid JPetTaskIO::addSubTask(JPetTaskInterface* subtask) {\n\tfTask = dynamic_cast<JPetTask*>(subtask);\n}\nJPetTask* JPetTaskIO::getSubTask() const {\n\treturn fTask;\n}\n\nvoid JPetTaskIO::setOptions(const JPetOptions& opts) {\n\tfOptions = opts;\n}\nvoid JPetTaskIO::setParamManager(JPetParamManager* paramManager) {\n\tfParamManager = paramManager;\n}\nJPetParamManager& JPetTaskIO::getParamManager() {\n\treturn *fParamManager;\n}\n\nvoid JPetTaskIO::createInputObjects(const char* inputFilename)\n{\n auto treeName = \"\";\n if (fOptions.getInputFileType() == JPetOptions::kHld ) {\n fReader = new JPetHLDReader;\n treeName = \"T\";\n } else {\n fReader = new JPetReader;\n treeName = \"tree\";\n }\n if ( fReader->openFileAndLoadData( inputFilename, treeName )) {\n if (fOptions.getInputFileType() == JPetOptions::kHld ) {\n \/\/ create a header to be stored along with the output tree\n fHeader = new JPetTreeHeader(fOptions.getRunNumber());\n\n \/\/ add general info to the Tree header\n fHeader->setBaseFileName(fOptions.getInputFile());\n\n } else {\n assert(fParamManager);\n fParamManager->readParametersFromFile(dynamic_cast<JPetReader*> (fReader));\n \/\/ read the header from the previous analysis stage\n \/\/\n fHeader = dynamic_cast<JPetReader*>(fReader)->getHeaderClone();\n \/\/fParamManager.readParametersFromFile( fReader );\n }\n \/\/ create an object for storing histograms and counters during processing\n fStatistics = new JPetStatistics();\n \n \/\/ add info about this module to the processing stages' history in Tree header\n fHeader->addStageInfo(fTask->GetName(), fTask->GetTitle(), 0,\n\t\t\t CommonTools::getTimeString());\n \n } else {\n ERROR(inputFilename + std::string(\": Unable to open the input file or load the tree\"));\n exit(-1);\n }\n}\n\nvoid JPetTaskIO::createOutputObjects(const char* outputFilename)\n{\n fWriter = new JPetWriter( outputFilename );\n assert(fWriter);\n if (fTask) {\n fTask->setWriter(fWriter);\n fTask->setStatistics(fStatistics);\n } else {\n WARNING(\"the subTask does not exist, so Write was not passed to it\");\n }\n}\n\nvoid JPetTaskIO::manageProgressBar(long long done, long long end)\n{\n printf(\"\\r[%6.4f%% %%]\", setProgressBar(done, end));\n}\n\nfloat JPetTaskIO::setProgressBar(int currentEventNumber, int numberOfEvents)\n{\n return ( ((float)currentEventNumber) \/ numberOfEvents ) * 100;\n}\n\n\nconst JPetParamBank& JPetTaskIO::getParamBank()\n{\n return fParamManager->getParamBank();\n}\n\nJPetTaskIO::~JPetTaskIO()\n{\n if (fTask) delete fTask;\n if (fWriter) delete fWriter;\n if (fReader) delete fReader;\n}\n\n\n\/\/\/ Sets values of firstEvent and lastEvent based on user options opts and total number of events from JPetReader\n\/\/ if the totEventsFromReader is less than 0, than first and last are set to -1.\nvoid JPetTaskIO::setUserLimits(const JPetOptions& opts, const long long kTotEventsFromReader, long long& first, long long& last) const\n{\n const auto kLastEvent = opts.getLastEvent();\n const auto kFirstEvent = opts.getFirstEvent();\n if ( kTotEventsFromReader < 1) {\n WARNING(\"kTotEvetnsFromReader < 1, first and last set to -1\");\n first = last = -1;\n } else {\n if ( kFirstEvent < 0) {\n first = 0;\n } else {\n first = kFirstEvent < kTotEventsFromReader ? kFirstEvent : kTotEventsFromReader - 1;\n }\n if (kLastEvent < 0) {\n last = kTotEventsFromReader - 1;\n } else {\n last = kLastEvent < kTotEventsFromReader ? kLastEvent : kTotEventsFromReader - 1;\n }\n }\n assert(first >= 0);\n assert(last >= 0);\n assert(first <= last);\n}\n<commit_msg>Set totalEvents to -1. Remove bug.<commit_after>\/**\n * @copyright Copyright 2016 The J-PET Framework Authors. All rights reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may find a copy of the License in the LICENCE file.\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n * @file JPetTaskIO.cpp\n *\/\n\n#include \"JPetTaskIO.h\"\n#include <cassert>\n#include \"..\/JPetReader\/JPetReader.h\"\n#include \"..\/JPetTreeHeader\/JPetTreeHeader.h\"\n#include \"..\/JPetTask\/JPetTask.h\"\n#include \"..\/JPetHLDReader\/JPetHLDReader.h\"\n#include \"..\/CommonTools\/CommonTools.h\"\n\n#include \"..\/JPetLoggerInclude.h\"\n\n\nJPetTaskIO::JPetTaskIO():\n fTask(0),\n fEventNb(-1),\n fWriter(0),\n fReader(0),\n fHeader(0),\n fStatistics(0),\n fParamManager(0)\n{\n}\n\nvoid JPetTaskIO::init(const JPetOptions::Options& opts)\n{\n setOptions(JPetOptions(opts));\n auto inputFilename = fOptions.getInputFile();\n auto outputFilename = fOptions.getOutputFile();\n createInputObjects(inputFilename);\n createOutputObjects(outputFilename);\n}\n\n\nvoid JPetTaskIO::exec()\n{\n assert(fTask);\n assert(fReader);\n assert(fParamManager);\n fTask->setParamManager(fParamManager);\n JPetTaskInterface::Options emptyOpts;\n fTask->init(emptyOpts); \/\/prepare current task for file\n auto totalEvents = 0ll;\n if (fReader) {\n totalEvents = fReader->getNbOfAllEvents();\n } else {\n WARNING(\"no JPETReader set totalEvents set to -1\");\n totalEvents = -1;\n }\n auto firstEvent = 0ll;\n auto lastEvent = 0ll;\n setUserLimits(fOptions, totalEvents, firstEvent, lastEvent);\n assert(lastEvent >= 0);\n for (auto i = firstEvent; i <= lastEvent; i++) {\n fTask->setEvent(&(static_cast<TNamed&>(fReader->getCurrentEvent())));\n if (fOptions.isProgressBar()) {\n manageProgressBar(i, lastEvent);\n }\n fTask->exec();\n fReader->nextEvent();\n }\n fTask->terminate();\n}\n\nvoid JPetTaskIO::terminate()\n{\n assert(fReader);\n assert(fWriter);\n assert(fHeader);\n assert(fStatistics);\n\n fWriter->writeHeader(fHeader);\n\n fWriter->writeObject(fStatistics->getHistogramsTable(), \"Stats\");\n\n \/\/ store the parametric objects in the ouptut ROOT file\n getParamManager().saveParametersToFile(\n fWriter);\n getParamManager().clearParameters();\n\n fWriter->closeFile();\n fReader->closeFile();\n\n}\nvoid JPetTaskIO::addSubTask(JPetTaskInterface* subtask) {\n\tfTask = dynamic_cast<JPetTask*>(subtask);\n}\nJPetTask* JPetTaskIO::getSubTask() const {\n\treturn fTask;\n}\n\nvoid JPetTaskIO::setOptions(const JPetOptions& opts) {\n\tfOptions = opts;\n}\nvoid JPetTaskIO::setParamManager(JPetParamManager* paramManager) {\n\tfParamManager = paramManager;\n}\nJPetParamManager& JPetTaskIO::getParamManager() {\n\treturn *fParamManager;\n}\n\nvoid JPetTaskIO::createInputObjects(const char* inputFilename)\n{\n auto treeName = \"\";\n if (fOptions.getInputFileType() == JPetOptions::kHld ) {\n fReader = new JPetHLDReader;\n treeName = \"T\";\n } else {\n fReader = new JPetReader;\n treeName = \"tree\";\n }\n if ( fReader->openFileAndLoadData( inputFilename, treeName )) {\n if (fOptions.getInputFileType() == JPetOptions::kHld ) {\n \/\/ create a header to be stored along with the output tree\n fHeader = new JPetTreeHeader(fOptions.getRunNumber());\n\n \/\/ add general info to the Tree header\n fHeader->setBaseFileName(fOptions.getInputFile());\n\n } else {\n assert(fParamManager);\n fParamManager->readParametersFromFile(dynamic_cast<JPetReader*> (fReader));\n \/\/ read the header from the previous analysis stage\n \/\/\n fHeader = dynamic_cast<JPetReader*>(fReader)->getHeaderClone();\n \/\/fParamManager.readParametersFromFile( fReader );\n }\n \/\/ create an object for storing histograms and counters during processing\n fStatistics = new JPetStatistics();\n \n \/\/ add info about this module to the processing stages' history in Tree header\n fHeader->addStageInfo(fTask->GetName(), fTask->GetTitle(), 0,\n\t\t\t CommonTools::getTimeString());\n \n } else {\n ERROR(inputFilename + std::string(\": Unable to open the input file or load the tree\"));\n exit(-1);\n }\n}\n\nvoid JPetTaskIO::createOutputObjects(const char* outputFilename)\n{\n fWriter = new JPetWriter( outputFilename );\n assert(fWriter);\n if (fTask) {\n fTask->setWriter(fWriter);\n fTask->setStatistics(fStatistics);\n } else {\n WARNING(\"the subTask does not exist, so Write was not passed to it\");\n }\n}\n\nvoid JPetTaskIO::manageProgressBar(long long done, long long end)\n{\n printf(\"\\r[%6.4f%% %%]\", setProgressBar(done, end));\n}\n\nfloat JPetTaskIO::setProgressBar(int currentEventNumber, int numberOfEvents)\n{\n return ( ((float)currentEventNumber) \/ numberOfEvents ) * 100;\n}\n\n\nconst JPetParamBank& JPetTaskIO::getParamBank()\n{\n return fParamManager->getParamBank();\n}\n\nJPetTaskIO::~JPetTaskIO()\n{\n if (fTask) delete fTask;\n if (fWriter) delete fWriter;\n if (fReader) delete fReader;\n}\n\n\n\/\/\/ Sets values of firstEvent and lastEvent based on user options opts and total number of events from JPetReader\n\/\/ if the totEventsFromReader is less than 0, than first and last are set to -1.\nvoid JPetTaskIO::setUserLimits(const JPetOptions& opts, const long long kTotEventsFromReader, long long& first, long long& last) const\n{\n const auto kLastEvent = opts.getLastEvent();\n const auto kFirstEvent = opts.getFirstEvent();\n if ( kTotEventsFromReader < 1) {\n WARNING(\"kTotEvetnsFromReader < 1, first and last set to -1\");\n first = last = -1;\n } else {\n if ( kFirstEvent < 0) {\n first = 0;\n } else {\n first = kFirstEvent < kTotEventsFromReader ? kFirstEvent : kTotEventsFromReader - 1;\n }\n if (kLastEvent < 0) {\n last = kTotEventsFromReader - 1;\n } else {\n last = kLastEvent < kTotEventsFromReader ? kLastEvent : kTotEventsFromReader - 1;\n }\n }\n assert(first >= 0);\n assert(last >= 0);\n assert(first <= last);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/audio_coding\/main\/acm2\/codec_owner.h\"\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/engine_configurations.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/cng\/include\/audio_encoder_cng.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/g711\/include\/audio_encoder_pcm.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/g722\/include\/audio_encoder_g722.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/ilbc\/interface\/audio_encoder_ilbc.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/isac\/fix\/interface\/audio_encoder_isacfix.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/isac\/main\/interface\/audio_encoder_isac.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/opus\/interface\/audio_encoder_opus.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/pcm16b\/include\/audio_encoder_pcm16b.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/red\/audio_encoder_copy_red.h\"\n\nnamespace webrtc {\nnamespace acm2 {\n\nnamespace {\nbool IsIsac(const CodecInst& codec) {\n return\n#if (defined(WEBRTC_CODEC_ISAC) || defined(WEBRTC_CODEC_ISACFX))\n !STR_CASE_CMP(codec.plname, \"isac\") ||\n#endif\n false;\n}\n\nbool IsOpus(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_OPUS\n !STR_CASE_CMP(codec.plname, \"opus\") ||\n#endif\n false;\n}\n\nbool IsPcmU(const CodecInst& codec) {\n return !STR_CASE_CMP(codec.plname, \"pcmu\");\n}\n\nbool IsPcmA(const CodecInst& codec) {\n return !STR_CASE_CMP(codec.plname, \"pcma\");\n}\n\nbool IsPcm16B(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_PCM16\n !STR_CASE_CMP(codec.plname, \"l16\") ||\n#endif\n false;\n}\n\nbool IsIlbc(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_ILBC\n !STR_CASE_CMP(codec.plname, \"ilbc\") ||\n#endif\n false;\n}\n\nbool IsG722(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_G722\n !STR_CASE_CMP(codec.plname, \"g722\") ||\n#endif\n false;\n}\n} \/\/ namespace\n\nCodecOwner::CodecOwner()\n : isac_is_encoder_(false), external_speech_encoder_(nullptr) {\n}\n\nCodecOwner::~CodecOwner() = default;\n\nnamespace {\nAudioEncoderDecoderMutableIsac* CreateIsacCodec(const CodecInst& speech_inst) {\n#if defined(WEBRTC_CODEC_ISACFX)\n return new AudioEncoderDecoderMutableIsacFix(speech_inst);\n#elif defined(WEBRTC_CODEC_ISAC)\n return new AudioEncoderDecoderMutableIsacFloat(speech_inst);\n#else\n FATAL() << \"iSAC is not supported.\";\n return nullptr;\n#endif\n}\n\nvoid CreateSpeechEncoder(\n const CodecInst& speech_inst,\n rtc::scoped_ptr<AudioEncoderMutable>* speech_encoder,\n rtc::scoped_ptr<AudioEncoderDecoderMutableIsac>* isac_codec,\n bool* isac_is_encoder) {\n if (IsIsac(speech_inst)) {\n if (*isac_codec) {\n (*isac_codec)->UpdateSettings(speech_inst);\n } else {\n isac_codec->reset(CreateIsacCodec(speech_inst));\n }\n *isac_is_encoder = true;\n speech_encoder->reset();\n return;\n }\n if (IsOpus(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableOpus(speech_inst));\n } else if (IsPcmU(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcmU(speech_inst));\n } else if (IsPcmA(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcmA(speech_inst));\n } else if (IsPcm16B(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcm16B(speech_inst));\n } else if (IsIlbc(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableIlbc(speech_inst));\n } else if (IsG722(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableG722(speech_inst));\n } else {\n FATAL();\n }\n *isac_is_encoder = false;\n}\n\nAudioEncoder* CreateRedEncoder(int red_payload_type,\n AudioEncoder* encoder,\n rtc::scoped_ptr<AudioEncoder>* red_encoder) {\n if (red_payload_type == -1) {\n red_encoder->reset();\n return encoder;\n }\n AudioEncoderCopyRed::Config config;\n config.payload_type = red_payload_type;\n config.speech_encoder = encoder;\n red_encoder->reset(new AudioEncoderCopyRed(config));\n return red_encoder->get();\n}\n\nvoid CreateCngEncoder(int cng_payload_type,\n ACMVADMode vad_mode,\n AudioEncoder* encoder,\n rtc::scoped_ptr<AudioEncoder>* cng_encoder) {\n if (cng_payload_type == -1) {\n cng_encoder->reset();\n return;\n }\n AudioEncoderCng::Config config;\n config.num_channels = encoder->NumChannels();\n config.payload_type = cng_payload_type;\n config.speech_encoder = encoder;\n switch (vad_mode) {\n case VADNormal:\n config.vad_mode = Vad::kVadNormal;\n break;\n case VADLowBitrate:\n config.vad_mode = Vad::kVadLowBitrate;\n break;\n case VADAggr:\n config.vad_mode = Vad::kVadAggressive;\n break;\n case VADVeryAggr:\n config.vad_mode = Vad::kVadVeryAggressive;\n break;\n default:\n FATAL();\n }\n cng_encoder->reset(new AudioEncoderCng(config));\n}\n} \/\/ namespace\n\nvoid CodecOwner::SetEncoders(const CodecInst& speech_inst,\n int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n CreateSpeechEncoder(speech_inst, &speech_encoder_, &isac_codec_,\n &isac_is_encoder_);\n external_speech_encoder_ = nullptr;\n ChangeCngAndRed(cng_payload_type, vad_mode, red_payload_type);\n}\n\nvoid CodecOwner::SetEncoders(AudioEncoderMutable* external_speech_encoder,\n int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n external_speech_encoder_ = external_speech_encoder;\n speech_encoder_.reset();\n isac_is_encoder_ = false;\n ChangeCngAndRed(cng_payload_type, vad_mode, red_payload_type);\n}\n\nvoid CodecOwner::ChangeCngAndRed(int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n AudioEncoder* encoder =\n CreateRedEncoder(red_payload_type, SpeechEncoder(), &red_encoder_);\n CreateCngEncoder(cng_payload_type, vad_mode, encoder, &cng_encoder_);\n int num_true =\n !!speech_encoder_ + !!external_speech_encoder_ + isac_is_encoder_;\n DCHECK_EQ(num_true, 1);\n DCHECK(!isac_is_encoder_ || isac_codec_);\n}\n\nAudioDecoder* CodecOwner::GetIsacDecoder() {\n if (!isac_codec_) {\n DCHECK(!isac_is_encoder_);\n \/\/ None of the parameter values in |speech_inst| matter when the codec is\n \/\/ used only as a decoder.\n CodecInst speech_inst;\n speech_inst.plfreq = 16000;\n speech_inst.rate = -1;\n speech_inst.pacsize = 480;\n isac_codec_.reset(CreateIsacCodec(speech_inst));\n }\n return isac_codec_.get();\n}\n\nAudioEncoder* CodecOwner::Encoder() {\n const auto& const_this = *this;\n return const_cast<AudioEncoder*>(const_this.Encoder());\n}\n\nconst AudioEncoder* CodecOwner::Encoder() const {\n if (cng_encoder_)\n return cng_encoder_.get();\n if (red_encoder_)\n return red_encoder_.get();\n return SpeechEncoder();\n}\n\nAudioEncoderMutable* CodecOwner::SpeechEncoder() {\n const auto& const_this = *this;\n return const_cast<AudioEncoderMutable*>(const_this.SpeechEncoder());\n}\n\nconst AudioEncoderMutable* CodecOwner::SpeechEncoder() const {\n int num_true =\n !!speech_encoder_ + !!external_speech_encoder_ + isac_is_encoder_;\n DCHECK_GE(num_true, 0);\n DCHECK_LE(num_true, 1);\n if (external_speech_encoder_)\n return external_speech_encoder_;\n if (speech_encoder_)\n return speech_encoder_.get();\n return isac_is_encoder_ ? isac_codec_.get() : nullptr;\n}\n\n} \/\/ namespace acm2\n} \/\/ namespace webrtc\n<commit_msg>Reset speech encoder before hooking it up to RED or CNG<commit_after>\/*\n * Copyright (c) 2015 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/audio_coding\/main\/acm2\/codec_owner.h\"\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/engine_configurations.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/cng\/include\/audio_encoder_cng.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/g711\/include\/audio_encoder_pcm.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/g722\/include\/audio_encoder_g722.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/ilbc\/interface\/audio_encoder_ilbc.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/isac\/fix\/interface\/audio_encoder_isacfix.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/isac\/main\/interface\/audio_encoder_isac.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/opus\/interface\/audio_encoder_opus.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/pcm16b\/include\/audio_encoder_pcm16b.h\"\n#include \"webrtc\/modules\/audio_coding\/codecs\/red\/audio_encoder_copy_red.h\"\n\nnamespace webrtc {\nnamespace acm2 {\n\nnamespace {\nbool IsIsac(const CodecInst& codec) {\n return\n#if (defined(WEBRTC_CODEC_ISAC) || defined(WEBRTC_CODEC_ISACFX))\n !STR_CASE_CMP(codec.plname, \"isac\") ||\n#endif\n false;\n}\n\nbool IsOpus(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_OPUS\n !STR_CASE_CMP(codec.plname, \"opus\") ||\n#endif\n false;\n}\n\nbool IsPcmU(const CodecInst& codec) {\n return !STR_CASE_CMP(codec.plname, \"pcmu\");\n}\n\nbool IsPcmA(const CodecInst& codec) {\n return !STR_CASE_CMP(codec.plname, \"pcma\");\n}\n\nbool IsPcm16B(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_PCM16\n !STR_CASE_CMP(codec.plname, \"l16\") ||\n#endif\n false;\n}\n\nbool IsIlbc(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_ILBC\n !STR_CASE_CMP(codec.plname, \"ilbc\") ||\n#endif\n false;\n}\n\nbool IsG722(const CodecInst& codec) {\n return\n#ifdef WEBRTC_CODEC_G722\n !STR_CASE_CMP(codec.plname, \"g722\") ||\n#endif\n false;\n}\n} \/\/ namespace\n\nCodecOwner::CodecOwner()\n : isac_is_encoder_(false), external_speech_encoder_(nullptr) {\n}\n\nCodecOwner::~CodecOwner() = default;\n\nnamespace {\nAudioEncoderDecoderMutableIsac* CreateIsacCodec(const CodecInst& speech_inst) {\n#if defined(WEBRTC_CODEC_ISACFX)\n return new AudioEncoderDecoderMutableIsacFix(speech_inst);\n#elif defined(WEBRTC_CODEC_ISAC)\n return new AudioEncoderDecoderMutableIsacFloat(speech_inst);\n#else\n FATAL() << \"iSAC is not supported.\";\n return nullptr;\n#endif\n}\n\nvoid CreateSpeechEncoder(\n const CodecInst& speech_inst,\n rtc::scoped_ptr<AudioEncoderMutable>* speech_encoder,\n rtc::scoped_ptr<AudioEncoderDecoderMutableIsac>* isac_codec,\n bool* isac_is_encoder) {\n if (IsIsac(speech_inst)) {\n if (*isac_codec) {\n (*isac_codec)->UpdateSettings(speech_inst);\n } else {\n isac_codec->reset(CreateIsacCodec(speech_inst));\n }\n *isac_is_encoder = true;\n speech_encoder->reset();\n return;\n }\n if (IsOpus(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableOpus(speech_inst));\n } else if (IsPcmU(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcmU(speech_inst));\n } else if (IsPcmA(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcmA(speech_inst));\n } else if (IsPcm16B(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutablePcm16B(speech_inst));\n } else if (IsIlbc(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableIlbc(speech_inst));\n } else if (IsG722(speech_inst)) {\n speech_encoder->reset(new AudioEncoderMutableG722(speech_inst));\n } else {\n FATAL();\n }\n *isac_is_encoder = false;\n}\n\nAudioEncoder* CreateRedEncoder(int red_payload_type,\n AudioEncoder* encoder,\n rtc::scoped_ptr<AudioEncoder>* red_encoder) {\n if (red_payload_type == -1) {\n red_encoder->reset();\n return encoder;\n }\n AudioEncoderCopyRed::Config config;\n config.payload_type = red_payload_type;\n config.speech_encoder = encoder;\n red_encoder->reset(new AudioEncoderCopyRed(config));\n return red_encoder->get();\n}\n\nvoid CreateCngEncoder(int cng_payload_type,\n ACMVADMode vad_mode,\n AudioEncoder* encoder,\n rtc::scoped_ptr<AudioEncoder>* cng_encoder) {\n if (cng_payload_type == -1) {\n cng_encoder->reset();\n return;\n }\n AudioEncoderCng::Config config;\n config.num_channels = encoder->NumChannels();\n config.payload_type = cng_payload_type;\n config.speech_encoder = encoder;\n switch (vad_mode) {\n case VADNormal:\n config.vad_mode = Vad::kVadNormal;\n break;\n case VADLowBitrate:\n config.vad_mode = Vad::kVadLowBitrate;\n break;\n case VADAggr:\n config.vad_mode = Vad::kVadAggressive;\n break;\n case VADVeryAggr:\n config.vad_mode = Vad::kVadVeryAggressive;\n break;\n default:\n FATAL();\n }\n cng_encoder->reset(new AudioEncoderCng(config));\n}\n} \/\/ namespace\n\nvoid CodecOwner::SetEncoders(const CodecInst& speech_inst,\n int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n CreateSpeechEncoder(speech_inst, &speech_encoder_, &isac_codec_,\n &isac_is_encoder_);\n external_speech_encoder_ = nullptr;\n ChangeCngAndRed(cng_payload_type, vad_mode, red_payload_type);\n}\n\nvoid CodecOwner::SetEncoders(AudioEncoderMutable* external_speech_encoder,\n int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n external_speech_encoder_ = external_speech_encoder;\n speech_encoder_.reset();\n isac_is_encoder_ = false;\n ChangeCngAndRed(cng_payload_type, vad_mode, red_payload_type);\n}\n\nvoid CodecOwner::ChangeCngAndRed(int cng_payload_type,\n ACMVADMode vad_mode,\n int red_payload_type) {\n AudioEncoderMutable* speech_encoder = SpeechEncoder();\n if (cng_payload_type != -1 || red_payload_type != -1) {\n \/\/ The RED and CNG encoders need to be in sync with the speech encoder, so\n \/\/ reset the latter to ensure its buffer is empty.\n speech_encoder->Reset();\n }\n AudioEncoder* encoder =\n CreateRedEncoder(red_payload_type, speech_encoder, &red_encoder_);\n CreateCngEncoder(cng_payload_type, vad_mode, encoder, &cng_encoder_);\n int num_true =\n !!speech_encoder_ + !!external_speech_encoder_ + isac_is_encoder_;\n DCHECK_EQ(num_true, 1);\n DCHECK(!isac_is_encoder_ || isac_codec_);\n}\n\nAudioDecoder* CodecOwner::GetIsacDecoder() {\n if (!isac_codec_) {\n DCHECK(!isac_is_encoder_);\n \/\/ None of the parameter values in |speech_inst| matter when the codec is\n \/\/ used only as a decoder.\n CodecInst speech_inst;\n speech_inst.plfreq = 16000;\n speech_inst.rate = -1;\n speech_inst.pacsize = 480;\n isac_codec_.reset(CreateIsacCodec(speech_inst));\n }\n return isac_codec_.get();\n}\n\nAudioEncoder* CodecOwner::Encoder() {\n const auto& const_this = *this;\n return const_cast<AudioEncoder*>(const_this.Encoder());\n}\n\nconst AudioEncoder* CodecOwner::Encoder() const {\n if (cng_encoder_)\n return cng_encoder_.get();\n if (red_encoder_)\n return red_encoder_.get();\n return SpeechEncoder();\n}\n\nAudioEncoderMutable* CodecOwner::SpeechEncoder() {\n const auto& const_this = *this;\n return const_cast<AudioEncoderMutable*>(const_this.SpeechEncoder());\n}\n\nconst AudioEncoderMutable* CodecOwner::SpeechEncoder() const {\n int num_true =\n !!speech_encoder_ + !!external_speech_encoder_ + isac_is_encoder_;\n DCHECK_GE(num_true, 0);\n DCHECK_LE(num_true, 1);\n if (external_speech_encoder_)\n return external_speech_encoder_;\n if (speech_encoder_)\n return speech_encoder_.get();\n return isac_is_encoder_ ? isac_codec_.get() : nullptr;\n}\n\n} \/\/ namespace acm2\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/ By downloading, copying, installing or using the software you agree to this license.\n\/\/ If you do not agree to this license, do not download, install,\n\/\/ copy or use the software.\n\/\/\n\/\/\n\/\/ Intel License Agreement\n\/\/ For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright( C) 2000, Intel Corporation, all rights reserved.\n\/\/ Third party copyrights are property of their respective owners.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification,\n\/\/ are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistribution's of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistribution's in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * The name of Intel Corporation may not be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ This software is provided by the copyright holders and contributors \"as is\" and\n\/\/ any express or implied warranties, including, but not limited to, the implied\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\n\/\/ indirect, incidental, special, exemplary, or consequential damages\n\/\/(including, but not limited to, procurement of substitute goods or services;\n\/\/ loss of use, data, or profits; or business interruption) however caused\n\/\/ and on any theory of liability, whether in contract, strict liability,\n\/\/ or tort(including negligence or otherwise) arising in any way out of\n\/\/ the use of this software, even if advised of the possibility of such damage.\n\/\/\n\/\/M*\/\n\n\/*\n definition of the current version of OpenCV\n Usefull to test in user programs\n*\/\n\n#ifndef __OPENCV_VERSION_HPP__\n#define __OPENCV_VERSION_HPP__\n\n#define CV_MAJOR_VERSION 2\n#define CV_MINOR_VERSION 4\n#define CV_SUBMINOR_VERSION 0\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n#define CV_VERSION CVAUX_STR(CV_MAJOR_VERSION) \".\" CVAUX_STR(CV_MINOR_VERSION) \".\" CVAUX_STR(CV_SUBMINOR_VERSION)\n\n#endif\n<commit_msg>Version of 2.4 branch is adjusted to 2.4.1<commit_after>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/ By downloading, copying, installing or using the software you agree to this license.\n\/\/ If you do not agree to this license, do not download, install,\n\/\/ copy or use the software.\n\/\/\n\/\/\n\/\/ Intel License Agreement\n\/\/ For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright( C) 2000, Intel Corporation, all rights reserved.\n\/\/ Third party copyrights are property of their respective owners.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification,\n\/\/ are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistribution's of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistribution's in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * The name of Intel Corporation may not be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ This software is provided by the copyright holders and contributors \"as is\" and\n\/\/ any express or implied warranties, including, but not limited to, the implied\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\n\/\/ indirect, incidental, special, exemplary, or consequential damages\n\/\/(including, but not limited to, procurement of substitute goods or services;\n\/\/ loss of use, data, or profits; or business interruption) however caused\n\/\/ and on any theory of liability, whether in contract, strict liability,\n\/\/ or tort(including negligence or otherwise) arising in any way out of\n\/\/ the use of this software, even if advised of the possibility of such damage.\n\/\/\n\/\/M*\/\n\n\/*\n definition of the current version of OpenCV\n Usefull to test in user programs\n*\/\n\n#ifndef __OPENCV_VERSION_HPP__\n#define __OPENCV_VERSION_HPP__\n\n#define CV_MAJOR_VERSION 2\n#define CV_MINOR_VERSION 4\n#define CV_SUBMINOR_VERSION 1\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n#define CV_VERSION CVAUX_STR(CV_MAJOR_VERSION) \".\" CVAUX_STR(CV_MINOR_VERSION) \".\" CVAUX_STR(CV_SUBMINOR_VERSION)\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2013 IIT - Istituto Italiano di Tecnologia - http:\/\/www.iit.it\n * Author: Silvio Traversaro\n * CopyPolicy: Released under the terms of the GNU LGPL v2.0 (or any later version)\n *\n * The development of this software was supported by the FP7 EU project\n * CoDyCo (No. 600716 ICT 2011.2.1 Cognitive Systems and Robotics (b))\n * http:\/\/www.codyco.eu\n *\/\n\n#include \"kdl_codyco\/regressors\/torqueRegressor.hpp\"\n\n#include \"kdl_codyco\/regressor_utils.hpp\"\n\n#include \"iDynTree\/Sensors\/Sensors.h\"\n#include \"iDynTree\/Sensors\/SixAxisFTSensor.h\"\n#include \"kdl_codyco\/KDLConversions.h\"\n#include \"iDynTree\/Core\/Transform.h\"\n#include \"iDynTree\/Core\/Wrench.h\"\n\n#include \"dirl_utils.hpp\"\n\n#include <iostream>\n\nusing namespace KDL::CoDyCo;\n\nnamespace KDL {\nnamespace CoDyCo {\nnamespace Regressors {\n\nbool torqueRegressor::isActiveFTSensor(const int ft_sensor_id) const\n{\n unsigned int NrOfFTSensors = p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE);\n if( activated_ft_sensors.size() != NrOfFTSensors)\n {\n return false;\n }\n\n if( ft_sensor_id < 0 ||\n ft_sensor_id >= NrOfFTSensors )\n {\n return false;\n }\n\n return activated_ft_sensors[ft_sensor_id];\n}\n\nint torqueRegressor::configure()\n{\n const KDL::CoDyCo::UndirectedTree & undirected_tree = *p_undirected_tree;\n const iDynTree::SensorsList & sensors_tree = *p_sensors_tree;\n\n\n \/\/Now store all the links that belong to the subtree\n \/\/We first compute the spanning starting at one (the first) of the leafs\n KDL::CoDyCo::Traversal subtree_traversal;\n\n\n JunctionMap::const_iterator torque_jnt = undirected_tree.getJunction(torque_dof);\n if( torque_jnt == undirected_tree.getInvalidJunctionIterator() ) {\n if(verbose) { std::cerr << \"torqueRegressor error: specified joint \" << torque_dof << \" not found \" << std::endl; }\n return -1;\n }\n\n torque_dof_index = torque_jnt->getJunctionIndex();\n\n relative_junction.resize(1);\n relative_junction[0] = torque_dof_index;\n\n\n if( torque_dof_index < 0 || torque_dof_index >= (int)undirected_tree.getNrOfDOFs() ) {\n if(verbose) { std::cerr << \"torqueRegressor error: specified joint \" << torque_dof << \" has no degrees of freedom \" << std::endl; }\n return -1;\n }\n\n\n int link_parent_id = torque_jnt->getParentLink()->getLinkIndex();\n int link_child_id = torque_jnt->getChildLink()->getLinkIndex();\n\n if( !reverse_direction )\n {\n subtree_root_link_id = link_child_id;\n }\n else\n {\n subtree_root_link_id = link_parent_id;\n }\n\n undirected_tree.compute_traversal(subtree_traversal,subtree_root_link_id);\n\n \/\/Then we color the nodes: if white (true) the links belongs to the subtree\n \/\/if black (false) it does not belongs to the node\n std::vector<bool> is_link_in_subtree(undirected_tree.getNrOfLinks(),false);\n\n \/\/the leaf that we chose as starting link clearly belongs to the subtree\n is_link_in_subtree[subtree_root_link_id] = true;\n\n \/\/then, all the other links can be classified using the following rules:\n for(int i=1; i < (int)subtree_traversal.getNrOfVisitedLinks(); i++ )\n {\n int link_id = subtree_traversal.getOrderedLink(i)->getLinkIndex();\n int parent_id = subtree_traversal.getParentLink(link_id)->getLinkIndex();\n\n if( is_link_in_subtree[parent_id] == false )\n {\n \/\/if the parent is not in the subtree (false\/black) then the link is not in the subtree (false\/black)\n is_link_in_subtree[link_id] = false;\n }\n else\n {\n int junction_index = undirected_tree.getLink(link_id)->getAdjacentJoint(undirected_tree.getLink(parent_id))->getJunctionIndex();\n\n int ft_sensor_index = getFTIndexFromJunctionIndex(*p_sensors_tree,junction_index);\n if( ft_sensor_index >= 0 && isActiveFTSensor(ft_sensor_index) )\n {\n \/\/if the parent is in the subtree (true\/white) but it is connected to the link by an activated FT sensor\n is_link_in_subtree[link_id] = false;\n \/\/In this case we have to add the parent to subtree_leaf_links_indeces\n subtree_leaf_links_indeces.push_back(parent_id);\n\n }\n else if ( junction_index == torque_dof_index )\n {\n \/\/or if the parent is connected trought the torque regressor dof\n is_link_in_subtree[link_id] = false;\n }\n else\n {\n \/\/otherwise the link is in the subtree (true\/white)\n is_link_in_subtree[link_id] = true;\n }\n }\n }\n\n \/\/after all the links belonging to the subtree have been identified, it is possible to save only the id of the one in the subtree\n assert( subtree_links_indices.size() == 0 );\n for( int i=0; i < (int)is_link_in_subtree.size(); i++ )\n {\n if( is_link_in_subtree[i] ) {\n subtree_links_indices.push_back(i);\n }\n }\n\n iDynTree::Regressors::DynamicsRegressorParametersList localSerialization = getLegacyUsedParameters(linkIndeces2regrCols,\n p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE),\n this->consider_ft_offset);\n\n regressor_local_parametrization.resize(getNrOfOutputs(),localSerialization.parameters.size());\n\n return 0;\n}\n\nint torqueRegressor::getNrOfOutputs()\n{\n return 1;\n}\n\nstd::vector<int> torqueRegressor::getRelativeJunctions()\n{\n return relative_junction;\n}\n\niDynTree::Regressors::DynamicsRegressorParametersList torqueRegressor::getUsedParameters()\n{\n assert(p_undirected_tree->getNrOfLinks() == linkIndeces2regrCols.size());\n\n return getLegacyUsedParameters(linkIndeces2regrCols,\n activated_ft_sensors.size(),\n this->consider_ft_offset);\n}\n\nint torqueRegressor::computeRegressor(const KDL::JntArray &q,\n const KDL::JntArray &\/*q_dot*\/,\n const KDL::JntArray &\/*q_dotdot*\/,\n const std::vector<KDL::Frame> & X_dynamic_base,\n const std::vector<KDL::Twist> & v,\n const std::vector<KDL::Twist> & a,\n const iDynTree::SensorsMeasurements & measured_wrenches,\n const KDL::JntArray & measured_torques,\n Eigen::MatrixXd & regressor_matrix_global_column_serialization,\n Eigen::VectorXd & known_terms)\n{\n#ifdef NDEBUG\n if( verbose ) std::cerr << \"Called torqueRegressor::computeRegressor \" << std::endl;\n#endif\n \/\/const KDL::CoDyCo::UndirectedTree & = *p_undirected_tree;\n \/\/const KDL::CoDyCo::FTSensorList & ft_list = *p_ft_list;\n\n\n assert( regressor_local_parametrization.rows() == getNrOfOutputs() );\n\n \/**\n * \\todo move this stuff in UndirectedTree\n *\n *\/\n JunctionMap::const_iterator torque_dof_it = p_undirected_tree->getJunction(torque_dof_index);\n LinkMap::const_iterator parent_root_it;\n if( torque_dof_it->getChildLink() == p_undirected_tree->getLink(subtree_root_link_id) ) {\n parent_root_it = torque_dof_it->getParentLink();\n } else {\n parent_root_it = torque_dof_it->getChildLink();\n }\n assert(torque_dof_it->getJunctionIndex() < (int)p_undirected_tree->getNrOfDOFs());\n KDL::Twist S = parent_root_it->S(p_undirected_tree->getLink(subtree_root_link_id),q(torque_dof_it->getJunctionIndex()));\n\n \/\/all other columns, beside the one relative to the inertial parameters of the links of the subtree, are zero\n regressor_local_parametrization.setZero();\n\n for(int i =0; i < (int)subtree_links_indices.size(); i++ ) {\n int link_id = subtree_links_indices[i];\n\n if( linkIndeces2regrCols[link_id] != -1 ) {\n #ifdef NDEBUG\n if( verbose ) std::cerr << \"Adding to the torque regressor of joint \" << torque_dof_it->getName() << \" the regressor relative to link \" << p_undirected_tree->getLink(link_id)->getName() << std::endl;\n #endif\n\n Eigen::Matrix<double,6,10> netWrenchRegressor_i = netWrenchRegressor(v[link_id],a[link_id]);\n regressor_local_parametrization.block(0,(int)(10*linkIndeces2regrCols[link_id]),getNrOfOutputs(),10)\n = toEigen(S).transpose()*WrenchTransformationMatrix(X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[link_id])*netWrenchRegressor_i;\n }\n }\n\n#ifdef NDEBUG\n if( consider_ft_offset ) {\n if( verbose ) std::cerr << \"considering ft offset\" << std::endl;\n } else {\n if( verbose ) std::cerr << \"not considering ft offset\" << std::endl;\n }\n#endif\n \/\/ if the ft offset is condidered, we have to set also the columns relative to the offset\n \/\/ For each subgraph, we consider the measured wrenches as the one excerted from the rest of the\n \/\/ tree to the considered subtree\n \/\/ So the sign of the offset should be consistent with the other place where it is defined.\n \/\/ In particular, the offset of a sensor is considered\n \/\/ as an addictive on the measured wrench, so f_s = f_sr + f_o, where the frame of expression\n \/\/ and the sign of f_s are defined in the SensorsTree structure\n for(int leaf_id = 0; leaf_id < (int) subtree_leaf_links_indeces.size(); leaf_id++ ) {\n if( consider_ft_offset ) {\n int leaf_link_id = subtree_leaf_links_indeces[leaf_id];\n\n \/\/ for now we are supporting just one six axis FT sensor for link\n \/\/std::vector< FTSensor> fts_link = ft_list.getFTSensorsOnLink(leaf_link_id);\n \/\/assert(fts_link.size()==1);\n \/\/int ft_id = fts_link[0].getID();\n int ft_id = getFirstFTSensorOnLink(*p_sensors_tree,leaf_link_id);\n assert( ft_id >= 0 );\n\n iDynTree::SixAxisForceTorqueSensor * sens\n = (iDynTree::SixAxisForceTorqueSensor *) p_sensors_tree->getSensor(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id);\n\n assert( sens->isLinkAttachedToSensor(leaf_link_id) );\n\n #ifndef NDEBUG\n if( verbose ) std::cerr << \"Adding to the torque regressor of joint \" << torque_dof_it->getName()\n << \" the columns relative to offset of ft sensor \"\n << sens->getName() << std::endl;\n #endif\n\n \/** \\todo find a more robust way to get columns indeces relative to a given parameters *\/\n assert(ft_id >= 0 && ft_id < 100);\n assert(10*NrOfRealLinks_subtree+6*ft_id+5 < regressor_local_parametrization.cols());\n\n double sign;\n if( sens->getAppliedWrenchLink() == leaf_link_id ) {\n sign = 1.0;\n } else {\n sign = -1.0;\n }\n\n iDynTree::Transform leaf_link_H_sensor;\n\n bool ok = sens->getLinkSensorTransform(leaf_link_id,leaf_link_H_sensor);\n\n assert(ok);\n\n regressor_local_parametrization.block(0,(int)(10*NrOfRealLinks_subtree+6*ft_id),getNrOfOutputs(),6)\n = sign*toEigen(S).transpose()*regressor_local_parametrization*WrenchTransformationMatrix(X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[leaf_link_id]*iDynTree::ToKDL(leaf_link_H_sensor));\n\n }\n }\n\n \/\/The known terms are simply all the measured wrenches acting on the subtree\n \/\/ projected on the axis plus the measured torque\n known_terms(0) = measured_torques(torque_dof_index);\n\n #ifndef NDEBUG\n \/\/std::cerr << \"computing kt \" << std::endl;\n \/\/std::cerr << (ft_list).toString();\n#endif\n for(int leaf_id = 0; leaf_id < (int) subtree_leaf_links_indeces.size(); leaf_id++ ) {\n int leaf_link_id = subtree_leaf_links_indeces[leaf_id];\n\n int ft_id = getFirstFTSensorOnLink(*p_sensors_tree,leaf_link_id);\n assert( ft_id >= 0 );\n\n iDynTree::SixAxisForceTorqueSensor * sens\n = (iDynTree::SixAxisForceTorqueSensor *) p_sensors_tree->getSensor(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id);\n\n#ifndef NDEBUG\n \/\/std::cerr << \"For leaf \" << leaf_link_id << \" found ft sensor \" << ft_id << \" that connects \" << fts_link[0].getParent() << \" and \" << fts_link[0].getChild() << std::endl;\n#endif\n iDynTree::Wrench sensor_measured_wrench, link_measured_branch;\n\n bool ok = measured_wrenches.getMeasurement(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id,sensor_measured_wrench);\n\n ok = ok && sens->getWrenchAppliedOnLink(leaf_link_id,sensor_measured_wrench,link_measured_branch);\n\n assert(ok);\n\n known_terms(0) += dot(S,X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[leaf_link_id]*iDynTree::ToKDL(link_measured_branch));\n }\n\n#ifndef NDEBUG\n\/*\nstd::cout << \"Returning from computeRegressor (subtree):\" << std::endl;\nstd::cout << \"Regressor \" << std::endl;\nstd::cout << regressor_matrix << std::endl;\nstd::cout << \"known terms\" << std::endl;\nstd::cout << known_terms << std::endl;\n*\/\n#endif\n\n convertLocalRegressorToGlobalRegressor(regressor_local_parametrization,regressor_matrix_global_column_serialization,this->localParametersIndexToOutputParametersIndex);\n\n\n return 0;\n}\n\nbool torqueRegressor::setGlobalParameters(const iDynTree::Regressors::DynamicsRegressorParametersList& globalParameters)\n{\n iDynTree::Regressors::DynamicsRegressorParametersList localSerialiaziation =\n getLegacyUsedParameters(linkIndeces2regrCols,\n p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE),\n this->consider_ft_offset);\n\n buildParametersMapping(localSerialiaziation,globalParameters,this->localParametersIndexToOutputParametersIndex);\n\n return true;\n}\n\n}\n\n}\n\n}\n<commit_msg>Fix regression in torque regressor computation<commit_after>\/**\n * Copyright (C) 2013 IIT - Istituto Italiano di Tecnologia - http:\/\/www.iit.it\n * Author: Silvio Traversaro\n * CopyPolicy: Released under the terms of the GNU LGPL v2.0 (or any later version)\n *\n * The development of this software was supported by the FP7 EU project\n * CoDyCo (No. 600716 ICT 2011.2.1 Cognitive Systems and Robotics (b))\n * http:\/\/www.codyco.eu\n *\/\n\n#include \"kdl_codyco\/regressors\/torqueRegressor.hpp\"\n\n#include \"kdl_codyco\/regressor_utils.hpp\"\n\n#include \"iDynTree\/Sensors\/Sensors.h\"\n#include \"iDynTree\/Sensors\/SixAxisFTSensor.h\"\n#include \"kdl_codyco\/KDLConversions.h\"\n#include \"iDynTree\/Core\/Transform.h\"\n#include \"iDynTree\/Core\/Wrench.h\"\n\n#include \"dirl_utils.hpp\"\n\n#include <iostream>\n\nusing namespace KDL::CoDyCo;\n\nnamespace KDL {\nnamespace CoDyCo {\nnamespace Regressors {\n\nbool torqueRegressor::isActiveFTSensor(const int ft_sensor_id) const\n{\n unsigned int NrOfFTSensors = p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE);\n if( activated_ft_sensors.size() != NrOfFTSensors)\n {\n return false;\n }\n\n if( ft_sensor_id < 0 ||\n ft_sensor_id >= NrOfFTSensors )\n {\n return false;\n }\n\n return activated_ft_sensors[ft_sensor_id];\n}\n\nint torqueRegressor::configure()\n{\n const KDL::CoDyCo::UndirectedTree & undirected_tree = *p_undirected_tree;\n const iDynTree::SensorsList & sensors_tree = *p_sensors_tree;\n\n\n \/\/Now store all the links that belong to the subtree\n \/\/We first compute the spanning starting at one (the first) of the leafs\n KDL::CoDyCo::Traversal subtree_traversal;\n\n\n JunctionMap::const_iterator torque_jnt = undirected_tree.getJunction(torque_dof);\n if( torque_jnt == undirected_tree.getInvalidJunctionIterator() ) {\n if(verbose) { std::cerr << \"torqueRegressor error: specified joint \" << torque_dof << \" not found \" << std::endl; }\n return -1;\n }\n\n torque_dof_index = torque_jnt->getJunctionIndex();\n\n relative_junction.resize(1);\n relative_junction[0] = torque_dof_index;\n\n\n if( torque_dof_index < 0 || torque_dof_index >= (int)undirected_tree.getNrOfDOFs() ) {\n if(verbose) { std::cerr << \"torqueRegressor error: specified joint \" << torque_dof << \" has no degrees of freedom \" << std::endl; }\n return -1;\n }\n\n\n int link_parent_id = torque_jnt->getParentLink()->getLinkIndex();\n int link_child_id = torque_jnt->getChildLink()->getLinkIndex();\n\n if( !reverse_direction )\n {\n subtree_root_link_id = link_child_id;\n }\n else\n {\n subtree_root_link_id = link_parent_id;\n }\n\n undirected_tree.compute_traversal(subtree_traversal,subtree_root_link_id);\n\n \/\/Then we color the nodes: if white (true) the links belongs to the subtree\n \/\/if black (false) it does not belongs to the node\n std::vector<bool> is_link_in_subtree(undirected_tree.getNrOfLinks(),false);\n\n \/\/the leaf that we chose as starting link clearly belongs to the subtree\n is_link_in_subtree[subtree_root_link_id] = true;\n\n \/\/then, all the other links can be classified using the following rules:\n for(int i=1; i < (int)subtree_traversal.getNrOfVisitedLinks(); i++ )\n {\n int link_id = subtree_traversal.getOrderedLink(i)->getLinkIndex();\n int parent_id = subtree_traversal.getParentLink(link_id)->getLinkIndex();\n\n if( is_link_in_subtree[parent_id] == false )\n {\n \/\/if the parent is not in the subtree (false\/black) then the link is not in the subtree (false\/black)\n is_link_in_subtree[link_id] = false;\n }\n else\n {\n int junction_index = undirected_tree.getLink(link_id)->getAdjacentJoint(undirected_tree.getLink(parent_id))->getJunctionIndex();\n\n int ft_sensor_index = getFTIndexFromJunctionIndex(*p_sensors_tree,junction_index);\n if( ft_sensor_index >= 0 && isActiveFTSensor(ft_sensor_index) )\n {\n \/\/if the parent is in the subtree (true\/white) but it is connected to the link by an activated FT sensor\n is_link_in_subtree[link_id] = false;\n \/\/In this case we have to add the parent to subtree_leaf_links_indeces\n subtree_leaf_links_indeces.push_back(parent_id);\n\n }\n else if ( junction_index == torque_dof_index )\n {\n \/\/or if the parent is connected trought the torque regressor dof\n is_link_in_subtree[link_id] = false;\n }\n else\n {\n \/\/otherwise the link is in the subtree (true\/white)\n is_link_in_subtree[link_id] = true;\n }\n }\n }\n\n \/\/after all the links belonging to the subtree have been identified, it is possible to save only the id of the one in the subtree\n assert( subtree_links_indices.size() == 0 );\n for( int i=0; i < (int)is_link_in_subtree.size(); i++ )\n {\n if( is_link_in_subtree[i] ) {\n subtree_links_indices.push_back(i);\n }\n }\n\n iDynTree::Regressors::DynamicsRegressorParametersList localSerialization = getLegacyUsedParameters(linkIndeces2regrCols,\n p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE),\n this->consider_ft_offset);\n\n regressor_local_parametrization.resize(getNrOfOutputs(),localSerialization.parameters.size());\n\n return 0;\n}\n\nint torqueRegressor::getNrOfOutputs()\n{\n return 1;\n}\n\nstd::vector<int> torqueRegressor::getRelativeJunctions()\n{\n return relative_junction;\n}\n\niDynTree::Regressors::DynamicsRegressorParametersList torqueRegressor::getUsedParameters()\n{\n assert(p_undirected_tree->getNrOfLinks() == linkIndeces2regrCols.size());\n\n return getLegacyUsedParameters(linkIndeces2regrCols,\n activated_ft_sensors.size(),\n this->consider_ft_offset);\n}\n\nint torqueRegressor::computeRegressor(const KDL::JntArray &q,\n const KDL::JntArray &\/*q_dot*\/,\n const KDL::JntArray &\/*q_dotdot*\/,\n const std::vector<KDL::Frame> & X_dynamic_base,\n const std::vector<KDL::Twist> & v,\n const std::vector<KDL::Twist> & a,\n const iDynTree::SensorsMeasurements & measured_wrenches,\n const KDL::JntArray & measured_torques,\n Eigen::MatrixXd & regressor_matrix_global_column_serialization,\n Eigen::VectorXd & known_terms)\n{\n#ifdef NDEBUG\n if( verbose ) std::cerr << \"Called torqueRegressor::computeRegressor \" << std::endl;\n#endif\n \/\/const KDL::CoDyCo::UndirectedTree & = *p_undirected_tree;\n \/\/const KDL::CoDyCo::FTSensorList & ft_list = *p_ft_list;\n\n\n assert( regressor_local_parametrization.rows() == getNrOfOutputs() );\n\n \/**\n * \\todo move this stuff in UndirectedTree\n *\n *\/\n JunctionMap::const_iterator torque_dof_it = p_undirected_tree->getJunction(torque_dof_index);\n LinkMap::const_iterator parent_root_it;\n if( torque_dof_it->getChildLink() == p_undirected_tree->getLink(subtree_root_link_id) ) {\n parent_root_it = torque_dof_it->getParentLink();\n } else {\n parent_root_it = torque_dof_it->getChildLink();\n }\n assert(torque_dof_it->getJunctionIndex() < (int)p_undirected_tree->getNrOfDOFs());\n KDL::Twist S = parent_root_it->S(p_undirected_tree->getLink(subtree_root_link_id),q(torque_dof_it->getJunctionIndex()));\n\n \/\/all other columns, beside the one relative to the inertial parameters of the links of the subtree, are zero\n regressor_local_parametrization.setZero();\n\n for(int i =0; i < (int)subtree_links_indices.size(); i++ ) {\n int link_id = subtree_links_indices[i];\n\n if( linkIndeces2regrCols[link_id] != -1 ) {\n #ifdef NDEBUG\n if( verbose ) std::cerr << \"Adding to the torque regressor of joint \" << torque_dof_it->getName() << \" the regressor relative to link \" << p_undirected_tree->getLink(link_id)->getName() << std::endl;\n #endif\n\n Eigen::Matrix<double,6,10> netWrenchRegressor_i = netWrenchRegressor(v[link_id],a[link_id]);\n regressor_local_parametrization.block(0,(int)(10*linkIndeces2regrCols[link_id]),getNrOfOutputs(),10)\n = toEigen(S).transpose()*WrenchTransformationMatrix(X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[link_id])*netWrenchRegressor_i;\n }\n }\n\n#ifdef NDEBUG\n if( consider_ft_offset ) {\n if( verbose ) std::cerr << \"considering ft offset\" << std::endl;\n } else {\n if( verbose ) std::cerr << \"not considering ft offset\" << std::endl;\n }\n#endif\n \/\/ if the ft offset is condidered, we have to set also the columns relative to the offset\n \/\/ For each subgraph, we consider the measured wrenches as the one excerted from the rest of the\n \/\/ tree to the considered subtree\n \/\/ So the sign of the offset should be consistent with the other place where it is defined.\n \/\/ In particular, the offset of a sensor is considered\n \/\/ as an addictive on the measured wrench, so f_s = f_sr + f_o, where the frame of expression\n \/\/ and the sign of f_s are defined in the SensorsTree structure\n for(int leaf_id = 0; leaf_id < (int) subtree_leaf_links_indeces.size(); leaf_id++ ) {\n if( consider_ft_offset ) {\n int leaf_link_id = subtree_leaf_links_indeces[leaf_id];\n\n \/\/ for now we are supporting just one six axis FT sensor for link\n \/\/std::vector< FTSensor> fts_link = ft_list.getFTSensorsOnLink(leaf_link_id);\n \/\/assert(fts_link.size()==1);\n \/\/int ft_id = fts_link[0].getID();\n int ft_id = getFirstFTSensorOnLink(*p_sensors_tree,leaf_link_id);\n assert( ft_id >= 0 );\n\n iDynTree::SixAxisForceTorqueSensor * sens\n = (iDynTree::SixAxisForceTorqueSensor *) p_sensors_tree->getSensor(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id);\n\n assert( sens->isLinkAttachedToSensor(leaf_link_id) );\n\n #ifndef NDEBUG\n if( verbose ) std::cerr << \"Adding to the torque regressor of joint \" << torque_dof_it->getName()\n << \" the columns relative to offset of ft sensor \"\n << sens->getName() << std::endl;\n #endif\n\n \/** \\todo find a more robust way to get columns indeces relative to a given parameters *\/\n assert(ft_id >= 0 && ft_id < 100);\n assert(10*NrOfRealLinks_subtree+6*ft_id+5 < regressor_local_parametrization.cols());\n\n double sign;\n if( sens->getAppliedWrenchLink() == leaf_link_id ) {\n sign = 1.0;\n } else {\n sign = -1.0;\n }\n\n iDynTree::Transform leaf_link_H_sensor;\n\n bool ok = sens->getLinkSensorTransform(leaf_link_id,leaf_link_H_sensor);\n\n assert(ok);\n\n regressor_local_parametrization.block(0,(int)(10*NrOfRealLinks_subtree+6*ft_id),getNrOfOutputs(),6)\n = sign*toEigen(S).transpose()*WrenchTransformationMatrix(X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[leaf_link_id]*iDynTree::ToKDL(leaf_link_H_sensor));\n\n }\n }\n\n \/\/The known terms are simply all the measured wrenches acting on the subtree\n \/\/ projected on the axis plus the measured torque\n known_terms(0) = measured_torques(torque_dof_index);\n\n #ifndef NDEBUG\n \/\/std::cerr << \"computing kt \" << std::endl;\n \/\/std::cerr << (ft_list).toString();\n#endif\n for(int leaf_id = 0; leaf_id < (int) subtree_leaf_links_indeces.size(); leaf_id++ ) {\n int leaf_link_id = subtree_leaf_links_indeces[leaf_id];\n\n int ft_id = getFirstFTSensorOnLink(*p_sensors_tree,leaf_link_id);\n assert( ft_id >= 0 );\n\n iDynTree::SixAxisForceTorqueSensor * sens\n = (iDynTree::SixAxisForceTorqueSensor *) p_sensors_tree->getSensor(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id);\n\n#ifndef NDEBUG\n \/\/std::cerr << \"For leaf \" << leaf_link_id << \" found ft sensor \" << ft_id << \" that connects \" << fts_link[0].getParent() << \" and \" << fts_link[0].getChild() << std::endl;\n#endif\n iDynTree::Wrench sensor_measured_wrench, link_measured_branch;\n\n bool ok = measured_wrenches.getMeasurement(iDynTree::SIX_AXIS_FORCE_TORQUE,ft_id,sensor_measured_wrench);\n\n ok = ok && sens->getWrenchAppliedOnLink(leaf_link_id,sensor_measured_wrench,link_measured_branch);\n\n assert(ok);\n\n known_terms(0) += dot(S,X_dynamic_base[subtree_root_link_id].Inverse()*X_dynamic_base[leaf_link_id]*iDynTree::ToKDL(link_measured_branch));\n }\n\n#ifndef NDEBUG\n\/*\nstd::cout << \"Returning from computeRegressor (subtree):\" << std::endl;\nstd::cout << \"Regressor \" << std::endl;\nstd::cout << regressor_matrix << std::endl;\nstd::cout << \"known terms\" << std::endl;\nstd::cout << known_terms << std::endl;\n*\/\n#endif\n\n convertLocalRegressorToGlobalRegressor(regressor_local_parametrization,regressor_matrix_global_column_serialization,this->localParametersIndexToOutputParametersIndex);\n\n\n return 0;\n}\n\nbool torqueRegressor::setGlobalParameters(const iDynTree::Regressors::DynamicsRegressorParametersList& globalParameters)\n{\n iDynTree::Regressors::DynamicsRegressorParametersList localSerialiaziation =\n getLegacyUsedParameters(linkIndeces2regrCols,\n p_sensors_tree->getNrOfSensors(iDynTree::SIX_AXIS_FORCE_TORQUE),\n this->consider_ft_offset);\n\n buildParametersMapping(localSerialiaziation,globalParameters,this->localParametersIndexToOutputParametersIndex);\n\n return true;\n}\n\n}\n\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: printerjob.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 16:35:45 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PSPRINT_PRINTERJOB_HXX_\n#define _PSPRINT_PRINTERJOB_HXX_\n\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n#ifndef _PSPRINT_JOBDATA_HXX_\n#include <psprint\/jobdata.hxx>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n\nnamespace psp {\n\n\/\/ forward declarations\nclass PrinterGfx;\n\n\nclass PrinterJob\n{\nprivate: \/\/ private data\n\n rtl::OUString maSpoolDirName;\n rtl::OUString maFileName; \/\/ empty: spool to command, else spool to named file\n rtl::OUString maJobTitle;\n int mnFileMode;\n\n osl::File* mpJobHeader;\n osl::File* mpJobTrailer;\n\n std::list< osl::File* > maPageList;\n std::list< osl::File* > maHeaderList;\n\n JobData m_aDocumentJobData;\n JobData m_aLastJobData;\n PrinterGfx* m_pGraphics;\n\n sal_uInt32 mnResolution;\n\n sal_uInt32 mnWidthPt;\n sal_uInt32 mnHeightPt;\n sal_uInt32 mnMaxWidthPt;\n sal_uInt32 mnMaxHeightPt;\n\n sal_uInt32 mnLMarginPt;\n sal_uInt32 mnRMarginPt;\n sal_uInt32 mnTMarginPt;\n sal_uInt32 mnBMarginPt;\n\n double mfXScale;\n double mfYScale;\n\n sal_Int32 mnErrorCode;\n\nprivate: \/\/ private methods\n\n osl::File* CreateSpoolFile (const rtl::OUString& rName,\n const rtl::OUString& rExtension);\n void InitPaperSize (const JobData& rJobSetup);\n\n bool writeFeatureList( osl::File* pFile, const JobData&, bool bDocumentSetup );\n bool writeSetup( osl::File* pFile, const JobData& );\n bool writePageSetup( osl::File* pFile, const JobData& );\n void writeJobPatch( osl::File* File, const JobData& );\n bool writeProlog (osl::File* pFile, const JobData& );\n\npublic: \/\/ for usage in PrinterGfx\n\n sal_uInt32 GetResolution () const { return mnResolution; }\n void GetScale (double &rXScale, double &rYScale) const;\n sal_uInt16 GetDepth () const;\n sal_uInt16 GetPostscriptLevel (const JobData *pJobData = NULL) const;\n sal_Bool IsColorPrinter () const;\n\n osl::File* GetDocumentHeader ();\n osl::File* GetDocumentTrailer ();\n osl::File* GetCurrentPageHeader ();\n osl::File* GetCurrentPageBody ();\n\n const ::rtl::OUString& GetPrinterName() const { return m_aLastJobData.m_aPrinterName; }\n\npublic:\n PrinterJob ();\n ~PrinterJob ();\n\n \/* rFileName: if length is greater than 0 save resulting PostScript\n * to named file.\n * nMode: only meaningful when saving to file: if nonzero, try\n * to impose the mode on the resulting file's inode; for nonexistant\n * files use open, for existant files try a chmod\n * rJobName: text to appear in the %%Title comment\n * rAppName: text to appear in the %%Creator comment\n * rSetupData: JobData that apply to this job\n * pGraphics: the graphics used to print this job;\n * this graphics must live until End\/AbortJob has returned\n *\/\n sal_Bool StartJob (const rtl::OUString& rFileName,\n int nMode,\n const rtl::OUString& rJobName,\n const rtl::OUString& rAppName,\n const JobData& rSetupData,\n PrinterGfx* pGraphics\n );\n sal_Bool EndJob ();\n\n sal_Bool AbortJob ();\n\n sal_Bool StartPage (const JobData& rJobSetup, sal_Bool bNewJobData);\n sal_Bool EndPage ();\n\n sal_uInt32 GetErrorCode ();\n};\n\n} \/* namespace psp *\/\n\n#endif \/* _PSPRINT_PRINTERJOB_HXX_ *\/\n\n<commit_msg>INTEGRATION: CWS warnings01 (1.8.10); FILE MERGED 2005\/10\/28 10:53:36 pl 1.8.10.1: #i55991# removed warnings for solaris platform<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: printerjob.hxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 10:23:13 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PSPRINT_PRINTERJOB_HXX_\n#define _PSPRINT_PRINTERJOB_HXX_\n\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n#ifndef _PSPRINT_JOBDATA_HXX_\n#include <psprint\/jobdata.hxx>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _RTL_STRING_HXX_\n#include <rtl\/string.hxx>\n#endif\n\nnamespace psp {\n\n\/\/ forward declarations\nclass PrinterGfx;\n\n\nclass PrinterJob\n{\nprivate: \/\/ private data\n\n rtl::OUString maSpoolDirName;\n rtl::OUString maFileName; \/\/ empty: spool to command, else spool to named file\n rtl::OUString maJobTitle;\n int mnFileMode;\n\n osl::File* mpJobHeader;\n osl::File* mpJobTrailer;\n\n std::list< osl::File* > maPageList;\n std::list< osl::File* > maHeaderList;\n\n JobData m_aDocumentJobData;\n JobData m_aLastJobData;\n PrinterGfx* m_pGraphics;\n\n sal_uInt32 mnResolution;\n\n sal_uInt32 mnWidthPt;\n sal_uInt32 mnHeightPt;\n sal_uInt32 mnMaxWidthPt;\n sal_uInt32 mnMaxHeightPt;\n\n sal_uInt32 mnLMarginPt;\n sal_uInt32 mnRMarginPt;\n sal_uInt32 mnTMarginPt;\n sal_uInt32 mnBMarginPt;\n\n double mfXScale;\n double mfYScale;\n\n sal_Int32 mnErrorCode;\n\nprivate: \/\/ private methods\n\n osl::File* CreateSpoolFile (const rtl::OUString& rName,\n const rtl::OUString& rExtension);\n void InitPaperSize (const JobData& rJobSetup);\n\n bool writeFeatureList( osl::File* pFile, const JobData&, bool bDocumentSetup );\n bool writeSetup( osl::File* pFile, const JobData& );\n bool writePageSetup( osl::File* pFile, const JobData& );\n void writeJobPatch( osl::File* File, const JobData& );\n bool writeProlog (osl::File* pFile, const JobData& );\n\npublic: \/\/ for usage in PrinterGfx\n\n sal_uInt32 GetResolution () const { return mnResolution; }\n void GetScale (double &rXScale, double &rYScale) const;\n sal_uInt16 GetDepth () const;\n sal_uInt16 GetPostscriptLevel (const JobData *pJobData = NULL) const;\n sal_Bool IsColorPrinter () const;\n\n osl::File* GetDocumentHeader ();\n osl::File* GetDocumentTrailer ();\n osl::File* GetCurrentPageHeader ();\n osl::File* GetCurrentPageBody ();\n\n const ::rtl::OUString& GetPrinterName() const { return m_aLastJobData.m_aPrinterName; }\n\npublic:\n PrinterJob ();\n ~PrinterJob ();\n\n \/* rFileName: if length is greater than 0 save resulting PostScript\n * to named file.\n * nMode: only meaningful when saving to file: if nonzero, try\n * to impose the mode on the resulting file's inode; for nonexistant\n * files use open, for existant files try a chmod\n * rJobName: text to appear in the %%Title comment\n * rAppName: text to appear in the %%Creator comment\n * rSetupData: JobData that apply to this job\n * pGraphics: the graphics used to print this job;\n * this graphics must live until End\/AbortJob has returned\n *\/\n sal_Bool StartJob (const rtl::OUString& rFileName,\n int nMode,\n const rtl::OUString& rJobName,\n const rtl::OUString& rAppName,\n const JobData& rSetupData,\n PrinterGfx* pGraphics\n );\n sal_Bool EndJob ();\n\n sal_Bool AbortJob ();\n\n sal_Bool StartPage (const JobData& rJobSetup);\n sal_Bool EndPage ();\n\n sal_uInt32 GetErrorCode ();\n};\n\n} \/* namespace psp *\/\n\n#endif \/* _PSPRINT_PRINTERJOB_HXX_ *\/\n\n<|endoftext|>"} {"text":"<commit_before>#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n\n#ifndef NDEBUG\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/Support\/Debug.h\"\n#endif\n\n#include <vector>\n#include <random>\n\nusing namespace llvm;\n\nnamespace {\nclass ObfuscateZero : public BasicBlockPass {\n std::vector<Value *> IntegerVect;\n std::default_random_engine Generator;\n\npublic:\n static char ID;\n\n ObfuscateZero() : BasicBlockPass(ID) {}\n\n virtual bool runOnBasicBlock(BasicBlock &BB) override {\n IntegerVect.clear();\n bool modified = false;\n\n \/\/ Not iterating from the beginning to avoid obfuscation of Phi instructions\n \/\/ parameters\n for (typename BasicBlock::iterator I = BB.getFirstInsertionPt(),\n end = BB.end();\n I != end; ++I) {\n Instruction &Inst = *I;\n if (isValidCandidateInstruction(Inst)) {\n for (size_t i{0}; i < Inst.getNumOperands(); ++i) {\n if (Constant *C = isValidCandidateOperand(Inst.getOperand(i))) {\n if (Value *New_val = replaceZero(Inst, C)) {\n Inst.setOperand(i, New_val);\n modified = true;\n } else {\n \/\/dbgs() << \"ObfuscateZero: could not rand pick a variable for replacement\\n\";\n }\n }\n }\n }\n registerInteger(Inst);\n }\n\n#ifndef NDEBUG\n verifyFunction(*BB.getParent());\n#endif\n return modified;\n }\n\nprivate:\n bool isValidCandidateInstruction(Instruction &Inst) {\n if (isa<GetElementPtrInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring GEP\\n\";\n return false;\n } else if (isa<SwitchInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring Switch\\n\";\n return false;\n } else if (isa<CallInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring Calls\\n\";\n return false;\n } else {\n return true;\n }\n }\n\n Constant *isValidCandidateOperand(Value *V) {\n if (Constant *C = dyn_cast<Constant>(V)) {\n \/\/ Checking constant eligibility\n if (isa<PointerType>(C->getType())) {\n \/\/ dbgs() << \"Ignoring NULL pointers\\n\";\n return nullptr;\n } else if (C->getType()->isFloatingPointTy()) {\n \/\/ dbgs() << \"Ignoring Floats 0\\n\";\n return nullptr;\n } else if (C->isNullValue()) {\n return C;\n } else {\n return nullptr;\n }\n } else {\n return nullptr;\n }\n }\n\n void registerInteger(Value &V) {\n if (V.getType()->isIntegerTy())\n IntegerVect.emplace_back(&V);\n }\n\n Value *replaceZero(Instruction &Inst, Value *VReplace) {\n \/\/ Replacing 0 by:\n \/\/ prime1 * ((x | any1)**2) != prime2 * ((y | any2)**2)\n \/\/ with prime1 != prime2 and any1 != 0 and any2 != 0\n using prime_type = uint32_t;\n \/\/ FIXME : replace by dynamic generation\n const prime_type p1 = 431, p2 = 277;\n\n Type *ReplacedType = VReplace->getType(),\n *IntermediaryType = IntegerType::get(Inst.getParent()->getContext(),\n sizeof(prime_type) * 8);\n\n if (IntegerVect.size() < 1) {\n return nullptr;\n }\n\n std::uniform_int_distribution<size_t> Rand(0, IntegerVect.size() - 1);\n std::uniform_int_distribution<size_t> RandAny(1, 10);\n\n size_t Index1 = Rand(Generator), Index2 = Rand(Generator);\n\n \/\/ Masking Any1 and Any2 to avoid overflow in the obsfuscation\n Constant *any1 = ConstantInt::get(IntermediaryType, 1 + RandAny(Generator)),\n *any2 = ConstantInt::get(IntermediaryType, 1 + RandAny(Generator)),\n *prime1 = ConstantInt::get(IntermediaryType, p1),\n *prime2 = ConstantInt::get(IntermediaryType, p2),\n \/\/ Bitmasks to prevent overflow\n *OverflowMaskLHS = ConstantInt::get(IntermediaryType, 0x00000007),\n *OverflowMaskRHS = ConstantInt::get(IntermediaryType, 0x00000007);\n\n IRBuilder<> Builder(&Inst);\n\n \/\/ lhs\n \/\/ To avoid overflow\n Value *LhsCast =\n Builder.CreateZExtOrTrunc(IntegerVect.at(Index1), IntermediaryType);\n registerInteger(*LhsCast);\n Value *LhsAnd = Builder.CreateAnd(LhsCast, OverflowMaskLHS);\n registerInteger(*LhsAnd);\n Value *LhsOr = Builder.CreateOr(LhsAnd, any1);\n registerInteger(*LhsOr);\n Value *LhsSquare = Builder.CreateMul(LhsOr, LhsOr);\n registerInteger(*LhsSquare);\n Value *LhsTot = Builder.CreateMul(LhsSquare, prime1);\n registerInteger(*LhsTot);\n\n \/\/ rhs\n Value *RhsCast =\n Builder.CreateZExtOrTrunc(IntegerVect.at(Index2), IntermediaryType);\n registerInteger(*RhsCast);\n Value *RhsAnd = Builder.CreateAnd(RhsCast, OverflowMaskRHS);\n registerInteger(*RhsAnd);\n Value *RhsOr = Builder.CreateOr(RhsAnd, any2);\n registerInteger(*RhsOr);\n Value *RhsSquare = Builder.CreateMul(RhsOr, RhsOr);\n registerInteger(*RhsSquare);\n Value *RhsTot = Builder.CreateMul(RhsSquare, prime2);\n registerInteger(*RhsTot);\n\n \/\/ comp\n Value *comp =\n Builder.CreateICmp(CmpInst::Predicate::ICMP_EQ, LhsTot, RhsTot);\n registerInteger(*comp);\n Value *castComp = Builder.CreateZExt(comp, ReplacedType);\n registerInteger(*castComp);\n\n return castComp;\n }\n};\n}\n\nchar ObfuscateZero::ID = 0;\nstatic RegisterPass<ObfuscateZero> X(\"ObfuscateZero\", \"Obfuscates zeroes\",\n false, false);\n\n\/\/ register pass for clang use\nstatic void registerObfuscateZeroPass(const PassManagerBuilder &,\n PassManagerBase &PM) {\n PM.add(new ObfuscateZero());\n}\nstatic RegisterStandardPasses\n RegisterMBAPass(PassManagerBuilder::EP_EarlyAsPossible,\n registerObfuscateZeroPass);\n<commit_msg>Adding randomization of prime numbers<commit_after>#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/IR\/Constants.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include \"llvm\/IR\/LegacyPassManager.h\"\n#include \"llvm\/Transforms\/Utils\/BasicBlockUtils.h\"\n#include \"llvm\/Transforms\/IPO\/PassManagerBuilder.h\"\n\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n\n#ifndef NDEBUG\n#include \"llvm\/IR\/Verifier.h\"\n#include \"llvm\/Support\/Debug.h\"\n#endif\n\n#include <vector>\n#include <random>\n\nusing namespace llvm;\n\nnamespace {\n using prime_type = uint32_t;\n\nstatic const prime_type Prime_array[] = {\n 2 , 3 , 5 , 7, 11, 13, 17, 19, 23, 29,\n 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,\n 73, 79, 83, 89, 97, 101, 103, 107, 109, 113,\n 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,\n 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,\n 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,\n 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,\n 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,\n 419, 421, 431, 433, 439, 443, 449, 457, 461, 463,\n 467, 479, 487, 491, 499, 503, 509, 521, 523, 541,\n 547, 557, 563, 569, 571, 577, 587, 593, 599, 601,\n 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,\n 661, 673, 677, 683, 691, 701, 709, 719, 727, 733,\n 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,\n 811, 821, 823, 827, 829, 839, 853, 857, 859, 863,\n 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,\n 947, 953, 967, 971, 977, 983, 991, 997};\n\nclass ObfuscateZero : public BasicBlockPass {\n std::vector<Value *> IntegerVect;\n std::default_random_engine Generator;\n\npublic:\n\n static char ID;\n\n ObfuscateZero() : BasicBlockPass(ID) {}\n\n virtual bool runOnBasicBlock(BasicBlock &BB) override {\n IntegerVect.clear();\n bool modified = false;\n\n \/\/ Not iterating from the beginning to avoid obfuscation of Phi instructions\n \/\/ parameters\n for (typename BasicBlock::iterator I = BB.getFirstInsertionPt(),\n end = BB.end();\n I != end; ++I) {\n Instruction &Inst = *I;\n if (isValidCandidateInstruction(Inst)) {\n for (size_t i{0}; i < Inst.getNumOperands(); ++i) {\n if (Constant *C = isValidCandidateOperand(Inst.getOperand(i))) {\n if (Value *New_val = replaceZero(Inst, C)) {\n Inst.setOperand(i, New_val);\n modified = true;\n } else {\n \/\/dbgs() << \"ObfuscateZero: could not rand pick a variable for replacement\\n\";\n }\n }\n }\n }\n registerInteger(Inst);\n }\n\n#ifndef NDEBUG\n verifyFunction(*BB.getParent());\n#endif\n return modified;\n }\n\nprivate:\n bool isValidCandidateInstruction(Instruction &Inst) {\n if (isa<GetElementPtrInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring GEP\\n\";\n return false;\n } else if (isa<SwitchInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring Switch\\n\";\n return false;\n } else if (isa<CallInst>(&Inst)) {\n \/\/ dbgs() << \"Ignoring Calls\\n\";\n return false;\n } else {\n return true;\n }\n }\n\n Constant *isValidCandidateOperand(Value *V) {\n if (Constant *C = dyn_cast<Constant>(V)) {\n \/\/ Checking constant eligibility\n if (isa<PointerType>(C->getType())) {\n \/\/ dbgs() << \"Ignoring NULL pointers\\n\";\n return nullptr;\n } else if (C->getType()->isFloatingPointTy()) {\n \/\/ dbgs() << \"Ignoring Floats 0\\n\";\n return nullptr;\n } else if (C->isNullValue()) {\n return C;\n } else {\n return nullptr;\n }\n } else {\n return nullptr;\n }\n }\n\n void registerInteger(Value &V) {\n if (V.getType()->isIntegerTy())\n IntegerVect.emplace_back(&V);\n }\n\n \/\/ Return a random prime number not equal to DifferentFrom\n \/\/ If an error occurs returns 0\n prime_type getPrime(prime_type DifferentFrom = 0) {\n static std::uniform_int_distribution<prime_type> Rand(0, sizeof(Prime_array) \/ sizeof(prime_type));\n size_t MaxLoop = 10;\n prime_type Prime;\n\n do {\n Prime = Prime_array[Rand(Generator)];\n } while(Prime == DifferentFrom && --MaxLoop);\n\n if(!MaxLoop) {\n return 0;\n }\n\n return Prime;\n }\n\n Value *replaceZero(Instruction &Inst, Value *VReplace) {\n \/\/ Replacing 0 by:\n \/\/ prime1 * ((x | any1)**2) != prime2 * ((y | any2)**2)\n \/\/ with prime1 != prime2 and any1 != 0 and any2 != 0\n prime_type p1 = getPrime(),\n p2 = getPrime(p1);\n\n if(p2 == 0 || p1 == 0)\n return nullptr;\n\n Type *ReplacedType = VReplace->getType(),\n *IntermediaryType = IntegerType::get(Inst.getParent()->getContext(),\n sizeof(prime_type) * 8);\n\n if (IntegerVect.size() < 1) {\n return nullptr;\n }\n\n std::uniform_int_distribution<size_t> Rand(0, IntegerVect.size() - 1);\n std::uniform_int_distribution<size_t> RandAny(1, 10);\n\n size_t Index1 = Rand(Generator), Index2 = Rand(Generator);\n\n \/\/ Masking Any1 and Any2 to avoid overflow in the obsfuscation\n Constant *any1 = ConstantInt::get(IntermediaryType, 1 + RandAny(Generator)),\n *any2 = ConstantInt::get(IntermediaryType, 1 + RandAny(Generator)),\n *prime1 = ConstantInt::get(IntermediaryType, p1),\n *prime2 = ConstantInt::get(IntermediaryType, p2),\n \/\/ Bitmasks to prevent overflow\n *OverflowMaskLHS = ConstantInt::get(IntermediaryType, 0x00000007),\n *OverflowMaskRHS = ConstantInt::get(IntermediaryType, 0x00000007);\n\n IRBuilder<> Builder(&Inst);\n\n \/\/ lhs\n \/\/ To avoid overflow\n Value *LhsCast =\n Builder.CreateZExtOrTrunc(IntegerVect.at(Index1), IntermediaryType);\n registerInteger(*LhsCast);\n Value *LhsAnd = Builder.CreateAnd(LhsCast, OverflowMaskLHS);\n registerInteger(*LhsAnd);\n Value *LhsOr = Builder.CreateOr(LhsAnd, any1);\n registerInteger(*LhsOr);\n Value *LhsSquare = Builder.CreateMul(LhsOr, LhsOr);\n registerInteger(*LhsSquare);\n Value *LhsTot = Builder.CreateMul(LhsSquare, prime1);\n registerInteger(*LhsTot);\n\n \/\/ rhs\n Value *RhsCast =\n Builder.CreateZExtOrTrunc(IntegerVect.at(Index2), IntermediaryType);\n registerInteger(*RhsCast);\n Value *RhsAnd = Builder.CreateAnd(RhsCast, OverflowMaskRHS);\n registerInteger(*RhsAnd);\n Value *RhsOr = Builder.CreateOr(RhsAnd, any2);\n registerInteger(*RhsOr);\n Value *RhsSquare = Builder.CreateMul(RhsOr, RhsOr);\n registerInteger(*RhsSquare);\n Value *RhsTot = Builder.CreateMul(RhsSquare, prime2);\n registerInteger(*RhsTot);\n\n \/\/ comp\n Value *comp =\n Builder.CreateICmp(CmpInst::Predicate::ICMP_EQ, LhsTot, RhsTot);\n registerInteger(*comp);\n Value *castComp = Builder.CreateZExt(comp, ReplacedType);\n registerInteger(*castComp);\n\n return castComp;\n }\n};\n}\n\nchar ObfuscateZero::ID = 0;\nstatic RegisterPass<ObfuscateZero> X(\"ObfuscateZero\", \"Obfuscates zeroes\",\n false, false);\n\n\/\/ register pass for clang use\nstatic void registerObfuscateZeroPass(const PassManagerBuilder &,\n PassManagerBase &PM) {\n PM.add(new ObfuscateZero());\n}\nstatic RegisterStandardPasses\n RegisterMBAPass(PassManagerBuilder::EP_EarlyAsPossible,\n registerObfuscateZeroPass);\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: jobdata.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: pl $ $Date: 2002-06-19 10:53:34 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <psprint\/jobdata.hxx>\n#include <psprint\/printerinfomanager.hxx>\n#include <tools\/stream.hxx>\n\n#ifdef SOLARIS\n#include <alloca.h>\n#else\n#include <stdlib.h>\n#endif\n\nusing namespace psp;\nusing namespace rtl;\n\nbool JobData::getStreamBuffer( void*& pData, int& bytes )\n{\n \/\/ consistency checks\n if( ! m_pParser )\n m_pParser = m_aContext.getParser();\n if( m_pParser != m_aContext.getParser() ||\n ! m_pParser )\n return false;\n\n SvMemoryStream aStream;\n ByteString aLine;\n\n \/\/ write header job data\n aStream.WriteLine( \"JobData 1\" );\n\n aLine = \"printer=\";\n aLine += ByteString( String( m_aPrinterName ), RTL_TEXTENCODING_UTF8 );\n aStream.WriteLine( aLine );\n\n aLine = \"orientation=\";\n aLine += m_eOrientation == orientation::Landscape ? \"Landscape\" : \"Portrait\";\n aStream.WriteLine( aLine );\n\n aLine = \"copies=\";\n aLine += ByteString::CreateFromInt32( m_nCopies );\n aStream.WriteLine( aLine );\n\n aLine = \"scale=\";\n aLine += ByteString::CreateFromInt32( m_nScale );\n aStream.WriteLine( aLine );\n\n aLine = \"margindajustment=\";\n aLine += ByteString::CreateFromInt32( m_nLeftMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nRightMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nTopMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nBottomMarginAdjust );\n aStream.WriteLine( aLine );\n\n aLine = \"colordepth=\";\n aLine += ByteString::CreateFromInt32( m_nColorDepth );\n aStream.WriteLine( aLine );\n\n aLine = \"pslevel=\";\n aLine += ByteString::CreateFromInt32( m_nPSLevel );\n aStream.WriteLine( aLine );\n\n aLine = \"colordevice=\";\n aLine += ByteString::CreateFromInt32( m_nColorDevice );\n aStream.WriteLine( aLine );\n\n \/\/ now append the PPDContext stream buffer\n aStream.WriteLine( \"PPDContexData\" );\n ULONG nBytes;\n void* pContextBuffer = m_aContext.getStreamableBuffer( nBytes );\n if( nBytes )\n aStream.Write( pContextBuffer, nBytes );\n\n \/\/ success\n pData = rtl_allocateMemory( bytes = aStream.GetSize() );\n memcpy( pData, aStream.GetData(), bytes );\n return true;\n}\n\nbool JobData::constructFromStreamBuffer( void* pData, int bytes, JobData& rJobData )\n{\n SvMemoryStream aStream( pData, bytes, STREAM_READ );\n ByteString aLine;\n bool bVersion = false;\n bool bPrinter = false;\n bool bOrientation = false;\n bool bCopies = false;\n bool bScale = false;\n bool bContext = false;\n bool bMargin = false;\n bool bColorDepth = false;\n bool bColorDevice = false;\n bool bPSLevel = false;\n while( ! aStream.IsEof() )\n {\n aStream.ReadLine( aLine );\n if( aLine.CompareTo( \"JobData\", 7 ) == COMPARE_EQUAL )\n bVersion = true;\n else if( aLine.CompareTo( \"printer=\", 8 ) == COMPARE_EQUAL )\n {\n bPrinter = true;\n rJobData.m_aPrinterName = String( aLine.Copy( 8 ), RTL_TEXTENCODING_UTF8 );\n }\n else if( aLine.CompareTo( \"orientation=\", 12 ) == COMPARE_EQUAL )\n {\n bOrientation = true;\n rJobData.m_eOrientation = aLine.Copy( 12 ).EqualsIgnoreCaseAscii( \"landscape\" ) ? orientation::Landscape : orientation::Portrait;\n }\n else if( aLine.CompareTo( \"copies=\", 7 ) == COMPARE_EQUAL )\n {\n bCopies = true;\n rJobData.m_nCopies = aLine.Copy( 7 ).ToInt32();\n }\n else if( aLine.CompareTo( \"scale=\", 6 ) == COMPARE_EQUAL )\n {\n bScale = true;\n rJobData.m_nScale = aLine.Copy( 6 ).ToInt32();\n }\n else if( aLine.CompareTo( \"margindajustment=\",17 ) == COMPARE_EQUAL )\n {\n bMargin = true;\n ByteString aValues( aLine.Copy( 17 ) );\n rJobData.m_nLeftMarginAdjust = aValues.GetToken( 0, ',' ).ToInt32();\n rJobData.m_nRightMarginAdjust = aValues.GetToken( 1, ',' ).ToInt32();\n rJobData.m_nTopMarginAdjust = aValues.GetToken( 2, ',' ).ToInt32();\n rJobData.m_nBottomMarginAdjust = aValues.GetToken( 3, ',' ).ToInt32();\n }\n else if( aLine.CompareTo( \"colordepth=\", 11 ) == COMPARE_EQUAL )\n {\n bColorDepth = true;\n rJobData.m_nColorDepth = aLine.Copy( 11 ).ToInt32();\n }\n else if( aLine.CompareTo( \"colordevice=\", 12 ) == COMPARE_EQUAL )\n {\n bColorDevice = true;\n rJobData.m_nColorDevice = aLine.Copy( 12 ).ToInt32();\n }\n else if( aLine.CompareTo( \"pslevel=\", 8 ) == COMPARE_EQUAL )\n {\n bPSLevel = true;\n rJobData.m_nPSLevel = aLine.Copy( 8 ).ToInt32();\n }\n else if( aLine.Equals( \"PPDContexData\" ) )\n {\n if( bPrinter )\n {\n PrinterInfoManager& rManager = PrinterInfoManager::get();\n const PrinterInfo& rInfo = rManager.getPrinterInfo( rJobData.m_aPrinterName );\n rJobData.m_pParser = PPDParser::getParser( rInfo.m_aDriverName );\n if( rJobData.m_pParser )\n {\n rJobData.m_aContext.setParser( rJobData.m_pParser );\n int nBytes = bytes - aStream.Tell();\n void* pRemain = alloca( bytes - aStream.Tell() );\n aStream.Read( pRemain, nBytes );\n rJobData.m_aContext.rebuildFromStreamBuffer( pRemain, nBytes );\n bContext = true;\n }\n }\n }\n }\n\n return bVersion && bPrinter && bOrientation && bCopies && bScale && bContext && bMargin && bPSLevel && bColorDevice && bColorDepth;\n}\n<commit_msg>INTEGRATION: CWS valgrind01 (1.2.88); FILE MERGED 2003\/10\/30 17:43:00 hr 1.2.88.1: #i20184#: JobData::getStreamBuffer() return buffer tailored to the actual size of the stream instead to the size of the stream buffer<commit_after>\/*************************************************************************\n *\n * $RCSfile: jobdata.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2003-11-25 10:30:17 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <psprint\/jobdata.hxx>\n#include <psprint\/printerinfomanager.hxx>\n#include <tools\/stream.hxx>\n\n#ifdef SOLARIS\n#include <alloca.h>\n#else\n#include <stdlib.h>\n#endif\n\nusing namespace psp;\nusing namespace rtl;\n\nbool JobData::getStreamBuffer( void*& pData, int& bytes )\n{\n \/\/ consistency checks\n if( ! m_pParser )\n m_pParser = m_aContext.getParser();\n if( m_pParser != m_aContext.getParser() ||\n ! m_pParser )\n return false;\n\n SvMemoryStream aStream;\n ByteString aLine;\n\n \/\/ write header job data\n aStream.WriteLine( \"JobData 1\" );\n\n aLine = \"printer=\";\n aLine += ByteString( String( m_aPrinterName ), RTL_TEXTENCODING_UTF8 );\n aStream.WriteLine( aLine );\n\n aLine = \"orientation=\";\n aLine += m_eOrientation == orientation::Landscape ? \"Landscape\" : \"Portrait\";\n aStream.WriteLine( aLine );\n\n aLine = \"copies=\";\n aLine += ByteString::CreateFromInt32( m_nCopies );\n aStream.WriteLine( aLine );\n\n aLine = \"scale=\";\n aLine += ByteString::CreateFromInt32( m_nScale );\n aStream.WriteLine( aLine );\n\n aLine = \"margindajustment=\";\n aLine += ByteString::CreateFromInt32( m_nLeftMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nRightMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nTopMarginAdjust );\n aLine += ',';\n aLine += ByteString::CreateFromInt32( m_nBottomMarginAdjust );\n aStream.WriteLine( aLine );\n\n aLine = \"colordepth=\";\n aLine += ByteString::CreateFromInt32( m_nColorDepth );\n aStream.WriteLine( aLine );\n\n aLine = \"pslevel=\";\n aLine += ByteString::CreateFromInt32( m_nPSLevel );\n aStream.WriteLine( aLine );\n\n aLine = \"colordevice=\";\n aLine += ByteString::CreateFromInt32( m_nColorDevice );\n aStream.WriteLine( aLine );\n\n \/\/ now append the PPDContext stream buffer\n aStream.WriteLine( \"PPDContexData\" );\n ULONG nBytes;\n void* pContextBuffer = m_aContext.getStreamableBuffer( nBytes );\n if( nBytes )\n aStream.Write( pContextBuffer, nBytes );\n\n \/\/ success\n pData = rtl_allocateMemory( bytes = aStream.Tell() );\n memcpy( pData, aStream.GetData(), bytes );\n return true;\n}\n\nbool JobData::constructFromStreamBuffer( void* pData, int bytes, JobData& rJobData )\n{\n SvMemoryStream aStream( pData, bytes, STREAM_READ );\n ByteString aLine;\n bool bVersion = false;\n bool bPrinter = false;\n bool bOrientation = false;\n bool bCopies = false;\n bool bScale = false;\n bool bContext = false;\n bool bMargin = false;\n bool bColorDepth = false;\n bool bColorDevice = false;\n bool bPSLevel = false;\n while( ! aStream.IsEof() )\n {\n aStream.ReadLine( aLine );\n if( aLine.CompareTo( \"JobData\", 7 ) == COMPARE_EQUAL )\n bVersion = true;\n else if( aLine.CompareTo( \"printer=\", 8 ) == COMPARE_EQUAL )\n {\n bPrinter = true;\n rJobData.m_aPrinterName = String( aLine.Copy( 8 ), RTL_TEXTENCODING_UTF8 );\n }\n else if( aLine.CompareTo( \"orientation=\", 12 ) == COMPARE_EQUAL )\n {\n bOrientation = true;\n rJobData.m_eOrientation = aLine.Copy( 12 ).EqualsIgnoreCaseAscii( \"landscape\" ) ? orientation::Landscape : orientation::Portrait;\n }\n else if( aLine.CompareTo( \"copies=\", 7 ) == COMPARE_EQUAL )\n {\n bCopies = true;\n rJobData.m_nCopies = aLine.Copy( 7 ).ToInt32();\n }\n else if( aLine.CompareTo( \"scale=\", 6 ) == COMPARE_EQUAL )\n {\n bScale = true;\n rJobData.m_nScale = aLine.Copy( 6 ).ToInt32();\n }\n else if( aLine.CompareTo( \"margindajustment=\",17 ) == COMPARE_EQUAL )\n {\n bMargin = true;\n ByteString aValues( aLine.Copy( 17 ) );\n rJobData.m_nLeftMarginAdjust = aValues.GetToken( 0, ',' ).ToInt32();\n rJobData.m_nRightMarginAdjust = aValues.GetToken( 1, ',' ).ToInt32();\n rJobData.m_nTopMarginAdjust = aValues.GetToken( 2, ',' ).ToInt32();\n rJobData.m_nBottomMarginAdjust = aValues.GetToken( 3, ',' ).ToInt32();\n }\n else if( aLine.CompareTo( \"colordepth=\", 11 ) == COMPARE_EQUAL )\n {\n bColorDepth = true;\n rJobData.m_nColorDepth = aLine.Copy( 11 ).ToInt32();\n }\n else if( aLine.CompareTo( \"colordevice=\", 12 ) == COMPARE_EQUAL )\n {\n bColorDevice = true;\n rJobData.m_nColorDevice = aLine.Copy( 12 ).ToInt32();\n }\n else if( aLine.CompareTo( \"pslevel=\", 8 ) == COMPARE_EQUAL )\n {\n bPSLevel = true;\n rJobData.m_nPSLevel = aLine.Copy( 8 ).ToInt32();\n }\n else if( aLine.Equals( \"PPDContexData\" ) )\n {\n if( bPrinter )\n {\n PrinterInfoManager& rManager = PrinterInfoManager::get();\n const PrinterInfo& rInfo = rManager.getPrinterInfo( rJobData.m_aPrinterName );\n rJobData.m_pParser = PPDParser::getParser( rInfo.m_aDriverName );\n if( rJobData.m_pParser )\n {\n rJobData.m_aContext.setParser( rJobData.m_pParser );\n int nBytes = bytes - aStream.Tell();\n void* pRemain = alloca( bytes - aStream.Tell() );\n aStream.Read( pRemain, nBytes );\n rJobData.m_aContext.rebuildFromStreamBuffer( pRemain, nBytes );\n bContext = true;\n }\n }\n }\n }\n\n return bVersion && bPrinter && bOrientation && bCopies && bScale && bContext && bMargin && bPSLevel && bColorDevice && bColorDepth;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Reduce base energy requirement for launching missiles by 80%, and multiply by lvl**1.5 instead of **2.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Update a comment.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * SessionProjects.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: detecting copy\/move\/network:\n\/*\n - read INDEX\n - read id file\n\n - if INDEX contains id mapped to correct path then use\n\n - if INDEX doesn't not contain id or path then create new\n\n - if INDEX has id but path doesn't match then may have been\n a move or a copy so create a copy of the scratch dir and\n associate it with a new id\n\n - if has an id file but nothing in the index at all then\n create a brand new entry\/dir using that id\n*\/\n\n\n\n#include <session\/projects\/SessionProjects.hpp>\n\n#include <core\/FilePath.hpp>\n#include <core\/Settings.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/r_util\/RProjectFile.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionUserSettings.hpp>\n#include <session\/SessionPersistentState.hpp>\n\nusing namespace core;\n\nnamespace session {\nnamespace projects {\n\nnamespace {\n\nProjectContext s_projectContext;\n\n\nvoid onSuspend(Settings*)\n{\n \/\/ on suspend write out current project path as the one to use\n \/\/ on resume. we read this back in initalize (rather than in\n \/\/ the onResume handler) becuase we need it very early in the\n \/\/ processes lifetime and onResume happens too late\n persistentState().setNextSessionProjectPath(s_projectContext.file());\n}\n\nvoid onResume(const Settings&) {}\n\nError createProject(const json::JsonRpcRequest& request,\n json::JsonRpcResponse* pResponse)\n{\n \/\/ determine project file path\n std::string projectFile;\n Error error = json::readParam(request.params, 0, &projectFile);\n if (error)\n return error;\n FilePath projectFilePath = module_context::resolveAliasedPath(projectFile);\n\n \/\/ new uuid for project\n std::string uuid = core::system::generateUuid();\n\n \/\/ create the project file\n return r_util::writeProjectFile(uuid, projectFilePath);\n}\n\n} \/\/ anonymous namespace\n\n\nvoid startup()\n{\n \/\/ register suspend handler\n using namespace module_context;\n addSuspendHandler(SuspendHandler(onSuspend, onResume));\n\n \/\/ determine project file path\n FilePath projectFilePath;\n\n \/\/ see if there is a project path hard-wired for the next session\n \/\/ (this would be used for a switch to project or for the resuming of\n \/\/ a suspended session)\n FilePath nextSessionProjectPath = persistentState().nextSessionProjectPath();\n if (!nextSessionProjectPath.empty())\n {\n \/\/ reset next session project path so its a one shot deal\n persistentState().setNextSessionProjectPath(FilePath());\n\n \/\/ clear any initial context settings which may be leftover\n \/\/ by a re-instatiation of rsession by desktop\n session::options().clearInitialContextSettings();\n\n \/\/ set project path\n projectFilePath = nextSessionProjectPath;\n }\n\n \/\/ check for envrionment variable (file association)\n else if (!session::options().initialProjectPath().empty())\n {\n projectFilePath = session::options().initialProjectPath();\n }\n\n \/\/ check for other working dir override (implies a launch of a file\n \/\/ but not of a project). this code path is here to prevent\n \/\/ the next code path from executing\n else if (!session::options().initialWorkingDirOverride().empty())\n {\n projectFilePath = FilePath();\n }\n\n \/\/ check for restore based on settings\n else if (userSettings().alwaysRestoreLastProject() &&\n !userSettings().lastProjectPath().empty())\n {\n projectFilePath = userSettings().lastProjectPath();\n }\n\n \/\/ else no active project for this session\n else\n {\n projectFilePath = FilePath();\n }\n\n \/\/ if we have a project file path then try to initialize the\n \/\/ project context (show a warning to the user if we can't)\n if (!projectFilePath.empty())\n {\n std::string userErrMsg;\n Error error = s_projectContext.initialize(projectFilePath, &userErrMsg);\n if (error)\n {\n \/\/ log the error\n error.addProperty(\"project-file\", projectFilePath.absolutePath());\n error.addProperty(\"user-msg\", userErrMsg);\n LOG_ERROR(error);\n\n \/\/ show the error\n std::string msg =\n \"Project '\" + projectFilePath.absolutePath() + \"' \"\n \"could not be opened: \" + userErrMsg;\n module_context::showErrorMessage(\"Error Opening Project\", msg);\n }\n }\n\n \/\/ save the active project path for the next session (may be empty)\n userSettings().setLastProjectPath(s_projectContext.file());\n}\n\nError initialize()\n{\n using boost::bind;\n using namespace module_context;\n ExecBlock initBlock ;\n initBlock.addFunctions()\n (bind(registerRpcMethod, \"create_project\", createProject))\n ;\n return initBlock.execute();\n}\n\nconst ProjectContext& projectContext()\n{\n return s_projectContext;\n}\n\n} \/\/ namespace projects\n} \/\/ namesapce session\n\n<commit_msg>only attempt to restore a project once (so we don't keep trying to load a project which doesn't exist)<commit_after>\/*\n * SessionProjects.cpp\n *\n * Copyright (C) 2009-11 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n\/\/ TODO: detecting copy\/move\/network:\n\/*\n - read INDEX\n - read id file\n\n - if INDEX contains id mapped to correct path then use\n\n - if INDEX doesn't not contain id or path then create new\n\n - if INDEX has id but path doesn't match then may have been\n a move or a copy so create a copy of the scratch dir and\n associate it with a new id\n\n - if has an id file but nothing in the index at all then\n create a brand new entry\/dir using that id\n*\/\n\n\n\n#include <session\/projects\/SessionProjects.hpp>\n\n#include <core\/FilePath.hpp>\n#include <core\/Settings.hpp>\n#include <core\/Exec.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/system\/System.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/r_util\/RProjectFile.hpp>\n\n#include <session\/SessionModuleContext.hpp>\n#include <session\/SessionUserSettings.hpp>\n#include <session\/SessionPersistentState.hpp>\n\nusing namespace core;\n\nnamespace session {\nnamespace projects {\n\nnamespace {\n\nProjectContext s_projectContext;\n\n\nvoid onSuspend(Settings*)\n{\n \/\/ on suspend write out current project path as the one to use\n \/\/ on resume. we read this back in initalize (rather than in\n \/\/ the onResume handler) becuase we need it very early in the\n \/\/ processes lifetime and onResume happens too late\n persistentState().setNextSessionProjectPath(s_projectContext.file());\n}\n\nvoid onResume(const Settings&) {}\n\nError createProject(const json::JsonRpcRequest& request,\n json::JsonRpcResponse* pResponse)\n{\n \/\/ determine project file path\n std::string projectFile;\n Error error = json::readParam(request.params, 0, &projectFile);\n if (error)\n return error;\n FilePath projectFilePath = module_context::resolveAliasedPath(projectFile);\n\n \/\/ new uuid for project\n std::string uuid = core::system::generateUuid();\n\n \/\/ create the project file\n return r_util::writeProjectFile(uuid, projectFilePath);\n}\n\n} \/\/ anonymous namespace\n\n\nvoid startup()\n{\n \/\/ register suspend handler\n using namespace module_context;\n addSuspendHandler(SuspendHandler(onSuspend, onResume));\n\n \/\/ determine project file path\n FilePath projectFilePath;\n\n \/\/ see if there is a project path hard-wired for the next session\n \/\/ (this would be used for a switch to project or for the resuming of\n \/\/ a suspended session)\n FilePath nextSessionProjectPath = persistentState().nextSessionProjectPath();\n if (!nextSessionProjectPath.empty())\n {\n \/\/ reset next session project path so its a one shot deal\n persistentState().setNextSessionProjectPath(FilePath());\n\n \/\/ clear any initial context settings which may be leftover\n \/\/ by a re-instatiation of rsession by desktop\n session::options().clearInitialContextSettings();\n\n \/\/ set project path\n projectFilePath = nextSessionProjectPath;\n }\n\n \/\/ check for envrionment variable (file association)\n else if (!session::options().initialProjectPath().empty())\n {\n projectFilePath = session::options().initialProjectPath();\n }\n\n \/\/ check for other working dir override (implies a launch of a file\n \/\/ but not of a project). this code path is here to prevent\n \/\/ the next code path from executing\n else if (!session::options().initialWorkingDirOverride().empty())\n {\n projectFilePath = FilePath();\n }\n\n \/\/ check for restore based on settings\n else if (userSettings().alwaysRestoreLastProject() &&\n !userSettings().lastProjectPath().empty())\n {\n \/\/ get last project path\n projectFilePath = userSettings().lastProjectPath();\n\n \/\/ reset it to empty so that we only attempt to load the \"lastProject\"\n \/\/ a single time (this will be reset to the path below after we\n \/\/ clear the s_projectContext.initialize)\n userSettings().setLastProjectPath(FilePath());\n }\n\n \/\/ else no active project for this session\n else\n {\n projectFilePath = FilePath();\n }\n\n \/\/ if we have a project file path then try to initialize the\n \/\/ project context (show a warning to the user if we can't)\n if (!projectFilePath.empty())\n {\n std::string userErrMsg;\n Error error = s_projectContext.initialize(projectFilePath, &userErrMsg);\n if (error)\n {\n \/\/ log the error\n error.addProperty(\"project-file\", projectFilePath.absolutePath());\n error.addProperty(\"user-msg\", userErrMsg);\n LOG_ERROR(error);\n\n \/\/ show the error\n std::string msg =\n \"Project '\" + projectFilePath.absolutePath() + \"' \"\n \"could not be opened: \" + userErrMsg;\n module_context::showErrorMessage(\"Error Opening Project\", msg);\n }\n }\n\n \/\/ save the active project path for the next session (may be empty)\n userSettings().setLastProjectPath(s_projectContext.file());\n}\n\nError initialize()\n{\n using boost::bind;\n using namespace module_context;\n ExecBlock initBlock ;\n initBlock.addFunctions()\n (bind(registerRpcMethod, \"create_project\", createProject))\n ;\n return initBlock.execute();\n}\n\nconst ProjectContext& projectContext()\n{\n return s_projectContext;\n}\n\n} \/\/ namespace projects\n} \/\/ namesapce session\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Removing sync from file_util::Delete for ChromeOS.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Fix the final few remaining warnings in base<commit_after><|endoftext|>"} {"text":"<commit_before>\/*!\r\n \\copyright (c) RDO-Team, 2012\r\n \\file interface_db.h\r\n \\authors (cerevra@gmail.com)\r\n \\authors (rdo@rk9.bmstu.ru)\r\n \\date 15.11.2012\r\n \\brief \r\n \\indent 4T\r\n*\/\r\n\r\ntemplate <class T>\r\nvoid pushContext (T context)\r\n{\r\n\tpushContxt(bany<T>(context));\r\n}\r\n\r\ntemplate <class T>\r\nT popContext ()\r\n{\r\n\treturn any_cast<T>(popContxt());\r\n}\r\n<commit_msg> - починка<commit_after>\/*!\r\n \\copyright (c) RDO-Team, 2012\r\n \\file interface_db.h\r\n \\authors (cerevra@gmail.com)\r\n \\authors (rdo@rk9.bmstu.ru)\r\n \\date 15.11.2012\r\n \\brief \r\n \\indent 4T\r\n*\/\r\n\r\ntemplate <class T>\r\nvoid IDB::pushContext (T context)\r\n{\r\n\tpushContxt(boost::any(context));\r\n}\r\n\r\ntemplate <class T>\r\nT IDB::popContext ()\r\n{\r\n\treturn boost::any_cast<T>(popContxt());\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/bank00.cpp -- Bank class implementation\n\/\/version 00\n\n#include <iostream>\n#include <cstdlib>\n#include <ctime>\n#include \"bank00.h\"\n\nusing namespace std;\n\nvoid Bank::create_account()\n{\n\tsrand(time(NULL));\n\tcout<<\"Please enter your name.\"<<endl;\n\tgetline(cin, name);\n\tcout<<\"Please enter the amount you would like to deposit.\"<<endl;\n\tcin>>balance;\n\taccount_no = rand();\n\tcout<<\"Please enter a four digit number for your PIN.\"<<endl;\n\tcin>>pin;\n}\n\nvoid Bank::change_pin()\n{\n\tint new_pin = 0;\n\tcout<<\"Please enter a four digit number as your PIN.\"<<endl;\n\tcin>>new_pin;\n\tif(new_pin == pin)\n\t{\n\t\tcout<<\"New PIN cannot be same as old PIN.\"<<endl;\n\t\tcout<<\"Please enter a different PIN.\"<<endl;\n\t\tcin>>new_pin;\n\t\tpin = new_pin;\n\t}\n\telse\n\t\tpin = new_pin;\n}\n\nvoid Bank::withdraw()\n{\n\tdouble amount = 0.0;\n\tcout<<\"Please enter the amount.\"<<endl;\n\tcin>>amount;\n\tif(amount > balance)\n\t\tcout<<\"Withdrawal amount cannot be greater than the available balance.\"<<endl;\n\telse\n\t\tbalance -= amount;\n\tcout<<\"Available balance is $\"<<balance<<endl;\n\tcout<<\"Thank you.\"<<endl;\n}\n\nvoid Bank::display_balance()\n{\n\tcout<<\"Account Number: \"<<account_no<<endl;\n\tcout<<\"Balance $\"<<balance<<endl;\n\tcout<<\"Thank you.\"<<endl;\n}\n\nvoid Bank::authenticate()\n{\n\tint input_pin = 0, choice = 0;\n\tcout<<\"Please enter your PIN.\"<<endl;\n\tcin>>input_pin;\n\tif(input_pin == pin)\n\t{\n\t\tcout<<\"Hello \"<<name<<endl;\n\t\tcout<<\"Enter 1 to change pin.\"<<endl;\n\t\tcout<<\"Enter 2 to withdraw cash.\"<<endl;\n\t\tcout<<\"Enter 3 to check balance.\"<<endl;\n\t\tcout<<\"Enter 4 to quit.\"<<endl;\n\t\tcin>>choice;\n\t\tswitch(choice)\n\t\t{\n\t\t\tcase 1:\n\t\t\t\tchange_pin();\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 2:\n\t\t\t\twithdraw();\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 3:\n\t\t\t\tdisplay_balance();\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tdefault:\n\t\t\t\texit(EXIT_SUCCESS);\t\t\t\t\t\t\n\t\t}\n\t}\n\t\n\telse\n\t{\n\t\tcout<<\"Incorrect pin.\"<<endl;\n\t\texit(EXIT_SUCCESS);\n\t}\n\t\n}<commit_msg>Formatting<commit_after>\/\/bank00.cpp -- Bank class implementation\n\/\/version 00\n\n#include <iostream>\n#include <cstdlib>\n#include <ctime>\n#include \"bank00.h\"\n\nusing namespace std;\n\nvoid Bank::create_account()\n{\n\tsrand(time(NULL));\n\tcout<<\"Please enter your name.\"<<endl;\n\tgetline(cin, name);\n\tcout<<\"Please enter the amount you would like to deposit.\"<<endl;\n\tcin>>balance;\n\taccount_no = rand();\n\tcout<<\"Please enter a four digit number for your PIN.\"<<endl;\n\tcin>>pin;\n}\n\nvoid Bank::change_pin()\n{\n\tint new_pin = 0;\n\tcout<<\"Please enter a four digit number as your PIN.\"<<endl;\n\tcin>>new_pin;\n\tif(new_pin == pin)\n\t{\n\t\tcout<<\"New PIN cannot be same as old PIN.\"<<endl;\n\t\tcout<<\"Please enter a different PIN.\"<<endl;\n\t\tcin>>new_pin;\n\t\tpin = new_pin;\n\t}\n\telse\n\t\tpin = new_pin;\n}\n\nvoid Bank::withdraw()\n{\n\tdouble amount = 0.0;\n\tcout<<\"Please enter the amount.\"<<endl;\n\tcin>>amount;\n\tif(amount > balance)\n\t\tcout<<\"Withdrawal amount cannot be greater than the available balance.\"<<endl;\n\telse\n\t\tbalance -= amount;\n\tcout<<\"Available balance is $\"<<balance<<endl;\n\tcout<<\"Thank you.\"<<endl;\n}\n\nvoid Bank::display_balance()\n{\n\tcout<<\"Account Number: \"<<account_no<<endl;\n\tcout<<\"Balance $\"<<balance<<endl;\n\tcout<<\"Thank you.\"<<endl;\n}\n\nvoid Bank::authenticate()\n{\n\tint input_pin = 0, choice = 0;\n\tcout<<\"Please enter your PIN.\"<<endl;\n\tcin>>input_pin;\n\tif(input_pin == pin)\n\t{\n\t\tcout<<\"Hello \"<<name<<endl;\n\t\tcout<<\"Enter 1 to change pin.\"<<endl;\n\t\tcout<<\"Enter 2 to withdraw cash.\"<<endl;\n\t\tcout<<\"Enter 3 to check balance.\"<<endl;\n\t\tcout<<\"Enter 4 to quit.\"<<endl;\n\t\tcin>>choice;\n\t\tswitch(choice)\n\t\t{\n\t\t\tcase 1:\n\t\t\t\tchange_pin();\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 2:\n\t\t\t\twithdraw();\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tcase 3:\n\t\t\t\tdisplay_balance();\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tdefault:\n\t\t\t\texit(EXIT_SUCCESS);\t\t\t\t\t\t\n\t\t}\n\t}\n\telse\n\t{\n\t\tcout<<\"Incorrect pin.\"<<endl;\n\t\texit(EXIT_SUCCESS);\n\t}\t\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"Benchmark.h\"\n#include \"SkCanvas.h\"\n#include \"SkImage.h\"\n#include \"SkPaint.h\"\n#include \"SkSurface.h\"\n\n#if SK_SUPPORT_GPU\n\nclass GrMipMapBench: public Benchmark {\n sk_sp<SkSurface> fSurface;\n SkString fName;\n const int fW, fH;\n\npublic:\n GrMipMapBench(int w, int h) : fW(w), fH(h) {\n fName.printf(\"gr_mipmap_build_%dx%d\", w, h);\n }\n\nprotected:\n bool isSuitableFor(Backend backend) override {\n return kGPU_Backend == backend;\n }\n\n const char* onGetName() override { return fName.c_str(); }\n\n void onDraw(int loops, SkCanvas* canvas) override {\n if (!fSurface) {\n GrContext* context = canvas->getGrContext();\n if (nullptr == context) {\n return;\n }\n SkImageInfo info = SkImageInfo::Make(fW, fH, kN32_SkColorType, kPremul_SkAlphaType,\n kSRGB_SkColorProfileType);\n fSurface = SkSurface::MakeRenderTarget(context, SkBudgeted::kNo, info);\n }\n\n \/\/ Clear surface once:\n fSurface->getCanvas()->clear(SK_ColorBLACK);\n\n SkPaint paint;\n paint.setFilterQuality(kMedium_SkFilterQuality);\n\n for (int i = 0; i < loops; i++) {\n \/\/ Touch surface so mips are dirtied\n fSurface->getCanvas()->drawPoint(0, 0, SK_ColorWHITE);\n\n \/\/ Draw reduced version of surface to original canvas, to trigger mip generation\n canvas->save();\n canvas->scale(0.1f, 0.1f);\n canvas->drawImage(fSurface->makeImageSnapshot(SkBudgeted::kNo), 0, 0, &paint);\n canvas->restore();\n }\n }\n\n void onPerCanvasPostDraw(SkCanvas*) override {\n fSurface.reset(nullptr);\n }\n\nprivate:\n typedef Benchmark INHERITED;\n};\n\n\/\/ Build variants that exercise the width and heights being even or odd at each level, as the\n\/\/ impl specializes on each of these.\n\/\/\nDEF_BENCH( return new GrMipMapBench(511, 1023); )\nDEF_BENCH( return new GrMipMapBench(512, 511); )\nDEF_BENCH( return new GrMipMapBench(511, 512); )\nDEF_BENCH( return new GrMipMapBench(512, 512); )\n\n#endif\n<commit_msg>Fix incorrect parameter in new benchmark.<commit_after>\/*\n * Copyright 2016 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"Benchmark.h\"\n#include \"SkCanvas.h\"\n#include \"SkImage.h\"\n#include \"SkPaint.h\"\n#include \"SkSurface.h\"\n\n#if SK_SUPPORT_GPU\n\nclass GrMipMapBench: public Benchmark {\n sk_sp<SkSurface> fSurface;\n SkString fName;\n const int fW, fH;\n\npublic:\n GrMipMapBench(int w, int h) : fW(w), fH(h) {\n fName.printf(\"gr_mipmap_build_%dx%d\", w, h);\n }\n\nprotected:\n bool isSuitableFor(Backend backend) override {\n return kGPU_Backend == backend;\n }\n\n const char* onGetName() override { return fName.c_str(); }\n\n void onDraw(int loops, SkCanvas* canvas) override {\n if (!fSurface) {\n GrContext* context = canvas->getGrContext();\n if (nullptr == context) {\n return;\n }\n SkImageInfo info = SkImageInfo::Make(fW, fH, kN32_SkColorType, kPremul_SkAlphaType,\n kSRGB_SkColorProfileType);\n fSurface = SkSurface::MakeRenderTarget(context, SkBudgeted::kNo, info);\n }\n\n \/\/ Clear surface once:\n fSurface->getCanvas()->clear(SK_ColorBLACK);\n\n SkPaint paint;\n paint.setFilterQuality(kMedium_SkFilterQuality);\n\n for (int i = 0; i < loops; i++) {\n \/\/ Touch surface so mips are dirtied\n fSurface->getCanvas()->drawPoint(0, 0, SK_ColorWHITE);\n\n \/\/ Draw reduced version of surface to original canvas, to trigger mip generation\n canvas->save();\n canvas->scale(0.1f, 0.1f);\n canvas->drawImage(fSurface->makeImageSnapshot(SkBudgeted::kNo), 0, 0, &paint);\n canvas->restore();\n }\n }\n\n void onPerCanvasPostDraw(SkCanvas*) override {\n fSurface.reset(nullptr);\n }\n\nprivate:\n typedef Benchmark INHERITED;\n};\n\n\/\/ Build variants that exercise the width and heights being even or odd at each level, as the\n\/\/ impl specializes on each of these.\n\/\/\nDEF_BENCH( return new GrMipMapBench(511, 511); )\nDEF_BENCH( return new GrMipMapBench(512, 511); )\nDEF_BENCH( return new GrMipMapBench(511, 512); )\nDEF_BENCH( return new GrMipMapBench(512, 512); )\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"Benchmark.h\"\n#include \"SkMatrix44.h\"\n#include \"SkRandom.h\"\n#include \"SkString.h\"\n\nclass Matrix44Bench : public Benchmark {\n SkString fName;\npublic:\n Matrix44Bench(const char name[]) {\n fName.printf(\"matrix44_%s\", name);\n }\n\n bool isSuitableFor(Backend backend) override {\n return backend == kNonRendering_Backend;\n }\n\n virtual void performTest() = 0;\n\nprotected:\n virtual int mulLoopCount() const { return 1; }\n\n virtual const char* onGetName() {\n return fName.c_str();\n }\n\n virtual void onDraw(const int loops, SkCanvas*) {\n for (int i = 0; i < loops; i++) {\n this->performTest();\n }\n }\n\nprivate:\n typedef Benchmark INHERITED;\n};\n\nclass EqualsMatrix44Bench : public Matrix44Bench {\npublic:\n EqualsMatrix44Bench()\n : INHERITED(\"equals\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kIdentity_Constructor)\n , fM2(SkMatrix44::kIdentity_Constructor)\n {\n fM1.set(0, 0, 0);\n fM2.set(3, 3, 0);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n (void) (fM0 == fM1);\n (void) (fM1 == fM2);\n (void) (fM2 == fM0);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1, fM2;\n typedef Matrix44Bench INHERITED;\n};\n\nclass SetIdentityMatrix44Bench : public Matrix44Bench {\npublic:\n SetIdentityMatrix44Bench()\n : INHERITED(\"setidentity\")\n , mat(SkMatrix44::kIdentity_Constructor)\n {\n double rowMajor[16] =\n { 1, 2, 3, 4,\n 5, 6, 7, 8,\n 9, 10, 11, 12,\n 13, 14, 15, 16};\n mat.setRowMajord(rowMajor);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n mat.setIdentity();\n }\n }\nprivate:\n SkMatrix44 mat;\n typedef Matrix44Bench INHERITED;\n};\n\nclass PreScaleMatrix44Bench : public Matrix44Bench {\npublic:\n PreScaleMatrix44Bench()\n : INHERITED(\"prescale\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n {\n fX = fY = fZ = SkDoubleToMScalar(1.5);\n }\nprotected:\n virtual void performTest() {\n fM0.reset();\n for (int i = 0; i < 10; ++i) {\n fM0.preScale(fX, fY, fZ);\n }\n }\nprivate:\n SkMatrix44 fM0;\n SkMScalar fX, fY, fZ;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertMatrix44Bench : public Matrix44Bench {\npublic:\n InvertMatrix44Bench()\n : INHERITED(\"invert\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 1, 2.1);\n fM0.set(0, 2, -3.1);\n fM0.set(0, 3, 4.1);\n fM0.set(1, 0, 5.1);\n fM0.set(1, 1, -6.1);\n fM0.set(1, 2, 7.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 0, -9.1);\n fM0.set(2, 1, 10.1);\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n fM0.set(3, 0, -13.1);\n fM0.set(3, 1, 14.1);\n fM0.set(3, 2, -15.1);\n fM0.set(3, 3, 16.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertAffineMatrix44Bench : public Matrix44Bench {\npublic:\n InvertAffineMatrix44Bench()\n : INHERITED(\"invertaffine\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 1, 2.1);\n fM0.set(0, 2, -3.1);\n fM0.set(0, 3, 4.1);\n fM0.set(1, 0, 5.1);\n fM0.set(1, 1, -6.1);\n fM0.set(1, 2, 7.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 0, -9.1);\n fM0.set(2, 1, 10.1);\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n \/\/ bottom row (perspective component) remains (0, 0, 0, 1).\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertScaleTranslateMatrix44Bench : public Matrix44Bench {\npublic:\n InvertScaleTranslateMatrix44Bench()\n : INHERITED(\"invertscaletranslate\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 3, 4.1);\n\n fM0.set(1, 1, -6.1);\n fM0.set(1, 3, 8.1);\n\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertTranslateMatrix44Bench : public Matrix44Bench {\npublic:\n InvertTranslateMatrix44Bench()\n : INHERITED(\"inverttranslate\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 3, 4.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 3, -12.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass PostScaleMatrix44Bench : public Matrix44Bench {\npublic:\n PostScaleMatrix44Bench()\n : INHERITED(\"postscale\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n {\n fX = fY = fZ = SkDoubleToMScalar(1.5);\n }\nprotected:\n virtual void performTest() {\n fM0.reset();\n for (int i = 0; i < 10; ++i) {\n fM0.postScale(fX, fY, fZ);\n }\n }\nprivate:\n SkMatrix44 fM0;\n SkMScalar fX, fY, fZ;\n typedef Matrix44Bench INHERITED;\n};\n\nclass SetConcatMatrix44Bench : public Matrix44Bench {\npublic:\n \/\/ SkMatrix44::setConcat() has a fast path for matrices that are at most scale+translate.\n SetConcatMatrix44Bench(bool fastPath)\n : INHERITED(fastPath ? \"setconcat_fast\" : \"setconcat_general\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n , fM2(SkMatrix44::kUninitialized_Constructor)\n{\n if (fastPath) {\n const SkMScalar v = SkDoubleToMScalar(1.5);\n fM1.setScale(v,v,v);\n fM2.setTranslate(v,v,v);\n } else {\n SkRandom rand;\n for (int x = 0; x < 4; x++) {\n for (int y = 0; y < 4; y++) {\n fM1.setFloat(x,y, rand.nextF());\n fM2.setFloat(x,y, rand.nextF());\n }}\n }\n }\nprotected:\n virtual void performTest() {\n fM0.reset(); \/\/ just to normalize this test with prescale\/postscale\n for (int i = 0; i < 10; ++i) {\n fM0.setConcat(fM1, fM2);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1, fM2;\n typedef Matrix44Bench INHERITED;\n};\n\nclass GetTypeMatrix44Bench : public Matrix44Bench {\npublic:\n GetTypeMatrix44Bench()\n : INHERITED(\"gettype\")\n , fMatrix(SkMatrix44::kIdentity_Constructor)\n {}\nprotected:\n \/\/ Putting random generation of the matrix inside performTest()\n \/\/ would help us avoid anomalous runs, but takes up 25% or\n \/\/ more of the function time.\n virtual void performTest() {\n for (int i = 0; i < 20; ++i) {\n fMatrix.set(1, 2, 1); \/\/ to invalidate the type-cache\n fMatrix.getType();\n }\n }\nprivate:\n SkMatrix44 fMatrix;\n typedef Matrix44Bench INHERITED;\n};\n\nDEF_BENCH( return new SetIdentityMatrix44Bench(); )\nDEF_BENCH( return new EqualsMatrix44Bench(); )\nDEF_BENCH( return new PreScaleMatrix44Bench(); )\nDEF_BENCH( return new PostScaleMatrix44Bench(); )\nDEF_BENCH( return new InvertMatrix44Bench(); )\nDEF_BENCH( return new InvertAffineMatrix44Bench(); )\nDEF_BENCH( return new InvertScaleTranslateMatrix44Bench(); )\nDEF_BENCH( return new InvertTranslateMatrix44Bench(); )\nDEF_BENCH( return new SetConcatMatrix44Bench(true); )\nDEF_BENCH( return new SetConcatMatrix44Bench(false); )\nDEF_BENCH( return new GetTypeMatrix44Bench(); )\n<commit_msg>Pump up matrix44_setconcat benches 1000x so they can be timed on Android.<commit_after>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"Benchmark.h\"\n#include \"SkMatrix44.h\"\n#include \"SkRandom.h\"\n#include \"SkString.h\"\n\nclass Matrix44Bench : public Benchmark {\n SkString fName;\npublic:\n Matrix44Bench(const char name[]) {\n fName.printf(\"matrix44_%s\", name);\n }\n\n bool isSuitableFor(Backend backend) override {\n return backend == kNonRendering_Backend;\n }\n\n virtual void performTest() = 0;\n\nprotected:\n virtual int mulLoopCount() const { return 1; }\n\n virtual const char* onGetName() {\n return fName.c_str();\n }\n\n virtual void onDraw(const int loops, SkCanvas*) {\n for (int i = 0; i < loops; i++) {\n this->performTest();\n }\n }\n\nprivate:\n typedef Benchmark INHERITED;\n};\n\nclass EqualsMatrix44Bench : public Matrix44Bench {\npublic:\n EqualsMatrix44Bench()\n : INHERITED(\"equals\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kIdentity_Constructor)\n , fM2(SkMatrix44::kIdentity_Constructor)\n {\n fM1.set(0, 0, 0);\n fM2.set(3, 3, 0);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n (void) (fM0 == fM1);\n (void) (fM1 == fM2);\n (void) (fM2 == fM0);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1, fM2;\n typedef Matrix44Bench INHERITED;\n};\n\nclass SetIdentityMatrix44Bench : public Matrix44Bench {\npublic:\n SetIdentityMatrix44Bench()\n : INHERITED(\"setidentity\")\n , mat(SkMatrix44::kIdentity_Constructor)\n {\n double rowMajor[16] =\n { 1, 2, 3, 4,\n 5, 6, 7, 8,\n 9, 10, 11, 12,\n 13, 14, 15, 16};\n mat.setRowMajord(rowMajor);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n mat.setIdentity();\n }\n }\nprivate:\n SkMatrix44 mat;\n typedef Matrix44Bench INHERITED;\n};\n\nclass PreScaleMatrix44Bench : public Matrix44Bench {\npublic:\n PreScaleMatrix44Bench()\n : INHERITED(\"prescale\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n {\n fX = fY = fZ = SkDoubleToMScalar(1.5);\n }\nprotected:\n virtual void performTest() {\n fM0.reset();\n for (int i = 0; i < 10; ++i) {\n fM0.preScale(fX, fY, fZ);\n }\n }\nprivate:\n SkMatrix44 fM0;\n SkMScalar fX, fY, fZ;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertMatrix44Bench : public Matrix44Bench {\npublic:\n InvertMatrix44Bench()\n : INHERITED(\"invert\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 1, 2.1);\n fM0.set(0, 2, -3.1);\n fM0.set(0, 3, 4.1);\n fM0.set(1, 0, 5.1);\n fM0.set(1, 1, -6.1);\n fM0.set(1, 2, 7.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 0, -9.1);\n fM0.set(2, 1, 10.1);\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n fM0.set(3, 0, -13.1);\n fM0.set(3, 1, 14.1);\n fM0.set(3, 2, -15.1);\n fM0.set(3, 3, 16.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertAffineMatrix44Bench : public Matrix44Bench {\npublic:\n InvertAffineMatrix44Bench()\n : INHERITED(\"invertaffine\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 1, 2.1);\n fM0.set(0, 2, -3.1);\n fM0.set(0, 3, 4.1);\n fM0.set(1, 0, 5.1);\n fM0.set(1, 1, -6.1);\n fM0.set(1, 2, 7.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 0, -9.1);\n fM0.set(2, 1, 10.1);\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n \/\/ bottom row (perspective component) remains (0, 0, 0, 1).\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertScaleTranslateMatrix44Bench : public Matrix44Bench {\npublic:\n InvertScaleTranslateMatrix44Bench()\n : INHERITED(\"invertscaletranslate\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 0, -1.1);\n fM0.set(0, 3, 4.1);\n\n fM0.set(1, 1, -6.1);\n fM0.set(1, 3, 8.1);\n\n fM0.set(2, 2, 11.1);\n fM0.set(2, 3, -12.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass InvertTranslateMatrix44Bench : public Matrix44Bench {\npublic:\n InvertTranslateMatrix44Bench()\n : INHERITED(\"inverttranslate\")\n , fM0(SkMatrix44::kIdentity_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n {\n fM0.set(0, 3, 4.1);\n fM0.set(1, 3, 8.1);\n fM0.set(2, 3, -12.1);\n }\nprotected:\n virtual void performTest() {\n for (int i = 0; i < 10; ++i) {\n fM0.invert(&fM1);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1;\n typedef Matrix44Bench INHERITED;\n};\n\nclass PostScaleMatrix44Bench : public Matrix44Bench {\npublic:\n PostScaleMatrix44Bench()\n : INHERITED(\"postscale\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n {\n fX = fY = fZ = SkDoubleToMScalar(1.5);\n }\nprotected:\n virtual void performTest() {\n fM0.reset();\n for (int i = 0; i < 10; ++i) {\n fM0.postScale(fX, fY, fZ);\n }\n }\nprivate:\n SkMatrix44 fM0;\n SkMScalar fX, fY, fZ;\n typedef Matrix44Bench INHERITED;\n};\n\nclass SetConcatMatrix44Bench : public Matrix44Bench {\npublic:\n \/\/ SkMatrix44::setConcat() has a fast path for matrices that are at most scale+translate.\n SetConcatMatrix44Bench(bool fastPath)\n : INHERITED(fastPath ? \"setconcat_fast\" : \"setconcat_general\")\n , fM0(SkMatrix44::kUninitialized_Constructor)\n , fM1(SkMatrix44::kUninitialized_Constructor)\n , fM2(SkMatrix44::kUninitialized_Constructor)\n{\n if (fastPath) {\n const SkMScalar v = SkDoubleToMScalar(1.5);\n fM1.setScale(v,v,v);\n fM2.setTranslate(v,v,v);\n } else {\n SkRandom rand;\n for (int x = 0; x < 4; x++) {\n for (int y = 0; y < 4; y++) {\n fM1.setFloat(x,y, rand.nextF());\n fM2.setFloat(x,y, rand.nextF());\n }}\n }\n }\nprotected:\n virtual void performTest() {\n fM0.reset(); \/\/ just to normalize this test with prescale\/postscale\n for (int i = 0; i < 10000; ++i) {\n fM0.setConcat(fM1, fM2);\n }\n }\nprivate:\n SkMatrix44 fM0, fM1, fM2;\n typedef Matrix44Bench INHERITED;\n};\n\nclass GetTypeMatrix44Bench : public Matrix44Bench {\npublic:\n GetTypeMatrix44Bench()\n : INHERITED(\"gettype\")\n , fMatrix(SkMatrix44::kIdentity_Constructor)\n {}\nprotected:\n \/\/ Putting random generation of the matrix inside performTest()\n \/\/ would help us avoid anomalous runs, but takes up 25% or\n \/\/ more of the function time.\n virtual void performTest() {\n for (int i = 0; i < 20; ++i) {\n fMatrix.set(1, 2, 1); \/\/ to invalidate the type-cache\n fMatrix.getType();\n }\n }\nprivate:\n SkMatrix44 fMatrix;\n typedef Matrix44Bench INHERITED;\n};\n\nDEF_BENCH( return new SetIdentityMatrix44Bench(); )\nDEF_BENCH( return new EqualsMatrix44Bench(); )\nDEF_BENCH( return new PreScaleMatrix44Bench(); )\nDEF_BENCH( return new PostScaleMatrix44Bench(); )\nDEF_BENCH( return new InvertMatrix44Bench(); )\nDEF_BENCH( return new InvertAffineMatrix44Bench(); )\nDEF_BENCH( return new InvertScaleTranslateMatrix44Bench(); )\nDEF_BENCH( return new InvertTranslateMatrix44Bench(); )\nDEF_BENCH( return new SetConcatMatrix44Bench(true); )\nDEF_BENCH( return new SetConcatMatrix44Bench(false); )\nDEF_BENCH( return new GetTypeMatrix44Bench(); )\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2017 Darius Rückert\n * Licensed under the MIT License.\n * See LICENSE file for more information.\n *\/\n\n#include \"framework.h\"\n\n#include \"saiga\/core\/image\/image.h\"\n#include \"saiga\/core\/model\/ModelLoader.h\"\n#include \"saiga\/core\/util\/assert.h\"\n#include \"saiga\/core\/util\/directory.h\"\n#include \"saiga\/core\/util\/easylogging++.h\"\n#include \"saiga\/core\/util\/fileChecker.h\"\n#include \"saiga\/core\/util\/floatingPoint.h\"\n#include \"saiga\/core\/util\/ini\/ini.h\"\n#include \"saiga\/core\/util\/threadName.h\"\n#include \"saiga\/core\/util\/tostring.h\"\n\nnamespace Saiga\n{\nbool initialized = false;\n\n\n\nbool isShaderDirectory(const std::string& dir)\n{\n Directory dirbase(dir);\n Directory dirgeo(dir + \"\/geometry\");\n return dirbase.existsFile(\"colored_points.glsl\") && dirgeo.existsFile(\"deferred_mvp_texture.glsl\");\n}\n\n\nvoid SaigaParameters::fromConfigFile(const std::string& file)\n{\n Saiga::SimpleIni ini;\n ini.LoadFile(file.c_str());\n\n\n std::string comment =\n \"# Multiple search pathes must be separated by '!'.\\n\"\n \"# Example:\\n\"\n \"# shaderDirectory = shader!\/usr\/local\/share\/saiga\/shader!somepath\/asdf\/shader\";\n\n char sep = '!';\n shaderDirectory =\n split(ini.GetAddString(\"saiga\", \"shaderDirectory\", concat(shaderDirectory, sep).c_str(), comment.c_str()), sep);\n textureDirectory = split(ini.GetAddString(\"saiga\", \"textureDirectory\", concat(textureDirectory, sep).c_str()), sep);\n modelDirectory = split(ini.GetAddString(\"saiga\", \"modelDirectory\", concat(modelDirectory, sep).c_str()), sep);\n fontDirectory = split(ini.GetAddString(\"saiga\", \"fontDirectory\", concat(fontDirectory, sep).c_str()), sep);\n dataDirectory = split(ini.GetAddString(\"saiga\", \"dataDirectory\", concat(dataDirectory, sep).c_str()), sep);\n mainThreadName = ini.GetAddString(\"saiga\", \"mainThreadName\", mainThreadName.c_str());\n logging_enabled = ini.GetAddBool(\"saiga\", \"logging\", logging_enabled);\n verbose_logging = ini.GetAddBool(\"saiga\", \"verbose_logging\", verbose_logging);\n if (ini.changed()) ini.SaveFile(file.c_str());\n}\n\n\n\nstatic void printSaigaInfo()\n{\n cout << \"Saiga Version \" << SAIGA_VERSION_MAJOR << \".\" << SAIGA_VERSION_MINOR << endl;\n std::string libs;\n#ifdef SAIGA_USE_SDL\n libs += \"SDL,\";\n#endif\n#ifdef SAIGA_USE_GLFW\n libs += \"GLFW,\";\n#endif\n#ifdef SAIGA_USE_OPENAL\n libs += \"OPENAL,\";\n#endif\n#ifdef SAIGA_USE_ALUT\n libs += \"ALUT,\";\n#endif\n#ifdef SAIGA_USE_OPUS\n libs += \"OPUS,\";\n#endif\n#ifdef SAIGA_USE_ASSIMP\n libs += \"ASSIMP,\";\n#endif\n#ifdef SAIGA_USE_PNG\n libs += \"PNG,\";\n#endif\n#ifdef SAIGA_USE_FREEIMAGE\n libs += \"FREEIMAGE,\";\n#endif\n#ifdef SAIGA_USE_FFMPEG\n libs += \"FFMPEG,\";\n#endif\n#ifdef SAIGA_USE_CUDA\n libs += \"CUDA,\";\n#endif\n#ifdef SAIGA_USE_EIGEN\n libs += \"EIGEN,\";\n#endif\n cout << \"Libs: \" << libs << endl;\n\n std::string options;\n#ifdef SAIGA_BUILD_SHARED\n options += \"BUILD_SHARED,\";\n#endif\n#ifdef SAIGA_DEBUG\n options += \"DEBUG,\";\n#endif\n#ifdef SAIGA_ASSERTS\n options += \"ASSERTS,\";\n#endif\n#ifdef SAIGA_BUILD_SAMPLES\n options += \"BUILD_SAMPLES,\";\n#endif\n#ifdef SAIGA_WITH_CUDA\n options += \"WITH_CUDA,\";\n#endif\n#ifdef SAIGA_STRICT_FP\n options += \"STRICT_FP,\";\n#endif\n#ifdef SAIGA_FULL_OPTIMIZE\n options += \"FULL_OPTIMIZE,\";\n#endif\n#ifdef SAIGA_CUDA_DEBUG\n options += \"CUDA_DEBUG,\";\n#endif\n cout << \"Build Options: \" << options << endl;\n}\n\n\nvoid initSample(SaigaParameters& saigaParameters)\n{\n saigaParameters.shaderDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/shader\"};\n saigaParameters.textureDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/textures\"};\n saigaParameters.modelDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/models\"};\n saigaParameters.fontDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/fonts\"};\n saigaParameters.dataDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\"};\n saigaParameters.logging_enabled = false;\n saigaParameters.verbose_logging = false;\n}\n\nvoid initSaiga(const SaigaParameters& params)\n{\n if (initialized)\n {\n return;\n }\n\n FP::resetSSECSR();\n\n\n std::vector<std::string> searchPathes = {\n \/\/ First check in the local working directory\n \"shader\",\n };\n\n searchPathes.insert(searchPathes.end(), params.shaderDirectory.begin(), params.shaderDirectory.end());\n \/\/ Then the given paramter from the config file\n \/\/ params.shaderDirectory,\n \/\/ And last the install prefix from cmake\n searchPathes.push_back(SAIGA_INSTALL_PREFIX \"\/share\/saiga\/shader\");\n searchPathes.push_back(SAIGA_SHADER_PREFIX);\n \/\/ };\n\n\n std::string shaderDir;\n\n for (auto str : searchPathes)\n {\n if (isShaderDirectory(str))\n {\n shaderDir = str;\n cout << \"Found the Saiga shaders at \" << shaderDir << endl;\n break;\n }\n }\n\n if (shaderDir.empty())\n {\n cout << \"Could not find the Saiga shaders.\" << endl;\n cout << \"Set the 'shaderDirectory' variable of 'SaigaParameters' accordingly.\" << endl;\n for (auto s : searchPathes)\n {\n cout << \" \" << s << endl;\n }\n exit(1);\n }\n\n SearchPathes::shader.addSearchPath(shaderDir);\n SearchPathes::shader.addSearchPath(shaderDir + \"\/include\");\n SearchPathes::shader.addSearchPath(params.shaderDirectory);\n\n SearchPathes::image.addSearchPath(params.textureDirectory);\n SearchPathes::data.addSearchPath(params.dataDirectory);\n SearchPathes::font.addSearchPath(params.fontDirectory);\n SearchPathes::model.addSearchPath(params.modelDirectory);\n\n \/\/#ifdef SAIGA_USE_OPENGL\n \/\/ initSaigaGL(shaderDir, params.textureDirectory);\n \/\/#endif\n\n \/\/#ifdef SAIGA_USE_VULKAN\n \/\/ Vulkan::GLSLANG::init();\n \/\/#endif\n\n\n setThreadName(params.mainThreadName);\n\n el::Configurations defaultConf;\n defaultConf.setToDefault();\n \/\/ Values are always std::string\n defaultConf.set(el::Level::Global, el::ConfigurationType::ToFile, \"false\");\n \/\/ defaultConf.set(el::Level::Global, el::ConfigurationType::ToStandardOutput,\n \/\/ std::to_string(params.logging_enabled));\n defaultConf.set(el::Level::Global, el::ConfigurationType::Enabled, std::to_string(params.logging_enabled));\n defaultConf.set(el::Level::Verbose, el::ConfigurationType::Enabled, std::to_string(params.verbose_logging));\n el::Loggers::reconfigureLogger(\"default\", defaultConf);\n\n if (params.logging_enabled)\n {\n cout << \"Logging is enabled\" << endl;\n }\n\n printSaigaInfo();\n cout << \"========================== Saiga initialization done! ==========================\" << endl << endl;\n initialized = true;\n}\n\nvoid cleanupSaiga()\n{\n \/\/#ifdef SAIGA_USE_VULKAN\n \/\/ Saiga::Vulkan::GLSLANG::quit();\n \/\/#endif\n\n \/\/#ifdef SAIGA_USE_OPENGL\n \/\/ cleanupSaigaGL();\n \/\/#endif\n\n cout << \"========================== Saiga cleanup done! ==========================\" << endl;\n initialized = false;\n}\n\n\n\n} \/\/ namespace Saiga\n<commit_msg>Fixes verbose logging<commit_after>\/**\n * Copyright (c) 2017 Darius Rückert\n * Licensed under the MIT License.\n * See LICENSE file for more information.\n *\/\n\n#include \"framework.h\"\n\n#include \"saiga\/core\/image\/image.h\"\n#include \"saiga\/core\/model\/ModelLoader.h\"\n#include \"saiga\/core\/util\/assert.h\"\n#include \"saiga\/core\/util\/directory.h\"\n#include \"saiga\/core\/util\/easylogging++.h\"\n#include \"saiga\/core\/util\/fileChecker.h\"\n#include \"saiga\/core\/util\/floatingPoint.h\"\n#include \"saiga\/core\/util\/ini\/ini.h\"\n#include \"saiga\/core\/util\/threadName.h\"\n#include \"saiga\/core\/util\/tostring.h\"\n\nnamespace Saiga\n{\nbool initialized = false;\n\n\n\nbool isShaderDirectory(const std::string& dir)\n{\n Directory dirbase(dir);\n Directory dirgeo(dir + \"\/geometry\");\n return dirbase.existsFile(\"colored_points.glsl\") && dirgeo.existsFile(\"deferred_mvp_texture.glsl\");\n}\n\n\nvoid SaigaParameters::fromConfigFile(const std::string& file)\n{\n Saiga::SimpleIni ini;\n ini.LoadFile(file.c_str());\n\n\n std::string comment =\n \"# Multiple search pathes must be separated by '!'.\\n\"\n \"# Example:\\n\"\n \"# shaderDirectory = shader!\/usr\/local\/share\/saiga\/shader!somepath\/asdf\/shader\";\n\n char sep = '!';\n shaderDirectory =\n split(ini.GetAddString(\"saiga\", \"shaderDirectory\", concat(shaderDirectory, sep).c_str(), comment.c_str()), sep);\n textureDirectory = split(ini.GetAddString(\"saiga\", \"textureDirectory\", concat(textureDirectory, sep).c_str()), sep);\n modelDirectory = split(ini.GetAddString(\"saiga\", \"modelDirectory\", concat(modelDirectory, sep).c_str()), sep);\n fontDirectory = split(ini.GetAddString(\"saiga\", \"fontDirectory\", concat(fontDirectory, sep).c_str()), sep);\n dataDirectory = split(ini.GetAddString(\"saiga\", \"dataDirectory\", concat(dataDirectory, sep).c_str()), sep);\n mainThreadName = ini.GetAddString(\"saiga\", \"mainThreadName\", mainThreadName.c_str());\n logging_enabled = ini.GetAddBool(\"saiga\", \"logging\", logging_enabled);\n verbose_logging = ini.GetAddBool(\"saiga\", \"verbose_logging\", verbose_logging);\n if (ini.changed()) ini.SaveFile(file.c_str());\n}\n\n\n\nstatic void printSaigaInfo()\n{\n cout << \"Saiga Version \" << SAIGA_VERSION_MAJOR << \".\" << SAIGA_VERSION_MINOR << endl;\n std::string libs;\n#ifdef SAIGA_USE_SDL\n libs += \"SDL,\";\n#endif\n#ifdef SAIGA_USE_GLFW\n libs += \"GLFW,\";\n#endif\n#ifdef SAIGA_USE_OPENAL\n libs += \"OPENAL,\";\n#endif\n#ifdef SAIGA_USE_ALUT\n libs += \"ALUT,\";\n#endif\n#ifdef SAIGA_USE_OPUS\n libs += \"OPUS,\";\n#endif\n#ifdef SAIGA_USE_ASSIMP\n libs += \"ASSIMP,\";\n#endif\n#ifdef SAIGA_USE_PNG\n libs += \"PNG,\";\n#endif\n#ifdef SAIGA_USE_FREEIMAGE\n libs += \"FREEIMAGE,\";\n#endif\n#ifdef SAIGA_USE_FFMPEG\n libs += \"FFMPEG,\";\n#endif\n#ifdef SAIGA_USE_CUDA\n libs += \"CUDA,\";\n#endif\n#ifdef SAIGA_USE_EIGEN\n libs += \"EIGEN,\";\n#endif\n cout << \"Libs: \" << libs << endl;\n\n std::string options;\n#ifdef SAIGA_BUILD_SHARED\n options += \"BUILD_SHARED,\";\n#endif\n#ifdef SAIGA_DEBUG\n options += \"DEBUG,\";\n#endif\n#ifdef SAIGA_ASSERTS\n options += \"ASSERTS,\";\n#endif\n#ifdef SAIGA_BUILD_SAMPLES\n options += \"BUILD_SAMPLES,\";\n#endif\n#ifdef SAIGA_WITH_CUDA\n options += \"WITH_CUDA,\";\n#endif\n#ifdef SAIGA_STRICT_FP\n options += \"STRICT_FP,\";\n#endif\n#ifdef SAIGA_FULL_OPTIMIZE\n options += \"FULL_OPTIMIZE,\";\n#endif\n#ifdef SAIGA_CUDA_DEBUG\n options += \"CUDA_DEBUG,\";\n#endif\n cout << \"Build Options: \" << options << endl;\n}\n\n\nvoid initSample(SaigaParameters& saigaParameters)\n{\n saigaParameters.shaderDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/shader\"};\n saigaParameters.textureDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/textures\"};\n saigaParameters.modelDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/models\"};\n saigaParameters.fontDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\/fonts\"};\n saigaParameters.dataDirectory = {SAIGA_PROJECT_SOURCE_DIR \"\/data\"};\n saigaParameters.logging_enabled = false;\n saigaParameters.verbose_logging = false;\n}\n\nvoid initSaiga(const SaigaParameters& params)\n{\n if (initialized)\n {\n return;\n }\n\n FP::resetSSECSR();\n\n\n std::vector<std::string> searchPathes = {\n \/\/ First check in the local working directory\n \"shader\",\n };\n\n searchPathes.insert(searchPathes.end(), params.shaderDirectory.begin(), params.shaderDirectory.end());\n \/\/ Then the given paramter from the config file\n \/\/ params.shaderDirectory,\n \/\/ And last the install prefix from cmake\n searchPathes.push_back(SAIGA_INSTALL_PREFIX \"\/share\/saiga\/shader\");\n searchPathes.push_back(SAIGA_SHADER_PREFIX);\n \/\/ };\n\n\n std::string shaderDir;\n\n for (auto str : searchPathes)\n {\n if (isShaderDirectory(str))\n {\n shaderDir = str;\n cout << \"Found the Saiga shaders at \" << shaderDir << endl;\n break;\n }\n }\n\n if (shaderDir.empty())\n {\n cout << \"Could not find the Saiga shaders.\" << endl;\n cout << \"Set the 'shaderDirectory' variable of 'SaigaParameters' accordingly.\" << endl;\n for (auto s : searchPathes)\n {\n cout << \" \" << s << endl;\n }\n exit(1);\n }\n\n SearchPathes::shader.addSearchPath(shaderDir);\n SearchPathes::shader.addSearchPath(shaderDir + \"\/include\");\n SearchPathes::shader.addSearchPath(params.shaderDirectory);\n\n SearchPathes::image.addSearchPath(params.textureDirectory);\n SearchPathes::data.addSearchPath(params.dataDirectory);\n SearchPathes::font.addSearchPath(params.fontDirectory);\n SearchPathes::model.addSearchPath(params.modelDirectory);\n\n \/\/#ifdef SAIGA_USE_OPENGL\n \/\/ initSaigaGL(shaderDir, params.textureDirectory);\n \/\/#endif\n\n \/\/#ifdef SAIGA_USE_VULKAN\n \/\/ Vulkan::GLSLANG::init();\n \/\/#endif\n\n\n setThreadName(params.mainThreadName);\n\n\n\n el::Configurations defaultConf;\n defaultConf.setToDefault();\n if (params.logging_enabled)\n {\n cout << \"Enabling logging\" << endl;\n\n \/\/ Values are always std::string\n defaultConf.set(el::Level::Global, el::ConfigurationType::ToFile, \"false\");\n \/\/ defaultConf.set(el::Level::Global, el::ConfigurationType::ToStandardOutput,\n \/\/ std::to_string(params.logging_enabled));\n defaultConf.set(el::Level::Global, el::ConfigurationType::Enabled, std::to_string(params.logging_enabled));\n defaultConf.set(el::Level::Verbose, el::ConfigurationType::Enabled, std::to_string(params.verbose_logging));\n\n if (params.verbose_logging)\n {\n el::Loggers::setVerboseLevel(1);\n }\n }\n el::Loggers::reconfigureLogger(\"default\", defaultConf);\n\n\n printSaigaInfo();\n cout << \"========================== Saiga initialization done! ==========================\" << endl << endl;\n initialized = true;\n}\n\nvoid cleanupSaiga()\n{\n \/\/#ifdef SAIGA_USE_VULKAN\n \/\/ Saiga::Vulkan::GLSLANG::quit();\n \/\/#endif\n\n \/\/#ifdef SAIGA_USE_OPENGL\n \/\/ cleanupSaigaGL();\n \/\/#endif\n\n cout << \"========================== Saiga cleanup done! ==========================\" << endl;\n initialized = false;\n}\n\n\n\n} \/\/ namespace Saiga\n<|endoftext|>"} {"text":"<commit_before>\/*\n aboutdata.cpp\n\n This file is part of Kleopatra, the KDE keymanager\n Copyright (c) 2001,2002,2004 Klarlvdalens Datakonsult AB\n\n Kleopatra is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n Kleopatra is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"aboutdata.h\"\n\n#include <klocale.h>\n\nstatic const char kleopatra_version[] = \"0.30\";\nstatic const char description[] = I18N_NOOP(\"KDE Key Manager\");\n\nstruct about_data {\n const char * name;\n const char * desc;\n const char * email;\n const char * web;\n};\n\nstatic const about_data authors[] = {\n { \"Marc Mutz\", I18N_NOOP(\"Current Maintainer\"), \"mutz@kde.org\", 0 },\n { \"Steffen Hansen\", I18N_NOOP(\"Former Maintainer\"), \"hansen@kde.org\", 0 },\n { \"Kalle Dalheimer\", I18N_NOOP(\"Original Author\"), \"kalle@kde.org\", 0 },\n { \"Jesper Petersen\", I18N_NOOP(\"Original Author\"), \"blackie@kde.org\", 0 },\n};\n\n\nstatic const about_data credits[] = {\n { \"David Faure\",\n I18N_NOOP(\"Backend configuration framework, KIO integration\"),\n \"faure@kde.org\", 0 },\n { \"Michel Boyer de la Giroday\",\n I18N_NOOP(\"Key-state dependant colors and fonts in the key list\"),\n \"michel@klaralvdalens-datakonsult.se\", 0 },\n { \"Daniel Molkentin\",\n I18N_NOOP(\"Certificate Wizard KIOSK integration, infrastructure\"),\n \"molkentin@kde.org\", 0 },\n { \"Ralf Nolden\",\n I18N_NOOP(\"Support for obsolete EMAIL RDN in Certificate Wizard\"),\n \"nolden@kde.org\", 0 },\n { \"Karl-Heinz Zimmer\",\n I18N_NOOP(\"DN display ordering support, infrastructure\"),\n \"khz@kde.org\", 0 },\n};\n\n\nAboutData::AboutData()\n : KAboutData( \"kleopatra\", I18N_NOOP(\"Kleopatra\"),\n\t\tkleopatra_version, description, License_GPL,\n\t\t\"(c) 2002 Steffen Hansen, Jesper Pedersen,\\n\"\n\t\t\"Kalle Dalheimer, Klar\\xC3\\xA4lvdalens Datakonsult AB\\n\\n\"\n\t\t\"(c) 2004 Marc Mutz, Klar\\xC3\\xA4lvdalens Datakonsult AB\" )\n{\n using ::authors;\n using ::credits;\n for ( unsigned int i = 0 ; i < sizeof authors \/ sizeof *authors ; ++i )\n addAuthor( authors[i].name, authors[i].desc,\n\t authors[i].email, authors[i].web );\n for ( unsigned int i = 0 ; i < sizeof credits \/ sizeof *credits ; ++i )\n addCredit( credits[i].name, credits[i].desc,\n\t credits[i].email, credits[i].web );\n}\n<commit_msg>up the version<commit_after>\/*\n aboutdata.cpp\n\n This file is part of Kleopatra, the KDE keymanager\n Copyright (c) 2001,2002,2004 Klarlvdalens Datakonsult AB\n\n Kleopatra is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n Kleopatra is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"aboutdata.h\"\n\n#include <klocale.h>\n\nstatic const char kleopatra_version[] = \"0.31\";\nstatic const char description[] = I18N_NOOP(\"KDE Key Manager\");\n\nstruct about_data {\n const char * name;\n const char * desc;\n const char * email;\n const char * web;\n};\n\nstatic const about_data authors[] = {\n { \"Marc Mutz\", I18N_NOOP(\"Current Maintainer\"), \"mutz@kde.org\", 0 },\n { \"Steffen Hansen\", I18N_NOOP(\"Former Maintainer\"), \"hansen@kde.org\", 0 },\n { \"Kalle Dalheimer\", I18N_NOOP(\"Original Author\"), \"kalle@kde.org\", 0 },\n { \"Jesper Petersen\", I18N_NOOP(\"Original Author\"), \"blackie@kde.org\", 0 },\n};\n\n\nstatic const about_data credits[] = {\n { \"David Faure\",\n I18N_NOOP(\"Backend configuration framework, KIO integration\"),\n \"faure@kde.org\", 0 },\n { \"Michel Boyer de la Giroday\",\n I18N_NOOP(\"Key-state dependant colors and fonts in the key list\"),\n \"michel@klaralvdalens-datakonsult.se\", 0 },\n { \"Daniel Molkentin\",\n I18N_NOOP(\"Certificate Wizard KIOSK integration, infrastructure\"),\n \"molkentin@kde.org\", 0 },\n { \"Ralf Nolden\",\n I18N_NOOP(\"Support for obsolete EMAIL RDN in Certificate Wizard\"),\n \"nolden@kde.org\", 0 },\n { \"Karl-Heinz Zimmer\",\n I18N_NOOP(\"DN display ordering support, infrastructure\"),\n \"khz@kde.org\", 0 },\n};\n\n\nAboutData::AboutData()\n : KAboutData( \"kleopatra\", I18N_NOOP(\"Kleopatra\"),\n\t\tkleopatra_version, description, License_GPL,\n\t\t\"(c) 2002 Steffen Hansen, Jesper Pedersen,\\n\"\n\t\t\"Kalle Dalheimer, Klar\\xC3\\xA4lvdalens Datakonsult AB\\n\\n\"\n\t\t\"(c) 2004 Marc Mutz, Klar\\xC3\\xA4lvdalens Datakonsult AB\" )\n{\n using ::authors;\n using ::credits;\n for ( unsigned int i = 0 ; i < sizeof authors \/ sizeof *authors ; ++i )\n addAuthor( authors[i].name, authors[i].desc,\n\t authors[i].email, authors[i].web );\n for ( unsigned int i = 0 ; i < sizeof credits \/ sizeof *credits ; ++i )\n addCredit( credits[i].name, credits[i].desc,\n\t credits[i].email, credits[i].web );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2015, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the Daemon developers nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"common\/System.h\"\n#include \"common\/String.h\"\n#include \"Crypto.h\"\n#include <nettle\/aes.h>\n#include <nettle\/base64.h>\n#include <nettle\/md5.h>\n#include <nettle\/sha2.h>\n#include <nettle\/version.h>\n\n\/\/ Compatibility with old nettle versions\n#if !defined(AES256_KEY_SIZE)\n\n#define AES256_KEY_SIZE 32\n\ntypedef aes_ctx compat_aes256_ctx;\n\nstatic void nettle_compat_aes256_set_encrypt_key(compat_aes256_ctx *ctx, const uint8_t *key)\n{\n\tnettle_aes_set_encrypt_key(ctx, AES256_KEY_SIZE, key);\n}\n\nstatic void nettle_compat_aes256_set_decrypt_key(compat_aes256_ctx *ctx, const uint8_t *key)\n{\n\tnettle_aes_set_decrypt_key(ctx, AES256_KEY_SIZE, key);\n}\n\nstatic void nettle_compat_aes256_encrypt(const compat_aes256_ctx *ctx,\n\t\t\t\t\t\t size_t length, uint8_t *dst,\n\t\t\t\t\t\t const uint8_t *src)\n{\n\tnettle_aes_encrypt(ctx, length, dst, src);\n}\n\nstatic void nettle_compat_aes256_decrypt(const compat_aes256_ctx *ctx,\n\t\t\t\t\t\t size_t length, uint8_t *dst,\n\t\t\t\t\t\t const uint8_t *src)\n{\n\tnettle_aes_decrypt(ctx, length, dst, src);\n}\n\n\nstatic int nettle_compat_base64_decode_update(base64_decode_ctx *ctx,\n\t\t size_t *dst_length,\n\t\t uint8_t *dst,\n\t\t size_t src_length,\n\t\t const uint8_t *src)\n{\n\tunsigned dst_length_uns = *dst_length;\n\tnettle_base64_decode_update(ctx, &dst_length_uns, dst, src_length, src);\n}\n\n#undef aes256_set_encrypt_key\n#define nettle_aes256_set_encrypt_key nettle_compat_aes256_set_encrypt_key\n#define nettle_aes256_set_decrypt_key nettle_compat_aes256_set_decrypt_key\n#define nettle_aes256_invert_key nettle_compat_aes256_invert_key\n#define nettle_aes256_encrypt nettle_compat_aes256_encrypt\n#define nettle_aes256_decrypt nettle_compat_aes256_decrypt\n#define aes256_ctx compat_aes256_ctx\n#define nettle_base64_decode_update nettle_compat_base64_decode_update\n\n#endif \/\/ NETTLE_VERSION_MAJOR < 3\n\nnamespace Crypto {\n\nData RandomData( std::size_t bytes )\n{\n Data data( bytes );\n Sys::GenRandomBytes(data.data(), data.size());\n return data;\n}\n\nnamespace Encoding {\n\n\/*\n * Translates binary data into a hexadecimal string\n *\/\nData HexEncode( const Data& input )\n{\n std::ostringstream stream;\n stream.setf(std::ios::hex, std::ios::basefield);\n stream.fill('0');\n for ( auto ch : input )\n {\n stream.width(2);\n stream << int( ch );\n }\n auto string = stream.str();\n return Data(string.begin(), string.end());\n}\n\n\/*\n * Translates a hexadecimal string into binary data\n * PRE: input is a valid hexadecimal string\n * POST: output contains the decoded string\n * Returns true on success\n * Note: If the decoding fails, output is unchanged\n *\/\nbool HexDecode( const Data& input, Data& output )\n{\n if ( input.size() % 2 )\n {\n\t\treturn false;\n }\n\n Data mid( input.size() \/ 2 );\n\n for ( std::size_t i = 0; i < input.size(); i += 2 )\n {\n if ( !Str::cisxdigit( input[i] ) || !Str::cisxdigit( input[i+1] ) )\n {\n return false;\n }\n\n mid[ i \/ 2 ] = ( Str::GetHex( input[i] ) << 4 ) | Str::GetHex( input[i+1] );\n }\n\n output = mid;\n return true;\n}\n\n\/*\n * Translates binary data into a base64 encoded string\n *\/\nData Base64Encode( const Data& input )\n{\n base64_encode_ctx ctx;\n nettle_base64_encode_init( &ctx );\n\n Data output( BASE64_ENCODE_LENGTH( input.size() ) + BASE64_ENCODE_FINAL_LENGTH );\n int encoded_bytes = nettle_base64_encode_update(\n &ctx, output.data(), input.size(), input.data()\n );\n encoded_bytes += nettle_base64_encode_final( &ctx, output.data() + encoded_bytes );\n output.erase( output.begin() + encoded_bytes, output.end() );\n return output;\n}\n\n\/*\n * Translates a base64 encoded string into binary data\n * PRE: input is a valid Base64 string\n * POST: output contains the decoded string\n * Returns true on success\n * Note: If the decoding fails, output is unchanged\n *\/\nbool Base64Decode( const Data& input, Data& output )\n{\n base64_decode_ctx ctx;\n nettle_base64_decode_init( &ctx );\n\n Data temp( BASE64_DECODE_LENGTH( input.size() ) );\n std::size_t decoded_bytes = 0;\n if ( !nettle_base64_decode_update( &ctx, &decoded_bytes, temp.data(),\n input.size(), input.data() ) )\n {\n return false;\n }\n\n if ( !nettle_base64_decode_final( &ctx ) )\n {\n return false;\n }\n\n temp.erase( temp.begin() + decoded_bytes, temp.end() );\n output = temp;\n return true;\n}\n\n\n} \/\/ namespace Encoding\n\n\nnamespace Hash {\n\nData Sha256( const Data& input )\n{\n sha256_ctx ctx;\n nettle_sha256_init( &ctx );\n nettle_sha256_update( &ctx, input.size(), input.data() );\n Data output( SHA256_DIGEST_SIZE );\n nettle_sha256_digest( &ctx, SHA256_DIGEST_SIZE, output.data() );\n return output;\n}\n\nData Md5( const Data& input )\n{\n md5_ctx ctx;\n nettle_md5_init( &ctx );\n nettle_md5_update( &ctx, input.size(), input.data() );\n Data output( MD5_DIGEST_SIZE );\n nettle_md5_digest( &ctx, MD5_DIGEST_SIZE, output.data() );\n return output;\n}\n\n\n} \/\/ namespace Hash\n\n\/*\n * Adds PKCS#7 padding to the data\n *\/\nvoid AddPadding( Data& target, std::size_t block_size )\n{\n auto pad = block_size - target.size() % block_size;\n target.resize( target.size() + pad, pad );\n}\n\n\/*\n * Encrypts using the AES256 algorthim\n * PRE: Key is 256-bit (32 octects) long\n * POST: output contains the encrypted data\n * Notes: plain_text will be padded using the PKCS#7 algorthm,\n * if the decoding fails, output is unchanged\n * Returns true on success\n *\/\nbool Aes256Encrypt( Data plain_text, const Data& key, Data& output )\n{\n if ( key.size() != AES256_KEY_SIZE )\n {\n return false;\n }\n aes256_ctx ctx;\n nettle_aes256_set_encrypt_key( &ctx, key.data() );\n AddPadding( plain_text, AES_BLOCK_SIZE );\n output.resize( plain_text.size(), 0 );\n nettle_aes256_encrypt( &ctx, plain_text.size(),\n output.data(), plain_text.data() );\n nettle_aes256_decrypt( &ctx, plain_text.size(),\n plain_text.data(), output.data() );\n return true;\n}\n\n\/*\n * Encrypts using the AES256 algorthim\n * PRE: Key is 256-bit (32 octects) long,\n * cypher_text.size() is an integer multiple of the AES block size\n * POST: output contains the decrypted data\n * Note: If the decoding fails, output is unchanged\n * Returns true on success\n *\/\nbool Aes256Decrypt( Data cypher_text, const Data& key, Data& output )\n{\n if ( key.size() != AES256_KEY_SIZE || cypher_text.size() % AES_BLOCK_SIZE )\n {\n return true;\n }\n aes256_ctx ctx;\n nettle_aes256_set_decrypt_key( &ctx, key.data() );\n output.resize( cypher_text.size(), 0 );\n nettle_aes256_decrypt( &ctx, cypher_text.size(),\n output.data(), cypher_text.data() );\n return true;\n}\n\n} \/\/ namespace Crypto\n<commit_msg>Don't include nettle\/version.h<commit_after>\/*\n===========================================================================\nDaemon BSD Source Code\nCopyright (c) 2015, Daemon Developers\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the Daemon developers nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL DAEMON DEVELOPERS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n===========================================================================\n*\/\n\n#include \"common\/System.h\"\n#include \"common\/String.h\"\n#include \"Crypto.h\"\n#include <nettle\/aes.h>\n#include <nettle\/base64.h>\n#include <nettle\/md5.h>\n#include <nettle\/sha2.h>\n\n\/\/ Compatibility with old nettle versions\n#if !defined(AES256_KEY_SIZE)\n\n#define AES256_KEY_SIZE 32\n\ntypedef aes_ctx compat_aes256_ctx;\n\nstatic void nettle_compat_aes256_set_encrypt_key(compat_aes256_ctx *ctx, const uint8_t *key)\n{\n\tnettle_aes_set_encrypt_key(ctx, AES256_KEY_SIZE, key);\n}\n\nstatic void nettle_compat_aes256_set_decrypt_key(compat_aes256_ctx *ctx, const uint8_t *key)\n{\n\tnettle_aes_set_decrypt_key(ctx, AES256_KEY_SIZE, key);\n}\n\nstatic void nettle_compat_aes256_encrypt(const compat_aes256_ctx *ctx,\n\t\t\t\t\t\t size_t length, uint8_t *dst,\n\t\t\t\t\t\t const uint8_t *src)\n{\n\tnettle_aes_encrypt(ctx, length, dst, src);\n}\n\nstatic void nettle_compat_aes256_decrypt(const compat_aes256_ctx *ctx,\n\t\t\t\t\t\t size_t length, uint8_t *dst,\n\t\t\t\t\t\t const uint8_t *src)\n{\n\tnettle_aes_decrypt(ctx, length, dst, src);\n}\n\n\nstatic int nettle_compat_base64_decode_update(base64_decode_ctx *ctx,\n\t\t size_t *dst_length,\n\t\t uint8_t *dst,\n\t\t size_t src_length,\n\t\t const uint8_t *src)\n{\n\tunsigned dst_length_uns = *dst_length;\n\tnettle_base64_decode_update(ctx, &dst_length_uns, dst, src_length, src);\n}\n\n#undef aes256_set_encrypt_key\n#define nettle_aes256_set_encrypt_key nettle_compat_aes256_set_encrypt_key\n#define nettle_aes256_set_decrypt_key nettle_compat_aes256_set_decrypt_key\n#define nettle_aes256_invert_key nettle_compat_aes256_invert_key\n#define nettle_aes256_encrypt nettle_compat_aes256_encrypt\n#define nettle_aes256_decrypt nettle_compat_aes256_decrypt\n#define aes256_ctx compat_aes256_ctx\n#define nettle_base64_decode_update nettle_compat_base64_decode_update\n\n#endif \/\/ NETTLE_VERSION_MAJOR < 3\n\nnamespace Crypto {\n\nData RandomData( std::size_t bytes )\n{\n Data data( bytes );\n Sys::GenRandomBytes(data.data(), data.size());\n return data;\n}\n\nnamespace Encoding {\n\n\/*\n * Translates binary data into a hexadecimal string\n *\/\nData HexEncode( const Data& input )\n{\n std::ostringstream stream;\n stream.setf(std::ios::hex, std::ios::basefield);\n stream.fill('0');\n for ( auto ch : input )\n {\n stream.width(2);\n stream << int( ch );\n }\n auto string = stream.str();\n return Data(string.begin(), string.end());\n}\n\n\/*\n * Translates a hexadecimal string into binary data\n * PRE: input is a valid hexadecimal string\n * POST: output contains the decoded string\n * Returns true on success\n * Note: If the decoding fails, output is unchanged\n *\/\nbool HexDecode( const Data& input, Data& output )\n{\n if ( input.size() % 2 )\n {\n\t\treturn false;\n }\n\n Data mid( input.size() \/ 2 );\n\n for ( std::size_t i = 0; i < input.size(); i += 2 )\n {\n if ( !Str::cisxdigit( input[i] ) || !Str::cisxdigit( input[i+1] ) )\n {\n return false;\n }\n\n mid[ i \/ 2 ] = ( Str::GetHex( input[i] ) << 4 ) | Str::GetHex( input[i+1] );\n }\n\n output = mid;\n return true;\n}\n\n\/*\n * Translates binary data into a base64 encoded string\n *\/\nData Base64Encode( const Data& input )\n{\n base64_encode_ctx ctx;\n nettle_base64_encode_init( &ctx );\n\n Data output( BASE64_ENCODE_LENGTH( input.size() ) + BASE64_ENCODE_FINAL_LENGTH );\n int encoded_bytes = nettle_base64_encode_update(\n &ctx, output.data(), input.size(), input.data()\n );\n encoded_bytes += nettle_base64_encode_final( &ctx, output.data() + encoded_bytes );\n output.erase( output.begin() + encoded_bytes, output.end() );\n return output;\n}\n\n\/*\n * Translates a base64 encoded string into binary data\n * PRE: input is a valid Base64 string\n * POST: output contains the decoded string\n * Returns true on success\n * Note: If the decoding fails, output is unchanged\n *\/\nbool Base64Decode( const Data& input, Data& output )\n{\n base64_decode_ctx ctx;\n nettle_base64_decode_init( &ctx );\n\n Data temp( BASE64_DECODE_LENGTH( input.size() ) );\n std::size_t decoded_bytes = 0;\n if ( !nettle_base64_decode_update( &ctx, &decoded_bytes, temp.data(),\n input.size(), input.data() ) )\n {\n return false;\n }\n\n if ( !nettle_base64_decode_final( &ctx ) )\n {\n return false;\n }\n\n temp.erase( temp.begin() + decoded_bytes, temp.end() );\n output = temp;\n return true;\n}\n\n\n} \/\/ namespace Encoding\n\n\nnamespace Hash {\n\nData Sha256( const Data& input )\n{\n sha256_ctx ctx;\n nettle_sha256_init( &ctx );\n nettle_sha256_update( &ctx, input.size(), input.data() );\n Data output( SHA256_DIGEST_SIZE );\n nettle_sha256_digest( &ctx, SHA256_DIGEST_SIZE, output.data() );\n return output;\n}\n\nData Md5( const Data& input )\n{\n md5_ctx ctx;\n nettle_md5_init( &ctx );\n nettle_md5_update( &ctx, input.size(), input.data() );\n Data output( MD5_DIGEST_SIZE );\n nettle_md5_digest( &ctx, MD5_DIGEST_SIZE, output.data() );\n return output;\n}\n\n\n} \/\/ namespace Hash\n\n\/*\n * Adds PKCS#7 padding to the data\n *\/\nvoid AddPadding( Data& target, std::size_t block_size )\n{\n auto pad = block_size - target.size() % block_size;\n target.resize( target.size() + pad, pad );\n}\n\n\/*\n * Encrypts using the AES256 algorthim\n * PRE: Key is 256-bit (32 octects) long\n * POST: output contains the encrypted data\n * Notes: plain_text will be padded using the PKCS#7 algorthm,\n * if the decoding fails, output is unchanged\n * Returns true on success\n *\/\nbool Aes256Encrypt( Data plain_text, const Data& key, Data& output )\n{\n if ( key.size() != AES256_KEY_SIZE )\n {\n return false;\n }\n aes256_ctx ctx;\n nettle_aes256_set_encrypt_key( &ctx, key.data() );\n AddPadding( plain_text, AES_BLOCK_SIZE );\n output.resize( plain_text.size(), 0 );\n nettle_aes256_encrypt( &ctx, plain_text.size(),\n output.data(), plain_text.data() );\n nettle_aes256_decrypt( &ctx, plain_text.size(),\n plain_text.data(), output.data() );\n return true;\n}\n\n\/*\n * Encrypts using the AES256 algorthim\n * PRE: Key is 256-bit (32 octects) long,\n * cypher_text.size() is an integer multiple of the AES block size\n * POST: output contains the decrypted data\n * Note: If the decoding fails, output is unchanged\n * Returns true on success\n *\/\nbool Aes256Decrypt( Data cypher_text, const Data& key, Data& output )\n{\n if ( key.size() != AES256_KEY_SIZE || cypher_text.size() % AES_BLOCK_SIZE )\n {\n return true;\n }\n aes256_ctx ctx;\n nettle_aes256_set_decrypt_key( &ctx, key.data() );\n output.resize( cypher_text.size(), 0 );\n nettle_aes256_decrypt( &ctx, cypher_text.size(),\n output.data(), cypher_text.data() );\n return true;\n}\n\n} \/\/ namespace Crypto\n<|endoftext|>"} {"text":"<commit_before>#ifndef ENTT_SIGNAL_DELEGATE_HPP\n#define ENTT_SIGNAL_DELEGATE_HPP\n\n\n#include <tuple>\n#include <cstring>\n#include <utility>\n#include <algorithm>\n#include <functional>\n#include <type_traits>\n#include \"..\/config\/config.h\"\n\n\nnamespace entt {\n\n\n\/**\n * @cond TURN_OFF_DOXYGEN\n * Internal details not to be documented.\n *\/\n\n\nnamespace internal {\n\n\ntemplate<typename Ret, typename... Args>\nauto to_function_pointer(Ret(*)(Args...)) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename... Args, typename Type, typename Payload, typename = std::enable_if_t<std::is_convertible_v<Payload &, Type &>>>\nauto to_function_pointer(Ret(*)(Type &, Args...), Payload &) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename... Args, typename Type, typename Payload, typename = std::enable_if_t<std::is_convertible_v<Payload *, Type *>>>\nauto to_function_pointer(Ret(*)(Type *, Args...), Payload *) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args>\nauto to_function_pointer(Ret(Class:: *)(Args...), const Class &) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args>\nauto to_function_pointer(Ret(Class:: *)(Args...) const, const Class &) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Type>\nauto to_function_pointer(Type Class:: *, const Class &) -> Type(*)();\n\n\ntemplate<typename>\nstruct function_extent;\n\n\ntemplate<typename Ret, typename... Args>\nstruct function_extent<Ret(*)(Args...)> {\n static constexpr auto value = sizeof...(Args);\n};\n\n\ntemplate<typename Func>\nconstexpr auto function_extent_v = function_extent<Func>::value;\n\n\n}\n\n\n\/**\n * Internal details not to be documented.\n * @endcond TURN_OFF_DOXYGEN\n *\/\n\n\n\/*! @brief Used to wrap a function or a member of a specified type. *\/\ntemplate<auto>\nstruct connect_arg_t {};\n\n\n\/*! @brief Constant of type connect_arg_t used to disambiguate calls. *\/\ntemplate<auto Func>\nconstexpr connect_arg_t<Func> connect_arg{};\n\n\n\/**\n * @brief Basic delegate implementation.\n *\n * Primary template isn't defined on purpose. All the specializations give a\n * compile-time error unless the template parameter is a function type.\n *\/\ntemplate<typename>\nclass delegate;\n\n\n\/**\n * @brief Utility class to use to send around functions and members.\n *\n * Unmanaged delegate for function pointers and members. Users of this class are\n * in charge of disconnecting instances before deleting them.\n *\n * A delegate can be used as general purpose invoker with no memory overhead for\n * free functions (with or without payload) and members provided along with an\n * instance on which to invoke them.\n *\n * @tparam Ret Return type of a function type.\n * @tparam Args Types of arguments of a function type.\n *\/\ntemplate<typename Ret, typename... Args>\nclass delegate<Ret(Args...)> {\n using proto_fn_type = Ret(const void *, std::tuple<Args &&...>);\n\n template<auto Function, std::size_t... Index>\n void connect(std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Function), std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = nullptr;\n\n fn = [](const void *, std::tuple<Args &&...> args) -> Ret {\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Function, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\n template<auto Candidate, typename Type, std::size_t... Index>\n void connect(Type &value_or_instance, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = &value_or_instance;\n\n fn = [](const void *payload, std::tuple<Args &&...> args) -> Ret {\n Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Candidate, *curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\n template<auto Candidate, typename Type, std::size_t... Index>\n void connect(Type *value_or_instance, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = value_or_instance;\n\n fn = [](const void *payload, std::tuple<Args &&...> args) -> Ret {\n Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Candidate, curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\npublic:\n \/*! @brief Function type of the delegate. *\/\n using function_type = Ret(Args...);\n\n \/*! @brief Default constructor. *\/\n delegate() ENTT_NOEXCEPT\n : fn{nullptr}, data{nullptr}\n {}\n\n \/**\n * @brief Constructs a delegate and connects a free function to it.\n * @tparam Function A valid free function pointer.\n *\/\n template<auto Function>\n delegate(connect_arg_t<Function>) ENTT_NOEXCEPT\n : delegate{}\n {\n connect<Function>();\n }\n\n \/**\n * @brief Constructs a delegate and connects a member for a given instance\n * or a free function with payload.\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n * @param value_or_instance A valid object that fits the purpose.\n *\/\n template<auto Candidate, typename Type>\n delegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT\n : delegate{}\n {\n connect<Candidate>(std::forward<Type>(value_or_instance));\n }\n\n \/**\n * @brief Connects a free function to a delegate.\n * @tparam Function A valid free function pointer.\n *\/\n template<auto Function>\n void connect() ENTT_NOEXCEPT {\n constexpr auto extent = internal::function_extent_v<decltype(internal::to_function_pointer(std::declval<decltype(Function)>()))>;\n connect<Function>(std::make_index_sequence<extent>{});\n }\n\n \/**\n * @brief Connects a member function for a given instance or a free function\n * with payload to a delegate.\n *\n * The delegate isn't responsible for the connected object or the payload.\n * Users must always guarantee that the lifetime of the instance overcomes\n * the one of the delegate.<br\/>\n * When used to connect a free function with payload, its signature must be\n * such that the instance is the first argument before the ones used to\n * define the delegate itself.\n *\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n * @param value_or_instance A valid object that fits the purpose.\n *\/\n template<auto Candidate, typename Type>\n void connect(Type &&value_or_instance) ENTT_NOEXCEPT {\n constexpr auto extent = internal::function_extent_v<decltype(internal::to_function_pointer(std::declval<decltype(Candidate)>(), std::forward<Type>(value_or_instance)))>;\n connect<Candidate>(std::forward<Type>(value_or_instance), std::make_index_sequence<extent>{});\n }\n\n \/**\n * @brief Resets a delegate.\n *\n * After a reset, a delegate cannot be invoked anymore.\n *\/\n void reset() ENTT_NOEXCEPT {\n fn = nullptr;\n data = nullptr;\n }\n\n \/**\n * @brief Returns the instance or the payload linked to a delegate, if any.\n * @return An opaque pointer to the underlying data.\n *\/\n const void * instance() const ENTT_NOEXCEPT {\n return data;\n }\n\n \/**\n * @brief Triggers a delegate.\n *\n * The delegate invokes the underlying function and returns the result.\n *\n * @warning\n * Attempting to trigger an invalid delegate results in undefined\n * behavior.<br\/>\n * An assertion will abort the execution at runtime in debug mode if the\n * delegate has not yet been set.\n *\n * @param args Arguments to use to invoke the underlying function.\n * @return The value returned by the underlying function.\n *\/\n Ret operator()(Args... args) const {\n ENTT_ASSERT(fn);\n return fn(data, std::forward_as_tuple(std::forward<Args>(args)...));\n }\n\n \/**\n * @brief Checks whether a delegate actually stores a listener.\n * @return False if the delegate is empty, true otherwise.\n *\/\n explicit operator bool() const ENTT_NOEXCEPT {\n \/\/ no need to test also data\n return fn;\n }\n\n \/**\n * @brief Compares the contents of two delegates.\n * @param other Delegate with which to compare.\n * @return False if the two contents differ, true otherwise.\n *\/\n bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {\n return fn == other.fn && data == other.data;\n }\n\nprivate:\n proto_fn_type *fn;\n const void *data;\n};\n\n\n\/**\n * @brief Compares the contents of two delegates.\n * @tparam Ret Return type of a function type.\n * @tparam Args Types of arguments of a function type.\n * @param lhs A valid delegate object.\n * @param rhs A valid delegate object.\n * @return True if the two contents differ, false otherwise.\n *\/\ntemplate<typename Ret, typename... Args>\nbool operator!=(const delegate<Ret(Args...)> &lhs, const delegate<Ret(Args...)> &rhs) ENTT_NOEXCEPT {\n return !(lhs == rhs);\n}\n\n\n\/**\n * @brief Deduction guide.\n *\n * It allows to deduce the function type of the delegate directly from a\n * function provided to the constructor.\n *\n * @tparam Function A valid free function pointer.\n *\/\ntemplate<auto Function>\ndelegate(connect_arg_t<Function>) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<decltype(internal::to_function_pointer(Function))>>;\n\n\n\/**\n * @brief Deduction guide.\n *\n * It allows to deduce the function type of the delegate directly from a member\n * or a free function with payload provided to the constructor.\n *\n * @param value_or_instance A valid reference that fits the purpose.\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n *\/\ntemplate<auto Candidate, typename Type>\ndelegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<decltype(internal::to_function_pointer(Candidate, std::forward<Type>(value_or_instance)))>>;\n\n\n}\n\n\n#endif \/\/ ENTT_SIGNAL_DELEGATE_HPP\n<commit_msg>minor changes<commit_after>#ifndef ENTT_SIGNAL_DELEGATE_HPP\n#define ENTT_SIGNAL_DELEGATE_HPP\n\n\n#include <tuple>\n#include <cstring>\n#include <utility>\n#include <algorithm>\n#include <functional>\n#include <type_traits>\n#include \"..\/config\/config.h\"\n\n\nnamespace entt {\n\n\n\/**\n * @cond TURN_OFF_DOXYGEN\n * Internal details not to be documented.\n *\/\n\n\nnamespace internal {\n\n\ntemplate<typename Ret, typename... Args>\nauto to_function_pointer(Ret(*)(Args...)) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename... Args, typename Type, typename Payload, typename = std::enable_if_t<std::is_convertible_v<const Payload &, const Type &>>>\nauto to_function_pointer(Ret(*)(Type &, Args...), const Payload &) -> Ret(*)(Args...);\n\n\ntemplate<typename Ret, typename... Args, typename Type, typename Payload, typename = std::enable_if_t<std::is_convertible_v<const Payload *, const Type *>>>\nauto to_function_pointer(Ret(*)(Type *, Args...), const Payload *) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args>\nauto to_function_pointer(Ret(Class:: *)(Args...), const Class &) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Ret, typename... Args>\nauto to_function_pointer(Ret(Class:: *)(Args...) const, const Class &) -> Ret(*)(Args...);\n\n\ntemplate<typename Class, typename Type>\nauto to_function_pointer(Type Class:: *, const Class &) -> Type(*)();\n\n\ntemplate<typename... Type>\nusing to_function_pointer_t = decltype(internal::to_function_pointer(std::declval<Type>()...));\n\n\ntemplate<typename>\nstruct function_extent;\n\n\ntemplate<typename Ret, typename... Args>\nstruct function_extent<Ret(*)(Args...)> {\n static constexpr auto value = sizeof...(Args);\n};\n\n\ntemplate<typename Func>\nconstexpr auto function_extent_v = function_extent<Func>::value;\n\n\n}\n\n\n\/**\n * Internal details not to be documented.\n * @endcond TURN_OFF_DOXYGEN\n *\/\n\n\n\/*! @brief Used to wrap a function or a member of a specified type. *\/\ntemplate<auto>\nstruct connect_arg_t {};\n\n\n\/*! @brief Constant of type connect_arg_t used to disambiguate calls. *\/\ntemplate<auto Func>\nconstexpr connect_arg_t<Func> connect_arg{};\n\n\n\/**\n * @brief Basic delegate implementation.\n *\n * Primary template isn't defined on purpose. All the specializations give a\n * compile-time error unless the template parameter is a function type.\n *\/\ntemplate<typename>\nclass delegate;\n\n\n\/**\n * @brief Utility class to use to send around functions and members.\n *\n * Unmanaged delegate for function pointers and members. Users of this class are\n * in charge of disconnecting instances before deleting them.\n *\n * A delegate can be used as general purpose invoker with no memory overhead for\n * free functions (with or without payload) and members provided along with an\n * instance on which to invoke them.\n *\n * @tparam Ret Return type of a function type.\n * @tparam Args Types of arguments of a function type.\n *\/\ntemplate<typename Ret, typename... Args>\nclass delegate<Ret(Args...)> {\n using proto_fn_type = Ret(const void *, std::tuple<Args &&...>);\n\n template<auto Function, std::size_t... Index>\n void connect(std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Function), std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = nullptr;\n\n fn = [](const void *, std::tuple<Args &&...> args) -> Ret {\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Function, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\n template<auto Candidate, typename Type, std::size_t... Index>\n void connect(Type &value_or_instance, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = &value_or_instance;\n\n fn = [](const void *payload, std::tuple<Args &&...> args) -> Ret {\n Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Candidate, *curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\n template<auto Candidate, typename Type, std::size_t... Index>\n void connect(Type *value_or_instance, std::index_sequence<Index...>) ENTT_NOEXCEPT {\n static_assert(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, std::tuple_element_t<Index, std::tuple<Args...>>...>);\n data = value_or_instance;\n\n fn = [](const void *payload, std::tuple<Args &&...> args) -> Ret {\n Type *curr = static_cast<Type *>(const_cast<std::conditional_t<std::is_const_v<Type>, const void *, void *>>(payload));\n \/\/ Ret(...) makes void(...) eat the return values to avoid errors\n return Ret(std::invoke(Candidate, curr, std::forward<std::tuple_element_t<Index, std::tuple<Args...>>>(std::get<Index>(args))...));\n };\n }\n\npublic:\n \/*! @brief Function type of the delegate. *\/\n using function_type = Ret(Args...);\n\n \/*! @brief Default constructor. *\/\n delegate() ENTT_NOEXCEPT\n : fn{nullptr}, data{nullptr}\n {}\n\n \/**\n * @brief Constructs a delegate and connects a free function to it.\n * @tparam Function A valid free function pointer.\n *\/\n template<auto Function>\n delegate(connect_arg_t<Function>) ENTT_NOEXCEPT\n : delegate{}\n {\n connect<Function>();\n }\n\n \/**\n * @brief Constructs a delegate and connects a member for a given instance\n * or a free function with payload.\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n * @param value_or_instance A valid object that fits the purpose.\n *\/\n template<auto Candidate, typename Type>\n delegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT\n : delegate{}\n {\n connect<Candidate>(std::forward<Type>(value_or_instance));\n }\n\n \/**\n * @brief Connects a free function to a delegate.\n * @tparam Function A valid free function pointer.\n *\/\n template<auto Function>\n void connect() ENTT_NOEXCEPT {\n constexpr auto extent = internal::function_extent_v<internal::to_function_pointer_t<decltype(Function)>>;\n connect<Function>(std::make_index_sequence<extent>{});\n }\n\n \/**\n * @brief Connects a member function for a given instance or a free function\n * with payload to a delegate.\n *\n * The delegate isn't responsible for the connected object or the payload.\n * Users must always guarantee that the lifetime of the instance overcomes\n * the one of the delegate.<br\/>\n * When used to connect a free function with payload, its signature must be\n * such that the instance is the first argument before the ones used to\n * define the delegate itself.\n *\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n * @param value_or_instance A valid object that fits the purpose.\n *\/\n template<auto Candidate, typename Type>\n void connect(Type &&value_or_instance) ENTT_NOEXCEPT {\n constexpr auto extent = internal::function_extent_v<internal::to_function_pointer_t<decltype(Candidate), Type>>;\n connect<Candidate>(std::forward<Type>(std::forward<Type>(value_or_instance)), std::make_index_sequence<extent>{});\n }\n\n \/**\n * @brief Resets a delegate.\n *\n * After a reset, a delegate cannot be invoked anymore.\n *\/\n void reset() ENTT_NOEXCEPT {\n fn = nullptr;\n data = nullptr;\n }\n\n \/**\n * @brief Returns the instance or the payload linked to a delegate, if any.\n * @return An opaque pointer to the underlying data.\n *\/\n const void * instance() const ENTT_NOEXCEPT {\n return data;\n }\n\n \/**\n * @brief Triggers a delegate.\n *\n * The delegate invokes the underlying function and returns the result.\n *\n * @warning\n * Attempting to trigger an invalid delegate results in undefined\n * behavior.<br\/>\n * An assertion will abort the execution at runtime in debug mode if the\n * delegate has not yet been set.\n *\n * @param args Arguments to use to invoke the underlying function.\n * @return The value returned by the underlying function.\n *\/\n Ret operator()(Args... args) const {\n ENTT_ASSERT(fn);\n return fn(data, std::forward_as_tuple(std::forward<Args>(args)...));\n }\n\n \/**\n * @brief Checks whether a delegate actually stores a listener.\n * @return False if the delegate is empty, true otherwise.\n *\/\n explicit operator bool() const ENTT_NOEXCEPT {\n \/\/ no need to test also data\n return fn;\n }\n\n \/**\n * @brief Compares the contents of two delegates.\n * @param other Delegate with which to compare.\n * @return False if the two contents differ, true otherwise.\n *\/\n bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {\n return fn == other.fn && data == other.data;\n }\n\nprivate:\n proto_fn_type *fn;\n const void *data;\n};\n\n\n\/**\n * @brief Compares the contents of two delegates.\n * @tparam Ret Return type of a function type.\n * @tparam Args Types of arguments of a function type.\n * @param lhs A valid delegate object.\n * @param rhs A valid delegate object.\n * @return True if the two contents differ, false otherwise.\n *\/\ntemplate<typename Ret, typename... Args>\nbool operator!=(const delegate<Ret(Args...)> &lhs, const delegate<Ret(Args...)> &rhs) ENTT_NOEXCEPT {\n return !(lhs == rhs);\n}\n\n\n\/**\n * @brief Deduction guide.\n *\n * It allows to deduce the function type of the delegate directly from a\n * function provided to the constructor.\n *\n * @tparam Function A valid free function pointer.\n *\/\ntemplate<auto Function>\ndelegate(connect_arg_t<Function>) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::to_function_pointer_t<decltype(Function)>>>;\n\n\n\/**\n * @brief Deduction guide.\n *\n * It allows to deduce the function type of the delegate directly from a member\n * or a free function with payload provided to the constructor.\n *\n * @param value_or_instance A valid reference that fits the purpose.\n * @tparam Candidate Member or free function to connect to the delegate.\n * @tparam Type Type of class or type of payload.\n *\/\ntemplate<auto Candidate, typename Type>\ndelegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT\n-> delegate<std::remove_pointer_t<internal::to_function_pointer_t<decltype(Candidate), Type>>>;\n\n\n}\n\n\n#endif \/\/ ENTT_SIGNAL_DELEGATE_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/media\/desktop_media_picker_model.h\"\n\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"content\/public\/test\/test_browser_thread.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/screen_capturer.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/window_capturer.h\"\n\nusing testing::_;\nusing testing::AtMost;\nusing testing::DoAll;\n\nnamespace {\n\nclass MockObserver : public DesktopMediaPickerModel::Observer {\n public:\n MOCK_METHOD1(OnSourceAdded, void(int index));\n MOCK_METHOD1(OnSourceRemoved, void(int index));\n MOCK_METHOD1(OnSourceNameChanged, void(int index));\n MOCK_METHOD1(OnSourceThumbnailChanged, void(int index));\n};\n\nclass FakeScreenCapturer : public webrtc::ScreenCapturer {\n public:\n FakeScreenCapturer() {}\n virtual ~FakeScreenCapturer() {}\n\n \/\/ webrtc::ScreenCapturer implementation.\n virtual void Start(Callback* callback) OVERRIDE {\n callback_ = callback;\n }\n\n virtual void Capture(const webrtc::DesktopRegion& region) OVERRIDE {\n DCHECK(callback_);\n webrtc::DesktopFrame* frame =\n new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10));\n memset(frame->data(), 0, frame->stride() * frame->size().height());\n callback_->OnCaptureCompleted(frame);\n }\n\n virtual void SetMouseShapeObserver(\n MouseShapeObserver* mouse_shape_observer) OVERRIDE {\n NOTIMPLEMENTED();\n }\n\n protected:\n Callback* callback_;\n\n DISALLOW_COPY_AND_ASSIGN(FakeScreenCapturer);\n};\n\nclass FakeWindowCapturer : public webrtc::WindowCapturer {\n public:\n FakeWindowCapturer()\n : callback_(NULL) {\n }\n virtual ~FakeWindowCapturer() {\n STLDeleteContainerPairSecondPointers(frames_.begin(), frames_.end());\n }\n\n void SetWindowList(const WindowList& list) {\n base::AutoLock lock(window_list_lock_);\n window_list_ = list;\n }\n\n void SetNextFrame(WindowId window_id,\n scoped_ptr<webrtc::DesktopFrame> frame) {\n frames_[window_id] = frame.release();\n }\n\n \/\/ webrtc::WindowCapturer implementation.\n virtual void Start(Callback* callback) OVERRIDE {\n callback_ = callback;\n }\n\n virtual void Capture(const webrtc::DesktopRegion& region) OVERRIDE {\n DCHECK(callback_);\n\n webrtc::DesktopFrame* frame;\n std::map<WindowId, webrtc::DesktopFrame*>::iterator it =\n frames_.find(selected_window_id_);\n if (it == frames_.end()) {\n frame = new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10));\n memset(frame->data(), 0, frame->stride() * frame->size().height());\n } else {\n frame = it->second;\n frames_.erase(it);\n }\n callback_->OnCaptureCompleted(frame);\n }\n\n virtual bool GetWindowList(WindowList* windows) OVERRIDE {\n base::AutoLock lock(window_list_lock_);\n *windows = window_list_;\n return true;\n }\n\n virtual bool SelectWindow(WindowId id) OVERRIDE {\n selected_window_id_ = id;\n return true;\n }\n\n private:\n Callback* callback_;\n WindowList window_list_;\n base::Lock window_list_lock_;\n\n WindowId selected_window_id_;\n\n \/\/ Frames to be captured per window.\n std::map<WindowId, webrtc::DesktopFrame*> frames_;\n\n DISALLOW_COPY_AND_ASSIGN(FakeWindowCapturer);\n};\n\nclass DesktopMediaPickerModelTest : public testing::Test {\n public:\n DesktopMediaPickerModelTest()\n : ui_thread_(content::BrowserThread::UI,\n &message_loop_) {\n window_capturer_ = new FakeWindowCapturer();\n \/\/ Set update period to reduce the time it takes to run tests.\n model_.SetUpdatePeriod(base::TimeDelta::FromMilliseconds(0));\n }\n\n void SetDefaultCapturers() {\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(new FakeScreenCapturer()),\n scoped_ptr<webrtc::WindowCapturer>(window_capturer_));\n }\n\n protected:\n \/\/ Must be listed before |model_|, so it's destroyed last.\n MockObserver observer_;\n\n \/\/ Owned by |model_|;\n FakeWindowCapturer* window_capturer_;\n\n DesktopMediaPickerModel model_;\n\n base::MessageLoop message_loop_;\n content::TestBrowserThread ui_thread_;\n\n DISALLOW_COPY_AND_ASSIGN(DesktopMediaPickerModelTest);\n};\n\nACTION_P2(CheckListSize, model, expected_list_size) {\n EXPECT_EQ(expected_list_size, model->source_count());\n}\n\nACTION_P(QuitMessageLoop, message_loop) {\n message_loop->PostTask(FROM_HERE, base::MessageLoop::QuitClosure());\n}\n\nTEST_F(DesktopMediaPickerModelTest, InitialSourceList) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_SCREEN_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(0).id.id, 0);\n EXPECT_EQ(model_.source(1).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(1).id.id, 0);\n EXPECT_EQ(model_.source(1).name, UTF8ToUTF16(window.title));\n}\n\nTEST_F(DesktopMediaPickerModelTest, WindowsOnly) {\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(),\n scoped_ptr<webrtc::WindowCapturer>(window_capturer_));\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n}\n\nTEST_F(DesktopMediaPickerModelTest, ScreenOnly) {\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(new FakeScreenCapturer),\n scoped_ptr<webrtc::WindowCapturer>());\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_SCREEN_VIDEO_CAPTURE);\n}\n\nTEST_F(DesktopMediaPickerModelTest, AddWindow) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 1;\n window.title = \"Test window 1\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(DoAll(CheckListSize(&model_, 3),\n QuitMessageLoop(&message_loop_)));\n\n window.id = 0;\n window.title = \"Test window 0\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(1).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(1).id.id, 0);\n}\n\nTEST_F(DesktopMediaPickerModelTest, RemoveWindow) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window 0\";\n list.push_back(window);\n window.id = 1;\n window.title = \"Test window 1\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceAdded(2))\n .WillOnce(CheckListSize(&model_, 3));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(2))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceRemoved(1))\n .WillOnce(DoAll(CheckListSize(&model_, 2),\n QuitMessageLoop(&message_loop_)));\n\n list.erase(list.begin());\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n}\n\nTEST_F(DesktopMediaPickerModelTest, UpdateTitle) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceNameChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n\n const std::string kTestTitle = \"New Title\";\n\n list[0].title = kTestTitle;\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(1).name, base::UTF8ToUTF16(kTestTitle));\n}\n\nTEST_F(DesktopMediaPickerModelTest, UpdateThumbnail) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window 1\";\n list.push_back(window);\n window.id = 1;\n window.title = \"Test window 2\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceAdded(2))\n .WillOnce(CheckListSize(&model_, 3));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(2))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n\n \/\/ Update frame for the window and verify that we get notification about it.\n scoped_ptr<webrtc::DesktopFrame> frame(\n new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10)));\n memset(frame->data(), 1, frame->stride() * frame->size().height());\n window_capturer_->SetNextFrame(0, frame.Pass());\n\n message_loop_.Run();\n}\n\n} \/\/ namespace\n<commit_msg>Fix memory leak in DesktopMediaPickerModelTest.ScreenOnly<commit_after>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/media\/desktop_media_picker_model.h\"\n\n#include \"base\/message_loop\/message_loop.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"content\/public\/test\/test_browser_thread.h\"\n#include \"testing\/gmock\/include\/gmock\/gmock.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/desktop_frame.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/screen_capturer.h\"\n#include \"third_party\/webrtc\/modules\/desktop_capture\/window_capturer.h\"\n\nusing testing::_;\nusing testing::AtMost;\nusing testing::DoAll;\n\nnamespace {\n\nclass MockObserver : public DesktopMediaPickerModel::Observer {\n public:\n MOCK_METHOD1(OnSourceAdded, void(int index));\n MOCK_METHOD1(OnSourceRemoved, void(int index));\n MOCK_METHOD1(OnSourceNameChanged, void(int index));\n MOCK_METHOD1(OnSourceThumbnailChanged, void(int index));\n};\n\nclass FakeScreenCapturer : public webrtc::ScreenCapturer {\n public:\n FakeScreenCapturer() {}\n virtual ~FakeScreenCapturer() {}\n\n \/\/ webrtc::ScreenCapturer implementation.\n virtual void Start(Callback* callback) OVERRIDE {\n callback_ = callback;\n }\n\n virtual void Capture(const webrtc::DesktopRegion& region) OVERRIDE {\n DCHECK(callback_);\n webrtc::DesktopFrame* frame =\n new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10));\n memset(frame->data(), 0, frame->stride() * frame->size().height());\n callback_->OnCaptureCompleted(frame);\n }\n\n virtual void SetMouseShapeObserver(\n MouseShapeObserver* mouse_shape_observer) OVERRIDE {\n NOTIMPLEMENTED();\n }\n\n protected:\n Callback* callback_;\n\n DISALLOW_COPY_AND_ASSIGN(FakeScreenCapturer);\n};\n\nclass FakeWindowCapturer : public webrtc::WindowCapturer {\n public:\n FakeWindowCapturer()\n : callback_(NULL) {\n }\n virtual ~FakeWindowCapturer() {\n STLDeleteContainerPairSecondPointers(frames_.begin(), frames_.end());\n }\n\n void SetWindowList(const WindowList& list) {\n base::AutoLock lock(window_list_lock_);\n window_list_ = list;\n }\n\n void SetNextFrame(WindowId window_id,\n scoped_ptr<webrtc::DesktopFrame> frame) {\n frames_[window_id] = frame.release();\n }\n\n \/\/ webrtc::WindowCapturer implementation.\n virtual void Start(Callback* callback) OVERRIDE {\n callback_ = callback;\n }\n\n virtual void Capture(const webrtc::DesktopRegion& region) OVERRIDE {\n DCHECK(callback_);\n\n webrtc::DesktopFrame* frame;\n std::map<WindowId, webrtc::DesktopFrame*>::iterator it =\n frames_.find(selected_window_id_);\n if (it == frames_.end()) {\n frame = new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10));\n memset(frame->data(), 0, frame->stride() * frame->size().height());\n } else {\n frame = it->second;\n frames_.erase(it);\n }\n callback_->OnCaptureCompleted(frame);\n }\n\n virtual bool GetWindowList(WindowList* windows) OVERRIDE {\n base::AutoLock lock(window_list_lock_);\n *windows = window_list_;\n return true;\n }\n\n virtual bool SelectWindow(WindowId id) OVERRIDE {\n selected_window_id_ = id;\n return true;\n }\n\n private:\n Callback* callback_;\n WindowList window_list_;\n base::Lock window_list_lock_;\n\n WindowId selected_window_id_;\n\n \/\/ Frames to be captured per window.\n std::map<WindowId, webrtc::DesktopFrame*> frames_;\n\n DISALLOW_COPY_AND_ASSIGN(FakeWindowCapturer);\n};\n\nclass DesktopMediaPickerModelTest : public testing::Test {\n public:\n DesktopMediaPickerModelTest()\n : window_capturer_(NULL),\n ui_thread_(content::BrowserThread::UI,\n &message_loop_) {\n \/\/ Set update period to reduce the time it takes to run tests.\n model_.SetUpdatePeriod(base::TimeDelta::FromMilliseconds(0));\n }\n\n void SetDefaultCapturers() {\n window_capturer_ = new FakeWindowCapturer();\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(new FakeScreenCapturer()),\n scoped_ptr<webrtc::WindowCapturer>(window_capturer_));\n }\n\n protected:\n \/\/ Must be listed before |model_|, so it's destroyed last.\n MockObserver observer_;\n\n \/\/ Owned by |model_|;\n FakeWindowCapturer* window_capturer_;\n\n DesktopMediaPickerModel model_;\n\n base::MessageLoop message_loop_;\n content::TestBrowserThread ui_thread_;\n\n DISALLOW_COPY_AND_ASSIGN(DesktopMediaPickerModelTest);\n};\n\nACTION_P2(CheckListSize, model, expected_list_size) {\n EXPECT_EQ(expected_list_size, model->source_count());\n}\n\nACTION_P(QuitMessageLoop, message_loop) {\n message_loop->PostTask(FROM_HERE, base::MessageLoop::QuitClosure());\n}\n\nTEST_F(DesktopMediaPickerModelTest, InitialSourceList) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_SCREEN_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(0).id.id, 0);\n EXPECT_EQ(model_.source(1).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(1).id.id, 0);\n EXPECT_EQ(model_.source(1).name, UTF8ToUTF16(window.title));\n}\n\nTEST_F(DesktopMediaPickerModelTest, WindowsOnly) {\n window_capturer_ = new FakeWindowCapturer();\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(),\n scoped_ptr<webrtc::WindowCapturer>(window_capturer_));\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n}\n\nTEST_F(DesktopMediaPickerModelTest, ScreenOnly) {\n model_.SetCapturers(\n scoped_ptr<webrtc::ScreenCapturer>(new FakeScreenCapturer),\n scoped_ptr<webrtc::WindowCapturer>());\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(0).id.type, content::MEDIA_SCREEN_VIDEO_CAPTURE);\n}\n\nTEST_F(DesktopMediaPickerModelTest, AddWindow) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 1;\n window.title = \"Test window 1\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(DoAll(CheckListSize(&model_, 3),\n QuitMessageLoop(&message_loop_)));\n\n window.id = 0;\n window.title = \"Test window 0\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(1).id.type, content::MEDIA_WINDOW_VIDEO_CAPTURE);\n EXPECT_EQ(model_.source(1).id.id, 0);\n}\n\nTEST_F(DesktopMediaPickerModelTest, RemoveWindow) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window 0\";\n list.push_back(window);\n window.id = 1;\n window.title = \"Test window 1\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceAdded(2))\n .WillOnce(CheckListSize(&model_, 3));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(2))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceRemoved(1))\n .WillOnce(DoAll(CheckListSize(&model_, 2),\n QuitMessageLoop(&message_loop_)));\n\n list.erase(list.begin());\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n}\n\nTEST_F(DesktopMediaPickerModelTest, UpdateTitle) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceNameChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n\n const std::string kTestTitle = \"New Title\";\n\n list[0].title = kTestTitle;\n window_capturer_->SetWindowList(list);\n\n message_loop_.Run();\n\n EXPECT_EQ(model_.source(1).name, base::UTF8ToUTF16(kTestTitle));\n}\n\nTEST_F(DesktopMediaPickerModelTest, UpdateThumbnail) {\n SetDefaultCapturers();\n\n webrtc::WindowCapturer::WindowList list;\n webrtc::WindowCapturer::Window window;\n window.id = 0;\n window.title = \"Test window 1\";\n list.push_back(window);\n window.id = 1;\n window.title = \"Test window 2\";\n list.push_back(window);\n window_capturer_->SetWindowList(list);\n\n {\n testing::InSequence dummy;\n EXPECT_CALL(observer_, OnSourceAdded(0))\n .WillOnce(CheckListSize(&model_, 1));\n EXPECT_CALL(observer_, OnSourceAdded(1))\n .WillOnce(CheckListSize(&model_, 2));\n EXPECT_CALL(observer_, OnSourceAdded(2))\n .WillOnce(CheckListSize(&model_, 3));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(0));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1));\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(2))\n .WillOnce(QuitMessageLoop(&message_loop_));\n }\n model_.StartUpdating(&observer_);\n\n message_loop_.Run();\n\n testing::Mock::VerifyAndClearExpectations(&observer_);\n\n EXPECT_CALL(observer_, OnSourceThumbnailChanged(1))\n .WillOnce(QuitMessageLoop(&message_loop_));\n\n \/\/ Update frame for the window and verify that we get notification about it.\n scoped_ptr<webrtc::DesktopFrame> frame(\n new webrtc::BasicDesktopFrame(webrtc::DesktopSize(10, 10)));\n memset(frame->data(), 1, frame->stride() * frame->size().height());\n window_capturer_->SetNextFrame(0, frame.Pass());\n\n message_loop_.Run();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include <glog\/logging.h>\n#include <util.h>\n#include <mailer_pool.h>\n\nusing namespace std::placeholders;\n\nnamespace {\n\nstruct mailer_extra {\n const std::string server;\n const std::string from;\n const std::vector<std::string> to;\n};\n\nconst std::string k_smtp_url = \"smtp:\/\/localhost\";\n\ntypedef std::pair<std::vector<char>, size_t> payload_t;\n\nsize_t payload_source(void *ptr, size_t size, size_t nmemb, void *userp)\n{\n\n if((size == 0) || (nmemb == 0) || ((size * nmemb) < 1)) {\n return 0;\n }\n\n auto payload_data = static_cast<payload_t*>(userp);\n\n size_t copied = payload_data->second;\n size_t left = payload_data->first.size() - copied;\n size_t to_copy = std::min(size * nmemb, left);\n\n if (to_copy > 0) {\n\n memcpy(ptr, static_cast<void*>(&payload_data->first[copied]), to_copy);\n payload_data->second += to_copy;\n\n return to_copy;\n\n } else {\n return 0;\n }\n\n}\n\nstd::vector<char> payload_text(const mailer_extra extra, const Event & e) {\n\n std::string to = \"unknown\";\n\n if (!extra.to.empty()) {\n to = extra.to[0];\n }\n\n std::string subject = e.host() + \" \" + e.service() + \" is \" + e.state()\n + metric_to_string(e);\n\n std::string payload = \"To: \" + to + \"\\r\\n\" +\n \"From: \" + extra.from + \"\\r\\n\" +\n \"Subject: \" + subject + \"\\r\\n\" +\n \"\\r\\n\" +\n event_to_json(e);\n\n return std::vector<char>(payload.begin(), payload.end());\n}\n\n}\n\nmailer_pool::mailer_pool(const size_t thread_num)\n :\n curl_pool_(\n thread_num,\n std::bind(&mailer_pool::curl_event, this, _1, _2, _3)\n )\n{\n}\n\nvoid mailer_pool::push_event(const std::string server, const std::string from,\n const std::vector<std::string> to,\n const Event & event)\n{\n VLOG(3) << \"push_event() server: \" << server << \" from: \" << from;\n\n mailer_extra extra = {server, from, to};\n curl_pool_.push_event(event, extra);\n\n}\n\nvoid mailer_pool::curl_event(const queued_event_t queued_event,\n const std::shared_ptr<CURL> easy,\n std::function<void()> & clean_fn)\n{\n\n const auto extra = boost::any_cast<mailer_extra>(queued_event.extra);\n const auto & e = queued_event.event;\n\n\tstd::shared_ptr<std::string> server(new std::string(extra.server));\n\tstd::shared_ptr<std::string> from(new std::string(extra.from));\n\n struct curl_slist *recipients = NULL;\n for (const auto & to : extra.to) {\n recipients = curl_slist_append(recipients, to.c_str());\n }\n\n auto payload = std::make_shared<payload_t>(\n payload_t({payload_text(extra, e), 0}));\n\n curl_easy_setopt(easy.get(), CURLOPT_URL, k_smtp_url.c_str());\n curl_easy_setopt(easy.get(), CURLOPT_MAIL_FROM, from->c_str());\n curl_easy_setopt(easy.get(), CURLOPT_MAIL_RCPT, recipients);\n curl_easy_setopt(easy.get(), CURLOPT_UPLOAD, 1L);\n curl_easy_setopt(easy.get(), CURLOPT_READFUNCTION, payload_source);\n curl_easy_setopt(easy.get(), CURLOPT_READDATA, payload.get());\n\n clean_fn = [=]()\n {\n UNUSED_VAR(server);\n UNUSED_VAR(from);\n UNUSED_VAR(payload);\n };\n\n}\n<commit_msg>Free recipients list in mailer_pool<commit_after>#include <glog\/logging.h>\n#include <util.h>\n#include <mailer_pool.h>\n\nusing namespace std::placeholders;\n\nnamespace {\n\nstruct mailer_extra {\n const std::string server;\n const std::string from;\n const std::vector<std::string> to;\n};\n\nconst std::string k_smtp_url = \"smtp:\/\/localhost\";\n\ntypedef std::pair<std::vector<char>, size_t> payload_t;\n\nsize_t payload_source(void *ptr, size_t size, size_t nmemb, void *userp)\n{\n\n if((size == 0) || (nmemb == 0) || ((size * nmemb) < 1)) {\n return 0;\n }\n\n auto payload_data = static_cast<payload_t*>(userp);\n\n size_t copied = payload_data->second;\n size_t left = payload_data->first.size() - copied;\n size_t to_copy = std::min(size * nmemb, left);\n\n if (to_copy > 0) {\n\n memcpy(ptr, static_cast<void*>(&payload_data->first[copied]), to_copy);\n payload_data->second += to_copy;\n\n return to_copy;\n\n } else {\n return 0;\n }\n\n}\n\nstd::vector<char> payload_text(const mailer_extra extra, const Event & e) {\n\n std::string to = \"unknown\";\n\n if (!extra.to.empty()) {\n to = extra.to[0];\n }\n\n std::string subject = e.host() + \" \" + e.service() + \" is \" + e.state()\n + metric_to_string(e);\n\n std::string payload = \"To: \" + to + \"\\r\\n\" +\n \"From: \" + extra.from + \"\\r\\n\" +\n \"Subject: \" + subject + \"\\r\\n\" +\n \"\\r\\n\" +\n event_to_json(e);\n\n return std::vector<char>(payload.begin(), payload.end());\n}\n\n}\n\nmailer_pool::mailer_pool(const size_t thread_num)\n :\n curl_pool_(\n thread_num,\n std::bind(&mailer_pool::curl_event, this, _1, _2, _3)\n )\n{\n}\n\nvoid mailer_pool::push_event(const std::string server, const std::string from,\n const std::vector<std::string> to,\n const Event & event)\n{\n VLOG(3) << \"push_event() server: \" << server << \" from: \" << from;\n\n mailer_extra extra = {server, from, to};\n curl_pool_.push_event(event, extra);\n\n}\n\nvoid mailer_pool::curl_event(const queued_event_t queued_event,\n const std::shared_ptr<CURL> easy,\n std::function<void()> & clean_fn)\n{\n\n const auto extra = boost::any_cast<mailer_extra>(queued_event.extra);\n const auto & e = queued_event.event;\n\n\tstd::shared_ptr<std::string> server(new std::string(extra.server));\n\tstd::shared_ptr<std::string> from(new std::string(extra.from));\n\n struct curl_slist *recipients = NULL;\n for (const auto & to : extra.to) {\n recipients = curl_slist_append(recipients, to.c_str());\n }\n\n auto payload = std::make_shared<payload_t>(\n payload_t({payload_text(extra, e), 0}));\n\n curl_easy_setopt(easy.get(), CURLOPT_URL, k_smtp_url.c_str());\n curl_easy_setopt(easy.get(), CURLOPT_MAIL_FROM, from->c_str());\n curl_easy_setopt(easy.get(), CURLOPT_MAIL_RCPT, recipients);\n curl_easy_setopt(easy.get(), CURLOPT_UPLOAD, 1L);\n curl_easy_setopt(easy.get(), CURLOPT_READFUNCTION, payload_source);\n curl_easy_setopt(easy.get(), CURLOPT_READDATA, payload.get());\n\n clean_fn = [=]()\n {\n UNUSED_VAR(server);\n UNUSED_VAR(from);\n UNUSED_VAR(payload);\n if (recipients) {\n curl_slist_free_all(recipients);\n }\n };\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _LAYOUT_POST_HXX\n#define _LAYOUT_POST_HXX\n\n#if ENABLE_LAYOUT\n\n\/* Allow re-inclusion for cxx file. *\/\n#undef _LAYOUT_PRE_HXX\n\n\n#undef AdvancedButton\n#undef ApplyButton\n#undef Box\n#undef Button\n#undef CancelButton\n#undef CheckBox\n#undef ComboBox\n#undef Container\n#undef Control\n#undef Dialog\n#undef Edit\n#undef ErrorBox\n#undef FixedImage\n#undef FixedInfo\n#undef FixedLine\n#undef FixedText\n#undef HBox\n#undef HelpButton\n#undef IgnoreButton\n#undef ImageButton\n#undef InfoBox\n#undef ListBox\n#undef MessBox\n#undef MessageBox\n#undef MetricField\n#undef MetricFormatter\n#undef MoreButton\n#undef MultiLineEdit\n#undef MultiListBox\n#undef NoButton\n#undef NumericField\n#undef NumericFormatter\n#undef OKButton\n#undef Plugin\n#undef ProgressBar\n#undef PushButton\n#undef QueryBox\n#undef RadioButton\n#undef ResetButton\n#undef RetryButton\n#undef SfxTabPage\n#undef SfxTabDialog\n#undef SpinField\n#undef TabDialog\n#undef TabControl\n#undef TabPage\n#undef Table\n#undef VBox\n#undef WarningBox\n#undef YesButton\n\n#undef SvxFontListBox\n#undef SvxLanguageBox\n\n#undef ModalDialog\n#undef ModelessDialog\n#undef ScExpandedFixedText\n#undef SfxDialog\n#undef SfxModalDialog\n#undef SfxModelessDialog\n\n#undef Window\n\n#endif \/* ENABLE_LAYOUT *\/\n\n#endif \/* _LAYOUT_POST_HXX *\/\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>add matching undefs<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _LAYOUT_POST_HXX\n#define _LAYOUT_POST_HXX\n\n#if ENABLE_LAYOUT\n\n\/* Allow re-inclusion for cxx file. *\/\n#undef _LAYOUT_PRE_HXX\n\n\n#undef AdvancedButton\n#undef ApplyButton\n#undef Box\n#undef Button\n#undef CancelButton\n#undef CheckBox\n#undef ComboBox\n#undef Container\n#undef Control\n#undef Dialog\n#undef Edit\n#undef ErrorBox\n#undef FixedImage\n#undef FixedInfo\n#undef FixedLine\n#undef FixedText\n#undef HBox\n#undef HelpButton\n#undef IgnoreButton\n#undef ImageButton\n#undef InfoBox\n#undef ListBox\n#undef MessBox\n#undef MessageBox\n#undef MetricField\n#undef MetricFormatter\n#undef MoreButton\n#undef MultiLineEdit\n#undef MultiListBox\n#undef NoButton\n#undef NumericField\n#undef NumericFormatter\n#undef OKButton\n#undef Plugin\n#undef ProgressBar\n#undef PushButton\n#undef QueryBox\n#undef RadioButton\n#undef ResetButton\n#undef RetryButton\n#undef SfxTabPage\n#undef SfxTabDialog\n#undef SfxTabPage\n#undef SvxFontListBox\n#undef SvxLanguageBox\n#undef SpinField\n#undef TabDialog\n#undef TabControl\n#undef TabPage\n#undef Table\n#undef VBox\n#undef WarningBox\n#undef YesButton\n\n#undef SvxFontListBox\n#undef SvxLanguageBox\n\n#undef ModalDialog\n#undef ModelessDialog\n#undef ScExpandedFixedText\n#undef SfxDialog\n#undef SfxModalDialog\n#undef SfxModelessDialog\n\n#undef Window\n\n#endif \/* ENABLE_LAYOUT *\/\n\n#endif \/* _LAYOUT_POST_HXX *\/\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include<stdio.h>\n#include<stdlib.h>\n#include<limits.h>\/\/in gcc\n#include<errno.h>\/\/in gcc\n#ifndef __cplusplus\n#define nullptr NULL\n#endif\n\nint get_integer_num(const int max, const int min){\n\t\/\/@\\FW͂𐔎ɕϊB\n\t\/\/F߂l̍ől,߂l̍ŏl\n\t\/\/߂lF͂AG[-1,EOF̂ƂEOF\n\tchar s[100];\n\tchar *endptr;\n\tif (nullptr == fgets(s, 100, stdin)){\n\t\tif (feof(stdin)){\/\/G[̌EOF؂蕪\n\t\t\treturn EOF;\n\t\t}\n\t\treturn INT_MIN;\n\t}\n\tif ('\\n' == s[0]) return INT_MIN;\n\terrno = 0;\n\tconst long t = strtol(s, &endptr, 10);\n\tif (0 != errno || '\\n' != *endptr || t < min || max < t)\n\t\treturn INT_MIN;\n\treturn (int)t;\n}\n\nint getnum_customized_type_int(const int max, const int min){\n\tif (max < min) return -1;\n\tint flag0;\n\tbool temp_judge;\n\tdo{\n\t\tflag0 = get_integer_num(max, min);\n\t\ttemp_judge = (INT_MIN == flag0);\n\t\tif (temp_judge){\n\t\t\tsystem(\"cls\");\n\t\t\tputs(\"ē͂ĂB\");\n\t\t}\n\t} while (temp_judge);\n\treturn flag0;\n}\n\n\ndouble getnum(const double max, const double min, double* isError){\n\t\/\/@\\FW͂𐔎ɕϊB\n\t\/\/F߂l̍ől,߂l̍ŏl\n\t\/\/߂lF͂AG[-1,EOF̂ƂEOF\n\tchar s[100];\n\tchar *endptr;\n\tif (nullptr == fgets(s, 100, stdin)){\n\t\tif (nullptr != isError) *isError = -1;\n\t\treturn 0;\n\t}\n\tif ('\\n' == s[0]){\n\t\tif (nullptr != isError) *isError = -1;\n\t\treturn 0;\n\t}\n\terrno = 0;\n\tconst double t = strtod(s, &endptr);\n\tif (0 != errno || '\\n' != *endptr || t < min || max < t)\n\t\tif (nullptr != isError) *isError = -1;\n\treturn t;\n}\n\ndouble getnum_customized_type_double(const double max, const double min){\n\tif (max < min) return -1;\n\tdouble flag0 = 0;\n\tdouble return_num;\n\tbool temp_judge;\n\tdo{\n\t\treturn_num = getnum(max, min, &flag0);\n\t\ttemp_judge = (-1 == flag0);\n\t\tif (temp_judge){\n\t\t\t\/\/system(\"cls\");\n\t\t\tputs(\"ē͂ĂB\");\n\t\t}\n\t} while (temp_judge);\n\treturn return_num;\n}\n\nvoid common_message(void){\n\tprintf(\"Cϊc[\\n\\n\");\n}\n\nvoid hPa_to_mmHg(void){\n\tprintf(\"C(hPa)͂ĂB\\n\");\n\tdouble Pa = getnum_customized_type_double(5000, 0);\n\tsystem(\"cls\");\n\tdouble calc_mmHg = Pa * 760 \/ 1013;\n\tcommon_message();\n\tprintf(\"%fhPa%fmmHgłB\\n\", Pa, calc_mmHg);\n}\n\nvoid mmHg_to_hPa(void){\n\tprintf(\"C(mmHg)͂ĂB\\n\");\n\tdouble mmHg = getnum_customized_type_double(5000, 0);\n\tsystem(\"cls\");\n\tdouble calc_Pa = mmHg * 1013 \/ 760;\n\tcommon_message();\n\tprintf(\"%fmmHg%fPałB\\n\", mmHg, calc_Pa);\n}\n\nvoid clear_screen(void){\n\tsystem(\"pause\");\n\tsystem(\"cls\");\n}\n\nvoid roop(void){\n\tint flag = 0;\n\tint flag2;\n\tint end = 0;\n\tdo{\n\t\tcommon_message();\n\t\tswitch (flag){\n\t\tcase 0:{\n\t\t\tflag2 = 0;\n\t\t\tprintf(\"PammHgɕϊꍇ͂PAmmHgPaɕϊꍇ͂Q͂EnterL[ĂB\\n\"\n\t\t\t\t\"Iꍇ͂R͂ĂB\\n\");\n\t\t\tflag = getnum_customized_type_int(3, 1);\n\t\t\tsystem(\"cls\");\n\t\t\tbreak;\n\t\t}\n\t\tcase 1:{\n\t\t\thPa_to_mmHg();\n\t\t\tflag = 4;\n\t\t\tclear_screen();\n\t\t\tbreak;\n\t\t}\n\t\tcase 2:{\n\t\t\tmmHg_to_hPa();\n\t\t\tflag = 4;\n\t\t\tclear_screen();\n\t\t\tbreak;\n\t\t}\n\t\tcase 3:{\n\t\t\tend = 1;\n\t\t\tbreak;\n\t\t}\n\t\tcase 4:{\n\t\t\tprintf(\"vZ𑱂܂H\\n͂cP@cQ\\n\");\n\t\t\tflag2 = getnum_customized_type_int(2, 1);\n\t\t\tif (flag2 == 1) flag = 0;\n\t\t\tif (flag2 == 2) flag = 3;\n\t\t\tsystem(\"cls\");\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t} while (end == 0);\n}\n\nint main(void){\n\troop();\n\treturn 0;\n}<commit_msg>C++っぽく書き換え。 760mmHg->atm みたいに書けるように<commit_after>#include<iostream>\n#include<string>\n#include<array>\n#include<typeinfo>\n#include<cstdio>\n#include<cstdlib>\n#include<limits.h>\/\/in gcc\n#include<errno.h>\/\/in gcc\ntypedef enum pressure_unit{\n\tUNKNOWN = 0,\n\tMMHG,\n\tHPA,\n\tATM,\n\tBAR\n} pressure_unit_t;\ntypedef struct{\n\tdouble pressure;\n\tpressure_unit_t in_unit;\n\tpressure_unit_t out_unit;\n}input_pressure_data_t;\ntemplate <typename T, typename ...Args>\ninline std::array<T, sizeof...(Args)> make_array(Args &&...args) {\n\treturn std::array<T, sizeof...(Args)>{ std::forward<Args>(args)... };\n}\nnamespace pressure_units{\n\tstatic const auto units = make_array<std::string>(\"mmHg\", \"hPa\", \"atm\", \"bar\");\n\tclass basic_pressure_t\n\t{\n\tpublic:\n\t\tbasic_pressure_t(double hPa){\n\t\t\tthis->hPa = hPa;\n\t\t}\n\t\tbasic_pressure_t(double in_pressure, const pressure_unit_t unit){\n\t\t\thPa = 0;\n\t\t\tswitch (unit)\n\t\t\t{\n\t\t\tcase MMHG:\n\t\t\t\thPa = in_pressure * 1013.25 \/ 760;\n\t\t\t\tbreak;\n\t\t\tcase HPA:\n\t\t\t\thPa = in_pressure;\n\t\t\t\tbreak;\n\t\t\tcase ATM:\n\t\t\t\thPa = in_pressure * 1013.25;\n\t\t\t\tbreak;\n\t\t\tcase BAR:\n\t\t\t\thPa = in_pressure * 1000;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow \"unknown units\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmmHg = (MMHG != unit) ? hPa * 760 \/ 1013.25 : in_pressure;\n\t\t\tatm = (ATM != unit) ? hPa \/ 1013.25 : in_pressure;\n\t\t\tbar = (BAR != unit) ? hPa \/ 1000 : in_pressure;\n\t\t}\n\t\tstd::string to_string(const pressure_unit_t unit) const{\n\t\t\tstd::string re = \"\";\n\t\t\tswitch (unit)\n\t\t\t{\n\t\t\tcase MMHG:\n\t\t\t\tre += std::to_string(mmHg);\n\t\t\t\tbreak;\n\t\t\tcase HPA:\n\t\t\t\tre += std::to_string(hPa);\n\t\t\t\tbreak;\n\t\t\tcase ATM:\n\t\t\t\tre += std::to_string(atm);\n\t\t\t\tbreak;\n\t\t\tcase BAR:\n\t\t\t\tre += std::to_string(bar);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow \"unknown units\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tre += (UNKNOWN == unit) ? \"\" : units.at(unit - 1);\n\t\t\treturn re;\n\t\t}\n\tprivate:\n\t\tdouble hPa, mmHg, atm, bar;\n\t};\n}\npressure_unit_t to_pressure_unit(const std::string& in_str, size_t* _Idx = nullptr){\n\tusing namespace pressure_units;\n\tif (0 == in_str.length()) return UNKNOWN;\n\t\/\/static const auto units = make_array<std::string>(\"mmHg\", \"hPa\", \"atm\", \"bar\");\n\tstd::string::size_type place = 0, i = 0;\n\tfor (auto& u : units){\n\t\tplace = in_str.find(u);\n\t\tif (0 == place) break;\n\t\t++i;\n\t}\n\tif (0 != place) return UNKNOWN;\n\tif (nullptr != _Idx) *_Idx = units.at(i).length();\/\/in_str中のkey(units[i])のすぐ後の要素番号を引数経由で返す\n\treturn static_cast<pressure_unit_t>(i + 1);\n}\ntemplate <typename T_>\npressure_unit_t ask_unit(T_ pressure){\n\tusing namespace std;\n\tstring in_unit_str;\n\tin_unit_str.reserve(10);\n\tpressure_unit_t re;\n\tdo{\n\t\tcout << pressure << \"の単位を入力してください\" << endl;\n\t\tcout << \"mmHg, hPa, atm, bar\" << endl;\n\t\tgetline(cin, in_unit_str);\n\t\tre = to_pressure_unit(in_unit_str);\n\t} while (UNKNOWN == re);\n\treturn re;\n}\nvoid split_into_pressure_data(input_pressure_data_t& data, const std::string& in_str){\n\tstd::string::size_type in_unit_str_at = 0, out_unit_str_at = 0;\n\tdata.pressure = stod(in_str, &in_unit_str_at);\/\/doubleに変換\n\tconst pressure_unit_t in_unit_temp = to_pressure_unit(in_str.substr(in_unit_str_at), &out_unit_str_at);\n\tdata.in_unit = (UNKNOWN == in_unit_temp) ? ask_unit(data.pressure) : in_unit_temp;\n\t\/\/in_unitでask_unitを呼び出しているならout_unitでも呼ぶ必要がある\n\tconst pressure_unit_t out_unit_temp = (UNKNOWN == in_unit_temp) ? ask_unit(\"変換後\") : to_pressure_unit(in_str.substr(in_unit_str_at + out_unit_str_at + 2));\n\tdata.out_unit = (UNKNOWN == out_unit_temp) ? ask_unit(\"変換後\") : out_unit_temp;\n}\nvoid common_message(void){\n\tprintf(\"気圧変換ツール\\n\\n\");\n}\nvoid input(input_pressure_data_t& data){\n\tusing namespace std;\n\tcommon_message();\n\tcout << \"気圧を入力してください\" << endl;\n\tstring in_str;\n\tin_str.reserve(15);\n\tgetline(cin, in_str);\n\tsplit_into_pressure_data(data, in_str);\n}\nstd::string convert(const input_pressure_data_t& data){\n\tusing namespace pressure_units;\n\tbasic_pressure_t in(data.pressure, data.in_unit);\n\treturn in.to_string(data.out_unit);\n}\nint main(void){\n\tinput_pressure_data_t data;\n\tinput(data);\n\tstd::cout << convert(data) << std::endl;\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <exception>\n#include <regex>\n#include <sstream>\n#include <stdexcept>\n#include <type_traits>\n#include <variant>\n\n#include \"int_parser.h\"\n\nnamespace {\n\ntemplate <typename T>\nT _parse_int(const std::string &num __attribute__((unused)),\n size_t *idx __attribute__((unused)),\n int base __attribute__((unused)))\n{\n static_assert(not std::is_same_v<T, T>,\n \"BUG: _parse_int not implemented for type\");\n}\n\ntemplate <>\nint64_t _parse_int(const std::string &num, size_t *idx, int base)\n{\n return std::stoll(num, idx, base);\n}\n\ntemplate <>\nuint64_t _parse_int(const std::string &num, size_t *idx, int base)\n{\n return std::stoull(num, idx, base);\n}\n\ntemplate <typename T>\nstd::variant<T, std::string> _parse_int(const std::string &num, int base)\n{\n \/\/ https:\/\/en.cppreference.com\/w\/cpp\/language\/integer_literal#The_type_of_the_literal\n static auto int_size_re = std::regex(\"^(u|u?l?l)$\", std::regex::icase);\n try\n {\n std::size_t idx;\n T ret = _parse_int<T>(num, &idx, base);\n\n if (idx != num.size())\n {\n auto trail = num.substr(idx, std::string::npos);\n auto match = std::regex_match(trail, int_size_re);\n\n if (!match)\n return \"Found trailing non-numeric characters\";\n }\n\n return ret;\n }\n catch (const std::exception &ex)\n {\n return ex.what();\n }\n}\n\n\/\/ integer variant of 10^exp\nuint64_t _ten_pow(uint64_t exp)\n{\n static const uint64_t v[] = { 1, 10, 100, 1000, 10000, 100000, 1000000 };\n if (exp > 6)\n return v[6] * _ten_pow(exp - 6);\n return v[exp];\n}\n\n\/\/ integer variant of scientific notation parsing\ntemplate <typename T>\nstd::variant<T, std::string> _parse_exp(const std::string &coeff,\n const std::string &exp)\n{\n std::stringstream errmsg;\n auto maybe_coeff = _parse_int<T>(coeff, 10);\n if (auto err = std::get_if<std::string>(&maybe_coeff))\n {\n errmsg << \"Coefficient part of scientific literal is not a valid number: \"\n << coeff << \": \" << err;\n return errmsg.str();\n }\n\n auto maybe_exp = _parse_int<T>(exp, 10);\n if (auto err = std::get_if<std::string>(&maybe_exp))\n {\n errmsg << \"Exponent part of scientific literal is not a valid number: \"\n << exp << \": \" << err;\n return errmsg.str();\n }\n\n auto c = std::get<T>(maybe_coeff);\n auto e = std::get<T>(maybe_exp);\n\n if (c > 9)\n {\n errmsg << \"Coefficient part of scientific literal must be in range (0,9), \"\n \"got: \"\n << coeff;\n return errmsg.str();\n }\n\n if (e > 16)\n {\n errmsg << \"Exponent will overflow integer range: \" << exp;\n return errmsg.str();\n }\n\n return c * (T)_ten_pow(e);\n}\n\n} \/\/ namespace\n\nnamespace bpftrace {\nnamespace ast {\nnamespace int_parser {\n\ntemplate <typename T>\nT to_int(const std::string &num, int base)\n{\n std::string n(num);\n n.erase(std::remove(n.begin(), n.end(), '_'), n.end());\n\n std::variant<T, std::string> res;\n\n auto pos = n.find_first_of(\"eE\");\n if (pos != std::string::npos)\n {\n res = _parse_exp<T>(n.substr(0, pos), n.substr(pos + 1, std::string::npos));\n }\n else\n {\n res = _parse_int<T>(n, base);\n }\n\n if (auto err = std::get_if<std::string>(&res))\n throw std::invalid_argument(*err);\n return std::get<T>(res);\n}\n\nint64_t to_int(const std::string &num, int base)\n{\n return to_int<int64_t>(num, base);\n}\n\nuint64_t to_uint(const std::string &num, int base)\n{\n return to_int<uint64_t>(num, base);\n}\n\n} \/\/ namespace int_parser\n} \/\/ namespace ast\n} \/\/ namespace bpftrace\n<commit_msg>int_parser: print the actual error<commit_after>#include <algorithm>\n#include <exception>\n#include <regex>\n#include <sstream>\n#include <stdexcept>\n#include <type_traits>\n#include <variant>\n\n#include \"int_parser.h\"\n\nnamespace {\n\ntemplate <typename T>\nT _parse_int(const std::string &num __attribute__((unused)),\n size_t *idx __attribute__((unused)),\n int base __attribute__((unused)))\n{\n static_assert(not std::is_same_v<T, T>,\n \"BUG: _parse_int not implemented for type\");\n}\n\ntemplate <>\nint64_t _parse_int(const std::string &num, size_t *idx, int base)\n{\n return std::stoll(num, idx, base);\n}\n\ntemplate <>\nuint64_t _parse_int(const std::string &num, size_t *idx, int base)\n{\n return std::stoull(num, idx, base);\n}\n\ntemplate <typename T>\nstd::variant<T, std::string> _parse_int(const std::string &num, int base)\n{\n \/\/ https:\/\/en.cppreference.com\/w\/cpp\/language\/integer_literal#The_type_of_the_literal\n static auto int_size_re = std::regex(\"^(u|u?l?l)$\", std::regex::icase);\n try\n {\n std::size_t idx;\n T ret = _parse_int<T>(num, &idx, base);\n\n if (idx != num.size())\n {\n auto trail = num.substr(idx, std::string::npos);\n auto match = std::regex_match(trail, int_size_re);\n\n if (!match)\n return \"Found trailing non-numeric characters\";\n }\n\n return ret;\n }\n catch (const std::exception &ex)\n {\n return ex.what();\n }\n}\n\n\/\/ integer variant of 10^exp\nuint64_t _ten_pow(uint64_t exp)\n{\n static const uint64_t v[] = { 1, 10, 100, 1000, 10000, 100000, 1000000 };\n if (exp > 6)\n return v[6] * _ten_pow(exp - 6);\n return v[exp];\n}\n\n\/\/ integer variant of scientific notation parsing\ntemplate <typename T>\nstd::variant<T, std::string> _parse_exp(const std::string &coeff,\n const std::string &exp)\n{\n std::stringstream errmsg;\n auto maybe_coeff = _parse_int<T>(coeff, 10);\n if (std::string *err = std::get_if<std::string>(&maybe_coeff))\n {\n errmsg << \"Coefficient part of scientific literal is not a valid number: \"\n << coeff << \": \" << *err;\n return errmsg.str();\n }\n\n auto maybe_exp = _parse_int<T>(exp, 10);\n if (std::string *err = std::get_if<std::string>(&maybe_exp))\n {\n errmsg << \"Exponent part of scientific literal is not a valid number: \"\n << exp << \": \" << *err;\n return errmsg.str();\n }\n\n auto c = std::get<T>(maybe_coeff);\n auto e = std::get<T>(maybe_exp);\n\n if (c > 9)\n {\n errmsg << \"Coefficient part of scientific literal must be in range (0,9), \"\n \"got: \"\n << coeff;\n return errmsg.str();\n }\n\n if (e > 16)\n {\n errmsg << \"Exponent will overflow integer range: \" << exp;\n return errmsg.str();\n }\n\n return c * (T)_ten_pow(e);\n}\n\n} \/\/ namespace\n\nnamespace bpftrace {\nnamespace ast {\nnamespace int_parser {\n\ntemplate <typename T>\nT to_int(const std::string &num, int base)\n{\n std::string n(num);\n n.erase(std::remove(n.begin(), n.end(), '_'), n.end());\n\n std::variant<T, std::string> res;\n\n auto pos = n.find_first_of(\"eE\");\n if (pos != std::string::npos)\n {\n res = _parse_exp<T>(n.substr(0, pos), n.substr(pos + 1, std::string::npos));\n }\n else\n {\n res = _parse_int<T>(n, base);\n }\n\n if (std::string *err = std::get_if<std::string>(&res))\n throw std::invalid_argument(*err);\n return std::get<T>(res);\n}\n\nint64_t to_int(const std::string &num, int base)\n{\n return to_int<int64_t>(num, base);\n}\n\nuint64_t to_uint(const std::string &num, int base)\n{\n return to_int<uint64_t>(num, base);\n}\n\n} \/\/ namespace int_parser\n} \/\/ namespace ast\n} \/\/ namespace bpftrace\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n\n#include <cstddef>\n#include <memory>\n#include <uv.h>\n#include \"util.hpp\"\n\n\nnamespace uvw {\n\n\nstruct BaseEvent {\n virtual ~BaseEvent() noexcept = 0;\n\n static std::size_t next() noexcept {\n static std::size_t cnt = 0;\n return cnt++;\n }\n};\n\nBaseEvent::~BaseEvent() noexcept { }\n\ntemplate<typename E>\nstruct Event: BaseEvent {\n static std::size_t type() noexcept {\n static std::size_t val = BaseEvent::next();\n return val;\n }\n};\n\n\nstruct AsyncEvent: Event<AsyncEvent> { };\nstruct CheckEvent: Event<CheckEvent> { };\nstruct CloseEvent: Event<CloseEvent> { };\nstruct ConnectEvent: Event<ConnectEvent> { };\n\n\nstruct DataEvent: Event<DataEvent> {\n explicit DataEvent(std::unique_ptr<const char[]> ptr, ssize_t l) noexcept\n : dt{std::move(ptr)}, len{l}\n { }\n\n const char * data() const noexcept { return dt.get(); }\n ssize_t length() const noexcept { return len; }\n\nprivate:\n std::unique_ptr<const char[]> dt;\n const ssize_t len;\n};\n\n\nstruct EndEvent: Event<EndEvent> { };\n\n\nstruct ErrorEvent: Event<ErrorEvent> {\n explicit ErrorEvent(int code = 0) noexcept: ec(code) { }\n\n const char * what() const noexcept { return uv_strerror(ec); }\n int code() const noexcept { return ec; }\n\nprivate:\n const int ec;\n};\n\n\ntemplate<typename E>\nstruct FlagsEvent: Event<FlagsEvent<E>> {\n explicit FlagsEvent(Flags<E> f) noexcept: flgs{std::move(f)} { }\n\n Flags<E> flags() const noexcept { return flgs; }\n\nprivate:\n Flags<E> flgs;\n};\n\n\nstruct FsPollEvent: Event<FsPollEvent> {\n explicit FsPollEvent(const Stat &p, const Stat &c) noexcept\n : prev(p), curr(c)\n { }\n\n const Stat & previous() const noexcept { return prev; }\n const Stat & current() const noexcept { return curr; }\n\nprivate:\n Stat prev;\n Stat curr;\n};\n\n\nstruct IdleEvent: Event<IdleEvent> { };\nstruct ListenEvent: Event<ListenEvent> { };\nstruct PrepareEvent: Event<PrepareEvent> { };\nstruct SendEvent: Event<SendEvent> { };\nstruct ShutdownEvent: Event<ShutdownEvent> { };\n\n\nstruct SignalEvent: Event<SignalEvent> {\n explicit SignalEvent(int sig) noexcept: signum(sig) { }\n\n int signal() const noexcept { return signum; }\n\nprivate:\n const int signum;\n};\n\n\nstruct TimerEvent: Event<TimerEvent> { };\n\n\nstruct UDPDataEvent: Event<UDPDataEvent> {\n explicit UDPDataEvent(Addr addr, std::unique_ptr<const char[]> ptr, ssize_t l, bool trunc) noexcept\n : dt{std::move(ptr)}, len{l}, sndr{addr}, part{trunc}\n { }\n\n const char * data() const noexcept { return dt.get(); }\n ssize_t length() const noexcept { return len; }\n Addr sender() const noexcept { return sndr; }\n bool partial() const noexcept { return part; }\n\nprivate:\n std::unique_ptr<const char[]> dt;\n const ssize_t len;\n Addr sndr;\n const bool part;\n};\n\n\nstruct UninitializedEvent: Event<UninitializedEvent> { };\nstruct WorkEvent: Event<WorkEvent> { };\nstruct WriteEvent: Event<WriteEvent> { };\n\n\n}\n<commit_msg>review: events<commit_after>#pragma once\n\n\n#include <cstddef>\n#include <memory>\n#include <uv.h>\n#include \"util.hpp\"\n\n\nnamespace uvw {\n\n\/\/ base structures\n\n\nstruct BaseEvent {\n virtual ~BaseEvent() noexcept = 0;\n\n static std::size_t next() noexcept {\n static std::size_t cnt = 0;\n return cnt++;\n }\n};\n\nBaseEvent::~BaseEvent() noexcept { }\n\ntemplate<typename E>\nstruct Event: BaseEvent {\n static std::size_t type() noexcept {\n static std::size_t val = BaseEvent::next();\n return val;\n }\n};\n\n\n\/\/ empty events\n\n\nstruct DefaultEvent: Event<DefaultEvent> { };\n\nusing AsyncEvent = DefaultEvent;\nusing CheckEvent = DefaultEvent;\nusing CloseEvent = DefaultEvent;\nusing ConnectEvent = DefaultEvent;\nusing EndEvent = DefaultEvent;\nusing IdleEvent = DefaultEvent;\nusing ListenEvent = DefaultEvent;\nusing PrepareEvent = DefaultEvent;\nusing SendEvent = DefaultEvent;\nusing ShutdownEvent = DefaultEvent;\nusing TimerEvent = DefaultEvent;\nusing UninitializedEvent = DefaultEvent;\nusing WorkEvent = DefaultEvent;\nusing WriteEvent = DefaultEvent;\n\n\n\/\/ specialized events\n\n\nstruct DataEvent: Event<DataEvent> {\n explicit DataEvent(std::unique_ptr<const char[]> ptr, ssize_t l) noexcept\n : dt{std::move(ptr)}, len{l}\n { }\n\n const char * data() const noexcept { return dt.get(); }\n ssize_t length() const noexcept { return len; }\n\nprivate:\n std::unique_ptr<const char[]> dt;\n const ssize_t len;\n};\n\n\nstruct ErrorEvent: Event<ErrorEvent> {\n explicit ErrorEvent(int code = 0) noexcept: ec(code) { }\n\n const char * what() const noexcept { return uv_strerror(ec); }\n int code() const noexcept { return ec; }\n\nprivate:\n const int ec;\n};\n\n\ntemplate<typename E>\nstruct FlagsEvent: Event<FlagsEvent<E>> {\n explicit FlagsEvent(Flags<E> f) noexcept: flgs{std::move(f)} { }\n\n Flags<E> flags() const noexcept { return flgs; }\n\nprivate:\n Flags<E> flgs;\n};\n\n\nstruct FsPollEvent: Event<FsPollEvent> {\n explicit FsPollEvent(const Stat &p, const Stat &c) noexcept\n : prev(p), curr(c)\n { }\n\n const Stat & previous() const noexcept { return prev; }\n const Stat & current() const noexcept { return curr; }\n\nprivate:\n Stat prev;\n Stat curr;\n};\n\n\nstruct SignalEvent: Event<SignalEvent> {\n explicit SignalEvent(int sig) noexcept: signum(sig) { }\n\n int signal() const noexcept { return signum; }\n\nprivate:\n const int signum;\n};\n\n\nstruct UDPDataEvent: Event<UDPDataEvent> {\n explicit UDPDataEvent(Addr addr, std::unique_ptr<const char[]> ptr, ssize_t l, bool trunc) noexcept\n : dt{std::move(ptr)}, len{l}, sndr{addr}, part{trunc}\n { }\n\n const char * data() const noexcept { return dt.get(); }\n ssize_t length() const noexcept { return len; }\n Addr sender() const noexcept { return sndr; }\n bool partial() const noexcept { return part; }\n\nprivate:\n std::unique_ptr<const char[]> dt;\n const ssize_t len;\n Addr sndr;\n const bool part;\n};\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * ws: a node.js websocket client\n * Copyright(c) 2011 Einar Otto Stangvik <einaros@gmail.com>\n * MIT Licensed\n *\/\n\n#include <v8.h>\n#include <node.h>\n#include <node_buffer.h>\n#include <node_object_wrap.h>\n#include <stdlib.h>\n#include <strings.h>\n#include <wchar.h>\n#include <stdio.h>\n\nusing namespace v8;\nusing namespace node;\n\n#define UNI_SUR_HIGH_START (uint32_t) 0xD800\n#define UNI_SUR_LOW_END (uint32_t) 0xDFFF\n#define UNI_REPLACEMENT_CHAR (uint32_t) 0x0000FFFD\n#define UNI_MAX_LEGAL_UTF32 (uint32_t) 0x0010FFFF\n\nstatic const uint8_t trailingBytesForUTF8[256] = {\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,\n 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5\n};\n\nstatic const uint32_t offsetsFromUTF8[6] = {\n 0x00000000, 0x00003080, 0x000E2080,\n 0x03C82080, 0xFA082080, 0x82082080\n};\n\nstatic int isLegalUTF8(const uint8_t *source, const int length)\n{\n uint8_t a;\n const uint8_t *srcptr = source+length;\n switch (length) {\n default: return 0;\n \/* Everything else falls through when \"true\"... *\/\n \/* RFC3629 makes 5 & 6 bytes UTF-8 illegal\n case 6: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0; \n case 5: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0; *\/\n case 4: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0;\n case 3: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0;\n case 2: if ((a = (*--srcptr)) > 0xBF) return 0;\n switch (*source) {\n \/* no fall-through in this inner switch *\/\n case 0xE0: if (a < 0xA0) return 0; break;\n case 0xED: if (a > 0x9F) return 0; break;\n case 0xF0: if (a < 0x90) return 0; break;\n case 0xF4: if (a > 0x8F) return 0; break;\n default: if (a < 0x80) return 0;\n }\n\n case 1: if (*source >= 0x80 && *source < 0xC2) return 0;\n }\n if (*source > 0xF4) return 0;\n return 1;\n}\n\nint is_valid_utf8 (size_t len, char *value)\n{\n \/* is the string valid UTF-8? *\/\n for (int i = 0; i < len; i++) {\n uint32_t ch = 0;\n uint8_t extrabytes = trailingBytesForUTF8[(uint8_t) value[i]];\n\n if (extrabytes + i >= len)\n return 0;\n\n if (isLegalUTF8 ((uint8_t *) (value + i), extrabytes + 1) == 0) return 0; \n\n switch (extrabytes) {\n case 5 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 4 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 3 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 2 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 1 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 0 : ch += (uint8_t) value[i];\n }\n\n ch -= offsetsFromUTF8[extrabytes];\n\n if (ch <= UNI_MAX_LEGAL_UTF32) {\n if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END)\n return 0;\n } else {\n return 0;\n }\n }\n\n return 1;\n}\n\nclass Validation : public ObjectWrap\n{\npublic:\n \n static void Initialize(v8::Handle<v8::Object> target)\n {\n HandleScope scope;\n Local<FunctionTemplate> t = FunctionTemplate::New(New);\n t->InstanceTemplate()->SetInternalFieldCount(1);\n NODE_SET_METHOD(t->GetFunction(), \"isValidUTF8\", Validation::IsValidUTF8);\n target->Set(String::NewSymbol(\"Validation\"), t->GetFunction());\n }\n \nprotected:\n \n static Handle<Value> New(const Arguments& args)\n {\n HandleScope scope;\n Validation* validation = new Validation();\n validation->Wrap(args.This());\n return args.This();\n }\n \n static Handle<Value> IsValidUTF8(const Arguments& args)\n {\n HandleScope scope;\n if (!Buffer::HasInstance(args[0])) {\n return ThrowException(Exception::Error(String::New(\"First argument needs to be a buffer\")));\n }\n Local<Object> buffer_obj = args[0]->ToObject();\n char *buffer_data = Buffer::Data(buffer_obj);\n size_t buffer_length = Buffer::Length(buffer_obj); \n return is_valid_utf8(buffer_length, buffer_data) == 1 ? scope.Close(True()) : scope.Close(False());\n } \n};\n\nextern \"C\" void init (Handle<Object> target)\n{\n HandleScope scope;\n Validation::Initialize(target);\n}\n<commit_msg>removed unnecessary strings.h<commit_after>\/*!\n * ws: a node.js websocket client\n * Copyright(c) 2011 Einar Otto Stangvik <einaros@gmail.com>\n * MIT Licensed\n *\/\n\n#include <v8.h>\n#include <node.h>\n#include <node_buffer.h>\n#include <node_object_wrap.h>\n#include <stdlib.h>\n#include <wchar.h>\n#include <stdio.h>\n\nusing namespace v8;\nusing namespace node;\n\n#define UNI_SUR_HIGH_START (uint32_t) 0xD800\n#define UNI_SUR_LOW_END (uint32_t) 0xDFFF\n#define UNI_REPLACEMENT_CHAR (uint32_t) 0x0000FFFD\n#define UNI_MAX_LEGAL_UTF32 (uint32_t) 0x0010FFFF\n\nstatic const uint8_t trailingBytesForUTF8[256] = {\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,\n 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,\n 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5\n};\n\nstatic const uint32_t offsetsFromUTF8[6] = {\n 0x00000000, 0x00003080, 0x000E2080,\n 0x03C82080, 0xFA082080, 0x82082080\n};\n\nstatic int isLegalUTF8(const uint8_t *source, const int length)\n{\n uint8_t a;\n const uint8_t *srcptr = source+length;\n switch (length) {\n default: return 0;\n \/* Everything else falls through when \"true\"... *\/\n \/* RFC3629 makes 5 & 6 bytes UTF-8 illegal\n case 6: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0;\n case 5: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0; *\/\n case 4: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0;\n case 3: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return 0;\n case 2: if ((a = (*--srcptr)) > 0xBF) return 0;\n switch (*source) {\n \/* no fall-through in this inner switch *\/\n case 0xE0: if (a < 0xA0) return 0; break;\n case 0xED: if (a > 0x9F) return 0; break;\n case 0xF0: if (a < 0x90) return 0; break;\n case 0xF4: if (a > 0x8F) return 0; break;\n default: if (a < 0x80) return 0;\n }\n\n case 1: if (*source >= 0x80 && *source < 0xC2) return 0;\n }\n if (*source > 0xF4) return 0;\n return 1;\n}\n\nint is_valid_utf8 (size_t len, char *value)\n{\n \/* is the string valid UTF-8? *\/\n for (int i = 0; i < len; i++) {\n uint32_t ch = 0;\n uint8_t extrabytes = trailingBytesForUTF8[(uint8_t) value[i]];\n\n if (extrabytes + i >= len)\n return 0;\n\n if (isLegalUTF8 ((uint8_t *) (value + i), extrabytes + 1) == 0) return 0;\n\n switch (extrabytes) {\n case 5 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 4 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 3 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 2 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 1 : ch += (uint8_t) value[i++]; ch <<= 6;\n case 0 : ch += (uint8_t) value[i];\n }\n\n ch -= offsetsFromUTF8[extrabytes];\n\n if (ch <= UNI_MAX_LEGAL_UTF32) {\n if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END)\n return 0;\n } else {\n return 0;\n }\n }\n\n return 1;\n}\n\nclass Validation : public ObjectWrap\n{\npublic:\n\n static void Initialize(v8::Handle<v8::Object> target)\n {\n HandleScope scope;\n Local<FunctionTemplate> t = FunctionTemplate::New(New);\n t->InstanceTemplate()->SetInternalFieldCount(1);\n NODE_SET_METHOD(t->GetFunction(), \"isValidUTF8\", Validation::IsValidUTF8);\n target->Set(String::NewSymbol(\"Validation\"), t->GetFunction());\n }\n\nprotected:\n\n static Handle<Value> New(const Arguments& args)\n {\n HandleScope scope;\n Validation* validation = new Validation();\n validation->Wrap(args.This());\n return args.This();\n }\n\n static Handle<Value> IsValidUTF8(const Arguments& args)\n {\n HandleScope scope;\n if (!Buffer::HasInstance(args[0])) {\n return ThrowException(Exception::Error(String::New(\"First argument needs to be a buffer\")));\n }\n Local<Object> buffer_obj = args[0]->ToObject();\n char *buffer_data = Buffer::Data(buffer_obj);\n size_t buffer_length = Buffer::Length(buffer_obj);\n return is_valid_utf8(buffer_length, buffer_data) == 1 ? scope.Close(True()) : scope.Close(False());\n }\n};\n\nextern \"C\" void init (Handle<Object> target)\n{\n HandleScope scope;\n Validation::Initialize(target);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * RtpExtensionProcessor.cpp\n *\/\n#include \"rtp\/RtpExtensionProcessor.h\"\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"lib\/Clock.h\"\n\nnamespace erizo {\nDEFINE_LOGGER(RtpExtensionProcessor, \"rtp.RtpExtensionProcessor\");\n\nRtpExtensionProcessor::RtpExtensionProcessor(const std::vector<erizo::ExtMap> ext_mappings) :\n ext_mappings_{ext_mappings}, video_orientation_{kVideoRotation_0} {\n translationMap_[\"urn:ietf:params:rtp-hdrext:ssrc-audio-level\"] = SSRC_AUDIO_LEVEL;\n translationMap_[\"http:\/\/www.webrtc.org\/experiments\/rtp-hdrext\/abs-send-time\"] = ABS_SEND_TIME;\n translationMap_[\"urn:ietf:params:rtp-hdrext:toffset\"] = TOFFSET;\n translationMap_[\"urn:3gpp:video-orientation\"] = VIDEO_ORIENTATION;\n translationMap_[\"http:\/\/www.ietf.org\/id\/draft-holmer-rmcat-transport-wide-cc-extensions-01\"] = TRANSPORT_CC;\n translationMap_[\"http:\/\/www.webrtc.org\/experiments\/rtp-hdrext\/playout-delay\"]= PLAYBACK_TIME;\n translationMap_[\"urn:ietf:params:rtp-hdrext:sdes:rtp-stream-id\"]= RTP_ID;\n ext_map_video_.fill(UNKNOWN);\n ext_map_audio_.fill(UNKNOWN);\n}\n\nRtpExtensionProcessor::~RtpExtensionProcessor() {\n}\n\nvoid RtpExtensionProcessor::setSdpInfo(std::shared_ptr<SdpInfo> theInfo) {\n \/\/ We build the Extension Map\n for (unsigned int i = 0; i < theInfo->extMapVector.size(); i++) {\n const ExtMap& theMap = theInfo->extMapVector[i];\n std::map<std::string, uint8_t>::iterator it;\n switch (theMap.mediaType) {\n case VIDEO_TYPE:\n if (isValidExtension(theMap.uri)) {\n ELOG_DEBUG(\"Adding RTP Extension for video %s, value %u\", theMap.uri.c_str(), theMap.value);\n ext_map_video_[theMap.value] = RTPExtensions((*translationMap_.find(theMap.uri)).second);\n } else {\n ELOG_WARN(\"Unsupported extension %s\", theMap.uri.c_str());\n }\n break;\n case AUDIO_TYPE:\n if (isValidExtension(theMap.uri)) {\n ELOG_DEBUG(\"Adding RTP Extension for Audio %s, value %u\", theMap.uri.c_str(), theMap.value);\n ext_map_audio_[theMap.value] = RTPExtensions((*translationMap_.find(theMap.uri)).second);\n } else {\n ELOG_WARN(\"Unsupported extension %s\", theMap.uri.c_str());\n }\n break;\n default:\n ELOG_WARN(\"Unknown type of extMap, ignoring\");\n break;\n }\n }\n}\n\nbool RtpExtensionProcessor::isValidExtension(std::string uri) {\n auto value = std::find_if(ext_mappings_.begin(), ext_mappings_.end(), [uri](const ExtMap &extension) {\n return uri == extension.uri;\n });\n return value != ext_mappings_.end() && translationMap_.find(uri) != translationMap_.end();\n}\n\nuint32_t RtpExtensionProcessor::processRtpExtensions(std::shared_ptr<DataPacket> p) {\n const RtpHeader* head = reinterpret_cast<const RtpHeader*>(p->data);\n uint32_t len = p->length;\n std::array<RTPExtensions, 15> extMap;\n if (head->getExtension()) {\n switch (p->type) {\n case VIDEO_PACKET:\n extMap = ext_map_video_;\n break;\n case AUDIO_PACKET:\n extMap = ext_map_audio_;\n break;\n default:\n ELOG_WARN(\"Won't process RTP extensions for unknown type packets\");\n return 0;\n break;\n }\n uint16_t totalExtLength = head->getExtLength();\n if (head->getExtId() == 0xBEDE) {\n char* extBuffer = (char*)&head->extensions; \/\/ NOLINT\n uint8_t extByte = 0;\n uint16_t currentPlace = 1;\n uint8_t extId = 0;\n uint8_t extLength = 0;\n while (currentPlace < (totalExtLength*4)) {\n extByte = (uint8_t)(*extBuffer);\n extId = extByte >> 4;\n extLength = extByte & 0x0F;\n if (extId != 0 && extMap[extId] != 0) {\n switch (extId) {\n case ABS_SEND_TIME:\n processAbsSendTime(extBuffer);\n break;\n case VIDEO_ORIENTATION:\n processVideoOrientation(extBuffer);\n break;\n default:\n break;\n }\n }\n extBuffer = extBuffer + extLength + 2;\n currentPlace = currentPlace + extLength + 2;\n }\n }\n }\n return len;\n}\n\nVideoRotation RtpExtensionProcessor::getVideoRotation() {\n return video_orientation_;\n}\n\nuint32_t RtpExtensionProcessor::processVideoOrientation(char* buf) {\n VideoOrientation* head = reinterpret_cast<VideoOrientation*>(buf);\n video_orientation_ = head->getVideoOrientation();\n return 0;\n}\n\nuint32_t RtpExtensionProcessor::processAbsSendTime(char* buf) {\n duration now = clock::now().time_since_epoch();\n AbsSendTimeExtension* head = reinterpret_cast<AbsSendTimeExtension*>(buf);\n auto now_sec = std::chrono::duration_cast<std::chrono::seconds>(now);\n auto now_usec = std::chrono::duration_cast<std::chrono::microseconds>(now);\n\n uint32_t now_usec_only = now_usec.count() - now_sec.count()*1e+6;\n\n uint8_t seconds = now_sec.count() & 0x3F;\n uint32_t absecs = now_usec_only * ((1LL << 18) - 1) * 1e-6;\n\n absecs = (seconds << 18) + absecs;\n head->setAbsSendTime(absecs);\n return 0;\n}\n\nuint32_t RtpExtensionProcessor::stripExtension(char* buf, int len) {\n \/\/ TODO(pedro)\n return len;\n}\n} \/\/ namespace erizo\n<commit_msg>Fix the way we detect abs send time to update it (#1486)<commit_after>\/*\n * RtpExtensionProcessor.cpp\n *\/\n#include \"rtp\/RtpExtensionProcessor.h\"\n#include <map>\n#include <string>\n#include <vector>\n\n#include \"lib\/Clock.h\"\n\nnamespace erizo {\nDEFINE_LOGGER(RtpExtensionProcessor, \"rtp.RtpExtensionProcessor\");\n\nRtpExtensionProcessor::RtpExtensionProcessor(const std::vector<erizo::ExtMap> ext_mappings) :\n ext_mappings_{ext_mappings}, video_orientation_{kVideoRotation_0} {\n translationMap_[\"urn:ietf:params:rtp-hdrext:ssrc-audio-level\"] = SSRC_AUDIO_LEVEL;\n translationMap_[\"http:\/\/www.webrtc.org\/experiments\/rtp-hdrext\/abs-send-time\"] = ABS_SEND_TIME;\n translationMap_[\"urn:ietf:params:rtp-hdrext:toffset\"] = TOFFSET;\n translationMap_[\"urn:3gpp:video-orientation\"] = VIDEO_ORIENTATION;\n translationMap_[\"http:\/\/www.ietf.org\/id\/draft-holmer-rmcat-transport-wide-cc-extensions-01\"] = TRANSPORT_CC;\n translationMap_[\"http:\/\/www.webrtc.org\/experiments\/rtp-hdrext\/playout-delay\"]= PLAYBACK_TIME;\n translationMap_[\"urn:ietf:params:rtp-hdrext:sdes:rtp-stream-id\"]= RTP_ID;\n ext_map_video_.fill(UNKNOWN);\n ext_map_audio_.fill(UNKNOWN);\n}\n\nRtpExtensionProcessor::~RtpExtensionProcessor() {\n}\n\nvoid RtpExtensionProcessor::setSdpInfo(std::shared_ptr<SdpInfo> theInfo) {\n \/\/ We build the Extension Map\n for (unsigned int i = 0; i < theInfo->extMapVector.size(); i++) {\n const ExtMap& theMap = theInfo->extMapVector[i];\n std::map<std::string, uint8_t>::iterator it;\n switch (theMap.mediaType) {\n case VIDEO_TYPE:\n if (isValidExtension(theMap.uri)) {\n ELOG_DEBUG(\"Adding RTP Extension for video %s, value %u\", theMap.uri.c_str(), theMap.value);\n ext_map_video_[theMap.value] = RTPExtensions((*translationMap_.find(theMap.uri)).second);\n } else {\n ELOG_WARN(\"Unsupported extension %s\", theMap.uri.c_str());\n }\n break;\n case AUDIO_TYPE:\n if (isValidExtension(theMap.uri)) {\n ELOG_DEBUG(\"Adding RTP Extension for Audio %s, value %u\", theMap.uri.c_str(), theMap.value);\n ext_map_audio_[theMap.value] = RTPExtensions((*translationMap_.find(theMap.uri)).second);\n } else {\n ELOG_WARN(\"Unsupported extension %s\", theMap.uri.c_str());\n }\n break;\n default:\n ELOG_WARN(\"Unknown type of extMap, ignoring\");\n break;\n }\n }\n}\n\nbool RtpExtensionProcessor::isValidExtension(std::string uri) {\n auto value = std::find_if(ext_mappings_.begin(), ext_mappings_.end(), [uri](const ExtMap &extension) {\n return uri == extension.uri;\n });\n return value != ext_mappings_.end() && translationMap_.find(uri) != translationMap_.end();\n}\n\nuint32_t RtpExtensionProcessor::processRtpExtensions(std::shared_ptr<DataPacket> p) {\n const RtpHeader* head = reinterpret_cast<const RtpHeader*>(p->data);\n uint32_t len = p->length;\n std::array<RTPExtensions, 15> extMap;\n if (head->getExtension()) {\n switch (p->type) {\n case VIDEO_PACKET:\n extMap = ext_map_video_;\n break;\n case AUDIO_PACKET:\n extMap = ext_map_audio_;\n break;\n default:\n ELOG_WARN(\"Won't process RTP extensions for unknown type packets\");\n return 0;\n break;\n }\n uint16_t totalExtLength = head->getExtLength();\n if (head->getExtId() == 0xBEDE) {\n char* extBuffer = (char*)&head->extensions; \/\/ NOLINT\n uint8_t extByte = 0;\n uint16_t currentPlace = 1;\n uint8_t extId = 0;\n uint8_t extLength = 0;\n while (currentPlace < (totalExtLength*4)) {\n extByte = (uint8_t)(*extBuffer);\n extId = extByte >> 4;\n extLength = extByte & 0x0F;\n if (extId != 0 && extMap[extId] != 0) {\n switch (extMap[extId]) {\n case ABS_SEND_TIME:\n processAbsSendTime(extBuffer);\n break;\n case VIDEO_ORIENTATION:\n processVideoOrientation(extBuffer);\n break;\n default:\n break;\n }\n }\n extBuffer = extBuffer + extLength + 2;\n currentPlace = currentPlace + extLength + 2;\n }\n }\n }\n return len;\n}\n\nVideoRotation RtpExtensionProcessor::getVideoRotation() {\n return video_orientation_;\n}\n\nuint32_t RtpExtensionProcessor::processVideoOrientation(char* buf) {\n VideoOrientation* head = reinterpret_cast<VideoOrientation*>(buf);\n video_orientation_ = head->getVideoOrientation();\n return 0;\n}\n\nuint32_t RtpExtensionProcessor::processAbsSendTime(char* buf) {\n duration now = clock::now().time_since_epoch();\n AbsSendTimeExtension* head = reinterpret_cast<AbsSendTimeExtension*>(buf);\n auto now_sec = std::chrono::duration_cast<std::chrono::seconds>(now);\n auto now_usec = std::chrono::duration_cast<std::chrono::microseconds>(now);\n\n uint32_t now_usec_only = now_usec.count() - now_sec.count()*1e+6;\n\n uint8_t seconds = now_sec.count() & 0x3F;\n uint32_t absecs = now_usec_only * ((1LL << 18) - 1) * 1e-6;\n\n absecs = (seconds << 18) + absecs;\n head->setAbsSendTime(absecs);\n return 0;\n}\n\nuint32_t RtpExtensionProcessor::stripExtension(char* buf, int len) {\n \/\/ TODO(pedro)\n return len;\n}\n} \/\/ namespace erizo\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: admininvokationimpl.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: hr $ $Date: 2003-03-25 16:00:46 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n#define EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\nclass Window;\n\/\/.........................................................................\nnamespace abp\n{\n\/\/.........................................................................\n\n \/\/=====================================================================\n \/\/= OAdminDialogInvokation\n \/\/=====================================================================\n \/** outsourced from AdminDialogInvokationPage, 'cause this class here, in opposite to\n the page, needs exception handlng to be enabled.\n *\/\n class OAdminDialogInvokation\n {\n private:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >\n m_xORB;\n ::rtl::OUString m_sPreferredName;\n Window* m_pMessageParent;\n\n public:\n OAdminDialogInvokation(\n const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n const ::rtl::OUString& _rPreferredName,\n Window* _pMessageParent\n );\n\n sal_Bool invokeAdministration( sal_Bool _bFixedType );\n };\n\n\/\/.........................................................................\n} \/\/ namespace abp\n\/\/.........................................................................\n\n#endif \/\/ EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n\n<commit_msg>INTEGRATION: CWS insight01 (1.2.182); FILE MERGED 2004\/04\/16 12:07:05 oj 1.2.182.1: correct alignment and default<commit_after>\/*************************************************************************\n *\n * $RCSfile: admininvokationimpl.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: hr $ $Date: 2004-08-02 17:35:53 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc..\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n#define EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n\nclass Window;\n\/\/.........................................................................\nnamespace abp\n{\n\/\/.........................................................................\n\n \/\/=====================================================================\n \/\/= OAdminDialogInvokation\n \/\/=====================================================================\n \/** outsourced from AdminDialogInvokationPage, 'cause this class here, in opposite to\n the page, needs exception handlng to be enabled.\n *\/\n class OAdminDialogInvokation\n {\n private:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >\n m_xORB;\n ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > m_xDataSource;\n Window* m_pMessageParent;\n\n public:\n OAdminDialogInvokation(\n const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxORB,\n const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySet > _xDataSource,\n Window* _pMessageParent\n );\n\n sal_Bool invokeAdministration( sal_Bool _bFixedType );\n };\n\n\/\/.........................................................................\n} \/\/ namespace abp\n\/\/.........................................................................\n\n#endif \/\/ EXTENSIONS_ABP_ADMININVOKATIONIMPL_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===- Pass.cpp - LLVM Pass Infrastructure Implementation -----------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the LLVM Pass infrastructure. It is primarily\n\/\/ responsible with ensuring that passes are executed and batched together\n\/\/ optimally.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Support\/TypeInfo.h\"\n#include <algorithm>\n#include <set>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pass Implementation\n\/\/\n\n\/\/ Force out-of-line virtual method.\nPass::~Pass() { \n delete Resolver; \n}\n\n\/\/ Force out-of-line virtual method.\nModulePass::~ModulePass() { }\n\nbool Pass::mustPreserveAnalysisID(const PassInfo *AnalysisID) const {\n return Resolver->getAnalysisToUpdate(AnalysisID, true) != 0;\n}\n\n\/\/ dumpPassStructure - Implement the -debug-passes=Structure option\nvoid Pass::dumpPassStructure(unsigned Offset) {\n cerr << std::string(Offset*2, ' ') << getPassName() << \"\\n\";\n}\n\n\/\/ getPassName - Use C++ RTTI to get a SOMEWHAT intelligible name for the pass.\n\/\/\nconst char *Pass::getPassName() const {\n if (const PassInfo *PI = getPassInfo())\n return PI->getPassName();\n return typeid(*this).name();\n}\n\n\/\/ print - Print out the internal state of the pass. This is called by Analyze\n\/\/ to print out the contents of an analysis. Otherwise it is not necessary to\n\/\/ implement this method.\n\/\/\nvoid Pass::print(std::ostream &O,const Module*) const {\n O << \"Pass::print not implemented for pass: '\" << getPassName() << \"'!\\n\";\n}\n\n\/\/ dump - call print(cerr);\nvoid Pass::dump() const {\n print(*cerr.stream(), 0);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ImmutablePass Implementation\n\/\/\n\/\/ Force out-of-line virtual method.\nImmutablePass::~ImmutablePass() { }\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ FunctionPass Implementation\n\/\/\n\n\/\/ run - On a module, we run this pass by initializing, runOnFunction'ing once\n\/\/ for every function in the module, then by finalizing.\n\/\/\nbool FunctionPass::runOnModule(Module &M) {\n bool Changed = doInitialization(M);\n\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n if (!I->isDeclaration()) \/\/ Passes are not run on external functions!\n Changed |= runOnFunction(*I);\n\n return Changed | doFinalization(M);\n}\n\n\/\/ run - On a function, we simply initialize, run the function, then finalize.\n\/\/\nbool FunctionPass::run(Function &F) {\n if (F.isDeclaration()) return false;\/\/ Passes are not run on external functions!\n\n bool Changed = doInitialization(*F.getParent());\n Changed |= runOnFunction(F);\n return Changed | doFinalization(*F.getParent());\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ BasicBlockPass Implementation\n\/\/\n\n\/\/ To run this pass on a function, we simply call runOnBasicBlock once for each\n\/\/ function.\n\/\/\nbool BasicBlockPass::runOnFunction(Function &F) {\n bool Changed = doInitialization(F);\n for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)\n Changed |= runOnBasicBlock(*I);\n return Changed | doFinalization(F);\n}\n\n\/\/ To run directly on the basic block, we initialize, runOnBasicBlock, then\n\/\/ finalize.\n\/\/\nbool BasicBlockPass::runPass(BasicBlock &BB) {\n Function &F = *BB.getParent();\n Module &M = *F.getParent();\n bool Changed = doInitialization(M);\n Changed |= doInitialization(F);\n Changed |= runOnBasicBlock(BB);\n Changed |= doFinalization(F);\n Changed |= doFinalization(M);\n return Changed;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pass Registration mechanism\n\/\/\nnamespace {\nclass PassRegistrar {\n \/\/\/ PassInfoMap - Keep track of the passinfo object for each registered llvm\n \/\/\/ pass.\n std::map<intptr_t, PassInfo*> PassInfoMap;\n \n \/\/\/ AnalysisGroupInfo - Keep track of information for each analysis group.\n struct AnalysisGroupInfo {\n const PassInfo *DefaultImpl;\n std::set<const PassInfo *> Implementations;\n AnalysisGroupInfo() : DefaultImpl(0) {}\n };\n \n \/\/\/ AnalysisGroupInfoMap - Information for each analysis group.\n std::map<const PassInfo *, AnalysisGroupInfo> AnalysisGroupInfoMap;\n\npublic:\n \n const PassInfo *GetPassInfo(intptr_t TI) const {\n std::map<intptr_t, PassInfo*>::const_iterator I = PassInfoMap.find(TI);\n return I != PassInfoMap.end() ? I->second : 0;\n }\n \n void RegisterPass(PassInfo &PI) {\n bool Inserted =\n PassInfoMap.insert(std::make_pair(PI.getTypeInfo(),&PI)).second;\n assert(Inserted && \"Pass registered multiple times!\");\n }\n \n void UnregisterPass(PassInfo &PI) {\n std::map<intptr_t, PassInfo*>::iterator I =\n PassInfoMap.find(PI.getTypeInfo());\n assert(I != PassInfoMap.end() && \"Pass registered but not in map!\");\n \n \/\/ Remove pass from the map.\n PassInfoMap.erase(I);\n }\n \n void EnumerateWith(PassRegistrationListener *L) {\n for (std::map<intptr_t, PassInfo*>::const_iterator I = PassInfoMap.begin(),\n E = PassInfoMap.end(); I != E; ++I)\n L->passEnumerate(I->second);\n }\n \n \n \/\/\/ Analysis Group Mechanisms.\n void RegisterAnalysisGroup(PassInfo *InterfaceInfo,\n const PassInfo *ImplementationInfo,\n bool isDefault) {\n AnalysisGroupInfo &AGI = AnalysisGroupInfoMap[InterfaceInfo];\n assert(AGI.Implementations.count(ImplementationInfo) == 0 &&\n \"Cannot add a pass to the same analysis group more than once!\");\n AGI.Implementations.insert(ImplementationInfo);\n if (isDefault) {\n assert(AGI.DefaultImpl == 0 && InterfaceInfo->getNormalCtor() == 0 &&\n \"Default implementation for analysis group already specified!\");\n assert(ImplementationInfo->getNormalCtor() &&\n \"Cannot specify pass as default if it does not have a default ctor\");\n AGI.DefaultImpl = ImplementationInfo;\n InterfaceInfo->setNormalCtor(ImplementationInfo->getNormalCtor());\n }\n }\n};\n}\n\nstatic std::vector<PassRegistrationListener*> *Listeners = 0;\n\n\/\/ FIXME: This should use ManagedStatic to manage the pass registrar.\n\/\/ Unfortunately, we can't do this, because passes are registered with static\n\/\/ ctors, and having llvm_shutdown clear this map prevents successful\n\/\/ ressurection after llvm_shutdown is run.\nstatic PassRegistrar *getPassRegistrar() {\n static PassRegistrar *PassRegistrarObj = 0;\n if (!PassRegistrarObj)\n PassRegistrarObj = new PassRegistrar();\n return PassRegistrarObj;\n}\n\n\/\/ getPassInfo - Return the PassInfo data structure that corresponds to this\n\/\/ pass...\nconst PassInfo *Pass::getPassInfo() const {\n return lookupPassInfo(PassID);\n}\n\nconst PassInfo *Pass::lookupPassInfo(intptr_t TI) {\n return getPassRegistrar()->GetPassInfo(TI);\n}\n\nvoid RegisterPassBase::registerPass() {\n getPassRegistrar()->RegisterPass(PIObj);\n\n \/\/ Notify any listeners.\n if (Listeners)\n for (std::vector<PassRegistrationListener*>::iterator\n I = Listeners->begin(), E = Listeners->end(); I != E; ++I)\n (*I)->passRegistered(&PIObj);\n}\n\nvoid RegisterPassBase::unregisterPass() {\n getPassRegistrar()->UnregisterPass(PIObj);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Analysis Group Implementation Code\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ RegisterAGBase implementation\n\/\/\nRegisterAGBase::RegisterAGBase(intptr_t InterfaceID,\n intptr_t PassID, bool isDefault)\n : RegisterPassBase(InterfaceID),\n ImplementationInfo(0), isDefaultImplementation(isDefault) {\n\n InterfaceInfo = const_cast<PassInfo*>(Pass::lookupPassInfo(InterfaceID));\n if (InterfaceInfo == 0) {\n \/\/ First reference to Interface, register it now.\n registerPass();\n InterfaceInfo = &PIObj;\n }\n assert(PIObj.isAnalysisGroup() &&\n \"Trying to join an analysis group that is a normal pass!\");\n\n if (PassID) {\n ImplementationInfo = Pass::lookupPassInfo(PassID);\n assert(ImplementationInfo &&\n \"Must register pass before adding to AnalysisGroup!\");\n\n \/\/ Make sure we keep track of the fact that the implementation implements\n \/\/ the interface.\n PassInfo *IIPI = const_cast<PassInfo*>(ImplementationInfo);\n IIPI->addInterfaceImplemented(InterfaceInfo);\n \n getPassRegistrar()->RegisterAnalysisGroup(InterfaceInfo, IIPI, isDefault);\n }\n}\n\nvoid RegisterAGBase::setGroupName(const char *Name) {\n assert(InterfaceInfo->getPassName()[0] == 0 && \"Interface Name already set!\");\n InterfaceInfo->setPassName(Name);\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ PassRegistrationListener implementation\n\/\/\n\n\/\/ PassRegistrationListener ctor - Add the current object to the list of\n\/\/ PassRegistrationListeners...\nPassRegistrationListener::PassRegistrationListener() {\n if (!Listeners) Listeners = new std::vector<PassRegistrationListener*>();\n Listeners->push_back(this);\n}\n\n\/\/ dtor - Remove object from list of listeners...\nPassRegistrationListener::~PassRegistrationListener() {\n std::vector<PassRegistrationListener*>::iterator I =\n std::find(Listeners->begin(), Listeners->end(), this);\n assert(Listeners && I != Listeners->end() &&\n \"PassRegistrationListener not registered!\");\n Listeners->erase(I);\n\n if (Listeners->empty()) {\n delete Listeners;\n Listeners = 0;\n }\n}\n\n\/\/ enumeratePasses - Iterate over the registered passes, calling the\n\/\/ passEnumerate callback on each PassInfo object.\n\/\/\nvoid PassRegistrationListener::enumeratePasses() {\n getPassRegistrar()->EnumerateWith(this);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AnalysisUsage Class Implementation\n\/\/\n\nnamespace {\n struct GetCFGOnlyPasses : public PassRegistrationListener {\n std::vector<AnalysisID> &CFGOnlyList;\n GetCFGOnlyPasses(std::vector<AnalysisID> &L) : CFGOnlyList(L) {}\n \n void passEnumerate(const PassInfo *P) {\n if (P->isCFGOnlyPass())\n CFGOnlyList.push_back(P);\n }\n };\n}\n\n\/\/ setPreservesCFG - This function should be called to by the pass, iff they do\n\/\/ not:\n\/\/\n\/\/ 1. Add or remove basic blocks from the function\n\/\/ 2. Modify terminator instructions in any way.\n\/\/\n\/\/ This function annotates the AnalysisUsage info object to say that analyses\n\/\/ that only depend on the CFG are preserved by this pass.\n\/\/\nvoid AnalysisUsage::setPreservesCFG() {\n \/\/ Since this transformation doesn't modify the CFG, it preserves all analyses\n \/\/ that only depend on the CFG (like dominators, loop info, etc...)\n GetCFGOnlyPasses(Preserved).enumeratePasses();\n}\n\n\n<commit_msg>Reduce reliance on rtti info<commit_after>\/\/===- Pass.cpp - LLVM Pass Infrastructure Implementation -----------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the LLVM Pass infrastructure. It is primarily\n\/\/ responsible with ensuring that passes are executed and batched together\n\/\/ optimally.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/ModuleProvider.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include <algorithm>\n#include <set>\nusing namespace llvm;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pass Implementation\n\/\/\n\n\/\/ Force out-of-line virtual method.\nPass::~Pass() { \n delete Resolver; \n}\n\n\/\/ Force out-of-line virtual method.\nModulePass::~ModulePass() { }\n\nbool Pass::mustPreserveAnalysisID(const PassInfo *AnalysisID) const {\n return Resolver->getAnalysisToUpdate(AnalysisID, true) != 0;\n}\n\n\/\/ dumpPassStructure - Implement the -debug-passes=Structure option\nvoid Pass::dumpPassStructure(unsigned Offset) {\n cerr << std::string(Offset*2, ' ') << getPassName() << \"\\n\";\n}\n\n\/\/ getPassName - Use C++ RTTI to get a SOMEWHAT intelligible name for the pass.\n\/\/\nconst char *Pass::getPassName() const {\n if (const PassInfo *PI = getPassInfo())\n return PI->getPassName();\n return \"Unnamed pass: implement Pass::getPassName()\";\n}\n\n\/\/ print - Print out the internal state of the pass. This is called by Analyze\n\/\/ to print out the contents of an analysis. Otherwise it is not necessary to\n\/\/ implement this method.\n\/\/\nvoid Pass::print(std::ostream &O,const Module*) const {\n O << \"Pass::print not implemented for pass: '\" << getPassName() << \"'!\\n\";\n}\n\n\/\/ dump - call print(cerr);\nvoid Pass::dump() const {\n print(*cerr.stream(), 0);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ImmutablePass Implementation\n\/\/\n\/\/ Force out-of-line virtual method.\nImmutablePass::~ImmutablePass() { }\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ FunctionPass Implementation\n\/\/\n\n\/\/ run - On a module, we run this pass by initializing, runOnFunction'ing once\n\/\/ for every function in the module, then by finalizing.\n\/\/\nbool FunctionPass::runOnModule(Module &M) {\n bool Changed = doInitialization(M);\n\n for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)\n if (!I->isDeclaration()) \/\/ Passes are not run on external functions!\n Changed |= runOnFunction(*I);\n\n return Changed | doFinalization(M);\n}\n\n\/\/ run - On a function, we simply initialize, run the function, then finalize.\n\/\/\nbool FunctionPass::run(Function &F) {\n if (F.isDeclaration()) return false;\/\/ Passes are not run on external functions!\n\n bool Changed = doInitialization(*F.getParent());\n Changed |= runOnFunction(F);\n return Changed | doFinalization(*F.getParent());\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ BasicBlockPass Implementation\n\/\/\n\n\/\/ To run this pass on a function, we simply call runOnBasicBlock once for each\n\/\/ function.\n\/\/\nbool BasicBlockPass::runOnFunction(Function &F) {\n bool Changed = doInitialization(F);\n for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)\n Changed |= runOnBasicBlock(*I);\n return Changed | doFinalization(F);\n}\n\n\/\/ To run directly on the basic block, we initialize, runOnBasicBlock, then\n\/\/ finalize.\n\/\/\nbool BasicBlockPass::runPass(BasicBlock &BB) {\n Function &F = *BB.getParent();\n Module &M = *F.getParent();\n bool Changed = doInitialization(M);\n Changed |= doInitialization(F);\n Changed |= runOnBasicBlock(BB);\n Changed |= doFinalization(F);\n Changed |= doFinalization(M);\n return Changed;\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Pass Registration mechanism\n\/\/\nnamespace {\nclass PassRegistrar {\n \/\/\/ PassInfoMap - Keep track of the passinfo object for each registered llvm\n \/\/\/ pass.\n std::map<intptr_t, PassInfo*> PassInfoMap;\n \n \/\/\/ AnalysisGroupInfo - Keep track of information for each analysis group.\n struct AnalysisGroupInfo {\n const PassInfo *DefaultImpl;\n std::set<const PassInfo *> Implementations;\n AnalysisGroupInfo() : DefaultImpl(0) {}\n };\n \n \/\/\/ AnalysisGroupInfoMap - Information for each analysis group.\n std::map<const PassInfo *, AnalysisGroupInfo> AnalysisGroupInfoMap;\n\npublic:\n \n const PassInfo *GetPassInfo(intptr_t TI) const {\n std::map<intptr_t, PassInfo*>::const_iterator I = PassInfoMap.find(TI);\n return I != PassInfoMap.end() ? I->second : 0;\n }\n \n void RegisterPass(PassInfo &PI) {\n bool Inserted =\n PassInfoMap.insert(std::make_pair(PI.getTypeInfo(),&PI)).second;\n assert(Inserted && \"Pass registered multiple times!\");\n }\n \n void UnregisterPass(PassInfo &PI) {\n std::map<intptr_t, PassInfo*>::iterator I =\n PassInfoMap.find(PI.getTypeInfo());\n assert(I != PassInfoMap.end() && \"Pass registered but not in map!\");\n \n \/\/ Remove pass from the map.\n PassInfoMap.erase(I);\n }\n \n void EnumerateWith(PassRegistrationListener *L) {\n for (std::map<intptr_t, PassInfo*>::const_iterator I = PassInfoMap.begin(),\n E = PassInfoMap.end(); I != E; ++I)\n L->passEnumerate(I->second);\n }\n \n \n \/\/\/ Analysis Group Mechanisms.\n void RegisterAnalysisGroup(PassInfo *InterfaceInfo,\n const PassInfo *ImplementationInfo,\n bool isDefault) {\n AnalysisGroupInfo &AGI = AnalysisGroupInfoMap[InterfaceInfo];\n assert(AGI.Implementations.count(ImplementationInfo) == 0 &&\n \"Cannot add a pass to the same analysis group more than once!\");\n AGI.Implementations.insert(ImplementationInfo);\n if (isDefault) {\n assert(AGI.DefaultImpl == 0 && InterfaceInfo->getNormalCtor() == 0 &&\n \"Default implementation for analysis group already specified!\");\n assert(ImplementationInfo->getNormalCtor() &&\n \"Cannot specify pass as default if it does not have a default ctor\");\n AGI.DefaultImpl = ImplementationInfo;\n InterfaceInfo->setNormalCtor(ImplementationInfo->getNormalCtor());\n }\n }\n};\n}\n\nstatic std::vector<PassRegistrationListener*> *Listeners = 0;\n\n\/\/ FIXME: This should use ManagedStatic to manage the pass registrar.\n\/\/ Unfortunately, we can't do this, because passes are registered with static\n\/\/ ctors, and having llvm_shutdown clear this map prevents successful\n\/\/ ressurection after llvm_shutdown is run.\nstatic PassRegistrar *getPassRegistrar() {\n static PassRegistrar *PassRegistrarObj = 0;\n if (!PassRegistrarObj)\n PassRegistrarObj = new PassRegistrar();\n return PassRegistrarObj;\n}\n\n\/\/ getPassInfo - Return the PassInfo data structure that corresponds to this\n\/\/ pass...\nconst PassInfo *Pass::getPassInfo() const {\n return lookupPassInfo(PassID);\n}\n\nconst PassInfo *Pass::lookupPassInfo(intptr_t TI) {\n return getPassRegistrar()->GetPassInfo(TI);\n}\n\nvoid RegisterPassBase::registerPass() {\n getPassRegistrar()->RegisterPass(PIObj);\n\n \/\/ Notify any listeners.\n if (Listeners)\n for (std::vector<PassRegistrationListener*>::iterator\n I = Listeners->begin(), E = Listeners->end(); I != E; ++I)\n (*I)->passRegistered(&PIObj);\n}\n\nvoid RegisterPassBase::unregisterPass() {\n getPassRegistrar()->UnregisterPass(PIObj);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Analysis Group Implementation Code\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ RegisterAGBase implementation\n\/\/\nRegisterAGBase::RegisterAGBase(intptr_t InterfaceID,\n intptr_t PassID, bool isDefault)\n : RegisterPassBase(InterfaceID),\n ImplementationInfo(0), isDefaultImplementation(isDefault) {\n\n InterfaceInfo = const_cast<PassInfo*>(Pass::lookupPassInfo(InterfaceID));\n if (InterfaceInfo == 0) {\n \/\/ First reference to Interface, register it now.\n registerPass();\n InterfaceInfo = &PIObj;\n }\n assert(PIObj.isAnalysisGroup() &&\n \"Trying to join an analysis group that is a normal pass!\");\n\n if (PassID) {\n ImplementationInfo = Pass::lookupPassInfo(PassID);\n assert(ImplementationInfo &&\n \"Must register pass before adding to AnalysisGroup!\");\n\n \/\/ Make sure we keep track of the fact that the implementation implements\n \/\/ the interface.\n PassInfo *IIPI = const_cast<PassInfo*>(ImplementationInfo);\n IIPI->addInterfaceImplemented(InterfaceInfo);\n \n getPassRegistrar()->RegisterAnalysisGroup(InterfaceInfo, IIPI, isDefault);\n }\n}\n\nvoid RegisterAGBase::setGroupName(const char *Name) {\n assert(InterfaceInfo->getPassName()[0] == 0 && \"Interface Name already set!\");\n InterfaceInfo->setPassName(Name);\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ PassRegistrationListener implementation\n\/\/\n\n\/\/ PassRegistrationListener ctor - Add the current object to the list of\n\/\/ PassRegistrationListeners...\nPassRegistrationListener::PassRegistrationListener() {\n if (!Listeners) Listeners = new std::vector<PassRegistrationListener*>();\n Listeners->push_back(this);\n}\n\n\/\/ dtor - Remove object from list of listeners...\nPassRegistrationListener::~PassRegistrationListener() {\n std::vector<PassRegistrationListener*>::iterator I =\n std::find(Listeners->begin(), Listeners->end(), this);\n assert(Listeners && I != Listeners->end() &&\n \"PassRegistrationListener not registered!\");\n Listeners->erase(I);\n\n if (Listeners->empty()) {\n delete Listeners;\n Listeners = 0;\n }\n}\n\n\/\/ enumeratePasses - Iterate over the registered passes, calling the\n\/\/ passEnumerate callback on each PassInfo object.\n\/\/\nvoid PassRegistrationListener::enumeratePasses() {\n getPassRegistrar()->EnumerateWith(this);\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ AnalysisUsage Class Implementation\n\/\/\n\nnamespace {\n struct GetCFGOnlyPasses : public PassRegistrationListener {\n std::vector<AnalysisID> &CFGOnlyList;\n GetCFGOnlyPasses(std::vector<AnalysisID> &L) : CFGOnlyList(L) {}\n \n void passEnumerate(const PassInfo *P) {\n if (P->isCFGOnlyPass())\n CFGOnlyList.push_back(P);\n }\n };\n}\n\n\/\/ setPreservesCFG - This function should be called to by the pass, iff they do\n\/\/ not:\n\/\/\n\/\/ 1. Add or remove basic blocks from the function\n\/\/ 2. Modify terminator instructions in any way.\n\/\/\n\/\/ This function annotates the AnalysisUsage info object to say that analyses\n\/\/ that only depend on the CFG are preserved by this pass.\n\/\/\nvoid AnalysisUsage::setPreservesCFG() {\n \/\/ Since this transformation doesn't modify the CFG, it preserves all analyses\n \/\/ that only depend on the CFG (like dominators, loop info, etc...)\n GetCFGOnlyPasses(Preserved).enumeratePasses();\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Stock.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Class.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"system\/Error.hxx\"\n#include \"net\/UniqueSocketDescriptor.hxx\"\n#include \"event\/SocketEvent.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/Duration.hxx\"\n#include \"spawn\/Interface.hxx\"\n#include \"spawn\/Prepared.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"AllocatorPtr.hxx\"\n#include \"pool\/tpool.hxx\"\n#include \"io\/Logger.hxx\"\n\n#include <assert.h>\n#include <unistd.h>\n#include <sys\/un.h>\n#include <sys\/socket.h>\n\nstruct DelegateArgs {\n const char *executable_path;\n\n const ChildOptions &options;\n\n DelegateArgs(const char *_executable_path,\n const ChildOptions &_options)\n :executable_path(_executable_path), options(_options) {}\n\n const char *GetStockKey(struct pool &pool) const {\n const char *key = executable_path;\n\n char options_buffer[16384];\n *options.MakeId(options_buffer) = 0;\n if (*options_buffer != 0)\n key = p_strcat(&pool, key, \"|\", options_buffer, nullptr);\n\n return key;\n }\n};\n\nclass DelegateProcess final : public StockItem {\n const LLogger logger;\n\n UniqueSocketDescriptor fd;\n\n SocketEvent event;\n TimerEvent idle_timeout_event;\n\npublic:\n explicit DelegateProcess(CreateStockItem c, UniqueSocketDescriptor &&_fd)\n :StockItem(c),\n logger(c.GetStockName()),\n fd(std::move(_fd)),\n event(c.stock.GetEventLoop(), fd.Get(), SocketEvent::READ,\n BIND_THIS_METHOD(SocketEventCallback)),\n idle_timeout_event(c.stock.GetEventLoop(),\n BIND_THIS_METHOD(OnIdleTimeout))\n {\n }\n\n ~DelegateProcess() override {\n if (fd.IsDefined())\n event.Delete();\n }\n\n SocketDescriptor GetSocket() const noexcept {\n return fd;\n }\n\n \/* virtual methods from class StockItem *\/\n bool Borrow() noexcept override {\n event.Delete();\n idle_timeout_event.Cancel();\n return true;\n }\n\n bool Release() noexcept override {\n event.Add();\n idle_timeout_event.Add(EventDuration<60>::value);\n return true;\n }\n\nprivate:\n void SocketEventCallback(unsigned events);\n void OnIdleTimeout() noexcept;\n};\n\nclass DelegateStock final : StockClass {\n SpawnService &spawn_service;\n StockMap stock;\n\npublic:\n explicit DelegateStock(EventLoop &event_loop, SpawnService &_spawn_service)\n :spawn_service(_spawn_service),\n stock(event_loop, *this, 0, 16) {}\n\n StockMap &GetStock() {\n return stock;\n }\n\nprivate:\n \/* virtual methods from class StockClass *\/\n void Create(CreateStockItem c, void *info, struct pool &caller_pool,\n CancellablePointer &cancel_ptr) override;\n};\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nDelegateProcess::SocketEventCallback(unsigned)\n{\n char buffer;\n ssize_t nbytes = recv(fd.Get(), &buffer, sizeof(buffer), MSG_DONTWAIT);\n if (nbytes < 0)\n logger(2, \"error on idle delegate process: \", strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle delegate process\");\n\n InvokeIdleDisconnect();\n}\n\ninline void\nDelegateProcess::OnIdleTimeout() noexcept\n{\n InvokeIdleDisconnect();\n}\n\n\/*\n * stock class\n *\n *\/\n\nvoid\nDelegateStock::Create(CreateStockItem c,\n void *_info,\n gcc_unused struct pool &caller_pool,\n gcc_unused CancellablePointer &cancel_ptr)\n{\n auto &info = *(DelegateArgs *)_info;\n\n PreparedChildProcess p;\n p.Append(info.executable_path);\n\n info.options.CopyTo(p, true, nullptr);\n\n UniqueSocketDescriptor server_fd, client_fd;\n if (!UniqueSocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n server_fd, client_fd))\n throw MakeErrno(\"socketpair() failed\");\n\n p.SetStdin(std::move(server_fd));\n\n spawn_service.SpawnChildProcess(info.executable_path,\n std::move(p), nullptr);\n\n auto *process = new DelegateProcess(c, std::move(client_fd));\n process->InvokeCreateSuccess();\n}\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\ndelegate_stock_new(EventLoop &event_loop, SpawnService &spawn_service)\n{\n auto *stock = new DelegateStock(event_loop, spawn_service);\n return &stock->GetStock();\n}\n\nvoid\ndelegate_stock_free(StockMap *_stock)\n{\n auto *stock = (DelegateStock *)&_stock->GetClass();\n delete stock;\n}\n\nStockItem *\ndelegate_stock_get(StockMap *delegate_stock,\n const char *helper,\n const ChildOptions &options)\n{\n const AutoRewindPool auto_rewind(*tpool);\n DelegateArgs args(helper, options);\n return delegate_stock->GetNow(*tpool, args.GetStockKey(*tpool), &args);\n}\n\nSocketDescriptor\ndelegate_stock_item_get(StockItem &item) noexcept\n{\n auto *process = (DelegateProcess *)&item;\n\n return process->GetSocket();\n}\n<commit_msg>delegate\/stock: migrate to class NewSocketEvent<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"Stock.hxx\"\n#include \"stock\/MapStock.hxx\"\n#include \"stock\/Class.hxx\"\n#include \"stock\/Item.hxx\"\n#include \"system\/Error.hxx\"\n#include \"net\/UniqueSocketDescriptor.hxx\"\n#include \"event\/NewSocketEvent.hxx\"\n#include \"event\/TimerEvent.hxx\"\n#include \"event\/Duration.hxx\"\n#include \"spawn\/Interface.hxx\"\n#include \"spawn\/Prepared.hxx\"\n#include \"spawn\/ChildOptions.hxx\"\n#include \"AllocatorPtr.hxx\"\n#include \"pool\/tpool.hxx\"\n#include \"io\/Logger.hxx\"\n\n#include <assert.h>\n#include <unistd.h>\n#include <sys\/un.h>\n#include <sys\/socket.h>\n\nstruct DelegateArgs {\n const char *executable_path;\n\n const ChildOptions &options;\n\n DelegateArgs(const char *_executable_path,\n const ChildOptions &_options)\n :executable_path(_executable_path), options(_options) {}\n\n const char *GetStockKey(struct pool &pool) const {\n const char *key = executable_path;\n\n char options_buffer[16384];\n *options.MakeId(options_buffer) = 0;\n if (*options_buffer != 0)\n key = p_strcat(&pool, key, \"|\", options_buffer, nullptr);\n\n return key;\n }\n};\n\nclass DelegateProcess final : public StockItem {\n const LLogger logger;\n\n UniqueSocketDescriptor fd;\n\n NewSocketEvent event;\n TimerEvent idle_timeout_event;\n\npublic:\n explicit DelegateProcess(CreateStockItem c, UniqueSocketDescriptor &&_fd)\n :StockItem(c),\n logger(c.GetStockName()),\n fd(std::move(_fd)),\n event(c.stock.GetEventLoop(),\n BIND_THIS_METHOD(SocketEventCallback), fd),\n idle_timeout_event(c.stock.GetEventLoop(),\n BIND_THIS_METHOD(OnIdleTimeout))\n {\n }\n\n SocketDescriptor GetSocket() const noexcept {\n return fd;\n }\n\n \/* virtual methods from class StockItem *\/\n bool Borrow() noexcept override {\n event.Cancel();\n idle_timeout_event.Cancel();\n return true;\n }\n\n bool Release() noexcept override {\n event.ScheduleRead();\n idle_timeout_event.Add(EventDuration<60>::value);\n return true;\n }\n\nprivate:\n void SocketEventCallback(unsigned events);\n void OnIdleTimeout() noexcept;\n};\n\nclass DelegateStock final : StockClass {\n SpawnService &spawn_service;\n StockMap stock;\n\npublic:\n explicit DelegateStock(EventLoop &event_loop, SpawnService &_spawn_service)\n :spawn_service(_spawn_service),\n stock(event_loop, *this, 0, 16) {}\n\n StockMap &GetStock() {\n return stock;\n }\n\nprivate:\n \/* virtual methods from class StockClass *\/\n void Create(CreateStockItem c, void *info, struct pool &caller_pool,\n CancellablePointer &cancel_ptr) override;\n};\n\n\/*\n * libevent callback\n *\n *\/\n\ninline void\nDelegateProcess::SocketEventCallback(unsigned)\n{\n char buffer;\n ssize_t nbytes = recv(fd.Get(), &buffer, sizeof(buffer), MSG_DONTWAIT);\n if (nbytes < 0)\n logger(2, \"error on idle delegate process: \", strerror(errno));\n else if (nbytes > 0)\n logger(2, \"unexpected data from idle delegate process\");\n\n InvokeIdleDisconnect();\n}\n\ninline void\nDelegateProcess::OnIdleTimeout() noexcept\n{\n InvokeIdleDisconnect();\n}\n\n\/*\n * stock class\n *\n *\/\n\nvoid\nDelegateStock::Create(CreateStockItem c,\n void *_info,\n gcc_unused struct pool &caller_pool,\n gcc_unused CancellablePointer &cancel_ptr)\n{\n auto &info = *(DelegateArgs *)_info;\n\n PreparedChildProcess p;\n p.Append(info.executable_path);\n\n info.options.CopyTo(p, true, nullptr);\n\n UniqueSocketDescriptor server_fd, client_fd;\n if (!UniqueSocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n server_fd, client_fd))\n throw MakeErrno(\"socketpair() failed\");\n\n p.SetStdin(std::move(server_fd));\n\n spawn_service.SpawnChildProcess(info.executable_path,\n std::move(p), nullptr);\n\n auto *process = new DelegateProcess(c, std::move(client_fd));\n process->InvokeCreateSuccess();\n}\n\n\/*\n * interface\n *\n *\/\n\nStockMap *\ndelegate_stock_new(EventLoop &event_loop, SpawnService &spawn_service)\n{\n auto *stock = new DelegateStock(event_loop, spawn_service);\n return &stock->GetStock();\n}\n\nvoid\ndelegate_stock_free(StockMap *_stock)\n{\n auto *stock = (DelegateStock *)&_stock->GetClass();\n delete stock;\n}\n\nStockItem *\ndelegate_stock_get(StockMap *delegate_stock,\n const char *helper,\n const ChildOptions &options)\n{\n const AutoRewindPool auto_rewind(*tpool);\n DelegateArgs args(helper, options);\n return delegate_stock->GetNow(*tpool, args.GetStockKey(*tpool), &args);\n}\n\nSocketDescriptor\ndelegate_stock_item_get(StockItem &item) noexcept\n{\n auto *process = (DelegateProcess *)&item;\n\n return process->GetSocket();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/options2\/manage_profile_handler2.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/value_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/gaia_info_update_service.h\"\n#include \"chrome\/browser\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_info_util.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/profiles\/profile_metrics.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace options2 {\n\nManageProfileHandler::ManageProfileHandler() {\n}\n\nManageProfileHandler::~ManageProfileHandler() {\n}\n\nvoid ManageProfileHandler::GetLocalizedValues(\n DictionaryValue* localized_strings) {\n DCHECK(localized_strings);\n\n static OptionsStringResource resources[] = {\n { \"manageProfilesNameLabel\", IDS_PROFILES_MANAGE_NAME_LABEL },\n { \"manageProfilesDuplicateNameError\",\n IDS_PROFILES_MANAGE_DUPLICATE_NAME_ERROR },\n { \"manageProfilesIconLabel\", IDS_PROFILES_MANAGE_ICON_LABEL },\n { \"deleteProfileTitle\", IDS_PROFILES_DELETE_TITLE },\n { \"deleteProfileOK\", IDS_PROFILES_DELETE_OK_BUTTON_LABEL },\n { \"deleteProfileMessage\", IDS_PROFILES_DELETE_MESSAGE },\n };\n\n RegisterStrings(localized_strings, resources, arraysize(resources));\n RegisterTitle(localized_strings, \"manageProfile\",\n IDS_PROFILES_MANAGE_TITLE);\n}\n\nvoid ManageProfileHandler::InitializeHandler() {\n registrar_.Add(this, chrome::NOTIFICATION_PROFILE_CACHED_INFO_CHANGED,\n content::NotificationService::AllSources());\n}\n\nvoid ManageProfileHandler::InitializePage() {\n SendProfileNames();\n}\n\nvoid ManageProfileHandler::RegisterMessages() {\n web_ui()->RegisterMessageCallback(\"setProfileNameAndIcon\",\n base::Bind(&ManageProfileHandler::SetProfileNameAndIcon,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"deleteProfile\",\n base::Bind(&ManageProfileHandler::DeleteProfile,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"requestDefaultProfileIcons\",\n base::Bind(&ManageProfileHandler::RequestDefaultProfileIcons,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"requestProfileInfo\",\n base::Bind(&ManageProfileHandler::RequestProfileInfo,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"profileIconSelectionChanged\",\n base::Bind(&ManageProfileHandler::ProfileIconSelectionChanged,\n base::Unretained(this)));\n}\n\nvoid ManageProfileHandler::Observe(\n int type,\n const content::NotificationSource& source,\n const content::NotificationDetails& details) {\n if (type == chrome::NOTIFICATION_PROFILE_CACHED_INFO_CHANGED) {\n SendProfileNames();\n SendProfileIcons();\n } else {\n OptionsPageUIHandler::Observe(type, source, details);\n }\n}\n\nvoid ManageProfileHandler::RequestDefaultProfileIcons(const ListValue* args) {\n SendProfileIcons();\n}\n\nvoid ManageProfileHandler::SendProfileIcons() {\n ListValue image_url_list;\n\n \/\/ First add the GAIA picture if it's available.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n Profile* profile = Profile::FromWebUI(web_ui());\n size_t profile_index = cache.GetIndexOfProfileWithPath(profile->GetPath());\n if (profile_index != std::string::npos) {\n const gfx::Image* icon =\n cache.GetGAIAPictureOfProfileAtIndex(profile_index);\n if (icon) {\n gfx::Image icon2 = profiles::GetAvatarIconForWebUI(*icon, true);\n gaia_picture_url_ = web_ui_util::GetImageDataUrl(icon2);\n image_url_list.Append(Value::CreateStringValue(gaia_picture_url_));\n }\n }\n\n \/\/ Next add the default avatar icons.\n for (size_t i = 0; i < ProfileInfoCache::GetDefaultAvatarIconCount(); i++) {\n std::string url = ProfileInfoCache::GetDefaultAvatarIconUrl(i);\n image_url_list.Append(Value::CreateStringValue(url));\n }\n\n web_ui()->CallJavascriptFunction(\n \"ManageProfileOverlay.receiveDefaultProfileIcons\",\n image_url_list);\n}\n\nvoid ManageProfileHandler::SendProfileNames() {\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n DictionaryValue profile_name_dict;\n for (size_t i = 0, e = cache.GetNumberOfProfiles(); i < e; ++i)\n profile_name_dict.SetBoolean(UTF16ToUTF8(cache.GetNameOfProfileAtIndex(i)),\n true);\n\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.receiveProfileNames\",\n profile_name_dict);\n}\n\nvoid ManageProfileHandler::SetProfileNameAndIcon(const ListValue* args) {\n DCHECK(args);\n\n Value* file_path_value;\n FilePath profile_file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &profile_file_path))\n return;\n\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n size_t profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n\n string16 new_profile_name;\n if (!args->GetString(1, &new_profile_name))\n return;\n\n if (new_profile_name == cache.GetGAIANameOfProfileAtIndex(profile_index)) {\n \/\/ Set the profile to use the GAIA name as the profile name. Note, this\n \/\/ is a little weird if the user typed their GAIA name manually but\n \/\/ it's not a big deal.\n cache.SetIsUsingGAIANameOfProfileAtIndex(profile_index, true);\n \/\/ Using the GAIA name as the profile name can invalidate the profile index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n } else {\n cache.SetNameOfProfileAtIndex(profile_index, new_profile_name);\n \/\/ Changing the profile name can invalidate the profile index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n\n cache.SetIsUsingGAIANameOfProfileAtIndex(profile_index, false);\n \/\/ Unsetting the GAIA name as the profile name can invalidate the profile\n \/\/ index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n }\n\n std::string icon_url;\n if (!args->GetString(2, &icon_url))\n return;\n\n \/\/ Metrics logging variable.\n bool previously_using_gaia_icon =\n cache.IsUsingGAIANameOfProfileAtIndex(profile_index);\n\n size_t new_icon_index;\n if (icon_url == gaia_picture_url_) {\n cache.SetIsUsingGAIAPictureOfProfileAtIndex(profile_index, true);\n if (!previously_using_gaia_icon) {\n \/\/ Only log if they changed to the GAIA photo.\n \/\/ Selection of GAIA photo as avatar is logged as part of the function\n \/\/ below.\n ProfileMetrics::LogProfileSwitchGaia(ProfileMetrics::GAIA_OPT_IN);\n }\n } else if (cache.IsDefaultAvatarIconUrl(icon_url, &new_icon_index)) {\n ProfileMetrics::LogProfileAvatarSelection(new_icon_index);\n cache.SetAvatarIconOfProfileAtIndex(profile_index, new_icon_index);\n cache.SetIsUsingGAIAPictureOfProfileAtIndex(profile_index, false);\n }\n\n ProfileMetrics::LogProfileUpdate(profile_file_path);\n}\n\nvoid ManageProfileHandler::DeleteProfile(const ListValue* args) {\n DCHECK(args);\n \/\/ This handler could have been called in managed mode, for example because\n \/\/ the user fiddled with the web inspector. Silently return in this case.\n if (!ProfileManager::IsMultipleProfilesEnabled())\n return;\n\n ProfileMetrics::LogProfileDeleteUser(ProfileMetrics::PROFILE_DELETED);\n\n Value* file_path_value;\n FilePath profile_file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &profile_file_path))\n return;\n\n g_browser_process->profile_manager()->ScheduleProfileForDeletion(\n profile_file_path);\n}\n\nvoid ManageProfileHandler::RequestProfileInfo(const ListValue* args) {\n DCHECK(args);\n\n Value* index_value;\n double index_double;\n if (!args->Get(0, &index_value) || !index_value->GetAsDouble(&index_double))\n return;\n\n int index = static_cast<int>(index_double);\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n int profile_count = cache.GetNumberOfProfiles();\n if (index < 0 && index >= profile_count)\n return;\n\n FilePath profile_path = cache.GetPathOfProfileAtIndex(index);\n FilePath current_profile_path = Profile::FromWebUI(web_ui())->GetPath();\n bool is_current_profile =\n profile_path == Profile::FromWebUI(web_ui())->GetPath();\n\n DictionaryValue profile_value;\n profile_value.SetString(\"name\", cache.GetNameOfProfileAtIndex(index));\n profile_value.Set(\"filePath\", base::CreateFilePathValue(profile_path));\n profile_value.SetBoolean(\"isCurrentProfile\", is_current_profile);\n\n bool is_gaia_picture =\n cache.IsUsingGAIAPictureOfProfileAtIndex(index) &&\n cache.GetGAIAPictureOfProfileAtIndex(index);\n if (is_gaia_picture) {\n gfx::Image icon = profiles::GetAvatarIconForWebUI(\n cache.GetAvatarIconOfProfileAtIndex(index), true);\n profile_value.SetString(\"iconURL\", web_ui_util::GetImageDataUrl(icon));\n } else {\n size_t icon_index = cache.GetAvatarIconIndexOfProfileAtIndex(index);\n profile_value.SetString(\"iconURL\",\n cache.GetDefaultAvatarIconUrl(icon_index));\n }\n\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.setProfileInfo\",\n profile_value);\n\n \/\/ Ensure that we have the most up to date GAIA picture.\n if (is_current_profile) {\n GAIAInfoUpdateService* service =\n Profile::FromWebUI(web_ui())->GetGAIAInfoUpdateService();\n if (service)\n service->Update();\n }\n}\n\nvoid ManageProfileHandler::ProfileIconSelectionChanged(\n const base::ListValue* args) {\n DCHECK(args);\n\n Value* file_path_value;\n FilePath file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &file_path)) {\n return;\n }\n\n \/\/ Currently this only supports editing the current profile's info.\n if (file_path != Profile::FromWebUI(web_ui())->GetPath())\n return;\n\n std::string icon_url;\n if (!args->GetString(1, &icon_url))\n return;\n\n if (icon_url != gaia_picture_url_)\n return;\n\n \/\/ If the selection is the GAIA picture then also show the GAIA name in the\n \/\/ text field.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n size_t i = cache.GetIndexOfProfileWithPath(file_path);\n if (i == std::string::npos)\n return;\n string16 gaia_name = cache.GetGAIANameOfProfileAtIndex(i);\n if (gaia_name.empty())\n return;\n\n StringValue gaia_name_value(gaia_name);\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.setProfileName\",\n gaia_name_value);\n}\n\n} \/\/ namespace options2\n<commit_msg>Making the personal options handler for the new uber settings page set profile avatar\/name in profile prefs instead of profile info cache. This is simply adding code to the options2 handler that I put in the original options handler. The original bag is crbug.com\/87658.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/webui\/options2\/manage_profile_handler2.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/bind_helpers.h\"\n#include \"base\/string_number_conversions.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"base\/value_conversions.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/gaia_info_update_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/profiles\/profile_info_cache.h\"\n#include \"chrome\/browser\/profiles\/profile_info_util.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/profiles\/profile_metrics.h\"\n#include \"chrome\/browser\/ui\/webui\/web_ui_util.h\"\n#include \"chrome\/common\/chrome_notification_types.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/browser\/notification_service.h\"\n#include \"content\/public\/browser\/web_ui.h\"\n#include \"grit\/generated_resources.h\"\n\nnamespace options2 {\n\nManageProfileHandler::ManageProfileHandler() {\n}\n\nManageProfileHandler::~ManageProfileHandler() {\n}\n\nvoid ManageProfileHandler::GetLocalizedValues(\n DictionaryValue* localized_strings) {\n DCHECK(localized_strings);\n\n static OptionsStringResource resources[] = {\n { \"manageProfilesNameLabel\", IDS_PROFILES_MANAGE_NAME_LABEL },\n { \"manageProfilesDuplicateNameError\",\n IDS_PROFILES_MANAGE_DUPLICATE_NAME_ERROR },\n { \"manageProfilesIconLabel\", IDS_PROFILES_MANAGE_ICON_LABEL },\n { \"deleteProfileTitle\", IDS_PROFILES_DELETE_TITLE },\n { \"deleteProfileOK\", IDS_PROFILES_DELETE_OK_BUTTON_LABEL },\n { \"deleteProfileMessage\", IDS_PROFILES_DELETE_MESSAGE },\n };\n\n RegisterStrings(localized_strings, resources, arraysize(resources));\n RegisterTitle(localized_strings, \"manageProfile\",\n IDS_PROFILES_MANAGE_TITLE);\n}\n\nvoid ManageProfileHandler::InitializeHandler() {\n registrar_.Add(this, chrome::NOTIFICATION_PROFILE_CACHED_INFO_CHANGED,\n content::NotificationService::AllSources());\n}\n\nvoid ManageProfileHandler::InitializePage() {\n SendProfileNames();\n}\n\nvoid ManageProfileHandler::RegisterMessages() {\n web_ui()->RegisterMessageCallback(\"setProfileNameAndIcon\",\n base::Bind(&ManageProfileHandler::SetProfileNameAndIcon,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"deleteProfile\",\n base::Bind(&ManageProfileHandler::DeleteProfile,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"requestDefaultProfileIcons\",\n base::Bind(&ManageProfileHandler::RequestDefaultProfileIcons,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"requestProfileInfo\",\n base::Bind(&ManageProfileHandler::RequestProfileInfo,\n base::Unretained(this)));\n web_ui()->RegisterMessageCallback(\"profileIconSelectionChanged\",\n base::Bind(&ManageProfileHandler::ProfileIconSelectionChanged,\n base::Unretained(this)));\n}\n\nvoid ManageProfileHandler::Observe(\n int type,\n const content::NotificationSource& source,\n const content::NotificationDetails& details) {\n if (type == chrome::NOTIFICATION_PROFILE_CACHED_INFO_CHANGED) {\n SendProfileNames();\n SendProfileIcons();\n } else {\n OptionsPageUIHandler::Observe(type, source, details);\n }\n}\n\nvoid ManageProfileHandler::RequestDefaultProfileIcons(const ListValue* args) {\n SendProfileIcons();\n}\n\nvoid ManageProfileHandler::SendProfileIcons() {\n ListValue image_url_list;\n\n \/\/ First add the GAIA picture if it's available.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n Profile* profile = Profile::FromWebUI(web_ui());\n size_t profile_index = cache.GetIndexOfProfileWithPath(profile->GetPath());\n if (profile_index != std::string::npos) {\n const gfx::Image* icon =\n cache.GetGAIAPictureOfProfileAtIndex(profile_index);\n if (icon) {\n gfx::Image icon2 = profiles::GetAvatarIconForWebUI(*icon, true);\n gaia_picture_url_ = web_ui_util::GetImageDataUrl(icon2);\n image_url_list.Append(Value::CreateStringValue(gaia_picture_url_));\n }\n }\n\n \/\/ Next add the default avatar icons.\n for (size_t i = 0; i < ProfileInfoCache::GetDefaultAvatarIconCount(); i++) {\n std::string url = ProfileInfoCache::GetDefaultAvatarIconUrl(i);\n image_url_list.Append(Value::CreateStringValue(url));\n }\n\n web_ui()->CallJavascriptFunction(\n \"ManageProfileOverlay.receiveDefaultProfileIcons\",\n image_url_list);\n}\n\nvoid ManageProfileHandler::SendProfileNames() {\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n DictionaryValue profile_name_dict;\n for (size_t i = 0, e = cache.GetNumberOfProfiles(); i < e; ++i)\n profile_name_dict.SetBoolean(UTF16ToUTF8(cache.GetNameOfProfileAtIndex(i)),\n true);\n\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.receiveProfileNames\",\n profile_name_dict);\n}\n\nvoid ManageProfileHandler::SetProfileNameAndIcon(const ListValue* args) {\n DCHECK(args);\n\n Value* file_path_value;\n FilePath profile_file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &profile_file_path))\n return;\n\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n size_t profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n\n Profile* profile =\n g_browser_process->profile_manager()->GetProfile(profile_file_path);\n if (!profile)\n return;\n\n string16 new_profile_name;\n if (!args->GetString(1, &new_profile_name))\n return;\n\n if (new_profile_name == cache.GetGAIANameOfProfileAtIndex(profile_index)) {\n \/\/ Set the profile to use the GAIA name as the profile name. Note, this\n \/\/ is a little weird if the user typed their GAIA name manually but\n \/\/ it's not a big deal.\n cache.SetIsUsingGAIANameOfProfileAtIndex(profile_index, true);\n \/\/ Using the GAIA name as the profile name can invalidate the profile index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n } else {\n PrefService* pref_service = profile->GetPrefs();\n \/\/ Updating the profile preference will cause the cache to be updated for\n \/\/ this preference.\n pref_service->SetString(prefs::kProfileName, UTF16ToUTF8(new_profile_name));\n\n \/\/ Changing the profile name can invalidate the profile index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n\n cache.SetIsUsingGAIANameOfProfileAtIndex(profile_index, false);\n \/\/ Unsetting the GAIA name as the profile name can invalidate the profile\n \/\/ index.\n profile_index = cache.GetIndexOfProfileWithPath(profile_file_path);\n if (profile_index == std::string::npos)\n return;\n }\n\n std::string icon_url;\n if (!args->GetString(2, &icon_url))\n return;\n\n \/\/ Metrics logging variable.\n bool previously_using_gaia_icon =\n cache.IsUsingGAIANameOfProfileAtIndex(profile_index);\n\n size_t new_icon_index;\n if (icon_url == gaia_picture_url_) {\n cache.SetIsUsingGAIAPictureOfProfileAtIndex(profile_index, true);\n if (!previously_using_gaia_icon) {\n \/\/ Only log if they changed to the GAIA photo.\n \/\/ Selection of GAIA photo as avatar is logged as part of the function\n \/\/ below.\n ProfileMetrics::LogProfileSwitchGaia(ProfileMetrics::GAIA_OPT_IN);\n }\n } else if (cache.IsDefaultAvatarIconUrl(icon_url, &new_icon_index)) {\n ProfileMetrics::LogProfileAvatarSelection(new_icon_index);\n PrefService* pref_service = profile->GetPrefs();\n \/\/ Updating the profile preference will cause the cache to be updated for\n \/\/ this preference.\n pref_service->SetInteger(prefs::kProfileAvatarIndex, new_icon_index);\n cache.SetIsUsingGAIAPictureOfProfileAtIndex(profile_index, false);\n }\n\n ProfileMetrics::LogProfileUpdate(profile_file_path);\n}\n\nvoid ManageProfileHandler::DeleteProfile(const ListValue* args) {\n DCHECK(args);\n \/\/ This handler could have been called in managed mode, for example because\n \/\/ the user fiddled with the web inspector. Silently return in this case.\n if (!ProfileManager::IsMultipleProfilesEnabled())\n return;\n\n ProfileMetrics::LogProfileDeleteUser(ProfileMetrics::PROFILE_DELETED);\n\n Value* file_path_value;\n FilePath profile_file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &profile_file_path))\n return;\n\n g_browser_process->profile_manager()->ScheduleProfileForDeletion(\n profile_file_path);\n}\n\nvoid ManageProfileHandler::RequestProfileInfo(const ListValue* args) {\n DCHECK(args);\n\n Value* index_value;\n double index_double;\n if (!args->Get(0, &index_value) || !index_value->GetAsDouble(&index_double))\n return;\n\n int index = static_cast<int>(index_double);\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n int profile_count = cache.GetNumberOfProfiles();\n if (index < 0 && index >= profile_count)\n return;\n\n FilePath profile_path = cache.GetPathOfProfileAtIndex(index);\n FilePath current_profile_path = Profile::FromWebUI(web_ui())->GetPath();\n bool is_current_profile =\n profile_path == Profile::FromWebUI(web_ui())->GetPath();\n\n DictionaryValue profile_value;\n profile_value.SetString(\"name\", cache.GetNameOfProfileAtIndex(index));\n profile_value.Set(\"filePath\", base::CreateFilePathValue(profile_path));\n profile_value.SetBoolean(\"isCurrentProfile\", is_current_profile);\n\n bool is_gaia_picture =\n cache.IsUsingGAIAPictureOfProfileAtIndex(index) &&\n cache.GetGAIAPictureOfProfileAtIndex(index);\n if (is_gaia_picture) {\n gfx::Image icon = profiles::GetAvatarIconForWebUI(\n cache.GetAvatarIconOfProfileAtIndex(index), true);\n profile_value.SetString(\"iconURL\", web_ui_util::GetImageDataUrl(icon));\n } else {\n size_t icon_index = cache.GetAvatarIconIndexOfProfileAtIndex(index);\n profile_value.SetString(\"iconURL\",\n cache.GetDefaultAvatarIconUrl(icon_index));\n }\n\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.setProfileInfo\",\n profile_value);\n\n \/\/ Ensure that we have the most up to date GAIA picture.\n if (is_current_profile) {\n GAIAInfoUpdateService* service =\n Profile::FromWebUI(web_ui())->GetGAIAInfoUpdateService();\n if (service)\n service->Update();\n }\n}\n\nvoid ManageProfileHandler::ProfileIconSelectionChanged(\n const base::ListValue* args) {\n DCHECK(args);\n\n Value* file_path_value;\n FilePath file_path;\n if (!args->Get(0, &file_path_value) ||\n !base::GetValueAsFilePath(*file_path_value, &file_path)) {\n return;\n }\n\n \/\/ Currently this only supports editing the current profile's info.\n if (file_path != Profile::FromWebUI(web_ui())->GetPath())\n return;\n\n std::string icon_url;\n if (!args->GetString(1, &icon_url))\n return;\n\n if (icon_url != gaia_picture_url_)\n return;\n\n \/\/ If the selection is the GAIA picture then also show the GAIA name in the\n \/\/ text field.\n ProfileInfoCache& cache =\n g_browser_process->profile_manager()->GetProfileInfoCache();\n size_t i = cache.GetIndexOfProfileWithPath(file_path);\n if (i == std::string::npos)\n return;\n string16 gaia_name = cache.GetGAIANameOfProfileAtIndex(i);\n if (gaia_name.empty())\n return;\n\n StringValue gaia_name_value(gaia_name);\n web_ui()->CallJavascriptFunction(\"ManageProfileOverlay.setProfileName\",\n gaia_name_value);\n}\n\n} \/\/ namespace options2\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ This utility program exists to process the False Start blacklist file into\n\/\/ a static hash table so that it can be efficiently queried by Chrome.\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"base\/basictypes.h\"\n#include \"net\/base\/ssl_false_start_blacklist.h\"\n\nusing net::SSLFalseStartBlacklist;\n\nstatic const unsigned kBuckets = SSLFalseStartBlacklist::kBuckets;\n\nstatic bool verbose = false;\n\nstatic int\nusage(const char* argv0) {\n fprintf(stderr, \"Usage: %s <blacklist file> <output .c file>\\n\", argv0);\n return 1;\n}\n\n\/\/ StripWWWPrefix removes \"www.\" from the beginning of any elements of the\n\/\/ vector.\nstatic void StripWWWPrefix(std::vector<std::string>* hosts) {\n static const char kPrefix[] = \"www.\";\n static const unsigned kPrefixLen = sizeof(kPrefix) - 1;\n\n for (size_t i = 0; i < hosts->size(); i++) {\n const std::string& h = (*hosts)[i];\n if (h.size() >= kPrefixLen &&\n memcmp(h.data(), kPrefix, kPrefixLen) == 0) {\n (*hosts)[i] = h.substr(kPrefixLen, h.size() - kPrefixLen);\n }\n }\n}\n\n\/\/ RemoveDuplicateEntries removes all duplicates from |hosts|.\nstatic void RemoveDuplicateEntries(std::vector<std::string>* hosts) {\n std::set<std::string> hosts_set;\n std::vector<std::string> ret;\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n if (hosts_set.count(*i)) {\n if (verbose)\n fprintf(stderr, \"Removing duplicate entry for %s\\n\", i->c_str());\n continue;\n }\n hosts_set.insert(*i);\n ret.push_back(*i);\n }\n\n hosts->swap(ret);\n}\n\n\/\/ ParentDomain returns the parent domain for a given domain name or the empty\n\/\/ string if the name is a top-level domain.\nstatic std::string ParentDomain(const std::string& in) {\n for (size_t i = 0; i < in.size(); i++) {\n if (in[i] == '.') {\n return in.substr(i + 1, in.size() - i - 1);\n }\n }\n\n return std::string();\n}\n\n\/\/ RemoveRedundantEntries removes any entries which are subdomains of other\n\/\/ entries. (i.e. foo.example.com would be removed if example.com were also\n\/\/ included.)\nstatic void RemoveRedundantEntries(std::vector<std::string>* hosts) {\n std::set<std::string> hosts_set;\n std::vector<std::string> ret;\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n hosts_set.insert(*i);\n }\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n std::string parent = ParentDomain(*i);\n while (!parent.empty()) {\n if (hosts_set.count(parent))\n break;\n parent = ParentDomain(parent);\n }\n if (parent.empty()) {\n ret.push_back(*i);\n } else {\n if (verbose)\n fprintf(stderr, \"Removing %s as redundant\\n\", i->c_str());\n }\n }\n\n hosts->swap(ret);\n}\n\n\/\/ CheckLengths returns true iff every host is less than 256 bytes long (not\n\/\/ including the terminating NUL) and contains two or more labels.\nstatic bool CheckLengths(const std::vector<std::string>& hosts) {\n for (std::vector<std::string>::const_iterator\n i = hosts.begin(); i != hosts.end(); i++) {\n if (i->size() >= 256) {\n fprintf(stderr, \"Entry %s is too large\\n\", i->c_str());\n return false;\n }\n if (SSLFalseStartBlacklist::LastTwoLabels(i->c_str()) == NULL) {\n fprintf(stderr, \"Entry %s contains too few labels\\n\", i->c_str());\n return false;\n }\n }\n\n return true;\n}\n\nint main(int argc, char** argv) {\n if (argc != 3)\n return usage(argv[0]);\n\n const char* input_file = argv[1];\n const char* output_file = argv[2];\n FILE* input = fopen(input_file, \"rb\");\n if (!input) {\n perror(\"open\");\n return usage(argv[0]);\n }\n\n if (fseek(input, 0, SEEK_END)) {\n perror(\"fseek\");\n return 1;\n }\n\n const long input_size = ftell(input);\n\n if (fseek(input, 0, SEEK_SET)) {\n perror(\"fseek\");\n return 1;\n }\n\n char* buffer = static_cast<char*>(malloc(input_size));\n long done = 0;\n while (done < input_size) {\n size_t n = fread(buffer + done, 1, input_size - done, input);\n if (n == 0) {\n perror(\"fread\");\n free(buffer);\n fclose(input);\n return 1;\n }\n done += n;\n }\n fclose(input);\n\n std::vector<std::string> hosts;\n\n off_t line_start = 0;\n bool is_comment = false;\n bool non_whitespace_seen = false;\n for (long i = 0; i <= input_size; i++) {\n if (i == input_size || buffer[i] == '\\n') {\n if (!is_comment && non_whitespace_seen) {\n long len = i - line_start;\n if (i > 0 && buffer[i-1] == '\\r')\n len--;\n hosts.push_back(std::string(&buffer[line_start], len));\n }\n is_comment = false;\n non_whitespace_seen = false;\n line_start = i + 1;\n continue;\n }\n\n if (i == line_start && buffer[i] == '#')\n is_comment = true;\n if (buffer[i] != ' ' && buffer[i] != '\\t' && buffer[i] != '\\r')\n non_whitespace_seen = true;\n }\n free(buffer);\n\n fprintf(stderr, \"Have %d hosts after parse\\n\", (int) hosts.size());\n StripWWWPrefix(&hosts);\n RemoveDuplicateEntries(&hosts);\n fprintf(stderr, \"Have %d hosts after removing duplicates\\n\", (int) hosts.size());\n RemoveRedundantEntries(&hosts);\n fprintf(stderr, \"Have %d hosts after removing redundants\\n\", (int) hosts.size());\n if (!CheckLengths(hosts)) {\n fprintf(stderr, \"One or more entries is too large or too small\\n\");\n return 2;\n }\n\n fprintf(stderr, \"Using %d entry hash table\\n\", kBuckets);\n uint32 table[kBuckets];\n std::vector<std::string> buckets[kBuckets];\n\n for (std::vector<std::string>::const_iterator\n i = hosts.begin(); i != hosts.end(); i++) {\n const char* last_two_labels =\n SSLFalseStartBlacklist::LastTwoLabels(i->c_str());\n const unsigned h = SSLFalseStartBlacklist::Hash(last_two_labels);\n buckets[h & (kBuckets - 1)].push_back(*i);\n }\n\n std::string table_data;\n unsigned max_bucket_size = 0;\n for (unsigned i = 0; i < kBuckets; i++) {\n if (buckets[i].size() > max_bucket_size)\n max_bucket_size = buckets[i].size();\n\n table[i] = table_data.size();\n for (std::vector<std::string>::const_iterator\n j = buckets[i].begin(); j != buckets[i].end(); j++) {\n table_data.push_back((char) j->size());\n table_data.append(*j);\n }\n }\n\n fprintf(stderr, \"Largest bucket has %d entries\\n\", max_bucket_size);\n\n FILE* out = fopen(output_file, \"w+\");\n if (!out) {\n perror(\"opening output file\");\n return 4;\n }\n\n fprintf(out, \"\/\/ Copyright (c) 2010 The Chromium Authors. All rights \"\n \"reserved.\\n\/\/ Use of this source code is governed by a BSD-style \"\n \"license that can be\\n\/\/ found in the LICENSE file.\\n\\n\");\n fprintf(out, \"\/\/ WARNING: this code is generated by\\n\"\n \"\/\/ ssl_false_start_blacklist_process.cc. Do not edit.\\n\\n\");\n fprintf(out, \"#include \\\"base\/basictypes.h\\\"\\n\\n\");\n fprintf(out, \"#include \\\"net\/base\/ssl_false_start_blacklist.h\\\"\\n\\n\");\n fprintf(out, \"namespace net {\\n\\n\");\n fprintf(out, \"const uint32 SSLFalseStartBlacklist::kHashTable[%d + 1] = {\\n\",\n kBuckets);\n for (unsigned i = 0; i < kBuckets; i++) {\n fprintf(out, \" %u,\\n\", (unsigned) table[i]);\n }\n fprintf(out, \" %u,\\n\", (unsigned) table_data.size());\n fprintf(out, \"};\\n\\n\");\n\n fprintf(out, \"const char SSLFalseStartBlacklist::kHashData[] = {\\n\");\n for (unsigned i = 0, line_length = 0; i < table_data.size(); i++) {\n if (line_length == 0)\n fprintf(out, \" \");\n uint8 c = static_cast<uint8>(table_data[i]);\n line_length += fprintf(out, \"%d, \", c);\n if (i == table_data.size() - 1) {\n fprintf(out, \"\\n};\\n\");\n } else if (line_length >= 70) {\n fprintf(out, \"\\n\");\n line_length = 0;\n }\n }\n fprintf(out, \"\\n} \/\/ namespace net\\n\");\n fclose(out);\n\n return 0;\n}\n<commit_msg>Coverity bug fix (NEGATIVE_RETURNS) CID=12906<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ This utility program exists to process the False Start blacklist file into\n\/\/ a static hash table so that it can be efficiently queried by Chrome.\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"base\/basictypes.h\"\n#include \"net\/base\/ssl_false_start_blacklist.h\"\n\nusing net::SSLFalseStartBlacklist;\n\nstatic const unsigned kBuckets = SSLFalseStartBlacklist::kBuckets;\n\nstatic bool verbose = false;\n\nstatic int\nusage(const char* argv0) {\n fprintf(stderr, \"Usage: %s <blacklist file> <output .c file>\\n\", argv0);\n return 1;\n}\n\n\/\/ StripWWWPrefix removes \"www.\" from the beginning of any elements of the\n\/\/ vector.\nstatic void StripWWWPrefix(std::vector<std::string>* hosts) {\n static const char kPrefix[] = \"www.\";\n static const unsigned kPrefixLen = sizeof(kPrefix) - 1;\n\n for (size_t i = 0; i < hosts->size(); i++) {\n const std::string& h = (*hosts)[i];\n if (h.size() >= kPrefixLen &&\n memcmp(h.data(), kPrefix, kPrefixLen) == 0) {\n (*hosts)[i] = h.substr(kPrefixLen, h.size() - kPrefixLen);\n }\n }\n}\n\n\/\/ RemoveDuplicateEntries removes all duplicates from |hosts|.\nstatic void RemoveDuplicateEntries(std::vector<std::string>* hosts) {\n std::set<std::string> hosts_set;\n std::vector<std::string> ret;\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n if (hosts_set.count(*i)) {\n if (verbose)\n fprintf(stderr, \"Removing duplicate entry for %s\\n\", i->c_str());\n continue;\n }\n hosts_set.insert(*i);\n ret.push_back(*i);\n }\n\n hosts->swap(ret);\n}\n\n\/\/ ParentDomain returns the parent domain for a given domain name or the empty\n\/\/ string if the name is a top-level domain.\nstatic std::string ParentDomain(const std::string& in) {\n for (size_t i = 0; i < in.size(); i++) {\n if (in[i] == '.') {\n return in.substr(i + 1, in.size() - i - 1);\n }\n }\n\n return std::string();\n}\n\n\/\/ RemoveRedundantEntries removes any entries which are subdomains of other\n\/\/ entries. (i.e. foo.example.com would be removed if example.com were also\n\/\/ included.)\nstatic void RemoveRedundantEntries(std::vector<std::string>* hosts) {\n std::set<std::string> hosts_set;\n std::vector<std::string> ret;\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n hosts_set.insert(*i);\n }\n\n for (std::vector<std::string>::const_iterator\n i = hosts->begin(); i != hosts->end(); i++) {\n std::string parent = ParentDomain(*i);\n while (!parent.empty()) {\n if (hosts_set.count(parent))\n break;\n parent = ParentDomain(parent);\n }\n if (parent.empty()) {\n ret.push_back(*i);\n } else {\n if (verbose)\n fprintf(stderr, \"Removing %s as redundant\\n\", i->c_str());\n }\n }\n\n hosts->swap(ret);\n}\n\n\/\/ CheckLengths returns true iff every host is less than 256 bytes long (not\n\/\/ including the terminating NUL) and contains two or more labels.\nstatic bool CheckLengths(const std::vector<std::string>& hosts) {\n for (std::vector<std::string>::const_iterator\n i = hosts.begin(); i != hosts.end(); i++) {\n if (i->size() >= 256) {\n fprintf(stderr, \"Entry %s is too large\\n\", i->c_str());\n return false;\n }\n if (SSLFalseStartBlacklist::LastTwoLabels(i->c_str()) == NULL) {\n fprintf(stderr, \"Entry %s contains too few labels\\n\", i->c_str());\n return false;\n }\n }\n\n return true;\n}\n\nint main(int argc, char** argv) {\n if (argc != 3)\n return usage(argv[0]);\n\n const char* input_file = argv[1];\n const char* output_file = argv[2];\n FILE* input = fopen(input_file, \"rb\");\n if (!input) {\n perror(\"open\");\n return usage(argv[0]);\n }\n\n if (fseek(input, 0, SEEK_END)) {\n perror(\"fseek\");\n return 1;\n }\n\n const long input_size = ftell(input);\n if (input_size < 0) {\n perror(\"ftell\");\n return 1;\n }\n\n if (fseek(input, 0, SEEK_SET)) {\n perror(\"fseek\");\n return 1;\n }\n\n char* buffer = static_cast<char*>(malloc(input_size));\n long done = 0;\n while (done < input_size) {\n size_t n = fread(buffer + done, 1, input_size - done, input);\n if (n == 0) {\n perror(\"fread\");\n free(buffer);\n fclose(input);\n return 1;\n }\n done += n;\n }\n fclose(input);\n\n std::vector<std::string> hosts;\n\n off_t line_start = 0;\n bool is_comment = false;\n bool non_whitespace_seen = false;\n for (long i = 0; i <= input_size; i++) {\n if (i == input_size || buffer[i] == '\\n') {\n if (!is_comment && non_whitespace_seen) {\n long len = i - line_start;\n if (i > 0 && buffer[i-1] == '\\r')\n len--;\n hosts.push_back(std::string(&buffer[line_start], len));\n }\n is_comment = false;\n non_whitespace_seen = false;\n line_start = i + 1;\n continue;\n }\n\n if (i == line_start && buffer[i] == '#')\n is_comment = true;\n if (buffer[i] != ' ' && buffer[i] != '\\t' && buffer[i] != '\\r')\n non_whitespace_seen = true;\n }\n free(buffer);\n\n fprintf(stderr, \"Have %d hosts after parse\\n\", (int) hosts.size());\n StripWWWPrefix(&hosts);\n RemoveDuplicateEntries(&hosts);\n fprintf(stderr, \"Have %d hosts after removing duplicates\\n\", (int) hosts.size());\n RemoveRedundantEntries(&hosts);\n fprintf(stderr, \"Have %d hosts after removing redundants\\n\", (int) hosts.size());\n if (!CheckLengths(hosts)) {\n fprintf(stderr, \"One or more entries is too large or too small\\n\");\n return 2;\n }\n\n fprintf(stderr, \"Using %d entry hash table\\n\", kBuckets);\n uint32 table[kBuckets];\n std::vector<std::string> buckets[kBuckets];\n\n for (std::vector<std::string>::const_iterator\n i = hosts.begin(); i != hosts.end(); i++) {\n const char* last_two_labels =\n SSLFalseStartBlacklist::LastTwoLabels(i->c_str());\n const unsigned h = SSLFalseStartBlacklist::Hash(last_two_labels);\n buckets[h & (kBuckets - 1)].push_back(*i);\n }\n\n std::string table_data;\n unsigned max_bucket_size = 0;\n for (unsigned i = 0; i < kBuckets; i++) {\n if (buckets[i].size() > max_bucket_size)\n max_bucket_size = buckets[i].size();\n\n table[i] = table_data.size();\n for (std::vector<std::string>::const_iterator\n j = buckets[i].begin(); j != buckets[i].end(); j++) {\n table_data.push_back((char) j->size());\n table_data.append(*j);\n }\n }\n\n fprintf(stderr, \"Largest bucket has %d entries\\n\", max_bucket_size);\n\n FILE* out = fopen(output_file, \"w+\");\n if (!out) {\n perror(\"opening output file\");\n return 4;\n }\n\n fprintf(out, \"\/\/ Copyright (c) 2010 The Chromium Authors. All rights \"\n \"reserved.\\n\/\/ Use of this source code is governed by a BSD-style \"\n \"license that can be\\n\/\/ found in the LICENSE file.\\n\\n\");\n fprintf(out, \"\/\/ WARNING: this code is generated by\\n\"\n \"\/\/ ssl_false_start_blacklist_process.cc. Do not edit.\\n\\n\");\n fprintf(out, \"#include \\\"base\/basictypes.h\\\"\\n\\n\");\n fprintf(out, \"#include \\\"net\/base\/ssl_false_start_blacklist.h\\\"\\n\\n\");\n fprintf(out, \"namespace net {\\n\\n\");\n fprintf(out, \"const uint32 SSLFalseStartBlacklist::kHashTable[%d + 1] = {\\n\",\n kBuckets);\n for (unsigned i = 0; i < kBuckets; i++) {\n fprintf(out, \" %u,\\n\", (unsigned) table[i]);\n }\n fprintf(out, \" %u,\\n\", (unsigned) table_data.size());\n fprintf(out, \"};\\n\\n\");\n\n fprintf(out, \"const char SSLFalseStartBlacklist::kHashData[] = {\\n\");\n for (unsigned i = 0, line_length = 0; i < table_data.size(); i++) {\n if (line_length == 0)\n fprintf(out, \" \");\n uint8 c = static_cast<uint8>(table_data[i]);\n line_length += fprintf(out, \"%d, \", c);\n if (i == table_data.size() - 1) {\n fprintf(out, \"\\n};\\n\");\n } else if (line_length >= 70) {\n fprintf(out, \"\\n\");\n line_length = 0;\n }\n }\n fprintf(out, \"\\n} \/\/ namespace net\\n\");\n fclose(out);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Correctly get ExtensionService out of EXTENSION_PROCESS_CRASHED notification.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"vast\/index.h\"\n\n#include <ze\/type\/regex.h>\n#include \"vast\/logger.h\"\n#include \"vast\/fs\/operations.h\"\n#include \"vast\/fs\/fstream.h\"\n#include \"vast\/expression.h\"\n\nnamespace vast {\nnamespace detail {\n\n\/\/\/ Picks the relevant subsets of the query expression and forwards them to\n\/\/\/ the index.\nclass picker : public expr::const_visitor\n{\npublic:\n \/\/\/ Constructs a picker with an index actor.\n picker(index::meta const& m, std::vector<ze::uuid>& ids)\n : meta_(m)\n , ids_(ids)\n {\n }\n\n virtual void visit(expr::node const&)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::extractor const&)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::timestamp_extractor const&)\n {\n assert(rhs_.which() == ze::timepoint_type);\n assert(op_ != nullptr);\n\n \/\/ If the time point is in the interval, we have to consider it.\n auto time = rhs_.get<ze::time_point>();\n for (auto& i : meta_.ranges)\n if (i.first.first >= time && i.first.second <= time)\n ids_.push_back(i.second);\n }\n\n virtual void visit(expr::name_extractor const& node)\n {\n assert(rhs_.which() == ze::string_type || rhs_.which() == ze::regex_type);\n assert(op_ != nullptr);\n\n for (auto& i : meta_.names)\n {\n if ((*op_)(i.first, rhs_))\n ids_.push_back(i.second);\n }\n }\n\n virtual void visit(expr::id_extractor const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::offset_extractor const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::exists const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::n_ary_operator const& n_ary)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::conjunction const& conj)\n {\n std::vector<ze::uuid> ids;\n\n \/\/ The first intersection operand has a free shot.\n auto i = conj.operands().begin();\n picker p(meta_, ids);\n (*i)->accept(p);\n std::sort(ids.begin(), ids.end());\n\n for (++i; i != conj.operands().end(); ++i)\n {\n std::vector<ze::uuid> result;\n picker p(meta_, result);\n (*i)->accept(p);\n\n std::sort(result.begin(), result.end());\n std::vector<ze::uuid> intersection;\n\n std::set_intersection(ids.begin(), ids.end(),\n result.begin(), result.end(),\n std::back_inserter(intersection));\n\n intersection.swap(ids);\n }\n\n ids_.swap(ids);\n }\n\n virtual void visit(expr::disjunction const& disj)\n {\n std::vector<ze::uuid> ids;\n for (auto& operand : disj.operands())\n {\n std::vector<ze::uuid> result;\n picker p(meta_, result);\n operand->accept(p);\n\n std::sort(result.begin(), result.end());\n std::vector<ze::uuid> unification;\n\n std::set_union(ids.begin(), ids.end(),\n result.begin(), result.end(),\n std::back_inserter(unification));\n\n unification.swap(ids);\n }\n\n ids_.swap(ids);\n }\n\n virtual void visit(expr::relational_operator const& op)\n {\n assert(op_ == nullptr);\n assert(rhs_ == ze::invalid);\n assert(op.operands().size() == 2);\n\n \/\/ We first save the RHS value,\n op.operands()[1]->accept(*this);\n\n \/\/ then save the predicate, ...\n op_ = &op.op();\n\n \/\/ ...and finally dispatch to the LHS extractor.\n op.operands()[0]->accept(*this);\n\n op_ = nullptr;\n rhs_ = ze::invalid;\n }\n\n virtual void visit(expr::constant const& c)\n {\n assert(c.ready());\n rhs_ = c.result();\n }\n\nprivate:\n ze::value rhs_ = ze::invalid;\n expr::relational_operator::binary_predicate const* op_ = nullptr;\n index::meta const& meta_;\n std::vector<ze::uuid>& ids_;\n};\n\n} \/\/ namespace detail\n\nindex::index(cppa::actor_ptr archive, std::string directory)\n : dir_(std::move(directory))\n , archive_(archive)\n{\n using namespace cppa;\n chaining(false);\n init_state = (\n on(atom(\"load\")) >> [=]\n {\n LOG(verbose, index) << \"spawning index @\" << id();\n if (! fs::exists(dir_))\n {\n LOG(info, index)\n << \"index @\" << id() << \" creates new directory \" << dir_;\n fs::mkdir(dir_);\n }\n\n assert(fs::exists(dir_));\n fs::each_file_entry(\n dir_,\n [&](fs::path const& p)\n {\n fs::ifstream file(p, std::ios::binary | std::ios::in);\n ze::serialization::stream_iarchive ia(file);\n segment::header hdr;\n ia >> hdr;\n\n build(hdr);\n });\n },\n on(atom(\"hit\"), atom(\"all\")) >> [=]\n {\n if (ids_.empty())\n {\n reply(atom(\"miss\"));\n return;\n }\n\n std::vector<ze::uuid> ids;\n std::copy(ids_.begin(), ids_.end(), std::back_inserter(ids));\n reply(atom(\"hit\"), std::move(ids));\n },\n on(atom(\"hit\"), arg_match) >> [=](expression const& expr)\n {\n if (ids_.empty())\n {\n reply(atom(\"miss\"));\n return;\n }\n\n std::vector<ze::uuid> ids;\n detail::picker picker(meta_, ids);\n expr.accept(picker);\n\n if (ids.empty())\n reply(atom(\"miss\"));\n else\n reply(atom(\"hit\"), std::move(ids));\n\n },\n on(atom(\"build\"), arg_match) >> [=](segment const& s)\n {\n process(s);\n },\n on(atom(\"shutdown\")) >> [=]()\n {\n quit();\n LOG(verbose, index) << \"index @\" << id() << \" terminated\";\n });\n}\n\nvoid index::process(segment const& s)\n{\n write(s);\n build(s.head());\n}\n\nvoid index::write(segment const& s)\n{\n auto path = fs::path(dir_) \/ s.id().to_string();\n fs::ofstream file(path, std::ios::binary | std::ios::out);\n ze::serialization::stream_oarchive oa(file);\n oa << s.head();\n\n LOG(verbose, index)\n << \"index @\" << id() << \" wrote segment header to \" << path;\n}\n\nvoid index::build(segment::header const& hdr)\n{\n LOG(verbose, index) << \"index @\" << id()\n << \" builds in-memory indexes for segment \" << hdr.id;\n\n assert(ids_.count(hdr.id) == 0);\n ids_.insert(hdr.id);\n\n\/\/ TODO: Remove as soon as newer GCC versions have adopted r181022.\n#ifdef __clang__\n for (auto& event : hdr.event_names)\n meta_.names.emplace(event, hdr.id);\n\n#else\n for (auto& event : hdr.event_names)\n meta_.names.insert({event, hdr.id});\n#endif\n\n meta_.ranges.insert({{hdr.start, hdr.end}, hdr.id});\n}\n\n} \/\/ namespace vast\n<commit_msg>Better support time ranges.<commit_after>#include \"vast\/index.h\"\n\n#include <ze\/type\/regex.h>\n#include \"vast\/logger.h\"\n#include \"vast\/fs\/operations.h\"\n#include \"vast\/fs\/fstream.h\"\n#include \"vast\/expression.h\"\n\nnamespace vast {\nnamespace detail {\n\n\/\/\/ Picks the relevant subsets of the query expression and forwards them to\n\/\/\/ the index.\nclass picker : public expr::const_visitor\n{\npublic:\n \/\/\/ Constructs a picker with an index actor.\n picker(index::meta const& m, std::vector<ze::uuid>& ids)\n : meta_(m)\n , ids_(ids)\n {\n }\n\n virtual void visit(expr::node const&)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::extractor const&)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::timestamp_extractor const&)\n {\n assert(rhs_.which() == ze::timepoint_type);\n assert(op_ != nullptr);\n\n \/\/ If the time point is in the interval, we have to consider it.\n for (auto& i : meta_.ranges)\n if ((*op_)(i.first.first, rhs_) || (*op_)(i.first.first, rhs_))\n ids_.push_back(i.second);\n }\n\n virtual void visit(expr::name_extractor const& node)\n {\n assert(rhs_.which() == ze::string_type || rhs_.which() == ze::regex_type);\n assert(op_ != nullptr);\n\n for (auto& i : meta_.names)\n {\n if ((*op_)(i.first, rhs_))\n ids_.push_back(i.second);\n }\n }\n\n virtual void visit(expr::id_extractor const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::offset_extractor const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::exists const&)\n {\n \/* Do exactly nothing. *\/\n }\n\n virtual void visit(expr::n_ary_operator const& n_ary)\n {\n assert(! \"should never happen\");\n }\n\n virtual void visit(expr::conjunction const& conj)\n {\n std::vector<ze::uuid> ids;\n\n \/\/ The first intersection operand has a free shot.\n auto i = conj.operands().begin();\n picker p(meta_, ids);\n (*i)->accept(p);\n std::sort(ids.begin(), ids.end());\n\n for (++i; i != conj.operands().end(); ++i)\n {\n std::vector<ze::uuid> result;\n picker p(meta_, result);\n (*i)->accept(p);\n\n std::sort(result.begin(), result.end());\n std::vector<ze::uuid> intersection;\n\n std::set_intersection(ids.begin(), ids.end(),\n result.begin(), result.end(),\n std::back_inserter(intersection));\n\n intersection.swap(ids);\n }\n\n ids_.swap(ids);\n }\n\n virtual void visit(expr::disjunction const& disj)\n {\n std::vector<ze::uuid> ids;\n for (auto& operand : disj.operands())\n {\n std::vector<ze::uuid> result;\n picker p(meta_, result);\n operand->accept(p);\n\n std::sort(result.begin(), result.end());\n std::vector<ze::uuid> unification;\n\n std::set_union(ids.begin(), ids.end(),\n result.begin(), result.end(),\n std::back_inserter(unification));\n\n unification.swap(ids);\n }\n\n ids_.swap(ids);\n }\n\n virtual void visit(expr::relational_operator const& op)\n {\n assert(op_ == nullptr);\n assert(rhs_ == ze::invalid);\n assert(op.operands().size() == 2);\n\n \/\/ We first save the RHS value,\n op.operands()[1]->accept(*this);\n\n \/\/ then save the predicate, ...\n op_ = &op.op();\n\n \/\/ ...and finally dispatch to the LHS extractor.\n op.operands()[0]->accept(*this);\n\n op_ = nullptr;\n rhs_ = ze::invalid;\n }\n\n virtual void visit(expr::constant const& c)\n {\n assert(c.ready());\n rhs_ = c.result();\n }\n\nprivate:\n ze::value rhs_ = ze::invalid;\n expr::relational_operator::binary_predicate const* op_ = nullptr;\n index::meta const& meta_;\n std::vector<ze::uuid>& ids_;\n};\n\n} \/\/ namespace detail\n\nindex::index(cppa::actor_ptr archive, std::string directory)\n : dir_(std::move(directory))\n , archive_(archive)\n{\n using namespace cppa;\n chaining(false);\n init_state = (\n on(atom(\"load\")) >> [=]\n {\n LOG(verbose, index) << \"spawning index @\" << id();\n if (! fs::exists(dir_))\n {\n LOG(info, index)\n << \"index @\" << id() << \" creates new directory \" << dir_;\n fs::mkdir(dir_);\n }\n\n assert(fs::exists(dir_));\n fs::each_file_entry(\n dir_,\n [&](fs::path const& p)\n {\n fs::ifstream file(p, std::ios::binary | std::ios::in);\n ze::serialization::stream_iarchive ia(file);\n segment::header hdr;\n ia >> hdr;\n\n build(hdr);\n });\n },\n on(atom(\"hit\"), atom(\"all\")) >> [=]\n {\n if (ids_.empty())\n {\n reply(atom(\"miss\"));\n return;\n }\n\n std::vector<ze::uuid> ids;\n std::copy(ids_.begin(), ids_.end(), std::back_inserter(ids));\n reply(atom(\"hit\"), std::move(ids));\n },\n on(atom(\"hit\"), arg_match) >> [=](expression const& expr)\n {\n if (ids_.empty())\n {\n reply(atom(\"miss\"));\n return;\n }\n\n std::vector<ze::uuid> ids;\n detail::picker picker(meta_, ids);\n expr.accept(picker);\n\n if (ids.empty())\n reply(atom(\"miss\"));\n else\n reply(atom(\"hit\"), std::move(ids));\n\n },\n on(atom(\"build\"), arg_match) >> [=](segment const& s)\n {\n process(s);\n },\n on(atom(\"shutdown\")) >> [=]()\n {\n quit();\n LOG(verbose, index) << \"index @\" << id() << \" terminated\";\n });\n}\n\nvoid index::process(segment const& s)\n{\n write(s);\n build(s.head());\n}\n\nvoid index::write(segment const& s)\n{\n auto path = fs::path(dir_) \/ s.id().to_string();\n fs::ofstream file(path, std::ios::binary | std::ios::out);\n ze::serialization::stream_oarchive oa(file);\n oa << s.head();\n\n LOG(verbose, index)\n << \"index @\" << id() << \" wrote segment header to \" << path;\n}\n\nvoid index::build(segment::header const& hdr)\n{\n LOG(verbose, index) << \"index @\" << id()\n << \" builds in-memory indexes for segment \" << hdr.id;\n\n assert(ids_.count(hdr.id) == 0);\n ids_.insert(hdr.id);\n\n\/\/ TODO: Remove as soon as newer GCC versions have adopted r181022.\n#ifdef __clang__\n for (auto& event : hdr.event_names)\n meta_.names.emplace(event, hdr.id);\n\n#else\n for (auto& event : hdr.event_names)\n meta_.names.insert({event, hdr.id});\n#endif\n\n meta_.ranges.insert({{hdr.start, hdr.end}, hdr.id});\n}\n\n} \/\/ namespace vast\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: randrwrapper.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifdef USE_RANDR\n\n#include \"prex.h\"\n#include <X11\/extensions\/Xrandr.h>\n#include \"postx.h\"\n\n#include \"osl\/module.h\"\n#include \"rtl\/ustring.hxx\"\n\nnamespace\n{\nclass RandRWrapper\n{\n oslModule m_pRandRLib;\n\n \/\/ function pointers\n Bool(*m_pXRRQueryExtension)(Display*,int*,int*);\n Status(*m_pXRRQueryVersion)(Display*,int*,int*);\n XRRScreenConfiguration*(*m_pXRRGetScreenInfo)(Display*,Drawable);\n void(*m_pXRRFreeScreenConfigInfo)(XRRScreenConfiguration*);\n void(*m_pXRRSelectInput)(Display*,XLIB_Window,int);\n int(*m_pXRRUpdateConfiguration)(XEvent*);\n XRRScreenSize*(*m_pXRRSizes)(Display*,int,int*);\n XRRScreenSize*(*m_pXRRConfigSizes)(XRRScreenConfiguration*,int*);\n SizeID(*m_pXRRConfigCurrentConfiguration)(XRRScreenConfiguration*,Rotation*);\n\n bool m_bValid;\n\n void initFromModule();\n\n RandRWrapper(Display*);\n ~RandRWrapper();\npublic:\n static RandRWrapper& get(Display*);\n static void releaseWrapper();\n\n Bool XRRQueryExtension(Display* i_pDisp, int* o_event_base, int* o_error_base )\n {\n Bool bRet = False;\n if( m_bValid )\n bRet = m_pXRRQueryExtension( i_pDisp, o_event_base, o_error_base );\n return bRet;\n }\n Status XRRQueryVersion( Display* i_pDisp, int* o_major, int* o_minor )\n {\n return m_bValid ? m_pXRRQueryVersion( i_pDisp, o_major, o_minor ) : 0;\n }\n XRRScreenConfiguration* XRRGetScreenInfo( Display* i_pDisp, Drawable i_aDrawable )\n {\n return m_bValid ? m_pXRRGetScreenInfo( i_pDisp, i_aDrawable ) : NULL;\n }\n void XRRFreeScreenConfigInfo( XRRScreenConfiguration* i_pConfig )\n {\n if( m_bValid )\n m_pXRRFreeScreenConfigInfo( i_pConfig );\n }\n void XRRSelectInput( Display* i_pDisp, XLIB_Window i_window, int i_nMask )\n {\n if( m_bValid )\n m_pXRRSelectInput( i_pDisp, i_window, i_nMask );\n }\n int XRRUpdateConfiguration( XEvent* i_pEvent )\n {\n return m_bValid ? m_pXRRUpdateConfiguration( i_pEvent ) : 0;\n }\n XRRScreenSize* XRRSizes( Display* i_pDisp, int i_screen, int* o_nscreens )\n {\n return m_bValid ? m_pXRRSizes( i_pDisp, i_screen, o_nscreens ) : NULL;\n }\n XRRScreenSize* XRRConfigSizes( XRRScreenConfiguration* i_pConfig, int* o_nSizes )\n {\n return m_bValid ? m_pXRRConfigSizes( i_pConfig, o_nSizes ) : NULL;\n }\n SizeID XRRConfigCurrentConfiguration( XRRScreenConfiguration* i_pConfig, Rotation* o_pRot )\n {\n return m_bValid ? m_pXRRConfigCurrentConfiguration( i_pConfig, o_pRot ) : 0;\n }\n};\n}\n\nvoid RandRWrapper::initFromModule()\n{\n m_pXRRQueryExtension = (Bool(*)(Display*,int*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRQueryExtension\" );\n m_pXRRQueryVersion = (Status(*)(Display*,int*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRQueryVersion\" );\n m_pXRRGetScreenInfo = (XRRScreenConfiguration*(*)(Display*,Drawable))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRGetScreenInfo\" );\n m_pXRRFreeScreenConfigInfo = (void(*)(XRRScreenConfiguration*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRFreeScreenConfigInfo\" );\n m_pXRRSelectInput = (void(*)(Display*,XLIB_Window,int))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRSelectInput\" );\n m_pXRRUpdateConfiguration = (int(*)(XEvent*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRUpdateConfiguration\" );\n m_pXRRSizes = (XRRScreenSize*(*)(Display*,int,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRSizes\" );\n m_pXRRConfigSizes = (XRRScreenSize*(*)(XRRScreenConfiguration*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRConfigSizes\" );\n m_pXRRConfigCurrentConfiguration = (SizeID(*)(XRRScreenConfiguration*,Rotation*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRConfigCurrentConfiguration\" );\n\n m_bValid = m_pXRRQueryExtension &&\n m_pXRRQueryVersion &&\n m_pXRRGetScreenInfo &&\n m_pXRRFreeScreenConfigInfo &&\n m_pXRRSelectInput &&\n m_pXRRUpdateConfiguration &&\n m_pXRRSizes &&\n m_pXRRConfigSizes &&\n m_pXRRConfigCurrentConfiguration\n ;\n}\n\nRandRWrapper::RandRWrapper( Display* pDisplay ) :\n m_pRandRLib( NULL ),\n m_pXRRQueryExtension( NULL ),\n m_pXRRQueryVersion( NULL ),\n m_pXRRGetScreenInfo( NULL ),\n m_pXRRFreeScreenConfigInfo( NULL ),\n m_pXRRSelectInput( NULL ),\n m_pXRRUpdateConfiguration( NULL ),\n m_pXRRSizes( NULL ),\n m_pXRRConfigSizes( NULL ),\n m_pXRRConfigCurrentConfiguration( NULL ),\n m_bValid( false )\n{\n \/\/ first try in process space (e.g. gtk links that ?)\n initFromModule();\n if( ! m_bValid )\n {\n rtl::OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( \"libXrandr.so.2\" ) );\n m_pRandRLib = osl_loadModule( aLibName.pData, SAL_LOADMODULE_DEFAULT );\n initFromModule();\n }\n if( m_bValid )\n {\n int nEventBase = 0, nErrorBase = 0;\n if( ! m_pXRRQueryExtension( pDisplay, &nEventBase, &nErrorBase ) )\n m_bValid = false;\n }\n}\n\nRandRWrapper::~RandRWrapper()\n{\n if( m_pRandRLib )\n osl_unloadModule( m_pRandRLib );\n}\n\nstatic RandRWrapper* pWrapper = NULL;\n\nRandRWrapper& RandRWrapper::get( Display* i_pDisplay )\n{\n if( ! pWrapper )\n pWrapper = new RandRWrapper( i_pDisplay );\n return *pWrapper;\n}\n\nvoid RandRWrapper::releaseWrapper()\n{\n delete pWrapper;\n pWrapper = NULL;\n}\n\n#endif\n\n#include \"saldisp.hxx\"\n\nvoid SalDisplay::InitRandR( XLIB_Window aRoot ) const\n{\n #ifdef USE_RANDR\n if( m_bUseRandRWrapper )\n RandRWrapper::get( GetDisplay() ).XRRSelectInput( GetDisplay(), aRoot, RRScreenChangeNotifyMask );\n #else\n (void)aRoot;\n #endif\n}\n\nvoid SalDisplay::DeInitRandR()\n{\n #ifdef USE_RANDR\n if( m_bUseRandRWrapper )\n RandRWrapper::releaseWrapper();\n #endif\n}\n\nint SalDisplay::processRandREvent( XEvent* pEvent )\n{\n int nRet = 0;\n #ifdef USE_RANDR\n if( m_bUseRandRWrapper && pWrapper )\n {\n nRet = pWrapper->XRRUpdateConfiguration( pEvent );\n if( nRet == 1 && pEvent->type != ConfigureNotify) \/\/ this should then be a XRRScreenChangeNotifyEvent\n {\n \/\/ update screens\n for( size_t i = 0; i < m_aScreens.size(); i++ )\n {\n if( m_aScreens[i].m_bInit )\n {\n XRRScreenConfiguration *pConfig = NULL;\n XRRScreenSize *pSizes = NULL;\n int nSizes = 0;\n Rotation nRot = 0;\n SizeID nId = 0;\n\n pConfig = pWrapper->XRRGetScreenInfo( GetDisplay(), m_aScreens[i].m_aRoot );\n nId = pWrapper->XRRConfigCurrentConfiguration( pConfig, &nRot );\n pSizes = pWrapper->XRRConfigSizes( pConfig, &nSizes );\n XRRScreenSize *pTargetSize = pSizes + nId;\n\n m_aScreens[i].m_aSize = Size( pTargetSize->width, pTargetSize->height );\n\n pWrapper->XRRFreeScreenConfigInfo( pConfig );\n\n #if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"screen %d changed to size %dx%d\\n\", i, pTargetSize->width, pTargetSize->height );\n #endif\n }\n }\n }\n }\n #else\n (void)pEvent;\n #endif\n return nRet;\n}\n<commit_msg>INTEGRATION: CWS vcl90 (1.3.58); FILE MERGED 2008\/06\/24 09:01:04 pl 1.3.58.2: #i90809# Xrandr link modifications (thanks thb) 2008\/06\/04 16:45:37 pl 1.3.58.1: remove warnings<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: randrwrapper.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifdef USE_RANDR\n\n#include \"prex.h\"\n#include <X11\/extensions\/Xrandr.h>\n#include \"postx.h\"\n\n#include \"osl\/module.h\"\n#include \"rtl\/ustring.hxx\"\n\nnamespace\n{\n\n# ifdef XRANDR_DLOPEN\n\nclass RandRWrapper\n{\n oslModule m_pRandRLib;\n\n \/\/ function pointers\n Bool(*m_pXRRQueryExtension)(Display*,int*,int*);\n Status(*m_pXRRQueryVersion)(Display*,int*,int*);\n XRRScreenConfiguration*(*m_pXRRGetScreenInfo)(Display*,Drawable);\n void(*m_pXRRFreeScreenConfigInfo)(XRRScreenConfiguration*);\n void(*m_pXRRSelectInput)(Display*,XLIB_Window,int);\n int(*m_pXRRUpdateConfiguration)(XEvent*);\n XRRScreenSize*(*m_pXRRSizes)(Display*,int,int*);\n XRRScreenSize*(*m_pXRRConfigSizes)(XRRScreenConfiguration*,int*);\n SizeID(*m_pXRRConfigCurrentConfiguration)(XRRScreenConfiguration*,Rotation*);\n int(*m_pXRRRootToScreen)(Display*, XLIB_Window);\n\n bool m_bValid;\n\n void initFromModule();\n\n RandRWrapper(Display*);\n ~RandRWrapper();\npublic:\n static RandRWrapper& get(Display*);\n static void releaseWrapper();\n\n Bool XRRQueryExtension(Display* i_pDisp, int* o_event_base, int* o_error_base )\n {\n Bool bRet = False;\n if( m_bValid )\n bRet = m_pXRRQueryExtension( i_pDisp, o_event_base, o_error_base );\n return bRet;\n }\n Status XRRQueryVersion( Display* i_pDisp, int* o_major, int* o_minor )\n {\n return m_bValid ? m_pXRRQueryVersion( i_pDisp, o_major, o_minor ) : 0;\n }\n XRRScreenConfiguration* XRRGetScreenInfo( Display* i_pDisp, Drawable i_aDrawable )\n {\n return m_bValid ? m_pXRRGetScreenInfo( i_pDisp, i_aDrawable ) : NULL;\n }\n void XRRFreeScreenConfigInfo( XRRScreenConfiguration* i_pConfig )\n {\n if( m_bValid )\n m_pXRRFreeScreenConfigInfo( i_pConfig );\n }\n void XRRSelectInput( Display* i_pDisp, XLIB_Window i_window, int i_nMask )\n {\n if( m_bValid )\n m_pXRRSelectInput( i_pDisp, i_window, i_nMask );\n }\n int XRRUpdateConfiguration( XEvent* i_pEvent )\n {\n return m_bValid ? m_pXRRUpdateConfiguration( i_pEvent ) : 0;\n }\n XRRScreenSize* XRRSizes( Display* i_pDisp, int i_screen, int* o_nscreens )\n {\n return m_bValid ? m_pXRRSizes( i_pDisp, i_screen, o_nscreens ) : NULL;\n }\n XRRScreenSize* XRRConfigSizes( XRRScreenConfiguration* i_pConfig, int* o_nSizes )\n {\n return m_bValid ? m_pXRRConfigSizes( i_pConfig, o_nSizes ) : NULL;\n }\n SizeID XRRConfigCurrentConfiguration( XRRScreenConfiguration* i_pConfig, Rotation* o_pRot )\n {\n return m_bValid ? m_pXRRConfigCurrentConfiguration( i_pConfig, o_pRot ) : 0;\n }\n int XRRRootToScreen( Display *dpy, XLIB_Window root )\n {\n return m_bValid ? m_pXRRRootToScreen( dpy, root ) : -1;\n }\n};\n\nvoid RandRWrapper::initFromModule()\n{\n m_pXRRQueryExtension = (Bool(*)(Display*,int*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRQueryExtension\" );\n m_pXRRQueryVersion = (Status(*)(Display*,int*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRQueryVersion\" );\n m_pXRRGetScreenInfo = (XRRScreenConfiguration*(*)(Display*,Drawable))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRGetScreenInfo\" );\n m_pXRRFreeScreenConfigInfo = (void(*)(XRRScreenConfiguration*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRFreeScreenConfigInfo\" );\n m_pXRRSelectInput = (void(*)(Display*,XLIB_Window,int))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRSelectInput\" );\n m_pXRRUpdateConfiguration = (int(*)(XEvent*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRUpdateConfiguration\" );\n m_pXRRSizes = (XRRScreenSize*(*)(Display*,int,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRSizes\" );\n m_pXRRConfigSizes = (XRRScreenSize*(*)(XRRScreenConfiguration*,int*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRConfigSizes\" );\n m_pXRRConfigCurrentConfiguration = (SizeID(*)(XRRScreenConfiguration*,Rotation*))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRConfigCurrentConfiguration\" );\n m_pXRRRootToScreen = (int(*)(Display*,XLIB_Window))osl_getAsciiFunctionSymbol( m_pRandRLib, \"XRRRootToScreen\" );\n\n m_bValid = m_pXRRQueryExtension &&\n m_pXRRQueryVersion &&\n m_pXRRGetScreenInfo &&\n m_pXRRFreeScreenConfigInfo &&\n m_pXRRSelectInput &&\n m_pXRRUpdateConfiguration &&\n m_pXRRSizes &&\n m_pXRRConfigSizes &&\n m_pXRRConfigCurrentConfiguration &&\n m_pXRRRootToScreen\n ;\n}\n\nRandRWrapper::RandRWrapper( Display* pDisplay ) :\n m_pRandRLib( NULL ),\n m_pXRRQueryExtension( NULL ),\n m_pXRRQueryVersion( NULL ),\n m_pXRRGetScreenInfo( NULL ),\n m_pXRRFreeScreenConfigInfo( NULL ),\n m_pXRRSelectInput( NULL ),\n m_pXRRUpdateConfiguration( NULL ),\n m_pXRRSizes( NULL ),\n m_pXRRConfigSizes( NULL ),\n m_pXRRConfigCurrentConfiguration( NULL ),\n m_pXRRRootToScreen( NULL ),\n m_bValid( false )\n{\n \/\/ first try in process space (e.g. gtk links that ?)\n initFromModule();\n if( ! m_bValid )\n {\n rtl::OUString aLibName( RTL_CONSTASCII_USTRINGPARAM( \"libXrandr.so.2\" ) );\n m_pRandRLib = osl_loadModule( aLibName.pData, SAL_LOADMODULE_DEFAULT );\n initFromModule();\n }\n if( m_bValid )\n {\n int nEventBase = 0, nErrorBase = 0;\n if( ! m_pXRRQueryExtension( pDisplay, &nEventBase, &nErrorBase ) )\n m_bValid = false;\n }\n}\n\nRandRWrapper::~RandRWrapper()\n{\n if( m_pRandRLib )\n osl_unloadModule( m_pRandRLib );\n}\n\nstatic RandRWrapper* pWrapper = NULL;\n\nRandRWrapper& RandRWrapper::get( Display* i_pDisplay )\n{\n if( ! pWrapper )\n pWrapper = new RandRWrapper( i_pDisplay );\n return *pWrapper;\n}\n\nvoid RandRWrapper::releaseWrapper()\n{\n delete pWrapper;\n pWrapper = NULL;\n}\n\n# else\n\nclass RandRWrapper\n{\n bool m_bValid;\n\n RandRWrapper(Display*);\npublic:\n static RandRWrapper& get(Display*);\n static void releaseWrapper();\n\n Bool XRRQueryExtension(Display* i_pDisp, int* o_event_base, int* o_error_base )\n {\n Bool bRet = False;\n if( m_bValid )\n bRet = ::XRRQueryExtension( i_pDisp, o_event_base, o_error_base );\n return bRet;\n }\n Status XRRQueryVersion( Display* i_pDisp, int* o_major, int* o_minor )\n {\n return m_bValid ? ::XRRQueryVersion( i_pDisp, o_major, o_minor ) : 0;\n }\n XRRScreenConfiguration* XRRGetScreenInfo( Display* i_pDisp, Drawable i_aDrawable )\n {\n return m_bValid ? ::XRRGetScreenInfo( i_pDisp, i_aDrawable ) : NULL;\n }\n void XRRFreeScreenConfigInfo( XRRScreenConfiguration* i_pConfig )\n {\n if( m_bValid )\n ::XRRFreeScreenConfigInfo( i_pConfig );\n }\n void XRRSelectInput( Display* i_pDisp, XLIB_Window i_window, int i_nMask )\n {\n if( m_bValid )\n ::XRRSelectInput( i_pDisp, i_window, i_nMask );\n }\n int XRRUpdateConfiguration( XEvent* i_pEvent )\n {\n return m_bValid ? ::XRRUpdateConfiguration( i_pEvent ) : 0;\n }\n XRRScreenSize* XRRSizes( Display* i_pDisp, int i_screen, int* o_nscreens )\n {\n return m_bValid ? ::XRRSizes( i_pDisp, i_screen, o_nscreens ) : NULL;\n }\n XRRScreenSize* XRRConfigSizes( XRRScreenConfiguration* i_pConfig, int* o_nSizes )\n {\n return m_bValid ? ::XRRConfigSizes( i_pConfig, o_nSizes ) : NULL;\n }\n SizeID XRRConfigCurrentConfiguration( XRRScreenConfiguration* i_pConfig, Rotation* o_pRot )\n {\n return m_bValid ? ::XRRConfigCurrentConfiguration( i_pConfig, o_pRot ) : 0;\n }\n int XRRRootToScreen( Display *dpy, XLIB_Window root )\n {\n return m_bValid ? ::XRRRootToScreen( dpy, root ) : -1;\n }\n};\n\nRandRWrapper::RandRWrapper( Display* pDisplay ) :\n m_bValid( true )\n{\n int nEventBase = 0, nErrorBase = 0;\n if( !XRRQueryExtension( pDisplay, &nEventBase, &nErrorBase ) )\n m_bValid = false;\n}\n\nstatic RandRWrapper* pWrapper = NULL;\n\nRandRWrapper& RandRWrapper::get( Display* i_pDisplay )\n{\n if( ! pWrapper )\n pWrapper = new RandRWrapper( i_pDisplay );\n return *pWrapper;\n}\n\nvoid RandRWrapper::releaseWrapper()\n{\n delete pWrapper;\n pWrapper = NULL;\n}\n\n#endif\n\n} \/\/ namespace\n\n#endif\n\n#include \"saldisp.hxx\"\n\nvoid SalDisplay::InitRandR( XLIB_Window aRoot ) const\n{\n #ifdef USE_RANDR\n if( m_bUseRandRWrapper )\n RandRWrapper::get( GetDisplay() ).XRRSelectInput( GetDisplay(), aRoot, RRScreenChangeNotifyMask );\n #else\n (void)aRoot;\n #endif\n}\n\nvoid SalDisplay::DeInitRandR()\n{\n #ifdef USE_RANDR\n if( m_bUseRandRWrapper )\n RandRWrapper::releaseWrapper();\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"SalDisplay::DeInitRandR()\\n\" );\n#endif\n #endif\n}\n\nint SalDisplay::processRandREvent( XEvent* pEvent )\n{\n int nRet = 0;\n #ifdef USE_RANDR\n XConfigureEvent* pCnfEvent=(XConfigureEvent*)pEvent;\n if( m_bUseRandRWrapper && pWrapper && pWrapper->XRRRootToScreen(GetDisplay(),pCnfEvent->window) != -1 )\n {\n nRet = pWrapper->XRRUpdateConfiguration( pEvent );\n if( nRet == 1 && pEvent->type != ConfigureNotify) \/\/ this should then be a XRRScreenChangeNotifyEvent\n {\n \/\/ update screens\n for( size_t i = 0; i < m_aScreens.size(); i++ )\n {\n if( m_aScreens[i].m_bInit )\n {\n XRRScreenConfiguration *pConfig = NULL;\n XRRScreenSize *pSizes = NULL;\n int nSizes = 0;\n Rotation nRot = 0;\n SizeID nId = 0;\n\n pConfig = pWrapper->XRRGetScreenInfo( GetDisplay(), m_aScreens[i].m_aRoot );\n nId = pWrapper->XRRConfigCurrentConfiguration( pConfig, &nRot );\n pSizes = pWrapper->XRRConfigSizes( pConfig, &nSizes );\n XRRScreenSize *pTargetSize = pSizes + nId;\n\n m_aScreens[i].m_aSize = Size( pTargetSize->width, pTargetSize->height );\n\n pWrapper->XRRFreeScreenConfigInfo( pConfig );\n\n #if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"screen %d changed to size %dx%d\\n\", (int)i, (int)pTargetSize->width, (int)pTargetSize->height );\n #endif\n }\n }\n }\n }\n #else\n (void)pEvent;\n #endif\n return nRet;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by hacht on 4\/25\/17.\n\/\/\n\n#include <cuda_runtime_api.h>\n#include <iostream>\n#include \"..\/..\/simpleCNN\/simpleCNN.h\"\n\n#include \"cuda.h\"\n\nusing namespace simpleCNN;\n\nusing dropout = Dropout_layer;\nusing conv = Convolutional_layer;\nusing maxpool = Maxpooling_layer;\nusing fully = Connected_layer;\nusing network = Network<Sequential>;\nusing adam = Adam<float_t>;\nusing relu = Activation_layer;\nusing softmax = loss::Softmax;\n\nstatic bool train_mnist(const size_t batch_size, const size_t epoch, const std::string data, const std::string result) {\n \/** Mnist specific parameters *\/\n size_t mnist_image_row = 28;\n size_t mnist_image_col = 28;\n size_t mnist_image_num = 60000;\n size_t mnist_test_num = 10000;\n size_t in_width = 28;\n size_t in_height = 28;\n size_t subset = 1;\n\n \/** Parse mnist *\/\n tensor_t labels({mnist_image_num \/ subset, 1, 1, 1});\n tensor_t images({mnist_image_num \/ subset, 1, in_height, in_width});\n tensor_t test_images({mnist_test_num \/ subset, 1, in_height, in_width});\n tensor_t test_labels({mnist_test_num, 1, 1, 1});\n\n float_t min = -1.0f;\n float_t max = 1.0f;\n images.fill(min);\n\n parse_mnist_images(data + \"\/train-images.idx3-ubyte\", &images, min, max, 0, 0, subset);\n parse_mnist_labels(data + \"\/train-labels.idx1-ubyte\", &labels, subset);\n parse_mnist_images(data + \"\/t10k-images.idx3-ubyte\", &test_images, min, max, 0, 0, subset);\n parse_mnist_labels(data + \"\/t10k-labels.idx1-ubyte\", &test_labels);\n\n \/** Pre-processing *\/\n std::vector<float_t> mean_and_std = zero_mean_unit_variance(images);\n size_t minibatch_size = batch_size;\n size_t epochs = epoch;\n mean_and_std.push_back(float_t(batch_size));\n mean_and_std.push_back(float_t(epoch));\n\n zero_mean_unit_variance(test_images, mean_and_std[0], mean_and_std[1]);\n\n \/** Split data into a training and validation set *\/\n float_t training_validation_split_ratio = 0.75;\n size_t training_set_size = (mnist_image_num \/ subset) * training_validation_split_ratio;\n size_t validation_set_size = std::floor((mnist_image_num \/ subset) * (1 - training_validation_split_ratio) + 0.5);\n\n tensor_t train_images({training_set_size, 1, in_height, in_width});\n tensor_t train_labels({training_set_size, 1, 1, 1});\n tensor_t validation_images({validation_set_size, 1, in_height, in_width});\n tensor_t validation_labels({validation_set_size, 1, 1, 1});\n\n split_training_validation(images, train_images, validation_images, training_validation_split_ratio);\n split_training_validation(labels, train_labels, validation_labels, training_validation_split_ratio);\n\n \/*\n for (size_t sample = 0; sample < 100; sample++) {\n auto img = test_images.subView({sample}, {1, 1, in_height, in_width});\n auto lab = test_labels.subView({sample}, {1, 1, 1, 1});\n\n display_gray_image(img, *lab.host_begin(), mean_and_std.at(0), mean_and_std.at(1));\n } *\/\n\n \/** Call-back for clocking *\/\n auto on_enumerate_minibatch = [&](time_t t) {\n std::cout << (float_t)(clock() - t) \/ CLOCKS_PER_SEC << \"s elapsed.\" << std::endl;\n };\n\n auto on_enumerate_epoch = [&](size_t epoch) { std::cout << epoch + 1 << std::endl; };\n\n \/** Define network architecture and optimizer *\/\n network net;\n float_t dropout_rate = 0.75;\n\n \/* GPU - 21.56s 429MiB *\/\n net << conv(28, 28, 1, minibatch_size, 5, 32, 1, 2, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu)\n << maxpool(28, 28, 32, minibatch_size, 2, 2, 2, 2, core::backend_t::gpu)\n << conv(14, 14, 32, minibatch_size, 5, 64, 1, 2, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu)\n << maxpool(14, 14, 64, minibatch_size, 2, 2, 2, 2, core::backend_t::gpu)\n << fully(7 * 7 * 64, 1024, minibatch_size, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu) << dropout(dropout_rate)\n << fully(1024, 10, minibatch_size, true, core::backend_t::gpu, true) << softmax();\n\n \/* CPU - 902.74s\n net << conv(28, 28, 1, minibatch_size, 5, 32, 1, 2, true) << relu(core::activation_t::relu)\n << maxpool(28, 28, 32, minibatch_size)\n << conv(14, 14, 32, minibatch_size, 5, 64, 1, 2, true) << relu(core::activation_t::relu)\n << maxpool(14, 14, 64, minibatch_size)\n << fully(7 * 7 * 64, 1024, minibatch_size, true) << relu(core::activation_t::relu)\n << dropout(dropout_rate)\n << fully(1024, 10, minibatch_size, true) << softmax();\n *\/\n\n adam a;\n \/** Train and save results *\/\n net.train<adam>(a, train_images, train_labels, validation_images, validation_labels, minibatch_size, epochs,\n on_enumerate_minibatch, on_enumerate_epoch, true);\n net.save_results(mean_and_std, result);\n net.test_network(test_images, test_labels, minibatch_size, 10, result);\n\n return true;\n}\n\nint main(int argc, char* argv[]) {\n size_t expect = 5;\n if (argc < expect) {\n print(\"To few arguments, expted\" + std::to_string(expect) + \"\\n\");\n print(\"Usage: .\/example_mnist batch_size epoch data_path store_results\\n\");\n print(\"Example usage: .\/example_mnist 100 50 ~\/data ~\/results\\n\");\n return -1;\n }\n\n size_t batch_size = atoi(argv[1]); \/\/ use 50 or 100 etc\n size_t epoch = atoi(argv[2]);\n std::string data = argv[3];\n std::string result = argv[4];\n\n \/** Let's go! *\/\n if (train_mnist(batch_size, epoch, data, result)) {\n return 0;\n }\n\n return -1;\n}\n<commit_msg>minor error fixed<commit_after>\/\/\n\/\/ Created by hacht on 4\/25\/17.\n\/\/\n\n#include <iostream>\n#include \"..\/..\/simpleCNN\/simpleCNN.h\"\n\nusing namespace simpleCNN;\n\nusing dropout = Dropout_layer;\nusing conv = Convolutional_layer;\nusing maxpool = Maxpooling_layer;\nusing fully = Connected_layer;\nusing network = Network<Sequential>;\nusing adam = Adam<float_t>;\nusing relu = Activation_layer;\nusing softmax = loss::Softmax;\n\nstatic bool train_mnist(const size_t batch_size, const size_t epoch, const std::string data, const std::string result) {\n \/** Mnist specific parameters *\/\n size_t mnist_image_row = 28;\n size_t mnist_image_col = 28;\n size_t mnist_image_num = 60000;\n size_t mnist_test_num = 10000;\n size_t in_width = 28;\n size_t in_height = 28;\n size_t subset = 1;\n\n \/** Parse mnist *\/\n tensor_t labels({mnist_image_num \/ subset, 1, 1, 1});\n tensor_t images({mnist_image_num \/ subset, 1, in_height, in_width});\n tensor_t test_images({mnist_test_num \/ subset, 1, in_height, in_width});\n tensor_t test_labels({mnist_test_num, 1, 1, 1});\n\n float_t min = -1.0f;\n float_t max = 1.0f;\n images.fill(min);\n\n parse_mnist_images(data + \"\/train-images.idx3-ubyte\", &images, min, max, 0, 0, subset);\n parse_mnist_labels(data + \"\/train-labels.idx1-ubyte\", &labels, subset);\n parse_mnist_images(data + \"\/t10k-images.idx3-ubyte\", &test_images, min, max, 0, 0, subset);\n parse_mnist_labels(data + \"\/t10k-labels.idx1-ubyte\", &test_labels);\n\n \/** Pre-processing *\/\n std::vector<float_t> mean_and_std = zero_mean_unit_variance(images);\n size_t minibatch_size = batch_size;\n size_t epochs = epoch;\n mean_and_std.push_back(float_t(batch_size));\n mean_and_std.push_back(float_t(epoch));\n\n zero_mean_unit_variance(test_images, mean_and_std[0], mean_and_std[1]);\n\n \/** Split data into a training and validation set *\/\n float_t training_validation_split_ratio = 0.75;\n size_t training_set_size = (mnist_image_num \/ subset) * training_validation_split_ratio;\n size_t validation_set_size = std::floor((mnist_image_num \/ subset) * (1 - training_validation_split_ratio) + 0.5);\n\n tensor_t train_images({training_set_size, 1, in_height, in_width});\n tensor_t train_labels({training_set_size, 1, 1, 1});\n tensor_t validation_images({validation_set_size, 1, in_height, in_width});\n tensor_t validation_labels({validation_set_size, 1, 1, 1});\n\n split_training_validation(images, train_images, validation_images, training_validation_split_ratio);\n split_training_validation(labels, train_labels, validation_labels, training_validation_split_ratio);\n\n \/*\n for (size_t sample = 0; sample < 100; sample++) {\n auto img = test_images.subView({sample}, {1, 1, in_height, in_width});\n auto lab = test_labels.subView({sample}, {1, 1, 1, 1});\n\n display_gray_image(img, *lab.host_begin(), mean_and_std.at(0), mean_and_std.at(1));\n } *\/\n\n \/** Call-back for clocking *\/\n auto on_enumerate_minibatch = [&](time_t t) {\n std::cout << (float_t)(clock() - t) \/ CLOCKS_PER_SEC << \"s elapsed.\" << std::endl;\n };\n\n auto on_enumerate_epoch = [&](size_t epoch) { std::cout << epoch + 1 << std::endl; };\n\n \/** Define network architecture and optimizer *\/\n network net;\n float_t dropout_rate = 0.75;\n\n \/* GPU - 21.56s 429MiB *\/\n net << conv(28, 28, 1, minibatch_size, 5, 32, 1, 2, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu)\n << maxpool(28, 28, 32, minibatch_size, 2, 2, 2, 2, core::backend_t::gpu)\n << conv(14, 14, 32, minibatch_size, 5, 64, 1, 2, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu)\n << maxpool(14, 14, 64, minibatch_size, 2, 2, 2, 2, core::backend_t::gpu)\n << fully(7 * 7 * 64, 1024, minibatch_size, true, core::backend_t::gpu, true)\n << relu(core::activation_t::relu, core::backend_t::gpu) << dropout(dropout_rate)\n << fully(1024, 10, minibatch_size, true, core::backend_t::gpu, true) << softmax();\n\n \/* CPU - 902.74s\n net << conv(28, 28, 1, minibatch_size, 5, 32, 1, 2, true) << relu(core::activation_t::relu)\n << maxpool(28, 28, 32, minibatch_size)\n << conv(14, 14, 32, minibatch_size, 5, 64, 1, 2, true) << relu(core::activation_t::relu)\n << maxpool(14, 14, 64, minibatch_size)\n << fully(7 * 7 * 64, 1024, minibatch_size, true) << relu(core::activation_t::relu)\n << dropout(dropout_rate)\n << fully(1024, 10, minibatch_size, true) << softmax();\n *\/\n\n adam a;\n \/** Train and save results *\/\n net.train<adam>(a, train_images, train_labels, validation_images, validation_labels, minibatch_size, epochs,\n on_enumerate_minibatch, on_enumerate_epoch, true);\n net.save_results(mean_and_std, result);\n net.test_network(test_images, test_labels, minibatch_size, 10, result);\n\n return true;\n}\n\nint main(int argc, char* argv[]) {\n size_t expect = 5;\n if (argc < expect) {\n print(\"To few arguments, expted\" + std::to_string(expect) + \"\\n\");\n print(\"Usage: .\/example_mnist batch_size epoch data_path store_results\\n\");\n print(\"Example usage: .\/example_mnist 100 50 ~\/data ~\/results\\n\");\n return -1;\n }\n\n size_t batch_size = atoi(argv[1]); \/\/ use 50 or 100 etc\n size_t epoch = atoi(argv[2]);\n std::string data = argv[3];\n std::string result = argv[4];\n\n \/** Let's go! *\/\n if (train_mnist(batch_size, epoch, data, result)) {\n return 0;\n }\n\n return -1;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix regression (crash) in launching Apps (regular ones, not Extension Apps) caused by r50489.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Remove an include of a header that was removed in r10832.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Use gdk_window_get_origin to determine the origin of the top-level window. gtk_window_get_position returns different values (includes frame or not) depending on the window manager.<commit_after><|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h>\n#include <sys\/time.h>\n#include <assert.h>\nusing namespace std;\n\n\/\/ Quicksort\nvoid quickSort(int a[], int p, int r);\nint partition(int a[], int p, int r);\n\n\/\/ BubbleSort\nvoid bubbleSort(int array[]);\n\n\/\/ InsertionSort\nvoid insertionSort(int arr[], int length);\n\n\/\/ Get unsorted lists of integers\nvoid getList(int array[], int sizeInt, int listNum);\n\n\/\/ Print array contents\nvoid printList(int array[]);\n\n\/\/ Check to see that array is sorted\nbool isSorted(int a[], int size)\n\nint main(int argc, char** argv)\n{\n int sizes[11] = {10,50,100,500,1000,5000, 10000, 50000, 100000, 500000, 1000000}; \/\/ the sizes of lists\n int sizeInt = sizes[6];\n\n \/\/ THIS WON'T WORK:\n int array[sizeInt + 1]; \/\/ creates array to hold names\n\n int listNum = 1; \/\/ 1-1000\n ofstream outFile;\n outFile.open (\"output.csv\");\n outFile << \"n, BubbleSort, QuickSort, InsertionSort, MergeSort\\n\";\n\n timeval t1;\n timeval t2;\n\n while (listNum <= 100)\n {\n getList(array, sizeInt, listNum);\n cout << \"unsorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n\n \/\/ Bubble Sort\n gettimeofday(&t1, NULL);\n bubbleSort(array);\n gettimeofday(&t2, NULL);\n\n cout << \"bubbleSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n\n \/\/cout << \"t1: \" << t1.tv_usec << \", t2: \" << t2.tv_usec << endl;\n\/\/ cout << \"bubbleSort execution time on n = \"<< sizeInt << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << sizeInt << \",\" << t2.tv_usec - t1.tv_usec << \",\";\n getList(array, sizeInt, listNum);\n \/*\n cout << \"unsorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n \/\/ Quick Sort \n gettimeofday(&t1, NULL);\n quickSort(array, 0, sizeInt);\n gettimeofday(&t2, NULL);\n\n \/*\n cout << \"quickSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n\n cout << \"t1: \" << t1 << \", t2: \" << t2 << endl;\n *\/\n\/\/ cout << \"quickSort execution time on n = \"<< sizeInt << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << t2.tv_usec - t1.tv_usec << \",\";\n\n getList(array, sizeInt, listNum);\n \/*\n cout << \"unSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n gettimeofday(&t1, NULL);\n insertionSort(array, sizeInt);\n gettimeofday(&t2, NULL);\n\n \/*\n cout << \"insertionSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n\/\/ cout << \"insertionSort execution time on n = \"<< sizeInt << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << t2.tv_usec - t1.tv_usec << \"\\n\";\n ++listNum;\n }\n outFile.close();\n return 0;\n}\n\nvoid bubbleSort(int array[])\n{\n int swap;\n do{\n swap = 0;\n int n = 1;\n while (array[n] != '\\0')\n {\n if (array[n-1] > array[n])\n {\n swap = 1;\n int temp = array[n-1];\n array[n-1] = array[n];\n array[n] = temp;\n }\n ++n;\n }\n }while(swap == 1);\n}\n\nint partition(int a[], int p, int r) {\n int x = a[r];\n int j = p - 1;\n for (int i = p; i < r; i++) {\n\n if (x <= a[i]) {\n j = j + 1;\n int temp = a[j];\n a[j] = a[i];\n a[i] = temp;\n }\n }\n a[r] = a[j + 1];\n a[j + 1] = x;\n\n return (j + 1);\n}\n\nvoid quickSort(int a[], int p, int r) {\n if (p < r) {\n int q = partition(a, p, r);\n quickSort(a, p, q - 1);\n quickSort(a, q + 1, r);\n }\n}\n\nvoid getList(int array[], int sizeInt, int listNum)\n{\n int n = 0;\n char pathName[50];\n char listChar[50];\n char sizeChar[50];\n\n \/\/ \"cast\" int to chars \n sprintf (sizeChar, \"%d\", sizeInt);\n sprintf (listChar, \"%d\", listNum);\n \n \/\/ Create a pathname to the file where the unordered lists are stored.\n \/\/ sizeChar is how many ints are in the file, listChar is which file (1-100)\n strcpy(pathName, \"..\/..\/lists\/size\");\n strcat(pathName, sizeChar);\n strcat(pathName, \"\/\");\n strcat(pathName, \"list\");\n strcat(pathName, listChar);\n\n ifstream myfile (pathName); \/\/opening the file.\n if(myfile.is_open()) \/\/if the file is open\n {\n while (!myfile.eof()) \/\/while the end of file is NOT reached\n {\n myfile >> array[n];\n n++;\n }\n array[n] = '\\0';\n myfile.close(); \/\/closing the file\n\n }\n else {\n cerr << \"Unable to open file\\n\"; \/\/if the file is not open output\n exit(0);\n }\n}\n\nvoid printList(int array[])\n{\n int n = 0;\n while (array[n] != '\\0')\n {\n cout << array[n] << \", \";\n ++n;\n }\n}\n\nvoid insertionSort(int arr[], int length)\n{\n int i, j, tmp;\n for (i = 1; i < length; i++)\n {\n j = i;\n while (j > 0 && arr[j - 1] > arr[j])\n {\n tmp = arr[j];\n arr[j] = arr[j - 1];\n arr[j - 1] = tmp;\n j--;\n }\n }\n}\n\nbool isSorted(int a[], int size)\n{\n int i;\n for(i = 0; i < (size-1); i++)\n if (a[i] > a[i+1])\n return false;\n return true;\n}\n<commit_msg>added assert stuff to allSort<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <time.h>\n#include <sys\/time.h>\n#include <assert.h>\nusing namespace std;\n\n\/\/ Quicksort\nvoid quickSort(int a[], int p, int r);\nint partition(int a[], int p, int r);\n\n\/\/ BubbleSort\nvoid bubbleSort(int array[]);\n\n\/\/ InsertionSort\nvoid insertionSort(int arr[], int length);\n\n\/\/ Get unsorted lists of integers\nvoid getList(int array[], int listSize, int listNum);\n\n\/\/ Print array contents\nvoid printList(int array[]);\n\n\/\/ Check to see that array is sorted 0..n\nbool isSorted(int a[], int size);\n\n\/\/ Check to see that array is sorted n..0\nbool isSortedR(int a[], int size);\n\nint main(int argc, char** argv)\n{\n int sizes[11] = {10,50,100,500,1000,5000, 10000, 50000, 100000, 500000, 1000000}; \/\/ the sizes of lists\n int listSize = sizes[4];\n\n \/\/ THIS WON'T WORK:\n int array[listSize + 1]; \/\/ creates array to hold names\n\n int listNum = 1; \/\/ 1-1000\n ofstream outFile;\n outFile.open (\"output.csv\");\n outFile << \"n, BubbleSort, QuickSort, InsertionSort, MergeSort\\n\";\n\n timeval t1;\n timeval t2;\n\n while (listNum <= 100)\n {\n getList(array, listSize, listNum);\n cout << \"unsorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n\n \/\/ Bubble Sort\n gettimeofday(&t1, NULL);\n bubbleSort(array);\n gettimeofday(&t2, NULL);\n\n \/\/ make sure list is sorted \n assert(isSorted(array, listSize));\n\n \/\/cout << \"bubbleSorted list:\\n{\";\n \/\/printList(array);\n \/\/cout << \"}\\n\";\n\n \/\/ cout << \"t1: \" << t1.tv_usec << \", t2: \" << t2.tv_usec << endl;\n \/\/ cout << \"bubbleSort execution time on n = \"<< listSize << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << listSize << \",\" << t2.tv_usec - t1.tv_usec << \",\";\n getList(array, listSize, listNum);\n \/*\n cout << \"unsorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n \/\/ Quick Sort \n gettimeofday(&t1, NULL);\n quickSort(array, 0, listSize);\n gettimeofday(&t2, NULL);\n assert(isSortedR(array, listSize));\n\n cout << \"quickSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n\n \n\/\/ cout << \"quickSort execution time on n = \"<< listSize << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << t2.tv_usec - t1.tv_usec << \",\";\n\n getList(array, listSize, listNum);\n \/*\n cout << \"unSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n gettimeofday(&t1, NULL);\n insertionSort(array, listSize);\n gettimeofday(&t2, NULL);\n assert(isSorted(array, listSize));\n\n \/*\n cout << \"insertionSorted list:\\n{\";\n printList(array);\n cout << \"}\\n\";\n *\/\n\n\/\/ cout << \"insertionSort execution time on n = \"<< listSize << \": \" << t2.tv_usec - t1.tv_usec << endl;\n outFile << t2.tv_usec - t1.tv_usec << \"\\n\";\n ++listNum;\n }\n outFile.close();\n return 0;\n}\n\nvoid bubbleSort(int array[])\n{\n int swap;\n do{\n swap = 0;\n int n = 1;\n while (array[n] != '\\0')\n {\n if (array[n-1] > array[n])\n {\n swap = 1;\n int temp = array[n-1];\n array[n-1] = array[n];\n array[n] = temp;\n }\n ++n;\n }\n }while(swap == 1);\n}\n\nint partition(int a[], int p, int r) {\n int x = a[r];\n int j = p - 1;\n for (int i = p; i < r; i++) {\n\n if (x <= a[i]) {\n j = j + 1;\n int temp = a[j];\n a[j] = a[i];\n a[i] = temp;\n }\n }\n a[r] = a[j + 1];\n a[j + 1] = x;\n\n return (j + 1);\n}\n\nvoid quickSort(int a[], int p, int r) {\n if (p < r) {\n int q = partition(a, p, r);\n quickSort(a, p, q - 1);\n quickSort(a, q + 1, r);\n }\n}\n\nvoid getList(int array[], int listSize, int listNum)\n{\n int n = 0;\n char pathName[50];\n char listChar[50];\n char sizeChar[50];\n\n \/\/ \"cast\" int to chars \n sprintf (sizeChar, \"%d\", listSize);\n sprintf (listChar, \"%d\", listNum);\n \n \/\/ Create a pathname to the file where the unordered lists are stored.\n \/\/ sizeChar is how many ints are in the file, listChar is which file (1-100)\n strcpy(pathName, \"..\/..\/lists\/size\");\n strcat(pathName, sizeChar);\n strcat(pathName, \"\/\");\n strcat(pathName, \"list\");\n strcat(pathName, listChar);\n\n ifstream myfile (pathName); \/\/opening the file.\n if(myfile.is_open()) \/\/if the file is open\n {\n while (!myfile.eof()) \/\/while the end of file is NOT reached\n {\n myfile >> array[n];\n n++;\n }\n array[n] = '\\0';\n myfile.close(); \/\/closing the file\n\n }\n else {\n cerr << \"Unable to open file\\n\"; \/\/if the file is not open output\n exit(0);\n }\n}\n\nvoid printList(int array[])\n{\n int n = 0;\n while (array[n] != '\\0')\n {\n cout << array[n] << \", \";\n ++n;\n }\n}\n\nvoid insertionSort(int arr[], int length)\n{\n int i, j, tmp;\n for (i = 1; i < length; i++)\n {\n j = i;\n while (j > 0 && arr[j - 1] > arr[j])\n {\n tmp = arr[j];\n arr[j] = arr[j - 1];\n arr[j - 1] = tmp;\n j--;\n }\n }\n}\n\nbool isSorted(int a[], int size)\n{\n int i;\n for(i = 0; i < (size-1); i++)\n if (a[i] > a[i+1])\n return false;\n return true;\n}\n\nbool isSortedR(int a[], int size)\n{\n int i;\n for(i = 0; i < (size-1); i++)\n if (a[i] < a[i+1])\n return false;\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\r\n#ifndef LOAD_DATA_RESERVERS_H\r\n#define LOAD_DATA_RESERVERS_H\r\n\r\n#include <vector>\r\n#include <fstream>\r\n#include <string>\r\nusing namespace std;\r\n\r\n#include <wiz\/cpp_string.h>\r\n#include <wiz\/load_data_utility.h>\r\n#include <wiz\/queues.h>\r\n\r\nnamespace wiz {\r\n\tnamespace load_data {\r\n\t\tclass InFileReserver\r\n\t\t{\r\n\t\tprivate:\r\n\t\t\tifstream* pInFile;\r\n\t\tpublic:\r\n\t\t\tint Num;\r\n\t\tpublic:\r\n\t\t\texplicit InFileReserver(ifstream& inFile)\r\n\t\t\t{\r\n\t\t\t\tpInFile = &inFile;\r\n\t\t\t\tNum = 1;\r\n\t\t\t}\r\n\t\t\tbool end()const { return pInFile->eof(); }\r\n\t\tpublic:\r\n\t\t\tbool operator() (ArrayQueue<string>& strVec)\r\n\t\t\t{\r\n\t\t\t\treturn Utility::Reserve2(*pInFile, strVec, Num).second > 0;\r\n\t\t\t}\r\n\t\t};\r\n\t\tclass NoneReserver\r\n\t\t{\r\n\t\tprivate:\r\n\t\t\tint count;\r\n\t\tpublic:\r\n\t\t\texplicit NoneReserver() : count(0) { }\r\n\t\t\tbool operator() (ArrayQueue<string>& strVec)\r\n\t\t\t{\r\n\t\t\t\tcount = 1;\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t\tbool end()const { return 1 == count; }\r\n\t\t};\r\n\t}\r\n}\r\n\r\n#endif<commit_msg>Delete LOAD_DATA_RESERVERS.H<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"TMC2130Stepper.h\"\n\n#define REG_COOLCONF 0X6D\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ REG_COOLCONF\n\nvoid TMC2130Stepper::COOLCONF(uint32_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set COOLCONF: \");\n\tSerial.println(value);\n#endif\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, value, 0xFFFFFFFF);\n}\n\nuint8_t TMC2130Stepper::sg_min() {return val_semin;}\n\nvoid TMC2130Stepper::sg_min(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set semin: \");\n\tSerial.println(value);\n#endif\n\tif (value > 15) value = 15;\n\tval_semin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, value, 0xF);\n}\n\nuint8_t TMC2130Stepper::sg_step_width() {return val_seup;}\n\nvoid TMC2130Stepper::sg_step_width(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set seup: \");\n\tSerial.println(value);\n#endif\n\tuint8_t valid[] = {8, 4, 2, 1};\n\n\tif (value < valid[3]) value = valid[3]; \/\/ Make sure we find a match for low values\n\tfor (int i = 0; i<4; i++) {\n\t\tif (value >= valid[i]) {\n\t\t\tvalue = valid[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tval_seup = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 5, 0x60);\n}\n\nuint8_t TMC2130Stepper::sg_max() {return val_semax;}\n\nvoid TMC2130Stepper::sg_max(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set semax: \");\n\tSerial.println(value);\n#endif\n\tif (value > 15) value = 15;\n\tval_semin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 8, 0xF00);\n}\n\nuint8_t TMC2130Stepper::sg_current_decrease() {return val_sedn;}\n\nvoid TMC2130Stepper::sg_current_decrease(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sedn: \");\n\tSerial.println(value);\n#endif\n\tuint8_t valid[] = {32, 8, 2, 1};\n\n\tif (value < valid[3]) value = valid[3]; \/\/ Make sure we find a match for low values\n\tfor (int i = 0; i<4; i++) {\n\t\tif (value >= valid[i]) {\n\t\t\tvalue = valid[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tval_sedn = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 13, 0x6000);\n}\n\nuint8_t TMC2130Stepper::smart_min_current() {return val_seimin;}\n\nvoid TMC2130Stepper::smart_min_current(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set seimin: \");\n\tSerial.println(value);\n#endif\n\tif (value > 1) value = 1;\n\tval_seimin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 15, 0x8000);\n}\n\nint8_t TMC2130Stepper::sg_stall_value() {return val_sgt;}\n\nvoid TMC2130Stepper::sg_stall_value(int8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sgt: \");\n\tSerial.println(value);\n#endif\n\tif (value < -64) value = -64;\n\telse if (value > 63) value = 63;\n\tval_sgt = value;\n\tif (value < 0)\n\t\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)(value & 0x40) << 16, 0x7F0000UL);\n\telse\n\t\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)(value) << 16, 0x7F0000UL);\n}\n\nbool TMC2130Stepper::sg_filter() {return val_sfilt;}\n\nvoid TMC2130Stepper::sg_filter(bool value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sfilt: \");\n\tSerial.println(value);\n#endif\n\tif (value > 1) value = 1;\n\tval_sfilt = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 24, 0b1UL << 24);\n}<commit_msg>Change to switch case structure. Default is no action.<commit_after>#include \"TMC2130Stepper.h\"\n\n#define REG_COOLCONF 0X6D\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ REG_COOLCONF\n\nvoid TMC2130Stepper::COOLCONF(uint32_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set COOLCONF: \");\n\tSerial.println(value);\n#endif\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, value, 0xFFFFFFFF);\n}\n\nuint8_t TMC2130Stepper::sg_min() {return val_semin;}\n\nvoid TMC2130Stepper::sg_min(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set semin: \");\n\tSerial.println(value);\n#endif\n\tif (value > 15) value = 15;\n\tval_semin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, value, 0xF);\n}\n\nuint8_t TMC2130Stepper::sg_step_width() {return val_seup;}\n\nvoid TMC2130Stepper::sg_step_width(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set seup: \");\n\tSerial.println(value);\n#endif\n\tuint32_t v;\n\tswitch(value) {\n\t\tcase 1: v = 0x0; break;\n\t\tcase 2: v = 0x1; break;\n\t\tcase 4: v = 0x2; break;\n\t\tcase 8: v = 0x3; break;\n\t\tdefault: return;\n\t}\n\tval_seup = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, v << 5, 0x60);\n}\n\nuint8_t TMC2130Stepper::sg_max() {return val_semax;}\n\nvoid TMC2130Stepper::sg_max(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set semax: \");\n\tSerial.println(value);\n#endif\n\tif (value > 15) value = 15;\n\tval_semin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 8, 0xF00);\n}\n\nuint8_t TMC2130Stepper::sg_current_decrease() {return val_sedn;}\n\nvoid TMC2130Stepper::sg_current_decrease(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sedn: \");\n\tSerial.println(value);\n#endif\n\n\tuint32_t v;\n\tswitch(value) {\n\t\tcase 32: v = 0b00; break;\n\t\tcase 8: v = 0b01; break;\n\t\tcase 2: v = 0b10; break;\n\t\tcase 1: v = 0b11; break;\n\t\tdefault: return;\n\t}\n\n\tval_sedn = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, v << 13, 0x6000);\n}\n\nuint8_t TMC2130Stepper::smart_min_current() {return val_seimin;}\n\nvoid TMC2130Stepper::smart_min_current(uint8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set seimin: \");\n\tSerial.println(value);\n#endif\n\tif (value > 1) value = 1;\n\tval_seimin = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 15, 0x8000);\n}\n\nint8_t TMC2130Stepper::sg_stall_value() {return val_sgt;}\n\nvoid TMC2130Stepper::sg_stall_value(int8_t value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sgt: \");\n\tSerial.println(value);\n#endif\n\tif (value < -64) value = -64;\n\telse if (value > 63) value = 63;\n\tval_sgt = value;\n\tif (value < 0)\n\t\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)(value & 0x40) << 16, 0x7F0000UL);\n\telse\n\t\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)(value) << 16, 0x7F0000UL);\n}\n\nbool TMC2130Stepper::sg_filter() {return val_sfilt;}\n\nvoid TMC2130Stepper::sg_filter(bool value) {\n#ifdef TMC2130DEBUG\n\tSerial.print(\"Set sfilt: \");\n\tSerial.println(value);\n#endif\n\tif (value > 1) value = 1;\n\tval_sfilt = value;\n\tsend2130(WRITE|REG_COOLCONF, &cur_COOLCONF, (uint32_t)value << 24, 0b1UL << 24);\n}<|endoftext|>"} {"text":"<commit_before><commit_msg>Adds switch to ui tests that enable dialogs in slave process. I'm adding this to make it easier to attach to a failing ui test.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nLibrary: TubeTK\n\nCopyright 2010 Kitware Inc. 28 Corporate Drive,\nClifton Park, NY, 12065, USA.\n\nAll rights reserved.\n\nLicensed under the Apache License, Version 2.0 ( the \"License\" );\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\n=========================================================================*\/\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n\n#include \"itkTubeRidgeExtractor.h\"\n\nint itkTubeRidgeExtractorTest( int argc, char * argv[] )\n {\n if( argc != 3 )\n {\n std::cout\n << \"itkTubeRidgeExtractorTest <inputImage> <outputImage>\"\n << std::endl;\n return EXIT_FAILURE;\n }\n\n typedef itk::Image<float, 3> ImageType;\n\n typedef itk::ImageFileReader< ImageType > ImageReaderType;\n ImageReaderType::Pointer imReader = ImageReaderType::New();\n imReader->SetFileName( argv[1] );\n imReader->Update();\n\n ImageType::Pointer im = imReader->GetOutput();\n\n ImageType::SizeType size = im->GetLargestPossibleRegion().GetSize();\n\n typedef itk::tube::RidgeExtractor<ImageType> RidgeOpType;\n RidgeOpType::Pointer ridgeOp = RidgeOpType::New();\n\n ridgeOp->SetInputImage( im );\n ridgeOp->SetStepX( 0.75 );\n\n double dataMin = ridgeOp->GetDataMin();\n std::cout << \"Data min = \" << dataMin << std::endl;\n double dataMax = ridgeOp->GetDataMax();\n std::cout << \"Data max = \" << dataMax << std::endl;\n double threshT = ridgeOp->GetThreshT();\n std::cout << \"Theta threshold = \" << threshT << std::endl;\n double threshX = ridgeOp->GetThreshX();\n std::cout << \"X threshold = \" << threshX << std::endl;\n double threshRidgeness = ridgeOp->GetThreshRidgeness();\n std::cout << \"Ridgeness threshold = \" << threshRidgeness << std::endl;\n double threshRidgenessStart = ridgeOp->GetThreshRidgenessStart();\n std::cout << \"RidgenessStart threshold = \" << threshRidgenessStart\n << std::endl;\n double threshCurvature = ridgeOp->GetThreshCurvature();\n std::cout << \"Curvature threshold = \" << threshCurvature << std::endl;\n double threshCurvatureStart = ridgeOp->GetThreshCurvatureStart();\n std::cout << \"CurvatureStart threshold = \" << threshCurvatureStart\n << std::endl;\n double threshRoundness = ridgeOp->GetThreshRoundness();\n std::cout << \"Roundness threshold = \" << threshRoundness << std::endl;\n double threshRoundnessStart = ridgeOp->GetThreshRoundnessStart();\n std::cout << \"RoundnessStart threshold = \" << threshRoundnessStart\n << std::endl;\n itk::Index<3> extractBoundMin = ridgeOp->GetExtractBoundMin();\n std::cout << \"Extract bound min = \" << extractBoundMin << std::endl;\n itk::Index<3> extractBoundMax = ridgeOp->GetExtractBoundMax();\n std::cout << \"Extract bound max = \" << extractBoundMax << std::endl;\n\n ridgeOp->SetScale( 1.0 );\n ridgeOp->SetExtent( 3.0 );\n ridgeOp->SetDynamicScale( true );\n\n double recoveryMax = ridgeOp->GetRecoveryMax();\n std::cout << \"Recovery max = \" << recoveryMax << std::endl;\n\n ImageType::Pointer imOut = ImageType::New();\n imOut->SetRegions( im->GetLargestPossibleRegion() );\n imOut->CopyInformation( im );\n imOut->Allocate();\n imOut->FillBuffer( 0 );\n\n double roundness;\n double curvature;\n unsigned int skip = 0;\n itk::ImageRegionIteratorWithIndex<ImageType> itOut( imOut,\n imOut->GetLargestPossibleRegion() );\n ImageType::IndexType indx;\n itk::ContinuousIndex<double, 3> contIndx;\n itOut.GoToBegin();\n ImageType::IndexType startIndx = itOut.GetIndex();\n std::cout << \"Start...\" << std::endl;\n bool firstSearch = false;\n while( !itOut.IsAtEnd() )\n {\n contIndx = itOut.GetIndex();\n switch( ( itOut.GetIndex()[2] - startIndx[2] ) % 5 )\n {\n default:\n case 0:\n std::cout << \"Intensity: \" << contIndx << std::endl;\n itOut.Set( ridgeOp->Intensity( itOut.GetIndex() ) );\n firstSearch = true;\n break;\n case 1:\n std::cout << \"Ridgeness: \" << contIndx << std::endl;\n itOut.Set( ridgeOp->Ridgeness( contIndx, roundness, curvature ) );\n firstSearch = true;\n break;\n case 2:\n std::cout << \"Roundness: \" << contIndx << std::endl;\n ridgeOp->Ridgeness( contIndx, roundness, curvature );\n itOut.Set( roundness );\n firstSearch = true;\n break;\n case 3:\n std::cout << \"Curvature: \" << contIndx << std::endl;\n ridgeOp->Ridgeness( contIndx, roundness, curvature );\n itOut.Set( curvature );\n firstSearch = true;\n break;\n case 4:\n if( firstSearch )\n {\n skip = (int)(contIndx[1]-startIndx[1])%4 * 3;\n firstSearch = false;\n }\n if( ++skip > 12 )\n {\n skip = 0;\n std::cout << \"Local ridge: \" << contIndx << std::endl;\n contIndx[1] = size[1]\/2;\n if( ridgeOp->LocalRidge( contIndx ) )\n {\n std::cout << \" leads to: \" << contIndx << std::endl;\n for( unsigned int i=0; i<3; i++ )\n {\n indx[i] = contIndx[i];\n }\n if( vnl_math_abs( indx[2] - itOut.GetIndex()[2] ) < 4 )\n {\n indx[2] = itOut.GetIndex()[2];\n int v = imOut->GetPixel( indx );\n imOut->SetPixel( indx, v+1 );\n }\n }\n }\n break;\n }\n ++itOut;\n }\n std::cout << \"...end\" << std::endl;\n\n typedef itk::ImageFileWriter<ImageType> ImageWriterType;\n ImageWriterType::Pointer imWriter = ImageWriterType::New();\n imWriter->SetFileName( argv[2] );\n imWriter->SetInput( imOut );\n imWriter->Update();\n\n return EXIT_SUCCESS;\n }\n<commit_msg>COMP: Reduced verbosity of output<commit_after>\/*=========================================================================\n\nLibrary: TubeTK\n\nCopyright 2010 Kitware Inc. 28 Corporate Drive,\nClifton Park, NY, 12065, USA.\n\nAll rights reserved.\n\nLicensed under the Apache License, Version 2.0 ( the \"License\" );\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\n=========================================================================*\/\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n\n#include \"itkTubeRidgeExtractor.h\"\n\nint itkTubeRidgeExtractorTest( int argc, char * argv[] )\n {\n if( argc != 3 )\n {\n std::cout\n << \"itkTubeRidgeExtractorTest <inputImage> <outputImage>\"\n << std::endl;\n return EXIT_FAILURE;\n }\n\n typedef itk::Image<float, 3> ImageType;\n\n typedef itk::ImageFileReader< ImageType > ImageReaderType;\n ImageReaderType::Pointer imReader = ImageReaderType::New();\n imReader->SetFileName( argv[1] );\n imReader->Update();\n\n ImageType::Pointer im = imReader->GetOutput();\n\n ImageType::SizeType size = im->GetLargestPossibleRegion().GetSize();\n\n typedef itk::tube::RidgeExtractor<ImageType> RidgeOpType;\n RidgeOpType::Pointer ridgeOp = RidgeOpType::New();\n\n ridgeOp->SetInputImage( im );\n ridgeOp->SetStepX( 0.75 );\n\n double dataMin = ridgeOp->GetDataMin();\n std::cout << \"Data min = \" << dataMin << std::endl;\n double dataMax = ridgeOp->GetDataMax();\n std::cout << \"Data max = \" << dataMax << std::endl;\n double threshT = ridgeOp->GetThreshT();\n std::cout << \"Theta threshold = \" << threshT << std::endl;\n double threshX = ridgeOp->GetThreshX();\n std::cout << \"X threshold = \" << threshX << std::endl;\n double threshRidgeness = ridgeOp->GetThreshRidgeness();\n std::cout << \"Ridgeness threshold = \" << threshRidgeness << std::endl;\n double threshRidgenessStart = ridgeOp->GetThreshRidgenessStart();\n std::cout << \"RidgenessStart threshold = \" << threshRidgenessStart\n << std::endl;\n double threshCurvature = ridgeOp->GetThreshCurvature();\n std::cout << \"Curvature threshold = \" << threshCurvature << std::endl;\n double threshCurvatureStart = ridgeOp->GetThreshCurvatureStart();\n std::cout << \"CurvatureStart threshold = \" << threshCurvatureStart\n << std::endl;\n double threshRoundness = ridgeOp->GetThreshRoundness();\n std::cout << \"Roundness threshold = \" << threshRoundness << std::endl;\n double threshRoundnessStart = ridgeOp->GetThreshRoundnessStart();\n std::cout << \"RoundnessStart threshold = \" << threshRoundnessStart\n << std::endl;\n itk::Index<3> extractBoundMin = ridgeOp->GetExtractBoundMin();\n std::cout << \"Extract bound min = \" << extractBoundMin << std::endl;\n itk::Index<3> extractBoundMax = ridgeOp->GetExtractBoundMax();\n std::cout << \"Extract bound max = \" << extractBoundMax << std::endl;\n\n ridgeOp->SetScale( 1.0 );\n ridgeOp->SetExtent( 3.0 );\n ridgeOp->SetDynamicScale( true );\n\n double recoveryMax = ridgeOp->GetRecoveryMax();\n std::cout << \"Recovery max = \" << recoveryMax << std::endl;\n\n ImageType::Pointer imOut = ImageType::New();\n imOut->SetRegions( im->GetLargestPossibleRegion() );\n imOut->CopyInformation( im );\n imOut->Allocate();\n imOut->FillBuffer( 0 );\n\n double roundness;\n double curvature;\n unsigned int skip = 0;\n itk::ImageRegionIteratorWithIndex<ImageType> itOut( imOut,\n imOut->GetLargestPossibleRegion() );\n ImageType::IndexType indx;\n itk::ContinuousIndex<double, 3> contIndx;\n itOut.GoToBegin();\n ImageType::IndexType startIndx = itOut.GetIndex();\n std::cout << \"Start...\" << std::endl;\n bool firstSearch = false;\n int prev2 = -1;\n while( !itOut.IsAtEnd() )\n {\n contIndx = itOut.GetIndex();\n switch( ( itOut.GetIndex()[2] - startIndx[2] ) % 5 )\n {\n default:\n case 0:\n if( prev2 != itOut.GetIndex()[2] )\n {\n std::cout << \"Intensity: \" << contIndx << std::endl;\n prev2 = itOut.GetIndex()[2];\n }\n itOut.Set( ridgeOp->Intensity( itOut.GetIndex() ) );\n firstSearch = true;\n break;\n case 1:\n if( prev2 != itOut.GetIndex()[2] )\n {\n std::cout << \"Ridgeness: \" << contIndx << std::endl;\n prev2 = itOut.GetIndex()[2];\n }\n itOut.Set( ridgeOp->Ridgeness( contIndx, roundness, curvature ) );\n firstSearch = true;\n break;\n case 2:\n if( prev2 != itOut.GetIndex()[2] )\n {\n std::cout << \"Roundness: \" << contIndx << std::endl;\n prev2 = itOut.GetIndex()[2];\n }\n ridgeOp->Ridgeness( contIndx, roundness, curvature );\n itOut.Set( roundness );\n firstSearch = true;\n break;\n case 3:\n if( prev2 != itOut.GetIndex()[2] )\n {\n std::cout << \"Curvature: \" << contIndx << std::endl;\n prev2 = itOut.GetIndex()[2];\n }\n ridgeOp->Ridgeness( contIndx, roundness, curvature );\n itOut.Set( curvature );\n firstSearch = true;\n break;\n case 4:\n if( firstSearch )\n {\n skip = (int)(contIndx[1]-startIndx[1])%4 * 3;\n firstSearch = false;\n }\n if( ++skip > 12 )\n {\n skip = 0;\n std::cout << \"Local ridge: \" << contIndx << std::endl;\n contIndx[1] = size[1]\/2;\n if( ridgeOp->LocalRidge( contIndx ) )\n {\n std::cout << \" leads to: \" << contIndx << std::endl;\n for( unsigned int i=0; i<3; i++ )\n {\n indx[i] = contIndx[i];\n }\n if( vnl_math_abs( indx[2] - itOut.GetIndex()[2] ) < 4 )\n {\n indx[2] = itOut.GetIndex()[2];\n int v = imOut->GetPixel( indx );\n imOut->SetPixel( indx, v+1 );\n }\n }\n }\n break;\n }\n ++itOut;\n }\n std::cout << \"...end\" << std::endl;\n\n typedef itk::ImageFileWriter<ImageType> ImageWriterType;\n ImageWriterType::Pointer imWriter = ImageWriterType::New();\n imWriter->SetFileName( argv[2] );\n imWriter->SetInput( imOut );\n imWriter->Update();\n\n return EXIT_SUCCESS;\n }\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <list>\n#include <sstream>\n#include <algorithm>\n#include <boost\/thread\/pthread\/mutex.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/regex.hpp>\n#include <boost\/format.hpp>\n#include \"protocol_module_cinsert.h\"\n\nnamespace l7vs\n{\n\nbool\tis_tcp()\n{\n\treturn\ttrue;\n}\n\nbool\tis_udp()\n{\n\treturn\tfalse;\n}\n\nvoid\treplication_interrupt()\n{\n}\n\nvoid\tinitialize(\n\t\t\t\trs_list_itr_func_type\tinlist_begin,\n\t\t\t\trs_list_itr_func_type\tinlist_end,\n\t\t\t\trs_list_itr_next_func_type\tinlist_next,\n\t\t\t\tboost::function< void( void ) >\tinlist_lock,\n\t\t\t\tboost::function< void( void ) >\tinlist_unlock )\n{\n}\n\nvoid\tfinalize()\n{\n}\n\nbool\tis_use_sorry()\n{\n\treturn\ttrue;\n}\n\ncheck_message_result\tcheck_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result\tcheck_result;\n\treturn\tcheck_result;\n}\n\n\ncheck_message_result\tset_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result check_result;\n\treturn check_result;\n}\n\ncheck_message_result\tadd_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result check_result;\n\treturn check_result;\n}\n\nvoid\thandle_rslist_update()\n{\n}\n\nvoid\tregister_schedule( tcp_schedule_func_type inschedule )\n{\n}\n\nvoid\tregister_schedule( udp_schedule_func_type inschedule )\n{\n}\n\nEVENT_TAG\thandle_session_initialize(\n\t\t\t\tconst boost::thread::id up_thread_id,\n\t\t\t\tconst boost::thread::id down_thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& client_endpoint_tcp,\n\t\t\t\tconst boost::asio::ip::udp::endpoint& client_endpoint_udp )\n{\n\treturn\tSTOP;\n}\nEVENT_TAG\thandle_session_finalize(\n\t\t\t\tconst boost::thread::id up_thread_id,\n\t\t\t\tconst boost::thread::id down_thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_accept( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_client_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::udp::endpoint& rs_endpoint,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_connect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_connection_fail(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_connect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_connection_fail(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& rs_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::udp::endpoint& rs_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& sorry_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_response_send_inform( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_client_connection_check(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_client_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::udp::endpoint& cl_endpoint,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_client_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_client_disconnect( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorry_enable( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorry_disable( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_disconnect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_sorryserver_disconnect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nEVENT_TAG\thandle_realserver_close(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::udp::endpoint & rs_endpoint )\n{\n\n\treturn\tSTOP;\n}\n\n}\n<commit_msg><commit_after>#include <vector>\n#include <list>\n#include <sstream>\n#include <algorithm>\n#include <boost\/thread\/pthread\/mutex.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/regex.hpp>\n#include <boost\/format.hpp>\n#include \"protocol_module_cinsert.h\"\n\nnamespace l7vs\n{\n\nprotocol_module_cinsert::protocol_module_cinsert() : http_protocol_module_base( \"cinsert\" )\n{\n}\n\nprotocol_module_cinsert::~protocol_module_cinsert()\n{\n}\n\nbool\tprotocol_module_cinsert::is_tcp()\n{\n\treturn\ttrue;\n}\n\nbool\tprotocol_module_cinsert::is_udp()\n{\n\treturn\tfalse;\n}\n\nvoid\tprotocol_module_cinsert::replication_interrupt()\n{\n\t\/\/ NOP\n\treturn;\n}\n\nvoid\tprotocol_module_cinsert::initialize(\n\t\t\t\trs_list_itr_func_type\t\t\tinlist_begin,\n\t\t\t\trs_list_itr_func_type\t\t\tinlist_end,\n\t\t\t\trs_list_itr_next_func_type\t\tinlist_next,\n\t\t\t\tboost::function< void( void ) >\tinlist_lock,\n\t\t\t\tboost::function< void( void ) >\tinlist_unlock )\n{\n\trs_list_begin\t= inlist_begin;\n\trs_list_end\t\t= inlist_end;\n\trs_list_next\t= inlist_next;\n\trs_list_lock\t= inlist_lock;\n\trs_list_unlock\t= inlist_unlock;\n}\n\nvoid\tprotocol_module_cinsert::finalize()\n{\n\tgetloglevel.clear();\n\tputLogFatal.clear();\n\tputLogError.clear();\n\tputLogWarn.clear();\n\tputLogInfo.clear();\n\tputLogDebug.clear();\n\n\trs_list_begin.clear();\n\trs_list_end.clear();\n\trs_list_next.clear();\n\trs_list_lock.clear();\n\trs_list_unlock.clear();\n\n\treplication_pay_memory.clear();\n\treplication_area_lock.clear();\n\treplication_area_unlock.clear();\n\n\tschedule_tcp.clear();\n\tschedule_udp.clear();\n\n\tcookie_expire\t= 0;\n\tforwarded_for\t= 0;\n\treschedule\t\t= 0;\n\tcookie_name.assign( '\\0' );\n\tsorry_uri.assign( '\\0' );\n}\n\nbool\tprotocol_module_cinsert::is_use_sorry()\n{\n\treturn\ttrue;\n}\n\nprotocol_module_cinsert::check_message_result\nprotocol_module_cinsert::check_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result\tcheck_result;\n\treturn\tcheck_result;\n}\n\n\nprotocol_module_cinsert::check_message_result\nprotocol_module_cinsert::set_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result check_result;\n\treturn check_result;\n}\n\nprotocol_module_cinsert::check_message_result\nprotocol_module_cinsert::add_parameter( const std::vector< std::string >& args )\n{\n\tcheck_message_result check_result;\n\treturn check_result;\n}\n\nvoid\tprotocol_module_cinsert::handle_rslist_update()\n{\n\t\/\/ NOP\n\treturn;\n}\n\nvoid\tprotocol_module_cinsert::register_schedule( tcp_schedule_func_type inschedule )\n{\n\tschedule_tcp = inschedule;\n}\n\nvoid\tprotocol_module_cinsert::register_schedule( udp_schedule_func_type inschedule )\n{\n\t\/\/ NOP\n\treturn;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_session_initialize(\n\t\t\t\tconst boost::thread::id up_thread_id,\n\t\t\t\tconst boost::thread::id down_thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& client_endpoint_tcp,\n\t\t\t\tconst boost::asio::ip::udp::endpoint& client_endpoint_udp )\n{\n\n\tsession_thread_data_cinsert*\tup_thread_data\t\t= NULL;\n\tsession_thread_data_cinsert*\tdown_thread_data\t= NULL;\n\trecive_data*\t\t\t\t\tclient_recv_data\t= NULL;\n\tchar*\t\t\t\t\t\t\tbuffer\t\t\t\t= NULL;\n\n\ttry\n\t{\n\t\tup_thread_data\t= new session_thread_data_cinsert;\n\n\t\tup_thread_data->thread_id\t\t\t\t= up_thread_id;\n\t\tup_thread_data->thread_division\t\t\t= THREAD_DIVISION_UP_STREAM;\n\t\tup_thread_data->pair_thread_id\t\t\t= down_thread_id;\n\t\tup_thread_data->end_flag\t\t\t\t= END_FLAG_OFF;\n\t\tup_thread_data->accept_end_flag\t\t\t= ACCEPT_END_FLAG_OFF;\n\t\tup_thread_data->sorry_flag\t\t\t\t= SORRY_FLAG_OFF;\n\t\tup_thread_data->sorryserver_switch_flag\t= SORRYSERVER_SWITCH_FLAG_OFF;\n\t\tup_thread_data->realserver_switch_flag\t= REALSERVER_SWITCH_FLAG_OFF;\n\t\tup_thread_data->client_endpoint_tcp\t\t= client_endpoint_tcp;\n\n\t\tclient_recv_data = new recive_data;\n\t\tclient_recv_data->recive_buffer_max_size\t= MAX_BUFFER_SIZE;\n\t\tclient_recv_data->recive_buffer_rest_size\t= MAX_BUFFER_SIZE;\n\n\t\tbuffer = (char*)malloc( MAX_BUFFER_SIZE );\n\n\t\tclient_recv_data->recive_buffer\t\t= buffer;\n\t\tclient_recv_data->recive_buffer_1\t= buffer;\n\n\t\tbuffer = (char*)malloc( MAX_BUFFER_SIZE );\n\n\t\tclient_recv_data->recive_buffer_2\t= buffer;\n\n\t\tup_thread_data->recive_data_map[ client_endpoint_tcp ] = client_recv_data;\n\n\t\tdown_thread_data\t= new session_thread_data_cinsert;\n\n\t\tdown_thread_data->thread_id\t\t\t\t\t= down_thread_id;\n\t\tdown_thread_data->thread_division\t\t\t= THREAD_DIVISION_DOWN_STREAM;\n\t\tdown_thread_data->pair_thread_id\t\t\t= up_thread_id;\n\t\tdown_thread_data->end_flag\t\t\t\t\t= END_FLAG_OFF;\n\t\tdown_thread_data->accept_end_flag\t\t\t= ACCEPT_END_FLAG_OFF;\n\t\tdown_thread_data->sorry_flag\t\t\t\t= SORRY_FLAG_OFF;\n\t\tdown_thread_data->sorryserver_switch_flag\t= SORRYSERVER_SWITCH_FLAG_OFF;\n\t\tdown_thread_data->realserver_switch_flag\t= REALSERVER_SWITCH_FLAG_OFF;\n\t\tdown_thread_data->client_endpoint_tcp\t\t= client_endpoint_tcp;\n\n\t\t{\n\t\t\tboost::mutex::scoped_lock\tlock( session_thread_data_map_mutex );\n\t\t\tsession_thread_data_map[ up_thread_id ]\t\t= up_thread_data;\n\t\t\tsession_thread_data_map[ down_thread_id ]\t= down_thread_data;\n\t\t}\n\n\t} catch (const std::exception& ex)\n\t{\n\t\treturn FINALIZE;\n\t} catch (...)\n\t{\n\t\treturn FINALIZE;\n\t}\n\n\treturn\tACCEPT;\n\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_session_finalize(\n\t\t\t\tconst boost::thread::id up_thread_id,\n\t\t\t\tconst boost::thread::id down_thread_id )\n{\n\tsession_thread_data_cinsert*\tthread_data = NULL;\n\tsession_thread_data_map_itr\t\t\tthread_data_itr;\n\n\ttry\n\t{\n\t\t{\n\t\t\tboost::mutex::scoped_lock\tlock( session_thread_data_map_mutex );\n\t\t\tthread_data_itr = session_thread_data_map.find( up_thread_id );\n\t\t\tif( thread_data_itr != session_thread_data_map.end() )\n\t\t\t{\n\t\t\t\tthread_data = thread_data_itr->second;\n\t\t\t\tsession_thread_data_map.erase( up_thread_id );\n\t\t\t}\n\t\t}\n\n\t\tif( thread_data != NULL )\n\t\t{\n\t\t}\n\n\t} catch (const std::exception& ex)\n\t{\n\t} catch (...)\n\t{\n\t}\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_accept( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_client_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::udp::endpoint& rs_endpoint,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\t\/\/ NOP\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_connect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_connection_fail(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_connect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_connection_fail(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& rs_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::udp::endpoint& rs_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_recv(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint& sorry_endpoint,\n\t\t\t\tconst boost::array< char, MAX_BUFFER_SIZE >& recvbuffer,\n\t\t\t\tconst size_t recvlen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_response_send_inform( const boost::thread::id thread_id )\n{\n\t\/\/ NOP\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_client_connection_check(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_client_select(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tboost::asio::ip::udp::endpoint& cl_endpoint,\n\t\t\t\tboost::array< char, MAX_BUFFER_SIZE >& sendbuffer,\n\t\t\t\tsize_t& datalen )\n{\n\t\/\/ NOP\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_client_send( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_client_disconnect( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorry_enable( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorry_disable( const boost::thread::id thread_id )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_disconnect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & rs_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_sorryserver_disconnect(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::tcp::endpoint & sorry_endpoint )\n{\n\treturn\tSTOP;\n}\n\nprotocol_module_cinsert::EVENT_TAG\nprotocol_module_cinsert::handle_realserver_close(\n\t\t\t\tconst boost::thread::id thread_id,\n\t\t\t\tconst boost::asio::ip::udp::endpoint & rs_endpoint )\n{\n\t\/\/ NOP\n\treturn\tSTOP;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\ntypedef tuple<int, ll> path;\n\nint N;\nvector<path> V[100010];\nint Q, K;\npath parent[100010];\nll memo[100010];\nint x[100010];\nint y[100010];\n\nll dist(int n) {\n if (memo[n] != -1) return memo[n];\n if (n == K) return memo[n] = 0;\n int p = get<0>(parent[n]);\n return memo[n] = dist(p) + get<1>(parent[n]);\n}\n\nint main () {\n cin >> N;\n for (auto i = 0; i < N-1; ++i) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n V[a].push_back(path(b, c));\n V[b].push_back(path(a, c));\n }\n cin >> Q >> K;\n K--;\n for (auto i = 0; i < Q; ++i) {\n cin >> x[i] >> y[i];\n x[i]--;\n y[i]--;\n }\n stack<int> S;\n S.push(K);\n parent[K] = path(-1, 0);\n while (!S.empty()) {\n int now = S.top();\n S.pop();\n for (auto x : V[now]) {\n int next = get<0>(x);\n ll d = get<1>(x);\n if (next != get<0>(parent[now])) {\n parent[next] = path(now, d);\n S.push(next);\n }\n }\n }\n for (auto i = 0; i < Q; ++i) {\n cout << dist(x[i]) + dist(y[i]) << endl;\n }\n}\n<commit_msg>submit D.cpp to 'D - Transit Tree Path' (abc070) [C++14 (GCC 5.4.1)]<commit_after>#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple> \/\/ get<n>(xxx)\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set> \/\/ S.insert(M);\n\/\/ if (S.find(key) != S.end()) { }\n\/\/ for (auto it=S.begin(); it != S.end(); it++) { }\n\/\/ auto it = S.lower_bound(M);\n#include <random> \/\/ random_device rd; mt19937 mt(rd());\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib> \/\/ atoi(xxx)\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\/\/ insert #if<tab> by my emacs. #if DEBUG == 1 ... #end\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\ntypedef tuple<int, ll> path;\n\nint N;\nvector<path> V[100010];\nint Q, K;\npath parent[100010];\nll memo[100010];\nint x[100010];\nint y[100010];\n\nll dist(int n) {\n if (memo[n] != -1) return memo[n];\n if (n == K) return memo[n] = 0;\n int p = get<0>(parent[n]);\n return memo[n] = dist(p) + get<1>(parent[n]);\n}\n\nint main () {\n cin >> N;\n for (auto i = 0; i < N-1; ++i) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n V[a].push_back(path(b, c));\n V[b].push_back(path(a, c));\n }\n cin >> Q >> K;\n K--;\n for (auto i = 0; i < Q; ++i) {\n cin >> x[i] >> y[i];\n x[i]--;\n y[i]--;\n }\n fill(memo, memo+100010, -1);\n stack<int> S;\n S.push(K);\n parent[K] = path(-1, 0);\n while (!S.empty()) {\n int now = S.top();\n S.pop();\n for (auto x : V[now]) {\n int next = get<0>(x);\n ll d = get<1>(x);\n if (next != get<0>(parent[now])) {\n parent[next] = path(now, d);\n S.push(next);\n }\n }\n }\n for (auto i = 0; i < Q; ++i) {\n cout << dist(x[i]) + dist(y[i]) << endl;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * File : B.cpp\n * Author : Kazune Takahashi\n * Created : 11\/20\/2018, 11:10:45 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint main()\n{\n string A, B;\n cin >> A >> B;\n if (A == B)\n {\n cout << \"EQUAL\" << endl;\n return 0;\n }\n if (A.size() > B.size())\n {\n cout << \"GREATER\" << endl;\n }\n else if (A.size() < B.size())\n {\n cout << \"LESS\" << endl;\n }\n else\n {\n for (auto i = 0; i < (int)A.size(); i++)\n {\n if (A[i] > B[i])\n {\n cout << \"GREATER\" << endl;\n return 0;\n }\n else if (A[i] < B[i])\n {\n cout << \"LESS\" << endl;\n return 0;\n }\n }\n }\n return 1;\n}<commit_msg>submit B.cpp to 'B - Comparison' (abc059) [C++14 (GCC 5.4.1)]<commit_after>\/**\n * File : B.cpp\n * Author : Kazune Takahashi\n * Created : 11\/20\/2018, 11:10:45 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\n#define DEBUG 0 \/\/ change 0 -> 1 if we need debug.\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint main()\n{\n string A, B;\n cin >> A >> B;\n if (A == B)\n {\n cout << \"EQUAL\" << endl;\n return 0;\n }\n if (A.size() > B.size())\n {\n cout << \"GREATER\" << endl;\n return 0;\n }\n else if (A.size() < B.size())\n {\n cout << \"LESS\" << endl;\n return 0;\n }\n else\n {\n for (auto i = 0; i < (int)A.size(); i++)\n {\n if (A[i] > B[i])\n {\n cout << \"GREATER\" << endl;\n return 0;\n }\n else if (A[i] < B[i])\n {\n cout << \"LESS\" << endl;\n return 0;\n }\n }\n }\n return 1;\n}<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\n\/**\n * File : D.cpp\n * Author : Kazune Takahashi\n * Created : 4\/13\/2019, 9:08:24 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, K;\nstring S;\nvector<int> V;\n\nint main()\n{\n cin >> N >> K >> S;\n bool one = true;\n int t = 0;\n for (auto i = 0; i < N; i++)\n {\n if (S[i] == '0' && one)\n {\n V.push_back(t);\n one = false;\n t = 1;\n }\n else if (S[i] == '1' && one)\n {\n t++;\n }\n else if (S[i] == '0' && !one)\n {\n t++;\n }\n else\n {\n V.push_back(t);\n one = true;\n t = 1;\n }\n }\n V.push_back(t);\n if (!one)\n {\n V.push_back(0);\n }\n#if DEBUG == 1\n for (auto x : V)\n {\n cerr << x << \" \";\n }\n cerr << endl;\n#endif\n vector<int> imos(V.size() + 1, 0);\n for (auto i = 0; i < N; i++)\n {\n imos[i + 1] = imos[i] + V[i];\n }\n#if DEBUG == 1\n for (auto x : imos)\n {\n cerr << x << \" \";\n }\n cerr << endl;\n#endif\n int seg = min(2 * K + 1, (int)V.size());\n int ans = 0;\n for (auto i = 0; i + seg <= (int)V.size(); i++)\n {\n ans = max(ans, imos[i + seg] - imos[i]);\n }\n cout << ans << endl;\n}<commit_msg>submit D.cpp to 'D - Handstand' (abc124) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\n\/**\n * File : D.cpp\n * Author : Kazune Takahashi\n * Created : 4\/13\/2019, 9:08:24 PM\n * Powered by Visual Studio Code\n *\/\n\n#include <iostream>\n#include <iomanip> \/\/ << fixed << setprecision(xxx)\n#include <algorithm> \/\/ do { } while ( next_permutation(A, A+xxx) ) ;\n#include <vector>\n#include <string> \/\/ to_string(nnn) \/\/ substr(m, n) \/\/ stoi(nnn)\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map> \/\/ if (M.find(key) != M.end()) { }\n#include <set>\n#include <functional>\n#include <random> \/\/ auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(10101010));\n#include <chrono> \/\/ std::chrono::system_clock::time_point start_time, end_time;\n\/\/ start = std::chrono::system_clock::now();\n\/\/ double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n\ntypedef long long ll;\n\n\/\/ const int dx[4] = {1, 0, -1, 0};\n\/\/ const int dy[4] = {0, 1, 0, -1};\n\n\/\/ const int C = 1e6+10;\n\/\/ const ll M = 1000000007;\n\nint N, K;\nstring S;\nvector<int> V;\n\nint main()\n{\n cin >> N >> K >> S;\n bool one = true;\n int t = 0;\n for (auto i = 0; i < N; i++)\n {\n if (S[i] == '0' && one)\n {\n V.push_back(t);\n one = false;\n t = 1;\n }\n else if (S[i] == '1' && one)\n {\n t++;\n }\n else if (S[i] == '0' && !one)\n {\n t++;\n }\n else\n {\n V.push_back(t);\n one = true;\n t = 1;\n }\n }\n V.push_back(t);\n if (!one)\n {\n V.push_back(0);\n }\n#if DEBUG == 1\n for (auto x : V)\n {\n cerr << x << \" \";\n }\n cerr << endl;\n#endif\n vector<int> imos(V.size() + 1, 0);\n for (auto i = 0; i < N; i++)\n {\n imos[i + 1] = imos[i] + V[i];\n }\n#if DEBUG == 1\n for (auto x : imos)\n {\n cerr << x << \" \";\n }\n cerr << endl;\n#endif\n int seg = min(2 * K + 1, (int)V.size());\n int ans = 0;\n for (auto i = 0; i + seg <= (int)V.size(); i++)\n {\n if (i % 2 == 0)\n {\n ans = max(ans, imos[i + seg] - imos[i]);\n }\n }\n cout << ans << endl;\n}<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : F.cpp\n * Author : Kazune Takahashi\n * Created : 5\/18\/2020, 10:33:43 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(const Mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(const Mint &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(const Mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(const Mint &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n bool operator<(const Mint &a) const { return x < a.x; }\n bool operator<=(const Mint &a) const { return x <= a.x; }\n bool operator>(const Mint &a) const { return x > a.x; }\n bool operator>=(const Mint &a) const { return x >= a.x; }\n bool operator==(const Mint &a) const { return x == a.x; }\n bool operator!=(const Mint &a) const { return !(*this == a); }\n const Mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2LL; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1LL; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n int ans{0};\n while (x != 0)\n {\n ans += x & 1;\n x >>= 1;\n }\n return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n ll N, K;\n cin >> N >> K;\n ll X{static_cast<ll>(sqrt(N)) + 10};\n vector<vector<mint>> DP(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> DP2(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> SUM(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> SUM2(K + 1, vector<mint>(X + 1, 0));\n vector<mint> cnt(X + 1);\n for (auto j = 1; j <= X; ++j)\n {\n cnt[j] = max(N \/ j, X) - max(N \/ (j + 1), X);\n }\n DP[0][1] = 1;\n for (auto j = 1; j <= X; ++j)\n {\n SUM[0][j] = 1;\n }\n for (auto i = 1; i <= K; ++i)\n {\n for (auto j = 1; j <= X; ++j)\n {\n DP[i][j] = SUM[i - 1][min(X, N \/ j)] + SUM2[i - 1][X - 1] - SUM2[i - 1][j - 1];\n DP2[i][j] = cnt[j] * SUM[i - 1][j];\n SUM[i][j] = SUM[i][j - 1] + DP[i][j];\n SUM2[i][j] = SUM2[i][j - 1] + DP2[i][j];\n }\n }\n cout << SUM[K][X] + SUM2[K][X] << endl;\n}\n<commit_msg>submit F.cpp to 'F - Small Products' (abc132) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File : F.cpp\n * Author : Kazune Takahashi\n * Created : 5\/18\/2020, 10:33:43 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(const Mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(const Mint &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(const Mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(const Mint &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(const Mint &a) const { return Mint(*this) += a; }\n Mint operator-(const Mint &a) const { return Mint(*this) -= a; }\n Mint operator*(const Mint &a) const { return Mint(*this) *= a; }\n Mint operator\/(const Mint &a) const { return Mint(*this) \/= a; }\n bool operator<(const Mint &a) const { return x < a.x; }\n bool operator<=(const Mint &a) const { return x <= a.x; }\n bool operator>(const Mint &a) const { return x > a.x; }\n bool operator>=(const Mint &a) const { return x >= a.x; }\n bool operator==(const Mint &a) const { return x == a.x; }\n bool operator!=(const Mint &a) const { return !(*this == a); }\n const Mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, const Mint<MOD> &rhs)\n{\n return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, const Mint<MOD> &rhs)\n{\n return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, const Mint<MOD> &rhs)\n{\n return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, const Mint<MOD> &rhs)\n{\n return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, const Mint<MOD> &a)\n{\n return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2LL; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1LL; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n int ans{0};\n while (x != 0)\n {\n ans += x & 1;\n x >>= 1;\n }\n return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1000000000000000LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n ll N, K;\n cin >> N >> K;\n ll X{static_cast<ll>(sqrt(N)) + 10};\n vector<vector<mint>> DP(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> DP2(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> SUM(K + 1, vector<mint>(X + 1, 0));\n vector<vector<mint>> SUM2(K + 1, vector<mint>(X + 1, 0));\n vector<mint> cnt(X + 1);\n for (auto j = 1; j <= X; ++j)\n {\n cnt[j] = max(N \/ j, X) - max(N \/ (j + 1), X);\n }\n DP[0][1] = 1;\n for (auto j = 1; j <= X; ++j)\n {\n SUM[0][j] = 1;\n }\n for (auto i = 1; i <= K; ++i)\n {\n for (auto j = 1; j <= X; ++j)\n {\n DP[i][j] = SUM[i - 1][min(X, N \/ j)] + SUM2[i - 1][X] - SUM2[i - 1][j - 1];\n DP2[i][j] = cnt[j] * SUM[i - 1][j];\n SUM[i][j] = SUM[i][j - 1] + DP[i][j];\n SUM2[i][j] = SUM2[i][j - 1] + DP2[i][j];\n }\n }\n cout << SUM[K][X] + SUM2[K][X] << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 8\/12\/2019, 7:02:46 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\nvector<int> count(string const &S)\n{\n vector<int> cnt(3, 0);\n for (auto x : S)\n {\n cnt[x - 'A']++;\n }\n return cnt;\n}\n\nstring reduce(string const &S)\n{\n stringstream res{};\n char c{'x'};\n for (auto x : S)\n {\n if (x == c)\n {\n continue;\n }\n else\n {\n res << x;\n c = x;\n }\n }\n return res.str();\n}\n\nmap<char, char> make_map(string const &S)\n{\n vector<int> cnt = count(S);\n vector<tuple<int, char>> V;\n for (auto i = 0; i < 3; i++)\n {\n V.emplace_back(cnt[i], 'A' + i);\n }\n sort(V.begin(), V.end());\n map<char, char> res;\n for (auto i = 0; i < 3; i++)\n {\n res[get<1>(V[i])] = 'A' + i;\n }\n return res;\n}\n\nmap<char, char> make_rev(map<char, char> const &M)\n{\n map<char, char> res;\n for (auto x : M)\n {\n res[x.second] = x.first;\n }\n return res;\n}\n\nstring convert(string const &S, map<char, char> const &M)\n{\n stringstream SS{};\n for (auto x : S)\n {\n SS << M.at(x);\n }\n return SS.str();\n}\n\nvector<string> split(string const &S, char c)\n{\n vector<string> res;\n stringstream SS{};\n for (auto x : S)\n {\n if (x == c)\n {\n res.push_back(SS.str());\n SS.str({});\n }\n else\n {\n SS << x;\n }\n }\n res.push_back(SS.str());\n return res;\n}\n\nstring make_ans(string const &S)\n{\n vector<int> cnt = count(S);\n assert(cnt[0] <= cnt[1] && cnt[1] == cnt[2]);\n vector<string> V = split(S, 'A');\n#if DEBUG == 1\n for (auto i = 0u; i < V.size(); i++)\n {\n cerr << \"V[\" << i << \"] = \" << V[i] << endl;\n }\n#endif\n vector<int> now(3, 0);\n vector<vector<bool>> used(V.size());\n for (auto i = 0u; i < V.size(); i++)\n {\n used[i] = vector<bool>(V[i].size(), false);\n }\n \/\/ 1st step\n for (auto i = 0u; i < V.size(); i++)\n {\n if (V[i].size() % 2 == 1)\n {\n used[i][0] = true;\n now[V[i][0] - 'A']++;\n }\n }\n#if DEBUG == 1\n for (auto i = 0; i < 3; i++)\n {\n cerr << \"now[\" << i << \"] = \" << now[i] << endl;\n }\n#endif\n assert(now[0] == 0 && now[1] == now[2]);\n \/\/ 2nd step\n for (auto i = 1u; i < V.size() - 1; i++)\n {\n if (V[i].size() % 2 == 0)\n {\n used[i][0] = used[i][1] = true;\n now[V[i][0] - 'A']++;\n now[V[i][1] - 'A']++;\n }\n }\n assert(now[0] == 0 && now[1] == now[2]);\n \/\/ 3rd step\n if (now[1] < cnt[0])\n {\n for (auto i = 0u; i < V.size(); i++)\n {\n int num = V[i].size() - 1;\n while (num >= 1 && !used[i][num] && !used[i][num - 1])\n {\n used[i][num] = used[i][num - 1] = true;\n now[V[i][num] - 'A']++;\n now[V[i][num - 1] - 'A']++;\n num -= 2;\n if (now[1] == cnt[0])\n {\n break;\n }\n }\n if (now[1] == cnt[0])\n {\n break;\n }\n }\n }\n assert(now[0] == 0 && now[1] == now[2] && cnt[0] == now[1]);\n \/\/ make ans\n stringstream SS{};\n for (auto i = 0u; i < V.size(); i++)\n {\n for (auto j = 0u; j < V[i].size(); j++)\n {\n if (used[i][j])\n {\n SS << V[i][j];\n }\n }\n if (i < V.size() - 1)\n {\n SS << 'A';\n }\n }\n return SS.str();\n}\n\nstring erase_C(string const &S)\n{\n vector<int> cnt = count(S);\n stringstream SS{};\n for (auto i = 0u; i < S.size(); i++)\n {\n if (cnt[2] > cnt[1])\n {\n if (S[i] == 'C')\n {\n if (i - 1 >= 0 && i + 1 < S.size())\n {\n if ((S[i - 1] == 'A' && S[i + 1] == 'B') || (S[i - 1] == 'B' && S[i + 1] == 'A'))\n {\n cnt[2]--;\n continue;\n }\n }\n else\n {\n cnt[2]--;\n continue;\n }\n }\n }\n SS << S[i];\n#if DEBUG == 1\n cerr << \"SS.str() = \" << SS.str() << endl;\n#endif\n }\n return SS.str();\n}\n\nstring erase_AC(string const &S)\n{\n vector<int> cnt = count(S);\n assert(cnt[0] <= cnt[1] && cnt[1] < cnt[2]);\n stringstream res{};\n for (auto i = 0u; i < S.size(); i++)\n {\n if (cnt[1] < cnt[2] && i < S.size() - 1 && S[i] == 'A' && S[i + 1] == 'C')\n {\n ++i;\n cnt[0]--;\n cnt[2]--;\n }\n else\n {\n res << S[i];\n }\n }\n return res.str();\n}\n\nint main()\n{\n string S;\n cin >> S;\n S = reduce(S);\n map<char, char> M, R;\n M = make_map(S);\n R = make_rev(M);\n S = convert(S, M);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n vector<int> cnt = count(S);\n if (cnt[1] < cnt[2])\n {\n S = erase_C(S);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n cnt = count(S);\n if (cnt[1] < cnt[2])\n {\n S = erase_AC(S);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n }\n }\n string ans{make_ans(S)};\n#if DEBUG == 1\n cerr << \"ans = \" << ans << endl;\n#endif\n ans = convert(ans, R);\n cout << ans << endl;\n}<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 8\/12\/2019, 7:02:46 PM\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\nvector<int> count(string const &S)\n{\n vector<int> cnt(3, 0);\n for (auto x : S)\n {\n cnt[x - 'A']++;\n }\n return cnt;\n}\n\nstring reduce(string const &S)\n{\n stringstream res{};\n char c{'x'};\n for (auto x : S)\n {\n if (x == c)\n {\n continue;\n }\n else\n {\n res << x;\n c = x;\n }\n }\n return res.str();\n}\n\nmap<char, char> make_map(string const &S)\n{\n vector<int> cnt = count(S);\n vector<tuple<int, char>> V;\n for (auto i = 0; i < 3; i++)\n {\n V.emplace_back(cnt[i], 'A' + i);\n }\n sort(V.begin(), V.end());\n map<char, char> res;\n for (auto i = 0; i < 3; i++)\n {\n res[get<1>(V[i])] = 'A' + i;\n }\n return res;\n}\n\nmap<char, char> make_rev(map<char, char> const &M)\n{\n map<char, char> res;\n for (auto x : M)\n {\n res[x.second] = x.first;\n }\n return res;\n}\n\nstring convert(string const &S, map<char, char> const &M)\n{\n stringstream SS{};\n for (auto x : S)\n {\n SS << M.at(x);\n }\n return SS.str();\n}\n\nvector<string> split(string const &S, char c)\n{\n vector<string> res;\n stringstream SS{};\n for (auto x : S)\n {\n if (x == c)\n {\n res.push_back(SS.str());\n SS.str({});\n }\n else\n {\n SS << x;\n }\n }\n res.push_back(SS.str());\n return res;\n}\n\nstring make_ans(string const &S)\n{\n vector<int> cnt = count(S);\n assert(cnt[0] <= cnt[1] && cnt[1] == cnt[2]);\n vector<string> V = split(S, 'A');\n#if DEBUG == 1\n for (auto i = 0u; i < V.size(); i++)\n {\n cerr << \"V[\" << i << \"] = \" << V[i] << endl;\n }\n#endif\n vector<int> now(3, 0);\n vector<vector<bool>> used(V.size());\n for (auto i = 0u; i < V.size(); i++)\n {\n used[i] = vector<bool>(V[i].size(), false);\n }\n \/\/ 1st step\n for (auto i = 0u; i < V.size(); i++)\n {\n if (V[i].size() % 2 == 1)\n {\n used[i][0] = true;\n now[V[i][0] - 'A']++;\n }\n }\n#if DEBUG == 1\n for (auto i = 0; i < 3; i++)\n {\n cerr << \"now[\" << i << \"] = \" << now[i] << endl;\n }\n#endif\n assert(now[0] == 0 && now[1] == now[2]);\n \/\/ 2nd step\n for (auto i = 1u; i < V.size() - 1; i++)\n {\n if (V[i].size() % 2 == 0)\n {\n used[i][0] = used[i][1] = true;\n now[V[i][0] - 'A']++;\n now[V[i][1] - 'A']++;\n }\n }\n assert(now[0] == 0 && now[1] == now[2]);\n \/\/ 3rd step\n if (now[1] < cnt[0])\n {\n for (auto i = 0u; i < V.size(); i++)\n {\n int num = V[i].size() - 1;\n while (num >= 1 && !used[i][num] && !used[i][num - 1])\n {\n used[i][num] = used[i][num - 1] = true;\n now[V[i][num] - 'A']++;\n now[V[i][num - 1] - 'A']++;\n num -= 2;\n if (now[1] == cnt[0])\n {\n break;\n }\n }\n if (now[1] == cnt[0])\n {\n break;\n }\n }\n }\n assert(now[0] == 0 && now[1] == now[2] && cnt[0] == now[1]);\n \/\/ make ans\n stringstream SS{};\n for (auto i = 0u; i < V.size(); i++)\n {\n for (auto j = 0u; j < V[i].size(); j++)\n {\n if (used[i][j])\n {\n SS << V[i][j];\n }\n }\n if (i < V.size() - 1)\n {\n SS << 'A';\n }\n }\n return SS.str();\n}\n\nstring erase_C(string const &S)\n{\n vector<int> cnt = count(S);\n stringstream SS{};\n for (auto i = 0u; i < S.size(); i++)\n {\n#if DEBUG == 1\n cerr << \"SS.str() = \" << SS.str() << endl;\n#endif\n if (cnt[2] > cnt[1])\n {\n if (S[i] == 'C')\n {\n if (i - 1 >= 0 && i + 1 < S.size())\n {\n if ((S[i - 1] == 'A' && S[i + 1] == 'B') || (S[i - 1] == 'B' && S[i + 1] == 'A'))\n {\n cnt[2]--;\n continue;\n }\n }\n else\n {\n cnt[2]--;\n continue;\n }\n }\n }\n SS << S[i];\n }\n return SS.str();\n}\n\nstring erase_AC(string const &S)\n{\n vector<int> cnt = count(S);\n assert(cnt[0] <= cnt[1] && cnt[1] < cnt[2]);\n stringstream res{};\n for (auto i = 0u; i < S.size(); i++)\n {\n if (cnt[1] < cnt[2] && i < S.size() - 1 && S[i] == 'A' && S[i + 1] == 'C')\n {\n ++i;\n cnt[0]--;\n cnt[2]--;\n }\n else\n {\n res << S[i];\n }\n }\n return res.str();\n}\n\nint main()\n{\n string S;\n cin >> S;\n S = reduce(S);\n map<char, char> M, R;\n M = make_map(S);\n R = make_rev(M);\n S = convert(S, M);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n vector<int> cnt = count(S);\n if (cnt[1] < cnt[2])\n {\n S = erase_C(S);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n cnt = count(S);\n if (cnt[1] < cnt[2])\n {\n S = erase_AC(S);\n#if DEBUG == 1\n cerr << \"S = \" << S << endl;\n#endif\n }\n }\n string ans{make_ans(S)};\n#if DEBUG == 1\n cerr << \"ans = \" << ans << endl;\n#endif\n ans = convert(ans, R);\n cout << ans << endl;\n}<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 2019\/9\/7 21:38:52\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\nll N;\n\nusing point = tuple<ll, ll>;\n\nvector<vector<ll>> solve(vector<ll> const &V)\n{\n vector<vector<ll>> ans(2, vector<ll>(N, -1));\n priority_queue<point, vector<point>, greater<point>> P, Q;\n for (auto i = 0LL; i < N; i++)\n {\n while (!Q.empty() && get<0>(Q.top()) < V[i])\n {\n ll val, ind;\n tie(val, ind) = Q.top();\n Q.pop();\n ans[1][ind] = i - ind;\n }\n while (!P.empty() && get<0>(P.top()) < V[i])\n {\n ll val, ind;\n tie(val, ind) = P.top();\n P.pop();\n ans[0][ind] = i - ind;\n Q.push(point(val, ind));\n }\n P.push(point(V[i], i));\n }\n for (auto i = 0; i < N; i++)\n {\n if (ans[0][i] == -1)\n {\n assert(ans[1][i] == -1);\n ans[0][i] = N - i;\n ans[1][i] = 0;\n }\n else if (ans[1][i] == -1)\n {\n ans[1][i] = N - i;\n }\n else\n {\n ans[1][i] -= ans[0][i];\n }\n }\n return ans;\n}\n\nint main()\n{\n cin >> N;\n vector<ll> V(N);\n for (auto i = 0; i < N; i++)\n {\n cin >> V[i];\n }\n vector<vector<ll>> left{solve(V)};\n reverse(V.begin(), V.end());\n vector<vector<ll>> right{solve(V)};\n for (auto i = 0; i < 2; i++)\n {\n reverse(right[i].begin(), right[i].end());\n }\n#if DEBUG == 1\n for (auto i = 0; i < N; i++)\n {\n cerr << \"left[0][\" << i << \"] = \" << left[0][i] << endl;\n cerr << \"left[1][\" << i << \"] = \" << left[1][i] << endl;\n cerr << \"right[0][\" << i << \"] = \" << right[0][i] << endl;\n cerr << \"right[1][\" << i << \"] = \" << right[1][i] << endl;\n }\n#endif\n ll ans{0LL};\n for (auto i = 0; i < N; i++)\n {\n ans += (left[0][i] * right[1][i] + left[1][i] * right[0][i]) * V[i];\n#if DEBUG == 1\n cerr << \"V[\" << i << \"] = \" << V[i] << \", \" << (left[0][i] * right[1][i] + left[1][i] * right[0][i]) << endl;\n#endif\n }\n cout << ans << endl;\n}<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 2019\/9\/7 21:38:52\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\nll N;\n\nusing point = tuple<ll, ll>;\n\nvector<vector<ll>> solve(vector<ll> const &V)\n{\n vector<vector<ll>> ans(2, vector<ll>(N, -1));\n priority_queue<point, vector<point>, greater<point>> P, Q;\n for (auto i = 0LL; i < N; i++)\n {\n while (!Q.empty() && get<0>(Q.top()) < V[i])\n {\n ll val, ind;\n tie(val, ind) = Q.top();\n Q.pop();\n ans[1][ind] = i - ind;\n }\n while (!P.empty() && get<0>(P.top()) < V[i])\n {\n ll val, ind;\n tie(val, ind) = P.top();\n P.pop();\n ans[0][ind] = i - ind;\n Q.push(point(val, ind));\n }\n P.push(point(V[i], i));\n }\n for (auto i = 0; i < N; i++)\n {\n if (ans[0][i] == -1)\n {\n assert(ans[1][i] == -1);\n ans[0][i] = N - i;\n ans[1][i] = 0;\n }\n else if (ans[1][i] == -1)\n {\n ans[1][i] = N - i;\n }\n else\n {\n ans[1][i] -= ans[0][i];\n }\n }\n return ans;\n}\n\nint main()\n{\n cin >> N;\n vector<ll> V(N);\n for (auto i = 0; i < N; i++)\n {\n cin >> V[i];\n }\n vector<vector<ll>> left{solve(V)};\n reverse(V.begin(), V.end());\n vector<vector<ll>> right{solve(V)};\n for (auto i = 0; i < 2; i++)\n {\n reverse(right[i].begin(), right[i].end());\n }\n#if DEBUG == 1\n for (auto i = 0; i < N; i++)\n {\n cerr << \"left[0][\" << i << \"] = \" << left[0][i] << endl;\n cerr << \"left[1][\" << i << \"] = \" << left[1][i] << endl;\n cerr << \"right[0][\" << i << \"] = \" << right[0][i] << endl;\n cerr << \"right[1][\" << i << \"] = \" << right[1][i] << endl;\n }\n#endif\n reverse(V.begin(), V.end());\n ll ans{0LL};\n for (auto i = 0; i < N; i++)\n {\n ans += (left[0][i] * right[1][i] + left[1][i] * right[0][i]) * V[i];\n#if DEBUG == 1\n cerr << \"V[\" << i << \"] = \" << V[i] << \", \" << (left[0][i] * right[1][i] + left[1][i] * right[0][i]) << endl;\n#endif\n }\n cout << ans << endl;\n}<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : A.cpp\n * Author : Kazune Takahashi\n * Created : 6\/5\/2020, 6:57:07 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs)\n{\n return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs)\n{\n return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs)\n{\n return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs)\n{\n return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a)\n{\n return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2LL; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1LL; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n int ans{0};\n while (x != 0)\n {\n ans += x & 1;\n x >>= 1;\n }\n return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n int N;\n cin >> N;\n int cnt{0};\n for (auto i = 1; i <= N; ++i)\n {\n if (i & 1)\n {\n ++cnt;\n }\n }\n cout << fixed << setprecision(12) << static_cast<double>(cnt) \/ N << endl;\n}\n<commit_msg>submit A.cpp to 'A - Odds of Oddness' (abc142) [C++14 (GCC 5.4.1)]<commit_after>#define DEBUG 1\n\/**\n * File : A.cpp\n * Author : Kazune Takahashi\n * Created : 6\/5\/2020, 6:57:07 AM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/rational.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1000000007LL};\n\/\/ constexpr ll MOD{998244353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3000010LL};\n\/\/ constexpr ll MAX_SIZE{30000010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nvoid ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n }\n}\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs)\n{\n return rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs)\n{\n return -rhs + lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs)\n{\n return rhs * lhs;\n}\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs)\n{\n return Mint<MOD>{lhs} \/ rhs;\n}\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a)\n{\n return stream >> a.x;\n}\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a)\n{\n return stream << a.x;\n}\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2LL; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1LL; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\ntemplate <typename T>\nT gcd(T x, T y) { return y ? gcd(y, x % y) : x; }\ntemplate <typename T>\nT lcm(T x, T y) { return x \/ gcd(x, y) * y; }\n\/\/ ----- for C++17 -----\ntemplate <typename T>\nint popcount(T x) \/\/ C++20\n{\n int ans{0};\n while (x != 0)\n {\n ans += x & 1;\n x >>= 1;\n }\n return ans;\n}\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\/\/ ----- main() -----\n\nint main()\n{\n int N;\n cin >> N;\n int cnt{0};\n for (auto i = 1; i <= N; ++i)\n {\n if (i & 1)\n {\n ++cnt;\n }\n }\n cout << fixed << setprecision(10) << static_cast<double>(cnt) \/ N << endl;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Make logger more thread safe<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012-2013, the scalloc Project Authors. All rights reserved.\n\/\/ Please see the AUTHORS file for details. Use of this source code is governed\n\/\/ by a BSD license that can be found in the LICENSE file.\n\n#include <gtest\/gtest.h>\n\n#include \"allocators\/arena.h\"\n#include \"common.h\"\n#include \"distributed_queue.h\"\n#include \"runtime_vars.h\"\n#include \"scalloc_arenas.h\"\n\nnamespace {\n\nconst size_t kBackends = 80;\n\nvoid* GetObject() {\n void* mem = NULL;\n if (posix_memalign(&mem, 16, 16) != 0) {\n fprintf(stderr, \"posix_memalign failed\\n\");\n abort();\n }\n return mem;\n}\n\nDistributedQueue* InitDQ() {\n RuntimeVars::InitModule();\n scalloc::InitArenas();\n DistributedQueue::InitModule();\n\n static DistributedQueue dq;\n dq.Init(kBackends);\n return &dq;\n}\n\n} \/\/ namespace\n\nTEST(DistributedQueue, Init) {\n DistributedQueue* dq = InitDQ();\n EXPECT_TRUE(dq != NULL);\n}\n\nTEST(DistributedQueue, InitEmpty) {\n DistributedQueue* dq = InitDQ();\n EXPECT_TRUE(dq->Dequeue() == NULL);\n}\n\nTEST(DistributedQueue, EnqueueDequeue) {\n DistributedQueue* dq = InitDQ();\n void* mem = GetObject();\n dq->Enqueue(mem);\n EXPECT_EQ(dq->Dequeue(), mem);\n EXPECT_TRUE(dq->Dequeue() == NULL);\n}\n\nTEST(DistributedQueue, DequeueOnlyAt) {\n DistributedQueue* dq = InitDQ();\n void* mem = GetObject();\n dq->EnqueueAt(mem, 0);\n EXPECT_TRUE(dq->DequeueOnlyAt(1) == NULL);\n EXPECT_EQ(dq->DequeueOnlyAt(0), mem);\n EXPECT_TRUE(dq->DequeueOnlyAt(0) == NULL);\n}\n<commit_msg>reviewed DQ unit test<commit_after>\/\/ Copyright (c) 2012-2013, the scalloc Project Authors. All rights reserved.\n\/\/ Please see the AUTHORS file for details. Use of this source code is governed\n\/\/ by a BSD license that can be found in the LICENSE file.\n\n#include <gtest\/gtest.h>\n\n#include \"allocators\/arena.h\"\n#include \"common.h\"\n#include \"distributed_queue.h\"\n#include \"runtime_vars.h\"\n#include \"scalloc_arenas.h\"\n\nnamespace {\n\nconst size_t kBackends = 80;\n\nvoid* GetObject() {\n void* mem = NULL;\n if (posix_memalign(&mem, 16, 16) != 0) {\n fprintf(stderr, \"posix_memalign failed\\n\");\n abort();\n }\n return mem;\n}\n\nDistributedQueue* InitDQ() {\n RuntimeVars::InitModule();\n scalloc::InitArenas();\n DistributedQueue::InitModule();\n\n static DistributedQueue dq;\n dq.Init(kBackends);\n return &dq;\n}\n\n} \/\/ namespace\n\nTEST(DistributedQueue, Features) {\n \/\/ we cannot init the arean multiple times\n \/\/ so we put all tests together in one\n DistributedQueue* dq = InitDQ();\n \n \/\/ Init\n EXPECT_TRUE(dq != NULL);\n \/\/ InitEmpty\n EXPECT_TRUE(dq->Dequeue() == NULL); \n \n \/\/ EnqueueDequeue\n void* mem = GetObject();\n dq->Enqueue(mem);\n EXPECT_EQ(dq->Dequeue(), mem);\n EXPECT_TRUE(dq->Dequeue() == NULL);\n\n \/\/ DequeueOnlyAt\n mem = GetObject();\n dq->EnqueueAt(mem, 0);\n EXPECT_TRUE(dq->DequeueOnlyAt(1) == NULL);\n EXPECT_EQ(dq->DequeueOnlyAt(0), mem);\n EXPECT_TRUE(dq->DequeueOnlyAt(0) == NULL);\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <numeric>\n#include <cmath>\n#include <string>\n#include \"p_rect.h\"\n#include \"algebra.h\"\n#include <iostream> \/\/ debug\n\nnamespace bdc {\n#ifdef USE_BOX_DRAWING_CHARACTERS\n\twchar_t ur = u'└'; \/\/ up and right\n\n\twchar_t v = u'│'; \/\/ vertical\n\n\twchar_t dr = u'┌'; \/\/ down and right\n\n\twchar_t h = u'─'; \/\/ horizontal\n\n\twchar_t dl = u'┐'; \/\/ down and left\n\n\twchar_t ul = u'┘'; \/\/ up and left\n\n\twchar_t dh = u'┬'; \/\/ down and horizontal\n\n\twchar_t uh = u'┴'; \/\/ up and horizontal\n\n\twchar_t vr = u'├'; \/\/ vertical and right\n\n\twchar_t vl = u'┤'; \/\/ vertical and left\n\n\twchar_t vh = u'┼'; \/\/ vertical and horizontal\n#else\n\twchar_t ur = '+';\n\n\twchar_t v = '|';\n\n\twchar_t dr = '+';\n\n\twchar_t h = '-';\n\n\twchar_t dl = '+';\n\n\twchar_t ul = '+';\n\n\twchar_t dh = '+';\n\n\twchar_t uh = '+';\n\n\twchar_t vr = '+';\n\n\twchar_t vl = '+';\n\n\twchar_t vh = '+';\n#endif\n}\n\ntemplate <class IMAGE_TYPE>\nstd::shared_ptr<IMAGE_TYPE> renderer<IMAGE_TYPE>::render(const view& v) {\n\tauto scn = v.scn.lock();\n\tauto nodes = scn->nodes();\n\tstd::shared_ptr<IMAGE_TYPE> p_img;\n\tstd::shared_ptr<located<IMAGE_TYPE,3>> p_located_img;\n\tlayered_image<IMAGE_TYPE> layered_img{};\n\t\n\tfor (auto node_ptr : nodes) {\n\t\tp_img = node_ptr->render(*this);\n\t\tauto scene_location = node_ptr->get_scene_location();\n\t\tp_located_img = std::make_shared<located<IMAGE_TYPE,3>>(*p_img,scene_location);\n\t\tlayered_img.insert(p_located_img);\n\t}\n\treturn layered_img.flatten_and_crop(scene_rect_to_pixel_rect(v.rectangle));\n}\n\ntemplate <class IMAGE_TYPE>\nlocated<rect,2> renderer<IMAGE_TYPE>::scene_rect_to_pixel_rect(located<rect,2> scene_rect) {\n\tint x = std::floor(scene_x_coordinate_to_pixels(scene_rect.location.x));\n\tint y = std::floor(scene_y_coordinate_to_pixels(scene_rect.location.y));\n\tint width = std::ceil(scene_x_coordinate_to_pixels(scene_rect.width));\n\tint height = std::ceil(scene_y_coordinate_to_pixels(scene_rect.height));\n\treturn located<rect,2>(rect(width,height),point<2>(x,y));\n}\n\nint ascii_renderer::h_pixels_per_unit() {return p_rect::unit_size \/ ascii_renderer::scene_x_coordinates_per_pixel;}\nint ascii_renderer::v_pixels_per_unit() {return p_rect::unit_size \/ ascii_renderer::scene_y_coordinates_per_pixel;}\n\nrect ascii_renderer::pixel_dimensions(const p_rect &pr) {\n\tint width_in_units = pr.width_in_units();\n\tint height_in_units = pr.height_in_units();\n\tif (width_in_units == 0 || height_in_units == 0) {\n\t\treturn rect(0,0);\n\t}\n\treturn rect(ascii_renderer::h_pixels_per_unit() * width_in_units + 1, ascii_renderer::v_pixels_per_unit() * height_in_units + 1);\n}\n\n\/\/ the x pixel coordinates of all vertical partitions, including left and right boundaries\nstd::vector<int> x_partitions(const p_rect &pr) {\n\tstd::vector<int> output{};\n\tif (ascii_renderer::pixel_dimensions(pr).width == 0) {\n\t\treturn output;\n\t}\n\tint x = 0;\n\toutput.push_back(x);\n\tfor (length l : pr.x_lengths) {\n\t\tx += l.val * ascii_renderer::h_pixels_per_unit();\n\t\toutput.push_back(x);\n\t}\n\treturn output;\n}\n\n\/\/ the y pixel coordinates of all horizontal partitions, including top and bottom boundaries\nstd::vector<int> y_partitions(const p_rect &pr) {\n\tstd::vector<int> output{};\n\tif (ascii_renderer::pixel_dimensions(pr).width == 0) {\n\t\treturn output;\n\t}\n\tint y = 0;\n\toutput.push_back(y);\n\tfor (length l : pr.y_lengths) {\n\t\ty += l.val * ascii_renderer::v_pixels_per_unit();\n\t\toutput.push_back(y);\n\t}\n\treturn output;\n}\n\ntemplate <class T, class OutputIt>\nvoid copy(T t, OutputIt first, OutputIt last) {\n\tfor (auto it = first; it != last; ++it) {\n\t\t*it = t;\n\t}\n}\n\nvoid draw_h_lines(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int y : y_partitions(pr)) {\n\t\t\/\/ draw a horizontal line at y\n\t\tpixel_range<wchar_t> range{img,0,y,dim.width,y + 1};\n\t\tcopy(bdc::h,range.begin(),range.end());\n\t}\n}\n\t\nvoid draw_v_lines(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int x : x_partitions(pr)) {\n\t\t\/\/ draw a vertical line at x\n\t\tpixel_range<wchar_t> range{img,x,0,x + 1,dim.height};\n\t\tcopy(bdc::v,range.begin(),range.end());\n\t}\n}\n\nvoid draw_interior_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\tfor (int x : x_partitions(pr)) {\n\t\tfor (int y : y_partitions(pr)) {\n\t\t\timg->pixel_at(x,y) = bdc::vh;\n\t\t}\n\t}\n}\n\nvoid draw_top_and_bottom_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int x : x_partitions(pr)) {\n\t\timg->pixel_at(x,0) = bdc::uh;\n\t\timg->pixel_at(x,dim.height - 1) = bdc::dh;\n\t} \n}\n\nvoid draw_left_and_right_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int y : y_partitions(pr)) {\n\t\timg->pixel_at(0, y) = bdc::vr;\n\t\timg->pixel_at(dim.width - 1, y) = bdc::vl;\n\t}\n}\n\nvoid draw_corners(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\timg->pixel_at(0,0) = bdc::ur;\n\timg->pixel_at(0,dim.height - 1) = bdc::dr;\n\timg->pixel_at(dim.width - 1, 0) = bdc::ul;\n\timg->pixel_at(dim.width - 1, dim.height - 1) = bdc::dl;\n}\n\nvoid draw_labels(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\tint left = 0; \/\/ leftmost x-coordinate of current cell\n\tint bottom = 0; \/\/ bottom y-coordinate of current cell\n\tfor (auto x_len : pr.x_lengths) {\n\t\tfor (auto y_len : pr.y_lengths) {\n\t\t\tstd::string label = algebra::product_to_string(x_len.name, y_len.name);\n\t\t\tint label_y = bottom +(y_len.val * ascii_renderer::v_pixels_per_unit() \/ 2);\n\t\t\tint label_x = left + (x_len.val * ascii_renderer::h_pixels_per_unit() \/ 2) - (int) (label.size() \/ 2);\n\n\t\t\tpixel_range<wchar_t> range{img,label_x,label_y,static_cast<int>(label_x + label.size()),label_y + 1};\n\t\t\tstd::copy(label.begin(),label.end(),range.begin());\n\n\t\t\tbottom += y_len.val * ascii_renderer::v_pixels_per_unit();\n\t\t}\n\t\tleft += x_len.val * ascii_renderer::h_pixels_per_unit();\n\t\tbottom = 0;\n\t}\n}\n\nstd::shared_ptr<ascii_image> ascii_renderer::render(const p_rect &pr) {\n\trect dim = pixel_dimensions(pr);\n\tauto output = std::make_shared<ascii_image>(dim);\n\tif (dim.width == 0) {\n\t\treturn output;\n\t}\n\n\tdraw_h_lines(pr,output);\n\tdraw_v_lines(pr,output);\n\tdraw_interior_intersections(pr,output);\n\tdraw_left_and_right_intersections(pr,output);\n\tdraw_top_and_bottom_intersections(pr,output);\n\tdraw_corners(pr,output);\n\tdraw_labels(pr,output);\n\treturn output;\n}\n\n\/\/ explicit instantiations\ntemplate class renderer<ascii_image>;\n<commit_msg>render only views associated with scenes and nodes that are renderable<commit_after>#include <numeric>\n#include <cmath>\n#include <string>\n#include \"p_rect.h\"\n#include \"algebra.h\"\n#include <iostream> \/\/ debug\n\nnamespace bdc {\n#ifdef USE_BOX_DRAWING_CHARACTERS\n\twchar_t ur = u'└'; \/\/ up and right\n\n\twchar_t v = u'│'; \/\/ vertical\n\n\twchar_t dr = u'┌'; \/\/ down and right\n\n\twchar_t h = u'─'; \/\/ horizontal\n\n\twchar_t dl = u'┐'; \/\/ down and left\n\n\twchar_t ul = u'┘'; \/\/ up and left\n\n\twchar_t dh = u'┬'; \/\/ down and horizontal\n\n\twchar_t uh = u'┴'; \/\/ up and horizontal\n\n\twchar_t vr = u'├'; \/\/ vertical and right\n\n\twchar_t vl = u'┤'; \/\/ vertical and left\n\n\twchar_t vh = u'┼'; \/\/ vertical and horizontal\n#else\n\twchar_t ur = '+';\n\n\twchar_t v = '|';\n\n\twchar_t dr = '+';\n\n\twchar_t h = '-';\n\n\twchar_t dl = '+';\n\n\twchar_t ul = '+';\n\n\twchar_t dh = '+';\n\n\twchar_t uh = '+';\n\n\twchar_t vr = '+';\n\n\twchar_t vl = '+';\n\n\twchar_t vh = '+';\n#endif\n}\n\ntemplate <class IMAGE_TYPE>\nstd::shared_ptr<IMAGE_TYPE> renderer<IMAGE_TYPE>::render(const view& v) {\n\tauto scn_ = v.scn.lock();\n\tif (!scn_) {return std::make_shared<located<IMAGE_TYPE,3>>();}\n\tauto nodes = scn_->nodes();\n\tstd::shared_ptr<IMAGE_TYPE> p_img;\n\tstd::shared_ptr<located<IMAGE_TYPE,3>> p_located_img;\n\tlayered_image<IMAGE_TYPE> layered_img{};\n\t\n\tfor (auto node_ptr : nodes) {\n\t\tif (node_ptr->is_renderable()) {\n\t\t\tp_img = node_ptr->render(*this);\n\t\t\tauto scene_location = node_ptr->get_scene_location();\n\t\t\tp_located_img = std::make_shared<located<IMAGE_TYPE,3>>(*p_img,scene_location);\n\t\t\tlayered_img.insert(p_located_img);\n\t\t}\n\t}\n\treturn layered_img.flatten_and_crop(scene_rect_to_pixel_rect(v.rectangle));\n}\n\ntemplate <class IMAGE_TYPE>\nlocated<rect,2> renderer<IMAGE_TYPE>::scene_rect_to_pixel_rect(located<rect,2> scene_rect) {\n\tint x = std::floor(scene_x_coordinate_to_pixels(scene_rect.location.x));\n\tint y = std::floor(scene_y_coordinate_to_pixels(scene_rect.location.y));\n\tint width = std::ceil(scene_x_coordinate_to_pixels(scene_rect.width));\n\tint height = std::ceil(scene_y_coordinate_to_pixels(scene_rect.height));\n\treturn located<rect,2>(rect(width,height),point<2>(x,y));\n}\n\nint ascii_renderer::h_pixels_per_unit() {return p_rect::unit_size \/ ascii_renderer::scene_x_coordinates_per_pixel;}\nint ascii_renderer::v_pixels_per_unit() {return p_rect::unit_size \/ ascii_renderer::scene_y_coordinates_per_pixel;}\n\nrect ascii_renderer::pixel_dimensions(const p_rect &pr) {\n\tint width_in_units = pr.width_in_units();\n\tint height_in_units = pr.height_in_units();\n\tif (width_in_units == 0 || height_in_units == 0) {\n\t\treturn rect(0,0);\n\t}\n\treturn rect(ascii_renderer::h_pixels_per_unit() * width_in_units + 1, ascii_renderer::v_pixels_per_unit() * height_in_units + 1);\n}\n\n\/\/ the x pixel coordinates of all vertical partitions, including left and right boundaries\nstd::vector<int> x_partitions(const p_rect &pr) {\n\tstd::vector<int> output{};\n\tif (ascii_renderer::pixel_dimensions(pr).width == 0) {\n\t\treturn output;\n\t}\n\tint x = 0;\n\toutput.push_back(x);\n\tfor (length l : pr.x_lengths) {\n\t\tx += l.val * ascii_renderer::h_pixels_per_unit();\n\t\toutput.push_back(x);\n\t}\n\treturn output;\n}\n\n\/\/ the y pixel coordinates of all horizontal partitions, including top and bottom boundaries\nstd::vector<int> y_partitions(const p_rect &pr) {\n\tstd::vector<int> output{};\n\tif (ascii_renderer::pixel_dimensions(pr).width == 0) {\n\t\treturn output;\n\t}\n\tint y = 0;\n\toutput.push_back(y);\n\tfor (length l : pr.y_lengths) {\n\t\ty += l.val * ascii_renderer::v_pixels_per_unit();\n\t\toutput.push_back(y);\n\t}\n\treturn output;\n}\n\ntemplate <class T, class OutputIt>\nvoid copy(T t, OutputIt first, OutputIt last) {\n\tfor (auto it = first; it != last; ++it) {\n\t\t*it = t;\n\t}\n}\n\nvoid draw_h_lines(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int y : y_partitions(pr)) {\n\t\t\/\/ draw a horizontal line at y\n\t\tpixel_range<wchar_t> range{img,0,y,dim.width,y + 1};\n\t\tcopy(bdc::h,range.begin(),range.end());\n\t}\n}\n\t\nvoid draw_v_lines(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int x : x_partitions(pr)) {\n\t\t\/\/ draw a vertical line at x\n\t\tpixel_range<wchar_t> range{img,x,0,x + 1,dim.height};\n\t\tcopy(bdc::v,range.begin(),range.end());\n\t}\n}\n\nvoid draw_interior_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\tfor (int x : x_partitions(pr)) {\n\t\tfor (int y : y_partitions(pr)) {\n\t\t\timg->pixel_at(x,y) = bdc::vh;\n\t\t}\n\t}\n}\n\nvoid draw_top_and_bottom_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int x : x_partitions(pr)) {\n\t\timg->pixel_at(x,0) = bdc::uh;\n\t\timg->pixel_at(x,dim.height - 1) = bdc::dh;\n\t} \n}\n\nvoid draw_left_and_right_intersections(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\tfor (int y : y_partitions(pr)) {\n\t\timg->pixel_at(0, y) = bdc::vr;\n\t\timg->pixel_at(dim.width - 1, y) = bdc::vl;\n\t}\n}\n\nvoid draw_corners(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\trect dim = ascii_renderer::pixel_dimensions(pr);\n\timg->pixel_at(0,0) = bdc::ur;\n\timg->pixel_at(0,dim.height - 1) = bdc::dr;\n\timg->pixel_at(dim.width - 1, 0) = bdc::ul;\n\timg->pixel_at(dim.width - 1, dim.height - 1) = bdc::dl;\n}\n\nvoid draw_labels(const p_rect &pr, std::shared_ptr<ascii_image> img) {\n\tint left = 0; \/\/ leftmost x-coordinate of current cell\n\tint bottom = 0; \/\/ bottom y-coordinate of current cell\n\tfor (auto x_len : pr.x_lengths) {\n\t\tfor (auto y_len : pr.y_lengths) {\n\t\t\tstd::string label = algebra::product_to_string(x_len.name, y_len.name);\n\t\t\tint label_y = bottom +(y_len.val * ascii_renderer::v_pixels_per_unit() \/ 2);\n\t\t\tint label_x = left + (x_len.val * ascii_renderer::h_pixels_per_unit() \/ 2) - (int) (label.size() \/ 2);\n\n\t\t\tpixel_range<wchar_t> range{img,label_x,label_y,static_cast<int>(label_x + label.size()),label_y + 1};\n\t\t\tstd::copy(label.begin(),label.end(),range.begin());\n\n\t\t\tbottom += y_len.val * ascii_renderer::v_pixels_per_unit();\n\t\t}\n\t\tleft += x_len.val * ascii_renderer::h_pixels_per_unit();\n\t\tbottom = 0;\n\t}\n}\n\nstd::shared_ptr<ascii_image> ascii_renderer::render(const p_rect &pr) {\n\trect dim = pixel_dimensions(pr);\n\tauto output = std::make_shared<ascii_image>(dim);\n\tif (dim.width == 0) {\n\t\treturn output;\n\t}\n\n\tdraw_h_lines(pr,output);\n\tdraw_v_lines(pr,output);\n\tdraw_interior_intersections(pr,output);\n\tdraw_left_and_right_intersections(pr,output);\n\tdraw_top_and_bottom_intersections(pr,output);\n\tdraw_corners(pr,output);\n\tdraw_labels(pr,output);\n\treturn output;\n}\n\n\/\/ explicit instantiations\ntemplate class renderer<ascii_image>;\n<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 6\/17\/2020, 5:57:10 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n return true;\n }\n return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i{2LL}; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i{1LL}; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n\npublic:\n Solve()\n {\n }\n\n void flush()\n {\n }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\n\/*\nint main()\n{\n Solve solve;\n solve.flush();\n}\n*\/\n\nint main()\n{\n string S;\n cin >> S;\n int N(S.size());\n vector<vector<ll>> dp(N + 1, vector<ll>(2, Infty<ll>()));\n for (auto i{0}; i < N; ++i)\n {\n ll d{S[i] - '0'};\n for (auto j{0}; j < 2; ++j)\n {\n if (dp[i][j] == Infty<ll>())\n {\n continue;\n }\n for (auto k{0}; k < 2; ++k)\n {\n int ni{i + 1};\n int nj{k};\n ll cost{0};\n if (k == 0 && j == 0)\n {\n cost = d;\n }\n else if (k == 1 && j == 0)\n {\n cost = 10 - d;\n }\n else if (k == 0 && j == 1)\n {\n cost = d + 1;\n }\n else\n {\n cost = 10 - d - 1;\n }\n ch_min(dp[ni][nj], dp[i][j] + cost);\n }\n }\n }\n cout << min(dp[N][0], dp[N][1] + 1) << endl;\n}\n<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 6\/17\/2020, 5:57:10 PM\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n return true;\n }\n return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i{2LL}; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i{1LL}; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n\npublic:\n Solve()\n {\n }\n\n void flush()\n {\n }\n\nprivate:\n};\n\n\/\/ ----- main() -----\n\n\/*\nint main()\n{\n Solve solve;\n solve.flush();\n}\n*\/\n\nint main()\n{\n string S;\n cin >> S;\n int N(S.size());\n vector<vector<ll>> dp(N + 1, vector<ll>(2, Infty<ll>()));\n dp[0][0] = 1;\n for (auto i{0}; i < N; ++i)\n {\n ll d{S[i] - '0'};\n for (auto j{0}; j < 2; ++j)\n {\n if (dp[i][j] == Infty<ll>())\n {\n continue;\n }\n for (auto k{0}; k < 2; ++k)\n {\n int ni{i + 1};\n int nj{k};\n ll cost{0};\n if (k == 0 && j == 0)\n {\n cost = d;\n }\n else if (k == 1 && j == 0)\n {\n cost = 10 - d;\n }\n else if (k == 0 && j == 1)\n {\n cost = d + 1;\n }\n else\n {\n cost = 10 - d - 1;\n }\n ch_min(dp[ni][nj], dp[i][j] + cost);\n }\n }\n }\n cout << min(dp[N][0], dp[N][1] + 1) << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 2020\/6\/23 1:01:43\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n return true;\n }\n return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i{2LL}; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i{1LL}; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n ll N, K;\n map<ll, mint> M;\n\npublic:\n Solve(ll N, ll K) : N{N}, K{K}\n {\n#if DEBUG == 1\n cerr << \"N = \" << N << \", K = \" << K << endl;\n#endif\n }\n\n void flush()\n {\n mint ans{0};\n auto V{table()};\n for (auto i{1LL}; i <= K; ++i)\n {\n ans += V[i] * i;\n#if DEBUG == 1\n cerr << \"V[\" << i << \"] = \" << V[i] << endl;\n#endif\n }\n cout << ans << endl;\n }\n\nprivate:\n vector<mint> table()\n {\n vector<mint> V(K + 1, 0);\n for (auto X{K}; X >= 1; --X)\n {\n V[X] = count(K);\n for (auto i{2LL};; ++i)\n {\n if (auto t{X * i}; t <= K)\n {\n V[X] -= V[t];\n }\n else\n {\n break;\n }\n }\n }\n return V;\n }\n\n mint count(ll X)\n {\n return mint{K \/ X}.power(N);\n }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n ll N, K;\n cin >> N >> K;\n Solve solve(N, K);\n solve.flush();\n}\n<commit_msg>tried E.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File : E.cpp\n * Author : Kazune Takahashi\n * Created : 2020\/6\/23 1:01:43\n * Powered by Visual Studio Code\n *\/\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdio>\n#include <cstdlib>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\/\/ ----- boost -----\n#include <boost\/integer\/common_factor_rt.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/rational.hpp>\n\/\/ ----- using directives and manipulations -----\nusing namespace std;\nusing boost::rational;\nusing boost::integer::gcd; \/\/ for C++14 or for cpp_int\nusing boost::integer::lcm; \/\/ for C++14 or for cpp_int\nusing boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T>\nusing max_heap = priority_queue<T>;\ntemplate <typename T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n\/\/ ----- constexpr for Mint and Combination -----\nconstexpr ll MOD{1'000'000'007LL};\n\/\/ constexpr ll MOD{998'244'353LL}; \/\/ be careful\nconstexpr ll MAX_SIZE{3'000'010LL};\n\/\/ constexpr ll MAX_SIZE{30'000'010LL}; \/\/ if 10^7 is needed\n\/\/ ----- ch_max and ch_min -----\ntemplate <typename T>\nbool ch_max(T &left, T right)\n{\n if (left < right)\n {\n left = right;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n return true;\n }\n return false;\n}\n\/\/ ----- Mint -----\ntemplate <ll MOD = MOD>\nclass Mint\n{\npublic:\n ll x;\n Mint() : x{0LL} {}\n Mint(ll x) : x{(x % MOD + MOD) % MOD} {}\n Mint operator-() const { return x ? MOD - x : 0; }\n Mint &operator+=(Mint const &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n Mint &operator-=(Mint const &a) { return *this += -a; }\n Mint &operator++() { return *this += 1; }\n Mint operator++(int)\n {\n Mint tmp{*this};\n ++*this;\n return tmp;\n }\n Mint &operator--() { return *this -= 1; }\n Mint operator--(int)\n {\n Mint tmp{*this};\n --*this;\n return tmp;\n }\n Mint &operator*=(Mint const &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n Mint &operator\/=(Mint const &a)\n {\n Mint b{a};\n return *this *= b.power(MOD - 2);\n }\n Mint operator+(Mint const &a) const { return Mint(*this) += a; }\n Mint operator-(Mint const &a) const { return Mint(*this) -= a; }\n Mint operator*(Mint const &a) const { return Mint(*this) *= a; }\n Mint operator\/(Mint const &a) const { return Mint(*this) \/= a; }\n bool operator<(Mint const &a) const { return x < a.x; }\n bool operator<=(Mint const &a) const { return x <= a.x; }\n bool operator>(Mint const &a) const { return x > a.x; }\n bool operator>=(Mint const &a) const { return x >= a.x; }\n bool operator==(Mint const &a) const { return x == a.x; }\n bool operator!=(Mint const &a) const { return !(*this == a); }\n Mint power(ll N) const\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n Mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\ntemplate <ll MOD>\nMint<MOD> operator+(ll lhs, Mint<MOD> const &rhs) { return rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator-(ll lhs, Mint<MOD> const &rhs) { return -rhs + lhs; }\ntemplate <ll MOD>\nMint<MOD> operator*(ll lhs, Mint<MOD> const &rhs) { return rhs * lhs; }\ntemplate <ll MOD>\nMint<MOD> operator\/(ll lhs, Mint<MOD> const &rhs) { return Mint<MOD>{lhs} \/ rhs; }\ntemplate <ll MOD>\nistream &operator>>(istream &stream, Mint<MOD> &a) { return stream >> a.x; }\ntemplate <ll MOD>\nostream &operator<<(ostream &stream, Mint<MOD> const &a) { return stream << a.x; }\n\/\/ ----- Combination -----\ntemplate <ll MOD = MOD, ll MAX_SIZE = MAX_SIZE>\nclass Combination\n{\npublic:\n vector<Mint<MOD>> inv, fact, factinv;\n Combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i{2LL}; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[MOD % i]) * (MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i{1LL}; i < MAX_SIZE; i++)\n {\n fact[i] = Mint<MOD>(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n Mint<MOD> operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n Mint<MOD> catalan(int x, int y)\n {\n return (*this)(x + y, y) - (*this)(x + y, y - 1);\n }\n};\n\/\/ ----- for C++14 -----\nusing mint = Mint<MOD>;\nusing combination = Combination<MOD, MAX_SIZE>;\n\/\/ ----- for C++17 -----\ntemplate <typename T, typename enable_if<is_integral<T>::value>::type * = nullptr>\nsize_t popcount(T x) { return bitset<64>(x).count(); }\nsize_t popcount(string const &S) { return bitset<200010>{S}.count(); }\n\/\/ ----- Infty -----\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\ntemplate <typename T>\nconstexpr T mInfty() { return numeric_limits<T>::min(); }\n\/\/ ----- frequently used constexpr -----\n\/\/ constexpr double epsilon{1e-10};\n\/\/ constexpr ll infty{1'000'000'000'000'010LL}; \/\/ or\n\/\/ constexpr int infty{1'000'000'010};\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\n\/\/ ----- Yes() and No() -----\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"No\" << endl;\n exit(0);\n}\n\n\/\/ ----- Solve -----\n\nclass Solve\n{\n ll N, K;\n map<ll, mint> M;\n\npublic:\n Solve(ll N, ll K) : N{N}, K{K}\n {\n#if DEBUG == 1\n cerr << \"N = \" << N << \", K = \" << K << endl;\n#endif\n }\n\n void flush()\n {\n mint ans{0};\n auto V{table()};\n for (auto i{1LL}; i <= K; ++i)\n {\n ans += V[i] * i;\n }\n cout << ans << endl;\n }\n\nprivate:\n vector<mint> table()\n {\n vector<mint> V(K + 1, 0);\n for (auto X{K}; X >= 1; --X)\n {\n V[X] = count(K);\n for (auto i{2LL};; ++i)\n {\n if (auto t{X * i}; t <= K)\n {\n V[X] -= V[t];\n }\n else\n {\n break;\n }\n }\n }\n return V;\n }\n\n mint count(ll X)\n {\n return mint{K \/ X}.power(N);\n }\n};\n\n\/\/ ----- main() -----\n\nint main()\n{\n ll N, K;\n cin >> N >> K;\n Solve solve(N, K);\n solve.flush();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"include\/catch.hpp\"\n#include \"common.h\"\n#include \"RTC\/RtpPacket.h\"\n#include \"RTC\/RTCP\/FeedbackRtpNack.h\"\n#include \"RTC\/RtpStreamSend.h\"\n#include <vector>\n\nusing namespace RTC;\n\n\/\/ Can retransmit up to 17 RTP packets.\nstatic std::vector<RtpPacket*> rtpRetransmissionContainer(18);\n\nSCENARIO(\"NACK and RTP packets retransmission\", \"[rtp][rtcp]\")\n{\n\tSECTION(\"receive NACK and get retransmitted packets\")\n\t{\n\t\tuint8_t rtp_buffer1[] =\n\t\t{\n\t\t\t0b10000000, 0b01111011, 0b01010010, 0b00001110,\n\t\t\t0b01011011, 0b01101011, 0b11001010, 0b10110101,\n\t\t\t0, 0, 0, 2\n\t\t};\n\t\tuint8_t rtp_buffer2[65536];\n\t\tuint8_t rtp_buffer3[65536];\n\t\tuint8_t rtp_buffer4[65536];\n\t\tuint8_t rtp_buffer5[65536];\n\n\t\t\/\/ packet1 [pt:123, seq:21006, timestamp:1533790901]\n\t\tRtpPacket* packet1 = RtpPacket::Parse(rtp_buffer1, sizeof(rtp_buffer1));\n\t\tREQUIRE(packet1);\n\t\tREQUIRE(packet1->GetSequenceNumber() == 21006);\n\t\tREQUIRE(packet1->GetTimestamp() == 1533790901);\n\n\t\t\/\/ packet2 [pt:123, seq:21007, timestamp:1533790901]\n\t\tRtpPacket* packet2 = packet1->Clone(rtp_buffer2);\n\t\tpacket2->SetSequenceNumber(21007);\n\t\tpacket2->SetTimestamp(1533790901);\n\t\tREQUIRE(packet2->GetSequenceNumber() == 21007);\n\t\tREQUIRE(packet2->GetTimestamp() == 1533790901);\n\n\t\t\/\/ packet3 [pt:123, seq:21008, timestamp:1533793871]\n\t\tRtpPacket* packet3 = packet1->Clone(rtp_buffer3);\n\t\tpacket3->SetSequenceNumber(21008);\n\t\tpacket3->SetTimestamp(1533793871);\n\t\tREQUIRE(packet3->GetSequenceNumber() == 21008);\n\t\tREQUIRE(packet3->GetTimestamp() == 1533793871);\n\n\t\t\/\/ packet4 [pt:123, seq:21009, timestamp:1533793871]\n\t\tRtpPacket* packet4 = packet1->Clone(rtp_buffer4);\n\t\tpacket4->SetSequenceNumber(21009);\n\t\tpacket4->SetTimestamp(1533793871);\n\t\tREQUIRE(packet4->GetSequenceNumber() == 21009);\n\t\tREQUIRE(packet4->GetTimestamp() == 1533793871);\n\n\t\t\/\/ packet5 [pt:123, seq:21010, timestamp:1533796931]\n\t\tRtpPacket* packet5 = packet1->Clone(rtp_buffer4);\n\t\tpacket5->SetSequenceNumber(21010);\n\t\tpacket5->SetTimestamp(1533796931);\n\t\tREQUIRE(packet5->GetSequenceNumber() == 21010);\n\t\tREQUIRE(packet5->GetTimestamp() == 1533796931);\n\n\t\t\/\/ Create a RtpStreamSend.\n\t\tRtpStreamSend* stream = new RtpStreamSend(90000, 200);\n\n\t\t\/\/ Receive all the packets in order into the stream.\n\t\tstream->ReceivePacket(packet1);\n\t\tstream->ReceivePacket(packet2);\n\t\tstream->ReceivePacket(packet3);\n\t\tstream->ReceivePacket(packet4);\n\t\tstream->ReceivePacket(packet5);\n\n\t\t\/\/ Create a NACK item that request for all the packets.\n\t\tRTCP::NackItem nack_item(21006, 0b0000000000001111);\n\t\tREQUIRE(nack_item.GetPacketId() == 21006);\n\t\tREQUIRE(nack_item.GetLostPacketBitmask() == htons(0b0000000000001111));\n\n\t\tstream->RequestRtpRetransmission(nack_item.GetPacketId(), nack_item.GetLostPacketBitmask(), rtpRetransmissionContainer);\n\n\t\tREQUIRE(rtpRetransmissionContainer[0] == packet1);\n\t\tREQUIRE(rtpRetransmissionContainer[1] == packet2);\n\t\tREQUIRE(rtpRetransmissionContainer[2] == packet3);\n\t\tREQUIRE(rtpRetransmissionContainer[3] == packet4);\n\t\tREQUIRE(rtpRetransmissionContainer[4] == packet5);\n\t\tREQUIRE(rtpRetransmissionContainer[5] == nullptr);\n\n\t\t\/\/ Clean stuff.\n\t\tdelete packet1;\n\t\tdelete packet2;\n\t\tdelete packet3;\n\t\tdelete packet4;\n\t\tdelete packet5;\n\t\tdelete stream;\n\t}\n}\n<commit_msg>\"Improve\" test-nack.cpp...<commit_after>#include \"include\/catch.hpp\"\n#include \"common.h\"\n#include \"RTC\/RtpPacket.h\"\n#include \"RTC\/RTCP\/FeedbackRtpNack.h\"\n#include \"RTC\/RtpStreamSend.h\"\n#include <vector>\n\nusing namespace RTC;\n\n\/\/ Can retransmit up to 17 RTP packets.\nstatic std::vector<RtpPacket*> rtpRetransmissionContainer(18);\n\nSCENARIO(\"NACK and RTP packets retransmission\", \"[rtp][rtcp]\")\n{\n\tSECTION(\"receive NACK and get retransmitted packets\")\n\t{\n\t\tuint8_t rtp_buffer1[] =\n\t\t{\n\t\t\t0b10000000, 0b01111011, 0b01010010, 0b00001110,\n\t\t\t0b01011011, 0b01101011, 0b11001010, 0b10110101,\n\t\t\t0, 0, 0, 2\n\t\t};\n\t\tuint8_t rtp_buffer2[65536];\n\t\tuint8_t rtp_buffer3[65536];\n\t\tuint8_t rtp_buffer4[65536];\n\t\tuint8_t rtp_buffer5[65536];\n\n\t\t\/\/ packet1 [pt:123, seq:21006, timestamp:1533790901]\n\t\tRtpPacket* packet1 = RtpPacket::Parse(rtp_buffer1, sizeof(rtp_buffer1));\n\t\tREQUIRE(packet1);\n\t\tREQUIRE(packet1->GetSequenceNumber() == 21006);\n\t\tREQUIRE(packet1->GetTimestamp() == 1533790901);\n\n\t\t\/\/ packet2 [pt:123, seq:21007, timestamp:1533790901]\n\t\tRtpPacket* packet2 = packet1->Clone(rtp_buffer2);\n\t\tpacket2->SetSequenceNumber(21007);\n\t\tpacket2->SetTimestamp(1533790901);\n\t\tREQUIRE(packet2->GetSequenceNumber() == 21007);\n\t\tREQUIRE(packet2->GetTimestamp() == 1533790901);\n\n\t\t\/\/ packet3 [pt:123, seq:21008, timestamp:1533793871]\n\t\tRtpPacket* packet3 = packet1->Clone(rtp_buffer3);\n\t\tpacket3->SetSequenceNumber(21008);\n\t\tpacket3->SetTimestamp(1533793871);\n\t\tREQUIRE(packet3->GetSequenceNumber() == 21008);\n\t\tREQUIRE(packet3->GetTimestamp() == 1533793871);\n\n\t\t\/\/ packet4 [pt:123, seq:21009, timestamp:1533793871]\n\t\tRtpPacket* packet4 = packet1->Clone(rtp_buffer4);\n\t\tpacket4->SetSequenceNumber(21009);\n\t\tpacket4->SetTimestamp(1533793871);\n\t\tREQUIRE(packet4->GetSequenceNumber() == 21009);\n\t\tREQUIRE(packet4->GetTimestamp() == 1533793871);\n\n\t\t\/\/ packet5 [pt:123, seq:21010, timestamp:1533796931]\n\t\tRtpPacket* packet5 = packet1->Clone(rtp_buffer4);\n\t\tpacket5->SetSequenceNumber(21010);\n\t\tpacket5->SetTimestamp(1533796931);\n\t\tREQUIRE(packet5->GetSequenceNumber() == 21010);\n\t\tREQUIRE(packet5->GetTimestamp() == 1533796931);\n\n\t\t\/\/ Create a RtpStreamSend.\n\t\tRtpStreamSend* stream = new RtpStreamSend(90000, 200);\n\n\t\t\/\/ Receive all the packets in order into the stream.\n\t\tstream->ReceivePacket(packet1);\n\t\tstream->ReceivePacket(packet2);\n\t\tstream->ReceivePacket(packet3);\n\t\tstream->ReceivePacket(packet4);\n\t\tstream->ReceivePacket(packet5);\n\n\t\t\/\/ Create a NACK item that request for all the packets.\n\t\tRTCP::NackItem nack_item(21006, htons(0b0000000000001111));\n\t\tREQUIRE(nack_item.GetPacketId() == 21006);\n\t\tREQUIRE(nack_item.GetLostPacketBitmask() == 0b0000000000001111);\n\n\t\tstream->RequestRtpRetransmission(nack_item.GetPacketId(), nack_item.GetLostPacketBitmask(), rtpRetransmissionContainer);\n\n\t\tREQUIRE(rtpRetransmissionContainer[0] == packet1);\n\t\tREQUIRE(rtpRetransmissionContainer[1] == packet2);\n\t\tREQUIRE(rtpRetransmissionContainer[2] == packet3);\n\t\tREQUIRE(rtpRetransmissionContainer[3] == packet4);\n\t\tREQUIRE(rtpRetransmissionContainer[4] == packet5);\n\t\tREQUIRE(rtpRetransmissionContainer[5] == nullptr);\n\n\t\t\/\/ Clean stuff.\n\t\tdelete packet1;\n\t\tdelete packet2;\n\t\tdelete packet3;\n\t\tdelete packet4;\n\t\tdelete packet5;\n\t\tdelete stream;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n HardwareSerial.cpp - Hardware serial library for Wiring\n Copyright (c) 2006 Nicholas Zambetti. All right reserved.\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 28 September 2010 by Mark Sproul\n*\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <inttypes.h>\n#include \"Arduino.h\"\n#include \"wiring_private.h\"\n\n\/\/ this next line disables the entire HardwareSerial.cpp, \n\/\/ this is so I can support Attiny series and any other chip without a uart\n#if defined(UBRRH) || defined(UBRR0H) || defined(UBRR1H) || defined(UBRR2H) || defined(UBRR3H)\n\n#include \"HardwareSerial.h\"\n\n\/\/ Define constants and variables for buffering incoming serial data. We're\n\/\/ using a ring buffer (I think), in which head is the index of the location\n\/\/ to which to write the next incoming character and tail is the index of the\n\/\/ location from which to read.\n#if (RAMEND < 1000)\n #define SERIAL_BUFFER_SIZE 16\n#else\n #define SERIAL_BUFFER_SIZE 64\n#endif\n\nstruct ring_buffer\n{\n unsigned char buffer[SERIAL_BUFFER_SIZE];\n volatile int head;\n volatile int tail;\n};\n\n#if defined(UBRRH) || defined(UBRR0H)\n ring_buffer rx_buffer = { { 0 }, 0, 0 };\n ring_buffer tx_buffer = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR1H)\n ring_buffer rx_buffer1 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer1 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR2H)\n ring_buffer rx_buffer2 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer2 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR3H)\n ring_buffer rx_buffer3 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer3 = { { 0 }, 0, 0 };\n#endif\n\ninline void store_char(unsigned char c, ring_buffer *buffer)\n{\n int i = (unsigned int)(buffer->head + 1) % SERIAL_BUFFER_SIZE;\n\n \/\/ if we should be storing the received character into the location\n \/\/ just before the tail (meaning that the head would advance to the\n \/\/ current location of the tail), we're about to overflow the buffer\n \/\/ and so we don't write the character or advance the head.\n if (i != buffer->tail) {\n buffer->buffer[buffer->head] = c;\n buffer->head = i;\n }\n}\n\n#if !defined(USART_RX_vect) && !defined(SIG_USART0_RECV) && \\\n !defined(SIG_UART0_RECV) && !defined(USART0_RX_vect) && \\\n\t!defined(SIG_UART_RECV)\n #error Don't know what the Data Received vector is called for the first UART\n#else\n void serialEvent() __attribute__((weak));\n void serialEvent() {}\n#if defined(USART_RX_vect)\n SIGNAL(USART_RX_vect)\n#elif defined(SIG_USART0_RECV)\n SIGNAL(SIG_USART0_RECV)\n#elif defined(SIG_UART0_RECV)\n SIGNAL(SIG_UART0_RECV)\n#elif defined(USART0_RX_vect)\n SIGNAL(USART0_RX_vect)\n#elif defined(SIG_UART_RECV)\n SIGNAL(SIG_UART_RECV)\n#endif\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR;\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n\tserialEvent();\n }\n#endif\n\n#if defined(USART1_RX_vect)\n void serialEvent1() __attribute__((weak));\n void serialEvent1() {}\n SIGNAL(USART1_RX_vect)\n {\n unsigned char c = UDR1;\n store_char(c, &rx_buffer1);\n\tserialEvent1();\n }\n#elif defined(SIG_USART1_RECV)\n #error SIG_USART1_RECV\n#endif\n\n#if defined(USART2_RX_vect) && defined(UDR2)\n void serialEvent2() __attribute__((weak));\n void serialEvent2() {}\n SIGNAL(USART2_RX_vect)\n {\n unsigned char c = UDR2;\n store_char(c, &rx_buffer2);\n\tserialEvent2();\n }\n#elif defined(SIG_USART2_RECV)\n #error SIG_USART2_RECV\n#endif\n\n#if defined(USART3_RX_vect) && defined(UDR3)\n void serialEvent3() __attribute__((weak));\n void serialEvent3() {}\n SIGNAL(USART3_RX_vect)\n {\n unsigned char c = UDR3;\n store_char(c, &rx_buffer3);\n\tserialEvent3();\n }\n#elif defined(SIG_USART3_RECV)\n #error SIG_USART3_RECV\n#endif\n\n\n#if !defined(UART0_UDRE_vect) && !defined(UART_UDRE_vect) && !defined(USART0_UDRE_vect) && !defined(USART_UDRE_vect)\n #error Don't know what the Data Register Empty vector is called for the first UART\n#else\n#if defined(UART0_UDRE_vect)\nISR(UART0_UDRE_vect)\n#elif defined(UART_UDRE_vect)\nISR(UART_UDRE_vect)\n#elif defined(USART0_UDRE_vect)\nISR(USART0_UDRE_vect)\n#elif defined(USART_UDRE_vect)\nISR(USART_UDRE_vect)\n#endif\n{\n if (tx_buffer.head == tx_buffer.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n#if defined(UCSR0B)\n cbi(UCSR0B, UDRIE0);\n#else\n cbi(UCSRB, UDRIE);\n#endif\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer.buffer[tx_buffer.tail];\n tx_buffer.tail = (tx_buffer.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n #if defined(UDR0)\n UDR0 = c;\n #elif defined(UDR)\n UDR = c;\n #else\n #error UDR not defined\n #endif\n }\n}\n#endif\n\n#ifdef USART1_UDRE_vect\nISR(USART1_UDRE_vect)\n{\n if (tx_buffer1.head == tx_buffer1.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR1B, UDRIE1);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer1.buffer[tx_buffer1.tail];\n tx_buffer1.tail = (tx_buffer1.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR1 = c;\n }\n}\n#endif\n\n#ifdef USART2_UDRE_vect\nISR(USART2_UDRE_vect)\n{\n if (tx_buffer2.head == tx_buffer2.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR2B, UDRIE2);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer2.buffer[tx_buffer2.tail];\n tx_buffer2.tail = (tx_buffer2.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR2 = c;\n }\n}\n#endif\n\n#ifdef USART3_UDRE_vect\nISR(USART3_UDRE_vect)\n{\n if (tx_buffer3.head == tx_buffer3.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR3B, UDRIE3);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer3.buffer[tx_buffer3.tail];\n tx_buffer3.tail = (tx_buffer3.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR3 = c;\n }\n}\n#endif\n\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(ring_buffer *rx_buffer, ring_buffer *tx_buffer,\n volatile uint8_t *ubrrh, volatile uint8_t *ubrrl,\n volatile uint8_t *ucsra, volatile uint8_t *ucsrb,\n volatile uint8_t *udr,\n uint8_t rxen, uint8_t txen, uint8_t rxcie, uint8_t udrie, uint8_t u2x)\n{\n _rx_buffer = rx_buffer;\n _tx_buffer = tx_buffer;\n _ubrrh = ubrrh;\n _ubrrl = ubrrl;\n _ucsra = ucsra;\n _ucsrb = ucsrb;\n _udr = udr;\n _rxen = rxen;\n _txen = txen;\n _rxcie = rxcie;\n _udrie = udrie;\n _u2x = u2x;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(unsigned long baud)\n{\n uint16_t baud_setting;\n bool use_u2x = true;\n\n#if F_CPU == 16000000UL\n \/\/ hardcoded exception for compatibility with the bootloader shipped\n \/\/ with the Duemilanove and previous boards and the firmware on the 8U2\n \/\/ on the Uno and Mega 2560.\n if (baud == 57600) {\n use_u2x = false;\n }\n#endif\n \n if (use_u2x) {\n *_ucsra = 1 << _u2x;\n baud_setting = (F_CPU \/ 4 \/ baud - 1) \/ 2;\n } else {\n *_ucsra = 0;\n baud_setting = (F_CPU \/ 8 \/ baud - 1) \/ 2;\n }\n\n \/\/ assign the baud_setting, a.k.a. ubbr (USART Baud Rate Register)\n *_ubrrh = baud_setting >> 8;\n *_ubrrl = baud_setting;\n\n sbi(*_ucsrb, _rxen);\n sbi(*_ucsrb, _txen);\n sbi(*_ucsrb, _rxcie);\n cbi(*_ucsrb, _udrie);\n}\n\nvoid HardwareSerial::end()\n{\n \/\/ wait for transmission of outgoing data\n while (_tx_buffer->head != _tx_buffer->tail)\n ;\n\n cbi(*_ucsrb, _rxen);\n cbi(*_ucsrb, _txen);\n cbi(*_ucsrb, _rxcie); \n cbi(*_ucsrb, _udrie);\n \n \/\/ clear any received data\n _rx_buffer->head = _rx_buffer->tail;\n}\n\nint HardwareSerial::available(void)\n{\n return (unsigned int)(SERIAL_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % SERIAL_BUFFER_SIZE;\n}\n\nint HardwareSerial::peek(void)\n{\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n return _rx_buffer->buffer[_rx_buffer->tail];\n }\n}\n\nint HardwareSerial::read(void)\n{\n \/\/ if the head isn't ahead of the tail, we don't have any characters\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n unsigned char c = _rx_buffer->buffer[_rx_buffer->tail];\n _rx_buffer->tail = (unsigned int)(_rx_buffer->tail + 1) % SERIAL_BUFFER_SIZE;\n return c;\n }\n}\n\nvoid HardwareSerial::flush()\n{\n while (_tx_buffer->head != _tx_buffer->tail)\n ;\n}\n\nvoid HardwareSerial::write(uint8_t c)\n{\n int i = (_tx_buffer->head + 1) % SERIAL_BUFFER_SIZE;\n\t\n \/\/ If the output buffer is full, there's nothing for it other than to \n \/\/ wait for the interrupt handler to empty it a bit\n while (i == _tx_buffer->tail)\n ;\n\t\n _tx_buffer->buffer[_tx_buffer->head] = c;\n _tx_buffer->head = i;\n\t\n sbi(*_ucsrb, _udrie);\n}\n\n\/\/ Preinstantiate Objects \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(UBRRH) && defined(UBRRL)\n HardwareSerial Serial(&rx_buffer, &tx_buffer, &UBRRH, &UBRRL, &UCSRA, &UCSRB, &UDR, RXEN, TXEN, RXCIE, UDRIE, U2X);\n#elif defined(UBRR0H) && defined(UBRR0L)\n HardwareSerial Serial(&rx_buffer, &tx_buffer, &UBRR0H, &UBRR0L, &UCSR0A, &UCSR0B, &UDR0, RXEN0, TXEN0, RXCIE0, UDRIE0, U2X0);\n#elif defined(USBCON)\n #warning no serial port defined (port 0)\n#else\n #error no serial port defined (port 0)\n#endif\n\n#if defined(UBRR1H)\n HardwareSerial Serial1(&rx_buffer1, &tx_buffer1, &UBRR1H, &UBRR1L, &UCSR1A, &UCSR1B, &UDR1, RXEN1, TXEN1, RXCIE1, UDRIE1, U2X1);\n#endif\n#if defined(UBRR2H)\n HardwareSerial Serial2(&rx_buffer2, &tx_buffer2, &UBRR2H, &UBRR2L, &UCSR2A, &UCSR2B, &UDR2, RXEN2, TXEN2, RXCIE2, UDRIE2, U2X2);\n#endif\n#if defined(UBRR3H)\n HardwareSerial Serial3(&rx_buffer3, &tx_buffer3, &UBRR3H, &UBRR3L, &UCSR3A, &UCSR3B, &UDR3, RXEN3, TXEN3, RXCIE3, UDRIE3, U2X3);\n#endif\n\n#endif \/\/ whole file\n\n<commit_msg>Fixing 300 baud communication for serial.<commit_after>\/*\n HardwareSerial.cpp - Hardware serial library for Wiring\n Copyright (c) 2006 Nicholas Zambetti. All right reserved.\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 28 September 2010 by Mark Sproul\n*\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <inttypes.h>\n#include \"Arduino.h\"\n#include \"wiring_private.h\"\n\n\/\/ this next line disables the entire HardwareSerial.cpp, \n\/\/ this is so I can support Attiny series and any other chip without a uart\n#if defined(UBRRH) || defined(UBRR0H) || defined(UBRR1H) || defined(UBRR2H) || defined(UBRR3H)\n\n#include \"HardwareSerial.h\"\n\n\/\/ Define constants and variables for buffering incoming serial data. We're\n\/\/ using a ring buffer (I think), in which head is the index of the location\n\/\/ to which to write the next incoming character and tail is the index of the\n\/\/ location from which to read.\n#if (RAMEND < 1000)\n #define SERIAL_BUFFER_SIZE 16\n#else\n #define SERIAL_BUFFER_SIZE 64\n#endif\n\nstruct ring_buffer\n{\n unsigned char buffer[SERIAL_BUFFER_SIZE];\n volatile int head;\n volatile int tail;\n};\n\n#if defined(UBRRH) || defined(UBRR0H)\n ring_buffer rx_buffer = { { 0 }, 0, 0 };\n ring_buffer tx_buffer = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR1H)\n ring_buffer rx_buffer1 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer1 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR2H)\n ring_buffer rx_buffer2 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer2 = { { 0 }, 0, 0 };\n#endif\n#if defined(UBRR3H)\n ring_buffer rx_buffer3 = { { 0 }, 0, 0 };\n ring_buffer tx_buffer3 = { { 0 }, 0, 0 };\n#endif\n\ninline void store_char(unsigned char c, ring_buffer *buffer)\n{\n int i = (unsigned int)(buffer->head + 1) % SERIAL_BUFFER_SIZE;\n\n \/\/ if we should be storing the received character into the location\n \/\/ just before the tail (meaning that the head would advance to the\n \/\/ current location of the tail), we're about to overflow the buffer\n \/\/ and so we don't write the character or advance the head.\n if (i != buffer->tail) {\n buffer->buffer[buffer->head] = c;\n buffer->head = i;\n }\n}\n\n#if !defined(USART_RX_vect) && !defined(SIG_USART0_RECV) && \\\n !defined(SIG_UART0_RECV) && !defined(USART0_RX_vect) && \\\n\t!defined(SIG_UART_RECV)\n #error Don't know what the Data Received vector is called for the first UART\n#else\n void serialEvent() __attribute__((weak));\n void serialEvent() {}\n#if defined(USART_RX_vect)\n SIGNAL(USART_RX_vect)\n#elif defined(SIG_USART0_RECV)\n SIGNAL(SIG_USART0_RECV)\n#elif defined(SIG_UART0_RECV)\n SIGNAL(SIG_UART0_RECV)\n#elif defined(USART0_RX_vect)\n SIGNAL(USART0_RX_vect)\n#elif defined(SIG_UART_RECV)\n SIGNAL(SIG_UART_RECV)\n#endif\n {\n #if defined(UDR0)\n unsigned char c = UDR0;\n #elif defined(UDR)\n unsigned char c = UDR;\n #else\n #error UDR not defined\n #endif\n store_char(c, &rx_buffer);\n\tserialEvent();\n }\n#endif\n\n#if defined(USART1_RX_vect)\n void serialEvent1() __attribute__((weak));\n void serialEvent1() {}\n SIGNAL(USART1_RX_vect)\n {\n unsigned char c = UDR1;\n store_char(c, &rx_buffer1);\n\tserialEvent1();\n }\n#elif defined(SIG_USART1_RECV)\n #error SIG_USART1_RECV\n#endif\n\n#if defined(USART2_RX_vect) && defined(UDR2)\n void serialEvent2() __attribute__((weak));\n void serialEvent2() {}\n SIGNAL(USART2_RX_vect)\n {\n unsigned char c = UDR2;\n store_char(c, &rx_buffer2);\n\tserialEvent2();\n }\n#elif defined(SIG_USART2_RECV)\n #error SIG_USART2_RECV\n#endif\n\n#if defined(USART3_RX_vect) && defined(UDR3)\n void serialEvent3() __attribute__((weak));\n void serialEvent3() {}\n SIGNAL(USART3_RX_vect)\n {\n unsigned char c = UDR3;\n store_char(c, &rx_buffer3);\n\tserialEvent3();\n }\n#elif defined(SIG_USART3_RECV)\n #error SIG_USART3_RECV\n#endif\n\n\n#if !defined(UART0_UDRE_vect) && !defined(UART_UDRE_vect) && !defined(USART0_UDRE_vect) && !defined(USART_UDRE_vect)\n #error Don't know what the Data Register Empty vector is called for the first UART\n#else\n#if defined(UART0_UDRE_vect)\nISR(UART0_UDRE_vect)\n#elif defined(UART_UDRE_vect)\nISR(UART_UDRE_vect)\n#elif defined(USART0_UDRE_vect)\nISR(USART0_UDRE_vect)\n#elif defined(USART_UDRE_vect)\nISR(USART_UDRE_vect)\n#endif\n{\n if (tx_buffer.head == tx_buffer.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n#if defined(UCSR0B)\n cbi(UCSR0B, UDRIE0);\n#else\n cbi(UCSRB, UDRIE);\n#endif\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer.buffer[tx_buffer.tail];\n tx_buffer.tail = (tx_buffer.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n #if defined(UDR0)\n UDR0 = c;\n #elif defined(UDR)\n UDR = c;\n #else\n #error UDR not defined\n #endif\n }\n}\n#endif\n\n#ifdef USART1_UDRE_vect\nISR(USART1_UDRE_vect)\n{\n if (tx_buffer1.head == tx_buffer1.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR1B, UDRIE1);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer1.buffer[tx_buffer1.tail];\n tx_buffer1.tail = (tx_buffer1.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR1 = c;\n }\n}\n#endif\n\n#ifdef USART2_UDRE_vect\nISR(USART2_UDRE_vect)\n{\n if (tx_buffer2.head == tx_buffer2.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR2B, UDRIE2);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer2.buffer[tx_buffer2.tail];\n tx_buffer2.tail = (tx_buffer2.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR2 = c;\n }\n}\n#endif\n\n#ifdef USART3_UDRE_vect\nISR(USART3_UDRE_vect)\n{\n if (tx_buffer3.head == tx_buffer3.tail) {\n\t\/\/ Buffer empty, so disable interrupts\n cbi(UCSR3B, UDRIE3);\n }\n else {\n \/\/ There is more data in the output buffer. Send the next byte\n unsigned char c = tx_buffer3.buffer[tx_buffer3.tail];\n tx_buffer3.tail = (tx_buffer3.tail + 1) % SERIAL_BUFFER_SIZE;\n\t\n UDR3 = c;\n }\n}\n#endif\n\n\n\/\/ Constructors \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nHardwareSerial::HardwareSerial(ring_buffer *rx_buffer, ring_buffer *tx_buffer,\n volatile uint8_t *ubrrh, volatile uint8_t *ubrrl,\n volatile uint8_t *ucsra, volatile uint8_t *ucsrb,\n volatile uint8_t *udr,\n uint8_t rxen, uint8_t txen, uint8_t rxcie, uint8_t udrie, uint8_t u2x)\n{\n _rx_buffer = rx_buffer;\n _tx_buffer = tx_buffer;\n _ubrrh = ubrrh;\n _ubrrl = ubrrl;\n _ucsra = ucsra;\n _ucsrb = ucsrb;\n _udr = udr;\n _rxen = rxen;\n _txen = txen;\n _rxcie = rxcie;\n _udrie = udrie;\n _u2x = u2x;\n}\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid HardwareSerial::begin(unsigned long baud)\n{\n uint16_t baud_setting;\n bool use_u2x = true;\n\n#if F_CPU == 16000000UL\n \/\/ hardcoded exception for compatibility with the bootloader shipped\n \/\/ with the Duemilanove and previous boards and the firmware on the 8U2\n \/\/ on the Uno and Mega 2560.\n if (baud == 57600) {\n use_u2x = false;\n }\n#endif\n\ntry_again:\n \n if (use_u2x) {\n *_ucsra = 1 << _u2x;\n baud_setting = (F_CPU \/ 4 \/ baud - 1) \/ 2;\n } else {\n *_ucsra = 0;\n baud_setting = (F_CPU \/ 8 \/ baud - 1) \/ 2;\n }\n \n if ((baud_setting > 4095) && use_u2x)\n {\n use_u2x = false;\n goto try_again;\n }\n\n \/\/ assign the baud_setting, a.k.a. ubbr (USART Baud Rate Register)\n *_ubrrh = baud_setting >> 8;\n *_ubrrl = baud_setting;\n\n sbi(*_ucsrb, _rxen);\n sbi(*_ucsrb, _txen);\n sbi(*_ucsrb, _rxcie);\n cbi(*_ucsrb, _udrie);\n}\n\nvoid HardwareSerial::end()\n{\n \/\/ wait for transmission of outgoing data\n while (_tx_buffer->head != _tx_buffer->tail)\n ;\n\n cbi(*_ucsrb, _rxen);\n cbi(*_ucsrb, _txen);\n cbi(*_ucsrb, _rxcie); \n cbi(*_ucsrb, _udrie);\n \n \/\/ clear any received data\n _rx_buffer->head = _rx_buffer->tail;\n}\n\nint HardwareSerial::available(void)\n{\n return (unsigned int)(SERIAL_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % SERIAL_BUFFER_SIZE;\n}\n\nint HardwareSerial::peek(void)\n{\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n return _rx_buffer->buffer[_rx_buffer->tail];\n }\n}\n\nint HardwareSerial::read(void)\n{\n \/\/ if the head isn't ahead of the tail, we don't have any characters\n if (_rx_buffer->head == _rx_buffer->tail) {\n return -1;\n } else {\n unsigned char c = _rx_buffer->buffer[_rx_buffer->tail];\n _rx_buffer->tail = (unsigned int)(_rx_buffer->tail + 1) % SERIAL_BUFFER_SIZE;\n return c;\n }\n}\n\nvoid HardwareSerial::flush()\n{\n while (_tx_buffer->head != _tx_buffer->tail)\n ;\n}\n\nvoid HardwareSerial::write(uint8_t c)\n{\n int i = (_tx_buffer->head + 1) % SERIAL_BUFFER_SIZE;\n\t\n \/\/ If the output buffer is full, there's nothing for it other than to \n \/\/ wait for the interrupt handler to empty it a bit\n while (i == _tx_buffer->tail)\n ;\n\t\n _tx_buffer->buffer[_tx_buffer->head] = c;\n _tx_buffer->head = i;\n\t\n sbi(*_ucsrb, _udrie);\n}\n\n\/\/ Preinstantiate Objects \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#if defined(UBRRH) && defined(UBRRL)\n HardwareSerial Serial(&rx_buffer, &tx_buffer, &UBRRH, &UBRRL, &UCSRA, &UCSRB, &UDR, RXEN, TXEN, RXCIE, UDRIE, U2X);\n#elif defined(UBRR0H) && defined(UBRR0L)\n HardwareSerial Serial(&rx_buffer, &tx_buffer, &UBRR0H, &UBRR0L, &UCSR0A, &UCSR0B, &UDR0, RXEN0, TXEN0, RXCIE0, UDRIE0, U2X0);\n#elif defined(USBCON)\n #warning no serial port defined (port 0)\n#else\n #error no serial port defined (port 0)\n#endif\n\n#if defined(UBRR1H)\n HardwareSerial Serial1(&rx_buffer1, &tx_buffer1, &UBRR1H, &UBRR1L, &UCSR1A, &UCSR1B, &UDR1, RXEN1, TXEN1, RXCIE1, UDRIE1, U2X1);\n#endif\n#if defined(UBRR2H)\n HardwareSerial Serial2(&rx_buffer2, &tx_buffer2, &UBRR2H, &UBRR2L, &UCSR2A, &UCSR2B, &UDR2, RXEN2, TXEN2, RXCIE2, UDRIE2, U2X2);\n#endif\n#if defined(UBRR3H)\n HardwareSerial Serial3(&rx_buffer3, &tx_buffer3, &UBRR3H, &UBRR3L, &UCSR3A, &UCSR3B, &UDR3, RXEN3, TXEN3, RXCIE3, UDRIE3, U2X3);\n#endif\n\n#endif \/\/ whole file\n\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include <moveit_recorder\/cli_controller.h>\n#include <moveit\/warehouse\/planning_scene_storage.h>\n#include <moveit_recorder\/SceneRobotControl.h>\n\ninline std::string get_option(const boost::program_options::variables_map& vm, const std::string& option, const std::string& default_str)\n{\n return vm.count(option) ? vm[option].as<std::string>() : default_str;\n}\n\nint main(int argc, char** argv)\n{\n ros::init(argc, argv, \"designer\");\n ros::NodeHandle node_handle;\n ros::AsyncSpinner spinner(1);\n spinner.start();\n\n sleep(20);\n\n boost::program_options::options_description desc;\n desc.add_options()\n (\"help\", \"Show help message\")\n (\"host\", boost::program_options::value<std::string>(), \"Host for the Mongo database\")\n (\"port\", boost::program_options::value<std::size_t>(), \"Port for the Mongo database\")\n (\"planning_scene_topic\", boost::program_options::value<std::string>(), \"Planning Scene Topic for the UI\")\n (\"from_marker_topic\",boost::program_options::value<std::string>(), \"Topic on RobotState from interactive marker\")\n (\"from_marker_pose_topic\",boost::program_options::value<std::string>(), \"Topic on Robot Pose from interactive marker\")\n (\"to_marker_topic\",boost::program_options::value<std::string>(), \"Topic on Robot State towards interactive marker\")\n (\"save_dir\", boost::program_options::value<std::string>(), \"Directory to store the recorded bagfile of viewpoints\");\n\n boost::program_options::variables_map vm;\n boost::program_options::parsed_options po = boost::program_options::parse_command_line(argc, argv, desc);\n boost::program_options::store(po, vm);\n boost::program_options::notify(vm);\n\n if (vm.count(\"help\")) \/\/ show help if no parameters passed\n {\n std::cout << desc << std::endl;\n return 1;\n }\n try\n {\n \/\/ connect to the database\n std::string host = vm.count(\"host\") ? vm[\"host\"].as<std::string>() : \"127.0.0.1\";\n size_t port = vm.count(\"port\") ? vm[\"port\"].as<std::size_t>() : 33829;\n moveit_warehouse::PlanningSceneStorage pss(host, port);\n ROS_INFO(\"Connected to Warehouse DB at host (%s) and port (%d)\", host.c_str(), (int)port);\n\n \/\/ planning scene connection for editing in real time\n \/\/ publish diffs to change the robot status\n std::string planning_scene_topic = get_option(vm, \"planning_scene_topic\", \"planning_scene\");\n std::string from_marker_topic = get_option(vm, \"from_marker_topic\", \"from_marker_state\");\n std::string from_marker_pose_topic = get_option(vm, \"from_marker_pose_topic\", \"from_marker_pose\");\n std::string to_marker_topic = get_option(vm, \"to_marker_topic\", \"to_marker_state\");\n std::string query_save_location = get_option(vm, \"save_dir\", \"\/tmp\/\");\n\n \/\/ initialize the scene and control parser\n SceneRobotControl brc(node_handle, \n planning_scene_topic, \n from_marker_topic,\n from_marker_pose_topic,\n to_marker_topic,\n query_save_location);\n brc.waitForScene();\n \n \/\/ spin and catch results\n moveit_msgs::PlanningScene update_scene;\n while(ros::ok())\n {\n ros::spinOnce();\n usleep(1000);\n \n char key = recorder_utils::getch();\n \n \/\/ process the command\n brc.getControlMessage(key);\n\n \/\/ if the keypress is a reset, then a new scene needs to be loaded\n brc.waitForScene();\n }\n }\n catch(mongo_ros::DbConnectException &ex)\n {\n ROS_ERROR_STREAM(\"Unable to connect to warehouse. If you just created the database, it could take a while for initial setup. Please try to run the benchmark again.\" << std::endl << ex.what());\n }\n catch(...)\n {\n \/\/TODO catch possible exceptions from file io and directory creation\n }\n ros::shutdown();\n return 0;\n}\n<commit_msg>fixed bug on reading query save location<commit_after>#include <ros\/ros.h>\n#include <moveit_recorder\/cli_controller.h>\n#include <moveit\/warehouse\/planning_scene_storage.h>\n#include <moveit_recorder\/SceneRobotControl.h>\n\ninline std::string get_option(const boost::program_options::variables_map& vm, const std::string& option, const std::string& default_str)\n{\n return vm.count(option) ? vm[option].as<std::string>() : default_str;\n}\n\nint main(int argc, char** argv)\n{\n ros::init(argc, argv, \"designer\");\n ros::NodeHandle node_handle;\n ros::AsyncSpinner spinner(1);\n spinner.start();\n\n boost::program_options::options_description desc;\n desc.add_options()\n (\"help\", \"Show help message\")\n (\"host\", boost::program_options::value<std::string>(), \"Host for the Mongo database\")\n (\"port\", boost::program_options::value<std::size_t>(), \"Port for the Mongo database\")\n (\"planning_scene_topic\", boost::program_options::value<std::string>(), \"Planning Scene Topic for the UI\")\n (\"from_marker_topic\",boost::program_options::value<std::string>(), \"Topic on RobotState from interactive marker\")\n (\"from_marker_pose_topic\",boost::program_options::value<std::string>(), \"Topic on Robot Pose from interactive marker\")\n (\"to_marker_topic\",boost::program_options::value<std::string>(), \"Topic on Robot State towards interactive marker\")\n (\"save_dir\", boost::program_options::value<std::string>(), \"Directory to store the recorded bagfile of viewpoints\");\n\n boost::program_options::variables_map vm;\n boost::program_options::parsed_options po = boost::program_options::parse_command_line(argc, argv, desc);\n boost::program_options::store(po, vm);\n boost::program_options::notify(vm);\n\n if (vm.count(\"help\")) \/\/ show help if no parameters passed\n {\n std::cout << desc << std::endl;\n return 1;\n }\n try\n {\n \/\/ connect to the database\n std::string host = vm.count(\"host\") ? vm[\"host\"].as<std::string>() : \"127.0.0.1\";\n size_t port = vm.count(\"port\") ? vm[\"port\"].as<std::size_t>() : 33829;\n moveit_warehouse::PlanningSceneStorage pss(host, port);\n ROS_INFO(\"Connected to Warehouse DB at host (%s) and port (%d)\", host.c_str(), (int)port);\n\n \/\/ planning scene connection for editing in real time\n \/\/ publish diffs to change the robot status\n std::string planning_scene_topic = get_option(vm, \"planning_scene_topic\", \"planning_scene\");\n std::string from_marker_topic = get_option(vm, \"from_marker_topic\", \"from_marker_state\");\n std::string from_marker_pose_topic = get_option(vm, \"from_marker_pose_topic\", \"from_marker_pose\");\n std::string to_marker_topic = get_option(vm, \"to_marker_topic\", \"to_marker_state\");\n std::string query_save_location = get_option(vm, \"save_dir\", \"\/tmp\/\");\n\n \/\/ initialize the scene and control parser\n SceneRobotControl brc(node_handle, \n planning_scene_topic, \n from_marker_topic,\n from_marker_pose_topic,\n to_marker_topic,\n query_save_location);\n brc.waitForScene();\n \n \/\/ spin and catch results\n moveit_msgs::PlanningScene update_scene;\n while(ros::ok())\n {\n ros::spinOnce();\n usleep(1000);\n \n char key = recorder_utils::getch();\n \n \/\/ process the command\n brc.getControlMessage(key);\n\n \/\/ if the keypress is a reset, then a new scene needs to be loaded\n brc.waitForScene();\n }\n }\n catch(mongo_ros::DbConnectException &ex)\n {\n ROS_ERROR_STREAM(\"Unable to connect to warehouse. If you just created the database, it could take a while for initial setup. Please try to run the benchmark again.\" << std::endl << ex.what());\n }\n catch(...)\n {\n \/\/TODO catch possible exceptions from file io and directory creation\n }\n ros::shutdown();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 The Crashpad Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"snapshot\/win\/system_snapshot_win.h\"\n\n#include <windows.h>\n#include <intrin.h>\n#include <powrprof.h>\n#include <winnt.h>\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include \"base\/numerics\/safe_conversions.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"build\/build_config.h\"\n#include \"util\/win\/module_version.h\"\n\nnamespace crashpad {\n\nnamespace {\n\n\/\/! \\brief Gets a string representation for a VS_FIXEDFILEINFO.dwFileFlags\n\/\/! value.\nstd::string GetStringForFileFlags(uint32_t file_flags) {\n std::string result;\n DCHECK_EQ(file_flags & VS_FF_INFOINFERRED, 0u);\n if (file_flags & VS_FF_DEBUG)\n result += \"Debug,\";\n if (file_flags & VS_FF_PATCHED)\n result += \"Patched,\";\n if (file_flags & VS_FF_PRERELEASE)\n result += \"Prerelease,\";\n if (file_flags & VS_FF_PRIVATEBUILD)\n result += \"Private,\";\n if (file_flags & VS_FF_SPECIALBUILD)\n result += \"Special,\";\n if (!result.empty())\n return result.substr(0, result.size() - 1); \/\/ Remove trailing comma.\n return result;\n}\n\n\/\/! \\brief Gets a string representation for a VS_FIXEDFILEINFO.dwFileOS value.\nstd::string GetStringForFileOS(uint32_t file_os) {\n \/\/ There are a variety of ancient things this could theoretically be. In\n \/\/ practice, we're always going to get VOS_NT_WINDOWS32 here.\n if ((file_os & VOS_NT_WINDOWS32) == VOS_NT_WINDOWS32)\n return \"Windows NT\";\n else\n return \"Unknown\";\n}\n\n} \/\/ namespace\n\nnamespace internal {\n\nSystemSnapshotWin::SystemSnapshotWin()\n : SystemSnapshot(),\n os_version_full_(),\n os_version_build_(),\n process_reader_(nullptr),\n os_version_major_(0),\n os_version_minor_(0),\n os_version_bugfix_(0),\n os_server_(false),\n initialized_() {\n}\n\nSystemSnapshotWin::~SystemSnapshotWin() {\n}\n\nvoid SystemSnapshotWin::Initialize(ProcessReaderWin* process_reader) {\n INITIALIZATION_STATE_SET_INITIALIZING(initialized_);\n\n process_reader_ = process_reader;\n\n \/\/ We use both GetVersionEx() and GetModuleVersionAndType() (which uses\n \/\/ VerQueryValue() internally). GetVersionEx() is not trustworthy after\n \/\/ Windows 8 (depending on the application manifest) so its data is used only\n \/\/ to fill the os_server_ field, and the rest comes from the version\n \/\/ information stamped on kernel32.dll.\n OSVERSIONINFOEX version_info = {sizeof(version_info)};\n if (!GetVersionEx(reinterpret_cast<OSVERSIONINFO*>(&version_info))) {\n PLOG(WARNING) << \"GetVersionEx\";\n } else {\n os_server_ = version_info.wProductType != VER_NT_WORKSTATION;\n }\n\n static constexpr wchar_t kSystemDll[] = L\"kernel32.dll\";\n VS_FIXEDFILEINFO ffi;\n if (GetModuleVersionAndType(base::FilePath(kSystemDll), &ffi)) {\n std::string flags_string = GetStringForFileFlags(ffi.dwFileFlags);\n std::string os_name = GetStringForFileOS(ffi.dwFileOS);\n os_version_major_ = ffi.dwFileVersionMS >> 16;\n os_version_minor_ = ffi.dwFileVersionMS & 0xffff;\n os_version_bugfix_ = ffi.dwFileVersionLS >> 16;\n os_version_build_ = base::StringPrintf(\"%lu\", ffi.dwFileVersionLS & 0xffff);\n os_version_full_ = base::StringPrintf(\n \"%s %u.%u.%u.%s%s\",\n os_name.c_str(),\n os_version_major_,\n os_version_minor_,\n os_version_bugfix_,\n os_version_build_.c_str(),\n flags_string.empty()\n ? \"\"\n : (std::string(\" (\") + flags_string + \")\").c_str());\n }\n\n INITIALIZATION_STATE_SET_VALID(initialized_);\n}\n\nCPUArchitecture SystemSnapshotWin::GetCPUArchitecture() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n return process_reader_->Is64Bit() ? kCPUArchitectureX86_64\n : kCPUArchitectureX86;\n#elif defined(ARCH_CPU_ARM64)\n return kCPUArchitectureARM64;\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nuint32_t SystemSnapshotWin::CPURevision() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n uint32_t raw = CPUX86Signature();\n uint8_t stepping = raw & 0xf;\n uint8_t model = (raw & 0xf0) >> 4;\n uint8_t family = (raw & 0xf00) >> 8;\n uint8_t extended_model = static_cast<uint8_t>((raw & 0xf0000) >> 16);\n uint16_t extended_family = (raw & 0xff00000) >> 20;\n\n \/\/ For families before 15, extended_family are simply reserved bits.\n if (family < 15)\n extended_family = 0;\n \/\/ extended_model is only used for families 6 and 15.\n if (family != 6 && family != 15)\n extended_model = 0;\n\n uint16_t adjusted_family = family + extended_family;\n uint8_t adjusted_model = model + (extended_model << 4);\n return (adjusted_family << 16) | (adjusted_model << 8) | stepping;\n#elif defined(ARCH_CPU_ARM64)\n \/\/ TODO(jperaza): do this. https:\/\/crashpad.chromium.org\/bug\/30\n \/\/ This is the same as SystemSnapshotLinux::CPURevision.\n return 0;\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nuint8_t SystemSnapshotWin::CPUCount() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n SYSTEM_INFO system_info;\n GetSystemInfo(&system_info);\n if (!base::IsValueInRangeForNumericType<uint8_t>(\n system_info.dwNumberOfProcessors)) {\n LOG(WARNING) << \"dwNumberOfProcessors exceeds uint8_t storage\";\n }\n return base::saturated_cast<uint8_t>(system_info.dwNumberOfProcessors);\n}\n\nstd::string SystemSnapshotWin::CPUVendor() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n __cpuid(cpu_info, 0);\n char vendor[12];\n *reinterpret_cast<int*>(vendor) = cpu_info[1];\n *reinterpret_cast<int*>(vendor + 4) = cpu_info[3];\n *reinterpret_cast<int*>(vendor + 8) = cpu_info[2];\n return std::string(vendor, sizeof(vendor));\n#elif defined(ARCH_CPU_ARM64)\n \/\/ TODO(jperaza): do this. https:\/\/crashpad.chromium.org\/bug\/30\n \/\/ This is the same as SystemSnapshotLinux::CPURevision.\n return std::string();\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nvoid SystemSnapshotWin::CPUFrequency(uint64_t* current_hz,\n uint64_t* max_hz) const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n int num_cpus = CPUCount();\n DCHECK_GT(num_cpus, 0);\n std::vector<PROCESSOR_POWER_INFORMATION> info(num_cpus);\n if (CallNtPowerInformation(ProcessorInformation,\n nullptr,\n 0,\n &info[0],\n sizeof(PROCESSOR_POWER_INFORMATION) * num_cpus) !=\n 0) {\n *current_hz = 0;\n *max_hz = 0;\n return;\n }\n constexpr uint64_t kMhzToHz = static_cast<uint64_t>(1E6);\n *current_hz = std::max_element(info.begin(),\n info.end(),\n [](const PROCESSOR_POWER_INFORMATION& a,\n const PROCESSOR_POWER_INFORMATION& b) {\n return a.CurrentMhz < b.CurrentMhz;\n })->CurrentMhz *\n kMhzToHz;\n *max_hz = std::max_element(info.begin(),\n info.end(),\n [](const PROCESSOR_POWER_INFORMATION& a,\n const PROCESSOR_POWER_INFORMATION& b) {\n return a.MaxMhz < b.MaxMhz;\n })->MaxMhz *\n kMhzToHz;\n}\n\nuint32_t SystemSnapshotWin::CPUX86Signature() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least function 1.\n __cpuid(cpu_info, 1);\n return cpu_info[0];\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint64_t SystemSnapshotWin::CPUX86Features() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least function 1.\n __cpuid(cpu_info, 1);\n return (static_cast<uint64_t>(cpu_info[2]) << 32) |\n static_cast<uint64_t>(cpu_info[3]);\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint64_t SystemSnapshotWin::CPUX86ExtendedFeatures() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least extended\n \/\/ function 1.\n __cpuid(cpu_info, 0x80000001);\n return (static_cast<uint64_t>(cpu_info[2]) << 32) |\n static_cast<uint64_t>(cpu_info[3]);\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint32_t SystemSnapshotWin::CPUX86Leaf7Features() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n\n \/\/ Make sure leaf 7 can be called.\n __cpuid(cpu_info, 0);\n if (cpu_info[0] < 7)\n return 0;\n\n __cpuidex(cpu_info, 7, 0);\n return cpu_info[1];\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nbool SystemSnapshotWin::CPUX86SupportsDAZ() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n \/\/ The correct way to check for denormals-as-zeros (DAZ) support is to examine\n \/\/ mxcsr mask, which can be done with fxsave. See Intel Software Developer's\n \/\/ Manual, Volume 1: Basic Architecture (253665-051), 11.6.3 \"Checking for the\n \/\/ DAZ Flag in the MXCSR Register\". Note that since this function tests for\n \/\/ DAZ support in the CPU, it checks the mxcsr mask. Testing mxcsr would\n \/\/ indicate whether DAZ is actually enabled, which is a per-thread context\n \/\/ concern.\n\n \/\/ Test for fxsave support.\n uint64_t features = CPUX86Features();\n if (!(features & (UINT64_C(1) << 24))) {\n return false;\n }\n\n \/\/ Call fxsave.\n __declspec(align(16)) uint32_t extended_registers[128];\n _fxsave(&extended_registers);\n uint32_t mxcsr_mask = extended_registers[7];\n\n \/\/ Test the DAZ bit.\n return (mxcsr_mask & (1 << 6)) != 0;\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nSystemSnapshot::OperatingSystem SystemSnapshotWin::GetOperatingSystem() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return kOperatingSystemWindows;\n}\n\nbool SystemSnapshotWin::OSServer() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return os_server_;\n}\n\nvoid SystemSnapshotWin::OSVersion(int* major,\n int* minor,\n int* bugfix,\n std::string* build) const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n *major = os_version_major_;\n *minor = os_version_minor_;\n *bugfix = os_version_bugfix_;\n build->assign(os_version_build_);\n}\n\nstd::string SystemSnapshotWin::OSVersionFull() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return os_version_full_;\n}\n\nstd::string SystemSnapshotWin::MachineDescription() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n \/\/ TODO(scottmg): Not sure if there's anything sensible to put here.\n return std::string();\n}\n\nbool SystemSnapshotWin::NXEnabled() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return !!IsProcessorFeaturePresent(PF_NX_ENABLED);\n}\n\nvoid SystemSnapshotWin::TimeZone(DaylightSavingTimeStatus* dst_status,\n int* standard_offset_seconds,\n int* daylight_offset_seconds,\n std::string* standard_name,\n std::string* daylight_name) const {\n \/\/ This returns the current time zone status rather than the status at the\n \/\/ time of the snapshot. This differs from the Mac implementation.\n TIME_ZONE_INFORMATION time_zone_information;\n *dst_status = static_cast<DaylightSavingTimeStatus>(\n GetTimeZoneInformation(&time_zone_information));\n *standard_offset_seconds =\n (time_zone_information.Bias + time_zone_information.StandardBias) * -60;\n *daylight_offset_seconds =\n (time_zone_information.Bias + time_zone_information.DaylightBias) * -60;\n *standard_name = base::UTF16ToUTF8(time_zone_information.StandardName);\n *daylight_name = base::UTF16ToUTF8(time_zone_information.DaylightName);\n}\n\n} \/\/ namespace internal\n} \/\/ namespace crashpad\n<commit_msg>Added CPU revision implementation for ARM64<commit_after>\/\/ Copyright 2015 The Crashpad Authors. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"snapshot\/win\/system_snapshot_win.h\"\n\n#include <windows.h>\n#include <intrin.h>\n#include <powrprof.h>\n#include <winnt.h>\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\n#include \"base\/numerics\/safe_conversions.h\"\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/strings\/utf_string_conversions.h\"\n#include \"build\/build_config.h\"\n#include \"util\/win\/module_version.h\"\n\nnamespace crashpad {\n\nnamespace {\n\n\/\/! \\brief Gets a string representation for a VS_FIXEDFILEINFO.dwFileFlags\n\/\/! value.\nstd::string GetStringForFileFlags(uint32_t file_flags) {\n std::string result;\n DCHECK_EQ(file_flags & VS_FF_INFOINFERRED, 0u);\n if (file_flags & VS_FF_DEBUG)\n result += \"Debug,\";\n if (file_flags & VS_FF_PATCHED)\n result += \"Patched,\";\n if (file_flags & VS_FF_PRERELEASE)\n result += \"Prerelease,\";\n if (file_flags & VS_FF_PRIVATEBUILD)\n result += \"Private,\";\n if (file_flags & VS_FF_SPECIALBUILD)\n result += \"Special,\";\n if (!result.empty())\n return result.substr(0, result.size() - 1); \/\/ Remove trailing comma.\n return result;\n}\n\n\/\/! \\brief Gets a string representation for a VS_FIXEDFILEINFO.dwFileOS value.\nstd::string GetStringForFileOS(uint32_t file_os) {\n \/\/ There are a variety of ancient things this could theoretically be. In\n \/\/ practice, we're always going to get VOS_NT_WINDOWS32 here.\n if ((file_os & VOS_NT_WINDOWS32) == VOS_NT_WINDOWS32)\n return \"Windows NT\";\n else\n return \"Unknown\";\n}\n\n} \/\/ namespace\n\nnamespace internal {\n\nSystemSnapshotWin::SystemSnapshotWin()\n : SystemSnapshot(),\n os_version_full_(),\n os_version_build_(),\n process_reader_(nullptr),\n os_version_major_(0),\n os_version_minor_(0),\n os_version_bugfix_(0),\n os_server_(false),\n initialized_() {\n}\n\nSystemSnapshotWin::~SystemSnapshotWin() {\n}\n\nvoid SystemSnapshotWin::Initialize(ProcessReaderWin* process_reader) {\n INITIALIZATION_STATE_SET_INITIALIZING(initialized_);\n\n process_reader_ = process_reader;\n\n \/\/ We use both GetVersionEx() and GetModuleVersionAndType() (which uses\n \/\/ VerQueryValue() internally). GetVersionEx() is not trustworthy after\n \/\/ Windows 8 (depending on the application manifest) so its data is used only\n \/\/ to fill the os_server_ field, and the rest comes from the version\n \/\/ information stamped on kernel32.dll.\n OSVERSIONINFOEX version_info = {sizeof(version_info)};\n if (!GetVersionEx(reinterpret_cast<OSVERSIONINFO*>(&version_info))) {\n PLOG(WARNING) << \"GetVersionEx\";\n } else {\n os_server_ = version_info.wProductType != VER_NT_WORKSTATION;\n }\n\n static constexpr wchar_t kSystemDll[] = L\"kernel32.dll\";\n VS_FIXEDFILEINFO ffi;\n if (GetModuleVersionAndType(base::FilePath(kSystemDll), &ffi)) {\n std::string flags_string = GetStringForFileFlags(ffi.dwFileFlags);\n std::string os_name = GetStringForFileOS(ffi.dwFileOS);\n os_version_major_ = ffi.dwFileVersionMS >> 16;\n os_version_minor_ = ffi.dwFileVersionMS & 0xffff;\n os_version_bugfix_ = ffi.dwFileVersionLS >> 16;\n os_version_build_ = base::StringPrintf(\"%lu\", ffi.dwFileVersionLS & 0xffff);\n os_version_full_ = base::StringPrintf(\n \"%s %u.%u.%u.%s%s\",\n os_name.c_str(),\n os_version_major_,\n os_version_minor_,\n os_version_bugfix_,\n os_version_build_.c_str(),\n flags_string.empty()\n ? \"\"\n : (std::string(\" (\") + flags_string + \")\").c_str());\n }\n\n INITIALIZATION_STATE_SET_VALID(initialized_);\n}\n\nCPUArchitecture SystemSnapshotWin::GetCPUArchitecture() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n return process_reader_->Is64Bit() ? kCPUArchitectureX86_64\n : kCPUArchitectureX86;\n#elif defined(ARCH_CPU_ARM64)\n return kCPUArchitectureARM64;\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nuint32_t SystemSnapshotWin::CPURevision() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n uint32_t raw = CPUX86Signature();\n uint8_t stepping = raw & 0xf;\n uint8_t model = (raw & 0xf0) >> 4;\n uint8_t family = (raw & 0xf00) >> 8;\n uint8_t extended_model = static_cast<uint8_t>((raw & 0xf0000) >> 16);\n uint16_t extended_family = (raw & 0xff00000) >> 20;\n\n \/\/ For families before 15, extended_family are simply reserved bits.\n if (family < 15)\n extended_family = 0;\n \/\/ extended_model is only used for families 6 and 15.\n if (family != 6 && family != 15)\n extended_model = 0;\n\n uint16_t adjusted_family = family + extended_family;\n uint8_t adjusted_model = model + (extended_model << 4);\n return (adjusted_family << 16) | (adjusted_model << 8) | stepping;\n#elif defined(ARCH_CPU_ARM64)\n SYSTEM_INFO system_info;\n GetSystemInfo(&system_info);\n\n return system_info.wProcessorRevision;\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nuint8_t SystemSnapshotWin::CPUCount() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n SYSTEM_INFO system_info;\n GetSystemInfo(&system_info);\n if (!base::IsValueInRangeForNumericType<uint8_t>(\n system_info.dwNumberOfProcessors)) {\n LOG(WARNING) << \"dwNumberOfProcessors exceeds uint8_t storage\";\n }\n return base::saturated_cast<uint8_t>(system_info.dwNumberOfProcessors);\n}\n\nstd::string SystemSnapshotWin::CPUVendor() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n __cpuid(cpu_info, 0);\n char vendor[12];\n *reinterpret_cast<int*>(vendor) = cpu_info[1];\n *reinterpret_cast<int*>(vendor + 4) = cpu_info[3];\n *reinterpret_cast<int*>(vendor + 8) = cpu_info[2];\n return std::string(vendor, sizeof(vendor));\n#elif defined(ARCH_CPU_ARM64)\n \/\/ TODO(jperaza): do this. https:\/\/crashpad.chromium.org\/bug\/30\n \/\/ This is the same as SystemSnapshotLinux::CPURevision.\n return std::string();\n#else\n#error Unsupported Windows Arch\n#endif\n}\n\nvoid SystemSnapshotWin::CPUFrequency(uint64_t* current_hz,\n uint64_t* max_hz) const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n int num_cpus = CPUCount();\n DCHECK_GT(num_cpus, 0);\n std::vector<PROCESSOR_POWER_INFORMATION> info(num_cpus);\n if (CallNtPowerInformation(ProcessorInformation,\n nullptr,\n 0,\n &info[0],\n sizeof(PROCESSOR_POWER_INFORMATION) * num_cpus) !=\n 0) {\n *current_hz = 0;\n *max_hz = 0;\n return;\n }\n constexpr uint64_t kMhzToHz = static_cast<uint64_t>(1E6);\n *current_hz = std::max_element(info.begin(),\n info.end(),\n [](const PROCESSOR_POWER_INFORMATION& a,\n const PROCESSOR_POWER_INFORMATION& b) {\n return a.CurrentMhz < b.CurrentMhz;\n })->CurrentMhz *\n kMhzToHz;\n *max_hz = std::max_element(info.begin(),\n info.end(),\n [](const PROCESSOR_POWER_INFORMATION& a,\n const PROCESSOR_POWER_INFORMATION& b) {\n return a.MaxMhz < b.MaxMhz;\n })->MaxMhz *\n kMhzToHz;\n}\n\nuint32_t SystemSnapshotWin::CPUX86Signature() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least function 1.\n __cpuid(cpu_info, 1);\n return cpu_info[0];\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint64_t SystemSnapshotWin::CPUX86Features() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least function 1.\n __cpuid(cpu_info, 1);\n return (static_cast<uint64_t>(cpu_info[2]) << 32) |\n static_cast<uint64_t>(cpu_info[3]);\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint64_t SystemSnapshotWin::CPUX86ExtendedFeatures() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n \/\/ We will never run on any processors that don't support at least extended\n \/\/ function 1.\n __cpuid(cpu_info, 0x80000001);\n return (static_cast<uint64_t>(cpu_info[2]) << 32) |\n static_cast<uint64_t>(cpu_info[3]);\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nuint32_t SystemSnapshotWin::CPUX86Leaf7Features() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n int cpu_info[4];\n\n \/\/ Make sure leaf 7 can be called.\n __cpuid(cpu_info, 0);\n if (cpu_info[0] < 7)\n return 0;\n\n __cpuidex(cpu_info, 7, 0);\n return cpu_info[1];\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nbool SystemSnapshotWin::CPUX86SupportsDAZ() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n\n#if defined(ARCH_CPU_X86_FAMILY)\n \/\/ The correct way to check for denormals-as-zeros (DAZ) support is to examine\n \/\/ mxcsr mask, which can be done with fxsave. See Intel Software Developer's\n \/\/ Manual, Volume 1: Basic Architecture (253665-051), 11.6.3 \"Checking for the\n \/\/ DAZ Flag in the MXCSR Register\". Note that since this function tests for\n \/\/ DAZ support in the CPU, it checks the mxcsr mask. Testing mxcsr would\n \/\/ indicate whether DAZ is actually enabled, which is a per-thread context\n \/\/ concern.\n\n \/\/ Test for fxsave support.\n uint64_t features = CPUX86Features();\n if (!(features & (UINT64_C(1) << 24))) {\n return false;\n }\n\n \/\/ Call fxsave.\n __declspec(align(16)) uint32_t extended_registers[128];\n _fxsave(&extended_registers);\n uint32_t mxcsr_mask = extended_registers[7];\n\n \/\/ Test the DAZ bit.\n return (mxcsr_mask & (1 << 6)) != 0;\n#else\n NOTREACHED();\n return 0;\n#endif\n}\n\nSystemSnapshot::OperatingSystem SystemSnapshotWin::GetOperatingSystem() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return kOperatingSystemWindows;\n}\n\nbool SystemSnapshotWin::OSServer() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return os_server_;\n}\n\nvoid SystemSnapshotWin::OSVersion(int* major,\n int* minor,\n int* bugfix,\n std::string* build) const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n *major = os_version_major_;\n *minor = os_version_minor_;\n *bugfix = os_version_bugfix_;\n build->assign(os_version_build_);\n}\n\nstd::string SystemSnapshotWin::OSVersionFull() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return os_version_full_;\n}\n\nstd::string SystemSnapshotWin::MachineDescription() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n \/\/ TODO(scottmg): Not sure if there's anything sensible to put here.\n return std::string();\n}\n\nbool SystemSnapshotWin::NXEnabled() const {\n INITIALIZATION_STATE_DCHECK_VALID(initialized_);\n return !!IsProcessorFeaturePresent(PF_NX_ENABLED);\n}\n\nvoid SystemSnapshotWin::TimeZone(DaylightSavingTimeStatus* dst_status,\n int* standard_offset_seconds,\n int* daylight_offset_seconds,\n std::string* standard_name,\n std::string* daylight_name) const {\n \/\/ This returns the current time zone status rather than the status at the\n \/\/ time of the snapshot. This differs from the Mac implementation.\n TIME_ZONE_INFORMATION time_zone_information;\n *dst_status = static_cast<DaylightSavingTimeStatus>(\n GetTimeZoneInformation(&time_zone_information));\n *standard_offset_seconds =\n (time_zone_information.Bias + time_zone_information.StandardBias) * -60;\n *daylight_offset_seconds =\n (time_zone_information.Bias + time_zone_information.DaylightBias) * -60;\n *standard_name = base::UTF16ToUTF8(time_zone_information.StandardName);\n *daylight_name = base::UTF16ToUTF8(time_zone_information.DaylightName);\n}\n\n} \/\/ namespace internal\n} \/\/ namespace crashpad\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix validation on Windows.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"ImageToImageNetwork.hpp\"\n#include \"FAST\/Data\/Image.hpp\"\n#include \"FAST\/Algorithms\/ImageResizer\/ImageResizer.hpp\"\n\nnamespace fast {\n\nImageToImageNetwork::ImageToImageNetwork() {\n createInputPort<Image>(0);\n createOutputPort<Image>(0);\n enableRuntimeMeasurements();\n}\n\nvoid ImageToImageNetwork::execute() {\n\n auto input = processInputData();\n auto result = executeNetwork(input);\n Tensor::pointer tensor = result[0].second;\n TensorAccess::pointer access = tensor->getAccess(ACCESS_READ);\n\n auto tensor_mapped = access->getData<4>();\n int outputHeight = tensor_mapped.dimension(1);\n int outputWidth = tensor_mapped.dimension(2);\n\n getAllRuntimes()->printAll();\n\n Image::pointer output = Image::New();\n auto data = make_uninitialized_unique<char[]>(outputWidth * outputHeight);\n for (int x = 0; x < outputWidth; ++x) {\n for (int y = 0; y < outputHeight; ++y) {\n data[x + y * outputWidth] = (uchar)((tensor_mapped(0, y, x, 0)+1)*127);\n }\n }\n output->create(outputWidth, outputHeight, TYPE_UINT8, 1, (void*)data.get());\n\n ImageResizer::pointer resizer = ImageResizer::New();\n resizer->setInputData(output);\n resizer->setSize(mInputImages.begin()->second[0]->getSize().cast<int>());\n resizer->setPreserveAspectRatio(mPreserveAspectRatio);\n DataPort::pointer port = resizer->getOutputPort();\n resizer->update(0);\n\n Image::pointer resizedOutput = port->getNextFrame<Image>();\n resizedOutput->setSpacing(mInputImages.begin()->second[0]->getSpacing());\n addOutputData(0, resizedOutput);\n}\n\n}<commit_msg>fixed incorrect change after last commit<commit_after>#include \"ImageToImageNetwork.hpp\"\n#include \"FAST\/Data\/Image.hpp\"\n#include \"FAST\/Algorithms\/ImageResizer\/ImageResizer.hpp\"\n\nnamespace fast {\n\nImageToImageNetwork::ImageToImageNetwork() {\n createInputPort<Image>(0);\n createOutputPort<Image>(0);\n enableRuntimeMeasurements();\n}\n\nvoid ImageToImageNetwork::execute() {\n \/\/ TODO fix\n \/*\n auto input = processInputData();\n auto result = executeNetwork(input);\n Tensor::pointer tensor = result[0].second;\n TensorAccess::pointer access = tensor->getAccess(ACCESS_READ);\n\n auto tensor_mapped = access->getData<4>();\n int outputHeight = tensor_mapped.dimension(1);\n int outputWidth = tensor_mapped.dimension(2);\n\n getAllRuntimes()->printAll();\n\n Image::pointer output = Image::New();\n auto data = make_uninitialized_unique<char[]>(outputWidth * outputHeight);\n for (int x = 0; x < outputWidth; ++x) {\n for (int y = 0; y < outputHeight; ++y) {\n data[x + y * outputWidth] = (uchar)((tensor_mapped(0, y, x, 0)+1)*127);\n }\n }\n output->create(outputWidth, outputHeight, TYPE_UINT8, 1, (void*)data.get());\n\n ImageResizer::pointer resizer = ImageResizer::New();\n resizer->setInputData(output);\n resizer->setSize(mInputImages.begin()->second[0]->getSize().cast<int>());\n resizer->setPreserveAspectRatio(mPreserveAspectRatio);\n DataPort::pointer port = resizer->getOutputPort();\n resizer->update(0);\n\n Image::pointer resizedOutput = port->getNextFrame<Image>();\n resizedOutput->setSpacing(mInputImages.begin()->second[0]->getSpacing());\n addOutputData(0, resizedOutput);\n *\/\n}\n\n}<|endoftext|>"} {"text":"<commit_before>\/**\n ** \\file scheduler\/scheduler.cc\n ** \\brief Implementation of scheduler::Scheduler.\n *\/\n\n\/\/#define ENABLE_DEBUG_TRACES\n\n#include <cassert>\n#include <cstdlib>\n\n#include <libport\/compiler.hh>\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n\n#include \"kernel\/userver.hh\"\n\n#include \"object\/urbi-exception.hh\"\n\n#include \"scheduler\/scheduler.hh\"\n#include \"scheduler\/job.hh\"\n\nnamespace scheduler\n{\n\n \/\/ This function is required to start a new job using the libcoroutine.\n \/\/ Its only purpose is to create the context and start the execution\n \/\/ of the new job.\n static void\n run_job (void* job)\n {\n static_cast<Job*>(job)->run();\n }\n\n void\n Scheduler::add_job (Job* job)\n {\n assert (job);\n assert (!libport::has (jobs_, job));\n jobs_.push_back (job);\n jobs_to_start_ = true;\n }\n\n libport::utime_t\n Scheduler::work ()\n {\n#ifdef ENABLE_DEBUG_TRACES\n static int cycle = 0;\n#endif\n ECHO (\"======================================================== cycle \"\n\t << ++cycle);\n\n libport::utime_t deadline = execute_round (false);\n\n \/\/ If some jobs need to be stopped, do it as soon as possible.\n deadline = std::min (deadline, check_for_stopped_tags (deadline));\n\n#ifdef ENABLE_DEBUG_TRACES\n if (deadline)\n ECHO (\"Scheduler asking to be woken up in \"\n\t << (deadline - ::urbiserver->getTime ()) \/ 1000000L << \" seconds\");\n else\n ECHO (\"Scheduler asking to be woken up ASAP\");\n#endif\n\n return deadline;\n }\n\n libport::utime_t\n Scheduler::execute_round (bool blocked_only)\n {\n \/\/ Run all the jobs in the run queue once. If any job declares upon entry or\n \/\/ return that it is not side-effect free, we remember that for the next\n \/\/ cycle.\n pending_.clear ();\n std::swap (pending_, jobs_);\n\n \/\/ By default, wake us up after one hour and consider that we have no\n \/\/ new job to start. Also, run waiting jobs only if the previous round\n \/\/ may have add a side effect and reset this indication for the current\n \/\/ job.\n libport::utime_t deadline = ::urbiserver->getTime () + 3600000000LL;\n jobs_to_start_ = false;\n bool start_waiting = possible_side_effect_;\n possible_side_effect_ = false;\n\n ECHO (pending_.size() << \" jobs in the queue for this round\");\n foreach (Job* job, pending_)\n {\n \/\/ Kill a job if needed. See explanation in job.hh.\n to_kill_ = 0;\n\n assert (job);\n assert (!job->terminated ());\n\n \/\/ Should the job be started?\n bool start = false;\n\n ECHO (\"Considering \" << *job << \" in state \" << state_name (job->state_get ()));\n\n switch (job->state_get ())\n {\n case to_start:\n\t\/\/ New job. Start its coroutine but do not start the job as it would be queued\n\t\/\/ twice otherwise. It will start doing real work at the next cycle, so set\n\t\/\/ deadline to 0. Note that we use \"continue\" here to avoid having the job\n\t\/\/ requeued because it hasn't been started by setting \"start\".\n\tECHO (\"Starting job \" << *job);\n\tcurrent_job_ = job;\n\tCoro_startCoro_ (self_, job->coro_get(), job, run_job);\n\tcurrent_job_ = 0;\n\tECHO (\"Job \" << *job << \" has been started\");\n\tassert (job->state_get () != to_start);\n\tdeadline = 0;\n\tcontinue;\n case zombie:\n\tassert (false);\n\tbreak;\n case running:\n\tstart = !blocked_only || job->blocked ();\n\tbreak;\n case sleeping:\n\t{\n\t libport::utime_t job_deadline = job->deadline_get ();\n\t if (job_deadline <= ::urbiserver->getTime ())\n\t start = true;\n\t else\n\t deadline = std::min (deadline, job_deadline);\n\t}\n\tbreak;\n case waiting:\n\t\/\/ Since jobs keep their orders in the queue, start waiting jobs if\n\t\/\/ previous jobs in the run have had a possible side effect or if\n\t\/\/ the previous run may have had some. Without it, we may miss some\n\t\/\/ changes if the watching job is after the modifying job in the queue\n\t\/\/ and the watched condition gets true for only one cycle.\n\tstart = start_waiting | possible_side_effect_;\n\tbreak;\n case joining:\n\tbreak;\n }\n\n if (start)\n {\n\tECHO (\"will resume job \" << *job\n\t << (job->side_effect_free_get() ? \" (side-effect free)\" : \"\"));\n\tpossible_side_effect_ |= !job->side_effect_free_get ();\n\tassert (!current_job_);\n\tCoro_switchTo_ (self_, job->coro_get ());\n\tassert (!current_job_);\n\tpossible_side_effect_ |= !job->side_effect_free_get ();\n\tECHO (\"back from job \" << *job\n\t << (job->side_effect_free_get() ? \" (side-effect free)\" : \"\"));\n\tswitch (job->state_get ())\n\t{\n\tcase running:\n\t deadline = 0;\n\t break;\n\tcase sleeping:\n\t deadline = std::min (deadline, job->deadline_get ());\n\t break;\n\tdefault:\n\t break;\n\t}\n }\n else\n\tjobs_.push_back (job); \/\/ Job not started, keep it in queue\n }\n\n \/\/ Kill a job if needed. See explanation in job.hh.\n to_kill_ = 0;\n\n \/\/\/ If during this cycle a new job has been created by an existing job,\n \/\/\/ start it.\n if (jobs_to_start_)\n deadline = 0;\n\n return deadline;\n }\n\n libport::utime_t\n Scheduler::check_for_stopped_tags (libport::utime_t old_deadline)\n {\n bool blocked_job = false;\n\n \/\/ If we have had no stopped tag, return immediately.\n if (stopped_tags_.empty ())\n return old_deadline;\n\n \/\/ If some jobs have been blocked, mark them as running so that they will\n \/\/ handle the condition when they are resumed.\n foreach (Job* job, jobs_)\n if (job->blocked ())\n {\n\tjob->state_set (running);\n\tblocked_job = true;\n }\n\n \/\/ Wake up blocked jobs.\n libport::utime_t deadline = execute_round (true);\n\n \/\/ Reset tags to their real blocked value and reset the list.\n foreach (tag_state_type t, stopped_tags_)\n t.first->set_blocked (t.second);\n stopped_tags_.clear ();\n\n return deadline;\n }\n\n void\n Scheduler::switch_back (Job* job)\n {\n \/\/ Switch back to the scheduler.\n assert (current_job_ == job);\n current_job_ = 0;\n Coro_switchTo_ (job->coro_get (), self_);\n \/\/ We regained control, we are again in the context of the job.\n assert (!current_job_);\n current_job_ = job;\n ECHO (\"job \" << *job << \" resumed\");\n \/\/ Check that we are not near exhausting the stack space.\n job->check_stack_space ();\n \/\/ Execute a deferred exception if any\n job->check_for_pending_exception ();\n \/\/ If we are in frozen state, let's requeue ourselves waiting\n \/\/ for something to change. And let's mark us side-effect\n \/\/ free during this time so that we won't cause other jobs\n \/\/ to be scheduled. Of course, we have to check for pending\n \/\/ exceptions each time we are woken up.\n if (job->frozen ())\n {\n bool side_effect_free_save = job->side_effect_free_get ();\n do {\n\tjob->side_effect_free_set (true);\n\tjob->yield_until_things_changed ();\n\tjob->side_effect_free_set (side_effect_free_save);\n\t\/\/ Execute a deferred exception if any\n\tjob->check_for_pending_exception ();\n } while (job->frozen ());\n }\n }\n\n void\n Scheduler::resume_scheduler (Job* job)\n {\n \/\/ If the job has not terminated and is side-effect free, then we\n \/\/ assume it will not take a long time as we are probably evaluating\n \/\/ a condition. In order to reduce the number of cycles spent to evaluate\n \/\/ the condition, continue until it asks to be suspended in another\n \/\/ way or until it is no longer side-effect free.\n\n if (job->state_get () == running && job->side_effect_free_get ())\n return;\n\n if (!job->terminated ())\n jobs_.push_back (job);\n\n ECHO (*job << \" has \" << (job->terminated () ? \"\" : \"not \") << \"terminated\\n\\t\"\n\t << \"state: \" << state_name (job->state_get ()));\n switch_back (job);\n }\n\n void\n Scheduler::killall_jobs ()\n {\n ECHO (\"killing all jobs!\");\n\n foreach (Job* job, jobs_)\n kill_job (job);\n\n foreach (Job* job, pending_)\n kill_job (job);\n }\n\n void\n Scheduler::unschedule_job (Job* job)\n {\n assert (job);\n assert (job != current_job_);\n\n ECHO (\"unscheduling job \" << *job);\n\n \/\/ Remove the job from the queue.\n jobs_.remove (job);\n\n \/\/ Remove it from live queues as well if the job is destroyed.\n pending_.remove (job);\n }\n\n void\n Scheduler::kill_job (Job* job)\n {\n KillException ke;\n job->async_throw (ke);\n }\n\n void Scheduler::signal_stop (rTag t)\n {\n bool previous_state = t->own_blocked ();\n t->set_blocked (true);\n stopped_tags_.push_back (std::make_pair(t, previous_state));\n }\n\n} \/\/ namespace scheduler\n<commit_msg>Do not resume a terminated job in any case<commit_after>\/**\n ** \\file scheduler\/scheduler.cc\n ** \\brief Implementation of scheduler::Scheduler.\n *\/\n\n\/\/#define ENABLE_DEBUG_TRACES\n\n#include <cassert>\n#include <cstdlib>\n\n#include <libport\/compiler.hh>\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n\n#include \"kernel\/userver.hh\"\n\n#include \"object\/urbi-exception.hh\"\n\n#include \"scheduler\/scheduler.hh\"\n#include \"scheduler\/job.hh\"\n\nnamespace scheduler\n{\n\n \/\/ This function is required to start a new job using the libcoroutine.\n \/\/ Its only purpose is to create the context and start the execution\n \/\/ of the new job.\n static void\n run_job (void* job)\n {\n static_cast<Job*>(job)->run();\n }\n\n void\n Scheduler::add_job (Job* job)\n {\n assert (job);\n assert (!libport::has (jobs_, job));\n jobs_.push_back (job);\n jobs_to_start_ = true;\n }\n\n libport::utime_t\n Scheduler::work ()\n {\n#ifdef ENABLE_DEBUG_TRACES\n static int cycle = 0;\n#endif\n ECHO (\"======================================================== cycle \"\n\t << ++cycle);\n\n libport::utime_t deadline = execute_round (false);\n\n \/\/ If some jobs need to be stopped, do it as soon as possible.\n deadline = std::min (deadline, check_for_stopped_tags (deadline));\n\n#ifdef ENABLE_DEBUG_TRACES\n if (deadline)\n ECHO (\"Scheduler asking to be woken up in \"\n\t << (deadline - ::urbiserver->getTime ()) \/ 1000000L << \" seconds\");\n else\n ECHO (\"Scheduler asking to be woken up ASAP\");\n#endif\n\n return deadline;\n }\n\n libport::utime_t\n Scheduler::execute_round (bool blocked_only)\n {\n \/\/ Run all the jobs in the run queue once. If any job declares upon entry or\n \/\/ return that it is not side-effect free, we remember that for the next\n \/\/ cycle.\n pending_.clear ();\n std::swap (pending_, jobs_);\n\n \/\/ By default, wake us up after one hour and consider that we have no\n \/\/ new job to start. Also, run waiting jobs only if the previous round\n \/\/ may have add a side effect and reset this indication for the current\n \/\/ job.\n libport::utime_t deadline = ::urbiserver->getTime () + 3600000000LL;\n jobs_to_start_ = false;\n bool start_waiting = possible_side_effect_;\n possible_side_effect_ = false;\n\n ECHO (pending_.size() << \" jobs in the queue for this round\");\n foreach (Job* job, pending_)\n {\n \/\/ Kill a job if needed. See explanation in job.hh.\n to_kill_ = 0;\n\n assert (job);\n assert (!job->terminated ());\n\n \/\/ Should the job be started?\n bool start = false;\n\n ECHO (\"Considering \" << *job << \" in state \" << state_name (job->state_get ()));\n\n switch (job->state_get ())\n {\n case to_start:\n\t\/\/ New job. Start its coroutine but do not start the job as it would be queued\n\t\/\/ twice otherwise. It will start doing real work at the next cycle, so set\n\t\/\/ deadline to 0. Note that we use \"continue\" here to avoid having the job\n\t\/\/ requeued because it hasn't been started by setting \"start\".\n\tECHO (\"Starting job \" << *job);\n\tcurrent_job_ = job;\n\tCoro_startCoro_ (self_, job->coro_get(), job, run_job);\n\tcurrent_job_ = 0;\n\tECHO (\"Job \" << *job << \" has been started\");\n\tassert (job->state_get () != to_start);\n\tdeadline = 0;\n\tcontinue;\n case zombie:\n\tassert (false);\n\tbreak;\n case running:\n\tstart = !blocked_only || job->blocked ();\n\tbreak;\n case sleeping:\n\t{\n\t libport::utime_t job_deadline = job->deadline_get ();\n\t if (job_deadline <= ::urbiserver->getTime ())\n\t start = true;\n\t else\n\t deadline = std::min (deadline, job_deadline);\n\t}\n\tbreak;\n case waiting:\n\t\/\/ Since jobs keep their orders in the queue, start waiting jobs if\n\t\/\/ previous jobs in the run have had a possible side effect or if\n\t\/\/ the previous run may have had some. Without it, we may miss some\n\t\/\/ changes if the watching job is after the modifying job in the queue\n\t\/\/ and the watched condition gets true for only one cycle.\n\tstart = start_waiting | possible_side_effect_;\n\tbreak;\n case joining:\n\tbreak;\n }\n\n if (start)\n {\n\tECHO (\"will resume job \" << *job\n\t << (job->side_effect_free_get() ? \" (side-effect free)\" : \"\"));\n\tpossible_side_effect_ |= !job->side_effect_free_get ();\n\tassert (!current_job_);\n\tCoro_switchTo_ (self_, job->coro_get ());\n\tassert (!current_job_);\n\tpossible_side_effect_ |= !job->side_effect_free_get ();\n\tECHO (\"back from job \" << *job\n\t << (job->side_effect_free_get() ? \" (side-effect free)\" : \"\"));\n\tswitch (job->state_get ())\n\t{\n\tcase running:\n\t deadline = 0;\n\t break;\n\tcase sleeping:\n\t deadline = std::min (deadline, job->deadline_get ());\n\t break;\n\tdefault:\n\t break;\n\t}\n }\n else\n\tjobs_.push_back (job); \/\/ Job not started, keep it in queue\n }\n\n \/\/ Kill a job if needed. See explanation in job.hh.\n to_kill_ = 0;\n\n \/\/\/ If during this cycle a new job has been created by an existing job,\n \/\/\/ start it.\n if (jobs_to_start_)\n deadline = 0;\n\n return deadline;\n }\n\n libport::utime_t\n Scheduler::check_for_stopped_tags (libport::utime_t old_deadline)\n {\n bool blocked_job = false;\n\n \/\/ If we have had no stopped tag, return immediately.\n if (stopped_tags_.empty ())\n return old_deadline;\n\n \/\/ If some jobs have been blocked, mark them as running so that they will\n \/\/ handle the condition when they are resumed.\n foreach (Job* job, jobs_)\n if (job->blocked ())\n {\n\tjob->state_set (running);\n\tblocked_job = true;\n }\n\n \/\/ Wake up blocked jobs.\n libport::utime_t deadline = execute_round (true);\n\n \/\/ Reset tags to their real blocked value and reset the list.\n foreach (tag_state_type t, stopped_tags_)\n t.first->set_blocked (t.second);\n stopped_tags_.clear ();\n\n return deadline;\n }\n\n void\n Scheduler::switch_back (Job* job)\n {\n \/\/ Switch back to the scheduler.\n assert (current_job_ == job);\n current_job_ = 0;\n Coro_switchTo_ (job->coro_get (), self_);\n \/\/ We regained control, we are again in the context of the job.\n assert (!current_job_);\n current_job_ = job;\n ECHO (\"job \" << *job << \" resumed\");\n \/\/ Check that we are not near exhausting the stack space.\n job->check_stack_space ();\n \/\/ Execute a deferred exception if any\n job->check_for_pending_exception ();\n \/\/ If we are in frozen state, let's requeue ourselves waiting\n \/\/ for something to change. And let's mark us side-effect\n \/\/ free during this time so that we won't cause other jobs\n \/\/ to be scheduled. Of course, we have to check for pending\n \/\/ exceptions each time we are woken up.\n if (job->frozen ())\n {\n bool side_effect_free_save = job->side_effect_free_get ();\n do {\n\tjob->side_effect_free_set (true);\n\tjob->yield_until_things_changed ();\n\tjob->side_effect_free_set (side_effect_free_save);\n\t\/\/ Execute a deferred exception if any\n\tjob->check_for_pending_exception ();\n } while (job->frozen ());\n }\n }\n\n void\n Scheduler::resume_scheduler (Job* job)\n {\n \/\/ If the job has not terminated and is side-effect free, then we\n \/\/ assume it will not take a long time as we are probably evaluating\n \/\/ a condition. In order to reduce the number of cycles spent to evaluate\n \/\/ the condition, continue until it asks to be suspended in another\n \/\/ way or until it is no longer side-effect free.\n\n if (!job->terminated ())\n {\n\tif (job->state_get () == running && job->side_effect_free_get ())\n\t return;\n\telse\n\t jobs_.push_back (job);\n }\n\n ECHO (*job << \" has \" << (job->terminated () ? \"\" : \"not \") << \"terminated\\n\\t\"\n\t << \"state: \" << state_name (job->state_get ()));\n switch_back (job);\n }\n\n void\n Scheduler::killall_jobs ()\n {\n ECHO (\"killing all jobs!\");\n\n foreach (Job* job, jobs_)\n kill_job (job);\n\n foreach (Job* job, pending_)\n kill_job (job);\n }\n\n void\n Scheduler::unschedule_job (Job* job)\n {\n assert (job);\n assert (job != current_job_);\n\n ECHO (\"unscheduling job \" << *job);\n\n \/\/ Remove the job from the queue.\n jobs_.remove (job);\n\n \/\/ Remove it from live queues as well if the job is destroyed.\n pending_.remove (job);\n }\n\n void\n Scheduler::kill_job (Job* job)\n {\n KillException ke;\n job->async_throw (ke);\n }\n\n void Scheduler::signal_stop (rTag t)\n {\n bool previous_state = t->own_blocked ();\n t->set_blocked (true);\n stopped_tags_.push_back (std::make_pair(t, previous_state));\n }\n\n} \/\/ namespace scheduler\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ HEADER\n#include <dali-adaptor-version.h>\n\n\/\/ EXTERNAL INCLUDES\n#ifdef DEBUG_ENABLED\n#include <iostream>\n#endif\n\nnamespace Dali\n{\n\nconst unsigned int ADAPTOR_MAJOR_VERSION = 1;\nconst unsigned int ADAPTOR_MINOR_VERSION = 1;\nconst unsigned int ADAPTOR_MICRO_VERSION = 17;\nconst char * const ADAPTOR_BUILD_DATE = __DATE__ \" \" __TIME__;\n\n#ifdef DEBUG_ENABLED\nnamespace\n{\n\/\/\/ Allows the printing of the version number ONLY when debug is enabled\nstruct PrintVersion\n{\n PrintVersion()\n {\n std::cout << \"DALi Adaptor: \" << ADAPTOR_MAJOR_VERSION << \".\" << ADAPTOR_MINOR_VERSION << \".\" << ADAPTOR_MICRO_VERSION << \" (\" << ADAPTOR_BUILD_DATE << \")\" << std::endl;\n }\n};\nPrintVersion ADAPTOR_VERSION;\n} \/\/ unnamed namespace\n#endif\n\n} \/\/ namespace Dali\n<commit_msg>Reporting dali version on stderr instead of stdout<commit_after>\/*\n * Copyright (c) 2015 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ HEADER\n#include <dali-adaptor-version.h>\n\n\/\/ EXTERNAL INCLUDES\n#ifdef DEBUG_ENABLED\n#include <iostream>\n#endif\n\nnamespace Dali\n{\n\nconst unsigned int ADAPTOR_MAJOR_VERSION = 1;\nconst unsigned int ADAPTOR_MINOR_VERSION = 1;\nconst unsigned int ADAPTOR_MICRO_VERSION = 17;\nconst char * const ADAPTOR_BUILD_DATE = __DATE__ \" \" __TIME__;\n\n#ifdef DEBUG_ENABLED\nnamespace\n{\n\/\/\/ Allows the printing of the version number ONLY when debug is enabled\nstruct PrintVersion\n{\n PrintVersion()\n {\n std::cerr << \"DALi Adaptor: \" << ADAPTOR_MAJOR_VERSION << \".\" << ADAPTOR_MINOR_VERSION << \".\" << ADAPTOR_MICRO_VERSION << \" (\" << ADAPTOR_BUILD_DATE << \")\" << std::endl;\n }\n};\nPrintVersion ADAPTOR_VERSION;\n} \/\/ unnamed namespace\n#endif\n\n} \/\/ namespace Dali\n<|endoftext|>"} {"text":"<commit_before>#include <catch.hpp>\n\n#include <regex>\n#include \"test_data.hpp\"\n#include \"libslic3r.h\"\n\nusing namespace Slic3r::Test;\n\nstd::regex perimeters_regex(\"^G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; perimeter[ ]*$\");\nstd::regex infill_regex(\"^G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; infill[ ]*$\");\nstd::regex skirt_regex(\"^G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; skirt[ ]*$\");\n\nSCENARIO( \"PrintGCode basic functionality\", \"[!mayfail]\") {\n GIVEN(\"A default configuration and a print test object\") {\n auto config {Slic3r::Config::new_from_defaults()};\n auto gcode {std::stringstream(\"\")};\n\n WHEN(\"the output is executed with no support material\") {\n config->set(\"first_layer_extrusion_width\", 0);\n config->set(\"gcode_comments\", true);\n Slic3r::Model model;\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n print->process();\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains slic3r version\") {\n REQUIRE(exported.find(SLIC3R_VERSION) != std::string::npos);\n }\n THEN(\"Exported text contains git commit id\") {\n REQUIRE(exported.find(\"; Git Commit\") != std::string::npos);\n REQUIRE(exported.find(BUILD_COMMIT) != std::string::npos);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") == std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") == std::string::npos);\n }\n\n THEN(\"GCode preamble is emitted.\") {\n REQUIRE(exported.find(\"G21 ; set units to millimeters\") != std::string::npos);\n }\n\n THEN(\"Config options emitted for print config, default region config, default object config\") {\n REQUIRE(exported.find(\"; first_layer_temperature\") != std::string::npos);\n REQUIRE(exported.find(\"; layer_height\") != std::string::npos);\n REQUIRE(exported.find(\"; fill_density\") != std::string::npos);\n }\n THEN(\"Infill is emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, infill_regex));\n }\n THEN(\"Perimeters are emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, perimeters_regex));\n }\n THEN(\"Skirt is emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, skirt_regex));\n }\n }\n WHEN(\"the output is executed with support material\") {\n Slic3r::Model model;\n config->set(\"first_layer_extrusion_width\", 0);\n config->set(\"support_material\", true);\n config->set(\"raft_layers\", 3);\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") == std::string::npos);\n }\n }\n WHEN(\"the output is executed with a separate first layer extrusion width\") {\n Slic3r::Model model;\n config->set(\"first_layer_extrusion_width\", 0.5);\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") == std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") != std::string::npos);\n }\n }\n WHEN(\"Cooling is enabled and the fan is disabled.\") {\n config->set(\"cooling\", true);\n config->set(\"disable_fan_first_layers\", 5);\n Slic3r::Model model;\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"GCode to disable fan is emitted.\"){\n REQUIRE(exported.find(\"M107\") != std::string::npos);\n }\n }\n\n gcode.clear();\n }\n}\n<commit_msg>Fixed regex to match lines.<commit_after>#include <catch.hpp>\n\n#include <regex>\n#include \"test_data.hpp\"\n#include \"libslic3r.h\"\n\nusing namespace Slic3r::Test;\n\nstd::regex perimeters_regex(\"G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; perimeter\");\nstd::regex infill_regex(\"G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; infill\");\nstd::regex skirt_regex(\"G1 X[-0-9.]* Y[-0-9.]* E[-0-9.]* ; skirt\");\n\nSCENARIO( \"PrintGCode basic functionality\", \"[!mayfail]\") {\n GIVEN(\"A default configuration and a print test object\") {\n auto config {Slic3r::Config::new_from_defaults()};\n auto gcode {std::stringstream(\"\")};\n\n WHEN(\"the output is executed with no support material\") {\n config->set(\"first_layer_extrusion_width\", 0);\n config->set(\"gcode_comments\", true);\n Slic3r::Model model;\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n print->process();\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains slic3r version\") {\n REQUIRE(exported.find(SLIC3R_VERSION) != std::string::npos);\n }\n THEN(\"Exported text contains git commit id\") {\n REQUIRE(exported.find(\"; Git Commit\") != std::string::npos);\n REQUIRE(exported.find(BUILD_COMMIT) != std::string::npos);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") == std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") == std::string::npos);\n }\n\n THEN(\"GCode preamble is emitted.\") {\n REQUIRE(exported.find(\"G21 ; set units to millimeters\") != std::string::npos);\n }\n\n THEN(\"Config options emitted for print config, default region config, default object config\") {\n REQUIRE(exported.find(\"; first_layer_temperature\") != std::string::npos);\n REQUIRE(exported.find(\"; layer_height\") != std::string::npos);\n REQUIRE(exported.find(\"; fill_density\") != std::string::npos);\n }\n THEN(\"Infill is emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, infill_regex));\n }\n THEN(\"Perimeters are emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, perimeters_regex));\n }\n THEN(\"Skirt is emitted.\") {\n std::smatch has_match;\n REQUIRE(std::regex_search(exported, has_match, skirt_regex));\n }\n }\n WHEN(\"the output is executed with support material\") {\n Slic3r::Model model;\n config->set(\"first_layer_extrusion_width\", 0);\n config->set(\"support_material\", true);\n config->set(\"raft_layers\", 3);\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") == std::string::npos);\n }\n }\n WHEN(\"the output is executed with a separate first layer extrusion width\") {\n Slic3r::Model model;\n config->set(\"first_layer_extrusion_width\", 0.5);\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"Some text output is generated.\") {\n REQUIRE(exported.size() > 0);\n }\n THEN(\"Exported text contains extrusion statistics.\") {\n REQUIRE(exported.find(\"; external perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; perimeters extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; top solid infill extrusion width\") != std::string::npos);\n REQUIRE(exported.find(\"; support material extrusion width\") == std::string::npos);\n REQUIRE(exported.find(\"; first layer extrusion width\") != std::string::npos);\n }\n }\n WHEN(\"Cooling is enabled and the fan is disabled.\") {\n config->set(\"cooling\", true);\n config->set(\"disable_fan_first_layers\", 5);\n Slic3r::Model model;\n auto print {Slic3r::Test::init_print({TestMesh::cube_20x20x20}, model, config)};\n Slic3r::Test::gcode(gcode, print);\n auto exported {gcode.str()};\n THEN(\"GCode to disable fan is emitted.\"){\n REQUIRE(exported.find(\"M107\") != std::string::npos);\n }\n }\n\n gcode.clear();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The Project Oak Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"oak\/server\/oak_node.h\"\n\n#include <openssl\/sha.h>\n\n#include <iostream>\n#include <utility>\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"oak\/server\/buffer_channel.h\"\n#include \"oak\/server\/logging_channel.h\"\n#include \"oak\/server\/wabt_output.h\"\n#include \"src\/binary-reader.h\"\n#include \"src\/error-formatter.h\"\n#include \"src\/error.h\"\n#include \"src\/interp\/binary-reader-interp.h\"\n\nnamespace oak {\n\n\/\/ From https:\/\/github.com\/WebAssembly\/wabt\/blob\/master\/src\/tools\/wasm-interp.cc .\n\nstatic std::unique_ptr<wabt::FileStream> s_log_stream = wabt::FileStream::CreateStdout();\nstatic std::unique_ptr<wabt::FileStream> s_stdout_stream = wabt::FileStream::CreateStdout();\n\nstatic absl::Span<const char> ReadMemory(wabt::interp::Environment* env, const uint32_t offset,\n const uint32_t size) {\n return absl::MakeConstSpan(env->GetMemory(0)->data).subspan(offset, size);\n}\n\nstatic const std::string ReadString(wabt::interp::Environment* env, const uint32_t offset,\n const uint32_t size) {\n absl::Span<const char> memory = ReadMemory(env, offset, size);\n return std::string(memory.cbegin(), memory.cend());\n}\n\nstatic void WriteMemory(wabt::interp::Environment* env, const uint32_t offset,\n const absl::Span<const char> data) {\n std::copy(data.cbegin(), data.cend(), env->GetMemory(0)->data.begin() + offset);\n}\n\n\/\/ Creates a TypedValue of type i64 with the specified inner value.\nstatic wabt::interp::TypedValue MakeI64(uint64_t v) {\n wabt::interp::TypedValue tv(wabt::Type::I64);\n tv.set_i64(v);\n return tv;\n}\n\nstatic void LogHostFunctionCall(const wabt::interp::HostFunc* func,\n const wabt::interp::TypedValues& args) {\n LOG(INFO) << \"Called host function: \" << func->module_name << \".\" << func->field_name;\n for (auto const& arg : args) {\n LOG(INFO) << \"Arg: \" << wabt::interp::TypedValueToString(arg);\n }\n}\n\nstatic wabt::Result ReadModule(const std::string module_bytes, wabt::interp::Environment* env,\n wabt::Errors* errors, wabt::interp::DefinedModule** out_module) {\n LOG(INFO) << \"Reading module\";\n wabt::Result result;\n\n *out_module = nullptr;\n\n wabt::Features s_features;\n const bool kReadDebugNames = true;\n const bool kStopOnFirstError = true;\n const bool kFailOnCustomSectionError = true;\n wabt::Stream* log_stream = nullptr;\n wabt::ReadBinaryOptions options(s_features, log_stream, kReadDebugNames, kStopOnFirstError,\n kFailOnCustomSectionError);\n\n result = wabt::ReadBinaryInterp(env, module_bytes.data(), module_bytes.size(), options, errors,\n out_module);\n\n if (Succeeded(result)) {\n \/\/ env->DisassembleModule(s_stdout_stream.get(), *out_module);\n }\n\n return result;\n}\n\n\/\/ Describes an expected export from an Oak module.\nstruct RequiredExport {\n std::string name_;\n bool mandatory_;\n wabt::interp::FuncSignature sig_;\n};\n\n} \/\/ namespace oak\n\nstd::ostream& operator<<(std::ostream& os, const oak::RequiredExport& r) {\n return os << (r.mandatory_ ? \"required\" : \"optional\") << \" export '\" << r.name_\n << \"' with signature \" << &r.sig_;\n}\n\nnamespace oak {\n\nconst RequiredExport kRequiredExports[] = {\n {\"oak_initialize\", true, {}},\n {\"oak_handle_grpc_call\", true, {}},\n {\"oak_finalize\", false, {}},\n};\n\n\/\/ Check module exports all required functions with the correct signatures,\n\/\/ returning true if so.\nstatic bool CheckModuleExport(wabt::interp::Environment* env, wabt::interp::DefinedModule* module,\n const RequiredExport& req) {\n LOG(INFO) << \"check for \" << req;\n wabt::interp::Export* exp = module->GetExport(req.name_);\n if (exp == nullptr) {\n if (req.mandatory_) {\n LOG(WARNING) << \"Could not find required export '\" << req.name_ << \"' in module\";\n return false;\n }\n LOG(INFO) << \"optional import '\" << req.name_ << \"' missing\";\n return true;\n }\n if (exp->kind != wabt::ExternalKind::Func) {\n LOG(WARNING) << \"Required export of kind \" << exp->kind << \" not func in module\";\n return false;\n }\n LOG(INFO) << \"check signature of function #\" << exp->index;\n wabt::interp::Func* func = env->GetFunc(exp->index);\n if (func == nullptr) {\n LOG(WARNING) << \"failed to retrieve function #\" << exp->index;\n return false;\n }\n if (func->sig_index >= env->GetFuncSignatureCount()) {\n LOG(WARNING) << \"Function #\" << func->sig_index << \" beyond range of signature types\";\n return false;\n }\n wabt::interp::FuncSignature* sig = env->GetFuncSignature(func->sig_index);\n if (sig == nullptr) {\n LOG(WARNING) << \"Could not find signature for function #\" << exp->index;\n return false;\n }\n LOG(INFO) << \"function #\" << exp->index << \" has type #\" << func->sig_index << \" with signature \"\n << *sig;\n if ((sig->param_types != req.sig_.param_types) || (sig->result_types != req.sig_.result_types)) {\n LOG(WARNING) << \"Function signature mismatch for \" << req.name_ << \": got \" << *sig << \", want \"\n << req.sig_;\n return false;\n }\n return true;\n}\nstatic bool CheckModuleExports(wabt::interp::Environment* env,\n wabt::interp::DefinedModule* module) {\n bool rc = true;\n for (const RequiredExport& req : kRequiredExports) {\n if (!CheckModuleExport(env, module, req)) {\n rc = false;\n }\n }\n return rc;\n}\n\nstd::string Sha256Hash(const std::string& data) {\n SHA256_CTX context;\n SHA256_Init(&context);\n SHA256_Update(&context, data.data(), data.size());\n std::vector<uint8_t> hash(SHA256_DIGEST_LENGTH);\n SHA256_Final(hash.data(), &context);\n return std::string(hash.cbegin(), hash.cend());\n}\n\nOakNode::OakNode(const std::string& node_id, const std::string& module)\n : Service(), node_id_(node_id), module_hash_sha_256_(Sha256Hash(module)) {}\n\nstd::unique_ptr<OakNode> OakNode::Create(const std::string& node_id, const std::string& module) {\n LOG(INFO) << \"Creating Oak Node\";\n\n std::unique_ptr<OakNode> node = absl::WrapUnique(new OakNode(node_id, module));\n node->InitEnvironment(&node->env_);\n LOG(INFO) << \"Host func count: \" << node->env_.GetFuncCount();\n\n wabt::Errors errors;\n LOG(INFO) << \"Reading module\";\n wabt::Result result = ReadModule(module, &node->env_, &errors, &node->module_);\n if (!wabt::Succeeded(result)) {\n LOG(WARNING) << \"Could not read module: \" << result;\n LOG(WARNING) << \"Errors: \" << wabt::FormatErrorsToString(errors, wabt::Location::Type::Binary);\n return nullptr;\n }\n\n LOG(INFO) << \"Reading module done\";\n if (!CheckModuleExports(&node->env_, node->module_)) {\n LOG(WARNING) << \"Failed to validate module\";\n return nullptr;\n }\n\n wabt::interp::Thread::Options thread_options;\n \/\/ wabt::Stream* trace_stream = s_stdout_stream.get();\n wabt::Stream* trace_stream = nullptr;\n wabt::interp::Executor executor(&node->env_, trace_stream, thread_options);\n LOG(INFO) << \"Executing module\";\n\n \/\/ Create a logging channel to allow the module to log during initialization.\n std::unique_ptr<Channel> logging_channel = absl::make_unique<LoggingChannel>();\n node->channels_[LOGGING_CHANNEL_HANDLE] = std::move(logging_channel);\n LOG(INFO) << \"Created logging channel\";\n\n wabt::interp::TypedValues args;\n wabt::interp::ExecResult exec_result =\n executor.RunExportByName(node->module_, \"oak_initialize\", args);\n\n \/\/ Drop all channels used in the current invocation.\n node->channels_ = std::unordered_map<Handle, std::unique_ptr<Channel>>();\n\n if (exec_result.result != wabt::interp::Result::Ok) {\n LOG(WARNING) << \"Could not execute module\";\n wabt::interp::WriteResult(s_stdout_stream.get(), \"error\", exec_result.result);\n \/\/ TODO: Print error.\n return nullptr;\n }\n\n LOG(INFO) << \"Executed module\";\n return node;\n}\n\n\/\/ Register all available host functions so that they are available to the Oak Module at runtime.\nvoid OakNode::InitEnvironment(wabt::interp::Environment* env) {\n wabt::interp::HostModule* oak_module = env->AppendHostModule(\"oak\");\n oak_module->AppendFuncExport(\n \"channel_read\",\n wabt::interp::FuncSignature(\n std::vector<wabt::Type>{wabt::Type::I64, wabt::Type::I32, wabt::Type::I32},\n std::vector<wabt::Type>{wabt::Type::I32}),\n this->OakChannelRead(env));\n oak_module->AppendFuncExport(\n \"channel_write\",\n wabt::interp::FuncSignature(\n std::vector<wabt::Type>{wabt::Type::I64, wabt::Type::I32, wabt::Type::I32},\n std::vector<wabt::Type>{wabt::Type::I32}),\n this->OakChannelWrite(env));\n}\n\nwabt::interp::HostFunc::Callback OakNode::OakChannelRead(wabt::interp::Environment* env) {\n return [this, env](const wabt::interp::HostFunc* func, const wabt::interp::FuncSignature* sig,\n const wabt::interp::TypedValues& args, wabt::interp::TypedValues& results) {\n LogHostFunctionCall(func, args);\n\n Handle channel_handle = args[0].get_i64();\n uint32_t offset = args[1].get_i32();\n uint32_t size = args[2].get_i32();\n\n if (channels_.count(channel_handle) == 0) {\n LOG(WARNING) << \"Invalid channel handle: \" << channel_handle;\n return wabt::interp::Result::Ok;\n }\n std::unique_ptr<Channel>& channel = channels_.at(channel_handle);\n\n absl::Span<const char> data = channel->Read(size);\n WriteMemory(env, offset, data);\n results[0].set_i32(data.size());\n\n return wabt::interp::Result::Ok;\n };\n}\n\nwabt::interp::HostFunc::Callback OakNode::OakChannelWrite(wabt::interp::Environment* env) {\n return [this, env](const wabt::interp::HostFunc* func, const wabt::interp::FuncSignature* sig,\n const wabt::interp::TypedValues& args, wabt::interp::TypedValues& results) {\n LogHostFunctionCall(func, args);\n\n Handle channel_handle = args[0].get_i64();\n uint32_t offset = args[1].get_i32();\n uint32_t size = args[2].get_i32();\n\n if (channels_.count(channel_handle) == 0) {\n LOG(WARNING) << \"Invalid channel handle: \" << channel_handle;\n return wabt::interp::Result::Ok;\n }\n std::unique_ptr<Channel>& channel = channels_.at(channel_handle);\n\n absl::Span<const char> data = ReadMemory(env, offset, size);\n channel->Write(data);\n results[0].set_i32(data.size());\n\n return wabt::interp::Result::Ok;\n };\n}\n\ngrpc::Status OakNode::ProcessModuleInvocation(grpc::GenericServerContext* context,\n const std::vector<char>& request_data,\n std::vector<char>* response_data) {\n LOG(INFO) << \"Handling gRPC call: \" << context->method();\n server_context_ = context;\n\n \/\/ Store a copy of the gRPC method name so that we can refer to it via a Span when the Module\n \/\/ tries to read it from a channel; otherwise we would need to allocate a new string every time\n \/\/ and ensure it can outlive the Span reference.\n grpc_method_name_ = context->method();\n\n \/\/ Create the gRPC channel, used by the module to perform basic input and output.\n std::unique_ptr<Channel> grpc_channel =\n absl::make_unique<BufferChannel>(request_data, response_data);\n channels_[GRPC_CHANNEL_HANDLE] = std::move(grpc_channel);\n LOG(INFO) << \"Created gRPC channel\";\n\n \/\/ Create the gRPC method name channel, used by the module to read the gRPC method name from the\n \/\/ current context.\n std::unique_ptr<Channel> grpc_method_name_channel =\n absl::make_unique<BufferChannel>(grpc_method_name_, nullptr);\n channels_[GRPC_METHOD_NAME_CHANNEL_HANDLE] = std::move(grpc_method_name_channel);\n LOG(INFO) << \"Created gRPC method name channel\";\n\n \/\/ Create the logging channel, used by the module to log statements for debugging.\n std::unique_ptr<Channel> logging_channel = absl::make_unique<LoggingChannel>();\n channels_[LOGGING_CHANNEL_HANDLE] = std::move(logging_channel);\n LOG(INFO) << \"Created logging channel\";\n\n wabt::Stream* trace_stream = nullptr;\n wabt::interp::Thread::Options thread_options;\n wabt::interp::Executor executor(&env_, trace_stream, thread_options);\n\n wabt::interp::TypedValues args = {};\n wabt::interp::ExecResult exec_result =\n executor.RunExportByName(module_, \"oak_handle_grpc_call\", args);\n\n \/\/ Drop all the channels used in the current invocation.\n channels_ = std::unordered_map<Handle, std::unique_ptr<Channel>>();\n\n if (exec_result.result != wabt::interp::Result::Ok) {\n std::string err = wabt::interp::ResultToString(exec_result.result);\n LOG(ERROR) << \"Could not handle gRPC call: \" << err;\n return grpc::Status(grpc::StatusCode::INTERNAL, err);\n }\n return grpc::Status::OK;\n}\n\ngrpc::Status OakNode::GetAttestation(grpc::ServerContext* context,\n const GetAttestationRequest* request,\n GetAttestationResponse* response) {\n response->set_module_hash_sha_256(module_hash_sha_256_);\n return ::grpc::Status::OK;\n}\n\n} \/\/ namespace oak\n<commit_msg>Drop unused C++ function oak::ReadString<commit_after>\/*\n * Copyright 2018 The Project Oak Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"oak\/server\/oak_node.h\"\n\n#include <openssl\/sha.h>\n\n#include <iostream>\n#include <utility>\n\n#include \"absl\/memory\/memory.h\"\n#include \"asylo\/util\/logging.h\"\n#include \"oak\/server\/buffer_channel.h\"\n#include \"oak\/server\/logging_channel.h\"\n#include \"oak\/server\/wabt_output.h\"\n#include \"src\/binary-reader.h\"\n#include \"src\/error-formatter.h\"\n#include \"src\/error.h\"\n#include \"src\/interp\/binary-reader-interp.h\"\n\nnamespace oak {\n\n\/\/ From https:\/\/github.com\/WebAssembly\/wabt\/blob\/master\/src\/tools\/wasm-interp.cc .\n\nstatic std::unique_ptr<wabt::FileStream> s_log_stream = wabt::FileStream::CreateStdout();\nstatic std::unique_ptr<wabt::FileStream> s_stdout_stream = wabt::FileStream::CreateStdout();\n\nstatic absl::Span<const char> ReadMemory(wabt::interp::Environment* env, const uint32_t offset,\n const uint32_t size) {\n return absl::MakeConstSpan(env->GetMemory(0)->data).subspan(offset, size);\n}\n\nstatic void WriteMemory(wabt::interp::Environment* env, const uint32_t offset,\n const absl::Span<const char> data) {\n std::copy(data.cbegin(), data.cend(), env->GetMemory(0)->data.begin() + offset);\n}\n\n\/\/ Creates a TypedValue of type i64 with the specified inner value.\nstatic wabt::interp::TypedValue MakeI64(uint64_t v) {\n wabt::interp::TypedValue tv(wabt::Type::I64);\n tv.set_i64(v);\n return tv;\n}\n\nstatic void LogHostFunctionCall(const wabt::interp::HostFunc* func,\n const wabt::interp::TypedValues& args) {\n LOG(INFO) << \"Called host function: \" << func->module_name << \".\" << func->field_name;\n for (auto const& arg : args) {\n LOG(INFO) << \"Arg: \" << wabt::interp::TypedValueToString(arg);\n }\n}\n\nstatic wabt::Result ReadModule(const std::string module_bytes, wabt::interp::Environment* env,\n wabt::Errors* errors, wabt::interp::DefinedModule** out_module) {\n LOG(INFO) << \"Reading module\";\n wabt::Result result;\n\n *out_module = nullptr;\n\n wabt::Features s_features;\n const bool kReadDebugNames = true;\n const bool kStopOnFirstError = true;\n const bool kFailOnCustomSectionError = true;\n wabt::Stream* log_stream = nullptr;\n wabt::ReadBinaryOptions options(s_features, log_stream, kReadDebugNames, kStopOnFirstError,\n kFailOnCustomSectionError);\n\n result = wabt::ReadBinaryInterp(env, module_bytes.data(), module_bytes.size(), options, errors,\n out_module);\n\n if (Succeeded(result)) {\n \/\/ env->DisassembleModule(s_stdout_stream.get(), *out_module);\n }\n\n return result;\n}\n\n\/\/ Describes an expected export from an Oak module.\nstruct RequiredExport {\n std::string name_;\n bool mandatory_;\n wabt::interp::FuncSignature sig_;\n};\n\n} \/\/ namespace oak\n\nstd::ostream& operator<<(std::ostream& os, const oak::RequiredExport& r) {\n return os << (r.mandatory_ ? \"required\" : \"optional\") << \" export '\" << r.name_\n << \"' with signature \" << &r.sig_;\n}\n\nnamespace oak {\n\nconst RequiredExport kRequiredExports[] = {\n {\"oak_initialize\", true, {}},\n {\"oak_handle_grpc_call\", true, {}},\n {\"oak_finalize\", false, {}},\n};\n\n\/\/ Check module exports all required functions with the correct signatures,\n\/\/ returning true if so.\nstatic bool CheckModuleExport(wabt::interp::Environment* env, wabt::interp::DefinedModule* module,\n const RequiredExport& req) {\n LOG(INFO) << \"check for \" << req;\n wabt::interp::Export* exp = module->GetExport(req.name_);\n if (exp == nullptr) {\n if (req.mandatory_) {\n LOG(WARNING) << \"Could not find required export '\" << req.name_ << \"' in module\";\n return false;\n }\n LOG(INFO) << \"optional import '\" << req.name_ << \"' missing\";\n return true;\n }\n if (exp->kind != wabt::ExternalKind::Func) {\n LOG(WARNING) << \"Required export of kind \" << exp->kind << \" not func in module\";\n return false;\n }\n LOG(INFO) << \"check signature of function #\" << exp->index;\n wabt::interp::Func* func = env->GetFunc(exp->index);\n if (func == nullptr) {\n LOG(WARNING) << \"failed to retrieve function #\" << exp->index;\n return false;\n }\n if (func->sig_index >= env->GetFuncSignatureCount()) {\n LOG(WARNING) << \"Function #\" << func->sig_index << \" beyond range of signature types\";\n return false;\n }\n wabt::interp::FuncSignature* sig = env->GetFuncSignature(func->sig_index);\n if (sig == nullptr) {\n LOG(WARNING) << \"Could not find signature for function #\" << exp->index;\n return false;\n }\n LOG(INFO) << \"function #\" << exp->index << \" has type #\" << func->sig_index << \" with signature \"\n << *sig;\n if ((sig->param_types != req.sig_.param_types) || (sig->result_types != req.sig_.result_types)) {\n LOG(WARNING) << \"Function signature mismatch for \" << req.name_ << \": got \" << *sig << \", want \"\n << req.sig_;\n return false;\n }\n return true;\n}\nstatic bool CheckModuleExports(wabt::interp::Environment* env,\n wabt::interp::DefinedModule* module) {\n bool rc = true;\n for (const RequiredExport& req : kRequiredExports) {\n if (!CheckModuleExport(env, module, req)) {\n rc = false;\n }\n }\n return rc;\n}\n\nstd::string Sha256Hash(const std::string& data) {\n SHA256_CTX context;\n SHA256_Init(&context);\n SHA256_Update(&context, data.data(), data.size());\n std::vector<uint8_t> hash(SHA256_DIGEST_LENGTH);\n SHA256_Final(hash.data(), &context);\n return std::string(hash.cbegin(), hash.cend());\n}\n\nOakNode::OakNode(const std::string& node_id, const std::string& module)\n : Service(), node_id_(node_id), module_hash_sha_256_(Sha256Hash(module)) {}\n\nstd::unique_ptr<OakNode> OakNode::Create(const std::string& node_id, const std::string& module) {\n LOG(INFO) << \"Creating Oak Node\";\n\n std::unique_ptr<OakNode> node = absl::WrapUnique(new OakNode(node_id, module));\n node->InitEnvironment(&node->env_);\n LOG(INFO) << \"Host func count: \" << node->env_.GetFuncCount();\n\n wabt::Errors errors;\n LOG(INFO) << \"Reading module\";\n wabt::Result result = ReadModule(module, &node->env_, &errors, &node->module_);\n if (!wabt::Succeeded(result)) {\n LOG(WARNING) << \"Could not read module: \" << result;\n LOG(WARNING) << \"Errors: \" << wabt::FormatErrorsToString(errors, wabt::Location::Type::Binary);\n return nullptr;\n }\n\n LOG(INFO) << \"Reading module done\";\n if (!CheckModuleExports(&node->env_, node->module_)) {\n LOG(WARNING) << \"Failed to validate module\";\n return nullptr;\n }\n\n wabt::interp::Thread::Options thread_options;\n \/\/ wabt::Stream* trace_stream = s_stdout_stream.get();\n wabt::Stream* trace_stream = nullptr;\n wabt::interp::Executor executor(&node->env_, trace_stream, thread_options);\n LOG(INFO) << \"Executing module\";\n\n \/\/ Create a logging channel to allow the module to log during initialization.\n std::unique_ptr<Channel> logging_channel = absl::make_unique<LoggingChannel>();\n node->channels_[LOGGING_CHANNEL_HANDLE] = std::move(logging_channel);\n LOG(INFO) << \"Created logging channel\";\n\n wabt::interp::TypedValues args;\n wabt::interp::ExecResult exec_result =\n executor.RunExportByName(node->module_, \"oak_initialize\", args);\n\n \/\/ Drop all channels used in the current invocation.\n node->channels_ = std::unordered_map<Handle, std::unique_ptr<Channel>>();\n\n if (exec_result.result != wabt::interp::Result::Ok) {\n LOG(WARNING) << \"Could not execute module\";\n wabt::interp::WriteResult(s_stdout_stream.get(), \"error\", exec_result.result);\n \/\/ TODO: Print error.\n return nullptr;\n }\n\n LOG(INFO) << \"Executed module\";\n return node;\n}\n\n\/\/ Register all available host functions so that they are available to the Oak Module at runtime.\nvoid OakNode::InitEnvironment(wabt::interp::Environment* env) {\n wabt::interp::HostModule* oak_module = env->AppendHostModule(\"oak\");\n oak_module->AppendFuncExport(\n \"channel_read\",\n wabt::interp::FuncSignature(\n std::vector<wabt::Type>{wabt::Type::I64, wabt::Type::I32, wabt::Type::I32},\n std::vector<wabt::Type>{wabt::Type::I32}),\n this->OakChannelRead(env));\n oak_module->AppendFuncExport(\n \"channel_write\",\n wabt::interp::FuncSignature(\n std::vector<wabt::Type>{wabt::Type::I64, wabt::Type::I32, wabt::Type::I32},\n std::vector<wabt::Type>{wabt::Type::I32}),\n this->OakChannelWrite(env));\n}\n\nwabt::interp::HostFunc::Callback OakNode::OakChannelRead(wabt::interp::Environment* env) {\n return [this, env](const wabt::interp::HostFunc* func, const wabt::interp::FuncSignature* sig,\n const wabt::interp::TypedValues& args, wabt::interp::TypedValues& results) {\n LogHostFunctionCall(func, args);\n\n Handle channel_handle = args[0].get_i64();\n uint32_t offset = args[1].get_i32();\n uint32_t size = args[2].get_i32();\n\n if (channels_.count(channel_handle) == 0) {\n LOG(WARNING) << \"Invalid channel handle: \" << channel_handle;\n return wabt::interp::Result::Ok;\n }\n std::unique_ptr<Channel>& channel = channels_.at(channel_handle);\n\n absl::Span<const char> data = channel->Read(size);\n WriteMemory(env, offset, data);\n results[0].set_i32(data.size());\n\n return wabt::interp::Result::Ok;\n };\n}\n\nwabt::interp::HostFunc::Callback OakNode::OakChannelWrite(wabt::interp::Environment* env) {\n return [this, env](const wabt::interp::HostFunc* func, const wabt::interp::FuncSignature* sig,\n const wabt::interp::TypedValues& args, wabt::interp::TypedValues& results) {\n LogHostFunctionCall(func, args);\n\n Handle channel_handle = args[0].get_i64();\n uint32_t offset = args[1].get_i32();\n uint32_t size = args[2].get_i32();\n\n if (channels_.count(channel_handle) == 0) {\n LOG(WARNING) << \"Invalid channel handle: \" << channel_handle;\n return wabt::interp::Result::Ok;\n }\n std::unique_ptr<Channel>& channel = channels_.at(channel_handle);\n\n absl::Span<const char> data = ReadMemory(env, offset, size);\n channel->Write(data);\n results[0].set_i32(data.size());\n\n return wabt::interp::Result::Ok;\n };\n}\n\ngrpc::Status OakNode::ProcessModuleInvocation(grpc::GenericServerContext* context,\n const std::vector<char>& request_data,\n std::vector<char>* response_data) {\n LOG(INFO) << \"Handling gRPC call: \" << context->method();\n server_context_ = context;\n\n \/\/ Store a copy of the gRPC method name so that we can refer to it via a Span when the Module\n \/\/ tries to read it from a channel; otherwise we would need to allocate a new string every time\n \/\/ and ensure it can outlive the Span reference.\n grpc_method_name_ = context->method();\n\n \/\/ Create the gRPC channel, used by the module to perform basic input and output.\n std::unique_ptr<Channel> grpc_channel =\n absl::make_unique<BufferChannel>(request_data, response_data);\n channels_[GRPC_CHANNEL_HANDLE] = std::move(grpc_channel);\n LOG(INFO) << \"Created gRPC channel\";\n\n \/\/ Create the gRPC method name channel, used by the module to read the gRPC method name from the\n \/\/ current context.\n std::unique_ptr<Channel> grpc_method_name_channel =\n absl::make_unique<BufferChannel>(grpc_method_name_, nullptr);\n channels_[GRPC_METHOD_NAME_CHANNEL_HANDLE] = std::move(grpc_method_name_channel);\n LOG(INFO) << \"Created gRPC method name channel\";\n\n \/\/ Create the logging channel, used by the module to log statements for debugging.\n std::unique_ptr<Channel> logging_channel = absl::make_unique<LoggingChannel>();\n channels_[LOGGING_CHANNEL_HANDLE] = std::move(logging_channel);\n LOG(INFO) << \"Created logging channel\";\n\n wabt::Stream* trace_stream = nullptr;\n wabt::interp::Thread::Options thread_options;\n wabt::interp::Executor executor(&env_, trace_stream, thread_options);\n\n wabt::interp::TypedValues args = {};\n wabt::interp::ExecResult exec_result =\n executor.RunExportByName(module_, \"oak_handle_grpc_call\", args);\n\n \/\/ Drop all the channels used in the current invocation.\n channels_ = std::unordered_map<Handle, std::unique_ptr<Channel>>();\n\n if (exec_result.result != wabt::interp::Result::Ok) {\n std::string err = wabt::interp::ResultToString(exec_result.result);\n LOG(ERROR) << \"Could not handle gRPC call: \" << err;\n return grpc::Status(grpc::StatusCode::INTERNAL, err);\n }\n return grpc::Status::OK;\n}\n\ngrpc::Status OakNode::GetAttestation(grpc::ServerContext* context,\n const GetAttestationRequest* request,\n GetAttestationResponse* response) {\n response->set_module_hash_sha_256(module_hash_sha_256_);\n return ::grpc::Status::OK;\n}\n\n} \/\/ namespace oak\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: atomicContactEnergy.C,v 1.4 2003\/05\/06 20:27:38 oliver Exp $\n\/\/\n\n#include <BALL\/ENERGY\/atomicContactEnergy.h>\n\n#include <BALL\/common.h>\n#include <BALL\/SYSTEM\/file.h>\n#include <BALL\/SYSTEM\/path.h>\n#include <BALL\/DATATYPE\/hashGrid.h>\n#include <BALL\/DATATYPE\/string.h>\n#include <BALL\/DATATYPE\/stringHashMap.h>\n#include <BALL\/MATHS\/vector3.h>\n#include <BALL\/STRUCTURE\/geometricProperties.h>\n#include <BALL\/KERNEL\/atom.h>\n#include <BALL\/KERNEL\/atomContainer.h>\n\n#define ACE_FILENAME \"energy\/AtomicContactEnergy.dat\"\n#define ACE_TYPES_FILENAME \"energy\/ACE_types.dat\"\n\n\/\/ #define BALL_DEBUG_ACE\n\nusing namespace std;\n\nnamespace BALL \n{\n\n\tStringHashMap<Atom::Type> buildTable_()\n\t{\n\t\tFile\t\t\t\tdatafile;\n\t\tString\t\t\tresidue;\n\t\tString\t\t\tatom_name;\n\t\tAtom::Type\tatom_type;\n\n\t\t\/\/ determine the path to the data file\n\t\tPath path;\n\t\tString filename = path.find(ACE_TYPES_FILENAME);\n\t\tif (filename == \"\")\n\t\t{\n\t\t\tthrow Exception::FileNotFound(__FILE__, __LINE__, ACE_TYPES_FILENAME);\n\t\t}\n\n\t\tdatafile.open(filename);\n\n\t\t\/\/ create a new StringHashMap\n\t\tStringHashMap<Atom::Type> table;\n\n\t\twhile (datafile.good())\n\t\t{\n\t\t\tdatafile >> residue >> atom_name >> atom_type;\n\t\t\tString key(residue);\n\t\t\tkey.append(\":\");\n\t\t\tkey.append(atom_name);\n\t\t\ttable[key] = atom_type;\n\t\t}\n\t\t\t\t\t\n\t\tdatafile.close();\n\n\t\treturn table;\n\t}\n\n\ttypedef struct \n\t{\n\t\tIndex\t\t\t\t\ttype;\n\t\tVector3\t\t\tv;\n\t\tunsigned\t\tindex;\n\t\tString\t\t\tname;\n\t\tconst Atom*\tatom;\n\t} ACEFastAtomType_;\n\n\n\tdouble calculateACE(AtomContainer& atoms) \n\t{\n\t\t \n\t\tVector3\t\t\t\t\t\t\t\t\t\tbounding_box_lower;\t\n\t\tVector3\t\t\t\t\t\t\t\t\t\tbounding_box_upper;\n\t\tVector3\t\t\t\t\t\t\t\t\t\tsize;\n\n\t\tStringHashMap<Atom::Type>\ttable;\n\t\tfloat\t\t\t\t\t\t\t\t\t\t\tACE[18][18];\n\t\tFILE*\t\t\t\t\t\t\t\t\t\t\tACE_file;\n\t\tIndex\t\t\t\t\t\t\t\t\t\t\t\ti;\n\t\tIndex\t\t\t\t\t\t\t\t\t\t\t\tj;\n\n\t\ttable = buildTable_();\n\n\t\tPath path;\n\t\tString filename = path.find(ACE_FILENAME);\n\t\tif (filename == \"\")\n\t\t{\n\t\t\tthrow Exception::FileNotFound(__FILE__, __LINE__, ACE_FILENAME);\n\t\t}\n\t\tACE_file = fopen(filename.c_str(), \"r\");\n\t\t\t\t\t\n\t\tfor (i = 0; i < 18; i++)\n\t\t{\n\t\t\tfor (j = 0; j < 18; j++)\n\t\t\t{\n\t\t\t\tfscanf(ACE_file, \"%f\", &(ACE[i][j]));\n\t\t\t}\n\t\t}\n\t\tfclose(ACE_file);\n\t\t\n\t\t\/\/ perform consistency check: matrix has to be symmetric\n\t\tfor (i = 0; i < 18; i++)\n\t\t{\n\t\t\tfor (j = i; j < 18; j++)\n\t\t\t{\n\t\t\t\tif (ACE[i][j] != ACE[j][i])\n\t\t\t\t{\n\t\t\t\t\tLog.error() << \"calculateACE: inconsistent values in contact matrix: ACE[\" \n\t\t\t\t\t\t\t\t\t\t\t<< i << \"][\" << j << \"] != ACE[\" << j << \"][\" << i << \"]!\" << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\t\n\t\tBoundingBoxProcessor\tbounding_box;\n\n\t\tatoms.apply(bounding_box);\n\t\tbounding_box_lower = bounding_box.getLower();\n\t\tbounding_box_upper = bounding_box.getUpper();\n\t\t\n\t\t\t\t\n\t\tsize = bounding_box_upper - bounding_box_lower;\n\n\t\tHashGrid3<ACEFastAtomType_*>*\tgrid;\n\t\tgrid = new HashGrid3<ACEFastAtomType_*>(bounding_box_lower - Vector3(7.0), size + Vector3(14.0), 6.0);\n\n\t\tACEFastAtomType_*\t\tatom;\n\t\tString\t\t\t\t\t\t\tatom_name;\n\t\tIndex\t\t\t\t\t\t\t\t\tatom_type;\n\t\tunsigned\t\t\t\t\t\tindex = 0;\n\n\n\t\tAtomConstIterator atom_it(atoms.beginAtom());\n\t\tfor (atom_it = atoms.beginAtom(); +atom_it; ++atom_it) \n\t\t{\n\t\t\t\/\/ construct correct name, <RESNAME>:<ATOMNAME>\n\t\t\tatom_name = atom_it->getFragment()->getName().trim();\t\t\n\t\t\tatom_name.append(\":\");\n\t\t\tatom_name.append(atom_it->getName().trim());\n\n\t\t\t\/\/ get the atom type from hash table\n\t\t\t\/\/ atom type = -1 for hydrogen (not to be considered)\n\t\t\t\/\/ atom type = -2 for atoms that are not parametrized\n\t\t\t\/\/ atom type = -3 for unknown atom names\n\t\t\t\/\/\n\t\t\tif (table.has(atom_name))\n\t\t\t{\n\t\t\t\tatom_type = table[atom_name];\n\t\t\t} \n\t\t\telse \n\t\t\t{\n\t\t\t\tatom_type = -3;\n\t\t\t}\n\n\t\t\t\/\/ insert all neccessary atoms into the grid\n\t\t\tif (atom_type >= 0)\n\t\t\t{\n\t\t\t\tatom = new ACEFastAtomType_;\n\t\t\t\tatom->index = index++;\n\t\t\t\tatom->v = atom_it->getPosition();\n\t\t\t\tatom->type = atom_type;\n\t\t\t\tatom->name = atom_name;\n\t\t\t\tatom->atom = &(*atom_it);\n\t\t\t\tgrid->insert(atom->v, atom);\n\t\t\t\t\/\/ Log.error() << atom_name << \": \" << atom_type << endl;\n\t\t\t} \n\t\t\telse \n\t\t\t{\n\t\t\t\t\/\/ some types are known but not parametrized\n\t\t\t\tif (atom_type == -2)\n\t\t\t\t{\n\t\t\t\t\tLog.warn() << \"calculateACE: ACE not parametrized for \" << atom_name << endl;\n\t\t\t\t} \n\t\t\t\t\/\/ hydrogens are just to be ignored, unknown types are a \n\t\t\t\t\/\/ real reason for concern\n\t\t\t\telse if (atom_type == -3) \n\t\t\t\t{\n\t\t\t\t\tLog.warn() << \"calculateACE: did not find an ACE type for \" << atom_name << endl;\n\t\t\t\t}\n\t\t\t}\t\t\n\t\t}\n\n\t\tfloat contact_energy = 0;\n\t\tfloat\tsq_distance;\n\t\tVector3 v;\n\n\t\tHashGrid3<ACEFastAtomType_*>::BoxIterator\t\t\t\t\tbox_it;\n\t\tHashGridBox3<ACEFastAtomType_*>::DataIterator\t\t\tdata_it;\n\n\t\tHashGridBox3<ACEFastAtomType_*>::BoxIterator\t\t\tbox_it2;\n\t\tHashGridBox3<ACEFastAtomType_*>::DataIterator\t\t\tdata_it2;\n\n#ifdef BALL_DEBUG_ACE\n\t\tSize count = 0;\n\t\tAtomIterator debug_atom_it1 = atoms.beginAtom();\n\t\tAtomIterator debug_atom_it2;\n\t\tfor (; +debug_atom_it1; ++debug_atom_it1)\n\t\t{\n\t\t\tfor (debug_atom_it2 = debug_atom_it1; +debug_atom_it2; ++debug_atom_it2)\n\t\t\t{\n\t\t\t\tif ((debug_atom_it1 != debug_atom_it2)\n\t\t\t\t\t\t&& (debug_atom_it1->getPosition().getDistance(debug_atom_it2->getPosition()) <= 6.0))\n\t\t\t\t{\n\t\t\t\t\tcount++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tLog.error() << \"count(BF) = \" << count << endl;\n\t\tcount = 0;\n#endif\n\t\t\n\n\t\t\/\/ iterate over all (non empty) grid boxes\n\t\tfor (box_it = grid->beginBox(); +box_it; ++box_it)\n\t\t{\n\t\t\t\/\/ iterate over all items in the box\n\t\t\tfor (data_it = (*box_it).beginData(); +data_it; ++data_it) \n\t\t\t{\n\t\t\t\tv = (*data_it)->v;\n\n\t\t\t\t\/\/ iterate over all neighbouring boxes (includig the box itself!)\n\t\t\t\tfor (box_it2 = (*box_it).beginBox(); +box_it2; ++box_it2)\n\t\t\t\t{\n\t\t\t\t\t\/\/ iterate over all items in the box\n\t\t\t\t\tfor (data_it2 = (*box_it2).beginData(); +data_it2; ++data_it2) \n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ consider only pairs of different atoms and consider each pair only once \n\t\t\t\t\t\tif ((*data_it2)->index > (*data_it)->index)\n\t\t\t\t\t\t{\t\t\t\t\t\n\t\t\t\t\t\t\t\/\/ check whether the distance between the atoms is at most 6.0 Angstrom\n\t\t\t\t\t\t\tsq_distance = v.getSquareDistance((*data_it2)->v);\n\t\t\t\t\t\t\tif (sq_distance <= 36.0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (!(*data_it)->atom->isBoundTo(*(*data_it2)->atom))\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tcontact_energy += ACE[(*data_it)->type][(*data_it2)->type];\n#ifdef BALL_DEBUG_ACE\n\t\t\t\t\t\t\t\t\tcount++;\n#endif\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n#ifdef BALL_DEBUG_ACE\n\t\tLog.error() << \"count(BF) = \" << count << endl;\n#endif\n\n\t\t\/\/ scale by a factor of 1 \/ 21.0 to get energy in kcal\/mol\n\t\t\/\/ and another factor of 4.184 to get kJ\/mol\n\t\t\/\/ return the energy in units of kJ\/mol\n\t\treturn contact_energy \/ (21.0 \/ 4.184);\n\t}\n\n} \/\/ namespace BALL\n<commit_msg>fixed: modified implementation -- memory leaks removed<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: atomicContactEnergy.C,v 1.5 2003\/05\/07 16:41:44 oliver Exp $\n\/\/\n\n#include <BALL\/ENERGY\/atomicContactEnergy.h>\n\n#include <BALL\/common.h>\n#include <BALL\/SYSTEM\/file.h>\n#include <BALL\/SYSTEM\/path.h>\n#include <BALL\/DATATYPE\/hashGrid.h>\n#include <BALL\/DATATYPE\/string.h>\n#include <BALL\/DATATYPE\/stringHashMap.h>\n#include <BALL\/MATHS\/vector3.h>\n#include <BALL\/STRUCTURE\/geometricProperties.h>\n#include <BALL\/KERNEL\/atom.h>\n#include <BALL\/KERNEL\/atomContainer.h>\n\n#define ACE_FILENAME \"energy\/AtomicContactEnergy.dat\"\n#define ACE_TYPES_FILENAME \"energy\/ACE_types.dat\"\n\n\/\/ #define BALL_DEBUG_ACE\n\nusing namespace std;\n\nnamespace BALL \n{\n\ttypedef StringHashMap<Atom::Type>\t\t\t\t\t\t\t\tACETypeTable;\n\ttypedef std::vector<std::vector<double> >\t\t\t\tACEParameter;\n\ttypedef std::pair<ACETypeTable, ACEParameter>\t\tACEData;\n\n\t const ACEData& ACEBuildTable\n\t\t(const String& type_filename, const String& parameter_filename)\n\t{\n\t\t\/\/ A static string hash map holds the types.\n\t\tstatic ACEData data;\n\t\tstatic String last_type_filename;\n\t\tstatic String last_parameter_filename;\n\n\t\t\/\/ Check whether the last files read are identical with the\n\t\t\/\/ filenames specified. We are fine if they are identical\n\t\t\/\/ and reread everything otherwise.\n\t\tif (last_type_filename == type_filename && last_parameter_filename == parameter_filename)\n\t\t{\n\t\t\treturn data;\n\t\t}\n\n\t\t\/\/ Determine the path to the type file.\n\t\tPath path;\n\t\tString filename = path.find(type_filename);\n\t\tif (filename == \"\")\n\t\t{\n\t\t\tthrow Exception::FileNotFound(__FILE__, __LINE__, type_filename);\n\t\t}\n\n\t\t\/\/ Read the file.\n\t\tdata.first.clear();\n\t\tFile datafile(filename);\n\t\tString key;\n\t\tString atom_name;\n\t\tIndex atom_type;\n\t\twhile (datafile.good())\n\t\t{\n\t\t\tdatafile >> key >> atom_name >> atom_type;\n\t\t\tkey.append(\":\");\n\t\t\tkey.append(atom_name);\n\t\t\tdata.first[key] = atom_type;\n\t\t}\t\t\t\n\t\tdatafile.close();\n\n\t\tfilename = path.find(parameter_filename);\n\t\tif (filename == \"\")\n\t\t{\n\t\t\tthrow Exception::FileNotFound(__FILE__, __LINE__, filename);\n\t\t}\n\n\t\t\/\/ Read the parameter table.\n\t\tdatafile.open(filename);\n\t\tSize number_of_entries;\n\t\tdatafile >> number_of_entries;\n\t\t\n\t\t\/\/ Read the matrix of ACE parameters (symmetric, number_of_entries x number_of_entries)\n\t\tdata.second.resize(number_of_entries);\n\t\tfor (Position i = 0; i < number_of_entries; i++)\n\t\t{\n\t\t\tdata.second[i].resize(number_of_entries);\n\n\t\t\tfor (Position j = 0; j < number_of_entries; j++)\n\t\t\t{\n\t\t\t\tdatafile >> data.second[i][j];\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Consistency check in the matrix\n\t\tfor (Position i = 0; i < number_of_entries; i++)\n\t\t{\n\t\t\tfor (Position j = 0; j < number_of_entries; j++)\n\t\t\t{\n\t\t\t\tif (data.second[i][j] != data.second[j][i])\n\t\t\t\t{\n\t\t\t\t\tthrow Exception::ParseError(__FILE__, __LINE__, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tString(\"ACE data from \") + filename,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tString(\"inconsistent table entry at position \") + String(i) + \"\/\" + String(j));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t\t\t\n\t\t\/\/ Remember we read the files\n\t\tlast_type_filename = type_filename;\n\t\tlast_parameter_filename = parameter_filename;\n\n\t\treturn data;\n\t}\n\n\ttypedef struct \n\t{\n\t\tIndex\t\t\t\ttype;\n\t\tVector3\t\t\tv;\n\t\tPosition\t\tindex;\n\t\tString\t\t\tname;\n\t\tconst Atom*\tatom;\n\t} \n\tACEFastAtomType;\n\n\n\tdouble calculateACE\n\t\t(const AtomContainer& atom_container, \n\t\t const string& type_filename, const string& parameter_filename) \n\t{\n\t\t\/\/ Retrieve the ACE types and parameters.\n\t\t\/\/ We do this just once, unless different filenames are \n\t\t\/\/ being specified.\n\t\tconst ACEData& data = ACEBuildTable(type_filename, parameter_filename);\n\t\tconst ACETypeTable& table = data.first;\n\t\tconst ACEParameter& params = data.second;\n\n\t\t\/\/ Compute the bounding box of the atom container.\n\t\tBoundingBoxProcessor bounding_box;\n\t\tconst_cast<AtomContainer&>(atom_container).apply(bounding_box);\n\t\tVector3 size = bounding_box.getUpper() - bounding_box.getLower();\n\n\t\t\/\/ Create a three-dimensional hash grid. The border has to\n\t\t\/\/ extend by at least one box size (the max distance used by ACE) over the bounding box.\n\t\tHashGrid3<ACEFastAtomType*> grid(bounding_box.getLower() - Vector3(7.0), size + Vector3(14.0), 6.0);\n\n\t\t\/\/ Create a vector of ACEFastAtom entries. We will stick pointers \n\t\t\/\/ to those into the hash grid. It will never shrink again, but then \n\t\t\/\/ we won't have to reallocate all the time. This seems like a good \n\t\t\/\/ trade-off for now.\n\t\tstatic std::vector<ACEFastAtomType> atoms;\n\n\t\t\/\/ Remove old stuff\n\t\tatoms.clear();\n\n\t\tString atom_name;\n\t\tIndex atom_type;\n\t\tAtomConstIterator atom_it(atom_container.beginAtom());\n\t\tfor (; +atom_it; ++atom_it) \n\t\t{\n\t\t\t\/\/ construct correct name, <RESNAME>:<ATOMNAME>\n\t\t\tatom_name = atom_it->getFullName(Atom::NO_VARIANT_EXTENSIONS);\t\t\n\n\t\t\t\/\/ get the atom type from hash table\n\t\t\t\/\/ atom type = -1 for hydrogen (not to be considered)\n\t\t\t\/\/ atom type = -2 for atoms that are not parametrized\n\t\t\t\/\/ atom type = -3 for unknown atom names\n\t\t\t\/\/\n\t\t\tif (table.has(atom_name))\n\t\t\t{\n\t\t\t\tatom_type = table[atom_name];\n\t\t\t} \n\t\t\telse \n\t\t\t{\n\t\t\t\tatom_type = -3;\n\t\t\t}\n\n\t\t\t\/\/ insert all neccessary atoms into the grid\n\t\t\tif (atom_type >= 0)\n\t\t\t{\n\t\t\t\tstatic ACEFastAtomType atom;\n\t\t\t\tatom.v = atom_it->getPosition();\n\t\t\t\tatom.type = atom_type;\n\t\t\t\tatom.name = atom_name;\n\t\t\t\tatom.index = atoms.size();\n\t\t\t\tatom.atom = &*atom_it;\n\n\t\t\t\tatoms.push_back(atom);\n\t\t\t} \n\t\t\telse \n\t\t\t{\n\t\t\t\t\/\/ some types are known but not parametrized\n\t\t\t\tif (atom_type == -2)\n\t\t\t\t{\n\t\t\t\t\tLog.warn() << \"calculateACE: ACE not parametrized for \" << atom_name << endl;\n\t\t\t\t} \n\t\t\t\telse if (atom_type == -3) \n\t\t\t\t{\n\t\t\t\t\t\/\/ hydrogens are just to be ignored, unknown types are a \n\t\t\t\t\t\/\/ real reason for concern\n\t\t\t\t\tLog.warn() << \"calculateACE: did not find an ACE type for \" << atom_name << endl;\n\t\t\t\t}\n\t\t\t}\t\t\n\t\t}\n\n\t\tstd::vector<ACEFastAtomType>::iterator it(atoms.begin());\n\t\tfor (; it != atoms.end(); ++it)\n\t\t{\n\t\t\tgrid.insert(it->v, &*it);\n\t\t}\n\n\t\tdouble contact_energy = 0;\n\t\tdouble sq_distance;\n\t\tVector3 v;\n\n\t\t#ifdef BALL_DEBUG_ACE\n\t\t\tSize count = 0;\n\t\t\tAtomIterator debug_atom_it1 = atoms.beginAtom();\n\t\t\tAtomIterator debug_atom_it2;\n\t\t\tfor (; +debug_atom_it1; ++debug_atom_it1)\n\t\t\t{\n\t\t\t\tfor (debug_atom_it2 = debug_atom_it1; +debug_atom_it2; ++debug_atom_it2)\n\t\t\t\t{\n\t\t\t\t\tif ((debug_atom_it1 != debug_atom_it2)\n\t\t\t\t\t\t\t&& (debug_atom_it1->getPosition().getDistance(debug_atom_it2->getPosition()) <= 6.0))\n\t\t\t\t\t{\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tLog.error() << \"count(BF) = \" << count << endl;\n\t\t\tcount = 0;\n\t\t#endif\n\n\t\t\/\/ iterate over all (non empty) grid boxes\n\t\tHashGrid3<ACEFastAtomType*>::BoxIterator box_it(grid.beginBox());\n\t\tfor (; +box_it; ++box_it)\n\t\t{\n\t\t\tHashGridBox3<ACEFastAtomType*>::DataIterator\t\t\tdata_it;\n\t\t\tHashGridBox3<ACEFastAtomType*>::BoxIterator\t\t\t\tbox_it2;\n\t\t\tHashGridBox3<ACEFastAtomType*>::DataIterator\t\t\tdata_it2;\n\n\t\t\t\/\/ iterate over all items in the box\n\t\t\tfor (data_it = box_it->beginData(); +data_it; ++data_it) \n\t\t\t{\n\t\t\t\tv = (*data_it)->v;\n\n\t\t\t\t\/\/ iterate over all neighbouring boxes (includig the box itself!)\n\t\t\t\tfor (box_it2 = box_it->beginBox(); +box_it2; ++box_it2)\n\t\t\t\t{\n\t\t\t\t\t\/\/ iterate over all items in the box\n\t\t\t\t\tfor (data_it2 = box_it2->beginData(); +data_it2; ++data_it2) \n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ consider only pairs of different atoms and consider each pair only once \n\t\t\t\t\t\tif ((*data_it2)->index > (*data_it)->index)\n\t\t\t\t\t\t{\t\t\t\t\t\n\t\t\t\t\t\t\t\/\/ check whether the distance between the atoms is at most 6.0 Angstrom\n\t\t\t\t\t\t\tsq_distance = v.getSquareDistance((*data_it2)->v);\n\t\t\t\t\t\t\tif (sq_distance <= 36.0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (!(*data_it)->atom->isBoundTo(*(*data_it2)->atom))\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tcontact_energy += params[(*data_it)->type][(*data_it2)->type];\n\t\t\t\t\t\t\t\t\t#ifdef BALL_DEBUG_ACE\n\t\t\t\t\t\t\t\t\t\tcount++;\n\t\t\t\t\t\t\t\t\t#endif\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t#ifdef BALL_DEBUG_ACE\n\t\tLog.error() << \"count(BF) = \" << count << endl;\n\t#endif\n\n\t\t\/\/ scale by a factor of 1 \/ 21.0 to get energy in kcal\/mol\n\t\t\/\/ and another factor of 4.184 to get kJ\/mol\n\t\t\/\/ return the energy in units of kJ\/mol\n\t\treturn contact_energy \/ (21.0 \/ 4.184);\n\t}\n\n} \/\/ namespace BALL\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * Copyright 2008-2010 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\n#include <assert.h>\n#include <stdint.h>\n\n#include \"image.hpp\"\n\n\nnamespace Image {\n\n\/**\n * http:\/\/en.wikipedia.org\/wiki\/Netpbm_format\n * http:\/\/netpbm.sourceforge.net\/doc\/ppm.html\n *\/\nvoid\nImage::writePNM(std::ostream &os, const char *comment) const {\n assert(channels == 1 || channels >= 3);\n\n os << (channels == 1 ? \"P5\" : \"P6\") << \"\\n\";\n if (comment) {\n os << \"#\" << comment << \"\\n\";\n }\n os << width << \" \" << height << \"\\n\";\n os << \"255\" << \"\\n\";\n\n const unsigned char *row;\n\n if (channels == 1 || channels == 3) {\n for (row = start(); row != end(); row += stride()) {\n os.write((const char *)row, width*channels);\n }\n } else {\n unsigned char pixel[3] = {0, 0, 0};\n for (row = start(); row != end(); row += stride()) {\n for (unsigned x = 0; x < width; ++x) {\n for (unsigned channel = 0; channel < channels; ++channel) {\n pixel[channel] = row[x*channels + channel];\n }\n os.write((const char *)pixel, sizeof pixel);\n }\n }\n }\n}\n\n\n} \/* namespace Image *\/\n<commit_msg>Optimize Image::writePNM.<commit_after>\/**************************************************************************\n *\n * Copyright 2011 Jose Fonseca\n * Copyright 2008-2010 VMware, Inc.\n * All Rights Reserved.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n **************************************************************************\/\n\n\n#include <assert.h>\n#include <string.h>\n\n#include \"image.hpp\"\n\n\nnamespace Image {\n\n\/**\n * http:\/\/en.wikipedia.org\/wiki\/Netpbm_format\n * http:\/\/netpbm.sourceforge.net\/doc\/ppm.html\n *\/\nvoid\nImage::writePNM(std::ostream &os, const char *comment) const {\n assert(channels == 1 || channels >= 3);\n\n os << (channels == 1 ? \"P5\" : \"P6\") << \"\\n\";\n if (comment) {\n os << \"#\" << comment << \"\\n\";\n }\n os << width << \" \" << height << \"\\n\";\n os << \"255\" << \"\\n\";\n\n const unsigned char *row;\n\n if (channels == 1 || channels == 3) {\n for (row = start(); row != end(); row += stride()) {\n os.write((const char *)row, width*channels);\n }\n } else {\n unsigned char *pixels = new unsigned char[width*3];\n if (channels == 4) {\n for (row = start(); row != end(); row += stride()) {\n for (unsigned x = 0; x < width; ++x) {\n pixels[x*3 + 0] = row[x*4 + 0];\n pixels[x*3 + 1] = row[x*4 + 1];\n pixels[x*3 + 2] = row[x*4 + 2];\n }\n os.write((const char *)pixels, width*3);\n }\n } else if (channels == 2) {\n for (row = start(); row != end(); row += stride()) {\n for (unsigned x = 0; x < width; ++x) {\n pixels[x*3 + 0] = row[x*2 + 0];\n pixels[x*3 + 1] = row[x*2 + 1];\n pixels[x*3 + 2] = 0;\n }\n os.write((const char *)pixels, width*3);\n }\n } else {\n assert(0);\n }\n delete [] pixels;\n }\n}\n\n\n} \/* namespace Image *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\r\n\/\/\/ MMX optimized routines. All MMX optimized functions have been gathered into \r\n\/\/\/ this single source code file, regardless to their class or original source \r\n\/\/\/ code file, in order to ease porting the library to other compiler and \r\n\/\/\/ processor platforms.\r\n\/\/\/\r\n\/\/\/ The MMX-optimizations are programmed using MMX compiler intrinsics that\r\n\/\/\/ are supported both by Microsoft Visual C++ and GCC compilers, so this file\r\n\/\/\/ should compile with both toolsets.\r\n\/\/\/\r\n\/\/\/ NOTICE: If using Visual Studio 6.0, you'll need to install the \"Visual C++ \r\n\/\/\/ 6.0 processor pack\" update to support compiler intrinsic syntax. The update\r\n\/\/\/ is available for download at Microsoft Developers Network, see here:\r\n\/\/\/ http:\/\/msdn.microsoft.com\/vstudio\/downloads\/tools\/ppack\/default.aspx\r\n\/\/\/\r\n\/\/\/ Author : Copyright (c) Olli Parviainen\r\n\/\/\/ Author e-mail : oparviai 'at' iki.fi\r\n\/\/\/ SoundTouch WWW: http:\/\/www.surina.net\/soundtouch\r\n\/\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ Last changed : $Date$\r\n\/\/ File revision : $Revision: 4 $\r\n\/\/\r\n\/\/ $Id$\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License :\r\n\/\/\r\n\/\/ SoundTouch audio processing library\r\n\/\/ Copyright (c) Olli Parviainen\r\n\/\/\r\n\/\/ This library is free software; you can redistribute it and\/or\r\n\/\/ modify it under the terms of the GNU Lesser General Public\r\n\/\/ License as published by the Free Software Foundation; either\r\n\/\/ version 2.1 of the License, or (at your option) any later version.\r\n\/\/\r\n\/\/ This library is distributed in the hope that it will be useful,\r\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n\/\/ Lesser General Public License for more details.\r\n\/\/\r\n\/\/ You should have received a copy of the GNU Lesser General Public\r\n\/\/ License along with this library; if not, write to the Free Software\r\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"STTypes.h\"\r\n\r\n#ifdef ALLOW_MMX\r\n\/\/ MMX routines available only with integer sample type\r\n\r\n#if !(WIN32 || __i386__ || __x86_64__)\r\n#error \"wrong platform - this source code file is exclusively for x86 platforms\"\r\n#endif\r\n\r\nusing namespace soundtouch;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ implementation of MMX optimized functions of class 'TDStretchMMX'\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"TDStretch.h\"\r\n#include <mmintrin.h>\r\n#include <limits.h>\r\n\r\n\r\n\/\/ Calculates cross correlation of two buffers\r\nlong TDStretchMMX::calcCrossCorrStereo(const short *pV1, const short *pV2) const\r\n{\r\n const __m64 *pVec1, *pVec2;\r\n __m64 shifter;\r\n __m64 accu;\r\n long corr;\r\n uint i;\r\n \r\n pVec1 = (__m64*)pV1;\r\n pVec2 = (__m64*)pV2;\r\n\r\n shifter = _m_from_int(overlapDividerBits);\r\n accu = _mm_setzero_si64();\r\n\r\n \/\/ Process 4 parallel sets of 2 * stereo samples each during each \r\n \/\/ round to improve CPU-level parallellization.\r\n for (i = 0; i < overlapLength \/ 8; i ++)\r\n {\r\n __m64 temp;\r\n\r\n \/\/ dictionary of instructions:\r\n \/\/ _m_pmaddwd : 4*16bit multiply-add, resulting two 32bits = [a0*b0+a1*b1 ; a2*b2+a3*b3]\r\n \/\/ _mm_add_pi32 : 2*32bit add\r\n \/\/ _m_psrad : 32bit right-shift\r\n\r\n temp = _mm_add_pi32(_mm_madd_pi16(pVec1[0], pVec2[0]),\r\n _mm_madd_pi16(pVec1[1], pVec2[1]));\r\n accu = _mm_add_pi32(accu, _mm_sra_pi32(temp, shifter));\r\n\r\n temp = _mm_add_pi32(_mm_madd_pi16(pVec1[2], pVec2[2]),\r\n _mm_madd_pi16(pVec1[3], pVec2[3]));\r\n accu = _mm_add_pi32(accu, _mm_sra_pi32(temp, shifter));\r\n\r\n pVec1 += 4;\r\n pVec2 += 4;\r\n }\r\n\r\n \/\/ copy hi-dword of mm0 to lo-dword of mm1, then sum mmo+mm1\r\n \/\/ and finally store the result into the variable \"corr\"\r\n\r\n accu = _mm_add_pi32(accu, _mm_srli_si64(accu, 32));\r\n corr = _m_to_int(accu);\r\n\r\n \/\/ Clear MMS state\r\n _m_empty();\r\n\r\n return corr;\r\n \/\/ Note: Warning about the missing EMMS instruction is harmless\r\n \/\/ as it'll be called elsewhere.\r\n}\r\n\r\n\r\n\r\nvoid TDStretchMMX::clearCrossCorrState()\r\n{\r\n \/\/ Clear MMS state\r\n _m_empty();\r\n \/\/_asm EMMS;\r\n}\r\n\r\n\r\n\r\n\/\/ MMX-optimized version of the function overlapStereo\r\nvoid TDStretchMMX::overlapStereo(short *output, const short *input) const\r\n{\r\n const __m64 *pVinput, *pVMidBuf;\r\n __m64 *pVdest;\r\n __m64 mix1, mix2, adder, shifter;\r\n uint i;\r\n\r\n pVinput = (const __m64*)input;\r\n pVMidBuf = (const __m64*)pMidBuffer;\r\n pVdest = (__m64*)output;\r\n\r\n \/\/ mix1 = mixer values for 1st stereo sample\r\n \/\/ mix1 = mixer values for 2nd stereo sample\r\n \/\/ adder = adder for updating mixer values after each round\r\n \r\n mix1 = _mm_set_pi16(0, overlapLength, 0, overlapLength);\r\n adder = _mm_set_pi16(1, -1, 1, -1);\r\n mix2 = _mm_add_pi16(mix1, adder);\r\n adder = _mm_add_pi16(adder, adder);\r\n\r\n shifter = _m_from_int(overlapDividerBits);\r\n\r\n for (i = 0; i < overlapLength \/ 4; i ++)\r\n {\r\n __m64 temp1, temp2;\r\n \r\n \/\/ load & shuffle data so that input & mixbuffer data samples are paired\r\n temp1 = _mm_unpacklo_pi16(pVMidBuf[0], pVinput[0]); \/\/ = i0l m0l i0r m0r\r\n temp2 = _mm_unpackhi_pi16(pVMidBuf[0], pVinput[0]); \/\/ = i1l m1l i1r m1r\r\n\r\n \/\/ temp = (temp .* mix) >> shifter\r\n temp1 = _mm_sra_pi32(_mm_madd_pi16(temp1, mix1), shifter);\r\n temp2 = _mm_sra_pi32(_mm_madd_pi16(temp2, mix2), shifter);\r\n pVdest[0] = _mm_packs_pi32(temp1, temp2); \/\/ pack 2*2*32bit => 4*16bit\r\n\r\n \/\/ update mix += adder\r\n mix1 = _mm_add_pi16(mix1, adder);\r\n mix2 = _mm_add_pi16(mix2, adder);\r\n\r\n \/\/ --- second round begins here ---\r\n\r\n \/\/ load & shuffle data so that input & mixbuffer data samples are paired\r\n temp1 = _mm_unpacklo_pi16(pVMidBuf[1], pVinput[1]); \/\/ = i2l m2l i2r m2r\r\n temp2 = _mm_unpackhi_pi16(pVMidBuf[1], pVinput[1]); \/\/ = i3l m3l i3r m3r\r\n\r\n \/\/ temp = (temp .* mix) >> shifter\r\n temp1 = _mm_sra_pi32(_mm_madd_pi16(temp1, mix1), shifter);\r\n temp2 = _mm_sra_pi32(_mm_madd_pi16(temp2, mix2), shifter);\r\n pVdest[1] = _mm_packs_pi32(temp1, temp2); \/\/ pack 2*2*32bit => 4*16bit\r\n\r\n \/\/ update mix += adder\r\n mix1 = _mm_add_pi16(mix1, adder);\r\n mix2 = _mm_add_pi16(mix2, adder);\r\n\r\n pVinput += 2;\r\n pVMidBuf += 2;\r\n pVdest += 2;\r\n }\r\n\r\n _m_empty(); \/\/ clear MMS state\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ implementation of MMX optimized functions of class 'FIRFilter'\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"FIRFilter.h\"\r\n\r\n\r\nFIRFilterMMX::FIRFilterMMX() : FIRFilter()\r\n{\r\n filterCoeffsUnalign = NULL;\r\n}\r\n\r\n\r\nFIRFilterMMX::~FIRFilterMMX()\r\n{\r\n delete[] filterCoeffsUnalign;\r\n}\r\n\r\n\r\n\/\/ (overloaded) Calculates filter coefficients for MMX routine\r\nvoid FIRFilterMMX::setCoefficients(const short *coeffs, uint newLength, uint uResultDivFactor)\r\n{\r\n uint i;\r\n FIRFilter::setCoefficients(coeffs, newLength, uResultDivFactor);\r\n\r\n \/\/ Ensure that filter coeffs array is aligned to 16-byte boundary\r\n delete[] filterCoeffsUnalign;\r\n filterCoeffsUnalign = new short[2 * newLength + 8];\r\n filterCoeffsAlign = (short *)(((uint)filterCoeffsUnalign + 15) & -16);\r\n\r\n \/\/ rearrange the filter coefficients for mmx routines \r\n for (i = 0;i < length; i += 4) \r\n {\r\n filterCoeffsAlign[2 * i + 0] = coeffs[i + 0];\r\n filterCoeffsAlign[2 * i + 1] = coeffs[i + 2];\r\n filterCoeffsAlign[2 * i + 2] = coeffs[i + 0];\r\n filterCoeffsAlign[2 * i + 3] = coeffs[i + 2];\r\n\r\n filterCoeffsAlign[2 * i + 4] = coeffs[i + 1];\r\n filterCoeffsAlign[2 * i + 5] = coeffs[i + 3];\r\n filterCoeffsAlign[2 * i + 6] = coeffs[i + 1];\r\n filterCoeffsAlign[2 * i + 7] = coeffs[i + 3];\r\n }\r\n}\r\n\r\n\r\n\r\n\/\/ mmx-optimized version of the filter routine for stereo sound\r\nuint FIRFilterMMX::evaluateFilterStereo(short *dest, const short *src, const uint numSamples) const\r\n{\r\n \/\/ Create stack copies of the needed member variables for asm routines :\r\n uint i, j;\r\n __m64 *pVdest = (__m64*)dest;\r\n\r\n if (length < 2) return 0;\r\n\r\n for (i = 0; i < numSamples \/ 2; i ++)\r\n {\r\n __m64 accu1;\r\n __m64 accu2;\r\n const __m64 *pVsrc = (const __m64*)src;\r\n const __m64 *pVfilter = (const __m64*)filterCoeffsAlign;\r\n\r\n accu1 = accu2 = _mm_setzero_si64();\r\n for (j = 0; j < lengthDiv8 * 2; j ++)\r\n {\r\n __m64 temp1, temp2;\r\n\r\n temp1 = _mm_unpacklo_pi16(pVsrc[0], pVsrc[1]); \/\/ = l2 l0 r2 r0\r\n temp2 = _mm_unpackhi_pi16(pVsrc[0], pVsrc[1]); \/\/ = l3 l1 r3 r1\r\n\r\n accu1 = _mm_add_pi32(accu1, _mm_madd_pi16(temp1, pVfilter[0])); \/\/ += l2*f2+l0*f0 r2*f2+r0*f0\r\n accu1 = _mm_add_pi32(accu1, _mm_madd_pi16(temp2, pVfilter[1])); \/\/ += l3*f3+l1*f1 r3*f3+r1*f1\r\n\r\n temp1 = _mm_unpacklo_pi16(pVsrc[1], pVsrc[2]); \/\/ = l4 l2 r4 r2\r\n\r\n accu2 = _mm_add_pi32(accu2, _mm_madd_pi16(temp2, pVfilter[0])); \/\/ += l3*f2+l1*f0 r3*f2+r1*f0\r\n accu2 = _mm_add_pi32(accu2, _mm_madd_pi16(temp1, pVfilter[1])); \/\/ += l4*f3+l2*f1 r4*f3+r2*f1\r\n\r\n \/\/ accu1 += l2*f2+l0*f0 r2*f2+r0*f0\r\n \/\/ += l3*f3+l1*f1 r3*f3+r1*f1\r\n\r\n \/\/ accu2 += l3*f2+l1*f0 r3*f2+r1*f0\r\n \/\/ l4*f3+l2*f1 r4*f3+r2*f1\r\n\r\n pVfilter += 2;\r\n pVsrc += 2;\r\n }\r\n \/\/ accu >>= resultDivFactor\r\n accu1 = _mm_srai_pi32(accu1, resultDivFactor);\r\n accu2 = _mm_srai_pi32(accu2, resultDivFactor);\r\n\r\n \/\/ pack 2*2*32bits => 4*16 bits\r\n pVdest[0] = _mm_packs_pi32(accu1, accu2);\r\n src += 4;\r\n pVdest ++;\r\n }\r\n\r\n _m_empty(); \/\/ clear emms state\r\n\r\n return (numSamples & 0xfffffffe) - length;\r\n}\r\n\r\n#endif \/\/ ALLOW_MMX\r\n<commit_msg>Bugfix: Use 'ulong' datatype for pointer typecast for 64bit compatibility<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\/\r\n\/\/\/ MMX optimized routines. All MMX optimized functions have been gathered into \r\n\/\/\/ this single source code file, regardless to their class or original source \r\n\/\/\/ code file, in order to ease porting the library to other compiler and \r\n\/\/\/ processor platforms.\r\n\/\/\/\r\n\/\/\/ The MMX-optimizations are programmed using MMX compiler intrinsics that\r\n\/\/\/ are supported both by Microsoft Visual C++ and GCC compilers, so this file\r\n\/\/\/ should compile with both toolsets.\r\n\/\/\/\r\n\/\/\/ NOTICE: If using Visual Studio 6.0, you'll need to install the \"Visual C++ \r\n\/\/\/ 6.0 processor pack\" update to support compiler intrinsic syntax. The update\r\n\/\/\/ is available for download at Microsoft Developers Network, see here:\r\n\/\/\/ http:\/\/msdn.microsoft.com\/vstudio\/downloads\/tools\/ppack\/default.aspx\r\n\/\/\/\r\n\/\/\/ Author : Copyright (c) Olli Parviainen\r\n\/\/\/ Author e-mail : oparviai 'at' iki.fi\r\n\/\/\/ SoundTouch WWW: http:\/\/www.surina.net\/soundtouch\r\n\/\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ Last changed : $Date$\r\n\/\/ File revision : $Revision: 4 $\r\n\/\/\r\n\/\/ $Id$\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ License :\r\n\/\/\r\n\/\/ SoundTouch audio processing library\r\n\/\/ Copyright (c) Olli Parviainen\r\n\/\/\r\n\/\/ This library is free software; you can redistribute it and\/or\r\n\/\/ modify it under the terms of the GNU Lesser General Public\r\n\/\/ License as published by the Free Software Foundation; either\r\n\/\/ version 2.1 of the License, or (at your option) any later version.\r\n\/\/\r\n\/\/ This library is distributed in the hope that it will be useful,\r\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n\/\/ Lesser General Public License for more details.\r\n\/\/\r\n\/\/ You should have received a copy of the GNU Lesser General Public\r\n\/\/ License along with this library; if not, write to the Free Software\r\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"STTypes.h\"\r\n\r\n#ifdef ALLOW_MMX\r\n\/\/ MMX routines available only with integer sample type\r\n\r\n#if !(WIN32 || __i386__ || __x86_64__)\r\n#error \"wrong platform - this source code file is exclusively for x86 platforms\"\r\n#endif\r\n\r\nusing namespace soundtouch;\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ implementation of MMX optimized functions of class 'TDStretchMMX'\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"TDStretch.h\"\r\n#include <mmintrin.h>\r\n#include <limits.h>\r\n\r\n\r\n\/\/ Calculates cross correlation of two buffers\r\nlong TDStretchMMX::calcCrossCorrStereo(const short *pV1, const short *pV2) const\r\n{\r\n const __m64 *pVec1, *pVec2;\r\n __m64 shifter;\r\n __m64 accu;\r\n long corr;\r\n uint i;\r\n \r\n pVec1 = (__m64*)pV1;\r\n pVec2 = (__m64*)pV2;\r\n\r\n shifter = _m_from_int(overlapDividerBits);\r\n accu = _mm_setzero_si64();\r\n\r\n \/\/ Process 4 parallel sets of 2 * stereo samples each during each \r\n \/\/ round to improve CPU-level parallellization.\r\n for (i = 0; i < overlapLength \/ 8; i ++)\r\n {\r\n __m64 temp;\r\n\r\n \/\/ dictionary of instructions:\r\n \/\/ _m_pmaddwd : 4*16bit multiply-add, resulting two 32bits = [a0*b0+a1*b1 ; a2*b2+a3*b3]\r\n \/\/ _mm_add_pi32 : 2*32bit add\r\n \/\/ _m_psrad : 32bit right-shift\r\n\r\n temp = _mm_add_pi32(_mm_madd_pi16(pVec1[0], pVec2[0]),\r\n _mm_madd_pi16(pVec1[1], pVec2[1]));\r\n accu = _mm_add_pi32(accu, _mm_sra_pi32(temp, shifter));\r\n\r\n temp = _mm_add_pi32(_mm_madd_pi16(pVec1[2], pVec2[2]),\r\n _mm_madd_pi16(pVec1[3], pVec2[3]));\r\n accu = _mm_add_pi32(accu, _mm_sra_pi32(temp, shifter));\r\n\r\n pVec1 += 4;\r\n pVec2 += 4;\r\n }\r\n\r\n \/\/ copy hi-dword of mm0 to lo-dword of mm1, then sum mmo+mm1\r\n \/\/ and finally store the result into the variable \"corr\"\r\n\r\n accu = _mm_add_pi32(accu, _mm_srli_si64(accu, 32));\r\n corr = _m_to_int(accu);\r\n\r\n \/\/ Clear MMS state\r\n _m_empty();\r\n\r\n return corr;\r\n \/\/ Note: Warning about the missing EMMS instruction is harmless\r\n \/\/ as it'll be called elsewhere.\r\n}\r\n\r\n\r\n\r\nvoid TDStretchMMX::clearCrossCorrState()\r\n{\r\n \/\/ Clear MMS state\r\n _m_empty();\r\n \/\/_asm EMMS;\r\n}\r\n\r\n\r\n\r\n\/\/ MMX-optimized version of the function overlapStereo\r\nvoid TDStretchMMX::overlapStereo(short *output, const short *input) const\r\n{\r\n const __m64 *pVinput, *pVMidBuf;\r\n __m64 *pVdest;\r\n __m64 mix1, mix2, adder, shifter;\r\n uint i;\r\n\r\n pVinput = (const __m64*)input;\r\n pVMidBuf = (const __m64*)pMidBuffer;\r\n pVdest = (__m64*)output;\r\n\r\n \/\/ mix1 = mixer values for 1st stereo sample\r\n \/\/ mix1 = mixer values for 2nd stereo sample\r\n \/\/ adder = adder for updating mixer values after each round\r\n \r\n mix1 = _mm_set_pi16(0, overlapLength, 0, overlapLength);\r\n adder = _mm_set_pi16(1, -1, 1, -1);\r\n mix2 = _mm_add_pi16(mix1, adder);\r\n adder = _mm_add_pi16(adder, adder);\r\n\r\n shifter = _m_from_int(overlapDividerBits);\r\n\r\n for (i = 0; i < overlapLength \/ 4; i ++)\r\n {\r\n __m64 temp1, temp2;\r\n \r\n \/\/ load & shuffle data so that input & mixbuffer data samples are paired\r\n temp1 = _mm_unpacklo_pi16(pVMidBuf[0], pVinput[0]); \/\/ = i0l m0l i0r m0r\r\n temp2 = _mm_unpackhi_pi16(pVMidBuf[0], pVinput[0]); \/\/ = i1l m1l i1r m1r\r\n\r\n \/\/ temp = (temp .* mix) >> shifter\r\n temp1 = _mm_sra_pi32(_mm_madd_pi16(temp1, mix1), shifter);\r\n temp2 = _mm_sra_pi32(_mm_madd_pi16(temp2, mix2), shifter);\r\n pVdest[0] = _mm_packs_pi32(temp1, temp2); \/\/ pack 2*2*32bit => 4*16bit\r\n\r\n \/\/ update mix += adder\r\n mix1 = _mm_add_pi16(mix1, adder);\r\n mix2 = _mm_add_pi16(mix2, adder);\r\n\r\n \/\/ --- second round begins here ---\r\n\r\n \/\/ load & shuffle data so that input & mixbuffer data samples are paired\r\n temp1 = _mm_unpacklo_pi16(pVMidBuf[1], pVinput[1]); \/\/ = i2l m2l i2r m2r\r\n temp2 = _mm_unpackhi_pi16(pVMidBuf[1], pVinput[1]); \/\/ = i3l m3l i3r m3r\r\n\r\n \/\/ temp = (temp .* mix) >> shifter\r\n temp1 = _mm_sra_pi32(_mm_madd_pi16(temp1, mix1), shifter);\r\n temp2 = _mm_sra_pi32(_mm_madd_pi16(temp2, mix2), shifter);\r\n pVdest[1] = _mm_packs_pi32(temp1, temp2); \/\/ pack 2*2*32bit => 4*16bit\r\n\r\n \/\/ update mix += adder\r\n mix1 = _mm_add_pi16(mix1, adder);\r\n mix2 = _mm_add_pi16(mix2, adder);\r\n\r\n pVinput += 2;\r\n pVMidBuf += 2;\r\n pVdest += 2;\r\n }\r\n\r\n _m_empty(); \/\/ clear MMS state\r\n}\r\n\r\n\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/\r\n\/\/ implementation of MMX optimized functions of class 'FIRFilter'\r\n\/\/\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include \"FIRFilter.h\"\r\n\r\n\r\nFIRFilterMMX::FIRFilterMMX() : FIRFilter()\r\n{\r\n filterCoeffsUnalign = NULL;\r\n}\r\n\r\n\r\nFIRFilterMMX::~FIRFilterMMX()\r\n{\r\n delete[] filterCoeffsUnalign;\r\n}\r\n\r\n\r\n\/\/ (overloaded) Calculates filter coefficients for MMX routine\r\nvoid FIRFilterMMX::setCoefficients(const short *coeffs, uint newLength, uint uResultDivFactor)\r\n{\r\n uint i;\r\n FIRFilter::setCoefficients(coeffs, newLength, uResultDivFactor);\r\n\r\n \/\/ Ensure that filter coeffs array is aligned to 16-byte boundary\r\n delete[] filterCoeffsUnalign;\r\n filterCoeffsUnalign = new short[2 * newLength + 8];\r\n filterCoeffsAlign = (short *)(((ulong)filterCoeffsUnalign + 15) & -16);\r\n\r\n \/\/ rearrange the filter coefficients for mmx routines \r\n for (i = 0;i < length; i += 4) \r\n {\r\n filterCoeffsAlign[2 * i + 0] = coeffs[i + 0];\r\n filterCoeffsAlign[2 * i + 1] = coeffs[i + 2];\r\n filterCoeffsAlign[2 * i + 2] = coeffs[i + 0];\r\n filterCoeffsAlign[2 * i + 3] = coeffs[i + 2];\r\n\r\n filterCoeffsAlign[2 * i + 4] = coeffs[i + 1];\r\n filterCoeffsAlign[2 * i + 5] = coeffs[i + 3];\r\n filterCoeffsAlign[2 * i + 6] = coeffs[i + 1];\r\n filterCoeffsAlign[2 * i + 7] = coeffs[i + 3];\r\n }\r\n}\r\n\r\n\r\n\r\n\/\/ mmx-optimized version of the filter routine for stereo sound\r\nuint FIRFilterMMX::evaluateFilterStereo(short *dest, const short *src, const uint numSamples) const\r\n{\r\n \/\/ Create stack copies of the needed member variables for asm routines :\r\n uint i, j;\r\n __m64 *pVdest = (__m64*)dest;\r\n\r\n if (length < 2) return 0;\r\n\r\n for (i = 0; i < numSamples \/ 2; i ++)\r\n {\r\n __m64 accu1;\r\n __m64 accu2;\r\n const __m64 *pVsrc = (const __m64*)src;\r\n const __m64 *pVfilter = (const __m64*)filterCoeffsAlign;\r\n\r\n accu1 = accu2 = _mm_setzero_si64();\r\n for (j = 0; j < lengthDiv8 * 2; j ++)\r\n {\r\n __m64 temp1, temp2;\r\n\r\n temp1 = _mm_unpacklo_pi16(pVsrc[0], pVsrc[1]); \/\/ = l2 l0 r2 r0\r\n temp2 = _mm_unpackhi_pi16(pVsrc[0], pVsrc[1]); \/\/ = l3 l1 r3 r1\r\n\r\n accu1 = _mm_add_pi32(accu1, _mm_madd_pi16(temp1, pVfilter[0])); \/\/ += l2*f2+l0*f0 r2*f2+r0*f0\r\n accu1 = _mm_add_pi32(accu1, _mm_madd_pi16(temp2, pVfilter[1])); \/\/ += l3*f3+l1*f1 r3*f3+r1*f1\r\n\r\n temp1 = _mm_unpacklo_pi16(pVsrc[1], pVsrc[2]); \/\/ = l4 l2 r4 r2\r\n\r\n accu2 = _mm_add_pi32(accu2, _mm_madd_pi16(temp2, pVfilter[0])); \/\/ += l3*f2+l1*f0 r3*f2+r1*f0\r\n accu2 = _mm_add_pi32(accu2, _mm_madd_pi16(temp1, pVfilter[1])); \/\/ += l4*f3+l2*f1 r4*f3+r2*f1\r\n\r\n \/\/ accu1 += l2*f2+l0*f0 r2*f2+r0*f0\r\n \/\/ += l3*f3+l1*f1 r3*f3+r1*f1\r\n\r\n \/\/ accu2 += l3*f2+l1*f0 r3*f2+r1*f0\r\n \/\/ l4*f3+l2*f1 r4*f3+r2*f1\r\n\r\n pVfilter += 2;\r\n pVsrc += 2;\r\n }\r\n \/\/ accu >>= resultDivFactor\r\n accu1 = _mm_srai_pi32(accu1, resultDivFactor);\r\n accu2 = _mm_srai_pi32(accu2, resultDivFactor);\r\n\r\n \/\/ pack 2*2*32bits => 4*16 bits\r\n pVdest[0] = _mm_packs_pi32(accu1, accu2);\r\n src += 4;\r\n pVdest ++;\r\n }\r\n\r\n _m_empty(); \/\/ clear emms state\r\n\r\n return (numSamples & 0xfffffffe) - length;\r\n}\r\n\r\n#endif \/\/ ALLOW_MMX\r\n<|endoftext|>"} {"text":"<commit_before>#include <nan.h>\n#ifndef _WIN32\n# include <unistd.h>\n#endif\n\nusing namespace v8;\n\nclass MyWorker : public NanAsyncWorker {\n public:\n MyWorker(NanCallback *callback, int delay)\n : NanAsyncWorker(callback), delay(delay) {}\n ~MyWorker() {}\n\n \/\/ Executed inside the worker-thread.\n \/\/ It is not safe to access V8, or V8 data structures\n \/\/ here, so everything we need for input and output\n \/\/ should go on `this`.\n void Execute () {\n printf(\"FAUX 3\\n\");\n fflush(stdout);\n\n #ifdef _WIN32\n Sleep(delay);\n #else\n usleep(delay * 1000);\n #endif\n\n printf(\"FAUX 4\\n\");\n fflush(stdout);\n }\n\n \/\/ Executed when the async work is complete\n \/\/ this function will be run inside the main event loop\n \/\/ so it is safe to use V8 again\n void HandleOKCallback () {\n NanScope();\n\n callback->Call(0, NULL);\n }\n\n private:\n int delay;\n};\n\nNAN_METHOD(Delay) {\n NanEscapableScope();\n\n int delay = args[0].As<Number>()->IntegerValue();\n Local<Function> callback = args[1].As<Function>();\n\n printf(\"FAUX 1\\n\");\n fflush(stdout);\n\n NanCallback* nanCallback = new NanCallback(callback);\n MyWorker* worker = new MyWorker(nanCallback, delay);\n NanAsyncQueueWorker(worker);\n\n printf(\"FAUX 2\\n\");\n fflush(stdout);\n\n NanReturnUndefined();\n}\n\nvoid Init(Handle<Object> exports) {\n exports->Set(NanNew(\"delay\"), NanNew<FunctionTemplate>(Delay)->GetFunction());\n}\n\nNODE_MODULE(myaddon, Init)\n<commit_msg>occasional timing race condition<commit_after>#include <nan.h>\n#ifndef _WIN32\n# include <unistd.h>\n#endif\n\nusing namespace v8;\n\nclass MyWorker : public NanAsyncWorker {\n public:\n MyWorker(NanCallback *callback, int delay)\n : NanAsyncWorker(callback), delay(delay) {}\n ~MyWorker() {}\n\n \/\/ Executed inside the worker-thread.\n \/\/ It is not safe to access V8, or V8 data structures\n \/\/ here, so everything we need for input and output\n \/\/ should go on `this`.\n void Execute () {\n \/\/ tiny sleep prior to ensure proper print order of 2 & 3\n #ifdef _WIN32\n Sleep(10);\n #else\n usleep(10000);\n #endif\n\n printf(\"FAUX 3\\n\");\n fflush(stdout);\n\n #ifdef _WIN32\n Sleep(delay);\n #else\n usleep(delay * 1000);\n #endif\n\n printf(\"FAUX 4\\n\");\n fflush(stdout);\n }\n\n \/\/ Executed when the async work is complete\n \/\/ this function will be run inside the main event loop\n \/\/ so it is safe to use V8 again\n void HandleOKCallback () {\n NanScope();\n\n callback->Call(0, NULL);\n }\n\n private:\n int delay;\n};\n\nNAN_METHOD(Delay) {\n NanEscapableScope();\n\n int delay = args[0].As<Number>()->IntegerValue();\n Local<Function> callback = args[1].As<Function>();\n\n printf(\"FAUX 1\\n\");\n fflush(stdout);\n\n NanCallback* nanCallback = new NanCallback(callback);\n MyWorker* worker = new MyWorker(nanCallback, delay);\n NanAsyncQueueWorker(worker);\n\n printf(\"FAUX 2\\n\");\n fflush(stdout);\n\n NanReturnUndefined();\n}\n\nvoid Init(Handle<Object> exports) {\n exports->Set(NanNew(\"delay\"), NanNew<FunctionTemplate>(Delay)->GetFunction());\n}\n\nNODE_MODULE(myaddon, Init)\n<|endoftext|>"} {"text":"<commit_before>#include \"JobScheduler.h\"\r\n\r\nnamespace sf1r\r\n{\r\n\r\nJobScheduler::JobScheduler()\r\n{\r\n asynchronousWorker_ = boost::thread(\r\n &JobScheduler::runAsynchronousTasks_, this\r\n );\r\n}\r\n\r\nJobScheduler::~JobScheduler()\r\n{\r\n close();\r\n}\r\n\r\nvoid JobScheduler::close()\r\n{\r\n asynchronousWorker_.interrupt();\r\n asynchronousWorker_.join();\r\n}\r\n\r\nvoid JobScheduler::addTask(task_type task)\r\n{\r\n asynchronousTasks_.push(task);\r\n}\r\n\r\nvoid JobScheduler::runAsynchronousTasks_()\r\n{\r\n try\r\n {\r\n task_type task;\r\n while (true)\r\n {\r\n asynchronousTasks_.pop(task);\r\n task();\r\n }\r\n }\r\n catch (boost::thread_interrupted&)\r\n {\r\n return;\r\n }\r\n}\r\n\r\n}\r\n<commit_msg>when \"kill\" command is issued, if the queue in JobScheduler still contains some unprocessed tasks, to enable exit instantly, we need to add an interruption point when each task is done.<commit_after>#include \"JobScheduler.h\"\r\n\r\nnamespace sf1r\r\n{\r\n\r\nJobScheduler::JobScheduler()\r\n{\r\n asynchronousWorker_ = boost::thread(\r\n &JobScheduler::runAsynchronousTasks_, this\r\n );\r\n}\r\n\r\nJobScheduler::~JobScheduler()\r\n{\r\n close();\r\n}\r\n\r\nvoid JobScheduler::close()\r\n{\r\n asynchronousWorker_.interrupt();\r\n asynchronousWorker_.join();\r\n}\r\n\r\nvoid JobScheduler::addTask(task_type task)\r\n{\r\n asynchronousTasks_.push(task);\r\n}\r\n\r\nvoid JobScheduler::runAsynchronousTasks_()\r\n{\r\n try\r\n {\r\n task_type task;\r\n while (true)\r\n {\r\n asynchronousTasks_.pop(task);\r\n task();\r\n\r\n \/\/ terminate execution if interrupted\r\n boost::this_thread::interruption_point();\r\n }\r\n }\r\n catch (boost::thread_interrupted&)\r\n {\r\n return;\r\n }\r\n}\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <alpaka\/mem\/alloc\/Traits.hpp>\n\n#include <alpaka\/core\/Common.hpp>\n#include <alpaka\/core\/Unused.hpp>\n\n#include <boost\/align.hpp>\n\nnamespace alpaka\n{\n namespace mem\n {\n \/\/-----------------------------------------------------------------------------\n \/\/! The allocator specifics.\n namespace alloc\n {\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator.\n \/\/!\n \/\/! \\tparam TAlignment An integral constant containing the alignment.\n template<\n typename TAlignment>\n class AllocCpuBoostAligned : public concepts::Implements<ConceptMemAlloc, AllocCpuBoostAligned<TAlignment>>\n {\n };\n\n namespace traits\n {\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator memory allocation trait specialization.\n template<\n typename T,\n typename TAlignment>\n struct Alloc<\n T,\n AllocCpuBoostAligned<TAlignment>>\n {\n \/\/-----------------------------------------------------------------------------\n ALPAKA_FN_HOST static auto alloc(\n AllocCpuBoostAligned<TAlignment> const & alloc,\n std::size_t const & sizeElems)\n -> T *\n {\n alpaka::ignore_unused(alloc);\n return\n reinterpret_cast<T *>(\n boost::alignment::aligned_alloc(TAlignment::value, sizeElems * sizeof(T)));\n }\n };\n\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator memory free trait specialization.\n template<\n typename T,\n typename TAlignment>\n struct Free<\n T,\n AllocCpuBoostAligned<TAlignment>>\n {\n \/\/-----------------------------------------------------------------------------\n ALPAKA_FN_HOST static auto free(\n AllocCpuBoostAligned<TAlignment> const & alloc,\n T const * const ptr)\n -> void\n {\n alpaka::ignore_unused(alloc);\n boost::alignment::aligned_free(\n const_cast<void *>(\n reinterpret_cast<void const *>(ptr)));\n }\n };\n }\n }\n }\n}\n<commit_msg>fix memory alignment<commit_after>\/* Copyright 2019 Axel Huebl, Benjamin Worpitz\n *\n * This file is part of Alpaka.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#pragma once\n\n#include <alpaka\/mem\/alloc\/Traits.hpp>\n\n#include <alpaka\/core\/Common.hpp>\n#include <alpaka\/core\/Unused.hpp>\n\n#include <boost\/align.hpp>\n\n#include <algorithm>\n\nnamespace alpaka\n{\n namespace mem\n {\n \/\/-----------------------------------------------------------------------------\n \/\/! The allocator specifics.\n namespace alloc\n {\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator.\n \/\/!\n \/\/! \\tparam TAlignment An integral constant containing the alignment.\n template<\n typename TAlignment>\n class AllocCpuBoostAligned : public concepts::Implements<ConceptMemAlloc, AllocCpuBoostAligned<TAlignment>>\n {\n };\n\n namespace traits\n {\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator memory allocation trait specialization.\n template<\n typename T,\n typename TAlignment>\n struct Alloc<\n T,\n AllocCpuBoostAligned<TAlignment>>\n {\n \/\/-----------------------------------------------------------------------------\n ALPAKA_FN_HOST static auto alloc(\n AllocCpuBoostAligned<TAlignment> const & alloc,\n std::size_t const & sizeElems)\n -> T *\n {\n#if (defined(ALPAKA_ACC_GPU_CUDA_ENABLED) && BOOST_LANG_CUDA) || (defined(ALPAKA_ACC_GPU_HIP_ENABLED) && BOOST_LANG_HIP)\n \/\/ For CUDA host memory must be aligned to 4 kib to pin it with `cudaHostRegister`,\n \/\/ this was described in older programming guides but was removed later.\n \/\/ From testing with PIConGPU and cuda-memcheck we found out that the alignment is still required.\n \/\/\n \/\/ For HIP the required alignment is the size of a cache line.\n \/\/ https:\/\/rocm-developer-tools.github.io\/HIP\/group__Memory.html#gab8258f051e1a1f7385f794a15300e674\n \/\/ To avoid issues with HIP(cuda) the alignment will be set also for HIP(clang\/hcc)\n \/\/ to 4kib.\n \/\/ @todo evaluate requirements when the HIP ecosystem is more stable\n constexpr size_t minAlignement = 4096;\n#else\n constexpr size_t minAlignement = TAlignment::value;\n#endif\n alpaka::ignore_unused(alloc);\n return\n reinterpret_cast<T *>(\n boost::alignment::aligned_alloc(std::max(TAlignment::value, minAlignement), sizeElems * sizeof(T)));\n }\n };\n\n \/\/#############################################################################\n \/\/! The CPU boost aligned allocator memory free trait specialization.\n template<\n typename T,\n typename TAlignment>\n struct Free<\n T,\n AllocCpuBoostAligned<TAlignment>>\n {\n \/\/-----------------------------------------------------------------------------\n ALPAKA_FN_HOST static auto free(\n AllocCpuBoostAligned<TAlignment> const & alloc,\n T const * const ptr)\n -> void\n {\n alpaka::ignore_unused(alloc);\n boost::alignment::aligned_free(\n const_cast<void *>(\n reinterpret_cast<void const *>(ptr)));\n }\n };\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n#include <proxc\/config.hpp>\n\n#include <proxc\/context.hpp>\n#include <proxc\/work_steal_deque.hpp>\n#include <proxc\/scheduling_policy\/policy_base.hpp>\n\n#include <chrono>\n#include <condition_variable>\n#include <mutex>\n#include <vector>\n\nPROXC_NAMESPACE_BEGIN\n\nnamespace scheduling_policy {\nnamespace detail {\n\ntemplate<typename T>\nclass WorkStealingPolicy : public PolicyBase<T>\n{\nprivate:\n static std::size_t num_workers_;\n static std::vector<WorkStealingPolicy *> work_stealers_;\n\n std::size_t id_;\n proxc::WorkStealDeque<T> deque_{};\n std::mutex mtx_;\n std::condition_variable cnd_;\n bool flag_{ false };\n\n static void init_(std::size_t num_workers);\n\npublic:\n using TimePointType = typename PolicyBase<T>::TimePointType;\n\n \/\/ 0 == num_cores\n WorkStealingPolicy(std::size_t num_workers = 0);\n\n WorkStealingPolicy(WorkStealingPolicy const &) = delete;\n WorkStealingPolicy(WorkStealingPolicy &&) = delete;\n\n WorkStealingPolicy & operator=(WorkStealingPolicy const &) = delete;\n WorkStealingPolicy & operator=(WorkStealingPolicy &&) = delete;\n\n \/\/ Added work stealing methods\n void reserve(std::size_t capacity) noexcept;\n\n \/\/ Policy base interface methods\n void enqueue(T *) noexcept;\n\n T * pick_next() noexcept;\n\n bool is_ready() const noexcept;\n\n void suspend_until(TimePointType const &) noexcept;\n\n void notify() noexcept;\n\nprivate:\n T * steal() noexcept;\n};\n\n} \/\/ namespace detail\n\nusing WorkStealing = detail::WorkStealingPolicy<Context>;\n\n} \/\/ namespace scheduling_policy\n\nPROXC_NAMESPACE_END\n\n<commit_msg>Some minor refactoring.<commit_after>\n#pragma once\n\n#include <proxc\/config.hpp>\n\n#include <proxc\/context.hpp>\n#include <proxc\/work_steal_deque.hpp>\n#include <proxc\/scheduling_policy\/policy_base.hpp>\n\n#include <chrono>\n#include <condition_variable>\n#include <mutex>\n#include <vector>\n\nPROXC_NAMESPACE_BEGIN\n\nnamespace scheduling_policy {\nnamespace detail {\n\ntemplate<typename T>\nclass WorkStealingPolicy : public PolicyBase<T>\n{\nprivate:\n static std::size_t num_workers_;\n static std::vector< WorkStealingPolicy * > work_stealers_;\n\n std::size_t id_;\n proxc::WorkStealDeque< T > deque_{};\n std::mutex mtx_;\n std::condition_variable cnd_;\n bool flag_{ false };\n\n static void init_(std::size_t num_workers);\n\npublic:\n using TimePointType = typename PolicyBase<T>::TimePointType;\n\n \/\/ 0 == num_cores\n WorkStealingPolicy(std::size_t num_workers = 0);\n\n WorkStealingPolicy(WorkStealingPolicy const &) = delete;\n WorkStealingPolicy(WorkStealingPolicy &&) = delete;\n\n WorkStealingPolicy & operator=(WorkStealingPolicy const &) = delete;\n WorkStealingPolicy & operator=(WorkStealingPolicy &&) = delete;\n\n \/\/ Added work stealing methods\n void reserve(std::size_t capacity) noexcept;\n\n \/\/ Policy base interface methods\n void enqueue(T *) noexcept;\n\n T * pick_next() noexcept;\n\n bool is_ready() const noexcept;\n\n void suspend_until(TimePointType const &) noexcept;\n\n void notify() noexcept;\n\nprivate:\n T * steal() noexcept;\n};\n\n} \/\/ namespace detail\n\nusing WorkStealing = detail::WorkStealingPolicy<Context>;\n\n} \/\/ namespace scheduling_policy\n\nPROXC_NAMESPACE_END\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <algorithm>\n#include <vector>\n#include <tudocomp\/def.hpp>\n\nnamespace tdc {\nnamespace lzss {\n\nclass Factor {\npublic:\n len_t pos, src, len;\n\n inline Factor(len_t fpos, len_t fsrc, len_t flen)\n : pos(fpos), src(fsrc), len(flen) {\n }\n} __attribute__((__packed__));\n\nclass FactorBuffer {\nprivate:\n std::vector<Factor> m_factors;\n bool m_sorted; \/\/! factors need to be sorted before they are output\n\n len_t m_shortest_factor;\n len_t m_longest_factor;\n\npublic:\n inline FactorBuffer()\n : m_sorted(true)\n , m_shortest_factor(LEN_MAX)\n , m_longest_factor(0)\n {\n }\n\n inline void emplace_back(len_t fpos, len_t fsrc, len_t flen) {\n m_sorted = m_sorted && (m_factors.empty() || fpos >= m_factors.back().pos);\n m_factors.emplace_back(fpos, fsrc, flen);\n\n m_shortest_factor = std::min(m_shortest_factor, flen);\n m_longest_factor = std::max(m_longest_factor, flen);\n }\n inline std::vector<Factor>::const_iterator begin() const {\n return m_factors.cbegin();\n }\n inline std::vector<Factor>::const_iterator end() const {\n return m_factors.cend();\n }\n\n \/\/ inline const Factor& operator[](size_t i) const {\n \/\/ return m_factors[i];\n \/\/ }\n\n inline bool empty() const {\n return m_factors.empty();\n }\n\n inline size_t size() const {\n return m_factors.size();\n }\n\n inline bool is_sorted() const {\n return m_sorted;\n }\n\n inline void sort() { \/\/TODO: use radix sort\n if(!m_sorted) {\n std::sort(m_factors.begin(), m_factors.end(),\n [](const Factor& a, const Factor& b) -> bool { return a.pos < b.pos; });\n\n m_sorted = true;\n }\n }\n\n inline size_t shortest_factor() const {\n return m_shortest_factor;\n }\n\n inline size_t longest_factor() const {\n return m_longest_factor;\n }\n\n};\n\n}} \/\/ns\n\n<commit_msg>make operator[] in FactorBuffer deprecated<commit_after>#pragma once\n\n#include <algorithm>\n#include <vector>\n#include <tudocomp\/def.hpp>\n\nnamespace tdc {\nnamespace lzss {\n\nclass Factor {\npublic:\n len_t pos, src, len;\n\n inline Factor(len_t fpos, len_t fsrc, len_t flen)\n : pos(fpos), src(fsrc), len(flen) {\n }\n} __attribute__((__packed__));\n\n\nclass FactorBuffer {\nprivate:\n std::vector<Factor> m_factors;\n bool m_sorted; \/\/! factors need to be sorted before they are output\n\n len_t m_shortest_factor;\n len_t m_longest_factor;\n\npublic:\n inline FactorBuffer()\n : m_sorted(true)\n , m_shortest_factor(LEN_MAX)\n , m_longest_factor(0)\n {\n }\n\n inline void emplace_back(len_t fpos, len_t fsrc, len_t flen) {\n m_sorted = m_sorted && (m_factors.empty() || fpos >= m_factors.back().pos);\n m_factors.emplace_back(fpos, fsrc, flen);\n\n m_shortest_factor = std::min(m_shortest_factor, flen);\n m_longest_factor = std::max(m_longest_factor, flen);\n }\n inline std::vector<Factor>::const_iterator begin() const {\n return m_factors.cbegin();\n }\n inline std::vector<Factor>::const_iterator end() const {\n return m_factors.cend();\n }\n\n [[deprecated(\"use interators\")]] inline const Factor& operator[](size_t i) const {\n return m_factors[i];\n }\n\n inline bool empty() const {\n return m_factors.empty();\n }\n\n inline size_t size() const {\n return m_factors.size();\n }\n\n inline bool is_sorted() const {\n return m_sorted;\n }\n\n inline void sort() { \/\/TODO: use radix sort\n if(!m_sorted) {\n std::sort(m_factors.begin(), m_factors.end(),\n [](const Factor& a, const Factor& b) -> bool { return a.pos < b.pos; });\n\n m_sorted = true;\n }\n }\n\n inline size_t shortest_factor() const {\n return m_shortest_factor;\n }\n\n inline size_t longest_factor() const {\n return m_longest_factor;\n }\n\n};\n\n}} \/\/ns\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * database_impl.cpp\n *\n * Created on: Jul 13, 2015\n * Author: zmij\n *\/\n\n#include <tip\/db\/pg\/detail\/database_impl.hpp>\n#include <tip\/db\/pg\/detail\/connection_pool.hpp>\n#include <tip\/db\/pg\/error.hpp>\n#include <stdexcept>\n\n#include <tip\/db\/pg\/version.hpp>\n#include <tip\/db\/pg\/log.hpp>\n\nnamespace tip {\nnamespace db {\nnamespace pg {\nnamespace detail {\n\nLOCAL_LOGGING_FACILITY_CFG(PGDB, config::SERVICE_LOG);\n\ndatabase_impl::database_impl(size_t pool_size, client_options_type const& defaults)\n : service_( std::make_shared<asio_config::io_service>() ),\n pool_size_(pool_size), defaults_(defaults),\n state_(running)\n{\n local_log() << \"Initializing postgre db service\";\n}\n\ndatabase_impl::~database_impl()\n{\n stop();\n}\n\nvoid\ndatabase_impl::set_defaults(size_t pool_size, client_options_type const& defaults)\n{\n pool_size_ = pool_size;\n defaults_ = defaults;\n}\n\nvoid\ndatabase_impl::add_connection(std::string const& connection_string,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n connection_options co = connection_options::parse(connection_string);\n add_connection(co, pool_size, params);\n}\n\nvoid\ndatabase_impl::add_connection(connection_options co,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n\n if (co.uri.empty())\n throw error::connection_error(\"No URI in database connection string\");\n\n if (co.database.empty())\n throw error::connection_error(\"No database name in database connection string\");\n\n if (co.user.empty())\n throw error::connection_error(\"No user name in database connection string\");\n\n if (co.alias.empty()) {\n co.generate_alias();\n }\n\n add_pool(co, pool_size, params);\n}\n\ndatabase_impl::connection_pool_ptr\ndatabase_impl::add_pool(connection_options const& co,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (!connections_.count(co.alias)) {\n if (!pool_size.is_initialized()) {\n pool_size = pool_size_;\n }\n local_log(logger::INFO) << \"Create a new connection pool \" << co.alias;\n client_options_type parms(params);\n for (auto p : defaults_) {\n if (!parms.count(p.first)) {\n parms.insert(p);\n }\n }\n local_log(logger::INFO) << \"Register new connection \" << co.uri\n << \"[\" << co.database << \"]\" << \" with alias \" << co.alias;\n connections_.insert(std::make_pair(co.alias,\n connection_pool_ptr(connection_pool::create(service_,\n *pool_size, co, parms) )));\n }\n return connections_[co.alias];\n}\n\nvoid\ndatabase_impl::get_connection(dbalias const& alias,\n transaction_callback const& cb,\n error_callback const& err,\n transaction_mode const& mode)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n\n if (!connections_.count(alias)) {\n throw error::connection_error(\"Database alias is not registered\");\n }\n connection_pool_ptr pool = connections_[alias];\n pool->get_connection(cb, err, mode);\n}\n\nvoid\ndatabase_impl::run()\n{\n service_->run();\n}\n\nvoid\ndatabase_impl::stop()\n{\n if (state_ == running) {\n state_ = closing;\n std::shared_ptr< size_t > pool_count =\n std::make_shared< size_t >(connections_.size());\n asio_config::io_service_ptr svc = service_;\n\n for (auto c: connections_) {\n \/\/ FIXME Pass a close callback. Call stop\n \/\/ only when all connections are closed, may be with some timeout\n c.second->close(\n [pool_count, svc](){\n --(*pool_count);\n if (*pool_count == 0) {\n svc->stop();\n }\n });\n }\n connections_.clear();\n }\n}\n\n} \/* namespace detail *\/\n} \/* namespace pg *\/\n} \/* namespace db *\/\n} \/* namespace tip *\/\n<commit_msg>Be more specific about database alias that is not registered<commit_after>\/*\n * database_impl.cpp\n *\n * Created on: Jul 13, 2015\n * Author: zmij\n *\/\n\n#include <tip\/db\/pg\/detail\/database_impl.hpp>\n#include <tip\/db\/pg\/detail\/connection_pool.hpp>\n#include <tip\/db\/pg\/error.hpp>\n#include <stdexcept>\n\n#include <tip\/db\/pg\/version.hpp>\n#include <tip\/db\/pg\/log.hpp>\n\nnamespace tip {\nnamespace db {\nnamespace pg {\nnamespace detail {\n\nLOCAL_LOGGING_FACILITY_CFG(PGDB, config::SERVICE_LOG);\n\ndatabase_impl::database_impl(size_t pool_size, client_options_type const& defaults)\n : service_( std::make_shared<asio_config::io_service>() ),\n pool_size_(pool_size), defaults_(defaults),\n state_(running)\n{\n local_log() << \"Initializing postgre db service\";\n}\n\ndatabase_impl::~database_impl()\n{\n stop();\n}\n\nvoid\ndatabase_impl::set_defaults(size_t pool_size, client_options_type const& defaults)\n{\n pool_size_ = pool_size;\n defaults_ = defaults;\n}\n\nvoid\ndatabase_impl::add_connection(std::string const& connection_string,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n connection_options co = connection_options::parse(connection_string);\n add_connection(co, pool_size, params);\n}\n\nvoid\ndatabase_impl::add_connection(connection_options co,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n\n if (co.uri.empty())\n throw error::connection_error(\"No URI in database connection string\");\n\n if (co.database.empty())\n throw error::connection_error(\"No database name in database connection string\");\n\n if (co.user.empty())\n throw error::connection_error(\"No user name in database connection string\");\n\n if (co.alias.empty()) {\n co.generate_alias();\n }\n\n add_pool(co, pool_size, params);\n}\n\ndatabase_impl::connection_pool_ptr\ndatabase_impl::add_pool(connection_options const& co,\n db_service::optional_size pool_size,\n client_options_type const& params)\n{\n if (!connections_.count(co.alias)) {\n if (!pool_size.is_initialized()) {\n pool_size = pool_size_;\n }\n local_log(logger::INFO) << \"Create a new connection pool \" << co.alias;\n client_options_type parms(params);\n for (auto p : defaults_) {\n if (!parms.count(p.first)) {\n parms.insert(p);\n }\n }\n local_log(logger::INFO) << \"Register new connection \" << co.uri\n << \"[\" << co.database << \"]\" << \" with alias \" << co.alias;\n connections_.insert(std::make_pair(co.alias,\n connection_pool_ptr(connection_pool::create(service_,\n *pool_size, co, parms) )));\n }\n return connections_[co.alias];\n}\n\nvoid\ndatabase_impl::get_connection(dbalias const& alias,\n transaction_callback const& cb,\n error_callback const& err,\n transaction_mode const& mode)\n{\n if (state_ != running)\n throw error::connection_error(\"Database service is not running\");\n\n if (!connections_.count(alias)) {\n throw error::connection_error(\"Database alias '\" + alias + \"' is not registered\");\n }\n connection_pool_ptr pool = connections_[alias];\n pool->get_connection(cb, err, mode);\n}\n\nvoid\ndatabase_impl::run()\n{\n service_->run();\n}\n\nvoid\ndatabase_impl::stop()\n{\n if (state_ == running) {\n state_ = closing;\n std::shared_ptr< size_t > pool_count =\n std::make_shared< size_t >(connections_.size());\n asio_config::io_service_ptr svc = service_;\n\n for (auto c: connections_) {\n \/\/ FIXME Pass a close callback. Call stop\n \/\/ only when all connections are closed, may be with some timeout\n c.second->close(\n [pool_count, svc](){\n --(*pool_count);\n if (*pool_count == 0) {\n svc->stop();\n }\n });\n }\n connections_.clear();\n }\n}\n\n} \/* namespace detail *\/\n} \/* namespace pg *\/\n} \/* namespace db *\/\n} \/* namespace tip *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#708359 Uninitialized scalar field<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"circuit.h\"\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <cstddef>\n#include <iterator>\nusing namespace std;\n\nCircuit::Circuit(vector<bool> inputs, int o): output_no(o), input_no(inputs.size()) {\n for(bool input : inputs){\n Gate* wire = new Wire(input);\n gates.push_back(wire);\n }\n}\nCircuit::Circuit(int inputs, int o): output_no(o), input_no(inputs) {\n for(int i =0; i < input_no; ++i){\n Gate* wire = new Wire(false);\n gates.push_back(wire);\n }\n}\n\nint Circuit::addGate(GateType gate_type, int index_1){\n Gate* built_gate = nullptr;\n Gate* input_1 = gates[index_1];\n if(gate_type == NOT){\n built_gate = new Not(input_1);\n }\n else if(gate_type == WIRE){\n built_gate = new Wire(input_1);\n }\n assert(built_gate != nullptr);\n gates.push_back(built_gate);\n return gates.size();\n}\n\n\nint Circuit::addGate(GateType gate_type, int index_1, int index_2){\n Gate* built_gate = nullptr;\n Gate* input_1 = gates[index_1];\n Gate* input_2 = gates[index_2];\n if(gate_type == AND){\n built_gate = new And(input_1, input_2);\n }\n else if(gate_type == OR){\n built_gate = new Or(input_1, input_2);\n }\n assert(built_gate != nullptr);\n gates.push_back(built_gate);\n return gates.size();\n}\n\nvector<vector<bool> > Circuit::evaluateAllInputs(){\n vector<vector<bool> > inputs = getPossibleInputs();\n vector<vector<bool> > outputs;\n for(vector<bool> input : inputs ){\n outputs.push_back(evaluateInputSet(input));\n }\n assert(!outputs.empty());\n return outputs;\n}\n\nvector<bool> Circuit::evaluateInputSet(vector<bool> input_set){\n vector<bool> result;\n for(int i = 0; i<input_no; ++i){\n ((Wire*)(gates[i]))->setInput(input_set[i]);\n }\n reverse_iterator<vector<Gate*>::iterator > r = gates.rbegin();\n for(int i = 0; i<output_no; ++i){\n bool output = r[i]->evaluate();\n result.insert(result.begin(), output);\n }\n return result;\n}\n\nvector<vector<bool> > Circuit::getPossibleInputs(){\n vector<vector<bool> > possibilities;\n for(int i =0; i < pow(2, input_no); ++i) {\n cout << \"Input set: \" << i << \":\" ;\n vector<bool> row;\n for(int j = input_no-1; j >= 0; --j){\n int current_bit = (i >> j) & 1;\n row.push_back(current_bit);\n }\n assert(row == input_no);\n possibilities.push_back(row);\n }\n return possibilities;\n}\n<commit_msg>fix assert<commit_after>#include \"circuit.h\"\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <cstddef>\n#include <iterator>\nusing namespace std;\n\nCircuit::Circuit(vector<bool> inputs, int o): output_no(o), input_no(inputs.size()) {\n for(bool input : inputs){\n Gate* wire = new Wire(input);\n gates.push_back(wire);\n }\n}\nCircuit::Circuit(int inputs, int o): output_no(o), input_no(inputs) {\n for(int i =0; i < input_no; ++i){\n Gate* wire = new Wire(false);\n gates.push_back(wire);\n }\n}\n\nint Circuit::addGate(GateType gate_type, int index_1){\n Gate* built_gate = nullptr;\n Gate* input_1 = gates[index_1];\n if(gate_type == NOT){\n built_gate = new Not(input_1);\n }\n else if(gate_type == WIRE){\n built_gate = new Wire(input_1);\n }\n assert(built_gate != nullptr);\n gates.push_back(built_gate);\n return gates.size();\n}\n\n\nint Circuit::addGate(GateType gate_type, int index_1, int index_2){\n Gate* built_gate = nullptr;\n Gate* input_1 = gates[index_1];\n Gate* input_2 = gates[index_2];\n if(gate_type == AND){\n built_gate = new And(input_1, input_2);\n }\n else if(gate_type == OR){\n built_gate = new Or(input_1, input_2);\n }\n assert(built_gate != nullptr);\n gates.push_back(built_gate);\n return gates.size();\n}\n\nvector<vector<bool> > Circuit::evaluateAllInputs(){\n vector<vector<bool> > inputs = getPossibleInputs();\n vector<vector<bool> > outputs;\n for(vector<bool> input : inputs ){\n outputs.push_back(evaluateInputSet(input));\n }\n assert(!outputs.empty());\n return outputs;\n}\n\nvector<bool> Circuit::evaluateInputSet(vector<bool> input_set){\n vector<bool> result;\n for(int i = 0; i<input_no; ++i){\n ((Wire*)(gates[i]))->setInput(input_set[i]);\n }\n reverse_iterator<vector<Gate*>::iterator > r = gates.rbegin();\n for(int i = 0; i<output_no; ++i){\n bool output = r[i]->evaluate();\n result.insert(result.begin(), output);\n }\n return result;\n}\n\nvector<vector<bool> > Circuit::getPossibleInputs(){\n vector<vector<bool> > possibilities;\n for(int i =0; i < pow(2, input_no); ++i) {\n cout << \"Input set: \" << i << \":\" ;\n vector<bool> row;\n for(int j = input_no-1; j >= 0; --j){\n int current_bit = (i >> j) & 1;\n row.push_back(current_bit);\n }\n assert(row.size() == input_no);\n possibilities.push_back(row);\n }\n return possibilities;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <bitset>\n#include <cstring>\n#include <string>\n#include <iostream>\n\nnamespace {\n\tnamespace binaryNS {\n\t\tusing std::cout;\n\t\tusing std::ostream;\n\n\t\ttemplate <typename A>\n\t\tclass binary final {\n\t\t\ttemplate<typename B>\n\t\t\tusing conref = const B &;\n\n\t\t\tusing bitA = std::bitset<sizeof(A) << 3>;\n\t\t\tusing byte = unsigned char;\n\t\t\tusing bit = bool;\n\n\t\t\tconstexpr static const size_t sz{sizeof(A)};\n\t\t\tconstexpr static const size_t szB{sz << 3};\n\t\t\tconstexpr static const size_t szOneLess{sz - 1};\n\n\t\t\tstatic inline void print(std::ostream &os, conref<binary<A>> a) noexcept {\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bit bitIdx;\n\t\t\t\t\t\tbitIdx = (bit) a.bits[getBitIdx(i, j)];\n\t\t\t\t\t\tos << bitIdx;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (szOneLess != i) {\n\t\t\t\t\t\tos << ' ';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic inline bit getBitFromByte(conref<byte> data, conref<byte> bitIdx) noexcept {\n\t\t\t\treturn data & (1 << bitIdx);\n\t\t\t}\n\n\t\t\tstatic inline size_t getBitIdx(conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn (byteIdx << 3) + bitIdx;\n\t\t\t}\n\n\t\t\tstatic inline bit getBit(conref<binary<A>> bits, conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn bits[getBitIdx(byteIdx, bitIdx)];\n\t\t\t}\n\n\t\tpublic:\n\t\t\texplicit binary(void) = delete;\n\n\t\t\tinline explicit binary(conref<A> a) noexcept {\n\t\t\t\tbyte *ptr = new byte[sz];\n\t\t\t\tmemcpy((void *) ptr, (const void *const) &a, sz);\n\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tstatic byte ch;\n\t\t\t\t\tch = ptr[i];\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bool bitVal;\n\t\t\t\t\t\tbitVal = binary<A>::getBitFromByte(ch, j);\n\t\t\t\t\t\tthis->bits[binary<A>::getBitIdx(i, j)] = bitVal;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdelete[] ptr;\n\t\t\t}\n\n\t\t\tinline explicit binary(A &&a) noexcept : binary(a) {}\n\n\t\t\ttemplate <typename... B>\n\t\t\texplicit binary(B... b) = delete;\n\n\t\t\tinline ~binary(void) noexcept {\n\t\t\t\tbits.~bitA();\n\t\t\t}\n\n\t\t\tinline explicit operator bool (void) const noexcept {\n\t\t\t\treturn this->bits.all();\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tinline explicit operator B (void) const noexcept = delete;\n\n\t\t\tinline bool operator [](size_t idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline void print(void) const noexcept {\n\t\t\t\tbinary<A>::print(std::cout, *this);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> idx) const noexcept {\n\t\t\t\treturn bits[idx];\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t&& idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> a, conref<size_t> b) const noexcept {\n\t\t\t\treturn this->getBit(binary<A>::getBitIdx((byte) a, (byte) b));\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t &&a, size_t &&b) const noexcept {\n\t\t\t\treturn this->getBit(a, b);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<byte> byteIdx, conref<byte> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(byte&& byteIdx, byte&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> byteIdx, conref<int> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit((size_t) byteIdx, (size_t) bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& byteIdx, int&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\tinline bool getBit(B... b) const noexcept = delete;\n\n\t\t\tinline unsigned long long getULLong(void) const noexcept {\n\t\t\t\treturn this->bits.to_ullong();\n\t\t\t}\n\n\t\t\tinline std::string getString(void) const noexcept {\n\t\t\t\treturn this->bits.to_string();\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, conref<binary<B>> a) noexcept {\n\t\t\t\ta.print(os, a);\n\n\t\t\t\treturn os;\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, binary<B> &&a) noexcept {\n\t\t\t\treturn operator<<(os, a);\n\t\t\t}\n\n\t\t\texplicit operator bool(void) const noexcept {\n\t\t\t\treturn this->bits.all();\n\t\t\t}\n\n\t\t\tconstexpr static inline size_t getSize(void) noexcept {\n\t\t\t\treturn sz;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tbitA bits;\n\t\t};\n\t}\n}\n<commit_msg>house keeping i guess...<commit_after>#pragma once\n\n#include <bitset>\n#include <cstring>\n#include <string>\n#include <iostream>\n\nnamespace {\n\tnamespace binaryNS {\n\t\tusing std::cout;\n\t\tusing std::ostream;\n\n\t\ttemplate <typename A>\n\t\tclass binary final {\n\t\t\ttemplate<typename B>\n\t\t\tusing conref = const B &;\n\n\t\t\tusing bitA = std::bitset<sizeof(A) << 3>;\n\t\t\tusing byte = unsigned char;\n\t\t\tusing bit = bool;\n\n\t\t\tconstexpr static const size_t sz{sizeof(A)};\n\t\t\tconstexpr static const size_t szB{sz << 3};\n\t\t\tconstexpr static const size_t szOneLess{sz - 1};\n\n\t\t\tstatic inline void print(std::ostream &os, conref<binary<A>> a) noexcept {\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bit bitIdx;\n\t\t\t\t\t\tbitIdx = (bit) a.bits[getBitIdx(i, j)];\n\t\t\t\t\t\tos << bitIdx;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (szOneLess != i) {\n\t\t\t\t\t\tos << ' ';\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstatic inline bit getBitFromByte(conref<byte> data, conref<byte> bitIdx) noexcept {\n\t\t\t\treturn data & (1 << bitIdx);\n\t\t\t}\n\n\t\t\tstatic inline size_t getBitIdx(conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn (byteIdx << 3) + bitIdx;\n\t\t\t}\n\n\t\t\tstatic inline bit getBit(conref<binary<A>> bits, conref<size_t> byteIdx, conref<size_t> bitIdx) noexcept {\n\t\t\t\treturn bits[getBitIdx(byteIdx, bitIdx)];\n\t\t\t}\n\n\t\tpublic:\n\t\t\texplicit binary(void) = delete;\n\n\t\t\tinline explicit binary(conref<A> a) noexcept {\n\t\t\t\tbyte *ptr = new byte[sz];\n\t\t\t\tmemcpy((void *) ptr, (const void *const) &a, sz);\n\n\t\t\t\tfor (size_t i = 0; i < sz; ++i) {\n\t\t\t\t\tstatic byte ch;\n\t\t\t\t\tch = ptr[i];\n\t\t\t\t\tfor (size_t j = 0; j < 8; ++j) {\n\t\t\t\t\t\tstatic bool bitVal;\n\t\t\t\t\t\tbitVal = binary<A>::getBitFromByte(ch, j);\n\t\t\t\t\t\tthis->bits[binary<A>::getBitIdx(i, j)] = bitVal;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tdelete[] ptr;\n\t\t\t}\n\n\t\t\tinline explicit binary(A &&a) noexcept : binary(a) {}\n\n\t\t\ttemplate <typename... B>\n\t\t\texplicit binary(B... b) = delete;\n\n\t\t\tinline ~binary(void) noexcept {\n\t\t\t\tbits.~bitA();\n\t\t\t}\n\n\t\t\tinline explicit operator bool (void) const noexcept {\n\t\t\t\treturn this->bits.all();\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tinline explicit operator B (void) const noexcept = delete;\n\n\t\t\tinline bool operator [](size_t idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline void print(void) const noexcept {\n\t\t\t\tbinary<A>::print(std::cout, *this);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> idx) const noexcept {\n\t\t\t\treturn bits[idx];\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t&& idx) const noexcept {\n\t\t\t\treturn this->getBit(idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<size_t> a, conref<size_t> b) const noexcept {\n\t\t\t\treturn this->getBit(binary<A>::getBitIdx((byte) a, (byte) b));\n\t\t\t}\n\n\t\t\tinline bool getBit(size_t &&a, size_t &&b) const noexcept {\n\t\t\t\treturn this->getBit(a, b);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& idx) const noexcept {\n\t\t\t\treturn this->getBit((size_t) idx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<byte> byteIdx, conref<byte> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(byte&& byteIdx, byte&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(*this, byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(conref<int> byteIdx, conref<int> bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit((size_t) byteIdx, (size_t) bitIdx);\n\t\t\t}\n\n\t\t\tinline bool getBit(int&& byteIdx, int&& bitIdx) const noexcept {\n\t\t\t\treturn binary<A>::getBit(byteIdx, bitIdx);\n\t\t\t}\n\n\t\t\ttemplate <typename... B>\n\t\t\tinline bool getBit(B... b) const noexcept = delete;\n\n\t\t\tinline unsigned long long getULLong(void) const noexcept {\n\t\t\t\treturn this->bits.to_ullong();\n\t\t\t}\n\n\t\t\tinline std::string getString(void) const noexcept {\n\t\t\t\treturn this->bits.to_string();\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, conref<binary<B>> a) noexcept {\n\t\t\t\ta.print(os, a);\n\n\t\t\t\treturn os;\n\t\t\t}\n\n\t\t\ttemplate <typename B>\n\t\t\tfriend inline ostream &operator<<(ostream &os, binary<B> &&a) noexcept {\n\t\t\t\treturn operator<<(os, a);\n\t\t\t}\n\n\t\t\tconstexpr static inline size_t getSize(void) noexcept {\n\t\t\t\treturn sz;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tbitA bits;\n\t\t};\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <algorithm>\n#include <ctype.h>\n\nusing namespace std;\n\nclass Palindrome {\n\nprivate:\n\tstring text;\t\/\/ String variable to hold the user inputted string of text to test.\n\npublic:\n\tbool Check(string text, unsigned int place = 0) {\n\t\t\/* ************************************\n\t\tThis function checks if the text string\n\t\tis a Palindrome or not.\n\t\tReturns true if it is, false if not.\n\t\t************************************ *\/\n\t\tif (place == 0) {\n\t\t\t\/*\n\t\t\tIf it is the first depth of recursion, filter all\n\t\t\tnon-alphabet characters out of the string.\n\t\t\t- Alex's idea -\n\t\t\t*\/\n\t\t\ttext.erase(remove_if(text.begin(), text.end(), isspace), text.end());\n\t\t\ttext.erase(remove_if(text.begin(), text.end(), ispunct), text.end());\n\t\t}\n\t\t\/\/ Set len to the length of the new string.\n\t\tunsigned int len = text.length();\n\t\tif (place >= len \/ 2) {\n\t\t\t\/*\n\t\t\tIf place is already reached an integer that is greater than\n\t\t\tor equal to half the string length, return true since it is\n\t\t\ta Palindrome.\n\t\t\t*\/\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\tchar a = text.at(place);\t\t\t\/\/ Set a to the current string place from the beginning of the string.\n\t\t\tchar b = text.at(len - 1 - place);\t\/\/ Set b to the current string place from the end of the string.\n\t\t\tif (tolower(a) == tolower(b)) {\t\t\/\/ Compare a and b.\n\t\t\t\tif (!Check(text, place + 1)) {\t\/\/ If a == b, continue recursion.\n\t\t\t\t\treturn false;\t\t\t\t\/\/ If any recursion returns false, the rest of the stack will return false.\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t\/\/ If a ever does not equal b, this will return false and cause the rest of the stack to return false.\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid AskUser() {\n\t\t\/* ************************************\n\t\tThis function asks the user to input\n\t\ta string to be checked.\n\t\tIt will continually ask for new strings\n\t\tuntil the user inputs nothing and \n\t\tpresses enter.\n\t\t************************************ *\/\n\t\tdo {\n\t\t\tcout << \"Please input a string: \";\n\t\t\tgetline(cin, this->text);\n\t\t\tif (this->Check(this->text) && this->text != \"\") {\n\t\t\t\tcout << \"The string entered is a Palindrome.\" << endl;\n\t\t\t}\n\t\t\telse if (!this->Check(this->text)) {\n\t\t\t\tcout << \"The string entered is not a Palindrome\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} while (this->text != \"\");\n\t}\n\n};\n\nint main() {\n\n\tPalindrome test;\t\/\/ Initialize the class object.\n\n\ttest.AskUser();\t\t\/\/ Run the AskUser() function to begin the program.\n\n\treturn 0;\n}\n<commit_msg>Update Algorithm-Function-Version.cpp<commit_after>#include <iostream>\n#include <string>\n#include <algorithm>\n#include <ctype.h>\n\nusing namespace std;\n\nclass Palindrome {\n\nprivate:\n\tstring text;\t\/\/ String variable to hold the user inputted string of text to test.\n\npublic:\n\tbool Check(string text, unsigned int place = 0) {\n\t\t\/* ************************************\n\t\tThis function checks if the text string\n\t\tis a Palindrome or not.\n\t\tReturns true if it is, false if not.\n\t\t************************************ *\/\n\t\tif (place == 0) {\n\t\t\t\/*\n\t\t\t- Alex's idea -\n\t\t\tIf it is the first depth of recursion, filter all\n\t\t\tnon-alphabet characters out of the string.\n\t\t\t*\/\n\t\t\ttext.erase(remove_if(text.begin(), text.end(), isspace), text.end());\n\t\t\ttext.erase(remove_if(text.begin(), text.end(), ispunct), text.end());\n\t\t}\n\t\t\/\/ Set len to the length of the new string.\n\t\tunsigned int len = text.length();\n\t\tif (place >= len \/ 2) {\n\t\t\t\/*\n\t\t\tIf place is already reached an integer that is greater than\n\t\t\tor equal to half the string length, return true since it is\n\t\t\ta Palindrome.\n\t\t\t*\/\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\tchar a = text.at(place);\t\t\t\/\/ Set a to the current string place from the beginning of the string.\n\t\t\tchar b = text.at(len - 1 - place);\t\/\/ Set b to the current string place from the end of the string.\n\t\t\tif (tolower(a) == tolower(b)) {\t\t\/\/ Compare a and b.\n\t\t\t\tif (!Check(text, place + 1)) {\t\/\/ If a == b, continue recursion.\n\t\t\t\t\treturn false;\t\t\t\t\/\/ If any recursion returns false, the rest of the stack will return false.\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\t\/\/ If a ever does not equal b, this will return false and cause the rest of the stack to return false.\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid AskUser() {\n\t\t\/* ************************************\n\t\tThis function asks the user to input\n\t\ta string to be checked.\n\t\tIt will continually ask for new strings\n\t\tuntil the user inputs nothing and \n\t\tpresses enter.\n\t\t************************************ *\/\n\t\tdo {\n\t\t\tcout << \"Please input a string: \";\n\t\t\tgetline(cin, this->text);\n\t\t\tif (this->Check(this->text) && this->text != \"\") {\n\t\t\t\tcout << \"The string entered is a Palindrome.\" << endl;\n\t\t\t}\n\t\t\telse if (!this->Check(this->text)) {\n\t\t\t\tcout << \"The string entered is not a Palindrome\" << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} while (this->text != \"\");\n\t}\n\n};\n\nint main() {\n\n\tPalindrome test;\t\/\/ Initialize the class object.\n\n\ttest.AskUser();\t\t\/\/ Run the AskUser() function to begin the program.\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexSpice.cxx\n ** Lexer for Spice\n **\/\n\/\/ Copyright 2006 by Fabien Proriol\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include <string>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\n\/*\n * Interface\n *\/\n\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler);\n\nstatic const char * const spiceWordListDesc[] = {\n \"Keywords\", \/\/ SPICE command\n \"Keywords2\", \/\/ SPICE functions\n \"Keywords3\", \/\/ SPICE params\n 0\n};\n\nLexerModule lmSpice(SCLEX_SPICE, ColouriseDocument, \"spice\", NULL, spiceWordListDesc);\n\n\/*\n * Implementation\n *\/\n\nstatic void ColouriseComment(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute);\n\nstatic inline bool IsDelimiterCharacter(int ch);\nstatic inline bool IsNumberStartCharacter(int ch);\nstatic inline bool IsNumberCharacter(int ch);\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch);\nstatic inline bool IsWordStartCharacter(int ch);\nstatic inline bool IsWordCharacter(int ch);\n\nstatic void ColouriseComment(StyleContext& sc, bool&) {\n sc.SetState(SCE_SPICE_COMMENTLINE);\n while (!sc.atLineEnd) {\n sc.Forward();\n }\n}\n\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = sc.Match (')');\n sc.SetState(SCE_SPICE_DELIMITER);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n std::string number;\n sc.SetState(SCE_SPICE_NUMBER);\n \/\/ Get all characters up to a delimiter or a separator, including points, but excluding\n \/\/ double points (ranges).\n while (!IsSeparatorOrDelimiterCharacter(sc.ch) || (sc.ch == '.' && sc.chNext != '.')) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n \/\/ Special case: exponent with sign\n if ((sc.chPrev == 'e' || sc.chPrev == 'E') &&\n (sc.ch == '+' || sc.ch == '-')) {\n number += static_cast<char>(sc.ch);\n sc.Forward ();\n while (!IsSeparatorOrDelimiterCharacter(sc.ch)) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& ) {\n sc.SetState(SCE_SPICE_DEFAULT);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n sc.SetState(SCE_SPICE_IDENTIFIER);\n std::string word;\n while (!sc.atLineEnd && !IsSeparatorOrDelimiterCharacter(sc.ch)) {\n word += static_cast<char>(tolower(sc.ch));\n sc.Forward();\n }\n if (keywords.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords2.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD2);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords3.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD3);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\n\/\/\n\/\/ ColouriseDocument\n\/\/\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n StyleContext sc(startPos, length, initStyle, styler);\n int lineCurrent = styler.GetLine(startPos);\n bool apostropheStartsAttribute = (styler.GetLineState(lineCurrent) & 1) != 0;\n while (sc.More()) {\n if (sc.atLineEnd) {\n \/\/ Go to the next line\n sc.Forward();\n lineCurrent++;\n \/\/ Remember the line state for future incremental lexing\n styler.SetLineState(lineCurrent, apostropheStartsAttribute);\n \/\/ Don't continue any styles on the next line\n sc.SetState(SCE_SPICE_DEFAULT);\n }\n \/\/ Comments\n if ((sc.Match('*') && sc.atLineStart) || sc.Match('*','~')) {\n ColouriseComment(sc, apostropheStartsAttribute);\n \/\/ Whitespace\n } else if (IsASpace(sc.ch)) {\n ColouriseWhiteSpace(sc, apostropheStartsAttribute);\n \/\/ Delimiters\n } else if (IsDelimiterCharacter(sc.ch)) {\n ColouriseDelimiter(sc, apostropheStartsAttribute);\n \/\/ Numbers\n } else if (IsADigit(sc.ch) || sc.ch == '#') {\n ColouriseNumber(sc, apostropheStartsAttribute);\n \/\/ Keywords or identifiers\n } else {\n ColouriseWord(sc, keywords, keywords2, keywords3, apostropheStartsAttribute);\n }\n }\n sc.Complete();\n}\n\nstatic inline bool IsDelimiterCharacter(int ch) {\n switch (ch) {\n case '&':\n case '\\'':\n case '(':\n case ')':\n case '*':\n case '+':\n case ',':\n case '-':\n case '.':\n case '\/':\n case ':':\n case ';':\n case '<':\n case '=':\n case '>':\n case '|':\n return true;\n default:\n return false;\n }\n}\n\nstatic inline bool IsNumberCharacter(int ch) {\n return IsNumberStartCharacter(ch) ||\n ch == '_' ||\n ch == '.' ||\n ch == '#' ||\n (ch >= 'a' && ch <= 'f') ||\n (ch >= 'A' && ch <= 'F');\n}\n\nstatic inline bool IsNumberStartCharacter(int ch) {\n return IsADigit(ch);\n}\n\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch) {\n return IsASpace(ch) || IsDelimiterCharacter(ch);\n}\n\nstatic inline bool IsWordCharacter(int ch) {\n return IsWordStartCharacter(ch) || IsADigit(ch);\n}\n\nstatic inline bool IsWordStartCharacter(int ch) {\n return (IsASCII(ch) && isalpha(ch)) || ch == '_';\n}\n<commit_msg>Removed functions that had never been used - looks like they had been copied from LexAda.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexSpice.cxx\n ** Lexer for Spice\n **\/\n\/\/ Copyright 2006 by Fabien Proriol\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <stdio.h>\n#include <stdarg.h>\n#include <assert.h>\n#include <ctype.h>\n\n#include <string>\n\n#include \"ILexer.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\n#include \"WordList.h\"\n#include \"LexAccessor.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"CharacterSet.h\"\n#include \"LexerModule.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\n\/*\n * Interface\n *\/\n\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler);\n\nstatic const char * const spiceWordListDesc[] = {\n \"Keywords\", \/\/ SPICE command\n \"Keywords2\", \/\/ SPICE functions\n \"Keywords3\", \/\/ SPICE params\n 0\n};\n\nLexerModule lmSpice(SCLEX_SPICE, ColouriseDocument, \"spice\", NULL, spiceWordListDesc);\n\n\/*\n * Implementation\n *\/\n\nstatic void ColouriseComment(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& apostropheStartsAttribute);\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute);\n\nstatic inline bool IsDelimiterCharacter(int ch);\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch);\n\nstatic void ColouriseComment(StyleContext& sc, bool&) {\n sc.SetState(SCE_SPICE_COMMENTLINE);\n while (!sc.atLineEnd) {\n sc.Forward();\n }\n}\n\nstatic void ColouriseDelimiter(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = sc.Match (')');\n sc.SetState(SCE_SPICE_DELIMITER);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseNumber(StyleContext& sc, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n std::string number;\n sc.SetState(SCE_SPICE_NUMBER);\n \/\/ Get all characters up to a delimiter or a separator, including points, but excluding\n \/\/ double points (ranges).\n while (!IsSeparatorOrDelimiterCharacter(sc.ch) || (sc.ch == '.' && sc.chNext != '.')) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n \/\/ Special case: exponent with sign\n if ((sc.chPrev == 'e' || sc.chPrev == 'E') &&\n (sc.ch == '+' || sc.ch == '-')) {\n number += static_cast<char>(sc.ch);\n sc.Forward ();\n while (!IsSeparatorOrDelimiterCharacter(sc.ch)) {\n number += static_cast<char>(sc.ch);\n sc.Forward();\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWhiteSpace(StyleContext& sc, bool& ) {\n sc.SetState(SCE_SPICE_DEFAULT);\n sc.ForwardSetState(SCE_SPICE_DEFAULT);\n}\n\nstatic void ColouriseWord(StyleContext& sc, WordList& keywords, WordList& keywords2, WordList& keywords3, bool& apostropheStartsAttribute) {\n apostropheStartsAttribute = true;\n sc.SetState(SCE_SPICE_IDENTIFIER);\n std::string word;\n while (!sc.atLineEnd && !IsSeparatorOrDelimiterCharacter(sc.ch)) {\n word += static_cast<char>(tolower(sc.ch));\n sc.Forward();\n }\n if (keywords.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords2.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD2);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n else if (keywords3.InList(word.c_str())) {\n sc.ChangeState(SCE_SPICE_KEYWORD3);\n if (word != \"all\") {\n apostropheStartsAttribute = false;\n }\n }\n sc.SetState(SCE_SPICE_DEFAULT);\n}\n\n\/\/\n\/\/ ColouriseDocument\n\/\/\nstatic void ColouriseDocument(\n unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n WordList &keywords = *keywordlists[0];\n WordList &keywords2 = *keywordlists[1];\n WordList &keywords3 = *keywordlists[2];\n StyleContext sc(startPos, length, initStyle, styler);\n int lineCurrent = styler.GetLine(startPos);\n bool apostropheStartsAttribute = (styler.GetLineState(lineCurrent) & 1) != 0;\n while (sc.More()) {\n if (sc.atLineEnd) {\n \/\/ Go to the next line\n sc.Forward();\n lineCurrent++;\n \/\/ Remember the line state for future incremental lexing\n styler.SetLineState(lineCurrent, apostropheStartsAttribute);\n \/\/ Don't continue any styles on the next line\n sc.SetState(SCE_SPICE_DEFAULT);\n }\n \/\/ Comments\n if ((sc.Match('*') && sc.atLineStart) || sc.Match('*','~')) {\n ColouriseComment(sc, apostropheStartsAttribute);\n \/\/ Whitespace\n } else if (IsASpace(sc.ch)) {\n ColouriseWhiteSpace(sc, apostropheStartsAttribute);\n \/\/ Delimiters\n } else if (IsDelimiterCharacter(sc.ch)) {\n ColouriseDelimiter(sc, apostropheStartsAttribute);\n \/\/ Numbers\n } else if (IsADigit(sc.ch) || sc.ch == '#') {\n ColouriseNumber(sc, apostropheStartsAttribute);\n \/\/ Keywords or identifiers\n } else {\n ColouriseWord(sc, keywords, keywords2, keywords3, apostropheStartsAttribute);\n }\n }\n sc.Complete();\n}\n\nstatic inline bool IsDelimiterCharacter(int ch) {\n switch (ch) {\n case '&':\n case '\\'':\n case '(':\n case ')':\n case '*':\n case '+':\n case ',':\n case '-':\n case '.':\n case '\/':\n case ':':\n case ';':\n case '<':\n case '=':\n case '>':\n case '|':\n return true;\n default:\n return false;\n }\n}\n\nstatic inline bool IsSeparatorOrDelimiterCharacter(int ch) {\n return IsASpace(ch) || IsDelimiterCharacter(ch);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include \"litesql.hpp\"\n#include \"main.hpp\"\"\n\n\/\/ no name collisions expected\nusing namespace litesql;\nusing namespace SkypeDB;\n\nint main(int argc, char **argv) {\n\ttry {\n\t\tSkypeDB::main db(\"sqlite3\", \"database=\/home\/ilia\/.Skype\/sc.ryabokon.ilia\/main.db\");\n\t\t\/\/ create tables, sequences and indexes\n\t\tdb.verbose = true;\n\t\tauto ds = select<Messages>(db, Messages::Id > 100 && Messages::Id < 200);\n\t\tstd::cout << \"All messages count \" << ds.count() << std::endl;\n\t} catch (Except e) {\n\t\tstd::cerr << \"Error: \" << e << std::endl;\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>Skype test changes<commit_after>#include <iostream>\n#include \"litesql.hpp\"\n#include \"main.hpp\"\"\n\n\/\/ no name collisions expected\nusing namespace litesql;\nusing namespace SkypeDB;\n\nint main(int argc, char **argv) {\n\ttry {\n\t\tSkypeDB::main db(\"sqlite3\", \"database=\/home\/ilia\/.Skype\/sc.ryabokon.ilia\/main.db\");\n\t\t\/\/ create tables, sequences and indexes\n\t\tdb.verbose = true;\n\t\tauto ds = select<Messages>(db, Messages::Id > 100 && Messages::Id < 200);\n\t\tSelectQuery q;\n\t\tq.result(\"max(id)\");\n\t\tq.source(SkypeDB::Messages::table__);\n\t\tint r1 = atoi(db.query(q)[0][0]);\n\n\t} catch (Except e) {\n\t\tstd::cerr << \"Error: \" << e << std::endl;\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/video_render\/\/video_render_frames.h\"\n\n#include <cassert>\n\n#include \"modules\/interface\/module_common_types.h\"\n#include \"system_wrappers\/interface\/tick_util.h\"\n#include \"system_wrappers\/interface\/trace.h\"\n\nnamespace webrtc {\n\nconst int32_t KEventMaxWaitTimeMs = 200;\nconst uint32_t kMinRenderDelayMs = 10;\nconst uint32_t kMaxRenderDelayMs= 500;\n\nVideoRenderFrames::VideoRenderFrames()\n : incoming_frames_(),\n render_delay_ms_(10) {\n}\n\nVideoRenderFrames::~VideoRenderFrames() {\n ReleaseAllFrames();\n}\n\nint32_t VideoRenderFrames::AddFrame(I420VideoFrame* new_frame) {\n const int64_t time_now = TickTime::MillisecondTimestamp();\n\n if (new_frame->render_time_ms() + KOldRenderTimestampMS < time_now) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer, -1,\n \"%s: too old frame.\", __FUNCTION__);\n return -1;\n }\n if (new_frame->render_time_ms() > time_now + KFutureRenderTimestampMS) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer, -1,\n \"%s: frame too long into the future.\", __FUNCTION__);\n return -1;\n }\n\n \/\/ Get an empty frame\n I420VideoFrame* frame_to_add = NULL;\n if (!empty_frames_.Empty()) {\n ListItem* item = empty_frames_.First();\n if (item) {\n frame_to_add = static_cast<I420VideoFrame*>(item->GetItem());\n empty_frames_.Erase(item);\n }\n }\n if (!frame_to_add) {\n if (empty_frames_.GetSize() + incoming_frames_.GetSize() >\n KMaxNumberOfFrames) {\n \/\/ Already allocated too many frames.\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer,\n -1, \"%s: too many frames, limit: %d\", __FUNCTION__,\n KMaxNumberOfFrames);\n return -1;\n }\n\n \/\/ Allocate new memory.\n WEBRTC_TRACE(kTraceMemory, kTraceVideoRenderer, -1,\n \"%s: allocating buffer %d\", __FUNCTION__,\n empty_frames_.GetSize() + incoming_frames_.GetSize());\n\n frame_to_add = new I420VideoFrame();\n if (!frame_to_add) {\n WEBRTC_TRACE(kTraceError, kTraceVideoRenderer, -1,\n \"%s: could not create new frame for\", __FUNCTION__);\n return -1;\n }\n }\n\n frame_to_add->CreateEmptyFrame(new_frame->width(), new_frame->height(),\n new_frame->stride(kYPlane),\n new_frame->stride(kUPlane),\n new_frame->stride(kVPlane));\n \/\/ TODO(mflodman) Change this!\n \/\/ Remove const ness. Copying will be costly.\n frame_to_add->SwapFrame(new_frame);\n incoming_frames_.PushBack(frame_to_add);\n\n return incoming_frames_.GetSize();\n}\n\nI420VideoFrame* VideoRenderFrames::FrameToRender() {\n I420VideoFrame* render_frame = NULL;\n while (!incoming_frames_.Empty()) {\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* oldest_frame_in_list =\n static_cast<I420VideoFrame*>(item->GetItem());\n if (oldest_frame_in_list->render_time_ms() <=\n TickTime::MillisecondTimestamp() + render_delay_ms_) {\n \/\/ This is the oldest one so far and it's OK to render.\n if (render_frame) {\n \/\/ This one is older than the newly found frame, remove this one.\n render_frame->ResetSize();\n render_frame->set_timestamp(0);\n render_frame->set_render_time_ms(0);\n empty_frames_.PushFront(render_frame);\n }\n render_frame = oldest_frame_in_list;\n incoming_frames_.Erase(item);\n } else {\n \/\/ We can't release this one yet, we're done here.\n break;\n }\n } else {\n assert(false);\n }\n }\n return render_frame;\n}\n\nint32_t VideoRenderFrames::ReturnFrame(I420VideoFrame* old_frame) {\n old_frame->ResetSize();\n old_frame->set_timestamp(0);\n old_frame->set_render_time_ms(0);\n empty_frames_.PushBack(old_frame);\n return 0;\n}\n\nint32_t VideoRenderFrames::ReleaseAllFrames() {\n while (!incoming_frames_.Empty()) {\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* frame = static_cast<I420VideoFrame*>(item->GetItem());\n assert(frame != NULL);\n delete frame;\n }\n incoming_frames_.Erase(item);\n }\n while (!empty_frames_.Empty()) {\n ListItem* item = empty_frames_.First();\n if (item) {\n I420VideoFrame* frame = static_cast<I420VideoFrame*>(item->GetItem());\n assert(frame != NULL);\n delete frame;\n }\n empty_frames_.Erase(item);\n }\n return 0;\n}\n\nuint32_t VideoRenderFrames::TimeToNextFrameRelease() {\n int64_t time_to_release = 0;\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* oldest_frame =\n static_cast<I420VideoFrame*>(item->GetItem());\n time_to_release = oldest_frame->render_time_ms() - render_delay_ms_\n - TickTime::MillisecondTimestamp();\n if (time_to_release < 0) {\n time_to_release = 0;\n }\n } else {\n time_to_release = KEventMaxWaitTimeMs;\n }\n return static_cast<uint32_t>(time_to_release);\n}\n\nint32_t VideoRenderFrames::SetRenderDelay(\n const uint32_t render_delay) {\n if (render_delay < kMinRenderDelayMs ||\n render_delay > kMaxRenderDelayMs) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer,\n -1, \"%s(%d): Invalid argument.\", __FUNCTION__,\n render_delay);\n return -1;\n }\n\n render_delay_ms_ = render_delay;\n return 0;\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Log timestamp of the frame when it's dropped from the render module<commit_after>\/*\n * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/video_render\/\/video_render_frames.h\"\n\n#include <cassert>\n\n#include \"modules\/interface\/module_common_types.h\"\n#include \"system_wrappers\/interface\/tick_util.h\"\n#include \"system_wrappers\/interface\/trace.h\"\n\nnamespace webrtc {\n\nconst int32_t KEventMaxWaitTimeMs = 200;\nconst uint32_t kMinRenderDelayMs = 10;\nconst uint32_t kMaxRenderDelayMs= 500;\n\nVideoRenderFrames::VideoRenderFrames()\n : incoming_frames_(),\n render_delay_ms_(10) {\n}\n\nVideoRenderFrames::~VideoRenderFrames() {\n ReleaseAllFrames();\n}\n\nint32_t VideoRenderFrames::AddFrame(I420VideoFrame* new_frame) {\n const int64_t time_now = TickTime::MillisecondTimestamp();\n\n if (new_frame->render_time_ms() + KOldRenderTimestampMS < time_now) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer, -1,\n \"%s: too old frame, timestamp=%u.\",\n __FUNCTION__, new_frame->timestamp());\n return -1;\n }\n if (new_frame->render_time_ms() > time_now + KFutureRenderTimestampMS) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer, -1,\n \"%s: frame too long into the future, timestamp=%u.\",\n __FUNCTION__, new_frame->timestamp());\n return -1;\n }\n\n \/\/ Get an empty frame\n I420VideoFrame* frame_to_add = NULL;\n if (!empty_frames_.Empty()) {\n ListItem* item = empty_frames_.First();\n if (item) {\n frame_to_add = static_cast<I420VideoFrame*>(item->GetItem());\n empty_frames_.Erase(item);\n }\n }\n if (!frame_to_add) {\n if (empty_frames_.GetSize() + incoming_frames_.GetSize() >\n KMaxNumberOfFrames) {\n \/\/ Already allocated too many frames.\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer,\n -1, \"%s: too many frames, timestamp=%u, limit=%d\",\n __FUNCTION__, new_frame->timestamp(), KMaxNumberOfFrames);\n return -1;\n }\n\n \/\/ Allocate new memory.\n WEBRTC_TRACE(kTraceMemory, kTraceVideoRenderer, -1,\n \"%s: allocating buffer %d\", __FUNCTION__,\n empty_frames_.GetSize() + incoming_frames_.GetSize());\n\n frame_to_add = new I420VideoFrame();\n if (!frame_to_add) {\n WEBRTC_TRACE(kTraceError, kTraceVideoRenderer, -1,\n \"%s: could not create new frame for\", __FUNCTION__);\n return -1;\n }\n }\n\n frame_to_add->CreateEmptyFrame(new_frame->width(), new_frame->height(),\n new_frame->stride(kYPlane),\n new_frame->stride(kUPlane),\n new_frame->stride(kVPlane));\n \/\/ TODO(mflodman) Change this!\n \/\/ Remove const ness. Copying will be costly.\n frame_to_add->SwapFrame(new_frame);\n incoming_frames_.PushBack(frame_to_add);\n\n return incoming_frames_.GetSize();\n}\n\nI420VideoFrame* VideoRenderFrames::FrameToRender() {\n I420VideoFrame* render_frame = NULL;\n while (!incoming_frames_.Empty()) {\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* oldest_frame_in_list =\n static_cast<I420VideoFrame*>(item->GetItem());\n if (oldest_frame_in_list->render_time_ms() <=\n TickTime::MillisecondTimestamp() + render_delay_ms_) {\n \/\/ This is the oldest one so far and it's OK to render.\n if (render_frame) {\n \/\/ This one is older than the newly found frame, remove this one.\n render_frame->ResetSize();\n render_frame->set_timestamp(0);\n render_frame->set_render_time_ms(0);\n empty_frames_.PushFront(render_frame);\n }\n render_frame = oldest_frame_in_list;\n incoming_frames_.Erase(item);\n } else {\n \/\/ We can't release this one yet, we're done here.\n break;\n }\n } else {\n assert(false);\n }\n }\n return render_frame;\n}\n\nint32_t VideoRenderFrames::ReturnFrame(I420VideoFrame* old_frame) {\n old_frame->ResetSize();\n old_frame->set_timestamp(0);\n old_frame->set_render_time_ms(0);\n empty_frames_.PushBack(old_frame);\n return 0;\n}\n\nint32_t VideoRenderFrames::ReleaseAllFrames() {\n while (!incoming_frames_.Empty()) {\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* frame = static_cast<I420VideoFrame*>(item->GetItem());\n assert(frame != NULL);\n delete frame;\n }\n incoming_frames_.Erase(item);\n }\n while (!empty_frames_.Empty()) {\n ListItem* item = empty_frames_.First();\n if (item) {\n I420VideoFrame* frame = static_cast<I420VideoFrame*>(item->GetItem());\n assert(frame != NULL);\n delete frame;\n }\n empty_frames_.Erase(item);\n }\n return 0;\n}\n\nuint32_t VideoRenderFrames::TimeToNextFrameRelease() {\n int64_t time_to_release = 0;\n ListItem* item = incoming_frames_.First();\n if (item) {\n I420VideoFrame* oldest_frame =\n static_cast<I420VideoFrame*>(item->GetItem());\n time_to_release = oldest_frame->render_time_ms() - render_delay_ms_\n - TickTime::MillisecondTimestamp();\n if (time_to_release < 0) {\n time_to_release = 0;\n }\n } else {\n time_to_release = KEventMaxWaitTimeMs;\n }\n return static_cast<uint32_t>(time_to_release);\n}\n\nint32_t VideoRenderFrames::SetRenderDelay(\n const uint32_t render_delay) {\n if (render_delay < kMinRenderDelayMs ||\n render_delay > kMaxRenderDelayMs) {\n WEBRTC_TRACE(kTraceWarning, kTraceVideoRenderer,\n -1, \"%s(%d): Invalid argument.\", __FUNCTION__,\n render_delay);\n return -1;\n }\n\n render_delay_ms_ = render_delay;\n return 0;\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2006-2021 Music Technology Group - Universitat Pompeu Fabra\n *\n * This file is part of Essentia\n *\n * Essentia is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation (FSF), either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\n * You should have received a copy of the Affero GNU General Public License\n * version 3 along with this program. If not, see http:\/\/www.gnu.org\/licenses\/\n *\/\n\n#include \"tensorflowpredicttempocnn.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* TensorflowPredictTempoCNN::name = essentia::standard::TensorflowPredictTempoCNN::name;\nconst char* TensorflowPredictTempoCNN::category = essentia::standard::TensorflowPredictTempoCNN::category;\nconst char* TensorflowPredictTempoCNN::description = essentia::standard::TensorflowPredictTempoCNN::description;\n\n\nTensorflowPredictTempoCNN::TensorflowPredictTempoCNN() : AlgorithmComposite(),\n _frameCutter(0), _tensorflowInputTempoCNN(0), _vectorRealToTensor(0), _tensorNormalize(0),\n _tensorTranspose(0), _tensorToPool(0), _tensorflowPredict(0), _poolToTensor(0),\n _tensorToVectorReal(0), _configured(false) {\n\n declareInput(_signal, 4096, \"signal\", \"the input audio signal sampled at 11025 Hz\");\n declareOutput(_predictions, 0, \"predictions\", \"the output values from the model node named after `output`\");\n}\n\n\nvoid TensorflowPredictTempoCNN::createInnerNetwork() {\n AlgorithmFactory& factory = AlgorithmFactory::instance();\n\n _frameCutter = factory.create(\"FrameCutter\");\n _tensorflowInputTempoCNN = factory.create(\"TensorflowInputTempoCNN\");\n _vectorRealToTensor = factory.create(\"VectorRealToTensor\");\n _tensorNormalize = factory.create(\"TensorNormalize\");\n _tensorTranspose = factory.create(\"TensorTranspose\");\n _tensorToPool = factory.create(\"TensorToPool\");\n _tensorflowPredict = factory.create(\"TensorflowPredict\");\n _poolToTensor = factory.create(\"PoolToTensor\");\n _tensorToVectorReal = factory.create(\"TensorToVectorReal\");\n\n _tensorflowInputTempoCNN->output(\"bands\").setBufferType(BufferUsage::forMultipleFrames);\n\n _signal >> _frameCutter->input(\"signal\");\n _frameCutter->output(\"frame\") >> _tensorflowInputTempoCNN->input(\"frame\");\n _tensorflowInputTempoCNN->output(\"bands\") >> _vectorRealToTensor->input(\"frame\");\n _vectorRealToTensor->output(\"tensor\") >> _tensorNormalize->input(\"tensor\");\n _tensorNormalize->output(\"tensor\") >> _tensorTranspose->input(\"tensor\");\n _tensorTranspose->output(\"tensor\") >> _tensorToPool->input(\"tensor\");\n _tensorToPool->output(\"pool\") >> _tensorflowPredict->input(\"poolIn\");\n _tensorflowPredict->output(\"poolOut\") >> _poolToTensor->input(\"pool\");\n _poolToTensor->output(\"tensor\") >> _tensorToVectorReal->input(\"tensor\");\n\n attach(_tensorToVectorReal->output(\"frame\"), _predictions);\n\n _network = new scheduler::Network(_frameCutter);\n}\n\n\nvoid TensorflowPredictTempoCNN::clearAlgos() {\n if (!_configured) return;\n delete _network;\n}\n\n\nTensorflowPredictTempoCNN::~TensorflowPredictTempoCNN() {\n clearAlgos();\n}\n\n\nvoid TensorflowPredictTempoCNN::reset() {\n AlgorithmComposite::reset();\n}\n\n\nvoid TensorflowPredictTempoCNN::configure() {\n if (_configured) {\n clearAlgos();\n }\n\n createInnerNetwork();\n\n int patchHopSize = parameter(\"patchHopSize\").toInt();\n string lastPatchMode = parameter(\"lastPatchMode\").toString();\n int batchSize = parameter(\"batchSize\").toInt();\n\n if (batchSize == 0) {\n throw EssentiaException(\"TensorflowPredictTempoCNN: 0 is not a valid `batchSize` value.\");\n }\n\n \/\/ Hardcoded parameters matching the training setup:\n \/\/ https:\/\/github.com\/hendriks73\/tempo-cnn\/blob\/master\/tempocnn\/feature.py\n int frameSize = 1024;\n int hopSize = 512;\n int patchSize = 256;\n int numberBands = 40;\n vector<int> inputShape({batchSize, 1, patchSize, numberBands});\n string scaler = \"standard\";\n\n \/\/ Hendrik's models expect data shaped as {Batch, Mels, Time, Channel}.\n vector<int> permutation({0, 3, 2, 1});\n\n _frameCutter->configure(\"frameSize\", frameSize, \"hopSize\", hopSize);\n\n _vectorRealToTensor->configure(\"shape\", inputShape,\n \"lastPatchMode\", lastPatchMode,\n \"patchHopSize\", patchHopSize);\n\n _tensorNormalize->configure(\"scaler\", scaler);\n \n _tensorTranspose->configure(\"permutation\", permutation);\n\n _configured = true;\n\n string input = parameter(\"input\").toString();\n string output = parameter(\"output\").toString();\n\n _tensorToPool->configure(\"namespace\", input);\n\n _poolToTensor->configure(\"namespace\", output);\n\n string graphFilename = parameter(\"graphFilename\").toString();\n string savedModel = parameter(\"savedModel\").toString();\n\n _tensorflowPredict->configure(\"graphFilename\", graphFilename,\n \"savedModel\", savedModel,\n \"squeeze\", false,\n \"inputs\", vector<string>({input}),\n \"outputs\", vector<string>({output}));\n}\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n\n\n\nnamespace essentia {\nnamespace standard {\n\nconst char* TensorflowPredictTempoCNN::name = \"TensorflowPredictTempoCNN\";\nconst char* TensorflowPredictTempoCNN::category = \"Machine Learning\";\nconst char* TensorflowPredictTempoCNN::description = DOC(\n \"This algorithm makes predictions using TempoCNN-based models.\\n\"\n \"\\n\"\n \"Internally, it uses TensorflowInputTempoCNN for the input feature \"\n \"extraction (mel bands). It feeds the model with patches of 256 mel bands \"\n \"frames and jumps a constant amount of frames determined by `patchHopSize`.\\n\"\n \"\\n\"\n \"With the `batchSize` parameter set to -1 or 0 the patches are stored to run a \"\n \"single TensorFlow session at the end of the stream. This allows to take \"\n \"advantage of parallelization when GPUs are available, but at the same time \"\n \"it can be memory exhausting for long files.\\n\"\n \"\\n\"\n \"The recommended pipeline is as follows::\\n\"\n \"\\n\"\n \" MonoLoader(sampleRate=11025) >> TensorflowPredictTempoCNN\\n\"\n \"\\n\"\n \"Note: This algorithm does not make any check on the input model so it is \"\n \"the user's responsibility to make sure it is a valid one.\\n\"\n \"\\n\"\n \"References:\\n\"\n \"\\n\"\n \"1. Hendrik Schreiber, Meinard Müller, A Single-Step Approach to Musical \"\n \"Tempo Estimation Using a Convolutional Neural Network Proceedings of the \"\n \"19th International Society for Music Information Retrieval Conference \"\n \"(ISMIR), Paris, France, Sept. 2018.\\n\\n\"\n \"2. Hendrik Schreiber, Meinard Müller, Musical Tempo and Key Estimation \"\n \"using Convolutional Neural Networks with Directional Filters Proceedings of \"\n \"the Sound and Music Computing Conference (SMC), Málaga, Spain, 2019.\\n\\n\"\n \"3. Original models and code at https:\/\/github.com\/hendriks73\/tempo-cnn\\n\\n\"\n \"4. Supported models at https:\/\/essentia.upf.edu\/models\/\\n\\n\");\n\n\nTensorflowPredictTempoCNN::TensorflowPredictTempoCNN() {\n declareInput(_signal, \"signal\", \"the input audio signal sampled at 11025 Hz\");\n declareOutput(_predictions, \"predictions\", \"the output values from the model node named after `output`\");\n\n createInnerNetwork();\n }\n\n\nTensorflowPredictTempoCNN::~TensorflowPredictTempoCNN() {\n delete _network;\n}\n\n\nvoid TensorflowPredictTempoCNN::createInnerNetwork() {\n _tensorflowPredictTempoCNN = streaming::AlgorithmFactory::create(\"TensorflowPredictTempoCNN\");\n _vectorInput = new streaming::VectorInput<Real>();\n\n *_vectorInput >> _tensorflowPredictTempoCNN->input(\"signal\");\n _tensorflowPredictTempoCNN->output(\"predictions\") >> PC(_pool, \"predictions\");\n\n _network = new scheduler::Network(_vectorInput);\n}\n\n\nvoid TensorflowPredictTempoCNN::configure() {\n _tensorflowPredictTempoCNN->configure(INHERIT(\"graphFilename\"),\n INHERIT(\"savedModel\"),\n INHERIT(\"input\"),\n INHERIT(\"output\"),\n INHERIT(\"patchHopSize\"),\n INHERIT(\"batchSize\"),\n INHERIT(\"lastPatchMode\"));\n}\n\n\nvoid TensorflowPredictTempoCNN::compute() {\n const vector<Real>& signal = _signal.get();\n vector<vector<Real> >& predictions = _predictions.get();\n\n if (!signal.size()) {\n throw EssentiaException(\"TensorflowPredictTempoCNN: empty input signal\");\n }\n\n _vectorInput->setVector(&signal);\n\n _network->run();\n\n try {\n predictions = _pool.value<vector<vector<Real> > >(\"predictions\");\n }\n catch (EssentiaException&) {\n predictions.clear();\n }\n\n reset();\n}\n\n\nvoid TensorflowPredictTempoCNN::reset() {\n _network->reset();\n _pool.remove(\"predictions\");\n}\n\n} \/\/ namespace standard\n} \/\/ namespace essentia\n<commit_msg>Remove exception on batchSize==0 in TempoCNN<commit_after>\/*\n * Copyright (C) 2006-2021 Music Technology Group - Universitat Pompeu Fabra\n *\n * This file is part of Essentia\n *\n * Essentia is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License as published by the Free\n * Software Foundation (FSF), either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\n * You should have received a copy of the Affero GNU General Public License\n * version 3 along with this program. If not, see http:\/\/www.gnu.org\/licenses\/\n *\/\n\n#include \"tensorflowpredicttempocnn.h\"\n\nusing namespace std;\n\nnamespace essentia {\nnamespace streaming {\n\nconst char* TensorflowPredictTempoCNN::name = essentia::standard::TensorflowPredictTempoCNN::name;\nconst char* TensorflowPredictTempoCNN::category = essentia::standard::TensorflowPredictTempoCNN::category;\nconst char* TensorflowPredictTempoCNN::description = essentia::standard::TensorflowPredictTempoCNN::description;\n\n\nTensorflowPredictTempoCNN::TensorflowPredictTempoCNN() : AlgorithmComposite(),\n _frameCutter(0), _tensorflowInputTempoCNN(0), _vectorRealToTensor(0), _tensorNormalize(0),\n _tensorTranspose(0), _tensorToPool(0), _tensorflowPredict(0), _poolToTensor(0),\n _tensorToVectorReal(0), _configured(false) {\n\n declareInput(_signal, 4096, \"signal\", \"the input audio signal sampled at 11025 Hz\");\n declareOutput(_predictions, 0, \"predictions\", \"the output values from the model node named after `output`\");\n}\n\n\nvoid TensorflowPredictTempoCNN::createInnerNetwork() {\n AlgorithmFactory& factory = AlgorithmFactory::instance();\n\n _frameCutter = factory.create(\"FrameCutter\");\n _tensorflowInputTempoCNN = factory.create(\"TensorflowInputTempoCNN\");\n _vectorRealToTensor = factory.create(\"VectorRealToTensor\");\n _tensorNormalize = factory.create(\"TensorNormalize\");\n _tensorTranspose = factory.create(\"TensorTranspose\");\n _tensorToPool = factory.create(\"TensorToPool\");\n _tensorflowPredict = factory.create(\"TensorflowPredict\");\n _poolToTensor = factory.create(\"PoolToTensor\");\n _tensorToVectorReal = factory.create(\"TensorToVectorReal\");\n\n _tensorflowInputTempoCNN->output(\"bands\").setBufferType(BufferUsage::forMultipleFrames);\n\n _signal >> _frameCutter->input(\"signal\");\n _frameCutter->output(\"frame\") >> _tensorflowInputTempoCNN->input(\"frame\");\n _tensorflowInputTempoCNN->output(\"bands\") >> _vectorRealToTensor->input(\"frame\");\n _vectorRealToTensor->output(\"tensor\") >> _tensorNormalize->input(\"tensor\");\n _tensorNormalize->output(\"tensor\") >> _tensorTranspose->input(\"tensor\");\n _tensorTranspose->output(\"tensor\") >> _tensorToPool->input(\"tensor\");\n _tensorToPool->output(\"pool\") >> _tensorflowPredict->input(\"poolIn\");\n _tensorflowPredict->output(\"poolOut\") >> _poolToTensor->input(\"pool\");\n _poolToTensor->output(\"tensor\") >> _tensorToVectorReal->input(\"tensor\");\n\n attach(_tensorToVectorReal->output(\"frame\"), _predictions);\n\n _network = new scheduler::Network(_frameCutter);\n}\n\n\nvoid TensorflowPredictTempoCNN::clearAlgos() {\n if (!_configured) return;\n delete _network;\n}\n\n\nTensorflowPredictTempoCNN::~TensorflowPredictTempoCNN() {\n clearAlgos();\n}\n\n\nvoid TensorflowPredictTempoCNN::reset() {\n AlgorithmComposite::reset();\n}\n\n\nvoid TensorflowPredictTempoCNN::configure() {\n if (_configured) {\n clearAlgos();\n }\n\n createInnerNetwork();\n\n int patchHopSize = parameter(\"patchHopSize\").toInt();\n string lastPatchMode = parameter(\"lastPatchMode\").toString();\n int batchSize = parameter(\"batchSize\").toInt();\n\n \/\/ Hardcoded parameters matching the training setup:\n \/\/ https:\/\/github.com\/hendriks73\/tempo-cnn\/blob\/master\/tempocnn\/feature.py\n int frameSize = 1024;\n int hopSize = 512;\n int patchSize = 256;\n int numberBands = 40;\n vector<int> inputShape({batchSize, 1, patchSize, numberBands});\n string scaler = \"standard\";\n\n \/\/ Hendrik's models expect data shaped as {Batch, Mels, Time, Channel}.\n vector<int> permutation({0, 3, 2, 1});\n\n _frameCutter->configure(\"frameSize\", frameSize, \"hopSize\", hopSize);\n\n _vectorRealToTensor->configure(\"shape\", inputShape,\n \"lastPatchMode\", lastPatchMode,\n \"patchHopSize\", patchHopSize);\n\n _tensorNormalize->configure(\"scaler\", scaler);\n \n _tensorTranspose->configure(\"permutation\", permutation);\n\n _configured = true;\n\n string input = parameter(\"input\").toString();\n string output = parameter(\"output\").toString();\n\n _tensorToPool->configure(\"namespace\", input);\n\n _poolToTensor->configure(\"namespace\", output);\n\n string graphFilename = parameter(\"graphFilename\").toString();\n string savedModel = parameter(\"savedModel\").toString();\n\n _tensorflowPredict->configure(\"graphFilename\", graphFilename,\n \"savedModel\", savedModel,\n \"squeeze\", false,\n \"inputs\", vector<string>({input}),\n \"outputs\", vector<string>({output}));\n}\n\n} \/\/ namespace streaming\n} \/\/ namespace essentia\n\n\n\nnamespace essentia {\nnamespace standard {\n\nconst char* TensorflowPredictTempoCNN::name = \"TensorflowPredictTempoCNN\";\nconst char* TensorflowPredictTempoCNN::category = \"Machine Learning\";\nconst char* TensorflowPredictTempoCNN::description = DOC(\n \"This algorithm makes predictions using TempoCNN-based models.\\n\"\n \"\\n\"\n \"Internally, it uses TensorflowInputTempoCNN for the input feature \"\n \"extraction (mel bands). It feeds the model with patches of 256 mel bands \"\n \"frames and jumps a constant amount of frames determined by `patchHopSize`.\\n\"\n \"\\n\"\n \"With the `batchSize` parameter set to -1 or 0 the patches are stored to run a \"\n \"single TensorFlow session at the end of the stream. This allows to take \"\n \"advantage of parallelization when GPUs are available, but at the same time \"\n \"it can be memory exhausting for long files.\\n\"\n \"\\n\"\n \"The recommended pipeline is as follows::\\n\"\n \"\\n\"\n \" MonoLoader(sampleRate=11025) >> TensorflowPredictTempoCNN\\n\"\n \"\\n\"\n \"Note: This algorithm does not make any check on the input model so it is \"\n \"the user's responsibility to make sure it is a valid one.\\n\"\n \"\\n\"\n \"References:\\n\"\n \"\\n\"\n \"1. Hendrik Schreiber, Meinard Müller, A Single-Step Approach to Musical \"\n \"Tempo Estimation Using a Convolutional Neural Network Proceedings of the \"\n \"19th International Society for Music Information Retrieval Conference \"\n \"(ISMIR), Paris, France, Sept. 2018.\\n\\n\"\n \"2. Hendrik Schreiber, Meinard Müller, Musical Tempo and Key Estimation \"\n \"using Convolutional Neural Networks with Directional Filters Proceedings of \"\n \"the Sound and Music Computing Conference (SMC), Málaga, Spain, 2019.\\n\\n\"\n \"3. Original models and code at https:\/\/github.com\/hendriks73\/tempo-cnn\\n\\n\"\n \"4. Supported models at https:\/\/essentia.upf.edu\/models\/\\n\\n\");\n\n\nTensorflowPredictTempoCNN::TensorflowPredictTempoCNN() {\n declareInput(_signal, \"signal\", \"the input audio signal sampled at 11025 Hz\");\n declareOutput(_predictions, \"predictions\", \"the output values from the model node named after `output`\");\n\n createInnerNetwork();\n }\n\n\nTensorflowPredictTempoCNN::~TensorflowPredictTempoCNN() {\n delete _network;\n}\n\n\nvoid TensorflowPredictTempoCNN::createInnerNetwork() {\n _tensorflowPredictTempoCNN = streaming::AlgorithmFactory::create(\"TensorflowPredictTempoCNN\");\n _vectorInput = new streaming::VectorInput<Real>();\n\n *_vectorInput >> _tensorflowPredictTempoCNN->input(\"signal\");\n _tensorflowPredictTempoCNN->output(\"predictions\") >> PC(_pool, \"predictions\");\n\n _network = new scheduler::Network(_vectorInput);\n}\n\n\nvoid TensorflowPredictTempoCNN::configure() {\n _tensorflowPredictTempoCNN->configure(INHERIT(\"graphFilename\"),\n INHERIT(\"savedModel\"),\n INHERIT(\"input\"),\n INHERIT(\"output\"),\n INHERIT(\"patchHopSize\"),\n INHERIT(\"batchSize\"),\n INHERIT(\"lastPatchMode\"));\n}\n\n\nvoid TensorflowPredictTempoCNN::compute() {\n const vector<Real>& signal = _signal.get();\n vector<vector<Real> >& predictions = _predictions.get();\n\n if (!signal.size()) {\n throw EssentiaException(\"TensorflowPredictTempoCNN: empty input signal\");\n }\n\n _vectorInput->setVector(&signal);\n\n _network->run();\n\n try {\n predictions = _pool.value<vector<vector<Real> > >(\"predictions\");\n }\n catch (EssentiaException&) {\n predictions.clear();\n }\n\n reset();\n}\n\n\nvoid TensorflowPredictTempoCNN::reset() {\n _network->reset();\n _pool.remove(\"predictions\");\n}\n\n} \/\/ namespace standard\n} \/\/ namespace essentia\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix crash when checking an empty error message of an exception<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: handlerhelper.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: rt $ $Date: 2007-07-06 08:49:40 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_extensions.hxx\"\n\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_HANDLERHELPER_HXX\n#include \"handlerhelper.hxx\"\n#endif\n#ifndef EXTENSIONS_PROPRESID_HRC\n#include \"propresid.hrc\"\n#endif\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.hxx>\n#endif\n#ifndef _EXTENSIONS_PROPCTRLR_MODULEPRC_HXX_\n#include \"modulepcr.hxx\"\n#endif\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_ENUMREPRESENTATION_HXX\n#include \"enumrepresentation.hxx\"\n#endif\n#ifndef _EXTENSIONS_PROPCTRLR_FORMMETADATA_HXX_\n#include \"formmetadata.hxx\"\n#endif\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_PCROMPONENTCONTEXT_HXX\n#include \"pcrcomponentcontext.hxx\"\n#endif\n\n\/** === begin UNO includes === **\/\n#ifndef _COM_SUN_STAR_INSPECTION_STRINGREPRESENTATION_HPP_\n#include \"com\/sun\/star\/inspection\/StringRepresentation.hpp\"\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XMODIFIABLE_HPP_\n#include <com\/sun\/star\/util\/XModifiable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_LINEDESCRIPTOR_HPP_\n#include <com\/sun\/star\/inspection\/LineDescriptor.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_PROPERTYCONTROLTYPE_HPP_\n#include <com\/sun\/star\/inspection\/PropertyControlType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_XSTRINGLISTCONTROL_HPP_\n#include <com\/sun\/star\/inspection\/XStringListControl.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_XNUMERICCONTROL_HPP_\n#include <com\/sun\/star\/inspection\/XNumericControl.hpp>\n#endif\n\/** === end UNO includes === **\/\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n\n#include <algorithm>\n\n\/\/........................................................................\nnamespace pcr\n{\n\/\/........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::com::sun::star::awt;\n using namespace ::com::sun::star::util;\n using namespace ::com::sun::star::beans;\n using namespace ::com::sun::star::script;\n using namespace ::com::sun::star::inspection;\n\n \/\/====================================================================\n \/\/= PropertyHandlerHelper\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n void PropertyHandlerHelper::describePropertyLine( const Property& _rProperty,\n LineDescriptor& \/* [out] *\/ _out_rDescriptor, const Reference< XPropertyControlFactory >& _rxControlFactory )\n {\n \/\/ display the pure property name - no L10N\n _out_rDescriptor.DisplayName = _rProperty.Name;\n\n OSL_PRECOND( _rxControlFactory.is(), \"PropertyHandlerHelper::describePropertyLine: no factory -> no control!\" );\n if ( !_rxControlFactory.is() )\n return;\n\n sal_Bool bReadOnlyControl = requiresReadOnlyControl( _rProperty.Attributes );\n\n \/\/ special handling for booleans (this will become a list)\n if ( _rProperty.Type.getTypeClass() == TypeClass_BOOLEAN )\n {\n String aBoolOptions = String( PcrRes( RID_STR_BOOL ) );\n Sequence< ::rtl::OUString > aEntries(2);\n for ( xub_StrLen i=0; i<2; ++i )\n aEntries[i] = aBoolOptions.GetToken( i );\n _out_rDescriptor.Control = createListBoxControl( _rxControlFactory, aEntries, bReadOnlyControl, sal_False );\n return;\n }\n\n sal_Int16 nControlType = PropertyControlType::TextField;\n switch ( _rProperty.Type.getTypeClass() )\n {\n case TypeClass_BYTE:\n case TypeClass_SHORT:\n case TypeClass_UNSIGNED_SHORT:\n case TypeClass_LONG:\n case TypeClass_UNSIGNED_LONG:\n case TypeClass_HYPER:\n case TypeClass_UNSIGNED_HYPER:\n case TypeClass_FLOAT:\n case TypeClass_DOUBLE:\n nControlType = PropertyControlType::NumericField;\n break;\n\n case TypeClass_SEQUENCE:\n nControlType = PropertyControlType::StringListField;\n break;\n\n default:\n DBG_ERROR( \"PropertyHandlerHelper::describePropertyLine: don't know how to represent this at the UI!\" );\n \/\/ NO break!\n\n case TypeClass_STRING:\n nControlType = PropertyControlType::TextField;\n break;\n }\n\n \/\/ create a control\n _out_rDescriptor.Control = _rxControlFactory->createPropertyControl( nControlType, bReadOnlyControl );\n }\n\n \/\/--------------------------------------------------------------------\n namespace\n {\n Reference< XPropertyControl > lcl_implCreateListLikeControl(\n const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries,\n sal_Bool _bReadOnlyControl,\n sal_Bool _bSorted,\n sal_Bool _bTrueIfListBoxFalseIfComboBox\n )\n {\n Reference< XStringListControl > xListControl(\n _rxControlFactory->createPropertyControl(\n _bTrueIfListBoxFalseIfComboBox ? PropertyControlType::ListBox : PropertyControlType::ComboBox, _bReadOnlyControl\n ),\n UNO_QUERY_THROW\n );\n\n ::std::vector< ::rtl::OUString > aInitialEntries( _rInitialListEntries );\n if ( _bSorted )\n ::std::sort( aInitialEntries.begin(), aInitialEntries.end() );\n\n for ( ::std::vector< ::rtl::OUString >::const_iterator loop = aInitialEntries.begin();\n loop != aInitialEntries.end();\n ++loop\n )\n xListControl->appendListEntry( *loop );\n return xListControl.get();\n }\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createListBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const Sequence< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n ::std::vector< ::rtl::OUString > aAsVector( _rInitialListEntries.getConstArray(), _rInitialListEntries.getConstArray() + _rInitialListEntries.getLength() );\n return lcl_implCreateListLikeControl( _rxControlFactory, aAsVector, _bReadOnlyControl, _bSorted, sal_True );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createListBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n return lcl_implCreateListLikeControl( _rxControlFactory, _rInitialListEntries, _bReadOnlyControl, _bSorted, sal_True );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createComboBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const Sequence< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n ::std::vector< ::rtl::OUString > aAsVector( _rInitialListEntries.getConstArray(), _rInitialListEntries.getConstArray() + _rInitialListEntries.getLength() );\n return lcl_implCreateListLikeControl( _rxControlFactory, aAsVector, _bReadOnlyControl, _bSorted, sal_False );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createComboBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n return lcl_implCreateListLikeControl( _rxControlFactory, _rInitialListEntries, _bReadOnlyControl, _bSorted, sal_False );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createNumericControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n sal_Int16 _nDigits, const Optional< double >& _rMinValue, const Optional< double >& _rMaxValue, sal_Bool _bReadOnlyControl )\n {\n Reference< XNumericControl > xNumericControl(\n _rxControlFactory->createPropertyControl( PropertyControlType::NumericField, _bReadOnlyControl ),\n UNO_QUERY_THROW\n );\n\n xNumericControl->setDecimalDigits( _nDigits );\n xNumericControl->setMinValue( _rMinValue );\n xNumericControl->setMaxValue( _rMaxValue );\n\n return xNumericControl.get();\n }\n\n \/\/--------------------------------------------------------------------\n Any PropertyHandlerHelper::convertToPropertyValue( const Reference< XComponentContext >& _rxContext,const Reference< XTypeConverter >& _rxTypeConverter,\n const Property& _rProperty, const Any& _rControlValue )\n {\n Any aPropertyValue( _rControlValue );\n if ( !aPropertyValue.hasValue() )\n \/\/ NULL is converted to NULL\n return aPropertyValue;\n\n if ( aPropertyValue.getValueType().equals( _rProperty.Type ) )\n \/\/ nothing to do, type is already as desired\n return aPropertyValue;\n\n if ( _rControlValue.getValueType().getTypeClass() == TypeClass_STRING )\n {\n ::rtl::OUString sControlValue;\n _rControlValue >>= sControlValue;\n\n Reference< XStringRepresentation > xConversionHelper = StringRepresentation::create( _rxContext,_rxTypeConverter );\n aPropertyValue = xConversionHelper->convertToPropertyValue( sControlValue, _rProperty.Type );\n }\n else\n {\n try\n {\n if ( _rxTypeConverter.is() )\n aPropertyValue = _rxTypeConverter->convertTo( _rControlValue, _rProperty.Type );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"PropertyHandlerHelper::convertToPropertyValue: caught an exception while converting via TypeConverter!\" );\n }\n }\n\n return aPropertyValue;\n }\n\n \/\/--------------------------------------------------------------------\n Any PropertyHandlerHelper::convertToControlValue( const Reference< XComponentContext >& _rxContext,const Reference< XTypeConverter >& _rxTypeConverter,\n const Any& _rPropertyValue, const Type& _rControlValueType )\n {\n Any aControlValue( _rPropertyValue );\n if ( !aControlValue.hasValue() )\n \/\/ NULL is converted to NULL\n return aControlValue;\n\n if ( _rControlValueType.getTypeClass() == TypeClass_STRING )\n {\n Reference< XStringRepresentation > xConversionHelper = StringRepresentation::create( _rxContext,_rxTypeConverter );\n aControlValue <<= xConversionHelper->convertToControlValue( _rPropertyValue );\n }\n else\n {\n try\n {\n if ( _rxTypeConverter.is() )\n aControlValue = _rxTypeConverter->convertTo( _rPropertyValue, _rControlValueType );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"PropertyHandlerHelper::convertToControlValue: caught an exception while converting via TypeConverter!\" );\n }\n }\n\n return aControlValue;\n }\n\n \/\/--------------------------------------------------------------------\n void PropertyHandlerHelper::setContextDocumentModified( const ComponentContext& _rContext )\n {\n try\n {\n Reference< XModifiable > xDocumentModifiable( _rContext.getContextValueByAsciiName( \"ContextDocument\" ), UNO_QUERY_THROW );\n xDocumentModifiable->setModified( sal_True );\n }\n catch( const Exception& e )\n {\n #if OSL_DEBUG_LEVEL > 0\n ::rtl::OString sMessage( \"PropertyHandlerHelper::setContextDocumentModified: caught an exception!\\n\" );\n sMessage += \"message:\\n\";\n sMessage += ::rtl::OString( e.Message.getStr(), e.Message.getLength(), osl_getThreadTextEncoding() );\n OSL_ENSURE( false, sMessage );\n #else\n e; \/\/ make compiler happy\n #endif\n }\n }\n\n \/\/--------------------------------------------------------------------\n Window* PropertyHandlerHelper::getDialogParentWindow( const ComponentContext& _rContext )\n {\n Window* pInspectorWindow = NULL;\n try\n {\n Reference< XWindow > xInspectorWindow( _rContext.getContextValueByAsciiName( \"DialogParentWindow\" ), UNO_QUERY_THROW );\n pInspectorWindow = VCLUnoHelper::GetWindow( xInspectorWindow );\n }\n catch( const Exception& e )\n {\n #if OSL_DEBUG_LEVEL > 0\n ::rtl::OString sMessage( \"PropertyHandlerHelper::getDialogParentWindow: caught an exception!\\n\" );\n sMessage += \"message:\\n\";\n sMessage += ::rtl::OString( e.Message.getStr(), e.Message.getLength(), osl_getThreadTextEncoding() );\n OSL_ENSURE( false, sMessage );\n #else\n e; \/\/ make compiler happy\n #endif\n }\n return pInspectorWindow;\n }\n\n\/\/........................................................................\n} \/\/ namespace pcr\n\/\/........................................................................\n<commit_msg>INTEGRATION: CWS wae4extensions (1.7.44); FILE MERGED 2007\/09\/27 07:18:25 fs 1.7.44.1: #i81612# warning-free code<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: handlerhelper.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: ihi $ $Date: 2008-01-14 14:59:27 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_extensions.hxx\"\n\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_HANDLERHELPER_HXX\n#include \"handlerhelper.hxx\"\n#endif\n#ifndef EXTENSIONS_PROPRESID_HRC\n#include \"propresid.hrc\"\n#endif\n#ifndef _COMPHELPER_EXTRACT_HXX_\n#include <comphelper\/extract.hxx>\n#endif\n#ifndef _EXTENSIONS_PROPCTRLR_MODULEPRC_HXX_\n#include \"modulepcr.hxx\"\n#endif\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_ENUMREPRESENTATION_HXX\n#include \"enumrepresentation.hxx\"\n#endif\n#ifndef _EXTENSIONS_PROPCTRLR_FORMMETADATA_HXX_\n#include \"formmetadata.hxx\"\n#endif\n#ifndef EXTENSIONS_SOURCE_PROPCTRLR_PCROMPONENTCONTEXT_HXX\n#include \"pcrcomponentcontext.hxx\"\n#endif\n\n\/** === begin UNO includes === **\/\n#ifndef _COM_SUN_STAR_INSPECTION_STRINGREPRESENTATION_HPP_\n#include \"com\/sun\/star\/inspection\/StringRepresentation.hpp\"\n#endif\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UNO_XCOMPONENTCONTEXT_HPP_\n#include <com\/sun\/star\/uno\/XComponentContext.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XMODIFIABLE_HPP_\n#include <com\/sun\/star\/util\/XModifiable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_LINEDESCRIPTOR_HPP_\n#include <com\/sun\/star\/inspection\/LineDescriptor.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_PROPERTYCONTROLTYPE_HPP_\n#include <com\/sun\/star\/inspection\/PropertyControlType.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_XSTRINGLISTCONTROL_HPP_\n#include <com\/sun\/star\/inspection\/XStringListControl.hpp>\n#endif\n#ifndef _COM_SUN_STAR_INSPECTION_XNUMERICCONTROL_HPP_\n#include <com\/sun\/star\/inspection\/XNumericControl.hpp>\n#endif\n\/** === end UNO includes === **\/\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef TOOLS_DIAGNOSE_EX_H\n#include <tools\/diagnose_ex.h>\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n\n#include <algorithm>\n\n\/\/........................................................................\nnamespace pcr\n{\n\/\/........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::com::sun::star::awt;\n using namespace ::com::sun::star::util;\n using namespace ::com::sun::star::beans;\n using namespace ::com::sun::star::script;\n using namespace ::com::sun::star::inspection;\n\n \/\/====================================================================\n \/\/= PropertyHandlerHelper\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n void PropertyHandlerHelper::describePropertyLine( const Property& _rProperty,\n LineDescriptor& \/* [out] *\/ _out_rDescriptor, const Reference< XPropertyControlFactory >& _rxControlFactory )\n {\n \/\/ display the pure property name - no L10N\n _out_rDescriptor.DisplayName = _rProperty.Name;\n\n OSL_PRECOND( _rxControlFactory.is(), \"PropertyHandlerHelper::describePropertyLine: no factory -> no control!\" );\n if ( !_rxControlFactory.is() )\n return;\n\n sal_Bool bReadOnlyControl = requiresReadOnlyControl( _rProperty.Attributes );\n\n \/\/ special handling for booleans (this will become a list)\n if ( _rProperty.Type.getTypeClass() == TypeClass_BOOLEAN )\n {\n String aBoolOptions = String( PcrRes( RID_STR_BOOL ) );\n Sequence< ::rtl::OUString > aEntries(2);\n for ( xub_StrLen i=0; i<2; ++i )\n aEntries[i] = aBoolOptions.GetToken( i );\n _out_rDescriptor.Control = createListBoxControl( _rxControlFactory, aEntries, bReadOnlyControl, sal_False );\n return;\n }\n\n sal_Int16 nControlType = PropertyControlType::TextField;\n switch ( _rProperty.Type.getTypeClass() )\n {\n case TypeClass_BYTE:\n case TypeClass_SHORT:\n case TypeClass_UNSIGNED_SHORT:\n case TypeClass_LONG:\n case TypeClass_UNSIGNED_LONG:\n case TypeClass_HYPER:\n case TypeClass_UNSIGNED_HYPER:\n case TypeClass_FLOAT:\n case TypeClass_DOUBLE:\n nControlType = PropertyControlType::NumericField;\n break;\n\n case TypeClass_SEQUENCE:\n nControlType = PropertyControlType::StringListField;\n break;\n\n default:\n DBG_ERROR( \"PropertyHandlerHelper::describePropertyLine: don't know how to represent this at the UI!\" );\n \/\/ NO break!\n\n case TypeClass_STRING:\n nControlType = PropertyControlType::TextField;\n break;\n }\n\n \/\/ create a control\n _out_rDescriptor.Control = _rxControlFactory->createPropertyControl( nControlType, bReadOnlyControl );\n }\n\n \/\/--------------------------------------------------------------------\n namespace\n {\n Reference< XPropertyControl > lcl_implCreateListLikeControl(\n const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries,\n sal_Bool _bReadOnlyControl,\n sal_Bool _bSorted,\n sal_Bool _bTrueIfListBoxFalseIfComboBox\n )\n {\n Reference< XStringListControl > xListControl(\n _rxControlFactory->createPropertyControl(\n _bTrueIfListBoxFalseIfComboBox ? PropertyControlType::ListBox : PropertyControlType::ComboBox, _bReadOnlyControl\n ),\n UNO_QUERY_THROW\n );\n\n ::std::vector< ::rtl::OUString > aInitialEntries( _rInitialListEntries );\n if ( _bSorted )\n ::std::sort( aInitialEntries.begin(), aInitialEntries.end() );\n\n for ( ::std::vector< ::rtl::OUString >::const_iterator loop = aInitialEntries.begin();\n loop != aInitialEntries.end();\n ++loop\n )\n xListControl->appendListEntry( *loop );\n return xListControl.get();\n }\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createListBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const Sequence< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n ::std::vector< ::rtl::OUString > aAsVector( _rInitialListEntries.getConstArray(), _rInitialListEntries.getConstArray() + _rInitialListEntries.getLength() );\n return lcl_implCreateListLikeControl( _rxControlFactory, aAsVector, _bReadOnlyControl, _bSorted, sal_True );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createListBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n return lcl_implCreateListLikeControl( _rxControlFactory, _rInitialListEntries, _bReadOnlyControl, _bSorted, sal_True );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createComboBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const Sequence< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n ::std::vector< ::rtl::OUString > aAsVector( _rInitialListEntries.getConstArray(), _rInitialListEntries.getConstArray() + _rInitialListEntries.getLength() );\n return lcl_implCreateListLikeControl( _rxControlFactory, aAsVector, _bReadOnlyControl, _bSorted, sal_False );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createComboBoxControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n const ::std::vector< ::rtl::OUString >& _rInitialListEntries, sal_Bool _bReadOnlyControl, sal_Bool _bSorted )\n {\n return lcl_implCreateListLikeControl( _rxControlFactory, _rInitialListEntries, _bReadOnlyControl, _bSorted, sal_False );\n }\n\n \/\/--------------------------------------------------------------------\n Reference< XPropertyControl > PropertyHandlerHelper::createNumericControl( const Reference< XPropertyControlFactory >& _rxControlFactory,\n sal_Int16 _nDigits, const Optional< double >& _rMinValue, const Optional< double >& _rMaxValue, sal_Bool _bReadOnlyControl )\n {\n Reference< XNumericControl > xNumericControl(\n _rxControlFactory->createPropertyControl( PropertyControlType::NumericField, _bReadOnlyControl ),\n UNO_QUERY_THROW\n );\n\n xNumericControl->setDecimalDigits( _nDigits );\n xNumericControl->setMinValue( _rMinValue );\n xNumericControl->setMaxValue( _rMaxValue );\n\n return xNumericControl.get();\n }\n\n \/\/--------------------------------------------------------------------\n Any PropertyHandlerHelper::convertToPropertyValue( const Reference< XComponentContext >& _rxContext,const Reference< XTypeConverter >& _rxTypeConverter,\n const Property& _rProperty, const Any& _rControlValue )\n {\n Any aPropertyValue( _rControlValue );\n if ( !aPropertyValue.hasValue() )\n \/\/ NULL is converted to NULL\n return aPropertyValue;\n\n if ( aPropertyValue.getValueType().equals( _rProperty.Type ) )\n \/\/ nothing to do, type is already as desired\n return aPropertyValue;\n\n if ( _rControlValue.getValueType().getTypeClass() == TypeClass_STRING )\n {\n ::rtl::OUString sControlValue;\n _rControlValue >>= sControlValue;\n\n Reference< XStringRepresentation > xConversionHelper = StringRepresentation::create( _rxContext,_rxTypeConverter );\n aPropertyValue = xConversionHelper->convertToPropertyValue( sControlValue, _rProperty.Type );\n }\n else\n {\n try\n {\n if ( _rxTypeConverter.is() )\n aPropertyValue = _rxTypeConverter->convertTo( _rControlValue, _rProperty.Type );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"PropertyHandlerHelper::convertToPropertyValue: caught an exception while converting via TypeConverter!\" );\n }\n }\n\n return aPropertyValue;\n }\n\n \/\/--------------------------------------------------------------------\n Any PropertyHandlerHelper::convertToControlValue( const Reference< XComponentContext >& _rxContext,const Reference< XTypeConverter >& _rxTypeConverter,\n const Any& _rPropertyValue, const Type& _rControlValueType )\n {\n Any aControlValue( _rPropertyValue );\n if ( !aControlValue.hasValue() )\n \/\/ NULL is converted to NULL\n return aControlValue;\n\n if ( _rControlValueType.getTypeClass() == TypeClass_STRING )\n {\n Reference< XStringRepresentation > xConversionHelper = StringRepresentation::create( _rxContext,_rxTypeConverter );\n aControlValue <<= xConversionHelper->convertToControlValue( _rPropertyValue );\n }\n else\n {\n try\n {\n if ( _rxTypeConverter.is() )\n aControlValue = _rxTypeConverter->convertTo( _rPropertyValue, _rControlValueType );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"PropertyHandlerHelper::convertToControlValue: caught an exception while converting via TypeConverter!\" );\n }\n }\n\n return aControlValue;\n }\n\n \/\/--------------------------------------------------------------------\n void PropertyHandlerHelper::setContextDocumentModified( const ComponentContext& _rContext )\n {\n try\n {\n Reference< XModifiable > xDocumentModifiable( _rContext.getContextValueByAsciiName( \"ContextDocument\" ), UNO_QUERY_THROW );\n xDocumentModifiable->setModified( sal_True );\n }\n catch( const Exception& )\n {\n DBG_UNHANDLED_EXCEPTION();\n }\n }\n\n \/\/--------------------------------------------------------------------\n Window* PropertyHandlerHelper::getDialogParentWindow( const ComponentContext& _rContext )\n {\n Window* pInspectorWindow = NULL;\n try\n {\n Reference< XWindow > xInspectorWindow( _rContext.getContextValueByAsciiName( \"DialogParentWindow\" ), UNO_QUERY_THROW );\n pInspectorWindow = VCLUnoHelper::GetWindow( xInspectorWindow );\n }\n catch( const Exception& )\n {\n DBG_UNHANDLED_EXCEPTION();\n }\n return pInspectorWindow;\n }\n\n\/\/........................................................................\n} \/\/ namespace pcr\n\/\/........................................................................\n<|endoftext|>"} {"text":"<commit_before>\/* -------------------------------------------------------------------------- *\n * OpenSim: testAnalyzeTool.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2017 Stanford University and the Authors *\n * Author(s): Ayman Habib, Ajay Seth *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/\/ INCLUDE\n#include <OpenSim\/Common\/CSVFileAdapter.h>\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Simulation\/StatesTrajectory.h>\n#include <OpenSim\/Actuators\/Millard2012EquilibriumMuscle.h>\n#include <OpenSim\/Tools\/AnalyzeTool.h>\n#include <OpenSim\/Analyses\/OutputReporter.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestMuscleFunctions.h>\n#include <OpenSim\/Simulation\/SimbodyEngine\/FreeJoint.h>\n#include <OpenSim\/Simulation\/Manager\/Manager.h>\n#include <OpenSim\/Analyses\/BodyKinematics.h>\n\nusing namespace OpenSim;\nusing namespace std;\n\nvoid testTutorialOne();\nvoid testActuationAnalysisWithDisabledForce();\n\n\/\/ Test different default activations are respected when activation\n\/\/ states are not provided.\nvoid testTugOfWar(const string& dataFileName, const double& defaultAct);\n\nvoid testBodyKinematics();\n\nint main()\n{\n SimTK::Array_<std::string> failures;\n\n try { testTutorialOne(); }\n catch (const std::exception& e) {\n cout << e.what() << endl; failures.push_back(\"testTutorialOne\");\n }\n\n \/\/ produce passive force-length curve\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity.sto\", 0.01); }\n catch (const std::exception& e) {\n cout << e.what() << endl; \n failures.push_back(\"testTugOfWar CoordinatesOnly: default_act = 0.01\");\n }\n\n \/\/ produced passive + active muscle force-length\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity.sto\", 1.0); }\n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testTugOfWar CoordinatesOnly: default_act = 1.0\");\n }\n\n \/\/ now supply activation states which should be used instead of the default\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity_RampActivation.sto\", 0.0); }\n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testTugOfWar with activation state provided\");\n }\n\n try { testActuationAnalysisWithDisabledForce(); } \n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testActuationAnalysisWithDisabledForce\");\n }\n try { testBodyKinematics(); } \n catch (const std::exception& e) { \n cout << e.what() << endl;\n failures.push_back(\"testBodyKinematics\");\n } if (!failures.empty()) {\n cout << \"Done, with failure(s): \" << failures << endl;\n return 1;\n }\n\n cout << \"Done\" << endl;\n return 0;\n}\n\nvoid testTutorialOne() {\n AnalyzeTool analyze1(\"PlotterTool.xml\");\n analyze1.getModel().print(\"testAnalyzeTutorialOne.osim\");\n analyze1.run();\n \/* Once this runs to completion we'll make the test more meaningful by comparing output\n * to a validated standard. Let's make sure we don't crash during run first! -Ayman 5\/29\/12 *\/\n Storage resultFiberLength(\"testPlotterTool\/BothLegs__FiberLength.sto\");\n Storage standardFiberLength(\"std_BothLegs_fiberLength.sto\");\n CHECK_STORAGE_AGAINST_STANDARD(resultFiberLength, standardFiberLength,\n std::vector<double>(100, 0.0001), __FILE__, __LINE__,\n \"testAnalyzeTutorialOne failed\");\n \/\/ const Model& mdl = analyze1.getModel();\n \/\/mdl.updMultibodySystem()\n analyze1.setStatesFileName(\"plotterGeneratedStatesHip45.sto\");\n \/\/analyze1.setModel(mdl);\n analyze1.setName(\"BothLegsHip45\");\n analyze1.run();\n Storage resultFiberLengthHip45(\"testPlotterTool\/BothLegsHip45__FiberLength.sto\");\n Storage standardFiberLength45(\"std_BothLegsHip45__FiberLength.sto\");\n CHECK_STORAGE_AGAINST_STANDARD(resultFiberLengthHip45,\n standardFiberLength45, std::vector<double>(100, 0.0001),\n __FILE__, __LINE__, \"testAnalyzeTutorialOne at Hip45 failed\");\n cout << \"testAnalyzeTutorialOne passed\" << endl;\n}\n\nvoid testTugOfWar(const string& dataFileName, const double& defaultAct) {\n AnalyzeTool analyze(\"Tug_of_War_Setup_Analyze.xml\");\n analyze.setCoordinatesFileName(\"\");\n analyze.setStatesFileName(\"\");\n\n \/\/ Access the model and muscle being analyzed\n Model& model = analyze.getModel();\n Millard2012EquilibriumMuscle& muscle =\n static_cast<Millard2012EquilibriumMuscle&>(model.updMuscles()[0]);\n bool isCoordinatesOnly = true;\n \/\/ Load in the States used to recompute the results of the Analysis \n Storage dataStore(dataFileName);\n if (dataStore.getColumnLabels().findIndex(muscle.getName() + \".activation\") > 0) {\n isCoordinatesOnly = false;\n analyze.setStatesFileName(dataFileName);\n \/\/ ramp input starts at 0.0\n muscle.set_minimum_activation(0.0);\n }\n else {\n analyze.setCoordinatesFileName(dataFileName);\n }\n\n \/\/ Test that the default activation is taken into consideration by\n \/\/ the Analysis and reflected in the AnalyzeTool solution\n muscle.set_default_activation(defaultAct);\n\n analyze.run();\n\n \/\/ Load the AnalyzTool results for the muscle's force through time\n TimeSeriesTable_<double> results(\"Analyze_Tug_of_War\/Tug_of_War_Millard_Iso_ForceReporter_forces.sto\");\n assert(results.getNumColumns() == 1);\n SimTK::Vector forces = results.getDependentColumnAtIndex(0);\n\n TimeSeriesTable_<double> outputs_table(\"Analyze_Tug_of_War\/Tug_of_War_Millard_Iso_Outputs.sto\");\n SimTK::Vector tf_output = outputs_table.getDependentColumnAtIndex(1);\n\n \/\/ Load input data as StatesTrajectory used to perform the Analysis\n auto statesTraj = StatesTrajectory::createFromStatesStorage(\n model, dataStore, true, false);\n size_t nstates = statesTraj.getSize();\n\n \/\/ muscle active, passive, total muscle and tendon force quantities\n double af, pf, mf, tf, fl;\n af= pf = mf = tf = fl = SimTK::NaN;\n\n \/\/ Tolerance for muscle equilibrium solution \n const double equilTol = muscle.getMaxIsometricForce()*SimTK::SqrtEps;\n\n \/\/ The maximum acceptable change in force between two contiguous states\n const double maxDelta = muscle.getMaxIsometricForce() \/ 10;\n\n SimTK::State s = model.getWorkingState();\n \/\/ Independently compute the active fiber force at every state\n for (size_t i = 0; i < nstates; ++i) {\n s = statesTraj[i];\n \/\/ When the muscle states are not supplied in the input dataStore\n \/\/ (isCoordinatesOnly == true), then set it to its default value.\n if (isCoordinatesOnly) {\n muscle.setActivation(s, muscle.get_default_activation());\n }\n \/\/ technically, fiber lengths could be supplied, but this test case\n \/\/ (a typical use case) does not and therefore set to its default.\n muscle.setFiberLength(s, muscle.get_default_fiber_length());\n try {\n muscle.computeEquilibrium(s);\n }\n catch (const MuscleCannotEquilibrate& x) {\n \/\/ Write out the muscle equilibrium for error as a function of\n \/\/ fiber-length.\n reportTendonAndFiberForcesAcrossFiberLengths(muscle, s);\n throw x;\n }\n model.realizeDynamics(s);\n\n \/\/ Get the fiber-length\n fl = muscle.getFiberLength(s);\n\n cout << \"t = \" << s.getTime() << \" | fiber_length = \" << fl <<\n \" : default_fiber_length = \" << muscle.get_default_fiber_length() << endl;\n\n SimTK_ASSERT_ALWAYS(fl >= muscle.getMinimumFiberLength(),\n \"Equilibrium failed to compute valid fiber length.\");\n\n if (isCoordinatesOnly) {\n \/\/ check that activation is not reset to zero or other value\n SimTK_ASSERT_ALWAYS(muscle.getActivation(s) == defaultAct,\n \"Test failed to correctly use the default activation value.\");\n }\n else {\n \/\/ check that activation used was that supplied by the dataStore\n SimTK_ASSERT_ALWAYS(muscle.getActivation(s) == s.getTime(),\n \"Test failed to correctly use the supplied activation values.\");\n }\n \n \/\/ get active and passive forces given the default activation\n af = muscle.getActiveFiberForceAlongTendon(s);\n pf = muscle.getPassiveFiberForceAlongTendon(s);\n\n \/\/ now the total muscle force is the active + passive\n mf = af + pf;\n tf = muscle.getTendonForce(s);\n\n \/\/ equilibrium demands tendon and muscle fiber are equivalent\n ASSERT_EQUAL<double>(tf, mf, equilTol);\n \/\/ Verify that the current computed and AnalyzeTool reported force are\n \/\/ equivalent for the provided motion file\n cout << s.getTime() << \" :: muscle-fiber-force: \" << mf <<\n \" Analyze reported force: \" << forces[int(i)] << endl;\n ASSERT_EQUAL<double>(mf, forces[int(i)], equilTol, __FILE__, __LINE__,\n \"Total fiber force failed to match reported muscle force.\");\n\n cout << s.getTime() << \" :: tendon-force: \" << tf <<\n \" Analyze Output reported: \" << tf_output[int(i)] << endl;\n ASSERT_EQUAL<double>(tf, tf_output[int(i)], equilTol,\n __FILE__, __LINE__,\n \"Output reported muscle-tendon force failed to match computed.\");\n\n double delta = (i > 0) ? abs(forces[int(i)]-forces[int(i-1)]) : 0;\n\n SimTK_ASSERT_ALWAYS(delta < maxDelta,\n \"Force trajectory has unexplained discontinuity.\");\n }\n}\n\nvoid testActuationAnalysisWithDisabledForce() {\n AnalyzeTool analyze(\"PlotterTool.xml\");\n Model& model = analyze.getModel();\n auto& muscle = model.updMuscles()[0];\n muscle.set_appliesForce(false);\n\n std::string resultsDir = \"testPlotterToolWithDisabledForce\";\n analyze.setResultsDir(resultsDir);\n analyze.run();\n\n \/\/ Reading a file with mismatched nColumns header and actual number of\n \/\/ data columns will throw.\n TimeSeriesTable_<double> act_force_table(\n resultsDir + \"\/BothLegs_Actuation_force.sto\");\n \n \/\/ Let's also check that the number of columns is correct (i.e.,\n \/\/ (number of muscles in the model) - 1).\n ASSERT_EQUAL(model.getMuscles().getSize() - 1, \n (int)act_force_table.getNumColumns());\n}\n\nvoid testBodyKinematics() { \n Model model;\n model.setGravity(SimTK::Vec3(0));\n Body body(\"body\", 1, SimTK::Vec3(0), SimTK::Inertia(1));\n model.addBody(&body);\n\n \/\/ Rotate child frame so that planar rotational joint is about\n \/\/ the body's local X axis, and the ground's Z axis\n FreeJoint joint(\"joint\",\n model.getGround(), SimTK::Vec3(0), SimTK::Vec3(0),\n body, SimTK::Vec3(0), SimTK::Vec3(0, SimTK::Pi\/2, 0));\n model.addJoint(&joint);\n model.finalizeConnections();\n\n BodyKinematics bodyKinematicsLocal;\n bodyKinematicsLocal.setName(\"local\");\n bodyKinematicsLocal.setExpressResultsInLocalFrame(true);\n bodyKinematicsLocal.setInDegrees(true);\n\n BodyKinematics bodyKinematicsGround;\n bodyKinematicsGround.setName(\"ground\");\n bodyKinematicsGround.setExpressResultsInLocalFrame(false);\n bodyKinematicsGround.setInDegrees(false);\n\n model.addAnalysis(&bodyKinematicsLocal);\n model.addAnalysis(&bodyKinematicsGround);\n\n SimTK::State& s = model.initSystem();\n double speedRot = 1.0;\n double speedX = 2.0;\n double speedY = 3.0;\n joint.updCoordinate(FreeJoint::Coord::Rotation3Z)\n .setSpeedValue(s, speedRot);\n joint.updCoordinate(FreeJoint::Coord::TranslationX)\n .setSpeedValue(s, speedX);\n joint.updCoordinate(FreeJoint::Coord::TranslationY)\n .setSpeedValue(s, speedY);\n\n Manager manager(model);\n double duration = 2.0;\n manager.initialize(s);\n s = manager.integrate(duration);\n\n bodyKinematicsLocal.printResults(\"BodyKinematics\");\n bodyKinematicsGround.printResults(\"BodyKinematics\");\n\n Storage localVel(\"BodyKinematics_local_vel_bodyLocal.sto\");\n Storage groundVel(\"BodyKinematics_ground_vel_global.sto\");\n Array<double> localVelOx, localVelOz, globalVelOx, globalVelOz;\n localVel.getDataColumn(\"body_Ox\", localVelOx);\n localVel.getDataColumn(\"body_Oz\", localVelOz);\n groundVel.getDataColumn(\"body_Ox\", globalVelOx);\n groundVel.getDataColumn(\"body_Oz\", globalVelOz);\n\n assert(localVelOx.getLast() == speedRot * SimTK_RADIAN_TO_DEGREE);\n assert(localVelOz.getLast() == 0);\n assert(groundVelOx.getLast() == 0);\n assert(groundVelOz.getLast() == speedrot);\n\n Array<double> groundPosX, groundPosY;\n Storage groundPos(\"BodyKinematics_ground_pos_global.sto\");\n groundPos.getDataColumn(\"body_X\", groundPosX);\n groundPos.getDataColumn(\"body_Y\", groundPosY);\n assert(groundPosX.getLast() == speedX * duration);\n assert(groundPosY.getLast() == speedY * duration);\n}<commit_msg>fix variable names<commit_after>\/* -------------------------------------------------------------------------- *\n * OpenSim: testAnalyzeTool.cpp *\n * -------------------------------------------------------------------------- *\n * The OpenSim API is a toolkit for musculoskeletal modeling and simulation. *\n * See http:\/\/opensim.stanford.edu and the NOTICE file for more information. *\n * OpenSim is developed at Stanford University and supported by the US *\n * National Institutes of Health (U54 GM072970, R24 HD065690) and by DARPA *\n * through the Warrior Web program. *\n * *\n * Copyright (c) 2005-2017 Stanford University and the Authors *\n * Author(s): Ayman Habib, Ajay Seth *\n * *\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may *\n * not use this file except in compliance with the License. You may obtain a *\n * copy of the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0. *\n * *\n * Unless required by applicable law or agreed to in writing, software *\n * distributed under the License is distributed on an \"AS IS\" BASIS, *\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *\n * See the License for the specific language governing permissions and *\n * limitations under the License. *\n * -------------------------------------------------------------------------- *\/\n\n\/\/ INCLUDE\n#include <OpenSim\/Common\/CSVFileAdapter.h>\n#include <OpenSim\/Simulation\/Model\/Model.h>\n#include <OpenSim\/Simulation\/StatesTrajectory.h>\n#include <OpenSim\/Actuators\/Millard2012EquilibriumMuscle.h>\n#include <OpenSim\/Tools\/AnalyzeTool.h>\n#include <OpenSim\/Analyses\/OutputReporter.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestFunctions.h>\n#include <OpenSim\/Auxiliary\/auxiliaryTestMuscleFunctions.h>\n#include <OpenSim\/Simulation\/SimbodyEngine\/FreeJoint.h>\n#include <OpenSim\/Simulation\/Manager\/Manager.h>\n#include <OpenSim\/Analyses\/BodyKinematics.h>\n\nusing namespace OpenSim;\nusing namespace std;\n\nvoid testTutorialOne();\nvoid testActuationAnalysisWithDisabledForce();\n\n\/\/ Test different default activations are respected when activation\n\/\/ states are not provided.\nvoid testTugOfWar(const string& dataFileName, const double& defaultAct);\n\nvoid testBodyKinematics();\n\nint main()\n{\n SimTK::Array_<std::string> failures;\n\n try { testTutorialOne(); }\n catch (const std::exception& e) {\n cout << e.what() << endl; failures.push_back(\"testTutorialOne\");\n }\n\n \/\/ produce passive force-length curve\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity.sto\", 0.01); }\n catch (const std::exception& e) {\n cout << e.what() << endl; \n failures.push_back(\"testTugOfWar CoordinatesOnly: default_act = 0.01\");\n }\n\n \/\/ produced passive + active muscle force-length\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity.sto\", 1.0); }\n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testTugOfWar CoordinatesOnly: default_act = 1.0\");\n }\n\n \/\/ now supply activation states which should be used instead of the default\n try { testTugOfWar(\"Tug_of_War_ConstantVelocity_RampActivation.sto\", 0.0); }\n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testTugOfWar with activation state provided\");\n }\n\n try { testActuationAnalysisWithDisabledForce(); } \n catch (const std::exception& e) {\n cout << e.what() << endl;\n failures.push_back(\"testActuationAnalysisWithDisabledForce\");\n }\n try { testBodyKinematics(); } \n catch (const std::exception& e) { \n cout << e.what() << endl;\n failures.push_back(\"testBodyKinematics\");\n } if (!failures.empty()) {\n cout << \"Done, with failure(s): \" << failures << endl;\n return 1;\n }\n\n cout << \"Done\" << endl;\n return 0;\n}\n\nvoid testTutorialOne() {\n AnalyzeTool analyze1(\"PlotterTool.xml\");\n analyze1.getModel().print(\"testAnalyzeTutorialOne.osim\");\n analyze1.run();\n \/* Once this runs to completion we'll make the test more meaningful by comparing output\n * to a validated standard. Let's make sure we don't crash during run first! -Ayman 5\/29\/12 *\/\n Storage resultFiberLength(\"testPlotterTool\/BothLegs__FiberLength.sto\");\n Storage standardFiberLength(\"std_BothLegs_fiberLength.sto\");\n CHECK_STORAGE_AGAINST_STANDARD(resultFiberLength, standardFiberLength,\n std::vector<double>(100, 0.0001), __FILE__, __LINE__,\n \"testAnalyzeTutorialOne failed\");\n \/\/ const Model& mdl = analyze1.getModel();\n \/\/mdl.updMultibodySystem()\n analyze1.setStatesFileName(\"plotterGeneratedStatesHip45.sto\");\n \/\/analyze1.setModel(mdl);\n analyze1.setName(\"BothLegsHip45\");\n analyze1.run();\n Storage resultFiberLengthHip45(\"testPlotterTool\/BothLegsHip45__FiberLength.sto\");\n Storage standardFiberLength45(\"std_BothLegsHip45__FiberLength.sto\");\n CHECK_STORAGE_AGAINST_STANDARD(resultFiberLengthHip45,\n standardFiberLength45, std::vector<double>(100, 0.0001),\n __FILE__, __LINE__, \"testAnalyzeTutorialOne at Hip45 failed\");\n cout << \"testAnalyzeTutorialOne passed\" << endl;\n}\n\nvoid testTugOfWar(const string& dataFileName, const double& defaultAct) {\n AnalyzeTool analyze(\"Tug_of_War_Setup_Analyze.xml\");\n analyze.setCoordinatesFileName(\"\");\n analyze.setStatesFileName(\"\");\n\n \/\/ Access the model and muscle being analyzed\n Model& model = analyze.getModel();\n Millard2012EquilibriumMuscle& muscle =\n static_cast<Millard2012EquilibriumMuscle&>(model.updMuscles()[0]);\n bool isCoordinatesOnly = true;\n \/\/ Load in the States used to recompute the results of the Analysis \n Storage dataStore(dataFileName);\n if (dataStore.getColumnLabels().findIndex(muscle.getName() + \".activation\") > 0) {\n isCoordinatesOnly = false;\n analyze.setStatesFileName(dataFileName);\n \/\/ ramp input starts at 0.0\n muscle.set_minimum_activation(0.0);\n }\n else {\n analyze.setCoordinatesFileName(dataFileName);\n }\n\n \/\/ Test that the default activation is taken into consideration by\n \/\/ the Analysis and reflected in the AnalyzeTool solution\n muscle.set_default_activation(defaultAct);\n\n analyze.run();\n\n \/\/ Load the AnalyzTool results for the muscle's force through time\n TimeSeriesTable_<double> results(\"Analyze_Tug_of_War\/Tug_of_War_Millard_Iso_ForceReporter_forces.sto\");\n assert(results.getNumColumns() == 1);\n SimTK::Vector forces = results.getDependentColumnAtIndex(0);\n\n TimeSeriesTable_<double> outputs_table(\"Analyze_Tug_of_War\/Tug_of_War_Millard_Iso_Outputs.sto\");\n SimTK::Vector tf_output = outputs_table.getDependentColumnAtIndex(1);\n\n \/\/ Load input data as StatesTrajectory used to perform the Analysis\n auto statesTraj = StatesTrajectory::createFromStatesStorage(\n model, dataStore, true, false);\n size_t nstates = statesTraj.getSize();\n\n \/\/ muscle active, passive, total muscle and tendon force quantities\n double af, pf, mf, tf, fl;\n af= pf = mf = tf = fl = SimTK::NaN;\n\n \/\/ Tolerance for muscle equilibrium solution \n const double equilTol = muscle.getMaxIsometricForce()*SimTK::SqrtEps;\n\n \/\/ The maximum acceptable change in force between two contiguous states\n const double maxDelta = muscle.getMaxIsometricForce() \/ 10;\n\n SimTK::State s = model.getWorkingState();\n \/\/ Independently compute the active fiber force at every state\n for (size_t i = 0; i < nstates; ++i) {\n s = statesTraj[i];\n \/\/ When the muscle states are not supplied in the input dataStore\n \/\/ (isCoordinatesOnly == true), then set it to its default value.\n if (isCoordinatesOnly) {\n muscle.setActivation(s, muscle.get_default_activation());\n }\n \/\/ technically, fiber lengths could be supplied, but this test case\n \/\/ (a typical use case) does not and therefore set to its default.\n muscle.setFiberLength(s, muscle.get_default_fiber_length());\n try {\n muscle.computeEquilibrium(s);\n }\n catch (const MuscleCannotEquilibrate& x) {\n \/\/ Write out the muscle equilibrium for error as a function of\n \/\/ fiber-length.\n reportTendonAndFiberForcesAcrossFiberLengths(muscle, s);\n throw x;\n }\n model.realizeDynamics(s);\n\n \/\/ Get the fiber-length\n fl = muscle.getFiberLength(s);\n\n cout << \"t = \" << s.getTime() << \" | fiber_length = \" << fl <<\n \" : default_fiber_length = \" << muscle.get_default_fiber_length() << endl;\n\n SimTK_ASSERT_ALWAYS(fl >= muscle.getMinimumFiberLength(),\n \"Equilibrium failed to compute valid fiber length.\");\n\n if (isCoordinatesOnly) {\n \/\/ check that activation is not reset to zero or other value\n SimTK_ASSERT_ALWAYS(muscle.getActivation(s) == defaultAct,\n \"Test failed to correctly use the default activation value.\");\n }\n else {\n \/\/ check that activation used was that supplied by the dataStore\n SimTK_ASSERT_ALWAYS(muscle.getActivation(s) == s.getTime(),\n \"Test failed to correctly use the supplied activation values.\");\n }\n \n \/\/ get active and passive forces given the default activation\n af = muscle.getActiveFiberForceAlongTendon(s);\n pf = muscle.getPassiveFiberForceAlongTendon(s);\n\n \/\/ now the total muscle force is the active + passive\n mf = af + pf;\n tf = muscle.getTendonForce(s);\n\n \/\/ equilibrium demands tendon and muscle fiber are equivalent\n ASSERT_EQUAL<double>(tf, mf, equilTol);\n \/\/ Verify that the current computed and AnalyzeTool reported force are\n \/\/ equivalent for the provided motion file\n cout << s.getTime() << \" :: muscle-fiber-force: \" << mf <<\n \" Analyze reported force: \" << forces[int(i)] << endl;\n ASSERT_EQUAL<double>(mf, forces[int(i)], equilTol, __FILE__, __LINE__,\n \"Total fiber force failed to match reported muscle force.\");\n\n cout << s.getTime() << \" :: tendon-force: \" << tf <<\n \" Analyze Output reported: \" << tf_output[int(i)] << endl;\n ASSERT_EQUAL<double>(tf, tf_output[int(i)], equilTol,\n __FILE__, __LINE__,\n \"Output reported muscle-tendon force failed to match computed.\");\n\n double delta = (i > 0) ? abs(forces[int(i)]-forces[int(i-1)]) : 0;\n\n SimTK_ASSERT_ALWAYS(delta < maxDelta,\n \"Force trajectory has unexplained discontinuity.\");\n }\n}\n\nvoid testActuationAnalysisWithDisabledForce() {\n AnalyzeTool analyze(\"PlotterTool.xml\");\n Model& model = analyze.getModel();\n auto& muscle = model.updMuscles()[0];\n muscle.set_appliesForce(false);\n\n std::string resultsDir = \"testPlotterToolWithDisabledForce\";\n analyze.setResultsDir(resultsDir);\n analyze.run();\n\n \/\/ Reading a file with mismatched nColumns header and actual number of\n \/\/ data columns will throw.\n TimeSeriesTable_<double> act_force_table(\n resultsDir + \"\/BothLegs_Actuation_force.sto\");\n \n \/\/ Let's also check that the number of columns is correct (i.e.,\n \/\/ (number of muscles in the model) - 1).\n ASSERT_EQUAL(model.getMuscles().getSize() - 1, \n (int)act_force_table.getNumColumns());\n}\n\nvoid testBodyKinematics() { \n Model model;\n model.setGravity(SimTK::Vec3(0));\n Body body(\"body\", 1, SimTK::Vec3(0), SimTK::Inertia(1));\n model.addBody(&body);\n\n \/\/ Rotate child frame so that planar rotational joint is about\n \/\/ the body's local X axis, and the ground's Z axis\n FreeJoint joint(\"joint\",\n model.getGround(), SimTK::Vec3(0), SimTK::Vec3(0),\n body, SimTK::Vec3(0), SimTK::Vec3(0, SimTK::Pi\/2, 0));\n model.addJoint(&joint);\n model.finalizeConnections();\n\n BodyKinematics bodyKinematicsLocal;\n bodyKinematicsLocal.setName(\"local\");\n bodyKinematicsLocal.setExpressResultsInLocalFrame(true);\n bodyKinematicsLocal.setInDegrees(true);\n\n BodyKinematics bodyKinematicsGround;\n bodyKinematicsGround.setName(\"ground\");\n bodyKinematicsGround.setExpressResultsInLocalFrame(false);\n bodyKinematicsGround.setInDegrees(false);\n\n model.addAnalysis(&bodyKinematicsLocal);\n model.addAnalysis(&bodyKinematicsGround);\n\n SimTK::State& s = model.initSystem();\n double speedRot = 1.0;\n double speedX = 2.0;\n double speedY = 3.0;\n joint.updCoordinate(FreeJoint::Coord::Rotation3Z)\n .setSpeedValue(s, speedRot);\n joint.updCoordinate(FreeJoint::Coord::TranslationX)\n .setSpeedValue(s, speedX);\n joint.updCoordinate(FreeJoint::Coord::TranslationY)\n .setSpeedValue(s, speedY);\n\n Manager manager(model);\n double duration = 2.0;\n manager.initialize(s);\n s = manager.integrate(duration);\n\n bodyKinematicsLocal.printResults(\"BodyKinematics\");\n bodyKinematicsGround.printResults(\"BodyKinematics\");\n\n Storage localVel(\"BodyKinematics_local_vel_bodyLocal.sto\");\n Storage groundVel(\"BodyKinematics_ground_vel_global.sto\");\n Array<double> localVelOx, localVelOz, groundVelOx, groundVelOz;\n localVel.getDataColumn(\"body_Ox\", localVelOx);\n localVel.getDataColumn(\"body_Oz\", localVelOz);\n groundVel.getDataColumn(\"body_Ox\", groundVelOx);\n groundVel.getDataColumn(\"body_Oz\", groundVelOz);\n\n double tol = 1e-6;\n ASSERT_EQUAL<double>(localVelOx.getLast(), speedRot * SimTK_RADIAN_TO_DEGREE, tol);\n ASSERT_EQUAL<double>(localVelOz.getLast(), 0, tol);\n ASSERT_EQUAL<double>(groundVelOx.getLast(), 0, tol);\n ASSERT_EQUAL<double>(groundVelOz.getLast(), speedRot, tol);\n\n Array<double> groundPosX, groundPosY;\n Storage groundPos(\"BodyKinematics_ground_pos_global.sto\");\n groundPos.getDataColumn(\"body_X\", groundPosX);\n groundPos.getDataColumn(\"body_Y\", groundPosY);\n ASSERT_EQUAL<double>(groundPosX.getLast(), speedX * duration, tol);\n ASSERT_EQUAL<double>(groundPosY.getLast(), speedY * duration, tol);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n The MIT License (MIT)\n\n Copyright (c) [2016] [BTC.COM]\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n#include <stdlib.h>\n#include <stdio.h>\n#include <signal.h>\n#include <err.h>\n#include <errno.h>\n#include <unistd.h>\n\n#include <iostream>\n\n#include <glog\/logging.h>\n#include <libconfig.h++>\n\n#include \"zmq.hpp\"\n\n#include \"Utils.h\"\n#include \"GbtMaker.h\"\n\nusing namespace std;\nusing namespace libconfig;\n\nGbtMaker *gGbtMaker = nullptr;\n\nvoid handler(int sig) {\n if (gGbtMaker) {\n gGbtMaker->stop();\n }\n}\n\nvoid usage() {\n fprintf(stderr, \"Usage:\\n\\tgbtmaker -c \\\"gbtmaker.cfg\\\" -l \\\"log_dir\\\"\\n\");\n}\n\nint main(int argc, char **argv) {\n char *optLogDir = NULL;\n char *optConf = NULL;\n int c;\n\n if (argc <= 1) {\n usage();\n return 1;\n }\n while ((c = getopt(argc, argv, \"c:l:h\")) != -1) {\n switch (c) {\n case 'c':\n optConf = optarg;\n break;\n case 'l':\n optLogDir = optarg;\n break;\n case 'h': default:\n usage();\n exit(0);\n }\n }\n\n \/\/ Initialize Google's logging library.\n google::InitGoogleLogging(argv[0]);\n FLAGS_log_dir = string(optLogDir);\n FLAGS_max_log_size = 100; \/\/ max log file size 100 MB\n FLAGS_logbuflevel = -1;\n FLAGS_stop_logging_if_full_disk = true;\n\n \/\/ Read the file. If there is an error, report it and exit.\n Config cfg;\n try\n {\n cfg.readFile(optConf);\n } catch(const FileIOException &fioex) {\n std::cerr << \"I\/O error while reading file.\" << std::endl;\n return(EXIT_FAILURE);\n } catch(const ParseException &pex) {\n std::cerr << \"Parse error at \" << pex.getFile() << \":\" << pex.getLine()\n << \" - \" << pex.getError() << std::endl;\n return(EXIT_FAILURE);\n }\n\n signal(SIGTERM, handler);\n signal(SIGINT, handler);\n\n int32_t rpcCallInterval = 5;\n cfg.lookupValue(\"gbtmaker.rpcinterval\", rpcCallInterval);\n gGbtMaker = new GbtMaker(cfg.lookup(\"bitcoind.zmq_addr\"),\n cfg.lookup(\"bitcoind.rpc_addr\"),\n cfg.lookup(\"bitcoind.rpc_userpwd\"),\n cfg.lookup(\"kafka.brokers\"),\n rpcCallInterval);\n\n try {\n if (!gGbtMaker->init()) {\n LOG(FATAL) << \"gbtmaker init failure\";\n }\n gGbtMaker->run();\n delete gGbtMaker;\n } catch (std::exception & e) {\n LOG(FATAL) << \"exception: \" << e.what();\n return 1;\n }\n\n google::ShutdownGoogleLogging();\n return 0;\n}\n<commit_msg>add lock cfg file<commit_after>\/*\n The MIT License (MIT)\n\n Copyright (c) [2016] [BTC.COM]\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n#include <stdlib.h>\n#include <stdio.h>\n#include <signal.h>\n#include <err.h>\n#include <errno.h>\n#include <unistd.h>\n\n#include <iostream>\n\n#include <boost\/interprocess\/sync\/file_lock.hpp>\n#include <glog\/logging.h>\n#include <libconfig.h++>\n\n#include \"zmq.hpp\"\n\n#include \"Utils.h\"\n#include \"GbtMaker.h\"\n\nusing namespace std;\nusing namespace libconfig;\n\nGbtMaker *gGbtMaker = nullptr;\n\nvoid handler(int sig) {\n if (gGbtMaker) {\n gGbtMaker->stop();\n }\n}\n\nvoid usage() {\n fprintf(stderr, \"Usage:\\n\\tgbtmaker -c \\\"gbtmaker.cfg\\\" -l \\\"log_dir\\\"\\n\");\n}\n\nint main(int argc, char **argv) {\n char *optLogDir = NULL;\n char *optConf = NULL;\n int c;\n\n if (argc <= 1) {\n usage();\n return 1;\n }\n while ((c = getopt(argc, argv, \"c:l:h\")) != -1) {\n switch (c) {\n case 'c':\n optConf = optarg;\n break;\n case 'l':\n optLogDir = optarg;\n break;\n case 'h': default:\n usage();\n exit(0);\n }\n }\n\n \/\/ Initialize Google's logging library.\n google::InitGoogleLogging(argv[0]);\n FLAGS_log_dir = string(optLogDir);\n FLAGS_max_log_size = 100; \/\/ max log file size 100 MB\n FLAGS_logbuflevel = -1;\n FLAGS_stop_logging_if_full_disk = true;\n\n \/\/ Read the file. If there is an error, report it and exit.\n Config cfg;\n try\n {\n cfg.readFile(optConf);\n } catch(const FileIOException &fioex) {\n std::cerr << \"I\/O error while reading file.\" << std::endl;\n return(EXIT_FAILURE);\n } catch(const ParseException &pex) {\n std::cerr << \"Parse error at \" << pex.getFile() << \":\" << pex.getLine()\n << \" - \" << pex.getError() << std::endl;\n return(EXIT_FAILURE);\n }\n\n \/\/ lock cfg file:\n \/\/ you can't run more than one progress with the same config file\n boost::interprocess::file_lock pidFileLock(optConf);\n if (pidFileLock.try_lock() == false) {\n LOG(FATAL) << \"lock cfg file fail\";\n return(EXIT_FAILURE);\n }\n\n signal(SIGTERM, handler);\n signal(SIGINT, handler);\n\n int32_t rpcCallInterval = 5;\n cfg.lookupValue(\"gbtmaker.rpcinterval\", rpcCallInterval);\n gGbtMaker = new GbtMaker(cfg.lookup(\"bitcoind.zmq_addr\"),\n cfg.lookup(\"bitcoind.rpc_addr\"),\n cfg.lookup(\"bitcoind.rpc_userpwd\"),\n cfg.lookup(\"kafka.brokers\"),\n rpcCallInterval);\n\n try {\n if (!gGbtMaker->init()) {\n LOG(FATAL) << \"gbtmaker init failure\";\n }\n gGbtMaker->run();\n delete gGbtMaker;\n } catch (std::exception & e) {\n LOG(FATAL) << \"exception: \" << e.what();\n return 1;\n }\n\n google::ShutdownGoogleLogging();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"extproc\/spawner.hpp\"\n\n#include <signal.h>\n\n#include <sys\/socket.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/un.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"arch\/fd_send_recv.hpp\"\n#include \"extproc\/job.hpp\"\n#include \"utils.hpp\"\n\nnamespace extproc {\n\nvoid exec_spawner(fd_t socket) NORETURN;\nvoid exec_worker(pid_t spawner_pid, fd_t socket) NORETURN;\n\n\n\n\/\/ Checks that we only create one spawner. This is an ugly restriction, but it\n\/\/ means we can put the SIGCHLD-handling logic in here, so that it is properly\n\/\/ scoped to the lifetime of the spawner.\n\/\/\n\/\/ TODO(rntz): More general way of handling SIGCHLD.\nstatic pid_t spawner_pid = -1;\n\nstatic void sigchld_handler(int signo) {\n guarantee(signo == SIGCHLD);\n guarantee(spawner_pid > 0);\n\n int status;\n pid_t pid = waitpid(-1, &status, WNOHANG);\n guarantee_err(-1 != pid, \"could not waitpid()\");\n\n \/\/ We might spawn processes other than the spawner, whose deaths we ignore.\n \/\/ waitpid() might also return 0, indicating some event other than child\n \/\/ process termination (ie. SIGSTOP or SIGCONT). We ignore this.\n if (pid == spawner_pid) {\n crash_or_trap(\"Spawner process died!\");\n }\n}\n\nspawner_t::spawner_t(info_t *info)\n : pid_(info->pid), socket_(&info->socket)\n{\n guarantee(-1 == spawner_pid);\n spawner_pid = pid_;\n\n \/\/ Check that the spawner hasn't already exited.\n guarantee(0 == waitpid(pid_, NULL, WNOHANG),\n \"spawner process already died!\");\n\n \/\/ Establish SIGCHLD handler for spawner.\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = sigchld_handler;\n guarantee_err(0 == sigemptyset(&act.sa_mask), \"could not empty signal mask\");\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL), \"could not set SIGCHLD handler\");\n}\n\nspawner_t::~spawner_t() {\n \/\/ De-establish SIGCHLD handler.\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = SIG_DFL;\n guarantee_err(0 == sigemptyset(&act.sa_mask), \"could not empty signal mask\");\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL), \"could not unset SIGCHLD handler\");\n\n guarantee(spawner_pid > 0);\n spawner_pid = -1;\n}\n\nvoid spawner_t::create(info_t *info) {\n int fds[2];\n guarantee_err(0 == socketpair(AF_UNIX, SOCK_STREAM, 0, fds),\n \"could not create socketpair for spawner\");\n\n pid_t pid = fork();\n guarantee_err(-1 != pid, \"could not fork spawner process\");\n\n if (0 == pid) {\n \/\/ We're the child; run the spawner.\n guarantee_err(0 == close(fds[0]), \"could not close fd\");\n exec_spawner(fds[1]);\n unreachable();\n }\n\n \/\/ We're the parent. Return.\n guarantee_err(0 == close(fds[1]), \"could not close fd\");\n info->pid = pid;\n info->socket.reset(fds[0]);\n}\n\npid_t spawner_t::spawn_process(scoped_fd_t *socket) {\n assert_thread();\n\n \/\/ Create a socket pair.\n fd_t fds[2];\n int res = socketpair(AF_UNIX, SOCK_STREAM, 0, fds);\n if (res) return -1;\n\n \/\/ We need to send the fd & receive the pid atomically with respect to other\n \/\/ calls to spawn_process().\n mutex_t::acq_t lock(&mutex_);\n\n \/\/ Send one half to the spawner process.\n guarantee(0 == socket_.send_fd(fds[1]));\n guarantee_err(0 == close(fds[1]), \"could not close fd\");\n socket->reset(fds[0]);\n\n \/\/ Receive the pid from the spawner process.\n pid_t pid;\n guarantee(sizeof(pid) == force_read(&socket_, &pid, sizeof(pid)));\n guarantee(pid > 0);\n\n return pid;\n}\n\n\n\/\/ ---------- Spawner & worker processes ----------\n\/\/ Runs the spawner process. Does not return.\nvoid exec_spawner(fd_t socket) {\n \/\/ We set our PGID to our own PID (rather than inheriting our parent's PGID)\n \/\/ so that a signal (eg. SIGINT) sent to the parent's PGID (by eg. hitting\n \/\/ Ctrl-C at a terminal) will not propagate to us or our children.\n \/\/\n \/\/ This is desirable because the RethinkDB engine deliberately crashes with\n \/\/ an error message if the spawner or a worker process dies; but a\n \/\/ command-line SIGINT should trigger a clean shutdown, not a crash.\n \/\/\n \/\/ TODO(rntz): This is an ugly, hackish way to handle the problem.\n guarantee_err(0 == setpgid(0, 0), \"spawner: could not set PGID\");\n\n \/\/ We ignore SIGCHLD so that we don't accumulate zombie children.\n {\n \/\/ NB. According to `man 2 sigaction` on linux, POSIX.1-2001 says that\n \/\/ this will prevent zombies, but may not be \"fully portable\".\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = SIG_IGN;\n\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL),\n \"spawner: Could not ignore SIGCHLD\");\n }\n\n pid_t spawner_pid = getpid();\n\n for (;;) {\n \/\/ Get an fd from our parent.\n fd_t fd;\n fd_recv_result_t fdres = recv_fds(socket, 1, &fd);\n if (fdres == FD_RECV_EOF) {\n \/\/ Other end shut down cleanly; we should too.\n exit(EXIT_SUCCESS);\n } else if (fdres != FD_RECV_OK) {\n exit(EXIT_FAILURE);\n }\n\n \/\/ Fork a worker process.\n pid_t pid = fork();\n if (-1 == pid)\n exit(EXIT_FAILURE);\n\n if (0 == pid) {\n \/\/ We're the child\/worker.\n guarantee_err(0 == close(socket), \"worker: could not close fd\");\n exec_worker(spawner_pid, fd);\n unreachable();\n }\n\n \/\/ We're the parent.\n guarantee_err(0 == close(fd), \"spawner: couldn't close fd\");\n\n \/\/ Send back its pid. Wish we could use unix_socket_stream_t for this,\n \/\/ but its destructor calls shutdown(), and we can't have that happening\n \/\/ in the worker child.\n const char *buf = reinterpret_cast<const char *>(&pid);\n size_t sz = sizeof(pid);\n while (sz) {\n ssize_t w = write(socket, buf, sz);\n if (w == -1 && errno == EINTR) continue;\n guarantee_err(w > 0, \"spawner: could not write() to engine socket\");\n guarantee((size_t)w <= sz);\n sz -= w, buf += w;\n }\n }\n}\n\n#ifdef __MACH__\n\/\/ On OS X, we have to poll the ppid to detect when the parent process dies. So we use SIGALRM and\n\/\/ setitimer to do that. (We could also use kqueue to do this without polling, in a separate\n\/\/ thread. We could also just make a separate thread and poll from it.) We have to make this\n\/\/ global variable because setitimer doesn't let you pass the value through a siginfo_t parameter.\npid_t spawner_pid_for_sigalrm = 0;\n\nvoid check_ppid_for_death(int) {\n pid_t ppid = getppid();\n std::string s = strprintf(\"sigalrm: rdb_pid=%d, ppid=%d\\n\", spawner_pid_for_sigalrm, ppid);\n write(STDOUT_FILENO, s.data(), s.size());\n\n if (spawner_pid_for_sigalrm != 0 && spawner_pid_for_sigalrm != ppid) {\n write(STDOUT_FILENO, \"crap\\n\", 5);\n \/\/ We didn't fail, so should we exit with failure? This status code doesn't really matter.\n _exit(EXIT_FAILURE);\n }\n}\n#endif \/\/ __MACH__\n\n\/\/ Runs the worker process. Does not return.\nvoid exec_worker(pid_t spawner_pid, fd_t sockfd) {\n \/\/ Make sure we die when our parent dies. (The parent, the spawner process, dies when the\n \/\/ rethinkdb process dies.)\n {\n debugf(\"exec_worker, setting rdb_pid_for_sigalrm to %d\\n\", spawner_pid);\n spawner_pid_for_sigalrm = spawner_pid;\n\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = check_ppid_for_death;\n int res = sigfillset(&sa.sa_mask);\n guarantee_err(res == 0, \"worker: sigfillset failed\");\n res = sigaction(SIGALRM, &sa, NULL);\n guarantee_err(res == 0, \"worker: could not set action for ALRM signal\");\n\n struct itimerval timerval;\n timerval.it_interval.tv_sec = 0;\n timerval.it_interval.tv_usec = 500 * THOUSAND;\n timerval.it_value = timerval.it_interval;\n struct itimerval old_timerval;\n res = setitimer(ITIMER_REAL, &timerval, &old_timerval);\n guarantee_err(res == 0, \"worker: setitimer failed\");\n guarantee(old_timerval.it_value.tv_sec == 0 && old_timerval.it_value.tv_usec == 0,\n \"worker: setitimer saw that we already had an itimer!\");\n }\n\n \/\/ Receive one job and run it.\n scoped_fd_t fd(sockfd);\n job_t::control_t control(getpid(), spawner_pid, &fd);\n exit(job_t::accept_job(&control, NULL));\n}\n\n} \/\/ namespace extproc\n<commit_msg>Removed some temporary debugf statements and such in the extproc code.<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#include \"extproc\/spawner.hpp\"\n\n#include <signal.h>\n\n#include <sys\/socket.h>\n#include <sys\/time.h>\n#include <sys\/types.h>\n#include <sys\/un.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"arch\/fd_send_recv.hpp\"\n#include \"extproc\/job.hpp\"\n#include \"utils.hpp\"\n\nnamespace extproc {\n\nvoid exec_spawner(fd_t socket) NORETURN;\nvoid exec_worker(pid_t spawner_pid, fd_t socket) NORETURN;\n\n\n\n\/\/ Checks that we only create one spawner. This is an ugly restriction, but it\n\/\/ means we can put the SIGCHLD-handling logic in here, so that it is properly\n\/\/ scoped to the lifetime of the spawner.\n\/\/\n\/\/ TODO(rntz): More general way of handling SIGCHLD.\nstatic pid_t spawner_pid = -1;\n\nstatic void sigchld_handler(int signo) {\n guarantee(signo == SIGCHLD);\n guarantee(spawner_pid > 0);\n\n int status;\n pid_t pid = waitpid(-1, &status, WNOHANG);\n guarantee_err(-1 != pid, \"could not waitpid()\");\n\n \/\/ We might spawn processes other than the spawner, whose deaths we ignore.\n \/\/ waitpid() might also return 0, indicating some event other than child\n \/\/ process termination (ie. SIGSTOP or SIGCONT). We ignore this.\n if (pid == spawner_pid) {\n crash_or_trap(\"Spawner process died!\");\n }\n}\n\nspawner_t::spawner_t(info_t *info)\n : pid_(info->pid), socket_(&info->socket)\n{\n guarantee(-1 == spawner_pid);\n spawner_pid = pid_;\n\n \/\/ Check that the spawner hasn't already exited.\n guarantee(0 == waitpid(pid_, NULL, WNOHANG),\n \"spawner process already died!\");\n\n \/\/ Establish SIGCHLD handler for spawner.\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = sigchld_handler;\n guarantee_err(0 == sigemptyset(&act.sa_mask), \"could not empty signal mask\");\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL), \"could not set SIGCHLD handler\");\n}\n\nspawner_t::~spawner_t() {\n \/\/ De-establish SIGCHLD handler.\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = SIG_DFL;\n guarantee_err(0 == sigemptyset(&act.sa_mask), \"could not empty signal mask\");\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL), \"could not unset SIGCHLD handler\");\n\n guarantee(spawner_pid > 0);\n spawner_pid = -1;\n}\n\nvoid spawner_t::create(info_t *info) {\n int fds[2];\n guarantee_err(0 == socketpair(AF_UNIX, SOCK_STREAM, 0, fds),\n \"could not create socketpair for spawner\");\n\n pid_t pid = fork();\n guarantee_err(-1 != pid, \"could not fork spawner process\");\n\n if (0 == pid) {\n \/\/ We're the child; run the spawner.\n guarantee_err(0 == close(fds[0]), \"could not close fd\");\n exec_spawner(fds[1]);\n unreachable();\n }\n\n \/\/ We're the parent. Return.\n guarantee_err(0 == close(fds[1]), \"could not close fd\");\n info->pid = pid;\n info->socket.reset(fds[0]);\n}\n\npid_t spawner_t::spawn_process(scoped_fd_t *socket) {\n assert_thread();\n\n \/\/ Create a socket pair.\n fd_t fds[2];\n int res = socketpair(AF_UNIX, SOCK_STREAM, 0, fds);\n if (res) return -1;\n\n \/\/ We need to send the fd & receive the pid atomically with respect to other\n \/\/ calls to spawn_process().\n mutex_t::acq_t lock(&mutex_);\n\n \/\/ Send one half to the spawner process.\n guarantee(0 == socket_.send_fd(fds[1]));\n guarantee_err(0 == close(fds[1]), \"could not close fd\");\n socket->reset(fds[0]);\n\n \/\/ Receive the pid from the spawner process.\n pid_t pid;\n guarantee(sizeof(pid) == force_read(&socket_, &pid, sizeof(pid)));\n guarantee(pid > 0);\n\n return pid;\n}\n\n\n\/\/ ---------- Spawner & worker processes ----------\n\/\/ Runs the spawner process. Does not return.\nvoid exec_spawner(fd_t socket) {\n \/\/ We set our PGID to our own PID (rather than inheriting our parent's PGID)\n \/\/ so that a signal (eg. SIGINT) sent to the parent's PGID (by eg. hitting\n \/\/ Ctrl-C at a terminal) will not propagate to us or our children.\n \/\/\n \/\/ This is desirable because the RethinkDB engine deliberately crashes with\n \/\/ an error message if the spawner or a worker process dies; but a\n \/\/ command-line SIGINT should trigger a clean shutdown, not a crash.\n \/\/\n \/\/ TODO(rntz): This is an ugly, hackish way to handle the problem.\n guarantee_err(0 == setpgid(0, 0), \"spawner: could not set PGID\");\n\n \/\/ We ignore SIGCHLD so that we don't accumulate zombie children.\n {\n \/\/ NB. According to `man 2 sigaction` on linux, POSIX.1-2001 says that\n \/\/ this will prevent zombies, but may not be \"fully portable\".\n struct sigaction act;\n memset(&act, 0, sizeof(act));\n act.sa_handler = SIG_IGN;\n\n guarantee_err(0 == sigaction(SIGCHLD, &act, NULL),\n \"spawner: Could not ignore SIGCHLD\");\n }\n\n pid_t spawner_pid = getpid();\n\n for (;;) {\n \/\/ Get an fd from our parent.\n fd_t fd;\n fd_recv_result_t fdres = recv_fds(socket, 1, &fd);\n if (fdres == FD_RECV_EOF) {\n \/\/ Other end shut down cleanly; we should too.\n exit(EXIT_SUCCESS);\n } else if (fdres != FD_RECV_OK) {\n exit(EXIT_FAILURE);\n }\n\n \/\/ Fork a worker process.\n pid_t pid = fork();\n if (-1 == pid)\n exit(EXIT_FAILURE);\n\n if (0 == pid) {\n \/\/ We're the child\/worker.\n guarantee_err(0 == close(socket), \"worker: could not close fd\");\n exec_worker(spawner_pid, fd);\n unreachable();\n }\n\n \/\/ We're the parent.\n guarantee_err(0 == close(fd), \"spawner: couldn't close fd\");\n\n \/\/ Send back its pid. Wish we could use unix_socket_stream_t for this,\n \/\/ but its destructor calls shutdown(), and we can't have that happening\n \/\/ in the worker child.\n const char *buf = reinterpret_cast<const char *>(&pid);\n size_t sz = sizeof(pid);\n while (sz) {\n ssize_t w = write(socket, buf, sz);\n if (w == -1 && errno == EINTR) continue;\n guarantee_err(w > 0, \"spawner: could not write() to engine socket\");\n guarantee((size_t)w <= sz);\n sz -= w, buf += w;\n }\n }\n}\n\n#ifdef __MACH__\n\/\/ On OS X, we have to poll the ppid to detect when the parent process dies. So we use SIGALRM and\n\/\/ setitimer to do that. (We could also use kqueue to do this without polling, in a separate\n\/\/ thread. We could also just make a separate thread and poll from it.) We have to make this\n\/\/ global variable because setitimer doesn't let you pass the value through a siginfo_t parameter.\npid_t spawner_pid_for_sigalrm = 0;\n\nvoid check_ppid_for_death(int) {\n pid_t ppid = getppid();\n if (spawner_pid_for_sigalrm != 0 && spawner_pid_for_sigalrm != ppid) {\n \/\/ We didn't fail, so should we exit with failure? This status code doesn't really matter.\n _exit(EXIT_FAILURE);\n }\n}\n#endif \/\/ __MACH__\n\n\/\/ Runs the worker process. Does not return.\nvoid exec_worker(pid_t spawner_pid, fd_t sockfd) {\n \/\/ Make sure we die when our parent dies. (The parent, the spawner process, dies when the\n \/\/ rethinkdb process dies.)\n {\n spawner_pid_for_sigalrm = spawner_pid;\n\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = check_ppid_for_death;\n int res = sigfillset(&sa.sa_mask);\n guarantee_err(res == 0, \"worker: sigfillset failed\");\n res = sigaction(SIGALRM, &sa, NULL);\n guarantee_err(res == 0, \"worker: could not set action for ALRM signal\");\n\n struct itimerval timerval;\n timerval.it_interval.tv_sec = 0;\n timerval.it_interval.tv_usec = 500 * THOUSAND;\n timerval.it_value = timerval.it_interval;\n struct itimerval old_timerval;\n res = setitimer(ITIMER_REAL, &timerval, &old_timerval);\n guarantee_err(res == 0, \"worker: setitimer failed\");\n guarantee(old_timerval.it_value.tv_sec == 0 && old_timerval.it_value.tv_usec == 0,\n \"worker: setitimer saw that we already had an itimer!\");\n }\n\n \/\/ Receive one job and run it.\n scoped_fd_t fd(sockfd);\n job_t::control_t control(getpid(), spawner_pid, &fd);\n exit(job_t::accept_job(&control, NULL));\n}\n\n} \/\/ namespace extproc\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- c++ -*-\n\/\/ Program to extract word cooccurrence counts from a memory-mapped word-aligned bitext\n\/\/ stores the counts lexicon in the format for mm2dTable<uint32_t> (ug_mm_2d_table.h)\n\/\/ (c) 2010-2012 Ulrich Germann\n\n#include <queue>\n#include <iomanip>\n#include <vector>\n#include <iterator>\n#include <sstream>\n\n#include <boost\/program_options.hpp>\n#include <boost\/dynamic_bitset.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/math\/distributions\/binomial.hpp>\n\n#include \"moses\/TranslationModel\/UG\/generic\/program_options\/ug_get_options.h\"\n\/\/ #include \"ug_translation_finder.h\"\n\/\/ #include \"ug_sorters.h\"\n\/\/ #include \"ug_corpus_sampling.h\"\n#include \"ug_mm_2d_table.h\"\n#include \"ug_mm_ttrack.h\"\n#include \"ug_corpus_token.h\"\n\nusing namespace std;\nusing namespace ugdiss;\nusing namespace boost::math;\n\ntypedef mm2dTable<id_type,id_type,uint32_t,uint32_t> LEX_t;\ntypedef SimpleWordId Token;\n\nvector<uint32_t> m1; \/\/ marginals L1\nvector<uint32_t> m2; \/\/ marginals L2\n\nid_type first_rare_id=500;\nvector<vector<uint32_t> > JFREQ; \/\/ joint count table for frequent L1 words\nvector<map<id_type,uint32_t> > JRARE; \/\/ joint count table for rare L1 words\n\nmmTtrack<Token> T1,T2;\nmmTtrack<char> Tx;\nTokenIndex V1,V2;\n\nstring bname,cfgFile,L1,L2,oname;\n\n\/\/ DECLARATIONS \nvoid interpret_args(int ac, char* av[]);\n\nvoid\nprocessSentence(id_type sid)\n{\n Token const* s1 = T1.sntStart(sid);\n Token const* s2 = T2.sntStart(sid);\n char const* p = Tx.sntStart(sid);\n char const* q = Tx.sntEnd(sid);\n ushort r,c;\n bitvector check1(T1.sntLen(sid)), check2(T2.sntLen(sid));\n check1.set();\n check2.set();\n \n \/\/ count links\n while (p < q)\n {\n p = binread(p,r);\n p = binread(p,c);\n check1.reset(r);\n check2.reset(c);\n id_type id1 = (s1+r)->id();\n if (id1 < first_rare_id) JFREQ[id1][(s2+c)->id()]++;\n else JRARE[id1][(s2+c)->id()]++;\n }\n \n \/\/ count unaliged words\n for (size_t i = check1.find_first(); i < check1.size(); i = check1.find_next(i))\n {\n id_type id1 = (s1+i)->id();\n if (id1 < first_rare_id) JFREQ[id1][0]++;\n else JRARE[id1][0]++;\n }\n for (size_t i = check2.find_first(); i < check2.size(); i = check2.find_next(i))\n JFREQ[0][(s2+i)->id()]++;\n}\n\nvoid\nmakeTable(string ofname)\n{\n ofstream out(ofname.c_str());\n filepos_type idxOffset=0;\n m1.resize(max(first_rare_id,V1.getNumTokens()),0);\n m2.resize(V2.getNumTokens(),0);\n JFREQ.resize(first_rare_id,vector<uint32_t>(m2.size(),0));\n JRARE.resize(m1.size());\n for (size_t sid = 0; sid < T1.size(); ++sid)\n processSentence(sid);\n\n vector<id_type> index(V1.getNumTokens()+1,0);\n numwrite(out,idxOffset); \/\/ blank for the time being\n numwrite(out,id_type(m1.size()));\n numwrite(out,id_type(m2.size()));\n\n id_type cellCount=0;\n id_type stop = min(first_rare_id,id_type(m1.size()));\n for (id_type id1 = 0; id1 < stop; ++id1)\n {\n index[id1] = cellCount;\n vector<uint32_t> const& v = JFREQ[id1];\n for (id_type id2 = 0; id2 < id_type(v.size()); ++id2)\n {\n if (!v[id2]) continue;\n cellCount++;\n numwrite(out,id2);\n out.write(reinterpret_cast<char const*>(&v[id2]),sizeof(uint32_t));\n m1[id1] += v[id2];\n m2[id2] += v[id2];\n }\n }\n for (id_type id1 = stop; id1 < id_type(m1.size()); ++id1)\n {\n index[id1] = cellCount;\n map<id_type,uint32_t> const& M = JRARE[id1];\n for (map<id_type,uint32_t>::const_iterator m = M.begin(); m != M.end(); ++m)\n {\n if (m->second == 0) continue;\n cellCount++;\n numwrite(out,m->first);\n out.write(reinterpret_cast<char const*>(&m->second),sizeof(float));\n m1[id1] += m->second;\n m2[m->first] += m->second;\n }\n }\n index[m1.size()] = cellCount;\n idxOffset = out.tellp();\n for (size_t i = 0; i < index.size(); ++i)\n numwrite(out,index[i]);\n out.write(reinterpret_cast<char const*>(&m1[0]),m1.size()*sizeof(float));\n out.write(reinterpret_cast<char const*>(&m2[0]),m2.size()*sizeof(float));\n \n \/\/ re-write the file header\n out.seekp(0);\n numwrite(out,idxOffset);\n out.close();\n}\n\nint \nmain(int argc, char* argv[])\n{\n interpret_args(argc,argv);\n char c = *bname.rbegin();\n if (c != '\/' && c != '.') bname += '.';\n T1.open(bname+L1+\".mct\");\n T2.open(bname+L2+\".mct\");\n Tx.open(bname+L1+\"-\"+L2+\".mam\");\n V1.open(bname+L1+\".tdx\");\n V2.open(bname+L2+\".tdx\");\n makeTable(oname);\n exit(0);\n}\n\nvoid \ninterpret_args(int ac, char* av[])\n{\n namespace po=boost::program_options;\n po::variables_map vm;\n po::options_description o(\"Options\");\n po::options_description h(\"Hidden Options\");\n po::positional_options_description a;\n\n o.add_options()\n (\"help,h\", \"print this message\")\n (\"cfg,f\", po::value<string>(&cfgFile),\"config file\")\n (\"oname,o\", po::value<string>(&oname),\"output file name\")\n ;\n \n h.add_options()\n (\"bname\", po::value<string>(&bname), \"base name\")\n (\"L1\", po::value<string>(&L1),\"L1 tag\")\n (\"L2\", po::value<string>(&L2),\"L2 tag\")\n ;\n a.add(\"bname\",1);\n a.add(\"L1\",1);\n a.add(\"L2\",1);\n get_options(ac,av,h.add(o),a,vm,\"cfg\");\n\n if (vm.count(\"help\") || bname.empty() || oname.empty())\n {\n cout << \"usage:\\n\\t\" << av[0] << \" <basename> <L1 tag> <L2 tag> -o <output file>\\n\" << endl;\n cout << o << endl;\n exit(0);\n }\n}\n\n\n<commit_msg>Added option to also count raw cooccurrences.<commit_after>\/\/ -*- c++ -*-\n\/\/ Program to extract word cooccurrence counts from a memory-mapped word-aligned bitext\n\/\/ stores the counts lexicon in the format for mm2dTable<uint32_t> (ug_mm_2d_table.h)\n\/\/ (c) 2010-2012 Ulrich Germann\n\n#include <queue>\n#include <iomanip>\n#include <vector>\n#include <iterator>\n#include <sstream>\n\n#include <boost\/program_options.hpp>\n#include <boost\/dynamic_bitset.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/math\/distributions\/binomial.hpp>\n#include <boost\/unordered_map.hpp> \n#include <boost\/unordered_set.hpp> \n\n#include \"moses\/TranslationModel\/UG\/generic\/program_options\/ug_get_options.h\"\n\/\/ #include \"ug_translation_finder.h\"\n\/\/ #include \"ug_sorters.h\"\n\/\/ #include \"ug_corpus_sampling.h\"\n#include \"ug_mm_2d_table.h\"\n#include \"ug_mm_ttrack.h\"\n#include \"ug_corpus_token.h\"\n\nusing namespace std;\nusing namespace ugdiss;\nusing namespace boost::math;\n\ntypedef mm2dTable<id_type,id_type,uint32_t,uint32_t> LEX_t;\ntypedef SimpleWordId Token;\n\nid_type first_rare_id=500;\nvector<vector<uint32_t> > JFREQ; \/\/ joint count table for frequent L1 words\nvector<map<id_type,uint32_t> > JRARE; \/\/ joint count table for rare L1 words\nvector<vector<uint32_t> > CFREQ; \/\/ cooc count table for frequent L1 words\nvector<map<id_type,uint32_t> > CRARE; \/\/ cooc count table for rare L1 words\n\nmmTtrack<Token> T1,T2;\nmmTtrack<char> Tx;\nTokenIndex V1,V2;\n\nstring bname,cfgFile,L1,L2,oname,cooc;\n\n\/\/ DECLARATIONS \nvoid interpret_args(int ac, char* av[]);\n\nvoid\nprocessSentence(id_type sid)\n{\n Token const* s1 = T1.sntStart(sid);\n Token const* e1 = T1.sntEnd(sid);\n Token const* s2 = T2.sntStart(sid);\n Token const* e2 = T2.sntEnd(sid);\n char const* p = Tx.sntStart(sid);\n char const* q = Tx.sntEnd(sid);\n ushort r,c;\n bitvector check1(T1.sntLen(sid)), check2(T2.sntLen(sid));\n check1.set();\n check2.set();\n vector<ushort> cnt1(V1.ksize(),0);\n vector<ushort> cnt2(V2.ksize(),0);\n boost::unordered_set<pair<id_type,id_type> > mycoocs;\n\n for (Token const* x = s1; x < e1; ++x) ++cnt1[x->id()];\n for (Token const* x = s2; x < e2; ++x) ++cnt2[x->id()];\n\n \/\/ count links\n while (p < q)\n {\n p = binread(p,r);\n p = binread(p,c);\n check1.reset(r);\n check2.reset(c);\n id_type id1 = (s1+r)->id();\n id_type id2 = (s2+c)->id();\n if (id1 < first_rare_id) \n\tJFREQ[id1][id2]++;\n else \n\tJRARE[id1][id2]++;\n if (cooc.size())\n\tmycoocs.insert(pair<id_type,id_type>(id1,id2));\n }\n \/\/ count unaliged words\n for (size_t i = check1.find_first(); i < check1.size(); i = check1.find_next(i))\n {\n id_type id1 = (s1+i)->id();\n if (id1 < first_rare_id) JFREQ[id1][0]++;\n else JRARE[id1][0]++;\n }\n for (size_t i = check2.find_first(); i < check2.size(); i = check2.find_next(i))\n JFREQ[0][(s2+i)->id()]++;\n\n if (cooc.size())\n {\n typedef boost::unordered_set<pair<id_type,id_type> >::iterator iter;\n for (iter m = mycoocs.begin(); m != mycoocs.end(); ++m)\n\tif (m->first < first_rare_id)\n\t CFREQ[m->first][m->second] += cnt1[m->first] * cnt2[m->second];\n\telse\n\t CRARE[m->first][m->second] += cnt1[m->first] * cnt2[m->second];\n }\n}\n\n\/\/ void\n\/\/ count_coocs(id_type sid)\n\/\/ {\n\/\/ Token const* s1 = T1.sntStart(sid);\n\/\/ Token const* e1 = T1.sntEnd(sid);\n\n\/\/ Token const* s2 = T2.sntStart(sid);\n\/\/ Token const* e2 = T2.sntEnd(sid);\n\n\/\/ for (Token const* x = s1; x < e1; ++x)\n\/\/ {\n\/\/ if (x->id() < first_rare_id)\n\/\/ \t{\n\/\/ \t vector<uint32_t>& v = CFREQ[x->id()];\n\/\/ \t for (Token const* y = s2; y < e2; ++y) \n\/\/ \t ++v[y->id()];\n\/\/ \t}\n\/\/ else\n\/\/ \t{\n\/\/ \t map<id_type,uint32_t>& m = CRARE[x->id()]; \n\/\/ \t for (Token const* y = s2; y < e2; ++y) \n\/\/ \t ++m[y->id()];\n\/\/ \t}\n\/\/ }\n\/\/ }\n\n\nvoid\nwriteTable(string ofname, vector<vector<uint32_t> >& FREQ,\n\t vector<map<id_type,uint32_t> >& RARE)\n{\n ofstream out(ofname.c_str());\n filepos_type idxOffset=0;\n\n vector<uint32_t> m1; \/\/ marginals L1\n vector<uint32_t> m2; \/\/ marginals L2\n m1.resize(max(first_rare_id,V1.getNumTokens()),0);\n m2.resize(V2.getNumTokens(),0);\n vector<id_type> index(V1.getNumTokens()+1,0);\n numwrite(out,idxOffset); \/\/ blank for the time being\n numwrite(out,id_type(m1.size()));\n numwrite(out,id_type(m2.size()));\n\n id_type cellCount=0;\n id_type stop = min(first_rare_id,id_type(m1.size()));\n for (id_type id1 = 0; id1 < stop; ++id1)\n {\n index[id1] = cellCount;\n vector<uint32_t> const& v = FREQ[id1];\n for (id_type id2 = 0; id2 < id_type(v.size()); ++id2)\n {\n if (!v[id2]) continue;\n cellCount++;\n numwrite(out,id2);\n out.write(reinterpret_cast<char const*>(&v[id2]),sizeof(uint32_t));\n m1[id1] += v[id2];\n m2[id2] += v[id2];\n }\n }\n for (id_type id1 = stop; id1 < id_type(m1.size()); ++id1)\n {\n index[id1] = cellCount;\n map<id_type,uint32_t> const& M = RARE[id1];\n for (map<id_type,uint32_t>::const_iterator m = M.begin(); m != M.end(); ++m)\n {\n if (m->second == 0) continue;\n cellCount++;\n numwrite(out,m->first);\n out.write(reinterpret_cast<char const*>(&m->second),sizeof(float));\n m1[id1] += m->second;\n m2[m->first] += m->second;\n }\n }\n index[m1.size()] = cellCount;\n idxOffset = out.tellp();\n for (size_t i = 0; i < index.size(); ++i)\n numwrite(out,index[i]);\n out.write(reinterpret_cast<char const*>(&m1[0]),m1.size()*sizeof(float));\n out.write(reinterpret_cast<char const*>(&m2[0]),m2.size()*sizeof(float));\n \n \/\/ re-write the file header\n out.seekp(0);\n numwrite(out,idxOffset);\n out.close();\n}\n\nint \nmain(int argc, char* argv[])\n{\n interpret_args(argc,argv);\n char c = *bname.rbegin();\n if (c != '\/' && c != '.') bname += '.';\n T1.open(bname+L1+\".mct\");\n T2.open(bname+L2+\".mct\");\n Tx.open(bname+L1+\"-\"+L2+\".mam\");\n V1.open(bname+L1+\".tdx\");\n V2.open(bname+L2+\".tdx\");\n\n JFREQ.resize(first_rare_id,vector<uint32_t>(V2.ksize(),0));\n JRARE.resize(V1.ksize());\n\n CFREQ.resize(first_rare_id,vector<uint32_t>(V2.ksize(),0));\n CRARE.resize(V1.ksize());\n\n for (size_t sid = 0; sid < T1.size(); ++sid)\n {\n if (sid%10000 == 0) cerr << sid << endl; \n processSentence(sid);\n }\n \n if (oname.size()) writeTable(oname,JFREQ,JRARE);\n if (cooc.size()) writeTable(cooc,CFREQ,CRARE);\n exit(0);\n}\n\nvoid \ninterpret_args(int ac, char* av[])\n{\n namespace po=boost::program_options;\n po::variables_map vm;\n po::options_description o(\"Options\");\n po::options_description h(\"Hidden Options\");\n po::positional_options_description a;\n\n o.add_options()\n (\"help,h\", \"print this message\")\n (\"cfg,f\", po::value<string>(&cfgFile),\"config file\")\n (\"oname,o\", po::value<string>(&oname),\"output file name\")\n (\"cooc,c\", po::value<string>(&cooc),\n \"file name for raw co-occurrence counts\")\n ;\n \n h.add_options()\n (\"bname\", po::value<string>(&bname), \"base name\")\n (\"L1\", po::value<string>(&L1),\"L1 tag\")\n (\"L2\", po::value<string>(&L2),\"L2 tag\")\n ;\n a.add(\"bname\",1);\n a.add(\"L1\",1);\n a.add(\"L2\",1);\n get_options(ac,av,h.add(o),a,vm,\"cfg\");\n\n if (vm.count(\"help\") || bname.empty() || (oname.empty() && cooc.empty()))\n {\n cout << \"usage:\\n\\t\" << av[0] << \" <basename> <L1 tag> <L2 tag> [-o <output file>] [-c <output file>]\\n\" << endl;\n cout << \"at least one of -o \/ -c must be specified.\" << endl;\n cout << o << endl;\n exit(0);\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2021 The XLS Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ This file contains the main function (entry point) of the xlscc\n\/\/ front-end. It accepts as input a C\/C++ file and produces as textual output\n\/\/ the equivalent XLS intermediate representation (IR).\n\n#include <cstdlib>\n#include <fstream>\n#include <streambuf>\n\n#include \"absl\/flags\/flag.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"absl\/strings\/str_split.h\"\n#include \"clang\/include\/clang\/AST\/Attr.h\"\n#include \"clang\/include\/clang\/AST\/Decl.h\"\n#include \"clang\/include\/clang\/AST\/DeclCXX.h\"\n#include \"clang\/include\/clang\/AST\/Expr.h\"\n#include \"clang\/include\/clang\/AST\/Stmt.h\"\n#include \"xls\/codegen\/block_conversion.h\"\n#include \"xls\/codegen\/block_generator.h\"\n#include \"xls\/common\/init_xls.h\"\n#include \"xls\/common\/logging\/logging.h\"\n#include \"xls\/common\/status\/status_macros.h\"\n#include \"xls\/contrib\/xlscc\/hls_block.pb.h\"\n#include \"xls\/contrib\/xlscc\/metadata_output.pb.h\"\n#include \"xls\/contrib\/xlscc\/translator.h\"\n#include \"xls\/ir\/block.h\"\n#include \"xls\/passes\/standard_pipeline.h\"\n\nconst char kUsage[] = R\"(\nGenerates XLS IR from a given C++ file, or generates Verilog in the special\ncase of a combinational module.\n\nEmit XLS IR:\nxlscc foo.cc\n\nEmit combinational Verilog module:\nxlscc foo.cc --block_pb block_info.pb\n\n)\";\n\nABSL_FLAG(std::string, module_name, \"\",\n \"Explicit name to use for the generated module; if not provided the \"\n \"mangled IR function name is used\");\n\nABSL_FLAG(std::string, block_pb, \"\",\n \"HLSBlock protobuf for generating as HLS block \/ XLS proc\");\n\nABSL_FLAG(std::string, top, \"\", \"Top function name\");\n\nABSL_FLAG(std::string, package, \"\", \"Package name to generate\");\n\nABSL_FLAG(std::string, clang_args_file, \"\",\n \"File containing on each line one command line argument for clang\");\n\nABSL_FLAG(std::vector<std::string>, defines, std::vector<std::string>(),\n \"Comma separated list of defines to pass to clang\");\n\nABSL_FLAG(std::vector<std::string>, include_dirs, std::vector<std::string>(),\n \"Comma separated list of include directories to pass to clang\");\n\nABSL_FLAG(std::string, meta_out, \"\",\n \"Path at which to output metadata protobuf\");\n\nABSL_FLAG(bool, dump_ir_only, false,\n \"Output proc IR and do not continue to block\/verilog generation\");\n\nnamespace xlscc {\n\nabsl::Status Run(absl::string_view cpp_path) {\n xlscc::Translator translator;\n\n const std::string block_pb_name = absl::GetFlag(FLAGS_block_pb);\n\n HLSBlock block;\n if (!block_pb_name.empty()) {\n std::ifstream file_in(block_pb_name);\n if (!block.ParseFromIstream(&file_in)) {\n return absl::InvalidArgumentError(\"Couldn't parse protobuf\");\n }\n }\n\n const std::string top_function_name = absl::GetFlag(FLAGS_top);\n\n if (!top_function_name.empty()) {\n XLS_RETURN_IF_ERROR(translator.SelectTop(top_function_name));\n }\n\n std::vector<std::string> clang_argvs;\n\n const std::string clang_args_file = absl::GetFlag(FLAGS_clang_args_file);\n\n if (!clang_args_file.empty()) {\n XLS_ASSIGN_OR_RETURN(std::string clang_args_content,\n xls::GetFileContents(clang_args_file));\n for (auto arg :\n absl::StrSplit(clang_args_content, '\\n', absl::SkipWhitespace())) {\n clang_argvs.push_back(std::string(absl::StripAsciiWhitespace(arg)));\n }\n }\n\n for (std::string& def : absl::GetFlag(FLAGS_defines)) {\n clang_argvs.push_back(absl::StrCat(\"-D\", def));\n }\n\n for (std::string& dir : absl::GetFlag(FLAGS_include_dirs)) {\n clang_argvs.push_back(absl::StrCat(\"-I\", dir));\n }\n\n std::vector<absl::string_view> clang_argv;\n for (size_t i = 0; i < clang_argvs.size(); ++i) {\n clang_argv.push_back(clang_argvs[i]);\n }\n\n std::cerr << \"Parsing file '\" << cpp_path << \"' with clang...\" << std::endl;\n XLS_RETURN_IF_ERROR(translator.ScanFile(\n cpp_path, clang_argv.empty()\n ? absl::Span<absl::string_view>()\n : absl::MakeSpan(&clang_argv[0], clang_argv.size())));\n\n XLS_ASSIGN_OR_RETURN(absl::StatusOr<std::string> top_name,\n translator.GetEntryFunctionName());\n\n std::string package_name = absl::GetFlag(FLAGS_package);\n\n if (package_name.empty()) {\n package_name = \"my_package\";\n } else {\n package_name = top_name.value();\n }\n\n std::cerr << \"Generating IR...\" << std::endl;\n xls::Package package(package_name, top_name.value());\n if (block_pb_name.empty()) {\n XLS_RETURN_IF_ERROR(translator.GenerateIR_Top_Function(&package).status());\n \/\/ TODO(seanhaskell): Simplify IR\n std::cout << package.DumpIr() << std::endl;\n } else {\n XLS_ASSIGN_OR_RETURN(xls::Proc * proc,\n translator.GenerateIR_Block(&package, block));\n\n if (absl::GetFlag(FLAGS_dump_ir_only)) {\n std::cerr << \"Saving Package IR...\" << std::endl;\n std::cout << package.DumpIr() << std::endl;\n } else {\n XLS_RETURN_IF_ERROR(translator.InlineAllInvokes(&package));\n\n xls::verilog::CodegenOptions codegen_options;\n codegen_options.use_system_verilog(false);\n\n XLS_ASSIGN_OR_RETURN(xls::Block * xls_block,\n xls::verilog::ProcToCombinationalBlock(\n proc, proc->name(), codegen_options));\n std::cerr << \"Generating Verilog...\" << std::endl;\n XLS_ASSIGN_OR_RETURN(\n std::string verilog,\n xls::verilog::GenerateVerilog(xls_block, codegen_options));\n\n std::cout << verilog << std::endl;\n }\n }\n\n const std::string metadata_out_path = absl::GetFlag(FLAGS_meta_out);\n if (!metadata_out_path.empty()) {\n XLS_ASSIGN_OR_RETURN(xlscc_metadata::MetadataOutput meta,\n translator.GenerateMetadata());\n std::ofstream ostr(metadata_out_path);\n if (!ostr.good()) {\n return absl::NotFoundError(absl::StrFormat(\n \"Couldn't open metadata output path: %s\", metadata_out_path));\n }\n if (!meta.SerializeToOstream(&ostr)) {\n return absl::UnknownError(\"Error writing metadata proto\");\n }\n }\n\n return absl::OkStatus();\n}\n\n} \/\/ namespace xlscc\n\nint main(int argc, char** argv) {\n std::vector<absl::string_view> positional_arguments =\n xls::InitXls(kUsage, argc, argv);\n\n if (positional_arguments.size() != 1) {\n XLS_LOG(QFATAL) << absl::StreamFormat(\"Expected invocation: %s CPP_FILE\",\n argv[0]);\n }\n absl::string_view cpp_path = positional_arguments[0];\n \/\/ XLS_QCHECK_OK(xlscc::Run(cpp_path));\n absl::Status status = xlscc::Run(cpp_path);\n if (!status.ok()) {\n std::cerr << status.ToString() << std::endl;\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\n<commit_msg>[XLSCC] Remove unused module_name flag. Enable package_name provided by user to be the package name of the IR.<commit_after>\/\/ Copyright 2021 The XLS Authors\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ This file contains the main function (entry point) of the xlscc\n\/\/ front-end. It accepts as input a C\/C++ file and produces as textual output\n\/\/ the equivalent XLS intermediate representation (IR).\n\n#include <cstdlib>\n#include <fstream>\n#include <streambuf>\n\n#include \"absl\/flags\/flag.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/str_format.h\"\n#include \"absl\/strings\/str_split.h\"\n#include \"clang\/include\/clang\/AST\/Attr.h\"\n#include \"clang\/include\/clang\/AST\/Decl.h\"\n#include \"clang\/include\/clang\/AST\/DeclCXX.h\"\n#include \"clang\/include\/clang\/AST\/Expr.h\"\n#include \"clang\/include\/clang\/AST\/Stmt.h\"\n#include \"xls\/codegen\/block_conversion.h\"\n#include \"xls\/codegen\/block_generator.h\"\n#include \"xls\/common\/init_xls.h\"\n#include \"xls\/common\/logging\/logging.h\"\n#include \"xls\/common\/status\/status_macros.h\"\n#include \"xls\/contrib\/xlscc\/hls_block.pb.h\"\n#include \"xls\/contrib\/xlscc\/metadata_output.pb.h\"\n#include \"xls\/contrib\/xlscc\/translator.h\"\n#include \"xls\/ir\/block.h\"\n#include \"xls\/passes\/standard_pipeline.h\"\n\nconst char kUsage[] = R\"(\nGenerates XLS IR from a given C++ file, or generates Verilog in the special\ncase of a combinational module.\n\nEmit XLS IR:\nxlscc foo.cc\n\nEmit combinational Verilog module:\nxlscc foo.cc --block_pb block_info.pb\n\n)\";\n\nABSL_FLAG(std::string, block_pb, \"\",\n \"HLSBlock protobuf for generating as HLS block \/ XLS proc\");\n\nABSL_FLAG(std::string, top, \"\", \"Top function name\");\n\nABSL_FLAG(std::string, package, \"\", \"Package name to generate\");\n\nABSL_FLAG(std::string, clang_args_file, \"\",\n \"File containing on each line one command line argument for clang\");\n\nABSL_FLAG(std::vector<std::string>, defines, std::vector<std::string>(),\n \"Comma separated list of defines to pass to clang\");\n\nABSL_FLAG(std::vector<std::string>, include_dirs, std::vector<std::string>(),\n \"Comma separated list of include directories to pass to clang\");\n\nABSL_FLAG(std::string, meta_out, \"\",\n \"Path at which to output metadata protobuf\");\n\nABSL_FLAG(bool, dump_ir_only, false,\n \"Output proc IR and do not continue to block\/verilog generation\");\n\nnamespace xlscc {\n\nabsl::Status Run(absl::string_view cpp_path) {\n xlscc::Translator translator;\n\n const std::string block_pb_name = absl::GetFlag(FLAGS_block_pb);\n\n HLSBlock block;\n if (!block_pb_name.empty()) {\n std::ifstream file_in(block_pb_name);\n if (!block.ParseFromIstream(&file_in)) {\n return absl::InvalidArgumentError(\"Couldn't parse protobuf\");\n }\n }\n\n const std::string top_function_name = absl::GetFlag(FLAGS_top);\n\n if (!top_function_name.empty()) {\n XLS_RETURN_IF_ERROR(translator.SelectTop(top_function_name));\n }\n\n std::vector<std::string> clang_argvs;\n\n const std::string clang_args_file = absl::GetFlag(FLAGS_clang_args_file);\n\n if (!clang_args_file.empty()) {\n XLS_ASSIGN_OR_RETURN(std::string clang_args_content,\n xls::GetFileContents(clang_args_file));\n for (auto arg :\n absl::StrSplit(clang_args_content, '\\n', absl::SkipWhitespace())) {\n clang_argvs.push_back(std::string(absl::StripAsciiWhitespace(arg)));\n }\n }\n\n for (std::string& def : absl::GetFlag(FLAGS_defines)) {\n clang_argvs.push_back(absl::StrCat(\"-D\", def));\n }\n\n for (std::string& dir : absl::GetFlag(FLAGS_include_dirs)) {\n clang_argvs.push_back(absl::StrCat(\"-I\", dir));\n }\n\n std::vector<absl::string_view> clang_argv;\n for (size_t i = 0; i < clang_argvs.size(); ++i) {\n clang_argv.push_back(clang_argvs[i]);\n }\n\n std::cerr << \"Parsing file '\" << cpp_path << \"' with clang...\" << std::endl;\n XLS_RETURN_IF_ERROR(translator.ScanFile(\n cpp_path, clang_argv.empty()\n ? absl::Span<absl::string_view>()\n : absl::MakeSpan(&clang_argv[0], clang_argv.size())));\n\n XLS_ASSIGN_OR_RETURN(absl::StatusOr<std::string> top_name,\n translator.GetEntryFunctionName());\n\n std::string package_name = absl::GetFlag(FLAGS_package);\n\n if (package_name.empty()) {\n package_name = \"my_package\";\n }\n\n std::cerr << \"Generating IR...\" << std::endl;\n xls::Package package(package_name, top_name.value());\n if (block_pb_name.empty()) {\n XLS_RETURN_IF_ERROR(translator.GenerateIR_Top_Function(&package).status());\n \/\/ TODO(seanhaskell): Simplify IR\n std::cout << package.DumpIr() << std::endl;\n } else {\n XLS_ASSIGN_OR_RETURN(xls::Proc * proc,\n translator.GenerateIR_Block(&package, block));\n\n if (absl::GetFlag(FLAGS_dump_ir_only)) {\n std::cerr << \"Saving Package IR...\" << std::endl;\n std::cout << package.DumpIr() << std::endl;\n } else {\n XLS_RETURN_IF_ERROR(translator.InlineAllInvokes(&package));\n\n xls::verilog::CodegenOptions codegen_options;\n codegen_options.use_system_verilog(false);\n\n XLS_ASSIGN_OR_RETURN(xls::Block * xls_block,\n xls::verilog::ProcToCombinationalBlock(\n proc, proc->name(), codegen_options));\n std::cerr << \"Generating Verilog...\" << std::endl;\n XLS_ASSIGN_OR_RETURN(\n std::string verilog,\n xls::verilog::GenerateVerilog(xls_block, codegen_options));\n\n std::cout << verilog << std::endl;\n }\n }\n\n const std::string metadata_out_path = absl::GetFlag(FLAGS_meta_out);\n if (!metadata_out_path.empty()) {\n XLS_ASSIGN_OR_RETURN(xlscc_metadata::MetadataOutput meta,\n translator.GenerateMetadata());\n std::ofstream ostr(metadata_out_path);\n if (!ostr.good()) {\n return absl::NotFoundError(absl::StrFormat(\n \"Couldn't open metadata output path: %s\", metadata_out_path));\n }\n if (!meta.SerializeToOstream(&ostr)) {\n return absl::UnknownError(\"Error writing metadata proto\");\n }\n }\n\n return absl::OkStatus();\n}\n\n} \/\/ namespace xlscc\n\nint main(int argc, char** argv) {\n std::vector<absl::string_view> positional_arguments =\n xls::InitXls(kUsage, argc, argv);\n\n if (positional_arguments.size() != 1) {\n XLS_LOG(QFATAL) << absl::StreamFormat(\"Expected invocation: %s CPP_FILE\",\n argv[0]);\n }\n absl::string_view cpp_path = positional_arguments[0];\n \/\/ XLS_QCHECK_OK(xlscc::Run(cpp_path));\n absl::Status status = xlscc::Run(cpp_path);\n if (!status.ok()) {\n std::cerr << status.ToString() << std::endl;\n return EXIT_FAILURE;\n }\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"binson.hpp\"\n\n#include <binson_light.h>\n\n#include <string.h>\n#include <stdexcept>\n\nusing namespace std;\n\n#define IF_RUNTIME_ERROR(x, msg) if (!(x)) throw std::runtime_error(msg)\n\nconst std::array<std::string, 8> BinsonValue::typeToString =\n{\n \"noneType\",\n \"boolType\",\n \"intType\",\n \"doubleType\",\n \"stringType\",\n \"binaryType\",\n \"objectType\",\n \"arrayType\",\n};\n\nBinson & Binson::put(const std::string &key, const BinsonValue &v)\n{\n m_items[key] = move(v);\n return *this;\n}\n\nBinson & Binson::put(const std::string &key, Binson o)\n{\n m_items[key] = BinsonValue(move(o));\n return *this;\n}\n\nBinson & Binson::put(const string &key, const uint8_t *data, size_t size)\n{\n vector<uint8_t> v(data, data + size);\n m_items[key] = move(BinsonValue(move(v)));\n return *this;\n}\n\nconst BinsonValue Binson::get(const string &key) const\n{\n if (!hasKey(key))\n throw std::out_of_range(\"Key '\" + key + \"' does not exist\");\n else\n return m_items.at(key);\n}\n\nbool Binson::hasKey(const string &key) const\n{\n return m_items.find(key) != m_items.end();\n}\n\nvoid Binson::clear()\n{\n m_items.clear();\n}\n\nvoid Binson::seralizeItem(binson_writer *w, const BinsonValue &val) const\n{\n switch(val.myType())\n {\n case BinsonValue::Types::noneType:\n break;\n case BinsonValue::Types::boolType:\n binson_write_boolean(w, val.getBool());\n break;\n case BinsonValue::Types::intType:\n binson_write_integer(w, val.getInt());\n break;\n case BinsonValue::Types::doubleType:\n binson_write_double(w, val.getDouble());\n break;\n case BinsonValue::Types::stringType:\n binson_write_string_with_len(w,\n val.getString().data(),\n val.getString().size());\n break;\n case BinsonValue::Types::binaryType:\n binson_write_bytes(w, val.getBin().data(), val.getBin().size());\n break;\n case BinsonValue::Types::objectType:\n binson_write_object_begin(w);\n val.getObject().seralizeItems(w);\n binson_write_object_end(w);\n break;\n case BinsonValue::Types::arrayType:\n binson_write_array_begin(w);\n for (auto &arrayValue : val.getArray())\n {\n seralizeItem(w, arrayValue);\n }\n binson_write_array_end(w);\n break;\n default:\n throw runtime_error(\"Unknown binson type\");\n }\n}\n\nvoid Binson::seralizeItems(binson_writer *w) const\n{\n for (auto &item: m_items)\n {\n binson_write_name_with_len(w, item.first.c_str(), item.first.size());\n seralizeItem(w, item.second);\n }\n}\n\nstd::vector<uint8_t> Binson::serialize() const\n{\n vector<uint8_t> data;\n data.resize(1000);\n binson_writer w;\n binson_writer_init(&w, data.data(), data.size());\n serialize(&w);\n if (w.error_flags == BINSON_ERROR_RANGE)\n {\n data.resize(binson_writer_get_counter(&w));\n binson_writer_init(&w, data.data(), data.size());\n serialize(&w);\n }\n\n if (w.error_flags == BINSON_ERROR_NONE)\n data.resize(binson_writer_get_counter(&w));\n else\n data.clear();\n\n return data;\n}\n\nvoid Binson::serialize(binson_writer *w) const\n{\n binson_write_object_begin(w);\n seralizeItems(w);\n binson_write_object_end(w);\n}\n\nBinsonValue Binson::deseralizeItem(binson_parser *p)\n{\n uint8_t t = binson_parser_get_type(p);\n switch(t)\n {\n case BINSON_ID_BOOLEAN:\n return BinsonValue(binson_parser_get_boolean(p) == 0 ? false : true);\n break;\n case BINSON_ID_INTEGER:\n return BinsonValue(binson_parser_get_integer(p));\n break;\n case BINSON_ID_DOUBLE:\n return BinsonValue(binson_parser_get_double(p));\n break;\n case BINSON_ID_STRING:\n {\n bbuf *buf;\n buf = binson_parser_get_string_bbuf(p);\n if (buf)\n return BinsonValue(string(reinterpret_cast<const char*>(buf->bptr), buf->bsize));\n else\n throw runtime_error(\"Parse error, missing string\");\n }\n break;\n case BINSON_ID_BYTES:\n {\n bbuf *buf;\n buf = binson_parser_get_bytes_bbuf(p);\n if (buf)\n return BinsonValue(vector<uint8_t>(buf->bptr, buf->bptr + buf->bsize));\n else\n throw runtime_error(\"Parse error, missing data\");\n }\n break;\n case BINSON_ID_OBJECT:\n {\n IF_RUNTIME_ERROR(binson_parser_go_into_object(p), \"Parse error\");\n Binson b;\n b.deseralizeItems(p);\n IF_RUNTIME_ERROR(binson_parser_leave_object(p), \"Parse error\");\n return BinsonValue(b);\n }\n break;\n case BINSON_ID_ARRAY:\n {\n IF_RUNTIME_ERROR(binson_parser_go_into_array(p), \"Parse error\");\n vector<BinsonValue> array;\n while(binson_parser_next(p))\n {\n array.push_back(deseralizeItem(p));\n }\n IF_RUNTIME_ERROR(binson_parser_leave_array(p), \"Parse error\");\n return array;\n }\n break;\n default:\n throw runtime_error(\"Unknown type\");\n }\n return BinsonValue();\n}\n\nvoid Binson::deseralizeItems(binson_parser *p)\n{\n while(binson_parser_next(p))\n {\n bbuf *buf;\n buf = binson_parser_get_name(p);\n IF_RUNTIME_ERROR(buf != nullptr, \"Parse error\");\n string name(reinterpret_cast<const char*>(buf->bptr), buf->bsize);\n put(name, deseralizeItem(p));\n }\n}\n\nvoid Binson::deserialize(const std::vector<uint8_t> &data)\n{\n binson_parser p;\n clear();\n\n binson_parser_init(&p, const_cast<uint8_t*>(data.data()), data.size());\n binson_parser_go_into_object(&p);\n deseralizeItems(&p);\n binson_parser_leave_object(&p);\n}\n\nvoid Binson::deserialize(const uint8_t *data, size_t size)\n{\n binson_parser p;\n clear();\n\n IF_RUNTIME_ERROR(binson_parser_init(&p, const_cast<uint8_t*>(data), size), \"Parser init error\");\n deserialize(&p);\n}\n\nvoid Binson::deserialize(binson_parser *p)\n{\n clear();\n IF_RUNTIME_ERROR(binson_parser_reset(p), \"Parser reset error\");\n IF_RUNTIME_ERROR(binson_parser_go_into_object(p), \"Parse error\");\n deseralizeItems(p);\n IF_RUNTIME_ERROR(binson_parser_leave_object(p), \"Parse error\");\n}\n\nstring Binson::toStr() const\n{\n binson_parser p;\n string str;\n str.resize(10000);\n vector<uint8_t> stream = serialize();\n if (stream.empty())\n return string();\n int trys = 5;\n bool result = false;\n size_t size = 0;\n do\n {\n if (!binson_parser_init(&p, stream.data(), stream.size()))\n break;\n size = str.size();\n result = binson_parser_to_string(&p, (char*)str.data(), &size, true);\n if (!result)\n str.resize(size * 2);\n } while(!result && trys-- > 0 && p.error_flags == 0);\n\n if (!result)\n str.clear();\n else\n str.resize(size);\n return str;\n}\n\nBinsonValue::BinsonValue()\n{\n\n}\n\nBinsonValue::BinsonValue(bool val)\n{\n m_val.b = val;\n m_val.setType(Types::boolType);\n}\n\nBinsonValue::BinsonValue(int64_t val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n}\n\nBinsonValue::BinsonValue(int val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n}\n\nBinsonValue::BinsonValue(double val)\n{\n m_val.d = val;\n m_val.setType(Types::doubleType);\n}\n\nBinsonValue::BinsonValue(string &&val)\n{\n m_val.str = move(val);\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(const string &val)\n{\n m_val.str = val;\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(const char *str)\n{\n m_val.str = string(str);\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(std::vector<uint8_t> &&val)\n{\n m_val.bin = move(val);\n m_val.setType(Types::binaryType);\n}\n\nBinsonValue::BinsonValue(const std::vector<uint8_t> &val)\n{\n m_val.bin = val;\n m_val.setType(Types::binaryType);\n}\n\nBinsonValue::BinsonValue(Binson &&val)\n{\n m_val.o = move(val);\n m_val.setType(Types::objectType);\n}\n\nBinsonValue::BinsonValue(const Binson &val)\n{\n m_val.o = val;\n m_val.setType(Types::objectType);\n}\n\nBinsonValue::BinsonValue(std::vector<BinsonValue> &&val)\n{\n m_val.a = move(val);\n m_val.setType(Types::arrayType);\n}\n\nBinsonValue::BinsonValue(const std::vector<BinsonValue> &val)\n{\n m_val.a = val;\n m_val.setType(Types::arrayType);\n}\n\nBinsonValue BinsonValue::operator=(bool &&val)\n{\n m_val.b = move(val);\n m_val.setType(Types::boolType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(int64_t &&val)\n{\n m_val.i = move(val);\n m_val.setType(Types::intType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(int &&val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(double &&val)\n{\n m_val.d = move(val);\n m_val.setType(Types::doubleType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(string &&val)\n{\n m_val.str = move(val);\n m_val.setType(Types::stringType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(std::vector<uint8_t> &&val)\n{\n m_val.bin = move(val);\n m_val.setType(Types::binaryType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(Binson &&val)\n{\n m_val.o = move(val);\n m_val.setType(Types::objectType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(std::vector<BinsonValue> &&val)\n{\n m_val.a = move(val);\n m_val.setType(Types::arrayType);\n return *this;\n}\n<commit_msg>Fixed some clang warnings<commit_after>#include \"binson.hpp\"\n\n#include <binson_light.h>\n\n#include <string.h>\n#include <stdexcept>\n\nusing namespace std;\n\n#define IF_RUNTIME_ERROR(x, msg) if (!(x)) throw std::runtime_error(msg)\n\nconst std::array<std::string, 8> BinsonValue::typeToString\n{\n {\n \"noneType\",\n \"boolType\",\n \"intType\",\n \"doubleType\",\n \"stringType\",\n \"binaryType\",\n \"objectType\",\n \"arrayType\"\n }\n};\n\nBinson & Binson::put(const std::string &key, const BinsonValue &v)\n{\n m_items[key] = move(v);\n return *this;\n}\n\nBinson & Binson::put(const std::string &key, Binson o)\n{\n m_items[key] = BinsonValue(move(o));\n return *this;\n}\n\nBinson & Binson::put(const string &key, const uint8_t *data, size_t size)\n{\n vector<uint8_t> v(data, data + size);\n m_items[key] = BinsonValue(v);\n return *this;\n}\n\nconst BinsonValue Binson::get(const string &key) const\n{\n if (!hasKey(key))\n throw std::out_of_range(\"Key '\" + key + \"' does not exist\");\n else\n return m_items.at(key);\n}\n\nbool Binson::hasKey(const string &key) const\n{\n return m_items.find(key) != m_items.end();\n}\n\nvoid Binson::clear()\n{\n m_items.clear();\n}\n\nvoid Binson::seralizeItem(binson_writer *w, const BinsonValue &val) const\n{\n switch(val.myType())\n {\n case BinsonValue::Types::noneType:\n break;\n case BinsonValue::Types::boolType:\n binson_write_boolean(w, val.getBool());\n break;\n case BinsonValue::Types::intType:\n binson_write_integer(w, val.getInt());\n break;\n case BinsonValue::Types::doubleType:\n binson_write_double(w, val.getDouble());\n break;\n case BinsonValue::Types::stringType:\n binson_write_string_with_len(w,\n val.getString().data(),\n val.getString().size());\n break;\n case BinsonValue::Types::binaryType:\n binson_write_bytes(w, val.getBin().data(), val.getBin().size());\n break;\n case BinsonValue::Types::objectType:\n binson_write_object_begin(w);\n val.getObject().seralizeItems(w);\n binson_write_object_end(w);\n break;\n case BinsonValue::Types::arrayType:\n binson_write_array_begin(w);\n for (auto &arrayValue : val.getArray())\n {\n seralizeItem(w, arrayValue);\n }\n binson_write_array_end(w);\n break;\n default:\n throw runtime_error(\"Unknown binson type\");\n }\n}\n\nvoid Binson::seralizeItems(binson_writer *w) const\n{\n for (auto &item: m_items)\n {\n binson_write_name_with_len(w, item.first.c_str(), item.first.size());\n seralizeItem(w, item.second);\n }\n}\n\nstd::vector<uint8_t> Binson::serialize() const\n{\n vector<uint8_t> data;\n data.resize(1000);\n binson_writer w;\n binson_writer_init(&w, data.data(), data.size());\n serialize(&w);\n if (w.error_flags == BINSON_ERROR_RANGE)\n {\n data.resize(binson_writer_get_counter(&w));\n binson_writer_init(&w, data.data(), data.size());\n serialize(&w);\n }\n\n if (w.error_flags == BINSON_ERROR_NONE)\n data.resize(binson_writer_get_counter(&w));\n else\n data.clear();\n\n return data;\n}\n\nvoid Binson::serialize(binson_writer *w) const\n{\n binson_write_object_begin(w);\n seralizeItems(w);\n binson_write_object_end(w);\n}\n\nBinsonValue Binson::deseralizeItem(binson_parser *p)\n{\n uint8_t t = binson_parser_get_type(p);\n switch(t)\n {\n case BINSON_ID_BOOLEAN:\n return BinsonValue(binson_parser_get_boolean(p) == 0 ? false : true);\n break;\n case BINSON_ID_INTEGER:\n return BinsonValue(binson_parser_get_integer(p));\n break;\n case BINSON_ID_DOUBLE:\n return BinsonValue(binson_parser_get_double(p));\n break;\n case BINSON_ID_STRING:\n {\n bbuf *buf;\n buf = binson_parser_get_string_bbuf(p);\n if (buf)\n return BinsonValue(string(reinterpret_cast<const char*>(buf->bptr), buf->bsize));\n else\n throw runtime_error(\"Parse error, missing string\");\n }\n break;\n case BINSON_ID_BYTES:\n {\n bbuf *buf;\n buf = binson_parser_get_bytes_bbuf(p);\n if (buf)\n return BinsonValue(vector<uint8_t>(buf->bptr, buf->bptr + buf->bsize));\n else\n throw runtime_error(\"Parse error, missing data\");\n }\n break;\n case BINSON_ID_OBJECT:\n {\n IF_RUNTIME_ERROR(binson_parser_go_into_object(p), \"Parse error\");\n Binson b;\n b.deseralizeItems(p);\n IF_RUNTIME_ERROR(binson_parser_leave_object(p), \"Parse error\");\n return BinsonValue(b);\n }\n break;\n case BINSON_ID_ARRAY:\n {\n IF_RUNTIME_ERROR(binson_parser_go_into_array(p), \"Parse error\");\n vector<BinsonValue> array;\n while(binson_parser_next(p))\n {\n array.push_back(deseralizeItem(p));\n }\n IF_RUNTIME_ERROR(binson_parser_leave_array(p), \"Parse error\");\n return array;\n }\n break;\n default:\n throw runtime_error(\"Unknown type\");\n }\n return BinsonValue();\n}\n\nvoid Binson::deseralizeItems(binson_parser *p)\n{\n while(binson_parser_next(p))\n {\n bbuf *buf;\n buf = binson_parser_get_name(p);\n IF_RUNTIME_ERROR(buf != nullptr, \"Parse error\");\n string name(reinterpret_cast<const char*>(buf->bptr), buf->bsize);\n put(name, deseralizeItem(p));\n }\n}\n\nvoid Binson::deserialize(const std::vector<uint8_t> &data)\n{\n binson_parser p;\n clear();\n\n binson_parser_init(&p, const_cast<uint8_t*>(data.data()), data.size());\n binson_parser_go_into_object(&p);\n deseralizeItems(&p);\n binson_parser_leave_object(&p);\n}\n\nvoid Binson::deserialize(const uint8_t *data, size_t size)\n{\n binson_parser p;\n clear();\n\n IF_RUNTIME_ERROR(binson_parser_init(&p, const_cast<uint8_t*>(data), size), \"Parser init error\");\n deserialize(&p);\n}\n\nvoid Binson::deserialize(binson_parser *p)\n{\n clear();\n IF_RUNTIME_ERROR(binson_parser_reset(p), \"Parser reset error\");\n IF_RUNTIME_ERROR(binson_parser_go_into_object(p), \"Parse error\");\n deseralizeItems(p);\n IF_RUNTIME_ERROR(binson_parser_leave_object(p), \"Parse error\");\n}\n\nstring Binson::toStr() const\n{\n binson_parser p;\n string str;\n str.resize(10000);\n vector<uint8_t> stream = serialize();\n if (stream.empty())\n return string();\n int trys = 5;\n bool result = false;\n size_t size = 0;\n do\n {\n if (!binson_parser_init(&p, stream.data(), stream.size()))\n break;\n size = str.size();\n result = binson_parser_to_string(&p, (char*)str.data(), &size, true);\n if (!result)\n str.resize(size * 2);\n } while(!result && trys-- > 0 && p.error_flags == 0);\n\n if (!result)\n str.clear();\n else\n str.resize(size);\n return str;\n}\n\nBinsonValue::BinsonValue()\n{\n\n}\n\nBinsonValue::BinsonValue(bool val)\n{\n m_val.b = val;\n m_val.setType(Types::boolType);\n}\n\nBinsonValue::BinsonValue(int64_t val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n}\n\nBinsonValue::BinsonValue(int val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n}\n\nBinsonValue::BinsonValue(double val)\n{\n m_val.d = val;\n m_val.setType(Types::doubleType);\n}\n\nBinsonValue::BinsonValue(string &&val)\n{\n m_val.str = move(val);\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(const string &val)\n{\n m_val.str = val;\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(const char *str)\n{\n m_val.str = string(str);\n m_val.setType(Types::stringType);\n}\n\nBinsonValue::BinsonValue(std::vector<uint8_t> &&val)\n{\n m_val.bin = move(val);\n m_val.setType(Types::binaryType);\n}\n\nBinsonValue::BinsonValue(const std::vector<uint8_t> &val)\n{\n m_val.bin = val;\n m_val.setType(Types::binaryType);\n}\n\nBinsonValue::BinsonValue(Binson &&val)\n{\n m_val.o = move(val);\n m_val.setType(Types::objectType);\n}\n\nBinsonValue::BinsonValue(const Binson &val)\n{\n m_val.o = val;\n m_val.setType(Types::objectType);\n}\n\nBinsonValue::BinsonValue(std::vector<BinsonValue> &&val)\n{\n m_val.a = move(val);\n m_val.setType(Types::arrayType);\n}\n\nBinsonValue::BinsonValue(const std::vector<BinsonValue> &val)\n{\n m_val.a = val;\n m_val.setType(Types::arrayType);\n}\n\nBinsonValue BinsonValue::operator=(bool &&val)\n{\n m_val.b = move(val);\n m_val.setType(Types::boolType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(int64_t &&val)\n{\n m_val.i = move(val);\n m_val.setType(Types::intType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(int &&val)\n{\n m_val.i = val;\n m_val.setType(Types::intType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(double &&val)\n{\n m_val.d = move(val);\n m_val.setType(Types::doubleType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(string &&val)\n{\n m_val.str = move(val);\n m_val.setType(Types::stringType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(std::vector<uint8_t> &&val)\n{\n m_val.bin = move(val);\n m_val.setType(Types::binaryType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(Binson &&val)\n{\n m_val.o = move(val);\n m_val.setType(Types::objectType);\n return *this;\n}\n\nBinsonValue BinsonValue::operator=(std::vector<BinsonValue> &&val)\n{\n m_val.a = move(val);\n m_val.setType(Types::arrayType);\n return *this;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef HONDO_SIMPLESHADER_HPP\n#define HONDO_SIMPLESHADER_HPP\nclass SkyShader;\n#include \"ShaderProgram.hpp\"\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\nclass SkyShader {\n private:\n ShaderProgram shader_program;\n const GLuint mvpMatID;\n const GLuint modelMatID;\n public:\n SkyShader(); \n void operator()();\n void stop();\n void set_mvp_mat(const glm::mat4& mvpMat);\n void set_model_mat(const glm::mat4& mvpMat);\n};\n#endif\n<commit_msg>Fixed include guard of SkyShader<commit_after>#ifndef HONDO_SKYSHADER_HPP\n#define HONDO_SKYSHADER_HPP\nclass SkyShader;\n#include \"ShaderProgram.hpp\"\n#define GLM_FORCE_RADIANS\n#include <glm\/glm.hpp>\nclass SkyShader {\n private:\n ShaderProgram shader_program;\n const GLuint mvpMatID;\n const GLuint modelMatID;\n public:\n SkyShader(); \n void operator()();\n void stop();\n void set_mvp_mat(const glm::mat4& mvpMat);\n void set_model_mat(const glm::mat4& mvpMat);\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Zillians MMO\n * Copyright (C) 2007-2009 Zillians.com, Inc.\n * For more information see http:\/\/www.zillians.com\n *\n * Zillians MMO is the library and runtime for massive multiplayer online game\n * development in utility computing model, which runs as a service for every\n * developer to build their virtual world running on our GPU-assisted machines.\n *\n * This is a close source library intended to be used solely within Zillians.com\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * COPYRIGHT HOLDER(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN\n * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\/**\n * @date Aug 28, 2009 sdk - Initial version created.\n *\/\n\n#include \"core-api\/ContextHub.h\"\n\nnamespace zillians {\n\n#if !ZILLIANS_SERVICEHUB_ALLOW_ARBITRARY_CONTEXT_PLACEMENT_FOR_DIFFERENT_INSTANCE\ntbb::atomic<uint32> ContextHub::msContextIndexer;\n#endif\n\n}\n<commit_msg>\tdeleted: src\/libzillians-common-core-api\/ContextHub.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n \nThis file is part of Navitia,\n the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n a non ending quest to the responsive locomotion way of traveling!\n \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"raptor_solutions.h\"\n#include \"raptor_path.h\"\n#include \"raptor.h\"\n#include \"raptor_path_defs.h\"\n\n\nnamespace bt = boost::posix_time;\nnamespace navitia { namespace routing {\n\nSolutions\nget_solutions(const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n bool clockwise, const type::AccessibiliteParams & accessibilite_params,\n bool disruption_active, const RAPTOR& raptor) {\n Solutions result;\n auto pareto_front = get_pareto_front(clockwise, departs, destinations,\n accessibilite_params, disruption_active, raptor);\n result.insert(pareto_front.begin(), pareto_front.end());\n\n if(!pareto_front.empty()) {\n auto walking_solutions = get_walking_solutions(clockwise, departs, destinations,\n *pareto_front.rbegin(), disruption_active, accessibilite_params, raptor);\n if(!walking_solutions.empty()) {\n result.insert(walking_solutions.begin(), walking_solutions.end());\n }\n }\n return result;\n}\n\n\nSolutions\nget_solutions(const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const DateTime &dep, bool clockwise, const type::Data & data, bool) {\n Solutions result;\n for(auto dep_dist : departs) {\n for(auto journey_pattern : data.pt_data->stop_points[dep_dist.first]->journey_pattern_point_list) {\n Solution d;\n d.count = 0;\n d.jpp_idx = journey_pattern->idx;\n d.walking_time = dep_dist.second;\n if(clockwise)\n d.arrival = dep + d.walking_time.total_seconds();\n else\n d.arrival = dep - d.walking_time.total_seconds();\n result.insert(d);\n }\n }\n return result;\n}\n\n\/\/ Does the current date improves compared to best_so_far – we must not forget to take the walking duration\nbool improves(const DateTime & best_so_far, bool clockwise, const DateTime & current, int walking_duration) {\n if(clockwise) {\n return (current - walking_duration) > best_so_far;\n } else {\n return (current + walking_duration) < best_so_far;\n }\n}\n\nSolutions\nget_pareto_front(bool clockwise, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n const type::AccessibiliteParams & accessibilite_params, bool disruption_active, const RAPTOR& raptor) {\n Solutions result;\n\n DateTime best_dt, best_dt_jpp;\n if(clockwise) {\n best_dt = DateTimeUtils::min;\n best_dt_jpp = DateTimeUtils::min;\n } else {\n best_dt = DateTimeUtils::inf;\n best_dt_jpp = DateTimeUtils::inf;\n }\n for(unsigned int round=1; round <= raptor.count; ++round) {\n \/\/ For every round with look for the best journey pattern point that belongs to one of the destination stop points\n \/\/ We must not forget to walking duration\n type::idx_t best_jpp = type::invalid_idx;\n for(auto spid_dist : destinations) {\n for(auto journey_pattern_point : raptor.data.pt_data->stop_points[spid_dist.first]->journey_pattern_point_list) {\n type::idx_t jppidx = journey_pattern_point->idx;\n auto& l = raptor.labels[round][jppidx];\n if(l.pt_is_initialized() &&\n improves(best_dt, clockwise, l.dt_pt, spid_dist.second.total_seconds()) ) {\n best_jpp = jppidx;\n best_dt_jpp = l.dt_pt;\n \/\/ Dans le sens horaire : lors du calcul on gardé que l’heure de départ, mais on veut l’arrivée\n \/\/ Il faut donc retrouver le stop_time qui nous intéresse avec best_stop_time\n const type::StopTime* st;\n DateTime dt = 0;\n\n std::tie(st, dt) = best_stop_time(journey_pattern_point, l.dt_pt, accessibilite_params.vehicle_properties,\n !clockwise, disruption_active, raptor.data, true);\n BOOST_ASSERT(st);\n if(st != nullptr) {\n if(clockwise) {\n auto arrival_time = !st->is_frequency() ? st->arrival_time : st->f_arrival_time(DateTimeUtils::hour(dt));\n DateTimeUtils::update(best_dt_jpp, arrival_time, false);\n } else {\n auto departure_time = !st->is_frequency() ? st->departure_time : st->f_departure_time(DateTimeUtils::hour(dt));\n DateTimeUtils::update(best_dt_jpp, departure_time, true);\n }\n }\n if(clockwise)\n best_dt = l.dt_pt - spid_dist.second.total_seconds();\n else\n best_dt = l.dt_pt + spid_dist.second.total_seconds();\n }\n }\n }\n if(best_jpp != type::invalid_idx) {\n Solution s;\n s.jpp_idx = best_jpp;\n s.count = round;\n s.walking_time = getWalkingTime(round, best_jpp, departs, destinations, clockwise, disruption_active,\n accessibilite_params, raptor);\n s.arrival = best_dt_jpp;\n s.ratio = 0;\n type::idx_t final_jpp_idx;\n std::tie(final_jpp_idx, s.upper_bound) = get_final_jppidx_and_date(round, best_jpp, clockwise,\n disruption_active, accessibilite_params, raptor);\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n if(clockwise) {\n s.upper_bound = s.upper_bound + spid_dep.second.total_seconds();\n s.total_arrival = raptor.labels[round][best_jpp].dt_pt - spid_dep.second.total_seconds();\n }else {\n s.upper_bound = s.upper_bound - spid_dep.second.total_seconds();\n s.total_arrival = raptor.labels[round][best_jpp].dt_pt + spid_dep.second.total_seconds();\n }\n }\n }\n result.insert(s);\n }\n }\n\n return result;\n}\n\n\n\n\n\nSolutions\nget_walking_solutions(bool clockwise, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations, const Solution& best,\n const bool disruption_active, const type::AccessibiliteParams &accessibilite_params,\n const RAPTOR& raptor) {\n Solutions result;\n\n std::\/*unordered_*\/map<type::idx_t, Solution> tmp;\n \/\/ We start at 1 because we don't want results of the first round\n for(uint32_t i=1; i <= raptor.count; ++i) {\n for(auto spid_dist : destinations) {\n Solution best_departure;\n best_departure.ratio = 2;\n best_departure.jpp_idx = type::invalid_idx;\n for(auto journey_pattern_point : raptor.data.pt_data->stop_points[spid_dist.first]->journey_pattern_point_list) {\n type::idx_t jppidx = journey_pattern_point->idx;\n \/\/ We only want solution ending by a vehicle journey or a stay_in\n if(raptor.labels[i][journey_pattern_point->idx].pt_is_initialized()) {\n navitia::time_duration walking_time = getWalkingTime(i, jppidx, departs, destinations, clockwise,\n disruption_active, accessibilite_params, raptor);\n if(best.walking_time < walking_time) {\n continue;\n }\n float lost_time;\n if(clockwise)\n lost_time = best.total_arrival -\n (raptor.labels[i][jppidx].dt_pt - best.walking_time.total_seconds());\n else\n lost_time = (raptor.labels[i][jppidx].dt_pt + spid_dist.second.total_seconds()) -\n best.total_arrival;\n\n\n \/\/Si je gagne 5 minutes de marche a pied, je suis pret à perdre jusqu'à 10 minutes.\n int walking_time_diff_in_s = (best.walking_time - walking_time).total_seconds();\n if (walking_time_diff_in_s > 0) {\n float ratio = lost_time \/ walking_time_diff_in_s;\n if( ratio >= best_departure.ratio) {\n continue;\n }\n Solution s;\n s.jpp_idx = jppidx;\n s.count = i;\n s.ratio = ratio;\n s.walking_time = walking_time;\n s.arrival = raptor.labels[i][jppidx].dt_pt;\n type::idx_t final_jpp_idx;\n DateTime last_time;\n std::tie(final_jpp_idx, last_time) = get_final_jppidx_and_date(i, jppidx, clockwise,\n disruption_active, accessibilite_params, raptor);\n\n if(clockwise) {\n s.upper_bound = last_time;\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n s.upper_bound = s.upper_bound + (spid_dep.second.total_seconds());\n }\n }\n } else {\n s.upper_bound = last_time;\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n s.upper_bound = s.upper_bound - (spid_dep.second.total_seconds());\n }\n }\n }\n best_departure = s;\n }\n }\n }\n if(best_departure.jpp_idx != type::invalid_idx) {\n if(tmp.find(best_departure.jpp_idx) == tmp.end()) {\n tmp.insert(std::make_pair(best_departure.jpp_idx, best_departure));\n } else if(tmp[best_departure.jpp_idx].ratio > best_departure.ratio) {\n tmp[best_departure.jpp_idx] = best_departure;\n }\n }\n }\n }\n\n\n std::vector<Solution> to_sort;\n for(auto p : tmp) {\n to_sort.push_back(p.second);\n }\n std::sort(to_sort.begin(), to_sort.end(),\n [](const Solution s1, const Solution s2) { return s1.ratio < s2.ratio;});\n\n if(to_sort.size() > 2)\n to_sort.resize(2);\n result.insert(to_sort.begin(), to_sort.end());\n\n return result;\n}\n\nstruct VisitorFinalJppAndDate : public BasePathVisitor {\n type::idx_t current_jpp = type::invalid_idx;\n DateTime last_time = DateTimeUtils::inf;\n void final_step(const type::idx_t current_jpp, size_t count, const std::vector<label_vector_t> &labels) {\n this->current_jpp = current_jpp;\n last_time = labels[count][current_jpp].dt_pt;\n }\n};\n\n\/\/ Reparcours l’itinéraire rapidement pour avoir le JPP et la date de départ (si on cherchait l’arrivée au plus tôt)\nstd::pair<type::idx_t, DateTime>\nget_final_jppidx_and_date(int count, type::idx_t jpp_idx, bool clockwise, bool disruption_active,\n const type::AccessibiliteParams & accessibilite_params, const RAPTOR& raptor) {\n VisitorFinalJppAndDate v;\n read_path(v, jpp_idx, count, !clockwise, disruption_active, accessibilite_params, raptor);\n return std::make_pair(v.current_jpp, v.last_time);\n}\n\n\nstruct VisitorWalkingTime : public BasePathVisitor {\n navitia::time_duration walking_time = {};\n type::idx_t departure_jpp_idx = type::invalid_idx;\n void connection(type::StopPoint* , type::StopPoint* ,\n boost::posix_time::ptime dep_time, boost::posix_time::ptime arr_time,\n type::StopPointConnection*) {\n\n walking_time += navitia::seconds((arr_time - dep_time).total_seconds());\n }\n\n void final_step(type::idx_t current_jpp, size_t , const std::vector<std::vector<Label>> &){\n departure_jpp_idx = current_jpp;\n }\n\n};\n\n\nnavitia::time_duration getWalkingTime(int count, type::idx_t jpp_idx, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n bool clockwise, bool disruption_active, const type::AccessibiliteParams & accessibilite_params,\n const RAPTOR& raptor) {\n\n const auto* current_jpp = raptor.data.pt_data->journey_pattern_points[jpp_idx];\n navitia::time_duration walking_time = {};\n\n \/\/Marche à la fin\n for(auto dest_dist : destinations) {\n if(dest_dist.first == current_jpp->stop_point->idx) {\n walking_time = dest_dist.second;\n break;\n }\n }\n\n VisitorWalkingTime v;\n read_path(v, current_jpp->idx, count, !clockwise, disruption_active, accessibilite_params, raptor);\n walking_time += v.walking_time;\n if (v.departure_jpp_idx == type::invalid_idx) {\n return walking_time;\n }\n const auto* departure_jpp = raptor.data.pt_data->journey_pattern_points[v.departure_jpp_idx];\n \/\/Marche au départ\n for(auto dep_dist : departs) {\n if(dep_dist.first == departure_jpp->stop_point->idx) {\n walking_time += dep_dist.second;\n break;\n }\n }\n\n return walking_time;\n}\n\n}}\n\n<commit_msg>Kraken: fix total arrival in get_pareto_front<commit_after>\/* Copyright © 2001-2014, Canal TP and\/or its affiliates. All rights reserved.\n \nThis file is part of Navitia,\n the software to build cool stuff with public transport.\n \nHope you'll enjoy and contribute to this project,\n powered by Canal TP (www.canaltp.fr).\nHelp us simplify mobility and open public transport:\n a non ending quest to the responsive locomotion way of traveling!\n \nLICENCE: This program is free software; you can redistribute it and\/or modify\nit under the terms of the GNU Affero General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n \nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Affero General Public License for more details.\n \nYou should have received a copy of the GNU Affero General Public License\nalong with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n \nStay tuned using\ntwitter @navitia \nIRC #navitia on freenode\nhttps:\/\/groups.google.com\/d\/forum\/navitia\nwww.navitia.io\n*\/\n\n#include \"raptor_solutions.h\"\n#include \"raptor_path.h\"\n#include \"raptor.h\"\n#include \"raptor_path_defs.h\"\n\n\nnamespace bt = boost::posix_time;\nnamespace navitia { namespace routing {\n\nSolutions\nget_solutions(const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n bool clockwise, const type::AccessibiliteParams & accessibilite_params,\n bool disruption_active, const RAPTOR& raptor) {\n Solutions result;\n auto pareto_front = get_pareto_front(clockwise, departs, destinations,\n accessibilite_params, disruption_active, raptor);\n result.insert(pareto_front.begin(), pareto_front.end());\n\n if(!pareto_front.empty()) {\n auto walking_solutions = get_walking_solutions(clockwise, departs, destinations,\n *pareto_front.rbegin(), disruption_active, accessibilite_params, raptor);\n if(!walking_solutions.empty()) {\n result.insert(walking_solutions.begin(), walking_solutions.end());\n }\n }\n return result;\n}\n\n\nSolutions\nget_solutions(const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const DateTime &dep, bool clockwise, const type::Data & data, bool) {\n Solutions result;\n for(auto dep_dist : departs) {\n for(auto journey_pattern : data.pt_data->stop_points[dep_dist.first]->journey_pattern_point_list) {\n Solution d;\n d.count = 0;\n d.jpp_idx = journey_pattern->idx;\n d.walking_time = dep_dist.second;\n if(clockwise)\n d.arrival = dep + d.walking_time.total_seconds();\n else\n d.arrival = dep - d.walking_time.total_seconds();\n result.insert(d);\n }\n }\n return result;\n}\n\n\/\/ Does the current date improves compared to best_so_far – we must not forget to take the walking duration\nbool improves(const DateTime & best_so_far, bool clockwise, const DateTime & current, int walking_duration) {\n if(clockwise) {\n return (current - walking_duration) > best_so_far;\n } else {\n return (current + walking_duration) < best_so_far;\n }\n}\n\nSolutions\nget_pareto_front(bool clockwise, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n const type::AccessibiliteParams & accessibilite_params, bool disruption_active, const RAPTOR& raptor) {\n Solutions result;\n\n DateTime best_dt, best_dt_jpp;\n if(clockwise) {\n best_dt = DateTimeUtils::min;\n best_dt_jpp = DateTimeUtils::min;\n } else {\n best_dt = DateTimeUtils::inf;\n best_dt_jpp = DateTimeUtils::inf;\n }\n for(unsigned int round=1; round <= raptor.count; ++round) {\n \/\/ For every round with look for the best journey pattern point that belongs to one of the destination stop points\n \/\/ We must not forget to walking duration\n type::idx_t best_jpp = type::invalid_idx;\n for(auto spid_dist : destinations) {\n for(auto journey_pattern_point : raptor.data.pt_data->stop_points[spid_dist.first]->journey_pattern_point_list) {\n type::idx_t jppidx = journey_pattern_point->idx;\n auto& l = raptor.labels[round][jppidx];\n if(l.pt_is_initialized() &&\n improves(best_dt, clockwise, l.dt_pt, spid_dist.second.total_seconds()) ) {\n best_jpp = jppidx;\n best_dt_jpp = l.dt_pt;\n \/\/ Dans le sens horaire : lors du calcul on gardé que l’heure de départ, mais on veut l’arrivée\n \/\/ Il faut donc retrouver le stop_time qui nous intéresse avec best_stop_time\n const type::StopTime* st;\n DateTime dt = 0;\n\n std::tie(st, dt) = best_stop_time(journey_pattern_point, l.dt_pt, accessibilite_params.vehicle_properties,\n !clockwise, disruption_active, raptor.data, true);\n BOOST_ASSERT(st);\n if(st != nullptr) {\n if(clockwise) {\n auto arrival_time = !st->is_frequency() ? st->arrival_time : st->f_arrival_time(DateTimeUtils::hour(dt));\n DateTimeUtils::update(best_dt_jpp, arrival_time, false);\n } else {\n auto departure_time = !st->is_frequency() ? st->departure_time : st->f_departure_time(DateTimeUtils::hour(dt));\n DateTimeUtils::update(best_dt_jpp, departure_time, true);\n }\n }\n if(clockwise)\n best_dt = l.dt_pt - spid_dist.second.total_seconds();\n else\n best_dt = l.dt_pt + spid_dist.second.total_seconds();\n }\n }\n }\n if(best_jpp != type::invalid_idx) {\n Solution s;\n s.jpp_idx = best_jpp;\n s.count = round;\n s.walking_time = getWalkingTime(round, best_jpp, departs, destinations, clockwise, disruption_active,\n accessibilite_params, raptor);\n s.arrival = best_dt_jpp;\n s.ratio = 0;\n s.total_arrival = best_dt;\n type::idx_t final_jpp_idx;\n std::tie(final_jpp_idx, s.upper_bound) = get_final_jppidx_and_date(round, best_jpp, clockwise,\n disruption_active, accessibilite_params, raptor);\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n if(clockwise) {\n s.upper_bound = s.upper_bound + spid_dep.second.total_seconds();\n }else {\n s.upper_bound = s.upper_bound - spid_dep.second.total_seconds();\n }\n }\n }\n result.insert(s);\n }\n }\n\n return result;\n}\n\n\n\n\n\nSolutions\nget_walking_solutions(bool clockwise, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations, const Solution& best,\n const bool disruption_active, const type::AccessibiliteParams &accessibilite_params,\n const RAPTOR& raptor) {\n Solutions result;\n\n std::\/*unordered_*\/map<type::idx_t, Solution> tmp;\n \/\/ We start at 1 because we don't want results of the first round\n for(uint32_t i=1; i <= raptor.count; ++i) {\n for(auto spid_dist : destinations) {\n Solution best_departure;\n best_departure.ratio = 2;\n best_departure.jpp_idx = type::invalid_idx;\n for(auto journey_pattern_point : raptor.data.pt_data->stop_points[spid_dist.first]->journey_pattern_point_list) {\n type::idx_t jppidx = journey_pattern_point->idx;\n \/\/ We only want solution ending by a vehicle journey or a stay_in\n if(raptor.labels[i][journey_pattern_point->idx].pt_is_initialized()) {\n navitia::time_duration walking_time = getWalkingTime(i, jppidx, departs, destinations, clockwise,\n disruption_active, accessibilite_params, raptor);\n if(best.walking_time < walking_time) {\n continue;\n }\n float lost_time;\n if(clockwise)\n lost_time = best.total_arrival -\n (raptor.labels[i][jppidx].dt_pt - best.walking_time.total_seconds());\n else\n lost_time = (raptor.labels[i][jppidx].dt_pt + spid_dist.second.total_seconds()) -\n best.total_arrival;\n\n\n \/\/Si je gagne 5 minutes de marche a pied, je suis pret à perdre jusqu'à 10 minutes.\n int walking_time_diff_in_s = (best.walking_time - walking_time).total_seconds();\n if (walking_time_diff_in_s > 0) {\n float ratio = lost_time \/ walking_time_diff_in_s;\n if( ratio >= best_departure.ratio) {\n continue;\n }\n Solution s;\n s.jpp_idx = jppidx;\n s.count = i;\n s.ratio = ratio;\n s.walking_time = walking_time;\n s.arrival = raptor.labels[i][jppidx].dt_pt;\n type::idx_t final_jpp_idx;\n DateTime last_time;\n std::tie(final_jpp_idx, last_time) = get_final_jppidx_and_date(i, jppidx, clockwise,\n disruption_active, accessibilite_params, raptor);\n\n if(clockwise) {\n s.upper_bound = last_time;\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n s.upper_bound = s.upper_bound + (spid_dep.second.total_seconds());\n }\n }\n } else {\n s.upper_bound = last_time;\n for(auto spid_dep : departs) {\n if(raptor.data.pt_data->journey_pattern_points[final_jpp_idx]->stop_point->idx == spid_dep.first) {\n s.upper_bound = s.upper_bound - (spid_dep.second.total_seconds());\n }\n }\n }\n best_departure = s;\n }\n }\n }\n if(best_departure.jpp_idx != type::invalid_idx) {\n if(tmp.find(best_departure.jpp_idx) == tmp.end()) {\n tmp.insert(std::make_pair(best_departure.jpp_idx, best_departure));\n } else if(tmp[best_departure.jpp_idx].ratio > best_departure.ratio) {\n tmp[best_departure.jpp_idx] = best_departure;\n }\n }\n }\n }\n\n\n std::vector<Solution> to_sort;\n for(auto p : tmp) {\n to_sort.push_back(p.second);\n }\n std::sort(to_sort.begin(), to_sort.end(),\n [](const Solution s1, const Solution s2) { return s1.ratio < s2.ratio;});\n\n if(to_sort.size() > 2)\n to_sort.resize(2);\n result.insert(to_sort.begin(), to_sort.end());\n\n return result;\n}\n\nstruct VisitorFinalJppAndDate : public BasePathVisitor {\n type::idx_t current_jpp = type::invalid_idx;\n DateTime last_time = DateTimeUtils::inf;\n void final_step(const type::idx_t current_jpp, size_t count, const std::vector<label_vector_t> &labels) {\n this->current_jpp = current_jpp;\n last_time = labels[count][current_jpp].dt_pt;\n }\n};\n\n\/\/ Reparcours l’itinéraire rapidement pour avoir le JPP et la date de départ (si on cherchait l’arrivée au plus tôt)\nstd::pair<type::idx_t, DateTime>\nget_final_jppidx_and_date(int count, type::idx_t jpp_idx, bool clockwise, bool disruption_active,\n const type::AccessibiliteParams & accessibilite_params, const RAPTOR& raptor) {\n VisitorFinalJppAndDate v;\n read_path(v, jpp_idx, count, !clockwise, disruption_active, accessibilite_params, raptor);\n return std::make_pair(v.current_jpp, v.last_time);\n}\n\n\nstruct VisitorWalkingTime : public BasePathVisitor {\n navitia::time_duration walking_time = {};\n type::idx_t departure_jpp_idx = type::invalid_idx;\n void connection(type::StopPoint* , type::StopPoint* ,\n boost::posix_time::ptime dep_time, boost::posix_time::ptime arr_time,\n type::StopPointConnection*) {\n\n walking_time += navitia::seconds((arr_time - dep_time).total_seconds());\n }\n\n void final_step(type::idx_t current_jpp, size_t , const std::vector<std::vector<Label>> &){\n departure_jpp_idx = current_jpp;\n }\n\n};\n\n\nnavitia::time_duration getWalkingTime(int count, type::idx_t jpp_idx, const std::vector<std::pair<type::idx_t, navitia::time_duration> > &departs,\n const std::vector<std::pair<type::idx_t, navitia::time_duration> > &destinations,\n bool clockwise, bool disruption_active, const type::AccessibiliteParams & accessibilite_params,\n const RAPTOR& raptor) {\n\n const auto* current_jpp = raptor.data.pt_data->journey_pattern_points[jpp_idx];\n navitia::time_duration walking_time = {};\n\n \/\/Marche à la fin\n for(auto dest_dist : destinations) {\n if(dest_dist.first == current_jpp->stop_point->idx) {\n walking_time = dest_dist.second;\n break;\n }\n }\n\n VisitorWalkingTime v;\n read_path(v, current_jpp->idx, count, !clockwise, disruption_active, accessibilite_params, raptor);\n walking_time += v.walking_time;\n if (v.departure_jpp_idx == type::invalid_idx) {\n return walking_time;\n }\n const auto* departure_jpp = raptor.data.pt_data->journey_pattern_points[v.departure_jpp_idx];\n \/\/Marche au départ\n for(auto dep_dist : departs) {\n if(dep_dist.first == departure_jpp->stop_point->idx) {\n walking_time += dep_dist.second;\n break;\n }\n }\n\n return walking_time;\n}\n\n}}\n\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"genericmaterial.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/modeling\/material\/material.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/api\/specializedapiarrays.h\"\n#include \"foundation\/utility\/containers\/dictionary.h\"\n\nusing namespace foundation;\n\nnamespace renderer\n{\n\nnamespace\n{\n \/\/\n \/\/ Generic material.\n \/\/\n\n const char* Model = \"generic_material\";\n\n class GenericMaterial\n : public Material\n {\n public:\n GenericMaterial(\n const char* name,\n const ParamArray& params)\n : Material(name, params)\n {\n m_inputs.declare(\"bsdf\", InputFormatEntity, \"\");\n m_inputs.declare(\"bssrdf\", InputFormatEntity, \"\");\n m_inputs.declare(\"edf\", InputFormatEntity, \"\");\n m_inputs.declare(\"alpha_map\", InputFormatFloat, \"\");\n m_inputs.declare(\"displacement_map\", InputFormatSpectralReflectance, \"\");\n m_inputs.declare(\"phase_function\", InputFormatEntity, \"\");\n }\n\n virtual void release() override\n {\n delete this;\n }\n\n virtual const char* get_model() const override\n {\n return Model;\n }\n\n virtual bool on_frame_begin(\n const Project& project,\n const BaseGroup* parent,\n OnFrameBeginRecorder& recorder,\n IAbortSwitch* abort_switch) override\n {\n if (!Material::on_frame_begin(project, parent, recorder, abort_switch))\n return false;\n\n const EntityDefMessageContext context(\"material\", this);\n\n m_render_data.m_bsdf = get_uncached_bsdf();\n m_render_data.m_bssrdf = get_uncached_bssrdf();\n m_render_data.m_edf = get_uncached_edf();\n m_render_data.m_phase_function = get_uncached_phase_function();\n m_render_data.m_basis_modifier = create_basis_modifier(context);\n\n if (m_render_data.m_edf && m_render_data.m_alpha_map)\n {\n RENDERER_LOG_WARNING(\n \"%s: material is emitting light but may be partially or entirely transparent; \"\n \"this may lead to unexpected or unphysical results.\",\n context.get());\n }\n\n return true;\n }\n };\n}\n\n\n\/\/\n\/\/ GenericMaterialFactory class implementation.\n\/\/\n\nconst char* GenericMaterialFactory::get_model() const\n{\n return Model;\n}\n\nDictionary GenericMaterialFactory::get_model_metadata() const\n{\n return\n Dictionary()\n .insert(\"name\", Model)\n .insert(\"label\", \"Generic Material\");\n}\n\nDictionaryArray GenericMaterialFactory::get_input_metadata() const\n{\n DictionaryArray metadata;\n\n add_surface_shader_metadata(metadata);\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"bsdf\")\n .insert(\"label\", \"BSDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"bsdf\", \"BSDF\"))\n .insert(\"use\", \"optional\"));\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"bssrdf\")\n .insert(\"label\", \"BSSRDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"bssrdf\", \"BSSRDF\"))\n .insert(\"use\", \"optional\"));\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"edf\")\n .insert(\"label\", \"EDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"edf\", \"EDF\"))\n .insert(\"use\", \"optional\"));\n\n add_alpha_map_metadata(metadata);\n add_displacement_metadata(metadata);\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"phase_function\")\n .insert(\"label\", \"Phase Function\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\",\n Dictionary().insert(\"phase_function\", \"Phase Function\"))\n .insert(\"use\", \"optional\"));\n\n return metadata;\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::create(\n const char* name,\n const ParamArray& params) const\n{\n return auto_release_ptr<Material>(new GenericMaterial(name, params));\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::static_create(\n const char* name,\n const ParamArray& params)\n{\n return auto_release_ptr<Material>(new GenericMaterial(name, params));\n}\n\n} \/\/ namespace renderer\n<commit_msg>Change position of Phase Function input of generic material<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"genericmaterial.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/modeling\/material\/material.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/api\/specializedapiarrays.h\"\n#include \"foundation\/utility\/containers\/dictionary.h\"\n\nusing namespace foundation;\n\nnamespace renderer\n{\n\nnamespace\n{\n \/\/\n \/\/ Generic material.\n \/\/\n\n const char* Model = \"generic_material\";\n\n class GenericMaterial\n : public Material\n {\n public:\n GenericMaterial(\n const char* name,\n const ParamArray& params)\n : Material(name, params)\n {\n m_inputs.declare(\"bsdf\", InputFormatEntity, \"\");\n m_inputs.declare(\"bssrdf\", InputFormatEntity, \"\");\n m_inputs.declare(\"edf\", InputFormatEntity, \"\");\n m_inputs.declare(\"alpha_map\", InputFormatFloat, \"\");\n m_inputs.declare(\"displacement_map\", InputFormatSpectralReflectance, \"\");\n m_inputs.declare(\"phase_function\", InputFormatEntity, \"\");\n }\n\n virtual void release() override\n {\n delete this;\n }\n\n virtual const char* get_model() const override\n {\n return Model;\n }\n\n virtual bool on_frame_begin(\n const Project& project,\n const BaseGroup* parent,\n OnFrameBeginRecorder& recorder,\n IAbortSwitch* abort_switch) override\n {\n if (!Material::on_frame_begin(project, parent, recorder, abort_switch))\n return false;\n\n const EntityDefMessageContext context(\"material\", this);\n\n m_render_data.m_bsdf = get_uncached_bsdf();\n m_render_data.m_bssrdf = get_uncached_bssrdf();\n m_render_data.m_edf = get_uncached_edf();\n m_render_data.m_phase_function = get_uncached_phase_function();\n m_render_data.m_basis_modifier = create_basis_modifier(context);\n\n if (m_render_data.m_edf && m_render_data.m_alpha_map)\n {\n RENDERER_LOG_WARNING(\n \"%s: material is emitting light but may be partially or entirely transparent; \"\n \"this may lead to unexpected or unphysical results.\",\n context.get());\n }\n\n return true;\n }\n };\n}\n\n\n\/\/\n\/\/ GenericMaterialFactory class implementation.\n\/\/\n\nconst char* GenericMaterialFactory::get_model() const\n{\n return Model;\n}\n\nDictionary GenericMaterialFactory::get_model_metadata() const\n{\n return\n Dictionary()\n .insert(\"name\", Model)\n .insert(\"label\", \"Generic Material\");\n}\n\nDictionaryArray GenericMaterialFactory::get_input_metadata() const\n{\n DictionaryArray metadata;\n\n add_surface_shader_metadata(metadata);\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"bsdf\")\n .insert(\"label\", \"BSDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"bsdf\", \"BSDF\"))\n .insert(\"use\", \"optional\"));\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"bssrdf\")\n .insert(\"label\", \"BSSRDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"bssrdf\", \"BSSRDF\"))\n .insert(\"use\", \"optional\"));\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"edf\")\n .insert(\"label\", \"EDF\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\", Dictionary().insert(\"edf\", \"EDF\"))\n .insert(\"use\", \"optional\"));\n\n metadata.push_back(\n Dictionary()\n .insert(\"name\", \"phase_function\")\n .insert(\"label\", \"Phase Function\")\n .insert(\"type\", \"entity\")\n .insert(\"entity_types\",\n Dictionary().insert(\"phase_function\", \"Phase Function\"))\n .insert(\"use\", \"optional\"));\n\n add_alpha_map_metadata(metadata);\n add_displacement_metadata(metadata);\n\n return metadata;\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::create(\n const char* name,\n const ParamArray& params) const\n{\n return auto_release_ptr<Material>(new GenericMaterial(name, params));\n}\n\nauto_release_ptr<Material> GenericMaterialFactory::static_create(\n const char* name,\n const ParamArray& params)\n{\n return auto_release_ptr<Material>(new GenericMaterial(name, params));\n}\n\n} \/\/ namespace renderer\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: swrect.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: kz $ $Date: 2005-01-20 14:04:31 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef PRODUCT\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#endif\n#include <stdlib.h>\n#include <math.h>\n#include \"swrect.hxx\"\n\n\n\/*************************************************************************\n|*\n|* SwRect::SwRect()\n|*\n|* Ersterstellung MA 02. Feb. 93\n|* Letzte Aenderung MA 05. Sep. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect::SwRect( const Rectangle &rRect ) :\n nX( rRect.Left() ),\n nY( rRect.Top() )\n{\n nWidth = rRect.Right() == RECT_EMPTY ? 0 :\n rRect.Right() - rRect.Left() +1;\n nHeight = rRect.Bottom() == RECT_EMPTY ? 0 :\n rRect.Bottom() - rRect.Top() + 1;\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Center()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\nPoint SwRect::Center() const\n{\n return Point( Left() + Width() \/ 2,\n Top() + Height() \/ 2 );\n\n\/* Wer ruft schon ein Center auf ein \"falsches\" Rechteck?\n const long nRight = Right();\n const long nBottom= Bottom();\n return Point( min( Left(), nRight ) + long(abs( (nRight - Left())\/2) ),\n min( Top(), nBottom) + long(abs( (nBottom - Top())\/2)));\n*\/\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Union()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect& SwRect::Union( const SwRect& rRect )\n{\n if ( Top() > rRect.Top() )\n Top( rRect.Top() );\n if ( Left() > rRect.Left() )\n Left( rRect.Left() );\n register long n = rRect.Right();\n if ( Right() < n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() < n )\n Bottom( n );\n return *this;\n}\n\/*************************************************************************\n|*\n|* SwRect::Intersection(), _Intersection()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 05. Sep. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect& SwRect::Intersection( const SwRect& rRect )\n{\n \/\/Hat das Teil ueberhaupt Gemeinsamkeiten mit mir?\n if ( IsOver( rRect ) )\n {\n \/\/Bestimmung der kleineren rechten sowie unteren und\n \/\/ der groesseren linken sowie oberen Kante.\n if ( Left() < rRect.Left() )\n Left( rRect.Left() );\n if ( Top() < rRect.Top() )\n Top( rRect.Top() );\n register long n = rRect.Right();\n if ( Right() > n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() > n )\n Bottom( n );\n }\n else\n \/\/Def.: Bei einer leeren Intersection wird nur die SSize genullt.\n nHeight = nWidth = 0;\n\n return *this;\n}\n\n\n\nSwRect& SwRect::_Intersection( const SwRect& rRect )\n{\n \/\/Bestimmung der kleineren rechten sowie unteren und\n \/\/ der groesseren linken sowie oberen Kante.\n if ( Left() < rRect.Left() )\n Left( rRect.Left() );\n if ( Top() < rRect.Top() )\n Top( rRect.Top() );\n register long n = rRect.Right();\n if ( Right() > n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() > n )\n Bottom( n );\n\n return *this;\n}\n\/*************************************************************************\n|*\n|* SwRect::IsInside()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\n\n\n\nBOOL SwRect::IsInside( const SwRect& rRect ) const\n{\n const long nRight = Right();\n const long nBottom = Bottom();\n const long nrRight = rRect.Right();\n const long nrBottom= rRect.Bottom();\n return (Left() <= rRect.Left()) && (rRect.Left()<= nRight) &&\n (Left() <= nrRight) && (nrRight <= nRight) &&\n (Top() <= rRect.Top()) && (rRect.Top() <= nBottom) &&\n (Top() <= nrBottom) && (nrBottom <= nBottom);\n}\n\n\n\nBOOL SwRect::IsInside( const Point& rPoint ) const\n{\n return (Left() <= rPoint.X())\n && (Top() <= rPoint.Y())\n && (Right() >= rPoint.X())\n && (Bottom()>= rPoint.Y());\n}\n\/* -----------------------------11.04.00 15:46--------------------------------\n mouse moving of table borders\n ---------------------------------------------------------------------------*\/\nBOOL SwRect::IsNear( const Point& rPoint, long nTolerance ) const\n{\n return IsInside(rPoint) ||\n (((Left() - nTolerance) <= rPoint.X())\n && ((Top() - nTolerance) <= rPoint.Y())\n && ((Right() + nTolerance) >= rPoint.X())\n && ((Bottom() + nTolerance)>= rPoint.Y()));\n}\n\n\/*************************************************************************\n|*\n|* SwRect::IsOver()\n|*\n|* Ersterstellung MA 25. Feb. 94\n|* Letzte Aenderung MA 27. Jun. 96\n|*\n|*************************************************************************\/\n\n\n\nBOOL SwRect::IsOver( const SwRect& rRect ) const\n{\n return (Top() <= rRect.Bottom())\n && (Left() <= rRect.Right())\n && (Right() >= rRect.Left())\n && (Bottom()>= rRect.Top()) ? TRUE : FALSE;\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Justify()\n|*\n|* Ersterstellung MA 10. Oct. 94\n|* Letzte Aenderung MA 23. Oct. 96\n|*\n|*************************************************************************\/\n\n\n\nvoid SwRect::Justify()\n{\n if ( nHeight < 0 )\n {\n nY = nY + nHeight + 1;\n nHeight = -nHeight;\n }\n if ( nWidth < 0 )\n {\n nX = nX + nWidth + 1;\n nWidth = -nWidth;\n }\n}\n\n\/*************************************************************************\n|*\n|* SwRect::GetDistance()\n|*\n|* Ersterstellung MB 24. Mov. 04\n|*\n|*************************************************************************\/\n\nfloat SwRect::GetDistance( const Point &rPOINT, Point rClosest ) const {\n\n \/\/ 2d intervall or rectangle area\n const long fXMin = Left();\n const long fXMax = Right();\n const long fYMin = Top();\n const long fYMax = Bottom();\n\n float fSqrDistance = 0.0f;\n rClosest = rPOINT;\n\n \/\/ A point is in the box whenever xmin <= x <= xmax and\n \/\/ ymin <= y <= ymax and zmin <= z <= zmax.\n if(!(IsInside(rPOINT))) {\n\n if(rPOINT.X() < fXMin) {\n long fDelta = rPOINT.X() - fXMin;\n fSqrDistance += fDelta*fDelta;\n rClosest.X() = fXMin;\n }\n else if(rPOINT.X() > fXMax) {\n long fDelta = rPOINT.X() - fXMax;\n fSqrDistance += fDelta*fDelta;\n rClosest.X() = fXMax;\n }\n else {\n rClosest.X() = rPOINT.X();\n }\n\n if(rPOINT.Y() < fYMin ) {\n long fDelta = rPOINT.Y() - fYMin;\n fSqrDistance += fDelta*fDelta;\n rClosest.Y() = fYMin;\n }\n else if(rPOINT.Y() > fYMax) {\n long fDelta = rPOINT.Y() - fYMax;\n fSqrDistance += fDelta*fDelta;\n rClosest.Y() = fYMax;\n }\n else {\n rClosest.Y() = rPOINT.Y();\n }\n }\n\n return sqrt(fSqrDistance);\n}\n\n\n#ifdef VERTICAL_LAYOUT\n\n\/\/ Similiar to the inline methods, but we need the function pointers\n\nvoid SwRect::_Width( const long nNew ) { nWidth = nNew; }\nvoid SwRect::_Height( const long nNew ) { nHeight = nNew; }\nvoid SwRect::_Left( const long nLeft ){ nWidth += nX - nLeft; nX = nLeft; }\nvoid SwRect::_Right( const long nRight ){ nWidth = nRight - nX; }\nvoid SwRect::_Top( const long nTop ){ nHeight += nY - nTop; nY = nTop; }\nvoid SwRect::_Bottom( const long nBottom ){ nHeight = nBottom - nY; }\n\nlong SwRect::_Width() const{ return nWidth; }\nlong SwRect::_Height() const{ return nHeight; }\nlong SwRect::_Left() const{ return nX; }\nlong SwRect::_Right() const{ return nX + nWidth; }\nlong SwRect::_Top() const{ return nY; }\nlong SwRect::_Bottom() const{ return nY + nHeight; }\n\nvoid SwRect::AddWidth( const long nAdd ) { nWidth += nAdd; }\nvoid SwRect::AddHeight( const long nAdd ) { nHeight += nAdd; }\nvoid SwRect::SubLeft( const long nSub ){ nWidth += nSub; nX -= nSub; }\nvoid SwRect::AddRight( const long nAdd ){ nWidth += nAdd; }\nvoid SwRect::SubTop( const long nSub ){ nHeight += nSub; nY -= nSub; }\nvoid SwRect::AddBottom( const long nAdd ){ nHeight += nAdd; }\nvoid SwRect::SetPosX( const long nNew ){ nX = nNew; }\nvoid SwRect::SetPosY( const long nNew ){ nY = nNew; }\nconst Point SwRect::_Pos() const { return Pos(); }\nconst Size SwRect::_Size() const { return SSize(); }\nconst Point SwRect::SwappedPos() const { return Point( nY, nX ); }\nconst Size SwRect::SwappedSize() const { return Size( nHeight, nWidth ); }\nconst Point SwRect::TopLeft() const { return Pos(); }\nconst Point SwRect::TopRight() const { return Point( nX + nWidth, nY ); }\nconst Point SwRect::BottomLeft() const { return Point( nX, nY + nHeight ); }\nconst Point SwRect::BottomRight() const\n { return Point( nX + nWidth, nY + nHeight ); }\nlong SwRect::GetLeftDistance( long nLimit ) const { return nX - nLimit; }\nlong SwRect::GetBottomDistance( long nLim ) const { return nLim - nY - nHeight;}\nlong SwRect::GetTopDistance( long nLimit ) const { return nY - nLimit; }\nlong SwRect::GetRightDistance( long nLim ) const { return nLim - nX - nWidth; }\nBOOL SwRect::OverStepLeft( long nLimit ) const\n { return nLimit > nX && nX + nWidth > nLimit; }\nBOOL SwRect::OverStepBottom( long nLimit ) const\n { return nLimit > nY && nY + nHeight > nLimit; }\nBOOL SwRect::OverStepTop( long nLimit ) const\n { return nLimit > nY && nY + nHeight > nLimit; }\nBOOL SwRect::OverStepRight( long nLimit ) const\n { return nLimit > nX && nX + nWidth > nLimit; }\nvoid SwRect::SetLeftAndWidth( long nLeft, long nNew )\n { nX = nLeft; nWidth = nNew; }\nvoid SwRect::SetTopAndHeight( long nTop, long nNew )\n { nY = nTop; nHeight = nNew; }\nvoid SwRect::SetRightAndWidth( long nRight, long nNew )\n { nX = nRight - nNew; nWidth = nNew; }\nvoid SwRect::SetBottomAndHeight( long nBottom, long nNew )\n { nY = nBottom - nNew; nHeight = nNew; }\nvoid SwRect::SetUpperLeftCorner( const Point& rNew )\n { nX = rNew.nA; nY = rNew.nB; }\nvoid SwRect::SetUpperRightCorner( const Point& rNew )\n { nX = rNew.nA - nWidth; nY = rNew.nB; }\nvoid SwRect::SetLowerLeftCorner( const Point& rNew )\n { nX = rNew.nA; nY = rNew.nB - nHeight; }\nvoid SwRect::SetLowerRightCorner( const Point& rNew )\n { nX = rNew.nA - nWidth; nY = rNew.nB - nHeight; }\n#endif\n\n#ifndef PRODUCT\n\/*************************************************************************\n * operator<<( ostream&, SwRect&)\n *************************************************************************\/\n\n\n\nSvStream &operator<<( SvStream &rStream, const SwRect &rRect )\n{\n rStream << '[' << rRect.Top() << '\/' << rRect.Left()\n << ',' << rRect.Width() << 'x' << rRect.Height() << \"] \";\n return rStream;\n}\n#endif\n\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.12.378); FILE MERGED 2005\/09\/05 13:38:42 rt 1.12.378.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: swrect.cxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 03:01:24 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef PRODUCT\n#ifndef _STREAM_HXX \/\/autogen\n#include <tools\/stream.hxx>\n#endif\n#endif\n#include <stdlib.h>\n#include <math.h>\n#include \"swrect.hxx\"\n\n\n\/*************************************************************************\n|*\n|* SwRect::SwRect()\n|*\n|* Ersterstellung MA 02. Feb. 93\n|* Letzte Aenderung MA 05. Sep. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect::SwRect( const Rectangle &rRect ) :\n nX( rRect.Left() ),\n nY( rRect.Top() )\n{\n nWidth = rRect.Right() == RECT_EMPTY ? 0 :\n rRect.Right() - rRect.Left() +1;\n nHeight = rRect.Bottom() == RECT_EMPTY ? 0 :\n rRect.Bottom() - rRect.Top() + 1;\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Center()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\nPoint SwRect::Center() const\n{\n return Point( Left() + Width() \/ 2,\n Top() + Height() \/ 2 );\n\n\/* Wer ruft schon ein Center auf ein \"falsches\" Rechteck?\n const long nRight = Right();\n const long nBottom= Bottom();\n return Point( min( Left(), nRight ) + long(abs( (nRight - Left())\/2) ),\n min( Top(), nBottom) + long(abs( (nBottom - Top())\/2)));\n*\/\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Union()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect& SwRect::Union( const SwRect& rRect )\n{\n if ( Top() > rRect.Top() )\n Top( rRect.Top() );\n if ( Left() > rRect.Left() )\n Left( rRect.Left() );\n register long n = rRect.Right();\n if ( Right() < n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() < n )\n Bottom( n );\n return *this;\n}\n\/*************************************************************************\n|*\n|* SwRect::Intersection(), _Intersection()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 05. Sep. 93\n|*\n|*************************************************************************\/\n\n\n\nSwRect& SwRect::Intersection( const SwRect& rRect )\n{\n \/\/Hat das Teil ueberhaupt Gemeinsamkeiten mit mir?\n if ( IsOver( rRect ) )\n {\n \/\/Bestimmung der kleineren rechten sowie unteren und\n \/\/ der groesseren linken sowie oberen Kante.\n if ( Left() < rRect.Left() )\n Left( rRect.Left() );\n if ( Top() < rRect.Top() )\n Top( rRect.Top() );\n register long n = rRect.Right();\n if ( Right() > n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() > n )\n Bottom( n );\n }\n else\n \/\/Def.: Bei einer leeren Intersection wird nur die SSize genullt.\n nHeight = nWidth = 0;\n\n return *this;\n}\n\n\n\nSwRect& SwRect::_Intersection( const SwRect& rRect )\n{\n \/\/Bestimmung der kleineren rechten sowie unteren und\n \/\/ der groesseren linken sowie oberen Kante.\n if ( Left() < rRect.Left() )\n Left( rRect.Left() );\n if ( Top() < rRect.Top() )\n Top( rRect.Top() );\n register long n = rRect.Right();\n if ( Right() > n )\n Right( n );\n n = rRect.Bottom();\n if ( Bottom() > n )\n Bottom( n );\n\n return *this;\n}\n\/*************************************************************************\n|*\n|* SwRect::IsInside()\n|*\n|* Ersterstellung MA 27. Jan. 93\n|* Letzte Aenderung MA 27. Jan. 93\n|*\n|*************************************************************************\/\n\n\n\nBOOL SwRect::IsInside( const SwRect& rRect ) const\n{\n const long nRight = Right();\n const long nBottom = Bottom();\n const long nrRight = rRect.Right();\n const long nrBottom= rRect.Bottom();\n return (Left() <= rRect.Left()) && (rRect.Left()<= nRight) &&\n (Left() <= nrRight) && (nrRight <= nRight) &&\n (Top() <= rRect.Top()) && (rRect.Top() <= nBottom) &&\n (Top() <= nrBottom) && (nrBottom <= nBottom);\n}\n\n\n\nBOOL SwRect::IsInside( const Point& rPoint ) const\n{\n return (Left() <= rPoint.X())\n && (Top() <= rPoint.Y())\n && (Right() >= rPoint.X())\n && (Bottom()>= rPoint.Y());\n}\n\/* -----------------------------11.04.00 15:46--------------------------------\n mouse moving of table borders\n ---------------------------------------------------------------------------*\/\nBOOL SwRect::IsNear( const Point& rPoint, long nTolerance ) const\n{\n return IsInside(rPoint) ||\n (((Left() - nTolerance) <= rPoint.X())\n && ((Top() - nTolerance) <= rPoint.Y())\n && ((Right() + nTolerance) >= rPoint.X())\n && ((Bottom() + nTolerance)>= rPoint.Y()));\n}\n\n\/*************************************************************************\n|*\n|* SwRect::IsOver()\n|*\n|* Ersterstellung MA 25. Feb. 94\n|* Letzte Aenderung MA 27. Jun. 96\n|*\n|*************************************************************************\/\n\n\n\nBOOL SwRect::IsOver( const SwRect& rRect ) const\n{\n return (Top() <= rRect.Bottom())\n && (Left() <= rRect.Right())\n && (Right() >= rRect.Left())\n && (Bottom()>= rRect.Top()) ? TRUE : FALSE;\n}\n\n\/*************************************************************************\n|*\n|* SwRect::Justify()\n|*\n|* Ersterstellung MA 10. Oct. 94\n|* Letzte Aenderung MA 23. Oct. 96\n|*\n|*************************************************************************\/\n\n\n\nvoid SwRect::Justify()\n{\n if ( nHeight < 0 )\n {\n nY = nY + nHeight + 1;\n nHeight = -nHeight;\n }\n if ( nWidth < 0 )\n {\n nX = nX + nWidth + 1;\n nWidth = -nWidth;\n }\n}\n\n\/*************************************************************************\n|*\n|* SwRect::GetDistance()\n|*\n|* Ersterstellung MB 24. Mov. 04\n|*\n|*************************************************************************\/\n\nfloat SwRect::GetDistance( const Point &rPOINT, Point rClosest ) const {\n\n \/\/ 2d intervall or rectangle area\n const long fXMin = Left();\n const long fXMax = Right();\n const long fYMin = Top();\n const long fYMax = Bottom();\n\n float fSqrDistance = 0.0f;\n rClosest = rPOINT;\n\n \/\/ A point is in the box whenever xmin <= x <= xmax and\n \/\/ ymin <= y <= ymax and zmin <= z <= zmax.\n if(!(IsInside(rPOINT))) {\n\n if(rPOINT.X() < fXMin) {\n long fDelta = rPOINT.X() - fXMin;\n fSqrDistance += fDelta*fDelta;\n rClosest.X() = fXMin;\n }\n else if(rPOINT.X() > fXMax) {\n long fDelta = rPOINT.X() - fXMax;\n fSqrDistance += fDelta*fDelta;\n rClosest.X() = fXMax;\n }\n else {\n rClosest.X() = rPOINT.X();\n }\n\n if(rPOINT.Y() < fYMin ) {\n long fDelta = rPOINT.Y() - fYMin;\n fSqrDistance += fDelta*fDelta;\n rClosest.Y() = fYMin;\n }\n else if(rPOINT.Y() > fYMax) {\n long fDelta = rPOINT.Y() - fYMax;\n fSqrDistance += fDelta*fDelta;\n rClosest.Y() = fYMax;\n }\n else {\n rClosest.Y() = rPOINT.Y();\n }\n }\n\n return sqrt(fSqrDistance);\n}\n\n\n#ifdef VERTICAL_LAYOUT\n\n\/\/ Similiar to the inline methods, but we need the function pointers\n\nvoid SwRect::_Width( const long nNew ) { nWidth = nNew; }\nvoid SwRect::_Height( const long nNew ) { nHeight = nNew; }\nvoid SwRect::_Left( const long nLeft ){ nWidth += nX - nLeft; nX = nLeft; }\nvoid SwRect::_Right( const long nRight ){ nWidth = nRight - nX; }\nvoid SwRect::_Top( const long nTop ){ nHeight += nY - nTop; nY = nTop; }\nvoid SwRect::_Bottom( const long nBottom ){ nHeight = nBottom - nY; }\n\nlong SwRect::_Width() const{ return nWidth; }\nlong SwRect::_Height() const{ return nHeight; }\nlong SwRect::_Left() const{ return nX; }\nlong SwRect::_Right() const{ return nX + nWidth; }\nlong SwRect::_Top() const{ return nY; }\nlong SwRect::_Bottom() const{ return nY + nHeight; }\n\nvoid SwRect::AddWidth( const long nAdd ) { nWidth += nAdd; }\nvoid SwRect::AddHeight( const long nAdd ) { nHeight += nAdd; }\nvoid SwRect::SubLeft( const long nSub ){ nWidth += nSub; nX -= nSub; }\nvoid SwRect::AddRight( const long nAdd ){ nWidth += nAdd; }\nvoid SwRect::SubTop( const long nSub ){ nHeight += nSub; nY -= nSub; }\nvoid SwRect::AddBottom( const long nAdd ){ nHeight += nAdd; }\nvoid SwRect::SetPosX( const long nNew ){ nX = nNew; }\nvoid SwRect::SetPosY( const long nNew ){ nY = nNew; }\nconst Point SwRect::_Pos() const { return Pos(); }\nconst Size SwRect::_Size() const { return SSize(); }\nconst Point SwRect::SwappedPos() const { return Point( nY, nX ); }\nconst Size SwRect::SwappedSize() const { return Size( nHeight, nWidth ); }\nconst Point SwRect::TopLeft() const { return Pos(); }\nconst Point SwRect::TopRight() const { return Point( nX + nWidth, nY ); }\nconst Point SwRect::BottomLeft() const { return Point( nX, nY + nHeight ); }\nconst Point SwRect::BottomRight() const\n { return Point( nX + nWidth, nY + nHeight ); }\nlong SwRect::GetLeftDistance( long nLimit ) const { return nX - nLimit; }\nlong SwRect::GetBottomDistance( long nLim ) const { return nLim - nY - nHeight;}\nlong SwRect::GetTopDistance( long nLimit ) const { return nY - nLimit; }\nlong SwRect::GetRightDistance( long nLim ) const { return nLim - nX - nWidth; }\nBOOL SwRect::OverStepLeft( long nLimit ) const\n { return nLimit > nX && nX + nWidth > nLimit; }\nBOOL SwRect::OverStepBottom( long nLimit ) const\n { return nLimit > nY && nY + nHeight > nLimit; }\nBOOL SwRect::OverStepTop( long nLimit ) const\n { return nLimit > nY && nY + nHeight > nLimit; }\nBOOL SwRect::OverStepRight( long nLimit ) const\n { return nLimit > nX && nX + nWidth > nLimit; }\nvoid SwRect::SetLeftAndWidth( long nLeft, long nNew )\n { nX = nLeft; nWidth = nNew; }\nvoid SwRect::SetTopAndHeight( long nTop, long nNew )\n { nY = nTop; nHeight = nNew; }\nvoid SwRect::SetRightAndWidth( long nRight, long nNew )\n { nX = nRight - nNew; nWidth = nNew; }\nvoid SwRect::SetBottomAndHeight( long nBottom, long nNew )\n { nY = nBottom - nNew; nHeight = nNew; }\nvoid SwRect::SetUpperLeftCorner( const Point& rNew )\n { nX = rNew.nA; nY = rNew.nB; }\nvoid SwRect::SetUpperRightCorner( const Point& rNew )\n { nX = rNew.nA - nWidth; nY = rNew.nB; }\nvoid SwRect::SetLowerLeftCorner( const Point& rNew )\n { nX = rNew.nA; nY = rNew.nB - nHeight; }\nvoid SwRect::SetLowerRightCorner( const Point& rNew )\n { nX = rNew.nA - nWidth; nY = rNew.nB - nHeight; }\n#endif\n\n#ifndef PRODUCT\n\/*************************************************************************\n * operator<<( ostream&, SwRect&)\n *************************************************************************\/\n\n\n\nSvStream &operator<<( SvStream &rStream, const SwRect &rRect )\n{\n rStream << '[' << rRect.Top() << '\/' << rRect.Left()\n << ',' << rRect.Width() << 'x' << rRect.Height() << \"] \";\n return rStream;\n}\n#endif\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Vulkan: fix bad depth clears.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>gui: viewer clang format names<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ ulib - a collection of useful classes\n\/\/ Copyright (C) 2004,2005,2006,2007,2008,2018,2020 Michael Fink\n\/\/\n\/\/\/ \\file VersionInfoResource.cpp version info resource class\n\/\/\n#include \"stdafx.h\"\n#include <ulib\/win32\/VersionInfoResource.hpp>\n#include <WinBase.h> \/\/ for VOS_* constants\n#include <winver.h> \/\/ for VOS_* constants, when not in winbase.h\n\n#ifndef VOS_WINDOWSCE\n# define VOS_WINDOWSCE 0x00050000L\n#endif\n\n#ifndef _WIN32_WCE\n# pragma comment(lib, \"version.lib\")\n#endif\n\nusing Win32::FixedFileInfo;\nusing Win32::VersionInfoResource;\nusing Win32::LANGANDCODEPAGE;\n\n\/\/\n\/\/ FixedFileInfo\n\/\/\n\nCString FixedFileInfo::GetFileVersion() const\n{\n CString text;\n text.Format(_T(\"%u.%u.%u.%u\"),\n HIWORD(dwFileVersionMS), LOWORD(dwFileVersionMS),\n HIWORD(dwFileVersionLS), LOWORD(dwFileVersionLS));\n return text;\n}\n\nCString FixedFileInfo::GetProductVersion() const\n{\n CString text;\n text.Format(_T(\"%u.%u.%u.%u\"),\n HIWORD(dwProductVersionMS), LOWORD(dwProductVersionMS),\n HIWORD(dwProductVersionLS), LOWORD(dwProductVersionLS));\n return text;\n}\n\nCString FixedFileInfo::GetFileOS() const\n{\n CString text;\n\n switch (dwFileOS & 0xFFFF0000)\n {\n case VOS_DOS: \/\/ The file was designed for MS-DOS.\n text = _T(\"VOS_DOS\"); break;\n case VOS_OS216: \/\/ The file was designed for 16-bit OS\/2.\n text = _T(\"VOS_OS216\"); break;\n case VOS_OS232: \/\/ The file was designed for 32-bit OS\/2.\n text = _T(\"VOS_OS232\"); break;\n case VOS_NT: \/\/ The file was designed for Windows NT and Windows 2000.\n text = _T(\"VOS_NT\"); break;\n case VOS_WINDOWSCE:\n text = _T(\"VOS_WINDOWSCE\"); break;\n case VOS_UNKNOWN:\n text = _T(\"VOS_UNKNOWN\"); break;\n default:\n text = _T(\"unknown\"); break;\n }\n\n switch (dwFileOS & 0x0000FFFF)\n {\n case VOS__WINDOWS16: \/\/ The file was designed for 16-bit Windows.\n text += _T(\" | VOS__WINDOWS16\"); break;\n case VOS__PM16: \/\/ The file was designed for 16-bit Presentation Manager.\n text += _T(\" | VOS__PM16\"); break;\n case VOS__PM32: \/\/ The file was designed for 32-bit Presentation Manager.\n text += _T(\" | VOS__PM32\"); break;\n case VOS__WINDOWS32: \/\/ The file was designed for the Win32 API.\n text += _T(\" | VOS__WINDOWS32\"); break;\n }\n\n return text;\n}\n\nCString FixedFileInfo::GetFileType() const\n{\n CString text;\n switch (dwFileType)\n {\n case VFT_UNKNOWN:\n text = _T(\"VFT_UNKNOWN\"); break;\n case VFT_APP:\n text = _T(\"VFT_APP\"); break;\n case VFT_DLL:\n text = _T(\"VFT_DLL\"); break;\n case VFT_DRV:\n text = _T(\"VFT_DRV\"); break;\n case VFT_FONT:\n text = _T(\"VFT_FONT\"); break;\n case VFT_VXD:\n text = _T(\"VFT_VXD\"); break;\n case VFT_STATIC_LIB:\n text = _T(\"VFT_STATIC_LIB\"); break;\n default:\n text = _T(\"unknown\"); break;\n }\n return text;\n}\n\n\/\/\n\/\/ VersionInfoResource\n\/\/\n\nVersionInfoResource::VersionInfoResource(LPCTSTR filename)\n{\n \/\/ find out length\n DWORD dummy = 0;\n DWORD dwLen = ::GetFileVersionInfoSize(filename, &dummy);\n\n if (dwLen > 0)\n {\n m_versionInfoData.resize(dwLen);\n\n \/\/ get version info\n ::GetFileVersionInfo(filename, 0, dwLen, &m_versionInfoData[0]);\n }\n}\n\nLPVOID VersionInfoResource::QueryValue(LPCTSTR subBlock, UINT* puiSize)\n{\n ATLASSERT(IsAvail());\n\n LPVOID data = NULL;\n UINT uiSize = 0;\n\n BOOL ret = VerQueryValue(&m_versionInfoData[0],\n subBlock,\n &data,\n puiSize != NULL ? puiSize : &uiSize);\n\n return ret == FALSE ? NULL : data;\n}\n\nvoid VersionInfoResource::GetLangAndCodepages(std::vector<LANGANDCODEPAGE>& langAndCodepageList)\n{\n ATLASSERT(IsAvail());\n\n UINT size = 0;\n LPCVOID data = QueryValue(_T(\"\\\\VarFileInfo\\\\Translation\"), &size);\n\n ATLASSERT((size % sizeof(LANGANDCODEPAGE)) == 0);\n\n const LANGANDCODEPAGE* langAndCodepage = reinterpret_cast<const LANGANDCODEPAGE*>(data);\n\n for (unsigned int i = 0; i < size \/ sizeof(LANGANDCODEPAGE); i++)\n langAndCodepageList.push_back(langAndCodepage[i]);\n}\n\nCString VersionInfoResource::GetStringValue(const LANGANDCODEPAGE& langAndCodepage, LPCTSTR valueName)\n{\n CString buffer;\n buffer.Format(\n _T(\"\\\\StringFileInfo\\\\%04x%04x\\\\%s\"),\n langAndCodepage.wLanguage, langAndCodepage.wCodePage,\n valueName);\n\n UINT size = 0;\n LPCWSTR text = reinterpret_cast<LPCWSTR>(QueryValue(buffer, &size));\n\n ATLASSERT(size == 0 || text[size - 1] == 0);\n\n return (text == NULL || *text == 0) ? CString(_T(\"???\")) : CString(text);\n}\n<commit_msg>added default case for switch statement<commit_after>\/\/\n\/\/ ulib - a collection of useful classes\n\/\/ Copyright (C) 2004,2005,2006,2007,2008,2018,2020 Michael Fink\n\/\/\n\/\/\/ \\file VersionInfoResource.cpp version info resource class\n\/\/\n#include \"stdafx.h\"\n#include <ulib\/win32\/VersionInfoResource.hpp>\n#include <WinBase.h> \/\/ for VOS_* constants\n#include <winver.h> \/\/ for VOS_* constants, when not in winbase.h\n\n#ifndef VOS_WINDOWSCE\n# define VOS_WINDOWSCE 0x00050000L\n#endif\n\n#ifndef _WIN32_WCE\n# pragma comment(lib, \"version.lib\")\n#endif\n\nusing Win32::FixedFileInfo;\nusing Win32::VersionInfoResource;\nusing Win32::LANGANDCODEPAGE;\n\n\/\/\n\/\/ FixedFileInfo\n\/\/\n\nCString FixedFileInfo::GetFileVersion() const\n{\n CString text;\n text.Format(_T(\"%u.%u.%u.%u\"),\n HIWORD(dwFileVersionMS), LOWORD(dwFileVersionMS),\n HIWORD(dwFileVersionLS), LOWORD(dwFileVersionLS));\n return text;\n}\n\nCString FixedFileInfo::GetProductVersion() const\n{\n CString text;\n text.Format(_T(\"%u.%u.%u.%u\"),\n HIWORD(dwProductVersionMS), LOWORD(dwProductVersionMS),\n HIWORD(dwProductVersionLS), LOWORD(dwProductVersionLS));\n return text;\n}\n\nCString FixedFileInfo::GetFileOS() const\n{\n CString text;\n\n switch (dwFileOS & 0xFFFF0000)\n {\n case VOS_DOS: \/\/ The file was designed for MS-DOS.\n text = _T(\"VOS_DOS\"); break;\n case VOS_OS216: \/\/ The file was designed for 16-bit OS\/2.\n text = _T(\"VOS_OS216\"); break;\n case VOS_OS232: \/\/ The file was designed for 32-bit OS\/2.\n text = _T(\"VOS_OS232\"); break;\n case VOS_NT: \/\/ The file was designed for Windows NT and Windows 2000.\n text = _T(\"VOS_NT\"); break;\n case VOS_WINDOWSCE:\n text = _T(\"VOS_WINDOWSCE\"); break;\n case VOS_UNKNOWN:\n text = _T(\"VOS_UNKNOWN\"); break;\n default:\n text = _T(\"unknown\"); break;\n }\n\n switch (dwFileOS & 0x0000FFFF)\n {\n case VOS__WINDOWS16: \/\/ The file was designed for 16-bit Windows.\n text += _T(\" | VOS__WINDOWS16\"); break;\n case VOS__PM16: \/\/ The file was designed for 16-bit Presentation Manager.\n text += _T(\" | VOS__PM16\"); break;\n case VOS__PM32: \/\/ The file was designed for 32-bit Presentation Manager.\n text += _T(\" | VOS__PM32\"); break;\n case VOS__WINDOWS32: \/\/ The file was designed for the Win32 API.\n text += _T(\" | VOS__WINDOWS32\"); break;\n default:\n text.AppendFormat(_T(\" | 0x%04x\"), dwFileOS & 0x0000FFFF); break;\n }\n\n return text;\n}\n\nCString FixedFileInfo::GetFileType() const\n{\n CString text;\n switch (dwFileType)\n {\n case VFT_UNKNOWN:\n text = _T(\"VFT_UNKNOWN\"); break;\n case VFT_APP:\n text = _T(\"VFT_APP\"); break;\n case VFT_DLL:\n text = _T(\"VFT_DLL\"); break;\n case VFT_DRV:\n text = _T(\"VFT_DRV\"); break;\n case VFT_FONT:\n text = _T(\"VFT_FONT\"); break;\n case VFT_VXD:\n text = _T(\"VFT_VXD\"); break;\n case VFT_STATIC_LIB:\n text = _T(\"VFT_STATIC_LIB\"); break;\n default:\n text = _T(\"unknown\"); break;\n }\n return text;\n}\n\n\/\/\n\/\/ VersionInfoResource\n\/\/\n\nVersionInfoResource::VersionInfoResource(LPCTSTR filename)\n{\n \/\/ find out length\n DWORD dummy = 0;\n DWORD dwLen = ::GetFileVersionInfoSize(filename, &dummy);\n\n if (dwLen > 0)\n {\n m_versionInfoData.resize(dwLen);\n\n \/\/ get version info\n ::GetFileVersionInfo(filename, 0, dwLen, &m_versionInfoData[0]);\n }\n}\n\nLPVOID VersionInfoResource::QueryValue(LPCTSTR subBlock, UINT* puiSize)\n{\n ATLASSERT(IsAvail());\n\n LPVOID data = NULL;\n UINT uiSize = 0;\n\n BOOL ret = VerQueryValue(&m_versionInfoData[0],\n subBlock,\n &data,\n puiSize != NULL ? puiSize : &uiSize);\n\n return ret == FALSE ? NULL : data;\n}\n\nvoid VersionInfoResource::GetLangAndCodepages(std::vector<LANGANDCODEPAGE>& langAndCodepageList)\n{\n ATLASSERT(IsAvail());\n\n UINT size = 0;\n LPCVOID data = QueryValue(_T(\"\\\\VarFileInfo\\\\Translation\"), &size);\n\n ATLASSERT((size % sizeof(LANGANDCODEPAGE)) == 0);\n\n const LANGANDCODEPAGE* langAndCodepage = reinterpret_cast<const LANGANDCODEPAGE*>(data);\n\n for (unsigned int i = 0; i < size \/ sizeof(LANGANDCODEPAGE); i++)\n langAndCodepageList.push_back(langAndCodepage[i]);\n}\n\nCString VersionInfoResource::GetStringValue(const LANGANDCODEPAGE& langAndCodepage, LPCTSTR valueName)\n{\n CString buffer;\n buffer.Format(\n _T(\"\\\\StringFileInfo\\\\%04x%04x\\\\%s\"),\n langAndCodepage.wLanguage, langAndCodepage.wCodePage,\n valueName);\n\n UINT size = 0;\n LPCWSTR text = reinterpret_cast<LPCWSTR>(QueryValue(buffer, &size));\n\n ATLASSERT(size == 0 || text[size - 1] == 0);\n\n return (text == NULL || *text == 0) ? CString(_T(\"???\")) : CString(text);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ndnum.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: obo $ $Date: 2004-08-12 12:20:01 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef _NODE_HXX\n#include <node.hxx>\n#endif\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _NDTXT_HXX\n#include <ndtxt.hxx>\n#endif\n#ifndef _NUMRULE_HXX\n#include <numrule.hxx>\n#endif\n#ifndef _FLDBAS_HXX\n#include <fldbas.hxx> \/\/ UpdateFlds der KapitelNummerierung\n#endif\n\n\n_SV_IMPL_SORTAR_ALG( SwOutlineNodes, SwNodePtr )\nBOOL SwOutlineNodes::Seek_Entry( const SwNodePtr rSrch, USHORT* pFndPos ) const\n{\n ULONG nIdx = rSrch->GetIndex();\n\n register USHORT nO = Count(), nM, nU = 0;\n if( nO > 0 )\n {\n\/\/JP 17.03.98: aufgrund des Bug 48592 - wo unter anderem nach Undo\/Redo\n\/\/ Nodes aus dem falschen NodesArray im OutlineArray standen,\n\/\/ jetzt mal einen Check eingebaut.\n#ifndef PRODUCT\n {\n for( register USHORT n = 1; n < nO; ++n )\n if( &(*this)[ n-1 ]->GetNodes() !=\n &(*this)[ n ]->GetNodes() )\n {\n ASSERT( !this, \"Node im falschen Outline-Array\" );\n }\n }\n#endif\n\n nO--;\n while( nU <= nO )\n {\n nM = nU + ( nO - nU ) \/ 2;\n if( (*this)[ nM ] == rSrch )\n {\n if( pFndPos )\n *pFndPos = nM;\n return TRUE;\n }\n else if( (*this)[ nM ]->GetIndex() < nIdx )\n nU = nM + 1;\n else if( nM == 0 )\n {\n if( pFndPos )\n *pFndPos = nU;\n return FALSE;\n }\n else\n nO = nM - 1;\n }\n }\n if( pFndPos )\n *pFndPos = nU;\n return FALSE;\n}\n\nvoid SwNodes::UpdateOutlineNode( const SwNode& rNd, BYTE nOldLevel,\n BYTE nNewLevel )\n{\n const SwNodePtr pSrch = (SwNodePtr)&rNd;\n USHORT nSttPos;\n BOOL bSeekIdx = pOutlineNds->Seek_Entry( pSrch, &nSttPos );\n\n if( NO_NUMBERING == nOldLevel ) \/\/ neuen Level einfuegen\n {\n \/\/ nicht vorhanden, also einfuegen\n ASSERT( !bSeekIdx, \"Der Node ist schon als OutlineNode vorhanden\" );\n\n \/\/JP 12.03.99: 63293 - Nodes vom RedlineBereich NIE aufnehmen\n ULONG nNd = rNd.GetIndex();\n if( nNd < GetEndOfRedlines().GetIndex() &&\n nNd > GetEndOfRedlines().FindStartNode()->GetIndex() )\n return ;\n\n \/\/ jetzt noch alle nachfolgende Outline-Nodes updaten\n pOutlineNds->Insert( pSrch );\n if( ! IsShowNum( nNewLevel ))\n return; \/\/ keine Nummerierung dann kein Update\n }\n else if( NO_NUMBERING == nNewLevel ) \/\/ Level entfernen\n {\n if( !bSeekIdx )\n return;\n\n \/\/ jetzt noch alle nachfolgende Outline-Nodes updaten\n pOutlineNds->Remove( nSttPos );\n if( ! IsShowNum(nOldLevel) )\n return; \/\/ keine Nummerierung dann kein Update\n }\n else if( !bSeekIdx ) \/\/ Update und Index nicht gefunden ??\n return ;\n\n {\n SwTxtNode & rTxtNd = (SwTxtNode &) rNd;\n SwPaM aPam(rTxtNd); \/\/ #115901#\n\n if (nNewLevel != NO_NUMBERING) \/\/ #115901#\n {\n const SwNodeNum * pNum = rTxtNd.GetOutlineNum();\n\n SwNodeNum aNum(0);\n\n if (0 != pNum)\n aNum = *pNum;\n\n aNum.SetLevel(rTxtNd.GetTxtColl()->GetOutlineLevel());\n rTxtNd.UpdateNum(aNum);\n\n GetDoc()->SetNumRule(aPam, *GetDoc()->GetOutlineNumRule());\n }\n else\n {\n GetDoc()->DelNumRules(aPam);\n }\n }\n\n \/\/ die Gliederungs-Felder Updaten\n GetDoc()->GetSysFldType( RES_CHAPTERFLD )->UpdateFlds();\n}\n\n\n\nvoid SwNodes::UpdtOutlineIdx( const SwNode& rNd )\n{\n if( !pOutlineNds->Count() ) \/\/ keine OutlineNodes vorhanden ?\n return;\n\n const SwNodePtr pSrch = (SwNodePtr)&rNd;\n USHORT nPos;\n pOutlineNds->Seek_Entry( pSrch, &nPos );\n if( nPos == pOutlineNds->Count() ) \/\/ keine zum Updaten vorhanden ?\n return;\n\n if( nPos )\n --nPos;\n\n if( !GetDoc()->IsInDtor() && IsDocNodes() )\n UpdateOutlineNode( *(*pOutlineNds)[ nPos ], 0, 0 );\n}\n\n\n\nvoid SwNodes::UpdateOutlineNodes()\n{\n if( pOutlineNds->Count() ) \/\/ OutlineNodes vorhanden ?\n UpdateOutlineNode( *(*pOutlineNds)[ 0 ], 0, 0 );\n}\n<commit_msg>INTEGRATION: CWS oasisbf2 (1.10.90); FILE MERGED 2004\/11\/04 15:30:26 dvo 1.10.90.1: #i31024# prevent headings with outline num-rules from being written as lists (plus dependent changes for NO_NUM removal)<commit_after>\/*************************************************************************\n *\n * $RCSfile: ndnum.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: rt $ $Date: 2004-11-26 13:25:03 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef _NODE_HXX\n#include <node.hxx>\n#endif\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _PAM_HXX\n#include <pam.hxx>\n#endif\n#ifndef _NDTXT_HXX\n#include <ndtxt.hxx>\n#endif\n#ifndef _NUMRULE_HXX\n#include <numrule.hxx>\n#endif\n#ifndef _FLDBAS_HXX\n#include <fldbas.hxx> \/\/ UpdateFlds der KapitelNummerierung\n#endif\n\n\n_SV_IMPL_SORTAR_ALG( SwOutlineNodes, SwNodePtr )\nBOOL SwOutlineNodes::Seek_Entry( const SwNodePtr rSrch, USHORT* pFndPos ) const\n{\n ULONG nIdx = rSrch->GetIndex();\n\n register USHORT nO = Count(), nM, nU = 0;\n if( nO > 0 )\n {\n\/\/JP 17.03.98: aufgrund des Bug 48592 - wo unter anderem nach Undo\/Redo\n\/\/ Nodes aus dem falschen NodesArray im OutlineArray standen,\n\/\/ jetzt mal einen Check eingebaut.\n#ifndef PRODUCT\n {\n for( register USHORT n = 1; n < nO; ++n )\n if( &(*this)[ n-1 ]->GetNodes() !=\n &(*this)[ n ]->GetNodes() )\n {\n ASSERT( !this, \"Node im falschen Outline-Array\" );\n }\n }\n#endif\n\n nO--;\n while( nU <= nO )\n {\n nM = nU + ( nO - nU ) \/ 2;\n if( (*this)[ nM ] == rSrch )\n {\n if( pFndPos )\n *pFndPos = nM;\n return TRUE;\n }\n else if( (*this)[ nM ]->GetIndex() < nIdx )\n nU = nM + 1;\n else if( nM == 0 )\n {\n if( pFndPos )\n *pFndPos = nU;\n return FALSE;\n }\n else\n nO = nM - 1;\n }\n }\n if( pFndPos )\n *pFndPos = nU;\n return FALSE;\n}\n\nvoid SwNodes::UpdateOutlineNode( const SwNode& rNd, BYTE nOldLevel,\n BYTE nNewLevel )\n{\n const SwNodePtr pSrch = (SwNodePtr)&rNd;\n USHORT nSttPos;\n BOOL bSeekIdx = pOutlineNds->Seek_Entry( pSrch, &nSttPos );\n\n if( NO_NUMBERING == nOldLevel ) \/\/ neuen Level einfuegen\n {\n \/\/ nicht vorhanden, also einfuegen\n ASSERT( !bSeekIdx, \"Der Node ist schon als OutlineNode vorhanden\" );\n\n \/\/JP 12.03.99: 63293 - Nodes vom RedlineBereich NIE aufnehmen\n ULONG nNd = rNd.GetIndex();\n if( nNd < GetEndOfRedlines().GetIndex() &&\n nNd > GetEndOfRedlines().FindStartNode()->GetIndex() )\n return ;\n\n \/\/ jetzt noch alle nachfolgende Outline-Nodes updaten\n pOutlineNds->Insert( pSrch );\n if( ! IsShowNum( nNewLevel ))\n return; \/\/ keine Nummerierung dann kein Update\n }\n else if( NO_NUMBERING == nNewLevel ) \/\/ Level entfernen\n {\n if( !bSeekIdx )\n return;\n\n \/\/ jetzt noch alle nachfolgende Outline-Nodes updaten\n pOutlineNds->Remove( nSttPos );\n if( ! IsShowNum(nOldLevel) )\n return; \/\/ keine Nummerierung dann kein Update\n }\n else if( !bSeekIdx ) \/\/ Update und Index nicht gefunden ??\n return ;\n\n {\n SwTxtNode & rTxtNd = (SwTxtNode &) rNd;\n SwPaM aPam(rTxtNd); \/\/ #115901#\n\n if (nNewLevel != NO_NUMBERING) \/\/ #115901#\n {\n const SwNodeNum * pNum = rTxtNd.GetOutlineNum();\n\n SwNodeNum aNum(0);\n\n if (0 != pNum)\n aNum = *pNum;\n\n aNum.SetNoNum(FALSE);\n aNum.SetLevel(rTxtNd.GetTxtColl()->GetOutlineLevel());\n rTxtNd.UpdateNum(aNum);\n\n \/\/GetDoc()->SetNumRule(aPam, *GetDoc()->GetOutlineNumRule());\n }\n else\n {\n GetDoc()->DelNumRules(aPam);\n }\n }\n\n \/\/ die Gliederungs-Felder Updaten\n GetDoc()->GetSysFldType( RES_CHAPTERFLD )->UpdateFlds();\n}\n\n\n\nvoid SwNodes::UpdtOutlineIdx( const SwNode& rNd )\n{\n if( !pOutlineNds->Count() ) \/\/ keine OutlineNodes vorhanden ?\n return;\n\n const SwNodePtr pSrch = (SwNodePtr)&rNd;\n USHORT nPos;\n pOutlineNds->Seek_Entry( pSrch, &nPos );\n if( nPos == pOutlineNds->Count() ) \/\/ keine zum Updaten vorhanden ?\n return;\n\n if( nPos )\n --nPos;\n\n if( !GetDoc()->IsInDtor() && IsDocNodes() )\n UpdateOutlineNode( *(*pOutlineNds)[ nPos ], 0, 0 );\n}\n\n\n\nvoid SwNodes::UpdateOutlineNodes()\n{\n if( pOutlineNds->Count() ) \/\/ OutlineNodes vorhanden ?\n UpdateOutlineNode( *(*pOutlineNds)[ 0 ], 0, 0 );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of btag.\n *\n * © 2010-2011 Fernando Tarlá Cardoso Lemos\n *\n * Refer to the LICENSE file for licensing information.\n *\n *\/\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/optional.hpp>\n#include <taglib\/fileref.h>\n#include <taglib\/tag.h>\n#include <cassert>\n#include <cstdlib>\n#include <exception>\n\n#include \"InteractiveTagger.h\"\n#include \"validators.h\"\n#include \"wide_string_cast.h\"\n\nnamespace fs = boost::filesystem;\n\nInteractiveTagger::InteractiveTagger()\n : m_input_filter(NULL), m_output_filter(NULL), m_dry_run(false)\n{\n \/\/ Load the extensions supported by TagLib\n TagLib::StringList extensions = TagLib::FileRef::defaultFileExtensions();\n for (TagLib::StringList::ConstIterator it = extensions.begin(); it != extensions.end(); ++it)\n m_supported_extensions.push_back(L'.' + it->toWString());\n}\n\n\nvoid InteractiveTagger::set_file_rename_format(const std::string &format)\n{\n m_file_rename_format = boost::lexical_cast<std::wstring>(format);\n}\n\nvoid InteractiveTagger::set_dir_rename_format(const std::string &format)\n{\n m_dir_rename_format = boost::lexical_cast<std::wstring>(format);\n}\n\nvoid InteractiveTagger::tag(int num_paths, const char **paths)\n{\n assert(m_terminal);\n\n \/\/ Build a list with the normalized paths\n std::list<fs::path> path_list;\n for (int i = 0; i < num_paths; ++i) {\n char *real_path = realpath(paths[i], NULL);\n if (!real_path) {\n std::string errstr(\"\\\"\");\n errstr += paths[i];\n errstr += \"\\\" is not a valid path\";\n m_terminal->display_warning_message(errstr);\n continue;\n }\n path_list.push_back(fs::path(boost::lexical_cast<std::wstring>(std::string(real_path))));\n free(real_path);\n }\n\n \/\/ Sort it and tag the paths\n path_list.sort();\n BOOST_FOREACH(const fs::path &path, path_list) {\n \/\/ Check if the path exists\n if (!fs::exists(path)) {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" not found, skipping...\");\n continue;\n }\n\n try {\n \/\/ If it's a regular file, just tag it\n if (fs::is_regular_file(path)) {\n if (!is_supported_extension(path)) {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" has no supported extension, skipping...\");\n continue;\n }\n tag_file(path);\n }\n\n \/\/ If it's a directory, tag its contents\n else if (fs::is_directory(path)) {\n tag_directory(path);\n }\n\n \/\/ It's none of the above, do something about it\n else {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" is not a regular file or directory, skipping...\");\n }\n }\n catch (std::exception &e) {\n m_terminal->display_warning_message(e.what());\n }\n }\n\n \/\/ Save the unsaved files\n if (!m_unsaved_files.empty()\n && (m_dry_run || m_terminal->ask_yes_no_question(L\"=== OK to save the changes to the files?\"))) {\n if (m_dry_run)\n m_terminal->display_info_message(\"=== Not saving changes (dry run mode)\");\n BOOST_FOREACH(TagLib::FileRef &f, m_unsaved_files) {\n std::string message(m_dry_run ? \"Not saving\" : \"Saving\");\n message += \" \\\"\" + std::string(f.file()->name()) + '\\\"';\n m_terminal->display_info_message(message);\n if (!m_dry_run && !f.save())\n m_terminal->display_warning_message(\"Unable to save \" + std::string(f.file()->name()) + \"\\\"\");\n }\n }\n\n \/\/ Perform the pending renames\n if (!m_pending_renames.empty()\n && (m_dry_run || m_terminal->ask_yes_no_question(L\"=== OK to rename the files?\"))) {\n if (m_dry_run)\n m_terminal->display_info_message(\"=== Not renaming files (dry run mode)\");\n std::list<std::pair<fs::path, fs::path> >::const_iterator it;\n for (it = m_pending_renames.begin(); it != m_pending_renames.end(); ++it) {\n const fs::path &from((*it).first);\n const fs::path &to((*it).second);\n m_terminal->display_info_message(from.string());\n m_terminal->display_info_message(L\"-> \" + to.string<std::wstring>());\n if (!m_dry_run) {\n try { fs::rename(from, to); }\n catch (std::exception &e) { m_terminal->display_warning_message(e.what()); }\n }\n }\n }\n\n m_terminal->display_info_message(\"=== All done!\");\n}\n\nbool InteractiveTagger::is_supported_extension(const fs::path &path)\n{\n std::wstring extension(path.extension().string<std::wstring>());\n boost::to_lower(extension);\n\n BOOST_FOREACH(const std::wstring &supported_extension, m_supported_extensions) {\n if (extension == supported_extension)\n return true;\n }\n\n return false;\n}\n\nstd::wstring InteractiveTagger::replace_tokens(const std::wstring &str,\n const std::map<std::wstring, std::wstring> &replacements)\n{\n std::wstring res;\n res.reserve(str.size() * 3);\n\n bool parsing_token = false;\n std::wstring current_token;\n BOOST_FOREACH(char c, str) {\n if (c == '%') {\n if (parsing_token) {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n current_token.erase();\n }\n parsing_token = true;\n }\n else if (parsing_token) {\n if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) {\n current_token += c;\n }\n else {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n res += c;\n parsing_token = false;\n current_token.erase();\n }\n }\n else {\n res += c;\n }\n }\n if (parsing_token) {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n }\n\n return res;\n}\n\nvoid InteractiveTagger::tag_file(const fs::path &path, ConfirmationHandler &artist_confirmation,\n ConfirmationHandler &album_confirmation, int *year, int track)\n{\n m_terminal->display_info_message(L\"=== Tagging \\\"\" + path.filename().string<std::wstring>() + L\"\\\"\");\n\n \/\/ Get a reference to the file\n TagLib::FileRef f(path.c_str());\n\n \/\/ Ask for the artist\n artist_confirmation.reset();\n if (!f.tag()->artist().isNull())\n artist_confirmation.set_local_default(m_input_filter->filter(f.tag()->artist().toWString()));\n artist_confirmation.ask(L\"Artist:\");\n while (!artist_confirmation.complies())\n artist_confirmation.ask(L\"Artist (confirmation):\");\n f.tag()->setArtist(artist_confirmation.answer());\n\n \/\/ Ask for the album\n album_confirmation.reset();\n if (!f.tag()->album().isNull())\n album_confirmation.set_local_default(m_input_filter->filter(f.tag()->album().toWString()));\n album_confirmation.ask(L\"Album:\");\n while (!album_confirmation.complies())\n album_confirmation.ask(L\"Album (confirmation):\");\n f.tag()->setAlbum(album_confirmation.answer());\n\n \/\/ Ask for the year\n boost::optional<int> default_year;\n if (year && *year != -1)\n default_year = *year;\n else if (f.tag()->year())\n default_year = f.tag()->year();\n YearValidator year_validator;\n int new_year = m_terminal->ask_number_question(L\"Year:\", default_year, &year_validator);\n f.tag()->setYear(new_year);\n if (year) *year = new_year;\n\n \/\/ Ask for the track\n if (track == -1)\n track = f.tag()->track();\n TrackValidator track_validator;\n int new_track = m_terminal->ask_number_question(L\"Track:\",\n track > 0 ? track : boost::optional<int>(), &track_validator);\n f.tag()->setTrack(new_track);\n\n \/\/ Ask for the song title\n boost::optional<std::wstring> default_title;\n if (!f.tag()->title().isNull())\n default_title = m_input_filter->filter(f.tag()->title().toWString());\n std::wstring new_title = m_terminal->ask_string_question(L\"Title:\", default_title);\n if (m_output_filter) {\n std::wstring filtered_title = m_output_filter->filter(new_title);\n if (m_input_filter->requires_confirmation_as_output_filter() && filtered_title != new_title)\n filtered_title = m_terminal->ask_string_question(L\"Title (confirmation):\", filtered_title);\n new_title = filtered_title;\n }\n f.tag()->setTitle(new_title);\n\n \/\/ Reset the comment and genre fields\n f.tag()->setComment(TagLib::String::null);\n f.tag()->setGenre(TagLib::String::null);\n\n \/\/ Add it to the list of unsaved files\n m_unsaved_files.push_back(f);\n\n \/\/ Add it to the list of pending renames based on the supplied format\n if (m_file_rename_format) {\n std::map<std::wstring, std::wstring> tokens;\n tokens[L\"artist\"] = m_renaming_filter->filter(artist_confirmation.answer());\n tokens[L\"album\"] = m_renaming_filter->filter(album_confirmation.answer());\n tokens[L\"year\"] = boost::lexical_cast<std::wstring>(new_year);\n std::wstring track_str(boost::lexical_cast<std::wstring>(new_track));\n if (track_str.size() == 1) track_str = L\"0\" + track_str;\n tokens[L\"track\"] = track_str;\n tokens[L\"title\"] = m_renaming_filter->filter(new_title);\n fs::path new_path = path.parent_path();\n new_path \/= replace_tokens(*m_file_rename_format, tokens)\n + boost::to_lower_copy(path.extension().string<std::wstring>());\n if (new_path != path)\n m_pending_renames.push_back(std::pair<fs::path, fs::path>(path, new_path));\n }\n}\n\nvoid InteractiveTagger::tag_file(const boost::filesystem::path &path)\n{\n \/\/ Tag a file without recording the global default\n ConfirmationHandler amnesiac(*m_terminal, m_input_filter, m_output_filter);\n tag_file(path, amnesiac, amnesiac, NULL, -1);\n}\n\nvoid InteractiveTagger::tag_directory(const fs::path &path)\n{\n m_terminal->display_info_message(L\"=== Entering \\\"\" + path.string<std::wstring>() + L\"\\\"\");\n\n \/\/ Create lists of files and subdirectories\n std::list<fs::path> file_list, dir_list;\n fs::directory_iterator end_it;\n for (fs::directory_iterator it(path); it != end_it; ++it) {\n \/\/ Normalize the path (needed here so that we follow symlinks)\n char *real_path = realpath(it->path().c_str(), NULL);\n if (!real_path) {\n m_terminal->display_warning_message(L\"\\\"\" + it->path().filename().string<std::wstring>()\n + L\"\\\" is not a valid path, skipping...\");\n continue;\n }\n fs::path boost_path(boost::lexical_cast<std::wstring>(real_path));\n free(real_path);\n\n \/\/ Add to the right list\n if (fs::is_regular_file(boost_path)) {\n if (is_supported_extension(boost_path)) {\n file_list.push_back(boost_path);\n }\n else {\n m_terminal->display_warning_message(L\"\\\"\" + it->path().filename().string<std::wstring>()\n + L\"\\\" has no supported extension, skipping...\");\n }\n }\n else if (fs::is_directory(boost_path)) {\n dir_list.push_back(boost_path);\n }\n else {\n m_terminal->display_warning_message(L\"\\\"\" + boost_path.filename().string<std::wstring>()\n + L\"\\\" is not a regular file or directory, skipping...\");\n }\n }\n\n \/\/ Sort those lists\n file_list.sort();\n dir_list.sort();\n\n \/\/ Tag all individual files\n ConfirmationHandler artist(*m_terminal, m_input_filter, m_output_filter);\n ConfirmationHandler album(*m_terminal, m_input_filter, m_output_filter);\n int year = -1;\n if (!file_list.empty()) {\n int track = 1;\n BOOST_FOREACH(const fs::path &p, file_list)\n tag_file(p, artist, album, &year, track++);\n }\n\n \/\/ We'll ask confirmation to descend into the subdirectories only if there are files\n BOOST_FOREACH(const fs::path &p, dir_list) {\n if (file_list.empty() || m_terminal->ask_yes_no_question(L\"Descend into subdirectory \\\"\"\n + boost::lexical_cast<std::wstring>(p.filename()) + L\"\\\"?\", false))\n tag_directory(p);\n }\n\n \/\/ Add it to the list of pending renames based on the supplied format\n if (!artist.answer().empty() && m_dir_rename_format) {\n std::map<std::wstring, std::wstring> tokens;\n tokens[L\"artist\"] = m_renaming_filter->filter(artist.answer());\n tokens[L\"album\"] = m_renaming_filter->filter(album.answer());\n tokens[L\"year\"] = boost::lexical_cast<std::wstring>(year);\n fs::path new_path = path.parent_path();\n new_path \/= replace_tokens(*m_dir_rename_format, tokens);\n if (new_path != path)\n m_pending_renames.push_back(std::pair<fs::path, fs::path>(path, new_path));\n }\n}\n<commit_msg>Use the confirmation handler for the title too.<commit_after>\/*\n * This file is part of btag.\n *\n * © 2010-2011 Fernando Tarlá Cardoso Lemos\n *\n * Refer to the LICENSE file for licensing information.\n *\n *\/\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/optional.hpp>\n#include <taglib\/fileref.h>\n#include <taglib\/tag.h>\n#include <cassert>\n#include <cstdlib>\n#include <exception>\n\n#include \"InteractiveTagger.h\"\n#include \"validators.h\"\n#include \"wide_string_cast.h\"\n\nnamespace fs = boost::filesystem;\n\nInteractiveTagger::InteractiveTagger()\n : m_input_filter(NULL), m_output_filter(NULL), m_dry_run(false)\n{\n \/\/ Load the extensions supported by TagLib\n TagLib::StringList extensions = TagLib::FileRef::defaultFileExtensions();\n for (TagLib::StringList::ConstIterator it = extensions.begin(); it != extensions.end(); ++it)\n m_supported_extensions.push_back(L'.' + it->toWString());\n}\n\n\nvoid InteractiveTagger::set_file_rename_format(const std::string &format)\n{\n m_file_rename_format = boost::lexical_cast<std::wstring>(format);\n}\n\nvoid InteractiveTagger::set_dir_rename_format(const std::string &format)\n{\n m_dir_rename_format = boost::lexical_cast<std::wstring>(format);\n}\n\nvoid InteractiveTagger::tag(int num_paths, const char **paths)\n{\n assert(m_terminal);\n\n \/\/ Build a list with the normalized paths\n std::list<fs::path> path_list;\n for (int i = 0; i < num_paths; ++i) {\n char *real_path = realpath(paths[i], NULL);\n if (!real_path) {\n std::string errstr(\"\\\"\");\n errstr += paths[i];\n errstr += \"\\\" is not a valid path\";\n m_terminal->display_warning_message(errstr);\n continue;\n }\n path_list.push_back(fs::path(boost::lexical_cast<std::wstring>(std::string(real_path))));\n free(real_path);\n }\n\n \/\/ Sort it and tag the paths\n path_list.sort();\n BOOST_FOREACH(const fs::path &path, path_list) {\n \/\/ Check if the path exists\n if (!fs::exists(path)) {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" not found, skipping...\");\n continue;\n }\n\n try {\n \/\/ If it's a regular file, just tag it\n if (fs::is_regular_file(path)) {\n if (!is_supported_extension(path)) {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" has no supported extension, skipping...\");\n continue;\n }\n tag_file(path);\n }\n\n \/\/ If it's a directory, tag its contents\n else if (fs::is_directory(path)) {\n tag_directory(path);\n }\n\n \/\/ It's none of the above, do something about it\n else {\n m_terminal->display_warning_message(L\"Path \\\"\" + path.string<std::wstring>()\n + L\"\\\" is not a regular file or directory, skipping...\");\n }\n }\n catch (std::exception &e) {\n m_terminal->display_warning_message(e.what());\n }\n }\n\n \/\/ Save the unsaved files\n if (!m_unsaved_files.empty()\n && (m_dry_run || m_terminal->ask_yes_no_question(L\"=== OK to save the changes to the files?\"))) {\n if (m_dry_run)\n m_terminal->display_info_message(\"=== Not saving changes (dry run mode)\");\n BOOST_FOREACH(TagLib::FileRef &f, m_unsaved_files) {\n std::string message(m_dry_run ? \"Not saving\" : \"Saving\");\n message += \" \\\"\" + std::string(f.file()->name()) + '\\\"';\n m_terminal->display_info_message(message);\n if (!m_dry_run && !f.save())\n m_terminal->display_warning_message(\"Unable to save \" + std::string(f.file()->name()) + \"\\\"\");\n }\n }\n\n \/\/ Perform the pending renames\n if (!m_pending_renames.empty()\n && (m_dry_run || m_terminal->ask_yes_no_question(L\"=== OK to rename the files?\"))) {\n if (m_dry_run)\n m_terminal->display_info_message(\"=== Not renaming files (dry run mode)\");\n std::list<std::pair<fs::path, fs::path> >::const_iterator it;\n for (it = m_pending_renames.begin(); it != m_pending_renames.end(); ++it) {\n const fs::path &from((*it).first);\n const fs::path &to((*it).second);\n m_terminal->display_info_message(from.string());\n m_terminal->display_info_message(L\"-> \" + to.string<std::wstring>());\n if (!m_dry_run) {\n try { fs::rename(from, to); }\n catch (std::exception &e) { m_terminal->display_warning_message(e.what()); }\n }\n }\n }\n\n m_terminal->display_info_message(\"=== All done!\");\n}\n\nbool InteractiveTagger::is_supported_extension(const fs::path &path)\n{\n std::wstring extension(path.extension().string<std::wstring>());\n boost::to_lower(extension);\n\n BOOST_FOREACH(const std::wstring &supported_extension, m_supported_extensions) {\n if (extension == supported_extension)\n return true;\n }\n\n return false;\n}\n\nstd::wstring InteractiveTagger::replace_tokens(const std::wstring &str,\n const std::map<std::wstring, std::wstring> &replacements)\n{\n std::wstring res;\n res.reserve(str.size() * 3);\n\n bool parsing_token = false;\n std::wstring current_token;\n BOOST_FOREACH(char c, str) {\n if (c == '%') {\n if (parsing_token) {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n current_token.erase();\n }\n parsing_token = true;\n }\n else if (parsing_token) {\n if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) {\n current_token += c;\n }\n else {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n res += c;\n parsing_token = false;\n current_token.erase();\n }\n }\n else {\n res += c;\n }\n }\n if (parsing_token) {\n std::map<std::wstring, std::wstring>::const_iterator it = replacements.find(current_token);\n res += it == replacements.end() ? current_token : it->second;\n }\n\n return res;\n}\n\nvoid InteractiveTagger::tag_file(const fs::path &path, ConfirmationHandler &artist_confirmation,\n ConfirmationHandler &album_confirmation, int *year, int track)\n{\n m_terminal->display_info_message(L\"=== Tagging \\\"\" + path.filename().string<std::wstring>() + L\"\\\"\");\n\n \/\/ Get a reference to the file\n TagLib::FileRef f(path.c_str());\n\n \/\/ Ask for the artist\n artist_confirmation.reset();\n if (!f.tag()->artist().isNull())\n artist_confirmation.set_local_default(m_input_filter->filter(f.tag()->artist().toWString()));\n artist_confirmation.ask(L\"Artist:\");\n while (!artist_confirmation.complies())\n artist_confirmation.ask(L\"Artist (confirmation):\");\n f.tag()->setArtist(artist_confirmation.answer());\n\n \/\/ Ask for the album\n album_confirmation.reset();\n if (!f.tag()->album().isNull())\n album_confirmation.set_local_default(m_input_filter->filter(f.tag()->album().toWString()));\n album_confirmation.ask(L\"Album:\");\n while (!album_confirmation.complies())\n album_confirmation.ask(L\"Album (confirmation):\");\n f.tag()->setAlbum(album_confirmation.answer());\n\n \/\/ Ask for the year\n boost::optional<int> default_year;\n if (year && *year != -1)\n default_year = *year;\n else if (f.tag()->year())\n default_year = f.tag()->year();\n YearValidator year_validator;\n int new_year = m_terminal->ask_number_question(L\"Year:\", default_year, &year_validator);\n f.tag()->setYear(new_year);\n if (year) *year = new_year;\n\n \/\/ Ask for the track\n if (track == -1)\n track = f.tag()->track();\n TrackValidator track_validator;\n int new_track = m_terminal->ask_number_question(L\"Track:\",\n track > 0 ? track : boost::optional<int>(), &track_validator);\n f.tag()->setTrack(new_track);\n\n \/\/ Ask for the song title\n ConfirmationHandler title_confirmation(*m_terminal, m_input_filter, m_output_filter);\n title_confirmation.reset();\n if (!f.tag()->title().isNull())\n title_confirmation.set_local_default(m_input_filter->filter(f.tag()->title().toWString()));\n title_confirmation.ask(L\"Title:\");\n while (!title_confirmation.complies())\n title_confirmation.ask(L\"Title (confirmation):\");\n f.tag()->setTitle(title_confirmation.answer());\n\n \/\/ Reset the comment and genre fields\n f.tag()->setComment(TagLib::String::null);\n f.tag()->setGenre(TagLib::String::null);\n\n \/\/ Add it to the list of unsaved files\n m_unsaved_files.push_back(f);\n\n \/\/ Add it to the list of pending renames based on the supplied format\n if (m_file_rename_format) {\n std::map<std::wstring, std::wstring> tokens;\n tokens[L\"artist\"] = m_renaming_filter->filter(artist_confirmation.answer());\n tokens[L\"album\"] = m_renaming_filter->filter(album_confirmation.answer());\n tokens[L\"year\"] = boost::lexical_cast<std::wstring>(new_year);\n std::wstring track_str(boost::lexical_cast<std::wstring>(new_track));\n if (track_str.size() == 1) track_str = L\"0\" + track_str;\n tokens[L\"track\"] = track_str;\n tokens[L\"title\"] = m_renaming_filter->filter(title_confirmation.answer());\n fs::path new_path = path.parent_path();\n new_path \/= replace_tokens(*m_file_rename_format, tokens)\n + boost::to_lower_copy(path.extension().string<std::wstring>());\n if (new_path != path)\n m_pending_renames.push_back(std::pair<fs::path, fs::path>(path, new_path));\n }\n}\n\nvoid InteractiveTagger::tag_file(const boost::filesystem::path &path)\n{\n \/\/ Tag a file without recording the global default\n ConfirmationHandler amnesiac(*m_terminal, m_input_filter, m_output_filter);\n tag_file(path, amnesiac, amnesiac, NULL, -1);\n}\n\nvoid InteractiveTagger::tag_directory(const fs::path &path)\n{\n m_terminal->display_info_message(L\"=== Entering \\\"\" + path.string<std::wstring>() + L\"\\\"\");\n\n \/\/ Create lists of files and subdirectories\n std::list<fs::path> file_list, dir_list;\n fs::directory_iterator end_it;\n for (fs::directory_iterator it(path); it != end_it; ++it) {\n \/\/ Normalize the path (needed here so that we follow symlinks)\n char *real_path = realpath(it->path().c_str(), NULL);\n if (!real_path) {\n m_terminal->display_warning_message(L\"\\\"\" + it->path().filename().string<std::wstring>()\n + L\"\\\" is not a valid path, skipping...\");\n continue;\n }\n fs::path boost_path(boost::lexical_cast<std::wstring>(real_path));\n free(real_path);\n\n \/\/ Add to the right list\n if (fs::is_regular_file(boost_path)) {\n if (is_supported_extension(boost_path)) {\n file_list.push_back(boost_path);\n }\n else {\n m_terminal->display_warning_message(L\"\\\"\" + it->path().filename().string<std::wstring>()\n + L\"\\\" has no supported extension, skipping...\");\n }\n }\n else if (fs::is_directory(boost_path)) {\n dir_list.push_back(boost_path);\n }\n else {\n m_terminal->display_warning_message(L\"\\\"\" + boost_path.filename().string<std::wstring>()\n + L\"\\\" is not a regular file or directory, skipping...\");\n }\n }\n\n \/\/ Sort those lists\n file_list.sort();\n dir_list.sort();\n\n \/\/ Tag all individual files\n ConfirmationHandler artist(*m_terminal, m_input_filter, m_output_filter);\n ConfirmationHandler album(*m_terminal, m_input_filter, m_output_filter);\n int year = -1;\n if (!file_list.empty()) {\n int track = 1;\n BOOST_FOREACH(const fs::path &p, file_list)\n tag_file(p, artist, album, &year, track++);\n }\n\n \/\/ We'll ask confirmation to descend into the subdirectories only if there are files\n BOOST_FOREACH(const fs::path &p, dir_list) {\n if (file_list.empty() || m_terminal->ask_yes_no_question(L\"Descend into subdirectory \\\"\"\n + boost::lexical_cast<std::wstring>(p.filename()) + L\"\\\"?\", false))\n tag_directory(p);\n }\n\n \/\/ Add it to the list of pending renames based on the supplied format\n if (!artist.answer().empty() && m_dir_rename_format) {\n std::map<std::wstring, std::wstring> tokens;\n tokens[L\"artist\"] = m_renaming_filter->filter(artist.answer());\n tokens[L\"album\"] = m_renaming_filter->filter(album.answer());\n tokens[L\"year\"] = boost::lexical_cast<std::wstring>(year);\n fs::path new_path = path.parent_path();\n new_path \/= replace_tokens(*m_dir_rename_format, tokens);\n if (new_path != path)\n m_pending_renames.push_back(std::pair<fs::path, fs::path>(path, new_path));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"tensorfieldvalue.h\"\n#include <vespa\/document\/base\/exceptions.h>\n#include <vespa\/document\/datatype\/tensor_data_type.h>\n#include <vespa\/vespalib\/util\/xmlstream.h>\n#include <vespa\/eval\/eval\/engine_or_factory.h>\n#include <vespa\/eval\/eval\/tensor_spec.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <vespa\/eval\/eval\/engine_or_factory.h>\n#include <ostream>\n#include <cassert>\n\nusing vespalib::eval::EngineOrFactory;\nusing vespalib::eval::TensorSpec;\nusing vespalib::eval::ValueType;\nusing namespace vespalib::xml;\n\nnamespace document {\n\nnamespace {\n\nTensorDataType emptyTensorDataType;\n\nvespalib::string makeWrongTensorTypeMsg(const ValueType &fieldTensorType, const ValueType &tensorType)\n{\n return vespalib::make_string(\"Field tensor type is '%s' but other tensor type is '%s'\",\n fieldTensorType.to_spec().c_str(),\n tensorType.to_spec().c_str());\n}\n\n}\n\nTensorFieldValue::TensorFieldValue()\n : TensorFieldValue(emptyTensorDataType)\n{\n}\n\nTensorFieldValue::TensorFieldValue(const TensorDataType &dataType)\n : FieldValue(),\n _dataType(dataType),\n _tensor(),\n _altered(true)\n{\n}\n\nTensorFieldValue::TensorFieldValue(const TensorFieldValue &rhs)\n : FieldValue(),\n _dataType(rhs._dataType),\n _tensor(),\n _altered(true)\n{\n if (rhs._tensor) {\n _tensor = EngineOrFactory::get().copy(*rhs._tensor);\n }\n}\n\n\nTensorFieldValue::TensorFieldValue(TensorFieldValue &&rhs)\n : FieldValue(),\n _dataType(rhs._dataType),\n _tensor(),\n _altered(true)\n{\n _tensor = std::move(rhs._tensor);\n}\n\n\nTensorFieldValue::~TensorFieldValue()\n{\n}\n\n\nTensorFieldValue &\nTensorFieldValue::operator=(const TensorFieldValue &rhs)\n{\n if (this != &rhs) {\n if (&_dataType == &rhs._dataType || !rhs._tensor ||\n _dataType.isAssignableType(rhs._tensor->type())) {\n if (rhs._tensor) {\n _tensor = EngineOrFactory::get().copy(*rhs._tensor);\n } else {\n _tensor.reset();\n }\n _altered = true;\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs._tensor->type()), VESPA_STRLOC);\n }\n }\n return *this;\n}\n\n\nTensorFieldValue &\nTensorFieldValue::operator=(std::unique_ptr<vespalib::eval::Value> rhs)\n{\n if (!rhs || _dataType.isAssignableType(rhs->type())) {\n _tensor = std::move(rhs);\n _altered = true;\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs->type()), VESPA_STRLOC);\n }\n return *this;\n}\n\n\nvoid\nTensorFieldValue::make_empty_if_not_existing()\n{\n if (!_tensor) {\n TensorSpec empty_spec(_dataType.getTensorType().to_spec());\n _tensor = EngineOrFactory::get().from_spec(empty_spec);\n }\n}\n\n\nvoid\nTensorFieldValue::accept(FieldValueVisitor &visitor)\n{\n visitor.visit(*this);\n}\n\n\nvoid\nTensorFieldValue::accept(ConstFieldValueVisitor &visitor) const\n{\n visitor.visit(*this);\n}\n\n\nconst DataType *\nTensorFieldValue::getDataType() const\n{\n return &_dataType;\n}\n\n\nbool\nTensorFieldValue::hasChanged() const\n{\n return _altered;\n}\n\n\nTensorFieldValue*\nTensorFieldValue::clone() const\n{\n return new TensorFieldValue(*this);\n}\n\n\nvoid\nTensorFieldValue::print(std::ostream& out, bool verbose,\n const std::string& indent) const\n{\n (void) verbose;\n (void) indent;\n out << \"{TensorFieldValue: \";\n if (_tensor) {\n out << EngineOrFactory::get().to_spec(*_tensor).to_string();\n } else {\n out << \"null\";\n }\n out << \"}\";\n}\n\nvoid\nTensorFieldValue::printXml(XmlOutputStream& out) const\n{\n out << \"{TensorFieldValue::printXml not yet implemented}\";\n}\n\n\nFieldValue &\nTensorFieldValue::assign(const FieldValue &value)\n{\n const TensorFieldValue *rhs =\n Identifiable::cast<const TensorFieldValue *>(&value);\n if (rhs != nullptr) {\n *this = *rhs;\n } else {\n return FieldValue::assign(value);\n }\n return *this;\n}\n\n\nvoid\nTensorFieldValue::assignDeserialized(std::unique_ptr<vespalib::eval::Value> rhs)\n{\n if (!rhs || _dataType.isAssignableType(rhs->type())) {\n _tensor = std::move(rhs);\n _altered = false; \/\/ Serialized form already exists\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs->type()), VESPA_STRLOC);\n }\n}\n\n\nint\nTensorFieldValue::compare(const FieldValue &other) const\n{\n if (this == &other) {\n return 0;\t\/\/ same identity\n }\n int diff = FieldValue::compare(other);\n if (diff != 0) {\n return diff; \/\/ field type mismatch\n }\n const TensorFieldValue & rhs(static_cast<const TensorFieldValue &>(other));\n if (!_tensor) {\n return (rhs._tensor ? -1 : 0);\n }\n if (!rhs._tensor) {\n return 1;\n }\n \/\/ equal pointers always means identical\n if (_tensor.get() == rhs._tensor.get()) {\n return 0;\n }\n \/\/ compare just the type first:\n auto lhs_type = _tensor->type().to_spec();\n auto rhs_type = rhs._tensor->type().to_spec();\n int type_cmp = lhs_type.compare(rhs_type);\n if (type_cmp != 0) {\n return type_cmp;\n }\n \/\/ Compare the actual tensors by converting to TensorSpec strings.\n \/\/ TODO: this can be very slow, check if it might be used for anything\n \/\/ performance-critical.\n auto engine = EngineOrFactory::get();\n auto lhs_spec = engine.to_spec(*_tensor).to_string();\n auto rhs_spec = engine.to_spec(*rhs._tensor).to_string();\n return lhs_spec.compare(rhs_spec);\n}\n\nIMPLEMENT_IDENTIFIABLE(TensorFieldValue, FieldValue);\n\n} \/\/ document\n<commit_msg>use spec_from_value<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"tensorfieldvalue.h\"\n#include <vespa\/document\/base\/exceptions.h>\n#include <vespa\/document\/datatype\/tensor_data_type.h>\n#include <vespa\/vespalib\/util\/xmlstream.h>\n#include <vespa\/eval\/eval\/engine_or_factory.h>\n#include <vespa\/eval\/eval\/tensor_spec.h>\n#include <vespa\/eval\/eval\/value_codec.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <ostream>\n#include <cassert>\n\nusing vespalib::eval::EngineOrFactory;\nusing vespalib::eval::TensorSpec;\nusing vespalib::eval::ValueType;\nusing namespace vespalib::xml;\n\nnamespace document {\n\nnamespace {\n\nTensorDataType emptyTensorDataType;\n\nvespalib::string makeWrongTensorTypeMsg(const ValueType &fieldTensorType, const ValueType &tensorType)\n{\n return vespalib::make_string(\"Field tensor type is '%s' but other tensor type is '%s'\",\n fieldTensorType.to_spec().c_str(),\n tensorType.to_spec().c_str());\n}\n\n}\n\nTensorFieldValue::TensorFieldValue()\n : TensorFieldValue(emptyTensorDataType)\n{\n}\n\nTensorFieldValue::TensorFieldValue(const TensorDataType &dataType)\n : FieldValue(),\n _dataType(dataType),\n _tensor(),\n _altered(true)\n{\n}\n\nTensorFieldValue::TensorFieldValue(const TensorFieldValue &rhs)\n : FieldValue(),\n _dataType(rhs._dataType),\n _tensor(),\n _altered(true)\n{\n if (rhs._tensor) {\n _tensor = EngineOrFactory::get().copy(*rhs._tensor);\n }\n}\n\n\nTensorFieldValue::TensorFieldValue(TensorFieldValue &&rhs)\n : FieldValue(),\n _dataType(rhs._dataType),\n _tensor(),\n _altered(true)\n{\n _tensor = std::move(rhs._tensor);\n}\n\n\nTensorFieldValue::~TensorFieldValue()\n{\n}\n\n\nTensorFieldValue &\nTensorFieldValue::operator=(const TensorFieldValue &rhs)\n{\n if (this != &rhs) {\n if (&_dataType == &rhs._dataType || !rhs._tensor ||\n _dataType.isAssignableType(rhs._tensor->type())) {\n if (rhs._tensor) {\n _tensor = EngineOrFactory::get().copy(*rhs._tensor);\n } else {\n _tensor.reset();\n }\n _altered = true;\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs._tensor->type()), VESPA_STRLOC);\n }\n }\n return *this;\n}\n\n\nTensorFieldValue &\nTensorFieldValue::operator=(std::unique_ptr<vespalib::eval::Value> rhs)\n{\n if (!rhs || _dataType.isAssignableType(rhs->type())) {\n _tensor = std::move(rhs);\n _altered = true;\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs->type()), VESPA_STRLOC);\n }\n return *this;\n}\n\n\nvoid\nTensorFieldValue::make_empty_if_not_existing()\n{\n if (!_tensor) {\n TensorSpec empty_spec(_dataType.getTensorType().to_spec());\n _tensor = EngineOrFactory::get().from_spec(empty_spec);\n }\n}\n\n\nvoid\nTensorFieldValue::accept(FieldValueVisitor &visitor)\n{\n visitor.visit(*this);\n}\n\n\nvoid\nTensorFieldValue::accept(ConstFieldValueVisitor &visitor) const\n{\n visitor.visit(*this);\n}\n\n\nconst DataType *\nTensorFieldValue::getDataType() const\n{\n return &_dataType;\n}\n\n\nbool\nTensorFieldValue::hasChanged() const\n{\n return _altered;\n}\n\n\nTensorFieldValue*\nTensorFieldValue::clone() const\n{\n return new TensorFieldValue(*this);\n}\n\n\nvoid\nTensorFieldValue::print(std::ostream& out, bool verbose,\n const std::string& indent) const\n{\n (void) verbose;\n (void) indent;\n out << \"{TensorFieldValue: \";\n if (_tensor) {\n out << spec_from_value(*_tensor).to_string();\n } else {\n out << \"null\";\n }\n out << \"}\";\n}\n\nvoid\nTensorFieldValue::printXml(XmlOutputStream& out) const\n{\n out << \"{TensorFieldValue::printXml not yet implemented}\";\n}\n\n\nFieldValue &\nTensorFieldValue::assign(const FieldValue &value)\n{\n const TensorFieldValue *rhs =\n Identifiable::cast<const TensorFieldValue *>(&value);\n if (rhs != nullptr) {\n *this = *rhs;\n } else {\n return FieldValue::assign(value);\n }\n return *this;\n}\n\n\nvoid\nTensorFieldValue::assignDeserialized(std::unique_ptr<vespalib::eval::Value> rhs)\n{\n if (!rhs || _dataType.isAssignableType(rhs->type())) {\n _tensor = std::move(rhs);\n _altered = false; \/\/ Serialized form already exists\n } else {\n throw WrongTensorTypeException(makeWrongTensorTypeMsg(_dataType.getTensorType(), rhs->type()), VESPA_STRLOC);\n }\n}\n\n\nint\nTensorFieldValue::compare(const FieldValue &other) const\n{\n if (this == &other) {\n return 0;\t\/\/ same identity\n }\n int diff = FieldValue::compare(other);\n if (diff != 0) {\n return diff; \/\/ field type mismatch\n }\n const TensorFieldValue & rhs(static_cast<const TensorFieldValue &>(other));\n if (!_tensor) {\n return (rhs._tensor ? -1 : 0);\n }\n if (!rhs._tensor) {\n return 1;\n }\n \/\/ equal pointers always means identical\n if (_tensor.get() == rhs._tensor.get()) {\n return 0;\n }\n \/\/ compare just the type first:\n auto lhs_type = _tensor->type().to_spec();\n auto rhs_type = rhs._tensor->type().to_spec();\n int type_cmp = lhs_type.compare(rhs_type);\n if (type_cmp != 0) {\n return type_cmp;\n }\n \/\/ Compare the actual tensors by converting to TensorSpec strings.\n \/\/ TODO: this can be very slow, check if it might be used for anything\n \/\/ performance-critical.\n auto lhs_spec = spec_from_value(*_tensor).to_string();\n auto rhs_spec = spec_from_value(*rhs._tensor).to_string();\n return lhs_spec.compare(rhs_spec);\n}\n\nIMPLEMENT_IDENTIFIABLE(TensorFieldValue, FieldValue);\n\n} \/\/ document\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file persistentConnection.cc\n * @author Konrad Zemek\n * @copyright (C) 2015 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in\n * 'LICENSE.txt'\n *\/\n\n#include \"persistentConnection.h\"\n\n#include \"exception.h\"\n#include \"logging.h\"\n\n#include <asio.hpp>\n#include <asio\/ip\/tcp.hpp>\n#include <asio\/steady_timer.hpp>\n#include <openssl\/ssl.h>\n\n#include <future>\n\nusing namespace std::placeholders;\nusing namespace std::literals;\n\nnamespace one {\nnamespace communication {\n\nPersistentConnection::PersistentConnection(std::string host,\n const unsigned short port, asio::ssl::context &context,\n std::function<void(std::string)> onMessage,\n std::function<void(PersistentConnection &)> onReady,\n std::function<std::string()> getHandshake,\n std::function<std::error_code(std::string)> onHandshakeResponse,\n std::function<void(std::error_code)> onHandshakeDone)\n : m_host{std::move(host)}\n , m_port{port}\n , m_context{context}\n , m_onMessage{std::move(onMessage)}\n , m_onReady{std::move(onReady)}\n , m_getHandshake{std::move(getHandshake)}\n , m_onHandshakeResponse{std::move(onHandshakeResponse)}\n , m_callback{std::move(onHandshakeDone)}\n{\n}\n\nPersistentConnection::~PersistentConnection() { close(); }\n\nvoid PersistentConnection::connect()\n{\n m_socket = std::make_shared<etls::TLSSocket>(m_app, m_context);\n m_socket->connectAsync(m_socket, m_host, m_port,\n createCallback<etls::TLSSocket::Ptr>([=](auto) { this->onConnect(); }));\n}\n\nvoid PersistentConnection::onConnect()\n{\n if (!m_getHandshake) {\n start();\n return;\n }\n\n auto buffer = prepareOutBuffer(m_getHandshake());\n m_socket->sendAsync(\n m_socket, buffer, createCallback([=] { onHandshakeSent(); }));\n}\n\nvoid PersistentConnection::onHandshakeSent()\n{\n asyncRead([=](auto) { this->onHandshakeReceived(); });\n}\n\nvoid PersistentConnection::onHandshakeReceived()\n{\n std::error_code ec;\n if (m_onHandshakeResponse)\n ec = m_onHandshakeResponse(std::move(m_inData));\n\n if (ec)\n onError(ec);\n else\n start();\n}\n\nvoid PersistentConnection::onSent()\n{\n notify();\n m_onReady(*this);\n}\n\nvoid PersistentConnection::onError(const std::error_code &ec1)\n{\n m_recreateTimer.expires_at(\n std::chrono::steady_clock::now() + RECREATE_DELAY);\n\n m_recreateTimer.async_wait([this](auto ec2) {\n if (!ec2)\n this->connect();\n });\n\n notify(ec1);\n close();\n}\n\nvoid PersistentConnection::send(std::string message, Callback callback)\n{\n asio::post(m_app.ioService(), [\n =,\n message = std::move(message),\n callback = std::move(callback)\n ]() mutable {\n auto socket = getSocket();\n if (!m_connected || !socket) {\n callback(asio::error::not_connected);\n return;\n }\n\n m_callback = std::move(callback);\n auto buffer = prepareOutBuffer(std::move(message));\n socket->sendAsync(socket, buffer, createCallback([=] { onSent(); }));\n });\n}\n\nstd::array<asio::const_buffer, 2> PersistentConnection::prepareOutBuffer(\n std::string message)\n{\n m_outHeader = htonl(message.size());\n m_outData = std::move(message);\n return {{headerToBuffer(m_outHeader), asio::buffer(m_outData)}};\n}\n\nvoid PersistentConnection::readLoop()\n{\n asyncRead([=](asio::mutable_buffer) {\n m_onMessage(std::move(m_inData));\n readLoop();\n });\n}\n\nvoid PersistentConnection::close()\n{\n if (!m_socket)\n return;\n\n ++m_connectionId;\n m_connected = false;\n\n auto socket = std::atomic_exchange(&m_socket, {});\n socket->closeAsync(socket, {[=] {}, [=](auto) {}});\n}\n\nvoid PersistentConnection::notify(const std::error_code &ec)\n{\n if (m_callback) {\n decltype(m_callback) callback;\n std::swap(callback, m_callback);\n callback(ec);\n }\n if (!m_connected && m_onHandshakeDone) {\n m_onHandshakeDone(ec);\n }\n}\n\nvoid PersistentConnection::start()\n{\n notify();\n m_connected = true;\n readLoop();\n m_onReady(*this);\n}\n\netls::TLSSocket::Ptr PersistentConnection::getSocket()\n{\n return std::atomic_load(&m_socket);\n}\n\ntemplate <typename... Args, typename SF>\netls::Callback<Args...> PersistentConnection::createCallback(SF &&onSuccess)\n{\n const int connectionId = m_connectionId;\n\n auto wrappedSuccess = [ =, onSuccess = std::forward<SF>(onSuccess) ](\n Args && ... args) mutable\n {\n if (m_connectionId == connectionId)\n onSuccess(std::forward<Args>(args)...);\n };\n\n auto wrappedError = [=](const std::error_code &ec) {\n if (m_connectionId == connectionId)\n onError(ec);\n };\n\n return {std::move(wrappedSuccess), std::move(wrappedError)};\n}\n\ntemplate <typename SF> void PersistentConnection::asyncRead(SF &&onSuccess)\n{\n auto onHeaderSuccess = [ =, onSuccess = std::forward<SF>(onSuccess) ](\n asio::mutable_buffer) mutable\n {\n const std::size_t size = ntohl(m_inHeader);\n m_inData.resize(size);\n\n if (auto socket = getSocket())\n socket->recvAsync(socket, asio::buffer(m_inData),\n createCallback<asio::mutable_buffer>(std::move(onSuccess)));\n };\n\n if (auto socket = getSocket())\n socket->recvAsync(socket, headerToBuffer(m_inHeader),\n createCallback<asio::mutable_buffer>(std::move(onHeaderSuccess)));\n}\n\nasio::mutable_buffers_1 PersistentConnection::headerToBuffer(\n std::uint32_t &header)\n{\n return {static_cast<void *>(&header), sizeof(header)};\n}\n\nstd::unique_ptr<Connection> createConnection(std::string host,\n const unsigned short port, asio::ssl::context &context,\n std::function<void(std::string)> onMessage,\n std::function<void(Connection &)> onReady,\n std::function<std::string()> getHandshake,\n std::function<std::error_code(std::string)> onHandshakeResponse,\n std::function<void(std::error_code)> onHandshakeDone)\n{\n return std::make_unique<PersistentConnection>(std::move(host), port,\n context, std::move(onMessage), std::move(onReady),\n std::move(getHandshake), std::move(onHandshakeResponse),\n std::move(onHandshakeDone));\n}\n\n} \/\/ namespace communication\n} \/\/ namespace one\n<commit_msg>Fix adding message size twice to the tpc message in connection layer during retry.<commit_after>\/**\n * @file persistentConnection.cc\n * @author Konrad Zemek\n * @copyright (C) 2015 ACK CYFRONET AGH\n * @copyright This software is released under the MIT license cited in\n * 'LICENSE.txt'\n *\/\n\n#include \"persistentConnection.h\"\n\n#include \"exception.h\"\n#include \"logging.h\"\n\n#include <asio.hpp>\n#include <asio\/ip\/tcp.hpp>\n#include <asio\/steady_timer.hpp>\n#include <openssl\/ssl.h>\n\n#include <future>\n\nusing namespace std::placeholders;\nusing namespace std::literals;\n\nnamespace one {\nnamespace communication {\n\nPersistentConnection::PersistentConnection(std::string host,\n const unsigned short port, asio::ssl::context &context,\n std::function<void(std::string)> onMessage,\n std::function<void(PersistentConnection &)> onReady,\n std::function<std::string()> getHandshake,\n std::function<std::error_code(std::string)> onHandshakeResponse,\n std::function<void(std::error_code)> onHandshakeDone)\n : m_host{std::move(host)}\n , m_port{port}\n , m_context{context}\n , m_onMessage{std::move(onMessage)}\n , m_onReady{std::move(onReady)}\n , m_getHandshake{std::move(getHandshake)}\n , m_onHandshakeResponse{std::move(onHandshakeResponse)}\n , m_callback{std::move(onHandshakeDone)}\n{\n}\n\nPersistentConnection::~PersistentConnection() { close(); }\n\nvoid PersistentConnection::connect()\n{\n m_socket = std::make_shared<etls::TLSSocket>(m_app, m_context);\n m_socket->connectAsync(m_socket, m_host, m_port,\n createCallback<etls::TLSSocket::Ptr>([=](auto) { this->onConnect(); }));\n}\n\nvoid PersistentConnection::onConnect()\n{\n if (!m_getHandshake) {\n start();\n return;\n }\n\n auto buffer = prepareOutBuffer(m_getHandshake());\n m_socket->sendAsync(\n m_socket, buffer, createCallback([=] { onHandshakeSent(); }));\n}\n\nvoid PersistentConnection::onHandshakeSent()\n{\n asyncRead([=](auto) { this->onHandshakeReceived(); });\n}\n\nvoid PersistentConnection::onHandshakeReceived()\n{\n std::error_code ec;\n if (m_onHandshakeResponse)\n ec = m_onHandshakeResponse(std::move(m_inData));\n\n if (ec)\n onError(ec);\n else\n start();\n}\n\nvoid PersistentConnection::onSent()\n{\n notify();\n m_onReady(*this);\n}\n\nvoid PersistentConnection::onError(const std::error_code &ec1)\n{\n m_recreateTimer.expires_at(\n std::chrono::steady_clock::now() + RECREATE_DELAY);\n\n m_recreateTimer.async_wait([this](auto ec2) {\n if (!ec2)\n this->connect();\n });\n\n notify(ec1);\n close();\n}\n\nvoid PersistentConnection::send(std::string message, Callback callback)\n{\n asio::post(m_app.ioService(), [\n =,\n message = std::move(message),\n callback = std::move(callback)\n ]() mutable {\n auto socket = getSocket();\n if (!m_connected || !socket) {\n callback(asio::error::not_connected);\n return;\n }\n\n m_callback = std::move(callback);\n auto buffer = prepareOutBuffer(message);\n socket->sendAsync(socket, buffer, createCallback([=] { onSent(); }));\n });\n}\n\nstd::array<asio::const_buffer, 2> PersistentConnection::prepareOutBuffer(\n std::string message)\n{\n m_outHeader = htonl(message.size());\n m_outData = std::move(message);\n return {{headerToBuffer(m_outHeader), asio::buffer(m_outData)}};\n}\n\nvoid PersistentConnection::readLoop()\n{\n asyncRead([=](asio::mutable_buffer) {\n m_onMessage(std::move(m_inData));\n readLoop();\n });\n}\n\nvoid PersistentConnection::close()\n{\n if (!m_socket)\n return;\n\n ++m_connectionId;\n m_connected = false;\n\n auto socket = std::atomic_exchange(&m_socket, {});\n socket->closeAsync(socket, {[=] {}, [=](auto) {}});\n}\n\nvoid PersistentConnection::notify(const std::error_code &ec)\n{\n if (m_callback) {\n decltype(m_callback) callback;\n std::swap(callback, m_callback);\n callback(ec);\n }\n if (!m_connected && m_onHandshakeDone) {\n m_onHandshakeDone(ec);\n }\n}\n\nvoid PersistentConnection::start()\n{\n notify();\n m_connected = true;\n readLoop();\n m_onReady(*this);\n}\n\netls::TLSSocket::Ptr PersistentConnection::getSocket()\n{\n return std::atomic_load(&m_socket);\n}\n\ntemplate <typename... Args, typename SF>\netls::Callback<Args...> PersistentConnection::createCallback(SF &&onSuccess)\n{\n const int connectionId = m_connectionId;\n\n auto wrappedSuccess = [ =, onSuccess = std::forward<SF>(onSuccess) ](\n Args && ... args) mutable\n {\n if (m_connectionId == connectionId)\n onSuccess(std::forward<Args>(args)...);\n };\n\n auto wrappedError = [=](const std::error_code &ec) {\n if (m_connectionId == connectionId)\n onError(ec);\n };\n\n return {std::move(wrappedSuccess), std::move(wrappedError)};\n}\n\ntemplate <typename SF> void PersistentConnection::asyncRead(SF &&onSuccess)\n{\n auto onHeaderSuccess = [ =, onSuccess = std::forward<SF>(onSuccess) ](\n asio::mutable_buffer) mutable\n {\n const std::size_t size = ntohl(m_inHeader);\n m_inData.resize(size);\n\n if (auto socket = getSocket())\n socket->recvAsync(socket, asio::buffer(m_inData),\n createCallback<asio::mutable_buffer>(std::move(onSuccess)));\n };\n\n if (auto socket = getSocket())\n socket->recvAsync(socket, headerToBuffer(m_inHeader),\n createCallback<asio::mutable_buffer>(std::move(onHeaderSuccess)));\n}\n\nasio::mutable_buffers_1 PersistentConnection::headerToBuffer(\n std::uint32_t &header)\n{\n return {static_cast<void *>(&header), sizeof(header)};\n}\n\nstd::unique_ptr<Connection> createConnection(std::string host,\n const unsigned short port, asio::ssl::context &context,\n std::function<void(std::string)> onMessage,\n std::function<void(Connection &)> onReady,\n std::function<std::string()> getHandshake,\n std::function<std::error_code(std::string)> onHandshakeResponse,\n std::function<void(std::error_code)> onHandshakeDone)\n{\n return std::make_unique<PersistentConnection>(std::move(host), port,\n context, std::move(onMessage), std::move(onReady),\n std::move(getHandshake), std::move(onHandshakeResponse),\n std::move(onHandshakeDone));\n}\n\n} \/\/ namespace communication\n} \/\/ namespace one\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * A VirtualEndpoint is a representation of an AllJoyn endpoint that exists behind a remote\n * AllJoyn daemon.\n *\/\n\n\/******************************************************************************\n * Copyright (c) 2009-2012, AllSeen Alliance. All rights reserved.\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n ******************************************************************************\/\n\n#include <qcc\/platform.h>\n#include <qcc\/String.h>\n#include <qcc\/StringUtil.h>\n\n#include <vector>\n\n#include <alljoyn\/Message.h>\n\n#include \"VirtualEndpoint.h\"\n#include \"EndpointHelper.h\"\n\n#include <alljoyn\/Status.h>\n\n#define QCC_MODULE \"ALLJOYN_OBJ\"\n\nusing namespace std;\nusing namespace qcc;\n\nnamespace ajn {\n\n_VirtualEndpoint::_VirtualEndpoint(const String& uniqueName, RemoteEndpoint& b2bEp) :\n _BusEndpoint(ENDPOINT_TYPE_VIRTUAL),\n m_uniqueName(uniqueName),\n m_hasRefs(false),\n m_epState(EP_STARTED)\n{\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(0, b2bEp));\n}\n\nQStatus _VirtualEndpoint::PushMessage(Message& msg)\n{\n return PushMessage(msg, msg->GetSessionId());\n}\n\nQStatus _VirtualEndpoint::PushMessage(Message& msg, SessionId id)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::PushMessage(this=%s [%x], SessionId=%u)\", GetUniqueName().c_str(), this, id));\n\n QStatus status = ER_BUS_NO_ROUTE;\n vector<RemoteEndpoint> tryEndpoints;\n \/*\n * There may be multiple routes from this virtual endpoint so we are going to try all of\n * them until we either succeed or run out of options.\n *\/\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n multimap<SessionId, RemoteEndpoint>::iterator it = (id == 0) ? m_b2bEndpoints.begin() : m_b2bEndpoints.lower_bound(id);\n while ((it != m_b2bEndpoints.end()) && (id == it->first)) {\n RemoteEndpoint ep = it->second;\n tryEndpoints.push_back(ep);\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n \/*\n * We got the candidates so now try them all.\n *\/\n for (vector<RemoteEndpoint>::iterator iter = tryEndpoints.begin(); iter != tryEndpoints.end(); ++iter) {\n if (status != ER_OK) {\n status = (*iter)->PushMessage(msg);\n }\n }\n return status;\n}\n\nRemoteEndpoint _VirtualEndpoint::GetBusToBusEndpoint(SessionId sessionId, int* b2bCount) const\n{\n RemoteEndpoint ret;\n if (b2bCount) {\n *b2bCount = 0;\n }\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.lower_bound(sessionId);\n while ((it != m_b2bEndpoints.end()) && (it->first == sessionId)) {\n if (!ret->IsValid()) {\n ret = it->second;\n }\n if (b2bCount) {\n (*b2bCount)++;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return ret;\n}\n\nbool _VirtualEndpoint::AddBusToBusEndpoint(RemoteEndpoint& endpoint)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddBusToBusEndpoint(this=%s, b2b=%s)\", GetUniqueName().c_str(), endpoint->GetUniqueName().c_str()));\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* Sanity check *\/\n assert(m_epState == EP_STARTED);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n bool found = false;\n while ((it != m_b2bEndpoints.end()) && (it->first == 0)) {\n if (it->second == endpoint) {\n found = true;\n break;\n }\n ++it;\n }\n if (!found) {\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(0, endpoint));\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return !found;\n}\n\nvoid _VirtualEndpoint::GetSessionIdsForB2B(RemoteEndpoint& endpoint, set<SessionId>& sessionIds)\n{\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (it->first && (it->second == endpoint)) {\n sessionIds.insert(it->first);\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n}\n\nbool _VirtualEndpoint::RemoveBusToBusEndpoint(RemoteEndpoint& endpoint)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::RemoveBusToBusEndpoint(this=%s, b2b=%s)\", GetUniqueName().c_str(), endpoint->GetUniqueName().c_str()));\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (it->second == endpoint) {\n \/* A non-zero session means that the b2b has one less ref *\/\n if (it->first != 0) {\n it->second->DecrementRef();\n }\n m_b2bEndpoints.erase(it++);\n } else {\n ++it;\n }\n }\n\n \/*\n * This Virtual endpoint reports itself as empty (of b2b endpoints) when any of the following are true:\n * 1) The last b2b ep is being removed.\n * 2) A last session route through this vep is being removed and the b2bEp being removed doesnt connect to the same\n * remote daemon as a different b2bEp in the vep.\n *\n * This algorithm allows for cleanup of the following triangular routing problem:\n * - Device A connects to device B\n * - Device A connects to device C\n * - Device B connects to device C\n * - At this point, each device has a vep for A with 2 b2bEps.\n * - Now device A leaves the bus.\n * - B knows to remove the direct B2BEp to A but it (would otherwise) think it can still reach A through C\n * - C knows to remove the direct B2bEp to A but it (would otherwise) think it can still reach A through B\n * This algorithm solves this problem by removing the veps when they no longer route for any session AND\n * when they are suseptible to the triangular route problem.\n *\/\n bool isEmpty;\n if (m_hasRefs) {\n isEmpty = (m_b2bEndpoints.lower_bound(1) == m_b2bEndpoints.end());\n if (isEmpty) {\n const qcc::GUID128& guid = endpoint->GetRemoteGUID();\n it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (it->second->GetRemoteGUID() == guid) {\n isEmpty = false;\n break;\n }\n ++it;\n }\n }\n } else {\n isEmpty = m_b2bEndpoints.empty();\n }\n if (isEmpty) {\n \/* The last b2b endpoint has been removed from this virtual endpoint. Set the state to STOPPING. *\/\n m_epState = EP_STOPPING;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isEmpty;\n}\n\nQStatus _VirtualEndpoint::AddSessionRef(SessionId id, RemoteEndpoint& b2bEp)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddSessionRef(this=%s [%x], id=%u, b2b=%s)\", GetUniqueName().c_str(), this, id, b2bEp->GetUniqueName().c_str()));\n\n assert(id != 0);\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* Sanity check. Make sure b2bEp is connected to this virtual ep (with sessionId == 0) *\/\n bool canUse = CanUseRoute(b2bEp);\n if (canUse) {\n \/* Increment b2bEp ref *\/\n b2bEp->IncrementRef();\n \/* Map sessionId to b2bEp *\/\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(id, b2bEp));\n m_hasRefs = true;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return canUse ? ER_OK : ER_BUS_NO_ENDPOINT;\n}\n\nQStatus _VirtualEndpoint::AddSessionRef(SessionId id, SessionOpts* opts, RemoteEndpoint& b2bEp)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddSessionRef(this=%s [%x], %u, <opts>, %s)\", GetUniqueName().c_str(), this, id, b2bEp->GetUniqueName().c_str()));\n\n RemoteEndpoint bestEp;\n \/\/uint32_t hops = 1000;\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* TODO: Placeholder until we exchange session opts and hop count via ExchangeNames *\/\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.find(id);\n if (it == m_b2bEndpoints.end()) {\n it = m_b2bEndpoints.begin();\n }\n if ((it != m_b2bEndpoints.end()) && ((it->first == 0) || it->first == id)) {\n bestEp = it->second;\n }\n\n \/* Map session id to bestEp *\/\n if (bestEp->IsValid()) {\n AddSessionRef(id, bestEp);\n }\n b2bEp = bestEp;\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return bestEp->IsValid() ? ER_OK : ER_BUS_NO_ENDPOINT;\n}\n\nvoid _VirtualEndpoint::RemoveSessionRef(SessionId id)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::RemoveSessionRef(this=%s [%x], id=%u)\", GetUniqueName().c_str(), this, id));\n assert(id != 0);\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.find(id);\n if (it != m_b2bEndpoints.end()) {\n it->second->DecrementRef();\n m_b2bEndpoints.erase(it);\n } else {\n QCC_DbgPrintf((\"_VirtualEndpoint::RemoveSessionRef: vep=%s failed to find session = %u\", m_uniqueName.c_str(), id));\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n}\n\nbool _VirtualEndpoint::CanUseRoute(const RemoteEndpoint& b2bEndpoint) const\n{\n bool isFound = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.begin();\n while ((it != m_b2bEndpoints.end()) && (it->first == 0)) {\n if (it->second == b2bEndpoint) {\n isFound = true;\n break;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isFound;\n}\n\nbool _VirtualEndpoint::CanUseRoutes(const multiset<String>& b2bNameSet) const\n{\n bool isFound = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multiset<String>::const_iterator nit = b2bNameSet.begin();\n while (nit != b2bNameSet.end()) {\n multimap<SessionId, RemoteEndpoint>::const_iterator eit = m_b2bEndpoints.begin();\n while (eit != m_b2bEndpoints.end()) {\n String n = eit->second->GetUniqueName();\n if (*nit == n) {\n isFound = true;\n break;\n }\n ++eit;\n }\n if (isFound) {\n break;\n }\n ++nit;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isFound;\n}\n\nbool _VirtualEndpoint::CanRouteWithout(const qcc::GUID128& guid) const\n{\n bool canRoute = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (guid != it->second->GetRemoteGUID()) {\n canRoute = true;\n break;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return canRoute;\n}\n\n}\n<commit_msg>AJCORE-820 Virtual endpoint containing a b2b ep with a matching remote GUID is not empty.<commit_after>\/**\n * @file\n * A VirtualEndpoint is a representation of an AllJoyn endpoint that exists behind a remote\n * AllJoyn daemon.\n *\/\n\n\/******************************************************************************\n * Copyright (c) 2009-2014, AllSeen Alliance. All rights reserved.\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n ******************************************************************************\/\n\n#include <qcc\/platform.h>\n#include <qcc\/String.h>\n#include <qcc\/StringUtil.h>\n\n#include <vector>\n\n#include <alljoyn\/Message.h>\n\n#include \"VirtualEndpoint.h\"\n#include \"EndpointHelper.h\"\n\n#include <alljoyn\/Status.h>\n\n#define QCC_MODULE \"ALLJOYN_OBJ\"\n\nusing namespace std;\nusing namespace qcc;\n\nnamespace ajn {\n\n_VirtualEndpoint::_VirtualEndpoint(const String& uniqueName, RemoteEndpoint& b2bEp) :\n _BusEndpoint(ENDPOINT_TYPE_VIRTUAL),\n m_uniqueName(uniqueName),\n m_hasRefs(false),\n m_epState(EP_STARTED)\n{\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(0, b2bEp));\n}\n\nQStatus _VirtualEndpoint::PushMessage(Message& msg)\n{\n return PushMessage(msg, msg->GetSessionId());\n}\n\nQStatus _VirtualEndpoint::PushMessage(Message& msg, SessionId id)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::PushMessage(this=%s [%x], SessionId=%u)\", GetUniqueName().c_str(), this, id));\n\n QStatus status = ER_BUS_NO_ROUTE;\n vector<RemoteEndpoint> tryEndpoints;\n \/*\n * There may be multiple routes from this virtual endpoint so we are going to try all of\n * them until we either succeed or run out of options.\n *\/\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n multimap<SessionId, RemoteEndpoint>::iterator it = (id == 0) ? m_b2bEndpoints.begin() : m_b2bEndpoints.lower_bound(id);\n while ((it != m_b2bEndpoints.end()) && (id == it->first)) {\n RemoteEndpoint ep = it->second;\n tryEndpoints.push_back(ep);\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n \/*\n * We got the candidates so now try them all.\n *\/\n for (vector<RemoteEndpoint>::iterator iter = tryEndpoints.begin(); iter != tryEndpoints.end(); ++iter) {\n if (status != ER_OK) {\n status = (*iter)->PushMessage(msg);\n }\n }\n return status;\n}\n\nRemoteEndpoint _VirtualEndpoint::GetBusToBusEndpoint(SessionId sessionId, int* b2bCount) const\n{\n RemoteEndpoint ret;\n if (b2bCount) {\n *b2bCount = 0;\n }\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.lower_bound(sessionId);\n while ((it != m_b2bEndpoints.end()) && (it->first == sessionId)) {\n if (!ret->IsValid()) {\n ret = it->second;\n }\n if (b2bCount) {\n (*b2bCount)++;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return ret;\n}\n\nbool _VirtualEndpoint::AddBusToBusEndpoint(RemoteEndpoint& endpoint)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddBusToBusEndpoint(this=%s, b2b=%s)\", GetUniqueName().c_str(), endpoint->GetUniqueName().c_str()));\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* Sanity check *\/\n assert(m_epState == EP_STARTED);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n bool found = false;\n while ((it != m_b2bEndpoints.end()) && (it->first == 0)) {\n if (it->second == endpoint) {\n found = true;\n break;\n }\n ++it;\n }\n if (!found) {\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(0, endpoint));\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return !found;\n}\n\nvoid _VirtualEndpoint::GetSessionIdsForB2B(RemoteEndpoint& endpoint, set<SessionId>& sessionIds)\n{\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (it->first && (it->second == endpoint)) {\n sessionIds.insert(it->first);\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n}\n\nbool _VirtualEndpoint::RemoveBusToBusEndpoint(RemoteEndpoint& endpoint)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::RemoveBusToBusEndpoint(this=%s, b2b=%s)\", GetUniqueName().c_str(), endpoint->GetUniqueName().c_str()));\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (it->second == endpoint) {\n \/* A non-zero session means that the b2b has one less ref *\/\n if (it->first != 0) {\n it->second->DecrementRef();\n }\n m_b2bEndpoints.erase(it++);\n } else {\n ++it;\n }\n }\n\n \/*\n * This Virtual endpoint reports itself as empty (of b2b endpoints) when any of the following are true:\n * 1) The last b2b ep is being removed.\n * 2) A last session route through this vep is being removed and the b2bEp being removed doesnt connect to the same\n * remote daemon as a different b2bEp in the vep.\n *\n * This algorithm allows for cleanup of the following triangular routing problem:\n * - Device A connects to device B\n * - Device A connects to device C\n * - Device B connects to device C\n * - At this point, each device has a vep for A with 2 b2bEps.\n * - Now device A leaves the bus.\n * - B knows to remove the direct B2BEp to A but it (would otherwise) think it can still reach A through C\n * - C knows to remove the direct B2bEp to A but it (would otherwise) think it can still reach A through B\n * This algorithm solves this problem by removing the veps when they no longer route for any session AND\n * when they are suseptible to the triangular route problem.\n *\/\n bool isEmpty;\n if (m_hasRefs) {\n isEmpty = (m_b2bEndpoints.lower_bound(1) == m_b2bEndpoints.end());\n size_t pos = GetUniqueName().find_first_of(\".\");\n String vepGUID = GetUniqueName().substr(1, pos - 1);\n if (isEmpty) {\n const qcc::GUID128& guid = endpoint->GetRemoteGUID();\n it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n \/* If the endpoint going away has the same remote GUID as another one in the m_b2bEndpoints map OR\n * If the Remote guid of a endpoint in the m_b2bEndpoints map is the same as the VirtualEndpoint GUID:\n * then this Virtual endpoint is still valid.\n *\/\n if ((it->second->GetRemoteGUID() == guid) || (it->second->GetRemoteGUID().ToShortString() == vepGUID)) {\n isEmpty = false;\n break;\n }\n ++it;\n }\n }\n } else {\n isEmpty = m_b2bEndpoints.empty();\n }\n if (isEmpty) {\n \/* The last b2b endpoint has been removed from this virtual endpoint. Set the state to STOPPING. *\/\n m_epState = EP_STOPPING;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isEmpty;\n}\n\nQStatus _VirtualEndpoint::AddSessionRef(SessionId id, RemoteEndpoint& b2bEp)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddSessionRef(this=%s [%x], id=%u, b2b=%s)\", GetUniqueName().c_str(), this, id, b2bEp->GetUniqueName().c_str()));\n\n assert(id != 0);\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* Sanity check. Make sure b2bEp is connected to this virtual ep (with sessionId == 0) *\/\n bool canUse = CanUseRoute(b2bEp);\n if (canUse) {\n \/* Increment b2bEp ref *\/\n b2bEp->IncrementRef();\n \/* Map sessionId to b2bEp *\/\n m_b2bEndpoints.insert(pair<SessionId, RemoteEndpoint>(id, b2bEp));\n m_hasRefs = true;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return canUse ? ER_OK : ER_BUS_NO_ENDPOINT;\n}\n\nQStatus _VirtualEndpoint::AddSessionRef(SessionId id, SessionOpts* opts, RemoteEndpoint& b2bEp)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::AddSessionRef(this=%s [%x], %u, <opts>, %s)\", GetUniqueName().c_str(), this, id, b2bEp->GetUniqueName().c_str()));\n\n RemoteEndpoint bestEp;\n \/\/uint32_t hops = 1000;\n\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n\n \/* TODO: Placeholder until we exchange session opts and hop count via ExchangeNames *\/\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.find(id);\n if (it == m_b2bEndpoints.end()) {\n it = m_b2bEndpoints.begin();\n }\n if ((it != m_b2bEndpoints.end()) && ((it->first == 0) || it->first == id)) {\n bestEp = it->second;\n }\n\n \/* Map session id to bestEp *\/\n if (bestEp->IsValid()) {\n AddSessionRef(id, bestEp);\n }\n b2bEp = bestEp;\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return bestEp->IsValid() ? ER_OK : ER_BUS_NO_ENDPOINT;\n}\n\nvoid _VirtualEndpoint::RemoveSessionRef(SessionId id)\n{\n QCC_DbgTrace((\"_VirtualEndpoint::RemoveSessionRef(this=%s [%x], id=%u)\", GetUniqueName().c_str(), this, id));\n assert(id != 0);\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::iterator it = m_b2bEndpoints.find(id);\n if (it != m_b2bEndpoints.end()) {\n it->second->DecrementRef();\n m_b2bEndpoints.erase(it);\n } else {\n QCC_DbgPrintf((\"_VirtualEndpoint::RemoveSessionRef: vep=%s failed to find session = %u\", m_uniqueName.c_str(), id));\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n}\n\nbool _VirtualEndpoint::CanUseRoute(const RemoteEndpoint& b2bEndpoint) const\n{\n bool isFound = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.begin();\n while ((it != m_b2bEndpoints.end()) && (it->first == 0)) {\n if (it->second == b2bEndpoint) {\n isFound = true;\n break;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isFound;\n}\n\nbool _VirtualEndpoint::CanUseRoutes(const multiset<String>& b2bNameSet) const\n{\n bool isFound = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multiset<String>::const_iterator nit = b2bNameSet.begin();\n while (nit != b2bNameSet.end()) {\n multimap<SessionId, RemoteEndpoint>::const_iterator eit = m_b2bEndpoints.begin();\n while (eit != m_b2bEndpoints.end()) {\n String n = eit->second->GetUniqueName();\n if (*nit == n) {\n isFound = true;\n break;\n }\n ++eit;\n }\n if (isFound) {\n break;\n }\n ++nit;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return isFound;\n}\n\nbool _VirtualEndpoint::CanRouteWithout(const qcc::GUID128& guid) const\n{\n bool canRoute = false;\n m_b2bEndpointsLock.Lock(MUTEX_CONTEXT);\n multimap<SessionId, RemoteEndpoint>::const_iterator it = m_b2bEndpoints.begin();\n while (it != m_b2bEndpoints.end()) {\n if (guid != it->second->GetRemoteGUID()) {\n canRoute = true;\n break;\n }\n ++it;\n }\n m_b2bEndpointsLock.Unlock(MUTEX_CONTEXT);\n return canRoute;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id: extract_indices.hpp 1897 2011-07-26 20:35:49Z rusu $\n *\n *\/\n\n#ifndef PCL_FILTERS_IMPL_CROP_BOX_H_\n#define PCL_FILTERS_IMPL_CROP_BOX_H_\n\n#include \"pcl\/filters\/crop_box.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT>\nvoid\npcl::CropBox<PointT>::applyFilter (PointCloud &output)\n{\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::CropBox<PointT>::applyFilter (std::vector<int> &indices)\n{\n\n indices.resize (input_->points.size ());\n int indice_count = 0;\n\n Eigen::Affine3f transform = Eigen::Affine3f::Identity();\n Eigen::Affine3f inverse_transform = Eigen::Affine3f::Identity();\n\n if (rotation_ != Eigen::Vector3f::Zero ())\n {\n pcl::getTransformation (0, 0, 0,\n rotation_ (0), rotation_ (1), rotation_ (2), transform);\n inverse_transform = transform.inverse();\n }\n\n for (size_t index = 0; index < indices_->size (); ++index)\n {\n \/\/ Get local point\n PointT local_pt = input_->points[(*indices_)[index]];\n\n \/\/ Transform point to world space\n if (!(transform_.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, transform_);\n\n if (translation_ != Eigen::Vector3f::Zero ())\n {\n local_pt.x -= translation_ (0);\n local_pt.y -= translation_ (1);\n local_pt.z -= translation_ (2);\n }\n\n \/\/ Transform point to local space of crop box\n if (!(inverse_transform.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, inverse_transform);\n\n if (local_pt.x < min_pt_[0] || local_pt.y < min_pt_[1] || local_pt.z < min_pt_[2])\n continue;\n if (local_pt.x > max_pt_[0] || local_pt.y > max_pt_[1] || local_pt.z > max_pt_[2])\n continue;\n\n indices[indice_count++] = (*indices_)[index];\n }\n indices.resize (indice_count);\n}\n\n#define PCL_INSTANTIATE_CropBox(T) template class PCL_EXPORTS pcl::CropBox<T>;\n\n#endif \/\/ PCL_FILTERS_IMPL_CROP_BOX_H_\n<commit_msg>crop_box filter now supports PointT point clouds<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2009, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id: extract_indices.hpp 1897 2011-07-26 20:35:49Z rusu $\n *\n *\/\n\n#ifndef PCL_FILTERS_IMPL_CROP_BOX_H_\n#define PCL_FILTERS_IMPL_CROP_BOX_H_\n\n#include \"pcl\/filters\/crop_box.h\"\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT>\nvoid\npcl::CropBox<PointT>::applyFilter (PointCloud &output)\n{\n output.resize (input_->points.size ());\n int indice_count = 0;\n\n Eigen::Affine3f transform = Eigen::Affine3f::Identity();\n Eigen::Affine3f inverse_transform = Eigen::Affine3f::Identity();\n\n if (rotation_ != Eigen::Vector3f::Zero ())\n {\n pcl::getTransformation (0, 0, 0,\n rotation_ (0), rotation_ (1), rotation_ (2),\n transform);\n inverse_transform = transform.inverse();\n }\n\n for (size_t index = 0; index < indices_->size (); ++index)\n {\n \/\/ Get local point\n PointT local_pt = input_->points[(*indices_)[index]];\n\n \/\/ Transform point to world space\n if (!(transform_.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, transform_);\n\n if (translation_ != Eigen::Vector3f::Zero ())\n {\n local_pt.x -= translation_ (0);\n local_pt.y -= translation_ (1);\n local_pt.z -= translation_ (2);\n }\n\n \/\/ Transform point to local space of crop box\n if (!(inverse_transform.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, inverse_transform);\n\n if (local_pt.x < min_pt_[0] || local_pt.y < min_pt_[1] || local_pt.z < min_pt_[2])\n continue;\n if (local_pt.x > max_pt_[0] || local_pt.y > max_pt_[1] || local_pt.z > max_pt_[2])\n continue;\n\n output.points[indice_count++] = input_->points[(*indices_)[index]];\n }\n output.resize (indice_count);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> void\npcl::CropBox<PointT>::applyFilter (std::vector<int> &indices)\n{\n indices.resize (input_->points.size ());\n int indice_count = 0;\n\n Eigen::Affine3f transform = Eigen::Affine3f::Identity();\n Eigen::Affine3f inverse_transform = Eigen::Affine3f::Identity();\n\n if (rotation_ != Eigen::Vector3f::Zero ())\n {\n pcl::getTransformation (0, 0, 0,\n rotation_ (0), rotation_ (1), rotation_ (2),\n transform);\n inverse_transform = transform.inverse();\n }\n\n for (size_t index = 0; index < indices_->size (); ++index)\n {\n \/\/ Get local point\n PointT local_pt = input_->points[(*indices_)[index]];\n\n \/\/ Transform point to world space\n if (!(transform_.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, transform_);\n\n if (translation_ != Eigen::Vector3f::Zero ())\n {\n local_pt.x -= translation_ (0);\n local_pt.y -= translation_ (1);\n local_pt.z -= translation_ (2);\n }\n\n \/\/ Transform point to local space of crop box\n if (!(inverse_transform.matrix().isIdentity()))\n local_pt = pcl::transformPoint<PointT> (local_pt, inverse_transform);\n\n if (local_pt.x < min_pt_[0] || local_pt.y < min_pt_[1] || local_pt.z < min_pt_[2])\n continue;\n if (local_pt.x > max_pt_[0] || local_pt.y > max_pt_[1] || local_pt.z > max_pt_[2])\n continue;\n\n indices[indice_count++] = (*indices_)[index];\n }\n indices.resize (indice_count);\n}\n\n#define PCL_INSTANTIATE_CropBox(T) template class PCL_EXPORTS pcl::CropBox<T>;\n\n#endif \/\/ PCL_FILTERS_IMPL_CROP_BOX_H_\n<|endoftext|>"} {"text":"<commit_before>#include <Poco\/Buffer.h>\n#include <Poco\/Clock.h>\n#include <Poco\/Logger.h>\n#include <Poco\/SharedPtr.h>\n#include <Poco\/JSON\/Object.h>\n#include <Poco\/Net\/HTTPServerRequestImpl.h>\n#include <Poco\/Net\/WebSocket.h>\n\n#include \"di\/Injectable.h\"\n#include \"gwmessage\/GWGatewayRegister.h\"\n#include \"gwmessage\/GWGatewayAccepted.h\"\n#include \"gws\/GWRequestHandler.h\"\n#include \"util\/Sanitize.h\"\n#include \"util\/ThreadNamer.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, GWRequestHandlerFactory)\nBEEEON_OBJECT_CASTABLE(WebSocketRequestHandlerFactory)\nBEEEON_OBJECT_PROPERTY(\"gatewayCommunicator\", &GWRequestHandlerFactory::setGatewayCommunicator)\nBEEEON_OBJECT_PROPERTY(\"maxMessageSize\", &GWRequestHandlerFactory::setMaxMessageSize)\nBEEEON_OBJECT_PROPERTY(\"gatewayService\", &GWRequestHandlerFactory::setGatewayService)\nBEEEON_OBJECT_PROPERTY(\"verifierFactory\", &GWRequestHandlerFactory::setVerifierFactory)\nBEEEON_OBJECT_END(BeeeOn, GWRequestHandlerFactory)\n\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::Net;\nusing namespace BeeeOn;\n\nGWRequestHandler::GWRequestHandler(\n\t\tsize_t maxMessageSize,\n\t\tGatewayCommunicator::Ptr communicator,\n\t\tGWSGatewayService::Ptr service,\n\t\tGatewayPeerVerifier::Ptr peerVerifier):\n\tm_maxMessageSize(maxMessageSize),\n\tm_gatewayCommunicator(communicator),\n\tm_gatewayService(service),\n\tm_peerVerifier(peerVerifier)\n{\n}\n\nvoid GWRequestHandler::handle(WebSocket &ws)\n{\n\tThreadNamer namer(\"ws-\" + ws.peerAddress().toString());\n\n\tPoco::Buffer<char> buffer(m_maxMessageSize);\n\tint flags;\n\n\tint ret = ws.receiveFrame(buffer.begin(), buffer.size(), flags);\n\tif (ret <= 0 || (flags & WebSocket::FRAME_OP_CLOSE)) {\n\t\tif (logger().warning()) {\n\t\t\tlogger().warning(ws.peerAddress().toString()\n\t\t\t\t+ \" connection immediately closed\",\n\t\t\t\t__FILE__, __LINE__);\n\t\t}\n\t\treturn;\n\t}\n\n\tlogger().information(\"connection from \"\n\t\t\t+ ws.peerAddress().toString(),\n\t\t\t__FILE__, __LINE__);\n\n\tprocessPayload(ws, {buffer.begin(), static_cast<size_t>(ret)});\n}\n\nvoid GWRequestHandler::processPayload(\n\t\tWebSocket &ws,\n\t\tconst string &data)\n{\n\tif (logger().trace())\n\t\tlogger().trace(data);\n\n\tGWMessage::Ptr msg = GWMessage::fromJSON(data);\n\tGWGatewayRegister::Ptr registerMsg = msg.cast<GWGatewayRegister>();\n\n\tif (registerMsg.isNull()) {\n\t\tlogger().warning(\"invalid message from \"\n\t\t\t+ ws.peerAddress().toString() + \":\\n\"\n\t\t\t+ msg->toString(),\n\t\t\t__FILE__, __LINE__);\n\t\treturn;\n\t}\n\n\tGateway gateway(registerMsg->gatewayID());\n\tm_peerVerifier->verifyPeer(gateway);\n\n\tThreadNamer namer(\"gws-register-\" + gateway);\n\n\tGatewayStatus status;\n\tstatus.setVersion(Sanitize::common(registerMsg->version()));\n\tstatus.setIPAddress(registerMsg->ipAddress());\n\n\tif (!m_gatewayService->registerGateway(status, gateway)) {\n\t\tlogger().error(\"failed to register gateway \"\n\t\t\t\t+ gateway, __FILE__, __LINE__);\n\t\treturn;\n\t}\n\n\tm_gatewayCommunicator->addGateway(gateway.id(), ws);\n\n\tconst auto &reply = GWGatewayAccepted().toString();\n\tws.sendFrame(reply.c_str(), reply.length());\n}\n\nGWRequestHandlerFactory::GWRequestHandlerFactory():\n\tm_maxMessageSize(256)\n{\n}\n\nvoid GWRequestHandlerFactory::setGatewayCommunicator(GatewayCommunicator::Ptr communicator)\n{\n\tm_gatewayCommunicator = communicator;\n}\n\nvoid GWRequestHandlerFactory::setGatewayService(GWSGatewayService::Ptr service)\n{\n\tm_gatewayService = service;\n}\n\nvoid GWRequestHandlerFactory::setVerifierFactory(SocketGatewayPeerVerifierFactory::Ptr factory)\n{\n\tm_verifierFactory = factory;\n}\n\nvoid GWRequestHandlerFactory::setMaxMessageSize(int size)\n{\n\tif (size < 0)\n\t\tthrow InvalidArgumentException(\"size must be non-negative\");\n\n\tm_maxMessageSize = size;\n}\n\nWebSocketRequestHandler *GWRequestHandlerFactory::createWSHandler(\n\tconst HTTPServerRequest &request)\n{\n\tGatewayPeerVerifier::Ptr verifier;\n\tconst HTTPServerRequestImpl *impl = nullptr;\n\n\timpl = dynamic_cast<const HTTPServerRequestImpl *>(&request);\n\tif (impl == nullptr) {\n\t\tthrow IllegalStateException(\n\t\t\t\"given request instance is not inherited from HTTPServerRequestImpl\");\n\t}\n\n\tverifier = m_verifierFactory->preverifyAndCreate(\n\t\t\tconst_cast<HTTPServerRequestImpl *>(impl)->socket());\n\n\treturn new GWRequestHandler(\n\t\tm_maxMessageSize,\n\t\tm_gatewayCommunicator,\n\t\tm_gatewayService,\n\t\tverifier\n\t);\n}\n<commit_msg>GWRequestHandler: log initial message in the standard way<commit_after>#include <Poco\/Buffer.h>\n#include <Poco\/Clock.h>\n#include <Poco\/Logger.h>\n#include <Poco\/SharedPtr.h>\n#include <Poco\/JSON\/Object.h>\n#include <Poco\/Net\/HTTPServerRequestImpl.h>\n#include <Poco\/Net\/WebSocket.h>\n\n#include \"di\/Injectable.h\"\n#include \"gwmessage\/GWGatewayRegister.h\"\n#include \"gwmessage\/GWGatewayAccepted.h\"\n#include \"gws\/GWRequestHandler.h\"\n#include \"util\/Sanitize.h\"\n#include \"util\/ThreadNamer.h\"\n\nBEEEON_OBJECT_BEGIN(BeeeOn, GWRequestHandlerFactory)\nBEEEON_OBJECT_CASTABLE(WebSocketRequestHandlerFactory)\nBEEEON_OBJECT_PROPERTY(\"gatewayCommunicator\", &GWRequestHandlerFactory::setGatewayCommunicator)\nBEEEON_OBJECT_PROPERTY(\"maxMessageSize\", &GWRequestHandlerFactory::setMaxMessageSize)\nBEEEON_OBJECT_PROPERTY(\"gatewayService\", &GWRequestHandlerFactory::setGatewayService)\nBEEEON_OBJECT_PROPERTY(\"verifierFactory\", &GWRequestHandlerFactory::setVerifierFactory)\nBEEEON_OBJECT_END(BeeeOn, GWRequestHandlerFactory)\n\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::Net;\nusing namespace BeeeOn;\n\nGWRequestHandler::GWRequestHandler(\n\t\tsize_t maxMessageSize,\n\t\tGatewayCommunicator::Ptr communicator,\n\t\tGWSGatewayService::Ptr service,\n\t\tGatewayPeerVerifier::Ptr peerVerifier):\n\tm_maxMessageSize(maxMessageSize),\n\tm_gatewayCommunicator(communicator),\n\tm_gatewayService(service),\n\tm_peerVerifier(peerVerifier)\n{\n}\n\nvoid GWRequestHandler::handle(WebSocket &ws)\n{\n\tThreadNamer namer(\"ws-\" + ws.peerAddress().toString());\n\n\tPoco::Buffer<char> buffer(m_maxMessageSize);\n\tint flags;\n\n\tint ret = ws.receiveFrame(buffer.begin(), buffer.size(), flags);\n\tif (ret <= 0 || (flags & WebSocket::FRAME_OP_CLOSE)) {\n\t\tif (logger().warning()) {\n\t\t\tlogger().warning(ws.peerAddress().toString()\n\t\t\t\t+ \" connection immediately closed\",\n\t\t\t\t__FILE__, __LINE__);\n\t\t}\n\t\treturn;\n\t}\n\n\tlogger().information(\"connection from \"\n\t\t\t+ ws.peerAddress().toString(),\n\t\t\t__FILE__, __LINE__);\n\n\tprocessPayload(ws, {buffer.begin(), static_cast<size_t>(ret)});\n}\n\nvoid GWRequestHandler::processPayload(\n\t\tWebSocket &ws,\n\t\tconst string &data)\n{\n\tif (logger().trace()) {\n\t\tlogger().dump(\n\t\t\t\"initial frame of size \" + to_string(data.size()),\n\t\t\tdata.data(),\n\t\t\tdata.size(),\n\t\t\tMessage::PRIO_TRACE);\n\t}\n\telse if (logger().debug()) {\n\t\tlogger().debug(\n\t\t\t\"initial frame of size \" + to_string(data.size()),\n\t\t\t__FILE__, __LINE__);\n\t}\n\n\tGWMessage::Ptr msg = GWMessage::fromJSON(data);\n\tGWGatewayRegister::Ptr registerMsg = msg.cast<GWGatewayRegister>();\n\n\tif (registerMsg.isNull()) {\n\t\tlogger().warning(\"invalid message from \"\n\t\t\t+ ws.peerAddress().toString() + \":\\n\"\n\t\t\t+ msg->toString(),\n\t\t\t__FILE__, __LINE__);\n\t\treturn;\n\t}\n\n\tGateway gateway(registerMsg->gatewayID());\n\tm_peerVerifier->verifyPeer(gateway);\n\n\tThreadNamer namer(\"gws-register-\" + gateway);\n\n\tGatewayStatus status;\n\tstatus.setVersion(Sanitize::common(registerMsg->version()));\n\tstatus.setIPAddress(registerMsg->ipAddress());\n\n\tif (!m_gatewayService->registerGateway(status, gateway)) {\n\t\tlogger().error(\"failed to register gateway \"\n\t\t\t\t+ gateway, __FILE__, __LINE__);\n\t\treturn;\n\t}\n\n\tm_gatewayCommunicator->addGateway(gateway.id(), ws);\n\n\tconst auto &reply = GWGatewayAccepted().toString();\n\tws.sendFrame(reply.c_str(), reply.length());\n}\n\nGWRequestHandlerFactory::GWRequestHandlerFactory():\n\tm_maxMessageSize(256)\n{\n}\n\nvoid GWRequestHandlerFactory::setGatewayCommunicator(GatewayCommunicator::Ptr communicator)\n{\n\tm_gatewayCommunicator = communicator;\n}\n\nvoid GWRequestHandlerFactory::setGatewayService(GWSGatewayService::Ptr service)\n{\n\tm_gatewayService = service;\n}\n\nvoid GWRequestHandlerFactory::setVerifierFactory(SocketGatewayPeerVerifierFactory::Ptr factory)\n{\n\tm_verifierFactory = factory;\n}\n\nvoid GWRequestHandlerFactory::setMaxMessageSize(int size)\n{\n\tif (size < 0)\n\t\tthrow InvalidArgumentException(\"size must be non-negative\");\n\n\tm_maxMessageSize = size;\n}\n\nWebSocketRequestHandler *GWRequestHandlerFactory::createWSHandler(\n\tconst HTTPServerRequest &request)\n{\n\tGatewayPeerVerifier::Ptr verifier;\n\tconst HTTPServerRequestImpl *impl = nullptr;\n\n\timpl = dynamic_cast<const HTTPServerRequestImpl *>(&request);\n\tif (impl == nullptr) {\n\t\tthrow IllegalStateException(\n\t\t\t\"given request instance is not inherited from HTTPServerRequestImpl\");\n\t}\n\n\tverifier = m_verifierFactory->preverifyAndCreate(\n\t\t\tconst_cast<HTTPServerRequestImpl *>(impl)->socket());\n\n\treturn new GWRequestHandler(\n\t\tm_maxMessageSize,\n\t\tm_gatewayCommunicator,\n\t\tm_gatewayService,\n\t\tverifier\n\t);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/targeting\/targetservicestart.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2017 *\/\n\/* [+] Google Inc. *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/**\n * @file targeting\/targetservicestart.C\n *\n * @brief Hostboot entry point for target service\n *\/\n\n\/\/******************************************************************************\n\/\/ Includes\n\/\/******************************************************************************\n\n\/\/ STD\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ Other components\n#include <sys\/misc.h>\n#include <sys\/task.h>\n#include <targeting\/common\/trace.H>\n#include <targeting\/adapters\/assertadapter.H>\n#include <initservice\/taskargs.H>\n#include <util\/utilmbox_scratch.H>\n\n\/\/ This component\n#include <targeting\/common\/targetservice.H>\n#include <targeting\/attrrp.H>\n\n\/\/ Others\n#include <errl\/errlentry.H>\n#include <errl\/errlmanager.H>\n#include <devicefw\/userif.H>\n#include <config.h>\n#include <initservice\/initserviceif.H>\n#include <util\/misc.H>\n\n#ifdef CONFIG_DRTM\n#include <secureboot\/drtm.H>\n#endif\n\nusing namespace INITSERVICE::SPLESS;\n\/\/******************************************************************************\n\/\/ targetService\n\/\/******************************************************************************\n\nnamespace TARGETING\n{\n\n#define TARG_NAMESPACE \"TARGETING::\"\n\n#define TARG_LOC TARG_NAMESPACE TARG_CLASS TARG_FN \": \"\n\n\/\/******************************************************************************\n\/\/ _start\n\/\/******************************************************************************\n\n#define TARG_CLASS \"\"\n\n\/*\n * @brief Initialize any attributes that need to be set early on\n *\/\nstatic void initializeAttributes(TargetService& i_targetService,\n bool i_isMpipl,\n bool i_istepMode,\n ATTR_MASTER_MBOX_SCRATCH_type& i_masterScratch);\n\n\/**\n * @brief Check that at least one processor of our cpu type is being targeted\n *\/\nstatic void checkProcessorTargeting(TargetService& i_targetService);\n\n\/**\n * @brief Entry point for initialization service to initialize the targeting\n * code\n *\n * @param[in] io_pError\n * Error log handle; returns NULL on success, !NULL otherwise\n *\n * @note: Link register is configured to automatically invoke task_end() when\n * this routine returns\n *\/\nstatic void initTargeting(errlHndl_t& io_pError)\n{\n #define TARG_FN \"initTargeting(errlHndl_t& io_pError)\"\n\n TARG_ENTER();\n\n \/\/Need to stash away the master mbox regs as they will\n \/\/be overwritten\n bool l_isMpipl = false;\n bool l_isIstepMode = false;\n ATTR_MASTER_MBOX_SCRATCH_type l_scratch = {0,0,0,0,0,0,0,0};\n\n for(size_t i=0; i< sizeof(l_scratch)\/sizeof(l_scratch[0]); i++)\n {\n l_scratch[i] =\n Util::readScratchReg(MBOX_SCRATCH_REG1+i);\n }\n\n \/\/ Check mbox scratch reg 3 for IPL boot options\n \/\/ Specifically istep mode (bit 0) and MPIPL (bit 2)\n INITSERVICE::SPLESS::MboxScratch3_t l_scratch3;\n l_scratch3.data32 = l_scratch[SCRATCH_3];\n\n if(l_scratch3.isMpipl)\n {\n TARG_INF(\"We are running MPIPL mode\");\n l_isMpipl = true;\n }\n if(l_scratch3.istepMode)\n {\n l_isIstepMode = true;\n }\n if(l_scratch3.overrideSecurity)\n {\n TARG_INF(\"WARNING: External tool asked master proc to disable \"\n \"security.\");\n }\n\n AttrRP::init(io_pError, l_isMpipl);\n\n if (io_pError == NULL)\n {\n TargetService& l_targetService = targetService();\n (void)l_targetService.init();\n\n initializeAttributes(l_targetService, l_isMpipl, l_isIstepMode, l_scratch);\n checkProcessorTargeting(l_targetService);\n\n \/\/ Print out top-level model value from loaded targeting values.\n \/\/ @TODO RTC:88056 Make the model printed more meaniful\n Target* l_pTopLevel = NULL;\n l_targetService.getTopLevelTarget(l_pTopLevel);\n ATTR_MODEL_type l_model = MODEL_NA;\n if (l_pTopLevel->tryGetAttr<ATTR_MODEL>(l_model)) {\n TARG_INF(\"Initialized targeting for model: %s\",\n l_pTopLevel->getAttrAsString<ATTR_MODEL>());\n }\n\n#ifdef CONFIG_DRTM\n const INITSERVICE::SPLESS::MboxScratch7_t scratch7 =\n {.data32 = l_scratch[SCRATCH_7] };\n const INITSERVICE::SPLESS::MboxScratch8_t scratch8 =\n {.data32 = l_scratch[SCRATCH_8] };\n\n errlHndl_t pError = SECUREBOOT::DRTM::discoverDrtmState(\n scratch7,scratch8);\n if(pError)\n {\n auto plid = pError->plid();\n errlCommit(pError,SECURE_COMP_ID);\n \/\/ TODO: RTC 167205: Better GA error handling\n INITSERVICE::doShutdown(plid, true);\n }\n#endif\n\n\/\/ No error module loaded in VPO to save load time\n#ifndef CONFIG_VPO_COMPILE\n \/\/ call ErrlManager function - tell him that TARG is ready!\n ERRORLOG::ErrlManager::errlResourceReady(ERRORLOG::TARG);\n#endif\n\n \/\/ set global that TARG is ready\n Util::setIsTargetingLoaded();\n }\n\n TARG_EXIT();\n\n#undef TARG_FN\n}\n\n\/**\n * @brief Create _start entry point using task entry macro and vector to\n * initTargeting function\n *\/\nTASK_ENTRY_MACRO(initTargeting);\n\n\n\/**\n * @brief Check that at least one processor of our cpu type is being targeted\n *\/\nstatic void checkProcessorTargeting(TargetService& i_targetService)\n{\n #define TARG_FN \"checkProcessorTargeting()\"\n TARG_ENTER();\n\n PredicateCTM l_procChip(CLASS_CHIP,TYPE_PROC);\n ProcessorCoreType l_coreType = cpu_core_type();\n bool l_haveOneCorrectProcessor = false;\n TargetRangeFilter l_filter(\n i_targetService.begin(),\n i_targetService.end(),\n &l_procChip);\n\n for(;l_filter && (l_haveOneCorrectProcessor != true);++l_filter)\n {\n switch(l_filter->getAttr<ATTR_MODEL>())\n {\n case MODEL_VENICE:\n if(l_coreType == CORE_POWER8_VENICE)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n case MODEL_MURANO:\n if(l_coreType == CORE_POWER8_MURANO)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n case MODEL_NAPLES:\n if(l_coreType == CORE_POWER8_NAPLES)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n case MODEL_NIMBUS:\n if(l_coreType == CORE_POWER9_NIMBUS)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n case MODEL_CUMULUS:\n if(l_coreType == CORE_POWER9_CUMULUS)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n default:\n break;\n };\n }\n\n TARG_ASSERT((l_haveOneCorrectProcessor == true), TARG_ERR_LOC \"FATAL: No \"\n \"targeted processors are of the correct type\");\n\n TARG_EXIT();\n\n #undef TARG_FN\n}\n\n\/*\n * @brief Initialize any attributes that need to be set early on\n *\/\nstatic void initializeAttributes(TargetService& i_targetService,\n bool i_isMpipl,\n bool i_istepMode,\n ATTR_MASTER_MBOX_SCRATCH_type& i_masterScratch)\n{\n #define TARG_FN \"initializeAttributes()...)\"\n TARG_ENTER();\n\n Target* l_pTopLevel = NULL;\n\n TargetHandleList l_chips;\n\n i_targetService.getTopLevelTarget(l_pTopLevel);\n if(l_pTopLevel)\n {\n Target* l_pMasterProcChip = NULL;\n i_targetService.masterProcChipTargetHandle(l_pMasterProcChip);\n\n if(l_pMasterProcChip)\n {\n \/\/ Master uses xscom by default, needs to be set before\n \/\/ doing any other scom accesses\n ScomSwitches l_switches =\n l_pMasterProcChip->getAttr<ATTR_SCOM_SWITCHES>();\n l_switches.useXscom = 1;\n l_switches.useFsiScom = 0;\n l_switches.useSbeScom = 0;\n l_pMasterProcChip->setAttr<ATTR_SCOM_SWITCHES>(l_switches);\n\n\n \/\/ Master can only use Host I2C so needs to be set before\n \/\/ doing any I2C accesses\n I2cSwitches l_i2c_switches =\n l_pMasterProcChip->getAttr<ATTR_I2C_SWITCHES>();\n l_i2c_switches.useHostI2C = 1;\n l_i2c_switches.useFsiI2C = 0;\n l_pMasterProcChip->setAttr<ATTR_I2C_SWITCHES>(l_i2c_switches);\n\n l_pMasterProcChip->setAttr<ATTR_PROC_SBE_MASTER_CHIP>(1);\n\n \/\/ Master has SBE started\n l_pMasterProcChip->setAttr<ATTR_SBE_IS_STARTED>(1);\n\n\n l_pTopLevel->setAttr<ATTR_MASTER_MBOX_SCRATCH>(i_masterScratch);\n\n \/\/ Targeting data defaults to non istep, only turn \"on\" if bit\n \/\/ is set so we don't tromp default setting\n if (i_istepMode)\n {\n l_pTopLevel->setAttr<ATTR_ISTEP_MODE>(1);\n }\n else\n {\n l_pTopLevel->setAttr<ATTR_ISTEP_MODE>(0);\n }\n\n \/\/Set the RISK_LEVEL ATTR based off of master Scratch regs\n INITSERVICE::SPLESS::MboxScratch5_t l_scratch5;\n l_scratch5.data32 = i_masterScratch[INITSERVICE::SPLESS::SCRATCH_5];\n if(l_scratch5.riskLevel)\n {\n l_pTopLevel->setAttr<ATTR_RISK_LEVEL>(1);\n }\n }\n\n if(i_isMpipl)\n {\n l_pTopLevel->setAttr<ATTR_IS_MPIPL_HB>(1);\n\n \/\/Clear out some attributes that could have stale data\n l_pTopLevel->setAttr<ATTR_HB_RSV_MEM_NEXT_SECTION>(0);\n l_pTopLevel->setAttr<ATTR_ATTN_CHK_ALL_PROCS>(1);\n\n TARGETING::PredicateCTM l_chipFilter(CLASS_CHIP, TYPE_PROC);\n TARGETING::PredicateIsFunctional l_functional;\n TARGETING::PredicatePostfixExpr l_functionalChips;\n l_functionalChips.push(&l_chipFilter).push(&l_functional).And();\n\n i_targetService.getAssociated( l_chips,\n l_pTopLevel,\n TargetService::CHILD_BY_AFFINITY,\n TARGETING::TargetService::ALL,\n &l_functionalChips);\n\n for (auto & l_chip : l_chips)\n {\n l_chip->setAttr<ATTR_XSCOM_VIRTUAL_ADDR>(0);\n l_chip->setAttr<ATTR_HOMER_VIRT_ADDR>(0);\n \/\/TODO RTC:172534 Need to clear volatile attributes during MPIPL for cumulus\n }\n }\n else\n {\n l_pTopLevel->setAttr<ATTR_IS_MPIPL_HB>(0);\n }\n }\n else \/\/ top level is NULL - never expected\n {\n TARG_INF(\"Top level target is NULL\");\n }\n\n TARG_EXIT();\n #undef TARG_FN\n}\n\n#undef TARG_CLASS\n\n#undef TARG_NAMESPACE\n\n} \/\/ End namespace TARGETING\n\n<commit_msg>Fix TPM log manager init in MPIPL mode<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/targeting\/targetservicestart.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2017 *\/\n\/* [+] Google Inc. *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/**\n * @file targeting\/targetservicestart.C\n *\n * @brief Hostboot entry point for target service\n *\/\n\n\/\/******************************************************************************\n\/\/ Includes\n\/\/******************************************************************************\n\n\/\/ STD\n#include <stdio.h>\n#include <stdlib.h>\n\n\/\/ Other components\n#include <sys\/misc.h>\n#include <sys\/task.h>\n#include <sys\/sync.h>\n#include <targeting\/common\/trace.H>\n#include <targeting\/adapters\/assertadapter.H>\n#include <initservice\/taskargs.H>\n#include <util\/utilmbox_scratch.H>\n\n\/\/ This component\n#include <targeting\/common\/targetservice.H>\n#include <targeting\/attrrp.H>\n\n\/\/ Others\n#include <errl\/errlentry.H>\n#include <errl\/errlmanager.H>\n#include <devicefw\/userif.H>\n#include <config.h>\n#include <initservice\/initserviceif.H>\n#include <util\/misc.H>\n\n#ifdef CONFIG_DRTM\n#include <secureboot\/drtm.H>\n#endif\n\nusing namespace INITSERVICE::SPLESS;\n\/\/******************************************************************************\n\/\/ targetService\n\/\/******************************************************************************\n\nnamespace TARGETING\n{\n\n#define TARG_NAMESPACE \"TARGETING::\"\n\n#define TARG_LOC TARG_NAMESPACE TARG_CLASS TARG_FN \": \"\n\n\/\/******************************************************************************\n\/\/ _start\n\/\/******************************************************************************\n\n#define TARG_CLASS \"\"\n\n\/*\n * @brief Initialize any attributes that need to be set early on\n *\/\nstatic void initializeAttributes(TargetService& i_targetService,\n bool i_isMpipl,\n bool i_istepMode,\n ATTR_MASTER_MBOX_SCRATCH_type& i_masterScratch);\n\n\/**\n * @brief Check that at least one processor of our cpu type is being targeted\n *\/\nstatic void checkProcessorTargeting(TargetService& i_targetService);\n\n\/**\n * @brief Entry point for initialization service to initialize the targeting\n * code\n *\n * @param[in] io_pError\n * Error log handle; returns NULL on success, !NULL otherwise\n *\n * @note: Link register is configured to automatically invoke task_end() when\n * this routine returns\n *\/\nstatic void initTargeting(errlHndl_t& io_pError)\n{\n #define TARG_FN \"initTargeting(errlHndl_t& io_pError)\"\n\n TARG_ENTER();\n\n \/\/Need to stash away the master mbox regs as they will\n \/\/be overwritten\n bool l_isMpipl = false;\n bool l_isIstepMode = false;\n ATTR_MASTER_MBOX_SCRATCH_type l_scratch = {0,0,0,0,0,0,0,0};\n\n for(size_t i=0; i< sizeof(l_scratch)\/sizeof(l_scratch[0]); i++)\n {\n l_scratch[i] =\n Util::readScratchReg(MBOX_SCRATCH_REG1+i);\n }\n\n \/\/ Check mbox scratch reg 3 for IPL boot options\n \/\/ Specifically istep mode (bit 0) and MPIPL (bit 2)\n INITSERVICE::SPLESS::MboxScratch3_t l_scratch3;\n l_scratch3.data32 = l_scratch[SCRATCH_3];\n\n if(l_scratch3.isMpipl)\n {\n TARG_INF(\"We are running MPIPL mode\");\n l_isMpipl = true;\n }\n if(l_scratch3.istepMode)\n {\n l_isIstepMode = true;\n }\n if(l_scratch3.overrideSecurity)\n {\n TARG_INF(\"WARNING: External tool asked master proc to disable \"\n \"security.\");\n }\n\n AttrRP::init(io_pError, l_isMpipl);\n\n if (io_pError == NULL)\n {\n TargetService& l_targetService = targetService();\n (void)l_targetService.init();\n\n initializeAttributes(l_targetService, l_isMpipl, l_isIstepMode, l_scratch);\n checkProcessorTargeting(l_targetService);\n\n \/\/ Print out top-level model value from loaded targeting values.\n \/\/ @TODO RTC:88056 Make the model printed more meaniful\n Target* l_pTopLevel = NULL;\n l_targetService.getTopLevelTarget(l_pTopLevel);\n ATTR_MODEL_type l_model = MODEL_NA;\n if (l_pTopLevel->tryGetAttr<ATTR_MODEL>(l_model)) {\n TARG_INF(\"Initialized targeting for model: %s\",\n l_pTopLevel->getAttrAsString<ATTR_MODEL>());\n }\n\n#ifdef CONFIG_DRTM\n const INITSERVICE::SPLESS::MboxScratch7_t scratch7 =\n {.data32 = l_scratch[SCRATCH_7] };\n const INITSERVICE::SPLESS::MboxScratch8_t scratch8 =\n {.data32 = l_scratch[SCRATCH_8] };\n\n errlHndl_t pError = SECUREBOOT::DRTM::discoverDrtmState(\n scratch7,scratch8);\n if(pError)\n {\n auto plid = pError->plid();\n errlCommit(pError,SECURE_COMP_ID);\n \/\/ TODO: RTC 167205: Better GA error handling\n INITSERVICE::doShutdown(plid, true);\n }\n#endif\n\n\/\/ No error module loaded in VPO to save load time\n#ifndef CONFIG_VPO_COMPILE\n \/\/ call ErrlManager function - tell him that TARG is ready!\n ERRORLOG::ErrlManager::errlResourceReady(ERRORLOG::TARG);\n#endif\n\n \/\/ set global that TARG is ready\n Util::setIsTargetingLoaded();\n }\n\n TARG_EXIT();\n\n#undef TARG_FN\n}\n\n\/**\n * @brief Create _start entry point using task entry macro and vector to\n * initTargeting function\n *\/\nTASK_ENTRY_MACRO(initTargeting);\n\n\n\/**\n * @brief Check that at least one processor of our cpu type is being targeted\n *\/\nstatic void checkProcessorTargeting(TargetService& i_targetService)\n{\n #define TARG_FN \"checkProcessorTargeting()\"\n TARG_ENTER();\n\n PredicateCTM l_procChip(CLASS_CHIP,TYPE_PROC);\n ProcessorCoreType l_coreType = cpu_core_type();\n bool l_haveOneCorrectProcessor = false;\n TargetRangeFilter l_filter(\n i_targetService.begin(),\n i_targetService.end(),\n &l_procChip);\n\n for(;l_filter && (l_haveOneCorrectProcessor != true);++l_filter)\n {\n switch(l_filter->getAttr<ATTR_MODEL>())\n {\n case MODEL_VENICE:\n if(l_coreType == CORE_POWER8_VENICE)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n case MODEL_MURANO:\n if(l_coreType == CORE_POWER8_MURANO)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n case MODEL_NAPLES:\n if(l_coreType == CORE_POWER8_NAPLES)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n case MODEL_NIMBUS:\n if(l_coreType == CORE_POWER9_NIMBUS)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n case MODEL_CUMULUS:\n if(l_coreType == CORE_POWER9_CUMULUS)\n {\n l_haveOneCorrectProcessor = true;\n }\n break;\n\n default:\n break;\n };\n }\n\n TARG_ASSERT((l_haveOneCorrectProcessor == true), TARG_ERR_LOC \"FATAL: No \"\n \"targeted processors are of the correct type\");\n\n TARG_EXIT();\n\n #undef TARG_FN\n}\n\n\/*\n * @brief Initialize any attributes that need to be set early on\n *\/\nstatic void initializeAttributes(TargetService& i_targetService,\n bool i_isMpipl,\n bool i_istepMode,\n ATTR_MASTER_MBOX_SCRATCH_type& i_masterScratch)\n{\n #define TARG_FN \"initializeAttributes()...)\"\n TARG_ENTER();\n\n Target* l_pTopLevel = NULL;\n\n TargetHandleList l_chips;\n\n i_targetService.getTopLevelTarget(l_pTopLevel);\n if(l_pTopLevel)\n {\n Target* l_pMasterProcChip = NULL;\n i_targetService.masterProcChipTargetHandle(l_pMasterProcChip);\n\n if(l_pMasterProcChip)\n {\n \/\/ Master uses xscom by default, needs to be set before\n \/\/ doing any other scom accesses\n ScomSwitches l_switches =\n l_pMasterProcChip->getAttr<ATTR_SCOM_SWITCHES>();\n l_switches.useXscom = 1;\n l_switches.useFsiScom = 0;\n l_switches.useSbeScom = 0;\n l_pMasterProcChip->setAttr<ATTR_SCOM_SWITCHES>(l_switches);\n\n\n \/\/ Master can only use Host I2C so needs to be set before\n \/\/ doing any I2C accesses\n I2cSwitches l_i2c_switches =\n l_pMasterProcChip->getAttr<ATTR_I2C_SWITCHES>();\n l_i2c_switches.useHostI2C = 1;\n l_i2c_switches.useFsiI2C = 0;\n l_pMasterProcChip->setAttr<ATTR_I2C_SWITCHES>(l_i2c_switches);\n\n l_pMasterProcChip->setAttr<ATTR_PROC_SBE_MASTER_CHIP>(1);\n\n \/\/ Master has SBE started\n l_pMasterProcChip->setAttr<ATTR_SBE_IS_STARTED>(1);\n\n\n l_pTopLevel->setAttr<ATTR_MASTER_MBOX_SCRATCH>(i_masterScratch);\n\n \/\/ Targeting data defaults to non istep, only turn \"on\" if bit\n \/\/ is set so we don't tromp default setting\n if (i_istepMode)\n {\n l_pTopLevel->setAttr<ATTR_ISTEP_MODE>(1);\n }\n else\n {\n l_pTopLevel->setAttr<ATTR_ISTEP_MODE>(0);\n }\n\n \/\/Set the RISK_LEVEL ATTR based off of master Scratch regs\n INITSERVICE::SPLESS::MboxScratch5_t l_scratch5;\n l_scratch5.data32 = i_masterScratch[INITSERVICE::SPLESS::SCRATCH_5];\n if(l_scratch5.riskLevel)\n {\n l_pTopLevel->setAttr<ATTR_RISK_LEVEL>(1);\n }\n }\n\n if(i_isMpipl)\n {\n l_pTopLevel->setAttr<ATTR_IS_MPIPL_HB>(1);\n\n \/\/Clear out some attributes that could have stale data\n l_pTopLevel->setAttr<ATTR_HB_RSV_MEM_NEXT_SECTION>(0);\n l_pTopLevel->setAttr<ATTR_ATTN_CHK_ALL_PROCS>(1);\n\n TARGETING::PredicateCTM l_chipFilter(CLASS_CHIP, TYPE_PROC);\n TARGETING::PredicateIsFunctional l_functional;\n TARGETING::PredicatePostfixExpr l_functionalChips;\n l_functionalChips.push(&l_chipFilter).push(&l_functional).And();\n\n i_targetService.getAssociated( l_chips,\n l_pTopLevel,\n TargetService::CHILD_BY_AFFINITY,\n TARGETING::TargetService::ALL,\n &l_functionalChips);\n\n for (auto & l_chip : l_chips)\n {\n l_chip->setAttr<ATTR_XSCOM_VIRTUAL_ADDR>(0);\n l_chip->setAttr<ATTR_HOMER_VIRT_ADDR>(0);\n \/\/TODO RTC:172534 Need to clear volatile attributes during MPIPL for cumulus\n }\n\n TargetHandleList tpms;\n TARGETING::PredicateCTM tpmFilter(CLASS_CHIP, TYPE_TPM);\n i_targetService.getAssociated(\n tpms,\n l_pTopLevel,\n TargetService::CHILD,\n TARGETING::TargetService::ALL,\n &tpmFilter);\n for (auto & tpm : tpms)\n {\n tpm->setAttr<ATTR_HB_TPM_INIT_ATTEMPTED>(0);\n tpm->setAttr<ATTR_HB_TPM_LOG_MGR_PTR>(0);\n auto tpmMutex=tpm->getHbMutexAttr<ATTR_HB_TPM_MUTEX>();\n mutex_init(tpmMutex);\n }\n }\n else\n {\n l_pTopLevel->setAttr<ATTR_IS_MPIPL_HB>(0);\n }\n }\n else \/\/ top level is NULL - never expected\n {\n TARG_INF(\"Top level target is NULL\");\n }\n\n TARG_EXIT();\n #undef TARG_FN\n}\n\n#undef TARG_CLASS\n\n#undef TARG_NAMESPACE\n\n} \/\/ End namespace TARGETING\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the \"x0\" project, http:\/\/github.com\/christianparpart\/x0>\n\/\/ (c) 2009-2017 Christian Parpart <christian@parpart.family>\n\/\/\n\/\/ Licensed under the MIT License (the \"License\"); you may not use this\n\/\/ file except in compliance with the License. You may obtain a copy of\n\/\/ the License at: http:\/\/opensource.org\/licenses\/MIT\n\n#include <xzero\/logging.h>\n#include <xzero\/ExceptionHandler.h>\n#include <xzero\/raft\/Server.h>\n#include <xzero\/raft\/StateMachine.h>\n#include <xzero\/raft\/Discovery.h>\n#include <xzero\/raft\/Transport.h>\n#include <xzero\/raft\/Storage.h>\n#include <xzero\/util\/BinaryReader.h>\n#include <xzero\/util\/BinaryWriter.h>\n#include <xzero\/executor\/PosixScheduler.h>\n#include <xzero\/testing.h>\n#include <initializer_list>\n#include <unordered_map>\n#include <vector>\n#include <algorithm>\n#include <iostream>\n#include <limits>\n\nusing namespace xzero;\nusing raft::RaftError;\n\nclass TestKeyValueStore : public raft::StateMachine { \/\/ {{{\n public:\n TestKeyValueStore();\n\n bool saveSnapshot(std::unique_ptr<OutputStream>&& output) override;\n bool loadSnapshot(std::unique_ptr<InputStream>&& input) override;\n void applyCommand(const raft::Command& serializedCmd) override;\n\n int get(int key) const;\n\n std::function<void(int, int)> onApplyCommand;\n\n private:\n std::unordered_map<int, int> tuples_;\n};\n\nTestKeyValueStore::TestKeyValueStore()\n : onApplyCommand(),\n tuples_() {\n}\n\nbool TestKeyValueStore::saveSnapshot(std::unique_ptr<OutputStream>&& output) {\n auto o = [&](const uint8_t* data, size_t len) {\n output->write((const char*) data, len);\n };\n BinaryWriter bw(o);\n for (const auto& pair: tuples_) {\n bw.writeVarUInt(pair.first);\n bw.writeVarUInt(pair.second);\n }\n return true;\n}\n\nbool TestKeyValueStore::loadSnapshot(std::unique_ptr<InputStream>&& input) {\n tuples_.clear();\n\n Buffer buffer;\n for (;;) {\n if (input->read(&buffer, 4096) <= 0) {\n break;\n }\n }\n\n BinaryReader reader((const uint8_t*) buffer.data(), buffer.size());\n\n while (reader.pending() > 0) {\n int a = reader.parseVarUInt();\n int b = reader.parseVarUInt();\n if (a < 0 || b < 0) {\n break;\n }\n tuples_[a] = b;\n }\n return true;\n}\n\nvoid TestKeyValueStore::applyCommand(const raft::Command& command) {\n logDebug(\"TestKeyValueStore\", \"applyCommand: $0\", StringUtil::hexPrint(command.data(), command.size()));\n BinaryReader reader(command.data(), command.size());\n int a = reader.parseVarUInt();\n int b = reader.parseVarUInt();\n logDebug(\"TestKeyValueStore\", \"-> applyCommand: $0 = $1\", a, b);\n tuples_[a] = b;\n\n if (onApplyCommand) {\n onApplyCommand(a, b);\n }\n}\n\nint TestKeyValueStore::get(int a) const {\n auto i = tuples_.find(a);\n if (i != tuples_.end())\n return i->second;\n else\n return -1;\n}\n\/\/ }}}\nclass TestServer { \/\/ {{{\n public:\n TestServer(raft::Id id,\n const raft::Discovery* discovery,\n Executor* executor);\n\n int get(int key) const;\n std::error_code set(int key, int value);\n Future<raft::Index> setAsync(int key, int value);\n\n raft::LocalTransport* transport() noexcept { return &transport_; }\n raft::Server* server() noexcept { return &raftServer_; }\n TestKeyValueStore* fsm() noexcept { return &stateMachine_; }\n\n private:\n TestKeyValueStore stateMachine_;\n raft::MemoryStore storage_;\n raft::LocalTransport transport_;\n raft::Server raftServer_;\n};\n\nTestServer::TestServer(raft::Id id,\n const raft::Discovery* discovery,\n Executor* executor)\n : stateMachine_(),\n storage_(executor),\n transport_(id, executor),\n raftServer_(executor, id, &storage_, discovery, &transport_, &stateMachine_) {\n}\n\nint TestServer::get(int key) const {\n return stateMachine_.get(key);\n}\n\nstd::error_code TestServer::set(int key, int value) {\n raft::Command cmd;\n\n auto o = [&](const uint8_t* data, size_t len) {\n for (size_t i = 0; i < len; ++i) {\n cmd.push_back(data[i]);\n }\n };\n\n BinaryWriter bw(o);\n bw.writeVarUInt(key);\n bw.writeVarUInt(value);\n\n logDebug(\"TestServer\", \"set($0, $1): $2\", key, value,\n StringUtil::hexPrint(cmd.data(), cmd.size()));\n\n return raftServer_.sendCommand(std::move(cmd));\n}\n\nFuture<raft::Index> TestServer::setAsync(int key, int value) {\n raft::Command cmd;\n\n auto o = [&](const uint8_t* data, size_t len) {\n for (size_t i = 0; i < len; ++i) {\n cmd.push_back(data[i]);\n }\n };\n\n BinaryWriter bw(o);\n bw.writeVarUInt(key);\n bw.writeVarUInt(value);\n\n logDebug(\"TestServer\", \"setAsync($0, $1): $2\", key, value,\n StringUtil::hexPrint(cmd.data(), cmd.size()));\n\n return raftServer_.sendCommandAsync(std::move(cmd));\n}\n\/\/ }}}\nstruct TestServerPod { \/\/ {{{\n PosixScheduler executor;\n const raft::StaticDiscovery discovery;\n std::vector<std::unique_ptr<TestServer>> servers;\n\n TestServerPod();\n\n void enableBreakOnConsensus();\n bool isConsensusReached() const;\n\n void startWithLeader(raft::Id id);\n void start();\n\n TestServer* getInstance(raft::Id id);\n};\n\nTestServerPod::TestServerPod()\n : executor(std::make_unique<CatchAndLogExceptionHandler>(\"TestServerPod\")),\n discovery{ { 1, \"127.0.0.1:4201\" },\n { 2, \"127.0.0.1:4202\" },\n { 3, \"127.0.0.1:4203\" } },\n servers() {\n \/\/ create servers\n for (raft::Id id: discovery.listMembers()) {\n servers.emplace_back(new TestServer(id, &discovery, &executor));\n }\n\n \/\/ register (id,peer) tuples of server peers to this server\n for (auto& s: servers) {\n for (auto& t: servers) {\n s->transport()->setPeer(t->server()->id(), t->server());\n }\n\n s->server()->onLeaderChanged = [&](raft::Id oldLeaderId) {\n logDebug(\"TestServerPod\", \"onLeaderChanged[$0]: $1 ~> $2\",\n s->server()->id(), oldLeaderId,\n s->server()->currentLeaderId());\n };\n }\n}\n\nvoid TestServerPod::enableBreakOnConsensus() {\n for (auto& s: servers) {\n s->server()->onStateChanged = [&](raft::Server* s, raft::ServerState oldState) {\n logDebug(\"TestServerPod\", \"onStateChanged[$0]: $1 ~> $2\", s->id(), oldState, s->state());\n if (isConsensusReached()) {\n executor.breakLoop();\n }\n };\n }\n}\n\nbool TestServerPod::isConsensusReached() const {\n size_t leaderCount = 0;\n size_t followerCount = 0;\n\n for (const auto& s: servers) {\n switch (s->server()->state()) {\n case raft::ServerState::Leader:\n leaderCount++;\n break;\n case raft::ServerState::Follower:\n followerCount++;\n break;\n case raft::ServerState::Candidate:\n break;\n }\n }\n\n return leaderCount + followerCount == servers.size();\n}\n\nvoid TestServerPod::startWithLeader(raft::Id initialLeaderId) {\n for (auto& s: servers) {\n std::error_code ec = s->server()->startWithLeader(initialLeaderId);\n ASSERT_TRUE(!ec);\n };\n}\n\nvoid TestServerPod::start() {\n for (auto& s: servers) {\n std::error_code ec = s->server()->start();\n ASSERT_TRUE(!ec);\n };\n}\n\nTestServer* TestServerPod::getInstance(raft::Id id) {\n for (auto& i: servers) {\n if (i->server()->id() == id) {\n return i.get();\n }\n }\n\n return nullptr;\n}\n\/\/ }}}\n\nTEST(raft_Server, leaderElection) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.start();\n pod.executor.runLoop();\n\n \/\/ now, leader election must have been taken place\n \/\/ 1 leader and 2 followers must exist\n\n EXPECT_TRUE(pod.isConsensusReached());\n}\n\nTEST(raft_Server, startWithLeader) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n}\n\nTEST(raft_Server, AppendEntries_single_entry) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n ASSERT_FALSE(err);\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 3) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n}\n\nTEST(raft_Server, AppendEntries_batched_entries) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n ASSERT_FALSE(err);\n\n err = pod.getInstance(1)->set(3, 6);\n ASSERT_FALSE(err);\n\n err = pod.getInstance(1)->set(4, 7);\n ASSERT_FALSE(err);\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 9) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n\n ASSERT_EQ(6, pod.getInstance(1)->get(3));\n ASSERT_EQ(6, pod.getInstance(2)->get(3));\n ASSERT_EQ(6, pod.getInstance(3)->get(3));\n\n ASSERT_EQ(7, pod.getInstance(1)->get(4));\n ASSERT_EQ(7, pod.getInstance(2)->get(4));\n ASSERT_EQ(7, pod.getInstance(3)->get(4));\n}\n\nTEST(raft_Server, AppendEntries_not_leading_err) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n EXPECT_EQ(std::error_code(), err);\n\n err = pod.getInstance(2)->set(2, 4);\n EXPECT_EQ(std::make_error_code(RaftError::NotLeading), err);\n\n err = pod.getInstance(3)->set(2, 4);\n EXPECT_EQ(std::make_error_code(RaftError::NotLeading), err);\n}\n\nTEST(raft_Server, sendCommandAsync) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 3) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n Future<raft::Index> f = pod.getInstance(1)->setAsync(2, 4);\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n}\n<commit_msg>[xzero] raft: adds new test for batched asynchronous command sending<commit_after>\/\/ This file is part of the \"x0\" project, http:\/\/github.com\/christianparpart\/x0>\n\/\/ (c) 2009-2017 Christian Parpart <christian@parpart.family>\n\/\/\n\/\/ Licensed under the MIT License (the \"License\"); you may not use this\n\/\/ file except in compliance with the License. You may obtain a copy of\n\/\/ the License at: http:\/\/opensource.org\/licenses\/MIT\n\n#include <xzero\/logging.h>\n#include <xzero\/ExceptionHandler.h>\n#include <xzero\/raft\/Server.h>\n#include <xzero\/raft\/StateMachine.h>\n#include <xzero\/raft\/Discovery.h>\n#include <xzero\/raft\/Transport.h>\n#include <xzero\/raft\/Storage.h>\n#include <xzero\/util\/BinaryReader.h>\n#include <xzero\/util\/BinaryWriter.h>\n#include <xzero\/executor\/PosixScheduler.h>\n#include <xzero\/testing.h>\n#include <initializer_list>\n#include <unordered_map>\n#include <vector>\n#include <algorithm>\n#include <iostream>\n#include <limits>\n\nusing namespace xzero;\nusing raft::RaftError;\n\nclass TestKeyValueStore : public raft::StateMachine { \/\/ {{{\n public:\n TestKeyValueStore();\n\n bool saveSnapshot(std::unique_ptr<OutputStream>&& output) override;\n bool loadSnapshot(std::unique_ptr<InputStream>&& input) override;\n void applyCommand(const raft::Command& serializedCmd) override;\n\n int get(int key) const;\n\n std::function<void(int, int)> onApplyCommand;\n\n private:\n std::unordered_map<int, int> tuples_;\n};\n\nTestKeyValueStore::TestKeyValueStore()\n : onApplyCommand(),\n tuples_() {\n}\n\nbool TestKeyValueStore::saveSnapshot(std::unique_ptr<OutputStream>&& output) {\n auto o = [&](const uint8_t* data, size_t len) {\n output->write((const char*) data, len);\n };\n BinaryWriter bw(o);\n for (const auto& pair: tuples_) {\n bw.writeVarUInt(pair.first);\n bw.writeVarUInt(pair.second);\n }\n return true;\n}\n\nbool TestKeyValueStore::loadSnapshot(std::unique_ptr<InputStream>&& input) {\n tuples_.clear();\n\n Buffer buffer;\n for (;;) {\n if (input->read(&buffer, 4096) <= 0) {\n break;\n }\n }\n\n BinaryReader reader((const uint8_t*) buffer.data(), buffer.size());\n\n while (reader.pending() > 0) {\n int a = reader.parseVarUInt();\n int b = reader.parseVarUInt();\n if (a < 0 || b < 0) {\n break;\n }\n tuples_[a] = b;\n }\n return true;\n}\n\nvoid TestKeyValueStore::applyCommand(const raft::Command& command) {\n logDebug(\"TestKeyValueStore\", \"applyCommand: $0\", StringUtil::hexPrint(command.data(), command.size()));\n BinaryReader reader(command.data(), command.size());\n int a = reader.parseVarUInt();\n int b = reader.parseVarUInt();\n logDebug(\"TestKeyValueStore\", \"-> applyCommand: $0 = $1\", a, b);\n tuples_[a] = b;\n\n if (onApplyCommand) {\n onApplyCommand(a, b);\n }\n}\n\nint TestKeyValueStore::get(int a) const {\n auto i = tuples_.find(a);\n if (i != tuples_.end())\n return i->second;\n else\n return -1;\n}\n\/\/ }}}\nclass TestServer { \/\/ {{{\n public:\n TestServer(raft::Id id,\n const raft::Discovery* discovery,\n Executor* executor);\n\n int get(int key) const;\n std::error_code set(int key, int value);\n Future<raft::Index> setAsync(int key, int value);\n\n raft::LocalTransport* transport() noexcept { return &transport_; }\n raft::Server* server() noexcept { return &raftServer_; }\n TestKeyValueStore* fsm() noexcept { return &stateMachine_; }\n\n private:\n TestKeyValueStore stateMachine_;\n raft::MemoryStore storage_;\n raft::LocalTransport transport_;\n raft::Server raftServer_;\n};\n\nTestServer::TestServer(raft::Id id,\n const raft::Discovery* discovery,\n Executor* executor)\n : stateMachine_(),\n storage_(executor),\n transport_(id, executor),\n raftServer_(executor, id, &storage_, discovery, &transport_, &stateMachine_) {\n}\n\nint TestServer::get(int key) const {\n return stateMachine_.get(key);\n}\n\nstd::error_code TestServer::set(int key, int value) {\n raft::Command cmd;\n\n auto o = [&](const uint8_t* data, size_t len) {\n for (size_t i = 0; i < len; ++i) {\n cmd.push_back(data[i]);\n }\n };\n\n BinaryWriter bw(o);\n bw.writeVarUInt(key);\n bw.writeVarUInt(value);\n\n logDebug(\"TestServer\", \"set($0, $1): $2\", key, value,\n StringUtil::hexPrint(cmd.data(), cmd.size()));\n\n return raftServer_.sendCommand(std::move(cmd));\n}\n\nFuture<raft::Index> TestServer::setAsync(int key, int value) {\n raft::Command cmd;\n\n auto o = [&](const uint8_t* data, size_t len) {\n for (size_t i = 0; i < len; ++i) {\n cmd.push_back(data[i]);\n }\n };\n\n BinaryWriter bw(o);\n bw.writeVarUInt(key);\n bw.writeVarUInt(value);\n\n logDebug(\"TestServer\", \"setAsync($0, $1): $2\", key, value,\n StringUtil::hexPrint(cmd.data(), cmd.size()));\n\n return raftServer_.sendCommandAsync(std::move(cmd));\n}\n\/\/ }}}\nstruct TestServerPod { \/\/ {{{\n PosixScheduler executor;\n const raft::StaticDiscovery discovery;\n std::vector<std::unique_ptr<TestServer>> servers;\n\n TestServerPod();\n\n void enableBreakOnConsensus();\n bool isConsensusReached() const;\n\n void startWithLeader(raft::Id id);\n void start();\n\n TestServer* getInstance(raft::Id id);\n};\n\nTestServerPod::TestServerPod()\n : executor(std::make_unique<CatchAndLogExceptionHandler>(\"TestServerPod\")),\n discovery{ { 1, \"127.0.0.1:4201\" },\n { 2, \"127.0.0.1:4202\" },\n { 3, \"127.0.0.1:4203\" } },\n servers() {\n \/\/ create servers\n for (raft::Id id: discovery.listMembers()) {\n servers.emplace_back(new TestServer(id, &discovery, &executor));\n }\n\n \/\/ register (id,peer) tuples of server peers to this server\n for (auto& s: servers) {\n for (auto& t: servers) {\n s->transport()->setPeer(t->server()->id(), t->server());\n }\n\n s->server()->onLeaderChanged = [&](raft::Id oldLeaderId) {\n logDebug(\"TestServerPod\", \"onLeaderChanged[$0]: $1 ~> $2\",\n s->server()->id(), oldLeaderId,\n s->server()->currentLeaderId());\n };\n }\n}\n\nvoid TestServerPod::enableBreakOnConsensus() {\n for (auto& s: servers) {\n s->server()->onStateChanged = [&](raft::Server* s, raft::ServerState oldState) {\n logDebug(\"TestServerPod\", \"onStateChanged[$0]: $1 ~> $2\", s->id(), oldState, s->state());\n if (isConsensusReached()) {\n executor.breakLoop();\n }\n };\n }\n}\n\nbool TestServerPod::isConsensusReached() const {\n size_t leaderCount = 0;\n size_t followerCount = 0;\n\n for (const auto& s: servers) {\n switch (s->server()->state()) {\n case raft::ServerState::Leader:\n leaderCount++;\n break;\n case raft::ServerState::Follower:\n followerCount++;\n break;\n case raft::ServerState::Candidate:\n break;\n }\n }\n\n return leaderCount + followerCount == servers.size();\n}\n\nvoid TestServerPod::startWithLeader(raft::Id initialLeaderId) {\n for (auto& s: servers) {\n std::error_code ec = s->server()->startWithLeader(initialLeaderId);\n ASSERT_TRUE(!ec);\n };\n}\n\nvoid TestServerPod::start() {\n for (auto& s: servers) {\n std::error_code ec = s->server()->start();\n ASSERT_TRUE(!ec);\n };\n}\n\nTestServer* TestServerPod::getInstance(raft::Id id) {\n for (auto& i: servers) {\n if (i->server()->id() == id) {\n return i.get();\n }\n }\n\n return nullptr;\n}\n\/\/ }}}\n\nTEST(raft_Server, leaderElection) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.start();\n pod.executor.runLoop();\n\n \/\/ now, leader election must have been taken place\n \/\/ 1 leader and 2 followers must exist\n\n EXPECT_TRUE(pod.isConsensusReached());\n}\n\nTEST(raft_Server, startWithLeader) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n}\n\nTEST(raft_Server, AppendEntries_single_entry) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n ASSERT_FALSE(err);\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 3) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n}\n\nTEST(raft_Server, AppendEntries_batched_entries) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n ASSERT_FALSE(err);\n\n err = pod.getInstance(1)->set(3, 6);\n ASSERT_FALSE(err);\n\n err = pod.getInstance(1)->set(4, 7);\n ASSERT_FALSE(err);\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 9) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n\n ASSERT_EQ(6, pod.getInstance(1)->get(3));\n ASSERT_EQ(6, pod.getInstance(2)->get(3));\n ASSERT_EQ(6, pod.getInstance(3)->get(3));\n\n ASSERT_EQ(7, pod.getInstance(1)->get(4));\n ASSERT_EQ(7, pod.getInstance(2)->get(4));\n ASSERT_EQ(7, pod.getInstance(3)->get(4));\n}\n\nTEST(raft_Server, AppendEntries_not_leading_err) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n std::error_code err = pod.getInstance(1)->set(2, 4);\n EXPECT_EQ(std::error_code(), err);\n\n err = pod.getInstance(2)->set(2, 4);\n EXPECT_EQ(std::make_error_code(RaftError::NotLeading), err);\n\n err = pod.getInstance(3)->set(2, 4);\n EXPECT_EQ(std::make_error_code(RaftError::NotLeading), err);\n}\n\nTEST(raft_Server, sendCommandAsync) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 3) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n Future<raft::Index> f = pod.getInstance(1)->setAsync(2, 4);\n\n pod.executor.runLoop();\n\n ASSERT_EQ(4, pod.getInstance(1)->get(2));\n ASSERT_EQ(4, pod.getInstance(2)->get(2));\n ASSERT_EQ(4, pod.getInstance(3)->get(2));\n ASSERT_EQ(1, f.get());\n}\n\nTEST(raft_Server, sendCommandAsync_batched) {\n TestServerPod pod;\n pod.enableBreakOnConsensus();\n pod.startWithLeader(1);\n pod.executor.runLoop();\n ASSERT_TRUE(pod.isConsensusReached());\n ASSERT_TRUE(pod.getInstance(1)->server()->isLeader());\n\n int applyCount = 0;\n for (raft::Id id = 1; id <= 3; ++id) {\n pod.getInstance(id)->fsm()->onApplyCommand = [&](int key, int value) {\n logf(\"onApplyCommand for instance $0 = $1\", key, value);\n applyCount++;\n if (applyCount == 9) {\n logf(\"onApplyCommand: breaking loop with applyCount = $0\", applyCount);\n pod.executor.breakLoop();\n }\n };\n }\n\n Future<raft::Index> f = pod.getInstance(1)->setAsync(1, 2);\n Future<raft::Index> g = pod.getInstance(1)->setAsync(3, 4);\n Future<raft::Index> h = pod.getInstance(1)->setAsync(5, 6);\n\n pod.executor.runLoop();\n\n ASSERT_EQ(2, pod.getInstance(1)->get(1));\n ASSERT_EQ(2, pod.getInstance(2)->get(1));\n ASSERT_EQ(2, pod.getInstance(3)->get(1));\n\n ASSERT_EQ(4, pod.getInstance(1)->get(3));\n ASSERT_EQ(4, pod.getInstance(2)->get(3));\n ASSERT_EQ(4, pod.getInstance(3)->get(3));\n\n ASSERT_EQ(6, pod.getInstance(1)->get(5));\n ASSERT_EQ(6, pod.getInstance(2)->get(5));\n ASSERT_EQ(6, pod.getInstance(3)->get(5));\n\n ASSERT_EQ(1, f.get());\n ASSERT_EQ(2, g.get());\n ASSERT_EQ(3, h.get());\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\n\/\/\/ @file\n\/\/\/ @copyright Copyright (C) 2017, Jonathan Bryan Schmalhofer\n\/\/\/\n\/\/\/ @brief Collection of Unit Tests for the AirSimToRos Node\n\/\/\/\n\n#include <gtest\/gtest.h>\n#include <ros\/time.h>\n\n#include \"airsimros_airsim_to_ros\/airsim_to_ros.h\"\n\nnamespace airsimros\n{\nTEST(AirSimToRosTest, DefaultStatus)\n{\n ros::Time::init();\n\n \/\/ ARRANGE\n auto airsim_to_ros = AirSimToRos();\n\n \/\/ ACT\n auto airsim_to_ros_status = airsim_to_ros.GetStatus();\n\n \/\/ ASSERT\n\tEXPECT_EQ(airsim_to_ros_status, 0);\n}\n\n\nTEST(AirSimToRosTest, SetAndGetStatus)\n{\n ros::Time::init();\n\n \/\/ ARRANGE\n auto airsim_to_ros = AirSimToRos();\n\n \/\/ ACT\n\tairsim_to_ros.SetStatus(42)\n auto airsim_to_ros_status = airsim_to_ros.GetStatus();\n\n \/\/ ASSERT\n\tEXPECT_EQ(airsim_to_ros_status, 42);\n}\n}\n\nint main(int argc, char** argv)\n{\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>corrected typo in test of airsim_to_ros<commit_after>\/\/\/\n\/\/\/ @file\n\/\/\/ @copyright Copyright (C) 2017, Jonathan Bryan Schmalhofer\n\/\/\/\n\/\/\/ @brief Collection of Unit Tests for the AirSimToRos Node\n\/\/\/\n\n#include <gtest\/gtest.h>\n#include <ros\/time.h>\n\n#include \"airsimros_airsim_to_ros\/airsim_to_ros.h\"\n\nnamespace airsimros\n{\nTEST(AirSimToRosTest, DefaultStatus)\n{\n ros::Time::init();\n\n \/\/ ARRANGE\n auto airsim_to_ros = AirSimToRos();\n\n \/\/ ACT\n auto airsim_to_ros_status = airsim_to_ros.GetStatus();\n\n \/\/ ASSERT\n\tEXPECT_EQ(airsim_to_ros_status, 0);\n}\n\n\nTEST(AirSimToRosTest, SetAndGetStatus)\n{\n ros::Time::init();\n\n \/\/ ARRANGE\n auto airsim_to_ros = AirSimToRos();\n\n \/\/ ACT\n\tairsim_to_ros.SetStatus(42);\n auto airsim_to_ros_status = airsim_to_ros.GetStatus();\n\n \/\/ ASSERT\n\tEXPECT_EQ(airsim_to_ros_status, 42);\n}\n}\n\nint main(int argc, char** argv)\n{\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <string.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include <stdlib.h>\n#include \"packet.h\"\n\n#define BUFSIZE 121\n#define FILENAME \"Testfile\"\n#define TEST_FILENAME \"Testfile2\"\n#define PORT 10038\n#define PAKSIZE 128\n#define ACK 0\n#define NAK 1\n\nusing namespace std;\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb);\nbool init(int argc, char** argv);\nbool loadFile();\nbool sendFile();\nbool getFile();\nchar * recvPkt();\nbool isvpack(unsigned char * p);\nPacket createPacket(int index);\nbool sendPacket();\nbool isAck();\nvoid handleAck();\nvoid handleNak(int& x);\n\nint seqNum;\nint s;\nint probCorrupt;\nint probLoss;\nstring hs;\nshort int port;\nchar * file;\nunsigned char* window[16]; \/\/packet window\nint windowBase; \/\/used to determine position in window of arriving packets\nint length;\nstruct sockaddr_in a;\nstruct sockaddr_in sa;\nsocklen_t salen;\nstring fstr;\nbool dropPck;\nPacket p;\nint delayT;\nunsigned char b[BUFSIZE];\n\nint main(int argc, char** argv) {\n \n if(!init(argc, argv)) return -1;\n \n if(sendto(s, \"GET Testfile\", BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n return false;\n }\n \n getFile();\n\n return 0;\n}\n\nbool init(int argc, char** argv) {\n windowBase = 0; \/\/initialize windowBase\n s = 0;\n\n hs = string(\"131.204.14.\") + argv[1]; \/* Needs to be updated? Might be a string like \"tux175.engr.auburn.edu.\" *\/\n port = 10038; \/* Can be any port within 10038-10041, inclusive. *\/\n\n char* delayTStr = argv[2];\n delayT = boost::lexical_cast<int>(delayTStr);\n\n \/*if(!loadFile()) {\n cout << \"Loading file failed. (filename FILENAME)\" << endl;\n return false;\n }*\/\n\n if ((s = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) < 0) {\n cout << \"Socket creation failed. (socket s)\" << endl;\n return false;\n }\n\n memset((char *)&a, 0, sizeof(a));\n a.sin_family = AF_INET;\n a.sin_addr.s_addr = htonl(INADDR_ANY); \/\/why does this always give us 0? \n a.sin_port = htons(0);\n\n if (bind(s, (struct sockaddr *)&a, sizeof(a)) < 0){\n cout << \"Socket binding failed. (socket s, address a)\" << endl;\n return false;\n }\n\n memset((char *)&sa, 0, sizeof(sa));\n sa.sin_family = AF_INET;\n sa.sin_port = htons(port);\n inet_pton(AF_INET, hs.c_str(), &(sa.sin_addr));\n\n cout << endl;\n\n cout << \"Server address (inet mode): \" << inet_ntoa(sa.sin_addr) << endl;\n cout << \"Port: \" << ntohs(sa.sin_port) << endl;\n\n cout << endl << endl;\n\n \/*fstr = string(file);\n\n cout << \"File: \" << endl << fstr << endl << endl;*\/\n\n seqNum = 0;\n dropPck = false;\n return true;\n}\n\nbool loadFile() {\n\n ifstream is (FILENAME, ifstream::binary);\n\n if(is) {\n is.seekg(0, is.end);\n length = is.tellg();\n is.seekg(0, is.beg);\n\n file = new char[length];\n\n cout << \"Reading \" << length << \" characters...\" << endl;\n is.read(file, length);\n\n if(!is) { cout << \"File reading failed. (filename \" << FILENAME << \"). Only \" << is.gcount() << \" could be read.\"; return false; }\n is.close();\n }\n return true;\n}\n\nbool sendFile() {\n\n for(int x = 0; x <= length \/ BUFSIZE; x++) {\n p = createPacket(x);\n if(!sendPacket()) continue;\n\n if(isAck()) { \n handleAck();\n } else { \n handleNak(x);\n }\n\n memset(b, 0, BUFSIZE);\n }\n return true;\n}\n\nPacket createPacket(int index){\n cout << endl;\n cout << \"=== TRANSMISSION START\" << endl;\n string mstr = fstr.substr(index * BUFSIZE, BUFSIZE);\n if(index * BUFSIZE + BUFSIZE > length) {\n mstr[length - (index * BUFSIZE)] = '\\0';\n }\n return Packet (seqNum, mstr.c_str());\n}\n\nbool sendPacket(){\n int pc = probCorrupt; int pl = probLoss;\n if((dropPck = gremlin(&p, pc, pl)) == false){\n if(sendto(s, p.str(), BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n return false;\n }\n return true;\n } else return false;\n}\nbool isAck() {\n recvfrom(s, b, BUFSIZE + 7, 0, (struct sockaddr *)&sa, &salen);\n\n cout << endl << \"=== SERVER RESPONSE TEST\" << endl;\n cout << \"Data: \" << b << endl;\n if(b[6] == '0') return true;\n else return false;\n}\nvoid handleAck() {\n\n}\nvoid handleNak(int& x) {\n\n char * sns = new char[2];\n memcpy(sns, &b[0], 1);\n sns[1] = '\\0';\n\n char * css = new char[5];\n memcpy(css, &b[1], 5);\n \n char * db = new char[BUFSIZE + 1];\n memcpy(db, &b[2], BUFSIZE);\n db[BUFSIZE] = '\\0';\n\n cout << \"Sequence number: \" << sns << endl;\n cout << \"Checksum: \" << css << endl;\n\n Packet pk (0, db);\n pk.setSequenceNum(boost::lexical_cast<int>(sns));\n pk.setCheckSum(boost::lexical_cast<int>(css));\n\n if(!pk.chksm()) x--; \n else x = (x - 2 > 0) ? x - 2 : 0;\n}\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb){\n bool dropPacket = false;\n int r = rand() % 100;\n\n cout << \"Corruption probability: \" << corruptProb << endl;\n cout << \"Random number: \" << r << endl;\n\n if(r <= (lossProb)){\n dropPacket = true;\n cout << \"Dropped!\" << endl;\n } \n else if(r <= (corruptProb)){\n cout << \"Corrupted!\" << endl;\n pack->loadDataBuffer((char*)\"GREMLIN LOL\");\n }\n else seqNum = (seqNum) ? false : true; \n cout << \"Seq. num: \" << pack->getSequenceNum() << endl;\n cout << \"Checksum: \" << pack->getCheckSum() << endl;\n cout << \"Message: \" << pack->getDataBuffer() << endl;\n\n return dropPacket;\n}\n\nbool isvpack(unsigned char * p) {\n cout << endl << \"=== IS VALID PACKET TESTING\" << endl;\n\n char * sns = new char[2];\n memcpy(sns, &p[0], 1);\n sns[1] = '\\0';\n\n char * css = new char[6];\n memcpy(css, &p[1], 6);\n css[5] = '\\0';\n \n char * db = new char[121 + 1];\n memcpy(db, &p[7], 121);\n db[121] = '\\0';\n\n cout << \"Seq. num: \" << sns << endl;\n cout << \"Checksum: \" << css << endl;\n cout << \"Message: \" << db << endl;\n\n int sn = boost::lexical_cast<int>(sns);\n int cs = boost::lexical_cast<int>(css);\n\n Packet pk (0, db);\n pk.setSequenceNum(sn);\n\n \/\/ change to validate based on checksum and sequence number\n\n if(sn == seqNum) return false;\n if(cs != pk.generateCheckSum()) return false;\n return true;\n}\n\n\nbool getFile(){\n \/* Loop forever, waiting for messages from a client. *\/\n cout << \"Waiting on port \" << PORT << \"...\" << endl;\n\n ofstream file(\"Dumpfile\");\n\n int rlen;\n int ack;\n \n for (;;) {\n unsigned char packet[PAKSIZE + 1];\n unsigned char dataPull[PAKSIZE - 7 + 1];\n rlen = recvfrom(s, packet, PAKSIZE, 0, (struct sockaddr *)&sa, &salen);\n\n\t\/* Begin Window Loading *\/\n\tint tempSeqNum = boost::lexical_cast<int>(packet[0]);\n\tint properIndex = tempSeqNum - windowBase;\n\n\twindow[properIndex] = packet;\n\tcout << \"Packet loaded into window\" << endl;\n\tchar* tempTest = new char[6];\n\t\tmemcpy(tempTest, &window[1], 0);\n\t\ttempTest[5] = '\\0';\n\t\n\tcout << \"The Checksum pulled from client window: \" << tempTest[0] << endl; \n\n\tfor(int x = 0; x < PAKSIZE - 7; x++) {\n dataPull[x] = packet[x + 7];\n }\n dataPull[PAKSIZE - 7] = '\\0';\n packet[PAKSIZE] = '\\0';\n if (rlen > 0) {\n char * css = new char[6];\n memcpy(css, &packet[1], 5);\n css[5] = '\\0';\n cout << endl << endl << \"=== RECEIPT\" << endl;\n cout << \"Seq. num: \" << packet[0] << endl;\n cout << \"Checksum: \" << css << endl;\n cout << \"Received message: \" << dataPull << endl;\n if(isvpack(packet)) {\n ack = ACK;\n\t\tif(boost::lexical_cast<int>(packet[0]) == windowBase) windowBase++; \/\/increment base of window \/\/FIXME\n file << dataPull;\n\t\tfile.flush();\n } else { \n ack = NAK;\n }\n cout << \"Sent response: \";\n cout << ((ack == ACK) ? \"ACK\" : \"NAK\") << endl;\n\n\t if(packet[6] == '1') usleep(delayT*1000);\n\n if(sendto(s, (const void*)windowBase, PAKSIZE, 0, (struct sockaddr *)&sa, salen) < 0) {\n cout << \"Acknowledgement failed. (socket s, acknowledgement message ack, client address ca, client address length calen)\" << endl;\n return 0;\n }\n delete css;\n }\n }\n file.close();\n return true;\n}\n<commit_msg>Okay that worked...kind of<commit_after>#include <sys\/socket.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include <string.h>\n#include <stdio.h>\n#include <iostream>\n#include <fstream>\n#include <boost\/lexical_cast.hpp>\n#include <stdlib.h>\n#include \"packet.h\"\n\n#define BUFSIZE 121\n#define FILENAME \"Testfile\"\n#define TEST_FILENAME \"Testfile2\"\n#define PORT 10038\n#define PAKSIZE 128\n#define ACK 0\n#define NAK 1\n\nusing namespace std;\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb);\nbool init(int argc, char** argv);\nbool loadFile();\nbool sendFile();\nbool getFile();\nchar * recvPkt();\nbool isvpack(unsigned char * p);\nPacket createPacket(int index);\nbool sendPacket();\nbool isAck();\nvoid handleAck();\nvoid handleNak(int& x);\n\nint seqNum;\nint s;\nint probCorrupt;\nint probLoss;\nstring hs;\nshort int port;\nchar * file;\nunsigned char* window[16]; \/\/packet window\nint windowBase; \/\/used to determine position in window of arriving packets\nint length;\nstruct sockaddr_in a;\nstruct sockaddr_in sa;\nsocklen_t salen;\nstring fstr;\nbool dropPck;\nPacket p;\nint delayT;\nunsigned char b[BUFSIZE];\n\nint main(int argc, char** argv) {\n \n if(!init(argc, argv)) return -1;\n \n if(sendto(s, \"GET Testfile\", BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n return false;\n }\n \n getFile();\n\n return 0;\n}\n\nbool init(int argc, char** argv) {\n windowBase = 0; \/\/initialize windowBase\n s = 0;\n\n hs = string(\"131.204.14.\") + argv[1]; \/* Needs to be updated? Might be a string like \"tux175.engr.auburn.edu.\" *\/\n port = 10038; \/* Can be any port within 10038-10041, inclusive. *\/\n\n char* delayTStr = argv[2];\n delayT = boost::lexical_cast<int>(delayTStr);\n\n \/*if(!loadFile()) {\n cout << \"Loading file failed. (filename FILENAME)\" << endl;\n return false;\n }*\/\n\n if ((s = socket(AF_INET, SOCK_DGRAM, IPPROTO_UDP)) < 0) {\n cout << \"Socket creation failed. (socket s)\" << endl;\n return false;\n }\n\n memset((char *)&a, 0, sizeof(a));\n a.sin_family = AF_INET;\n a.sin_addr.s_addr = htonl(INADDR_ANY); \/\/why does this always give us 0? \n a.sin_port = htons(0);\n\n if (bind(s, (struct sockaddr *)&a, sizeof(a)) < 0){\n cout << \"Socket binding failed. (socket s, address a)\" << endl;\n return false;\n }\n\n memset((char *)&sa, 0, sizeof(sa));\n sa.sin_family = AF_INET;\n sa.sin_port = htons(port);\n inet_pton(AF_INET, hs.c_str(), &(sa.sin_addr));\n\n cout << endl;\n\n cout << \"Server address (inet mode): \" << inet_ntoa(sa.sin_addr) << endl;\n cout << \"Port: \" << ntohs(sa.sin_port) << endl;\n\n cout << endl << endl;\n\n \/*fstr = string(file);\n\n cout << \"File: \" << endl << fstr << endl << endl;*\/\n\n seqNum = 0;\n dropPck = false;\n return true;\n}\n\nbool loadFile() {\n\n ifstream is (FILENAME, ifstream::binary);\n\n if(is) {\n is.seekg(0, is.end);\n length = is.tellg();\n is.seekg(0, is.beg);\n\n file = new char[length];\n\n cout << \"Reading \" << length << \" characters...\" << endl;\n is.read(file, length);\n\n if(!is) { cout << \"File reading failed. (filename \" << FILENAME << \"). Only \" << is.gcount() << \" could be read.\"; return false; }\n is.close();\n }\n return true;\n}\n\nbool sendFile() {\n\n for(int x = 0; x <= length \/ BUFSIZE; x++) {\n p = createPacket(x);\n if(!sendPacket()) continue;\n\n if(isAck()) { \n handleAck();\n } else { \n handleNak(x);\n }\n\n memset(b, 0, BUFSIZE);\n }\n return true;\n}\n\nPacket createPacket(int index){\n cout << endl;\n cout << \"=== TRANSMISSION START\" << endl;\n string mstr = fstr.substr(index * BUFSIZE, BUFSIZE);\n if(index * BUFSIZE + BUFSIZE > length) {\n mstr[length - (index * BUFSIZE)] = '\\0';\n }\n return Packet (seqNum, mstr.c_str());\n}\n\nbool sendPacket(){\n int pc = probCorrupt; int pl = probLoss;\n if((dropPck = gremlin(&p, pc, pl)) == false){\n if(sendto(s, p.str(), BUFSIZE + 7, 0, (struct sockaddr *)&sa, sizeof(sa)) < 0) {\n cout << \"Package sending failed. (socket s, server address sa, message m)\" << endl;\n return false;\n }\n return true;\n } else return false;\n}\nbool isAck() {\n recvfrom(s, b, BUFSIZE + 7, 0, (struct sockaddr *)&sa, &salen);\n\n cout << endl << \"=== SERVER RESPONSE TEST\" << endl;\n cout << \"Data: \" << b << endl;\n if(b[6] == '0') return true;\n else return false;\n}\nvoid handleAck() {\n\n}\nvoid handleNak(int& x) {\n\n char * sns = new char[2];\n memcpy(sns, &b[0], 1);\n sns[1] = '\\0';\n\n char * css = new char[5];\n memcpy(css, &b[1], 5);\n \n char * db = new char[BUFSIZE + 1];\n memcpy(db, &b[2], BUFSIZE);\n db[BUFSIZE] = '\\0';\n\n cout << \"Sequence number: \" << sns << endl;\n cout << \"Checksum: \" << css << endl;\n\n Packet pk (0, db);\n pk.setSequenceNum(boost::lexical_cast<int>(sns));\n pk.setCheckSum(boost::lexical_cast<int>(css));\n\n if(!pk.chksm()) x--; \n else x = (x - 2 > 0) ? x - 2 : 0;\n}\n\nbool gremlin(Packet * pack, int corruptProb, int lossProb){\n bool dropPacket = false;\n int r = rand() % 100;\n\n cout << \"Corruption probability: \" << corruptProb << endl;\n cout << \"Random number: \" << r << endl;\n\n if(r <= (lossProb)){\n dropPacket = true;\n cout << \"Dropped!\" << endl;\n } \n else if(r <= (corruptProb)){\n cout << \"Corrupted!\" << endl;\n pack->loadDataBuffer((char*)\"GREMLIN LOL\");\n }\n else seqNum = (seqNum) ? false : true; \n cout << \"Seq. num: \" << pack->getSequenceNum() << endl;\n cout << \"Checksum: \" << pack->getCheckSum() << endl;\n cout << \"Message: \" << pack->getDataBuffer() << endl;\n\n return dropPacket;\n}\n\nbool isvpack(unsigned char * p) {\n cout << endl << \"=== IS VALID PACKET TESTING\" << endl;\n\n char * sns = new char[2];\n memcpy(sns, &p[0], 1);\n sns[1] = '\\0';\n\n char * css = new char[6];\n memcpy(css, &p[1], 6);\n css[5] = '\\0';\n \n char * db = new char[121 + 1];\n memcpy(db, &p[7], 121);\n db[121] = '\\0';\n\n cout << \"Seq. num: \" << sns << endl;\n cout << \"Checksum: \" << css << endl;\n cout << \"Message: \" << db << endl;\n\n int sn = boost::lexical_cast<int>(sns);\n int cs = boost::lexical_cast<int>(css);\n\n Packet pk (0, db);\n pk.setSequenceNum(sn);\n\n \/\/ change to validate based on checksum and sequence number\n\n if(sn == seqNum) return false;\n if(cs != pk.generateCheckSum()) return false;\n return true;\n}\n\n\nbool getFile(){\n \/* Loop forever, waiting for messages from a client. *\/\n cout << \"Waiting on port \" << PORT << \"...\" << endl;\n\n ofstream file(\"Dumpfile\");\n\n int rlen;\n int ack;\n \n for (;;) {\n unsigned char packet[PAKSIZE + 1];\n unsigned char dataPull[PAKSIZE - 7 + 1];\n rlen = recvfrom(s, packet, PAKSIZE, 0, (struct sockaddr *)&sa, &salen);\n\n\t\/* Begin Window Loading *\/\n\tint tempSeqNum = boost::lexical_cast<int>(packet[0]);\n\tint properIndex = tempSeqNum - windowBase;\n\n\twindow[properIndex] = packet;\n\tcout << \"Packet loaded into window\" << endl;\n\tchar* tempTest = new char[6];\n\t\tmemcpy(tempTest, &window[1], 0);\n\t\ttempTest[5] = '\\0';\n\t\n\tcout << \"The Checksum pulled from client window: \" << tempTest[0] << endl; \n\n\tfor(int x = 0; x < PAKSIZE - 7; x++) {\n dataPull[x] = packet[x + 7];\n }\n dataPull[PAKSIZE - 7] = '\\0';\n packet[PAKSIZE] = '\\0';\n if (rlen > 0) {\n char * css = new char[6];\n memcpy(css, &packet[1], 5);\n css[5] = '\\0';\n cout << endl << endl << \"=== RECEIPT\" << endl;\n cout << \"Seq. num: \" << packet[0] << endl;\n cout << \"Checksum: \" << css << endl;\n cout << \"Received message: \" << dataPull << endl;\n if(isvpack(packet)) {\n ack = ACK;\n\t\tif(boost::lexical_cast<int>(packet[0]) == windowBase) windowBase++; \/\/increment base of window \/\/FIXME\n file << dataPull;\n\t\tfile.flush();\n } else { \n ack = NAK;\n }\n cout << \"Sent response: \";\n cout << ((ack == ACK) ? \"ACK \" : \"NAK \") << windowBase << endl;\n\n\t if(packet[6] == '1') usleep(delayT*1000);\n\n if(sendto(s, windowBase, PAKSIZE, 0, (struct sockaddr *)&sa, salen) < 0) {\n cout << \"Acknowledgement failed. (socket s, acknowledgement message ack, client address ca, client address length calen)\" << endl;\n return 0;\n }\n delete css;\n }\n }\n file.close();\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\/\/ $Id$\n\/\/ Fennel is a library of data storage and processing components.\n\/\/ Copyright (C) 2005-2009 The Eigenbase Project\n\/\/ Copyright (C) 2005-2009 SQLstream, Inc.\n\/\/ Copyright (C) 2005-2009 LucidEra, Inc.\n\/\/ Portions Copyright (C) 1999-2009 John V. Sichi\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or modify it\n\/\/ under the terms of the GNU General Public License as published by the Free\n\/\/ Software Foundation; either version 2 of the License, or (at your option)\n\/\/ any later version approved by The Eigenbase Project.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n\n#include \"fennel\/common\/CommonPreamble.h\"\n\n#include <ctype.h>\n#include <algorithm>\n\n#include <boost\/io\/ios_state.hpp>\n#include <boost\/format.hpp>\n\n#ifdef __MSVC__\n# include <windows.h>\n# include \"fennel\/common\/AtomicCounter.h\"\n# include \"fennel\/common\/IntrusiveDList.h\"\n# include \"fennel\/common\/CompoundId.h\"\n# include \"fennel\/common\/AbortExcn.h\"\n# include \"fennel\/common\/VoidPtrHash.h\"\n#else\n# include <pthread.h>\n#endif\n\n\/\/ NOTE jvs 26-June-2005: I added this to squelch link errors with\n\/\/ the Boost filesystem library. Yet another case where I have no\n\/\/ idea what's really going on.\n#ifdef __MSVC__\nvoid *operator new [](unsigned sz) throw (std::bad_alloc)\n{\n void *p = malloc(sz ? sz : 1);\n if (!p) {\n throw std::bad_alloc();\n }\n return p;\n}\n\nvoid operator delete [](void *p) throw ()\n{\n free(p);\n}\n#endif\n\nFENNEL_BEGIN_CPPFILE(\"$Id$\");\n\nstd::logic_error constructAssertion(\n char const *pFilename,int lineNum,char const *condExpr)\n{\n boost::format fmt(\"Assertion `%1%' failed at line %2% in file %3%\");\n return std::logic_error(\n (fmt % condExpr % lineNum % pFilename).str());\n}\n\nint getCurrentThreadId()\n{\n#ifdef __MSVC__\n return static_cast<int>(GetCurrentThreadId());\n#elif defined(__APPLE__)\n return reinterpret_cast<int64_t>(pthread_self());\n#else\n return static_cast<int>(pthread_self());\n#endif\n}\n\nvoid hexDump(std::ostream &o,void const *v,uint cb,uint cbDone)\n{\n boost::io::ios_all_saver streamStateSaver(o);\n\n PConstBuffer b = (PConstBuffer) v;\n uint cbLine = 16, cbThis;\n o.fill('0');\n for (; cb; cb -= cbThis, cbDone += cbThis) {\n cbThis = std::min(cbLine, cb);\n o << std::hex;\n o.width(4);\n o << cbDone << \": \";\n uint i;\n for (i = 0; i < cbThis; i++, b++) {\n o.width(2);\n o << (uint) *b << \" \";\n }\n for (i = cbThis; i < cbLine; i++) {\n o << \" \";\n }\n o << \"| \";\n for (i = 0, b -= cbThis; i < cbThis; i++, b++) {\n if (isprint(*b)) {\n o << *b;\n } else {\n o << \" \";\n }\n }\n o << std::endl;\n }\n}\n\n\/\/ TODO jvs 27-Feb-2009: move this somewhere else\n\n\/\/ force references to some classes which aren't referenced elsewhere\n#ifdef __MSVC__\nclass UnreferencedCommonStructs\n{\n AtomicCounter atomicCounter;\n IntrusiveDListNode dlistNode;\n CompoundId compoundId;\n AbortExcn abortExcn;\n VoidPtrHash voidPtrHash;\n};\n#endif\n\nFENNEL_END_CPPFILE(\"$Id$\");\n\n\/\/ End Memory.cpp\n<commit_msg>FENNEL: delete obsolete code which breaks Win64<commit_after>\/*\n\/\/ $Id$\n\/\/ Fennel is a library of data storage and processing components.\n\/\/ Copyright (C) 2005-2009 The Eigenbase Project\n\/\/ Copyright (C) 2005-2009 SQLstream, Inc.\n\/\/ Copyright (C) 2005-2009 LucidEra, Inc.\n\/\/ Portions Copyright (C) 1999-2009 John V. Sichi\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or modify it\n\/\/ under the terms of the GNU General Public License as published by the Free\n\/\/ Software Foundation; either version 2 of the License, or (at your option)\n\/\/ any later version approved by The Eigenbase Project.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n\n#include \"fennel\/common\/CommonPreamble.h\"\n\n#include <ctype.h>\n#include <algorithm>\n\n#include <boost\/io\/ios_state.hpp>\n#include <boost\/format.hpp>\n\n#ifdef __MSVC__\n# include <windows.h>\n# include \"fennel\/common\/AtomicCounter.h\"\n# include \"fennel\/common\/IntrusiveDList.h\"\n# include \"fennel\/common\/CompoundId.h\"\n# include \"fennel\/common\/AbortExcn.h\"\n# include \"fennel\/common\/VoidPtrHash.h\"\n#else\n# include <pthread.h>\n#endif\n\nFENNEL_BEGIN_CPPFILE(\"$Id$\");\n\nstd::logic_error constructAssertion(\n char const *pFilename,int lineNum,char const *condExpr)\n{\n boost::format fmt(\"Assertion `%1%' failed at line %2% in file %3%\");\n return std::logic_error(\n (fmt % condExpr % lineNum % pFilename).str());\n}\n\nint getCurrentThreadId()\n{\n#ifdef __MSVC__\n return static_cast<int>(GetCurrentThreadId());\n#elif defined(__APPLE__)\n return reinterpret_cast<int64_t>(pthread_self());\n#else\n return static_cast<int>(pthread_self());\n#endif\n}\n\nvoid hexDump(std::ostream &o,void const *v,uint cb,uint cbDone)\n{\n boost::io::ios_all_saver streamStateSaver(o);\n\n PConstBuffer b = (PConstBuffer) v;\n uint cbLine = 16, cbThis;\n o.fill('0');\n for (; cb; cb -= cbThis, cbDone += cbThis) {\n cbThis = std::min(cbLine, cb);\n o << std::hex;\n o.width(4);\n o << cbDone << \": \";\n uint i;\n for (i = 0; i < cbThis; i++, b++) {\n o.width(2);\n o << (uint) *b << \" \";\n }\n for (i = cbThis; i < cbLine; i++) {\n o << \" \";\n }\n o << \"| \";\n for (i = 0, b -= cbThis; i < cbThis; i++, b++) {\n if (isprint(*b)) {\n o << *b;\n } else {\n o << \" \";\n }\n }\n o << std::endl;\n }\n}\n\n\/\/ TODO jvs 27-Feb-2009: move this somewhere else\n\n\/\/ force references to some classes which aren't referenced elsewhere\n#ifdef __MSVC__\nclass UnreferencedCommonStructs\n{\n AtomicCounter atomicCounter;\n IntrusiveDListNode dlistNode;\n CompoundId compoundId;\n AbortExcn abortExcn;\n VoidPtrHash voidPtrHash;\n};\n#endif\n\nFENNEL_END_CPPFILE(\"$Id$\");\n\n\/\/ End Memory.cpp\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ FILE: CircularBuffer.cpp\r\n\/\/ PROJECT: Micro-Manager\r\n\/\/ SUBSYSTEM: MMCore\r\n\/\/-----------------------------------------------------------------------------\r\n\/\/ DESCRIPTION: Generic implementation of the circular buffer. The buffer\r\n\/\/ allows only one thread to enter at a time by using a mutex lock.\r\n\/\/ This makes the buffer succeptible to race conditions if the\r\n\/\/ calling threads are mutally dependent.\r\n\/\/ \r\n\/\/ COPYRIGHT: University of California, San Francisco, 2007,\r\n\/\/\r\n\/\/ LICENSE: This file is distributed under the \"Lesser GPL\" (LGPL) license.\r\n\/\/ License text is included with the source distribution.\r\n\/\/\r\n\/\/ This file is distributed in the hope that it will be useful,\r\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty\r\n\/\/ of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\n\/\/\r\n\/\/ IN NO EVENT SHALL THE COPYRIGHT OWNER OR\r\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\r\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES.\r\n\/\/\r\n\/\/ AUTHOR: Nenad Amodaj, nenad@amodaj.com, 01\/05\/2007\r\n\/\/ \r\n#include \"CircularBuffer.h\"\r\n#include \"CoreUtils.h\"\r\n#include \"..\/MMDevice\/DeviceUtils.h\"\r\n#include \"..\/MMDevice\/DeviceThreads.h\"\r\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\r\n#include <cstdio>\r\n\r\n#ifdef WIN32\r\n#undef min \/\/ avoid clash with the system defined macros\r\n#endif\r\n\r\nconst long long bytesInMB = 1 << 20;\r\nconst long adjustThreshold = LONG_MAX \/ 2;\r\nconst unsigned long maxCBSize = 100000; \/\/a reasonable limit to circular buffer size\r\n\r\nCircularBuffer::CircularBuffer(unsigned int memorySizeMB) :\r\n width_(0), \r\n height_(0), \r\n pixDepth_(0), \r\n imageCounter_(0), \r\n insertIndex_(0), \r\n saveIndex_(0), \r\n memorySizeMB_(memorySizeMB), \r\n overflow_(false), \r\n estimatedIntervalMs_(0)\r\n{\r\n}\r\n\r\nCircularBuffer::~CircularBuffer() {}\r\n\r\nbool CircularBuffer::Initialize(unsigned channels, unsigned slices, unsigned int w, unsigned int h, unsigned int pixDepth)\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n imageNumbers_.clear();\r\n\r\n bool ret = true;\r\n try\r\n {\r\n if (w == 0 || h==0 || pixDepth == 0 || channels == 0 || slices == 0)\r\n return false; \/\/ does not make sense\r\n\r\n if (w == width_ && height_ == h && pixDepth_ == pixDepth && channels == numChannels_ && slices == numSlices_)\r\n if (frameArray_.size() > 0)\r\n return true; \/\/ nothing to change\r\n\r\n width_ = w;\r\n height_ = h;\r\n pixDepth_ = pixDepth;\r\n numChannels_ = channels;\r\n numSlices_ = slices;\r\n\r\n insertIndex_ = 0;\r\n saveIndex_ = 0;\r\n overflow_ = false;\r\n\r\n \/\/ calculate the size of the entire buffer array once all images get allocated\r\n \/\/ the actual size at the time of the creation is going to be less, because\r\n \/\/ images are not allocated until pixels become available\r\n unsigned long frameSizeBytes = width_ * height_ * pixDepth_ * numChannels_ * numSlices_;\r\n unsigned long cbSize = (unsigned long) ((memorySizeMB_ * bytesInMB) \/ frameSizeBytes);\r\n\r\n if (cbSize == 0) \r\n {\r\n frameArray_.resize(0);\r\n return false; \/\/ memory footprint too small\r\n }\r\n\r\n \/\/ set a reasonable limit to circular buffer capacity \r\n if (cbSize > maxCBSize)\r\n cbSize = maxCBSize; \r\n\r\n \/\/ TODO: verify if we have enough RAM to satisfy this request\r\n\r\n for (unsigned long i=0; i<frameArray_.size(); i++)\r\n frameArray_[i].Clear();\r\n\r\n \/\/ allocate buffers - could conceivably throw an out-of-memory exception\r\n frameArray_.resize(cbSize);\r\n for (unsigned long i=0; i<frameArray_.size(); i++)\r\n {\r\n frameArray_[i].Resize(w, h, pixDepth);\r\n frameArray_[i].Preallocate(numChannels_, numSlices_);\r\n }\r\n }\r\n\r\n catch( ... \/* std::bad_alloc& ex *\/)\r\n {\r\n frameArray_.resize(0);\r\n ret = false;\r\n }\r\n return ret;\r\n}\r\n\r\nunsigned long CircularBuffer::GetSize() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n return (unsigned long)frameArray_.size();\r\n}\r\n\r\nunsigned long CircularBuffer::GetFreeSize() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n long freeSize = (long)frameArray_.size() - (insertIndex_ - saveIndex_);\r\n if (freeSize < 0)\r\n return 0;\r\n else\r\n return (unsigned long)freeSize;\r\n}\r\n\r\nunsigned long CircularBuffer::GetRemainingImageCount() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n return (unsigned long)(insertIndex_ - saveIndex_);\r\n}\r\n\r\n\/**\r\n* Inserts a single image in the buffer.\r\n*\/\r\nbool CircularBuffer::InsertImage(const unsigned char* pixArray, unsigned int width, unsigned int height, unsigned int byteDepth, const Metadata* pMd) throw (CMMError)\r\n{\r\n return InsertMultiChannel(pixArray, 1, width, height, byteDepth, pMd);\r\n}\r\n\r\n\/**\r\n* Inserts a multi-channel frame in the buffer.\r\n*\/\r\nbool CircularBuffer::InsertMultiChannel(const unsigned char* pixArray, unsigned numChannels, unsigned width, unsigned height, unsigned byteDepth, const Metadata* pMd) throw (CMMError)\r\n{\r\n MMThreadGuard guard(g_insertLock);\r\n\r\n static unsigned long previousTicks = 0;\r\n bool notOverflowed;\r\n ImgBuffer* pImg;\r\n unsigned long singleChannelSize = (unsigned long)width * height * byteDepth;\r\n\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (previousTicks > 0)\r\n estimatedIntervalMs_ = GetClockTicksMs() - previousTicks;\r\n else\r\n estimatedIntervalMs_ = 0;\r\n\r\n \/\/ check image dimensions\r\n if (width != width_ || height_ != height || byteDepth != byteDepth)\r\n throw CMMError(\"Incompatible image dimensions in the circular buffer\", MMERR_CircularBufferIncompatibleImage);\r\n\r\n\r\n notOverflowed = (long)frameArray_.size() - (insertIndex_ - saveIndex_) > 0;\r\n if (!notOverflowed) {\r\n \/\/ buffer overflow\r\n overflow_ = true;\r\n return false;\r\n }\r\n \r\n }\r\n\r\n for (unsigned i=0; i<numChannels; i++)\r\n {\r\n Metadata md;\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n \/\/ check if the requested (channel, slice) combination exists\r\n \/\/ we assume that all buffers are pre-allocated\r\n pImg = frameArray_[insertIndex_ % frameArray_.size()].FindImage(i, 0);\r\n if (!pImg)\r\n return false;\r\n\r\n if (pMd)\r\n {\r\n \/\/ TODO: the same metadata is inserted for each channel ???\r\n \/\/ Perhaps we need to add specific tags to each channel\r\n md = *pMd;\r\n }\r\n\r\n std::string cameraName = md.GetSingleTag(\"Camera\").GetValue();\r\n if (imageNumbers_.end() == imageNumbers_.find(cameraName))\r\n {\r\n imageNumbers_[cameraName] = 0;\r\n }\r\n\r\n \/\/ insert image number. \r\n md.put(MM::g_Keyword_Metadata_ImageNumber, CDeviceUtils::ConvertToString(imageNumbers_[cameraName]));\r\n ++imageNumbers_[cameraName];\r\n }\r\n\r\n if (!md.HasTag(MM::g_Keyword_Elapsed_Time_ms))\r\n {\r\n \/\/ if time tag was not supplied by the camera insert current timestamp\r\n MM::MMTime timestamp = GetMMTimeNow();\r\n md.PutImageTag(MM::g_Keyword_Elapsed_Time_ms, CDeviceUtils::ConvertToString(timestamp.getMsec()));\r\n }\r\n\r\n md.PutImageTag(\"Width\",width);\r\n md.PutImageTag(\"Height\",height);\r\n if (byteDepth == 1)\r\n md.PutImageTag(\"PixelType\",\"GRAY8\");\r\n else if (byteDepth == 2)\r\n md.PutImageTag(\"PixelType\",\"GRAY16\");\r\n else if (byteDepth == 4)\r\n md.PutImageTag(\"PixelType\",\"RGB32\");\r\n else if (byteDepth == 8)\r\n md.PutImageTag(\"PixelType\",\"RGB64\");\r\n else \r\n md.PutImageTag(\"PixelType\",\"Unknown\"); \r\n\r\n pImg->SetMetadata(md);\r\n pImg->SetPixels(pixArray + i*singleChannelSize);\r\n }\r\n\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n imageCounter_++;\r\n insertIndex_++;\r\n if ((insertIndex_ - (long)frameArray_.size()) > adjustThreshold && (saveIndex_- (long)frameArray_.size()) > adjustThreshold)\r\n {\r\n \/\/ adjust buffer indices to avoid overflowing integer size\r\n insertIndex_ -= adjustThreshold;\r\n saveIndex_ -= adjustThreshold;\r\n }\r\n }\r\n\r\n previousTicks = GetClockTicksMs();\r\n\r\n return true;\r\n\r\n}\r\n\r\n\r\nconst unsigned char* CircularBuffer::GetTopImage() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n if (insertIndex_ == 0)\r\n return frameArray_[0].GetPixels(0, 0);\r\n else\r\n return frameArray_[(insertIndex_-1) % frameArray_.size()].GetPixels(0, 0);\r\n}\r\n\r\nconst ImgBuffer* CircularBuffer::GetTopImageBuffer(unsigned channel, unsigned slice) const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n \/\/ TODO: we may return NULL pointer if channel and slice indexes are wrong\r\n \/\/ this will cause problem in the SWIG - Java layer\r\n if (insertIndex_ == 0)\r\n return frameArray_[0].FindImage(channel, slice);\r\n else\r\n return frameArray_[(insertIndex_-1) % frameArray_.size()].FindImage(channel, slice);\r\n}\r\n\r\n\/**\r\n* Returns an ImgBuffer to the image inserted n images before the last one\r\n*\/\r\nconst ImgBuffer* CircularBuffer::GetNthFromTopImageBuffer(unsigned long n) const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n if (n >= frameArray_.size() )\r\n return 0;\r\n\r\n if ((unsigned long) insertIndex_ <= n)\r\n {\r\n return frameArray_[(frameArray_.size() - n + insertIndex_ - 1) % frameArray_.size()].FindImage(0, 0);\r\n }\r\n\r\n return frameArray_[(insertIndex_-1-n) % frameArray_.size()].FindImage(0, 0);\r\n}\r\n\r\nconst unsigned char* CircularBuffer::GetNextImage()\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (saveIndex_ < insertIndex_)\r\n {\r\n const unsigned char* pBuf = frameArray_[(saveIndex_) % frameArray_.size()].GetPixels(0, 0);\r\n saveIndex_++;\r\n return pBuf;\r\n }\r\n return 0;\r\n}\r\n\r\nconst ImgBuffer* CircularBuffer::GetNextImageBuffer(unsigned channel, unsigned slice)\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n \/\/ TODO: we may return NULL pointer if channel and slice indexes are wrong\r\n \/\/ this will cause problem in the SWIG - Java layer\r\n if (saveIndex_ < insertIndex_)\r\n {\r\n const ImgBuffer* pBuf = frameArray_[(saveIndex_) % frameArray_.size()].FindImage(channel, slice);\r\n saveIndex_++;\r\n return pBuf;\r\n }\r\n return 0;\r\n}\r\n\r\ndouble CircularBuffer::GetAverageIntervalMs() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n return (double)estimatedIntervalMs_;\r\n}\r\n\r\n\/\/N.B. an unsigned long millisecond clock tick rolls over in 47 days.\r\n\/\/ millisecond clock tick incrementing from the time first requested\r\nunsigned long CircularBuffer::GetClockTicksMs() const\r\n{\r\n using namespace boost::posix_time;\r\n using namespace boost::gregorian;\r\n \/\/ use tick from the first time this is call is requested\r\n static boost::posix_time::ptime sst(boost::date_time::not_a_date_time);\r\n if (boost::posix_time::ptime(boost::date_time::not_a_date_time) == sst)\r\n {\r\n boost::gregorian::date today( day_clock::local_day());\r\n sst = boost::posix_time::ptime(today); \r\n }\r\n\r\n boost::posix_time::ptime t = boost::posix_time::microsec_clock::local_time();\r\n\r\n time_duration diff = t - sst;\r\n return static_cast<unsigned long>(diff.total_milliseconds());\r\n\r\n\r\n}\r\n<commit_msg>Fix a broken check for buffer size in CircularBuffer.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\/\/ FILE: CircularBuffer.cpp\r\n\/\/ PROJECT: Micro-Manager\r\n\/\/ SUBSYSTEM: MMCore\r\n\/\/-----------------------------------------------------------------------------\r\n\/\/ DESCRIPTION: Generic implementation of the circular buffer. The buffer\r\n\/\/ allows only one thread to enter at a time by using a mutex lock.\r\n\/\/ This makes the buffer succeptible to race conditions if the\r\n\/\/ calling threads are mutally dependent.\r\n\/\/ \r\n\/\/ COPYRIGHT: University of California, San Francisco, 2007,\r\n\/\/\r\n\/\/ LICENSE: This file is distributed under the \"Lesser GPL\" (LGPL) license.\r\n\/\/ License text is included with the source distribution.\r\n\/\/\r\n\/\/ This file is distributed in the hope that it will be useful,\r\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty\r\n\/\/ of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\n\/\/\r\n\/\/ IN NO EVENT SHALL THE COPYRIGHT OWNER OR\r\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\r\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES.\r\n\/\/\r\n\/\/ AUTHOR: Nenad Amodaj, nenad@amodaj.com, 01\/05\/2007\r\n\/\/ \r\n#include \"CircularBuffer.h\"\r\n#include \"CoreUtils.h\"\r\n#include \"..\/MMDevice\/DeviceUtils.h\"\r\n#include \"..\/MMDevice\/DeviceThreads.h\"\r\n#include \"boost\/date_time\/posix_time\/posix_time.hpp\"\r\n#include <cstdio>\r\n\r\n#ifdef WIN32\r\n#undef min \/\/ avoid clash with the system defined macros\r\n#endif\r\n\r\nconst long long bytesInMB = 1 << 20;\r\nconst long adjustThreshold = LONG_MAX \/ 2;\r\nconst unsigned long maxCBSize = 100000; \/\/a reasonable limit to circular buffer size\r\n\r\nCircularBuffer::CircularBuffer(unsigned int memorySizeMB) :\r\n width_(0), \r\n height_(0), \r\n pixDepth_(0), \r\n imageCounter_(0), \r\n insertIndex_(0), \r\n saveIndex_(0), \r\n memorySizeMB_(memorySizeMB), \r\n overflow_(false), \r\n estimatedIntervalMs_(0)\r\n{\r\n}\r\n\r\nCircularBuffer::~CircularBuffer() {}\r\n\r\nbool CircularBuffer::Initialize(unsigned channels, unsigned slices, unsigned int w, unsigned int h, unsigned int pixDepth)\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n imageNumbers_.clear();\r\n\r\n bool ret = true;\r\n try\r\n {\r\n if (w == 0 || h==0 || pixDepth == 0 || channels == 0 || slices == 0)\r\n return false; \/\/ does not make sense\r\n\r\n if (w == width_ && height_ == h && pixDepth_ == pixDepth && channels == numChannels_ && slices == numSlices_)\r\n if (frameArray_.size() > 0)\r\n return true; \/\/ nothing to change\r\n\r\n width_ = w;\r\n height_ = h;\r\n pixDepth_ = pixDepth;\r\n numChannels_ = channels;\r\n numSlices_ = slices;\r\n\r\n insertIndex_ = 0;\r\n saveIndex_ = 0;\r\n overflow_ = false;\r\n\r\n \/\/ calculate the size of the entire buffer array once all images get allocated\r\n \/\/ the actual size at the time of the creation is going to be less, because\r\n \/\/ images are not allocated until pixels become available\r\n unsigned long frameSizeBytes = width_ * height_ * pixDepth_ * numChannels_ * numSlices_;\r\n unsigned long cbSize = (unsigned long) ((memorySizeMB_ * bytesInMB) \/ frameSizeBytes);\r\n\r\n if (cbSize == 0) \r\n {\r\n frameArray_.resize(0);\r\n return false; \/\/ memory footprint too small\r\n }\r\n\r\n \/\/ set a reasonable limit to circular buffer capacity \r\n if (cbSize > maxCBSize)\r\n cbSize = maxCBSize; \r\n\r\n \/\/ TODO: verify if we have enough RAM to satisfy this request\r\n\r\n for (unsigned long i=0; i<frameArray_.size(); i++)\r\n frameArray_[i].Clear();\r\n\r\n \/\/ allocate buffers - could conceivably throw an out-of-memory exception\r\n frameArray_.resize(cbSize);\r\n for (unsigned long i=0; i<frameArray_.size(); i++)\r\n {\r\n frameArray_[i].Resize(w, h, pixDepth);\r\n frameArray_[i].Preallocate(numChannels_, numSlices_);\r\n }\r\n }\r\n\r\n catch( ... \/* std::bad_alloc& ex *\/)\r\n {\r\n frameArray_.resize(0);\r\n ret = false;\r\n }\r\n return ret;\r\n}\r\n\r\nunsigned long CircularBuffer::GetSize() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n return (unsigned long)frameArray_.size();\r\n}\r\n\r\nunsigned long CircularBuffer::GetFreeSize() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n long freeSize = (long)frameArray_.size() - (insertIndex_ - saveIndex_);\r\n if (freeSize < 0)\r\n return 0;\r\n else\r\n return (unsigned long)freeSize;\r\n}\r\n\r\nunsigned long CircularBuffer::GetRemainingImageCount() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n return (unsigned long)(insertIndex_ - saveIndex_);\r\n}\r\n\r\n\/**\r\n* Inserts a single image in the buffer.\r\n*\/\r\nbool CircularBuffer::InsertImage(const unsigned char* pixArray, unsigned int width, unsigned int height, unsigned int byteDepth, const Metadata* pMd) throw (CMMError)\r\n{\r\n return InsertMultiChannel(pixArray, 1, width, height, byteDepth, pMd);\r\n}\r\n\r\n\/**\r\n* Inserts a multi-channel frame in the buffer.\r\n*\/\r\nbool CircularBuffer::InsertMultiChannel(const unsigned char* pixArray, unsigned numChannels, unsigned width, unsigned height, unsigned byteDepth, const Metadata* pMd) throw (CMMError)\r\n{\r\n MMThreadGuard guard(g_insertLock);\r\n\r\n static unsigned long previousTicks = 0;\r\n bool notOverflowed;\r\n ImgBuffer* pImg;\r\n unsigned long singleChannelSize = (unsigned long)width * height * byteDepth;\r\n\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (previousTicks > 0)\r\n estimatedIntervalMs_ = GetClockTicksMs() - previousTicks;\r\n else\r\n estimatedIntervalMs_ = 0;\r\n\r\n \/\/ check image dimensions\r\n if (width != width_ || height != height_ || byteDepth != pixDepth_)\r\n throw CMMError(\"Incompatible image dimensions in the circular buffer\", MMERR_CircularBufferIncompatibleImage);\r\n\r\n\r\n notOverflowed = (long)frameArray_.size() - (insertIndex_ - saveIndex_) > 0;\r\n if (!notOverflowed) {\r\n \/\/ buffer overflow\r\n overflow_ = true;\r\n return false;\r\n }\r\n \r\n }\r\n\r\n for (unsigned i=0; i<numChannels; i++)\r\n {\r\n Metadata md;\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n \/\/ check if the requested (channel, slice) combination exists\r\n \/\/ we assume that all buffers are pre-allocated\r\n pImg = frameArray_[insertIndex_ % frameArray_.size()].FindImage(i, 0);\r\n if (!pImg)\r\n return false;\r\n\r\n if (pMd)\r\n {\r\n \/\/ TODO: the same metadata is inserted for each channel ???\r\n \/\/ Perhaps we need to add specific tags to each channel\r\n md = *pMd;\r\n }\r\n\r\n std::string cameraName = md.GetSingleTag(\"Camera\").GetValue();\r\n if (imageNumbers_.end() == imageNumbers_.find(cameraName))\r\n {\r\n imageNumbers_[cameraName] = 0;\r\n }\r\n\r\n \/\/ insert image number. \r\n md.put(MM::g_Keyword_Metadata_ImageNumber, CDeviceUtils::ConvertToString(imageNumbers_[cameraName]));\r\n ++imageNumbers_[cameraName];\r\n }\r\n\r\n if (!md.HasTag(MM::g_Keyword_Elapsed_Time_ms))\r\n {\r\n \/\/ if time tag was not supplied by the camera insert current timestamp\r\n MM::MMTime timestamp = GetMMTimeNow();\r\n md.PutImageTag(MM::g_Keyword_Elapsed_Time_ms, CDeviceUtils::ConvertToString(timestamp.getMsec()));\r\n }\r\n\r\n md.PutImageTag(\"Width\",width);\r\n md.PutImageTag(\"Height\",height);\r\n if (byteDepth == 1)\r\n md.PutImageTag(\"PixelType\",\"GRAY8\");\r\n else if (byteDepth == 2)\r\n md.PutImageTag(\"PixelType\",\"GRAY16\");\r\n else if (byteDepth == 4)\r\n md.PutImageTag(\"PixelType\",\"RGB32\");\r\n else if (byteDepth == 8)\r\n md.PutImageTag(\"PixelType\",\"RGB64\");\r\n else \r\n md.PutImageTag(\"PixelType\",\"Unknown\"); \r\n\r\n pImg->SetMetadata(md);\r\n pImg->SetPixels(pixArray + i*singleChannelSize);\r\n }\r\n\r\n {\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n imageCounter_++;\r\n insertIndex_++;\r\n if ((insertIndex_ - (long)frameArray_.size()) > adjustThreshold && (saveIndex_- (long)frameArray_.size()) > adjustThreshold)\r\n {\r\n \/\/ adjust buffer indices to avoid overflowing integer size\r\n insertIndex_ -= adjustThreshold;\r\n saveIndex_ -= adjustThreshold;\r\n }\r\n }\r\n\r\n previousTicks = GetClockTicksMs();\r\n\r\n return true;\r\n\r\n}\r\n\r\n\r\nconst unsigned char* CircularBuffer::GetTopImage() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n if (insertIndex_ == 0)\r\n return frameArray_[0].GetPixels(0, 0);\r\n else\r\n return frameArray_[(insertIndex_-1) % frameArray_.size()].GetPixels(0, 0);\r\n}\r\n\r\nconst ImgBuffer* CircularBuffer::GetTopImageBuffer(unsigned channel, unsigned slice) const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n \/\/ TODO: we may return NULL pointer if channel and slice indexes are wrong\r\n \/\/ this will cause problem in the SWIG - Java layer\r\n if (insertIndex_ == 0)\r\n return frameArray_[0].FindImage(channel, slice);\r\n else\r\n return frameArray_[(insertIndex_-1) % frameArray_.size()].FindImage(channel, slice);\r\n}\r\n\r\n\/**\r\n* Returns an ImgBuffer to the image inserted n images before the last one\r\n*\/\r\nconst ImgBuffer* CircularBuffer::GetNthFromTopImageBuffer(unsigned long n) const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (frameArray_.size() == 0)\r\n return 0;\r\n\r\n if (n >= frameArray_.size() )\r\n return 0;\r\n\r\n if ((unsigned long) insertIndex_ <= n)\r\n {\r\n return frameArray_[(frameArray_.size() - n + insertIndex_ - 1) % frameArray_.size()].FindImage(0, 0);\r\n }\r\n\r\n return frameArray_[(insertIndex_-1-n) % frameArray_.size()].FindImage(0, 0);\r\n}\r\n\r\nconst unsigned char* CircularBuffer::GetNextImage()\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n if (saveIndex_ < insertIndex_)\r\n {\r\n const unsigned char* pBuf = frameArray_[(saveIndex_) % frameArray_.size()].GetPixels(0, 0);\r\n saveIndex_++;\r\n return pBuf;\r\n }\r\n return 0;\r\n}\r\n\r\nconst ImgBuffer* CircularBuffer::GetNextImageBuffer(unsigned channel, unsigned slice)\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n \/\/ TODO: we may return NULL pointer if channel and slice indexes are wrong\r\n \/\/ this will cause problem in the SWIG - Java layer\r\n if (saveIndex_ < insertIndex_)\r\n {\r\n const ImgBuffer* pBuf = frameArray_[(saveIndex_) % frameArray_.size()].FindImage(channel, slice);\r\n saveIndex_++;\r\n return pBuf;\r\n }\r\n return 0;\r\n}\r\n\r\ndouble CircularBuffer::GetAverageIntervalMs() const\r\n{\r\n MMThreadGuard guard(g_bufferLock);\r\n\r\n return (double)estimatedIntervalMs_;\r\n}\r\n\r\n\/\/N.B. an unsigned long millisecond clock tick rolls over in 47 days.\r\n\/\/ millisecond clock tick incrementing from the time first requested\r\nunsigned long CircularBuffer::GetClockTicksMs() const\r\n{\r\n using namespace boost::posix_time;\r\n using namespace boost::gregorian;\r\n \/\/ use tick from the first time this is call is requested\r\n static boost::posix_time::ptime sst(boost::date_time::not_a_date_time);\r\n if (boost::posix_time::ptime(boost::date_time::not_a_date_time) == sst)\r\n {\r\n boost::gregorian::date today( day_clock::local_day());\r\n sst = boost::posix_time::ptime(today); \r\n }\r\n\r\n boost::posix_time::ptime t = boost::posix_time::microsec_clock::local_time();\r\n\r\n time_duration diff = t - sst;\r\n return static_cast<unsigned long>(diff.total_milliseconds());\r\n\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\n#include \"Player.h\"\n\n#define PSPEED 200\n\nPlayer::Player(Projectiles *projs):\npsprite(0),\ninventory(0),\npdir(D2DEDIR_DOWN)\n{\n\n projectiles = projs;\n inventory = new Inventory(projs);\n\n inventory->addPistol();\n inventory->selectPistol();\n\n psprite = new cgf::Sprite();\n\n psprite->load(\"data\/img\/hero_down.png\");\n psprite->setPosition(50,100);\n\n}\n\nPlayer::~Player(){\n delete psprite;\n delete inventory;\n}\n\nvoid Player::setPosition(float x, float y){\n psprite->setPosition(x,y);\n}\n\ncgf::Sprite *Player::getSprite(){\n return psprite;\n}\n\nvoid Player::impulseLeft(){\n psprite->load(\"data\/img\/hero_left.png\");\n psprite->play();\n psprite->setXspeed(-PSPEED);\n pdir = D2DEDIR_LEFT;\n}\n\nvoid Player::impulseUp(){\n psprite->load(\"data\/img\/hero_up.png\");\n psprite->play();\n psprite->setYspeed(-PSPEED);\n pdir = D2DEDIR_UP;\n}\n\nvoid Player::impulseRight(){\n psprite->load(\"data\/img\/hero_right.png\");\n psprite->play();\n psprite->setXspeed(PSPEED);\n pdir = D2DEDIR_RIGHT;\n}\n\nvoid Player::impulseDown(){\n psprite->load(\"data\/img\/hero_down.png\");\n psprite->play();\n psprite->setYspeed(PSPEED);\n pdir = D2DEDIR_DOWN;\n}\n\nvoid Player::impulseHalt(){\n psprite->setCurrentFrame(0);\n psprite->setYspeed(0);\n psprite->setXspeed(0);\n psprite->pause();\n}\n\nvoid Player::impulseShoot()\n{\n sf::Vector2f ppos = psprite->getPosition();\n inventory->getSelectedWeapon()->fire(ppos.x, ppos.y, pdir);\n}\n\nvoid Player::draw(cgf::Game* game){\n game->getScreen()->draw(*psprite);\n}\n\nconst sf::Vector2f& Player::getPosition(){\n return psprite->getPosition();\n}\n\nInventory * Player::getInventory(){\n return this->inventory;\n}\n\nvoid Player::impulseSelectPistol(){\n this->inventory->selectPistol();\n}\n\nvoid Player::impulseSelectShotgun(){\n this->inventory->selectShotgun();\n}\n\nvoid Player::impulseSelectRocketLauncher(){\n this->inventory->selectRocketLauncher();\n}\n<commit_msg>Remove unused animation method calls from player object (we were not able to get the animation stuff to work :( )<commit_after>\n#include \"Player.h\"\n\n#define PSPEED 200\n\nPlayer::Player(Projectiles *projs):\npsprite(0),\ninventory(0),\npdir(D2DEDIR_DOWN)\n{\n\n projectiles = projs;\n inventory = new Inventory(projs);\n\n inventory->addPistol();\n inventory->selectPistol();\n\n psprite = new cgf::Sprite();\n\n psprite->load(\"data\/img\/hero_down.png\");\n psprite->setPosition(50,100);\n\n}\n\nPlayer::~Player(){\n delete psprite;\n delete inventory;\n}\n\nvoid Player::setPosition(float x, float y){\n psprite->setPosition(x,y);\n}\n\ncgf::Sprite *Player::getSprite(){\n return psprite;\n}\n\nvoid Player::impulseLeft(){\n psprite->load(\"data\/img\/hero_left.png\");\n psprite->setXspeed(-PSPEED);\n pdir = D2DEDIR_LEFT;\n}\n\nvoid Player::impulseUp(){\n psprite->load(\"data\/img\/hero_up.png\");\n psprite->setYspeed(-PSPEED);\n pdir = D2DEDIR_UP;\n}\n\nvoid Player::impulseRight(){\n psprite->load(\"data\/img\/hero_right.png\");\n psprite->setXspeed(PSPEED);\n pdir = D2DEDIR_RIGHT;\n}\n\nvoid Player::impulseDown(){\n psprite->load(\"data\/img\/hero_down.png\");\n psprite->setYspeed(PSPEED);\n pdir = D2DEDIR_DOWN;\n}\n\nvoid Player::impulseHalt(){\n psprite->setYspeed(0);\n psprite->setXspeed(0);\n}\n\nvoid Player::impulseShoot()\n{\n sf::Vector2f ppos = psprite->getPosition();\n inventory->getSelectedWeapon()->fire(ppos.x, ppos.y, pdir);\n}\n\nvoid Player::draw(cgf::Game* game){\n game->getScreen()->draw(*psprite);\n}\n\nconst sf::Vector2f& Player::getPosition(){\n return psprite->getPosition();\n}\n\nInventory * Player::getInventory(){\n return this->inventory;\n}\n\nvoid Player::impulseSelectPistol(){\n this->inventory->selectPistol();\n}\n\nvoid Player::impulseSelectShotgun(){\n this->inventory->selectShotgun();\n}\n\nvoid Player::impulseSelectRocketLauncher(){\n this->inventory->selectRocketLauncher();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ HUDRenderer.cpp\n\/\/ G3MiOSSDK\n\/\/\n\/\/ Created by Diego Gomez Deck on 12\/17\/13.\n\/\/\n\/\/\n\n#include \"HUDRenderer.hpp\"\n\n#include \"HUDWidget.hpp\"\n\n#include \"MutableMatrix44D.hpp\"\n#include \"GLFeature.hpp\"\n#include \"GLState.hpp\"\n#include \"GL.hpp\"\n#include \"Context.hpp\"\n\nHUDRenderer::HUDRenderer(bool readyWhenWidgetsReady) :\n_glState(new GLState()),\n_readyWhenWidgetsReady(readyWhenWidgetsReady),\n_context(NULL)\n{\n _widgetsSize = _widgets.size();\n}\n\nHUDRenderer::~HUDRenderer() {\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n delete widget;\n }\n\n _glState->_release();\n\n#ifdef JAVA_CODE\n super.dispose();\n#endif\n}\n\nvoid HUDRenderer::initialize(const G3MContext* context) {\n _context = context;\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->initialize(context);\n }\n}\n\nvoid HUDRenderer::addWidget(HUDWidget* widget) {\n _widgets.push_back(widget);\n _widgetsSize = _widgets.size();\n\n if (_context != NULL) {\n widget->initialize(_context);\n }\n}\n\nRenderState HUDRenderer::getRenderState(const G3MRenderContext* rc) {\n if (_widgetsSize == 0) {\n return RenderState::ready();\n }\n\n _errors.clear();\n bool busyFlag = false;\n bool errorFlag = false;\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n if (widget->isEnable()) {\n const RenderState childRenderState = widget->getRenderState(rc);\n\n const RenderState_Type childRenderStateType = childRenderState._type;\n\n if (childRenderStateType == RENDER_ERROR) {\n errorFlag = true;\n\n const std::vector<std::string> childErrors = childRenderState.getErrors();\n#ifdef C_CODE\n _errors.insert(_errors.end(),\n childErrors.begin(),\n childErrors.end());\n#endif\n#ifdef JAVA_CODE\n _errors.addAll(childErrors);\n#endif\n }\n else if (childRenderStateType == RENDER_BUSY) {\n busyFlag = true;\n }\n }\n }\n\n if (errorFlag) {\n return RenderState::error(_errors);\n }\n else if (busyFlag && _readyWhenWidgetsReady) {\n return RenderState::busy();\n }\n else {\n return RenderState::ready();\n }\n}\n\nbool HUDRenderer::onTouchEvent(const G3MEventContext* ec,\n const TouchEvent* touchEvent) {\n return false;\n}\n\n\nvoid HUDRenderer::onResizeViewportEvent(const G3MEventContext* ec,\n int width,\n int height) {\n const int halfWidth = width \/ 2;\n const int halfHeight = height \/ 2;\n MutableMatrix44D projectionMatrix = MutableMatrix44D::createOrthographicProjectionMatrix(-halfWidth, halfWidth,\n -halfHeight, halfHeight,\n -halfWidth, halfWidth);\n\n ProjectionGLFeature* pr = (ProjectionGLFeature*) _glState->getGLFeature(GLF_PROJECTION);\n if (pr == NULL) {\n _glState->addGLFeature(new ProjectionGLFeature(projectionMatrix.asMatrix44D()),\n false);\n }\n else {\n pr->setMatrix(projectionMatrix.asMatrix44D());\n }\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->onResizeViewportEvent(ec, width, height);\n }\n}\n\nvoid HUDRenderer::render(const G3MRenderContext* rc,\n GLState* glState) {\n\n INativeGL* nativeGL = rc->getGL()->getNative();\n\n nativeGL->depthMask(false);\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->render(rc, _glState);\n }\n\n nativeGL->depthMask(true);\n}\n<commit_msg>slow progress - not yet usable<commit_after>\/\/\n\/\/ HUDRenderer.cpp\n\/\/ G3MiOSSDK\n\/\/\n\/\/ Created by Diego Gomez Deck on 12\/17\/13.\n\/\/\n\/\/\n\n#include \"HUDRenderer.hpp\"\n\n#include \"HUDWidget.hpp\"\n\n#include \"MutableMatrix44D.hpp\"\n#include \"GLFeature.hpp\"\n#include \"GLState.hpp\"\n#include \"GL.hpp\"\n#include \"Context.hpp\"\n\nHUDRenderer::HUDRenderer(bool readyWhenWidgetsReady) :\n_glState(new GLState()),\n_readyWhenWidgetsReady(readyWhenWidgetsReady),\n_context(NULL)\n{\n _widgetsSize = _widgets.size();\n}\n\nHUDRenderer::~HUDRenderer() {\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n delete widget;\n }\n\n _glState->_release();\n\n#ifdef JAVA_CODE\n super.dispose();\n#endif\n}\n\nvoid HUDRenderer::initialize(const G3MContext* context) {\n _context = context;\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->initialize(context);\n }\n}\n\nvoid HUDRenderer::addWidget(HUDWidget* widget) {\n _widgets.push_back(widget);\n _widgetsSize = _widgets.size();\n\n if (_context != NULL) {\n widget->initialize(_context);\n }\n}\n\nRenderState HUDRenderer::getRenderState(const G3MRenderContext* rc) {\n if (_widgetsSize == 0) {\n return RenderState::ready();\n }\n\n _errors.clear();\n bool busyFlag = false;\n bool errorFlag = false;\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n if (widget->isEnable()) {\n const RenderState childRenderState = widget->getRenderState(rc);\n\n const RenderState_Type childRenderStateType = childRenderState._type;\n\n if (childRenderStateType == RENDER_ERROR) {\n errorFlag = true;\n\n const std::vector<std::string> childErrors = childRenderState.getErrors();\n#ifdef C_CODE\n _errors.insert(_errors.end(),\n childErrors.begin(),\n childErrors.end());\n#endif\n#ifdef JAVA_CODE\n _errors.addAll(childErrors);\n#endif\n }\n else if (childRenderStateType == RENDER_BUSY) {\n busyFlag = true;\n }\n }\n }\n\n if (errorFlag) {\n return RenderState::error(_errors);\n }\n else if (busyFlag && _readyWhenWidgetsReady) {\n return RenderState::busy();\n }\n else {\n return RenderState::ready();\n }\n}\n\nbool HUDRenderer::onTouchEvent(const G3MEventContext* ec,\n const TouchEvent* touchEvent) {\n return false;\n}\n\n\nvoid HUDRenderer::onResizeViewportEvent(const G3MEventContext* ec,\n int width,\n int height) {\n const int halfWidth = width \/ 2;\n const int halfHeight = height \/ 2;\n MutableMatrix44D projectionMatrix = MutableMatrix44D::createOrthographicProjectionMatrix(-halfWidth, halfWidth,\n -halfHeight, halfHeight,\n -halfWidth, halfWidth);\n\n ProjectionGLFeature* pr = (ProjectionGLFeature*) _glState->getGLFeature(GLF_PROJECTION);\n if (pr == NULL) {\n _glState->addGLFeature(new ProjectionGLFeature(projectionMatrix.asMatrix44D()),\n false);\n }\n else {\n pr->setMatrix(projectionMatrix.asMatrix44D());\n }\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->onResizeViewportEvent(ec, width, height);\n }\n}\n\nvoid HUDRenderer::render(const G3MRenderContext* rc,\n GLState* glState) {\n if (_widgetsSize == 0) {\n return;\n }\n\n INativeGL* nativeGL = rc->getGL()->getNative();\n\n nativeGL->depthMask(false);\n\n for (int i = 0; i < _widgetsSize; i++) {\n HUDWidget* widget = _widgets[i];\n widget->render(rc, _glState);\n }\n\n nativeGL->depthMask(true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Graph.cpp\n\/\/\n\/\/ Copyright (c) 2012 Jun Kawahara\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software\n\/\/ and associated documentation files (the \"Software\"), to deal in the Software without\n\/\/ restriction, including without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all copies or\n\/\/ substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING\n\/\/ BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\/\/ DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n#include <sstream>\n#include <algorithm>\n#include <list>\n\n#include \"Global.hpp\"\n#include \"Graph.hpp\"\n\nnamespace frontier_dd {\n\nusing namespace std;\n\n\/\/*************************************************************************************************\n\/\/ Edge\n\nEdge::Edge(int src, int dest)\n{\n this->src = src;\n this->dest = dest;\n this->weight = 1.0;\n}\n\nEdge::Edge(int src, int dest, double weight)\n{\n this->src = src;\n this->dest = dest;\n this->weight = weight;\n}\n\n\/\/*************************************************************************************************\n\/\/ Graph\n\nvoid Graph::LoadAdjacencyList(istream& ist, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n number_of_vertices_ = 0;\n\n if (is_directed) { \/\/ directed graph\n LoadAdjacencyListDirected(ist);\n } else {\n LoadAdjacencyListUndirected(ist);\n }\n number_of_edges_ = static_cast<int>(edge_array_.size());\n}\n\nvoid Graph::LoadAdjacencyMatrix(istream&, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n cerr << \"Loading an adjacency matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::LoadIncidenceMatrix(istream&, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n cerr << \"Loading an incidence matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::LoadEdgeList(istream& ist, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n string s;\n std::getline(ist, s);\n istringstream issx(s);\n issx >> number_of_vertices_;\n\n while (std::getline(ist, s)) {\n istringstream iss(s);\n int src, dest;\n iss >> src >> dest;\n\n double weight;\n if (!(iss >> weight)) {\n weight = 1.0;\n }\n edge_array_.push_back(Edge(src, dest, weight));\n }\n number_of_edges_ = static_cast<int>(edge_array_.size());\n}\n\nvoid Graph::SetWeightToEach(istream& ist)\n{\n double c;\n bool is_end = false;\n\n for (int i = 0; i < number_of_vertices_; ++i)\n {\n if (is_end) {\n edge_array_[i].weight = 1.0;\n } else {\n if (ist >> c) {\n edge_array_[i].weight = c;\n } else {\n is_end = true;\n edge_array_[i].weight = 1.0;\n }\n }\n }\n}\n\nvoid Graph::PrintAdjacencyList(ostream& ost) const\n{\n for (int i = 1; i <= number_of_vertices_; ++i) {\n vector<int> vertex_array;\n for (uint j = 0; j < edge_array_.size(); ++j) {\n if (edge_array_[j].src == i && i < edge_array_[j].dest) {\n vertex_array.push_back(edge_array_[j].dest);\n }\n if (edge_array_[j].dest == i && i < edge_array_[j].src) {\n vertex_array.push_back(edge_array_[j].src);\n }\n }\n sort(vertex_array.begin(), vertex_array.end());\n for (uint j = 0; j < vertex_array.size(); ++j) {\n ost << vertex_array[j];\n if (j < vertex_array.size() - 1) {\n ost << \" \";\n }\n }\n ost << endl;\n }\n}\n\nvoid Graph::PrintAdjacencyMatrix(std::ostream& ) const\n{\n cerr << \"Printing an adjacency matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::PrintIncidenceMatrix(std::ostream& ) const\n{\n cerr << \"Printing an incidence matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::PrintEdgeList(ostream& ost) const\n{\n ost << number_of_vertices_ << endl;\n for (uint i = 0; i < edge_array_.size(); ++i) {\n ost << edge_array_[i].src << \" \" << edge_array_[i].dest\n << \" \" << edge_array_[i].weight << endl;\n }\n}\n\nvoid Graph::PrintForGraphviz(ostream& ost) const\n{\n PrintForGraphviz(ost, vector<int>());\n}\n\nvoid Graph::PrintForGraphviz(ostream& ost, const vector<int>& bold_edge_list) const\n{\n ost << \"graph G {\" << endl;\n for (int i = 1; i <= number_of_vertices_; ++i) {\n ost << \"\\t\" << i << \";\" << endl;\n }\n for (uint i = 0; i < edge_array_.size(); ++i) {\n ost << \"\\t\" << edge_array_[i].src << \" -- \" << edge_array_[i].dest\n << \" [label=\" << (i + 1);\n if (find(bold_edge_list.begin(), bold_edge_list.end(), i + 1) != bold_edge_list.end()) {\n ost << \", color=red, penwidth=5\";\n }\n ost << \"];\" << endl;\n }\n ost << \"}\" << endl;\n}\n\nvoid Graph::RearrangeByBreadthFirst(int start_vertex)\n{\n list<Edge> old_edge_list;\n vector<bool> visited_vertex_array(number_of_vertices_ + 1);\n\n for (int i = 1; i <= number_of_vertices_; ++i) {\n visited_vertex_array[i] = false;\n }\n\n for (uint i = 0; i < edge_array_.size(); ++i) {\n old_edge_list.push_back(edge_array_[i]);\n }\n edge_array_.clear();\n\n list<int> vertex_list;\n\n vertex_list.push_back(start_vertex);\n visited_vertex_array[start_vertex] = true;\n while (vertex_list.size() > 0) {\n int v = vertex_list.front();\n vertex_list.pop_front();\n\n vector<int> adjacent_array;\n\n list<Edge>::iterator itor = old_edge_list.begin();\n while (itor != old_edge_list.end()) {\n if (itor->src == v) {\n adjacent_array.push_back(itor->dest);\n itor = old_edge_list.erase(itor);\n } else if (itor->dest == v) {\n adjacent_array.push_back(itor->src);\n itor = old_edge_list.erase(itor);\n } else {\n ++itor;\n }\n }\n\n for (uint i = 0; i < adjacent_array.size(); ++i) {\n int w = adjacent_array[i];\n if (!visited_vertex_array[w]) {\n visited_vertex_array[w] = true;\n vertex_list.push_back(w);\n }\n int v0 = v;\n if (v0 > w) {\n swap(v0, w);\n }\n edge_array_.push_back(Edge(v0, w));\n }\n }\n if (old_edge_list.size() > 0) {\n cerr << \"old_edge_list > 0\" << endl;\n exit(1);\n }\n for (uint i = 1; i < visited_vertex_array.size(); ++i) {\n if (!visited_vertex_array[i]) {\n cerr << \"visited_vertex_array[\" << i << \"] == false\" << endl;\n exit(1);\n }\n }\n}\n\nvoid Graph::AddDummyVertex()\n{\n ++number_of_vertices_;\n\n list<Edge> new_edge_list;\n for (int i = static_cast<int>(edge_array_.size()) - 1; i >= 0; --i) {\n new_edge_list.push_back(edge_array_[i]);\n }\n\n for (int v = number_of_vertices_ - 1; v >= 1; --v) {\n list<Edge>::iterator itor = new_edge_list.begin();\n while (itor != new_edge_list.end()) {\n if (itor->src == v || itor->dest == v) {\n new_edge_list.insert(itor, Edge(v, number_of_vertices_));\n break;\n }\n ++itor;\n }\n if (itor == new_edge_list.end()) {\n new_edge_list.insert(itor, Edge(v, number_of_vertices_));\n }\n }\n\n edge_array_.clear();\n\n list<Edge>::reverse_iterator itor2 = new_edge_list.rbegin();\n while (itor2 != new_edge_list.rend()) {\n edge_array_.push_back(*itor2);\n ++itor2;\n }\n}\n\nvoid Graph::FloydWarshall()\n{\n for (int i = 0; i <= number_of_vertices_; ++i) {\n dist_matrix_.push_back(vector<double>());\n vector<double>& ar = dist_matrix_.back();\n for (int j = 0; j <= number_of_vertices_; ++j) {\n if (i == j) {\n ar.push_back(0);\n } else {\n ar.push_back(99999999.0);\n }\n }\n }\n\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n Edge edge = edge_array_[i];\n if (edge.src != edge.dest) {\n dist_matrix_[edge.src][edge.dest] = edge.weight;\n dist_matrix_[edge.dest][edge.src] = edge.weight;\n }\n }\n\n for (int j = 1; j <= number_of_vertices_; ++j) {\n for (int i = 1; i <= number_of_vertices_; ++i) {\n for (int k = 1; k <= number_of_vertices_; ++k) {\n if (dist_matrix_[i][k] > dist_matrix_[i][j] + dist_matrix_[j][k]) {\n dist_matrix_[i][k] = dist_matrix_[i][j] + dist_matrix_[j][k];\n }\n }\n }\n }\n}\n\nvoid Graph::PrintDistMatrix() const\n{\n for (int j = 1; j <= number_of_vertices_; ++j) {\n for (int i = 1; i <= number_of_vertices_; ++i) {\n cout << dist_matrix_[j][i] << \" \";\n }\n cout << endl;\n }\n}\n\nvoid Graph::RemoveVertices(const vector<int>& remove_array, const vector<int>& new_var_array)\n{\n vector<Edge> new_edge_array;\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n if (std::find(remove_array.begin(), remove_array.end(), edge_array_[i].src)\n == remove_array.end()\n && std::find(remove_array.begin(), remove_array.end(), edge_array_[i].dest)\n == remove_array.end()) {\n new_edge_array.push_back(edge_array_[i]);\n }\n }\n edge_array_ = new_edge_array;\n number_of_edges_ = edge_array_.size();\n number_of_vertices_ -= remove_array.size();\n\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n edge_array_[i].src = new_var_array[edge_array_[i].src];\n edge_array_[i].dest = new_var_array[edge_array_[i].dest];\n }\n}\n\n\/* private *\/ void Graph::LoadAdjacencyListUndirected(istream& ist)\n{\n string s;\n while (std::getline(ist, s)) {\n ++number_of_vertices_;\n istringstream iss(s);\n int x;\n while (iss >> x) {\n Edge edge(number_of_vertices_, x);\n if (number_of_vertices_ > x) {\n std::swap(edge.src, edge.dest);\n }\n\n uint e;\n for (e = 0; e < edge_array_.size(); ++e) {\n if (edge_array_[e].src == edge.src && edge_array_[e].dest == edge.dest) {\n break;\n }\n }\n if (e >= edge_array_.size()) { \/\/ Both src and dest are not found in edge_array_.\n edge_array_.push_back(edge);\n }\n }\n }\n}\n\n\/* private *\/ void Graph::LoadAdjacencyListDirected(istream& ist)\n{\n string s;\n while (std::getline(ist, s)) {\n ++number_of_vertices_;\n istringstream iss(s);\n int x;\n while (iss >> x) {\n edge_array_.push_back(Edge(number_of_vertices_, x));\n }\n }\n}\n\n} \/\/ the end of the namespace\n<commit_msg>Fix loading a graph from the adjacency list (let the number of vertices be the largest index that appears in the list)<commit_after>\/\/\n\/\/ Graph.cpp\n\/\/\n\/\/ Copyright (c) 2012 Jun Kawahara\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software\n\/\/ and associated documentation files (the \"Software\"), to deal in the Software without\n\/\/ restriction, including without limitation the rights to use, copy, modify, merge, publish,\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all copies or\n\/\/ substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING\n\/\/ BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\/\/ DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n#include <sstream>\n#include <algorithm>\n#include <list>\n\n#include \"Global.hpp\"\n#include \"Graph.hpp\"\n\nnamespace frontier_dd {\n\nusing namespace std;\n\n\/\/*************************************************************************************************\n\/\/ Edge\n\nEdge::Edge(int src, int dest)\n{\n this->src = src;\n this->dest = dest;\n this->weight = 1.0;\n}\n\nEdge::Edge(int src, int dest, double weight)\n{\n this->src = src;\n this->dest = dest;\n this->weight = weight;\n}\n\n\/\/*************************************************************************************************\n\/\/ Graph\n\nvoid Graph::LoadAdjacencyList(istream& ist, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n number_of_vertices_ = 0;\n\n if (is_directed) { \/\/ directed graph\n LoadAdjacencyListDirected(ist);\n } else {\n LoadAdjacencyListUndirected(ist);\n }\n number_of_edges_ = static_cast<int>(edge_array_.size());\n}\n\nvoid Graph::LoadAdjacencyMatrix(istream&, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n cerr << \"Loading an adjacency matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::LoadIncidenceMatrix(istream&, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n cerr << \"Loading an incidence matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::LoadEdgeList(istream& ist, bool is_simple, bool is_directed)\n{\n is_simple_ = is_simple;\n is_directed_ = is_directed;\n\n string s;\n std::getline(ist, s);\n istringstream issx(s);\n issx >> number_of_vertices_;\n\n while (std::getline(ist, s)) {\n istringstream iss(s);\n int src, dest;\n iss >> src >> dest;\n\n double weight;\n if (!(iss >> weight)) {\n weight = 1.0;\n }\n edge_array_.push_back(Edge(src, dest, weight));\n }\n number_of_edges_ = static_cast<int>(edge_array_.size());\n}\n\nvoid Graph::SetWeightToEach(istream& ist)\n{\n double c;\n bool is_end = false;\n\n for (int i = 0; i < number_of_vertices_; ++i)\n {\n if (is_end) {\n edge_array_[i].weight = 1.0;\n } else {\n if (ist >> c) {\n edge_array_[i].weight = c;\n } else {\n is_end = true;\n edge_array_[i].weight = 1.0;\n }\n }\n }\n}\n\nvoid Graph::PrintAdjacencyList(ostream& ost) const\n{\n for (int i = 1; i <= number_of_vertices_; ++i) {\n vector<int> vertex_array;\n for (uint j = 0; j < edge_array_.size(); ++j) {\n if (edge_array_[j].src == i && i < edge_array_[j].dest) {\n vertex_array.push_back(edge_array_[j].dest);\n }\n if (edge_array_[j].dest == i && i < edge_array_[j].src) {\n vertex_array.push_back(edge_array_[j].src);\n }\n }\n sort(vertex_array.begin(), vertex_array.end());\n for (uint j = 0; j < vertex_array.size(); ++j) {\n ost << vertex_array[j];\n if (j < vertex_array.size() - 1) {\n ost << \" \";\n }\n }\n ost << endl;\n }\n}\n\nvoid Graph::PrintAdjacencyMatrix(std::ostream& ) const\n{\n cerr << \"Printing an adjacency matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::PrintIncidenceMatrix(std::ostream& ) const\n{\n cerr << \"Printing an incidence matrix is not implemented.\" << endl;\n exit(1);\n}\n\nvoid Graph::PrintEdgeList(ostream& ost) const\n{\n ost << number_of_vertices_ << endl;\n for (uint i = 0; i < edge_array_.size(); ++i) {\n ost << edge_array_[i].src << \" \" << edge_array_[i].dest\n << \" \" << edge_array_[i].weight << endl;\n }\n}\n\nvoid Graph::PrintForGraphviz(ostream& ost) const\n{\n PrintForGraphviz(ost, vector<int>());\n}\n\nvoid Graph::PrintForGraphviz(ostream& ost, const vector<int>& bold_edge_list) const\n{\n ost << \"graph G {\" << endl;\n for (int i = 1; i <= number_of_vertices_; ++i) {\n ost << \"\\t\" << i << \";\" << endl;\n }\n for (uint i = 0; i < edge_array_.size(); ++i) {\n ost << \"\\t\" << edge_array_[i].src << \" -- \" << edge_array_[i].dest\n << \" [label=\" << (i + 1);\n if (find(bold_edge_list.begin(), bold_edge_list.end(), i + 1) != bold_edge_list.end()) {\n ost << \", color=red, penwidth=5\";\n }\n ost << \"];\" << endl;\n }\n ost << \"}\" << endl;\n}\n\nvoid Graph::RearrangeByBreadthFirst(int start_vertex)\n{\n list<Edge> old_edge_list;\n vector<bool> visited_vertex_array(number_of_vertices_ + 1);\n\n for (int i = 1; i <= number_of_vertices_; ++i) {\n visited_vertex_array[i] = false;\n }\n\n for (uint i = 0; i < edge_array_.size(); ++i) {\n old_edge_list.push_back(edge_array_[i]);\n }\n edge_array_.clear();\n\n list<int> vertex_list;\n\n vertex_list.push_back(start_vertex);\n visited_vertex_array[start_vertex] = true;\n while (vertex_list.size() > 0) {\n int v = vertex_list.front();\n vertex_list.pop_front();\n\n vector<int> adjacent_array;\n\n list<Edge>::iterator itor = old_edge_list.begin();\n while (itor != old_edge_list.end()) {\n if (itor->src == v) {\n adjacent_array.push_back(itor->dest);\n itor = old_edge_list.erase(itor);\n } else if (itor->dest == v) {\n adjacent_array.push_back(itor->src);\n itor = old_edge_list.erase(itor);\n } else {\n ++itor;\n }\n }\n\n for (uint i = 0; i < adjacent_array.size(); ++i) {\n int w = adjacent_array[i];\n if (!visited_vertex_array[w]) {\n visited_vertex_array[w] = true;\n vertex_list.push_back(w);\n }\n int v0 = v;\n if (v0 > w) {\n swap(v0, w);\n }\n edge_array_.push_back(Edge(v0, w));\n }\n }\n if (old_edge_list.size() > 0) {\n cerr << \"old_edge_list > 0\" << endl;\n exit(1);\n }\n for (uint i = 1; i < visited_vertex_array.size(); ++i) {\n if (!visited_vertex_array[i]) {\n cerr << \"visited_vertex_array[\" << i << \"] == false\" << endl;\n exit(1);\n }\n }\n}\n\nvoid Graph::AddDummyVertex()\n{\n ++number_of_vertices_;\n\n list<Edge> new_edge_list;\n for (int i = static_cast<int>(edge_array_.size()) - 1; i >= 0; --i) {\n new_edge_list.push_back(edge_array_[i]);\n }\n\n for (int v = number_of_vertices_ - 1; v >= 1; --v) {\n list<Edge>::iterator itor = new_edge_list.begin();\n while (itor != new_edge_list.end()) {\n if (itor->src == v || itor->dest == v) {\n new_edge_list.insert(itor, Edge(v, number_of_vertices_));\n break;\n }\n ++itor;\n }\n if (itor == new_edge_list.end()) {\n new_edge_list.insert(itor, Edge(v, number_of_vertices_));\n }\n }\n\n edge_array_.clear();\n\n list<Edge>::reverse_iterator itor2 = new_edge_list.rbegin();\n while (itor2 != new_edge_list.rend()) {\n edge_array_.push_back(*itor2);\n ++itor2;\n }\n}\n\nvoid Graph::FloydWarshall()\n{\n for (int i = 0; i <= number_of_vertices_; ++i) {\n dist_matrix_.push_back(vector<double>());\n vector<double>& ar = dist_matrix_.back();\n for (int j = 0; j <= number_of_vertices_; ++j) {\n if (i == j) {\n ar.push_back(0);\n } else {\n ar.push_back(99999999.0);\n }\n }\n }\n\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n Edge edge = edge_array_[i];\n if (edge.src != edge.dest) {\n dist_matrix_[edge.src][edge.dest] = edge.weight;\n dist_matrix_[edge.dest][edge.src] = edge.weight;\n }\n }\n\n for (int j = 1; j <= number_of_vertices_; ++j) {\n for (int i = 1; i <= number_of_vertices_; ++i) {\n for (int k = 1; k <= number_of_vertices_; ++k) {\n if (dist_matrix_[i][k] > dist_matrix_[i][j] + dist_matrix_[j][k]) {\n dist_matrix_[i][k] = dist_matrix_[i][j] + dist_matrix_[j][k];\n }\n }\n }\n }\n}\n\nvoid Graph::PrintDistMatrix() const\n{\n for (int j = 1; j <= number_of_vertices_; ++j) {\n for (int i = 1; i <= number_of_vertices_; ++i) {\n cout << dist_matrix_[j][i] << \" \";\n }\n cout << endl;\n }\n}\n\nvoid Graph::RemoveVertices(const vector<int>& remove_array, const vector<int>& new_var_array)\n{\n vector<Edge> new_edge_array;\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n if (std::find(remove_array.begin(), remove_array.end(), edge_array_[i].src)\n == remove_array.end()\n && std::find(remove_array.begin(), remove_array.end(), edge_array_[i].dest)\n == remove_array.end()) {\n new_edge_array.push_back(edge_array_[i]);\n }\n }\n edge_array_ = new_edge_array;\n number_of_edges_ = edge_array_.size();\n number_of_vertices_ -= remove_array.size();\n\n for (unsigned int i = 0; i < edge_array_.size(); ++i) {\n edge_array_[i].src = new_var_array[edge_array_[i].src];\n edge_array_[i].dest = new_var_array[edge_array_[i].dest];\n }\n}\n\n\/* private *\/ void Graph::LoadAdjacencyListUndirected(istream& ist)\n{\n string s;\n int max_vertex = 0;\n while (std::getline(ist, s)) {\n ++number_of_vertices_;\n istringstream iss(s);\n int x;\n while (iss >> x) {\n Edge edge(number_of_vertices_, x);\n if (number_of_vertices_ > x) {\n std::swap(edge.src, edge.dest);\n }\n\n if (max_vertex < x) {\n max_vertex = x;\n }\n\n uint e;\n for (e = 0; e < edge_array_.size(); ++e) {\n if (edge_array_[e].src == edge.src && edge_array_[e].dest == edge.dest) {\n break;\n }\n }\n if (e >= edge_array_.size()) { \/\/ Both src and dest are not found in edge_array_.\n edge_array_.push_back(edge);\n }\n }\n }\n \/\/ The number of vertices is the largest index that appears in the list.\n if (number_of_vertices_ < max_vertex) {\n number_of_vertices_ = max_vertex;\n }\n}\n\n\/* private *\/ void Graph::LoadAdjacencyListDirected(istream& ist)\n{\n string s;\n while (std::getline(ist, s)) {\n ++number_of_vertices_;\n istringstream iss(s);\n int x;\n while (iss >> x) {\n edge_array_.push_back(Edge(number_of_vertices_, x));\n }\n }\n}\n\n} \/\/ the end of the namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode: c++; coding: utf-8 -*-\n#pragma once\n#ifndef WTL_ITERTOOLS_HPP_\n#define WTL_ITERTOOLS_HPP_\n\n#include <vector>\n#include <type_traits>\n#include <limits>\n#include <cmath>\n\n#include <boost\/coroutine2\/coroutine.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\nnamespace wtl { namespace itertools {\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\ntemplate <class value_type>\nclass Product {\n private:\n typedef boost::coroutines2::coroutine<value_type> coro_t;\n const std::vector<value_type> columns_;\n value_type value_;\n typedef typename std::remove_const<decltype(value_.size())>::type size_type;\n size_type col_;\n boost::multiprecision::cpp_int cnt_ = 0;\n public:\n Product() = delete;\n explicit Product(const std::vector<value_type>& columns):\n columns_(columns),\n value_(columns_.size()),\n col_(columns_.size()) {}\n\n typename coro_t::pull_type operator()(const size_type start=0) {\n return typename coro_t::pull_type([this,start](typename coro_t::push_type& yield){source(yield, start);});\n }\n\n void reset() {col_ = columns_.size();}\n boost::multiprecision::cpp_int count() const {return cnt_;}\n boost::multiprecision::cpp_int count_max() const {\n boost::multiprecision::cpp_int i = 1;\n for (const auto& c: columns_) {i *= c.size();}\n return i;\n }\n\n private:\n void source(typename coro_t::push_type& yield, const size_type start) {\n if (--col_ > 0) {\n const size_type n = columns_[col_].size();\n for (size_type i=0; i<n; ++i) {\n value_[col_] = columns_[col_][i];\n source(yield, start);\n }\n ++col_;\n } else {\n const size_type n = columns_[col_].size();\n for (size_type i=0; i<n; ++i) {\n value_[col_] = columns_[col_][i];\n if (cnt_++ >= start) {\n yield(value_type(value_));\n }\n }\n ++col_;\n }\n }\n};\n\ntemplate <class value_type>\nProduct<value_type> product(const std::vector<value_type>& columns) {\n return Product<value_type>(columns);\n}\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\ntemplate <class value_type>\nclass Simplex {\n typedef boost::coroutines2::coroutine<value_type> coro_t;\n Simplex() = delete;\n public:\n explicit Simplex(const std::vector<value_type>& columns, const double sum=1.0):\n product_(columns), sum_(sum) {}\n\n typename coro_t::pull_type operator()(void) {\n return typename coro_t::pull_type([this](typename coro_t::push_type& yield){source(yield);});\n }\n\n void reset() {product_.reset();}\n boost::multiprecision::cpp_int count() const {return cnt_;}\n boost::multiprecision::cpp_int count_all() const {return product_.count();}\n boost::multiprecision::cpp_int count_max() const {return product_.count_max();}\n\n private:\n bool equals(double x) const {\n return std::fabs(x -= sum_) < std::numeric_limits<double>::epsilon();\n }\n\n void source(typename coro_t::push_type& yield) {\n for (const auto& v: product_()) {\n if (equals(v.sum())) {\n ++cnt_;\n yield(v);\n }\n }\n }\n Product<value_type> product_;\n const double sum_;\n boost::multiprecision::cpp_int cnt_ = 0;\n};\n\ntemplate <class value_type>\nSimplex<value_type> simplex(const std::vector<value_type>& columns, const double sum=1.0) {\n return Simplex<value_type>(columns, sum);\n}\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n}} \/\/ namespace wtl::itertools\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\n#endif \/\/ WTL_ITERTOOLS_HPP_\n<commit_msg>Rename variables<commit_after>\/\/ -*- mode: c++; coding: utf-8 -*-\n#pragma once\n#ifndef WTL_ITERTOOLS_HPP_\n#define WTL_ITERTOOLS_HPP_\n\n#include <vector>\n#include <type_traits>\n#include <limits>\n#include <cmath>\n\n#include <boost\/coroutine2\/coroutine.hpp>\n#include <boost\/multiprecision\/cpp_int.hpp>\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\nnamespace wtl { namespace itertools {\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\ntemplate <class value_type>\nclass Product {\n private:\n typedef boost::coroutines2::coroutine<value_type> coro_t;\n const std::vector<value_type> axes_;\n value_type value_;\n typedef typename std::remove_const<decltype(value_.size())>::type size_type;\n size_type pos_;\n boost::multiprecision::cpp_int cnt_ = 0;\n public:\n Product() = delete;\n explicit Product(const std::vector<value_type>& axes):\n axes_(axes),\n value_(axes_.size()),\n pos_(axes_.size()) {}\n\n typename coro_t::pull_type operator()(const size_type start=0) {\n return typename coro_t::pull_type([this,start](typename coro_t::push_type& yield){source(yield, start);});\n }\n\n void reset() {pos_ = axes_.size();}\n boost::multiprecision::cpp_int count() const {return cnt_;}\n boost::multiprecision::cpp_int count_max() const {\n boost::multiprecision::cpp_int i = 1;\n for (const auto& c: axes_) {i *= c.size();}\n return i;\n }\n\n private:\n void source(typename coro_t::push_type& yield, const size_type start) {\n if (--pos_ > 0) {\n const size_type n = axes_[pos_].size();\n for (size_type i=0; i<n; ++i) {\n value_[pos_] = axes_[pos_][i];\n source(yield, start);\n }\n ++pos_;\n } else {\n const size_type n = axes_[pos_].size();\n for (size_type i=0; i<n; ++i) {\n value_[pos_] = axes_[pos_][i];\n if (cnt_++ >= start) {\n yield(value_type(value_));\n }\n }\n ++pos_;\n }\n }\n};\n\ntemplate <class value_type>\nProduct<value_type> product(const std::vector<value_type>& axes) {\n return Product<value_type>(axes);\n}\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\ntemplate <class value_type>\nclass Simplex {\n typedef boost::coroutines2::coroutine<value_type> coro_t;\n Simplex() = delete;\n public:\n explicit Simplex(const std::vector<value_type>& axes, const double sum=1.0):\n product_(axes), sum_(sum) {}\n\n typename coro_t::pull_type operator()(void) {\n return typename coro_t::pull_type([this](typename coro_t::push_type& yield){source(yield);});\n }\n\n void reset() {product_.reset();}\n boost::multiprecision::cpp_int count() const {return cnt_;}\n boost::multiprecision::cpp_int count_all() const {return product_.count();}\n boost::multiprecision::cpp_int count_max() const {return product_.count_max();}\n\n private:\n bool equals(double x) const {\n return std::fabs(x -= sum_) < std::numeric_limits<double>::epsilon();\n }\n\n void source(typename coro_t::push_type& yield) {\n for (const auto& v: product_()) {\n if (equals(v.sum())) {\n ++cnt_;\n yield(v);\n }\n }\n }\n Product<value_type> product_;\n const double sum_;\n boost::multiprecision::cpp_int cnt_ = 0;\n};\n\ntemplate <class value_type>\nSimplex<value_type> simplex(const std::vector<value_type>& axes, const double sum=1.0) {\n return Simplex<value_type>(axes, sum);\n}\n\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n}} \/\/ namespace wtl::itertools\n\/\/\/\/\/\/\/\/\/1\/\/\/\/\/\/\/\/\/2\/\/\/\/\/\/\/\/\/3\/\/\/\/\/\/\/\/\/4\/\/\/\/\/\/\/\/\/5\/\/\/\/\/\/\/\/\/6\/\/\/\/\/\/\/\/\/7\/\/\/\/\/\/\/\/\/\n\n#endif \/\/ WTL_ITERTOOLS_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"mitkInteractionDebugger.h\"\n#include <itkmacro.h>\n\nconst char* mitk::InteractionDebugger::m_CurrentSender = \"\";\nbool mitk::InteractionDebugger::m_Active = false;\n\nmitk::InteractionDebugger::InteractionDebugger()\n{}\n\nvoid mitk::InteractionDebugger::Activate()\n{\n m_Active = true;\n}\n\nvoid mitk::InteractionDebugger::Deactivate()\n{\n m_Active = false;\n}\nmitk::InteractionDebugger::~InteractionDebugger()\n{}\n\nvoid mitk::InteractionDebugger::Set(const char* sender, const char* text)\n{\n if (m_Active)\n {\n itk::OStringStream itkmsg;\n if (! itk::Object::GetGlobalWarningDisplay())\n return;\n\n if (sender != m_CurrentSender)\n {\n itkmsg << sender <<\" :\\n\"<<text<<\"\\n\";\n m_CurrentSender = sender;\n }\n else\n itkmsg<<text<<\"\\n\";\n \n itk::OutputWindowDisplayDebugText(itkmsg.str().c_str());\n }\n}\n\n<commit_msg>FIX: corrected itkMacro include, schönen Urlaub Ingmar<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"mitkInteractionDebugger.h\"\n#include <itkMacro.h>\n\nconst char* mitk::InteractionDebugger::m_CurrentSender = \"\";\nbool mitk::InteractionDebugger::m_Active = false;\n\nmitk::InteractionDebugger::InteractionDebugger()\n{}\n\nvoid mitk::InteractionDebugger::Activate()\n{\n m_Active = true;\n}\n\nvoid mitk::InteractionDebugger::Deactivate()\n{\n m_Active = false;\n}\nmitk::InteractionDebugger::~InteractionDebugger()\n{}\n\nvoid mitk::InteractionDebugger::Set(const char* sender, const char* text)\n{\n if (m_Active)\n {\n itk::OStringStream itkmsg;\n if (! itk::Object::GetGlobalWarningDisplay())\n return;\n\n if (sender != m_CurrentSender)\n {\n itkmsg << sender <<\" :\\n\"<<text<<\"\\n\";\n m_CurrentSender = sender;\n }\n else\n itkmsg<<text<<\"\\n\";\n \n itk::OutputWindowDisplayDebugText(itkmsg.str().c_str());\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"chordobserver.h\"\n#include \"protocol.h\"\n#include \"args.h\"\n#include \"network.h\"\n#include <iostream>\n#include <list>\n#include <algorithm>\n#include <stdio.h>\n\n\nusing namespace std;\n\nChordObserver* ChordObserver::_instance = 0;\n\nChordObserver*\nChordObserver::Instance(Args *a)\n{\n if(!_instance)\n _instance = new ChordObserver(a);\n return _instance;\n}\n\n\nChordObserver::ChordObserver(Args *a)\n{\n if (!a) {\n cout << now() << \"ChordObserver created WRONGLY!\" << endl;\n exit(1);\n }\n _reschedule = 0;\n _reschedule = atoi((*a)[\"reschedule\"].c_str());\n _type = (*a)[\"type\"];\n _num_nodes = atoi((*a)[\"numnodes\"].c_str());\n assert(_num_nodes > 0);\n\n _init_num = atoi((*a)[\"initnodes\"].c_str());\n if (_init_num > 0) {\n init_nodes(_init_num);\n }\n lid.clear();\n _allsorted.clear();\n}\n\nChordObserver::~ChordObserver()\n{\n}\n\n\/*\n * if max = 0 or _num_nodes, then it returns all sorted nodes,\n otherwise, return max number of nodes *\/\n\nvector<Chord::IDMap>\nChordObserver::get_sorted_nodes(unsigned int max)\n{\n if ((!max || (max == _num_nodes)) && _allsorted.size() > 0) {\n return _allsorted;\n }\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n\n vector<Chord::IDMap> ids;\n ids.clear();\n Chord *c;\n Chord::IDMap n;\n unsigned int i = 0;\n\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n n.ip = c->node()->ip();\n n.id = c->id();\n ids.push_back(n);\n\n if (++i == max) {\n break;\n }\n }\n\n sort(ids.begin(),ids.end(),Chord::IDMap::cmp);\n\n if ((!max)|| (max == _num_nodes)) {\n _allsorted = ids;\n }\n return ids;\n}\n\nvoid\nChordObserver::init_nodes(unsigned int num)\n{\n vector<Chord::IDMap> ids;\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n Chord *c;\n \n ids = get_sorted_nodes(num);\n unsigned int i = 0;\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c); \n c->init_state(ids);\n if (++i == num) break;\n }\n printf(\"ChordObserver finished initing %d nodes\\n\", num);\n for (uint i = 0; i < ids.size(); i++) {\n printf(\"%qx %u\\n\", ids[i].id, ids[i].ip);\n }\n}\n\nvoid\nChordObserver::execute()\n{\n if (!_reschedule) {\n return;\n }\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n\n vivaldi_error ();\n \/\/i only want to sort it once after all nodes have joined! \n Chord *c = 0;\n if (lid.size() != _num_nodes) {\n lid.clear();\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n lid.push_back(c->id ());\n }\n\n sort(lid.begin(), lid.end());\n\n vector<ConsistentHash::CHID>::iterator i;\n printf (\"sorted nodes %d %d\\n\", lid.size (), _num_nodes);\n }\n\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n if (!c->stabilized(lid)) {\n cout << now() << \" NOT STABILIZED\" << endl;\n if (_reschedule > 0) reschedule(_reschedule);\n return;\n }\n\n }\n cout << now() << \" STABILIZED\" << endl;\n cout << now() << \" CHORD NODE STATS\" << endl;\n for (pos = l.begin(); pos != l.end(); ++pos) {\n assert(c);\n c = (Chord *)(*pos);\n c->dump();\n }\n}\n\nvoid\nChordObserver::vivaldi_error()\n{\n Topology *t = (Network::Instance()->gettopology());\n assert (t);\n vector<double> avg_errs;\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator outer, inner; \n for (outer = l.begin(); outer != l.end(); ++outer) {\n double sum = 0;\n uint sum_sz = 0;\n Chord *c = (Chord *)(*outer);\n assert (c);\n if (!c->_vivaldi) continue;\n\n cout << \"COORD \" << c->id() << \" \" << now () << \": \";\n Vivaldi::Coord vc = c->get_coords();\n for (uint j = 0; j < vc._v.size(); j++)\n cout << vc._v[j] << \" \";\n\n cout << \"\\n\";\n for (inner = l.begin(); inner != l.end(); ++inner) {\n Chord *h = (Chord *)(*inner);\n assert (h);\n if (!h->_vivaldi) continue;\n Vivaldi::Coord vc1 = h->get_coords ();\n double vd = dist(vc, vc1);\n double rd = t->latency(c->node()->ip(), h->node()->ip());\n if (rd > 0.0 && vd > 0.0) {\n\t\/\/\tcout << c->id () << \" to \" << h->id () << \". Predicted: \" << \n\t\/\/vd << \" real latency was \" << rd << \"\\n\";\n\n\tsum += fabs(vd - rd);\n\tsum_sz++;\n }\n \n }\n if (sum_sz)\n cout << now() << \" average error for \" << c->id () << \": \" << sum\/sum_sz \n \t << \" after \" << c->_vivaldi->nsamples() << endl;\n avg_errs.push_back (sum\/sum_sz);\n }\n\n if (avg_errs.size() > 0) {\n sort (avg_errs.begin(), avg_errs.end());\n \n cout << \" vivaldi median error: \" << avg_errs[avg_errs.size() \/ 2] << \"\\n\";\n }\n}\n<commit_msg>get rid of warning<commit_after>#include \"chordobserver.h\"\n#include \"protocol.h\"\n#include \"args.h\"\n#include \"network.h\"\n#include <iostream>\n#include <list>\n#include <algorithm>\n#include <stdio.h>\n\n\nusing namespace std;\n\nChordObserver* ChordObserver::_instance = 0;\n\nChordObserver*\nChordObserver::Instance(Args *a)\n{\n if(!_instance)\n _instance = new ChordObserver(a);\n return _instance;\n}\n\n\nChordObserver::ChordObserver(Args *a)\n{\n if (!a) {\n cout << now() << \"ChordObserver created WRONGLY!\" << endl;\n exit(1);\n }\n _reschedule = 0;\n _reschedule = atoi((*a)[\"reschedule\"].c_str());\n _type = (*a)[\"type\"];\n _num_nodes = atoi((*a)[\"numnodes\"].c_str());\n assert(_num_nodes > 0);\n\n _init_num = atoi((*a)[\"initnodes\"].c_str());\n if (_init_num > 0) {\n init_nodes(_init_num);\n }\n lid.clear();\n _allsorted.clear();\n}\n\nChordObserver::~ChordObserver()\n{\n}\n\n\/*\n * if max = 0 or _num_nodes, then it returns all sorted nodes,\n otherwise, return max number of nodes *\/\n\nvector<Chord::IDMap>\nChordObserver::get_sorted_nodes(unsigned int max)\n{\n if ((!max || (max == _num_nodes)) && _allsorted.size() > 0) {\n return _allsorted;\n }\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n\n vector<Chord::IDMap> ids;\n ids.clear();\n Chord *c;\n Chord::IDMap n;\n unsigned int i = 0;\n\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n n.ip = c->node()->ip();\n n.id = c->id();\n ids.push_back(n);\n\n if (++i == max) {\n break;\n }\n }\n\n sort(ids.begin(),ids.end(),Chord::IDMap::cmp);\n\n if ((!max)|| (max == _num_nodes)) {\n _allsorted = ids;\n }\n return ids;\n}\n\nvoid\nChordObserver::init_nodes(unsigned int num)\n{\n vector<Chord::IDMap> ids;\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n Chord *c;\n \n ids = get_sorted_nodes(num);\n unsigned int i = 0;\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c); \n c->init_state(ids);\n if (++i == num) break;\n }\n printf(\"ChordObserver finished initing %d nodes\\n\", num);\n for (uint i = 0; i < ids.size(); i++) {\n printf(\"%qx %u\\n\", ids[i].id, ids[i].ip);\n }\n}\n\nvoid\nChordObserver::execute()\n{\n if (!_reschedule) {\n return;\n }\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator pos;\n\n vivaldi_error ();\n \/\/i only want to sort it once after all nodes have joined! \n Chord *c = 0;\n if (lid.size() != _num_nodes) {\n lid.clear();\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n lid.push_back(c->id ());\n }\n\n sort(lid.begin(), lid.end());\n\n \/\/ vector<ConsistentHash::CHID>::iterator i;\n printf (\"sorted nodes %d %d\\n\", lid.size (), _num_nodes);\n }\n\n for (pos = l.begin(); pos != l.end(); ++pos) {\n c = (Chord *)(*pos);\n assert(c);\n if (!c->stabilized(lid)) {\n cout << now() << \" NOT STABILIZED\" << endl;\n if (_reschedule > 0) reschedule(_reschedule);\n return;\n }\n\n }\n cout << now() << \" STABILIZED\" << endl;\n cout << now() << \" CHORD NODE STATS\" << endl;\n for (pos = l.begin(); pos != l.end(); ++pos) {\n assert(c);\n c = (Chord *)(*pos);\n c->dump();\n }\n}\n\nvoid\nChordObserver::vivaldi_error()\n{\n Topology *t = (Network::Instance()->gettopology());\n assert (t);\n vector<double> avg_errs;\n\n list<Protocol*> l = Network::Instance()->getallprotocols(_type);\n list<Protocol*>::iterator outer, inner; \n for (outer = l.begin(); outer != l.end(); ++outer) {\n double sum = 0;\n uint sum_sz = 0;\n Chord *c = (Chord *)(*outer);\n assert (c);\n if (!c->_vivaldi) continue;\n\n cout << \"COORD \" << c->id() << \" \" << now () << \": \";\n Vivaldi::Coord vc = c->get_coords();\n for (uint j = 0; j < vc._v.size(); j++)\n cout << vc._v[j] << \" \";\n\n cout << \"\\n\";\n for (inner = l.begin(); inner != l.end(); ++inner) {\n Chord *h = (Chord *)(*inner);\n assert (h);\n if (!h->_vivaldi) continue;\n Vivaldi::Coord vc1 = h->get_coords ();\n double vd = dist(vc, vc1);\n double rd = t->latency(c->node()->ip(), h->node()->ip());\n if (rd > 0.0 && vd > 0.0) {\n\t\/\/\tcout << c->id () << \" to \" << h->id () << \". Predicted: \" << \n\t\/\/vd << \" real latency was \" << rd << \"\\n\";\n\n\tsum += fabs(vd - rd);\n\tsum_sz++;\n }\n \n }\n if (sum_sz)\n cout << now() << \" average error for \" << c->id () << \": \" << sum\/sum_sz \n \t << \" after \" << c->_vivaldi->nsamples() << endl;\n avg_errs.push_back (sum\/sum_sz);\n }\n\n if (avg_errs.size() > 0) {\n sort (avg_errs.begin(), avg_errs.end());\n \n cout << \" vivaldi median error: \" << avg_errs[avg_errs.size() \/ 2] << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <vector>\n\n#include <SFML\/Window\/Event.hpp>\n\n#include \"MV\/resourceCache\/Cache.hpp\"\n#include \"MV\/mapManager\/MapManager.hpp\"\n#include \"MV\/cell\/Cell.hpp\"\n#include \"MV\/initializator\/Initializator.hpp\"\n#include \"MV\/scene\/Scene.hpp\"\n#include \"MV\/loader\/Loader.hpp\"\n#include \"EventControl.hpp\"\n\nint main()\n{\n\tmv::Scene* scene;\n\tmv::MapManager* mapManager;\n\n\t{\n\t\tmv::Initializator initializator;\n\t\tinitializator.init();\n\n\t\tmv::Loader loader;\n\t\tloader.loadData();\n\n\t\tscene = new mv::Scene(loader.title, sf::Vector2f(loader.ammount.x*loader.cellDimensions.x, loader.ammount.y*loader.cellDimensions.y));\n\t\tmapManager = new mv::MapManager(loader.ammount, loader.cellDimensions);\n\t}\n\n\tmv::EventControl eventControl(scene);\n\tmapManager->constructWholeWorld(mv::constants::defaults::EMPTY);\n\n\t\/\/main game loop\n\twhile (scene->isOpen())\n\t{\n\t\tsf::Event event;\n\n\t\tscene->clear();\n\t\tmapManager->updateCells();\n\t\tscene->drawCollection<mv::Cell>(mapManager->getCellStorage());\n\t\tscene->display();\n\n\t\teventControl.checkEvent(event);\n\t}\n\n\n\treturn 0;\n}\n\t\n<commit_msg>Adapted main<commit_after>#pragma once\n\n#include <vector>\n\n#include <SFML\/Window\/Event.hpp>\n\n#include \"MV\/resourceCache\/Cache.hpp\"\n#include \"MV\/mapManager\/MapManager.hpp\"\n#include \"MV\/cell\/Cell.hpp\"\n#include \"MV\/initializator\/Initializator.hpp\"\n#include \"MV\/scene\/Scene.hpp\"\n#include \"MV\/loader\/Loader.hpp\"\n#include \"EventControl.hpp\"\n\nint main()\n{\n\tmv::MapManager* mapManager;\n\n\t{\n\t\tmv::Initializator::createInstance();\n\t\tmv::Initializator::getInstance().init();\n\n\t\tmv::Loader::createInstance();\n\t\tmv::Loader::getInstance().loadData();\n\n\t\tmv::Scene::createInstance(mv::Loader::getInstance().title, sf::Vector2f(mv::Loader::getInstance().ammount.x*mv::Loader::getInstance().cellDimensions.x, mv::Loader::getInstance().ammount.y*mv::Loader::getInstance().cellDimensions.y));\n\t\t\n\t\tmv::MapManager::createInstance(mv::Loader::getInstance().ammount, mv::Loader::getInstance().cellDimensions);\n\t}\n\n\tmv::EventControl::createInstance(&mv::Scene::getInstance());\n\n\tmv::MapManager::getInstance().constructWholeWorld(mv::constants::defaults::EMPTY);\n\t\/\/main game loop\n\twhile (mv::Scene::getInstance().isOpen())\n\t{\n\t\tsf::Event event;\n\n\t\tmv::Scene::getInstance().clear();\n\t\tmv::MapManager::getInstance().updateCells();\n\t\tmv::Scene::getInstance().drawCollection<mv::Cell>(mv::MapManager::getInstance().getCellStorage());\n\t\tmv::Scene::getInstance().display();\n\n\t\tmv::EventControl::getInstance().checkEvent(event);\n\t}\n\n\n\treturn 0;\n}\n\t\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) <2013-2014>, <BenHJ>\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n 2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n\/**\n * @brief an experimental fuse wrapper around the teasafe container\n *\n * Based on hello.c by Miklos Szeredi\n *\n *\/\n\n#include \"teasafe\/TeaSafe.hpp\"\n#include \"teasafe\/CoreTeaSafeIO.hpp\"\n#include \"utility\/EcholessPasswordPrompt.hpp\"\n\n#include <boost\/make_shared.hpp>\n#include <boost\/program_options.hpp>\n\n#include <fuse.h>\n\n\n#define TeaSafe_DATA ((teasafe::TeaSafe*) fuse_get_context()->private_data)\n\nint exceptionDispatch(teasafe::TeaSafeException const &ex)\n{\n if (ex == teasafe::TeaSafeException(teasafe::TeaSafeError::NotFound)) {\n return -ENOENT;\n }\n if (ex == teasafe::TeaSafeException(teasafe::TeaSafeError::AlreadyExists)) {\n return -EEXIST;\n }\n\n return 0;\n}\n\nstatic int\nteasafe_getattr(const char *path, struct stat *stbuf)\n{\n memset(stbuf, 0, sizeof(struct stat));\n\n if (strcmp(path, \"\/\") == 0) { \/* The root directory of our file system. *\/\n stbuf->st_mode = S_IFDIR | 0777;\n stbuf->st_nlink = 3;\n stbuf->st_blksize = 500;\n return 0;\n } else {\n try {\n teasafe::EntryInfo info = TeaSafe_DATA->getInfo(path);\n if (info.type() == teasafe::EntryType::FolderType) {\n stbuf->st_mode = S_IFDIR | 0777;\n stbuf->st_nlink = 3;\n stbuf->st_blksize = teasafe::detail::FILE_BLOCK_SIZE - teasafe::detail::FILE_BLOCK_META;\n return 0;\n } else if (info.type() == teasafe::EntryType::FileType) {\n stbuf->st_mode = S_IFREG | 0777;\n stbuf->st_nlink = 1;\n stbuf->st_size = info.size();\n stbuf->st_blksize = teasafe::detail::FILE_BLOCK_SIZE - teasafe::detail::FILE_BLOCK_META;\n return 0;\n } else {\n return -ENOENT;\n }\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n }\n\n return 0;\n}\n\nint teasafe_rename(const char *path, const char *newpath)\n{\n try {\n TeaSafe_DATA->renameEntry(path, newpath);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ Create a directory\nstatic int teasafe_mkdir(const char *path, mode_t mode)\n{\n try {\n TeaSafe_DATA->addFolder(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ Remove a file\nstatic int teasafe_unlink(const char *path)\n{\n try {\n TeaSafe_DATA->removeFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ Remove a folder\nstatic int teasafe_rmdir(const char *path)\n{\n try {\n TeaSafe_DATA->removeFolder(path, teasafe::FolderRemovalType::Recursive);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ truncate a file\nstatic int teasafe_truncate(const char *path, off_t newsize)\n{\n try {\n TeaSafe_DATA->truncateFile(path, newsize);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ open a file.. note most reading and writing functionality\n\/\/ is deferred to the respective functions\nstatic int teasafe_open(const char *path, struct fuse_file_info *fi)\n{\n if (!TeaSafe_DATA->fileExists(path)) {\n try {\n TeaSafe_DATA->addFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n }\n\n try {\n teasafe::EntryInfo info = TeaSafe_DATA->getInfo(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\nstatic int teasafe_read(const char *path, char *buf, size_t size, off_t offset, struct fuse_file_info *fi)\n{\n teasafe::FileEntryDevice device = TeaSafe_DATA->openFile(path, teasafe::OpenDisposition::buildReadOnlyDisposition());\n device.seek(offset, std::ios_base::beg);\n return device.read(buf, size);\n}\n\nstatic int teasafe_write(const char *path, const char *buf, size_t size, off_t offset,\n struct fuse_file_info *fi)\n{\n\n teasafe::ReadOrWriteOrBoth openMode = teasafe::ReadOrWriteOrBoth::ReadWrite;\n\n \/*\n if((fi->flags & O_RDWR) == O_RDWR) {\n openMode = teasafe::ReadOrWriteOrBoth::ReadWrite;\n }*\/\n\n teasafe::AppendOrOverwrite appendType = teasafe::AppendOrOverwrite::Append;\n\n if ((fi->flags & O_APPEND) == O_APPEND) {\n appendType = teasafe::AppendOrOverwrite::Append;\n }\n\n teasafe::TruncateOrKeep truncateType = teasafe::TruncateOrKeep::Keep;\n\n if ((fi->flags & O_TRUNC) == O_TRUNC) {\n truncateType = teasafe::TruncateOrKeep::Truncate;\n }\n\n teasafe::OpenDisposition od(openMode, appendType, teasafe::CreateOrDontCreate::Create, truncateType);\n\n teasafe::FileEntryDevice device = TeaSafe_DATA->openFile(path, od);\n device.seek(offset, std::ios_base::beg);\n return device.write(buf, size);\n}\n\nstatic void *teasafe_init(struct fuse_conn_info *conn)\n{\n return TeaSafe_DATA;\n}\n\n\/\/ create file; comment for git test\nstatic int teasafe_create(const char *path, mode_t mode, struct fuse_file_info *fi)\n{\n try {\n TeaSafe_DATA->addFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\nstatic int teasafe_ftruncate(const char *path, off_t offset, struct fuse_file_info *fi)\n{\n try {\n TeaSafe_DATA->truncateFile(path, offset);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ not sure what this does. Not figured out if we need it yet\n\/\/ but I think its called a bunch of times\nstatic int teasafe_opendir(const char *path, struct fuse_file_info *fi)\n{\n return 0;\n}\n\n\n\/\/ list the directory contents\nstatic int teasafe_readdir(const char *path, void *buf, fuse_fill_dir_t filler,\n off_t offset, struct fuse_file_info *fi)\n{\n try {\n teasafe::FolderEntry folder = TeaSafe_DATA->getCurrent(path);\n\n std::vector<teasafe::EntryInfo> infos = folder.listAllEntries();\n std::vector<teasafe::EntryInfo>::iterator it = infos.begin();\n\n filler(buf, \".\", NULL, 0); \/* Current directory (.) *\/\n filler(buf, \"..\", NULL, 0);\n\n for (; it != infos.end(); ++it) {\n struct stat stbuf;\n if (it->type() == teasafe::EntryType::FileType) {\n stbuf.st_mode = S_IFREG | 0755;\n stbuf.st_nlink = 1;\n stbuf.st_size = it->size();\n } else {\n stbuf.st_mode = S_IFDIR | 0744;\n stbuf.st_nlink = 3;\n }\n\n filler(buf, it->filename().c_str(), &stbuf, 0);\n\n }\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ for getting stats about the overall filesystem\n\/\/ (used when issuing a 'df' command). Note that in TeaSafe,\n\/\/ the number of inodes corresponds to the number of blocks\nint teasafe_statfs(const char *path, struct statvfs *statv)\n{\n TeaSafe_DATA->statvfs(statv);\n return 0;\n}\n\nstatic struct fuse_operations teasafe_oper =\n{\n mkdir: teasafe_mkdir,\n unlink: teasafe_unlink,\n rmdir: teasafe_rmdir,\n truncate: teasafe_truncate,\n open: teasafe_open,\n read: teasafe_read,\n write: teasafe_write,\n create: teasafe_create,\n ftruncate: teasafe_ftruncate,\n opendir: teasafe_opendir,\n init: teasafe_init,\n readdir: teasafe_readdir,\n getattr: teasafe_getattr,\n rename: teasafe_rename,\n statfs: teasafe_statfs\n};\n\nint main(int argc, char *argv[])\n{\n\n \/\/ parse the program options\n uint64_t rootBlock;\n bool debug = true;\n bool magic = false;\n namespace po = boost::program_options;\n po::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"help\", \"produce help message\")\n (\"imageName\", po::value<std::string>(), \"teasafe image path\")\n (\"mountPoint\", po::value<std::string>(), \"mountPoint path\")\n (\"debug\", po::value<bool>(&debug)->default_value(true), \"fuse debug\")\n (\"coffee\", po::value<bool>(&magic)->default_value(false), \"mount alternative sub-volume\")\n ;\n\n po::positional_options_description positionalOptions;\n (void)positionalOptions.add(\"imageName\", 1);\n (void)positionalOptions.add(\"mountPoint\", 1);\n\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).\n options(desc).positional(positionalOptions).run(),\n vm);\n po::notify(vm);\n if (vm.count(\"help\") ||\n vm.count(\"mountPoint\")==0 || vm.count(\"imageName\") == 0) {\n std::cout << desc << std::endl;\n return 1;\n }\n\n if (vm.count(\"help\")) {\n std::cout<<desc<<\"\\n\";\n } else {\n\n std::cout<<\"\\nMounting as follows: \\n\\n\";\n std::cout<<\"image path: \"<<vm[\"imageName\"].as<std::string>()<<std::endl;\n std::cout<<\"mount point: \"<<vm[\"mountPoint\"].as<std::string>()<<std::endl;\n std::cout<<\"\\n\";\n\n }\n } catch (...) {\n std::cout<<\"Problem parsing options\"<<std::endl;\n std::cout<<desc<<std::endl;\n return 1;\n }\n\n \/\/ Setup a core teasafe io object which stores highlevel info about accessing\n \/\/ the TeaSafe image\n teasafe::SharedCoreIO io(boost::make_shared<teasafe::CoreTeaSafeIO>());\n io->path = vm[\"imageName\"].as<std::string>().c_str();\n io->password = teasafe::utility::getPassword(\"teasafe password: \");\n io->rootBlock = magic ? atoi(teasafe::utility::getPassword(\"magic number: \").c_str()) : 0;\n\n \/\/ Obtain the number of blocks in the image by reading the image's block count\n teasafe::TeaSafeImageStream stream(io, std::ios::in | std::ios::binary);\n io->blocks = teasafe::detail::getBlockCount(stream);\n\n printf(\"Counting allocated blocks. Please wait...\\n\");\n\n io->freeBlocks = io->blocks - teasafe::detail::getNumberOfAllocatedBlocks(stream);\n\n printf(\"Finished counting allocated blocks.\\n\");\n\n stream.close();\n\n \/\/ Create the basic file system\n teasafe::TeaSafe theBfs(io);\n\n \/\/ make arguments fuse-compatible\n char arg0[] = \"teasafe\";\n char* arg1 = (char*)vm[\"mountPoint\"].as<std::string>().c_str();\n char arg2[] = \"-s\";\n char arg3[] = \"-d\";\n\n#ifdef __APPLE__\n char arg4[] = \"-o\";\n char arg5[] = \"noappledouble\";\n char* fuseArgs[] = { &arg0[0], &arg1[0], &arg2[0], &arg3[0], &arg4[0], &arg5[0], NULL };\n#else\n char* fuseArgs[] = { &arg0[0], &arg1[0], &arg2[0], &arg3[0], NULL };\n#endif\n\n int fuseArgCount = (int)(sizeof(fuseArgs) \/ sizeof(fuseArgs[0])) - 1;\n\n \/\/ turn over control to fuse\n fprintf(stderr, \"about to call fuse_main\\n\");\n int fuse_stat = fuse_main(fuseArgCount, fuseArgs, &teasafe_oper, &theBfs);\n fprintf(stderr, \"fuse_main returned %d\\n\", fuse_stat);\n\n return fuse_stat;\n\n}\n<commit_msg>fuse tinkering<commit_after>\/*\n Copyright (c) <2013-2014>, <BenHJ>\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are met:\n\n 1. Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n 2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n\/**\n * @brief an experimental fuse wrapper around the teasafe container\n *\n * Based on hello.c by Miklos Szeredi\n *\n *\/\n\n#include \"teasafe\/TeaSafe.hpp\"\n#include \"teasafe\/CoreTeaSafeIO.hpp\"\n#include \"utility\/EcholessPasswordPrompt.hpp\"\n\n#include <boost\/make_shared.hpp>\n#include <boost\/program_options.hpp>\n\n#include <fuse.h>\n\n\n#define TeaSafe_DATA ((teasafe::TeaSafe*) fuse_get_context()->private_data)\n\nint exceptionDispatch(teasafe::TeaSafeException const &ex)\n{\n if (ex == teasafe::TeaSafeException(teasafe::TeaSafeError::NotFound)) {\n return -ENOENT;\n }\n if (ex == teasafe::TeaSafeException(teasafe::TeaSafeError::AlreadyExists)) {\n return -EEXIST;\n }\n\n return 0;\n}\n\nstatic int\nteasafe_getattr(const char *path, struct stat *stbuf)\n{\n memset(stbuf, 0, sizeof(struct stat));\n\n if (strcmp(path, \"\/\") == 0) { \/* The root directory of our file system. *\/\n stbuf->st_mode = S_IFDIR | 0777;\n stbuf->st_nlink = 3;\n stbuf->st_blksize = 500;\n return 0;\n } else {\n try {\n teasafe::EntryInfo info = TeaSafe_DATA->getInfo(path);\n if (info.type() == teasafe::EntryType::FolderType) {\n stbuf->st_mode = S_IFDIR | 0777;\n stbuf->st_nlink = 3;\n stbuf->st_blksize = teasafe::detail::FILE_BLOCK_SIZE - teasafe::detail::FILE_BLOCK_META;\n return 0;\n } else if (info.type() == teasafe::EntryType::FileType) {\n stbuf->st_mode = S_IFREG | 0777;\n stbuf->st_nlink = 1;\n stbuf->st_size = info.size();\n stbuf->st_blksize = teasafe::detail::FILE_BLOCK_SIZE - teasafe::detail::FILE_BLOCK_META;\n return 0;\n } else {\n return -ENOENT;\n }\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n }\n\n return 0;\n}\n\nint teasafe_rename(const char *path, const char *newpath)\n{\n try {\n TeaSafe_DATA->renameEntry(path, newpath);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ Create a directory\nstatic int teasafe_mkdir(const char *path, mode_t mode)\n{\n try {\n TeaSafe_DATA->addFolder(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ Remove a file\nstatic int teasafe_unlink(const char *path)\n{\n try {\n TeaSafe_DATA->removeFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ Remove a folder\nstatic int teasafe_rmdir(const char *path)\n{\n try {\n TeaSafe_DATA->removeFolder(path, teasafe::FolderRemovalType::Recursive);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ truncate a file\nstatic int teasafe_truncate(const char *path, off_t newsize)\n{\n try {\n TeaSafe_DATA->truncateFile(path, newsize);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ open a file.. note most reading and writing functionality\n\/\/ is deferred to the respective functions\nstatic int teasafe_open(const char *path, struct fuse_file_info *fi)\n{\n if (!TeaSafe_DATA->fileExists(path)) {\n try {\n TeaSafe_DATA->addFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n }\n\n try {\n teasafe::EntryInfo info = TeaSafe_DATA->getInfo(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\nstatic int teasafe_read(const char *path, char *buf, size_t size, off_t offset, struct fuse_file_info *fi)\n{\n teasafe::FileEntryDevice device = TeaSafe_DATA->openFile(path, teasafe::OpenDisposition::buildReadOnlyDisposition());\n device.seek(offset, std::ios_base::beg);\n return device.read(buf, size);\n}\n\nstatic int teasafe_write(const char *path, const char *buf, size_t size, off_t offset,\n struct fuse_file_info *fi)\n{\n\n teasafe::ReadOrWriteOrBoth openMode = teasafe::ReadOrWriteOrBoth::ReadWrite;\n\n \/*\n if((fi->flags & O_RDWR) == O_RDWR) {\n openMode = teasafe::ReadOrWriteOrBoth::ReadWrite;\n }*\/\n\n teasafe::AppendOrOverwrite appendType = teasafe::AppendOrOverwrite::Append;\n\n if ((fi->flags & O_APPEND) == O_APPEND) {\n appendType = teasafe::AppendOrOverwrite::Append;\n }\n\n teasafe::TruncateOrKeep truncateType = teasafe::TruncateOrKeep::Keep;\n\n if ((fi->flags & O_TRUNC) == O_TRUNC) {\n truncateType = teasafe::TruncateOrKeep::Truncate;\n }\n\n teasafe::OpenDisposition od(openMode, appendType, teasafe::CreateOrDontCreate::Create, truncateType);\n\n teasafe::FileEntryDevice device = TeaSafe_DATA->openFile(path, od);\n device.seek(offset, std::ios_base::beg);\n return device.write(buf, size);\n}\n\nstatic void *teasafe_init(struct fuse_conn_info *conn)\n{\n return TeaSafe_DATA;\n}\n\n\/\/ create file; comment for git test\nstatic int teasafe_create(const char *path, mode_t mode, struct fuse_file_info *fi)\n{\n try {\n TeaSafe_DATA->addFile(path);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\nstatic int teasafe_ftruncate(const char *path, off_t offset, struct fuse_file_info *fi)\n{\n try {\n TeaSafe_DATA->truncateFile(path, offset);\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n return 0;\n}\n\n\/\/ not sure what this does. Not figured out if we need it yet\n\/\/ but I think its called a bunch of times\nstatic int teasafe_opendir(const char *path, struct fuse_file_info *fi)\n{\n return 0;\n}\n\n\n\/\/ list the directory contents\nstatic int teasafe_readdir(const char *path, void *buf, fuse_fill_dir_t filler,\n off_t offset, struct fuse_file_info *fi)\n{\n try {\n teasafe::FolderEntry folder = TeaSafe_DATA->getCurrent(path);\n\n std::vector<teasafe::EntryInfo> infos = folder.listAllEntries();\n std::vector<teasafe::EntryInfo>::iterator it = infos.begin();\n\n filler(buf, \".\", NULL, 0); \/* Current directory (.) *\/\n filler(buf, \"..\", NULL, 0);\n\n for (; it != infos.end(); ++it) {\n struct stat stbuf;\n if (it->type() == teasafe::EntryType::FileType) {\n stbuf.st_mode = S_IFREG | 0755;\n stbuf.st_nlink = 1;\n stbuf.st_size = it->size();\n } else {\n stbuf.st_mode = S_IFDIR | 0744;\n stbuf.st_nlink = 3;\n }\n\n filler(buf, it->filename().c_str(), &stbuf, 0);\n\n }\n } catch (teasafe::TeaSafeException const &e) {\n return exceptionDispatch(e);\n }\n\n return 0;\n}\n\n\/\/ for getting stats about the overall filesystem\n\/\/ (used when issuing a 'df' command). Note that in TeaSafe,\n\/\/ the number of inodes corresponds to the number of blocks\nint teasafe_statfs(const char *path, struct statvfs *statv)\n{\n TeaSafe_DATA->statvfs(statv);\n return 0;\n}\n\nstatic struct fuse_operations teasafe_oper =\n{\n .mkdir = teasafe_mkdir,\n .unlink = teasafe_unlink,\n .rmdir = teasafe_rmdir,\n .truncate = teasafe_truncate,\n .open = teasafe_open,\n .read = teasafe_read,\n .write = teasafe_write,\n .create = teasafe_create,\n .ftruncate = teasafe_ftruncate,\n .opendir = teasafe_opendir,\n .init = teasafe_init,\n .readdir = teasafe_readdir,\n .getattr = teasafe_getattr,\n .rename = teasafe_rename,\n .statfs = teasafe_statfs\n};\n\nint main(int argc, char *argv[])\n{\n\n \/\/ parse the program options\n uint64_t rootBlock;\n bool debug = true;\n bool magic = false;\n namespace po = boost::program_options;\n po::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"help\", \"produce help message\")\n (\"imageName\", po::value<std::string>(), \"teasafe image path\")\n (\"mountPoint\", po::value<std::string>(), \"mountPoint path\")\n (\"debug\", po::value<bool>(&debug)->default_value(true), \"fuse debug\")\n (\"coffee\", po::value<bool>(&magic)->default_value(false), \"mount alternative sub-volume\")\n ;\n\n po::positional_options_description positionalOptions;\n (void)positionalOptions.add(\"imageName\", 1);\n (void)positionalOptions.add(\"mountPoint\", 1);\n\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).\n options(desc).positional(positionalOptions).run(),\n vm);\n po::notify(vm);\n if (vm.count(\"help\") ||\n vm.count(\"mountPoint\")==0 || vm.count(\"imageName\") == 0) {\n std::cout << desc << std::endl;\n return 1;\n }\n\n if (vm.count(\"help\")) {\n std::cout<<desc<<\"\\n\";\n } else {\n\n std::cout<<\"\\nMounting as follows: \\n\\n\";\n std::cout<<\"image path: \"<<vm[\"imageName\"].as<std::string>()<<std::endl;\n std::cout<<\"mount point: \"<<vm[\"mountPoint\"].as<std::string>()<<std::endl;\n std::cout<<\"\\n\";\n\n }\n } catch (...) {\n std::cout<<\"Problem parsing options\"<<std::endl;\n std::cout<<desc<<std::endl;\n return 1;\n }\n\n \/\/ Setup a core teasafe io object which stores highlevel info about accessing\n \/\/ the TeaSafe image\n teasafe::SharedCoreIO io(boost::make_shared<teasafe::CoreTeaSafeIO>());\n io->path = vm[\"imageName\"].as<std::string>().c_str();\n io->password = teasafe::utility::getPassword(\"teasafe password: \");\n io->rootBlock = magic ? atoi(teasafe::utility::getPassword(\"magic number: \").c_str()) : 0;\n\n \/\/ Obtain the number of blocks in the image by reading the image's block count\n teasafe::TeaSafeImageStream stream(io, std::ios::in | std::ios::binary);\n io->blocks = teasafe::detail::getBlockCount(stream);\n\n printf(\"Counting allocated blocks. Please wait...\\n\");\n\n io->freeBlocks = io->blocks - teasafe::detail::getNumberOfAllocatedBlocks(stream);\n\n printf(\"Finished counting allocated blocks.\\n\");\n\n stream.close();\n\n \/\/ Create the basic file system\n teasafe::TeaSafe theBfs(io);\n\n \/\/ make arguments fuse-compatible\n char arg0[] = \"teasafe\";\n char* arg1 = (char*)vm[\"mountPoint\"].as<std::string>().c_str();\n char arg2[] = \"-s\";\n char arg3[] = \"-d\";\n\n#ifdef __APPLE__\n char arg4[] = \"-o\";\n char arg5[] = \"noappledouble\";\n char* fuseArgs[] = { &arg0[0], &arg1[0], &arg2[0], &arg3[0], &arg4[0], &arg5[0], NULL };\n#else\n char* fuseArgs[] = { &arg0[0], &arg1[0], &arg2[0], &arg3[0], NULL };\n#endif\n\n int fuseArgCount = (int)(sizeof(fuseArgs) \/ sizeof(fuseArgs[0])) - 1;\n\n \/\/ turn over control to fuse\n fprintf(stderr, \"about to call fuse_main\\n\");\n int fuse_stat = fuse_main(fuseArgCount, fuseArgs, &teasafe_oper, &theBfs);\n fprintf(stderr, \"fuse_main returned %d\\n\", fuse_stat);\n\n return fuse_stat;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include <mitkGL.h>\n#include \"mitkGeometry2DDataMapper2D.h\"\n\n#include \"mitkBaseRenderer.h\"\n\n#include \"mitkPlaneGeometry.h\"\n\n#include \"mitkColorProperty.h\"\n#include \"mitkProperties.h\"\n#include \"mitkSmartPointerProperty.h\"\n\n#include \"mitkGeometry2DDataToSurfaceFilter.h\"\n#include \"mitkSurfaceMapper2D.h\"\n\n#include \"GL\/glu.h\"\n\n\/\/##ModelId=3E639E100243\nmitk::Geometry2DDataMapper2D::Geometry2DDataMapper2D() : m_SurfaceMapper(NULL)\n{\n}\n\n\/\/##ModelId=3E639E100257\nmitk::Geometry2DDataMapper2D::~Geometry2DDataMapper2D()\n{\n}\n\n\/\/##ModelId=3E6423D20341\nconst mitk::Geometry2DData *mitk::Geometry2DDataMapper2D::GetInput(void)\n{\n return static_cast<const mitk::Geometry2DData * > ( GetData() );\n}\n\nvoid mitk::Geometry2DDataMapper2D::SetDataIteratorToOtherGeometry2Ds(const mitk::DataTreeIteratorBase* iterator)\n{\n if(m_IteratorToOtherGeometry2Ds != iterator)\n {\n m_IteratorToOtherGeometry2Ds = iterator;\n Modified();\n }\n}\n\nvoid mitk::Geometry2DDataMapper2D::GenerateData()\n{\n \/\/collect all Geometry2DData's accessible by traversing m_IteratorToOtherGeometry2Ds\n m_OtherGeometry2Ds.clear();\n if(m_IteratorToOtherGeometry2Ds.IsNull()) return;\n\n mitk::DataTreeIteratorClone it = m_IteratorToOtherGeometry2Ds;\n while(!it->IsAtEnd())\n {\n if(it->Get().IsNotNull())\n {\n mitk::BaseData* data = it->Get()->GetData();\n if(data != NULL)\n {\n mitk::Geometry2DData* geometry2dData = dynamic_cast<mitk::Geometry2DData*>(data);\n if(geometry2dData!=NULL)\n {\n mitk::PlaneGeometry* planegeometry = dynamic_cast<mitk::PlaneGeometry*>(geometry2dData->GetGeometry2D());\n if(planegeometry!=NULL)\n m_OtherGeometry2Ds.push_back(it->Get());\n }\n }\n }\n ++it;\n }\n}\n\n\/\/##ModelId=3E67D77A0109\nvoid mitk::Geometry2DDataMapper2D::Paint(mitk::BaseRenderer * renderer)\n{\n if(IsVisible(renderer)==false) return;\n \n \/\/\t@FIXME: Logik fuer update\n bool updateNeccesary=true;\n \n if (updateNeccesary) {\n \/\/ ok, das ist aus GenerateData kopiert\n \n mitk::Geometry2DData::Pointer input = const_cast<mitk::Geometry2DData*>(this->GetInput());\n \n \/\/intersecting with ourself?\n if(input->GetGeometry2D()==renderer->GetCurrentWorldGeometry2D())\n return; \/\/do nothing!\n \n PlaneGeometry::ConstPointer input_planeGeometry = dynamic_cast<const PlaneGeometry *>(input->GetGeometry2D());\n PlaneGeometry::ConstPointer worldPlaneGeometry = dynamic_cast<const PlaneGeometry*>(renderer->GetCurrentWorldGeometry2D()); \n \n if(worldPlaneGeometry.IsNotNull() && (input_planeGeometry.IsNotNull()))\n {\n mitk::DisplayGeometry::Pointer displayGeometry = renderer->GetDisplayGeometry();\n assert(displayGeometry);\n\n \/\/calculate intersection of the plane data with the border of the world geometry rectangle\n Point2D lineFrom, lineTo;\n bool intersecting = worldPlaneGeometry->IntersectWithPlane2D( input_planeGeometry, lineFrom, lineTo ) > 0;\n\n if(intersecting)\n {\n mitk::Line<ScalarType, 2> line, tmpLine;\n line.SetPoints(lineFrom, lineTo);\n\n displayGeometry->WorldToDisplay(lineFrom, lineFrom);\n displayGeometry->WorldToDisplay(lineTo, lineTo);\n Vector2D l;\n l=lineTo-lineFrom;\n ScalarType lengthInDisplayUnits = l.GetNorm();\n\n std::vector<ScalarType> lineParams;\n lineParams.reserve(m_OtherGeometry2Ds.size()+2);\n lineParams.push_back(0);\n lineParams.push_back(1);\n\n Vector2D d, dOrth;\n NodesVectorType::iterator otherPlanesIt = m_OtherGeometry2Ds.begin();\n NodesVectorType::iterator otherPlanesEnd = m_OtherGeometry2Ds.end();\n while(otherPlanesIt != otherPlanesEnd)\n {\n mitk::PlaneGeometry* otherPlane = static_cast<PlaneGeometry*>(static_cast<Geometry2DData*>((*otherPlanesIt)->GetData())->GetGeometry2D());\n if(otherPlane != input_planeGeometry)\n {\n bool otherIntersecting = worldPlaneGeometry->IntersectWithPlane2D( otherPlane, lineFrom, lineTo ) > 0;\n if(otherIntersecting)\n {\n tmpLine.SetPoints(lineFrom, lineTo);\n d = tmpLine.GetDirection();\n dOrth[0] = -d[1]; dOrth[1] = d[0];\n ScalarType t = (tmpLine.GetPoint1()-line.GetPoint1())*(dOrth);\n ScalarType norm = line.GetDirection()*dOrth;\n if(fabs(norm) > mitk::eps)\n {\n t \/= norm;\n lineParams.push_back(t);\n }\n }\n }\n\n ++otherPlanesIt;\n }\n\n \/\/apply color and opacity read from the PropertyList\n ApplyProperties(renderer);\n\n ScalarType gapSizeInPixel = 10;\n ScalarType gapSizeInParamUnits = 1.0\/lengthInDisplayUnits*gapSizeInPixel;\n\n std::sort(lineParams.begin(), lineParams.end());\n\n Point2D p1, p2;\n ScalarType p1Param, p2Param; \n \n p1Param = lineParams[0];\n p1 = line.GetPoint(p1Param);\n displayGeometry->WorldToDisplay(p1, p1);\n\n unsigned int i, preLastLineParam = lineParams.size()-1;\n for(i=1; i < preLastLineParam; ++i)\n {\n p2Param = lineParams[i]-gapSizeInParamUnits*0.5;\n p2 = line.GetPoint(p2Param);\n if(p2Param > p1Param)\n {\n \/\/convert intersection points (until now mm) to display coordinates (units )\n displayGeometry->WorldToDisplay(p2, p2);\n\n \/\/draw\n glBegin (GL_LINES);\n glVertex2f(p1[0],p1[1]);\n glVertex2f(p2[0],p2[1]);\n glEnd ();\n }\n p1Param = p2Param+gapSizeInParamUnits;\n p1 = line.GetPoint(p1Param);\n displayGeometry->WorldToDisplay(p1, p1);\n }\n \/\/draw last line segment\n p2Param = lineParams[i];\n p2 = line.GetPoint(p2Param);\n displayGeometry->WorldToDisplay(p2, p2);\n glBegin (GL_LINES);\n glVertex2f(p1[0],p1[1]);\n glVertex2f(p2[0],p2[1]);\n glEnd ();\n }\n }\n else\n {\n mitk::Geometry2DDataToSurfaceFilter::Pointer surfaceCreator;\n mitk::SmartPointerProperty::Pointer surfacecreatorprop;\n surfacecreatorprop=dynamic_cast<mitk::SmartPointerProperty*>(GetDataTreeNode()->GetProperty(\"surfacegeometry\", renderer).GetPointer());\n if( (surfacecreatorprop.IsNull()) || \n (surfacecreatorprop->GetSmartPointer().IsNull()) ||\n ((surfaceCreator=dynamic_cast<mitk::Geometry2DDataToSurfaceFilter*>(surfacecreatorprop->GetSmartPointer().GetPointer())).IsNull())\n )\n {\n surfaceCreator = mitk::Geometry2DDataToSurfaceFilter::New();\n surfacecreatorprop=new mitk::SmartPointerProperty(surfaceCreator);\n surfaceCreator->PlaceByGeometryOn();\n GetDataTreeNode()->SetProperty(\"surfacegeometry\", surfacecreatorprop);\n }\n \n surfaceCreator->SetInput(input);\n \n int res;\n bool usegeometryparametricbounds=true;\n if(GetDataTreeNode()->GetIntProperty(\"xresolution\", res, renderer))\n {\n surfaceCreator->SetXResolution(res);\n usegeometryparametricbounds=false; \n }\n if(GetDataTreeNode()->GetIntProperty(\"yresolution\", res, renderer))\n {\n surfaceCreator->SetYResolution(res);\n usegeometryparametricbounds=false; \n }\n surfaceCreator->SetUseGeometryParametricBounds(usegeometryparametricbounds);\n\n surfaceCreator->Update(); \/\/@FIXME ohne das crash\n \n if(m_SurfaceMapper.IsNull())\n m_SurfaceMapper=mitk::SurfaceMapper2D::New();\n m_SurfaceMapper->SetDataTreeNode(GetDataTreeNode());\n m_SurfaceMapper->SetSurface(surfaceCreator->GetOutput());\n \n m_SurfaceMapper->Paint(renderer);\n }\n }\n}\n<commit_msg>FIX: removed obsolute glu.h include<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include <mitkGL.h>\n#include \"mitkGeometry2DDataMapper2D.h\"\n\n#include \"mitkBaseRenderer.h\"\n\n#include \"mitkPlaneGeometry.h\"\n\n#include \"mitkColorProperty.h\"\n#include \"mitkProperties.h\"\n#include \"mitkSmartPointerProperty.h\"\n\n#include \"mitkGeometry2DDataToSurfaceFilter.h\"\n#include \"mitkSurfaceMapper2D.h\"\n\n\/\/##ModelId=3E639E100243\nmitk::Geometry2DDataMapper2D::Geometry2DDataMapper2D() : m_SurfaceMapper(NULL)\n{\n}\n\n\/\/##ModelId=3E639E100257\nmitk::Geometry2DDataMapper2D::~Geometry2DDataMapper2D()\n{\n}\n\n\/\/##ModelId=3E6423D20341\nconst mitk::Geometry2DData *mitk::Geometry2DDataMapper2D::GetInput(void)\n{\n return static_cast<const mitk::Geometry2DData * > ( GetData() );\n}\n\nvoid mitk::Geometry2DDataMapper2D::SetDataIteratorToOtherGeometry2Ds(const mitk::DataTreeIteratorBase* iterator)\n{\n if(m_IteratorToOtherGeometry2Ds != iterator)\n {\n m_IteratorToOtherGeometry2Ds = iterator;\n Modified();\n }\n}\n\nvoid mitk::Geometry2DDataMapper2D::GenerateData()\n{\n \/\/collect all Geometry2DData's accessible by traversing m_IteratorToOtherGeometry2Ds\n m_OtherGeometry2Ds.clear();\n if(m_IteratorToOtherGeometry2Ds.IsNull()) return;\n\n mitk::DataTreeIteratorClone it = m_IteratorToOtherGeometry2Ds;\n while(!it->IsAtEnd())\n {\n if(it->Get().IsNotNull())\n {\n mitk::BaseData* data = it->Get()->GetData();\n if(data != NULL)\n {\n mitk::Geometry2DData* geometry2dData = dynamic_cast<mitk::Geometry2DData*>(data);\n if(geometry2dData!=NULL)\n {\n mitk::PlaneGeometry* planegeometry = dynamic_cast<mitk::PlaneGeometry*>(geometry2dData->GetGeometry2D());\n if(planegeometry!=NULL)\n m_OtherGeometry2Ds.push_back(it->Get());\n }\n }\n }\n ++it;\n }\n}\n\n\/\/##ModelId=3E67D77A0109\nvoid mitk::Geometry2DDataMapper2D::Paint(mitk::BaseRenderer * renderer)\n{\n if(IsVisible(renderer)==false) return;\n \n \/\/\t@FIXME: Logik fuer update\n bool updateNeccesary=true;\n \n if (updateNeccesary) {\n \/\/ ok, das ist aus GenerateData kopiert\n \n mitk::Geometry2DData::Pointer input = const_cast<mitk::Geometry2DData*>(this->GetInput());\n \n \/\/intersecting with ourself?\n if(input->GetGeometry2D()==renderer->GetCurrentWorldGeometry2D())\n return; \/\/do nothing!\n \n PlaneGeometry::ConstPointer input_planeGeometry = dynamic_cast<const PlaneGeometry *>(input->GetGeometry2D());\n PlaneGeometry::ConstPointer worldPlaneGeometry = dynamic_cast<const PlaneGeometry*>(renderer->GetCurrentWorldGeometry2D()); \n \n if(worldPlaneGeometry.IsNotNull() && (input_planeGeometry.IsNotNull()))\n {\n mitk::DisplayGeometry::Pointer displayGeometry = renderer->GetDisplayGeometry();\n assert(displayGeometry);\n\n \/\/calculate intersection of the plane data with the border of the world geometry rectangle\n Point2D lineFrom, lineTo;\n bool intersecting = worldPlaneGeometry->IntersectWithPlane2D( input_planeGeometry, lineFrom, lineTo ) > 0;\n\n if(intersecting)\n {\n mitk::Line<ScalarType, 2> line, tmpLine;\n line.SetPoints(lineFrom, lineTo);\n\n displayGeometry->WorldToDisplay(lineFrom, lineFrom);\n displayGeometry->WorldToDisplay(lineTo, lineTo);\n Vector2D l;\n l=lineTo-lineFrom;\n ScalarType lengthInDisplayUnits = l.GetNorm();\n\n std::vector<ScalarType> lineParams;\n lineParams.reserve(m_OtherGeometry2Ds.size()+2);\n lineParams.push_back(0);\n lineParams.push_back(1);\n\n Vector2D d, dOrth;\n NodesVectorType::iterator otherPlanesIt = m_OtherGeometry2Ds.begin();\n NodesVectorType::iterator otherPlanesEnd = m_OtherGeometry2Ds.end();\n while(otherPlanesIt != otherPlanesEnd)\n {\n mitk::PlaneGeometry* otherPlane = static_cast<PlaneGeometry*>(static_cast<Geometry2DData*>((*otherPlanesIt)->GetData())->GetGeometry2D());\n if(otherPlane != input_planeGeometry)\n {\n bool otherIntersecting = worldPlaneGeometry->IntersectWithPlane2D( otherPlane, lineFrom, lineTo ) > 0;\n if(otherIntersecting)\n {\n tmpLine.SetPoints(lineFrom, lineTo);\n d = tmpLine.GetDirection();\n dOrth[0] = -d[1]; dOrth[1] = d[0];\n ScalarType t = (tmpLine.GetPoint1()-line.GetPoint1())*(dOrth);\n ScalarType norm = line.GetDirection()*dOrth;\n if(fabs(norm) > mitk::eps)\n {\n t \/= norm;\n lineParams.push_back(t);\n }\n }\n }\n\n ++otherPlanesIt;\n }\n\n \/\/apply color and opacity read from the PropertyList\n ApplyProperties(renderer);\n\n ScalarType gapSizeInPixel = 10;\n ScalarType gapSizeInParamUnits = 1.0\/lengthInDisplayUnits*gapSizeInPixel;\n\n std::sort(lineParams.begin(), lineParams.end());\n\n Point2D p1, p2;\n ScalarType p1Param, p2Param; \n \n p1Param = lineParams[0];\n p1 = line.GetPoint(p1Param);\n displayGeometry->WorldToDisplay(p1, p1);\n\n unsigned int i, preLastLineParam = lineParams.size()-1;\n for(i=1; i < preLastLineParam; ++i)\n {\n p2Param = lineParams[i]-gapSizeInParamUnits*0.5;\n p2 = line.GetPoint(p2Param);\n if(p2Param > p1Param)\n {\n \/\/convert intersection points (until now mm) to display coordinates (units )\n displayGeometry->WorldToDisplay(p2, p2);\n\n \/\/draw\n glBegin (GL_LINES);\n glVertex2f(p1[0],p1[1]);\n glVertex2f(p2[0],p2[1]);\n glEnd ();\n }\n p1Param = p2Param+gapSizeInParamUnits;\n p1 = line.GetPoint(p1Param);\n displayGeometry->WorldToDisplay(p1, p1);\n }\n \/\/draw last line segment\n p2Param = lineParams[i];\n p2 = line.GetPoint(p2Param);\n displayGeometry->WorldToDisplay(p2, p2);\n glBegin (GL_LINES);\n glVertex2f(p1[0],p1[1]);\n glVertex2f(p2[0],p2[1]);\n glEnd ();\n }\n }\n else\n {\n mitk::Geometry2DDataToSurfaceFilter::Pointer surfaceCreator;\n mitk::SmartPointerProperty::Pointer surfacecreatorprop;\n surfacecreatorprop=dynamic_cast<mitk::SmartPointerProperty*>(GetDataTreeNode()->GetProperty(\"surfacegeometry\", renderer).GetPointer());\n if( (surfacecreatorprop.IsNull()) || \n (surfacecreatorprop->GetSmartPointer().IsNull()) ||\n ((surfaceCreator=dynamic_cast<mitk::Geometry2DDataToSurfaceFilter*>(surfacecreatorprop->GetSmartPointer().GetPointer())).IsNull())\n )\n {\n surfaceCreator = mitk::Geometry2DDataToSurfaceFilter::New();\n surfacecreatorprop=new mitk::SmartPointerProperty(surfaceCreator);\n surfaceCreator->PlaceByGeometryOn();\n GetDataTreeNode()->SetProperty(\"surfacegeometry\", surfacecreatorprop);\n }\n \n surfaceCreator->SetInput(input);\n \n int res;\n bool usegeometryparametricbounds=true;\n if(GetDataTreeNode()->GetIntProperty(\"xresolution\", res, renderer))\n {\n surfaceCreator->SetXResolution(res);\n usegeometryparametricbounds=false; \n }\n if(GetDataTreeNode()->GetIntProperty(\"yresolution\", res, renderer))\n {\n surfaceCreator->SetYResolution(res);\n usegeometryparametricbounds=false; \n }\n surfaceCreator->SetUseGeometryParametricBounds(usegeometryparametricbounds);\n\n surfaceCreator->Update(); \/\/@FIXME ohne das crash\n \n if(m_SurfaceMapper.IsNull())\n m_SurfaceMapper=mitk::SurfaceMapper2D::New();\n m_SurfaceMapper->SetDataTreeNode(GetDataTreeNode());\n m_SurfaceMapper->SetSurface(surfaceCreator->GetOutput());\n \n m_SurfaceMapper->Paint(renderer);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include \"KafkaEventSubscriber.h\"\n\nnamespace {\nconst int static PARTITION = 0;\n}\n\nKafkaEventSubscriber::~KafkaEventSubscriber() {\n m_consumer_ptr->stop(m_topic_ptr.get(), PARTITION);\n \/\/ rdkafka example polls after stop() is called,\n \/\/ not sure why but doing the same here for now\n m_consumer_ptr->poll(1000);\n \/\/ Wait for RdKafka to decommission, avoids complaints of memory leak from\n \/\/ valgrind etc.\n RdKafka::wait_destroyed(5000);\n}\n\nvoid KafkaEventSubscriber::setUp(const std::string &broker_str,\n const std::string &topic_str) {\n std::string error_str;\n\n RdKafka::Conf *conf = RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL);\n RdKafka::Conf *tconf = RdKafka::Conf::create(RdKafka::Conf::CONF_TOPIC);\n\n conf->set(\"metadata.broker.list\", broker_str, error_str);\n conf->set(\"message.max.bytes\", \"10000000\", error_str);\n conf->set(\"fetch.message.max.bytes\", \"10000000\", error_str);\n conf->set(\"replica.fetch.max.bytes\", \"10000000\", error_str);\n\n \/\/ Create consumer using accumulated global configuration.\n m_consumer_ptr = std::unique_ptr<RdKafka::Consumer>(\n RdKafka::Consumer::create(conf, error_str));\n if (!m_consumer_ptr.get()) {\n std::cerr << \"Failed to create consumer: \" << error_str << std::endl;\n exit(1);\n }\n\n std::cout << \"% Created consumer \" << m_consumer_ptr->name() << std::endl;\n\n \/\/ Create topic handle.\n m_topic_ptr = std::unique_ptr<RdKafka::Topic>(RdKafka::Topic::create(\n m_consumer_ptr.get(), topic_str, tconf, error_str));\n if (!m_topic_ptr.get()) {\n std::cerr << \"Failed to create topic: \" << error_str << std::endl;\n exit(1);\n }\n\n \/\/ Start consumer for topic+partition at start offset\n RdKafka::ErrorCode resp =\n m_consumer_ptr->start(m_topic_ptr.get(), PARTITION, RdKafka::Topic::OFFSET_END);\n if (resp != RdKafka::ERR_NO_ERROR) {\n std::cerr << \"Failed to start consumer: \" << RdKafka::err2str(resp)\n << std::endl;\n exit(1);\n }\n}\n\nbool KafkaEventSubscriber::listenForMessage(std::string &message) {\n RdKafka::Message *msg =\n m_consumer_ptr->consume(m_topic_ptr.get(), PARTITION, 1000);\n bool success = messageConsume(msg, message);\n m_consumer_ptr->poll(0);\n delete msg;\n return success;\n}\n\nbool KafkaEventSubscriber::messageConsume(RdKafka::Message *msg,\n std::string &message) {\n switch (msg->err()) {\n case RdKafka::ERR__TIMED_OUT:\n break;\n\n case RdKafka::ERR_NO_ERROR:\n \/* Real message *\/\n if (msg->len() == 0) {\n std::cout << \"Warning: message received had 0 length payload!\"\n << std::endl;\n return false;\n }\n if (msg->key()) {\n std::cout << \"Key: \" << *msg->key() << std::endl;\n }\n message.assign(static_cast<const char *>(msg->payload()),\n static_cast<int>(msg->len()));\n return true;\n\n case RdKafka::ERR__PARTITION_EOF:\n return false;\n\n default:\n \/* Errors *\/\n std::cerr << \"Consume failed: \" << msg->errstr() << std::endl;\n }\n return false;\n}\n<commit_msg>use unique pointers for kafka confs<commit_after>#include <iostream>\n\n#include \"KafkaEventSubscriber.h\"\n\nnamespace {\nconst int static PARTITION = 0;\n}\n\nKafkaEventSubscriber::~KafkaEventSubscriber() {\n m_consumer_ptr->stop(m_topic_ptr.get(), PARTITION);\n \/\/ rdkafka example polls after stop() is called,\n \/\/ not sure why but doing the same here for now\n m_consumer_ptr->poll(1000);\n \/\/ Wait for RdKafka to decommission, avoids complaints of memory leak from\n \/\/ valgrind etc.\n RdKafka::wait_destroyed(5000);\n}\n\nvoid KafkaEventSubscriber::setUp(const std::string &broker_str,\n const std::string &topic_str) {\n std::string error_str;\n\n auto conf = std::unique_ptr<RdKafka::Conf>(\n RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL));\n auto tconf = std::unique_ptr<RdKafka::Conf>(\n RdKafka::Conf::create(RdKafka::Conf::CONF_TOPIC));\n\n conf->set(\"metadata.broker.list\", broker_str, error_str);\n conf->set(\"message.max.bytes\", \"10000000\", error_str);\n conf->set(\"fetch.message.max.bytes\", \"10000000\", error_str);\n conf->set(\"replica.fetch.max.bytes\", \"10000000\", error_str);\n\n \/\/ Create consumer using accumulated global configuration.\n m_consumer_ptr = std::unique_ptr<RdKafka::Consumer>(\n RdKafka::Consumer::create(conf.get(), error_str));\n if (!m_consumer_ptr.get()) {\n std::cerr << \"Failed to create consumer: \" << error_str << std::endl;\n exit(1);\n }\n\n std::cout << \"% Created consumer \" << m_consumer_ptr->name() << std::endl;\n\n \/\/ Create topic handle.\n m_topic_ptr = std::unique_ptr<RdKafka::Topic>(RdKafka::Topic::create(\n m_consumer_ptr.get(), topic_str, tconf.get(), error_str));\n if (!m_topic_ptr.get()) {\n std::cerr << \"Failed to create topic: \" << error_str << std::endl;\n exit(1);\n }\n\n \/\/ Start consumer for topic+partition at start offset\n RdKafka::ErrorCode resp = m_consumer_ptr->start(m_topic_ptr.get(), PARTITION,\n RdKafka::Topic::OFFSET_END);\n if (resp != RdKafka::ERR_NO_ERROR) {\n std::cerr << \"Failed to start consumer: \" << RdKafka::err2str(resp)\n << std::endl;\n exit(1);\n }\n}\n\nbool KafkaEventSubscriber::listenForMessage(std::string &message) {\n RdKafka::Message *msg =\n m_consumer_ptr->consume(m_topic_ptr.get(), PARTITION, 1000);\n bool success = messageConsume(msg, message);\n m_consumer_ptr->poll(0);\n delete msg;\n return success;\n}\n\nbool KafkaEventSubscriber::messageConsume(RdKafka::Message *msg,\n std::string &message) {\n switch (msg->err()) {\n case RdKafka::ERR__TIMED_OUT:\n break;\n\n case RdKafka::ERR_NO_ERROR:\n \/* Real message *\/\n if (msg->len() == 0) {\n std::cout << \"Warning: message received had 0 length payload!\"\n << std::endl;\n return false;\n }\n if (msg->key()) {\n std::cout << \"Key: \" << *msg->key() << std::endl;\n }\n message.assign(static_cast<const char *>(msg->payload()),\n static_cast<int>(msg->len()));\n return true;\n\n case RdKafka::ERR__PARTITION_EOF:\n return false;\n\n default:\n \/* Errors *\/\n std::cerr << \"Consume failed: \" << msg->errstr() << std::endl;\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013-2019 Feathercoin developers\n\/\/ Copyright (c) 2011-2013 PPCoin developers\n\/\/ Copyright (c) 2013 Primecoin developers\n\/\/ Distributed under conditional MIT\/X11 software license,\n\/\/ see the accompanying file COPYING\n\/\/\n\/\/ The synchronized checkpoint system is first developed by Sunny King for\n\/\/ ppcoin network in 2012, giving cryptocurrency developers a tool to gain\n\/\/ additional network protection against 51% attack.\n\/\/\n\/\/ Primecoin also adopts this security mechanism, and the enforcement of\n\/\/ checkpoints is explicitly granted by user, thus granting only temporary\n\/\/ consensual central control to developer at the threats of 51% attack.\n\/\/\n\/\/ Concepts\n\/\/\n\/\/ In the network there can be a privileged node known as 'checkpoint master'.\n\/\/ This node can send out checkpoint messages signed by the checkpoint master\n\/\/ key. Each checkpoint is a block hash, representing a block on the blockchain\n\/\/ that the network should reach consensus on.\n\/\/\n\/\/ Besides verifying signatures of checkpoint messages, each node also verifies\n\/\/ the consistency of the checkpoints. If a conflicting checkpoint is received,\n\/\/ it means either the checkpoint master key is compromised, or there is an\n\/\/ operator mistake. In this situation the node would discard the conflicting\n\/\/ checkpoint message and display a warning message. This precaution controls\n\/\/ the damage to network caused by operator mistake or compromised key.\n\/\/\n\/\/ Operations\n\/\/\n\/\/ Any node can be turned into checkpoint master by setting the 'checkpointkey'\n\/\/ configuration parameter with the private key of the checkpoint master key.\n\/\/ Operator should exercise caution such that at any moment there is at most\n\/\/ one node operating as checkpoint master. When switching master node, the\n\/\/ recommended procedure is to shutdown the master node and restart as\n\/\/ regular node, note down the current checkpoint by 'getcheckpoint', then\n\/\/ compare to the checkpoint at the new node to be upgraded to master node.\n\/\/ When the checkpoint on both nodes match then it is safe to switch the new\n\/\/ node to checkpoint master.\n\/\/\n\/\/ The configuration parameter 'checkpointdepth' specifies how many blocks\n\/\/ should the checkpoints lag behind the latest block in auto checkpoint mode.\n\/\/ A depth of 5 is the minimum auto checkpoint policy and offers the greatest\n\/\/ protection against 51% attack.\n\/\/\n\n#include <checkpointsync.h>\n\n#include <chainparams.h>\n#include <key_io.h>\n#include <logging.h>\n#include <netmessagemaker.h>\n#include <txdb.h>\n#include <validation.h>\n\n\/\/ Synchronized checkpoint (centrally broadcasted)\nstd::string CSyncCheckpoint::strMasterPrivKey;\nuint256 hashSyncCheckpoint;\nstatic uint256 hashPendingCheckpoint;\nCSyncCheckpoint checkpointMessage;\nstatic CSyncCheckpoint checkpointMessagePending;\n\n\n\/\/ Only descendant of current sync-checkpoint is allowed\nbool ValidateSyncCheckpoint(uint256 hashCheckpoint)\n{\n CBlockIndex* pindexSyncCheckpoint;\n CBlockIndex* pindexCheckpointRecv;\n\n {\n LOCK(cs_main);\n\n if (!::BlockIndex().count(hashSyncCheckpoint))\n return error(\"%s: block index missing for current sync-checkpoint %s\", __func__, hashSyncCheckpoint.ToString());\n if (!::BlockIndex().count(hashCheckpoint))\n return error(\"%s: block index missing for received sync-checkpoint %s\", __func__, hashCheckpoint.ToString());\n\n pindexSyncCheckpoint = ::BlockIndex()[hashSyncCheckpoint];\n pindexCheckpointRecv = ::BlockIndex()[hashCheckpoint];\n }\n\n if (pindexCheckpointRecv->nHeight <= pindexSyncCheckpoint->nHeight)\n {\n \/\/ Received an older checkpoint, trace back from current checkpoint\n \/\/ to the same height of the received checkpoint to verify\n \/\/ that current checkpoint should be a descendant block\n CBlockIndex* pindex = pindexSyncCheckpoint;\n while (pindex->nHeight > pindexCheckpointRecv->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev1 null - block index structure failure\", __func__);\n if (pindex->GetBlockHash() != hashCheckpoint)\n {\n return error(\"%s: new sync-checkpoint %s is conflicting with current sync-checkpoint %s\", __func__, hashCheckpoint.ToString(), hashSyncCheckpoint.ToString());\n }\n return false; \/\/ ignore older checkpoint\n }\n\n \/\/ Received checkpoint should be a descendant block of the current\n \/\/ checkpoint. Trace back to the same height of current checkpoint\n \/\/ to verify.\n CBlockIndex* pindex = pindexCheckpointRecv;\n while (pindex->nHeight > pindexSyncCheckpoint->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev2 null - block index structure failure\", __func__);\n\n if (pindex->GetBlockHash() != hashSyncCheckpoint)\n {\n return error(\"%s: new sync-checkpoint %s is not a descendant of current sync-checkpoint %s\", __func__, hashCheckpoint.ToString(), hashSyncCheckpoint.ToString());\n }\n return true;\n}\n\nbool WriteSyncCheckpoint(const uint256& hashCheckpoint)\n{\n if (!pblocktree->WriteSyncCheckpoint(hashCheckpoint))\n return error(\"%s: failed to write to txdb sync checkpoint %s\", __func__, hashCheckpoint.ToString());\n\n ::ChainstateActive().ForceFlushStateToDisk();\n hashSyncCheckpoint = hashCheckpoint;\n return true;\n}\n\nbool AcceptPendingSyncCheckpoint()\n{\n LOCK(cs_main);\n bool havePendingCheckpoint = hashPendingCheckpoint != uint256() && ::BlockIndex().count(hashPendingCheckpoint);\n if (!havePendingCheckpoint)\n return false;\n\n if (!ValidateSyncCheckpoint(hashPendingCheckpoint))\n {\n hashPendingCheckpoint = uint256();\n checkpointMessagePending.SetNull();\n return false;\n }\n\n if (!::ChainActive().Contains(::BlockIndex()[hashPendingCheckpoint]))\n return false;\n\n if (!WriteSyncCheckpoint(hashPendingCheckpoint)) {\n return error(\"%s: failed to write sync checkpoint %s\", __func__, hashPendingCheckpoint.ToString());\n }\n\n hashPendingCheckpoint = uint256();\n checkpointMessage = checkpointMessagePending;\n checkpointMessagePending.SetNull();\n\n \/\/ Relay the checkpoint\n if (g_connman && !checkpointMessage.IsNull())\n {\n g_connman->ForEachNode([](CNode* pnode) {\n if (pnode->supportACPMessages)\n checkpointMessage.RelayTo(pnode);\n });\n }\n\n return true;\n}\n\n\/\/ Automatically select a suitable sync-checkpoint\nuint256 AutoSelectSyncCheckpoint()\n{\n \/\/ Search backward for a block with specified depth policy\n const CBlockIndex *pindex = ::ChainActive().Tip();\n while (pindex->pprev && pindex->nHeight + gArgs.GetArg(\"-checkpointdepth\", DEFAULT_AUTOCHECKPOINT) > ::ChainActive().Tip()->nHeight)\n pindex = pindex->pprev;\n return pindex->GetBlockHash();\n}\n\n\/\/ Check against synchronized checkpoint\nbool CheckSyncCheckpoint(const uint256 hashBlock, const int nHeight)\n{\n LOCK(cs_main);\n\n \/\/ Genesis block\n if (nHeight == 0) {\n return true;\n }\n\n \/\/ Checkpoint on default\n if (hashSyncCheckpoint == uint256()) {\n return true;\n }\n\n \/\/ sync-checkpoint should always be accepted block\n assert(::BlockIndex().count(hashSyncCheckpoint));\n const CBlockIndex* pindexSync = ::BlockIndex()[hashSyncCheckpoint];\n\n if (nHeight > pindexSync->nHeight)\n {\n \/\/ Trace back to same height as sync-checkpoint\n const CBlockIndex* pindex = ::ChainActive().Tip();\n while (pindex->nHeight > pindexSync->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev null - block index structure failure\", __func__);\n if (pindex->nHeight < pindexSync->nHeight || pindex->GetBlockHash() != hashSyncCheckpoint)\n return false; \/\/ only descendant of sync-checkpoint can pass check\n }\n if (nHeight == pindexSync->nHeight && hashBlock != hashSyncCheckpoint)\n return error(\"%s: Same height with sync-checkpoint\", __func__);\n if (nHeight < pindexSync->nHeight && !::BlockIndex().count(hashBlock))\n return error(\"%s: Lower height than sync-checkpoint\", __func__);\n return true;\n}\n\n\/\/ Reset synchronized checkpoint to the genesis block\nbool ResetSyncCheckpoint()\n{\n LOCK(cs_main);\n\n if (!WriteSyncCheckpoint(Params().GetConsensus().hashGenesisBlock))\n return error(\"%s: failed to reset sync checkpoint to genesis block\", __func__);\n\n return true;\n}\n\n\/\/ Verify sync checkpoint master pubkey and reset sync checkpoint if changed\nbool CheckCheckpointPubKey()\n{\n std::string strPubKey = \"\";\n std::string strMasterPubKey = Params().GetConsensus().checkpointPubKey;\n\n if (!pblocktree->ReadCheckpointPubKey(strPubKey) || strPubKey != strMasterPubKey)\n {\n \/\/ write checkpoint master key to db\n if (!ResetSyncCheckpoint())\n return error(\"%s: failed to reset sync-checkpoint\", __func__);\n if (!pblocktree->WriteCheckpointPubKey(strMasterPubKey))\n return error(\"%s: failed to write new checkpoint master key to db\", __func__);\n ::ChainstateActive().ForceFlushStateToDisk();\n }\n\n return true;\n}\n\nbool SetCheckpointPrivKey(std::string strPrivKey)\n{\n CKey key = DecodeSecret(strPrivKey);\n if (!key.IsValid())\n return false;\n\n CSyncCheckpoint::strMasterPrivKey = strPrivKey;\n return true;\n}\n\nbool SendSyncCheckpoint(uint256 hashCheckpoint)\n{\n \/\/ P2P disabled\n if (!g_connman)\n return true;\n\n \/\/ No connections\n if (g_connman->GetNodeCount(CConnman::CONNECTIONS_ALL) == 0)\n return true;\n\n \/\/ Do not send dummy checkpoint\n if (hashCheckpoint == uint256())\n return true;\n\n CSyncCheckpoint checkpoint;\n checkpoint.hashCheckpoint = hashCheckpoint;\n CDataStream sMsg(SER_NETWORK, PROTOCOL_VERSION);\n sMsg << static_cast<CUnsignedSyncCheckpoint>(checkpoint);\n checkpoint.vchMsg = std::vector<unsigned char>(sMsg.begin(), sMsg.end());\n\n if (CSyncCheckpoint::strMasterPrivKey.empty())\n return error(\"%s: Checkpoint master key unavailable.\", __func__);\n\n CKey key = DecodeSecret(CSyncCheckpoint::strMasterPrivKey);\n if (!key.IsValid())\n return error(\"%s: Checkpoint master key invalid\", __func__);\n\n if (!key.Sign(Hash(checkpoint.vchMsg.begin(), checkpoint.vchMsg.end()), checkpoint.vchSig))\n return error(\"%s: Unable to sign checkpoint, check private key?\", __func__);\n\n if(!checkpoint.ProcessSyncCheckpoint())\n return error(\"%s: Failed to process checkpoint.\", __func__);\n\n \/\/ Relay checkpoint\n g_connman->ForEachNode([checkpoint](CNode* pnode) {\n checkpoint.RelayTo(pnode);\n });\n\n return true;\n}\n\n\nvoid CUnsignedSyncCheckpoint::SetNull()\n{\n nVersion = 1;\n hashCheckpoint = uint256();\n}\n\nstd::string CUnsignedSyncCheckpoint::ToString() const\n{\n return strprintf(\n \"CSyncCheckpoint(\\n\"\n \" nVersion = %d\\n\"\n \" hashCheckpoint = %s\\n\"\n \")\\n\",\n nVersion,\n hashCheckpoint.ToString());\n}\n\nCSyncCheckpoint::CSyncCheckpoint()\n{\n SetNull();\n}\n\nvoid CSyncCheckpoint::SetNull()\n{\n CUnsignedSyncCheckpoint::SetNull();\n vchMsg.clear();\n vchSig.clear();\n}\n\nbool CSyncCheckpoint::IsNull() const\n{\n return (hashCheckpoint == uint256());\n}\n\nuint256 CSyncCheckpoint::GetHash() const\n{\n return Hash(this->vchMsg.begin(), this->vchMsg.end());\n}\n\nvoid CSyncCheckpoint::RelayTo(CNode* pfrom) const\n{\n if (g_connman && pfrom->hashCheckpointKnown != hashCheckpoint && pfrom->supportACPMessages)\n {\n pfrom->hashCheckpointKnown = hashCheckpoint;\n g_connman->PushMessage(pfrom, CNetMsgMaker(pfrom->GetSendVersion()).Make(NetMsgType::CHECKPOINT, *this));\n }\n}\n\n\/\/ Verify signature of sync-checkpoint message\nbool CSyncCheckpoint::CheckSignature()\n{\n std::string strMasterPubKey = Params().GetConsensus().checkpointPubKey;\n CPubKey key(ParseHex(strMasterPubKey));\n if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))\n return error(\"%s: verify signature failed\", __func__);\n\n \/\/ Now unserialize the data\n CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);\n sMsg >> *static_cast<CUnsignedSyncCheckpoint*>(this);\n return true;\n}\n\n\/\/ Process synchronized checkpoint\nbool CSyncCheckpoint::ProcessSyncCheckpoint()\n{\n if (!CheckSignature())\n return false;\n\n LOCK(cs_main);\n\n if (!::BlockIndex().count(hashCheckpoint) || !::ChainActive().Contains(::BlockIndex()[hashCheckpoint]))\n {\n \/\/ We haven't received the checkpoint chain, keep the checkpoint as pending\n hashPendingCheckpoint = hashCheckpoint;\n checkpointMessagePending = *this;\n LogPrintf(\"%s: pending for sync-checkpoint %s\\n\", __func__, hashCheckpoint.ToString());\n\n return false;\n }\n\n if (!ValidateSyncCheckpoint(hashCheckpoint))\n return false;\n\n if (!WriteSyncCheckpoint(hashCheckpoint)) {\n return error(\"%s: failed to write sync checkpoint %s\\n\", __func__, hashCheckpoint.ToString());\n }\n\n checkpointMessage = *this;\n hashPendingCheckpoint = uint256();\n checkpointMessagePending.SetNull();\n\n return true;\n}\n<commit_msg>Checkpoint sync do not force flush to disk<commit_after>\/\/ Copyright (c) 2013-2019 Feathercoin developers\n\/\/ Copyright (c) 2011-2013 PPCoin developers\n\/\/ Copyright (c) 2013 Primecoin developers\n\/\/ Distributed under conditional MIT\/X11 software license,\n\/\/ see the accompanying file COPYING\n\/\/\n\/\/ The synchronized checkpoint system is first developed by Sunny King for\n\/\/ ppcoin network in 2012, giving cryptocurrency developers a tool to gain\n\/\/ additional network protection against 51% attack.\n\/\/\n\/\/ Primecoin also adopts this security mechanism, and the enforcement of\n\/\/ checkpoints is explicitly granted by user, thus granting only temporary\n\/\/ consensual central control to developer at the threats of 51% attack.\n\/\/\n\/\/ Concepts\n\/\/\n\/\/ In the network there can be a privileged node known as 'checkpoint master'.\n\/\/ This node can send out checkpoint messages signed by the checkpoint master\n\/\/ key. Each checkpoint is a block hash, representing a block on the blockchain\n\/\/ that the network should reach consensus on.\n\/\/\n\/\/ Besides verifying signatures of checkpoint messages, each node also verifies\n\/\/ the consistency of the checkpoints. If a conflicting checkpoint is received,\n\/\/ it means either the checkpoint master key is compromised, or there is an\n\/\/ operator mistake. In this situation the node would discard the conflicting\n\/\/ checkpoint message and display a warning message. This precaution controls\n\/\/ the damage to network caused by operator mistake or compromised key.\n\/\/\n\/\/ Operations\n\/\/\n\/\/ Any node can be turned into checkpoint master by setting the 'checkpointkey'\n\/\/ configuration parameter with the private key of the checkpoint master key.\n\/\/ Operator should exercise caution such that at any moment there is at most\n\/\/ one node operating as checkpoint master. When switching master node, the\n\/\/ recommended procedure is to shutdown the master node and restart as\n\/\/ regular node, note down the current checkpoint by 'getcheckpoint', then\n\/\/ compare to the checkpoint at the new node to be upgraded to master node.\n\/\/ When the checkpoint on both nodes match then it is safe to switch the new\n\/\/ node to checkpoint master.\n\/\/\n\/\/ The configuration parameter 'checkpointdepth' specifies how many blocks\n\/\/ should the checkpoints lag behind the latest block in auto checkpoint mode.\n\/\/ A depth of 5 is the minimum auto checkpoint policy and offers the greatest\n\/\/ protection against 51% attack.\n\/\/\n\n#include <checkpointsync.h>\n\n#include <chainparams.h>\n#include <key_io.h>\n#include <logging.h>\n#include <netmessagemaker.h>\n#include <txdb.h>\n#include <validation.h>\n\n\/\/ Synchronized checkpoint (centrally broadcasted)\nstd::string CSyncCheckpoint::strMasterPrivKey;\nuint256 hashSyncCheckpoint;\nstatic uint256 hashPendingCheckpoint;\nCSyncCheckpoint checkpointMessage;\nstatic CSyncCheckpoint checkpointMessagePending;\n\n\n\/\/ Only descendant of current sync-checkpoint is allowed\nbool ValidateSyncCheckpoint(uint256 hashCheckpoint)\n{\n CBlockIndex* pindexSyncCheckpoint;\n CBlockIndex* pindexCheckpointRecv;\n\n {\n LOCK(cs_main);\n\n if (!::BlockIndex().count(hashSyncCheckpoint))\n return error(\"%s: block index missing for current sync-checkpoint %s\", __func__, hashSyncCheckpoint.ToString());\n if (!::BlockIndex().count(hashCheckpoint))\n return error(\"%s: block index missing for received sync-checkpoint %s\", __func__, hashCheckpoint.ToString());\n\n pindexSyncCheckpoint = ::BlockIndex()[hashSyncCheckpoint];\n pindexCheckpointRecv = ::BlockIndex()[hashCheckpoint];\n }\n\n if (pindexCheckpointRecv->nHeight <= pindexSyncCheckpoint->nHeight)\n {\n \/\/ Received an older checkpoint, trace back from current checkpoint\n \/\/ to the same height of the received checkpoint to verify\n \/\/ that current checkpoint should be a descendant block\n CBlockIndex* pindex = pindexSyncCheckpoint;\n while (pindex->nHeight > pindexCheckpointRecv->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev1 null - block index structure failure\", __func__);\n if (pindex->GetBlockHash() != hashCheckpoint)\n {\n return error(\"%s: new sync-checkpoint %s is conflicting with current sync-checkpoint %s\", __func__, hashCheckpoint.ToString(), hashSyncCheckpoint.ToString());\n }\n return false; \/\/ ignore older checkpoint\n }\n\n \/\/ Received checkpoint should be a descendant block of the current\n \/\/ checkpoint. Trace back to the same height of current checkpoint\n \/\/ to verify.\n CBlockIndex* pindex = pindexCheckpointRecv;\n while (pindex->nHeight > pindexSyncCheckpoint->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev2 null - block index structure failure\", __func__);\n\n if (pindex->GetBlockHash() != hashSyncCheckpoint)\n {\n return error(\"%s: new sync-checkpoint %s is not a descendant of current sync-checkpoint %s\", __func__, hashCheckpoint.ToString(), hashSyncCheckpoint.ToString());\n }\n return true;\n}\n\nbool WriteSyncCheckpoint(const uint256& hashCheckpoint)\n{\n if (!pblocktree->WriteSyncCheckpoint(hashCheckpoint))\n return error(\"%s: failed to write to txdb sync checkpoint %s\", __func__, hashCheckpoint.ToString());\n\n hashSyncCheckpoint = hashCheckpoint;\n return true;\n}\n\nbool AcceptPendingSyncCheckpoint()\n{\n LOCK(cs_main);\n bool havePendingCheckpoint = hashPendingCheckpoint != uint256() && ::BlockIndex().count(hashPendingCheckpoint);\n if (!havePendingCheckpoint)\n return false;\n\n if (!ValidateSyncCheckpoint(hashPendingCheckpoint))\n {\n hashPendingCheckpoint = uint256();\n checkpointMessagePending.SetNull();\n return false;\n }\n\n if (!::ChainActive().Contains(::BlockIndex()[hashPendingCheckpoint]))\n return false;\n\n if (!WriteSyncCheckpoint(hashPendingCheckpoint)) {\n return error(\"%s: failed to write sync checkpoint %s\", __func__, hashPendingCheckpoint.ToString());\n }\n\n hashPendingCheckpoint = uint256();\n checkpointMessage = checkpointMessagePending;\n checkpointMessagePending.SetNull();\n\n \/\/ Relay the checkpoint\n if (g_connman && !checkpointMessage.IsNull())\n {\n g_connman->ForEachNode([](CNode* pnode) {\n if (pnode->supportACPMessages)\n checkpointMessage.RelayTo(pnode);\n });\n }\n\n return true;\n}\n\n\/\/ Automatically select a suitable sync-checkpoint\nuint256 AutoSelectSyncCheckpoint()\n{\n \/\/ Search backward for a block with specified depth policy\n const CBlockIndex *pindex = ::ChainActive().Tip();\n while (pindex->pprev && pindex->nHeight + gArgs.GetArg(\"-checkpointdepth\", DEFAULT_AUTOCHECKPOINT) > ::ChainActive().Tip()->nHeight)\n pindex = pindex->pprev;\n return pindex->GetBlockHash();\n}\n\n\/\/ Check against synchronized checkpoint\nbool CheckSyncCheckpoint(const uint256 hashBlock, const int nHeight)\n{\n LOCK(cs_main);\n\n \/\/ Genesis block\n if (nHeight == 0) {\n return true;\n }\n\n \/\/ Checkpoint on default\n if (hashSyncCheckpoint == uint256()) {\n return true;\n }\n\n \/\/ sync-checkpoint should always be accepted block\n assert(::BlockIndex().count(hashSyncCheckpoint));\n const CBlockIndex* pindexSync = ::BlockIndex()[hashSyncCheckpoint];\n\n if (nHeight > pindexSync->nHeight)\n {\n \/\/ Trace back to same height as sync-checkpoint\n const CBlockIndex* pindex = ::ChainActive().Tip();\n while (pindex->nHeight > pindexSync->nHeight)\n if (!(pindex = pindex->pprev))\n return error(\"%s: pprev null - block index structure failure\", __func__);\n if (pindex->nHeight < pindexSync->nHeight || pindex->GetBlockHash() != hashSyncCheckpoint)\n return false; \/\/ only descendant of sync-checkpoint can pass check\n }\n if (nHeight == pindexSync->nHeight && hashBlock != hashSyncCheckpoint)\n return error(\"%s: Same height with sync-checkpoint\", __func__);\n if (nHeight < pindexSync->nHeight && !::BlockIndex().count(hashBlock))\n return error(\"%s: Lower height than sync-checkpoint\", __func__);\n return true;\n}\n\n\/\/ Reset synchronized checkpoint to the genesis block\nbool ResetSyncCheckpoint()\n{\n LOCK(cs_main);\n\n if (!WriteSyncCheckpoint(Params().GetConsensus().hashGenesisBlock))\n return error(\"%s: failed to reset sync checkpoint to genesis block\", __func__);\n\n return true;\n}\n\n\/\/ Verify sync checkpoint master pubkey and reset sync checkpoint if changed\nbool CheckCheckpointPubKey()\n{\n std::string strPubKey = \"\";\n std::string strMasterPubKey = Params().GetConsensus().checkpointPubKey;\n\n if (!pblocktree->ReadCheckpointPubKey(strPubKey) || strPubKey != strMasterPubKey)\n {\n \/\/ write checkpoint master key to db\n if (!ResetSyncCheckpoint())\n return error(\"%s: failed to reset sync-checkpoint\", __func__);\n if (!pblocktree->WriteCheckpointPubKey(strMasterPubKey))\n return error(\"%s: failed to write new checkpoint master key to db\", __func__);\n }\n\n return true;\n}\n\nbool SetCheckpointPrivKey(std::string strPrivKey)\n{\n CKey key = DecodeSecret(strPrivKey);\n if (!key.IsValid())\n return false;\n\n CSyncCheckpoint::strMasterPrivKey = strPrivKey;\n return true;\n}\n\nbool SendSyncCheckpoint(uint256 hashCheckpoint)\n{\n \/\/ P2P disabled\n if (!g_connman)\n return true;\n\n \/\/ No connections\n if (g_connman->GetNodeCount(CConnman::CONNECTIONS_ALL) == 0)\n return true;\n\n \/\/ Do not send dummy checkpoint\n if (hashCheckpoint == uint256())\n return true;\n\n CSyncCheckpoint checkpoint;\n checkpoint.hashCheckpoint = hashCheckpoint;\n CDataStream sMsg(SER_NETWORK, PROTOCOL_VERSION);\n sMsg << static_cast<CUnsignedSyncCheckpoint>(checkpoint);\n checkpoint.vchMsg = std::vector<unsigned char>(sMsg.begin(), sMsg.end());\n\n if (CSyncCheckpoint::strMasterPrivKey.empty())\n return error(\"%s: Checkpoint master key unavailable.\", __func__);\n\n CKey key = DecodeSecret(CSyncCheckpoint::strMasterPrivKey);\n if (!key.IsValid())\n return error(\"%s: Checkpoint master key invalid\", __func__);\n\n if (!key.Sign(Hash(checkpoint.vchMsg.begin(), checkpoint.vchMsg.end()), checkpoint.vchSig))\n return error(\"%s: Unable to sign checkpoint, check private key?\", __func__);\n\n if(!checkpoint.ProcessSyncCheckpoint())\n return error(\"%s: Failed to process checkpoint.\", __func__);\n\n \/\/ Relay checkpoint\n g_connman->ForEachNode([checkpoint](CNode* pnode) {\n checkpoint.RelayTo(pnode);\n });\n\n return true;\n}\n\n\nvoid CUnsignedSyncCheckpoint::SetNull()\n{\n nVersion = 1;\n hashCheckpoint = uint256();\n}\n\nstd::string CUnsignedSyncCheckpoint::ToString() const\n{\n return strprintf(\n \"CSyncCheckpoint(\\n\"\n \" nVersion = %d\\n\"\n \" hashCheckpoint = %s\\n\"\n \")\\n\",\n nVersion,\n hashCheckpoint.ToString());\n}\n\nCSyncCheckpoint::CSyncCheckpoint()\n{\n SetNull();\n}\n\nvoid CSyncCheckpoint::SetNull()\n{\n CUnsignedSyncCheckpoint::SetNull();\n vchMsg.clear();\n vchSig.clear();\n}\n\nbool CSyncCheckpoint::IsNull() const\n{\n return (hashCheckpoint == uint256());\n}\n\nuint256 CSyncCheckpoint::GetHash() const\n{\n return Hash(this->vchMsg.begin(), this->vchMsg.end());\n}\n\nvoid CSyncCheckpoint::RelayTo(CNode* pfrom) const\n{\n if (g_connman && pfrom->hashCheckpointKnown != hashCheckpoint && pfrom->supportACPMessages)\n {\n pfrom->hashCheckpointKnown = hashCheckpoint;\n g_connman->PushMessage(pfrom, CNetMsgMaker(pfrom->GetSendVersion()).Make(NetMsgType::CHECKPOINT, *this));\n }\n}\n\n\/\/ Verify signature of sync-checkpoint message\nbool CSyncCheckpoint::CheckSignature()\n{\n std::string strMasterPubKey = Params().GetConsensus().checkpointPubKey;\n CPubKey key(ParseHex(strMasterPubKey));\n if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))\n return error(\"%s: verify signature failed\", __func__);\n\n \/\/ Now unserialize the data\n CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);\n sMsg >> *static_cast<CUnsignedSyncCheckpoint*>(this);\n return true;\n}\n\n\/\/ Process synchronized checkpoint\nbool CSyncCheckpoint::ProcessSyncCheckpoint()\n{\n if (!CheckSignature())\n return false;\n\n LOCK(cs_main);\n\n if (!::BlockIndex().count(hashCheckpoint) || !::ChainActive().Contains(::BlockIndex()[hashCheckpoint]))\n {\n \/\/ We haven't received the checkpoint chain, keep the checkpoint as pending\n hashPendingCheckpoint = hashCheckpoint;\n checkpointMessagePending = *this;\n LogPrintf(\"%s: pending for sync-checkpoint %s\\n\", __func__, hashCheckpoint.ToString());\n\n return false;\n }\n\n if (!ValidateSyncCheckpoint(hashCheckpoint))\n return false;\n\n if (!WriteSyncCheckpoint(hashCheckpoint)) {\n return error(\"%s: failed to write sync checkpoint %s\\n\", __func__, hashCheckpoint.ToString());\n }\n\n checkpointMessage = *this;\n hashPendingCheckpoint = uint256();\n checkpointMessagePending.SetNull();\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: fuconcs.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: rt $ $Date: 2005-03-29 15:27:41 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"fuconcs.hxx\"\n\n#ifndef _SVDPAGV_HXX \/\/autogen\n#include <svx\/svdpagv.hxx>\n#endif\n\n#pragma hdrstop\n\n#include <svx\/svxids.hrc>\n#include <svx\/dialogs.hrc>\n#include <svx\/dialmgr.hxx>\n\n#include \"app.hrc\"\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n\n#ifndef _SVX_XLNSTWIT_HXX \/\/autogen\n#include <svx\/xlnstwit.hxx>\n#endif\n#ifndef _SVX_XLNEDWIT_HXX \/\/autogen\n#include <svx\/xlnedwit.hxx>\n#endif\n#ifndef _SVX_XLNEDIT_HXX \/\/autogen\n#include <svx\/xlnedit.hxx>\n#endif\n#ifndef _SVX_XLNSTIT_HXX \/\/autogen\n#include <svx\/xlnstit.hxx>\n#endif\n#ifndef _SVX_XLNWTIT_HXX \/\/autogen\n#include <svx\/xlnwtit.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SDTMFITM_HXX \/\/autogen\n#include <svx\/sdtmfitm.hxx>\n#endif\n#ifndef _SXEKITM_HXX \/\/autogen\n#include <svx\/sxekitm.hxx>\n#endif\n#ifndef _SDERITM_HXX \/\/autogen\n#include <svx\/sderitm.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _SVDOPATH_HXX \/\/autogen\n#include <svx\/svdopath.hxx>\n#endif\n#ifndef _SVDOCIRC_HXX \/\/autogen\n#include <svx\/svdocirc.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _EEITEMID_HXX\n#include <svx\/eeitemid.hxx>\n#endif\n#ifndef _SVX_ADJITEM_HXX\n#include <svx\/adjitem.hxx>\n#endif\n#ifndef _XTABLE_HXX\n#include <svx\/xtable.hxx>\n#endif\n#ifndef _SDASITM_HXX\n#include <svx\/sdasitm.hxx>\n#endif\n#ifndef _SVX_TBXCUSTOMSHAPES_HXX\n#include <svx\/tbxcustomshapes.hxx>\n#endif\n#ifndef _SVDOASHP_HXX\n#include <svx\/svdoashp.hxx>\n#endif\n#ifndef _SDTAGITM_HXX\n#include <svx\/sdtagitm.hxx>\n#endif\n\n\/\/ #88751#\n#ifndef _SVDCAPT_HXX\n#include <svx\/svdocapt.hxx>\n#endif\n\n\/\/ #97016#\n#ifndef _SVDOMEAS_HXX\n#include <svx\/svdomeas.hxx>\n#endif\n\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n#ifndef SD_OBJECT_BAR_MANAGER_HXX\n#include \"ObjectBarManager.hxx\"\n#endif\n\/\/ #109583#\n#ifndef _SVX_WRITINGMODEITEM_HXX\n#include <svx\/writingmodeitem.hxx>\n#endif\n#ifndef _GALLERY_HXX_\n#include <svx\/gallery.hxx>\n#endif\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"sdpage.hxx\"\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"stlpool.hxx\"\n#include \"drawdoc.hxx\"\n#include \"res_bmp.hrc\"\n#include \"glob.hrc\"\n\nnamespace sd {\n\nTYPEINIT1( FuConstructCustomShape, FuConstruct );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConstructCustomShape::FuConstructCustomShape (\n ViewShell* pViewSh,\n ::sd::Window* pWin,\n ::sd::View* pView,\n SdDrawDocument* pDoc,\n SfxRequest& rReq ) :\n FuConstruct(pViewSh, pWin, pView, pDoc, rReq)\n{\n const SfxItemSet* pArgs = rReq.GetArgs();\n if ( pArgs )\n {\n const SfxStringItem& rItm = (const SfxStringItem&)pArgs->Get( rReq.GetSlot() );\n aCustomShape = rItm.GetValue();\n }\n pViewShell->GetObjectBarManager().SwitchObjectBar( RID_DRAW_OBJ_TOOLBOX );\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nFuConstructCustomShape::~FuConstructCustomShape()\n{\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonDown-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseButtonDown(const MouseEvent& rMEvt)\n{\n BOOL bReturn = FuConstruct::MouseButtonDown(rMEvt);\n\n if ( rMEvt.IsLeft() && !pView->IsAction() )\n {\n Point aPnt( pWindow->PixelToLogic( rMEvt.GetPosPixel() ) );\n\n pWindow->CaptureMouse();\n USHORT nDrgLog = USHORT ( pWindow->PixelToLogic(Size(DRGPIX,0)).Width() );\n\n pView->BegCreateObj(aPnt, (OutputDevice*) NULL, nDrgLog);\n\n SdrObject* pObj = pView->GetCreateObj();\n if ( pObj )\n {\n SetAttributes( pObj );\n sal_Bool bForceFillStyle = sal_True;\n sal_Bool bForceNoFillStyle = sal_False;\n if ( ((SdrObjCustomShape*)pObj)->UseNoFillStyle() )\n {\n bForceFillStyle = sal_False;\n bForceNoFillStyle = sal_True;\n }\n SfxItemSet aAttr(pDoc->GetPool());\n SetStyleSheet( aAttr, pObj, bForceFillStyle, bForceNoFillStyle );\n pObj->SetMergedItemSet(aAttr);\n }\n }\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseMove-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseMove(const MouseEvent& rMEvt)\n{\n return FuConstruct::MouseMove(rMEvt);\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonUp-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseButtonUp(const MouseEvent& rMEvt)\n{\n sal_Bool bReturn(sal_False);\n\n if(pView->IsCreateObj() && rMEvt.IsLeft())\n {\n SdrObject* pObj = pView->GetCreateObj();\n if( pObj && pView->EndCreateObj( SDRCREATE_FORCEEND ) )\n {\n bReturn = sal_True;\n }\n }\n bReturn = FuConstruct::MouseButtonUp (rMEvt) || bReturn;\n\n if (!bPermanent)\n pViewShell->GetViewFrame()->GetDispatcher()->Execute(SID_OBJECT_SELECT, SFX_CALLMODE_ASYNCHRON);\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* Tastaturereignisse bearbeiten\n|*\n|* Wird ein KeyEvent bearbeitet, so ist der Return-Wert TRUE, andernfalls\n|* FALSE.\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::KeyInput(const KeyEvent& rKEvt)\n{\n BOOL bReturn = FuConstruct::KeyInput(rKEvt);\n return(bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Function aktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstructCustomShape::Activate()\n{\n pView->SetCurrentObj( OBJ_CUSTOMSHAPE );\n FuConstruct::Activate();\n}\n\n\/*************************************************************************\n|*\n|* Attribute fuer das zu erzeugende Objekt setzen\n|*\n\\************************************************************************\/\n\nvoid FuConstructCustomShape::SetAttributes( SdrObject* pObj )\n{\n sal_Bool bAttributesAppliedFromGallery = sal_False;\n\n if ( GalleryExplorer::GetSdrObjCount( GALLERY_THEME_POWERPOINT ) )\n {\n std::vector< rtl::OUString > aObjList;\n if ( GalleryExplorer::FillObjListTitle( GALLERY_THEME_POWERPOINT, aObjList ) )\n {\n sal_uInt16 i;\n for ( i = 0; i < aObjList.size(); i++ )\n {\n if ( aObjList[ i ].equalsIgnoreAsciiCase( aCustomShape ) )\n {\n FmFormModel aFormModel;\n SfxItemPool& rPool = aFormModel.GetItemPool();\n rPool.FreezeIdRanges();\n if ( GalleryExplorer::GetSdrObj( GALLERY_THEME_POWERPOINT, i, &aFormModel ) )\n {\n const SdrObject* pSourceObj = aFormModel.GetPage( 0 )->GetObj( 0 );\n if( pSourceObj )\n {\n const SfxItemSet& rSource = pSourceObj->GetMergedItemSet();\n SfxItemSet aDest( pObj->GetModel()->GetItemPool(), \/\/ ranges from SdrAttrObj\n SDRATTR_START, SDRATTR_SHADOW_LAST,\n SDRATTR_MISC_FIRST, SDRATTR_MISC_LAST,\n SDRATTR_TEXTDIRECTION, SDRATTR_TEXTDIRECTION,\n \/\/ Graphic Attributes\n SDRATTR_GRAF_FIRST, SDRATTR_GRAF_LAST,\n \/\/ 3d Properties\n SDRATTR_3D_FIRST, SDRATTR_3D_LAST,\n \/\/ CustomShape properties\n SDRATTR_CUSTOMSHAPE_FIRST, SDRATTR_CUSTOMSHAPE_LAST,\n \/\/ range from SdrTextObj\n EE_ITEMS_START, EE_ITEMS_END,\n \/\/ end\n 0, 0);\n aDest.Set( rSource );\n pObj->SetMergedItemSet( aDest );\n sal_Int32 nAngle = pSourceObj->GetRotateAngle();\n if ( nAngle )\n {\n double a = nAngle * F_PI18000;\n pObj->NbcRotate( pObj->GetSnapRect().Center(), nAngle, sin( a ), cos( a ) );\n }\n bAttributesAppliedFromGallery = sal_True;\n\n\n\/*\n com::sun::star::uno::Any aAny;\n if ( ((SdrCustomShapeGeometryItem&)pObj->GetMergedItem( SDRATTR_CUSTOMSHAPE_GEOMETRY )).QueryValue( aAny ) )\n {\n aGeometryItem.PutValue( aAny );\n pObj->SetMergedItem( aGeometryItem );\n bAttributesAppliedFromGallery = sal_True;\n }\n*\/\n }\n }\n break;\n }\n }\n }\n }\n if ( !bAttributesAppliedFromGallery )\n {\n pObj->SetMergedItem( SvxAdjustItem( SVX_ADJUST_CENTER ) );\n pObj->SetMergedItem( SdrTextVertAdjustItem( SDRTEXTVERTADJUST_CENTER ) );\n pObj->SetMergedItem( SdrTextHorzAdjustItem( SDRTEXTHORZADJUST_BLOCK ) );\n pObj->SetMergedItem( SdrTextAutoGrowHeightItem( sal_False ) );\n ((SdrObjCustomShape*)pObj)->MergeDefaultAttributes( &aCustomShape );\n }\n}\n\n\/\/ #97016#\nSdrObject* FuConstructCustomShape::CreateDefaultObject(const sal_uInt16 nID, const Rectangle& rRectangle)\n{\n SdrObject* pObj = SdrObjFactory::MakeNewObject(\n pView->GetCurrentObjInventor(), pView->GetCurrentObjIdentifier(),\n 0L, pDoc);\n\n if( pObj )\n {\n Rectangle aRect( rRectangle );\n if ( doConstructOrthogonal() )\n ImpForceQuadratic( aRect );\n pObj->SetLogicRect( aRect );\n SetAttributes( pObj );\n SfxItemSet aAttr(pDoc->GetPool());\n SetStyleSheet(aAttr, pObj);\n pObj->SetMergedItemSet(aAttr);\n }\n return pObj;\n}\n\n\/\/ #i33136#\nbool FuConstructCustomShape::doConstructOrthogonal() const\n{\n return SdrObjCustomShape::doConstructOrthogonal(aCustomShape);\n}\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS sj21 (1.7.92); FILE MERGED 2005\/06\/24 14:47:54 sj 1.7.92.1: #i50423# fixed crash if inserting customshapes (ReadOnly of the gallery theme may not been set though the file can't be written (because of security reasons))<commit_after>\/*************************************************************************\n *\n * $RCSfile: fuconcs.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: kz $ $Date: 2005-07-12 13:28:41 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"fuconcs.hxx\"\n\n#ifndef _SVDPAGV_HXX \/\/autogen\n#include <svx\/svdpagv.hxx>\n#endif\n\n#pragma hdrstop\n\n#include <svx\/svxids.hrc>\n#include <svx\/dialogs.hrc>\n#include <svx\/dialmgr.hxx>\n\n#include \"app.hrc\"\n#ifndef _AEITEM_HXX \/\/autogen\n#include <svtools\/aeitem.hxx>\n#endif\n\n#ifndef _SVX_XLNSTWIT_HXX \/\/autogen\n#include <svx\/xlnstwit.hxx>\n#endif\n#ifndef _SVX_XLNEDWIT_HXX \/\/autogen\n#include <svx\/xlnedwit.hxx>\n#endif\n#ifndef _SVX_XLNEDIT_HXX \/\/autogen\n#include <svx\/xlnedit.hxx>\n#endif\n#ifndef _SVX_XLNSTIT_HXX \/\/autogen\n#include <svx\/xlnstit.hxx>\n#endif\n#ifndef _SVX_XLNWTIT_HXX \/\/autogen\n#include <svx\/xlnwtit.hxx>\n#endif\n#ifndef _SFXVIEWFRM_HXX \/\/autogen\n#include <sfx2\/viewfrm.hxx>\n#endif\n#ifndef _SDTMFITM_HXX \/\/autogen\n#include <svx\/sdtmfitm.hxx>\n#endif\n#ifndef _SXEKITM_HXX \/\/autogen\n#include <svx\/sxekitm.hxx>\n#endif\n#ifndef _SDERITM_HXX \/\/autogen\n#include <svx\/sderitm.hxx>\n#endif\n#ifndef _SFXDISPATCH_HXX \/\/autogen\n#include <sfx2\/dispatch.hxx>\n#endif\n#ifndef _SVDOPATH_HXX \/\/autogen\n#include <svx\/svdopath.hxx>\n#endif\n#ifndef _SVDOCIRC_HXX \/\/autogen\n#include <svx\/svdocirc.hxx>\n#endif\n#ifndef _SFXINTITEM_HXX \/\/autogen\n#include <svtools\/intitem.hxx>\n#endif\n#ifndef _SFXREQUEST_HXX \/\/autogen\n#include <sfx2\/request.hxx>\n#endif\n#ifndef _EEITEMID_HXX\n#include <svx\/eeitemid.hxx>\n#endif\n#ifndef _SVX_ADJITEM_HXX\n#include <svx\/adjitem.hxx>\n#endif\n#ifndef _XTABLE_HXX\n#include <svx\/xtable.hxx>\n#endif\n#ifndef _SDASITM_HXX\n#include <svx\/sdasitm.hxx>\n#endif\n#ifndef _SVX_TBXCUSTOMSHAPES_HXX\n#include <svx\/tbxcustomshapes.hxx>\n#endif\n#ifndef _SVDOASHP_HXX\n#include <svx\/svdoashp.hxx>\n#endif\n#ifndef _SDTAGITM_HXX\n#include <svx\/sdtagitm.hxx>\n#endif\n\n\/\/ #88751#\n#ifndef _SVDCAPT_HXX\n#include <svx\/svdocapt.hxx>\n#endif\n\n\/\/ #97016#\n#ifndef _SVDOMEAS_HXX\n#include <svx\/svdomeas.hxx>\n#endif\n\n#ifndef SD_VIEW_SHELL_HXX\n#include \"ViewShell.hxx\"\n#endif\n#ifndef SD_OBJECT_BAR_MANAGER_HXX\n#include \"ObjectBarManager.hxx\"\n#endif\n\/\/ #109583#\n#ifndef _SVX_WRITINGMODEITEM_HXX\n#include <svx\/writingmodeitem.hxx>\n#endif\n#ifndef _GALLERY_HXX_\n#include <svx\/gallery.hxx>\n#endif\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _COM_SUN_STAR_UNO_ANY_HXX_\n#include <com\/sun\/star\/uno\/Any.hxx>\n#endif\n\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#include \"sdpage.hxx\"\n#ifndef SD_WINDOW_HXX\n#include \"Window.hxx\"\n#endif\n#include \"stlpool.hxx\"\n#include \"drawdoc.hxx\"\n#include \"res_bmp.hrc\"\n#include \"glob.hrc\"\n\nnamespace sd {\n\nTYPEINIT1( FuConstructCustomShape, FuConstruct );\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConstructCustomShape::FuConstructCustomShape (\n ViewShell* pViewSh,\n ::sd::Window* pWin,\n ::sd::View* pView,\n SdDrawDocument* pDoc,\n SfxRequest& rReq ) :\n FuConstruct(pViewSh, pWin, pView, pDoc, rReq)\n{\n const SfxItemSet* pArgs = rReq.GetArgs();\n if ( pArgs )\n {\n const SfxStringItem& rItm = (const SfxStringItem&)pArgs->Get( rReq.GetSlot() );\n aCustomShape = rItm.GetValue();\n }\n pViewShell->GetObjectBarManager().SwitchObjectBar( RID_DRAW_OBJ_TOOLBOX );\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nFuConstructCustomShape::~FuConstructCustomShape()\n{\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonDown-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseButtonDown(const MouseEvent& rMEvt)\n{\n BOOL bReturn = FuConstruct::MouseButtonDown(rMEvt);\n\n if ( rMEvt.IsLeft() && !pView->IsAction() )\n {\n Point aPnt( pWindow->PixelToLogic( rMEvt.GetPosPixel() ) );\n\n pWindow->CaptureMouse();\n USHORT nDrgLog = USHORT ( pWindow->PixelToLogic(Size(DRGPIX,0)).Width() );\n\n pView->BegCreateObj(aPnt, (OutputDevice*) NULL, nDrgLog);\n\n SdrObject* pObj = pView->GetCreateObj();\n if ( pObj )\n {\n SetAttributes( pObj );\n sal_Bool bForceFillStyle = sal_True;\n sal_Bool bForceNoFillStyle = sal_False;\n if ( ((SdrObjCustomShape*)pObj)->UseNoFillStyle() )\n {\n bForceFillStyle = sal_False;\n bForceNoFillStyle = sal_True;\n }\n SfxItemSet aAttr(pDoc->GetPool());\n SetStyleSheet( aAttr, pObj, bForceFillStyle, bForceNoFillStyle );\n pObj->SetMergedItemSet(aAttr);\n }\n }\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseMove-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseMove(const MouseEvent& rMEvt)\n{\n return FuConstruct::MouseMove(rMEvt);\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonUp-event\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::MouseButtonUp(const MouseEvent& rMEvt)\n{\n sal_Bool bReturn(sal_False);\n\n if(pView->IsCreateObj() && rMEvt.IsLeft())\n {\n SdrObject* pObj = pView->GetCreateObj();\n if( pObj && pView->EndCreateObj( SDRCREATE_FORCEEND ) )\n {\n bReturn = sal_True;\n }\n }\n bReturn = FuConstruct::MouseButtonUp (rMEvt) || bReturn;\n\n if (!bPermanent)\n pViewShell->GetViewFrame()->GetDispatcher()->Execute(SID_OBJECT_SELECT, SFX_CALLMODE_ASYNCHRON);\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* Tastaturereignisse bearbeiten\n|*\n|* Wird ein KeyEvent bearbeitet, so ist der Return-Wert TRUE, andernfalls\n|* FALSE.\n|*\n\\************************************************************************\/\n\nBOOL FuConstructCustomShape::KeyInput(const KeyEvent& rKEvt)\n{\n BOOL bReturn = FuConstruct::KeyInput(rKEvt);\n return(bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Function aktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstructCustomShape::Activate()\n{\n pView->SetCurrentObj( OBJ_CUSTOMSHAPE );\n FuConstruct::Activate();\n}\n\n\/*************************************************************************\n|*\n|* Attribute fuer das zu erzeugende Objekt setzen\n|*\n\\************************************************************************\/\n\nvoid FuConstructCustomShape::SetAttributes( SdrObject* pObj )\n{\n sal_Bool bAttributesAppliedFromGallery = sal_False;\n\n if ( GalleryExplorer::GetSdrObjCount( GALLERY_THEME_POWERPOINT ) )\n {\n std::vector< rtl::OUString > aObjList;\n if ( GalleryExplorer::FillObjListTitle( GALLERY_THEME_POWERPOINT, aObjList ) )\n {\n sal_uInt16 i;\n for ( i = 0; i < aObjList.size(); i++ )\n {\n if ( aObjList[ i ].equalsIgnoreAsciiCase( aCustomShape ) )\n {\n FmFormModel aFormModel;\n SfxItemPool& rPool = aFormModel.GetItemPool();\n rPool.FreezeIdRanges();\n if ( GalleryExplorer::GetSdrObj( GALLERY_THEME_POWERPOINT, i, &aFormModel ) )\n {\n const SdrPage* pPage = aFormModel.GetPage( 0 );\n if ( pPage )\n {\n const SdrObject* pSourceObj = pPage->GetObj( 0 );\n if( pSourceObj )\n {\n const SfxItemSet& rSource = pSourceObj->GetMergedItemSet();\n SfxItemSet aDest( pObj->GetModel()->GetItemPool(), \/\/ ranges from SdrAttrObj\n SDRATTR_START, SDRATTR_SHADOW_LAST,\n SDRATTR_MISC_FIRST, SDRATTR_MISC_LAST,\n SDRATTR_TEXTDIRECTION, SDRATTR_TEXTDIRECTION,\n \/\/ Graphic Attributes\n SDRATTR_GRAF_FIRST, SDRATTR_GRAF_LAST,\n \/\/ 3d Properties\n SDRATTR_3D_FIRST, SDRATTR_3D_LAST,\n \/\/ CustomShape properties\n SDRATTR_CUSTOMSHAPE_FIRST, SDRATTR_CUSTOMSHAPE_LAST,\n \/\/ range from SdrTextObj\n EE_ITEMS_START, EE_ITEMS_END,\n \/\/ end\n 0, 0);\n aDest.Set( rSource );\n pObj->SetMergedItemSet( aDest );\n sal_Int32 nAngle = pSourceObj->GetRotateAngle();\n if ( nAngle )\n {\n double a = nAngle * F_PI18000;\n pObj->NbcRotate( pObj->GetSnapRect().Center(), nAngle, sin( a ), cos( a ) );\n }\n bAttributesAppliedFromGallery = sal_True;\n\n\n \/*\n com::sun::star::uno::Any aAny;\n if ( ((SdrCustomShapeGeometryItem&)pObj->GetMergedItem( SDRATTR_CUSTOMSHAPE_GEOMETRY )).QueryValue( aAny ) )\n {\n aGeometryItem.PutValue( aAny );\n pObj->SetMergedItem( aGeometryItem );\n bAttributesAppliedFromGallery = sal_True;\n }\n *\/\n }\n }\n }\n break;\n }\n }\n }\n }\n if ( !bAttributesAppliedFromGallery )\n {\n pObj->SetMergedItem( SvxAdjustItem( SVX_ADJUST_CENTER ) );\n pObj->SetMergedItem( SdrTextVertAdjustItem( SDRTEXTVERTADJUST_CENTER ) );\n pObj->SetMergedItem( SdrTextHorzAdjustItem( SDRTEXTHORZADJUST_BLOCK ) );\n pObj->SetMergedItem( SdrTextAutoGrowHeightItem( sal_False ) );\n ((SdrObjCustomShape*)pObj)->MergeDefaultAttributes( &aCustomShape );\n }\n}\n\n\/\/ #97016#\nSdrObject* FuConstructCustomShape::CreateDefaultObject(const sal_uInt16 nID, const Rectangle& rRectangle)\n{\n SdrObject* pObj = SdrObjFactory::MakeNewObject(\n pView->GetCurrentObjInventor(), pView->GetCurrentObjIdentifier(),\n 0L, pDoc);\n\n if( pObj )\n {\n Rectangle aRect( rRectangle );\n if ( doConstructOrthogonal() )\n ImpForceQuadratic( aRect );\n pObj->SetLogicRect( aRect );\n SetAttributes( pObj );\n SfxItemSet aAttr(pDoc->GetPool());\n SetStyleSheet(aAttr, pObj);\n pObj->SetMergedItemSet(aAttr);\n }\n return pObj;\n}\n\n\/\/ #i33136#\nbool FuConstructCustomShape::doConstructOrthogonal() const\n{\n return SdrObjCustomShape::doConstructOrthogonal(aCustomShape);\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n =========================================================================*\/\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"otbGenericRSResampleImageFilter.h\"\n#include \"otbBCOInterpolateImageFunction.h\"\n#include \"otbSimpleRcsPanSharpeningFusionImageFilter.h\"\n#include \"itkFixedArray.h\"\n\n\/\/ Elevation handler\n#include \"otbWrapperElevationParametersHandler.h\"\n\n#include \"otbPleiadesPToXSAffineTransformCalculator.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\nclass BundleToPerfectSensor : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef BundleToPerfectSensor Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(BundleToPerfectSensor, otb::Application);\n\nprivate:\n\n void DoInit()\n {\n SetName(\"BundleToPerfectSensor\");\n SetDescription(\"Perform P+XS pansharpening\");\n\n \/\/ Documentation\n SetDocName(\"Bundle to perfect sensor\");\n SetDocLongDescription(\"This application performs P+XS pansharpening. The default mode use Pan and XS sensor models to estimate the transformation to superimpose XS over Pan before the fusion (\\\"default mode\\\"). The application provides also a PHR mode for Pleiades images which does not use sensor models as Pan and XS products are already coregistered but only estimate an affine transformation to superimpose XS over the Pan.Note that this option is automatically activated in case Pleiades images are detected as input.\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\" \");\n\n AddDocTag(Tags::Geometry);\n AddDocTag(Tags::Pansharpening);\n\n AddParameter(ParameterType_InputImage, \"inp\", \"Input PAN Image\");\n SetParameterDescription(\"inp\",\" Input panchromatic image.\");\n AddParameter(ParameterType_InputImage, \"inxs\", \"Input XS Image\");\n SetParameterDescription(\"inxs\",\" Input XS image.\");\n\n \/\/ Elevation\n ElevationParametersHandler::AddElevationParameters(this, \"elev\");\n\n \/\/ Superposition mode\n AddParameter(ParameterType_Choice,\"mode\", \"Mode\");\n SetParameterDescription(\"mode\", \"Superimposition mode\");\n \n AddChoice(\"mode.default\", \"Default mode\");\n SetParameterDescription(\"mode.default\", \"Default superimposition mode : \"\n \"uses any projection reference or sensor model found in the images\");\n \n AddChoice(\"mode.phr\", \"Pleiades mode\");\n SetParameterDescription(\"mode.phr\", \"Pleiades superimposition mode, \"\n \"designed for the case of a P+XS bundle in SENSOR geometry. It uses\"\n \" a simple transform on the XS image : a scaling and a residual \"\n \"translation.\");\n \n AddParameter(ParameterType_Float, \"lms\", \"Spacing of the deformation field\");\n SetParameterDescription(\"lms\",\" Spacing of the deformation field. Default is 10 times the PAN image spacing.\");\n AddParameter(ParameterType_OutputImage, \"out\", \"Output image\");\n SetParameterDescription(\"out\",\" Output image.\");\n AddRAMParameter();\n\n MandatoryOff(\"lms\");\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"inp\", \"QB_Toulouse_Ortho_PAN.tif\");\n SetDocExampleParameterValue(\"inxs\", \"QB_Toulouse_Ortho_XS.tif\");\n SetDocExampleParameterValue(\"out\", \"BundleToPerfectSensor.png uchar\");\n\n }\n\n void DoUpdateParameters()\n {\n if(!HasUserValue(\"mode\") && HasValue(\"inp\") && HasValue(\"inxs\") && otb::PleiadesPToXSAffineTransformCalculator::CanCompute(GetParameterImage(\"inp\"),GetParameterImage(\"inxs\")))\n {\n otbAppLogWARNING(\"Forcing PHR mode with PHR data. You need to add \\\"-mode default\\\" to force the default mode with PHR images.\");\n SetParameterString(\"mode\",\"phr\");\n }\n }\n\n void DoExecute()\n {\n FloatVectorImageType* panchroV = GetParameterImage(\"inp\");\n FloatVectorImageType* xs = GetParameterImage(\"inxs\");\n\n if ( panchroV->GetNumberOfComponentsPerPixel() != 1 )\n {\n itkExceptionMacro(<< \"The panchromatic image must be a single channel image\")\n }\n\n \/\/ Transform the PAN image to otb::Image\n typedef otb::Image<FloatVectorImageType::InternalPixelType> FloatImageType;\n typedef otb::MultiToMonoChannelExtractROI<float,float> ExtractFilterType;\n\n ExtractFilterType::Pointer channelSelect = ExtractFilterType::New();\n m_Ref.push_back(channelSelect.GetPointer());\n channelSelect->SetChannel(1);\n channelSelect->SetInput(panchroV);\n channelSelect->UpdateOutputInformation();\n FloatImageType::Pointer panchro = channelSelect->GetOutput();\n\n typedef otb::BCOInterpolateImageFunction<FloatVectorImageType> InterpolatorType;\n typedef otb::GenericRSResampleImageFilter<FloatVectorImageType, FloatVectorImageType> ResamplerType;\n typedef otb::StreamingResampleImageFilter<FloatVectorImageType, FloatVectorImageType> BasicResamplerType;\n typedef otb::SimpleRcsPanSharpeningFusionImageFilter<FloatImageType, FloatVectorImageType, FloatVectorImageType> FusionFilterType;\n\n \/\/ Resample filter\n ResamplerType::Pointer resampler = ResamplerType::New();\n m_Ref.push_back(resampler.GetPointer());\n \n BasicResamplerType::Pointer basicResampler = BasicResamplerType::New();\n m_Ref.push_back(basicResampler.GetPointer());\n\n InterpolatorType::Pointer interpolator = InterpolatorType::New();\n resampler->SetInterpolator(interpolator);\n basicResampler->SetInterpolator(interpolator);\n\n \/\/ Fusion filter\n FusionFilterType::Pointer fusionFilter = FusionFilterType::New();\n m_Ref.push_back(fusionFilter.GetPointer());\n fusionFilter->SetPanInput(panchro);\n \n \/\/ Setup the DEM Handler\n otb::Wrapper::ElevationParametersHandler::SetupDEMHandlerFromElevationParameters(this,\"elev\");\n\n \/\/ Set up output image informations\n FloatVectorImageType::SpacingType spacing = panchro->GetSpacing();\n FloatVectorImageType::IndexType start = panchro->GetLargestPossibleRegion().GetIndex();\n FloatVectorImageType::SizeType size = panchro->GetLargestPossibleRegion().GetSize();\n FloatVectorImageType::PointType origin = panchro->GetOrigin();\n\n FloatVectorImageType::PixelType defaultValue;\n itk::NumericTraits<FloatVectorImageType::PixelType>::SetLength(defaultValue, xs->GetNumberOfComponentsPerPixel());\n\n if(GetParameterString(\"mode\") == \"default\")\n {\n otbAppLogINFO(\"Using the default mode\");\n if(IsParameterEnabled(\"lms\") && HasValue(\"lms\"))\n {\n double defScalarSpacing = GetParameterFloat(\"lms\");\n otbAppLogINFO(<< \"Generating coarse deformation field (spacing=\"<<defScalarSpacing<<\")\" << std::endl);\n FloatVectorImageType::SpacingType defSpacing;\n \n defSpacing[0] = defScalarSpacing;\n defSpacing[1] = defScalarSpacing;\n \n resampler->SetDisplacementFieldSpacing(defSpacing);\n }\n else\n {\n FloatVectorImageType::SpacingType defSpacing;\n defSpacing[0]=10*spacing[0];\n defSpacing[1]=10*spacing[1];\n resampler->SetDisplacementFieldSpacing(defSpacing);\n }\n \n resampler->SetInput(xs);\n resampler->SetOutputOrigin(origin);\n resampler->SetOutputSpacing(spacing);\n resampler->SetOutputSize(size);\n resampler->SetOutputStartIndex(start);\n resampler->SetOutputKeywordList(panchro->GetImageKeywordlist());\n resampler->SetOutputProjectionRef(panchro->GetProjectionRef());\n resampler->SetEdgePaddingValue(defaultValue);\n fusionFilter->SetXsInput(resampler->GetOutput());\n }\n else if(GetParameterString(\"mode\")==\"phr\")\n {\n otbAppLogINFO(\"Using the PHR mode\");\n \n otb::PleiadesPToXSAffineTransformCalculator::TransformType::Pointer transform\n = otb::PleiadesPToXSAffineTransformCalculator::Compute(panchro, xs);\n\n basicResampler->SetInput(xs);\n basicResampler->SetTransform(transform);\n basicResampler->SetOutputOrigin(origin);\n basicResampler->SetOutputSpacing(spacing);\n basicResampler->SetOutputSize(size);\n basicResampler->SetOutputStartIndex(start);\n basicResampler->SetEdgePaddingValue(defaultValue);\n \n fusionFilter->SetXsInput(basicResampler->GetOutput());\n\n \/\/ Set the profRef & Keywordlist from Pan into the resampled XS image\n basicResampler->UpdateOutputInformation();\n itk::MetaDataDictionary& dict = basicResampler->GetOutput()->GetMetaDataDictionary();\n itk::EncapsulateMetaData<std::string>(dict, MetaDataKey::ProjectionRefKey,\n panchro->GetProjectionRef());\n itk::EncapsulateMetaData<ImageKeywordlist>(dict, MetaDataKey::OSSIMKeywordlistKey,\n panchro->GetImageKeywordlist());\n }\n else\n {\n otbAppLogWARNING(\"Unknown mode\");\n }\n \n SetParameterOutputImage(\"out\", fusionFilter->GetOutput());\n }\n\n std::vector<itk::ProcessObject::Pointer> m_Ref;\n\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::BundleToPerfectSensor)\n<commit_msg>WRG: Fixing shadowed typedef declaration warning<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n =========================================================================*\/\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"otbGenericRSResampleImageFilter.h\"\n#include \"otbBCOInterpolateImageFunction.h\"\n#include \"otbSimpleRcsPanSharpeningFusionImageFilter.h\"\n#include \"itkFixedArray.h\"\n\n\/\/ Elevation handler\n#include \"otbWrapperElevationParametersHandler.h\"\n\n#include \"otbPleiadesPToXSAffineTransformCalculator.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\nclass BundleToPerfectSensor : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef BundleToPerfectSensor Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(BundleToPerfectSensor, otb::Application);\n\nprivate:\n\n void DoInit()\n {\n SetName(\"BundleToPerfectSensor\");\n SetDescription(\"Perform P+XS pansharpening\");\n\n \/\/ Documentation\n SetDocName(\"Bundle to perfect sensor\");\n SetDocLongDescription(\"This application performs P+XS pansharpening. The default mode use Pan and XS sensor models to estimate the transformation to superimpose XS over Pan before the fusion (\\\"default mode\\\"). The application provides also a PHR mode for Pleiades images which does not use sensor models as Pan and XS products are already coregistered but only estimate an affine transformation to superimpose XS over the Pan.Note that this option is automatically activated in case Pleiades images are detected as input.\");\n SetDocLimitations(\"None\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\" \");\n\n AddDocTag(Tags::Geometry);\n AddDocTag(Tags::Pansharpening);\n\n AddParameter(ParameterType_InputImage, \"inp\", \"Input PAN Image\");\n SetParameterDescription(\"inp\",\" Input panchromatic image.\");\n AddParameter(ParameterType_InputImage, \"inxs\", \"Input XS Image\");\n SetParameterDescription(\"inxs\",\" Input XS image.\");\n\n \/\/ Elevation\n ElevationParametersHandler::AddElevationParameters(this, \"elev\");\n\n \/\/ Superposition mode\n AddParameter(ParameterType_Choice,\"mode\", \"Mode\");\n SetParameterDescription(\"mode\", \"Superimposition mode\");\n \n AddChoice(\"mode.default\", \"Default mode\");\n SetParameterDescription(\"mode.default\", \"Default superimposition mode : \"\n \"uses any projection reference or sensor model found in the images\");\n \n AddChoice(\"mode.phr\", \"Pleiades mode\");\n SetParameterDescription(\"mode.phr\", \"Pleiades superimposition mode, \"\n \"designed for the case of a P+XS bundle in SENSOR geometry. It uses\"\n \" a simple transform on the XS image : a scaling and a residual \"\n \"translation.\");\n \n AddParameter(ParameterType_Float, \"lms\", \"Spacing of the deformation field\");\n SetParameterDescription(\"lms\",\" Spacing of the deformation field. Default is 10 times the PAN image spacing.\");\n AddParameter(ParameterType_OutputImage, \"out\", \"Output image\");\n SetParameterDescription(\"out\",\" Output image.\");\n AddRAMParameter();\n\n MandatoryOff(\"lms\");\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"inp\", \"QB_Toulouse_Ortho_PAN.tif\");\n SetDocExampleParameterValue(\"inxs\", \"QB_Toulouse_Ortho_XS.tif\");\n SetDocExampleParameterValue(\"out\", \"BundleToPerfectSensor.png uchar\");\n\n }\n\n void DoUpdateParameters()\n {\n if(!HasUserValue(\"mode\") && HasValue(\"inp\") && HasValue(\"inxs\") && otb::PleiadesPToXSAffineTransformCalculator::CanCompute(GetParameterImage(\"inp\"),GetParameterImage(\"inxs\")))\n {\n otbAppLogWARNING(\"Forcing PHR mode with PHR data. You need to add \\\"-mode default\\\" to force the default mode with PHR images.\");\n SetParameterString(\"mode\",\"phr\");\n }\n }\n\n void DoExecute()\n {\n FloatVectorImageType* panchroV = GetParameterImage(\"inp\");\n FloatVectorImageType* xs = GetParameterImage(\"inxs\");\n\n if ( panchroV->GetNumberOfComponentsPerPixel() != 1 )\n {\n itkExceptionMacro(<< \"The panchromatic image must be a single channel image\")\n }\n\n \/\/ Transform the PAN image to otb::Image\n typedef otb::Image<FloatVectorImageType::InternalPixelType> InternalImageType;\n typedef otb::MultiToMonoChannelExtractROI<float,float> ExtractFilterType;\n\n ExtractFilterType::Pointer channelSelect = ExtractFilterType::New();\n m_Ref.push_back(channelSelect.GetPointer());\n channelSelect->SetChannel(1);\n channelSelect->SetInput(panchroV);\n channelSelect->UpdateOutputInformation();\n InternalImageType::Pointer panchro = channelSelect->GetOutput();\n\n typedef otb::BCOInterpolateImageFunction<FloatVectorImageType> InterpolatorType;\n typedef otb::GenericRSResampleImageFilter<FloatVectorImageType, FloatVectorImageType> ResamplerType;\n typedef otb::StreamingResampleImageFilter<FloatVectorImageType, FloatVectorImageType> BasicResamplerType;\n typedef otb::SimpleRcsPanSharpeningFusionImageFilter<InternalImageType, FloatVectorImageType, FloatVectorImageType> FusionFilterType;\n\n \/\/ Resample filter\n ResamplerType::Pointer resampler = ResamplerType::New();\n m_Ref.push_back(resampler.GetPointer());\n \n BasicResamplerType::Pointer basicResampler = BasicResamplerType::New();\n m_Ref.push_back(basicResampler.GetPointer());\n\n InterpolatorType::Pointer interpolator = InterpolatorType::New();\n resampler->SetInterpolator(interpolator);\n basicResampler->SetInterpolator(interpolator);\n\n \/\/ Fusion filter\n FusionFilterType::Pointer fusionFilter = FusionFilterType::New();\n m_Ref.push_back(fusionFilter.GetPointer());\n fusionFilter->SetPanInput(panchro);\n \n \/\/ Setup the DEM Handler\n otb::Wrapper::ElevationParametersHandler::SetupDEMHandlerFromElevationParameters(this,\"elev\");\n\n \/\/ Set up output image informations\n FloatVectorImageType::SpacingType spacing = panchro->GetSpacing();\n FloatVectorImageType::IndexType start = panchro->GetLargestPossibleRegion().GetIndex();\n FloatVectorImageType::SizeType size = panchro->GetLargestPossibleRegion().GetSize();\n FloatVectorImageType::PointType origin = panchro->GetOrigin();\n\n FloatVectorImageType::PixelType defaultValue;\n itk::NumericTraits<FloatVectorImageType::PixelType>::SetLength(defaultValue, xs->GetNumberOfComponentsPerPixel());\n\n if(GetParameterString(\"mode\") == \"default\")\n {\n otbAppLogINFO(\"Using the default mode\");\n if(IsParameterEnabled(\"lms\") && HasValue(\"lms\"))\n {\n double defScalarSpacing = GetParameterFloat(\"lms\");\n otbAppLogINFO(<< \"Generating coarse deformation field (spacing=\"<<defScalarSpacing<<\")\" << std::endl);\n FloatVectorImageType::SpacingType defSpacing;\n \n defSpacing[0] = defScalarSpacing;\n defSpacing[1] = defScalarSpacing;\n \n resampler->SetDisplacementFieldSpacing(defSpacing);\n }\n else\n {\n FloatVectorImageType::SpacingType defSpacing;\n defSpacing[0]=10*spacing[0];\n defSpacing[1]=10*spacing[1];\n resampler->SetDisplacementFieldSpacing(defSpacing);\n }\n \n resampler->SetInput(xs);\n resampler->SetOutputOrigin(origin);\n resampler->SetOutputSpacing(spacing);\n resampler->SetOutputSize(size);\n resampler->SetOutputStartIndex(start);\n resampler->SetOutputKeywordList(panchro->GetImageKeywordlist());\n resampler->SetOutputProjectionRef(panchro->GetProjectionRef());\n resampler->SetEdgePaddingValue(defaultValue);\n fusionFilter->SetXsInput(resampler->GetOutput());\n }\n else if(GetParameterString(\"mode\")==\"phr\")\n {\n otbAppLogINFO(\"Using the PHR mode\");\n \n otb::PleiadesPToXSAffineTransformCalculator::TransformType::Pointer transform\n = otb::PleiadesPToXSAffineTransformCalculator::Compute(panchro, xs);\n\n basicResampler->SetInput(xs);\n basicResampler->SetTransform(transform);\n basicResampler->SetOutputOrigin(origin);\n basicResampler->SetOutputSpacing(spacing);\n basicResampler->SetOutputSize(size);\n basicResampler->SetOutputStartIndex(start);\n basicResampler->SetEdgePaddingValue(defaultValue);\n \n fusionFilter->SetXsInput(basicResampler->GetOutput());\n\n \/\/ Set the profRef & Keywordlist from Pan into the resampled XS image\n basicResampler->UpdateOutputInformation();\n itk::MetaDataDictionary& dict = basicResampler->GetOutput()->GetMetaDataDictionary();\n itk::EncapsulateMetaData<std::string>(dict, MetaDataKey::ProjectionRefKey,\n panchro->GetProjectionRef());\n itk::EncapsulateMetaData<ImageKeywordlist>(dict, MetaDataKey::OSSIMKeywordlistKey,\n panchro->GetImageKeywordlist());\n }\n else\n {\n otbAppLogWARNING(\"Unknown mode\");\n }\n \n SetParameterOutputImage(\"out\", fusionFilter->GetOutput());\n }\n\n std::vector<itk::ProcessObject::Pointer> m_Ref;\n\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::BundleToPerfectSensor)\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2011, British Broadcasting Corporation\n * All Rights Reserved.\n *\n * Author: Philip de Nier\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the British Broadcasting Corporation nor the names\n * of its contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <cstring>\n\n#include <bmx\/writer_helper\/AVCIWriterHelper.h>\n#include <bmx\/BMXException.h>\n#include <bmx\/Logging.h>\n\nusing namespace std;\nusing namespace bmx;\n\n\n\nAVCIWriterHelper::AVCIWriterHelper()\n{\n mMode = AVCI_PASS_MODE;\n mHeader = 0;\n mSampleCount = 0;\n mFirstFrameHeader = false;\n mSecondFrameHeader = false;\n\n BMX_ASSERT(sizeof(AVCI_FILLER) == sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n}\n\nAVCIWriterHelper::~AVCIWriterHelper()\n{\n delete [] mHeader;\n}\n\nvoid AVCIWriterHelper::SetMode(AVCIMode mode)\n{\n mMode = mode;\n}\n\nvoid AVCIWriterHelper::SetHeader(const unsigned char *data, uint32_t size)\n{\n BMX_CHECK(size == AVCI_HEADER_SIZE);\n\n if (!mHeader)\n mHeader = new unsigned char[AVCI_HEADER_SIZE];\n\n memcpy(mHeader, data, AVCI_HEADER_SIZE);\n}\n\nuint32_t AVCIWriterHelper::ProcessFrame(const unsigned char *data, uint32_t size,\n const CDataBuffer **data_array, uint32_t *array_size)\n{\n mEssenceParser.ParseFrameInfo(data, size);\n bool have_header = mEssenceParser.HaveSequenceParameterSet();\n\n uint32_t output_frame_size = 0;\n switch (mMode)\n {\n case AVCI_PASS_MODE:\n output_frame_size = PassFrame(data, size, array_size);\n break;\n case AVCI_NO_FRAME_HEADER_MODE:\n if (have_header)\n output_frame_size = StripFrameHeader(data, size, array_size);\n else\n output_frame_size = PassFrame(data, size, array_size);\n break;\n case AVCI_NO_OR_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (mSampleCount == 0) {\n mFirstFrameHeader = true;\n SetHeader(data, AVCI_HEADER_SIZE);\n }\n\n if (mFirstFrameHeader)\n output_frame_size = PassFrame(data, size, array_size);\n else\n output_frame_size = StripFrameHeader(data, size, array_size);\n } else {\n if (mFirstFrameHeader)\n output_frame_size = PrependFrameHeader(data, size, array_size);\n else\n output_frame_size = PassFrame(data, size, array_size);\n }\n break;\n case AVCI_FIRST_FRAME_HEADER_MODE:\n if (have_header) {\n if (mSampleCount == 0) {\n output_frame_size = PassFrame(data, size, array_size);\n SetHeader(data, AVCI_HEADER_SIZE);\n } else {\n output_frame_size = StripFrameHeader(data, size, array_size);\n }\n } else {\n if (mSampleCount == 0) {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else {\n output_frame_size = PassFrame(data, size, array_size);\n }\n }\n break;\n case AVCI_FIRST_OR_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (mSampleCount == 0) {\n output_frame_size = PassFrame(data, size, array_size);\n SetHeader(data, AVCI_HEADER_SIZE);\n } else if (mSampleCount == 1) {\n mSecondFrameHeader = true;\n output_frame_size = PassFrame(data, size, array_size);\n } else {\n if (mSecondFrameHeader)\n output_frame_size = PassFrame(data, size, array_size);\n else\n output_frame_size = StripFrameHeader(data, size, array_size);\n }\n } else {\n if (mSampleCount == 0) {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else if (mSampleCount == 1) {\n mSecondFrameHeader = false;\n output_frame_size = PassFrame(data, size, array_size);\n } else if (mSecondFrameHeader) {\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else {\n output_frame_size = PassFrame(data, size, array_size);\n }\n }\n break;\n case AVCI_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (mSampleCount == 0)\n SetHeader(data, AVCI_HEADER_SIZE);\n output_frame_size = PassFrame(data, size, array_size);\n } else {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n }\n break;\n }\n\n mSampleCount++;\n\n *data_array = mDataArray;\n return output_frame_size;\n}\n\nuint32_t AVCIWriterHelper::PassFrame(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ ensure frame starts with access unit delimiter\n if (memcmp(data, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = (unsigned char*)data;\n mDataArray[0].size = size;\n *array_size = 1;\n } else if (memcmp(data, AVCI_FILLER, sizeof(AVCI_FILLER)) == 0) {\n mDataArray[0].data = (unsigned char*)AVCI_ACCESS_UNIT_DELIMITER;\n mDataArray[0].size = sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n mDataArray[1].data = (unsigned char*)(data + sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n mDataArray[1].size = size - sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n *array_size = 2;\n } else {\n BMX_EXCEPTION((\"AVCI frame does not start with access unit delimiter or filler\"));\n }\n\n return size;\n}\n\nuint32_t AVCIWriterHelper::StripFrameHeader(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ strip header and ensure frame starts with access unit delimiter\n if (memcmp(data + AVCI_HEADER_SIZE, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = (unsigned char*)(data + AVCI_HEADER_SIZE);\n mDataArray[0].size = size - AVCI_HEADER_SIZE;\n *array_size = 1;\n } else if (memcmp(data + AVCI_HEADER_SIZE, AVCI_FILLER, sizeof(AVCI_FILLER)) == 0) {\n mDataArray[0].data = (unsigned char*)AVCI_ACCESS_UNIT_DELIMITER;\n mDataArray[0].size = sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n mDataArray[1].data = (unsigned char*)(data + AVCI_HEADER_SIZE + sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n mDataArray[1].size = size - AVCI_HEADER_SIZE - sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n *array_size = 2;\n } else {\n BMX_EXCEPTION((\"Failed to strip AVCI header because filler or access unit delimiter \"\n \"not found at offset %u\", AVCI_HEADER_SIZE));\n }\n\n return size - AVCI_HEADER_SIZE;\n}\n\nuint32_t AVCIWriterHelper::PrependFrameHeader(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ prepend header and replace access unit delimiter with filler\n BMX_ASSERT(mHeader);\n if (memcmp(data, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = mHeader;\n mDataArray[0].size = AVCI_HEADER_SIZE;\n mDataArray[1].data = (unsigned char*)AVCI_FILLER;\n mDataArray[1].size = sizeof(AVCI_FILLER);\n mDataArray[2].data = (unsigned char*)(data + sizeof(AVCI_FILLER));\n mDataArray[2].size = size - sizeof(AVCI_FILLER);\n *array_size = 3;\n } else {\n mDataArray[0].data = mHeader;\n mDataArray[0].size = AVCI_HEADER_SIZE;\n mDataArray[1].data = (unsigned char*)data;\n mDataArray[1].size = size;\n *array_size = 2;\n }\n\n return size + AVCI_HEADER_SIZE;\n}\n<commit_msg>avci helper: use define to ensure correct header set logic<commit_after>\/*\n * Copyright (C) 2011, British Broadcasting Corporation\n * All Rights Reserved.\n *\n * Author: Philip de Nier\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the British Broadcasting Corporation nor the names\n * of its contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#ifdef HAVE_CONFIG_H\n#include \"config.h\"\n#endif\n\n#include <cstring>\n\n#include <bmx\/writer_helper\/AVCIWriterHelper.h>\n#include <bmx\/BMXException.h>\n#include <bmx\/Logging.h>\n\nusing namespace std;\nusing namespace bmx;\n\n\n\/\/ Client code relies on this logic. This allows a client to set provisional header data\n\/\/ and this header data is overwritten if the first input frame contains header data\n#define SET_HEADER_ENABLED mSampleCount == 0\n\n\n\nAVCIWriterHelper::AVCIWriterHelper()\n{\n mMode = AVCI_PASS_MODE;\n mHeader = 0;\n mSampleCount = 0;\n mFirstFrameHeader = false;\n mSecondFrameHeader = false;\n\n BMX_ASSERT(sizeof(AVCI_FILLER) == sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n}\n\nAVCIWriterHelper::~AVCIWriterHelper()\n{\n delete [] mHeader;\n}\n\nvoid AVCIWriterHelper::SetMode(AVCIMode mode)\n{\n mMode = mode;\n}\n\nvoid AVCIWriterHelper::SetHeader(const unsigned char *data, uint32_t size)\n{\n BMX_CHECK(size == AVCI_HEADER_SIZE);\n\n if (!mHeader)\n mHeader = new unsigned char[AVCI_HEADER_SIZE];\n\n memcpy(mHeader, data, AVCI_HEADER_SIZE);\n}\n\nuint32_t AVCIWriterHelper::ProcessFrame(const unsigned char *data, uint32_t size,\n const CDataBuffer **data_array, uint32_t *array_size)\n{\n mEssenceParser.ParseFrameInfo(data, size);\n bool have_header = mEssenceParser.HaveSequenceParameterSet();\n\n uint32_t output_frame_size = 0;\n switch (mMode)\n {\n case AVCI_PASS_MODE:\n output_frame_size = PassFrame(data, size, array_size);\n break;\n case AVCI_NO_FRAME_HEADER_MODE:\n if (have_header)\n output_frame_size = StripFrameHeader(data, size, array_size);\n else\n output_frame_size = PassFrame(data, size, array_size);\n break;\n case AVCI_NO_OR_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (SET_HEADER_ENABLED) {\n mFirstFrameHeader = true;\n SetHeader(data, AVCI_HEADER_SIZE);\n }\n\n if (mFirstFrameHeader)\n output_frame_size = PassFrame(data, size, array_size);\n else\n output_frame_size = StripFrameHeader(data, size, array_size);\n } else {\n if (mFirstFrameHeader)\n output_frame_size = PrependFrameHeader(data, size, array_size);\n else\n output_frame_size = PassFrame(data, size, array_size);\n }\n break;\n case AVCI_FIRST_FRAME_HEADER_MODE:\n if (have_header) {\n if (SET_HEADER_ENABLED) {\n output_frame_size = PassFrame(data, size, array_size);\n SetHeader(data, AVCI_HEADER_SIZE);\n } else {\n output_frame_size = StripFrameHeader(data, size, array_size);\n }\n } else {\n if (mSampleCount == 0) {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else {\n output_frame_size = PassFrame(data, size, array_size);\n }\n }\n break;\n case AVCI_FIRST_OR_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (SET_HEADER_ENABLED) {\n output_frame_size = PassFrame(data, size, array_size);\n SetHeader(data, AVCI_HEADER_SIZE);\n } else if (mSampleCount == 1) {\n mSecondFrameHeader = true;\n output_frame_size = PassFrame(data, size, array_size);\n } else {\n if (mSecondFrameHeader)\n output_frame_size = PassFrame(data, size, array_size);\n else\n output_frame_size = StripFrameHeader(data, size, array_size);\n }\n } else {\n if (mSampleCount == 0) {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else if (mSampleCount == 1) {\n mSecondFrameHeader = false;\n output_frame_size = PassFrame(data, size, array_size);\n } else if (mSecondFrameHeader) {\n output_frame_size = PrependFrameHeader(data, size, array_size);\n } else {\n output_frame_size = PassFrame(data, size, array_size);\n }\n }\n break;\n case AVCI_ALL_FRAME_HEADER_MODE:\n if (have_header) {\n if (SET_HEADER_ENABLED)\n SetHeader(data, AVCI_HEADER_SIZE);\n output_frame_size = PassFrame(data, size, array_size);\n } else {\n if (!mHeader) {\n BMX_EXCEPTION((\"Missing AVCI header sets in first frame\"));\n }\n output_frame_size = PrependFrameHeader(data, size, array_size);\n }\n break;\n }\n\n mSampleCount++;\n\n *data_array = mDataArray;\n return output_frame_size;\n}\n\nuint32_t AVCIWriterHelper::PassFrame(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ ensure frame starts with access unit delimiter\n if (memcmp(data, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = (unsigned char*)data;\n mDataArray[0].size = size;\n *array_size = 1;\n } else if (memcmp(data, AVCI_FILLER, sizeof(AVCI_FILLER)) == 0) {\n mDataArray[0].data = (unsigned char*)AVCI_ACCESS_UNIT_DELIMITER;\n mDataArray[0].size = sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n mDataArray[1].data = (unsigned char*)(data + sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n mDataArray[1].size = size - sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n *array_size = 2;\n } else {\n BMX_EXCEPTION((\"AVCI frame does not start with access unit delimiter or filler\"));\n }\n\n return size;\n}\n\nuint32_t AVCIWriterHelper::StripFrameHeader(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ strip header and ensure frame starts with access unit delimiter\n if (memcmp(data + AVCI_HEADER_SIZE, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = (unsigned char*)(data + AVCI_HEADER_SIZE);\n mDataArray[0].size = size - AVCI_HEADER_SIZE;\n *array_size = 1;\n } else if (memcmp(data + AVCI_HEADER_SIZE, AVCI_FILLER, sizeof(AVCI_FILLER)) == 0) {\n mDataArray[0].data = (unsigned char*)AVCI_ACCESS_UNIT_DELIMITER;\n mDataArray[0].size = sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n mDataArray[1].data = (unsigned char*)(data + AVCI_HEADER_SIZE + sizeof(AVCI_ACCESS_UNIT_DELIMITER));\n mDataArray[1].size = size - AVCI_HEADER_SIZE - sizeof(AVCI_ACCESS_UNIT_DELIMITER);\n *array_size = 2;\n } else {\n BMX_EXCEPTION((\"Failed to strip AVCI header because filler or access unit delimiter \"\n \"not found at offset %u\", AVCI_HEADER_SIZE));\n }\n\n return size - AVCI_HEADER_SIZE;\n}\n\nuint32_t AVCIWriterHelper::PrependFrameHeader(const unsigned char *data, uint32_t size, uint32_t *array_size)\n{\n \/\/ prepend header and replace access unit delimiter with filler\n BMX_ASSERT(mHeader);\n if (memcmp(data, AVCI_ACCESS_UNIT_DELIMITER, sizeof(AVCI_ACCESS_UNIT_DELIMITER)) == 0) {\n mDataArray[0].data = mHeader;\n mDataArray[0].size = AVCI_HEADER_SIZE;\n mDataArray[1].data = (unsigned char*)AVCI_FILLER;\n mDataArray[1].size = sizeof(AVCI_FILLER);\n mDataArray[2].data = (unsigned char*)(data + sizeof(AVCI_FILLER));\n mDataArray[2].size = size - sizeof(AVCI_FILLER);\n *array_size = 3;\n } else {\n mDataArray[0].data = mHeader;\n mDataArray[0].size = AVCI_HEADER_SIZE;\n mDataArray[1].data = (unsigned char*)data;\n mDataArray[1].size = size;\n *array_size = 2;\n }\n\n return size + AVCI_HEADER_SIZE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Namecoin RPC library.\n * Copyright (C) 2013 Daniel Kraft <d@domob.eu>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n * See the distributed file COPYING for additional permissions in addition\n * to those of the GNU Affero General Public License.\n *\/\n\n\/* Source code for NamecoinInterface.hpp. *\/\n\n#include \"NamecoinInterface.hpp\"\n\n#include <ctime>\n#include <sstream>\n\nnamespace nmcrpc\n{\n\n\/* ************************************************************************** *\/\n\/* High-level interface to Namecoin. *\/\n\nconst unsigned NamecoinInterface::UNLOCK_SECONDS = 3600;\n\n\/**\n * Run a simple test command and return whether the connection seems to\n * be up and running. It also produces a message that can be shown, which\n * either includes the running version or an error string.\n * @param msg Set this to the message string.\n * @return True iff the connection seems to be fine.\n *\/\nbool\nNamecoinInterface::testConnection (std::string& msg)\n{\n try\n {\n const JsonRpc::JsonData res = rpc.executeRpc (\"getinfo\");\n int version = res[\"version\"].asInt ();\n\n unsigned v3 = version % 100;\n version \/= 100;\n unsigned v2 = version % 100;\n version \/= 100;\n\n std::ostringstream msgOut;\n msgOut << \"Success! Namecoind version \"\n << \"0.\" << version << \".\" << v2;\n if (v3 > 0)\n msgOut << \".\" << v3;\n msgOut << \" running.\";\n msg = msgOut.str ();\n\n return true;\n }\n catch (const JsonRpc::HttpError& exc)\n {\n std::ostringstream res;\n res << \"HTTP-Error (\" << exc.getResponseCode () << \"): \"\n << exc.what ();\n msg = res.str ();\n }\n catch (const JsonRpc::Exception& exc)\n {\n msg = exc.what ();\n }\n\n return false;\n}\n\n\/**\n * Query for an address by string. This immediately checks whether the\n * address is valid and owned by the user, so that this information can be\n * encapsulated into the returned object.\n * @param addr The address to check.\n * @return The created address object.\n *\/\nNamecoinInterface::Address\nNamecoinInterface::queryAddress (const std::string& addr)\n{\n return Address (rpc, addr);\n}\n\n\/**\n * Create a new address (as per \"getnewaddress\") and return it.\n * @return Newly created address.\n *\/\nNamecoinInterface::Address\nNamecoinInterface::createAddress ()\n{\n const JsonRpc::JsonData addr = rpc.executeRpc (\"getnewaddress\");\n return Address (rpc, addr.asString ());\n}\n\n\/**\n * Query for a name by string. If the name is registered, this immediately\n * queries for the name's associated data. If the name does not yet exist,\n * this still succeeds and returns a Name object that can be used to find\n * out that fact as well as register the name.\n * @param name The name to check.\n * @return The created name object.\n *\/\nNamecoinInterface::Name\nNamecoinInterface::queryName (const std::string& name)\n{\n return Name (name, *this, rpc);\n}\n\n\/**\n * Query for a name by namespace and name.\n * @see queryName (const std::string&)\n * @param ns The namespace.\n * @param name The (namespace-less) name.\n * @return The created name object.\n *\/\nNamecoinInterface::Name\nNamecoinInterface::queryName (const std::string& ns, const std::string& name)\n{\n std::ostringstream full;\n full << ns << \"\/\" << name;\n return queryName (full.str ());\n}\n\n\/**\n * Query for the number of confirmations a transaction has.\n * @param txid The transaction id to check for.\n * @return Number of confirmations the transaction has.\n * @throws JsonRpc::RpcError if the tx is not found.\n *\/\nunsigned\nNamecoinInterface::getNumberOfConfirmations (const std::string& txid)\n{\n const JsonRpc::JsonData res = rpc.executeRpc (\"gettransaction\", txid);\n assert (res.isObject ());\n\n return res[\"confirmations\"].asInt ();\n}\n\n\/**\n * Check whether the wallet needs to be unlocked or not. This routine is\n * used to decide whether we need to ask for a passphrase or not before\n * using WalletUnlocker.\n * @return True iff we need a passphrase.\n *\/\nbool\nNamecoinInterface::needWalletPassphrase ()\n{\n const JsonRpc::JsonData res = rpc.executeRpc (\"getinfo\");\n\n if (res[\"unlocked_until\"].isNull ())\n return false;\n\n const int until = res[\"unlocked_until\"].asInt ();\n return (until < std::time (nullptr) + UNLOCK_SECONDS);\n}\n\n\/* ************************************************************************** *\/\n\/* Address object. *\/\n\n\/**\n * Construct the address. This is meant to be used only\n * from inside NamecoinInterface. Outside users should use\n * NamecoinInterface::queryAddress or other methods to obtain\n * address objects.\n * @param r The namecoin interface to use.\n * @param a The address as string.\n *\/\nNamecoinInterface::Address::Address (JsonRpc& r, const std::string& a)\n : rpc(&r), addr(a)\n{\n const JsonRpc::JsonData res = rpc->executeRpc (\"validateaddress\", addr);\n valid = res[\"isvalid\"].asBool ();\n mine = false;\n if (valid)\n mine = res[\"ismine\"].asBool ();\n}\n\n\/**\n * Check a message signature against this address. If this address\n * is invalid, false is returned.\n * @param msg The message that should be signed.\n * @param sig The message's signature.\n * @return True iff the signature matches the message.\n *\/\nbool\nNamecoinInterface::Address::verifySignature (const std::string& msg,\n const std::string& sig) const\n{\n if (!valid)\n return false;\n\n try\n {\n JsonRpc::JsonData res = rpc->executeRpc (\"verifymessage\", addr, sig, msg);\n return (res.isBool () && res.asBool ());\n }\n catch (const JsonRpc::RpcError& exc)\n {\n \/\/ Malformed base64?\n if (exc.getErrorCode () == -5)\n return false;\n throw exc;\n }\n}\n\n\/**\n * Sign a message with this address. This may throw if the address\n * is invalid, the wallet locked or the private key is not owned.\n * @param msg The message that should be signed.\n * @return The message's signature.\n * @throws NoPrivateKey if this address is not owned.\n * @throws std::runtime_error if the address is invalid or the wallet locked.\n *\/\nstd::string\nNamecoinInterface::Address::signMessage (const std::string& msg) const\n{\n if (!valid)\n throw std::runtime_error (\"Can't sign with invalid address.\");\n\n try\n {\n const JsonRpc::JsonData res = rpc->executeRpc (\"signmessage\", addr, msg);\n return res.asString ();\n }\n catch (const JsonRpc::RpcError& exc)\n {\n switch (exc.getErrorCode ())\n {\n case -13:\n throw std::runtime_error (\"Need to unlock the wallet first.\");\n\n case -3:\n {\n std::ostringstream msg;\n msg << \"You don't have the private key of \" << addr << \" in order\"\n << \" to sign messages with that address.\";\n throw NoPrivateKey (msg.str ());\n }\n\n default:\n throw exc;\n }\n }\n}\n\n\/* ************************************************************************** *\/\n\/* Name object. *\/\n\n\/**\n * Construct the name. This is meant to be used only\n * from inside NamecoinInterface. Outside users should use\n * NamecoinInterface::queryName or other methods to obtain\n * name objects.\n * @param n The name's string.\n * @param nc NamecoinInterface object.\n * @param rpc The RPC object to use for finding info about the name.\n *\/\nNamecoinInterface::Name::Name (const std::string& n, NamecoinInterface& nc,\n JsonRpc& rpc)\n : initialised(true), name(n)\n{\n try\n {\n data = rpc.executeRpc (\"name_show\", n);\n ex = true;\n addr = nc.queryAddress (data[\"address\"].asString ());\n }\n catch (const JsonRpc::RpcError& exc)\n {\n if (exc.getErrorCode () == -4)\n {\n ex = false;\n return;\n }\n throw exc;\n }\n}\n\n\/**\n * Ensure that this object has status \"exists\".\n * @throws NameNotFound if the name doesn't yet exist.\n *\/\nvoid\nNamecoinInterface::Name::ensureExists () const\n{\n if (!ex)\n throw NameNotFound (name);\n}\n\n\/* ************************************************************************** *\/\n\/* Wallet unlocker. *\/\n\n\/**\n * Construct it, not yet unlocking.\n * @param n The NamecoinInterface to use.\n *\/\nNamecoinInterface::WalletUnlocker::WalletUnlocker (NamecoinInterface& n)\n : rpc(n.rpc), nc(n), unlocked(false)\n{\n \/\/ Nothing else to do.\n}\n\n\/**\n * Lock the wallet on destruct.\n *\/\nNamecoinInterface::WalletUnlocker::~WalletUnlocker ()\n{\n if (unlocked)\n rpc.executeRpc (\"walletlock\");\n}\n\n\/**\n * Perform the unlock (if necessary). The passphrase must be correct if the\n * wallet is actually locked, and can be anything else.\n * @param passphrase Passphrase to use for unlocking.\n * @throws UnlockFailure if the passphrase is wrong.\n *\/\nvoid\nNamecoinInterface::WalletUnlocker::unlock (const std::string& passphrase)\n{\n if (unlocked)\n throw std::runtime_error (\"Wallet is already unlocked!\");\n \n unlocked = nc.needWalletPassphrase ();\n if (unlocked)\n {\n \/* Ensure the wallet is indeed locked before we send the passphrase.\n It could be the case that it is unlocked although for too short\n a time, then lock it now. *\/\n rpc.executeRpc (\"walletlock\");\n try\n {\n rpc.executeRpc (\"walletpassphrase\", passphrase, UNLOCK_SECONDS);\n }\n catch (const JsonRpc::RpcError& exc)\n {\n if (exc.getErrorCode () == -14)\n throw UnlockFailure (\"Wrong wallet passphrase.\");\n throw exc;\n }\n }\n}\n\n} \/\/ namespace nmcrpc\n<commit_msg>Set unlocked = true only in case of success.<commit_after>\/* Namecoin RPC library.\n * Copyright (C) 2013 Daniel Kraft <d@domob.eu>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n * See the distributed file COPYING for additional permissions in addition\n * to those of the GNU Affero General Public License.\n *\/\n\n\/* Source code for NamecoinInterface.hpp. *\/\n\n#include \"NamecoinInterface.hpp\"\n\n#include <ctime>\n#include <sstream>\n\nnamespace nmcrpc\n{\n\n\/* ************************************************************************** *\/\n\/* High-level interface to Namecoin. *\/\n\nconst unsigned NamecoinInterface::UNLOCK_SECONDS = 3600;\n\n\/**\n * Run a simple test command and return whether the connection seems to\n * be up and running. It also produces a message that can be shown, which\n * either includes the running version or an error string.\n * @param msg Set this to the message string.\n * @return True iff the connection seems to be fine.\n *\/\nbool\nNamecoinInterface::testConnection (std::string& msg)\n{\n try\n {\n const JsonRpc::JsonData res = rpc.executeRpc (\"getinfo\");\n int version = res[\"version\"].asInt ();\n\n unsigned v3 = version % 100;\n version \/= 100;\n unsigned v2 = version % 100;\n version \/= 100;\n\n std::ostringstream msgOut;\n msgOut << \"Success! Namecoind version \"\n << \"0.\" << version << \".\" << v2;\n if (v3 > 0)\n msgOut << \".\" << v3;\n msgOut << \" running.\";\n msg = msgOut.str ();\n\n return true;\n }\n catch (const JsonRpc::HttpError& exc)\n {\n std::ostringstream res;\n res << \"HTTP-Error (\" << exc.getResponseCode () << \"): \"\n << exc.what ();\n msg = res.str ();\n }\n catch (const JsonRpc::Exception& exc)\n {\n msg = exc.what ();\n }\n\n return false;\n}\n\n\/**\n * Query for an address by string. This immediately checks whether the\n * address is valid and owned by the user, so that this information can be\n * encapsulated into the returned object.\n * @param addr The address to check.\n * @return The created address object.\n *\/\nNamecoinInterface::Address\nNamecoinInterface::queryAddress (const std::string& addr)\n{\n return Address (rpc, addr);\n}\n\n\/**\n * Create a new address (as per \"getnewaddress\") and return it.\n * @return Newly created address.\n *\/\nNamecoinInterface::Address\nNamecoinInterface::createAddress ()\n{\n const JsonRpc::JsonData addr = rpc.executeRpc (\"getnewaddress\");\n return Address (rpc, addr.asString ());\n}\n\n\/**\n * Query for a name by string. If the name is registered, this immediately\n * queries for the name's associated data. If the name does not yet exist,\n * this still succeeds and returns a Name object that can be used to find\n * out that fact as well as register the name.\n * @param name The name to check.\n * @return The created name object.\n *\/\nNamecoinInterface::Name\nNamecoinInterface::queryName (const std::string& name)\n{\n return Name (name, *this, rpc);\n}\n\n\/**\n * Query for a name by namespace and name.\n * @see queryName (const std::string&)\n * @param ns The namespace.\n * @param name The (namespace-less) name.\n * @return The created name object.\n *\/\nNamecoinInterface::Name\nNamecoinInterface::queryName (const std::string& ns, const std::string& name)\n{\n std::ostringstream full;\n full << ns << \"\/\" << name;\n return queryName (full.str ());\n}\n\n\/**\n * Query for the number of confirmations a transaction has.\n * @param txid The transaction id to check for.\n * @return Number of confirmations the transaction has.\n * @throws JsonRpc::RpcError if the tx is not found.\n *\/\nunsigned\nNamecoinInterface::getNumberOfConfirmations (const std::string& txid)\n{\n const JsonRpc::JsonData res = rpc.executeRpc (\"gettransaction\", txid);\n assert (res.isObject ());\n\n return res[\"confirmations\"].asInt ();\n}\n\n\/**\n * Check whether the wallet needs to be unlocked or not. This routine is\n * used to decide whether we need to ask for a passphrase or not before\n * using WalletUnlocker.\n * @return True iff we need a passphrase.\n *\/\nbool\nNamecoinInterface::needWalletPassphrase ()\n{\n const JsonRpc::JsonData res = rpc.executeRpc (\"getinfo\");\n\n if (res[\"unlocked_until\"].isNull ())\n return false;\n\n const int until = res[\"unlocked_until\"].asInt ();\n return (until < std::time (nullptr) + UNLOCK_SECONDS);\n}\n\n\/* ************************************************************************** *\/\n\/* Address object. *\/\n\n\/**\n * Construct the address. This is meant to be used only\n * from inside NamecoinInterface. Outside users should use\n * NamecoinInterface::queryAddress or other methods to obtain\n * address objects.\n * @param r The namecoin interface to use.\n * @param a The address as string.\n *\/\nNamecoinInterface::Address::Address (JsonRpc& r, const std::string& a)\n : rpc(&r), addr(a)\n{\n const JsonRpc::JsonData res = rpc->executeRpc (\"validateaddress\", addr);\n valid = res[\"isvalid\"].asBool ();\n mine = false;\n if (valid)\n mine = res[\"ismine\"].asBool ();\n}\n\n\/**\n * Check a message signature against this address. If this address\n * is invalid, false is returned.\n * @param msg The message that should be signed.\n * @param sig The message's signature.\n * @return True iff the signature matches the message.\n *\/\nbool\nNamecoinInterface::Address::verifySignature (const std::string& msg,\n const std::string& sig) const\n{\n if (!valid)\n return false;\n\n try\n {\n JsonRpc::JsonData res = rpc->executeRpc (\"verifymessage\", addr, sig, msg);\n return (res.isBool () && res.asBool ());\n }\n catch (const JsonRpc::RpcError& exc)\n {\n \/\/ Malformed base64?\n if (exc.getErrorCode () == -5)\n return false;\n throw exc;\n }\n}\n\n\/**\n * Sign a message with this address. This may throw if the address\n * is invalid, the wallet locked or the private key is not owned.\n * @param msg The message that should be signed.\n * @return The message's signature.\n * @throws NoPrivateKey if this address is not owned.\n * @throws std::runtime_error if the address is invalid or the wallet locked.\n *\/\nstd::string\nNamecoinInterface::Address::signMessage (const std::string& msg) const\n{\n if (!valid)\n throw std::runtime_error (\"Can't sign with invalid address.\");\n\n try\n {\n const JsonRpc::JsonData res = rpc->executeRpc (\"signmessage\", addr, msg);\n return res.asString ();\n }\n catch (const JsonRpc::RpcError& exc)\n {\n switch (exc.getErrorCode ())\n {\n case -13:\n throw std::runtime_error (\"Need to unlock the wallet first.\");\n\n case -3:\n {\n std::ostringstream msg;\n msg << \"You don't have the private key of \" << addr << \" in order\"\n << \" to sign messages with that address.\";\n throw NoPrivateKey (msg.str ());\n }\n\n default:\n throw exc;\n }\n }\n}\n\n\/* ************************************************************************** *\/\n\/* Name object. *\/\n\n\/**\n * Construct the name. This is meant to be used only\n * from inside NamecoinInterface. Outside users should use\n * NamecoinInterface::queryName or other methods to obtain\n * name objects.\n * @param n The name's string.\n * @param nc NamecoinInterface object.\n * @param rpc The RPC object to use for finding info about the name.\n *\/\nNamecoinInterface::Name::Name (const std::string& n, NamecoinInterface& nc,\n JsonRpc& rpc)\n : initialised(true), name(n)\n{\n try\n {\n data = rpc.executeRpc (\"name_show\", n);\n ex = true;\n addr = nc.queryAddress (data[\"address\"].asString ());\n }\n catch (const JsonRpc::RpcError& exc)\n {\n if (exc.getErrorCode () == -4)\n {\n ex = false;\n return;\n }\n throw exc;\n }\n}\n\n\/**\n * Ensure that this object has status \"exists\".\n * @throws NameNotFound if the name doesn't yet exist.\n *\/\nvoid\nNamecoinInterface::Name::ensureExists () const\n{\n if (!ex)\n throw NameNotFound (name);\n}\n\n\/* ************************************************************************** *\/\n\/* Wallet unlocker. *\/\n\n\/**\n * Construct it, not yet unlocking.\n * @param n The NamecoinInterface to use.\n *\/\nNamecoinInterface::WalletUnlocker::WalletUnlocker (NamecoinInterface& n)\n : rpc(n.rpc), nc(n), unlocked(false)\n{\n \/\/ Nothing else to do.\n}\n\n\/**\n * Lock the wallet on destruct.\n *\/\nNamecoinInterface::WalletUnlocker::~WalletUnlocker ()\n{\n if (unlocked)\n rpc.executeRpc (\"walletlock\");\n}\n\n\/**\n * Perform the unlock (if necessary). The passphrase must be correct if the\n * wallet is actually locked, and can be anything else.\n * @param passphrase Passphrase to use for unlocking.\n * @throws UnlockFailure if the passphrase is wrong.\n *\/\nvoid\nNamecoinInterface::WalletUnlocker::unlock (const std::string& passphrase)\n{\n if (unlocked)\n throw std::runtime_error (\"Wallet is already unlocked!\");\n \n const bool needPwd = nc.needWalletPassphrase ();\n if (needPwd)\n {\n \/* Ensure the wallet is indeed locked before we send the passphrase.\n It could be the case that it is unlocked although for too short\n a time, then lock it now. *\/\n rpc.executeRpc (\"walletlock\");\n\n try\n {\n rpc.executeRpc (\"walletpassphrase\", passphrase, UNLOCK_SECONDS);\n unlocked = true;\n }\n catch (const JsonRpc::RpcError& exc)\n {\n if (exc.getErrorCode () == -14)\n throw UnlockFailure (\"Wrong wallet passphrase.\");\n throw exc;\n }\n }\n}\n\n} \/\/ namespace nmcrpc\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2005-2017 Centre National d'Etudes Spatiales (CNES)\n *\n * This file is part of Orfeo Toolbox\n *\n * https:\/\/www.orfeo-toolbox.org\/\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"itkScalableAffineTransform.h\"\n#include \"otbStreamingResampleImageFilter.h\"\n#include \"otbBCOInterpolateImageFunction.h\"\n#include \"otbKeyPointSetsMatchingFilter.h\"\n#include \"otbSiftFastImageFilter.h\"\n#include \"otbImageToSIFTKeyPointSetFilter.h\"\n#include \"otbImageToSURFKeyPointSetFilter.h\"\n#include \"itkPointSet.h\"\n\n#include <tuple>\n\nusing ImageType = otb::Image<double>;\nusing ReaderType = otb::ImageFileReader<ImageType>;\nusing TransformType = itk::ScalableAffineTransform<double, 2>;\nusing ResamplerType = otb::StreamingResampleImageFilter<ImageType, ImageType, double>;\nusing InterpolatorType = otb::BCOInterpolateImageFunction<ImageType, double>;\nusing VectorType = itk::VariableLengthVector<double>;\nusing PointSetType = itk::PointSet<VectorType, 2>;\nusing SiftFastFilterType = otb::SiftFastImageFilter<ImageType, PointSetType>;\nusing SiftFilterType = otb::ImageToSIFTKeyPointSetFilter<ImageType, PointSetType>;\nusing SurfFilterType = otb::ImageToSURFKeyPointSetFilter<ImageType, PointSetType>;\nusing MatchingFilterType = otb::KeyPointSetsMatchingFilter<PointSetType>;\n\nauto printResult = [](bool value) { return value ? \"Ok\" : \"Nok\"; };\n\nbool testMatchingFilter()\n{\n auto ps1 = PointSetType::New();\n auto ps2 = PointSetType::New();\n\n PointSetType::PointType p1,p2,p3,p4,p5,p6;\n p1.Fill(1.);\n p2.Fill(2.);\n p3.Fill(3.);\n p4.Fill(4.);\n p5.Fill(5.);\n p6.Fill(6.);\n ps1->SetPoint(0, p1);\n ps1->SetPoint(1, p2);\n ps1->SetPoint(2, p3);\n ps2->SetPoint(0, p4);\n ps2->SetPoint(1, p5);\n ps2->SetPoint(2, p6);\n\n\n VectorType d1(1), d2(1), d3(1), d4(1),d5(1), d6(1);\n d1[0]=0.7;\n d2[0]=0.8;\n d3[0]=10.;\n d4[0]=0.;\n d5[0]=1.;\n d6[0]=11.;\n\n ps1->SetPointData(0, d1);\n ps1->SetPointData(1, d2);\n ps1->SetPointData(2, d3);\n ps2->SetPointData(0, d4);\n ps2->SetPointData(1, d5);\n ps2->SetPointData(2, d6);\n\n auto filter1 = MatchingFilterType::New();\n filter1->SetDistanceThreshold(0.6);\n filter1->SetUseBackMatching(false);\n filter1->SetInput1(ps1); \n filter1->SetInput2(ps2);\n filter1->Update();\n\n auto matches1 = filter1->GetOutput();\n\n std::cout<<\"Matches without backmatching: \"<<std::endl;\n\n for (auto it = matches1->Begin(); it != matches1->End(); ++it)\n {\n std::cout<<it.Get()->GetPoint1()<<\" <-> \"<<it.Get()->GetPoint2()<<std::endl;\n }\n\n auto filter2 = MatchingFilterType::New();\n filter2->SetDistanceThreshold(0.6);\n filter2->SetUseBackMatching(true);\n filter2->SetInput1(ps1); \n filter2->SetInput2(ps2);\n filter2->Update();\n\n auto matches2 = filter2->GetOutput();\n\n std::cout<<\"Matches with backmatching: \"<<std::endl;\n\n for (auto it = matches2->Begin(); it != matches2->End(); ++it)\n {\n std::cout<<it.Get()->GetPoint1()<<\" <-> \"<<it.Get()->GetPoint2()<<std::endl;\n }\n\n bool success = true;\n\n \/\/ Without backmatching, matches should be:\n \/\/ p1 <-> p5\n \/\/ p2 <-> p5\n \/\/ p3 <-> p6\n unsigned int nb_matches = matches1->Size();\n \n bool test = nb_matches == 3;\n std::cout<<\"Without backmatching, the number of matches is 3:\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = nb_matches > 1 && matches1->GetNthElement(0)->GetPoint1() == p1 && matches1->GetNthElement(0)->GetPoint2() == p5;\n std::cout<<\"Without backmatching, p1 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = nb_matches > 0 && matches1->GetNthElement(1)->GetPoint1() == p2 && matches1->GetNthElement(1)->GetPoint2() == p5;\n std::cout<<\"Without backmatching, p2 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n\n test = nb_matches > 2 && matches1->GetNthElement(2)->GetPoint1() == p3 && matches1->GetNthElement(2)->GetPoint2() == p6;\n std::cout<<\"Without backmatching, p3 matches with p6:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n \/\/ With back-matching there should be only 2 matches: \n \/\/ p2 <-> p5\n \/\/ p3 <-> p6\n test = matches2->Size() == 2;\n std::cout<<\"With backmatching, the number of matches is 2:\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = matches2->GetNthElement(0)->GetPoint1() == p2 && matches2->GetNthElement(0)->GetPoint2() == p5;\n std::cout<<\"With backmatching, p2 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = matches2->GetNthElement(1)->GetPoint1() == p3 && matches2->GetNthElement(1)->GetPoint2() == p6;\n std::cout<<\"With backmatching, p3 matches with p6:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n\n\n return success;\n}\n\n\n\/** Generate a pair of images, one beeing slightly warped wrt the\n * other *\/\nauto generateImagePair(const std::string& infname, double rotation, double scaling)\n{\n \/\/ Read reference image\n auto reader = ReaderType::New();\n reader->SetFileName(infname);\n reader->Update();\n ImageType::Pointer reference = reader->GetOutput();\n\n \/\/ Create secondary image\n\n \/\/ Setup transform\n auto transform = TransformType::New();\n\n \/\/ Set rotation center as image center\n auto origin = reference->GetOrigin();\n auto spacing = reference->GetSpacing();\n auto size = reference->GetLargestPossibleRegion().GetSize();\n auto center = origin;\n center[0] += 0.5 * spacing[0] * size[0];\n center[1] += 0.5 * spacing[1] * size[1];\n transform->SetCenter(center);\n\n \/\/ Set rotation angle\n transform->Rotate2D(rotation * otb::CONST_PI_180);\n\n \/\/ Set scale\n ImageType::SpacingType scalingVector;\n scalingVector.Fill(scaling);\n transform->Scale(scalingVector);\n\n \/\/ Invert transform\n auto inverse = TransformType::New();\n bool ok = transform->GetInverse(inverse);\n if (!ok)\n throw std::logic_error(\"Could not inverse transform\");\n \/\/ Setup interpolator\n auto interpolator = InterpolatorType::New();\n\n \/\/ Setup resampler\n auto resampler = ResamplerType::New();\n resampler->SetInput(reference);\n resampler->SetTransform(transform);\n resampler->SetInterpolator(interpolator);\n\n \/\/ Since rotation and scaling are small, use same image parameter\n \/\/ for secondary image\n resampler->SetOutputOrigin(origin);\n resampler->SetOutputSize(size);\n resampler->SetOutputSpacing(spacing);\n resampler->Update();\n ImageType::Pointer secondary = resampler->GetOutput();\n\n return std::make_tuple(reference, secondary, transform);\n}\n\n\/** Perform checks for one keypoints algorithm *\/\ntemplate <typename TKeyPointsFilter, typename TParameterSetter>\nbool checkKeyPointsFilter(const ImageType* reference, const ImageType* secondary, const TransformType* transform, const TParameterSetter& configureFilter,\n double match_rate_thresh, double good_match_rate_thresh)\n{\n \/\/ Keypoints on first image\n auto filterReference = TKeyPointsFilter::New();\n filterReference->SetInput(reference);\n configureFilter(filterReference);\n\n \/\/ Keypoints on secondary image\n auto filterSecondary = TKeyPointsFilter::New();\n filterSecondary->SetInput(secondary);\n configureFilter(filterSecondary);\n\n \/\/ Match keypoints\n auto matcher = MatchingFilterType::New();\n matcher->SetUseBackMatching(false);\n matcher->SetDistanceThreshold(0.6);\n matcher->SetInput1(filterReference->GetOutput());\n matcher->SetInput2(filterSecondary->GetOutput());\n matcher->Update();\n\n PointSetType::Pointer referencePoints = filterReference->GetOutput();\n const size_t nbReferencePoints = referencePoints->GetPoints()->Size();\n\n typename PointSetType::Pointer secondaryPoints = filterSecondary->GetOutput();\n const size_t nbSecondaryPoints = secondaryPoints->GetPoints()->Size();\n\n std::cout << \"Found \" << nbReferencePoints << \" points in reference image and \" << nbSecondaryPoints << \" points in secondary image\" << std::endl;\n\n auto matches = matcher->GetOutput();\n const size_t nb_matches = matches->Size();\n\n size_t good_matches = 0;\n const double threshold_for_good_match = 0.5; \/\/ pixels\n\n \/\/ Count good and bad matches\n for (auto it = matches->Begin(); it != matches->End(); ++it)\n {\n const auto p1 = it.Get()->GetPoint1();\n const auto p2 = it.Get()->GetPoint2();\n\n const auto p2_mapped = transform->TransformPoint(p2);\n\n \/\/ Check that matches are good up to 0.1 pixel\n if ((p1[0] - p2_mapped[0]) * (p1[0] - p2_mapped[0]) + (p1[1] - p2_mapped[1]) * (p1[1] - p2_mapped[1]) <=\n threshold_for_good_match * threshold_for_good_match)\n ++good_matches;\n }\n\n \/\/ Performances metrics\n const float reference_match_rate = nb_matches \/ static_cast<float>(nbReferencePoints);\n const float secondary_match_rate = nb_matches \/ static_cast<float>(nbSecondaryPoints);\n const float good_match_rate = good_matches \/ static_cast<float>(nb_matches);\n\n\n std::cout << \"Found \" << nb_matches << \" matches with \" << good_matches << \" valid matches (tolerance of 0.5 pixels)\" << std::endl;\n\n \/\/ Quality gate\n bool current_test = reference_match_rate > match_rate_thresh;\n bool overall_status = current_test;\n std::cout << \"More than \" << 100 * match_rate_thresh << \"% of reference points have a match:\\t\" << printResult(current_test) << \" (\"\n << 100 * reference_match_rate << \"%)\" << std::endl;\n\n current_test = secondary_match_rate > match_rate_thresh;\n std::cout << \"More than \" << 100 * match_rate_thresh << \"% of secondary points have a match:\\t\" << printResult(current_test) << \" (\"\n << 100 * secondary_match_rate << \"%)\" << std::endl;\n overall_status = overall_status && current_test;\n\n current_test = good_match_rate > good_match_rate_thresh;\n std::cout << \"More than \" << good_match_rate_thresh * 100 << \"% of matches are good: \\t\" << printResult(current_test) << \" (\"\n << 100 * good_match_rate << \"% at 0.5 pixel accuracy)\"\n << \"\\n\";\n overall_status = overall_status && current_test;\n return overall_status;\n}\n\n\nint otbKeyPointsAlgorithmsTest(int argc, char* argv[])\n{\n if (argc != 2)\n {\n std::cerr << \"Usage: \" << argv[0] << \" infname\" << std::endl;\n return EXIT_FAILURE;\n }\n const char* infname = argv[1];\n\n \/\/ Generate reference and secondary image\n ImageType::Pointer reference, secondary;\n TransformType::Pointer transform;\n\n \/\/ Small rotation and scaling\n const double rotation = 2.5; \/\/ 5°\n const double scaling = 0.99;\n \n \/\/ First test matching filter alone\n std::cout<<\"Checking matching filter:\"<<std::endl;\n std::cout<<\"=========================\"<<std::endl;\n bool status = testMatchingFilter();\n \n std::tie(reference, secondary, transform) = generateImagePair(infname, rotation, scaling);\n\n std::cout << \"Secondary image generated by applying a rotation of \" << rotation << \" degrees and scaling of \" << scaling << \".\" << std::endl;\n\n \/\/ Test Surf filter\n std::cout << \"Checking Surf implementation:\" << std::endl;\n std::cout << \"=============================\" << std::endl;\n\n \/\/ Lambda to configure surf algorithm\n auto configureSurf = [](SurfFilterType* filter) {\n filter->SetOctavesNumber(4);\n filter->SetScalesNumber(8);\n };\n\n status = checkKeyPointsFilter<SurfFilterType>(reference, secondary, transform, configureSurf, 0.15, 0.65) && status;\n\n \/\/ Test Sift filter\n std::cout << \"Checking Sift implementation:\" << std::endl;\n std::cout << \"=============================\" << std::endl;\n\n \/\/ Lambda to configure sift algorithm\n auto configureSift = [](SiftFilterType* filter) {\n filter->SetOctavesNumber(4);\n filter->SetScalesNumber(8);\n filter->SetDoGThreshold(0.01);\n filter->SetEdgeThreshold(10.);\n };\n\n status = checkKeyPointsFilter<SiftFilterType>(reference, secondary, transform, configureSift, 0.45, 0.85) && status;\n\n#ifdef OTB_USE_SIFTFAST\n \/\/ Test SiftFast filter\n std::cout << \"Checking SiftFast implementation:\" << std::endl;\n std::cout << \"=================================\" << std::endl;\n\n \/\/ lambda to set specific filter parameter\n auto configureSiftFast = [](SiftFastFilterType* filter) { filter->SetScalesNumber(8); };\n\n status = checkKeyPointsFilter<SiftFastFilterType>(reference, secondary, transform, configureSiftFast, 0.65, 0.95) && status;\n#endif\n\n return status ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<commit_msg>TEST: Reduce input size for better test duration<commit_after>\/*\n * Copyright (C) 2005-2017 Centre National d'Etudes Spatiales (CNES)\n *\n * This file is part of Orfeo Toolbox\n *\n * https:\/\/www.orfeo-toolbox.org\/\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"otbImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbExtractROI.h\"\n#include \"itkScalableAffineTransform.h\"\n#include \"otbStreamingResampleImageFilter.h\"\n#include \"otbBCOInterpolateImageFunction.h\"\n#include \"otbKeyPointSetsMatchingFilter.h\"\n#include \"otbSiftFastImageFilter.h\"\n#include \"otbImageToSIFTKeyPointSetFilter.h\"\n#include \"otbImageToSURFKeyPointSetFilter.h\"\n#include \"itkPointSet.h\"\n\n#include <tuple>\n\nusing ImageType = otb::Image<double>;\nusing ReaderType = otb::ImageFileReader<ImageType>;\nusing ExtractType = otb::ExtractROI<double,double>;\nusing TransformType = itk::ScalableAffineTransform<double, 2>;\nusing ResamplerType = otb::StreamingResampleImageFilter<ImageType, ImageType, double>;\nusing InterpolatorType = otb::BCOInterpolateImageFunction<ImageType, double>;\nusing VectorType = itk::VariableLengthVector<double>;\nusing PointSetType = itk::PointSet<VectorType, 2>;\nusing SiftFastFilterType = otb::SiftFastImageFilter<ImageType, PointSetType>;\nusing SiftFilterType = otb::ImageToSIFTKeyPointSetFilter<ImageType, PointSetType>;\nusing SurfFilterType = otb::ImageToSURFKeyPointSetFilter<ImageType, PointSetType>;\nusing MatchingFilterType = otb::KeyPointSetsMatchingFilter<PointSetType>;\n\nauto printResult = [](bool value) { return value ? \"Ok\" : \"Nok\"; };\n\nbool testMatchingFilter()\n{\n auto ps1 = PointSetType::New();\n auto ps2 = PointSetType::New();\n\n PointSetType::PointType p1,p2,p3,p4,p5,p6;\n p1.Fill(1.);\n p2.Fill(2.);\n p3.Fill(3.);\n p4.Fill(4.);\n p5.Fill(5.);\n p6.Fill(6.);\n ps1->SetPoint(0, p1);\n ps1->SetPoint(1, p2);\n ps1->SetPoint(2, p3);\n ps2->SetPoint(0, p4);\n ps2->SetPoint(1, p5);\n ps2->SetPoint(2, p6);\n\n\n VectorType d1(1), d2(1), d3(1), d4(1),d5(1), d6(1);\n d1[0]=0.7;\n d2[0]=0.8;\n d3[0]=10.;\n d4[0]=0.;\n d5[0]=1.;\n d6[0]=11.;\n\n ps1->SetPointData(0, d1);\n ps1->SetPointData(1, d2);\n ps1->SetPointData(2, d3);\n ps2->SetPointData(0, d4);\n ps2->SetPointData(1, d5);\n ps2->SetPointData(2, d6);\n\n auto filter1 = MatchingFilterType::New();\n filter1->SetDistanceThreshold(0.6);\n filter1->SetUseBackMatching(false);\n filter1->SetInput1(ps1); \n filter1->SetInput2(ps2);\n filter1->Update();\n\n auto matches1 = filter1->GetOutput();\n\n std::cout<<\"Matches without backmatching: \"<<std::endl;\n\n for (auto it = matches1->Begin(); it != matches1->End(); ++it)\n {\n std::cout<<it.Get()->GetPoint1()<<\" <-> \"<<it.Get()->GetPoint2()<<std::endl;\n }\n\n auto filter2 = MatchingFilterType::New();\n filter2->SetDistanceThreshold(0.6);\n filter2->SetUseBackMatching(true);\n filter2->SetInput1(ps1); \n filter2->SetInput2(ps2);\n filter2->Update();\n\n auto matches2 = filter2->GetOutput();\n\n std::cout<<\"Matches with backmatching: \"<<std::endl;\n\n for (auto it = matches2->Begin(); it != matches2->End(); ++it)\n {\n std::cout<<it.Get()->GetPoint1()<<\" <-> \"<<it.Get()->GetPoint2()<<std::endl;\n }\n\n bool success = true;\n\n \/\/ Without backmatching, matches should be:\n \/\/ p1 <-> p5\n \/\/ p2 <-> p5\n \/\/ p3 <-> p6\n unsigned int nb_matches = matches1->Size();\n \n bool test = nb_matches == 3;\n std::cout<<\"Without backmatching, the number of matches is 3:\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = nb_matches > 1 && matches1->GetNthElement(0)->GetPoint1() == p1 && matches1->GetNthElement(0)->GetPoint2() == p5;\n std::cout<<\"Without backmatching, p1 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = nb_matches > 0 && matches1->GetNthElement(1)->GetPoint1() == p2 && matches1->GetNthElement(1)->GetPoint2() == p5;\n std::cout<<\"Without backmatching, p2 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n\n test = nb_matches > 2 && matches1->GetNthElement(2)->GetPoint1() == p3 && matches1->GetNthElement(2)->GetPoint2() == p6;\n std::cout<<\"Without backmatching, p3 matches with p6:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n \/\/ With back-matching there should be only 2 matches: \n \/\/ p2 <-> p5\n \/\/ p3 <-> p6\n test = matches2->Size() == 2;\n std::cout<<\"With backmatching, the number of matches is 2:\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = matches2->GetNthElement(0)->GetPoint1() == p2 && matches2->GetNthElement(0)->GetPoint2() == p5;\n std::cout<<\"With backmatching, p2 matches with p5:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n test = matches2->GetNthElement(1)->GetPoint1() == p3 && matches2->GetNthElement(1)->GetPoint2() == p6;\n std::cout<<\"With backmatching, p3 matches with p6:\\t\\t\"<<printResult(test)<<std::endl;\n success = success && test;\n\n\n\n return success;\n}\n\n\n\/** Generate a pair of images, one beeing slightly warped wrt the\n * other *\/\nauto generateImagePair(const std::string& infname, double rotation, double scaling)\n{\n \/\/ Read reference image\n auto reader = ReaderType::New();\n reader->SetFileName(infname);\n\n auto extractor = ExtractType::New();\n extractor->SetInput(reader->GetOutput());\n extractor->SetSizeX(50);\n extractor->SetSizeY(50);\n extractor->Update();\n\n ImageType::Pointer reference = extractor->GetOutput();\n\n \/\/ Create secondary image\n\n \/\/ Setup transform\n auto transform = TransformType::New();\n\n \/\/ Set rotation center as image center\n auto origin = reference->GetOrigin();\n auto spacing = reference->GetSpacing();\n auto size = reference->GetLargestPossibleRegion().GetSize();\n auto center = origin;\n center[0] += 0.5 * spacing[0] * size[0];\n center[1] += 0.5 * spacing[1] * size[1];\n transform->SetCenter(center);\n\n \/\/ Set rotation angle\n transform->Rotate2D(rotation * otb::CONST_PI_180);\n\n \/\/ Set scale\n ImageType::SpacingType scalingVector;\n scalingVector.Fill(scaling);\n transform->Scale(scalingVector);\n\n \/\/ Invert transform\n auto inverse = TransformType::New();\n bool ok = transform->GetInverse(inverse);\n if (!ok)\n throw std::logic_error(\"Could not inverse transform\");\n \/\/ Setup interpolator\n auto interpolator = InterpolatorType::New();\n\n \/\/ Setup resampler\n auto resampler = ResamplerType::New();\n resampler->SetInput(reference);\n resampler->SetTransform(transform);\n resampler->SetInterpolator(interpolator);\n\n \/\/ Since rotation and scaling are small, use same image parameter\n \/\/ for secondary image\n resampler->SetOutputOrigin(origin);\n resampler->SetOutputSize(size);\n resampler->SetOutputSpacing(spacing);\n resampler->Update();\n ImageType::Pointer secondary = resampler->GetOutput();\n\n return std::make_tuple(reference, secondary, transform);\n}\n\n\/** Perform checks for one keypoints algorithm *\/\ntemplate <typename TKeyPointsFilter, typename TParameterSetter>\nbool checkKeyPointsFilter(const ImageType* reference, const ImageType* secondary, const TransformType* transform, const TParameterSetter& configureFilter,\n double match_rate_thresh, double good_match_rate_thresh)\n{\n \/\/ Keypoints on first image\n auto filterReference = TKeyPointsFilter::New();\n filterReference->SetInput(reference);\n configureFilter(filterReference);\n\n \/\/ Keypoints on secondary image\n auto filterSecondary = TKeyPointsFilter::New();\n filterSecondary->SetInput(secondary);\n configureFilter(filterSecondary);\n\n \/\/ Match keypoints\n auto matcher = MatchingFilterType::New();\n matcher->SetUseBackMatching(false);\n matcher->SetDistanceThreshold(0.6);\n matcher->SetInput1(filterReference->GetOutput());\n matcher->SetInput2(filterSecondary->GetOutput());\n matcher->Update();\n\n PointSetType::Pointer referencePoints = filterReference->GetOutput();\n const size_t nbReferencePoints = referencePoints->GetPoints()->Size();\n\n typename PointSetType::Pointer secondaryPoints = filterSecondary->GetOutput();\n const size_t nbSecondaryPoints = secondaryPoints->GetPoints()->Size();\n\n std::cout << \"Found \" << nbReferencePoints << \" points in reference image and \" << nbSecondaryPoints << \" points in secondary image\" << std::endl;\n\n auto matches = matcher->GetOutput();\n const size_t nb_matches = matches->Size();\n\n size_t good_matches = 0;\n const double threshold_for_good_match = 0.5; \/\/ pixels\n\n \/\/ Count good and bad matches\n for (auto it = matches->Begin(); it != matches->End(); ++it)\n {\n const auto p1 = it.Get()->GetPoint1();\n const auto p2 = it.Get()->GetPoint2();\n\n const auto p2_mapped = transform->TransformPoint(p2);\n\n \/\/ Check that matches are good up to 0.1 pixel\n if ((p1[0] - p2_mapped[0]) * (p1[0] - p2_mapped[0]) + (p1[1] - p2_mapped[1]) * (p1[1] - p2_mapped[1]) <=\n threshold_for_good_match * threshold_for_good_match)\n ++good_matches;\n }\n\n \/\/ Performances metrics\n const float reference_match_rate = nb_matches \/ static_cast<float>(nbReferencePoints);\n const float secondary_match_rate = nb_matches \/ static_cast<float>(nbSecondaryPoints);\n const float good_match_rate = good_matches \/ static_cast<float>(nb_matches);\n\n\n std::cout << \"Found \" << nb_matches << \" matches with \" << good_matches << \" valid matches (tolerance of 0.5 pixels)\" << std::endl;\n\n \/\/ Quality gate\n bool current_test = reference_match_rate > match_rate_thresh;\n bool overall_status = current_test;\n std::cout << \"More than \" << 100 * match_rate_thresh << \"% of reference points have a match:\\t\" << printResult(current_test) << \" (\"\n << 100 * reference_match_rate << \"%)\" << std::endl;\n\n current_test = secondary_match_rate > match_rate_thresh;\n std::cout << \"More than \" << 100 * match_rate_thresh << \"% of secondary points have a match:\\t\" << printResult(current_test) << \" (\"\n << 100 * secondary_match_rate << \"%)\" << std::endl;\n overall_status = overall_status && current_test;\n\n current_test = good_match_rate > good_match_rate_thresh;\n std::cout << \"More than \" << good_match_rate_thresh * 100 << \"% of matches are good: \\t\" << printResult(current_test) << \" (\"\n << 100 * good_match_rate << \"% at 0.5 pixel accuracy)\"\n << \"\\n\";\n overall_status = overall_status && current_test;\n return overall_status;\n}\n\n\nint otbKeyPointsAlgorithmsTest(int argc, char* argv[])\n{\n if (argc != 2)\n {\n std::cerr << \"Usage: \" << argv[0] << \" infname\" << std::endl;\n return EXIT_FAILURE;\n }\n const char* infname = argv[1];\n\n \/\/ Generate reference and secondary image\n ImageType::Pointer reference, secondary;\n TransformType::Pointer transform;\n\n \/\/ Small rotation and scaling\n const double rotation = 2.5; \/\/ 5°\n const double scaling = 0.99;\n \n \/\/ First test matching filter alone\n std::cout<<\"Checking matching filter:\"<<std::endl;\n std::cout<<\"=========================\"<<std::endl;\n bool status = testMatchingFilter();\n \n std::tie(reference, secondary, transform) = generateImagePair(infname, rotation, scaling);\n\n std::cout << \"Secondary image generated by applying a rotation of \" << rotation << \" degrees and scaling of \" << scaling << \".\" << std::endl;\n\n \/\/ Test Surf filter\n std::cout << \"Checking Surf implementation:\" << std::endl;\n std::cout << \"=============================\" << std::endl;\n\n \/\/ Lambda to configure surf algorithm\n auto configureSurf = [](SurfFilterType* filter) {\n filter->SetOctavesNumber(4);\n filter->SetScalesNumber(8);\n };\n\n status = checkKeyPointsFilter<SurfFilterType>(reference, secondary, transform, configureSurf, 0.13, 0.64) && status;\n\n \/\/ Test Sift filter\n std::cout << \"Checking Sift implementation:\" << std::endl;\n std::cout << \"=============================\" << std::endl;\n\n \/\/ Lambda to configure sift algorithm\n auto configureSift = [](SiftFilterType* filter) {\n filter->SetOctavesNumber(4);\n filter->SetScalesNumber(8);\n filter->SetDoGThreshold(0.01);\n filter->SetEdgeThreshold(10.);\n };\n\n status = checkKeyPointsFilter<SiftFilterType>(reference, secondary, transform, configureSift, 0.44, 0.82) && status;\n\n#ifdef OTB_USE_SIFTFAST\n \/\/ Test SiftFast filter\n std::cout << \"Checking SiftFast implementation:\" << std::endl;\n std::cout << \"=================================\" << std::endl;\n\n \/\/ lambda to set specific filter parameter\n auto configureSiftFast = [](SiftFastFilterType* filter) { filter->SetScalesNumber(8); };\n\n status = checkKeyPointsFilter<SiftFastFilterType>(reference, secondary, transform, configureSiftFast, 0.73, 0.95) && status;\n#endif\n\n return status ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2020 The Orbit Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"TopDownWidget.h\"\n\n#include <QColor>\n#include <QMenu>\n\n#include \"App.h\"\n#include \"FunctionsDataView.h\"\n#include \"TopDownViewItemModel.h\"\n\nusing orbit_client_protos::FunctionInfo;\n\nvoid TopDownWidget::SetTopDownView(std::unique_ptr<TopDownView> top_down_view) {\n CHECK(app_ != nullptr);\n\n model_ = std::make_unique<TopDownViewItemModel>(std::move(top_down_view));\n search_proxy_model_ = std::make_unique<HighlightCustomFilterSortFilterProxyModel>(nullptr);\n search_proxy_model_->setSourceModel(model_.get());\n search_proxy_model_->setSortRole(Qt::EditRole);\n\n hooked_proxy_model_ = std::make_unique<HookedIdentityProxyModel>(app_, nullptr);\n hooked_proxy_model_->setSourceModel(search_proxy_model_.get());\n\n ui_->topDownTreeView->setModel(hooked_proxy_model_.get());\n ui_->topDownTreeView->sortByColumn(TopDownViewItemModel::kInclusive, Qt::DescendingOrder);\n ui_->topDownTreeView->header()->resizeSections(QHeaderView::ResizeToContents);\n\n onSearchLineEditTextEdited(ui_->searchLineEdit->text());\n}\n\nstatic void CopyFromIndices(OrbitApp* app, const QModelIndexList& indices) {\n std::string clipboard;\n std::optional<QModelIndex> prev_index;\n \/\/ Note: indices are sorted by row in order of selection and then by column in ascending order.\n for (const QModelIndex& index : indices) {\n if (prev_index.has_value()) {\n \/\/ row() is the position among siblings: also compare parent().\n if (index.row() != prev_index->row() || index.parent() != prev_index->parent()) {\n clipboard += \"\\n\";\n } else {\n clipboard += \", \";\n }\n }\n clipboard += index.data().toString().toStdString();\n prev_index = index;\n }\n app->SetClipboard(clipboard);\n}\n\nvoid TopDownWidget::onCopyKeySequencePressed() {\n CopyFromIndices(app_, ui_->topDownTreeView->selectionModel()->selectedIndexes());\n}\n\nconst QString TopDownWidget::kActionExpandRecursively = QStringLiteral(\"&Expand recursively\");\nconst QString TopDownWidget::kActionCollapseRecursively = QStringLiteral(\"&Collapse recursively\");\nconst QString TopDownWidget::kActionCollapseChildrenRecursively =\n QStringLiteral(\"Collapse children recursively\");\nconst QString TopDownWidget::kActionExpandAll = QStringLiteral(\"Expand all\");\nconst QString TopDownWidget::kActionCollapseAll = QStringLiteral(\"Collapse all\");\nconst QString TopDownWidget::kActionLoadSymbols = QStringLiteral(\"&Load Symbols\");\nconst QString TopDownWidget::kActionSelect = QStringLiteral(\"&Hook\");\nconst QString TopDownWidget::kActionDeselect = QStringLiteral(\"&Unhook\");\nconst QString TopDownWidget::kActionDisassembly = QStringLiteral(\"Go to &Disassembly\");\nconst QString TopDownWidget::kActionCopySelection = QStringLiteral(\"Copy Selection\");\n\nstatic void ExpandRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n ExpandRecursively(tree_view, child);\n }\n if (!tree_view->isExpanded(index)) {\n tree_view->expand(index);\n }\n}\n\nstatic void CollapseRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n CollapseRecursively(tree_view, child);\n }\n if (tree_view->isExpanded(index)) {\n tree_view->collapse(index);\n }\n}\n\nstatic void CollapseChildrenRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n CollapseRecursively(tree_view, child);\n }\n}\n\nstatic std::vector<std::shared_ptr<Module>> GetModulesFromIndices(\n OrbitApp* app, const std::vector<QModelIndex>& indices) {\n const std::shared_ptr<Process>& process = app->GetCaptureData().process();\n CHECK(process != nullptr);\n\n std::set<std::string> unique_module_paths;\n for (const auto& index : indices) {\n std::string module_path =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kModule, index.parent())\n .data(TopDownViewItemModel::kModulePathRole)\n .toString()\n .toStdString();\n unique_module_paths.insert(module_path);\n }\n\n std::vector<std::shared_ptr<Module>> modules;\n for (const std::string& module_path : unique_module_paths) {\n std::shared_ptr<Module> module = process->GetModuleFromPath(module_path);\n if (module != nullptr) {\n modules.emplace_back(std::move(module));\n }\n }\n return modules;\n}\n\nstatic std::vector<FunctionInfo*> GetFunctionsFromIndices(OrbitApp* app,\n const std::vector<QModelIndex>& indices) {\n const std::shared_ptr<Process>& process = app->GetCaptureData().process();\n CHECK(process != nullptr);\n\n absl::flat_hash_set<FunctionInfo*> functions_set;\n for (const auto& index : indices) {\n uint64_t absolute_address =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kFunctionAddress, index.parent())\n .data(Qt::EditRole)\n .toLongLong();\n FunctionInfo* function = process->GetFunctionFromAddress(absolute_address);\n if (function != nullptr) {\n functions_set.insert(function);\n }\n }\n return std::vector<FunctionInfo*>(functions_set.begin(), functions_set.end());\n}\n\nvoid TopDownWidget::onCustomContextMenuRequested(const QPoint& point) {\n QModelIndex index = ui_->topDownTreeView->indexAt(point);\n if (!index.isValid()) {\n return;\n }\n\n std::vector<QModelIndex> selected_tree_indices;\n for (const QModelIndex& selected_index :\n ui_->topDownTreeView->selectionModel()->selectedIndexes()) {\n if (selected_index.column() != TopDownViewItemModel::kThreadOrFunction) {\n continue;\n }\n selected_tree_indices.push_back(selected_index);\n }\n\n bool enable_expand_recursively = false;\n bool enable_collapse_recursively = false;\n for (const QModelIndex& selected_index : selected_tree_indices) {\n if (selected_index.model()->rowCount(selected_index) > 0) {\n \/\/ As long as at least one of the selected nodes has children, always show\n \/\/ \"Expand recursively\", as even if the selected node is expanded there\n \/\/ could be subtrees not expanded. But only show \"Collapse recursively\"\n \/\/ and \"Collapse children recursively\" when at least one selected node is\n \/\/ expanded, as it would otherwise be unintuitive to collapse subtrees\n \/\/ none of which is visible.\n enable_expand_recursively = true;\n if (ui_->topDownTreeView->isExpanded(selected_index)) {\n enable_collapse_recursively = true;\n }\n }\n }\n\n std::vector<std::shared_ptr<Module>> modules_to_load;\n for (const auto& module : GetModulesFromIndices(app_, selected_tree_indices)) {\n if (!module->IsLoaded()) {\n modules_to_load.push_back(module);\n }\n }\n bool enable_load = !modules_to_load.empty();\n\n std::vector<FunctionInfo*> functions = GetFunctionsFromIndices(app_, selected_tree_indices);\n bool enable_select = false;\n bool enable_deselect = false;\n for (FunctionInfo* function : functions) {\n enable_select |= !app_->IsFunctionSelected(*function);\n enable_deselect |= app_->IsFunctionSelected(*function);\n }\n\n bool enable_disassembly = !functions.empty();\n\n bool enable_copy = ui_->topDownTreeView->selectionModel()->hasSelection();\n\n QMenu menu{ui_->topDownTreeView};\n if (enable_expand_recursively) {\n menu.addAction(kActionExpandRecursively);\n }\n if (enable_collapse_recursively) {\n menu.addAction(kActionCollapseRecursively);\n menu.addAction(kActionCollapseChildrenRecursively);\n }\n menu.addSeparator();\n menu.addAction(kActionExpandAll);\n menu.addAction(kActionCollapseAll);\n menu.addSeparator();\n if (enable_load) {\n menu.addAction(kActionLoadSymbols);\n }\n if (enable_select) {\n menu.addAction(kActionSelect);\n }\n if (enable_deselect) {\n menu.addAction(kActionDeselect);\n }\n if (enable_disassembly) {\n menu.addAction(kActionDisassembly);\n }\n menu.addSeparator();\n if (enable_copy) {\n menu.addAction(kActionCopySelection);\n }\n\n QAction* action = menu.exec(ui_->topDownTreeView->mapToGlobal(point));\n if (action == nullptr) {\n return;\n }\n\n if (action->text() == kActionExpandRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n ExpandRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionCollapseRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n CollapseRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionCollapseChildrenRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n CollapseChildrenRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionExpandAll) {\n ui_->topDownTreeView->expandAll();\n } else if (action->text() == kActionCollapseAll) {\n ui_->topDownTreeView->collapseAll();\n } else if (action->text() == kActionLoadSymbols) {\n app_->LoadModules(app_->GetCaptureData().process(), modules_to_load);\n } else if (action->text() == kActionSelect) {\n for (FunctionInfo* function : functions) {\n app_->SelectFunction(*function);\n }\n } else if (action->text() == kActionDeselect) {\n for (FunctionInfo* function : functions) {\n app_->DeselectFunction(*function);\n }\n } else if (action->text() == kActionDisassembly) {\n for (FunctionInfo* function : functions) {\n app_->Disassemble(app_->GetCaptureData().process_id(), *function);\n }\n } else if (action->text() == kActionCopySelection) {\n CopyFromIndices(app_, ui_->topDownTreeView->selectionModel()->selectedIndexes());\n }\n}\n\nstatic bool ExpandCollapseRecursivelyBasedOnDescendantsRole(QTreeView* tree_view,\n const QModelIndex& index, int role) {\n if (!index.isValid()) {\n return false;\n }\n bool matches = index.data(role).toBool();\n bool descendant_matches = false;\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n descendant_matches |= ExpandCollapseRecursivelyBasedOnDescendantsRole(tree_view, child, role);\n }\n if (descendant_matches && !tree_view->isExpanded(index)) {\n tree_view->expand(index);\n } else if (!descendant_matches && tree_view->isExpanded(index)) {\n tree_view->collapse(index);\n }\n return matches || descendant_matches;\n}\n\nstatic void ExpandCollapseBasedOnRole(QTreeView* tree_view, int role) {\n for (int i = 0; i < tree_view->model()->rowCount(); ++i) {\n const QModelIndex& child = tree_view->model()->index(i, 0);\n ExpandCollapseRecursivelyBasedOnDescendantsRole(tree_view, child, role);\n }\n}\n\nvoid TopDownWidget::onSearchLineEditTextEdited(const QString& text) {\n if (search_proxy_model_ == nullptr) {\n return;\n }\n search_proxy_model_->SetFilter(text.toStdString());\n ui_->topDownTreeView->viewport()->update();\n if (!text.isEmpty()) {\n ExpandCollapseBasedOnRole(\n ui_->topDownTreeView,\n TopDownWidget::HighlightCustomFilterSortFilterProxyModel::kMatchesCustomFilterRole);\n }\n}\n\nQVariant TopDownWidget::HighlightCustomFilterSortFilterProxyModel::data(const QModelIndex& index,\n int role) const {\n if (role == Qt::ForegroundRole) {\n if (!lowercase_filter_tokens_.empty() && ItemMatchesFilter(index)) {\n return QColor{Qt::green};\n }\n } else if (role == kMatchesCustomFilterRole) {\n return ItemMatchesFilter(index);\n }\n return QSortFilterProxyModel::data(index, role);\n}\n\nbool TopDownWidget::HighlightCustomFilterSortFilterProxyModel::ItemMatchesFilter(\n const QModelIndex& index) const {\n std::string haystack = absl::AsciiStrToLower(\n index.model()\n ->index(index.row(), TopDownViewItemModel::kThreadOrFunction, index.parent())\n .data()\n .toString()\n .toStdString());\n for (const std::string& token : lowercase_filter_tokens_) {\n if (!absl::StrContains(haystack, token)) {\n return false;\n }\n }\n return true;\n}\n\nQVariant TopDownWidget::HookedIdentityProxyModel::data(const QModelIndex& index, int role) const {\n QVariant data = QIdentityProxyModel::data(index, role);\n if ((role != Qt::DisplayRole && role != Qt::ToolTipRole) ||\n index.column() != TopDownViewItemModel::kThreadOrFunction) {\n return data;\n }\n\n bool is_ulonglong = false;\n uint64_t function_address =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kFunctionAddress, index.parent())\n .data(Qt::EditRole)\n .toULongLong(&is_ulonglong);\n if (!is_ulonglong) {\n \/\/ This is the case for a thread node, where \"Function address\" is empty.\n return data;\n }\n\n if (!app_->IsFunctionSelected(function_address)) {\n return data;\n }\n\n if (role == Qt::ToolTipRole) {\n static const QString kTooltipHookedPrefix = QStringLiteral(\"[HOOKED] \");\n return kTooltipHookedPrefix + data.toString();\n }\n static const QString kDisplayHookedPrefix =\n QStringLiteral(\"[\") + QString::fromStdString(FunctionsDataView::kSelectedFunctionString) +\n QStringLiteral(\"] \");\n return kDisplayHookedPrefix + data.toString();\n}\n<commit_msg>Change TopDownWidget.cpp\/CopyFromIndices to BuildStringFromIndices<commit_after>\/\/ Copyright (c) 2020 The Orbit Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"TopDownWidget.h\"\n\n#include <QColor>\n#include <QMenu>\n\n#include \"App.h\"\n#include \"FunctionsDataView.h\"\n#include \"TopDownViewItemModel.h\"\n\nusing orbit_client_protos::FunctionInfo;\n\nvoid TopDownWidget::SetTopDownView(std::unique_ptr<TopDownView> top_down_view) {\n CHECK(app_ != nullptr);\n\n model_ = std::make_unique<TopDownViewItemModel>(std::move(top_down_view));\n search_proxy_model_ = std::make_unique<HighlightCustomFilterSortFilterProxyModel>(nullptr);\n search_proxy_model_->setSourceModel(model_.get());\n search_proxy_model_->setSortRole(Qt::EditRole);\n\n hooked_proxy_model_ = std::make_unique<HookedIdentityProxyModel>(app_, nullptr);\n hooked_proxy_model_->setSourceModel(search_proxy_model_.get());\n\n ui_->topDownTreeView->setModel(hooked_proxy_model_.get());\n ui_->topDownTreeView->sortByColumn(TopDownViewItemModel::kInclusive, Qt::DescendingOrder);\n ui_->topDownTreeView->header()->resizeSections(QHeaderView::ResizeToContents);\n\n onSearchLineEditTextEdited(ui_->searchLineEdit->text());\n}\n\nstatic std::string BuildStringFromIndices(const QModelIndexList& indices) {\n std::string buffer;\n std::optional<QModelIndex> prev_index;\n \/\/ Note: indices are sorted by row in order of selection and then by column in ascending order.\n for (const QModelIndex& index : indices) {\n if (prev_index.has_value()) {\n \/\/ row() is the position among siblings: also compare parent().\n if (index.row() != prev_index->row() || index.parent() != prev_index->parent()) {\n buffer += \"\\n\";\n } else {\n buffer += \", \";\n }\n }\n buffer += index.data().toString().toStdString();\n prev_index = index;\n }\n return buffer;\n}\n\nvoid TopDownWidget::onCopyKeySequencePressed() {\n app_->SetClipboard(\n BuildStringFromIndices(ui_->topDownTreeView->selectionModel()->selectedIndexes()));\n}\n\nconst QString TopDownWidget::kActionExpandRecursively = QStringLiteral(\"&Expand recursively\");\nconst QString TopDownWidget::kActionCollapseRecursively = QStringLiteral(\"&Collapse recursively\");\nconst QString TopDownWidget::kActionCollapseChildrenRecursively =\n QStringLiteral(\"Collapse children recursively\");\nconst QString TopDownWidget::kActionExpandAll = QStringLiteral(\"Expand all\");\nconst QString TopDownWidget::kActionCollapseAll = QStringLiteral(\"Collapse all\");\nconst QString TopDownWidget::kActionLoadSymbols = QStringLiteral(\"&Load Symbols\");\nconst QString TopDownWidget::kActionSelect = QStringLiteral(\"&Hook\");\nconst QString TopDownWidget::kActionDeselect = QStringLiteral(\"&Unhook\");\nconst QString TopDownWidget::kActionDisassembly = QStringLiteral(\"Go to &Disassembly\");\nconst QString TopDownWidget::kActionCopySelection = QStringLiteral(\"Copy Selection\");\n\nstatic void ExpandRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n ExpandRecursively(tree_view, child);\n }\n if (!tree_view->isExpanded(index)) {\n tree_view->expand(index);\n }\n}\n\nstatic void CollapseRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n CollapseRecursively(tree_view, child);\n }\n if (tree_view->isExpanded(index)) {\n tree_view->collapse(index);\n }\n}\n\nstatic void CollapseChildrenRecursively(QTreeView* tree_view, const QModelIndex& index) {\n if (!index.isValid()) {\n return;\n }\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n CollapseRecursively(tree_view, child);\n }\n}\n\nstatic std::vector<std::shared_ptr<Module>> GetModulesFromIndices(\n OrbitApp* app, const std::vector<QModelIndex>& indices) {\n const std::shared_ptr<Process>& process = app->GetCaptureData().process();\n CHECK(process != nullptr);\n\n std::set<std::string> unique_module_paths;\n for (const auto& index : indices) {\n std::string module_path =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kModule, index.parent())\n .data(TopDownViewItemModel::kModulePathRole)\n .toString()\n .toStdString();\n unique_module_paths.insert(module_path);\n }\n\n std::vector<std::shared_ptr<Module>> modules;\n for (const std::string& module_path : unique_module_paths) {\n std::shared_ptr<Module> module = process->GetModuleFromPath(module_path);\n if (module != nullptr) {\n modules.emplace_back(std::move(module));\n }\n }\n return modules;\n}\n\nstatic std::vector<FunctionInfo*> GetFunctionsFromIndices(OrbitApp* app,\n const std::vector<QModelIndex>& indices) {\n const std::shared_ptr<Process>& process = app->GetCaptureData().process();\n CHECK(process != nullptr);\n\n absl::flat_hash_set<FunctionInfo*> functions_set;\n for (const auto& index : indices) {\n uint64_t absolute_address =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kFunctionAddress, index.parent())\n .data(Qt::EditRole)\n .toLongLong();\n FunctionInfo* function = process->GetFunctionFromAddress(absolute_address);\n if (function != nullptr) {\n functions_set.insert(function);\n }\n }\n return std::vector<FunctionInfo*>(functions_set.begin(), functions_set.end());\n}\n\nvoid TopDownWidget::onCustomContextMenuRequested(const QPoint& point) {\n QModelIndex index = ui_->topDownTreeView->indexAt(point);\n if (!index.isValid()) {\n return;\n }\n\n std::vector<QModelIndex> selected_tree_indices;\n for (const QModelIndex& selected_index :\n ui_->topDownTreeView->selectionModel()->selectedIndexes()) {\n if (selected_index.column() != TopDownViewItemModel::kThreadOrFunction) {\n continue;\n }\n selected_tree_indices.push_back(selected_index);\n }\n\n bool enable_expand_recursively = false;\n bool enable_collapse_recursively = false;\n for (const QModelIndex& selected_index : selected_tree_indices) {\n if (selected_index.model()->rowCount(selected_index) > 0) {\n \/\/ As long as at least one of the selected nodes has children, always show\n \/\/ \"Expand recursively\", as even if the selected node is expanded there\n \/\/ could be subtrees not expanded. But only show \"Collapse recursively\"\n \/\/ and \"Collapse children recursively\" when at least one selected node is\n \/\/ expanded, as it would otherwise be unintuitive to collapse subtrees\n \/\/ none of which is visible.\n enable_expand_recursively = true;\n if (ui_->topDownTreeView->isExpanded(selected_index)) {\n enable_collapse_recursively = true;\n }\n }\n }\n\n std::vector<std::shared_ptr<Module>> modules_to_load;\n for (const auto& module : GetModulesFromIndices(app_, selected_tree_indices)) {\n if (!module->IsLoaded()) {\n modules_to_load.push_back(module);\n }\n }\n bool enable_load = !modules_to_load.empty();\n\n std::vector<FunctionInfo*> functions = GetFunctionsFromIndices(app_, selected_tree_indices);\n bool enable_select = false;\n bool enable_deselect = false;\n for (FunctionInfo* function : functions) {\n enable_select |= !app_->IsFunctionSelected(*function);\n enable_deselect |= app_->IsFunctionSelected(*function);\n }\n\n bool enable_disassembly = !functions.empty();\n\n bool enable_copy = ui_->topDownTreeView->selectionModel()->hasSelection();\n\n QMenu menu{ui_->topDownTreeView};\n if (enable_expand_recursively) {\n menu.addAction(kActionExpandRecursively);\n }\n if (enable_collapse_recursively) {\n menu.addAction(kActionCollapseRecursively);\n menu.addAction(kActionCollapseChildrenRecursively);\n }\n menu.addSeparator();\n menu.addAction(kActionExpandAll);\n menu.addAction(kActionCollapseAll);\n menu.addSeparator();\n if (enable_load) {\n menu.addAction(kActionLoadSymbols);\n }\n if (enable_select) {\n menu.addAction(kActionSelect);\n }\n if (enable_deselect) {\n menu.addAction(kActionDeselect);\n }\n if (enable_disassembly) {\n menu.addAction(kActionDisassembly);\n }\n menu.addSeparator();\n if (enable_copy) {\n menu.addAction(kActionCopySelection);\n }\n\n QAction* action = menu.exec(ui_->topDownTreeView->mapToGlobal(point));\n if (action == nullptr) {\n return;\n }\n\n if (action->text() == kActionExpandRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n ExpandRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionCollapseRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n CollapseRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionCollapseChildrenRecursively) {\n for (const QModelIndex& selected_index : selected_tree_indices) {\n CollapseChildrenRecursively(ui_->topDownTreeView, selected_index);\n }\n } else if (action->text() == kActionExpandAll) {\n ui_->topDownTreeView->expandAll();\n } else if (action->text() == kActionCollapseAll) {\n ui_->topDownTreeView->collapseAll();\n } else if (action->text() == kActionLoadSymbols) {\n app_->LoadModules(app_->GetCaptureData().process(), modules_to_load);\n } else if (action->text() == kActionSelect) {\n for (FunctionInfo* function : functions) {\n app_->SelectFunction(*function);\n }\n } else if (action->text() == kActionDeselect) {\n for (FunctionInfo* function : functions) {\n app_->DeselectFunction(*function);\n }\n } else if (action->text() == kActionDisassembly) {\n for (FunctionInfo* function : functions) {\n app_->Disassemble(app_->GetCaptureData().process_id(), *function);\n }\n } else if (action->text() == kActionCopySelection) {\n app_->SetClipboard(\n BuildStringFromIndices(ui_->topDownTreeView->selectionModel()->selectedIndexes()));\n }\n}\n\nstatic bool ExpandCollapseRecursivelyBasedOnDescendantsRole(QTreeView* tree_view,\n const QModelIndex& index, int role) {\n if (!index.isValid()) {\n return false;\n }\n bool matches = index.data(role).toBool();\n bool descendant_matches = false;\n for (int i = 0; i < index.model()->rowCount(index); ++i) {\n const QModelIndex& child = index.child(i, 0);\n descendant_matches |= ExpandCollapseRecursivelyBasedOnDescendantsRole(tree_view, child, role);\n }\n if (descendant_matches && !tree_view->isExpanded(index)) {\n tree_view->expand(index);\n } else if (!descendant_matches && tree_view->isExpanded(index)) {\n tree_view->collapse(index);\n }\n return matches || descendant_matches;\n}\n\nstatic void ExpandCollapseBasedOnRole(QTreeView* tree_view, int role) {\n for (int i = 0; i < tree_view->model()->rowCount(); ++i) {\n const QModelIndex& child = tree_view->model()->index(i, 0);\n ExpandCollapseRecursivelyBasedOnDescendantsRole(tree_view, child, role);\n }\n}\n\nvoid TopDownWidget::onSearchLineEditTextEdited(const QString& text) {\n if (search_proxy_model_ == nullptr) {\n return;\n }\n search_proxy_model_->SetFilter(text.toStdString());\n ui_->topDownTreeView->viewport()->update();\n if (!text.isEmpty()) {\n ExpandCollapseBasedOnRole(\n ui_->topDownTreeView,\n TopDownWidget::HighlightCustomFilterSortFilterProxyModel::kMatchesCustomFilterRole);\n }\n}\n\nQVariant TopDownWidget::HighlightCustomFilterSortFilterProxyModel::data(const QModelIndex& index,\n int role) const {\n if (role == Qt::ForegroundRole) {\n if (!lowercase_filter_tokens_.empty() && ItemMatchesFilter(index)) {\n return QColor{Qt::green};\n }\n } else if (role == kMatchesCustomFilterRole) {\n return ItemMatchesFilter(index);\n }\n return QSortFilterProxyModel::data(index, role);\n}\n\nbool TopDownWidget::HighlightCustomFilterSortFilterProxyModel::ItemMatchesFilter(\n const QModelIndex& index) const {\n std::string haystack = absl::AsciiStrToLower(\n index.model()\n ->index(index.row(), TopDownViewItemModel::kThreadOrFunction, index.parent())\n .data()\n .toString()\n .toStdString());\n for (const std::string& token : lowercase_filter_tokens_) {\n if (!absl::StrContains(haystack, token)) {\n return false;\n }\n }\n return true;\n}\n\nQVariant TopDownWidget::HookedIdentityProxyModel::data(const QModelIndex& index, int role) const {\n QVariant data = QIdentityProxyModel::data(index, role);\n if ((role != Qt::DisplayRole && role != Qt::ToolTipRole) ||\n index.column() != TopDownViewItemModel::kThreadOrFunction) {\n return data;\n }\n\n bool is_ulonglong = false;\n uint64_t function_address =\n index.model()\n ->index(index.row(), TopDownViewItemModel::kFunctionAddress, index.parent())\n .data(Qt::EditRole)\n .toULongLong(&is_ulonglong);\n if (!is_ulonglong) {\n \/\/ This is the case for a thread node, where \"Function address\" is empty.\n return data;\n }\n\n if (!app_->IsFunctionSelected(function_address)) {\n return data;\n }\n\n if (role == Qt::ToolTipRole) {\n static const QString kTooltipHookedPrefix = QStringLiteral(\"[HOOKED] \");\n return kTooltipHookedPrefix + data.toString();\n }\n static const QString kDisplayHookedPrefix =\n QStringLiteral(\"[\") + QString::fromStdString(FunctionsDataView::kSelectedFunctionString) +\n QStringLiteral(\"] \");\n return kDisplayHookedPrefix + data.toString();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include \"texture.h\"\n#include <cstring>\nnamespace game { namespace gfx { namespace gl\n{\n void GL_Texture::allocate_(Vec<int> const& extents,\n Image_Format form) noexcept\n {\n glGenTextures(1, &tex_id);\n\n \/\/ TODO: Figure something out, this is unexpected.\n glActiveTexture(GL_TEXTURE0);\n\n texture_type = GL_TEXTURE_2D;\n \/\/if(extents.x != extents.y) texture_type = GL_TEXTURE_RECTANGLE;\n\n glBindTexture(texture_type, tex_id);\n\n if(form == Image_Format::Rgba)\n {\n glTexImage2D(texture_type, 0, GL_RGBA, extents.x, extents.y, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, NULL);\n }\n else if(form == Image_Format::Depth)\n {\n glTexImage2D(texture_type, 0, GL_DEPTH_COMPONENT, extents.x, extents.y,\n 0, GL_RGBA, GL_FLOAT, NULL);\n }\n switch(form)\n {\n case Image_Format::Rgba:\n \/\/ We don't care about the format, type, and data yet.\n glTexImage2D(texture_type, 0, GL_RGBA, extents.x, extents.y, 0,\n GL_RGBA, GL_FLOAT, NULL);\n break;\n case Image_Format::Depth:\n glTexImage2D(texture_type, 0, GL_DEPTH_COMPONENT, extents.x, extents.y,\n 0, GL_DEPTH_COMPONENT, GL_FLOAT, NULL);\n break;\n }\n\n glTexParameteri(texture_type, GL_TEXTURE_MIN_FILTER,\n GL_NEAREST_MIPMAP_NEAREST);\n glTexParameteri(texture_type, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n \/\/ These are actually set to their respective values by default anyway, but\n \/\/ this is more clear.\n glTexParameteri(texture_type, GL_TEXTURE_BASE_LEVEL, 0);\n glTexParameteri(texture_type, GL_TEXTURE_MAX_LEVEL, 5);\n\n glTexParameteri(texture_type, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n glTexParameteri(texture_type, GL_TEXTURE_WRAP_R, GL_CLAMP_TO_BORDER);\n\n \/\/ Save the format for later.\n format_ = form;\n }\n void GL_Texture::blit_data_(Volume<int> const& vol, Data_Type type,\n void const* in_data) noexcept\n {\n \/\/ Bail out if the volume isn't valid, we want to avoid the\n \/\/ GL_INVALID_OPERATION if we can.\n if(vol.width == 0 || vol.height == 0) return;\n\n std::size_t type_size;\n GLenum data_type;\n\n switch(type)\n {\n case Data_Type::Float:\n type_size = sizeof(float);\n data_type = GL_FLOAT;\n break;\n case Data_Type::Integer:\n type_size = sizeof(uint8_t);\n data_type = GL_UNSIGNED_BYTE;\n break;\n }\n\n \/\/ Row size in bytes\n std::size_t row_size;\n GLenum data_format;\n\n switch(format_)\n {\n case Image_Format::Rgba:\n row_size = type_size * 4 * vol.width;\n data_format = GL_RGBA;\n break;\n case Image_Format::Depth:\n row_size = type_size * vol.width;\n data_format = GL_DEPTH_COMPONENT;\n break;\n }\n\n \/\/ Allocate our data\n uint8_t* out_data = new uint8_t[row_size * vol.height];\n\n \/\/ Go backwards by row.\n for(int i = 0; i < vol.height; ++i)\n {\n \/\/ dest: output data starting from first row\n \/\/ src: input data starting from the bottom row\n \/\/ size: row_size\n std::memcpy(out_data + i * row_size,\n (uint8_t*) in_data + row_size*vol.height - i*row_size - 1,\n row_size);\n }\n\n \/\/ We have a good array of data, where each successive row is going from\n \/\/ bottom to top, but we need to figure out our sub-region on the opengl\n \/\/ texture.\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(texture_type, tex_id);\n glTexSubImage2D(texture_type, 0, vol.pos.x,\n allocated_extents().y - vol.pos.y - vol.height,\n vol.width, vol.height, data_format, data_type, &out_data[0]);\n glGenerateMipmap(texture_type);\n\n delete[] out_data;\n }\n\n void GL_Texture::bind(unsigned int loc) const noexcept\n {\n glActiveTexture(GL_TEXTURE0 + loc);\n glBindTexture(texture_type, tex_id);\n }\n} } }\n<commit_msg>Fix blit bug in gl\/texture implementation<commit_after>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include \"texture.h\"\n#include <cstring>\nnamespace game { namespace gfx { namespace gl\n{\n void GL_Texture::allocate_(Vec<int> const& extents,\n Image_Format form) noexcept\n {\n glGenTextures(1, &tex_id);\n\n \/\/ TODO: Figure something out, this is unexpected.\n glActiveTexture(GL_TEXTURE0);\n\n texture_type = GL_TEXTURE_2D;\n \/\/if(extents.x != extents.y) texture_type = GL_TEXTURE_RECTANGLE;\n\n glBindTexture(texture_type, tex_id);\n\n if(form == Image_Format::Rgba)\n {\n glTexImage2D(texture_type, 0, GL_RGBA, extents.x, extents.y, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, NULL);\n }\n else if(form == Image_Format::Depth)\n {\n glTexImage2D(texture_type, 0, GL_DEPTH_COMPONENT, extents.x, extents.y,\n 0, GL_RGBA, GL_FLOAT, NULL);\n }\n switch(form)\n {\n case Image_Format::Rgba:\n \/\/ We don't care about the format, type, and data yet.\n glTexImage2D(texture_type, 0, GL_RGBA, extents.x, extents.y, 0,\n GL_RGBA, GL_FLOAT, NULL);\n break;\n case Image_Format::Depth:\n glTexImage2D(texture_type, 0, GL_DEPTH_COMPONENT, extents.x, extents.y,\n 0, GL_DEPTH_COMPONENT, GL_FLOAT, NULL);\n break;\n }\n\n glTexParameteri(texture_type, GL_TEXTURE_MIN_FILTER,\n GL_NEAREST_MIPMAP_NEAREST);\n glTexParameteri(texture_type, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n \/\/ These are actually set to their respective values by default anyway, but\n \/\/ this is more clear.\n glTexParameteri(texture_type, GL_TEXTURE_BASE_LEVEL, 0);\n glTexParameteri(texture_type, GL_TEXTURE_MAX_LEVEL, 5);\n\n glTexParameteri(texture_type, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n glTexParameteri(texture_type, GL_TEXTURE_WRAP_R, GL_CLAMP_TO_BORDER);\n\n \/\/ Save the format for later.\n format_ = form;\n }\n void GL_Texture::blit_data_(Volume<int> const& vol, Data_Type type,\n void const* in_data) noexcept\n {\n \/\/ Bail out if the volume isn't valid, we want to avoid the\n \/\/ GL_INVALID_OPERATION if we can.\n if(vol.width == 0 || vol.height == 0) return;\n\n std::size_t type_size;\n GLenum data_type;\n\n switch(type)\n {\n case Data_Type::Float:\n type_size = sizeof(float);\n data_type = GL_FLOAT;\n break;\n case Data_Type::Integer:\n type_size = sizeof(uint8_t);\n data_type = GL_UNSIGNED_BYTE;\n break;\n }\n\n \/\/ Row size in bytes\n std::size_t row_size;\n GLenum data_format;\n\n switch(format_)\n {\n case Image_Format::Rgba:\n row_size = type_size * 4 * vol.width;\n data_format = GL_RGBA;\n break;\n case Image_Format::Depth:\n row_size = type_size * vol.width;\n data_format = GL_DEPTH_COMPONENT;\n break;\n }\n\n \/\/ Allocate our data\n uint8_t* out_data = new uint8_t[row_size * vol.height];\n\n \/\/ Go backwards by row.\n for(int i = 0; i < vol.height; ++i)\n {\n \/\/ dest: output data starting from first row\n \/\/ src: input data starting from the bottom row\n \/\/ size: row_size\n std::memcpy(out_data + i * row_size,\n (uint8_t*) in_data + row_size*vol.height - (i+1)*row_size,\n row_size);\n }\n\n \/\/ We have a good array of data, where each successive row is going from\n \/\/ bottom to top, but we need to figure out our sub-region on the opengl\n \/\/ texture.\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(texture_type, tex_id);\n glTexSubImage2D(texture_type, 0, vol.pos.x,\n allocated_extents().y - vol.pos.y - vol.height,\n vol.width, vol.height, data_format, data_type, &out_data[0]);\n glGenerateMipmap(texture_type);\n\n delete[] out_data;\n }\n\n void GL_Texture::bind(unsigned int loc) const noexcept\n {\n glActiveTexture(GL_TEXTURE0 + loc);\n glBindTexture(texture_type, tex_id);\n }\n} } }\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_STATIC_LINK\r\n\r\n#include <boost\/test\/unit_test.hpp>\r\n#include <boost\/integer.hpp>\r\n\r\n#include <limits>\r\n#include <string>\r\n\r\n#include \".\/..\/..\/fixed_point_lib\/src\/number.hpp\"\r\n#include \".\/..\/..\/fixed_point_lib\/src\/as_native_proxy.hpp\"\r\n\r\nnamespace core { namespace unit_tests {\r\n BOOST_AUTO_TEST_SUITE(as_native)\r\n\r\n \/\/\/ idea of test:\r\n \/\/\/ 1. we choose two fixed-number formats [t1, f1] and [t2, f2] those satisfy:\r\n \/\/\/ t1 = t2 and f1 >> f2\r\n \/\/\/ 2. we assign first format to variable A and second one to variable B\r\n \/\/\/ 3. B has such value that (B << (f1 - f2)) is out of t1 dynamic interval bounds\r\n \/\/\/ so, fixed-point alignment has to be failed during fixed-point numbers division\r\n BOOST_AUTO_TEST_CASE(bitCheck)\r\n {\r\n core::S_fixed_point<28, 20>::type a(-2.302);\r\n core::S_fixed_point<28, 2>::type b(1000123);\r\n core::S_fixed_point<38, 4>::type c(10123);\r\n\r\n core::as_native(a) += (1u << 20);\r\n double const value = static_cast<double>(a);\r\n as_native(b) \/= 23;\r\n }\r\n\r\n BOOST_AUTO_TEST_SUITE_END()\r\n}}\r\n<commit_msg>as_native_cases.cpp: unit-tests for as_native_proxy, finished<commit_after>#define BOOST_TEST_STATIC_LINK\r\n#define BOOST_TEST_MODULE FIXED_POINT_LIB_UNIT_TESTS\r\n\r\n#include <boost\/test\/unit_test.hpp>\r\n#include <boost\/integer.hpp>\r\n\r\n#include <limits>\r\n#include <string>\r\n\r\n#include \".\/fixed_point.hpp\"\r\n#include \".\/as_native_proxy.hpp\"\r\n\r\nnamespace core { namespace unit_tests {\r\n BOOST_AUTO_TEST_SUITE(as_native)\r\n\r\n BOOST_AUTO_TEST_CASE(as_native)\r\n { \r\n core::S_fixed_point<28, 20>::type a(-2.302);\r\n core::S_fixed_point<28, 2>::type b(1000123);\r\n core::S_fixed_point<38, 4>::type c(10123);\r\n\r\n core::as_native(a) += (1u << 20);\r\n core::as_native(b) \/= 29;\r\n BOOST_CHECK_MESSAGE(std::fabs(double(a) + 1.302) < 1E-4, \"as_native operator += has a bug\");\r\n BOOST_CHECK_MESSAGE(size_t(~core::as_native(b)) == 268297507, \"as_native operator ~ has a bug\");\r\n BOOST_CHECK_MESSAGE(size_t(double(b)) == 34487, \"as_native operator \/= has a bug\");\r\n\r\n long const x = core::as_native(a) + 23u;\r\n long const y = 23u + core::as_native(a); \r\n BOOST_CHECK_MESSAGE(x == -1365223 && y == -1365223, \"as_native operator + has a bug\");\r\n }\r\n\r\n BOOST_AUTO_TEST_SUITE_END()\r\n}}\r\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @copyright Copyright © 2014 by Marc Sibert\n * @author Marc Sibert\n * \n * This work is free. You can redistribute it and\/or modify it under the\n * terms of the Do What The Fuck You Want To Public License, Version 2,\n * as published by Sam Hocevar. See the COPYING file or http:\/\/www.wtfpl.net\/\n * for more details.\n *\/ \n \n#include \"spark-web-embd-rest-json\/HttpRequest.h\"\n#include <spark_wiring_usbserial.h>\n\nvoid HttpRequest::setURL(const char *const aURL) {\n strncpy(fURL, aURL, MAX_URL_LENGTH);\n}\n\n#ifdef USE_HEADERS\nvoid HttpRequest::setHeaderField(const char *const aField) {\n strncpy(fHeaderField, aField, MAX_HEADER_FIELD_LENGTH);\n}\n\nvoid HttpRequest::setHeaderValue(const char *const aValue) {\n\n char *const pH = static_cast<char *const>(malloc(strlen(fHeaderField) + 1)); \/\/ len + '\\0'\n memcpy(pH, fHeaderField, strlen(fHeaderField) + 1);\n\n char *const pV = static_cast<char *const>(malloc(strlen(aValue) + 1)); \/\/ len + '\\0'\n memcpy(pV, aValue, strlen(aValue) + 1);\n\n\/\/ fHeaders.insert(std::pair<char*, char*>(pH, pV));\n fHeaders[pH] = pV;\n}\n#endif\n\nHttpRequest::HttpRequest() {\n memset(&fSettings, 0, sizeof(fSettings)); \/\/ remplissage de 0s\n\/*\n fSettings.on_message_begin = onMessageBegin;\n fSettings.on_headers_complete = onHeadersComplete;\n fSettings.on_message_complete = onMessageComplete;\n*\/\n fSettings.on_url = onUrl;\n#ifdef USE_HEADERS\n fSettings.on_header_field = onHeaderField;\n fSettings.on_header_value = onHeaderValue;\n#endif\n http_parser_init(&fParser, HTTP_REQUEST);\n fParser.data = static_cast<void*>(this);\n}\n \nHttpRequest::~HttpRequest() {\n\/\/\/ @todo vider les fHdeaders pour éviter les fuites mémoire !!!\n}\n \nvoid HttpRequest::parse(const char aChar) {\n if (1 != http_parser_execute(&fParser, &fSettings, &aChar, 1)) {\n Serial.print(\"Error in http_parser_execute, line \");\n Serial.print(__LINE__ - 2);\n abort();\n }\n}\n \nconst char* HttpRequest::URL() const { \n return fURL; \n}\n \n#ifdef USE_HEADERS\nvoid HttpRequest::printHeaders() const {\n\/\/ for (std::map<const char*, char*, ltstr>::const_iterator it = fHeaders.begin(); it != fHeaders.end(); ++it) {\n for (auto it = fHeaders.begin(); it != fHeaders.end(); ++it) {\n Serial.print(it->first);\n Serial.print(\"=\");\n Serial.println(it->second);\n } \n}\n#endif\n\n\/*\nint HttpRequest::onMessageBegin(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ pHR->init();\n\/\/ Serial.println(\"***MESSAGE BEGIN***\");\n return 0;\n}\n\nint HttpRequest::onHeadersComplete(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ Serial.println(\"***HEADER COMPLETE***\");\n return 0;\n}\n\nint HttpRequest::onMessageComplete(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ Serial.println(\"***MESSAGE COMPLETE***\");\n return 0;\n}\n*\/\n\nint HttpRequest::onUrl(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_URL_LENGTH];\n\n if (len) {\n if (strlen(c) + len > MAX_URL_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setURL(c);\n c[0] = '\\0';\n return 0; \n}\n\n#ifdef USE_HEADERS\nint HttpRequest::onHeaderField(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_HEADER_FIELD_LENGTH];\n \n if (len) {\n if (strlen(c) + len > MAX_HEADER_FIELD_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setHeaderField(c);\n c[0] = '\\0';\n return 0; \n}\n\nint HttpRequest::onHeaderValue(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_HEADER_VALUE_LENGTH] = \"\";\n \n if (len) {\n if (strlen(c) + len > MAX_HEADER_VALUE_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setHeaderValue(c);\n c[0] = '\\0';\n return 0; \n}\n#endif\n<commit_msg>Update HttpRequest.cpp<commit_after>\/**\n * @file\n * @copyright Copyright © 2014 by Marc Sibert\n * @author Marc Sibert\n * \n * This work is free. You can redistribute it and\/or modify it under the\n * terms of the Do What The Fuck You Want To Public License, Version 2,\n * as published by Sam Hocevar. See the COPYING file or http:\/\/www.wtfpl.net\/\n * for more details.\n *\/ \n \n#include \"HttpRequest.h\"\n#include <spark_wiring_usbserial.h>\n\nvoid HttpRequest::setURL(const char *const aURL) {\n strncpy(fURL, aURL, MAX_URL_LENGTH);\n}\n\n#ifdef USE_HEADERS\nvoid HttpRequest::setHeaderField(const char *const aField) {\n strncpy(fHeaderField, aField, MAX_HEADER_FIELD_LENGTH);\n}\n\nvoid HttpRequest::setHeaderValue(const char *const aValue) {\n\n char *const pH = static_cast<char *const>(malloc(strlen(fHeaderField) + 1)); \/\/ len + '\\0'\n memcpy(pH, fHeaderField, strlen(fHeaderField) + 1);\n\n char *const pV = static_cast<char *const>(malloc(strlen(aValue) + 1)); \/\/ len + '\\0'\n memcpy(pV, aValue, strlen(aValue) + 1);\n\n\/\/ fHeaders.insert(std::pair<char*, char*>(pH, pV));\n fHeaders[pH] = pV;\n}\n#endif\n\nHttpRequest::HttpRequest() {\n memset(&fSettings, 0, sizeof(fSettings)); \/\/ remplissage de 0s\n\/*\n fSettings.on_message_begin = onMessageBegin;\n fSettings.on_headers_complete = onHeadersComplete;\n fSettings.on_message_complete = onMessageComplete;\n*\/\n fSettings.on_url = onUrl;\n#ifdef USE_HEADERS\n fSettings.on_header_field = onHeaderField;\n fSettings.on_header_value = onHeaderValue;\n#endif\n http_parser_init(&fParser, HTTP_REQUEST);\n fParser.data = static_cast<void*>(this);\n}\n \nHttpRequest::~HttpRequest() {\n\/\/\/ @todo vider les fHdeaders pour éviter les fuites mémoire !!!\n}\n \nvoid HttpRequest::parse(const char aChar) {\n if (1 != http_parser_execute(&fParser, &fSettings, &aChar, 1)) {\n Serial.print(\"Error in http_parser_execute, line \");\n Serial.print(__LINE__ - 2);\n abort();\n }\n}\n \nconst char* HttpRequest::URL() const { \n return fURL; \n}\n \n#ifdef USE_HEADERS\nvoid HttpRequest::printHeaders() const {\n\/\/ for (std::map<const char*, char*, ltstr>::const_iterator it = fHeaders.begin(); it != fHeaders.end(); ++it) {\n for (auto it = fHeaders.begin(); it != fHeaders.end(); ++it) {\n Serial.print(it->first);\n Serial.print(\"=\");\n Serial.println(it->second);\n } \n}\n#endif\n\n\/*\nint HttpRequest::onMessageBegin(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ pHR->init();\n\/\/ Serial.println(\"***MESSAGE BEGIN***\");\n return 0;\n}\n\nint HttpRequest::onHeadersComplete(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ Serial.println(\"***HEADER COMPLETE***\");\n return 0;\n}\n\nint HttpRequest::onMessageComplete(http_parser* parser) {\n\/\/ HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n\/\/ Serial.println(\"***MESSAGE COMPLETE***\");\n return 0;\n}\n*\/\n\nint HttpRequest::onUrl(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_URL_LENGTH];\n\n if (len) {\n if (strlen(c) + len > MAX_URL_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setURL(c);\n c[0] = '\\0';\n return 0; \n}\n\n#ifdef USE_HEADERS\nint HttpRequest::onHeaderField(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_HEADER_FIELD_LENGTH];\n \n if (len) {\n if (strlen(c) + len > MAX_HEADER_FIELD_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setHeaderField(c);\n c[0] = '\\0';\n return 0; \n}\n\nint HttpRequest::onHeaderValue(http_parser* parser, const char *at, size_t len) {\n static char c[MAX_HEADER_VALUE_LENGTH] = \"\";\n \n if (len) {\n if (strlen(c) + len > MAX_HEADER_VALUE_LENGTH)\n return 1; \/\/ overflow\n strncat(c, at, len);\n return 0;\n }\n HttpRequest *const pHR = static_cast<HttpRequest*const>(parser->data);\n pHR->setHeaderValue(c);\n c[0] = '\\0';\n return 0; \n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\n#include \"multigrid.hpp\"\n#include \"eigenvalue.hpp\"\n\nusing namespace std;\nusing namespace mfem;\n\nclass PoissonMultigridOperator : public MultigridOperator\n{\nprivate:\n HypreBoomerAMG* amg;\n Array<ParBilinearForm*> forms;\n bool partialAssembly;\n\n Operator* ConstructOperator(ParFiniteElementSpace* fespace, const Array<int>& essentialDofs)\n {\n ParBilinearForm* form = new ParBilinearForm(fespace);\n if (NumLevels() != 0 && partialAssembly)\n {\n form->SetAssemblyLevel(AssemblyLevel::PARTIAL);\n }\n ConstantCoefficient one(1.0);\n form->AddDomainIntegrator(new DiffusionIntegrator(one));\n form->Assemble();\n\n OperatorPtr opr;\n \n if (NumLevels() != 0 && partialAssembly)\n {\n opr.SetType(Operator::ANY_TYPE);\n }\n else\n {\n opr.SetType(Operator::Hypre_ParCSR);\n }\n\n form->FormSystemMatrix(essentialDofs, opr);\n opr.SetOperatorOwner(false);\n\n forms.Append(form);\n\n return opr.Ptr();\n }\n\n Solver* ConstructCoarseSolver(Operator* opr)\n {\n HypreParMatrix& hypreCoarseMat = dynamic_cast<HypreParMatrix&>(*opr);\n amg = new HypreBoomerAMG(hypreCoarseMat);\n amg->SetPrintLevel(-1);\n HyprePCG *coarseSolver = new HyprePCG(hypreCoarseMat);\n coarseSolver->SetTol(1e-8);\n coarseSolver->SetMaxIter(500);\n coarseSolver->SetPrintLevel(-1);\n coarseSolver->SetPreconditioner(*amg);\n return coarseSolver;\n }\n\n Solver* ConstructSmoother(ParFiniteElementSpace* fespace, Operator* opr, const Array<int>& essentialDofs)\n {\n Solver* smoother = nullptr;\n\n if (partialAssembly)\n {\n Vector diag(fespace->GetTrueVSize());\n forms.Last()->AssembleDiagonal(diag);\n \n Vector ev(opr->Width());\n OperatorJacobiSmoother invDiagOperator(diag, essentialDofs, 1.0);\n ProductOperator diagPrecond(&invDiagOperator, opr, false, false);\n double estLargestEigenvalue = PowerMethod::EstimateLargestEigenvalue(MPI_COMM_WORLD, diagPrecond, ev, 10, 1e-8);\n smoother = new OperatorChebyshevSmoother(opr, diag, essentialDofs, 3, estLargestEigenvalue);\n }\n else\n {\n smoother = new HypreSmoother(static_cast<HypreParMatrix&>(*opr));\n }\n\n return smoother;\n }\n\npublic:\n PoissonMultigridOperator(ParFiniteElementSpace* fespace, const Array<int>& essentialDofs, bool partialAssembly_)\n : MultigridOperator(), amg(nullptr), partialAssembly(partialAssembly_)\n {\n Operator* coarseOpr = ConstructOperator(fespace, essentialDofs);\n Solver* coarseSolver = ConstructCoarseSolver(coarseOpr);\n\n AddCoarseLevel(coarseOpr, coarseSolver, false, true);\n }\n\n ~PoissonMultigridOperator()\n {\n delete amg;\n MFEM_FORALL(i, forms.Size(), delete forms[i]; );\n }\n\n void AddLevel(ParFiniteElementSpace* lFEspace, ParFiniteElementSpace* hFEspace, const Array<int>& essentialDofs)\n {\n Operator* opr = ConstructOperator(hFEspace, essentialDofs);\n Solver* smoother = ConstructSmoother(hFEspace, opr, essentialDofs);\n Operator* P = new TrueTransferOperator(*lFEspace, *hFEspace);\n MultigridOperator::AddLevel(opr, smoother, P, partialAssembly, true, true);\n }\n\n void FormLinearSystem(const Array<int> &ess_tdof_list,\n Vector &x, Vector &b,\n Vector &X, Vector &B,\n int copy_interior = 0)\n {\n OperatorPtr dummy;\n forms.Last()->FormLinearSystem(ess_tdof_list, x, b, dummy, X, B, copy_interior);\n }\n\n void RecoverFEMSolution(const Vector &X, const Vector &b, Vector &x)\n {\n forms.Last()->RecoverFEMSolution(X, b, x);\n }\n};\n\nint main(int argc, char *argv[])\n{\n int num_procs, myid;\n MPI_Init(&argc, &argv);\n MPI_Comm_size(MPI_COMM_WORLD, &num_procs);\n MPI_Comm_rank(MPI_COMM_WORLD, &myid);\n\n \/\/ 1. Parse command-line options.\n const char *mesh_file = \"..\/..\/data\/fichera.mesh\";\n int ref_levels = 2;\n int mg_levels = 2;\n int order = 1;\n const char *basis_type = \"G\"; \/\/ Gauss-Lobatto\n bool visualization = 1;\n bool partialAssembly = false;\n bool pMultigrid = false;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Order of the finite element spaces\");\n args.AddOption(&ref_levels, \"-r\", \"--refine\",\n \"Number of times to refine the initial mesh uniformly;\"\n \"This mesh will be the coarse mesh in the multigrid hierarchy\");\n args.AddOption(&mg_levels, \"-l\", \"--levels\",\n \"Number of levels in the multigrid hierarchy;\");\n args.AddOption(&basis_type, \"-b\", \"--basis-type\",\n \"Basis: G - Gauss-Lobatto, P - Positive, U - Uniform\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption(&partialAssembly, \"-pa\", \"--partialassembly\", \"-no-pa\",\n \"--no-partialassembly\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption(&pMultigrid, \"-pmg\", \"--pmultigrid\", \"-no-pmg\",\n \"--no-pmultigrid\",\n \"Enable or disable GLVis visualization.\");\n args.Parse();\n if (!args.Good())\n {\n if (myid == 0)\n {\n args.PrintUsage(cout);\n }\n MPI_Finalize();\n return 1;\n }\n\n if (myid == 0)\n {\n args.PrintOptions(cout);\n }\n\n \/\/ See class BasisType in fem\/fe_coll.hpp for available basis types\n int basis = BasisType::GetType(basis_type[0]);\n if (myid == 0)\n {\n cout << \"Using \" << BasisType::Name(basis) << \" basis ...\" << endl;\n }\n\n \/\/ 2. Read the mesh from the given mesh file. We can handle triangular,\n \/\/ quadrilateral, tetrahedral, hexahedral, surface and volume meshes with\n \/\/ the same code.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n \/\/ Mesh *mesh = new Mesh(1, 1, 1, Element::HEXAHEDRON, true, 1.0, 1.0, 1.0, false);\n \/\/ Mesh *mesh = new Mesh(1, 1, Element::QUADRILATERAL, true, 1.0, 1.0, false);\n int dim = mesh->Dimension();\n\n Array<int> ess_bdr(mesh->bdr_attributes.Max());\n ess_bdr = 1;\n\n \/\/ Initial refinements of the input grid\n for (int i = 0; i < ref_levels; ++i)\n {\n mesh->UniformRefinement();\n }\n\n ParMesh *pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);\n delete mesh;\n mesh = nullptr;\n\n Array<FiniteElementCollection*> feCollectons;\n feCollectons.Append(new H1_FECollection(order, dim, basis));\n\n \/\/ Set up coarse grid finite element space\n ParFiniteElementSpace* fespace = new ParFiniteElementSpace(pmesh, feCollectons.Last());\n HYPRE_Int size = fespace->GlobalTrueVSize();\n\n if (myid == 0)\n {\n cout << \"Number of finite element unknowns on level 0: \" << size << \"; FE order: \" << order << endl;\n }\n\n Array<Array<int>*> essentialTrueDoFs;\n essentialTrueDoFs.Append(new Array<int>());\n fespace->GetEssentialTrueDofs(ess_bdr, *essentialTrueDoFs.Last());\n\n ParSpaceHierarchy* spaceHierarchy = new ParSpaceHierarchy(pmesh, fespace, true, true);\n PoissonMultigridOperator* oprMultigrid = new PoissonMultigridOperator(fespace, *essentialTrueDoFs.Last(), partialAssembly);\n\n for(int level = 1; level < mg_levels; ++level)\n {\n int newOrder = order;\n\n if (pMultigrid)\n {\n newOrder = std::pow(2, level);\n feCollectons.Append(new H1_FECollection(newOrder, dim, basis));\n spaceHierarchy->AddOrderRefinedLevel(feCollectons.Last());\n }\n else\n {\n spaceHierarchy->AddUniformlyRefinedLevel();\n }\n\n size = spaceHierarchy->GetFinestFESpace().GlobalTrueVSize();\n if (myid == 0)\n {\n cout << \"Number of finite element unknowns on level \" << level << \": \" << size << \"; FE order: \" << newOrder << endl;\n }\n \n essentialTrueDoFs.Append(new Array<int>());\n spaceHierarchy->GetFinestFESpace().GetEssentialTrueDofs(ess_bdr, *essentialTrueDoFs.Last());\n\n oprMultigrid->AddLevel(&spaceHierarchy->GetFESpaceAtLevel(level - 1), &spaceHierarchy->GetFinestFESpace(), *essentialTrueDoFs.Last());\n }\n\n ParGridFunction x(&spaceHierarchy->GetFinestFESpace());\n x = 0.0;\n\n if (myid == 0)\n {\n cout << \"Assembling rhs...\" << flush;\n }\n tic_toc.Clear();\n tic_toc.Start();\n ParLinearForm* b = new ParLinearForm(&spaceHierarchy->GetFinestFESpace());\n ConstantCoefficient one(1.0);\n b->AddDomainIntegrator(new DomainLFIntegrator(one));\n b->Assemble();\n tic_toc.Stop();\n if (myid == 0)\n {\n cout << \"\\t\\t\\t\\tdone, \" << tic_toc.RealTime() << \"s.\" << endl;\n }\n\n Vector X, B;\n oprMultigrid->FormLinearSystem(*essentialTrueDoFs.Last(), x, *b, X, B);\n\n Vector r(X.Size());\n MultigridSolver* mgCycle = new MultigridSolver(oprMultigrid, MultigridSolver::CycleType::VCYCLE, 3, 3);\n\n \/\/ HypreParMatrix& hypreMat = dynamic_cast<HypreParMatrix&>(*oprMultigrid.GetOperatorAtFinestLevel());\n \/\/ HypreBoomerAMG *amg = new HypreBoomerAMG(hypreMat);\n \/\/ HyprePCG *pcg = new HyprePCG(hypreMat);\n \/\/ pcg->SetTol(1e-8);\n \/\/ pcg->SetMaxIter(500);\n \/\/ pcg->SetPrintLevel(2);\n \/\/ pcg->SetPreconditioner(*amg);\n \/\/ pcg->Mult(B, X);\n\n \/\/ CGSolver pcg(MPI_COMM_WORLD);\n \/\/ pcg.SetPrintLevel(1);\n \/\/ pcg.SetMaxIter(10);\n \/\/ pcg.SetRelTol(1e-5);\n \/\/ pcg.SetAbsTol(0.0);\n \/\/ pcg.SetOperator(*oprMultigrid.GetOperatorAtFinestLevel());\n \/\/ pcg.SetPreconditioner(mgCycle);\n \/\/ pcg.Mult(B, X);\n\n oprMultigrid->Mult(X, r);\n subtract(B, r, r);\n\n double beginRes = sqrt(InnerProduct(MPI_COMM_WORLD, r, r));\n double prevRes = beginRes;\n const int printWidth = 11;\n\n if (myid == 0)\n {\n cout << std::setw(3) << \"It\";\n cout << std::setw(printWidth) << \"Absres\";\n cout << std::setw(printWidth) << \"Relres\";\n cout << std::setw(printWidth) << \"Conv\";\n cout << std::setw(printWidth) << \"Time [s]\" << endl;\n\n cout << std::setw(3) << 0;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << beginRes;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 1.0;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 0.0;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 0.0 << endl;\n }\n\n for (int iter = 0; iter < 10; ++iter)\n {\n tic_toc.Clear();\n tic_toc.Start();\n mgCycle->Mult(B, X);\n tic_toc.Stop();\n\n oprMultigrid->Mult(X, r);\n subtract(B, r, r);\n\n double res = sqrt(InnerProduct(MPI_COMM_WORLD, r, r));\n if (myid == 0)\n {\n cout << std::setw(3) << iter + 1;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res\/beginRes;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res\/prevRes;\n cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << tic_toc.RealTime() << endl;\n }\n\n if (res < 1e-10 * beginRes)\n {\n break;\n }\n\n prevRes = res;\n }\n\n oprMultigrid->RecoverFEMSolution(X, *b, x);\n\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n socketstream sol_sock(vishost, visport);\n sol_sock << \"parallel \" << num_procs << \" \" << myid << \"\\n\";\n sol_sock.precision(8);\n sol_sock << \"solution\\n\" << spaceHierarchy->GetFinestMesh() << x << flush;\n }\n\n delete b;\n delete mgCycle;\n delete oprMultigrid;\n delete spaceHierarchy;\n \n MFEM_FORALL(i, essentialTrueDoFs.Size(), delete essentialTrueDoFs[i]; );\n MFEM_FORALL(i, feCollectons.Size(), delete feCollectons[i]; );\n\n MPI_Finalize();\n\n return 0;\n}<commit_msg>Added parameter to compare BoomerAMG to MultigridSolver<commit_after>#include \"mfem.hpp\"\n#include <fstream>\n#include <iostream>\n\n#include \"multigrid.hpp\"\n#include \"eigenvalue.hpp\"\n\nusing namespace std;\nusing namespace mfem;\n\nclass PoissonMultigridOperator : public MultigridOperator\n{\nprivate:\n HypreBoomerAMG* amg;\n Array<ParBilinearForm*> forms;\n bool partialAssembly;\n\n Operator* ConstructOperator(ParFiniteElementSpace* fespace, const Array<int>& essentialDofs)\n {\n ParBilinearForm* form = new ParBilinearForm(fespace);\n if (NumLevels() != 0 && partialAssembly)\n {\n form->SetAssemblyLevel(AssemblyLevel::PARTIAL);\n }\n ConstantCoefficient one(1.0);\n form->AddDomainIntegrator(new DiffusionIntegrator(one));\n form->Assemble();\n\n OperatorPtr opr;\n \n if (NumLevels() != 0 && partialAssembly)\n {\n opr.SetType(Operator::ANY_TYPE);\n }\n else\n {\n opr.SetType(Operator::Hypre_ParCSR);\n }\n\n form->FormSystemMatrix(essentialDofs, opr);\n opr.SetOperatorOwner(false);\n\n forms.Append(form);\n\n return opr.Ptr();\n }\n\n Solver* ConstructCoarseSolver(Operator* opr)\n {\n HypreParMatrix& hypreCoarseMat = dynamic_cast<HypreParMatrix&>(*opr);\n amg = new HypreBoomerAMG(hypreCoarseMat);\n amg->SetPrintLevel(-1);\n HyprePCG *coarseSolver = new HyprePCG(hypreCoarseMat);\n coarseSolver->SetTol(1e-8);\n coarseSolver->SetMaxIter(500);\n coarseSolver->SetPrintLevel(-1);\n coarseSolver->SetPreconditioner(*amg);\n return coarseSolver;\n }\n\n Solver* ConstructSmoother(ParFiniteElementSpace* fespace, Operator* opr, const Array<int>& essentialDofs)\n {\n Solver* smoother = nullptr;\n\n if (partialAssembly)\n {\n Vector diag(fespace->GetTrueVSize());\n forms.Last()->AssembleDiagonal(diag);\n \n Vector ev(opr->Width());\n OperatorJacobiSmoother invDiagOperator(diag, essentialDofs, 1.0);\n ProductOperator diagPrecond(&invDiagOperator, opr, false, false);\n double estLargestEigenvalue = PowerMethod::EstimateLargestEigenvalue(MPI_COMM_WORLD, diagPrecond, ev, 10, 1e-8);\n smoother = new OperatorChebyshevSmoother(opr, diag, essentialDofs, 3, estLargestEigenvalue);\n }\n else\n {\n smoother = new HypreSmoother(static_cast<HypreParMatrix&>(*opr));\n }\n\n return smoother;\n }\n\npublic:\n PoissonMultigridOperator(ParFiniteElementSpace* fespace, const Array<int>& essentialDofs, bool partialAssembly_)\n : MultigridOperator(), amg(nullptr), partialAssembly(partialAssembly_)\n {\n Operator* coarseOpr = ConstructOperator(fespace, essentialDofs);\n Solver* coarseSolver = ConstructCoarseSolver(coarseOpr);\n\n AddCoarseLevel(coarseOpr, coarseSolver, false, true);\n }\n\n ~PoissonMultigridOperator()\n {\n delete amg;\n MFEM_FORALL(i, forms.Size(), delete forms[i]; );\n }\n\n void AddLevel(ParFiniteElementSpace* lFEspace, ParFiniteElementSpace* hFEspace, const Array<int>& essentialDofs)\n {\n Operator* opr = ConstructOperator(hFEspace, essentialDofs);\n Solver* smoother = ConstructSmoother(hFEspace, opr, essentialDofs);\n Operator* P = new TrueTransferOperator(*lFEspace, *hFEspace);\n MultigridOperator::AddLevel(opr, smoother, P, partialAssembly, true, true);\n }\n\n void FormLinearSystem(const Array<int> &ess_tdof_list,\n Vector &x, Vector &b,\n Vector &X, Vector &B,\n int copy_interior = 0)\n {\n OperatorPtr dummy;\n forms.Last()->FormLinearSystem(ess_tdof_list, x, b, dummy, X, B, copy_interior);\n }\n\n void RecoverFEMSolution(const Vector &X, const Vector &b, Vector &x)\n {\n forms.Last()->RecoverFEMSolution(X, b, x);\n }\n};\n\nint main(int argc, char *argv[])\n{\n int num_procs, myid;\n MPI_Init(&argc, &argv);\n MPI_Comm_size(MPI_COMM_WORLD, &num_procs);\n MPI_Comm_rank(MPI_COMM_WORLD, &myid);\n\n \/\/ 1. Parse command-line options.\n const char *mesh_file = \"..\/..\/data\/fichera.mesh\";\n int ref_levels = 2;\n int mg_levels = 2;\n int order = 1;\n const char *basis_type = \"G\"; \/\/ Gauss-Lobatto\n bool visualization = 1;\n bool partialAssembly = false;\n bool pMultigrid = false;\n bool boomerAMG = false;\n\n OptionsParser args(argc, argv);\n args.AddOption(&mesh_file, \"-m\", \"--mesh\",\n \"Mesh file to use.\");\n args.AddOption(&order, \"-o\", \"--order\",\n \"Order of the finite element spaces\");\n args.AddOption(&ref_levels, \"-r\", \"--refine\",\n \"Number of times to refine the initial mesh uniformly;\"\n \"This mesh will be the coarse mesh in the multigrid hierarchy\");\n args.AddOption(&mg_levels, \"-l\", \"--levels\",\n \"Number of levels in the multigrid hierarchy;\");\n args.AddOption(&basis_type, \"-b\", \"--basis-type\",\n \"Basis: G - Gauss-Lobatto, P - Positive, U - Uniform\");\n args.AddOption(&visualization, \"-vis\", \"--visualization\", \"-no-vis\",\n \"--no-visualization\",\n \"Enable or disable GLVis visualization.\");\n args.AddOption(&partialAssembly, \"-pa\", \"--partialassembly\", \"-no-pa\",\n \"--no-partialassembly\",\n \"Enable or disable partial assembly.\");\n args.AddOption(&pMultigrid, \"-pmg\", \"--pmultigrid\", \"-no-pmg\",\n \"--no-pmultigrid\",\n \"Enable or p multigrid.\");\n args.AddOption(&boomerAMG, \"-boomeramg\", \"--boomeramg\", \"-no-boomeramg\",\n \"--no-boomeramg\",\n \"Enable or disable usage of BoomerAMG at finest level\");\n args.Parse();\n if (!args.Good())\n {\n if (myid == 0)\n {\n args.PrintUsage(cout);\n }\n MPI_Finalize();\n return 1;\n }\n\n if (myid == 0)\n {\n args.PrintOptions(cout);\n }\n\n \/\/ See class BasisType in fem\/fe_coll.hpp for available basis types\n int basis = BasisType::GetType(basis_type[0]);\n if (myid == 0)\n {\n cout << \"Using \" << BasisType::Name(basis) << \" basis ...\" << endl;\n }\n\n \/\/ 2. Read the mesh from the given mesh file. We can handle triangular,\n \/\/ quadrilateral, tetrahedral, hexahedral, surface and volume meshes with\n \/\/ the same code.\n Mesh *mesh = new Mesh(mesh_file, 1, 1);\n \/\/ Mesh *mesh = new Mesh(1, 1, 1, Element::HEXAHEDRON, true, 1.0, 1.0, 1.0, false);\n \/\/ Mesh *mesh = new Mesh(1, 1, Element::QUADRILATERAL, true, 1.0, 1.0, false);\n int dim = mesh->Dimension();\n\n Array<int> ess_bdr(mesh->bdr_attributes.Max());\n ess_bdr = 1;\n\n \/\/ Initial refinements of the input grid\n for (int i = 0; i < ref_levels; ++i)\n {\n mesh->UniformRefinement();\n }\n\n ParMesh *pmesh = new ParMesh(MPI_COMM_WORLD, *mesh);\n delete mesh;\n mesh = nullptr;\n\n Array<FiniteElementCollection*> feCollectons;\n feCollectons.Append(new H1_FECollection(order, dim, basis));\n\n \/\/ Set up coarse grid finite element space\n ParFiniteElementSpace* fespace = new ParFiniteElementSpace(pmesh, feCollectons.Last());\n HYPRE_Int size = fespace->GlobalTrueVSize();\n\n if (myid == 0)\n {\n cout << \"Number of finite element unknowns on level 0: \" << size << \"; FE order: \" << order << endl;\n }\n\n Array<Array<int>*> essentialTrueDoFs;\n essentialTrueDoFs.Append(new Array<int>());\n fespace->GetEssentialTrueDofs(ess_bdr, *essentialTrueDoFs.Last());\n\n ParSpaceHierarchy* spaceHierarchy = new ParSpaceHierarchy(pmesh, fespace, true, true);\n PoissonMultigridOperator* oprMultigrid = new PoissonMultigridOperator(fespace, *essentialTrueDoFs.Last(), partialAssembly);\n\n for(int level = 1; level < mg_levels; ++level)\n {\n tic_toc.Clear();\n tic_toc.Start();\n int newOrder = order;\n\n if (pMultigrid)\n {\n newOrder = std::pow(2, level);\n feCollectons.Append(new H1_FECollection(newOrder, dim, basis));\n spaceHierarchy->AddOrderRefinedLevel(feCollectons.Last());\n }\n else\n {\n spaceHierarchy->AddUniformlyRefinedLevel();\n }\n\n size = spaceHierarchy->GetFinestFESpace().GlobalTrueVSize();\n if (myid == 0)\n {\n cout << \"Number of finite element unknowns on level \" << level << \": \" << size << \"; FE order: \" << newOrder << endl;\n }\n \n essentialTrueDoFs.Append(new Array<int>());\n spaceHierarchy->GetFinestFESpace().GetEssentialTrueDofs(ess_bdr, *essentialTrueDoFs.Last());\n\n oprMultigrid->AddLevel(&spaceHierarchy->GetFESpaceAtLevel(level - 1), &spaceHierarchy->GetFinestFESpace(), *essentialTrueDoFs.Last());\n tic_toc.Stop();\n if (myid == 0)\n {\n cout << \"Assembly time on level \" << level << \": \" << tic_toc.RealTime() << \"s\" << endl;\n }\n }\n\n ParGridFunction x(&spaceHierarchy->GetFinestFESpace());\n x = 0.0;\n\n if (myid == 0)\n {\n cout << \"Assembling rhs...\" << flush;\n }\n tic_toc.Clear();\n tic_toc.Start();\n ParLinearForm* b = new ParLinearForm(&spaceHierarchy->GetFinestFESpace());\n ConstantCoefficient one(1.0);\n b->AddDomainIntegrator(new DomainLFIntegrator(one));\n b->Assemble();\n tic_toc.Stop();\n if (myid == 0)\n {\n cout << \"\\t\\t\\t\\tdone, \" << tic_toc.RealTime() << \"s.\" << endl;\n }\n\n Vector X, B;\n oprMultigrid->FormLinearSystem(*essentialTrueDoFs.Last(), x, *b, X, B);\n\n Vector r(X.Size());\n MultigridSolver* mgCycle = new MultigridSolver(oprMultigrid, MultigridSolver::CycleType::VCYCLE, 3, 3);\n\n tic_toc.Clear();\n tic_toc.Start();\n if (boomerAMG)\n {\n HypreParMatrix& hypreMat = dynamic_cast<HypreParMatrix&>(*oprMultigrid->GetOperatorAtFinestLevel());\n HypreBoomerAMG *amg = new HypreBoomerAMG(hypreMat);\n HyprePCG *pcg = new HyprePCG(hypreMat);\n pcg->SetPrintLevel(2);\n pcg->SetMaxIter(100);\n pcg->SetTol(1e-8);\n pcg->SetPreconditioner(*amg);\n pcg->Mult(B, X);\n }\n else\n {\n CGSolver pcg(MPI_COMM_WORLD);\n pcg.SetPrintLevel(1);\n pcg.SetMaxIter(100);\n pcg.SetRelTol(1e-8);\n pcg.SetAbsTol(0.0);\n pcg.SetOperator(*oprMultigrid->GetOperatorAtFinestLevel());\n pcg.SetPreconditioner(*mgCycle);\n pcg.Mult(B, X);\n }\n tic_toc.Stop();\n\n if (myid == 0)\n {\n cout << \"Time to solution: \" << tic_toc.RealTime() << \"s\" << endl;\n }\n\n \/\/ oprMultigrid->Mult(X, r);\n \/\/ subtract(B, r, r);\n\n \/\/ double beginRes = sqrt(InnerProduct(MPI_COMM_WORLD, r, r));\n \/\/ double prevRes = beginRes;\n \/\/ const int printWidth = 11;\n\n \/\/ if (myid == 0)\n \/\/ {\n \/\/ cout << std::setw(3) << \"It\";\n \/\/ cout << std::setw(printWidth) << \"Absres\";\n \/\/ cout << std::setw(printWidth) << \"Relres\";\n \/\/ cout << std::setw(printWidth) << \"Conv\";\n \/\/ cout << std::setw(printWidth) << \"Time [s]\" << endl;\n\n \/\/ cout << std::setw(3) << 0;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << beginRes;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 1.0;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 0.0;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << 0.0 << endl;\n \/\/ }\n\n \/\/ for (int iter = 0; iter < 10; ++iter)\n \/\/ {\n \/\/ tic_toc.Clear();\n \/\/ tic_toc.Start();\n \/\/ mgCycle->Mult(B, X);\n \/\/ tic_toc.Stop();\n\n \/\/ oprMultigrid->Mult(X, r);\n \/\/ subtract(B, r, r);\n\n \/\/ double res = sqrt(InnerProduct(MPI_COMM_WORLD, r, r));\n \/\/ if (myid == 0)\n \/\/ {\n \/\/ cout << std::setw(3) << iter + 1;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res\/beginRes;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << res\/prevRes;\n \/\/ cout << std::scientific << std::setprecision(3) << std::setw(printWidth) << tic_toc.RealTime() << endl;\n \/\/ }\n\n \/\/ if (res < 1e-10 * beginRes)\n \/\/ {\n \/\/ break;\n \/\/ }\n\n \/\/ prevRes = res;\n \/\/ }\n\n oprMultigrid->RecoverFEMSolution(X, *b, x);\n\n if (visualization)\n {\n char vishost[] = \"localhost\";\n int visport = 19916;\n socketstream sol_sock(vishost, visport);\n sol_sock << \"parallel \" << num_procs << \" \" << myid << \"\\n\";\n sol_sock.precision(8);\n sol_sock << \"solution\\n\" << spaceHierarchy->GetFinestMesh() << x << flush;\n }\n\n delete b;\n delete mgCycle;\n delete oprMultigrid;\n delete spaceHierarchy;\n \n MFEM_FORALL(i, essentialTrueDoFs.Size(), delete essentialTrueDoFs[i]; );\n MFEM_FORALL(i, feCollectons.Size(), delete feCollectons[i]; );\n\n MPI_Finalize();\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Open Source Robotics Foundation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n*\/\n\n#ifndef __IGN_TRANSPORT_SUBSCRIPTIONHANDLER_HH_INCLUDED__\n#define __IGN_TRANSPORT_SUBSCRIPTIONHANDLER_HH_INCLUDED__\n\n#include <google\/protobuf\/message.h>\n#include <functional>\n#include <memory>\n#include <string>\n#include \"ignition\/transport\/TransportTypes.hh\"\n\nnamespace ignition\n{\n namespace transport\n {\n \/\/\/ \\class ISubscriptionHandler SubscriptionHandler.hh\n \/\/\/ \\brief Interface class used to manage generic protobub messages.\n class ISubscriptionHandler\n {\n \/\/\/ \\brief Destructor\n public: virtual ~ISubscriptionHandler()\n {\n }\n\n \/\/\/ \\brief Executes the local callback registered for this handler.\n \/\/\/ \\param[in] _topic Topic to be passed to the callback.\n \/\/\/ \\param[in] _msg Protobuf message received.\n \/\/\/ \\return 0 when success.\n public: virtual int RunLocalCallback(const std::string &_topic,\n const transport::ProtoMsg &_msg) = 0;\n\n \/\/\/ \\brief Executes the callback registered for this handler.\n \/\/\/ \\param[in] _topic Topic to be passed to the callback.\n \/\/\/ \\param[in] _data Serialized data received. The data will be used\n \/\/\/ to compose a specific protobuf message and will be passed to the\n \/\/\/ callback function.\n \/\/\/ \\return 0 when success.\n public: virtual int RunCallback(const std::string &_topic,\n const std::string &_data) = 0;\n };\n\n \/\/\/ \\class SubscriptionHandler SubscriptionHandler.hh\n \/\/\/ \\brief It creates subscription handlers for each specific protobuf\n \/\/\/ message used.\n template <typename T> class SubscriptionHandler\n : public ISubscriptionHandler\n {\n \/\/\/ \\brief Create a specific protobuf message given its serialized data.\n \/\/\/ \\param[in] _data The serialized data.\n \/\/\/ \\return Pointer to the specific protobuf message.\n public: std::shared_ptr<T> CreateMsg(const char *_data)\n {\n \/\/ Instantiate a specific protobuf message\n std::shared_ptr<T> msgPtr(new T());\n\n \/\/ Create the message using some serialized data\n msgPtr->ParseFromString(_data);\n\n return msgPtr;\n }\n\n \/\/\/ \\brief Set the callback for this handler.\n \/\/\/ \\param[in] _cb The callback.\n public: void SetCallback(\n const std::function<void(const std::string &, const T &)> &_cb)\n {\n this->cb = _cb;\n }\n\n \/\/ Documentation inherited.\n public: int RunLocalCallback(const std::string &_topic,\n const transport::ProtoMsg &_msg)\n {\n \/\/ Execute the callback (if existing)\n if (this->cb)\n {\n auto msgPtr = google::protobuf::down_cast<const T*>(&_msg);\n this->cb(_topic, *msgPtr);\n return 0;\n }\n else\n {\n std::cerr << \"Callback is NULL\" << std::endl;\n return -1;\n }\n }\n\n \/\/ Documentation inherited\n public: int RunCallback(const std::string &_topic,\n const std::string &_data)\n {\n \/\/ Instantiate the specific protobuf message associated to this topic.\n auto msg = this->CreateMsg(_data.c_str());\n\n \/\/ Execute the callback (if existing)\n if (this->cb)\n {\n this->cb(_topic, *msg);\n return 0;\n }\n else\n {\n std::cerr << \"Callback is NULL\" << std::endl;\n return -1;\n }\n }\n\n \/\/\/ \\brief Callback to the function registered for this handler.\n private: std::function<void(const std::string &, const T &)> cb;\n };\n }\n}\n\n#endif\n<commit_msg>Adding missing include.<commit_after>\/*\n * Copyright (C) 2014 Open Source Robotics Foundation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n*\/\n\n#ifndef __IGN_TRANSPORT_SUBSCRIPTIONHANDLER_HH_INCLUDED__\n#define __IGN_TRANSPORT_SUBSCRIPTIONHANDLER_HH_INCLUDED__\n\n#include <google\/protobuf\/message.h>\n#include <functional>\n#include <iostream>\n#include <memory>\n#include <string>\n#include \"ignition\/transport\/TransportTypes.hh\"\n\nnamespace ignition\n{\n namespace transport\n {\n \/\/\/ \\class ISubscriptionHandler SubscriptionHandler.hh\n \/\/\/ \\brief Interface class used to manage generic protobub messages.\n class ISubscriptionHandler\n {\n \/\/\/ \\brief Destructor\n public: virtual ~ISubscriptionHandler()\n {\n }\n\n \/\/\/ \\brief Executes the local callback registered for this handler.\n \/\/\/ \\param[in] _topic Topic to be passed to the callback.\n \/\/\/ \\param[in] _msg Protobuf message received.\n \/\/\/ \\return 0 when success.\n public: virtual int RunLocalCallback(const std::string &_topic,\n const transport::ProtoMsg &_msg) = 0;\n\n \/\/\/ \\brief Executes the callback registered for this handler.\n \/\/\/ \\param[in] _topic Topic to be passed to the callback.\n \/\/\/ \\param[in] _data Serialized data received. The data will be used\n \/\/\/ to compose a specific protobuf message and will be passed to the\n \/\/\/ callback function.\n \/\/\/ \\return 0 when success.\n public: virtual int RunCallback(const std::string &_topic,\n const std::string &_data) = 0;\n };\n\n \/\/\/ \\class SubscriptionHandler SubscriptionHandler.hh\n \/\/\/ \\brief It creates subscription handlers for each specific protobuf\n \/\/\/ message used.\n template <typename T> class SubscriptionHandler\n : public ISubscriptionHandler\n {\n \/\/\/ \\brief Create a specific protobuf message given its serialized data.\n \/\/\/ \\param[in] _data The serialized data.\n \/\/\/ \\return Pointer to the specific protobuf message.\n public: std::shared_ptr<T> CreateMsg(const char *_data)\n {\n \/\/ Instantiate a specific protobuf message\n std::shared_ptr<T> msgPtr(new T());\n\n \/\/ Create the message using some serialized data\n msgPtr->ParseFromString(_data);\n\n return msgPtr;\n }\n\n \/\/\/ \\brief Set the callback for this handler.\n \/\/\/ \\param[in] _cb The callback.\n public: void SetCallback(\n const std::function<void(const std::string &, const T &)> &_cb)\n {\n this->cb = _cb;\n }\n\n \/\/ Documentation inherited.\n public: int RunLocalCallback(const std::string &_topic,\n const transport::ProtoMsg &_msg)\n {\n \/\/ Execute the callback (if existing)\n if (this->cb)\n {\n auto msgPtr = google::protobuf::down_cast<const T*>(&_msg);\n this->cb(_topic, *msgPtr);\n return 0;\n }\n else\n {\n std::cerr << \"Callback is NULL\" << std::endl;\n return -1;\n }\n }\n\n \/\/ Documentation inherited\n public: int RunCallback(const std::string &_topic,\n const std::string &_data)\n {\n \/\/ Instantiate the specific protobuf message associated to this topic.\n auto msg = this->CreateMsg(_data.c_str());\n\n \/\/ Execute the callback (if existing)\n if (this->cb)\n {\n this->cb(_topic, *msg);\n return 0;\n }\n else\n {\n std::cerr << \"Callback is NULL\" << std::endl;\n return -1;\n }\n }\n\n \/\/\/ \\brief Callback to the function registered for this handler.\n private: std::function<void(const std::string &, const T &)> cb;\n };\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/===------------------------ UnitTestRunner.cpp --------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2022 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ TO ADD A NEW TEST, search in this file for [new_tests]\n\/\/\n\/\/ Provides a mechanism for doing faux unit tests. The idea is to emulate the\n\/\/ basic function of calling a function and validating its results\/effects.\n\/\/\n\/\/ This is done via the test_specification instruction. Using one or more\n\/\/ instances of it in your function, you can specify which test (i.e. UnitTest\n\/\/ subclass) should be run and what arguments should be provided to it. The\n\/\/ test grabs the arguments it expects out of the test::Arguments instance it is\n\/\/ provided. It calls some function or functions. It then prints out\n\/\/ interesting results. These results can then be FileCheck'd.\n\/\/\n\/\/ CASE STUDY:\n\/\/ Here's an example of how it works:\n\/\/ 1) A test test\/SILOptimizer\/interesting_functionality.sil runs this pass:\n\/\/ \/\/ RUN: %target-sil-opt -unit-test-runner %s 2>&1 | %FileCheck %s\n\/\/ 2) A function in interesting_functionality.sil contains the\n\/\/ test_specification instruction.\n\/\/ sil @f : $() -> () {\n\/\/ ...\n\/\/ test_specification \"my-neato-utility 43 @trace[2] @function[other_fun]\"\n\/\/ ...\n\/\/ }\n\/\/ 3) UnitTestRunner sees the name \"my-neato-utility\", instantiates the\n\/\/ corresponding UnitTest subclass MyNeatoUtilityTest, and calls ::invoke()\n\/\/ on it, passing an test::Arguments that contains\n\/\/ (43 : unsigned long, someValue : SILValue, other_fun : SILFunction *)\n\/\/\n\/\/ 4) MyNeatoUtilityTest calls takeUInt(), takeValue(), and takeFunction() on\n\/\/ the test::Arguments instance.\n\/\/ auto count = arguments.takeUInt();\n\/\/ auto target = arguments.takeValue();\n\/\/ auto callee = arguments.takeFunction();\n\/\/ 5) MyNeatoUtilityTest calls myNeatoUtility, passing these values along.\n\/\/ myNeatoUtility(count, target, callee);\n\/\/ 6) MyNeatoUtilityTest then dumps out the current function, which was modified\n\/\/ in the process.\n\/\/ getFunction()->dump();\n\/\/ 7) The test file test\/SILOptimizer\/interesting_functionality.sil matches the\n\/\/ expected contents of the modified function:\n\/\/ \/\/ CHECK-LABEL: sil @f\n\/\/ \/\/ CHECK-NOT: function_ref @other_fun\n\/\/\n\/\/ [new_tests] TESTING MORE FUNCTIONALITY:\n\/\/\n\/\/ 1) Add a new UnitTest subclass.\n\/\/ - Add a constructor: NewTest(UnitTestRunner *pass) : UnitTest(pass) {}\n\/\/ - Implement invoke: void invoke(test::Arguments &arguments) override {...}\n\/\/ - Call the take{TYPE} methods to get the arguments you need.\n\/\/ - Call your function with those arguments.\n\/\/ 2) Add a new ADD_UNIT_TEST_SUBCLASS line.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/AST\/Type.h\"\n#include \"swift\/Basic\/TaggedUnion.h\"\n#include \"swift\/SIL\/PrunedLiveness.h\"\n#include \"swift\/SIL\/SILArgumentArrayRef.h\"\n#include \"swift\/SIL\/SILBasicBlock.h\"\n#include \"swift\/SIL\/SILBridging.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SILOptimizer\/Analysis\/BasicCalleeAnalysis.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"swift\/SILOptimizer\/Utils\/CanonicalizeBorrowScope.h\"\n#include \"swift\/SILOptimizer\/Utils\/CanonicalizeOSSALifetime.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstOptUtils.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstructionDeleter.h\"\n#include \"swift\/SILOptimizer\/Utils\/ParseTestSpecification.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <iterator>\n#include <memory>\n\nusing namespace swift;\nusing namespace swift::test;\n\nnamespace {\n\nclass UnitTestRunner;\n\nclass UnitTest {\n UnitTestRunner *pass;\n\nprotected:\n template <typename Analysis>\n Analysis *getAnalysis();\n UnitTestRunner *getPass() { return pass; }\n SILFunction *getFunction();\n\npublic:\n UnitTest(UnitTestRunner *pass) : pass(pass){};\n virtual ~UnitTest() {}\n virtual void invoke(Arguments &arguments) = 0;\n};\n\n\/\/ Arguments:\n\/\/ - string: list of characters, each of which specifies subsequent arguments\n\/\/ - F: function\n\/\/ - B: block\n\/\/ - I: instruction\n\/\/ - V: value\n\/\/ - O: operand\n\/\/ - b: boolean\n\/\/ - u: unsigned\n\/\/ - s: string\n\/\/ - ...\n\/\/ - an argument of the type specified in the initial string\n\/\/ - ...\n\/\/ Dumps:\n\/\/ - for each argument (after the initial string)\n\/\/ - its type\n\/\/ - something to identify the instance (mostly this means calling dump)\nstruct TestSpecificationTest : UnitTest {\n TestSpecificationTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto expectedFields = arguments.takeString();\n for (auto expectedField : expectedFields) {\n switch (expectedField) {\n case 'F': {\n auto *function = arguments.takeFunction();\n llvm::errs() << \"function: \" << function->getName() << \"\\n\";\n break;\n }\n case 'B': {\n auto *block = arguments.takeBlock();\n llvm::errs() << \"block:\\n\";\n block->dump();\n break;\n }\n case 'I': {\n auto *instruction = arguments.takeInstruction();\n llvm::errs() << \"instruction: \";\n instruction->dump();\n break;\n }\n case 'V': {\n auto value = arguments.takeValue();\n llvm::errs() << \"value: \";\n value->dump();\n break;\n }\n case 'O': {\n auto *operand = arguments.takeOperand();\n llvm::errs() << \"operand: \";\n operand->print(llvm::errs());\n break;\n }\n case 'u': {\n auto u = arguments.takeUInt();\n llvm::errs() << \"uint: \" << u << \"\\n\";\n break;\n }\n case 'b': {\n auto b = arguments.takeBool();\n llvm::errs() << \"bool: \" << b << \"\\n\";\n break;\n }\n case 's': {\n auto s = arguments.takeString();\n llvm::errs() << \"string: \" << s << \"\\n\";\n break;\n }\n default:\n llvm_unreachable(\"unknown field type was expected?!\");\n }\n }\n }\n};\n\n\/\/ Arguments:\n\/\/ - bool: pruneDebug\n\/\/ - bool: maximizeLifetimes\n\/\/ - SILValue: value to canonicalize\n\/\/ Dumps:\n\/\/ - function after value canonicalization\nstruct CanonicalizeOSSALifetimeTest : UnitTest {\n CanonicalizeOSSALifetimeTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto *accessBlockAnalysis = getAnalysis<NonLocalAccessBlockAnalysis>();\n auto *dominanceAnalysis = getAnalysis<DominanceAnalysis>();\n DominanceInfo *domTree = dominanceAnalysis->get(getFunction());\n auto pruneDebug = arguments.takeBool();\n auto maximizeLifetimes = arguments.takeBool();\n InstructionDeleter deleter;\n CanonicalizeOSSALifetime canonicalizer(pruneDebug, maximizeLifetimes, accessBlockAnalysis,\n domTree, deleter);\n auto value = arguments.takeValue();\n canonicalizer.canonicalizeValueLifetime(value);\n getFunction()->dump();\n }\n};\n\n\/\/ Arguments:\n\/\/ - SILValue: phi\n\/\/ Dumps:\n\/\/ - function\n\/\/ - the adjacent phis\nstruct VisitAdjacentReborrowsOfPhiTest : UnitTest {\n VisitAdjacentReborrowsOfPhiTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n getFunction()->dump();\n visitAdjacentReborrowsOfPhi(cast<SILPhiArgument>(arguments.takeValue()),\n [](auto *argument) -> bool {\n argument->dump();\n return true;\n });\n }\n};\n\n\/\/ Arguments:\n\/\/ - variadic list of - instruction: a last user\n\/\/ Dumps:\n\/\/ - the insertion points\nstruct PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest : UnitTest {\n PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest(\n UnitTestRunner *pass)\n : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n PrunedLivenessBoundary boundary;\n while (arguments.hasUntaken()) {\n boundary.lastUsers.push_back(arguments.takeInstruction());\n }\n boundary.visitInsertionPoints(\n [](SILBasicBlock::iterator point) { point->dump(); });\n }\n};\n\n\/\/ Arguments: NONE\n\/\/ Dumps:\n\/\/ - the function\nstruct DumpFunction : UnitTest {\n DumpFunction(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override { getFunction()->dump(); }\n};\n\n\/\/ Arguments: NONE\n\/\/ Dumps: the index of the self argument of the current function\nstruct FunctionGetSelfArgumentIndex : UnitTest {\n FunctionGetSelfArgumentIndex(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto index =\n SILFunction_getSelfArgumentIndex(BridgedFunction{getFunction()});\n llvm::errs() << \"self argument index = \" << index << \"\\n\";\n }\n};\n\n\/\/ Arguments:\n\/\/ - instruction\n\/\/ Dumps:\n\/\/ - instruction\n\/\/ - whether it's a deinit barrier\nstruct IsDeinitBarrierTest : UnitTest {\n IsDeinitBarrierTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto *instruction = arguments.takeInstruction();\n auto *analysis = getAnalysis<BasicCalleeAnalysis>();\n auto isBarrier = isDeinitBarrier(instruction, analysis);\n instruction->dump();\n auto *boolString = isBarrier ? \"true\" : \"false\";\n llvm::errs() << boolString << \"\\n\";\n }\n};\n\nstruct ShrinkBorrowScopeTest : UnitTest {\n ShrinkBorrowScopeTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto instruction = arguments.takeValue();\n auto expected = arguments.takeBool();\n auto *bbi = cast<BeginBorrowInst>(instruction);\n auto *analysis = getAnalysis<BasicCalleeAnalysis>();\n SmallVector<CopyValueInst *, 4> modifiedCopyValueInsts;\n InstructionDeleter deleter(\n InstModCallbacks().onDelete([&](auto *instruction) {\n llvm::errs() << \"DELETED:\\n\";\n instruction->dump();\n }));\n auto shrunk =\n shrinkBorrowScope(*bbi, deleter, analysis, modifiedCopyValueInsts);\n unsigned index = 0;\n for (auto *cvi : modifiedCopyValueInsts) {\n auto expectedCopy = arguments.takeValue();\n llvm::errs() << \"rewritten copy \" << index << \":\\n\";\n llvm::errs() << \"expected:\\n\";\n expectedCopy->print(llvm::errs());\n llvm::errs() << \"got:\\n\";\n cvi->dump();\n assert(cvi == expectedCopy);\n ++index;\n }\n assert(expected == shrunk && \"didn't shrink expectedly!?\");\n }\n};\n\n\/\/\/ [new_tests] Add the new UnitTest subclass above this line.\n\nclass UnitTestRunner : public SILFunctionTransform {\n void printTestLifetime(bool begin, unsigned testIndex, unsigned testCount,\n StringRef name, ArrayRef<StringRef> components) {\n StringRef word = begin ? \"begin\" : \"end\";\n llvm::errs() << word << \" running test \" << testIndex + 1 << \" of \"\n << testCount << \" on \" << getFunction()->getName() << \": \"\n << name << \" with: \";\n for (unsigned long index = 0, size = components.size(); index < size;\n ++index) {\n llvm::errs() << components[index];\n if (index != size - 1) {\n llvm::errs() << \", \";\n }\n }\n llvm::errs() << \"\\n\";\n }\n\n template <typename Doit>\n void withTest(StringRef name, Doit doit) {\n#define ADD_UNIT_TEST_SUBCLASS(STRING, SUBCLASS) \\\n if (name == STRING) { \\\n SUBCLASS it{this}; \\\n doit(&it); \\\n return; \\\n }\n\n ADD_UNIT_TEST_SUBCLASS(\"dump-function\", DumpFunction)\n\n ADD_UNIT_TEST_SUBCLASS(\"test-specification-parsing\", TestSpecificationTest)\n ADD_UNIT_TEST_SUBCLASS(\"canonicalize-ossa-lifetime\",\n CanonicalizeOSSALifetimeTest)\n ADD_UNIT_TEST_SUBCLASS(\"visit-adjacent-reborrows-of-phi\",\n VisitAdjacentReborrowsOfPhiTest)\n ADD_UNIT_TEST_SUBCLASS(\"function-get-self-argument-index\",\n FunctionGetSelfArgumentIndex)\n ADD_UNIT_TEST_SUBCLASS(\n \"pruned-liveness-boundary-with-list-of-last-users-insertion-points\",\n PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest)\n ADD_UNIT_TEST_SUBCLASS(\"shrink-borrow-scope\", ShrinkBorrowScopeTest)\n ADD_UNIT_TEST_SUBCLASS(\"is-deinit-barrier\", IsDeinitBarrierTest)\n \/\/\/ [new_tests] Add the new mapping from string to subclass above this line.\n\n#undef ADD_UNIT_TEST_SUBCLASS\n }\n\n void runTest(StringRef name, Arguments &arguments) {\n withTest(name, [&](auto *test) { test->invoke(arguments); });\n }\n\n void run() override {\n llvm::SmallVector<std::string, 2> testSpecifications;\n getTestSpecifications(getFunction(), testSpecifications);\n Arguments arguments;\n SmallVector<StringRef, 4> components;\n for (unsigned long index = 0, size = testSpecifications.size();\n index < size; ++index) {\n components.clear();\n arguments.clear();\n auto testSpecification = testSpecifications[index];\n test::parseTestArgumentsFromSpecification(\n getFunction(), testSpecification, arguments, components);\n auto name = arguments.takeString();\n ArrayRef<StringRef> argumentStrings = components;\n argumentStrings = argumentStrings.drop_front();\n printTestLifetime(\/*begin=*\/true, \/*index=*\/index, \/*size=*\/size, name,\n argumentStrings);\n runTest(name, arguments);\n printTestLifetime(\/*begin=*\/false, \/*index=*\/index, \/*size=*\/size, name,\n argumentStrings);\n }\n }\n friend class UnitTest;\n};\n\ntemplate <typename Analysis>\nAnalysis *UnitTest::getAnalysis() {\n return pass->getAnalysis<Analysis>();\n}\n\nSILFunction *UnitTest::getFunction() { return getPass()->getFunction(); }\n\n} \/\/ anonymous namespace\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top Level Entry Point\n\/\/===----------------------------------------------------------------------===\/\/\n\nSILTransform *swift::createUnitTestRunner() { return new UnitTestRunner(); }\n<commit_msg>[Gardening] Tweaked comment.<commit_after>\/\/===------------------------ UnitTestRunner.cpp --------------------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2022 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ TO ADD A NEW TEST, search in this file for [new_tests]\n\/\/\n\/\/ Provides a mechanism for doing faux unit tests. The idea is to emulate the\n\/\/ basic functionality of calling a function and validating its results\/effects.\n\/\/\n\/\/ This is done via the test_specification instruction. Using one or more\n\/\/ instances of it in your function, you can specify which test (i.e. UnitTest\n\/\/ subclass) should be run and what arguments should be provided to it. The\n\/\/ test grabs the arguments it expects out of the test::Arguments instance it is\n\/\/ provided. It calls some function or functions. It then prints out\n\/\/ interesting results. These results can then be FileCheck'd.\n\/\/\n\/\/ CASE STUDY:\n\/\/ Here's an example of how it works:\n\/\/ 1) A test test\/SILOptimizer\/interesting_functionality.sil runs this pass:\n\/\/ \/\/ RUN: %target-sil-opt -unit-test-runner %s 2>&1 | %FileCheck %s\n\/\/ 2) A function in interesting_functionality.sil contains the\n\/\/ test_specification instruction.\n\/\/ sil @f : $() -> () {\n\/\/ ...\n\/\/ test_specification \"my-neato-utility 43 @trace[2] @function[other_fun]\"\n\/\/ ...\n\/\/ }\n\/\/ 3) UnitTestRunner sees the name \"my-neato-utility\", instantiates the\n\/\/ corresponding UnitTest subclass MyNeatoUtilityTest, and calls ::invoke()\n\/\/ on it, passing an test::Arguments that contains\n\/\/ (43 : unsigned long, someValue : SILValue, other_fun : SILFunction *)\n\/\/\n\/\/ 4) MyNeatoUtilityTest calls takeUInt(), takeValue(), and takeFunction() on\n\/\/ the test::Arguments instance.\n\/\/ auto count = arguments.takeUInt();\n\/\/ auto target = arguments.takeValue();\n\/\/ auto callee = arguments.takeFunction();\n\/\/ 5) MyNeatoUtilityTest calls myNeatoUtility, passing these values along.\n\/\/ myNeatoUtility(count, target, callee);\n\/\/ 6) MyNeatoUtilityTest then dumps out the current function, which was modified\n\/\/ in the process.\n\/\/ getFunction()->dump();\n\/\/ 7) The test file test\/SILOptimizer\/interesting_functionality.sil matches the\n\/\/ expected contents of the modified function:\n\/\/ \/\/ CHECK-LABEL: sil @f\n\/\/ \/\/ CHECK-NOT: function_ref @other_fun\n\/\/\n\/\/ [new_tests] TESTING MORE FUNCTIONALITY:\n\/\/\n\/\/ 1) Add a new UnitTest subclass.\n\/\/ - Add a constructor: NewTest(UnitTestRunner *pass) : UnitTest(pass) {}\n\/\/ - Implement invoke: void invoke(test::Arguments &arguments) override {...}\n\/\/ - Call the take{TYPE} methods to get the arguments you need.\n\/\/ - Call your function with those arguments.\n\/\/ 2) Add a new ADD_UNIT_TEST_SUBCLASS line.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/AST\/Type.h\"\n#include \"swift\/Basic\/TaggedUnion.h\"\n#include \"swift\/SIL\/PrunedLiveness.h\"\n#include \"swift\/SIL\/SILArgumentArrayRef.h\"\n#include \"swift\/SIL\/SILBasicBlock.h\"\n#include \"swift\/SIL\/SILBridging.h\"\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SIL\/SILInstruction.h\"\n#include \"swift\/SILOptimizer\/Analysis\/BasicCalleeAnalysis.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Passes.h\"\n#include \"swift\/SILOptimizer\/PassManager\/Transforms.h\"\n#include \"swift\/SILOptimizer\/Utils\/CanonicalizeBorrowScope.h\"\n#include \"swift\/SILOptimizer\/Utils\/CanonicalizeOSSALifetime.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstOptUtils.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstructionDeleter.h\"\n#include \"swift\/SILOptimizer\/Utils\/ParseTestSpecification.h\"\n#include \"llvm\/ADT\/StringRef.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include <iterator>\n#include <memory>\n\nusing namespace swift;\nusing namespace swift::test;\n\nnamespace {\n\nclass UnitTestRunner;\n\nclass UnitTest {\n UnitTestRunner *pass;\n\nprotected:\n template <typename Analysis>\n Analysis *getAnalysis();\n UnitTestRunner *getPass() { return pass; }\n SILFunction *getFunction();\n\npublic:\n UnitTest(UnitTestRunner *pass) : pass(pass){};\n virtual ~UnitTest() {}\n virtual void invoke(Arguments &arguments) = 0;\n};\n\n\/\/ Arguments:\n\/\/ - string: list of characters, each of which specifies subsequent arguments\n\/\/ - F: function\n\/\/ - B: block\n\/\/ - I: instruction\n\/\/ - V: value\n\/\/ - O: operand\n\/\/ - b: boolean\n\/\/ - u: unsigned\n\/\/ - s: string\n\/\/ - ...\n\/\/ - an argument of the type specified in the initial string\n\/\/ - ...\n\/\/ Dumps:\n\/\/ - for each argument (after the initial string)\n\/\/ - its type\n\/\/ - something to identify the instance (mostly this means calling dump)\nstruct TestSpecificationTest : UnitTest {\n TestSpecificationTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto expectedFields = arguments.takeString();\n for (auto expectedField : expectedFields) {\n switch (expectedField) {\n case 'F': {\n auto *function = arguments.takeFunction();\n llvm::errs() << \"function: \" << function->getName() << \"\\n\";\n break;\n }\n case 'B': {\n auto *block = arguments.takeBlock();\n llvm::errs() << \"block:\\n\";\n block->dump();\n break;\n }\n case 'I': {\n auto *instruction = arguments.takeInstruction();\n llvm::errs() << \"instruction: \";\n instruction->dump();\n break;\n }\n case 'V': {\n auto value = arguments.takeValue();\n llvm::errs() << \"value: \";\n value->dump();\n break;\n }\n case 'O': {\n auto *operand = arguments.takeOperand();\n llvm::errs() << \"operand: \";\n operand->print(llvm::errs());\n break;\n }\n case 'u': {\n auto u = arguments.takeUInt();\n llvm::errs() << \"uint: \" << u << \"\\n\";\n break;\n }\n case 'b': {\n auto b = arguments.takeBool();\n llvm::errs() << \"bool: \" << b << \"\\n\";\n break;\n }\n case 's': {\n auto s = arguments.takeString();\n llvm::errs() << \"string: \" << s << \"\\n\";\n break;\n }\n default:\n llvm_unreachable(\"unknown field type was expected?!\");\n }\n }\n }\n};\n\n\/\/ Arguments:\n\/\/ - bool: pruneDebug\n\/\/ - bool: maximizeLifetimes\n\/\/ - SILValue: value to canonicalize\n\/\/ Dumps:\n\/\/ - function after value canonicalization\nstruct CanonicalizeOSSALifetimeTest : UnitTest {\n CanonicalizeOSSALifetimeTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto *accessBlockAnalysis = getAnalysis<NonLocalAccessBlockAnalysis>();\n auto *dominanceAnalysis = getAnalysis<DominanceAnalysis>();\n DominanceInfo *domTree = dominanceAnalysis->get(getFunction());\n auto pruneDebug = arguments.takeBool();\n auto maximizeLifetimes = arguments.takeBool();\n InstructionDeleter deleter;\n CanonicalizeOSSALifetime canonicalizer(pruneDebug, maximizeLifetimes, accessBlockAnalysis,\n domTree, deleter);\n auto value = arguments.takeValue();\n canonicalizer.canonicalizeValueLifetime(value);\n getFunction()->dump();\n }\n};\n\n\/\/ Arguments:\n\/\/ - SILValue: phi\n\/\/ Dumps:\n\/\/ - function\n\/\/ - the adjacent phis\nstruct VisitAdjacentReborrowsOfPhiTest : UnitTest {\n VisitAdjacentReborrowsOfPhiTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n getFunction()->dump();\n visitAdjacentReborrowsOfPhi(cast<SILPhiArgument>(arguments.takeValue()),\n [](auto *argument) -> bool {\n argument->dump();\n return true;\n });\n }\n};\n\n\/\/ Arguments:\n\/\/ - variadic list of - instruction: a last user\n\/\/ Dumps:\n\/\/ - the insertion points\nstruct PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest : UnitTest {\n PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest(\n UnitTestRunner *pass)\n : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n PrunedLivenessBoundary boundary;\n while (arguments.hasUntaken()) {\n boundary.lastUsers.push_back(arguments.takeInstruction());\n }\n boundary.visitInsertionPoints(\n [](SILBasicBlock::iterator point) { point->dump(); });\n }\n};\n\n\/\/ Arguments: NONE\n\/\/ Dumps:\n\/\/ - the function\nstruct DumpFunction : UnitTest {\n DumpFunction(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override { getFunction()->dump(); }\n};\n\n\/\/ Arguments: NONE\n\/\/ Dumps: the index of the self argument of the current function\nstruct FunctionGetSelfArgumentIndex : UnitTest {\n FunctionGetSelfArgumentIndex(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto index =\n SILFunction_getSelfArgumentIndex(BridgedFunction{getFunction()});\n llvm::errs() << \"self argument index = \" << index << \"\\n\";\n }\n};\n\n\/\/ Arguments:\n\/\/ - instruction\n\/\/ Dumps:\n\/\/ - instruction\n\/\/ - whether it's a deinit barrier\nstruct IsDeinitBarrierTest : UnitTest {\n IsDeinitBarrierTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto *instruction = arguments.takeInstruction();\n auto *analysis = getAnalysis<BasicCalleeAnalysis>();\n auto isBarrier = isDeinitBarrier(instruction, analysis);\n instruction->dump();\n auto *boolString = isBarrier ? \"true\" : \"false\";\n llvm::errs() << boolString << \"\\n\";\n }\n};\n\nstruct ShrinkBorrowScopeTest : UnitTest {\n ShrinkBorrowScopeTest(UnitTestRunner *pass) : UnitTest(pass) {}\n void invoke(Arguments &arguments) override {\n auto instruction = arguments.takeValue();\n auto expected = arguments.takeBool();\n auto *bbi = cast<BeginBorrowInst>(instruction);\n auto *analysis = getAnalysis<BasicCalleeAnalysis>();\n SmallVector<CopyValueInst *, 4> modifiedCopyValueInsts;\n InstructionDeleter deleter(\n InstModCallbacks().onDelete([&](auto *instruction) {\n llvm::errs() << \"DELETED:\\n\";\n instruction->dump();\n }));\n auto shrunk =\n shrinkBorrowScope(*bbi, deleter, analysis, modifiedCopyValueInsts);\n unsigned index = 0;\n for (auto *cvi : modifiedCopyValueInsts) {\n auto expectedCopy = arguments.takeValue();\n llvm::errs() << \"rewritten copy \" << index << \":\\n\";\n llvm::errs() << \"expected:\\n\";\n expectedCopy->print(llvm::errs());\n llvm::errs() << \"got:\\n\";\n cvi->dump();\n assert(cvi == expectedCopy);\n ++index;\n }\n assert(expected == shrunk && \"didn't shrink expectedly!?\");\n }\n};\n\n\/\/\/ [new_tests] Add the new UnitTest subclass above this line.\n\nclass UnitTestRunner : public SILFunctionTransform {\n void printTestLifetime(bool begin, unsigned testIndex, unsigned testCount,\n StringRef name, ArrayRef<StringRef> components) {\n StringRef word = begin ? \"begin\" : \"end\";\n llvm::errs() << word << \" running test \" << testIndex + 1 << \" of \"\n << testCount << \" on \" << getFunction()->getName() << \": \"\n << name << \" with: \";\n for (unsigned long index = 0, size = components.size(); index < size;\n ++index) {\n llvm::errs() << components[index];\n if (index != size - 1) {\n llvm::errs() << \", \";\n }\n }\n llvm::errs() << \"\\n\";\n }\n\n template <typename Doit>\n void withTest(StringRef name, Doit doit) {\n#define ADD_UNIT_TEST_SUBCLASS(STRING, SUBCLASS) \\\n if (name == STRING) { \\\n SUBCLASS it{this}; \\\n doit(&it); \\\n return; \\\n }\n\n ADD_UNIT_TEST_SUBCLASS(\"dump-function\", DumpFunction)\n\n ADD_UNIT_TEST_SUBCLASS(\"test-specification-parsing\", TestSpecificationTest)\n ADD_UNIT_TEST_SUBCLASS(\"canonicalize-ossa-lifetime\",\n CanonicalizeOSSALifetimeTest)\n ADD_UNIT_TEST_SUBCLASS(\"visit-adjacent-reborrows-of-phi\",\n VisitAdjacentReborrowsOfPhiTest)\n ADD_UNIT_TEST_SUBCLASS(\"function-get-self-argument-index\",\n FunctionGetSelfArgumentIndex)\n ADD_UNIT_TEST_SUBCLASS(\n \"pruned-liveness-boundary-with-list-of-last-users-insertion-points\",\n PrunedLivenessBoundaryWithListOfLastUsersInsertionPointsTest)\n ADD_UNIT_TEST_SUBCLASS(\"shrink-borrow-scope\", ShrinkBorrowScopeTest)\n ADD_UNIT_TEST_SUBCLASS(\"is-deinit-barrier\", IsDeinitBarrierTest)\n \/\/\/ [new_tests] Add the new mapping from string to subclass above this line.\n\n#undef ADD_UNIT_TEST_SUBCLASS\n }\n\n void runTest(StringRef name, Arguments &arguments) {\n withTest(name, [&](auto *test) { test->invoke(arguments); });\n }\n\n void run() override {\n llvm::SmallVector<std::string, 2> testSpecifications;\n getTestSpecifications(getFunction(), testSpecifications);\n Arguments arguments;\n SmallVector<StringRef, 4> components;\n for (unsigned long index = 0, size = testSpecifications.size();\n index < size; ++index) {\n components.clear();\n arguments.clear();\n auto testSpecification = testSpecifications[index];\n test::parseTestArgumentsFromSpecification(\n getFunction(), testSpecification, arguments, components);\n auto name = arguments.takeString();\n ArrayRef<StringRef> argumentStrings = components;\n argumentStrings = argumentStrings.drop_front();\n printTestLifetime(\/*begin=*\/true, \/*index=*\/index, \/*size=*\/size, name,\n argumentStrings);\n runTest(name, arguments);\n printTestLifetime(\/*begin=*\/false, \/*index=*\/index, \/*size=*\/size, name,\n argumentStrings);\n }\n }\n friend class UnitTest;\n};\n\ntemplate <typename Analysis>\nAnalysis *UnitTest::getAnalysis() {\n return pass->getAnalysis<Analysis>();\n}\n\nSILFunction *UnitTest::getFunction() { return getPass()->getFunction(); }\n\n} \/\/ anonymous namespace\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ Top Level Entry Point\n\/\/===----------------------------------------------------------------------===\/\/\n\nSILTransform *swift::createUnitTestRunner() { return new UnitTestRunner(); }\n<|endoftext|>"} {"text":"<commit_before>\/*\n** This file is part of libyuni, a cross-platform C++ framework (http:\/\/libyuni.org).\n**\n** This Source Code Form is subject to the terms of the Mozilla Public License\n** v.2.0. If a copy of the MPL was not distributed with this file, You can\n** obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n**\n** github: https:\/\/github.com\/libyuni\/libyuni\/\n** gitlab: https:\/\/gitlab.com\/libyuni\/libyuni\/ (mirror)\n*\/\n#pragma once\n#include \"traits.h\"\n\n\n\nnamespace Yuni\n{\nnamespace Private\n{\nnamespace CStringImpl\n{\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::Data() :\n\t\tsize(),\n\t\tcapacity(),\n\t\tdata(NULL)\n\t{}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tData<ChunkSizeT,ExpandableT>::Data(const Data<ChunkSizeT,ExpandableT>& rhs) :\n\t\tsize(rhs.size),\n\t\tcapacity(rhs.size),\n\t\tdata(NULL)\n\t{\n\t\tif (size)\n\t\t{\n\t\t\tif (chunkSize != 0)\n\t\t\t{\n\t\t\t\tcapacity += static_cast<uint>(zeroTerminated);\n\t\t\t\tdata = reinterpret_cast<C*>(::malloc(sizeof(C) * static_cast<uint>(capacity)));\n\t\t\t\tYUNI_MEMCPY(const_cast<void*>(static_cast<const void*>(data)), static_cast<uint>(capacity), rhs.data, sizeof(C) * size);\n\t\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ this string is a string adapter\n\t\t\t\tdata = rhs.data;\n\t\t\t}\n\t\t}\n\t}\n\n\n\t# ifdef YUNI_HAS_CPP_MOVE\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::Data(Data&& rhs) :\n\t\tsize(rhs.size),\n\t\tcapacity(rhs.size),\n\t\tdata(rhs.data)\n\t{\n\t\trhs.size = 0;\n\t\trhs.capacity = 0;\n\t\trhs.data = nullptr;\n\t}\n\t# endif\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::~Data()\n\t{\n\t\t\/\/ Release the internal buffer if allocated\n\t\t\/\/ The string is a string adapter only if the chunk size if null\n\t\t\/\/ When the string is an adapter, the variable is const\n\t\tif (chunkSize != 0)\n\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\t}\n\n\n\t# ifdef YUNI_HAS_CPP_MOVE\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>& Data<ChunkSizeT,ExpandableT>::operator = (Data&& rhs)\n\t{\n\t\t\/\/ Release the internal buffer if allocated\n\t\t\/\/ The string is a string adapter only if the chunk size if null\n\t\t\/\/ When the string is an adapter, the variable is const\n\t\tif (chunkSize != 0)\n\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\n\t\tsize = rhs.size;\n\t\tcapacity = rhs.capacity;\n\t\tdata = rhs.data;\n\n\t\trhs.size = 0;\n\t\trhs.capacity = 0;\n\t\trhs.data = nullptr;\n\t\treturn *this;\n\t}\n\t# endif\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::adapt(const char* const cstring)\n\t{\n\t\tdata = const_cast<char*>(cstring);\n\t\tcapacity = size = (data ? static_cast<Size>(::strlen(data)) : 0);\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::adapt(const char* const cstring, Size length)\n\t{\n\t\tdata = const_cast<char*>(cstring);\n\t\tcapacity = size = length;\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::clear()\n\t{\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tsize = 0;\n\t\t\t\t*(const_cast<char*>(data)) = C();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tsize = 0;\n\t}\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::forgetContent()\n\t{\n\t\tcapacity = 0;\n\t\tdata = nullptr; \/\/ forget me !\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tsize = 0;\n\t\t\t\t*(const_cast<char*>(data)) = C();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tsize = 0;\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::shrink()\n\t{\n\t\tif (data)\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tcapacity = size + static_cast<uint>(zeroTerminated);\n\t\t\t\tdata = reinterpret_cast<char*>(::realloc(const_cast<char*>(data), static_cast<uint>(capacity)));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcapacity = 0;\n\t\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\t\t\t\tdata = nullptr;\n\t\t\t}\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::insert(Size offset, const C* const buffer, const Size len)\n\t{\n\t\t\/\/ Reserving enough space to insert the buffer\n\t\treserve(len + size + static_cast<uint>(zeroTerminated));\n\t\t\/\/ Move the existing block of data\n\t\t(void)::memmove(const_cast<char*>(data) + sizeof(C) * (offset + len),\n\t\t\tconst_cast<char*>(data) + sizeof(C) * (offset), sizeof(C) * (size - offset));\n\t\t\/\/ Copying the given buffer\n\t\tYUNI_MEMCPY(const_cast<char*>(data) + sizeof(C) * (offset), static_cast<uint>(capacity), buffer, sizeof(C) * len);\n\t\t\/\/ Updating the size\n\t\tsize += len;\n\t\t\/\/ zero-terminated\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::put(const C rhs)\n\t{\n\t\t\/\/ Making sure that we have enough space\n\t\treserve(size + 1 + static_cast<uint>(zeroTerminated));\n\t\t\/\/ Raw copy\n\t\t(const_cast<char*>(data))[size] = rhs;\n\t\t\/\/ New size\n\t\t++size;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tvoid\n\tData<ChunkSizeT,ExpandableT>::reserve(Size mincapacity)\n\t{\n\t\tif (adapter)\n\t\t\treturn;\n\t\tmincapacity += static_cast<uint>(zeroTerminated);\n\t\tif (static_cast<uint>(capacity) < mincapacity)\n\t\t{\n\t\t\t\/\/ This loop may be a little faster than the following replacement code :\n\t\t\t\/\/ static_cast<uint>(capacity) = minstatic_cast<uint>(capacity) + minstatic_cast<uint>(capacity) % chunkSize;\n\t\t\t\/\/ Especially when chunkSize is not a power of 2\n\t\t\tSize newcapacity = static_cast<uint>(capacity);\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ Increase the static_cast<uint>(capacity) until we have enough space\n\t\t\t\tnewcapacity += chunkSize;\n\t\t\t}\n\t\t\twhile (newcapacity < mincapacity);\n\n\t\t\t\/\/ Realloc the internal buffer\n\t\t\tC* newdata = reinterpret_cast<C*>(::realloc(const_cast<char*>(data), (sizeof(C) * newcapacity)));\n\t\t\t\/\/ The returned value can be NULL\n\t\t\tif (!newdata)\n\t\t\t\tthrow \"Yuni::CString: Impossible to realloc\";\n\t\t\t{\n\t\t\t\tdata = newdata;\n\t\t\t\tcapacity = newcapacity;\n\t\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\t}\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::assignWithoutChecking(const C* const block,\n\t\tSize blockSize)\n\t{\n\t\t\/\/ We have to trunk the size if we are outer limits\n\t\t\/\/ This condition is a little faster than the folowing replacement code :\n\t\t\/\/ blockSize = Math::Min<Size>(blockSize, static_cast<uint>(capacity) - size);\n\t\t\/\/\n\t\t\/\/ We have better performance if the two cases have their own code block\n\t\t\/\/ (perhaps because of the constant values)\n\t\t\/\/\n\t\tif (blockSize > static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ The new blocksize is actually the static_cast<uint>(capacity) itself\n\t\t\t\/\/ The static_cast<uint>(capacity) can not be null\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(const_cast<char*>(data), static_cast<uint>(capacity), block, sizeof(C) * static_cast<uint>(capacity));\n\t\t\t\/\/ New size\n\t\t\tsize = static_cast<uint>(capacity);\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[static_cast<uint>(capacity)] = C();\n\t\t\treturn static_cast<uint>(capacity);\n\t\t}\n\t\t\/\/ else\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(const_cast<char*>(data), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize = blockSize;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::appendWithoutChecking(const C* const block, Size blockSize)\n\t{\n\t\t\/\/ We have to trunk the size if we are outer limits\n\t\t\/\/ This condition is a little faster than the folowing replacement code :\n\t\t\/\/ blockSize = Math::Min<Size>(blockSize, static_cast<uint>(capacity) - size);\n\t\t\/\/\n\t\t\/\/ We have better performance if the two cases have their own code block\n\t\t\/\/ (perhaps because of the constant values)\n\t\t\/\/\n\t\tif (blockSize + size > static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ Computing the new block size to copy\n\t\t\tblockSize = static_cast<uint>(capacity) - size;\n\t\t\t\/\/ The performance are a bit better if we interupt the process sooner\n\t\t\tif (!blockSize)\n\t\t\t\treturn 0;\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(data + size * sizeof(C), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize = static_cast<uint>(capacity);\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[static_cast<uint>(capacity)] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t\t\/\/ else\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(data + size * sizeof(C), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize += blockSize;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tinline typename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::assignWithoutChecking(const C c)\n\t{\n\t\tdata[0] = c;\n\t\tsize = 1;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[1] = C();\n\t\treturn 1;\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::appendWithoutChecking(const C c)\n\t{\n\t\tif (YUNI_UNLIKELY(size == static_cast<uint>(capacity)))\n\t\t\treturn 0;\n\n\t\tdata[size] = c;\n\t\t++size;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t\treturn 1;\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tvoid\n\tData<ChunkSizeT,false>::put(const C rhs)\n\t{\n\t\t\/\/ Making sure that we have enough space\n\t\tif (size != static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tdata[size] = rhs;\n\t\t\t\/\/ New size\n\t\t\t++size;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tvoid Data<ChunkSizeT,false>::swap(Data<ChunkSizeT,false>& rhs)\n\t{\n\t\tData<ChunkSizeT,false> tmp(*this);\n\t\tassignWithoutChecking(rhs.data, rhs.size);\n\t\trhs.assignWithoutChecking(tmp.data, tmp.size);\n\t}\n\n\n\n} \/\/ namespace CStringImpl\n} \/\/ namespace Private\n} \/\/ namespace Yuni\n<commit_msg>String::forgetContent: fixed invalid write to null pointer<commit_after>\/*\n** This file is part of libyuni, a cross-platform C++ framework (http:\/\/libyuni.org).\n**\n** This Source Code Form is subject to the terms of the Mozilla Public License\n** v.2.0. If a copy of the MPL was not distributed with this file, You can\n** obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n**\n** github: https:\/\/github.com\/libyuni\/libyuni\/\n** gitlab: https:\/\/gitlab.com\/libyuni\/libyuni\/ (mirror)\n*\/\n#pragma once\n#include \"traits.h\"\n\n\n\nnamespace Yuni\n{\nnamespace Private\n{\nnamespace CStringImpl\n{\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::Data() :\n\t\tsize(),\n\t\tcapacity(),\n\t\tdata(NULL)\n\t{}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tData<ChunkSizeT,ExpandableT>::Data(const Data<ChunkSizeT,ExpandableT>& rhs) :\n\t\tsize(rhs.size),\n\t\tcapacity(rhs.size),\n\t\tdata(NULL)\n\t{\n\t\tif (size)\n\t\t{\n\t\t\tif (chunkSize != 0)\n\t\t\t{\n\t\t\t\tcapacity += static_cast<uint>(zeroTerminated);\n\t\t\t\tdata = reinterpret_cast<C*>(::malloc(sizeof(C) * static_cast<uint>(capacity)));\n\t\t\t\tYUNI_MEMCPY(const_cast<void*>(static_cast<const void*>(data)), static_cast<uint>(capacity), rhs.data, sizeof(C) * size);\n\t\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ this string is a string adapter\n\t\t\t\tdata = rhs.data;\n\t\t\t}\n\t\t}\n\t}\n\n\n\t# ifdef YUNI_HAS_CPP_MOVE\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::Data(Data&& rhs) :\n\t\tsize(rhs.size),\n\t\tcapacity(rhs.size),\n\t\tdata(rhs.data)\n\t{\n\t\trhs.size = 0;\n\t\trhs.capacity = 0;\n\t\trhs.data = nullptr;\n\t}\n\t# endif\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>::~Data()\n\t{\n\t\t\/\/ Release the internal buffer if allocated\n\t\t\/\/ The string is a string adapter only if the chunk size if null\n\t\t\/\/ When the string is an adapter, the variable is const\n\t\tif (chunkSize != 0)\n\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\t}\n\n\n\t# ifdef YUNI_HAS_CPP_MOVE\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline Data<ChunkSizeT,ExpandableT>& Data<ChunkSizeT,ExpandableT>::operator = (Data&& rhs)\n\t{\n\t\t\/\/ Release the internal buffer if allocated\n\t\t\/\/ The string is a string adapter only if the chunk size if null\n\t\t\/\/ When the string is an adapter, the variable is const\n\t\tif (chunkSize != 0)\n\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\n\t\tsize = rhs.size;\n\t\tcapacity = rhs.capacity;\n\t\tdata = rhs.data;\n\n\t\trhs.size = 0;\n\t\trhs.capacity = 0;\n\t\trhs.data = nullptr;\n\t\treturn *this;\n\t}\n\t# endif\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::adapt(const char* const cstring)\n\t{\n\t\tdata = const_cast<char*>(cstring);\n\t\tcapacity = size = (data ? static_cast<Size>(::strlen(data)) : 0);\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::adapt(const char* const cstring, Size length)\n\t{\n\t\tdata = const_cast<char*>(cstring);\n\t\tcapacity = size = length;\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::clear()\n\t{\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tsize = 0;\n\t\t\t\t*(const_cast<char*>(data)) = C();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tsize = 0;\n\t}\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::forgetContent()\n\t{\n\t\tcapacity = 0;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tsize = 0;\n\t\t\t\t*(const_cast<char*>(data)) = C();\n\t\t\t}\n\t\t}\n\t\telse\n\t\t\tsize = 0;\n\t\tdata = nullptr; \/\/ forget me !\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::shrink()\n\t{\n\t\tif (data)\n\t\t{\n\t\t\tif (size)\n\t\t\t{\n\t\t\t\tcapacity = size + static_cast<uint>(zeroTerminated);\n\t\t\t\tdata = reinterpret_cast<char*>(::realloc(const_cast<char*>(data), static_cast<uint>(capacity)));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcapacity = 0;\n\t\t\t\t::free(const_cast<void*>(static_cast<const void*>(data)));\n\t\t\t\tdata = nullptr;\n\t\t\t}\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::insert(Size offset, const C* const buffer, const Size len)\n\t{\n\t\t\/\/ Reserving enough space to insert the buffer\n\t\treserve(len + size + static_cast<uint>(zeroTerminated));\n\t\t\/\/ Move the existing block of data\n\t\t(void)::memmove(const_cast<char*>(data) + sizeof(C) * (offset + len),\n\t\t\tconst_cast<char*>(data) + sizeof(C) * (offset), sizeof(C) * (size - offset));\n\t\t\/\/ Copying the given buffer\n\t\tYUNI_MEMCPY(const_cast<char*>(data) + sizeof(C) * (offset), static_cast<uint>(capacity), buffer, sizeof(C) * len);\n\t\t\/\/ Updating the size\n\t\tsize += len;\n\t\t\/\/ zero-terminated\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tinline void\n\tData<ChunkSizeT,ExpandableT>::put(const C rhs)\n\t{\n\t\t\/\/ Making sure that we have enough space\n\t\treserve(size + 1 + static_cast<uint>(zeroTerminated));\n\t\t\/\/ Raw copy\n\t\t(const_cast<char*>(data))[size] = rhs;\n\t\t\/\/ New size\n\t\t++size;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t}\n\n\n\ttemplate<uint ChunkSizeT, bool ExpandableT>\n\tvoid\n\tData<ChunkSizeT,ExpandableT>::reserve(Size mincapacity)\n\t{\n\t\tif (adapter)\n\t\t\treturn;\n\t\tmincapacity += static_cast<uint>(zeroTerminated);\n\t\tif (static_cast<uint>(capacity) < mincapacity)\n\t\t{\n\t\t\t\/\/ This loop may be a little faster than the following replacement code :\n\t\t\t\/\/ static_cast<uint>(capacity) = minstatic_cast<uint>(capacity) + minstatic_cast<uint>(capacity) % chunkSize;\n\t\t\t\/\/ Especially when chunkSize is not a power of 2\n\t\t\tSize newcapacity = static_cast<uint>(capacity);\n\t\t\tdo\n\t\t\t{\n\t\t\t\t\/\/ Increase the static_cast<uint>(capacity) until we have enough space\n\t\t\t\tnewcapacity += chunkSize;\n\t\t\t}\n\t\t\twhile (newcapacity < mincapacity);\n\n\t\t\t\/\/ Realloc the internal buffer\n\t\t\tC* newdata = reinterpret_cast<C*>(::realloc(const_cast<char*>(data), (sizeof(C) * newcapacity)));\n\t\t\t\/\/ The returned value can be NULL\n\t\t\tif (!newdata)\n\t\t\t\tthrow \"Yuni::CString: Impossible to realloc\";\n\t\t\t{\n\t\t\t\tdata = newdata;\n\t\t\t\tcapacity = newcapacity;\n\t\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\t}\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::assignWithoutChecking(const C* const block,\n\t\tSize blockSize)\n\t{\n\t\t\/\/ We have to trunk the size if we are outer limits\n\t\t\/\/ This condition is a little faster than the folowing replacement code :\n\t\t\/\/ blockSize = Math::Min<Size>(blockSize, static_cast<uint>(capacity) - size);\n\t\t\/\/\n\t\t\/\/ We have better performance if the two cases have their own code block\n\t\t\/\/ (perhaps because of the constant values)\n\t\t\/\/\n\t\tif (blockSize > static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ The new blocksize is actually the static_cast<uint>(capacity) itself\n\t\t\t\/\/ The static_cast<uint>(capacity) can not be null\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(const_cast<char*>(data), static_cast<uint>(capacity), block, sizeof(C) * static_cast<uint>(capacity));\n\t\t\t\/\/ New size\n\t\t\tsize = static_cast<uint>(capacity);\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[static_cast<uint>(capacity)] = C();\n\t\t\treturn static_cast<uint>(capacity);\n\t\t}\n\t\t\/\/ else\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(const_cast<char*>(data), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize = blockSize;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::appendWithoutChecking(const C* const block, Size blockSize)\n\t{\n\t\t\/\/ We have to trunk the size if we are outer limits\n\t\t\/\/ This condition is a little faster than the folowing replacement code :\n\t\t\/\/ blockSize = Math::Min<Size>(blockSize, static_cast<uint>(capacity) - size);\n\t\t\/\/\n\t\t\/\/ We have better performance if the two cases have their own code block\n\t\t\/\/ (perhaps because of the constant values)\n\t\t\/\/\n\t\tif (blockSize + size > static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ Computing the new block size to copy\n\t\t\tblockSize = static_cast<uint>(capacity) - size;\n\t\t\t\/\/ The performance are a bit better if we interupt the process sooner\n\t\t\tif (!blockSize)\n\t\t\t\treturn 0;\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(data + size * sizeof(C), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize = static_cast<uint>(capacity);\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[static_cast<uint>(capacity)] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t\t\/\/ else\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tYUNI_MEMCPY(data + size * sizeof(C), static_cast<uint>(capacity), block, sizeof(C) * blockSize);\n\t\t\t\/\/ New size\n\t\t\tsize += blockSize;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t\treturn blockSize;\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tinline typename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::assignWithoutChecking(const C c)\n\t{\n\t\tdata[0] = c;\n\t\tsize = 1;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[1] = C();\n\t\treturn 1;\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\ttypename Data<ChunkSizeT,false>::Size\n\tData<ChunkSizeT,false>::appendWithoutChecking(const C c)\n\t{\n\t\tif (YUNI_UNLIKELY(size == static_cast<uint>(capacity)))\n\t\t\treturn 0;\n\n\t\tdata[size] = c;\n\t\t++size;\n\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t(const_cast<char*>(data))[size] = C();\n\t\treturn 1;\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tvoid\n\tData<ChunkSizeT,false>::put(const C rhs)\n\t{\n\t\t\/\/ Making sure that we have enough space\n\t\tif (size != static_cast<uint>(capacity))\n\t\t{\n\t\t\t\/\/ Raw copy\n\t\t\tdata[size] = rhs;\n\t\t\t\/\/ New size\n\t\t\t++size;\n\t\t\tif (static_cast<uint>(zeroTerminated))\n\t\t\t\t(const_cast<char*>(data))[size] = C();\n\t\t}\n\t}\n\n\n\ttemplate<uint ChunkSizeT>\n\tvoid Data<ChunkSizeT,false>::swap(Data<ChunkSizeT,false>& rhs)\n\t{\n\t\tData<ChunkSizeT,false> tmp(*this);\n\t\tassignWithoutChecking(rhs.data, rhs.size);\n\t\trhs.assignWithoutChecking(tmp.data, tmp.size);\n\t}\n\n\n\n} \/\/ namespace CStringImpl\n} \/\/ namespace Private\n} \/\/ namespace Yuni\n<|endoftext|>"} {"text":"<commit_before>#include \"gl\/mesh_loader.hpp\"\n#include \"core\/debug\/assert.hpp\"\n#include \"core\/core.hpp\"\n#include \"core\/resource_manager.hpp\"\n\nnamespace tz::gl\n{\n\ttz::gl::IndexedMesh load_mesh(const std::string& filename)\n\t{\n\t\tstd::string full_path = tz::core::res().get_path() + filename;\n\t\ttz::ext::assimp::Scene scene{full_path};\n\t\ttopaz_assert(scene.size_meshes() == 1, \"tz::gl::load_mesh(\", full_path, \"): File must contain exactly one mesh to be loaded this way. This file contains \", scene.size_meshes(), \" meshes...\");\n\t\tconst aiMesh* ass_mesh = scene.get_mesh();\n\t\t\n\t\ttz::gl::IndexedMesh mesh;\n\n\t\t\/\/ Chuck in all those vertices\n\t\tfor(unsigned int i = 0; i < ass_mesh->mNumVertices; i++)\n\t\t{\n\t\t\ttz::gl::Vertex v;\n\t\t\tconst aiVector3D& pos = ass_mesh->mVertices[i];\n\t\t\tv.position = {{pos.x, pos.y, pos.z}};\n\n\t\t\tif(ass_mesh->HasTextureCoords(i))\n\t\t\t{\n\t\t\t\tconst aiVector3D* texcoord = ass_mesh->mTextureCoords[i];\n\t\t\t\tv.texcoord = {{texcoord->x, texcoord->y}};\n\t\t\t}\n\n\t\t\tconst aiVector3D& norm = ass_mesh->mNormals[i];\n\t\t\tv.normal = {{norm.x, norm.y, norm.z}};\n\n\t\t\tconst aiVector3D& tang = ass_mesh->mTangents[i];\n\t\t\tv.tangent = {{tang.x, tang.y, tang.z}};\n\n\t\t\tconst aiVector3D& bitang = ass_mesh->mBitangents[i];\n\t\t\tv.bitangent = {{bitang.x, bitang.y, bitang.z}};\n\n\t\t\tmesh.vertices.push_back(std::move(v));\n\t\t}\n\n\t\tfor(unsigned int i = 0; i < ass_mesh->mNumFaces; i++)\n\t\t{\n\t\t\tconst aiFace& face = ass_mesh->mFaces[i];\n\t\t\tmesh.indices.push_back(face.mIndices[0]);\n\t\t\tmesh.indices.push_back(face.mIndices[1]);\n\t\t\tmesh.indices.push_back(face.mIndices[2]);\n\t\t}\n\n\t\treturn mesh;\n\t}\n}<commit_msg>* Fixed an issue where texcoords were not being imported properly from mesh_loader<commit_after>#include \"gl\/mesh_loader.hpp\"\n#include \"core\/debug\/assert.hpp\"\n#include \"core\/core.hpp\"\n#include \"core\/resource_manager.hpp\"\n\nnamespace tz::gl\n{\n\ttz::gl::IndexedMesh load_mesh(const std::string& filename)\n\t{\n\t\tstd::string full_path = tz::core::res().get_path() + filename;\n\t\ttz::ext::assimp::Scene scene{full_path};\n\t\ttopaz_assert(scene.size_meshes() == 1, \"tz::gl::load_mesh(\", full_path, \"): File must contain exactly one mesh to be loaded this way. This file contains \", scene.size_meshes(), \" meshes...\");\n\t\tconst aiMesh* ass_mesh = scene.get_mesh();\n\t\t\n\t\ttz::gl::IndexedMesh mesh;\n\t\t#if TOPAZ_DEBUG\n\t\tstd::vector<tz::Vec2> debug_texcoord_list;\n\t\t#endif\n\n\t\t\/\/ Chuck in all those vertices\n\t\tfor(unsigned int i = 0; i < ass_mesh->mNumVertices; i++)\n\t\t{\n\t\t\ttz::gl::Vertex v;\n\t\t\tconst aiVector3D& pos = ass_mesh->mVertices[i];\n\t\t\tv.position = {{pos.x, pos.y, pos.z}};\n\n\t\t\tif(ass_mesh->HasTextureCoords(0))\n\t\t\t{\n\t\t\t\taiVector3D texcoord = ass_mesh->mTextureCoords[0][i];\n\t\t\t\tv.texcoord = {{texcoord.x, texcoord.y}};\n\t\t\t\t#if TOPAZ_DEBUG\n\t\t\t\tdebug_texcoord_list.push_back(v.texcoord);\n\t\t\t\t#endif\n\t\t\t}\n\n\t\t\tconst aiVector3D& norm = ass_mesh->mNormals[i];\n\t\t\tv.normal = {{norm.x, norm.y, norm.z}};\n\n\t\t\tconst aiVector3D& tang = ass_mesh->mTangents[i];\n\t\t\tv.tangent = {{tang.x, tang.y, tang.z}};\n\n\t\t\tconst aiVector3D& bitang = ass_mesh->mBitangents[i];\n\t\t\tv.bitangent = {{bitang.x, bitang.y, bitang.z}};\n\n\t\t\tmesh.vertices.push_back(std::move(v));\n\t\t}\n\n\t\tfor(unsigned int i = 0; i < ass_mesh->mNumFaces; i++)\n\t\t{\n\t\t\tconst aiFace& face = ass_mesh->mFaces[i];\n\t\t\tmesh.indices.push_back(face.mIndices[0]);\n\t\t\tmesh.indices.push_back(face.mIndices[1]);\n\t\t\tmesh.indices.push_back(face.mIndices[2]);\n\t\t}\n\n\t\treturn mesh;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: labelexp.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: jp $ $Date: 2001-11-14 16:32:50 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PRECOMPILED\n#include \"ui_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_TEXT_XTEXTFIELDSSUPPLIER_HPP_\n#include <com\/sun\/star\/text\/XTextFieldsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XREFRESHABLE_HPP_\n#include <com\/sun\/star\/util\/XRefreshable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _SWTYPES_HXX\n#include <swtypes.hxx>\n#endif\n#ifndef _LABFMT_HXX\n#include <labfmt.hxx>\n#endif\n#ifndef _UNOTOOLS_HXX\n#include <unotools.hxx>\n#endif\n#ifndef _UNOATXT_HXX \/\/autogen wg. SwXAutoTextEntry\n#include <unoatxt.hxx>\n#endif\n#ifndef _UNOOBJ_HXX \/\/\n#include <unoobj.hxx>\n#endif\n#ifndef _UNOPRNMS_HXX \/\/\n#include <unoprnms.hxx>\n#endif\n\n\nusing namespace ::com::sun::star;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::container;\nusing namespace com::sun::star::uno;\nusing namespace ::comphelper;\nusing namespace ::rtl;\n\n#define C2U(char) rtl::OUString::createFromAscii(char)\n\n\/* -----------------08.07.99 15:15-------------------\n\n --------------------------------------------------*\/\nvoid SwVisitingCardPage::InitFrameControl()\n{\n Link aLink(LINK(this, SwVisitingCardPage, FrameControlInitializedHdl));\n pExampleFrame = new SwOneExampleFrame( aExampleWIN,\n EX_SHOW_BUSINESS_CARDS, &aLink );\n\n uno::Reference< lang::XMultiServiceFactory > xMgr =\n getProcessServiceFactory();\n \/\/now the AutoText ListBoxes have to be filled\n\n uno::Reference< uno::XInterface > xAText =\n xMgr->createInstance( C2U(\"com.sun.star.text.AutoTextContainer\") );\n _xAutoText = uno::Reference< container::XNameAccess >(xAText, uno::UNO_QUERY);\n\n uno::Sequence<OUString> aNames = _xAutoText->getElementNames();\n const OUString* pGroups = aNames.getConstArray();\n OUString uTitleName( C2U(SW_PROP_NAME_STR(UNO_NAME_TITLE)) );\n\n for(sal_uInt16 i = 0; i < aNames.getLength(); i++)\n {\n uno::Any aGroup = _xAutoText->getByName(pGroups[i]);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n uno::Reference< container::XIndexAccess > xIdxAcc(xGroup, uno::UNO_QUERY);\n if(!xIdxAcc.is() || xIdxAcc->getCount())\n {\n uno::Reference< beans::XPropertySet > xPrSet(xGroup, uno::UNO_QUERY);\n uno::Any aTitle = xPrSet->getPropertyValue( uTitleName );\n OUString uTitle;\n aTitle >>= uTitle;\n String sGroup(pGroups[i]);\n sal_uInt16 nEntry = aAutoTextGroupLB.InsertEntry(uTitle);\n aAutoTextGroupLB.SetEntryData(nEntry, new String(sGroup));\n }\n }\n if(aAutoTextGroupLB.GetEntryCount())\n {\n if(LISTBOX_ENTRY_NOTFOUND == aAutoTextGroupLB.GetSelectEntryPos())\n aAutoTextGroupLB.SelectEntryPos(0);\n String sCurGroupName(\n *(String*)aAutoTextGroupLB.GetEntryData(aAutoTextGroupLB.GetSelectEntryPos()));\n if(_xAutoText->hasByName(sCurGroupName))\n {\n uno::Any aGroup = _xAutoText->getByName(sCurGroupName);\n try\n {\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n uno::Sequence< OUString > aBlockNames = xGroup->getElementNames();\n uno::Sequence< OUString > aTitles = xGroup->getTitles() ;\n\n SetUserData( aBlockNames.getLength(), aTitles.getConstArray(),\n aBlockNames.getConstArray() );\n }\n catch( uno::RuntimeException& )\n {\n \/\/ we'll be her if path settings were wrong\n }\n }\n }\n}\n\/* -----------------01.10.99 13:19-------------------\n\n --------------------------------------------------*\/\nIMPL_LINK( SwVisitingCardPage, FrameControlInitializedHdl, void*, EMPTYARG )\n{\n SvLBoxEntry* pSel = aAutoTextLB.FirstSelected();\n String sEntry;\n if( pSel )\n sEntry = *(String*)pSel->GetUserData();\n uno::Reference< text::XTextCursor > & xCrsr = pExampleFrame->GetTextCursor();\n OUString uEntry(sEntry);\n\n String sGroup( *(String*)aAutoTextGroupLB.GetEntryData(\n aAutoTextGroupLB.GetSelectEntryPos() ) );\n uno::Any aGroup = _xAutoText->getByName(sGroup);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n\n if( sEntry.Len() && xGroup->hasByName( uEntry ) )\n {\n uno::Any aEntry(xGroup->getByName(uEntry));\n uno::Reference< text::XAutoTextEntry > xEntry;\n aEntry >>= xEntry;\n if(xEntry.is())\n {\n uno::Reference< text::XTextRange > xRange(xCrsr, uno::UNO_QUERY);\n xEntry->applyTo(xRange);\n }\n UpdateFields();\n }\n return 0;\n}\n\/* -----------------22.07.99 11:06-------------------\n\n --------------------------------------------------*\/\nIMPL_LINK( SwVisitingCardPage, AutoTextSelectHdl, void*, pBox )\n{\n if(_xAutoText.is())\n {\n if( &aAutoTextGroupLB == pBox )\n {\n String sGroup( *(String*)aAutoTextGroupLB.GetEntryData(\n aAutoTextGroupLB.GetSelectEntryPos()));\n uno::Any aGroup = _xAutoText->getByName(sGroup);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n\n ClearUserData();\n aAutoTextLB.Clear();\n\n uno::Sequence<OUString> aBlockNames = xGroup->getElementNames();\n uno::Sequence< OUString > aTitles = xGroup->getTitles() ;\n SetUserData( aBlockNames.getLength(), aTitles.getConstArray(),\n aBlockNames.getConstArray() );\n }\n if(pExampleFrame->IsInitialized())\n pExampleFrame->ClearDocument( TRUE );\n }\n return 0;\n}\n\n\/* -----------------01.10.99 11:59-------------------\n\n --------------------------------------------------*\/\nvoid SwVisitingCardPage::UpdateFields()\n{\n uno::Reference< frame::XModel > xModel;\n if( pExampleFrame && (xModel = pExampleFrame->GetModel()).is())\n {\n SwLabDlg::UpdateFieldInformation(xModel, aLabItem);\n }\n}\n\/* -----------------01.10.99 15:16-------------------\n\n --------------------------------------------------*\/\nvoid SwLabDlg::UpdateFieldInformation(uno::Reference< frame::XModel > & xModel, const SwLabItem& rItem)\n{\n uno::Reference< text::XTextFieldsSupplier > xFlds(xModel, uno::UNO_QUERY);\n uno::Reference< container::XNameAccess > xFldMasters = xFlds->getTextFieldMasters();\n\n static const struct _SwLabItemMap {\n const char* pName;\n rtl::OUString SwLabItem:: *pValue;\n } aArr[] = {\n { \"BC_PRIV_FIRSTNAME\" , &SwLabItem::aPrivFirstName },\n { \"BC_PRIV_NAME\" , &SwLabItem::aPrivName },\n { \"BC_PRIV_INITIALS\" , &SwLabItem::aPrivShortCut },\n { \"BC_PRIV_FIRSTNAME_2\", &SwLabItem::aPrivFirstName2 },\n { \"BC_PRIV_NAME_2\" , &SwLabItem::aPrivName2 },\n { \"BC_PRIV_INITIALS_2\" , &SwLabItem::aPrivShortCut2 },\n { \"BC_PRIV_STREET\" , &SwLabItem::aPrivStreet },\n { \"BC_PRIV_ZIP\" , &SwLabItem::aPrivZip },\n { \"BC_PRIV_CITY\" , &SwLabItem::aPrivCity },\n { \"BC_PRIV_COUNTRY\" , &SwLabItem::aPrivCountry },\n { \"BC_PRIV_STATE\" , &SwLabItem::aPrivState },\n { \"BC_PRIV_TITLE\" , &SwLabItem::aPrivTitle },\n { \"BC_PRIV_PROFESSION\" , &SwLabItem::aPrivProfession },\n { \"BC_PRIV_PHONE\" , &SwLabItem::aPrivPhone },\n { \"BC_PRIV_MOBILE\" , &SwLabItem::aPrivMobile },\n { \"BC_PRIV_FAX\" , &SwLabItem::aPrivFax },\n { \"BC_PRIV_WWW\" , &SwLabItem::aPrivWWW },\n { \"BC_PRIV_MAIL\" , &SwLabItem::aPrivMail },\n { \"BC_COMP_COMPANY\" , &SwLabItem::aCompCompany },\n { \"BC_COMP_COMPANYEXT\" , &SwLabItem::aCompCompanyExt },\n { \"BC_COMP_SLOGAN\" , &SwLabItem::aCompSlogan },\n { \"BC_COMP_STREET\" , &SwLabItem::aCompStreet },\n { \"BC_COMP_ZIP\" , &SwLabItem::aCompZip },\n { \"BC_COMP_CITY\" , &SwLabItem::aCompCity },\n { \"BC_COMP_COUNTRY\" , &SwLabItem::aCompCountry },\n { \"BC_COMP_STATE\" , &SwLabItem::aCompState },\n { \"BC_COMP_POSITION\" , &SwLabItem::aCompPosition },\n { \"BC_COMP_PHONE\" , &SwLabItem::aCompPhone },\n { \"BC_COMP_MOBILE\" , &SwLabItem::aCompMobile },\n { \"BC_COMP_FAX\" , &SwLabItem::aCompFax },\n { \"BC_COMP_WWW\" , &SwLabItem::aCompWWW },\n { \"BC_COMP_MAIL\" , &SwLabItem::aCompMail },\n { 0, 0 }\n };\n\n try\n {\n String sFldName( String::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM(\n \"com.sun.star.text.FieldMaster.User.\" )));\n OUString uCntName( C2U( SW_PROP_NAME_STR(UNO_NAME_CONTENT )));\n for( const _SwLabItemMap* p = aArr; p->pName; ++p )\n {\n String sCurFldName( sFldName );\n sCurFldName.AppendAscii( p->pName );\n OUString uFldName( sCurFldName );\n if( xFldMasters->hasByName( uFldName ))\n {\n uno::Any aFirstName = xFldMasters->getByName( uFldName );\n uno::Reference< beans::XPropertySet > xFld;\n aFirstName >>= xFld;\n uno::Any aContent;\n aContent <<= rItem.*p->pValue;\n xFld->setPropertyValue( uCntName, aContent );\n }\n }\n }\n catch( uno::RuntimeException&)\n {\n \/\/\n }\n\n uno::Reference< container::XEnumerationAccess > xFldAcc = xFlds->getTextFields();\n uno::Reference< util::XRefreshable > xRefresh(xFldAcc, uno::UNO_QUERY);\n xRefresh->refresh();\n}\n\n<commit_msg>#96118# catch another exception<commit_after>\/*************************************************************************\n *\n * $RCSfile: labelexp.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: os $ $Date: 2001-12-19 11:08:57 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PRECOMPILED\n#include \"ui_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n#ifndef _COM_SUN_STAR_TEXT_XTEXTFIELDSSUPPLIER_HPP_\n#include <com\/sun\/star\/text\/XTextFieldsSupplier.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XREFRESHABLE_HPP_\n#include <com\/sun\/star\/util\/XRefreshable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _SWTYPES_HXX\n#include <swtypes.hxx>\n#endif\n#ifndef _LABFMT_HXX\n#include <labfmt.hxx>\n#endif\n#ifndef _UNOTOOLS_HXX\n#include <unotools.hxx>\n#endif\n#ifndef _UNOATXT_HXX \/\/autogen wg. SwXAutoTextEntry\n#include <unoatxt.hxx>\n#endif\n#ifndef _UNOOBJ_HXX \/\/\n#include <unoobj.hxx>\n#endif\n#ifndef _UNOPRNMS_HXX \/\/\n#include <unoprnms.hxx>\n#endif\n\n\nusing namespace ::com::sun::star;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::container;\nusing namespace com::sun::star::uno;\nusing namespace ::comphelper;\nusing namespace ::rtl;\n\n#define C2U(char) rtl::OUString::createFromAscii(char)\n\n\/* -----------------08.07.99 15:15-------------------\n\n --------------------------------------------------*\/\nvoid SwVisitingCardPage::InitFrameControl()\n{\n Link aLink(LINK(this, SwVisitingCardPage, FrameControlInitializedHdl));\n pExampleFrame = new SwOneExampleFrame( aExampleWIN,\n EX_SHOW_BUSINESS_CARDS, &aLink );\n\n uno::Reference< lang::XMultiServiceFactory > xMgr =\n getProcessServiceFactory();\n \/\/now the AutoText ListBoxes have to be filled\n\n uno::Reference< uno::XInterface > xAText =\n xMgr->createInstance( C2U(\"com.sun.star.text.AutoTextContainer\") );\n _xAutoText = uno::Reference< container::XNameAccess >(xAText, uno::UNO_QUERY);\n\n uno::Sequence<OUString> aNames = _xAutoText->getElementNames();\n const OUString* pGroups = aNames.getConstArray();\n OUString uTitleName( C2U(SW_PROP_NAME_STR(UNO_NAME_TITLE)) );\n\n for(sal_uInt16 i = 0; i < aNames.getLength(); i++)\n {\n uno::Any aGroup = _xAutoText->getByName(pGroups[i]);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n uno::Reference< container::XIndexAccess > xIdxAcc(xGroup, uno::UNO_QUERY);\n try\n {\n if(!xIdxAcc.is() || xIdxAcc->getCount())\n {\n uno::Reference< beans::XPropertySet > xPrSet(xGroup, uno::UNO_QUERY);\n uno::Any aTitle = xPrSet->getPropertyValue( uTitleName );\n OUString uTitle;\n aTitle >>= uTitle;\n String sGroup(pGroups[i]);\n sal_uInt16 nEntry = aAutoTextGroupLB.InsertEntry(uTitle);\n aAutoTextGroupLB.SetEntryData(nEntry, new String(sGroup));\n }\n }\n catch(Exception&)\n {\n }\n }\n if(aAutoTextGroupLB.GetEntryCount())\n {\n if(LISTBOX_ENTRY_NOTFOUND == aAutoTextGroupLB.GetSelectEntryPos())\n aAutoTextGroupLB.SelectEntryPos(0);\n String sCurGroupName(\n *(String*)aAutoTextGroupLB.GetEntryData(aAutoTextGroupLB.GetSelectEntryPos()));\n if(_xAutoText->hasByName(sCurGroupName))\n {\n uno::Any aGroup = _xAutoText->getByName(sCurGroupName);\n try\n {\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n uno::Sequence< OUString > aBlockNames = xGroup->getElementNames();\n uno::Sequence< OUString > aTitles = xGroup->getTitles() ;\n\n SetUserData( aBlockNames.getLength(), aTitles.getConstArray(),\n aBlockNames.getConstArray() );\n }\n catch( uno::RuntimeException& )\n {\n \/\/ we'll be her if path settings were wrong\n }\n }\n }\n}\n\/* -----------------01.10.99 13:19-------------------\n\n --------------------------------------------------*\/\nIMPL_LINK( SwVisitingCardPage, FrameControlInitializedHdl, void*, EMPTYARG )\n{\n SvLBoxEntry* pSel = aAutoTextLB.FirstSelected();\n String sEntry;\n if( pSel )\n sEntry = *(String*)pSel->GetUserData();\n uno::Reference< text::XTextCursor > & xCrsr = pExampleFrame->GetTextCursor();\n OUString uEntry(sEntry);\n\n String sGroup( *(String*)aAutoTextGroupLB.GetEntryData(\n aAutoTextGroupLB.GetSelectEntryPos() ) );\n uno::Any aGroup = _xAutoText->getByName(sGroup);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n\n if( sEntry.Len() && xGroup->hasByName( uEntry ) )\n {\n uno::Any aEntry(xGroup->getByName(uEntry));\n uno::Reference< text::XAutoTextEntry > xEntry;\n aEntry >>= xEntry;\n if(xEntry.is())\n {\n uno::Reference< text::XTextRange > xRange(xCrsr, uno::UNO_QUERY);\n xEntry->applyTo(xRange);\n }\n UpdateFields();\n }\n return 0;\n}\n\/* -----------------22.07.99 11:06-------------------\n\n --------------------------------------------------*\/\nIMPL_LINK( SwVisitingCardPage, AutoTextSelectHdl, void*, pBox )\n{\n if(_xAutoText.is())\n {\n if( &aAutoTextGroupLB == pBox )\n {\n String sGroup( *(String*)aAutoTextGroupLB.GetEntryData(\n aAutoTextGroupLB.GetSelectEntryPos()));\n uno::Any aGroup = _xAutoText->getByName(sGroup);\n uno::Reference< text::XAutoTextGroup > xGroup;\n aGroup >>= xGroup;\n\n ClearUserData();\n aAutoTextLB.Clear();\n\n uno::Sequence<OUString> aBlockNames = xGroup->getElementNames();\n uno::Sequence< OUString > aTitles = xGroup->getTitles() ;\n SetUserData( aBlockNames.getLength(), aTitles.getConstArray(),\n aBlockNames.getConstArray() );\n }\n if(pExampleFrame->IsInitialized())\n pExampleFrame->ClearDocument( TRUE );\n }\n return 0;\n}\n\n\/* -----------------01.10.99 11:59-------------------\n\n --------------------------------------------------*\/\nvoid SwVisitingCardPage::UpdateFields()\n{\n uno::Reference< frame::XModel > xModel;\n if( pExampleFrame && (xModel = pExampleFrame->GetModel()).is())\n {\n SwLabDlg::UpdateFieldInformation(xModel, aLabItem);\n }\n}\n\/* -----------------01.10.99 15:16-------------------\n\n --------------------------------------------------*\/\nvoid SwLabDlg::UpdateFieldInformation(uno::Reference< frame::XModel > & xModel, const SwLabItem& rItem)\n{\n uno::Reference< text::XTextFieldsSupplier > xFlds(xModel, uno::UNO_QUERY);\n uno::Reference< container::XNameAccess > xFldMasters = xFlds->getTextFieldMasters();\n\n static const struct _SwLabItemMap {\n const char* pName;\n rtl::OUString SwLabItem:: *pValue;\n } aArr[] = {\n { \"BC_PRIV_FIRSTNAME\" , &SwLabItem::aPrivFirstName },\n { \"BC_PRIV_NAME\" , &SwLabItem::aPrivName },\n { \"BC_PRIV_INITIALS\" , &SwLabItem::aPrivShortCut },\n { \"BC_PRIV_FIRSTNAME_2\", &SwLabItem::aPrivFirstName2 },\n { \"BC_PRIV_NAME_2\" , &SwLabItem::aPrivName2 },\n { \"BC_PRIV_INITIALS_2\" , &SwLabItem::aPrivShortCut2 },\n { \"BC_PRIV_STREET\" , &SwLabItem::aPrivStreet },\n { \"BC_PRIV_ZIP\" , &SwLabItem::aPrivZip },\n { \"BC_PRIV_CITY\" , &SwLabItem::aPrivCity },\n { \"BC_PRIV_COUNTRY\" , &SwLabItem::aPrivCountry },\n { \"BC_PRIV_STATE\" , &SwLabItem::aPrivState },\n { \"BC_PRIV_TITLE\" , &SwLabItem::aPrivTitle },\n { \"BC_PRIV_PROFESSION\" , &SwLabItem::aPrivProfession },\n { \"BC_PRIV_PHONE\" , &SwLabItem::aPrivPhone },\n { \"BC_PRIV_MOBILE\" , &SwLabItem::aPrivMobile },\n { \"BC_PRIV_FAX\" , &SwLabItem::aPrivFax },\n { \"BC_PRIV_WWW\" , &SwLabItem::aPrivWWW },\n { \"BC_PRIV_MAIL\" , &SwLabItem::aPrivMail },\n { \"BC_COMP_COMPANY\" , &SwLabItem::aCompCompany },\n { \"BC_COMP_COMPANYEXT\" , &SwLabItem::aCompCompanyExt },\n { \"BC_COMP_SLOGAN\" , &SwLabItem::aCompSlogan },\n { \"BC_COMP_STREET\" , &SwLabItem::aCompStreet },\n { \"BC_COMP_ZIP\" , &SwLabItem::aCompZip },\n { \"BC_COMP_CITY\" , &SwLabItem::aCompCity },\n { \"BC_COMP_COUNTRY\" , &SwLabItem::aCompCountry },\n { \"BC_COMP_STATE\" , &SwLabItem::aCompState },\n { \"BC_COMP_POSITION\" , &SwLabItem::aCompPosition },\n { \"BC_COMP_PHONE\" , &SwLabItem::aCompPhone },\n { \"BC_COMP_MOBILE\" , &SwLabItem::aCompMobile },\n { \"BC_COMP_FAX\" , &SwLabItem::aCompFax },\n { \"BC_COMP_WWW\" , &SwLabItem::aCompWWW },\n { \"BC_COMP_MAIL\" , &SwLabItem::aCompMail },\n { 0, 0 }\n };\n\n try\n {\n String sFldName( String::CreateFromAscii( RTL_CONSTASCII_STRINGPARAM(\n \"com.sun.star.text.FieldMaster.User.\" )));\n OUString uCntName( C2U( SW_PROP_NAME_STR(UNO_NAME_CONTENT )));\n for( const _SwLabItemMap* p = aArr; p->pName; ++p )\n {\n String sCurFldName( sFldName );\n sCurFldName.AppendAscii( p->pName );\n OUString uFldName( sCurFldName );\n if( xFldMasters->hasByName( uFldName ))\n {\n uno::Any aFirstName = xFldMasters->getByName( uFldName );\n uno::Reference< beans::XPropertySet > xFld;\n aFirstName >>= xFld;\n uno::Any aContent;\n aContent <<= rItem.*p->pValue;\n xFld->setPropertyValue( uCntName, aContent );\n }\n }\n }\n catch( uno::RuntimeException&)\n {\n \/\/\n }\n\n uno::Reference< container::XEnumerationAccess > xFldAcc = xFlds->getTextFields();\n uno::Reference< util::XRefreshable > xRefresh(xFldAcc, uno::UNO_QUERY);\n xRefresh->refresh();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#define UNICODE\n#include <windows.h>\n#include <ole2.h>\n#include <oaidl.h>\n#include <objbase.h>\n#include <AtlBase.h>\n#include <AtlConv.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <stdlib.h>\n#include \"dictationbridge-core\/master\/master.h\"\n\n#pragma comment(lib, \"ole32.lib\")\n#pragma comment(lib, \"oleacc.lib\")\n\n\n#define ERR(x, msg) do { \\\nif(x != S_OK) {\\\nprintf(msg \"\\n\");\\\nprintf(\"%x\\n\", res);\\\nexit(1);\\\n}\\\n} while(0)\n\nstd::string wideToString(wchar_t const * text, unsigned int length) {\n\tauto tmp = new char[length*2+1];\n\tauto resultingLen = WideCharToMultiByte(CP_UTF8, NULL, text,\n\t\tlength, tmp, length*2,\n\t\tNULL, NULL);\n\ttmp[resultingLen] = '\\0';\n\tstd::string ret(tmp);\n\tdelete[] tmp;\n\treturn ret;\n}\n\nstd::string BSTRToString(BSTR text) {\n\tunsigned int len = SysStringLen(text);\n\treturn wideToString(text, len);\n}\n\nDISPID id;\nDISPPARAMS params;\nVARIANTARG args[2];\nIDispatch *jfw = nullptr;\n\nvoid initSpeak() {\n\tCLSID JFWClass;\n\tauto res = CLSIDFromProgID(L\"FreedomSci.JawsApi\", &JFWClass);\n\tERR(res, \"Couldn't get Jaws interface ID\");\n\tres = CoCreateInstance(JFWClass, NULL, CLSCTX_ALL, __uuidof(IDispatch), (void**)&jfw);\n\tERR(res, \"Couldn't create Jaws interface\");\n\t\/* Setup to call jaws. IDL is:\n\tHRESULT SayString(\n\t[in] BSTR StringToSpeak, \n\t[in, optional, defaultvalue(-1)] VARIANT_BOOL bFlush, \n\t[out, retval] VARIANT_BOOL* vbSuccess);\n\t*\/\n\tLPOLESTR name = L\"SayString\";\n\targs[1].vt = VT_BSTR;\n\targs[0].vt = VT_BOOL;\n\targs[0].boolVal = 0;\n\tparams.rgvarg = args;\n\tparams.rgdispidNamedArgs = NULL;\n\tparams.cArgs = 2;\n\tparams.cNamedArgs = 0;\n\tres = jfw->GetIDsOfNames(IID_NULL, &name, 1, LOCALE_SYSTEM_DEFAULT, &id);\n\tERR(res, \"Couldn't get SayString\");\n}\n\nvoid speak(wchar_t const * text) {\n\tauto s = SysAllocString(text);\n\targs[1].bstrVal = s;\n\tjfw->Invoke(id, IID_NULL, LOCALE_SYSTEM_DEFAULT, DISPATCH_METHOD, ¶ms, NULL, NULL, NULL);\n\t\/\/Temporary, for debugging.\n\tauto tmp = BSTRToString(s);\n\tprintf(&tmp[0]);\n\tprintf(\"\\n\");\n\tSysFreeString(s);\n}\n\nvoid WINAPI textCallback(HWND hwnd, DWORD startPosition, LPCWSTR textUnprocessed) {\n\t\/\/We need to replace \\r with nothing.\n\tint len = wcslen(textUnprocessed);\n\twchar_t* text = new wchar_t[len+1];\n\tint copied = 0;\n\tfor(int i = 0; i < len; i++) {\n\t\tif(textUnprocessed[i] != L'\\r') {\n\t\t\ttext[copied] = textUnprocessed[i];\n\t\t\tcopied += 1;\n\t\t}\n\t}\n\ttext[copied+1] = 0;\n\tif(wcscmp(text, L\"\\n\\n\") == 0\n\t\t|| wcscmp(text, L\"\") == 0 \/\/new paragraph in word.\n\t) {\n\t\tspeak(L\"New paragraph.\");\n\t}\n\telse if(wcscmp(text, L\"\\n\") == 0) {\n\t\tspeak(L\"New line.\");\n\t}\n\telse {\n\t\tspeak(text);\n\t}\n}\n\nvoid WINAPI textDeletedCallback(HWND hwnd, DWORD startPosition, LPCWSTR text) {\n\tint len = wcslen(text);\n\tint neededLen = len + strlen(\"Deleted \");\n\twchar_t* tmp = new wchar_t[neededLen+1];\n\twcscpy(tmp, L\"Deleted \");\n\tint offset = strlen(\"Deleted \");\n\tfor(int i = 0; i < len; i++) tmp[i+offset] = text[i];\n\ttmp[neededLen] = 0;\n\tspeak(tmp);\n\tdelete[] tmp;\n}\n\n\/\/These are string constants for the microphone status, as well as the status itself:\n\/\/The pointer below is set to the last one we saw.\nconst char* MICROPHONE_OFF = \"Dragon's microphone is off;\";\nconst char* MICROPHONE_ON = \"Normal mode: You can dictate and use voice\";\nconst char* MICROPHONE_SLEEPING = \"The microphone is asleep;\";\n\nconst char* microphoneState = nullptr;\n\nvoid announceMicrophoneState(const char* state) {\n\tif(state == MICROPHONE_ON) speak(L\"Microphone on.\");\n\telse if(state == MICROPHONE_OFF) speak(L\"Microphone off.\");\n\telse if(state == MICROPHONE_SLEEPING) speak(L\"Microphone sleeping.\");\n\telse speak(L\"Microphone in unknown state.\");\n}\n\nwchar_t processNameBuffer[1024] = {0};\n\nvoid CALLBACK nameChanged(HWINEVENTHOOK hWinEventHook, DWORD event, HWND hwnd, LONG idObject, LONG idChild, DWORD dwEventThread, DWORD dwmsEventTime) {\n\t\/\/First, is it coming from natspeak.exe?\n\tDWORD procId;\n\tGetWindowThreadProcessId(hwnd, &procId);\n\tauto procHandle = OpenProcess(PROCESS_QUERY_LIMITED_INFORMATION, FALSE, procId);\n\t\/\/We can't recover from this failing, so abort.\n\tif(procHandle == NULL) return;\n\tDWORD len = 1024;\n\tauto res = QueryFullProcessImageName(procHandle, 0, processNameBuffer, &len);\n\tCloseHandle(procHandle);\n\tif(res == 0) return;\n\tauto processName = wideToString(processNameBuffer, (unsigned int) len);\n\tif(processName.find(\"dragonbar.exe\") == std::string::npos\n\t\t&& processName.find(\"natspeak.exe\") == std::string::npos) return;\n\t\/\/Attempt to get the new text.\n\tIAccessible* acc = nullptr;\n\tVARIANT child;\n\tHRESULT hres = AccessibleObjectFromEvent(hwnd, idObject, idChild, &acc, &child);\n\tif(hres != S_OK || acc == nullptr) return;\n\tBSTR nameBSTR;\n\thres = acc->get_accName(child, &nameBSTR);\n\tacc->Release();\n\tif(hres != S_OK) return;\n\tauto name = BSTRToString(nameBSTR);\n\tSysFreeString(nameBSTR);\n\tconst char* possibles[] = {MICROPHONE_ON, MICROPHONE_OFF, MICROPHONE_SLEEPING};\n\tconst char* newState = microphoneState;\n\tfor(int i = 0; i < 3; i++) {\n\t\tif(name.find(possibles[i]) != std::string::npos) {\n\t\t\tnewState = possibles[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(newState != microphoneState) {\n\t\tannounceMicrophoneState(newState);\n\t\tmicrophoneState = newState;\n\t}\n}\n\nint CALLBACK WinMain(_In_ HINSTANCE hInstance,\n\t_In_ HINSTANCE hPrevInstance,\n\t_In_ LPSTR lpCmdLine,\n\t_In_ int nCmdShow) {\n\tHRESULT res;\n\tres = OleInitialize(NULL);\n\tERR(res, \"Couldn't initialize OLE\");\n\tinitSpeak();\n\tauto started = DBMaster_Start();\n\tif(!started) {\n\t\tprintf(\"Couldn't start DictationBridge-core\\n\");\n\t\treturn 1;\n\t}\n\tDBMaster_SetTextInsertedCallback(textCallback);\n\tDBMaster_SetTextDeletedCallback(textDeletedCallback);\n\tif(SetWinEventHook(EVENT_OBJECT_NAMECHANGE, EVENT_OBJECT_NAMECHANGE, NULL, nameChanged, 0, 0, WINEVENT_OUTOFCONTEXT) == 0) {\n\t\tprintf(\"Couldn't register to receive events\\n\");\n\t\treturn 1;\n\t}\n\tMSG msg;\n\twhile(GetMessage(&msg, NULL, NULL, NULL) > 0) {\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n\tDBMaster_Stop();\n\tOleUninitialize();\n\treturn 0;\n}\n<commit_msg>Remove some old debugging code.<commit_after>#define UNICODE\n#include <windows.h>\n#include <ole2.h>\n#include <oaidl.h>\n#include <objbase.h>\n#include <AtlBase.h>\n#include <AtlConv.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <stdlib.h>\n#include \"dictationbridge-core\/master\/master.h\"\n\n#pragma comment(lib, \"ole32.lib\")\n#pragma comment(lib, \"oleacc.lib\")\n\n\n#define ERR(x, msg) do { \\\nif(x != S_OK) {\\\nprintf(msg \"\\n\");\\\nprintf(\"%x\\n\", res);\\\nexit(1);\\\n}\\\n} while(0)\n\nstd::string wideToString(wchar_t const * text, unsigned int length) {\n\tauto tmp = new char[length*2+1];\n\tauto resultingLen = WideCharToMultiByte(CP_UTF8, NULL, text,\n\t\tlength, tmp, length*2,\n\t\tNULL, NULL);\n\ttmp[resultingLen] = '\\0';\n\tstd::string ret(tmp);\n\tdelete[] tmp;\n\treturn ret;\n}\n\nstd::string BSTRToString(BSTR text) {\n\tunsigned int len = SysStringLen(text);\n\treturn wideToString(text, len);\n}\n\nDISPID id;\nDISPPARAMS params;\nVARIANTARG args[2];\nIDispatch *jfw = nullptr;\n\nvoid initSpeak() {\n\tCLSID JFWClass;\n\tauto res = CLSIDFromProgID(L\"FreedomSci.JawsApi\", &JFWClass);\n\tERR(res, \"Couldn't get Jaws interface ID\");\n\tres = CoCreateInstance(JFWClass, NULL, CLSCTX_ALL, __uuidof(IDispatch), (void**)&jfw);\n\tERR(res, \"Couldn't create Jaws interface\");\n\t\/* Setup to call jaws. IDL is:\n\tHRESULT SayString(\n\t[in] BSTR StringToSpeak, \n\t[in, optional, defaultvalue(-1)] VARIANT_BOOL bFlush, \n\t[out, retval] VARIANT_BOOL* vbSuccess);\n\t*\/\n\tLPOLESTR name = L\"SayString\";\n\targs[1].vt = VT_BSTR;\n\targs[0].vt = VT_BOOL;\n\targs[0].boolVal = 0;\n\tparams.rgvarg = args;\n\tparams.rgdispidNamedArgs = NULL;\n\tparams.cArgs = 2;\n\tparams.cNamedArgs = 0;\n\tres = jfw->GetIDsOfNames(IID_NULL, &name, 1, LOCALE_SYSTEM_DEFAULT, &id);\n\tERR(res, \"Couldn't get SayString\");\n}\n\nvoid speak(wchar_t const * text) {\n\tauto s = SysAllocString(text);\n\targs[1].bstrVal = s;\n\tjfw->Invoke(id, IID_NULL, LOCALE_SYSTEM_DEFAULT, DISPATCH_METHOD, ¶ms, NULL, NULL, NULL);\n\tSysFreeString(s);\n}\n\nvoid WINAPI textCallback(HWND hwnd, DWORD startPosition, LPCWSTR textUnprocessed) {\n\t\/\/We need to replace \\r with nothing.\n\tint len = wcslen(textUnprocessed);\n\twchar_t* text = new wchar_t[len+1];\n\tint copied = 0;\n\tfor(int i = 0; i < len; i++) {\n\t\tif(textUnprocessed[i] != L'\\r') {\n\t\t\ttext[copied] = textUnprocessed[i];\n\t\t\tcopied += 1;\n\t\t}\n\t}\n\ttext[copied+1] = 0;\n\tif(wcscmp(text, L\"\\n\\n\") == 0\n\t\t|| wcscmp(text, L\"\") == 0 \/\/new paragraph in word.\n\t) {\n\t\tspeak(L\"New paragraph.\");\n\t}\n\telse if(wcscmp(text, L\"\\n\") == 0) {\n\t\tspeak(L\"New line.\");\n\t}\n\telse {\n\t\tspeak(text);\n\t}\n}\n\nvoid WINAPI textDeletedCallback(HWND hwnd, DWORD startPosition, LPCWSTR text) {\n\tint len = wcslen(text);\n\tint neededLen = len + strlen(\"Deleted \");\n\twchar_t* tmp = new wchar_t[neededLen+1];\n\twcscpy(tmp, L\"Deleted \");\n\tint offset = strlen(\"Deleted \");\n\tfor(int i = 0; i < len; i++) tmp[i+offset] = text[i];\n\ttmp[neededLen] = 0;\n\tspeak(tmp);\n\tdelete[] tmp;\n}\n\n\/\/These are string constants for the microphone status, as well as the status itself:\n\/\/The pointer below is set to the last one we saw.\nconst char* MICROPHONE_OFF = \"Dragon's microphone is off;\";\nconst char* MICROPHONE_ON = \"Normal mode: You can dictate and use voice\";\nconst char* MICROPHONE_SLEEPING = \"The microphone is asleep;\";\n\nconst char* microphoneState = nullptr;\n\nvoid announceMicrophoneState(const char* state) {\n\tif(state == MICROPHONE_ON) speak(L\"Microphone on.\");\n\telse if(state == MICROPHONE_OFF) speak(L\"Microphone off.\");\n\telse if(state == MICROPHONE_SLEEPING) speak(L\"Microphone sleeping.\");\n\telse speak(L\"Microphone in unknown state.\");\n}\n\nwchar_t processNameBuffer[1024] = {0};\n\nvoid CALLBACK nameChanged(HWINEVENTHOOK hWinEventHook, DWORD event, HWND hwnd, LONG idObject, LONG idChild, DWORD dwEventThread, DWORD dwmsEventTime) {\n\t\/\/First, is it coming from natspeak.exe?\n\tDWORD procId;\n\tGetWindowThreadProcessId(hwnd, &procId);\n\tauto procHandle = OpenProcess(PROCESS_QUERY_LIMITED_INFORMATION, FALSE, procId);\n\t\/\/We can't recover from this failing, so abort.\n\tif(procHandle == NULL) return;\n\tDWORD len = 1024;\n\tauto res = QueryFullProcessImageName(procHandle, 0, processNameBuffer, &len);\n\tCloseHandle(procHandle);\n\tif(res == 0) return;\n\tauto processName = wideToString(processNameBuffer, (unsigned int) len);\n\tif(processName.find(\"dragonbar.exe\") == std::string::npos\n\t\t&& processName.find(\"natspeak.exe\") == std::string::npos) return;\n\t\/\/Attempt to get the new text.\n\tIAccessible* acc = nullptr;\n\tVARIANT child;\n\tHRESULT hres = AccessibleObjectFromEvent(hwnd, idObject, idChild, &acc, &child);\n\tif(hres != S_OK || acc == nullptr) return;\n\tBSTR nameBSTR;\n\thres = acc->get_accName(child, &nameBSTR);\n\tacc->Release();\n\tif(hres != S_OK) return;\n\tauto name = BSTRToString(nameBSTR);\n\tSysFreeString(nameBSTR);\n\tconst char* possibles[] = {MICROPHONE_ON, MICROPHONE_OFF, MICROPHONE_SLEEPING};\n\tconst char* newState = microphoneState;\n\tfor(int i = 0; i < 3; i++) {\n\t\tif(name.find(possibles[i]) != std::string::npos) {\n\t\t\tnewState = possibles[i];\n\t\t\tbreak;\n\t\t}\n\t}\n\tif(newState != microphoneState) {\n\t\tannounceMicrophoneState(newState);\n\t\tmicrophoneState = newState;\n\t}\n}\n\nint CALLBACK WinMain(_In_ HINSTANCE hInstance,\n\t_In_ HINSTANCE hPrevInstance,\n\t_In_ LPSTR lpCmdLine,\n\t_In_ int nCmdShow) {\n\tHRESULT res;\n\tres = OleInitialize(NULL);\n\tERR(res, \"Couldn't initialize OLE\");\n\tinitSpeak();\n\tauto started = DBMaster_Start();\n\tif(!started) {\n\t\tprintf(\"Couldn't start DictationBridge-core\\n\");\n\t\treturn 1;\n\t}\n\tDBMaster_SetTextInsertedCallback(textCallback);\n\tDBMaster_SetTextDeletedCallback(textDeletedCallback);\n\tif(SetWinEventHook(EVENT_OBJECT_NAMECHANGE, EVENT_OBJECT_NAMECHANGE, NULL, nameChanged, 0, 0, WINEVENT_OUTOFCONTEXT) == 0) {\n\t\tprintf(\"Couldn't register to receive events\\n\");\n\t\treturn 1;\n\t}\n\tMSG msg;\n\twhile(GetMessage(&msg, NULL, NULL, NULL) > 0) {\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n\tDBMaster_Stop();\n\tOleUninitialize();\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Column.h>\n#include <Terminal.h>\n\n\n#include <iostream>\n#include <cstdlib>\n#include <ctime>\n\nvoid setupColors();\n\nint main()\n{\n\t\/\/seed the rng\n\tstd::srand(std::time(NULL));\n\n\t\/\/initialize screen\n\tmatrix::Terminal::init();\n\tsetupColors();\n\n\t\/\/Column(Column * head, int column, int speed, int length, int height);\n\tmatrix::Column * columns = new matrix::Column(0,0);\n\tmatrix::Column * tmp = NULL;\n\n\t\/\/get terminal size\n\tint rows,cols;\n\tmatrix::Terminal::getSize(rows,cols);\n\n\t\/\/set up for loop\n\tint column, speed = 1, length;\n\tint tick, nextSpawn = 1;\n\n\t\/\/perform the loop\n\t\/\/we'll do 100 ticks per second, 10 second run\n\tfor (tick = 1; tick < 1000; tick++)\n\t{\n\t\tif (tick == nextSpawn)\n\t\t{\n\t\t\tnextSpawn = 1 + tick + (std::rand() % 5);\n\n\t\t\tcolumn = std::rand() % cols;\n\t\t\tspeed = 2 + (std::rand() % 10);\n\t\t\tlength = 5 + (std::rand() % 50);\n\n\t\t\ttmp = new matrix::Column(column,rows);\n\t\t\ttmp->setSpeed(speed);\n\t\t\ttmp->setLength(length);\n\t\t\ttmp->insert(columns);\n\t\t}\n\n\t\t\/\/do the draw\n\t\tmatrix::Terminal::blank();\n\t\tmatrix::Column::drawAll(columns,tick);\n\t\tmatrix::Terminal::draw();\n\t\tmatrix::Terminal::pause(10);\n\t}\n\n\tdelete columns;\n\n\tmatrix::Terminal::end();\n\n\treturn 0;\n}\n\n\n\n\nvoid setupColors()\n{\n\tint r[8], g[8], b[8];\n\t\n\tint i;\n\tfor (i = 0; i < 8; i++)\n\t{\n\t\tr[i] = 0;\n\t\tg[i] = 125 * i;\n\t\tb[i] = 0;\n\t}\n\n\tmatrix::Terminal::makePalette(8,r,g,b);\n}\n<commit_msg>added command line arguments for run time<commit_after>#include <Column.h>\n#include <Terminal.h>\n\n#include <iostream>\/\/for cout\n#include <cstdlib> \/\/for atoi(), srand(), and rand()\n#include <ctime> \/\/for time() (to seed rand)\n\nvoid setupColors();\nvoid printUsage(const char * name);\n\nint main(int argc, char * argv[])\n{\n\tint seconds = 10;\n\n\n\tif (argc > 2) \n\t{\n\t\tprintUsage(argv[0]);\n\t\treturn 0;\n\t}\n\n\n\n\tif (argc == 2)\n\t{\n\t\tseconds = std::atoi(argv[1]);\n\t\tif (seconds <= 0)\n\t\t{\n\t\t\tprintUsage(argv[0]);\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t\/\/seed the rng\n\tstd::srand(std::time(NULL));\n\n\t\/\/initialize screen\n\tmatrix::Terminal::init();\n\tsetupColors();\n\n\t\/\/Column(Column * head, int column, int speed, int length, int height);\n\tmatrix::Column * columns = new matrix::Column(0,0);\n\tmatrix::Column * tmp = NULL;\n\n\t\/\/get terminal size\n\tint rows,cols;\n\tmatrix::Terminal::getSize(rows,cols);\n\n\t\/\/set up for loop\n\tint column, speed = 1, length;\n\tint tick, nextSpawn = 1;\n\tint runtime = seconds * 100;\n\n\t\/\/perform the loop\n\t\/\/we'll do 100 ticks per second, 10 second run\n\tfor (tick = 1; tick < runtime; tick++)\n\t{\n\t\tif (tick == nextSpawn)\n\t\t{\n\t\t\tnextSpawn = 1 + tick + (std::rand() % 5);\n\n\t\t\tcolumn = std::rand() % cols;\n\t\t\tspeed = 2 + (std::rand() % 10);\n\t\t\tlength = 5 + (std::rand() % 50);\n\n\t\t\ttmp = new matrix::Column(column,rows);\n\t\t\ttmp->setSpeed(speed);\n\t\t\ttmp->setLength(length);\n\t\t\ttmp->insert(columns);\n\t\t}\n\n\t\t\/\/do the draw\n\t\tmatrix::Terminal::blank();\n\t\tmatrix::Column::drawAll(columns,tick);\n\t\tmatrix::Terminal::draw();\n\t\tmatrix::Terminal::pause(10);\n\t}\n\n\tdelete columns;\n\n\tmatrix::Terminal::end();\n\n\treturn 0;\n}\n\n\n\nvoid printUsage(const char * name)\n{\n\tstd::cout << \" usage: \" << name << \" [seconds]\\n\";\n}\n\n\nvoid setupColors()\n{\n\tint r[8], g[8], b[8];\n\t\n\tint i;\n\tfor (i = 0; i < 8; i++)\n\t{\n\t\tr[i] = 0;\n\t\tg[i] = 125 * i;\n\t\tb[i] = 0;\n\t}\n\n\tmatrix::Terminal::makePalette(8,r,g,b);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/This file is not used, for function definitions refer photon_math.h\n<commit_msg>updating according to conformation<commit_after>\/\/This file is not used, for function definitions refer photon_math.h\n#include \"photon_math.h\"\n\n\nint photon_math::add_nos(int a[], int size)\n{\nint ret_sum,i;\nret_sum = i = 0;\nfor(i=0;i<size;i++)\n{\nret_sum += a[i];\n}\nreturn ret_sum;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Server.hpp\"\n#include \"FileHandler.hpp\"\n#include \"CommandHandler.hpp\"\n\n#include <memory>\n\n\/\/Define constants\nconst int Server::BUFFER_SIZE = 16384; \n\n\n\/\/Constructor\nServer::Server(int s) : sock(s) {\n\tsstr s2; s2 << \"Child server has started.\";\n\tFileHandler::log(s2);\n\tstart();\n}\n\n\/\/Destructor\nServer::~Server() {\n\tsstr s2; s2 << \"Client disconnected from server.\";\n\tFileHandler::userQuit(me());\n\tFileHandler::log(s2);\n}\n\n\n\/\/Log and send a string\ninline void respond(int sock, const std::string& s, const bool addNewL = true) {\n\n\t\/\/Add newline if wanted\n\tstring s2 = s; if(addNewL) s2 += '\\n';\n\n\t\/\/Log the message\n\tFileHandler::log(s2);\n\n\t\/\/Send the string\n\tAssert(send( sock, s2.data(), s2.size(), 0) == s2.size(),\n\t\t\"send() failed.\");\n}\n\n\/\/The function that runs the server\nvoid Server::start() {\n\n\t\/\/Create a buffer\n\tchar buf[BUFFER_SIZE+1]; buf[BUFFER_SIZE] = 0;\n\t\n\t\/\/Loop and recieve data from the client\n\tfor(int n; (n = (int)recv( sock, buf, BUFFER_SIZE, 0 ) ); ) {\n\n\t\t\/\/Check for errors or disconnects\n\t\tif (n < 0) Err(\"recv() failed\");\n\t\telse if (!n) return;\n\t\telse buf[n] = 0;\n\n\t\t\/\/Ignore prepended whitespace\n\t\tint i; for(i = 0; i < n; i++)\n\t\t\tif (buf[i] && !isspace(buf[i])) break;\n\n\t\t\/\/If an empty string was recieved, note so then continue\n\t\tif (i == n) {\n\t\t\trespond( sock, \"Empty string recieved\" );\n\t\t\t\/\/TODO\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/Find the command\n\t\tint k; for(k = i + 1; k < n; k++)\n\t\t\tif (!buf[k] || isspace(buf[k])) break;\n\n\t\tif (k == n) {\n\t\t\trespond( sock, \"Incomplete command recieved\" );\n\t\t\t\/\/TODO\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/Create needed strings string of arguments\n\t\tstd::string args(&buf[k+1], n-(k+1));\n\t\tstd::string cmd(&buf[i], k-i);\n\n\t\t\/\/Log the command, or at least part of it\n\t\tsstr s2; s2 << \"Running command: \" << cmd;\n\t\trespond(sock, s2.str());\n\t\tFileHandler::log(s2);\n\n\t\t\/\/TODO: change, thePath, thread\n\t\tstd::string pth = \"\";\n\n\t\t\/\/TODO: change, thePath, thread\n\t\t\/\/Run the command and send the result\n\t\trespond(sock, CommandHandler::runCmd( std::move(cmd), std::move(args), \n\t\t std::move(pth), false), false );\n\t}\n}\n<commit_msg>Minor tweak<commit_after>#include \"Server.hpp\"\n#include \"FileHandler.hpp\"\n#include \"CommandHandler.hpp\"\n\n#include <memory>\n\n\/\/Define constants\nconst int Server::BUFFER_SIZE = 16384; \n\n\n\/\/Constructor\nServer::Server(int s) : sock(s) {\n\tsstr s2; s2 << \"Child server has started.\";\n\tFileHandler::log(s2);\n\tstart();\n}\n\n\/\/Destructor\nServer::~Server() {\n\tsstr s2; s2 << \"Client disconnected from server.\";\n\tFileHandler::userQuit(me());\n\tFileHandler::log(s2);\n}\n\n\n\/\/Log and send a string\ninline void respond(int sock, std::string&& s, const bool addNewL = true) {\n\n\t\/\/Add newline if wanted\n\tif(addNewL) s += '\\n';\n\n\t\/\/Log the message\n\tFileHandler::log(s);\n\n\t\/\/Send the string\n\tAssert(send( sock, s.data(), s.size(), 0) == s.size(),\n\t\t\"send() failed.\");\n}\n\n\/\/The function that runs the server\nvoid Server::start() {\n\n\t\/\/Create a buffer\n\tchar buf[BUFFER_SIZE+1]; buf[BUFFER_SIZE] = 0;\n\t\n\t\/\/Loop and recieve data from the client\n\tfor(int n; (n = (int)recv( sock, buf, BUFFER_SIZE, 0 ) ); ) {\n\n\t\t\/\/Check for errors or disconnects\n\t\tif (n < 0) Err(\"recv() failed\");\n\t\telse if (!n) return;\n\t\telse buf[n] = 0;\n\n\t\t\/\/Ignore prepended whitespace\n\t\tint i; for(i = 0; i < n; i++)\n\t\t\tif (buf[i] && !isspace(buf[i])) break;\n\n\t\t\/\/If an empty string was recieved, note so then continue\n\t\tif (i == n) {\n\t\t\trespond( sock, \"Empty string recieved\" );\n\t\t\t\/\/TODO\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/Find the command\n\t\tint k; for(k = i + 1; k < n; k++)\n\t\t\tif (!buf[k] || isspace(buf[k])) break;\n\n\t\tif (k == n) {\n\t\t\trespond( sock, \"Incomplete command recieved\" );\n\t\t\t\/\/TODO\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/Create needed strings string of arguments\n\t\tstd::string args(&buf[k+1], n-(k+1));\n\t\tstd::string cmd(&buf[i], k-i);\n\n\t\t\/\/Log the command, or at least part of it\n\t\tsstr s2; s2 << \"Running command: \" << cmd;\n\t\trespond(sock, s2.str());\n\t\tFileHandler::log(s2);\n\n\t\t\/\/TODO: change, thePath, thread\n\t\tstd::string pth = \"\";\n\n\t\t\/\/TODO: change, thePath, thread\n\t\t\/\/Run the command and send the result\n\t\trespond(sock, CommandHandler::runCmd( std::move(cmd), std::move(args), \n\t\t std::move(pth), false), false );\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------------------------------------------------\n\/\/ Copyright (c) 2012 GarageGames, LLC\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/-----------------------------------------------------------------------------\n\n#include \"platform\/platform.h\"\n#include \"gui\/containers\/guiContainer.h\"\n\n#include \"gui\/containers\/guiPanel.h\"\n#include \"console\/consoleTypes.h\"\n#include \"console\/engineAPI.h\"\n\n\nIMPLEMENT_CONOBJECT( GuiContainer );\n\nConsoleDocClass( GuiContainer,\n \"@brief Brief Desc.\\n\\n\"\n \n \"@tsexample\\n\"\n \"\/\/ Comment:\\n\"\n \"%okButton = new ClassObject()\\n\"\n \"instantiation\\n\"\n \"@endtsexample\\n\\n\"\n \n \"@ingroup GuiContainers\"\n);\n\nImplementEnumType( GuiDockingType,\n \"\\n\\n\"\n \"@ingroup GuiContainers\" )\n { Docking::dockNone, \"None\" },\n { Docking::dockClient, \"Client\" },\n { Docking::dockTop, \"Top\" },\n { Docking::dockBottom, \"Bottom\" },\n { Docking::dockLeft, \"Left\" },\n { Docking::dockRight, \"Right\" }\nEndImplementEnumType;\n\n\n\/\/-----------------------------------------------------------------------------\n\nGuiContainer::GuiContainer()\n{\n mUpdateLayout = false;\n mValidDockingMask = Docking::dockNone | Docking::dockBottom | \n Docking::dockTop | Docking::dockClient | \n Docking::dockLeft | Docking::dockRight;\n mIsContainer = true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nGuiContainer::~GuiContainer()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::initPersistFields()\n{\n Con::setIntVariable(\"$DOCKING_NONE\", Docking::dockNone);\n Con::setIntVariable(\"$DOCKING_CLIENT\", Docking::dockClient);\n Con::setIntVariable(\"$DOCKING_TOP\", Docking::dockTop);\n Con::setIntVariable(\"$DOCKING_BOTTOM\", Docking::dockBottom);\n Con::setIntVariable(\"$DOCKING_LEFT\", Docking::dockLeft);\n Con::setIntVariable(\"$DOCKING_RIGHT\", Docking::dockRight);\n \n addGroup( \"Layout\" );\n\n addProtectedField(\"docking\", TYPEID< Docking::DockingType >(), Offset(mSizingOptions.mDocking, GuiContainer), &setDockingField, &defaultProtectedGetFn, \"\" );\n addField(\"margin\", TypeRectSpacingI, Offset(mSizingOptions.mPadding, GuiContainer));\n addField(\"padding\", TypeRectSpacingI, Offset(mSizingOptions.mInternalPadding, GuiContainer));\n addField(\"anchorTop\", TypeBool, Offset(mSizingOptions.mAnchorTop, GuiContainer));\n addField(\"anchorBottom\", TypeBool, Offset(mSizingOptions.mAnchorBottom, GuiContainer));\n addField(\"anchorLeft\", TypeBool, Offset(mSizingOptions.mAnchorLeft, GuiContainer));\n addField(\"anchorRight\", TypeBool, Offset(mSizingOptions.mAnchorRight, GuiContainer));\n \n endGroup( \"Layout\" );\n\n Parent::initPersistFields();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onChildAdded(GuiControl* control)\n{\n Parent::onChildAdded( control );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onChildRemoved(GuiControl* control)\n{\n Parent::onChildRemoved( control );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::reOrder(SimObject* obj, SimObject* target)\n{\n if ( !Parent::reOrder(obj, target) )\n return false;\n\n setUpdateLayout();\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::resize( const Point2I &newPosition, const Point2I &newExtent )\n{\n RectI oldBounds = getBounds();\n Point2I minExtent = getMinExtent();\n\n if( !Parent::resize( newPosition, newExtent ) )\n return false;\n \n RectI clientRect = getClientRect();\n layoutControls( clientRect );\n\n GuiControl *parent = getParent();\n S32 docking = getDocking();\n if( parent && docking != Docking::dockNone && docking != Docking::dockInvalid )\n setUpdateLayout( updateParent );\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::addObject(SimObject *obj)\n{\n Parent::addObject(obj);\n\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::removeObject(SimObject *obj)\n{\n Parent::removeObject(obj);\n\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::parentResized(const RectI &oldParentRect, const RectI &newParentRect)\n{\n\t\/\/if(!mCanResize)\n\t\/\/\treturn;\n\n \/\/ If it's a control that specifies invalid docking, we'll just treat it as an old GuiControl\n if( getDocking() & Docking::dockInvalid || getDocking() & Docking::dockNone)\n return Parent::parentResized( oldParentRect, newParentRect );\n\n S32 deltaX = newParentRect.extent.x - oldParentRect.extent.x;\n S32 deltaY = newParentRect.extent.y - oldParentRect.extent.y;\n\n \/\/ Update Self\n RectI oldThisRect = getBounds();\n anchorControl( this, Point2I( deltaX, deltaY ) );\n RectI newThisRect = getBounds();\n\n \/\/ Update Deltas to pass on to children\n deltaX = newThisRect.extent.x - oldThisRect.extent.x;\n deltaY = newThisRect.extent.y - oldThisRect.extent.y;\n\n \/\/ Iterate over all children and update their anchors\n iterator nI = begin();\n for( ; nI != end(); nI++ )\n {\n \/\/ Sanity\n GuiControl *control = dynamic_cast<GuiControl*>( (*nI) );\n if( control )\n control->parentResized( oldThisRect, newThisRect );\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::childResized(GuiControl *child)\n{\n Parent::childResized( child );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::layoutControls( RectI &clientRect )\n{\n \/\/ This variable is set to the first 'Client' docking \n \/\/ control that is found. We defer client docking until\n \/\/ after all other docks have been made since it will consume\n \/\/ the remaining client area available.\n GuiContainer *clientDocking = NULL;\n\n \/\/ Iterate over all children and perform docking\n iterator nI = begin();\n for( ; nI != end(); nI++ )\n {\n \/\/ Layout Content with proper docking (Client Default)\n GuiControl *control = static_cast<GuiControl*>(*nI);\n \n \/\/ If we're invisible we don't get counted in docking\n if( control == NULL || !control->isVisible() )\n continue;\n\n\t S32 dockingMode = Docking::dockNone;\n\t GuiContainer *container = dynamic_cast<GuiContainer*>(control);\n\t if( container != NULL )\n\t\t dockingMode = container->getDocking();\n else\n continue;\n\n \/\/ See above note about clientDocking pointer\n if( dockingMode & Docking::dockClient && clientDocking == NULL )\n clientDocking = container;\n\n \/\/ Dock Appropriately\n if( !(dockingMode & Docking::dockClient) )\n dockControl( container, dockingMode, clientRect );\n }\n\n \/\/ Do client dock\n if( clientDocking != NULL )\n dockControl( clientDocking, Docking::dockClient, clientRect );\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::dockControl( GuiContainer *control, S32 dockingMode, RectI &clientRect )\n{\n if( !control )\n return false;\n\n \/\/ Make sure this class support docking of this type\n if( !(dockingMode & getValidDockingMask()))\n return false;\n\n \/\/ If our client rect has run out of room, we can't dock any more\n if( !clientRect.isValidRect() )\n return false;\n\n \/\/ Dock Appropriately\n RectI dockRect;\n RectSpacingI rectShrinker;\n ControlSizing sizingOptions = control->getSizingOptions();\n switch( dockingMode )\n {\n case Docking::dockClient:\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(clientRect);\n\n \/\/ Dock to entirety of client rectangle\n control->resize( clientRect.point, clientRect.extent );\n\n \/\/ Remove Client Rect, can only have one client dock\n clientRect.set(0,0,0,0);\n break;\n case Docking::dockTop: \n\n dockRect = clientRect;\n dockRect.extent.y = getMin( control->getHeight() + sizingOptions.mPadding.top + sizingOptions.mPadding.bottom , clientRect.extent.y );\n\n \/\/ Subtract our rect\n clientRect.point.y += dockRect.extent.y;\n clientRect.extent.y -= dockRect.extent.y;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockBottom:\n\n dockRect = clientRect;\n dockRect.extent.y = getMin( control->getHeight() + sizingOptions.mPadding.top + sizingOptions.mPadding.bottom, clientRect.extent.y );\n dockRect.point.y += clientRect.extent.y - dockRect.extent.y;\n\n \/\/ Subtract our rect\n clientRect.extent.y -= dockRect.extent.y;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockLeft:\n\n dockRect = clientRect;\n dockRect.extent.x = getMin( control->getWidth() + sizingOptions.mPadding.left + sizingOptions.mPadding.right, clientRect.extent.x );\n\n \/\/ Subtract our rect\n clientRect.point.x += dockRect.extent.x;\n clientRect.extent.x -= dockRect.extent.x;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockRight:\n\n dockRect = clientRect;\n dockRect.extent.x = getMin( control->getWidth() + sizingOptions.mPadding.left + sizingOptions.mPadding.right, clientRect.extent.x );\n dockRect.point.x += clientRect.extent.x - dockRect.extent.x;\n\n \/\/ Subtract our rect\n clientRect.extent.x -= dockRect.extent.x;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockNone:\n control->setUpdateLayout();\n break;\n }\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::anchorControl( GuiControl *control, const Point2I &deltaParentExtent )\n{\n GuiContainer *container = dynamic_cast<GuiContainer*>( control );\n if( !control || !container )\n return false;\n\n \/\/ If we're docked, we don't anchor to anything\n if( (container->getDocking() & Docking::dockAny) || !(container->getDocking() & Docking::dockInvalid) )\n return false;\n\n if( deltaParentExtent.isZero() )\n return false;\n\n RectI oldRect = control->getBounds();\n RectI newRect = control->getBounds();\n\n F32 deltaBottom = mSizingOptions.mAnchorBottom ? (F32)deltaParentExtent.y : 0.0f;\n F32 deltaRight = mSizingOptions.mAnchorRight ? (F32)deltaParentExtent.x : 0.0f;\n F32 deltaLeft = mSizingOptions.mAnchorLeft ? 0.0f : (F32)deltaParentExtent.x;\n F32 deltaTop = mSizingOptions.mAnchorTop ? 0.0f : (F32)deltaParentExtent.y;\n\n \/\/ Apply Delta's to newRect\n newRect.point.x += (S32)deltaLeft;\n newRect.extent.x += (S32)(deltaRight - deltaLeft);\n newRect.point.y += (S32)deltaTop;\n newRect.extent.y += (S32)(deltaBottom - deltaTop);\n\n Point2I minExtent = control->getMinExtent();\n \/\/ Only resize if our minExtent is satisfied with it.\n if( !( newRect.extent.x >= control->getMinExtent().x && newRect.extent.y >= control->getMinExtent().y ) )\n return false;\n\n if( newRect.point == oldRect.point && newRect.extent == oldRect.extent )\n return false;\n\n \/\/ Finally Size the control\n control->resize( newRect.point, newRect.extent );\n\n \/\/ We made changes\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onPreRender()\n{\n if( mUpdateLayout == updateNone )\n return;\n\n RectI clientRect = getClientRect();\n if( mUpdateLayout & updateSelf )\n layoutControls( clientRect );\n\n GuiContainer *parent = dynamic_cast<GuiContainer*>( getParent() );\n if( parent && ( mUpdateLayout & updateParent ) )\n parent->setUpdateLayout();\n\n \/\/ Always set AFTER layoutControls call to prevent recursive calling of layoutControls - JDD\n mUpdateLayout = updateNone;\n\n Parent::onPreRender();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst RectI GuiContainer::getClientRect()\n{\n RectI resRect = RectI( Point2I(0,0), getExtent() );\n\n \/\/ Inset by padding\n mSizingOptions.mInternalPadding.insetRect( resRect ); \n\n return resRect;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::setDocking( S32 docking )\n{\n mSizingOptions.mDocking = docking; \n setUpdateLayout( updateParent );\n}\n<commit_msg>Removed unused variables<commit_after>\/\/-----------------------------------------------------------------------------\n\/\/ Copyright (c) 2012 GarageGames, LLC\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/-----------------------------------------------------------------------------\n\n#include \"platform\/platform.h\"\n#include \"gui\/containers\/guiContainer.h\"\n\n#include \"gui\/containers\/guiPanel.h\"\n#include \"console\/consoleTypes.h\"\n#include \"console\/engineAPI.h\"\n\n\nIMPLEMENT_CONOBJECT( GuiContainer );\n\nConsoleDocClass( GuiContainer,\n \"@brief Brief Desc.\\n\\n\"\n \n \"@tsexample\\n\"\n \"\/\/ Comment:\\n\"\n \"%okButton = new ClassObject()\\n\"\n \"instantiation\\n\"\n \"@endtsexample\\n\\n\"\n \n \"@ingroup GuiContainers\"\n);\n\nImplementEnumType( GuiDockingType,\n \"\\n\\n\"\n \"@ingroup GuiContainers\" )\n { Docking::dockNone, \"None\" },\n { Docking::dockClient, \"Client\" },\n { Docking::dockTop, \"Top\" },\n { Docking::dockBottom, \"Bottom\" },\n { Docking::dockLeft, \"Left\" },\n { Docking::dockRight, \"Right\" }\nEndImplementEnumType;\n\n\n\/\/-----------------------------------------------------------------------------\n\nGuiContainer::GuiContainer()\n{\n mUpdateLayout = false;\n mValidDockingMask = Docking::dockNone | Docking::dockBottom | \n Docking::dockTop | Docking::dockClient | \n Docking::dockLeft | Docking::dockRight;\n mIsContainer = true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nGuiContainer::~GuiContainer()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::initPersistFields()\n{\n Con::setIntVariable(\"$DOCKING_NONE\", Docking::dockNone);\n Con::setIntVariable(\"$DOCKING_CLIENT\", Docking::dockClient);\n Con::setIntVariable(\"$DOCKING_TOP\", Docking::dockTop);\n Con::setIntVariable(\"$DOCKING_BOTTOM\", Docking::dockBottom);\n Con::setIntVariable(\"$DOCKING_LEFT\", Docking::dockLeft);\n Con::setIntVariable(\"$DOCKING_RIGHT\", Docking::dockRight);\n \n addGroup( \"Layout\" );\n\n addProtectedField(\"docking\", TYPEID< Docking::DockingType >(), Offset(mSizingOptions.mDocking, GuiContainer), &setDockingField, &defaultProtectedGetFn, \"\" );\n addField(\"margin\", TypeRectSpacingI, Offset(mSizingOptions.mPadding, GuiContainer));\n addField(\"padding\", TypeRectSpacingI, Offset(mSizingOptions.mInternalPadding, GuiContainer));\n addField(\"anchorTop\", TypeBool, Offset(mSizingOptions.mAnchorTop, GuiContainer));\n addField(\"anchorBottom\", TypeBool, Offset(mSizingOptions.mAnchorBottom, GuiContainer));\n addField(\"anchorLeft\", TypeBool, Offset(mSizingOptions.mAnchorLeft, GuiContainer));\n addField(\"anchorRight\", TypeBool, Offset(mSizingOptions.mAnchorRight, GuiContainer));\n \n endGroup( \"Layout\" );\n\n Parent::initPersistFields();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onChildAdded(GuiControl* control)\n{\n Parent::onChildAdded( control );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onChildRemoved(GuiControl* control)\n{\n Parent::onChildRemoved( control );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::reOrder(SimObject* obj, SimObject* target)\n{\n if ( !Parent::reOrder(obj, target) )\n return false;\n\n setUpdateLayout();\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::resize( const Point2I &newPosition, const Point2I &newExtent )\n{\n if( !Parent::resize( newPosition, newExtent ) )\n return false;\n \n RectI clientRect = getClientRect();\n layoutControls( clientRect );\n\n GuiControl *parent = getParent();\n S32 docking = getDocking();\n if( parent && docking != Docking::dockNone && docking != Docking::dockInvalid )\n setUpdateLayout( updateParent );\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::addObject(SimObject *obj)\n{\n Parent::addObject(obj);\n\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::removeObject(SimObject *obj)\n{\n Parent::removeObject(obj);\n\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::parentResized(const RectI &oldParentRect, const RectI &newParentRect)\n{\n\t\/\/if(!mCanResize)\n\t\/\/\treturn;\n\n \/\/ If it's a control that specifies invalid docking, we'll just treat it as an old GuiControl\n if( getDocking() & Docking::dockInvalid || getDocking() & Docking::dockNone)\n return Parent::parentResized( oldParentRect, newParentRect );\n\n S32 deltaX = newParentRect.extent.x - oldParentRect.extent.x;\n S32 deltaY = newParentRect.extent.y - oldParentRect.extent.y;\n\n \/\/ Update Self\n RectI oldThisRect = getBounds();\n anchorControl( this, Point2I( deltaX, deltaY ) );\n RectI newThisRect = getBounds();\n\n \/\/ Update Deltas to pass on to children\n deltaX = newThisRect.extent.x - oldThisRect.extent.x;\n deltaY = newThisRect.extent.y - oldThisRect.extent.y;\n\n \/\/ Iterate over all children and update their anchors\n iterator nI = begin();\n for( ; nI != end(); nI++ )\n {\n \/\/ Sanity\n GuiControl *control = dynamic_cast<GuiControl*>( (*nI) );\n if( control )\n control->parentResized( oldThisRect, newThisRect );\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::childResized(GuiControl *child)\n{\n Parent::childResized( child );\n setUpdateLayout();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::layoutControls( RectI &clientRect )\n{\n \/\/ This variable is set to the first 'Client' docking \n \/\/ control that is found. We defer client docking until\n \/\/ after all other docks have been made since it will consume\n \/\/ the remaining client area available.\n GuiContainer *clientDocking = NULL;\n\n \/\/ Iterate over all children and perform docking\n iterator nI = begin();\n for( ; nI != end(); nI++ )\n {\n \/\/ Layout Content with proper docking (Client Default)\n GuiControl *control = static_cast<GuiControl*>(*nI);\n \n \/\/ If we're invisible we don't get counted in docking\n if( control == NULL || !control->isVisible() )\n continue;\n\n\t S32 dockingMode = Docking::dockNone;\n\t GuiContainer *container = dynamic_cast<GuiContainer*>(control);\n\t if( container != NULL )\n\t\t dockingMode = container->getDocking();\n else\n continue;\n\n \/\/ See above note about clientDocking pointer\n if( dockingMode & Docking::dockClient && clientDocking == NULL )\n clientDocking = container;\n\n \/\/ Dock Appropriately\n if( !(dockingMode & Docking::dockClient) )\n dockControl( container, dockingMode, clientRect );\n }\n\n \/\/ Do client dock\n if( clientDocking != NULL )\n dockControl( clientDocking, Docking::dockClient, clientRect );\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::dockControl( GuiContainer *control, S32 dockingMode, RectI &clientRect )\n{\n if( !control )\n return false;\n\n \/\/ Make sure this class support docking of this type\n if( !(dockingMode & getValidDockingMask()))\n return false;\n\n \/\/ If our client rect has run out of room, we can't dock any more\n if( !clientRect.isValidRect() )\n return false;\n\n \/\/ Dock Appropriately\n RectI dockRect;\n RectSpacingI rectShrinker;\n ControlSizing sizingOptions = control->getSizingOptions();\n switch( dockingMode )\n {\n case Docking::dockClient:\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(clientRect);\n\n \/\/ Dock to entirety of client rectangle\n control->resize( clientRect.point, clientRect.extent );\n\n \/\/ Remove Client Rect, can only have one client dock\n clientRect.set(0,0,0,0);\n break;\n case Docking::dockTop: \n\n dockRect = clientRect;\n dockRect.extent.y = getMin( control->getHeight() + sizingOptions.mPadding.top + sizingOptions.mPadding.bottom , clientRect.extent.y );\n\n \/\/ Subtract our rect\n clientRect.point.y += dockRect.extent.y;\n clientRect.extent.y -= dockRect.extent.y;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockBottom:\n\n dockRect = clientRect;\n dockRect.extent.y = getMin( control->getHeight() + sizingOptions.mPadding.top + sizingOptions.mPadding.bottom, clientRect.extent.y );\n dockRect.point.y += clientRect.extent.y - dockRect.extent.y;\n\n \/\/ Subtract our rect\n clientRect.extent.y -= dockRect.extent.y;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockLeft:\n\n dockRect = clientRect;\n dockRect.extent.x = getMin( control->getWidth() + sizingOptions.mPadding.left + sizingOptions.mPadding.right, clientRect.extent.x );\n\n \/\/ Subtract our rect\n clientRect.point.x += dockRect.extent.x;\n clientRect.extent.x -= dockRect.extent.x;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockRight:\n\n dockRect = clientRect;\n dockRect.extent.x = getMin( control->getWidth() + sizingOptions.mPadding.left + sizingOptions.mPadding.right, clientRect.extent.x );\n dockRect.point.x += clientRect.extent.x - dockRect.extent.x;\n\n \/\/ Subtract our rect\n clientRect.extent.x -= dockRect.extent.x;\n\n \/\/ Inset by padding \n sizingOptions.mPadding.insetRect(dockRect);\n\n \/\/ Resize\n control->resize( dockRect.point, dockRect.extent );\n\n break;\n case Docking::dockNone:\n control->setUpdateLayout();\n break;\n }\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool GuiContainer::anchorControl( GuiControl *control, const Point2I &deltaParentExtent )\n{\n GuiContainer *container = dynamic_cast<GuiContainer*>( control );\n if( !control || !container )\n return false;\n\n \/\/ If we're docked, we don't anchor to anything\n if( (container->getDocking() & Docking::dockAny) || !(container->getDocking() & Docking::dockInvalid) )\n return false;\n\n if( deltaParentExtent.isZero() )\n return false;\n\n RectI oldRect = control->getBounds();\n RectI newRect = control->getBounds();\n\n F32 deltaBottom = mSizingOptions.mAnchorBottom ? (F32)deltaParentExtent.y : 0.0f;\n F32 deltaRight = mSizingOptions.mAnchorRight ? (F32)deltaParentExtent.x : 0.0f;\n F32 deltaLeft = mSizingOptions.mAnchorLeft ? 0.0f : (F32)deltaParentExtent.x;\n F32 deltaTop = mSizingOptions.mAnchorTop ? 0.0f : (F32)deltaParentExtent.y;\n\n \/\/ Apply Delta's to newRect\n newRect.point.x += (S32)deltaLeft;\n newRect.extent.x += (S32)(deltaRight - deltaLeft);\n newRect.point.y += (S32)deltaTop;\n newRect.extent.y += (S32)(deltaBottom - deltaTop);\n\n Point2I minExtent = control->getMinExtent();\n \/\/ Only resize if our minExtent is satisfied with it.\n if( !( newRect.extent.x >= control->getMinExtent().x && newRect.extent.y >= control->getMinExtent().y ) )\n return false;\n\n if( newRect.point == oldRect.point && newRect.extent == oldRect.extent )\n return false;\n\n \/\/ Finally Size the control\n control->resize( newRect.point, newRect.extent );\n\n \/\/ We made changes\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::onPreRender()\n{\n if( mUpdateLayout == updateNone )\n return;\n\n RectI clientRect = getClientRect();\n if( mUpdateLayout & updateSelf )\n layoutControls( clientRect );\n\n GuiContainer *parent = dynamic_cast<GuiContainer*>( getParent() );\n if( parent && ( mUpdateLayout & updateParent ) )\n parent->setUpdateLayout();\n\n \/\/ Always set AFTER layoutControls call to prevent recursive calling of layoutControls - JDD\n mUpdateLayout = updateNone;\n\n Parent::onPreRender();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst RectI GuiContainer::getClientRect()\n{\n RectI resRect = RectI( Point2I(0,0), getExtent() );\n\n \/\/ Inset by padding\n mSizingOptions.mInternalPadding.insetRect( resRect ); \n\n return resRect;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid GuiContainer::setDocking( S32 docking )\n{\n mSizingOptions.mDocking = docking; \n setUpdateLayout( updateParent );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\r\n* UrBackup - Client\/Server backup system\r\n* Copyright (C) 2011-2016 Martin Raiber\r\n*\r\n* This program is free software: you can redistribute it and\/or modify\r\n* it under the terms of the GNU Affero General Public License as published by\r\n* the Free Software Foundation, either version 3 of the License, or\r\n* (at your option) any later version.\r\n*\r\n* This program is distributed in the hope that it will be useful,\r\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n* GNU Affero General Public License for more details.\r\n*\r\n* You should have received a copy of the GNU Affero General Public License\r\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n**************************************************************************\/\r\n\r\n#include \"snapshot_helper.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include <stdlib.h>\r\n#include \"..\/stringtools.h\"\r\n#include \"server.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#ifdef _WIN32\r\n#define WEXITSTATUS(x) x\r\n#else\r\n#include <sys\/types.h>\r\n#include <sys\/wait.h>\r\n#endif\r\n\r\nstd::string SnapshotHelper::helper_name=\"urbackup_snapshot_helper\";\r\n\r\nint SnapshotHelper::isAvailable(void)\r\n{\r\n\tint rc=system((helper_name+\" test\").c_str());\r\n\r\n\trc = WEXITSTATUS(rc);\r\n\tif (rc > 10)\r\n\t{\r\n\t\treturn rc - 10;\r\n\t}\r\n\r\n\treturn -1;\r\n}\r\n\r\nbool SnapshotHelper::createEmptyFilesystem(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" create \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::snapshotFileSystem(std::string clientname, std::string old_name, std::string snapshot_name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" snapshot \\\"\"+(clientname)+\"\\\" \\\"\"+(old_name)+\"\\\" \\\"\"+(snapshot_name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::removeFilesystem(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" remove \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::isSubvolume(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \"+convert(BackupServer::getSnapshotMethod())+\" issubvolume \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nvoid SnapshotHelper::setSnapshotHelperCommand(std::string helper_command)\r\n{\r\n\thelper_name=helper_command;\r\n}\r\n\r\nbool SnapshotHelper::makeReadonly(std::string clientname, std::string name)\r\n{\r\n\tint rc = system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" makereadonly \\\"\" + clientname + \"\\\" \\\"\" + name + \"\\\"\").c_str());\r\n\treturn rc == 0;\r\n}\r\n\r\nstd::string SnapshotHelper::getMountpoint(std::string clientname, std::string name)\r\n{\r\n\tstd::string ret;\r\n\tint rc = os_popen(helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" mountpoint \\\"\" + clientname + \"\\\" \\\"\" + name + \"\\\"\",\r\n\t\tret);\r\n\r\n\tif (rc != 0)\r\n\t{\r\n\t\treturn std::string();\r\n\t}\r\n\r\n\treturn trim(ret);\r\n}\r\n<commit_msg>Fix btrfs test<commit_after>\/*************************************************************************\r\n* UrBackup - Client\/Server backup system\r\n* Copyright (C) 2011-2016 Martin Raiber\r\n*\r\n* This program is free software: you can redistribute it and\/or modify\r\n* it under the terms of the GNU Affero General Public License as published by\r\n* the Free Software Foundation, either version 3 of the License, or\r\n* (at your option) any later version.\r\n*\r\n* This program is distributed in the hope that it will be useful,\r\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n* GNU Affero General Public License for more details.\r\n*\r\n* You should have received a copy of the GNU Affero General Public License\r\n* along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n**************************************************************************\/\r\n\r\n#include \"snapshot_helper.h\"\r\n#include \"..\/Interface\/Server.h\"\r\n#include <stdlib.h>\r\n#include \"..\/stringtools.h\"\r\n#include \"server.h\"\r\n#include \"..\/urbackupcommon\/os_functions.h\"\r\n#ifdef _WIN32\r\n#define WEXITSTATUS(x) x\r\n#else\r\n#include <sys\/types.h>\r\n#include <sys\/wait.h>\r\n#endif\r\n\r\nstd::string SnapshotHelper::helper_name=\"urbackup_snapshot_helper\";\r\n\r\nint SnapshotHelper::isAvailable(void)\r\n{\r\n\tint rc=system((helper_name+\" test\").c_str());\r\n\r\n\trc = WEXITSTATUS(rc);\r\n\tif (rc >= 10)\r\n\t{\r\n\t\treturn rc - 10;\r\n\t}\r\n\r\n\treturn -1;\r\n}\r\n\r\nbool SnapshotHelper::createEmptyFilesystem(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" create \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::snapshotFileSystem(std::string clientname, std::string old_name, std::string snapshot_name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" snapshot \\\"\"+(clientname)+\"\\\" \\\"\"+(old_name)+\"\\\" \\\"\"+(snapshot_name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::removeFilesystem(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" remove \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nbool SnapshotHelper::isSubvolume(std::string clientname, std::string name)\r\n{\r\n\tint rc=system((helper_name + \" \"+convert(BackupServer::getSnapshotMethod())+\" issubvolume \\\"\"+(clientname)+\"\\\" \\\"\"+(name)+\"\\\"\").c_str());\r\n\treturn rc==0;\r\n}\r\n\r\nvoid SnapshotHelper::setSnapshotHelperCommand(std::string helper_command)\r\n{\r\n\thelper_name=helper_command;\r\n}\r\n\r\nbool SnapshotHelper::makeReadonly(std::string clientname, std::string name)\r\n{\r\n\tint rc = system((helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" makereadonly \\\"\" + clientname + \"\\\" \\\"\" + name + \"\\\"\").c_str());\r\n\treturn rc == 0;\r\n}\r\n\r\nstd::string SnapshotHelper::getMountpoint(std::string clientname, std::string name)\r\n{\r\n\tstd::string ret;\r\n\tint rc = os_popen(helper_name + \" \" + convert(BackupServer::getSnapshotMethod()) + \" mountpoint \\\"\" + clientname + \"\\\" \\\"\" + name + \"\\\"\",\r\n\t\tret);\r\n\r\n\tif (rc != 0)\r\n\t{\r\n\t\treturn std::string();\r\n\t}\r\n\r\n\treturn trim(ret);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by Derek van Vliet on 2015-03-25.\n\/\/ Copyright (c) 2015 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"FacebookParsePrivatePCH.h\"\n#include \"CallbackDevice.h\"\n\n#if PLATFORM_IOS\nNSArray* GetNSStringArray(TArray<FString> FStringArray)\n{\n\tNSMutableArray* NewArray = [NSMutableArray array];\n\t\n\tfor (auto Itr(FStringArray.CreateIterator()); Itr; Itr++)\n\t{\n\t\tFString String = (*Itr);\n\t\t[NewArray addObject:String.GetNSString()];\n\t}\n\t\n\treturn NewArray;\n}\n#elif PLATFORM_ANDROID\n\n#include \"Android\/AndroidJNI.h\"\n#include \"AndroidApplication.h\"\n\n#endif\n\nvoid UFacebookLoginComponent::OnRegister()\n{\n\tSuper::OnRegister();\n\t\n\t\/\/ init here\n\tFCoreDelegates::ApplicationOpenURLDelegate.AddUObject(this, &UFacebookLoginComponent::ApplicationOpenURL_Handler);\n\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginCancelled_Handler);\n\tUFacebookLoginComponent::FacebookLoginErrorDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginError_Handler);\n\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginSucceeded_Handler);\n}\n\nvoid UFacebookLoginComponent::OnUnregister()\n{\n\tSuper::OnUnregister();\n\t\n\t\/\/ clean up here\n\t\n\tFCoreDelegates::ApplicationOpenURLDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginErrorDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.RemoveAll(this);\n}\n\nvoid UFacebookLoginComponent::FacebookLoginWithReadPermissions(TArray<FString> Permissions)\n{\n#if PLATFORM_IOS\n\tdispatch_async(dispatch_get_main_queue(), ^{\n\t\tFBSDKLoginManager *login = [[FBSDKLoginManager alloc] init];\n\t\t[login logInWithReadPermissions:GetNSStringArray(Permissions) handler:^(FBSDKLoginManagerLoginResult *result, NSError *error)\n\t\t {\n\t\t\tif (error)\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginErrorDelegate.Broadcast(FString([error description]));\n\t\t\t}\n\t\t\telse if (result.isCancelled)\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.Broadcast();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.Broadcast(UFacebookFunctions::FacebookGetUserId(), UFacebookFunctions::FacebookGetAccessToken(), UFacebookFunctions::FacebookGetAccessTokenExpirationDate());\n\t\t\t}\n\t\t }];\n\t});\n#elif PLATFORM_ANDROID\n if (JNIEnv* Env = FAndroidApplication::GetJavaEnv())\n {\n jobjectArray PermissionsArray = (jobjectArray)Env->NewObjectArray(Permissions.Num(), FJavaWrapper::JavaStringClass, NULL);\n \n for (uint32 Param = 0; Param < Permissions.Num(); Param++)\n {\n jstring p = Env->NewStringUTF(TCHAR_TO_UTF8(*Permissions[Param]));\n Env->SetObjectArrayElement(PermissionsArray, Param, p);\n Env->DeleteLocalRef(p);\n }\n \n static jmethodID Method = FJavaWrapper::FindMethod(Env,\n FJavaWrapper::GameActivityClassID,\n \"AndroidThunk_Java_FacebookLoginWithReadPermissions\",\n \"([Ljava\/lang\/String;)V\",\n false);\n FJavaWrapper::CallVoidMethod(Env, FJavaWrapper::GameActivityThis, Method, PermissionsArray);\n Env->DeleteLocalRef(PermissionsArray);\n }\n#endif\n}\n\nvoid UFacebookLoginComponent::ApplicationOpenURL_Handler(FString URL, FString SourceApplication)\n{\n#if PLATFORM_IOS\n\tIOSAppDelegate* appDelegate = (IOSAppDelegate*)[[UIApplication sharedApplication] delegate];\n\t\n\t[[FBSDKApplicationDelegate sharedInstance] application:[UIApplication sharedApplication]\n\t\t\t\t\t\t\t\t\t\t\t\t openURL:[NSURL URLWithString:URL.GetNSString()]\n\t\t\t\t\t\t\t\t\t\t sourceApplication:SourceApplication.GetNSString()\n\t\t\t\t\t\t\t\t\t\t\t\tannotation:appDelegate.launchAnnotation];\n#endif\n}\n\nUFacebookLoginComponent::FFacebookLoginSucceededDelegate UFacebookLoginComponent::FacebookLoginSucceededDelegate;\nUFacebookLoginComponent::FFacebookLoginCancelledDelegate UFacebookLoginComponent::FacebookLoginCancelledDelegate;\nUFacebookLoginComponent::FFacebookLoginErrorDelegate UFacebookLoginComponent::FacebookLoginErrorDelegate;\n<commit_msg>[change] creates comma separated permissions list from permissions passed in via function argument<commit_after>\/\/\n\/\/ Created by Derek van Vliet on 2015-03-25.\n\/\/ Copyright (c) 2015 Get Set Games Inc. All rights reserved.\n\/\/\n\n#include \"FacebookParsePrivatePCH.h\"\n#include \"CallbackDevice.h\"\n\n#if PLATFORM_IOS\nNSArray* GetNSStringArray(TArray<FString> FStringArray)\n{\n\tNSMutableArray* NewArray = [NSMutableArray array];\n\t\n\tfor (auto Itr(FStringArray.CreateIterator()); Itr; Itr++)\n\t{\n\t\tFString String = (*Itr);\n\t\t[NewArray addObject:String.GetNSString()];\n\t}\n\t\n\treturn NewArray;\n}\n#elif PLATFORM_ANDROID\n\n#include \"Android\/AndroidJNI.h\"\n#include \"AndroidApplication.h\"\n\n#endif\n\nvoid UFacebookLoginComponent::OnRegister()\n{\n\tSuper::OnRegister();\n\t\n\t\/\/ init here\n\tFCoreDelegates::ApplicationOpenURLDelegate.AddUObject(this, &UFacebookLoginComponent::ApplicationOpenURL_Handler);\n\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginCancelled_Handler);\n\tUFacebookLoginComponent::FacebookLoginErrorDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginError_Handler);\n\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.AddUObject(this, &UFacebookLoginComponent::FacebookLoginSucceeded_Handler);\n}\n\nvoid UFacebookLoginComponent::OnUnregister()\n{\n\tSuper::OnUnregister();\n\t\n\t\/\/ clean up here\n\t\n\tFCoreDelegates::ApplicationOpenURLDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginErrorDelegate.RemoveAll(this);\n\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.RemoveAll(this);\n}\n\nvoid UFacebookLoginComponent::FacebookLoginWithReadPermissions(TArray<FString> Permissions)\n{\n#if PLATFORM_IOS\n\tdispatch_async(dispatch_get_main_queue(), ^{\n\t\tFBSDKLoginManager *login = [[FBSDKLoginManager alloc] init];\n\t\t[login logInWithReadPermissions:GetNSStringArray(Permissions) handler:^(FBSDKLoginManagerLoginResult *result, NSError *error)\n\t\t {\n\t\t\tif (error)\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginErrorDelegate.Broadcast(FString([error description]));\n\t\t\t}\n\t\t\telse if (result.isCancelled)\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginCancelledDelegate.Broadcast();\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tUFacebookLoginComponent::FacebookLoginSucceededDelegate.Broadcast(UFacebookFunctions::FacebookGetUserId(), UFacebookFunctions::FacebookGetAccessToken(), UFacebookFunctions::FacebookGetAccessTokenExpirationDate());\n\t\t\t}\n\t\t }];\n\t});\n#elif PLATFORM_ANDROID\n if (JNIEnv* Env = FAndroidApplication::GetJavaEnv())\n {\n\t\tFString p;\n\n\t\tconst int32 kNumPermissions = Permissions.Num();\n\n\t\tfor (int32 i = 0; i < kNumPermissions; i++)\n\t\t{\n\t\t\tp += Permissions[i];\n\n\t\t\tif (i < kNumPermissions - 1)\n\t\t\t{\n\t\t\t\tp += \",\";\n\t\t\t}\n\t\t}\n\n\t\tjstring j = Env->NewStringUTF(TCHAR_TO_UTF8(*p));\n\n static jmethodID Method = FJavaWrapper::FindMethod(Env,\n FJavaWrapper::GameActivityClassID,\n \"AndroidThunk_Java_FacebookLoginWithReadPermissions\",\n \"(Ljava\/lang\/String;)V\",\n false);\n FJavaWrapper::CallVoidMethod(Env, FJavaWrapper::GameActivityThis, Method, j);\n\t\tEnv->DeleteLocalRef(j);\n }\n#endif\n}\n\nvoid UFacebookLoginComponent::ApplicationOpenURL_Handler(FString URL, FString SourceApplication)\n{\n#if PLATFORM_IOS\n\tIOSAppDelegate* appDelegate = (IOSAppDelegate*)[[UIApplication sharedApplication] delegate];\n\t\n\t[[FBSDKApplicationDelegate sharedInstance] application:[UIApplication sharedApplication]\n\t\t\t\t\t\t\t\t\t\t\t\t openURL:[NSURL URLWithString:URL.GetNSString()]\n\t\t\t\t\t\t\t\t\t\t sourceApplication:SourceApplication.GetNSString()\n\t\t\t\t\t\t\t\t\t\t\t\tannotation:appDelegate.launchAnnotation];\n#endif\n}\n\nUFacebookLoginComponent::FFacebookLoginSucceededDelegate UFacebookLoginComponent::FacebookLoginSucceededDelegate;\nUFacebookLoginComponent::FFacebookLoginCancelledDelegate UFacebookLoginComponent::FacebookLoginCancelledDelegate;\nUFacebookLoginComponent::FFacebookLoginErrorDelegate UFacebookLoginComponent::FacebookLoginErrorDelegate;\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ Original author: Jim Blandy <jimb@mozilla.com> <jimb@red-bean.com>\n\n\/\/ language.cc: Subclasses and singletons for google_breakpad::Language.\n\/\/ See language.h for details.\n\n#include \"common\/language.h\"\n\n#include <stdlib.h>\n\n#if !defined(__ANDROID__)\n#include <cxxabi.h>\n#endif\n\n#if defined(HAVE_RUST_DEMANGLE)\n#include <rust_demangle.h>\n#endif\n\n#include <limits>\n\nnamespace {\n\nstring MakeQualifiedNameWithSeparator(const string& parent_name,\n const char* separator,\n const string& name) {\n if (parent_name.empty()) {\n return name;\n }\n\n return parent_name + separator + name;\n}\n\n} \/\/ namespace\n\nnamespace google_breakpad {\n\n\/\/ C++ language-specific operations.\nclass CPPLanguage: public Language {\n public:\n CPPLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \"::\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n string* demangled) const {\n#if defined(__ANDROID__)\n \/\/ Android NDK doesn't provide abi::__cxa_demangle.\n demangled->clear();\n return kDontDemangle;\n#else\n int status;\n char* demangled_c =\n abi::__cxa_demangle(mangled.c_str(), NULL, NULL, &status);\n\n DemangleResult result;\n if (status == 0) {\n result = kDemangleSuccess;\n demangled->assign(demangled_c);\n } else {\n result = kDemangleFailure;\n demangled->clear();\n }\n\n if (demangled_c) {\n free(reinterpret_cast<void*>(demangled_c));\n }\n\n return result;\n#endif\n }\n};\n\nCPPLanguage CPPLanguageSingleton;\n\n\/\/ Java language-specific operations.\nclass JavaLanguage: public Language {\n public:\n JavaLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n};\n\nJavaLanguage JavaLanguageSingleton;\n\n\/\/ Swift language-specific operations.\nclass SwiftLanguage: public Language {\n public:\n SwiftLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n string* demangled) const {\n \/\/ There is no programmatic interface to a Swift demangler. Pass through the\n \/\/ mangled form because it encodes more information than the qualified name\n \/\/ that would have been built by MakeQualifiedName(). The output can be\n \/\/ post-processed by xcrun swift-demangle to transform mangled Swift names\n \/\/ into something more readable.\n demangled->assign(mangled);\n return kDemangleSuccess;\n }\n};\n\nSwiftLanguage SwiftLanguageSingleton;\n\n\/\/ Rust language-specific operations.\nclass RustLanguage: public Language {\n public:\n RustLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n std::string* demangled) const {\n \/\/ Rust names use GCC C++ name mangling, but demangling them with\n \/\/ abi_demangle doesn't produce stellar results due to them having\n \/\/ another layer of encoding.\n \/\/ If callers provide rustc-demangle, use that.\n#if defined(HAVE_RUST_DEMANGLE)\n char* rust_demangled = rust_demangle(mangled.c_str());\n if (rust_demangled == nullptr) {\n return kDemangleFailure;\n }\n demangled->assign(rust_demangled);\n free_rust_demangled_name(rust_demangled);\n#else\n \/\/ Otherwise, pass through the mangled name so callers can demangle\n \/\/ after the fact.\n demangled->assign(mangled);\n#endif\n return kDemangleSuccess;\n }\n};\n\nRustLanguage RustLanguageSingleton;\n\n\/\/ Assembler language-specific operations.\nclass AssemblerLanguage: public Language {\n public:\n AssemblerLanguage() {}\n\n bool HasFunctions() const { return false; }\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return name;\n }\n};\n\nAssemblerLanguage AssemblerLanguageSingleton;\n\nconst Language * const Language::CPlusPlus = &CPPLanguageSingleton;\nconst Language * const Language::Java = &JavaLanguageSingleton;\nconst Language * const Language::Swift = &SwiftLanguageSingleton;\nconst Language * const Language::Rust = &RustLanguageSingleton;\nconst Language * const Language::Assembler = &AssemblerLanguageSingleton;\n\n} \/\/ namespace google_breakpad\n<commit_msg>Use string instead of std::string<commit_after>\/\/ Copyright (c) 2010 Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ Original author: Jim Blandy <jimb@mozilla.com> <jimb@red-bean.com>\n\n\/\/ language.cc: Subclasses and singletons for google_breakpad::Language.\n\/\/ See language.h for details.\n\n#include \"common\/language.h\"\n\n#include <stdlib.h>\n\n#if !defined(__ANDROID__)\n#include <cxxabi.h>\n#endif\n\n#if defined(HAVE_RUST_DEMANGLE)\n#include <rust_demangle.h>\n#endif\n\n#include <limits>\n\nnamespace {\n\nstring MakeQualifiedNameWithSeparator(const string& parent_name,\n const char* separator,\n const string& name) {\n if (parent_name.empty()) {\n return name;\n }\n\n return parent_name + separator + name;\n}\n\n} \/\/ namespace\n\nnamespace google_breakpad {\n\n\/\/ C++ language-specific operations.\nclass CPPLanguage: public Language {\n public:\n CPPLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \"::\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n string* demangled) const {\n#if defined(__ANDROID__)\n \/\/ Android NDK doesn't provide abi::__cxa_demangle.\n demangled->clear();\n return kDontDemangle;\n#else\n int status;\n char* demangled_c =\n abi::__cxa_demangle(mangled.c_str(), NULL, NULL, &status);\n\n DemangleResult result;\n if (status == 0) {\n result = kDemangleSuccess;\n demangled->assign(demangled_c);\n } else {\n result = kDemangleFailure;\n demangled->clear();\n }\n\n if (demangled_c) {\n free(reinterpret_cast<void*>(demangled_c));\n }\n\n return result;\n#endif\n }\n};\n\nCPPLanguage CPPLanguageSingleton;\n\n\/\/ Java language-specific operations.\nclass JavaLanguage: public Language {\n public:\n JavaLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n};\n\nJavaLanguage JavaLanguageSingleton;\n\n\/\/ Swift language-specific operations.\nclass SwiftLanguage: public Language {\n public:\n SwiftLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n string* demangled) const {\n \/\/ There is no programmatic interface to a Swift demangler. Pass through the\n \/\/ mangled form because it encodes more information than the qualified name\n \/\/ that would have been built by MakeQualifiedName(). The output can be\n \/\/ post-processed by xcrun swift-demangle to transform mangled Swift names\n \/\/ into something more readable.\n demangled->assign(mangled);\n return kDemangleSuccess;\n }\n};\n\nSwiftLanguage SwiftLanguageSingleton;\n\n\/\/ Rust language-specific operations.\nclass RustLanguage: public Language {\n public:\n RustLanguage() {}\n\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return MakeQualifiedNameWithSeparator(parent_name, \".\", name);\n }\n\n virtual DemangleResult DemangleName(const string& mangled,\n string* demangled) const {\n \/\/ Rust names use GCC C++ name mangling, but demangling them with\n \/\/ abi_demangle doesn't produce stellar results due to them having\n \/\/ another layer of encoding.\n \/\/ If callers provide rustc-demangle, use that.\n#if defined(HAVE_RUST_DEMANGLE)\n char* rust_demangled = rust_demangle(mangled.c_str());\n if (rust_demangled == nullptr) {\n return kDemangleFailure;\n }\n demangled->assign(rust_demangled);\n free_rust_demangled_name(rust_demangled);\n#else\n \/\/ Otherwise, pass through the mangled name so callers can demangle\n \/\/ after the fact.\n demangled->assign(mangled);\n#endif\n return kDemangleSuccess;\n }\n};\n\nRustLanguage RustLanguageSingleton;\n\n\/\/ Assembler language-specific operations.\nclass AssemblerLanguage: public Language {\n public:\n AssemblerLanguage() {}\n\n bool HasFunctions() const { return false; }\n string MakeQualifiedName(const string &parent_name,\n const string &name) const {\n return name;\n }\n};\n\nAssemblerLanguage AssemblerLanguageSingleton;\n\nconst Language * const Language::CPlusPlus = &CPPLanguageSingleton;\nconst Language * const Language::Java = &JavaLanguageSingleton;\nconst Language * const Language::Swift = &SwiftLanguageSingleton;\nconst Language * const Language::Rust = &RustLanguageSingleton;\nconst Language * const Language::Assembler = &AssemblerLanguageSingleton;\n\n} \/\/ namespace google_breakpad\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestHigherOrderCell.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkGenericCell.h\"\n#include \"vtkPoints.h\"\n\nstatic const unsigned int depth = 5;\nstatic unsigned char HigherOrderCell[][depth] = {\n { VTK_LINE, VTK_QUADRATIC_EDGE, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_TRIANGLE, VTK_QUADRATIC_TRIANGLE, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_QUAD, VTK_QUADRATIC_QUAD, VTK_QUADRATIC_LINEAR_QUAD,\n VTK_BIQUADRATIC_QUAD, VTK_NUMBER_OF_CELL_TYPES},\n { VTK_TETRA, VTK_QUADRATIC_TETRA, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_HEXAHEDRON, VTK_QUADRATIC_HEXAHEDRON,\n VTK_BIQUADRATIC_QUADRATIC_HEXAHEDRON, VTK_TRIQUADRATIC_HEXAHEDRON, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_WEDGE, VTK_QUADRATIC_WEDGE, VTK_QUADRATIC_LINEAR_WEDGE,\n VTK_BIQUADRATIC_QUADRATIC_WEDGE, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_PYRAMID, VTK_QUADRATIC_PYRAMID, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES }\n };\n\n\/\/----------------------------------------------------------------------------\n\/\/ Simply set the points to the pcoords coordinate\n\/\/ and the point id to the natural order\nvoid InitializeACell(vtkCell *cell)\n{\n if( cell )\n {\n double *pcoords = cell->GetParametricCoords();\n int numPts = cell->GetNumberOfPoints();\n for(int i = 0; i < numPts; ++i)\n {\n double *point = pcoords + 3*i;\n cell->GetPointIds()->SetId(i,i);\n \/\/cerr << point[0] << \",\" << point[1] << \",\" << point[2] << endl;\n cell->GetPoints()->SetPoint(i, point);\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ c1 is the reference cell. In the test this is the linear cell\n\/\/ and thus c2 is the higher order one. We need to check that result on c1\n\/\/ are consistant with result on c2 (but we cannot say anything after that)\nint CompareHigherOrderCell(vtkCell *c1, vtkCell *c2)\n{\n int rval = 0;\n \/\/c1->Print( cout );\n \/\/c2->Print( cout );\n int c1numPts = c1->GetNumberOfPoints();\n int c2numPts = c2->GetNumberOfPoints();\n int numPts = c1numPts < c2numPts ? c1numPts : c2numPts;\n for( int p = 0; p < numPts; ++p)\n {\n vtkIdType pid1 = c1->GetPointId(p);\n vtkIdType pid2 = c2->GetPointId(p);\n if( pid1 != pid2 )\n {\n cerr << \"Problem with pid:\" << pid1 << \" != \" << pid2 << \" in cell #\" <<\n c1->GetCellType() << \" and #\" << c2->GetCellType() << endl;\n ++rval;\n }\n double *pt1 = c1->Points->GetPoint(p);\n double *pt2 = c2->Points->GetPoint(p);\n if( pt1[0] != pt2[0]\n || pt1[1] != pt2[1]\n || pt1[2] != pt2[2])\n {\n cerr << \"Problem with points coord:\" << \n pt1[0] << \",\" << pt1[1] << \",\" << pt1[2]\n << \" != \" <<\n pt2[0] << \",\" << pt2[1] << \",\" << pt2[2]\n << \" in cell #\" <<\n c1->GetCellType() << \" and #\" << c2->GetCellType() << endl;\n ++rval;\n }\n }\n return rval;\n}\n\n\/\/----------------------------------------------------------------------------\nint TestHigherOrderCell(int , char *[])\n{\n int rval = 0;\n if( sizeof(HigherOrderCell[0]) != depth )\n {\n cerr << sizeof(HigherOrderCell[0]) << endl;\n cerr << \"Problem in the test\" << endl;\n return 1;\n }\n\n const unsigned char *orderCell;\n const unsigned int nCells = sizeof(HigherOrderCell)\/depth;\n vtkCell* cellArray[depth];\n for( unsigned int i = 0; i < nCells; ++i)\n {\n orderCell = HigherOrderCell[i];\n \/\/cerr << \"Higher : \" << (int)orderCell[0] << \",\" << (int)orderCell[1] << \",\"\n \/\/ << (int)orderCell[2] << \",\" << (int)orderCell[3] << \",\" << (int)orderCell[4] << endl;\n for( unsigned int c = 0; c < depth; ++c)\n {\n const int cellType = orderCell[c];\n cellArray[c] = vtkGenericCell::InstantiateCell(cellType);\n InitializeACell( cellArray[c] );\n }\n vtkCell *linCell = cellArray[0]; \/\/ this is the reference linear cell\n vtkCell *quadCell = cellArray[1]; \/\/ this is the reference quadratic cell (serendipity)\n \/\/const int numPts = linCell->GetNumberOfPoints();\n const int numEdges = linCell->GetNumberOfEdges();\n const int numFaces = linCell->GetNumberOfFaces();\n const int dim = linCell->GetCellDimension();\n \/\/ First check consistancy across cell of higher dimension:\n \/\/ Technically doing the loop from 1 to depth will be redundant when doing the\n \/\/ CompareHigherOrderCell on the quadratic cell since we will compare the exactly\n \/\/ same cell...\n for( unsigned int c = 1; c < depth; ++c)\n {\n vtkCell *cell = cellArray[c];\n if( cell )\n {\n if( cell->GetCellType() != (int)orderCell[c] )\n {\n cerr << \"Problem in the test\" << endl;\n ++rval;\n }\n if( cell->GetCellDimension() != dim )\n {\n cerr << \"Wrong dim for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n if( cell->GetNumberOfEdges() != numEdges)\n {\n cerr << \"Wrong numEdges for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n if( cell->GetNumberOfFaces() != numFaces )\n {\n cerr << \"Wrong numFace for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n \/\/ Make sure that edge across all different cell are identical\n for(int e=0; e<numEdges; ++e)\n {\n vtkCell *c1 = linCell->GetEdge(e);\n vtkCell *c2 = cell->GetEdge(e);\n cerr << \"Doing Edge: #\" << e << \" comp:\" << linCell->GetCellType() << \" vs \"\n << cell->GetCellType() << endl;\n rval += CompareHigherOrderCell(c1, c2);\n \/\/vtkCell *qc1 = quadCell->GetEdge(e);\n \/\/cerr << \"Doing Edge: #\" << e << \" comp:\" << quadCell->GetCellType() << \" vs \"\n \/\/ << cell->GetCellType() << endl;\n \/\/rval += CompareHigherOrderCell(qc1, c2);\n }\n \/\/ Make sure that face across all different cell are identical\n for(int f=0; f<numFaces; ++f)\n {\n vtkCell *f1 = linCell->GetFace(f);\n vtkCell *f2 = cell->GetFace(f);\n cerr << \"Doing Face: #\" << f << \" comp:\" << linCell->GetCellType() << \" vs \"\n << cell->GetCellType() << endl;\n rval += CompareHigherOrderCell(f1, f2);\n \/\/vtkCell *qf1 = quadCell->GetFace(f);\n \/\/cerr << \"Doing Face: #\" << f << \" comp:\" << quadCell->GetCellType() << \" vs \"\n \/\/ << cell->GetCellType() << endl;\n \/\/rval += CompareHigherOrderCell(qf1, f2);\n }\n }\n }\n \/\/ Cleanup\n for( unsigned int c = 0; c < depth; ++c)\n {\n vtkCell *cell = cellArray[c];\n if( cell )\n {\n cell->Delete();\n }\n }\n }\n\n return rval;\n}\n\n<commit_msg>COMP: Remove warning<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestHigherOrderCell.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkGenericCell.h\"\n#include \"vtkPoints.h\"\n\nstatic const unsigned int depth = 5;\nstatic unsigned char HigherOrderCell[][depth] = {\n { VTK_LINE, VTK_QUADRATIC_EDGE, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_TRIANGLE, VTK_QUADRATIC_TRIANGLE, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_QUAD, VTK_QUADRATIC_QUAD, VTK_QUADRATIC_LINEAR_QUAD,\n VTK_BIQUADRATIC_QUAD, VTK_NUMBER_OF_CELL_TYPES},\n { VTK_TETRA, VTK_QUADRATIC_TETRA, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_HEXAHEDRON, VTK_QUADRATIC_HEXAHEDRON,\n VTK_BIQUADRATIC_QUADRATIC_HEXAHEDRON, VTK_TRIQUADRATIC_HEXAHEDRON, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_WEDGE, VTK_QUADRATIC_WEDGE, VTK_QUADRATIC_LINEAR_WEDGE,\n VTK_BIQUADRATIC_QUADRATIC_WEDGE, VTK_NUMBER_OF_CELL_TYPES },\n { VTK_PYRAMID, VTK_QUADRATIC_PYRAMID, VTK_NUMBER_OF_CELL_TYPES,\n VTK_NUMBER_OF_CELL_TYPES, VTK_NUMBER_OF_CELL_TYPES }\n };\n\n\/\/----------------------------------------------------------------------------\n\/\/ Simply set the points to the pcoords coordinate\n\/\/ and the point id to the natural order\nvoid InitializeACell(vtkCell *cell)\n{\n if( cell )\n {\n double *pcoords = cell->GetParametricCoords();\n int numPts = cell->GetNumberOfPoints();\n for(int i = 0; i < numPts; ++i)\n {\n double *point = pcoords + 3*i;\n cell->GetPointIds()->SetId(i,i);\n \/\/cerr << point[0] << \",\" << point[1] << \",\" << point[2] << endl;\n cell->GetPoints()->SetPoint(i, point);\n }\n }\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ c1 is the reference cell. In the test this is the linear cell\n\/\/ and thus c2 is the higher order one. We need to check that result on c1\n\/\/ are consistant with result on c2 (but we cannot say anything after that)\nint CompareHigherOrderCell(vtkCell *c1, vtkCell *c2)\n{\n int rval = 0;\n \/\/c1->Print( cout );\n \/\/c2->Print( cout );\n int c1numPts = c1->GetNumberOfPoints();\n int c2numPts = c2->GetNumberOfPoints();\n int numPts = c1numPts < c2numPts ? c1numPts : c2numPts;\n for( int p = 0; p < numPts; ++p)\n {\n vtkIdType pid1 = c1->GetPointId(p);\n vtkIdType pid2 = c2->GetPointId(p);\n if( pid1 != pid2 )\n {\n cerr << \"Problem with pid:\" << pid1 << \" != \" << pid2 << \" in cell #\" <<\n c1->GetCellType() << \" and #\" << c2->GetCellType() << endl;\n ++rval;\n }\n double *pt1 = c1->Points->GetPoint(p);\n double *pt2 = c2->Points->GetPoint(p);\n if( pt1[0] != pt2[0]\n || pt1[1] != pt2[1]\n || pt1[2] != pt2[2])\n {\n cerr << \"Problem with points coord:\" << \n pt1[0] << \",\" << pt1[1] << \",\" << pt1[2]\n << \" != \" <<\n pt2[0] << \",\" << pt2[1] << \",\" << pt2[2]\n << \" in cell #\" <<\n c1->GetCellType() << \" and #\" << c2->GetCellType() << endl;\n ++rval;\n }\n }\n return rval;\n}\n\n\/\/----------------------------------------------------------------------------\nint TestHigherOrderCell(int , char *[])\n{\n int rval = 0;\n if( sizeof(HigherOrderCell[0]) != depth )\n {\n cerr << sizeof(HigherOrderCell[0]) << endl;\n cerr << \"Problem in the test\" << endl;\n return 1;\n }\n\n const unsigned char *orderCell;\n const unsigned int nCells = sizeof(HigherOrderCell)\/depth;\n vtkCell* cellArray[depth];\n for( unsigned int i = 0; i < nCells; ++i)\n {\n orderCell = HigherOrderCell[i];\n \/\/cerr << \"Higher : \" << (int)orderCell[0] << \",\" << (int)orderCell[1] << \",\"\n \/\/ << (int)orderCell[2] << \",\" << (int)orderCell[3] << \",\" << (int)orderCell[4] << endl;\n for( unsigned int c = 0; c < depth; ++c)\n {\n const int cellType = orderCell[c];\n cellArray[c] = vtkGenericCell::InstantiateCell(cellType);\n InitializeACell( cellArray[c] );\n }\n vtkCell *linCell = cellArray[0]; \/\/ this is the reference linear cell\n \/\/vtkCell *quadCell = cellArray[1]; \/\/ this is the reference quadratic cell (serendipity)\n \/\/const int numPts = linCell->GetNumberOfPoints();\n const int numEdges = linCell->GetNumberOfEdges();\n const int numFaces = linCell->GetNumberOfFaces();\n const int dim = linCell->GetCellDimension();\n \/\/ First check consistancy across cell of higher dimension:\n \/\/ Technically doing the loop from 1 to depth will be redundant when doing the\n \/\/ CompareHigherOrderCell on the quadratic cell since we will compare the exactly\n \/\/ same cell...\n for( unsigned int c = 1; c < depth; ++c)\n {\n vtkCell *cell = cellArray[c];\n if( cell )\n {\n if( cell->GetCellType() != (int)orderCell[c] )\n {\n cerr << \"Problem in the test\" << endl;\n ++rval;\n }\n if( cell->GetCellDimension() != dim )\n {\n cerr << \"Wrong dim for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n if( cell->GetNumberOfEdges() != numEdges)\n {\n cerr << \"Wrong numEdges for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n if( cell->GetNumberOfFaces() != numFaces )\n {\n cerr << \"Wrong numFace for cellId #\" << cell->GetCellType() << endl;\n ++rval;\n }\n \/\/ Make sure that edge across all different cell are identical\n for(int e=0; e<numEdges; ++e)\n {\n vtkCell *c1 = linCell->GetEdge(e);\n vtkCell *c2 = cell->GetEdge(e);\n cerr << \"Doing Edge: #\" << e << \" comp:\" << linCell->GetCellType() << \" vs \"\n << cell->GetCellType() << endl;\n rval += CompareHigherOrderCell(c1, c2);\n \/\/vtkCell *qc1 = quadCell->GetEdge(e);\n \/\/cerr << \"Doing Edge: #\" << e << \" comp:\" << quadCell->GetCellType() << \" vs \"\n \/\/ << cell->GetCellType() << endl;\n \/\/rval += CompareHigherOrderCell(qc1, c2);\n }\n \/\/ Make sure that face across all different cell are identical\n for(int f=0; f<numFaces; ++f)\n {\n vtkCell *f1 = linCell->GetFace(f);\n vtkCell *f2 = cell->GetFace(f);\n cerr << \"Doing Face: #\" << f << \" comp:\" << linCell->GetCellType() << \" vs \"\n << cell->GetCellType() << endl;\n rval += CompareHigherOrderCell(f1, f2);\n \/\/vtkCell *qf1 = quadCell->GetFace(f);\n \/\/cerr << \"Doing Face: #\" << f << \" comp:\" << quadCell->GetCellType() << \" vs \"\n \/\/ << cell->GetCellType() << endl;\n \/\/rval += CompareHigherOrderCell(qf1, f2);\n }\n }\n }\n \/\/ Cleanup\n for( unsigned int c = 0; c < depth; ++c)\n {\n vtkCell *cell = cellArray[c];\n if( cell )\n {\n cell->Delete();\n }\n }\n }\n\n return rval;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ *****************************************************************************\n\/\/\n\/\/ Copyright (c) 2014, Southwest Research Institute® (SwRI®)\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Southwest Research Institute® (SwRI®) nor the\n\/\/ names of its contributors may be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ *****************************************************************************\n\n#include <swri_yaml_util\/yaml_util.h>\n\n#include <stdio.h>\n\/\/ C++ standard libraries\n#include <sstream>\n#include <iomanip>\n#ifdef YAMLCPP_OLD_API\n#include <fstream>\n#endif \/\/ YAMLCPP_OLD_API\n\n#ifndef YAMLCPP_OLD_API\nnamespace YAML\n{\n void operator >> (const YAML::Node& node, float& value)\n {\n value = node.as<float>();\n }\n\n void operator >> (const YAML::Node& node, double& value)\n {\n value = node.as<double>();\n }\n\n void operator >> (const YAML::Node& node, bool& value)\n {\n value = node.as<bool>();\n }\n\n void operator >> (const YAML::Node& node, int16_t& value)\n {\n value = node.as<int16_t>();\n }\n\n void operator >> (const YAML::Node& node, uint16_t& value)\n {\n value = node.as<uint16_t>();\n }\n\n void operator >> (const YAML::Node& node, int32_t& value)\n {\n value = node.as<int32_t>();\n }\n\n void operator >> (const YAML::Node& node, uint32_t& value)\n {\n value = node.as<uint32_t>();\n }\n\n void operator >> (const YAML::Node& node, int64_t& value)\n {\n value = node.as<int64_t>();\n }\n \n void operator >> (const YAML::Node& node, uint64_t& value)\n {\n value = node.as<uint64_t>();\n }\n\n void operator >> (const YAML::Node& node, std::string& value)\n {\n value = node.as<std::string>();\n }\n}\n#endif \/\/ YAMLCPP_OLD_API\n\nnamespace swri_yaml_util\n{\n bool LoadFile(const std::string& path, YAML::Node& yaml)\n {\n try\n {\n #ifndef YAMLCPP_OLD_API\n yaml = YAML::LoadFile(path);\n #else\n std::ifstream fin(path.c_str());\n if (fin.fail())\n {\n return false;\n }\n \n YAML::Parser parser(fin);\n parser.GetNextDocument(yaml);\n #endif \/\/ YAMLCPP_OLD_API\n }\n catch (...)\n {\n return false;\n }\n \n return true;\n }\n\n bool LoadString(const std::string& input, YAML::Node& yaml)\n {\n try\n {\n#ifndef YAMLCPP_OLD_API\n yaml = YAML::Load(input);\n#else\n std::stringstream stream(input);\n YAML::Parser parser(stream);\n parser.GetNextDocument(yaml);\n#endif \/\/ YAMLCPP_OLD_API\n }\n catch (...)\n {\n return false;\n }\n \n return true;\n }\n\n bool LoadMap(const std::map<std::string,std::string>& dict, YAML::Node& yaml)\n {\n std::vector<std::string> items;\n \n for (std::map<std::string,std::string>::const_iterator iter = dict.begin();\n iter != dict.end();\n ++iter)\n {\n if (!iter->first.empty()) {\n items.push_back(\"\\\"\" + iter->first + \"\\\": \\\"\" + iter->second + \"\\\"\");\n }\n }\n\n std::string input = \"{ \";\n for (size_t i = 0; i < items.size(); ++i) {\n input += items[i];\n if (i+1 < items.size()) {\n input += \", \";\n }\n }\n input += \"}\";\n\n printf(\"stringified: %s\", input.c_str());\n \n return LoadString(input, yaml);\n }\n \n bool FindValue(const YAML::Node& node, const std::string& name)\n {\n #ifndef YAMLCPP_OLD_API\n return node[name];\n #else\n return node.FindValue(name);\n #endif \/\/ YAMLCPP_OLD_API\n }\n \n std::auto_ptr<YAML::Node> Clone(const YAML::Node& node)\n {\n #ifndef YAMLCPP_OLD_API\n return std::auto_ptr<YAML::Node>(new YAML::Node(YAML::Clone(node)));\n #else\n return node.Clone();\n #endif \/\/ YAMLCPP_OLD_API\n }\n \n std::string ToString(double value, int32_t precision)\n {\n std::stringstream ss;\n ss << std::setprecision(precision) << value;\n\n return ss.str();\n }\n}\n<commit_msg>swri_yaml_util: fix compatibility with yaml-cpp 0.7.0<commit_after>\/\/ *****************************************************************************\n\/\/\n\/\/ Copyright (c) 2014, Southwest Research Institute® (SwRI®)\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of Southwest Research Institute® (SwRI®) nor the\n\/\/ names of its contributors may be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY\n\/\/ DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ *****************************************************************************\n\n#include <swri_yaml_util\/yaml_util.h>\n\n#include <stdio.h>\n\/\/ C++ standard libraries\n#include <sstream>\n#include <iomanip>\n#ifdef YAMLCPP_OLD_API\n#include <fstream>\n#endif \/\/ YAMLCPP_OLD_API\n\n#ifndef YAMLCPP_OLD_API\nnamespace YAML\n{\n void operator >> (const YAML::Node& node, float& value)\n {\n value = node.as<float>();\n }\n\n void operator >> (const YAML::Node& node, double& value)\n {\n value = node.as<double>();\n }\n\n void operator >> (const YAML::Node& node, bool& value)\n {\n value = node.as<bool>();\n }\n\n void operator >> (const YAML::Node& node, int16_t& value)\n {\n value = node.as<int16_t>();\n }\n\n void operator >> (const YAML::Node& node, uint16_t& value)\n {\n value = node.as<uint16_t>();\n }\n\n void operator >> (const YAML::Node& node, int32_t& value)\n {\n value = node.as<int32_t>();\n }\n\n void operator >> (const YAML::Node& node, uint32_t& value)\n {\n value = node.as<uint32_t>();\n }\n\n void operator >> (const YAML::Node& node, int64_t& value)\n {\n value = node.as<int64_t>();\n }\n \n void operator >> (const YAML::Node& node, uint64_t& value)\n {\n value = node.as<uint64_t>();\n }\n\n void operator >> (const YAML::Node& node, std::string& value)\n {\n value = node.as<std::string>();\n }\n}\n#endif \/\/ YAMLCPP_OLD_API\n\nnamespace swri_yaml_util\n{\n bool LoadFile(const std::string& path, YAML::Node& yaml)\n {\n try\n {\n #ifndef YAMLCPP_OLD_API\n yaml = YAML::LoadFile(path);\n #else\n std::ifstream fin(path.c_str());\n if (fin.fail())\n {\n return false;\n }\n \n YAML::Parser parser(fin);\n parser.GetNextDocument(yaml);\n #endif \/\/ YAMLCPP_OLD_API\n }\n catch (...)\n {\n return false;\n }\n \n return true;\n }\n\n bool LoadString(const std::string& input, YAML::Node& yaml)\n {\n try\n {\n#ifndef YAMLCPP_OLD_API\n yaml = YAML::Load(input);\n#else\n std::stringstream stream(input);\n YAML::Parser parser(stream);\n parser.GetNextDocument(yaml);\n#endif \/\/ YAMLCPP_OLD_API\n }\n catch (...)\n {\n return false;\n }\n \n return true;\n }\n\n bool LoadMap(const std::map<std::string,std::string>& dict, YAML::Node& yaml)\n {\n std::vector<std::string> items;\n \n for (std::map<std::string,std::string>::const_iterator iter = dict.begin();\n iter != dict.end();\n ++iter)\n {\n if (!iter->first.empty()) {\n items.push_back(\"\\\"\" + iter->first + \"\\\": \\\"\" + iter->second + \"\\\"\");\n }\n }\n\n std::string input = \"{ \";\n for (size_t i = 0; i < items.size(); ++i) {\n input += items[i];\n if (i+1 < items.size()) {\n input += \", \";\n }\n }\n input += \"}\";\n\n printf(\"stringified: %s\", input.c_str());\n \n return LoadString(input, yaml);\n }\n \n bool FindValue(const YAML::Node& node, const std::string& name)\n {\n #ifndef YAMLCPP_OLD_API\n return static_cast<bool>(node[name]);\n #else\n return node.FindValue(name);\n #endif \/\/ YAMLCPP_OLD_API\n }\n \n std::auto_ptr<YAML::Node> Clone(const YAML::Node& node)\n {\n #ifndef YAMLCPP_OLD_API\n return std::auto_ptr<YAML::Node>(new YAML::Node(YAML::Clone(node)));\n #else\n return node.Clone();\n #endif \/\/ YAMLCPP_OLD_API\n }\n \n std::string ToString(double value, int32_t precision)\n {\n std::stringstream ss;\n ss << std::setprecision(precision) << value;\n\n return ss.str();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"common\/platform.h\"\n\nstd::wstring WinNTStringToWideString( const std::string& str )\n{\n size_t slen = str.length();\n int len = MultiByteToWideChar( CP_ACP, 0,\n input.c_str(),\n static_cast<int>(slen) + 1,\n 0,\n 0 );\n\n \/\/ Allocate space for the new wstring\n wchar_t *buffer = new wchar_t[len];\n\n MultiByteToWideChar( CP_ACP, 0,\n str.c_str(),\n static_cast<int>(slen) + 1,\n buffer,\n len );\n\n std::wstring result( buffer );\n delete[] buffer;\n\n return result;\n}\n \n<commit_msg>removing now defunct windows file. all code belongs in platform_vista.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/* This file is part of Ingen.\n * Copyright 2007-2011 David Robillard <http:\/\/drobilla.net>\n *\n * Ingen is free software; you can redistribute it and\/or modify it under the\n * terms of the GNU General Public License as published by the Free Software\n * Foundation; either version 2 of the License, or (at your option) any later\n * version.\n *\n * Ingen is distributed in the hope that it will be useful, but WITHOUT ANY\n * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"Connection.hpp\"\n#include \"Port.hpp\"\n\n#include \"ingen\/client\/ConnectionModel.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace GUI {\n\nConnection::Connection(FlowCanvas::Canvas& canvas,\n boost::shared_ptr<const ConnectionModel> model,\n FlowCanvas::Connectable* src,\n FlowCanvas::Connectable* dst,\n uint32_t color)\n\t: FlowCanvas::Connection(canvas, src, dst, color)\n\t, _connection_model(model)\n{\n\tPort* const src_port = dynamic_cast<Port*>(src);\n\tif (src_port)\n\t\t_bpath->property_dash() = src_port->dash();\n}\n\n} \/\/ namespace GUI\n} \/\/ namespace Ingen\n<commit_msg>Implement connections as a custom gnomecanvas C widget. Hide all gnomecanvas API completely from Connection.hpp.<commit_after>\/* This file is part of Ingen.\n * Copyright 2007-2011 David Robillard <http:\/\/drobilla.net>\n *\n * Ingen is free software; you can redistribute it and\/or modify it under the\n * terms of the GNU General Public License as published by the Free Software\n * Foundation; either version 2 of the License, or (at your option) any later\n * version.\n *\n * Ingen is distributed in the hope that it will be useful, but WITHOUT ANY\n * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"Connection.hpp\"\n#include \"Port.hpp\"\n\n#include \"ingen\/client\/ConnectionModel.hpp\"\n\nusing namespace std;\n\nnamespace Ingen {\nnamespace GUI {\n\nConnection::Connection(FlowCanvas::Canvas& canvas,\n boost::shared_ptr<const ConnectionModel> model,\n FlowCanvas::Connectable* src,\n FlowCanvas::Connectable* dst,\n uint32_t color)\n\t: FlowCanvas::Connection(canvas, src, dst, color)\n\t, _connection_model(model)\n{\n}\n\n} \/\/ namespace GUI\n} \/\/ namespace Ingen\n<|endoftext|>"} {"text":"<commit_before>\/* QuickCross Project\n * License: APACHE-2.0\n * Author: Ben Lau\n * Project Site: https:\/\/github.com\/benlau\/quickcross\n *\n *\/\n\n#include <QSysInfo>\n#include <QtGlobal>\n#include \"qcdevice.h\"\n\n#ifdef Q_OS_ANDROID\n#include <QAndroidJniEnvironment>\n#include <QAndroidJniObject>\n#endif\n\nstatic qreal m_dp = 1;\n\n\/*!\n * \\qmltype Device\n * \\instantiates QCDevice\n * \\inqmlmodule QuickCross\n * \\inherits QObject\n *\n * \\brief Provider of device related information\n * It is a singleton component\n *\n *\/\n\n\nQCDevice::QCDevice(QObject *parent) : QObject(parent)\n{\n\n#ifdef Q_OS_ANDROID\n QAndroidJniObject activity = QAndroidJniObject::callStaticObjectMethod(\"org\/qtproject\/qt5\/android\/QtNative\", \"activity\", \"()Landroid\/app\/Activity;\");\n QAndroidJniObject resource = activity.callObjectMethod(\"getResources\",\"()Landroid\/content\/res\/Resources;\");\n QAndroidJniObject metrics = resource.callObjectMethod(\"getDisplayMetrics\",\"()Landroid\/util\/DisplayMetrics;\");\n m_dp = metrics.getField<float>(\"density\");\n#endif\n}\n\n\/*!\n * \\qmlproperty string Device::os\n * This property hold the product name of the operating system this application is running in.\n * It is equivalent to QSysInfo::productType()\n *\n *\/\n\nQString QCDevice::os() const\n{\n QString res = \"unknown\";\n\n#ifdef Q_OS_LINUX\n \/\/ Don't return a distribution name\n res = \"linux\"\n#else\n res = QSysInfo::productType();\n#endif\n\n return res;\n}\n\n\/*!\n * \\qmlproperty bool Device::isAndroid\n *\/\n\nbool QCDevice::isAndroid() const\n{\n#ifdef Q_OS_ANDROID\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isLinux\n *\/\n\nbool QCDevice::isLinux() const\n{\n#ifdef Q_OS_LINUX\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isIOS\n *\/\n\nbool QCDevice::isIOS() const\n{\n#ifdef Q_OS_IOS\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isMac\n *\/\n\nbool QCDevice::isMac() const\n{\n#ifdef Q_OS_MAC\n return true;\n#else\n return false;\n#endif\n\n}\n\n\/*!\n * \\qmlproperty bool Device::isWindows\n *\/\n\nbool QCDevice::isWindows() const\n{\n#ifdef Q_OS_WIN32\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty real Device::dp\n *\n * This property hold the density independent pixel (DP) of the Android device this application is running.\n *\n * It is valid only in Android system. In other system, the default value is 1.\n *\n *\/\n\nqreal QCDevice::dp() const\n{\n return m_dp;\n}\n\n<commit_msg>Fix build problem<commit_after>\/* QuickCross Project\n * License: APACHE-2.0\n * Author: Ben Lau\n * Project Site: https:\/\/github.com\/benlau\/quickcross\n *\n *\/\n\n#include <QSysInfo>\n#include <QtGlobal>\n#include \"qcdevice.h\"\n\n#ifdef Q_OS_ANDROID\n#include <QAndroidJniEnvironment>\n#include <QAndroidJniObject>\n#endif\n\nstatic qreal m_dp = 1;\n\n\/*!\n * \\qmltype Device\n * \\instantiates QCDevice\n * \\inqmlmodule QuickCross\n * \\inherits QObject\n *\n * \\brief Provider of device related information\n * It is a singleton component\n *\n *\/\n\n\nQCDevice::QCDevice(QObject *parent) : QObject(parent)\n{\n\n#ifdef Q_OS_ANDROID\n QAndroidJniObject activity = QAndroidJniObject::callStaticObjectMethod(\"org\/qtproject\/qt5\/android\/QtNative\", \"activity\", \"()Landroid\/app\/Activity;\");\n QAndroidJniObject resource = activity.callObjectMethod(\"getResources\",\"()Landroid\/content\/res\/Resources;\");\n QAndroidJniObject metrics = resource.callObjectMethod(\"getDisplayMetrics\",\"()Landroid\/util\/DisplayMetrics;\");\n m_dp = metrics.getField<float>(\"density\");\n#endif\n}\n\n\/*!\n * \\qmlproperty string Device::os\n * This property hold the product name of the operating system this application is running in.\n * It is equivalent to QSysInfo::productType()\n *\n *\/\n\nQString QCDevice::os() const\n{\n QString res = \"unknown\";\n\n#ifdef Q_OS_LINUX\n \/\/ Don't return a distribution name\n res = \"linux\";\n#else\n res = QSysInfo::productType();\n#endif\n\n return res;\n}\n\n\/*!\n * \\qmlproperty bool Device::isAndroid\n *\/\n\nbool QCDevice::isAndroid() const\n{\n#ifdef Q_OS_ANDROID\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isLinux\n *\/\n\nbool QCDevice::isLinux() const\n{\n#ifdef Q_OS_LINUX\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isIOS\n *\/\n\nbool QCDevice::isIOS() const\n{\n#ifdef Q_OS_IOS\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty bool Device::isMac\n *\/\n\nbool QCDevice::isMac() const\n{\n#ifdef Q_OS_MAC\n return true;\n#else\n return false;\n#endif\n\n}\n\n\/*!\n * \\qmlproperty bool Device::isWindows\n *\/\n\nbool QCDevice::isWindows() const\n{\n#ifdef Q_OS_WIN32\n return true;\n#else\n return false;\n#endif\n}\n\n\/*!\n * \\qmlproperty real Device::dp\n *\n * This property hold the density independent pixel (DP) of the Android device this application is running.\n *\n * It is valid only in Android system. In other system, the default value is 1.\n *\n *\/\n\nqreal QCDevice::dp() const\n{\n return m_dp;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File NodalTetElec.cpp\n\/\/\n\/\/ For more information, please see: http:\/\/www.nektar.info\n\/\/\n\/\/ The MIT License\n\/\/\n\/\/ Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),\n\/\/ Department of Aeronautics, Imperial College London (UK), and Scientific\n\/\/ Computing and Imaging Institute, University of Utah (USA).\n\/\/\n\/\/ License for the specific language governing rights and limitations under\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\/\/ \n\/\/ Description: 3D Nodal Tet Electrostatic Point Definitions\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <iostream>\n#include <algorithm>\n#include <LibUtilities\/Foundations\/Points.h>\n#include <LibUtilities\/Foundations\/Foundations.hpp>\n\n#include <LibUtilities\/BasicUtils\/ErrorUtil.hpp>\n#include <LibUtilities\/Polylib\/Polylib.h>\n#include <LibUtilities\/Foundations\/NodalTetElec.h>\n#include <LibUtilities\/Foundations\/NodalTetElecData.h>\n\nnamespace Nektar\n{\n namespace LibUtilities \n {\n void NodalTetElec::CalculatePoints()\n {\n \/\/ Allocate the storage for points\n Points<double>::CalculatePoints();\n ASSERTL0(false, \"3D Point Expansion Not Implemented Yet\");\n }\n\n void NodalTetElec::CalculateWeights()\n {\n \/\/ No weights computed\n }\n\n void NodalTetElec::CalculateDerivMatrix()\n {\n \/\/ No derivative matrix computed\n }\n\n boost::shared_ptr<NodalTetElec::PointsBaseType> NodalTetElec::Create(const PointsKey &key)\n {\n boost::shared_ptr<PointsBaseType> returnval(MemoryManager<NodalTetElec>::AllocateSharedPtr(key));\n returnval->Initialize();\n return returnval;\n }\n\n void NodalTetElec::NodalPointReorder3d()\n {\n } \n\n } \/\/ end of namespace stdregion\n} \/\/ end of namespace stdregion\n\n\n\/**\n* $Log: NodalTetElec.cpp,v $\n* Revision 1.8 2007\/07\/20 00:28:26 bnelson\n* Replaced boost::shared_ptr with Nektar::ptr\n*\n* Revision 1.7 2007\/05\/15 03:37:24 bnelson\n* Updated to use the new Array object.\n*\n* Revision 1.6 2007\/04\/30 23:29:09 jfrazier\n* More conversion to multi_array.\n*\n* Revision 1.5 2007\/04\/29 00:31:57 jfrazier\n* Updated to use multi_arrays.\n*\n*\/\n<commit_msg>Updated Tetrahedron symmetry and calculate points<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ File NodalTetElec.cpp\n\/\/\n\/\/ For more information, please see: http:\/\/www.nektar.info\n\/\/\n\/\/ The MIT License\n\/\/\n\/\/ Copyright (c) 2006 Division of Applied Mathematics, Brown University (USA),\n\/\/ Department of Aeronautics, Imperial College London (UK), and Scientific\n\/\/ Computing and Imaging Institute, University of Utah (USA).\n\/\/\n\/\/ License for the specific language governing rights and limitations under\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\/\/ \n\/\/ Description: 3D Nodal Tet Electrostatic Point Definitions\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <iostream>\n#include <algorithm>\n#include <LibUtilities\/Foundations\/Points.h>\n#include <LibUtilities\/Foundations\/Foundations.hpp>\n\n#include <LibUtilities\/BasicUtils\/ErrorUtil.hpp>\n#include <LibUtilities\/Polylib\/Polylib.h>\n#include <LibUtilities\/Foundations\/NodalTetElec.h>\n#include <LibUtilities\/Foundations\/NodalTetElecData.h>\n\nnamespace Nektar\n{\n namespace LibUtilities \n {\n void NodalTetElec::CalculatePoints()\n {\n \/\/ Allocate the storage for points\n Points<double>::CalculatePoints();\n\n int index=0,isum=0;\n const int offset = 5; \/\/offset to match Datafile\n NekDouble a,b,c,d;\n unsigned int numPoints = GetNumPoints();\n\n \/\/ initialize values\n for(unsigned int i=0; i < numPoints-2; ++i)\n {\n index += NodalTetElecNPTS[i];\n }\n\n for(unsigned int i=0; i < NodalTetElecNPTS[numPoints-2]; ++i, ++index)\n {\n \/\/ 1 Point Symmetry: aaaa\n if(int(NodalTetElecData[index][0]))\n {\n a = NodalTetElecData[index][5];\n b = NodalTetElecData[index][6];\n c = NodalTetElecData[index][7];\n d = NodalTetElecData[index][8];\n\n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n continue;\n }\/\/end symmetry 1\n\n \n \/\/ 4 Point symmetry: aaab or abbb\n if(int(NodalTetElecData[index][1]))\n {\n for(unsigned int j=0; j < 4; ++j)\n {\n a = NodalTetElecData[index][offset + perm4_3d[j][0]];\n b = NodalTetElecData[index][offset + perm4_3d[j][1]];\n c = NodalTetElecData[index][offset + perm4_3d[j][2]];\n d = NodalTetElecData[index][offset + perm4_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue;\n }\/\/end symmetry 4\n\n \n \/\/ 6 Point symmetry: aabb\n if(int(NodalTetElecData[index][2]))\n {\n for(unsigned int j=0; j < 6; ++j)\n {\n a = NodalTetElecData[index][offset + perm6_3d[j][0]];\n b = NodalTetElecData[index][offset + perm6_3d[j][1]];\n c = NodalTetElecData[index][offset + perm6_3d[j][2]];\n d = NodalTetElecData[index][offset + perm6_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue; \n }\/\/end symmetry6 \n \n\n \/\/ 12 Point symmetry: case aabc\n if(int(NodalTetElecData[index][3]) == 1)\n {\n for(unsigned int j=0; j < 12; ++j)\n {\n a = NodalTetElecData[index][offset + perm12A_3d[j][0]];\n b = NodalTetElecData[index][offset + perm12A_3d[j][1]];\n c = NodalTetElecData[index][offset + perm12A_3d[j][2]];\n d = NodalTetElecData[index][offset + perm12A_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue;\n }\/\/end symmetry 12 aabc\n\n \n \/\/ 12 Point symmetry: case abcc\n if(int(NodalTetElecData[index][3]) == 2)\n {\n for(unsigned int j=0; j < 12; ++j)\n {\n a = NodalTetElecData[index][offset + perm12B_3d[j][0]];\n b = NodalTetElecData[index][offset + perm12B_3d[j][1]];\n c = NodalTetElecData[index][offset + perm12B_3d[j][2]];\n d = NodalTetElecData[index][offset + perm12B_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue;\n }\/\/end symmetry 12 abcc\n\n\n \/\/ 12 Point symmetry: case abbc\n if(int(NodalTetElecData[index][3]) == 3)\n {\n for(unsigned int j=0; j < 12; ++j)\n {\n a = NodalTetElecData[index][offset + perm12C_3d[j][0]];\n b = NodalTetElecData[index][offset + perm12C_3d[j][1]];\n c = NodalTetElecData[index][offset + perm12C_3d[j][2]];\n d = NodalTetElecData[index][offset + perm12C_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue;\n }\/\/end symmetry 12 abbc\n\n \n \/\/ 24 Point symmetry: case abcd\n if(int(NodalTetElecData[index][4]))\n {\n for(unsigned int j=0; j < 24; ++j)\n {\n a = NodalTetElecData[index][offset + perm24_3d[j][0]];\n b = NodalTetElecData[index][offset + perm24_3d[j][1]];\n c = NodalTetElecData[index][offset + perm24_3d[j][2]];\n d = NodalTetElecData[index][offset + perm24_3d[j][3]];\n \n m_points[0][isum] = 2.0*b - 1.0;\n m_points[1][isum] = 2.0*c - 1.0;\n m_points[2][isum] = 2.0*d - 1.0;\n isum++;\n }\/\/end j\n continue;\n }\/\/end symmetry24abcd\n \n\n }\/\/end npts\n\n NodalPointReorder3d();\n\n ASSERTL1((isum==m_pointsKey.GetTotNumPoints()),\"sum not equal to npts\"); \n }\n\n void NodalTetElec::CalculateWeights()\n {\n \/\/ No weights computed\n }\n\n void NodalTetElec::CalculateDerivMatrix()\n {\n \/\/ No derivative matrix computed\n }\n\n boost::shared_ptr<NodalTetElec::PointsBaseType> NodalTetElec::Create(const PointsKey &key)\n {\n boost::shared_ptr<PointsBaseType> returnval(MemoryManager<NodalTetElec>::AllocateSharedPtr(key));\n returnval->Initialize();\n return returnval;\n }\n\n void NodalTetElec::NodalPointReorder3d()\n {\n } \n\n } \/\/ end of namespace stdregion\n} \/\/ end of namespace stdregion\n\n\n\/**\n* $Log: NodalTetElec.cpp,v $\n* Revision 1.9 2007\/07\/22 23:03:26 bnelson\n* Backed out Nektar::ptr.\n*\n* Revision 1.8 2007\/07\/20 00:28:26 bnelson\n* Replaced boost::shared_ptr with Nektar::ptr\n*\n* Revision 1.7 2007\/05\/15 03:37:24 bnelson\n* Updated to use the new Array object.\n*\n* Revision 1.6 2007\/04\/30 23:29:09 jfrazier\n* More conversion to multi_array.\n*\n* Revision 1.5 2007\/04\/29 00:31:57 jfrazier\n* Updated to use multi_arrays.\n*\n*\/\n<|endoftext|>"} {"text":"<commit_before>#include \"SUIT_FileDlg.h\"\n\n#include \"SUIT_Tools.h\" \n#include \"SUIT_Session.h\"\n#include \"SUIT_Desktop.h\"\n#include \"SUIT_MessageBox.h\"\n#include \"SUIT_ResourceMgr.h\"\n#include \"SUIT_FileValidator.h\"\n\n#include <qdir.h>\n#include <qlabel.h>\n#include <qregexp.h>\n#include <qpalette.h>\n#include <qobjectlist.h>\n#include <qpushbutton.h>\n#include <qapplication.h>\n\n#define MIN_COMBO_SIZE 100\n\nQString SUIT_FileDlg::myLastVisitedPath;\n\n\/*!\nConstructor\n*\/\nSUIT_FileDlg::SUIT_FileDlg( QWidget* parent, bool open, bool showQuickDir, bool modal ) :\nQFileDialog( parent, 0, modal ),\nmyValidator( 0 ),\nmyQuickCombo( 0 ),\nmyOpen( open )\n{ \n if ( parent->icon() )\n setIcon( *parent->icon() ); \n setSizeGripEnabled( true );\n \n if (showQuickDir) {\n \/\/ inserting quick dir combo box\n QLabel* lab = new QLabel(tr(\"Quick path:\"), this);\n myQuickCombo = new QComboBox(false, this);\n myQuickCombo->setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed));\n myQuickCombo->setMinimumSize(MIN_COMBO_SIZE, 0);\n \n \/\/ the following is a workaround for proper layouting of custom widgets ===========\n QPushButton* btn = new QPushButton(this);\n btn->setEnabled(false);\n QPalette pal = btn->palette();\n QColorGroup ca = pal.active();\n ca.setColor(QColorGroup::Light, palette().active().background());\n ca.setColor(QColorGroup::Midlight, palette().active().background());\n ca.setColor(QColorGroup::Dark, palette().active().background());\n ca.setColor(QColorGroup::Mid, palette().active().background());\n ca.setColor(QColorGroup::Shadow, palette().active().background());\n QColorGroup ci = pal.inactive();\n ci.setColor(QColorGroup::Light, palette().inactive().background());\n ci.setColor(QColorGroup::Midlight, palette().inactive().background());\n ci.setColor(QColorGroup::Dark, palette().inactive().background());\n ci.setColor(QColorGroup::Mid, palette().inactive().background());\n ci.setColor(QColorGroup::Shadow, palette().inactive().background());\n QColorGroup cd = pal.disabled();\n cd.setColor(QColorGroup::Light, palette().disabled().background());\n cd.setColor(QColorGroup::Midlight, palette().disabled().background());\n cd.setColor(QColorGroup::Dark, palette().disabled().background());\n cd.setColor(QColorGroup::Mid, palette().disabled().background());\n cd.setColor(QColorGroup::Shadow, palette().disabled().background());\n pal.setActive(ca); pal.setInactive(ci); pal.setDisabled(cd);\n btn->setPalette(pal);\n \/\/ ================================================================================\n\n connect(myQuickCombo, SIGNAL(activated(const QString&)), this, SLOT(quickDir(const QString&)));\n addWidgets(lab, myQuickCombo, btn);\n\n \/\/ getting dir list from settings\n QString dirs;\n SUIT_ResourceMgr* resMgr = SUIT_Session::session()->resourceMgr();\n if ( resMgr )\n dirs = resMgr->stringValue( \"FileDlg\", \"QuickDirList\" );\n\n QStringList dirList = QStringList::split(';', dirs, false);\n if (dirList.count() > 0) {\n for (unsigned i = 0; i < dirList.count(); i++)\n\t myQuickCombo->insertItem(dirList[i]);\n }\n else {\n myQuickCombo->insertItem(QDir::homeDirPath());\n }\n\n \/\/ the following is a workaround for proper layouting of custom widgets ===========\n QValueList<QPushButton*> buttonList;\n QValueList<QLabel*> labelList;\n const QObjectList *list = children();\n QObjectListIt it(*list);\n int maxButWidth = lab->sizeHint().width();\n int maxLabWidth = btn->sizeHint().width();\n \n for (; it.current() ; ++it) {\n if ( it.current()->isA( \"QLabel\" ) ) {\n\tint tempW = ((QLabel*)it.current())->minimumWidth();\n\tif ( maxLabWidth < tempW ) maxLabWidth = tempW;\n\tlabelList.append( (QLabel*)it.current() );\n }\n else if( it.current()->isA(\"QPushButton\") ) {\n\tint tempW = ((QPushButton*)it.current())->minimumWidth();\n\tif ( maxButWidth < tempW ) maxButWidth = tempW;\n\tbuttonList.append( (QPushButton*)it.current() );\n }\n }\n if (maxButWidth > 0) {\n QValueList<QPushButton*>::Iterator bListIt;\n for ( bListIt = buttonList.begin(); bListIt != buttonList.end(); ++bListIt )\n\t(*bListIt)->setFixedWidth( maxButWidth );\n }\n if (maxLabWidth > 0) {\n QValueList<QLabel*>::Iterator lListIt;\n for ( lListIt = labelList.begin(); lListIt != labelList.end(); ++lListIt )\n\t(*lListIt)->setFixedWidth( maxLabWidth );\n }\n \/\/ ================================================================================\n }\n setMode( myOpen ? ExistingFile : AnyFile ); \n setCaption( myOpen ? tr( \"INF_DESK_DOC_OPEN\" ) : tr( \"INF_DESK_DOC_SAVE\" ) );\n if (myLastVisitedPath.isNull() || myLastVisitedPath.isEmpty()) {\n \/\/ If no last visited path exists -> switch to the first preferred path\n processPath(myQuickCombo->text(0));\n } \n else if ( !processPath(myLastVisitedPath) ) {\n \/\/ If last visited path doesn't exist -> switch to the first preferred path\n processPath(myQuickCombo->text(0));\n }\n myValidator = new SUIT_FileValidator(this);\n \n}\n\n\/*!\nDestructor\n*\/\nSUIT_FileDlg::~SUIT_FileDlg() \n{\n}\n\n\/*!\nSets validator for file names to open\/save\nDeletes previous validator\n*\/\nvoid SUIT_FileDlg::setValidator( SUIT_FileValidator* v )\n{\n if (myValidator)\n delete myValidator;\n myValidator = v;\n}\n\n\/*!\nReturns the selected file\n*\/\nQString SUIT_FileDlg::selectedFile() const\n{\n return mySelectedFile;\n}\n\n\/*!\nReturns 'true' if this is 'Open File' dialog \nand 'false' if 'Save File' dialog\n*\/\nbool SUIT_FileDlg::isOpenDlg() const\n{\n return myOpen;\n}\n\n\/*!\nCloses this dialog and sets the return code to 'Accepted'\nif the selected name is valid ( see 'acceptData()' )\n*\/\nvoid SUIT_FileDlg::accept()\n{\n\/\/ mySelectedFile = QFileDialog::selectedFile().simplifyWhiteSpace(); \/\/VSR- 06\/12\/02\n mySelectedFile = QFileDialog::selectedFile(); \/\/VSR+ 06\/12\/02\n addExtension();\n\/\/ mySelectedFile = mySelectedFile.simplifyWhiteSpace(); \/\/VSR- 06\/12\/02\n\n \/* Qt 2.2.2 BUG: accept() is called twice if you validate \n the selected file name by pressing 'Return' key in file \n name editor but this name is not acceptable for acceptData()\n *\/\n if ( acceptData() ) {\n myLastVisitedPath = dirPath();\n QFileDialog::accept(); \n }\n}\n\n\/*!\nCloses this dialog and sets the return code to 'Rejected' \n*\/\nvoid SUIT_FileDlg::reject()\n{\n mySelectedFile = QString::null;\n QFileDialog::reject(); \n}\n\n\/*!\nReturns 'true' if selected file is valid.\nThe validity is checked by a file validator, \nif there is no validator the file is always\nconsidered as valid \n*\/\nbool SUIT_FileDlg::acceptData()\n{ \n if ( myValidator )\n {\n if ( isOpenDlg() )\n return myValidator->canOpen( selectedFile() );\n else \n return myValidator->canSave( selectedFile() );\n }\n return true;\n}\n\n\/*!\nAdds an extension to the selected file name\nif the file has not it.\nThe extension is extracted from the active filter.\n*\/\nvoid SUIT_FileDlg::addExtension()\n{\n\/\/ mySelectedFile.stripWhiteSpace();\/\/VSR- 06\/12\/02\n\/\/ if ( mySelectedFile.isEmpty() )\/\/VSR- 06\/12\/02\n if ( mySelectedFile.stripWhiteSpace().isEmpty() )\/\/VSR+ 06\/12\/02\n return;\n\n\/\/ if ( SUIT_Tools::getFileExtensionFromPath( mySelectedFile ).isEmpty() ) \/\/VSR- 06\/12\/02\n\/\/ota : 16\/12\/03 if ( SUIT_Tools::getFileExtensionFromPath( mySelectedFile ).isEmpty() ) \/\/VSR+ 06\/12\/02\n\/\/ {\n\n#if QT_VERSION < 0x030000\n QRegExp r( QString::fromLatin1(\"([a-zA-Z0-9.*? +;#]*)$\") );\n int len, index = r.match( selectedFilter(), 0, &len );\n#else\n QRegExp r( QString::fromLatin1(\"\\\\([a-zA-Z0-9.*? +;#]*\\\\)$\") );\n int index = r.search(selectedFilter());\n#endif\n if ( index >= 0 ) \n { \n#if QT_VERSION < 0x030000\n\/\/ QString wildcard = selectedFilter().mid( index + 1, len-2 ); \/\/VSR- 06\/12\/02\n QString wildcard = selectedFilter().mid( index + 1, len-2 ).stripWhiteSpace(); \/\/VSR+ 06\/12\/02\n#else\n\/\/ QString wildcard = selectedFilter().mid( index + 1, r.matchedLength()-2 ); \/\/VSR- 06\/12\/02\n QString wildcard = selectedFilter().mid( index + 1, r.matchedLength()-2 ).stripWhiteSpace(); \/\/VSR+ 06\/12\/02\n#endif\n int aLen = mySelectedFile.length();\n if ( mySelectedFile[aLen - 1] == '.')\n\t \/\/if the file name ends with the point remove it\n\t mySelectedFile.truncate(aLen - 1);\n QString anExt = \".\" + SUIT_Tools::extension( mySelectedFile ).stripWhiteSpace();\n \/\/ From the filters list make a pattern to validate a file extension\n \/\/ Due to transformations from the filter list (*.txt *.*xx *.c++ SUIT*.* ) we \n \/\/ will have the pattern (\\.txt|\\..*xx|\\.c\\+\\+|\\..*) (as we validate extension only we remove\n \/\/ stay extension mask only in the pattern\n QString aPattern(wildcard);\n QRegExp anExtRExp(\"(\"+aPattern.replace(QRegExp(\"(^| )[0-9a-zA-Z*_?]*\\\\.\"), \" \\\\.\").\n\t\t\tstripWhiteSpace().replace(QRegExp(\"\\\\s+\"), \"|\").\n\t\t\treplace(QRegExp(\"[*]\"),\".*\").replace(QRegExp(\"[+]\"),\"\\\\+\") + \")\");\n \n if ( anExtRExp.match(anExt) == -1 ) \/\/if a selected file extension does not match to filter's list\n\t{ \/\/remove a point if it is at the word end\n int aExtLen = anExt.length();\n\t if (anExt[ aExtLen - 1 ] == '.') anExt.truncate( aExtLen - 1 );\n\t index = wildcard.findRev( '.' ); \n\t if ( index >= 0 ) \n\t mySelectedFile += wildcard.mid( index ); \/\/add the extension\n\t}\n }\n \/\/ }\n}\n\n\/*!\n Processes selection : tries to set given path or filename as selection\n*\/\nbool SUIT_FileDlg::processPath( const QString& path )\n{\n if ( !path.isNull() ) {\n QFileInfo fi( path );\n if ( fi.exists() ) {\n if ( fi.isFile() )\n\tsetSelection( path );\n else if ( fi.isDir() )\n\tsetDir( path );\n return true;\n }\n else {\n if ( QFileInfo( fi.dirPath() ).exists() ) {\n\tsetDir( fi.dirPath() );\n\treturn true;\n }\n }\n }\n return false;\n}\n\/*!\n Called when user selects item from \"Quick Dir\" combo box\n*\/\nvoid SUIT_FileDlg::quickDir(const QString& dirPath)\n{\n if ( !QDir(dirPath).exists() ) {\n SUIT_MessageBox::error1(this, \n\t\t\t tr(\"ERR_ERROR\"),\n\t\t\t tr(\"ERR_DIR_NOT_EXIST\").arg(dirPath), \n\t\t\t tr(\"BUT_OK\"));\n \n }\n else {\n processPath(dirPath);\n }\n}\n\n\/*!\n Returns the file name for Open\/Save [ static ]\n*\/\nQString SUIT_FileDlg::getFileName( QWidget* parent, \n\t\t\t\t const QString& initial, \n const QStringList& filters, \n const QString& caption,\n bool open,\n\t\t\t\t bool showQuickDir, \n\t\t\t\t SUIT_FileValidator* validator )\n{ \n SUIT_FileDlg* fd = new SUIT_FileDlg( parent, open, showQuickDir, true ); \n if ( !caption.isEmpty() )\n fd->setCaption( caption );\n if ( !initial.isEmpty() ) { \n fd->processPath( initial ); \/\/ VSR 24\/03\/03 check for existing of directory has been added to avoid QFileDialog's bug\n }\n fd->setFilters( filters ); \n if ( validator )\n fd->setValidator( validator );\n fd->exec();\n QString filename = fd->selectedFile();\n delete fd;\n qApp->processEvents();\n return filename;\n}\n\n\/*!\n Existing directory selection dialog [ static ]\n*\/\nQString SUIT_FileDlg::getExistingDirectory ( QWidget* parent,\n\t\t\t\t\t const QString& initial,\n\t\t\t\t\t const QString& caption, \n\t\t\t\t\t bool showQuickDir )\n{\n SUIT_FileDlg* fd = new SUIT_FileDlg( parent, true, showQuickDir, true);\n if ( !caption.isEmpty() )\n fd->setCaption( caption );\n if ( !initial.isEmpty() ) {\n fd->processPath( initial ); \/\/ VSR 24\/03\/03 check for existing of directory has been added to avoid QFileDialog's bug\n }\n fd->setMode( DirectoryOnly );\n fd->setFilters(tr(\"DIRECTORIES_FILTER\"));\n fd->exec();\n QString dirname = fd->selectedFile();\n delete fd;\n qApp->processEvents();\n return dirname;\n \n}\n<commit_msg>Correction.<commit_after>#include \"SUIT_FileDlg.h\"\n\n#include \"SUIT_Tools.h\" \n#include \"SUIT_Session.h\"\n#include \"SUIT_Desktop.h\"\n#include \"SUIT_MessageBox.h\"\n#include \"SUIT_ResourceMgr.h\"\n#include \"SUIT_FileValidator.h\"\n\n#include <qdir.h>\n#include <qlabel.h>\n#include <qregexp.h>\n#include <qpalette.h>\n#include <qobjectlist.h>\n#include <qpushbutton.h>\n#include <qapplication.h>\n\n#define MIN_COMBO_SIZE 100\n\nQString SUIT_FileDlg::myLastVisitedPath;\n\n\/*!\nConstructor\n*\/\nSUIT_FileDlg::SUIT_FileDlg( QWidget* parent, bool open, bool showQuickDir, bool modal ) :\nQFileDialog( parent, 0, modal ),\nmyValidator( 0 ),\nmyQuickCombo( 0 ),\nmyOpen( open )\n{ \n if ( parent->icon() )\n setIcon( *parent->icon() ); \n setSizeGripEnabled( true );\n \n if (showQuickDir) {\n \/\/ inserting quick dir combo box\n QLabel* lab = new QLabel(tr(\"Quick path:\"), this);\n myQuickCombo = new QComboBox(false, this);\n myQuickCombo->setSizePolicy(QSizePolicy(QSizePolicy::Expanding, QSizePolicy::Fixed));\n myQuickCombo->setMinimumSize(MIN_COMBO_SIZE, 0);\n \n \/\/ the following is a workaround for proper layouting of custom widgets ===========\n QPushButton* btn = new QPushButton(this);\n btn->setEnabled(false);\n QPalette pal = btn->palette();\n QColorGroup ca = pal.active();\n ca.setColor(QColorGroup::Light, palette().active().background());\n ca.setColor(QColorGroup::Midlight, palette().active().background());\n ca.setColor(QColorGroup::Dark, palette().active().background());\n ca.setColor(QColorGroup::Mid, palette().active().background());\n ca.setColor(QColorGroup::Shadow, palette().active().background());\n QColorGroup ci = pal.inactive();\n ci.setColor(QColorGroup::Light, palette().inactive().background());\n ci.setColor(QColorGroup::Midlight, palette().inactive().background());\n ci.setColor(QColorGroup::Dark, palette().inactive().background());\n ci.setColor(QColorGroup::Mid, palette().inactive().background());\n ci.setColor(QColorGroup::Shadow, palette().inactive().background());\n QColorGroup cd = pal.disabled();\n cd.setColor(QColorGroup::Light, palette().disabled().background());\n cd.setColor(QColorGroup::Midlight, palette().disabled().background());\n cd.setColor(QColorGroup::Dark, palette().disabled().background());\n cd.setColor(QColorGroup::Mid, palette().disabled().background());\n cd.setColor(QColorGroup::Shadow, palette().disabled().background());\n pal.setActive(ca); pal.setInactive(ci); pal.setDisabled(cd);\n btn->setPalette(pal);\n \/\/ ================================================================================\n\n connect(myQuickCombo, SIGNAL(activated(const QString&)), this, SLOT(quickDir(const QString&)));\n addWidgets(lab, myQuickCombo, btn);\n\n \/\/ getting dir list from settings\n QString dirs;\n SUIT_ResourceMgr* resMgr = SUIT_Session::session()->resourceMgr();\n if ( resMgr )\n dirs = resMgr->stringValue( \"FileDlg\", \"QuickDirList\" );\n\n QStringList dirList = QStringList::split(';', dirs, false);\n if (dirList.count() > 0) {\n for (unsigned i = 0; i < dirList.count(); i++)\n\t myQuickCombo->insertItem(dirList[i]);\n }\n else {\n myQuickCombo->insertItem(QDir::homeDirPath());\n }\n\n \/\/ the following is a workaround for proper layouting of custom widgets ===========\n QValueList<QPushButton*> buttonList;\n QValueList<QLabel*> labelList;\n const QObjectList *list = children();\n QObjectListIt it(*list);\n int maxButWidth = lab->sizeHint().width();\n int maxLabWidth = btn->sizeHint().width();\n \n for (; it.current() ; ++it) {\n if ( it.current()->isA( \"QLabel\" ) ) {\n\tint tempW = ((QLabel*)it.current())->minimumWidth();\n\tif ( maxLabWidth < tempW ) maxLabWidth = tempW;\n\tlabelList.append( (QLabel*)it.current() );\n }\n else if( it.current()->isA(\"QPushButton\") ) {\n\tint tempW = ((QPushButton*)it.current())->minimumWidth();\n\tif ( maxButWidth < tempW ) maxButWidth = tempW;\n\tbuttonList.append( (QPushButton*)it.current() );\n }\n }\n if (maxButWidth > 0) {\n QValueList<QPushButton*>::Iterator bListIt;\n for ( bListIt = buttonList.begin(); bListIt != buttonList.end(); ++bListIt )\n\t(*bListIt)->setFixedWidth( maxButWidth );\n }\n if (maxLabWidth > 0) {\n QValueList<QLabel*>::Iterator lListIt;\n for ( lListIt = labelList.begin(); lListIt != labelList.end(); ++lListIt )\n\t(*lListIt)->setFixedWidth( maxLabWidth );\n }\n \/\/ ================================================================================\n }\n setMode( myOpen ? ExistingFile : AnyFile ); \n setCaption( myOpen ? tr( \"INF_DESK_DOC_OPEN\" ) : tr( \"INF_DESK_DOC_SAVE\" ) );\n\n if (showQuickDir) {\n if (myLastVisitedPath.isNull() || myLastVisitedPath.isEmpty()) {\n \/\/ If no last visited path exists -> switch to the first preferred path\n processPath(myQuickCombo->text(0));\n } \n else if ( !processPath(myLastVisitedPath) ) {\n \/\/ If last visited path doesn't exist -> switch to the first preferred path\n processPath(myQuickCombo->text(0));\n }\n }\n\n myValidator = new SUIT_FileValidator(this);\n \n}\n\n\/*!\nDestructor\n*\/\nSUIT_FileDlg::~SUIT_FileDlg() \n{\n}\n\n\/*!\nSets validator for file names to open\/save\nDeletes previous validator\n*\/\nvoid SUIT_FileDlg::setValidator( SUIT_FileValidator* v )\n{\n if (myValidator)\n delete myValidator;\n myValidator = v;\n}\n\n\/*!\nReturns the selected file\n*\/\nQString SUIT_FileDlg::selectedFile() const\n{\n return mySelectedFile;\n}\n\n\/*!\nReturns 'true' if this is 'Open File' dialog \nand 'false' if 'Save File' dialog\n*\/\nbool SUIT_FileDlg::isOpenDlg() const\n{\n return myOpen;\n}\n\n\/*!\nCloses this dialog and sets the return code to 'Accepted'\nif the selected name is valid ( see 'acceptData()' )\n*\/\nvoid SUIT_FileDlg::accept()\n{\n\/\/ mySelectedFile = QFileDialog::selectedFile().simplifyWhiteSpace(); \/\/VSR- 06\/12\/02\n mySelectedFile = QFileDialog::selectedFile(); \/\/VSR+ 06\/12\/02\n addExtension();\n\/\/ mySelectedFile = mySelectedFile.simplifyWhiteSpace(); \/\/VSR- 06\/12\/02\n\n \/* Qt 2.2.2 BUG: accept() is called twice if you validate \n the selected file name by pressing 'Return' key in file \n name editor but this name is not acceptable for acceptData()\n *\/\n if ( acceptData() ) {\n myLastVisitedPath = dirPath();\n QFileDialog::accept(); \n }\n}\n\n\/*!\nCloses this dialog and sets the return code to 'Rejected' \n*\/\nvoid SUIT_FileDlg::reject()\n{\n mySelectedFile = QString::null;\n QFileDialog::reject(); \n}\n\n\/*!\nReturns 'true' if selected file is valid.\nThe validity is checked by a file validator, \nif there is no validator the file is always\nconsidered as valid \n*\/\nbool SUIT_FileDlg::acceptData()\n{ \n if ( myValidator )\n {\n if ( isOpenDlg() )\n return myValidator->canOpen( selectedFile() );\n else \n return myValidator->canSave( selectedFile() );\n }\n return true;\n}\n\n\/*!\nAdds an extension to the selected file name\nif the file has not it.\nThe extension is extracted from the active filter.\n*\/\nvoid SUIT_FileDlg::addExtension()\n{\n\/\/ mySelectedFile.stripWhiteSpace();\/\/VSR- 06\/12\/02\n\/\/ if ( mySelectedFile.isEmpty() )\/\/VSR- 06\/12\/02\n if ( mySelectedFile.stripWhiteSpace().isEmpty() )\/\/VSR+ 06\/12\/02\n return;\n\n\/\/ if ( SUIT_Tools::getFileExtensionFromPath( mySelectedFile ).isEmpty() ) \/\/VSR- 06\/12\/02\n\/\/ota : 16\/12\/03 if ( SUIT_Tools::getFileExtensionFromPath( mySelectedFile ).isEmpty() ) \/\/VSR+ 06\/12\/02\n\/\/ {\n\n#if QT_VERSION < 0x030000\n QRegExp r( QString::fromLatin1(\"([a-zA-Z0-9.*? +;#]*)$\") );\n int len, index = r.match( selectedFilter(), 0, &len );\n#else\n QRegExp r( QString::fromLatin1(\"\\\\([a-zA-Z0-9.*? +;#]*\\\\)$\") );\n int index = r.search(selectedFilter());\n#endif\n if ( index >= 0 ) \n { \n#if QT_VERSION < 0x030000\n\/\/ QString wildcard = selectedFilter().mid( index + 1, len-2 ); \/\/VSR- 06\/12\/02\n QString wildcard = selectedFilter().mid( index + 1, len-2 ).stripWhiteSpace(); \/\/VSR+ 06\/12\/02\n#else\n\/\/ QString wildcard = selectedFilter().mid( index + 1, r.matchedLength()-2 ); \/\/VSR- 06\/12\/02\n QString wildcard = selectedFilter().mid( index + 1, r.matchedLength()-2 ).stripWhiteSpace(); \/\/VSR+ 06\/12\/02\n#endif\n int aLen = mySelectedFile.length();\n if ( mySelectedFile[aLen - 1] == '.')\n\t \/\/if the file name ends with the point remove it\n\t mySelectedFile.truncate(aLen - 1);\n QString anExt = \".\" + SUIT_Tools::extension( mySelectedFile ).stripWhiteSpace();\n \/\/ From the filters list make a pattern to validate a file extension\n \/\/ Due to transformations from the filter list (*.txt *.*xx *.c++ SUIT*.* ) we \n \/\/ will have the pattern (\\.txt|\\..*xx|\\.c\\+\\+|\\..*) (as we validate extension only we remove\n \/\/ stay extension mask only in the pattern\n QString aPattern(wildcard);\n QRegExp anExtRExp(\"(\"+aPattern.replace(QRegExp(\"(^| )[0-9a-zA-Z*_?]*\\\\.\"), \" \\\\.\").\n\t\t\tstripWhiteSpace().replace(QRegExp(\"\\\\s+\"), \"|\").\n\t\t\treplace(QRegExp(\"[*]\"),\".*\").replace(QRegExp(\"[+]\"),\"\\\\+\") + \")\");\n \n if ( anExtRExp.match(anExt) == -1 ) \/\/if a selected file extension does not match to filter's list\n\t{ \/\/remove a point if it is at the word end\n int aExtLen = anExt.length();\n\t if (anExt[ aExtLen - 1 ] == '.') anExt.truncate( aExtLen - 1 );\n\t index = wildcard.findRev( '.' ); \n\t if ( index >= 0 ) \n\t mySelectedFile += wildcard.mid( index ); \/\/add the extension\n\t}\n }\n \/\/ }\n}\n\n\/*!\n Processes selection : tries to set given path or filename as selection\n*\/\nbool SUIT_FileDlg::processPath( const QString& path )\n{\n if ( !path.isNull() ) {\n QFileInfo fi( path );\n if ( fi.exists() ) {\n if ( fi.isFile() )\n\tsetSelection( path );\n else if ( fi.isDir() )\n\tsetDir( path );\n return true;\n }\n else {\n if ( QFileInfo( fi.dirPath() ).exists() ) {\n\tsetDir( fi.dirPath() );\n\treturn true;\n }\n }\n }\n return false;\n}\n\/*!\n Called when user selects item from \"Quick Dir\" combo box\n*\/\nvoid SUIT_FileDlg::quickDir(const QString& dirPath)\n{\n if ( !QDir(dirPath).exists() ) {\n SUIT_MessageBox::error1(this, \n\t\t\t tr(\"ERR_ERROR\"),\n\t\t\t tr(\"ERR_DIR_NOT_EXIST\").arg(dirPath), \n\t\t\t tr(\"BUT_OK\"));\n \n }\n else {\n processPath(dirPath);\n }\n}\n\n\/*!\n Returns the file name for Open\/Save [ static ]\n*\/\nQString SUIT_FileDlg::getFileName( QWidget* parent, \n\t\t\t\t const QString& initial, \n const QStringList& filters, \n const QString& caption,\n bool open,\n\t\t\t\t bool showQuickDir, \n\t\t\t\t SUIT_FileValidator* validator )\n{ \n SUIT_FileDlg* fd = new SUIT_FileDlg( parent, open, showQuickDir, true ); \n if ( !caption.isEmpty() )\n fd->setCaption( caption );\n if ( !initial.isEmpty() ) { \n fd->processPath( initial ); \/\/ VSR 24\/03\/03 check for existing of directory has been added to avoid QFileDialog's bug\n }\n fd->setFilters( filters ); \n if ( validator )\n fd->setValidator( validator );\n fd->exec();\n QString filename = fd->selectedFile();\n delete fd;\n qApp->processEvents();\n return filename;\n}\n\n\/*!\n Existing directory selection dialog [ static ]\n*\/\nQString SUIT_FileDlg::getExistingDirectory ( QWidget* parent,\n\t\t\t\t\t const QString& initial,\n\t\t\t\t\t const QString& caption, \n\t\t\t\t\t bool showQuickDir )\n{\n SUIT_FileDlg* fd = new SUIT_FileDlg( parent, true, showQuickDir, true);\n if ( !caption.isEmpty() )\n fd->setCaption( caption );\n if ( !initial.isEmpty() ) {\n fd->processPath( initial ); \/\/ VSR 24\/03\/03 check for existing of directory has been added to avoid QFileDialog's bug\n }\n fd->setMode( DirectoryOnly );\n fd->setFilters(tr(\"DIRECTORIES_FILTER\"));\n fd->exec();\n QString dirname = fd->selectedFile();\n delete fd;\n qApp->processEvents();\n return dirname;\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ViewRobot.h\"\n#include <KrisLibrary\/GLdraw\/drawextra.h>\nusing namespace GLDraw;\n\nconst static GLColor grey(0.5,0.5,0.5);\nconst static GLColor red(1,0,0);\nconst static GLColor orange(1,0.5,0);\nconst static GLColor yellow(1,1,0);\nconst static GLColor purple(0.5,0,1);\nconst static GLColor lightpurple(0.75,0.5,1);\nconst static GLColor blue(0,0,1);\n\n\nstruct GLCheckeredSphere\n{\n GLCheckeredSphere();\n void Draw();\n\n Real radius;\n Vector3 center;\n GLColor c1,c2;\n int numSlices,numStacks;\n};\n\nGLCheckeredSphere::GLCheckeredSphere()\n :radius(1),center(Zero),numSlices(16),numStacks(8)\n{\n c1.set(1,1,1);\n c2.set(0,0,0);\n}\n\n\/\/theta is the vertical range, phi is the rotational range\nvoid DrawSphereArc(Real r,Real theta0,Real theta1,Real phi0,Real phi1,int numSlices,int numStacks)\n{\n Real thetaInc = (theta1-theta0)\/Real(numStacks);\n Real phiInc = (phi1-phi0)\/Real(numSlices);\n Real phi=phi0;\n Real theta;\n for(int i=0;i<numSlices;i++,phi+=phiInc) {\n Real x1=Cos(phi);\n Real x2=Cos(phi+phiInc);\n Real y1=Sin(phi);\n Real y2=Sin(phi+phiInc);\n theta=theta0;\n glBegin(GL_TRIANGLE_STRIP);\n for(int j=0;j<=numStacks;j++,theta+=thetaInc) {\n Real cz=Cos(theta);\n Real sz=Sin(theta);\n glNormal3f(x2*sz,y2*sz,cz);\n glVertex3f(r*x2*sz,r*y2*sz,r*cz);\n glNormal3f(x1*sz,y1*sz,cz);\n glVertex3f(r*x1*sz,r*y1*sz,r*cz);\n }\n glEnd();\n }\n}\n\nvoid GLCheckeredSphere::Draw()\n{\n glEnable(GL_LIGHTING);\n glPushMatrix();\n {\n glTranslate(center);\n glMaterialfv(GL_FRONT,GL_AMBIENT_AND_DIFFUSE,c1.rgba); \n DrawSphereArc(radius, 0,Pi_2, 0,Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, 0,Pi_2, Pi,3*Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, Pi_2,Pi, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, 3*Pi_2,TwoPi,numSlices\/4,numStacks\/2);\n glMaterialfv(GL_FRONT,GL_AMBIENT_AND_DIFFUSE,c2.rgba); \n DrawSphereArc(radius, 0,Pi_2, Pi_2,Pi, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, 0,Pi_2, 3*Pi_2,TwoPi,numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, 0,Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, Pi,3*Pi_2, numSlices\/4,numStacks\/2);\n }\n glPopMatrix();\n}\n\n\nViewRobot::ViewRobot(Robot* _robot)\n :robot(_robot)\n{\n}\n\nViewRobot::~ViewRobot()\n{\n}\n\nvoid ViewRobot::Draw(Robot* _robot) \n{\n robot = _robot;\n if(!robot) return;\n Draw();\n}\n\nvoid ViewRobot::SetColors(const GLColor& c)\n{\n if(robot) {\n for(size_t i=0;i<robot->links.size();i++) {\n GLDraw::GeometryAppearance& a = Appearance(i);\n a.SetColor(c);\n }\n }\n}\n\nvoid ViewRobot::SetColor(int link,const GLColor& c)\n{\n if(robot) {\n GLDraw::GeometryAppearance& a = Appearance(link);\n a.SetColor(c);\n }\n}\n\nvoid ViewRobot::SetGrey() { SetColors(grey); }\n\nvoid ViewRobot::Draw() \n{\n if(!robot) return;\n\n for(size_t i=0;i<robot->links.size();i++) {\n if(robot->IsGeometryEmpty(i)) continue;\n Matrix4 mat = robot->links[i].T_World;\n glPushMatrix();\n glMultMatrix(mat);\n GLDraw::GeometryAppearance& a = Appearance(i);\n if(a.geom != robot->geometry[i].get()) {\n a.Set(*robot->geometry[i]);\n }\n a.DrawGL();\n glPopMatrix();\n }\n}\n\nvoid ViewRobot::DrawLink_Local(int i,bool keepAppearance)\n{\n if(!robot || robot->IsGeometryEmpty(i)) return;\n if(keepAppearance) {\n GLDraw::GeometryAppearance& a = Appearance(i);\n if(a.geom != robot->geometry[i].get())\n a.Set(*robot->geometry[i]);\n a.DrawGL();\n }\n else \n draw(*robot->geometry[i]);\n}\n\nvoid ViewRobot::DrawLink_World(int i,bool keepAppearance)\n{\n if(!robot) return;\n Matrix4 mat = robot->links[i].T_World;\n glPushMatrix();\n glMultMatrix(mat);\n DrawLink_Local(i,keepAppearance);\n glPopMatrix();\n}\n\n\nvoid ViewRobot::DrawCenterOfMass(Real radius)\n{\n if(!robot) return;\n Vector3 com = robot->GetCOM();\n\n GLCheckeredSphere sph;\n sph.center = com;\n sph.radius = radius;\n sph.c1.set(1,0,0);\n sph.c2.set(0,0,1);\n sph.Draw();\n\n glDisable(GL_LIGHTING); \n glColor3f(0,0,1);\n glBegin(GL_LINES);\n glVertex3f(com.x,com.y,com.z);\n glVertex3f(com.x,com.y,0);\n glEnd();\n}\n\nvoid ViewRobot::DrawLinkCenterOfMass(int i,Real radius)\n{\n Vector3 com = robot->links[i].T_World*robot->links[i].com;\n GLCheckeredSphere sph;\n sph.center = com;\n sph.radius = radius;\n sph.c1.set(1,0,0);\n sph.c2.set(0,0,1);\n sph.Draw();\n}\n\nvoid ViewRobot::DrawLinkFrames(Real size)\n{\n if(!robot) return;\n glDisable(GL_LIGHTING);\n for(size_t i=0;i<robot->links.size();i++) {\n glPushMatrix();\n glMultMatrix((Matrix4)robot->links[i].T_World);\n drawCoords(size);\n glPopMatrix();\n }\n}\n\nvoid ViewRobot::DrawLinkSkeleton()\n{\n if(!robot) return;\n glDisable(GL_LIGHTING);\n glColor3f(1,0.5,0);\n glLineWidth(3.0);\n glBegin(GL_LINES);\n for(size_t i=0;i<robot->links.size();i++) {\n if(robot->parents[i] >= 0) {\n glVertex3v(robot->links[robot->parents[i]].T_World.t);\n glVertex3v(robot->links[i].T_World.t);\n }\n }\n glEnd();\n glLineWidth(1.0);\n}\n\nvoid ViewRobot::DrawTorques(const Vector& T)\n{\n SetTorqueColors(T);\n Draw();\n}\n\ninline void GetTorqueColor(Real t,GLColor& color)\n{\n if(t < 0.5) color.set(0.5+t,0.5+t,0.5-t);\n else if(t < 0.75) color.set(1,2-2*t,0);\n else if(t < 1) color.set(1,2-2*t,0);\n else color.set(0.5,0,0);\n}\n\ninline bool EqualColor(const GLColor& a,const GLColor& b)\n{\n for(int i=0;i<4;i++)\n if(a.rgba[i] != b.rgba[i]) return false;\n return true;\n}\n\nvoid ViewRobot::SetTorqueColors(const Vector& T)\n{\n if(T.empty()) {\n SetColors(GLColor(1,0,1));\n return;\n }\n \/\/draw torques\n Assert(T.n == (int)robot->links.size() || T.n == (int)robot->drivers.size());\n if(T.n == (int)robot->links.size()) {\n for(int i=0;i<T.n;i++) {\n GetTorqueColor(T[i],Appearance(i).faceColor);\n }\n }\n else {\n for(int i=0;i<T.n;i++) {\n GLColor c;\n GetTorqueColor(T[i],c);\n for(size_t k=0;k<robot->drivers[i].linkIndices.size();k++)\n\tAppearance(robot->drivers[i].linkIndices[k]).faceColor = c;\n }\n }\n}\n\nGLDraw::GeometryAppearance& ViewRobot::Appearance(int link)\n{\n Assert(robot!=NULL);\n if(appearanceStack.empty()) {\n if(robot->geomManagers[link].IsAppearanceShared()) \n robot->geomManagers[link].SetUniqueAppearance();\n return *robot->geomManagers[link].Appearance();\n }\n return appearanceStack.back()[link];\n}\n\nvoid ViewRobot::PushAppearance()\n{\n if(robot==NULL) return;\n vector<GLDraw::GeometryAppearance> app(robot->links.size());\n for(size_t i=0;i<robot->links.size();i++) {\n app[i] = Appearance(i);\n if(Appearance(i).faceDisplayList)\n Assert(app[i].faceDisplayList);\n }\n appearanceStack.push_back(app);\n}\n\nvoid ViewRobot::PopAppearance()\n{\n if(!appearanceStack.empty()) {\n \/\/may want to copy back face display lists up the stack\n if(appearanceStack.size()==1) {\n for(size_t i=0;i<robot->links.size();i++) {\n if(!robot->geomManagers[i].Appearance()->faceDisplayList)\n robot->geomManagers[i].Appearance()->faceDisplayList = appearanceStack.back()[i].faceDisplayList;\n if(!robot->geomManagers[i].Appearance()->vertexDisplayList)\n robot->geomManagers[i].Appearance()->vertexDisplayList = appearanceStack.back()[i].vertexDisplayList;\n }\n }\n else {\n size_t n=appearanceStack.size()-2;\n for(size_t i=0;i<robot->links.size();i++) {\n if(!appearanceStack[n][i].faceDisplayList)\n appearanceStack[n][i].faceDisplayList = appearanceStack.back()[i].faceDisplayList;\n if(!appearanceStack[n][i].vertexDisplayList)\n appearanceStack[n][i].vertexDisplayList = appearanceStack.back()[i].vertexDisplayList;\n }\n }\n appearanceStack.resize(appearanceStack.size()-1);\n }\n}\nvoid ViewRobot::RestoreAppearance()\n\n{\n appearanceStack.resize(0);\n}\n\nvector<GLDraw::GeometryAppearance> ViewRobot::GetAppearance()\n{\n vector<GLDraw::GeometryAppearance> res;\n if(!robot) return res;\n res.resize(robot->links.size());\n for(size_t i=0;i<res.size();i++)\n res[i] = Appearance(i);\n return res;\n}\n\nvoid ViewRobot::SetAppearance(const vector<GLDraw::GeometryAppearance>& app)\n{\n if(!robot) return;\n Assert(app.size()==robot->links.size());\n for(size_t i=0;i<app.size();i++) {\n Appearance(i) = app[i];\n }\n}\n<commit_msg>Performance fixes for new GeometryAppearance structure<commit_after>#include \"ViewRobot.h\"\n#include <KrisLibrary\/GLdraw\/drawextra.h>\nusing namespace GLDraw;\n\nconst static GLColor grey(0.5,0.5,0.5);\nconst static GLColor red(1,0,0);\nconst static GLColor orange(1,0.5,0);\nconst static GLColor yellow(1,1,0);\nconst static GLColor purple(0.5,0,1);\nconst static GLColor lightpurple(0.75,0.5,1);\nconst static GLColor blue(0,0,1);\n\n\nstruct GLCheckeredSphere\n{\n GLCheckeredSphere();\n void Draw();\n\n Real radius;\n Vector3 center;\n GLColor c1,c2;\n int numSlices,numStacks;\n};\n\nGLCheckeredSphere::GLCheckeredSphere()\n :radius(1),center(Zero),numSlices(16),numStacks(8)\n{\n c1.set(1,1,1);\n c2.set(0,0,0);\n}\n\n\/\/theta is the vertical range, phi is the rotational range\nvoid DrawSphereArc(Real r,Real theta0,Real theta1,Real phi0,Real phi1,int numSlices,int numStacks)\n{\n Real thetaInc = (theta1-theta0)\/Real(numStacks);\n Real phiInc = (phi1-phi0)\/Real(numSlices);\n Real phi=phi0;\n Real theta;\n for(int i=0;i<numSlices;i++,phi+=phiInc) {\n Real x1=Cos(phi);\n Real x2=Cos(phi+phiInc);\n Real y1=Sin(phi);\n Real y2=Sin(phi+phiInc);\n theta=theta0;\n glBegin(GL_TRIANGLE_STRIP);\n for(int j=0;j<=numStacks;j++,theta+=thetaInc) {\n Real cz=Cos(theta);\n Real sz=Sin(theta);\n glNormal3f(x2*sz,y2*sz,cz);\n glVertex3f(r*x2*sz,r*y2*sz,r*cz);\n glNormal3f(x1*sz,y1*sz,cz);\n glVertex3f(r*x1*sz,r*y1*sz,r*cz);\n }\n glEnd();\n }\n}\n\nvoid GLCheckeredSphere::Draw()\n{\n glEnable(GL_LIGHTING);\n glPushMatrix();\n {\n glTranslate(center);\n glMaterialfv(GL_FRONT,GL_AMBIENT_AND_DIFFUSE,c1.rgba); \n DrawSphereArc(radius, 0,Pi_2, 0,Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, 0,Pi_2, Pi,3*Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, Pi_2,Pi, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, 3*Pi_2,TwoPi,numSlices\/4,numStacks\/2);\n glMaterialfv(GL_FRONT,GL_AMBIENT_AND_DIFFUSE,c2.rgba); \n DrawSphereArc(radius, 0,Pi_2, Pi_2,Pi, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, 0,Pi_2, 3*Pi_2,TwoPi,numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, 0,Pi_2, numSlices\/4,numStacks\/2);\n DrawSphereArc(radius, Pi_2,Pi, Pi,3*Pi_2, numSlices\/4,numStacks\/2);\n }\n glPopMatrix();\n}\n\n\nViewRobot::ViewRobot(Robot* _robot)\n :robot(_robot)\n{\n}\n\nViewRobot::~ViewRobot()\n{\n}\n\nvoid ViewRobot::Draw(Robot* _robot) \n{\n robot = _robot;\n if(!robot) return;\n Draw();\n}\n\nvoid ViewRobot::SetColors(const GLColor& c)\n{\n if(robot) {\n for(size_t i=0;i<robot->links.size();i++) {\n GLDraw::GeometryAppearance& a = Appearance(i);\n a.SetColor(c);\n }\n }\n}\n\nvoid ViewRobot::SetColor(int link,const GLColor& c)\n{\n if(robot) {\n GLDraw::GeometryAppearance& a = Appearance(link);\n a.SetColor(c);\n }\n}\n\nvoid ViewRobot::SetGrey() { SetColors(grey); }\n\nvoid ViewRobot::Draw() \n{\n if(!robot) return;\n\n for(size_t i=0;i<robot->links.size();i++) {\n if(robot->IsGeometryEmpty(i)) continue;\n Matrix4 mat = robot->links[i].T_World;\n glPushMatrix();\n glMultMatrix(mat);\n GLDraw::GeometryAppearance& a = Appearance(i);\n if(a.geom != robot->geometry[i].get()) {\n a.Set(*robot->geometry[i]);\n }\n a.DrawGL();\n glPopMatrix();\n }\n}\n\nvoid ViewRobot::DrawLink_Local(int i,bool keepAppearance)\n{\n if(!robot || robot->IsGeometryEmpty(i)) return;\n if(keepAppearance) {\n GLDraw::GeometryAppearance& a = Appearance(i);\n if(a.geom != robot->geometry[i].get())\n a.Set(*robot->geometry[i]);\n a.DrawGL();\n }\n else \n draw(*robot->geometry[i]);\n}\n\nvoid ViewRobot::DrawLink_World(int i,bool keepAppearance)\n{\n if(!robot) return;\n Matrix4 mat = robot->links[i].T_World;\n glPushMatrix();\n glMultMatrix(mat);\n DrawLink_Local(i,keepAppearance);\n glPopMatrix();\n}\n\n\nvoid ViewRobot::DrawCenterOfMass(Real radius)\n{\n if(!robot) return;\n Vector3 com = robot->GetCOM();\n\n GLCheckeredSphere sph;\n sph.center = com;\n sph.radius = radius;\n sph.c1.set(1,0,0);\n sph.c2.set(0,0,1);\n sph.Draw();\n\n glDisable(GL_LIGHTING); \n glColor3f(0,0,1);\n glBegin(GL_LINES);\n glVertex3f(com.x,com.y,com.z);\n glVertex3f(com.x,com.y,0);\n glEnd();\n}\n\nvoid ViewRobot::DrawLinkCenterOfMass(int i,Real radius)\n{\n Vector3 com = robot->links[i].T_World*robot->links[i].com;\n GLCheckeredSphere sph;\n sph.center = com;\n sph.radius = radius;\n sph.c1.set(1,0,0);\n sph.c2.set(0,0,1);\n sph.Draw();\n}\n\nvoid ViewRobot::DrawLinkFrames(Real size)\n{\n if(!robot) return;\n glDisable(GL_LIGHTING);\n for(size_t i=0;i<robot->links.size();i++) {\n glPushMatrix();\n glMultMatrix((Matrix4)robot->links[i].T_World);\n drawCoords(size);\n glPopMatrix();\n }\n}\n\nvoid ViewRobot::DrawLinkSkeleton()\n{\n if(!robot) return;\n glDisable(GL_LIGHTING);\n glColor3f(1,0.5,0);\n glLineWidth(3.0);\n glBegin(GL_LINES);\n for(size_t i=0;i<robot->links.size();i++) {\n if(robot->parents[i] >= 0) {\n glVertex3v(robot->links[robot->parents[i]].T_World.t);\n glVertex3v(robot->links[i].T_World.t);\n }\n }\n glEnd();\n glLineWidth(1.0);\n}\n\nvoid ViewRobot::DrawTorques(const Vector& T)\n{\n SetTorqueColors(T);\n Draw();\n}\n\ninline void GetTorqueColor(Real t,GLColor& color)\n{\n if(t < 0.5) color.set(0.5+t,0.5+t,0.5-t);\n else if(t < 0.75) color.set(1,2-2*t,0);\n else if(t < 1) color.set(1,2-2*t,0);\n else color.set(0.5,0,0);\n}\n\ninline bool EqualColor(const GLColor& a,const GLColor& b)\n{\n for(int i=0;i<4;i++)\n if(a.rgba[i] != b.rgba[i]) return false;\n return true;\n}\n\nvoid ViewRobot::SetTorqueColors(const Vector& T)\n{\n if(T.empty()) {\n SetColors(GLColor(1,0,1));\n return;\n }\n \/\/draw torques\n Assert(T.n == (int)robot->links.size() || T.n == (int)robot->drivers.size());\n if(T.n == (int)robot->links.size()) {\n for(int i=0;i<T.n;i++) {\n GetTorqueColor(T[i],Appearance(i).faceColor);\n }\n }\n else {\n for(int i=0;i<T.n;i++) {\n GLColor c;\n GetTorqueColor(T[i],c);\n for(size_t k=0;k<robot->drivers[i].linkIndices.size();k++)\n\tAppearance(robot->drivers[i].linkIndices[k]).faceColor = c;\n }\n }\n}\n\nGLDraw::GeometryAppearance& ViewRobot::Appearance(int link)\n{\n Assert(robot!=NULL);\n if(appearanceStack.empty()) {\n if(robot->geomManagers[link].IsAppearanceShared()) \n robot->geomManagers[link].SetUniqueAppearance();\n return *robot->geomManagers[link].Appearance();\n }\n return appearanceStack.back()[link];\n}\n\nvoid ViewRobot::PushAppearance()\n{\n if(robot==NULL) return;\n vector<GLDraw::GeometryAppearance> app(robot->links.size());\n for(size_t i=0;i<robot->links.size();i++) {\n app[i] = Appearance(i);\n if(Appearance(i).faceDisplayList)\n Assert(app[i].faceDisplayList);\n }\n appearanceStack.push_back(app);\n}\n\nvoid ViewRobot::PopAppearance()\n{\n if(!appearanceStack.empty()) {\n \/\/may want to copy back face display lists up the stack\n if(appearanceStack.size()==1) {\n for(size_t i=0;i<robot->links.size();i++) {\n if(!robot->geomManagers[i].Appearance()->faceDisplayList)\n robot->geomManagers[i].Appearance()->faceDisplayList = appearanceStack.back()[i].faceDisplayList;\n if(!robot->geomManagers[i].Appearance()->edgeDisplayList)\n robot->geomManagers[i].Appearance()->edgeDisplayList = appearanceStack.back()[i].edgeDisplayList;\n if(!robot->geomManagers[i].Appearance()->vertexDisplayList)\n robot->geomManagers[i].Appearance()->vertexDisplayList = appearanceStack.back()[i].vertexDisplayList;\n if(!robot->geomManagers[i].Appearance()->silhouetteDisplayList)\n robot->geomManagers[i].Appearance()->silhouetteDisplayList = appearanceStack.back()[i].silhouetteDisplayList;\n if(!robot->geomManagers[i].Appearance()->tempMesh)\n robot->geomManagers[i].Appearance()->tempMesh = appearanceStack.back()[i].tempMesh;\n if(!robot->geomManagers[i].Appearance()->tempMesh2)\n robot->geomManagers[i].Appearance()->tempMesh2 = appearanceStack.back()[i].tempMesh2;\n }\n }\n else {\n size_t n=appearanceStack.size()-2;\n for(size_t i=0;i<robot->links.size();i++) {\n if(!appearanceStack[n][i].faceDisplayList)\n appearanceStack[n][i].faceDisplayList = appearanceStack.back()[i].faceDisplayList;\n if(!appearanceStack[n][i].edgeDisplayList)\n appearanceStack[n][i].edgeDisplayList = appearanceStack.back()[i].edgeDisplayList;\n if(!appearanceStack[n][i].vertexDisplayList)\n appearanceStack[n][i].vertexDisplayList = appearanceStack.back()[i].vertexDisplayList;\n if(!appearanceStack[n][i].silhouetteDisplayList)\n appearanceStack[n][i].silhouetteDisplayList = appearanceStack.back()[i].silhouetteDisplayList;\n if(!appearanceStack[n][i].tempMesh)\n appearanceStack[n][i].tempMesh = appearanceStack.back()[i].tempMesh;\n if(!appearanceStack[n][i].tempMesh2)\n appearanceStack[n][i].tempMesh2 = appearanceStack.back()[i].tempMesh2;\n }\n }\n appearanceStack.resize(appearanceStack.size()-1);\n }\n}\nvoid ViewRobot::RestoreAppearance()\n\n{\n appearanceStack.resize(0);\n}\n\nvector<GLDraw::GeometryAppearance> ViewRobot::GetAppearance()\n{\n vector<GLDraw::GeometryAppearance> res;\n if(!robot) return res;\n res.resize(robot->links.size());\n for(size_t i=0;i<res.size();i++)\n res[i] = Appearance(i);\n return res;\n}\n\nvoid ViewRobot::SetAppearance(const vector<GLDraw::GeometryAppearance>& app)\n{\n if(!robot) return;\n Assert(app.size()==robot->links.size());\n for(size_t i=0;i<app.size();i++) {\n Appearance(i) = app[i];\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <assert.h>\n\n#include <getopt.h> \/* getopt_long() *\/\n\n#include <fcntl.h> \/* low-level i\/o *\/\n#include <unistd.h>\n#include <errno.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <sys\/time.h>\n#include <sys\/mman.h>\n#include <sys\/ioctl.h>\n\n#include <linux\/videodev2.h>\n\n#include <GLFW\/glfw3.h>\n\n#include <vector>\n\n\nstatic void errno_exit(const char *s)\n{\n fprintf(stderr, \"%s error %d, %s\\n\", s, errno, strerror(errno));\n exit(EXIT_FAILURE);\n}\n\nstatic int xioctl(int fh, int request, void *arg)\n{\n int r;\n\n do {\n r = ioctl(fh, request, arg);\n } while (-1 == r && EINTR == errno);\n\n return r;\n}\n\nstruct buffer { void * start; size_t length; };\n#pragma pack(push, 1)\nstruct z16y8_pixel { uint16_t z; uint8_t y; };\n#pragma pack(pop)\n\nint main(int argc, char * argv[])\n{\n char *dev_name = \"\/dev\/video1\";\n int fd = -1;\n std::vector<buffer> buffers;\n \/\/buffer *buffers = 0;\n \/\/unsigned int n_buffers = 0;\n int force_format = 0;\n\n struct stat st;\n if (stat(dev_name, &st) < 0)\n {\n fprintf(stderr, \"Cannot identify '%s': %d, %s\\n\", dev_name, errno, strerror(errno));\n return EXIT_FAILURE;\n }\n\n if (!S_ISCHR(st.st_mode))\n {\n fprintf(stderr, \"%s is no device\\n\", dev_name);\n return EXIT_FAILURE;\n }\n\n fd = open(dev_name, O_RDWR \/* required *\/ | O_NONBLOCK, 0);\n\n if (-1 == fd) {\n fprintf(stderr, \"Cannot open '%s': %d, %s\\n\",\n dev_name, errno, strerror(errno));\n exit(EXIT_FAILURE);\n }\n\n v4l2_capability cap = {};\n if(xioctl(fd, VIDIOC_QUERYCAP, &cap) < 0)\n {\n if (EINVAL == errno) {\n fprintf(stderr, \"%s is no V4L2 device\\n\",\n dev_name);\n exit(EXIT_FAILURE);\n } else {\n errno_exit(\"VIDIOC_QUERYCAP\");\n }\n }\n\n if (!(cap.capabilities & V4L2_CAP_VIDEO_CAPTURE)) {\n fprintf(stderr, \"%s is no video capture device\\n\",\n dev_name);\n exit(EXIT_FAILURE);\n }\n\n if (!(cap.capabilities & V4L2_CAP_STREAMING)) {\n fprintf(stderr, \"%s does not support streaming i\/o\\n\",\n dev_name);\n exit(EXIT_FAILURE);\n }\n\n \/\/ Select video input, video standard and tune here.\n v4l2_cropcap cropcap = {};\n cropcap.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if (0 == xioctl(fd, VIDIOC_CROPCAP, &cropcap))\n {\n v4l2_crop crop = {};\n crop.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n crop.c = cropcap.defrect; \/\/ reset to default\n if (xioctl(fd, VIDIOC_S_CROP, &crop) < 0)\n {\n switch (errno)\n {\n case EINVAL: break; \/\/ Cropping not supported\n default: break; \/\/ Errors ignored\n }\n }\n } else {} \/\/ Errors ignored\n\n v4l2_format fmt = {};\n fmt.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if (force_format)\n {\n fmt.fmt.pix.width = 640;\n fmt.fmt.pix.height = 480;\n fmt.fmt.pix.pixelformat = V4L2_PIX_FMT_YUYV;\n fmt.fmt.pix.field = V4L2_FIELD_INTERLACED;\n if(xioctl(fd, VIDIOC_S_FMT, &fmt) < 0) errno_exit(\"VIDIOC_S_FMT\");\n \/\/ Note VIDIOC_S_FMT may change width and height\n }\n else\n {\n \/\/ Preserve original settings as set by v4l2-ctl for example\n if(xioctl(fd, VIDIOC_G_FMT, &fmt) < 0) errno_exit(\"VIDIOC_G_FMT\");\n }\n\n \/\/ Buggy driver paranoia.\n unsigned int min = fmt.fmt.pix.width * 2;\n if (fmt.fmt.pix.bytesperline < min)\n fmt.fmt.pix.bytesperline = min;\n min = fmt.fmt.pix.bytesperline * fmt.fmt.pix.height;\n if (fmt.fmt.pix.sizeimage < min)\n fmt.fmt.pix.sizeimage = min;\n\n \/\/ Init memory mapped IO\n\n v4l2_requestbuffers req = {};\n req.count = 4;\n req.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n req.memory = V4L2_MEMORY_MMAP;\n if(xioctl(fd, VIDIOC_REQBUFS, &req) < 0)\n {\n if (EINVAL == errno) {\n fprintf(stderr, \"%s does not support \"\n \"memory mapping\\n\", dev_name);\n exit(EXIT_FAILURE);\n } else {\n errno_exit(\"VIDIOC_REQBUFS\");\n }\n }\n\n if (req.count < 2) {\n fprintf(stderr, \"Insufficient buffer memory on %s\\n\",\n dev_name);\n exit(EXIT_FAILURE);\n }\n\n buffers.resize(req.count);\n for(int i=0; i<buffers.size(); ++i)\n {\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n buf.index = i;\n if(xioctl(fd, VIDIOC_QUERYBUF, &buf) < 0) errno_exit(\"VIDIOC_QUERYBUF\");\n\n buffers[i].length = buf.length;\n buffers[i].start = mmap(NULL \/* start anywhere *\/,\n buf.length,\n PROT_READ | PROT_WRITE \/* required *\/,\n MAP_SHARED \/* recommended *\/,\n fd, buf.m.offset);\n if (MAP_FAILED == buffers[i].start)\n errno_exit(\"mmap\");\n }\n\n \/\/ Start capturing\n for(int i = 0; i < buffers.size(); ++i)\n {\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n buf.index = i;\n if(xioctl(fd, VIDIOC_QBUF, &buf) < 0) errno_exit(\"VIDIOC_QBUF\");\n }\n\n v4l2_buf_type type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if(xioctl(fd, VIDIOC_STREAMON, &type) < 0) errno_exit(\"VIDIOC_STREAMON\");\n\n \/\/ Open a GLFW window\n glfwInit();\n GLFWwindow * win = glfwCreateWindow(640, 480, \"V4L2 test\", 0, 0);\n glfwMakeContextCurrent(win);\n\n \/\/ While window is open\n while (!glfwWindowShouldClose(win))\n {\n glfwPollEvents();\n\n int w,h;\n glfwGetFramebufferSize(win, &w, &h);\n glViewport(0, 0, w, h);\n glClear(GL_COLOR_BUFFER_BIT);\n\n glPushMatrix();\n glfwGetWindowSize(win, &w, &h);\n glOrtho(0, w, h, 0, -1, +1);\n for (;;)\n {\n fd_set fds;\n struct timeval tv;\n int r;\n\n FD_ZERO(&fds);\n FD_SET(fd, &fds);\n\n \/* Timeout. *\/\n tv.tv_sec = 2;\n tv.tv_usec = 0;\n\n r = select(fd + 1, &fds, NULL, NULL, &tv);\n\n if (-1 == r) {\n if (EINTR == errno)\n continue;\n errno_exit(\"select\");\n }\n\n if (0 == r) {\n fprintf(stderr, \"select timeout\\n\");\n exit(EXIT_FAILURE);\n }\n\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n if(xioctl(fd, VIDIOC_DQBUF, &buf) < 0)\n {\n if(errno == EAGAIN) continue;\n errno_exit(\"VIDIOC_DQBUF\");\n }\n assert(buf.index < buffers.size());\n\n uint16_t z[320*240]; uint8_t y[320*240];\n auto in = reinterpret_cast<const z16y8_pixel *>(buffers[buf.index].start);\n for(int i=0; i<320*240; ++i)\n {\n z[i] = in[i].z;\n y[i] = in[i].y;\n }\n\n glRasterPos2i(0, 240);\n glDrawPixels(320, 240, GL_LUMINANCE, GL_UNSIGNED_SHORT, z);\n glRasterPos2i(320, 240);\n glDrawPixels(320, 240, GL_LUMINANCE, GL_UNSIGNED_BYTE, y);\n printf(\"%d %d\\n\", buf.bytesused, 320*240*3);\n\n if(xioctl(fd, VIDIOC_QBUF, &buf) < 0) errno_exit(\"VIDIOC_QBUF\");\n break;\n }\n\n glPopMatrix();\n glfwSwapBuffers(win);\n }\n glfwDestroyWindow(win);\n glfwTerminate();\n\n if(xioctl(fd, VIDIOC_STREAMOFF, &type) < 0) errno_exit(\"VIDIOC_STREAMOFF\");\n\n for(int i = 0; i < buffers.size(); ++i)\n {\n if(munmap(buffers[i].start, buffers[i].length) < 0) errno_exit(\"munmap\");\n }\n\n if(close(fd) < 0) errno_exit(\"close\");\n\n return EXIT_SUCCESS;\n}\n\n<commit_msg>Formatting changes<commit_after>#include <cassert>\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <vector>\n\n#include <GLFW\/glfw3.h>\n\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n#include <sys\/ioctl.h>\n#include <linux\/videodev2.h>\n\nstatic void errno_exit(const char *s)\n{\n fprintf(stderr, \"%s error %d, %s\\n\", s, errno, strerror(errno));\n exit(EXIT_FAILURE);\n}\n\nstatic int xioctl(int fh, int request, void *arg)\n{\n int r;\n\n do {\n r = ioctl(fh, request, arg);\n } while (-1 == r && EINTR == errno);\n\n return r;\n}\n\nstruct buffer { void * start; size_t length; };\n#pragma pack(push, 1)\nstruct z16y8_pixel { uint16_t z; uint8_t y; };\n#pragma pack(pop)\n\nint main(int argc, char * argv[])\n{\n const char * dev_name = \"\/dev\/video1\";\n struct stat st;\n if(stat(dev_name, &st) < 0)\n {\n fprintf(stderr, \"Cannot identify '%s': %d, %s\\n\", dev_name, errno, strerror(errno));\n return EXIT_FAILURE;\n }\n if(!S_ISCHR(st.st_mode))\n {\n fprintf(stderr, \"%s is no device\\n\", dev_name);\n return EXIT_FAILURE;\n }\n\n int fd = open(dev_name, O_RDWR \/* required *\/ | O_NONBLOCK, 0);\n if(fd < 0)\n {\n fprintf(stderr, \"Cannot open '%s': %d, %s\\n\", dev_name, errno, strerror(errno));\n return EXIT_FAILURE;\n }\n\n v4l2_capability cap = {};\n if(xioctl(fd, VIDIOC_QUERYCAP, &cap) < 0)\n {\n if (EINVAL == errno)\n {\n fprintf(stderr, \"%s is no V4L2 device\\n\", dev_name);\n return EXIT_FAILURE;\n }\n else errno_exit(\"VIDIOC_QUERYCAP\");\n }\n\n if (!(cap.capabilities & V4L2_CAP_VIDEO_CAPTURE))\n {\n fprintf(stderr, \"%s is no video capture device\\n\", dev_name);\n return EXIT_FAILURE;\n }\n\n if (!(cap.capabilities & V4L2_CAP_STREAMING))\n {\n fprintf(stderr, \"%s does not support streaming i\/o\\n\", dev_name);\n return EXIT_FAILURE;\n }\n\n \/\/ Select video input, video standard and tune here.\n v4l2_cropcap cropcap = {};\n cropcap.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if (0 == xioctl(fd, VIDIOC_CROPCAP, &cropcap))\n {\n v4l2_crop crop = {};\n crop.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n crop.c = cropcap.defrect; \/\/ reset to default\n if (xioctl(fd, VIDIOC_S_CROP, &crop) < 0)\n {\n switch (errno)\n {\n case EINVAL: break; \/\/ Cropping not supported\n default: break; \/\/ Errors ignored\n }\n }\n } else {} \/\/ Errors ignored\n\n v4l2_format fmt = {};\n fmt.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if(false) \/\/ Force format?\n {\n fmt.fmt.pix.width = 640;\n fmt.fmt.pix.height = 480;\n fmt.fmt.pix.pixelformat = V4L2_PIX_FMT_YUYV;\n fmt.fmt.pix.field = V4L2_FIELD_INTERLACED;\n if(xioctl(fd, VIDIOC_S_FMT, &fmt) < 0) errno_exit(\"VIDIOC_S_FMT\");\n \/\/ Note VIDIOC_S_FMT may change width and height\n }\n else\n {\n \/\/ Preserve original settings as set by v4l2-ctl for example\n if(xioctl(fd, VIDIOC_G_FMT, &fmt) < 0) errno_exit(\"VIDIOC_G_FMT\");\n }\n\n \/\/ Buggy driver paranoia.\n unsigned int min = fmt.fmt.pix.width * 2;\n if(fmt.fmt.pix.bytesperline < min) fmt.fmt.pix.bytesperline = min;\n min = fmt.fmt.pix.bytesperline * fmt.fmt.pix.height;\n if(fmt.fmt.pix.sizeimage < min) fmt.fmt.pix.sizeimage = min;\n\n \/\/ Init memory mapped IO\n v4l2_requestbuffers req = {};\n req.count = 4;\n req.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n req.memory = V4L2_MEMORY_MMAP;\n if(xioctl(fd, VIDIOC_REQBUFS, &req) < 0)\n {\n if(errno == EINVAL)\n {\n fprintf(stderr, \"%s does not support memory mapping\\n\", dev_name);\n return EXIT_FAILURE;\n }\n else errno_exit(\"VIDIOC_REQBUFS\");\n }\n if(req.count < 2)\n {\n fprintf(stderr, \"Insufficient buffer memory on %s\\n\", dev_name);\n return EXIT_FAILURE;\n }\n\n std::vector<buffer> buffers(req.count);\n for(int i=0; i<buffers.size(); ++i)\n {\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n buf.index = i;\n if(xioctl(fd, VIDIOC_QUERYBUF, &buf) < 0) errno_exit(\"VIDIOC_QUERYBUF\");\n\n buffers[i].length = buf.length;\n buffers[i].start = mmap(NULL \/* start anywhere *\/,\n buf.length,\n PROT_READ | PROT_WRITE \/* required *\/,\n MAP_SHARED \/* recommended *\/,\n fd, buf.m.offset);\n if(buffers[i].start == MAP_FAILED) errno_exit(\"mmap\");\n }\n\n \/\/ Start capturing\n for(int i = 0; i < buffers.size(); ++i)\n {\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n buf.index = i;\n if(xioctl(fd, VIDIOC_QBUF, &buf) < 0) errno_exit(\"VIDIOC_QBUF\");\n }\n\n v4l2_buf_type type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n if(xioctl(fd, VIDIOC_STREAMON, &type) < 0) errno_exit(\"VIDIOC_STREAMON\");\n\n \/\/ Open a GLFW window\n glfwInit();\n GLFWwindow * win = glfwCreateWindow(640, 480, \"V4L2 test\", 0, 0);\n glfwMakeContextCurrent(win);\n\n \/\/ While window is open\n while (!glfwWindowShouldClose(win))\n {\n glfwPollEvents();\n\n int w,h;\n glfwGetFramebufferSize(win, &w, &h);\n glViewport(0, 0, w, h);\n glClear(GL_COLOR_BUFFER_BIT);\n\n glPushMatrix();\n glfwGetWindowSize(win, &w, &h);\n glOrtho(0, w, h, 0, -1, +1);\n for (;;)\n {\n fd_set fds;\n struct timeval tv;\n int r;\n\n FD_ZERO(&fds);\n FD_SET(fd, &fds);\n\n \/* Timeout. *\/\n tv.tv_sec = 2;\n tv.tv_usec = 0;\n\n r = select(fd + 1, &fds, NULL, NULL, &tv);\n\n if (-1 == r) {\n if (EINTR == errno)\n continue;\n errno_exit(\"select\");\n }\n\n if (0 == r) {\n fprintf(stderr, \"select timeout\\n\");\n exit(EXIT_FAILURE);\n }\n\n v4l2_buffer buf = {};\n buf.type = V4L2_BUF_TYPE_VIDEO_CAPTURE;\n buf.memory = V4L2_MEMORY_MMAP;\n if(xioctl(fd, VIDIOC_DQBUF, &buf) < 0)\n {\n if(errno == EAGAIN) continue;\n errno_exit(\"VIDIOC_DQBUF\");\n }\n assert(buf.index < buffers.size());\n\n uint16_t z[320*240]; uint8_t y[320*240];\n auto in = reinterpret_cast<const z16y8_pixel *>(buffers[buf.index].start);\n for(int i=0; i<320*240; ++i)\n {\n z[i] = in[i].z;\n y[i] = in[i].y;\n }\n\n glRasterPos2i(0, 240);\n glDrawPixels(320, 240, GL_LUMINANCE, GL_UNSIGNED_SHORT, z);\n glRasterPos2i(320, 240);\n glDrawPixels(320, 240, GL_LUMINANCE, GL_UNSIGNED_BYTE, y);\n printf(\"%d %d\\n\", buf.bytesused, 320*240*3);\n\n if(xioctl(fd, VIDIOC_QBUF, &buf) < 0) errno_exit(\"VIDIOC_QBUF\");\n break;\n }\n\n glPopMatrix();\n glfwSwapBuffers(win);\n }\n glfwDestroyWindow(win);\n glfwTerminate();\n\n if(xioctl(fd, VIDIOC_STREAMOFF, &type) < 0) errno_exit(\"VIDIOC_STREAMOFF\");\n\n for(int i = 0; i < buffers.size(); ++i)\n {\n if(munmap(buffers[i].start, buffers[i].length) < 0) errno_exit(\"munmap\");\n }\n\n if(close(fd) < 0) errno_exit(\"close\");\n\n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"Communicator.hpp\"\n#include \"CompletionEvent.hpp\"\n#include \"Tasking.hpp\"\n#include \"Message.hpp\"\n#include \"MessagePool.hpp\"\n#include \"Delegate.hpp\"\n#include \"Collective.hpp\"\n#include \"Timestamp.hpp\"\n#include <type_traits>\n\nnamespace Grappa {\n\n\/\/\/ GlobalCompletionEvent (GCE):\n\/\/\/ Synchronization construct for determining when a global phase of asynchronous tasks have all completed.\n\/\/\/ For example, can be used to ensure that all tasks of a parallel loop have completed, including tasks or asynchronous delegates spawned during execution of the parallel loop.\n\/\/\/\n\/\/\/ A GlobalCompletionEvent must be replicated at the same address on all cores (the easiest way is to declare it as file-global or static storage).\n\/\/\/\n\/\/\/ Anyone calling \"wait\" after at least some work has been \"enrolled\" globally will block. When *all* work has been completed on all cores, all tasks waiting on the GCE will be woken.\n\/\/\/\n\/\/\/ To ensure consistent behavior and guarantee deadlock freedom, every \"enroll\" must be causally followed by \"complete\", so either must be completed from the same task that called \"enroll\" or from a task spawned (transitively) from the enrolling task.\nclass GlobalCompletionEvent : public CompletionEvent {\n \/\/ All nodes\n \/\/ (count)\n \/\/ (cv)\n bool event_in_progress;\n Core master_core;\n \n \/\/ Master barrier only\n Core cores_out;\n \n \/\/\/ pointer to shared arg for loops that use a GCE\n const void * shared_ptr;\n \npublic:\n \n GlobalCompletionEvent(): master_core(0) { reset(); }\n \n inline void set_shared_ptr(const void* p) { shared_ptr = p; }\n template<typename T> inline const T* get_shared_ptr() { return reinterpret_cast<const T*>(shared_ptr); }\n \n \/\/\/ SPMD (either all cores call this following a barrier, or use `reset_all` from one task,\n \/\/\/ then spawn parallel work)\n void reset() {\n count = 0;\n cv.waiters_ = 0;\n cores_out = 0;\n event_in_progress = false;\n }\n \n \/\/\/ Called from single task (probably `user_main`).\n void reset_all() {\n call_on_all_cores([this]{ reset(); });\n }\n \n \/\/\/ Enroll more things that need to be completed before the global completion is, well, complete.\n \/\/\/ This will send a cancel to the master if this core previously entered the cancellable barrier.\n \/\/\/\n \/\/\/ Blocks until cancel completes (if it must cancel) to ensure correct ordering, therefore\n \/\/\/ cannot be called from message handler (but I don't think we ever do).\n void enroll(int64_t inc = 1) {\n if (inc == 0) return;\n \n CHECK_GE(inc, 1);\n count += inc;\n \n \/\/ first one to have work here\n if (count == inc) { \/\/ count[0 -> inc]\n event_in_progress = true; \/\/ optimization to save checking in wait()\n \/\/ cancel barrier\n Core co = delegate::call(master_core, [this] {\n cores_out++;\n return cores_out;\n });\n \/\/ first one to cancel barrier should make sure other cores are ready to wait\n if (co == 1) { \/\/ cores_out[0 -> 1]\n event_in_progress = true;\n call_on_all_cores([this] {\n event_in_progress = true;\n });\n CHECK(event_in_progress);\n }\n \/\/ block until cancelled\n CHECK_GT(count, 0);\n VLOG(2) << \"cores_out: \" << co << \", count: \" << count;\n }\n }\n \n \/\/\/ Mark a certain number of things completed. When the global count on all cores goes to 0, all\n \/\/\/ tasks waiting on the GCE will be woken.\n \/\/\/\n \/\/\/ Note: this can be called in a message handler (e.g. remote completes from stolen tasks).\n void complete(int64_t dec = 1) {\n count -= dec;\n DVLOG(4) << \"complete (\" << count << \") -- \" << this;\n \n \/\/ out of work here\n if (count == 0) { \/\/ count[dec -> 0]\n \/\/ enter cancellable barrier\n send_heap_message(master_core, [this] {\n cores_out--;\n \n \/\/ if all are in\n if (cores_out == 0) { \/\/ cores_out[1 -> 0]\n CHECK_EQ(count, 0);\n \/\/ notify everyone to wake\n for (Core c = 0; c < cores(); c++) {\n send_heap_message(c, [this] {\n CHECK_EQ(count, 0);\n broadcast(&cv); \/\/ wake anyone who was waiting here\n reset(); \/\/ reset, now anyone else calling `wait` should fall through\n });\n }\n }\n });\n }\n }\n \n void wait() {\n VLOG(3) << \"wait(): event_in_progress: \" << event_in_progress << \", count: \" << count;\n if (event_in_progress) {\n Grappa::wait(&cv);\n } else {\n \/\/ conservative check, in case we're calling `wait` without calling `enroll`\n if (delegate::call(master_core, [this]{ return cores_out; }) > 0) {\n\/\/ if (delegate::call(master_core, [this]{ return event_in_progress; })) {\n Grappa::wait(&cv);\n VLOG(3) << \"woke from conservative check\";\n }\n VLOG(3) << \"fell thru conservative check\";\n }\n CHECK(!event_in_progress);\n CHECK_EQ(count, 0);\n }\n \n};\n\n} \/\/ namespace Grappa\n\n\/\/\/ Synchronizing delegates\nnamespace Grappa {\n \/\/\/ Synchronizing private task spawn. Automatically enrolls task with GlobalCompletionEvent and\n \/\/\/ does local `complete` when done (if GCE is non-null).\n template<typename TF>\n void privateTask(GlobalCompletionEvent * gce, TF tf) {\n gce->enroll();\n privateTask([gce,tf] {\n tf();\n gce->complete();\n });\n }\n\n template<GlobalCompletionEvent * GCE, typename TF>\n void privateTask(TF tf) {\n if (GCE) GCE->enroll();\n Core origin = mycore();\n privateTask([tf] {\n tf();\n if (GCE) GCE->complete();\n });\n }\n\n \/\/\/ Synchronizing public task spawn. Automatically enrolls task with GlobalCompletionEvent and\n \/\/\/ sends `complete` message when done (if GCE is non-null).\n template<GlobalCompletionEvent * GCE, typename TF>\n inline void publicTask(TF tf) {\n if (GCE) GCE->enroll();\n Core origin = mycore();\n publicTask([origin,tf] {\n tf();\n if (GCE) complete(make_global(GCE,origin));\n });\n }\n \n} \/\/ namespace Grappa\n<commit_msg>Update documentation of GlobalCompletionEvent.<commit_after>#pragma once\n\n#include \"Communicator.hpp\"\n#include \"CompletionEvent.hpp\"\n#include \"Tasking.hpp\"\n#include \"Message.hpp\"\n#include \"MessagePool.hpp\"\n#include \"Delegate.hpp\"\n#include \"Collective.hpp\"\n#include \"Timestamp.hpp\"\n#include <type_traits>\n\nnamespace Grappa {\n\n\/\/\/ GlobalCompletionEvent (GCE):\n\/\/\/ Synchronization construct for determining when a global phase of asynchronous tasks have \n\/\/\/ all completed. For example, can be used to ensure that all tasks of a parallel loop have\n\/\/\/ completed, including tasks or asynchronous delegates spawned during execution of the\n\/\/\/ parallel loop.\n\/\/\/\n\/\/\/ A GlobalCompletionEvent must be replicated at the same address on all cores (the easiest\n\/\/\/ way is to declare it as file-global or static storage). TODO: allow dynamic allocation \n\/\/\/ in Grappa linear address space.\n\/\/\/\n\/\/\/ Anyone calling \"wait\" after at least some work has been \"enrolled\" globally will block.\n\/\/\/ When *all* work has been completed on all cores, all tasks waiting on the GCE will be woken.\n\/\/\/\n\/\/\/ To ensure consistent behavior and guarantee deadlock freedom, every \"enroll\" must be \n\/\/\/ causally followed by \"complete\", so either must be completed from the same task that\n\/\/\/ called \"enroll\" or from a task spawned (transitively) from the enrolling task.\n\/\/\/\n\/\/\/ This is meant to be a reusable barrier; GCE's should begin in a state where a call to\n\/\/\/ `wait` will fall through, and end up, after all tasks are completed, back in the same\n\/\/\/ state. Note: `reset` no longer needs to be called between phases. Instead, it just\n\/\/\/ must be guaranteed that at least one task has been enrolled before anyone tries to\n\/\/\/ call `wait` otherwise they may fall through before the enrollment has completed.\nclass GlobalCompletionEvent : public CompletionEvent {\n \/\/ All nodes\n \/\/ (count)\n \/\/ (cv)\n bool event_in_progress;\n Core master_core;\n \n \/\/ Master barrier only\n Core cores_out;\n \n \/\/\/ pointer to shared arg for loops that use a GCE\n const void * shared_ptr;\n \npublic:\n \n GlobalCompletionEvent(): master_core(0) { reset(); }\n \n inline void set_shared_ptr(const void* p) { shared_ptr = p; }\n template<typename T> inline const T* get_shared_ptr() { return reinterpret_cast<const T*>(shared_ptr); }\n \n \/\/\/ This is the state the GCE's on each core should be in at the beginning, and the \n \/\/\/ state they should end up in after a Completion phase. I should no longer be necessary\n \/\/\/ to call `reset` between calls to `wait` as long as nothing fishy is going on.\n void reset() {\n count = 0;\n cv.waiters_ = 0;\n cores_out = 0;\n event_in_progress = false;\n }\n \n \/\/\/ Enroll more things that need to be completed before the global completion is, well, complete.\n \/\/\/ This will send a cancel to the master if this core previously entered the cancellable barrier.\n \/\/\/\n \/\/\/ Blocks until cancel completes (if it must cancel) to ensure correct ordering, therefore\n \/\/\/ cannot be called from message handler.\n void enroll(int64_t inc = 1) {\n if (inc == 0) return;\n \n CHECK_GE(inc, 1);\n count += inc;\n \n \/\/ first one to have work here\n if (count == inc) { \/\/ count[0 -> inc]\n event_in_progress = true; \/\/ optimization to save checking in wait()\n \/\/ cancel barrier\n Core co = delegate::call(master_core, [this] {\n cores_out++;\n return cores_out;\n });\n \/\/ first one to cancel barrier should make sure other cores are ready to wait\n if (co == 1) { \/\/ cores_out[0 -> 1]\n event_in_progress = true;\n call_on_all_cores([this] {\n event_in_progress = true;\n });\n CHECK(event_in_progress);\n }\n \/\/ block until cancelled\n CHECK_GT(count, 0);\n VLOG(2) << \"cores_out: \" << co << \", count: \" << count;\n }\n }\n \n \/\/\/ Mark a certain number of things completed. When the global count on all cores goes to 0, all\n \/\/\/ tasks waiting on the GCE will be woken.\n \/\/\/\n \/\/\/ Note: this can be called in a message handler (e.g. remote completes from stolen tasks).\n void complete(int64_t dec = 1) {\n count -= dec;\n DVLOG(4) << \"complete (\" << count << \") -- \" << this;\n \n \/\/ out of work here\n if (count == 0) { \/\/ count[dec -> 0]\n \/\/ enter cancellable barrier\n send_heap_message(master_core, [this] {\n cores_out--;\n \n \/\/ if all are in\n if (cores_out == 0) { \/\/ cores_out[1 -> 0]\n CHECK_EQ(count, 0);\n \/\/ notify everyone to wake\n for (Core c = 0; c < cores(); c++) {\n send_heap_message(c, [this] {\n CHECK_EQ(count, 0);\n broadcast(&cv); \/\/ wake anyone who was waiting here\n reset(); \/\/ reset, now anyone else calling `wait` should fall through\n });\n }\n }\n });\n }\n }\n \n \/\/\/ Suspend calling task until all tasks completed (including additional tasks enrolled \n \/\/\/ before count goes to 0). This can be called from as many tasks as desired on\n \/\/\/ different cores, as long as it is ensured that a task in the desired phase has been\n \/\/\/ enrolled before wait is called.\n \/\/\/\n \/\/\/ If no tasks have been enrolled, or all have been completed by the time `wait` is called,\n \/\/\/ this will fall through and not suspend the calling task.\n void wait() {\n VLOG(3) << \"wait(): event_in_progress: \" << event_in_progress << \", count: \" << count;\n if (event_in_progress) {\n Grappa::wait(&cv);\n } else {\n \/\/ conservative check, in case we're calling `wait` without calling `enroll`\n if (delegate::call(master_core, [this]{ return cores_out; }) > 0) {\n\/\/ if (delegate::call(master_core, [this]{ return event_in_progress; })) {\n Grappa::wait(&cv);\n VLOG(3) << \"woke from conservative check\";\n }\n VLOG(3) << \"fell thru conservative check\";\n }\n CHECK(!event_in_progress);\n CHECK_EQ(count, 0);\n }\n \n};\n\n} \/\/ namespace Grappa\n\n\/\/\/ Synchronizing delegates\nnamespace Grappa {\n \/\/\/ Synchronizing private task spawn. Automatically enrolls task with GlobalCompletionEvent and\n \/\/\/ does local `complete` when done (if GCE is non-null).\n template<typename TF>\n void privateTask(GlobalCompletionEvent * gce, TF tf) {\n gce->enroll();\n privateTask([gce,tf] {\n tf();\n gce->complete();\n });\n }\n\n \/\/\/ Synchronizing private task spawn. Automatically enrolls task with GlobalCompletionEvent and\n \/\/\/ does local `complete` when done (if GCE is non-null).\n \/\/\/ In this version, GCE is a template parameter to avoid taking up space in the task's args.\n template<GlobalCompletionEvent * GCE, typename TF>\n void privateTask(TF tf) {\n if (GCE) GCE->enroll();\n Core origin = mycore();\n privateTask([tf] {\n tf();\n if (GCE) GCE->complete();\n });\n }\n\n \/\/\/ Synchronizing public task spawn. Automatically enrolls task with GlobalCompletionEvent and\n \/\/\/ sends `complete` message when done (if GCE is non-null).\n template<GlobalCompletionEvent * GCE, typename TF>\n inline void publicTask(TF tf) {\n if (GCE) GCE->enroll();\n Core origin = mycore();\n publicTask([origin,tf] {\n tf();\n if (GCE) complete(make_global(GCE,origin));\n });\n }\n \n} \/\/ namespace Grappa\n<|endoftext|>"} {"text":"<commit_before>#include \"common.h\"\n\n#include \"hex\/basics\/hexgrid.h\"\n#include \"hex\/game\/game.h\"\n#include \"hex\/game\/movement\/movement.h\"\n#include \"hex\/resources\/view_def.h\"\n#include \"hex\/view\/player.h\"\n#include \"hex\/view\/view.h\"\n\n\nGhost::Ghost(GameView *view, UnitStack::pointer stack, const IntSet selected_units, Path path, UnitStack::pointer target_stack):\n finished(false), view(view), step(0), progress(0) {\n\n \/\/ Create ghost\n UnitStack::pointer ghost_stack = stack->copy_subset(selected_units);\n stack_view = boost::make_shared<UnitStackView>(ghost_stack);\n view->set_view_def(*stack_view);\n stack_view->path = path;\n\n \/\/ Lock target\n target_view = view->get_stack_view(target_stack->id);\n target_view->locked = true;\n if (stack == target_stack || target_stack->units.size() == 0)\n target_view->moving = true;\n}\n\nvoid Ghost::update(unsigned int update_ms) {\n UnitViewDef::pointer& view_def = stack_view->view_def;\n progress += frame_incr(view_def->move_speed, update_ms);\n if (progress > 1000) {\n stack_view->stack->position = stack_view->path[step];\n step++;\n progress -= 1000;\n }\n\n UnitStack::pointer& target = target_view->stack;\n if (step >= stack_view->path.size()) {\n view->set_view_def(*target_view);\n target_view->locked = false;\n if (target_view->moving) {\n target_view->moving = false;\n target_view->facing = stack_view->facing;\n }\n if (view->player->has_view(target->owner)) {\n view->level_view.visibility.unmask(*target);\n view->update_visibility();\n }\n finished = true;\n return;\n }\n\n Point next_pos = stack_view->path[step];\n stack_view->facing = get_direction(next_pos, stack_view->stack->position);\n stack_view->phase += frame_incr(view_def->move_animations[stack_view->facing].bpm, update_ms);\n if (view->player->has_view(target->owner)) {\n view->level_view.discovered.draw(next_pos, target->sight(), true);\n view->level_view.ghost_visibility.draw(next_pos, target->sight(), true);\n }\n}\n<commit_msg>Fix bug where ghosts aren't animated properly.<commit_after>#include \"common.h\"\n\n#include \"hex\/basics\/hexgrid.h\"\n#include \"hex\/game\/game.h\"\n#include \"hex\/game\/movement\/movement.h\"\n#include \"hex\/resources\/view_def.h\"\n#include \"hex\/view\/player.h\"\n#include \"hex\/view\/view.h\"\n\n\nGhost::Ghost(GameView *view, UnitStack::pointer stack, const IntSet selected_units, Path path, UnitStack::pointer target_stack):\n finished(false), view(view), step(0), progress(0) {\n\n \/\/ Create ghost\n UnitStack::pointer ghost_stack = stack->copy_subset(selected_units);\n stack_view = boost::make_shared<UnitStackView>(ghost_stack);\n view->set_view_def(*stack_view);\n stack_view->path = path;\n stack_view->moving = true;\n\n \/\/ Lock target\n target_view = view->get_stack_view(target_stack->id);\n target_view->locked = true;\n if (stack == target_stack || target_stack->units.size() == 0)\n target_view->moving = true;\n}\n\nvoid Ghost::update(unsigned int update_ms) {\n UnitViewDef::pointer& view_def = stack_view->view_def;\n progress += frame_incr(view_def->move_speed, update_ms);\n if (progress > 1000) {\n stack_view->stack->position = stack_view->path[step];\n step++;\n progress -= 1000;\n }\n\n UnitStack::pointer& target = target_view->stack;\n if (step >= stack_view->path.size()) {\n view->set_view_def(*target_view);\n target_view->locked = false;\n if (target_view->moving) {\n target_view->moving = false;\n target_view->facing = stack_view->facing;\n }\n if (view->player->has_view(target->owner)) {\n view->level_view.visibility.unmask(*target);\n view->update_visibility();\n }\n finished = true;\n return;\n }\n\n Point next_pos = stack_view->path[step];\n stack_view->facing = get_direction(next_pos, stack_view->stack->position);\n stack_view->phase += frame_incr(view_def->move_animations[stack_view->facing].bpm, update_ms);\n if (view->player->has_view(target->owner)) {\n view->level_view.discovered.draw(next_pos, target->sight(), true);\n view->level_view.ghost_visibility.draw(next_pos, target->sight(), true);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ POSIX\n#include <signal.h>\n\n\/\/ STL\n#include <tr1\/memory>\n\n\/\/ Google Log\n#include <glog\/logging.h>\n\n\/\/ e\n#include <e\/timer.h>\n\n\/\/ Configuration\n#include <configuration\/coordinatorlink.h>\n\n\/\/ HyperDex\n#include <hyperdex\/daemon.h>\n#include <hyperdex\/datalayer.h>\n#include <hyperdex\/logical.h>\n#include <hyperdex\/network_worker.h>\n#include <hyperdex\/replication_manager.h>\n#include <hyperdex\/searches.h>\n\ntypedef std::tr1::shared_ptr<po6::threads::thread> thread_ptr;\n\nstatic bool s_continue = true;\n\nvoid\nsig_handle(int \/*signum*\/)\n{\n LOG(ERROR) << \"signal received; triggering exit..\";\n s_continue = false;\n}\n\nint\nhyperdex :: daemon(po6::pathname datadir,\n po6::net::location coordinator,\n po6::net::ipaddr bind_to,\n uint16_t num_threads)\n{\n \/\/ Catch signals.\n struct sigaction handle;\n handle.sa_handler = sig_handle;\n sigfillset(&handle.sa_mask);\n handle.sa_flags = SA_RESTART;\n int ret = 0;\n ret += sigaction(SIGHUP, &handle, NULL);\n ret += sigaction(SIGINT, &handle, NULL);\n\n if (ret < 0)\n {\n PLOG(INFO) << \"could not set signal handlers (sigaction)\";\n return EXIT_FAILURE;\n }\n\n \/\/ Setup the data component.\n datalayer data; \/\/ XXX Pass in the proper directory\n \/\/ Setup the communication component.\n logical comm(bind_to);\n comm.pause(); \/\/ Pause is idempotent. The first unpause will cancel this one.\n \/\/ Setup the search component.\n searches ssss(&data, &comm);\n \/\/ Setup the replication component.\n replication_manager repl(&data, &comm);\n \/\/ Create our announce string.\n std::ostringstream announce;\n announce << \"instance\\t\" << comm.inst().inbound << \"\\t\"\n << comm.inst().outbound;\n \/\/ Setup our link to the coordinator.\n coordinatorlink cl(coordinator, announce.str());\n LOG(INFO) << \"Connecting to the coordinator.\";\n\n while (s_continue && cl.connect() != coordinatorlink::SUCCESS)\n {\n PLOG(INFO) << \"Coordinator connection failed\";\n }\n\n \/\/ Start the network workers.\n LOG(INFO) << \"Starting network workers.\";\n num_threads = s_continue ? num_threads : 0;\n network_worker nw(&data, &comm, &ssss, &repl);\n std::tr1::function<void (hyperdex::network_worker*)> fnw(&hyperdex::network_worker::run);\n std::vector<thread_ptr> threads;\n\n for (size_t i = 0; i < num_threads; ++i)\n {\n thread_ptr t(new po6::threads::thread(std::tr1::bind(fnw, &nw)));\n t->start();\n threads.push_back(t);\n }\n\n LOG(INFO) << \"Network workers started.\";\n\n while (s_continue)\n {\n if (cl.unacknowledged())\n {\n LOG(INFO) << \"Installing new configuration.\";\n \/\/ Prepare for our new configuration.\n \/\/ These operations should assume that there will be network\n \/\/ activity, and that the network threads will be in full force..\n comm.prepare(cl.config());\n data.prepare(cl.config(), comm.inst());\n repl.prepare(cl.config(), comm.inst());\n\n \/\/ Protect ourself against exceptions.\n e::guard g1 = e::makeobjguard(comm, &hyperdex::logical::unpause);\n e::guard g2 = e::makeobjguard(comm, &hyperdex::logical::shutdown);\n\n LOG(INFO) << \"Pausing communication for reconfiguration.\";\n\n \/\/ Make sure that we wait until everyone is paused.\n comm.pause();\n\n while (comm.num_paused() < num_threads)\n {\n e::sleep_ms(0, 10);\n }\n\n \/\/ Here is the critical section. This is is mutually exclusive with the\n \/\/ network workers' loop.\n comm.reconfigure(cl.config());\n data.reconfigure(cl.config(), comm.inst());\n repl.reconfigure(cl.config(), comm.inst());\n comm.unpause();\n g1.dismiss();\n g2.dismiss();\n LOG(INFO) << \"Reconfiguration complete; unpausing communication.\";\n\n \/\/ Cleanup anything not specified by our new configuration.\n \/\/ These operations should assume that there will be network\n \/\/ activity, and that the network threads will be in full force..\n repl.cleanup(cl.config(), comm.inst());\n data.cleanup(cl.config(), comm.inst());\n comm.cleanup(cl.config());\n cl.acknowledge();\n }\n\n switch (cl.loop(1, -1))\n {\n case coordinatorlink::SHUTDOWN:\n s_continue = false;\n break;\n case coordinatorlink::SUCCESS:\n break;\n case coordinatorlink::CONNECTFAIL:\n case coordinatorlink::DISCONNECT:\n if (cl.connect() != coordinatorlink::SUCCESS)\n {\n PLOG(INFO) << \"Coordinator connection failed\";\n }\n\n break;\n case coordinatorlink::LOGICERROR:\n default:\n assert(!\"Programming error.\");\n }\n }\n\n LOG(INFO) << \"Exiting daemon.\";\n\n \/\/ Stop replication.\n repl.shutdown();\n \/\/ Turn off the network.\n comm.shutdown();\n \/\/ Cleanup the network_worker threads.\n nw.shutdown();\n \/\/ Cleanup the master thread.\n cl.shutdown();\n \/\/ Stop the data layer.\n data.shutdown();\n\n for (std::vector<thread_ptr>::iterator t = threads.begin();\n t != threads.end(); ++t)\n {\n (*t)->join();\n }\n\n return EXIT_SUCCESS;\n}\n\n#if 0\n catch (po6::error& e)\n {\n LOG(ERROR) << \"Uncaught system error: \" << e.what();\n }\n catch (std::bad_alloc& ba)\n {\n LOG(ERROR) << \"Out of memory: \" << ba.what();\n }\n#endif\n<commit_msg>Remove commented-out code.<commit_after>\/\/ Copyright (c) 2011, Cornell University\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/ * Neither the name of HyperDex nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without\n\/\/ specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ POSIX\n#include <signal.h>\n\n\/\/ STL\n#include <tr1\/memory>\n\n\/\/ Google Log\n#include <glog\/logging.h>\n\n\/\/ e\n#include <e\/timer.h>\n\n\/\/ Configuration\n#include <configuration\/coordinatorlink.h>\n\n\/\/ HyperDex\n#include <hyperdex\/daemon.h>\n#include <hyperdex\/datalayer.h>\n#include <hyperdex\/logical.h>\n#include <hyperdex\/network_worker.h>\n#include <hyperdex\/replication_manager.h>\n#include <hyperdex\/searches.h>\n\ntypedef std::tr1::shared_ptr<po6::threads::thread> thread_ptr;\n\nstatic bool s_continue = true;\n\nvoid\nsig_handle(int \/*signum*\/)\n{\n LOG(ERROR) << \"signal received; triggering exit..\";\n s_continue = false;\n}\n\nint\nhyperdex :: daemon(po6::pathname datadir,\n po6::net::location coordinator,\n po6::net::ipaddr bind_to,\n uint16_t num_threads)\n{\n \/\/ Catch signals.\n struct sigaction handle;\n handle.sa_handler = sig_handle;\n sigfillset(&handle.sa_mask);\n handle.sa_flags = SA_RESTART;\n int ret = 0;\n ret += sigaction(SIGHUP, &handle, NULL);\n ret += sigaction(SIGINT, &handle, NULL);\n\n if (ret < 0)\n {\n PLOG(INFO) << \"could not set signal handlers (sigaction)\";\n return EXIT_FAILURE;\n }\n\n \/\/ Setup the data component.\n datalayer data; \/\/ XXX Pass in the proper directory\n \/\/ Setup the communication component.\n logical comm(bind_to);\n comm.pause(); \/\/ Pause is idempotent. The first unpause will cancel this one.\n \/\/ Setup the search component.\n searches ssss(&data, &comm);\n \/\/ Setup the replication component.\n replication_manager repl(&data, &comm);\n \/\/ Create our announce string.\n std::ostringstream announce;\n announce << \"instance\\t\" << comm.inst().inbound << \"\\t\"\n << comm.inst().outbound;\n \/\/ Setup our link to the coordinator.\n coordinatorlink cl(coordinator, announce.str());\n LOG(INFO) << \"Connecting to the coordinator.\";\n\n while (s_continue && cl.connect() != coordinatorlink::SUCCESS)\n {\n PLOG(INFO) << \"Coordinator connection failed\";\n }\n\n \/\/ Start the network workers.\n LOG(INFO) << \"Starting network workers.\";\n num_threads = s_continue ? num_threads : 0;\n network_worker nw(&data, &comm, &ssss, &repl);\n std::tr1::function<void (hyperdex::network_worker*)> fnw(&hyperdex::network_worker::run);\n std::vector<thread_ptr> threads;\n\n for (size_t i = 0; i < num_threads; ++i)\n {\n thread_ptr t(new po6::threads::thread(std::tr1::bind(fnw, &nw)));\n t->start();\n threads.push_back(t);\n }\n\n LOG(INFO) << \"Network workers started.\";\n\n while (s_continue)\n {\n if (cl.unacknowledged())\n {\n LOG(INFO) << \"Installing new configuration.\";\n \/\/ Prepare for our new configuration.\n \/\/ These operations should assume that there will be network\n \/\/ activity, and that the network threads will be in full force..\n comm.prepare(cl.config());\n data.prepare(cl.config(), comm.inst());\n repl.prepare(cl.config(), comm.inst());\n\n \/\/ Protect ourself against exceptions.\n e::guard g1 = e::makeobjguard(comm, &hyperdex::logical::unpause);\n e::guard g2 = e::makeobjguard(comm, &hyperdex::logical::shutdown);\n\n LOG(INFO) << \"Pausing communication for reconfiguration.\";\n\n \/\/ Make sure that we wait until everyone is paused.\n comm.pause();\n\n while (comm.num_paused() < num_threads)\n {\n e::sleep_ms(0, 10);\n }\n\n \/\/ Here is the critical section. This is is mutually exclusive with the\n \/\/ network workers' loop.\n comm.reconfigure(cl.config());\n data.reconfigure(cl.config(), comm.inst());\n repl.reconfigure(cl.config(), comm.inst());\n comm.unpause();\n g1.dismiss();\n g2.dismiss();\n LOG(INFO) << \"Reconfiguration complete; unpausing communication.\";\n\n \/\/ Cleanup anything not specified by our new configuration.\n \/\/ These operations should assume that there will be network\n \/\/ activity, and that the network threads will be in full force..\n repl.cleanup(cl.config(), comm.inst());\n data.cleanup(cl.config(), comm.inst());\n comm.cleanup(cl.config());\n cl.acknowledge();\n }\n\n switch (cl.loop(1, -1))\n {\n case coordinatorlink::SHUTDOWN:\n s_continue = false;\n break;\n case coordinatorlink::SUCCESS:\n break;\n case coordinatorlink::CONNECTFAIL:\n case coordinatorlink::DISCONNECT:\n if (cl.connect() != coordinatorlink::SUCCESS)\n {\n PLOG(INFO) << \"Coordinator connection failed\";\n }\n\n break;\n case coordinatorlink::LOGICERROR:\n default:\n assert(!\"Programming error.\");\n }\n }\n\n LOG(INFO) << \"Exiting daemon.\";\n\n \/\/ Stop replication.\n repl.shutdown();\n \/\/ Turn off the network.\n comm.shutdown();\n \/\/ Cleanup the network_worker threads.\n nw.shutdown();\n \/\/ Cleanup the master thread.\n cl.shutdown();\n \/\/ Stop the data layer.\n data.shutdown();\n\n for (std::vector<thread_ptr>::iterator t = threads.begin();\n t != threads.end(); ++t)\n {\n (*t)->join();\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2018-present Barefoot Networks, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Antonin Bas (antonin@barefootnetworks.com)\n *\n *\/\n\n#include <bm\/bm_sim\/_assert.h>\n#include <bm\/bm_sim\/logger.h>\n\n#ifdef WITH_PI\n#include <bm\/PI\/pi.h>\n#endif\n\n#include <bm\/simple_switch\/runner.h>\n\n#include <PI\/pi.h>\n#include <PI\/target\/pi_imp.h>\n\n#include \"simple_switch.h\"\n\nnamespace bm {\n\nnamespace sswitch {\n\nSimpleSwitchRunner::SimpleSwitchRunner()\n : simple_switch(\n new SimpleSwitch(512 \/* max_port *\/, true \/* enable_swap *\/)) { }\n\nSimpleSwitchRunner::~SimpleSwitchRunner() = default;\n\nint SimpleSwitchRunner::init_and_start(const bm::OptionsParser &parser) {\n int status = simple_switch->init_from_options_parser(\n parser, nullptr, nullptr);\n if (status != 0) return status;\n\n#ifdef WITH_PI\n auto transmit_fn = [this](bm::DevMgrIface::port_t port_num,\n packet_id_t pkt_id, const char *buf, int len) {\n (void)pkt_id;\n if (cpu_port > 0 && port_num == cpu_port) {\n BMLOG_DEBUG(\"Transmitting packet-in\");\n auto status = pi_packetin_receive(simple_switch->get_device_id(),\n buf, static_cast<size_t>(len));\n if (status != PI_STATUS_SUCCESS)\n bm::Logger::get()->error(\"Error when transmitting packet-in\");\n } else {\n simple_switch->transmit_fn(port_num, buf, len);\n }\n };\n simple_switch->set_transmit_fn(transmit_fn);\n\n bm::pi::register_switch(simple_switch.get(), cpu_port);\n#endif\n\n simple_switch->start_and_return();\n\n return 0;\n}\n\n} \/\/ namespace sswitch\n\n} \/\/ namespace bm\n<commit_msg>Add missing #ifdef for PI include in simple_switch runner<commit_after>\/* Copyright 2018-present Barefoot Networks, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Antonin Bas (antonin@barefootnetworks.com)\n *\n *\/\n\n#include <bm\/bm_sim\/_assert.h>\n#include <bm\/bm_sim\/logger.h>\n\n#ifdef WITH_PI\n#include <bm\/PI\/pi.h>\n#endif\n\n#include <bm\/simple_switch\/runner.h>\n\n#ifdef WITH_PI\n#include <PI\/pi.h>\n#include <PI\/target\/pi_imp.h>\n#endif\n\n#include \"simple_switch.h\"\n\nnamespace bm {\n\nnamespace sswitch {\n\nSimpleSwitchRunner::SimpleSwitchRunner()\n : simple_switch(\n new SimpleSwitch(512 \/* max_port *\/, true \/* enable_swap *\/)) { }\n\nSimpleSwitchRunner::~SimpleSwitchRunner() = default;\n\nint SimpleSwitchRunner::init_and_start(const bm::OptionsParser &parser) {\n int status = simple_switch->init_from_options_parser(\n parser, nullptr, nullptr);\n if (status != 0) return status;\n\n#ifdef WITH_PI\n auto transmit_fn = [this](bm::DevMgrIface::port_t port_num,\n packet_id_t pkt_id, const char *buf, int len) {\n (void)pkt_id;\n if (cpu_port > 0 && port_num == cpu_port) {\n BMLOG_DEBUG(\"Transmitting packet-in\");\n auto status = pi_packetin_receive(simple_switch->get_device_id(),\n buf, static_cast<size_t>(len));\n if (status != PI_STATUS_SUCCESS)\n bm::Logger::get()->error(\"Error when transmitting packet-in\");\n } else {\n simple_switch->transmit_fn(port_num, buf, len);\n }\n };\n simple_switch->set_transmit_fn(transmit_fn);\n\n bm::pi::register_switch(simple_switch.get(), cpu_port);\n#endif\n\n simple_switch->start_and_return();\n\n return 0;\n}\n\n} \/\/ namespace sswitch\n\n} \/\/ namespace bm\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include \"il\/GlobalArray.hpp\"\n#include \"AssemblyFileWriter.hpp\"\n\nusing namespace eddic;\n\nGlobalArray::GlobalArray(std::string n, BaseType t, int s) : name(n), type(t), size(s) {}\n\nvoid GlobalArray::write(AssemblyFileWriter& writer){\n writer.stream() << \"VA\" << name << \":\" <<std::endl;\n writer.stream() << \".rept \" << size << std::endl;\n\n if(type == BaseType::INT){\n writer.stream() << \".long 0\" << std::endl;\n } else if(type == BaseType::STRING){\n writer.stream() << \".long S3\" << std::endl;\n writer.stream() << \".long 0\" << std::endl;\n }\n\n writer.stream() << \".endr\" << std::endl;\n}\n<commit_msg>Include the size of the array in the array memory layout<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include \"il\/GlobalArray.hpp\"\n#include \"AssemblyFileWriter.hpp\"\n\nusing namespace eddic;\n\nGlobalArray::GlobalArray(std::string n, BaseType t, int s) : name(n), type(t), size(s) {}\n\nvoid GlobalArray::write(AssemblyFileWriter& writer){\n writer.stream() << \"VA\" << name << \":\" <<std::endl;\n writer.stream() << \".long \" << size << std::endl;\n writer.stream() << \".rept \" << size << std::endl;\n\n if(type == BaseType::INT){\n writer.stream() << \".long 0\" << std::endl;\n } else if(type == BaseType::STRING){\n writer.stream() << \".long S3\" << std::endl;\n writer.stream() << \".long 0\" << std::endl;\n }\n\n writer.stream() << \".endr\" << std::endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n ** \\file libport\/path.cc\n ** \\brief path: implements file libport\/path.hh\n *\/\n\n#include <iostream>\n#include <libport\/fcntl.h>\n#include <libport\/unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <cctype>\n\n#include <libport\/contract.hh>\n#include <libport\/detect-win32.h>\n#include <libport\/finally.hh>\n#include <libport\/foreach.hh>\n#include <libport\/path.hh>\n\n\/\/ Implementation detail: if path_ is empty and absolute_ is false,\n\/\/ then the path is '.'\n\n\nnamespace libport\n{\n path::path(const std::string& p)\n {\n init(p);\n }\n\n path::path(const char* p)\n {\n init(p);\n }\n\n void\n path::init(std::string p)\n {\n if (p.empty())\n throw invalid_path(\"Path can't be empty.\");\n\n \/\/ Compute volume_ and absolute_.\n#if defined WIN32\n \/\/ Under Win32, absolute paths start with a letter followed by\n \/\/ \":\\\". If the trailing slash is missing, this is a relative\n \/\/ path.\n if (2 <= p.length()\n\t&& isalpha(p[0]) && p[1] == ':')\n {\n volume_ = p.substr(0, 2);\n absolute_ = p.length() >= 3 && p[2] == '\\\\';\n p.erase(0, absolute_ ? 3 : 2);\n }\n \/\/ Network share, such as \"\\\\shared volume\\foo\\bar\"\n else if (3 <= p.length()\n\t && p[0] == '\\\\' && p[1] == '\\\\')\n {\n absolute_ = true;\n std::string::size_type pos = p.find(\"\\\\\", 3);\n if (pos == std::string::npos)\n {\n\tvolume_ = p;\n\tp = \"\";\n }\n else\n {\n\tvolume_ = p.substr(0, pos);\n\tp = p.erase(0, pos);\n }\n }\n \/\/ Fallback to Unix cases for subsystems such as cygwin\n else\n#endif \/\/ WIN32\n if (!p.empty() && p[0] == '\/')\n {\n absolute_ = true;\n p = p.erase(0, 0);\n }\n else\n absolute_ = false;\n\n\n \/\/ Cut directories on \/ and \\.\n for (std::string::size_type pos = p.find_first_of(separator_);\n\t pos != std::string::npos;\n\t pos = p.find_first_of(separator_))\n {\n append_dir(p.substr(0, pos));\n p.erase(0, pos + 1);\n }\n append_dir(p);\n }\n\n path&\n path::operator=(const path& rhs)\n {\n absolute_ = rhs.absolute_;\n path_ = rhs.path_;\n#if defined WIN32\n volume_ = rhs.volume_;\n#endif\n return *this;\n }\n\n path&\n path::operator\/=(const path& rhs)\n {\n if (rhs.absolute_get())\n throw invalid_path(\n \"Rhs of concatenation is absolute: \" + rhs.to_string());\n#ifdef WIN32\n if (!rhs.volume_.empty())\n throw invalid_path(\"concatenation of path with volume: \" +\n\t\t\t rhs.to_string());\n#endif\n for (path_type::const_iterator dir = rhs.path_.begin();\n\t dir != rhs.path_.end();\n\t ++dir)\n append_dir(*dir);\n\n return *this;\n }\n\n path\n path::operator\/(const path& rhs) const\n {\n path res = *this;\n return res \/= rhs;\n }\n\n path::operator std::string() const\n {\n return to_string();\n }\n\n std::string\n path::to_string() const\n {\n if (!absolute_ && path_.empty())\n return \".\";\n\n std::string res = WIN32_IF(volume_, \"\");\n if (absolute_)\n res += separator_;\n bool tail = false;\n foreach (const std::string& dir, path_)\n {\n if (tail++)\n\tres += separator_;\n res += dir;\n }\n return res;\n }\n\n bool\n path::operator==(const path& rhs) const\n {\n return path_ == rhs.path_;\n }\n\n std::ostream&\n path::dump(std::ostream& o) const\n {\n return o << operator std::string();\n }\n\n void\n path::append_dir(const std::string& dir)\n {\n precondition(dir.find(separator_) == std::string::npos);\n\n if (dir != \"\" && dir != \".\")\n {\n \/\/ The following does not work properly with symlinks. One\n \/\/ cannot expect that removing \"foo\/..\/\" inside a valid path\n \/\/ results in the same path. We should check whether \"foo\" is\n \/\/ *not* a symlink before playing this kind of trick.\n#if 0\n if (dir == \"..\"\n && !path_.empty() && *path_.rbegin() != \"..\")\n path_.pop_back();\n else\n#endif\n\tpath_.push_back(dir);\n }\n }\n\n\n std::string\n path::basename() const\n {\n \/\/ basename of \/ is \/, basename of . is .\n if (path_.empty())\n return *this;\n\n return path_.back();\n }\n\n path\n path::dirname() const\n {\n \/\/ dirname of \/ is \/, dirname of . is .\n if (path_.empty())\n return *this;\n\n std::string last = path_.back();\n \/\/ The const cast here is justified since the modification is\n \/\/ systematically reverted\n const_cast<path*>(this)->path_.pop_back();\n libport::Finally finally(\n boost::bind(&path_type::push_back,\n\t\t boost::ref(const_cast<path*>(this)->path_), last));\n path res = path_.empty() ? \".\" : *this;\n return res;\n }\n\n bool path::exists() const\n {\n struct stat buf;\n return 0 == stat(to_string().c_str(), &buf);\n }\n\n bool path::create() const\n {\n int fd = open(to_string().c_str(),\n O_WRONLY | O_CREAT | O_EXCL, S_IRUSR | S_IWUSR);\n if (fd == -1)\n return false;\n close(fd);\n return true;\n }\n\n bool path::remove() const\n {\n return !unlink(to_string().c_str());\n }\n\n const path::path_type& path::components() const\n {\n return path_;\n }\n}\n<commit_msg>libport: clean path.<commit_after>\/**\n ** \\file libport\/path.cc\n ** \\brief path: implements file libport\/path.hh\n *\/\n\n#include <iostream>\n#include <libport\/fcntl.h>\n#include <libport\/unistd.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <cctype>\n\n#include <libport\/contract.hh>\n#include <libport\/detect-win32.h>\n#include <libport\/finally.hh>\n#include <libport\/foreach.hh>\n#include <libport\/path.hh>\n\n\/\/ Implementation detail: if path_ is empty and absolute_ is false,\n\/\/ then the path is '.'\n\n\nnamespace libport\n{\n path::path(const std::string& p)\n {\n init(p);\n }\n\n path::path(const char* p)\n {\n init(p);\n }\n\n void\n path::init(std::string p)\n {\n if (p.empty())\n throw invalid_path(\"Path can't be empty.\");\n\n \/\/ Compute volume_ and absolute_.\n#if defined WIN32\n \/\/ Under Win32, absolute paths start with a letter followed by\n \/\/ \":\\\". If the trailing slash is missing, this is a relative\n \/\/ path.\n if (2 <= p.length()\n\t&& isalpha(p[0]) && p[1] == ':')\n {\n volume_ = p.substr(0, 2);\n absolute_ = p.length() >= 3 && p[2] == '\\\\';\n p.erase(0, absolute_ ? 3 : 2);\n }\n \/\/ Network share, such as \"\\\\shared volume\\foo\\bar\"\n else if (3 <= p.length()\n\t && p[0] == '\\\\' && p[1] == '\\\\')\n {\n absolute_ = true;\n std::string::size_type pos = p.find('\\\\', 3);\n if (pos == std::string::npos)\n {\n\tvolume_ = p;\n\tp.clear();\n }\n else\n {\n\tvolume_ = p.substr(0, pos);\n\tp = p.erase(0, pos);\n }\n }\n \/\/ Fallback to Unix cases for subsystems such as cygwin\n else\n#endif \/\/ WIN32\n if (!p.empty() && p[0] == '\/')\n {\n absolute_ = true;\n p = p.erase(0, 0);\n }\n else\n absolute_ = false;\n\n\n \/\/ Cut directories on \/ and \\.\n for (std::string::size_type pos = p.find_first_of(separator_);\n\t pos != std::string::npos;\n\t pos = p.find_first_of(separator_))\n {\n append_dir(p.substr(0, pos));\n p.erase(0, pos + 1);\n }\n append_dir(p);\n }\n\n path&\n path::operator=(const path& rhs)\n {\n absolute_ = rhs.absolute_;\n path_ = rhs.path_;\n#if defined WIN32\n volume_ = rhs.volume_;\n#endif\n return *this;\n }\n\n path&\n path::operator\/=(const path& rhs)\n {\n if (rhs.absolute_get())\n throw invalid_path(\n \"Rhs of concatenation is absolute: \" + rhs.to_string());\n#ifdef WIN32\n if (!rhs.volume_.empty())\n throw invalid_path(\"concatenation of path with volume: \" +\n\t\t\t rhs.to_string());\n#endif\n for (path_type::const_iterator dir = rhs.path_.begin();\n\t dir != rhs.path_.end();\n\t ++dir)\n append_dir(*dir);\n\n return *this;\n }\n\n path\n path::operator\/(const path& rhs) const\n {\n path res = *this;\n return res \/= rhs;\n }\n\n path::operator std::string() const\n {\n return to_string();\n }\n\n std::string\n path::to_string() const\n {\n if (!absolute_ && path_.empty())\n return \".\";\n\n std::string res = WIN32_IF(volume_, \"\");\n if (absolute_)\n res += separator_;\n bool tail = false;\n foreach (const std::string& dir, path_)\n {\n if (tail++)\n\tres += separator_;\n res += dir;\n }\n return res;\n }\n\n bool\n path::operator==(const path& rhs) const\n {\n return path_ == rhs.path_;\n }\n\n std::ostream&\n path::dump(std::ostream& o) const\n {\n return o << operator std::string();\n }\n\n void\n path::append_dir(const std::string& dir)\n {\n precondition(dir.find(separator_) == std::string::npos);\n\n if (!dir.empty() && dir != \".\")\n {\n \/\/ The following does not work properly with symlinks. One\n \/\/ cannot expect that removing \"foo\/..\/\" inside a valid path\n \/\/ results in the same path. We should check whether \"foo\" is\n \/\/ *not* a symlink before playing this kind of trick.\n#if 0\n if (dir == \"..\"\n && !path_.empty() && *path_.rbegin() != \"..\")\n path_.pop_back();\n else\n#endif\n\tpath_.push_back(dir);\n }\n }\n\n\n std::string\n path::basename() const\n {\n \/\/ basename of \/ is \/, basename of . is .\n if (path_.empty())\n return *this;\n\n return path_.back();\n }\n\n path\n path::dirname() const\n {\n \/\/ dirname of \/ is \/, dirname of . is .\n if (path_.empty())\n return *this;\n\n std::string last = path_.back();\n \/\/ The const cast here is justified since the modification is\n \/\/ systematically reverted\n const_cast<path*>(this)->path_.pop_back();\n libport::Finally finally(\n boost::bind(&path_type::push_back,\n\t\t boost::ref(const_cast<path*>(this)->path_), last));\n path res = path_.empty() ? \".\" : *this;\n return res;\n }\n\n bool path::exists() const\n {\n struct stat buf;\n return 0 == stat(to_string().c_str(), &buf);\n }\n\n bool path::create() const\n {\n int fd = open(to_string().c_str(),\n O_WRONLY | O_CREAT | O_EXCL, S_IRUSR | S_IWUSR);\n if (fd == -1)\n return false;\n close(fd);\n return true;\n }\n\n bool path::remove() const\n {\n return !unlink(to_string().c_str());\n }\n\n const path::path_type& path::components() const\n {\n return path_;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"hal.h\"\n#include \"renameFile.h\"\n\nusing namespace std;\nusing namespace hal;\n\nstatic void initParser(CLParser &optionsParser) {\n optionsParser.setDescription(\"Rename genomes in a HAL file in-place.\");\n optionsParser.addArgument(\"halFile\", \"hal file\");\n optionsParser.addArgument(\"renameFile\", \"Tab-separated file. First column: existing genome\"\n \" name, second column: new genome name. Any \"\n \"genomes not provided will stay the same.\");\n}\n\nint main(int argc, char *argv[]) {\n CLParser optionsParser(WRITE_ACCESS);\n initParser(optionsParser);\n string halPath, renamePath;\n try {\n optionsParser.parseOptions(argc, argv);\n halPath = optionsParser.getArgument<string>(\"halFile\");\n renamePath = optionsParser.getArgument<string>(\"renameFile\");\n } catch (exception &e) {\n cerr << e.what() << endl;\n optionsParser.printUsage(cerr);\n return 1;\n }\n\n AlignmentPtr alignment(openHalAlignment(halPath, &optionsParser));\n map<string, string> renameMap = ingestRenameFile(renamePath);\n\n \/\/ Check that the alignment has all the old genome names, and none\n \/\/ of the new genome names.\n for (map<string, string>::iterator it = renameMap.begin(); it != renameMap.end(); it++) {\n Genome *genome = alignment->openGenome(it->first);\n if (genome == NULL) {\n throw hal_exception(\"Genome \" + it->first + \" not found in alignment\");\n }\n\n genome = alignment->openGenome(it->second);\n if (genome != NULL) {\n throw hal_exception(\"Attempting to rename \" + it->first + \" to \" + it->second + \" failed: \" + it->second +\n \" is already in the alignment! Name it to something\"\n \" temporary first\");\n }\n }\n\n \/\/ Do the actual renaming now that we are relatively sure nothing\n \/\/ will go wrong.\n for (map<string, string>::iterator it = renameMap.begin(); it != renameMap.end(); it++) {\n cout << \"Renaming \" << it->first << \" to \" << it->second << endl;\n Genome *genome = alignment->openGenome(it->first);\n genome->rename(it->second);\n }\n\n alignment->close();\n}\n<commit_msg>add write access for halRenameGenomes<commit_after>#include \"hal.h\"\n#include \"renameFile.h\"\n\nusing namespace std;\nusing namespace hal;\n\nstatic void initParser(CLParser &optionsParser) {\n optionsParser.setDescription(\"Rename genomes in a HAL file in-place.\");\n optionsParser.addArgument(\"halFile\", \"hal file\");\n optionsParser.addArgument(\"renameFile\", \"Tab-separated file. First column: existing genome\"\n \" name, second column: new genome name. Any \"\n \"genomes not provided will stay the same.\");\n}\n\nint main(int argc, char *argv[]) {\n CLParser optionsParser(WRITE_ACCESS);\n initParser(optionsParser);\n string halPath, renamePath;\n try {\n optionsParser.parseOptions(argc, argv);\n halPath = optionsParser.getArgument<string>(\"halFile\");\n renamePath = optionsParser.getArgument<string>(\"renameFile\");\n } catch (exception &e) {\n cerr << e.what() << endl;\n optionsParser.printUsage(cerr);\n return 1;\n }\n\n AlignmentPtr alignment(openHalAlignment(halPath, &optionsParser, WRITE_ACCESS | READ_ACCESS));\n map<string, string> renameMap = ingestRenameFile(renamePath);\n\n \/\/ Check that the alignment has all the old genome names, and none\n \/\/ of the new genome names.\n for (map<string, string>::iterator it = renameMap.begin(); it != renameMap.end(); it++) {\n Genome *genome = alignment->openGenome(it->first);\n if (genome == NULL) {\n throw hal_exception(\"Genome \" + it->first + \" not found in alignment\");\n }\n\n genome = alignment->openGenome(it->second);\n if (genome != NULL) {\n throw hal_exception(\"Attempting to rename \" + it->first + \" to \" + it->second + \" failed: \" + it->second +\n \" is already in the alignment! Name it to something\"\n \" temporary first\");\n }\n }\n\n \/\/ Do the actual renaming now that we are relatively sure nothing\n \/\/ will go wrong.\n for (map<string, string>::iterator it = renameMap.begin(); it != renameMap.end(); it++) {\n cout << \"Renaming \" << it->first << \" to \" << it->second << endl;\n Genome *genome = alignment->openGenome(it->first);\n genome->rename(it->second);\n }\n\n alignment->close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * Copyright (c) 2015 Wojciech Migda\n * All rights reserved\n * Distributed under the terms of the GNU LGPL v3\n *******************************************************************************\n *\n * Filename: TripSafetyFactors.hpp\n *\n * Description:\n * TripSafetyFactors class\n *\n * Authors:\n * Wojciech Migda (wm)\n *\n *******************************************************************************\n * History:\n * --------\n * Date Who Ticket Description\n * ---------- --- --------- ------------------------------------------------\n * 2015-01-27 wm Initial version\n *\n ******************************************************************************\/\n\n#ifndef TRIPSAFETYFACTORS_HPP_\n#define TRIPSAFETYFACTORS_HPP_\n\n#include \"array2d.hpp\"\n#include \"logreg.hpp\"\n#include \"num.hpp\"\n\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iostream>\n#include <cstdlib>\n#include <iterator>\n\ntypedef double real_type;\n\nstd::vector<int> do_log_reg(\n num::array2d<real_type> && i_X_train,\n std::valarray<real_type> && i_y_train,\n num::array2d<real_type> && i_X_test\n)\n{\n std::vector<int> result(i_X_test.shape().first);\n\n const num::size_type NUM_FEAT{i_X_train.shape().second + 1};\n\n \/\/ let's map input features onto what we'll work with\n num::array2d<real_type> X_train =\n num::ones<real_type>(num::shape_type{i_X_train.shape().first, NUM_FEAT});\n\n X_train[X_train.columns(1, X_train.shape().second - 1)] =\n i_X_train[i_X_train.columns(0, i_X_train.shape().second - 1)];\n\n \/\/ same with test features\n num::array2d<real_type> X_test =\n num::ones<real_type>(num::shape_type{i_X_test.shape().first, NUM_FEAT});\n\n X_test[X_test.columns(1, X_test.shape().second - 1)] =\n i_X_test[i_X_test.columns(0, i_X_test.shape().second - 1)];\n\n std::valarray<real_type> y_train = i_y_train.apply([](real_type v){return v > 1.0 ? 1.0 : v;});\n\n std::valarray<real_type> theta(0.0, X_train.shape().second);\n\n {\n \/\/ testing\n for (num::size_type c{1}; c < X_train.shape().second; ++c)\n {\n const std::valarray<real_type> & col = X_train[X_train.column(c)];\n const std::valarray<real_type> & colt = X_test[X_test.column(c)];\n\n const real_type mu = num::mean<real_type>(col);\n const real_type dev = num::std<real_type>(col);\n\n X_train[X_train.column(c)] = col - mu;\n X_train[X_train.column(c)] = col \/ dev;\n\n X_test[X_test.column(c)] = colt - mu;\n X_test[X_test.column(c)] = colt \/ dev;\n }\n }\n\n num::LogisticRegression<real_type> logRegClassifier(\n num::LogisticRegression<real_type>::array_type{X_train},\n num::LogisticRegression<real_type>::vector_type{y_train},\n num::LogisticRegression<real_type>::vector_type{theta},\n 0.03,\n 200\n );\n\n auto fit_theta = logRegClassifier.fit();\n\n\/\/ std::copy(std::begin(fit_theta), std::end(fit_theta), std::ostream_iterator<real_type>(std::cerr, \"\\n\"));\n\n auto pred = logRegClassifier.predict(X_test, fit_theta, false);\n\/\/ std::copy(std::begin(pred), std::end(pred), std::ostream_iterator<real_type>(std::cerr, \"\\n\"));\n std::cerr << \"pred.max() \" << pred.max() << std::endl;\n {\n std::vector<std::pair<num::size_type, real_type>> zipped;\n zipped.reserve(pred.size());\n\n for (num::size_type idx = 0; idx < pred.size(); ++idx)\n {\n zipped.push_back(std::pair<num::size_type, real_type>(idx + 1, pred[idx]));\n }\n std::sort(zipped.begin(), zipped.end(),\n [](const std::pair<num::size_type, real_type> & p, const std::pair<num::size_type, real_type> & q)\n {\n return p.second > q.second;\n }\n );\n std::transform(zipped.cbegin(), zipped.cend(), result.begin(),\n [](const std::pair<num::size_type, real_type> & p)\n {\n return (int)p.first;\n }\n );\n }\n\n return result;\n}\n\nstruct TripSafetyFactors\n{\n std::vector<int> predict(\n std::vector<std::string> i_train_data,\n std::vector<std::string> i_test_data) const;\n};\n\nstd::vector<int>\nTripSafetyFactors::predict(\n std::vector<std::string> i_train_data,\n std::vector<std::string> i_test_data) const\n{\n enum col : num::size_type\n {\n ID,\n SOURCE,\n DIST,\n CYCLES,\n COMPLEXITY,\n CARGO,\n STOPS,\n START_DAY,\n START_MONTH,\n START_DAY_OF_MONTH,\n START_DAY_OF_WEEK,\n START_TIME,\n DAYS,\n PILOT,\n PILOT2,\n PILOT_EXP,\n PILOT_VISITS_PREV,\n PILOT_HOURS_PREV,\n PILOT_DUTY_HOURS_PREV,\n PILOT_DIST_PREV,\n ROUTE_RISK_1,\n ROUTE_RISK_2,\n WEATHER,\n VISIBILITY,\n TRAF0,\n TRAF1,\n TRAF2,\n TRAF3,\n TRAF4,\n \/\/\/\/\/\/\/\/\/\/\/\/\/\n ACCEL_CNT,\n DECEL_CNT,\n SPEED_CNT,\n STABILITY_CNT,\n EVT_CNT\n };\n const num::size_type TRAIN_ROWS{i_train_data.size()};\n constexpr num::size_type TRAIN_COLS{34};\n\n const num::size_type TEST_ROWS{i_test_data.size()};\n constexpr num::size_type TEST_COLS{29};\n\n const num::shape_type TRAIN_SHAPE{TRAIN_ROWS, TRAIN_COLS};\n const num::shape_type TEST_SHAPE{TEST_ROWS, TEST_COLS};\n\n std::vector<int> result(TEST_ROWS);\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n std::iota(result.begin(), result.end(), 1);\n std::random_shuffle(result.begin(), result.end());\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n auto time_xlt = [](const char * str) -> real_type\n {\n char * next;\n long int result = std::strtol(str, &next, 10) * 60;\n if (*next == ':')\n {\n result += std::strtol(next + 1, nullptr, 10);\n }\n return result;\n };\n num::array2d<real_type> train_data =\n num::loadtxt(\n std::move(i_train_data),\n std::move(\n num::loadtxtCfg<real_type>()\n .delimiter(',')\n .converters(num::loadtxtCfg<real_type>::converters_type{{col::START_TIME, time_xlt}})\n )\n );\n std::cerr << train_data.shape() << std::endl;\n\n num::array2d<real_type> test_data =\n num::loadtxt(\n std::move(i_test_data),\n std::move(\n num::loadtxtCfg<real_type>()\n .delimiter(',')\n .converters(num::loadtxtCfg<real_type>::converters_type{{col::START_TIME, time_xlt}})\n )\n );\n std::cerr << test_data.shape() << std::endl;\n\n num::array2d<real_type> X_train_data(num::shape_type{train_data.shape().first, col::TRAF4 - col::SOURCE + 1}, 0.0);\n X_train_data[X_train_data.columns(0, X_train_data.shape().second - 1)] =\n train_data[train_data.columns(col::SOURCE, col::TRAF4)];\n\n std::valarray<real_type> y_train_data = train_data[train_data.column(col::EVT_CNT)];\n\n num::array2d<real_type> X_test_data(num::shape_type{test_data.shape().first, test_data.shape().second - 1}, 0.0);\n X_test_data[X_test_data.columns(0, X_test_data.shape().second - 1)] =\n test_data[test_data.columns(col::SOURCE, col::TRAF4)];\n\n result = do_log_reg(std::move(X_train_data), std::move(y_train_data), std::move(X_test_data));\n\n\/\/ void foo();\n\/\/ foo();\n\n return result;\n}\n\n\/\/#include <functional>\n\/\/#include \"fmincg.hpp\"\n\/\/#include <iterator>\n\/\/#include <fstream>\n\/\/void foo()\n\/\/{\n\/\/ typedef double real;\n\/\/ std::vector<std::string> Xtxt;\n\/\/ std::vector<std::string> ytxt;\n\/\/ {\n\/\/ std::ifstream fcsv(\"xxx.txt\");\n\/\/\n\/\/ for (std::string line; std::getline(fcsv, line);)\n\/\/ {\n\/\/ Xtxt.push_back(line);\n\/\/ }\n\/\/ fcsv.close();\n\/\/ }\n\/\/ {\n\/\/ std::ifstream fcsv(\"xxy.txt\");\n\/\/\n\/\/ for (std::string line; std::getline(fcsv, line);)\n\/\/ {\n\/\/ ytxt.push_back(line);\n\/\/ }\n\/\/ fcsv.close();\n\/\/ }\n\/\/ num::array2d<real> X =\n\/\/ num::loadtxt(\n\/\/ std::move(Xtxt),\n\/\/ std::move(\n\/\/ num::loadtxtCfg<real>()\n\/\/ .delimiter(',')\n\/\/ )\n\/\/ );\n\/\/ std::cerr << X.shape() << std::endl;\n\/\/ num::array2d<real> ym =\n\/\/ num::loadtxt(\n\/\/ std::move(ytxt),\n\/\/ std::move(\n\/\/ num::loadtxtCfg<real>()\n\/\/ .delimiter(',')\n\/\/ )\n\/\/ );\n\/\/ std::cerr << ym.shape() << std::endl;\n\/\/ std::valarray<real> y = ym[ym.column(0)];\n\/\/\n\/\/ std::valarray<real> theta(0.0, X.shape().second);\n\/\/\n\/\/ num::LogisticRegression<real> logRegClassifier(\n\/\/ num::LogisticRegression<real>::array_type{X},\n\/\/ num::LogisticRegression<real>::vector_type{y},\n\/\/ num::LogisticRegression<real>::vector_type{theta},\n\/\/ 1.0,\n\/\/ 400\n\/\/ );\n\/\/\n\/\/ auto fit_theta = logRegClassifier.fit();\n\/\/ std::copy(std::begin(fit_theta), std::end(fit_theta), std::ostream_iterator<real>(std::cerr, \"\\n\"));\n\/\/\n\/\/ auto prediction = logRegClassifier.predict(X, fit_theta);\n\/\/ std::copy(std::begin(prediction), std::end(prediction), std::ostream_iterator<real>(std::cerr, \"\\n\"));\n\/\/\n\/\/ return;\n\/\/}\n\n#endif \/* TRIPSAFETYFACTORS_HPP_ *\/\n<commit_msg>feature remapping and code decluttering<commit_after>\/*******************************************************************************\n * Copyright (c) 2015 Wojciech Migda\n * All rights reserved\n * Distributed under the terms of the GNU LGPL v3\n *******************************************************************************\n *\n * Filename: TripSafetyFactors.hpp\n *\n * Description:\n * TripSafetyFactors class\n *\n * Authors:\n * Wojciech Migda (wm)\n *\n *******************************************************************************\n * History:\n * --------\n * Date Who Ticket Description\n * ---------- --- --------- ------------------------------------------------\n * 2015-01-27 wm Initial version\n *\n ******************************************************************************\/\n\n#ifndef TRIPSAFETYFACTORS_HPP_\n#define TRIPSAFETYFACTORS_HPP_\n\n#include \"array2d.hpp\"\n#include \"logreg.hpp\"\n#include \"num.hpp\"\n\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <iostream>\n#include <cstdlib>\n#include <iterator>\n#include <map>\n\ntypedef double real_type;\n\nstd::map<real_type, real_type>\nmap_event_density(\n const std::valarray<real_type> & feat,\n const std::valarray<real_type> & y\n)\n{\n std::map<real_type, std::pair<num::size_type, num::size_type>> event_count;\n\n assert(feat.size() == y.size());\n\n for (num::size_type r{0}; r < feat.size(); ++r)\n {\n event_count[feat[r]].first++;\n event_count[feat[r]].second += y[r];\n }\n\n std::map<real_type, real_type> result;\n\n for (auto count : event_count)\n {\n result[count.first] = (real_type)count.second.second \/ count.second.first;\n }\n\n return result;\n}\n\nstd::vector<int> do_log_reg(\n num::array2d<real_type> && i_X_train,\n std::valarray<real_type> && i_y_train,\n num::array2d<real_type> && i_X_test\n)\n{\n typedef num::array2d<real_type> array_type;\n typedef std::valarray<real_type> vector_type;\n\n const num::size_type NUM_FEAT{i_X_train.shape().second + 1};\n\n \/\/ let's map input training features onto what we'll work with\n \/\/ first column will be 1s for the intercept\n array_type X_train = num::ones<real_type>({i_X_train.shape().first, NUM_FEAT});\n\n \/\/ the rest will be copied from i_X_train\n \/\/ X_train[:, 1:] = i_X_train[:, :]\n X_train[X_train.columns(1, -1)] = i_X_train[i_X_train.columns(0, -1)];\n\n \/\/ same with test features\n array_type X_test = num::ones<real_type>({i_X_test.shape().first, NUM_FEAT});\n\n \/\/ X_test[:, 1:] = i_X_test[:, :]\n X_test[X_test.columns(1, -1)] = i_X_test[i_X_test.columns(0, -1)];\n\n \/\/ we got train and test features mapped\n\n \/\/ lets keep columnd indices under control\n enum col : num::size_type\n {\n INTERCEPT,\n SOURCE, \/\/ *\n DIST,\n CYCLES,\n COMPLEXITY,\n CARGO, \/\/ *\n STOPS,\n START_DAY,\n START_MONTH,\n START_DAY_OF_MONTH,\n START_DAY_OF_WEEK,\n START_TIME,\n DAYS,\n PILOT, \/\/ *\n PILOT2, \/\/ *\n PILOT_EXP,\n PILOT_VISITS_PREV,\n PILOT_HOURS_PREV,\n PILOT_DUTY_HOURS_PREV,\n PILOT_DIST_PREV,\n ROUTE_RISK_1,\n ROUTE_RISK_2,\n WEATHER, \/\/ *\n VISIBILITY,\n TRAF0,\n TRAF1,\n TRAF2,\n TRAF3,\n TRAF4,\n };\n\n \/\/ There are some features (marked with asterix above) which do not have\n \/\/ a meaning in a monotonic domain. Let's do the following experiment:\n \/\/ for each of those features map to each occuring value a pair of values -\n \/\/ a number of occurences and a sum of events,\n \/\/ then we remap the original values to event density\n\n for (auto COLUMN :\n std::initializer_list<int>\n {\n col::SOURCE,\n col::CARGO,\n col::PILOT,\n col::PILOT2,\n\n\/\/ col::START_DAY, \/\/ ---\n col::START_MONTH, \/\/ +++\n\/\/ col::START_DAY_OF_MONTH, \/\/ ---\n\/\/ col::START_DAY_OF_WEEK, \/\/ ---\n\/\/ col::WEATHER\n }\n )\n {\n auto event_density = map_event_density(X_train[X_train.column(COLUMN)], i_y_train);\n std::cerr << \"event density size: \" << event_density.size() << std::endl;\n\n vector_type mapped_train_col = X_train[X_train.column(COLUMN)];\n std::transform(std::begin(mapped_train_col), std::end(mapped_train_col), std::begin(mapped_train_col),\n [&event_density](const real_type & x) -> real_type\n {\n return event_density[x];\n }\n );\n X_train[X_train.column(COLUMN)] = mapped_train_col;\n\n vector_type mapped_test_col = X_test[X_test.column(COLUMN)];\n std::transform(std::begin(mapped_test_col), std::end(mapped_test_col), std::begin(mapped_test_col),\n [&event_density](const real_type & x) -> real_type\n {\n return event_density[x];\n }\n );\n X_test[X_test.column(COLUMN)] = mapped_test_col;\n }\n\n\n vector_type y_train = i_y_train.apply([](real_type v){return v > 1.0 ? 1.0 : v;});\n\n vector_type theta(0.0, X_train.shape().second);\n\n \/\/ standardization\n for (num::size_type c{1}; c < X_train.shape().second; ++c)\n {\n const vector_type & col = X_train[X_train.column(c)];\n const vector_type & colt = X_test[X_test.column(c)];\n\n const real_type mu = num::mean<real_type>(col);\n const real_type dev = num::std<real_type>(col);\n\n X_train[X_train.column(c)] = col - mu;\n X_train[X_train.column(c)] = col \/ dev;\n\n X_test[X_test.column(c)] = colt - mu;\n X_test[X_test.column(c)] = colt \/ dev;\n }\n\n num::LogisticRegression<real_type> logRegClassifier(\n num::LogisticRegression<real_type>::array_type{X_train},\n num::LogisticRegression<real_type>::vector_type{y_train},\n num::LogisticRegression<real_type>::vector_type{theta},\n 0.03,\n 200\n );\n\n auto fit_theta = logRegClassifier.fit();\n\n\/\/ std::copy(std::begin(fit_theta), std::end(fit_theta), std::ostream_iterator<real_type>(std::cerr, \"\\n\"));\n\n auto pred = logRegClassifier.predict(X_test, fit_theta, false);\n\/\/ std::copy(std::begin(pred), std::end(pred), std::ostream_iterator<real_type>(std::cerr, \"\\n\"));\n std::cerr << \"pred.max() \" << pred.max() << std::endl;\n\n std::vector<int> result(i_X_test.shape().first);\n\n std::vector<std::pair<num::size_type, real_type>> zipped;\n zipped.reserve(pred.size());\n\n for (num::size_type idx = 0; idx < pred.size(); ++idx)\n {\n zipped.push_back(std::pair<num::size_type, real_type>(idx + 1, pred[idx]));\n }\n std::sort(zipped.begin(), zipped.end(),\n [](const std::pair<num::size_type, real_type> & p, const std::pair<num::size_type, real_type> & q)\n {\n return p.second > q.second;\n }\n );\n std::transform(zipped.cbegin(), zipped.cend(), result.begin(),\n [](const std::pair<num::size_type, real_type> & p)\n {\n return (int)p.first;\n }\n );\n\n return result;\n}\n\nstruct TripSafetyFactors\n{\n std::vector<int> predict(\n std::vector<std::string> i_train_data,\n std::vector<std::string> i_test_data) const;\n};\n\nstd::vector<int>\nTripSafetyFactors::predict(\n std::vector<std::string> i_train_data,\n std::vector<std::string> i_test_data) const\n{\n enum col : num::size_type\n {\n ID,\n SOURCE,\n DIST,\n CYCLES,\n COMPLEXITY,\n CARGO,\n STOPS,\n START_DAY,\n START_MONTH,\n START_DAY_OF_MONTH,\n START_DAY_OF_WEEK,\n START_TIME,\n DAYS,\n PILOT,\n PILOT2,\n PILOT_EXP,\n PILOT_VISITS_PREV,\n PILOT_HOURS_PREV,\n PILOT_DUTY_HOURS_PREV,\n PILOT_DIST_PREV,\n ROUTE_RISK_1,\n ROUTE_RISK_2,\n WEATHER,\n VISIBILITY,\n TRAF0,\n TRAF1,\n TRAF2,\n TRAF3,\n TRAF4,\n \/\/\/\/\/\/\/\/\/\/\/\/\/\n ACCEL_CNT,\n DECEL_CNT,\n SPEED_CNT,\n STABILITY_CNT,\n EVT_CNT\n };\n\n typedef num::array2d<real_type> array_type;\n typedef std::valarray<real_type> vector_type;\n\n const num::size_type TRAIN_ROWS{i_train_data.size()};\n constexpr num::size_type TRAIN_COLS{34};\n\n const num::size_type TEST_ROWS{i_test_data.size()};\n constexpr num::size_type TEST_COLS{29};\n\n const num::shape_type TRAIN_SHAPE{TRAIN_ROWS, TRAIN_COLS};\n const num::shape_type TEST_SHAPE{TEST_ROWS, TEST_COLS};\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n auto time_xlt = [](const char * str) -> real_type\n {\n char * next;\n long int result = std::strtol(str, &next, 10) * 60;\n if (*next == ':')\n {\n result += std::strtol(next + 1, nullptr, 10);\n }\n return result;\n };\n array_type train_data =\n num::loadtxt(\n std::move(i_train_data),\n std::move(\n num::loadtxtCfg<real_type>()\n .delimiter(',')\n .converters({{col::START_TIME, time_xlt}})\n )\n );\n std::cerr << train_data.shape() << std::endl;\n\n array_type test_data =\n num::loadtxt(\n std::move(i_test_data),\n std::move(\n num::loadtxtCfg<real_type>()\n .delimiter(',')\n .converters({{col::START_TIME, time_xlt}})\n )\n );\n std::cerr << test_data.shape() << std::endl;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n array_type X_train_data({train_data.shape().first, col::TRAF4 - col::SOURCE + 1}, 0.0);\n\n X_train_data[X_train_data.columns(0, -1)] = train_data[train_data.columns(col::SOURCE, col::TRAF4)];\n\n vector_type y_train_data = train_data[train_data.column(col::EVT_CNT)];\n\n array_type X_test_data({test_data.shape().first, test_data.shape().second - 1}, 0.0);\n\n X_test_data[X_test_data.columns(0, -1)] = test_data[test_data.columns(col::SOURCE, col::TRAF4)];\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n std::vector<int> result(TEST_ROWS);\n\n result = do_log_reg(std::move(X_train_data), std::move(y_train_data), std::move(X_test_data));\n\n return result;\n}\n\n\/\/#include <functional>\n\/\/#include \"fmincg.hpp\"\n\/\/#include <iterator>\n\/\/#include <fstream>\n\/\/void foo()\n\/\/{\n\/\/ typedef double real;\n\/\/ std::vector<std::string> Xtxt;\n\/\/ std::vector<std::string> ytxt;\n\/\/ {\n\/\/ std::ifstream fcsv(\"xxx.txt\");\n\/\/\n\/\/ for (std::string line; std::getline(fcsv, line);)\n\/\/ {\n\/\/ Xtxt.push_back(line);\n\/\/ }\n\/\/ fcsv.close();\n\/\/ }\n\/\/ {\n\/\/ std::ifstream fcsv(\"xxy.txt\");\n\/\/\n\/\/ for (std::string line; std::getline(fcsv, line);)\n\/\/ {\n\/\/ ytxt.push_back(line);\n\/\/ }\n\/\/ fcsv.close();\n\/\/ }\n\/\/ num::array2d<real> X =\n\/\/ num::loadtxt(\n\/\/ std::move(Xtxt),\n\/\/ std::move(\n\/\/ num::loadtxtCfg<real>()\n\/\/ .delimiter(',')\n\/\/ )\n\/\/ );\n\/\/ std::cerr << X.shape() << std::endl;\n\/\/ num::array2d<real> ym =\n\/\/ num::loadtxt(\n\/\/ std::move(ytxt),\n\/\/ std::move(\n\/\/ num::loadtxtCfg<real>()\n\/\/ .delimiter(',')\n\/\/ )\n\/\/ );\n\/\/ std::cerr << ym.shape() << std::endl;\n\/\/ std::valarray<real> y = ym[ym.column(0)];\n\/\/\n\/\/ std::valarray<real> theta(0.0, X.shape().second);\n\/\/\n\/\/ num::LogisticRegression<real> logRegClassifier(\n\/\/ num::LogisticRegression<real>::array_type{X},\n\/\/ num::LogisticRegression<real>::vector_type{y},\n\/\/ num::LogisticRegression<real>::vector_type{theta},\n\/\/ 1.0,\n\/\/ 400\n\/\/ );\n\/\/\n\/\/ auto fit_theta = logRegClassifier.fit();\n\/\/ std::copy(std::begin(fit_theta), std::end(fit_theta), std::ostream_iterator<real>(std::cerr, \"\\n\"));\n\/\/\n\/\/ auto prediction = logRegClassifier.predict(X, fit_theta);\n\/\/ std::copy(std::begin(prediction), std::end(prediction), std::ostream_iterator<real>(std::cerr, \"\\n\"));\n\/\/\n\/\/ return;\n\/\/}\n\n#endif \/* TRIPSAFETYFACTORS_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"Sound.h\"\n#include <alure\/alure.h>\n#include <map>\n#include \"ResourceManager.h\"\n#include <assert.h>\n#include \"Engine\/Logging.h\"\n\nnamespace Sound\n{\n\nconst int CHUNK_LENGTH = 16386;\n\ntypedef std::map<std::string, ALuint> BufferMap;\nBufferMap sounds;\n\nint soundSourceCount;\nALuint* soundSources;\nALuint musicSource;\nALuint musicBufs[2];\nalureStream* currentMusicStream = NULL;\nstd::string currentMusicName = \"\";\nint soundSourceIndex = 0;\n\nvoid DieUnpleasantly()\n{\n\tStopMusic();\n\talureShutdownDevice();\n}\n\nALubyte* GetSoundData(const std::string& path, size_t& length)\n{\n\tSDL_RWops* rwops = ResourceManager::OpenFile(path + \".aiff\");\n\tif (!rwops)\n\t\trwops = ResourceManager::OpenFile(path + \".ogg\");\n\tif (!rwops)\n\t{\n\t\tlength = 0;\n\t\treturn NULL;\n\t}\n\treturn (ALubyte*)ResourceManager::ReadFull(&length, rwops, 1);\n}\n\nstatic ALuint GetSound(const std::string& name)\n{\n\tBufferMap::iterator iter = sounds.find(name);\n\tif (iter != sounds.end())\n\t\treturn iter->second;\n\tsize_t length;\n\tALubyte* data = GetSoundData(\"Sounds\/\" + name, length);\n\tALuint buf = alureCreateBufferFromMemory(data, length);\n\tfree(data);\n\tsounds.insert(std::make_pair(name, buf));\n\treturn buf;\n}\n\nvoid Init(int frequency, int resolution, int sources)\n{\n\t(void)resolution;\n\t--sources; \/\/ one spare source for music\n\tALCint attribs[] = {\n\t\tALC_FREQUENCY, frequency,\n\t\tALC_MONO_SOURCES, sources,\n\t\tALC_STEREO_SOURCES, 1,\n\t\t0\n\t};\n\talureInitDevice(NULL, attribs);\n\tsoundSources = new ALuint[sources];\n\talGenSources(sources, soundSources);\n\talGenSources(1, &musicSource);\n\t\/\/alGenBuffers(2, musicBufs);\n\tsoundSourceCount = sources;\n\tatexit(DieUnpleasantly);\n}\n\nstatic ALuint GetFreeSource()\n{\n\tint idx = soundSourceIndex++;\n\tsoundSourceIndex = soundSourceIndex % soundSourceCount;\n\treturn soundSources[idx];\n}\n\nvoid Preload(const std::string& name)\n{\n\tGetSound(name);\n}\n\nvoid PlaySound(const std::string& name, float gain)\n{\n\tALuint buf = GetSound(name);\n\tALuint source = GetFreeSource();\n\talSourcei(source, AL_BUFFER, buf);\n\talSourcei(source, AL_SOURCE_RELATIVE, AL_FALSE);\n\talSourcef(source, AL_GAIN, gain);\n\talSourcePlay(source);\n}\n\nvoid PlaySoundPositional(const std::string& name, vec2 pos, float gain)\n{\n\tALfloat fpos[] = {pos.X(), pos.Y(), 0.0f};\n\tALuint buf = GetSound(name);\n\tALuint source = GetFreeSource();\n\talSourcei(source, AL_BUFFER, buf);\n\talSourcei(source, AL_SOURCE_RELATIVE, AL_TRUE);\n\talSourcefv(source, AL_POSITION, fpos);\n\talSourcef(source, AL_GAIN, gain);\n\talSourcePlay(source);\n}\n\nstatic ALfloat forientation[] = {1.0f, 0.0f, 0.0f, 0.0f, 0.0f, 1.0f};\n\nvoid SetListener(vec2 pos, vec2 vel)\n{\n\tALfloat fpos[] = {pos.X(), pos.Y(), 0.0f};\n\tALfloat fvel[] = {vel.X(), vel.Y(), 0.0f};\n\talListenerfv(AL_POSITION, fpos);\n\talListenerfv(AL_VELOCITY, fvel);\n\tif (vel.ModulusSquared() > 0.2f)\n\t{\n\t\tforientation[0] = fvel[0];\n\t\tforientation[1] = fvel[1];\n\t}\n\talListenerfv(AL_ORIENTATION, forientation);\n}\n\nstatic void MusicEndCallback(void* ud, ALuint source)\n{\n\talureDestroyStream(currentMusicStream, 2, musicBufs);\n\tcurrentMusicStream = NULL;\n\tcurrentMusicName = \"\";\n\tfree(ud);\n}\n\nvoid PlayMusic(const std::string& name)\n{\n\tif (currentMusicStream)\n\t\talureStopSource(musicSource, AL_TRUE);\n\tsize_t length;\n\tALubyte* data = GetSoundData(\"Music\/\" + name, length);\n\tcurrentMusicName = name;\n\tcurrentMusicStream = alureCreateStreamFromStaticMemory(data, length, CHUNK_LENGTH, 2, musicBufs);\n\talurePlaySourceStream(musicSource, currentMusicStream, 2, 1, MusicEndCallback, data);\n\tLOG(\"Sound\", LOG_MESSAGE, \"Music: %s\", name.c_str());\n\tif (!data)\n\t\tLOG(\"Sound\", LOG_WARNING, \"failed to find music\");\n}\n\nvoid StopMusic()\n{\n\tif (!currentMusicStream)\n\t\treturn;\n\talureStopSource(musicSource, AL_TRUE);\n}\n\nstd::string MusicName()\n{\n\treturn \"\";\n}\n\nfloat MusicVolume()\n{\n\tALfloat rv;\n\talGetSourcefv(musicSource, AL_GAIN, &rv);\n\treturn rv;\n}\n\nvoid SetMusicVolume(float mvol)\n{\n\talSourcef(musicSource, AL_GAIN, mvol);\n}\n\nfloat SoundVolume()\n{\n\treturn 1.0f;\n}\n\nvoid SetSoundVolume(float mvol)\n{\n}\n\n}\n<commit_msg>Fixed positional sound.<commit_after>#include \"Sound.h\"\n#include <alure\/alure.h>\n#include <map>\n#include \"ResourceManager.h\"\n#include <assert.h>\n#include \"Engine\/Logging.h\"\n\nnamespace Sound\n{\n\nconst int CHUNK_LENGTH = 16386;\n\ntypedef std::map<std::string, ALuint> BufferMap;\nBufferMap sounds;\n\nint soundSourceCount;\nALuint* soundSources;\nALuint musicSource;\nALuint musicBufs[2];\nalureStream* currentMusicStream = NULL;\nstd::string currentMusicName = \"\";\nint soundSourceIndex = 0;\n\nvoid DieUnpleasantly()\n{\n\tStopMusic();\n\talureShutdownDevice();\n}\n\nALubyte* GetSoundData(const std::string& path, size_t& length)\n{\n\tSDL_RWops* rwops = ResourceManager::OpenFile(path + \".aiff\");\n\tif (!rwops)\n\t\trwops = ResourceManager::OpenFile(path + \".ogg\");\n\tif (!rwops)\n\t{\n\t\tlength = 0;\n\t\treturn NULL;\n\t}\n\treturn (ALubyte*)ResourceManager::ReadFull(&length, rwops, 1);\n}\n\nstatic ALuint GetSound(const std::string& name)\n{\n\tBufferMap::iterator iter = sounds.find(name);\n\tif (iter != sounds.end())\n\t\treturn iter->second;\n\tsize_t length;\n\tALubyte* data = GetSoundData(\"Sounds\/\" + name, length);\n\tALuint buf = alureCreateBufferFromMemory(data, length);\n\tfree(data);\n\tsounds.insert(std::make_pair(name, buf));\n\treturn buf;\n}\n\nvoid Init(int frequency, int resolution, int sources)\n{\n\t(void)resolution;\n\t--sources; \/\/ one spare source for music\n\tALCint attribs[] = {\n\t\tALC_FREQUENCY, frequency,\n\t\tALC_MONO_SOURCES, sources,\n\t\tALC_STEREO_SOURCES, 1,\n\t\t0\n\t};\n\talureInitDevice(NULL, attribs);\n\tsoundSources = new ALuint[sources];\n\talGenSources(sources, soundSources);\n\talGenSources(1, &musicSource);\n\t\/\/alGenBuffers(2, musicBufs);\n\tsoundSourceCount = sources;\n\tatexit(DieUnpleasantly);\n\talDistanceModel(AL_INVERSE_DISTANCE_CLAMPED);\n\talSpeedOfSound(1400.0);\n\talDopplerFactor(0.7);\n}\n\nstatic ALuint GetFreeSource()\n{\n\tint idx = soundSourceIndex++;\n\tsoundSourceIndex = soundSourceIndex % soundSourceCount;\n\treturn soundSources[idx];\n}\n\nvoid Preload(const std::string& name)\n{\n\tGetSound(name);\n}\n\nvoid PlaySound(const std::string& name, float gain)\n{\n\tALuint buf = GetSound(name);\n\tALuint source = GetFreeSource();\n\talSourcei(source, AL_BUFFER, buf);\n\talSourcei(source, AL_SOURCE_RELATIVE, AL_TRUE);\n\talSourcef(source, AL_GAIN, gain);\n\talSourcePlay(source);\n}\n\nvoid PlaySoundPositional(const std::string& name, vec2 pos, float gain)\n{\n\tALfloat fpos[] = {pos.X(), pos.Y(), 0.0f};\n\tALuint buf = GetSound(name);\n\tALuint source = GetFreeSource();\n\talSourcei(source, AL_BUFFER, buf);\n\talSourcei(source, AL_SOURCE_RELATIVE, AL_FALSE);\n\talSourcefv(source, AL_POSITION, fpos);\n\talSourcef(source, AL_REFERENCE_DISTANCE, 50.0);\n\talSourcef(source, AL_GAIN, gain);\n\talSourcePlay(source);\n}\n\nstatic ALfloat forientation[] = {1.0f, 0.0f, 0.0f, 0.0f, 0.0f, 1.0f};\n\nvoid SetListener(vec2 pos, vec2 vel)\n{\n\tALfloat fpos[] = {pos.X(), pos.Y(), 0.0f};\n\tALfloat fvel[] = {vel.X(), vel.Y(), 0.0f};\n\talListenerfv(AL_POSITION, fpos);\n\talListenerfv(AL_VELOCITY, fvel);\n\tif (vel.ModulusSquared() > 0.2f)\n\t{\n\t\tforientation[0] = fvel[0];\n\t\tforientation[1] = fvel[1];\n\t}\n\talListenerfv(AL_ORIENTATION, forientation);\n}\n\nstatic void MusicEndCallback(void* ud, ALuint source)\n{\n\talureDestroyStream(currentMusicStream, 2, musicBufs);\n\tcurrentMusicStream = NULL;\n\tcurrentMusicName = \"\";\n\tfree(ud);\n}\n\nvoid PlayMusic(const std::string& name)\n{\n\tif (currentMusicStream)\n\t\talureStopSource(musicSource, AL_TRUE);\n\tsize_t length;\n\tALubyte* data = GetSoundData(\"Music\/\" + name, length);\n\tcurrentMusicName = name;\n\tcurrentMusicStream = alureCreateStreamFromStaticMemory(data, length, CHUNK_LENGTH, 2, musicBufs);\n\talurePlaySourceStream(musicSource, currentMusicStream, 2, 1, MusicEndCallback, data);\n\tLOG(\"Sound\", LOG_MESSAGE, \"Music: %s\", name.c_str());\n\tif (!data)\n\t\tLOG(\"Sound\", LOG_WARNING, \"failed to find music\");\n}\n\nvoid StopMusic()\n{\n\tif (!currentMusicStream)\n\t\treturn;\n\talureStopSource(musicSource, AL_TRUE);\n}\n\nstd::string MusicName()\n{\n\treturn \"\";\n}\n\nfloat MusicVolume()\n{\n\tALfloat rv;\n\talGetSourcefv(musicSource, AL_GAIN, &rv);\n\treturn rv;\n}\n\nvoid SetMusicVolume(float mvol)\n{\n\talSourcef(musicSource, AL_GAIN, mvol);\n}\n\nfloat SoundVolume()\n{\n\treturn 1.0f;\n}\n\nvoid SetSoundVolume(float mvol)\n{\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Interrupts: enable interrupt mask<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * ===============================================================\n * Description: Implementation of hyper_stub_base.\n *\n * Created: 2014-02-26 15:28:58\n *\n * Author: Ayush Dubey, dubey@cs.cornell.edu\n *\n * Copyright (C) 2013-2014, Cornell University, see the LICENSE\n * file for licensing agreement\n * ===============================================================\n *\/\n\n#include \"common\/hyper_stub_base.h\"\n\n\/\/ call hyperdex function h using key hndl, attributes cl_attr, and then loop for response\nvoid\nhyper_stub_base :: hyper_call_and_loop(hyper_func h, const char *space,\n uint64_t key, hyperdex_client_attribute *cl_attr, size_t num_attrs)\n{\n hyperdex_client_returncode status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n int64_t hdex_id = (cl.*h)(space, (const char*)key_buf.get(), sizeof(int64_t), cl_attr, num_attrs, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex function failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n return;\n }\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n }\n}\n\n\/\/ call hyperdex map function h using key hndl, attributes cl_attr, and then loop for response\nvoid\nhyper_stub_base :: hypermap_call_and_loop(hyper_map_func h, const char *space,\n uint64_t key, hyperdex_client_map_attribute *map_attr, size_t num_attrs)\n{\n hyperdex_client_returncode status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n int64_t hdex_id = (cl.*h)(space, (const char*)key_buf.get(), sizeof(int64_t), map_attr, num_attrs, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex map function failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n return;\n }\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n }\n}\n\n\/\/ multiple hyperdex calls\nvoid\nhyper_stub_base :: hyper_multiple_call_and_loop(std::vector<hyper_func> &funcs,\n std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<hyperdex_client_attribute*> &attrs,\n std::vector<size_t> &num_attrs)\n{\n std::vector<const char*> map_spaces;\n std::vector<hyper_map_func> map_funcs;\n std::vector<uint64_t> map_keys;\n std::vector<hyperdex_client_map_attribute*> map_attrs;\n std::vector<size_t> map_num_attrs;\n hyper_multiple_call_and_loop(funcs, spaces, keys, attrs, num_attrs,\n map_funcs, map_spaces, map_keys, map_attrs, map_num_attrs);\n}\n\nvoid\nhyper_stub_base :: hyper_multiple_call_and_loop(std::vector<hyper_func> &funcs,\n std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<hyperdex_client_attribute*> &attrs,\n std::vector<size_t> &num_attrs,\n std::vector<hyper_map_func> &map_funcs,\n std::vector<const char*> &map_spaces,\n std::vector<uint64_t> &map_keys,\n std::vector<hyperdex_client_map_attribute*> &map_attrs,\n std::vector<size_t> &map_num_attrs)\n{\n uint64_t num_calls = funcs.size();\n assert(num_calls == spaces.size());\n assert(num_calls == keys.size());\n assert(num_calls == num_attrs.size());\n assert(num_calls == attrs.size());\n\n uint64_t map_num_calls = map_funcs.size();\n assert(map_num_calls == map_spaces.size());\n assert(map_num_calls == map_keys.size());\n assert(map_num_calls == map_num_attrs.size());\n assert(map_num_calls == map_attrs.size());\n\n hyperdex_client_returncode status;\n int hdex_id;\n\n uint64_t i = 0;\n for (; i < num_calls; i++) {\n hdex_id = (cl.*funcs[i])(spaces[i], (const char*)&keys[i], sizeof(int64_t), attrs[i], num_attrs[i], &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex function failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n break;\n }\n }\n for (uint64_t j = 0; j < map_num_calls; j++, i++) {\n hdex_id = (cl.*map_funcs[j])(map_spaces[j], (const char*)&map_keys[j], sizeof(int64_t), map_attrs[j], map_num_attrs[j], &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex map function failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n return;\n }\n }\n for (; i > 0; i--) {\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n }\n }\n}\n\nvoid\nhyper_stub_base :: hyper_get_and_loop(const char *space, uint64_t key,\n const hyperdex_client_attribute **cl_attr, size_t *num_attrs)\n{\n hyperdex_client_returncode status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n int64_t hdex_id = cl.get(space, (const char*)key_buf.get(), sizeof(int64_t), &status, cl_attr, num_attrs);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n return;\n }\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n }\n}\n\nvoid\nhyper_stub_base :: hyper_multiple_get_and_loop(std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<const hyperdex_client_attribute**> &cl_attrs,\n std::vector<size_t*> &num_attrs)\n{\n uint64_t num_calls = spaces.size();\n assert(num_calls == keys.size());\n assert(num_calls == num_attrs.size());\n assert(num_calls == cl_attrs.size());\n\n hyperdex_client_returncode status;\n int64_t hdex_id;\n \n uint64_t i = 0;\n for (; i < num_calls; i++) {\n hdex_id = cl.get(spaces[i], (const char*)&keys[i], sizeof(int64_t), &status, cl_attrs[i], num_attrs[i]);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n break;\n }\n }\n for (; i > 0; i--) {\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n continue;\n }\n }\n}\n\n\/\/ delete the given key\nvoid\nhyper_stub_base :: hyper_del_and_loop(const char *space, uint64_t key)\n{\n hyperdex_client_returncode status;\n int64_t hdex_id = cl.del(space, (const char*)&key, sizeof(int64_t), &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n return;\n }\n hdex_id = cl.loop(-1, &status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << status << std::endl;\n }\n}\n\n\/\/ store the given unordered_map<int, int> as a HYPERDATATYPE_MAP_INT64_INT64\nvoid\nhyper_stub_base :: prepare_buffer(const std::unordered_map<uint64_t, uint64_t> &map, std::unique_ptr<char> &ret_buf, uint64_t &buf_sz)\n{\n buf_sz = map.size() * (sizeof(int64_t) + sizeof(int64_t));\n char *buf = (char*)malloc(buf_sz);\n ret_buf.reset(buf);\n \n for (auto &p: map) {\n buf = e::pack64le(p.first, buf);\n buf = e::pack64le(p.second, buf);\n }\n}\n\n\/\/ unpack the HYPERDATATYPE_MAP_INT64_INT64 in to an unordered_map<int, int>\nvoid\nhyper_stub_base :: unpack_buffer(const char *buf, uint64_t buf_sz, std::unordered_map<uint64_t, uint64_t> &map)\n{\n uint64_t num_entries = buf_sz \/ (sizeof(int64_t) + sizeof(int64_t));\n map.reserve(num_entries);\n uint64_t key, val;\n\n for (uint64_t i = 0; i < num_entries; i++) {\n buf = e::unpack64le(buf, &key);\n buf = e::unpack64le(buf, &val);\n map.emplace(key, val);\n }\n}\n\n\/\/ store the given unordered_set as a HYPERDATATYPE_SET_INT64\nvoid\nhyper_stub_base :: prepare_buffer(const std::unordered_set<uint64_t> &set, std::unique_ptr<char> &ret_buf, uint64_t &buf_sz)\n{\n buf_sz = sizeof(uint64_t) * set.size();\n std::set<uint64_t> sorted;\n for (uint64_t x: set) {\n sorted.emplace(x);\n }\n\n char *buf = (char*)malloc(buf_sz);\n ret_buf.reset(buf);\n \/\/ now iterate in sorted order\n for (uint64_t x: sorted) {\n buf = e::pack64le(x, buf);\n }\n}\n\n\/\/ unpack the HYPERDATATYPE_SET_INT64 in to an unordered_set\nvoid\nhyper_stub_base :: unpack_buffer(const char *buf, uint64_t buf_sz, std::unordered_set<uint64_t> &set)\n{\n uint64_t set_sz = buf_sz \/ sizeof(uint64_t);\n uint64_t next;\n set.reserve(set_sz);\n\n for (uint64_t i = 0; i < set_sz; i++) {\n buf = e::unpack64le(buf, &next);\n set.emplace(next);\n }\n}\n<commit_msg>returncode bug fix in hyper_stub<commit_after>\/*\n * ===============================================================\n * Description: Implementation of hyper_stub_base.\n *\n * Created: 2014-02-26 15:28:58\n *\n * Author: Ayush Dubey, dubey@cs.cornell.edu\n *\n * Copyright (C) 2013-2014, Cornell University, see the LICENSE\n * file for licensing agreement\n * ===============================================================\n *\/\n\n#include \"common\/hyper_stub_base.h\"\n\n\/\/ call hyperdex function h using key hndl, attributes cl_attr, and then loop for response\nvoid\nhyper_stub_base :: hyper_call_and_loop(hyper_func h, const char *space,\n uint64_t key, hyperdex_client_attribute *cl_attr, size_t num_attrs)\n{\n hyperdex_client_returncode call_status, loop_status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n\n int64_t hdex_id = (cl.*h)(space, (const char*)key_buf.get(), sizeof(int64_t), cl_attr, num_attrs, &call_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex function failed, op id = \" << hdex_id << \", status = \" << call_status << std::endl;\n return;\n }\n\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || call_status != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error\"\n << \", call status: \" << call_status\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n}\n\n\/\/ call hyperdex map function h using key hndl, attributes cl_attr, and then loop for response\nvoid\nhyper_stub_base :: hypermap_call_and_loop(hyper_map_func h, const char *space,\n uint64_t key, hyperdex_client_map_attribute *map_attr, size_t num_attrs)\n{\n hyperdex_client_returncode call_status, loop_status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n\n int64_t hdex_id = (cl.*h)(space, (const char*)key_buf.get(), sizeof(int64_t), map_attr, num_attrs, &call_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex map function failed, op id = \" << hdex_id << \", status = \" << call_status << std::endl;\n return;\n }\n\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || call_status != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error\"\n << \", call status: \" << call_status\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n}\n\n\/\/ multiple hyperdex calls\nvoid\nhyper_stub_base :: hyper_multiple_call_and_loop(std::vector<hyper_func> &funcs,\n std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<hyperdex_client_attribute*> &attrs,\n std::vector<size_t> &num_attrs)\n{\n std::vector<const char*> map_spaces;\n std::vector<hyper_map_func> map_funcs;\n std::vector<uint64_t> map_keys;\n std::vector<hyperdex_client_map_attribute*> map_attrs;\n std::vector<size_t> map_num_attrs;\n hyper_multiple_call_and_loop(funcs, spaces, keys, attrs, num_attrs,\n map_funcs, map_spaces, map_keys, map_attrs, map_num_attrs);\n}\n\nvoid\nhyper_stub_base :: hyper_multiple_call_and_loop(std::vector<hyper_func> &funcs,\n std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<hyperdex_client_attribute*> &attrs,\n std::vector<size_t> &num_attrs,\n std::vector<hyper_map_func> &map_funcs,\n std::vector<const char*> &map_spaces,\n std::vector<uint64_t> &map_keys,\n std::vector<hyperdex_client_map_attribute*> &map_attrs,\n std::vector<size_t> &map_num_attrs)\n{\n uint64_t num_calls = funcs.size();\n assert(num_calls == spaces.size());\n assert(num_calls == keys.size());\n assert(num_calls == num_attrs.size());\n assert(num_calls == attrs.size());\n\n uint64_t map_num_calls = map_funcs.size();\n assert(map_num_calls == map_spaces.size());\n assert(map_num_calls == map_keys.size());\n assert(map_num_calls == map_num_attrs.size());\n assert(map_num_calls == map_attrs.size());\n\n hyperdex_client_returncode call_status[num_calls+map_num_calls];\n int hdex_id;\n\n uint64_t i = 0;\n for (; i < num_calls; i++) {\n hdex_id = (cl.*funcs[i])(spaces[i], (const char*)&keys[i], sizeof(int64_t), attrs[i], num_attrs[i], call_status+i);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex function failed, op id = \" << hdex_id << \", status = \" << call_status[i] << std::endl;\n break;\n }\n }\n\n for (uint64_t j = 0; j < map_num_calls; j++, i++) {\n hdex_id = (cl.*map_funcs[j])(map_spaces[j], (const char*)&map_keys[j], sizeof(int64_t), map_attrs[j], map_num_attrs[j], call_status+i);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex map function failed, op id = \" << hdex_id << \", status = \" << call_status[i] << std::endl;\n return;\n }\n }\n\n hyperdex_client_returncode loop_status;\n for (; i > 0; i--) {\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || call_status[i] != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error at call \" << i\n << \", call status: \" << call_status\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n }\n}\n\nvoid\nhyper_stub_base :: hyper_get_and_loop(const char *space, uint64_t key,\n const hyperdex_client_attribute **cl_attr, size_t *num_attrs)\n{\n hyperdex_client_returncode get_status, loop_status;\n std::unique_ptr<int64_t> key_buf(new int64_t(key));\n\n int64_t hdex_id = cl.get(space, (const char*)key_buf.get(), sizeof(int64_t), &get_status, cl_attr, num_attrs);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << get_status << std::endl;\n return;\n }\n\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || get_status != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error\"\n << \", call status: \" << get_status\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n}\n\nvoid\nhyper_stub_base :: hyper_multiple_get_and_loop(std::vector<const char*> &spaces,\n std::vector<uint64_t> &keys,\n std::vector<const hyperdex_client_attribute**> &cl_attrs,\n std::vector<size_t*> &num_attrs)\n{\n uint64_t num_calls = spaces.size();\n assert(num_calls == keys.size());\n assert(num_calls == num_attrs.size());\n assert(num_calls == cl_attrs.size());\n\n hyperdex_client_returncode get_status[num_calls];\n int64_t hdex_id;\n \n uint64_t i = 0;\n for (; i < num_calls; i++) {\n hdex_id = cl.get(spaces[i], (const char*)&keys[i], sizeof(int64_t), get_status+i, cl_attrs[i], num_attrs[i]);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << get_status[i] << std::endl;\n break;\n }\n }\n\n hyperdex_client_returncode loop_status;\n for (; i > 0; i--) {\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n continue;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || get_status[i] != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error\"\n << \", call status: \" << get_status[i]\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n }\n}\n\n\/\/ delete the given key\nvoid\nhyper_stub_base :: hyper_del_and_loop(const char *space, uint64_t key)\n{\n hyperdex_client_returncode del_status, loop_status;\n int64_t hdex_id = cl.del(space, (const char*)&key, sizeof(int64_t), &del_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex get failed, op id = \" << hdex_id << \", status = \" << del_status << std::endl;\n return;\n }\n\n hdex_id = cl.loop(-1, &loop_status);\n if (hdex_id < 0) {\n WDEBUG << \"Hyperdex loop failed, op id = \" << hdex_id << \", status = \" << loop_status << std::endl;\n }\n\n if (loop_status != HYPERDEX_CLIENT_SUCCESS || del_status != HYPERDEX_CLIENT_SUCCESS) {\n WDEBUG << \"hyperdex error\"\n << \", call status: \" << del_status\n << \", loop status: \" << loop_status << std::endl;\n WDEBUG << \"error message: \" << cl.error_message() << std::endl;\n WDEBUG << \"error loc: \" << cl.error_location() << std::endl;\n }\n}\n\n\/\/ store the given unordered_map<int, int> as a HYPERDATATYPE_MAP_INT64_INT64\nvoid\nhyper_stub_base :: prepare_buffer(const std::unordered_map<uint64_t, uint64_t> &map, std::unique_ptr<char> &ret_buf, uint64_t &buf_sz)\n{\n buf_sz = map.size() * (sizeof(int64_t) + sizeof(int64_t));\n char *buf = (char*)malloc(buf_sz);\n ret_buf.reset(buf);\n \n for (auto &p: map) {\n buf = e::pack64le(p.first, buf);\n buf = e::pack64le(p.second, buf);\n }\n}\n\n\/\/ unpack the HYPERDATATYPE_MAP_INT64_INT64 in to an unordered_map<int, int>\nvoid\nhyper_stub_base :: unpack_buffer(const char *buf, uint64_t buf_sz, std::unordered_map<uint64_t, uint64_t> &map)\n{\n uint64_t num_entries = buf_sz \/ (sizeof(int64_t) + sizeof(int64_t));\n map.reserve(num_entries);\n uint64_t key, val;\n\n for (uint64_t i = 0; i < num_entries; i++) {\n buf = e::unpack64le(buf, &key);\n buf = e::unpack64le(buf, &val);\n map.emplace(key, val);\n }\n}\n\n\/\/ store the given unordered_set as a HYPERDATATYPE_SET_INT64\nvoid\nhyper_stub_base :: prepare_buffer(const std::unordered_set<uint64_t> &set, std::unique_ptr<char> &ret_buf, uint64_t &buf_sz)\n{\n buf_sz = sizeof(uint64_t) * set.size();\n std::set<uint64_t> sorted;\n for (uint64_t x: set) {\n sorted.emplace(x);\n }\n\n char *buf = (char*)malloc(buf_sz);\n ret_buf.reset(buf);\n \/\/ now iterate in sorted order\n for (uint64_t x: sorted) {\n buf = e::pack64le(x, buf);\n }\n}\n\n\/\/ unpack the HYPERDATATYPE_SET_INT64 in to an unordered_set\nvoid\nhyper_stub_base :: unpack_buffer(const char *buf, uint64_t buf_sz, std::unordered_set<uint64_t> &set)\n{\n uint64_t set_sz = buf_sz \/ sizeof(uint64_t);\n uint64_t next;\n set.reserve(set_sz);\n\n for (uint64_t i = 0; i < set_sz; i++) {\n buf = e::unpack64le(buf, &next);\n set.emplace(next);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 Hottinger Baldwin Messtechnik\n\/\/ Distributed under MIT license\n\/\/ See file LICENSE provided\n\n#include <cstring>\n#include <stdint.h>\n#include <sys\/ioctl.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <net\/if.h>\n#include <net\/if_arp.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <netdb.h>\n\n#include <unistd.h>\n\n#include <errno.h>\n#include <syslog.h>\n#include <poll.h>\n\n#include \"hbm\/communication\/socketnonblocking.h\"\n\n\n\/\/\/ Maximum time to wait for connecting\nconst time_t TIMEOUT_CONNECT_S = 5;\n\n\nhbm::communication::SocketNonblocking::SocketNonblocking(sys::EventLoop &eventLoop)\n\t: m_fd(-1)\n\t, m_bufferedReader()\n\t, m_eventLoop(eventLoop)\n\t, m_dataHandler()\n{\n}\n\nhbm::communication::SocketNonblocking::SocketNonblocking(int fd, sys::EventLoop &eventLoop, DataCb_t dataHandler)\n\t: m_fd(fd)\n\t, m_bufferedReader()\n\t, m_eventLoop(eventLoop)\n\t, m_dataHandler(dataHandler)\n{\n\tif (setSocketOptions()<0) {\n\t\tthrow std::runtime_error(\"error setting socket options\");\n\t}\n\n\tm_eventLoop.addEvent(m_fd, std::bind(&SocketNonblocking::process, this));\n}\n\nhbm::communication::SocketNonblocking::~SocketNonblocking()\n{\n\tdisconnect();\n}\n\nint hbm::communication::SocketNonblocking::setSocketOptions()\n{\n\tint opt = 1;\n\n\t\/\/ turn off Nagle algorithm\n\tif (setsockopt(m_fd, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error turning off nagle algorithm\");\n\t\treturn -1;\n\t}\n\n\topt = 12;\n\t\/\/ the interval between the last data packet sent (simple ACKs are not considered data) and the first keepalive probe;\n\t\/\/ after the connection is marked to need keepalive, this counter is not used any further\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPIDLE, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPIDLE\");\n\t\treturn -1;\n}\n\n\n\topt = 3;\n\t\/\/ the interval between subsequential keepalive probes, regardless of what the connection has exchanged in the meantime\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPINTVL, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPINTVL\");\n\t\treturn -1;\n\t}\n\n\n\topt = 2;\n\t\/\/ the number of unacknowledged probes to send before considering the connection dead and notifying the application layer\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPCNT, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPCNT\");\n\t\treturn -1;\n\t}\n\n\n\topt = 1;\n\tif (setsockopt(m_fd, SOL_SOCKET, SO_KEEPALIVE, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option SO_KEEPALIVE\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nint hbm::communication::SocketNonblocking::connect(const std::string &address, const std::string& port, DataCb_t dataHandler)\n{\n\tstruct addrinfo hints;\n\tstruct addrinfo* pResult = NULL;\n\n\tmemset(&hints, 0, sizeof(hints));\n\n\thints.ai_family = AF_UNSPEC;\n\thints.ai_socktype = SOCK_STREAM;\n\thints.ai_protocol = 6; \/\/ Ip V6!\n\n\tif( getaddrinfo(address.c_str(), port.c_str(), &hints, &pResult)!=0 ) {\n\t\treturn -1;\n\t}\n\tint retVal = connect(pResult->ai_family, pResult->ai_addr, pResult->ai_addrlen, dataHandler);\n\n\tfreeaddrinfo( pResult );\n\n\treturn retVal;\n}\n\nint hbm::communication::SocketNonblocking::connect(int domain, const struct sockaddr* pSockAddr, socklen_t len, DataCb_t dataHandler)\n{\n\tm_fd = ::socket(domain, SOCK_STREAM | SOCK_NONBLOCK, 0);\n\tif (m_fd==-1) {\n\t\treturn -1;\n\t}\n\n\tif (setSocketOptions()<0) {\n\t\treturn -1;\n\t}\n\n\tint err = ::connect(m_fd, pSockAddr, len);\n\tif (err==0) {\n\t\treturn 0;\n\t}\n\n\t\/\/ success if errno equals EINPROGRESS\n\tif(errno != EINPROGRESS) {\n\t\tsyslog(LOG_ERR, \"failed to connect errno=%d '%s'\", errno, strerror(errno));\n\t\treturn -1;\n\t}\n\tstruct pollfd pfd;\n\tpfd.fd = m_fd;\n\tpfd.events = POLLOUT;\n\tdo {\n\t\terr = poll(&pfd, 1, TIMEOUT_CONNECT_S*1000);\n\t} while((err==-1) && (errno==EINTR) );\n\tif(err!=1) {\n\t\treturn -1;\n\t}\n\n\tint value;\n\tlen = sizeof(value);\n\tgetsockopt(m_fd, SOL_SOCKET, SO_ERROR, &value, &len);\n\tif(value!=0) {\n\t\treturn -1;\n\t}\n\n\tm_dataHandler = dataHandler;\n\tm_eventLoop.addEvent(m_fd, std::bind(&SocketNonblocking::process, this));\n\n\treturn 0;\n}\n\nint hbm::communication::SocketNonblocking::process()\n{\n\tif (m_dataHandler) {\n\t\treturn m_dataHandler(this);\n\t} else {\n\t\treturn -1;\n\t}\n}\n\nssize_t hbm::communication::SocketNonblocking::receive(void* pBlock, size_t size)\n{\n\treturn m_bufferedReader.recv(m_fd, pBlock, size, 0);\n}\n\nssize_t hbm::communication::SocketNonblocking::receiveComplete(void* pBlock, size_t size, int msTimeout)\n{\n\tssize_t retVal;\n\tunsigned char* pPos = reinterpret_cast < unsigned char* > (pBlock);\n\tsize_t sizeLeft = size;\n\twhile(sizeLeft) {\n\t\tretVal = m_bufferedReader.recv(m_fd, pPos, sizeLeft, 0);\n\t\tif(retVal>0) {\n\t\t\tsizeLeft -= retVal;\n\t\t\tpPos += retVal;\n\t\t} else if(retVal==0) {\n\t\t\treturn size-sizeLeft;\n\t\t} else {\n\t\t\tif(errno==EWOULDBLOCK || errno==EAGAIN) {\n\t\t\t\t\/\/ wait for socket to become readable.\n\t\t\t\tstruct pollfd pfd;\n\t\t\t\tpfd.fd = m_fd;\n\t\t\t\tpfd.events = POLLIN;\n\t\t\t\tint nfds;\n\t\t\t\tdo {\n\t\t\t\t\tnfds = poll(&pfd, 1, msTimeout);\n\t\t\t\t} while((nfds==-1) && (errno==EINTR));\n\t\t\t\tif(nfds!=1) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsyslog(LOG_ERR, \"%s: recv failed '%s'\", __FUNCTION__, strerror(errno));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn size;\n}\n\n\nssize_t hbm::communication::SocketNonblocking::sendBlock(const void* pBlock, size_t size, bool more)\n{\n\tconst uint8_t* pDat = reinterpret_cast<const uint8_t*>(pBlock);\n\tsize_t BytesLeft = size;\n\tssize_t numBytes;\n\tssize_t retVal = size;\n\n\tstruct pollfd pfd;\n\tpfd.fd = m_fd;\n\tpfd.events = POLLOUT;\n\n\tint flags = 0;\n\tif(more) {\n\t\tflags |= MSG_MORE;\n\t}\n\tint err;\n\n\twhile (BytesLeft > 0) {\n\t\tnumBytes = send(m_fd, pDat, BytesLeft, flags);\n\t\tif(numBytes>0) {\n\t\t\tpDat += numBytes;\n\t\t\tBytesLeft -= numBytes;\n\t\t} else if(numBytes==0) {\n\t\t\t\/\/ connection lost...\n\t\t\tBytesLeft = 0;\n\t\t\tretVal = -1;\n\t\t} else {\n\t\t\t\/\/ <0\n\t\t\tif(errno==EWOULDBLOCK || errno==EAGAIN) {\n\t\t\t\t\/\/ wait for socket to become writable.\n\t\t\t\tdo {\n\t\t\t\t\terr = poll(&pfd, 1, -1);\n\t\t\t\t} while((err==-1) && (errno==EINTR));\n\t\t\t\tif(err!=1) {\n\t\t\t\t\tBytesLeft = 0;\n\t\t\t\t\tretVal = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/\/ a real error happened!\n\t\t\t\tBytesLeft = 0;\n\t\t\t\tretVal = -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn retVal;\n}\n\n\nbool hbm::communication::SocketNonblocking::checkSockAddr(const struct ::sockaddr* pCheckSockAddr, socklen_t checkSockAddrLen) const\n{\n\tstruct sockaddr sockAddr;\n\tsocklen_t addrLen = sizeof(sockaddr_in);\n\n\tchar checkHost[256] = \"\";\n\tchar ckeckService[8] = \"\";\n\n\tchar host[256] = \"\";\n\tchar service[8] = \"\";\n\tint err = getnameinfo(pCheckSockAddr, checkSockAddrLen, checkHost, sizeof(checkHost), ckeckService, sizeof(ckeckService), NI_NUMERICHOST | NI_NUMERICSERV);\n\tif (err != 0) {\n\t\tsyslog(LOG_ERR, \"%s: error from getnameinfo\", __FUNCTION__);\n\t\treturn false;\n\t}\n\n\tif (getpeername(m_fd, &sockAddr, &addrLen)!=0) {\n\t\treturn false;\n\t}\n\n\tif (getnameinfo(&sockAddr, addrLen, host, sizeof(host), service, sizeof(service), NI_NUMERICHOST | NI_NUMERICSERV)!=0) {\n\t\treturn false;\n\t}\n\n\tif(\n\t\t (strcmp(host, checkHost)==0) &&\n\t\t (strcmp(service, ckeckService)==0)\n\t\t )\n\t{\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid hbm::communication::SocketNonblocking::disconnect()\n{\n\tm_eventLoop.eraseEvent(m_fd);\n\tshutdown(m_fd, SHUT_RDWR);\n\t::close(m_fd);\n\tm_fd = -1;\n}\n\nbool hbm::communication::SocketNonblocking::isFirewire() const\n{\n\tbool retVal = false;\n\n\tstruct ifreq ifr;\n\tmemset(&ifr, 0, sizeof(struct ifreq));\n\n\tif ((::ioctl(m_fd, SIOCGIFHWADDR, (caddr_t)&ifr, sizeof(struct ifreq))) >= 0) {\n\t\tif (ifr.ifr_hwaddr.sa_family == ARPHRD_IEEE1394) {\n\t\t\tretVal = true;\n\t\t}\n\t}\n\treturn retVal;\n}\n<commit_msg>fix: add event in all cases of success<commit_after>\/\/ Copyright 2014 Hottinger Baldwin Messtechnik\n\/\/ Distributed under MIT license\n\/\/ See file LICENSE provided\n\n#include <cstring>\n#include <stdint.h>\n#include <sys\/ioctl.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <arpa\/inet.h>\n#include <net\/if.h>\n#include <net\/if_arp.h>\n#include <netinet\/in.h>\n#include <netinet\/tcp.h>\n#include <netdb.h>\n\n#include <unistd.h>\n\n#include <errno.h>\n#include <syslog.h>\n#include <poll.h>\n\n#include \"hbm\/communication\/socketnonblocking.h\"\n\n\n\/\/\/ Maximum time to wait for connecting\nconst time_t TIMEOUT_CONNECT_S = 5;\n\n\nhbm::communication::SocketNonblocking::SocketNonblocking(sys::EventLoop &eventLoop)\n\t: m_fd(-1)\n\t, m_bufferedReader()\n\t, m_eventLoop(eventLoop)\n\t, m_dataHandler()\n{\n}\n\nhbm::communication::SocketNonblocking::SocketNonblocking(int fd, sys::EventLoop &eventLoop, DataCb_t dataHandler)\n\t: m_fd(fd)\n\t, m_bufferedReader()\n\t, m_eventLoop(eventLoop)\n\t, m_dataHandler(dataHandler)\n{\n\tif (setSocketOptions()<0) {\n\t\tthrow std::runtime_error(\"error setting socket options\");\n\t}\n\n\tm_eventLoop.addEvent(m_fd, std::bind(&SocketNonblocking::process, this));\n}\n\nhbm::communication::SocketNonblocking::~SocketNonblocking()\n{\n\tdisconnect();\n}\n\nint hbm::communication::SocketNonblocking::setSocketOptions()\n{\n\tint opt = 1;\n\n\t\/\/ turn off Nagle algorithm\n\tif (setsockopt(m_fd, IPPROTO_TCP, TCP_NODELAY, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error turning off nagle algorithm\");\n\t\treturn -1;\n\t}\n\n\topt = 12;\n\t\/\/ the interval between the last data packet sent (simple ACKs are not considered data) and the first keepalive probe;\n\t\/\/ after the connection is marked to need keepalive, this counter is not used any further\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPIDLE, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPIDLE\");\n\t\treturn -1;\n}\n\n\n\topt = 3;\n\t\/\/ the interval between subsequential keepalive probes, regardless of what the connection has exchanged in the meantime\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPINTVL, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPINTVL\");\n\t\treturn -1;\n\t}\n\n\n\topt = 2;\n\t\/\/ the number of unacknowledged probes to send before considering the connection dead and notifying the application layer\n\tif (setsockopt(m_fd, SOL_TCP, TCP_KEEPCNT, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option TCP_KEEPCNT\");\n\t\treturn -1;\n\t}\n\n\n\topt = 1;\n\tif (setsockopt(m_fd, SOL_SOCKET, SO_KEEPALIVE, reinterpret_cast<char*>(&opt), sizeof(opt))==-1) {\n\t\tsyslog(LOG_ERR, \"error setting socket option SO_KEEPALIVE\");\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n\nint hbm::communication::SocketNonblocking::connect(const std::string &address, const std::string& port, DataCb_t dataHandler)\n{\n\tstruct addrinfo hints;\n\tstruct addrinfo* pResult = NULL;\n\n\tmemset(&hints, 0, sizeof(hints));\n\n\thints.ai_family = AF_UNSPEC;\n\thints.ai_socktype = SOCK_STREAM;\n\thints.ai_protocol = 6; \/\/ Ip V6!\n\n\tif( getaddrinfo(address.c_str(), port.c_str(), &hints, &pResult)!=0 ) {\n\t\treturn -1;\n\t}\n\tint retVal = connect(pResult->ai_family, pResult->ai_addr, pResult->ai_addrlen, dataHandler);\n\n\tfreeaddrinfo( pResult );\n\n\treturn retVal;\n}\n\nint hbm::communication::SocketNonblocking::connect(int domain, const struct sockaddr* pSockAddr, socklen_t len, DataCb_t dataHandler)\n{\n\tm_fd = ::socket(domain, SOCK_STREAM | SOCK_NONBLOCK, 0);\n\tif (m_fd==-1) {\n\t\treturn -1;\n\t}\n\n\tif (setSocketOptions()<0) {\n\t\treturn -1;\n\t}\n\n\tint err = ::connect(m_fd, pSockAddr, len);\n\tif (err==-1) {\n\t\t\/\/ success if errno equals EINPROGRESS\n\t\tif(errno != EINPROGRESS) {\n\t\t\tsyslog(LOG_ERR, \"failed to connect errno=%d '%s'\", errno, strerror(errno));\n\t\t\treturn -1;\n\t\t}\n\t\tstruct pollfd pfd;\n\t\tpfd.fd = m_fd;\n\t\tpfd.events = POLLOUT;\n\t\tdo {\n\t\t\terr = poll(&pfd, 1, TIMEOUT_CONNECT_S*1000);\n\t\t} while((err==-1) && (errno==EINTR) );\n\t\tif(err!=1) {\n\t\t\treturn -1;\n\t\t}\n\n\t\tint value;\n\t\tlen = sizeof(value);\n\t\tgetsockopt(m_fd, SOL_SOCKET, SO_ERROR, &value, &len);\n\t\tif(value!=0) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\tm_dataHandler = dataHandler;\n\tm_eventLoop.addEvent(m_fd, std::bind(&SocketNonblocking::process, this));\n\n\treturn 0;\n}\n\nint hbm::communication::SocketNonblocking::process()\n{\n\tif (m_dataHandler) {\n\t\treturn m_dataHandler(this);\n\t} else {\n\t\treturn -1;\n\t}\n}\n\nssize_t hbm::communication::SocketNonblocking::receive(void* pBlock, size_t size)\n{\n\treturn m_bufferedReader.recv(m_fd, pBlock, size, 0);\n}\n\nssize_t hbm::communication::SocketNonblocking::receiveComplete(void* pBlock, size_t size, int msTimeout)\n{\n\tssize_t retVal;\n\tunsigned char* pPos = reinterpret_cast < unsigned char* > (pBlock);\n\tsize_t sizeLeft = size;\n\twhile(sizeLeft) {\n\t\tretVal = m_bufferedReader.recv(m_fd, pPos, sizeLeft, 0);\n\t\tif(retVal>0) {\n\t\t\tsizeLeft -= retVal;\n\t\t\tpPos += retVal;\n\t\t} else if(retVal==0) {\n\t\t\treturn size-sizeLeft;\n\t\t} else {\n\t\t\tif(errno==EWOULDBLOCK || errno==EAGAIN) {\n\t\t\t\t\/\/ wait for socket to become readable.\n\t\t\t\tstruct pollfd pfd;\n\t\t\t\tpfd.fd = m_fd;\n\t\t\t\tpfd.events = POLLIN;\n\t\t\t\tint nfds;\n\t\t\t\tdo {\n\t\t\t\t\tnfds = poll(&pfd, 1, msTimeout);\n\t\t\t\t} while((nfds==-1) && (errno==EINTR));\n\t\t\t\tif(nfds!=1) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tsyslog(LOG_ERR, \"%s: recv failed '%s'\", __FUNCTION__, strerror(errno));\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn size;\n}\n\n\nssize_t hbm::communication::SocketNonblocking::sendBlock(const void* pBlock, size_t size, bool more)\n{\n\tconst uint8_t* pDat = reinterpret_cast<const uint8_t*>(pBlock);\n\tsize_t BytesLeft = size;\n\tssize_t numBytes;\n\tssize_t retVal = size;\n\n\tstruct pollfd pfd;\n\tpfd.fd = m_fd;\n\tpfd.events = POLLOUT;\n\n\tint flags = 0;\n\tif(more) {\n\t\tflags |= MSG_MORE;\n\t}\n\tint err;\n\n\twhile (BytesLeft > 0) {\n\t\tnumBytes = send(m_fd, pDat, BytesLeft, flags);\n\t\tif(numBytes>0) {\n\t\t\tpDat += numBytes;\n\t\t\tBytesLeft -= numBytes;\n\t\t} else if(numBytes==0) {\n\t\t\t\/\/ connection lost...\n\t\t\tBytesLeft = 0;\n\t\t\tretVal = -1;\n\t\t} else {\n\t\t\t\/\/ <0\n\t\t\tif(errno==EWOULDBLOCK || errno==EAGAIN) {\n\t\t\t\t\/\/ wait for socket to become writable.\n\t\t\t\tdo {\n\t\t\t\t\terr = poll(&pfd, 1, -1);\n\t\t\t\t} while((err==-1) && (errno==EINTR));\n\t\t\t\tif(err!=1) {\n\t\t\t\t\tBytesLeft = 0;\n\t\t\t\t\tretVal = -1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t\/\/ a real error happened!\n\t\t\t\tBytesLeft = 0;\n\t\t\t\tretVal = -1;\n\t\t\t}\n\t\t}\n\t}\n\treturn retVal;\n}\n\n\nbool hbm::communication::SocketNonblocking::checkSockAddr(const struct ::sockaddr* pCheckSockAddr, socklen_t checkSockAddrLen) const\n{\n\tstruct sockaddr sockAddr;\n\tsocklen_t addrLen = sizeof(sockaddr_in);\n\n\tchar checkHost[256] = \"\";\n\tchar ckeckService[8] = \"\";\n\n\tchar host[256] = \"\";\n\tchar service[8] = \"\";\n\tint err = getnameinfo(pCheckSockAddr, checkSockAddrLen, checkHost, sizeof(checkHost), ckeckService, sizeof(ckeckService), NI_NUMERICHOST | NI_NUMERICSERV);\n\tif (err != 0) {\n\t\tsyslog(LOG_ERR, \"%s: error from getnameinfo\", __FUNCTION__);\n\t\treturn false;\n\t}\n\n\tif (getpeername(m_fd, &sockAddr, &addrLen)!=0) {\n\t\treturn false;\n\t}\n\n\tif (getnameinfo(&sockAddr, addrLen, host, sizeof(host), service, sizeof(service), NI_NUMERICHOST | NI_NUMERICSERV)!=0) {\n\t\treturn false;\n\t}\n\n\tif(\n\t\t (strcmp(host, checkHost)==0) &&\n\t\t (strcmp(service, ckeckService)==0)\n\t\t )\n\t{\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid hbm::communication::SocketNonblocking::disconnect()\n{\n\tm_eventLoop.eraseEvent(m_fd);\n\tshutdown(m_fd, SHUT_RDWR);\n\t::close(m_fd);\n\tm_fd = -1;\n}\n\nbool hbm::communication::SocketNonblocking::isFirewire() const\n{\n\tbool retVal = false;\n\n\tstruct ifreq ifr;\n\tmemset(&ifr, 0, sizeof(struct ifreq));\n\n\tif ((::ioctl(m_fd, SIOCGIFHWADDR, (caddr_t)&ifr, sizeof(struct ifreq))) >= 0) {\n\t\tif (ifr.ifr_hwaddr.sa_family == ARPHRD_IEEE1394) {\n\t\t\tretVal = true;\n\t\t}\n\t}\n\treturn retVal;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n* ALMA - Atacama Large Millimiter Array\n* (c) European Southern Observatory, 2002\n* Copyright by ESO (in the framework of the ALMA collaboration),\n* All rights reserved\n*\n* This library is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\n* \"@(#) $Id: baciCORBA.cpp,v 1.96 2005\/08\/23 15:35:26 vwang Exp $\"\n*\n* who when what\n* -------- -------- ----------------------------------------------\n* gchiozzi 2001-12-20 Added getPOAManager() and getPOARoot() methods.\n* msekoran 2001\/02\/17 created \n* msekoran 2001\/05\/21 fixed destroy bug\n* msekoran 2001\/08\/26 added InitCORBA, DoneCORBA for BACI modular tests\n*\/\n\n#include <vltPort.h>\n#include \"logging.h\"\n#include \"baciCORBA.h\"\n\nBACI_CORBA * BACI_CORBA::instance_mp = 0; \n\nBACI_CORBA::BACI_CORBA(CORBA::ORB_ptr orb_m,\n\t\t PortableServer::POAManager_ptr poaManager_m,\n\t\t PortableServer::POA_ptr poaRoot_m,\n\t\t PortableServer::POA_ptr poaPersistent_m,\n\t\t PortableServer::POA_ptr poaTransient_m)\n{\n this->orb_m = CORBA::ORB::_duplicate(orb_m);\n this->poaManager_m = PortableServer::POAManager::_duplicate(poaManager_m);\n this->poaRoot_m = PortableServer::POA::_duplicate(poaRoot_m);\n this->poaPersistent_m = PortableServer::POA::_duplicate(poaPersistent_m);\n this->poaTransient_m = PortableServer::POA::_duplicate(poaTransient_m);\n}\n\nBACI_CORBA::~BACI_CORBA()\n{\n}\n\n\nBACI_CORBA *\nBACI_CORBA::getInstance()\n{\n return instance_mp;\n}\n\nBACI_CORBA * \nBACI_CORBA::createInstance(CORBA::ORB_ptr orb_m,\n\t\t\t PortableServer::POAManager_ptr poaManager_m,\n\t\t\t PortableServer::POA_ptr poaRoot_m,\n\t\t\t PortableServer::POA_ptr poaPersistent_m,\n\t\t\t PortableServer::POA_ptr poaTransient_m)\n{\n if (instance_mp==0)\n {\n instance_mp = new BACI_CORBA(orb_m, poaManager_m, poaRoot_m, poaPersistent_m, poaTransient_m);\n }\n return instance_mp;\n}\n\nvoid\nBACI_CORBA::destroyInstance()\n{\n if (instance_mp!=0)\n {\n delete instance_mp;\n instance_mp = 0;\n }\n}\n\nCORBA::ORB_ptr\nBACI_CORBA::getORB()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->orb_m.ptr();\n\t}\n else\n\t{\n\treturn CORBA::ORB::_nil();\n\t}\n}\n \nPortableServer::POAManager_ptr\nBACI_CORBA::getPOAManager()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaManager_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POAManager::_nil();\n\t}\n}\n\nPortableServer::POA_ptr\nBACI_CORBA::getPOARoot()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaRoot_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POA::_nil();\n\t}\n}\n\nPortableServer::POA_ptr\nBACI_CORBA::getPOA()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaPersistent_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POA::_nil();\n\t}\n}\n\nCORBA::Object_ptr\nBACI_CORBA::ActivateCORBAObject(PortableServer::Servant srvnt, const char * name)\n{\n\n if (instance_mp==0 || \n instance_mp->poaPersistent_m.ptr() == PortableServer::POA::_nil()) \n {\n return CORBA::Object::_nil();\n }\n \n try\n {\n PortableServer::ObjectId_var id =\n\tPortableServer::string_to_ObjectId(name);\n instance_mp->poaPersistent_m->activate_object_with_id(id.in(), srvnt);\n CORBA::Object_var obj = instance_mp->poaPersistent_m->servant_to_reference(srvnt);\n return obj._retn();\n }\n catch(...)\n {\n ACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::ActivateCORBAObject\",\n\t (LM_ERROR, \"Failed to activate CORBA object\"));\n }\n \n return CORBA::Object::_nil();\n}\n\nbool\nBACI_CORBA::DestroyCORBAObject(CORBA::Object_ptr obj)\n{\n\n if (instance_mp==0 ||\n instance_mp->poaPersistent_m.ptr() == PortableServer::POA::_nil())\n {\n return false;\n }\n\n try\n {\n PortableServer::ObjectId_var id =\n\tinstance_mp->poaPersistent_m->reference_to_id(obj);\n instance_mp->poaPersistent_m->deactivate_object(id.in());\n return true;\n }\n catch(...)\n {\n ACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyCORBAObject\",\n\t (LM_ERROR, \"Failed to deactivate CORBA object\"));\n }\n\n return false;\n}\n\nbool\nBACI_CORBA::DestroyCORBAObject(PortableServer::Servant srvnt)\n{\n if (instance_mp==0 || \n\tinstance_mp->poaPersistent_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n\n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaPersistent_m->servant_to_id(srvnt);\n\tinstance_mp->poaPersistent_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyCORBAObject (servant)\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t}\n\n return false;\n}\n\nbool\nBACI_CORBA::DestroyTransientCORBAObject(CORBA::Object_ptr obj)\n{\n if (instance_mp==0 ||\n\tinstance_mp->poaTransient_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n \n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaTransient_m->reference_to_id(obj);\n\tinstance_mp->poaTransient_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyTransientCORBAObject\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t} \n return false;\n}\n\nbool\nBACI_CORBA::DestroyTransientCORBAObject(PortableServer::Servant srvnt)\n{\n if (instance_mp==0 || \n\tinstance_mp->poaTransient_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n \n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaTransient_m->servant_to_id(srvnt);\n\t\n\tinstance_mp->poaTransient_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyTransientCORBAObject (servant)\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t}\n \n return false;\n}\n\nbool BACI_CORBA::InitCORBA(int argc, char* argv[])\n{ \n try\n {\n \/\/ Initialize the ORB.\n CORBA::ORB_var orb_m = CORBA::ORB_init(argc, argv, \"TAO\");\n \n if(orb_m.ptr() == CORBA::ORB::_nil())\n\t{\n\treturn false;\n\t}\n \n \/\/\n \/\/ Initialize POAs.\n \/\/\n \n \/\/ Get the Root POA.\n CORBA::Object_var objRootPOA =\n\t orb_m->resolve_initial_references(\"RootPOA\");\n \n PortableServer::POA_var poaRoot_m = PortableServer::POA::_narrow(objRootPOA.in());\n \n if(poaRoot_m.ptr() == PortableServer::POA::_nil())\n\t {\n\t return false;\n\t }\n \n \/\/ Get the manager of the root POA to apply to the child POAs.\n PortableServer::POAManager_var poaManager =\n\t poaRoot_m->the_POAManager();\n \n \/\/\n \/\/ Prepare policies our POAs will be using.\n \/\/\n\n \/\/ @@ Unavoidable memory leak here if the POA has been improperly set\n \/\/ up, eg. by a -ORBEndpoint command-line option that does not\n \/\/ correspond to the local host.\n PortableServer::IdAssignmentPolicy_var userIdPolicy =\n\t poaRoot_m->create_id_assignment_policy(PortableServer::USER_ID);\n PortableServer::LifespanPolicy_var persistentPolicy =\n\t poaRoot_m->create_lifespan_policy(PortableServer::PERSISTENT);\n\n CORBA::PolicyList policies;\n\n \/\/Create the transiet poa which has no policies\n PortableServer::POA_var poaTransient_m = poaRoot_m->create_POA(\"TransientPOA\",\n\t\t\t\t\t\t\t\t poaManager.in(),\n\t\t\t\t\t\t\t\t policies);\n\n policies.length(2);\n \n policies[0] = PortableServer::LifespanPolicy::_duplicate(persistentPolicy.in());\n policies[1] = PortableServer::IdAssignmentPolicy::_duplicate(userIdPolicy.in());\n \n PortableServer::POA_var poaPersistent_m = poaRoot_m->create_POA(\"PersistentPOA\", \n\t\t\t\t\t\t\t\t poaManager.in(), \n\t\t\t\t\t\t\t\t policies);\n \n \/\/ We're done using the policies.\n userIdPolicy->destroy();\n persistentPolicy->destroy();\n\n \/\/ POA Manager can start processing incoming requests.\n poaManager->activate(); \n\n \/\/ create BACI_CORBA\n BACI_CORBA::createInstance(orb_m.ptr(), poaManager.ptr(),\n\t\t\t\t poaRoot_m.ptr(), poaPersistent_m.ptr(), poaTransient_m.ptr());\n\n }\n catch(...)\n {\n ACS_LOG(0, \"baci::BACI_CORBA::InitCORBA\", (LM_ERROR, \"Unexpected CORBA exception\"));\n return false; \n }\n \n ACS_DEBUG(\"baci::BACI_CORBA::InitCORBA\", \"CORBA initialized successfully\");\n return true;\n}\n\nbool BACI_CORBA::DoneCORBA()\n{\n\n if (instance_mp==0)\n {\n return false;\n }\n \n try\n {\n \/\/ copy of ptrs\n PortableServer::POA_var poaRoot = PortableServer::POA::_duplicate(BACI_CORBA::getInstance()->getPOA());\n\/\/ PortableServer::POAManager_var poaManager = PortableServer::POAManager::_duplicate(BACI_CORBA::getInstance()->getPOAManager());\n CORBA::ORB_var orb = CORBA::ORB::_duplicate(BACI_CORBA::getInstance()->getORB());\n\/*\n if(poaManager.ptr()!=PortableServer::POAManager::_nil())\n\t{\n\t poaManager->deactivate(1, 1);\n\t}\n \n ACS_DEBUG(\"baci::BACI_CORBA::InitCORBA\", \"POA deactivated (with ehterealization).\");\n*\/\n if(poaRoot.ptr()!=PortableServer::POA::_nil())\n\t {\n\t poaRoot->destroy(1, 1);\n\t }\n \n if(orb.ptr()!=CORBA::ORB::_nil())\n\t {\n\t orb->destroy();\n\t }\n \n \/\/ delete instance\n BACI_CORBA::destroyInstance();\n }\n catch(...)\n {\n ACS_LOG(0, \"baci:BACI_CORBA::DoneCORBA\", (LM_ERROR, \"Unexpected exception occured\"));\n return false;\n }\n \n return true;\n}\n\n\n\n\n\n\n\n\n<commit_msg>Replaced non portable comparing with _nil() with CORBA::is_nil(x)<commit_after>\/*******************************************************************************\n* ALMA - Atacama Large Millimiter Array\n* (c) European Southern Observatory, 2002\n* Copyright by ESO (in the framework of the ALMA collaboration),\n* All rights reserved\n*\n* This library is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2.1 of the License, or (at your option) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\n* \"@(#) $Id: baciCORBA.cpp,v 1.97 2008\/07\/14 12:01:37 bjeram Exp $\"\n*\n* who when what\n* -------- -------- ----------------------------------------------\n* gchiozzi 2001-12-20 Added getPOAManager() and getPOARoot() methods.\n* msekoran 2001\/02\/17 created\n* msekoran 2001\/05\/21 fixed destroy bug\n* msekoran 2001\/08\/26 added InitCORBA, DoneCORBA for BACI modular tests\n*\/\n\n#include <vltPort.h>\n#include \"logging.h\"\n#include \"baciCORBA.h\"\n\nBACI_CORBA * BACI_CORBA::instance_mp = 0;\n\nBACI_CORBA::BACI_CORBA(CORBA::ORB_ptr orb_m,\n\t\t PortableServer::POAManager_ptr poaManager_m,\n\t\t PortableServer::POA_ptr poaRoot_m,\n\t\t PortableServer::POA_ptr poaPersistent_m,\n\t\t PortableServer::POA_ptr poaTransient_m)\n{\n this->orb_m = CORBA::ORB::_duplicate(orb_m);\n this->poaManager_m = PortableServer::POAManager::_duplicate(poaManager_m);\n this->poaRoot_m = PortableServer::POA::_duplicate(poaRoot_m);\n this->poaPersistent_m = PortableServer::POA::_duplicate(poaPersistent_m);\n this->poaTransient_m = PortableServer::POA::_duplicate(poaTransient_m);\n}\n\nBACI_CORBA::~BACI_CORBA()\n{\n}\n\n\nBACI_CORBA *\nBACI_CORBA::getInstance()\n{\n return instance_mp;\n}\n\nBACI_CORBA *\nBACI_CORBA::createInstance(CORBA::ORB_ptr orb_m,\n\t\t\t PortableServer::POAManager_ptr poaManager_m,\n\t\t\t PortableServer::POA_ptr poaRoot_m,\n\t\t\t PortableServer::POA_ptr poaPersistent_m,\n\t\t\t PortableServer::POA_ptr poaTransient_m)\n{\n if (instance_mp==0)\n {\n instance_mp = new BACI_CORBA(orb_m, poaManager_m, poaRoot_m, poaPersistent_m, poaTransient_m);\n }\n return instance_mp;\n}\n\nvoid\nBACI_CORBA::destroyInstance()\n{\n if (instance_mp!=0)\n {\n delete instance_mp;\n instance_mp = 0;\n }\n}\n\nCORBA::ORB_ptr\nBACI_CORBA::getORB()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->orb_m.ptr();\n\t}\n else\n\t{\n\treturn CORBA::ORB::_nil();\n\t}\n}\n\nPortableServer::POAManager_ptr\nBACI_CORBA::getPOAManager()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaManager_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POAManager::_nil();\n\t}\n}\n\nPortableServer::POA_ptr\nBACI_CORBA::getPOARoot()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaRoot_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POA::_nil();\n\t}\n}\n\nPortableServer::POA_ptr\nBACI_CORBA::getPOA()\n{\n if (instance_mp!=0)\n\t{\n\treturn instance_mp->poaPersistent_m.ptr();\n\t}\n else\n\t{\n\treturn PortableServer::POA::_nil();\n\t}\n}\n\nCORBA::Object_ptr\nBACI_CORBA::ActivateCORBAObject(PortableServer::Servant srvnt, const char * name)\n{\n\n if (instance_mp==0 ||\n CORBA::is_nil(instance_mp->poaPersistent_m.ptr()) )\n {\n return CORBA::Object::_nil();\n }\n\n try\n {\n PortableServer::ObjectId_var id =\n\tPortableServer::string_to_ObjectId(name);\n instance_mp->poaPersistent_m->activate_object_with_id(id.in(), srvnt);\n CORBA::Object_var obj = instance_mp->poaPersistent_m->servant_to_reference(srvnt);\n return obj._retn();\n }\n catch(...)\n {\n ACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::ActivateCORBAObject\",\n\t (LM_ERROR, \"Failed to activate CORBA object\"));\n }\n\n return CORBA::Object::_nil();\n}\n\nbool\nBACI_CORBA::DestroyCORBAObject(CORBA::Object_ptr obj)\n{\n\n if (instance_mp==0 ||\n instance_mp->poaPersistent_m.ptr() == PortableServer::POA::_nil())\n {\n return false;\n }\n\n try\n {\n PortableServer::ObjectId_var id =\n\tinstance_mp->poaPersistent_m->reference_to_id(obj);\n instance_mp->poaPersistent_m->deactivate_object(id.in());\n return true;\n }\n catch(...)\n {\n ACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyCORBAObject\",\n\t (LM_ERROR, \"Failed to deactivate CORBA object\"));\n }\n\n return false;\n}\n\nbool\nBACI_CORBA::DestroyCORBAObject(PortableServer::Servant srvnt)\n{\n if (instance_mp==0 ||\n\tinstance_mp->poaPersistent_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n\n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaPersistent_m->servant_to_id(srvnt);\n\tinstance_mp->poaPersistent_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyCORBAObject (servant)\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t}\n\n return false;\n}\n\nbool\nBACI_CORBA::DestroyTransientCORBAObject(CORBA::Object_ptr obj)\n{\n if (instance_mp==0 ||\n\tinstance_mp->poaTransient_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n\n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaTransient_m->reference_to_id(obj);\n\tinstance_mp->poaTransient_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyTransientCORBAObject\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t}\n return false;\n}\n\nbool\nBACI_CORBA::DestroyTransientCORBAObject(PortableServer::Servant srvnt)\n{\n if (instance_mp==0 ||\n\tinstance_mp->poaTransient_m.ptr() == PortableServer::POA::_nil())\n\t{\n\treturn false;\n\t}\n\n try\n\t{\n\tPortableServer::ObjectId_var id =\n\t instance_mp->poaTransient_m->servant_to_id(srvnt);\n\n\tinstance_mp->poaTransient_m->deactivate_object(id.in());\n\treturn true;\n\t}\n catch(...)\n\t{\n\tACS_LOG(LM_RUNTIME_CONTEXT, \"BACI_CORBA::DestroyTransientCORBAObject (servant)\",\n\t\t(LM_ERROR, \"Failed to deactivate CORBA object\"));\n\t}\n\n return false;\n}\n\nbool BACI_CORBA::InitCORBA(int argc, char* argv[])\n{\n try\n {\n \/\/ Initialize the ORB.\n CORBA::ORB_var orb_m = CORBA::ORB_init(argc, argv, \"TAO\");\n\n if(orb_m.ptr() == CORBA::ORB::_nil())\n\t{\n\treturn false;\n\t}\n\n \/\/\n \/\/ Initialize POAs.\n \/\/\n\n \/\/ Get the Root POA.\n CORBA::Object_var objRootPOA =\n\t orb_m->resolve_initial_references(\"RootPOA\");\n\n PortableServer::POA_var poaRoot_m = PortableServer::POA::_narrow(objRootPOA.in());\n\n if(poaRoot_m.ptr() == PortableServer::POA::_nil())\n\t {\n\t return false;\n\t }\n\n \/\/ Get the manager of the root POA to apply to the child POAs.\n PortableServer::POAManager_var poaManager =\n\t poaRoot_m->the_POAManager();\n\n \/\/\n \/\/ Prepare policies our POAs will be using.\n \/\/\n\n \/\/ @@ Unavoidable memory leak here if the POA has been improperly set\n \/\/ up, eg. by a -ORBEndpoint command-line option that does not\n \/\/ correspond to the local host.\n PortableServer::IdAssignmentPolicy_var userIdPolicy =\n\t poaRoot_m->create_id_assignment_policy(PortableServer::USER_ID);\n PortableServer::LifespanPolicy_var persistentPolicy =\n\t poaRoot_m->create_lifespan_policy(PortableServer::PERSISTENT);\n\n CORBA::PolicyList policies;\n\n \/\/Create the transiet poa which has no policies\n PortableServer::POA_var poaTransient_m = poaRoot_m->create_POA(\"TransientPOA\",\n\t\t\t\t\t\t\t\t poaManager.in(),\n\t\t\t\t\t\t\t\t policies);\n\n policies.length(2);\n\n policies[0] = PortableServer::LifespanPolicy::_duplicate(persistentPolicy.in());\n policies[1] = PortableServer::IdAssignmentPolicy::_duplicate(userIdPolicy.in());\n\n PortableServer::POA_var poaPersistent_m = poaRoot_m->create_POA(\"PersistentPOA\",\n\t\t\t\t\t\t\t\t poaManager.in(),\n\t\t\t\t\t\t\t\t policies);\n\n \/\/ We're done using the policies.\n userIdPolicy->destroy();\n persistentPolicy->destroy();\n\n \/\/ POA Manager can start processing incoming requests.\n poaManager->activate();\n\n \/\/ create BACI_CORBA\n BACI_CORBA::createInstance(orb_m.ptr(), poaManager.ptr(),\n\t\t\t\t poaRoot_m.ptr(), poaPersistent_m.ptr(), poaTransient_m.ptr());\n\n }\n catch(...)\n {\n ACS_LOG(0, \"baci::BACI_CORBA::InitCORBA\", (LM_ERROR, \"Unexpected CORBA exception\"));\n return false;\n }\n\n ACS_DEBUG(\"baci::BACI_CORBA::InitCORBA\", \"CORBA initialized successfully\");\n return true;\n}\n\nbool BACI_CORBA::DoneCORBA()\n{\n\n if (instance_mp==0)\n {\n return false;\n }\n\n try\n {\n \/\/ copy of ptrs\n PortableServer::POA_var poaRoot = PortableServer::POA::_duplicate(BACI_CORBA::getInstance()->getPOA());\n\/\/ PortableServer::POAManager_var poaManager = PortableServer::POAManager::_duplicate(BACI_CORBA::getInstance()->getPOAManager());\n CORBA::ORB_var orb = CORBA::ORB::_duplicate(BACI_CORBA::getInstance()->getORB());\n\/*\n if(poaManager.ptr()!=PortableServer::POAManager::_nil())\n\t{\n\t poaManager->deactivate(1, 1);\n\t}\n\n ACS_DEBUG(\"baci::BACI_CORBA::InitCORBA\", \"POA deactivated (with ehterealization).\");\n*\/\n if(poaRoot.ptr()!=PortableServer::POA::_nil())\n\t {\n\t poaRoot->destroy(1, 1);\n\t }\n\n if(orb.ptr()!=CORBA::ORB::_nil())\n\t {\n\t orb->destroy();\n\t }\n\n \/\/ delete instance\n BACI_CORBA::destroyInstance();\n }\n catch(...)\n {\n ACS_LOG(0, \"baci:BACI_CORBA::DoneCORBA\", (LM_ERROR, \"Unexpected exception occured\"));\n return false;\n }\n\n return true;\n}\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2018 The Wuffs Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Silence the nested slash-star warning for the next comment's command line.\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wcomment\"\n\n\/*\nThis fuzzer (the fuzz function) is typically run indirectly, by a framework\nsuch as https:\/\/github.com\/google\/oss-fuzz calling LLVMFuzzerTestOneInput.\n\nWhen working on the fuzz implementation, or as a sanity check, defining\nWUFFS_CONFIG__FUZZLIB_MAIN will let you manually run fuzz over a set of files:\n\ng++ -DWUFFS_CONFIG__FUZZLIB_MAIN gif_fuzzer.cc\n.\/a.out ..\/..\/..\/test\/testdata\/*.gif\nrm -f .\/a.out\n\nIt should print \"PASS\", amongst other information, and exit(0).\n*\/\n\n#pragma clang diagnostic pop\n\n\/\/ If building this program in an environment that doesn't easily accomodate\n\/\/ relative includes, you can use the script\/inline-c-relative-includes.go\n\/\/ program to generate a stand-alone C file.\n#include \"..\/..\/..\/gen\/c\/std\/gif.c\"\n#include \"..\/fuzzlib\/fuzzlib.cc\"\n\nvoid fuzz(wuffs_base__reader1 src_reader, uint32_t hash) {\n void* pixbuf = NULL;\n\n \/\/ Use a {} code block so that \"goto exit\" doesn't trigger \"jump bypasses\n \/\/ variable initialization\" warnings.\n {\n wuffs_gif__status s;\n wuffs_gif__decoder dec;\n wuffs_gif__decoder__initialize(&dec, WUFFS_VERSION, 0);\n\n wuffs_base__image_config ic = {{0}};\n s = wuffs_gif__decoder__decode_config(&dec, &ic, src_reader);\n if (s || !wuffs_base__image_config__valid(&ic)) {\n goto exit;\n }\n\n \/\/ Intentionally crash on 0.1% of all possible image widths.\n \/\/\n \/\/ TODO: remove this. This intentional segfault is a temporary measure to\n \/\/ check that oss-fuzz' fuzzing and reporting works as advertised.\n {\n uint32_t width = wuffs_base__image_config__width(&ic);\n if ((width % 1000) == 123) {\n fprintf(stderr, \"intentional segfault for width == %\" PRIu32 \"\\n\",\n width);\n intentional_segfault();\n }\n }\n\n size_t pixbuf_size = wuffs_base__image_config__pixbuf_size(&ic);\n \/\/ Don't try to allocate more than 64 MiB.\n if (pixbuf_size > 64 * 1024 * 1024) {\n goto exit;\n }\n pixbuf = malloc(pixbuf_size);\n if (!pixbuf) {\n goto exit;\n }\n\n wuffs_base__buf1 dst = {.ptr = (uint8_t*)(pixbuf), .len = pixbuf_size};\n wuffs_base__writer1 dst_writer = {.buf = &dst};\n\n while (true) {\n \/\/ TODO: handle the frame rect being larger than the image rect. The\n \/\/ GIF89a spec doesn't disallow this and the Wuffs code tolerates it, in\n \/\/ that it returns a \"short write\" (because the dst buffer is too small)\n \/\/ and will not e.g. write past the buffer bounds. But the Wuffs GIF API\n \/\/ should somehow pass a subset of pixbuf to decode_frame.\n dst.wi = 0;\n s = wuffs_gif__decoder__decode_frame(&dec, dst_writer, src_reader);\n if (s) {\n break;\n }\n }\n }\n\nexit:\n if (pixbuf) {\n free(pixbuf);\n }\n}\n<commit_msg>Remove intentional OSS-Fuzz segfault<commit_after>\/\/ Copyright 2018 The Wuffs Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/\/ Silence the nested slash-star warning for the next comment's command line.\n#pragma clang diagnostic push\n#pragma clang diagnostic ignored \"-Wcomment\"\n\n\/*\nThis fuzzer (the fuzz function) is typically run indirectly, by a framework\nsuch as https:\/\/github.com\/google\/oss-fuzz calling LLVMFuzzerTestOneInput.\n\nWhen working on the fuzz implementation, or as a sanity check, defining\nWUFFS_CONFIG__FUZZLIB_MAIN will let you manually run fuzz over a set of files:\n\ng++ -DWUFFS_CONFIG__FUZZLIB_MAIN gif_fuzzer.cc\n.\/a.out ..\/..\/..\/test\/testdata\/*.gif\nrm -f .\/a.out\n\nIt should print \"PASS\", amongst other information, and exit(0).\n*\/\n\n#pragma clang diagnostic pop\n\n\/\/ If building this program in an environment that doesn't easily accomodate\n\/\/ relative includes, you can use the script\/inline-c-relative-includes.go\n\/\/ program to generate a stand-alone C file.\n#include \"..\/..\/..\/gen\/c\/std\/gif.c\"\n#include \"..\/fuzzlib\/fuzzlib.cc\"\n\nvoid fuzz(wuffs_base__reader1 src_reader, uint32_t hash) {\n void* pixbuf = NULL;\n\n \/\/ Use a {} code block so that \"goto exit\" doesn't trigger \"jump bypasses\n \/\/ variable initialization\" warnings.\n {\n wuffs_gif__status s;\n wuffs_gif__decoder dec;\n wuffs_gif__decoder__initialize(&dec, WUFFS_VERSION, 0);\n\n wuffs_base__image_config ic = {{0}};\n s = wuffs_gif__decoder__decode_config(&dec, &ic, src_reader);\n if (s || !wuffs_base__image_config__valid(&ic)) {\n goto exit;\n }\n\n size_t pixbuf_size = wuffs_base__image_config__pixbuf_size(&ic);\n \/\/ Don't try to allocate more than 64 MiB.\n if (pixbuf_size > 64 * 1024 * 1024) {\n goto exit;\n }\n pixbuf = malloc(pixbuf_size);\n if (!pixbuf) {\n goto exit;\n }\n\n wuffs_base__buf1 dst = {.ptr = (uint8_t*)(pixbuf), .len = pixbuf_size};\n wuffs_base__writer1 dst_writer = {.buf = &dst};\n\n while (true) {\n \/\/ TODO: handle the frame rect being larger than the image rect. The\n \/\/ GIF89a spec doesn't disallow this and the Wuffs code tolerates it, in\n \/\/ that it returns a \"short write\" (because the dst buffer is too small)\n \/\/ and will not e.g. write past the buffer bounds. But the Wuffs GIF API\n \/\/ should somehow pass a subset of pixbuf to decode_frame.\n dst.wi = 0;\n s = wuffs_gif__decoder__decode_frame(&dec, dst_writer, src_reader);\n if (s) {\n break;\n }\n }\n }\n\nexit:\n if (pixbuf) {\n free(pixbuf);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Appcelerator Titanium Mobile\n * Copyright (c) 2011 by Appcelerator, Inc. All Rights Reserved.\n * Licensed under the terms of the Apache Public License\n * Please see the LICENSE included with this distribution for details.\n *\/\n#include <v8.h>\n#include <jni.h>\n\n#include \"AndroidUtil.h\"\n#include \"NativeObject.h\"\n#include \"ScriptsModule.h\"\n#include \"V8Util.h\"\n#include \"JNIUtil.h\"\n#include \"TypeConverter.h\"\n\n#define TAG \"ScriptsModule\"\n\nnamespace titanium {\nusing namespace v8;\n\nPersistent<FunctionTemplate> WrappedScript::constructor_template;\nPersistent<FunctionTemplate> WrappedContext::constructor_template;\n\nvoid WrappedContext::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\n\tconstructor_template = Persistent<FunctionTemplate>::New(FunctionTemplate::New(WrappedContext::New));\n\tconstructor_template->InstanceTemplate()->SetInternalFieldCount(1);\n\tconstructor_template->SetClassName(String::NewSymbol(\"Context\"));\n\n\ttarget->Set(String::NewSymbol(\"Context\"), constructor_template->GetFunction());\n}\n\nHandle<Value> WrappedContext::New(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tWrappedContext *t = new WrappedContext();\n\tt->Wrap(args.This());\n\n\treturn args.This();\n}\n\nWrappedContext::WrappedContext()\n\t: NativeObject()\n{\n\tcontext_ = Context::New();\n}\n\nWrappedContext::WrappedContext(Persistent<Context> context)\n\t: NativeObject()\n{\n\tcontext_ = context;\n}\n\nWrappedContext::~WrappedContext()\n{\n\tcontext_.Dispose();\n}\n\nLocal<Object> WrappedContext::NewInstance()\n{\n\tLocal<Object> context = constructor_template->GetFunction()->NewInstance();\n\treturn context;\n}\n\nPersistent<Context> WrappedContext::GetV8Context()\n{\n\treturn context_;\n}\n\nHandle<Object> WrappedContext::WrapContext(Persistent<Context> context)\n{\n\tHandleScope scope;\n\tWrappedContext *t = new WrappedContext(context);\n\tLocal<Object> wrappedContext = WrappedContext::NewInstance();\n\tt->Wrap(wrappedContext);\n\treturn scope.Close(wrappedContext);\n}\n\nvoid WrappedScript::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\n\tconstructor_template = Persistent<FunctionTemplate>::New(FunctionTemplate::New(WrappedScript::New));\n\tconstructor_template->InstanceTemplate()->SetInternalFieldCount(1);\n\tconstructor_template->SetClassName(String::NewSymbol(\"Script\"));\n\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"createContext\", WrappedScript::CreateContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInContext\", WrappedScript::RunInContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInThisContext\", WrappedScript::RunInThisContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInNewContext\", WrappedScript::RunInNewContext);\n\n\tDEFINE_METHOD(constructor_template, \"createContext\", WrappedScript::CreateContext);\n\tDEFINE_METHOD(constructor_template, \"runInContext\", WrappedScript::CompileRunInContext);\n\tDEFINE_METHOD(constructor_template, \"runInThisContext\", WrappedScript::CompileRunInThisContext);\n\tDEFINE_METHOD(constructor_template, \"runInNewContext\", WrappedScript::CompileRunInNewContext);\n\n\ttarget->Set(String::NewSymbol(\"Script\"), constructor_template->GetFunction());\n}\n\nHandle<Value> WrappedScript::New(const Arguments& args)\n{\n\tif (!args.IsConstructCall()) {\n\t\treturn V8Util::newInstanceFromConstructorTemplate(constructor_template, args);\n\t}\n\n\tHandleScope scope;\n\tWrappedScript *t = new WrappedScript();\n\tt->Wrap(args.Holder());\n\treturn WrappedScript::EvalMachine<compileCode, thisContext, wrapExternal>(args);\n}\n\nWrappedScript::~WrappedScript()\n{\n\tscript_.Dispose();\n}\n\nHandle<Value> WrappedScript::CreateContext(const Arguments& args)\n{\n\tHandleScope scope;\n\tLocal<Object> context = WrappedContext::NewInstance();\n\tif (args.Length() > 0) {\n\t\tLocal<Object> sandbox = args[0]->ToObject();\n\t\tLocal<Array> keys = sandbox->GetPropertyNames();\n\n\t\tfor (uint32_t i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = sandbox->Get(key);\n\t\t\tif (value == sandbox) {\n\t\t\t\tvalue = context;\n\t\t\t}\n\t\t\tcontext->Set(key, value);\n\t\t}\n\t}\n\n\treturn scope.Close(context);\n}\n\nHandle<Value> WrappedScript::RunInContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, userContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::RunInThisContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, thisContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::RunInNewContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, newContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, userContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInThisContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, thisContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInNewContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, newContext, returnResult>(args);\n}\n\ntemplate<WrappedScript::EvalInputFlags input_flag, WrappedScript::EvalContextFlags context_flag,\n\tWrappedScript::EvalOutputFlags output_flag>\nHandle<Value> WrappedScript::EvalMachine(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tif (input_flag == compileCode && args.Length() < 1) {\n\t\treturn ThrowException(Exception::TypeError(String::New(\"needs at least 'code' argument.\")));\n\t}\n\n\tconst int sandbox_index = input_flag == compileCode ? 1 : 0;\n\tif (context_flag == userContext && args.Length() < (sandbox_index + 1)) {\n\t\treturn ThrowException(Exception::TypeError(String::New(\"needs a 'context' argument.\")));\n\t}\n\n\tLocal<String> code;\n\tif (input_flag == compileCode) code = args[0]->ToString();\n\n\tLocal<Object> sandbox;\n\tif (context_flag == newContext) {\n\t\tsandbox = args[sandbox_index]->IsObject() ? args[sandbox_index]->ToObject() : Object::New();\n\t} else if (context_flag == userContext) {\n\t\tsandbox = args[sandbox_index]->ToObject();\n\t}\n\n\tconst int filename_index = sandbox_index + (context_flag == newContext ? 1 : 0);\n\tLocal<String> filename =\n\t\t\targs.Length() > filename_index ? args[filename_index]->ToString() : String::New(\"evalmachine.<anonymous>\");\n\n\tconst int display_error_index = args.Length() - 1;\n\tbool display_error = false;\n\tif (args.Length() > display_error_index && args[display_error_index]->IsBoolean()\n\t\t&& args[display_error_index]->BooleanValue() == true) {\n\t\tdisplay_error = true;\n\t}\n\n\tPersistent<Context> context;\n\n\tLocal<Array> keys;\n\tunsigned int i;\n\tif (context_flag == newContext) {\n\t\t\/\/ Create the new context\n\t\tcontext = Context::New();\n\n\t} else if (context_flag == userContext) {\n\t\t\/\/ Use the passed in context\n\t\tLocal<Object> contextArg = args[sandbox_index]->ToObject();\n\t\tWrappedContext *nContext = NativeObject::Unwrap<WrappedContext>(sandbox);\n\t\tcontext = nContext->GetV8Context();\n\t}\n\n\t\/\/ New and user context share code. DRY it up.\n\tif (context_flag == userContext || context_flag == newContext) {\n\t\t\/\/ Enter the context\n\t\tcontext->Enter();\n\n\t\t\/\/ Copy everything from the passed in sandbox (either the persistent\n\t\t\/\/ context for runInContext(), or the sandbox arg to runInNewContext()).\n\t\tkeys = sandbox->GetPropertyNames();\n\n\t\tfor (i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = sandbox->Get(key);\n\t\t\tif (value == sandbox) {\n\t\t\t\tvalue = context->Global();\n\t\t\t}\n\t\t\tcontext->Global()->Set(key, value);\n\t\t}\n\t}\n\n\t\/\/ Catch errors\n\tTryCatch try_catch;\n\n\tHandle<Value> result;\n\tHandle<Script> script;\n\n\tif (input_flag == compileCode) {\n\t\t\/\/ well, here WrappedScript::New would suffice in all cases, but maybe\n\t\t\/\/ Compile has a little better performance where possible\n\t\tscript = output_flag == returnResult ? Script::Compile(code, filename) : Script::New(code, filename);\n\t\tif (script.IsEmpty()) {\n\t\t\tif (display_error) {\n\t\t\t\tV8Util::reportException(try_catch, true);\n\t\t\t}\n\t\t\t\/\/ Hack because I can't get a proper stacktrace on SyntaxError\n\t\t\treturn try_catch.ReThrow();\n\t\t}\n\t} else {\n\t\tWrappedScript *n_script = NativeObject::Unwrap<WrappedScript>(args.Holder());\n\t\tif (!n_script) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"Must be called as a method of Script.\")));\n\t\t} else if (n_script->script_.IsEmpty()) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"'this' must be a result of previous \"\n\t\t\t\t\"new Script(code) call.\")));\n\t\t}\n\n\t\tscript = n_script->script_;\n\t}\n\n\tif (output_flag == returnResult) {\n\t\tresult = script->Run();\n\t\tif (result.IsEmpty()) {\n\t\t\tif (context_flag == newContext) {\n\t\t\t\tcontext->DetachGlobal();\n\t\t\t\tcontext->Exit();\n\t\t\t\tcontext.Dispose();\n\t\t\t}\n\t\t\treturn try_catch.ReThrow();\n\t\t}\n\t} else {\n\t\tWrappedScript *n_script = NativeObject::Unwrap<WrappedScript>(args.Holder());\n\t\tif (!n_script) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"Must be called as a method of Script.\")));\n\t\t}\n\t\tn_script->script_ = Persistent<Script>::New(script);\n\t\tresult = args.This();\n\t}\n\n\tif (context_flag == userContext || context_flag == newContext) {\n\t\t\/\/ success! copy changes back onto the sandbox object.\n\t\tkeys = context->Global()->GetPropertyNames();\n\t\tfor (i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = context->Global()->Get(key);\n\t\t\tif (value == context->Global()) {\n\t\t\t\tvalue = sandbox;\n\t\t\t}\n\t\t\tsandbox->Set(key, value);\n\t\t}\n\t}\n\n\tif (context_flag == newContext) {\n\t\t\/\/ Clean up, clean up, everybody everywhere!\n\t\tcontext->DetachGlobal();\n\t\tcontext->Exit();\n\t\tcontext.Dispose();\n\t} else if (context_flag == userContext) {\n\t\t\/\/ Exit the passed in context.\n\t\tcontext->Exit();\n\t}\n\n\treturn result == args.This() ? result : scope.Close(result);\n}\n\nvoid ScriptsModule::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\tWrappedContext::Initialize(target);\n\tWrappedScript::Initialize(target);\n}\n\nHandle<Object> ScriptsModule::WrapContext(Persistent<Context> context)\n{\n\treturn WrappedContext::WrapContext(context);\n}\n\n}\n<commit_msg>Report exception in Script.runInContext<commit_after>\/**\n * Appcelerator Titanium Mobile\n * Copyright (c) 2011 by Appcelerator, Inc. All Rights Reserved.\n * Licensed under the terms of the Apache Public License\n * Please see the LICENSE included with this distribution for details.\n *\/\n#include <v8.h>\n#include <jni.h>\n\n#include \"AndroidUtil.h\"\n#include \"NativeObject.h\"\n#include \"ScriptsModule.h\"\n#include \"V8Util.h\"\n#include \"JNIUtil.h\"\n#include \"TypeConverter.h\"\n\n#define TAG \"ScriptsModule\"\n\nnamespace titanium {\nusing namespace v8;\n\nPersistent<FunctionTemplate> WrappedScript::constructor_template;\nPersistent<FunctionTemplate> WrappedContext::constructor_template;\n\nvoid WrappedContext::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\n\tconstructor_template = Persistent<FunctionTemplate>::New(FunctionTemplate::New(WrappedContext::New));\n\tconstructor_template->InstanceTemplate()->SetInternalFieldCount(1);\n\tconstructor_template->SetClassName(String::NewSymbol(\"Context\"));\n\n\ttarget->Set(String::NewSymbol(\"Context\"), constructor_template->GetFunction());\n}\n\nHandle<Value> WrappedContext::New(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tWrappedContext *t = new WrappedContext();\n\tt->Wrap(args.This());\n\n\treturn args.This();\n}\n\nWrappedContext::WrappedContext()\n\t: NativeObject()\n{\n\tcontext_ = Context::New();\n}\n\nWrappedContext::WrappedContext(Persistent<Context> context)\n\t: NativeObject()\n{\n\tcontext_ = context;\n}\n\nWrappedContext::~WrappedContext()\n{\n\tcontext_.Dispose();\n}\n\nLocal<Object> WrappedContext::NewInstance()\n{\n\tLocal<Object> context = constructor_template->GetFunction()->NewInstance();\n\treturn context;\n}\n\nPersistent<Context> WrappedContext::GetV8Context()\n{\n\treturn context_;\n}\n\nHandle<Object> WrappedContext::WrapContext(Persistent<Context> context)\n{\n\tHandleScope scope;\n\tWrappedContext *t = new WrappedContext(context);\n\tLocal<Object> wrappedContext = WrappedContext::NewInstance();\n\tt->Wrap(wrappedContext);\n\treturn scope.Close(wrappedContext);\n}\n\nvoid WrappedScript::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\n\tconstructor_template = Persistent<FunctionTemplate>::New(FunctionTemplate::New(WrappedScript::New));\n\tconstructor_template->InstanceTemplate()->SetInternalFieldCount(1);\n\tconstructor_template->SetClassName(String::NewSymbol(\"Script\"));\n\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"createContext\", WrappedScript::CreateContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInContext\", WrappedScript::RunInContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInThisContext\", WrappedScript::RunInThisContext);\n\tDEFINE_PROTOTYPE_METHOD(constructor_template, \"runInNewContext\", WrappedScript::RunInNewContext);\n\n\tDEFINE_METHOD(constructor_template, \"createContext\", WrappedScript::CreateContext);\n\tDEFINE_METHOD(constructor_template, \"runInContext\", WrappedScript::CompileRunInContext);\n\tDEFINE_METHOD(constructor_template, \"runInThisContext\", WrappedScript::CompileRunInThisContext);\n\tDEFINE_METHOD(constructor_template, \"runInNewContext\", WrappedScript::CompileRunInNewContext);\n\n\ttarget->Set(String::NewSymbol(\"Script\"), constructor_template->GetFunction());\n}\n\nHandle<Value> WrappedScript::New(const Arguments& args)\n{\n\tif (!args.IsConstructCall()) {\n\t\treturn V8Util::newInstanceFromConstructorTemplate(constructor_template, args);\n\t}\n\n\tHandleScope scope;\n\tWrappedScript *t = new WrappedScript();\n\tt->Wrap(args.Holder());\n\treturn WrappedScript::EvalMachine<compileCode, thisContext, wrapExternal>(args);\n}\n\nWrappedScript::~WrappedScript()\n{\n\tscript_.Dispose();\n}\n\nHandle<Value> WrappedScript::CreateContext(const Arguments& args)\n{\n\tHandleScope scope;\n\tLocal<Object> context = WrappedContext::NewInstance();\n\tif (args.Length() > 0) {\n\t\tLocal<Object> sandbox = args[0]->ToObject();\n\t\tLocal<Array> keys = sandbox->GetPropertyNames();\n\n\t\tfor (uint32_t i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = sandbox->Get(key);\n\t\t\tif (value == sandbox) {\n\t\t\t\tvalue = context;\n\t\t\t}\n\t\t\tcontext->Set(key, value);\n\t\t}\n\t}\n\n\treturn scope.Close(context);\n}\n\nHandle<Value> WrappedScript::RunInContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, userContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::RunInThisContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, thisContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::RunInNewContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<unwrapExternal, newContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, userContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInThisContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, thisContext, returnResult>(args);\n}\n\nHandle<Value> WrappedScript::CompileRunInNewContext(const Arguments& args)\n{\n\treturn WrappedScript::EvalMachine<compileCode, newContext, returnResult>(args);\n}\n\ntemplate<WrappedScript::EvalInputFlags input_flag, WrappedScript::EvalContextFlags context_flag,\n\tWrappedScript::EvalOutputFlags output_flag>\nHandle<Value> WrappedScript::EvalMachine(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tif (input_flag == compileCode && args.Length() < 1) {\n\t\treturn ThrowException(Exception::TypeError(String::New(\"needs at least 'code' argument.\")));\n\t}\n\n\tconst int sandbox_index = input_flag == compileCode ? 1 : 0;\n\tif (context_flag == userContext && args.Length() < (sandbox_index + 1)) {\n\t\treturn ThrowException(Exception::TypeError(String::New(\"needs a 'context' argument.\")));\n\t}\n\n\tLocal<String> code;\n\tif (input_flag == compileCode) code = args[0]->ToString();\n\n\tLocal<Object> sandbox;\n\tif (context_flag == newContext) {\n\t\tsandbox = args[sandbox_index]->IsObject() ? args[sandbox_index]->ToObject() : Object::New();\n\t} else if (context_flag == userContext) {\n\t\tsandbox = args[sandbox_index]->ToObject();\n\t}\n\n\tconst int filename_index = sandbox_index + (context_flag == newContext ? 1 : 0);\n\tLocal<String> filename =\n\t\t\targs.Length() > filename_index ? args[filename_index]->ToString() : String::New(\"evalmachine.<anonymous>\");\n\n\tconst int display_error_index = args.Length() - 1;\n\tbool display_error = false;\n\tif (args.Length() > display_error_index && args[display_error_index]->IsBoolean()\n\t\t&& args[display_error_index]->BooleanValue() == true) {\n\t\tdisplay_error = true;\n\t}\n\n\tPersistent<Context> context;\n\n\tLocal<Array> keys;\n\tunsigned int i;\n\tif (context_flag == newContext) {\n\t\t\/\/ Create the new context\n\t\tcontext = Context::New();\n\n\t} else if (context_flag == userContext) {\n\t\t\/\/ Use the passed in context\n\t\tLocal<Object> contextArg = args[sandbox_index]->ToObject();\n\t\tWrappedContext *nContext = NativeObject::Unwrap<WrappedContext>(sandbox);\n\t\tcontext = nContext->GetV8Context();\n\t}\n\n\t\/\/ New and user context share code. DRY it up.\n\tif (context_flag == userContext || context_flag == newContext) {\n\t\t\/\/ Enter the context\n\t\tcontext->Enter();\n\n\t\t\/\/ Copy everything from the passed in sandbox (either the persistent\n\t\t\/\/ context for runInContext(), or the sandbox arg to runInNewContext()).\n\t\tkeys = sandbox->GetPropertyNames();\n\n\t\tfor (i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = sandbox->Get(key);\n\t\t\tif (value == sandbox) {\n\t\t\t\tvalue = context->Global();\n\t\t\t}\n\t\t\tcontext->Global()->Set(key, value);\n\t\t}\n\t}\n\n\t\/\/ Catch errors\n\tTryCatch try_catch;\n\n\tHandle<Value> result;\n\tHandle<Script> script;\n\n\tif (input_flag == compileCode) {\n\t\t\/\/ well, here WrappedScript::New would suffice in all cases, but maybe\n\t\t\/\/ Compile has a little better performance where possible\n\t\tscript = output_flag == returnResult ? Script::Compile(code, filename) : Script::New(code, filename);\n\t\tif (script.IsEmpty()) {\n\t\t\tif (display_error) {\n\t\t\t\tV8Util::reportException(try_catch, true);\n\t\t\t}\n\t\t\t\/\/ Hack because I can't get a proper stacktrace on SyntaxError\n\t\t\treturn try_catch.ReThrow();\n\t\t}\n\t} else {\n\t\tWrappedScript *n_script = NativeObject::Unwrap<WrappedScript>(args.Holder());\n\t\tif (!n_script) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"Must be called as a method of Script.\")));\n\t\t} else if (n_script->script_.IsEmpty()) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"'this' must be a result of previous \"\n\t\t\t\t\"new Script(code) call.\")));\n\t\t}\n\n\t\tscript = n_script->script_;\n\t}\n\n\tif (output_flag == returnResult) {\n\t\tresult = script->Run();\n\t\tif (result.IsEmpty()) {\n\t\t\tif (display_error) V8Util::reportException(try_catch);\n\t\t\tif (context_flag == newContext) {\n\t\t\t\tcontext->DetachGlobal();\n\t\t\t\tcontext->Exit();\n\t\t\t\tcontext.Dispose();\n\t\t\t}\n\t\t\treturn try_catch.ReThrow();\n\t\t}\n\t} else {\n\t\tWrappedScript *n_script = NativeObject::Unwrap<WrappedScript>(args.Holder());\n\t\tif (!n_script) {\n\t\t\treturn ThrowException(Exception::Error(String::New(\"Must be called as a method of Script.\")));\n\t\t}\n\t\tn_script->script_ = Persistent<Script>::New(script);\n\t\tresult = args.This();\n\t}\n\n\tif (context_flag == userContext || context_flag == newContext) {\n\t\t\/\/ success! copy changes back onto the sandbox object.\n\t\tkeys = context->Global()->GetPropertyNames();\n\t\tfor (i = 0; i < keys->Length(); i++) {\n\t\t\tHandle<String> key = keys->Get(Integer::New(i))->ToString();\n\t\t\tHandle<Value> value = context->Global()->Get(key);\n\t\t\tif (value == context->Global()) {\n\t\t\t\tvalue = sandbox;\n\t\t\t}\n\t\t\tsandbox->Set(key, value);\n\t\t}\n\t}\n\n\tif (context_flag == newContext) {\n\t\t\/\/ Clean up, clean up, everybody everywhere!\n\t\tcontext->DetachGlobal();\n\t\tcontext->Exit();\n\t\tcontext.Dispose();\n\t} else if (context_flag == userContext) {\n\t\t\/\/ Exit the passed in context.\n\t\tcontext->Exit();\n\t}\n\n\treturn result == args.This() ? result : scope.Close(result);\n}\n\nvoid ScriptsModule::Initialize(Handle<Object> target)\n{\n\tHandleScope scope;\n\tWrappedContext::Initialize(target);\n\tWrappedScript::Initialize(target);\n}\n\nHandle<Object> ScriptsModule::WrapContext(Persistent<Context> context)\n{\n\treturn WrappedContext::WrapContext(context);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ test TH1::FindFirstBinAbove abd TH1::FindLastBinAbove\n\n#include \"gtest\/gtest.h\"\n\n#include \"TH1.h\"\n#include \"TH2.h\"\n#include \"TH3.h\"\n#include \"TRandomGen.h\"\n\nTH1 * h1 = nullptr;\nTH1 * h2 = nullptr;\nTH3 * h3 = nullptr;\n\nint n = 1000000;\ndouble value = 0.1*n; \n\nvoid CreateHist() {\n\n h3 = new TH3D(\"h3\",\"h3\",20,-5,5,20,-5,5,20,-5,5);\n\n TRandomMixMax r;\n for (int i = 0; i < 1000000; ++i) {\n double x = r.Gaus(0.,2);\n double y = r.Gaus(-3,1.5);\n double z = r.Gaus(2.,2.5);\n h3->Fill(x,y,z);\n }\n h3->SetBinContent(4,5,6,0.2*n);\n h3->SetBinContent(14,15,16,0.15*n);\n\n h2 = h3->Project3D(\"ZY\"); \/\/ Y will be the x axis of h2\n h1 = h3->Project3D(\"X\");\n\n}\n\nTEST(TH3, FindFirstBinAbove )\n{\n if (!h3) CreateHist();\n\n EXPECT_EQ( 4, h3->FindFirstBinAbove(value, 1, 1,10) );\n EXPECT_EQ( 14, h3->FindFirstBinAbove(value, 1, 11,20) );\n EXPECT_EQ( 5, h3->FindFirstBinAbove(value, 2) );\n EXPECT_EQ( 16, h3->FindFirstBinAbove(value, 3, 11,20) );\n\n}\n\nTEST(TH3, FindLastBinAbove )\n{\n if (!h3) CreateHist();\n\n EXPECT_EQ( 14, h3->FindLastBinAbove(value, 1) );\n EXPECT_EQ( 5, h3->FindLastBinAbove(value, 2,1,10) );\n EXPECT_EQ( 16, h3->FindLastBinAbove(value, 3) );\n EXPECT_EQ( 6, h3->FindLastBinAbove(value, 3, 1,10) );\n\n}\n\nTEST(TH2, FindFirstBinAbove )\n{\n if (!h2) CreateHist();\n\n EXPECT_EQ( 5, h2->FindFirstBinAbove(value, 1) );\n EXPECT_EQ( 15, h2->FindFirstBinAbove(value, 1,13,18) );\n EXPECT_EQ( 6, h2->FindFirstBinAbove(value, 2, 1,10) );\n EXPECT_EQ( 16, h2->FindFirstBinAbove(value, 2, 11,16) );\n}\n\nTEST(TH2, FindLastBinAbove )\n{\n if (!h2) CreateHist();\n\n EXPECT_EQ( 5, h2->FindLastBinAbove(value, 1,3,8) );\n EXPECT_EQ( 15, h2->FindLastBinAbove(value, 1) );\n EXPECT_EQ( 6, h2->FindLastBinAbove(value, 2, 1,10) );\n EXPECT_EQ( 16, h2->FindLastBinAbove(value, 2) );\n}\n\nTEST(TH1, FindFirstBinAbove )\n{\n if (!h1) CreateHist();\n\n EXPECT_EQ( 4, h1->FindFirstBinAbove(value, 1, 1, 20) );\n EXPECT_EQ( 14, h1->FindFirstBinAbove(value, 1,14,16) );\n}\n\nTEST(TH1, FindLastBinAbove )\n{\n if (!h1) CreateHist();\n\n EXPECT_EQ( 4, h1->FindLastBinAbove(value, 1,3,8) );\n EXPECT_EQ( 14, h1->FindLastBinAbove(value, 1, 0, 30) );\n}\n\n<commit_msg>fix a warning in test program<commit_after>\/\/ test TH1::FindFirstBinAbove abd TH1::FindLastBinAbove\n\n#include \"gtest\/gtest.h\"\n\n#include \"TH1.h\"\n#include \"TH2.h\"\n#include \"TH3.h\"\n#include \"TRandomGen.h\"\n\nTH1 * h1 = nullptr;\nTH1 * h2 = nullptr;\nTH3 * h3 = nullptr;\n\nint nentries = 1000000;\ndouble th_value = 0.1*nentries; \n\nvoid CreateHist() {\n\n h3 = new TH3D(\"h3\",\"h3\",20,-5,5,20,-5,5,20,-5,5);\n\n TRandomMixMax r;\n for (int i = 0; i < nentries; ++i) {\n double x = r.Gaus(0.,2);\n double y = r.Gaus(-3,1.5);\n double z = r.Gaus(2.,2.5);\n h3->Fill(x,y,z);\n }\n h3->SetBinContent(4,5,6, 2.*th_value);\n h3->SetBinContent(14,15,16, 1.5*th_value);\n\n h2 = h3->Project3D(\"ZY\"); \/\/ Y will be the x axis of h2\n h1 = h3->Project3D(\"X\");\n\n}\n\nTEST(TH3, FindFirstBinAbove )\n{\n if (!h3) CreateHist();\n\n EXPECT_EQ( 4, h3->FindFirstBinAbove(th_value, 1, 1,10) );\n EXPECT_EQ( 14, h3->FindFirstBinAbove(th_value, 1, 11,20) );\n EXPECT_EQ( 5, h3->FindFirstBinAbove(th_value, 2) );\n EXPECT_EQ( 16, h3->FindFirstBinAbove(th_value, 3, 11,20) );\n\n}\n\nTEST(TH3, FindLastBinAbove )\n{\n if (!h3) CreateHist();\n\n EXPECT_EQ( 14, h3->FindLastBinAbove(th_value, 1) );\n EXPECT_EQ( 5, h3->FindLastBinAbove(th_value, 2,1,10) );\n EXPECT_EQ( 16, h3->FindLastBinAbove(th_value, 3) );\n EXPECT_EQ( 6, h3->FindLastBinAbove(th_value, 3, 1,10) );\n\n}\n\nTEST(TH2, FindFirstBinAbove )\n{\n if (!h2) CreateHist();\n\n EXPECT_EQ( 5, h2->FindFirstBinAbove(th_value, 1) );\n EXPECT_EQ( 15, h2->FindFirstBinAbove(th_value, 1,13,18) );\n EXPECT_EQ( 6, h2->FindFirstBinAbove(th_value, 2, 1,10) );\n EXPECT_EQ( 16, h2->FindFirstBinAbove(th_value, 2, 11,16) );\n}\n\nTEST(TH2, FindLastBinAbove )\n{\n if (!h2) CreateHist();\n\n EXPECT_EQ( 5, h2->FindLastBinAbove(th_value, 1,3,8) );\n EXPECT_EQ( 15, h2->FindLastBinAbove(th_value, 1) );\n EXPECT_EQ( 6, h2->FindLastBinAbove(th_value, 2, 1,10) );\n EXPECT_EQ( 16, h2->FindLastBinAbove(th_value, 2) );\n}\n\nTEST(TH1, FindFirstBinAbove )\n{\n if (!h1) CreateHist();\n\n EXPECT_EQ( 4, h1->FindFirstBinAbove(th_value, 1, 1, 20) );\n EXPECT_EQ( 14, h1->FindFirstBinAbove(th_value, 1,14,16) );\n}\n\nTEST(TH1, FindLastBinAbove )\n{\n if (!h1) CreateHist();\n\n EXPECT_EQ( 4, h1->FindLastBinAbove(th_value, 1,3,8) );\n EXPECT_EQ( 14, h1->FindLastBinAbove(th_value, 1, 0, 30) );\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_STATEWRAPPER_H_\n#define LUWRA_STATEWRAPPER_H_\n\n#include \"common.hpp\"\n#include \"auxiliary.hpp\"\n#include \"tables.hpp\"\n\n#include <string>\n#include <utility>\n\nLUWRA_NS_BEGIN\n\n\/**\n * Wrapper for a Lua state\n *\/\nstruct StateWrapper: Table {\n\tState* state;\n\tbool close_state;\n\n\t\/**\n\t * Operate on a foreign state instance.\n\t *\/\n\tinline\n\tStateWrapper(State* state):\n\t\tTable(getGlobalsTable(state)),\n\t\tstate(state),\n\t\tclose_state(false)\n\t{}\n\n\t\/**\n\t * Create a new Lua state.\n\t *\/\n\tinline\n\tStateWrapper():\n\t\tTable(getGlobalsTable(luaL_newstate())),\n\t\tstate(ref.impl->state),\n\t\tclose_state(true)\n\t{}\n\n\tinline\n\t~StateWrapper() {\n\t\tif (close_state)\n\t\t\tlua_close(state);\n\t}\n\n\tinline\n\toperator State*() const {\n\t\treturn state;\n\t}\n\n\tinline\n\tvoid loadStandardLibrary() const {\n\t\tluaL_openlibs(state);\n\t}\n\n\t\/**\n\t * See [luwra::registerUserType](@ref luwra::registerUserType).\n\t *\/\n\ttemplate <typename Sig> inline\n\tvoid registerUserType(\n\t\tconst char* ctor_name,\n\t\tconst MemberMap& methods = MemberMap(),\n\t\tconst MemberMap& meta_methods = MemberMap()\n\t) const {\n\t\tluwra::registerUserType<Sig>(state, ctor_name, methods, meta_methods);\n\t}\n\n\t\/**\n\t * See [luwra::registerUserType](@ref luwra::registerUserType).\n\t *\/\n\ttemplate <typename UserType> inline\n\tvoid registerUserType(\n\t\tconst MemberMap& methods = MemberMap(),\n\t\tconst MemberMap& meta_methods = MemberMap()\n\t) const {\n\t\tluwra::registerUserType<UserType>(state, methods, meta_methods);\n\t}\n\n\t\/**\n\t * See [luwra::push](@ref luwra::push).\n\t *\/\n\ttemplate <typename Type> inline\n\tvoid push(Type&& value) const {\n\t\tluwra::push(state, std::forward<Type>(value));\n\t}\n\n\t\/**\n\t * See [luwra::push](@ref luwra::push).\n\t *\/\n\ttemplate <typename... Types> inline\n\tvoid push(Types&&... values) const {\n\t\tluwra::push(state, std::forward<Types>(values)...);\n\t}\n\n\t\/**\n\t * See [luwra::read](@ref luwra::read).\n\t *\/\n\ttemplate <typename Type> inline\n\tType read(int index) const {\n\t\treturn luwra::read<Type>(state, index);\n\t}\n\n\t\/**\n\t * See [luwra::apply](@ref luwra::apply).\n\t *\/\n\ttemplate <typename Callable, typename... ExtraArgs> inline\n\ttypename internal::CallableInfo<Callable>::ReturnType apply(\n\t\tint pos,\n\t\tCallable&& func,\n\t\tExtraArgs&&... args\n\t) const {\n\t\treturn luwra::apply(\n\t\t\tstate,\n\t\t\tpos,\n\t\t\tstd::forward<Callable>(func),\n\t\t\tstd::forward<ExtraArgs>(args)...\n\t\t);\n\t}\n\n\t\/**\n\t * See [luwra::map](@ref luwra::map).\n\t *\/\n\ttemplate <typename Callable, typename... ExtraArgs> inline\n\tsize_t map(int pos, Callable&& func, ExtraArgs&&... args) const {\n\t\treturn luwra::map(\n\t\t\tstate,\n\t\t\tpos,\n\t\t\tstd::forward<Callable>(func),\n\t\t\tstd::forward<ExtraArgs>(args)...\n\t\t);\n\t}\n\n\t\/**\n\t * See [luwra::equal](@ref luwra::equal).\n\t *\/\n\tbool equal(int index1, int index2) const {\n\t\treturn luwra::equal(state, index1, index2);\n\t}\n\n\t\/**\n\t * See [luwra::setMetatable](@ref luwra::setMetatable).\n\t *\/\n\tvoid setMetatable(const char* name) const {\n\t\tluwra::setMetatable(state, name);\n\t}\n\n\t\/**\n\t * Execute a piece of code.\n\t *\/\n\tinline\n\tint runString(const char* code) const {\n\t\treturn luaL_dostring(state, code);\n\t}\n\n\t\/**\n\t * Execute a file.\n\t *\/\n\tinline\n\tint runFile(const char* filepath) const {\n\t\treturn luaL_dofile(state, filepath);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<commit_msg>Fix StateWrapper::push<commit_after>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_STATEWRAPPER_H_\n#define LUWRA_STATEWRAPPER_H_\n\n#include \"common.hpp\"\n#include \"auxiliary.hpp\"\n#include \"tables.hpp\"\n\n#include <string>\n#include <utility>\n\nLUWRA_NS_BEGIN\n\n\/**\n * Wrapper for a Lua state\n *\/\nstruct StateWrapper: Table {\n\tState* state;\n\tbool close_state;\n\n\t\/**\n\t * Operate on a foreign state instance.\n\t *\/\n\tinline\n\tStateWrapper(State* state):\n\t\tTable(getGlobalsTable(state)),\n\t\tstate(state),\n\t\tclose_state(false)\n\t{}\n\n\t\/**\n\t * Create a new Lua state.\n\t *\/\n\tinline\n\tStateWrapper():\n\t\tTable(getGlobalsTable(luaL_newstate())),\n\t\tstate(ref.impl->state),\n\t\tclose_state(true)\n\t{}\n\n\tinline\n\t~StateWrapper() {\n\t\tif (close_state)\n\t\t\tlua_close(state);\n\t}\n\n\tinline\n\toperator State*() const {\n\t\treturn state;\n\t}\n\n\tinline\n\tvoid loadStandardLibrary() const {\n\t\tluaL_openlibs(state);\n\t}\n\n\t\/**\n\t * See [luwra::registerUserType](@ref luwra::registerUserType).\n\t *\/\n\ttemplate <typename Sig> inline\n\tvoid registerUserType(\n\t\tconst char* ctor_name,\n\t\tconst MemberMap& methods = MemberMap(),\n\t\tconst MemberMap& meta_methods = MemberMap()\n\t) const {\n\t\tluwra::registerUserType<Sig>(state, ctor_name, methods, meta_methods);\n\t}\n\n\t\/**\n\t * See [luwra::registerUserType](@ref luwra::registerUserType).\n\t *\/\n\ttemplate <typename UserType> inline\n\tvoid registerUserType(\n\t\tconst MemberMap& methods = MemberMap(),\n\t\tconst MemberMap& meta_methods = MemberMap()\n\t) const {\n\t\tluwra::registerUserType<UserType>(state, methods, meta_methods);\n\t}\n\n\t\/**\n\t * See [luwra::push](@ref luwra::push).\n\t *\/\n\ttemplate <typename Type> inline\n\tvoid push(Type&& value) const {\n\t\tluwra::push(state, std::forward<Type>(value));\n\t}\n\n\t\/**\n\t * See [luwra::push](@ref luwra::push).\n\t *\/\n\ttemplate <typename First, typename Second, typename... Rest> inline\n\tvoid push(First&& first, Second&& second, Rest&&... rest) const {\n\t\tluwra::push(\n\t\t\tstate,\n\t\t\tstd::forward<First>(first),\n\t\t\tstd::forward<Second>(second),\n\t\t\tstd::forward<Rest>(rest)...\n\t\t);\n\t}\n\n\t\/**\n\t * See [luwra::read](@ref luwra::read).\n\t *\/\n\ttemplate <typename Type> inline\n\tType read(int index) const {\n\t\treturn luwra::read<Type>(state, index);\n\t}\n\n\t\/**\n\t * See [luwra::apply](@ref luwra::apply).\n\t *\/\n\ttemplate <typename Callable, typename... ExtraArgs> inline\n\ttypename internal::CallableInfo<Callable>::ReturnType apply(\n\t\tint pos,\n\t\tCallable&& func,\n\t\tExtraArgs&&... args\n\t) const {\n\t\treturn luwra::apply(\n\t\t\tstate,\n\t\t\tpos,\n\t\t\tstd::forward<Callable>(func),\n\t\t\tstd::forward<ExtraArgs>(args)...\n\t\t);\n\t}\n\n\t\/**\n\t * See [luwra::map](@ref luwra::map).\n\t *\/\n\ttemplate <typename Callable, typename... ExtraArgs> inline\n\tsize_t map(int pos, Callable&& func, ExtraArgs&&... args) const {\n\t\treturn luwra::map(\n\t\t\tstate,\n\t\t\tpos,\n\t\t\tstd::forward<Callable>(func),\n\t\t\tstd::forward<ExtraArgs>(args)...\n\t\t);\n\t}\n\n\t\/**\n\t * See [luwra::equal](@ref luwra::equal).\n\t *\/\n\tbool equal(int index1, int index2) const {\n\t\treturn luwra::equal(state, index1, index2);\n\t}\n\n\t\/**\n\t * See [luwra::setMetatable](@ref luwra::setMetatable).\n\t *\/\n\tvoid setMetatable(const char* name) const {\n\t\tluwra::setMetatable(state, name);\n\t}\n\n\t\/**\n\t * Execute a piece of code.\n\t *\/\n\tinline\n\tint runString(const char* code) const {\n\t\treturn luaL_dostring(state, code);\n\t}\n\n\t\/**\n\t * Execute a file.\n\t *\/\n\tinline\n\tint runFile(const char* filepath) const {\n\t\treturn luaL_dofile(state, filepath);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"ctext.h\"\n#include <iostream>\n#include <string.h>\n#include <algorithm> \/\/ std::max\n\nusing namespace std;\n\nconst ctext_config config_default = {\n .m_buffer_size = CTEXT_DEFAULT_BUFFER_SIZE,\n .m_bounding_box = CTEXT_DEFAULT_BOUNDING_BOX,\n .m_do_wrap = CTEXT_DEFAULT_DO_WRAP,\n .m_append_top = CTEXT_DEFAULT_APPEND_TOP,\n .m_scroll_on_append = CTEXT_DEFAULT_SCROLL_ON_APPEND,\n .m_auto_newline = CTEXT_DEFAULT_AUTO_NEWLINE,\n .m_on_event = CTEXT_DEFAULT_ON_EVENT\n};\n\nctext::ctext(WINDOW *win, ctext_config *config)\n{\n this->m_win = win;\n \n if(config) \n {\n memcpy(&this->m_config, config, sizeof(ctext_config));\n } \n else \n {\n memcpy(&this->m_config, &config_default, sizeof(ctext_config));\n }\n\n this->m_pos_x = 0;\n this->m_pos_y = 0;\n\n this->m_max_x = 0;\n this->m_max_y = 0;\n\n \/\/ initialized the buffer with the empty row\n this->add_row();\n}\n\nint8_t ctext::set_config(ctext_config *config)\n{\n memcpy(&this->m_config, config, sizeof(ctext_config));\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_CONFIG);\n }\n\n return this->render();\n}\n\nint8_t ctext::get_config(ctext_config *config)\n{\n memcpy(config, &this->m_config, sizeof(ctext_config));\n return 0;\n}\n\nint8_t ctext::attach_curses_window(WINDOW *win)\n{\n this->m_win = win;\n return this->render();\n}\n\nint32_t ctext::putchar(int32_t c)\n{\n return this->printf(\"%c\", c);\n}\n\nint16_t ctext::clear(int16_t amount)\n{\n int16_t ret = 0;\n if(amount == 0) \n {\n ret = this->m_buffer.size();\n this->m_buffer.clear();\n }\n else\n {\n if(this->m_buffer.size()) \n {\n ret = this->m_buffer.size();\n this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.begin() + amount);\n ret -= this->m_buffer.size();\n }\n }\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_CLEAR);\n }\n\n \/\/ We do the same logic when removing content\n \/\/ .. perhaps forcing things down or upward\n if(this->m_config.m_scroll_on_append)\n {\n this->get_win_size();\n \/\/ now we force it.\n this->direct_scroll(0, this->m_buffer.size() - this->m_win_height);\n }\n\n this->render();\n return ret;\n}\n\nint8_t ctext::direct_scroll(int16_t x, int16_t y)\n{\n if(this->m_config.m_bounding_box) \n {\n x = max(0, (int32_t)x);\n y = max(0, (int32_t)y);\n x = min(x, (int16_t)(this->m_max_x - this->m_win_width));\n y = min(y, (int16_t)(this->m_max_y - this->m_win_height));\n }\n\n this->m_pos_x = x;\n this->m_pos_y = y;\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_SCROLL);\n }\n\n return 0;\n}\n\nint8_t ctext::scroll_to(int16_t x, int16_t y)\n{\n this->direct_scroll(x, y);\n return this->render();\n}\n\nint8_t ctext::get_offset(int16_t*x, int16_t*y)\n{\n *x = this->m_pos_x;\n *y = this->m_pos_y;\n\n return 0;\n}\n\nint8_t ctext::get_size(int16_t*x, int16_t*y)\n{\n *x = this->m_max_x;\n *y = this->m_max_y;\n\n return 0;\n}\n\nint16_t ctext::up(int16_t amount) \n{\n return this->down(-amount);\n}\n\nint16_t ctext::down(int16_t amount) \n{\n return this->scroll_to(this->m_pos_x, this->m_pos_y + amount);\n}\n\nint16_t ctext::left(int16_t amount) \n{\n return this->right(-amount);\n}\n\nint16_t ctext::right(int16_t amount) \n{\n return this->scroll_to(this->m_pos_x + amount, this->m_pos_y);\n}\n\nvoid ctext::get_win_size() \n{\n int32_t width = 0, height = 0;\n\n if(this->m_win)\n {\n getmaxyx(this->m_win, height, width);\n }\n this->m_win_width = width;\n this->m_win_height = height;\n}\n\nint8_t ctext::rebuf()\n{\n this->get_win_size();\n\n if(this->m_buffer.size() > this->m_config.m_buffer_size)\n {\n this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.end() - this->m_config.m_buffer_size);\n }\n \n this->m_max_x = 0; \n\n \/\/\n \/\/ Now unfortunately we have to do a scan over everything in N time to find\n \/\/ the maximum length string --- but only if we care about the bounding\n \/\/ box\n \/\/\n if(this->m_config.m_bounding_box)\n {\n for(ctext_buffer::const_iterator it = this->m_buffer.begin(); it != this->m_buffer.end(); it++) \n {\n this->m_max_x = max((int)this->m_max_x, (int)(*it).data.size());\n }\n }\n \n this->m_max_y = this->m_buffer.size();\n \n \/\/\n \/\/ Since we've changed the bounding box of the content we have to\n \/\/ issue a rescroll on exactly our previous parameters. This may\n \/\/ force us inward or may retain our position.\n \/\/ \n return this->direct_scroll(this->m_pos_x, this->m_pos_y);\n}\n\nvoid ctext::add_format_if_needed()\n{\n attr_t attrs; \n int16_t color_pair;\n\n if(!this->m_win) \n {\n return;\n }\n\n if(this->m_buffer.empty())\n {\n return;\n }\n\n \/\/ get the most current row.\n ctext_row p_row = this->m_buffer.back();\n\n ctext_format p_format = {0,0,0};\n if(!p_row.format.empty()) \n {\n \/\/ and the most current format\n p_format = p_row.format.back();\n } \n\n wattr_get(this->m_win, &attrs, &color_pair, 0);\n\n if(attrs != p_format.attrs || color_pair != p_format.color_pair)\n {\n \/\/ our properties have changed so we need to record this.\n ctext_format new_format = \n {\n \/\/ this is our offset\n .offset = (int32_t)p_row.data.size(),\n\n .attrs = attrs,\n .color_pair = color_pair\n };\n\n p_row.format.push_back(new_format);\n wattr_off(this->m_win, attrs, 0);\n }\n}\n\nvoid ctext::add_row()\n{\n ctext_row row;\n\n \/\/ if there is an exsting line, then\n \/\/ we carry over the format from the\n \/\/ last line..\n if(!this->m_buffer.empty())\n {\n ctext_row p_row = this->m_buffer.back();\n\n if(!p_row.format.empty()) \n {\n ctext_format p_format = p_row.format.back();\n\n \/\/ set the offset to the initial.\n p_format.offset = 0;\n row.format.push_back(p_format);\n }\n }\n\n row.data = wstring(L\"\");\n\n this->m_buffer.push_back(row);\n}\n\nint cprintf(ctext*win, const char *format, ...)\n{\n int ret;\n va_list args;\n va_start(args, format);\n ret = win->vprintf(format, args);\n va_end(args);\n return ret;\n}\n\nint8_t ctext::vprintf(const char*format, va_list ap)\n{\n int8_t ret;\n char *p_line;\n char large_buffer[CTEXT_BUFFER_SIZE] = {0};\n\n this->add_format_if_needed();\n ctext_row *p_row = &this->m_buffer.back();\n\n memset(large_buffer, 0, sizeof(large_buffer));\n vsnprintf(large_buffer, CTEXT_BUFFER_SIZE, format, ap);\n\n if(this->m_config.m_auto_newline && strlen(large_buffer) < (CTEXT_BUFFER_SIZE - 1))\n {\n sprintf(large_buffer + strlen(large_buffer), \"\\n\");\n }\n\n p_line = strtok(large_buffer, \"\\n\");\n if(p_line)\n {\n wstring wstr (p_line, p_line + strlen(p_line));\n p_row->data += wstr;\n }\n \/\/ this case is a single new line.\n else\n {\n this->add_row();\n }\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_DATA);\n }\n \n \/\/ Since we are adding content we need to see if we are\n \/\/ to force on scroll.\n if(this->m_config.m_scroll_on_append)\n {\n this->get_win_size();\n \/\/ now we force it.\n this->direct_scroll(0, this->m_buffer.size() - this->m_win_height);\n }\n\n ret = this->render();\n\n while(p_line)\n {\n p_line = strtok(0, \"\\n\");\n if(p_line)\n {\n \/\/ this means we have encountered a new line and must push our\n \/\/ buffer forward\n this->add_row();\n ret = this->printf(p_line);\n }\n }\n return ret;\n}\n\nint8_t ctext::printf(const char*format, ...)\n{\n int8_t ret;\n\n va_list args;\n va_start(args, format);\n ret = this->vprintf(format, args);\n\n va_end(args);\n return ret;\n}\n\nint8_t ctext::render() \n{\n \/\/ Calculate the bounds of everything first.\n this->rebuf();\n\n if(!this->m_win)\n {\n \/\/ Not doing anything without a window.\n return -1;\n }\n\n this->get_win_size();\n\n \/\/\n \/\/ By this time, if we are bounded by a box,\n \/\/ it has been accounted for.\n \/\/\n \/\/ Really our only point of interest is\n \/\/ whether we need to append to bottom\n \/\/ or append to top.\n \/\/\n \/\/ We will assume that we can\n \/\/ populate the window quick enough\n \/\/ to avoid linear updating or paging.\n \/\/ ... it's 2015 after all.\n \/\/\n werase(this->m_win);\n\n \/\/ Regardless of whether this is append to top\n \/\/ or bottom we generate top to bottom.\n\n int16_t start_char = max(0, (int32_t)this->m_pos_x);\n int16_t offset = start_char;\n \/\/ the endchar will be in the substr\n \n \/\/\n \/\/ We start as m_pos_y in our list and move up to\n \/\/ m_pos_y + m_win_height except in the case of \n \/\/ wrap around. Because of this special case,\n \/\/ we compute when to exit slightly differently.\n \/\/\n \/\/ This is the current line of output, which stays\n \/\/ below m_win_height\n \/\/\n int16_t line = 0;\n\n \/\/ start at the beginning of the buffer.\n int16_t index = this->m_pos_y;\n int16_t directionality = +1;\n int16_t cutoff;\n wstring to_add;\n ctext_row *source;\n vector<ctext_format>::iterator p_format;\n\n \/\/ if we are appending to the top then we start\n \/\/ at the end and change our directionality.\n if(this->m_config.m_append_top)\n {\n directionality = -1;\n index = this->m_pos_y + this->m_win_height - 1;\n }\n\n while(line <= this->m_win_height)\n {\n \/\/ Reset the offset.\n offset = start_char;\n\n if((index < this->m_max_y) && (index >= 0))\n {\n cutoff = this->m_win_width;\n\n \/\/ We only index into the object if we have the\n \/\/ data to do so.\n source = &this->m_buffer[index];\n p_format = (*source).format.begin();\n\n if(offset < (*source).data.size())\n {\n to_add = (*source).data.substr(offset, cutoff);\n }\n else\n {\n to_add = wstring(L\"\");\n }\n mvwaddwstr(this->m_win, line, 0, to_add.c_str());\n\n \/\/ if we are wrapping, then we do that here.\n while(\n this->m_config.m_do_wrap && \n\n \/\/ if our string still exhausts our entire width\n to_add.size() == this->m_win_width &&\n\n \/\/ and we haven't hit the bottom\n line <= this->m_win_height\n )\n {\n \/\/ move our line forward\n line++;\n\n \/\/ and the start_char\n offset += this->m_win_width;\n\n \/\/ substring into this character now at this advanced position\n to_add = this->m_buffer[index].data.substr(offset, this->m_win_width);\n \n \/\/ and add it to the screen\n mvwaddwstr(this->m_win, line, 0, to_add.c_str());\n }\n }\n index += directionality;\n line++;\n }\n\n wrefresh(this->m_win);\n}\n<commit_msg>rewriting the rendering engine<commit_after>#include \"ctext.h\"\n#include <iostream>\n#include <string.h>\n#include <algorithm> \/\/ std::max\n\nusing namespace std;\n\nconst ctext_config config_default = {\n .m_buffer_size = CTEXT_DEFAULT_BUFFER_SIZE,\n .m_bounding_box = CTEXT_DEFAULT_BOUNDING_BOX,\n .m_do_wrap = CTEXT_DEFAULT_DO_WRAP,\n .m_append_top = CTEXT_DEFAULT_APPEND_TOP,\n .m_scroll_on_append = CTEXT_DEFAULT_SCROLL_ON_APPEND,\n .m_auto_newline = CTEXT_DEFAULT_AUTO_NEWLINE,\n .m_on_event = CTEXT_DEFAULT_ON_EVENT\n};\n\nctext::ctext(WINDOW *win, ctext_config *config)\n{\n this->m_win = win;\n \n if(config) \n {\n memcpy(&this->m_config, config, sizeof(ctext_config));\n } \n else \n {\n memcpy(&this->m_config, &config_default, sizeof(ctext_config));\n }\n\n this->m_pos_x = 0;\n this->m_pos_y = 0;\n\n this->m_max_x = 0;\n this->m_max_y = 0;\n\n \/\/ initialized the buffer with the empty row\n this->add_row();\n}\n\nint8_t ctext::set_config(ctext_config *config)\n{\n memcpy(&this->m_config, config, sizeof(ctext_config));\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_CONFIG);\n }\n\n return this->render();\n}\n\nint8_t ctext::get_config(ctext_config *config)\n{\n memcpy(config, &this->m_config, sizeof(ctext_config));\n return 0;\n}\n\nint8_t ctext::attach_curses_window(WINDOW *win)\n{\n this->m_win = win;\n return this->render();\n}\n\nint32_t ctext::putchar(int32_t c)\n{\n return this->printf(\"%c\", c);\n}\n\nint16_t ctext::clear(int16_t amount)\n{\n int16_t ret = 0;\n if(amount == 0) \n {\n ret = this->m_buffer.size();\n this->m_buffer.clear();\n }\n else\n {\n if(this->m_buffer.size()) \n {\n ret = this->m_buffer.size();\n this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.begin() + amount);\n ret -= this->m_buffer.size();\n }\n }\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_CLEAR);\n }\n\n \/\/ We do the same logic when removing content\n \/\/ .. perhaps forcing things down or upward\n if(this->m_config.m_scroll_on_append)\n {\n this->get_win_size();\n \/\/ now we force it.\n this->direct_scroll(0, this->m_buffer.size() - this->m_win_height);\n }\n\n this->render();\n return ret;\n}\n\nint8_t ctext::direct_scroll(int16_t x, int16_t y)\n{\n if(this->m_config.m_bounding_box) \n {\n x = max(0, (int32_t)x);\n y = max(0, (int32_t)y);\n x = min(x, (int16_t)(this->m_max_x - this->m_win_width));\n y = min(y, (int16_t)(this->m_max_y - this->m_win_height));\n }\n\n this->m_pos_x = x;\n this->m_pos_y = y;\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_SCROLL);\n }\n\n return 0;\n}\n\nint8_t ctext::scroll_to(int16_t x, int16_t y)\n{\n this->direct_scroll(x, y);\n return this->render();\n}\n\nint8_t ctext::get_offset(int16_t*x, int16_t*y)\n{\n *x = this->m_pos_x;\n *y = this->m_pos_y;\n\n return 0;\n}\n\nint8_t ctext::get_size(int16_t*x, int16_t*y)\n{\n *x = this->m_max_x;\n *y = this->m_max_y;\n\n return 0;\n}\n\nint16_t ctext::up(int16_t amount) \n{\n return this->down(-amount);\n}\n\nint16_t ctext::down(int16_t amount) \n{\n return this->scroll_to(this->m_pos_x, this->m_pos_y + amount);\n}\n\nint16_t ctext::left(int16_t amount) \n{\n return this->right(-amount);\n}\n\nint16_t ctext::right(int16_t amount) \n{\n return this->scroll_to(this->m_pos_x + amount, this->m_pos_y);\n}\n\nvoid ctext::get_win_size() \n{\n int32_t width = 0, height = 0;\n\n if(this->m_win)\n {\n getmaxyx(this->m_win, height, width);\n }\n this->m_win_width = width;\n this->m_win_height = height;\n}\n\nint8_t ctext::rebuf()\n{\n this->get_win_size();\n\n if(this->m_buffer.size() > this->m_config.m_buffer_size)\n {\n this->m_buffer.erase(this->m_buffer.begin(), this->m_buffer.end() - this->m_config.m_buffer_size);\n }\n \n this->m_max_x = 0; \n\n \/\/\n \/\/ Now unfortunately we have to do a scan over everything in N time to find\n \/\/ the maximum length string --- but only if we care about the bounding\n \/\/ box\n \/\/\n if(this->m_config.m_bounding_box)\n {\n for(ctext_buffer::const_iterator it = this->m_buffer.begin(); it != this->m_buffer.end(); it++) \n {\n this->m_max_x = max((int)this->m_max_x, (int)(*it).data.size());\n }\n }\n \n this->m_max_y = this->m_buffer.size();\n \n \/\/\n \/\/ Since we've changed the bounding box of the content we have to\n \/\/ issue a rescroll on exactly our previous parameters. This may\n \/\/ force us inward or may retain our position.\n \/\/ \n return this->direct_scroll(this->m_pos_x, this->m_pos_y);\n}\n\nvoid ctext::add_format_if_needed()\n{\n attr_t attrs; \n int16_t color_pair;\n\n if(!this->m_win) \n {\n return;\n }\n\n if(this->m_buffer.empty())\n {\n return;\n }\n\n \/\/ get the most current row.\n ctext_row *p_row = &this->m_buffer.back();\n\n ctext_format p_format = {0,0,0};\n if(!p_row->format.empty()) \n {\n \/\/ and the most current format\n p_format = p_row->format.back();\n } \n\n wattr_get(this->m_win, &attrs, &color_pair, 0);\n\n if(attrs != p_format.attrs || color_pair != p_format.color_pair)\n {\n \/\/ our properties have changed so we need to record this.\n ctext_format new_format = \n {\n \/\/ this is our offset\n .offset = (int32_t)p_row->data.size(),\n\n .attrs = attrs,\n .color_pair = color_pair\n };\n\n p_row->format.push_back(new_format);\n wattr_off(this->m_win, attrs, 0);\n }\n}\n\nvoid ctext::add_row()\n{\n ctext_row row;\n\n \/\/ if there is an exsting line, then\n \/\/ we carry over the format from the\n \/\/ last line..\n if(!this->m_buffer.empty())\n {\n ctext_row p_row = this->m_buffer.back();\n\n if(!p_row.format.empty()) \n {\n ctext_format p_format = p_row.format.back();\n\n \/\/ set the offset to the initial.\n p_format.offset = 0;\n row.format.push_back(p_format);\n }\n }\n\n row.data = wstring(L\"\");\n\n this->m_buffer.push_back(row);\n}\n\nint cprintf(ctext*win, const char *format, ...)\n{\n int ret;\n va_list args;\n va_start(args, format);\n ret = win->vprintf(format, args);\n va_end(args);\n return ret;\n}\n\nint8_t ctext::vprintf(const char*format, va_list ap)\n{\n int8_t ret;\n char *p_line;\n char large_buffer[CTEXT_BUFFER_SIZE] = {0};\n\n this->add_format_if_needed();\n ctext_row *p_row = &this->m_buffer.back();\n\n memset(large_buffer, 0, sizeof(large_buffer));\n vsnprintf(large_buffer, CTEXT_BUFFER_SIZE, format, ap);\n\n if(this->m_config.m_auto_newline && strlen(large_buffer) < (CTEXT_BUFFER_SIZE - 1))\n {\n sprintf(large_buffer + strlen(large_buffer), \"\\n\");\n }\n\n p_line = strtok(large_buffer, \"\\n\");\n if(p_line)\n {\n wstring wstr (p_line, p_line + strlen(p_line));\n p_row->data += wstr;\n }\n \/\/ this case is a single new line.\n else\n {\n this->add_row();\n }\n\n if (this->m_config.m_on_event)\n {\n this->m_config.m_on_event(this, CTEXT_DATA);\n }\n \n \/\/ Since we are adding content we need to see if we are\n \/\/ to force on scroll.\n if(this->m_config.m_scroll_on_append)\n {\n this->get_win_size();\n \/\/ now we force it.\n this->direct_scroll(0, this->m_buffer.size() - this->m_win_height);\n }\n\n ret = this->render();\n\n while(p_line)\n {\n p_line = strtok(0, \"\\n\");\n if(p_line)\n {\n \/\/ this means we have encountered a new line and must push our\n \/\/ buffer forward\n this->add_row();\n ret = this->printf(p_line);\n }\n }\n return ret;\n}\n\nint8_t ctext::printf(const char*format, ...)\n{\n int8_t ret;\n\n va_list args;\n va_start(args, format);\n ret = this->vprintf(format, args);\n\n va_end(args);\n return ret;\n}\n\nint8_t ctext::render() \n{\n \/\/ Calculate the bounds of everything first.\n this->rebuf();\n\n if(!this->m_win)\n {\n \/\/ Not doing anything without a window.\n return -1;\n }\n\n this->get_win_size();\n\n \/\/\n \/\/ By this time, if we are bounded by a box,\n \/\/ it has been accounted for.\n \/\/\n \/\/ Really our only point of interest is\n \/\/ whether we need to append to bottom\n \/\/ or append to top.\n \/\/\n \/\/ We will assume that we can\n \/\/ populate the window quick enough\n \/\/ to avoid linear updating or paging.\n \/\/ ... it's 2015 after all.\n \/\/\n werase(this->m_win);\n\n \/\/ Regardless of whether this is append to top\n \/\/ or bottom we generate top to bottom.\n\n int16_t start_char = max(0, (int32_t)this->m_pos_x);\n int16_t buf_offset = start_char;\n \/\/ the endchar will be in the substr\n \n \/\/\n \/\/ We start as m_pos_y in our list and move up to\n \/\/ m_pos_y + m_win_height except in the case of \n \/\/ wrap around. Because of this special case,\n \/\/ we compute when to exit slightly differently.\n \/\/\n \/\/ This is the current line of output, which stays\n \/\/ below m_win_height\n \/\/\n int16_t line = 0;\n\n \/\/ start at the beginning of the buffer.\n int16_t index = this->m_pos_y;\n int16_t directionality = +1;\n int16_t cutoff;\n int16_t num_added = 0;\n int16_t win_offset = 0;\n bool b_format = false;\n wstring to_add;\n ctext_row *p_source;\n vector<ctext_format>::iterator p_format;\n\n \/\/ if we are appending to the top then we start\n \/\/ at the end and change our directionality.\n if(this->m_config.m_append_top)\n {\n directionality = -1;\n index = this->m_pos_y + this->m_win_height - 1;\n }\n\n while(line <= this->m_win_height)\n {\n if((index < this->m_max_y) && (index >= 0))\n {\n \/\/ We only index into the object if we have the\n \/\/ data to do so.\n p_source = &this->m_buffer[index];\n p_format = p_source->format.begin();\n\n \/\/ Reset the offset.\n win_offset = 0;\n buf_offset = start_char;\n\n for(;;) \n {\n \/\/ our initial cutoff is the remainder of window space\n \/\/ - our start\n cutoff = this->m_win_width - win_offset;\n b_format = false;\n\n \/\/ if we have a format to account for and we haven't yet,\n if(!p_source->format.empty() && p_format->offset >= buf_offset)\n {\n \/\/ then we add it \n wattr_on(this->m_win, p_format->color_pair, 0);\n\n \/\/ and tell ourselves below that we've done this.\n b_format = true;\n\n \/\/ see if there's another cutoff point\n if(p_format != p_source->format.end())\n {\n \/\/ if it's before our newline then we'll have to do something\n \/\/ with with that.\n \/\/\n \/\/ The first one is the characters we are to print this time,\n \/\/ the second is how many characters we would have asked for\n \/\/ if there was no format specified.\n cutoff = min((p_format + 1)->offset - buf_offset, (int32_t)cutoff); \n }\n }\n\n \/\/ if we can get that many characters than we grab them\n \/\/ otherwise we do the empty string\n to_add = (buf_offset < p_source->data.size()) ?\n p_source->data.substr(buf_offset, cutoff) :\n wstring(L\"\");\n\n mvwaddwstr(this->m_win, line, win_offset, to_add.c_str());\n\n \/\/ this is the number of characters we've placed into\n \/\/ the window.\n num_added = to_add.size();\n\n \/\/ See if we need to reset our format\n if(b_format) \n {\n \/\/ If the amount of data we tried to grab is less than\n \/\/ the width of the window - win_offset then we know to\n \/\/ turn off our attributes\n wattr_off(this->m_win, p_format->color_pair, 0);\n\n \/\/ and push our format forward if necessary\n if( p_format != p_source->format.end() &&\n (p_format + 1)->offset >= (buf_offset + num_added) \n )\n {\n p_format ++;\n }\n }\n\n \/\/ if we are at the end of the string, we break out\n if(p_source->data.size() == buf_offset + num_added)\n {\n break;\n }\n\n \/\/ otherwise, move win_offset forward\n win_offset += num_added;\n \n \/\/ otherwise, if we are wrapping, then we do that here.\n if(win_offset == this->m_win_width)\n {\n \/\/ if we've hit the vertical bottom\n \/\/ of our window then we break out\n \/\/ of this\n \/\/\n \/\/ otherwise if we are not wrapping then\n \/\/ we also break out of this\n if(line == this->m_win_height || !this->m_config.m_do_wrap )\n {\n break;\n }\n\n \/\/ otherwise move our line forward\n line++;\n\n \/\/ and the offset by the \n \/\/ number of characters we just added\n buf_offset += num_added;\n\n \/\/ we reset the win_offset back to its\n \/\/ initial state\n win_offset = 0;\n\n \/\/ and we loop again.\n }\n }\n }\n index += directionality;\n line++;\n }\n\n wrefresh(this->m_win);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_TYPES_H_\n#define LUWRA_TYPES_H_\n\n#include \"common.hpp\"\n\n#include <utility>\n#include <tuple>\n#include <string>\n#include <type_traits>\n#include <limits>\n\nLUWRA_NS_BEGIN\n\n\/* Lua types *\/\nusing Integer = lua_Integer;\nusing Number = lua_Number;\nusing State = lua_State;\nusing CFunction = lua_CFunction;\n\n\/**\n * A value on the stack\n *\/\ntemplate <typename T>\nstruct Value {\n\tstatic_assert(sizeof(T) == -1, \"You must not use an unspecialized version of Value\");\n\n\t\/**\n\t * Retrieve the value at position `n`.\n\t *\/\n\tstatic\n\tT Read(State*, int);\n\n\t\/**\n\t * Push the value onto the stack.\n\t *\/\n\tstatic\n\tint Push(State*, T);\n};\n\n\/**\n * Convenient wrapped for `Value<T>::push`.\n *\/\ntemplate <typename T> static inline\nint Push(State* state, T value) {\n\treturn Value<T>::Push(state, value);\n}\n\n\/**\n * Define a template specialization of `Value` for `type` with a `retrf(State*, int)` which\n * extracts it from the stack and a `pushf(State*, type)` which pushes the value on the stack again.\n * This assumes that only one value will be pushed onto the stack.\n *\/\n#define LUWRA_DEF_VALUE(type, retrf, pushf) \\\n\ttemplate <> \\\n\tstruct Value<type> { \\\n\t\tstatic inline \\\n\t\ttype Read(State* state, int n) { \\\n\t\t\treturn retrf(state, n); \\\n\t\t} \\\n \\\n\t\tstatic inline \\\n\t\tint Push(State* state, type value) { \\\n\t\t\tpushf(state, value); \\\n\t\t\treturn 1; \\\n\t\t} \\\n\t}\n\n#ifndef luaL_checkboolean\n\t\/**\n\t * Check if the value at index `n` is a boolean and retrieve its value.\n\t *\/\n\t#define luaL_checkboolean(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TBOOLEAN), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_pushstdstring\n\t\/**\n\t * Push a `std::string` as string onto the stack.\n\t *\/\n\t#define luaL_pushstdstring(state, stdstring) \\\n\t\t(lua_pushstring(state, stdstring.c_str()))\n#endif\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct NumericTransportValue;\n\n\t\/\/ Transport unit `Integer`\n\ttemplate <>\n\tstruct NumericTransportValue<Integer> {\n\t\tstatic inline\n\t\tInteger Read(State* state, int index) {\n\t\t\treturn luaL_checkinteger(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, Integer value) {\n\t\t\tlua_pushinteger(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Transport unit `Number`\n\ttemplate <>\n\tstruct NumericTransportValue<Number> {\n\t\tstatic inline\n\t\tNumber Read(State* state, int index) {\n\t\t\treturn luaL_checknumber(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, Number value) {\n\t\t\tlua_pushnumber(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is smaller\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericContainedValueBase {\n\t\tstatic constexpr\n\t\tbool Qualifies =\n\t\t\tstd::numeric_limits<I>::max() < std::numeric_limits<B>::max()\n\t\t\t&& std::numeric_limits<I>::min() > std::numeric_limits<B>::min();\n\n\t\tstatic inline\n\t\tI Read(State* state, int index) {\n\t\t\treturn\n\t\t\t\tstd::max<B>(\n\t\t\t\t\tstd::numeric_limits<I>::min(),\n\t\t\t\t\tstd::min<B>(\n\t\t\t\t\t\tstd::numeric_limits<I>::max(),\n\t\t\t\t\t\tNumericTransportValue<B>::Read(state, index)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, I value) {\n\t\t\tPush(state, static_cast<B>(value));\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is bigger\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericTruncatingValueBase {\n\t\tstatic inline\n\t\tI Read(State* state, int index) {\n\t\t\treturn static_cast<I>(NumericTransportValue<B>::Read(state, index));\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State*, I) {\n\t\t\tstatic_assert(\n\t\t\t\tsizeof(I) == -1,\n\t\t\t\t\"You shold not use 'Value<I>::Push' specializations which inherit from NumericTruncatingValueBase\"\n\t\t\t);\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit\n\ttemplate <typename I, typename B>\n\tusing NumericValueBase =\n\t\ttypename std::conditional<\n\t\t\tstd::is_same<I, B>::value,\n\t\t\tNumericTransportValue<B>,\n\t\t\ttypename std::conditional<\n\t\t\t\tNumericContainedValueBase<I, B>::Qualifies,\n\t\t\t\tNumericContainedValueBase<I, B>,\n\t\t\t\tNumericTruncatingValueBase<I, B>\n\t\t\t>::type\n\t\t>::type;\n}\n\n\/**\n * Define an integral type which will be transported via `base`.\n *\/\n#define LUWRA_DEF_NUMERIC(base, type) \\\n\ttemplate <> \\\n\tstruct Value<type>: internal::NumericValueBase<type, base> {};\n\n\/\/ Lua-dependent types\nLUWRA_DEF_NUMERIC(Number, float)\nLUWRA_DEF_NUMERIC(Number, double)\nLUWRA_DEF_NUMERIC(Number, long double)\n\n\/\/ Integral types\nLUWRA_DEF_NUMERIC(Integer, signed short)\nLUWRA_DEF_NUMERIC(Integer, unsigned short)\nLUWRA_DEF_NUMERIC(Integer, signed int)\nLUWRA_DEF_NUMERIC(Integer, unsigned int)\nLUWRA_DEF_NUMERIC(Integer, signed long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long int)\nLUWRA_DEF_NUMERIC(Integer, signed long long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long long int)\n\n\/\/ C\/C++ types\nLUWRA_DEF_VALUE(bool, luaL_checkboolean, lua_pushboolean);\nLUWRA_DEF_VALUE(const char*, luaL_checkstring, lua_pushstring);\nLUWRA_DEF_VALUE(std::string, luaL_checkstring, luaL_pushstdstring);\n\n\/\/ Do not export these macros\n#undef LUWRA_DEF_VALUE\n#undef LUWRA_DEF_NUMERIC\n\n\/**\n * An arbitrary value on an execution stack.\n * Note: this value is only available as long as it exists on its originating stack.\n *\/\nstruct Arbitrary {\n\tState* state;\n\tint index;\n};\n\ntemplate <>\nstruct Value<Arbitrary> {\n\tstatic inline\n\tArbitrary Read(State* state, int index) {\n\t\tif (index < 0)\n\t\t\tindex = lua_gettop(state) + (index + 1);\n\n\t\treturn Arbitrary {state, index};\n\t}\n\n\tstatic inline\n\tint Push(State* state, const Arbitrary& value) {\n\t\tlua_pushvalue(value.state, value.index);\n\n\t\tif (value.state != state)\n\t\t\tlua_xmove(value.state, state, 1);\n\n\t\treturn 1;\n\t}\n};\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct StackPusher;\n\n\ttemplate <size_t I>\n\tstruct StackPusher<std::index_sequence<I>> {\n\t\ttemplate <typename T> static inline\n\t\tint Push(State* state, const T& package) {\n\t\t\t\/\/ return Value<typename std::tuple_element<I, T>::type>::Push(state, std::get<I>(package));\n\t\t\treturn Push(state, std::get<I>(package));\n\t\t}\n\t};\n\n\ttemplate <size_t I, size_t... Is>\n\tstruct StackPusher<std::index_sequence<I, Is...>> {\n\t\ttemplate <typename T> static inline\n\t\tint Push(State* state, const T& package) {\n\t\t\t\/\/ int r = Value<typename std::tuple_element<I, T>::type>::Push(\n\t\t\t\/\/ \tstate,\n\t\t\t\/\/ \tstd::get<I>(package)\n\t\t\t\/\/ );\n\n\t\t\tint r = Push(state, std::get<I>(package));\n\n\t\t\treturn std::max(0, r) + StackPusher<std::index_sequence<Is...>>::Push(state, package);\n\t\t}\n\t};\n}\n\n\/**\n * Allows you to use multiple return values.\n *\/\ntemplate <typename... A>\nstruct Value<std::tuple<A...>> {\n\tstatic inline\n\tstd::tuple<A...> Read(State*, int) {\n\t\tstatic_assert(sizeof(std::tuple<A...>) == -1, \"std::tuples cannot be read from the stack\");\n\t}\n\n\tstatic inline\n\tint Push(State* state, const std::tuple<A...>& value) {\n\t\treturn internal::StackPusher<std::make_index_sequence<sizeof...(A)>>::Push(state, value);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<commit_msg>Allow CFunctions to be pushed<commit_after>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_TYPES_H_\n#define LUWRA_TYPES_H_\n\n#include \"common.hpp\"\n\n#include <utility>\n#include <tuple>\n#include <string>\n#include <type_traits>\n#include <limits>\n\nLUWRA_NS_BEGIN\n\n\/* Lua types *\/\nusing Integer = lua_Integer;\nusing Number = lua_Number;\nusing State = lua_State;\nusing CFunction = lua_CFunction;\n\n\/**\n * A value on the stack\n *\/\ntemplate <typename T>\nstruct Value {\n\tstatic_assert(sizeof(T) == -1, \"You must not use an unspecialized version of Value\");\n\n\t\/**\n\t * Retrieve the value at position `n`.\n\t *\/\n\tstatic\n\tT Read(State*, int);\n\n\t\/**\n\t * Push the value onto the stack.\n\t *\/\n\tstatic\n\tint Push(State*, T);\n};\n\n\/**\n * Convenient wrapped for `Value<T>::push`.\n *\/\ntemplate <typename T> static inline\nint Push(State* state, T value) {\n\treturn Value<T>::Push(state, value);\n}\n\n\/**\n * Define a template specialization of `Value` for `type` with a `retrf(State*, int)` which\n * extracts it from the stack and a `pushf(State*, type)` which pushes the value on the stack again.\n * This assumes that only one value will be pushed onto the stack.\n *\/\n#define LUWRA_DEF_VALUE(type, retrf, pushf) \\\n\ttemplate <> \\\n\tstruct Value<type> { \\\n\t\tstatic inline \\\n\t\ttype Read(State* state, int n) { \\\n\t\t\treturn retrf(state, n); \\\n\t\t} \\\n \\\n\t\tstatic inline \\\n\t\tint Push(State* state, type value) { \\\n\t\t\tpushf(state, value); \\\n\t\t\treturn 1; \\\n\t\t} \\\n\t}\n\n#ifndef luaL_checkboolean\n\t\/**\n\t * Check if the value at index `n` is a boolean and retrieve its value.\n\t *\/\n\t#define luaL_checkboolean(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TBOOLEAN), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_checkcfunction\n\t\/**\n\t * Check if the value at index `n` is a C function and retrieve it.\n\t *\/\n\t#define luaL_checkcfunction(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TCFUNCTION), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_pushstdstring\n\t\/**\n\t * Push a `std::string` as string onto the stack.\n\t *\/\n\t#define luaL_pushstdstring(state, stdstring) \\\n\t\t(lua_pushstring(state, stdstring.c_str()))\n#endif\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct NumericTransportValue;\n\n\t\/\/ Transport unit `Integer`\n\ttemplate <>\n\tstruct NumericTransportValue<Integer> {\n\t\tstatic inline\n\t\tInteger Read(State* state, int index) {\n\t\t\treturn luaL_checkinteger(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, Integer value) {\n\t\t\tlua_pushinteger(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Transport unit `Number`\n\ttemplate <>\n\tstruct NumericTransportValue<Number> {\n\t\tstatic inline\n\t\tNumber Read(State* state, int index) {\n\t\t\treturn luaL_checknumber(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, Number value) {\n\t\t\tlua_pushnumber(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is smaller\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericContainedValueBase {\n\t\tstatic constexpr\n\t\tbool Qualifies =\n\t\t\tstd::numeric_limits<I>::max() < std::numeric_limits<B>::max()\n\t\t\t&& std::numeric_limits<I>::min() > std::numeric_limits<B>::min();\n\n\t\tstatic inline\n\t\tI Read(State* state, int index) {\n\t\t\treturn\n\t\t\t\tstd::max<B>(\n\t\t\t\t\tstd::numeric_limits<I>::min(),\n\t\t\t\t\tstd::min<B>(\n\t\t\t\t\t\tstd::numeric_limits<I>::max(),\n\t\t\t\t\t\tNumericTransportValue<B>::Read(state, index)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State* state, I value) {\n\t\t\tPush(state, static_cast<B>(value));\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is bigger\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericTruncatingValueBase {\n\t\tstatic inline\n\t\tI Read(State* state, int index) {\n\t\t\treturn static_cast<I>(NumericTransportValue<B>::Read(state, index));\n\t\t}\n\n\t\tstatic inline\n\t\tint Push(State*, I) {\n\t\t\tstatic_assert(\n\t\t\t\tsizeof(I) == -1,\n\t\t\t\t\"You shold not use 'Value<I>::Push' specializations which inherit from NumericTruncatingValueBase\"\n\t\t\t);\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit\n\ttemplate <typename I, typename B>\n\tusing NumericValueBase =\n\t\ttypename std::conditional<\n\t\t\tstd::is_same<I, B>::value,\n\t\t\tNumericTransportValue<B>,\n\t\t\ttypename std::conditional<\n\t\t\t\tNumericContainedValueBase<I, B>::Qualifies,\n\t\t\t\tNumericContainedValueBase<I, B>,\n\t\t\t\tNumericTruncatingValueBase<I, B>\n\t\t\t>::type\n\t\t>::type;\n}\n\n\/**\n * Define an integral type which will be transported via `base`.\n *\/\n#define LUWRA_DEF_NUMERIC(base, type) \\\n\ttemplate <> \\\n\tstruct Value<type>: internal::NumericValueBase<type, base> {};\n\n\/\/ Lua-dependent types\nLUWRA_DEF_NUMERIC(Number, float)\nLUWRA_DEF_NUMERIC(Number, double)\nLUWRA_DEF_NUMERIC(Number, long double)\n\n\/\/ Integral types\nLUWRA_DEF_NUMERIC(Integer, signed short)\nLUWRA_DEF_NUMERIC(Integer, unsigned short)\nLUWRA_DEF_NUMERIC(Integer, signed int)\nLUWRA_DEF_NUMERIC(Integer, unsigned int)\nLUWRA_DEF_NUMERIC(Integer, signed long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long int)\nLUWRA_DEF_NUMERIC(Integer, signed long long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long long int)\n\n\/\/ C\/C++ types\nLUWRA_DEF_VALUE(bool, luaL_checkboolean, lua_pushboolean);\nLUWRA_DEF_VALUE(const char*, luaL_checkstring, lua_pushstring);\nLUWRA_DEF_VALUE(std::string, luaL_checkstring, luaL_pushstdstring);\n\n\/\/ Do not export these macros\n#undef LUWRA_DEF_VALUE\n#undef LUWRA_DEF_NUMERIC\n\ntemplate <>\nstruct Value<CFunction> {\n\tstatic inline\n\tint Push(State* state, CFunction fun) {\n\t\tlua_pushcfunction(state, fun);\n\t\treturn 1;\n\t}\n};\n\n\/**\n * An arbitrary value on an execution stack.\n * Note: this value is only available as long as it exists on its originating stack.\n *\/\nstruct Arbitrary {\n\tState* state;\n\tint index;\n};\n\ntemplate <>\nstruct Value<Arbitrary> {\n\tstatic inline\n\tArbitrary Read(State* state, int index) {\n\t\tif (index < 0)\n\t\t\tindex = lua_gettop(state) + (index + 1);\n\n\t\treturn Arbitrary {state, index};\n\t}\n\n\tstatic inline\n\tint Push(State* state, const Arbitrary& value) {\n\t\tlua_pushvalue(value.state, value.index);\n\n\t\tif (value.state != state)\n\t\t\tlua_xmove(value.state, state, 1);\n\n\t\treturn 1;\n\t}\n};\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct StackPusher;\n\n\ttemplate <size_t I>\n\tstruct StackPusher<std::index_sequence<I>> {\n\t\ttemplate <typename T> static inline\n\t\tint Push(State* state, const T& package) {\n\t\t\t\/\/ return Value<typename std::tuple_element<I, T>::type>::Push(state, std::get<I>(package));\n\t\t\treturn Push(state, std::get<I>(package));\n\t\t}\n\t};\n\n\ttemplate <size_t I, size_t... Is>\n\tstruct StackPusher<std::index_sequence<I, Is...>> {\n\t\ttemplate <typename T> static inline\n\t\tint Push(State* state, const T& package) {\n\t\t\t\/\/ int r = Value<typename std::tuple_element<I, T>::type>::Push(\n\t\t\t\/\/ \tstate,\n\t\t\t\/\/ \tstd::get<I>(package)\n\t\t\t\/\/ );\n\n\t\t\tint r = Push(state, std::get<I>(package));\n\n\t\t\treturn std::max(0, r) + StackPusher<std::index_sequence<Is...>>::Push(state, package);\n\t\t}\n\t};\n}\n\n\/**\n * Allows you to use multiple return values.\n *\/\ntemplate <typename... A>\nstruct Value<std::tuple<A...>> {\n\tstatic inline\n\tstd::tuple<A...> Read(State*, int) {\n\t\tstatic_assert(sizeof(std::tuple<A...>) == -1, \"std::tuples cannot be read from the stack\");\n\t}\n\n\tstatic inline\n\tint Push(State* state, const std::tuple<A...>& value) {\n\t\treturn internal::StackPusher<std::make_index_sequence<sizeof...(A)>>::Push(state, value);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_TYPES_H_\n#define LUWRA_TYPES_H_\n\n#include \"common.hpp\"\n\n#include <utility>\n#include <tuple>\n#include <string>\n#include <type_traits>\n#include <limits>\n\nLUWRA_NS_BEGIN\n\n\/* Lua types *\/\nusing Integer = lua_Integer;\nusing Number = lua_Number;\nusing State = lua_State;\nusing CFunction = lua_CFunction;\n\n\/**\n * A value on the stack\n *\/\ntemplate <typename T>\nstruct Value {\n\tstatic_assert(sizeof(T) == -1, \"You must not use an unspecialized version of Value\");\n\n\t\/**\n\t * Retrieve the value at position `n`.\n\t *\/\n\tstatic\n\tT read(State*, int);\n\n\t\/**\n\t * push the value onto the stack.\n\t *\/\n\tstatic\n\tint push(State*, T);\n};\n\n\/**\n * Convenient wrapped for `Value<T>::push`.\n *\/\ntemplate <typename T> static inline\nint push(State* state, T value) {\n\treturn Value<T>::push(state, value);\n}\n\n\/**\n * Define a template specialization of `Value` for `type` with a `retrf(State*, int)` which\n * extracts it from the stack and a `pushf(State*, type)` which pushes the value on the stack again.\n * This assumes that only one value will be pushed onto the stack.\n *\/\n#define LUWRA_DEF_VALUE(type, retrf, pushf) \\\n\ttemplate <> \\\n\tstruct Value<type> { \\\n\t\tstatic inline \\\n\t\ttype read(State* state, int n) { \\\n\t\t\treturn retrf(state, n); \\\n\t\t} \\\n \\\n\t\tstatic inline \\\n\t\tint push(State* state, type value) { \\\n\t\t\tpushf(state, value); \\\n\t\t\treturn 1; \\\n\t\t} \\\n\t}\n\n#ifndef luaL_checkboolean\n\t\/**\n\t * Check if the value at index `n` is a boolean and retrieve its value.\n\t *\/\n\t#define luaL_checkboolean(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TBOOLEAN), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_checkcfunction\n\t\/**\n\t * Check if the value at index `n` is a C function and retrieve it.\n\t *\/\n\t#define luaL_checkcfunction(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TCFUNCTION), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_pushstdstring\n\t\/**\n\t * push a `std::string` as string onto the stack.\n\t *\/\n\t#define luaL_pushstdstring(state, stdstring) \\\n\t\t(lua_pushstring(state, (stdstring).c_str()))\n#endif\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct NumericTransportValue;\n\n\t\/\/ Transport unit `Integer`\n\ttemplate <>\n\tstruct NumericTransportValue<Integer> {\n\t\tstatic inline\n\t\tInteger read(State* state, int index) {\n\t\t\treturn luaL_checkinteger(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, Integer value) {\n\t\t\tlua_pushinteger(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Transport unit `Number`\n\ttemplate <>\n\tstruct NumericTransportValue<Number> {\n\t\tstatic inline\n\t\tNumber read(State* state, int index) {\n\t\t\treturn luaL_checknumber(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, Number value) {\n\t\t\tlua_pushnumber(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is smaller\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericContainedValueBase {\n\t\tstatic constexpr\n\t\tbool qualifies =\n\t\t\t\/\/ TODO: Remove warning about comparsion between signed and unsigned integers\n\t\t\tstd::numeric_limits<I>::max() <= std::numeric_limits<B>::max()\n\t\t\t&& std::numeric_limits<I>::lowest() >= std::numeric_limits<B>::lowest();\n\n\t\tstatic inline\n\t\tI read(State* state, int index) {\n\t\t\treturn\n\t\t\t\tstd::max<B>(\n\t\t\t\t\tstd::numeric_limits<I>::lowest(),\n\t\t\t\t\tstd::min<B>(\n\t\t\t\t\t\tstd::numeric_limits<I>::max(),\n\t\t\t\t\t\tNumericTransportValue<B>::read(state, index)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, I value) {\n\t\t\tNumericTransportValue<B>::push(state, static_cast<B>(value));\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is bigger\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericTruncatingValueBase {\n\t\tstatic inline\n\t\tI read(State* state, int index) {\n\t\t\treturn static_cast<I>(NumericTransportValue<B>::read(state, index));\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State*, I) {\n\t\t\tstatic_assert(\n\t\t\t\tsizeof(I) == -1,\n\t\t\t\t\"You must not use 'Value<I>::push' specializations which inherit from NumericTruncatingValueBase\"\n\t\t\t);\n\n\t\t\treturn -1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit\n\ttemplate <typename I, typename B>\n\tusing NumericValueBase =\n\t\ttypename std::conditional<\n\t\t\tstd::is_same<I, B>::value,\n\t\t\tNumericTransportValue<B>,\n\t\t\ttypename std::conditional<\n\t\t\t\tNumericContainedValueBase<I, B>::qualifies,\n\t\t\t\tNumericContainedValueBase<I, B>,\n\t\t\t\tNumericTruncatingValueBase<I, B>\n\t\t\t>::type\n\t\t>::type;\n}\n\n\/**\n * Define an integral type which will be transported via `base`.\n *\/\n#define LUWRA_DEF_NUMERIC(base, type) \\\n\ttemplate <> \\\n\tstruct Value<type>: internal::NumericValueBase<type, base> {};\n\n\/\/ Lua-dependent types\nLUWRA_DEF_NUMERIC(Number, float)\nLUWRA_DEF_NUMERIC(Number, double)\nLUWRA_DEF_NUMERIC(Number, long double)\n\n\/\/ Integral types\nLUWRA_DEF_NUMERIC(Integer, signed short)\nLUWRA_DEF_NUMERIC(Integer, unsigned short)\nLUWRA_DEF_NUMERIC(Integer, signed int)\nLUWRA_DEF_NUMERIC(Integer, unsigned int)\nLUWRA_DEF_NUMERIC(Integer, signed long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long int)\nLUWRA_DEF_NUMERIC(Integer, signed long long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long long int)\n\n\/\/ C\/C++ types\nLUWRA_DEF_VALUE(bool, luaL_checkboolean, lua_pushboolean);\nLUWRA_DEF_VALUE(const char*, luaL_checkstring, lua_pushstring);\nLUWRA_DEF_VALUE(std::string, luaL_checkstring, luaL_pushstdstring);\n\n\/\/ Do not export these macros\n#undef LUWRA_DEF_VALUE\n#undef LUWRA_DEF_NUMERIC\n\n\/**\n * C Functions may be pushed aswell.\n *\/\ntemplate <>\nstruct Value<CFunction> {\n\tstatic inline\n\tint push(State* state, CFunction fun) {\n\t\tlua_pushcfunction(state, fun);\n\t\treturn 1;\n\t}\n};\n\n\/**\n * An arbitrary value on an execution stack.\n * Note: this value is only available as long as it exists on its originating stack.\n *\/\nstruct Arbitrary {\n\tState* state;\n\tint index;\n};\n\ntemplate <>\nstruct Value<Arbitrary> {\n\tstatic inline\n\tArbitrary read(State* state, int index) {\n\t\tif (index < 0)\n\t\t\tindex = lua_gettop(state) + (index + 1);\n\n\t\treturn Arbitrary {state, index};\n\t}\n\n\tstatic inline\n\tint push(State* state, const Arbitrary& value) {\n\t\tlua_pushvalue(value.state, value.index);\n\n\t\tif (value.state != state)\n\t\t\tlua_xmove(value.state, state, 1);\n\n\t\treturn 1;\n\t}\n};\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct Stackpusher;\n\n\ttemplate <size_t I>\n\tstruct Stackpusher<std::index_sequence<I>> {\n\t\ttemplate <typename T> static inline\n\t\tint push(State* state, const T& package) {\n\t\t\treturn push(state, std::get<I>(package));\n\t\t}\n\t};\n\n\ttemplate <size_t I, size_t... Is>\n\tstruct Stackpusher<std::index_sequence<I, Is...>> {\n\t\ttemplate <typename T> static inline\n\t\tint push(State* state, const T& package) {\n\t\t\tint r = push(state, std::get<I>(package));\n\t\t\treturn std::max(0, r) + Stackpusher<std::index_sequence<Is...>>::push(state, package);\n\t\t}\n\t};\n}\n\n\/**\n * Allows you to use multiple return values.\n *\/\ntemplate <typename... A>\nstruct Value<std::tuple<A...>> {\n\tstatic inline\n\tint push(State* state, const std::tuple<A...>& value) {\n\t\treturn internal::Stackpusher<std::make_index_sequence<sizeof...(A)>>::push(state, value);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<commit_msg>Make pushing std::tuples easier<commit_after>\/* Luwra\n * Minimal-overhead Lua wrapper for C++\n *\n * Copyright (C) 2015, Ole Krüger <ole@vprsm.de>\n *\/\n\n#ifndef LUWRA_TYPES_H_\n#define LUWRA_TYPES_H_\n\n#include \"common.hpp\"\n\n#include <utility>\n#include <tuple>\n#include <string>\n#include <type_traits>\n#include <limits>\n\nLUWRA_NS_BEGIN\n\n\/* Lua types *\/\nusing Integer = lua_Integer;\nusing Number = lua_Number;\nusing State = lua_State;\nusing CFunction = lua_CFunction;\n\n\/**\n * A value on the stack\n *\/\ntemplate <typename T>\nstruct Value {\n\tstatic_assert(sizeof(T) == -1, \"You must not use an unspecialized version of Value\");\n\n\t\/**\n\t * Retrieve the value at position `n`.\n\t *\/\n\tstatic\n\tT read(State*, int);\n\n\t\/**\n\t * push the value onto the stack.\n\t *\/\n\tstatic\n\tint push(State*, T);\n};\n\n\/**\n * Convenient wrapped for `Value<T>::push`.\n *\/\ntemplate <typename T> static inline\nint push(State* state, T value) {\n\treturn Value<T>::push(state, value);\n}\n\n\/**\n * Define a template specialization of `Value` for `type` with a `retrf(State*, int)` which\n * extracts it from the stack and a `pushf(State*, type)` which pushes the value on the stack again.\n * This assumes that only one value will be pushed onto the stack.\n *\/\n#define LUWRA_DEF_VALUE(type, retrf, pushf) \\\n\ttemplate <> \\\n\tstruct Value<type> { \\\n\t\tstatic inline \\\n\t\ttype read(State* state, int n) { \\\n\t\t\treturn retrf(state, n); \\\n\t\t} \\\n \\\n\t\tstatic inline \\\n\t\tint push(State* state, type value) { \\\n\t\t\tpushf(state, value); \\\n\t\t\treturn 1; \\\n\t\t} \\\n\t}\n\n#ifndef luaL_checkboolean\n\t\/**\n\t * Check if the value at index `n` is a boolean and retrieve its value.\n\t *\/\n\t#define luaL_checkboolean(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TBOOLEAN), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_checkcfunction\n\t\/**\n\t * Check if the value at index `n` is a C function and retrieve it.\n\t *\/\n\t#define luaL_checkcfunction(state, n) \\\n\t\t(luaL_checktype(state, n, LUA_TCFUNCTION), lua_toboolean(state, n))\n#endif\n\n#ifndef luaL_pushstdstring\n\t\/**\n\t * push a `std::string` as string onto the stack.\n\t *\/\n\t#define luaL_pushstdstring(state, stdstring) \\\n\t\t(lua_pushstring(state, (stdstring).c_str()))\n#endif\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct NumericTransportValue;\n\n\t\/\/ Transport unit `Integer`\n\ttemplate <>\n\tstruct NumericTransportValue<Integer> {\n\t\tstatic inline\n\t\tInteger read(State* state, int index) {\n\t\t\treturn luaL_checkinteger(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, Integer value) {\n\t\t\tlua_pushinteger(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Transport unit `Number`\n\ttemplate <>\n\tstruct NumericTransportValue<Number> {\n\t\tstatic inline\n\t\tNumber read(State* state, int index) {\n\t\t\treturn luaL_checknumber(state, index);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, Number value) {\n\t\t\tlua_pushnumber(state, value);\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is smaller\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericContainedValueBase {\n\t\tstatic constexpr\n\t\tbool qualifies =\n\t\t\t\/\/ TODO: Remove warning about comparsion between signed and unsigned integers\n\t\t\tstd::numeric_limits<I>::max() <= std::numeric_limits<B>::max()\n\t\t\t&& std::numeric_limits<I>::lowest() >= std::numeric_limits<B>::lowest();\n\n\t\tstatic inline\n\t\tI read(State* state, int index) {\n\t\t\treturn\n\t\t\t\tstd::max<B>(\n\t\t\t\t\tstd::numeric_limits<I>::lowest(),\n\t\t\t\t\tstd::min<B>(\n\t\t\t\t\t\tstd::numeric_limits<I>::max(),\n\t\t\t\t\t\tNumericTransportValue<B>::read(state, index)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State* state, I value) {\n\t\t\tNumericTransportValue<B>::push(state, static_cast<B>(value));\n\t\t\treturn 1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit, where `I` is bigger\n\t\/\/ than `B`.\n\ttemplate <typename I, typename B>\n\tstruct NumericTruncatingValueBase {\n\t\tstatic inline\n\t\tI read(State* state, int index) {\n\t\t\treturn static_cast<I>(NumericTransportValue<B>::read(state, index));\n\t\t}\n\n\t\tstatic inline\n\t\tint push(State*, I) {\n\t\t\tstatic_assert(\n\t\t\t\tsizeof(I) == -1,\n\t\t\t\t\"You must not use 'Value<I>::push' specializations which inherit from NumericTruncatingValueBase\"\n\t\t\t);\n\n\t\t\treturn -1;\n\t\t}\n\t};\n\n\t\/\/ Base for `Value<I>` specializations which uses `B` as transport unit\n\ttemplate <typename I, typename B>\n\tusing NumericValueBase =\n\t\ttypename std::conditional<\n\t\t\tstd::is_same<I, B>::value,\n\t\t\tNumericTransportValue<B>,\n\t\t\ttypename std::conditional<\n\t\t\t\tNumericContainedValueBase<I, B>::qualifies,\n\t\t\t\tNumericContainedValueBase<I, B>,\n\t\t\t\tNumericTruncatingValueBase<I, B>\n\t\t\t>::type\n\t\t>::type;\n}\n\n\/**\n * Define an integral type which will be transported via `base`.\n *\/\n#define LUWRA_DEF_NUMERIC(base, type) \\\n\ttemplate <> \\\n\tstruct Value<type>: internal::NumericValueBase<type, base> {};\n\n\/\/ Lua-dependent types\nLUWRA_DEF_NUMERIC(Number, float)\nLUWRA_DEF_NUMERIC(Number, double)\nLUWRA_DEF_NUMERIC(Number, long double)\n\n\/\/ Integral types\nLUWRA_DEF_NUMERIC(Integer, signed short)\nLUWRA_DEF_NUMERIC(Integer, unsigned short)\nLUWRA_DEF_NUMERIC(Integer, signed int)\nLUWRA_DEF_NUMERIC(Integer, unsigned int)\nLUWRA_DEF_NUMERIC(Integer, signed long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long int)\nLUWRA_DEF_NUMERIC(Integer, signed long long int)\nLUWRA_DEF_NUMERIC(Integer, unsigned long long int)\n\n\/\/ C\/C++ types\nLUWRA_DEF_VALUE(bool, luaL_checkboolean, lua_pushboolean);\nLUWRA_DEF_VALUE(const char*, luaL_checkstring, lua_pushstring);\nLUWRA_DEF_VALUE(std::string, luaL_checkstring, luaL_pushstdstring);\n\n\/\/ Do not export these macros\n#undef LUWRA_DEF_VALUE\n#undef LUWRA_DEF_NUMERIC\n\n\/**\n * C Functions may be pushed aswell.\n *\/\ntemplate <>\nstruct Value<CFunction> {\n\tstatic inline\n\tint push(State* state, CFunction fun) {\n\t\tlua_pushcfunction(state, fun);\n\t\treturn 1;\n\t}\n};\n\n\/**\n * An arbitrary value on an execution stack.\n * Note: this value is only available as long as it exists on its originating stack.\n *\/\nstruct Arbitrary {\n\tState* state;\n\tint index;\n};\n\ntemplate <>\nstruct Value<Arbitrary> {\n\tstatic inline\n\tArbitrary read(State* state, int index) {\n\t\tif (index < 0)\n\t\t\tindex = lua_gettop(state) + (index + 1);\n\n\t\treturn Arbitrary {state, index};\n\t}\n\n\tstatic inline\n\tint push(State* state, const Arbitrary& value) {\n\t\tlua_pushvalue(value.state, value.index);\n\n\t\tif (value.state != state)\n\t\t\tlua_xmove(value.state, state, 1);\n\n\t\treturn 1;\n\t}\n};\n\nnamespace internal {\n\ttemplate <typename>\n\tstruct StackPusher;\n\n\ttemplate <size_t I>\n\tstruct StackPusher<std::index_sequence<I>> {\n\t\ttemplate <typename... T> static inline\n\t\tint push(State* state, const std::tuple<T...>& package) {\n\t\t\tusing R = typename std::tuple_element<I, std::tuple<T...>>::type;\n\t\t\treturn std::max(0, Value<R>::push(state, std::get<I>(package)));\n\t\t}\n\t};\n\n\ttemplate <size_t I, size_t... Is>\n\tstruct StackPusher<std::index_sequence<I, Is...>> {\n\t\ttemplate <typename... T> static inline\n\t\tint push(State* state, const std::tuple<T...>& package) {\n\t\t\treturn\n\t\t\t\tStackPusher<std::index_sequence<I>>::push(state, package)\n\t\t\t\t+ StackPusher<std::index_sequence<Is...>>::push(state, package);\n\t\t}\n\t};\n}\n\n\/**\n * Allows you to use multiple return values.\n *\/\ntemplate <typename... A>\nstruct Value<std::tuple<A...>> {\n\tstatic inline\n\tint push(State* state, const std::tuple<A...>& value) {\n\t\treturn internal::StackPusher<std::make_index_sequence<sizeof...(A)>>::push(state, value);\n\t}\n};\n\nLUWRA_NS_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: NPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Netscape Public License\n * Version 1.1 (the \"License\"); you may not use this file except in\n * compliance with the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/NPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Mozilla Communicator client code.\n *\n * The Initial Developer of the Original Code is \n * Netscape Communications Corporation.\n * Portions created by the Initial Developer are Copyright (C) 1998\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or \n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the NPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the NPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\n#include \"nscore.h\"\n#include \"npapi.h\"\n#include \"npupp.h\"\n\n\/\/\\\\\/\/ DEFINE\n#define NP_EXPORT\n\n\/\/\\\\\/\/ GLOBAL DATA\nNPNetscapeFuncs* g_pNavigatorFuncs = 0;\nJRIGlobalRef Private_GetJavaClass(void);\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ Private_GetJavaClass (global function)\n\/\/\n\/\/\tGiven a Java class reference (thru NPP_GetJavaClass) inform JRT\n\/\/\tof this class existence\n\/\/\nJRIGlobalRef\nPrivate_GetJavaClass(void)\n{\n jref clazz = NPP_GetJavaClass();\n if (clazz) {\n\t\tJRIEnv* env = NPN_GetJavaEnv();\n\t\treturn JRI_NewGlobalRef(env, clazz);\n }\n return NULL;\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/\t\t\t\t\t\tPLUGIN DLL entry points \n\/\/\n\/\/ These are the Windows specific DLL entry points. They must be exoprted\n\/\/\n\n\/\/ we need these to be global since we have to fill one of its field\n\/\/ with a data (class) which requires knowlwdge of the navigator\n\/\/ jump-table. This jump table is known at Initialize time (NP_Initialize)\n\/\/ which is called after NP_GetEntryPoint\nstatic NPPluginFuncs* g_pluginFuncs;\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_GetEntryPoints\n\/\/\n\/\/\tfills in the func table used by Navigator to call entry points in\n\/\/ plugin DLL. Note that these entry points ensure that DS is loaded\n\/\/ by using the NP_LOADDS macro, when compiling for Win16\n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT\n#endif\nNP_GetEntryPoints(NPPluginFuncs* pFuncs)\n{\n \/\/ trap a NULL ptr \n if(pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n \/\/ if the plugin's function table is smaller than the plugin expects,\n \/\/ then they are incompatible, and should return an error \n\n pFuncs->version = (NP_VERSION_MAJOR << 8) | NP_VERSION_MINOR;\n pFuncs->newp = NPP_New;\n pFuncs->destroy = NPP_Destroy;\n pFuncs->setwindow = NPP_SetWindow;\n pFuncs->newstream = NPP_NewStream;\n pFuncs->destroystream = NPP_DestroyStream;\n pFuncs->asfile = NPP_StreamAsFile;\n pFuncs->writeready = NPP_WriteReady;\n pFuncs->write = NPP_Write;\n pFuncs->print = NPP_Print;\n pFuncs->getvalue\t = NPP_GetValue;\n pFuncs->event = 0; \/\/\/ reserved \n\n\tg_pluginFuncs\t\t = pFuncs;\n\n return NPERR_NO_ERROR;\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_Initialize\n\/\/\n\/\/\tcalled immediately after the plugin DLL is loaded\n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT \n#endif\nNP_Initialize(NPNetscapeFuncs* pFuncs)\n{\n \/\/ trap a NULL ptr \n if(pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n g_pNavigatorFuncs = pFuncs; \/\/ save it for future reference \n\n \/\/ if the plugin's major ver level is lower than the Navigator's,\n \/\/ then they are incompatible, and should return an error \n if(HIBYTE(pFuncs->version) > NP_VERSION_MAJOR)\n return NPERR_INCOMPATIBLE_VERSION_ERROR;\n\n\t\/\/ We have to defer these assignments until g_pNavigatorFuncs is set\n int navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\tg_pluginFuncs->urlnotify = NPP_URLNotify;\n\t}\n\t\n\tif( navMinorVers >= NPVERS_HAS_LIVECONNECT ) {\n\t\tg_pluginFuncs->javaClass = Private_GetJavaClass();\n\t}\n\n\t\/\/ NPP_Initialize is a standard (cross-platform) initialize function.\n return NPP_Initialize();\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_Shutdown\n\/\/\n\/\/\tcalled immediately before the plugin DLL is unloaded.\n\/\/\tThis functio shuold check for some ref count on the dll to see if it is\n\/\/\tunloadable or it needs to stay in memory. \n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT \n#endif\nNP_Shutdown()\n{\n NPP_Shutdown();\n g_pNavigatorFuncs = NULL;\n return NPERR_NO_ERROR;\n}\n\n\/\/\t\t\t\t\t\tEND - PLUGIN DLL entry points \n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\n\/* NAVIGATOR Entry points *\/\n\n\/* These entry points expect to be called from within the plugin. The\n noteworthy assumption is that DS has already been set to point to the\n plugin's DLL data segment. Don't call these functions from outside\n the plugin without ensuring DS is set to the DLLs data segment first,\n typically using the NP_LOADDS macro\n*\/\n\n\/* returns the major\/minor version numbers of the Plugin API for the plugin\n and the Navigator\n*\/\nvoid NPN_Version(int* plugin_major, int* plugin_minor, int* netscape_major, int* netscape_minor)\n{\n *plugin_major = NP_VERSION_MAJOR;\n *plugin_minor = NP_VERSION_MINOR;\n *netscape_major = HIBYTE(g_pNavigatorFuncs->version);\n *netscape_minor = LOBYTE(g_pNavigatorFuncs->version);\n}\n\nNPError NPN_GetValue(NPP instance, NPNVariable variable, void *result)\n{\n return g_pNavigatorFuncs->getvalue(instance, variable, result);\n}\n\n\n\/* causes the specified URL to be fetched and streamed in\n*\/\nNPError NPN_GetURLNotify(NPP instance, const char *url, const char *target, void* notifyData)\n\n{\n\tint navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\terr = g_pNavigatorFuncs->geturlnotify(instance, url, target, notifyData);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\nNPError NPN_GetURL(NPP instance, const char *url, const char *target)\n{\n return g_pNavigatorFuncs->geturl(instance, url, target);\n}\n\nNPError NPN_PostURLNotify(NPP instance, const char* url, const char* window, uint32 len, const char* buf, NPBool file, void* notifyData)\n{\n\tint navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\terr = g_pNavigatorFuncs->posturlnotify(instance, url, window, len, buf, file, notifyData);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\nNPError NPN_PostURL(NPP instance, const char* url, const char* window, uint32 len, const char* buf, NPBool file)\n{\n return g_pNavigatorFuncs->posturl(instance, url, window, len, buf, file);\n}\n\n\/* Requests that a number of bytes be provided on a stream. Typically\n this would be used if a stream was in \"pull\" mode. An optional\n position can be provided for streams which are seekable.\n*\/\nNPError NPN_RequestRead(NPStream* stream, NPByteRange* rangeList)\n{\n return g_pNavigatorFuncs->requestread(stream, rangeList);\n}\n\n\/* Creates a new stream of data from the plug-in to be interpreted\n by Netscape in the current window.\n*\/\nNPError NPN_NewStream(NPP instance, NPMIMEType type, \n\t\t\t\t\t\t\t\tconst char* target, NPStream** stream)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\terr = g_pNavigatorFuncs->newstream(instance, type, target, stream);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\/* Provides len bytes of data.\n*\/\nint32 NPN_Write(NPP instance, NPStream *stream,\n int32 len, void *buffer)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tint32 result;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\tresult = g_pNavigatorFuncs->write(instance, stream, len, buffer);\n\t}\n\telse {\n\t\tresult = -1;\n\t}\n\treturn result;\n}\n\n\/* Closes a stream object. \nreason indicates why the stream was closed.\n*\/\nNPError NPN_DestroyStream(NPP instance, NPStream* stream, NPError reason)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\terr = g_pNavigatorFuncs->destroystream(instance, stream, reason);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\/* Provides a text status message in the Netscape client user interface\n*\/\nvoid NPN_Status(NPP instance, const char *message)\n{\n g_pNavigatorFuncs->status(instance, message);\n}\n\n\/* returns the user agent string of Navigator, which contains version info\n*\/\nconst char* NPN_UserAgent(NPP instance)\n{\n return g_pNavigatorFuncs->uagent(instance);\n}\n\n\/* allocates memory from the Navigator's memory space. Necessary so that\n saved instance data may be freed by Navigator when exiting.\n*\/\n\n\nvoid* NPN_MemAlloc(uint32 size)\n{\n return g_pNavigatorFuncs->memalloc(size);\n}\n\n\/* reciprocal of MemAlloc() above\n*\/\nvoid NPN_MemFree(void* ptr)\n{\n g_pNavigatorFuncs->memfree(ptr);\n}\n\n\/* private function to Netscape. do not use!\n*\/\nvoid NPN_ReloadPlugins(NPBool reloadPages)\n{\n g_pNavigatorFuncs->reloadplugins(reloadPages);\n}\n\nJRIEnv* NPN_GetJavaEnv(void)\n{\n\treturn g_pNavigatorFuncs->getJavaEnv();\n}\n\njref NPN_GetJavaPeer(NPP instance)\n{\n\treturn g_pNavigatorFuncs->getJavaPeer(instance);\n}\n\n<commit_msg><commit_after>\/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- *\/\n\/* ***** BEGIN LICENSE BLOCK *****\n * Version: NPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Netscape Public License\n * Version 1.1 (the \"License\"); you may not use this file except in\n * compliance with the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/NPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Mozilla Communicator client code.\n *\n * The Initial Developer of the Original Code is \n * Netscape Communications Corporation.\n * Portions created by the Initial Developer are Copyright (C) 1998\n * the Initial Developer. All Rights Reserved.\n *\n * Contributor(s):\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or \n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the NPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the NPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\n#include \"config.h\"\n\n#ifdef HAVE_MOZILLA_CONFIG_H\n# include <mozilla-config.h>\n#endif\n\n#include \"nscore.h\"\n#include \"npapi.h\"\n#include \"npupp.h\"\n\n\/\/\\\\\/\/ DEFINE\n#define NP_EXPORT\n\n\/\/\\\\\/\/ GLOBAL DATA\nNPNetscapeFuncs* g_pNavigatorFuncs = 0;\nJRIGlobalRef Private_GetJavaClass(void);\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ Private_GetJavaClass (global function)\n\/\/\n\/\/\tGiven a Java class reference (thru NPP_GetJavaClass) inform JRT\n\/\/\tof this class existence\n\/\/\nJRIGlobalRef\nPrivate_GetJavaClass(void)\n{\n jref clazz = NPP_GetJavaClass();\n if (clazz) {\n\t\tJRIEnv* env = NPN_GetJavaEnv();\n\t\treturn JRI_NewGlobalRef(env, clazz);\n }\n return NULL;\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/\t\t\t\t\t\tPLUGIN DLL entry points \n\/\/\n\/\/ These are the Windows specific DLL entry points. They must be exoprted\n\/\/\n\n\/\/ we need these to be global since we have to fill one of its field\n\/\/ with a data (class) which requires knowlwdge of the navigator\n\/\/ jump-table. This jump table is known at Initialize time (NP_Initialize)\n\/\/ which is called after NP_GetEntryPoint\nstatic NPPluginFuncs* g_pluginFuncs;\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_GetEntryPoints\n\/\/\n\/\/\tfills in the func table used by Navigator to call entry points in\n\/\/ plugin DLL. Note that these entry points ensure that DS is loaded\n\/\/ by using the NP_LOADDS macro, when compiling for Win16\n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT\n#endif\nNP_GetEntryPoints(NPPluginFuncs* pFuncs)\n{\n \/\/ trap a NULL ptr \n if(pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n \/\/ if the plugin's function table is smaller than the plugin expects,\n \/\/ then they are incompatible, and should return an error \n\n pFuncs->version = (NP_VERSION_MAJOR << 8) | NP_VERSION_MINOR;\n pFuncs->newp = NPP_New;\n pFuncs->destroy = NPP_Destroy;\n pFuncs->setwindow = NPP_SetWindow;\n pFuncs->newstream = NPP_NewStream;\n pFuncs->destroystream = NPP_DestroyStream;\n pFuncs->asfile = NPP_StreamAsFile;\n pFuncs->writeready = NPP_WriteReady;\n pFuncs->write = NPP_Write;\n pFuncs->print = NPP_Print;\n pFuncs->getvalue\t = NPP_GetValue;\n pFuncs->event = 0; \/\/\/ reserved \n\n\tg_pluginFuncs\t\t = pFuncs;\n\n return NPERR_NO_ERROR;\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_Initialize\n\/\/\n\/\/\tcalled immediately after the plugin DLL is loaded\n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT \n#endif\nNP_Initialize(NPNetscapeFuncs* pFuncs)\n{\n \/\/ trap a NULL ptr \n if(pFuncs == NULL)\n return NPERR_INVALID_FUNCTABLE_ERROR;\n\n g_pNavigatorFuncs = pFuncs; \/\/ save it for future reference \n\n \/\/ if the plugin's major ver level is lower than the Navigator's,\n \/\/ then they are incompatible, and should return an error \n if(HIBYTE(pFuncs->version) > NP_VERSION_MAJOR)\n return NPERR_INCOMPATIBLE_VERSION_ERROR;\n\n\t\/\/ We have to defer these assignments until g_pNavigatorFuncs is set\n int navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\tg_pluginFuncs->urlnotify = NPP_URLNotify;\n\t}\n\t\n\tif( navMinorVers >= NPVERS_HAS_LIVECONNECT ) {\n\t\tg_pluginFuncs->javaClass = Private_GetJavaClass();\n\t}\n\n\t\/\/ NPP_Initialize is a standard (cross-platform) initialize function.\n return NPP_Initialize();\n}\n\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/ NP_Shutdown\n\/\/\n\/\/\tcalled immediately before the plugin DLL is unloaded.\n\/\/\tThis functio shuold check for some ref count on the dll to see if it is\n\/\/\tunloadable or it needs to stay in memory. \n\/\/\n#ifdef __MINGW32__\nextern \"C\" __declspec(dllexport) NPError WINAPI\n#else\nNPError WINAPI NP_EXPORT \n#endif\nNP_Shutdown()\n{\n NPP_Shutdown();\n g_pNavigatorFuncs = NULL;\n return NPERR_NO_ERROR;\n}\n\n\/\/\t\t\t\t\t\tEND - PLUGIN DLL entry points \n\/\/\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/.\n\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\\/\/\\\\.\n\n\/* NAVIGATOR Entry points *\/\n\n\/* These entry points expect to be called from within the plugin. The\n noteworthy assumption is that DS has already been set to point to the\n plugin's DLL data segment. Don't call these functions from outside\n the plugin without ensuring DS is set to the DLLs data segment first,\n typically using the NP_LOADDS macro\n*\/\n\n\/* returns the major\/minor version numbers of the Plugin API for the plugin\n and the Navigator\n*\/\nvoid NPN_Version(int* plugin_major, int* plugin_minor, int* netscape_major, int* netscape_minor)\n{\n *plugin_major = NP_VERSION_MAJOR;\n *plugin_minor = NP_VERSION_MINOR;\n *netscape_major = HIBYTE(g_pNavigatorFuncs->version);\n *netscape_minor = LOBYTE(g_pNavigatorFuncs->version);\n}\n\nNPError NPN_GetValue(NPP instance, NPNVariable variable, void *result)\n{\n return g_pNavigatorFuncs->getvalue(instance, variable, result);\n}\n\n\n\/* causes the specified URL to be fetched and streamed in\n*\/\nNPError NPN_GetURLNotify(NPP instance, const char *url, const char *target, void* notifyData)\n\n{\n\tint navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\terr = g_pNavigatorFuncs->geturlnotify(instance, url, target, notifyData);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\nNPError NPN_GetURL(NPP instance, const char *url, const char *target)\n{\n return g_pNavigatorFuncs->geturl(instance, url, target);\n}\n\nNPError NPN_PostURLNotify(NPP instance, const char* url, const char* window, uint32 len, const char* buf, NPBool file, void* notifyData)\n{\n\tint navMinorVers = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\tif( navMinorVers >= NPVERS_HAS_NOTIFICATION ) {\n\t\terr = g_pNavigatorFuncs->posturlnotify(instance, url, window, len, buf, file, notifyData);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\nNPError NPN_PostURL(NPP instance, const char* url, const char* window, uint32 len, const char* buf, NPBool file)\n{\n return g_pNavigatorFuncs->posturl(instance, url, window, len, buf, file);\n}\n\n\/* Requests that a number of bytes be provided on a stream. Typically\n this would be used if a stream was in \"pull\" mode. An optional\n position can be provided for streams which are seekable.\n*\/\nNPError NPN_RequestRead(NPStream* stream, NPByteRange* rangeList)\n{\n return g_pNavigatorFuncs->requestread(stream, rangeList);\n}\n\n\/* Creates a new stream of data from the plug-in to be interpreted\n by Netscape in the current window.\n*\/\nNPError NPN_NewStream(NPP instance, NPMIMEType type, \n\t\t\t\t\t\t\t\tconst char* target, NPStream** stream)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\terr = g_pNavigatorFuncs->newstream(instance, type, target, stream);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\/* Provides len bytes of data.\n*\/\nint32 NPN_Write(NPP instance, NPStream *stream,\n int32 len, void *buffer)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tint32 result;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\tresult = g_pNavigatorFuncs->write(instance, stream, len, buffer);\n\t}\n\telse {\n\t\tresult = -1;\n\t}\n\treturn result;\n}\n\n\/* Closes a stream object. \nreason indicates why the stream was closed.\n*\/\nNPError NPN_DestroyStream(NPP instance, NPStream* stream, NPError reason)\n{\n\tint navMinorVersion = g_pNavigatorFuncs->version & 0xFF;\n\tNPError err;\n\n\tif( navMinorVersion >= NPVERS_HAS_STREAMOUTPUT ) {\n\t\terr = g_pNavigatorFuncs->destroystream(instance, stream, reason);\n\t}\n\telse {\n\t\terr = NPERR_INCOMPATIBLE_VERSION_ERROR;\n\t}\n\treturn err;\n}\n\n\/* Provides a text status message in the Netscape client user interface\n*\/\nvoid NPN_Status(NPP instance, const char *message)\n{\n g_pNavigatorFuncs->status(instance, message);\n}\n\n\/* returns the user agent string of Navigator, which contains version info\n*\/\nconst char* NPN_UserAgent(NPP instance)\n{\n return g_pNavigatorFuncs->uagent(instance);\n}\n\n\/* allocates memory from the Navigator's memory space. Necessary so that\n saved instance data may be freed by Navigator when exiting.\n*\/\n\n\nvoid* NPN_MemAlloc(uint32 size)\n{\n return g_pNavigatorFuncs->memalloc(size);\n}\n\n\/* reciprocal of MemAlloc() above\n*\/\nvoid NPN_MemFree(void* ptr)\n{\n g_pNavigatorFuncs->memfree(ptr);\n}\n\n\/* private function to Netscape. do not use!\n*\/\nvoid NPN_ReloadPlugins(NPBool reloadPages)\n{\n g_pNavigatorFuncs->reloadplugins(reloadPages);\n}\n\nJRIEnv* NPN_GetJavaEnv(void)\n{\n\treturn g_pNavigatorFuncs->getJavaEnv();\n}\n\njref NPN_GetJavaPeer(NPP instance)\n{\n\treturn g_pNavigatorFuncs->getJavaPeer(instance);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ddefld.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2004-08-23 08:29:49 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _DDEFLD_HXX\n#define _DDEFLD_HXX\n\n#ifndef _LNKBASE_HXX \/\/autogen\n#include <so3\/lnkbase.hxx>\n#endif\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\n#ifndef _FLDBAS_HXX\n#include \"fldbas.hxx\"\n#endif\n\nclass SwDoc;\n\n\/*--------------------------------------------------------------------\n Beschreibung: FieldType fuer DDE\n --------------------------------------------------------------------*\/\n\nclass SW_DLLPUBLIC SwDDEFieldType : public SwFieldType\n{\n String aName;\n String aExpansion;\n\n ::so3::SvBaseLinkRef refLink;\n SwDoc* pDoc;\n\n USHORT nRefCnt;\n BOOL bCRLFFlag : 1;\n BOOL bDeleted : 1;\n\n SW_DLLPRIVATE void _RefCntChgd();\n\npublic:\n SwDDEFieldType( const String& rName, const String& rCmd,\n USHORT = so3::LINKUPDATE_ONCALL );\n ~SwDDEFieldType();\n\n const String& GetExpansion() const { return aExpansion; }\n void SetExpansion( const String& rStr ) { aExpansion = rStr,\n bCRLFFlag = FALSE; }\n\n virtual SwFieldType* Copy() const;\n virtual const String& GetName() const;\n\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n\n String GetCmd() const;\n void SetCmd( const String& rStr );\n\n USHORT GetType() const { return refLink->GetUpdateMode(); }\n void SetType( USHORT nType ) { refLink->SetUpdateMode( nType ); }\n\n BOOL IsDeleted() const { return bDeleted; }\n void SetDeleted( BOOL b ) { bDeleted = b; }\n\n BOOL IsConnected() const { return 0 != refLink->GetObj(); }\n void UpdateNow() { refLink->Update(); }\n void Disconnect() { refLink->Disconnect(); }\n\n const ::so3::SvBaseLink& GetBaseLink() const { return *refLink; }\n ::so3::SvBaseLink& GetBaseLink() { return *refLink; }\n\n const SwDoc* GetDoc() const { return pDoc; }\n SwDoc* GetDoc() { return pDoc; }\n void SetDoc( SwDoc* pDoc );\n\n void IncRefCnt() { if( !nRefCnt++ && pDoc ) _RefCntChgd(); }\n void DecRefCnt() { if( !--nRefCnt && pDoc ) _RefCntChgd(); }\n\n void SetCRLFDelFlag( BOOL bFlag = TRUE ) { bCRLFFlag = bFlag; }\n BOOL IsCRLFDelFlag() const { return bCRLFFlag; }\n};\n\n\/*--------------------------------------------------------------------\n Beschreibung: DDE-Feld\n --------------------------------------------------------------------*\/\n\nclass SwDDEField : public SwField\n{\npublic:\n SwDDEField(SwDDEFieldType*);\n ~SwDDEField();\n\n virtual String Expand() const;\n virtual SwField* Copy() const;\n\n \/\/ ueber Typen Parameter ermitteln\n \/\/ Name kann nicht geaendert werden\n virtual const String& GetPar1() const;\n\n \/\/ Commando\n virtual String GetPar2() const;\n virtual void SetPar2(const String& rStr);\n};\n\n\n#endif \/\/ _DDEFLD_HXX\n<commit_msg>INTEGRATION: CWS mav09 (1.4.682); FILE MERGED 2004\/09\/16 19:05:13 mav 1.4.682.2: RESYNC: (1.4-1.5); FILE MERGED 2004\/05\/18 16:43:02 mba 1.4.682.1: RESYNC to m39<commit_after>\/*************************************************************************\n *\n * $RCSfile: ddefld.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: kz $ $Date: 2004-10-04 18:57:37 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _DDEFLD_HXX\n#define _DDEFLD_HXX\n\n#ifndef _LNKBASE_HXX \/\/autogen\n#include <sfx2\/lnkbase.hxx>\n#endif\n\n#ifndef INCLUDED_SWDLLAPI_H\n#include \"swdllapi.h\"\n#endif\n\n#ifndef _FLDBAS_HXX\n#include \"fldbas.hxx\"\n#endif\n\nclass SwDoc;\n\n\/*--------------------------------------------------------------------\n Beschreibung: FieldType fuer DDE\n --------------------------------------------------------------------*\/\n\nclass SW_DLLPUBLIC SwDDEFieldType : public SwFieldType\n{\n String aName;\n String aExpansion;\n\n ::sfx2::SvBaseLinkRef refLink;\n SwDoc* pDoc;\n\n USHORT nRefCnt;\n BOOL bCRLFFlag : 1;\n BOOL bDeleted : 1;\n\n SW_DLLPRIVATE void _RefCntChgd();\n\npublic:\n SwDDEFieldType( const String& rName, const String& rCmd,\n USHORT = sfx2::LINKUPDATE_ONCALL );\n ~SwDDEFieldType();\n\n const String& GetExpansion() const { return aExpansion; }\n void SetExpansion( const String& rStr ) { aExpansion = rStr,\n bCRLFFlag = FALSE; }\n\n virtual SwFieldType* Copy() const;\n virtual const String& GetName() const;\n\n virtual BOOL QueryValue( com::sun::star::uno::Any& rVal, BYTE nMId ) const;\n virtual BOOL PutValue( const com::sun::star::uno::Any& rVal, BYTE nMId );\n\n String GetCmd() const;\n void SetCmd( const String& rStr );\n\n USHORT GetType() const { return refLink->GetUpdateMode(); }\n void SetType( USHORT nType ) { refLink->SetUpdateMode( nType ); }\n\n BOOL IsDeleted() const { return bDeleted; }\n void SetDeleted( BOOL b ) { bDeleted = b; }\n\n BOOL IsConnected() const { return 0 != refLink->GetObj(); }\n void UpdateNow() { refLink->Update(); }\n void Disconnect() { refLink->Disconnect(); }\n\n const ::sfx2::SvBaseLink& GetBaseLink() const { return *refLink; }\n ::sfx2::SvBaseLink& GetBaseLink() { return *refLink; }\n\n const SwDoc* GetDoc() const { return pDoc; }\n SwDoc* GetDoc() { return pDoc; }\n void SetDoc( SwDoc* pDoc );\n\n void IncRefCnt() { if( !nRefCnt++ && pDoc ) _RefCntChgd(); }\n void DecRefCnt() { if( !--nRefCnt && pDoc ) _RefCntChgd(); }\n\n void SetCRLFDelFlag( BOOL bFlag = TRUE ) { bCRLFFlag = bFlag; }\n BOOL IsCRLFDelFlag() const { return bCRLFFlag; }\n};\n\n\/*--------------------------------------------------------------------\n Beschreibung: DDE-Feld\n --------------------------------------------------------------------*\/\n\nclass SwDDEField : public SwField\n{\npublic:\n SwDDEField(SwDDEFieldType*);\n ~SwDDEField();\n\n virtual String Expand() const;\n virtual SwField* Copy() const;\n\n \/\/ ueber Typen Parameter ermitteln\n \/\/ Name kann nicht geaendert werden\n virtual const String& GetPar1() const;\n\n \/\/ Commando\n virtual String GetPar2() const;\n virtual void SetPar2(const String& rStr);\n};\n\n\n#endif \/\/ _DDEFLD_HXX\n<|endoftext|>"} {"text":"<commit_before>#include \"ninja.h\"\n\n#include <gtest\/gtest.h>\n\nstruct NinjaTest : public testing::Test {\n NinjaTest() {\n rule_cat_ = state_.AddRule(\"cat\", \"cat @in > $out\");\n }\n\n Rule* rule_cat_;\n State state_;\n};\n\nTEST_F(NinjaTest, Basic) {\n Edge* edge = state_.AddEdge(rule_cat_);\n state_.AddInOut(edge, Edge::IN, \"in1\");\n state_.AddInOut(edge, Edge::IN, \"in2\");\n state_.AddInOut(edge, Edge::OUT, \"out\");\n\n EXPECT_EQ(\"cat in1 in2 > out\", edge->EvaluateCommand());\n\n EXPECT_FALSE(state_.GetNode(\"in1\")->dirty());\n EXPECT_FALSE(state_.GetNode(\"in2\")->dirty());\n EXPECT_FALSE(state_.GetNode(\"out\")->dirty());\n\n state_.stat_cache()->GetFile(\"in1\")->Touch(1);\n EXPECT_TRUE(state_.GetNode(\"in1\")->dirty());\n EXPECT_FALSE(state_.GetNode(\"in2\")->dirty());\n EXPECT_TRUE(state_.GetNode(\"out\")->dirty());\n\n Plan plan(&state_);\n plan.AddTarget(\"out\");\n edge = plan.FindWork();\n ASSERT_TRUE(edge);\n EXPECT_EQ(\"cat in1 in2 > out\", edge->EvaluateCommand());\n ASSERT_FALSE(plan.FindWork());\n}\n\nstruct TestEnv : public EvalString::Env {\n virtual string Evaluate(const string& var) {\n return vars[var];\n }\n map<string, string> vars;\n};\nTEST(EvalString, PlainText) {\n EvalString str;\n str.Parse(\"plain text\");\n ASSERT_EQ(\"plain text\", str.Evaluate(NULL));\n}\nTEST(EvalString, OneVariable) {\n EvalString str;\n ASSERT_TRUE(str.Parse(\"hi $var\"));\n EXPECT_EQ(\"hi $var\", str.unparsed());\n TestEnv env;\n EXPECT_EQ(\"hi \", str.Evaluate(&env));\n env.vars[\"$var\"] = \"there\";\n EXPECT_EQ(\"hi there\", str.Evaluate(&env));\n}\n\nTEST(Parser, Empty) {\n State state;\n ManifestParser parser(&state);\n string err;\n EXPECT_TRUE(parser.Parse(\"\", &err));\n EXPECT_EQ(\"\", err);\n}\n\nTEST(Parser, Rules) {\n State state;\n ManifestParser parser(&state);\n string err;\n EXPECT_TRUE(parser.Parse(\n\"rule cat\\n\"\n\"command cat @in > $out\\n\"\n\"\\n\"\n\"rule date\\n\"\n\"command date > $out\\n\"\n\"\\n\"\n\"build result: cat in_1.cc in-2.O\\n\",\n &err));\n EXPECT_EQ(\"\", err);\n\n ASSERT_EQ(2, state.rules_.size());\n Rule* rule = state.rules_.begin()->second;\n EXPECT_EQ(\"cat\", rule->name_);\n EXPECT_EQ(\"cat @in > $out\", rule->command_.unparsed());\n}\n<commit_msg>rearrange<commit_after>#include \"ninja.h\"\n\n#include <gtest\/gtest.h>\n\nTEST(Parser, Empty) {\n State state;\n ManifestParser parser(&state);\n string err;\n EXPECT_TRUE(parser.Parse(\"\", &err));\n EXPECT_EQ(\"\", err);\n}\n\nTEST(Parser, Rules) {\n State state;\n ManifestParser parser(&state);\n string err;\n EXPECT_TRUE(parser.Parse(\n\"rule cat\\n\"\n\"command cat @in > $out\\n\"\n\"\\n\"\n\"rule date\\n\"\n\"command date > $out\\n\"\n\"\\n\"\n\"build result: cat in_1.cc in-2.O\\n\",\n &err));\n EXPECT_EQ(\"\", err);\n\n ASSERT_EQ(2, state.rules_.size());\n Rule* rule = state.rules_.begin()->second;\n EXPECT_EQ(\"cat\", rule->name_);\n EXPECT_EQ(\"cat @in > $out\", rule->command_.unparsed());\n}\n\nTEST(State, Basic) {\n State state;\n Rule* rule = state.AddRule(\"cat\", \"cat @in > $out\");\n Edge* edge = state.AddEdge(rule);\n state.AddInOut(edge, Edge::IN, \"in1\");\n state.AddInOut(edge, Edge::IN, \"in2\");\n state.AddInOut(edge, Edge::OUT, \"out\");\n\n EXPECT_EQ(\"cat in1 in2 > out\", edge->EvaluateCommand());\n\n EXPECT_FALSE(state.GetNode(\"in1\")->dirty());\n EXPECT_FALSE(state.GetNode(\"in2\")->dirty());\n EXPECT_FALSE(state.GetNode(\"out\")->dirty());\n\n state.stat_cache()->GetFile(\"in1\")->Touch(1);\n EXPECT_TRUE(state.GetNode(\"in1\")->dirty());\n EXPECT_FALSE(state.GetNode(\"in2\")->dirty());\n EXPECT_TRUE(state.GetNode(\"out\")->dirty());\n\n Plan plan(&state);\n plan.AddTarget(\"out\");\n edge = plan.FindWork();\n ASSERT_TRUE(edge);\n EXPECT_EQ(\"cat in1 in2 > out\", edge->EvaluateCommand());\n ASSERT_FALSE(plan.FindWork());\n}\n\nstruct TestEnv : public EvalString::Env {\n virtual string Evaluate(const string& var) {\n return vars[var];\n }\n map<string, string> vars;\n};\nTEST(EvalString, PlainText) {\n EvalString str;\n str.Parse(\"plain text\");\n ASSERT_EQ(\"plain text\", str.Evaluate(NULL));\n}\nTEST(EvalString, OneVariable) {\n EvalString str;\n ASSERT_TRUE(str.Parse(\"hi $var\"));\n EXPECT_EQ(\"hi $var\", str.unparsed());\n TestEnv env;\n EXPECT_EQ(\"hi \", str.Evaluate(&env));\n env.vars[\"$var\"] = \"there\";\n EXPECT_EQ(\"hi there\", str.Evaluate(&env));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * vector_detail.hpp\n *\n * Created on: Oct 29, 2014\n * Author: zmij\n *\/\n\n#ifndef PUSHKIN_VECTOR_DETAIL_HPP_\n#define PUSHKIN_VECTOR_DETAIL_HPP_\n\n#include <type_traits>\n#include <utility>\n\n#include <pushkin\/math\/detail\/axis_names.hpp>\n#include <pushkin\/math\/detail\/value_traits.hpp>\n\nnamespace psst {\nnamespace math {\n\nnamespace detail {\n\n\/** Variadic template arguments unwrapping *\/\ntemplate< ::std::size_t Index, typename T >\nstruct data_holder {\n static constexpr ::std::size_t index = Index;\n using type = T;\n\n type value;\n\n constexpr data_holder() = default;\n data_holder(data_holder const&) = default;\n data_holder(data_holder&&) = default;\n data_holder&\n operator = (data_holder const&) = default;\n data_holder&\n operator = (data_holder&&) = default;\n\n constexpr data_holder(type const& value)\n : value(value) {}\n\n template< typename Y >\n constexpr data_holder(Y const& value)\n : value(value) {}\n\n void\n swap(data_holder<Index, T>& rhs)\n {\n using std::swap;\n swap(value, rhs.value);\n }\n\n template< size_t idx1, typename Y >\n data_holder&\n operator =(const data_holder< idx1, Y >& rhs)\n {\n value = rhs.value;\n return *this;\n }\n};\n\ntemplate < typename IndexTuple, typename T >\nstruct vector_builder;\n\ntemplate < ::std::size_t ... Indexes, typename T >\nstruct vector_builder< std::index_sequence< Indexes ... >, T > :\n \/\/ TODO Replace the data holder with an std::array\n data_holder< Indexes, T > ... {\n\n static constexpr ::std::size_t size = sizeof ... (Indexes);\n using index_sequence_type = std::index_sequence< Indexes ... >;\n using this_type = vector_builder< index_sequence_type, T >;\n\n using element_type = T;\n using value_traits = vector_value_traits<T>;\n using value_type = typename value_traits::value_type;\n using lvalue_reference = typename value_traits::lvalue_reference;\n using const_reference = typename value_traits::const_reference;\n\n using magnitude_type = typename value_traits::magnitude_type;\n\n using pointer = value_type*;\n using const_pointer = value_type const*;\n\n using iterator = value_type*;\n using const_iterator = value_type const*;\n\n constexpr vector_builder() = default;\n\n \/**\n * Single value constructor, for initializing all values to the value\n * @param val\n *\/\n constexpr vector_builder(T val)\n : data_holder< Indexes, T >(val) ... {}\n\n \/**\n * Construct vector from a vector of larger size\n * @param rhs\n * @param\n *\/\n template < ::std::size_t ... IndexesR, typename U >\n constexpr vector_builder(\n vector_builder< std::index_sequence< IndexesR ... >, U > const& rhs,\n typename ::std::enable_if< size <= sizeof ... (IndexesR) >::type* = 0 )\n : data_holder< Indexes, T >( rhs.template at< Indexes >() ) ... {}\n\n template < typename ... E >\n constexpr vector_builder(E const& ... args,\n typename ::std::enable_if< size == sizeof ... (E) >::type* = 0)\n : data_holder< Indexes, T >(args) ... {}\n\n template < typename ... E >\n constexpr vector_builder(E&& ... args,\n typename ::std::enable_if< size == sizeof ... (E) >::type* = 0)\n : data_holder< Indexes, T >( std::forward<E>(args) ) ... {}\n\n template < typename U >\n constexpr vector_builder(::std::initializer_list<U> const& args)\n : data_holder< Indexes, T >(*(args.begin() + Indexes))... {}\n\n constexpr vector_builder(const_pointer p)\n : data_holder< Indexes, T >(*(p + Indexes))... {}\n\n pointer\n data()\n {\n return &this->data_holder< 0, T >::value;\n }\n\n constexpr const_pointer\n data() const\n {\n return &this->data_holder< 0, T >::value;\n }\n\n template < ::std::size_t N >\n lvalue_reference\n at()\n {\n return this->data_holder< N, T >::value;\n }\n\n template < ::std::size_t N >\n constexpr const_reference\n at() const\n {\n return this->data_holder< N, T >::value;\n }\n\n iterator\n begin()\n {\n return &this->data_holder< 0, T >::value;\n }\n\n constexpr const_iterator\n begin() const\n {\n return cbegin();\n }\n constexpr const_iterator\n cbegin() const\n {\n return &this->data_holder< 0, T >::value;\n }\n\n iterator\n end()\n {\n return begin() + size;\n }\n\n constexpr const_iterator\n end() const\n {\n return cend();\n }\n constexpr const_iterator\n cend() const\n {\n return begin() + size;\n }\n\n lvalue_reference\n operator[](::std::size_t idx)\n {\n assert(idx < size);\n return begin()[idx];\n }\n\n constexpr const_reference\n operator[](::std::size_t idx) const\n {\n assert(idx < size);\n return begin()[idx];\n }\n};\n\ntemplate < ::std::size_t L, ::std::size_t R >\nstruct min : ::std::conditional<\n L < R,\n ::std::integral_constant<::std::size_t, L>,\n ::std::integral_constant<::std::size_t, R>\n >::type {};\n\ntemplate < ::std::size_t N, typename T, typename U >\nstruct vector_cmp;\n\ntemplate < ::std::size_t N, typename T, typename U,\n ::std::size_t TSize, ::std::size_t USize,\n typename Axes >\nstruct vector_cmp<N, vector<T, TSize, Axes>, vector<U, USize, Axes>> {\n using left_side = vector<T, TSize, Axes>;\n using traits_type = typename left_side::value_traits;\n using right_side = vector<U, USize, Axes>;\n using prev_elem = vector_cmp<N - 1, left_side, right_side>;\n\n constexpr static bool\n eq(left_side const& lhs, right_side const& rhs)\n {\n return prev_elem::eq(lhs, rhs) &&\n traits_type::eq(lhs.template at<N>(),\n rhs.template at<N>());\n }\n\n constexpr static bool\n less(left_side const& lhs, right_side const& rhs)\n {\n auto p = prev_elem::cmp(lhs, rhs);\n return p < 0 ? true : traits_type::less(\n lhs.template at<N>(),\n rhs.template at<N>());\n }\n constexpr static int\n cmp(left_side const& lhs, right_side const& rhs)\n {\n auto p = prev_elem::cmp(lhs, rhs);\n if (p == 0) {\n return traits_type::cmp(lhs.template at<N>(),\n rhs.template at<N>());\n }\n return p;\n }\n};\n\ntemplate < typename T, typename U,\n ::std::size_t TSize, ::std::size_t USize,\n typename Axes >\nstruct vector_cmp<0, vector<T, TSize, Axes>, vector<U, USize, Axes>> {\n using left_side = vector<T, TSize, Axes>;\n using right_side = vector<U, USize, Axes>;\n using traits_type = typename left_side::value_traits;\n\n constexpr static bool\n eq(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::eq(lhs.template at<0>(), rhs.template at<0>());\n }\n\n constexpr static bool\n less(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::less(lhs.template at<0>(), rhs.template at<0>());\n }\n\n constexpr static int\n cmp(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::cmp(lhs.template at<0>(), rhs.template at<0>());\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct dot_product;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct dot_product< N, vector<T, Size, Axes> > {\n using vector_type = vector<T, Size, Axes>;\n using value_type = typename vector_type::magnitude_type;\n\n value_type\n operator()( vector_type const& lhs, vector_type const& rhs )\n {\n return dot_product< N -1, vector<T, Size, Axes> >()(lhs, rhs) +\n lhs.template at<N>() * rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct dot_product< 0, vector<T, Size, Axes> > {\n using vector_type = vector<T, Size, Axes>;\n using value_type = typename vector_type::magnitude_type;\n\n value_type\n operator()(vector_type const& lhs, vector_type const& rhs)\n {\n return lhs.template at< 0 >() * rhs.template at< 0 >();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_scalar_multiplication;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_multiplication< N, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n vector_scalar_multiplication< N - 1, vector<T, Size, Axes> >{}(v, s);\n v.template at<N>() *= s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_multiplication< 0, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n v.template at<0>() *= s;\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_scalar_division;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_division< N, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n vector_scalar_division< N - 1, vector<T, Size, Axes> >{}(v, s);\n v.template at<N>() \/= s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_division< 0, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n v.template at<0>() \/= s;\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_addition;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_addition< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n vector_addition<N - 1, vector<T, Size, Axes> >{}(lhs, rhs);\n lhs.template at<N>() += rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_addition< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n lhs.template at<0>() += rhs.template at<0>();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_substraction;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_substraction< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n vector_substraction<N - 1, vector<T, Size, Axes> >{}(lhs, rhs);\n lhs.template at<N>() -= rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_substraction< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n lhs.template at<0>() -= rhs.template at<0>();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct set_all_elements;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct set_all_elements< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& v, U s )\n {\n set_all_elements< N - 1, vector< T, Size, Axes > >{}(v, s);\n v.template at<N>() = s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct set_all_elements< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& v, U s )\n {\n v.template at<0>() = s;\n }\n};\n\n} \/\/ namespace detail\n\n} \/\/ namespace math\n} \/* namespace psst *\/\n\n#endif \/* PUSHKIN_VECTOR_DETAIL_HPP_ *\/\n<commit_msg>feat: use std::array for storage of vector data<commit_after>\/*\n * vector_detail.hpp\n *\n * Created on: Oct 29, 2014\n * Author: zmij\n *\/\n\n#ifndef PUSHKIN_VECTOR_DETAIL_HPP_\n#define PUSHKIN_VECTOR_DETAIL_HPP_\n\n#include <pushkin\/math\/detail\/axis_names.hpp>\n#include <pushkin\/math\/detail\/value_traits.hpp>\n\n#include <type_traits>\n#include <utility>\n#include <array>\n\nnamespace psst {\nnamespace math {\n\nnamespace detail {\n\n\/** Variadic template arguments unwrapping *\/\ntemplate< ::std::size_t Index, typename T >\nstruct data_holder {\n static constexpr ::std::size_t index = Index;\n using type = T;\n\n type value;\n\n constexpr data_holder() = default;\n data_holder(data_holder const&) = default;\n data_holder(data_holder&&) = default;\n data_holder&\n operator = (data_holder const&) = default;\n data_holder&\n operator = (data_holder&&) = default;\n\n constexpr data_holder(type const& value)\n : value(value) {}\n\n template< typename Y >\n constexpr data_holder(Y const& value)\n : value(value) {}\n\n void\n swap(data_holder<Index, T>& rhs)\n {\n using std::swap;\n swap(value, rhs.value);\n }\n\n template< size_t idx1, typename Y >\n data_holder&\n operator =(const data_holder< idx1, Y >& rhs)\n {\n value = rhs.value;\n return *this;\n }\n};\n\ntemplate <::std::size_t Index, typename T>\nstruct value_fill {\n T value;\n};\n\ntemplate < typename IndexTuple, typename T >\nstruct vector_builder;\n\ntemplate < ::std::size_t ... Indexes, typename T >\nstruct vector_builder< std::index_sequence< Indexes ... >, T > {\n\n static constexpr ::std::size_t size = sizeof ... (Indexes);\n using index_sequence_type = std::index_sequence< Indexes ... >;\n using this_type = vector_builder< index_sequence_type, T >;\n\n using element_type = T;\n using value_traits = vector_value_traits<T>;\n using value_type = typename value_traits::value_type;\n using lvalue_reference = typename value_traits::lvalue_reference;\n using const_reference = typename value_traits::const_reference;\n\n using magnitude_type = typename value_traits::magnitude_type;\n\n using pointer = value_type*;\n using const_pointer = value_type const*;\n\n using iterator = value_type*;\n using const_iterator = value_type const*;\n\n constexpr vector_builder() = default;\n\n \/**\n * Single value constructor, for initializing all values to the value\n * @param val\n *\/\n constexpr vector_builder(T val)\n : data_({value_fill<Indexes, T>{val}.value ...}) {}\n\n \/**\n * Construct vector from a vector of larger size\n * @param rhs\n * @param\n *\/\n template < ::std::size_t ... IndexesR, typename U >\n constexpr vector_builder(\n vector_builder< std::index_sequence< IndexesR ... >, U > const& rhs,\n typename ::std::enable_if< size <= sizeof ... (IndexesR) >::type* = 0 )\n : data_({rhs.template at< Indexes >()...}) {}\n\n template < typename ... E >\n constexpr vector_builder(E const& ... args,\n typename ::std::enable_if< size == sizeof ... (E) >::type* = 0)\n : data_({args...}) {}\n\n template < typename ... E >\n constexpr vector_builder(E&& ... args,\n typename ::std::enable_if< size == sizeof ... (E) >::type* = 0)\n : data_({std::forward<E>(args)...}) {}\n\n template < typename U >\n constexpr vector_builder(::std::initializer_list<U> const& args)\n : data_({*(args.begin() + Indexes)...}) {}\n\n constexpr vector_builder(const_pointer p)\n : data_({*(p + Indexes)...}) {}\n\n pointer\n data() { return data_.data(); }\n\n constexpr const_pointer\n data() const { return data_.data(); }\n\n template < ::std::size_t N >\n lvalue_reference\n at() { return ::std::get<N>(data_); }\n\n template < ::std::size_t N >\n constexpr const_reference\n at() const { return ::std::get<N>(data_); }\n\n iterator\n begin() { return data_.begin(); }\n\n constexpr const_iterator\n begin() const { return cbegin(); }\n constexpr const_iterator\n cbegin() const { return data_.cbegin(); }\n\n iterator\n end() { return data_.end(); }\n\n constexpr const_iterator\n end() const { return cend(); }\n constexpr const_iterator\n cend() const { return data_.end(); }\n\n lvalue_reference\n operator[](::std::size_t idx)\n {\n assert(idx < size);\n return data_[idx];\n }\n\n constexpr const_reference\n operator[](::std::size_t idx) const\n {\n assert(idx < size);\n return data_[idx];\n }\nprivate:\n using data_type = ::std::array<T, size>;\n data_type data_;\n};\n\ntemplate < ::std::size_t L, ::std::size_t R >\nstruct min : ::std::conditional<\n L < R,\n ::std::integral_constant<::std::size_t, L>,\n ::std::integral_constant<::std::size_t, R>\n >::type {};\n\ntemplate < ::std::size_t N, typename T, typename U >\nstruct vector_cmp;\n\ntemplate < ::std::size_t N, typename T, typename U,\n ::std::size_t TSize, ::std::size_t USize,\n typename Axes >\nstruct vector_cmp<N, vector<T, TSize, Axes>, vector<U, USize, Axes>> {\n using left_side = vector<T, TSize, Axes>;\n using traits_type = typename left_side::value_traits;\n using right_side = vector<U, USize, Axes>;\n using prev_elem = vector_cmp<N - 1, left_side, right_side>;\n\n constexpr static bool\n eq(left_side const& lhs, right_side const& rhs)\n {\n return prev_elem::eq(lhs, rhs) &&\n traits_type::eq(lhs.template at<N>(),\n rhs.template at<N>());\n }\n\n constexpr static bool\n less(left_side const& lhs, right_side const& rhs)\n {\n auto p = prev_elem::cmp(lhs, rhs);\n return p < 0 ? true : traits_type::less(\n lhs.template at<N>(),\n rhs.template at<N>());\n }\n constexpr static int\n cmp(left_side const& lhs, right_side const& rhs)\n {\n auto p = prev_elem::cmp(lhs, rhs);\n if (p == 0) {\n return traits_type::cmp(lhs.template at<N>(),\n rhs.template at<N>());\n }\n return p;\n }\n};\n\ntemplate < typename T, typename U,\n ::std::size_t TSize, ::std::size_t USize,\n typename Axes >\nstruct vector_cmp<0, vector<T, TSize, Axes>, vector<U, USize, Axes>> {\n using left_side = vector<T, TSize, Axes>;\n using right_side = vector<U, USize, Axes>;\n using traits_type = typename left_side::value_traits;\n\n constexpr static bool\n eq(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::eq(lhs.template at<0>(), rhs.template at<0>());\n }\n\n constexpr static bool\n less(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::less(lhs.template at<0>(), rhs.template at<0>());\n }\n\n constexpr static int\n cmp(left_side const& lhs, right_side const& rhs)\n {\n return traits_type::cmp(lhs.template at<0>(), rhs.template at<0>());\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct dot_product;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct dot_product< N, vector<T, Size, Axes> > {\n using vector_type = vector<T, Size, Axes>;\n using value_type = typename vector_type::magnitude_type;\n\n value_type\n operator()( vector_type const& lhs, vector_type const& rhs )\n {\n return dot_product< N -1, vector<T, Size, Axes> >()(lhs, rhs) +\n lhs.template at<N>() * rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct dot_product< 0, vector<T, Size, Axes> > {\n using vector_type = vector<T, Size, Axes>;\n using value_type = typename vector_type::magnitude_type;\n\n value_type\n operator()(vector_type const& lhs, vector_type const& rhs)\n {\n return lhs.template at< 0 >() * rhs.template at< 0 >();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_scalar_multiplication;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_multiplication< N, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n vector_scalar_multiplication< N - 1, vector<T, Size, Axes> >{}(v, s);\n v.template at<N>() *= s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_multiplication< 0, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n v.template at<0>() *= s;\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_scalar_division;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_division< N, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n vector_scalar_division< N - 1, vector<T, Size, Axes> >{}(v, s);\n v.template at<N>() \/= s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_scalar_division< 0, vector< T, Size, Axes > > {\n using vector_type = vector<T, Size, Axes>;\n\n template < typename U >\n void\n operator()( vector_type& v, U s )\n {\n v.template at<0>() \/= s;\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_addition;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_addition< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n vector_addition<N - 1, vector<T, Size, Axes> >{}(lhs, rhs);\n lhs.template at<N>() += rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_addition< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n lhs.template at<0>() += rhs.template at<0>();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct vector_substraction;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct vector_substraction< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n vector_substraction<N - 1, vector<T, Size, Axes> >{}(lhs, rhs);\n lhs.template at<N>() -= rhs.template at<N>();\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct vector_substraction< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& lhs, vector<U, Size, Axes> const& rhs)\n {\n lhs.template at<0>() -= rhs.template at<0>();\n }\n};\n\ntemplate < ::std::size_t N, typename T >\nstruct set_all_elements;\n\ntemplate < ::std::size_t N, typename T, ::std::size_t Size, typename Axes >\nstruct set_all_elements< N, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& v, U s )\n {\n set_all_elements< N - 1, vector< T, Size, Axes > >{}(v, s);\n v.template at<N>() = s;\n }\n};\n\ntemplate < typename T, ::std::size_t Size, typename Axes >\nstruct set_all_elements< 0, vector< T, Size, Axes > > {\n template < typename U >\n void\n operator()( vector<T, Size, Axes>& v, U s )\n {\n v.template at<0>() = s;\n }\n};\n\n} \/\/ namespace detail\n\n} \/\/ namespace math\n} \/* namespace psst *\/\n\n#endif \/* PUSHKIN_VECTOR_DETAIL_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include <string.h>\n\n#include \"transport.h\"\n#include \"core.h\"\n#include \"network.h\"\n#include \"log.h\"\n\nusing namespace std;\n\n\/\/ FIXME: Rework netCreateBuf and netExPacket. We don't need to\n\/\/ duplicate the sender\/receiver info the packet. This should be known\n\/\/ by the transport layer and given to us. We also should be more\n\/\/ intelligent about the time stamps, right now the method is very\n\/\/ ugly.\n\nNetwork::Network(Core *core)\n : _core(core)\n{\n LOG_ASSERT_ERROR(sizeof(g_type_to_static_network_map) \/ sizeof(EStaticNetwork) == NUM_PACKET_TYPES,\n \"Static network type map has incorrect number of entries.\");\n\n _numMod = Config::getSingleton()->getTotalCores();\n _tid = _core->getId();\n\n _transport = Transport::getSingleton()->createNode(_core->getId());\n\n _callbacks = new NetworkCallback [NUM_PACKET_TYPES];\n _callbackObjs = new void* [NUM_PACKET_TYPES];\n for (SInt32 i = 0; i < NUM_PACKET_TYPES; i++)\n _callbacks[i] = NULL;\n\n UInt32 modelTypes[NUM_STATIC_NETWORKS];\n Config::getSingleton()->getNetworkModels(modelTypes);\n\n for (SInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n _models[i] = NetworkModel::createModel(this, modelTypes[i], (EStaticNetwork)i);\n\n LOG_PRINT(\"Initialized.\");\n}\n\nNetwork::~Network()\n{\n for (SInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n delete _models[i];\n\n delete [] _callbackObjs;\n delete [] _callbacks;\n\n delete _transport;\n\n LOG_PRINT(\"Destroyed.\");\n}\n\nvoid Network::registerCallback(PacketType type, NetworkCallback callback, void *obj)\n{\n assert((UInt32)type < NUM_PACKET_TYPES);\n _callbacks[type] = callback;\n _callbackObjs[type] = obj;\n}\n\nvoid Network::unregisterCallback(PacketType type)\n{\n assert((UInt32)type < NUM_PACKET_TYPES);\n _callbacks[type] = NULL;\n}\n\nvoid Network::outputSummary(std::ostream &out) const\n{\n out << \"Network summary:\\n\";\n for (UInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n out << \" Network model \" << i << \":\\n\";\n _models[i]->outputSummary(out);\n }\n}\n\n\/\/ Polling function that performs background activities, such as\n\/\/ pulling from the physical transport layer and routing packets to\n\/\/ the appropriate queues.\n\nvoid Network::netPullFromTransport()\n{\n do\n {\n LOG_PRINT(\"Entering netPullFromTransport\");\n\n NetPacket packet(_transport->recv());\n \n LOG_PRINT(\"Pull packet : type %i, from %i, time %llu\", (SInt32)packet.type, packet.sender, packet.time);\n assert(0 <= packet.sender && packet.sender < _numMod);\n LOG_ASSERT_ERROR(0 <= packet.type && packet.type < NUM_PACKET_TYPES, \"Packet type: %d not between 0 and %d\", packet.type, NUM_PACKET_TYPES);\n\n \/\/ was this packet sent to us, or should it just be forwarded?\n if (packet.receiver != _core->getId())\n {\n \/\/ Disable this feature now. None of the network models use it\n LOG_PRINT(\"Forwarding packet : type %i, from %i, to %i, core_id %i, time %llu.\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n forwardPacket(packet);\n\n \/\/ if this isn't a broadcast message, then we shouldn't process it further\n if (packet.receiver != NetPacket::BROADCAST)\n continue;\n }\n\n \/\/ asynchronous I\/O support\n NetworkCallback callback = _callbacks[packet.type];\n\n if (callback != NULL)\n {\n LOG_PRINT(\"Executing callback on packet : type %i, from %i, to %i, core_id %i, time %llu\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n assert(0 <= packet.sender && packet.sender < _numMod);\n assert(0 <= packet.type && packet.type < NUM_PACKET_TYPES);\n\n callback(_callbackObjs[packet.type], packet);\n\n if (packet.length > 0)\n delete [] (Byte*) packet.data;\n }\n\n \/\/ synchronous I\/O support\n else\n {\n LOG_PRINT(\"Enqueuing packet : type %i, from %i, to %i, core_id %i, time %llu.\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n _netQueueLock.acquire();\n _netQueue.push_back(packet);\n _netQueueLock.release();\n _netQueueCond.broadcast();\n }\n }\n while (_transport->query());\n}\n\n\/\/ FIXME: Can forwardPacket be subsumed by netSend?\n\nvoid Network::forwardPacket(const NetPacket &packet)\n{\n netSend(packet);\n}\n\nSInt32 Network::netSend(const NetPacket& packet)\n{\n assert(packet.type >= 0 && packet.type < NUM_PACKET_TYPES);\n\n NetworkModel *model = _models[g_type_to_static_network_map[packet.type]];\n\n vector<NetworkModel::Hop> hopVec;\n model->routePacket(packet, hopVec);\n\n Byte *buffer = packet.makeBuffer();\n\n for (UInt32 i = 0; i < hopVec.size(); i++)\n {\n LOG_PRINT(\"Send packet : type %i, from %i, to %i, next_hop %i, core_id %i, time %llu\", \n (SInt32) packet.type, packet.sender, hopVec[i].final_dest, hopVec[i].next_dest, _core->getId(), hopVec[i].time);\n LOG_ASSERT_ERROR(hopVec[i].time >= packet.time, \"hopVec[%d].time(%llu) < packet.time(%llu)\", i, hopVec[i].time, packet.time);\n\n NetPacket* buff_pkt = (NetPacket*) buffer;\n buff_pkt->time = hopVec[i].time;\n buff_pkt->receiver = hopVec[i].final_dest;\n\n _transport->send(hopVec[i].next_dest, buffer, packet.bufferSize());\n \n LOG_PRINT(\"Sent packet\");\n }\n\n delete [] buffer;\n\n\n return packet.length;\n}\n\n\/\/ Stupid helper class to eliminate special cases for empty\n\/\/ sender\/type vectors in a NetMatch\nclass NetRecvIterator\n{\n public:\n NetRecvIterator(UInt32 i)\n : _mode(INT)\n , _max(i)\n , _i(0)\n {\n }\n NetRecvIterator(const std::vector<SInt32> &v)\n : _mode(SENDER_VECTOR)\n , _senders(&v)\n , _i(0)\n {\n }\n NetRecvIterator(const std::vector<PacketType> &v)\n : _mode(TYPE_VECTOR)\n , _types(&v)\n , _i(0)\n {\n }\n\n inline UInt32 get()\n {\n switch (_mode)\n {\n case INT:\n return _i;\n case SENDER_VECTOR:\n return (UInt32)_senders->at(_i);\n case TYPE_VECTOR:\n return (UInt32)_types->at(_i);\n default:\n assert(false);\n return (UInt32)-1;\n };\n }\n\n inline Boolean done()\n {\n switch (_mode)\n {\n case INT:\n return _i >= _max;\n case SENDER_VECTOR:\n return _i >= _senders->size();\n case TYPE_VECTOR:\n return _i >= _types->size();\n default:\n assert(false);\n return true;\n };\n }\n\n inline void next()\n {\n ++_i;\n }\n\n inline void reset()\n {\n _i = 0;\n }\n\n private:\n enum\n {\n INT, SENDER_VECTOR, TYPE_VECTOR\n } _mode;\n\n union\n {\n UInt32 _max;\n const std::vector<SInt32> *_senders;\n const std::vector<PacketType> *_types;\n };\n\n UInt32 _i;\n};\n\nNetPacket Network::netRecv(const NetMatch &match)\n{\n LOG_PRINT(\"Entering netRecv.\");\n\n \/\/ Track via iterator to minimize copying\n NetQueue::iterator itr;\n Boolean found;\n\n found = false;\n\n NetRecvIterator sender = match.senders.empty()\n ? NetRecvIterator(_numMod)\n : NetRecvIterator(match.senders);\n\n NetRecvIterator type = match.types.empty()\n ? NetRecvIterator((UInt32)NUM_PACKET_TYPES)\n : NetRecvIterator(match.types);\n\n LOG_ASSERT_ERROR(_core && _core->getPerformanceModel(),\n \"Core and\/or performance model not initialized.\");\n UInt64 start_time = _core->getPerformanceModel()->getCycleCount();\n\n _netQueueLock.acquire();\n\n while (!found)\n {\n itr = _netQueue.end();\n\n \/\/ check every entry in the queue\n for (NetQueue::iterator i = _netQueue.begin();\n i != _netQueue.end();\n i++)\n {\n \/\/ only find packets that match\n for (sender.reset(); !sender.done(); sender.next())\n {\n if (i->sender != (SInt32)sender.get())\n continue;\n\n for (type.reset(); !type.done(); type.next())\n {\n if (i->type != (PacketType)type.get())\n continue;\n\n found = true;\n\n \/\/ find the earliest packet\n if (itr == _netQueue.end() ||\n itr->time > i->time)\n {\n itr = i;\n }\n }\n }\n }\n\n \/\/ go to sleep until a packet arrives if none have been found\n if (!found)\n {\n _netQueueCond.wait(_netQueueLock);\n }\n }\n\n assert(found == true && itr != _netQueue.end());\n assert(0 <= itr->sender && itr->sender < _numMod);\n assert(0 <= itr->type && itr->type < NUM_PACKET_TYPES);\n assert((itr->receiver == _core->getId()) || (itr->receiver == NetPacket::BROADCAST));\n\n \/\/ Copy result\n NetPacket packet = *itr;\n _netQueue.erase(itr);\n _netQueueLock.release();\n\n LOG_PRINT(\"packet.time(%llu), start_time(%llu)\", packet.time, start_time);\n\n if (packet.time > start_time)\n {\n LOG_PRINT(\"Queueing RecvInstruction(%llu)\", packet.time - start_time);\n Instruction *i = new RecvInstruction(packet.time - start_time);\n _core->getPerformanceModel()->queueDynamicInstruction(i);\n }\n\n LOG_PRINT(\"Exiting netRecv : type %i, from %i\", (SInt32)packet.type, packet.sender);\n\n return packet;\n}\n\n\/\/ -- Wrappers\n\nSInt32 Network::netSend(SInt32 dest, PacketType type, const void *buf, UInt32 len)\n{\n NetPacket packet;\n assert(_core && _core->getPerformanceModel());\n packet.time = _core->getPerformanceModel()->getCycleCount();\n packet.sender = _core->getId();\n packet.receiver = dest;\n packet.length = len;\n packet.type = type;\n packet.data = buf;\n\n return netSend(packet);\n}\n\nSInt32 Network::netBroadcast(PacketType type, const void *buf, UInt32 len)\n{\n return netSend(NetPacket::BROADCAST, type, buf, len);\n}\n\nNetPacket Network::netRecv(SInt32 src, PacketType type)\n{\n NetMatch match;\n match.senders.push_back(src);\n match.types.push_back(type);\n return netRecv(match);\n}\n\nNetPacket Network::netRecvFrom(SInt32 src)\n{\n NetMatch match;\n match.senders.push_back(src);\n return netRecv(match);\n}\n\nNetPacket Network::netRecvType(PacketType type)\n{\n NetMatch match;\n match.types.push_back(type);\n return netRecv(match);\n}\n\nvoid Network::enableModels()\n{\n for (int i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n _models[i]->enable();\n }\n}\n\nvoid Network::disableModels()\n{\n for (int i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n _models[i]->disable();\n }\n}\n\n\/\/ -- NetPacket\n\nNetPacket::NetPacket()\n : time(0)\n , type(INVALID)\n , sender(INVALID_CORE_ID)\n , receiver(INVALID_CORE_ID)\n , length(0)\n , data(0)\n{\n}\n\nNetPacket::NetPacket(UInt64 t, PacketType ty, SInt32 s,\n SInt32 r, UInt32 l, const void *d)\n : time(t)\n , type(ty)\n , sender(s)\n , receiver(r)\n , length(l)\n , data(d)\n{\n}\n\n\nNetPacket::NetPacket(Byte *buffer)\n{\n memcpy(this, buffer, sizeof(*this));\n\n \/\/ LOG_ASSERT_ERROR(length > 0, \"type(%u), sender(%i), receiver(%i), length(%u)\", type, sender, receiver, length);\n if (length > 0)\n {\n Byte* data_buffer = new Byte[length];\n memcpy(data_buffer, buffer + sizeof(*this), length);\n data = data_buffer;\n }\n\n delete [] buffer;\n}\n\n\/\/ This implementation is slightly wasteful because there is no need\n\/\/ to copy the const void* value in the NetPacket when length == 0,\n\/\/ but I don't see this as a major issue.\nUInt32 NetPacket::bufferSize() const\n{\n return (sizeof(*this) + length);\n}\n\nByte* NetPacket::makeBuffer() const\n{\n UInt32 size = bufferSize();\n assert(size >= sizeof(NetPacket));\n\n Byte *buffer = new Byte[size];\n\n memcpy(buffer, this, sizeof(*this));\n memcpy(buffer + sizeof(*this), data, length);\n\n return buffer;\n}\n<commit_msg>[network] Fixed a memory leak started while forwarding packets in the network<commit_after>#include <string.h>\n\n#include \"transport.h\"\n#include \"core.h\"\n#include \"network.h\"\n#include \"log.h\"\n\nusing namespace std;\n\n\/\/ FIXME: Rework netCreateBuf and netExPacket. We don't need to\n\/\/ duplicate the sender\/receiver info the packet. This should be known\n\/\/ by the transport layer and given to us. We also should be more\n\/\/ intelligent about the time stamps, right now the method is very\n\/\/ ugly.\n\nNetwork::Network(Core *core)\n : _core(core)\n{\n LOG_ASSERT_ERROR(sizeof(g_type_to_static_network_map) \/ sizeof(EStaticNetwork) == NUM_PACKET_TYPES,\n \"Static network type map has incorrect number of entries.\");\n\n _numMod = Config::getSingleton()->getTotalCores();\n _tid = _core->getId();\n\n _transport = Transport::getSingleton()->createNode(_core->getId());\n\n _callbacks = new NetworkCallback [NUM_PACKET_TYPES];\n _callbackObjs = new void* [NUM_PACKET_TYPES];\n for (SInt32 i = 0; i < NUM_PACKET_TYPES; i++)\n _callbacks[i] = NULL;\n\n UInt32 modelTypes[NUM_STATIC_NETWORKS];\n Config::getSingleton()->getNetworkModels(modelTypes);\n\n for (SInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n _models[i] = NetworkModel::createModel(this, modelTypes[i], (EStaticNetwork)i);\n\n LOG_PRINT(\"Initialized.\");\n}\n\nNetwork::~Network()\n{\n for (SInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n delete _models[i];\n\n delete [] _callbackObjs;\n delete [] _callbacks;\n\n delete _transport;\n\n LOG_PRINT(\"Destroyed.\");\n}\n\nvoid Network::registerCallback(PacketType type, NetworkCallback callback, void *obj)\n{\n assert((UInt32)type < NUM_PACKET_TYPES);\n _callbacks[type] = callback;\n _callbackObjs[type] = obj;\n}\n\nvoid Network::unregisterCallback(PacketType type)\n{\n assert((UInt32)type < NUM_PACKET_TYPES);\n _callbacks[type] = NULL;\n}\n\nvoid Network::outputSummary(std::ostream &out) const\n{\n out << \"Network summary:\\n\";\n for (UInt32 i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n out << \" Network model \" << i << \":\\n\";\n _models[i]->outputSummary(out);\n }\n}\n\n\/\/ Polling function that performs background activities, such as\n\/\/ pulling from the physical transport layer and routing packets to\n\/\/ the appropriate queues.\n\nvoid Network::netPullFromTransport()\n{\n do\n {\n LOG_PRINT(\"Entering netPullFromTransport\");\n\n NetPacket packet(_transport->recv());\n \n LOG_PRINT(\"Pull packet : type %i, from %i, time %llu\", (SInt32)packet.type, packet.sender, packet.time);\n assert(0 <= packet.sender && packet.sender < _numMod);\n LOG_ASSERT_ERROR(0 <= packet.type && packet.type < NUM_PACKET_TYPES, \"Packet type: %d not between 0 and %d\", packet.type, NUM_PACKET_TYPES);\n\n \/\/ was this packet sent to us, or should it just be forwarded?\n if (packet.receiver != _core->getId())\n {\n \/\/ Disable this feature now. None of the network models use it\n LOG_PRINT(\"Forwarding packet : type %i, from %i, to %i, core_id %i, time %llu.\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n forwardPacket(packet);\n\n \/\/ if this isn't a broadcast message, then we shouldn't process it further\n if (packet.receiver != NetPacket::BROADCAST)\n {\n if (packet.length > 0)\n delete [] (Byte*) packet.data;\n continue;\n }\n }\n\n \/\/ asynchronous I\/O support\n NetworkCallback callback = _callbacks[packet.type];\n\n if (callback != NULL)\n {\n LOG_PRINT(\"Executing callback on packet : type %i, from %i, to %i, core_id %i, time %llu\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n assert(0 <= packet.sender && packet.sender < _numMod);\n assert(0 <= packet.type && packet.type < NUM_PACKET_TYPES);\n\n callback(_callbackObjs[packet.type], packet);\n\n if (packet.length > 0)\n delete [] (Byte*) packet.data;\n }\n\n \/\/ synchronous I\/O support\n else\n {\n LOG_PRINT(\"Enqueuing packet : type %i, from %i, to %i, core_id %i, time %llu.\", \n (SInt32)packet.type, packet.sender, packet.receiver, _core->getId(), packet.time);\n _netQueueLock.acquire();\n _netQueue.push_back(packet);\n _netQueueLock.release();\n _netQueueCond.broadcast();\n }\n }\n while (_transport->query());\n}\n\n\/\/ FIXME: Can forwardPacket be subsumed by netSend?\n\nvoid Network::forwardPacket(const NetPacket &packet)\n{\n netSend(packet);\n}\n\nSInt32 Network::netSend(const NetPacket& packet)\n{\n assert(packet.type >= 0 && packet.type < NUM_PACKET_TYPES);\n\n NetworkModel *model = _models[g_type_to_static_network_map[packet.type]];\n\n vector<NetworkModel::Hop> hopVec;\n model->routePacket(packet, hopVec);\n\n Byte *buffer = packet.makeBuffer();\n\n for (UInt32 i = 0; i < hopVec.size(); i++)\n {\n LOG_PRINT(\"Send packet : type %i, from %i, to %i, next_hop %i, core_id %i, time %llu\", \n (SInt32) packet.type, packet.sender, hopVec[i].final_dest, hopVec[i].next_dest, _core->getId(), hopVec[i].time);\n LOG_ASSERT_ERROR(hopVec[i].time >= packet.time, \"hopVec[%d].time(%llu) < packet.time(%llu)\", i, hopVec[i].time, packet.time);\n\n NetPacket* buff_pkt = (NetPacket*) buffer;\n buff_pkt->time = hopVec[i].time;\n buff_pkt->receiver = hopVec[i].final_dest;\n\n _transport->send(hopVec[i].next_dest, buffer, packet.bufferSize());\n \n LOG_PRINT(\"Sent packet\");\n }\n\n delete [] buffer;\n\n\n return packet.length;\n}\n\n\/\/ Stupid helper class to eliminate special cases for empty\n\/\/ sender\/type vectors in a NetMatch\nclass NetRecvIterator\n{\n public:\n NetRecvIterator(UInt32 i)\n : _mode(INT)\n , _max(i)\n , _i(0)\n {\n }\n NetRecvIterator(const std::vector<SInt32> &v)\n : _mode(SENDER_VECTOR)\n , _senders(&v)\n , _i(0)\n {\n }\n NetRecvIterator(const std::vector<PacketType> &v)\n : _mode(TYPE_VECTOR)\n , _types(&v)\n , _i(0)\n {\n }\n\n inline UInt32 get()\n {\n switch (_mode)\n {\n case INT:\n return _i;\n case SENDER_VECTOR:\n return (UInt32)_senders->at(_i);\n case TYPE_VECTOR:\n return (UInt32)_types->at(_i);\n default:\n assert(false);\n return (UInt32)-1;\n };\n }\n\n inline Boolean done()\n {\n switch (_mode)\n {\n case INT:\n return _i >= _max;\n case SENDER_VECTOR:\n return _i >= _senders->size();\n case TYPE_VECTOR:\n return _i >= _types->size();\n default:\n assert(false);\n return true;\n };\n }\n\n inline void next()\n {\n ++_i;\n }\n\n inline void reset()\n {\n _i = 0;\n }\n\n private:\n enum\n {\n INT, SENDER_VECTOR, TYPE_VECTOR\n } _mode;\n\n union\n {\n UInt32 _max;\n const std::vector<SInt32> *_senders;\n const std::vector<PacketType> *_types;\n };\n\n UInt32 _i;\n};\n\nNetPacket Network::netRecv(const NetMatch &match)\n{\n LOG_PRINT(\"Entering netRecv.\");\n\n \/\/ Track via iterator to minimize copying\n NetQueue::iterator itr;\n Boolean found;\n\n found = false;\n\n NetRecvIterator sender = match.senders.empty()\n ? NetRecvIterator(_numMod)\n : NetRecvIterator(match.senders);\n\n NetRecvIterator type = match.types.empty()\n ? NetRecvIterator((UInt32)NUM_PACKET_TYPES)\n : NetRecvIterator(match.types);\n\n LOG_ASSERT_ERROR(_core && _core->getPerformanceModel(),\n \"Core and\/or performance model not initialized.\");\n UInt64 start_time = _core->getPerformanceModel()->getCycleCount();\n\n _netQueueLock.acquire();\n\n while (!found)\n {\n itr = _netQueue.end();\n\n \/\/ check every entry in the queue\n for (NetQueue::iterator i = _netQueue.begin();\n i != _netQueue.end();\n i++)\n {\n \/\/ only find packets that match\n for (sender.reset(); !sender.done(); sender.next())\n {\n if (i->sender != (SInt32)sender.get())\n continue;\n\n for (type.reset(); !type.done(); type.next())\n {\n if (i->type != (PacketType)type.get())\n continue;\n\n found = true;\n\n \/\/ find the earliest packet\n if (itr == _netQueue.end() ||\n itr->time > i->time)\n {\n itr = i;\n }\n }\n }\n }\n\n \/\/ go to sleep until a packet arrives if none have been found\n if (!found)\n {\n _netQueueCond.wait(_netQueueLock);\n }\n }\n\n assert(found == true && itr != _netQueue.end());\n assert(0 <= itr->sender && itr->sender < _numMod);\n assert(0 <= itr->type && itr->type < NUM_PACKET_TYPES);\n assert((itr->receiver == _core->getId()) || (itr->receiver == NetPacket::BROADCAST));\n\n \/\/ Copy result\n NetPacket packet = *itr;\n _netQueue.erase(itr);\n _netQueueLock.release();\n\n LOG_PRINT(\"packet.time(%llu), start_time(%llu)\", packet.time, start_time);\n\n if (packet.time > start_time)\n {\n LOG_PRINT(\"Queueing RecvInstruction(%llu)\", packet.time - start_time);\n Instruction *i = new RecvInstruction(packet.time - start_time);\n _core->getPerformanceModel()->queueDynamicInstruction(i);\n }\n\n LOG_PRINT(\"Exiting netRecv : type %i, from %i\", (SInt32)packet.type, packet.sender);\n\n return packet;\n}\n\n\/\/ -- Wrappers\n\nSInt32 Network::netSend(SInt32 dest, PacketType type, const void *buf, UInt32 len)\n{\n NetPacket packet;\n assert(_core && _core->getPerformanceModel());\n packet.time = _core->getPerformanceModel()->getCycleCount();\n packet.sender = _core->getId();\n packet.receiver = dest;\n packet.length = len;\n packet.type = type;\n packet.data = buf;\n\n return netSend(packet);\n}\n\nSInt32 Network::netBroadcast(PacketType type, const void *buf, UInt32 len)\n{\n return netSend(NetPacket::BROADCAST, type, buf, len);\n}\n\nNetPacket Network::netRecv(SInt32 src, PacketType type)\n{\n NetMatch match;\n match.senders.push_back(src);\n match.types.push_back(type);\n return netRecv(match);\n}\n\nNetPacket Network::netRecvFrom(SInt32 src)\n{\n NetMatch match;\n match.senders.push_back(src);\n return netRecv(match);\n}\n\nNetPacket Network::netRecvType(PacketType type)\n{\n NetMatch match;\n match.types.push_back(type);\n return netRecv(match);\n}\n\nvoid Network::enableModels()\n{\n for (int i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n _models[i]->enable();\n }\n}\n\nvoid Network::disableModels()\n{\n for (int i = 0; i < NUM_STATIC_NETWORKS; i++)\n {\n _models[i]->disable();\n }\n}\n\n\/\/ -- NetPacket\n\nNetPacket::NetPacket()\n : time(0)\n , type(INVALID)\n , sender(INVALID_CORE_ID)\n , receiver(INVALID_CORE_ID)\n , length(0)\n , data(0)\n{\n}\n\nNetPacket::NetPacket(UInt64 t, PacketType ty, SInt32 s,\n SInt32 r, UInt32 l, const void *d)\n : time(t)\n , type(ty)\n , sender(s)\n , receiver(r)\n , length(l)\n , data(d)\n{\n}\n\n\nNetPacket::NetPacket(Byte *buffer)\n{\n memcpy(this, buffer, sizeof(*this));\n\n \/\/ LOG_ASSERT_ERROR(length > 0, \"type(%u), sender(%i), receiver(%i), length(%u)\", type, sender, receiver, length);\n if (length > 0)\n {\n Byte* data_buffer = new Byte[length];\n memcpy(data_buffer, buffer + sizeof(*this), length);\n data = data_buffer;\n }\n\n delete [] buffer;\n}\n\n\/\/ This implementation is slightly wasteful because there is no need\n\/\/ to copy the const void* value in the NetPacket when length == 0,\n\/\/ but I don't see this as a major issue.\nUInt32 NetPacket::bufferSize() const\n{\n return (sizeof(*this) + length);\n}\n\nByte* NetPacket::makeBuffer() const\n{\n UInt32 size = bufferSize();\n assert(size >= sizeof(NetPacket));\n\n Byte *buffer = new Byte[size];\n\n memcpy(buffer, this, sizeof(*this));\n memcpy(buffer + sizeof(*this), data, length);\n\n return buffer;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"istream_rubber.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/Bucket.hxx\"\n#include \"rubber.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <stdint.h>\n\nclass RubberIstream final : public Istream {\n Rubber &rubber;\n const unsigned id;\n const bool auto_remove;\n\n size_t position;\n const size_t end;\n\npublic:\n RubberIstream(struct pool &p, Rubber &_rubber, unsigned _id,\n size_t start, size_t _end,\n bool _auto_remove)\n :Istream(p), rubber(_rubber), id(_id), auto_remove(_auto_remove),\n position(start), end(_end) {}\n\n \/* virtual methods from class Istream *\/\n\n off_t _GetAvailable(gcc_unused bool partial) override {\n return end - position;\n }\n\n off_t _Skip(off_t nbytes) override {\n assert(position <= end);\n\n const size_t remaining = end - position;\n if (nbytes > off_t(remaining))\n nbytes = remaining;\n\n position += nbytes;\n Consumed(nbytes);\n return nbytes;\n }\n\n void _Read() override {\n assert(position <= end);\n\n const uint8_t *data = (const uint8_t *)rubber_read(&rubber, id);\n const size_t remaining = end - position;\n\n if (remaining > 0) {\n size_t nbytes = InvokeData(data + position, remaining);\n if (nbytes == 0)\n return;\n\n position += nbytes;\n }\n\n if (position == end) {\n if (auto_remove)\n rubber_remove(&rubber, id);\n\n DestroyEof();\n }\n }\n\n void _FillBucketList(IstreamBucketList &list) override {\n const uint8_t *data = (const uint8_t *)rubber_read(&rubber, id);\n const size_t remaining = end - position;\n\n if (remaining > 0)\n list.Push(ConstBuffer<void>(data + position, remaining));\n }\n\n size_t _ConsumeBucketList(size_t nbytes) override {\n const size_t remaining = end - position;\n size_t consumed = std::min(nbytes, remaining);\n position += consumed;\n Consumed(consumed);\n return consumed;\n }\n\n void _Close() noexcept override {\n if (auto_remove)\n rubber_remove(&rubber, id);\n\n Istream::_Close();\n }\n};\n\nIstream *\nistream_rubber_new(struct pool &pool, Rubber &rubber,\n unsigned id, size_t start, size_t end,\n bool auto_remove)\n{\n assert(id > 0);\n assert(start <= end);\n\n return NewIstream<RubberIstream>(pool, rubber, id,\n start, end, auto_remove);\n}\n<commit_msg>istream_rubber: call Rubber methods directly<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"istream_rubber.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/Bucket.hxx\"\n#include \"rubber.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n\n#include <algorithm>\n\n#include <assert.h>\n#include <stdint.h>\n\nclass RubberIstream final : public Istream {\n Rubber &rubber;\n const unsigned id;\n const bool auto_remove;\n\n size_t position;\n const size_t end;\n\npublic:\n RubberIstream(struct pool &p, Rubber &_rubber, unsigned _id,\n size_t start, size_t _end,\n bool _auto_remove)\n :Istream(p), rubber(_rubber), id(_id), auto_remove(_auto_remove),\n position(start), end(_end) {}\n\n \/* virtual methods from class Istream *\/\n\n off_t _GetAvailable(gcc_unused bool partial) override {\n return end - position;\n }\n\n off_t _Skip(off_t nbytes) override {\n assert(position <= end);\n\n const size_t remaining = end - position;\n if (nbytes > off_t(remaining))\n nbytes = remaining;\n\n position += nbytes;\n Consumed(nbytes);\n return nbytes;\n }\n\n void _Read() override {\n assert(position <= end);\n\n const uint8_t *data = (const uint8_t *)rubber.Read(id);\n const size_t remaining = end - position;\n\n if (remaining > 0) {\n size_t nbytes = InvokeData(data + position, remaining);\n if (nbytes == 0)\n return;\n\n position += nbytes;\n }\n\n if (position == end) {\n if (auto_remove)\n rubber.Remove(id);\n\n DestroyEof();\n }\n }\n\n void _FillBucketList(IstreamBucketList &list) override {\n const uint8_t *data = (const uint8_t *)rubber.Read(id);\n const size_t remaining = end - position;\n\n if (remaining > 0)\n list.Push(ConstBuffer<void>(data + position, remaining));\n }\n\n size_t _ConsumeBucketList(size_t nbytes) override {\n const size_t remaining = end - position;\n size_t consumed = std::min(nbytes, remaining);\n position += consumed;\n Consumed(consumed);\n return consumed;\n }\n\n void _Close() noexcept override {\n if (auto_remove)\n rubber.Remove(id);\n\n Istream::_Close();\n }\n};\n\nIstream *\nistream_rubber_new(struct pool &pool, Rubber &rubber,\n unsigned id, size_t start, size_t end,\n bool auto_remove)\n{\n assert(id > 0);\n assert(start <= end);\n\n return NewIstream<RubberIstream>(pool, rubber, id,\n start, end, auto_remove);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"FVNormalizedCutGUI.h\"\n\nFVNormCutGUI::FVNormCutGUI(QWidget* Parent, FiberDisplay* FVDisplay):FVPanelGUI(Parent,FVDisplay)\n{\n\tm_L_Cluster=new QLabel(\"Number of Cluster\", this);\n\tm_SB_Cluster=new QSpinBox(this);\n\tm_SB_Cluster->setSingleStep(1);\n\tm_SB_Cluster->setRange(2,1000);\n\tm_SB_Cluster->setValue(2);\n\t\n\t\n\tQGridLayout* GL_NormCut=new QGridLayout;\n\tQHBoxLayout* HL_Navigation=new QHBoxLayout;\n\t\n\tGL_NormCut->addWidget(m_L_Cluster,0,0,1,0);\n\tGL_NormCut->addWidget(m_SB_Cluster,1,0,1,0);\n\tHL_Navigation->addWidget(m_PB_Undo);\n\tHL_Navigation->addWidget(m_PB_Next);\n\tGL_NormCut->addLayout(HL_Navigation,2,0,1,0);\n\tGL_NormCut->setRowStretch(3,1);\n\n\tsetLayout(GL_NormCut);\n\t\n\tconnect(m_PB_Undo, SIGNAL(clicked()), this, SLOT(UndoAction()));\n\tconnect(m_PB_Next, SIGNAL(clicked()), this, SLOT(NextAction()));\t\n}\n\nvoid FVNormCutGUI::InitWeight()\n{\n\tm_Weight.clear();\n\tint NbFibers=m_Display->GetNbModifiedFibers();\n\tfor (int i = 0 ; i < NbFibers ; i++)\n\t{\n\t\tstd::vector<double> Line;\n\t\t\/\/for all the other fibers\n\t\tfor (int j = 0 ; j < NbFibers ; j++)\n\t\t\tLine.push_back(0);\n\t\tm_Weight.push_back(Line);\n\t}\n}\n\nvoid FVNormCutGUI::ApplyWeight(bool Type)\n{\n\tstd::vector<int> Alpha=m_Display->GetLastAlpha(FiberDisplay::Previous);\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkIdType NbSourcePoints, NbTargetPoints;\n\tvtkIdType* SourceIds;\n\tvtkIdType* TargetIds;\n\tvtkCellArray* LinesSource=PolyData->GetLines();\n\tvtkCellArray* LinesTarget=PolyData->GetLines();\n\tint NbFibers=PolyData->GetNumberOfCells();\n\tint CountProgress=0;\n\tint RelevantSourceFiberCount=0, RelevantTargetFiberCount=0;\n\tInitWeight();\n\tfor(int i=0; i<NbFibers; i++)\n\t{\n\t\tif(Alpha[i]==1)\n\t\t{\n\t\t\tPolyData->GetCellPoints(i,NbSourcePoints,SourceIds);\n\t\t\tRelevantTargetFiberCount=RelevantSourceFiberCount+1;\n\t\t\tfor(int j=i+1; j<NbFibers; j++)\n\t\t\t{\n\t\t\t\tif(Alpha[j]==1)\n\t\t\t\t{\n\t\t\t\t\tPolyData->GetCellPoints(j,NbTargetPoints,TargetIds);\n\t\t\t\t\tdouble x1, x2;\n\t\t\t\t\tif(Type)\n\t\t\t\t\t{\n\t\t\t\t\t\tx1 = ComputeMeanDistance(j,NbSourcePoints,SourceIds);\n\t\t\t\t\t\tx2 = ComputeMeanDistance(i,NbTargetPoints,TargetIds);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tx1 = ComputeMeanDistance(NbTargetPoints,TargetIds,NbSourcePoints,SourceIds);\n\t\t\t\t\t\tx2 = ComputeMeanDistance(NbSourcePoints,SourceIds,NbTargetPoints,TargetIds);\n\t\t\t\t\t}\n\t\t\t\t\tdouble MeanVal = (x1 + x2) \/ 2;\n\t\t\t\t\tif(MeanVal!=0)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_Weight[RelevantSourceFiberCount][RelevantTargetFiberCount] = 1\/(MeanVal*m_Display->GetSpacing());\n\t\t\t\t\t\tm_Weight[RelevantTargetFiberCount][RelevantSourceFiberCount] = 1\/(MeanVal*m_Display->GetSpacing());\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tm_Weight[RelevantSourceFiberCount][RelevantTargetFiberCount]=0;\n\t\t\t\t\t\tm_Weight[RelevantTargetFiberCount][RelevantSourceFiberCount]=0;\n\t\t\t\t\t}\n\t\t\t\t\tCountProgress++;\n\t\t\t\t\temit Progress(CountProgress*200\/(NbFibers*NbFibers));\n\t\t\t\t\tRelevantTargetFiberCount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tRelevantSourceFiberCount++;\n\t\t}\n\t}\n}\n\n\/\/Compute the MaxMin between two fibers\ndouble FVNormCutGUI::ComputeMeanDistance(int NbSourcePoints,vtkIdType* SourceIds,int NbTargetPoints,vtkIdType* TargetIds)\n{\n\tdouble x,y,z;\n\tdouble xs,ys,zs;\n\tdouble xt,yt,zt;\n\t\n\tdouble MeanDist, Distance, MinDist, TotalDist = 0;\n\t\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkPoints* Points=PolyData->GetPoints();\n\tfor (int i=0;i<NbSourcePoints;i++)\n\t{\n\t\tdouble SourcePoint[3]={0,0,0};\n\t\tPoints->GetPoint(SourceIds[i],SourcePoint);\n\t\tMinDist = 999999999;\n\t\t\/\/For each point of the target fiber\n\t\txs=SourcePoint[0];\n\t\tys=SourcePoint[1];\n\t\tzs=SourcePoint[2];\n\t\t\n\t\tfor (int j=0;j<NbTargetPoints;j++)\n\t\t{\n\t\t\t\/\/calculate distance between the two points\n\t\t\tdouble TargetPoint[3]={0,0,0};\n\t\t\tPoints->GetPoint(TargetIds[j],TargetPoint);\n\t\t\txt = TargetPoint[0];\n\t\t\tyt = TargetPoint[1];\n\t\t\tzt = TargetPoint[2];\n\n\t\t\tx = (xs - xt);\n\t\t\ty = (ys - yt);\n\t\t\tz = (zs - zt);\n\t\t\tDistance = (x*x+y*y+z*z);\n\t\t\t\/\/Keep the minimum distance of the distances between the whole points\n\t\t\t\/\/of the target fiber and one point of the source fiber\n\t\t\tif (Distance<MinDist)\n\t\t\t\tMinDist = Distance;\n\t\t}\n\t\t\/\/Finaly, sum all min\n\t\tTotalDist += MinDist;\n\t}\n\tMeanDist = TotalDist\/NbSourcePoints;\n\t\/\/return the Meanmin to have the Mean distance\n\t\/\/it just remains to take the mean between the couple i,j end j,i\n\treturn sqrt(MeanDist);\n}\n\n\/\/Compute the MaxMin between two fibers\ndouble FVNormCutGUI::ComputeMeanDistance(int SourceId,int NbTargetPoints,vtkIdType* TargetIds)\n{\n\tdouble MeanDist, Distance, TotalDist = 0;\n\t\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkPoints* Points=PolyData->GetPoints();\n\tRealImageType::Pointer DistanceMap=m_Display->GetDTVector(SourceId);\n\t\t\n\tfor (int j=0;j<NbTargetPoints;j++)\n\t{\n\t\tdouble TargetPoint[3]={0,0,0};\n\t\tPoints->GetPoint(TargetIds[j],TargetPoint);\n\t\titk::Point<double,3> ITKPoint;\n\t\tITKPoint[0]=TargetPoint[0];\n\t\tITKPoint[1]=TargetPoint[1];\n\t\tITKPoint[2]=TargetPoint[2];\n\t\t\t\n\t\tContinuousIndexType ContId;\n\t\titk::Index<3> Index;\n\t\t\t\n\t\tDistanceMap->TransformPhysicalPointToContinuousIndex(ITKPoint, ContId);\n\t\tIndex[0]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[0]));\n\t\tIndex[1]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[1]));\n\t\tIndex[2]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[2]));\n\t\tDistance=DistanceMap->GetPixel(Index);\n\t\tTotalDist += Distance;\n\t}\n\tMeanDist = TotalDist\/NbTargetPoints;\n\treturn MeanDist;\n}\n\ndouble FVNormCutGUI::Assoc(int BeginId, int EndId, bool All)\n{\n\tdouble SumWeight=0;\n\tfor(int i=BeginId; i<=EndId; i++)\n\t{\n\t\tif(!All)\n\t\t{\n\t\t\tfor(int j=BeginId; j<=EndId; j++)\n\t\t\t\tSumWeight+=m_Weight[i][j];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(unsigned int j=0; j<m_Weight.size() ; j++)\n\t\t\t\tSumWeight+=m_Weight[i][j];\n\t\t}\n\t}\n\treturn SumWeight;\n}\n\nvoid FVNormCutGUI::GenerateClass()\n{\n\tint ClusterDone=1;\n\tm_Mark=FillMark(m_Weight,ClusterDone,m_SB_Cluster->value());\n}\n\nstd::vector<int> FVNormCutGUI::FillMark(std::vector<std::vector<double> > Weight, int& ClusterDone, int NumberOfCluster)\n{\n\tstd::vector<int> Mark;\n\tif(Weight.size()==1 || NumberOfCluster==1)\n\t{\n\t\tfor(unsigned int i=0; i<Weight.size(); i++)\n\t\t\tMark.push_back(ClusterDone);\n\t\treturn Mark;\n\t}\n\telse\n\t{\n\t\tdouble MinCut=1000;\n\t\tint CutId=-1;\n\t\tfor(unsigned int i=0; i<Weight.size()-1; i++)\n\t\t{\n\t\t\tdouble cut=Cut(i,i+1);\n\t\t\tdouble NCut=cut\/Assoc(0,i,true)+cut\/Assoc(i+1,Weight.size()-1,true);\n\t\t\tif(NCut<MinCut)\n\t\t\t{\n\t\t\t\tCutId=i;\n\t\t\t\tMinCut=NCut;\n\t\t\t}\n\t\t}\n\t\tstd::vector<std::vector<double> > SubWeight;\n\t\tfor(int i=0; i<=CutId; i++)\n\t\t{\n\t\t\tstd::vector<double>Line;\n\t\t\tfor(int j=0; j<=CutId; j++)\n\t\t\t\tLine.push_back(Weight[i][j]);\n\t\t\tSubWeight.push_back(Line);\n\t\t}\n\t\tMark=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2);\n\t\t\n\t\t\n\t\tClusterDone++;\n\t\tSubWeight.clear();\n\t\tfor(unsigned int i=CutId+1; i<Weight.size(); i++)\n\t\t{\n\t\t\tstd::vector<double>Line;\n\t\t\tfor(unsigned int j=CutId+1; j<=Weight.size(); j++)\n\t\t\t\tLine.push_back(Weight[i][j]);\n\t\t\tSubWeight.push_back(Line);\n\t\t}\n\t\tstd::vector<int> MarkTemp;\n\t\t\n\t\tif(NumberOfCluster%2==0)\n\t\t\tMarkTemp=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2);\n\t\telse\n\t\t\tMarkTemp=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2+1);\n\t\tfor(unsigned int i=0; i<MarkTemp.size(); i++)\n\t\t\tMark.push_back(MarkTemp[i]);\n\t\treturn Mark;\n\t}\n}\n\ndouble FVNormCutGUI::Cut(int Previous, int Next)\n{\n\tdouble Cut=0;\n\tfor(int i=0; i<=Previous; i++)\n\t{\n\t\tfor(unsigned int j=Next; j<m_Weight.size(); j++)\n\t\t\tCut+=m_Weight[i][j];\n\t}\n\treturn Cut;\n}\n\nint FVNormCutGUI::GetNumberOfClasse()\n{\n\t\/\/Get the max of the mark vector which is the number of classe\n\tint nbclasse = 0;\n\tfor(unsigned int i = 0 ; i < m_Mark.size() ; i++)\n\t\tif(m_Mark[i] > nbclasse)\n\t\t\tnbclasse = m_Mark[i];\n\treturn nbclasse;\n}\n\nvoid FVNormCutGUI::UndoAction()\n{\n\temit Exit(FVPanelGUI::Undo);\n}\n\nvoid FVNormCutGUI::NextAction()\n{\n\tGenerateClass();\n\temit Exit(FVPanelGUI::Ok);\n}\n<commit_msg>COMP: FVNormalizedCutGUI: Fix unused variable warnings<commit_after>#include \"FVNormalizedCutGUI.h\"\n\nFVNormCutGUI::FVNormCutGUI(QWidget* Parent, FiberDisplay* FVDisplay):FVPanelGUI(Parent,FVDisplay)\n{\n\tm_L_Cluster=new QLabel(\"Number of Cluster\", this);\n\tm_SB_Cluster=new QSpinBox(this);\n\tm_SB_Cluster->setSingleStep(1);\n\tm_SB_Cluster->setRange(2,1000);\n\tm_SB_Cluster->setValue(2);\n\t\n\t\n\tQGridLayout* GL_NormCut=new QGridLayout;\n\tQHBoxLayout* HL_Navigation=new QHBoxLayout;\n\t\n\tGL_NormCut->addWidget(m_L_Cluster,0,0,1,0);\n\tGL_NormCut->addWidget(m_SB_Cluster,1,0,1,0);\n\tHL_Navigation->addWidget(m_PB_Undo);\n\tHL_Navigation->addWidget(m_PB_Next);\n\tGL_NormCut->addLayout(HL_Navigation,2,0,1,0);\n\tGL_NormCut->setRowStretch(3,1);\n\n\tsetLayout(GL_NormCut);\n\t\n\tconnect(m_PB_Undo, SIGNAL(clicked()), this, SLOT(UndoAction()));\n\tconnect(m_PB_Next, SIGNAL(clicked()), this, SLOT(NextAction()));\t\n}\n\nvoid FVNormCutGUI::InitWeight()\n{\n\tm_Weight.clear();\n\tint NbFibers=m_Display->GetNbModifiedFibers();\n\tfor (int i = 0 ; i < NbFibers ; i++)\n\t{\n\t\tstd::vector<double> Line;\n\t\t\/\/for all the other fibers\n\t\tfor (int j = 0 ; j < NbFibers ; j++)\n\t\t\tLine.push_back(0);\n\t\tm_Weight.push_back(Line);\n\t}\n}\n\nvoid FVNormCutGUI::ApplyWeight(bool Type)\n{\n\tstd::vector<int> Alpha=m_Display->GetLastAlpha(FiberDisplay::Previous);\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkIdType NbSourcePoints, NbTargetPoints;\n\tvtkIdType* SourceIds;\n\tvtkIdType* TargetIds;\n\tint NbFibers=PolyData->GetNumberOfCells();\n\tint CountProgress=0;\n\tint RelevantSourceFiberCount=0, RelevantTargetFiberCount=0;\n\tInitWeight();\n\tfor(int i=0; i<NbFibers; i++)\n\t{\n\t\tif(Alpha[i]==1)\n\t\t{\n\t\t\tPolyData->GetCellPoints(i,NbSourcePoints,SourceIds);\n\t\t\tRelevantTargetFiberCount=RelevantSourceFiberCount+1;\n\t\t\tfor(int j=i+1; j<NbFibers; j++)\n\t\t\t{\n\t\t\t\tif(Alpha[j]==1)\n\t\t\t\t{\n\t\t\t\t\tPolyData->GetCellPoints(j,NbTargetPoints,TargetIds);\n\t\t\t\t\tdouble x1, x2;\n\t\t\t\t\tif(Type)\n\t\t\t\t\t{\n\t\t\t\t\t\tx1 = ComputeMeanDistance(j,NbSourcePoints,SourceIds);\n\t\t\t\t\t\tx2 = ComputeMeanDistance(i,NbTargetPoints,TargetIds);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tx1 = ComputeMeanDistance(NbTargetPoints,TargetIds,NbSourcePoints,SourceIds);\n\t\t\t\t\t\tx2 = ComputeMeanDistance(NbSourcePoints,SourceIds,NbTargetPoints,TargetIds);\n\t\t\t\t\t}\n\t\t\t\t\tdouble MeanVal = (x1 + x2) \/ 2;\n\t\t\t\t\tif(MeanVal!=0)\n\t\t\t\t\t{\n\t\t\t\t\t\tm_Weight[RelevantSourceFiberCount][RelevantTargetFiberCount] = 1\/(MeanVal*m_Display->GetSpacing());\n\t\t\t\t\t\tm_Weight[RelevantTargetFiberCount][RelevantSourceFiberCount] = 1\/(MeanVal*m_Display->GetSpacing());\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tm_Weight[RelevantSourceFiberCount][RelevantTargetFiberCount]=0;\n\t\t\t\t\t\tm_Weight[RelevantTargetFiberCount][RelevantSourceFiberCount]=0;\n\t\t\t\t\t}\n\t\t\t\t\tCountProgress++;\n\t\t\t\t\temit Progress(CountProgress*200\/(NbFibers*NbFibers));\n\t\t\t\t\tRelevantTargetFiberCount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tRelevantSourceFiberCount++;\n\t\t}\n\t}\n}\n\n\/\/Compute the MaxMin between two fibers\ndouble FVNormCutGUI::ComputeMeanDistance(int NbSourcePoints,vtkIdType* SourceIds,int NbTargetPoints,vtkIdType* TargetIds)\n{\n\tdouble x,y,z;\n\tdouble xs,ys,zs;\n\tdouble xt,yt,zt;\n\t\n\tdouble MeanDist, Distance, MinDist, TotalDist = 0;\n\t\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkPoints* Points=PolyData->GetPoints();\n\tfor (int i=0;i<NbSourcePoints;i++)\n\t{\n\t\tdouble SourcePoint[3]={0,0,0};\n\t\tPoints->GetPoint(SourceIds[i],SourcePoint);\n\t\tMinDist = 999999999;\n\t\t\/\/For each point of the target fiber\n\t\txs=SourcePoint[0];\n\t\tys=SourcePoint[1];\n\t\tzs=SourcePoint[2];\n\t\t\n\t\tfor (int j=0;j<NbTargetPoints;j++)\n\t\t{\n\t\t\t\/\/calculate distance between the two points\n\t\t\tdouble TargetPoint[3]={0,0,0};\n\t\t\tPoints->GetPoint(TargetIds[j],TargetPoint);\n\t\t\txt = TargetPoint[0];\n\t\t\tyt = TargetPoint[1];\n\t\t\tzt = TargetPoint[2];\n\n\t\t\tx = (xs - xt);\n\t\t\ty = (ys - yt);\n\t\t\tz = (zs - zt);\n\t\t\tDistance = (x*x+y*y+z*z);\n\t\t\t\/\/Keep the minimum distance of the distances between the whole points\n\t\t\t\/\/of the target fiber and one point of the source fiber\n\t\t\tif (Distance<MinDist)\n\t\t\t\tMinDist = Distance;\n\t\t}\n\t\t\/\/Finaly, sum all min\n\t\tTotalDist += MinDist;\n\t}\n\tMeanDist = TotalDist\/NbSourcePoints;\n\t\/\/return the Meanmin to have the Mean distance\n\t\/\/it just remains to take the mean between the couple i,j end j,i\n\treturn sqrt(MeanDist);\n}\n\n\/\/Compute the MaxMin between two fibers\ndouble FVNormCutGUI::ComputeMeanDistance(int SourceId,int NbTargetPoints,vtkIdType* TargetIds)\n{\n\tdouble MeanDist, Distance, TotalDist = 0;\n\t\n\tvtkSmartPointer<vtkPolyData> PolyData;\n\tPolyData=m_Display->GetOriginalPolyData();\n\tvtkPoints* Points=PolyData->GetPoints();\n\tRealImageType::Pointer DistanceMap=m_Display->GetDTVector(SourceId);\n\t\t\n\tfor (int j=0;j<NbTargetPoints;j++)\n\t{\n\t\tdouble TargetPoint[3]={0,0,0};\n\t\tPoints->GetPoint(TargetIds[j],TargetPoint);\n\t\titk::Point<double,3> ITKPoint;\n\t\tITKPoint[0]=TargetPoint[0];\n\t\tITKPoint[1]=TargetPoint[1];\n\t\tITKPoint[2]=TargetPoint[2];\n\t\t\t\n\t\tContinuousIndexType ContId;\n\t\titk::Index<3> Index;\n\t\t\t\n\t\tDistanceMap->TransformPhysicalPointToContinuousIndex(ITKPoint, ContId);\n\t\tIndex[0]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[0]));\n\t\tIndex[1]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[1]));\n\t\tIndex[2]=static_cast<long int>(vnl_math_rnd_halfinttoeven(ContId[2]));\n\t\tDistance=DistanceMap->GetPixel(Index);\n\t\tTotalDist += Distance;\n\t}\n\tMeanDist = TotalDist\/NbTargetPoints;\n\treturn MeanDist;\n}\n\ndouble FVNormCutGUI::Assoc(int BeginId, int EndId, bool All)\n{\n\tdouble SumWeight=0;\n\tfor(int i=BeginId; i<=EndId; i++)\n\t{\n\t\tif(!All)\n\t\t{\n\t\t\tfor(int j=BeginId; j<=EndId; j++)\n\t\t\t\tSumWeight+=m_Weight[i][j];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor(unsigned int j=0; j<m_Weight.size() ; j++)\n\t\t\t\tSumWeight+=m_Weight[i][j];\n\t\t}\n\t}\n\treturn SumWeight;\n}\n\nvoid FVNormCutGUI::GenerateClass()\n{\n\tint ClusterDone=1;\n\tm_Mark=FillMark(m_Weight,ClusterDone,m_SB_Cluster->value());\n}\n\nstd::vector<int> FVNormCutGUI::FillMark(std::vector<std::vector<double> > Weight, int& ClusterDone, int NumberOfCluster)\n{\n\tstd::vector<int> Mark;\n\tif(Weight.size()==1 || NumberOfCluster==1)\n\t{\n\t\tfor(unsigned int i=0; i<Weight.size(); i++)\n\t\t\tMark.push_back(ClusterDone);\n\t\treturn Mark;\n\t}\n\telse\n\t{\n\t\tdouble MinCut=1000;\n\t\tint CutId=-1;\n\t\tfor(unsigned int i=0; i<Weight.size()-1; i++)\n\t\t{\n\t\t\tdouble cut=Cut(i,i+1);\n\t\t\tdouble NCut=cut\/Assoc(0,i,true)+cut\/Assoc(i+1,Weight.size()-1,true);\n\t\t\tif(NCut<MinCut)\n\t\t\t{\n\t\t\t\tCutId=i;\n\t\t\t\tMinCut=NCut;\n\t\t\t}\n\t\t}\n\t\tstd::vector<std::vector<double> > SubWeight;\n\t\tfor(int i=0; i<=CutId; i++)\n\t\t{\n\t\t\tstd::vector<double>Line;\n\t\t\tfor(int j=0; j<=CutId; j++)\n\t\t\t\tLine.push_back(Weight[i][j]);\n\t\t\tSubWeight.push_back(Line);\n\t\t}\n\t\tMark=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2);\n\t\t\n\t\t\n\t\tClusterDone++;\n\t\tSubWeight.clear();\n\t\tfor(unsigned int i=CutId+1; i<Weight.size(); i++)\n\t\t{\n\t\t\tstd::vector<double>Line;\n\t\t\tfor(unsigned int j=CutId+1; j<=Weight.size(); j++)\n\t\t\t\tLine.push_back(Weight[i][j]);\n\t\t\tSubWeight.push_back(Line);\n\t\t}\n\t\tstd::vector<int> MarkTemp;\n\t\t\n\t\tif(NumberOfCluster%2==0)\n\t\t\tMarkTemp=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2);\n\t\telse\n\t\t\tMarkTemp=FillMark(SubWeight,ClusterDone,NumberOfCluster\/2+1);\n\t\tfor(unsigned int i=0; i<MarkTemp.size(); i++)\n\t\t\tMark.push_back(MarkTemp[i]);\n\t\treturn Mark;\n\t}\n}\n\ndouble FVNormCutGUI::Cut(int Previous, int Next)\n{\n\tdouble Cut=0;\n\tfor(int i=0; i<=Previous; i++)\n\t{\n\t\tfor(unsigned int j=Next; j<m_Weight.size(); j++)\n\t\t\tCut+=m_Weight[i][j];\n\t}\n\treturn Cut;\n}\n\nint FVNormCutGUI::GetNumberOfClasse()\n{\n\t\/\/Get the max of the mark vector which is the number of classe\n\tint nbclasse = 0;\n\tfor(unsigned int i = 0 ; i < m_Mark.size() ; i++)\n\t\tif(m_Mark[i] > nbclasse)\n\t\t\tnbclasse = m_Mark[i];\n\treturn nbclasse;\n}\n\nvoid FVNormCutGUI::UndoAction()\n{\n\temit Exit(FVPanelGUI::Undo);\n}\n\nvoid FVNormCutGUI::NextAction()\n{\n\tGenerateClass();\n\temit Exit(FVPanelGUI::Ok);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ITER_CYCLE_H_\n#define ITER_CYCLE_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n template <typename Container>\n class Cycle;\n\n template <typename Container>\n Cycle<Container> cycle(Container&&);\n\n template <typename T>\n Cycle<std::initializer_list<T>> cycle(std::initializer_list<T>);\n\n template <typename Container>\n class Cycle {\n private:\n friend Cycle cycle<Container>(Container&&);\n template <typename T>\n friend Cycle<std::initializer_list<T>> cycle(\n std::initializer_list<T>);\n\n Container container;\n \n Cycle(Container&& container)\n : container(std::forward<Container>(container))\n { }\n\n public:\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n private:\n using iter_type = iterator_type<Container>;\n iterator_type<Container> sub_iter;\n iterator_type<Container> begin;\n iterator_type<Container> end;\n public:\n Iterator (iterator_type<Container> iter,\n iterator_type<Container> end)\n : sub_iter{iter},\n begin{iter},\n end{end}\n { } \n\n iterator_deref<Container> operator*() {\n return *this->sub_iter;\n }\n\n Iterator& operator++() { \n ++this->sub_iter;\n \/\/ reset to beginning upon reaching the end\n if (!(this->sub_iter != this->end)) {\n this->sub_iter = this->begin;\n }\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container)};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container)};\n }\n\n };\n\n template <typename Container>\n Cycle<Container> cycle(Container&& container) {\n return {std::forward<Container>(container)};\n }\n\n template <typename T>\n Cycle<std::initializer_list<T>> cycle(std::initializer_list<T> il)\n {\n return {std::move(il)};\n }\n}\n\n#endif\n<commit_msg>moves end, copies begin<commit_after>#ifndef ITER_CYCLE_H_\n#define ITER_CYCLE_H_\n\n#include \"iterbase.hpp\"\n\n#include <utility>\n#include <iterator>\n#include <initializer_list>\n\nnamespace iter {\n\n template <typename Container>\n class Cycle;\n\n template <typename Container>\n Cycle<Container> cycle(Container&&);\n\n template <typename T>\n Cycle<std::initializer_list<T>> cycle(std::initializer_list<T>);\n\n template <typename Container>\n class Cycle {\n private:\n friend Cycle cycle<Container>(Container&&);\n template <typename T>\n friend Cycle<std::initializer_list<T>> cycle(\n std::initializer_list<T>);\n\n Container container;\n \n Cycle(Container&& container)\n : container(std::forward<Container>(container))\n { }\n\n public:\n class Iterator \n : public std::iterator<std::input_iterator_tag,\n iterator_traits_deref<Container>>\n {\n private:\n using iter_type = iterator_type<Container>;\n iterator_type<Container> sub_iter;\n iterator_type<Container> begin;\n iterator_type<Container> end;\n public:\n Iterator (const iterator_type<Container>& iter,\n iterator_type<Container>&& end)\n : sub_iter{iter},\n begin{iter},\n end{std::move(end)}\n { } \n\n iterator_deref<Container> operator*() {\n return *this->sub_iter;\n }\n\n Iterator& operator++() { \n ++this->sub_iter;\n \/\/ reset to beginning upon reaching the end\n if (!(this->sub_iter != this->end)) {\n this->sub_iter = this->begin;\n }\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n bool operator!=(const Iterator& other) const {\n return this->sub_iter != other.sub_iter;\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() {\n return {std::begin(this->container),\n std::end(this->container)};\n }\n\n Iterator end() {\n return {std::end(this->container),\n std::end(this->container)};\n }\n\n };\n\n template <typename Container>\n Cycle<Container> cycle(Container&& container) {\n return {std::forward<Container>(container)};\n }\n\n template <typename T>\n Cycle<std::initializer_list<T>> cycle(std::initializer_list<T> il)\n {\n return {std::move(il)};\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n\n#include \"SDL.h\"\n\n#include \"GameWorldPanel.h\"\n\n#include \"AutomapPanel.h\"\n#include \"Button.h\"\n#include \"CharacterPanel.h\"\n#include \"LogbookPanel.h\"\n#include \"PauseMenuPanel.h\"\n#include \"WorldMapPanel.h\"\n#include \"..\/Entities\/CoordinateFrame.h\"\n#include \"..\/Entities\/Player.h\"\n#include \"..\/Game\/GameData.h\"\n#include \"..\/Game\/GameState.h\"\n#include \"..\/Game\/Options.h\"\n#include \"..\/Math\/Constants.h\"\n#include \"..\/Math\/Int2.h\"\n#include \"..\/Math\/Random.h\"\n#include \"..\/Math\/Rect.h\"\n#include \"..\/Media\/AudioManager.h\"\n#include \"..\/Media\/Color.h\"\n#include \"..\/Media\/MusicName.h\"\n#include \"..\/Media\/PaletteName.h\"\n#include \"..\/Media\/SoundName.h\"\n#include \"..\/Media\/TextureFile.h\"\n#include \"..\/Media\/TextureManager.h\"\n#include \"..\/Media\/TextureName.h\"\n#include \"..\/Rendering\/CLProgram.h\"\n#include \"..\/Rendering\/Renderer.h\"\n#include \"..\/Utilities\/Debug.h\"\n\nGameWorldPanel::GameWorldPanel(GameState *gameState)\n\t: Panel(gameState)\n{\n\tassert(gameState->gameDataIsActive());\n\n\tthis->automapButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> automapPanel(new AutomapPanel(gameState));\n\t\t\tgameState->setPanel(std::move(automapPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->characterSheetButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> sheetPanel(new CharacterPanel(gameState));\n\t\t\tgameState->setPanel(std::move(sheetPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->logbookButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> logbookPanel(new LogbookPanel(gameState));\n\t\t\tgameState->setPanel(std::move(logbookPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->pauseButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> pausePanel(new PauseMenuPanel(gameState));\n\t\t\tgameState->setPanel(std::move(pausePanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->worldMapButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> mapPanel(new WorldMapPanel(gameState));\n\t\t\tgameState->setPanel(std::move(mapPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n}\n\nGameWorldPanel::~GameWorldPanel()\n{\n\n}\n\nvoid GameWorldPanel::handleEvents(bool &running)\n{\n\tSDL_Event e;\n\twhile (SDL_PollEvent(&e) != 0)\n\t{\n\t\tbool applicationExit = (e.type == SDL_QUIT);\n\t\tbool resized = (e.type == SDL_WINDOWEVENT) &&\n\t\t\t(e.window.event == SDL_WINDOWEVENT_RESIZED);\n\t\tbool escapePressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_ESCAPE);\n\n\t\tif (applicationExit)\n\t\t{\n\t\t\trunning = false;\n\t\t}\n\t\tif (resized)\n\t\t{\n\t\t\tint width = e.window.data1;\n\t\t\tint height = e.window.data2;\n\t\t\tthis->getGameState()->resizeWindow(width, height);\n\t\t}\n\t\tif (escapePressed)\n\t\t{\n\t\t\tthis->pauseButton->click(this->getGameState());\n\t\t}\n\n\t\tbool leftClick = (e.type == SDL_MOUSEBUTTONDOWN) &&\n\t\t\t(e.button.button == SDL_BUTTON_LEFT);\n\t\tbool activateHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_e);\n\t\tbool automapHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_n);\n\t\tbool logbookHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_l);\n\t\tbool sheetHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_TAB);\n\t\tbool worldMapHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_m);\n\n\t\tif (leftClick)\n\t\t{\n\t\t\t\/\/ Interface buttons? Entities in the world?\n\t\t}\n\t\tif (activateHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Activate whatever is looked at.\n\t\t}\n\t\telse if (automapHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the automap.\n\t\t\tthis->automapButton->click(this->getGameState());\n\t\t}\n\t\telse if (logbookHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the logbook.\n\t\t\tthis->logbookButton->click(this->getGameState());\n\t\t}\n\t\telse if (sheetHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the character screen.\n\t\t\tthis->characterSheetButton->click(this->getGameState());\n\t\t}\n\t\telse if (worldMapHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the world map.\n\t\t\tthis->worldMapButton->click(this->getGameState());\n\t\t}\n\t}\n}\n\nvoid GameWorldPanel::handleMouse(double dt)\n{\n\tstatic_cast<void>(dt);\n\n\t\/\/ Make the camera look around.\n\tint dx, dy;\n\tconst auto mouse = SDL_GetRelativeMouseState(&dx, &dy);\n\n\t\/\/ The program will eventually not require holding a mouse button to turn.\n\tbool leftClick = (mouse & SDL_BUTTON(SDL_BUTTON_LEFT)) != 0;\n\tbool rightClick = (mouse & SDL_BUTTON(SDL_BUTTON_RIGHT)) != 0;\n\tbool turning = ((dx != 0) || (dy != 0)) && (leftClick || rightClick);\n\n\tif (turning)\n\t{\n\t\tauto dimensions = this->getGameState()->getScreenDimensions();\n\t\tdouble dxx = static_cast<double>(dx) \/ static_cast<double>(dimensions.getX());\n\t\tdouble dyy = static_cast<double>(dy) \/ static_cast<double>(dimensions.getY());\n\n\t\t\/\/ Pitch and\/or yaw the camera.\n\t\tconst auto &options = this->getGameState()->getOptions();\n\t\tthis->getGameState()->getGameData()->getPlayer().rotate(dxx, -dyy,\n\t\t\toptions.getHorizontalSensitivity(), options.getVerticalSensitivity(),\n\t\t\toptions.getVerticalFOV());\n\t}\n}\n\nvoid GameWorldPanel::handleKeyboard(double dt)\n{\n\t\/\/ Listen for WASD, jump...\n\tconst auto keys = SDL_GetKeyboardState(nullptr);\n\n\tbool forward = keys[SDL_SCANCODE_W] != 0;\n\tbool backward = keys[SDL_SCANCODE_S] != 0;\n\tbool left = keys[SDL_SCANCODE_A] != 0;\n\tbool right = keys[SDL_SCANCODE_D] != 0;\n\tbool jump = keys[SDL_SCANCODE_SPACE] != 0;\n\n\tbool any = forward || backward || left || right || jump;\n\n\tif (any)\n\t{\n\t\tbool isRunning = keys[SDL_SCANCODE_LSHIFT] != 0;\n\t\tauto &player = this->getGameState()->getGameData()->getPlayer();\n\n\t\t\/\/ Get some relevant player direction data.\n\t\tFloat2d groundDirection = player.getGroundDirection();\n\t\tFloat3d groundDirection3D = Float3d(groundDirection.getX(), 0.0,\n\t\t\tgroundDirection.getY()).normalized();\n\t\tFloat3d rightDirection = player.getFrame().getRight().normalized();\n\n\t\t\/\/ Calculate the acceleration direction based on input.\n\t\tFloat3d accelDirection = Float3d(0.0, 0.0, 0.0);\n\t\tif (forward)\n\t\t{\n\t\t\taccelDirection = accelDirection + groundDirection3D;\n\t\t}\n\t\tif (backward)\n\t\t{\n\t\t\taccelDirection = accelDirection - groundDirection3D;\n\t\t}\n\t\tif (right)\n\t\t{\n\t\t\taccelDirection = accelDirection + rightDirection;\n\t\t}\n\t\tif (left)\n\t\t{\n\t\t\taccelDirection = accelDirection - rightDirection;\n\t\t}\n\n\t\t\/\/ To do: check jump eventually once gravity and ground collision are implemented.\n\n\t\t\/\/ Use a normalized direction.\n\t\taccelDirection = accelDirection.normalized();\n\n\t\t\/\/ Set the magnitude of the acceleration to some arbitrary numbers. These values \n\t\t\/\/ are independent of max speed. The original game didn't have sprinting, but it \n\t\t\/\/ seems like something relevant to do anyway (at least in testing).\n\t\tdouble accelMagnitude = isRunning ? 35.0 : 10.0;\n\n\t\t\/\/ Change the player's velocity if valid.\n\t\tif (std::isfinite(accelDirection.length()))\n\t\t{\n\t\t\tplayer.accelerate(accelDirection, accelMagnitude, isRunning, dt);\n\t\t}\n\t}\n}\n\nvoid GameWorldPanel::tick(double dt, bool &running)\n{\n\tassert(this->getGameState()->gameDataIsActive());\n\n\tthis->handleEvents(running);\n\tthis->handleMouse(dt);\n\tthis->handleKeyboard(dt);\n\n\t\/\/ Animate the game world.\n\tauto *gameData = this->getGameState()->getGameData();\n\tgameData->incrementGameTime(dt);\n\n\t\/\/ Tick the player.\n\tauto &player = gameData->getPlayer();\n\tplayer.tick(this->getGameState(), dt);\n\n\t\/\/ Update CLProgram members that are refreshed each frame.\n\tdouble verticalFOV = this->getGameState()->getOptions().getVerticalFOV();\n\tauto &clProgram = gameData->getCLProgram();\n\tclProgram.updateCamera(player.getPosition(), player.getDirection(), verticalFOV);\n\tclProgram.updateGameTime(gameData->getGameTime());\n}\n\nvoid GameWorldPanel::render(SDL_Renderer *renderer, const SDL_Rect *letterbox)\n{\n\tassert(this->getGameState()->gameDataIsActive());\n\n\t\/\/ Draw game world using OpenCL rendering.\n\tthis->getGameState()->getGameData()->getCLProgram().render(renderer);\n\n\t\/\/ Interface objects (stat bars, compass, ...) should snap to the edges of the native\n\t\/\/ screen, not just the letterbox, because right now, when the screen is tall, the\n\t\/\/ compass is near the middle of the screen (in the way), and the stat bars are much\n\t\/\/ higher than they should be. I haven't figured out yet what the equation is. I\n\t\/\/ think it requires using the original height and the draw scale somehow.\n\n\t\/\/ Set screen palette.\n\tauto &textureManager = this->getGameState()->getTextureManager();\n\ttextureManager.setPalette(PaletteName::Default);\n\n\t\/\/ Draw game world interface.\n\tconst auto *gameInterface = textureManager.getTexture(\n\t\tTextureFile::fromName(TextureName::GameWorldInterface));\n\tint gameInterfaceWidth, gameInterfaceHeight;\n\tSDL_QueryTexture(const_cast<SDL_Texture*>(gameInterface), nullptr, nullptr,\n\t\t&gameInterfaceWidth, &gameInterfaceHeight);\n\n\tthis->drawScaledToNative(gameInterface,\n\t\t(ORIGINAL_WIDTH \/ 2) - (gameInterfaceWidth \/ 2),\n\t\tORIGINAL_HEIGHT - gameInterfaceHeight,\n\t\tgameInterfaceWidth,\n\t\tgameInterfaceHeight,\n\t\trenderer);\n\n\t\/\/ Compass frame.\n\tconst auto &compassFrame = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::CompassFrame));\n\tSDL_SetColorKey(compassFrame.getSurface(), SDL_TRUE, Color::Black.toRGB());\n\n\t\/\/ Compass slider (the actual headings). +X is north, +Z is east.\n\tconst auto &compassSlider = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::CompassSlider));\n\n\tSurface compassSliderSegment(32, 7);\n\tcompassSlider.blit(compassSliderSegment, Int2(), Rect(60, 0,\n\t\tcompassSliderSegment.getWidth(), compassSliderSegment.getHeight()));\n\n\t\/\/ Should do some sin() and cos() functions to get the segment location.\n\t\/\/int segmentX = ...;\n\n\t\/\/ Fill in transparent edges behind compass slider (due to SDL blit truncation).\n\tSurface compassFiller(36, 11);\n\tcompassFiller.fill(Color(205, 186, 155));\n\n\tthis->drawScaledToNative(compassFiller,\n\t\t(ORIGINAL_WIDTH \/ 2) - (compassFrame.getWidth() \/ 2) + 1,\n\t\t5,\n\t\tcompassFiller.getWidth(),\n\t\tcompassFiller.getHeight(),\n\t\trenderer);\n\n\tthis->drawScaledToNative(compassSliderSegment,\n\t\t(ORIGINAL_WIDTH \/ 2) - 16,\n\t\t7,\n\t\tcompassSliderSegment.getWidth(),\n\t\tcompassSliderSegment.getHeight(),\n\t\trenderer);\n\n\tthis->drawScaledToNative(compassFrame,\n\t\t(ORIGINAL_WIDTH \/ 2) - (compassFrame.getWidth() \/ 2),\n\t\t0,\n\t\tcompassFrame.getWidth(),\n\t\tcompassFrame.getHeight(),\n\t\trenderer);\n\n\t\/\/ Draw cursor.\n\tconst auto &cursor = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::SwordCursor));\n\tthis->drawCursor(cursor, renderer);\n}\n<commit_msg>Fill in small edge on game world interface.<commit_after>#include <cassert>\n\n#include \"SDL.h\"\n\n#include \"GameWorldPanel.h\"\n\n#include \"AutomapPanel.h\"\n#include \"Button.h\"\n#include \"CharacterPanel.h\"\n#include \"LogbookPanel.h\"\n#include \"PauseMenuPanel.h\"\n#include \"WorldMapPanel.h\"\n#include \"..\/Entities\/CoordinateFrame.h\"\n#include \"..\/Entities\/Player.h\"\n#include \"..\/Game\/GameData.h\"\n#include \"..\/Game\/GameState.h\"\n#include \"..\/Game\/Options.h\"\n#include \"..\/Math\/Constants.h\"\n#include \"..\/Math\/Int2.h\"\n#include \"..\/Math\/Random.h\"\n#include \"..\/Math\/Rect.h\"\n#include \"..\/Media\/AudioManager.h\"\n#include \"..\/Media\/Color.h\"\n#include \"..\/Media\/MusicName.h\"\n#include \"..\/Media\/PaletteName.h\"\n#include \"..\/Media\/SoundName.h\"\n#include \"..\/Media\/TextureFile.h\"\n#include \"..\/Media\/TextureManager.h\"\n#include \"..\/Media\/TextureName.h\"\n#include \"..\/Rendering\/CLProgram.h\"\n#include \"..\/Rendering\/Renderer.h\"\n#include \"..\/Utilities\/Debug.h\"\n\nGameWorldPanel::GameWorldPanel(GameState *gameState)\n\t: Panel(gameState)\n{\n\tassert(gameState->gameDataIsActive());\n\n\tthis->automapButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> automapPanel(new AutomapPanel(gameState));\n\t\t\tgameState->setPanel(std::move(automapPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->characterSheetButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> sheetPanel(new CharacterPanel(gameState));\n\t\t\tgameState->setPanel(std::move(sheetPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->logbookButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> logbookPanel(new LogbookPanel(gameState));\n\t\t\tgameState->setPanel(std::move(logbookPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->pauseButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> pausePanel(new PauseMenuPanel(gameState));\n\t\t\tgameState->setPanel(std::move(pausePanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n\n\tthis->worldMapButton = []()\n\t{\n\t\tauto function = [](GameState *gameState)\n\t\t{\n\t\t\tstd::unique_ptr<Panel> mapPanel(new WorldMapPanel(gameState));\n\t\t\tgameState->setPanel(std::move(mapPanel));\n\t\t};\n\t\treturn std::unique_ptr<Button>(new Button(function));\n\t}();\n}\n\nGameWorldPanel::~GameWorldPanel()\n{\n\n}\n\nvoid GameWorldPanel::handleEvents(bool &running)\n{\n\tSDL_Event e;\n\twhile (SDL_PollEvent(&e) != 0)\n\t{\n\t\tbool applicationExit = (e.type == SDL_QUIT);\n\t\tbool resized = (e.type == SDL_WINDOWEVENT) &&\n\t\t\t(e.window.event == SDL_WINDOWEVENT_RESIZED);\n\t\tbool escapePressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_ESCAPE);\n\n\t\tif (applicationExit)\n\t\t{\n\t\t\trunning = false;\n\t\t}\n\t\tif (resized)\n\t\t{\n\t\t\tint width = e.window.data1;\n\t\t\tint height = e.window.data2;\n\t\t\tthis->getGameState()->resizeWindow(width, height);\n\t\t}\n\t\tif (escapePressed)\n\t\t{\n\t\t\tthis->pauseButton->click(this->getGameState());\n\t\t}\n\n\t\tbool leftClick = (e.type == SDL_MOUSEBUTTONDOWN) &&\n\t\t\t(e.button.button == SDL_BUTTON_LEFT);\n\t\tbool activateHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_e);\n\t\tbool automapHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_n);\n\t\tbool logbookHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_l);\n\t\tbool sheetHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_TAB);\n\t\tbool worldMapHotkeyPressed = (e.type == SDL_KEYDOWN) &&\n\t\t\t(e.key.keysym.sym == SDLK_m);\n\n\t\tif (leftClick)\n\t\t{\n\t\t\t\/\/ Interface buttons? Entities in the world?\n\t\t}\n\t\tif (activateHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Activate whatever is looked at.\n\t\t}\n\t\telse if (automapHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the automap.\n\t\t\tthis->automapButton->click(this->getGameState());\n\t\t}\n\t\telse if (logbookHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the logbook.\n\t\t\tthis->logbookButton->click(this->getGameState());\n\t\t}\n\t\telse if (sheetHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the character screen.\n\t\t\tthis->characterSheetButton->click(this->getGameState());\n\t\t}\n\t\telse if (worldMapHotkeyPressed)\n\t\t{\n\t\t\t\/\/ Go to the world map.\n\t\t\tthis->worldMapButton->click(this->getGameState());\n\t\t}\n\t}\n}\n\nvoid GameWorldPanel::handleMouse(double dt)\n{\n\tstatic_cast<void>(dt);\n\n\t\/\/ Make the camera look around.\n\tint dx, dy;\n\tconst auto mouse = SDL_GetRelativeMouseState(&dx, &dy);\n\n\t\/\/ The program will eventually not require holding a mouse button to turn.\n\tbool leftClick = (mouse & SDL_BUTTON(SDL_BUTTON_LEFT)) != 0;\n\tbool rightClick = (mouse & SDL_BUTTON(SDL_BUTTON_RIGHT)) != 0;\n\tbool turning = ((dx != 0) || (dy != 0)) && (leftClick || rightClick);\n\n\tif (turning)\n\t{\n\t\tauto dimensions = this->getGameState()->getScreenDimensions();\n\t\tdouble dxx = static_cast<double>(dx) \/ static_cast<double>(dimensions.getX());\n\t\tdouble dyy = static_cast<double>(dy) \/ static_cast<double>(dimensions.getY());\n\n\t\t\/\/ Pitch and\/or yaw the camera.\n\t\tconst auto &options = this->getGameState()->getOptions();\n\t\tthis->getGameState()->getGameData()->getPlayer().rotate(dxx, -dyy,\n\t\t\toptions.getHorizontalSensitivity(), options.getVerticalSensitivity(),\n\t\t\toptions.getVerticalFOV());\n\t}\n}\n\nvoid GameWorldPanel::handleKeyboard(double dt)\n{\n\t\/\/ Listen for WASD, jump...\n\tconst auto keys = SDL_GetKeyboardState(nullptr);\n\n\tbool forward = keys[SDL_SCANCODE_W] != 0;\n\tbool backward = keys[SDL_SCANCODE_S] != 0;\n\tbool left = keys[SDL_SCANCODE_A] != 0;\n\tbool right = keys[SDL_SCANCODE_D] != 0;\n\tbool jump = keys[SDL_SCANCODE_SPACE] != 0;\n\n\tbool any = forward || backward || left || right || jump;\n\n\tif (any)\n\t{\n\t\tbool isRunning = keys[SDL_SCANCODE_LSHIFT] != 0;\n\t\tauto &player = this->getGameState()->getGameData()->getPlayer();\n\n\t\t\/\/ Get some relevant player direction data.\n\t\tFloat2d groundDirection = player.getGroundDirection();\n\t\tFloat3d groundDirection3D = Float3d(groundDirection.getX(), 0.0,\n\t\t\tgroundDirection.getY()).normalized();\n\t\tFloat3d rightDirection = player.getFrame().getRight().normalized();\n\n\t\t\/\/ Calculate the acceleration direction based on input.\n\t\tFloat3d accelDirection = Float3d(0.0, 0.0, 0.0);\n\t\tif (forward)\n\t\t{\n\t\t\taccelDirection = accelDirection + groundDirection3D;\n\t\t}\n\t\tif (backward)\n\t\t{\n\t\t\taccelDirection = accelDirection - groundDirection3D;\n\t\t}\n\t\tif (right)\n\t\t{\n\t\t\taccelDirection = accelDirection + rightDirection;\n\t\t}\n\t\tif (left)\n\t\t{\n\t\t\taccelDirection = accelDirection - rightDirection;\n\t\t}\n\n\t\t\/\/ To do: check jump eventually once gravity and ground collision are implemented.\n\n\t\t\/\/ Use a normalized direction.\n\t\taccelDirection = accelDirection.normalized();\n\n\t\t\/\/ Set the magnitude of the acceleration to some arbitrary numbers. These values \n\t\t\/\/ are independent of max speed. The original game didn't have sprinting, but it \n\t\t\/\/ seems like something relevant to do anyway (at least in testing).\n\t\tdouble accelMagnitude = isRunning ? 35.0 : 10.0;\n\n\t\t\/\/ Change the player's velocity if valid.\n\t\tif (std::isfinite(accelDirection.length()))\n\t\t{\n\t\t\tplayer.accelerate(accelDirection, accelMagnitude, isRunning, dt);\n\t\t}\n\t}\n}\n\nvoid GameWorldPanel::tick(double dt, bool &running)\n{\n\tassert(this->getGameState()->gameDataIsActive());\n\n\tthis->handleEvents(running);\n\tthis->handleMouse(dt);\n\tthis->handleKeyboard(dt);\n\n\t\/\/ Animate the game world.\n\tauto *gameData = this->getGameState()->getGameData();\n\tgameData->incrementGameTime(dt);\n\n\t\/\/ Tick the player.\n\tauto &player = gameData->getPlayer();\n\tplayer.tick(this->getGameState(), dt);\n\n\t\/\/ Update CLProgram members that are refreshed each frame.\n\tdouble verticalFOV = this->getGameState()->getOptions().getVerticalFOV();\n\tauto &clProgram = gameData->getCLProgram();\n\tclProgram.updateCamera(player.getPosition(), player.getDirection(), verticalFOV);\n\tclProgram.updateGameTime(gameData->getGameTime());\n}\n\nvoid GameWorldPanel::render(SDL_Renderer *renderer, const SDL_Rect *letterbox)\n{\n\tassert(this->getGameState()->gameDataIsActive());\n\n\t\/\/ Draw game world using OpenCL rendering.\n\tthis->getGameState()->getGameData()->getCLProgram().render(renderer);\n\n\t\/\/ Interface objects (stat bars, compass, ...) should snap to the edges of the native\n\t\/\/ screen, not just the letterbox, because right now, when the screen is tall, the\n\t\/\/ compass is near the middle of the screen (in the way), and the stat bars are much\n\t\/\/ higher than they should be. I haven't figured out yet what the equation is. I\n\t\/\/ think it requires using the original height and the draw scale somehow.\n\n\t\/\/ Set screen palette.\n\tauto &textureManager = this->getGameState()->getTextureManager();\n\ttextureManager.setPalette(PaletteName::Default);\n\n\t\/\/ Draw game world interface.\n\tconst auto *gameInterface = textureManager.getTexture(\n\t\tTextureFile::fromName(TextureName::GameWorldInterface));\n\tint gameInterfaceWidth, gameInterfaceHeight;\n\tSDL_QueryTexture(const_cast<SDL_Texture*>(gameInterface), nullptr, nullptr,\n\t\t&gameInterfaceWidth, &gameInterfaceHeight);\n\n\tthis->drawScaledToNative(gameInterface,\n\t\t(ORIGINAL_WIDTH \/ 2) - (gameInterfaceWidth \/ 2),\n\t\tORIGINAL_HEIGHT - gameInterfaceHeight,\n\t\tgameInterfaceWidth,\n\t\tgameInterfaceHeight,\n\t\trenderer);\n\n\t\/\/ Compass frame.\n\tconst auto &compassFrame = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::CompassFrame));\n\tSDL_SetColorKey(compassFrame.getSurface(), SDL_TRUE, Color::Black.toRGB());\n\n\t\/\/ Compass slider (the actual headings). +X is north, +Z is east.\n\tconst auto &compassSlider = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::CompassSlider));\n\n\tSurface compassSliderSegment(32, 7);\n\tcompassSlider.blit(compassSliderSegment, Int2(), Rect(60, 0,\n\t\tcompassSliderSegment.getWidth(), compassSliderSegment.getHeight()));\n\n\t\/\/ Should do some sin() and cos() functions to get the segment location.\n\t\/\/int segmentX = ...;\n\n\t\/\/ Fill in edges behind interface objects due to SDL blit truncation.\n\tSurface mainFiller(gameInterfaceWidth, 2);\n\tmainFiller.fill(Color(15, 15, 27));\n\n\tthis->drawScaledToNative(mainFiller,\n\t\t(ORIGINAL_WIDTH \/ 2) - (mainFiller.getWidth() \/ 2),\n\t\tORIGINAL_HEIGHT - (mainFiller.getHeight() - 1),\n\t\tmainFiller.getWidth(),\n\t\tmainFiller.getHeight(),\n\t\trenderer);\n\n\tSurface compassFiller(36, 11);\n\tcompassFiller.fill(Color(205, 186, 155));\n\n\tthis->drawScaledToNative(compassFiller,\n\t\t(ORIGINAL_WIDTH \/ 2) - (compassFrame.getWidth() \/ 2) + 1,\n\t\t5,\n\t\tcompassFiller.getWidth(),\n\t\tcompassFiller.getHeight(),\n\t\trenderer);\n\n\tthis->drawScaledToNative(compassSliderSegment,\n\t\t(ORIGINAL_WIDTH \/ 2) - 16,\n\t\t7,\n\t\tcompassSliderSegment.getWidth(),\n\t\tcompassSliderSegment.getHeight(),\n\t\trenderer);\n\n\tthis->drawScaledToNative(compassFrame,\n\t\t(ORIGINAL_WIDTH \/ 2) - (compassFrame.getWidth() \/ 2),\n\t\t0,\n\t\tcompassFrame.getWidth(),\n\t\tcompassFrame.getHeight(),\n\t\trenderer);\n\n\t\/\/ Draw cursor.\n\tconst auto &cursor = textureManager.getSurface(\n\t\tTextureFile::fromName(TextureName::SwordCursor));\n\tthis->drawCursor(cursor, renderer);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=====================================================================\/\/\n\/*! @file\n @brief GR-KAEDE_net (RX64M) メイン @n\n\t\t\tCopyright 2017 Kunihito Hiramatsu\n @author 平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/rspi_io.hpp\"\n#include \"common\/sdc_io.hpp\"\n#include \"common\/fifo.hpp\"\n#include \"common\/cmt_io.hpp\"\n#include \"common\/sci_io.hpp\"\n#include \"common\/format.hpp\"\n#include \"common\/input.hpp\"\n#include \"common\/fixed_string.hpp\"\n\n#include \"chip\/phy_base.hpp\"\n#include \"net2\/net_main.hpp\"\n\/\/#include \"net\/http_server.hpp\"\n\nnamespace {\n\n\ttypedef device::ETHERC0 ETHERC; \/\/ Ethernet Controller\n\ttypedef device::EDMAC0 EDMAC; \/\/ Ethernet DMA Controller\n\ttypedef chip::phy_base<ETHERC> PHY; \/\/ Ethernet PHY (LAN8720)\n\ttypedef device::ether_io<ETHERC, EDMAC, PHY> ETHER_IO;\n\tETHER_IO \tether_;\n\n\tvolatile bool tcpip_flag_ = false;\n\tvolatile uint32_t net_int_cnt_ = 0;\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief CMT タスク\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tclass cmt_task {\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tcmt_task() { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief オペレーター ()\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid operator() () {\n\t\t}\n\t};\n\n\n\ttypedef device::cmt_io<device::CMT0, cmt_task> CMT0;\n\tCMT0\tcmt_;\n\n\ttypedef utils::fifo<uint8_t, 4096> BUFFER;\n\ttypedef device::sci_io<device::SCI7, BUFFER, BUFFER> SCI;\n\tSCI\t\tsci_;\n\n\t\/\/ SDC 用　SPI 定義（RSPI）\n\ttypedef device::rspi_io<device::RSPI> SPI;\n\tSPI\t\tspi_;\n\n\ttypedef device::PORT<device::PORTC, device::bitpos::B4> SDC_SELECT;\t\/\/\/< カード選択信号\n\ttypedef device::NULL_PORT SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\n\ttypedef device::PORT<device::PORTB, device::bitpos::B7> SDC_DETECT;\t\/\/\/< カード検出\n\n\ttypedef utils::sdc_io<SPI, SDC_SELECT, SDC_POWER, SDC_DETECT> SDC;\n\tSDC\t\tsdc_(spi_, 20000000);\n\n\ttypedef utils::rtc_io RTC;\n\tRTC\t\trtc_;\n\n\tstatic const uint32_t UDPN = 4; \/\/ UDP の経路数\n \tstatic const uint32_t TCPN = 6; \/\/ TCP の経路数\n\ttypedef net::net_main<ETHER_IO, UDPN, TCPN> NET_MAIN;\n\tNET_MAIN\tnet_(ether_);\n\n\/\/\ttypedef net::http_server<ETHER_IO, SDC> HTTP;\n\/\/\tHTTP\t\thttp_(ether_, sdc_);\n}\n\nextern \"C\" {\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字出力\n\t\t@param[in]\tch\t文字\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid sci_putch(char ch)\n\t{\n\t\tsci_.putch(ch);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字列出力\n\t\t@param[in]\ts\t文字列\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid sci_puts(const char* s)\n\t{\n\t\tsci_.puts(s);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字入力\n\t\t@return\t文字\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tchar sci_getch(void)\n\t{\n\t\treturn sci_.getch();\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字列長の取得\n\t\t@return\t文字列長\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tuint16_t sci_length(void)\n\t{\n\t\treturn sci_.recv_length();\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief GMT 時間の取得\n\t\t@return GMT 時間\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\ttime_t get_time()\n\t{\n\t\ttime_t t = 0;\n\t\trtc_.get_time(t);\n\t\treturn t;\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へ初期化関数を提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@return ステータス\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDSTATUS disk_initialize(BYTE drv) {\n\t\treturn sdc_.at_mmc().disk_initialize(drv);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へステータスを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDSTATUS disk_status(BYTE drv) {\n\t\treturn sdc_.at_mmc().disk_status(drv);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へリード・セクターを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[out]\tbuff\tPointer to the data buffer to store read data\n\t\t@param[in]\tsector\tStart sector number (LBA)\n\t\t@param[in]\tcount\tSector count (1..128)\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_read(BYTE drv, BYTE* buff, DWORD sector, UINT count) {\n\t\treturn sdc_.at_mmc().disk_read(drv, buff, sector, count);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へライト・セクターを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[in]\tbuff\tPointer to the data to be written\t\n\t\t@param[in]\tsector\tStart sector number (LBA)\n\t\t@param[in]\tcount\tSector count (1..128)\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_write(BYTE drv, const BYTE* buff, DWORD sector, UINT count) {\n\t\treturn sdc_.at_mmc().disk_write(drv, buff, sector, count);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へI\/O コントロールを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[in]\tctrl\tControl code\n\t\t@param[in]\tbuff\tBuffer to send\/receive control data\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_ioctl(BYTE drv, BYTE ctrl, void* buff) {\n\t\treturn sdc_.at_mmc().disk_ioctl(drv, ctrl, buff);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へ時間を提供\n\t\t@return FatFs 時間\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDWORD get_fattime(void) {\n\t\tauto t = get_time();\n\t\treturn utils::str::get_fattime(t);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tUTF-8 から ShiftJIS への変換\n\t\t@param[in]\tsrc\tUTF-8 文字列ソース\n\t\t@param[out]\tdst\tShiftJIS 文字列出力\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid utf8_to_sjis(const char* src, char* dst) {\n\t\tutils::str::utf8_to_sjis(src, dst);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tイーサーネット・割り込みタスク\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid ether_process_(void)\n\t{\n\t\tnet_.process();\n\t}\n}\n\n\nint main(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n\tdevice::init_port();\n\n\tdevice::PORTC::PDR.B0 = 1; \/\/ output\n\tdevice::PORTC::PDR.B1 = 1; \/\/ output\n\tdevice::PORT0::PDR.B2 = 1; \/\/ output\n\tdevice::PORT0::PDR.B3 = 1; \/\/ output\n\n\n\t{ \/\/ GR-KAEDE の SPI 端子のハードバグ回避\n\t \/\/ ※PC3 から、PC7 へ １K オームで接続\n\t\tdevice::PORTC::PDR.B3 = 1; \/\/ output\n\t\tdevice::PORTC::PODR.B3 = 1;\n\t}\n\n\tdevice::SYSTEM::PRCR = 0xA50B;\t\/\/ クロック、低消費電力、関係書き込み許可\n\n\tdevice::SYSTEM::MOSCWTCR = 9;\t\/\/ 1ms wait\n\t\/\/ メインクロック強制発振とドライブ能力設定\n\tdevice::SYSTEM::MOFCR = device::SYSTEM::MOFCR.MODRV2.b(0b10)\n\t\t\t\t\t\t | device::SYSTEM::MOFCR.MOFXIN.b(1);\n\tdevice::SYSTEM::MOSCCR.MOSTP = 0;\t\t\/\/ メインクロック発振器動作\n\twhile(device::SYSTEM::OSCOVFSR.MOOVF() == 0) asm(\"nop\");\n\n\t\/\/ Base Clock 12MHz\n\tdevice::SYSTEM::PLLCR.STC = 0b010011;\t\t\/\/ PLL 10 倍(120MHz)\n\tdevice::SYSTEM::PLLCR2.PLLEN = 0;\t\t\t\/\/ PLL 動作\n\twhile(device::SYSTEM::OSCOVFSR.PLOVF() == 0) asm(\"nop\");\n\n\tdevice::SYSTEM::SCKCR = device::SYSTEM::SCKCR.FCK.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.ICK.b(0)\t\t\/\/ 1\/1 (120\/1=120)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.BCK.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKA.b(0)\t\t\/\/ 1\/1 (120\/1=120)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKB.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKC.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKD.b(1);\t\/\/ 1\/2 (120\/2=60)\n\tdevice::SYSTEM::SCKCR2.UCK = 0b0100; \/\/ USB Clock: 1\/5 (120\/5=24)\n\tdevice::SYSTEM::SCKCR3.CKSEL = 0b100;\t\/\/\/< PLL 選択\n\n\t{ \/\/ タイマー設定、１００Ｈｚ（１０ｍｓ）\n\t\tuint8_t int_level = 1;\n\t\tcmt_.start(100, int_level);\n\t}\n\n\t{ \/\/ SCI 設定\n\t\tuint8_t int_level = 2;\n\t\tsci_.start(115200, int_level);\n\t}\n\n\tutils::format(\"\\nStart GR-KAEDE Net2 Stack Sample\\n\");\n\n\t\/\/ SD カード・クラスの初期化\n\tsdc_.start();\n\n\t{ \/\/ Ethernet の開始\n\t\tuint8_t intr_level = 4;\n\t\tether_.start(intr_level);\n\n\t\tstatic uint8_t mac[6] = { 0xDE, 0xAD, 0xBE, 0xEF, 0xFE, 0xED };\n\t\tnet_.start(mac);\n\n\t\tether_.set_intr_task(ether_process_);\n\t}\n\n#if 0\n\t{ \/\/ HTTP サーバーの設定\n\t\thttp_.start(\"GR-KAEDE_net HTTP Server\");\n\n\t\t\/\/ ルート・ページ設定\n\t\thttp_.set_link(\"\/\", \"\", [=](void) {\n\t\t\ttime_t t = get_time();\n\t\t\tstruct tm *m = localtime(&t);\n\t\t\tHTTP::http_format(\"%s %s %d %02d:%02d:%02d %4d<br>\\n\")\n\t\t\t\t% get_wday(m->tm_wday)\n\t\t\t\t% get_mon(m->tm_mon)\n\t\t\t\t% static_cast<uint32_t>(m->tm_mday)\n\t\t\t\t% static_cast<uint32_t>(m->tm_hour)\n\t\t\t\t% static_cast<uint32_t>(m->tm_min)\n\t\t\t\t% static_cast<uint32_t>(m->tm_sec)\n\t\t\t\t% static_cast<uint32_t>(m->tm_year + 1900);\n\n\t\t\thttp_.tag_hr(500, 3);\n\t\t} );\n\t}\n#endif\n\n\tuint32_t cnt = 0;\n\twhile(1) { \/\/ 100Hz (10ms interval)\n\t\tcmt_.sync();\n\n\t\tsdc_.service();\n\n\t\tnet_.service();\n#if 0\n\t\tbool l = net_.check_link();\n\t\tif(l) {\n\t\t\thttp_.service();\n\t\t}\n#endif\n\t\tdevice::PORTC::PODR.B0 = (((cnt + 0) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORTC::PODR.B1 = (((cnt + 8) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORT0::PODR.B2 = (((cnt + 16) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORT0::PODR.B3 = (((cnt + 24) & 31) < 8) ? 1 : 0;\n\t\t++cnt;\n\t}\n}\n<commit_msg>update sci_put exclusive control<commit_after>\/\/=====================================================================\/\/\n\/*! @file\n @brief GR-KAEDE_net (RX64M) メイン @n\n\t\t\tCopyright 2017 Kunihito Hiramatsu\n @author 平松邦仁 (hira@rvf-rc45.net)\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/rspi_io.hpp\"\n#include \"common\/sdc_io.hpp\"\n#include \"common\/fifo.hpp\"\n#include \"common\/cmt_io.hpp\"\n#include \"common\/sci_io.hpp\"\n#include \"common\/format.hpp\"\n#include \"common\/input.hpp\"\n#include \"common\/fixed_string.hpp\"\n\n#include \"chip\/phy_base.hpp\"\n#include \"net2\/net_main.hpp\"\n\/\/#include \"net\/http_server.hpp\"\n\nnamespace {\n\n\ttypedef device::ETHERC0 ETHERC; \/\/ Ethernet Controller\n\ttypedef device::EDMAC0 EDMAC; \/\/ Ethernet DMA Controller\n\ttypedef chip::phy_base<ETHERC> PHY; \/\/ Ethernet PHY (LAN8720)\n\ttypedef device::ether_io<ETHERC, EDMAC, PHY> ETHER_IO;\n\tETHER_IO \tether_;\n\n\tvolatile bool tcpip_flag_ = false;\n\tvolatile uint32_t net_int_cnt_ = 0;\n\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\t\/*!\n\t\t@brief CMT タスク\n\t*\/\n\t\/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\tclass cmt_task {\n\n\tpublic:\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief コンストラクター\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tcmt_task() { }\n\n\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\t\/*!\n\t\t\t@brief オペレーター ()\n\t\t*\/\n\t\t\/\/-----------------------------------------------------------------\/\/\n\t\tvoid operator() () {\n\t\t}\n\t};\n\n\n\ttypedef device::cmt_io<device::CMT0, cmt_task> CMT0;\n\tCMT0\tcmt_;\n\n\ttypedef utils::fifo<uint8_t, 4096> BUFFER;\n\ttypedef device::sci_io<device::SCI7, BUFFER, BUFFER> SCI;\n\tSCI\t\tsci_;\n\n\t\/\/ SDC 用　SPI 定義（RSPI）\n\ttypedef device::rspi_io<device::RSPI> SPI;\n\tSPI\t\tspi_;\n\n\ttypedef device::PORT<device::PORTC, device::bitpos::B4> SDC_SELECT;\t\/\/\/< カード選択信号\n\ttypedef device::NULL_PORT SDC_POWER;\t\/\/\/< カード電源制御（常に電源ＯＮ）\n\ttypedef device::PORT<device::PORTB, device::bitpos::B7> SDC_DETECT;\t\/\/\/< カード検出\n\n\ttypedef utils::sdc_io<SPI, SDC_SELECT, SDC_POWER, SDC_DETECT> SDC;\n\tSDC\t\tsdc_(spi_, 20000000);\n\n\ttypedef utils::rtc_io RTC;\n\tRTC\t\trtc_;\n\n\tstatic const uint32_t UDPN = 4; \/\/ UDP の経路数\n \tstatic const uint32_t TCPN = 6; \/\/ TCP の経路数\n\ttypedef net::net_main<ETHER_IO, UDPN, TCPN> NET_MAIN;\n\tNET_MAIN\tnet_(ether_);\n\n\/\/\ttypedef net::http_server<ETHER_IO, SDC> HTTP;\n\/\/\tHTTP\t\thttp_(ether_, sdc_);\n}\n\nextern \"C\" {\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字出力 @n\n\t\t\t\t※割り込み対応\n\t\t@param[in]\tch\t文字\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid sci_putch(char ch)\n\t{\n\t\tstatic volatile bool lock = false;\n\t\tstatic utils::fifo<uint8_t, 1024> tmp;\n\t\tif(lock) {\n\t\t\tif((tmp.size() - tmp.length() - 1) > 0) {\n\t\t\t\ttmp.put(ch);\n\t\t\t}\n\t\t}\n\t\tlock = true;\n\t\twhile(tmp.length() > 0) {\n\t\t\tsci_.putch(tmp.get());\n\t\t}\n\t\tsci_.putch(ch);\n\t\tlock = false;\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字列出力\n\t\t@param[in]\ts\t文字列\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid sci_puts(const char* s)\n\t{\n\t\tsci_.puts(s);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字入力\n\t\t@return\t文字\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tchar sci_getch(void)\n\t{\n\t\treturn sci_.getch();\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief システム・文字列長の取得\n\t\t@return\t文字列長\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tuint16_t sci_length(void)\n\t{\n\t\treturn sci_.recv_length();\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief GMT 時間の取得\n\t\t@return GMT 時間\n\t*\/\n\t\/\/-----------------------------------------------------------------\/\/\n\ttime_t get_time()\n\t{\n\t\ttime_t t = 0;\n\t\trtc_.get_time(t);\n\t\treturn t;\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へ初期化関数を提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@return ステータス\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDSTATUS disk_initialize(BYTE drv) {\n\t\treturn sdc_.at_mmc().disk_initialize(drv);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へステータスを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDSTATUS disk_status(BYTE drv) {\n\t\treturn sdc_.at_mmc().disk_status(drv);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へリード・セクターを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[out]\tbuff\tPointer to the data buffer to store read data\n\t\t@param[in]\tsector\tStart sector number (LBA)\n\t\t@param[in]\tcount\tSector count (1..128)\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_read(BYTE drv, BYTE* buff, DWORD sector, UINT count) {\n\t\treturn sdc_.at_mmc().disk_read(drv, buff, sector, count);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へライト・セクターを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[in]\tbuff\tPointer to the data to be written\t\n\t\t@param[in]\tsector\tStart sector number (LBA)\n\t\t@param[in]\tcount\tSector count (1..128)\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_write(BYTE drv, const BYTE* buff, DWORD sector, UINT count) {\n\t\treturn sdc_.at_mmc().disk_write(drv, buff, sector, count);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へI\/O コントロールを提供\n\t\t@param[in]\tdrv\t\tPhysical drive nmuber (0)\n\t\t@param[in]\tctrl\tControl code\n\t\t@param[in]\tbuff\tBuffer to send\/receive control data\n\t\t@return リザルト\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDRESULT disk_ioctl(BYTE drv, BYTE ctrl, void* buff) {\n\t\treturn sdc_.at_mmc().disk_ioctl(drv, ctrl, buff);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tFatFs へ時間を提供\n\t\t@return FatFs 時間\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tDWORD get_fattime(void) {\n\t\tauto t = get_time();\n\t\treturn utils::str::get_fattime(t);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tUTF-8 から ShiftJIS への変換\n\t\t@param[in]\tsrc\tUTF-8 文字列ソース\n\t\t@param[out]\tdst\tShiftJIS 文字列出力\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid utf8_to_sjis(const char* src, char* dst) {\n\t\tutils::str::utf8_to_sjis(src, dst);\n\t}\n\n\n\t\/\/-----------------------------------------------------------------\/\/\n\t\/*!\n\t\t@brief\tイーサーネット・割り込みタスク\n\t *\/\n\t\/\/-----------------------------------------------------------------\/\/\n\tvoid ether_process_(void)\n\t{\n\t\tnet_.process();\n\t}\n}\n\n\nint main(int argc, char** argv);\n\nint main(int argc, char** argv)\n{\n\tdevice::init_port();\n\n\tdevice::PORTC::PDR.B0 = 1; \/\/ output\n\tdevice::PORTC::PDR.B1 = 1; \/\/ output\n\tdevice::PORT0::PDR.B2 = 1; \/\/ output\n\tdevice::PORT0::PDR.B3 = 1; \/\/ output\n\n\n\t{ \/\/ GR-KAEDE の SPI 端子のハードバグ回避\n\t \/\/ ※PC3 から、PC7 へ １K オームで接続\n\t\tdevice::PORTC::PDR.B3 = 1; \/\/ output\n\t\tdevice::PORTC::PODR.B3 = 1;\n\t}\n\n\tdevice::SYSTEM::PRCR = 0xA50B;\t\/\/ クロック、低消費電力、関係書き込み許可\n\n\tdevice::SYSTEM::MOSCWTCR = 9;\t\/\/ 1ms wait\n\t\/\/ メインクロック強制発振とドライブ能力設定\n\tdevice::SYSTEM::MOFCR = device::SYSTEM::MOFCR.MODRV2.b(0b10)\n\t\t\t\t\t\t | device::SYSTEM::MOFCR.MOFXIN.b(1);\n\tdevice::SYSTEM::MOSCCR.MOSTP = 0;\t\t\/\/ メインクロック発振器動作\n\twhile(device::SYSTEM::OSCOVFSR.MOOVF() == 0) asm(\"nop\");\n\n\t\/\/ Base Clock 12MHz\n\tdevice::SYSTEM::PLLCR.STC = 0b010011;\t\t\/\/ PLL 10 倍(120MHz)\n\tdevice::SYSTEM::PLLCR2.PLLEN = 0;\t\t\t\/\/ PLL 動作\n\twhile(device::SYSTEM::OSCOVFSR.PLOVF() == 0) asm(\"nop\");\n\n\tdevice::SYSTEM::SCKCR = device::SYSTEM::SCKCR.FCK.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.ICK.b(0)\t\t\/\/ 1\/1 (120\/1=120)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.BCK.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKA.b(0)\t\t\/\/ 1\/1 (120\/1=120)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKB.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKC.b(1)\t\t\/\/ 1\/2 (120\/2=60)\n\t\t\t\t\t\t | device::SYSTEM::SCKCR.PCKD.b(1);\t\/\/ 1\/2 (120\/2=60)\n\tdevice::SYSTEM::SCKCR2.UCK = 0b0100; \/\/ USB Clock: 1\/5 (120\/5=24)\n\tdevice::SYSTEM::SCKCR3.CKSEL = 0b100;\t\/\/\/< PLL 選択\n\n\t{ \/\/ タイマー設定、１００Ｈｚ（１０ｍｓ）\n\t\tuint8_t int_level = 1;\n\t\tcmt_.start(100, int_level);\n\t}\n\n\t{ \/\/ SCI 設定\n\t\tuint8_t int_level = 2;\n\t\tsci_.start(115200, int_level);\n\t}\n\n\tutils::format(\"\\nStart GR-KAEDE Net2 Stack Sample\\n\");\n\n\t\/\/ SD カード・クラスの初期化\n\tsdc_.start();\n\n\t{ \/\/ Ethernet の開始\n\t\tuint8_t intr_level = 4;\n\t\tether_.start(intr_level);\n\n\t\tstatic uint8_t mac[6] = { 0xDE, 0xAD, 0xBE, 0xEF, 0xFE, 0xED };\n\t\tnet_.start(mac);\n\n\t\tether_.set_intr_task(ether_process_);\n\t}\n\n#if 0\n\t{ \/\/ HTTP サーバーの設定\n\t\thttp_.start(\"GR-KAEDE_net HTTP Server\");\n\n\t\t\/\/ ルート・ページ設定\n\t\thttp_.set_link(\"\/\", \"\", [=](void) {\n\t\t\ttime_t t = get_time();\n\t\t\tstruct tm *m = localtime(&t);\n\t\t\tHTTP::http_format(\"%s %s %d %02d:%02d:%02d %4d<br>\\n\")\n\t\t\t\t% get_wday(m->tm_wday)\n\t\t\t\t% get_mon(m->tm_mon)\n\t\t\t\t% static_cast<uint32_t>(m->tm_mday)\n\t\t\t\t% static_cast<uint32_t>(m->tm_hour)\n\t\t\t\t% static_cast<uint32_t>(m->tm_min)\n\t\t\t\t% static_cast<uint32_t>(m->tm_sec)\n\t\t\t\t% static_cast<uint32_t>(m->tm_year + 1900);\n\n\t\t\thttp_.tag_hr(500, 3);\n\t\t} );\n\t}\n#endif\n\n\tuint32_t cnt = 0;\n\twhile(1) { \/\/ 100Hz (10ms interval)\n\t\tcmt_.sync();\n\n\t\tsdc_.service();\n\n\t\tnet_.service();\n#if 0\n\t\tbool l = net_.check_link();\n\t\tif(l) {\n\t\t\thttp_.service();\n\t\t}\n#endif\n\t\tdevice::PORTC::PODR.B0 = (((cnt + 0) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORTC::PODR.B1 = (((cnt + 8) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORT0::PODR.B2 = (((cnt + 16) & 31) < 8) ? 1 : 0;\n\t\tdevice::PORT0::PODR.B3 = (((cnt + 24) & 31) < 8) ? 1 : 0;\n\t\t++cnt;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"..\\Quantities\\Dimensionless.hpp\"\n#include \"..\\Quantities\\Quantities.hpp\"\n#include <string>\n\nnamespace Principia {\nnamespace Geometry {\n template<typename Scalar>\n struct R3Element {\n public:\n R3Element(Scalar const& x, Scalar const& y, Scalar const& z) :\n x(x), y(y), z(z) {};\n\n Scalar& operator[] (int const index);\n Scalar& const operator[] (int const index) const;\n\n Scalar x;\n Scalar y;\n Scalar z;\n };\n\ntemplate<typename T>\nR3Element<T> operator+ (R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator- (R3Element<T> const& right);\ntemplate<typename T>\n\nR3Element<T> operator+ (R3Element<T> const& left, R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator- (R3Element<T> const& left, R3Element<T> const& right);\ntemplate<typename T>\n\nR3Element<T> operator* (Quantities::Dimensionless const& left,\n R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator* (R3Element<T> const& left,\n Quantities::Dimensionless const& right);\ntemplate<typename T>\nR3Element<T> operator\/ (R3Element<T> const& left,\n Quantities::Dimensionless const& right);\n\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<U, T>> operator* (U const& left,\n R3Element<T> const& right);\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<T, U>> operator* (R3Element<T> const& left,\n U const& right);\ntemplate<typename T, typename U>\nR3Element<Quantities::Quotient<T, U>> operator\/ (R3Element<T> const& left,\n U const& right);\n\ntemplate<typename T>\nR3Element<T> operator+= (R3Element<T>& left, R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator-= (R3Element<T>& left, R3Element<T> const& right);\n\ntemplate<typename T>\nR3Element<T> operator*= (R3Element<T>& left,\n Quantities::Dimensionless const& right);\ntemplate<typename T>\nR3Element<T> operator\/= (R3Element<T>& left,\n Quantities::Dimensionless const& right);\n\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<T, U>> Cross(R3Element<T> const& left,\n R3Element<U> const& right);\ntemplate<typename T, typename U>\nQuantities::Product<T, U> Dot(R3Element<T> const& left,\n R3Element<U> const& right);\n}\n}\n<commit_msg>Edited some comments.<commit_after>#pragma once\n\n#include \"..\\Quantities\\Dimensionless.hpp\"\n#include \"..\\Quantities\\Quantities.hpp\"\n#include <string>\n\nnamespace Principia {\nnamespace Geometry {\n \/\/ R3Element is an element of a 3-dimensional dimensionful vector space on the\n \/\/ field R, represented by Dimensionless. It is the underlying data type for\n \/\/ the more advanced strongly typed structures of the Grassmann algebras and\n \/\/ affine spaces.\n template<typename Scalar>\n struct R3Element {\n public:\n R3Element(Scalar const& x, Scalar const& y, Scalar const& z) :\n x(x), y(y), z(z) {};\n\n Scalar& operator[] (int const index);\n Scalar& const operator[] (int const index) const;\n\n Scalar x;\n Scalar y;\n Scalar z;\n };\n\ntemplate<typename T>\nR3Element<T> operator+ (R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator- (R3Element<T> const& right);\ntemplate<typename T>\n\nR3Element<T> operator+ (R3Element<T> const& left, R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator- (R3Element<T> const& left, R3Element<T> const& right);\ntemplate<typename T>\n\nR3Element<T> operator* (Quantities::Dimensionless const& left,\n R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator* (R3Element<T> const& left,\n Quantities::Dimensionless const& right);\ntemplate<typename T>\nR3Element<T> operator\/ (R3Element<T> const& left,\n Quantities::Dimensionless const& right);\n\n\/\/ These operations are actually tensor products with dimensionful 1-dimensional\n\/\/ vectors, see [Tao 2012].\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<U, T>> operator* (U const& left,\n R3Element<T> const& right);\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<T, U>> operator* (R3Element<T> const& left,\n U const& right);\ntemplate<typename T, typename U>\nR3Element<Quantities::Quotient<T, U>> operator\/ (R3Element<T> const& left,\n U const& right);\n\ntemplate<typename T>\nR3Element<T> operator+= (R3Element<T>& left, R3Element<T> const& right);\ntemplate<typename T>\nR3Element<T> operator-= (R3Element<T>& left, R3Element<T> const& right);\n\ntemplate<typename T>\nR3Element<T> operator*= (R3Element<T>& left,\n Quantities::Dimensionless const& right);\ntemplate<typename T>\nR3Element<T> operator\/= (R3Element<T>& left,\n Quantities::Dimensionless const& right);\n\ntemplate<typename T, typename U>\nR3Element<Quantities::Product<T, U>> Cross(R3Element<T> const& left,\n R3Element<U> const& right);\ntemplate<typename T, typename U>\nQuantities::Product<T, U> Dot(R3Element<T> const& left,\n R3Element<U> const& right);\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include <limits>\n\n#include \"Eigen\/Dense\"\n\n#include \"cyber\/common\/log.h\"\n#include \"modules\/common\/math\/linear_quadratic_regulator.h\"\n\nnamespace apollo {\nnamespace common {\nnamespace math {\n\nusing Matrix = Eigen::MatrixXd;\n\nvoid SolveLQRProblem(const Matrix &A, const Matrix &B, const Matrix &Q,\n const Matrix &R, const double tolerance,\n const uint max_num_iteration, Matrix *ptr_K) {\n if (A.rows() != A.cols() || B.rows() != A.rows() || Q.rows() != Q.cols() ||\n Q.rows() != A.rows() || R.rows() != R.cols() || R.rows() != B.cols()) {\n AERROR << \"LQR solver: one or more matrices have incompatible dimensions.\";\n return;\n }\n\n Matrix AT = A.transpose();\n Matrix BT = B.transpose();\n\n \/\/ Solves a discrete-time Algebraic Riccati equation (DARE)\n \/\/ Calculate Matrix Difference Riccati Equation, initialize P and Q\n Matrix P = Q;\n uint num_iteration = 0;\n double diff = std::numeric_limits<double>::max();\n while (num_iteration++ < max_num_iteration && diff > tolerance) {\n Matrix P_next =\n AT * P * A - AT * P * B * (R + BT * P * B).inverse() * BT * P * A + Q;\n \/\/ check the difference between P and P_next\n diff = fabs((P_next - P).maxCoeff());\n P = P_next;\n }\n\n if (num_iteration >= max_num_iteration) {\n ADEBUG << \"LQR solver cannot converge to a solution, \"\n \"last consecutive result diff. is:\"\n << diff;\n } else {\n ADEBUG << \"LQR solver converged at iteration: \" << num_iteration\n << \", max consecutive result diff.: \" << diff;\n }\n *ptr_K = (R + BT * P * B).inverse() * BT * P * A;\n}\n\n} \/\/ namespace math\n} \/\/ namespace common\n} \/\/ namespace apollo\n<commit_msg>Update linear_quadratic_regulator.cc<commit_after>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n\n#include <limits>\n\n#include \"Eigen\/Dense\"\n\n#include \"cyber\/common\/log.h\"\n#include \"modules\/common\/math\/linear_quadratic_regulator.h\"\n\nnamespace apollo {\nnamespace common {\nnamespace math {\n\nusing Matrix = Eigen::MatrixXd;\n\nvoid SolveLQRProblem(const Matrix &A, const Matrix &B, const Matrix &Q,\n const Matrix &R, const double tolerance,\n const uint max_num_iteration, Matrix *ptr_K) {\n if (A.rows() != A.cols() || B.rows() != A.rows() || Q.rows() != Q.cols() ||\n Q.rows() != A.rows() || R.rows() != R.cols() || R.rows() != B.cols()) {\n AERROR << \"LQR solver: one or more matrices have incompatible dimensions.\";\n return;\n }\n\n Matrix AT = A.transpose();\n Matrix BT = B.transpose();\n\n \/\/ Solves a discrete-time Algebraic Riccati equation (DARE)\n \/\/ Calculate Matrix Difference Riccati Equation, initialize P and Q\n Matrix P = Q;\n uint num_iteration = 0;\n double diff = std::numeric_limits<double>::max();\n while (num_iteration++ < max_num_iteration && diff > tolerance) {\n Matrix P_next =\n AT * P * A - AT * P * B * (R + BT * P * B).inverse() * BT * P * A + Q;\n \/\/ check the difference between P and P_next\n diff = fabs((P_next - P).maxCoeff());\n P = P_next;\n }\n\n if (num_iteration >= max_num_iteration) {\n ADEBUG << \"LQR solver cannot converge to a solution, \"\n \"last consecutive result diff is: \"\n << diff;\n } else {\n ADEBUG << \"LQR solver converged at iteration: \" << num_iteration\n << \", max consecutive result diff.: \" << diff;\n }\n *ptr_K = (R + BT * P * B).inverse() * BT * P * A;\n}\n\n} \/\/ namespace math\n} \/\/ namespace common\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#include \"..\/precomp.hpp\"\n#include \"layers_common.hpp\"\n\nnamespace cv\n{\nnamespace dnn\n{\n\n\/\/ Quantize FP32\/FP16 Inputs to INT8\nclass QuantizeLayerImpl CV_FINAL : public QuantizeLayer\n{\npublic:\n QuantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scales\", 1.0f);\n zeropoint = params.get<int>(\"zeropoints\", 0);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n#ifdef HAVE_OPENCL\n bool forward_ocl(InputArrayOfArrays inputs_, OutputArrayOfArrays outputs_, OutputArrayOfArrays internals_)\n {\n std::vector<UMat> inputs, outputs;\n inputs_.getUMatVector(inputs);\n outputs_.getUMatVector(outputs);\n\n if (inputs_.depth() == CV_16S)\n {\n UMat inputFp32(shape(inputs[0]), CV_32F);\n convertFp16(inputs[0], inputFp32);\n inputFp32.copyTo(inputs[0]);\n }\n\n inputs[0].convertTo(outputs[0], CV_8S, 1.f\/scale, zeropoint);\n return true;\n }\n#endif\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n CV_OCL_RUN(IS_DNN_OPENCL_TARGET(preferableTarget),\n forward_ocl(inputs_arr, outputs_arr, internals_arr))\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_8S, 1.f\/scale, zeropoint);\n }\n};\n\n\/\/ Dequantize INT8 Inputs to FP32\/FP16\nclass DequantizeLayerImpl CV_FINAL : public DequantizeLayer\n{\npublic:\n DequantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scales\", 1.0f);\n zeropoint = params.get<int>(\"zeropoints\", 0);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n#ifdef HAVE_OPENCL\n bool forward_ocl(InputArrayOfArrays inputs_, OutputArrayOfArrays outputs_, OutputArrayOfArrays internals_)\n {\n std::vector<UMat> inputs, outputs;\n inputs_.getUMatVector(inputs);\n outputs_.getUMatVector(outputs);\n\n UMat outputFp32(shape(outputs[0]), CV_32F);\n inputs[0].convertTo(outputFp32, CV_32F, scale, -(scale*zeropoint));\n\n if (outputs_.depth() == CV_16S)\n convertFp16(outputFp32, outputs[0]);\n else\n outputFp32.copyTo(outputs[0]);\n return true;\n }\n#endif\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n CV_OCL_RUN(IS_DNN_OPENCL_TARGET(preferableTarget),\n forward_ocl(inputs_arr, outputs_arr, internals_arr))\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_32F, scale, -(scale*zeropoint));\n }\n};\n\n\/\/ Rescale\/Requantize INT8 Inputs from (scale1, zeropoint1) to (scale2, zeropoint2)\nclass RequantizeLayerImpl CV_FINAL : public RequantizeLayer\n{\npublic:\n RequantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scale\", 1.f);\n shift = params.get<float>(\"shift\", 0.f);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_8S, scale, shift);\n }\n};\n\nPtr<QuantizeLayer> QuantizeLayer::create(const LayerParams& params)\n{\n return Ptr<QuantizeLayer>(new QuantizeLayerImpl(params));\n}\n\nPtr<DequantizeLayer> DequantizeLayer::create(const LayerParams& params)\n{\n return Ptr<DequantizeLayer>(new DequantizeLayerImpl(params));\n}\n\nPtr<RequantizeLayer> RequantizeLayer::create(const LayerParams& params)\n{\n return Ptr<RequantizeLayer>(new RequantizeLayerImpl(params));\n}\n\n}\n}\n<commit_msg>dnn(int8): fix using of incorrect UMat constructor<commit_after>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#include \"..\/precomp.hpp\"\n#include \"layers_common.hpp\"\n\nnamespace cv\n{\nnamespace dnn\n{\n\n\/\/ Quantize FP32\/FP16 Inputs to INT8\nclass QuantizeLayerImpl CV_FINAL : public QuantizeLayer\n{\npublic:\n QuantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scales\", 1.0f);\n zeropoint = params.get<int>(\"zeropoints\", 0);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n#ifdef HAVE_OPENCL\n bool forward_ocl(InputArrayOfArrays inputs_, OutputArrayOfArrays outputs_, OutputArrayOfArrays internals_)\n {\n std::vector<UMat> inputs, outputs;\n inputs_.getUMatVector(inputs);\n outputs_.getUMatVector(outputs);\n\n if (inputs_.depth() == CV_16S)\n {\n UMat inputFp32;\n convertFp16(inputs[0], inputFp32);\n inputs[0] = inputFp32; \/\/ replace\n }\n\n inputs[0].convertTo(outputs[0], CV_8S, 1.f\/scale, zeropoint);\n return true;\n }\n#endif\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n CV_OCL_RUN(IS_DNN_OPENCL_TARGET(preferableTarget),\n forward_ocl(inputs_arr, outputs_arr, internals_arr))\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_8S, 1.f\/scale, zeropoint);\n }\n};\n\n\/\/ Dequantize INT8 Inputs to FP32\/FP16\nclass DequantizeLayerImpl CV_FINAL : public DequantizeLayer\n{\npublic:\n DequantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scales\", 1.0f);\n zeropoint = params.get<int>(\"zeropoints\", 0);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n#ifdef HAVE_OPENCL\n bool forward_ocl(InputArrayOfArrays inputs_, OutputArrayOfArrays outputs_, OutputArrayOfArrays internals_)\n {\n std::vector<UMat> inputs, outputs;\n inputs_.getUMatVector(inputs);\n outputs_.getUMatVector(outputs);\n\n UMat outputFp32;\n inputs[0].convertTo(outputFp32, CV_32F, scale, -(scale*zeropoint));\n\n if (outputs_.depth() == CV_16S)\n convertFp16(outputFp32, outputs[0]);\n else\n outputFp32.copyTo(outputs[0]);\n return true;\n }\n#endif\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n CV_OCL_RUN(IS_DNN_OPENCL_TARGET(preferableTarget),\n forward_ocl(inputs_arr, outputs_arr, internals_arr))\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_32F, scale, -(scale*zeropoint));\n }\n};\n\n\/\/ Rescale\/Requantize INT8 Inputs from (scale1, zeropoint1) to (scale2, zeropoint2)\nclass RequantizeLayerImpl CV_FINAL : public RequantizeLayer\n{\npublic:\n RequantizeLayerImpl(const LayerParams& params)\n {\n scale = params.get<float>(\"scale\", 1.f);\n shift = params.get<float>(\"shift\", 0.f);\n setParamsFrom(params);\n }\n\n virtual bool supportBackend(int backendId) CV_OVERRIDE\n {\n return backendId == DNN_BACKEND_OPENCV;\n }\n\n bool getMemoryShapes(const std::vector<MatShape> &inputs,\n const int requiredOutputs,\n std::vector<MatShape> &outputs,\n std::vector<MatShape> &internals) const CV_OVERRIDE\n {\n CV_Assert(inputs.size() == 1);\n Layer::getMemoryShapes(inputs, requiredOutputs, outputs, internals);\n return false;\n }\n\n virtual void finalize(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n {\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n }\n\n void forward(InputArrayOfArrays inputs_arr, OutputArrayOfArrays outputs_arr, OutputArrayOfArrays internals_arr) CV_OVERRIDE\n {\n CV_TRACE_FUNCTION();\n CV_TRACE_ARG_VALUE(name, \"name\", name.c_str());\n\n std::vector<Mat> inputs, outputs;\n inputs_arr.getMatVector(inputs);\n outputs_arr.getMatVector(outputs);\n\n inputs[0].convertTo(outputs[0], CV_8S, scale, shift);\n }\n};\n\nPtr<QuantizeLayer> QuantizeLayer::create(const LayerParams& params)\n{\n return Ptr<QuantizeLayer>(new QuantizeLayerImpl(params));\n}\n\nPtr<DequantizeLayer> DequantizeLayer::create(const LayerParams& params)\n{\n return Ptr<DequantizeLayer>(new DequantizeLayerImpl(params));\n}\n\nPtr<RequantizeLayer> RequantizeLayer::create(const LayerParams& params)\n{\n return Ptr<RequantizeLayer>(new RequantizeLayerImpl(params));\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2015 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/python3\/pythonincluder.h>\n\n#include \"pyproperties.h\"\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/processors\/processor.h>\n#include <inviwo\/core\/network\/processornetwork.h>\n\n#include <inviwo\/core\/properties\/optionproperty.h>\n#include <inviwo\/core\/properties\/boolproperty.h>\n#include <inviwo\/core\/properties\/buttonproperty.h>\n#include <inviwo\/core\/properties\/cameraproperty.h>\n#include <inviwo\/core\/properties\/directoryproperty.h>\n#include <inviwo\/core\/properties\/fileproperty.h>\n#include <inviwo\/core\/properties\/optionproperty.h>\n#include <inviwo\/core\/properties\/ordinalproperty.h>\n\n#include <inviwo\/core\/properties\/stringproperty.h>\n#include <inviwo\/core\/properties\/transferfunctionproperty.h>\n#include <modules\/python3\/pythoninterface\/pyvalueparser.h>\n\nnamespace inviwo {\n\nPyObject* py_setPropertyValue(PyObject* self, PyObject* args) {\n static PySetPropertyValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n PyValueParser::setProperty(theProperty, parameter);\n Py_RETURN_NONE;\n}\n\nPyObject* py_setPropertyMaxValue(PyObject* \/*self*\/, PyObject* args) {\n static PySetPropertyMaxValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n OrdinalProperty<float>* ordinalFloat = dynamic_cast<OrdinalProperty<float>*>(theProperty);\n OrdinalProperty<int>* ordinalInt = dynamic_cast<OrdinalProperty<int>*>(theProperty);\n OrdinalProperty<ivec2>* ordinalIvec2 = dynamic_cast<OrdinalProperty<ivec2>*>(theProperty);\n OrdinalProperty<ivec3>* ordinalIvec3 = dynamic_cast<OrdinalProperty<ivec3>*>(theProperty);\n OrdinalProperty<ivec4>* ordinalIvec4 = dynamic_cast<OrdinalProperty<ivec4>*>(theProperty);\n OrdinalProperty<mat2>* ordinalMat2 = dynamic_cast<OrdinalProperty<mat2>*>(theProperty);\n OrdinalProperty<mat3>* ordinalMat3 = dynamic_cast<OrdinalProperty<mat3>*>(theProperty);\n OrdinalProperty<mat4>* ordinalMat4 = dynamic_cast<OrdinalProperty<mat4>*>(theProperty);\n OrdinalProperty<vec2>* ordinalVec2 = dynamic_cast<OrdinalProperty<vec2>*>(theProperty);\n OrdinalProperty<vec3>* ordinalVec3 = dynamic_cast<OrdinalProperty<vec3>*>(theProperty);\n OrdinalProperty<vec4>* ordinalVec4 = dynamic_cast<OrdinalProperty<vec4>*>(theProperty);\n\n if (ordinalFloat) {\n ordinalFloat->setMaxValue(PyValueParser::parse<float>(parameter));\n } else if (ordinalInt) {\n ordinalInt->setMaxValue(PyValueParser::parse<int>(parameter));\n } else if (ordinalIvec2) {\n ordinalIvec2->setMaxValue(PyValueParser::parse<ivec2>(parameter));\n } else if (ordinalIvec3) {\n ordinalIvec3->setMaxValue(PyValueParser::parse<ivec3>(parameter));\n } else if (ordinalIvec4) {\n ordinalIvec4->setMaxValue(PyValueParser::parse<ivec4>(parameter));\n } else if (ordinalMat2) {\n ordinalMat2->setMaxValue(PyValueParser::parse<mat2>(parameter));\n } else if (ordinalMat3) {\n ordinalMat3->setMaxValue(PyValueParser::parse<mat3>(parameter));\n } else if (ordinalMat4) {\n ordinalMat4->setMaxValue(PyValueParser::parse<mat4>(parameter));\n } else if (ordinalVec2) {\n ordinalVec2->setMaxValue(PyValueParser::parse<vec2>(parameter));\n } else if (ordinalVec3) {\n ordinalVec3->setMaxValue(PyValueParser::parse<vec3>(parameter));\n } else if (ordinalVec4) {\n ordinalVec4->setMaxValue(PyValueParser::parse<vec4>(parameter));\n } else {\n LogErrorCustom(\"inviwo_setPropertyMaxValue\",\n \"Unknown parameter type: \" << theProperty->getClassIdentifier());\n }\n\n Py_RETURN_NONE;\n}\n\nPyObject* py_setPropertyMinValue(PyObject* \/*self*\/, PyObject* args) {\n static PySetPropertyMinValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n OrdinalProperty<float>* ordinalFloat = dynamic_cast<OrdinalProperty<float>*>(theProperty);\n OrdinalProperty<int>* ordinalInt = dynamic_cast<OrdinalProperty<int>*>(theProperty);\n OrdinalProperty<ivec2>* ordinalIvec2 = dynamic_cast<OrdinalProperty<ivec2>*>(theProperty);\n OrdinalProperty<ivec3>* ordinalIvec3 = dynamic_cast<OrdinalProperty<ivec3>*>(theProperty);\n OrdinalProperty<ivec4>* ordinalIvec4 = dynamic_cast<OrdinalProperty<ivec4>*>(theProperty);\n OrdinalProperty<mat2>* ordinalMat2 = dynamic_cast<OrdinalProperty<mat2>*>(theProperty);\n OrdinalProperty<mat3>* ordinalMat3 = dynamic_cast<OrdinalProperty<mat3>*>(theProperty);\n OrdinalProperty<mat4>* ordinalMat4 = dynamic_cast<OrdinalProperty<mat4>*>(theProperty);\n OrdinalProperty<vec2>* ordinalVec2 = dynamic_cast<OrdinalProperty<vec2>*>(theProperty);\n OrdinalProperty<vec3>* ordinalVec3 = dynamic_cast<OrdinalProperty<vec3>*>(theProperty);\n OrdinalProperty<vec4>* ordinalVec4 = dynamic_cast<OrdinalProperty<vec4>*>(theProperty);\n\n if (ordinalFloat) {\n ordinalFloat->setMinValue(PyValueParser::parse<float>(parameter));\n } else if (ordinalInt) {\n ordinalInt->setMinValue(PyValueParser::parse<int>(parameter));\n } else if (ordinalIvec2) {\n ordinalIvec2->setMinValue(PyValueParser::parse<ivec2>(parameter));\n } else if (ordinalIvec3) {\n ordinalIvec3->setMinValue(PyValueParser::parse<ivec3>(parameter));\n } else if (ordinalIvec4) {\n ordinalIvec4->setMinValue(PyValueParser::parse<ivec4>(parameter));\n } else if (ordinalMat2) {\n ordinalMat2->setMinValue(PyValueParser::parse<mat2>(parameter));\n } else if (ordinalMat3) {\n ordinalMat3->setMinValue(PyValueParser::parse<mat3>(parameter));\n } else if (ordinalMat4) {\n ordinalMat4->setMinValue(PyValueParser::parse<mat4>(parameter));\n } else if (ordinalVec2) {\n ordinalVec2->setMinValue(PyValueParser::parse<vec2>(parameter));\n } else if (ordinalVec3) {\n ordinalVec3->setMinValue(PyValueParser::parse<vec3>(parameter));\n } else if (ordinalVec4) {\n ordinalVec4->setMinValue(PyValueParser::parse<vec4>(parameter));\n } else {\n LogErrorCustom(\"inviwo_setPropertyMinValue\", \"Unknown parameter type\");\n }\n\n Py_RETURN_NONE;\n}\n\nPyObject* py_getPropertyValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n return PyValueParser::getProperty(theProperty);\n}\n\n#define CAST_N_GETMAX(PropType, prop, parser) \\\n { \\\n PropType* casted = dynamic_cast<PropType*>(prop); \\\n if (casted) { \\\n return PyValueParser::toPyObject(casted->getMaxValue()); \\\n } \\\n }\n#define CAST_N_GETMIN(PropType, prop, parser) \\\n { \\\n PropType* casted = dynamic_cast<PropType*>(prop); \\\n if (casted) { \\\n return PyValueParser::toPyObject(casted->getMinValue()); \\\n } \\\n }\n\nPyObject* py_getPropertyMaxValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyMaxValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n CAST_N_GETMAX(FloatProperty, theProperty, parser);\n CAST_N_GETMAX(IntProperty, theProperty, parser);\n CAST_N_GETMAX(IntVec2Property, theProperty, parser);\n CAST_N_GETMAX(IntVec3Property, theProperty, parser);\n CAST_N_GETMAX(IntVec4Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat2Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat3Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat4Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec2Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec3Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec4Property, theProperty, parser);\n LogErrorCustom(\"inviwo_getPropertyMaxValue\", \"Unknown parameter type\");\n Py_RETURN_NONE;\n}\n\nPyObject* py_getPropertyMinValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyMinValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n CAST_N_GETMIN(FloatProperty, theProperty, parser);\n CAST_N_GETMIN(IntProperty, theProperty, parser);\n CAST_N_GETMIN(IntVec2Property, theProperty, parser);\n CAST_N_GETMIN(IntVec3Property, theProperty, parser);\n CAST_N_GETMIN(IntVec4Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat2Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat3Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat4Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec2Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec3Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec4Property, theProperty, parser);\n LogErrorCustom(\"inviwo_getPropertyMaxValue\", \"Unknown parameter type\");\n Py_RETURN_NONE;\n}\n\nPyObject* py_clickButton(PyObject* \/*self*\/, PyObject* args) {\n static PyClickButtonMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n ButtonProperty* button = dynamic_cast<ButtonProperty*>(theProperty);\n\n if (!button) {\n std::string msg = std::string(\"clickButton() found property is not a ButtonProperty: \") +\n theProperty->getClassIdentifier();\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n button->pressButton();\n Py_RETURN_NONE;\n}\n\nPySetPropertyValueMethod::PySetPropertyValueMethod() : path_(\"path\"), value_(\"value\") {\n addParam(&path_);\n addParam(&value_);\n}\n\nPySetPropertyMaxValueMethod::PySetPropertyMaxValueMethod() : path_(\"path\"), maxValue_(\"maxValue\") {\n addParam(&path_);\n addParam(&maxValue_);\n}\n\nPySetPropertyMinValueMethod::PySetPropertyMinValueMethod() : path_(\"path\"), minValue_(\"minValue\") {\n addParam(&path_);\n addParam(&minValue_);\n}\n\nPyGetPropertyValueMethod::PyGetPropertyValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyGetPropertyMaxValueMethod::PyGetPropertyMaxValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyGetPropertyMinValueMethod::PyGetPropertyMinValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyClickButtonMethod::PyClickButtonMethod() : path_(\"path\") { addParam(&path_); }\n}<commit_msg>Python: Now supports double properties for get\/set functions<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2015 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/python3\/pythonincluder.h>\n\n#include \"pyproperties.h\"\n\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/processors\/processor.h>\n#include <inviwo\/core\/network\/processornetwork.h>\n\n#include <inviwo\/core\/properties\/optionproperty.h>\n#include <inviwo\/core\/properties\/boolproperty.h>\n#include <inviwo\/core\/properties\/buttonproperty.h>\n#include <inviwo\/core\/properties\/cameraproperty.h>\n#include <inviwo\/core\/properties\/directoryproperty.h>\n#include <inviwo\/core\/properties\/fileproperty.h>\n#include <inviwo\/core\/properties\/optionproperty.h>\n#include <inviwo\/core\/properties\/ordinalproperty.h>\n\n#include <inviwo\/core\/properties\/stringproperty.h>\n#include <inviwo\/core\/properties\/transferfunctionproperty.h>\n#include <modules\/python3\/pythoninterface\/pyvalueparser.h>\n\nnamespace inviwo {\n\nPyObject* py_setPropertyValue(PyObject* self, PyObject* args) {\n static PySetPropertyValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n PyValueParser::setProperty(theProperty, parameter);\n Py_RETURN_NONE;\n}\n\nPyObject* py_setPropertyMaxValue(PyObject* \/*self*\/, PyObject* args) {\n static PySetPropertyMaxValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n OrdinalProperty<float>* ordinalFloat = dynamic_cast<OrdinalProperty<float>*>(theProperty);\n OrdinalProperty<double>* ordinalDouble = dynamic_cast<OrdinalProperty<double>*>(theProperty);\n OrdinalProperty<int>* ordinalInt = dynamic_cast<OrdinalProperty<int>*>(theProperty);\n OrdinalProperty<ivec2>* ordinalIvec2 = dynamic_cast<OrdinalProperty<ivec2>*>(theProperty);\n OrdinalProperty<ivec3>* ordinalIvec3 = dynamic_cast<OrdinalProperty<ivec3>*>(theProperty);\n OrdinalProperty<ivec4>* ordinalIvec4 = dynamic_cast<OrdinalProperty<ivec4>*>(theProperty);\n OrdinalProperty<mat2>* ordinalMat2 = dynamic_cast<OrdinalProperty<mat2>*>(theProperty);\n OrdinalProperty<mat3>* ordinalMat3 = dynamic_cast<OrdinalProperty<mat3>*>(theProperty);\n OrdinalProperty<mat4>* ordinalMat4 = dynamic_cast<OrdinalProperty<mat4>*>(theProperty);\n OrdinalProperty<vec2>* ordinalVec2 = dynamic_cast<OrdinalProperty<vec2>*>(theProperty);\n OrdinalProperty<vec3>* ordinalVec3 = dynamic_cast<OrdinalProperty<vec3>*>(theProperty);\n OrdinalProperty<vec4>* ordinalVec4 = dynamic_cast<OrdinalProperty<vec4>*>(theProperty);\n\n if (ordinalFloat) {\n ordinalFloat->setMaxValue(PyValueParser::parse<float>(parameter));\n } else if (ordinalDouble) {\n ordinalDouble->setMaxValue(PyValueParser::parse<double>(parameter));\n } else if (ordinalInt) {\n ordinalInt->setMaxValue(PyValueParser::parse<int>(parameter));\n } else if (ordinalIvec2) {\n ordinalIvec2->setMaxValue(PyValueParser::parse<ivec2>(parameter));\n } else if (ordinalIvec3) {\n ordinalIvec3->setMaxValue(PyValueParser::parse<ivec3>(parameter));\n } else if (ordinalIvec4) {\n ordinalIvec4->setMaxValue(PyValueParser::parse<ivec4>(parameter));\n } else if (ordinalMat2) {\n ordinalMat2->setMaxValue(PyValueParser::parse<mat2>(parameter));\n } else if (ordinalMat3) {\n ordinalMat3->setMaxValue(PyValueParser::parse<mat3>(parameter));\n } else if (ordinalMat4) {\n ordinalMat4->setMaxValue(PyValueParser::parse<mat4>(parameter));\n } else if (ordinalVec2) {\n ordinalVec2->setMaxValue(PyValueParser::parse<vec2>(parameter));\n } else if (ordinalVec3) {\n ordinalVec3->setMaxValue(PyValueParser::parse<vec3>(parameter));\n } else if (ordinalVec4) {\n ordinalVec4->setMaxValue(PyValueParser::parse<vec4>(parameter));\n } else {\n LogErrorCustom(\"inviwo_setPropertyMaxValue\",\n \"Unknown parameter type: \" << theProperty->getClassIdentifier());\n }\n\n Py_RETURN_NONE;\n}\n\nPyObject* py_setPropertyMinValue(PyObject* \/*self*\/, PyObject* args) {\n static PySetPropertyMinValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n PyObject* parameter = PyTuple_GetItem(args, 1);\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n OrdinalProperty<float>* ordinalFloat = dynamic_cast<OrdinalProperty<float>*>(theProperty);\n OrdinalProperty<int>* ordinalInt = dynamic_cast<OrdinalProperty<int>*>(theProperty);\n OrdinalProperty<ivec2>* ordinalIvec2 = dynamic_cast<OrdinalProperty<ivec2>*>(theProperty);\n OrdinalProperty<ivec3>* ordinalIvec3 = dynamic_cast<OrdinalProperty<ivec3>*>(theProperty);\n OrdinalProperty<ivec4>* ordinalIvec4 = dynamic_cast<OrdinalProperty<ivec4>*>(theProperty);\n OrdinalProperty<mat2>* ordinalMat2 = dynamic_cast<OrdinalProperty<mat2>*>(theProperty);\n OrdinalProperty<mat3>* ordinalMat3 = dynamic_cast<OrdinalProperty<mat3>*>(theProperty);\n OrdinalProperty<mat4>* ordinalMat4 = dynamic_cast<OrdinalProperty<mat4>*>(theProperty);\n OrdinalProperty<vec2>* ordinalVec2 = dynamic_cast<OrdinalProperty<vec2>*>(theProperty);\n OrdinalProperty<vec3>* ordinalVec3 = dynamic_cast<OrdinalProperty<vec3>*>(theProperty);\n OrdinalProperty<vec4>* ordinalVec4 = dynamic_cast<OrdinalProperty<vec4>*>(theProperty);\n\n if (ordinalFloat) {\n ordinalFloat->setMinValue(PyValueParser::parse<float>(parameter));\n } else if (ordinalInt) {\n ordinalInt->setMinValue(PyValueParser::parse<int>(parameter));\n } else if (ordinalIvec2) {\n ordinalIvec2->setMinValue(PyValueParser::parse<ivec2>(parameter));\n } else if (ordinalIvec3) {\n ordinalIvec3->setMinValue(PyValueParser::parse<ivec3>(parameter));\n } else if (ordinalIvec4) {\n ordinalIvec4->setMinValue(PyValueParser::parse<ivec4>(parameter));\n } else if (ordinalMat2) {\n ordinalMat2->setMinValue(PyValueParser::parse<mat2>(parameter));\n } else if (ordinalMat3) {\n ordinalMat3->setMinValue(PyValueParser::parse<mat3>(parameter));\n } else if (ordinalMat4) {\n ordinalMat4->setMinValue(PyValueParser::parse<mat4>(parameter));\n } else if (ordinalVec2) {\n ordinalVec2->setMinValue(PyValueParser::parse<vec2>(parameter));\n } else if (ordinalVec3) {\n ordinalVec3->setMinValue(PyValueParser::parse<vec3>(parameter));\n } else if (ordinalVec4) {\n ordinalVec4->setMinValue(PyValueParser::parse<vec4>(parameter));\n } else {\n LogErrorCustom(\"inviwo_setPropertyMinValue\", \"Unknown parameter type\");\n }\n\n Py_RETURN_NONE;\n}\n\nPyObject* py_getPropertyValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n return PyValueParser::getProperty(theProperty);\n}\n\n#define CAST_N_GETMAX(PropType, prop, parser) \\\n { \\\n PropType* casted = dynamic_cast<PropType*>(prop); \\\n if (casted) { \\\n return PyValueParser::toPyObject(casted->getMaxValue()); \\\n } \\\n }\n#define CAST_N_GETMIN(PropType, prop, parser) \\\n { \\\n PropType* casted = dynamic_cast<PropType*>(prop); \\\n if (casted) { \\\n return PyValueParser::toPyObject(casted->getMinValue()); \\\n } \\\n }\n\nPyObject* py_getPropertyMaxValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyMaxValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n CAST_N_GETMAX(FloatProperty, theProperty, parser);\n CAST_N_GETMAX(DoubleProperty, theProperty, parser);\n CAST_N_GETMAX(IntProperty, theProperty, parser);\n CAST_N_GETMAX(IntVec2Property, theProperty, parser);\n CAST_N_GETMAX(IntVec3Property, theProperty, parser);\n CAST_N_GETMAX(IntVec4Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat2Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat3Property, theProperty, parser);\n CAST_N_GETMAX(FloatMat4Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec2Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec3Property, theProperty, parser);\n CAST_N_GETMAX(FloatVec4Property, theProperty, parser);\n LogErrorCustom(\"inviwo_getPropertyMaxValue\", \"Unknown parameter type: \" << theProperty->getClassIdentifier());\n Py_RETURN_NONE;\n}\n\nPyObject* py_getPropertyMinValue(PyObject* \/*self*\/, PyObject* args) {\n static PyGetPropertyMinValueMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n CAST_N_GETMIN(FloatProperty, theProperty, parser);\n CAST_N_GETMIN(DoubleProperty, theProperty, parser);\n CAST_N_GETMIN(IntProperty, theProperty, parser);\n CAST_N_GETMIN(IntVec2Property, theProperty, parser);\n CAST_N_GETMIN(IntVec3Property, theProperty, parser);\n CAST_N_GETMIN(IntVec4Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat2Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat3Property, theProperty, parser);\n CAST_N_GETMIN(FloatMat4Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec2Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec3Property, theProperty, parser);\n CAST_N_GETMIN(FloatVec4Property, theProperty, parser);\n LogErrorCustom(\"inviwo_getPropertyMaxValue\", \"Unknown parameter type: \" << theProperty->getClassIdentifier());\n Py_RETURN_NONE;\n}\n\nPyObject* py_clickButton(PyObject* \/*self*\/, PyObject* args) {\n static PyClickButtonMethod p;\n\n if (!p.testParams(args)) return nullptr;\n\n std::string path = std::string(PyValueParser::parse<std::string>(PyTuple_GetItem(args, 0)));\n\n Property* theProperty =\n InviwoApplication::getPtr()->getProcessorNetwork()->getProperty(splitString(path, '.'));\n\n if (!theProperty) {\n std::string msg = std::string(\"setPropertyValue() no property with path: \") + path;\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n ButtonProperty* button = dynamic_cast<ButtonProperty*>(theProperty);\n\n if (!button) {\n std::string msg = std::string(\"clickButton() found property is not a ButtonProperty: \") +\n theProperty->getClassIdentifier();\n PyErr_SetString(PyExc_TypeError, msg.c_str());\n return nullptr;\n }\n\n button->pressButton();\n Py_RETURN_NONE;\n}\n\nPySetPropertyValueMethod::PySetPropertyValueMethod() : path_(\"path\"), value_(\"value\") {\n addParam(&path_);\n addParam(&value_);\n}\n\nPySetPropertyMaxValueMethod::PySetPropertyMaxValueMethod() : path_(\"path\"), maxValue_(\"maxValue\") {\n addParam(&path_);\n addParam(&maxValue_);\n}\n\nPySetPropertyMinValueMethod::PySetPropertyMinValueMethod() : path_(\"path\"), minValue_(\"minValue\") {\n addParam(&path_);\n addParam(&minValue_);\n}\n\nPyGetPropertyValueMethod::PyGetPropertyValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyGetPropertyMaxValueMethod::PyGetPropertyMaxValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyGetPropertyMinValueMethod::PyGetPropertyMinValueMethod() : path_(\"path\") { addParam(&path_); }\n\nPyClickButtonMethod::PyClickButtonMethod() : path_(\"path\") { addParam(&path_); }\n}<|endoftext|>"} {"text":"<commit_before>\/* Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n *\n * Copyright 2016 INRIA.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n*\/\n\n\/*! \\file MoreauJeanGOSI.hpp *\/\n\n#ifndef MoreauJeanGOSI_H\n#define MoreauJeanGOSI_H\n\n#include \"OneStepIntegrator.hpp\"\n#include \"OneStepNSProblem.hpp\"\n\n#include <limits>\n\n\/** \\class MoreauJeanGOSI\n * \\brief One Step time Integrator for First Order Dynamical Systems for\n * mechanical Systems (LagrangianDS and NewtonEulerDS)\n * \\author SICONOS Development Team - copyright INRIA\n * \\version 3.0.0.\n * \\date (Creation) Apr 26, 2004\n *\n * This integrator is the work horse of the event--capturing time stepping schemes\n * for mechanical systems. It is mainly based on the pioneering works of M. Jean and\n * J.J. Moreau for the time integration of mechanical systems\n * with unilateral contact, impact and Coulomb's friction with \\f$\\theta\\f$ scheme\n *\n * For the linear Lagrangina system, the scheme reads as\n * \\f{equation}{\n * \\begin{cases}\n * M (v_{k+1}-v_k)\n * + h K q_{k+\\theta} + h C v_{k+\\theta} - h F_{k+\\theta} = p_{k+1} = G P_{k+1},\\label{eq:MoreauTS-motion}\\\\[1mm]\n * q_{k+1} = q_{k} + h v_{k+\\theta}, \\quad \\\\[1mm]\n * U_{k+1} = G^\\top\\, v_{k+1}, \\\\[1mm]\n * \\begin{array}{lcl}\n * 0 \\leq U^\\alpha_{k+1} + e U^\\alpha_{k} \\perp P^\\alpha_{k+1} \\geq 0,& \\quad&\\alpha \\in \\mathcal I_1, \\\\[1mm]\n * P^\\alpha_{k+1} =0,&\\quad& \\alpha \\in \\mathcal I \\setminus \\mathcal I_1,\n * \\end{array}\n * \\end{cases} \\f}\n * with \\f$\\theta \\in [0,1]\\f$. The index set \\f$\\mathcal I_1\\f$ is the discrete equivalent\n * to the rule that allows us to apply the Signorini condition at the velocity level.\n * In the numerical practice, we choose to define this set by\n * \\f{equation}{\n * \\label{eq:index-set1}\n * \\mathcal I_1 = \\{\\alpha \\in \\mathcal I \\mid G^\\top (q_{k} + h v_{k}) + w \\leq 0\\text{ and } U_k \\leq 0 \\}.\n * \\f}.\n *\n * For more details, we refer to\n *\n * M. Jean and J.J. Moreau. Dynamics in the presence of unilateral contacts and dry friction: a numerical approach.\n * In G. Del Pietro and F. Maceri, editors, Unilateral problems in structural analysis.\n * II, pages 151–196. CISM 304, Spinger Verlag, 1987.\n *\n * J.J. Moreau. Unilateral contact and dry friction in finite freedom dynamics.\n * In J.J. Moreau and Panagiotopoulos P.D., editors, Nonsmooth Mechanics and Applications,\n * number 302 in CISM, Courses and lectures, pages 1–82. CISM 302, Spinger Verlag, Wien- New York, 1988a.\n *\n * J.J. Moreau. Numerical aspects of the sweeping process.\n * Computer Methods in Applied Mechanics and Engineering, 177:329–349, 1999.\n *\n * M. Jean. The non smooth contact dynamics method.\n * Computer Methods in Applied Mechanics and Engineering, 177:235–257, 1999.\n *\n * and for a review :\n *\n * V. Acary and B. Brogliato. Numerical Methods for Nonsmooth Dynamical Systems:\n * Applications in Mechanics and Electronics, volume 35 of Lecture Notes in\n * Applied and Computational Mechanics. Springer Verlag, 2008.\n *\n *\n * MoreauJeanGOSI class is used to define some time-integrators methods for a\n * list of dynamical systems. A MoreauJeanGOSI instance is defined by the value\n * of theta and the list of concerned dynamical systems.\n *\n * Each DynamicalSystem is associated to a SiconosMatrix, named \"W\", the \"iteration\" matrix\"\n * W matrices are initialized and computed in initializeIterationMatrixW and computeW. Depending on the DS type,\n * they may depend on time t and DS state x.\n *\n * For mechanical systems, the implementation uses _p for storing the\n * the input due to the nonsmooth law. This MoreauJeanGOSI scheme assumes that the\n * relative degree is two.\n *\n * For Lagrangian systems, the implementation uses _p[1] for storing the\n * discrete impulse.\n *\n * Main functions:\n *\n * - computeFreeState(): computes xfree (or vfree), dynamical systems\n * state without taking non-smooth part into account \\n\n *\n * - updateState(): computes x (q,v), the complete dynamical systems\n * states.\n * See User's guide for details.\n *\n *\/\nclass MoreauJeanGOSI : public OneStepIntegrator\n{\nprotected:\n \/** serialization hooks\n *\/\n ACCEPT_SERIALIZATION(MoreauJeanGOSI);\n\n \/** Stl map that associates the columns of W MoreauJeanGOSI matrix to each DynamicalSystem of the OSI if it has some boundary conditions *\/\n MapOfDSMatrices _WBoundaryConditionsMap;\n\n \/** Stl map that associates a theta parameter for the integration\n * scheme to each DynamicalSystem of the OSI *\/\n double _theta;\n\n \/** A gamma parameter for the integration scheme to each DynamicalSystem of the OSI\n * This parameter is used to apply a theta-method to the input $r$\n *\/\n double _gamma;\n\n \/** a boolean to know if the parameter must be used or not\n *\/\n bool _useGamma;\n\n \/** a boolean to know if the parameter must be used or not\n *\/\n bool _useGammaForRelation;\n\n \/** a boolean to force the evaluation of T in an explicit way\n *\/\n bool _explicitNewtonEulerDSOperators;\n\n \/** nslaw effects\n *\/\n struct _NSLEffectOnFreeOutput;\n friend struct _NSLEffectOnFreeOutput;\n\npublic:\n \n enum {OSNSP_RHS,WORK_INTERACTION_LENGTH};\n\n \/** constructor from theta value only\n * \\param theta value for all linked DS (default = 0.5).\n * \\param gamma value for all linked DS (default = NaN and gamma is not used).\n *\/\n MoreauJeanGOSI(double theta = 0.5, double gamma = std::numeric_limits<double>::quiet_NaN());\n\n \/** destructor\n *\/\n virtual ~MoreauJeanGOSI() {};\n\n \/\/ --- GETTERS\/SETTERS ---\n\n \/** get the value of W corresponding to DynamicalSystem ds\n * \\param ds a pointer to DynamicalSystem, optional, default =\n * NULL. get W[0] in that case\n * \\return SimpleMatrix\n *\/\n const SimpleMatrix getW(SP::DynamicalSystem ds = SP::DynamicalSystem());\n\n \/** get W corresponding to DynamicalSystem ds\n * \\param ds a pointer to DynamicalSystem\n * \\return pointer to a SiconosMatrix\n *\/\n SP::SimpleMatrix W(SP::DynamicalSystem ds);\n\n \/** set the value of W[ds] to newValue\n * \\param newValue SiconosMatrix\n * \\param ds a pointer to DynamicalSystem,\n *\/\n void setW(const SiconosMatrix& newValue, SP::DynamicalSystem ds);\n\n \/** set W[ds] to pointer newPtr\n * \\param newPtr\n * \\param ds a pointer to DynamicalSystem\n *\/\n void setWPtr(SP::SimpleMatrix newPtr, SP::DynamicalSystem ds);\n\n \/\/ -- WBoundaryConditions --\n\n \/** get WBoundaryConditions map\n * \\return a MapOfDSMatrices\n *\/\n inline MapOfDSMatrices getWBoundaryConditionsMap() const\n {\n return _WBoundaryConditionsMap;\n };\n\n \/** get the value of WBoundaryConditions corresponding to DynamicalSystem ds\n * \\param ds a pointer to DynamicalSystem, optional, default =\n * NULL. get WBoundaryConditions[0] in that case\n * \\return SimpleMatrix\n *\/\n const SimpleMatrix getWBoundaryConditions(SP::DynamicalSystem ds = SP::DynamicalSystem());\n\n \/** get WBoundaryConditions corresponding to DynamicalSystem ds\n * \\param ds a pointer to DynamicalSystem, optional, default =\n * NULL. get WBoundaryConditions[0] in that case\n * \\return pointer to a SiconosMatrix\n *\/\n SP::SiconosMatrix WBoundaryConditions(SP::DynamicalSystem ds);\n\n \/\/ -- theta --\n\n \/** get theta\n * \\return a double\n *\/\n inline double theta()\n {\n return _theta;\n };\n\n \/** set the value of theta\n * \\param newTheta a double\n *\/\n inline void setTheta(double newTheta)\n {\n _theta = newTheta;\n };\n\n \/\/ -- gamma --\n\n \/** get gamma\n * \\return a double\n *\/\n inline double gamma()\n {\n return _gamma;\n };\n\n \/** set the value of gamma\n * \\param newGamma a double\n *\/\n inline void setGamma(double newGamma)\n {\n _gamma = newGamma;\n _useGamma = true;\n };\n\n \/\/ -- useGamma --\n\n \/** get bool useGamma\n * \\return a bool\n *\/\n inline bool useGamma()\n {\n return _useGamma;\n };\n\n \/** set the Boolean to indicate that we use gamma\n * \\param newUseGamma a Boolean variable\n *\/\n inline void setUseGamma(bool newUseGamma)\n {\n _useGamma = newUseGamma;\n };\n\n \/** get bool gammaForRelation for the relation\n * \\return a Boolean\n *\/\n inline bool useGammaForRelation()\n {\n return _useGammaForRelation;\n };\n\n \/** set the boolean to indicate that we use gamma for the relation\n * \\param newUseGammaForRelation a Boolean\n *\/\n inline void setUseGammaForRelation(bool newUseGammaForRelation)\n {\n _useGammaForRelation = newUseGammaForRelation;\n if(_useGammaForRelation) _useGamma = false;\n };\n\n \/** get boolean _explicitNewtonEulerDSOperators for the relation\n * \\return a Boolean\n *\/\n inline bool explicitNewtonEulerDSOperators()\n {\n return _explicitNewtonEulerDSOperators;\n };\n\n \/** set the boolean to indicate that we use gamma for the relation\n * \\param newUseGammaForRelation a Boolean\n *\/\n inline void setExplicitNewtonEulerDSOperators(bool newExplicitNewtonEulerDSOperators)\n {\n _explicitNewtonEulerDSOperators = newExplicitNewtonEulerDSOperators;\n };\n\n \/\/ --- OTHER FUNCTIONS ---\n\n virtual void initialize_nonsmooth_problems();\n\n \n \/** initialization of the work vectors and matrices (properties) related to\n * one dynamical system on the graph and needed by the osi\n * \\param m the Model\n * \\param t time of initialization\n * \\param ds the dynamical system\n *\/\n void initializeDynamicalSystem(Model& m, double t, SP::DynamicalSystem ds);\n\n \/** initialization of the work vectors and matrices (properties) related to\n * one interaction on the graph and needed by the osi\n * \\param inter the interaction\n * \\param interProp the properties on the graph\n * \\param DSG the dynamical systems graph\n *\/\n void fillDSLinks(Interaction &inter,\n\t\t InteractionProperties& interProp,\n\t\t DynamicalSystemsGraph & DSG);\n\n \/** get the number of index sets required for the simulation\n * \\return unsigned int\n *\/\n unsigned int numberOfIndexSets() const {return 2;};\n\n \n \/** initialize iteration matrix W MoreauJeanGOSI matrix at time t\n * \\param time\n * \\param ds a pointer to DynamicalSystem\n *\/\n void initializeIterationMatrixW(double time, SP::DynamicalSystem ds);\n\n \/** compute W MoreauJeanGOSI matrix at time t\n * \\param time (double)\n * \\param ds a pointer to DynamicalSystem\n * \\param W the matrix to compute\n *\/\n void computeW(double time, SP::DynamicalSystem ds, SiconosMatrix& W);\n\n \/** compute WBoundaryConditionsMap[ds] MoreauJeanGOSI matrix at time t\n * \\param ds a pointer to DynamicalSystem\n *\/\n void computeWBoundaryConditions(SP::DynamicalSystem ds);\n\n \/** initialize iteration matrix WBoundaryConditionsMap[ds] MoreauJeanGOSI\n * \\param ds a pointer to DynamicalSystem\n *\/\n void initializeIterationMatrixWBoundaryConditions(SP::DynamicalSystem ds);\n\n\n \/** compute the initial state of the Newton loop.\n *\/\n void computeInitialNewtonState();\n\n\n \/** return the maximum of all norms for the \"MoreauJeanGOSI-discretized\" residus of DS\n \\return a double\n *\/\n double computeResidu();\n\n \/** Perform the integration of the dynamical systems linked to this integrator\n * without taking into account the nonsmooth input (_r or _p)\n *\/\n virtual void computeFreeState();\n\n \/** integrates the Interaction linked to this integrator, without taking non-smooth effects into account\n * \\param vertex_inter vertex of the interaction graph\n * \\param osnsp pointer to OneStepNSProblem\n *\/\n\/\/ virtual void computeFreeOutput(InteractionsGraph::VDescriptor& vertex_inter, OneStepNSProblem* osnsp);\n\n \/** Apply the rule to one Interaction to known if is it should be included\n * in the IndexSet of level i\n * \\param inter the Interaction to test\n * \\param i level of the IndexSet\n * \\return Boolean\n *\/\n virtual bool addInteractionInIndexSet(SP::Interaction inter, unsigned int i);\n\n \/** Apply the rule to one Interaction to known if is it should be removed\n * in the IndexSet of level i\n * \\param inter the Interaction to test\n * \\param i level of the IndexSet\n * \\return Boolean\n *\/\n virtual bool removeInteractionInIndexSet(SP::Interaction inter, unsigned int i);\n\n\n \/** method to prepare the fist Newton iteration\n * \\param time\n *\/\n void prepareNewtonIteration(double time);\n\n\n \/** integrate the system, between tinit and tend (->iout=true), with possible stop at tout (->iout=false)\n * \\param tinit the initial time\n * \\param tend the end time\n * \\param tout the real end time\n * \\param notUsed useless flag (for MoreauJeanGOSI, used in LsodarOSI)\n *\/\n void integrate(double& tinit, double& tend, double& tout, int& notUsed);\n\n \/** update the state of the dynamical systems\n \\param ds the dynamical to update\n *\/\n virtual void updatePosition(DynamicalSystem &ds);\n\n \/** update the state of the dynamical systems\n * \\param level the level of interest for the dynamics: not used at the time\n *\/\n virtual void updateState(const unsigned int level);\n\n \/** Compute the nonsmooth law contribution\n * \\param inter the interaction (for y_k)\n * \\param osnsp the non-smooth integrator\n *\/\n void NSLcontrib(SP::Interaction inter, OneStepNSProblem& osnsp);\n\n \/** Displays the data of the MoreauJeanGOSI's integrator\n *\/\n void display();\n\n \/** visitors hook\n *\/\n ACCEPT_STD_VISITORS();\n\n};\n\n#endif \/\/ MoreauJeanGOSI_H\n<commit_msg>[kernel] remove unimplemented methods<commit_after>\/* Siconos is a program dedicated to modeling, simulation and control\n * of non smooth dynamical systems.\n *\n * Copyright 2016 INRIA.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n*\/\n\n\/*! \\file MoreauJeanGOSI.hpp *\/\n\n#ifndef MoreauJeanGOSI_H\n#define MoreauJeanGOSI_H\n\n#include \"OneStepIntegrator.hpp\"\n#include \"OneStepNSProblem.hpp\"\n\n#include <limits>\n\n\/** \\class MoreauJeanGOSI\n * \\brief One Step time Integrator for First Order Dynamical Systems for\n * mechanical Systems (LagrangianDS and NewtonEulerDS)\n * \\author SICONOS Development Team - copyright INRIA\n * \\version 3.0.0.\n * \\date (Creation) Apr 26, 2004\n *\n * This integrator is the work horse of the event--capturing time stepping schemes\n * for mechanical systems. It is mainly based on the pioneering works of M. Jean and\n * J.J. Moreau for the time integration of mechanical systems\n * with unilateral contact, impact and Coulomb's friction with \\f$\\theta\\f$ scheme\n *\n * For the linear Lagrangina system, the scheme reads as\n * \\f{equation}{\n * \\begin{cases}\n * M (v_{k+1}-v_k)\n * + h K q_{k+\\theta} + h C v_{k+\\theta} - h F_{k+\\theta} = p_{k+1} = G P_{k+1},\\label{eq:MoreauTS-motion}\\\\[1mm]\n * q_{k+1} = q_{k} + h v_{k+\\theta}, \\quad \\\\[1mm]\n * U_{k+1} = G^\\top\\, v_{k+1}, \\\\[1mm]\n * \\begin{array}{lcl}\n * 0 \\leq U^\\alpha_{k+1} + e U^\\alpha_{k} \\perp P^\\alpha_{k+1} \\geq 0,& \\quad&\\alpha \\in \\mathcal I_1, \\\\[1mm]\n * P^\\alpha_{k+1} =0,&\\quad& \\alpha \\in \\mathcal I \\setminus \\mathcal I_1,\n * \\end{array}\n * \\end{cases} \\f}\n * with \\f$\\theta \\in [0,1]\\f$. The index set \\f$\\mathcal I_1\\f$ is the discrete equivalent\n * to the rule that allows us to apply the Signorini condition at the velocity level.\n * In the numerical practice, we choose to define this set by\n * \\f{equation}{\n * \\label{eq:index-set1}\n * \\mathcal I_1 = \\{\\alpha \\in \\mathcal I \\mid G^\\top (q_{k} + h v_{k}) + w \\leq 0\\text{ and } U_k \\leq 0 \\}.\n * \\f}.\n *\n * For more details, we refer to\n *\n * M. Jean and J.J. Moreau. Dynamics in the presence of unilateral contacts and dry friction: a numerical approach.\n * In G. Del Pietro and F. Maceri, editors, Unilateral problems in structural analysis.\n * II, pages 151–196. CISM 304, Spinger Verlag, 1987.\n *\n * J.J. Moreau. Unilateral contact and dry friction in finite freedom dynamics.\n * In J.J. Moreau and Panagiotopoulos P.D., editors, Nonsmooth Mechanics and Applications,\n * number 302 in CISM, Courses and lectures, pages 1–82. CISM 302, Spinger Verlag, Wien- New York, 1988a.\n *\n * J.J. Moreau. Numerical aspects of the sweeping process.\n * Computer Methods in Applied Mechanics and Engineering, 177:329–349, 1999.\n *\n * M. Jean. The non smooth contact dynamics method.\n * Computer Methods in Applied Mechanics and Engineering, 177:235–257, 1999.\n *\n * and for a review :\n *\n * V. Acary and B. Brogliato. Numerical Methods for Nonsmooth Dynamical Systems:\n * Applications in Mechanics and Electronics, volume 35 of Lecture Notes in\n * Applied and Computational Mechanics. Springer Verlag, 2008.\n *\n *\n * MoreauJeanGOSI class is used to define some time-integrators methods for a\n * list of dynamical systems. A MoreauJeanGOSI instance is defined by the value\n * of theta and the list of concerned dynamical systems.\n *\n * Each DynamicalSystem is associated to a SiconosMatrix, named \"W\", the \"iteration\" matrix\"\n * W matrices are initialized and computed in initializeIterationMatrixW and computeW. Depending on the DS type,\n * they may depend on time t and DS state x.\n *\n * For mechanical systems, the implementation uses _p for storing the\n * the input due to the nonsmooth law. This MoreauJeanGOSI scheme assumes that the\n * relative degree is two.\n *\n * For Lagrangian systems, the implementation uses _p[1] for storing the\n * discrete impulse.\n *\n * Main functions:\n *\n * - computeFreeState(): computes xfree (or vfree), dynamical systems\n * state without taking non-smooth part into account \\n\n *\n * - updateState(): computes x (q,v), the complete dynamical systems\n * states.\n * See User's guide for details.\n *\n *\/\nclass MoreauJeanGOSI : public OneStepIntegrator\n{\nprotected:\n \/** serialization hooks\n *\/\n ACCEPT_SERIALIZATION(MoreauJeanGOSI);\n\n \/** Stl map that associates the columns of W MoreauJeanGOSI matrix to each DynamicalSystem of the OSI if it has some boundary conditions *\/\n MapOfDSMatrices _WBoundaryConditionsMap;\n\n \/** Stl map that associates a theta parameter for the integration\n * scheme to each DynamicalSystem of the OSI *\/\n double _theta;\n\n \/** A gamma parameter for the integration scheme to each DynamicalSystem of the OSI\n * This parameter is used to apply a theta-method to the input $r$\n *\/\n double _gamma;\n\n \/** a boolean to know if the parameter must be used or not\n *\/\n bool _useGamma;\n\n \/** a boolean to know if the parameter must be used or not\n *\/\n bool _useGammaForRelation;\n\n \/** a boolean to force the evaluation of T in an explicit way\n *\/\n bool _explicitNewtonEulerDSOperators;\n\n \/** nslaw effects\n *\/\n struct _NSLEffectOnFreeOutput;\n friend struct _NSLEffectOnFreeOutput;\n\npublic:\n \n enum {OSNSP_RHS,WORK_INTERACTION_LENGTH};\n\n \/** constructor from theta value only\n * \\param theta value for all linked DS (default = 0.5).\n * \\param gamma value for all linked DS (default = NaN and gamma is not used).\n *\/\n MoreauJeanGOSI(double theta = 0.5, double gamma = std::numeric_limits<double>::quiet_NaN());\n\n \/** destructor\n *\/\n virtual ~MoreauJeanGOSI() {};\n\n \/\/ --- GETTERS\/SETTERS ---\n \n \/\/ --- OTHER FUNCTIONS ---\n\n virtual void initialize_nonsmooth_problems();\n\n \n \/** initialization of the work vectors and matrices (properties) related to\n * one dynamical system on the graph and needed by the osi\n * \\param m the Model\n * \\param t time of initialization\n * \\param ds the dynamical system\n *\/\n void initializeDynamicalSystem(Model& m, double t, SP::DynamicalSystem ds);\n\n \/** initialization of the work vectors and matrices (properties) related to\n * one interaction on the graph and needed by the osi\n * \\param inter the interaction\n * \\param interProp the properties on the graph\n * \\param DSG the dynamical systems graph\n *\/\n void fillDSLinks(Interaction &inter,\n\t\t InteractionProperties& interProp,\n\t\t DynamicalSystemsGraph & DSG);\n\n \/** get the number of index sets required for the simulation\n * \\return unsigned int\n *\/\n unsigned int numberOfIndexSets() const {return 2;};\n\n \n \/** initialize iteration matrix W MoreauJeanGOSI matrix at time t\n * \\param time\n * \\param ds a pointer to DynamicalSystem\n *\/\n void initializeIterationMatrixW(double time, SP::DynamicalSystem ds);\n\n \/** compute W MoreauJeanGOSI matrix at time t\n * \\param time (double)\n * \\param ds a pointer to DynamicalSystem\n * \\param W the matrix to compute\n *\/\n void computeW(double time, SP::DynamicalSystem ds, SiconosMatrix& W);\n\n \/** compute WBoundaryConditionsMap[ds] MoreauJeanGOSI matrix at time t\n * \\param ds a pointer to DynamicalSystem\n *\/\n void computeWBoundaryConditions(SP::DynamicalSystem ds);\n\n \/** initialize iteration matrix WBoundaryConditionsMap[ds] MoreauJeanGOSI\n * \\param ds a pointer to DynamicalSystem\n *\/\n void initializeIterationMatrixWBoundaryConditions(SP::DynamicalSystem ds);\n\n\n \/** compute the initial state of the Newton loop.\n *\/\n void computeInitialNewtonState();\n\n\n \/** return the maximum of all norms for the \"MoreauJeanGOSI-discretized\" residus of DS\n \\return a double\n *\/\n double computeResidu();\n\n \/** Perform the integration of the dynamical systems linked to this integrator\n * without taking into account the nonsmooth input (_r or _p)\n *\/\n virtual void computeFreeState();\n\n \/** integrates the Interaction linked to this integrator, without taking non-smooth effects into account\n * \\param vertex_inter vertex of the interaction graph\n * \\param osnsp pointer to OneStepNSProblem\n *\/\n\/\/ virtual void computeFreeOutput(InteractionsGraph::VDescriptor& vertex_inter, OneStepNSProblem* osnsp);\n\n \/** Apply the rule to one Interaction to known if is it should be included\n * in the IndexSet of level i\n * \\param inter the Interaction to test\n * \\param i level of the IndexSet\n * \\return Boolean\n *\/\n virtual bool addInteractionInIndexSet(SP::Interaction inter, unsigned int i);\n\n \/** Apply the rule to one Interaction to known if is it should be removed\n * in the IndexSet of level i\n * \\param inter the Interaction to test\n * \\param i level of the IndexSet\n * \\return Boolean\n *\/\n virtual bool removeInteractionInIndexSet(SP::Interaction inter, unsigned int i);\n\n\n \/** method to prepare the fist Newton iteration\n * \\param time\n *\/\n void prepareNewtonIteration(double time);\n\n\n \/** integrate the system, between tinit and tend (->iout=true), with possible stop at tout (->iout=false)\n * \\param tinit the initial time\n * \\param tend the end time\n * \\param tout the real end time\n * \\param notUsed useless flag (for MoreauJeanGOSI, used in LsodarOSI)\n *\/\n void integrate(double& tinit, double& tend, double& tout, int& notUsed);\n\n \/** update the state of the dynamical systems\n \\param ds the dynamical to update\n *\/\n virtual void updatePosition(DynamicalSystem &ds);\n\n \/** update the state of the dynamical systems\n * \\param level the level of interest for the dynamics: not used at the time\n *\/\n virtual void updateState(const unsigned int level);\n\n \/** Compute the nonsmooth law contribution\n * \\param inter the interaction (for y_k)\n * \\param osnsp the non-smooth integrator\n *\/\n void NSLcontrib(SP::Interaction inter, OneStepNSProblem& osnsp);\n\n \/** Displays the data of the MoreauJeanGOSI's integrator\n *\/\n void display();\n\n \/** visitors hook\n *\/\n ACCEPT_STD_VISITORS();\n\n};\n\n#endif \/\/ MoreauJeanGOSI_H\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"frame_dropper.h\"\n#include \"internal_defines.h\"\n#include \"trace.h\"\n\nnamespace webrtc\n{\n\nVCMFrameDropper::VCMFrameDropper(WebRtc_Word32 vcmId)\n:\n_vcmId(vcmId),\n_keyFrameSizeAvgKbits(0.9f),\n_keyFrameRatio(0.99f),\n_dropRatio(0.9f, 0.96f)\n{\n Reset();\n}\n\nvoid\nVCMFrameDropper::Reset()\n{\n _keyFrameRatio.Reset(0.99f);\n _keyFrameRatio.Apply(1.0f, 1.0f\/300.0f); \/\/ 1 key frame every 10th second in 30 fps\n _keyFrameSizeAvgKbits.Reset(0.9f);\n _keyFrameCount = 0;\n _accumulator = 0.0f;\n _accumulatorMax = 150.0f; \/\/ assume 300 kb\/s and 0.5 s window\n _targetBitRate = 300.0f;\n _incoming_frame_rate = 30;\n _keyFrameSpreadFrames = 0.5f * _incoming_frame_rate;\n _dropNext = false;\n _dropRatio.Reset(0.9f);\n _dropRatio.Apply(0.0f, 0.0f); \/\/ Initialize to 0\n _dropCount = 0;\n _windowSize = 0.5f;\n _wasBelowMax = true;\n _enabled = true;\n _fastMode = false; \/\/ start with normal (non-aggressive) mode\n \/\/ Cap for the encoder buffer level\/accumulator, in secs.\n _cap_buffer_size = 3.0f;\n \/\/ Cap on maximum amount of dropped frames between kept frames, in secs.\n _max_time_drops = 4.0f;\n}\n\nvoid\nVCMFrameDropper::Enable(bool enable)\n{\n _enabled = enable;\n}\n\nvoid\nVCMFrameDropper::Fill(WebRtc_UWord32 frameSizeBytes, bool deltaFrame)\n{\n if (!_enabled)\n {\n return;\n }\n float frameSizeKbits = 8.0f * static_cast<float>(frameSizeBytes) \/ 1000.0f;\n if (!deltaFrame && !_fastMode) \/\/ fast mode does not treat key-frames any different\n {\n _keyFrameSizeAvgKbits.Apply(1, frameSizeKbits);\n _keyFrameRatio.Apply(1.0, 1.0);\n if (frameSizeKbits > _keyFrameSizeAvgKbits.Value())\n {\n \/\/ Remove the average key frame size since we\n \/\/ compensate for key frames when adding delta\n \/\/ frames.\n frameSizeKbits -= _keyFrameSizeAvgKbits.Value();\n }\n else\n {\n \/\/ Shouldn't be negative, so zero is the lower bound.\n frameSizeKbits = 0;\n }\n if (_keyFrameRatio.Value() > 1e-5 && 1 \/ _keyFrameRatio.Value() < _keyFrameSpreadFrames)\n {\n \/\/ We are sending key frames more often than our upper bound for\n \/\/ how much we allow the key frame compensation to be spread\n \/\/ out in time. Therefor we must use the key frame ratio rather\n \/\/ than keyFrameSpreadFrames.\n _keyFrameCount = static_cast<WebRtc_Word32>(1 \/ _keyFrameRatio.Value() + 0.5);\n }\n else\n {\n \/\/ Compensate for the key frame the following frames\n _keyFrameCount = static_cast<WebRtc_Word32>(_keyFrameSpreadFrames + 0.5);\n }\n }\n else\n {\n \/\/ Decrease the keyFrameRatio\n _keyFrameRatio.Apply(1.0, 0.0);\n }\n \/\/ Change the level of the accumulator (bucket)\n _accumulator += frameSizeKbits;\n CapAccumulator();\n}\n\nvoid\nVCMFrameDropper::Leak(WebRtc_UWord32 inputFrameRate)\n{\n if (!_enabled)\n {\n return;\n }\n if (inputFrameRate < 1)\n {\n return;\n }\n if (_targetBitRate < 0.0f)\n {\n return;\n }\n _keyFrameSpreadFrames = 0.5f * inputFrameRate;\n \/\/ T is the expected bits per frame (target). If all frames were the same size,\n \/\/ we would get T bits per frame. Notice that T is also weighted to be able to\n \/\/ force a lower frame rate if wanted.\n float T = _targetBitRate \/ inputFrameRate;\n if (_keyFrameCount > 0)\n {\n \/\/ Perform the key frame compensation\n if (_keyFrameRatio.Value() > 0 && 1 \/ _keyFrameRatio.Value() < _keyFrameSpreadFrames)\n {\n T -= _keyFrameSizeAvgKbits.Value() * _keyFrameRatio.Value();\n }\n else\n {\n T -= _keyFrameSizeAvgKbits.Value() \/ _keyFrameSpreadFrames;\n }\n _keyFrameCount--;\n }\n _accumulator -= T;\n UpdateRatio();\n}\n\nvoid\nVCMFrameDropper::UpdateNack(WebRtc_UWord32 nackBytes)\n{\n if (!_enabled)\n {\n return;\n }\n _accumulator += static_cast<float>(nackBytes) * 8.0f \/ 1000.0f;\n}\n\nvoid\nVCMFrameDropper::FillBucket(float inKbits, float outKbits)\n{\n _accumulator += (inKbits - outKbits);\n}\n\nvoid\nVCMFrameDropper::UpdateRatio()\n{\n if (_accumulator > 1.3f * _accumulatorMax)\n {\n \/\/ Too far above accumulator max, react faster\n _dropRatio.UpdateBase(0.8f);\n }\n else\n {\n \/\/ Go back to normal reaction\n _dropRatio.UpdateBase(0.9f);\n }\n if (_accumulator > _accumulatorMax)\n {\n \/\/ We are above accumulator max, and should ideally\n \/\/ drop a frame. Increase the dropRatio and drop\n \/\/ the frame later.\n if (_wasBelowMax)\n {\n _dropNext = true;\n }\n if (_fastMode)\n {\n \/\/ always drop in aggressive mode\n _dropNext = true;\n }\n\n _dropRatio.Apply(1.0f, 1.0f);\n _dropRatio.UpdateBase(0.9f);\n }\n else\n {\n _dropRatio.Apply(1.0f, 0.0f);\n }\n if (_accumulator < 0.0f)\n {\n _accumulator = 0.0f;\n }\n _wasBelowMax = _accumulator < _accumulatorMax;\n WEBRTC_TRACE(webrtc::kTraceDebug, webrtc::kTraceVideoCoding, VCMId(_vcmId), \"FrameDropper: dropRatio = %f accumulator = %f, accumulatorMax = %f\", _dropRatio.Value(), _accumulator, _accumulatorMax);\n}\n\n\/\/ This function signals when to drop frames to the caller. It makes use of the dropRatio\n\/\/ to smooth out the drops over time.\nbool\nVCMFrameDropper::DropFrame()\n{\n if (!_enabled)\n {\n return false;\n }\n if (_dropNext)\n {\n _dropNext = false;\n _dropCount = 0;\n }\n\n if (_dropRatio.Value() >= 0.5f) \/\/ Drops per keep\n {\n \/\/ limit is the number of frames we should drop between each kept frame\n \/\/ to keep our drop ratio. limit is positive in this case.\n float denom = 1.0f - _dropRatio.Value();\n if (denom < 1e-5)\n {\n denom = (float)1e-5;\n }\n WebRtc_Word32 limit = static_cast<WebRtc_Word32>(1.0f \/ denom - 1.0f + 0.5f);\n \/\/ Put a bound on the max amount of dropped frames between each kept\n \/\/ frame, in terms of frame rate and window size (secs).\n int max_limit = static_cast<int>(_incoming_frame_rate *\n _max_time_drops);\n if (limit > max_limit) {\n limit = max_limit;\n }\n if (_dropCount < 0)\n {\n \/\/ Reset the _dropCount since it was negative and should be positive.\n if (_dropRatio.Value() > 0.4f)\n {\n _dropCount = -_dropCount;\n }\n else\n {\n _dropCount = 0;\n }\n }\n if (_dropCount < limit)\n {\n \/\/ As long we are below the limit we should drop frames.\n _dropCount++;\n return true;\n }\n else\n {\n \/\/ Only when we reset _dropCount a frame should be kept.\n _dropCount = 0;\n return false;\n }\n }\n else if (_dropRatio.Value() > 0.0f && _dropRatio.Value() < 0.5f) \/\/ Keeps per drop\n {\n \/\/ limit is the number of frames we should keep between each drop\n \/\/ in order to keep the drop ratio. limit is negative in this case,\n \/\/ and the _dropCount is also negative.\n float denom = _dropRatio.Value();\n if (denom < 1e-5)\n {\n denom = (float)1e-5;\n }\n WebRtc_Word32 limit = -static_cast<WebRtc_Word32>(1.0f \/ denom - 1.0f + 0.5f);\n if (_dropCount > 0)\n {\n \/\/ Reset the _dropCount since we have a positive\n \/\/ _dropCount, and it should be negative.\n if (_dropRatio.Value() < 0.6f)\n {\n _dropCount = -_dropCount;\n }\n else\n {\n _dropCount = 0;\n }\n }\n if (_dropCount > limit)\n {\n if (_dropCount == 0)\n {\n \/\/ Drop frames when we reset _dropCount.\n _dropCount--;\n return true;\n }\n else\n {\n \/\/ Keep frames as long as we haven't reached limit.\n _dropCount--;\n return false;\n }\n }\n else\n {\n _dropCount = 0;\n return false;\n }\n }\n _dropCount = 0;\n return false;\n\n \/\/ A simpler version, unfiltered and quicker\n \/\/bool dropNext = _dropNext;\n \/\/_dropNext = false;\n \/\/return dropNext;\n}\n\nvoid\nVCMFrameDropper::SetRates(float bitRate, float incoming_frame_rate)\n{\n \/\/ Bit rate of -1 means infinite bandwidth.\n _accumulatorMax = bitRate * _windowSize; \/\/ bitRate * windowSize (in seconds)\n if (_targetBitRate > 0.0f && bitRate < _targetBitRate && _accumulator > _accumulatorMax)\n {\n \/\/ Rescale the accumulator level if the accumulator max decreases\n _accumulator = bitRate \/ _targetBitRate * _accumulator;\n }\n _targetBitRate = bitRate;\n CapAccumulator();\n _incoming_frame_rate = incoming_frame_rate;\n}\n\nfloat\nVCMFrameDropper::ActualFrameRate(WebRtc_UWord32 inputFrameRate) const\n{\n if (!_enabled)\n {\n return static_cast<float>(inputFrameRate);\n }\n return inputFrameRate * (1.0f - _dropRatio.Value());\n}\n\n\/\/ Put a cap on the accumulator, i.e., don't let it grow beyond some level.\n\/\/ This is a temporary fix for screencasting where very large frames from\n\/\/ encoder will cause very slow response (too many frame drops).\nvoid VCMFrameDropper::CapAccumulator() {\n float max_accumulator = _targetBitRate * _cap_buffer_size;\n if (_accumulator > max_accumulator) {\n _accumulator = max_accumulator;\n }\n}\n\n}\n<commit_msg>VCM: Removing frame drop enable from Reset call BUG = 1387<commit_after>\/*\n * Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"frame_dropper.h\"\n#include \"internal_defines.h\"\n#include \"trace.h\"\n\nnamespace webrtc\n{\n\nVCMFrameDropper::VCMFrameDropper(WebRtc_Word32 vcmId)\n:\n_vcmId(vcmId),\n_keyFrameSizeAvgKbits(0.9f),\n_keyFrameRatio(0.99f),\n_dropRatio(0.9f, 0.96f),\n_enabled(true)\n{\n Reset();\n}\n\nvoid\nVCMFrameDropper::Reset()\n{\n _keyFrameRatio.Reset(0.99f);\n _keyFrameRatio.Apply(1.0f, 1.0f\/300.0f); \/\/ 1 key frame every 10th second in 30 fps\n _keyFrameSizeAvgKbits.Reset(0.9f);\n _keyFrameCount = 0;\n _accumulator = 0.0f;\n _accumulatorMax = 150.0f; \/\/ assume 300 kb\/s and 0.5 s window\n _targetBitRate = 300.0f;\n _incoming_frame_rate = 30;\n _keyFrameSpreadFrames = 0.5f * _incoming_frame_rate;\n _dropNext = false;\n _dropRatio.Reset(0.9f);\n _dropRatio.Apply(0.0f, 0.0f); \/\/ Initialize to 0\n _dropCount = 0;\n _windowSize = 0.5f;\n _wasBelowMax = true;\n _fastMode = false; \/\/ start with normal (non-aggressive) mode\n \/\/ Cap for the encoder buffer level\/accumulator, in secs.\n _cap_buffer_size = 3.0f;\n \/\/ Cap on maximum amount of dropped frames between kept frames, in secs.\n _max_time_drops = 4.0f;\n}\n\nvoid\nVCMFrameDropper::Enable(bool enable)\n{\n _enabled = enable;\n}\n\nvoid\nVCMFrameDropper::Fill(WebRtc_UWord32 frameSizeBytes, bool deltaFrame)\n{\n if (!_enabled)\n {\n return;\n }\n float frameSizeKbits = 8.0f * static_cast<float>(frameSizeBytes) \/ 1000.0f;\n if (!deltaFrame && !_fastMode) \/\/ fast mode does not treat key-frames any different\n {\n _keyFrameSizeAvgKbits.Apply(1, frameSizeKbits);\n _keyFrameRatio.Apply(1.0, 1.0);\n if (frameSizeKbits > _keyFrameSizeAvgKbits.Value())\n {\n \/\/ Remove the average key frame size since we\n \/\/ compensate for key frames when adding delta\n \/\/ frames.\n frameSizeKbits -= _keyFrameSizeAvgKbits.Value();\n }\n else\n {\n \/\/ Shouldn't be negative, so zero is the lower bound.\n frameSizeKbits = 0;\n }\n if (_keyFrameRatio.Value() > 1e-5 && 1 \/ _keyFrameRatio.Value() < _keyFrameSpreadFrames)\n {\n \/\/ We are sending key frames more often than our upper bound for\n \/\/ how much we allow the key frame compensation to be spread\n \/\/ out in time. Therefor we must use the key frame ratio rather\n \/\/ than keyFrameSpreadFrames.\n _keyFrameCount = static_cast<WebRtc_Word32>(1 \/ _keyFrameRatio.Value() + 0.5);\n }\n else\n {\n \/\/ Compensate for the key frame the following frames\n _keyFrameCount = static_cast<WebRtc_Word32>(_keyFrameSpreadFrames + 0.5);\n }\n }\n else\n {\n \/\/ Decrease the keyFrameRatio\n _keyFrameRatio.Apply(1.0, 0.0);\n }\n \/\/ Change the level of the accumulator (bucket)\n _accumulator += frameSizeKbits;\n CapAccumulator();\n}\n\nvoid\nVCMFrameDropper::Leak(WebRtc_UWord32 inputFrameRate)\n{\n if (!_enabled)\n {\n return;\n }\n if (inputFrameRate < 1)\n {\n return;\n }\n if (_targetBitRate < 0.0f)\n {\n return;\n }\n _keyFrameSpreadFrames = 0.5f * inputFrameRate;\n \/\/ T is the expected bits per frame (target). If all frames were the same size,\n \/\/ we would get T bits per frame. Notice that T is also weighted to be able to\n \/\/ force a lower frame rate if wanted.\n float T = _targetBitRate \/ inputFrameRate;\n if (_keyFrameCount > 0)\n {\n \/\/ Perform the key frame compensation\n if (_keyFrameRatio.Value() > 0 && 1 \/ _keyFrameRatio.Value() < _keyFrameSpreadFrames)\n {\n T -= _keyFrameSizeAvgKbits.Value() * _keyFrameRatio.Value();\n }\n else\n {\n T -= _keyFrameSizeAvgKbits.Value() \/ _keyFrameSpreadFrames;\n }\n _keyFrameCount--;\n }\n _accumulator -= T;\n UpdateRatio();\n}\n\nvoid\nVCMFrameDropper::UpdateNack(WebRtc_UWord32 nackBytes)\n{\n if (!_enabled)\n {\n return;\n }\n _accumulator += static_cast<float>(nackBytes) * 8.0f \/ 1000.0f;\n}\n\nvoid\nVCMFrameDropper::FillBucket(float inKbits, float outKbits)\n{\n _accumulator += (inKbits - outKbits);\n}\n\nvoid\nVCMFrameDropper::UpdateRatio()\n{\n if (_accumulator > 1.3f * _accumulatorMax)\n {\n \/\/ Too far above accumulator max, react faster\n _dropRatio.UpdateBase(0.8f);\n }\n else\n {\n \/\/ Go back to normal reaction\n _dropRatio.UpdateBase(0.9f);\n }\n if (_accumulator > _accumulatorMax)\n {\n \/\/ We are above accumulator max, and should ideally\n \/\/ drop a frame. Increase the dropRatio and drop\n \/\/ the frame later.\n if (_wasBelowMax)\n {\n _dropNext = true;\n }\n if (_fastMode)\n {\n \/\/ always drop in aggressive mode\n _dropNext = true;\n }\n\n _dropRatio.Apply(1.0f, 1.0f);\n _dropRatio.UpdateBase(0.9f);\n }\n else\n {\n _dropRatio.Apply(1.0f, 0.0f);\n }\n if (_accumulator < 0.0f)\n {\n _accumulator = 0.0f;\n }\n _wasBelowMax = _accumulator < _accumulatorMax;\n WEBRTC_TRACE(webrtc::kTraceDebug, webrtc::kTraceVideoCoding, VCMId(_vcmId), \"FrameDropper: dropRatio = %f accumulator = %f, accumulatorMax = %f\", _dropRatio.Value(), _accumulator, _accumulatorMax);\n}\n\n\/\/ This function signals when to drop frames to the caller. It makes use of the dropRatio\n\/\/ to smooth out the drops over time.\nbool\nVCMFrameDropper::DropFrame()\n{\n if (!_enabled)\n {\n return false;\n }\n if (_dropNext)\n {\n _dropNext = false;\n _dropCount = 0;\n }\n\n if (_dropRatio.Value() >= 0.5f) \/\/ Drops per keep\n {\n \/\/ limit is the number of frames we should drop between each kept frame\n \/\/ to keep our drop ratio. limit is positive in this case.\n float denom = 1.0f - _dropRatio.Value();\n if (denom < 1e-5)\n {\n denom = (float)1e-5;\n }\n WebRtc_Word32 limit = static_cast<WebRtc_Word32>(1.0f \/ denom - 1.0f + 0.5f);\n \/\/ Put a bound on the max amount of dropped frames between each kept\n \/\/ frame, in terms of frame rate and window size (secs).\n int max_limit = static_cast<int>(_incoming_frame_rate *\n _max_time_drops);\n if (limit > max_limit) {\n limit = max_limit;\n }\n if (_dropCount < 0)\n {\n \/\/ Reset the _dropCount since it was negative and should be positive.\n if (_dropRatio.Value() > 0.4f)\n {\n _dropCount = -_dropCount;\n }\n else\n {\n _dropCount = 0;\n }\n }\n if (_dropCount < limit)\n {\n \/\/ As long we are below the limit we should drop frames.\n _dropCount++;\n return true;\n }\n else\n {\n \/\/ Only when we reset _dropCount a frame should be kept.\n _dropCount = 0;\n return false;\n }\n }\n else if (_dropRatio.Value() > 0.0f && _dropRatio.Value() < 0.5f) \/\/ Keeps per drop\n {\n \/\/ limit is the number of frames we should keep between each drop\n \/\/ in order to keep the drop ratio. limit is negative in this case,\n \/\/ and the _dropCount is also negative.\n float denom = _dropRatio.Value();\n if (denom < 1e-5)\n {\n denom = (float)1e-5;\n }\n WebRtc_Word32 limit = -static_cast<WebRtc_Word32>(1.0f \/ denom - 1.0f + 0.5f);\n if (_dropCount > 0)\n {\n \/\/ Reset the _dropCount since we have a positive\n \/\/ _dropCount, and it should be negative.\n if (_dropRatio.Value() < 0.6f)\n {\n _dropCount = -_dropCount;\n }\n else\n {\n _dropCount = 0;\n }\n }\n if (_dropCount > limit)\n {\n if (_dropCount == 0)\n {\n \/\/ Drop frames when we reset _dropCount.\n _dropCount--;\n return true;\n }\n else\n {\n \/\/ Keep frames as long as we haven't reached limit.\n _dropCount--;\n return false;\n }\n }\n else\n {\n _dropCount = 0;\n return false;\n }\n }\n _dropCount = 0;\n return false;\n\n \/\/ A simpler version, unfiltered and quicker\n \/\/bool dropNext = _dropNext;\n \/\/_dropNext = false;\n \/\/return dropNext;\n}\n\nvoid\nVCMFrameDropper::SetRates(float bitRate, float incoming_frame_rate)\n{\n \/\/ Bit rate of -1 means infinite bandwidth.\n _accumulatorMax = bitRate * _windowSize; \/\/ bitRate * windowSize (in seconds)\n if (_targetBitRate > 0.0f && bitRate < _targetBitRate && _accumulator > _accumulatorMax)\n {\n \/\/ Rescale the accumulator level if the accumulator max decreases\n _accumulator = bitRate \/ _targetBitRate * _accumulator;\n }\n _targetBitRate = bitRate;\n CapAccumulator();\n _incoming_frame_rate = incoming_frame_rate;\n}\n\nfloat\nVCMFrameDropper::ActualFrameRate(WebRtc_UWord32 inputFrameRate) const\n{\n if (!_enabled)\n {\n return static_cast<float>(inputFrameRate);\n }\n return inputFrameRate * (1.0f - _dropRatio.Value());\n}\n\n\/\/ Put a cap on the accumulator, i.e., don't let it grow beyond some level.\n\/\/ This is a temporary fix for screencasting where very large frames from\n\/\/ encoder will cause very slow response (too many frame drops).\nvoid VCMFrameDropper::CapAccumulator() {\n float max_accumulator = _targetBitRate * _cap_buffer_size;\n if (_accumulator > max_accumulator) {\n _accumulator = max_accumulator;\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2015 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"bvh4_builder_instancing.h\"\n#include \"bvh4_statistics.h\"\n#include \"..\/builders\/bvh_builder_sah.h\"\n#include \"..\/geometry\/triangle4.h\"\n\nnamespace embree\n{\n namespace isa\n {\n BVH4BuilderInstancing::BVH4BuilderInstancing (BVH4* bvh, Scene* scene, const createTriangleMeshAccelTy createTriangleMeshAccel) \n : bvh(bvh), objects(bvh->objects), scene(scene), createTriangleMeshAccel(createTriangleMeshAccel), refs(scene->device), prims(scene->device), \n nextRef(0), numInstancedPrimitives(0) {}\n \n BVH4BuilderInstancing::~BVH4BuilderInstancing ()\n {\n for (size_t i=0; i<builders.size(); i++) \n\tdelete builders[i];\n }\n \n void BVH4BuilderInstancing::build(size_t threadIndex, size_t threadCount) \n {\n \/* delete some objects *\/\n size_t N = scene->size();\n if (N < objects.size()) {\n parallel_for(N, objects.size(), [&] (const range<size_t>& r) {\n for (size_t i=r.begin(); i<r.end(); i++) {\n delete builders[i]; builders[i] = nullptr;\n delete objects[i]; objects[i] = nullptr;\n }\n });\n }\n \n \/* reset memory allocator *\/\n bvh->alloc.reset();\n \n \/* skip build for empty scene *\/\n const size_t numPrimitives = scene->getNumPrimitives<TriangleMesh,1>();\n if (numPrimitives == 0) {\n prims.resize(0);\n bvh->set(BVH4::emptyNode,empty,0);\n return;\n }\n \n double t0 = bvh->preBuild(TOSTRING(isa) \"::BVH4BuilderInstancing\");\n \n \/* resize object array if scene got larger *\/\n if (objects.size() < N) objects.resize(N);\n if (builders.size() < N) builders.resize(N);\n if (refs.size() < N) refs.resize(N);\n nextRef = 0;\n \n \/* creation of acceleration structures *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n TriangleMesh* mesh = scene->getTriangleMeshSafe(objectID);\n \n \/* verify meshes got deleted properly *\/\n if (mesh == nullptr || mesh->numTimeSteps != 1) {\n assert(objectID < objects.size () && objects[objectID] == nullptr);\n assert(objectID < builders.size() && builders[objectID] == nullptr);\n continue;\n }\n \n \/* delete BVH and builder for meshes that are scheduled for deletion *\/\n if (mesh->isErasing()) {\n delete builders[objectID]; builders[objectID] = nullptr;\n delete objects [objectID]; objects [objectID] = nullptr;\n continue;\n }\n \n \/* create BVH and builder for new meshes *\/\n if (objects[objectID] == nullptr)\n createTriangleMeshAccel(mesh,(AccelData*&)objects[objectID],builders[objectID]);\n }\n });\n \n numInstancedPrimitives = 0;\n \n \/* parallel build of acceleration structures *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n \/* ignore if no triangle mesh or not enabled *\/\n TriangleMesh* mesh = scene->getTriangleMeshSafe(objectID);\n if (mesh == nullptr || mesh->numTimeSteps != 1) \n continue;\n \n BVH4* object = objects [objectID]; assert(object);\n Builder* builder = builders[objectID]; assert(builder);\n \n \/* build object if it got modified *\/\n if (mesh->isModified() && mesh->isUsed()) \n builder->build(0,0);\n \n \/* create build primitive *\/\n if (!object->bounds.empty() && mesh->isEnabled()) {\n refs[nextRef++] = BVH4BuilderInstancing::BuildRef(one,object->bounds,object->root);\n numInstancedPrimitives += mesh->size();\n }\n }\n });\n \n \/* creates all instances *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n \/* ignore if no triangle mesh or not enabled *\/\n Geometry* geom = scene->get(objectID);\n if (geom->getType() != (Geometry::TRIANGLE_MESH | Geometry::INSTANCE))\n continue;\n \n GeometryInstance* instance = (GeometryInstance*) geom;\n if (!instance->isEnabled() || instance->numTimeSteps != 1) \n continue;\n \n BVH4* object = objects [objectID]; assert(object);\n \n \/* create build primitive *\/\n if (!object->bounds.empty()) {\n refs[nextRef++] = BVH4BuilderInstancing::BuildRef(instance->local2world,object->bounds,object->root);\n numInstancedPrimitives += instance->geom->size();\n }\n }\n });\n \n \/* fast path for single geometry scenes *\/\n \/*if (nextRef == 1) { \n bvh->set(refs[0].node,refs[0].bounds(),numPrimitives);\n return;\n }*\/\n \n \/* open all large nodes *\/\n refs.resize(nextRef);\n open(numPrimitives); \n \n \/* fast path for small geometries *\/\n \/*if (refs.size() == 1) { \n bvh->set(refs[0].node,refs[0].bounds(),numPrimitives);\n return;\n }*\/\n \n \/* compute PrimRefs *\/\n prims.resize(refs.size());\n const PrimInfo pinfo = parallel_reduce(size_t(0), refs.size(), size_t(1024), PrimInfo(empty), [&] (const range<size_t>& r) -> PrimInfo {\n PrimInfo pinfo(empty);\n for (size_t i=r.begin(); i<r.end(); i++) \n {\n const BBox3fa bounds = refs[i].worldBounds();\n pinfo.add(bounds);\n prims[i] = PrimRef(bounds,(size_t)&refs[i]);\n }\n return pinfo;\n }, [] (const PrimInfo& a, const PrimInfo& b) { return PrimInfo::merge(a,b); });\n \n \/* skip if all objects where empty *\/\n if (pinfo.size() == 0)\n bvh->set(BVH4::emptyNode,empty,0);\n \n \/* otherwise build toplevel hierarchy *\/\n else\n {\n BVH4::NodeRef root;\n BVHBuilderBinnedSAH::build<BVH4::NodeRef>\n (root,\n [&] { return bvh->alloc.threadLocal2(); },\n [&] (const isa::BVHBuilderBinnedSAH::BuildRecord& current, BVHBuilderBinnedSAH::BuildRecord* children, const size_t N, FastAllocator::ThreadLocal2* alloc) -> int\n {\n BVH4::Node* node = (BVH4::Node*) alloc->alloc0.malloc(sizeof(BVH4::Node)); node->clear();\n for (size_t i=0; i<N; i++) {\n node->set(i,children[i].pinfo.geomBounds);\n children[i].parent = (size_t*)&node->child(i);\n }\n *current.parent = bvh->encodeNode(node);\n return 0;\n },\n [&] (const BVHBuilderBinnedSAH::BuildRecord& current, FastAllocator::ThreadLocal2* alloc) -> int\n {\n assert(current.prims.size() == 1);\n BuildRef* ref = (BuildRef*) prims[current.prims.begin()].ID();\n BVH4::TransformNode* node = (BVH4::TransformNode*) alloc->alloc0.malloc(sizeof(BVH4::TransformNode)); \n new (node) BVH4::TransformNode(ref->local2world,ref->localBounds,ref->node); \/\/ FIXME: rcp should be precalculated somewhere\n *current.parent = BVH4::encodeNode(node);\n \/\/*current.parent = ref->node;\n \/\/((BVH4::NodeRef*)current.parent)->setBarrier();\n return 1;\n },\n [&] (size_t dn) { bvh->scene->progressMonitor(0); },\n prims.data(),pinfo,BVH4::N,BVH4::maxBuildDepthLeaf,4,1,1,1.0f,1.0f);\n \n bvh->set(root,pinfo.geomBounds,numPrimitives);\n }\n \n \/\/bvh->root = collapse(bvh->root);\n \n bvh->alloc.cleanup();\n bvh->postBuild(t0);\n }\n \n void BVH4BuilderInstancing::clear()\n {\n for (size_t i=0; i<objects.size(); i++) \n if (objects[i]) objects[i]->clear();\n \n for (size_t i=0; i<builders.size(); i++) \n\tif (builders[i]) builders[i]->clear();\n \n refs.clear();\n }\n \n void set_primID(BVH4::NodeRef node, unsigned primID)\n {\n if (node.isLeaf())\n {\n size_t num;\n Triangle4* prims = (Triangle4*) node.leaf(num);\n for (size_t i=0; i<num; i++)\n for (size_t j=0; j<4; j++)\n if (prims[i].geomIDs[j] != -1) \n prims[i].primIDs[j] = primID;\n }\n else \n {\n BVH4::Node* n = node.node();\n for (size_t c=0; c<BVH4::N; c++)\n set_primID(n->child(c),primID);\n }\n }\n \n void BVH4BuilderInstancing::open(size_t numPrimitives)\n {\n if (refs.size() == 0)\n\treturn;\n \n \/\/size_t N = 0;\n \/\/size_t N = numInstancedPrimitives\/2000;\n size_t N = numInstancedPrimitives\/200;\n \/\/size_t N = numInstancedPrimitives;\n \n refs.reserve(N);\n \n std::make_heap(refs.begin(),refs.end());\n while (refs.size()+3 <= N)\n {\n std::pop_heap (refs.begin(),refs.end()); \n BVH4::NodeRef ref = refs.back().node;\n const AffineSpace3fa local2world = refs.back().local2world;\n if (ref.isLeaf()) break;\n refs.pop_back(); \n \n BVH4::Node* node = ref.node();\n for (size_t i=0; i<BVH4::N; i++) {\n if (node->child(i) == BVH4::emptyNode) continue;\n refs.push_back(BuildRef(local2world,node->bounds(i),node->child(i)));\n std::push_heap (refs.begin(),refs.end()); \n }\n }\n \n \/\/for (size_t i=0; i<refs.size(); i++)\n \/\/ set_primID((BVH4::NodeRef) refs[i].node, i);\n }\n \n BVH4::NodeRef BVH4BuilderInstancing::collapse(BVH4::NodeRef& node)\n {\n if (node.isBarrier()) {\n node.clearBarrier();\n return node;\n }\n \n assert(node.isNode());\n BVH4::Node* n = node.node();\n BVH4::TransformNode* first = nullptr;\n for (size_t c=0; c<BVH4::N; c++) {\n BVH4::NodeRef child = n->child(c) = collapse(n->child(c));\n if (child.isTransformNode()) first = child.transformNode();\n }\n \n bool allEqual = true;\n for (size_t c=0; c<BVH4::N; c++) \n {\n BVH4::NodeRef child = n->child(c);\n if (child == BVH4::emptyNode) continue;\n \n if (!child.isTransformNode()) {\n allEqual = false;\n break;\n }\n \n if (child.transformNode()->world2local != first->world2local) {\n allEqual = false;\n break;\n }\n }\n \n if (!allEqual) \n return node;\n \n BBox3fa bounds = empty;\n for (size_t c=0; c<BVH4::N; c++) {\n if (n->child(c) == BVH4::emptyNode) continue;\n BVH4::TransformNode* child = n->child(c).transformNode();\n const BBox3fa cbounds = child->localBounds;\n n->set(c,cbounds,child->child);\n bounds.extend(cbounds);\n }\n first->localBounds = bounds;\n first->child = node;\n return BVH4::encodeNode(first);\n }\n \n Builder* BVH4BuilderInstancingSAH (void* bvh, Scene* scene, const createTriangleMeshAccelTy createTriangleMeshAccel) {\n return new BVH4BuilderInstancing((BVH4*)bvh,scene,createTriangleMeshAccel);\n }\n }\n}\n<commit_msg>collapsing works<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2015 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"bvh4_builder_instancing.h\"\n#include \"bvh4_statistics.h\"\n#include \"..\/builders\/bvh_builder_sah.h\"\n#include \"..\/geometry\/triangle4.h\"\n\nnamespace embree\n{\n namespace isa\n {\n BVH4BuilderInstancing::BVH4BuilderInstancing (BVH4* bvh, Scene* scene, const createTriangleMeshAccelTy createTriangleMeshAccel) \n : bvh(bvh), objects(bvh->objects), scene(scene), createTriangleMeshAccel(createTriangleMeshAccel), refs(scene->device), prims(scene->device), \n nextRef(0), numInstancedPrimitives(0) {}\n \n BVH4BuilderInstancing::~BVH4BuilderInstancing ()\n {\n for (size_t i=0; i<builders.size(); i++) \n\tdelete builders[i];\n }\n \n void BVH4BuilderInstancing::build(size_t threadIndex, size_t threadCount) \n {\n \/* delete some objects *\/\n size_t N = scene->size();\n if (N < objects.size()) {\n parallel_for(N, objects.size(), [&] (const range<size_t>& r) {\n for (size_t i=r.begin(); i<r.end(); i++) {\n delete builders[i]; builders[i] = nullptr;\n delete objects[i]; objects[i] = nullptr;\n }\n });\n }\n \n \/* reset memory allocator *\/\n bvh->alloc.reset();\n \n \/* skip build for empty scene *\/\n const size_t numPrimitives = scene->getNumPrimitives<TriangleMesh,1>();\n if (numPrimitives == 0) {\n prims.resize(0);\n bvh->set(BVH4::emptyNode,empty,0);\n return;\n }\n \n double t0 = bvh->preBuild(TOSTRING(isa) \"::BVH4BuilderInstancing\");\n \n \/* resize object array if scene got larger *\/\n if (objects.size() < N) objects.resize(N);\n if (builders.size() < N) builders.resize(N);\n if (refs.size() < N) refs.resize(N);\n nextRef = 0;\n \n \/* creation of acceleration structures *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n TriangleMesh* mesh = scene->getTriangleMeshSafe(objectID);\n \n \/* verify meshes got deleted properly *\/\n if (mesh == nullptr || mesh->numTimeSteps != 1) {\n assert(objectID < objects.size () && objects[objectID] == nullptr);\n assert(objectID < builders.size() && builders[objectID] == nullptr);\n continue;\n }\n \n \/* delete BVH and builder for meshes that are scheduled for deletion *\/\n if (mesh->isErasing()) {\n delete builders[objectID]; builders[objectID] = nullptr;\n delete objects [objectID]; objects [objectID] = nullptr;\n continue;\n }\n \n \/* create BVH and builder for new meshes *\/\n if (objects[objectID] == nullptr)\n createTriangleMeshAccel(mesh,(AccelData*&)objects[objectID],builders[objectID]);\n }\n });\n \n numInstancedPrimitives = 0;\n \n \/* parallel build of acceleration structures *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n \/* ignore if no triangle mesh or not enabled *\/\n TriangleMesh* mesh = scene->getTriangleMeshSafe(objectID);\n if (mesh == nullptr || mesh->numTimeSteps != 1) \n continue;\n \n BVH4* object = objects [objectID]; assert(object);\n Builder* builder = builders[objectID]; assert(builder);\n \n \/* build object if it got modified *\/\n if (mesh->isModified() && mesh->isUsed()) \n builder->build(0,0);\n \n \/* create build primitive *\/\n if (!object->bounds.empty() && mesh->isEnabled()) {\n refs[nextRef++] = BVH4BuilderInstancing::BuildRef(one,object->bounds,object->root);\n numInstancedPrimitives += mesh->size();\n }\n }\n });\n \n \/* creates all instances *\/\n parallel_for(size_t(0), N, [&] (const range<size_t>& r) {\n for (size_t objectID=r.begin(); objectID<r.end(); objectID++)\n {\n \/* ignore if no triangle mesh or not enabled *\/\n Geometry* geom = scene->get(objectID);\n if (geom->getType() != (Geometry::TRIANGLE_MESH | Geometry::INSTANCE))\n continue;\n \n GeometryInstance* instance = (GeometryInstance*) geom;\n if (!instance->isEnabled() || instance->numTimeSteps != 1) \n continue;\n \n BVH4* object = objects [objectID]; assert(object);\n \n \/* create build primitive *\/\n if (!object->bounds.empty()) {\n refs[nextRef++] = BVH4BuilderInstancing::BuildRef(instance->local2world,object->bounds,object->root);\n numInstancedPrimitives += instance->geom->size();\n }\n }\n });\n \n \/* fast path for single geometry scenes *\/\n \/*if (nextRef == 1) { \n bvh->set(refs[0].node,refs[0].bounds(),numPrimitives);\n return;\n }*\/\n \n \/* open all large nodes *\/\n refs.resize(nextRef);\n open(numPrimitives); \n \n \/* fast path for small geometries *\/\n \/*if (refs.size() == 1) { \n bvh->set(refs[0].node,refs[0].bounds(),numPrimitives);\n return;\n }*\/\n \n \/* compute PrimRefs *\/\n prims.resize(refs.size());\n const PrimInfo pinfo = parallel_reduce(size_t(0), refs.size(), size_t(1024), PrimInfo(empty), [&] (const range<size_t>& r) -> PrimInfo {\n PrimInfo pinfo(empty);\n for (size_t i=r.begin(); i<r.end(); i++) \n {\n const BBox3fa bounds = refs[i].worldBounds();\n pinfo.add(bounds);\n prims[i] = PrimRef(bounds,(size_t)&refs[i]);\n }\n return pinfo;\n }, [] (const PrimInfo& a, const PrimInfo& b) { return PrimInfo::merge(a,b); });\n \n \/* skip if all objects where empty *\/\n if (pinfo.size() == 0)\n bvh->set(BVH4::emptyNode,empty,0);\n \n \/* otherwise build toplevel hierarchy *\/\n else\n {\n BVH4::NodeRef root;\n BVHBuilderBinnedSAH::build<BVH4::NodeRef>\n (root,\n [&] { return bvh->alloc.threadLocal2(); },\n [&] (const isa::BVHBuilderBinnedSAH::BuildRecord& current, BVHBuilderBinnedSAH::BuildRecord* children, const size_t N, FastAllocator::ThreadLocal2* alloc) -> int\n {\n BVH4::Node* node = (BVH4::Node*) alloc->alloc0.malloc(sizeof(BVH4::Node)); node->clear();\n for (size_t i=0; i<N; i++) {\n node->set(i,children[i].pinfo.geomBounds);\n children[i].parent = (size_t*)&node->child(i);\n }\n *current.parent = bvh->encodeNode(node);\n return 0;\n },\n [&] (const BVHBuilderBinnedSAH::BuildRecord& current, FastAllocator::ThreadLocal2* alloc) -> int\n {\n assert(current.prims.size() == 1);\n BuildRef* ref = (BuildRef*) prims[current.prims.begin()].ID();\n BVH4::TransformNode* node = (BVH4::TransformNode*) alloc->alloc0.malloc(sizeof(BVH4::TransformNode)); \n new (node) BVH4::TransformNode(ref->local2world,ref->localBounds,ref->node); \/\/ FIXME: rcp should be precalculated somewhere\n *current.parent = BVH4::encodeNode(node);\n \/\/*current.parent = ref->node;\n ((BVH4::NodeRef*)current.parent)->setBarrier();\n return 1;\n },\n [&] (size_t dn) { bvh->scene->progressMonitor(0); },\n prims.data(),pinfo,BVH4::N,BVH4::maxBuildDepthLeaf,4,1,1,1.0f,1.0f);\n \n bvh->set(root,pinfo.geomBounds,numPrimitives);\n }\n \n bvh->root = collapse(bvh->root);\n \n bvh->alloc.cleanup();\n bvh->postBuild(t0);\n }\n \n void BVH4BuilderInstancing::clear()\n {\n for (size_t i=0; i<objects.size(); i++) \n if (objects[i]) objects[i]->clear();\n \n for (size_t i=0; i<builders.size(); i++) \n\tif (builders[i]) builders[i]->clear();\n \n refs.clear();\n }\n \n void set_primID(BVH4::NodeRef node, unsigned primID)\n {\n if (node.isLeaf())\n {\n size_t num;\n Triangle4* prims = (Triangle4*) node.leaf(num);\n for (size_t i=0; i<num; i++)\n for (size_t j=0; j<4; j++)\n if (prims[i].geomIDs[j] != -1) \n prims[i].primIDs[j] = primID;\n }\n else \n {\n BVH4::Node* n = node.node();\n for (size_t c=0; c<BVH4::N; c++)\n set_primID(n->child(c),primID);\n }\n }\n \n void BVH4BuilderInstancing::open(size_t numPrimitives)\n {\n if (refs.size() == 0)\n\treturn;\n \n \/\/size_t N = 0;\n \/\/size_t N = numInstancedPrimitives\/2000;\n size_t N = numInstancedPrimitives\/200;\n \/\/size_t N = numInstancedPrimitives;\n \n refs.reserve(N);\n \n std::make_heap(refs.begin(),refs.end());\n while (refs.size()+3 <= N)\n {\n std::pop_heap (refs.begin(),refs.end()); \n BVH4::NodeRef ref = refs.back().node;\n const AffineSpace3fa local2world = refs.back().local2world;\n if (ref.isLeaf()) break;\n refs.pop_back(); \n \n BVH4::Node* node = ref.node();\n for (size_t i=0; i<BVH4::N; i++) {\n if (node->child(i) == BVH4::emptyNode) continue;\n refs.push_back(BuildRef(local2world,node->bounds(i),node->child(i)));\n std::push_heap (refs.begin(),refs.end()); \n }\n }\n \n \/\/for (size_t i=0; i<refs.size(); i++)\n \/\/ set_primID((BVH4::NodeRef) refs[i].node, i);\n }\n \n BVH4::NodeRef BVH4BuilderInstancing::collapse(BVH4::NodeRef& node)\n {\n if (node.isBarrier()) {\n node.clearBarrier();\n return node;\n }\n \n assert(node.isNode());\n BVH4::Node* n = node.node();\n BVH4::TransformNode* first = nullptr;\n for (size_t c=0; c<BVH4::N; c++) {\n if (n->child(c) == BVH4::emptyNode) continue;\n BVH4::NodeRef child = n->child(c) = collapse(n->child(c));\n if (child.isTransformNode()) first = child.transformNode();\n }\n \n bool allEqual = true;\n for (size_t c=0; c<BVH4::N; c++) \n {\n BVH4::NodeRef child = n->child(c);\n if (child == BVH4::emptyNode) continue;\n \n if (!child.isTransformNode()) {\n allEqual = false;\n break;\n }\n \n if (child.transformNode()->world2local != first->world2local) {\n allEqual = false;\n break;\n }\n }\n \n if (!allEqual) \n return node;\n \n BBox3fa bounds = empty;\n for (size_t c=0; c<BVH4::N; c++) {\n if (n->child(c) == BVH4::emptyNode) continue;\n BVH4::TransformNode* child = n->child(c).transformNode();\n const BBox3fa cbounds = child->localBounds;\n n->set(c,cbounds,child->child);\n bounds.extend(cbounds);\n }\n first->localBounds = bounds;\n first->child = node;\n return BVH4::encodeNode(first);\n }\n \n Builder* BVH4BuilderInstancingSAH (void* bvh, Scene* scene, const createTriangleMeshAccelTy createTriangleMeshAccel) {\n return new BVH4BuilderInstancing((BVH4*)bvh,scene,createTriangleMeshAccel);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"RuntimeLibraryPch.h\"\n\n#include \"Library\/ForInObjectEnumerator.h\"\n\nnamespace Js\n{\n ForInObjectEnumerator::ShadowData::ShadowData(\n RecyclableObject * initObject,\n RecyclableObject * firstPrototype,\n Recycler * recycler)\n : currentObject(initObject),\n firstPrototype(firstPrototype),\n propertyIds(recycler)\n {\n }\n\n ForInObjectEnumerator::ForInObjectEnumerator(RecyclableObject* object, ScriptContext * scriptContext, bool enumSymbols)\n {\n Initialize(object, scriptContext, enumSymbols);\n }\n\n void ForInObjectEnumerator::Clear()\n {\n \/\/ Only clear stuff that are not useful for the next enumerator\n shadowData = nullptr;\n }\n\n void ForInObjectEnumerator::Initialize(RecyclableObject* initObject, ScriptContext * requestContext, bool enumSymbols, ForInCache * forInCache)\n {\n this->enumeratingPrototype = false;\n\n if (initObject == nullptr)\n {\n enumerator.Clear(EnumeratorFlags::None, requestContext);\n this->shadowData = nullptr;\n this->canUseJitFastPath = false;\n return;\n }\n\n Assert(JavascriptOperators::GetTypeId(initObject) != TypeIds_Null\n && JavascriptOperators::GetTypeId(initObject) != TypeIds_Undefined);\n\n EnumeratorFlags flags;\n RecyclableObject * firstPrototype = nullptr;\n RecyclableObject * firstPrototypeWithEnumerableProperties = GetFirstPrototypeWithEnumerableProperties(initObject, &firstPrototype);\n if (firstPrototypeWithEnumerableProperties != nullptr)\n {\n Recycler *recycler = requestContext->GetRecycler();\n this->shadowData = RecyclerNew(recycler, ShadowData, initObject, firstPrototype, recycler);\n flags = EnumeratorFlags::UseCache | EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::EnumNonEnumerable | (enumSymbols ? EnumeratorFlags::EnumSymbols : EnumeratorFlags::None);\n }\n \/\/ no enumerable properties in the prototype chain, no need to search it\n else\n {\n this->shadowData = nullptr;\n flags = EnumeratorFlags::UseCache | EnumeratorFlags::SnapShotSemantics | (enumSymbols ? EnumeratorFlags::EnumSymbols : EnumeratorFlags::None);\n }\n\n if (InitializeCurrentEnumerator(initObject, flags, requestContext, forInCache))\n {\n canUseJitFastPath = this->enumerator.CanUseJITFastPath();\n }\n else\n {\n \/\/ Nothing to enumerate.\n \/\/ We keep the shadowData so that it may walk up the prototype chain (e.g. primitive type)\n enumerator.Clear(flags, requestContext);\n canUseJitFastPath = false;\n }\n }\n\n RecyclableObject* ForInObjectEnumerator::GetFirstPrototypeWithEnumerableProperties(RecyclableObject* object, RecyclableObject** pFirstPrototype)\n {\n RecyclableObject* firstPrototype = nullptr;\n RecyclableObject* firstPrototypeWithEnumerableProperties = nullptr;\n\n if (JavascriptOperators::GetTypeId(object) != TypeIds_HostDispatch)\n {\n firstPrototypeWithEnumerableProperties = object;\n while (true)\n {\n firstPrototypeWithEnumerableProperties = firstPrototypeWithEnumerableProperties->GetPrototype();\n\n if (firstPrototypeWithEnumerableProperties == nullptr)\n {\n break;\n }\n\n if (JavascriptOperators::GetTypeId(firstPrototypeWithEnumerableProperties) == TypeIds_Null)\n {\n firstPrototypeWithEnumerableProperties = nullptr;\n break;\n }\n\n if (firstPrototype == nullptr)\n {\n firstPrototype = firstPrototypeWithEnumerableProperties;\n }\n\n if (!DynamicType::Is(firstPrototypeWithEnumerableProperties->GetTypeId())\n || !DynamicObject::FromVar(firstPrototypeWithEnumerableProperties)->GetHasNoEnumerableProperties())\n {\n break;\n }\n }\n }\n\n if (pFirstPrototype != nullptr)\n {\n *pFirstPrototype = firstPrototype;\n }\n\n return firstPrototypeWithEnumerableProperties;\n }\n\n BOOL ForInObjectEnumerator::InitializeCurrentEnumerator(RecyclableObject * object, ForInCache * forInCache)\n {\n EnumeratorFlags flags = enumerator.GetFlags();\n RecyclableObject * prototype = object->GetPrototype();\n if (prototype == nullptr || prototype->GetTypeId() == TypeIds_Null)\n {\n \/\/ If this is the last object on the prototype chain, we don't need to get the non-enumerable properties any more to track shadowing\n flags &= ~EnumeratorFlags::EnumNonEnumerable;\n }\n return InitializeCurrentEnumerator(object, flags, GetScriptContext(), forInCache);\n }\n\n BOOL ForInObjectEnumerator::InitializeCurrentEnumerator(RecyclableObject * object, EnumeratorFlags flags, ScriptContext * scriptContext, ForInCache * forInCache)\n {\n Assert(object);\n Assert(scriptContext);\n\n if (VirtualTableInfo<DynamicObject>::HasVirtualTable(object))\n {\n DynamicObject* dynamicObject = (DynamicObject*)object;\n return dynamicObject->DynamicObject::GetEnumerator(&enumerator, flags, scriptContext, forInCache);\n }\n\n return object->GetEnumerator(&enumerator, flags, scriptContext, forInCache);\n }\n\n BOOL ForInObjectEnumerator::TestAndSetEnumerated(PropertyId propertyId)\n {\n Assert(this->shadowData != nullptr);\n Assert(!Js::IsInternalPropertyId(propertyId));\n\n return !(this->shadowData->propertyIds.TestAndSet(propertyId));\n }\n\n Var ForInObjectEnumerator::MoveAndGetNext(PropertyId& propertyId)\n { \n PropertyRecord const * propRecord;\n PropertyAttributes attributes = PropertyNone;\n\n while (true)\n {\n propertyId = Constants::NoProperty;\n Var currentIndex = enumerator.MoveAndGetNext(propertyId, &attributes);\n\n \/\/ The object type may have changed and we may not be able to use fast path anymore.\n this->canUseJitFastPath = enumerator.CanUseJITFastPath();\n\n if (currentIndex)\n {\n if (this->shadowData == nullptr)\n {\n \/\/ There are no prototype that has enumerable properties,\n \/\/ don't need to keep track of the propertyIds we visited.\n\n \/\/ We have asked for enumerable properties only, so don't need to check the attribute returned.\n Assert(attributes & PropertyEnumerable);\n\n return currentIndex;\n }\n\n \/\/ Property Id does not exist.\n if (propertyId == Constants::NoProperty)\n {\n if (!JavascriptString::Is(currentIndex)) \/\/This can be undefined\n {\n continue;\n }\n JavascriptString *pString = JavascriptString::FromVar(currentIndex);\n if (VirtualTableInfo<Js::PropertyString>::HasVirtualTable(pString))\n {\n \/\/ If we have a property string, it is assumed that the propertyId is being\n \/\/ kept alive with the object\n PropertyString * propertyString = (PropertyString *)pString;\n propertyId = propertyString->GetPropertyRecord()->GetPropertyId();\n }\n else\n {\n ScriptContext* scriptContext = pString->GetScriptContext();\n scriptContext->GetOrAddPropertyRecord(pString->GetString(), pString->GetLength(), &propRecord);\n propertyId = propRecord->GetPropertyId();\n\n \/\/ We keep the track of what is enumerated using a bit vector of propertyID.\n \/\/ so the propertyId can't be collected until the end of the for in enumerator\n \/\/ Keep a list of the property string.\n this->shadowData->newPropertyStrings.Prepend(GetScriptContext()->GetRecycler(), propRecord);\n }\n }\n\n if (TestAndSetEnumerated(propertyId) \/\/checks if the property is already enumerated or not\n && (attributes & PropertyEnumerable))\n {\n return currentIndex;\n }\n }\n else\n {\n if (this->shadowData == nullptr)\n {\n Assert(!this->enumeratingPrototype);\n return nullptr;\n }\n\n RecyclableObject * object;\n if (!this->enumeratingPrototype)\n { \n this->enumeratingPrototype = true;\n object = this->shadowData->firstPrototype;\n this->shadowData->currentObject = object;\n }\n else\n {\n \/\/walk the prototype chain\n object = this->shadowData->currentObject->GetPrototype();\n this->shadowData->currentObject = object;\n if ((object == nullptr) || (JavascriptOperators::GetTypeId(object) == TypeIds_Null))\n {\n return nullptr;\n }\n }\n\n do\n {\n if (!InitializeCurrentEnumerator(object))\n {\n return nullptr;\n }\n\n if (!enumerator.IsNullEnumerator())\n {\n break;\n }\n\n \/\/walk the prototype chain\n object = object->GetPrototype();\n this->shadowData->currentObject = object;\n if ((object == nullptr) || (JavascriptOperators::GetTypeId(object) == TypeIds_Null))\n {\n return nullptr;\n }\n }\n while (true);\n }\n }\n }\n}\n<commit_msg>AND canUseJitFastPath with previous value so that if it is already false we don’t call CanUseJITFastPath function<commit_after>\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"RuntimeLibraryPch.h\"\n\n#include \"Library\/ForInObjectEnumerator.h\"\n\nnamespace Js\n{\n ForInObjectEnumerator::ShadowData::ShadowData(\n RecyclableObject * initObject,\n RecyclableObject * firstPrototype,\n Recycler * recycler)\n : currentObject(initObject),\n firstPrototype(firstPrototype),\n propertyIds(recycler)\n {\n }\n\n ForInObjectEnumerator::ForInObjectEnumerator(RecyclableObject* object, ScriptContext * scriptContext, bool enumSymbols)\n {\n Initialize(object, scriptContext, enumSymbols);\n }\n\n void ForInObjectEnumerator::Clear()\n {\n \/\/ Only clear stuff that are not useful for the next enumerator\n shadowData = nullptr;\n }\n\n void ForInObjectEnumerator::Initialize(RecyclableObject* initObject, ScriptContext * requestContext, bool enumSymbols, ForInCache * forInCache)\n {\n this->enumeratingPrototype = false;\n\n if (initObject == nullptr)\n {\n enumerator.Clear(EnumeratorFlags::None, requestContext);\n this->shadowData = nullptr;\n this->canUseJitFastPath = false;\n return;\n }\n\n Assert(JavascriptOperators::GetTypeId(initObject) != TypeIds_Null\n && JavascriptOperators::GetTypeId(initObject) != TypeIds_Undefined);\n\n EnumeratorFlags flags;\n RecyclableObject * firstPrototype = nullptr;\n RecyclableObject * firstPrototypeWithEnumerableProperties = GetFirstPrototypeWithEnumerableProperties(initObject, &firstPrototype);\n if (firstPrototypeWithEnumerableProperties != nullptr)\n {\n Recycler *recycler = requestContext->GetRecycler();\n this->shadowData = RecyclerNew(recycler, ShadowData, initObject, firstPrototype, recycler);\n flags = EnumeratorFlags::UseCache | EnumeratorFlags::SnapShotSemantics | EnumeratorFlags::EnumNonEnumerable | (enumSymbols ? EnumeratorFlags::EnumSymbols : EnumeratorFlags::None);\n }\n \/\/ no enumerable properties in the prototype chain, no need to search it\n else\n {\n this->shadowData = nullptr;\n flags = EnumeratorFlags::UseCache | EnumeratorFlags::SnapShotSemantics | (enumSymbols ? EnumeratorFlags::EnumSymbols : EnumeratorFlags::None);\n }\n\n if (InitializeCurrentEnumerator(initObject, flags, requestContext, forInCache))\n {\n canUseJitFastPath = this->enumerator.CanUseJITFastPath();\n }\n else\n {\n \/\/ Nothing to enumerate.\n \/\/ We keep the shadowData so that it may walk up the prototype chain (e.g. primitive type)\n enumerator.Clear(flags, requestContext);\n canUseJitFastPath = false;\n }\n }\n\n RecyclableObject* ForInObjectEnumerator::GetFirstPrototypeWithEnumerableProperties(RecyclableObject* object, RecyclableObject** pFirstPrototype)\n {\n RecyclableObject* firstPrototype = nullptr;\n RecyclableObject* firstPrototypeWithEnumerableProperties = nullptr;\n\n if (JavascriptOperators::GetTypeId(object) != TypeIds_HostDispatch)\n {\n firstPrototypeWithEnumerableProperties = object;\n while (true)\n {\n firstPrototypeWithEnumerableProperties = firstPrototypeWithEnumerableProperties->GetPrototype();\n\n if (firstPrototypeWithEnumerableProperties == nullptr)\n {\n break;\n }\n\n if (JavascriptOperators::GetTypeId(firstPrototypeWithEnumerableProperties) == TypeIds_Null)\n {\n firstPrototypeWithEnumerableProperties = nullptr;\n break;\n }\n\n if (firstPrototype == nullptr)\n {\n firstPrototype = firstPrototypeWithEnumerableProperties;\n }\n\n if (!DynamicType::Is(firstPrototypeWithEnumerableProperties->GetTypeId())\n || !DynamicObject::FromVar(firstPrototypeWithEnumerableProperties)->GetHasNoEnumerableProperties())\n {\n break;\n }\n }\n }\n\n if (pFirstPrototype != nullptr)\n {\n *pFirstPrototype = firstPrototype;\n }\n\n return firstPrototypeWithEnumerableProperties;\n }\n\n BOOL ForInObjectEnumerator::InitializeCurrentEnumerator(RecyclableObject * object, ForInCache * forInCache)\n {\n EnumeratorFlags flags = enumerator.GetFlags();\n RecyclableObject * prototype = object->GetPrototype();\n if (prototype == nullptr || prototype->GetTypeId() == TypeIds_Null)\n {\n \/\/ If this is the last object on the prototype chain, we don't need to get the non-enumerable properties any more to track shadowing\n flags &= ~EnumeratorFlags::EnumNonEnumerable;\n }\n return InitializeCurrentEnumerator(object, flags, GetScriptContext(), forInCache);\n }\n\n BOOL ForInObjectEnumerator::InitializeCurrentEnumerator(RecyclableObject * object, EnumeratorFlags flags, ScriptContext * scriptContext, ForInCache * forInCache)\n {\n Assert(object);\n Assert(scriptContext);\n\n if (VirtualTableInfo<DynamicObject>::HasVirtualTable(object))\n {\n DynamicObject* dynamicObject = (DynamicObject*)object;\n return dynamicObject->DynamicObject::GetEnumerator(&enumerator, flags, scriptContext, forInCache);\n }\n\n return object->GetEnumerator(&enumerator, flags, scriptContext, forInCache);\n }\n\n BOOL ForInObjectEnumerator::TestAndSetEnumerated(PropertyId propertyId)\n {\n Assert(this->shadowData != nullptr);\n Assert(!Js::IsInternalPropertyId(propertyId));\n\n return !(this->shadowData->propertyIds.TestAndSet(propertyId));\n }\n\n Var ForInObjectEnumerator::MoveAndGetNext(PropertyId& propertyId)\n { \n PropertyRecord const * propRecord;\n PropertyAttributes attributes = PropertyNone;\n\n while (true)\n {\n propertyId = Constants::NoProperty;\n Var currentIndex = enumerator.MoveAndGetNext(propertyId, &attributes);\n\n \/\/ The object type may have changed and we may not be able to use Jit fast path anymore.\n \/\/ canUseJitFastPath is determined in ForInObjectEnumerator::Initialize, once we decide we can't use\n \/\/ Jit fast path we will never go back to use fast path so && with current value - if it's already\n \/\/ false we don't call CanUseJITFastPath()\n\n this->canUseJitFastPath = this->canUseJitFastPath && enumerator.CanUseJITFastPath();\n\n if (currentIndex)\n {\n if (this->shadowData == nullptr)\n {\n \/\/ There are no prototype that has enumerable properties,\n \/\/ don't need to keep track of the propertyIds we visited.\n\n \/\/ We have asked for enumerable properties only, so don't need to check the attribute returned.\n Assert(attributes & PropertyEnumerable);\n\n return currentIndex;\n }\n\n \/\/ Property Id does not exist.\n if (propertyId == Constants::NoProperty)\n {\n if (!JavascriptString::Is(currentIndex)) \/\/This can be undefined\n {\n continue;\n }\n JavascriptString *pString = JavascriptString::FromVar(currentIndex);\n if (VirtualTableInfo<Js::PropertyString>::HasVirtualTable(pString))\n {\n \/\/ If we have a property string, it is assumed that the propertyId is being\n \/\/ kept alive with the object\n PropertyString * propertyString = (PropertyString *)pString;\n propertyId = propertyString->GetPropertyRecord()->GetPropertyId();\n }\n else\n {\n ScriptContext* scriptContext = pString->GetScriptContext();\n scriptContext->GetOrAddPropertyRecord(pString->GetString(), pString->GetLength(), &propRecord);\n propertyId = propRecord->GetPropertyId();\n\n \/\/ We keep the track of what is enumerated using a bit vector of propertyID.\n \/\/ so the propertyId can't be collected until the end of the for in enumerator\n \/\/ Keep a list of the property string.\n this->shadowData->newPropertyStrings.Prepend(GetScriptContext()->GetRecycler(), propRecord);\n }\n }\n\n if (TestAndSetEnumerated(propertyId) \/\/checks if the property is already enumerated or not\n && (attributes & PropertyEnumerable))\n {\n return currentIndex;\n }\n }\n else\n {\n if (this->shadowData == nullptr)\n {\n Assert(!this->enumeratingPrototype);\n return nullptr;\n }\n\n RecyclableObject * object;\n if (!this->enumeratingPrototype)\n { \n this->enumeratingPrototype = true;\n object = this->shadowData->firstPrototype;\n this->shadowData->currentObject = object;\n }\n else\n {\n \/\/walk the prototype chain\n object = this->shadowData->currentObject->GetPrototype();\n this->shadowData->currentObject = object;\n if ((object == nullptr) || (JavascriptOperators::GetTypeId(object) == TypeIds_Null))\n {\n return nullptr;\n }\n }\n\n do\n {\n if (!InitializeCurrentEnumerator(object))\n {\n return nullptr;\n }\n\n if (!enumerator.IsNullEnumerator())\n {\n break;\n }\n\n \/\/walk the prototype chain\n object = object->GetPrototype();\n this->shadowData->currentObject = object;\n if ((object == nullptr) || (JavascriptOperators::GetTypeId(object) == TypeIds_Null))\n {\n return nullptr;\n }\n }\n while (true);\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/==- DebugCheckers.cpp - Debugging Checkers ---------------------*- C++ -*-==\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines checkers that display debugging information.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/Analysis\/Analyses\/Dominators.h\"\n#include \"clang\/Analysis\/Analyses\/LiveVariables.h\"\n#include \"clang\/Analysis\/CallGraph.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/AnalysisManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ExplodedGraph.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ExprEngine.h\"\n#include \"llvm\/Support\/Process.h\"\n\nusing namespace clang;\nusing namespace ento;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorsTreeDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass DominatorsTreeDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (AnalysisDeclContext *AC = mgr.getAnalysisDeclContext(D)) {\n DominatorTree dom;\n dom.buildDominatorTree(*AC);\n dom.dump();\n }\n }\n};\n}\n\nvoid ento::registerDominatorsTreeDumper(CheckerManager &mgr) {\n mgr.registerChecker<DominatorsTreeDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LiveVariablesDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass LiveVariablesDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (LiveVariables* L = mgr.getAnalysis<LiveVariables>(D)) {\n L->dumpBlockLiveness(mgr.getSourceManager());\n }\n }\n};\n}\n\nvoid ento::registerLiveVariablesDumper(CheckerManager &mgr) {\n mgr.registerChecker<LiveVariablesDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFGViewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFGViewer : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (CFG *cfg = mgr.getCFG(D)) {\n cfg->viewCFG(mgr.getLangOpts());\n }\n }\n};\n}\n\nvoid ento::registerCFGViewer(CheckerManager &mgr) {\n mgr.registerChecker<CFGViewer>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFGDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFGDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (CFG *cfg = mgr.getCFG(D)) {\n cfg->dump(mgr.getLangOpts(),\n llvm::sys::Process::StandardErrHasColors());\n }\n }\n};\n}\n\nvoid ento::registerCFGDumper(CheckerManager &mgr) {\n mgr.registerChecker<CFGDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CallGraphViewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CallGraphViewer : public Checker< check::ASTDecl<TranslationUnitDecl> > {\npublic:\n void checkASTDecl(const TranslationUnitDecl *TU, AnalysisManager& mgr,\n BugReporter &BR) const {\n CallGraph CG;\n CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));\n CG.viewGraph();\n }\n};\n}\n\nvoid ento::registerCallGraphViewer(CheckerManager &mgr) {\n mgr.registerChecker<CallGraphViewer>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CallGraphDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CallGraphDumper : public Checker< check::ASTDecl<TranslationUnitDecl> > {\npublic:\n void checkASTDecl(const TranslationUnitDecl *TU, AnalysisManager& mgr,\n BugReporter &BR) const {\n CallGraph CG;\n CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));\n CG.dump();\n }\n};\n}\n\nvoid ento::registerCallGraphDumper(CheckerManager &mgr) {\n mgr.registerChecker<CallGraphDumper>();\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ConfigDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass ConfigDumper : public Checker< check::EndOfTranslationUnit > {\n typedef AnalyzerOptions::ConfigTable Table;\n\n static int compareEntry(const void *LHS, const void *RHS) {\n return ((const Table::MapEntryTy *)LHS)->getKey().compare(\n ((const Table::MapEntryTy *)RHS)->getKey());\n }\n\npublic:\n void checkEndOfTranslationUnit(const TranslationUnitDecl *TU,\n AnalysisManager& mgr,\n BugReporter &BR) const {\n const Table &Config = mgr.options.Config;\n\n SmallVector<const Table::MapEntryTy *, 32> Keys;\n for (Table::const_iterator I = Config.begin(), E = Config.end(); I != E;\n ++I)\n Keys.push_back(&*I);\n llvm::array_pod_sort(Keys.begin(), Keys.end(), compareEntry);\n\n llvm::errs() << \"[config]\\n\";\n for (unsigned I = 0, E = Keys.size(); I != E; ++I)\n llvm::errs() << Keys[I]->getKey() << \" = \" << Keys[I]->second << '\\n';\n\n llvm::errs() << \"[stats]\\n\" << \"num-entries = \" << Keys.size() << '\\n';\n }\n};\n}\n\nvoid ento::registerConfigDumper(CheckerManager &mgr) {\n mgr.registerChecker<ConfigDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ExplodedGraph Viewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass ExplodedGraphViewer : public Checker< check::EndAnalysis > {\npublic:\n ExplodedGraphViewer() {}\n void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const {\n Eng.ViewGraph(0);\n }\n};\n\n}\n\nvoid ento::registerExplodedGraphViewer(CheckerManager &mgr) {\n mgr.registerChecker<ExplodedGraphViewer>();\n}\n<commit_msg>array_pod_sort loses some type safety, better use the right types.<commit_after>\/\/==- DebugCheckers.cpp - Debugging Checkers ---------------------*- C++ -*-==\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file defines checkers that display debugging information.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/Analysis\/Analyses\/Dominators.h\"\n#include \"clang\/Analysis\/Analyses\/LiveVariables.h\"\n#include \"clang\/Analysis\/CallGraph.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/AnalysisManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ExplodedGraph.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/ExprEngine.h\"\n#include \"llvm\/Support\/Process.h\"\n\nusing namespace clang;\nusing namespace ento;\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ DominatorsTreeDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass DominatorsTreeDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (AnalysisDeclContext *AC = mgr.getAnalysisDeclContext(D)) {\n DominatorTree dom;\n dom.buildDominatorTree(*AC);\n dom.dump();\n }\n }\n};\n}\n\nvoid ento::registerDominatorsTreeDumper(CheckerManager &mgr) {\n mgr.registerChecker<DominatorsTreeDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LiveVariablesDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass LiveVariablesDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (LiveVariables* L = mgr.getAnalysis<LiveVariables>(D)) {\n L->dumpBlockLiveness(mgr.getSourceManager());\n }\n }\n};\n}\n\nvoid ento::registerLiveVariablesDumper(CheckerManager &mgr) {\n mgr.registerChecker<LiveVariablesDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFGViewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFGViewer : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (CFG *cfg = mgr.getCFG(D)) {\n cfg->viewCFG(mgr.getLangOpts());\n }\n }\n};\n}\n\nvoid ento::registerCFGViewer(CheckerManager &mgr) {\n mgr.registerChecker<CFGViewer>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CFGDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CFGDumper : public Checker<check::ASTCodeBody> {\npublic:\n void checkASTCodeBody(const Decl *D, AnalysisManager& mgr,\n BugReporter &BR) const {\n if (CFG *cfg = mgr.getCFG(D)) {\n cfg->dump(mgr.getLangOpts(),\n llvm::sys::Process::StandardErrHasColors());\n }\n }\n};\n}\n\nvoid ento::registerCFGDumper(CheckerManager &mgr) {\n mgr.registerChecker<CFGDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CallGraphViewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CallGraphViewer : public Checker< check::ASTDecl<TranslationUnitDecl> > {\npublic:\n void checkASTDecl(const TranslationUnitDecl *TU, AnalysisManager& mgr,\n BugReporter &BR) const {\n CallGraph CG;\n CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));\n CG.viewGraph();\n }\n};\n}\n\nvoid ento::registerCallGraphViewer(CheckerManager &mgr) {\n mgr.registerChecker<CallGraphViewer>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ CallGraphDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass CallGraphDumper : public Checker< check::ASTDecl<TranslationUnitDecl> > {\npublic:\n void checkASTDecl(const TranslationUnitDecl *TU, AnalysisManager& mgr,\n BugReporter &BR) const {\n CallGraph CG;\n CG.addToCallGraph(const_cast<TranslationUnitDecl*>(TU));\n CG.dump();\n }\n};\n}\n\nvoid ento::registerCallGraphDumper(CheckerManager &mgr) {\n mgr.registerChecker<CallGraphDumper>();\n}\n\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ConfigDumper\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass ConfigDumper : public Checker< check::EndOfTranslationUnit > {\n typedef AnalyzerOptions::ConfigTable Table;\n\n static int compareEntry(const void *LHS, const void *RHS) {\n return (*(const Table::MapEntryTy **)LHS)->getKey().compare(\n (*(const Table::MapEntryTy **)RHS)->getKey());\n }\n\npublic:\n void checkEndOfTranslationUnit(const TranslationUnitDecl *TU,\n AnalysisManager& mgr,\n BugReporter &BR) const {\n const Table &Config = mgr.options.Config;\n\n SmallVector<const Table::MapEntryTy *, 32> Keys;\n for (Table::const_iterator I = Config.begin(), E = Config.end(); I != E;\n ++I)\n Keys.push_back(&*I);\n llvm::array_pod_sort(Keys.begin(), Keys.end(), compareEntry);\n\n llvm::errs() << \"[config]\\n\";\n for (unsigned I = 0, E = Keys.size(); I != E; ++I)\n llvm::errs() << Keys[I]->getKey() << \" = \" << Keys[I]->second << '\\n';\n\n llvm::errs() << \"[stats]\\n\" << \"num-entries = \" << Keys.size() << '\\n';\n }\n};\n}\n\nvoid ento::registerConfigDumper(CheckerManager &mgr) {\n mgr.registerChecker<ConfigDumper>();\n}\n\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/ ExplodedGraph Viewer\n\/\/===----------------------------------------------------------------------===\/\/\n\nnamespace {\nclass ExplodedGraphViewer : public Checker< check::EndAnalysis > {\npublic:\n ExplodedGraphViewer() {}\n void checkEndAnalysis(ExplodedGraph &G, BugReporter &B,ExprEngine &Eng) const {\n Eng.ViewGraph(0);\n }\n};\n\n}\n\nvoid ento::registerExplodedGraphViewer(CheckerManager &mgr) {\n mgr.registerChecker<ExplodedGraphViewer>();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/**\n * @file recraw-local.C\n * @brief Run reconstruction of raw data locally\n *\n * <pre>\n * Usage: aliroot -b -q -l \\\n * recraw-local.C'(\"file\", \"cdb\", minEvent, maxEvent, modules)'\n *\n * Examples:\n * recraw-local.C'(\"alien:\/\/\/alice\/data\/2009\/...\/....root\")' \n * recraw-local.C'(\"raw:\/\/run12345\")'\n * recraw-local.C'(\"raw:\/\/run12345\", minEvent, MaxEvent)'\n * recraw-local.C'(\"raw.root\", \"local:\/\/$PWD\", minEvent, MaxEvent)'\n *\n * Defaults\n * cdb=\"raw:\/\/\" -> take OCDB from GRID\n * minEvent=-1 -> no lower event selection\n * maxEvent=-1 -> no upper event selection\n * modules=\"ALL\" -> all modules\n * hltOption=\"loglevel=0x7c\" -> logging level info and above\n *\n * <\/pre>\n *\n * The input file can be a file on the grid, indicated by the tag\n * 'alien:\/\/' indicates. By default also the OCDB is set to the GRID.\n * If either the file or the OCDB is taken from the GRID, the macros\n * connects to the Grid in the beginning.\n *\n * Input files can be specified via te run number when using the tag\n * 'raw:\/\/' followed by the string 'run12345' where the number needs\n * to be adjusted.\n *\n * As for the OCDB it is always a good idea to use the OCDB from the\n * Grid as this will contain all the necessary objects and the latest\n * calibration. The special URI 'raw:\/\/' is most advisable as it selects\n * the storage automatically from the run number. Other options are e.g.\n * - \"alien:\/\/folder=\/alice\/data\/2010\/OCDB\"\n * - \"local:\/\/$ALICE_ROOT\/OCDB\"\n *\n * Re-running the HLT reconstruction\n * By specifying the hlt options, the HLT chain can be re-run instead\n * of just extracting the online result. E.g. the following options\n * specify to ignore the HLTOUT payload and run the two chains defined\n * in the agents. The translation of the online configuration into\n * an HLT offline chain is under development.\n * <pre>\n * ignore-hltout chains=GLOBAL-esd-converter,TPC-clusters\n * <pre>\n *\n * Note: You need a valid GRID token, use 'alien-token-init' of your\n * alien installation.\n *\n * @author Matthias.Richter@ift.uib.no\n * @ingroup alihlt_qa\n *\/\nvoid recraw_local(const char *filename,\n\t\t const char *cdbURI,\n\t\t int minEvent=-1,\n\t\t int maxEvent=-1,\n\t\t const char *modules=\"ALL\",\n\t\t const char *hltOptions=\"loglevel=0x7c\")\n{\n \/\/ connect to the GRID if we use a file or OCDB from the GRID\n TString struri=cdbURI;\n TString strfile=filename;\n if (struri.BeginsWith(\"raw:\/\/\") ||\n strfile.Contains(\":\/\/\") && !strfile.Contains(\"local:\/\/\")) {\n TGrid::Connect(\"alien\");\n }\n\n \/\/ Set the CDB storage location\n AliCDBManager * man = AliCDBManager::Instance();\n man->SetDefaultStorage(cdbURI);\n\n \/\/ Reconstruction settings\n AliReconstruction rec;\n\n if (minEvent>=0 || maxEvent>minEvent) {\n if (minEvent<0) minEvent=0;\n if (maxEvent<minEvent) maxEvent=minEvent;\n rec.SetEventRange(minEvent,maxEvent);\n }\n\n TString strModules=modules;\n if (modules)\n rec.SetRunReconstruction(modules);\n else\n rec.SetRunReconstruction(\"ALL\");\n\n \/\/ QA options\n TString qaOptions=\"HLT TPC\";\n if (!strModules.Contains(\"TPC\")) qaOptions.ReplaceAll(\"TPC\", \"\");\n qaOptions+=\":ALL\";\n rec.SetRunQA(qaOptions) ;\n \/\/rec.SetQARefDefaultStorage(\"local:\/\/$ALICE_ROOT\/QAref\") ;\n\n \/\/ AliReconstruction settings\n rec.SetWriteESDfriend(kTRUE);\n rec.SetRunVertexFinder(strModules.Contains(\"ITS\"));\n rec.SetInput(filename);\n rec.SetOption(\"HLT\", hltOptions);\n\n rec.SetRunPlaneEff(kFALSE);\n\n \/\/ switch off cleanESD\n rec.SetCleanESD(kFALSE);\n\n AliLog::Flush();\n rec.Run();\n\n}\n\nvoid recraw_local(const char *filename,\n\t\t int minEvent=-1,\n\t\t int maxEvent=-1,\n\t\t const char *modules=\"ALL\",\n\t\t const char *hltOptions=\"loglevel=0x7f\")\n{\n recraw_local(filename, \"raw:\/\/\", minEvent, maxEvent, modules, hltOptions);\n}\n\nvoid recraw_local()\n{\n cout << \"recraw-local: Run AliRoot reconstruction locally\" << endl;\n cout << \" Usage: aliroot -b -q -l \\\\\" << endl;\n cout << \" recraw-local.C'(\\\"file\\\", \\\"cdb\\\", minEvent, maxEvent, modules, hltOptions)'\" << endl;\n cout << \"\" << endl;\n cout << \" Examples:\" << endl;\n cout << \" recraw-local.C'(\\\"alien:\/\/\/alice\/data\/2009\/...\/....root\\\")' \" << endl;\n cout << \" recraw-local.C'(\\\"raw:\/\/run12345\\\")'\" << endl;\n cout << \" recraw-local.C'(\\\"raw:\/\/run12345\\\", minEvent, MaxEvent)'\" << endl;\n cout << \" recraw-local.C'(\\\"raw.root\\\", \\\"local:\/\/$PWD\\\", minEvent, MaxEvent)'\" << endl;\n cout << \"\" << endl;\n cout << \" Defaults\" << endl;\n cout << \" cdb=\\\"raw:\/\/\\\" -> take OCDB from GRID\" << endl;\n cout << \" minEvent=-1 -> no lower event selection\" << endl;\n cout << \" maxEvent=-1 -> no upper event selection\" << endl;\n cout << \" modules=\\\"ALL\\\" -> all modules\" << endl;\n cout << \" hltOption=\\\"loglevel=0x7c\\\" -> logging level info and above\" << endl;\n}\n<commit_msg>handle the case of simulated raw data by checking for the GRP in the working directory when using a local OCDB<commit_after>\/\/ $Id$\n\/**\n * @file recraw-local.C\n * @brief Run reconstruction of raw data locally\n *\n * <pre>\n * Usage: aliroot -b -q -l \\\n * recraw-local.C'(\"file\", \"cdb\", minEvent, maxEvent, modules)'\n *\n * Examples:\n * recraw-local.C'(\"alien:\/\/\/alice\/data\/2009\/...\/....root\")' \n * recraw-local.C'(\"raw:\/\/run12345\")'\n * recraw-local.C'(\"raw:\/\/run12345\", minEvent, MaxEvent)'\n * recraw-local.C'(\"raw.root\", \"local:\/\/$PWD\", minEvent, MaxEvent)'\n *\n * Defaults\n * cdb=\"raw:\/\/\" -> take OCDB from GRID\n * minEvent=-1 -> no lower event selection\n * maxEvent=-1 -> no upper event selection\n * modules=\"ALL\" -> all modules\n * hltOption=\"loglevel=0x7c\" -> logging level info and above\n *\n * <\/pre>\n *\n * The input file can be a file on the grid, indicated by the tag\n * 'alien:\/\/' indicates. By default also the OCDB is set to the GRID.\n * If either the file or the OCDB is taken from the GRID, the macros\n * connects to the Grid in the beginning.\n *\n * Input files can be specified via te run number when using the tag\n * 'raw:\/\/' followed by the string 'run12345' where the number needs\n * to be adjusted.\n *\n * As for the OCDB it is always a good idea to use the OCDB from the\n * Grid as this will contain all the necessary objects and the latest\n * calibration. The special URI 'raw:\/\/' is most advisable as it selects\n * the storage automatically from the run number. Other options are e.g.\n * - \"alien:\/\/folder=\/alice\/data\/2010\/OCDB\"\n * - \"local:\/\/$ALICE_ROOT\/OCDB\"\n *\n * Re-running the HLT reconstruction\n * By specifying the hlt options, the HLT chain can be re-run instead\n * of just extracting the online result. E.g. the following options\n * specify to ignore the HLTOUT payload and run the two chains defined\n * in the agents. The translation of the online configuration into\n * an HLT offline chain is under development.\n * <pre>\n * ignore-hltout chains=GLOBAL-esd-converter,TPC-clusters\n * <pre>\n *\n * Note: You need a valid GRID token, use 'alien-token-init' of your\n * alien installation.\n *\n * @author Matthias.Richter@ift.uib.no\n * @ingroup alihlt_qa\n *\/\nvoid recraw_local(const char *filename,\n\t\t const char *cdbURI,\n\t\t int minEvent=-1,\n\t\t int maxEvent=-1,\n\t\t const char *modules=\"ALL\",\n\t\t const char *hltOptions=\"loglevel=0x7c\")\n{\n \/\/ connect to the GRID if we use a file or OCDB from the GRID\n TString struri=cdbURI;\n TString strfile=filename;\n if (struri.BeginsWith(\"raw:\/\/\") ||\n strfile.Contains(\":\/\/\") && !strfile.Contains(\"local:\/\/\")) {\n TGrid::Connect(\"alien\");\n }\n\n \/\/ Set the CDB storage location\n AliCDBManager * man = AliCDBManager::Instance();\n man->SetDefaultStorage(cdbURI);\n if (struri.BeginsWith(\"local:\/\/\")) {\n \/\/ set specific storage for GRP entry\n \/\/ search in the working directory and one level above, the latter\n \/\/ follows the standard simulation setup like e.g. in test\/ppbench\n if (!gSystem->AccessPathName(\"GRP\/GRP\/Data\")) {\n man->SetSpecificStorage(\"GRP\/GRP\/Data\", \"local:\/\/$PWD\");\n } else if (!gSystem->AccessPathName(\"..\/GRP\/GRP\/Data\")) {\n man->SetSpecificStorage(\"GRP\/GRP\/Data\", \"local:\/\/$PWD\/..\"); \n }\n }\n\n \/\/ Reconstruction settings\n AliReconstruction rec;\n\n if (minEvent>=0 || maxEvent>minEvent) {\n if (minEvent<0) minEvent=0;\n if (maxEvent<minEvent) maxEvent=minEvent;\n rec.SetEventRange(minEvent,maxEvent);\n }\n\n TString strModules=modules;\n if (modules)\n rec.SetRunReconstruction(modules);\n else\n rec.SetRunReconstruction(\"ALL\");\n\n \/\/ QA options\n TString qaOptions=\"HLT TPC\";\n if (!strModules.Contains(\"TPC\")) qaOptions.ReplaceAll(\"TPC\", \"\");\n qaOptions+=\":ALL\";\n rec.SetRunQA(qaOptions) ;\n \/\/rec.SetQARefDefaultStorage(\"local:\/\/$ALICE_ROOT\/QAref\") ;\n\n \/\/ AliReconstruction settings\n rec.SetWriteESDfriend(kTRUE);\n rec.SetRunVertexFinder(strModules.Contains(\"ITS\"));\n rec.SetInput(filename);\n rec.SetOption(\"HLT\", hltOptions);\n\n rec.SetRunPlaneEff(kFALSE);\n\n \/\/ switch off cleanESD\n rec.SetCleanESD(kFALSE);\n\n AliLog::Flush();\n rec.Run();\n\n}\n\nvoid recraw_local(const char *filename,\n\t\t int minEvent=-1,\n\t\t int maxEvent=-1,\n\t\t const char *modules=\"ALL\",\n\t\t const char *hltOptions=\"loglevel=0x7f\")\n{\n recraw_local(filename, \"raw:\/\/\", minEvent, maxEvent, modules, hltOptions);\n}\n\nvoid recraw_local()\n{\n cout << \"recraw-local: Run AliRoot reconstruction locally\" << endl;\n cout << \" Usage: aliroot -b -q -l \\\\\" << endl;\n cout << \" recraw-local.C'(\\\"file\\\", \\\"cdb\\\", minEvent, maxEvent, modules, hltOptions)'\" << endl;\n cout << \"\" << endl;\n cout << \" Examples:\" << endl;\n cout << \" recraw-local.C'(\\\"alien:\/\/\/alice\/data\/2009\/...\/....root\\\")' \" << endl;\n cout << \" recraw-local.C'(\\\"raw:\/\/run12345\\\")'\" << endl;\n cout << \" recraw-local.C'(\\\"raw:\/\/run12345\\\", minEvent, MaxEvent)'\" << endl;\n cout << \" recraw-local.C'(\\\"raw.root\\\", \\\"local:\/\/$PWD\\\", minEvent, MaxEvent)'\" << endl;\n cout << \"\" << endl;\n cout << \" Defaults\" << endl;\n cout << \" cdb=\\\"raw:\/\/\\\" -> take OCDB from GRID\" << endl;\n cout << \" minEvent=-1 -> no lower event selection\" << endl;\n cout << \" maxEvent=-1 -> no upper event selection\" << endl;\n cout << \" modules=\\\"ALL\\\" -> all modules\" << endl;\n cout << \" hltOption=\\\"loglevel=0x7c\\\" -> logging level info and above\" << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2011-2014, Intel Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"XmlStringDocSink.h\"\n#include <libxml\/parser.h>\n\n#define base CXmlDocSink\n\nCXmlStringDocSink::CXmlStringDocSink(std::string& strResult):\n _strResult(strResult)\n{\n}\n\nbool CXmlStringDocSink::doProcess(CXmlDocSource& xmlDocSource,\n CXmlSerializingContext& serializingContext)\n{\n (void)serializingContext;\n\n xmlChar* pcDumpedDoc = NULL;\n\n int iSize;\n xmlDocDumpFormatMemoryEnc(xmlDocSource.getDoc(), &pcDumpedDoc, &iSize, \"UTF-8\", 1);\n\n if (!pcDumpedDoc) {\n\n return false;\n }\n\n _strResult.append((const char*)pcDumpedDoc);\n\n xmlFree(pcDumpedDoc);\n\n return true;\n}\n<commit_msg>Missing error reporting statement in XML Export feature<commit_after>\/*\n * Copyright (c) 2011-2014, Intel Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n#include \"XmlStringDocSink.h\"\n#include <libxml\/parser.h>\n\n#define base CXmlDocSink\n\nCXmlStringDocSink::CXmlStringDocSink(std::string& strResult):\n _strResult(strResult)\n{\n}\n\nbool CXmlStringDocSink::doProcess(CXmlDocSource& xmlDocSource,\n CXmlSerializingContext& serializingContext)\n{\n (void)serializingContext;\n\n xmlChar* pcDumpedDoc = NULL;\n\n int iSize;\n xmlDocDumpFormatMemoryEnc(xmlDocSource.getDoc(), &pcDumpedDoc, &iSize, \"UTF-8\", 1);\n\n if (!pcDumpedDoc) {\n\n serializingContext.setError(\"Unable to encode XML document in memory\");\n\n return false;\n }\n\n _strResult.append((const char*)pcDumpedDoc);\n\n xmlFree(pcDumpedDoc);\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <jwt.h>\n\n#include <Poco\/Error.h>\n#include <Poco\/Exception.h>\n#include <Poco\/Logger.h>\n#include <Poco\/JSON\/Array.h>\n#include <Poco\/JSON\/Parser.h>\n\n#include \"di\/Injectable.h\"\n#include \"jwt\/JWTDecoder.h\"\n#include \"model\/TokenID.h\"\n#include \"util\/JsonUtil.h\"\n\nusing namespace BeeeOn;\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::JSON;\n\nBEEEON_OBJECT_BEGIN(BeeeOn, JWTDecoder)\nBEEEON_OBJECT_TEXT(\"secret\", &JWTDecoder::setSecret)\nBEEEON_OBJECT_END(BeeeOn, JWTDecoder)\n\nJWTDecoder::JWTDecoder()\n{\n}\n\nJWTDecoder::~JWTDecoder()\n{\n}\n\nstatic vector<string> deserializeArray(const string &arr)\n{\n\tvector<string> deserialized;\n\tParser parser;\n\n\tArray::Ptr array = parser.parse(arr).extract<Array::Ptr>();\n\n\tfor (size_t i = 0; i < array->size(); i++)\n\t\tdeserialized.push_back(array->getElement<string>(i));\n\n\treturn deserialized;\n}\n\nstatic void fillTokenWithData(JWToken &token, jwt_t *tokenData)\n{\n\tconst char *claim = ::jwt_get_grant(tokenData, \"iss\");\n\tif (claim != NULL)\n\t\ttoken.setIssuer(string(claim));\n\telse\n\t\ttoken.setIssuer(\"\");\n\n\tclaim = ::jwt_get_grant(tokenData, \"sub\");\n\tif (claim != NULL)\n\t\ttoken.setSubject(string(claim));\n\telse\n\t\ttoken.setSubject(\"\");\n\n\tchar *jsonClaim = ::jwt_get_grants_json(tokenData, \"aud\");\n\tif (jsonClaim != NULL) {\n\t\ttry {\n\t\t\ttoken.setAudience(deserializeArray(jsonClaim));\n\t\t} catch (...) {\n\t\t\t::free(jsonClaim);\n\t\t\tthrow;\n\t\t}\n\n\t\t::free(jsonClaim);\n\t}\n\n\tclaim = ::jwt_get_grant(tokenData, \"locale\");\n\tif (claim != NULL)\n\t\ttoken.setLocale(string(claim));\n\telse\n\t\ttoken.setLocale(\"\");\n\n\tlong timeRaw = ::jwt_get_grant_int(tokenData, \"exp\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setExpirationTime(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setExpirationTime(Nullable<Timestamp>());\n\n\ttimeRaw = ::jwt_get_grant_int(tokenData, \"iat\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setIssuedAt(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setIssuedAt(Nullable<Timestamp>());\n\n\ttimeRaw = ::jwt_get_grant_int(tokenData, \"nbf\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setNotBefore(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setNotBefore(Nullable<Timestamp>());\n}\n\nJWToken JWTDecoder::decode(const TokenID &tokenId) const\n{\n\tJWToken token;\n\tconst string &tokenID = tokenId.toString();\n\n\tconst unsigned char *secret;\n\n\tif (m_secret.empty())\n\t\tsecret = NULL;\n\telse\n\t\tsecret = reinterpret_cast<const unsigned char *>(m_secret.c_str());\n\n\tconst size_t secretLen = m_secret.length();\n\n\tjwt_t *tokenData;\n\tconst int err = ::jwt_decode(&tokenData, tokenID.c_str(), secret, secretLen);\n\tif (err != 0)\n\t\tthrow InvalidArgumentException(\"jwt decode: \" + Error::getMessage(err));\n\n\ttry {\n\t\tfillTokenWithData(token, tokenData);\n\t} catch (...) {\n\t\t::jwt_free(tokenData);\n\t\tthrow;\n\t}\n\n\t::jwt_free(tokenData);\n\n\treturn token;\n}\n\nvoid JWTDecoder::setSecret(const string &secret)\n{\n\tm_secret = secret;\n}\n<commit_msg>JWTDecoder: convert JSONException to SyntaxException<commit_after>#include <cstdlib>\n#include <jwt.h>\n\n#include <Poco\/Error.h>\n#include <Poco\/Exception.h>\n#include <Poco\/Logger.h>\n#include <Poco\/JSON\/Array.h>\n#include <Poco\/JSON\/JSONException.h>\n#include <Poco\/JSON\/Parser.h>\n\n#include \"di\/Injectable.h\"\n#include \"jwt\/JWTDecoder.h\"\n#include \"model\/TokenID.h\"\n#include \"util\/JsonUtil.h\"\n\nusing namespace BeeeOn;\nusing namespace std;\nusing namespace Poco;\nusing namespace Poco::JSON;\n\nBEEEON_OBJECT_BEGIN(BeeeOn, JWTDecoder)\nBEEEON_OBJECT_TEXT(\"secret\", &JWTDecoder::setSecret)\nBEEEON_OBJECT_END(BeeeOn, JWTDecoder)\n\nJWTDecoder::JWTDecoder()\n{\n}\n\nJWTDecoder::~JWTDecoder()\n{\n}\n\nstatic vector<string> deserializeArray(const string &arr)\n{\n\tvector<string> deserialized;\n\tParser parser;\n\n\ttry {\n\t\tArray::Ptr array = parser.parse(arr).extract<Array::Ptr>();\n\n\t\tfor (size_t i = 0; i < array->size(); i++)\n\t\t\tdeserialized.push_back(array->getElement<string>(i));\n\n\t\treturn deserialized;\n\t}\n\tcatch (const JSONException &e) {\n\t\tthrow SyntaxException(\"failed to parse array\", e);\n\t}\n}\n\nstatic void fillTokenWithData(JWToken &token, jwt_t *tokenData)\n{\n\tconst char *claim = ::jwt_get_grant(tokenData, \"iss\");\n\tif (claim != NULL)\n\t\ttoken.setIssuer(string(claim));\n\telse\n\t\ttoken.setIssuer(\"\");\n\n\tclaim = ::jwt_get_grant(tokenData, \"sub\");\n\tif (claim != NULL)\n\t\ttoken.setSubject(string(claim));\n\telse\n\t\ttoken.setSubject(\"\");\n\n\tchar *jsonClaim = ::jwt_get_grants_json(tokenData, \"aud\");\n\tif (jsonClaim != NULL) {\n\t\ttry {\n\t\t\ttoken.setAudience(deserializeArray(jsonClaim));\n\t\t} catch (...) {\n\t\t\t::free(jsonClaim);\n\t\t\tthrow;\n\t\t}\n\n\t\t::free(jsonClaim);\n\t}\n\n\tclaim = ::jwt_get_grant(tokenData, \"locale\");\n\tif (claim != NULL)\n\t\ttoken.setLocale(string(claim));\n\telse\n\t\ttoken.setLocale(\"\");\n\n\tlong timeRaw = ::jwt_get_grant_int(tokenData, \"exp\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setExpirationTime(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setExpirationTime(Nullable<Timestamp>());\n\n\ttimeRaw = ::jwt_get_grant_int(tokenData, \"iat\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setIssuedAt(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setIssuedAt(Nullable<Timestamp>());\n\n\ttimeRaw = ::jwt_get_grant_int(tokenData, \"nbf\");\n\tif (Error::last() != ENOENT)\n\t\ttoken.setNotBefore(Timestamp::fromEpochTime(timeRaw));\n\telse\n\t\ttoken.setNotBefore(Nullable<Timestamp>());\n}\n\nJWToken JWTDecoder::decode(const TokenID &tokenId) const\n{\n\tJWToken token;\n\tconst string &tokenID = tokenId.toString();\n\n\tconst unsigned char *secret;\n\n\tif (m_secret.empty())\n\t\tsecret = NULL;\n\telse\n\t\tsecret = reinterpret_cast<const unsigned char *>(m_secret.c_str());\n\n\tconst size_t secretLen = m_secret.length();\n\n\tjwt_t *tokenData;\n\tconst int err = ::jwt_decode(&tokenData, tokenID.c_str(), secret, secretLen);\n\tif (err != 0)\n\t\tthrow InvalidArgumentException(\"jwt decode: \" + Error::getMessage(err));\n\n\ttry {\n\t\tfillTokenWithData(token, tokenData);\n\t} catch (...) {\n\t\t::jwt_free(tokenData);\n\t\tthrow;\n\t}\n\n\t::jwt_free(tokenData);\n\n\treturn token;\n}\n\nvoid JWTDecoder::setSecret(const string &secret)\n{\n\tm_secret = secret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************\nCopyright (c) 2016-2017 Grégoire Angerand\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n**********************************\/\n\n#include \"Barrier.h\"\n\nnamespace yave {\n\n#if 0\nstatic VkAccessFlags vk_layout_access_flags(VkImageLayout layout) {\n switch(layout) {\n case VK_IMAGE_LAYOUT_UNDEFINED:\n return 0;\n\n case VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL:\n return VK_ACCESS_COLOR_ATTACHMENT_READ_BIT | VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL:\n return VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT | VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_DEPTH_STENCIL_READ_ONLY_OPTIMAL:\n return VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT;\n\n case VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL:\n return VK_ACCESS_SHADER_READ_BIT;\n\n case VK_IMAGE_LAYOUT_TRANSFER_SRC_OPTIMAL:\n return VK_ACCESS_TRANSFER_READ_BIT;\n\n case VK_IMAGE_LAYOUT_TRANSFER_DST_OPTIMAL:\n return VK_ACCESS_TRANSFER_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_PRESENT_SRC_KHR:\n return VK_ACCESS_MEMORY_READ_BIT;\n\n case VK_IMAGE_LAYOUT_GENERAL:\n \/\/ assume storage image\n return \/\/VK_ACCESS_MEMORY_READ_BIT | VK_ACCESS_MEMORY_WRITE_BIT |\n VK_ACCESS_SHADER_READ_BIT | VK_ACCESS_SHADER_WRITE_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsupported layout transition\");\n}\n\nstatic VkAccessFlags vk_dst_access_flags(PipelineStage dst) {\n if((dst & PipelineStage::AllShadersBit) != PipelineStage::None) {\n return VK_ACCESS_SHADER_READ_BIT;\n }\n switch(dst) {\n case PipelineStage::TransferBit:\n return VK_ACCESS_TRANSFER_READ_BIT;\n\n case PipelineStage::HostBit:\n return VK_ACCESS_HOST_READ_BIT;\n\n case PipelineStage::BeginOfPipe:\n case PipelineStage::EndOfPipe:\n return VK_ACCESS_MEMORY_READ_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsuported pipeline stage\");\n}\n\nstatic VkAccessFlags vk_src_access_flags(PipelineStage src) {\n if((src & PipelineStage::AllShadersBit) != PipelineStage::None) {\n return VK_ACCESS_SHADER_WRITE_BIT;\n }\n switch(src) {\n case PipelineStage::TransferBit:\n return VK_ACCESS_TRANSFER_WRITE_BIT;\n\n case PipelineStage::HostBit:\n return VK_ACCESS_HOST_WRITE_BIT;\n\n case PipelineStage::ColorAttachmentOutBit:\n return VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n\n case PipelineStage::BeginOfPipe:\n case PipelineStage::EndOfPipe:\n return VK_ACCESS_MEMORY_WRITE_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsuported pipeline stage\");\n}\n\nstatic VkPipelineStageFlags vk_barrier_stage(VkAccessFlags access) {\n if(access == 0 || access == VK_ACCESS_MEMORY_READ_BIT) {\n return VK_PIPELINE_STAGE_HOST_BIT;\n }\n if(access & (VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT | VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_EARLY_FRAGMENT_TESTS_BIT |\n VK_PIPELINE_STAGE_LATE_FRAGMENT_TESTS_BIT;\n }\n if(access & (VK_ACCESS_COLOR_ATTACHMENT_READ_BIT | VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_COLOR_ATTACHMENT_OUTPUT_BIT;\n }\n if(access & (VK_ACCESS_TRANSFER_READ_BIT | VK_ACCESS_TRANSFER_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_TRANSFER_BIT;\n }\n if(access & (VK_ACCESS_SHADER_READ_BIT | VK_ACCESS_SHADER_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_VERTEX_SHADER_BIT |\n VK_PIPELINE_STAGE_FRAGMENT_SHADER_BIT |\n VK_PIPELINE_STAGE_COMPUTE_SHADER_BIT;\n }\n\n y_fatal(\"Unknown access flags\");\n}\n#else\nstatic VkAccessFlags vk_layout_access_flags(VkImageLayout) {\n return VK_ACCESS_MEMORY_READ_BIT | VK_ACCESS_MEMORY_WRITE_BIT;\n}\n\nstatic VkAccessFlags vk_dst_access_flags(PipelineStage) {\n return VK_ACCESS_MEMORY_READ_BIT;\n}\n\nstatic VkAccessFlags vk_src_access_flags(PipelineStage) {\n return VK_ACCESS_MEMORY_WRITE_BIT;\n}\n \nstatic PipelineStage vk_src_barrier_stage(VkAccessFlags) {\n return PipelineStage::EndOfPipe;\n}\n\nstatic PipelineStage vk_dst_barrier_stage(VkAccessFlags) {\n return PipelineStage::EndOfPipe;\n}\n#endif\n\n\n\n\nstatic VkImageMemoryBarrier create_barrier(VkImage image, ImageFormat format, usize layers, usize mips, VkImageLayout old_layout, VkImageLayout new_layout) {\n VkImageMemoryBarrier barrier = vk_struct();\n {\n barrier.oldLayout = old_layout;\n barrier.newLayout = new_layout;\n barrier.srcAccessMask = vk_layout_access_flags(old_layout);\n barrier.dstAccessMask = vk_layout_access_flags(new_layout);\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.image = image;\n\n barrier.subresourceRange.aspectMask = format.vk_aspect();\n barrier.subresourceRange.layerCount = layers;\n barrier.subresourceRange.levelCount = mips;\n }\n return barrier;\n}\n\n\nstatic VkImageMemoryBarrier create_barrier(VkImage image, ImageFormat format, usize layers, usize mips, ImageUsage usage, PipelineStage src, PipelineStage dst) {\n VkImageMemoryBarrier barrier = vk_struct();\n {\n const VkImageLayout layout = vk_image_layout(usage);\n\n barrier.oldLayout = layout;\n barrier.newLayout = layout;\n barrier.srcAccessMask = vk_src_access_flags(src);\n barrier.dstAccessMask = vk_dst_access_flags(dst);\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.image = image;\n\n barrier.subresourceRange.aspectMask = format.vk_aspect();\n barrier.subresourceRange.layerCount = layers;\n barrier.subresourceRange.levelCount = mips;\n }\n return barrier;\n}\n\nstatic VkBufferMemoryBarrier create_barrier(VkBuffer buffer, usize size, usize offset, PipelineStage src, PipelineStage dst) {\n VkBufferMemoryBarrier barrier = vk_struct();\n {\n Y_TODO(uniform buffers needs to use VK_ACCESS_UNIFORM_READ_BIT)\n barrier.srcAccessMask = vk_src_access_flags(src);\n barrier.dstAccessMask = vk_dst_access_flags(dst);\n barrier.buffer = buffer;\n barrier.size = size;\n barrier.offset = offset;\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n }\n return barrier;\n}\n\n\nImageBarrier::ImageBarrier(const ImageBase& image, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(image.vk_image(), image.format(), image.layers(), image.mipmaps(), image.usage(), src, dst)),\n _src(src), _dst(dst) {\n}\n\nImageBarrier ImageBarrier::transition_barrier(const ImageBase& image, VkImageLayout src_layout, VkImageLayout dst_layout) {\n ImageBarrier barrier;\n barrier._barrier = create_barrier(image.vk_image(), image.format(), image.layers(), image.mipmaps(), src_layout, dst_layout);\n barrier._src = vk_src_barrier_stage(barrier._barrier.srcAccessMask);\n barrier._dst = vk_dst_barrier_stage(barrier._barrier.dstAccessMask);\n\n return barrier;\n}\n\nImageBarrier ImageBarrier::transition_to_barrier(const ImageBase& image, VkImageLayout dst_layout) {\n return transition_barrier(image, vk_image_layout(image.usage()), dst_layout);\n}\n\nImageBarrier ImageBarrier::transition_from_barrier(const ImageBase& image, VkImageLayout src_layout) {\n return transition_barrier(image, src_layout, vk_image_layout(image.usage()));\n}\n\nVkImageMemoryBarrier ImageBarrier::vk_barrier() const {\n return _barrier;\n}\n\nPipelineStage ImageBarrier::dst_stage() const {\n return _dst;\n}\n\nPipelineStage ImageBarrier::src_stage() const {\n return _src;\n}\n\n\n\nBufferBarrier::BufferBarrier(const BufferBase& buffer, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(buffer.vk_buffer(), buffer.byte_size(), 0, src, dst)),\n _src(src), _dst(dst) {\n}\n\nBufferBarrier::BufferBarrier(const SubBufferBase& buffer, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(buffer.vk_buffer(), buffer.byte_size(), buffer.byte_offset(), src, dst)),\n _src(src), _dst(dst) {\n}\n\nVkBufferMemoryBarrier BufferBarrier::vk_barrier() const {\n return _barrier;\n}\n\nPipelineStage BufferBarrier::dst_stage() const {\n return _dst;\n}\n\nPipelineStage BufferBarrier::src_stage() const {\n return _src;\n}\n\n\n}\n\n<commit_msg>Fixed over conservatives pipelines barriers<commit_after>\/*******************************\nCopyright (c) 2016-2017 Grégoire Angerand\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n**********************************\/\n\n#include \"Barrier.h\"\n\nnamespace yave {\n\n\nstatic VkAccessFlags vk_layout_access_flags(VkImageLayout layout) {\n switch(layout) {\n case VK_IMAGE_LAYOUT_UNDEFINED:\n return 0;\n\n case VK_IMAGE_LAYOUT_COLOR_ATTACHMENT_OPTIMAL:\n return VK_ACCESS_COLOR_ATTACHMENT_READ_BIT | VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_DEPTH_STENCIL_ATTACHMENT_OPTIMAL:\n return VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT | VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_DEPTH_STENCIL_READ_ONLY_OPTIMAL:\n return VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT;\n\n case VK_IMAGE_LAYOUT_SHADER_READ_ONLY_OPTIMAL:\n return VK_ACCESS_SHADER_READ_BIT;\n\n case VK_IMAGE_LAYOUT_TRANSFER_SRC_OPTIMAL:\n return VK_ACCESS_TRANSFER_READ_BIT;\n\n case VK_IMAGE_LAYOUT_TRANSFER_DST_OPTIMAL:\n return VK_ACCESS_TRANSFER_WRITE_BIT;\n\n case VK_IMAGE_LAYOUT_PRESENT_SRC_KHR:\n return VK_ACCESS_MEMORY_READ_BIT;\n\n case VK_IMAGE_LAYOUT_GENERAL:\n \/\/ assume storage image\n return \/\/VK_ACCESS_MEMORY_READ_BIT | VK_ACCESS_MEMORY_WRITE_BIT |\n VK_ACCESS_SHADER_READ_BIT | VK_ACCESS_SHADER_WRITE_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsupported layout transition\");\n}\n\nstatic VkAccessFlags vk_dst_access_flags(PipelineStage dst) {\n if((dst & PipelineStage::AllShadersBit) != PipelineStage::None) {\n return VK_ACCESS_SHADER_READ_BIT;\n }\n switch(dst) {\n case PipelineStage::TransferBit:\n return VK_ACCESS_TRANSFER_READ_BIT;\n\n case PipelineStage::HostBit:\n return VK_ACCESS_HOST_READ_BIT;\n\n case PipelineStage::BeginOfPipe:\n case PipelineStage::EndOfPipe:\n return VK_ACCESS_MEMORY_READ_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsuported pipeline stage\");\n}\n\nstatic VkAccessFlags vk_src_access_flags(PipelineStage src) {\n if((src & PipelineStage::AllShadersBit) != PipelineStage::None) {\n return VK_ACCESS_SHADER_WRITE_BIT;\n }\n switch(src) {\n case PipelineStage::TransferBit:\n return VK_ACCESS_TRANSFER_WRITE_BIT;\n\n case PipelineStage::HostBit:\n return VK_ACCESS_HOST_WRITE_BIT;\n\n case PipelineStage::ColorAttachmentOutBit:\n return VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT;\n\n case PipelineStage::BeginOfPipe:\n case PipelineStage::EndOfPipe:\n return VK_ACCESS_MEMORY_WRITE_BIT;\n\n default:\n break;\n }\n\n y_fatal(\"Unsuported pipeline stage\");\n}\n\nstatic VkPipelineStageFlags vk_barrier_stage(VkAccessFlags access) {\n if(access == 0 || access == VK_ACCESS_MEMORY_READ_BIT) {\n return VK_PIPELINE_STAGE_HOST_BIT;\n }\n if(access & (VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_READ_BIT | VK_ACCESS_DEPTH_STENCIL_ATTACHMENT_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_EARLY_FRAGMENT_TESTS_BIT |\n VK_PIPELINE_STAGE_LATE_FRAGMENT_TESTS_BIT;\n }\n if(access & (VK_ACCESS_COLOR_ATTACHMENT_READ_BIT | VK_ACCESS_COLOR_ATTACHMENT_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_COLOR_ATTACHMENT_OUTPUT_BIT;\n }\n if(access & (VK_ACCESS_TRANSFER_READ_BIT | VK_ACCESS_TRANSFER_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_TRANSFER_BIT;\n }\n if(access & (VK_ACCESS_SHADER_READ_BIT | VK_ACCESS_SHADER_WRITE_BIT)) {\n return VK_PIPELINE_STAGE_VERTEX_SHADER_BIT |\n VK_PIPELINE_STAGE_FRAGMENT_SHADER_BIT |\n VK_PIPELINE_STAGE_COMPUTE_SHADER_BIT;\n }\n\n y_fatal(\"Unknown access flags\");\n}\n\n\nstatic PipelineStage vk_src_barrier_stage(VkAccessFlags access) {\n return PipelineStage(vk_barrier_stage(access));\n}\n\nstatic PipelineStage vk_dst_barrier_stage(VkAccessFlags access) {\n return PipelineStage(vk_barrier_stage(access));\n}\n\n\n\n\nstatic VkImageMemoryBarrier create_barrier(VkImage image, ImageFormat format, usize layers, usize mips, VkImageLayout old_layout, VkImageLayout new_layout) {\n VkImageMemoryBarrier barrier = vk_struct();\n {\n barrier.oldLayout = old_layout;\n barrier.newLayout = new_layout;\n barrier.srcAccessMask = vk_layout_access_flags(old_layout);\n barrier.dstAccessMask = vk_layout_access_flags(new_layout);\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.image = image;\n\n barrier.subresourceRange.aspectMask = format.vk_aspect();\n barrier.subresourceRange.layerCount = layers;\n barrier.subresourceRange.levelCount = mips;\n }\n return barrier;\n}\n\n\nstatic VkImageMemoryBarrier create_barrier(VkImage image, ImageFormat format, usize layers, usize mips, ImageUsage usage, PipelineStage src, PipelineStage dst) {\n VkImageMemoryBarrier barrier = vk_struct();\n {\n const VkImageLayout layout = vk_image_layout(usage);\n\n barrier.oldLayout = layout;\n barrier.newLayout = layout;\n barrier.srcAccessMask = vk_src_access_flags(src);\n barrier.dstAccessMask = vk_dst_access_flags(dst);\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.image = image;\n\n barrier.subresourceRange.aspectMask = format.vk_aspect();\n barrier.subresourceRange.layerCount = layers;\n barrier.subresourceRange.levelCount = mips;\n }\n return barrier;\n}\n\nstatic VkBufferMemoryBarrier create_barrier(VkBuffer buffer, usize size, usize offset, PipelineStage src, PipelineStage dst) {\n VkBufferMemoryBarrier barrier = vk_struct();\n {\n Y_TODO(uniform buffers needs to use VK_ACCESS_UNIFORM_READ_BIT)\n barrier.srcAccessMask = vk_src_access_flags(src);\n barrier.dstAccessMask = vk_dst_access_flags(dst);\n barrier.buffer = buffer;\n barrier.size = size;\n barrier.offset = offset;\n barrier.srcQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n barrier.dstQueueFamilyIndex = VK_QUEUE_FAMILY_IGNORED;\n }\n return barrier;\n}\n\n\nImageBarrier::ImageBarrier(const ImageBase& image, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(image.vk_image(), image.format(), image.layers(), image.mipmaps(), image.usage(), src, dst)),\n _src(src), _dst(dst) {\n}\n\nImageBarrier ImageBarrier::transition_barrier(const ImageBase& image, VkImageLayout src_layout, VkImageLayout dst_layout) {\n ImageBarrier barrier;\n barrier._barrier = create_barrier(image.vk_image(), image.format(), image.layers(), image.mipmaps(), src_layout, dst_layout);\n barrier._src = vk_src_barrier_stage(barrier._barrier.srcAccessMask);\n barrier._dst = vk_dst_barrier_stage(barrier._barrier.dstAccessMask);\n\n return barrier;\n}\n\nImageBarrier ImageBarrier::transition_to_barrier(const ImageBase& image, VkImageLayout dst_layout) {\n return transition_barrier(image, vk_image_layout(image.usage()), dst_layout);\n}\n\nImageBarrier ImageBarrier::transition_from_barrier(const ImageBase& image, VkImageLayout src_layout) {\n return transition_barrier(image, src_layout, vk_image_layout(image.usage()));\n}\n\nVkImageMemoryBarrier ImageBarrier::vk_barrier() const {\n return _barrier;\n}\n\nPipelineStage ImageBarrier::dst_stage() const {\n return _dst;\n}\n\nPipelineStage ImageBarrier::src_stage() const {\n return _src;\n}\n\n\n\nBufferBarrier::BufferBarrier(const BufferBase& buffer, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(buffer.vk_buffer(), buffer.byte_size(), 0, src, dst)),\n _src(src), _dst(dst) {\n}\n\nBufferBarrier::BufferBarrier(const SubBufferBase& buffer, PipelineStage src, PipelineStage dst) :\n _barrier(create_barrier(buffer.vk_buffer(), buffer.byte_size(), buffer.byte_offset(), src, dst)),\n _src(src), _dst(dst) {\n}\n\nVkBufferMemoryBarrier BufferBarrier::vk_barrier() const {\n return _barrier;\n}\n\nPipelineStage BufferBarrier::dst_stage() const {\n return _dst;\n}\n\nPipelineStage BufferBarrier::src_stage() const {\n return _src;\n}\n\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Enable or disable event processing.\n *\n * @param[in] in Set to true to enable input event processing.\n * @param[in] out Set to true to enable output event processing.\n *\/\nvoid stream::process(bool in, bool out) {\n _process_in = in;\n _process_out = out;\n return ;\n}\n\n\/**\n * Read data from the socket.\n *\n * @param[out] d Data read.\n *\/\nvoid stream::read(misc::shared_ptr<io::data>& d) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n bool ret;\n while (1) {\n if (!_process_in\n || (!(ret = _socket->waitForReadyRead(\n (_timeout == -1)\n ? 200\n : _timeout))\n \/\/ Standalone socket.\n && ((_timeout != -1)\n \/\/ Disconnected socket with no data.\n || ((_socket->state()\n == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0)))))\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data.staticCast<io::data>();\n return ;\n}\n\n\/**\n * Set connection timeout.\n *\n * @param[in] msecs Timeout in ms.\n *\/\nvoid stream::set_timeout(int msecs) {\n _timeout = msecs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\/\nvoid stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Raw type.\n static QString const raw_type(\"com::centreon::broker::io::raw\");\n\n \/\/ Check that data exists and should be processed.\n if (!_process_out)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (d.isNull())\n return ;\n\n if (d->type() == raw_type) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if (wb < 0)\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n _socket->waitForBytesWritten(-1);\n }\n return ;\n}\n\n\/**************************************\n* *\n* Private Methods *\n* *\n**************************************\/\n\n\/**\n * @brief Copy constructor.\n *\n * Any call to this constructor will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n assert(!\"TCP stream is not copyable\");\n abort();\n}\n\n\/**\n * @brief Assignment operator.\n *\n * Any call to this method will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\n * @return This object.\n *\/\nstream& stream::operator=(stream const& s) {\n (void)s;\n assert(!\"TCP stream is not copyable\");\n abort();\n return (*this);\n}\n<commit_msg>Improved TCP stream.<commit_after>\/*\n** Copyright 2011-2012 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cassert>\n#include <cstdlib>\n#include <QMutexLocker>\n#include <QWaitCondition>\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/io\/exceptions\/shutdown.hh\"\n#include \"com\/centreon\/broker\/io\/raw.hh\"\n#include \"com\/centreon\/broker\/tcp\/stream.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::tcp;\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n *\/\nstream::stream(misc::shared_ptr<QTcpSocket> sock)\n : _mutex(new QMutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Constructor.\n *\n * @param[in] sock Socket used by this stream.\n * @param[in] mutex Mutex used by this stream.\n *\/\nstream::stream(\n misc::shared_ptr<QTcpSocket> sock,\n misc::shared_ptr<QMutex> mutex)\n : _mutex(mutex),\n _process_in(true),\n _process_out(true),\n _socket(sock),\n _timeout(-1) {}\n\n\/**\n * Destructor.\n *\/\nstream::~stream() {\n QMutexLocker lock(&*_mutex);\n if (!_socket.isNull())\n _socket->close();\n}\n\n\/**\n * Enable or disable event processing.\n *\n * @param[in] in Set to true to enable input event processing.\n * @param[in] out Set to true to enable output event processing.\n *\/\nvoid stream::process(bool in, bool out) {\n _process_in = in;\n _process_out = out;\n return ;\n}\n\n\/**\n * Read data from the socket.\n *\n * @param[out] d Data read.\n *\/\nvoid stream::read(misc::shared_ptr<io::data>& d) {\n d.clear();\n QMutexLocker lock(&*_mutex);\n bool ret;\n while (1) {\n if (!_process_in)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (!(ret = _socket->waitForReadyRead(\n (_timeout == -1)\n ? 200\n : _timeout))\n \/\/ Standalone socket.\n && ((_timeout != -1)\n \/\/ Disconnected socket with no data.\n || ((_socket->state()\n == QAbstractSocket::UnconnectedState)\n && (_socket->bytesAvailable() <= 0))))\n throw (exceptions::msg() << \"TCP stream is disconnected\");\n if (ret\n || (_socket->error() != QAbstractSocket::SocketTimeoutError)\n || (_socket->bytesAvailable() > 0))\n break ;\n else {\n QWaitCondition cv;\n cv.wait(&*_mutex, 1);\n }\n }\n\n char buffer[2048];\n qint64 rb(_socket->read(buffer, sizeof(buffer)));\n if (rb < 0)\n throw (exceptions::msg() << \"TCP: error while reading: \"\n << _socket->errorString());\n misc::shared_ptr<io::raw> data(new io::raw);\n#if QT_VERSION >= 0x040500\n data->append(buffer, rb);\n#else\n data->append(QByteArray(buffer, rb));\n#endif \/\/ Qt version\n d = data.staticCast<io::data>();\n return ;\n}\n\n\/**\n * Set connection timeout.\n *\n * @param[in] msecs Timeout in ms.\n *\/\nvoid stream::set_timeout(int msecs) {\n _timeout = msecs;\n return ;\n}\n\n\/**\n * Write data to the socket.\n *\n * @param[in] d Data to write.\n *\/\nvoid stream::write(misc::shared_ptr<io::data> const& d) {\n \/\/ Raw type.\n static QString const raw_type(\"com::centreon::broker::io::raw\");\n\n \/\/ Check that data exists and should be processed.\n if (!_process_out)\n throw (io::exceptions::shutdown(!_process_in, !_process_out)\n << \"TCP stream is shutdown\");\n if (d.isNull())\n return ;\n\n if (d->type() == raw_type) {\n misc::shared_ptr<io::raw> r(d.staticCast<io::raw>());\n QMutexLocker lock(&*_mutex);\n qint64 wb(_socket->write(static_cast<char*>(r->QByteArray::data()),\n r->size()));\n if (wb < 0)\n throw (exceptions::msg() << \"TCP: error while writing: \"\n << _socket->errorString());\n _socket->waitForBytesWritten(-1);\n }\n return ;\n}\n\n\/**************************************\n* *\n* Private Methods *\n* *\n**************************************\/\n\n\/**\n * @brief Copy constructor.\n *\n * Any call to this constructor will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\/\nstream::stream(stream const& s) : io::stream(s) {\n assert(!\"TCP stream is not copyable\");\n abort();\n}\n\n\/**\n * @brief Assignment operator.\n *\n * Any call to this method will result in a call to abort().\n *\n * @param[in] s Object to copy.\n *\n * @return This object.\n *\/\nstream& stream::operator=(stream const& s) {\n (void)s;\n assert(!\"TCP stream is not copyable\");\n abort();\n return (*this);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Session.h\"\n\n#include <fstream>\n#include <string>\n#include <iomanip>\n\n#include <SmurffCpp\/Version.h>\n\n#include <SmurffCpp\/Utils\/omp_util.h>\n#include <SmurffCpp\/Utils\/Distribution.h>\n#include <SmurffCpp\/Utils\/MatrixUtils.h>\n#include <SmurffCpp\/Utils\/counters.h>\n#include <SmurffCpp\/Utils\/Error.h>\n\n#include <SmurffCpp\/DataMatrices\/DataCreator.h>\n#include <SmurffCpp\/Priors\/PriorFactory.h>\n\n#include <SmurffCpp\/result.h>\n#include <SmurffCpp\/StatusItem.h>\n\nusing namespace smurff;\n\nvoid Session::setRestoreFromRootPath(std::string rootPath)\n{\n \/\/ open root file\n m_rootFile = std::make_shared<RootFile>(rootPath);\n\n \/\/restore config\n m_rootFile->restoreConfig(m_config);\n\n m_config.validate();\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setRestoreFromConfig(const Config& cfg, std::string rootPath)\n{\n cfg.validate();\n\n \/\/ assign config\n m_config = cfg;\n\n \/\/ open root file\n m_rootFile = std::make_shared<RootFile>(rootPath);\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setCreateFromConfig(const Config& cfg)\n{\n cfg.validate();\n\n \/\/ assign config\n m_config = cfg;\n\n if (m_config.getSaveFreq() || m_config.getCheckpointFreq())\n {\n\n \/\/ create root file\n m_rootFile = std::make_shared<RootFile>(m_config.getSavePrefix(), m_config.getSaveExtension());\n\n \/\/save config\n m_rootFile->saveConfig(m_config);\n\n \/\/flush record about options.ini\n m_rootFile->flushLast();\n }\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setFromBase()\n{\n std::shared_ptr<Session> this_session = shared_from_this();\n\n \/\/ initialize pred\n\n if (m_config.getClassify())\n m_pred->setThreshold(m_config.getThreshold());\n\n if (m_config.getTest())\n m_pred->set(m_config.getTest());\n\n \/\/ initialize data\n\n data_ptr = m_config.getTrain()->create(std::make_shared<DataCreator>(this_session));\n\n \/\/ initialize priors\n\n std::shared_ptr<IPriorFactory> priorFactory = this->create_prior_factory();\n for (std::size_t i = 0; i < m_config.getPriorTypes().size(); i++)\n this->addPrior(priorFactory->create_prior(this_session, i));\n}\n\nvoid Session::init()\n{\n \/\/init omp\n threads_init(m_config.getVerbose());\n\n \/\/initialize random generator\n initRng();\n\n \/\/initialize train matrix (centring and noise model)\n data().init();\n\n \/\/initialize model (samples)\n model().init(m_config.getNumLatent(), data().dim(), m_config.getModelInitType());\n\n \/\/initialize priors\n for(auto &p : m_priors)\n p->init();\n\n \/\/write header to status file\n if (m_config.getCsvStatus().size())\n {\n auto f = std::ofstream(m_config.getCsvStatus(), std::ofstream::out);\n THROWERROR_ASSERT_MSG(f, \"Could not open status csv file: \" + m_config.getCsvStatus());\n f << StatusItem::getCsvHeader() << std::endl;\n }\n\n \/\/write info to console\n if (m_config.getVerbose())\n info(std::cout, \"\");\n\n \/\/restore session (model, priors)\n bool resume = restore(m_iter);\n\n \/\/print session status to console\n if (m_config.getVerbose())\n {\n printStatus(std::cout, resume);\n }\n\n is_init = true;\n}\n\nvoid Session::run()\n{\n init();\n while (step());\n}\n\nbool Session::step()\n{\n THROWERROR_ASSERT_MSG(is_init, \"Session::init() needs to be called before ::step()\")\n\n \/\/ go to the next iteration\n m_iter++;\n\n bool isStep = m_iter < m_config.getBurnin() + m_config.getNSamples();\n\n if (isStep)\n {\n \/\/init omp\n threads_enable(m_config.getVerbose());\n\n THROWERROR_ASSERT(is_init);\n\n auto starti = tick();\n BaseSession::step();\n auto endi = tick();\n\n \/\/WARNING: update is an expensive operation because of sort (when calculating AUC)\n m_pred->update(m_model, m_iter < m_config.getBurnin());\n\n m_secs_per_iter = endi - starti;\n\n printStatus(std::cout);\n\n save(m_iter);\n\n threads_disable(m_config.getVerbose());\n }\n\n return isStep;\n}\n\nstd::ostream& Session::info(std::ostream &os, std::string indent)\n{\n os << indent << name << \" {\\n\";\n\n BaseSession::info(os, indent);\n\n os << indent << \" Version: \" << smurff::SMURFF_VERSION << \"\\n\" ;\n os << indent << \" Iterations: \" << m_config.getBurnin() << \" burnin + \" << m_config.getNSamples() << \" samples\\n\";\n\n if (m_config.getSaveFreq() != 0 || m_config.getCheckpointFreq() != 0)\n {\n if (m_config.getSaveFreq() > 0)\n {\n os << indent << \" Save model: every \" << m_config.getSaveFreq() << \" iteration\\n\";\n }\n else if (m_config.getSaveFreq() < 0)\n {\n os << indent << \" Save model after last iteration\\n\";\n }\n\n if (m_config.getCheckpointFreq() > 0)\n {\n os << indent << \" Checkpoint state: every \" << m_config.getCheckpointFreq() << \" seconds\\n\";\n }\n\n os << indent << \" Save prefix: \" << m_config.getSavePrefix() << \"\\n\";\n os << indent << \" Save extension: \" << m_config.getSaveExtension() << \"\\n\";\n }\n else\n {\n os << indent << \" Save model: never\\n\";\n }\n\n os << indent << \"}\\n\";\n return os;\n}\n\nvoid Session::save(int iteration)\n{\n \/\/do not save if 'never save' mode is selected\n if (!m_config.getSaveFreq() && \n !m_config.getCheckpointFreq() &&\n !m_config.getCsvStatus().size())\n return;\n\n std::int32_t isample = iteration - m_config.getBurnin() + 1;\n\n \/\/save if checkpoint threshold overdue\n if (m_config.getCheckpointFreq() && (tick() - m_lastCheckpointTime) >= m_config.getCheckpointFreq())\n {\n std::int32_t icheckpoint = iteration + 1;\n\n \/\/save this iteration\n std::shared_ptr<StepFile> stepFile = m_rootFile->createCheckpointStepFile(icheckpoint);\n saveInternal(stepFile);\n\n \/\/remove previous iteration if required (initial m_lastCheckpointIter is -1 which means that it does not exist)\n if (m_lastCheckpointIter >= 0)\n {\n std::int32_t icheckpointPrev = m_lastCheckpointIter + 1;\n\n \/\/remove previous iteration\n m_rootFile->removeCheckpointStepFile(icheckpointPrev);\n\n \/\/flush last item in a root file\n m_rootFile->flushLast();\n }\n\n \/\/upddate counters\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n } \n\n \/\/save model during sampling stage\n if (m_config.getSaveFreq() && isample > 0)\n {\n \/\/save_freq > 0: check modulo - do not save if not a save iteration\n if (m_config.getSaveFreq() > 0 && (isample % m_config.getSaveFreq()) != 0)\n {\n \/\/ don't save\n }\n \/\/save_freq < 0: save last iter - do not save if (final model) mode is selected and not a final iteration\n else if (m_config.getSaveFreq() < 0 && isample < m_config.getNSamples())\n {\n \/\/ don't save\n }\n else\n {\n \/\/do save this iteration\n std::shared_ptr<StepFile> stepFile = m_rootFile->createSampleStepFile(isample);\n saveInternal(stepFile);\n }\n }\n}\n\nvoid Session::saveInternal(std::shared_ptr<StepFile> stepFile)\n{\n if (m_config.getVerbose())\n {\n std::cout << \"-- Saving model, predictions,... into '\" << stepFile->getStepFileName() << \"'.\" << std::endl;\n }\n\n BaseSession::save(stepFile);\n\n \/\/flush last item in a root file\n m_rootFile->flushLast();\n}\n\nbool Session::restore(int& iteration)\n{\n std::shared_ptr<StepFile> stepFile = nullptr;\n if (m_rootFile)\n {\n stepFile = m_rootFile->openLastStepFile();\n }\n\n if (!stepFile)\n {\n \/\/if there is nothing to restore - start from initial iteration\n iteration = -1;\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = -1;\n return false;\n }\n else\n {\n if (m_config.getVerbose())\n {\n std::cout << \"-- Restoring model, predictions,... from '\" << stepFile->getStepFileName() << \"'.\" << std::endl;\n }\n\n BaseSession::restore(stepFile);\n\n \/\/restore last iteration index\n if (stepFile->getCheckpoint())\n {\n iteration = stepFile->getIsample() - 1; \/\/restore original state\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n }\n else\n {\n iteration = stepFile->getIsample() + m_config.getBurnin() - 1; \/\/restore original state\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n }\n\n return true;\n }\n}\n\nstd::shared_ptr<StatusItem> Session::getStatus() const\n{\n std::shared_ptr<StatusItem> ret = std::make_shared<StatusItem>();\n\n if (m_iter < 0)\n {\n ret->phase = \"Initial\";\n ret->iter = m_iter + 1;\n ret->phase_iter = 0;\n }\n else if (m_iter < m_config.getBurnin())\n {\n ret->phase = \"Burnin\";\n ret->iter = m_iter + 1;\n ret->phase_iter = m_config.getBurnin();\n }\n else\n {\n ret->phase = \"Sample\";\n ret->iter = m_iter - m_config.getBurnin() + 1;\n ret->phase_iter = m_config.getNSamples();\n }\n\n for (int i = 0; i < model().nmodes(); ++i)\n {\n ret->model_norms.push_back(model().U(i).norm());\n }\n\n ret->train_rmse = data().train_rmse(model());\n\n ret->rmse_avg = m_pred->rmse_avg;\n ret->rmse_1sample = m_pred->rmse_1sample;\n\n ret->auc_avg = m_pred->auc_avg;\n ret->auc_1sample = m_pred->auc_1sample;\n\n ret->elapsed_iter = m_secs_per_iter;\n ret->nnz_per_sec = (double)(data().nnz()) \/ m_secs_per_iter;\n ret->samples_per_sec = (double)(model().nsamples()) \/ m_secs_per_iter;\n\n return ret;\n}\n\nvoid Session::printStatus(std::ostream& output, bool resume)\n{\n if(!m_config.getVerbose() &&\n !m_config.getCsvStatus().size())\n return;\n\n auto status_item = getStatus();\n\n std::string resumeString = resume ? \"Continue from \" : std::string();\n\n if (m_config.getVerbose() > 0)\n {\n if (m_iter < 0)\n {\n output << \" ====== Initial phase ====== \" << std::endl;\n }\n else if (m_iter < m_config.getBurnin() && m_iter == 0)\n {\n output << \" ====== Sampling (burning phase) ====== \" << std::endl;\n }\n else if (m_iter == m_config.getBurnin())\n {\n output << \" ====== Burn-in complete, averaging samples ====== \" << std::endl;\n }\n\n output << resumeString\n << status_item->phase\n << \" \"\n << std::setfill(' ') << std::setw(3) << status_item->iter\n << \"\/\"\n << std::setfill(' ') << std::setw(3) << status_item->phase_iter\n << \": RMSE: \"\n << std::fixed << std::setprecision(4) << status_item->rmse_avg\n << \" (1samp: \"\n << std::fixed << std::setprecision(4) << status_item->rmse_1sample\n << \")\";\n\n if (m_config.getClassify())\n {\n output << \" AUC:\"\n << std::fixed << std::setprecision(4) << status_item->auc_avg\n << \" (1samp: \"\n << std::fixed << std::setprecision(4) << status_item->auc_1sample\n << \")\"\n << std::endl;\n }\n\n output << \" U:[\";\n for(double n: status_item->model_norms)\n {\n output << std::scientific << std::setprecision(2) << n << \", \";\n }\n output << \"] [took: \"\n << std::fixed << std::setprecision(1) << status_item->elapsed_iter\n << \"s]\"\n << std::endl;\n\n if (m_config.getVerbose() > 1)\n {\n output << std::fixed << std::setprecision(4) << \" RMSE train: \" << status_item->train_rmse << std::endl;\n output << \" Priors:\" << std::endl;\n\n for(const auto &p : m_priors)\n p->status(output, \" \");\n\n output << \" Model:\" << std::endl;\n model().status(output, \" \");\n output << \" Noise:\" << std::endl;\n data().status(output, \" \");\n }\n\n if (m_config.getVerbose() > 2)\n {\n output << \" Compute Performance: \" << status_item->samples_per_sec << \" samples\/sec, \" << status_item->nnz_per_sec << \" nnz\/sec\" << std::endl;\n }\n }\n\n if (m_config.getCsvStatus().size())\n {\n auto f = std::ofstream(m_config.getCsvStatus(), std::ofstream::out | std::ofstream::app);\n THROWERROR_ASSERT_MSG(f, \"Could not open status csv file: \" + m_config.getCsvStatus());\n f << status_item->asCsvString() << std::endl;\n }\n}\n\nstd::string StatusItem::getCsvHeader()\n{\n return \"phase;iter;phase_len;rmse_avg;rmse_1samp;train_rmse;auc_avg;auc_1samp;elapsed\";\n}\n\nstd::string StatusItem::asCsvString() const\n{\n char ret[1024];\n snprintf(ret, 1024, \"%s;%d;%d;%.4f;%.4f;%.4f;%.4f;:%.4f;%0.1f\",\n phase.c_str(), iter, phase_iter, rmse_avg, rmse_1sample, train_rmse,\n auc_1sample, auc_avg, elapsed_iter);\n\n return ret;\n}\n\nvoid Session::initRng()\n{\n \/\/init random generator\n if (m_config.getRandomSeedSet())\n init_bmrng(m_config.getRandomSeed());\n else\n init_bmrng();\n}\n\nstd::shared_ptr<IPriorFactory> Session::create_prior_factory() const\n{\n return std::make_shared<PriorFactory>();\n}\n<commit_msg>Fix for deleted ofstream c'tor<commit_after>#include \"Session.h\"\n\n#include <fstream>\n#include <string>\n#include <iomanip>\n\n#include <SmurffCpp\/Version.h>\n\n#include <SmurffCpp\/Utils\/omp_util.h>\n#include <SmurffCpp\/Utils\/Distribution.h>\n#include <SmurffCpp\/Utils\/MatrixUtils.h>\n#include <SmurffCpp\/Utils\/counters.h>\n#include <SmurffCpp\/Utils\/Error.h>\n\n#include <SmurffCpp\/DataMatrices\/DataCreator.h>\n#include <SmurffCpp\/Priors\/PriorFactory.h>\n\n#include <SmurffCpp\/result.h>\n#include <SmurffCpp\/StatusItem.h>\n\nusing namespace smurff;\n\nvoid Session::setRestoreFromRootPath(std::string rootPath)\n{\n \/\/ open root file\n m_rootFile = std::make_shared<RootFile>(rootPath);\n\n \/\/restore config\n m_rootFile->restoreConfig(m_config);\n\n m_config.validate();\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setRestoreFromConfig(const Config& cfg, std::string rootPath)\n{\n cfg.validate();\n\n \/\/ assign config\n m_config = cfg;\n\n \/\/ open root file\n m_rootFile = std::make_shared<RootFile>(rootPath);\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setCreateFromConfig(const Config& cfg)\n{\n cfg.validate();\n\n \/\/ assign config\n m_config = cfg;\n\n if (m_config.getSaveFreq() || m_config.getCheckpointFreq())\n {\n\n \/\/ create root file\n m_rootFile = std::make_shared<RootFile>(m_config.getSavePrefix(), m_config.getSaveExtension());\n\n \/\/save config\n m_rootFile->saveConfig(m_config);\n\n \/\/flush record about options.ini\n m_rootFile->flushLast();\n }\n\n \/\/base functionality\n setFromBase();\n}\n\nvoid Session::setFromBase()\n{\n std::shared_ptr<Session> this_session = shared_from_this();\n\n \/\/ initialize pred\n\n if (m_config.getClassify())\n m_pred->setThreshold(m_config.getThreshold());\n\n if (m_config.getTest())\n m_pred->set(m_config.getTest());\n\n \/\/ initialize data\n\n data_ptr = m_config.getTrain()->create(std::make_shared<DataCreator>(this_session));\n\n \/\/ initialize priors\n\n std::shared_ptr<IPriorFactory> priorFactory = this->create_prior_factory();\n for (std::size_t i = 0; i < m_config.getPriorTypes().size(); i++)\n this->addPrior(priorFactory->create_prior(this_session, i));\n}\n\nvoid Session::init()\n{\n \/\/init omp\n threads_init(m_config.getVerbose());\n\n \/\/initialize random generator\n initRng();\n\n \/\/initialize train matrix (centring and noise model)\n data().init();\n\n \/\/initialize model (samples)\n model().init(m_config.getNumLatent(), data().dim(), m_config.getModelInitType());\n\n \/\/initialize priors\n for(auto &p : m_priors)\n p->init();\n\n \/\/write header to status file\n if (m_config.getCsvStatus().size())\n {\n std::ofstream f(m_config.getCsvStatus(), std::ofstream::out);\n THROWERROR_ASSERT_MSG(f, \"Could not open status csv file: \" + m_config.getCsvStatus());\n f << StatusItem::getCsvHeader() << std::endl;\n }\n\n \/\/write info to console\n if (m_config.getVerbose())\n info(std::cout, \"\");\n\n \/\/restore session (model, priors)\n bool resume = restore(m_iter);\n\n \/\/print session status to console\n if (m_config.getVerbose())\n {\n printStatus(std::cout, resume);\n }\n\n is_init = true;\n}\n\nvoid Session::run()\n{\n init();\n while (step());\n}\n\nbool Session::step()\n{\n THROWERROR_ASSERT_MSG(is_init, \"Session::init() needs to be called before ::step()\")\n\n \/\/ go to the next iteration\n m_iter++;\n\n bool isStep = m_iter < m_config.getBurnin() + m_config.getNSamples();\n\n if (isStep)\n {\n \/\/init omp\n threads_enable(m_config.getVerbose());\n\n THROWERROR_ASSERT(is_init);\n\n auto starti = tick();\n BaseSession::step();\n auto endi = tick();\n\n \/\/WARNING: update is an expensive operation because of sort (when calculating AUC)\n m_pred->update(m_model, m_iter < m_config.getBurnin());\n\n m_secs_per_iter = endi - starti;\n\n printStatus(std::cout);\n\n save(m_iter);\n\n threads_disable(m_config.getVerbose());\n }\n\n return isStep;\n}\n\nstd::ostream& Session::info(std::ostream &os, std::string indent)\n{\n os << indent << name << \" {\\n\";\n\n BaseSession::info(os, indent);\n\n os << indent << \" Version: \" << smurff::SMURFF_VERSION << \"\\n\" ;\n os << indent << \" Iterations: \" << m_config.getBurnin() << \" burnin + \" << m_config.getNSamples() << \" samples\\n\";\n\n if (m_config.getSaveFreq() != 0 || m_config.getCheckpointFreq() != 0)\n {\n if (m_config.getSaveFreq() > 0)\n {\n os << indent << \" Save model: every \" << m_config.getSaveFreq() << \" iteration\\n\";\n }\n else if (m_config.getSaveFreq() < 0)\n {\n os << indent << \" Save model after last iteration\\n\";\n }\n\n if (m_config.getCheckpointFreq() > 0)\n {\n os << indent << \" Checkpoint state: every \" << m_config.getCheckpointFreq() << \" seconds\\n\";\n }\n\n os << indent << \" Save prefix: \" << m_config.getSavePrefix() << \"\\n\";\n os << indent << \" Save extension: \" << m_config.getSaveExtension() << \"\\n\";\n }\n else\n {\n os << indent << \" Save model: never\\n\";\n }\n\n os << indent << \"}\\n\";\n return os;\n}\n\nvoid Session::save(int iteration)\n{\n \/\/do not save if 'never save' mode is selected\n if (!m_config.getSaveFreq() && \n !m_config.getCheckpointFreq() &&\n !m_config.getCsvStatus().size())\n return;\n\n std::int32_t isample = iteration - m_config.getBurnin() + 1;\n\n \/\/save if checkpoint threshold overdue\n if (m_config.getCheckpointFreq() && (tick() - m_lastCheckpointTime) >= m_config.getCheckpointFreq())\n {\n std::int32_t icheckpoint = iteration + 1;\n\n \/\/save this iteration\n std::shared_ptr<StepFile> stepFile = m_rootFile->createCheckpointStepFile(icheckpoint);\n saveInternal(stepFile);\n\n \/\/remove previous iteration if required (initial m_lastCheckpointIter is -1 which means that it does not exist)\n if (m_lastCheckpointIter >= 0)\n {\n std::int32_t icheckpointPrev = m_lastCheckpointIter + 1;\n\n \/\/remove previous iteration\n m_rootFile->removeCheckpointStepFile(icheckpointPrev);\n\n \/\/flush last item in a root file\n m_rootFile->flushLast();\n }\n\n \/\/upddate counters\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n } \n\n \/\/save model during sampling stage\n if (m_config.getSaveFreq() && isample > 0)\n {\n \/\/save_freq > 0: check modulo - do not save if not a save iteration\n if (m_config.getSaveFreq() > 0 && (isample % m_config.getSaveFreq()) != 0)\n {\n \/\/ don't save\n }\n \/\/save_freq < 0: save last iter - do not save if (final model) mode is selected and not a final iteration\n else if (m_config.getSaveFreq() < 0 && isample < m_config.getNSamples())\n {\n \/\/ don't save\n }\n else\n {\n \/\/do save this iteration\n std::shared_ptr<StepFile> stepFile = m_rootFile->createSampleStepFile(isample);\n saveInternal(stepFile);\n }\n }\n}\n\nvoid Session::saveInternal(std::shared_ptr<StepFile> stepFile)\n{\n if (m_config.getVerbose())\n {\n std::cout << \"-- Saving model, predictions,... into '\" << stepFile->getStepFileName() << \"'.\" << std::endl;\n }\n\n BaseSession::save(stepFile);\n\n \/\/flush last item in a root file\n m_rootFile->flushLast();\n}\n\nbool Session::restore(int& iteration)\n{\n std::shared_ptr<StepFile> stepFile = nullptr;\n if (m_rootFile)\n {\n stepFile = m_rootFile->openLastStepFile();\n }\n\n if (!stepFile)\n {\n \/\/if there is nothing to restore - start from initial iteration\n iteration = -1;\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = -1;\n return false;\n }\n else\n {\n if (m_config.getVerbose())\n {\n std::cout << \"-- Restoring model, predictions,... from '\" << stepFile->getStepFileName() << \"'.\" << std::endl;\n }\n\n BaseSession::restore(stepFile);\n\n \/\/restore last iteration index\n if (stepFile->getCheckpoint())\n {\n iteration = stepFile->getIsample() - 1; \/\/restore original state\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n }\n else\n {\n iteration = stepFile->getIsample() + m_config.getBurnin() - 1; \/\/restore original state\n\n \/\/to keep track at what time we last checkpointed\n m_lastCheckpointTime = tick();\n m_lastCheckpointIter = iteration;\n }\n\n return true;\n }\n}\n\nstd::shared_ptr<StatusItem> Session::getStatus() const\n{\n std::shared_ptr<StatusItem> ret = std::make_shared<StatusItem>();\n\n if (m_iter < 0)\n {\n ret->phase = \"Initial\";\n ret->iter = m_iter + 1;\n ret->phase_iter = 0;\n }\n else if (m_iter < m_config.getBurnin())\n {\n ret->phase = \"Burnin\";\n ret->iter = m_iter + 1;\n ret->phase_iter = m_config.getBurnin();\n }\n else\n {\n ret->phase = \"Sample\";\n ret->iter = m_iter - m_config.getBurnin() + 1;\n ret->phase_iter = m_config.getNSamples();\n }\n\n for (int i = 0; i < model().nmodes(); ++i)\n {\n ret->model_norms.push_back(model().U(i).norm());\n }\n\n ret->train_rmse = data().train_rmse(model());\n\n ret->rmse_avg = m_pred->rmse_avg;\n ret->rmse_1sample = m_pred->rmse_1sample;\n\n ret->auc_avg = m_pred->auc_avg;\n ret->auc_1sample = m_pred->auc_1sample;\n\n ret->elapsed_iter = m_secs_per_iter;\n ret->nnz_per_sec = (double)(data().nnz()) \/ m_secs_per_iter;\n ret->samples_per_sec = (double)(model().nsamples()) \/ m_secs_per_iter;\n\n return ret;\n}\n\nvoid Session::printStatus(std::ostream& output, bool resume)\n{\n if(!m_config.getVerbose() &&\n !m_config.getCsvStatus().size())\n return;\n\n auto status_item = getStatus();\n\n std::string resumeString = resume ? \"Continue from \" : std::string();\n\n if (m_config.getVerbose() > 0)\n {\n if (m_iter < 0)\n {\n output << \" ====== Initial phase ====== \" << std::endl;\n }\n else if (m_iter < m_config.getBurnin() && m_iter == 0)\n {\n output << \" ====== Sampling (burning phase) ====== \" << std::endl;\n }\n else if (m_iter == m_config.getBurnin())\n {\n output << \" ====== Burn-in complete, averaging samples ====== \" << std::endl;\n }\n\n output << resumeString\n << status_item->phase\n << \" \"\n << std::setfill(' ') << std::setw(3) << status_item->iter\n << \"\/\"\n << std::setfill(' ') << std::setw(3) << status_item->phase_iter\n << \": RMSE: \"\n << std::fixed << std::setprecision(4) << status_item->rmse_avg\n << \" (1samp: \"\n << std::fixed << std::setprecision(4) << status_item->rmse_1sample\n << \")\";\n\n if (m_config.getClassify())\n {\n output << \" AUC:\"\n << std::fixed << std::setprecision(4) << status_item->auc_avg\n << \" (1samp: \"\n << std::fixed << std::setprecision(4) << status_item->auc_1sample\n << \")\"\n << std::endl;\n }\n\n output << \" U:[\";\n for(double n: status_item->model_norms)\n {\n output << std::scientific << std::setprecision(2) << n << \", \";\n }\n output << \"] [took: \"\n << std::fixed << std::setprecision(1) << status_item->elapsed_iter\n << \"s]\"\n << std::endl;\n\n if (m_config.getVerbose() > 1)\n {\n output << std::fixed << std::setprecision(4) << \" RMSE train: \" << status_item->train_rmse << std::endl;\n output << \" Priors:\" << std::endl;\n\n for(const auto &p : m_priors)\n p->status(output, \" \");\n\n output << \" Model:\" << std::endl;\n model().status(output, \" \");\n output << \" Noise:\" << std::endl;\n data().status(output, \" \");\n }\n\n if (m_config.getVerbose() > 2)\n {\n output << \" Compute Performance: \" << status_item->samples_per_sec << \" samples\/sec, \" << status_item->nnz_per_sec << \" nnz\/sec\" << std::endl;\n }\n }\n\n if (m_config.getCsvStatus().size())\n {\n std::ofstream f(m_config.getCsvStatus(), std::ofstream::out | std::ofstream::app);\n THROWERROR_ASSERT_MSG(f, \"Could not open status csv file: \" + m_config.getCsvStatus());\n f << status_item->asCsvString() << std::endl;\n }\n}\n\nstd::string StatusItem::getCsvHeader()\n{\n return \"phase;iter;phase_len;rmse_avg;rmse_1samp;train_rmse;auc_avg;auc_1samp;elapsed\";\n}\n\nstd::string StatusItem::asCsvString() const\n{\n char ret[1024];\n snprintf(ret, 1024, \"%s;%d;%d;%.4f;%.4f;%.4f;%.4f;:%.4f;%0.1f\",\n phase.c_str(), iter, phase_iter, rmse_avg, rmse_1sample, train_rmse,\n auc_1sample, auc_avg, elapsed_iter);\n\n return ret;\n}\n\nvoid Session::initRng()\n{\n \/\/init random generator\n if (m_config.getRandomSeedSet())\n init_bmrng(m_config.getRandomSeed());\n else\n init_bmrng();\n}\n\nstd::shared_ptr<IPriorFactory> Session::create_prior_factory() const\n{\n return std::make_shared<PriorFactory>();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"EditorInputHandler.h\"\n\nEditorInputHandler::EditorInputHandler(HINSTANCE handleInstance, HWND handle, Camera* camera, int w, int h)\n{\n\tthis->m_Width = w;\n\tthis->m_Height = h;\n\tHRESULT hr = DirectInput8Create(\n\t\thandleInstance,\n\t\tDIRECTINPUT_VERSION,\n\t\tIID_IDirectInput8,\n\t\t(void**)&m_directInput,\n\t\tNULL);\n\n\thr = m_directInput->CreateDevice(GUID_SysKeyboard,\n\t\t&DIKeyboard,\n\t\tNULL);\n\n\thr = m_directInput->CreateDevice(GUID_SysMouse,\n\t\t&DIMouse,\n\t\tNULL);\n\n\thr = DIKeyboard->SetDataFormat(&c_dfDIKeyboard);\n\thr = DIKeyboard->SetCooperativeLevel(handle, DISCL_FOREGROUND | DISCL_NONEXCLUSIVE);\n\n\thr = DIMouse->SetDataFormat(&c_dfDIMouse);\n\thr = DIMouse->SetCooperativeLevel(handle, DISCL_EXCLUSIVE | DISCL_NOWINKEY | DISCL_FOREGROUND);\n\tthis->m_hwnd = handle;\n\tthis->m_Camera = camera;\n\tthis->m_PreviousPos = camera->GetCameraPos();\n}\n\nEditorInputHandler::~EditorInputHandler()\n{\n}\n\nvoid EditorInputHandler::detectInput(double dT)\n{\n\n\tDIMOUSESTATE mouseCurrentState;\n\n\tBYTE keyBoardState[256]; \/\/ the amount of buttons a char array of 256.\n\n\tDIKeyboard->Acquire();\n\tDIMouse->Acquire();\n\n\tDIMouse->GetDeviceState(sizeof(DIMOUSESTATE), &mouseCurrentState);\n\n\tDIKeyboard->GetDeviceState(sizeof(keyBoardState), (LPVOID)&keyBoardState);\n\n\tfloat speed = 10.0f * dT;\n\tfloat speedrot = 5.0f * dT;\n\tint result = 1;\n\tfloat translateCameraX = 0, translateCameraY = 0, translateCameraZ = 0;\n\tfloat yaw = 0, pitch = 0;\n\n\tPOINT mousePos;\n\tGetCursorPos(&mousePos);\n\tScreenToClient(this->m_hwnd, &mousePos);\n\n#pragma region SHIFT + ALT +\n\n#pragma endregion\n#pragma region CONTROL +\n\tif (keyBoardState[DIK_LCONTROL] & 0x80)\n\t{\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tDirectX::XMVECTOR rayOrigin, rayDirection;\n\t\t\tint m_MouseX = mousePos.x;\n\t\t\tint m_MouseY = mousePos.y;\n\t\t\tif (m_MouseX > m_Width)\n\t\t\t\tm_MouseX = m_Width;\n\t\t\telse if (m_MouseX < 0)\n\t\t\t\tm_MouseX = 0;\n\t\t\tif (m_MouseY > m_Height)\n\t\t\t\tm_MouseY = m_Height;\n\t\t\telse if (m_MouseY < 0)\n\t\t\t\tm_MouseY = 0;\n\n\t\t\tDirectX::XMVECTOR localRayDirection = DirectX::XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);\n\t\t\tDirectX::XMVECTOR LocalRayOrigin = DirectX::XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);\n\t\t\tfloat X, Y, Z;\n\t\t\tDirectX::XMFLOAT4X4 camProjection;\n\t\t\tfloat fieldOfView = (float)DirectX::XM_PI \/ 4.0f;\n\t\t\tfloat screenAspect = (float)m_Width \/ (float)m_Height;\n\n\t\t\tDirectX::XMStoreFloat4x4(\n\t\t\t\t&camProjection,\n\t\t\t\tDirectX::XMMatrixPerspectiveFovLH(\n\t\t\t\t\tfieldOfView,\n\t\t\t\t\tscreenAspect,\n\t\t\t\t\t0.1f,\n\t\t\t\t\t1000.0f)\n\t\t\t);\n\n\t\t\t\/\/Transform 2D pick position on screen space to 3D ray in View space\n\t\t\tX = (((2.0f * m_MouseX) \/ m_Width) - 1) \/ camProjection._11;\n\t\t\tY = -(((2.0f * m_MouseY) \/ m_Height) - 1) \/ camProjection._22;\n\t\t\tZ = 1.0f; \/\/View space's Z direction ranges from 0 to 1, so we set 1 since the ray goes \"into\" the screen\n\n\t\t\tlocalRayDirection = DirectX::XMVectorSet(X, Y, Z, 0.0f);\n\n\t\t\tDirectX::XMMATRIX inverseCamView;\n\t\t\tDirectX::XMVECTOR det = { 1,1,1,1 };\n\t\t\tDirectX::XMMATRIX temp;\n\t\t\tthis->m_Camera->GetBaseViewMatrix(temp);\n\n\t\t\t\/\/inverseCamView = DirectX::XMMatrixInverse(&det, temp);\n\n\t\t\t\/\/rayOrigin = XMVector3TransformCoord(LocalRayOrigin, inverseCamView);\n\t\t\t\/\/rayDirection = DirectX::XMVector3TransformNormal(localRayDirection, inverseCamView);\n\t\t\t\/\/rayDirection = DirectX::XMVector3Normalize(rayDirection);\n\n\t\t\tDirectX::XMFLOAT4 test;\n\t\t\tDirectX::XMStoreFloat4(&test, localRayDirection);\n\t\t\tthis->m_Camera->SetLookAt(test);\n\t\t}\n\t}\n#pragma endregion\n#pragma region SHIFT +\n\tif (keyBoardState[DIK_LSHIFT] & 0x80)\n\t{\n\t\tif (keyBoardState[DIK_W] & 0x80)\n\t\t{\n\t\t\ttranslateCameraZ += speed;\n\t\t}\n\t\tif (keyBoardState[DIK_S] & 0x80)\n\t\t{\n\t\t\ttranslateCameraZ -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_A] & 0x80)\n\t\t{\n\t\t\ttranslateCameraX += speed;\n\t\t}\n\t\tif (keyBoardState[DIK_D] & 0x80)\n\t\t{\n\t\t\ttranslateCameraX -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_C] & 0x80)\n\t\t{\n\t\t\ttranslateCameraY -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_SPACE] & 0x80)\n\t\t{\n\t\t\ttranslateCameraY += speed;\n\t\t}\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tif (mouseCurrentState.lY < 0)\n\t\t\t{\n\t\t\t\ttranslateCameraZ += speedrot;\n\t\t\t}\n\t\t\tif (mouseCurrentState.lY > 0)\n\t\t\t{\n\t\t\t\ttranslateCameraZ -= speedrot;\n\t\t\t}\n\n\t\t}\n\n\n\t}\n#pragma endregion\n\tif (keyBoardState[DIK_LALT] & 0x80)\n\t{\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tif ((mouseCurrentState.lX!= m_mouseLastState.lX) || (mouseCurrentState.lY != m_mouseLastState.lY))\n\t\t\t{\n\t\t\t\tpitch += mouseCurrentState.lX * 0.01f;\n\t\t\n\t\t\t\tyaw += mouseCurrentState.lY * 0.01f;\n\n\t\t\t\t\/\/ Ensure the mouse location doesn't exceed the screen width or height.\n\t\t\t\tif (m_MouseX < 0) { m_MouseX = 0; }\n\t\t\t\tif (m_MouseY < 0) { m_MouseY = 0; }\n\n\t\t\t\tif (m_MouseX > m_Width) { m_MouseX = m_Width; }\n\t\t\t\tif (m_MouseY > m_Height) { m_MouseY = m_Height; }\n\n\t\t\t\tm_mouseLastState = mouseCurrentState;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif ((translateCameraY || translateCameraZ || translateCameraX))\n\t{\n\t\tDirectX::XMFLOAT3 posTranslation =\n\t\t\tDirectX::XMFLOAT3(\n\t\t\t\tfloat(translateCameraX),\n\t\t\t\tfloat(translateCameraY),\n\t\t\t\tfloat(translateCameraZ)\n\t\t\t);\n\n\t\tthis->m_PreviousPos = this->m_Camera->GetCameraPos();\n\t\tthis->m_Camera->ApplyLocalTranslation(\n\t\t\tfloat(translateCameraZ),\n\t\t\tfloat(translateCameraY),\n\t\t\tfloat(translateCameraX)\n\t\t);\n\t\t\/\/this->m_Camera->AddToCameraPos(posTranslation);\n\t\t\/\/this->m_Camera->AddToLookAt(posTranslation);\n\t\tthis->m_Camera->Update();\n\t}\n\n\t\tfloat rotationAmount = DirectX::XM_PI \/ 8;\n\n\t\tDirectX::XMFLOAT4 newRotation = \n\t\t\tDirectX::XMFLOAT4(\n\t\t\t\tyaw * DirectX::XMScalarSin(rotationAmount \/ 2.0f),\n\t\t\t\tpitch * DirectX::XMScalarSin(rotationAmount \/ 2.0f),\n\t\t\t\t0.0f,\n\t\t\t\tDirectX::XMScalarCos(rotationAmount \/ 2.0f)\n\t\t\t);\n\n\t\tthis->m_Camera->SetRotation(newRotation);\n\t\t\/\/this->m_Camera->ApplyRotation(newRotation);\n\t\tthis->m_Camera->Update();\n\tthis->m_Camera->Update();\n}\n<commit_msg>UPDATE applied fix from camera branch<commit_after>#include \"EditorInputHandler.h\"\n\nEditorInputHandler::EditorInputHandler(HINSTANCE handleInstance, HWND handle, Camera* camera, int w, int h)\n{\n\tthis->m_Width = w;\n\tthis->m_Height = h;\n\tHRESULT hr = DirectInput8Create(\n\t\thandleInstance,\n\t\tDIRECTINPUT_VERSION,\n\t\tIID_IDirectInput8,\n\t\t(void**)&m_directInput,\n\t\tNULL);\n\n\thr = m_directInput->CreateDevice(GUID_SysKeyboard,\n\t\t&DIKeyboard,\n\t\tNULL);\n\n\thr = m_directInput->CreateDevice(GUID_SysMouse,\n\t\t&DIMouse,\n\t\tNULL);\n\n\thr = DIKeyboard->SetDataFormat(&c_dfDIKeyboard);\n\thr = DIKeyboard->SetCooperativeLevel(handle, DISCL_FOREGROUND | DISCL_NONEXCLUSIVE);\n\n\thr = DIMouse->SetDataFormat(&c_dfDIMouse);\n\thr = DIMouse->SetCooperativeLevel(handle, DISCL_EXCLUSIVE | DISCL_NOWINKEY | DISCL_FOREGROUND);\n\tthis->m_hwnd = handle;\n\tthis->m_Camera = camera;\n\tthis->m_PreviousPos = camera->GetCameraPos();\n}\n\nEditorInputHandler::~EditorInputHandler()\n{\n}\n\nvoid EditorInputHandler::detectInput(double dT)\n{\n\n\tDIMOUSESTATE mouseCurrentState;\n\n\tBYTE keyBoardState[256]; \/\/ the amount of buttons a char array of 256.\n\n\tDIKeyboard->Acquire();\n\tDIMouse->Acquire();\n\n\tDIMouse->GetDeviceState(sizeof(DIMOUSESTATE), &mouseCurrentState);\n\n\tDIKeyboard->GetDeviceState(sizeof(keyBoardState), (LPVOID)&keyBoardState);\n\n\tfloat speed = 10.0f * dT;\n\tfloat speedrot = 5.0f * dT;\n\tint result = 1;\n\tfloat translateCameraX = 0, translateCameraY = 0, translateCameraZ = 0;\n\tfloat yaw = 0, pitch = 0;\n\n\tPOINT mousePos;\n\tGetCursorPos(&mousePos);\n\tScreenToClient(this->m_hwnd, &mousePos);\n\n#pragma region SHIFT + ALT +\n\n#pragma endregion\n#pragma region CONTROL +\n\tif (keyBoardState[DIK_LCONTROL] & 0x80)\n\t{\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tDirectX::XMVECTOR rayOrigin, rayDirection;\n\t\t\tint m_MouseX = mousePos.x;\n\t\t\tint m_MouseY = mousePos.y;\n\t\t\tif (m_MouseX > m_Width)\n\t\t\t\tm_MouseX = m_Width;\n\t\t\telse if (m_MouseX < 0)\n\t\t\t\tm_MouseX = 0;\n\t\t\tif (m_MouseY > m_Height)\n\t\t\t\tm_MouseY = m_Height;\n\t\t\telse if (m_MouseY < 0)\n\t\t\t\tm_MouseY = 0;\n\n\t\t\tDirectX::XMVECTOR localRayDirection = DirectX::XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);\n\t\t\tDirectX::XMVECTOR LocalRayOrigin = DirectX::XMVectorSet(0.0f, 0.0f, 0.0f, 0.0f);\n\t\t\tfloat X, Y, Z;\n\t\t\tDirectX::XMFLOAT4X4 camProjection;\n\t\t\tfloat fieldOfView = (float)DirectX::XM_PI \/ 4.0f;\n\t\t\tfloat screenAspect = (float)m_Width \/ (float)m_Height;\n\n\t\t\tDirectX::XMStoreFloat4x4(\n\t\t\t\t&camProjection,\n\t\t\t\tDirectX::XMMatrixPerspectiveFovLH(\n\t\t\t\t\tfieldOfView,\n\t\t\t\t\tscreenAspect,\n\t\t\t\t\t0.1f,\n\t\t\t\t\t1000.0f)\n\t\t\t);\n\n\t\t\t\/\/Transform 2D pick position on screen space to 3D ray in View space\n\t\t\tX = (((2.0f * m_MouseX) \/ m_Width) - 1) \/ camProjection._11;\n\t\t\tY = -(((2.0f * m_MouseY) \/ m_Height) - 1) \/ camProjection._22;\n\t\t\tZ = 1.0f; \/\/View space's Z direction ranges from 0 to 1, so we set 1 since the ray goes \"into\" the screen\n\n\t\t\tlocalRayDirection = DirectX::XMVectorSet(X, Y, Z, 0.0f);\n\n\t\t\tDirectX::XMMATRIX inverseCamView;\n\t\t\tDirectX::XMVECTOR det = { 1,1,1,1 };\n\t\t\tDirectX::XMMATRIX temp;\n\t\t\tthis->m_Camera->GetBaseViewMatrix(temp);\n\n\t\t\t\/\/inverseCamView = DirectX::XMMatrixInverse(&det, temp);\n\n\t\t\t\/\/rayOrigin = XMVector3TransformCoord(LocalRayOrigin, inverseCamView);\n\t\t\t\/\/rayDirection = DirectX::XMVector3TransformNormal(localRayDirection, inverseCamView);\n\t\t\t\/\/rayDirection = DirectX::XMVector3Normalize(rayDirection);\n\n\t\t\tDirectX::XMFLOAT4 test;\n\t\t\tDirectX::XMStoreFloat4(&test, localRayDirection);\n\t\t\tthis->m_Camera->SetLookAt(test);\n\t\t}\n\t}\n#pragma endregion\n#pragma region SHIFT +\n\tif (keyBoardState[DIK_LSHIFT] & 0x80)\n\t{\n\t\tif (keyBoardState[DIK_W] & 0x80)\n\t\t{\n\t\t\ttranslateCameraZ += speed;\n\t\t}\n\t\tif (keyBoardState[DIK_S] & 0x80)\n\t\t{\n\t\t\ttranslateCameraZ -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_A] & 0x80)\n\t\t{\n\t\t\ttranslateCameraX -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_D] & 0x80)\n\t\t{\n\t\t\ttranslateCameraX += speed;\n\t\t}\n\t\tif (keyBoardState[DIK_C] & 0x80)\n\t\t{\n\t\t\ttranslateCameraY -= speed;\n\t\t}\n\t\tif (keyBoardState[DIK_SPACE] & 0x80)\n\t\t{\n\t\t\ttranslateCameraY += speed;\n\t\t}\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tif (mouseCurrentState.lY < 0)\n\t\t\t{\n\t\t\t\ttranslateCameraZ += speedrot;\n\t\t\t}\n\t\t\tif (mouseCurrentState.lY > 0)\n\t\t\t{\n\t\t\t\ttranslateCameraZ -= speedrot;\n\t\t\t}\n\n\t\t}\n\n\n\t}\n#pragma endregion\n\tif (keyBoardState[DIK_LALT] & 0x80)\n\t{\n\t\tif (mouseCurrentState.rgbButtons[0])\n\t\t{\n\t\t\tif ((mouseCurrentState.lX!= m_mouseLastState.lX) || (mouseCurrentState.lY != m_mouseLastState.lY))\n\t\t\t{\n\t\t\t\tpitch += mouseCurrentState.lX * 0.01f;\n\t\t\n\t\t\t\tyaw += mouseCurrentState.lY * 0.01f;\n\n\t\t\t\t\/\/ Ensure the mouse location doesn't exceed the screen width or height.\n\t\t\t\tif (m_MouseX < 0) { m_MouseX = 0; }\n\t\t\t\tif (m_MouseY < 0) { m_MouseY = 0; }\n\n\t\t\t\tif (m_MouseX > m_Width) { m_MouseX = m_Width; }\n\t\t\t\tif (m_MouseY > m_Height) { m_MouseY = m_Height; }\n\n\t\t\t\tm_mouseLastState = mouseCurrentState;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tif ((translateCameraY || translateCameraZ || translateCameraX))\n\t{\n\t\tDirectX::XMFLOAT3 posTranslation =\n\t\t\tDirectX::XMFLOAT3(\n\t\t\t\tfloat(translateCameraX),\n\t\t\t\tfloat(translateCameraY),\n\t\t\t\tfloat(translateCameraZ)\n\t\t\t);\n\n\t\tthis->m_PreviousPos = this->m_Camera->GetCameraPos();\n\t\tthis->m_Camera->ApplyLocalTranslation(\n\t\t\tfloat(translateCameraX),\n\t\t\tfloat(translateCameraY),\n\t\t\tfloat(translateCameraZ)\n\t\t);\n\t\t\/\/this->m_Camera->AddToCameraPos(posTranslation);\n\t\t\/\/this->m_Camera->AddToLookAt(posTranslation);\n\t\tthis->m_Camera->Update();\n\t}\n\n\t\tfloat rotationAmount = DirectX::XM_PI \/ 8;\n\n\t\tDirectX::XMFLOAT4 newRotation = \n\t\t\tDirectX::XMFLOAT4(\n\t\t\t\tyaw * DirectX::XMScalarSin(rotationAmount \/ 2.0f),\n\t\t\t\tpitch * DirectX::XMScalarSin(rotationAmount \/ 2.0f),\n\t\t\t\t0.0f,\n\t\t\t\tDirectX::XMScalarCos(rotationAmount \/ 2.0f)\n\t\t\t);\n\n\t\tthis->m_Camera->SetRotation(newRotation);\n\t\t\/\/this->m_Camera->ApplyRotation(newRotation);\n\t\tthis->m_Camera->Update();\n\tthis->m_Camera->Update();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <vector>\n#include <regex>\n#include <iterator>\n\n#include <popt.h>\n\n#include \"defs.hh\"\n#include \"io.hh\"\n#include \"StringSet.hh\"\n#include \"FactorGraph.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n#include \"Bigrams.hh\"\n\nusing namespace std;\n\n\nvoid trim(string& str, char to_trim)\n{\n string::size_type pos = str.find_last_not_of(to_trim);\n if(pos != string::npos) {\n str.erase(pos + 1);\n pos = str.find_first_not_of(to_trim);\n if(pos != string::npos) str.erase(0, pos);\n }\n else str.erase(str.begin(), str.end());\n}\n\n\nint main(int argc, char* argv[]) {\n\n char *vocab_fname;\n char *trans_fname;\n string in_fname;\n string out_fname_1;\n string out_fname_2;\n int maxlen;\n map<string, flt_type> vocab;\n StringSet *ss_vocab = NULL;\n transitions_t transitions;\n string start_end_symbol(\"*\");\n flt_type one_char_min_lp = -25.0;\n bool enable_forward_backward = false;\n bool weights = false;\n\n poptContext pc;\n struct poptOption po[] = {\n {\"vocabulary\", 'v', POPT_ARG_STRING, &vocab_fname, 11001, NULL, \"Vocabulary file name\"},\n {\"transitions\", 't', POPT_ARG_STRING, &trans_fname, 11002, NULL, \"Transition file name\"},\n {\"forward_backward\", 'f', POPT_ARG_NONE, &enable_forward_backward, 11007, \"Use Forward-backward segmentation instead of Viterbi\", NULL},\n {\"weights\", 'w', POPT_ARG_NONE, &weights, 11007, \"Training examples are weighted\", NULL},\n POPT_AUTOHELP\n {NULL}\n };\n\n pc = poptGetContext(NULL, argc, (const char **)argv, po, 0);\n poptSetOtherOptionHelp(pc, \"INPUT COUNTS1 COUNTS2\");\n\n int val;\n while ((val = poptGetNextOpt(pc)) >= 0)\n continue;\n\n \/\/ poptGetNextOpt returns -1 when the final argument has been parsed\n \/\/ otherwise an error occured\n if (val != -1) {\n switch (val) {\n case POPT_ERROR_NOARG:\n cerr << \"Argument missing for an option\" << endl;\n exit(1);\n case POPT_ERROR_BADOPT:\n cerr << \"Option's argument could not be parsed\" << endl;\n exit(1);\n case POPT_ERROR_BADNUMBER:\n case POPT_ERROR_OVERFLOW:\n cerr << \"Option could not be converted to number\" << endl;\n exit(1);\n default:\n cerr << \"Unknown error in option processing\" << endl;\n exit(1);\n }\n }\n\n if (poptPeekArg(pc) != NULL)\n in_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Input file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n out_fname_1.assign((char*)poptGetArg(pc));\n else {\n cerr << \"1-gram count file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n out_fname_2.assign((char*)poptGetArg(pc));\n else {\n cerr << \"2-gram count file not set\" << endl;\n exit(1);\n }\n\n if (vocab_fname == NULL && trans_fname == NULL) {\n cerr << \"Please define vocabulary or transitions\" << endl;\n exit(0);\n }\n\n if (vocab_fname != NULL && trans_fname != NULL) {\n cerr << \"Don't define both vocabulary and transitions\" << endl;\n exit(0);\n }\n\n if (vocab_fname != NULL) {\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n ss_vocab = new StringSet(vocab);\n }\n\n if (trans_fname != NULL) {\n cerr << \"Reading transitions \" << trans_fname << endl;\n int retval = Bigrams::read_transitions(transitions, trans_fname);\n Bigrams::trans_to_vocab(transitions, vocab);\n ss_vocab = new StringSet(vocab);\n if (retval < 0) {\n cerr << \"something went wrong reading transitions\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"vocabulary: \" << transitions.size() << endl;\n cerr << \"\\t\" << \"transitions: \" << retval << endl;\n }\n\n cerr << \"Segmenting corpus\" << endl;\n io::Stream infile;\n try {\n infile.open(in_fname, \"r\");\n }\n catch (io::Stream::OpenError oe) {\n cerr << \"Something went wrong opening the input.\" << endl;\n exit(0);\n }\n\n map<string, flt_type> unigram_stats;\n transitions_t trans_stats;\n char linebuffer[8192];\n while (fgets(linebuffer, 8192 , infile.file) != NULL) {\n\n linebuffer[strlen(linebuffer)-1] = '\\0';\n string line(linebuffer);\n\n flt_type curr_weight = 1.0;\n if (weights) {\n string remainder;\n std::istringstream iss(line);\n iss >> std::skipws >> curr_weight;\n getline(iss, remainder);\n trim(remainder, '\\t'); trim(remainder,' ');\n line.assign(remainder);\n }\n\n for (int i=0; i<line.size(); i++) {\n string currchr {line[i]};\n if (!ss_vocab->includes(currchr))\n ss_vocab->add(currchr, one_char_min_lp);\n }\n\n transitions_t curr_stats;\n FactorGraph fg(line, start_end_symbol, *ss_vocab);\n\n \/\/ Unigram model\n if (vocab_fname != NULL)\n if (enable_forward_backward)\n forward_backward(vocab, fg, curr_stats);\n else {\n cout << \"No implementation for Viterbi unigram yet.\" << endl;\n }\n \/\/ Bigram model\n else {\n if (enable_forward_backward)\n forward_backward(transitions, fg, curr_stats);\n else\n viterbi(transitions, fg, curr_stats);\n }\n\n Bigrams::update_trans_stats(curr_stats, curr_weight,\n trans_stats, unigram_stats);\n }\n\n if (ss_vocab != NULL) delete ss_vocab;\n\n Unigrams::write_vocab(out_fname_1, unigram_stats, true);\n Bigrams::write_transitions(trans_stats, out_fname_2, true);\n\n exit(1);\n}\n\n<commit_msg>Removed unused includes.<commit_after>#include <algorithm>\n#include <cstdlib>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <sstream>\n#include <cstring>\n#include <string>\n#include <vector>\n\n#include <popt.h>\n\n#include \"defs.hh\"\n#include \"io.hh\"\n#include \"StringSet.hh\"\n#include \"FactorGraph.hh\"\n#include \"FactorEncoder.hh\"\n#include \"Unigrams.hh\"\n#include \"Bigrams.hh\"\n\nusing namespace std;\n\n\nvoid trim(string& str, char to_trim)\n{\n string::size_type pos = str.find_last_not_of(to_trim);\n if(pos != string::npos) {\n str.erase(pos + 1);\n pos = str.find_first_not_of(to_trim);\n if(pos != string::npos) str.erase(0, pos);\n }\n else str.erase(str.begin(), str.end());\n}\n\n\nint main(int argc, char* argv[]) {\n\n char *vocab_fname;\n char *trans_fname;\n string in_fname;\n string out_fname_1;\n string out_fname_2;\n int maxlen;\n map<string, flt_type> vocab;\n StringSet *ss_vocab = NULL;\n transitions_t transitions;\n string start_end_symbol(\"*\");\n flt_type one_char_min_lp = -25.0;\n bool enable_forward_backward = false;\n bool weights = false;\n\n poptContext pc;\n struct poptOption po[] = {\n {\"vocabulary\", 'v', POPT_ARG_STRING, &vocab_fname, 11001, NULL, \"Vocabulary file name\"},\n {\"transitions\", 't', POPT_ARG_STRING, &trans_fname, 11002, NULL, \"Transition file name\"},\n {\"forward_backward\", 'f', POPT_ARG_NONE, &enable_forward_backward, 11007, \"Use Forward-backward segmentation instead of Viterbi\", NULL},\n {\"weights\", 'w', POPT_ARG_NONE, &weights, 11007, \"Training examples are weighted\", NULL},\n POPT_AUTOHELP\n {NULL}\n };\n\n pc = poptGetContext(NULL, argc, (const char **)argv, po, 0);\n poptSetOtherOptionHelp(pc, \"INPUT COUNTS1 COUNTS2\");\n\n int val;\n while ((val = poptGetNextOpt(pc)) >= 0)\n continue;\n\n \/\/ poptGetNextOpt returns -1 when the final argument has been parsed\n \/\/ otherwise an error occured\n if (val != -1) {\n switch (val) {\n case POPT_ERROR_NOARG:\n cerr << \"Argument missing for an option\" << endl;\n exit(1);\n case POPT_ERROR_BADOPT:\n cerr << \"Option's argument could not be parsed\" << endl;\n exit(1);\n case POPT_ERROR_BADNUMBER:\n case POPT_ERROR_OVERFLOW:\n cerr << \"Option could not be converted to number\" << endl;\n exit(1);\n default:\n cerr << \"Unknown error in option processing\" << endl;\n exit(1);\n }\n }\n\n if (poptPeekArg(pc) != NULL)\n in_fname.assign((char*)poptGetArg(pc));\n else {\n cerr << \"Input file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n out_fname_1.assign((char*)poptGetArg(pc));\n else {\n cerr << \"1-gram count file not set\" << endl;\n exit(1);\n }\n\n if (poptPeekArg(pc) != NULL)\n out_fname_2.assign((char*)poptGetArg(pc));\n else {\n cerr << \"2-gram count file not set\" << endl;\n exit(1);\n }\n\n if (vocab_fname == NULL && trans_fname == NULL) {\n cerr << \"Please define vocabulary or transitions\" << endl;\n exit(0);\n }\n\n if (vocab_fname != NULL && trans_fname != NULL) {\n cerr << \"Don't define both vocabulary and transitions\" << endl;\n exit(0);\n }\n\n if (vocab_fname != NULL) {\n cerr << \"Reading vocabulary \" << vocab_fname << endl;\n int retval = Unigrams::read_vocab(vocab_fname, vocab, maxlen);\n if (retval < 0) {\n cerr << \"something went wrong reading vocabulary\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"size: \" << vocab.size() << endl;\n cerr << \"\\t\" << \"maximum string length: \" << maxlen << endl;\n ss_vocab = new StringSet(vocab);\n }\n\n if (trans_fname != NULL) {\n cerr << \"Reading transitions \" << trans_fname << endl;\n int retval = Bigrams::read_transitions(transitions, trans_fname);\n Bigrams::trans_to_vocab(transitions, vocab);\n ss_vocab = new StringSet(vocab);\n if (retval < 0) {\n cerr << \"something went wrong reading transitions\" << endl;\n exit(0);\n }\n cerr << \"\\t\" << \"vocabulary: \" << transitions.size() << endl;\n cerr << \"\\t\" << \"transitions: \" << retval << endl;\n }\n\n cerr << \"Segmenting corpus\" << endl;\n io::Stream infile;\n try {\n infile.open(in_fname, \"r\");\n }\n catch (io::Stream::OpenError oe) {\n cerr << \"Something went wrong opening the input.\" << endl;\n exit(0);\n }\n\n map<string, flt_type> unigram_stats;\n transitions_t trans_stats;\n char linebuffer[8192];\n while (fgets(linebuffer, 8192 , infile.file) != NULL) {\n\n linebuffer[strlen(linebuffer)-1] = '\\0';\n string line(linebuffer);\n\n flt_type curr_weight = 1.0;\n if (weights) {\n string remainder;\n std::istringstream iss(line);\n iss >> std::skipws >> curr_weight;\n getline(iss, remainder);\n trim(remainder, '\\t'); trim(remainder,' ');\n line.assign(remainder);\n }\n\n for (int i=0; i<line.size(); i++) {\n string currchr {line[i]};\n if (!ss_vocab->includes(currchr))\n ss_vocab->add(currchr, one_char_min_lp);\n }\n\n transitions_t curr_stats;\n FactorGraph fg(line, start_end_symbol, *ss_vocab);\n\n \/\/ Unigram model\n if (vocab_fname != NULL)\n if (enable_forward_backward)\n forward_backward(vocab, fg, curr_stats);\n else {\n cout << \"No implementation for Viterbi unigram yet.\" << endl;\n }\n \/\/ Bigram model\n else {\n if (enable_forward_backward)\n forward_backward(transitions, fg, curr_stats);\n else\n viterbi(transitions, fg, curr_stats);\n }\n\n Bigrams::update_trans_stats(curr_stats, curr_weight,\n trans_stats, unigram_stats);\n }\n\n if (ss_vocab != NULL) delete ss_vocab;\n\n Unigrams::write_vocab(out_fname_1, unigram_stats, true);\n Bigrams::write_transitions(trans_stats, out_fname_2, true);\n\n exit(1);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nThis file is part of the ORK library.\nFull copyright and license terms can be found in the LICENSE.txt file.\n*\/\n#pragma once\n#include\"boost\/spirit\/home\/support\/common_terminals.hpp\"\n#include\"boost\/spirit\/home\/qi.hpp\"\n#include\"ork\/ork.hpp\"\n\n\n\/*\nPlaceholders for parser components\n*\/\nnamespace ork {\nnamespace orq {\/\/ork-qi :)\n\nBOOST_SPIRIT_TERMINAL(id);\nBOOST_SPIRIT_TERMINAL(quote);\nBOOST_SPIRIT_TERMINAL(lb_com);\/\/'pound comment'\n\n}\/\/namespace orq\n}\/\/namespace ork\n\n\n\/*\nEnablers for parser components\n*\/\nnamespace boost {\nnamespace spirit {\n\n\/\/Make custom parser usable as a terminal only, and only for parser expressions (qi::domain).\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::id> : mpl::true_ {};\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::quote> : mpl::true_ {};\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::lb_com> : mpl::true_ {};\n\n}\/\/namespace spirit\n}\/\/namespace boost\n\n\n\nnamespace ork {\n\nnamespace spirit = boost::spirit;\nnamespace qi = spirit::qi;\nnamespace ascii = spirit::ascii;\nnamespace proto = boost::proto;\n\n\n#if ORK_UNICODE\ntypedef spirit::char_encoding::standard_wide charset;\n#else\ntypedef spirit::char_encoding::standard charset;\n#endif\n\n\nnamespace orq {\/\/ork-qi :)\n\n\nstruct ORK_ORK_API id_parser : qi::primitive_parser<id_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef string type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\tif(first == last) {\n\t\t\treturn false;\n\t\t}\n\n\t\titer it(first);\n\t\tif(!std::isalpha(*it) && *it != ORK('_')) {\n\t\t\treturn false;\/\/First character must be letter or underscore\n\t\t}\n\t\twhile(it != last && (std::isalnum(*it) || *it == ORK('_'))) {\n\t\t\t++it;\/\/Subsequent characters can be numbers also\n\t\t}\n\n\t\tattribute result(first, it);\n\t\tif(result.empty()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfirst = it;\n\t\tspirit::traits::assign_to(result, attr);\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"id\");\n\t}\n};\n\n\nstruct ORK_ORK_API quote_parser : qi::primitive_parser<quote_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef string type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\tif(first == last) {\n\t\t\treturn false;\n\t\t}\n\n\t\titer it(first);\n\t\tif(*it++ != ORK('\"')) {\/\/Consume the quote\n\t\t\treturn false;\n\t\t}\n\t\twhile(it != last && *it != ORK('\"')) {\/\/Up to but do not consume the quote\n\t\t\t++it;\n\t\t}\n\t\tif(it == last) {\n\t\t\treturn false;\n\t\t}\n\t\tif(*it++ != ORK('\"')) {\/\/Consume the quote\n\t\t\treturn false;\n\t\t}\n\n\t\tattribute result(++first, it - 1);\/\/Do not include quotes\n\t\t\/\/Allow empty attribute\n\n\t\tfirst = it;\n\t\tspirit::traits::assign_to(result, attr);\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"quote\");\n\t}\n};\n\n\nstruct ORK_ORK_API lb_com_parser : qi::primitive_parser<lb_com_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef qi::unused_type type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\tif(first == last) {\n\t\t\treturn false;\n\t\t}\n\n\t\titer it(first);\n\t\tif(*it++ != ORK('#')) {\/\/Consume the marker\n\t\t\treturn false;\n\t\t}\n\t\twhile(it != last && *it != ORK('\\n')) {\/\/Up to but do not consume the eol\n\t\t\t++it;\n\t\t}\n\n\t\tfirst = it;\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"lb_com\");\n\t}\n};\n\n\n}\/\/namespace orq\n}\/\/namespace ork\n\n\n\/*\nInstantiators for parser components\n*\/\nnamespace boost {\nnamespace spirit {\nnamespace qi {\n\n\/\/This is the factory function object that is invoked to create an instance of our parser.\n#define ORK_ORQ_FACTORY(TAG)\\\ntemplate<typename modifiers>\\\nstruct make_primitive<ork::orq::tag::TAG, modifiers> {\\\n\ttypedef typename ork::orq::ORK_CAT(TAG,_parser) result_type;\\\n\tresult_type operator()(unused_type, unused_type) const {\\\n\t\treturn result_type();\\\n\t}\\\n};\n\nORK_ORQ_FACTORY(id);\nORK_ORQ_FACTORY(quote);\nORK_ORQ_FACTORY(lb_com);\n\n}\/\/namespace qi\n}\/\/namespace spirit\n}\/\/namespace boost<commit_msg>Refactored identifier code into function<commit_after>\/*\nThis file is part of the ORK library.\nFull copyright and license terms can be found in the LICENSE.txt file.\n*\/\n#pragma once\n#include\"boost\/spirit\/home\/support\/common_terminals.hpp\"\n#include\"boost\/spirit\/home\/qi.hpp\"\n#include\"ork\/ork.hpp\"\n\n\n\/*\nPlaceholders for parser components\n*\/\nnamespace ork {\nnamespace orq {\/\/ork-qi :)\n\nBOOST_SPIRIT_TERMINAL(id);\nBOOST_SPIRIT_TERMINAL(quote);\nBOOST_SPIRIT_TERMINAL(lb_com);\/\/'pound comment'\n\n}\/\/namespace orq\n}\/\/namespace ork\n\n\n\/*\nEnablers for parser components\n*\/\nnamespace boost {\nnamespace spirit {\n\n\/\/Make custom parser usable as a terminal only, and only for parser expressions (qi::domain).\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::id> : mpl::true_ {};\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::quote> : mpl::true_ {};\ntemplate<> struct use_terminal<qi::domain, ork::orq::tag::lb_com> : mpl::true_ {};\n\n}\/\/namespace spirit\n}\/\/namespace boost\n\n\n\nnamespace ork {\n\nnamespace spirit = boost::spirit;\nnamespace qi = spirit::qi;\nnamespace ascii = spirit::ascii;\nnamespace proto = boost::proto;\n\n\n#if ORK_UNICODE\ntypedef spirit::char_encoding::standard_wide charset;\n#else\ntypedef spirit::char_encoding::standard charset;\n#endif\n\n\nnamespace orq {\/\/ork-qi :)\n\n\nnamespace detail {\n\n\ntemplate<typename iter>\nbool consume_identifier(iter& it, const iter&first, const iter& last) {\n\tif(it == last) {\n\t\treturn false;\n\t}\n\n\tif(!std::isalpha(*it) && *it != ORK('_')) {\n\t\treturn false;\/\/First character must be letter or underscore\n\t}\n\twhile(it != last && (std::isalnum(*it) || *it == ORK('_'))) {\n\t\t++it;\/\/Subsequent characters can be numbers also\n\t}\n\n\treturn it != first;\n}\n\n\n}\/\/namespace detail\n\n\nstruct ORK_ORK_API id_parser : qi::primitive_parser<id_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef string type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\titer it(first);\n\t\tif(!detail::consume_identifier(it, first, last)) {\n\t\t\treturn false;\n\t\t}\n\n\t\tattribute result(first, it);\n\t\tfirst = it;\n\t\tspirit::traits::assign_to(result, attr);\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"id\");\n\t}\n};\n\n\nstruct ORK_ORK_API quote_parser : qi::primitive_parser<quote_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef string type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\tif(first == last) {\n\t\t\treturn false;\n\t\t}\n\n\t\titer it(first);\n\t\tif(*it++ != ORK('\"')) {\/\/Consume the quote\n\t\t\treturn false;\n\t\t}\n\t\twhile(it != last && *it != ORK('\"')) {\/\/Up to but do not consume the quote\n\t\t\t++it;\n\t\t}\n\t\tif(it == last) {\n\t\t\treturn false;\n\t\t}\n\t\tif(*it++ != ORK('\"')) {\/\/Consume the quote\n\t\t\treturn false;\n\t\t}\n\n\t\tattribute result(++first, it - 1);\/\/Do not include quotes\n\t\t\/\/Allow empty attribute\n\n\t\tfirst = it;\n\t\tspirit::traits::assign_to(result, attr);\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"quote\");\n\t}\n};\n\n\nstruct ORK_ORK_API lb_com_parser : qi::primitive_parser<lb_com_parser> {\npublic:\/\/Parser component stuff\n\ttemplate<typename context, typename iter>\n\tstruct attribute {\/\/Define the attribute type exposed by this parser component\n\t\ttypedef qi::unused_type type;\n\t};\n\n\t\/\/This function is called during the actual parsing process\n\ttemplate<typename iter, typename context, typename skipper, typename attribute>\n\tbool parse(iter& first, const iter& last, context&ctxt, const skipper& skip, attribute& attr) const {\n\t\tboost::spirit::qi::skip_over(first, last, skip);\/\/All primitive parsers pre-skip\n\n\t\tif(first == last) {\n\t\t\treturn false;\n\t\t}\n\n\t\titer it(first);\n\t\tif(*it++ != ORK('#')) {\/\/Consume the marker\n\t\t\treturn false;\n\t\t}\n\t\twhile(it != last && *it != ORK('\\n')) {\/\/Up to but do not consume the eol\n\t\t\t++it;\n\t\t}\n\n\t\tfirst = it;\n\t\treturn true;\n\t}\n\n\t\/\/This function is called during error handling to create a human readable string for the error context.\n\ttemplate<typename context>\n\tboost::spirit::info what(context&) const {\n\t\treturn boost::spirit::info(\"lb_com\");\n\t}\n};\n\n\n}\/\/namespace orq\n}\/\/namespace ork\n\n\n\/*\nInstantiators for parser components\n*\/\nnamespace boost {\nnamespace spirit {\nnamespace qi {\n\n\/\/This is the factory function object that is invoked to create an instance of our parser.\n#define ORK_ORQ_FACTORY(TAG)\\\ntemplate<typename modifiers>\\\nstruct make_primitive<ork::orq::tag::TAG, modifiers> {\\\n\ttypedef typename ork::orq::ORK_CAT(TAG,_parser) result_type;\\\n\tresult_type operator()(unused_type, unused_type) const {\\\n\t\treturn result_type();\\\n\t}\\\n};\n\nORK_ORQ_FACTORY(id);\nORK_ORQ_FACTORY(quote);\nORK_ORQ_FACTORY(lb_com);\n\n}\/\/namespace qi\n}\/\/namespace spirit\n}\/\/namespace boost<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2014 P.L. Lucas <selairi@gmail.com>\n Copyright (C) 2013 <copyright holder> <email>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License along\n with this program; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n*\/\n\n#include \"monitorsettingsdialog.h\"\n\n#include \"monitorwidget.h\"\n#include \"monitor.h\"\n#include \"timeoutdialog.h\"\n#include \"monitorpicture.h\"\n#include \"settingsdialog.h\"\n#include \"fastmenu.h\"\n\n#include <KScreen\/Output>\n#include <QJsonObject>\n#include <QJsonArray>\n#include <LXQt\/Settings>\n#include <QJsonDocument>\n#include <KScreen\/EDID>\n#include <QFile>\n#include <QDir>\n#include <QFileInfo>\n#include <QMessageBox>\n#include <QDateTime>\n#include <lxqtautostartentry.h>\n\nMonitorSettingsDialog::MonitorSettingsDialog() :\n QDialog(nullptr, 0)\n{\n ui.setupUi(this);\n\n KScreen::GetConfigOperation *operation = new KScreen::GetConfigOperation();\n connect(operation, &KScreen::GetConfigOperation::finished, [this, operation] (KScreen::ConfigOperation *op) {\n KScreen::GetConfigOperation *configOp = qobject_cast<KScreen::GetConfigOperation *>(op);\n qDebug() << \"Connecting to KScreen...\";\n if (configOp && configOp->config() && configOp->config()->screen())\n {\n mOldConfig = configOp->config()->clone();\n loadConfiguration(configOp->config());\n operation->deleteLater();\n }\n else if(configOp && !configOp->config())\n {\n qDebug() << \"Error: Config is invalid, probably backend couldn't load\";\n exit(1);\n }\n else if(configOp && configOp->config() && !configOp->config()->screen())\n {\n qDebug() << \"Error: No screen in the configuration, broken backend\";\n exit(2);\n }\n else\n {\n qDebug() << \"Error: Connect to KScreen is not possible\";\n exit(3);\n }\n });\n\n connect(ui.buttonBox, &QDialogButtonBox::clicked, [&] (QAbstractButton *button) {\n if (ui.buttonBox->standardButton(button) == QDialogButtonBox::Apply)\n applyConfiguration(false);\n if (ui.buttonBox->standardButton(button) == QDialogButtonBox::Save)\n {\n applyConfiguration(true);\n }\n\n });\n\n connect(ui.settingsButton, SIGNAL(clicked()), this, SLOT(showSettingsDialog()));\n}\n\nMonitorSettingsDialog::~MonitorSettingsDialog()\n{\n}\n\nvoid MonitorSettingsDialog::loadConfiguration(KScreen::ConfigPtr config)\n{\n if (mConfig == config)\n return;\n\n mConfig = config;\n\n MonitorPictureDialog *monitorPicture = nullptr;\n FastMenu *fastMenu = nullptr;\n KScreen::OutputList outputs = mConfig->outputs();\n\n int nMonitors = 0;\n for (const KScreen::OutputPtr &output : outputs)\n {\n if (output->isConnected())\n nMonitors++;\n\n if (nMonitors > 1)\n {\n fastMenu = new FastMenu(config, this);\n ui.monitorList->addItem(tr(\"Fast Menu\"));\n ui.stackedWidget->addWidget(fastMenu);\n \n monitorPicture = new MonitorPictureDialog(config, this);\n ui.monitorList->addItem(tr(\"Set position\"));\n ui.stackedWidget->addWidget(monitorPicture);\n break;\n }\n }\n\n QList<MonitorWidget*> monitors;\n\n for (const KScreen::OutputPtr &output : outputs)\n {\n if (output->isConnected())\n {\n MonitorWidget *monitor = new MonitorWidget(output, mConfig, this);\n ui.monitorList->addItem(output->name() + \" \" + output->edid()->name() + \" \" + output->edid()->vendor());\n ui.stackedWidget->addWidget(monitor);\n monitors.append(monitor);\n }\n }\n \n for(const MonitorWidget *monitor1 : qAsConst(monitors))\n {\n for(const MonitorWidget *monitor : qAsConst(monitors))\n {\n if(monitor != monitor1)\n connect(monitor, SIGNAL(primaryOutputChanged(MonitorWidget *)), monitor1, SLOT(onPrimaryOutputChanged(MonitorWidget *)));\n }\n }\n\n if (monitorPicture)\n monitorPicture->setScene(monitors);\n\n ui.monitorList->setCurrentRow(0);\n adjustSize();\n}\n\nvoid MonitorSettingsDialog::applyConfiguration(bool saveConfigOk)\n{\n if (mConfig && KScreen::Config::canBeApplied(mConfig))\n {\n KScreen::SetConfigOperation(mConfig).exec();\n\n TimeoutDialog mTimeoutDialog;\n if (mTimeoutDialog.exec() == QDialog::Rejected)\n KScreen::SetConfigOperation(mOldConfig).exec();\n else\n {\n mOldConfig = mConfig->clone();\n if (saveConfigOk)\n saveConfiguration(mConfig);\n }\n }\n}\n\nvoid MonitorSettingsDialog::accept()\n{\n \/\/applyConfiguration(true);\n QDialog::accept();\n}\n\nvoid MonitorSettingsDialog::reject()\n{\n QDialog::reject();\n}\n\nvoid MonitorSettingsDialog::saveConfiguration(KScreen::ConfigPtr config)\n{\n \n QList<MonitorSettings> currentSettings;\n KScreen::OutputList outputs = config->outputs();\n for (const KScreen::OutputPtr &output : outputs)\n {\n MonitorSettings monitor;\n monitor.name = output->name();\n KScreen::Edid* edid = output->edid();\n if (edid && edid->isValid())\n monitor.hash = edid->hash();\n monitor.connected = output->isConnected();\n if ( output->isConnected() )\n {\n monitor.enabled = output->isEnabled();\n monitor.primary = output->isPrimary();\n monitor.xPos = output->pos().x();\n monitor.yPos = output->pos().y();\n monitor.currentMode = output->currentModeId();\n monitor.currentModeWidth = output->currentMode()->size().width();\n monitor.currentModeHeight = output->currentMode()->size().height();\n monitor.currentModeRate = output->currentMode()->refreshRate();\n monitor.rotation = output->rotation();\n }\n currentSettings.append(monitor);\n }\n \n LXQt::Settings settings(\"lxqt-config-monitor\");\n settings.beginGroup(\"currentConfig\");\n saveMonitorSettings(settings, currentSettings);\n settings.endGroup();\n \n QList<MonitorSavedSettings> monitors;\n settings.beginGroup(\"SavedConfigs\");\n loadMonitorSettings(settings, monitors);\n qDebug() << \"[ MonitorSettingsDialog::saveConfiguration] # monitors Read:\" << monitors.size();\n MonitorSavedSettings monitor;\n monitor.name = QDateTime::currentDateTime().toString();\n monitor.date = QDateTime::currentDateTime().toString(Qt::ISODate);\n monitor.monitors = currentSettings;\n monitors.append(monitor);\n saveMonitorSettings(settings, monitors);\n qDebug() << \"[ MonitorSettingsDialog::saveConfiguration] # monitors Write:\" << monitors.size();\n settings.endGroup();\n\n LXQt::AutostartEntry autoStart(\"lxqt-config-monitor-autostart.desktop\");\n XdgDesktopFile desktopFile(XdgDesktopFile::ApplicationType, \"lxqt-config-monitor-autostart\", \"lxqt-config-monitor -l\");\n \/\/desktopFile.setValue(\"OnlyShowIn\", QString(qgetenv(\"XDG_CURRENT_DESKTOP\")));\n desktopFile.setValue(\"OnlyShowIn\", \"LXQt\");\n desktopFile.setValue(\"Comment\", \"Autostart monitor settings for LXQt-config-monitor\");\n autoStart.setFile(desktopFile);\n autoStart.commit();\n}\n\n\nvoid MonitorSettingsDialog::showSettingsDialog()\n{\n QByteArray configName = qgetenv(\"LXQT_SESSION_CONFIG\");\n\n if (configName.isEmpty())\n configName = \"MonitorSettings\";\n\n LXQt::Settings settings(configName);\n\n SettingsDialog settingsDialog(tr(\"Advanced settings\"), &settings, mConfig);\n settingsDialog.exec();\n}\n<commit_msg>Brackets added to monitor name.<commit_after>\/*\n Copyright (C) 2014 P.L. Lucas <selairi@gmail.com>\n Copyright (C) 2013 <copyright holder> <email>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License along\n with this program; if not, write to the Free Software Foundation, Inc.,\n 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n*\/\n\n#include \"monitorsettingsdialog.h\"\n\n#include \"monitorwidget.h\"\n#include \"monitor.h\"\n#include \"timeoutdialog.h\"\n#include \"monitorpicture.h\"\n#include \"settingsdialog.h\"\n#include \"fastmenu.h\"\n\n#include <KScreen\/Output>\n#include <QJsonObject>\n#include <QJsonArray>\n#include <LXQt\/Settings>\n#include <QJsonDocument>\n#include <KScreen\/EDID>\n#include <QFile>\n#include <QDir>\n#include <QFileInfo>\n#include <QMessageBox>\n#include <QDateTime>\n#include <lxqtautostartentry.h>\n\nMonitorSettingsDialog::MonitorSettingsDialog() :\n QDialog(nullptr, 0)\n{\n ui.setupUi(this);\n\n KScreen::GetConfigOperation *operation = new KScreen::GetConfigOperation();\n connect(operation, &KScreen::GetConfigOperation::finished, [this, operation] (KScreen::ConfigOperation *op) {\n KScreen::GetConfigOperation *configOp = qobject_cast<KScreen::GetConfigOperation *>(op);\n qDebug() << \"Connecting to KScreen...\";\n if (configOp && configOp->config() && configOp->config()->screen())\n {\n mOldConfig = configOp->config()->clone();\n loadConfiguration(configOp->config());\n operation->deleteLater();\n }\n else if(configOp && !configOp->config())\n {\n qDebug() << \"Error: Config is invalid, probably backend couldn't load\";\n exit(1);\n }\n else if(configOp && configOp->config() && !configOp->config()->screen())\n {\n qDebug() << \"Error: No screen in the configuration, broken backend\";\n exit(2);\n }\n else\n {\n qDebug() << \"Error: Connect to KScreen is not possible\";\n exit(3);\n }\n });\n\n connect(ui.buttonBox, &QDialogButtonBox::clicked, [&] (QAbstractButton *button) {\n if (ui.buttonBox->standardButton(button) == QDialogButtonBox::Apply)\n applyConfiguration(false);\n if (ui.buttonBox->standardButton(button) == QDialogButtonBox::Save)\n {\n applyConfiguration(true);\n }\n\n });\n\n connect(ui.settingsButton, SIGNAL(clicked()), this, SLOT(showSettingsDialog()));\n}\n\nMonitorSettingsDialog::~MonitorSettingsDialog()\n{\n}\n\nvoid MonitorSettingsDialog::loadConfiguration(KScreen::ConfigPtr config)\n{\n if (mConfig == config)\n return;\n\n mConfig = config;\n\n MonitorPictureDialog *monitorPicture = nullptr;\n FastMenu *fastMenu = nullptr;\n KScreen::OutputList outputs = mConfig->outputs();\n\n int nMonitors = 0;\n for (const KScreen::OutputPtr &output : outputs)\n {\n if (output->isConnected())\n nMonitors++;\n\n if (nMonitors > 1)\n {\n fastMenu = new FastMenu(config, this);\n ui.monitorList->addItem(tr(\"Fast Menu\"));\n ui.stackedWidget->addWidget(fastMenu);\n \n monitorPicture = new MonitorPictureDialog(config, this);\n ui.monitorList->addItem(tr(\"Set position\"));\n ui.stackedWidget->addWidget(monitorPicture);\n break;\n }\n }\n\n QList<MonitorWidget*> monitors;\n\n for (const KScreen::OutputPtr &output : outputs)\n {\n if (output->isConnected())\n {\n MonitorWidget *monitor = new MonitorWidget(output, mConfig, this);\n QString monitorName = output->edid()->name() + \" \" + output->edid()->vendor();\n if(monitorName.trimmed().size() > 0)\n monitorName = \"(\" + monitorName + \")\";\n ui.monitorList->addItem(output->name() + \" \" + monitorName);\n ui.stackedWidget->addWidget(monitor);\n monitors.append(monitor);\n }\n }\n \n for(const MonitorWidget *monitor1 : qAsConst(monitors))\n {\n for(const MonitorWidget *monitor : qAsConst(monitors))\n {\n if(monitor != monitor1)\n connect(monitor, SIGNAL(primaryOutputChanged(MonitorWidget *)), monitor1, SLOT(onPrimaryOutputChanged(MonitorWidget *)));\n }\n }\n\n if (monitorPicture)\n monitorPicture->setScene(monitors);\n\n ui.monitorList->setCurrentRow(0);\n adjustSize();\n}\n\nvoid MonitorSettingsDialog::applyConfiguration(bool saveConfigOk)\n{\n if (mConfig && KScreen::Config::canBeApplied(mConfig))\n {\n KScreen::SetConfigOperation(mConfig).exec();\n\n TimeoutDialog mTimeoutDialog;\n if (mTimeoutDialog.exec() == QDialog::Rejected)\n KScreen::SetConfigOperation(mOldConfig).exec();\n else\n {\n mOldConfig = mConfig->clone();\n if (saveConfigOk)\n saveConfiguration(mConfig);\n }\n }\n}\n\nvoid MonitorSettingsDialog::accept()\n{\n \/\/applyConfiguration(true);\n QDialog::accept();\n}\n\nvoid MonitorSettingsDialog::reject()\n{\n QDialog::reject();\n}\n\nvoid MonitorSettingsDialog::saveConfiguration(KScreen::ConfigPtr config)\n{\n \n QList<MonitorSettings> currentSettings;\n KScreen::OutputList outputs = config->outputs();\n for (const KScreen::OutputPtr &output : outputs)\n {\n MonitorSettings monitor;\n monitor.name = output->name();\n KScreen::Edid* edid = output->edid();\n if (edid && edid->isValid())\n monitor.hash = edid->hash();\n monitor.connected = output->isConnected();\n if ( output->isConnected() )\n {\n monitor.enabled = output->isEnabled();\n monitor.primary = output->isPrimary();\n monitor.xPos = output->pos().x();\n monitor.yPos = output->pos().y();\n monitor.currentMode = output->currentModeId();\n monitor.currentModeWidth = output->currentMode()->size().width();\n monitor.currentModeHeight = output->currentMode()->size().height();\n monitor.currentModeRate = output->currentMode()->refreshRate();\n monitor.rotation = output->rotation();\n }\n currentSettings.append(monitor);\n }\n \n LXQt::Settings settings(\"lxqt-config-monitor\");\n settings.beginGroup(\"currentConfig\");\n saveMonitorSettings(settings, currentSettings);\n settings.endGroup();\n \n QList<MonitorSavedSettings> monitors;\n settings.beginGroup(\"SavedConfigs\");\n loadMonitorSettings(settings, monitors);\n qDebug() << \"[ MonitorSettingsDialog::saveConfiguration] # monitors Read:\" << monitors.size();\n MonitorSavedSettings monitor;\n monitor.name = QDateTime::currentDateTime().toString();\n monitor.date = QDateTime::currentDateTime().toString(Qt::ISODate);\n monitor.monitors = currentSettings;\n monitors.append(monitor);\n saveMonitorSettings(settings, monitors);\n qDebug() << \"[ MonitorSettingsDialog::saveConfiguration] # monitors Write:\" << monitors.size();\n settings.endGroup();\n\n LXQt::AutostartEntry autoStart(\"lxqt-config-monitor-autostart.desktop\");\n XdgDesktopFile desktopFile(XdgDesktopFile::ApplicationType, \"lxqt-config-monitor-autostart\", \"lxqt-config-monitor -l\");\n \/\/desktopFile.setValue(\"OnlyShowIn\", QString(qgetenv(\"XDG_CURRENT_DESKTOP\")));\n desktopFile.setValue(\"OnlyShowIn\", \"LXQt\");\n desktopFile.setValue(\"Comment\", \"Autostart monitor settings for LXQt-config-monitor\");\n autoStart.setFile(desktopFile);\n autoStart.commit();\n}\n\n\nvoid MonitorSettingsDialog::showSettingsDialog()\n{\n QByteArray configName = qgetenv(\"LXQT_SESSION_CONFIG\");\n\n if (configName.isEmpty())\n configName = \"MonitorSettings\";\n\n LXQt::Settings settings(configName);\n\n SettingsDialog settingsDialog(tr(\"Advanced settings\"), &settings, mConfig);\n settingsDialog.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2004-2007 Torsten Rahn <tackat@kde.org>\"\n\/\/ Copyright 2007 Inge Wallin <ingwa@kde.org>\"\n\/\/\n\n\n#include \"MarbleDirs.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtGui\/QApplication>\n\n#ifdef Q_OS_MACX\n\/\/for getting app bundle path\n#include <ApplicationServices\/ApplicationServices.h>\n#endif\n\n#include <config-marble.h>\n\nnamespace\n{\n QString runTimeMarbleDataPath = \"\";\n}\n\nMarbleDirs::MarbleDirs()\n : d( 0 )\n{\n}\n\n\nQString MarbleDirs::path( const QString& relativePath )\n{ \n QString localpath = localPath() + QDir::separator() + relativePath;\t\/\/ local path\n\/\/ qDebug( \"localpath: %s\", qPrintable( localpath ) );\n QString systempath = systemPath() + QDir::separator() + relativePath;\t\/\/ system path\n\/\/ qDebug( \"systempath: %s\", qPrintable( systempath ) );\n\n\n QString fullpath = systempath;\n if ( QFile::exists( localpath ) ) {\n fullpath = localpath;\n }\n\/\/ qDebug( \"Using path: %s\", qPrintable( fullpath ) );\n\n return QDir( fullpath ).canonicalPath(); \n}\n\n\nQString MarbleDirs::systemPath()\n{\n QString systempath;\n\n#ifdef Q_OS_MACX\n \/\/\n \/\/ On OSX lets try to find any file first in the bundle\n \/\/ before branching out to home and sys dirs\n \/\/\n CFURLRef myBundleRef = CFBundleCopyBundleURL(CFBundleGetMainBundle());\n CFStringRef myMacPath = CFURLCopyFileSystemPath(myBundleRef, kCFURLPOSIXPathStyle);\n const char *mypPathPtr = CFStringGetCStringPtr(myMacPath,CFStringGetSystemEncoding());\n CFRelease(myBundleRef);\n CFRelease(myMacPath);\n QString myPath(mypPathPtr);\n \/\/do some magick so that we can still find data dir if\n \/\/marble was not built as a bundle\n if (myPath.contains(\".app\")) \/\/its a bundle!\n {\n systempath = myPath + \"\/Contents\/Resources\/data\";\n }\n\/*\n \/\/ tackat: If I understood tim correctly this should\n \/\/ now be obsolete, right?\n else \/\/must be running from a non .app bundle\n {\n systempath = QApplication::applicationDirPath()+\"\/..\/share\/data\";\n }\n*\/\n if ( QFile::exists( systempath ) ){ \n return systempath;\n }\n#endif \/\/ mac bundle\n\n\/\/ Should this happen before the Mac bundle already?\nif ( !runTimeMarbleDataPath.isEmpty() )\n return runTimeMarbleDataPath;\n\n#if !defined(Q_OS_WIN)\n \/\/MARBLE_DATA_PATH is a compiler define set by cmake\n QString compileTimeMarbleDataPath(MARBLE_DATA_PATH);\n\/\/ qDebug( \"%s <-- marble data path\", qPrintable( compileTimeMarbleDataPath ) );\n\n return compileTimeMarbleDataPath;\n#endif\n\nreturn QDir( qApp->applicationDirPath() \n\n#if defined(QTONLY)\n + QLatin1String( \"\/data\" )\n#else\n + QLatin1String( \"\/..\/share\/apps\/marble\/data\" )\n#endif\n ).canonicalPath();\n}\n\nQString MarbleDirs::localPath() \n{ \n return QString( QDir::homePath() + \"\/.marble\/data\" ); \/\/ local path\n}\n\nQString MarbleDirs::marbleDataPath()\n{\n return runTimeMarbleDataPath;\n}\n\nvoid MarbleDirs::setMarbleDataPath( const QString& adaptedPath )\n{\n if ( !QDir::root().exists( adaptedPath ) )\n {\n qDebug( \"WARNING: Invalid MarbleDataPath %s. Using builtin path instead.\", \n qPrintable( adaptedPath ) );\n return;\n }\n\n runTimeMarbleDataPath = adaptedPath;\n}\n<commit_msg>fix data search path for kde version of marble for Windows<commit_after>\/\/\n\/\/ This file is part of the Marble Desktop Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2004-2007 Torsten Rahn <tackat@kde.org>\"\n\/\/ Copyright 2007 Inge Wallin <ingwa@kde.org>\"\n\/\/\n\n\n#include \"MarbleDirs.h\"\n\n#include <QtCore\/QFile>\n#include <QtCore\/QDir>\n#include <QtGui\/QApplication>\n\n#ifdef Q_OS_MACX\n\/\/for getting app bundle path\n#include <ApplicationServices\/ApplicationServices.h>\n#endif\n\n#include <config-marble.h>\n\nnamespace\n{\n QString runTimeMarbleDataPath = \"\";\n}\n\nMarbleDirs::MarbleDirs()\n : d( 0 )\n{\n}\n\n\nQString MarbleDirs::path( const QString& relativePath )\n{ \n QString localpath = localPath() + QDir::separator() + relativePath;\t\/\/ local path\n\/\/ qDebug( \"localpath: %s\", qPrintable( localpath ) );\n QString systempath = systemPath() + QDir::separator() + relativePath;\t\/\/ system path\n\/\/ qDebug( \"systempath: %s\", qPrintable( systempath ) );\n\n\n QString fullpath = systempath;\n if ( QFile::exists( localpath ) ) {\n fullpath = localpath;\n }\n\/\/ qDebug( \"Using path: %s\", qPrintable( fullpath ) );\n\n return QDir( fullpath ).canonicalPath(); \n}\n\n\nQString MarbleDirs::systemPath()\n{\n QString systempath;\n\n#ifdef Q_OS_MACX\n \/\/\n \/\/ On OSX lets try to find any file first in the bundle\n \/\/ before branching out to home and sys dirs\n \/\/\n CFURLRef myBundleRef = CFBundleCopyBundleURL(CFBundleGetMainBundle());\n CFStringRef myMacPath = CFURLCopyFileSystemPath(myBundleRef, kCFURLPOSIXPathStyle);\n const char *mypPathPtr = CFStringGetCStringPtr(myMacPath,CFStringGetSystemEncoding());\n CFRelease(myBundleRef);\n CFRelease(myMacPath);\n QString myPath(mypPathPtr);\n \/\/do some magick so that we can still find data dir if\n \/\/marble was not built as a bundle\n if (myPath.contains(\".app\")) \/\/its a bundle!\n {\n systempath = myPath + \"\/Contents\/Resources\/data\";\n }\n\/*\n \/\/ tackat: If I understood tim correctly this should\n \/\/ now be obsolete, right?\n else \/\/must be running from a non .app bundle\n {\n systempath = QApplication::applicationDirPath()+\"\/..\/share\/data\";\n }\n*\/\n if ( QFile::exists( systempath ) ){ \n return systempath;\n }\n#endif \/\/ mac bundle\n\n\/\/ Should this happen before the Mac bundle already?\nif ( !runTimeMarbleDataPath.isEmpty() )\n return runTimeMarbleDataPath;\n\n#ifdef MARBLE_DATA_PATH\n \/\/MARBLE_DATA_PATH is a compiler define set by cmake\n QString compileTimeMarbleDataPath(MARBLE_DATA_PATH);\n\/\/ qDebug( \"%s <-- marble data path\", qPrintable( compileTimeMarbleDataPath ) );\n\n return compileTimeMarbleDataPath;\n#endif\n\nreturn QDir( qApp->applicationDirPath() \n\n#if defined(QTONLY)\n + QLatin1String( \"\/data\" )\n#else\n + QLatin1String( \"\/..\/share\/apps\/marble\/data\" )\n#endif\n ).canonicalPath();\n}\n\nQString MarbleDirs::localPath() \n{ \n return QString( QDir::homePath() + \"\/.marble\/data\" ); \/\/ local path\n}\n\nQString MarbleDirs::marbleDataPath()\n{\n return runTimeMarbleDataPath;\n}\n\nvoid MarbleDirs::setMarbleDataPath( const QString& adaptedPath )\n{\n if ( !QDir::root().exists( adaptedPath ) )\n {\n qDebug( \"WARNING: Invalid MarbleDataPath %s. Using builtin path instead.\", \n qPrintable( adaptedPath ) );\n return;\n }\n\n runTimeMarbleDataPath = adaptedPath;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR 4\n#define CV_VERSION_MINOR 5\n#define CV_VERSION_REVISION 2\n#define CV_VERSION_STATUS \"-pre\"\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A) L ## #__A\n#define CVAUX_STRW(__A) CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_MAJOR\n#define CV_MINOR_VERSION CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<commit_msg>release: OpenCV 4.5.2<commit_after>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR 4\n#define CV_VERSION_MINOR 5\n#define CV_VERSION_REVISION 2\n#define CV_VERSION_STATUS \"\"\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A) L ## #__A\n#define CVAUX_STRW(__A) CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_MAJOR\n#define CV_MINOR_VERSION CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <v8.h>\n#include \"macros.h\"\n#include \"gc.h\"\n\n#ifdef windows\n#\tinclude <my_global.h>\n#endif\n\n#include <mysql.h>\n#include <stdlib.h>\n#include <string>\n\n#define MYSQL_ERROR mysql_error(conn)\n#define ASSERT_CONNECTED if (!conn) { return JS_EXCEPTION(\"No connection established yet.\"); }\n#define MYSQL_PTR MYSQL * conn = LOAD_PTR(0, MYSQL *)\n\n\nnamespace {\n\nv8::Persistent<v8::FunctionTemplate> rest;\n\nvoid destroy(v8::Handle<v8::Object> obj) {\n\tv8::Handle<v8::Function> fun = v8::Handle<v8::Function>::Cast(obj->Get(JS_STR(\"close\")));\n\tfun->Call(obj, 0, NULL);\n}\n\nv8::Handle<v8::Value> createResult(MYSQL * conn) {\n\tMYSQL_RES * res = mysql_store_result(conn);\n\t\n\tif (res) {\n\t\tv8::Handle<v8::Value> resargs[] = { v8::External::New((void *) res) };\n\t\treturn rest->GetFunction()->NewInstance(1, resargs);\n\t} else {\n\t\tif (mysql_field_count(conn)) {\n\t\t\treturn JS_EXCEPTION(MYSQL_ERROR);\n\t\t} else {\n\t\t\treturn JS_BOOL(true);\n\t\t}\n\t}\n}\n\n\/**\n * MySQL constructor does basically nothing. It just adds \"this.close()\" method to global GC\n *\/\nJS_METHOD(_mysql) {\n\tASSERT_CONSTRUCTOR;\n\tSAVE_PTR(0, NULL);\n\tGC * gc = GC_PTR;\n\tgc->add(args.This(), destroy);\n\treturn args.This();\n}\n\n\/**\n * Close DB connection\n *\/ \nJS_METHOD(_close) {\n\tMYSQL_PTR;\n\tif (conn) {\n\t\tmysql_close(conn);\n\t\tSAVE_PTR(0, NULL);\n\t}\n\treturn args.This();\n}\n\n\/**\n * Should be called ASAP: new MySQL().connect(\"host\", \"user\", \"pass\", \"db\")\n *\/ \nJS_METHOD(_connect) {\n\tif (args.Length() < 4) {\n\t\treturn JS_EXCEPTION(\"Invalid call format. Use 'mysql.connect(host, user, pass, db)'\");\n\t}\n\t\n\tMYSQL * conn;\n\t\n\tv8::String::Utf8Value host(args[0]);\n\tv8::String::Utf8Value user(args[1]);\n\tv8::String::Utf8Value pass(args[2]);\n\tv8::String::Utf8Value db(args[3]);\n\n\tconn = mysql_init(NULL);\n\tif (!mysql_real_connect(conn, *host, *user, *pass, *db, 0, NULL, CLIENT_MULTI_STATEMENTS)) {\n\t\treturn JS_EXCEPTION(MYSQL_ERROR);\n\t} else {\n\t\tmysql_query(conn, \"SET NAMES 'utf8'\");\n\t\tSAVE_PTR(0, conn);\n\t\treturn args.This();\n\t}\t\n}\n\n\/**\n * Query takes a string argument and returns an instance of Result object\n *\/ \nJS_METHOD(_query) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"No query specified\");\n\t}\n\tv8::String::Utf8Value q(args[0]);\n\t\n\tint code = mysql_real_query(conn, *q, q.length());\n\tif (code != 0) { return JS_EXCEPTION(MYSQL_ERROR); }\n\t\n\tint qc = args.This()->Get(JS_STR(\"queryCount\"))->ToInteger()->Int32Value();\n\targs.This()->Set(JS_STR(\"queryCount\"), JS_INT(qc+1));\n\t\n\treturn createResult(conn);\n}\n\n\/**\n * Fetch next result from a multi-result set\n *\/\nJS_METHOD(_nextresult) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\t\n\tint status = mysql_next_result(conn);\n\t\n\tif (status == -1) { return JS_NULL; }\n\tif (status > 0) { return JS_EXCEPTION(MYSQL_ERROR); }\n\treturn createResult(conn);\n}\n\nJS_METHOD(_affectedrows) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\treturn JS_INT(mysql_affected_rows(conn));\n}\n\nJS_METHOD(_insertid) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\treturn JS_INT(mysql_insert_id(conn));\n}\n\nJS_METHOD(_escape) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\t\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"Nothing to escape\");\n\t}\n\tv8::String::Utf8Value str(args[0]);\n\t\n\tint len = args[0]->ToString()->Utf8Length();\n\tchar * result = new char[2*len + 1];\n\t\n\n\tint length = mysql_real_escape_string(conn, result, *str, len);\n\tv8::Handle<v8::Value> output = JS_STR(result, length);\n\tdelete[] result;\n\treturn output;\n}\n\nJS_METHOD(_qualify) {\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"Nothing to qualify\");\n\t}\n\n\tv8::String::Utf8Value str(args[0]);\n\tstd::string result = \"`\";\n\tresult += *str;\n\tresult += \"`\";\n\t\n\tv8::Handle<v8::Value> output = JS_STR(result.c_str());\n\treturn output;\n}\n\nJS_METHOD(_result) {\n\tSAVE_VALUE(0, args[0]);\n\treturn args.This();\n}\n\nJS_METHOD(_numrows) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\treturn JS_INT(mysql_num_rows(res));\n}\n\nJS_METHOD(_numfields) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\treturn JS_INT(mysql_num_fields(res));\n}\n\nJS_METHOD(_fetchnames) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\tint cnt = mysql_num_fields(res);\n\tMYSQL_FIELD * fields = mysql_fetch_fields(res);\n\tv8::Handle<v8::Array> result = v8::Array::New(cnt);\n\t\n\tfor(int i = 0; i < cnt; i++) {\n\t\tresult->Set(JS_INT(i), JS_STR(fields[i].name));\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Return result data as an array of JS arrays\n *\/ \nJS_METHOD(_fetcharrays) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\tmysql_data_seek(res, 0);\n\n\tint x = mysql_num_fields(res);\n\tint y = mysql_num_rows(res);\n\tMYSQL_ROW row;\n\tv8::Handle<v8::Array> result = v8::Array::New(y);\n\t\n\tfor (int i = 0; i < y; i++) {\n\t\trow = mysql_fetch_row(res);\n\t\tv8::Handle<v8::Array> item = v8::Array::New(x);\n\t\tresult->Set(JS_INT(i), item);\n\t\tfor (int j=0; j<x; j++) {\n\t\t\tif (row[j] == NULL) {\n\t\t\t\titem->Set(JS_INT(j), v8::Null());\n\t\t\t} else {\n\t\t\t\titem->Set(JS_INT(j), JS_STR(row[j]));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Return result data as an array of JS objects, indexed with column names\n *\/ \nJS_METHOD(_fetchobjects) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\tmysql_data_seek(res, 0);\n\n\tint x = mysql_num_fields(res);\n\tint y = mysql_num_rows(res);\n\tMYSQL_FIELD * fields = mysql_fetch_fields(res);\n\tMYSQL_ROW row;\n\tv8::Handle<v8::Array> result = v8::Array::New(y);\n\t\n\tfor (int i = 0; i < y; i++) {\n\t\trow = mysql_fetch_row(res);\n\t\tv8::Handle<v8::Object> item = v8::Object::New();\n\t\tresult->Set(JS_INT(i), item);\n\t\tfor (int j=0; j<x; j++) {\n\t\t\tif (row[j] == NULL) {\n\t\t\t\titem->Set(JS_STR(fields[j].name), v8::Null());\n\t\t\t} else {\n\t\t\t\titem->Set(JS_STR(fields[j].name), JS_STR(row[j]));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn result;\n}\n\n} \/* end namespace *\/\n\nSHARED_INIT() {\n\tv8::HandleScope handle_scope;\n\tv8::Handle<v8::FunctionTemplate> ft = v8::FunctionTemplate::New(_mysql);\n\tft->SetClassName(JS_STR(\"MySQL\"));\n\n\tv8::Handle<v8::ObjectTemplate> ot = ft->InstanceTemplate();\n\tot->SetInternalFieldCount(1); \/* connection *\/\n\t\n\t\/**\n\t * Static property, useful for stats gathering\n\t *\/\n\tot->Set(JS_STR(\"queryCount\"), JS_INT(0));\n\t\t \n\tv8::Handle<v8::ObjectTemplate> pt = ft->PrototypeTemplate();\n\n\t\/**\n\t * MySQL prototype methods (new MySQL().*)\n\t *\/\n\tpt->Set(JS_STR(\"connect\"), v8::FunctionTemplate::New(_connect));\n\tpt->Set(JS_STR(\"close\"), v8::FunctionTemplate::New(_close));\n\tpt->Set(JS_STR(\"query\"), v8::FunctionTemplate::New(_query));\n\tpt->Set(JS_STR(\"nextResult\"), v8::FunctionTemplate::New(_nextresult));\n\tpt->Set(JS_STR(\"affectedRows\"), v8::FunctionTemplate::New(_affectedrows));\n\tpt->Set(JS_STR(\"escape\"), v8::FunctionTemplate::New(_escape));\n\tpt->Set(JS_STR(\"qualify\"), v8::FunctionTemplate::New(_qualify));\n\tpt->Set(JS_STR(\"insertId\"), v8::FunctionTemplate::New(_insertid));\n\t\n\trest = v8::Persistent<v8::FunctionTemplate>::New(v8::FunctionTemplate::New(_result));\n\trest->SetClassName(JS_STR(\"Result\"));\n\t\n\tv8::Handle<v8::ObjectTemplate> resinst = rest->InstanceTemplate();\n\tresinst->SetInternalFieldCount(1);\n\t\n\tv8::Handle<v8::ObjectTemplate> resproto = rest->PrototypeTemplate();\n\n\t\/**\n\t * Result prototype methods (new MySQL().query().*)\n\t *\/\n\tresproto->Set(JS_STR(\"numRows\"), v8::FunctionTemplate::New(_numrows));\n\tresproto->Set(JS_STR(\"numFields\"), v8::FunctionTemplate::New(_numfields));\n\tresproto->Set(JS_STR(\"fetchNames\"), v8::FunctionTemplate::New(_fetchnames));\n\tresproto->Set(JS_STR(\"fetchArrays\"), v8::FunctionTemplate::New(_fetcharrays));\n\tresproto->Set(JS_STR(\"fetchObjects\"), v8::FunctionTemplate::New(_fetchobjects));\n\n\texports->Set(JS_STR(\"MySQL\"), ft->GetFunction());\n}\n<commit_msg>mysql result close()<commit_after>#include <v8.h>\n#include \"macros.h\"\n#include \"gc.h\"\n\n#ifdef windows\n#\tinclude <my_global.h>\n#endif\n\n#include <mysql.h>\n#include <stdlib.h>\n#include <string>\n\n#define MYSQL_ERROR mysql_error(conn)\n#define ASSERT_CONNECTED if (!conn) { return JS_EXCEPTION(\"No connection established yet.\"); }\n#define MYSQL_PTR MYSQL * conn = LOAD_PTR(0, MYSQL *)\n\n\nnamespace {\n\nv8::Persistent<v8::FunctionTemplate> rest;\n\nvoid destroy(v8::Handle<v8::Object> obj) {\n\tv8::Handle<v8::Function> fun = v8::Handle<v8::Function>::Cast(obj->Get(JS_STR(\"close\")));\n\tfun->Call(obj, 0, NULL);\n}\n\nv8::Handle<v8::Value> createResult(MYSQL * conn) {\n\tMYSQL_RES * res = mysql_store_result(conn);\n\t\n\tif (res) {\n\t\tv8::Handle<v8::Value> resargs[] = { v8::External::New((void *) res) };\n\t\treturn rest->GetFunction()->NewInstance(1, resargs);\n\t} else {\n\t\tif (mysql_field_count(conn)) {\n\t\t\treturn JS_EXCEPTION(MYSQL_ERROR);\n\t\t} else {\n\t\t\treturn JS_BOOL(true);\n\t\t}\n\t}\n}\n\n\/**\n * MySQL constructor does basically nothing. It just adds \"this.close()\" method to global GC\n *\/\nJS_METHOD(_mysql) {\n\tASSERT_CONSTRUCTOR;\n\tSAVE_PTR(0, NULL);\n\tGC * gc = GC_PTR;\n\tgc->add(args.This(), destroy);\n\treturn args.This();\n}\n\n\/**\n * Close DB connection\n *\/ \nJS_METHOD(_close) {\n\tMYSQL_PTR;\n\tif (conn) {\n\t\tmysql_close(conn);\n\t\tSAVE_PTR(0, NULL);\n\t}\n\treturn args.This();\n}\n\n\/**\n * Should be called ASAP: new MySQL().connect(\"host\", \"user\", \"pass\", \"db\")\n *\/ \nJS_METHOD(_connect) {\n\tif (args.Length() < 4) {\n\t\treturn JS_EXCEPTION(\"Invalid call format. Use 'mysql.connect(host, user, pass, db)'\");\n\t}\n\t\n\tMYSQL * conn;\n\t\n\tv8::String::Utf8Value host(args[0]);\n\tv8::String::Utf8Value user(args[1]);\n\tv8::String::Utf8Value pass(args[2]);\n\tv8::String::Utf8Value db(args[3]);\n\n\tconn = mysql_init(NULL);\n\tif (!mysql_real_connect(conn, *host, *user, *pass, *db, 0, NULL, CLIENT_MULTI_STATEMENTS)) {\n\t\treturn JS_EXCEPTION(MYSQL_ERROR);\n\t} else {\n\t\tmysql_query(conn, \"SET NAMES 'utf8'\");\n\t\tSAVE_PTR(0, conn);\n\t\treturn args.This();\n\t}\t\n}\n\n\/**\n * Query takes a string argument and returns an instance of Result object\n *\/ \nJS_METHOD(_query) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"No query specified\");\n\t}\n\tv8::String::Utf8Value q(args[0]);\n\t\n\tint code = mysql_real_query(conn, *q, q.length());\n\tif (code != 0) { return JS_EXCEPTION(MYSQL_ERROR); }\n\t\n\tint qc = args.This()->Get(JS_STR(\"queryCount\"))->ToInteger()->Int32Value();\n\targs.This()->Set(JS_STR(\"queryCount\"), JS_INT(qc+1));\n\t\n\treturn createResult(conn);\n}\n\n\/**\n * Fetch next result from a multi-result set\n *\/\nJS_METHOD(_nextresult) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\t\n\tint status = mysql_next_result(conn);\n\t\n\tif (status == -1) { return JS_NULL; }\n\tif (status > 0) { return JS_EXCEPTION(MYSQL_ERROR); }\n\treturn createResult(conn);\n}\n\nJS_METHOD(_affectedrows) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\treturn JS_INT(mysql_affected_rows(conn));\n}\n\nJS_METHOD(_insertid) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\treturn JS_INT(mysql_insert_id(conn));\n}\n\nJS_METHOD(_escape) {\n\tMYSQL_PTR;\n\tASSERT_CONNECTED;\n\t\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"Nothing to escape\");\n\t}\n\tv8::String::Utf8Value str(args[0]);\n\t\n\tint len = args[0]->ToString()->Utf8Length();\n\tchar * result = new char[2*len + 1];\n\t\n\n\tint length = mysql_real_escape_string(conn, result, *str, len);\n\tv8::Handle<v8::Value> output = JS_STR(result, length);\n\tdelete[] result;\n\treturn output;\n}\n\nJS_METHOD(_qualify) {\n\tif (args.Length() < 1) {\n\t\treturn JS_EXCEPTION(\"Nothing to qualify\");\n\t}\n\n\tv8::String::Utf8Value str(args[0]);\n\tstd::string result = \"`\";\n\tresult += *str;\n\tresult += \"`\";\n\t\n\tv8::Handle<v8::Value> output = JS_STR(result.c_str());\n\treturn output;\n}\n\nJS_METHOD(_result) {\n\tSAVE_VALUE(0, args[0]);\n\treturn args.This();\n}\n\nJS_METHOD(_numrows) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\treturn JS_INT(mysql_num_rows(res));\n}\n\nJS_METHOD(_numfields) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\treturn JS_INT(mysql_num_fields(res));\n}\n\nJS_METHOD(_fetchnames) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\n\tint cnt = mysql_num_fields(res);\n\tMYSQL_FIELD * fields = mysql_fetch_fields(res);\n\tv8::Handle<v8::Array> result = v8::Array::New(cnt);\n\t\n\tfor(int i = 0; i < cnt; i++) {\n\t\tresult->Set(JS_INT(i), JS_STR(fields[i].name));\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Return result data as an array of JS arrays\n *\/ \nJS_METHOD(_fetcharrays) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\tmysql_data_seek(res, 0);\n\n\tint x = mysql_num_fields(res);\n\tint y = mysql_num_rows(res);\n\tMYSQL_ROW row;\n\tv8::Handle<v8::Array> result = v8::Array::New(y);\n\t\n\tfor (int i = 0; i < y; i++) {\n\t\trow = mysql_fetch_row(res);\n\t\tv8::Handle<v8::Array> item = v8::Array::New(x);\n\t\tresult->Set(JS_INT(i), item);\n\t\tfor (int j=0; j<x; j++) {\n\t\t\tif (row[j] == NULL) {\n\t\t\t\titem->Set(JS_INT(j), v8::Null());\n\t\t\t} else {\n\t\t\t\titem->Set(JS_INT(j), JS_STR(row[j]));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn result;\n}\n\n\/**\n * Return result data as an array of JS objects, indexed with column names\n *\/ \nJS_METHOD(_fetchobjects) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\tmysql_data_seek(res, 0);\n\n\tint x = mysql_num_fields(res);\n\tint y = mysql_num_rows(res);\n\tMYSQL_FIELD * fields = mysql_fetch_fields(res);\n\tMYSQL_ROW row;\n\tv8::Handle<v8::Array> result = v8::Array::New(y);\n\t\n\tfor (int i = 0; i < y; i++) {\n\t\trow = mysql_fetch_row(res);\n\t\tv8::Handle<v8::Object> item = v8::Object::New();\n\t\tresult->Set(JS_INT(i), item);\n\t\tfor (int j=0; j<x; j++) {\n\t\t\tif (row[j] == NULL) {\n\t\t\t\titem->Set(JS_STR(fields[j].name), v8::Null());\n\t\t\t} else {\n\t\t\t\titem->Set(JS_STR(fields[j].name), JS_STR(row[j]));\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn result;\n}\n\nJS_METHOD(_result_close) {\n\tMYSQL_RES * res = LOAD_PTR(0, MYSQL_RES *);\n\tif (res) {\n\t\tmysql_free_result(res);\n\t\tSAVE_PTR(0, NULL);\n\t\treturn JS_BOOL(true);\n\t} else {\n\t\treturn JS_BOOL(false);\n\t}\n}\n\n} \/* end namespace *\/\n\nSHARED_INIT() {\n\tv8::HandleScope handle_scope;\n\tv8::Handle<v8::FunctionTemplate> ft = v8::FunctionTemplate::New(_mysql);\n\tft->SetClassName(JS_STR(\"MySQL\"));\n\n\tv8::Handle<v8::ObjectTemplate> ot = ft->InstanceTemplate();\n\tot->SetInternalFieldCount(1); \/* connection *\/\n\t\n\t\/**\n\t * Static property, useful for stats gathering\n\t *\/\n\tot->Set(JS_STR(\"queryCount\"), JS_INT(0));\n\t\t \n\tv8::Handle<v8::ObjectTemplate> pt = ft->PrototypeTemplate();\n\n\t\/**\n\t * MySQL prototype methods (new MySQL().*)\n\t *\/\n\tpt->Set(JS_STR(\"connect\"), v8::FunctionTemplate::New(_connect));\n\tpt->Set(JS_STR(\"close\"), v8::FunctionTemplate::New(_close));\n\tpt->Set(JS_STR(\"query\"), v8::FunctionTemplate::New(_query));\n\tpt->Set(JS_STR(\"nextResult\"), v8::FunctionTemplate::New(_nextresult));\n\tpt->Set(JS_STR(\"affectedRows\"), v8::FunctionTemplate::New(_affectedrows));\n\tpt->Set(JS_STR(\"escape\"), v8::FunctionTemplate::New(_escape));\n\tpt->Set(JS_STR(\"qualify\"), v8::FunctionTemplate::New(_qualify));\n\tpt->Set(JS_STR(\"insertId\"), v8::FunctionTemplate::New(_insertid));\n\t\n\trest = v8::Persistent<v8::FunctionTemplate>::New(v8::FunctionTemplate::New(_result));\n\trest->SetClassName(JS_STR(\"Result\"));\n\t\n\tv8::Handle<v8::ObjectTemplate> resinst = rest->InstanceTemplate();\n\tresinst->SetInternalFieldCount(1);\n\t\n\tv8::Handle<v8::ObjectTemplate> resproto = rest->PrototypeTemplate();\n\n\t\/**\n\t * Result prototype methods (new MySQL().query().*)\n\t *\/\n\tresproto->Set(JS_STR(\"numRows\"), v8::FunctionTemplate::New(_numrows));\n\tresproto->Set(JS_STR(\"numFields\"), v8::FunctionTemplate::New(_numfields));\n\tresproto->Set(JS_STR(\"fetchNames\"), v8::FunctionTemplate::New(_fetchnames));\n\tresproto->Set(JS_STR(\"fetchArrays\"), v8::FunctionTemplate::New(_fetcharrays));\n\tresproto->Set(JS_STR(\"fetchObjects\"), v8::FunctionTemplate::New(_fetchobjects));\n\tresproto->Set(JS_STR(\"close\"), v8::FunctionTemplate::New(_result_close));\n\n\texports->Set(JS_STR(\"MySQL\"), ft->GetFunction());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2010 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"thread.h\"\n#include <stdexcept>\n\nnamespace votca {\n namespace tools {\n\n static void *runwrapper(void *arg) {\n Thread *thread = (Thread*) (arg);\n thread->Run();\n pthread_exit(NULL);\n }\n\n Thread::Thread() {\n\n }\n\n Thread::~Thread() {\n\n }\n\n void Thread::Start() {\n pthread_attr_t attr;\n\n pthread_attr_init(&attr);\n \/*\n * according to the POSIX standard, threads are created in the joinable state\n * by default\n * however, some platforms do not obey\n *\n * explicitly create the thread in the joinable state\n * the main program can then wait for the thread by calling pthread_join(thread)\n *\n *\/\n pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n _finished = false;\n\n int rc = pthread_create(&_thread, &attr, runwrapper, (void *) this);\n if (rc) {\n throw std::runtime_error(\"ERROR; return code from pthread_create() is \"\n + rc);\n }\n\n }\n\n void Thread::WaitDone() {\n void * status;\n int rc = pthread_join(_thread, &status);\n if (rc) {\n throw std::runtime_error(\"ERROR; return code from pthread_join() is \"\n + rc);\n }\n _finished = true;\n }\n\n bool Thread::IsFinished() const {\n return _finished;\n }\n\n }\n}\n\n<commit_msg>thread.cc: fixed xlC warning<commit_after>\/*\n * Copyright 2010 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"thread.h\"\n#include <stdexcept>\n\nnamespace votca {\n namespace tools {\n\n static void *runwrapper(void *arg) {\n Thread *thread = (Thread*) (arg);\n thread->Run();\n pthread_exit(NULL);\n return NULL; \n }\n\n Thread::Thread() {\n\n }\n\n Thread::~Thread() {\n\n }\n\n void Thread::Start() {\n pthread_attr_t attr;\n\n pthread_attr_init(&attr);\n \/*\n * according to the POSIX standard, threads are created in the joinable state\n * by default\n * however, some platforms do not obey\n *\n * explicitly create the thread in the joinable state\n * the main program can then wait for the thread by calling pthread_join(thread)\n *\n *\/\n pthread_attr_setdetachstate(&attr, PTHREAD_CREATE_JOINABLE);\n _finished = false;\n\n int rc = pthread_create(&_thread, &attr, runwrapper, (void *) this);\n if (rc) {\n throw std::runtime_error(\"ERROR; return code from pthread_create() is \"\n + rc);\n }\n\n }\n\n void Thread::WaitDone() {\n void * status;\n int rc = pthread_join(_thread, &status);\n if (rc) {\n throw std::runtime_error(\"ERROR; return code from pthread_join() is \"\n + rc);\n }\n _finished = true;\n }\n\n bool Thread::IsFinished() const {\n return _finished;\n }\n\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"include\/redis_admin.h\"\n\n\n\/\/TO-DO: When an operation fails, it should automatically detect whether there are\n\/\/Sentinels available and, if so, try to failover to another Redis Node.\n\n\nvoid RedisAdmin::init(std::string hostname, int port, int timeout_seconds, int timeout_microseconds)\n{\n struct timeval timeout = {timeout_seconds, timeout_microseconds};\n c = redisConnectWithTimeout(hostname.c_str(), port, timeout);\n\n if (c == NULL || c->err) {\n if (c == NULL)\n {\n throw RedisConnectionException( \"Error: Cannot Allocate Redis Instance\" );\n }\n else if (c->err)\n {\n std::string err_msg (c->errstr);\n err_msg = \"Error:\" + err_msg;\n throw RedisConnectionException( err_msg );\n }\n exit(1);\n }\n}\n\nRedisAdmin::RedisAdmin(std::string hostname, int port)\n{\n init(hostname, port, 5, 0);\n}\n\nRedisAdmin::RedisAdmin(std::string hostname, int port, int timeout_seconds, int timeout_microseconds)\n{\n init(hostname, port, timeout_seconds, timeout_microseconds);\n}\n\nRedisAdmin::~RedisAdmin()\n{\n if (c)\n {\n delete c;\n }\n if (reply)\n {\n delete reply;\n }\n}\n\n\/\/! Load a value from Redis\nstd::string RedisAdmin::load ( std::string key )\n{\n std::string key_str = \"GET \" + key;\n reply = (redisReply *) redisCommand(c, key_str.c_str());\n std::string reply_str (reply->str);\n freeReplyObject(reply);\n return reply_str;\n}\n\n\/\/! Save a value to Redis\nbool RedisAdmin::save ( std::string key, std::string msg )\n{\n reply = (redisReply *) redisCommand( c, \"SET %s %s\", key.c_str(), msg.c_str() );\n bool ret_val = false;\n if ( strcmp(reply->str, \"OK\") == 0 ) {\n ret_val = true;\n }\n freeReplyObject(reply);\n return ret_val;\n}\n\n\/\/! Does a key exist in Redis?\nbool RedisAdmin::exists ( std::string key )\n{\n std::string key_str = \"EXISTS \" + key;\n reply = (redisReply *) redisCommand(c, key_str.c_str());\n int reply_code = reply->integer;\n freeReplyObject(reply);\n if (reply_code == 1) {\n return true;\n }\n return false;\n}\n\n\/\/! Delete a value from Redis\nbool RedisAdmin::del ( std::string key )\n{\n std::string key_str = \"DEL \" + key;\n reply = (redisReply *) redisCommand( c, key_str.c_str() );\n freeReplyObject(reply);\n if (reply->integer > 0) {\n return true;\n }\n return false;\n}\n\n\/\/! Expire a value in Redis after a specified number of seconds\nbool RedisAdmin::expire ( std::string key, unsigned int second)\n{\n std::string length_key = std::to_string(second);\n reply = (redisReply *) redisCommand( c, \"EXPIRE %s %s\", key.c_str(), length_key.c_str() );\n freeReplyObject(reply);\n if (reply->integer == 1) {\n return true;\n }\n return false;\n}\n<commit_msg>Redis Admin Rewrite Fixes<commit_after>#include \"include\/redis_admin.h\"\n\n\n\/\/TO-DO: When an operation fails, it should automatically detect whether there are\n\/\/Sentinels available and, if so, try to failover to another Redis Node.\n\n\nvoid RedisAdmin::init(std::string hostname, int port, int timeout_seconds, int timeout_microseconds)\n{\n struct timeval timeout = {timeout_seconds, timeout_microseconds};\n c = redisConnectWithTimeout(hostname.c_str(), port, timeout);\n\n if (c == NULL || c->err) {\n if (c == NULL)\n {\n throw RedisConnectionException( \"Error: Cannot Allocate Redis Instance\" );\n }\n else if (c->err)\n {\n std::string err_msg (c->errstr);\n err_msg = \"Error:\" + err_msg;\n throw RedisConnectionException( err_msg );\n }\n exit(1);\n }\n}\n\nRedisAdmin::RedisAdmin(std::string hostname, int port)\n{\n init(hostname, port, 5, 0);\n}\n\nRedisAdmin::RedisAdmin(std::string hostname, int port, int timeout_seconds, int timeout_microseconds)\n{\n init(hostname, port, timeout_seconds, timeout_microseconds);\n}\n\nRedisAdmin::~RedisAdmin()\n{\n if (c)\n {\n redisFree(c);\n }\n if (reply)\n {\n freeReplyObject(reply);\n }\n}\n\n\/\/! Load a value from Redis\nstd::string RedisAdmin::load ( std::string key )\n{\n std::string key_str = \"GET \" + key;\n reply = (redisReply *) redisCommand(c, key_str.c_str());\n std::string reply_str (reply->str);\n freeReplyObject(reply);\n return reply_str;\n}\n\n\/\/! Save a value to Redis\nbool RedisAdmin::save ( std::string key, std::string msg )\n{\n reply = (redisReply *) redisCommand( c, \"SET %s %s\", key.c_str(), msg.c_str() );\n bool ret_val = false;\n if ( strcmp(reply->str, \"OK\") == 0 ) {\n ret_val = true;\n }\n freeReplyObject(reply);\n return ret_val;\n}\n\n\/\/! Does a key exist in Redis?\nbool RedisAdmin::exists ( std::string key )\n{\n std::string key_str = \"EXISTS \" + key;\n reply = (redisReply *) redisCommand(c, key_str.c_str());\n int reply_code = reply->integer;\n freeReplyObject(reply);\n if (reply_code == 1) {\n return true;\n }\n return false;\n}\n\n\/\/! Delete a value from Redis\nbool RedisAdmin::del ( std::string key )\n{\n std::string key_str = \"DEL \" + key;\n reply = (redisReply *) redisCommand( c, key_str.c_str() );\n freeReplyObject(reply);\n if (reply->integer > 0) {\n return true;\n }\n return false;\n}\n\n\/\/! Expire a value in Redis after a specified number of seconds\nbool RedisAdmin::expire ( std::string key, unsigned int second)\n{\n std::string length_key = std::to_string(second);\n reply = (redisReply *) redisCommand( c, \"EXPIRE %s %s\", key.c_str(), length_key.c_str() );\n freeReplyObject(reply);\n if (reply->integer == 1) {\n return true;\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n mapMain.cpp\n\n (c) 2009 - Aaron Quinlan\n Hall Laboratory\n Department of Biochemistry and Molecular Genetics\n University of Virginia\n aaronquinlan@gmail.com\n\n Licenced under the GNU General Public License 2.0 license.\n******************************************************************************\/\n#include \"mapBed.h\"\n#include \"version.h\"\n\nusing namespace std;\n\n\/\/ define our program name\n#define PROGRAM_NAME \"bedtools map\"\n\n\n\/\/ define our parameter checking macro\n#define PARAMETER_CHECK(param, paramLen, actualLen) (strncmp(argv[i], param, min(actualLen, paramLen))== 0) && (actualLen == paramLen)\n\n\/\/ function declarations\nvoid map_help(void);\n\nint map_main(int argc, char* argv[]) {\n\n \/\/ our configuration variables\n bool showHelp = false;\n\n \/\/ input files\n string bedAFile;\n string bedBFile;\n int column = 5;\n string operation = \"sum\";\n string nullValue = \".\";\n\n \/\/ input arguments\n float overlapFraction = 1E-9;\n\n bool haveBedA = false;\n bool haveBedB = false;\n bool haveColumn = false;\n bool haveOperation = false;\n bool haveFraction = false;\n bool reciprocalFraction = false;\n bool sameStrand = false;\n bool diffStrand = false;\n bool printHeader = false;\n\n \/\/ check to see if we should print out some help\n if(argc <= 1) showHelp = true;\n\n for(int i = 1; i < argc; i++) {\n int parameterLength = (int)strlen(argv[i]);\n\n if((PARAMETER_CHECK(\"-h\", 2, parameterLength)) ||\n (PARAMETER_CHECK(\"--help\", 5, parameterLength))) {\n showHelp = true;\n }\n }\n\n if(showHelp) map_help();\n\n \/\/ do some parsing (all of these parameters require 2 strings)\n for(int i = 1; i < argc; i++) {\n\n int parameterLength = (int)strlen(argv[i]);\n\n if(PARAMETER_CHECK(\"-a\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveBedA = true;\n bedAFile = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-b\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveBedB = true;\n bedBFile = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-c\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveColumn = true;\n column = atoi(argv[i + 1]);\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-o\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveOperation = true;\n operation = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-f\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveFraction = true;\n overlapFraction = atof(argv[i + 1]);\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-r\", 2, parameterLength)) {\n reciprocalFraction = true;\n }\n else if (PARAMETER_CHECK(\"-s\", 2, parameterLength)) {\n sameStrand = true;\n }\n else if (PARAMETER_CHECK(\"-S\", 2, parameterLength)) {\n diffStrand = true;\n }\n else if (PARAMETER_CHECK(\"-null\", 5, parameterLength)) {\n nullValue = argv[i + 1];\n i++;\n }\n else if(PARAMETER_CHECK(\"-header\", 7, parameterLength)) {\n printHeader = true;\n }\n else {\n cerr << endl << \"*****ERROR: Unrecognized parameter: \" << argv[i] << \" *****\" << endl << endl;\n showHelp = true;\n }\n }\n\n \/\/ make sure we have both input files\n if (!haveBedA || !haveBedB) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: Need -a and -b files. \" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (reciprocalFraction && !haveFraction) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: If using -r, you need to define -f.\" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (sameStrand && diffStrand) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: Request either -s OR -S, not both.\" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (!showHelp) {\n\n BedMap *bm = new BedMap(bedAFile, bedBFile, column, operation,\n overlapFraction, sameStrand,\n diffStrand, reciprocalFraction,\n nullValue, printHeader);\n delete bm;\n return 0;\n }\n else {\n map_help();\n return 0;\n }\n}\n\nvoid map_help(void) {\n\n cerr << \"\\nTool: bedtools map (aka mapBed)\" << endl;\n cerr << \"Version: \" << VERSION << \"\\n\"; \n cerr << \"Summary: Apply a function to a column from B intervals that overlap A.\" << endl << endl;\n\n cerr << \"Usage: \" << PROGRAM_NAME << \" [OPTIONS] -a <bed\/gff\/vcf> -b <bed\/gff\/vcf>\" << endl << endl;\n\n cerr << \"Options: \" << endl;\n\n cerr << \"\\t-c\\t\" << \"Specify the column from the B file to map onto intervaks in A.\" << endl;\n cerr << \"\\t\\t - Default = 4.\" << endl << endl;\n\n cerr << \"\\t-o\\t\" << \"Specify the operation that should be applied to -c.\" << endl;\n cerr << \"\\t\\t Valid operations:\" << endl;\n cerr << \"\\t\\t sum, min, max,\" << endl;\n cerr << \"\\t\\t mean, median,\" << endl;\n cerr << \"\\t\\t collapse (i.e., print a comma separated list (duplicates allowed)), \" << endl;\n cerr << \"\\t\\t distinct (i.e., print a comma separated list (NO duplicates allowed)), \" << endl;\n cerr << \"\\t\\t count\" << endl;\n cerr << \"\\t\\t count_distinct (i.e., a count of the unique values in the column), \" << endl;\n cerr << \"\\t\\t- Default: sum\" << endl << endl;\n\n cerr << \"\\t-f\\t\" << \"Minimum overlap required as a fraction of A.\" << endl;\n cerr << \"\\t\\t- Default is 1E-9 (i.e., 1bp).\" << endl;\n cerr << \"\\t\\t- FLOAT (e.g. 0.50)\" << endl << endl;\n \n cerr << \"\\t-r\\t\" << \"Require that the fraction overlap be reciprocal for A and B.\" << endl;\n cerr << \"\\t\\t- In other words, if -f is 0.90 and -r is used, this requires\" << endl;\n cerr << \"\\t\\t that B overlap 90% of A and A _also_ overlaps 90% of B.\" << endl << endl;\n \n cerr << \"\\t-s\\t\" << \"Require same strandedness. That is, only report hits in B\" << endl;\n cerr << \"\\t\\tthat overlap A on the _same_ strand.\" << endl;\n cerr << \"\\t\\t- By default, overlaps are reported without respect to strand.\" << endl << endl;\n \n cerr << \"\\t-S\\t\" << \"Require different strandedness. That is, only report hits in B\" << endl;\n cerr << \"\\t\\tthat overlap A on the _opposite_ strand.\" << endl;\n cerr << \"\\t\\t- By default, overlaps are reported without respect to strand.\" << endl << endl;\n\n cerr << \"\\t-null\\t\" << \"The value to print if no overlaps are found for an A interval.\" << endl;\n cerr << \"\\t\\t- Default - \\\".\\\"\" << endl << endl;\n\n cerr << \"\\t-header\\t\" << \"Print the header from the A file prior to results.\" << endl << endl;\n \n \/\/ end the program here\n exit(1);\n\n}\n<commit_msg>Fixed typo. Thanks @daler.<commit_after>\/*****************************************************************************\n mapMain.cpp\n\n (c) 2009 - Aaron Quinlan\n Hall Laboratory\n Department of Biochemistry and Molecular Genetics\n University of Virginia\n aaronquinlan@gmail.com\n\n Licenced under the GNU General Public License 2.0 license.\n******************************************************************************\/\n#include \"mapBed.h\"\n#include \"version.h\"\n\nusing namespace std;\n\n\/\/ define our program name\n#define PROGRAM_NAME \"bedtools map\"\n\n\n\/\/ define our parameter checking macro\n#define PARAMETER_CHECK(param, paramLen, actualLen) (strncmp(argv[i], param, min(actualLen, paramLen))== 0) && (actualLen == paramLen)\n\n\/\/ function declarations\nvoid map_help(void);\n\nint map_main(int argc, char* argv[]) {\n\n \/\/ our configuration variables\n bool showHelp = false;\n\n \/\/ input files\n string bedAFile;\n string bedBFile;\n int column = 5;\n string operation = \"sum\";\n string nullValue = \".\";\n\n \/\/ input arguments\n float overlapFraction = 1E-9;\n\n bool haveBedA = false;\n bool haveBedB = false;\n bool haveColumn = false;\n bool haveOperation = false;\n bool haveFraction = false;\n bool reciprocalFraction = false;\n bool sameStrand = false;\n bool diffStrand = false;\n bool printHeader = false;\n\n \/\/ check to see if we should print out some help\n if(argc <= 1) showHelp = true;\n\n for(int i = 1; i < argc; i++) {\n int parameterLength = (int)strlen(argv[i]);\n\n if((PARAMETER_CHECK(\"-h\", 2, parameterLength)) ||\n (PARAMETER_CHECK(\"--help\", 5, parameterLength))) {\n showHelp = true;\n }\n }\n\n if(showHelp) map_help();\n\n \/\/ do some parsing (all of these parameters require 2 strings)\n for(int i = 1; i < argc; i++) {\n\n int parameterLength = (int)strlen(argv[i]);\n\n if(PARAMETER_CHECK(\"-a\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveBedA = true;\n bedAFile = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-b\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveBedB = true;\n bedBFile = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-c\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveColumn = true;\n column = atoi(argv[i + 1]);\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-o\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveOperation = true;\n operation = argv[i + 1];\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-f\", 2, parameterLength)) {\n if ((i+1) < argc) {\n haveFraction = true;\n overlapFraction = atof(argv[i + 1]);\n i++;\n }\n }\n else if(PARAMETER_CHECK(\"-r\", 2, parameterLength)) {\n reciprocalFraction = true;\n }\n else if (PARAMETER_CHECK(\"-s\", 2, parameterLength)) {\n sameStrand = true;\n }\n else if (PARAMETER_CHECK(\"-S\", 2, parameterLength)) {\n diffStrand = true;\n }\n else if (PARAMETER_CHECK(\"-null\", 5, parameterLength)) {\n nullValue = argv[i + 1];\n i++;\n }\n else if(PARAMETER_CHECK(\"-header\", 7, parameterLength)) {\n printHeader = true;\n }\n else {\n cerr << endl << \"*****ERROR: Unrecognized parameter: \" << argv[i] << \" *****\" << endl << endl;\n showHelp = true;\n }\n }\n\n \/\/ make sure we have both input files\n if (!haveBedA || !haveBedB) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: Need -a and -b files. \" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (reciprocalFraction && !haveFraction) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: If using -r, you need to define -f.\" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (sameStrand && diffStrand) {\n cerr << endl << \"*****\" << endl << \"*****ERROR: Request either -s OR -S, not both.\" << endl << \"*****\" << endl;\n showHelp = true;\n }\n\n if (!showHelp) {\n\n BedMap *bm = new BedMap(bedAFile, bedBFile, column, operation,\n overlapFraction, sameStrand,\n diffStrand, reciprocalFraction,\n nullValue, printHeader);\n delete bm;\n return 0;\n }\n else {\n map_help();\n return 0;\n }\n}\n\nvoid map_help(void) {\n\n cerr << \"\\nTool: bedtools map (aka mapBed)\" << endl;\n cerr << \"Version: \" << VERSION << \"\\n\"; \n cerr << \"Summary: Apply a function to a column from B intervals that overlap A.\" << endl << endl;\n\n cerr << \"Usage: \" << PROGRAM_NAME << \" [OPTIONS] -a <bed\/gff\/vcf> -b <bed\/gff\/vcf>\" << endl << endl;\n\n cerr << \"Options: \" << endl;\n\n cerr << \"\\t-c\\t\" << \"Specify the column from the B file to map onto intervals in A.\" << endl;\n cerr << \"\\t\\t - Default = 4.\" << endl << endl;\n\n cerr << \"\\t-o\\t\" << \"Specify the operation that should be applied to -c.\" << endl;\n cerr << \"\\t\\t Valid operations:\" << endl;\n cerr << \"\\t\\t sum, min, max,\" << endl;\n cerr << \"\\t\\t mean, median,\" << endl;\n cerr << \"\\t\\t collapse (i.e., print a comma separated list (duplicates allowed)), \" << endl;\n cerr << \"\\t\\t distinct (i.e., print a comma separated list (NO duplicates allowed)), \" << endl;\n cerr << \"\\t\\t count\" << endl;\n cerr << \"\\t\\t count_distinct (i.e., a count of the unique values in the column), \" << endl;\n cerr << \"\\t\\t- Default: sum\" << endl << endl;\n\n cerr << \"\\t-f\\t\" << \"Minimum overlap required as a fraction of A.\" << endl;\n cerr << \"\\t\\t- Default is 1E-9 (i.e., 1bp).\" << endl;\n cerr << \"\\t\\t- FLOAT (e.g. 0.50)\" << endl << endl;\n \n cerr << \"\\t-r\\t\" << \"Require that the fraction overlap be reciprocal for A and B.\" << endl;\n cerr << \"\\t\\t- In other words, if -f is 0.90 and -r is used, this requires\" << endl;\n cerr << \"\\t\\t that B overlap 90% of A and A _also_ overlaps 90% of B.\" << endl << endl;\n \n cerr << \"\\t-s\\t\" << \"Require same strandedness. That is, only report hits in B\" << endl;\n cerr << \"\\t\\tthat overlap A on the _same_ strand.\" << endl;\n cerr << \"\\t\\t- By default, overlaps are reported without respect to strand.\" << endl << endl;\n \n cerr << \"\\t-S\\t\" << \"Require different strandedness. That is, only report hits in B\" << endl;\n cerr << \"\\t\\tthat overlap A on the _opposite_ strand.\" << endl;\n cerr << \"\\t\\t- By default, overlaps are reported without respect to strand.\" << endl << endl;\n\n cerr << \"\\t-null\\t\" << \"The value to print if no overlaps are found for an A interval.\" << endl;\n cerr << \"\\t\\t- Default - \\\".\\\"\" << endl << endl;\n\n cerr << \"\\t-header\\t\" << \"Print the header from the A file prior to results.\" << endl << endl;\n \n \/\/ end the program here\n exit(1);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright 2013-present Barefoot Networks, Inc.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include <sstream>\n\n#include <algorithm>\n#include \"source_file.h\"\n#include \"exceptions.h\"\n#include \"lib\/log.h\"\n\nvoid IHasDbPrint::print() const { dbprint(std::cout); std::cout << std::endl; }\n\nnamespace Util {\nSourcePosition::SourcePosition(unsigned lineNumber, unsigned columnNumber)\n : lineNumber(lineNumber),\n columnNumber(columnNumber) {\n if (lineNumber == 0)\n BUG(\"Line numbering should start at one\");\n}\n\ncstring SourcePosition::toString() const {\n return Util::printf_format(\"%d:%d\", lineNumber, columnNumber);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSourceInfo::SourceInfo(const InputSources* sources, SourcePosition start,\n SourcePosition end)\n : sources(sources), start(start), end(end) {\n BUG_CHECK(sources != nullptr, \"Invalid InputSources in SourceInfo\");\n if (!start.isValid() || !end.isValid())\n BUG(\"Invalid source position in SourceInfo %1%-%2%\",\n start.toString(), end.toString());\n if (start > end)\n BUG(\"SourceInfo position start %1% after end %2%\",\n start.toString(), end.toString());\n}\n\ncstring SourceInfo::toDebugString() const {\n return Util::printf_format(\"(%s)-(%s)\", start.toString(), end.toString());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nInputSources::InputSources() : sealed(false) {\n mapLine(nullptr, 1); \/\/ the first line read will be line 1 of stdin\n contents.push_back(\"\");\n}\n\nvoid InputSources::addComment(SourceInfo srcInfo, bool singleLine, cstring body) {\n if (!singleLine)\n \/\/ Drop the \"*\/\"\n body = body.exceptLast(2);\n auto comment = new Comment(srcInfo, singleLine, body);\n comments.push_back(comment);\n}\n\n\/\/\/ prevent further changes\nvoid InputSources::seal() {\n LOG4(toDebugString());\n if (sealed)\n BUG(\"InputSources already sealed\");\n sealed = true;\n}\n\nunsigned InputSources::lineCount() const {\n int size = contents.size();\n if (contents.back().empty()) {\n \/\/ do not count the last line if it is empty.\n size -= 1;\n if (size < 0)\n BUG(\"Negative line count\");\n }\n return size;\n}\n\n\/\/ Append this text to the last line\nvoid InputSources::appendToLastLine(StringRef text) {\n if (sealed)\n BUG(\"Appending to sealed InputSources\");\n \/\/ Text should not contain any newline characters\n for (size_t i = 0; i < text.len; i++) {\n char c = text[i];\n if (c == '\\n')\n BUG(\"Text contains newlines\");\n }\n contents.back() += text.toString();\n}\n\n\/\/ Append a newline and start a new line\nvoid InputSources::appendNewline(StringRef newline) {\n if (sealed)\n BUG(\"Appending to sealed InputSources\");\n contents.back() += newline.toString();\n contents.push_back(\"\"); \/\/ start a new line\n}\n\nvoid InputSources::appendText(const char* text) {\n if (text == nullptr)\n BUG(\"Null text being appended\");\n StringRef ref = text;\n\n while (ref.len > 0) {\n const char* nl = ref.find(\"\\r\\n\");\n if (nl == nullptr) {\n appendToLastLine(ref);\n break;\n }\n\n size_t toCut = nl - ref.p;\n if (toCut != 0) {\n StringRef nonnl(ref.p, toCut);\n appendToLastLine(nonnl);\n ref += toCut;\n } else {\n if (ref[0] == '\\n') {\n appendNewline(\"\\n\");\n ref += 1;\n } else if (ref.len > 2 && ref[0] == '\\r' && ref[1] == '\\n') {\n appendNewline(\"\\r\\n\");\n ref += 2;\n } else {\n \/\/ Just \\r\n appendToLastLine(ref.substr(0, 1));\n ref += 1;\n }\n }\n }\n}\n\ncstring InputSources::getLine(unsigned lineNumber) const {\n if (lineNumber == 0) {\n return \"\";\n \/\/ BUG(\"Lines are numbered starting at 1\");\n \/\/ don't throw: this code may be called by exceptions\n \/\/ reporting on elements that have no source position\n }\n return contents.at(lineNumber - 1);\n}\n\nvoid InputSources::mapLine(cstring file, unsigned originalSourceLineNo) {\n if (sealed)\n BUG(\"Changing mapping to sealed InputSources\");\n unsigned lineno = getCurrentLineNumber();\n line_file_map.emplace(lineno, SourceFileLine(file, originalSourceLineNo));\n}\n\nSourceFileLine InputSources::getSourceLine(unsigned line) const {\n auto it = line_file_map.upper_bound(line+1);\n if (it == line_file_map.begin())\n \/\/ There must be always something mapped to line 0\n BUG(\"No source information for line %1%\", line);\n LOG3(line << \" mapped to \" << it->first << \",\" << it->second.toString());\n --it;\n LOG3(line << \" corrected to \" << it->first << \",\" << it->second.toString());\n \/\/ For a source file such as\n \/\/ ----------\n \/\/ # 1 \"x.p4\"\n \/\/ parser start { }\n \/\/ ----------\n \/\/ The first line indicates that line 2 is the first line in x.p4\n \/\/ line=2, it->first=1, it->second.sourceLine=1\n \/\/ So we have to subtract one to get the real line number.\n const auto nominalLine = line - it->first + it->second.sourceLine;\n const auto realLine = nominalLine > 0 ? nominalLine - 1 : 0;\n return SourceFileLine(it->second.fileName, realLine);\n}\n\nunsigned InputSources::getCurrentLineNumber() const {\n return contents.size();\n}\n\nSourcePosition InputSources::getCurrentPosition() const {\n unsigned line = getCurrentLineNumber();\n unsigned column = contents.back().size();\n return SourcePosition(line, column);\n}\n\ncstring InputSources::getSourceFragment(const SourcePosition &position) const {\n SourceInfo info(this, position, position);\n return getSourceFragment(info);\n}\n\ncstring carets(cstring source, unsigned start, unsigned end) {\n std::stringstream builder;\n if (start > source.size())\n start = source.size();\n\n unsigned i;\n for (i=0; i < start; i++) {\n char c = source.c_str()[i];\n if (c == ' ' || c == '\\t')\n builder.put(c);\n else\n builder.put(' ');\n }\n\n for (; i < std::max(end, start+1); i++)\n builder.put('^');\n\n return builder.str();\n}\n\ncstring InputSources::getSourceFragment(const SourceInfo &position) const {\n if (!position.isValid())\n return \"\";\n\n \/\/ If the position spans multiple lines, truncate to just the first line\n if (position.getEnd().getLineNumber() > position.getStart().getLineNumber())\n return getSourceFragment(position.getStart());\n\n cstring result = getLine(position.getStart().getLineNumber());\n \/\/ Normally result has a newline, but if not\n \/\/ then we have to add a newline\n cstring toadd = \"\";\n if (result.find('\\n') == nullptr)\n toadd = cstring::newline;\n cstring marker = carets(result, position.getStart().getColumnNumber(),\n position.getEnd().getColumnNumber());\n return result + toadd + marker + cstring::newline;\n}\n\ncstring InputSources::getBriefSourceFragment(const SourceInfo &position) const {\n if (!position.isValid())\n return \"\";\n\n cstring result = getLine(position.getStart().getLineNumber());\n unsigned int start = position.getStart().getColumnNumber();\n unsigned int end;\n cstring toadd = \"\";\n\n \/\/ If the position spans multiple lines, truncate to just the first line\n if (position.getEnd().getLineNumber() > position.getStart().getLineNumber()) {\n \/\/ go to the end of the first line\n end = result.size();\n if (result.find('\\n') != nullptr) {\n --end;\n }\n toadd = \" ...\";\n } else {\n end = position.getEnd().getColumnNumber();\n }\n\n \/\/ Adding escape character in front of '\"' character to properly store\n \/\/ quote marks as part of JSON properties, they must be escaped.\n if (result.find('\"') != nullptr) {\n cstring out = result.replace(\"\\\"\", \"\\\\\\\"\");\n return out.substr(0, out.size()-1);\n }\n\n return result.substr(start, end - start) + toadd;\n}\n\ncstring InputSources::toDebugString() const {\n std::stringstream builder;\n for (auto line : contents)\n builder << line;\n builder << \"---------------\" << std::endl;\n for (auto lf : line_file_map)\n builder << lf.first << \": \" << lf.second.toString() << std::endl;\n return cstring(builder.str());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncstring SourceInfo::toSourceFragment() const {\n if (!isValid())\n return \"\";\n return sources->getSourceFragment(*this);\n}\n\ncstring SourceInfo::toBriefSourceFragment() const {\n if (!isValid())\n return \"\";\n return sources->getBriefSourceFragment(*this);\n}\n\ncstring SourceInfo::toPositionString() const {\n if (!isValid())\n return \"\";\n SourceFileLine position = sources->getSourceLine(start.getLineNumber());\n return position.toString();\n}\n\ncstring SourceInfo::toSourcePositionData(unsigned *outLineNumber,\n unsigned *outColumnNumber) const {\n SourceFileLine position = sources->getSourceLine(start.getLineNumber());\n if (outLineNumber != nullptr) {\n *outLineNumber = position.sourceLine;\n }\n if (outColumnNumber != nullptr) {\n *outColumnNumber = start.getColumnNumber();\n }\n return position.fileName.c_str();\n}\n\nSourceFileLine SourceInfo::toPosition() const {\n return sources->getSourceLine(start.getLineNumber());\n}\n\ncstring SourceInfo::getSourceFile() const {\n auto sourceLine = sources->getSourceLine(start.getLineNumber());\n return sourceLine.fileName;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncstring SourceFileLine::toString() const {\n return Util::printf_format(\"%s(%d)\", fileName.c_str(), sourceLine);\n}\n\n} \/\/ namespace Util\n<commit_msg>Fix off-by-one bug in source file position calculation (#3124)<commit_after>\/*\nCopyright 2013-present Barefoot Networks, Inc.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include <sstream>\n\n#include <algorithm>\n#include \"source_file.h\"\n#include \"exceptions.h\"\n#include \"lib\/log.h\"\n\nvoid IHasDbPrint::print() const { dbprint(std::cout); std::cout << std::endl; }\n\nnamespace Util {\nSourcePosition::SourcePosition(unsigned lineNumber, unsigned columnNumber)\n : lineNumber(lineNumber),\n columnNumber(columnNumber) {\n if (lineNumber == 0)\n BUG(\"Line numbering should start at one\");\n}\n\ncstring SourcePosition::toString() const {\n return Util::printf_format(\"%d:%d\", lineNumber, columnNumber);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSourceInfo::SourceInfo(const InputSources* sources, SourcePosition start,\n SourcePosition end)\n : sources(sources), start(start), end(end) {\n BUG_CHECK(sources != nullptr, \"Invalid InputSources in SourceInfo\");\n if (!start.isValid() || !end.isValid())\n BUG(\"Invalid source position in SourceInfo %1%-%2%\",\n start.toString(), end.toString());\n if (start > end)\n BUG(\"SourceInfo position start %1% after end %2%\",\n start.toString(), end.toString());\n}\n\ncstring SourceInfo::toDebugString() const {\n return Util::printf_format(\"(%s)-(%s)\", start.toString(), end.toString());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nInputSources::InputSources() : sealed(false) {\n mapLine(nullptr, 1); \/\/ the first line read will be line 1 of stdin\n contents.push_back(\"\");\n}\n\nvoid InputSources::addComment(SourceInfo srcInfo, bool singleLine, cstring body) {\n if (!singleLine)\n \/\/ Drop the \"*\/\"\n body = body.exceptLast(2);\n auto comment = new Comment(srcInfo, singleLine, body);\n comments.push_back(comment);\n}\n\n\/\/\/ prevent further changes\nvoid InputSources::seal() {\n LOG4(toDebugString());\n if (sealed)\n BUG(\"InputSources already sealed\");\n sealed = true;\n}\n\nunsigned InputSources::lineCount() const {\n int size = contents.size();\n if (contents.back().empty()) {\n \/\/ do not count the last line if it is empty.\n size -= 1;\n if (size < 0)\n BUG(\"Negative line count\");\n }\n return size;\n}\n\n\/\/ Append this text to the last line\nvoid InputSources::appendToLastLine(StringRef text) {\n if (sealed)\n BUG(\"Appending to sealed InputSources\");\n \/\/ Text should not contain any newline characters\n for (size_t i = 0; i < text.len; i++) {\n char c = text[i];\n if (c == '\\n')\n BUG(\"Text contains newlines\");\n }\n contents.back() += text.toString();\n}\n\n\/\/ Append a newline and start a new line\nvoid InputSources::appendNewline(StringRef newline) {\n if (sealed)\n BUG(\"Appending to sealed InputSources\");\n contents.back() += newline.toString();\n contents.push_back(\"\"); \/\/ start a new line\n}\n\nvoid InputSources::appendText(const char* text) {\n if (text == nullptr)\n BUG(\"Null text being appended\");\n StringRef ref = text;\n\n while (ref.len > 0) {\n const char* nl = ref.find(\"\\r\\n\");\n if (nl == nullptr) {\n appendToLastLine(ref);\n break;\n }\n\n size_t toCut = nl - ref.p;\n if (toCut != 0) {\n StringRef nonnl(ref.p, toCut);\n appendToLastLine(nonnl);\n ref += toCut;\n } else {\n if (ref[0] == '\\n') {\n appendNewline(\"\\n\");\n ref += 1;\n } else if (ref.len > 2 && ref[0] == '\\r' && ref[1] == '\\n') {\n appendNewline(\"\\r\\n\");\n ref += 2;\n } else {\n \/\/ Just \\r\n appendToLastLine(ref.substr(0, 1));\n ref += 1;\n }\n }\n }\n}\n\ncstring InputSources::getLine(unsigned lineNumber) const {\n if (lineNumber == 0) {\n return \"\";\n \/\/ BUG(\"Lines are numbered starting at 1\");\n \/\/ don't throw: this code may be called by exceptions\n \/\/ reporting on elements that have no source position\n }\n return contents.at(lineNumber - 1);\n}\n\nvoid InputSources::mapLine(cstring file, unsigned originalSourceLineNo) {\n if (sealed)\n BUG(\"Changing mapping to sealed InputSources\");\n unsigned lineno = getCurrentLineNumber();\n line_file_map.emplace(lineno, SourceFileLine(file, originalSourceLineNo));\n}\n\nSourceFileLine InputSources::getSourceLine(unsigned line) const {\n auto it = line_file_map.upper_bound(line);\n if (it == line_file_map.begin())\n \/\/ There must be always something mapped to line 0\n BUG(\"No source information for line %1%\", line);\n LOG3(line << \" mapped to \" << it->first << \",\" << it->second.toString());\n --it;\n LOG3(line << \" corrected to \" << it->first << \",\" << it->second.toString());\n \/\/ For a source file such as\n \/\/ ----------\n \/\/ # 1 \"x.p4\"\n \/\/ parser start { }\n \/\/ ----------\n \/\/ The first line indicates that line 2 is the first line in x.p4\n \/\/ line=2, it->first=1, it->second.sourceLine=1\n \/\/ So we have to subtract one to get the real line number.\n const auto nominalLine = line - it->first + it->second.sourceLine;\n const auto realLine = nominalLine > 0 ? nominalLine - 1 : 0;\n return SourceFileLine(it->second.fileName, realLine);\n}\n\nunsigned InputSources::getCurrentLineNumber() const {\n return contents.size();\n}\n\nSourcePosition InputSources::getCurrentPosition() const {\n unsigned line = getCurrentLineNumber();\n unsigned column = contents.back().size();\n return SourcePosition(line, column);\n}\n\ncstring InputSources::getSourceFragment(const SourcePosition &position) const {\n SourceInfo info(this, position, position);\n return getSourceFragment(info);\n}\n\ncstring carets(cstring source, unsigned start, unsigned end) {\n std::stringstream builder;\n if (start > source.size())\n start = source.size();\n\n unsigned i;\n for (i=0; i < start; i++) {\n char c = source.c_str()[i];\n if (c == ' ' || c == '\\t')\n builder.put(c);\n else\n builder.put(' ');\n }\n\n for (; i < std::max(end, start+1); i++)\n builder.put('^');\n\n return builder.str();\n}\n\ncstring InputSources::getSourceFragment(const SourceInfo &position) const {\n if (!position.isValid())\n return \"\";\n\n \/\/ If the position spans multiple lines, truncate to just the first line\n if (position.getEnd().getLineNumber() > position.getStart().getLineNumber())\n return getSourceFragment(position.getStart());\n\n cstring result = getLine(position.getStart().getLineNumber());\n \/\/ Normally result has a newline, but if not\n \/\/ then we have to add a newline\n cstring toadd = \"\";\n if (result.find('\\n') == nullptr)\n toadd = cstring::newline;\n cstring marker = carets(result, position.getStart().getColumnNumber(),\n position.getEnd().getColumnNumber());\n return result + toadd + marker + cstring::newline;\n}\n\ncstring InputSources::getBriefSourceFragment(const SourceInfo &position) const {\n if (!position.isValid())\n return \"\";\n\n cstring result = getLine(position.getStart().getLineNumber());\n unsigned int start = position.getStart().getColumnNumber();\n unsigned int end;\n cstring toadd = \"\";\n\n \/\/ If the position spans multiple lines, truncate to just the first line\n if (position.getEnd().getLineNumber() > position.getStart().getLineNumber()) {\n \/\/ go to the end of the first line\n end = result.size();\n if (result.find('\\n') != nullptr) {\n --end;\n }\n toadd = \" ...\";\n } else {\n end = position.getEnd().getColumnNumber();\n }\n\n \/\/ Adding escape character in front of '\"' character to properly store\n \/\/ quote marks as part of JSON properties, they must be escaped.\n if (result.find('\"') != nullptr) {\n cstring out = result.replace(\"\\\"\", \"\\\\\\\"\");\n return out.substr(0, out.size()-1);\n }\n\n return result.substr(start, end - start) + toadd;\n}\n\ncstring InputSources::toDebugString() const {\n std::stringstream builder;\n for (auto line : contents)\n builder << line;\n builder << \"---------------\" << std::endl;\n for (auto lf : line_file_map)\n builder << lf.first << \": \" << lf.second.toString() << std::endl;\n return cstring(builder.str());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncstring SourceInfo::toSourceFragment() const {\n if (!isValid())\n return \"\";\n return sources->getSourceFragment(*this);\n}\n\ncstring SourceInfo::toBriefSourceFragment() const {\n if (!isValid())\n return \"\";\n return sources->getBriefSourceFragment(*this);\n}\n\ncstring SourceInfo::toPositionString() const {\n if (!isValid())\n return \"\";\n SourceFileLine position = sources->getSourceLine(start.getLineNumber());\n return position.toString();\n}\n\ncstring SourceInfo::toSourcePositionData(unsigned *outLineNumber,\n unsigned *outColumnNumber) const {\n SourceFileLine position = sources->getSourceLine(start.getLineNumber());\n if (outLineNumber != nullptr) {\n *outLineNumber = position.sourceLine;\n }\n if (outColumnNumber != nullptr) {\n *outColumnNumber = start.getColumnNumber();\n }\n return position.fileName.c_str();\n}\n\nSourceFileLine SourceInfo::toPosition() const {\n return sources->getSourceLine(start.getLineNumber());\n}\n\ncstring SourceInfo::getSourceFile() const {\n auto sourceLine = sources->getSourceLine(start.getLineNumber());\n return sourceLine.fileName;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ncstring SourceFileLine::toString() const {\n return Util::printf_format(\"%s(%d)\", fileName.c_str(), sourceLine);\n}\n\n} \/\/ namespace Util\n<|endoftext|>"} {"text":"<commit_before>#include \"vtkExodusIIReader.h\"\n#include \"vtkGmshReader.h\"\n#include \"vtkXMLUnstructuredGridReader.h\"\n#include \"vtkXMLPUnstructuredGridReader.h\"\n#include \"vtkTriangleReader.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkXMLUnstructuredGridWriter.h\"\n#include \"vtkXMLMultiBlockDataWriter.h\"\n#include \"vtkGmshWriter.h\"\n#include \"vtkAppendFilter.h\"\n#include \"vtkCellData.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkIdTypeArray.h\"\n\n#include <unistd.h>\n#include <stdio.h>\n#include <string>\n\n#include \"mesh_converter.h\"\n\nint main(int argc, char *argv[]) {\n\n std::string input_format=\"exodus\";\n std::string output_format=\"gmsh\";\n int opt;\n\n if (argc <3) {\n print_usage();\n return 0;\n }\n\n while ( (opt = getopt(argc, argv, \"i::o::h\")) != -1 ) { \n switch ( opt ) {\n case 'i':\n if (optarg) {\n\tinput_format = optarg;\n }\n break;\n case 'o':\n if (optarg) {\n\toutput_format = optarg;\n }\n break;\n case 'h':\n print_usage();\n break;\n case '?': \n cerr << \"Unknown option: '\" << char(optopt) << \"'!\" << endl;\n break;\n }\n }\n\n vtkMultiBlockDataSet* mbdata = NULL;\n vtkUnstructuredGrid* ugdata = NULL;\n\n if (input_format.compare(\"exodus\")==0 ) {\n mbdata = read_exodusII(argv[optind++]);\n } else if (input_format.compare(\"gmsh\")==0 ) {\n ugdata = read_gmsh(argv[optind++]);\n } else if (input_format.compare(\"vtu\")==0 ) {\n ugdata = read_vtu(argv[optind++]);\n } else if (input_format.compare(\"pvtu\")==0 ) {\n ugdata = read_pvtu(argv[optind++]);\n } else if (input_format.compare(\"triangle\")==0 ) {\n ugdata = read_triangle(argv[optind++]);\n } else {\n std::cout<< \"Unrecognised input format: \"<< input_format << std::endl;\n return 1;\n }\n \n int flag;\n \n if (output_format.compare(\"gmsh\")==0) {\n if (mbdata) {\n ugdata=multiblock_to_unstucturedgrid(mbdata);\n }\n flag=write_gmsh(ugdata,argv[optind]);\n } else if (output_format.compare(\"vtu\")==0) {\n if (mbdata) {\n ugdata=multiblock_to_unstucturedgrid(mbdata);\n }\n flag=write_vtu(ugdata,argv[optind]);\n } else if (output_format.compare(\"vtm\")==0) {\n if (ugdata) {\n \/\/ mbdata=unstucturedgrid_to_multiblock(ugdata);\n }\n flag=write_vtm(mbdata,argv[optind]);\n } else {\n std::cout<< \"Unrecognised output format: \"<<output_format<<std::endl;\n return 1;\n }\n \n if (mbdata){\n mbdata->Delete();\n }\n if (ugdata){\n ugdata->Delete();\n }\n\n return flag;\n}\n\nvtkUnstructuredGrid* multiblock_to_unstucturedgrid(vtkMultiBlockDataSet* data) {\n vtkAppendFilter* appender = vtkAppendFilter::New();\n appender->SetMergePoints(1);\n\n vtkMultiBlockDataSet* sidesets = vtkMultiBlockDataSet::SafeDownCast(data->GetBlock(4));\n for (int i=0; i<sidesets->GetNumberOfBlocks(); i++) {\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::SafeDownCast(sidesets->GetBlock(i));\n vtkIntArray* eids = vtkIntArray::New();\n eids->SetNumberOfValues(ugrid->GetNumberOfCells());\n ugrid->GetCellData()->GetArray(\"ObjectId\")->SetName(\"PhysicalIds\");\n for (int j=0; j<ugrid->GetNumberOfCells(); j++) {\n eids->SetValue(j,i+1);\n }\n eids->SetName(\"ElementaryEntities\");\n ugrid->GetCellData()->AddArray(eids);\n appender->AddInputData(ugrid);\n }\n \n vtkMultiBlockDataSet* regions = vtkMultiBlockDataSet::SafeDownCast(data->GetBlock(0));\n for (int i=0; i<regions->GetNumberOfBlocks(); i++) {\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::SafeDownCast(regions->GetBlock(i));\n ugrid->GetCellData()->GetArray(\"ObjectId\")->SetName(\"PhysicalIds\");\n ugrid->GetCellData()->GetArray(\"GlobalElementId\")->SetName(\"ElementaryEntities\");\n appender->AddInputData(ugrid);\n }\n\n appender->Update();\n vtkUnstructuredGrid* output = vtkUnstructuredGrid::New();\n output->ShallowCopy(appender->GetOutput());\n appender->Delete();\n\n return output;\n}\n\nvtkMultiBlockDataSet* read_exodusII(char* fname){\n\n std::cout << \"Reading from file: \" <<fname<<std::endl;\n\n vtkExodusIIReader* r = vtkExodusIIReader::New();\n\n r->SetFileName(fname);\n r->UpdateInformation();\n r->GenerateGlobalNodeIdArrayOn();\n r->GenerateGlobalElementIdArrayOn();\n r->GenerateObjectIdCellArrayOn();\n for (int i=0; i<r->GetNumberOfSideSetArrays(); i++) {\n r->SetSideSetArrayStatus(r->GetSideSetArrayName(i),1);\n }\n r->Update();\n\n vtkMultiBlockDataSet* data;\n data = r->GetOutput();\n\n return data;\n }\n\n vtkUnstructuredGrid* read_gmsh(char* fname) {\n std::cout << \"Reading from GMSH file: \" <<fname<<std::endl;\n vtkGmshReader* reader= vtkGmshReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\n vtkUnstructuredGrid* read_vtu(char* fname) {\n std::cout << \"Reading from VTK unstructured grid file: \" <<fname<<std::endl;\n vtkXMLUnstructuredGridReader* reader= vtkXMLUnstructuredGridReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nvtkUnstructuredGrid* read_pvtu(char* fname) {\n std::cout << \"Reading from VTK parallel unstructured grid file: \" <<fname<<std::endl;\n vtkXMLPUnstructuredGridReader* reader= vtkXMLPUnstructuredGridReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nvtkUnstructuredGrid* read_triangle(char* fname) {\n std::cout << \"Reading from VTK parallel unstructured grid file: \" <<fname<<std::endl;\n vtkTriangleReader* reader= vtkTriangleReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nint print_usage(){\n std::cout << \"usage: mesh_converter [-i input_format] [-o output_format] [-h] input_file output_file\"<<std::endl;\n return 0;\n}\n\nint write_gmsh(vtkUnstructuredGrid* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkGmshWriter* writer = vtkGmshWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n\nint write_vtu(vtkUnstructuredGrid* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkXMLUnstructuredGridWriter* writer = vtkXMLUnstructuredGridWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n\nint write_vtm(vtkMultiBlockDataSet* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkXMLMultiBlockDataWriter* writer = vtkXMLMultiBlockDataWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n \n<commit_msg>Add version information.<commit_after>#include \"vtkExodusIIReader.h\"\n#include \"vtkGmshReader.h\"\n#include \"vtkXMLUnstructuredGridReader.h\"\n#include \"vtkXMLPUnstructuredGridReader.h\"\n#include \"vtkTriangleReader.h\"\n#include \"vtkMultiBlockDataSet.h\"\n#include \"vtkUnstructuredGrid.h\"\n#include \"vtkXMLUnstructuredGridWriter.h\"\n#include \"vtkXMLMultiBlockDataWriter.h\"\n#include \"vtkGmshWriter.h\"\n#include \"vtkAppendFilter.h\"\n#include \"vtkCellData.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkIdTypeArray.h\"\n\n#include <unistd.h>\n#include <stdio.h>\n#include <string>\n\n#include \"mesh_converter.h\"\n\nint main(int argc, char *argv[]) {\n\n std::string input_format=\"exodus\";\n std::string output_format=\"gmsh\";\n int opt;\n\n while ( (opt = getopt(argc, argv, \"i::o::hV\")) != -1 ) { \n switch ( opt ) {\n case 'i':\n if (optarg) {\n\tinput_format = optarg;\n }\n break;\n case 'o':\n if (optarg) {\n\toutput_format = optarg;\n }\n break;\n case 'h':\n print_usage();\n return EXIT_SUCCESS;\n break;\n case 'V':\n print_version();\n return EXIT_SUCCESS;\n break;\n case '?': \n cerr << \"Unknown option: '\" << char(optopt) << \"'!\" << endl;\n break;\n }\n }\n\n if (argc <3) {\n print_usage();\n return 1;\n }\n\n vtkMultiBlockDataSet* mbdata = NULL;\n vtkUnstructuredGrid* ugdata = NULL;\n\n if (input_format.compare(\"exodus\")==0 ) {\n mbdata = read_exodusII(argv[optind++]);\n } else if (input_format.compare(\"gmsh\")==0 ) {\n ugdata = read_gmsh(argv[optind++]);\n } else if (input_format.compare(\"vtu\")==0 ) {\n ugdata = read_vtu(argv[optind++]);\n } else if (input_format.compare(\"pvtu\")==0 ) {\n ugdata = read_pvtu(argv[optind++]);\n } else if (input_format.compare(\"triangle\")==0 ) {\n ugdata = read_triangle(argv[optind++]);\n } else {\n std::cout<< \"Unrecognised input format: \"<< input_format << std::endl;\n return 1;\n }\n \n int flag;\n \n if (output_format.compare(\"gmsh\")==0) {\n if (mbdata) {\n ugdata=multiblock_to_unstucturedgrid(mbdata);\n }\n flag=write_gmsh(ugdata,argv[optind]);\n } else if (output_format.compare(\"vtu\")==0) {\n if (mbdata) {\n ugdata=multiblock_to_unstucturedgrid(mbdata);\n }\n flag=write_vtu(ugdata,argv[optind]);\n } else if (output_format.compare(\"vtm\")==0) {\n if (ugdata) {\n \/\/ mbdata=unstucturedgrid_to_multiblock(ugdata);\n }\n flag=write_vtm(mbdata,argv[optind]);\n } else {\n std::cout<< \"Unrecognised output format: \"<<output_format<<std::endl;\n return 1;\n }\n \n if (mbdata){\n mbdata->Delete();\n }\n if (ugdata){\n ugdata->Delete();\n }\n\n return flag;\n}\n\nvtkUnstructuredGrid* multiblock_to_unstucturedgrid(vtkMultiBlockDataSet* data) {\n vtkAppendFilter* appender = vtkAppendFilter::New();\n appender->SetMergePoints(1);\n\n vtkMultiBlockDataSet* sidesets = vtkMultiBlockDataSet::SafeDownCast(data->GetBlock(4));\n for (int i=0; i<sidesets->GetNumberOfBlocks(); i++) {\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::SafeDownCast(sidesets->GetBlock(i));\n vtkIntArray* eids = vtkIntArray::New();\n eids->SetNumberOfValues(ugrid->GetNumberOfCells());\n ugrid->GetCellData()->GetArray(\"ObjectId\")->SetName(\"PhysicalIds\");\n for (int j=0; j<ugrid->GetNumberOfCells(); j++) {\n eids->SetValue(j,i+1);\n }\n eids->SetName(\"ElementaryEntities\");\n ugrid->GetCellData()->AddArray(eids);\n appender->AddInputData(ugrid);\n }\n \n vtkMultiBlockDataSet* regions = vtkMultiBlockDataSet::SafeDownCast(data->GetBlock(0));\n for (int i=0; i<regions->GetNumberOfBlocks(); i++) {\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::SafeDownCast(regions->GetBlock(i));\n ugrid->GetCellData()->GetArray(\"ObjectId\")->SetName(\"PhysicalIds\");\n ugrid->GetCellData()->GetArray(\"GlobalElementId\")->SetName(\"ElementaryEntities\");\n appender->AddInputData(ugrid);\n }\n\n appender->Update();\n vtkUnstructuredGrid* output = vtkUnstructuredGrid::New();\n output->ShallowCopy(appender->GetOutput());\n appender->Delete();\n\n return output;\n}\n\nvtkMultiBlockDataSet* read_exodusII(char* fname){\n\n std::cout << \"Reading from file: \" <<fname<<std::endl;\n\n vtkExodusIIReader* r = vtkExodusIIReader::New();\n\n r->SetFileName(fname);\n r->UpdateInformation();\n r->GenerateGlobalNodeIdArrayOn();\n r->GenerateGlobalElementIdArrayOn();\n r->GenerateObjectIdCellArrayOn();\n for (int i=0; i<r->GetNumberOfSideSetArrays(); i++) {\n r->SetSideSetArrayStatus(r->GetSideSetArrayName(i),1);\n }\n r->Update();\n\n vtkMultiBlockDataSet* data;\n data = r->GetOutput();\n\n return data;\n }\n\n vtkUnstructuredGrid* read_gmsh(char* fname) {\n std::cout << \"Reading from GMSH file: \" <<fname<<std::endl;\n vtkGmshReader* reader= vtkGmshReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\n vtkUnstructuredGrid* read_vtu(char* fname) {\n std::cout << \"Reading from VTK unstructured grid file: \" <<fname<<std::endl;\n vtkXMLUnstructuredGridReader* reader= vtkXMLUnstructuredGridReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nvtkUnstructuredGrid* read_pvtu(char* fname) {\n std::cout << \"Reading from VTK parallel unstructured grid file: \" <<fname<<std::endl;\n vtkXMLPUnstructuredGridReader* reader= vtkXMLPUnstructuredGridReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nvtkUnstructuredGrid* read_triangle(char* fname) {\n std::cout << \"Reading from VTK parallel unstructured grid file: \" <<fname<<std::endl;\n vtkTriangleReader* reader= vtkTriangleReader::New();\n reader->SetFileName(fname);\n reader->Update();\n vtkUnstructuredGrid* ugrid = vtkUnstructuredGrid::New();\n ugrid->ShallowCopy(reader->GetOutput());\n reader->Delete();\n return ugrid;\n }\n\nint print_usage(){\n std::cout << \"usage: mesh_converter [-i input_format] [-o output_format] [-hV] input_file output_file\"<<std::endl;\n return 0;\n}\n\nint print_version(){\n std::cout << \"mesh_converter \"\n << CONVERTER_MAJOR_VERSION<<\".\"<<CONVERTER_MINOR_VERSION\n <<std::endl;\n return 0;\n}\n\nint write_gmsh(vtkUnstructuredGrid* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkGmshWriter* writer = vtkGmshWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n\nint write_vtu(vtkUnstructuredGrid* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkXMLUnstructuredGridWriter* writer = vtkXMLUnstructuredGridWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n\nint write_vtm(vtkMultiBlockDataSet* data, char* fname){\n\n std::cout << \"Writing to file: \" <<fname<<std::endl;\n\n vtkXMLMultiBlockDataWriter* writer = vtkXMLMultiBlockDataWriter::New(); \n writer->SetFileName(fname);\n writer->SetInputData(data);\n writer->Write();\n writer->Delete();\n return 0;\n}\n \n<|endoftext|>"} {"text":"<commit_before>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"mimapplication.h\"\n\n#include <MWindow>\n#include <MDebug>\n\n#include \"x11wrapper.h\"\n\nX11Wrapper::X11Wrapper() \n : remoteWindowId(0),\n remoteWindowXPixmap(0),\n remoteWindowPixmap(),\n pixmapDamage(0)\n{\n}\n\nMIMApplication::MIMApplication(int &argc, char **argv, bool useSelfComposite)\n : MApplication(argc, argv),\n passThruWindow(0),\n x11Wrapper(new X11Wrapper),\n selfComposited(false)\n{\n if (useSelfComposite)\n selfComposited = initializeComposite();\n}\n\nMIMApplication::~MIMApplication()\n{\n delete x11Wrapper;\n}\n\nbool MIMApplication::initializeComposite()\n{\n int compositeBase, compositeError;\n if (!XCompositeQueryExtension(QX11Info::display(), &compositeBase, &compositeError))\n return false;\n\n if (!XQueryExtension(QX11Info::display(), COMPOSITE_NAME, &compositeMajor, &compositeBase, &compositeError))\n return false;\n\n int major = 0, minor = 2; \/\/ XComposite 0.2 required for XCompositeNameWindowPixmap\n if (!XCompositeQueryVersion(QX11Info::display(), &major, &minor))\n return false;\n\n if (major < 0 || (major == 0 && minor < 2))\n return false;\n\n int damageError;\n if (!XDamageQueryExtension(QX11Info::display(), &damageBase, &damageError))\n return false;\n\n return true;\n}\n\nbool MIMApplication::x11EventFilter(XEvent *ev)\n{\n handleMapNotifyEvents(ev);\n handleTransientEvents(ev);\n handleDamageEvents(ev);\n return MApplication::x11EventFilter(ev);\n}\n\nvoid MIMApplication::handleMapNotifyEvents(XEvent *ev)\n{\n if (wasPassThruWindowMapped(ev)) {\n mDebug(\"MIMApplication\") << \"PassThru window was mapped.\";\n emit passThruWindowMapped();\n } else if (wasPassThruWindowUnmapped(ev)) {\n mDebug(\"MIMApplication\") << \"PassThru window was unmapped.\";\n emit passThruWindowUnmapped();\n }\n}\n\nvoid MIMApplication::handleTransientEvents(XEvent *ev)\n{\n if (0 == x11Wrapper->remoteWindowId || not passThruWindow) {\n return;\n }\n\n if (wasRemoteWindowIconified(ev) || wasRemoteWindowUnmapped(ev)) {\n mDebug(\"MIMApplication\") << \"Remote window was destroyed or iconified - hiding.\";\n destroyDamage();\n x11Wrapper->remoteWindowId = 0;\n emit remoteWindowGone();\n }\n}\n\nvoid MIMApplication::setTransientHint(int newRemoteWinId)\n{\n if (0 == newRemoteWinId || not activeWindow()) {\n return;\n }\n\n x11Wrapper->remoteWindowId = newRemoteWinId;\n\n XSetTransientForHint(QX11Info::display(),\n passThruWindow->effectiveWinId(),\n x11Wrapper->remoteWindowId);\n\n \/\/ Using PropertyChangeMask is a work-around for NB#172722 (a WONTFIX):\n XSelectInput(QX11Info::display(),\n x11Wrapper->remoteWindowId,\n StructureNotifyMask | PropertyChangeMask);\n}\n\nvoid MIMApplication::setPassThruWindow(QWidget *newPassThruWindow)\n{\n if (newPassThruWindow != passThruWindow) {\n passThruWindow = newPassThruWindow;\n }\n}\n\nMIMApplication *MIMApplication::instance()\n{\n return static_cast<MIMApplication *>(QCoreApplication::instance());\n}\n\nbool MIMApplication::wasRemoteWindowIconified(XEvent *ev) const\n{\n if (PropertyNotify != ev->type) {\n return false;\n }\n\n static const Atom wmState = XInternAtom(QX11Info::display(), \"WM_STATE\", false);\n\n if (ev->xproperty.atom == wmState) {\n Atom type;\n int format;\n unsigned long length;\n unsigned long after;\n unsigned long *state;\n uchar *data = 0;\n\n int queryResult = XGetWindowProperty(QX11Info::display(), x11Wrapper->remoteWindowId, wmState, 0, 2,\n false, AnyPropertyType, &type, &format, &length,\n &after, &data);\n state = (unsigned long *) data;\n\n bool result = (queryResult == Success && data && format == 32 && *state == IconicState);\n\n if (data) {\n XFree(data);\n }\n\n return result;\n }\n\n return false;\n}\n\nbool MIMApplication::wasRemoteWindowUnmapped(XEvent *ev) const\n{\n return (UnmapNotify == ev->type &&\n ev->xunmap.event == x11Wrapper->remoteWindowId);\n}\n\nbool MIMApplication::wasPassThruWindowMapped(XEvent *ev) const\n{\n return (passThruWindow &&\n MapNotify == ev->type &&\n static_cast<WId>(ev->xmap.event) == passThruWindow->effectiveWinId());\n}\n\nbool MIMApplication::wasPassThruWindowUnmapped(XEvent *ev) const\n{\n return (passThruWindow &&\n UnmapNotify == ev->type &&\n static_cast<WId>(ev->xunmap.event) == passThruWindow->effectiveWinId());\n}\n\nvoid MIMApplication::setupDamage()\n{\n if (x11Wrapper->remoteWindowId == 0)\n return;\n\n if (x11Wrapper->pixmapDamage != 0)\n destroyDamage();\n\n x11Wrapper->pixmapDamage = XDamageCreate(QX11Info::display(), x11Wrapper->remoteWindowId, XDamageReportNonEmpty); \n}\n\nvoid MIMApplication::destroyDamage()\n{\n if (x11Wrapper->pixmapDamage != 0) {\n XDamageDestroy(QX11Info::display(), x11Wrapper->pixmapDamage);\n x11Wrapper->pixmapDamage = 0;\n }\n}\n\nvoid MIMApplication::handleDamageEvents(XEvent *event)\n{\n if (x11Wrapper->remoteWindowId == 0 ||\n x11Wrapper->pixmapDamage == 0)\n return;\n\n if (event->type == damageBase + XDamageNotify) {\n XDamageNotifyEvent *e = reinterpret_cast<XDamageNotifyEvent*>(event);\n\n if (x11Wrapper->pixmapDamage == e->damage) {\n XserverRegion parts = XFixesCreateRegion(QX11Info::display(), 0, 0);\n XDamageSubtract(QX11Info::display(), e->damage, None, parts);\n\n QRegion region;\n\n int nrects;\n XRectangle *rects = XFixesFetchRegion (QX11Info::display(), parts, &nrects);\n if (rects) {\n for (int i = 0; i < nrects; ++i) {\n region += QRect(rects[i].x, rects[i].y, rects[i].width, rects[i].height);\n }\n }\n free(rects);\n\n XFixesDestroyRegion(QX11Info::display(), parts);\n\n \/\/ setup remote pixmap when it failed before\n if (x11Wrapper->remoteWindowPixmap.isNull())\n setupRemotePixmap();\n\n emit remoteWindowUpdated(region);\n }\n }\n}\n\nvoid MIMApplication::redirectRemoteWindow()\n{\n if (x11Wrapper->remoteWindowId != 0) {\n xError()->check(compositeMajor, X_CompositeRedirectWindow);\n XCompositeRedirectWindow(QX11Info::display(),\n x11Wrapper->remoteWindowId,\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadAccess)\n qDebug() << \"Window \" << x11Wrapper->remoteWindowId << \" was already redirected\";\n\n setupRemotePixmap();\n\n setupDamage();\n emit remoteWindowUpdated(QRegion());\n }\n}\n\nvoid MIMApplication::unredirectRemoteWindow()\n{\n destroyRemotePixmap();\n if (x11Wrapper->remoteWindowId != 0) {\n xError()->check(compositeMajor, X_CompositeUnredirectWindow);\n XCompositeUnredirectWindow(QX11Info::display(), \n x11Wrapper->remoteWindowId,\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadAccess)\n qDebug() << \"Window \" << x11Wrapper->remoteWindowId << \" was not redirected\";\n destroyDamage();\n }\n}\n\nQPixmap MIMApplication::remoteWindowPixmap() const\n{\n return x11Wrapper->remoteWindowPixmap;\n}\n\nbool MIMApplication::supportsSelfComposite() const\n{\n return selfComposited;\n}\n\nvoid MIMApplication::setupRemotePixmap()\n{\n destroyRemotePixmap();\n\n xError()->check(compositeMajor, X_CompositeNameWindowPixmap);\n x11Wrapper->remoteWindowXPixmap = XCompositeNameWindowPixmap(QX11Info::display(), x11Wrapper->remoteWindowId);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadMatch) {\n qDebug() << \"Cannot get offscreen reference for Window \" << x11Wrapper->remoteWindowId;\n return;\n }\n\n if (x11Wrapper->remoteWindowXPixmap != 0) {\n x11Wrapper->remoteWindowPixmap = QPixmap::fromX11Pixmap(x11Wrapper->remoteWindowXPixmap, QPixmap::ExplicitlyShared);\n }\n}\n\nvoid MIMApplication::destroyRemotePixmap()\n{\n x11Wrapper->remoteWindowPixmap = QPixmap();\n\n if (x11Wrapper->remoteWindowXPixmap != 0) {\n XFreePixmap(QX11Info::display(), x11Wrapper->remoteWindowXPixmap);\n x11Wrapper->remoteWindowXPixmap = 0;\n }\n}\n\nMIMXError *MIMApplication::xError() const\n{\n return x11Error;\n}\n\nMIMXError::MIMXError() :\n request_code(0),\n minor_code(0),\n error_code(0),\n oldHandler(0)\n{}\n\nint xErrorHandler(Display *display, XErrorEvent *e)\n{\n MIMXError *xerror = MIMApplication::instance()->xError();\n\n if (xerror->matches(e)) {\n xerror->error_code = e->error_code;\n return 0;\n }\n\n return xerror->oldHandler(display, e);\n}\n\nvoid MIMXError::check(int major, int minor)\n{\n request_code = major;\n minor_code = minor;\n error_code = Success;\n oldHandler = XSetErrorHandler(xErrorHandler);\n}\n\nbool MIMXError::matches(XErrorEvent *e)\n{\n return e->request_code == request_code && e->minor_code == minor_code;\n}\n\nint MIMXError::result()\n{\n XSetErrorHandler(oldHandler);\n return error_code;\n}\n<commit_msg>Fixes: initialize x11Error properly.<commit_after>\/* * This file is part of meego-im-framework *\n *\n * Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n * All rights reserved.\n * Contact: Nokia Corporation (directui@nokia.com)\n *\n * If you have questions regarding the use of this file, please contact\n * Nokia at directui@nokia.com.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation\n * and appearing in the file LICENSE.LGPL included in the packaging\n * of this file.\n *\/\n\n#include \"mimapplication.h\"\n\n#include <MWindow>\n#include <MDebug>\n\n#include \"x11wrapper.h\"\n\nX11Wrapper::X11Wrapper() \n : remoteWindowId(0),\n remoteWindowXPixmap(0),\n remoteWindowPixmap(),\n pixmapDamage(0)\n{\n}\n\nMIMApplication::MIMApplication(int &argc, char **argv, bool useSelfComposite)\n : MApplication(argc, argv),\n passThruWindow(0),\n x11Wrapper(new X11Wrapper),\n x11Error(new MIMXError),\n selfComposited(false)\n{\n if (useSelfComposite)\n selfComposited = initializeComposite();\n}\n\nMIMApplication::~MIMApplication()\n{\n delete x11Wrapper;\n delete x11Error;\n}\n\nbool MIMApplication::initializeComposite()\n{\n int compositeBase, compositeError;\n if (!XCompositeQueryExtension(QX11Info::display(), &compositeBase, &compositeError))\n return false;\n\n if (!XQueryExtension(QX11Info::display(), COMPOSITE_NAME, &compositeMajor, &compositeBase, &compositeError))\n return false;\n\n int major = 0, minor = 2; \/\/ XComposite 0.2 required for XCompositeNameWindowPixmap\n if (!XCompositeQueryVersion(QX11Info::display(), &major, &minor))\n return false;\n\n if (major < 0 || (major == 0 && minor < 2))\n return false;\n\n int damageError;\n if (!XDamageQueryExtension(QX11Info::display(), &damageBase, &damageError))\n return false;\n\n return true;\n}\n\nbool MIMApplication::x11EventFilter(XEvent *ev)\n{\n handleMapNotifyEvents(ev);\n handleTransientEvents(ev);\n handleDamageEvents(ev);\n return MApplication::x11EventFilter(ev);\n}\n\nvoid MIMApplication::handleMapNotifyEvents(XEvent *ev)\n{\n if (wasPassThruWindowMapped(ev)) {\n mDebug(\"MIMApplication\") << \"PassThru window was mapped.\";\n emit passThruWindowMapped();\n } else if (wasPassThruWindowUnmapped(ev)) {\n mDebug(\"MIMApplication\") << \"PassThru window was unmapped.\";\n emit passThruWindowUnmapped();\n }\n}\n\nvoid MIMApplication::handleTransientEvents(XEvent *ev)\n{\n if (0 == x11Wrapper->remoteWindowId || not passThruWindow) {\n return;\n }\n\n if (wasRemoteWindowIconified(ev) || wasRemoteWindowUnmapped(ev)) {\n mDebug(\"MIMApplication\") << \"Remote window was destroyed or iconified - hiding.\";\n destroyDamage();\n x11Wrapper->remoteWindowId = 0;\n emit remoteWindowGone();\n }\n}\n\nvoid MIMApplication::setTransientHint(int newRemoteWinId)\n{\n if (0 == newRemoteWinId || not activeWindow()) {\n return;\n }\n\n x11Wrapper->remoteWindowId = newRemoteWinId;\n\n XSetTransientForHint(QX11Info::display(),\n passThruWindow->effectiveWinId(),\n x11Wrapper->remoteWindowId);\n\n \/\/ Using PropertyChangeMask is a work-around for NB#172722 (a WONTFIX):\n XSelectInput(QX11Info::display(),\n x11Wrapper->remoteWindowId,\n StructureNotifyMask | PropertyChangeMask);\n}\n\nvoid MIMApplication::setPassThruWindow(QWidget *newPassThruWindow)\n{\n if (newPassThruWindow != passThruWindow) {\n passThruWindow = newPassThruWindow;\n }\n}\n\nMIMApplication *MIMApplication::instance()\n{\n return static_cast<MIMApplication *>(QCoreApplication::instance());\n}\n\nbool MIMApplication::wasRemoteWindowIconified(XEvent *ev) const\n{\n if (PropertyNotify != ev->type) {\n return false;\n }\n\n static const Atom wmState = XInternAtom(QX11Info::display(), \"WM_STATE\", false);\n\n if (ev->xproperty.atom == wmState) {\n Atom type;\n int format;\n unsigned long length;\n unsigned long after;\n unsigned long *state;\n uchar *data = 0;\n\n int queryResult = XGetWindowProperty(QX11Info::display(), x11Wrapper->remoteWindowId, wmState, 0, 2,\n false, AnyPropertyType, &type, &format, &length,\n &after, &data);\n state = (unsigned long *) data;\n\n bool result = (queryResult == Success && data && format == 32 && *state == IconicState);\n\n if (data) {\n XFree(data);\n }\n\n return result;\n }\n\n return false;\n}\n\nbool MIMApplication::wasRemoteWindowUnmapped(XEvent *ev) const\n{\n return (UnmapNotify == ev->type &&\n ev->xunmap.event == x11Wrapper->remoteWindowId);\n}\n\nbool MIMApplication::wasPassThruWindowMapped(XEvent *ev) const\n{\n return (passThruWindow &&\n MapNotify == ev->type &&\n static_cast<WId>(ev->xmap.event) == passThruWindow->effectiveWinId());\n}\n\nbool MIMApplication::wasPassThruWindowUnmapped(XEvent *ev) const\n{\n return (passThruWindow &&\n UnmapNotify == ev->type &&\n static_cast<WId>(ev->xunmap.event) == passThruWindow->effectiveWinId());\n}\n\nvoid MIMApplication::setupDamage()\n{\n if (x11Wrapper->remoteWindowId == 0)\n return;\n\n if (x11Wrapper->pixmapDamage != 0)\n destroyDamage();\n\n x11Wrapper->pixmapDamage = XDamageCreate(QX11Info::display(), x11Wrapper->remoteWindowId, XDamageReportNonEmpty); \n}\n\nvoid MIMApplication::destroyDamage()\n{\n if (x11Wrapper->pixmapDamage != 0) {\n XDamageDestroy(QX11Info::display(), x11Wrapper->pixmapDamage);\n x11Wrapper->pixmapDamage = 0;\n }\n}\n\nvoid MIMApplication::handleDamageEvents(XEvent *event)\n{\n if (x11Wrapper->remoteWindowId == 0 ||\n x11Wrapper->pixmapDamage == 0)\n return;\n\n if (event->type == damageBase + XDamageNotify) {\n XDamageNotifyEvent *e = reinterpret_cast<XDamageNotifyEvent*>(event);\n\n if (x11Wrapper->pixmapDamage == e->damage) {\n XserverRegion parts = XFixesCreateRegion(QX11Info::display(), 0, 0);\n XDamageSubtract(QX11Info::display(), e->damage, None, parts);\n\n QRegion region;\n\n int nrects;\n XRectangle *rects = XFixesFetchRegion (QX11Info::display(), parts, &nrects);\n if (rects) {\n for (int i = 0; i < nrects; ++i) {\n region += QRect(rects[i].x, rects[i].y, rects[i].width, rects[i].height);\n }\n }\n free(rects);\n\n XFixesDestroyRegion(QX11Info::display(), parts);\n\n \/\/ setup remote pixmap when it failed before\n if (x11Wrapper->remoteWindowPixmap.isNull())\n setupRemotePixmap();\n\n emit remoteWindowUpdated(region);\n }\n }\n}\n\nvoid MIMApplication::redirectRemoteWindow()\n{\n if (x11Wrapper->remoteWindowId != 0) {\n xError()->check(compositeMajor, X_CompositeRedirectWindow);\n XCompositeRedirectWindow(QX11Info::display(),\n x11Wrapper->remoteWindowId,\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadAccess)\n qDebug() << \"Window \" << x11Wrapper->remoteWindowId << \" was already redirected\";\n\n setupRemotePixmap();\n\n setupDamage();\n emit remoteWindowUpdated(QRegion());\n }\n}\n\nvoid MIMApplication::unredirectRemoteWindow()\n{\n destroyRemotePixmap();\n if (x11Wrapper->remoteWindowId != 0) {\n xError()->check(compositeMajor, X_CompositeUnredirectWindow);\n XCompositeUnredirectWindow(QX11Info::display(), \n x11Wrapper->remoteWindowId,\n CompositeRedirectManual);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadAccess)\n qDebug() << \"Window \" << x11Wrapper->remoteWindowId << \" was not redirected\";\n destroyDamage();\n }\n}\n\nQPixmap MIMApplication::remoteWindowPixmap() const\n{\n return x11Wrapper->remoteWindowPixmap;\n}\n\nbool MIMApplication::supportsSelfComposite() const\n{\n return selfComposited;\n}\n\nvoid MIMApplication::setupRemotePixmap()\n{\n destroyRemotePixmap();\n\n xError()->check(compositeMajor, X_CompositeNameWindowPixmap);\n x11Wrapper->remoteWindowXPixmap = XCompositeNameWindowPixmap(QX11Info::display(), x11Wrapper->remoteWindowId);\n XSync(QX11Info::display(), FALSE);\n if (xError()->result() == BadMatch) {\n qDebug() << \"Cannot get offscreen reference for Window \" << x11Wrapper->remoteWindowId;\n return;\n }\n\n if (x11Wrapper->remoteWindowXPixmap != 0) {\n x11Wrapper->remoteWindowPixmap = QPixmap::fromX11Pixmap(x11Wrapper->remoteWindowXPixmap, QPixmap::ExplicitlyShared);\n }\n}\n\nvoid MIMApplication::destroyRemotePixmap()\n{\n x11Wrapper->remoteWindowPixmap = QPixmap();\n\n if (x11Wrapper->remoteWindowXPixmap != 0) {\n XFreePixmap(QX11Info::display(), x11Wrapper->remoteWindowXPixmap);\n x11Wrapper->remoteWindowXPixmap = 0;\n }\n}\n\nMIMXError *MIMApplication::xError() const\n{\n return x11Error;\n}\n\nMIMXError::MIMXError() :\n request_code(0),\n minor_code(0),\n error_code(0),\n oldHandler(0)\n{}\n\nint xErrorHandler(Display *display, XErrorEvent *e)\n{\n MIMXError *xerror = MIMApplication::instance()->xError();\n\n if (xerror->matches(e)) {\n xerror->error_code = e->error_code;\n return 0;\n }\n\n return xerror->oldHandler(display, e);\n}\n\nvoid MIMXError::check(int major, int minor)\n{\n request_code = major;\n minor_code = minor;\n error_code = Success;\n oldHandler = XSetErrorHandler(xErrorHandler);\n}\n\nbool MIMXError::matches(XErrorEvent *e)\n{\n return e->request_code == request_code && e->minor_code == minor_code;\n}\n\nint MIMXError::result()\n{\n XSetErrorHandler(oldHandler);\n return error_code;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n\n#include \"boost_cfg.hpp\"\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\n#include \"VisitorUtils.hpp\"\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n\n#include \"mtac\/pass_traits.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Printer.hpp\"\n#include \"mtac\/TemporaryAllocator.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/VariableOptimizations.hpp\"\n#include \"mtac\/FunctionOptimizations.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/BasicBlockOptimizations.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/ConcatReduction.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_optimizations.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/RemoveAssign.hpp\"\n#include \"mtac\/RemoveMultipleAssign.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nconst unsigned int MAX_THREADS = 2;\n\ntemplate<typename Visitor>\nbool apply_to_all(std::shared_ptr<mtac::Function> function){\n Visitor visitor;\n\n mtac::visit_all_statements(visitor, function);\n\n return visitor.optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks_two_pass(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visitor.pass = mtac::Pass::DATA_MINING;\n\n visit_each(visitor, block->statements);\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Problem, typename... Args>\nbool data_flow_optimization(std::shared_ptr<mtac::Function> function, Args... args){\n bool optimized = false;\n\n Problem problem(args...);\n\n auto results = mtac::data_flow(function, problem);\n\n \/\/Once the data-flow problem is fixed, statements can be optimized\n for(auto& block : function->getBasicBlocks()){\n for(auto& statement : block->statements){\n optimized |= problem.optimize(statement, results);\n }\n }\n\n return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n if(b){\n log::emit<Debug>(\"Optimizer\") << name << \" returned true\" << log::endl;\n\n \/\/Print the function\n print(function);\n } else {\n log::emit<Debug>(\"Optimizer\") << name << \" returned false\" << log::endl;\n }\n }\n\n return b;\n}\n\ntemplate<typename Functor, typename... Args>\nbool debug(const std::string& name, Functor functor, std::shared_ptr<mtac::Function> function, Args... args){\n bool b;\n {\n PerfsTimer timer(name);\n\n b = functor(function, args...);\n }\n\n return debug(name, b, function);\n}\n\nvoid remove_nop(std::shared_ptr<mtac::Function> function){\n for(auto& block : function->getBasicBlocks()){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(unlikely(boost::get<std::shared_ptr<mtac::NoOp>>(&*it))){\n it.erase();\n continue;\n } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&*it)){\n if((*ptr)->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n }\n\n ++it;\n }\n }\n}\n\n\/\/TODO Find a more elegant way than using pointers\n\ntypedef boost::mpl::vector<mtac::ArithmeticIdentities*, mtac::ReduceInStrength*, mtac::ConstantFolding*> passes;\n\nstruct pass_runner {\n bool optimized = false;\n\n template<typename Pass>\n inline void operator()(Pass* pass){\n if(mtac::pass_traits<Pass>::type == mtac::pass_type::LOCAL){\n std::cout << pass << std::endl;\n } else {\n ASSERT_PATH_NOT_TAKEN(\"Invalid pass type\");\n }\n }\n};\n\nvoid run_all_passes() {\n pass_runner runner;\n\n do{\n boost::mpl::for_each<passes>(runner);\n } while(runner.optimized);\n}\n\nvoid optimize_function(std::shared_ptr<mtac::Function> function, std::shared_ptr<StringPool> pool, Platform platform){\n run_all_passes();\n\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n bool optimized;\n do {\n optimized = false;\n\n optimized |= debug(\"Aritmetic Identities\", &apply_to_all<mtac::ArithmeticIdentities>, function);\n optimized |= debug(\"Reduce in Strength\", &apply_to_all<mtac::ReduceInStrength>, function);\n optimized |= debug(\"Constant folding\", &apply_to_all<mtac::ConstantFolding>, function);\n\n optimized |= debug(\"Constant propagation\", &data_flow_optimization<mtac::ConstantPropagationProblem>, function);\n optimized |= debug(\"Offset Constant Propagation\", &data_flow_optimization<mtac::OffsetConstantPropagationProblem, std::shared_ptr<StringPool>, Platform>, function, pool, platform);\n\n optimized |= debug(\"Common Subexpression Elimination\", &data_flow_optimization<mtac::CommonSubexpressionElimination>, function);\n\n optimized |= debug(\"Pointer Propagation\", &apply_to_basic_blocks<mtac::PointerPropagation>, function);\n optimized |= debug(\"Math Propagation\", &apply_to_basic_blocks_two_pass<mtac::MathPropagation>, function);\n\n optimized |= debug(\"Optimize Branches\", &mtac::optimize_branches, function);\n optimized |= debug(\"Optimize Concat\", &mtac::optimize_concat, function, pool);\n optimized |= debug(\"Remove dead basic block\", &mtac::remove_dead_basic_blocks, function);\n optimized |= debug(\"Merge basic block\", &mtac::merge_basic_blocks, function);\n\n remove_nop(function);\n optimized |= debug(\"Dead-Code Elimination\", &mtac::dead_code_elimination, function);\n \n optimized |= debug(\"Remove aliases\", &mtac::remove_aliases, function);\n\n optimized |= debug(\"Loop Invariant Code Motion\", &mtac::loop_invariant_code_motion, function);\n optimized |= debug(\"Loop Induction Variables Optimization\", &mtac::loop_induction_variables_optimization, function);\n optimized |= debug(\"Remove empty loops\", &mtac::remove_empty_loops, function);\n\n \/\/Remove variables that are not used after optimizations\n clean_variables(function);\n } while (optimized);\n}\n\nvoid basic_optimize_function(std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start basic optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n debug(\"Constant folding\", apply_to_all<mtac::ConstantFolding>(function), function);\n}\n\nvoid optimize_all_functions(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration){\n PerfsTimer timer(\"Whole optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"single-threaded\")){\n for(auto& function : functions){\n optimize_function(function, string_pool, platform);\n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &string_pool, platform, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n optimize_function(functions[i], string_pool, platform); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n bool optimized = false;\n do{\n mtac::remove_unused_functions(program);\n\n optimize_all_functions(program, string_pool, platform, configuration);\n\n optimized = mtac::remove_empty_functions(program);\n optimized = mtac::inline_functions(program, configuration);\n } while(optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n basic_optimize(program, string_pool, configuration);\n }\n \n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n}\n\nvoid mtac::Optimizer::basic_optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> \/*string_pool*\/, std::shared_ptr<Configuration> configuration) const {\n PerfsTimer timer(\"Whole basic optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"single-threaded\")){\n for(auto& function : functions){\n basic_optimize_function(function); \n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n basic_optimize_function(functions[i]); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n<commit_msg>Run local passes<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n\n#include \"boost_cfg.hpp\"\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\n#include \"VisitorUtils.hpp\"\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n\n#include \"mtac\/pass_traits.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Printer.hpp\"\n#include \"mtac\/TemporaryAllocator.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/VariableOptimizations.hpp\"\n#include \"mtac\/FunctionOptimizations.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/BasicBlockOptimizations.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/ConcatReduction.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_optimizations.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/RemoveAssign.hpp\"\n#include \"mtac\/RemoveMultipleAssign.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nconst unsigned int MAX_THREADS = 2;\n\ntemplate<typename Visitor>\nbool apply_to_all(std::shared_ptr<mtac::Function> function){\n Visitor visitor;\n\n mtac::visit_all_statements(visitor, function);\n\n return visitor.optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks_two_pass(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visitor.pass = mtac::Pass::DATA_MINING;\n\n visit_each(visitor, block->statements);\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Problem, typename... Args>\nbool data_flow_optimization(std::shared_ptr<mtac::Function> function, Args... args){\n bool optimized = false;\n\n Problem problem(args...);\n\n auto results = mtac::data_flow(function, problem);\n\n \/\/Once the data-flow problem is fixed, statements can be optimized\n for(auto& block : function->getBasicBlocks()){\n for(auto& statement : block->statements){\n optimized |= problem.optimize(statement, results);\n }\n }\n\n return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n if(b){\n log::emit<Debug>(\"Optimizer\") << name << \" returned true\" << log::endl;\n\n \/\/Print the function\n print(function);\n } else {\n log::emit<Debug>(\"Optimizer\") << name << \" returned false\" << log::endl;\n }\n }\n\n return b;\n}\n\ntemplate<typename Functor, typename... Args>\nbool debug(const std::string& name, Functor functor, std::shared_ptr<mtac::Function> function, Args... args){\n bool b;\n {\n PerfsTimer timer(name);\n\n b = functor(function, args...);\n }\n\n return debug(name, b, function);\n}\n\nvoid remove_nop(std::shared_ptr<mtac::Function> function){\n for(auto& block : function->getBasicBlocks()){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(unlikely(boost::get<std::shared_ptr<mtac::NoOp>>(&*it))){\n it.erase();\n continue;\n } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&*it)){\n if((*ptr)->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n }\n\n ++it;\n }\n }\n}\n\n\/\/TODO Find a more elegant way than using pointers\n\ntypedef boost::mpl::vector<mtac::ArithmeticIdentities*, mtac::ReduceInStrength*, mtac::ConstantFolding*> passes;\n\nstruct pass_runner {\n bool optimized = false;\n std::shared_ptr<mtac::Function> function;\n\n pass_runner(std::shared_ptr<mtac::Function> function) : function(function) {};\n\n template<typename Pass>\n inline void operator()(Pass*){\n bool local = false;\n \n if(mtac::pass_traits<Pass>::type == mtac::pass_type::LOCAL){\n local = apply_to_all<Pass>(function);\n } \n\n if(local){\n\n }\n\n optimized = local;\n }\n};\n\nvoid run_all_passes(std::shared_ptr<mtac::Function> function) {\n pass_runner runner(function);\n\n do{\n boost::mpl::for_each<passes>(runner);\n } while(runner.optimized);\n}\n\nvoid optimize_function(std::shared_ptr<mtac::Function> function, std::shared_ptr<StringPool> pool, Platform platform){\n run_all_passes(function);\n\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n bool optimized;\n do {\n optimized = false;\n\n optimized |= debug(\"Aritmetic Identities\", &apply_to_all<mtac::ArithmeticIdentities>, function);\n optimized |= debug(\"Reduce in Strength\", &apply_to_all<mtac::ReduceInStrength>, function);\n optimized |= debug(\"Constant folding\", &apply_to_all<mtac::ConstantFolding>, function);\n\n optimized |= debug(\"Constant propagation\", &data_flow_optimization<mtac::ConstantPropagationProblem>, function);\n optimized |= debug(\"Offset Constant Propagation\", &data_flow_optimization<mtac::OffsetConstantPropagationProblem, std::shared_ptr<StringPool>, Platform>, function, pool, platform);\n\n optimized |= debug(\"Common Subexpression Elimination\", &data_flow_optimization<mtac::CommonSubexpressionElimination>, function);\n\n optimized |= debug(\"Pointer Propagation\", &apply_to_basic_blocks<mtac::PointerPropagation>, function);\n optimized |= debug(\"Math Propagation\", &apply_to_basic_blocks_two_pass<mtac::MathPropagation>, function);\n\n optimized |= debug(\"Optimize Branches\", &mtac::optimize_branches, function);\n optimized |= debug(\"Optimize Concat\", &mtac::optimize_concat, function, pool);\n optimized |= debug(\"Remove dead basic block\", &mtac::remove_dead_basic_blocks, function);\n optimized |= debug(\"Merge basic block\", &mtac::merge_basic_blocks, function);\n\n remove_nop(function);\n optimized |= debug(\"Dead-Code Elimination\", &mtac::dead_code_elimination, function);\n \n optimized |= debug(\"Remove aliases\", &mtac::remove_aliases, function);\n\n optimized |= debug(\"Loop Invariant Code Motion\", &mtac::loop_invariant_code_motion, function);\n optimized |= debug(\"Loop Induction Variables Optimization\", &mtac::loop_induction_variables_optimization, function);\n optimized |= debug(\"Remove empty loops\", &mtac::remove_empty_loops, function);\n\n \/\/Remove variables that are not used after optimizations\n clean_variables(function);\n } while (optimized);\n}\n\nvoid basic_optimize_function(std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start basic optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n debug(\"Constant folding\", apply_to_all<mtac::ConstantFolding>(function), function);\n}\n\nvoid optimize_all_functions(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration){\n PerfsTimer timer(\"Whole optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"single-threaded\")){\n for(auto& function : functions){\n optimize_function(function, string_pool, platform);\n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &string_pool, platform, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n optimize_function(functions[i], string_pool, platform); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n bool optimized = false;\n do{\n mtac::remove_unused_functions(program);\n\n optimize_all_functions(program, string_pool, platform, configuration);\n\n optimized = mtac::remove_empty_functions(program);\n optimized = mtac::inline_functions(program, configuration);\n } while(optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n basic_optimize(program, string_pool, configuration);\n }\n \n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n}\n\nvoid mtac::Optimizer::basic_optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> \/*string_pool*\/, std::shared_ptr<Configuration> configuration) const {\n PerfsTimer timer(\"Whole basic optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"single-threaded\")){\n for(auto& function : functions){\n basic_optimize_function(function); \n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n basic_optimize_function(functions[i]); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n#include <type_traits>\n\n#include \"boost_cfg.hpp\"\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n#include \"timing.hpp\"\n#include \"GlobalContext.hpp\"\n\n#include \"ltac\/Statement.hpp\"\n\n#include \"mtac\/pass_traits.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/ControlFlowGraph.hpp\"\n#include \"mtac\/Quadruple.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/conditional_propagation.hpp\"\n#include \"mtac\/remove_aliases.hpp\"\n#include \"mtac\/clean_variables.hpp\"\n#include \"mtac\/remove_unused_functions.hpp\"\n#include \"mtac\/remove_empty_functions.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/merge_basic_blocks.hpp\"\n#include \"mtac\/remove_dead_basic_blocks.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_analysis.hpp\"\n#include \"mtac\/induction_variable_optimizations.hpp\"\n#include \"mtac\/loop_unrolling.hpp\"\n#include \"mtac\/complete_loop_peeling.hpp\"\n#include \"mtac\/remove_empty_loops.hpp\"\n#include \"mtac\/loop_invariant_code_motion.hpp\"\n#include \"mtac\/parameter_propagation.hpp\"\n#include \"mtac\/pure_analysis.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\n#include \"ltac\/Register.hpp\"\n#include \"ltac\/FloatRegister.hpp\"\n#include \"ltac\/PseudoRegister.hpp\"\n#include \"ltac\/PseudoFloatRegister.hpp\"\n#include \"ltac\/Address.hpp\"\n\nusing namespace eddic;\n\nnamespace eddic {\nnamespace mtac {\n\ntypedef boost::mpl::vector<\n mtac::ConstantFolding*\n > basic_passes;\n\nstruct all_basic_optimizations {};\n\ntemplate<>\nstruct pass_traits<all_basic_optimizations> {\n STATIC_CONSTANT(pass_type, type, pass_type::IPA_SUB);\n STATIC_STRING(name, \"all_basic_optimizations\");\n STATIC_CONSTANT(unsigned int, property_flags, 0);\n STATIC_CONSTANT(unsigned int, todo_after_flags, 0);\n\n typedef basic_passes sub_passes;\n};\n\ntypedef boost::mpl::vector<\n mtac::ArithmeticIdentities*, \n mtac::ReduceInStrength*, \n mtac::ConstantFolding*, \n mtac::conditional_propagation*,\n mtac::ConstantPropagationProblem*,\n mtac::OffsetConstantPropagationProblem*,\n mtac::CommonSubexpressionElimination*,\n mtac::PointerPropagation*,\n mtac::MathPropagation*,\n mtac::optimize_branches*,\n mtac::remove_dead_basic_blocks*,\n mtac::merge_basic_blocks*,\n mtac::dead_code_elimination*,\n mtac::remove_aliases*,\n mtac::loop_analysis*,\n mtac::loop_invariant_code_motion*,\n mtac::loop_induction_variables_optimization*,\n mtac::remove_empty_loops*,\n mtac::complete_loop_peeling*,\n mtac::loop_unrolling*,\n mtac::clean_variables*\n > passes;\n\nstruct all_optimizations {};\n\ntemplate<>\nstruct pass_traits<all_optimizations> {\n STATIC_CONSTANT(pass_type, type, pass_type::IPA_SUB);\n STATIC_STRING(name, \"all_optimizations\");\n STATIC_CONSTANT(unsigned int, property_flags, 0);\n STATIC_CONSTANT(unsigned int, todo_after_flags, 0);\n\n typedef passes sub_passes;\n};\n\n}\n}\n\nnamespace {\n\ntemplate<typename T, typename Sign> \nstruct has_gate { \n typedef char yes[1]; \n typedef char no [2]; \n template <typename U, U> struct type_check; \n template <typename _1> static yes &chk(type_check<Sign, &_1::gate> *); \n template <typename > static no &chk(...); \n static bool const value = sizeof(chk<T>(0)) == sizeof(yes); \n};\n\ntypedef boost::mpl::vector<\n mtac::remove_unused_functions*,\n mtac::all_basic_optimizations*\n > ipa_basic_passes;\n\ntypedef boost::mpl::vector<\n mtac::remove_unused_functions*,\n mtac::pure_analysis*,\n mtac::all_optimizations*,\n mtac::remove_empty_functions*,\n mtac::remove_unused_functions*,\n mtac::inline_functions*,\n mtac::parameter_propagation*\n > ipa_passes;\n\ntemplate<typename Pass>\nstruct need_pool {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_POOL;\n};\n\ntemplate<typename Pass>\nstruct need_platform {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_PLATFORM;\n};\n\ntemplate<typename Pass>\nstruct need_configuration {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_CONFIGURATION;\n};\n\ntemplate<typename Pass>\nstruct need_program {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_PROGRAM;\n};\n\ntemplate <bool B, typename T = void>\nstruct disable_if {\n typedef T type;\n};\n\ntemplate <typename T>\nstruct disable_if<true,T> {\n \/\/SFINAE\n};\n\nstruct pass_runner {\n bool optimized = false;\n\n mtac::Program& program;\n mtac::Function* function;\n\n std::shared_ptr<StringPool> pool;\n std::shared_ptr<Configuration> configuration;\n Platform platform;\n timing_system& system;\n\n pass_runner(mtac::Program& program, std::shared_ptr<StringPool> pool, std::shared_ptr<Configuration> configuration, Platform platform, timing_system& system) : \n program(program), pool(pool), configuration(configuration), platform(platform), system(system) {};\n\n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::todo_after_flags & mtac::TODO_REMOVE_NOP, void>::type remove_nop(){\n for(auto& block : *function){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(it->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n\n ++it;\n }\n }\n }\n \n template<typename Pass>\n inline typename std::enable_if<!(mtac::pass_traits<Pass>::todo_after_flags & mtac::TODO_REMOVE_NOP), void>::type remove_nop(){\n \/\/NOP\n }\n \n template<typename Pass>\n inline void apply_todo(){\n remove_nop<Pass>();\n }\n\n template<typename Pass>\n inline typename std::enable_if<need_pool<Pass>::value, void>::type set_pool(Pass& pass){\n pass.set_pool(pool);\n }\n \n template<typename Pass>\n inline typename disable_if<need_pool<Pass>::value, void>::type set_pool(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_platform<Pass>::value, void>::type set_platform(Pass& pass){\n pass.set_platform(platform);\n }\n \n template<typename Pass>\n inline typename disable_if<need_platform<Pass>::value, void>::type set_platform(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_configuration<Pass>::value, void>::type set_configuration(Pass& pass){\n pass.set_configuration(configuration);\n }\n \n template<typename Pass>\n inline typename disable_if<need_configuration<Pass>::value, void>::type set_configuration(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_program<Pass>::value, Pass>::type construct(){\n return Pass(program);\n }\n \n template<typename Pass>\n inline typename disable_if<need_program<Pass>::value, Pass>::type construct(){\n return Pass();\n }\n\n template<typename Pass>\n Pass make_pass(){\n auto pass = construct<Pass>();\n\n set_pool(pass);\n set_platform(pass);\n set_configuration(pass);\n\n return pass;\n }\n \n template<typename Pass>\n inline typename std::enable_if<has_gate<Pass, bool(Pass::*)(std::shared_ptr<Configuration>)>::value, bool>::type has_to_be_run(Pass& pass){\n return pass.gate(configuration);\n }\n \n template<typename Pass>\n inline typename disable_if<has_gate<Pass, bool(Pass::*)(std::shared_ptr<Configuration>)>::value, bool>::type has_to_be_run(Pass&){\n return true;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA, bool>::type apply(Pass& pass){\n return pass(program);\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA_SUB, bool>::type apply(Pass&){\n for(auto& function : program.functions){\n this->function = &function;\n \n if(log::enabled<Debug>()){\n LOG<Debug>(\"Optimizer\") << \"Start optimizations on \" << function.get_name() << log::endl;\n\n std::cout << function << std::endl;\n }\n\n boost::mpl::for_each<typename mtac::pass_traits<Pass>::sub_passes>(boost::ref(*this));\n }\n\n return false;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::CUSTOM, bool>::type apply(Pass& pass){\n return pass(*function);\n }\n\n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::LOCAL, bool>::type apply(Pass& visitor){\n for(auto& block : *function){\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n }\n\n return visitor.optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::DATA_FLOW, bool>::type apply(Pass& problem){\n auto results = mtac::data_flow(*function, problem);\n \n \/\/Once the data-flow problem is fixed, statements can be optimized\n return problem.optimize(*function, results);\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::BB, bool>::type apply(Pass& visitor){\n bool optimized = false;\n\n for(auto& block : *function){\n visitor.clear();\n\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::BB_TWO_PASS, bool>::type apply(Pass& visitor){\n bool optimized = false;\n\n for(auto& block : *function){\n visitor.clear();\n\n visitor.pass = mtac::Pass::DATA_MINING;\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<boost::type_traits::ice_or<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA, mtac::pass_traits<Pass>::type == mtac::pass_type::IPA_SUB>::value, void>::type \n debug_local(bool local){\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned \" << local << log::endl;\n }\n\n template<typename Pass>\n inline typename std::enable_if<boost::type_traits::ice_and<mtac::pass_traits<Pass>::type != mtac::pass_type::IPA, mtac::pass_traits<Pass>::type != mtac::pass_type::IPA_SUB>::value, void>::type \n debug_local(bool local){\n if(log::enabled<Debug>()){\n if(local){\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned true\" << log::endl;\n\n \/\/Print the function\n std::cout << *function << std::endl;\n } else {\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned false\" << log::endl;\n }\n }\n }\n\n template<typename Pass>\n inline void operator()(Pass*){\n auto pass = make_pass<Pass>();\n\n if(has_to_be_run(pass)){\n bool local = false;\n {\n PerfsTimer perfs_timer(mtac::pass_traits<Pass>::name());\n timing_timer timer(system, mtac::pass_traits<Pass>::name());\n\n local = apply<Pass>(pass);\n }\n\n if(local){\n program.context->stats().inc_counter(std::string(mtac::pass_traits<Pass>::name()) + \"_true\");\n apply_todo<Pass>();\n }\n\n debug_local<Pass>(local);\n\n optimized |= local;\n }\n }\n};\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(mtac::Program& program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n timing_timer timer(program.context->timing(), \"whole_optimizations\");\n \n \/\/Build the CFG of each functions (also needed for register allocation)\n for(auto& function : program.functions){\n mtac::build_control_flow_graph(function);\n }\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n \/\/Apply Interprocedural Optimizations\n pass_runner runner(program, string_pool, configuration, platform, program.context->timing());\n do{\n runner.optimized = false;\n boost::mpl::for_each<ipa_passes>(boost::ref(runner));\n } while(runner.optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n pass_runner runner(program, string_pool, configuration, platform, program.context->timing());\n boost::mpl::for_each<ipa_basic_passes>(boost::ref(runner));\n }\n}\n<commit_msg>Time the construction of the CFGs<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011-2013.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n#include <type_traits>\n\n#include \"boost_cfg.hpp\"\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/for_each.hpp>\n\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n#include \"timing.hpp\"\n#include \"GlobalContext.hpp\"\n\n#include \"ltac\/Statement.hpp\"\n\n#include \"mtac\/pass_traits.hpp\"\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/ControlFlowGraph.hpp\"\n#include \"mtac\/Quadruple.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/conditional_propagation.hpp\"\n#include \"mtac\/remove_aliases.hpp\"\n#include \"mtac\/clean_variables.hpp\"\n#include \"mtac\/remove_unused_functions.hpp\"\n#include \"mtac\/remove_empty_functions.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/merge_basic_blocks.hpp\"\n#include \"mtac\/remove_dead_basic_blocks.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_analysis.hpp\"\n#include \"mtac\/induction_variable_optimizations.hpp\"\n#include \"mtac\/loop_unrolling.hpp\"\n#include \"mtac\/complete_loop_peeling.hpp\"\n#include \"mtac\/remove_empty_loops.hpp\"\n#include \"mtac\/loop_invariant_code_motion.hpp\"\n#include \"mtac\/parameter_propagation.hpp\"\n#include \"mtac\/pure_analysis.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\n#include \"ltac\/Register.hpp\"\n#include \"ltac\/FloatRegister.hpp\"\n#include \"ltac\/PseudoRegister.hpp\"\n#include \"ltac\/PseudoFloatRegister.hpp\"\n#include \"ltac\/Address.hpp\"\n\nusing namespace eddic;\n\nnamespace eddic {\nnamespace mtac {\n\ntypedef boost::mpl::vector<\n mtac::ConstantFolding*\n > basic_passes;\n\nstruct all_basic_optimizations {};\n\ntemplate<>\nstruct pass_traits<all_basic_optimizations> {\n STATIC_CONSTANT(pass_type, type, pass_type::IPA_SUB);\n STATIC_STRING(name, \"all_basic_optimizations\");\n STATIC_CONSTANT(unsigned int, property_flags, 0);\n STATIC_CONSTANT(unsigned int, todo_after_flags, 0);\n\n typedef basic_passes sub_passes;\n};\n\ntypedef boost::mpl::vector<\n mtac::ArithmeticIdentities*, \n mtac::ReduceInStrength*, \n mtac::ConstantFolding*, \n mtac::conditional_propagation*,\n mtac::ConstantPropagationProblem*,\n mtac::OffsetConstantPropagationProblem*,\n mtac::CommonSubexpressionElimination*,\n mtac::PointerPropagation*,\n mtac::MathPropagation*,\n mtac::optimize_branches*,\n mtac::remove_dead_basic_blocks*,\n mtac::merge_basic_blocks*,\n mtac::dead_code_elimination*,\n mtac::remove_aliases*,\n mtac::loop_analysis*,\n mtac::loop_invariant_code_motion*,\n mtac::loop_induction_variables_optimization*,\n mtac::remove_empty_loops*,\n mtac::complete_loop_peeling*,\n mtac::loop_unrolling*,\n mtac::clean_variables*\n > passes;\n\nstruct all_optimizations {};\n\ntemplate<>\nstruct pass_traits<all_optimizations> {\n STATIC_CONSTANT(pass_type, type, pass_type::IPA_SUB);\n STATIC_STRING(name, \"all_optimizations\");\n STATIC_CONSTANT(unsigned int, property_flags, 0);\n STATIC_CONSTANT(unsigned int, todo_after_flags, 0);\n\n typedef passes sub_passes;\n};\n\n}\n}\n\nnamespace {\n\ntemplate<typename T, typename Sign> \nstruct has_gate { \n typedef char yes[1]; \n typedef char no [2]; \n template <typename U, U> struct type_check; \n template <typename _1> static yes &chk(type_check<Sign, &_1::gate> *); \n template <typename > static no &chk(...); \n static bool const value = sizeof(chk<T>(0)) == sizeof(yes); \n};\n\ntypedef boost::mpl::vector<\n mtac::remove_unused_functions*,\n mtac::all_basic_optimizations*\n > ipa_basic_passes;\n\ntypedef boost::mpl::vector<\n mtac::remove_unused_functions*,\n mtac::pure_analysis*,\n mtac::all_optimizations*,\n mtac::remove_empty_functions*,\n mtac::remove_unused_functions*,\n mtac::inline_functions*,\n mtac::parameter_propagation*\n > ipa_passes;\n\ntemplate<typename Pass>\nstruct need_pool {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_POOL;\n};\n\ntemplate<typename Pass>\nstruct need_platform {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_PLATFORM;\n};\n\ntemplate<typename Pass>\nstruct need_configuration {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_CONFIGURATION;\n};\n\ntemplate<typename Pass>\nstruct need_program {\n static const bool value = mtac::pass_traits<Pass>::property_flags & mtac::PROPERTY_PROGRAM;\n};\n\ntemplate <bool B, typename T = void>\nstruct disable_if {\n typedef T type;\n};\n\ntemplate <typename T>\nstruct disable_if<true,T> {\n \/\/SFINAE\n};\n\nstruct pass_runner {\n bool optimized = false;\n\n mtac::Program& program;\n mtac::Function* function;\n\n std::shared_ptr<StringPool> pool;\n std::shared_ptr<Configuration> configuration;\n Platform platform;\n timing_system& system;\n\n pass_runner(mtac::Program& program, std::shared_ptr<StringPool> pool, std::shared_ptr<Configuration> configuration, Platform platform, timing_system& system) : \n program(program), pool(pool), configuration(configuration), platform(platform), system(system) {};\n\n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::todo_after_flags & mtac::TODO_REMOVE_NOP, void>::type remove_nop(){\n for(auto& block : *function){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(it->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n\n ++it;\n }\n }\n }\n \n template<typename Pass>\n inline typename std::enable_if<!(mtac::pass_traits<Pass>::todo_after_flags & mtac::TODO_REMOVE_NOP), void>::type remove_nop(){\n \/\/NOP\n }\n \n template<typename Pass>\n inline void apply_todo(){\n remove_nop<Pass>();\n }\n\n template<typename Pass>\n inline typename std::enable_if<need_pool<Pass>::value, void>::type set_pool(Pass& pass){\n pass.set_pool(pool);\n }\n \n template<typename Pass>\n inline typename disable_if<need_pool<Pass>::value, void>::type set_pool(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_platform<Pass>::value, void>::type set_platform(Pass& pass){\n pass.set_platform(platform);\n }\n \n template<typename Pass>\n inline typename disable_if<need_platform<Pass>::value, void>::type set_platform(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_configuration<Pass>::value, void>::type set_configuration(Pass& pass){\n pass.set_configuration(configuration);\n }\n \n template<typename Pass>\n inline typename disable_if<need_configuration<Pass>::value, void>::type set_configuration(Pass&){\n \/\/NOP\n }\n \n template<typename Pass>\n inline typename std::enable_if<need_program<Pass>::value, Pass>::type construct(){\n return Pass(program);\n }\n \n template<typename Pass>\n inline typename disable_if<need_program<Pass>::value, Pass>::type construct(){\n return Pass();\n }\n\n template<typename Pass>\n Pass make_pass(){\n auto pass = construct<Pass>();\n\n set_pool(pass);\n set_platform(pass);\n set_configuration(pass);\n\n return pass;\n }\n \n template<typename Pass>\n inline typename std::enable_if<has_gate<Pass, bool(Pass::*)(std::shared_ptr<Configuration>)>::value, bool>::type has_to_be_run(Pass& pass){\n return pass.gate(configuration);\n }\n \n template<typename Pass>\n inline typename disable_if<has_gate<Pass, bool(Pass::*)(std::shared_ptr<Configuration>)>::value, bool>::type has_to_be_run(Pass&){\n return true;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA, bool>::type apply(Pass& pass){\n return pass(program);\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA_SUB, bool>::type apply(Pass&){\n for(auto& function : program.functions){\n this->function = &function;\n \n if(log::enabled<Debug>()){\n LOG<Debug>(\"Optimizer\") << \"Start optimizations on \" << function.get_name() << log::endl;\n\n std::cout << function << std::endl;\n }\n\n boost::mpl::for_each<typename mtac::pass_traits<Pass>::sub_passes>(boost::ref(*this));\n }\n\n return false;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::CUSTOM, bool>::type apply(Pass& pass){\n return pass(*function);\n }\n\n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::LOCAL, bool>::type apply(Pass& visitor){\n for(auto& block : *function){\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n }\n\n return visitor.optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::DATA_FLOW, bool>::type apply(Pass& problem){\n auto results = mtac::data_flow(*function, problem);\n \n \/\/Once the data-flow problem is fixed, statements can be optimized\n return problem.optimize(*function, results);\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::BB, bool>::type apply(Pass& visitor){\n bool optimized = false;\n\n for(auto& block : *function){\n visitor.clear();\n\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<mtac::pass_traits<Pass>::type == mtac::pass_type::BB_TWO_PASS, bool>::type apply(Pass& visitor){\n bool optimized = false;\n\n for(auto& block : *function){\n visitor.clear();\n\n visitor.pass = mtac::Pass::DATA_MINING;\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n for(auto& quadruple : block->statements){\n visitor(quadruple);\n }\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n }\n \n template<typename Pass>\n inline typename std::enable_if<boost::type_traits::ice_or<mtac::pass_traits<Pass>::type == mtac::pass_type::IPA, mtac::pass_traits<Pass>::type == mtac::pass_type::IPA_SUB>::value, void>::type \n debug_local(bool local){\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned \" << local << log::endl;\n }\n\n template<typename Pass>\n inline typename std::enable_if<boost::type_traits::ice_and<mtac::pass_traits<Pass>::type != mtac::pass_type::IPA, mtac::pass_traits<Pass>::type != mtac::pass_type::IPA_SUB>::value, void>::type \n debug_local(bool local){\n if(log::enabled<Debug>()){\n if(local){\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned true\" << log::endl;\n\n \/\/Print the function\n std::cout << *function << std::endl;\n } else {\n LOG<Debug>(\"Optimizer\") << mtac::pass_traits<Pass>::name() << \" returned false\" << log::endl;\n }\n }\n }\n\n template<typename Pass>\n inline void operator()(Pass*){\n auto pass = make_pass<Pass>();\n\n if(has_to_be_run(pass)){\n bool local = false;\n {\n PerfsTimer perfs_timer(mtac::pass_traits<Pass>::name());\n timing_timer timer(system, mtac::pass_traits<Pass>::name());\n\n local = apply<Pass>(pass);\n }\n\n if(local){\n program.context->stats().inc_counter(std::string(mtac::pass_traits<Pass>::name()) + \"_true\");\n apply_todo<Pass>();\n }\n\n debug_local<Pass>(local);\n\n optimized |= local;\n }\n }\n};\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(mtac::Program& program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n timing_timer timer(program.context->timing(), \"whole_optimizations\");\n \n \/\/Build the CFG of each functions (also needed for register allocation)\n for(auto& function : program.functions){\n timing_timer timer(program.context->timing(), \"build_cfg\");\n mtac::build_control_flow_graph(function);\n }\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n \/\/Apply Interprocedural Optimizations\n pass_runner runner(program, string_pool, configuration, platform, program.context->timing());\n do{\n runner.optimized = false;\n boost::mpl::for_each<ipa_passes>(boost::ref(runner));\n } while(runner.optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n pass_runner runner(program, string_pool, configuration, platform, program.context->timing());\n boost::mpl::for_each<ipa_basic_passes>(boost::ref(runner));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MUNCHAR_TOKENS\n#define MUNCHAR_TOKENS\n\n#include \"munchar.hpp\"\n#include <cctype>\n\nnamespace Munchar {\n namespace Tokens {\n\n constexpr auto null = CHR('\\0');\n constexpr auto tab = CHR('\\t');\n constexpr auto newline = CHR('\\n');\n constexpr auto linefeed = newline;\n constexpr auto cr = CHR('\\r');\n constexpr auto crlf = STR(\"\\r\\n\");\n\n constexpr auto space = CHR(' ');\n constexpr auto exclamation = CHR('!');\n constexpr auto double_quote = CHR('\"');\n constexpr auto quote = double_quote;\n constexpr auto pound = CHR('#');\n constexpr auto hash = pound;\n constexpr auto octothorpe = pound;\n constexpr auto dollar = CHR('$');\n constexpr auto percent = CHR('%');\n constexpr auto ampersand = CHR('&');\n constexpr auto apostrophe = CHR('\\'');\n constexpr auto single_quote = apostrophe;\n constexpr auto left_paren = CHR('(');\n constexpr auto right_paren = CHR(')');\n constexpr auto asterisk = CHR('*');\n constexpr auto plus = CHR('+');\n constexpr auto comma = CHR(',');\n constexpr auto hyphen = CHR('-');\n constexpr auto minus = hyphen;\n constexpr auto period = CHR('.');\n constexpr auto dot = period;\n constexpr auto slash = CHR('\/');\n constexpr auto divide = slash;\n constexpr auto colon = CHR(':');\n constexpr auto semicolon = CHR(';');\n constexpr auto less_than = CHR('<');\n constexpr auto lt = less_than;\n constexpr auto lte = STR(\"<=\");\n constexpr auto equals = CHR('=');\n constexpr auto eq = equals;\n constexpr auto greater_than = CHR('>');\n constexpr auto gt = greater_than;\n constexpr auto gte = STR(\">=\");\n constexpr auto question = CHR('?');\n constexpr auto at = CHR('@');\n constexpr auto left_bracket = CHR('[');\n constexpr auto backslash = CHR('\\\\');\n constexpr auto right_bracket = CHR(']');\n constexpr auto caret = CHR('^');\n constexpr auto circumflex = caret;\n constexpr auto underscore = CHR('_');\n constexpr auto backquote = CHR('`');\n constexpr auto left_brace = CHR('{');\n constexpr auto vertical_bar = CHR('|');\n constexpr auto pipe = vertical_bar;\n constexpr auto right_brace = CHR('}');\n constexpr auto tilde = CHR('~');\n\n constexpr auto _ = Any_Char { };\n constexpr auto letter = MUNCHAR_STATIC_PREDICATE(::isalpha);\n constexpr auto alphanumeric = MUNCHAR_STATIC_PREDICATE(::isalnum);\n constexpr auto digit = MUNCHAR_STATIC_PREDICATE(::isdigit);\n constexpr auto hex_digit = MUNCHAR_STATIC_PREDICATE(::isxdigit);\n constexpr auto ws_char = MUNCHAR_STATIC_PREDICATE(::isspace);\n constexpr auto whitespace = *ws_char;\n constexpr auto sign = CLS(\"+-\");\n constexpr auto id_start = letter | underscore;\n constexpr auto id_body = alphanumeric | underscore;\n constexpr auto identifier = id_start^*id_body;\n constexpr auto integer = ~sign ^ +digit;\n constexpr auto number_ne = ~sign ^ ((*digit ^ dot ^ +digit) | +digit);\n constexpr auto number = number_ne ^ ~(CLS(\"eE\") ^ ~sign ^ +digit);\n constexpr auto escape_seq = backslash ^ _;\n constexpr auto dq_string = double_quote ^\n *(escape_seq | (!CLS(\"\\\"\\\\\") ^ _)) ^\n double_quote;\n constexpr auto sq_string = single_quote ^\n *(escape_seq | (!CLS(\"'\\\\\") ^ _)) ^\n single_quote;\n constexpr auto string = dq_string | sq_string;\n constexpr auto eol = newline | crlf;\n constexpr auto cpp_comment = STR(\"\/\/\") ^ *(!eol ^ _) ^ ~eol;\n constexpr auto c_comment = STR(\"\/*\") ^ *(!STR(\"*\/\") ^ _) ^ STR(\"*\/\");\n constexpr auto sh_comment = CHR('#') ^ *(!eol ^ _) ^ ~eol;\n\n\n constexpr auto ellipsis = STR(\"...\");\n constexpr auto right_arrow = STR(\"->\");\n constexpr auto lisp_true = STR(\"#t\") | STR(\"#T\");\n constexpr auto lisp_false = STR(\"#f\") | STR(\"#F\");\n constexpr auto boolean = lisp_true | lisp_false;\n constexpr auto lisp_id_start = letter | underscore | hyphen | exclamation | dollar | percent | ampersand | asterisk | slash | colon | less_than | eq | greater_than | question | caret | tilde;\n constexpr auto lisp_id_body = alphanumeric | lisp_id_start | plus | minus | dot | at;\n constexpr auto peculiar_identifier = plus | minus | ellipsis | right_arrow^*lisp_id_body;\n constexpr auto lisp_identifier = lisp_id_start^*lisp_id_body | peculiar_identifier;\n\n\n }\n}\n\n#endif<commit_msg>getting ready to take out some unnecessary munchar definitions<commit_after>#ifndef MUNCHAR_TOKENS\n#define MUNCHAR_TOKENS\n\n#include \"munchar.hpp\"\n#include <cctype>\n\nnamespace Munchar {\n namespace Tokens {\n\n constexpr auto null = CHR('\\0');\n constexpr auto tab = CHR('\\t');\n constexpr auto newline = CHR('\\n');\n constexpr auto linefeed = newline;\n constexpr auto cr = CHR('\\r');\n constexpr auto crlf = STR(\"\\r\\n\");\n\n constexpr auto space = CHR(' ');\n constexpr auto exclamation = CHR('!');\n constexpr auto double_quote = CHR('\"');\n constexpr auto quote = double_quote;\n constexpr auto pound = CHR('#');\n constexpr auto hash = pound;\n constexpr auto octothorpe = pound;\n constexpr auto dollar = CHR('$');\n constexpr auto percent = CHR('%');\n constexpr auto ampersand = CHR('&');\n constexpr auto apostrophe = CHR('\\'');\n constexpr auto single_quote = apostrophe;\n constexpr auto left_paren = CHR('(');\n constexpr auto right_paren = CHR(')');\n constexpr auto asterisk = CHR('*');\n constexpr auto plus = CHR('+');\n constexpr auto comma = CHR(',');\n constexpr auto hyphen = CHR('-');\n constexpr auto minus = hyphen;\n constexpr auto period = CHR('.');\n constexpr auto dot = period;\n constexpr auto slash = CHR('\/');\n constexpr auto divide = slash;\n constexpr auto colon = CHR(':');\n constexpr auto semicolon = CHR(';');\n constexpr auto less_than = CHR('<');\n constexpr auto lt = less_than;\n constexpr auto lte = STR(\"<=\");\n constexpr auto equals = CHR('=');\n constexpr auto eq = equals;\n constexpr auto greater_than = CHR('>');\n constexpr auto gt = greater_than;\n constexpr auto gte = STR(\">=\");\n constexpr auto question = CHR('?');\n constexpr auto at = CHR('@');\n constexpr auto left_bracket = CHR('[');\n constexpr auto backslash = CHR('\\\\');\n constexpr auto right_bracket = CHR(']');\n constexpr auto caret = CHR('^');\n constexpr auto circumflex = caret;\n constexpr auto underscore = CHR('_');\n constexpr auto backquote = CHR('`');\n constexpr auto left_brace = CHR('{');\n constexpr auto vertical_bar = CHR('|');\n constexpr auto pipe = vertical_bar;\n constexpr auto right_brace = CHR('}');\n constexpr auto tilde = CHR('~');\n\n constexpr auto _ = Any_Char { };\n constexpr auto letter = MUNCHAR_STATIC_PREDICATE(::isalpha);\n constexpr auto alphanumeric = MUNCHAR_STATIC_PREDICATE(::isalnum);\n constexpr auto digit = MUNCHAR_STATIC_PREDICATE(::isdigit);\n constexpr auto hex_digit = MUNCHAR_STATIC_PREDICATE(::isxdigit);\n constexpr auto ws_char = MUNCHAR_STATIC_PREDICATE(::isspace);\n constexpr auto whitespace = *ws_char;\n constexpr auto sign = CLS(\"+-\");\n constexpr auto id_start = letter | underscore;\n constexpr auto id_body = alphanumeric | underscore;\n constexpr auto identifier = id_start^*id_body;\n constexpr auto integer = ~sign ^ +digit;\n constexpr auto number_ne = ~sign ^ ((*digit ^ dot ^ +digit) | +digit);\n constexpr auto number = number_ne ^ ~(CLS(\"eE\") ^ ~sign ^ +digit);\n constexpr auto escape_seq = backslash ^ _;\n constexpr auto dq_string = double_quote ^\n *(escape_seq | (!CLS(\"\\\"\\\\\") ^ _)) ^\n double_quote;\n constexpr auto sq_string = single_quote ^\n *(escape_seq | (!CLS(\"'\\\\\") ^ _)) ^\n single_quote;\n constexpr auto string = dq_string | sq_string;\n constexpr auto eol = newline | crlf;\n constexpr auto cpp_comment = STR(\"\/\/\") ^ *(!eol ^ _) ^ ~eol;\n constexpr auto c_comment = STR(\"\/*\") ^ *(!STR(\"*\/\") ^ _) ^ STR(\"*\/\");\n constexpr auto sh_comment = CHR('#') ^ *(!eol ^ _) ^ ~eol;\n\n\n constexpr auto ellipsis = STR(\"...\");\n constexpr auto right_arrow = STR(\"->\");\n constexpr auto lisp_true = STR(\"#t\") | STR(\"#T\");\n constexpr auto lisp_false = STR(\"#f\") | STR(\"#F\");\n constexpr auto boolean = lisp_true | lisp_false;\n constexpr auto lisp_id_start = letter | underscore | hyphen | exclamation | dollar | percent | ampersand | asterisk | slash | colon | less_than | eq | greater_than | question | caret | tilde;\n constexpr auto lisp_id_body = alphanumeric | lisp_id_start | plus | minus | dot | at;\n constexpr auto peculiar_identifier = plus | minus | ellipsis | right_arrow^*lisp_id_body;\n constexpr auto lisp_identifier = lisp_id_start^*lisp_id_body | peculiar_identifier;\n\n \/\/ constexpr auto lparen = CHR('(');\n \/\/ constexpr auto rparen = CHR(')');\n \/\/ constexpr auto hash = CHR('#');\n \/\/ constexpr auto quote = CHR('\\'');\n \/\/ constexpr auto hash_t = hash ^ CLS(\"tT\");\n \/\/ constexpr auto hash_f = hash ^ CLS(\"fF\");\n \/\/ constexpr auto boolean = hash ^ CLS(\"tfTF\");\n \/\/ constexpr auto string = double_quote ^\n \/\/ *(escape_seq | (!CLS(\"\\\"\\\\\") ^ _)) ^\n \/\/ double_quote;\n \n\n }\n}\n\n#endif<|endoftext|>"} {"text":"<commit_before>#include \"trainer.h\"\n#include \"common\/timer.h\"\n#include \"common\/logger.h\"\n#include \"optimize\/opt_gd.hpp\"\n#include \"optimize\/opt_cgd.hpp\"\n#include \"optimize\/opt_lbfgs.hpp\"\n#include \"sampler.h\"\n#include \"accumulator.h\"\n\nnamespace ncv\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n trainer_state_t::trainer_state_t(size_t n_parameters)\n : m_params(n_parameters),\n m_tvalue(std::numeric_limits<scalar_t>::max()),\n m_terror(std::numeric_limits<scalar_t>::max()),\n m_vvalue(std::numeric_limits<scalar_t>::max()),\n m_verror(std::numeric_limits<scalar_t>::max()),\n m_lambda(std::numeric_limits<scalar_t>::max())\n {\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_state_t::update(const vector_t& params,\n scalar_t tvalue, scalar_t terror,\n scalar_t vvalue, scalar_t verror,\n scalar_t lambda)\n {\n if (verror < m_verror)\n {\n m_params = params;\n m_tvalue = tvalue;\n m_terror = terror;\n m_vvalue = vvalue;\n m_verror = verror;\n m_lambda = lambda;\n return true;\n }\n\n else\n {\n return false;\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_state_t::update(const trainer_state_t& state)\n {\n return update(state.m_params,\n state.m_tvalue, state.m_terror, state.m_vvalue, state.m_verror,\n state.m_lambda);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_t::train(\n const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& optimizer, size_t iterations, scalar_t epsilon,\n const model_t& model, trainer_state_t& state)\n {\n \/\/ L2-norm regularization\n const scalars_t lambdas = { 1e-6, 1e-5, 1e-4, 1e-3, 1e-2, 1e-1, 1.0 };\n for (scalar_t lambda : lambdas)\n {\n accumulator_t ldata(model, accumulator_t::type::value, lambda);\n accumulator_t gdata(model, accumulator_t::type::vgrad, lambda);\n\n trainer_t::train(task, tsampler, vsampler, nthreads,\n loss, optimizer, iterations, epsilon,\n model.params(), ldata, gdata, state);\n }\n\n log_info() << \"optimum [train = \" << state.m_tvalue << \"\/\" << state.m_terror\n << \", valid = \" << state.m_vvalue << \"\/\" << state.m_verror\n << \", lambda = \" << state.m_lambda\n << \"].\";\n\n \/\/ OK\n return true;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_t::train(\n const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& optimizer, size_t iterations, scalar_t epsilon,\n const vector_t& x0, accumulator_t& ldata, accumulator_t& gdata, trainer_state_t& state)\n {\n samples_t utsamples = tsampler.get();\n samples_t uvsamples = vsampler.get();\n\n \/\/ construct the optimization problem\n const timer_t timer;\n\n auto fn_size = [&] ()\n {\n return ldata.dimensions();\n };\n\n auto fn_fval = [&] (const vector_t& x)\n {\n \/\/ training samples: loss value\n ldata.reset(x);\n ldata.update(task, utsamples, loss, nthreads);\n const scalar_t tvalue = ldata.value();\n\n return tvalue;\n };\n\n auto fn_fval_grad = [&] (const vector_t& x, vector_t& gx)\n {\n \/\/ stochastic mode: resample training & validation samples\n if (tsampler.is_random())\n {\n utsamples = tsampler.get();\n }\n if (vsampler.is_random())\n {\n uvsamples = vsampler.get();\n }\n\n \/\/ training samples: loss value & gradient\n gdata.reset(x);\n gdata.update(task, utsamples, loss, nthreads);\n const scalar_t tvalue = gdata.value();\n const scalar_t terror = gdata.error();\n gx = gdata.vgrad();\n\n \/\/ validation samples: loss value\n ldata.reset(x);\n ldata.update(task, uvsamples, loss, nthreads);\n const scalar_t vvalue = ldata.value();\n const scalar_t verror = ldata.error();\n\n \/\/ update the optimum state\n state.update(x, tvalue, terror, vvalue, verror, ldata.lambda());\n\n log_info() << \"[grad = \" << gx.lpNorm<Eigen::Infinity>()\n << \", train = \" << tvalue << \"\/\" << terror\n << \", valid = \" << vvalue << \"\/\" << verror\n << \", lambda = \" << ldata.lambda()\n << \"] done in \" << timer.elapsed() << \".\";\n\n return tvalue;\n };\n\n auto fn_wlog = [] (const string_t& message)\n {\n log_warning() << message;\n };\n auto fn_elog = [] (const string_t& message)\n {\n log_error() << message;\n };\n\/\/ auto fn_ulog = [&] (const opt_state_t& result, const timer_t& timer)\n\/\/ {\n\/\/ log_info() << \"[loss = \" << result.f\n\/\/ << \", grad = \" << result.g.lpNorm<Eigen::Infinity>()\n\/\/ << \", funs = \" << result.n_fval_calls() << \"\/\" << result.n_grad_calls()\n\/\/ << \", train* = \" << state.m_tvalue << \"\/\" << state.m_terror\n\/\/ << \", valid* = \" << state.m_vvalue << \"\/\" << state.m_verror\n\/\/ << \", lambda* = \" << ldata.lambda() << \"\/\" << state.m_lambda\n\/\/ << \"] done in \" << timer.elapsed() << \".\";\n\/\/ };\n\n \/\/ assembly optimization problem & optimize the model\n const opt_problem_t problem(fn_size, fn_fval, fn_fval_grad);\n\n\/\/ const opt_opulog_t fn_ulog_ref = std::bind(fn_ulog, _1, std::ref(timer));\n\n if (text::iequals(optimizer, \"lbfgs\"))\n {\n optimize::lbfgs(problem, x0, iterations, epsilon, fn_wlog, fn_elog\/*, fn_ulog_ref*\/);\n }\n else if (text::iequals(optimizer, \"cgd\"))\n {\n optimize::cgd_hs(problem, x0, iterations, epsilon, fn_wlog, fn_elog\/*, fn_ulog_ref*\/);\n }\n else if (text::iequals(optimizer, \"gd\"))\n {\n optimize::gd(problem, x0, iterations, epsilon, fn_wlog, fn_elog\/*, fn_ulog_ref*\/);\n }\n else\n {\n log_error() << \"trainer: invalid optimization method <\" << optimizer << \">!\";\n return false;\n }\n\n \/\/ OK\n return true;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n}\n\t\n<commit_msg>optimization logging<commit_after>#include \"trainer.h\"\n#include \"common\/timer.h\"\n#include \"common\/logger.h\"\n#include \"optimize\/opt_gd.hpp\"\n#include \"optimize\/opt_cgd.hpp\"\n#include \"optimize\/opt_lbfgs.hpp\"\n#include \"sampler.h\"\n#include \"accumulator.h\"\n\nnamespace ncv\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n trainer_state_t::trainer_state_t(size_t n_parameters)\n : m_params(n_parameters),\n m_tvalue(std::numeric_limits<scalar_t>::max()),\n m_terror(std::numeric_limits<scalar_t>::max()),\n m_vvalue(std::numeric_limits<scalar_t>::max()),\n m_verror(std::numeric_limits<scalar_t>::max()),\n m_lambda(std::numeric_limits<scalar_t>::max())\n {\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_state_t::update(const vector_t& params,\n scalar_t tvalue, scalar_t terror,\n scalar_t vvalue, scalar_t verror,\n scalar_t lambda)\n {\n if (verror < m_verror)\n {\n m_params = params;\n m_tvalue = tvalue;\n m_terror = terror;\n m_vvalue = vvalue;\n m_verror = verror;\n m_lambda = lambda;\n return true;\n }\n\n else\n {\n return false;\n }\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_state_t::update(const trainer_state_t& state)\n {\n return update(state.m_params,\n state.m_tvalue, state.m_terror, state.m_vvalue, state.m_verror,\n state.m_lambda);\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_t::train(\n const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& optimizer, size_t iterations, scalar_t epsilon,\n const model_t& model, trainer_state_t& state)\n {\n \/\/ L2-norm regularization\n const scalars_t lambdas = { 1e-6, 1e-5, 1e-4, 1e-3, 1e-2, 1e-1, 1.0 };\n for (scalar_t lambda : lambdas)\n {\n accumulator_t ldata(model, accumulator_t::type::value, lambda);\n accumulator_t gdata(model, accumulator_t::type::vgrad, lambda);\n\n trainer_t::train(task, tsampler, vsampler, nthreads,\n loss, optimizer, iterations, epsilon,\n model.params(), ldata, gdata, state);\n }\n\n log_info() << \"optimum [train = \" << state.m_tvalue << \"\/\" << state.m_terror\n << \", valid = \" << state.m_vvalue << \"\/\" << state.m_verror\n << \", lambda = \" << state.m_lambda\n << \"].\";\n\n \/\/ OK\n return true;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n bool trainer_t::train(\n const task_t& task, const sampler_t& tsampler, const sampler_t& vsampler, size_t nthreads,\n const loss_t& loss, const string_t& optimizer, size_t iterations, scalar_t epsilon,\n const vector_t& x0, accumulator_t& ldata, accumulator_t& gdata, trainer_state_t& state)\n {\n samples_t utsamples = tsampler.get();\n samples_t uvsamples = vsampler.get();\n\n \/\/ construct the optimization problem\n const timer_t timer;\n\n auto fn_size = [&] ()\n {\n return ldata.dimensions();\n };\n\n auto fn_fval = [&] (const vector_t& x)\n {\n \/\/ training samples: loss value\n ldata.reset(x);\n ldata.update(task, utsamples, loss, nthreads);\n const scalar_t tvalue = ldata.value();\n\n return tvalue;\n };\n\n auto fn_fval_grad = [&] (const vector_t& x, vector_t& gx)\n {\n \/\/ stochastic mode: resample training & validation samples\n if (tsampler.is_random())\n {\n utsamples = tsampler.get();\n }\n if (vsampler.is_random())\n {\n uvsamples = vsampler.get();\n }\n\n \/\/ training samples: loss value & gradient\n gdata.reset(x);\n gdata.update(task, utsamples, loss, nthreads);\n const scalar_t tvalue = gdata.value();\n const scalar_t terror = gdata.error();\n gx = gdata.vgrad();\n\n \/\/ validation samples: loss value\n ldata.reset(x);\n ldata.update(task, uvsamples, loss, nthreads);\n const scalar_t vvalue = ldata.value();\n const scalar_t verror = ldata.error();\n\n \/\/ update the optimum state\n state.update(x, tvalue, terror, vvalue, verror, ldata.lambda());\n return tvalue;\n };\n\n auto fn_wlog = [] (const string_t& message)\n {\n log_warning() << message;\n };\n auto fn_elog = [] (const string_t& message)\n {\n log_error() << message;\n };\n auto fn_ulog = [&] (const opt_state_t& result, const timer_t& timer)\n {\n log_info() << \"[loss = \" << result.f\n << \", grad = \" << result.g.lpNorm<Eigen::Infinity>()\n << \", funs = \" << result.n_fval_calls() << \"\/\" << result.n_grad_calls()\n << \", train* = \" << state.m_tvalue << \"\/\" << state.m_terror\n << \", valid* = \" << state.m_vvalue << \"\/\" << state.m_verror\n << \", lambda* = \" << ldata.lambda() << \"\/\" << state.m_lambda\n << \"] done in \" << timer.elapsed() << \".\";\n };\n\n \/\/ assembly optimization problem & optimize the model\n const opt_problem_t problem(fn_size, fn_fval, fn_fval_grad);\n\n const opt_opulog_t fn_ulog_ref = std::bind(fn_ulog, _1, std::ref(timer));\n\n if (text::iequals(optimizer, \"lbfgs\"))\n {\n optimize::lbfgs(problem, x0, iterations, epsilon, fn_wlog, fn_elog, fn_ulog_ref);\n }\n else if (text::iequals(optimizer, \"cgd\"))\n {\n optimize::cgd_hs(problem, x0, iterations, epsilon, fn_wlog, fn_elog, fn_ulog_ref);\n }\n else if (text::iequals(optimizer, \"gd\"))\n {\n optimize::gd(problem, x0, iterations, epsilon, fn_wlog, fn_elog, fn_ulog_ref);\n }\n else\n {\n log_error() << \"trainer: invalid optimization method <\" << optimizer << \">!\";\n return false;\n }\n\n \/\/ OK\n return true;\n }\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n}\n\t\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2016 Incognito\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"..\/natives.h\"\n\n#include \"..\/core.h\"\n#include \"..\/utility.h\"\n\n#include <boost\/geometry.hpp>\n#include <boost\/geometry\/geometries\/geometries.hpp>\n#include <boost\/intrusive_ptr.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/unordered_map.hpp>\n\n#include <Eigen\/Core>\n\ncell AMX_NATIVE_CALL Natives::CreateDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(13, \"CreateDynamicActor\");\n\tif (core->getData()->getGlobalMaxItems(STREAMER_TYPE_ACTOR) == core->getData()->actors.size())\n\t{\n\t\treturn 0;\n\t}\n\tint actorID = Item::Actor::identifier.get();\n\tItem::SharedActor actor(new Item::Actor);\n\tactor->amx = amx;\n\tactor->actorID = actorID;\n\tactor->inverseAreaChecking = false;\n\tactor->originalComparableStreamDistance = -1.0f;\n\tactor->modelID = static_cast<int>(params[1]);\n\tactor->position = Eigen::Vector3f(amx_ctof(params[2]), amx_ctof(params[3]), amx_ctof(params[4]));\n\tactor->rotation = amx_ctof(params[5]);\n\tactor->invulnerable = static_cast<int>(params[6]);\n\tactor->health = amx_ctof(params[7]);\n\tUtility::addToContainer(actor->worlds, static_cast<int>(params[8]));\n\tUtility::addToContainer(actor->interiors, static_cast<int>(params[9]));\n\tUtility::addToContainer(actor->players, static_cast<int>(params[10]));\n\tactor->comparableStreamDistance = amx_ctof(params[11]) < STREAMER_STATIC_DISTANCE_CUTOFF ? amx_ctof(params[11]) : amx_ctof(params[11]) * amx_ctof(params[11]);\n\tactor->streamDistance = amx_ctof(params[11]);\n\tUtility::addToContainer(actor->areas, static_cast<int>(params[12]));\n\tactor->priority = static_cast<int>(params[13]);\n\tcore->getGrid()->addActor(actor);\n\tcore->getData()->actors.insert(std::make_pair(actorID, actor));\n\treturn static_cast<cell>(actorID);\n}\n\ncell AMX_NATIVE_CALL Natives::DestroyDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(1, \"DestroyDynamicActor\");\n\tboost::unordered_map<int, Item::SharedActor>::iterator a = core->getData()->actors.find(static_cast<int>(params[1]));\n\tif (a != core->getData()->actors.end())\n\t{\n\t\tUtility::destroyActor(a);\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\ncell AMX_NATIVE_CALL Natives::IsValidDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(1, \"IsValidDynamicActor\");\n\tboost::unordered_map<int, Item::SharedActor>::iterator a = core->getData()->actors.find(static_cast<int>(params[1]));\n\tif (a != core->getData()->actors.end())\n\t{\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<commit_msg>Fix compilation warning<commit_after>\/*\n * Copyright (C) 2016 Incognito\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"..\/natives.h\"\n\n#include \"..\/core.h\"\n#include \"..\/utility.h\"\n\n#include <boost\/geometry.hpp>\n#include <boost\/geometry\/geometries\/geometries.hpp>\n#include <boost\/intrusive_ptr.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/unordered_map.hpp>\n\n#include <Eigen\/Core>\n\ncell AMX_NATIVE_CALL Natives::CreateDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(13, \"CreateDynamicActor\");\n\tif (core->getData()->getGlobalMaxItems(STREAMER_TYPE_ACTOR) == core->getData()->actors.size())\n\t{\n\t\treturn 0;\n\t}\n\tint actorID = Item::Actor::identifier.get();\n\tItem::SharedActor actor(new Item::Actor);\n\tactor->amx = amx;\n\tactor->actorID = actorID;\n\tactor->inverseAreaChecking = false;\n\tactor->originalComparableStreamDistance = -1.0f;\n\tactor->modelID = static_cast<int>(params[1]);\n\tactor->position = Eigen::Vector3f(amx_ctof(params[2]), amx_ctof(params[3]), amx_ctof(params[4]));\n\tactor->rotation = amx_ctof(params[5]);\n\tactor->invulnerable = static_cast<int>(params[6]) != 0;\n\tactor->health = amx_ctof(params[7]);\n\tUtility::addToContainer(actor->worlds, static_cast<int>(params[8]));\n\tUtility::addToContainer(actor->interiors, static_cast<int>(params[9]));\n\tUtility::addToContainer(actor->players, static_cast<int>(params[10]));\n\tactor->comparableStreamDistance = amx_ctof(params[11]) < STREAMER_STATIC_DISTANCE_CUTOFF ? amx_ctof(params[11]) : amx_ctof(params[11]) * amx_ctof(params[11]);\n\tactor->streamDistance = amx_ctof(params[11]);\n\tUtility::addToContainer(actor->areas, static_cast<int>(params[12]));\n\tactor->priority = static_cast<int>(params[13]);\n\tcore->getGrid()->addActor(actor);\n\tcore->getData()->actors.insert(std::make_pair(actorID, actor));\n\treturn static_cast<cell>(actorID);\n}\n\ncell AMX_NATIVE_CALL Natives::DestroyDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(1, \"DestroyDynamicActor\");\n\tboost::unordered_map<int, Item::SharedActor>::iterator a = core->getData()->actors.find(static_cast<int>(params[1]));\n\tif (a != core->getData()->actors.end())\n\t{\n\t\tUtility::destroyActor(a);\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\ncell AMX_NATIVE_CALL Natives::IsValidDynamicActor(AMX *amx, cell *params)\n{\n\tCHECK_PARAMS(1, \"IsValidDynamicActor\");\n\tboost::unordered_map<int, Item::SharedActor>::iterator a = core->getData()->actors.find(static_cast<int>(params[1]));\n\tif (a != core->getData()->actors.end())\n\t{\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"tgbot\/net\/TgLongPoll.h\"\n\n#include \"tgbot\/Api.h\"\n#include \"tgbot\/Bot.h\"\n#include \"tgbot\/EventHandler.h\"\n\n#include <cstdint>\n#include <memory>\n#include <vector>\n#include <utility>\n\nnamespace TgBot {\n\nTgLongPoll::TgLongPoll(const Api* api, const EventHandler* eventHandler, std::int32_t limit, std::int32_t timeout, std::shared_ptr<std::vector<std::string>> allowUpdates)\n : _api(api), _eventHandler(eventHandler), _limit(limit), _timeout(timeout),\n _allowUpdates(std::move(allowUpdates)) {\n}\n\nTgLongPoll::TgLongPoll(const Bot& bot, std::int32_t limit, std::int32_t timeout, const std::shared_ptr<std::vector<std::string>>& allowUpdates) :\n TgLongPoll(&bot.getApi(), &bot.getEventHandler(), limit, timeout, allowUpdates) {\n}\n\nvoid TgLongPoll::start() {\n std::vector<Update::Ptr> updates = _api->getUpdates(_lastUpdateId, _limit, _timeout, _allowUpdates);\n for (Update::Ptr& item : updates) {\n if (item->updateId >= _lastUpdateId) {\n _lastUpdateId = item->updateId + 1;\n }\n _eventHandler->handleUpdate(item);\n }\n}\n\n}\n<commit_msg>Confirm updates directly after handling them (#231)<commit_after>#include \"tgbot\/net\/TgLongPoll.h\"\n\n#include \"tgbot\/Api.h\"\n#include \"tgbot\/Bot.h\"\n#include \"tgbot\/EventHandler.h\"\n\n#include <cstdint>\n#include <memory>\n#include <vector>\n#include <utility>\n\nnamespace TgBot {\n\nTgLongPoll::TgLongPoll(const Api* api, const EventHandler* eventHandler, std::int32_t limit, std::int32_t timeout, std::shared_ptr<std::vector<std::string>> allowUpdates)\n : _api(api), _eventHandler(eventHandler), _limit(limit), _timeout(timeout),\n _allowUpdates(std::move(allowUpdates)) {\n}\n\nTgLongPoll::TgLongPoll(const Bot& bot, std::int32_t limit, std::int32_t timeout, const std::shared_ptr<std::vector<std::string>>& allowUpdates) :\n TgLongPoll(&bot.getApi(), &bot.getEventHandler(), limit, timeout, allowUpdates) {\n}\n\nvoid TgLongPoll::start() {\n \/\/ get all unconfirmed updates\n std::vector<Update::Ptr> updates = _api->getUpdates(0, _limit, _timeout, _allowUpdates);\n\n \/\/ handle updates\n for (Update::Ptr& item : updates) {\n if (item->updateId >= _lastUpdateId) {\n _lastUpdateId = item->updateId + 1;\n }\n _eventHandler->handleUpdate(item);\n }\n\n \/\/ confirm handled updates\n _api->getUpdates(_lastUpdateId, _limit, _timeout, _allowUpdates);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This code is in the public domain -- icastano@gmail.com\n\n#include \"Fitting.h\"\n\n#include <nvcore\/Algorithms.h> \/\/ max\n#include <nvcore\/Containers.h> \/\/ swap\n#include <float.h> \/\/ FLT_MAX\n\nusing namespace nv;\n\n\nVector3 nv::ComputeCentroid(int n, const Vector3 * points, const float * weights, Vector3::Arg metric)\n{\n\tVector3 centroid(zero);\n\tfloat total = 0.0f;\n\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\ttotal += weights[i];\n\t\tcentroid += weights[i]*points[i];\n\t}\n\tcentroid \/= total;\n\n\treturn centroid;\n}\n\n\nvoid nv::ComputeCovariance(int n, const Vector3 * points, const float * weights, Vector3::Arg metric, float * covariance)\n{\n\t\/\/ compute the centroid\n\tVector3 centroid = ComputeCentroid(n, points, weights, metric);\n\n\t\/\/ compute covariance matrix\n\tfor (int i = 0; i < 6; i++)\n\t{\n\t\tcovariance[i] = 0.0f;\n\t}\n\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tVector3 a = (points[i] - centroid) * metric;\n\t\tVector3 b = weights[i]*a;\n\t\t\n\t\tcovariance[0] += a.x()*b.x();\n\t\tcovariance[1] += a.x()*b.y();\n\t\tcovariance[2] += a.x()*b.z();\n\t\tcovariance[3] += a.y()*b.y();\n\t\tcovariance[4] += a.y()*b.z();\n\t\tcovariance[5] += a.z()*b.z();\n\t}\n}\n\nVector3 nv::ComputePrincipalComponent(int n, const Vector3 * points, const float * weights, Vector3::Arg metric)\n{\n\tfloat matrix[6];\n\tComputeCovariance(n, points, weights, metric, matrix);\n\n\tif (matrix[0] == 0 || matrix[3] == 0 || matrix[5] == 0)\n\t{\n\t\treturn Vector3(zero);\n\t}\n\t\n\tconst int NUM = 8;\n\n\tVector3 v(1, 1, 1);\n\tfor (int i = 0; i < NUM; i++)\n\t{\n\t\tfloat x = v.x() * matrix[0] + v.y() * matrix[1] + v.z() * matrix[2];\n\t\tfloat y = v.x() * matrix[1] + v.y() * matrix[3] + v.z() * matrix[4];\n\t\tfloat z = v.x() * matrix[2] + v.y() * matrix[4] + v.z() * matrix[5];\n\t\t\n\t\tfloat norm = max(max(x, y), z);\n\t\n\t\tv = Vector3(x, y, z) \/ norm;\n\t}\n\n\treturn v;\t\n}\n\n\n\nint nv::Compute4Means(int n, const Vector3 * points, const float * weights, Vector3::Arg metric, Vector3 * cluster)\n{\n\tVector3 centroid = ComputeCentroid(n, points, weights, metric);\n\t\n\t\/\/ Compute principal component.\n\tVector3 principal = ComputePrincipalComponent(n, points, weights, metric);\n\t\n\t\/\/ Pick initial solution.\n\tint mini, maxi;\n\tmini = maxi = 0;\n\t\n\tfloat mindps, maxdps;\n\tmindps = maxdps = dot(points[0] - centroid, principal);\n\t\n\tfor (int i = 1; i < n; ++i)\n\t{\n\t\tfloat dps = dot(points[i] - centroid, principal);\n\t\t\n\t\tif (dps < mindps) {\n\t\t\tmindps = dps;\n\t\t\tmini = i;\n\t\t}\n\t\telse {\n\t\t\tmaxdps = dps;\n\t\t\tmaxi = i;\n\t\t}\n\t}\n\n\t\/\/cluster[0] = points[mini];\n\t\/\/cluster[1] = points[maxi];\n\tcluster[0] = centroid + mindps * principal;\n\tcluster[1] = centroid + maxdps * principal;\n\tcluster[2] = (2 * cluster[0] + cluster[1]) \/ 3;\n\tcluster[3] = (2 * cluster[1] + cluster[0]) \/ 3;\n\n\t\/\/ Now we have to iteratively refine the clusters.\n\twhile (true)\n\t{\n\t\tVector3 newCluster[4] = { Vector3(zero), Vector3(zero), Vector3(zero), Vector3(zero) };\n\t\tfloat total[4] = {0, 0, 0, 0};\n\t\t\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\t\/\/ Find nearest cluster.\n\t\t\tint nearest = 0;\n\t\t\tfloat mindist = FLT_MAX;\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tfloat dist = length_squared(cluster[j] - points[i]);\n\t\t\t\tif (dist < mindist)\n\t\t\t\t{\n\t\t\t\t\tmindist = dist;\n\t\t\t\t\tnearest = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tnewCluster[nearest] += weights[i] * points[i];\n\t\t\ttotal[nearest] += weights[i];\n\t\t}\n\n\t\tfor (int j = 0; j < 4; j++)\n\t\t{\n\t\t\tnewCluster[j] \/= total[j];\n\t\t}\n\n\t\tif ((equal(cluster[0], newCluster[0]) || total[0] == 0) && \n\t\t\t(equal(cluster[1], newCluster[1]) || total[1] == 0) && \n\t\t\t(equal(cluster[2], newCluster[2]) || total[2] == 0) && \n\t\t\t(equal(cluster[3], newCluster[3]) || total[3] == 0))\n\t\t{\n\t\t\treturn (total[0] != 0) + (total[1] != 0) + (total[2] != 0) + (total[3] != 0);\n\t\t}\n\n\t\tcluster[0] = newCluster[0];\n\t\tcluster[1] = newCluster[1];\n\t\tcluster[2] = newCluster[2];\n\t\tcluster[3] = newCluster[3];\n\n\t\t\/\/ Sort clusters by weight.\n\t\tfor (int i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (int j = i; j > 0 && total[j] > total[j - 1]; j--)\n\t\t\t{\n\t\t\t\tswap( total[j], total[j - 1] );\n\t\t\t\tswap( cluster[j], cluster[j - 1] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/*\nint nv::Compute2Means(int n, const Vector3 * points, const float * weights, Vector3::Arg metric, Vector3 * cluster)\n{\n\tVector3 centroid = ComputeCentroid(n, points, weights, metric);\n\t\n\t\/\/ Compute principal component.\n\tVector3 principal = ComputePrincipalComponent(n, points, weights, metric);\n\t\n\t\/\/ Pick initial solution.\n\tint mini, maxi;\n\tmini = maxi = 0;\n\t\n\tfloat mindps, maxdps;\n\tmindps = maxdps = dot(points[0] - centroid, principal);\n\t\n\tfor (int i = 1; i < n; ++i)\n\t{\n\t\tfloat dps = dot(points[i] - centroid, principal);\n\t\t\n\t\tif (dps < mindps) {\n\t\t\tmindps = dps;\n\t\t\tmini = i;\n\t\t}\n\t\telse {\n\t\t\tmaxdps = dps;\n\t\t\tmaxi = i;\n\t\t}\n\t}\n\n\tcluster[0] = points[mini];\n\tcluster[3] = points[maxi];\n\t\/\/cluster[0] = centroid + mindps * principal;\n\t\/\/cluster[1] = centroid + maxdps * principal;\n\tcluster[2] = (2 * cluster[0] + cluster[1]) \/ 3;\n\tcluster[3] = (2 * cluster[1] + cluster[0]) \/ 3;\n\n\t\/\/ Now we have to iteratively refine the clusters.\n\twhile (true)\n\t{\n\t\tVector3 newCluster[4] = { Vector3(zero), Vector3(zero), Vector3(zero), Vector3(zero) };\n\t\tfloat total[4] = {0, 0, 0, 0};\n\t\t\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\t\/\/ Find nearest cluster.\n\t\t\tint nearest = 0;\n\t\t\tfloat mindist = FLT_MAX;\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tfloat dist = length_squared(cluster[j] - points[i]);\n\t\t\t\tif (dist < mindist)\n\t\t\t\t{\n\t\t\t\t\tmindist = dist;\n\t\t\t\t\tnearest = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tnewCluster[nearest] += weights[i] * points[i];\n\t\t\ttotal[nearest] += weights[i];\n\t\t}\n\n\t\tfor (int j = 0; j < 4; j++)\n\t\t{\n\t\t\tnewCluster[j] \/= total[j];\n\t\t}\n\n\t\tif ((equal(cluster[0], newCluster[0]) || total[0] == 0) && \n\t\t\t(equal(cluster[1], newCluster[1]) || total[1] == 0) && \n\t\t\t(equal(cluster[2], newCluster[2]) || total[2] == 0) && \n\t\t\t(equal(cluster[3], newCluster[3]) || total[3] == 0))\n\t\t{\n\t\t\treturn (total[0] != 0) + (total[1] != 0) + (total[2] != 0) + (total[3] != 0);\n\t\t}\n\n\t\tcluster[0] = newCluster[0];\n\t\tcluster[1] = newCluster[1];\n\t\tcluster[2] = newCluster[2];\n\t\tcluster[3] = newCluster[3];\n\n\t\t\/\/ Sort clusters by weight.\n\t\tfor (int i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (int j = i; j > 0 && total[j] > total[j - 1]; j--)\n\t\t\t{\n\t\t\t\tswap( total[j], total[j - 1] );\n\t\t\t\tswap( cluster[j], cluster[j - 1] );\n\t\t\t}\n\t\t}\n\t}\n}\n*\/<commit_msg>Use metric to measure distance to clusters.<commit_after>\/\/ This code is in the public domain -- icastano@gmail.com\n\n#include \"Fitting.h\"\n\n#include <nvcore\/Algorithms.h> \/\/ max\n#include <nvcore\/Containers.h> \/\/ swap\n#include <float.h> \/\/ FLT_MAX\n\nusing namespace nv;\n\n\nVector3 nv::ComputeCentroid(int n, const Vector3 * points, const float * weights, Vector3::Arg metric)\n{\n\tVector3 centroid(zero);\n\tfloat total = 0.0f;\n\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\ttotal += weights[i];\n\t\tcentroid += weights[i]*points[i];\n\t}\n\tcentroid \/= total;\n\n\treturn centroid;\n}\n\n\nvoid nv::ComputeCovariance(int n, const Vector3 * points, const float * weights, Vector3::Arg metric, float * covariance)\n{\n\t\/\/ compute the centroid\n\tVector3 centroid = ComputeCentroid(n, points, weights, metric);\n\n\t\/\/ compute covariance matrix\n\tfor (int i = 0; i < 6; i++)\n\t{\n\t\tcovariance[i] = 0.0f;\n\t}\n\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tVector3 a = (points[i] - centroid) * metric;\n\t\tVector3 b = weights[i]*a;\n\t\t\n\t\tcovariance[0] += a.x()*b.x();\n\t\tcovariance[1] += a.x()*b.y();\n\t\tcovariance[2] += a.x()*b.z();\n\t\tcovariance[3] += a.y()*b.y();\n\t\tcovariance[4] += a.y()*b.z();\n\t\tcovariance[5] += a.z()*b.z();\n\t}\n}\n\nVector3 nv::ComputePrincipalComponent(int n, const Vector3 * points, const float * weights, Vector3::Arg metric)\n{\n\tfloat matrix[6];\n\tComputeCovariance(n, points, weights, metric, matrix);\n\n\tif (matrix[0] == 0 || matrix[3] == 0 || matrix[5] == 0)\n\t{\n\t\treturn Vector3(zero);\n\t}\n\t\n\tconst int NUM = 8;\n\n\tVector3 v(1, 1, 1);\n\tfor (int i = 0; i < NUM; i++)\n\t{\n\t\tfloat x = v.x() * matrix[0] + v.y() * matrix[1] + v.z() * matrix[2];\n\t\tfloat y = v.x() * matrix[1] + v.y() * matrix[3] + v.z() * matrix[4];\n\t\tfloat z = v.x() * matrix[2] + v.y() * matrix[4] + v.z() * matrix[5];\n\t\t\n\t\tfloat norm = max(max(x, y), z);\n\t\n\t\tv = Vector3(x, y, z) \/ norm;\n\t}\n\n\treturn v;\t\n}\n\n\n\nint nv::Compute4Means(int n, const Vector3 * points, const float * weights, Vector3::Arg metric, Vector3 * cluster)\n{\n\tVector3 centroid = ComputeCentroid(n, points, weights, metric);\n\t\n\t\/\/ Compute principal component.\n\tVector3 principal = ComputePrincipalComponent(n, points, weights, metric);\n\t\n\t\/\/ Pick initial solution.\n\tint mini, maxi;\n\tmini = maxi = 0;\n\t\n\tfloat mindps, maxdps;\n\tmindps = maxdps = dot(points[0] - centroid, principal);\n\t\n\tfor (int i = 1; i < n; ++i)\n\t{\n\t\tfloat dps = dot(points[i] - centroid, principal);\n\t\t\n\t\tif (dps < mindps) {\n\t\t\tmindps = dps;\n\t\t\tmini = i;\n\t\t}\n\t\telse {\n\t\t\tmaxdps = dps;\n\t\t\tmaxi = i;\n\t\t}\n\t}\n\n\t\/\/cluster[0] = points[mini];\n\t\/\/cluster[1] = points[maxi];\n\tcluster[0] = centroid + mindps * principal;\n\tcluster[1] = centroid + maxdps * principal;\n\tcluster[2] = (2 * cluster[0] + cluster[1]) \/ 3;\n\tcluster[3] = (2 * cluster[1] + cluster[0]) \/ 3;\n\n\t\/\/ Now we have to iteratively refine the clusters.\n\twhile (true)\n\t{\n\t\tVector3 newCluster[4] = { Vector3(zero), Vector3(zero), Vector3(zero), Vector3(zero) };\n\t\tfloat total[4] = {0, 0, 0, 0};\n\t\t\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\t\/\/ Find nearest cluster.\n\t\t\tint nearest = 0;\n\t\t\tfloat mindist = FLT_MAX;\n\t\t\tfor (int j = 0; j < 4; j++)\n\t\t\t{\n\t\t\t\tfloat dist = length_squared((cluster[j] - points[i]) * metric);\n\t\t\t\tif (dist < mindist)\n\t\t\t\t{\n\t\t\t\t\tmindist = dist;\n\t\t\t\t\tnearest = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tnewCluster[nearest] += weights[i] * points[i];\n\t\t\ttotal[nearest] += weights[i];\n\t\t}\n\n\t\tfor (int j = 0; j < 4; j++)\n\t\t{\n\t\t\tnewCluster[j] \/= total[j];\n\t\t}\n\n\t\tif ((equal(cluster[0], newCluster[0]) || total[0] == 0) && \n\t\t\t(equal(cluster[1], newCluster[1]) || total[1] == 0) && \n\t\t\t(equal(cluster[2], newCluster[2]) || total[2] == 0) && \n\t\t\t(equal(cluster[3], newCluster[3]) || total[3] == 0))\n\t\t{\n\t\t\treturn (total[0] != 0) + (total[1] != 0) + (total[2] != 0) + (total[3] != 0);\n\t\t}\n\n\t\tcluster[0] = newCluster[0];\n\t\tcluster[1] = newCluster[1];\n\t\tcluster[2] = newCluster[2];\n\t\tcluster[3] = newCluster[3];\n\n\t\t\/\/ Sort clusters by weight.\n\t\tfor (int i = 0; i < 4; i++)\n\t\t{\n\t\t\tfor (int j = i; j > 0 && total[j] > total[j - 1]; j--)\n\t\t\t{\n\t\t\t\tswap( total[j], total[j - 1] );\n\t\t\t\tswap( cluster[j], cluster[j - 1] );\n\t\t\t}\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <map>\n#include <memory>\n\n#include \"common.h\"\n\n\/\/ Size of the buffer to store result of ReadDirectoryChangesW.\nstatic const unsigned int kDirectoryWatcherBufferSize = 4096;\n\n\/\/ Object template to create representation of WatcherHandle.\nstatic Persistent<ObjectTemplate> g_object_template;\n\n\/\/ Mutex for the HandleWrapper map.\nstatic uv_mutex_t g_handle_wrap_map_mutex;\n\n\/\/ The events to be waited on.\nstatic std::vector<HANDLE> g_events;\n\n\/\/ The dummy event to wakeup the thread.\nstatic HANDLE g_wake_up_event;\n\nstruct ScopedLocker {\n ScopedLocker(uv_mutex_t& mutex) : mutex_(&mutex) { uv_mutex_lock(mutex_); }\n ~ScopedLocker() { Unlock(); }\n\n void Unlock() { uv_mutex_unlock(mutex_); }\n\n uv_mutex_t* mutex_;\n};\n\nstruct HandleWrapper {\n HandleWrapper(WatcherHandle handle, const char* path_str)\n : dir_handle(handle),\n path(strlen(path_str)),\n canceled(false) {\n memset(&overlapped, 0, sizeof(overlapped));\n overlapped.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n g_events.push_back(overlapped.hEvent);\n\n std::copy(path_str, path_str + path.size(), path.data());\n map_[overlapped.hEvent] = this;\n }\n\n ~HandleWrapper() {\n CloseHandle(dir_handle);\n\n map_.erase(overlapped.hEvent);\n CloseHandle(overlapped.hEvent);\n g_events.erase(\n std::remove(g_events.begin(), g_events.end(), overlapped.hEvent),\n g_events.end());\n }\n\n WatcherHandle dir_handle;\n std::vector<char> path;\n bool canceled;\n OVERLAPPED overlapped;\n char buffer[kDirectoryWatcherBufferSize];\n\n static HandleWrapper* Get(HANDLE key) { return map_[key]; }\n\n static std::map<WatcherHandle, HandleWrapper*> map_;\n};\n\nstd::map<WatcherHandle, HandleWrapper*> HandleWrapper::map_;\n\nstruct WatcherEvent {\n EVENT_TYPE type;\n WatcherHandle handle;\n std::vector<char> new_path;\n std::vector<char> old_path;\n};\n\nstatic bool QueueReaddirchanges(HandleWrapper* handle) {\n return ReadDirectoryChangesW(handle->dir_handle,\n handle->buffer,\n kDirectoryWatcherBufferSize,\n FALSE,\n FILE_NOTIFY_CHANGE_FILE_NAME |\n FILE_NOTIFY_CHANGE_DIR_NAME |\n FILE_NOTIFY_CHANGE_ATTRIBUTES |\n FILE_NOTIFY_CHANGE_SIZE |\n FILE_NOTIFY_CHANGE_LAST_WRITE |\n FILE_NOTIFY_CHANGE_LAST_ACCESS |\n FILE_NOTIFY_CHANGE_CREATION |\n FILE_NOTIFY_CHANGE_SECURITY,\n NULL,\n &handle->overlapped,\n NULL) == TRUE;\n}\n\nHandle<Value> WatcherHandleToV8Value(WatcherHandle handle) {\n Handle<Value> value = g_object_template->NewInstance();\n value->ToObject()->SetPointerInInternalField(0, handle);\n return value;\n}\n\nWatcherHandle V8ValueToWatcherHandle(Handle<Value> value) {\n return reinterpret_cast<WatcherHandle>(value->ToObject()->\n GetPointerFromInternalField(0));\n}\n\nbool IsV8ValueWatcherHandle(Handle<Value> value) {\n return value->IsObject() && value->ToObject()->InternalFieldCount() == 1;\n}\n\nvoid PlatformInit() {\n uv_mutex_init(&g_handle_wrap_map_mutex);\n\n g_wake_up_event = CreateEvent(NULL, FALSE, FALSE, NULL);\n g_events.push_back(g_wake_up_event);\n\n g_object_template = Persistent<ObjectTemplate>::New(ObjectTemplate::New());\n g_object_template->SetInternalFieldCount(1);\n\n WakeupNewThread();\n}\n\nvoid PlatformThread() {\n while (true) {\n \/\/ Do not use g_events directly, since reallocation could happen when there\n \/\/ are new watchers adding to g_events when WaitForMultipleObjects is still\n \/\/ polling.\n ScopedLocker locker(g_handle_wrap_map_mutex);\n std::vector<HANDLE> copied_events(g_events);\n locker.Unlock();\n\n DWORD r = WaitForMultipleObjects(copied_events.size(),\n copied_events.data(),\n FALSE,\n INFINITE);\n int i = r - WAIT_OBJECT_0;\n if (i >= 0 && i < copied_events.size()) {\n \/\/ It's a wake up event, there is no fs events.\n if (copied_events[i] == g_wake_up_event)\n continue;\n\n ScopedLocker locker(g_handle_wrap_map_mutex);\n\n HandleWrapper* handle = HandleWrapper::Get(copied_events[i]);\n if (!handle)\n continue;\n\n if (handle->canceled) {\n delete handle;\n continue;\n }\n\n DWORD bytes;\n if (GetOverlappedResult(handle->dir_handle,\n &handle->overlapped,\n &bytes,\n FALSE) == FALSE)\n continue;\n\n std::vector<char> old_path;\n std::vector<WatcherEvent> events;\n\n DWORD offset = 0;\n while (true) {\n FILE_NOTIFY_INFORMATION* file_info =\n reinterpret_cast<FILE_NOTIFY_INFORMATION*>(handle->buffer + offset);\n\n \/\/ Emit events for children.\n EVENT_TYPE event = EVENT_NONE;\n switch (file_info->Action) {\n case FILE_ACTION_ADDED:\n event = EVENT_CHILD_CREATE;\n break;\n case FILE_ACTION_REMOVED:\n event = EVENT_CHILD_DELETE;\n break;\n case FILE_ACTION_RENAMED_OLD_NAME:\n event = EVENT_CHILD_RENAME;\n break;\n case FILE_ACTION_RENAMED_NEW_NAME:\n event = EVENT_CHILD_RENAME;\n break;\n case FILE_ACTION_MODIFIED:\n event = EVENT_CHILD_CHANGE;\n break;\n }\n\n if (event != EVENT_NONE) {\n \/\/ The FileNameLength is in \"bytes\", but the WideCharToMultiByte\n \/\/ requires the length to be in \"characters\"!\n int file_name_length_in_characters =\n file_info->FileNameLength \/ sizeof(wchar_t);\n\n char filename[MAX_PATH] = { 0 };\n int size = WideCharToMultiByte(CP_UTF8,\n 0,\n file_info->FileName,\n file_name_length_in_characters,\n filename,\n MAX_PATH,\n NULL,\n NULL);\n\n \/\/ Convert file name to file path, same with:\n \/\/ path = handle->path + '\\\\' + filename\n std::vector<char> path(handle->path.size() + 1 + size);\n std::vector<char>::iterator iter = path.begin();\n iter = std::copy(handle->path.begin(), handle->path.end(), iter);\n *(iter++) = '\\\\';\n std::copy(filename, filename + size, iter);\n\n if (file_info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n \/\/ Do not send rename event until the NEW_NAME event, but still keep\n \/\/ a record of old name.\n old_path.swap(path);\n } else if (file_info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n WatcherEvent e = { event, handle->overlapped.hEvent };\n e.new_path.swap(path);\n e.old_path.swap(old_path);\n events.push_back(e);\n } else {\n WatcherEvent e = { event, handle->overlapped.hEvent };\n e.new_path.swap(path);\n events.push_back(e);\n }\n }\n\n if (file_info->NextEntryOffset == 0) break;\n offset += file_info->NextEntryOffset;\n }\n\n \/\/ Restart the monitor, it was reset after each call.\n QueueReaddirchanges(handle);\n\n locker.Unlock();\n\n for (size_t i = 0; i < events.size(); ++i)\n PostEventAndWait(events[i].type,\n events[i].handle,\n events[i].new_path,\n events[i].old_path);\n }\n }\n}\n\nWatcherHandle PlatformWatch(const char* path) {\n wchar_t wpath[MAX_PATH] = { 0 };\n MultiByteToWideChar(CP_UTF8, 0, path, -1, wpath, MAX_PATH);\n\n \/\/ Requires a directory, file watching is emulated in js.\n DWORD attr = GetFileAttributesW(wpath);\n if (attr == INVALID_FILE_ATTRIBUTES || !(attr & FILE_ATTRIBUTE_DIRECTORY)) {\n fprintf(stderr, \"%s is not a directory\\n\", path);\n return INVALID_HANDLE_VALUE;\n }\n\n WatcherHandle dir_handle = CreateFileW(wpath,\n FILE_LIST_DIRECTORY,\n FILE_SHARE_READ | FILE_SHARE_DELETE |\n FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n FILE_FLAG_BACKUP_SEMANTICS |\n FILE_FLAG_OVERLAPPED,\n NULL);\n if (!PlatformIsHandleValid(dir_handle)) {\n fprintf(stderr, \"Unable to call CreateFileW for %s\\n\", path);\n return INVALID_HANDLE_VALUE;\n }\n\n std::unique_ptr<HandleWrapper> handle;\n {\n ScopedLocker locker(g_handle_wrap_map_mutex);\n handle.reset(new HandleWrapper(dir_handle, path));\n }\n\n if (!QueueReaddirchanges(handle.get())) {\n fprintf(stderr, \"ReadDirectoryChangesW failed\\n\");\n return INVALID_HANDLE_VALUE;\n }\n\n \/\/ Wake up the thread to add the new event.\n SetEvent(g_wake_up_event);\n\n \/\/ The pointer is leaked if no error happened.\n return handle.release()->overlapped.hEvent;\n}\n\nvoid PlatformUnwatch(WatcherHandle key) {\n if (PlatformIsHandleValid(key)) {\n ScopedLocker locker(g_handle_wrap_map_mutex);\n\n HandleWrapper* handle = HandleWrapper::Get(key);\n handle->canceled = true;\n CancelIoEx(handle->dir_handle, &handle->overlapped);\n }\n}\n\nbool PlatformIsHandleValid(WatcherHandle handle) {\n return handle != INVALID_HANDLE_VALUE;\n}\n<commit_msg>:lipstick: Remove lint warnings<commit_after>#include <algorithm>\n#include <map>\n#include <memory>\n\n#include \"common.h\"\n\n\/\/ Size of the buffer to store result of ReadDirectoryChangesW.\nstatic const unsigned int kDirectoryWatcherBufferSize = 4096;\n\n\/\/ Object template to create representation of WatcherHandle.\nstatic Persistent<ObjectTemplate> g_object_template;\n\n\/\/ Mutex for the HandleWrapper map.\nstatic uv_mutex_t g_handle_wrap_map_mutex;\n\n\/\/ The events to be waited on.\nstatic std::vector<HANDLE> g_events;\n\n\/\/ The dummy event to wakeup the thread.\nstatic HANDLE g_wake_up_event;\n\nstruct ScopedLocker {\n explicit ScopedLocker(const uv_mutex_t& mutex) : mutex_(&mutex) { uv_mutex_lock(mutex_); }\n ~ScopedLocker() { Unlock(); }\n\n void Unlock() { uv_mutex_unlock(mutex_); }\n\n uv_mutex_t* mutex_;\n};\n\nstruct HandleWrapper {\n HandleWrapper(WatcherHandle handle, const char* path_str)\n : dir_handle(handle),\n path(strlen(path_str)),\n canceled(false) {\n memset(&overlapped, 0, sizeof(overlapped));\n overlapped.hEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n g_events.push_back(overlapped.hEvent);\n\n std::copy(path_str, path_str + path.size(), path.data());\n map_[overlapped.hEvent] = this;\n }\n\n ~HandleWrapper() {\n CloseHandle(dir_handle);\n\n map_.erase(overlapped.hEvent);\n CloseHandle(overlapped.hEvent);\n g_events.erase(\n std::remove(g_events.begin(), g_events.end(), overlapped.hEvent),\n g_events.end());\n }\n\n WatcherHandle dir_handle;\n std::vector<char> path;\n bool canceled;\n OVERLAPPED overlapped;\n char buffer[kDirectoryWatcherBufferSize];\n\n static HandleWrapper* Get(HANDLE key) { return map_[key]; }\n\n static std::map<WatcherHandle, HandleWrapper*> map_;\n};\n\nstd::map<WatcherHandle, HandleWrapper*> HandleWrapper::map_;\n\nstruct WatcherEvent {\n EVENT_TYPE type;\n WatcherHandle handle;\n std::vector<char> new_path;\n std::vector<char> old_path;\n};\n\nstatic bool QueueReaddirchanges(HandleWrapper* handle) {\n return ReadDirectoryChangesW(handle->dir_handle,\n handle->buffer,\n kDirectoryWatcherBufferSize,\n FALSE,\n FILE_NOTIFY_CHANGE_FILE_NAME |\n FILE_NOTIFY_CHANGE_DIR_NAME |\n FILE_NOTIFY_CHANGE_ATTRIBUTES |\n FILE_NOTIFY_CHANGE_SIZE |\n FILE_NOTIFY_CHANGE_LAST_WRITE |\n FILE_NOTIFY_CHANGE_LAST_ACCESS |\n FILE_NOTIFY_CHANGE_CREATION |\n FILE_NOTIFY_CHANGE_SECURITY,\n NULL,\n &handle->overlapped,\n NULL) == TRUE;\n}\n\nHandle<Value> WatcherHandleToV8Value(WatcherHandle handle) {\n Handle<Value> value = g_object_template->NewInstance();\n value->ToObject()->SetPointerInInternalField(0, handle);\n return value;\n}\n\nWatcherHandle V8ValueToWatcherHandle(Handle<Value> value) {\n return reinterpret_cast<WatcherHandle>(value->ToObject()->\n GetPointerFromInternalField(0));\n}\n\nbool IsV8ValueWatcherHandle(Handle<Value> value) {\n return value->IsObject() && value->ToObject()->InternalFieldCount() == 1;\n}\n\nvoid PlatformInit() {\n uv_mutex_init(&g_handle_wrap_map_mutex);\n\n g_wake_up_event = CreateEvent(NULL, FALSE, FALSE, NULL);\n g_events.push_back(g_wake_up_event);\n\n g_object_template = Persistent<ObjectTemplate>::New(ObjectTemplate::New());\n g_object_template->SetInternalFieldCount(1);\n\n WakeupNewThread();\n}\n\nvoid PlatformThread() {\n while (true) {\n \/\/ Do not use g_events directly, since reallocation could happen when there\n \/\/ are new watchers adding to g_events when WaitForMultipleObjects is still\n \/\/ polling.\n ScopedLocker locker(g_handle_wrap_map_mutex);\n std::vector<HANDLE> copied_events(g_events);\n locker.Unlock();\n\n DWORD r = WaitForMultipleObjects(copied_events.size(),\n copied_events.data(),\n FALSE,\n INFINITE);\n int i = r - WAIT_OBJECT_0;\n if (i >= 0 && i < copied_events.size()) {\n \/\/ It's a wake up event, there is no fs events.\n if (copied_events[i] == g_wake_up_event)\n continue;\n\n ScopedLocker locker(g_handle_wrap_map_mutex);\n\n HandleWrapper* handle = HandleWrapper::Get(copied_events[i]);\n if (!handle)\n continue;\n\n if (handle->canceled) {\n delete handle;\n continue;\n }\n\n DWORD bytes;\n if (GetOverlappedResult(handle->dir_handle,\n &handle->overlapped,\n &bytes,\n FALSE) == FALSE)\n continue;\n\n std::vector<char> old_path;\n std::vector<WatcherEvent> events;\n\n DWORD offset = 0;\n while (true) {\n FILE_NOTIFY_INFORMATION* file_info =\n reinterpret_cast<FILE_NOTIFY_INFORMATION*>(handle->buffer + offset);\n\n \/\/ Emit events for children.\n EVENT_TYPE event = EVENT_NONE;\n switch (file_info->Action) {\n case FILE_ACTION_ADDED:\n event = EVENT_CHILD_CREATE;\n break;\n case FILE_ACTION_REMOVED:\n event = EVENT_CHILD_DELETE;\n break;\n case FILE_ACTION_RENAMED_OLD_NAME:\n event = EVENT_CHILD_RENAME;\n break;\n case FILE_ACTION_RENAMED_NEW_NAME:\n event = EVENT_CHILD_RENAME;\n break;\n case FILE_ACTION_MODIFIED:\n event = EVENT_CHILD_CHANGE;\n break;\n }\n\n if (event != EVENT_NONE) {\n \/\/ The FileNameLength is in \"bytes\", but the WideCharToMultiByte\n \/\/ requires the length to be in \"characters\"!\n int file_name_length_in_characters =\n file_info->FileNameLength \/ sizeof(wchar_t);\n\n char filename[MAX_PATH] = { 0 };\n int size = WideCharToMultiByte(CP_UTF8,\n 0,\n file_info->FileName,\n file_name_length_in_characters,\n filename,\n MAX_PATH,\n NULL,\n NULL);\n\n \/\/ Convert file name to file path, same with:\n \/\/ path = handle->path + '\\\\' + filename\n std::vector<char> path(handle->path.size() + 1 + size);\n std::vector<char>::iterator iter = path.begin();\n iter = std::copy(handle->path.begin(), handle->path.end(), iter);\n *(iter++) = '\\\\';\n std::copy(filename, filename + size, iter);\n\n if (file_info->Action == FILE_ACTION_RENAMED_OLD_NAME) {\n \/\/ Do not send rename event until the NEW_NAME event, but still keep\n \/\/ a record of old name.\n old_path.swap(path);\n } else if (file_info->Action == FILE_ACTION_RENAMED_NEW_NAME) {\n WatcherEvent e = { event, handle->overlapped.hEvent };\n e.new_path.swap(path);\n e.old_path.swap(old_path);\n events.push_back(e);\n } else {\n WatcherEvent e = { event, handle->overlapped.hEvent };\n e.new_path.swap(path);\n events.push_back(e);\n }\n }\n\n if (file_info->NextEntryOffset == 0) break;\n offset += file_info->NextEntryOffset;\n }\n\n \/\/ Restart the monitor, it was reset after each call.\n QueueReaddirchanges(handle);\n\n locker.Unlock();\n\n for (size_t i = 0; i < events.size(); ++i)\n PostEventAndWait(events[i].type,\n events[i].handle,\n events[i].new_path,\n events[i].old_path);\n }\n }\n}\n\nWatcherHandle PlatformWatch(const char* path) {\n wchar_t wpath[MAX_PATH] = { 0 };\n MultiByteToWideChar(CP_UTF8, 0, path, -1, wpath, MAX_PATH);\n\n \/\/ Requires a directory, file watching is emulated in js.\n DWORD attr = GetFileAttributesW(wpath);\n if (attr == INVALID_FILE_ATTRIBUTES || !(attr & FILE_ATTRIBUTE_DIRECTORY)) {\n fprintf(stderr, \"%s is not a directory\\n\", path);\n return INVALID_HANDLE_VALUE;\n }\n\n WatcherHandle dir_handle = CreateFileW(wpath,\n FILE_LIST_DIRECTORY,\n FILE_SHARE_READ | FILE_SHARE_DELETE |\n FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n FILE_FLAG_BACKUP_SEMANTICS |\n FILE_FLAG_OVERLAPPED,\n NULL);\n if (!PlatformIsHandleValid(dir_handle)) {\n fprintf(stderr, \"Unable to call CreateFileW for %s\\n\", path);\n return INVALID_HANDLE_VALUE;\n }\n\n std::unique_ptr<HandleWrapper> handle;\n {\n ScopedLocker locker(g_handle_wrap_map_mutex);\n handle.reset(new HandleWrapper(dir_handle, path));\n }\n\n if (!QueueReaddirchanges(handle.get())) {\n fprintf(stderr, \"ReadDirectoryChangesW failed\\n\");\n return INVALID_HANDLE_VALUE;\n }\n\n \/\/ Wake up the thread to add the new event.\n SetEvent(g_wake_up_event);\n\n \/\/ The pointer is leaked if no error happened.\n return handle.release()->overlapped.hEvent;\n}\n\nvoid PlatformUnwatch(WatcherHandle key) {\n if (PlatformIsHandleValid(key)) {\n ScopedLocker locker(g_handle_wrap_map_mutex);\n\n HandleWrapper* handle = HandleWrapper::Get(key);\n handle->canceled = true;\n CancelIoEx(handle->dir_handle, &handle->overlapped);\n }\n}\n\nbool PlatformIsHandleValid(WatcherHandle handle) {\n return handle != INVALID_HANDLE_VALUE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/*-- Author: Rachid Guernane (LPCCFd)\n\n#include \"AliMUONRegionalTriggerBoard.h\"\n\n#include \"TBits.h\"\n\n#include <Riostream.h>\n\nClassImp(AliMUONRegionalTriggerBoard)\n\n\/\/___________________________________________\nAliMUONRegionalTriggerBoard::AliMUONRegionalTriggerBoard()\n{\n for (Int_t i=0; i<16; i++) fLocalResponse[i] = 0;\n}\n\n\/\/___________________________________________\nAliMUONRegionalTriggerBoard::AliMUONRegionalTriggerBoard(const char *name, Int_t a) : AliMUONTriggerBoard(name, a)\n{\n for (Int_t i=0; i<16; i++) fLocalResponse[i] = 0;\n}\n\n\/\/___________________________________________\nvoid AliMUONRegionalTriggerBoard::Response()\n{\n Int_t t[16];\n\n for (Int_t i=0;i<16;i++) t[i] = fLocalResponse[i];\n\n Int_t rank = 8;\n\n for (Int_t i=0;i<4;i++)\n {\n Int_t ip = 0;\n \n for (Int_t j=0;j<rank;j++)\n {\n UShort_t athres = Algo(t[2*j],t[2*j+1],\"APT\",i);\n\n UShort_t lthres = Algo(t[2*j],t[2*j+1],\"LPT\",i); lthres <<= 4;\n\n UShort_t hthres = Algo(t[2*j],t[2*j+1],\"HPT\",i); hthres <<= 8;\n\n t[ip] = athres | lthres | hthres;\n\n ip++;\n }\n \n rank \/= 2; \n }\n\n fResponse = t[0]; \/\/ 12-bit [H4:L4:A4]\n}\n\n\/\/___________________________________________\nUShort_t AliMUONRegionalTriggerBoard::Algo(UShort_t i, UShort_t j, char *thres, Int_t level)\n{\n TBits a(12), b(12); a.Set(12,&i); b.Set(12,&j);\n\n TBits trg1(2), trg2(2), trg(2);\n\n if (!strcmp(thres,\"APT\"))\n {\n if (!level)\n { \n trg1[0] = a[0]; trg1[1] = a[1]; \n trg2[0] = b[0]; trg2[1] = b[1];\n }\n else\n {\n trg1[0] = a[2]; trg1[1] = a[3]; \n trg2[0] = b[2]; trg2[1] = b[3];\n }\n }\n else if (!strcmp(thres,\"LPT\"))\n {\n if (!level)\n { \n trg1[0] = a[2]; trg1[1] = a[3]; \n trg2[0] = b[2]; trg2[1] = b[3];\n }\n else\n {\n trg1[0] = a[6]; trg1[1] = a[7]; \n trg2[0] = b[6]; trg2[1] = b[7];\n }\n }\n else\n {\n if (!level)\n { \n trg1[0] = a[4]; trg1[1] = a[5]; \n trg2[0] = b[4]; trg2[1] = b[5];\n }\n else\n {\n trg1[0] = a[10]; trg1[1] = a[11]; \n trg2[0] = b[10]; trg2[1] = b[11]; \n }\n }\n \n TBits trgLS1(1), trgUS1(1), trgLS2(1), trgUS2(1), trgLS(1), trgUS(1);\n\n if (!level) \n {\n trgLS1[0] = trgUS1[0] = trgLS2[0] = trgUS2[0] = 0;\n }\n else\n {\n if (!strcmp(thres,\"APT\"))\n {\n trgLS1[0] = a[1]; trgUS1[0] = a[0]; \n trgLS2[0] = b[1]; trgUS2[0] = b[0];\n }\n else if (!strcmp(thres,\"LPT\"))\n {\n trgLS1[0] = a[5]; trgUS1[0] = a[4]; \n trgLS2[0] = b[5]; trgUS2[0] = b[4];\n }\n else\n {\n trgLS1[0] = a[9]; trgUS1[0] = a[8]; \n trgLS2[0] = b[9]; trgUS2[0] = b[8]; \n }\n }\n\n trgLS[0] = ( trg1[0] & trg2[0] ) | ( trg1[1] & trg2[1] ) | trgLS1[0] | trgLS2[0];\n trgUS[0] = ( trg1[0] & trg2[1] ) | ( trg1[1] & trg2[0] ) | trgUS1[0] | trgUS2[0];\n \n trg[0] = trg1[0] | trg2[0];\n trg[1] = trg1[1] | trg2[1];\n \n TBits v(4);\n \n v[0] = trgUS[0];\n v[1] = trgLS[0];\n v[2] = trg[0];\n v[3] = trg[1];\n \n UShort_t rv = 0;\n v.Get(&rv);\n\n return rv;\n}\n\/\/___________________________________________\nvoid AliMUONRegionalTriggerBoard::Scan(Option_t*)\n{\n\n}\n\n\nClassImp(AliMUONRegionalTriggerBoard)\n<commit_msg>Implemented Scan() method (Rachid)<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/*-- Author: Rachid Guernane (LPCCFd)\n\n#include \"AliMUONRegionalTriggerBoard.h\"\n\n#include \"TBits.h\"\n\n#include <Riostream.h>\n\nClassImp(AliMUONRegionalTriggerBoard)\n\n\/\/___________________________________________\nAliMUONRegionalTriggerBoard::AliMUONRegionalTriggerBoard()\n{\n for (Int_t i=0; i<16; i++) fLocalResponse[i] = 0;\n}\n\n\/\/___________________________________________\nAliMUONRegionalTriggerBoard::AliMUONRegionalTriggerBoard(const char *name, Int_t a) : AliMUONTriggerBoard(name, a)\n{\n for (Int_t i=0; i<16; i++) fLocalResponse[i] = 0;\n}\n\n\/\/___________________________________________\nvoid AliMUONRegionalTriggerBoard::Response()\n{\n Int_t t[16];\n\n for (Int_t i=0;i<16;i++) t[i] = fLocalResponse[i];\n\n Int_t rank = 8;\n\n for (Int_t i=0;i<4;i++)\n {\n Int_t ip = 0;\n \n for (Int_t j=0;j<rank;j++)\n {\n UShort_t athres = Algo(t[2*j],t[2*j+1],\"APT\",i);\n\n UShort_t lthres = Algo(t[2*j],t[2*j+1],\"LPT\",i); lthres <<= 4;\n\n UShort_t hthres = Algo(t[2*j],t[2*j+1],\"HPT\",i); hthres <<= 8;\n\n t[ip] = athres | lthres | hthres;\n\n ip++;\n }\n \n rank \/= 2; \n }\n\n fResponse = t[0]; \/\/ 12-bit [H4:L4:A4]\n}\n\n\/\/___________________________________________\nUShort_t AliMUONRegionalTriggerBoard::Algo(UShort_t i, UShort_t j, char *thres, Int_t level)\n{\n TBits a(12), b(12); a.Set(12,&i); b.Set(12,&j);\n\n TBits trg1(2), trg2(2), trg(2);\n\n if (!strcmp(thres,\"APT\"))\n {\n if (!level)\n { \n trg1[0] = a[0]; trg1[1] = a[1]; \n trg2[0] = b[0]; trg2[1] = b[1];\n }\n else\n {\n trg1[0] = a[2]; trg1[1] = a[3]; \n trg2[0] = b[2]; trg2[1] = b[3];\n }\n }\n else if (!strcmp(thres,\"LPT\"))\n {\n if (!level)\n { \n trg1[0] = a[2]; trg1[1] = a[3]; \n trg2[0] = b[2]; trg2[1] = b[3];\n }\n else\n {\n trg1[0] = a[6]; trg1[1] = a[7]; \n trg2[0] = b[6]; trg2[1] = b[7];\n }\n }\n else\n {\n if (!level)\n { \n trg1[0] = a[4]; trg1[1] = a[5]; \n trg2[0] = b[4]; trg2[1] = b[5];\n }\n else\n {\n trg1[0] = a[10]; trg1[1] = a[11]; \n trg2[0] = b[10]; trg2[1] = b[11]; \n }\n }\n \n TBits trgLS1(1), trgUS1(1), trgLS2(1), trgUS2(1), trgLS(1), trgUS(1);\n\n if (!level) \n {\n trgLS1[0] = trgUS1[0] = trgLS2[0] = trgUS2[0] = 0;\n }\n else\n {\n if (!strcmp(thres,\"APT\"))\n {\n trgLS1[0] = a[1]; trgUS1[0] = a[0]; \n trgLS2[0] = b[1]; trgUS2[0] = b[0];\n }\n else if (!strcmp(thres,\"LPT\"))\n {\n trgLS1[0] = a[5]; trgUS1[0] = a[4]; \n trgLS2[0] = b[5]; trgUS2[0] = b[4];\n }\n else\n {\n trgLS1[0] = a[9]; trgUS1[0] = a[8]; \n trgLS2[0] = b[9]; trgUS2[0] = b[8]; \n }\n }\n\n trgLS[0] = ( trg1[0] & trg2[0] ) | ( trg1[1] & trg2[1] ) | trgLS1[0] | trgLS2[0];\n trgUS[0] = ( trg1[0] & trg2[1] ) | ( trg1[1] & trg2[0] ) | trgUS1[0] | trgUS2[0];\n \n trg[0] = trg1[0] | trg2[0];\n trg[1] = trg1[1] | trg2[1];\n \n TBits v(4);\n \n v[0] = trgUS[0];\n v[1] = trgLS[0];\n v[2] = trg[0];\n v[3] = trg[1];\n \n UShort_t rv = 0;\n v.Get(&rv);\n\n return rv;\n}\n\/\/___________________________________________\nvoid AliMUONRegionalTriggerBoard::Scan(Option_t*)\n{\n for (Int_t i=0; i<16; i++) \n {\n TBits b;\n b.Set(6,&fLocalResponse[i]);\n \n cout << \"Entry \" << i << \" is \" << b << endl;\n \n }\n \n}\n\n\nClassImp(AliMUONRegionalTriggerBoard)\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2006 Torus Knot Software Ltd\nAlso see acknowledgements in Readme.html\n\nThis program is free software you can redistribute it and\/or modify it under\nthe terms of the GNU Lesser General Public License as published by the Free Software\nFoundation either version 2 of the License, or (at your option) any later\nversion.\n\nThis program is distributed in the hope that it will be useful, but WITHOUT\nANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS\nFOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License along with\nthis program if not, write to the Free Software Foundation, Inc., 59 Temple\nPlace - Suite 330, Boston, MA 02111-1307, USA, or go to\nhttp:\/\/www.gnu.org\/copyleft\/lesser.txt.\n\nYou may alternatively use this source under the terms of a specific version of\nthe OGRE Unrestricted License provided you have obtained such a license from\nTorus Knot Software Ltd.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreGpuProgramUsage.h\"\n#include \"OgreGpuProgramManager.h\"\n#include \"OgreException.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------------\n GpuProgramUsage::GpuProgramUsage(GpuProgramType gptype) :\n mType(gptype), mProgram()\n {\n }\n\t\/\/-----------------------------------------------------------------------------\n\tGpuProgramUsage::GpuProgramUsage(const GpuProgramUsage& oth)\n : mType(oth.mType)\n , mProgram(oth.mProgram)\n \/\/ nfz: parameters should be copied not just use a shared ptr to the original\n\t\t, mParameters(OGRE_NEW GpuProgramParameters(*oth.mParameters))\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------------\n\tvoid GpuProgramUsage::setProgramName(const String& name, bool resetParams)\n\t{\n\t\tmProgram = GpuProgramManager::getSingleton().getByName(name);\n\n if (mProgram.isNull())\n {\n\t\t\tString progType = (mType == GPT_VERTEX_PROGRAM ? \"vertex\" : \n\t\t\t\t(mType == GPT_GEOMETRY_PROGRAM ? \"geometry\" : \"fragment\"));\n OGRE_EXCEPT(Exception::ERR_ITEM_NOT_FOUND, \n \"Unable to locate \" + progType + \" program called \" + name + \".\",\n \"GpuProgramUsage::setProgramName\");\n }\n \/\/ Reset parameters \n if (resetParams || mParameters.isNull())\n mParameters = mProgram->createParameters();\n\n\t}\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::setParameters(GpuProgramParametersSharedPtr params)\n {\n mParameters = params;\n }\n \/\/-----------------------------------------------------------------------------\n GpuProgramParametersSharedPtr GpuProgramUsage::getParameters(void)\n {\n if (mParameters.isNull())\n {\n OGRE_EXCEPT(Exception::ERR_INVALIDPARAMS, \"You must specify a program before \"\n \"you can retrieve parameters.\", \"GpuProgramUsage::getParameters\");\n }\n\n return mParameters;\n }\n \/\/-----------------------------------------------------------------------------\n\tvoid GpuProgramUsage::setProgram(GpuProgramPtr& prog) \n\t{\n mProgram = prog;\n \/\/ Reset parameters \n mParameters = mProgram->createParameters();\n }\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::_load(void)\n {\n if (!mProgram->isLoaded())\n mProgram->load();\n }\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::_unload(void)\n {\n \/\/ TODO?\n }\n\n}\n<commit_msg>GpuProgramUsage::setProgramName - check the type of the program assigned matches the type of usage it's assigned to (make copy\/paste errors in scripts easier to diagnose)<commit_after>\n\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n (Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2006 Torus Knot Software Ltd\nAlso see acknowledgements in Readme.html\n\nThis program is free software you can redistribute it and\/or modify it under\nthe terms of the GNU Lesser General Public License as published by the Free Software\nFoundation either version 2 of the License, or (at your option) any later\nversion.\n\nThis program is distributed in the hope that it will be useful, but WITHOUT\nANY WARRANTY without even the implied warranty of MERCHANTABILITY or FITNESS\nFOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License along with\nthis program if not, write to the Free Software Foundation, Inc., 59 Temple\nPlace - Suite 330, Boston, MA 02111-1307, USA, or go to\nhttp:\/\/www.gnu.org\/copyleft\/lesser.txt.\n\nYou may alternatively use this source under the terms of a specific version of\nthe OGRE Unrestricted License provided you have obtained such a license from\nTorus Knot Software Ltd.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreStableHeaders.h\"\n#include \"OgreGpuProgramUsage.h\"\n#include \"OgreGpuProgramManager.h\"\n#include \"OgreException.h\"\n\nnamespace Ogre\n{\n \/\/-----------------------------------------------------------------------------\n GpuProgramUsage::GpuProgramUsage(GpuProgramType gptype) :\n mType(gptype), mProgram()\n {\n }\n\t\/\/-----------------------------------------------------------------------------\n\tGpuProgramUsage::GpuProgramUsage(const GpuProgramUsage& oth)\n : mType(oth.mType)\n , mProgram(oth.mProgram)\n \/\/ nfz: parameters should be copied not just use a shared ptr to the original\n\t\t, mParameters(OGRE_NEW GpuProgramParameters(*oth.mParameters))\n\t{\n\t}\n\t\/\/-----------------------------------------------------------------------------\n\tvoid GpuProgramUsage::setProgramName(const String& name, bool resetParams)\n\t{\n\t\tmProgram = GpuProgramManager::getSingleton().getByName(name);\n\n if (mProgram.isNull())\n {\n\t\t\tString progType = (mType == GPT_VERTEX_PROGRAM ? \"vertex\" : \n\t\t\t\t(mType == GPT_GEOMETRY_PROGRAM ? \"geometry\" : \"fragment\"));\n OGRE_EXCEPT(Exception::ERR_ITEM_NOT_FOUND, \n \"Unable to locate \" + progType + \" program called \" + name + \".\",\n \"GpuProgramUsage::setProgramName\");\n }\n\t\t\/\/ check type\n\t\tif (mProgram->getType() != mType)\n\t\t{\n\t\t\tString myType = (mType == GPT_VERTEX_PROGRAM ? \"vertex\" : \n\t\t\t\t(mType == GPT_GEOMETRY_PROGRAM ? \"geometry\" : \"fragment\"));\n\t\t\tString yourType = (mProgram->getType() == GPT_VERTEX_PROGRAM ? \"vertex\" : \n\t\t\t\t(mProgram->getType() == GPT_GEOMETRY_PROGRAM ? \"geometry\" : \"fragment\"));\n\t\t\tOGRE_EXCEPT(Exception::ERR_INVALIDPARAMS, \n\t\t\t\tname + \"is a \" + yourType + \" program, but you are assigning it to a \" \n\t\t\t\t+ myType + \" program slot. This is invalid.\",\n\t\t\t\t\"GpuProgramUsage::setProgramName\");\n\n\t\t}\n\n \/\/ Reset parameters \n if (resetParams || mParameters.isNull())\n mParameters = mProgram->createParameters();\n\n\t}\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::setParameters(GpuProgramParametersSharedPtr params)\n {\n mParameters = params;\n }\n \/\/-----------------------------------------------------------------------------\n GpuProgramParametersSharedPtr GpuProgramUsage::getParameters(void)\n {\n if (mParameters.isNull())\n {\n OGRE_EXCEPT(Exception::ERR_INVALIDPARAMS, \"You must specify a program before \"\n \"you can retrieve parameters.\", \"GpuProgramUsage::getParameters\");\n }\n\n return mParameters;\n }\n \/\/-----------------------------------------------------------------------------\n\tvoid GpuProgramUsage::setProgram(GpuProgramPtr& prog) \n\t{\n mProgram = prog;\n \/\/ Reset parameters \n mParameters = mProgram->createParameters();\n }\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::_load(void)\n {\n if (!mProgram->isLoaded())\n mProgram->load();\n }\n \/\/-----------------------------------------------------------------------------\n void GpuProgramUsage::_unload(void)\n {\n \/\/ TODO?\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <windows.h>\n#include <d3d9.h>\n\n#include \"d3d9overlay.h\"\n#include \"d3d9font.h\"\n#include \"d3d9hook.h\"\n#include <OvRender.h>\n\n\nDx9Font* Dx9OvFont;\nextern Dx9Overlay* D3D9Overlay;\nIDirect3DDevice9* Dx9OvDevice;\nOV_WINDOW_MODE D3D9Hook_WindowMode;\nUINT32 BackBufferWidth;\nUINT32 BackBufferHeight;\nUINT32 BackBufferCount;\n\nVOID Log(const wchar_t* Format, ...);\n\n\nVOID DebugRec()\n{\n D3DRECT rec = { 0, 0, 10, 10 };\n Dx9OvDevice->Clear(1, &rec, D3DCLEAR_TARGET, D3DCOLOR_ARGB(225, 225, 0, 0), 0, 0);\n}\n\n\nVOID ChangeVsync(BOOLEAN Setting)\n{\n if (Setting)\n D3D9Overlay->VsyncOverrideMode = VSYNC_FORCE_ON;\n else\n D3D9Overlay->VsyncOverrideMode = VSYNC_FORCE_OFF;\n\n D3D9Hook_ForceReset = TRUE;\n}\n\n\nWCHAR* GetVsyncChar( OV_VSYNC_OVERRIDE_MODE Mode )\n{\n switch (Mode)\n {\n case VSYNC_UNCHANGED:\n return L\"VSYNC_UNCHANGED\";\n break;\n case VSYNC_FORCE_ON:\n return L\"VSYNC_FORCE_ON\";\n break;\n case VSYNC_FORCE_OFF:\n return L\"VSYNC_FORCE_OFF\";\n break;\n default:\n return L\"VYSNC_UNKNOWN\";\n break;\n }\n}\n\n\nVOID UpdatePresentationParameters( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n \/\/ Force vsync?\n Log(L\"UpdatePresentationParameters(%s)\", GetVsyncChar(D3D9Overlay->VsyncOverrideMode));\n\n if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_ON)\n {\n PresentationParameters->PresentationInterval = D3DPRESENT_INTERVAL_ONE;\n }\n else if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_OFF)\n {\n PresentationParameters->PresentationInterval = D3DPRESENT_INTERVAL_IMMEDIATE;\n }\n\n if (D3D9Hook_WindowMode == WINDOW_WINDOWED)\n {\n RECT r;\n\n PresentationParameters->Windowed = TRUE;\n PresentationParameters->Flags = 0;\n PresentationParameters->FullScreen_RefreshRateInHz = 0;\n\n SetWindowLong(\n PresentationParameters->hDeviceWindow, \n GWL_STYLE, \n WS_POPUP | WS_CAPTION | WS_MINIMIZEBOX | WS_SYSMENU | WS_VISIBLE\n );\n\n GetClientRect(PresentationParameters->hDeviceWindow, &r);\n\n SetWindowPos(\n PresentationParameters->hDeviceWindow, \n HWND_NOTOPMOST, \n 0, \n 0,\n PresentationParameters->BackBufferWidth + (PresentationParameters->BackBufferWidth - r.right),\n PresentationParameters->BackBufferHeight + (PresentationParameters->BackBufferHeight - r.bottom),\n SWP_FRAMECHANGED | SWP_SHOWWINDOW | SWP_NOMOVE\n );\n }\n else if (D3D9Hook_WindowMode == WINDOW_FULLSCREEN)\n {\n PresentationParameters->Windowed = FALSE;\n }\n\n BackBufferHeight = PresentationParameters->BackBufferHeight;\n BackBufferWidth = PresentationParameters->BackBufferWidth;\n BackBufferCount = PresentationParameters->BackBufferCount;\n}\n\n\nVOID Dx9Overlay_CreateDevice( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n Log(L\"Dx9Overlay_CreateDevice()\");\n UpdatePresentationParameters(PresentationParameters);\n}\n\n\nVOID Dx9Overlay_Reset( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n Log(L\"Dx9Overlay_Reset()\");\n\n if (Dx9OvFont)\n {\n Dx9OvFont->InvalidateDeviceObjects();\n Dx9OvFont->DeleteDeviceObjects();\n }\n\n Dx9OvFont = NULL;\n\n UpdatePresentationParameters(PresentationParameters);\n}\n\n\nVOID Dx9OvRender( IDirect3DDevice9* Device )\n{\n IDirect3DSurface9 *renderTarget = NULL;\n IDirect3DSurface9 *backBuffer = NULL;\n D3DSURFACE_DESC backBufferDesc;\n D3DVIEWPORT9 viewport;\n\n if (Dx9OvFont == NULL)\n {\n Dx9OvFont = new Dx9Font(Device);\n\n Dx9OvFont->InitDeviceObjects();\n Dx9OvFont->RestoreDeviceObjects();\n \n Dx9OvDevice = Device;\n }\n\n \/\/ Backup render target.\n \n Device->GetRenderTarget( 0, &renderTarget );\n Device->GetViewport(&viewport);\n\n \/\/ Set backbuffer as new render target.\n \n Device->GetBackBuffer(0, 0, D3DBACKBUFFER_TYPE_MONO, &backBuffer);\n backBuffer->GetDesc(&backBufferDesc);\n\n if (backBufferDesc.Width != 1 && backBufferDesc.Height != 1)\n {\n Device->SetRenderTarget(0, backBuffer);\n }\n \n \/\/ Render our stuff.\n D3D9Overlay->Render();\n\n \/\/ Restore render target.\n\n Device->SetRenderTarget( 0, renderTarget );\n Device->SetViewport(&viewport);\n\n \/\/ Cleanup.\n\n backBuffer->Release();\n renderTarget->Release();\n}\n\n\nVOID Dx9Overlay_Present( IDirect3DDevice9* Device )\n{\n static BOOLEAN initialized = FALSE;\n\n Dx9OvRender(Device);\n\n if (!initialized)\n { \n if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_ON \n || D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_OFF)\n {\n D3D9Hook_ForceReset = TRUE;\n }\n\n initialized = TRUE;\n }\n}\n\n\nDx9Overlay::Dx9Overlay( OV_RENDER RenderFunction )\n{\n D3D9HOOK_PARAMS hookParams;\n\n hookParams.PresentCallback = Dx9Overlay_Present;\n hookParams.ResetCallback = Dx9Overlay_Reset;\n hookParams.CreateDeviceCallback = Dx9Overlay_CreateDevice;\n\n Log(L\"Dx9Overlay::Dx9Overlay( => )\");\n\n Dx9Hook_Initialize(&hookParams);\n\n UserRenderFunction = RenderFunction;\n}\n\n\nVOID\nDx9Overlay::DrawText( WCHAR* Text )\n{ \n DrawText(Text, 0xFFFFFF00);\n}\n\n\nVOID\nDx9Overlay::DrawText( WCHAR* Text, DWORD Color )\n{\n DrawText(Text, 20, Line, Color);\n\n Line += 15;\n}\n\n\nVOID Dx9Overlay::DrawText( WCHAR* Text, int X, int Y, DWORD Color )\n{\n Dx9OvFont->DrawText((FLOAT)X, (FLOAT)Y, Color, Text, NULL);\n}\n\n\nVOID\nDx9Overlay::Begin()\n{\n\n}\n\n\nVOID\nDx9Overlay::End()\n{\n\n}\n\n\nVOID*\nDx9Overlay::GetDevice()\n{\n return Dx9OvDevice;\n}<commit_msg>fix crash when d3d9 renderer not initialized<commit_after>#include <windows.h>\n#include <d3d9.h>\n\n#include \"d3d9overlay.h\"\n#include \"d3d9font.h\"\n#include \"d3d9hook.h\"\n#include <OvRender.h>\n\n\nDx9Font* Dx9OvFont;\nextern Dx9Overlay* D3D9Overlay;\nIDirect3DDevice9* Dx9OvDevice;\nOV_WINDOW_MODE D3D9Hook_WindowMode;\nUINT32 BackBufferWidth;\nUINT32 BackBufferHeight;\nUINT32 BackBufferCount;\n\nVOID Log(const wchar_t* Format, ...);\n\n\nVOID DebugRec()\n{\n D3DRECT rec = { 0, 0, 10, 10 };\n\n if (Dx9OvDevice)\n Dx9OvDevice->Clear(1, &rec, D3DCLEAR_TARGET, D3DCOLOR_ARGB(225, 225, 0, 0), 0, 0);\n}\n\n\nVOID ChangeVsync(BOOLEAN Setting)\n{\n if (Setting)\n D3D9Overlay->VsyncOverrideMode = VSYNC_FORCE_ON;\n else\n D3D9Overlay->VsyncOverrideMode = VSYNC_FORCE_OFF;\n\n D3D9Hook_ForceReset = TRUE;\n}\n\n\nWCHAR* GetVsyncChar( OV_VSYNC_OVERRIDE_MODE Mode )\n{\n switch (Mode)\n {\n case VSYNC_UNCHANGED:\n return L\"VSYNC_UNCHANGED\";\n break;\n case VSYNC_FORCE_ON:\n return L\"VSYNC_FORCE_ON\";\n break;\n case VSYNC_FORCE_OFF:\n return L\"VSYNC_FORCE_OFF\";\n break;\n default:\n return L\"VYSNC_UNKNOWN\";\n break;\n }\n}\n\n\nVOID UpdatePresentationParameters( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n \/\/ Force vsync?\n Log(L\"UpdatePresentationParameters(%s)\", GetVsyncChar(D3D9Overlay->VsyncOverrideMode));\n\n if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_ON)\n {\n PresentationParameters->PresentationInterval = D3DPRESENT_INTERVAL_ONE;\n }\n else if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_OFF)\n {\n PresentationParameters->PresentationInterval = D3DPRESENT_INTERVAL_IMMEDIATE;\n }\n\n if (D3D9Hook_WindowMode == WINDOW_WINDOWED)\n {\n RECT r;\n\n PresentationParameters->Windowed = TRUE;\n PresentationParameters->Flags = 0;\n PresentationParameters->FullScreen_RefreshRateInHz = 0;\n\n SetWindowLong(\n PresentationParameters->hDeviceWindow, \n GWL_STYLE, \n WS_POPUP | WS_CAPTION | WS_MINIMIZEBOX | WS_SYSMENU | WS_VISIBLE\n );\n\n GetClientRect(PresentationParameters->hDeviceWindow, &r);\n\n SetWindowPos(\n PresentationParameters->hDeviceWindow, \n HWND_NOTOPMOST, \n 0, \n 0,\n PresentationParameters->BackBufferWidth + (PresentationParameters->BackBufferWidth - r.right),\n PresentationParameters->BackBufferHeight + (PresentationParameters->BackBufferHeight - r.bottom),\n SWP_FRAMECHANGED | SWP_SHOWWINDOW | SWP_NOMOVE\n );\n }\n else if (D3D9Hook_WindowMode == WINDOW_FULLSCREEN)\n {\n PresentationParameters->Windowed = FALSE;\n }\n\n BackBufferHeight = PresentationParameters->BackBufferHeight;\n BackBufferWidth = PresentationParameters->BackBufferWidth;\n BackBufferCount = PresentationParameters->BackBufferCount;\n}\n\n\nVOID Dx9Overlay_CreateDevice( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n Log(L\"Dx9Overlay_CreateDevice()\");\n UpdatePresentationParameters(PresentationParameters);\n}\n\n\nVOID Dx9Overlay_Reset( D3DPRESENT_PARAMETERS* PresentationParameters )\n{\n Log(L\"Dx9Overlay_Reset()\");\n\n if (Dx9OvFont)\n {\n Dx9OvFont->InvalidateDeviceObjects();\n Dx9OvFont->DeleteDeviceObjects();\n }\n\n Dx9OvFont = NULL;\n\n UpdatePresentationParameters(PresentationParameters);\n}\n\n\nVOID Dx9OvRender( IDirect3DDevice9* Device )\n{\n IDirect3DSurface9 *renderTarget = NULL;\n IDirect3DSurface9 *backBuffer = NULL;\n D3DSURFACE_DESC backBufferDesc;\n D3DVIEWPORT9 viewport;\n\n if (Dx9OvFont == NULL)\n {\n Dx9OvFont = new Dx9Font(Device);\n\n Dx9OvFont->InitDeviceObjects();\n Dx9OvFont->RestoreDeviceObjects();\n \n Dx9OvDevice = Device;\n }\n\n \/\/ Backup render target.\n \n Device->GetRenderTarget( 0, &renderTarget );\n Device->GetViewport(&viewport);\n\n \/\/ Set backbuffer as new render target.\n \n Device->GetBackBuffer(0, 0, D3DBACKBUFFER_TYPE_MONO, &backBuffer);\n backBuffer->GetDesc(&backBufferDesc);\n\n if (backBufferDesc.Width != 1 && backBufferDesc.Height != 1)\n {\n Device->SetRenderTarget(0, backBuffer);\n }\n \n \/\/ Render our stuff.\n D3D9Overlay->Render();\n\n \/\/ Restore render target.\n\n Device->SetRenderTarget( 0, renderTarget );\n Device->SetViewport(&viewport);\n\n \/\/ Cleanup.\n\n backBuffer->Release();\n renderTarget->Release();\n}\n\n\nVOID Dx9Overlay_Present( IDirect3DDevice9* Device )\n{\n static BOOLEAN initialized = FALSE;\n\n Dx9OvRender(Device);\n\n if (!initialized)\n { \n if (D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_ON \n || D3D9Overlay->VsyncOverrideMode == VSYNC_FORCE_OFF)\n {\n D3D9Hook_ForceReset = TRUE;\n }\n\n initialized = TRUE;\n }\n}\n\n\nDx9Overlay::Dx9Overlay( OV_RENDER RenderFunction )\n{\n D3D9HOOK_PARAMS hookParams;\n\n hookParams.PresentCallback = Dx9Overlay_Present;\n hookParams.ResetCallback = Dx9Overlay_Reset;\n hookParams.CreateDeviceCallback = Dx9Overlay_CreateDevice;\n\n Log(L\"Dx9Overlay::Dx9Overlay( => )\");\n\n Dx9Hook_Initialize(&hookParams);\n\n UserRenderFunction = RenderFunction;\n}\n\n\nVOID\nDx9Overlay::DrawText( WCHAR* Text )\n{ \n DrawText(Text, 0xFFFFFF00);\n}\n\n\nVOID\nDx9Overlay::DrawText( WCHAR* Text, DWORD Color )\n{\n DrawText(Text, 20, Line, Color);\n\n Line += 15;\n}\n\n\nVOID Dx9Overlay::DrawText( WCHAR* Text, int X, int Y, DWORD Color )\n{\n Dx9OvFont->DrawText((FLOAT)X, (FLOAT)Y, Color, Text, NULL);\n}\n\n\nVOID\nDx9Overlay::Begin()\n{\n\n}\n\n\nVOID\nDx9Overlay::End()\n{\n\n}\n\n\nVOID*\nDx9Overlay::GetDevice()\n{\n return Dx9OvDevice;\n}<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by Xiaoqian Mu on 4\/1\/17.\n\/\/\n\n#include <List>\n#include \"point_location.h\"\n#include <iostream>\nusing namespace geo;\nusing namespace std;\n\n\nPointLocation::PointLocation(DoubleEdgeList* dcel){\n\n Create_edgeslist(dcel);\n Create_verticeslist(dcel);\n Create_PLTree();\n \/\/double l=pl_tree.Find_location(360,100);\n\n\/\/ if(l!=-1) {\n\/\/ Vector2 p = Vector2(360, 100);\n\/\/ PointLocationVertex *ver = new PointLocationVertex(p);\n\/\/ DoubleEdgeListFace *f = pl_tree.Search_point(l, ver);\n\/\/ if(f!= nullptr) {\n\/\/ auto k = f->edge;\n\/\/ }\n\/\/ else{\n\/\/ std::cout<<\"Out of the polygon\"<<endl;\n\/\/ }\n\/\/ }\n\/\/ else{\n\/\/ std::cout<<\"Out of the polygon\"<<endl;\n\/\/ }\n}\n\nbool PointLocation::Find_point_location(Vector2 &p, geo::Triangle &triangle) {\n double l=pl_tree.Find_location(p.x,p.y);\n\n if(l!=-1) {\n PointLocationVertex *ver = new PointLocationVertex(p);\n PointLocationEdge *e = pl_tree.Search_point(l, ver);\n if(e!= nullptr) {\n\t\t\ttriangle.point1 = e->v_l->point;\n\t\t\ttriangle.point2 = e->v_r->point;\n\t\t\ttriangle.point3 = (e->v_r->getEdgeTo(e->v_l))->next->twin->origin->point;\n return true;\n }\n else{\n \/\/std::cout<<\"Out of the polygon\"<<endl;\n return false;\n }\n }\n else{\n \/\/std::cout<<\"Out of the polygon\"<<endl;\n return false;\n }\n}\n\nvoid PointLocation::Create_edgeslist(DoubleEdgeList *dcel) {\n DoubleEdgeListHalfEdge* start;\n for(int i=0;i<dcel->edges.size();i++){\n start=dcel->edges.front();\n if(!start->visited) {\n PointLocationEdge new_edge =PointLocationEdge(start);\n edges.push_back(new_edge);\n }\n\n dcel->edges.pop_front();\n dcel->edges.push_back(start);\n\n }\n\n\/\/ for(auto it=dcel->edges.begin(); it!=dcel->edges.end();++it){\n\/\/ if(!it->visited)\n\/\/ }\n}\n\nvoid PointLocation::Create_verticeslist(DoubleEdgeList *dcel) {\n \/\/DoubleEdgeListVertex* new_vertex=dcel->vertices.front();\n\n for(int i=0;i<dcel->vertices.size();i++){\n PointLocationVertex new_vertex=PointLocationVertex(dcel->vertices.front());\n\/\/ new_vertex.vertex=dcel->vertices.front();\n\/\/\n for(int j=0;j<edges.size();j++){\n if(edges[j].v_l==new_vertex.vertex){\n new_vertex.edge_insert.push_back(&edges[j]);\n }\n if(edges[j].v_r==new_vertex.vertex){\n new_vertex.edge_delete.push_back(&edges[j]);\n }\n }\n\n dcel->vertices.pop_front();\n dcel->vertices.push_back(new_vertex.vertex);\n vertices.push_back(new_vertex);\n\n int s=vertices.size();\n s=s+0;\n }\n}\n\nvoid PointLocation::Create_PLTree() {\n pl_tree=PLRbTree(edges,vertices);\n}\n\n\/\/void PointLocation::Find_location(double x, double y) {\n\/\/ int low=0;\n\/\/ int high=pl_tree.roots.size()-1;\n\/\/ int mid=0;\n\/\/ int location=-1;\n\/\/\n\/\/ if(x>=pl_tree.roots[low]&&x<pl_tree.roots[low+1]) {\n\/\/ location = low;\n\/\/ }\n\/\/ if(x>=pl_tree.roots[high]&&x<pl_tree.roots[high+1]) {\n\/\/ location = high;\n\/\/ }\n\/\/\n\/\/ while(location<0) {\n\/\/ mid=(low+high)\/2;\n\/\/ if(x>=pl_tree.roots[mid]&&x<pl_tree.roots[mid+1])\n\/\/ location=mid;\n\/\/ if(x<pl_tree.roots[mid]){\n\/\/ high=mid;\n\/\/ }\n\/\/ if(x>pl_tree.roots[mid+1])\n\/\/ low=mid;\n\/\/ }\n\/\/}\n\n<commit_msg>Fix bug<commit_after>\/\/\n\/\/ Created by Xiaoqian Mu on 4\/1\/17.\n\/\/\n\n\/\/#include <list>\n#include \"point_location.h\"\n#include <iostream>\nusing namespace geo;\nusing namespace std;\n\n\nPointLocation::PointLocation(DoubleEdgeList* dcel){\n\n Create_edgeslist(dcel);\n Create_verticeslist(dcel);\n Create_PLTree();\n \/\/double l=pl_tree.Find_location(360,100);\n\n\/\/ if(l!=-1) {\n\/\/ Vector2 p = Vector2(360, 100);\n\/\/ PointLocationVertex *ver = new PointLocationVertex(p);\n\/\/ DoubleEdgeListFace *f = pl_tree.Search_point(l, ver);\n\/\/ if(f!= nullptr) {\n\/\/ auto k = f->edge;\n\/\/ }\n\/\/ else{\n\/\/ std::cout<<\"Out of the polygon\"<<endl;\n\/\/ }\n\/\/ }\n\/\/ else{\n\/\/ std::cout<<\"Out of the polygon\"<<endl;\n\/\/ }\n}\n\nbool PointLocation::Find_point_location(Vector2 &p, geo::Triangle &triangle) {\n double l=pl_tree.Find_location(p.x,p.y);\n\n if(l!=-1) {\n PointLocationVertex *ver = new PointLocationVertex(p);\n PointLocationEdge *e = pl_tree.Search_point(l, ver);\n if(e!= nullptr) {\n\t\t\ttriangle.point1 = e->v_l->point;\n\t\t\ttriangle.point2 = e->v_r->point;\n\t\t\ttriangle.point3 = (e->v_r->getEdgeTo(e->v_l))->next->twin->origin->point;\n return true;\n }\n else{\n \/\/std::cout<<\"Out of the polygon\"<<endl;\n return false;\n }\n }\n else{\n \/\/std::cout<<\"Out of the polygon\"<<endl;\n return false;\n }\n}\n\nvoid PointLocation::Create_edgeslist(DoubleEdgeList *dcel) {\n DoubleEdgeListHalfEdge* start;\n for(int i=0;i<dcel->edges.size();i++){\n start=dcel->edges.front();\n if(!start->visited) {\n PointLocationEdge new_edge =PointLocationEdge(start);\n edges.push_back(new_edge);\n }\n\n dcel->edges.pop_front();\n dcel->edges.push_back(start);\n\n }\n\n\/\/ for(auto it=dcel->edges.begin(); it!=dcel->edges.end();++it){\n\/\/ if(!it->visited)\n\/\/ }\n}\n\nvoid PointLocation::Create_verticeslist(DoubleEdgeList *dcel) {\n \/\/DoubleEdgeListVertex* new_vertex=dcel->vertices.front();\n\n for(int i=0;i<dcel->vertices.size();i++){\n PointLocationVertex new_vertex=PointLocationVertex(dcel->vertices.front());\n\/\/ new_vertex.vertex=dcel->vertices.front();\n\/\/\n for(int j=0;j<edges.size();j++){\n if(edges[j].v_l==new_vertex.vertex){\n new_vertex.edge_insert.push_back(&edges[j]);\n }\n if(edges[j].v_r==new_vertex.vertex){\n new_vertex.edge_delete.push_back(&edges[j]);\n }\n }\n\n dcel->vertices.pop_front();\n dcel->vertices.push_back(new_vertex.vertex);\n vertices.push_back(new_vertex);\n\n int s=vertices.size();\n s=s+0;\n }\n}\n\nvoid PointLocation::Create_PLTree() {\n pl_tree=PLRbTree(edges,vertices);\n}\n\n\/\/void PointLocation::Find_location(double x, double y) {\n\/\/ int low=0;\n\/\/ int high=pl_tree.roots.size()-1;\n\/\/ int mid=0;\n\/\/ int location=-1;\n\/\/\n\/\/ if(x>=pl_tree.roots[low]&&x<pl_tree.roots[low+1]) {\n\/\/ location = low;\n\/\/ }\n\/\/ if(x>=pl_tree.roots[high]&&x<pl_tree.roots[high+1]) {\n\/\/ location = high;\n\/\/ }\n\/\/\n\/\/ while(location<0) {\n\/\/ mid=(low+high)\/2;\n\/\/ if(x>=pl_tree.roots[mid]&&x<pl_tree.roots[mid+1])\n\/\/ location=mid;\n\/\/ if(x<pl_tree.roots[mid]){\n\/\/ high=mid;\n\/\/ }\n\/\/ if(x>pl_tree.roots[mid+1])\n\/\/ low=mid;\n\/\/ }\n\/\/}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright NumFOCUS\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef itkImageRegionConstIteratorWithIndex_hxx\n#define itkImageRegionConstIteratorWithIndex_hxx\n\n#include \"itkImageRegionConstIteratorWithIndex.h\"\n\nnamespace itk\n{\n\/\/----------------------------------------------------------------------\n\/\/ Advance along the line\n\/\/----------------------------------------------------------------------\ntemplate <typename TImage>\nImageRegionConstIteratorWithIndex<TImage> &\nImageRegionConstIteratorWithIndex<TImage>::operator++()\n{\n this->m_Remaining = false;\n for (unsigned int in = 0; in < TImage::ImageDimension; in++)\n {\n this->m_PositionIndex[in]++;\n if (this->m_PositionIndex[in] < this->m_EndIndex[in])\n {\n this->m_Position += this->m_OffsetTable[in];\n this->m_Remaining = true;\n break;\n }\n else\n {\n this->m_Position -= this->m_OffsetTable[in] * (static_cast<OffsetValueType>(this->m_Region.GetSize()[in]) - 1);\n this->m_PositionIndex[in] = this->m_BeginIndex[in];\n }\n }\n\n if (!this->m_Remaining) \/\/ It will not advance here otherwise\n {\n this->m_Position = this->m_End;\n }\n\n return *this;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Advance along the line in reverse direction\n\/\/----------------------------------------------------------------------\ntemplate <typename TImage>\nImageRegionConstIteratorWithIndex<TImage> &\nImageRegionConstIteratorWithIndex<TImage>::operator--()\n{\n this->m_Remaining = false;\n for (unsigned int in = 0; in < TImage::ImageDimension; in++)\n {\n if (this->m_PositionIndex[in] > this->m_BeginIndex[in])\n {\n this->m_PositionIndex[in]--;\n this->m_Position -= this->m_OffsetTable[in];\n this->m_Remaining = true;\n break;\n }\n else\n {\n this->m_Position += this->m_OffsetTable[in] * (static_cast<OffsetValueType>(this->m_Region.GetSize()[in]) - 1);\n this->m_PositionIndex[in] = this->m_EndIndex[in] - 1;\n }\n }\n\n if (!this->m_Remaining) \/\/ It will not advance here otherwise\n {\n this->m_Position = this->m_End;\n }\n\n return *this;\n}\n} \/\/ end namespace itk\n\n#endif\n<commit_msg>COMP: Fix -Wstrict-overflow warning in itkImageRegionConstIteratorWithIndex<commit_after>\/*=========================================================================\n *\n * Copyright NumFOCUS\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef itkImageRegionConstIteratorWithIndex_hxx\n#define itkImageRegionConstIteratorWithIndex_hxx\n\n#include \"itkImageRegionConstIteratorWithIndex.h\"\n\nnamespace itk\n{\n\/\/----------------------------------------------------------------------\n\/\/ Advance along the line\n\/\/----------------------------------------------------------------------\ntemplate <typename TImage>\nImageRegionConstIteratorWithIndex<TImage> &\nImageRegionConstIteratorWithIndex<TImage>::operator++()\n{\n this->m_Remaining = false;\n for (unsigned int in = 0; in < TImage::ImageDimension; in++)\n {\n const IndexValueType positionIndex = ++this->m_PositionIndex[in];\n if (positionIndex < this->m_EndIndex[in])\n {\n this->m_Position += this->m_OffsetTable[in];\n this->m_Remaining = true;\n break;\n }\n else\n {\n this->m_Position -= this->m_OffsetTable[in] * (static_cast<OffsetValueType>(this->m_Region.GetSize()[in]) - 1);\n this->m_PositionIndex[in] = this->m_BeginIndex[in];\n }\n }\n\n if (!this->m_Remaining) \/\/ It will not advance here otherwise\n {\n this->m_Position = this->m_End;\n }\n\n return *this;\n}\n\n\/\/----------------------------------------------------------------------\n\/\/ Advance along the line in reverse direction\n\/\/----------------------------------------------------------------------\ntemplate <typename TImage>\nImageRegionConstIteratorWithIndex<TImage> &\nImageRegionConstIteratorWithIndex<TImage>::operator--()\n{\n this->m_Remaining = false;\n for (unsigned int in = 0; in < TImage::ImageDimension; in++)\n {\n if (this->m_PositionIndex[in] > this->m_BeginIndex[in])\n {\n this->m_PositionIndex[in]--;\n this->m_Position -= this->m_OffsetTable[in];\n this->m_Remaining = true;\n break;\n }\n else\n {\n this->m_Position += this->m_OffsetTable[in] * (static_cast<OffsetValueType>(this->m_Region.GetSize()[in]) - 1);\n this->m_PositionIndex[in] = this->m_EndIndex[in] - 1;\n }\n }\n\n if (!this->m_Remaining) \/\/ It will not advance here otherwise\n {\n this->m_Position = this->m_End;\n }\n\n return *this;\n}\n} \/\/ end namespace itk\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#include \"catch.hpp\"\n\n#include <iostream>\n#include <cstring>\n#include <mapnik\/color.hpp>\n#include <mapnik\/image.hpp>\n#include <mapnik\/image_reader.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/image_util_jpeg.hpp>\n#include <mapnik\/util\/fs.hpp>\n#if defined(HAVE_CAIRO)\n#include <mapnik\/cairo\/cairo_context.hpp>\n#include <mapnik\/cairo\/cairo_image_util.hpp>\n#endif\n\n#pragma GCC diagnostic push\n#include <mapnik\/warning_ignore.hpp>\n#include <boost\/format.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n#pragma GCC diagnostic pop\n\ninline void make_directory(std::string const& dir) {\n boost::filesystem::create_directories(dir);\n}\n\nTEST_CASE(\"image io\") {\n\nSECTION(\"readers\") {\n\n std::string should_throw;\n boost::optional<std::string> type;\n try\n {\n mapnik::image_rgba8 im_og;\n auto im_size = mapnik::image_rgba8::pixel_size * im_og.width() * im_og.height();\n mapnik::detail::buffer buf(im_og.bytes(), im_size);\n mapnik::image_rgba8 im2(im_og.width(), im_og.height(), buf.data());\n CHECK( im2.bytes() == im_og.bytes() );\n#if defined(HAVE_JPEG)\n should_throw = \".\/test\/data\/images\/blank.jpg\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n\n \/\/ actually a png so jpeg reader should throw\n should_throw = \".\/test\/data\/images\/landusepattern.jpg\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n try\n {\n std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type));\n REQUIRE(false);\n }\n catch (std::exception const& ex)\n {\n REQUIRE( std::string(ex.what()) == std::string(\"JPEG Reader: libjpeg could not read image: Not a JPEG file: starts with 0x89 0x50\") );\n }\n\n#endif\n\n REQUIRE_THROWS(mapnik::image_rgba8 im(-10,-10)); \/\/ should throw rather than overflow\n\n#if defined(HAVE_CAIRO)\n mapnik::cairo_surface_ptr image_surface(\n cairo_image_surface_create(CAIRO_FORMAT_ARGB32,256,257),\n mapnik::cairo_surface_closer());\n mapnik::image_rgba8 im_data(cairo_image_surface_get_width(&*image_surface), cairo_image_surface_get_height(&*image_surface));\n im_data.set(1);\n REQUIRE( (unsigned)im_data(0,0) == unsigned(1) );\n \/\/ Should set back to fully transparent\n mapnik::cairo_image_to_rgba8(im_data, image_surface);\n REQUIRE( (unsigned)im_data(0,0) == unsigned(0) );\n#endif\n\n#if defined(HAVE_PNG)\n should_throw = \".\/test\/data\/images\/blank.png\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n\n should_throw = \".\/test\/data\/images\/xcode-CgBI.png\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n\n#if defined(HAVE_TIFF)\n should_throw = \".\/test\/data\/images\/blank.tiff\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n\n#if defined(HAVE_WEBP)\n should_throw = \".\/test\/data\/images\/blank.webp\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n }\n catch (std::exception const & ex)\n {\n std::clog << ex.what() << \"\\n\";\n REQUIRE(false);\n }\n\n} \/\/ END SECTION\n\nSECTION(\"writers options\")\n{\n#if defined(HAVE_JPEG)\n \/\/ test we can parse both jpegXX and quality=XX options\n REQUIRE_THROWS(mapnik::detail::parse_jpeg_quality(\"jpegXX\"));\n REQUIRE_THROWS(mapnik::detail::parse_jpeg_quality(\"jpeg:quality=XX\"));\n int q0 = mapnik::detail::parse_jpeg_quality(\"jpeg50\");\n int q1 = mapnik::detail::parse_jpeg_quality(\"jpeg:quality=50\");\n REQUIRE(q0 == q1);\n#endif\n} \/\/ END SECTION\n\n\nSECTION(\"image_util : save_to_file\/save_to_stream\/save_to_string\")\n{\n mapnik::image_rgba8 im(256,256);\n std::string named_color = \"lightblue\";\n mapnik::fill(im, mapnik::color(named_color).rgba());\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n std::vector<std::tuple<std::string, std::string> > supported_types;\n#if defined(HAVE_PNG)\n supported_types.push_back(std::make_tuple(\"png\",\"png\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png24\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png32\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png8\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png256\"));\n#endif\n#if defined(HAVE_JPEG)\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg\"));\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg80\"));\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg90\"));\n#endif\n#if defined(HAVE_TIFF)\n supported_types.push_back(std::make_tuple(\"tiff\",\"tiff\"));\n#endif\n#if defined(HAVE_WEBP)\n supported_types.push_back(std::make_tuple(\"webp\",\"webp\"));\n#endif\n\n std::string directory_name(\"\/tmp\/mapnik-tests\/\");\n make_directory(directory_name);\n REQUIRE(mapnik::util::exists(directory_name));\n\n for (auto const& info : supported_types)\n {\n std::string extension;\n std::string format;\n std::tie(extension, format) = info;\n std::string filename = (boost::format(directory_name + \"mapnik-%1%.%2%\") % named_color % extension).str();\n mapnik::save_to_file(im, filename);\n std::string str = mapnik::save_to_string(im, format);\n std::ostringstream ss;\n mapnik::save_to_stream(im, ss, format);\n CHECK(str.length() == ss.str().length());\n \/\/ wrap reader in scope to ensure the file handle is\n \/\/ released before we try to remove the file\n {\n std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(filename, extension));\n unsigned w = reader->width();\n unsigned h = reader->height();\n auto im2 = reader->read(0, 0, w, h);\n CHECK(im2.size() == im.size());\n if (extension == \"png\" || extension == \"tiff\")\n {\n CHECK(0 == std::memcmp(im2.bytes(), im.bytes(), im.width() * im.height()));\n }\n }\n if (mapnik::util::exists(filename))\n {\n mapnik::util::remove(filename);\n }\n }\n}\n} \/\/ END TEST_CASE\n<commit_msg>image - add tiny image quantising tests (ref #3466)<commit_after>#include \"catch.hpp\"\n\n#include <cstring>\n#include <mapnik\/color.hpp>\n#include <mapnik\/image.hpp>\n#include <mapnik\/image_reader.hpp>\n#include <mapnik\/image_util.hpp>\n#include <mapnik\/image_util_jpeg.hpp>\n#include <mapnik\/util\/fs.hpp>\n#if defined(HAVE_CAIRO)\n#include <mapnik\/cairo\/cairo_context.hpp>\n#include <mapnik\/cairo\/cairo_image_util.hpp>\n#endif\n\n#pragma GCC diagnostic push\n#include <mapnik\/warning_ignore.hpp>\n#include <boost\/format.hpp>\n#include <boost\/filesystem\/convenience.hpp>\n#pragma GCC diagnostic pop\n\ninline void make_directory(std::string const& dir) {\n boost::filesystem::create_directories(dir);\n}\n\nnamespace {\ntemplate <typename T>\nvoid check_tiny_png_image_quantising(T const& im)\n{\n std::ostringstream ss(std::ios::binary);\n mapnik::save_to_stream(im, ss, \"png8\");\n ss.flush();\n std::string str = ss.str();\n std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(str.data(), str.size()));\n auto w = reader->width();\n auto h = reader->height();\n CHECK(w > 0);\n CHECK(h > 0);\n auto im2 = mapnik::util::get<mapnik::image_rgba8>(reader->read(0, 0, w, h));\n for (std::size_t i = 0; i < w; ++i)\n {\n for (std::size_t j = 0; j < h; ++j)\n {\n REQUIRE(im2(i,j) == im(i,j));\n }\n }\n}\n\n}\n\nTEST_CASE(\"image io\") {\n\nSECTION(\"readers\") {\n\n std::string should_throw;\n boost::optional<std::string> type;\n try\n {\n mapnik::image_rgba8 im_og;\n auto im_size = mapnik::image_rgba8::pixel_size * im_og.width() * im_og.height();\n mapnik::detail::buffer buf(im_og.bytes(), im_size);\n mapnik::image_rgba8 im2(im_og.width(), im_og.height(), buf.data());\n CHECK( im2.bytes() == im_og.bytes() );\n#if defined(HAVE_JPEG)\n should_throw = \".\/test\/data\/images\/blank.jpg\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n\n \/\/ actually a png so jpeg reader should throw\n should_throw = \".\/test\/data\/images\/landusepattern.jpg\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n try\n {\n std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type));\n REQUIRE(false);\n }\n catch (std::exception const& ex)\n {\n REQUIRE( std::string(ex.what()) == std::string(\"JPEG Reader: libjpeg could not read image: Not a JPEG file: starts with 0x89 0x50\") );\n }\n\n#endif\n\n REQUIRE_THROWS(mapnik::image_rgba8 im(-10,-10)); \/\/ should throw rather than overflow\n\n#if defined(HAVE_CAIRO)\n mapnik::cairo_surface_ptr image_surface(\n cairo_image_surface_create(CAIRO_FORMAT_ARGB32,256,257),\n mapnik::cairo_surface_closer());\n mapnik::image_rgba8 im_data(cairo_image_surface_get_width(&*image_surface), cairo_image_surface_get_height(&*image_surface));\n im_data.set(1);\n REQUIRE( (unsigned)im_data(0,0) == unsigned(1) );\n \/\/ Should set back to fully transparent\n mapnik::cairo_image_to_rgba8(im_data, image_surface);\n REQUIRE( (unsigned)im_data(0,0) == unsigned(0) );\n#endif\n\n#if defined(HAVE_PNG)\n should_throw = \".\/test\/data\/images\/blank.png\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n\n should_throw = \".\/test\/data\/images\/xcode-CgBI.png\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n\n#if defined(HAVE_TIFF)\n should_throw = \".\/test\/data\/images\/blank.tiff\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n\n#if defined(HAVE_WEBP)\n should_throw = \".\/test\/data\/images\/blank.webp\";\n REQUIRE( mapnik::util::exists( should_throw ) );\n type = mapnik::type_from_filename(should_throw);\n REQUIRE( type );\n REQUIRE_THROWS(std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(should_throw,*type)));\n#endif\n }\n catch (std::exception const & ex)\n {\n std::clog << ex.what() << \"\\n\";\n REQUIRE(false);\n }\n\n} \/\/ END SECTION\n\nSECTION(\"writers options\")\n{\n#if defined(HAVE_JPEG)\n \/\/ test we can parse both jpegXX and quality=XX options\n REQUIRE_THROWS(mapnik::detail::parse_jpeg_quality(\"jpegXX\"));\n REQUIRE_THROWS(mapnik::detail::parse_jpeg_quality(\"jpeg:quality=XX\"));\n int q0 = mapnik::detail::parse_jpeg_quality(\"jpeg50\");\n int q1 = mapnik::detail::parse_jpeg_quality(\"jpeg:quality=50\");\n REQUIRE(q0 == q1);\n#endif\n} \/\/ END SECTION\n\n\nSECTION(\"image_util : save_to_file\/save_to_stream\/save_to_string\")\n{\n mapnik::image_rgba8 im(256,256);\n std::string named_color = \"lightblue\";\n mapnik::fill(im, mapnik::color(named_color).rgba());\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n std::vector<std::tuple<std::string, std::string> > supported_types;\n#if defined(HAVE_PNG)\n supported_types.push_back(std::make_tuple(\"png\",\"png\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png24\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png32\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png8\"));\n supported_types.push_back(std::make_tuple(\"png\",\"png256\"));\n#endif\n#if defined(HAVE_JPEG)\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg\"));\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg80\"));\n supported_types.push_back(std::make_tuple(\"jpeg\",\"jpeg90\"));\n#endif\n#if defined(HAVE_TIFF)\n supported_types.push_back(std::make_tuple(\"tiff\",\"tiff\"));\n#endif\n#if defined(HAVE_WEBP)\n supported_types.push_back(std::make_tuple(\"webp\",\"webp\"));\n#endif\n\n std::string directory_name(\"\/tmp\/mapnik-tests\/\");\n make_directory(directory_name);\n REQUIRE(mapnik::util::exists(directory_name));\n\n for (auto const& info : supported_types)\n {\n std::string extension;\n std::string format;\n std::tie(extension, format) = info;\n std::string filename = (boost::format(directory_name + \"mapnik-%1%.%2%\") % named_color % extension).str();\n mapnik::save_to_file(im, filename);\n std::string str = mapnik::save_to_string(im, format);\n std::ostringstream ss;\n mapnik::save_to_stream(im, ss, format);\n CHECK(str.length() == ss.str().length());\n \/\/ wrap reader in scope to ensure the file handle is\n \/\/ released before we try to remove the file\n {\n std::unique_ptr<mapnik::image_reader> reader(mapnik::get_image_reader(filename, extension));\n unsigned w = reader->width();\n unsigned h = reader->height();\n auto im2 = reader->read(0, 0, w, h);\n CHECK(im2.size() == im.size());\n if (extension == \"png\" || extension == \"tiff\")\n {\n CHECK(0 == std::memcmp(im2.bytes(), im.bytes(), im.width() * im.height()));\n }\n }\n if (mapnik::util::exists(filename))\n {\n mapnik::util::remove(filename);\n }\n }\n}\n\nSECTION(\"Quantising small (less than 3 pixel images preserve original colours\")\n{\n#if defined(HAVE_PNG)\n { \/\/ 1x1\n mapnik::image_rgba8 im(1,1); \/\/ 1 pixel\n im(0,0) = mapnik::color(\"green\").rgba();\n check_tiny_png_image_quantising(im);\n }\n { \/\/ 1x2\n mapnik::image_rgba8 im(1,2); \/\/ 2 pixels\n mapnik::fill(im, mapnik::color(\"red\").rgba());\n im(0,0) = mapnik::color(\"green\").rgba();\n check_tiny_png_image_quantising(im);\n }\n { \/\/ 2x1\n mapnik::image_rgba8 im(2,1); \/\/ 2 pixels\n mapnik::fill(im, mapnik::color(\"red\").rgba());\n im(0,0) = mapnik::color(\"green\").rgba();\n check_tiny_png_image_quantising(im);\n }\n#endif\n} \/\/ END SECTION\n\n} \/\/ END TEST_CASE\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"CppUnitTest.h\"\n\n#include \"..\\Quantities\\Dimensionless.hpp\"\n#include \"..\\Quantities\\Quantities.hpp\"\n\nnamespace Principia {\nnamespace TestUtilities {\n\n\/\/ The Microsoft equivalent supports errors only for double.\ntemplate<typename ValueType, typename ErrorType>\nvoid AssertEqualWithin(ValueType const& left,\n ValueType const& right,\n ErrorType const& ε) {\n std::wstring message = L\"Should be equal within \" + ToString(ε, 3) +\n L\": \" + ToString(left) + L\" and \" + ToString(right) +\n L\".\";\n LogLine(message);\n AssertTrue(left == right || Abs(left \/ right - 1) < ε, message);\n}\n\ntemplate<typename ValueType, typename ErrorType>\nvoid AssertNotEqualWithin(ValueType const& left,\n ValueType const& right,\n ErrorType const& ε) {\n std::wstring message = L\"Should differ by more than \" + ToString(ε, 3) +\n L\": \" + ToString(left) + L\" and \" + ToString(right) +\n L\".\";\n LogLine(message);\n AssertTrue(Abs(left \/ right - 1) > ε, message);\n}\n\ninline void WriteLog(std::wstring const& message) {\n Microsoft::VisualStudio::CppUnitTestFramework::Logger::WriteMessage(\n message.c_str());\n}\n\ninline void NewLine() {\n Microsoft::VisualStudio::CppUnitTestFramework::Logger::WriteMessage(L\"\\n\");\n}\n\n\/\/ Equivalent to Log(message); Newline();\ninline void LogLine(std::wstring const& message) {\n WriteLog(message);\n NewLine();\n}\n\n\/\/ The Microsoft equivalent only takes a wchar_t*.\ninline void AssertTrue(bool const test, std::wstring const& message) {\n Microsoft::VisualStudio::CppUnitTestFramework::Assert::IsTrue(\n test,\n message.c_str());\n}\n\n} \/\/ namespace TestUtilities\n} \/\/ namespace Principia\n<commit_msg>Extraneous comments are redundant.<commit_after>#pragma once\n\n#include \"CppUnitTest.h\"\n\n#include \"..\\Quantities\\Dimensionless.hpp\"\n#include \"..\\Quantities\\Quantities.hpp\"\n\nnamespace Principia {\nnamespace TestUtilities {\n\ntemplate<typename ValueType, typename ErrorType>\nvoid AssertEqualWithin(ValueType const& left,\n ValueType const& right,\n ErrorType const& ε) {\n std::wstring message = L\"Should be equal within \" + ToString(ε, 3) +\n L\": \" + ToString(left) + L\" and \" + ToString(right) +\n L\".\";\n LogLine(message);\n AssertTrue(left == right || Abs(left \/ right - 1) < ε, message);\n}\n\ntemplate<typename ValueType, typename ErrorType>\nvoid AssertNotEqualWithin(ValueType const& left,\n ValueType const& right,\n ErrorType const& ε) {\n std::wstring message = L\"Should differ by more than \" + ToString(ε, 3) +\n L\": \" + ToString(left) + L\" and \" + ToString(right) +\n L\".\";\n LogLine(message);\n AssertTrue(Abs(left \/ right - 1) > ε, message);\n}\n\ninline void WriteLog(std::wstring const& message) {\n Microsoft::VisualStudio::CppUnitTestFramework::Logger::WriteMessage(\n message.c_str());\n}\n\ninline void NewLine() {\n Microsoft::VisualStudio::CppUnitTestFramework::Logger::WriteMessage(L\"\\n\");\n}\n\ninline void LogLine(std::wstring const& message) {\n WriteLog(message);\n NewLine();\n}\n\ninline void AssertTrue(bool const test, std::wstring const& message) {\n Microsoft::VisualStudio::CppUnitTestFramework::Assert::IsTrue(\n test,\n message.c_str());\n}\n\n} \/\/ namespace TestUtilities\n} \/\/ namespace Principia\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Insight Segmentation & Registration Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) Insight Software Consortium. All rights reserved.\nSee ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include <list>\n#include <itkImage.h>\n#include <itkITTFilterContext.h>\n#include <itkImageToTreeFilter.h>\n#include <itkStartPointData.h>\n#include <itkTubeSegmentModel.h>\n#include <itkRegistrationModelXMLWriter.h>\n\n#include <mitkVesselTreeData.h>\n\n\/\/ image type\ntypedef unsigned char PixelType;\nconst unsigned int Dimension = 3;\ntypedef itk::Image<PixelType, Dimension> ImageType;\ntypedef ImageType::Pointer ImagePointer;\ntypedef ImageType::PointType PointType;\ntypedef ImageType::DirectionType DirectionType;\n\n\/\/ tree type\ntypedef mitk::VesselTreeData OutputTreeType;\ntypedef OutputTreeType::Pointer OutputTreePointer;\n\n\/\/ typedef itk::ImageFileReader<ImageType> ImageReaderType;\n\/\/ typedef ImageReaderType::Pointer ImageReaderPointer;\n\n\/\/ test classes\ntypedef itk::ImageToTreeFilter<ImageType, OutputTreeType>\n ImageToTreeFilterType;\ntypedef ImageToTreeFilterType::Pointer ImageToTreeFilterPointer;\ntypedef itk::ITTFilterContext<ImageType, OutputTreeType>\n FilterContextType;\ntypedef FilterContextType::Pointer FilterContextPointer;\ntypedef FilterContextType::StartPointQueueType StartPointQueueType;\ntypedef itk::StartPointData<ImageType> StartPointDataType;\ntypedef StartPointDataType::Pointer StartPointDataPointer;\n\ntypedef itk::TubeSegmentModel<PixelType, DirectionType>\n TubeSegmentModelType;\ntypedef TubeSegmentModelType::Pointer TubeSegmentModelPointer;\n\ntypedef itk::RegistrationModel<PixelType, DirectionType>\n RegistrationModelType;\n\ntypedef itk::RegistrationModelXMLWriter<RegistrationModelType>\n RegistrationModelWriterType;\ntypedef RegistrationModelWriterType::Pointer RegistrationModelWriterPointer;\n\ntypedef std::list<int> ResultListType;\n\n\/******************************************************************\n * TEST 1: Saving and loading data objects to the filter context\n *****************************************************************\/\nint testFilterContext()\n{\n \/\/ init some test data\n PointType testPoint1;\n testPoint1.Fill(0);\n DirectionType testDirection1;\n testDirection1.Fill(0);\n StartPointDataPointer data1 = StartPointDataType::New();\n data1->SetStartPoint(&testPoint1);\n data1->SetStartDirection(&testDirection1);\n\n PointType testPoint2;\n testPoint2.Fill(1);\n DirectionType testDirection2;\n testDirection2.Fill(0);\n StartPointDataPointer data2 = StartPointDataType::New();\n data2->SetStartPoint(&testPoint2);\n data2->SetStartDirection(&testDirection2);\n\n\n std::cout << \" *** Testing ITTFilterContext for storage of objects ***\\n\";\n FilterContextPointer filterContext = FilterContextType::New();\n\n StartPointQueueType* pointQueue1 = filterContext->GetStartPointQueue();\n std::cout << \"Pushing points to filter context...\\n\";\n pointQueue1->push(data1);\n pointQueue1->push(data2);\n\n std::cout << \"Reading points from filter context...\\n\";\n StartPointQueueType* pointQueue2 = filterContext->GetStartPointQueue();\n if (pointQueue2->front() == data1)\n {\n pointQueue2->pop();\n }\n else\n {\n std::cout << \"Points not in queue.\\n\";\n std::cout << \"[TEST FAILED]\\n\";\n return EXIT_FAILURE;\n }\n\n if (pointQueue2->front() == data2)\n {\n pointQueue2->pop();\n }\n else\n {\n std::cout << \"Points not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\/****************************************************************\n * TEST 2: Initialising the filter\n ****************************************************************\/\n \/\/ TODO: test init of image\nint testInitFilter()\n{\n \/\/ init some test data\n PointType testPoint1;\n testPoint1.Fill(0);\n\n DirectionType testDirection1;\n testDirection1.Fill(0);\n\n std::cout << \" *** Testing initialization of filter ***\\n\";\n std::cout << \"Loading new StartPointData to filter...\\n\";\n ImageToTreeFilterPointer testFilter = ImageToTreeFilterType::New();\n testFilter->SetStartPoint(&testPoint1);\n testFilter->SetStartDirection(&testDirection1);\n\n \/\/ start point should be the first point in the filter\n std::cout << \"Reading StartPointData from filter...\\n\";\n FilterContextPointer testFilterContext = testFilter->GetFilterContext();\n StartPointQueueType* testQueue = testFilterContext->GetStartPointQueue();\n StartPointDataPointer testData = testQueue->front();\n PointType* testPoint2 = testData->GetStartPoint();\n DirectionType* testDirection2 = testData->GetStartDirection();\n\n if(testPoint1 != *testPoint2)\n {\n std::cout << \"Startpoint not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n if(testDirection1 != *testDirection2)\n {\n std::cout << \"Startdirection not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\/****************************************************************\n * TEST 3: TubeSegmentModel\n ****************************************************************\/\nint testTubeSegmentModel()\n{\n std::cout << \" *** Testing the tube segments ***\\n\";\n TubeSegmentModelPointer tubeSegment = TubeSegmentModelType::New();\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\/****************************************************************\n * TEST 4: XML Writer\n ****************************************************************\/\nint testRegistrationModelXMLWriter()\n{\n std::cout << \" *** Testing the RegistrationModelXMLWriter ***\\n\";\n RegistrationModelWriterPointer modelWriter = RegistrationModelWriterType::New();\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\n\nint itkImageToTreeFilterTest(int, char* argv[] )\n{\n ResultListType resultList;\n int failedCount = 0;\n int testCount;\n float failRatio;\n\n \/\/ run all tests\n resultList.push_back(testFilterContext());\n resultList.push_back(testInitFilter());\n resultList.push_back(testTubeSegmentModel());\n resultList.push_back(testRegistrationModelXMLWriter());\n\n std::cout << \" *** [ALL TESTS DONE] ***\\n\";\n\n testCount = resultList.size();\n\n while (resultList.size() > 0)\n {\n int value = resultList.front();\n if(value == EXIT_FAILURE) { failedCount++; }\n resultList.pop_front();\n }\n\n failRatio = 100 * (float) failedCount \/ (float) testCount;\n\n std::cout << \"Result: \";\n std::cout << failedCount;\n std::cout << \"\/\";\n std::cout << testCount;\n std::cout << \" Tests failed (\";\n std::cout << failRatio;\n std::cout << \" %)\\n\";\n\n return EXIT_SUCCESS;\n}\n<commit_msg>- xml writer is working - new structure with cli-program for generation<commit_after>\/*=========================================================================\n\nProgram: Insight Segmentation & Registration Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) Insight Software Consortium. All rights reserved.\nSee ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include <list>\n#include <itkImage.h>\n#include <itkTreeContainer.h>\n\n#include <itkImageToTreeFilter.h>\n#include <itkITTFilterContext.h>\n#include <itkRegistrationModelXMLWriter.h>\n#include <itkStartPointData.h>\n#include <itkTubeSegmentModel.h>\n\n\/\/ image type\ntypedef unsigned char PixelType;\nconst unsigned int Dimension = 3;\ntypedef itk::Image<PixelType, Dimension> ImageType;\ntypedef ImageType::Pointer ImagePointer;\ntypedef ImageType::PointType PointType;\ntypedef ImageType::DirectionType DirectionType;\n\ntypedef itk::RegistrationModel<PixelType> RegistrationModelType;\ntypedef RegistrationModelType::Pointer RegistrationModelPointer;\n\n\/\/ tree type\ntypedef itk::TreeContainer<RegistrationModelPointer> OutputTreeType;\ntypedef OutputTreeType::Pointer OutputTreePointer;\n\n\/\/ test classes\ntypedef itk::ImageToTreeFilter<ImageType, OutputTreeType>\n ImageToTreeFilterType;\ntypedef ImageToTreeFilterType::Pointer ImageToTreeFilterPointer;\ntypedef itk::ITTFilterContext<ImageType, OutputTreeType>\n FilterContextType;\ntypedef FilterContextType::Pointer FilterContextPointer;\ntypedef FilterContextType::StartPointQueueType StartPointQueueType;\ntypedef itk::StartPointData<ImageType> StartPointDataType;\ntypedef StartPointDataType::Pointer StartPointDataPointer;\n\ntypedef itk::TubeSegmentModel<PixelType> TubeSegmentModelType;\ntypedef TubeSegmentModelType::Pointer TubeSegmentModelPointer;\n\ntypedef itk::RegistrationModelXMLWriter<TubeSegmentModelType>\n RegistrationModelWriterType;\ntypedef RegistrationModelWriterType::Pointer RegistrationModelWriterPointer;\n\ntypedef std::list<int> ResultListType;\n\n\/******************************************************************\n * TEST 1: Saving and loading data objects to the filter context\n *****************************************************************\/\nint testFilterContext()\n{\n \/\/ init some test data\n PointType testPoint1;\n testPoint1.Fill(0);\n DirectionType testDirection1;\n testDirection1.Fill(0);\n StartPointDataPointer data1 = StartPointDataType::New();\n data1->SetStartPoint(&testPoint1);\n data1->SetStartDirection(&testDirection1);\n\n PointType testPoint2;\n testPoint2.Fill(1);\n DirectionType testDirection2;\n testDirection2.Fill(0);\n StartPointDataPointer data2 = StartPointDataType::New();\n data2->SetStartPoint(&testPoint2);\n data2->SetStartDirection(&testDirection2);\n\n\n std::cout << \" *** Testing ITTFilterContext for storage of objects ***\\n\";\n FilterContextPointer filterContext = FilterContextType::New();\n\n StartPointQueueType* pointQueue1 = filterContext->GetStartPointQueue();\n std::cout << \"Pushing points to filter context...\\n\";\n pointQueue1->push(data1);\n pointQueue1->push(data2);\n\n std::cout << \"Reading points from filter context...\\n\";\n StartPointQueueType* pointQueue2 = filterContext->GetStartPointQueue();\n if (pointQueue2->front() == data1)\n {\n pointQueue2->pop();\n }\n else\n {\n std::cout << \"Points not in queue.\\n\";\n std::cout << \"[TEST FAILED]\\n\";\n return EXIT_FAILURE;\n }\n\n if (pointQueue2->front() == data2)\n {\n pointQueue2->pop();\n }\n else\n {\n std::cout << \"Points not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\/****************************************************************\n * TEST 2: Initialising the filter\n ****************************************************************\/\n \/\/ TODO: test init of image\nint testInitFilter()\n{\n \/\/ init some test data\n PointType testPoint1;\n testPoint1.Fill(0);\n\n DirectionType testDirection1;\n testDirection1.Fill(0);\n\n std::cout << \" *** Testing initialization of filter ***\\n\";\n std::cout << \"Loading new StartPointData to filter...\\n\";\n ImageToTreeFilterPointer testFilter = ImageToTreeFilterType::New();\n testFilter->SetStartPoint(&testPoint1);\n testFilter->SetStartDirection(&testDirection1);\n\n \/\/ start point should be the first point in the filter\n std::cout << \"Reading StartPointData from filter...\\n\";\n FilterContextPointer testFilterContext = testFilter->GetFilterContext();\n StartPointQueueType* testQueue = testFilterContext->GetStartPointQueue();\n StartPointDataPointer testData = testQueue->front();\n PointType* testPoint2 = testData->GetStartPoint();\n DirectionType* testDirection2 = testData->GetStartDirection();\n\n if(testPoint1 != *testPoint2)\n {\n std::cout << \"Startpoint not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n if(testDirection1 != *testDirection2)\n {\n std::cout << \"Startdirection not in queue.\\n\";\n std::cout << \" *** [TEST FAILED] ***\\n\";\n return EXIT_FAILURE;\n }\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\/****************************************************************\n * TEST 3: XML Writer\n ****************************************************************\/\nint testRegistrationModelXMLWriter()\n{\n std::cout << \" *** Testing the RegistrationModelXMLWriter ***\\n\";\n\n typedef TubeSegmentModelType::PointSetType PointSetType;\n typedef PointSetType::Pointer PointSetPointer;\n typedef PointSetType::PointType PointType;\n typedef PointSetType::PointsContainer PointsContainerType;\n typedef PointsContainerType::Pointer PointsContainerPointer;\n typedef PointsContainerType::ElementIdentifier ElementIdentifier;\n typedef PointSetType::PointDataContainer PointDataContainerType;\n typedef PointDataContainerType::Pointer PointDataContainerPointer;\n\n TubeSegmentModelPointer tubeSegment = TubeSegmentModelType::New();\n ElementIdentifier index = 0;\n PointSetPointer pointSet = PointSetType::New();\n PointsContainerPointer pointsContainer = PointsContainerType::New();\n PointDataContainerPointer pointDataContainer = PointDataContainerType::New();\n\n \/\/ init test data\n PointType startPoint;\n startPoint.Fill(0);\n tubeSegment->SetStartPoint(&startPoint);\n\n PointType point1; \/\/ 1, 1, 0\n point1[0] = 1;\n point1[1] = 1;\n point1[2] = 0;\n\/\/ pointsContainer->InsertElement(index, &point1);\n\/\/ pointDataContainer->InsertElement(index, 1);\n index++;\n\n PointType point2; \/\/ 1, 0, 1\n point2[0] = 1;\n point2[1] = 0;\n point2[2] = 1;\n\/\/ pointsContainer->InsertElement(index, &point2);\n\/\/ pointDataContainer->InsertElement(index, 1);\n index++;\n\n PointType point3; \/\/ 1, 0, 1\n point3[0] = 1;\n point3[1] = 0;\n point3[2] = 1;\n\/\/ pointsContainer->InsertElement(index, &point3);\n\/\/ pointDataContainer->InsertElement(index, 1);\n index++;\n\n pointSet->SetPoints(pointsContainer);\n pointSet->SetPointData(pointDataContainer);\n tubeSegment->SetPointSet(pointSet);\n\n RegistrationModelWriterPointer modelWriter = RegistrationModelWriterType::New();\n modelWriter->SetRegistrationModel(tubeSegment);\n modelWriter->SetFilename(\"test.xml\");\n modelWriter->WriteFile();\n\n \/\/ TODO: compare to normal data\n\n std::cout << \" *** [TEST PASSED] ***\\n\";\n return EXIT_SUCCESS;\n}\n\n\n\nint itkImageToTreeFilterTest(int i, char* argv[] )\n{\n ResultListType resultList;\n int failedCount = 0;\n int testCount;\n float failRatio;\n\n \/\/ run all tests\n resultList.push_back(testFilterContext());\n resultList.push_back(testInitFilter());\n resultList.push_back(testRegistrationModelXMLWriter());\n\n std::cout << \" *** [ALL TESTS DONE] ***\\n\";\n\n testCount = resultList.size();\n\n while (resultList.size() > 0)\n {\n int value = resultList.front();\n if(value == EXIT_FAILURE) { failedCount++; }\n resultList.pop_front();\n }\n\n failRatio = 100 * (float) failedCount \/ (float) testCount;\n\n std::cout << \"Result: \";\n std::cout << failedCount;\n std::cout << \"\/\";\n std::cout << testCount;\n std::cout << \" Tests failed (\";\n std::cout << failRatio;\n std::cout << \" %)\\n\";\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __BSE_BCORE_HH__\n#define __BSE_BCORE_HH__\n\n#include <sfi\/platform.hh>\n#include <sfi\/strings.hh>\n#include <sfi\/glib-extra.hh>\n\nnamespace Bse {\n\n\/\/ == type aliases ==\ntypedef uint8_t uint8; \/\/\/< An 8-bit unsigned integer.\ntypedef uint16_t uint16; \/\/\/< A 16-bit unsigned integer.\ntypedef uint32_t uint32; \/\/\/< A 32-bit unsigned integer.\ntypedef uint64_t uint64; \/\/\/< A 64-bit unsigned integer, use PRI*64 in format strings.\ntypedef int8_t int8; \/\/\/< An 8-bit signed integer.\ntypedef int16_t int16; \/\/\/< A 16-bit signed integer.\ntypedef int32_t int32; \/\/\/< A 32-bit signed integer.\ntypedef int64_t int64; \/\/\/< A 64-bit unsigned integer, use PRI*64 in format strings.\ntypedef uint32_t unichar; \/\/\/< A 32-bit unsigned integer used for Unicode characters.\nstatic_assert (sizeof (uint8) == 1 && sizeof (uint16) == 2 && sizeof (uint32) == 4 && sizeof (uint64) == 8, \"\");\nstatic_assert (sizeof (int8) == 1 && sizeof (int16) == 2 && sizeof (int32) == 4 && sizeof (int64) == 8, \"\");\nstatic_assert (sizeof (int) == 4 && sizeof (uint) == 4 && sizeof (unichar) == 4, \"\");\nusing std::map;\nusing std::vector;\ntypedef std::string String; \/\/\/< Convenience alias for std::string.\ntypedef vector<String> StringVector; \/\/\/< Convenience alias for a std::vector<std::string>.\nusing Aida::Any;\nusing Aida::EventFd;\nusing Rapicorn::DataKey;\nusing Rapicorn::DataListContainer;\n\n\/\/ == Diagnostics ==\ntemplate<class... Args> String string_format (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> String string_locale_format (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> void printout (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> void printerr (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class ...Args> void fatal_error (const char *format, const Args &...args) BSE_NORETURN;\ntemplate<class ...Args> void warning (const char *format, const Args &...args);\ntemplate<class ...Args> void warn (const char *format, const Args &...args);\ntemplate<class ...Args> void info (const char *format, const Args &...args);\ntemplate<class ...Args> inline void dump (const char *conditional, const char *format, const Args &...args) BSE_ALWAYS_INLINE;\ntemplate<class ...Args> inline void debug (const char *conditional, const char *format, const Args &...args) BSE_ALWAYS_INLINE;\ninline bool debug_enabled (const char *conditional) BSE_ALWAYS_INLINE BSE_PURE;\n\n\/\/ == Development Aids ==\nextern inline void breakpoint () BSE_ALWAYS_INLINE; \/\/\/< Cause a debugging breakpoint, for development only.\n\n\/\/ == Binary Lookups ==\ntemplate<typename RandIter, class Cmp, typename Arg, int case_lookup_or_sibling_or_insertion>\nextern inline std::pair<RandIter,bool>\nbinary_lookup_fuzzy (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n RandIter current = end;\n size_t n_elements = end - begin, offs = 0;\n const bool want_lookup = case_lookup_or_sibling_or_insertion == 0;\n \/\/ const bool want_sibling = case_lookup_or_sibling_or_insertion == 1;\n const bool want_insertion_pos = case_lookup_or_sibling_or_insertion > 1;\n ssize_t cmp = 0;\n while (offs < n_elements)\n {\n size_t i = (offs + n_elements) >> 1;\n current = begin + i;\n cmp = cmp_elements (arg, *current);\n if (cmp == 0)\n return want_insertion_pos ? std::make_pair (current, true) : std::make_pair (current, \/*ignored*\/ false);\n else if (cmp < 0)\n n_elements = i;\n else \/* (cmp > 0) *\/\n offs = i + 1;\n }\n \/* check is last mismatch, cmp > 0 indicates greater key *\/\n return (want_lookup\n ? std::make_pair (end, \/*ignored*\/ false)\n : (want_insertion_pos && cmp > 0)\n ? std::make_pair (current + 1, false)\n : std::make_pair (current, false));\n}\n\n\/** Perform a binary lookup to find the insertion position for a new element.\n * Return (end,false) for end-begin==0, or return (position,true) for exact match,\n * otherwise return (position,false) where position indicates the location for\n * the key to be inserted (and may equal end).\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline std::pair<RandIter,bool>\nbinary_lookup_insertion_pos (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,2> (begin, end, cmp_elements, arg);\n}\n\n\/** Perform a binary lookup to yield exact or nearest match.\n * return end for end-begin==0, otherwise return the exact match element, or,\n * if there's no such element, return the element last visited, which is pretty\n * close to an exact match (will be one off into either direction).\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline RandIter\nbinary_lookup_sibling (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,1> (begin, end, cmp_elements, arg).first;\n}\n\n\/** Perform binary lookup and yield exact match or @a end.\n * The arguments [ @a begin, @a end [ denote the range used for the lookup,\n * @a arg is passed along with the current element to the @a cmp_elements\n * function.\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline RandIter\nbinary_lookup (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n \/* return end or exact match *\/\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,0> (begin, end, cmp_elements, arg).first;\n}\n\n\/\/\/ Comparison function useful to sort lesser items first.\ntemplate<typename Value> static inline int\ncompare_lesser (const Value &v1, const Value &v2)\n{\n return -(v1 < v2) | (v2 < v1);\n}\n\n\/\/\/ Comparison function useful to sort greater items first.\ntemplate<typename Value> static inline int\ncompare_greater (const Value &v1, const Value &v2)\n{\n return (v1 < v2) | -(v2 < v1);\n}\n\n\/\/ == Implementation Details ==\n#if (defined __i386__ || defined __x86_64__)\ninline void breakpoint() { __asm__ __volatile__ (\"int $03\"); }\n#elif defined __alpha__ && !defined __osf__\ninline void breakpoint() { __asm__ __volatile__ (\"bpt\"); }\n#else \/\/ !__i386__ && !__alpha__\ninline void breakpoint() { __builtin_trap(); }\n#endif\n\nnamespace Internal {\nextern bool debug_any_enabled; \/\/< Indicates if $BSE_DEBUG enables some debug settings.\nbool debug_key_enabled (const char *conditional) BSE_PURE;\nvoid diagnostic (char kind, const std::string &message);\nvoid debug_diagnostic (const char *prefix, const std::string &message);\nvoid force_abort () BSE_NORETURN;\nvoid printout_string (const String &string);\nvoid printerr_string (const String &string);\n} \/\/ Internal\n\n\/\/\/ Print a message on stdout (and flush stdout) ala printf(), using the POSIX\/C locale.\ntemplate<class... Args> void\nprintout (const char *format, const Args &...args)\n{\n Internal::printout_string (string_format (format, args...));\n}\n\n\/\/\/ Print a message on stderr (and flush stderr) ala printf(), using the POSIX\/C locale.\ntemplate<class... Args> void\nprinterr (const char *format, const Args &...args)\n{\n Internal::printerr_string (string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like message if @a conditional is enabled by $BSE_DEBUG.\ntemplate<class ...Args> inline void BSE_ALWAYS_INLINE\ndump (const char *conditional, const char *format, const Args &...args)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled) && Internal::debug_key_enabled (conditional))\n Internal::diagnostic (' ', string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like debugging message if @a conditional is enabled by $BSE_DEBUG.\ntemplate<class ...Args> inline void BSE_ALWAYS_INLINE\ndebug (const char *conditional, const char *format, const Args &...args)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled) && Internal::debug_key_enabled (conditional))\n Internal::debug_diagnostic (conditional, string_format (format, args...));\n}\n\n\/\/\/ Check if @a conditional is enabled by $BSE_DEBUG.\ninline bool BSE_ALWAYS_INLINE BSE_PURE\ndebug_enabled (const char *conditional)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled))\n return Internal::debug_key_enabled (conditional);\n return false;\n}\n\n\/** Issue a printf-like message and abort the program, this function will not return.\n * Avoid using this in library code, aborting may take precious user data with it,\n * library code should instead use info() or assert_return().\n *\/\ntemplate<class ...Args> void BSE_NORETURN\nfatal_error (const char *format, const Args &...args)\n{\n Internal::diagnostic ('F', string_format (format, args...));\n Internal::force_abort();\n}\n\n\/\/\/ Issue a printf-like warning message.\ntemplate<class ...Args> void BSE_NORETURN\nwarn (const char *format, const Args &...args)\n{\n Internal::diagnostic ('W', string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like warning message.\ntemplate<class ...Args> void BSE_NORETURN\nwarning (const char *format, const Args &...args)\n{\n Internal::diagnostic ('W', string_format (format, args...));\n}\n\n\/\/\/ Issue an informative printf-like message.\ntemplate<class ...Args> void BSE_NORETURN\ninfo (const char *format, const Args &...args)\n{\n Internal::diagnostic ('I', string_format (format, args...));\n}\n\n\/\/ == Assertions ==\n\/\/\/ Return from the current function if @a cond is unmet and issue an assertion warning.\n#define BSE_ASSERT_RETURN(cond, ...) do { if (BSE_ISLIKELY (cond)) break; ::Bse::assertion_failed (__FILE__, __LINE__, #cond); return __VA_ARGS__; } while (0)\n\/\/\/ Return from the current function and issue an assertion warning.\n#define BSE_ASSERT_RETURN_UNREACHED(...) do { ::Bse::assertion_failed (__FILE__, __LINE__, NULL); return __VA_ARGS__; } while (0)\n#ifdef BSE_CONVENIENCE\n\/\/\/ Return from the current function if @a cond is unmet and issue an assertion warning.\n#define assert_return(cond, ...) BSE_ASSERT_RETURN (cond, __VA_ARGS__)\n\/\/\/ Return from the current function and issue an assertion warning.\n#define assert_return_unreached(...) BSE_ASSERT_RETURN_UNREACHED (__VA_ARGS__)\n\/\/\/ Hint to the compiler to optimize for @a cond == TRUE.\n#define ISLIKELY(cond) BSE_ISLIKELY (cond)\n\/\/\/ Hint to the compiler to optimize for @a cond == FALSE.\n#define UNLIKELY(cond) BSE_UNLIKELY (cond)\n\/\/\/ Return silently if @a cond does not evaluate to true with return value @a ...\n#define return_unless(cond, ...) BSE_RETURN_UNLESS (cond, __VA_ARGS__)\n#endif \/\/ BSE_CONVENIENCE\n\n\/\/ == Memory Utilities ==\nint fmsb (uint64 word) BSE_CONST; \/\/\/< Find most significant bit set in a word.\nvoid* aligned_alloc (size_t total_size, size_t alignment, uint8 **free_pointer);\nvoid aligned_free (uint8 **free_pointer);\n\n\/\/\/ Class to maintain an array of aligned memory.\ntemplate<class T, int ALIGNMENT>\nclass AlignedArray {\n uint8 *unaligned_mem_;\n T *data_;\n size_t n_elements_;\n void\n allocate_aligned_data()\n {\n static_assert (ALIGNMENT % sizeof (T) == 0, \"ALIGNMENT must exactly fit a multiple of sizeof (T)\");\n data_ = reinterpret_cast<T*> (aligned_alloc (n_elements_ * sizeof (T), ALIGNMENT, &unaligned_mem_));\n }\n \/\/ disallow copy constructor assignment operator\n RAPICORN_CLASS_NON_COPYABLE (AlignedArray);\npublic:\n AlignedArray (const vector<T>& elements) :\n n_elements_ (elements.size())\n {\n allocate_aligned_data();\n for (size_t i = 0; i < n_elements_; i++)\n new (data_ + i) T (elements[i]);\n }\n AlignedArray (size_t n_elements) :\n n_elements_ (n_elements)\n {\n allocate_aligned_data();\n for (size_t i = 0; i < n_elements_; i++)\n new (data_ + i) T();\n }\n ~AlignedArray()\n {\n \/\/ C++ destruction order: last allocated element is deleted first\n while (n_elements_)\n data_[--n_elements_].~T();\n aligned_free (&unaligned_mem_);\n }\n T& operator[] (size_t pos) { return data_[pos]; }\n const T& operator[] (size_t pos) const { return data_[pos]; }\n size_t size () const { return n_elements_; }\n};\n\n\/\/ == Threading ==\n\/**\n * The Spinlock uses low-latency busy spinning to acquire locks.\n * This class is a thin wrapper around pthread_spin_lock() and related functions.\n * This class supports static construction.\n *\/\nclass Spinlock {\n pthread_spinlock_t spinlock_;\npublic:\n constexpr Spinlock () : spinlock_ { BSE_SPINLOCK_INITIALIZER } {}\n void lock () { pthread_spin_lock (&spinlock_); }\n void unlock () { pthread_spin_unlock (&spinlock_); }\n bool try_lock () { return 0 == pthread_spin_trylock (&spinlock_); }\n typedef pthread_spinlock_t* native_handle_type;\n native_handle_type native_handle() { return &spinlock_; }\n \/*ctor*\/ Spinlock (const Spinlock&) = delete;\n Spinlock& operator= (const Spinlock&) = delete;\n};\n\n} \/\/ Bse\n\n#endif \/\/ __BSE_BCORE_HH__\n<commit_msg>SFI: import threading and memory utilities from Rapicorn into Bse<commit_after>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __BSE_BCORE_HH__\n#define __BSE_BCORE_HH__\n\n#include <sfi\/platform.hh>\n#include <sfi\/strings.hh>\n#include <sfi\/glib-extra.hh>\n\nnamespace Bse {\n\n\/\/ == type aliases ==\ntypedef uint8_t uint8; \/\/\/< An 8-bit unsigned integer.\ntypedef uint16_t uint16; \/\/\/< A 16-bit unsigned integer.\ntypedef uint32_t uint32; \/\/\/< A 32-bit unsigned integer.\ntypedef uint64_t uint64; \/\/\/< A 64-bit unsigned integer, use PRI*64 in format strings.\ntypedef int8_t int8; \/\/\/< An 8-bit signed integer.\ntypedef int16_t int16; \/\/\/< A 16-bit signed integer.\ntypedef int32_t int32; \/\/\/< A 32-bit signed integer.\ntypedef int64_t int64; \/\/\/< A 64-bit unsigned integer, use PRI*64 in format strings.\ntypedef uint32_t unichar; \/\/\/< A 32-bit unsigned integer used for Unicode characters.\nstatic_assert (sizeof (uint8) == 1 && sizeof (uint16) == 2 && sizeof (uint32) == 4 && sizeof (uint64) == 8, \"\");\nstatic_assert (sizeof (int8) == 1 && sizeof (int16) == 2 && sizeof (int32) == 4 && sizeof (int64) == 8, \"\");\nstatic_assert (sizeof (int) == 4 && sizeof (uint) == 4 && sizeof (unichar) == 4, \"\");\nusing std::map;\nusing std::vector;\ntypedef std::string String; \/\/\/< Convenience alias for std::string.\ntypedef vector<String> StringVector; \/\/\/< Convenience alias for a std::vector<std::string>.\nusing Aida::Any;\nusing Aida::EventFd;\nusing Rapicorn::DataKey;\nusing Rapicorn::DataListContainer;\nusing Rapicorn::void_t;\nusing Rapicorn::Blob;\nusing Rapicorn::Res;\nusing Rapicorn::TaskStatus;\nusing Rapicorn::ThreadInfo;\nusing Rapicorn::cpu_info;\nusing Rapicorn::AsyncBlockingQueue;\nnamespace ThisThread = Rapicorn::ThisThread;\n\n\/\/ == Diagnostics ==\ntemplate<class... Args> String string_format (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> String string_locale_format (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> void printout (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class... Args> void printerr (const char *format, const Args &...args) BSE_PRINTF (1, 0);\ntemplate<class ...Args> void fatal_error (const char *format, const Args &...args) BSE_NORETURN;\ntemplate<class ...Args> void warning (const char *format, const Args &...args);\ntemplate<class ...Args> void warn (const char *format, const Args &...args);\ntemplate<class ...Args> void info (const char *format, const Args &...args);\ntemplate<class ...Args> inline void dump (const char *conditional, const char *format, const Args &...args) BSE_ALWAYS_INLINE;\ntemplate<class ...Args> inline void debug (const char *conditional, const char *format, const Args &...args) BSE_ALWAYS_INLINE;\ninline bool debug_enabled (const char *conditional) BSE_ALWAYS_INLINE BSE_PURE;\n\n\/\/ == Development Aids ==\nextern inline void breakpoint () BSE_ALWAYS_INLINE; \/\/\/< Cause a debugging breakpoint, for development only.\n\n\/\/ == Binary Lookups ==\ntemplate<typename RandIter, class Cmp, typename Arg, int case_lookup_or_sibling_or_insertion>\nextern inline std::pair<RandIter,bool>\nbinary_lookup_fuzzy (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n RandIter current = end;\n size_t n_elements = end - begin, offs = 0;\n const bool want_lookup = case_lookup_or_sibling_or_insertion == 0;\n \/\/ const bool want_sibling = case_lookup_or_sibling_or_insertion == 1;\n const bool want_insertion_pos = case_lookup_or_sibling_or_insertion > 1;\n ssize_t cmp = 0;\n while (offs < n_elements)\n {\n size_t i = (offs + n_elements) >> 1;\n current = begin + i;\n cmp = cmp_elements (arg, *current);\n if (cmp == 0)\n return want_insertion_pos ? std::make_pair (current, true) : std::make_pair (current, \/*ignored*\/ false);\n else if (cmp < 0)\n n_elements = i;\n else \/* (cmp > 0) *\/\n offs = i + 1;\n }\n \/* check is last mismatch, cmp > 0 indicates greater key *\/\n return (want_lookup\n ? std::make_pair (end, \/*ignored*\/ false)\n : (want_insertion_pos && cmp > 0)\n ? std::make_pair (current + 1, false)\n : std::make_pair (current, false));\n}\n\n\/** Perform a binary lookup to find the insertion position for a new element.\n * Return (end,false) for end-begin==0, or return (position,true) for exact match,\n * otherwise return (position,false) where position indicates the location for\n * the key to be inserted (and may equal end).\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline std::pair<RandIter,bool>\nbinary_lookup_insertion_pos (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,2> (begin, end, cmp_elements, arg);\n}\n\n\/** Perform a binary lookup to yield exact or nearest match.\n * return end for end-begin==0, otherwise return the exact match element, or,\n * if there's no such element, return the element last visited, which is pretty\n * close to an exact match (will be one off into either direction).\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline RandIter\nbinary_lookup_sibling (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,1> (begin, end, cmp_elements, arg).first;\n}\n\n\/** Perform binary lookup and yield exact match or @a end.\n * The arguments [ @a begin, @a end [ denote the range used for the lookup,\n * @a arg is passed along with the current element to the @a cmp_elements\n * function.\n *\/\ntemplate<typename RandIter, class Cmp, typename Arg>\nextern inline RandIter\nbinary_lookup (RandIter begin, RandIter end, Cmp cmp_elements, const Arg &arg)\n{\n \/* return end or exact match *\/\n return binary_lookup_fuzzy<RandIter,Cmp,Arg,0> (begin, end, cmp_elements, arg).first;\n}\n\n\/\/\/ Comparison function useful to sort lesser items first.\ntemplate<typename Value> static inline int\ncompare_lesser (const Value &v1, const Value &v2)\n{\n return -(v1 < v2) | (v2 < v1);\n}\n\n\/\/\/ Comparison function useful to sort greater items first.\ntemplate<typename Value> static inline int\ncompare_greater (const Value &v1, const Value &v2)\n{\n return (v1 < v2) | -(v2 < v1);\n}\n\n\/\/ == Implementation Details ==\n#if (defined __i386__ || defined __x86_64__)\ninline void breakpoint() { __asm__ __volatile__ (\"int $03\"); }\n#elif defined __alpha__ && !defined __osf__\ninline void breakpoint() { __asm__ __volatile__ (\"bpt\"); }\n#else \/\/ !__i386__ && !__alpha__\ninline void breakpoint() { __builtin_trap(); }\n#endif\n\nnamespace Internal {\nextern bool debug_any_enabled; \/\/< Indicates if $BSE_DEBUG enables some debug settings.\nbool debug_key_enabled (const char *conditional) BSE_PURE;\nvoid diagnostic (char kind, const std::string &message);\nvoid debug_diagnostic (const char *prefix, const std::string &message);\nvoid force_abort () BSE_NORETURN;\nvoid printout_string (const String &string);\nvoid printerr_string (const String &string);\n} \/\/ Internal\n\n\/\/\/ Print a message on stdout (and flush stdout) ala printf(), using the POSIX\/C locale.\ntemplate<class... Args> void\nprintout (const char *format, const Args &...args)\n{\n Internal::printout_string (string_format (format, args...));\n}\n\n\/\/\/ Print a message on stderr (and flush stderr) ala printf(), using the POSIX\/C locale.\ntemplate<class... Args> void\nprinterr (const char *format, const Args &...args)\n{\n Internal::printerr_string (string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like message if @a conditional is enabled by $BSE_DEBUG.\ntemplate<class ...Args> inline void BSE_ALWAYS_INLINE\ndump (const char *conditional, const char *format, const Args &...args)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled) && Internal::debug_key_enabled (conditional))\n Internal::diagnostic (' ', string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like debugging message if @a conditional is enabled by $BSE_DEBUG.\ntemplate<class ...Args> inline void BSE_ALWAYS_INLINE\ndebug (const char *conditional, const char *format, const Args &...args)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled) && Internal::debug_key_enabled (conditional))\n Internal::debug_diagnostic (conditional, string_format (format, args...));\n}\n\n\/\/\/ Check if @a conditional is enabled by $BSE_DEBUG.\ninline bool BSE_ALWAYS_INLINE BSE_PURE\ndebug_enabled (const char *conditional)\n{\n if (BSE_UNLIKELY (Internal::debug_any_enabled))\n return Internal::debug_key_enabled (conditional);\n return false;\n}\n\n\/** Issue a printf-like message and abort the program, this function will not return.\n * Avoid using this in library code, aborting may take precious user data with it,\n * library code should instead use info() or assert_return().\n *\/\ntemplate<class ...Args> void BSE_NORETURN\nfatal_error (const char *format, const Args &...args)\n{\n Internal::diagnostic ('F', string_format (format, args...));\n Internal::force_abort();\n}\n\n\/\/\/ Issue a printf-like warning message.\ntemplate<class ...Args> void BSE_NORETURN\nwarn (const char *format, const Args &...args)\n{\n Internal::diagnostic ('W', string_format (format, args...));\n}\n\n\/\/\/ Issue a printf-like warning message.\ntemplate<class ...Args> void BSE_NORETURN\nwarning (const char *format, const Args &...args)\n{\n Internal::diagnostic ('W', string_format (format, args...));\n}\n\n\/\/\/ Issue an informative printf-like message.\ntemplate<class ...Args> void BSE_NORETURN\ninfo (const char *format, const Args &...args)\n{\n Internal::diagnostic ('I', string_format (format, args...));\n}\n\n\/\/ == Assertions ==\n\/\/\/ Return from the current function if @a cond is unmet and issue an assertion warning.\n#define BSE_ASSERT_RETURN(cond, ...) do { if (BSE_ISLIKELY (cond)) break; ::Bse::assertion_failed (__FILE__, __LINE__, #cond); return __VA_ARGS__; } while (0)\n\/\/\/ Return from the current function and issue an assertion warning.\n#define BSE_ASSERT_RETURN_UNREACHED(...) do { ::Bse::assertion_failed (__FILE__, __LINE__, NULL); return __VA_ARGS__; } while (0)\n#ifdef BSE_CONVENIENCE\n\/\/\/ Return from the current function if @a cond is unmet and issue an assertion warning.\n#define assert_return(cond, ...) BSE_ASSERT_RETURN (cond, __VA_ARGS__)\n\/\/\/ Return from the current function and issue an assertion warning.\n#define assert_return_unreached(...) BSE_ASSERT_RETURN_UNREACHED (__VA_ARGS__)\n\/\/\/ Hint to the compiler to optimize for @a cond == TRUE.\n#define ISLIKELY(cond) BSE_ISLIKELY (cond)\n\/\/\/ Hint to the compiler to optimize for @a cond == FALSE.\n#define UNLIKELY(cond) BSE_UNLIKELY (cond)\n\/\/\/ Return silently if @a cond does not evaluate to true with return value @a ...\n#define return_unless(cond, ...) BSE_RETURN_UNLESS (cond, __VA_ARGS__)\n#endif \/\/ BSE_CONVENIENCE\n\n\/\/ == Memory Utilities ==\nint fmsb (uint64 word) BSE_CONST; \/\/\/< Find most significant bit set in a word.\nvoid* aligned_alloc (size_t total_size, size_t alignment, uint8 **free_pointer);\nvoid aligned_free (uint8 **free_pointer);\n\n\/\/\/ Class to maintain an array of aligned memory.\ntemplate<class T, int ALIGNMENT>\nclass AlignedArray {\n uint8 *unaligned_mem_;\n T *data_;\n size_t n_elements_;\n void\n allocate_aligned_data()\n {\n static_assert (ALIGNMENT % sizeof (T) == 0, \"ALIGNMENT must exactly fit a multiple of sizeof (T)\");\n data_ = reinterpret_cast<T*> (aligned_alloc (n_elements_ * sizeof (T), ALIGNMENT, &unaligned_mem_));\n }\n \/\/ disallow copy constructor assignment operator\n RAPICORN_CLASS_NON_COPYABLE (AlignedArray);\npublic:\n AlignedArray (const vector<T>& elements) :\n n_elements_ (elements.size())\n {\n allocate_aligned_data();\n for (size_t i = 0; i < n_elements_; i++)\n new (data_ + i) T (elements[i]);\n }\n AlignedArray (size_t n_elements) :\n n_elements_ (n_elements)\n {\n allocate_aligned_data();\n for (size_t i = 0; i < n_elements_; i++)\n new (data_ + i) T();\n }\n ~AlignedArray()\n {\n \/\/ C++ destruction order: last allocated element is deleted first\n while (n_elements_)\n data_[--n_elements_].~T();\n aligned_free (&unaligned_mem_);\n }\n T& operator[] (size_t pos) { return data_[pos]; }\n const T& operator[] (size_t pos) const { return data_[pos]; }\n size_t size () const { return n_elements_; }\n};\n\n\/\/ == Threading ==\n\/**\n * The Spinlock uses low-latency busy spinning to acquire locks.\n * This class is a thin wrapper around pthread_spin_lock() and related functions.\n * This class supports static construction.\n *\/\nclass Spinlock {\n pthread_spinlock_t spinlock_;\npublic:\n constexpr Spinlock () : spinlock_ { BSE_SPINLOCK_INITIALIZER } {}\n void lock () { pthread_spin_lock (&spinlock_); }\n void unlock () { pthread_spin_unlock (&spinlock_); }\n bool try_lock () { return 0 == pthread_spin_trylock (&spinlock_); }\n typedef pthread_spinlock_t* native_handle_type;\n native_handle_type native_handle() { return &spinlock_; }\n \/*ctor*\/ Spinlock (const Spinlock&) = delete;\n Spinlock& operator= (const Spinlock&) = delete;\n};\n\n} \/\/ Bse\n\n#endif \/\/ __BSE_BCORE_HH__\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <string>\n#include <vector>\n#include <list>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <utility>\n#include <iostream>\n#include <streambuf>\n#include <tuple>\n\nnamespace NSaveLoad {\n\ntemplate<class T, typename E = void>\nclass TSerializer {\npublic:\n static void Save(std::ostream& out, const T& object) {\n object.Save(out);\n }\n static void Load(std::istream& in, T& object) {\n object.Load(in);\n }\n};\n\ntemplate <class T>\nstatic inline void Save(std::ostream& out, const T& t);\n\ntemplate <class T>\nstatic inline void Load(std::istream& in, T& t);\n\n\ntemplate <class A, class B>\nclass TSerializer<std::pair<A, B> > {\npublic:\n static void Save(std::ostream& out, const std::pair<A, B>& object) {\n NSaveLoad::Save(out, object.first);\n NSaveLoad::Save(out, object.second);\n }\n static void Load(std::istream& in, std::pair<A, B>& object) {\n NSaveLoad::Load(in, object.first);\n NSaveLoad::Load(in, object.second);\n }\n};\n\ntemplate<std::size_t> struct int_{};\n\ntemplate <class Tuple, size_t Pos>\nvoid SaveTuple(std::ostream& out, const Tuple& tuple, int_<Pos>) {\n SaveTuple(out, tuple, int_<Pos-1>());\n NSaveLoad::Save(out, std::get<std::tuple_size<Tuple>::value-Pos>(tuple));\n}\n\ntemplate <class Tuple>\nvoid SaveTuple(std::ostream& out, const Tuple& tuple, int_<1>) {\n NSaveLoad::Save(out, std::get<std::tuple_size<Tuple>::value-1>(tuple));\n}\n\ntemplate <class Tuple, size_t Pos>\nvoid LoadTuple(std::istream& in, Tuple& tuple, int_<Pos>) {\n LoadTuple(in, tuple, int_<Pos-1>());\n NSaveLoad::Load(in, std::get<std::tuple_size<Tuple>::value-Pos>(tuple));\n}\n\ntemplate <class Tuple>\nvoid LoadTuple(std::istream& in, Tuple& tuple, int_<1>) {\n NSaveLoad::Load(in, std::get<std::tuple_size<Tuple>::value-1>(tuple));\n}\n\ntemplate <class... Args>\nclass TSerializer<std::tuple<Args...>> {\npublic:\n static void Save(std::ostream& out, const std::tuple<Args...>& object) {\n SaveTuple(out, object, int_<sizeof...(Args)>());\n }\n static void Load(std::istream& in, std::tuple<Args...>& object) {\n LoadTuple(in, object, int_<sizeof...(Args)>());\n }\n};\n\ntemplate<class TVec, class TObj>\nclass TVectorSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n for (size_t i = 0; i < size; ++i) {\n TObj obj;\n NSaveLoad::Load(in, obj);\n object.push_back(std::move(obj));\n }\n }\n};\n\ntemplate<class TVec, class TKey, class TValue>\nclass TMapSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n for (size_t i = 0; i < size; ++i) {\n std::pair<TKey, TValue> obj;\n NSaveLoad::Load(in, obj);\n object.insert(std::move(obj));\n }\n }\n};\n\ntemplate<class TVec, class TObj>\nclass TSetSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n for (size_t i = 0; i < size; ++i) {\n TObj obj;\n NSaveLoad::Load(in, obj);\n object.insert(std::move(obj));\n }\n }\n};\n\ntemplate <class T> class TSerializer<std::vector<T> >: public TVectorSerializer<std::vector<T>, T > {};\ntemplate <class T> class TSerializer<std::list<T> >: public TVectorSerializer<std::list<T>, T > {};\ntemplate <> class TSerializer<std::string>: public TVectorSerializer<std::string, char> {};\ntemplate <> class TSerializer<std::wstring>: public TVectorSerializer<std::wstring, wchar_t> {};\ntemplate <class K, class V> class TSerializer<std::map<K, V> >: public TMapSerializer<std::map<K, V>, K, V > {};\ntemplate <class K, class V, class H> class TSerializer<std::unordered_map<K, V, H> >: public TMapSerializer<std::unordered_map<K, V, H>, K, V > {};\ntemplate <class T> class TSerializer<std::set<T> >: public TSetSerializer<std::set<T>, T > {};\ntemplate <class T> class TSerializer<std::unordered_set<T> >: public TSetSerializer<std::unordered_set<T>, T > {};\n\ntemplate <class T>\nclass TPodSerializer {\npublic:\n static inline void Save(std::ostream& out, const T& object) {\n out.write((const char*)(&object), sizeof(T));\n }\n static inline void Load(std::istream& in, T& object) {\n in.read((char*)(&object), sizeof(T));\n }\n};\n\ntemplate<class T>\nclass TSerializer<T, typename std::enable_if<!std::is_class<T>::value>::type>: public TPodSerializer<T> {};\n\ntemplate <class T>\nstatic inline void Save(std::ostream& out, const T& t) {\n TSerializer<T>::Save(out, t);\n}\n\ntemplate<class T, class... Args>\nstatic inline void Save(std::ostream& out, T first, Args... args) {\n NSaveLoad::Save(out, first);\n NSaveLoad::Save(out, args...);\n}\n\ntemplate <class T>\nstatic inline void Load(std::istream& in, T& t) {\n TSerializer<T>::Load(in, t);\n}\n\ntemplate <class T, class... Args>\nstatic inline void Load(std::istream& in, T& first, Args&... args) {\n NSaveLoad::Load(in, first);\n NSaveLoad::Load(in, args...);\n}\n\n#define SAVELOAD(...) \\\n inline virtual void Save(std::ostream& out) const { \\\n NSaveLoad::Save(out, __VA_ARGS__); \\\n } \\\n \\\n inline virtual void Load(std::istream& in) { \\\n NSaveLoad::Load(in, __VA_ARGS__); \\\n }\n\n\nstruct membuf: std::streambuf {\n membuf(char const* base, size_t size) {\n char* p(const_cast<char*>(base));\n this->setg(p, p, p + size);\n }\n};\nstruct imemstream: virtual membuf, std::istream {\n imemstream(char const* base, size_t size)\n : membuf(base, size)\n , std::istream(static_cast<std::streambuf*>(this)) {\n }\n};\n\n#define SAVELOAD_POD(TypeName) template <> class TSerializer<TypeName>: public TPodSerializer<TypeName> {};\n\n} \/\/ NSaveLoad\n<commit_msg>Added reserve call to vector and unordered_map<commit_after>#pragma once\n\n#include <string>\n#include <vector>\n#include <list>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <utility>\n#include <iostream>\n#include <streambuf>\n#include <tuple>\n\nnamespace NSaveLoad {\n\ntemplate<class T, typename E = void>\nclass TSerializer {\npublic:\n static void Save(std::ostream& out, const T& object) {\n object.Save(out);\n }\n static void Load(std::istream& in, T& object) {\n object.Load(in);\n }\n};\n\ntemplate <class T>\nstatic inline void Save(std::ostream& out, const T& t);\n\ntemplate <class T>\nstatic inline void Load(std::istream& in, T& t);\n\n\ntemplate <class A, class B>\nclass TSerializer<std::pair<A, B> > {\npublic:\n static void Save(std::ostream& out, const std::pair<A, B>& object) {\n NSaveLoad::Save(out, object.first);\n NSaveLoad::Save(out, object.second);\n }\n static void Load(std::istream& in, std::pair<A, B>& object) {\n NSaveLoad::Load(in, object.first);\n NSaveLoad::Load(in, object.second);\n }\n};\n\ntemplate<std::size_t> struct int_{};\n\ntemplate <class Tuple, size_t Pos>\nvoid SaveTuple(std::ostream& out, const Tuple& tuple, int_<Pos>) {\n SaveTuple(out, tuple, int_<Pos-1>());\n NSaveLoad::Save(out, std::get<std::tuple_size<Tuple>::value-Pos>(tuple));\n}\n\ntemplate <class Tuple>\nvoid SaveTuple(std::ostream& out, const Tuple& tuple, int_<1>) {\n NSaveLoad::Save(out, std::get<std::tuple_size<Tuple>::value-1>(tuple));\n}\n\ntemplate <class Tuple, size_t Pos>\nvoid LoadTuple(std::istream& in, Tuple& tuple, int_<Pos>) {\n LoadTuple(in, tuple, int_<Pos-1>());\n NSaveLoad::Load(in, std::get<std::tuple_size<Tuple>::value-Pos>(tuple));\n}\n\ntemplate <class Tuple>\nvoid LoadTuple(std::istream& in, Tuple& tuple, int_<1>) {\n NSaveLoad::Load(in, std::get<std::tuple_size<Tuple>::value-1>(tuple));\n}\n\ntemplate <class... Args>\nclass TSerializer<std::tuple<Args...>> {\npublic:\n static void Save(std::ostream& out, const std::tuple<Args...>& object) {\n SaveTuple(out, object, int_<sizeof...(Args)>());\n }\n static void Load(std::istream& in, std::tuple<Args...>& object) {\n LoadTuple(in, object, int_<sizeof...(Args)>());\n }\n};\n\ntemplate<class TVec, class TObj>\nclass TVectorSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n object.reserve(size);\n for (size_t i = 0; i < size; ++i) {\n TObj obj;\n NSaveLoad::Load(in, obj);\n object.push_back(std::move(obj));\n }\n }\n};\n\ntemplate<class TVec, class TKey, class TValue>\nclass TMapSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n for (size_t i = 0; i < size; ++i) {\n std::pair<TKey, TValue> obj;\n NSaveLoad::Load(in, obj);\n object.insert(std::move(obj));\n }\n }\n};\n\ntemplate<class TVec, class TKey, class TValue>\nclass TUnorderedMapSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n object.reserve(size);\n for (size_t i = 0; i < size; ++i) {\n std::pair<TKey, TValue> obj;\n NSaveLoad::Load(in, obj);\n object.insert(std::move(obj));\n }\n }\n};\n\ntemplate<class TVec, class TObj>\nclass TSetSerializer {\npublic:\n static inline void Save(std::ostream& out, const TVec& object) {\n uint32_t size = object.size();\n out.write((const char*)(&size), sizeof(size));\n for (const auto& obj: object) {\n NSaveLoad::Save(out, obj);\n }\n }\n\n static inline void Load(std::istream& in, TVec& object) {\n uint32_t size;\n in.read((char*)(&size), sizeof(size));\n object.clear();\n for (size_t i = 0; i < size; ++i) {\n TObj obj;\n NSaveLoad::Load(in, obj);\n object.insert(std::move(obj));\n }\n }\n};\n\ntemplate <class T> class TSerializer<std::vector<T> >: public TVectorSerializer<std::vector<T>, T > {};\ntemplate <class T> class TSerializer<std::list<T> >: public TVectorSerializer<std::list<T>, T > {};\ntemplate <> class TSerializer<std::string>: public TVectorSerializer<std::string, char> {};\ntemplate <> class TSerializer<std::wstring>: public TVectorSerializer<std::wstring, wchar_t> {};\ntemplate <class K, class V> class TSerializer<std::map<K, V> >: public TMapSerializer<std::map<K, V>, K, V > {};\ntemplate <class K, class V, class H> class TSerializer<std::unordered_map<K, V, H> >: public TUnorderedMapSerializer<std::unordered_map<K, V, H>, K, V > {};\ntemplate <class T> class TSerializer<std::set<T> >: public TSetSerializer<std::set<T>, T > {};\ntemplate <class T> class TSerializer<std::unordered_set<T> >: public TSetSerializer<std::unordered_set<T>, T > {};\n\ntemplate <class T>\nclass TPodSerializer {\npublic:\n static inline void Save(std::ostream& out, const T& object) {\n out.write((const char*)(&object), sizeof(T));\n }\n static inline void Load(std::istream& in, T& object) {\n in.read((char*)(&object), sizeof(T));\n }\n};\n\ntemplate<class T>\nclass TSerializer<T, typename std::enable_if<!std::is_class<T>::value>::type>: public TPodSerializer<T> {};\n\ntemplate <class T>\nstatic inline void Save(std::ostream& out, const T& t) {\n TSerializer<T>::Save(out, t);\n}\n\ntemplate<class T, class... Args>\nstatic inline void Save(std::ostream& out, T first, Args... args) {\n NSaveLoad::Save(out, first);\n NSaveLoad::Save(out, args...);\n}\n\ntemplate <class T>\nstatic inline void Load(std::istream& in, T& t) {\n TSerializer<T>::Load(in, t);\n}\n\ntemplate <class T, class... Args>\nstatic inline void Load(std::istream& in, T& first, Args&... args) {\n NSaveLoad::Load(in, first);\n NSaveLoad::Load(in, args...);\n}\n\n#define SAVELOAD(...) \\\n inline virtual void Save(std::ostream& out) const { \\\n NSaveLoad::Save(out, __VA_ARGS__); \\\n } \\\n \\\n inline virtual void Load(std::istream& in) { \\\n NSaveLoad::Load(in, __VA_ARGS__); \\\n }\n\n\nstruct membuf: std::streambuf {\n membuf(char const* base, size_t size) {\n char* p(const_cast<char*>(base));\n this->setg(p, p, p + size);\n }\n};\nstruct imemstream: virtual membuf, std::istream {\n imemstream(char const* base, size_t size)\n : membuf(base, size)\n , std::istream(static_cast<std::streambuf*>(this)) {\n }\n};\n\n#define SAVELOAD_POD(TypeName) template <> class TSerializer<TypeName>: public TPodSerializer<TypeName> {};\n\n} \/\/ NSaveLoad\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <typeinfo>\n#include <typeindex>\n#include <memory>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#if 0\nclass object_t\n{\n public:\n virtual ~object_t() {}\n virtual void draw(ostream&, size_t) const = 0;\n};\n\nusing document_t = vector<shared_ptr<object_t>>;\n\nvoid draw(const document_t& x, ostream& out, size_t position)\n{\n out << string(position, ' ') << \"<document>\" << endl;\n for (const auto& e : x )\n e->draw(out, position + 2);\n out << string(position, ' ') << \"<\/document>\" << endl;\n}\n\nclass my_class_t : public object_t\n{\n public:\n void draw(ostream &out, size_t position) const\n {\n out << string(position, ' ') << \"my_class_t\" << endl;\n }\n};\n\nint main(int argc, char * argv[])\n{\n document_t document;\n document.emplace_back(new my_class_t{});\n draw(document,cout, 1);\n return 0;\n}\n#else\nclass object_t\n{\n public:\n template<typename T> \n object_t(T x) : self_(make_shared<model<T>>(move(x))) {}\n void draw(ostream& out, size_t position) const\n {\n self_->draw_(out,position);\n }\n\n private:\n struct concept_t\n {\n virtual ~concept_t() = default;\n virtual void draw_(ostream&, size_t) const = 0;\n };\n\n template<typename T>\n struct model : concept_t\n {\n model(T x) : data_(move(x)) {}\n void draw_(ostream& out, size_t position) const\n {\n data_.draw(out,position);\n }\n T data_;\n };\n\n shared_ptr<const concept_t> self_;\n};\n\nusing document_t = vector<object_t>;\n\nvoid draw(const document_t& x, ostream& out, size_t position)\n{\n out << string(position, ' ') << \"<document>\" << endl;\n for (const auto& e : x )\n e.draw(out, position + 2);\n out << string(position, ' ') << \"<\/document>\" << endl;\n}\n\nclass my_class_t\n{\n public:\n void draw(ostream& out, size_t position) const\n {\n out << string(position, ' ') << \"my_class_t\" << endl;\n }\n};\n\nint main()\n{\n document_t document;\n document.emplace_back(my_class_t{});\n draw(document,cout,0);\n}\n#endif\n<commit_msg>added few more classes<commit_after>#include <iostream>\n#include <string>\n#include <typeinfo>\n#include <typeindex>\n#include <memory>\n#include <string>\n#include <vector>\n\nusing namespace std;\n\n#if 0\nclass object_t\n{\n public:\n virtual ~object_t() {}\n virtual void draw(ostream&, size_t) const = 0;\n};\n\nusing document_t = vector<shared_ptr<object_t>>;\n\nvoid draw(const document_t& x, ostream& out, size_t position)\n{\n out << string(position, ' ') << \"<document>\" << endl;\n for (const auto& e : x )\n e->draw(out, position + 2);\n out << string(position, ' ') << \"<\/document>\" << endl;\n}\n\nclass my_class_t : public object_t\n{\n public:\n void draw(ostream &out, size_t position) const\n {\n out << string(position, ' ') << \"my_class_t\" << endl;\n }\n};\n\nint main(int argc, char * argv[])\n{\n document_t document;\n document.emplace_back(new my_class_t{});\n draw(document,cout, 1);\n return 0;\n}\n#else\nclass object_t\n{\n public:\n template<typename T> \n object_t(T x) : self_(make_shared<model<T>>(move(x))) {}\n void draw(ostream& out, size_t position) const\n {\n self_->draw_(out,position);\n }\n\n private:\n struct concept_t\n {\n virtual ~concept_t() = default;\n virtual void draw_(ostream&, size_t) const = 0;\n };\n\n template<typename T>\n struct model : concept_t\n {\n model(T x) : data_(move(x)) {}\n void draw_(ostream& out, size_t position) const\n {\n data_.draw(out,position);\n }\n T data_;\n };\n\n shared_ptr<const concept_t> self_;\n};\n\nusing document_t = vector<object_t>;\n\nvoid draw(const document_t& x, ostream& out, size_t position)\n{\n out << string(position, ' ') << \"<document>\" << endl;\n for (const auto& e : x )\n e.draw(out, position + 2);\n out << string(position, ' ') << \"<\/document>\" << endl;\n}\n\nclass my_class_t\n{\n public:\n void draw(ostream& out, size_t position) const\n {\n out << string(position, ' ') << \"my_class_t\" << endl;\n }\n};\n\nclass book_t\n{\n public:\n string name;\n void draw(ostream& out, size_t position) const\n {\n out << string(position, ' ') << \"book_t{\" << name << \"}\" << endl;\n }\n};\nclass name_t\n{\n public:\n string name;\n void draw(ostream& out, size_t position) const\n {\n out << string(position, ' ') << \"name_t{\" << name << \"}\" << endl;\n }\n};\n\nint main()\n{\n document_t document;\n document.emplace_back(my_class_t{});\n document.emplace_back(book_t{\"book1\"});\n document.emplace_back(name_t{\"name1\"});\n document.emplace_back(book_t{\"book2\"});\n document.emplace_back(name_t{\"name2\"});\n document.emplace_back(my_class_t{});\n draw(document,cout,0);\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"factory.h\"\n#include \"except.h\"\n#include \"iobservable.h\"\n#include \"gil.h\"\n#ifdef USE_OPENCV\n#include \"opencv_video_source.h\"\n#include \"opencv_video_target.h\"\n#endif \/\/ USE_OPENCV\n#ifdef USE_EPIPHANSDK\n#include \"epiphansdk_video_source.h\"\n#endif\n#ifdef USE_LIBVLC\n#include \"vlc_video_source.h\"\n#endif\n#ifdef USE_FFMPEG\n#include \"ffmpeg_video_target.h\"\n#endif\n#include <boost\/python.hpp>\n#include <boost\/python\/exception_translator.hpp>\n\nusing namespace boost::python;\n\nclass IObservableWrapper : public gg::IObservable, public wrapper<gg::IObservable>\n{\npublic:\n void attach(gg::IObserver & observer)\n {\n if (override f = this->get_override(\"attach\"))\n f(boost::ref(observer));\n else\n gg::IObservable::attach(boost::ref(observer));\n }\n\n void default_attach(gg::IObserver & observer)\n {\n gg::IObservable::attach(observer);\n }\n\n void detach(gg::IObserver & observer)\n {\n if (override f = this->get_override(\"detach\"))\n f(boost::ref(observer));\n else\n gg::IObservable::detach(boost::ref(observer));\n }\n\n void default_detach(gg::IObserver & observer)\n {\n gg::IObservable::detach(boost::ref(observer));\n }\n};\n\nclass IVideoSourceWrapper : IVideoSource, wrapper<IVideoSource>\n{\n bool get_frame_dimensions(int & width, int & height)\n {\n return this->get_override(\"get_frame_dimensions\")(width, height);\n }\n\n bool get_frame(gg::VideoFrame & frame)\n {\n return this->get_override(\"get_frame\")(frame);\n }\n\n double get_frame_rate()\n {\n return this->get_override(\"get_frame_rate\")();\n }\n\n void set_sub_frame(int x, int y, int width, int height)\n {\n this->get_override(\"set_sub_frame\")(x, y, width, height);\n }\n\n void get_full_frame()\n {\n this->get_override(\"get_full_frame\")();\n }\n};\n\n\/* The inheritance should be public, in order to preserve\n * the public accessibility of the update() method. The\n * Boost.Python examples feature struct's rather than\n * classes, and in struct's everything is public by\n * definition.\n *\/\nclass IObserverWrapper : public gg::IObserver, public wrapper<gg::IObserver>\n{\npublic:\n IObserverWrapper()\n {\n \/* Default constructor that needs to be called within\n * child Python class, e.g. super(Child, self).__init__()\n * This is normally generated by the compiler\n * automatically, but we define it here explicitly so\n * that it can serve as an example for this complex case.\n *\/\n }\n\n void update(gg::VideoFrame & frame)\n {\n gg::ScopedPythonGILLock gil_lock;\n this->get_override(\"update\")(boost::ref(frame));\n }\n};\n\nclass IVideoTargetWrapper : gg::IVideoTarget, wrapper<gg::IVideoTarget>\n{\n void init(const std::string filepath, const float framerate)\n {\n this->get_override(\"init\")(filepath, framerate);\n }\n\n void append(const gg::VideoFrame & frame)\n {\n this->get_override(\"append\")(frame);\n }\n\n void finalise()\n {\n this->get_override(\"finalise\")();\n }\n};\n\nvoid translate_VideoSourceError(gg::VideoSourceError const & e)\n{\n std::string msg;\n msg.append(\"VideoSourceError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nvoid translate_DeviceNotFound(gg::DeviceNotFound const & e)\n{\n std::string msg;\n msg.append(\"DeviceNotFound: \").append(e.what());\n PyErr_SetString(PyExc_IOError, msg.c_str());\n}\n\nvoid translate_DeviceOffline(gg::DeviceOffline const & e)\n{\n std::string msg;\n msg.append(\"DeviceOffline: \").append(e.what());\n PyErr_SetString(PyExc_IOError, msg.c_str());\n}\n\nvoid translate_VideoTargetError(gg::VideoTargetError const & e)\n{\n std::string msg;\n msg.append(\"VideoTargetError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nvoid translate_ObserverError(gg::ObserverError const & e)\n{\n std::string msg;\n msg.append(\"ObserverError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nBOOST_PYTHON_MODULE(pygiftgrab)\n{\n PyEval_InitThreads();\n\n register_exception_translator<gg::VideoSourceError>(&translate_VideoSourceError);\n register_exception_translator<gg::DeviceNotFound>(&translate_DeviceNotFound);\n register_exception_translator<gg::DeviceOffline>(&translate_DeviceOffline);\n register_exception_translator<gg::VideoTargetError>(&translate_VideoTargetError);\n register_exception_translator<gg::ObserverError>(&translate_ObserverError);\n\n enum_<gg::ColourSpace>(\"ColourSpace\")\n .value(\"BGRA\", gg::ColourSpace::BGRA)\n .value(\"I420\", gg::ColourSpace::I420)\n ;\n\n enum_<gg::Device>(\"Device\")\n .value(\"DVI2PCIeDuo_SDI\", gg::Device::DVI2PCIeDuo_SDI)\n .value(\"DVI2PCIeDuo_DVI\", gg::Device::DVI2PCIeDuo_DVI)\n ;\n\n enum_<gg::Storage>(\"Storage\")\n .value(\"File_HEVC\", gg::Storage::File_HEVC)\n .value(\"File_XviD\", gg::Storage::File_XviD)\n .value(\"File_VP9\", gg::Storage::File_VP9)\n ;\n\n class_<gg::VideoFrame>(\"VideoFrame\", init<enum gg::ColourSpace, bool>())\n .def(init<enum gg::ColourSpace, const size_t, const size_t>())\n .def(\"rows\", &gg::VideoFrame::rows)\n .def(\"cols\", &gg::VideoFrame::cols)\n ;\n\n class_<IObservableWrapper,boost::noncopyable>(\"IObservable\", no_init)\n .def(\"attach\", &IObservableWrapper::attach)\n .def(\"detach\", &IObservableWrapper::detach)\n ;\n\n class_<IVideoSource, bases<gg::IObservable>, boost::noncopyable>(\n \"IVideoSource\", no_init)\n ;\n\n#ifdef USE_OPENCV\n class_<VideoSourceOpenCV, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceOpenCV\", init<int>())\n .def(init<char *>())\n .def(\"get_frame\", &VideoSourceOpenCV::get_frame)\n .def(\"get_frame_dimensions\", &VideoSourceOpenCV::get_frame_dimensions)\n .def(\"get_frame_rate\", &VideoSourceOpenCV::get_frame_rate)\n .def(\"set_sub_frame\", &VideoSourceOpenCV::set_sub_frame)\n .def(\"get_full_frame\", &VideoSourceOpenCV::get_full_frame)\n .def(\"attach\", &gg::IObservable::attach, &IObservableWrapper::default_attach)\n .def(\"detach\", &gg::IObservable::detach, &IObservableWrapper::default_detach)\n ;\n#endif \/\/ USE_OPENCV\n\n#ifdef USE_EPIPHANSDK\n class_<gg::VideoSourceEpiphanSDK, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceEpiphanSDK\", init<const std::string, const V2U_INT32>())\n .def(\"get_frame\", &gg::VideoSourceEpiphanSDK::get_frame)\n .def(\"get_frame_dimensions\", &gg::VideoSourceEpiphanSDK::get_frame_dimensions)\n .def(\"get_frame_rate\", &gg::VideoSourceEpiphanSDK::get_frame_rate)\n .def(\"set_sub_frame\", &gg::VideoSourceEpiphanSDK::set_sub_frame)\n .def(\"get_full_frame\", &gg::VideoSourceEpiphanSDK::get_full_frame)\n ;\n#endif\n\n#ifdef USE_LIBVLC\n class_<gg::VideoSourceVLC, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceVLC\", init<const std::string>())\n .def(\"get_frame\", &gg::VideoSourceVLC::get_frame)\n .def(\"get_frame_dimensions\", &gg::VideoSourceVLC::get_frame_dimensions)\n .def(\"get_frame_rate\", &gg::VideoSourceVLC::get_frame_rate)\n .def(\"set_sub_frame\", &gg::VideoSourceVLC::set_sub_frame)\n .def(\"get_full_frame\", &gg::VideoSourceVLC::get_full_frame)\n ;\n#endif\n\n class_<IObserverWrapper, boost::noncopyable>(\"IObserver\")\n .def(\"update\", pure_virtual(&gg::IObserver::update))\n ;\n\n class_<gg::IVideoTarget, bases<gg::IObserver>, boost::noncopyable>(\n \"IVideoTarget\", no_init)\n .def(\"update\", &gg::IVideoTarget::update)\n ;\n\n#ifdef USE_FFMPEG\n class_<gg::VideoTargetFFmpeg, bases<gg::IVideoTarget>, boost::noncopyable>(\n \"VideoTargetFFmpeg\", init<std::string>())\n .def(\"init\", &gg::VideoTargetFFmpeg::init)\n .def(\"append\", &gg::VideoTargetFFmpeg::append)\n .def(\"finalise\", &gg::VideoTargetFFmpeg::finalise)\n ;\n#endif\n\n#ifdef USE_OPENCV\n class_<gg::VideoTargetOpenCV, bases<gg::IVideoTarget>, boost::noncopyable>(\n \"VideoTargetOpenCV\", init<std::string>())\n .def(\"init\", &gg::VideoTargetOpenCV::init)\n .def(\"append\", &gg::VideoTargetOpenCV::append)\n .def(\"finalise\", &gg::VideoTargetOpenCV::finalise)\n ;\n#endif \/\/ USE_OPENCV\n\n class_<gg::Factory>(\"Factory\", no_init)\n .def(\"connect\", &gg::Factory::connect,\n \/* because client should never delete returned\n * object on its own, but should rather call\n * disconnect when done\n *\/\n return_value_policy<reference_existing_object>())\n .staticmethod(\"connect\")\n .def(\"disconnect\", &gg::Factory::disconnect)\n .staticmethod(\"disconnect\")\n .def(\"writer\", &gg::Factory::writer,\n \/\/ because ownership is passed to client\n return_value_policy<manage_new_object>())\n .staticmethod(\"writer\")\n ;\n}\n<commit_msg>Issue #86: attach and detach exposed for VLC video source as well in wrapper<commit_after>#include \"factory.h\"\n#include \"except.h\"\n#include \"iobservable.h\"\n#include \"gil.h\"\n#ifdef USE_OPENCV\n#include \"opencv_video_source.h\"\n#include \"opencv_video_target.h\"\n#endif \/\/ USE_OPENCV\n#ifdef USE_EPIPHANSDK\n#include \"epiphansdk_video_source.h\"\n#endif\n#ifdef USE_LIBVLC\n#include \"vlc_video_source.h\"\n#endif\n#ifdef USE_FFMPEG\n#include \"ffmpeg_video_target.h\"\n#endif\n#include <boost\/python.hpp>\n#include <boost\/python\/exception_translator.hpp>\n\nusing namespace boost::python;\n\nclass IObservableWrapper : public gg::IObservable, public wrapper<gg::IObservable>\n{\npublic:\n void attach(gg::IObserver & observer)\n {\n if (override f = this->get_override(\"attach\"))\n f(boost::ref(observer));\n else\n gg::IObservable::attach(boost::ref(observer));\n }\n\n void default_attach(gg::IObserver & observer)\n {\n gg::IObservable::attach(observer);\n }\n\n void detach(gg::IObserver & observer)\n {\n if (override f = this->get_override(\"detach\"))\n f(boost::ref(observer));\n else\n gg::IObservable::detach(boost::ref(observer));\n }\n\n void default_detach(gg::IObserver & observer)\n {\n gg::IObservable::detach(boost::ref(observer));\n }\n};\n\nclass IVideoSourceWrapper : IVideoSource, wrapper<IVideoSource>\n{\n bool get_frame_dimensions(int & width, int & height)\n {\n return this->get_override(\"get_frame_dimensions\")(width, height);\n }\n\n bool get_frame(gg::VideoFrame & frame)\n {\n return this->get_override(\"get_frame\")(frame);\n }\n\n double get_frame_rate()\n {\n return this->get_override(\"get_frame_rate\")();\n }\n\n void set_sub_frame(int x, int y, int width, int height)\n {\n this->get_override(\"set_sub_frame\")(x, y, width, height);\n }\n\n void get_full_frame()\n {\n this->get_override(\"get_full_frame\")();\n }\n};\n\n\/* The inheritance should be public, in order to preserve\n * the public accessibility of the update() method. The\n * Boost.Python examples feature struct's rather than\n * classes, and in struct's everything is public by\n * definition.\n *\/\nclass IObserverWrapper : public gg::IObserver, public wrapper<gg::IObserver>\n{\npublic:\n IObserverWrapper()\n {\n \/* Default constructor that needs to be called within\n * child Python class, e.g. super(Child, self).__init__()\n * This is normally generated by the compiler\n * automatically, but we define it here explicitly so\n * that it can serve as an example for this complex case.\n *\/\n }\n\n void update(gg::VideoFrame & frame)\n {\n gg::ScopedPythonGILLock gil_lock;\n this->get_override(\"update\")(boost::ref(frame));\n }\n};\n\nclass IVideoTargetWrapper : gg::IVideoTarget, wrapper<gg::IVideoTarget>\n{\n void init(const std::string filepath, const float framerate)\n {\n this->get_override(\"init\")(filepath, framerate);\n }\n\n void append(const gg::VideoFrame & frame)\n {\n this->get_override(\"append\")(frame);\n }\n\n void finalise()\n {\n this->get_override(\"finalise\")();\n }\n};\n\nvoid translate_VideoSourceError(gg::VideoSourceError const & e)\n{\n std::string msg;\n msg.append(\"VideoSourceError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nvoid translate_DeviceNotFound(gg::DeviceNotFound const & e)\n{\n std::string msg;\n msg.append(\"DeviceNotFound: \").append(e.what());\n PyErr_SetString(PyExc_IOError, msg.c_str());\n}\n\nvoid translate_DeviceOffline(gg::DeviceOffline const & e)\n{\n std::string msg;\n msg.append(\"DeviceOffline: \").append(e.what());\n PyErr_SetString(PyExc_IOError, msg.c_str());\n}\n\nvoid translate_VideoTargetError(gg::VideoTargetError const & e)\n{\n std::string msg;\n msg.append(\"VideoTargetError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nvoid translate_ObserverError(gg::ObserverError const & e)\n{\n std::string msg;\n msg.append(\"ObserverError: \").append(e.what());\n PyErr_SetString(PyExc_RuntimeError, msg.c_str());\n}\n\nBOOST_PYTHON_MODULE(pygiftgrab)\n{\n PyEval_InitThreads();\n\n register_exception_translator<gg::VideoSourceError>(&translate_VideoSourceError);\n register_exception_translator<gg::DeviceNotFound>(&translate_DeviceNotFound);\n register_exception_translator<gg::DeviceOffline>(&translate_DeviceOffline);\n register_exception_translator<gg::VideoTargetError>(&translate_VideoTargetError);\n register_exception_translator<gg::ObserverError>(&translate_ObserverError);\n\n enum_<gg::ColourSpace>(\"ColourSpace\")\n .value(\"BGRA\", gg::ColourSpace::BGRA)\n .value(\"I420\", gg::ColourSpace::I420)\n ;\n\n enum_<gg::Device>(\"Device\")\n .value(\"DVI2PCIeDuo_SDI\", gg::Device::DVI2PCIeDuo_SDI)\n .value(\"DVI2PCIeDuo_DVI\", gg::Device::DVI2PCIeDuo_DVI)\n ;\n\n enum_<gg::Storage>(\"Storage\")\n .value(\"File_HEVC\", gg::Storage::File_HEVC)\n .value(\"File_XviD\", gg::Storage::File_XviD)\n .value(\"File_VP9\", gg::Storage::File_VP9)\n ;\n\n class_<gg::VideoFrame>(\"VideoFrame\", init<enum gg::ColourSpace, bool>())\n .def(init<enum gg::ColourSpace, const size_t, const size_t>())\n .def(\"rows\", &gg::VideoFrame::rows)\n .def(\"cols\", &gg::VideoFrame::cols)\n ;\n\n class_<IObservableWrapper,boost::noncopyable>(\"IObservable\", no_init)\n .def(\"attach\", &IObservableWrapper::attach)\n .def(\"detach\", &IObservableWrapper::detach)\n ;\n\n class_<IVideoSource, bases<gg::IObservable>, boost::noncopyable>(\n \"IVideoSource\", no_init)\n ;\n\n#ifdef USE_OPENCV\n class_<VideoSourceOpenCV, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceOpenCV\", init<int>())\n .def(init<char *>())\n .def(\"get_frame\", &VideoSourceOpenCV::get_frame)\n .def(\"get_frame_dimensions\", &VideoSourceOpenCV::get_frame_dimensions)\n .def(\"get_frame_rate\", &VideoSourceOpenCV::get_frame_rate)\n .def(\"set_sub_frame\", &VideoSourceOpenCV::set_sub_frame)\n .def(\"get_full_frame\", &VideoSourceOpenCV::get_full_frame)\n .def(\"attach\", &gg::IObservable::attach, &IObservableWrapper::default_attach)\n .def(\"detach\", &gg::IObservable::detach, &IObservableWrapper::default_detach)\n ;\n#endif \/\/ USE_OPENCV\n\n#ifdef USE_EPIPHANSDK\n class_<gg::VideoSourceEpiphanSDK, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceEpiphanSDK\", init<const std::string, const V2U_INT32>())\n .def(\"get_frame\", &gg::VideoSourceEpiphanSDK::get_frame)\n .def(\"get_frame_dimensions\", &gg::VideoSourceEpiphanSDK::get_frame_dimensions)\n .def(\"get_frame_rate\", &gg::VideoSourceEpiphanSDK::get_frame_rate)\n .def(\"set_sub_frame\", &gg::VideoSourceEpiphanSDK::set_sub_frame)\n .def(\"get_full_frame\", &gg::VideoSourceEpiphanSDK::get_full_frame)\n ;\n#endif\n\n#ifdef USE_LIBVLC\n class_<gg::VideoSourceVLC, bases<IVideoSource>, boost::noncopyable>(\n \"VideoSourceVLC\", init<const std::string>())\n .def(\"get_frame\", &gg::VideoSourceVLC::get_frame)\n .def(\"get_frame_dimensions\", &gg::VideoSourceVLC::get_frame_dimensions)\n .def(\"get_frame_rate\", &gg::VideoSourceVLC::get_frame_rate)\n .def(\"set_sub_frame\", &gg::VideoSourceVLC::set_sub_frame)\n .def(\"get_full_frame\", &gg::VideoSourceVLC::get_full_frame)\n .def(\"attach\", &gg::IObservable::attach, &IObservableWrapper::default_attach)\n .def(\"detach\", &gg::IObservable::detach, &IObservableWrapper::default_detach)\n ;\n#endif\n\n class_<IObserverWrapper, boost::noncopyable>(\"IObserver\")\n .def(\"update\", pure_virtual(&gg::IObserver::update))\n ;\n\n class_<gg::IVideoTarget, bases<gg::IObserver>, boost::noncopyable>(\n \"IVideoTarget\", no_init)\n .def(\"update\", &gg::IVideoTarget::update)\n ;\n\n#ifdef USE_FFMPEG\n class_<gg::VideoTargetFFmpeg, bases<gg::IVideoTarget>, boost::noncopyable>(\n \"VideoTargetFFmpeg\", init<std::string>())\n .def(\"init\", &gg::VideoTargetFFmpeg::init)\n .def(\"append\", &gg::VideoTargetFFmpeg::append)\n .def(\"finalise\", &gg::VideoTargetFFmpeg::finalise)\n ;\n#endif\n\n#ifdef USE_OPENCV\n class_<gg::VideoTargetOpenCV, bases<gg::IVideoTarget>, boost::noncopyable>(\n \"VideoTargetOpenCV\", init<std::string>())\n .def(\"init\", &gg::VideoTargetOpenCV::init)\n .def(\"append\", &gg::VideoTargetOpenCV::append)\n .def(\"finalise\", &gg::VideoTargetOpenCV::finalise)\n ;\n#endif \/\/ USE_OPENCV\n\n class_<gg::Factory>(\"Factory\", no_init)\n .def(\"connect\", &gg::Factory::connect,\n \/* because client should never delete returned\n * object on its own, but should rather call\n * disconnect when done\n *\/\n return_value_policy<reference_existing_object>())\n .staticmethod(\"connect\")\n .def(\"disconnect\", &gg::Factory::disconnect)\n .staticmethod(\"disconnect\")\n .def(\"writer\", &gg::Factory::writer,\n \/\/ because ownership is passed to client\n return_value_policy<manage_new_object>())\n .staticmethod(\"writer\")\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"cpptoolsplugin.h\"\n\n#include \"cppclassesfilter.h\"\n#include \"cppcurrentdocumentfilter.h\"\n#include \"cppfunctionsfilter.h\"\n#include \"cpplocatorfilter.h\"\n#include \"cppmodelmanager.h\"\n\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <coreplugin\/testdatadir.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <locator\/locatorfiltertest.h>\n#include <utils\/fileutils.h>\n\n#include <QDebug>\n#include <QFileInfo>\n#include <QtTest>\n\nusing namespace Core;\nusing namespace Core::Internal::Tests;\nusing namespace CppTools::Internal;\nusing namespace ExtensionSystem;\nusing namespace Locator;\nusing namespace Locator::Internal;\nusing namespace Locator::Internal::Tests;\nusing namespace Utils;\n\nQ_DECLARE_METATYPE(ILocatorFilter *)\n\nnamespace {\n\nclass MyTestDataDir : public Core::Internal::Tests::TestDataDir\n{\npublic:\n MyTestDataDir(const QString &testDataDirectory)\n : TestDataDir(QLatin1String(SRCDIR \"\/..\/..\/..\/tests\/cpplocators\/\") + testDataDirectory) {}\n};\n\nclass CppLocatorFilterTest : public BasicLocatorFilterTest\n{\npublic:\n CppLocatorFilterTest(ILocatorFilter *filter, const QString &fileName)\n : BasicLocatorFilterTest(filter)\n , m_modelManager(CppModelManager::instance())\n , m_fileName(fileName)\n {\n QVERIFY(!m_fileName.isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n virtual void doBeforeLocatorRun()\n {\n m_modelManager->updateSourceFiles(QStringList() << m_fileName).waitForFinished();\n QVERIFY(m_modelManager->snapshot().contains(m_fileName));\n QCoreApplication::processEvents();\n }\n\n virtual void doAfterLocatorRun()\n {\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\n CppModelManager *m_modelManager;\n const QString m_fileName;\n};\n\nclass CppCurrentDocumentFilterTest : public BasicLocatorFilterTest\n{\npublic:\n CppCurrentDocumentFilterTest(const QString &fileName)\n : BasicLocatorFilterTest(PluginManager::getObject<CppCurrentDocumentFilter>())\n , m_modelManager(CppModelManager::instance())\n , m_editor(0)\n , m_fileName(fileName)\n {\n QVERIFY(!m_fileName.isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n virtual void doBeforeLocatorRun()\n {\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n\n m_editor = EditorManager::openEditor(m_fileName);\n QVERIFY(m_editor);\n while (!m_modelManager->snapshot().contains(m_fileName))\n QCoreApplication::processEvents();\n }\n\n virtual void doAfterLocatorRun()\n {\n EditorManager::instance()->closeEditor(m_editor, \/*askAboutModifiedEditors=*\/ false);\n QCoreApplication::processEvents();\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\n CppModelManager *m_modelManager;\n IEditor *m_editor;\n const QString m_fileName;\n};\n\ninline QString _(const QByteArray &ba) { return QString::fromLatin1(ba, ba.size()); }\n\n} \/\/ anonymous namespace\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppLocatorFilter()\n{\n QFETCH(QString, testFile);\n QFETCH(ILocatorFilter *, filter);\n QFETCH(QString, searchText);\n QFETCH(ResultDataList, expectedResults);\n\n CppLocatorFilterTest test(filter, testFile);\n ResultDataList results = ResultData::fromFilterEntryList(test.matchesFor(searchText));\n\/\/ ResultData::printFilterEntries(results);\n QVERIFY(!results.isEmpty());\n QCOMPARE(expectedResults, results);\n}\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppLocatorFilter_data()\n{\n QTest::addColumn<QString>(\"testFile\");\n QTest::addColumn<ILocatorFilter *>(\"filter\");\n QTest::addColumn<QString>(\"searchText\");\n QTest::addColumn<ResultDataList>(\"expectedResults\");\n\n ILocatorFilter *cppFunctionsFilter = PluginManager::getObject<CppFunctionsFilter>();\n ILocatorFilter *cppClassesFilter = PluginManager::getObject<CppClassesFilter>();\n ILocatorFilter *cppLocatorFilter = PluginManager::getObject<CppLocatorFilter>();\n\n MyTestDataDir testDirectory(QLatin1String(\"testdata_basic\"));\n const QString testFile = testDirectory.file(QLatin1String(\"file1.cpp\"));\n const QString testFileShort = FileUtils::shortNativePath(FileName::fromString(testFile));\n\n QTest::newRow(\"CppFunctionsFilter\")\n << testFile\n << cppFunctionsFilter\n << QString::fromLatin1(\"myfunction\")\n << (QList<ResultData>()\n << ResultData(_(\"myFunction(bool, int)\"), testFileShort)\n << ResultData(_(\"myFunction(bool, int)\"), _(\"MyNamespace\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"<anonymous namespace>\"))\n );\n\n QTest::newRow(\"CppClassesFilter\")\n << testFile\n << cppClassesFilter\n << _(\"myclass\")\n << (QList<ResultData>()\n << ResultData(_(\"MyClass\"), testFileShort)\n << ResultData(_(\"MyClass\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyClass\"), _(\"<anonymous namespace>\"))\n );\n\n QTest::newRow(\"CppLocatorFilter\")\n << testFile\n << cppLocatorFilter\n << _(\"myclass\")\n << (QList<ResultData>()\n << ResultData(_(\"MyClass\"), testFileShort)\n << ResultData(_(\"MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"MyClass::function2\"), _(\"(bool, int)\"))\n << ResultData(_(\"<anonymous namespace>::MyClass\"), testFileShort)\n << ResultData(_(\"<anonymous namespace>::MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"<anonymous namespace>::MyClass::function2\"), _(\"(bool, int)\"))\n << ResultData(_(\"MyNamespace::MyClass\"), testFileShort)\n << ResultData(_(\"MyNamespace::MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"MyNamespace::MyClass::function2\"), _(\"(bool, int)\"))\n );\n}\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppCurrentDocumentFilter()\n{\n MyTestDataDir testDirectory(QLatin1String(\"testdata_basic\"));\n const QString testFile = testDirectory.file(QLatin1String(\"file1.cpp\"));\n\n QList<ResultData> expectedResults = QList<ResultData>()\n << ResultData(_(\"int myVariable\"), _(\"\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"\"))\n << ResultData(_(\"MyEnum\"), _(\"\"))\n << ResultData(_(\"int V1\"), _(\"MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"\"))\n << ResultData(_(\"MyClass()\"), _(\"MyClass\"))\n << ResultData(_(\"function1()\"), _(\"MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"MyClass\"))\n << ResultData(_(\"int myVariable\"), _(\"MyNamespace\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyEnum\"), _(\"MyNamespace\"))\n << ResultData(_(\"int V1\"), _(\"MyNamespace::MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"MyNamespace::MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyClass()\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"function1()\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"int myVariable\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"MyEnum\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"int V1\"), _(\"<anonymous namespace>::MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"<anonymous namespace>::MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"MyClass()\"), _(\"<anonymous namespace>::MyClass\"))\n << ResultData(_(\"function1()\"), _(\"<anonymous namespace>::MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"<anonymous namespace>::MyClass\"))\n ;\n\n CppCurrentDocumentFilterTest test(testFile);\n ResultDataList results = ResultData::fromFilterEntryList(test.matchesFor());\n\/\/ ResultData::printFilterEntries(results);\n QVERIFY(!results.isEmpty());\n QCOMPARE(expectedResults, results);\n}\n<commit_msg>CppTools: Tests: Correct input data in locator test case<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"cpptoolsplugin.h\"\n\n#include \"cppclassesfilter.h\"\n#include \"cppcurrentdocumentfilter.h\"\n#include \"cppfunctionsfilter.h\"\n#include \"cpplocatorfilter.h\"\n#include \"cppmodelmanager.h\"\n\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <coreplugin\/testdatadir.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <locator\/locatorfiltertest.h>\n#include <utils\/fileutils.h>\n\n#include <QDebug>\n#include <QFileInfo>\n#include <QtTest>\n\nusing namespace Core;\nusing namespace Core::Internal::Tests;\nusing namespace CppTools::Internal;\nusing namespace ExtensionSystem;\nusing namespace Locator;\nusing namespace Locator::Internal;\nusing namespace Locator::Internal::Tests;\nusing namespace Utils;\n\nQ_DECLARE_METATYPE(ILocatorFilter *)\n\nnamespace {\n\nclass MyTestDataDir : public Core::Internal::Tests::TestDataDir\n{\npublic:\n MyTestDataDir(const QString &testDataDirectory)\n : TestDataDir(QLatin1String(SRCDIR \"\/..\/..\/..\/tests\/cpplocators\/\") + testDataDirectory) {}\n};\n\nclass CppLocatorFilterTest : public BasicLocatorFilterTest\n{\npublic:\n CppLocatorFilterTest(ILocatorFilter *filter, const QString &fileName)\n : BasicLocatorFilterTest(filter)\n , m_modelManager(CppModelManager::instance())\n , m_fileName(fileName)\n {\n QVERIFY(!m_fileName.isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n virtual void doBeforeLocatorRun()\n {\n m_modelManager->updateSourceFiles(QStringList() << m_fileName).waitForFinished();\n QVERIFY(m_modelManager->snapshot().contains(m_fileName));\n QCoreApplication::processEvents();\n }\n\n virtual void doAfterLocatorRun()\n {\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\n CppModelManager *m_modelManager;\n const QString m_fileName;\n};\n\nclass CppCurrentDocumentFilterTest : public BasicLocatorFilterTest\n{\npublic:\n CppCurrentDocumentFilterTest(const QString &fileName)\n : BasicLocatorFilterTest(PluginManager::getObject<CppCurrentDocumentFilter>())\n , m_modelManager(CppModelManager::instance())\n , m_editor(0)\n , m_fileName(fileName)\n {\n QVERIFY(!m_fileName.isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\nprivate:\n virtual void doBeforeLocatorRun()\n {\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n\n m_editor = EditorManager::openEditor(m_fileName);\n QVERIFY(m_editor);\n while (!m_modelManager->snapshot().contains(m_fileName))\n QCoreApplication::processEvents();\n }\n\n virtual void doAfterLocatorRun()\n {\n EditorManager::instance()->closeEditor(m_editor, \/*askAboutModifiedEditors=*\/ false);\n QCoreApplication::processEvents();\n QVERIFY(EditorManager::documentModel()->openedDocuments().isEmpty());\n m_modelManager->GC();\n QVERIFY(m_modelManager->snapshot().isEmpty());\n }\n\n CppModelManager *m_modelManager;\n IEditor *m_editor;\n const QString m_fileName;\n};\n\ninline QString _(const QByteArray &ba) { return QString::fromLatin1(ba, ba.size()); }\n\n} \/\/ anonymous namespace\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppLocatorFilter()\n{\n QFETCH(QString, testFile);\n QFETCH(ILocatorFilter *, filter);\n QFETCH(QString, searchText);\n QFETCH(ResultDataList, expectedResults);\n\n CppLocatorFilterTest test(filter, testFile);\n ResultDataList results = ResultData::fromFilterEntryList(test.matchesFor(searchText));\n\/\/ ResultData::printFilterEntries(results);\n QVERIFY(!results.isEmpty());\n QCOMPARE(expectedResults, results);\n}\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppLocatorFilter_data()\n{\n QTest::addColumn<QString>(\"testFile\");\n QTest::addColumn<ILocatorFilter *>(\"filter\");\n QTest::addColumn<QString>(\"searchText\");\n QTest::addColumn<ResultDataList>(\"expectedResults\");\n\n ILocatorFilter *cppFunctionsFilter = PluginManager::getObject<CppFunctionsFilter>();\n ILocatorFilter *cppClassesFilter = PluginManager::getObject<CppClassesFilter>();\n ILocatorFilter *cppLocatorFilter = PluginManager::getObject<CppLocatorFilter>();\n\n MyTestDataDir testDirectory(QLatin1String(\"testdata_basic\"));\n const QString testFile = testDirectory.file(QLatin1String(\"file1.cpp\"));\n const QString testFileShort = FileUtils::shortNativePath(FileName::fromString(testFile));\n\n QTest::newRow(\"CppFunctionsFilter\")\n << testFile\n << cppFunctionsFilter\n << QString::fromLatin1(\"myfunction\")\n << (QList<ResultData>()\n << ResultData(_(\"myFunction(bool, int)\"), testFileShort)\n << ResultData(_(\"myFunction(bool, int)\"), _(\"MyNamespace\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"<anonymous namespace>\"))\n );\n\n QTest::newRow(\"CppClassesFilter\")\n << testFile\n << cppClassesFilter\n << _(\"myclass\")\n << (QList<ResultData>()\n << ResultData(_(\"MyClass\"), testFileShort)\n << ResultData(_(\"MyClass\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyClass\"), _(\"<anonymous namespace>\"))\n );\n\n QTest::newRow(\"CppLocatorFilter\")\n << testFile\n << cppLocatorFilter\n << _(\"my\")\n << (QList<ResultData>()\n << ResultData(_(\"MyClass\"), testFileShort)\n << ResultData(_(\"MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"MyClass::function2\"), _(\"(bool, int)\"))\n << ResultData(_(\"MyEnum\"), testFileShort)\n << ResultData(_(\"MyNamespace::MyClass\"), testFileShort)\n << ResultData(_(\"MyNamespace::MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"MyNamespace::MyClass::function2\"), _(\"(bool, int)\"))\n << ResultData(_(\"MyNamespace::MyEnum\"), testFileShort)\n << ResultData(_(\"MyNamespace::myFunction\"), _(\"(bool, int)\"))\n << ResultData(_(\"myFunction\"), _(\"(bool, int)\"))\n << ResultData(_(\"<anonymous namespace>::MyClass\"), testFileShort)\n << ResultData(_(\"<anonymous namespace>::MyClass::MyClass\"), _(\"()\"))\n << ResultData(_(\"<anonymous namespace>::MyClass::function2\"), _(\"(bool, int)\"))\n << ResultData(_(\"<anonymous namespace>::MyEnum\"), testFileShort)\n << ResultData(_(\"<anonymous namespace>::myFunction\"), _(\"(bool, int)\"))\n );\n}\n\nvoid CppToolsPlugin::test_cpplocatorfilters_CppCurrentDocumentFilter()\n{\n MyTestDataDir testDirectory(QLatin1String(\"testdata_basic\"));\n const QString testFile = testDirectory.file(QLatin1String(\"file1.cpp\"));\n\n QList<ResultData> expectedResults = QList<ResultData>()\n << ResultData(_(\"int myVariable\"), _(\"\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"\"))\n << ResultData(_(\"MyEnum\"), _(\"\"))\n << ResultData(_(\"int V1\"), _(\"MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"\"))\n << ResultData(_(\"MyClass()\"), _(\"MyClass\"))\n << ResultData(_(\"function1()\"), _(\"MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"MyClass\"))\n << ResultData(_(\"int myVariable\"), _(\"MyNamespace\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyEnum\"), _(\"MyNamespace\"))\n << ResultData(_(\"int V1\"), _(\"MyNamespace::MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"MyNamespace::MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"MyNamespace\"))\n << ResultData(_(\"MyClass()\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"function1()\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"MyNamespace::MyClass\"))\n << ResultData(_(\"int myVariable\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"myFunction(bool, int)\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"MyEnum\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"int V1\"), _(\"<anonymous namespace>::MyEnum\"))\n << ResultData(_(\"int V2\"), _(\"<anonymous namespace>::MyEnum\"))\n << ResultData(_(\"MyClass\"), _(\"<anonymous namespace>\"))\n << ResultData(_(\"MyClass()\"), _(\"<anonymous namespace>::MyClass\"))\n << ResultData(_(\"function1()\"), _(\"<anonymous namespace>::MyClass\"))\n << ResultData(_(\"function2(bool, int)\"), _(\"<anonymous namespace>::MyClass\"))\n ;\n\n CppCurrentDocumentFilterTest test(testFile);\n ResultDataList results = ResultData::fromFilterEntryList(test.matchesFor());\n\/\/ ResultData::printFilterEntries(results);\n QVERIFY(!results.isEmpty());\n QCOMPARE(expectedResults, results);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <depthai-shared\/datatype\/RawCameraControl.hpp>\n#include <nlohmann\/json.hpp>\n\n#include \"depthai-shared\/common\/CameraBoardSocket.hpp\"\n#include \"depthai-shared\/common\/CameraImageOrientation.hpp\"\n\nnamespace dai {\n\n\/**\n * Specify properties for ColorCamera such as camera ID, ...\n *\/\nstruct ColorCameraProperties {\n static constexpr int AUTO = -1;\n\n struct IspScale {\n int32_t horizNumerator = 0;\n int32_t horizDenominator = 0;\n int32_t vertNumerator = 0;\n int32_t vertDenominator = 0;\n\n NLOHMANN_DEFINE_TYPE_INTRUSIVE(IspScale, horizNumerator, horizDenominator, vertNumerator, vertDenominator);\n };\n\n \/**\n * Select the camera sensor resolution\n *\/\n enum class SensorResolution : int32_t { THE_1080_P, THE_1200_P, THE_4_K, THE_12_MP, THE_13_MP, THE_720_P, THE_800_P };\n\n \/**\n * For 24 bit color these can be either RGB or BGR\n *\/\n enum class ColorOrder : int32_t { BGR, RGB };\n\n \/*\n * Initial controls applied to ColorCamera node\n *\/\n RawCameraControl initialControl;\n\n \/**\n * Which socket will color camera use\n *\/\n CameraBoardSocket boardSocket = CameraBoardSocket::AUTO;\n\n \/**\n * Camera sensor image orientation \/ pixel readout\n *\/\n CameraImageOrientation imageOrientation = CameraImageOrientation::AUTO;\n\n \/**\n * For 24 bit color these can be either RGB or BGR\n *\/\n ColorOrder colorOrder = ColorOrder::BGR;\n \/**\n * Are colors interleaved (R1G1B1, R2G2B2, ...) or planar (R1R2..., G1G2..., B1B2)\n *\/\n bool interleaved = true;\n \/**\n * Are values FP16 type (0.0 - 255.0)\n *\/\n bool fp16 = false;\n\n \/**\n * Preview frame output height\n *\/\n uint32_t previewHeight = 300;\n \/**\n * Preview frame output width\n *\/\n uint32_t previewWidth = 300;\n\n \/**\n * Preview frame output width\n *\/\n int32_t videoWidth = AUTO;\n\n \/**\n * Preview frame output height\n *\/\n int32_t videoHeight = AUTO;\n\n \/**\n * Preview frame output width\n *\/\n int32_t stillWidth = AUTO;\n\n \/**\n * Preview frame output height\n *\/\n int32_t stillHeight = AUTO;\n\n \/**\n * Select the camera sensor resolution\n *\/\n SensorResolution resolution = SensorResolution::THE_1080_P;\n \/**\n * Camera sensor FPS\n *\/\n float fps = 30.0;\n\n \/**\n * Initial sensor crop, -1 signifies center crop\n *\/\n float sensorCropX = AUTO;\n float sensorCropY = AUTO;\n\n \/**\n * Whether to wait for config at 'inputConfig' io\n *\/\n bool inputConfigSync = false;\n\n \/**\n * Whether to keep aspect ratio of input (video size) or not\n *\/\n bool previewKeepAspectRatio = true;\n\n \/**\n * Configure scaling for `isp` output.\n *\/\n IspScale ispScale;\n};\n\nNLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(ColorCameraProperties,\n initialControl,\n boardSocket,\n imageOrientation,\n colorOrder,\n interleaved,\n fp16,\n previewHeight,\n previewWidth,\n videoWidth,\n videoHeight,\n stillWidth,\n stillHeight,\n resolution,\n fps,\n sensorCropX,\n sensorCropY,\n inputConfigSync,\n previewKeepAspectRatio,\n ispScale);\n\n} \/\/ namespace dai\n<commit_msg>Add 5MP color sensor resolution<commit_after>#pragma once\n\n#include <depthai-shared\/datatype\/RawCameraControl.hpp>\n#include <nlohmann\/json.hpp>\n\n#include \"depthai-shared\/common\/CameraBoardSocket.hpp\"\n#include \"depthai-shared\/common\/CameraImageOrientation.hpp\"\n\nnamespace dai {\n\n\/**\n * Specify properties for ColorCamera such as camera ID, ...\n *\/\nstruct ColorCameraProperties {\n static constexpr int AUTO = -1;\n\n struct IspScale {\n int32_t horizNumerator = 0;\n int32_t horizDenominator = 0;\n int32_t vertNumerator = 0;\n int32_t vertDenominator = 0;\n\n NLOHMANN_DEFINE_TYPE_INTRUSIVE(IspScale, horizNumerator, horizDenominator, vertNumerator, vertDenominator);\n };\n\n \/**\n * Select the camera sensor resolution\n *\/\n enum class SensorResolution : int32_t { THE_1080_P, THE_1200_P, THE_4_K, THE_5_MP, THE_12_MP, THE_13_MP, THE_720_P, THE_800_P };\n\n \/**\n * For 24 bit color these can be either RGB or BGR\n *\/\n enum class ColorOrder : int32_t { BGR, RGB };\n\n \/*\n * Initial controls applied to ColorCamera node\n *\/\n RawCameraControl initialControl;\n\n \/**\n * Which socket will color camera use\n *\/\n CameraBoardSocket boardSocket = CameraBoardSocket::AUTO;\n\n \/**\n * Camera sensor image orientation \/ pixel readout\n *\/\n CameraImageOrientation imageOrientation = CameraImageOrientation::AUTO;\n\n \/**\n * For 24 bit color these can be either RGB or BGR\n *\/\n ColorOrder colorOrder = ColorOrder::BGR;\n \/**\n * Are colors interleaved (R1G1B1, R2G2B2, ...) or planar (R1R2..., G1G2..., B1B2)\n *\/\n bool interleaved = true;\n \/**\n * Are values FP16 type (0.0 - 255.0)\n *\/\n bool fp16 = false;\n\n \/**\n * Preview frame output height\n *\/\n uint32_t previewHeight = 300;\n \/**\n * Preview frame output width\n *\/\n uint32_t previewWidth = 300;\n\n \/**\n * Preview frame output width\n *\/\n int32_t videoWidth = AUTO;\n\n \/**\n * Preview frame output height\n *\/\n int32_t videoHeight = AUTO;\n\n \/**\n * Preview frame output width\n *\/\n int32_t stillWidth = AUTO;\n\n \/**\n * Preview frame output height\n *\/\n int32_t stillHeight = AUTO;\n\n \/**\n * Select the camera sensor resolution\n *\/\n SensorResolution resolution = SensorResolution::THE_1080_P;\n \/**\n * Camera sensor FPS\n *\/\n float fps = 30.0;\n\n \/**\n * Initial sensor crop, -1 signifies center crop\n *\/\n float sensorCropX = AUTO;\n float sensorCropY = AUTO;\n\n \/**\n * Whether to wait for config at 'inputConfig' io\n *\/\n bool inputConfigSync = false;\n\n \/**\n * Whether to keep aspect ratio of input (video size) or not\n *\/\n bool previewKeepAspectRatio = true;\n\n \/**\n * Configure scaling for `isp` output.\n *\/\n IspScale ispScale;\n};\n\nNLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(ColorCameraProperties,\n initialControl,\n boardSocket,\n imageOrientation,\n colorOrder,\n interleaved,\n fp16,\n previewHeight,\n previewWidth,\n videoWidth,\n videoHeight,\n stillWidth,\n stillHeight,\n resolution,\n fps,\n sensorCropX,\n sensorCropY,\n inputConfigSync,\n previewKeepAspectRatio,\n ispScale);\n\n} \/\/ namespace dai\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** Copyright (C) 2013 BlackBerry Limited. All rights reserved.\n**\n** Contact: BlackBerry (qt@blackberry.com)\n** Contact: KDAB (info@kdab.com)\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"blackberrysetupwizardpages.h\"\n#include \"blackberryndksettingswidget.h\"\n#include \"blackberryconfiguration.h\"\n#include \"blackberrysigningutils.h\"\n#include \"ui_blackberrysetupwizardkeyspage.h\"\n#include \"ui_blackberrysetupwizardcertificatepage.h\"\n#include \"ui_blackberrysetupwizarddevicepage.h\"\n#include \"ui_blackberrysetupwizardfinishpage.h\"\n\n#include <QVBoxLayout>\n#include <QFileInfo>\n#include <QLabel>\n#include <QVBoxLayout>\n#include <QMessageBox>\n#include <QAbstractButton>\n#include <QDesktopServices>\n#include <QUrl>\n\n#include <QDebug>\n\nusing namespace Qnx;\nusing namespace Qnx::Internal;\n\nBlackBerrySetupWizardWelcomePage::BlackBerrySetupWizardWelcomePage(QWidget *parent) :\n QWizardPage(parent)\n{\n const QString welcomeMessage =\n tr(\"Welcome to the BlackBerry Development \"\n \"Environment Setup Wizard.\\nThis wizard will guide you through \"\n \"the essential steps to deploy a ready-to-go development environment \"\n \"for BlackBerry 10 devices.\");\n\n setTitle(tr(\"BlackBerry Development Environment Setup\"));\n\n QLabel *label = new QLabel(this);\n label->setWordWrap(true);\n label->setText(welcomeMessage);\n\n QVBoxLayout *layout = new QVBoxLayout;\n layout->addStretch();\n layout->addWidget(label);\n layout->addStretch();\n\n setLayout(layout);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardNdkPage::BlackBerrySetupWizardNdkPage(QWidget *parent) :\n QWizardPage(parent),\n m_widget(0)\n{\n setTitle(tr(\"Configure the NDK Path\"));\n\n m_widget = new BlackBerryNDKSettingsWidget(this);\n m_widget->setWizardMessageVisible(false);\n\n connect(m_widget, SIGNAL(targetsUpdated()), this, SIGNAL(completeChanged()));\n connect(m_widget, SIGNAL(targetsUpdated()), this, SIGNAL(targetsUpdated()));\n\n QVBoxLayout *layout = new QVBoxLayout;\n layout->addWidget(m_widget);\n\n setLayout(layout);\n}\n\nBlackBerrySetupWizardNdkPage::~BlackBerrySetupWizardNdkPage()\n{\n}\n\nbool BlackBerrySetupWizardNdkPage::isComplete() const\n{\n return m_widget->hasActiveNdk();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardKeysPage::BlackBerrySetupWizardKeysPage(QWidget *parent) :\n QWizardPage(parent),\n m_ui(0),\n m_complete(false)\n{\n setTitle(tr(\"Setup Signing Keys\"));\n\n initUi();\n}\n\nBlackBerrySetupWizardKeysPage::~BlackBerrySetupWizardKeysPage()\n{\n delete m_ui;\n m_ui = 0;\n}\n\nvoid BlackBerrySetupWizardKeysPage::showKeysMessage(const QString &url)\n{\n const QMessageBox::StandardButton button = QMessageBox::question(this,\n tr(\"Qt Creator\"),\n tr(\"This wizard will be closed and you will be taken to the BlackBerry \"\n \"key request web page. Do you want to continue?\"),\n QMessageBox::Yes | QMessageBox::No);\n\n if (button == QMessageBox::Yes) {\n QDesktopServices::openUrl(QUrl(url));\n wizard()->reject();\n }\n}\n\nbool BlackBerrySetupWizardKeysPage::isComplete() const\n{\n return m_complete;\n}\n\nvoid BlackBerrySetupWizardKeysPage::initUi()\n{\n BlackBerrySigningUtils &utils = BlackBerrySigningUtils::instance();\n\n m_ui = new Ui::BlackBerrySetupWizardKeysPage;\n m_ui->setupUi(this);\n\n if (utils.hasLegacyKeys()) {\n m_ui->linkLabel->setVisible(false);\n m_ui->legacyLabel->setVisible(true);\n m_ui->statusLabel->setVisible(false);\n\n setComplete(false);\n } else if (utils.hasRegisteredKeys()) {\n m_ui->linkLabel->setVisible(false);\n m_ui->legacyLabel->setVisible(false);\n m_ui->statusLabel->setVisible(true);\n\n setComplete(true);\n } else {\n m_ui->linkLabel->setVisible(true);\n m_ui->legacyLabel->setVisible(false);\n m_ui->statusLabel->setVisible(false);\n\n setComplete(false);\n }\n\n connect(m_ui->linkLabel, SIGNAL(linkActivated(QString)),\n this, SLOT(showKeysMessage(QString)));\n connect(m_ui->legacyLabel, SIGNAL(linkActivated(QString)),\n this, SLOT(showKeysMessage(QString)));\n}\n\nvoid BlackBerrySetupWizardKeysPage::setComplete(bool complete)\n{\n if (m_complete != complete) {\n m_complete = complete;\n m_ui->linkLabel->setVisible(!complete);\n m_ui->statusLabel->setVisible(complete);\n emit completeChanged();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst char BlackBerrySetupWizardCertificatePage::AuthorField[] = \"CertificatePage::Author\";\nconst char BlackBerrySetupWizardCertificatePage::PasswordField[] = \"CertificatePage::Password\";\nconst char BlackBerrySetupWizardCertificatePage::PasswordField2[] = \"CertificatePage::Password2\";\n\nBlackBerrySetupWizardCertificatePage::BlackBerrySetupWizardCertificatePage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0),\n m_complete(false)\n{\n setTitle(tr(\"Create Developer Certificate\"));\n\n initUi();\n}\n\nbool BlackBerrySetupWizardCertificatePage::isComplete() const\n{\n return m_complete;\n}\n\nvoid BlackBerrySetupWizardCertificatePage::validate()\n{\n if (m_ui->author->text().isEmpty()\n || m_ui->password->text().isEmpty()\n || m_ui->password2->text().isEmpty()) {\n m_ui->status->clear();\n setComplete(false);\n return;\n }\n\n if (m_ui->password->text() != m_ui->password2->text()) {\n m_ui->status->setText(tr(\"The entered passwords do not match.\"));\n setComplete(false);\n return;\n }\n\n if (m_ui->password->text().size() < 6) {\n \/\/ TODO: Use tr() once string freeze is over\n m_ui->status->setText(QCoreApplication::translate(\"Qnx::Internal::BlackBerryCreateCertificateDialog\", \"Password must be at least 6 characters long.\"));\n setComplete(false);\n return;\n }\n\n m_ui->status->clear();\n setComplete(true);\n}\n\nvoid BlackBerrySetupWizardCertificatePage::checkBoxChanged(int state)\n{\n if (state == Qt::Checked) {\n m_ui->password->setEchoMode(QLineEdit::Normal);\n m_ui->password2->setEchoMode(QLineEdit::Normal);\n } else {\n m_ui->password->setEchoMode(QLineEdit::Password);\n m_ui->password2->setEchoMode(QLineEdit::Password);\n }\n}\n\nvoid BlackBerrySetupWizardCertificatePage::setComplete(bool complete)\n{\n if (m_complete != complete) {\n m_complete = complete;\n emit completeChanged();\n }\n}\n\nvoid BlackBerrySetupWizardCertificatePage::initUi()\n{\n m_ui = new Ui::BlackBerrySetupWizardCertificatePage;\n m_ui->setupUi(this);\n m_ui->status->clear();\n\n connect(m_ui->author, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->password, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->password2, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->showPassword, SIGNAL(stateChanged(int)),\n this, SLOT(checkBoxChanged(int)));\n\n registerField(QLatin1String(AuthorField) + QLatin1Char('*'), m_ui->author);\n registerField(QLatin1String(PasswordField) + QLatin1Char('*'), m_ui->password);\n registerField(QLatin1String(PasswordField2) + QLatin1Char('*'), m_ui->password2);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst char BlackBerrySetupWizardDevicePage::NameField[] = \"DevicePage::Name\";\nconst char BlackBerrySetupWizardDevicePage::IpAddressField[] = \"DevicePage::IpAddress\";\nconst char BlackBerrySetupWizardDevicePage::PasswordField[] = \"DevicePage::PasswordField\";\nconst char BlackBerrySetupWizardDevicePage::PhysicalDeviceField[] = \"DevicePage::PhysicalDeviceField\";\n\n\nBlackBerrySetupWizardDevicePage::BlackBerrySetupWizardDevicePage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0)\n{\n setTitle(tr(\"Configure BlackBerry Device Connection\"));\n\n m_ui = new Ui::BlackBerrySetupWizardDevicePage;\n m_ui->setupUi(this);\n\n m_ui->deviceName->setText(tr(\"BlackBerry Device\"));\n m_ui->ipAddress->setText(QLatin1String(\"169.254.0.1\"));\n\n connect(m_ui->deviceName, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->ipAddress, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->password, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->physicalDevice, SIGNAL(toggled(bool)), this, SIGNAL(completeChanged()));\n\n registerField(QLatin1String(NameField) + QLatin1Char('*'), m_ui->deviceName);\n registerField(QLatin1String(IpAddressField) + QLatin1Char('*'), m_ui->ipAddress);\n registerField(QLatin1String(PasswordField), m_ui->password);\n registerField(QLatin1String(PhysicalDeviceField), m_ui->physicalDevice);\n}\n\nbool BlackBerrySetupWizardDevicePage::isComplete() const\n{\n if (m_ui->deviceName->text().isEmpty() || m_ui->ipAddress->text().isEmpty())\n return false;\n\n const bool passwordMandatory = m_ui->physicalDevice->isChecked();\n\n if (passwordMandatory && m_ui->password->text().isEmpty())\n return false;\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardFinishPage::BlackBerrySetupWizardFinishPage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0)\n{\n setSubTitle(tr(\"Your environment is ready to be configured.\"));\n\n m_ui = new Ui::BlackBerrySetupWizardFinishPage;\n m_ui->setupUi(this);\n setProgress(QString(), -1);\n}\n\nvoid BlackBerrySetupWizardFinishPage::setProgress(const QString &status, int progress)\n{\n if (progress < 0) {\n m_ui->progressBar->hide();\n m_ui->statusLabel->clear();\n return;\n } else if (!m_ui->progressBar->isVisible()) {\n m_ui->progressBar->show();\n }\n\n m_ui->statusLabel->setText(status);\n m_ui->progressBar->setValue(progress);\n}\n<commit_msg>Qnx: Add missing title in the last setup wizard page<commit_after>\/**************************************************************************\n**\n** Copyright (C) 2013 BlackBerry Limited. All rights reserved.\n**\n** Contact: BlackBerry (qt@blackberry.com)\n** Contact: KDAB (info@kdab.com)\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"blackberrysetupwizardpages.h\"\n#include \"blackberryndksettingswidget.h\"\n#include \"blackberryconfiguration.h\"\n#include \"blackberrysigningutils.h\"\n#include \"ui_blackberrysetupwizardkeyspage.h\"\n#include \"ui_blackberrysetupwizardcertificatepage.h\"\n#include \"ui_blackberrysetupwizarddevicepage.h\"\n#include \"ui_blackberrysetupwizardfinishpage.h\"\n\n#include <QVBoxLayout>\n#include <QFileInfo>\n#include <QLabel>\n#include <QVBoxLayout>\n#include <QMessageBox>\n#include <QAbstractButton>\n#include <QDesktopServices>\n#include <QUrl>\n\n#include <QDebug>\n\nusing namespace Qnx;\nusing namespace Qnx::Internal;\n\nBlackBerrySetupWizardWelcomePage::BlackBerrySetupWizardWelcomePage(QWidget *parent) :\n QWizardPage(parent)\n{\n const QString welcomeMessage =\n tr(\"Welcome to the BlackBerry Development \"\n \"Environment Setup Wizard.\\nThis wizard will guide you through \"\n \"the essential steps to deploy a ready-to-go development environment \"\n \"for BlackBerry 10 devices.\");\n\n setTitle(tr(\"BlackBerry Development Environment Setup\"));\n\n QLabel *label = new QLabel(this);\n label->setWordWrap(true);\n label->setText(welcomeMessage);\n\n QVBoxLayout *layout = new QVBoxLayout;\n layout->addStretch();\n layout->addWidget(label);\n layout->addStretch();\n\n setLayout(layout);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardNdkPage::BlackBerrySetupWizardNdkPage(QWidget *parent) :\n QWizardPage(parent),\n m_widget(0)\n{\n setTitle(tr(\"Configure the NDK Path\"));\n\n m_widget = new BlackBerryNDKSettingsWidget(this);\n m_widget->setWizardMessageVisible(false);\n\n connect(m_widget, SIGNAL(targetsUpdated()), this, SIGNAL(completeChanged()));\n connect(m_widget, SIGNAL(targetsUpdated()), this, SIGNAL(targetsUpdated()));\n\n QVBoxLayout *layout = new QVBoxLayout;\n layout->addWidget(m_widget);\n\n setLayout(layout);\n}\n\nBlackBerrySetupWizardNdkPage::~BlackBerrySetupWizardNdkPage()\n{\n}\n\nbool BlackBerrySetupWizardNdkPage::isComplete() const\n{\n return m_widget->hasActiveNdk();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardKeysPage::BlackBerrySetupWizardKeysPage(QWidget *parent) :\n QWizardPage(parent),\n m_ui(0),\n m_complete(false)\n{\n setTitle(tr(\"Setup Signing Keys\"));\n\n initUi();\n}\n\nBlackBerrySetupWizardKeysPage::~BlackBerrySetupWizardKeysPage()\n{\n delete m_ui;\n m_ui = 0;\n}\n\nvoid BlackBerrySetupWizardKeysPage::showKeysMessage(const QString &url)\n{\n const QMessageBox::StandardButton button = QMessageBox::question(this,\n tr(\"Qt Creator\"),\n tr(\"This wizard will be closed and you will be taken to the BlackBerry \"\n \"key request web page. Do you want to continue?\"),\n QMessageBox::Yes | QMessageBox::No);\n\n if (button == QMessageBox::Yes) {\n QDesktopServices::openUrl(QUrl(url));\n wizard()->reject();\n }\n}\n\nbool BlackBerrySetupWizardKeysPage::isComplete() const\n{\n return m_complete;\n}\n\nvoid BlackBerrySetupWizardKeysPage::initUi()\n{\n BlackBerrySigningUtils &utils = BlackBerrySigningUtils::instance();\n\n m_ui = new Ui::BlackBerrySetupWizardKeysPage;\n m_ui->setupUi(this);\n\n if (utils.hasLegacyKeys()) {\n m_ui->linkLabel->setVisible(false);\n m_ui->legacyLabel->setVisible(true);\n m_ui->statusLabel->setVisible(false);\n\n setComplete(false);\n } else if (utils.hasRegisteredKeys()) {\n m_ui->linkLabel->setVisible(false);\n m_ui->legacyLabel->setVisible(false);\n m_ui->statusLabel->setVisible(true);\n\n setComplete(true);\n } else {\n m_ui->linkLabel->setVisible(true);\n m_ui->legacyLabel->setVisible(false);\n m_ui->statusLabel->setVisible(false);\n\n setComplete(false);\n }\n\n connect(m_ui->linkLabel, SIGNAL(linkActivated(QString)),\n this, SLOT(showKeysMessage(QString)));\n connect(m_ui->legacyLabel, SIGNAL(linkActivated(QString)),\n this, SLOT(showKeysMessage(QString)));\n}\n\nvoid BlackBerrySetupWizardKeysPage::setComplete(bool complete)\n{\n if (m_complete != complete) {\n m_complete = complete;\n m_ui->linkLabel->setVisible(!complete);\n m_ui->statusLabel->setVisible(complete);\n emit completeChanged();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst char BlackBerrySetupWizardCertificatePage::AuthorField[] = \"CertificatePage::Author\";\nconst char BlackBerrySetupWizardCertificatePage::PasswordField[] = \"CertificatePage::Password\";\nconst char BlackBerrySetupWizardCertificatePage::PasswordField2[] = \"CertificatePage::Password2\";\n\nBlackBerrySetupWizardCertificatePage::BlackBerrySetupWizardCertificatePage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0),\n m_complete(false)\n{\n setTitle(tr(\"Create Developer Certificate\"));\n\n initUi();\n}\n\nbool BlackBerrySetupWizardCertificatePage::isComplete() const\n{\n return m_complete;\n}\n\nvoid BlackBerrySetupWizardCertificatePage::validate()\n{\n if (m_ui->author->text().isEmpty()\n || m_ui->password->text().isEmpty()\n || m_ui->password2->text().isEmpty()) {\n m_ui->status->clear();\n setComplete(false);\n return;\n }\n\n if (m_ui->password->text() != m_ui->password2->text()) {\n m_ui->status->setText(tr(\"The entered passwords do not match.\"));\n setComplete(false);\n return;\n }\n\n if (m_ui->password->text().size() < 6) {\n \/\/ TODO: Use tr() once string freeze is over\n m_ui->status->setText(QCoreApplication::translate(\"Qnx::Internal::BlackBerryCreateCertificateDialog\", \"Password must be at least 6 characters long.\"));\n setComplete(false);\n return;\n }\n\n m_ui->status->clear();\n setComplete(true);\n}\n\nvoid BlackBerrySetupWizardCertificatePage::checkBoxChanged(int state)\n{\n if (state == Qt::Checked) {\n m_ui->password->setEchoMode(QLineEdit::Normal);\n m_ui->password2->setEchoMode(QLineEdit::Normal);\n } else {\n m_ui->password->setEchoMode(QLineEdit::Password);\n m_ui->password2->setEchoMode(QLineEdit::Password);\n }\n}\n\nvoid BlackBerrySetupWizardCertificatePage::setComplete(bool complete)\n{\n if (m_complete != complete) {\n m_complete = complete;\n emit completeChanged();\n }\n}\n\nvoid BlackBerrySetupWizardCertificatePage::initUi()\n{\n m_ui = new Ui::BlackBerrySetupWizardCertificatePage;\n m_ui->setupUi(this);\n m_ui->status->clear();\n\n connect(m_ui->author, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->password, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->password2, SIGNAL(textChanged(QString)),\n this, SLOT(validate()));\n connect(m_ui->showPassword, SIGNAL(stateChanged(int)),\n this, SLOT(checkBoxChanged(int)));\n\n registerField(QLatin1String(AuthorField) + QLatin1Char('*'), m_ui->author);\n registerField(QLatin1String(PasswordField) + QLatin1Char('*'), m_ui->password);\n registerField(QLatin1String(PasswordField2) + QLatin1Char('*'), m_ui->password2);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nconst char BlackBerrySetupWizardDevicePage::NameField[] = \"DevicePage::Name\";\nconst char BlackBerrySetupWizardDevicePage::IpAddressField[] = \"DevicePage::IpAddress\";\nconst char BlackBerrySetupWizardDevicePage::PasswordField[] = \"DevicePage::PasswordField\";\nconst char BlackBerrySetupWizardDevicePage::PhysicalDeviceField[] = \"DevicePage::PhysicalDeviceField\";\n\n\nBlackBerrySetupWizardDevicePage::BlackBerrySetupWizardDevicePage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0)\n{\n setTitle(tr(\"Configure BlackBerry Device Connection\"));\n\n m_ui = new Ui::BlackBerrySetupWizardDevicePage;\n m_ui->setupUi(this);\n\n m_ui->deviceName->setText(tr(\"BlackBerry Device\"));\n m_ui->ipAddress->setText(QLatin1String(\"169.254.0.1\"));\n\n connect(m_ui->deviceName, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->ipAddress, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->password, SIGNAL(textChanged(QString)), this, SIGNAL(completeChanged()));\n connect(m_ui->physicalDevice, SIGNAL(toggled(bool)), this, SIGNAL(completeChanged()));\n\n registerField(QLatin1String(NameField) + QLatin1Char('*'), m_ui->deviceName);\n registerField(QLatin1String(IpAddressField) + QLatin1Char('*'), m_ui->ipAddress);\n registerField(QLatin1String(PasswordField), m_ui->password);\n registerField(QLatin1String(PhysicalDeviceField), m_ui->physicalDevice);\n}\n\nbool BlackBerrySetupWizardDevicePage::isComplete() const\n{\n if (m_ui->deviceName->text().isEmpty() || m_ui->ipAddress->text().isEmpty())\n return false;\n\n const bool passwordMandatory = m_ui->physicalDevice->isChecked();\n\n if (passwordMandatory && m_ui->password->text().isEmpty())\n return false;\n\n return true;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nBlackBerrySetupWizardFinishPage::BlackBerrySetupWizardFinishPage(QWidget *parent)\n : QWizardPage(parent),\n m_ui(0)\n{\n setTitle(tr(\"Your environment is ready to be configured.\"));\n\n m_ui = new Ui::BlackBerrySetupWizardFinishPage;\n m_ui->setupUi(this);\n setProgress(QString(), -1);\n}\n\nvoid BlackBerrySetupWizardFinishPage::setProgress(const QString &status, int progress)\n{\n if (progress < 0) {\n m_ui->progressBar->hide();\n m_ui->statusLabel->clear();\n return;\n } else if (!m_ui->progressBar->isVisible()) {\n m_ui->progressBar->show();\n }\n\n m_ui->statusLabel->setText(status);\n m_ui->progressBar->setValue(progress);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n#include \"libtorrent\/socket.hpp\"\n\n#include <boost\/bind.hpp>\n#include <boost\/mpl\/max_element.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/sizeof.hpp>\n#include <boost\/mpl\/transform_view.hpp>\n#include <boost\/mpl\/deref.hpp>\n#include <boost\/lexical_cast.hpp>\n\n#include <libtorrent\/io.hpp>\n#include <libtorrent\/invariant_check.hpp>\n#include <libtorrent\/kademlia\/rpc_manager.hpp>\n#include <libtorrent\/kademlia\/logging.hpp>\n#include <libtorrent\/kademlia\/routing_table.hpp>\n#include <libtorrent\/kademlia\/find_data.hpp>\n#include <libtorrent\/kademlia\/closest_nodes.hpp>\n#include <libtorrent\/kademlia\/refresh.hpp>\n#include <libtorrent\/kademlia\/node.hpp>\n#include <libtorrent\/kademlia\/observer.hpp>\n#include <libtorrent\/hasher.hpp>\n\n#include <fstream>\n\nusing boost::shared_ptr;\nusing boost::bind;\n\nnamespace libtorrent { namespace dht\n{\n\nnamespace io = libtorrent::detail;\nnamespace mpl = boost::mpl;\n\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\nTORRENT_DEFINE_LOG(rpc)\n#endif\n\nvoid intrusive_ptr_add_ref(observer const* o)\n{\n\tTORRENT_ASSERT(o->m_refs >= 0);\n\tTORRENT_ASSERT(o != 0);\n\t++o->m_refs;\n}\n\nvoid intrusive_ptr_release(observer const* o)\n{\n\tTORRENT_ASSERT(o->m_refs > 0);\n\tTORRENT_ASSERT(o != 0);\n\tif (--o->m_refs == 0)\n\t{\n\t\tboost::pool<>& p = o->pool_allocator;\n\t\to->~observer();\n\t\tp.free(const_cast<observer*>(o));\n\t}\n}\n\nnode_id generate_id();\n\ntypedef mpl::vector<\n\tclosest_nodes_observer\n\t, find_data_observer\n\t, announce_observer\n\t, get_peers_observer\n\t, refresh_observer\n\t, ping_observer\n\t, null_observer\n\t> observer_types;\n\ntypedef mpl::max_element<\n\tmpl::transform_view<observer_types, mpl::sizeof_<mpl::_1> >\n >::type max_observer_type_iter;\n\nrpc_manager::rpc_manager(fun const& f, node_id const& our_id\n\t, routing_table& table, send_fun const& sf)\n\t: m_pool_allocator(sizeof(mpl::deref<max_observer_type_iter::base>::type))\n\t, m_next_transaction_id(rand() % max_transactions)\n\t, m_oldest_transaction_id(m_next_transaction_id)\n\t, m_incoming(f)\n\t, m_send(sf)\n\t, m_our_id(our_id)\n\t, m_table(table)\n\t, m_timer(time_now())\n\t, m_random_number(generate_id())\n\t, m_destructing(false)\n{\n\tstd::srand(time(0));\n}\n\nrpc_manager::~rpc_manager()\n{\n\tm_destructing = true;\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\tTORRENT_LOG(rpc) << \"Destructing\";\n#endif\n\tstd::for_each(m_aborted_transactions.begin(), m_aborted_transactions.end()\n\t\t, bind(&observer::abort, _1));\n\t\n\tfor (transactions_t::iterator i = m_transactions.begin()\n\t\t, end(m_transactions.end()); i != end; ++i)\n\t{\n\t\tif (*i) (*i)->abort();\n\t}\n}\n\n#ifndef NDEBUG\nvoid rpc_manager::check_invariant() const\n{\n\tTORRENT_ASSERT(m_oldest_transaction_id >= 0);\n\tTORRENT_ASSERT(m_oldest_transaction_id < max_transactions);\n\tTORRENT_ASSERT(m_next_transaction_id >= 0);\n\tTORRENT_ASSERT(m_next_transaction_id < max_transactions);\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n\n\tfor (int i = (m_next_transaction_id + 1) % max_transactions;\n\t\ti != m_oldest_transaction_id; i = (i + 1) % max_transactions)\n\t{\n\t\tTORRENT_ASSERT(!m_transactions[i]);\n\t}\n}\n#endif\n\nbool rpc_manager::incoming(msg const& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return false;\n\n\tif (m.reply)\n\t{\n\t\t\/\/ if we don't have the transaction id in our\n\t\t\/\/ request list, ignore the packet\n\n\t\tif (m.transaction_id.size() < 2)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with invalid transaction id size: \" \n\t\t\t\t<< m.transaction_id.size() << \" from \" << m.addr;\n#endif\n\t\t\tmsg reply;\n\t\t\treply.reply = true;\n\t\t\treply.message_id = messages::error;\n\t\t\treply.error_code = 203; \/\/ Protocol error\n\t\t\treply.error_msg = \"reply with invalid transaction id, size \"\n\t\t\t\t+ boost::lexical_cast<std::string>(m.transaction_id.size());\n\t\t\treply.addr = m.addr;\n\t\t\treply.transaction_id = \"\";\n\t\t\tm_send(reply);\n\t\t\treturn false;\n\t\t}\n\t\n\t\tstd::string::const_iterator i = m.transaction_id.begin();\t\n\t\tint tid = io::read_uint16(i);\n\n\t\tif (tid >= (int)m_transactions.size()\n\t\t\t|| tid < 0)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with invalid transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr;\n#endif\n\t\t\tmsg reply;\n\t\t\treply.reply = true;\n\t\t\treply.message_id = messages::error;\n\t\t\treply.error_code = 203; \/\/ Protocol error\n\t\t\treply.error_msg = \"reply with invalid transaction id\";\n\t\t\treply.addr = m.addr;\n\t\t\treply.transaction_id = \"\";\n\t\t\tm_send(reply);\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tobserver_ptr o = m_transactions[tid];\n\n\t\tif (!o)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with unknown transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr << \" (possibly timed out)\";\n#endif\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tif (m.addr != o->target_addr)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with incorrect address and valid transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr;\n#endif\n\t\t\treturn false;\n\t\t}\n\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tstd::ofstream reply_stats(\"libtorrent_logs\/round_trip_ms.log\", std::ios::app);\n\t\treply_stats << m.addr << \"\\t\" << total_milliseconds(time_now() - o->sent)\n\t\t\t<< std::endl;\n#endif\n\t\to->reply(m);\n\t\tm_transactions[tid] = 0;\n\t\t\n\t\tif (m.piggy_backed_ping)\n\t\t{\n\t\t\t\/\/ there is a ping request piggy\n\t\t\t\/\/ backed in this reply\n\t\t\tmsg ph;\n\t\t\tph.message_id = messages::ping;\n\t\t\tph.transaction_id = m.ping_transaction_id;\n\t\t\tph.addr = m.addr;\n\t\t\tph.reply = true;\n\t\t\t\n\t\t\treply(ph);\n\t\t}\n\t\treturn m_table.node_seen(m.id, m.addr);\n\t}\n\telse\n\t{\n\t\tTORRENT_ASSERT(m.message_id != messages::error);\n\t\t\/\/ this is an incoming request\n\t\tm_incoming(m);\n\t}\n\treturn false;\n}\n\ntime_duration rpc_manager::tick()\n{\n\tINVARIANT_CHECK;\n\n\tconst int timeout_ms = 10 * 1000;\n\n\t\/\/\tlook for observers that has timed out\n\n\tif (m_next_transaction_id == m_oldest_transaction_id) return milliseconds(timeout_ms);\n\n\tstd::vector<observer_ptr > timeouts;\n\n\tfor (;m_next_transaction_id != m_oldest_transaction_id;\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1) % max_transactions)\n\t{\n\t\tTORRENT_ASSERT(m_oldest_transaction_id >= 0);\n\t\tTORRENT_ASSERT(m_oldest_transaction_id < max_transactions);\n\n\t\tobserver_ptr o = m_transactions[m_oldest_transaction_id];\n\t\tif (!o) continue;\n\n\t\ttime_duration diff = o->sent + milliseconds(timeout_ms) - time_now();\n\t\tif (diff > seconds(0))\n\t\t{\n\t\t\tif (diff < seconds(1)) return seconds(1);\n\t\t\treturn diff;\n\t\t}\n\t\t\n\t\ttry\n\t\t{\n\t\t\tm_transactions[m_oldest_transaction_id] = 0;\n\t\t\ttimeouts.push_back(o);\n\t\t} catch (std::exception) {}\n\t}\n\t\n\tstd::for_each(timeouts.begin(), timeouts.end(), bind(&observer::timeout, _1));\n\ttimeouts.clear();\n\t\n\t\/\/ clear the aborted transactions, will likely\n\t\/\/ generate new requests. We need to swap, since the\n\t\/\/ destrutors may add more observers to the m_aborted_transactions\n\tstd::vector<observer_ptr >().swap(m_aborted_transactions);\n\treturn milliseconds(timeout_ms);\n}\n\nunsigned int rpc_manager::new_transaction_id(observer_ptr o)\n{\n\tINVARIANT_CHECK;\n\n\tunsigned int tid = m_next_transaction_id;\n\tm_next_transaction_id = (m_next_transaction_id + 1) % max_transactions;\n\tif (m_transactions[m_next_transaction_id])\n\t{\n\t\t\/\/ moving the observer into the set of aborted transactions\n\t\t\/\/ it will prevent it from spawning new requests right now,\n\t\t\/\/ since that would break the invariant\n\t\tm_aborted_transactions.push_back(m_transactions[m_next_transaction_id]);\n\t\tm_transactions[m_next_transaction_id] = 0;\n\t\tTORRENT_ASSERT(m_oldest_transaction_id == m_next_transaction_id);\n\t}\n\tTORRENT_ASSERT(!m_transactions[tid]);\n\tm_transactions[tid] = o;\n\tif (m_oldest_transaction_id == m_next_transaction_id)\n\t{\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1) % max_transactions;\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"WARNING: transaction limit reached! Too many concurrent\"\n\t\t\t\" messages! limit: \" << (int)max_transactions;\n#endif\n\t\tupdate_oldest_transaction_id();\n\t}\n\n\treturn tid;\n}\n\nvoid rpc_manager::update_oldest_transaction_id()\n{\n\tINVARIANT_CHECK;\n\n\tTORRENT_ASSERT(m_oldest_transaction_id != m_next_transaction_id);\n\twhile (!m_transactions[m_oldest_transaction_id])\n\t{\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1)\n\t\t\t% max_transactions;\n\t\tif (m_oldest_transaction_id == m_next_transaction_id)\n\t\t\tbreak;\n\t}\n}\n\nvoid rpc_manager::invoke(int message_id, udp::endpoint target_addr\n\t, observer_ptr o)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing)\n\t{\n\t\to->abort();\n\t\treturn;\n\t}\n\n\tmsg m;\n\tm.message_id = message_id;\n\tm.reply = false;\n\tm.id = m_our_id;\n\tm.addr = target_addr;\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n#ifndef NDEBUG\n\tint potential_new_id = m_next_transaction_id;\n#endif\n\ttry\n\t{\n\t\tm.transaction_id.clear();\n\t\tstd::back_insert_iterator<std::string> out(m.transaction_id);\n\t\tio::write_uint16(m_next_transaction_id, out);\n\t\t\n\t\to->send(m);\n\n\t\to->sent = time_now();\n\t\to->target_addr = target_addr;\n\n\t#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"Invoking \" << messages::ids[message_id] \n\t\t\t<< \" -> \" << target_addr;\n\t#endif\t\n\t\tm_send(m);\n\t\tnew_transaction_id(o);\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\t\/\/ m_send may fail with \"no route to host\"\n\t\tTORRENT_ASSERT(potential_new_id == m_next_transaction_id);\n\t\to->abort();\n\t}\n}\n\nvoid rpc_manager::reply(msg& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return;\n\n\tTORRENT_ASSERT(m.reply);\n\tm.piggy_backed_ping = false;\n\tm.id = m_our_id;\n\t\n\tm_send(m);\n}\n\nvoid rpc_manager::reply_with_ping(msg& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return;\n\tTORRENT_ASSERT(m.reply);\n\n\tm.piggy_backed_ping = true;\n\tm.id = m_our_id;\n\n\tm.ping_transaction_id.clear();\n\tstd::back_insert_iterator<std::string> out(m.ping_transaction_id);\n\tio::write_uint16(m_next_transaction_id, out);\n\n\tobserver_ptr o(new (allocator().malloc()) null_observer(allocator()));\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n\to->sent = time_now();\n\to->target_addr = m.addr;\n\t\t\n\tm_send(m);\n\tnew_transaction_id(o);\n}\n\n\n\n} } \/\/ namespace libtorrent::dht\n\n<commit_msg>updated dht verbose logging to try to catch #176<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n#include \"libtorrent\/socket.hpp\"\n\n#include <boost\/bind.hpp>\n#include <boost\/mpl\/max_element.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/sizeof.hpp>\n#include <boost\/mpl\/transform_view.hpp>\n#include <boost\/mpl\/deref.hpp>\n#include <boost\/lexical_cast.hpp>\n\n#include <libtorrent\/io.hpp>\n#include <libtorrent\/invariant_check.hpp>\n#include <libtorrent\/kademlia\/rpc_manager.hpp>\n#include <libtorrent\/kademlia\/logging.hpp>\n#include <libtorrent\/kademlia\/routing_table.hpp>\n#include <libtorrent\/kademlia\/find_data.hpp>\n#include <libtorrent\/kademlia\/closest_nodes.hpp>\n#include <libtorrent\/kademlia\/refresh.hpp>\n#include <libtorrent\/kademlia\/node.hpp>\n#include <libtorrent\/kademlia\/observer.hpp>\n#include <libtorrent\/hasher.hpp>\n\n#include <fstream>\n\nusing boost::shared_ptr;\nusing boost::bind;\n\nnamespace libtorrent { namespace dht\n{\n\nnamespace io = libtorrent::detail;\nnamespace mpl = boost::mpl;\n\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\nTORRENT_DEFINE_LOG(rpc)\n#endif\n\nvoid intrusive_ptr_add_ref(observer const* o)\n{\n\tTORRENT_ASSERT(o->m_refs >= 0);\n\tTORRENT_ASSERT(o != 0);\n\t++o->m_refs;\n}\n\nvoid intrusive_ptr_release(observer const* o)\n{\n\tTORRENT_ASSERT(o->m_refs > 0);\n\tTORRENT_ASSERT(o != 0);\n\tif (--o->m_refs == 0)\n\t{\n\t\tboost::pool<>& p = o->pool_allocator;\n\t\to->~observer();\n\t\tp.free(const_cast<observer*>(o));\n\t}\n}\n\nnode_id generate_id();\n\ntypedef mpl::vector<\n\tclosest_nodes_observer\n\t, find_data_observer\n\t, announce_observer\n\t, get_peers_observer\n\t, refresh_observer\n\t, ping_observer\n\t, null_observer\n\t> observer_types;\n\ntypedef mpl::max_element<\n\tmpl::transform_view<observer_types, mpl::sizeof_<mpl::_1> >\n >::type max_observer_type_iter;\n\nrpc_manager::rpc_manager(fun const& f, node_id const& our_id\n\t, routing_table& table, send_fun const& sf)\n\t: m_pool_allocator(sizeof(mpl::deref<max_observer_type_iter::base>::type))\n\t, m_next_transaction_id(rand() % max_transactions)\n\t, m_oldest_transaction_id(m_next_transaction_id)\n\t, m_incoming(f)\n\t, m_send(sf)\n\t, m_our_id(our_id)\n\t, m_table(table)\n\t, m_timer(time_now())\n\t, m_random_number(generate_id())\n\t, m_destructing(false)\n{\n\tstd::srand(time(0));\n}\n\nrpc_manager::~rpc_manager()\n{\n\tm_destructing = true;\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\tTORRENT_LOG(rpc) << \"Destructing\";\n#endif\n\tstd::for_each(m_aborted_transactions.begin(), m_aborted_transactions.end()\n\t\t, bind(&observer::abort, _1));\n\t\n\tfor (transactions_t::iterator i = m_transactions.begin()\n\t\t, end(m_transactions.end()); i != end; ++i)\n\t{\n\t\tif (*i) (*i)->abort();\n\t}\n}\n\n#ifndef NDEBUG\nvoid rpc_manager::check_invariant() const\n{\n\tTORRENT_ASSERT(m_oldest_transaction_id >= 0);\n\tTORRENT_ASSERT(m_oldest_transaction_id < max_transactions);\n\tTORRENT_ASSERT(m_next_transaction_id >= 0);\n\tTORRENT_ASSERT(m_next_transaction_id < max_transactions);\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n\n\tfor (int i = (m_next_transaction_id + 1) % max_transactions;\n\t\ti != m_oldest_transaction_id; i = (i + 1) % max_transactions)\n\t{\n\t\tTORRENT_ASSERT(!m_transactions[i]);\n\t}\n}\n#endif\n\nbool rpc_manager::incoming(msg const& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return false;\n\n\tif (m.reply)\n\t{\n\t\t\/\/ if we don't have the transaction id in our\n\t\t\/\/ request list, ignore the packet\n\n\t\tif (m.transaction_id.size() < 2)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with invalid transaction id size: \" \n\t\t\t\t<< m.transaction_id.size() << \" from \" << m.addr;\n#endif\n\t\t\tmsg reply;\n\t\t\treply.reply = true;\n\t\t\treply.message_id = messages::error;\n\t\t\treply.error_code = 203; \/\/ Protocol error\n\t\t\treply.error_msg = \"reply with invalid transaction id, size \"\n\t\t\t\t+ boost::lexical_cast<std::string>(m.transaction_id.size());\n\t\t\treply.addr = m.addr;\n\t\t\treply.transaction_id = \"\";\n\t\t\tm_send(reply);\n\t\t\treturn false;\n\t\t}\n\t\n\t\tstd::string::const_iterator i = m.transaction_id.begin();\t\n\t\tint tid = io::read_uint16(i);\n\n\t\tif (tid >= (int)m_transactions.size()\n\t\t\t|| tid < 0)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with invalid transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr;\n#endif\n\t\t\tmsg reply;\n\t\t\treply.reply = true;\n\t\t\treply.message_id = messages::error;\n\t\t\treply.error_code = 203; \/\/ Protocol error\n\t\t\treply.error_msg = \"reply with invalid transaction id\";\n\t\t\treply.addr = m.addr;\n\t\t\treply.transaction_id = \"\";\n\t\t\tm_send(reply);\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tobserver_ptr o = m_transactions[tid];\n\n\t\tif (!o)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with unknown transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr << \" (possibly timed out)\";\n#endif\n\t\t\treturn false;\n\t\t}\n\t\t\n\t\tif (m.addr != o->target_addr)\n\t\t{\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Reply with incorrect address and valid transaction id: \" \n\t\t\t\t<< tid << \" from \" << m.addr;\n#endif\n\t\t\treturn false;\n\t\t}\n\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tstd::ofstream reply_stats(\"libtorrent_logs\/round_trip_ms.log\", std::ios::app);\n\t\treply_stats << m.addr << \"\\t\" << total_milliseconds(time_now() - o->sent)\n\t\t\t<< std::endl;\n#endif\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"Reply with transaction id: \" \n\t\t\t<< tid << \" from \" << m.addr;\n#endif\n\t\to->reply(m);\n\t\tm_transactions[tid] = 0;\n\t\t\n\t\tif (m.piggy_backed_ping)\n\t\t{\n\t\t\t\/\/ there is a ping request piggy\n\t\t\t\/\/ backed in this reply\n\t\t\tmsg ph;\n\t\t\tph.message_id = messages::ping;\n\t\t\tph.transaction_id = m.ping_transaction_id;\n\t\t\tph.addr = m.addr;\n\t\t\tph.reply = true;\n\t\t\t\n\t\t\treply(ph);\n\t\t}\n\t\treturn m_table.node_seen(m.id, m.addr);\n\t}\n\telse\n\t{\n\t\tTORRENT_ASSERT(m.message_id != messages::error);\n\t\t\/\/ this is an incoming request\n\t\tm_incoming(m);\n\t}\n\treturn false;\n}\n\ntime_duration rpc_manager::tick()\n{\n\tINVARIANT_CHECK;\n\n\tconst int timeout_ms = 10 * 1000;\n\n\t\/\/\tlook for observers that has timed out\n\n\tif (m_next_transaction_id == m_oldest_transaction_id) return milliseconds(timeout_ms);\n\n\tstd::vector<observer_ptr > timeouts;\n\n\tfor (;m_next_transaction_id != m_oldest_transaction_id;\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1) % max_transactions)\n\t{\n\t\tTORRENT_ASSERT(m_oldest_transaction_id >= 0);\n\t\tTORRENT_ASSERT(m_oldest_transaction_id < max_transactions);\n\n\t\tobserver_ptr o = m_transactions[m_oldest_transaction_id];\n\t\tif (!o) continue;\n\n\t\ttime_duration diff = o->sent + milliseconds(timeout_ms) - time_now();\n\t\tif (diff > seconds(0))\n\t\t{\n\t\t\tif (diff < seconds(1)) return seconds(1);\n\t\t\treturn diff;\n\t\t}\n\t\t\n\t\ttry\n\t\t{\n\t\t\tm_transactions[m_oldest_transaction_id] = 0;\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\t\tTORRENT_LOG(rpc) << \"Timing out transaction id: \" \n\t\t\t\t<< m_oldest_transaction_id << \" from \" << o->target_addr;\n#endif\n\t\t\ttimeouts.push_back(o);\n\t\t} catch (std::exception) {}\n\t}\n\t\n\tstd::for_each(timeouts.begin(), timeouts.end(), bind(&observer::timeout, _1));\n\ttimeouts.clear();\n\t\n\t\/\/ clear the aborted transactions, will likely\n\t\/\/ generate new requests. We need to swap, since the\n\t\/\/ destrutors may add more observers to the m_aborted_transactions\n\tstd::vector<observer_ptr >().swap(m_aborted_transactions);\n\treturn milliseconds(timeout_ms);\n}\n\nunsigned int rpc_manager::new_transaction_id(observer_ptr o)\n{\n\tINVARIANT_CHECK;\n\n\tunsigned int tid = m_next_transaction_id;\n\tm_next_transaction_id = (m_next_transaction_id + 1) % max_transactions;\n\tif (m_transactions[m_next_transaction_id])\n\t{\n\t\t\/\/ moving the observer into the set of aborted transactions\n\t\t\/\/ it will prevent it from spawning new requests right now,\n\t\t\/\/ since that would break the invariant\n\t\tobserver_ptr o = m_transactions[m_next_transaction_id];\n\t\tm_aborted_transactions.push_back(o);\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"[new_transaction_id] Aborting message with transaction id: \" \n\t\t\t<< m_next_transaction_id << \" sent to \" << o->target_addr\n\t\t\t<< \" at \" << o->sent;\n#endif\n\t\tm_transactions[m_next_transaction_id] = 0;\n\t\tTORRENT_ASSERT(m_oldest_transaction_id == m_next_transaction_id);\n\t}\n\tTORRENT_ASSERT(!m_transactions[tid]);\n\tm_transactions[tid] = o;\n\tif (m_oldest_transaction_id == m_next_transaction_id)\n\t{\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1) % max_transactions;\n#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"WARNING: transaction limit reached! Too many concurrent\"\n\t\t\t\" messages! limit: \" << (int)max_transactions;\n#endif\n\t\tupdate_oldest_transaction_id();\n\t}\n\n\treturn tid;\n}\n\nvoid rpc_manager::update_oldest_transaction_id()\n{\n\tINVARIANT_CHECK;\n\n\tTORRENT_ASSERT(m_oldest_transaction_id != m_next_transaction_id);\n\twhile (!m_transactions[m_oldest_transaction_id])\n\t{\n\t\tm_oldest_transaction_id = (m_oldest_transaction_id + 1)\n\t\t\t% max_transactions;\n\t\tif (m_oldest_transaction_id == m_next_transaction_id)\n\t\t\tbreak;\n\t}\n}\n\nvoid rpc_manager::invoke(int message_id, udp::endpoint target_addr\n\t, observer_ptr o)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing)\n\t{\n\t\to->abort();\n\t\treturn;\n\t}\n\n\tmsg m;\n\tm.message_id = message_id;\n\tm.reply = false;\n\tm.id = m_our_id;\n\tm.addr = target_addr;\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n#ifndef NDEBUG\n\tint potential_new_id = m_next_transaction_id;\n#endif\n\ttry\n\t{\n\t\tm.transaction_id.clear();\n\t\tstd::back_insert_iterator<std::string> out(m.transaction_id);\n\t\tio::write_uint16(m_next_transaction_id, out);\n\t\t\n\t\to->send(m);\n\n\t\to->sent = time_now();\n\t\to->target_addr = target_addr;\n\n\t#ifdef TORRENT_DHT_VERBOSE_LOGGING\n\t\tTORRENT_LOG(rpc) << \"Invoking \" << messages::ids[message_id] \n\t\t\t<< \" -> \" << target_addr;\n\t#endif\t\n\t\tm_send(m);\n\t\tnew_transaction_id(o);\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\t\/\/ m_send may fail with \"no route to host\"\n\t\tTORRENT_ASSERT(potential_new_id == m_next_transaction_id);\n\t\to->abort();\n\t}\n}\n\nvoid rpc_manager::reply(msg& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return;\n\n\tTORRENT_ASSERT(m.reply);\n\tm.piggy_backed_ping = false;\n\tm.id = m_our_id;\n\t\n\tm_send(m);\n}\n\nvoid rpc_manager::reply_with_ping(msg& m)\n{\n\tINVARIANT_CHECK;\n\n\tif (m_destructing) return;\n\tTORRENT_ASSERT(m.reply);\n\n\tm.piggy_backed_ping = true;\n\tm.id = m_our_id;\n\n\tm.ping_transaction_id.clear();\n\tstd::back_insert_iterator<std::string> out(m.ping_transaction_id);\n\tio::write_uint16(m_next_transaction_id, out);\n\n\tobserver_ptr o(new (allocator().malloc()) null_observer(allocator()));\n\tTORRENT_ASSERT(!m_transactions[m_next_transaction_id]);\n\to->sent = time_now();\n\to->target_addr = m.addr;\n\t\t\n\tm_send(m);\n\tnew_transaction_id(o);\n}\n\n\n\n} } \/\/ namespace libtorrent::dht\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Revert 47746 - Reenabling TestAboutChromeViewAccObj.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <oleacc.h>\n\n#include \"app\/l10n_util.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/browser\/views\/bookmark_bar_view.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"views\/accessibility\/view_accessibility_wrapper.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget_win.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nVARIANT id_self = {VT_I4, CHILDID_SELF};\n\n\/\/ Dummy class to force creation of ATL module, needed by COM to instantiate\n\/\/ ViewAccessibility.\nclass TestAtlModule : public CAtlDllModuleT< TestAtlModule > {};\nTestAtlModule test_atl_module_;\n\nclass BrowserViewsAccessibilityTest : public InProcessBrowserTest {\n public:\n BrowserViewsAccessibilityTest() {\n ::CoInitialize(NULL);\n }\n\n ~BrowserViewsAccessibilityTest() {\n ::CoUninitialize();\n }\n\n \/\/ Retrieves an instance of BrowserWindowTesting\n BrowserWindowTesting* GetBrowserWindowTesting() {\n BrowserWindow* browser_window = browser()->window();\n\n if (!browser_window)\n return NULL;\n\n return browser_window->GetBrowserWindowTesting();\n }\n\n \/\/ Retrieve an instance of BrowserView\n BrowserView* GetBrowserView() {\n return BrowserView::GetBrowserViewForNativeWindow(\n browser()->window()->GetNativeHandle());\n }\n\n \/\/ Retrieves and initializes an instance of LocationBarView.\n LocationBarView* GetLocationBarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return GetBrowserWindowTesting()->GetLocationBarView();\n }\n\n \/\/ Retrieves and initializes an instance of ToolbarView.\n ToolbarView* GetToolbarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return browser_window_testing->GetToolbarView();\n }\n\n \/\/ Retrieves and initializes an instance of BookmarkBarView.\n BookmarkBarView* GetBookmarkBarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return browser_window_testing->GetBookmarkBarView();\n }\n\n \/\/ Retrieves and verifies the accessibility object for the given View.\n void TestViewAccessibilityObject(views::View* view, std::wstring name,\n int32 role) {\n ASSERT_TRUE(NULL != view);\n\n IAccessible* acc_obj = NULL;\n HRESULT hr = view->GetViewAccessibilityWrapper()->GetInstance(\n IID_IAccessible, reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n TestAccessibilityInfo(acc_obj, name, role);\n }\n\n\n \/\/ Verifies MSAA Name and Role properties of the given IAccessible.\n void TestAccessibilityInfo(IAccessible* acc_obj, std::wstring name,\n int32 role) {\n \/\/ Verify MSAA Name property.\n BSTR acc_name;\n\n HRESULT hr = acc_obj->get_accName(id_self, &acc_name);\n ASSERT_EQ(S_OK, hr);\n EXPECT_STREQ(acc_name, name.c_str());\n\n \/\/ Verify MSAA Role property.\n VARIANT acc_role;\n ::VariantInit(&acc_role);\n\n hr = acc_obj->get_accRole(id_self, &acc_role);\n ASSERT_EQ(S_OK, hr);\n EXPECT_EQ(VT_I4, acc_role.vt);\n EXPECT_EQ(role, acc_role.lVal);\n\n ::VariantClear(&acc_role);\n ::SysFreeString(acc_name);\n }\n};\n\n\/\/ Retrieve accessibility object for main window and verify accessibility info.\n\/\/ Fails, http:\/\/crbug.com\/44486.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestChromeWindowAccObj) {\n BrowserWindow* browser_window = browser()->window();\n ASSERT_TRUE(NULL != browser_window);\n\n HWND hwnd = browser_window->GetNativeHandle();\n ASSERT_TRUE(NULL != hwnd);\n\n \/\/ Get accessibility object.\n IAccessible* acc_obj = NULL;\n HRESULT hr = ::AccessibleObjectFromWindow(hwnd, OBJID_WINDOW, IID_IAccessible,\n reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n ui_test_utils::NavigateToURL(browser(), GURL(chrome::kAboutBlankURL));\n std::wstring title =\n l10n_util::GetStringF(IDS_BROWSER_WINDOW_TITLE_FORMAT,\n ASCIIToWide(chrome::kAboutBlankURL));\n TestAccessibilityInfo(acc_obj, title, ROLE_SYSTEM_WINDOW);\n\n acc_obj->Release();\n}\n\n\/\/ Retrieve accessibility object for non client view and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestNonClientViewAccObj) {\n views::View* non_client_view =\n GetBrowserView()->GetWindow()->GetNonClientView();\n\n TestViewAccessibilityObject(non_client_view,\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_WINDOW);\n}\n\n\/\/ Retrieve accessibility object for browser root view and verify\n\/\/ accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestBrowserRootViewAccObj) {\n views::View* browser_root_view =\n GetBrowserView()->frame()->GetFrameView()->GetRootView();\n\n TestViewAccessibilityObject(browser_root_view,\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_APPLICATION);\n}\n\n\/\/ Retrieve accessibility object for browser view and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestBrowserViewAccObj) {\n \/\/ Verify root view MSAA name and role.\n TestViewAccessibilityObject(GetBrowserView(),\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_CLIENT);\n}\n\n\/\/ Retrieve accessibility object for toolbar view and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestToolbarViewAccObj) {\n \/\/ Verify toolbar MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView(),\n l10n_util::GetString(IDS_ACCNAME_TOOLBAR),\n ROLE_SYSTEM_TOOLBAR);\n}\n\n\/\/ Retrieve accessibility object for Back button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestBackButtonAccObj) {\n \/\/ Verify Back button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_BACK_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_BACK), ROLE_SYSTEM_BUTTONDROPDOWN);\n}\n\n\/\/ Retrieve accessibility object for Forward button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestForwardButtonAccObj) {\n \/\/ Verify Forward button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_FORWARD_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_FORWARD), ROLE_SYSTEM_BUTTONDROPDOWN);\n}\n\n\/\/ Retrieve accessibility object for Reload button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestReloadButtonAccObj) {\n \/\/ Verify Reload button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_RELOAD_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_RELOAD), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Home button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestHomeButtonAccObj) {\n \/\/ Verify Home button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_HOME_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_HOME), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Star button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestStarButtonAccObj) {\n \/\/ Verify Star button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_STAR_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_STAR), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for location bar view and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestLocationBarViewAccObj) {\n \/\/ Verify location bar MSAA name and role.\n TestViewAccessibilityObject(GetLocationBarView(),\n l10n_util::GetString(IDS_ACCNAME_LOCATION),\n ROLE_SYSTEM_GROUPING);\n}\n\n\/\/ Retrieve accessibility object for Go button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestGoButtonAccObj) {\n \/\/ Verify Go button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_GO_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_GO),\n ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Page menu button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestPageMenuAccObj) {\n \/\/ Verify Page menu button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_PAGE_MENU),\n l10n_util::GetString(IDS_ACCNAME_PAGE),\n ROLE_SYSTEM_BUTTONMENU);\n}\n\n\/\/ Retrieve accessibility object for App menu button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestAppMenuAccObj) {\n \/\/ Verify App menu button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_APP_MENU),\n l10n_util::GetString(IDS_ACCNAME_APP),\n ROLE_SYSTEM_BUTTONMENU);\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestBookmarkBarViewAccObj) {\n TestViewAccessibilityObject(GetBookmarkBarView(),\n l10n_util::GetString(IDS_ACCNAME_BOOKMARKS),\n ROLE_SYSTEM_TOOLBAR);\n}\n\n\/\/ Fails, http:\/\/crbug.com\/44486.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestAboutChromeViewAccObj) {\n \/\/ Firstly, test that the WindowDelegate got updated.\n views::Window* aboutChromeWindow = GetBrowserView()->ShowAboutChromeDialog();\n EXPECT_STREQ(aboutChromeWindow->GetDelegate()->GetWindowTitle().c_str(),\n l10n_util::GetString(IDS_ABOUT_CHROME_TITLE).c_str());\n EXPECT_EQ(aboutChromeWindow->GetDelegate()->accessible_role(),\n AccessibilityTypes::ROLE_DIALOG);\n\n \/\/ Also test the accessibility object directly.\n IAccessible* acc_obj = NULL;\n HRESULT hr =\n ::AccessibleObjectFromWindow(aboutChromeWindow->GetNativeWindow(),\n OBJID_CLIENT,\n IID_IAccessible,\n reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n TestAccessibilityInfo(acc_obj, l10n_util::GetString(IDS_ABOUT_CHROME_TITLE),\n ROLE_SYSTEM_DIALOG);\n\n acc_obj->Release();\n}\n} \/\/ Namespace.\n\n<commit_msg>Revert 47739 - Fix failure of browser_tests:BrowserViewsAccessibilityTest.TestChromeWindowAccObj<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <oleacc.h>\n\n#include \"app\/l10n_util.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/browser\/views\/bookmark_bar_view.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"views\/accessibility\/view_accessibility_wrapper.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget_win.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nVARIANT id_self = {VT_I4, CHILDID_SELF};\n\n\/\/ Dummy class to force creation of ATL module, needed by COM to instantiate\n\/\/ ViewAccessibility.\nclass TestAtlModule : public CAtlDllModuleT< TestAtlModule > {};\nTestAtlModule test_atl_module_;\n\nclass BrowserViewsAccessibilityTest : public InProcessBrowserTest {\n public:\n BrowserViewsAccessibilityTest() {\n ::CoInitialize(NULL);\n }\n\n ~BrowserViewsAccessibilityTest() {\n ::CoUninitialize();\n }\n\n \/\/ Retrieves an instance of BrowserWindowTesting\n BrowserWindowTesting* GetBrowserWindowTesting() {\n BrowserWindow* browser_window = browser()->window();\n\n if (!browser_window)\n return NULL;\n\n return browser_window->GetBrowserWindowTesting();\n }\n\n \/\/ Retrieve an instance of BrowserView\n BrowserView* GetBrowserView() {\n return BrowserView::GetBrowserViewForNativeWindow(\n browser()->window()->GetNativeHandle());\n }\n\n \/\/ Retrieves and initializes an instance of LocationBarView.\n LocationBarView* GetLocationBarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return GetBrowserWindowTesting()->GetLocationBarView();\n }\n\n \/\/ Retrieves and initializes an instance of ToolbarView.\n ToolbarView* GetToolbarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return browser_window_testing->GetToolbarView();\n }\n\n \/\/ Retrieves and initializes an instance of BookmarkBarView.\n BookmarkBarView* GetBookmarkBarView() {\n BrowserWindowTesting* browser_window_testing = GetBrowserWindowTesting();\n\n if (!browser_window_testing)\n return NULL;\n\n return browser_window_testing->GetBookmarkBarView();\n }\n\n \/\/ Retrieves and verifies the accessibility object for the given View.\n void TestViewAccessibilityObject(views::View* view, std::wstring name,\n int32 role) {\n ASSERT_TRUE(NULL != view);\n\n IAccessible* acc_obj = NULL;\n HRESULT hr = view->GetViewAccessibilityWrapper()->GetInstance(\n IID_IAccessible, reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n TestAccessibilityInfo(acc_obj, name, role);\n }\n\n\n \/\/ Verifies MSAA Name and Role properties of the given IAccessible.\n void TestAccessibilityInfo(IAccessible* acc_obj, std::wstring name,\n int32 role) {\n \/\/ Verify MSAA Name property.\n BSTR acc_name;\n\n HRESULT hr = acc_obj->get_accName(id_self, &acc_name);\n ASSERT_EQ(S_OK, hr);\n EXPECT_STREQ(acc_name, name.c_str());\n\n \/\/ Verify MSAA Role property.\n VARIANT acc_role;\n ::VariantInit(&acc_role);\n\n hr = acc_obj->get_accRole(id_self, &acc_role);\n ASSERT_EQ(S_OK, hr);\n EXPECT_EQ(VT_I4, acc_role.vt);\n EXPECT_EQ(role, acc_role.lVal);\n\n ::VariantClear(&acc_role);\n ::SysFreeString(acc_name);\n }\n};\n\n\/\/ Retrieve accessibility object for main window and verify accessibility info.\n\/\/ Fails, http:\/\/crbug.com\/44486.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n FAILS_TestChromeWindowAccObj) {\n BrowserWindow* browser_window = browser()->window();\n ASSERT_TRUE(NULL != browser_window);\n\n HWND hwnd = browser_window->GetNativeHandle();\n ASSERT_TRUE(NULL != hwnd);\n\n \/\/ Get accessibility object.\n IAccessible* acc_obj = NULL;\n HRESULT hr = ::AccessibleObjectFromWindow(hwnd, OBJID_WINDOW, IID_IAccessible,\n reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n \/\/ TODO(ctguil): Fix. The window title could be \"New Tab - Chromium\" or\n \/\/ \"about:blank - Chromium\"\n TestAccessibilityInfo(acc_obj, l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_WINDOW);\n\n acc_obj->Release();\n}\n\n\/\/ Retrieve accessibility object for non client view and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestNonClientViewAccObj) {\n views::View* non_client_view =\n GetBrowserView()->GetWindow()->GetNonClientView();\n\n TestViewAccessibilityObject(non_client_view,\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_WINDOW);\n}\n\n\/\/ Retrieve accessibility object for browser root view and verify\n\/\/ accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestBrowserRootViewAccObj) {\n views::View* browser_root_view =\n GetBrowserView()->frame()->GetFrameView()->GetRootView();\n\n TestViewAccessibilityObject(browser_root_view,\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_APPLICATION);\n}\n\n\/\/ Retrieve accessibility object for browser view and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestBrowserViewAccObj) {\n \/\/ Verify root view MSAA name and role.\n TestViewAccessibilityObject(GetBrowserView(),\n l10n_util::GetString(IDS_PRODUCT_NAME),\n ROLE_SYSTEM_CLIENT);\n}\n\n\/\/ Retrieve accessibility object for toolbar view and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestToolbarViewAccObj) {\n \/\/ Verify toolbar MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView(),\n l10n_util::GetString(IDS_ACCNAME_TOOLBAR),\n ROLE_SYSTEM_TOOLBAR);\n}\n\n\/\/ Retrieve accessibility object for Back button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestBackButtonAccObj) {\n \/\/ Verify Back button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_BACK_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_BACK), ROLE_SYSTEM_BUTTONDROPDOWN);\n}\n\n\/\/ Retrieve accessibility object for Forward button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestForwardButtonAccObj) {\n \/\/ Verify Forward button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_FORWARD_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_FORWARD), ROLE_SYSTEM_BUTTONDROPDOWN);\n}\n\n\/\/ Retrieve accessibility object for Reload button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestReloadButtonAccObj) {\n \/\/ Verify Reload button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_RELOAD_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_RELOAD), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Home button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestHomeButtonAccObj) {\n \/\/ Verify Home button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_HOME_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_HOME), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Star button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestStarButtonAccObj) {\n \/\/ Verify Star button MSAA name and role.\n TestViewAccessibilityObject(\n GetToolbarView()->GetViewByID(VIEW_ID_STAR_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_STAR), ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for location bar view and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestLocationBarViewAccObj) {\n \/\/ Verify location bar MSAA name and role.\n TestViewAccessibilityObject(GetLocationBarView(),\n l10n_util::GetString(IDS_ACCNAME_LOCATION),\n ROLE_SYSTEM_GROUPING);\n}\n\n\/\/ Retrieve accessibility object for Go button and verify accessibility info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestGoButtonAccObj) {\n \/\/ Verify Go button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_GO_BUTTON),\n l10n_util::GetString(IDS_ACCNAME_GO),\n ROLE_SYSTEM_PUSHBUTTON);\n}\n\n\/\/ Retrieve accessibility object for Page menu button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestPageMenuAccObj) {\n \/\/ Verify Page menu button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_PAGE_MENU),\n l10n_util::GetString(IDS_ACCNAME_PAGE),\n ROLE_SYSTEM_BUTTONMENU);\n}\n\n\/\/ Retrieve accessibility object for App menu button and verify accessibility\n\/\/ info.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest, TestAppMenuAccObj) {\n \/\/ Verify App menu button MSAA name and role.\n TestViewAccessibilityObject(GetToolbarView()->GetViewByID(VIEW_ID_APP_MENU),\n l10n_util::GetString(IDS_ACCNAME_APP),\n ROLE_SYSTEM_BUTTONMENU);\n}\n\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestBookmarkBarViewAccObj) {\n TestViewAccessibilityObject(GetBookmarkBarView(),\n l10n_util::GetString(IDS_ACCNAME_BOOKMARKS),\n ROLE_SYSTEM_TOOLBAR);\n}\n\n\/\/ Fails, http:\/\/crbug.com\/44486.\nIN_PROC_BROWSER_TEST_F(BrowserViewsAccessibilityTest,\n TestAboutChromeViewAccObj) {\n \/\/ Firstly, test that the WindowDelegate got updated.\n views::Window* aboutChromeWindow = GetBrowserView()->ShowAboutChromeDialog();\n EXPECT_STREQ(aboutChromeWindow->GetDelegate()->GetWindowTitle().c_str(),\n l10n_util::GetString(IDS_ABOUT_CHROME_TITLE).c_str());\n EXPECT_EQ(aboutChromeWindow->GetDelegate()->accessible_role(),\n AccessibilityTypes::ROLE_DIALOG);\n\n \/\/ Also test the accessibility object directly.\n IAccessible* acc_obj = NULL;\n HRESULT hr =\n ::AccessibleObjectFromWindow(aboutChromeWindow->GetNativeWindow(),\n OBJID_CLIENT,\n IID_IAccessible,\n reinterpret_cast<void**>(&acc_obj));\n ASSERT_EQ(S_OK, hr);\n ASSERT_TRUE(NULL != acc_obj);\n\n TestAccessibilityInfo(acc_obj, l10n_util::GetString(IDS_ABOUT_CHROME_TITLE),\n ROLE_SYSTEM_DIALOG);\n\n acc_obj->Release();\n}\n} \/\/ Namespace.\n\n<|endoftext|>"} {"text":"<commit_before>#include \"config.hpp\"\n\nvoid to_property(nl::expr_ptr expr, property_type &dst)\n{\n if (!expr)\n throw cor::Error(\"to_property: Null\");\n\n switch(expr->type()) {\n case nl::Expr::String:\n dst = expr->value();\n break;\n case nl::Expr::Integer:\n dst = (long)*expr;\n break;\n case nl::Expr::Real:\n dst = (double)*expr;\n break;\n default:\n throw cor::Error(\"%s is not compatible with Any\",\n expr->value().c_str());\n }\n}\n\nstd::string to_string(property_type const &p)\n{\n std::string res;\n boost::apply_visitor(AnyToString(res), p);\n return res;\n}\n\nstd::string Property::defval() const\n{\n return to_string(defval_);\n}\n\nint Property::mode(int umask) const\n{\n int res = 0;\n if (access_ & Read)\n res |= 0444;\n if (access_ & Write)\n res |= 0222;\n return res & ~umask;\n}\n\nnl::env_ptr mk_parse_env()\n{\n using namespace nl;\n lambda_type plugin = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name, path;\n src.required(to_string, name).required(to_string, path);\n\n Plugin::storage_type namespaces;\n push_rest_casted(src, namespaces);\n return expr_ptr(new Plugin(name, path, std::move(namespaces)));\n };\n\n lambda_type prop = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name;\n property_type defval;\n src.required(to_string, name).required(to_property, defval);\n\n std::unordered_map<std::string, property_type> options = {\n {\"type\", \"discrete\"}\n };\n rest(src, [](expr_ptr &) {},\n [&options](expr_ptr &k, expr_ptr &v) {\n auto &p = options[k->value()];\n to_property(v, p);\n });\n unsigned access = Property::Read;\n if (to_string(options[\"type\"]) == \"discrete\")\n access |= Property::Subscribe;\n expr_ptr res(new Property(name, defval, access));\n\n return res;\n };\n\n lambda_type ns = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name;\n src.required(to_string, name);\n\n Namespace::storage_type props;\n push_rest_casted(src, props);\n expr_ptr res(new Namespace(name, std::move(props)));\n return res;\n };\n\n env_ptr env(new Env\n ({ mk_record(\"plugin\", plugin),\n mk_record(\"ns\", ns),\n mk_record(\"prop\", prop),\n mk_const(\"false\", \"0\"),\n }));\n return env;\n}\n<commit_msg>configuration constants<commit_after>#include \"config.hpp\"\n\nvoid to_property(nl::expr_ptr expr, property_type &dst)\n{\n if (!expr)\n throw cor::Error(\"to_property: Null\");\n\n switch(expr->type()) {\n case nl::Expr::String:\n dst = expr->value();\n break;\n case nl::Expr::Integer:\n dst = (long)*expr;\n break;\n case nl::Expr::Real:\n dst = (double)*expr;\n break;\n default:\n throw cor::Error(\"%s is not compatible with Any\",\n expr->value().c_str());\n }\n}\n\nstd::string to_string(property_type const &p)\n{\n std::string res;\n boost::apply_visitor(AnyToString(res), p);\n return res;\n}\n\nstd::string Property::defval() const\n{\n return to_string(defval_);\n}\n\nint Property::mode(int umask) const\n{\n int res = 0;\n if (access_ & Read)\n res |= 0444;\n if (access_ & Write)\n res |= 0222;\n return res & ~umask;\n}\n\nnl::env_ptr mk_parse_env()\n{\n using namespace nl;\n lambda_type plugin = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name, path;\n src.required(to_string, name).required(to_string, path);\n\n Plugin::storage_type namespaces;\n push_rest_casted(src, namespaces);\n return expr_ptr(new Plugin(name, path, std::move(namespaces)));\n };\n\n lambda_type prop = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name;\n property_type defval;\n src.required(to_string, name).required(to_property, defval);\n\n std::unordered_map<std::string, property_type> options = {\n {\"type\", \"discrete\"}\n };\n rest(src, [](expr_ptr &) {},\n [&options](expr_ptr &k, expr_ptr &v) {\n auto &p = options[k->value()];\n to_property(v, p);\n });\n unsigned access = Property::Read;\n if (to_string(options[\"type\"]) == \"discrete\")\n access |= Property::Subscribe;\n expr_ptr res(new Property(name, defval, access));\n\n return res;\n };\n\n lambda_type ns = [](env_ptr, expr_list_type ¶ms) {\n ListAccessor src(params);\n std::string name;\n src.required(to_string, name);\n\n Namespace::storage_type props;\n push_rest_casted(src, props);\n expr_ptr res(new Namespace(name, std::move(props)));\n return res;\n };\n\n env_ptr env(new Env({\n mk_record(\"plugin\", plugin),\n mk_record(\"ns\", ns),\n mk_record(\"prop\", prop),\n mk_const(\"false\", 0),\n mk_const(\"true\", 0),\n mk_const(\"discrete\", Property::Subscribe),\n mk_const(\"continuous\", 0),\n mk_const(\"rw\", Property::Write | Property::Read),\n }));\n return env;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"mpdas.h\"\n\nCConfig* Config = 0;\n\nvoid\nCConfig::ParseLine(std::string line)\n{\n\tstd::vector<std::string> tokens;\n\tchar* pstr = 0;\n\tchar* szline = new char[line.size()+1];\n\n\tstrncpy(szline, line.c_str(), line.size()+1);\n\n\tpstr = strtok(szline, \" :=\\t\");\n\twhile(pstr) {\n\t\ttokens.push_back(pstr);\n\t\tpstr = strtok(NULL, \" :=\\t\");\n\t}\n\tdelete szline;\n\n\tif(tokens.size() > 1) {\n\t\tif(tokens[0] == \"username\")\n\t\t\t_lusername = tokens[1];\n\t\telse if(tokens[0] == \"password\")\n\t\t\t_lpassword = tokens[1];\n\t\telse if(tokens[0] == \"host\")\n\t\t\t_mhost = tokens[1];\n\t\telse if(tokens[0] == \"mpdpassword\")\n\t\t\t_mpassword = tokens[1];\n\t\telse if(tokens[0] == \"port\")\n\t\t\t_mport = atoi(tokens[1].c_str());\n\t\telse if(tokens[0] == \"runas\")\n\t\t\t_runninguser = tokens[1];\n\n\t}\n}\n\nvoid\nCConfig::LoadConfig(std::string path)\n{\n\tstd::string line = \"\";\n\n\tstd::ifstream ifs(path.c_str(), std::ios::in);\n\n\tif(!ifs.good()) {\n\t\teprintf(\"Config file (%s) does not exist or is not readable.\", path.c_str());\n\t\texit(EXIT_FAILURE);\n\t}\n\n\twhile(ifs.good()) {\n\t\tgetline(ifs, line);\n\t\tParseLine(line);\n\t}\n\n\tif(!_lusername.size() || !_lpassword.size()) {\n\t\teprintf(\"%s\", \"AudioScrobbler username or password not set.\");\n\t\texit(EXIT_FAILURE);\n\t}\n\n}\n\nCConfig::CConfig(char* cfg)\n{\n\t\/* Set optional settings to default *\/\n\t_mhost = \"localhost\";\n\t_mport = 6600;\n\n\tstd::string path = \"\";\n\n\tif(!cfg) {\n\t\tpath = CONFDIR;\n\t\tpath.append(\"\/mpdasrc\");\n\t\tif(!fileexists(path.c_str())) {\n\t\t\tiprintf(\"Global config (%s) does not exist. Falling back to home directory.\", path.c_str());\n\t\t\tpath = getenv(\"HOME\");\n\t\t\tpath.append(\"\/.mpdasrc\");\n\t\t}\n\t}\n\telse {\n\t\tpath = cfg;\n\t}\n\n\tLoadConfig(path);\n}\n<commit_msg>load global config first and then the config in home dir<commit_after>#include \"mpdas.h\"\n\nCConfig* Config = 0;\n\nvoid\nCConfig::ParseLine(std::string line)\n{\n\tstd::vector<std::string> tokens;\n\tchar* pstr = 0;\n\tchar* szline = new char[line.size()+1];\n\n\tstrncpy(szline, line.c_str(), line.size()+1);\n\n\tpstr = strtok(szline, \" :=\\t\");\n\twhile(pstr) {\n\t\ttokens.push_back(pstr);\n\t\tpstr = strtok(NULL, \" :=\\t\");\n\t}\n\tdelete szline;\n\n\tif(tokens.size() > 1) {\n\t\tif(tokens[0] == \"username\")\n\t\t\t_lusername = tokens[1];\n\t\telse if(tokens[0] == \"password\")\n\t\t\t_lpassword = tokens[1];\n\t\telse if(tokens[0] == \"host\")\n\t\t\t_mhost = tokens[1];\n\t\telse if(tokens[0] == \"mpdpassword\")\n\t\t\t_mpassword = tokens[1];\n\t\telse if(tokens[0] == \"port\")\n\t\t\t_mport = atoi(tokens[1].c_str());\n\t\telse if(tokens[0] == \"runas\")\n\t\t\t_runninguser = tokens[1];\n\n\t}\n}\n\nvoid\nCConfig::LoadConfig(std::string path)\n{\n\tstd::string line = \"\";\n\n\tstd::ifstream ifs(path.c_str(), std::ios::in);\n\n\tif(!ifs.good()) {\n\t\tiprintf(\"Config file (%s) does not exist or is not readable.\", path.c_str());\n\t\treturn;\n\t}\n\n\twhile(ifs.good()) {\n\t\tgetline(ifs, line);\n\t\tParseLine(line);\n\t}\n\n}\n\nCConfig::CConfig(char* cfg)\n{\n\t\/* Set optional settings to default *\/\n\t_mhost = \"localhost\";\n\t_mport = 6600;\n\n\tstd::string path = \"\";\n\n\tif(!cfg) {\n\t\tpath = CONFDIR;\n\t\tpath.append(\"\/mpdasrc\");\n\t}\n\telse {\n\t\tpath = cfg;\n\t}\n\n\tLoadConfig(path);\n\n\t\/\/ Load config in home dir as well (if possible)\n\tpath = getenv(\"HOME\");\n\tpath.append(\"\/.mpdasrc\");\n\tLoadConfig(path);\n\n\tif(!_lusername.size() || !_lpassword.size()) {\n\t\teprintf(\"%s\", \"AudioScrobbler username or password not set.\");\n\t\texit(EXIT_FAILURE);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- PPCInstPrinter.cpp - Convert PPC MCInst to assembly syntax --------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This class prints an PPC MCInst to a .s file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"PPCInstPrinter.h\"\n#include \"MCTargetDesc\/PPCMCTargetDesc.h\"\n#include \"MCTargetDesc\/PPCPredicates.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCSymbol.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetOpcodes.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"asm-printer\"\n\n\/\/ FIXME: Once the integrated assembler supports full register names, tie this\n\/\/ to the verbose-asm setting.\nstatic cl::opt<bool>\nFullRegNames(\"ppc-asm-full-reg-names\", cl::Hidden, cl::init(false),\n cl::desc(\"Use full register names when printing assembly\"));\n\n#include \"PPCGenAsmWriter.inc\"\n\nvoid PPCInstPrinter::printRegName(raw_ostream &OS, unsigned RegNo) const {\n OS << getRegisterName(RegNo);\n}\n\nvoid PPCInstPrinter::printInst(const MCInst *MI, raw_ostream &O,\n StringRef Annot) {\n \/\/ Check for slwi\/srwi mnemonics.\n if (MI->getOpcode() == PPC::RLWINM) {\n unsigned char SH = MI->getOperand(2).getImm();\n unsigned char MB = MI->getOperand(3).getImm();\n unsigned char ME = MI->getOperand(4).getImm();\n bool useSubstituteMnemonic = false;\n if (SH <= 31 && MB == 0 && ME == (31-SH)) {\n O << \"\\tslwi \"; useSubstituteMnemonic = true;\n }\n if (SH <= 31 && MB == (32-SH) && ME == 31) {\n O << \"\\tsrwi \"; useSubstituteMnemonic = true;\n SH = 32-SH;\n }\n if (useSubstituteMnemonic) {\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n O << \", \" << (unsigned int)SH;\n\n printAnnotation(O, Annot);\n return;\n }\n }\n \n if ((MI->getOpcode() == PPC::OR || MI->getOpcode() == PPC::OR8) &&\n MI->getOperand(1).getReg() == MI->getOperand(2).getReg()) {\n O << \"\\tmr \";\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n printAnnotation(O, Annot);\n return;\n }\n \n if (MI->getOpcode() == PPC::RLDICR) {\n unsigned char SH = MI->getOperand(2).getImm();\n unsigned char ME = MI->getOperand(3).getImm();\n \/\/ rldicr RA, RS, SH, 63-SH == sldi RA, RS, SH\n if (63-SH == ME) {\n O << \"\\tsldi \";\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n O << \", \" << (unsigned int)SH;\n printAnnotation(O, Annot);\n return;\n }\n }\n \n \/\/ For fast-isel, a COPY_TO_REGCLASS may survive this long. This is\n \/\/ used when converting a 32-bit float to a 64-bit float as part of\n \/\/ conversion to an integer (see PPCFastISel.cpp:SelectFPToI()),\n \/\/ as otherwise we have problems with incorrect register classes\n \/\/ in machine instruction verification. For now, just avoid trying\n \/\/ to print it as such an instruction has no effect (a 32-bit float\n \/\/ in a register is already in 64-bit form, just with lower\n \/\/ precision). FIXME: Is there a better solution?\n if (MI->getOpcode() == TargetOpcode::COPY_TO_REGCLASS)\n return;\n \n printInstruction(MI, O);\n printAnnotation(O, Annot);\n}\n\n\nvoid PPCInstPrinter::printPredicateOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O, \n const char *Modifier) {\n unsigned Code = MI->getOperand(OpNo).getImm();\n\n if (StringRef(Modifier) == \"cc\") {\n switch ((PPC::Predicate)Code) {\n case PPC::PRED_LT_MINUS:\n case PPC::PRED_LT_PLUS:\n case PPC::PRED_LT:\n O << \"lt\";\n return;\n case PPC::PRED_LE_MINUS:\n case PPC::PRED_LE_PLUS:\n case PPC::PRED_LE:\n O << \"le\";\n return;\n case PPC::PRED_EQ_MINUS:\n case PPC::PRED_EQ_PLUS:\n case PPC::PRED_EQ:\n O << \"eq\";\n return;\n case PPC::PRED_GE_MINUS:\n case PPC::PRED_GE_PLUS:\n case PPC::PRED_GE:\n O << \"ge\";\n return;\n case PPC::PRED_GT_MINUS:\n case PPC::PRED_GT_PLUS:\n case PPC::PRED_GT:\n O << \"gt\";\n return;\n case PPC::PRED_NE_MINUS:\n case PPC::PRED_NE_PLUS:\n case PPC::PRED_NE:\n O << \"ne\";\n return;\n case PPC::PRED_UN_MINUS:\n case PPC::PRED_UN_PLUS:\n case PPC::PRED_UN:\n O << \"un\";\n return;\n case PPC::PRED_NU_MINUS:\n case PPC::PRED_NU_PLUS:\n case PPC::PRED_NU:\n O << \"nu\";\n return;\n case PPC::PRED_BIT_SET:\n case PPC::PRED_BIT_UNSET:\n llvm_unreachable(\"Invalid use of bit predicate code\");\n }\n llvm_unreachable(\"Invalid predicate code\");\n }\n\n if (StringRef(Modifier) == \"pm\") {\n switch ((PPC::Predicate)Code) {\n case PPC::PRED_LT:\n case PPC::PRED_LE:\n case PPC::PRED_EQ:\n case PPC::PRED_GE:\n case PPC::PRED_GT:\n case PPC::PRED_NE:\n case PPC::PRED_UN:\n case PPC::PRED_NU:\n return;\n case PPC::PRED_LT_MINUS:\n case PPC::PRED_LE_MINUS:\n case PPC::PRED_EQ_MINUS:\n case PPC::PRED_GE_MINUS:\n case PPC::PRED_GT_MINUS:\n case PPC::PRED_NE_MINUS:\n case PPC::PRED_UN_MINUS:\n case PPC::PRED_NU_MINUS:\n O << \"-\";\n return;\n case PPC::PRED_LT_PLUS:\n case PPC::PRED_LE_PLUS:\n case PPC::PRED_EQ_PLUS:\n case PPC::PRED_GE_PLUS:\n case PPC::PRED_GT_PLUS:\n case PPC::PRED_NE_PLUS:\n case PPC::PRED_UN_PLUS:\n case PPC::PRED_NU_PLUS:\n O << \"+\";\n return;\n case PPC::PRED_BIT_SET:\n case PPC::PRED_BIT_UNSET:\n llvm_unreachable(\"Invalid use of bit predicate code\");\n }\n llvm_unreachable(\"Invalid predicate code\");\n }\n \n assert(StringRef(Modifier) == \"reg\" &&\n \"Need to specify 'cc', 'pm' or 'reg' as predicate op modifier!\");\n printOperand(MI, OpNo+1, O);\n}\n\nvoid PPCInstPrinter::printU2ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 3 && \"Invalid u2imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printU4ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 15 && \"Invalid u4imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printS5ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n int Value = MI->getOperand(OpNo).getImm();\n Value = SignExtend32<5>(Value);\n O << (int)Value;\n}\n\nvoid PPCInstPrinter::printU5ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 31 && \"Invalid u5imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printU6ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 63 && \"Invalid u6imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printS16ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (MI->getOperand(OpNo).isImm())\n O << (short)MI->getOperand(OpNo).getImm();\n else\n printOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printU16ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (MI->getOperand(OpNo).isImm())\n O << (unsigned short)MI->getOperand(OpNo).getImm();\n else\n printOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printBranchOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (!MI->getOperand(OpNo).isImm())\n return printOperand(MI, OpNo, O);\n\n \/\/ Branches can take an immediate operand. This is used by the branch\n \/\/ selection pass to print .+8, an eight byte displacement from the PC.\n O << \".+\";\n printAbsBranchOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printAbsBranchOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (!MI->getOperand(OpNo).isImm())\n return printOperand(MI, OpNo, O);\n\n O << (int)MI->getOperand(OpNo).getImm()*4;\n}\n\n\nvoid PPCInstPrinter::printcrbitm(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned CCReg = MI->getOperand(OpNo).getReg();\n unsigned RegNo;\n switch (CCReg) {\n default: llvm_unreachable(\"Unknown CR register\");\n case PPC::CR0: RegNo = 0; break;\n case PPC::CR1: RegNo = 1; break;\n case PPC::CR2: RegNo = 2; break;\n case PPC::CR3: RegNo = 3; break;\n case PPC::CR4: RegNo = 4; break;\n case PPC::CR5: RegNo = 5; break;\n case PPC::CR6: RegNo = 6; break;\n case PPC::CR7: RegNo = 7; break;\n }\n O << (0x80 >> RegNo);\n}\n\nvoid PPCInstPrinter::printMemRegImm(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n printS16ImmOperand(MI, OpNo, O);\n O << '(';\n if (MI->getOperand(OpNo+1).getReg() == PPC::R0)\n O << \"0\";\n else\n printOperand(MI, OpNo+1, O);\n O << ')';\n}\n\nvoid PPCInstPrinter::printMemRegReg(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n \/\/ When used as the base register, r0 reads constant zero rather than\n \/\/ the value contained in the register. For this reason, the darwin\n \/\/ assembler requires that we print r0 as 0 (no r) when used as the base.\n if (MI->getOperand(OpNo).getReg() == PPC::R0)\n O << \"0\";\n else\n printOperand(MI, OpNo, O);\n O << \", \";\n printOperand(MI, OpNo+1, O);\n}\n\nvoid PPCInstPrinter::printTLSCall(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n \/\/ On PPC64, VariantKind is VK_None, but on PPC32, it's VK_PLT, and it must\n \/\/ come at the _end_ of the expression.\n const MCOperand &Op = MI->getOperand(OpNo);\n const MCSymbolRefExpr &refExp = cast<MCSymbolRefExpr>(*Op.getExpr());\n O << refExp.getSymbol().getName();\n O << '(';\n printOperand(MI, OpNo+1, O);\n O << ')';\n if (refExp.getKind() != MCSymbolRefExpr::VK_None)\n O << '@' << MCSymbolRefExpr::getVariantKindName(refExp.getKind());\n}\n\n\n\/\/\/ stripRegisterPrefix - This method strips the character prefix from a\n\/\/\/ register name so that only the number is left. Used by for linux asm.\nstatic const char *stripRegisterPrefix(const char *RegName) {\n if (FullRegNames)\n return RegName;\n\n switch (RegName[0]) {\n case 'r':\n case 'f':\n case 'v':\n if (RegName[1] == 's')\n return RegName + 2;\n return RegName + 1;\n case 'c': if (RegName[1] == 'r') return RegName + 2;\n }\n \n return RegName;\n}\n\nvoid PPCInstPrinter::printOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n const MCOperand &Op = MI->getOperand(OpNo);\n if (Op.isReg()) {\n const char *RegName = getRegisterName(Op.getReg());\n \/\/ The linux and AIX assembler does not take register prefixes.\n if (!isDarwinSyntax())\n RegName = stripRegisterPrefix(RegName);\n \n O << RegName;\n return;\n }\n \n if (Op.isImm()) {\n O << Op.getImm();\n return;\n }\n \n assert(Op.isExpr() && \"unknown operand kind in printOperand\");\n O << *Op.getExpr();\n}\n\n<commit_msg>Fix signed integer overflow in PPCInstPrinter.<commit_after>\/\/===-- PPCInstPrinter.cpp - Convert PPC MCInst to assembly syntax --------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This class prints an PPC MCInst to a .s file.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"PPCInstPrinter.h\"\n#include \"MCTargetDesc\/PPCMCTargetDesc.h\"\n#include \"MCTargetDesc\/PPCPredicates.h\"\n#include \"llvm\/MC\/MCExpr.h\"\n#include \"llvm\/MC\/MCInst.h\"\n#include \"llvm\/MC\/MCInstrInfo.h\"\n#include \"llvm\/MC\/MCSymbol.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/Target\/TargetOpcodes.h\"\nusing namespace llvm;\n\n#define DEBUG_TYPE \"asm-printer\"\n\n\/\/ FIXME: Once the integrated assembler supports full register names, tie this\n\/\/ to the verbose-asm setting.\nstatic cl::opt<bool>\nFullRegNames(\"ppc-asm-full-reg-names\", cl::Hidden, cl::init(false),\n cl::desc(\"Use full register names when printing assembly\"));\n\n#include \"PPCGenAsmWriter.inc\"\n\nvoid PPCInstPrinter::printRegName(raw_ostream &OS, unsigned RegNo) const {\n OS << getRegisterName(RegNo);\n}\n\nvoid PPCInstPrinter::printInst(const MCInst *MI, raw_ostream &O,\n StringRef Annot) {\n \/\/ Check for slwi\/srwi mnemonics.\n if (MI->getOpcode() == PPC::RLWINM) {\n unsigned char SH = MI->getOperand(2).getImm();\n unsigned char MB = MI->getOperand(3).getImm();\n unsigned char ME = MI->getOperand(4).getImm();\n bool useSubstituteMnemonic = false;\n if (SH <= 31 && MB == 0 && ME == (31-SH)) {\n O << \"\\tslwi \"; useSubstituteMnemonic = true;\n }\n if (SH <= 31 && MB == (32-SH) && ME == 31) {\n O << \"\\tsrwi \"; useSubstituteMnemonic = true;\n SH = 32-SH;\n }\n if (useSubstituteMnemonic) {\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n O << \", \" << (unsigned int)SH;\n\n printAnnotation(O, Annot);\n return;\n }\n }\n \n if ((MI->getOpcode() == PPC::OR || MI->getOpcode() == PPC::OR8) &&\n MI->getOperand(1).getReg() == MI->getOperand(2).getReg()) {\n O << \"\\tmr \";\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n printAnnotation(O, Annot);\n return;\n }\n \n if (MI->getOpcode() == PPC::RLDICR) {\n unsigned char SH = MI->getOperand(2).getImm();\n unsigned char ME = MI->getOperand(3).getImm();\n \/\/ rldicr RA, RS, SH, 63-SH == sldi RA, RS, SH\n if (63-SH == ME) {\n O << \"\\tsldi \";\n printOperand(MI, 0, O);\n O << \", \";\n printOperand(MI, 1, O);\n O << \", \" << (unsigned int)SH;\n printAnnotation(O, Annot);\n return;\n }\n }\n \n \/\/ For fast-isel, a COPY_TO_REGCLASS may survive this long. This is\n \/\/ used when converting a 32-bit float to a 64-bit float as part of\n \/\/ conversion to an integer (see PPCFastISel.cpp:SelectFPToI()),\n \/\/ as otherwise we have problems with incorrect register classes\n \/\/ in machine instruction verification. For now, just avoid trying\n \/\/ to print it as such an instruction has no effect (a 32-bit float\n \/\/ in a register is already in 64-bit form, just with lower\n \/\/ precision). FIXME: Is there a better solution?\n if (MI->getOpcode() == TargetOpcode::COPY_TO_REGCLASS)\n return;\n \n printInstruction(MI, O);\n printAnnotation(O, Annot);\n}\n\n\nvoid PPCInstPrinter::printPredicateOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O, \n const char *Modifier) {\n unsigned Code = MI->getOperand(OpNo).getImm();\n\n if (StringRef(Modifier) == \"cc\") {\n switch ((PPC::Predicate)Code) {\n case PPC::PRED_LT_MINUS:\n case PPC::PRED_LT_PLUS:\n case PPC::PRED_LT:\n O << \"lt\";\n return;\n case PPC::PRED_LE_MINUS:\n case PPC::PRED_LE_PLUS:\n case PPC::PRED_LE:\n O << \"le\";\n return;\n case PPC::PRED_EQ_MINUS:\n case PPC::PRED_EQ_PLUS:\n case PPC::PRED_EQ:\n O << \"eq\";\n return;\n case PPC::PRED_GE_MINUS:\n case PPC::PRED_GE_PLUS:\n case PPC::PRED_GE:\n O << \"ge\";\n return;\n case PPC::PRED_GT_MINUS:\n case PPC::PRED_GT_PLUS:\n case PPC::PRED_GT:\n O << \"gt\";\n return;\n case PPC::PRED_NE_MINUS:\n case PPC::PRED_NE_PLUS:\n case PPC::PRED_NE:\n O << \"ne\";\n return;\n case PPC::PRED_UN_MINUS:\n case PPC::PRED_UN_PLUS:\n case PPC::PRED_UN:\n O << \"un\";\n return;\n case PPC::PRED_NU_MINUS:\n case PPC::PRED_NU_PLUS:\n case PPC::PRED_NU:\n O << \"nu\";\n return;\n case PPC::PRED_BIT_SET:\n case PPC::PRED_BIT_UNSET:\n llvm_unreachable(\"Invalid use of bit predicate code\");\n }\n llvm_unreachable(\"Invalid predicate code\");\n }\n\n if (StringRef(Modifier) == \"pm\") {\n switch ((PPC::Predicate)Code) {\n case PPC::PRED_LT:\n case PPC::PRED_LE:\n case PPC::PRED_EQ:\n case PPC::PRED_GE:\n case PPC::PRED_GT:\n case PPC::PRED_NE:\n case PPC::PRED_UN:\n case PPC::PRED_NU:\n return;\n case PPC::PRED_LT_MINUS:\n case PPC::PRED_LE_MINUS:\n case PPC::PRED_EQ_MINUS:\n case PPC::PRED_GE_MINUS:\n case PPC::PRED_GT_MINUS:\n case PPC::PRED_NE_MINUS:\n case PPC::PRED_UN_MINUS:\n case PPC::PRED_NU_MINUS:\n O << \"-\";\n return;\n case PPC::PRED_LT_PLUS:\n case PPC::PRED_LE_PLUS:\n case PPC::PRED_EQ_PLUS:\n case PPC::PRED_GE_PLUS:\n case PPC::PRED_GT_PLUS:\n case PPC::PRED_NE_PLUS:\n case PPC::PRED_UN_PLUS:\n case PPC::PRED_NU_PLUS:\n O << \"+\";\n return;\n case PPC::PRED_BIT_SET:\n case PPC::PRED_BIT_UNSET:\n llvm_unreachable(\"Invalid use of bit predicate code\");\n }\n llvm_unreachable(\"Invalid predicate code\");\n }\n \n assert(StringRef(Modifier) == \"reg\" &&\n \"Need to specify 'cc', 'pm' or 'reg' as predicate op modifier!\");\n printOperand(MI, OpNo+1, O);\n}\n\nvoid PPCInstPrinter::printU2ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 3 && \"Invalid u2imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printU4ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 15 && \"Invalid u4imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printS5ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n int Value = MI->getOperand(OpNo).getImm();\n Value = SignExtend32<5>(Value);\n O << (int)Value;\n}\n\nvoid PPCInstPrinter::printU5ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 31 && \"Invalid u5imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printU6ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned int Value = MI->getOperand(OpNo).getImm();\n assert(Value <= 63 && \"Invalid u6imm argument!\");\n O << (unsigned int)Value;\n}\n\nvoid PPCInstPrinter::printS16ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (MI->getOperand(OpNo).isImm())\n O << (short)MI->getOperand(OpNo).getImm();\n else\n printOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printU16ImmOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (MI->getOperand(OpNo).isImm())\n O << (unsigned short)MI->getOperand(OpNo).getImm();\n else\n printOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printBranchOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (!MI->getOperand(OpNo).isImm())\n return printOperand(MI, OpNo, O);\n\n \/\/ Branches can take an immediate operand. This is used by the branch\n \/\/ selection pass to print .+8, an eight byte displacement from the PC.\n O << \".+\";\n printAbsBranchOperand(MI, OpNo, O);\n}\n\nvoid PPCInstPrinter::printAbsBranchOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n if (!MI->getOperand(OpNo).isImm())\n return printOperand(MI, OpNo, O);\n\n O << SignExtend32<32>((unsigned)MI->getOperand(OpNo).getImm() << 2);\n}\n\n\nvoid PPCInstPrinter::printcrbitm(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n unsigned CCReg = MI->getOperand(OpNo).getReg();\n unsigned RegNo;\n switch (CCReg) {\n default: llvm_unreachable(\"Unknown CR register\");\n case PPC::CR0: RegNo = 0; break;\n case PPC::CR1: RegNo = 1; break;\n case PPC::CR2: RegNo = 2; break;\n case PPC::CR3: RegNo = 3; break;\n case PPC::CR4: RegNo = 4; break;\n case PPC::CR5: RegNo = 5; break;\n case PPC::CR6: RegNo = 6; break;\n case PPC::CR7: RegNo = 7; break;\n }\n O << (0x80 >> RegNo);\n}\n\nvoid PPCInstPrinter::printMemRegImm(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n printS16ImmOperand(MI, OpNo, O);\n O << '(';\n if (MI->getOperand(OpNo+1).getReg() == PPC::R0)\n O << \"0\";\n else\n printOperand(MI, OpNo+1, O);\n O << ')';\n}\n\nvoid PPCInstPrinter::printMemRegReg(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n \/\/ When used as the base register, r0 reads constant zero rather than\n \/\/ the value contained in the register. For this reason, the darwin\n \/\/ assembler requires that we print r0 as 0 (no r) when used as the base.\n if (MI->getOperand(OpNo).getReg() == PPC::R0)\n O << \"0\";\n else\n printOperand(MI, OpNo, O);\n O << \", \";\n printOperand(MI, OpNo+1, O);\n}\n\nvoid PPCInstPrinter::printTLSCall(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n \/\/ On PPC64, VariantKind is VK_None, but on PPC32, it's VK_PLT, and it must\n \/\/ come at the _end_ of the expression.\n const MCOperand &Op = MI->getOperand(OpNo);\n const MCSymbolRefExpr &refExp = cast<MCSymbolRefExpr>(*Op.getExpr());\n O << refExp.getSymbol().getName();\n O << '(';\n printOperand(MI, OpNo+1, O);\n O << ')';\n if (refExp.getKind() != MCSymbolRefExpr::VK_None)\n O << '@' << MCSymbolRefExpr::getVariantKindName(refExp.getKind());\n}\n\n\n\/\/\/ stripRegisterPrefix - This method strips the character prefix from a\n\/\/\/ register name so that only the number is left. Used by for linux asm.\nstatic const char *stripRegisterPrefix(const char *RegName) {\n if (FullRegNames)\n return RegName;\n\n switch (RegName[0]) {\n case 'r':\n case 'f':\n case 'v':\n if (RegName[1] == 's')\n return RegName + 2;\n return RegName + 1;\n case 'c': if (RegName[1] == 'r') return RegName + 2;\n }\n \n return RegName;\n}\n\nvoid PPCInstPrinter::printOperand(const MCInst *MI, unsigned OpNo,\n raw_ostream &O) {\n const MCOperand &Op = MI->getOperand(OpNo);\n if (Op.isReg()) {\n const char *RegName = getRegisterName(Op.getReg());\n \/\/ The linux and AIX assembler does not take register prefixes.\n if (!isDarwinSyntax())\n RegName = stripRegisterPrefix(RegName);\n \n O << RegName;\n return;\n }\n \n if (Op.isImm()) {\n O << Op.getImm();\n return;\n }\n \n assert(Op.isExpr() && \"unknown operand kind in printOperand\");\n O << *Op.getExpr();\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"alfe\/main.h\"\n\nclass Program : public ProgramBase\n{\npublic:\n void run()\n {\n Array<Byte> observed(0x1000000);\n String dir(\"M:\\\\Program Files (x86)\\\\Apache Software Foundation\\\\\"\n \"Apache24\\\\htdocs\\\\\");\n for (int i = 0; i < 0x100; ++i) {\n File(dir + \"VXBaff12_jb2NCDE\" + decimal(i) + \".dat\", true).\n openRead().read(&observed[i << 16], 0x10000);\n }\n observed[98 + (204 << 8)] = 194;\n observed[(1261 & 0xff) + ((667 - 512) << 8) + (((1261 + 8192) & 0xff00) << 8)] = 196;\n observed[(1263 & 0xff) + ((667 - 512) << 8) + (((1263 + 8192) & 0xff00) << 8)] = 199;\n observed[(1276 & 0xff) + ((667 - 512) << 8) + (((1276 + 8192) & 0xff00) << 8)] = 199;\n observed[(1630 & 0xff) + ((409 - 256) << 8) + (((1630 + 4096) & 0xff00) << 8)] = 199;\n\n \/\/for (int i = 0; i < 0x100; ++i) {\n \/\/ if (i < 193) {\n \/\/ File(dir + \"86-7-WTkKuASmtlj\" + decimal(i) + \".dat\", true).\n \/\/ openRead().read(&observed[i << 16], 0x10000);\n \/\/ }\n \/\/ else {\n \/\/ File(dir + \"5egBqeiqajT-IYHl\" + decimal(i - 193) + \".dat\",\n \/\/ true).openRead().read(&observed[i << 16], 0x10000);\n \/\/ }\n \/\/}\n\n Array<Byte> expected(0x1000000);\n for (int dividend = 0; dividend < 0x10000; ++dividend) {\n for (int divisor = 0; divisor < 0x100; ++divisor) {\n int t = 239;\n int remainder = dividend;\n int quotient = 0;\n int qbit = 0x80;\n int x = divisor << 8;\n if (remainder < x) {\n t = 194;\n for (int b = 0; b < 8; ++b) { \n x >>= 1;\n if (remainder >= x) {\n remainder -= x;\n ++t;\n if (b == 7)\n t += 2;\n quotient |= qbit;\n }\n qbit >>= 1;\n }\n }\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n expected[o] = t;\n observed[o] -= t;\n }\n }\n \/\/for (int dividend1 = 0; dividend1 < 0x10000; ++dividend1) {\n \/\/ for (int divisor1 = 0; divisor1 < 0x100; ++divisor1) {\n \/\/ int dividend = dividend1;\n \/\/ int divisor = divisor1;\n\n \/\/ int t = 214;\n \/\/ bool negative = false;\n \/\/ bool dividendNegative = false;\n \/\/ if ((dividend & 0x8000) != 0) {\n \/\/ dividend = (~dividend + 1) & 0xffff;\n \/\/ negative = true;\n \/\/ dividendNegative = true;\n \/\/ t += 4;\n \/\/ }\n \/\/ if ((divisor & 0x80) != 0) { \n \/\/ divisor = (~divisor + 1) & 0xff;\n \/\/ negative = !negative;\n \/\/ }\n \/\/ else\n \/\/ t += 1;\n \/\/ int remainder = dividend;\n \/\/ int quotient = 0;\n \/\/ int qbit = 0x80;\n \/\/ int x = divisor << 8;\n \/\/ if (remainder < x) {\n \/\/ for (int b = 0; b < 8; ++b) { \n \/\/ x >>= 1;\n \/\/ if (remainder >= x) {\n \/\/ remainder -= x;\n \/\/ ++t;\n \/\/ if (b == 7)\n \/\/ t += 2;\n \/\/ quotient |= qbit;\n \/\/ }\n \/\/ qbit >>= 1;\n \/\/ }\n \/\/ if (\/*remainder >= x*\/ (quotient & 0x80) != 0)\n \/\/ t += 105;\n \/\/ else {\n \/\/ if (negative)\n \/\/ quotient = ~quotient + 1;\n \/\/ if (dividendNegative)\n \/\/ remainder = ~remainder + 1;\n \/\/ }\n \/\/ }\n \/\/ else\n \/\/ t += 34;\n\n \/\/ int o = ((dividend1 & 0xff00) << 8) + (divisor1 << 8) + (dividend1 & 0xff);\n \/\/ expected[o] = t;\n \/\/ }\n \/\/}\n\n Array<Byte> rearranged(0x1000000);\n for (int quotient = 0; quotient < 0x100; ++quotient) {\n for (int divisor = 0; divisor < 0x100; ++divisor) {\n for (int remainder = 0; remainder < 0x100; ++remainder) {\n int dividend = quotient*divisor + remainder;\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n int p = ((quotient & 0xf) << 8) + remainder + ((((quotient & 0xf0) << 4) + divisor) << 12);\n if (dividend < 0x10000 && remainder < divisor)\n rearranged[p] = observed[o];\n else\n rearranged[p] = 0;\n }\n }\n }\n File(\"rearranged.raw\").save(rearranged);\n\n Array<Byte> delta(0x1000000);\n Array<int> hist(513);\n for (int i = 0; i < 513; ++i)\n hist[i] = 0;\n for (int y = 0; y < 0x1000; ++y) {\n for (int x = 0; x < 0x1000; ++x) {\n int divisor = y & 0xff;\n int dividend = x + ((y & 0xf00) << 4);\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n int c = observed[o];\n \/\/int c = expected[o] - observed[o];\n delta[y*0x1000 + x] = c;\n int i = (c - 128) + 256;\n ++hist[i];\n \/\/if (c != 128 && divisor <= 128)\n \/\/ printf(\"Delta at divisor %i\\n\",divisor);\n }\n }\n\n File(\"diff.raw\").save(delta);\n File(\"hist.raw\").save(hist);\n }\n};<commit_msg>More division experiments<commit_after>#include \"alfe\/main.h\"\n\nclass Program : public ProgramBase\n{\npublic:\n void checkResult(int dividend, int divisor, int quotient, int remainder)\n {\n if (dividend \/ divisor != quotient || dividend % divisor != remainder)\n throw Exception(\"Incorrect result.\");\n }\n void run()\n {\n Array<Byte> observed(0x1000000);\n String dir(\"M:\\\\Program Files (x86)\\\\Apache Software Foundation\\\\\"\n \"Apache24\\\\htdocs\\\\\");\n for (int i = 0; i < 0x100; ++i) {\n File(dir + \"VXBaff12_jb2NCDE\" + decimal(i) + \".dat\", true).\n openRead().read(&observed[i << 16], 0x10000);\n }\n observed[98 + (204 << 8)] = 194;\n observed[(1261 & 0xff) + ((667 - 512) << 8) + (((1261 + 8192) & 0xff00) << 8)] = 196;\n observed[(1263 & 0xff) + ((667 - 512) << 8) + (((1263 + 8192) & 0xff00) << 8)] = 199;\n observed[(1276 & 0xff) + ((667 - 512) << 8) + (((1276 + 8192) & 0xff00) << 8)] = 199;\n observed[(1630 & 0xff) + ((409 - 256) << 8) + (((1630 + 4096) & 0xff00) << 8)] = 199;\n\n \/\/for (int i = 0; i < 0x100; ++i) {\n \/\/ if (i < 193) {\n \/\/ File(dir + \"86-7-WTkKuASmtlj\" + decimal(i) + \".dat\", true).\n \/\/ openRead().read(&observed[i << 16], 0x10000);\n \/\/ }\n \/\/ else {\n \/\/ File(dir + \"5egBqeiqajT-IYHl\" + decimal(i - 193) + \".dat\",\n \/\/ true).openRead().read(&observed[i << 16], 0x10000);\n \/\/ }\n \/\/}\n\n Array<Byte> expected(0x1000000);\n \/\/for (int dividend = 0; dividend < 0x10000; ++dividend) {\n \/\/ for (int divisor = 0; divisor < 0x100; ++divisor) {\n \/\/ int t = 239;\n \/\/ int remainder = dividend;\n \/\/ int quotient = 0;\n \/\/ int qbit = 0x80;\n \/\/ int x = divisor << 8;\n \/\/ if (remainder < x) {\n \/\/ t = 194;\n \/\/ for (int b = 0; b < 8; ++b) { \n \/\/ x >>= 1;\n \/\/ if (remainder >= x) {\n \/\/ remainder -= x;\n \/\/ ++t;\n \/\/ if (b == 7)\n \/\/ t += 2;\n \/\/ quotient |= qbit;\n \/\/ }\n \/\/ qbit >>= 1;\n \/\/ }\n \/\/ }\n \/\/ int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n \/\/ expected[o] = t;\n \/\/ observed[o] -= t;\n \/\/ }\n \/\/}\n for (int dividend = 0; dividend < 0x10000; ++dividend) {\n for (int divisor = 0; divisor < 0x100; ++divisor) {\n if (dividend == 1 && divisor == 1)\n printf(\"Stop\");\n int t = 239;\n Byte l = dividend & 0xff;\n Byte h = dividend >> 8;\n if (h < divisor) {\n t = 194;\n for (int b = 0; b < 8; ++b) {\n bool c = false;\n if (h >= divisor) {\n h -= divisor;\n c = true;\n ++t;\n if (b == 7)\n t += 2;\n }\n bool nc = (h & 0x80) != 0;\n h = (h << 1) + ((l & 0x80) != 0 ? 1 : 0);\n l = (l << 1) + (c ? 1 : 0);\n\n }\n checkResult(dividend, divisor, l, h);\n }\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n expected[o] = t;\n observed[o] -= t;\n }\n }\n\n\n \/\/for (int dividend1 = 0; dividend1 < 0x10000; ++dividend1) {\n \/\/ for (int divisor1 = 0; divisor1 < 0x100; ++divisor1) {\n \/\/ int dividend = dividend1;\n \/\/ int divisor = divisor1;\n\n \/\/ int t = 214;\n \/\/ bool negative = false;\n \/\/ bool dividendNegative = false;\n \/\/ if ((dividend & 0x8000) != 0) {\n \/\/ dividend = (~dividend + 1) & 0xffff;\n \/\/ negative = true;\n \/\/ dividendNegative = true;\n \/\/ t += 4;\n \/\/ }\n \/\/ if ((divisor & 0x80) != 0) { \n \/\/ divisor = (~divisor + 1) & 0xff;\n \/\/ negative = !negative;\n \/\/ }\n \/\/ else\n \/\/ t += 1;\n \/\/ int remainder = dividend;\n \/\/ int quotient = 0;\n \/\/ int qbit = 0x80;\n \/\/ int x = divisor << 8;\n \/\/ if (remainder < x) {\n \/\/ for (int b = 0; b < 8; ++b) { \n \/\/ x >>= 1;\n \/\/ if (remainder >= x) {\n \/\/ remainder -= x;\n \/\/ ++t;\n \/\/ if (b == 7)\n \/\/ t += 2;\n \/\/ quotient |= qbit;\n \/\/ }\n \/\/ qbit >>= 1;\n \/\/ }\n \/\/ if (\/*remainder >= x*\/ (quotient & 0x80) != 0)\n \/\/ t += 105;\n \/\/ else {\n \/\/ if (negative)\n \/\/ quotient = ~quotient + 1;\n \/\/ if (dividendNegative)\n \/\/ remainder = ~remainder + 1;\n \/\/ }\n \/\/ }\n \/\/ else\n \/\/ t += 34;\n\n \/\/ int o = ((dividend1 & 0xff00) << 8) + (divisor1 << 8) + (dividend1 & 0xff);\n \/\/ expected[o] = t;\n \/\/ }\n \/\/}\n\n Array<Byte> rearranged(0x1000000);\n for (int quotient = 0; quotient < 0x100; ++quotient) {\n for (int divisor = 0; divisor < 0x100; ++divisor) {\n for (int remainder = 0; remainder < 0x100; ++remainder) {\n int dividend = quotient*divisor + remainder;\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n int p = ((quotient & 0xf) << 8) + remainder + ((((quotient & 0xf0) << 4) + divisor) << 12);\n if (dividend < 0x10000 && remainder < divisor)\n rearranged[p] = observed[o];\n else\n rearranged[p] = 0;\n }\n }\n }\n File(\"rearranged.raw\").save(rearranged);\n\n Array<Byte> delta(0x1000000);\n Array<int> hist(513);\n for (int i = 0; i < 513; ++i)\n hist[i] = 0;\n for (int y = 0; y < 0x1000; ++y) {\n for (int x = 0; x < 0x1000; ++x) {\n int divisor = y & 0xff;\n int dividend = x + ((y & 0xf00) << 4);\n int o = ((dividend & 0xff00) << 8) + (divisor << 8) + (dividend & 0xff);\n int c = observed[o];\n \/\/int c = expected[o] - observed[o];\n delta[y*0x1000 + x] = c;\n int i = (c - 128) + 256;\n ++hist[i];\n \/\/if (c != 128 && divisor <= 128)\n \/\/ printf(\"Delta at divisor %i\\n\",divisor);\n }\n }\n\n File(\"diff.raw\").save(delta);\n File(\"hist.raw\").save(hist);\n }\n};<|endoftext|>"} {"text":"<commit_before>#pragma once\n\nnamespace Headway\n{\n constexpr auto VERSION = \"4.1\";\n constexpr int VERSION_MAJOR = 4;\n constexpr int VERSION_MINOR = 1;\n\n#ifdef Q_OS_MACOS\n constexpr bool GLOBAL_MENUBAR = true;\n#else\n constexpr bool GLOBAL_MENUBAR = false;\n#endif\n\n#ifdef Q_OS_WINDOWS\n constexpr auto QUICK_CONTROLS_STYLE = \"Universal\";\n#elif Q_OS_MACOS\n constexpr auto QUICK_CONTROLS_STYLE = \"macOS\";\n#else\n constexpr auto QUICK_CONTROLS_STYLE = \"Basic\";\n#endif\n}\n<commit_msg>fix macro evaluation in config.hpp<commit_after>#pragma once\n\nnamespace Headway\n{\n constexpr auto VERSION = \"4.1\";\n constexpr int VERSION_MAJOR = 4;\n constexpr int VERSION_MINOR = 1;\n\n#if defined(Q_OS_MACOS)\n constexpr bool GLOBAL_MENUBAR = true;\n#else\n constexpr bool GLOBAL_MENUBAR = false;\n#endif\n\n#if defined(Q_OS_WINDOWS)\n constexpr auto QUICK_CONTROLS_STYLE = \"Universal\";\n#elif defined(Q_OS_MACOS)\n constexpr auto QUICK_CONTROLS_STYLE = \"macOS\";\n#else\n constexpr auto QUICK_CONTROLS_STYLE = \"Basic\";\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** Copyright (C) 2015 BogDan Vatra <bog_dan_ro@yahoo.com>\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company. For licensing terms and\n** conditions see http:\/\/www.qt.io\/terms-conditions. For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file. Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, The Qt Company gives you certain additional\n** rights. These rights are described in The Qt Company LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"qmakeandroidbuildapkstep.h\"\n#include \"qmakeandroidbuildapkwidget.h\"\n#include \"qmakeandroidrunconfiguration.h\"\n\n#include <android\/androidconfigurations.h>\n#include <android\/androidconstants.h>\n#include <android\/androidmanager.h>\n#include <android\/androidqtsupport.h>\n\n#include <projectexplorer\/buildconfiguration.h>\n#include <projectexplorer\/buildsteplist.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/projectexplorer.h>\n#include <projectexplorer\/target.h>\n#include <qtsupport\/qtkitinformation.h>\n#include <qmakeprojectmanager\/qmakenodes.h>\n#include <qmakeprojectmanager\/qmakeproject.h>\n\n#include <utils\/qtcprocess.h>\n\n#include <QHBoxLayout>\n\nusing namespace Android;\nusing QmakeProjectManager::QmakeProject;\nusing QmakeProjectManager::QmakeProFileNode;\n\nnamespace QmakeAndroidSupport {\nnamespace Internal {\n\nconst Core::Id ANDROID_BUILD_APK_ID(\"QmakeProjectManager.AndroidBuildApkStep\");\nconst QLatin1String ProFilePathForInputFile(\"ProFilePathForInputFile\");\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ QmakeAndroidBuildApkStepFactory\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQmakeAndroidBuildApkStepFactory::QmakeAndroidBuildApkStepFactory(QObject *parent)\n : IBuildStepFactory(parent)\n{\n}\n\nQList<Core::Id> QmakeAndroidBuildApkStepFactory::availableCreationIds(ProjectExplorer::BuildStepList *parent) const\n{\n if (parent->id() != ProjectExplorer::Constants::BUILDSTEPS_BUILD\n || !canHandle(parent->target())\n || parent->contains(ANDROID_BUILD_APK_ID)) {\n return QList<Core::Id>();\n }\n\n return QList<Core::Id>() << ANDROID_BUILD_APK_ID;\n}\n\nQString QmakeAndroidBuildApkStepFactory::displayNameForId(const Core::Id id) const\n{\n if (id == ANDROID_BUILD_APK_ID)\n return tr(\"Build Android APK\");\n return QString();\n}\n\nbool QmakeAndroidBuildApkStepFactory::canCreate(ProjectExplorer::BuildStepList *parent, const Core::Id id) const\n{\n return availableCreationIds(parent).contains(id);\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::create(ProjectExplorer::BuildStepList *parent, const Core::Id id)\n{\n Q_ASSERT(canCreate(parent, id));\n Q_UNUSED(id);\n return new QmakeAndroidBuildApkStep(parent);\n}\n\nbool QmakeAndroidBuildApkStepFactory::canRestore(ProjectExplorer::BuildStepList *parent, const QVariantMap &map) const\n{\n return canCreate(parent, ProjectExplorer::idFromMap(map));\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::restore(ProjectExplorer::BuildStepList *parent, const QVariantMap &map)\n{\n Q_ASSERT(canRestore(parent, map));\n QmakeAndroidBuildApkStep * const step = new QmakeAndroidBuildApkStep(parent);\n if (!step->fromMap(map)) {\n delete step;\n return 0;\n }\n return step;\n}\n\nbool QmakeAndroidBuildApkStepFactory::canClone(ProjectExplorer::BuildStepList *parent, ProjectExplorer::BuildStep *product) const\n{\n return canCreate(parent, product->id());\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::clone(ProjectExplorer::BuildStepList *parent, ProjectExplorer::BuildStep *product)\n{\n Q_ASSERT(canClone(parent, product));\n return new QmakeAndroidBuildApkStep(parent, static_cast<QmakeAndroidBuildApkStep *>(product));\n}\n\nbool QmakeAndroidBuildApkStepFactory::canHandle(ProjectExplorer::Target *t) const\n{\n return t->project()->supportsKit(t->kit())\n && AndroidManager::supportsAndroid(t)\n && qobject_cast<QmakeProject *>(t->project());\n}\n\n\nQmakeAndroidBuildApkStep::QmakeAndroidBuildApkStep(ProjectExplorer::BuildStepList *bc)\n :AndroidBuildApkStep(bc, ANDROID_BUILD_APK_ID)\n{\n ctor();\n}\n\nUtils::FileName QmakeAndroidBuildApkStep::proFilePathForInputFile() const\n{\n ProjectExplorer::RunConfiguration *rc = target()->activeRunConfiguration();\n if (auto *arc = qobject_cast<QmakeAndroidRunConfiguration *>(rc))\n return arc->proFilePath();\n return Utils::FileName();\n}\n\nQmakeAndroidBuildApkStep::QmakeAndroidBuildApkStep(ProjectExplorer::BuildStepList *bc, QmakeAndroidBuildApkStep *other)\n : AndroidBuildApkStep(bc, other)\n{\n ctor();\n}\n\nUtils::FileName QmakeAndroidBuildApkStep::androidPackageSourceDir() const\n{\n QmakeProjectManager::QmakeProject *pro = static_cast<QmakeProjectManager::QmakeProject *>(project());\n const QmakeProjectManager::QmakeProFileNode *node\n = pro->rootQmakeProjectNode()->findProFileFor(proFilePathForInputFile());\n if (!node)\n return Utils::FileName();\n return Utils::FileName::fromString(node->singleVariableValue(QmakeProjectManager::AndroidPackageSourceDir));\n}\n\nvoid QmakeAndroidBuildApkStep::ctor()\n{\n}\n\nbool QmakeAndroidBuildApkStep::init()\n{\n if (AndroidManager::checkForQt51Files(project()->projectDirectory()))\n emit addOutput(tr(\"Found old folder \\\"android\\\" in source directory. Qt 5.2 does not use that folder by default.\"), ErrorOutput);\n\n if (!AndroidBuildApkStep::init())\n return false;\n\n QtSupport::BaseQtVersion *version = QtSupport::QtKitInformation::qtVersion(target()->kit());\n if (!version)\n return false;\n\n QString command = version->qmakeProperty(\"QT_HOST_BINS\");\n if (!command.endsWith(QLatin1Char('\/')))\n command += QLatin1Char('\/');\n command += QLatin1String(\"androiddeployqt\");\n if (Utils::HostOsInfo::isWindowsHost())\n command += QLatin1String(\".exe\");\n\n QString deploymentMethod;\n if (m_deployAction == MinistroDeployment)\n deploymentMethod = QLatin1String(\"ministro\");\n else if (m_deployAction == DebugDeployment)\n deploymentMethod = QLatin1String(\"debug\");\n else if (m_deployAction == BundleLibrariesDeployment)\n deploymentMethod = QLatin1String(\"bundled\");\n\n ProjectExplorer::BuildConfiguration *bc = buildConfiguration();\n QString outputDir = bc->buildDirectory().appendPath(QLatin1String(Constants::ANDROID_BUILDDIRECTORY)).toString();\n\n const auto *pro = static_cast<QmakeProjectManager::QmakeProject *>(project());\n const QmakeProjectManager::QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(proFilePathForInputFile());\n m_skipBuilding = !node;\n if (m_skipBuilding)\n return true;\n\n QString inputFile = node->singleVariableValue(QmakeProjectManager::AndroidDeploySettingsFile);\n if (inputFile.isEmpty()) { \/\/ should never happen\n emit addOutput(tr(\"Internal Error: Unknown Android deployment JSON file location.\"), BuildStep::ErrorMessageOutput);\n return false;\n }\n\n QStringList arguments;\n arguments << QLatin1String(\"--input\")\n << inputFile\n << QLatin1String(\"--output\")\n << outputDir\n << QLatin1String(\"--deployment\")\n << deploymentMethod\n << QLatin1String(\"--android-platform\")\n << AndroidManager::buildTargetSDK(target())\n << QLatin1String(\"--jdk\")\n << AndroidConfigurations::currentConfig().openJDKLocation().toString();\n\n if (m_verbose)\n arguments << QLatin1String(\"--verbose\");\n\n if (m_useGradle)\n arguments << QLatin1String(\"--gradle\");\n else\n arguments << QLatin1String(\"--ant\")\n << AndroidConfigurations::currentConfig().antToolPath().toString();\n\n\n QStringList argumentsPasswordConcealed = arguments;\n\n if (m_signPackage) {\n arguments << QLatin1String(\"--sign\")\n << m_keystorePath.toString()\n << m_certificateAlias\n << QLatin1String(\"--storepass\")\n << m_keystorePasswd;\n argumentsPasswordConcealed << QLatin1String(\"--sign\") << QLatin1String(\"******\")\n << QLatin1String(\"--storepass\") << QLatin1String(\"******\");\n if (!m_certificatePasswd.isEmpty()) {\n arguments << QLatin1String(\"--keypass\")\n << m_certificatePasswd;\n argumentsPasswordConcealed << QLatin1String(\"--keypass\")\n << QLatin1String(\"******\");\n }\n\n }\n\n ProjectExplorer::ProcessParameters *pp = processParameters();\n setupProcessParameters(pp, bc, arguments, command);\n\n \/\/ Generate arguments with keystore password concealed\n ProjectExplorer::ProcessParameters pp2;\n setupProcessParameters(&pp2, bc, argumentsPasswordConcealed, command);\n m_command = pp2.effectiveCommand();\n m_argumentsPasswordConcealed = pp2.prettyArguments();\n\n return true;\n}\n\nvoid QmakeAndroidBuildApkStep::run(QFutureInterface<bool> &fi)\n{\n if (m_skipBuilding) {\n emit addOutput(tr(\"No application .pro file found, not building an APK.\"), BuildStep::ErrorMessageOutput);\n fi.reportResult(true);\n emit finished();\n return;\n }\n AndroidBuildApkStep::run(fi);\n}\n\nvoid QmakeAndroidBuildApkStep::setupProcessParameters(ProjectExplorer::ProcessParameters *pp,\n ProjectExplorer::BuildConfiguration *bc,\n const QStringList &arguments,\n const QString &command)\n{\n pp->setMacroExpander(bc->macroExpander());\n pp->setWorkingDirectory(bc->buildDirectory().toString());\n Utils::Environment env = bc->environment();\n pp->setEnvironment(env);\n pp->setCommand(command);\n pp->setArguments(Utils::QtcProcess::joinArgs(arguments));\n pp->resolveAll();\n}\n\nvoid QmakeAndroidBuildApkStep::processStarted()\n{\n emit addOutput(tr(\"Starting: \\\"%1\\\" %2\")\n .arg(QDir::toNativeSeparators(m_command),\n m_argumentsPasswordConcealed),\n BuildStep::MessageOutput);\n}\n\nProjectExplorer::BuildStepConfigWidget *QmakeAndroidBuildApkStep::createConfigWidget()\n{\n return new QmakeAndroidBuildApkWidget(this);\n}\n\nbool QmakeAndroidBuildApkStep::fromMap(const QVariantMap &map)\n{\n return AndroidBuildApkStep::fromMap(map);\n}\n\nQVariantMap QmakeAndroidBuildApkStep::toMap() const\n{\n QVariantMap map = AndroidBuildApkStep::toMap();\n return map;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmakeAndroidSupport\n<commit_msg>Android: Make library projects building skip apk packaging<commit_after>\/**************************************************************************\n**\n** Copyright (C) 2015 BogDan Vatra <bog_dan_ro@yahoo.com>\n** Copyright (C) 2015 The Qt Company Ltd.\n** Contact: http:\/\/www.qt.io\/licensing\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company. For licensing terms and\n** conditions see http:\/\/www.qt.io\/terms-conditions. For further information\n** use the contact form at http:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 or version 3 as published by the Free\n** Software Foundation and appearing in the file LICENSE.LGPLv21 and\n** LICENSE.LGPLv3 included in the packaging of this file. Please review the\n** following information to ensure the GNU Lesser General Public License\n** requirements will be met: https:\/\/www.gnu.org\/licenses\/lgpl.html and\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, The Qt Company gives you certain additional\n** rights. These rights are described in The Qt Company LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"qmakeandroidbuildapkstep.h\"\n#include \"qmakeandroidbuildapkwidget.h\"\n#include \"qmakeandroidrunconfiguration.h\"\n\n#include <android\/androidconfigurations.h>\n#include <android\/androidconstants.h>\n#include <android\/androidmanager.h>\n#include <android\/androidqtsupport.h>\n\n#include <projectexplorer\/buildconfiguration.h>\n#include <projectexplorer\/buildsteplist.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/projectexplorer.h>\n#include <projectexplorer\/target.h>\n#include <qtsupport\/qtkitinformation.h>\n#include <qmakeprojectmanager\/qmakenodes.h>\n#include <qmakeprojectmanager\/qmakeproject.h>\n\n#include <utils\/qtcprocess.h>\n\n#include <QHBoxLayout>\n\nusing namespace Android;\nusing QmakeProjectManager::QmakeProject;\nusing QmakeProjectManager::QmakeProFileNode;\n\nnamespace QmakeAndroidSupport {\nnamespace Internal {\n\nconst Core::Id ANDROID_BUILD_APK_ID(\"QmakeProjectManager.AndroidBuildApkStep\");\nconst QLatin1String ProFilePathForInputFile(\"ProFilePathForInputFile\");\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ QmakeAndroidBuildApkStepFactory\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nQmakeAndroidBuildApkStepFactory::QmakeAndroidBuildApkStepFactory(QObject *parent)\n : IBuildStepFactory(parent)\n{\n}\n\nQList<Core::Id> QmakeAndroidBuildApkStepFactory::availableCreationIds(ProjectExplorer::BuildStepList *parent) const\n{\n if (parent->id() != ProjectExplorer::Constants::BUILDSTEPS_BUILD\n || !canHandle(parent->target())\n || parent->contains(ANDROID_BUILD_APK_ID)) {\n return QList<Core::Id>();\n }\n\n return QList<Core::Id>() << ANDROID_BUILD_APK_ID;\n}\n\nQString QmakeAndroidBuildApkStepFactory::displayNameForId(const Core::Id id) const\n{\n if (id == ANDROID_BUILD_APK_ID)\n return tr(\"Build Android APK\");\n return QString();\n}\n\nbool QmakeAndroidBuildApkStepFactory::canCreate(ProjectExplorer::BuildStepList *parent, const Core::Id id) const\n{\n return availableCreationIds(parent).contains(id);\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::create(ProjectExplorer::BuildStepList *parent, const Core::Id id)\n{\n Q_ASSERT(canCreate(parent, id));\n Q_UNUSED(id);\n return new QmakeAndroidBuildApkStep(parent);\n}\n\nbool QmakeAndroidBuildApkStepFactory::canRestore(ProjectExplorer::BuildStepList *parent, const QVariantMap &map) const\n{\n return canCreate(parent, ProjectExplorer::idFromMap(map));\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::restore(ProjectExplorer::BuildStepList *parent, const QVariantMap &map)\n{\n Q_ASSERT(canRestore(parent, map));\n QmakeAndroidBuildApkStep * const step = new QmakeAndroidBuildApkStep(parent);\n if (!step->fromMap(map)) {\n delete step;\n return 0;\n }\n return step;\n}\n\nbool QmakeAndroidBuildApkStepFactory::canClone(ProjectExplorer::BuildStepList *parent, ProjectExplorer::BuildStep *product) const\n{\n return canCreate(parent, product->id());\n}\n\nProjectExplorer::BuildStep *QmakeAndroidBuildApkStepFactory::clone(ProjectExplorer::BuildStepList *parent, ProjectExplorer::BuildStep *product)\n{\n Q_ASSERT(canClone(parent, product));\n return new QmakeAndroidBuildApkStep(parent, static_cast<QmakeAndroidBuildApkStep *>(product));\n}\n\nbool QmakeAndroidBuildApkStepFactory::canHandle(ProjectExplorer::Target *t) const\n{\n return t->project()->supportsKit(t->kit())\n && AndroidManager::supportsAndroid(t)\n && qobject_cast<QmakeProject *>(t->project());\n}\n\n\nQmakeAndroidBuildApkStep::QmakeAndroidBuildApkStep(ProjectExplorer::BuildStepList *bc)\n :AndroidBuildApkStep(bc, ANDROID_BUILD_APK_ID)\n{\n ctor();\n}\n\nUtils::FileName QmakeAndroidBuildApkStep::proFilePathForInputFile() const\n{\n ProjectExplorer::RunConfiguration *rc = target()->activeRunConfiguration();\n if (auto *arc = qobject_cast<QmakeAndroidRunConfiguration *>(rc))\n return arc->proFilePath();\n return Utils::FileName();\n}\n\nQmakeAndroidBuildApkStep::QmakeAndroidBuildApkStep(ProjectExplorer::BuildStepList *bc, QmakeAndroidBuildApkStep *other)\n : AndroidBuildApkStep(bc, other)\n{\n ctor();\n}\n\nUtils::FileName QmakeAndroidBuildApkStep::androidPackageSourceDir() const\n{\n QmakeProjectManager::QmakeProject *pro = static_cast<QmakeProjectManager::QmakeProject *>(project());\n const QmakeProjectManager::QmakeProFileNode *node\n = pro->rootQmakeProjectNode()->findProFileFor(proFilePathForInputFile());\n if (!node)\n return Utils::FileName();\n return Utils::FileName::fromString(node->singleVariableValue(QmakeProjectManager::AndroidPackageSourceDir));\n}\n\nvoid QmakeAndroidBuildApkStep::ctor()\n{\n}\n\nbool QmakeAndroidBuildApkStep::init()\n{\n if (AndroidManager::checkForQt51Files(project()->projectDirectory()))\n emit addOutput(tr(\"Found old folder \\\"android\\\" in source directory. Qt 5.2 does not use that folder by default.\"), ErrorOutput);\n\n if (!AndroidBuildApkStep::init())\n return false;\n\n QtSupport::BaseQtVersion *version = QtSupport::QtKitInformation::qtVersion(target()->kit());\n if (!version)\n return false;\n\n QString command = version->qmakeProperty(\"QT_HOST_BINS\");\n if (!command.endsWith(QLatin1Char('\/')))\n command += QLatin1Char('\/');\n command += QLatin1String(\"androiddeployqt\");\n if (Utils::HostOsInfo::isWindowsHost())\n command += QLatin1String(\".exe\");\n\n QString deploymentMethod;\n if (m_deployAction == MinistroDeployment)\n deploymentMethod = QLatin1String(\"ministro\");\n else if (m_deployAction == DebugDeployment)\n deploymentMethod = QLatin1String(\"debug\");\n else if (m_deployAction == BundleLibrariesDeployment)\n deploymentMethod = QLatin1String(\"bundled\");\n\n ProjectExplorer::BuildConfiguration *bc = buildConfiguration();\n QString outputDir = bc->buildDirectory().appendPath(QLatin1String(Constants::ANDROID_BUILDDIRECTORY)).toString();\n\n const auto *pro = static_cast<QmakeProjectManager::QmakeProject *>(project());\n const QmakeProjectManager::QmakeProFileNode *node = pro->rootQmakeProjectNode()->findProFileFor(proFilePathForInputFile());\n m_skipBuilding = !node;\n if (m_skipBuilding)\n return true;\n\n QString inputFile = node->singleVariableValue(QmakeProjectManager::AndroidDeploySettingsFile);\n if (inputFile.isEmpty()) {\n m_skipBuilding = true;\n return true;\n }\n\n QStringList arguments;\n arguments << QLatin1String(\"--input\")\n << inputFile\n << QLatin1String(\"--output\")\n << outputDir\n << QLatin1String(\"--deployment\")\n << deploymentMethod\n << QLatin1String(\"--android-platform\")\n << AndroidManager::buildTargetSDK(target())\n << QLatin1String(\"--jdk\")\n << AndroidConfigurations::currentConfig().openJDKLocation().toString();\n\n if (m_verbose)\n arguments << QLatin1String(\"--verbose\");\n\n if (m_useGradle)\n arguments << QLatin1String(\"--gradle\");\n else\n arguments << QLatin1String(\"--ant\")\n << AndroidConfigurations::currentConfig().antToolPath().toString();\n\n\n QStringList argumentsPasswordConcealed = arguments;\n\n if (m_signPackage) {\n arguments << QLatin1String(\"--sign\")\n << m_keystorePath.toString()\n << m_certificateAlias\n << QLatin1String(\"--storepass\")\n << m_keystorePasswd;\n argumentsPasswordConcealed << QLatin1String(\"--sign\") << QLatin1String(\"******\")\n << QLatin1String(\"--storepass\") << QLatin1String(\"******\");\n if (!m_certificatePasswd.isEmpty()) {\n arguments << QLatin1String(\"--keypass\")\n << m_certificatePasswd;\n argumentsPasswordConcealed << QLatin1String(\"--keypass\")\n << QLatin1String(\"******\");\n }\n\n }\n\n ProjectExplorer::ProcessParameters *pp = processParameters();\n setupProcessParameters(pp, bc, arguments, command);\n\n \/\/ Generate arguments with keystore password concealed\n ProjectExplorer::ProcessParameters pp2;\n setupProcessParameters(&pp2, bc, argumentsPasswordConcealed, command);\n m_command = pp2.effectiveCommand();\n m_argumentsPasswordConcealed = pp2.prettyArguments();\n\n return true;\n}\n\nvoid QmakeAndroidBuildApkStep::run(QFutureInterface<bool> &fi)\n{\n if (m_skipBuilding) {\n emit addOutput(tr(\"No application .pro file found, not building an APK.\"), BuildStep::ErrorMessageOutput);\n fi.reportResult(true);\n emit finished();\n return;\n }\n AndroidBuildApkStep::run(fi);\n}\n\nvoid QmakeAndroidBuildApkStep::setupProcessParameters(ProjectExplorer::ProcessParameters *pp,\n ProjectExplorer::BuildConfiguration *bc,\n const QStringList &arguments,\n const QString &command)\n{\n pp->setMacroExpander(bc->macroExpander());\n pp->setWorkingDirectory(bc->buildDirectory().toString());\n Utils::Environment env = bc->environment();\n pp->setEnvironment(env);\n pp->setCommand(command);\n pp->setArguments(Utils::QtcProcess::joinArgs(arguments));\n pp->resolveAll();\n}\n\nvoid QmakeAndroidBuildApkStep::processStarted()\n{\n emit addOutput(tr(\"Starting: \\\"%1\\\" %2\")\n .arg(QDir::toNativeSeparators(m_command),\n m_argumentsPasswordConcealed),\n BuildStep::MessageOutput);\n}\n\nProjectExplorer::BuildStepConfigWidget *QmakeAndroidBuildApkStep::createConfigWidget()\n{\n return new QmakeAndroidBuildApkWidget(this);\n}\n\nbool QmakeAndroidBuildApkStep::fromMap(const QVariantMap &map)\n{\n return AndroidBuildApkStep::fromMap(map);\n}\n\nQVariantMap QmakeAndroidBuildApkStep::toMap() const\n{\n QVariantMap map = AndroidBuildApkStep::toMap();\n return map;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace QmakeAndroidSupport\n<|endoftext|>"} {"text":"<commit_before>\n#include \"ImguiWindowsFileIO.hpp\"\n\n#include <algorithm>\n#include <cstdlib>\n#include <sstream>\n\n#include <iostream>\n\n#if defined(_WINDOWS)\n #include <windows.h>\n #include <direct.h>\n #define GetCurrentDir _getcwd\n#else\n #include <unistd.h>\n #define GetCurrentDir getcwd\n #endif\n\n#define IM_ARRAYSIZE(_ARR) ((int)(sizeof(_ARR)\/sizeof(*_ARR)))\n\n#if defined(ICON_FA_CARET_DOWN)\n #define CARET_DOWN ICON_FA_CARET_DOWN\n#else\n #define CARET_DOWN \"v\"\n#endif\n\nusing namespace std;\nusing namespace ImGui;\n \n\nvector<string> stringSplit(const string &s, char delim)\n{\nvector<string> elems;\nstring item; \n\n\/\/ use stdlib to tokenize the string\nstringstream ss(s);\n while (getline(ss, item, delim))\n if(!item.empty())\n {\n elems.push_back(item);\n }\n\n return elems;\n}\n\nstring MiniPath::filePath() const\n{\n return path + name;\n}\n\nvoid MiniPath::fromString (const string& file_path, char delim)\n{\n int last_delim_pos = file_path.find_last_of (delim);\n name = file_path.substr (last_delim_pos+1);\n path = file_path.substr (0, last_delim_pos+1);\n}\n\nMiniPath::MiniPath()\n{}\n\nMiniPath::MiniPath( const string& some_path )\n{\n string s = some_path;\n if (MiniPath::isAbsoluteFilePath (s))\n {\n if (s.find (\"\/\") != string::npos) \/\/ linux style\n fromString (s ,'\/');\n else if (s.find (\"\\\\\") != string::npos) \/\/ windows style\n fromString (s ,'\\\\');\n }\n else\n {\n string current = MiniPath::getCurrentDir();\n\n if (current.find (\"\/\") != string::npos)\n {\n std::replace( s.begin(), s.end(), '\\\\', '\/');\n fromString (current + \"\/\" + s ,'\/');\n }\n else if (current.find (\"\\\\\") != string::npos)\n {\n std::replace( s.begin(), s.end(), '\/', '\\\\');\n fromString (current + \"\\\\\" + s ,'\\\\');\n }\n else\n fromNameInCurrentDir( s );\n }\n}\n\nstring MiniPath::getDelim() const\n{\n if (path.find (\"\/\") != string::npos) \/\/ linux style\n return \"\/\";\n else if (path.find (\"\\\\\") != string::npos) \/\/ windows style\n return \"\\\\\";\n else\n {\n return MiniPath::getSystemDelim();\n }\n}\n\nstd::string MiniPath::getSystemDelim()\n{\n string current = MiniPath::getCurrentDir();\n if (current.find (\"\/\") != string::npos) \/\/ linux style\n return \"\/\";\n else if (current.find (\"\\\\\") != string::npos) \/\/ windows style\n return \"\\\\\";\n else\n return \"\/\";\n}\n\nstring MiniPath::prefix() const\n{\n return name.substr (0, name.find_last_of ('.'));\n}\n\nstring MiniPath::extension() const\n{\n if (name.find (\".\") == string::npos)\n return \"\";\n\n return name.substr (name.find_last_of ('.')+1);\n}\n\nstring MiniPath::getCurrentDir()\n{\n char cCurrentPath[FILENAME_MAX];\n if (!GetCurrentDir(cCurrentPath, sizeof(cCurrentPath)))\n return 0;\n cCurrentPath[sizeof(cCurrentPath) - 1] = '\\0';\n return string (cCurrentPath);\n}\n\nvoid MiniPath::fromNameInCurrentDir( const string& file_name )\n{\n path = getCurrentDir();\n name = file_name;\n}\n\nstring MiniPath::getName() const\n{\n return name;\n}\n\nstring MiniPath::getPath() const\n{\n return path;\n}\n\nvector<string> MiniPath::getPathTokens() const\n{\n if( !getDelim().empty() ) \n return stringSplit( path + getDelim(), getDelim()[0] );\n\n vector<string> tmp;\n return tmp;\n}\n\nvoid MiniPath::setName( const string& name )\n{\n string tmp;\n unsigned last_delim_pos = name.find_last_of ('\/');\n if( last_delim_pos != string::npos )\n tmp = name.substr (last_delim_pos+1);\n else\n tmp = name;\n\n unsigned last_delim_pos2 = tmp.find_last_of ('\\\\');\n if( last_delim_pos2 != string::npos )\n tmp = tmp.substr (last_delim_pos2+1);\n\n this->name = tmp;\n}\n\nbool MiniPath::setPath( const string& absolut_path )\n{\n if (isAbsoluteFilePath( absolut_path ))\n {\n path = absolut_path;\n return true;\n }\n return false;\n}\n\nbool MiniPath::isAbsoluteFilePath( const string& s )\n{\n if (s.size() > 0)\n {\n if (s.at(0) == '\/' || s.at(1) == ':')\n return true;\n else\n return false;\n }\n else\n return false;\n}\n\nstd::list<string> MiniPath::listDirectories( const string& s )\n{\n list<string> directories;\n\n struct _finddata_t c_file;\n intptr_t hFile;\n\n string filter = s + MiniPath::getSystemDelim() + \"*.*\";\n\n if( (hFile = _findfirst( filter.c_str(), &c_file )) == -1L )\n {}\n else\n {\n do \n { \n char buffer[256]; \n if( ( c_file.attrib & _A_SUBDIR ) )\n directories.push_back( string( c_file.name ) );\n } while( _findnext( hFile, &c_file ) == 0 ); \n }\n\n return directories;\n}\n\nstd::list<string> MiniPath::listFiles( const string& s, string filter )\n{\n list<string> files;\n\n struct _finddata_t c_file;\n intptr_t hFile;\n\n string find_filter = s + MiniPath::getSystemDelim() + filter;\n\n if( (hFile = _findfirst( find_filter.c_str(), &c_file )) == -1L )\n {}\n else\n {\n do \n { \n char buffer[256]; \n if( !( c_file.attrib & _A_SUBDIR ) )\n files.push_back( string( c_file.name ) );\n } while( _findnext( hFile, &c_file ) == 0 ); \n }\n\n return files;\n}\n\nbool fileIOWindow(\n string& file_path,\n std::vector<string>& recently_used_files,\n const string& button_text,\n ImVec2 size )\n{\n bool close_it = false;\n\n std::vector<const char*> extension_cstrings { \"*.usr\", \"*.*\" };\n\n static char current_folder[ 2048 ] = \"x\";\n if( strcmp( current_folder, \"x\" ) == 0 )\n strcpy( current_folder, MiniPath::getCurrentDir().c_str() );\n static char current_file[ 256 ] = \"Test.usr\";\n static int file_type_selected = 0;\n static int file_selected = 0;\n static int directory_selected = 0;\n static bool directory_browsing = false;\n static int recent_selected = 0;\n\n string sys_delim = MiniPath::getSystemDelim();\n\n string tmp = string( current_folder ) + sys_delim;\n MiniPath current_mini_path( tmp );\n\n list<string> directories = MiniPath::listDirectories( current_mini_path.getPath() );\n std::vector<const char*> dir_list;\n for( const string& s : directories )\n dir_list.push_back( s.c_str() );\n \n list<string> local_files = MiniPath::listFiles( current_mini_path.getPath(), string( extension_cstrings[file_type_selected] ) );\n std::vector<const char*> file_list; \n for( const string& s : local_files )\n file_list.push_back( s.c_str() );\n\n if ( directory_browsing ) \n size.y += std::min( size_t( 8 ), std::max( dir_list.size(), file_list.size() ) ) * GetFontSize();\n\n SetNextWindowSize( size );\n Begin( \"FileIO\" );\n\n Text(\"Directory: \"); SameLine();\n PushItemWidth( GetWindowWidth() - 145 ); \n\n InputText( \" \", current_folder, IM_ARRAYSIZE( current_folder ) ); SameLine();\n\n std::vector<const char*> recent {};\n for( const auto& string : recently_used_files )\n recent.push_back(string.c_str());\n\n if( Button(\" \" CARET_DOWN \" \") )\n ImGui::OpenPopup(\"RecentFiles\");\n\n if (ImGui::BeginPopup(\"RecentFiles\"))\n {\n if( ListBox( \"\", &recent_selected, recent.data(), recent.size() ) )\n {\n strcpy(current_file, recent[recent_selected]);\n file_path = current_file;\n CloseCurrentPopup();\n }\n ImGui::EndPopup();\n }\n\n Text(\" \"); SameLine();\n vector<string> split_directories = current_mini_path.getPathTokens();\n for( int i = 0; i < split_directories.size(); ++i )\n {\n if( Button( split_directories[i].c_str() ) )\n {\n string chosen_dir;\n for( int j ; j <= i; ++j)\n {\n chosen_dir += split_directories[j];\n if( j != i )\n chosen_dir += sys_delim;\n }\n strcpy( current_folder, chosen_dir.c_str() );\n } \n if( i != split_directories.size()-1 )\n SameLine();\n }\n\n if( CollapsingHeader(\"Browse Directories\") )\n {\n directory_browsing = true;\n Text( \" \" );\n SameLine();\n\n PushItemWidth( GetWindowWidth()\/2 - 60 );\n if( ListBox( \" \", &directory_selected, dir_list.data(), dir_list.size() ) )\n {\n string new_path = string( current_folder ) + sys_delim + dir_list[directory_selected];\n strcpy( current_folder, new_path.c_str() );\n }\n\n SameLine();\n PushItemWidth( GetWindowWidth()\/2 - 60 );\n if( ListBox( \"\", &file_selected, file_list.data(), file_list.size() ) )\n {\n strcpy( current_file, file_list[file_selected] );\n }\n }\n else\n directory_browsing = false;\n\n Text(\" \");\n\n Text(\"File Name: \"); SameLine();\n InputText( \" \", current_file, IM_ARRAYSIZE( current_file ) );\n\n Text( \"File Type: \" ); SameLine(); Text( extension_cstrings[file_type_selected] ); SameLine(); \n if (Button( CARET_DOWN ) )\n ImGui::OpenPopup(\"FileType\");\n\n if (ImGui::BeginPopup(\"FileType\"))\n {\n if( ListBox( \"\", &file_type_selected, extension_cstrings.data(), extension_cstrings.size() ) )\n {\n CloseCurrentPopup();\n }\n ImGui::EndPopup();\n }\n\n ImVec2 pos = GetCursorPos();\n\n pos.x += GetWindowWidth() - 75 - button_text.size() * ( GetFontSize() * 0.7 );\n pos.y = GetWindowHeight() - 30;\n\n SetCursorPos( pos );\n if( Button( button_text.c_str() ) )\n {\n file_path = current_file;\n close_it = true;\n }\n\n SameLine();\n if( Button( \"Cancel\" ) )\n close_it = true;\n End();\n\n return close_it;\n}\n<commit_msg>add drive list selector for windows<commit_after>\n#include \"ImguiWindowsFileIO.hpp\"\n\n#include <algorithm>\n#include <cstdlib>\n#include <sstream>\n\n#include <iostream>\n\n#if defined(WIN32)\n #include <windows.h>\n #include <direct.h>\n #include <tchar.h> \n #define GetCurrentDir _getcwd\n#else\n #include <unistd.h>\n #define GetCurrentDir getcwd\n #endif\n\n#define IM_ARRAYSIZE(_ARR) ((int)(sizeof(_ARR)\/sizeof(*_ARR)))\n\n#if defined(ICON_FA_CARET_DOWN)\n #define CARET_DOWN ICON_FA_CARET_DOWN\n#else\n #define CARET_DOWN \"v\"\n#endif\n\nusing namespace std;\nusing namespace ImGui;\n \n#if defined(WIN32)\nvector<string> getWindowsDrives()\n{\n vector<string> result;\n TCHAR g_szDrvMsg[] = _T(\"A:\");\n\n ULONG uDriveMask = _getdrives(); \n \n if (uDriveMask == 0) \n {} \n else \n { \n while (uDriveMask) \n { \n if (uDriveMask & 1) \n result.push_back( g_szDrvMsg );\n \n ++g_szDrvMsg[0]; \n uDriveMask >>= 1; \n } \n } \n\n return result;\n}\n#endif \n\nvector<string> stringSplit(const string &s, char delim)\n{\nvector<string> elems;\nstring item; \n\n\/\/ use stdlib to tokenize the string\nstringstream ss(s);\n while (getline(ss, item, delim))\n if(!item.empty())\n {\n elems.push_back(item);\n }\n\n return elems;\n}\n\nstring MiniPath::filePath() const\n{\n return path + name;\n}\n\nvoid MiniPath::fromString (const string& file_path, char delim)\n{\n int last_delim_pos = file_path.find_last_of (delim);\n name = file_path.substr (last_delim_pos+1);\n path = file_path.substr (0, last_delim_pos+1);\n}\n\nMiniPath::MiniPath()\n{}\n\nMiniPath::MiniPath( const string& some_path )\n{\n string s = some_path;\n if (MiniPath::isAbsoluteFilePath (s))\n {\n if (s.find (\"\/\") != string::npos) \/\/ linux style\n fromString (s ,'\/');\n else if (s.find (\"\\\\\") != string::npos) \/\/ windows style\n fromString (s ,'\\\\');\n }\n else\n {\n string current = MiniPath::getCurrentDir();\n\n if (current.find (\"\/\") != string::npos)\n {\n std::replace( s.begin(), s.end(), '\\\\', '\/');\n fromString (current + \"\/\" + s ,'\/');\n }\n else if (current.find (\"\\\\\") != string::npos)\n {\n std::replace( s.begin(), s.end(), '\/', '\\\\');\n fromString (current + \"\\\\\" + s ,'\\\\');\n }\n else\n fromNameInCurrentDir( s );\n }\n}\n\nstring MiniPath::getDelim() const\n{\n if (path.find (\"\/\") != string::npos) \/\/ linux style\n return \"\/\";\n else if (path.find (\"\\\\\") != string::npos) \/\/ windows style\n return \"\\\\\";\n else\n {\n return MiniPath::getSystemDelim();\n }\n}\n\nstd::string MiniPath::getSystemDelim()\n{\n string current = MiniPath::getCurrentDir();\n if (current.find (\"\/\") != string::npos) \/\/ linux style\n return \"\/\";\n else if (current.find (\"\\\\\") != string::npos) \/\/ windows style\n return \"\\\\\";\n else\n return \"\/\";\n}\n\nstring MiniPath::prefix() const\n{\n return name.substr (0, name.find_last_of ('.'));\n}\n\nstring MiniPath::extension() const\n{\n if (name.find (\".\") == string::npos)\n return \"\";\n\n return name.substr (name.find_last_of ('.')+1);\n}\n\nstring MiniPath::getCurrentDir()\n{\n char cCurrentPath[FILENAME_MAX];\n if (!GetCurrentDir(cCurrentPath, sizeof(cCurrentPath)))\n return 0;\n cCurrentPath[sizeof(cCurrentPath) - 1] = '\\0';\n return string (cCurrentPath);\n}\n\nvoid MiniPath::fromNameInCurrentDir( const string& file_name )\n{\n path = getCurrentDir();\n name = file_name;\n}\n\nstring MiniPath::getName() const\n{\n return name;\n}\n\nstring MiniPath::getPath() const\n{\n return path;\n}\n\nvector<string> MiniPath::getPathTokens() const\n{\n if( !getDelim().empty() ) \n return stringSplit( path + getDelim(), getDelim()[0] );\n\n vector<string> tmp;\n return tmp;\n}\n\nvoid MiniPath::setName( const string& name )\n{\n string tmp;\n unsigned last_delim_pos = name.find_last_of ('\/');\n if( last_delim_pos != string::npos )\n tmp = name.substr (last_delim_pos+1);\n else\n tmp = name;\n\n unsigned last_delim_pos2 = tmp.find_last_of ('\\\\');\n if( last_delim_pos2 != string::npos )\n tmp = tmp.substr (last_delim_pos2+1);\n\n this->name = tmp;\n}\n\nbool MiniPath::setPath( const string& absolut_path )\n{\n if (isAbsoluteFilePath( absolut_path ))\n {\n path = absolut_path;\n return true;\n }\n return false;\n}\n\nbool MiniPath::isAbsoluteFilePath( const string& s )\n{\n if (s.size() > 0)\n {\n if (s.at(0) == '\/' || s.at(1) == ':')\n return true;\n else\n return false;\n }\n else\n return false;\n}\n\nstd::list<string> MiniPath::listDirectories( const string& s )\n{\n list<string> directories;\n\n struct _finddata_t c_file;\n intptr_t hFile;\n\n string filter = s + MiniPath::getSystemDelim() + \"*.*\";\n\n if( (hFile = _findfirst( filter.c_str(), &c_file )) == -1L )\n {}\n else\n {\n do \n { \n char buffer[256]; \n if( ( c_file.attrib & _A_SUBDIR ) )\n directories.push_back( string( c_file.name ) );\n } while( _findnext( hFile, &c_file ) == 0 ); \n }\n\n return directories;\n}\n\nstd::list<string> MiniPath::listFiles( const string& s, string filter )\n{\n list<string> files;\n\n struct _finddata_t c_file;\n intptr_t hFile;\n\n string find_filter = s + MiniPath::getSystemDelim() + filter;\n\n if( (hFile = _findfirst( find_filter.c_str(), &c_file )) == -1L )\n {}\n else\n {\n do \n { \n char buffer[256]; \n if( !( c_file.attrib & _A_SUBDIR ) )\n files.push_back( string( c_file.name ) );\n } while( _findnext( hFile, &c_file ) == 0 ); \n }\n\n return files;\n}\n\nbool fileIOWindow(\n string& file_path,\n std::vector<string>& recently_used_files,\n const string& button_text,\n ImVec2 size )\n{\n bool close_it = false;\n\n std::vector<const char*> extension_cstrings { \"*.usr\", \"*.*\" };\n\n static char current_folder[ 2048 ] = \"x\";\n if( strcmp( current_folder, \"x\" ) == 0 )\n strcpy( current_folder, MiniPath::getCurrentDir().c_str() );\n static char current_file[ 256 ] = \"Test.usr\";\n static int file_type_selected = 0;\n static int file_selected = 0;\n static int directory_selected = 0;\n static int drive_selected = 0;\n static bool directory_browsing = false;\n static int recent_selected = 0;\n\n string sys_delim = MiniPath::getSystemDelim();\n\n string tmp = string( current_folder ) + sys_delim;\n MiniPath current_mini_path( tmp );\n\n list<string> directories = MiniPath::listDirectories( current_mini_path.getPath() );\n std::vector<const char*> dir_list;\n for( const string& s : directories )\n dir_list.push_back( s.c_str() );\n \n list<string> local_files = MiniPath::listFiles( current_mini_path.getPath(), string( extension_cstrings[file_type_selected] ) );\n std::vector<const char*> file_list; \n for( const string& s : local_files )\n file_list.push_back( s.c_str() );\n\n if ( directory_browsing ) \n size.y += std::min( size_t( 8 ), std::max( dir_list.size(), file_list.size() ) ) * GetFontSize();\n\n SetNextWindowSize( size );\n Begin( \"FileIO\" );\n\n Text(\"Directory: \"); SameLine();\n PushItemWidth( GetWindowWidth() - 145 ); \n\n InputText( \" \", current_folder, IM_ARRAYSIZE( current_folder ) ); SameLine();\n\n std::vector<const char*> recent {};\n for( const auto& string : recently_used_files )\n recent.push_back(string.c_str());\n\n if( Button(\" \" CARET_DOWN \" \") )\n ImGui::OpenPopup(\"RecentFiles\");\n\n if (ImGui::BeginPopup(\"RecentFiles\"))\n {\n if( ListBox( \"\", &recent_selected, recent.data(), recent.size() ) )\n {\n strcpy(current_file, recent[recent_selected]);\n file_path = current_file;\n CloseCurrentPopup();\n }\n ImGui::EndPopup();\n }\n\n Text(\" \"); SameLine();\n vector<string> split_directories = current_mini_path.getPathTokens();\n for( int i = 0; i < split_directories.size(); ++i )\n {\n if( Button( split_directories[i].c_str() ) )\n {\n string chosen_dir;\n for( int j ; j <= i; ++j)\n {\n chosen_dir += split_directories[j];\n if( j != i )\n chosen_dir += sys_delim;\n }\n strcpy( current_folder, chosen_dir.c_str() );\n } \n if( i != split_directories.size()-1 )\n SameLine();\n }\n\n if( CollapsingHeader(\"Browse Directories\") )\n {\n directory_browsing = true;\n\n#if defined(WIN32)\n vector<const char*> drive_list;\n for( const string& s : getWindowsDrives() )\n drive_list.push_back( s.c_str() );\n \n Text( \" \" ); SameLine();\n PushItemWidth( 40 );\n if( ListBox( \" \", &drive_selected, drive_list.data(), drive_list.size() ) )\n {\n string new_path = drive_list[drive_selected];\n strcpy( current_folder, new_path.c_str() );\n }\n#else\n Text( \" \" );\n#endif\n SameLine();\n\n PushItemWidth( GetWindowWidth()\/2 - 60 );\n if( ListBox( \" \", &directory_selected, dir_list.data(), dir_list.size() ) )\n {\n string new_path = string( current_folder ) + sys_delim + dir_list[directory_selected];\n strcpy( current_folder, new_path.c_str() );\n }\n\n SameLine();\n PushItemWidth( GetWindowWidth()\/2 - 60 );\n if( ListBox( \"\", &file_selected, file_list.data(), file_list.size() ) )\n {\n strcpy( current_file, file_list[file_selected] );\n }\n }\n else\n directory_browsing = false;\n\n Text(\" \");\n\n Text(\"File Name: \"); SameLine();\n InputText( \" \", current_file, IM_ARRAYSIZE( current_file ) );\n\n Text( \"File Type: \" ); SameLine(); Text( extension_cstrings[file_type_selected] ); SameLine(); \n if (Button( CARET_DOWN ) )\n ImGui::OpenPopup(\"FileType\");\n\n if (ImGui::BeginPopup(\"FileType\"))\n {\n if( ListBox( \"\", &file_type_selected, extension_cstrings.data(), extension_cstrings.size() ) )\n {\n CloseCurrentPopup();\n }\n ImGui::EndPopup();\n }\n\n ImVec2 pos = GetCursorPos();\n\n pos.x += GetWindowWidth() - 75 - button_text.size() * ( GetFontSize() * 0.7 );\n pos.y = GetWindowHeight() - 30;\n\n SetCursorPos( pos );\n if( Button( button_text.c_str() ) )\n {\n file_path = current_file;\n close_it = true;\n }\n\n SameLine();\n if( Button( \"Cancel\" ) )\n close_it = true;\n End();\n\n return close_it;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <ctime>\n\n#include \"TestFile.hpp\"\n\nusing namespace std;\nusing namespace nix;\n\n\nvoid TestFile::setUp() {\n statup_time = time(NULL);\n file_open = File::open(\"test_file.h5\", FileMode::Overwrite);\n file_other = File::open(\"test_file_other.h5\", FileMode::Overwrite);\n file_null = NULL;\n}\n\n\nvoid TestFile::tearDown() {\n file_open = NULL; \/\/ TODO fix this as soon as there is a nicer method for closing files\n file_other = NULL;\n}\n\n\nvoid TestFile::testFormat() {\n CPPUNIT_ASSERT(file_open.format() == \"pandora\");\n}\n\n\nvoid TestFile::testVersion() {\n CPPUNIT_ASSERT(file_open.version() == \"1.0\");\n}\n\n\nvoid TestFile::testCreatedAt() {\n CPPUNIT_ASSERT(file_open.createdAt() >= statup_time);\n time_t past_time = time(NULL) - 10000000;\n file_open.forceCreatedAt(past_time);\n CPPUNIT_ASSERT(file_open.createdAt() == past_time);\n}\n\n\nvoid TestFile::testUpdatedAt() {\n CPPUNIT_ASSERT(file_open.updatedAt() >= statup_time);\n}\n\n\nvoid TestFile::testBlockAccess() {\n vector<string> names = { \"block_a\", \"block_b\", \"block_c\", \"block_d\", \"block_e\" };\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Block bl = file_open.createBlock(*it, \"dataset\");\n CPPUNIT_ASSERT(bl.name() == *it);\n\n ids.push_back(bl.id());\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == names.size());\n CPPUNIT_ASSERT(file_open.blocks().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Block bl = file_open.getBlock(*it);\n CPPUNIT_ASSERT(file_open.hasBlock(*it) == true);\n CPPUNIT_ASSERT(bl.id() == *it);\n\n file_open.removeBlock(*it);\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n}\n\n\nvoid TestFile::testSectionAccess() {\n vector<string> names = {\"section_a\", \"section_b\", \"section_c\", \"section_d\", \"section_e\" };\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Section sec = file_open.createSection(*it, \"root section\");\n CPPUNIT_ASSERT(sec.name() == *it);\n\n ids.push_back(sec.id());\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == names.size());\n CPPUNIT_ASSERT(file_open.sections().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Section sec = file_open.getSection(*it);\n CPPUNIT_ASSERT(file_open.hasSection(*it) == true);\n CPPUNIT_ASSERT(sec.id() == *it);\n\n file_open.removeSection(*it);\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n}\n\n\nvoid TestFile::testOperators(){\n CPPUNIT_ASSERT(file_null == NULL);\n CPPUNIT_ASSERT(file_null == nullptr);\n\n CPPUNIT_ASSERT(file_open != NULL);\n CPPUNIT_ASSERT(file_open != nullptr);\n\n CPPUNIT_ASSERT(file_open == file_open);\n CPPUNIT_ASSERT(file_open != file_other);\n\n file_other = file_open;\n CPPUNIT_ASSERT(file_other == file_open);\n\n file_other = nullptr;\n CPPUNIT_ASSERT(file_null == NULL);\n CPPUNIT_ASSERT(file_null == nullptr);\n}\n\n<commit_msg>Use the new close method in TestFile<commit_after>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <ctime>\n\n#include \"TestFile.hpp\"\n\nusing namespace std;\nusing namespace nix;\n\n\nvoid TestFile::setUp() {\n statup_time = time(NULL);\n file_open = File::open(\"test_file.h5\", FileMode::Overwrite);\n file_other = File::open(\"test_file_other.h5\", FileMode::Overwrite);\n file_null = NULL;\n}\n\n\nvoid TestFile::tearDown() {\n file_open.close();\n file_other.close();\n}\n\n\nvoid TestFile::testFormat() {\n CPPUNIT_ASSERT(file_open.format() == \"pandora\");\n}\n\n\nvoid TestFile::testVersion() {\n CPPUNIT_ASSERT(file_open.version() == \"1.0\");\n}\n\n\nvoid TestFile::testCreatedAt() {\n CPPUNIT_ASSERT(file_open.createdAt() >= statup_time);\n time_t past_time = time(NULL) - 10000000;\n file_open.forceCreatedAt(past_time);\n CPPUNIT_ASSERT(file_open.createdAt() == past_time);\n}\n\n\nvoid TestFile::testUpdatedAt() {\n CPPUNIT_ASSERT(file_open.updatedAt() >= statup_time);\n}\n\n\nvoid TestFile::testBlockAccess() {\n vector<string> names = { \"block_a\", \"block_b\", \"block_c\", \"block_d\", \"block_e\" };\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Block bl = file_open.createBlock(*it, \"dataset\");\n CPPUNIT_ASSERT(bl.name() == *it);\n\n ids.push_back(bl.id());\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == names.size());\n CPPUNIT_ASSERT(file_open.blocks().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Block bl = file_open.getBlock(*it);\n CPPUNIT_ASSERT(file_open.hasBlock(*it) == true);\n CPPUNIT_ASSERT(bl.id() == *it);\n\n file_open.removeBlock(*it);\n }\n\n CPPUNIT_ASSERT(file_open.blockCount() == 0);\n CPPUNIT_ASSERT(file_open.blocks().size() == 0);\n}\n\n\nvoid TestFile::testSectionAccess() {\n vector<string> names = {\"section_a\", \"section_b\", \"section_c\", \"section_d\", \"section_e\" };\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n\n vector<string> ids;\n for (auto it = names.begin(); it != names.end(); it++) {\n Section sec = file_open.createSection(*it, \"root section\");\n CPPUNIT_ASSERT(sec.name() == *it);\n\n ids.push_back(sec.id());\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == names.size());\n CPPUNIT_ASSERT(file_open.sections().size() == names.size());\n\n for (auto it = ids.begin(); it != ids.end(); it++) {\n Section sec = file_open.getSection(*it);\n CPPUNIT_ASSERT(file_open.hasSection(*it) == true);\n CPPUNIT_ASSERT(sec.id() == *it);\n\n file_open.removeSection(*it);\n }\n\n CPPUNIT_ASSERT(file_open.sectionCount() == 0);\n CPPUNIT_ASSERT(file_open.sections().size() == 0);\n}\n\n\nvoid TestFile::testOperators(){\n CPPUNIT_ASSERT(file_null == NULL);\n CPPUNIT_ASSERT(file_null == nullptr);\n\n CPPUNIT_ASSERT(file_open != NULL);\n CPPUNIT_ASSERT(file_open != nullptr);\n\n CPPUNIT_ASSERT(file_open == file_open);\n CPPUNIT_ASSERT(file_open != file_other);\n\n file_other = file_open;\n CPPUNIT_ASSERT(file_other == file_open);\n\n file_other = nullptr;\n CPPUNIT_ASSERT(file_null == NULL);\n CPPUNIT_ASSERT(file_null == nullptr);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2017, Ford Motor Company\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are met:\n*\n* Redistributions of source code must retain the above copyright notice, this\n* list of conditions and the following disclaimer.\n*\n* Redistributions in binary form must reproduce the above copyright notice,\n* this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided with the\n* distribution.\n*\n* Neither the name of the Ford Motor Company nor the names of its contributors\n* may be used to endorse or promote products derived from this software\n* without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"life_cycle.h\"\n#include \"utils\/signals.h\"\n#include \"utils\/make_shared.h\"\n#include \"config_profile\/profile.h\"\n#include \"resumption\/last_state_impl.h\"\n\n#ifdef ENABLE_SECURITY\n#include \"security_manager\/security_manager_impl.h\"\n#include \"security_manager\/crypto_manager_impl.h\"\n#include \"security_manager\/crypto_manager_settings_impl.h\"\n#include \"application_manager\/policies\/policy_handler.h\"\n#endif \/\/ ENABLE_SECURITY\n\n#ifdef ENABLE_LOG\n#include \"utils\/log_message_loop_thread.h\"\n#endif \/\/ ENABLE_LOG\n\nusing threads::Thread;\n\nnamespace main_namespace {\n\nCREATE_LOGGERPTR_GLOBAL(logger_, \"SDLMain\")\n\nLifeCycle::LifeCycle(const profile::Profile& profile)\n : transport_manager_(NULL)\n , protocol_handler_(NULL)\n , connection_handler_(NULL)\n , app_manager_(NULL)\n#ifdef ENABLE_SECURITY\n , crypto_manager_(NULL)\n , security_manager_(NULL)\n#endif \/\/ ENABLE_SECURITY\n , hmi_handler_(NULL)\n , hmi_message_adapter_(NULL)\n , media_manager_(NULL)\n , last_state_(NULL)\n#ifdef TELEMETRY_MONITOR\n , telemetry_monitor_(NULL)\n#endif \/\/ TELEMETRY_MONITOR\n#ifdef DBUS_HMIADAPTER\n , dbus_adapter_(NULL)\n , dbus_adapter_thread_(NULL)\n#endif \/\/ DBUS_HMIADAPTER\n#ifdef MESSAGEBROKER_HMIADAPTER\n , mb_adapter_(NULL)\n , mb_adapter_thread_(NULL)\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n , profile_(profile) {\n}\n\nbool LifeCycle::StartComponents() {\n LOG4CXX_AUTO_TRACE(logger_);\n DCHECK(!last_state_);\n last_state_ = new resumption::LastStateImpl(profile_.app_storage_folder(),\n profile_.app_info_storage());\n\n DCHECK(!transport_manager_);\n transport_manager_ = new transport_manager::TransportManagerDefault(profile_);\n\n DCHECK(!connection_handler_);\n connection_handler_ = new connection_handler::ConnectionHandlerImpl(\n profile_, *transport_manager_);\n\n DCHECK(!protocol_handler_);\n protocol_handler_ =\n new protocol_handler::ProtocolHandlerImpl(profile_,\n *connection_handler_,\n *connection_handler_,\n *transport_manager_);\n DCHECK(protocol_handler_);\n\n DCHECK(!app_manager_);\n app_manager_ =\n new application_manager::ApplicationManagerImpl(profile_, profile_);\n\n DCHECK(!hmi_handler_);\n hmi_handler_ = new hmi_message_handler::HMIMessageHandlerImpl(profile_);\n\n hmi_handler_->set_message_observer(app_manager_);\n app_manager_->set_hmi_message_handler(hmi_handler_);\n\n media_manager_ = new media_manager::MediaManagerImpl(*app_manager_, profile_);\n app_manager_->set_connection_handler(connection_handler_);\n if (!app_manager_->Init(*last_state_, media_manager_)) {\n LOG4CXX_ERROR(logger_, \"Application manager init failed.\");\n return false;\n }\n\n#ifdef ENABLE_SECURITY\n security_manager_ = new security_manager::SecurityManagerImpl();\n crypto_manager_ = new security_manager::CryptoManagerImpl(\n utils::MakeShared<security_manager::CryptoManagerSettingsImpl>(\n profile_, app_manager_->GetPolicyHandler().RetrieveCertificate()));\n protocol_handler_->AddProtocolObserver(security_manager_);\n protocol_handler_->set_security_manager(security_manager_);\n\n security_manager_->set_session_observer(connection_handler_);\n security_manager_->set_protocol_handler(protocol_handler_);\n security_manager_->set_crypto_manager(crypto_manager_);\n security_manager_->AddListener(app_manager_);\n\n app_manager_->AddPolicyObserver(crypto_manager_);\n app_manager_->AddPolicyObserver(protocol_handler_);\n if (!crypto_manager_->Init()) {\n LOG4CXX_ERROR(logger_, \"CryptoManager initialization fail.\");\n return false;\n }\n#endif \/\/ ENABLE_SECURITY\n\n transport_manager_->AddEventListener(protocol_handler_);\n transport_manager_->AddEventListener(connection_handler_);\n\n protocol_handler_->AddProtocolObserver(media_manager_);\n protocol_handler_->AddProtocolObserver(app_manager_);\n\n media_manager_->SetProtocolHandler(protocol_handler_);\n\n connection_handler_->set_protocol_handler(protocol_handler_);\n connection_handler_->set_connection_handler_observer(app_manager_);\n\n\/\/ it is important to initialise TelemetryMonitor before TM to listen TM\n\/\/ Adapters\n#ifdef TELEMETRY_MONITOR\n telemetry_monitor_ = new telemetry_monitor::TelemetryMonitor(\n profile_.server_address(), profile_.time_testing_port());\n telemetry_monitor_->Start();\n telemetry_monitor_->Init(protocol_handler_, app_manager_, transport_manager_);\n#endif \/\/ TELEMETRY_MONITOR\n \/\/ It's important to initialise TM after setting up listener chain\n \/\/ [TM -> CH -> AM], otherwise some events from TM could arrive at nowhere\n app_manager_->set_protocol_handler(protocol_handler_);\n\n transport_manager_->Init(*last_state_);\n \/\/ start transport manager\n transport_manager_->Visibility(true);\n\n return true;\n}\n\n#ifdef MESSAGEBROKER_HMIADAPTER\nbool LifeCycle::InitMessageSystem() {\n mb_adapter_ = new hmi_message_handler::MessageBrokerAdapter(\n hmi_handler_, profile_.server_address(), profile_.server_port());\n\n if (!mb_adapter_->StartListener()) {\n return false;\n }\n\n hmi_handler_->AddHMIMessageAdapter(mb_adapter_);\n mb_adapter_thread_ = new std::thread(\n &hmi_message_handler::MessageBrokerAdapter::Run, mb_adapter_);\n return true;\n}\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n\n#ifdef DBUS_HMIADAPTER\n\/**\n * Initialize DBus component\n * @return true if success otherwise false.\n *\/\nbool LifeCycle::InitMessageSystem() {\n dbus_adapter_ = new hmi_message_handler::DBusMessageAdapter(hmi_handler_);\n\n hmi_handler_->AddHMIMessageAdapter(dbus_adapter_);\n if (!dbus_adapter_->Init()) {\n LOG4CXX_FATAL(logger_, \"Cannot init DBus service!\");\n return false;\n }\n\n dbus_adapter_->SubscribeTo();\n\n LOG4CXX_INFO(logger_, \"Start DBusMessageAdapter thread!\");\n dbus_adapter_thread_ = new std::thread(\n &hmi_message_handler::DBusMessageAdapter::Run, dbus_adapter_);\n\n return true;\n}\n#endif \/\/ DBUS_HMIADAPTER\n\nnamespace {\nvoid sig_handler(int sig) {\n switch (sig) {\n case SIGINT:\n LOG4CXX_DEBUG(logger_, \"SIGINT signal has been caught\");\n break;\n case SIGTERM:\n LOG4CXX_DEBUG(logger_, \"SIGTERM signal has been caught\");\n break;\n case SIGSEGV:\n LOG4CXX_DEBUG(logger_, \"SIGSEGV signal has been caught\");\n FLUSH_LOGGER();\n \/\/ exit need to prevent endless sending SIGSEGV\n \/\/ http:\/\/stackoverflow.com\/questions\/2663456\/how-to-write-a-signal-handler-to-catch-sigsegv\n abort();\n default:\n LOG4CXX_DEBUG(logger_, \"Unexpected signal has been caught\");\n exit(EXIT_FAILURE);\n }\n}\n} \/\/ namespace\n\nvoid LifeCycle::Run() {\n LOG4CXX_AUTO_TRACE(logger_);\n \/\/ Register signal handlers and wait sys signals\n \/\/ from OS\n if (!utils::WaitTerminationSignals(&sig_handler)) {\n LOG4CXX_FATAL(logger_, \"Fail to catch system signal!\");\n }\n}\n\nvoid LifeCycle::StopComponents() {\n LOG4CXX_AUTO_TRACE(logger_);\n\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->set_message_observer(NULL);\n\n DCHECK_OR_RETURN_VOID(connection_handler_);\n connection_handler_->set_connection_handler_observer(NULL);\n\n DCHECK_OR_RETURN_VOID(protocol_handler_);\n protocol_handler_->RemoveProtocolObserver(app_manager_);\n\n DCHECK_OR_RETURN_VOID(app_manager_);\n app_manager_->Stop();\n\n LOG4CXX_INFO(logger_, \"Stopping Protocol Handler\");\n DCHECK_OR_RETURN_VOID(protocol_handler_);\n protocol_handler_->RemoveProtocolObserver(media_manager_);\n\n#ifdef ENABLE_SECURITY\n protocol_handler_->RemoveProtocolObserver(security_manager_);\n if (security_manager_) {\n security_manager_->RemoveListener(app_manager_);\n LOG4CXX_INFO(logger_, \"Destroying Crypto Manager\");\n delete crypto_manager_;\n crypto_manager_ = NULL;\n LOG4CXX_INFO(logger_, \"Destroying Security Manager\");\n delete security_manager_;\n security_manager_ = NULL;\n }\n#endif \/\/ ENABLE_SECURITY\n protocol_handler_->Stop();\n\n LOG4CXX_INFO(logger_, \"Destroying Media Manager\");\n DCHECK_OR_RETURN_VOID(media_manager_);\n media_manager_->SetProtocolHandler(NULL);\n delete media_manager_;\n media_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Transport Manager.\");\n DCHECK_OR_RETURN_VOID(transport_manager_);\n transport_manager_->Visibility(false);\n transport_manager_->Stop();\n delete transport_manager_;\n transport_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Stopping Connection Handler.\");\n DCHECK_OR_RETURN_VOID(connection_handler_);\n connection_handler_->Stop();\n\n LOG4CXX_INFO(logger_, \"Destroying Protocol Handler\");\n DCHECK(protocol_handler_);\n delete protocol_handler_;\n protocol_handler_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Connection Handler.\");\n delete connection_handler_;\n connection_handler_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Last State\");\n DCHECK(last_state_);\n delete last_state_;\n last_state_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Application Manager.\");\n DCHECK(app_manager_);\n delete app_manager_;\n app_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying HMI Message Handler and MB adapter.\");\n\n#ifdef DBUS_HMIADAPTER\n if (dbus_adapter_) {\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->RemoveHMIMessageAdapter(dbus_adapter_);\n dbus_adapter_->Shutdown();\n dbus_adapter_thread_->join();\n delete dbus_adapter_;\n dbus_adapter_ = NULL;\n delete dbus_adapter_thread_;\n dbus_adapter_thread_ = NULL;\n }\n#endif \/\/ DBUS_HMIADAPTER\n\n#ifdef MESSAGEBROKER_HMIADAPTER\n if (mb_adapter_) {\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->RemoveHMIMessageAdapter(mb_adapter_);\n mb_adapter_->unregisterController();\n mb_adapter_->exitReceivingThread();\n mb_adapter_thread_->join();\n delete mb_adapter_;\n mb_adapter_ = NULL;\n }\n\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n delete hmi_handler_;\n hmi_handler_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Message Broker\");\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n\n#ifdef TELEMETRY_MONITOR\n \/\/ It's important to delete tester Obcervers after TM adapters destruction\n if (telemetry_monitor_) {\n telemetry_monitor_->Stop();\n delete telemetry_monitor_;\n telemetry_monitor_ = NULL;\n }\n#endif \/\/ TELEMETRY_MONITOR\n}\n\n} \/\/ namespace main_namespace\n<commit_msg>Fix crash and memory leaks in message broker cleanup<commit_after>\/*\n* Copyright (c) 2017, Ford Motor Company\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are met:\n*\n* Redistributions of source code must retain the above copyright notice, this\n* list of conditions and the following disclaimer.\n*\n* Redistributions in binary form must reproduce the above copyright notice,\n* this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided with the\n* distribution.\n*\n* Neither the name of the Ford Motor Company nor the names of its contributors\n* may be used to endorse or promote products derived from this software\n* without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"life_cycle.h\"\n#include \"utils\/signals.h\"\n#include \"utils\/make_shared.h\"\n#include \"config_profile\/profile.h\"\n#include \"resumption\/last_state_impl.h\"\n\n#ifdef ENABLE_SECURITY\n#include \"security_manager\/security_manager_impl.h\"\n#include \"security_manager\/crypto_manager_impl.h\"\n#include \"security_manager\/crypto_manager_settings_impl.h\"\n#include \"application_manager\/policies\/policy_handler.h\"\n#endif \/\/ ENABLE_SECURITY\n\n#ifdef ENABLE_LOG\n#include \"utils\/log_message_loop_thread.h\"\n#endif \/\/ ENABLE_LOG\n\nusing threads::Thread;\n\nnamespace main_namespace {\n\nCREATE_LOGGERPTR_GLOBAL(logger_, \"SDLMain\")\n\nLifeCycle::LifeCycle(const profile::Profile& profile)\n : transport_manager_(NULL)\n , protocol_handler_(NULL)\n , connection_handler_(NULL)\n , app_manager_(NULL)\n#ifdef ENABLE_SECURITY\n , crypto_manager_(NULL)\n , security_manager_(NULL)\n#endif \/\/ ENABLE_SECURITY\n , hmi_handler_(NULL)\n , hmi_message_adapter_(NULL)\n , media_manager_(NULL)\n , last_state_(NULL)\n#ifdef TELEMETRY_MONITOR\n , telemetry_monitor_(NULL)\n#endif \/\/ TELEMETRY_MONITOR\n#ifdef DBUS_HMIADAPTER\n , dbus_adapter_(NULL)\n , dbus_adapter_thread_(NULL)\n#endif \/\/ DBUS_HMIADAPTER\n#ifdef MESSAGEBROKER_HMIADAPTER\n , mb_adapter_(NULL)\n , mb_adapter_thread_(NULL)\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n , profile_(profile) {\n}\n\nbool LifeCycle::StartComponents() {\n LOG4CXX_AUTO_TRACE(logger_);\n DCHECK(!last_state_);\n last_state_ = new resumption::LastStateImpl(profile_.app_storage_folder(),\n profile_.app_info_storage());\n\n DCHECK(!transport_manager_);\n transport_manager_ = new transport_manager::TransportManagerDefault(profile_);\n\n DCHECK(!connection_handler_);\n connection_handler_ = new connection_handler::ConnectionHandlerImpl(\n profile_, *transport_manager_);\n\n DCHECK(!protocol_handler_);\n protocol_handler_ =\n new protocol_handler::ProtocolHandlerImpl(profile_,\n *connection_handler_,\n *connection_handler_,\n *transport_manager_);\n DCHECK(protocol_handler_);\n\n DCHECK(!app_manager_);\n app_manager_ =\n new application_manager::ApplicationManagerImpl(profile_, profile_);\n\n DCHECK(!hmi_handler_);\n hmi_handler_ = new hmi_message_handler::HMIMessageHandlerImpl(profile_);\n\n hmi_handler_->set_message_observer(app_manager_);\n app_manager_->set_hmi_message_handler(hmi_handler_);\n\n media_manager_ = new media_manager::MediaManagerImpl(*app_manager_, profile_);\n app_manager_->set_connection_handler(connection_handler_);\n if (!app_manager_->Init(*last_state_, media_manager_)) {\n LOG4CXX_ERROR(logger_, \"Application manager init failed.\");\n return false;\n }\n\n#ifdef ENABLE_SECURITY\n security_manager_ = new security_manager::SecurityManagerImpl();\n crypto_manager_ = new security_manager::CryptoManagerImpl(\n utils::MakeShared<security_manager::CryptoManagerSettingsImpl>(\n profile_, app_manager_->GetPolicyHandler().RetrieveCertificate()));\n protocol_handler_->AddProtocolObserver(security_manager_);\n protocol_handler_->set_security_manager(security_manager_);\n\n security_manager_->set_session_observer(connection_handler_);\n security_manager_->set_protocol_handler(protocol_handler_);\n security_manager_->set_crypto_manager(crypto_manager_);\n security_manager_->AddListener(app_manager_);\n\n app_manager_->AddPolicyObserver(crypto_manager_);\n app_manager_->AddPolicyObserver(protocol_handler_);\n if (!crypto_manager_->Init()) {\n LOG4CXX_ERROR(logger_, \"CryptoManager initialization fail.\");\n return false;\n }\n#endif \/\/ ENABLE_SECURITY\n\n transport_manager_->AddEventListener(protocol_handler_);\n transport_manager_->AddEventListener(connection_handler_);\n\n protocol_handler_->AddProtocolObserver(media_manager_);\n protocol_handler_->AddProtocolObserver(app_manager_);\n\n media_manager_->SetProtocolHandler(protocol_handler_);\n\n connection_handler_->set_protocol_handler(protocol_handler_);\n connection_handler_->set_connection_handler_observer(app_manager_);\n\n\/\/ it is important to initialise TelemetryMonitor before TM to listen TM\n\/\/ Adapters\n#ifdef TELEMETRY_MONITOR\n telemetry_monitor_ = new telemetry_monitor::TelemetryMonitor(\n profile_.server_address(), profile_.time_testing_port());\n telemetry_monitor_->Start();\n telemetry_monitor_->Init(protocol_handler_, app_manager_, transport_manager_);\n#endif \/\/ TELEMETRY_MONITOR\n \/\/ It's important to initialise TM after setting up listener chain\n \/\/ [TM -> CH -> AM], otherwise some events from TM could arrive at nowhere\n app_manager_->set_protocol_handler(protocol_handler_);\n\n transport_manager_->Init(*last_state_);\n \/\/ start transport manager\n transport_manager_->Visibility(true);\n\n return true;\n}\n\n#ifdef MESSAGEBROKER_HMIADAPTER\nbool LifeCycle::InitMessageSystem() {\n mb_adapter_ = new hmi_message_handler::MessageBrokerAdapter(\n hmi_handler_, profile_.server_address(), profile_.server_port());\n\n if (!mb_adapter_->StartListener()) {\n return false;\n }\n\n hmi_handler_->AddHMIMessageAdapter(mb_adapter_);\n mb_adapter_thread_ = new std::thread(\n &hmi_message_handler::MessageBrokerAdapter::Run, mb_adapter_);\n return true;\n}\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n\n#ifdef DBUS_HMIADAPTER\n\/**\n * Initialize DBus component\n * @return true if success otherwise false.\n *\/\nbool LifeCycle::InitMessageSystem() {\n dbus_adapter_ = new hmi_message_handler::DBusMessageAdapter(hmi_handler_);\n\n hmi_handler_->AddHMIMessageAdapter(dbus_adapter_);\n if (!dbus_adapter_->Init()) {\n LOG4CXX_FATAL(logger_, \"Cannot init DBus service!\");\n return false;\n }\n\n dbus_adapter_->SubscribeTo();\n\n LOG4CXX_INFO(logger_, \"Start DBusMessageAdapter thread!\");\n dbus_adapter_thread_ = new std::thread(\n &hmi_message_handler::DBusMessageAdapter::Run, dbus_adapter_);\n\n return true;\n}\n#endif \/\/ DBUS_HMIADAPTER\n\nnamespace {\nvoid sig_handler(int sig) {\n switch (sig) {\n case SIGINT:\n LOG4CXX_DEBUG(logger_, \"SIGINT signal has been caught\");\n break;\n case SIGTERM:\n LOG4CXX_DEBUG(logger_, \"SIGTERM signal has been caught\");\n break;\n case SIGSEGV:\n LOG4CXX_DEBUG(logger_, \"SIGSEGV signal has been caught\");\n FLUSH_LOGGER();\n \/\/ exit need to prevent endless sending SIGSEGV\n \/\/ http:\/\/stackoverflow.com\/questions\/2663456\/how-to-write-a-signal-handler-to-catch-sigsegv\n abort();\n default:\n LOG4CXX_DEBUG(logger_, \"Unexpected signal has been caught\");\n exit(EXIT_FAILURE);\n }\n}\n} \/\/ namespace\n\nvoid LifeCycle::Run() {\n LOG4CXX_AUTO_TRACE(logger_);\n \/\/ Register signal handlers and wait sys signals\n \/\/ from OS\n if (!utils::WaitTerminationSignals(&sig_handler)) {\n LOG4CXX_FATAL(logger_, \"Fail to catch system signal!\");\n }\n}\n\nvoid LifeCycle::StopComponents() {\n LOG4CXX_AUTO_TRACE(logger_);\n\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->set_message_observer(NULL);\n\n DCHECK_OR_RETURN_VOID(connection_handler_);\n connection_handler_->set_connection_handler_observer(NULL);\n\n DCHECK_OR_RETURN_VOID(protocol_handler_);\n protocol_handler_->RemoveProtocolObserver(app_manager_);\n\n DCHECK_OR_RETURN_VOID(app_manager_);\n app_manager_->Stop();\n\n LOG4CXX_INFO(logger_, \"Stopping Protocol Handler\");\n DCHECK_OR_RETURN_VOID(protocol_handler_);\n protocol_handler_->RemoveProtocolObserver(media_manager_);\n\n#ifdef ENABLE_SECURITY\n protocol_handler_->RemoveProtocolObserver(security_manager_);\n if (security_manager_) {\n security_manager_->RemoveListener(app_manager_);\n LOG4CXX_INFO(logger_, \"Destroying Crypto Manager\");\n delete crypto_manager_;\n crypto_manager_ = NULL;\n LOG4CXX_INFO(logger_, \"Destroying Security Manager\");\n delete security_manager_;\n security_manager_ = NULL;\n }\n#endif \/\/ ENABLE_SECURITY\n protocol_handler_->Stop();\n\n LOG4CXX_INFO(logger_, \"Destroying Media Manager\");\n DCHECK_OR_RETURN_VOID(media_manager_);\n media_manager_->SetProtocolHandler(NULL);\n delete media_manager_;\n media_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Transport Manager.\");\n DCHECK_OR_RETURN_VOID(transport_manager_);\n transport_manager_->Visibility(false);\n transport_manager_->Stop();\n delete transport_manager_;\n transport_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Stopping Connection Handler.\");\n DCHECK_OR_RETURN_VOID(connection_handler_);\n connection_handler_->Stop();\n\n LOG4CXX_INFO(logger_, \"Destroying Protocol Handler\");\n DCHECK(protocol_handler_);\n delete protocol_handler_;\n protocol_handler_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Connection Handler.\");\n delete connection_handler_;\n connection_handler_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Last State\");\n DCHECK(last_state_);\n delete last_state_;\n last_state_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying Application Manager.\");\n DCHECK(app_manager_);\n delete app_manager_;\n app_manager_ = NULL;\n\n LOG4CXX_INFO(logger_, \"Destroying HMI Message Handler and MB adapter.\");\n\n#ifdef DBUS_HMIADAPTER\n if (dbus_adapter_) {\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->RemoveHMIMessageAdapter(dbus_adapter_);\n dbus_adapter_->Shutdown();\n if (dbus_adapter_thread_ != NULL) {\n dbus_adapter_thread_->join();\n }\n delete dbus_adapter_;\n dbus_adapter_ = NULL;\n delete dbus_adapter_thread_;\n dbus_adapter_thread_ = NULL;\n }\n#endif \/\/ DBUS_HMIADAPTER\n\n#ifdef MESSAGEBROKER_HMIADAPTER\n if (mb_adapter_) {\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n hmi_handler_->RemoveHMIMessageAdapter(mb_adapter_);\n mb_adapter_->unregisterController();\n mb_adapter_->exitReceivingThread();\n if (mb_adapter_thread_ != NULL) {\n mb_adapter_thread_->join();\n }\n delete mb_adapter_;\n mb_adapter_ = NULL;\n delete mb_adapter_thread_;\n mb_adapter_thread_ = NULL;\n }\n LOG4CXX_INFO(logger_, \"Destroying Message Broker\");\n#endif \/\/ MESSAGEBROKER_HMIADAPTER\n DCHECK_OR_RETURN_VOID(hmi_handler_);\n delete hmi_handler_;\n hmi_handler_ = NULL;\n\n#ifdef TELEMETRY_MONITOR\n \/\/ It's important to delete tester Obcervers after TM adapters destruction\n if (telemetry_monitor_) {\n telemetry_monitor_->Stop();\n delete telemetry_monitor_;\n telemetry_monitor_ = NULL;\n }\n#endif \/\/ TELEMETRY_MONITOR\n}\n\n} \/\/ namespace main_namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2010 Gabe Black\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_GENERIC_TYPES_HH__\n#define __ARCH_GENERIC_TYPES_HH__\n\n#include <iostream>\n\n#include \"base\/trace.hh\"\n#include \"base\/types.hh\"\n#include \"sim\/serialize.hh\"\n\nnamespace GenericISA\n{\n\n\/\/ The guaranteed interface.\nclass PCStateBase\n{\n protected:\n Addr _pc;\n Addr _npc;\n\n PCStateBase() {}\n PCStateBase(Addr val) { set(val); }\n\n public:\n \/**\n * Returns the memory address the bytes of this instruction came from.\n *\n * @return Memory address of the current instruction's encoding.\n *\/\n Addr\n instAddr() const\n {\n return _pc;\n }\n\n \/**\n * Returns the memory address the bytes of the next instruction came from.\n *\n * @return Memory address of the next instruction's encoding.\n *\/\n Addr\n nextInstAddr() const\n {\n return _npc;\n }\n\n \/**\n * Returns the current micropc.\n *\n * @return The current micropc.\n *\/\n MicroPC\n microPC() const\n {\n return 0;\n }\n\n \/**\n * Force this PC to reflect a particular value, resetting all its other\n * fields around it. This is useful for in place (re)initialization.\n *\n * @param val The value to set the PC to.\n *\/\n void set(Addr val);\n\n bool\n operator == (const PCStateBase &opc) const\n {\n return _pc == opc._pc && _npc == opc._npc;\n }\n\n bool\n operator != (const PCStateBase &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n SERIALIZE_SCALAR(_pc);\n SERIALIZE_SCALAR(_npc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n UNSERIALIZE_SCALAR(_pc);\n UNSERIALIZE_SCALAR(_npc);\n }\n};\n\n\n\/*\n * Different flavors of PC state. Only ISA specific code should rely on\n * any particular type of PC state being available. All other code should\n * use the interface above.\n *\/\n\n\/\/ The most basic type of PC.\ntemplate <class MachInst>\nclass SimplePCState : public PCStateBase\n{\n protected:\n typedef PCStateBase Base;\n\n public:\n\n Addr pc() const { return _pc; }\n void pc(Addr val) { _pc = val; }\n\n Addr npc() const { return _npc; }\n void npc(Addr val) { _npc = val; }\n\n void\n set(Addr val)\n {\n pc(val);\n npc(val + sizeof(MachInst));\n };\n\n SimplePCState() {}\n SimplePCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return this->npc() != this->pc() + sizeof(MachInst);\n }\n\n \/\/ Advance the PC.\n void\n advance()\n {\n _pc = _npc;\n _npc += sizeof(MachInst);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const SimplePCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x)\", pc.pc(), pc.npc());\n return os;\n}\n\n\/\/ A PC and microcode PC.\ntemplate <class MachInst>\nclass UPCState : public SimplePCState<MachInst>\n{\n protected:\n typedef SimplePCState<MachInst> Base;\n\n MicroPC _upc;\n MicroPC _nupc;\n\n public:\n\n MicroPC upc() const { return _upc; }\n void upc(MicroPC val) { _upc = val; }\n\n MicroPC nupc() const { return _nupc; }\n void nupc(MicroPC val) { _nupc = val; }\n\n MicroPC\n microPC() const\n {\n return _upc;\n }\n\n void\n set(Addr val)\n {\n Base::set(val);\n upc(0);\n nupc(1);\n }\n\n UPCState() {}\n UPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return this->npc() != this->pc() + sizeof(MachInst) ||\n this->nupc() != this->upc() + 1;\n }\n\n \/\/ Advance the upc within the instruction.\n void\n uAdvance()\n {\n _upc = _nupc;\n _nupc++;\n }\n\n \/\/ End the macroop by resetting the upc and advancing the regular pc.\n void\n uEnd()\n {\n this->advance();\n _upc = 0;\n _nupc = 1;\n }\n\n bool\n operator == (const UPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n _upc == opc._upc && _nupc == opc._nupc;\n }\n\n bool\n operator != (const UPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_upc);\n SERIALIZE_SCALAR(_nupc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_upc);\n UNSERIALIZE_SCALAR(_nupc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const UPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x).(%d=>%d)\",\n pc.pc(), pc.npc(), pc.upc(), pc.npc());\n return os;\n}\n\n\/\/ A PC with a delay slot.\ntemplate <class MachInst>\nclass DelaySlotPCState : public SimplePCState<MachInst>\n{\n protected:\n typedef SimplePCState<MachInst> Base;\n\n Addr _nnpc;\n\n public:\n\n Addr nnpc() const { return _nnpc; }\n void nnpc(Addr val) { _nnpc = val; }\n\n void\n set(Addr val)\n {\n Base::set(val);\n nnpc(val + 2 * sizeof(MachInst));\n }\n\n DelaySlotPCState() {}\n DelaySlotPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return !(this->nnpc() == this->npc() + sizeof(MachInst) &&\n (this->npc() == this->pc() + sizeof(MachInst) ||\n this->npc() == this->pc() + 2 * sizeof(MachInst)));\n }\n\n \/\/ Advance the PC.\n void\n advance()\n {\n Base::_pc = Base::_npc;\n Base::_npc = _nnpc;\n _nnpc += sizeof(MachInst);\n }\n\n bool\n operator == (const DelaySlotPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n _nnpc == opc._nnpc;\n }\n\n bool\n operator != (const DelaySlotPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_nnpc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_nnpc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const DelaySlotPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x=>%#x)\",\n pc.pc(), pc.npc(), pc.nnpc());\n return os;\n}\n\n\/\/ A PC with a delay slot and a microcode PC.\ntemplate <class MachInst>\nclass DelaySlotUPCState : public DelaySlotPCState<MachInst>\n{\n protected:\n typedef DelaySlotPCState<MachInst> Base;\n\n MicroPC _upc;\n MicroPC _nupc;\n\n public:\n\n MicroPC upc() const { return _upc; }\n void upc(MicroPC val) { _upc = val; }\n\n MicroPC nupc() const { return _nupc; }\n void nupc(MicroPC val) { _nupc = val; }\n\n MicroPC\n microPC() const\n {\n return _upc;\n }\n\n void\n set(Addr val)\n {\n Base::set(val);\n upc(0);\n nupc(1);\n }\n\n DelaySlotUPCState() {}\n DelaySlotUPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return Base::branching() || this->nupc() != this->upc() + 1;\n }\n\n \/\/ Advance the upc within the instruction.\n void\n uAdvance()\n {\n _upc = _nupc;\n _nupc++;\n }\n\n \/\/ End the macroop by resetting the upc and advancing the regular pc.\n void\n uEnd()\n {\n this->advance();\n _upc = 0;\n _nupc = 1;\n }\n\n bool\n operator == (const DelaySlotUPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n Base::_nnpc == opc._nnpc &&\n _upc == opc._upc && _nupc == opc._nupc;\n }\n\n bool\n operator != (const DelaySlotUPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_upc);\n SERIALIZE_SCALAR(_nupc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_upc);\n UNSERIALIZE_SCALAR(_nupc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const DelaySlotUPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x=>%#x).(%d=>%d)\",\n pc.pc(), pc.npc(), pc.nnpc(), pc.upc(), pc.nupc());\n return os;\n}\n\n}\n\n#endif\n<commit_msg>arch: print next upc correctly The patch corrects the print statement which prints the current and the next pc. Instead of the next upc, the next pc was being printed.<commit_after>\/*\n * Copyright (c) 2010 Gabe Black\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#ifndef __ARCH_GENERIC_TYPES_HH__\n#define __ARCH_GENERIC_TYPES_HH__\n\n#include <iostream>\n\n#include \"base\/trace.hh\"\n#include \"base\/types.hh\"\n#include \"sim\/serialize.hh\"\n\nnamespace GenericISA\n{\n\n\/\/ The guaranteed interface.\nclass PCStateBase\n{\n protected:\n Addr _pc;\n Addr _npc;\n\n PCStateBase() {}\n PCStateBase(Addr val) { set(val); }\n\n public:\n \/**\n * Returns the memory address the bytes of this instruction came from.\n *\n * @return Memory address of the current instruction's encoding.\n *\/\n Addr\n instAddr() const\n {\n return _pc;\n }\n\n \/**\n * Returns the memory address the bytes of the next instruction came from.\n *\n * @return Memory address of the next instruction's encoding.\n *\/\n Addr\n nextInstAddr() const\n {\n return _npc;\n }\n\n \/**\n * Returns the current micropc.\n *\n * @return The current micropc.\n *\/\n MicroPC\n microPC() const\n {\n return 0;\n }\n\n \/**\n * Force this PC to reflect a particular value, resetting all its other\n * fields around it. This is useful for in place (re)initialization.\n *\n * @param val The value to set the PC to.\n *\/\n void set(Addr val);\n\n bool\n operator == (const PCStateBase &opc) const\n {\n return _pc == opc._pc && _npc == opc._npc;\n }\n\n bool\n operator != (const PCStateBase &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n SERIALIZE_SCALAR(_pc);\n SERIALIZE_SCALAR(_npc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n UNSERIALIZE_SCALAR(_pc);\n UNSERIALIZE_SCALAR(_npc);\n }\n};\n\n\n\/*\n * Different flavors of PC state. Only ISA specific code should rely on\n * any particular type of PC state being available. All other code should\n * use the interface above.\n *\/\n\n\/\/ The most basic type of PC.\ntemplate <class MachInst>\nclass SimplePCState : public PCStateBase\n{\n protected:\n typedef PCStateBase Base;\n\n public:\n\n Addr pc() const { return _pc; }\n void pc(Addr val) { _pc = val; }\n\n Addr npc() const { return _npc; }\n void npc(Addr val) { _npc = val; }\n\n void\n set(Addr val)\n {\n pc(val);\n npc(val + sizeof(MachInst));\n };\n\n SimplePCState() {}\n SimplePCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return this->npc() != this->pc() + sizeof(MachInst);\n }\n\n \/\/ Advance the PC.\n void\n advance()\n {\n _pc = _npc;\n _npc += sizeof(MachInst);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const SimplePCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x)\", pc.pc(), pc.npc());\n return os;\n}\n\n\/\/ A PC and microcode PC.\ntemplate <class MachInst>\nclass UPCState : public SimplePCState<MachInst>\n{\n protected:\n typedef SimplePCState<MachInst> Base;\n\n MicroPC _upc;\n MicroPC _nupc;\n\n public:\n\n MicroPC upc() const { return _upc; }\n void upc(MicroPC val) { _upc = val; }\n\n MicroPC nupc() const { return _nupc; }\n void nupc(MicroPC val) { _nupc = val; }\n\n MicroPC\n microPC() const\n {\n return _upc;\n }\n\n void\n set(Addr val)\n {\n Base::set(val);\n upc(0);\n nupc(1);\n }\n\n UPCState() {}\n UPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return this->npc() != this->pc() + sizeof(MachInst) ||\n this->nupc() != this->upc() + 1;\n }\n\n \/\/ Advance the upc within the instruction.\n void\n uAdvance()\n {\n _upc = _nupc;\n _nupc++;\n }\n\n \/\/ End the macroop by resetting the upc and advancing the regular pc.\n void\n uEnd()\n {\n this->advance();\n _upc = 0;\n _nupc = 1;\n }\n\n bool\n operator == (const UPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n _upc == opc._upc && _nupc == opc._nupc;\n }\n\n bool\n operator != (const UPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_upc);\n SERIALIZE_SCALAR(_nupc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_upc);\n UNSERIALIZE_SCALAR(_nupc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const UPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x).(%d=>%d)\",\n pc.pc(), pc.npc(), pc.upc(), pc.nupc());\n return os;\n}\n\n\/\/ A PC with a delay slot.\ntemplate <class MachInst>\nclass DelaySlotPCState : public SimplePCState<MachInst>\n{\n protected:\n typedef SimplePCState<MachInst> Base;\n\n Addr _nnpc;\n\n public:\n\n Addr nnpc() const { return _nnpc; }\n void nnpc(Addr val) { _nnpc = val; }\n\n void\n set(Addr val)\n {\n Base::set(val);\n nnpc(val + 2 * sizeof(MachInst));\n }\n\n DelaySlotPCState() {}\n DelaySlotPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return !(this->nnpc() == this->npc() + sizeof(MachInst) &&\n (this->npc() == this->pc() + sizeof(MachInst) ||\n this->npc() == this->pc() + 2 * sizeof(MachInst)));\n }\n\n \/\/ Advance the PC.\n void\n advance()\n {\n Base::_pc = Base::_npc;\n Base::_npc = _nnpc;\n _nnpc += sizeof(MachInst);\n }\n\n bool\n operator == (const DelaySlotPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n _nnpc == opc._nnpc;\n }\n\n bool\n operator != (const DelaySlotPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_nnpc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_nnpc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const DelaySlotPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x=>%#x)\",\n pc.pc(), pc.npc(), pc.nnpc());\n return os;\n}\n\n\/\/ A PC with a delay slot and a microcode PC.\ntemplate <class MachInst>\nclass DelaySlotUPCState : public DelaySlotPCState<MachInst>\n{\n protected:\n typedef DelaySlotPCState<MachInst> Base;\n\n MicroPC _upc;\n MicroPC _nupc;\n\n public:\n\n MicroPC upc() const { return _upc; }\n void upc(MicroPC val) { _upc = val; }\n\n MicroPC nupc() const { return _nupc; }\n void nupc(MicroPC val) { _nupc = val; }\n\n MicroPC\n microPC() const\n {\n return _upc;\n }\n\n void\n set(Addr val)\n {\n Base::set(val);\n upc(0);\n nupc(1);\n }\n\n DelaySlotUPCState() {}\n DelaySlotUPCState(Addr val) { set(val); }\n\n bool\n branching() const\n {\n return Base::branching() || this->nupc() != this->upc() + 1;\n }\n\n \/\/ Advance the upc within the instruction.\n void\n uAdvance()\n {\n _upc = _nupc;\n _nupc++;\n }\n\n \/\/ End the macroop by resetting the upc and advancing the regular pc.\n void\n uEnd()\n {\n this->advance();\n _upc = 0;\n _nupc = 1;\n }\n\n bool\n operator == (const DelaySlotUPCState<MachInst> &opc) const\n {\n return Base::_pc == opc._pc &&\n Base::_npc == opc._npc &&\n Base::_nnpc == opc._nnpc &&\n _upc == opc._upc && _nupc == opc._nupc;\n }\n\n bool\n operator != (const DelaySlotUPCState<MachInst> &opc) const\n {\n return !(*this == opc);\n }\n\n void\n serialize(std::ostream &os)\n {\n Base::serialize(os);\n SERIALIZE_SCALAR(_upc);\n SERIALIZE_SCALAR(_nupc);\n }\n\n void\n unserialize(Checkpoint *cp, const std::string §ion)\n {\n Base::unserialize(cp, section);\n UNSERIALIZE_SCALAR(_upc);\n UNSERIALIZE_SCALAR(_nupc);\n }\n};\n\ntemplate <class MachInst>\nstd::ostream &\noperator<<(std::ostream & os, const DelaySlotUPCState<MachInst> &pc)\n{\n ccprintf(os, \"(%#x=>%#x=>%#x).(%d=>%d)\",\n pc.pc(), pc.npc(), pc.nnpc(), pc.upc(), pc.nupc());\n return os;\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n===============================================================================\n\n FILE: arithmeticencoder.cpp\n \n CONTENTS:\n \n A modular C++ wrapper for an adapted version of Amir Said's FastAC Code.\r\n see: http:\/\/www.cipr.rpi.edu\/~said\/FastAC.html\r\n\n PROGRAMMERS:\r\n\r\n martin.isenburg@gmail.com\r\n\r\n COPYRIGHT:\r\n\r\n (c) 2011, Martin Isenburg, LASSO - tools to catch reality\r\n\r\n This is free software; you can redistribute and\/or modify it under the\r\n terms of the GNU Lesser General Licence as published by the Free Software\r\n Foundation. See the COPYING file for more information.\r\n\r\n This software is distributed WITHOUT ANY WARRANTY and without even the\r\n implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\n \n CHANGE HISTORY:\n \n see header file\n \n===============================================================================\n*\/\n\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ Fast arithmetic coding implementation -\r\n\/\/ -> 32-bit variables, 32-bit product, periodic updates, table decoding -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ Version 1.00 - April 25, 2004 -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ WARNING -\r\n\/\/ ========= -\r\n\/\/ -\r\n\/\/ The only purpose of this program is to demonstrate the basic principles -\r\n\/\/ of arithmetic coding. It is provided as is, without any express or -\r\n\/\/ implied warranty, without even the warranty of fitness for any particular -\r\n\/\/ purpose, or that the implementations are correct. -\r\n\/\/ -\r\n\/\/ Permission to copy and redistribute this code is hereby granted, provided -\r\n\/\/ that this warning and copyright notices are not removed or altered. -\r\n\/\/ -\r\n\/\/ Copyright (c) 2004 by Amir Said (said@ieee.org) & -\r\n\/\/ William A. Pearlman (pearlw@ecse.rpi.edu) -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ A description of the arithmetic coding method used here is available in -\r\n\/\/ -\r\n\/\/ Lossless Compression Handbook, ed. K. Sayood -\r\n\/\/ Chapter 5: Arithmetic Coding (A. Said), pp. 101-152, Academic Press, 2003 -\r\n\/\/ -\r\n\/\/ A. Said, Introduction to Arithetic Coding Theory and Practice -\r\n\/\/ HP Labs report HPL-2004-76 - http:\/\/www.hpl.hp.com\/techreports\/ -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\r\n#include \"arithmeticencoder.hpp\"\n\n#include <string.h>\r\n#include <assert.h>\n\r\n#include \"arithmeticmodel.hpp\"\r\n\r\nArithmeticEncoder::ArithmeticEncoder()\r\n{\r\n outstream = 0;\r\n\r\n outbuffer = (U8*)malloc(sizeof(U8)*2*AC_BUFFER_SIZE);\r\n endbuffer = outbuffer + 2 * AC_BUFFER_SIZE;\r\n}\r\n\nArithmeticEncoder::~ArithmeticEncoder()\r\n{\r\n free(outbuffer);\r\n}\r\n\r\nBOOL ArithmeticEncoder::init(ByteStreamOut* outstream)\n{\r\n if (outstream == 0) return FALSE;\r\n this->outstream = outstream;\r\n base = 0;\r\n length = AC__MaxLength;\r\n outbyte = outbuffer;\r\n endbyte = endbuffer;\r\n return TRUE;\r\n}\n\nvoid ArithmeticEncoder::done()\r\n{\r\n U32 init_base = base; \/\/ done encoding: set final data bytes\r\n\r\n if (length > 2 * AC__MinLength) {\r\n base += AC__MinLength; \/\/ base offset\r\n length = AC__MinLength >> 1; \/\/ set new length for 1 more byte\r\n }\r\n else {\r\n base += AC__MinLength >> 1; \/\/ base offset\r\n length = AC__MinLength >> 9; \/\/ set new length for 2 more bytes\r\n }\r\n\r\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\r\n renorm_enc_interval(); \/\/ renormalization = output last bytes\r\n\r\n if (endbyte != endbuffer)\r\n {\r\n assert(outbyte < outbuffer + AC_BUFFER_SIZE);\r\n outstream->putBytes(outbuffer + AC_BUFFER_SIZE, AC_BUFFER_SIZE);\r\n }\r\n U32 buffer_size = outbyte - outbuffer;\r\n if (buffer_size) outstream->putBytes(outbuffer, buffer_size);\r\n\r\n \/\/ write three zero bytes to be sure the decoder does not read past the array\r\n outstream->putByte(0);\r\n outstream->putByte(0);\r\n outstream->putByte(0);\r\n\r\n outstream = 0;\r\n}\r\n\r\nEntropyModel* ArithmeticEncoder::createBitModel()\r\n{\r\n ArithmeticBitModel* m = new ArithmeticBitModel();\r\n return (EntropyModel*)m;\r\n}\r\n\r\nvoid ArithmeticEncoder::initBitModel(EntropyModel* model)\r\n{\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\r\n m->init();\r\n}\r\n\r\nvoid ArithmeticEncoder::destroyBitModel(EntropyModel* model)\r\n{\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\r\n delete m;\r\n}\r\n\r\nEntropyModel* ArithmeticEncoder::createSymbolModel(U32 n)\r\n{\r\n ArithmeticModel* m = new ArithmeticModel(n, true);\r\n return (EntropyModel*)m;\r\n}\r\n\r\nvoid ArithmeticEncoder::initSymbolModel(EntropyModel* model, U32* table)\r\n{\r\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n m->init(table);\r\n}\r\n\r\nvoid ArithmeticEncoder::destroySymbolModel(EntropyModel* model)\r\n{\r\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n delete m;\r\n}\r\n\r\nvoid ArithmeticEncoder::encodeBit(EntropyModel* model, U32 sym)\n{\n assert(model && (sym <= 1));\r\n\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\n U32 x = m->bit_0_prob * (length >> BM__LengthShift); \/\/ product l x p0\n \/\/ update interval\n if (sym == 0) {\n length = x;\n ++m->bit_0_count;\n }\n else {\n U32 init_base = base;\n base += x;\n length -= x;\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n }\n\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n if (--m->bits_until_update == 0) m->update(); \/\/ periodic model update\n}\n\nvoid ArithmeticEncoder::encodeSymbol(EntropyModel* model, U32 sym)\n{\n assert(model);\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n assert(sym <= m->last_symbol);\n U32 x, init_base = base;\n \/\/ compute products\n if (sym == m->last_symbol) {\n x = m->distribution[sym] * (length >> DM__LengthShift);\n base += x; \/\/ update interval\n length -= x; \/\/ no product needed\n }\n else {\n x = m->distribution[sym] * (length >>= DM__LengthShift);\n base += x; \/\/ update interval\n length = m->distribution[sym+1] * length - x;\n }\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n\n ++m->symbol_count[sym];\n if (--m->symbols_until_update == 0) m->update(); \/\/ periodic model update\n}\n\nvoid ArithmeticEncoder::writeBit(U32 sym)\n{\n assert(sym < 2);\n\n U32 init_base = base;\n base += sym * (length >>= 1); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeBits(U32 bits, U32 sym)\n{\n assert(bits && (bits <= 32) && (sym < (1u<<bits)));\n\n if (bits > 19)\n {\n writeShort(sym&U16_MAX);\n sym = sym >> 16;\n bits = bits - 16;\n }\n\n U32 init_base = base;\n base += sym * (length >>= bits); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeByte(U8 sym)\n{\n U32 init_base = base;\n base += (U32)(sym) * (length >>= 8); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeShort(U16 sym)\n{\n U32 init_base = base;\n base += (U32)(sym) * (length >>= 16); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\ninline void ArithmeticEncoder::writeInt(U32 sym)\n{\n writeShort((U16)(sym & 0xFFFF)); \/\/ lower 16 bits\n writeShort((U16)(sym >> 16)); \/\/ UPPER 16 bits\n}\n\ninline void ArithmeticEncoder::writeFloat(F32 sym) \/* danger in float reinterpretation *\/\n{\n U32I32F32 u32i32f32;\n u32i32f32.f32 = sym;\n writeInt(u32i32f32.u32);\n}\n\ninline void ArithmeticEncoder::writeInt64(U64 sym)\n{\n writeInt((U32)(sym & 0xFFFFFFFF)); \/\/ lower 32 bits\n writeInt((U32)(sym >> 32)); \/\/ UPPER 32 bits\n}\n\ninline void ArithmeticEncoder::writeDouble(F64 sym) \/* danger in float reinterpretation *\/\n{\n U64I64F64 u64i64f64;\n u64i64f64.f64 = sym;\n writeInt64(u64i64f64.u64);\n}\n\ninline void ArithmeticEncoder::propagate_carry()\n{\n U8 * p;\n if (outbyte == outbuffer)\n p = endbuffer - 1;\n else\n p = outbyte - 1;\n while (*p == 0xFFU)\n {\n *p = 0;\n if (p == outbuffer)\n p = endbuffer - 1;\n else\n p--;\n assert(outbuffer <= p);\n assert(p < endbuffer); \n assert(outbyte < endbuffer); \n }\n ++*p;\n}\n\ninline void ArithmeticEncoder::renorm_enc_interval()\n{\n do { \/\/ output and discard top byte\n assert(outbuffer <= outbyte);\r\n assert(outbyte < endbuffer); \r\n assert(outbyte < endbyte); \r\n *outbyte++ = (U8)(base >> 24);\r\n if (outbyte == endbyte) manage_outbuffer();\r\n base <<= 8;\n } while ((length <<= 8) < AC__MinLength); \/\/ length multiplied by 256\n}\n\r\ninline void ArithmeticEncoder::manage_outbuffer()\r\n{\r\n if (outbyte == endbuffer) outbyte = outbuffer;\r\n outstream->putBytes(outbyte, AC_BUFFER_SIZE);\r\n endbyte = outbyte + AC_BUFFER_SIZE;\r\n assert(endbyte > outbyte);\r\n assert(outbyte < endbuffer); \r\n}\r\n<commit_msg>fixed wrong number of end bytes bug<commit_after>\/*\n===============================================================================\n\n FILE: arithmeticencoder.cpp\n \n CONTENTS:\n \n A modular C++ wrapper for an adapted version of Amir Said's FastAC Code.\r\n see: http:\/\/www.cipr.rpi.edu\/~said\/FastAC.html\r\n\n PROGRAMMERS:\r\n\r\n martin.isenburg@gmail.com\r\n\r\n COPYRIGHT:\r\n\r\n (c) 2011, Martin Isenburg, LASSO - tools to catch reality\r\n\r\n This is free software; you can redistribute and\/or modify it under the\r\n terms of the GNU Lesser General Licence as published by the Free Software\r\n Foundation. See the COPYING file for more information.\r\n\r\n This software is distributed WITHOUT ANY WARRANTY and without even the\r\n implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\n \n CHANGE HISTORY:\n \n see header file\n \n===============================================================================\n*\/\n\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ Fast arithmetic coding implementation -\r\n\/\/ -> 32-bit variables, 32-bit product, periodic updates, table decoding -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ Version 1.00 - April 25, 2004 -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ WARNING -\r\n\/\/ ========= -\r\n\/\/ -\r\n\/\/ The only purpose of this program is to demonstrate the basic principles -\r\n\/\/ of arithmetic coding. It is provided as is, without any express or -\r\n\/\/ implied warranty, without even the warranty of fitness for any particular -\r\n\/\/ purpose, or that the implementations are correct. -\r\n\/\/ -\r\n\/\/ Permission to copy and redistribute this code is hereby granted, provided -\r\n\/\/ that this warning and copyright notices are not removed or altered. -\r\n\/\/ -\r\n\/\/ Copyright (c) 2004 by Amir Said (said@ieee.org) & -\r\n\/\/ William A. Pearlman (pearlw@ecse.rpi.edu) -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\/\/ -\r\n\/\/ A description of the arithmetic coding method used here is available in -\r\n\/\/ -\r\n\/\/ Lossless Compression Handbook, ed. K. Sayood -\r\n\/\/ Chapter 5: Arithmetic Coding (A. Said), pp. 101-152, Academic Press, 2003 -\r\n\/\/ -\r\n\/\/ A. Said, Introduction to Arithetic Coding Theory and Practice -\r\n\/\/ HP Labs report HPL-2004-76 - http:\/\/www.hpl.hp.com\/techreports\/ -\r\n\/\/ -\r\n\/\/ - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -\r\n\r\n#include \"arithmeticencoder.hpp\"\n\n#include <string.h>\r\n#include <assert.h>\n\r\n#include <stdio.h>\r\n\r\nFILE* file = 0;\r\n\r\n#include \"arithmeticmodel.hpp\"\r\n\r\nArithmeticEncoder::ArithmeticEncoder()\r\n{\r\n outstream = 0;\r\n\r\n outbuffer = (U8*)malloc(sizeof(U8)*2*AC_BUFFER_SIZE);\r\n endbuffer = outbuffer + 2 * AC_BUFFER_SIZE;\r\n}\r\n\nArithmeticEncoder::~ArithmeticEncoder()\r\n{\r\n free(outbuffer);\r\n}\r\n\r\nBOOL ArithmeticEncoder::init(ByteStreamOut* outstream)\n{\r\n if (outstream == 0) return FALSE;\r\n this->outstream = outstream;\r\n base = 0;\r\n length = AC__MaxLength;\r\n outbyte = outbuffer;\r\n endbyte = endbuffer;\r\n return TRUE;\r\n}\n\nvoid ArithmeticEncoder::done()\r\n{\r\n U32 init_base = base; \/\/ done encoding: set final data bytes\r\n BOOL another_byte = TRUE;\r\n\r\n if (length > 2 * AC__MinLength) {\r\n base += AC__MinLength; \/\/ base offset\r\n length = AC__MinLength >> 1; \/\/ set new length for 1 more byte\r\n }\r\n else {\r\n base += AC__MinLength >> 1; \/\/ base offset\r\n length = AC__MinLength >> 9; \/\/ set new length for 2 more bytes\r\n another_byte = FALSE;\r\n }\r\n\r\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\r\n renorm_enc_interval(); \/\/ renormalization = output last bytes\r\n\r\n if (endbyte != endbuffer)\r\n {\r\n assert(outbyte < outbuffer + AC_BUFFER_SIZE);\r\n outstream->putBytes(outbuffer + AC_BUFFER_SIZE, AC_BUFFER_SIZE);\r\n }\r\n U32 buffer_size = outbyte - outbuffer;\r\n if (buffer_size) outstream->putBytes(outbuffer, buffer_size);\r\n\r\n \/\/ write two or three zero bytes to be in sync with the decoder's byte reads\r\n outstream->putByte(0);\r\n outstream->putByte(0);\r\n if (another_byte) outstream->putByte(0);\r\n\r\n outstream = 0;\r\n}\r\n\r\nEntropyModel* ArithmeticEncoder::createBitModel()\r\n{\r\n ArithmeticBitModel* m = new ArithmeticBitModel();\r\n return (EntropyModel*)m;\r\n}\r\n\r\nvoid ArithmeticEncoder::initBitModel(EntropyModel* model)\r\n{\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\r\n m->init();\r\n}\r\n\r\nvoid ArithmeticEncoder::destroyBitModel(EntropyModel* model)\r\n{\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\r\n delete m;\r\n}\r\n\r\nEntropyModel* ArithmeticEncoder::createSymbolModel(U32 n)\r\n{\r\n ArithmeticModel* m = new ArithmeticModel(n, true);\r\n return (EntropyModel*)m;\r\n}\r\n\r\nvoid ArithmeticEncoder::initSymbolModel(EntropyModel* model, U32* table)\r\n{\r\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n m->init(table);\r\n}\r\n\r\nvoid ArithmeticEncoder::destroySymbolModel(EntropyModel* model)\r\n{\r\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n delete m;\r\n}\r\n\r\nvoid ArithmeticEncoder::encodeBit(EntropyModel* model, U32 sym)\n{\n assert(model && (sym <= 1));\r\n\r\n ArithmeticBitModel* m = (ArithmeticBitModel*)model;\n U32 x = m->bit_0_prob * (length >> BM__LengthShift); \/\/ product l x p0\n \/\/ update interval\n if (sym == 0) {\n length = x;\n ++m->bit_0_count;\n }\n else {\n U32 init_base = base;\n base += x;\n length -= x;\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n }\n\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n if (--m->bits_until_update == 0) m->update(); \/\/ periodic model update\n}\n\nvoid ArithmeticEncoder::encodeSymbol(EntropyModel* model, U32 sym)\n{\n assert(model);\n ArithmeticModel* m = (ArithmeticModel*)model;\r\n assert(sym <= m->last_symbol);\n U32 x, init_base = base;\n \/\/ compute products\n if (sym == m->last_symbol) {\n x = m->distribution[sym] * (length >> DM__LengthShift);\n base += x; \/\/ update interval\n length -= x; \/\/ no product needed\n }\n else {\n x = m->distribution[sym] * (length >>= DM__LengthShift);\n base += x; \/\/ update interval\n length = m->distribution[sym+1] * length - x;\n }\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n\n ++m->symbol_count[sym];\n if (--m->symbols_until_update == 0) m->update(); \/\/ periodic model update\n}\n\nvoid ArithmeticEncoder::writeBit(U32 sym)\n{\n assert(sym < 2);\n\n U32 init_base = base;\n base += sym * (length >>= 1); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeBits(U32 bits, U32 sym)\n{\n assert(bits && (bits <= 32) && (sym < (1u<<bits)));\n\n if (bits > 19)\n {\n writeShort(sym&U16_MAX);\n sym = sym >> 16;\n bits = bits - 16;\n }\n\n U32 init_base = base;\n base += sym * (length >>= bits); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeByte(U8 sym)\n{\n U32 init_base = base;\n base += (U32)(sym) * (length >>= 8); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\nvoid ArithmeticEncoder::writeShort(U16 sym)\n{\n U32 init_base = base;\n base += (U32)(sym) * (length >>= 16); \/\/ new interval base and length\n\n if (init_base > base) propagate_carry(); \/\/ overflow = carry\n if (length < AC__MinLength) renorm_enc_interval(); \/\/ renormalization\n}\n\ninline void ArithmeticEncoder::writeInt(U32 sym)\n{\n writeShort((U16)(sym & 0xFFFF)); \/\/ lower 16 bits\n writeShort((U16)(sym >> 16)); \/\/ UPPER 16 bits\n}\n\ninline void ArithmeticEncoder::writeFloat(F32 sym) \/* danger in float reinterpretation *\/\n{\n U32I32F32 u32i32f32;\n u32i32f32.f32 = sym;\n writeInt(u32i32f32.u32);\n}\n\ninline void ArithmeticEncoder::writeInt64(U64 sym)\n{\n writeInt((U32)(sym & 0xFFFFFFFF)); \/\/ lower 32 bits\n writeInt((U32)(sym >> 32)); \/\/ UPPER 32 bits\n}\n\ninline void ArithmeticEncoder::writeDouble(F64 sym) \/* danger in float reinterpretation *\/\n{\n U64I64F64 u64i64f64;\n u64i64f64.f64 = sym;\n writeInt64(u64i64f64.u64);\n}\n\ninline void ArithmeticEncoder::propagate_carry()\n{\n U8 * p;\n if (outbyte == outbuffer)\n p = endbuffer - 1;\n else\n p = outbyte - 1;\n while (*p == 0xFFU)\n {\n *p = 0;\n if (p == outbuffer)\n p = endbuffer - 1;\n else\n p--;\n assert(outbuffer <= p);\n assert(p < endbuffer); \n assert(outbyte < endbuffer); \n }\n ++*p;\n}\n\ninline void ArithmeticEncoder::renorm_enc_interval()\n{\n do { \/\/ output and discard top byte\n assert(outbuffer <= outbyte);\r\n assert(outbyte < endbuffer); \r\n assert(outbyte < endbyte); \r\n *outbyte++ = (U8)(base >> 24);\r\n if (outbyte == endbyte) manage_outbuffer();\r\n base <<= 8;\n } while ((length <<= 8) < AC__MinLength); \/\/ length multiplied by 256\n}\n\r\ninline void ArithmeticEncoder::manage_outbuffer()\r\n{\r\n if (outbyte == endbuffer) outbyte = outbuffer;\r\n outstream->putBytes(outbyte, AC_BUFFER_SIZE);\r\n endbyte = outbyte + AC_BUFFER_SIZE;\r\n assert(endbyte > outbyte);\r\n assert(outbyte < endbuffer); \r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* jsonrpc.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md). *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"jsonrpc.h\"\n#include \"core\/io\/json.h\"\n\nJSONRPC::JSONRPC() {\n}\n\nJSONRPC::~JSONRPC() {\n}\n\nvoid JSONRPC::_bind_methods() {\n\tClassDB::bind_method(D_METHOD(\"set_scope\", \"scope\", \"target\"), &JSONRPC::set_scope);\n\tClassDB::bind_method(D_METHOD(\"process_action\", \"action\", \"recurse\"), &JSONRPC::process_action, DEFVAL(false));\n\tClassDB::bind_method(D_METHOD(\"process_string\", \"action\"), &JSONRPC::process_string);\n\n\tClassDB::bind_method(D_METHOD(\"make_request\", \"method\", \"params\", \"id\"), &JSONRPC::make_request);\n\tClassDB::bind_method(D_METHOD(\"make_response\", \"result\", \"id\"), &JSONRPC::make_response);\n\tClassDB::bind_method(D_METHOD(\"make_notification\", \"method\", \"params\"), &JSONRPC::make_notification);\n\tClassDB::bind_method(D_METHOD(\"make_response_error\", \"code\", \"message\", \"id\"), &JSONRPC::make_response_error, DEFVAL(Variant()));\n\n\tBIND_ENUM_CONSTANT(PARSE_ERROR);\n\tBIND_ENUM_CONSTANT(INVALID_REQUEST);\n\tBIND_ENUM_CONSTANT(METHOD_NOT_FOUND);\n\tBIND_ENUM_CONSTANT(INVALID_PARAMS);\n\tBIND_ENUM_CONSTANT(INTERNAL_ERROR);\n}\n\nDictionary JSONRPC::make_response_error(int p_code, const String &p_message, const Variant &p_id) const {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\n\tDictionary err;\n\terr[\"code\"] = p_code;\n\terr[\"message\"] = p_message;\n\n\tdict[\"error\"] = err;\n\tdict[\"id\"] = p_id;\n\n\treturn dict;\n}\n\nDictionary JSONRPC::make_response(const Variant &p_value, const Variant &p_id) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"id\"] = p_id;\n\tdict[\"result\"] = p_value;\n\treturn dict;\n}\n\nDictionary JSONRPC::make_notification(const String &p_method, const Variant &p_params) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"method\"] = p_method;\n\tdict[\"params\"] = p_params;\n\treturn dict;\n}\n\nDictionary JSONRPC::make_request(const String &p_method, const Variant &p_params, const Variant &p_id) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"method\"] = p_method;\n\tdict[\"params\"] = p_params;\n\tdict[\"id\"] = p_id;\n\treturn dict;\n}\n\nVariant JSONRPC::process_action(const Variant &p_action, bool p_process_arr_elements) {\n\tVariant ret;\n\tif (p_action.get_type() == Variant::DICTIONARY) {\n\t\tDictionary dict = p_action;\n\t\tString method = dict.get(\"method\", \"\");\n\t\tArray args;\n\t\tif (dict.has(\"params\")) {\n\t\t\tVariant params = dict.get(\"params\", Variant());\n\t\t\tif (params.get_type() == Variant::ARRAY) {\n\t\t\t\targs = params;\n\t\t\t} else {\n\t\t\t\targs.push_back(params);\n\t\t\t}\n\t\t}\n\n\t\tObject *object = this;\n\t\tif (method_scopes.has(method.get_base_dir())) {\n\t\t\tobject = method_scopes[method.get_base_dir()];\n\t\t\tmethod = method.get_file();\n\t\t}\n\n\t\tVariant id;\n\t\tif (dict.has(\"id\")) {\n\t\t\tid = dict[\"id\"];\n\t\t}\n\n\t\tif (object == NULL || !object->has_method(method)) {\n\t\t\tret = make_response_error(JSONRPC::METHOD_NOT_FOUND, \"Method not found\", id);\n\t\t} else {\n\t\t\tVariant call_ret = object->callv(method, args);\n\t\t\tif (id.get_type() != Variant::NIL) {\n\t\t\t\tret = make_response(call_ret, id);\n\t\t\t}\n\t\t}\n\t} else if (p_action.get_type() == Variant::ARRAY && p_process_arr_elements) {\n\t\tArray arr = p_action;\n\t\tint size = arr.size();\n\t\tif (size) {\n\t\t\tArray arr_ret;\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tconst Variant &var = arr.get(i);\n\t\t\t\tarr_ret.push_back(process_action(var));\n\t\t\t}\n\t\t\tret = arr_ret;\n\t\t} else {\n\t\t\tret = make_response_error(JSONRPC::INVALID_REQUEST, \"Invalid Request\");\n\t\t}\n\t} else {\n\t\tret = make_response_error(JSONRPC::INVALID_REQUEST, \"Invalid Request\");\n\t}\n\treturn ret;\n}\n\nString JSONRPC::process_string(const String &p_input) {\n\n\tif (p_input.empty()) return String();\n\n\tVariant ret;\n\tVariant input;\n\tString err_message;\n\tint err_line;\n\tif (OK != JSON::parse(p_input, input, err_message, err_line)) {\n\t\tret = make_response_error(JSONRPC::PARSE_ERROR, \"Parse error\");\n\t} else {\n\t\tret = process_action(input, true);\n\t}\n\n\tif (ret.get_type() == Variant::NIL) {\n\t\treturn \"\";\n\t}\n\treturn JSON::print(ret);\n}\n\nvoid JSONRPC::set_scope(const String &p_scope, Object *p_obj) {\n\tmethod_scopes[p_scope] = p_obj;\n}\n<commit_msg>Improve jsonrpc error reporting<commit_after>\/*************************************************************************\/\n\/* jsonrpc.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md). *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"jsonrpc.h\"\n#include \"core\/io\/json.h\"\n\nJSONRPC::JSONRPC() {\n}\n\nJSONRPC::~JSONRPC() {\n}\n\nvoid JSONRPC::_bind_methods() {\n\tClassDB::bind_method(D_METHOD(\"set_scope\", \"scope\", \"target\"), &JSONRPC::set_scope);\n\tClassDB::bind_method(D_METHOD(\"process_action\", \"action\", \"recurse\"), &JSONRPC::process_action, DEFVAL(false));\n\tClassDB::bind_method(D_METHOD(\"process_string\", \"action\"), &JSONRPC::process_string);\n\n\tClassDB::bind_method(D_METHOD(\"make_request\", \"method\", \"params\", \"id\"), &JSONRPC::make_request);\n\tClassDB::bind_method(D_METHOD(\"make_response\", \"result\", \"id\"), &JSONRPC::make_response);\n\tClassDB::bind_method(D_METHOD(\"make_notification\", \"method\", \"params\"), &JSONRPC::make_notification);\n\tClassDB::bind_method(D_METHOD(\"make_response_error\", \"code\", \"message\", \"id\"), &JSONRPC::make_response_error, DEFVAL(Variant()));\n\n\tBIND_ENUM_CONSTANT(PARSE_ERROR);\n\tBIND_ENUM_CONSTANT(INVALID_REQUEST);\n\tBIND_ENUM_CONSTANT(METHOD_NOT_FOUND);\n\tBIND_ENUM_CONSTANT(INVALID_PARAMS);\n\tBIND_ENUM_CONSTANT(INTERNAL_ERROR);\n}\n\nDictionary JSONRPC::make_response_error(int p_code, const String &p_message, const Variant &p_id) const {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\n\tDictionary err;\n\terr[\"code\"] = p_code;\n\terr[\"message\"] = p_message;\n\n\tdict[\"error\"] = err;\n\tdict[\"id\"] = p_id;\n\n\treturn dict;\n}\n\nDictionary JSONRPC::make_response(const Variant &p_value, const Variant &p_id) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"id\"] = p_id;\n\tdict[\"result\"] = p_value;\n\treturn dict;\n}\n\nDictionary JSONRPC::make_notification(const String &p_method, const Variant &p_params) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"method\"] = p_method;\n\tdict[\"params\"] = p_params;\n\treturn dict;\n}\n\nDictionary JSONRPC::make_request(const String &p_method, const Variant &p_params, const Variant &p_id) {\n\tDictionary dict;\n\tdict[\"jsonrpc\"] = \"2.0\";\n\tdict[\"method\"] = p_method;\n\tdict[\"params\"] = p_params;\n\tdict[\"id\"] = p_id;\n\treturn dict;\n}\n\nVariant JSONRPC::process_action(const Variant &p_action, bool p_process_arr_elements) {\n\tVariant ret;\n\tif (p_action.get_type() == Variant::DICTIONARY) {\n\t\tDictionary dict = p_action;\n\t\tString method = dict.get(\"method\", \"\");\n\t\tArray args;\n\t\tif (dict.has(\"params\")) {\n\t\t\tVariant params = dict.get(\"params\", Variant());\n\t\t\tif (params.get_type() == Variant::ARRAY) {\n\t\t\t\targs = params;\n\t\t\t} else {\n\t\t\t\targs.push_back(params);\n\t\t\t}\n\t\t}\n\n\t\tObject *object = this;\n\t\tif (method_scopes.has(method.get_base_dir())) {\n\t\t\tobject = method_scopes[method.get_base_dir()];\n\t\t\tmethod = method.get_file();\n\t\t}\n\n\t\tVariant id;\n\t\tif (dict.has(\"id\")) {\n\t\t\tid = dict[\"id\"];\n\t\t}\n\n\t\tif (object == NULL || !object->has_method(method)) {\n\t\t\tret = make_response_error(JSONRPC::METHOD_NOT_FOUND, \"Method not found: \" + method, id);\n\t\t} else {\n\t\t\tVariant call_ret = object->callv(method, args);\n\t\t\tif (id.get_type() != Variant::NIL) {\n\t\t\t\tret = make_response(call_ret, id);\n\t\t\t}\n\t\t}\n\t} else if (p_action.get_type() == Variant::ARRAY && p_process_arr_elements) {\n\t\tArray arr = p_action;\n\t\tint size = arr.size();\n\t\tif (size) {\n\t\t\tArray arr_ret;\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tconst Variant &var = arr.get(i);\n\t\t\t\tarr_ret.push_back(process_action(var));\n\t\t\t}\n\t\t\tret = arr_ret;\n\t\t} else {\n\t\t\tret = make_response_error(JSONRPC::INVALID_REQUEST, \"Invalid Request\");\n\t\t}\n\t} else {\n\t\tret = make_response_error(JSONRPC::INVALID_REQUEST, \"Invalid Request\");\n\t}\n\treturn ret;\n}\n\nString JSONRPC::process_string(const String &p_input) {\n\n\tif (p_input.empty()) return String();\n\n\tVariant ret;\n\tVariant input;\n\tString err_message;\n\tint err_line;\n\tif (OK != JSON::parse(p_input, input, err_message, err_line)) {\n\t\tret = make_response_error(JSONRPC::PARSE_ERROR, \"Parse error\");\n\t} else {\n\t\tret = process_action(input, true);\n\t}\n\n\tif (ret.get_type() == Variant::NIL) {\n\t\treturn \"\";\n\t}\n\treturn JSON::print(ret);\n}\n\nvoid JSONRPC::set_scope(const String &p_scope, Object *p_obj) {\n\tmethod_scopes[p_scope] = p_obj;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <vector>\n#include <string>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include <glog\/logging.h>\n\n#include <osquery\/core.h>\n#include <osquery\/tables.h>\n#include <osquery\/filesystem.h>\n\nnamespace osquery {\nnamespace tables {\n\nQueryData parseNfsSharesContent(const std::string& content) {\n QueryData results;\n\n for (const auto& i : split(content, \"\\n\")) {\n auto line = split(i);\n if (line.size() == 0 || boost::starts_with(line[0], \"#\")) {\n continue;\n }\n std::vector<std::string> lineExports;\n unsigned int readonly = 0;\n int index_of_options = -1;\n\n for (const auto& iter : line) {\n index_of_options++;\n if (iter[0] == '\/') {\n lineExports.push_back(iter);\n\n } else {\n break;\n }\n }\n \/\/ Start looping through starting at the first options\n \/\/ (so skip the exports)\n for (std::vector<std::string>::iterator iter =\n line.begin() + index_of_options;\n iter != line.end();\n ++iter) {\n if (iter->compare(\"-ro\") == 0 || iter->compare(\"-o\") == 0) {\n readonly = 1;\n }\n }\n for (std::vector<std::string>::iterator iter = lineExports.begin();\n iter != lineExports.end();\n ++iter) {\n Row r;\n r[\"share\"] = *iter;\n if (readonly) {\n r[\"readonly\"] = \"true\";\n } else {\n r[\"readonly\"] = \"false\";\n }\n std::ostringstream oss;\n std::copy(line.begin() + index_of_options,\n line.end(),\n std::ostream_iterator<std::string>(oss, \" \"));\n r[\"options\"] = oss.str();\n results.push_back(r);\n }\n }\n return results;\n}\n\nQueryData genNfsShares(QueryContext& context) {\n std::string content;\n auto s = osquery::readFile(\"\/etc\/exports\", content);\n if (s.ok()) {\n return parseNfsSharesContent(content);\n } else {\n VLOG(1) << \"Error reading \/etc\/exports: \" << s.toString();\n return {};\n }\n}\n}\n}\n<commit_msg>More minor changes to address marpias requests<commit_after>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <vector>\n#include <string>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n\n#include <glog\/logging.h>\n\n#include <osquery\/core.h>\n#include <osquery\/tables.h>\n#include <osquery\/filesystem.h>\n\nnamespace osquery {\nnamespace tables {\n\nQueryData parseNfsSharesContent(const std::string& content) {\n QueryData results;\n\n for (const auto& i : split(content, \"\\n\")) {\n auto line = split(i);\n if (line.size() == 0 || boost::starts_with(line[0], \"#\")) {\n continue;\n }\n std::vector<std::string> line_exports;\n unsigned int readonly = 0;\n int index_of_options = -1;\n\n for (const auto& iter : line) {\n index_of_options++;\n if (iter[0] == '\/') {\n line_exports.push_back(iter);\n\n } else {\n break;\n }\n }\n \/\/ Start looping through starting at the first options\n \/\/ (so skip the exports)\n for (std::vector<std::string>::iterator iter =\n line.begin() + index_of_options;\n iter != line.end();\n ++iter) {\n if (iter->compare(\"-ro\") == 0 || iter->compare(\"-o\") == 0) {\n readonly = 1;\n }\n }\n for (const auto& iter : line_exports) {\n Row r;\n r[\"share\"] = iter;\n if (readonly) {\n r[\"readonly\"] = \"true\";\n } else {\n r[\"readonly\"] = \"false\";\n }\n std::ostringstream oss;\n std::copy(line.begin() + index_of_options,\n line.end(),\n std::ostream_iterator<std::string>(oss, \" \"));\n r[\"options\"] = oss.str();\n results.push_back(r);\n }\n }\n return results;\n}\n\nQueryData genNfsShares(QueryContext& context) {\n std::string content;\n auto s = osquery::readFile(\"\/etc\/exports\", content);\n if (s.ok()) {\n return parseNfsSharesContent(content);\n } else {\n VLOG(1) << \"Error reading \/etc\/exports: \" << s.toString();\n return {};\n }\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2014-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under both the Apache 2.0 license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n *\/\n\n#include <map>\n#include <string>\n\n#define _WIN32_DCOM\n\n#include <Windows.h>\n#include <iomanip>\n#include <psapi.h>\n#include <stdlib.h>\n#include <tlhelp32.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n#include <osquery\/core.h>\n#include <osquery\/filesystem.h>\n#include <osquery\/logger.h>\n#include <osquery\/tables.h>\n\n#include \"osquery\/core\/conversions.h\"\n#include \"osquery\/core\/windows\/wmi.h\"\n#include \"osquery\/filesystem\/fileops.h\"\n\nnamespace osquery {\nint getUidFromSid(PSID sid);\nint getGidFromSid(PSID sid);\nnamespace tables {\n\nconst std::map<unsigned long, std::string> kMemoryConstants = {\n {PAGE_EXECUTE, \"PAGE_EXECUTE\"},\n {PAGE_EXECUTE_READ, \"PAGE_EXECUTE_READ\"},\n {PAGE_EXECUTE_READWRITE, \"PAGE_EXECUTE_READWRITE\"},\n {PAGE_EXECUTE_WRITECOPY, \"PAGE_EXECUTE_WRITECOPY\"},\n {PAGE_NOACCESS, \"PAGE_NOACCESS\"},\n {PAGE_READONLY, \"PAGE_READONLY\"},\n {PAGE_READWRITE, \"PAGE_READWRITE\"},\n {PAGE_WRITECOPY, \"PAGE_WRITECOPY\"},\n {PAGE_GUARD, \"PAGE_GUARD\"},\n {PAGE_NOCACHE, \"PAGE_NOCACHE\"},\n {PAGE_WRITECOMBINE, \"PAGE_WRITECOMBINE\"},\n};\n\n\/\/\/ Given a pid, enumerates all loaded modules and memory pages for that process\nStatus genMemoryMap(unsigned long pid, QueryData& results) {\n auto proc = OpenProcess(PROCESS_QUERY_INFORMATION, FALSE, pid);\n if (proc == nullptr) {\n Row r;\n r[\"pid\"] = INTEGER(pid);\n r[\"start\"] = INTEGER(-1);\n r[\"end\"] = INTEGER(-1);\n r[\"permissions\"] = \"\";\n r[\"offset\"] = INTEGER(-1);\n r[\"device\"] = \"-1\";\n r[\"inode\"] = INTEGER(-1);\n r[\"path\"] = \"\";\n r[\"pseudo\"] = INTEGER(-1);\n results.push_back(r);\n return Status(1, \"Failed to open handle to process \" + std::to_string(pid));\n }\n auto modSnap =\n CreateToolhelp32Snapshot(TH32CS_SNAPMODULE | TH32CS_SNAPMODULE32, pid);\n if (modSnap == INVALID_HANDLE_VALUE) {\n CloseHandle(proc);\n return Status(1, \"Failed to enumerate modules for \" + std::to_string(pid));\n }\n\n auto formatMemPerms = [](unsigned long perm) {\n std::vector<std::string> perms;\n for (const auto& kv : kMemoryConstants) {\n if (kv.first & perm) {\n perms.push_back(kv.second);\n }\n }\n return osquery::join(perms, \" | \");\n };\n\n MODULEENTRY32 me;\n MEMORY_BASIC_INFORMATION mInfo;\n me.dwSize = sizeof(MODULEENTRY32);\n auto ret = Module32First(modSnap, &me);\n while (ret != FALSE) {\n for (auto p = me.modBaseAddr;\n VirtualQueryEx(proc, p, &mInfo, sizeof(mInfo)) == sizeof(mInfo) &&\n p < (me.modBaseAddr + me.modBaseSize);\n p += mInfo.RegionSize) {\n Row r;\n r[\"pid\"] = INTEGER(pid);\n std::stringstream ssStart;\n ssStart << std::hex << mInfo.BaseAddress;\n r[\"start\"] = \"0x\" + ssStart.str();\n std::stringstream ssEnd;\n ssEnd << std::hex << std::setfill('0') << std::setw(16)\n << reinterpret_cast<unsigned long long>(mInfo.BaseAddress) +\n mInfo.RegionSize;\n r[\"end\"] = \"0x\" + ssEnd.str();\n r[\"permissions\"] = formatMemPerms(mInfo.Protect);\n r[\"offset\"] =\n BIGINT(reinterpret_cast<unsigned long long>(mInfo.AllocationBase));\n r[\"device\"] = \"-1\";\n r[\"inode\"] = INTEGER(-1);\n r[\"path\"] = me.szExePath;\n r[\"pseudo\"] = INTEGER(-1);\n results.push_back(r);\n }\n ret = Module32Next(modSnap, &me);\n }\n CloseHandle(proc);\n CloseHandle(modSnap);\n return Status(0, \"Ok\");\n}\n\n\/\/\/ Helper function for enumerating all active processes on the system\nStatus getProcList(std::set<long>& pids) {\n auto procSnap = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n if (procSnap == INVALID_HANDLE_VALUE) {\n return Status(1, \"Failed to open process snapshot\");\n }\n\n PROCESSENTRY32 procEntry;\n procEntry.dwSize = sizeof(PROCESSENTRY32);\n auto ret = Process32First(procSnap, &procEntry);\n\n if (ret == FALSE) {\n CloseHandle(procSnap);\n return Status(1, \"Failed to open first process\");\n }\n\n while (ret != FALSE) {\n pids.insert(procEntry.th32ProcessID);\n ret = Process32Next(procSnap, &procEntry);\n }\n\n CloseHandle(procSnap);\n return Status(0, \"Ok\");\n}\n\nvoid genProcess(const WmiResultItem& result, QueryData& results_data) {\n Row r;\n Status s;\n long pid;\n long lPlaceHolder;\n std::string sPlaceHolder;\n\n \/\/\/ Store current process pid for more efficient API use.\n auto currentPid = GetCurrentProcessId();\n\n s = result.GetLong(\"ProcessId\", pid);\n r[\"pid\"] = s.ok() ? BIGINT(pid) : BIGINT(-1);\n\n long uid = -1;\n long gid = -1;\n HANDLE hProcess = nullptr;\n if (pid == currentPid) {\n hProcess = GetCurrentProcess();\n } else {\n hProcess =\n OpenProcess(PROCESS_QUERY_INFORMATION | PROCESS_VM_READ, false, pid);\n }\n\n if (GetLastError() == ERROR_ACCESS_DENIED) {\n uid = 0;\n gid = 0;\n }\n\n result.GetString(\"Name\", r[\"name\"]);\n result.GetString(\"ExecutablePath\", r[\"path\"]);\n result.GetString(\"CommandLine\", r[\"cmdline\"]);\n result.GetString(\"ExecutionState\", r[\"state\"]);\n result.GetLong(\"ParentProcessId\", lPlaceHolder);\n r[\"parent\"] = BIGINT(lPlaceHolder);\n result.GetLong(\"Priority\", lPlaceHolder);\n r[\"nice\"] = INTEGER(lPlaceHolder);\n r[\"on_disk\"] = osquery::pathExists(r[\"path\"]).toString();\n result.GetLong(\"ThreadCount\", lPlaceHolder);\n r[\"threads\"] = INTEGER(lPlaceHolder);\n result.GetString(\"PrivatePageCount\", sPlaceHolder);\n r[\"wired_size\"] = BIGINT(sPlaceHolder);\n result.GetString(\"WorkingSetSize\", sPlaceHolder);\n r[\"resident_size\"] = sPlaceHolder;\n result.GetString(\"VirtualSize\", sPlaceHolder);\n r[\"total_size\"] = BIGINT(sPlaceHolder);\n\n std::vector<char> fileName(MAX_PATH + 1, 0x0);\n if (pid == currentPid) {\n GetModuleFileName(nullptr, fileName.data(), MAX_PATH);\n } else {\n GetModuleFileNameEx(hProcess, nullptr, fileName.data(), MAX_PATH);\n }\n\n r[\"cwd\"] = SQL_TEXT(fileName.data());\n r[\"root\"] = r[\"cwd\"];\n\n r[\"pgroup\"] = \"-1\";\n r[\"euid\"] = \"-1\";\n r[\"suid\"] = \"-1\";\n r[\"egid\"] = \"-1\";\n r[\"sgid\"] = \"-1\";\n\n FILETIME createTime;\n FILETIME exitTime;\n FILETIME kernelTime;\n FILETIME userTime;\n auto procRet =\n GetProcessTimes(hProcess, &createTime, &exitTime, &kernelTime, &userTime);\n if (procRet == FALSE) {\n r[\"user_time\"] = BIGINT(-1);\n r[\"system_time\"] = BIGINT(-1);\n r[\"start_time\"] = BIGINT(-1);\n } else {\n \/\/ Windows stores proc times in 100 nanosecond ticks\n ULARGE_INTEGER utime;\n utime.HighPart = userTime.dwHighDateTime;\n utime.LowPart = userTime.dwLowDateTime;\n r[\"user_time\"] = BIGINT(utime.QuadPart \/ 10000000);\n utime.HighPart = kernelTime.dwHighDateTime;\n utime.LowPart = kernelTime.dwLowDateTime;\n r[\"system_time\"] = BIGINT(utime.QuadPart \/ 10000000);\n r[\"start_time\"] = BIGINT(osquery::filetimeToUnixtime(createTime));\n }\n\n \/\/\/ Get the process UID and GID from its SID\n HANDLE tok = nullptr;\n std::vector<char> tokOwner(sizeof(TOKEN_OWNER), 0x0);\n auto ret = OpenProcessToken(hProcess, TOKEN_READ, &tok);\n if (ret != 0 && tok != nullptr) {\n unsigned long tokOwnerBuffLen;\n ret = GetTokenInformation(tok, TokenUser, nullptr, 0, &tokOwnerBuffLen);\n if (ret == 0 && GetLastError() == ERROR_INSUFFICIENT_BUFFER) {\n tokOwner.resize(tokOwnerBuffLen);\n ret = GetTokenInformation(\n tok, TokenUser, tokOwner.data(), tokOwnerBuffLen, &tokOwnerBuffLen);\n }\n\n \/\/ Check if the process is using an elevated token\n auto elevated = FALSE;\n TOKEN_ELEVATION Elevation;\n DWORD cbSize = sizeof(TOKEN_ELEVATION);\n if (GetTokenInformation(\n tok, TokenElevation, &Elevation, sizeof(Elevation), &cbSize)) {\n elevated = Elevation.TokenIsElevated;\n }\n\n r[\"is_elevated_token\"] = elevated ? INTEGER(1) : INTEGER(0);\n }\n if (uid != 0 && ret != 0 && !tokOwner.empty()) {\n auto sid = PTOKEN_OWNER(tokOwner.data())->Owner;\n r[\"uid\"] = INTEGER(getUidFromSid(sid));\n r[\"gid\"] = INTEGER(getGidFromSid(sid));\n } else {\n r[\"uid\"] = INTEGER(uid);\n r[\"gid\"] = INTEGER(gid);\n }\n\n if (hProcess != nullptr) {\n CloseHandle(hProcess);\n }\n if (tok != nullptr) {\n CloseHandle(tok);\n tok = nullptr;\n }\n results_data.push_back(r);\n}\n\nQueryData genProcesses(QueryContext& context) {\n QueryData results;\n\n std::string query = \"SELECT * FROM Win32_Process\";\n\n std::set<long> pidlist;\n if (context.constraints.count(\"pid\") > 0 &&\n context.constraints.at(\"pid\").exists(EQUALS)) {\n for (const auto& pid : context.constraints.at(\"pid\").getAll<int>(EQUALS)) {\n if (pid > 0) {\n pidlist.insert(pid);\n }\n }\n \/\/ None of the constraints returned valid pids, bail out early\n if (pidlist.empty()) {\n return results;\n }\n }\n\n if (pidlist.size() > 0) {\n std::vector<std::string> constraints;\n for (const auto& pid : pidlist) {\n constraints.push_back(\"ProcessId=\" + std::to_string(pid));\n }\n if (constraints.size() > 0) {\n query += \" WHERE \" + boost::algorithm::join(constraints, \" OR \");\n }\n }\n\n WmiRequest request(query);\n if (request.getStatus().ok()) {\n for (const auto& item : request.results()) {\n long pid = 0;\n if (item.GetLong(\"ProcessId\", pid).ok()) {\n genProcess(item, results);\n }\n }\n }\n\n return results;\n}\n\nQueryData genProcessMemoryMap(QueryContext& context) {\n QueryData results;\n\n std::set<long> pidlist;\n if (context.constraints.count(\"pid\") > 0 &&\n context.constraints.at(\"pid\").exists(EQUALS)) {\n for (const auto& pid : context.constraints.at(\"pid\").getAll<int>(EQUALS)) {\n if (pid > 0) {\n pidlist.insert(pid);\n }\n }\n }\n if (pidlist.empty()) {\n getProcList(pidlist);\n }\n\n for (const auto& pid : pidlist) {\n auto s = genMemoryMap(pid, results);\n if (!s.ok()) {\n VLOG(1) << s.getMessage();\n }\n }\n\n return results;\n}\n\n} \/\/ namespace tables\n} \/\/ namespace osquery\n<commit_msg>Using TOKEN_USER instead of TOKEN_OWNER struct (#4651)<commit_after>\/**\n * Copyright (c) 2014-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under both the Apache 2.0 license (found in the\n * LICENSE file in the root directory of this source tree) and the GPLv2 (found\n * in the COPYING file in the root directory of this source tree).\n * You may select, at your option, one of the above-listed licenses.\n *\/\n\n#include <map>\n#include <string>\n\n#define _WIN32_DCOM\n\n#include <Windows.h>\n#include <iomanip>\n#include <psapi.h>\n#include <stdlib.h>\n#include <tlhelp32.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n#include <osquery\/core.h>\n#include <osquery\/filesystem.h>\n#include <osquery\/logger.h>\n#include <osquery\/tables.h>\n\n#include \"osquery\/core\/conversions.h\"\n#include \"osquery\/core\/windows\/wmi.h\"\n#include \"osquery\/filesystem\/fileops.h\"\n\nnamespace osquery {\nint getUidFromSid(PSID sid);\nint getGidFromSid(PSID sid);\nnamespace tables {\n\nconst std::map<unsigned long, std::string> kMemoryConstants = {\n {PAGE_EXECUTE, \"PAGE_EXECUTE\"},\n {PAGE_EXECUTE_READ, \"PAGE_EXECUTE_READ\"},\n {PAGE_EXECUTE_READWRITE, \"PAGE_EXECUTE_READWRITE\"},\n {PAGE_EXECUTE_WRITECOPY, \"PAGE_EXECUTE_WRITECOPY\"},\n {PAGE_NOACCESS, \"PAGE_NOACCESS\"},\n {PAGE_READONLY, \"PAGE_READONLY\"},\n {PAGE_READWRITE, \"PAGE_READWRITE\"},\n {PAGE_WRITECOPY, \"PAGE_WRITECOPY\"},\n {PAGE_GUARD, \"PAGE_GUARD\"},\n {PAGE_NOCACHE, \"PAGE_NOCACHE\"},\n {PAGE_WRITECOMBINE, \"PAGE_WRITECOMBINE\"},\n};\n\n\/\/\/ Given a pid, enumerates all loaded modules and memory pages for that process\nStatus genMemoryMap(unsigned long pid, QueryData& results) {\n auto proc = OpenProcess(PROCESS_QUERY_INFORMATION, FALSE, pid);\n if (proc == nullptr) {\n Row r;\n r[\"pid\"] = INTEGER(pid);\n r[\"start\"] = INTEGER(-1);\n r[\"end\"] = INTEGER(-1);\n r[\"permissions\"] = \"\";\n r[\"offset\"] = INTEGER(-1);\n r[\"device\"] = \"-1\";\n r[\"inode\"] = INTEGER(-1);\n r[\"path\"] = \"\";\n r[\"pseudo\"] = INTEGER(-1);\n results.push_back(r);\n return Status(1, \"Failed to open handle to process \" + std::to_string(pid));\n }\n auto modSnap =\n CreateToolhelp32Snapshot(TH32CS_SNAPMODULE | TH32CS_SNAPMODULE32, pid);\n if (modSnap == INVALID_HANDLE_VALUE) {\n CloseHandle(proc);\n return Status(1, \"Failed to enumerate modules for \" + std::to_string(pid));\n }\n\n auto formatMemPerms = [](unsigned long perm) {\n std::vector<std::string> perms;\n for (const auto& kv : kMemoryConstants) {\n if (kv.first & perm) {\n perms.push_back(kv.second);\n }\n }\n return osquery::join(perms, \" | \");\n };\n\n MODULEENTRY32 me;\n MEMORY_BASIC_INFORMATION mInfo;\n me.dwSize = sizeof(MODULEENTRY32);\n auto ret = Module32First(modSnap, &me);\n while (ret != FALSE) {\n for (auto p = me.modBaseAddr;\n VirtualQueryEx(proc, p, &mInfo, sizeof(mInfo)) == sizeof(mInfo) &&\n p < (me.modBaseAddr + me.modBaseSize);\n p += mInfo.RegionSize) {\n Row r;\n r[\"pid\"] = INTEGER(pid);\n std::stringstream ssStart;\n ssStart << std::hex << mInfo.BaseAddress;\n r[\"start\"] = \"0x\" + ssStart.str();\n std::stringstream ssEnd;\n ssEnd << std::hex << std::setfill('0') << std::setw(16)\n << reinterpret_cast<unsigned long long>(mInfo.BaseAddress) +\n mInfo.RegionSize;\n r[\"end\"] = \"0x\" + ssEnd.str();\n r[\"permissions\"] = formatMemPerms(mInfo.Protect);\n r[\"offset\"] =\n BIGINT(reinterpret_cast<unsigned long long>(mInfo.AllocationBase));\n r[\"device\"] = \"-1\";\n r[\"inode\"] = INTEGER(-1);\n r[\"path\"] = me.szExePath;\n r[\"pseudo\"] = INTEGER(-1);\n results.push_back(r);\n }\n ret = Module32Next(modSnap, &me);\n }\n CloseHandle(proc);\n CloseHandle(modSnap);\n return Status(0, \"Ok\");\n}\n\n\/\/\/ Helper function for enumerating all active processes on the system\nStatus getProcList(std::set<long>& pids) {\n auto procSnap = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n if (procSnap == INVALID_HANDLE_VALUE) {\n return Status(1, \"Failed to open process snapshot\");\n }\n\n PROCESSENTRY32 procEntry;\n procEntry.dwSize = sizeof(PROCESSENTRY32);\n auto ret = Process32First(procSnap, &procEntry);\n\n if (ret == FALSE) {\n CloseHandle(procSnap);\n return Status(1, \"Failed to open first process\");\n }\n\n while (ret != FALSE) {\n pids.insert(procEntry.th32ProcessID);\n ret = Process32Next(procSnap, &procEntry);\n }\n\n CloseHandle(procSnap);\n return Status(0, \"Ok\");\n}\n\nvoid genProcess(const WmiResultItem& result, QueryData& results_data) {\n Row r;\n Status s;\n long pid;\n long lPlaceHolder;\n std::string sPlaceHolder;\n\n \/\/\/ Store current process pid for more efficient API use.\n auto currentPid = GetCurrentProcessId();\n\n s = result.GetLong(\"ProcessId\", pid);\n r[\"pid\"] = s.ok() ? BIGINT(pid) : BIGINT(-1);\n\n long uid = -1;\n long gid = -1;\n HANDLE hProcess = nullptr;\n if (pid == currentPid) {\n hProcess = GetCurrentProcess();\n } else {\n hProcess =\n OpenProcess(PROCESS_QUERY_INFORMATION | PROCESS_VM_READ, false, pid);\n }\n\n if (GetLastError() == ERROR_ACCESS_DENIED) {\n uid = 0;\n gid = 0;\n }\n\n result.GetString(\"Name\", r[\"name\"]);\n result.GetString(\"ExecutablePath\", r[\"path\"]);\n result.GetString(\"CommandLine\", r[\"cmdline\"]);\n result.GetString(\"ExecutionState\", r[\"state\"]);\n result.GetLong(\"ParentProcessId\", lPlaceHolder);\n r[\"parent\"] = BIGINT(lPlaceHolder);\n result.GetLong(\"Priority\", lPlaceHolder);\n r[\"nice\"] = INTEGER(lPlaceHolder);\n r[\"on_disk\"] = osquery::pathExists(r[\"path\"]).toString();\n result.GetLong(\"ThreadCount\", lPlaceHolder);\n r[\"threads\"] = INTEGER(lPlaceHolder);\n result.GetString(\"PrivatePageCount\", sPlaceHolder);\n r[\"wired_size\"] = BIGINT(sPlaceHolder);\n result.GetString(\"WorkingSetSize\", sPlaceHolder);\n r[\"resident_size\"] = sPlaceHolder;\n result.GetString(\"VirtualSize\", sPlaceHolder);\n r[\"total_size\"] = BIGINT(sPlaceHolder);\n\n std::vector<char> fileName(MAX_PATH + 1, 0x0);\n if (pid == currentPid) {\n GetModuleFileName(nullptr, fileName.data(), MAX_PATH);\n } else {\n GetModuleFileNameEx(hProcess, nullptr, fileName.data(), MAX_PATH);\n }\n\n r[\"cwd\"] = SQL_TEXT(fileName.data());\n r[\"root\"] = r[\"cwd\"];\n\n r[\"pgroup\"] = \"-1\";\n r[\"euid\"] = \"-1\";\n r[\"suid\"] = \"-1\";\n r[\"egid\"] = \"-1\";\n r[\"sgid\"] = \"-1\";\n\n FILETIME createTime;\n FILETIME exitTime;\n FILETIME kernelTime;\n FILETIME userTime;\n auto procRet =\n GetProcessTimes(hProcess, &createTime, &exitTime, &kernelTime, &userTime);\n if (procRet == FALSE) {\n r[\"user_time\"] = BIGINT(-1);\n r[\"system_time\"] = BIGINT(-1);\n r[\"start_time\"] = BIGINT(-1);\n } else {\n \/\/ Windows stores proc times in 100 nanosecond ticks\n ULARGE_INTEGER utime;\n utime.HighPart = userTime.dwHighDateTime;\n utime.LowPart = userTime.dwLowDateTime;\n r[\"user_time\"] = BIGINT(utime.QuadPart \/ 10000000);\n utime.HighPart = kernelTime.dwHighDateTime;\n utime.LowPart = kernelTime.dwLowDateTime;\n r[\"system_time\"] = BIGINT(utime.QuadPart \/ 10000000);\n r[\"start_time\"] = BIGINT(osquery::filetimeToUnixtime(createTime));\n }\n\n \/\/\/ Get the process UID and GID from its SID\n HANDLE tok = nullptr;\n std::vector<char> tokUser(sizeof(TOKEN_USER), 0x0);\n auto ret = OpenProcessToken(hProcess, TOKEN_READ, &tok);\n if (ret != 0 && tok != nullptr) {\n unsigned long tokOwnerBuffLen;\n ret = GetTokenInformation(tok, TokenUser, nullptr, 0, &tokOwnerBuffLen);\n if (ret == 0 && GetLastError() == ERROR_INSUFFICIENT_BUFFER) {\n tokUser.resize(tokOwnerBuffLen);\n ret = GetTokenInformation(\n tok, TokenUser, tokUser.data(), tokOwnerBuffLen, &tokOwnerBuffLen);\n }\n\n \/\/ Check if the process is using an elevated token\n auto elevated = FALSE;\n TOKEN_ELEVATION Elevation;\n DWORD cbSize = sizeof(TOKEN_ELEVATION);\n if (GetTokenInformation(\n tok, TokenElevation, &Elevation, sizeof(Elevation), &cbSize)) {\n elevated = Elevation.TokenIsElevated;\n }\n\n r[\"is_elevated_token\"] = elevated ? INTEGER(1) : INTEGER(0);\n }\n if (uid != 0 && ret != 0 && !tokUser.empty()) {\n auto sid = PTOKEN_OWNER(tokUser.data())->Owner;\n r[\"uid\"] = INTEGER(getUidFromSid(sid));\n r[\"gid\"] = INTEGER(getGidFromSid(sid));\n } else {\n r[\"uid\"] = INTEGER(uid);\n r[\"gid\"] = INTEGER(gid);\n }\n\n if (hProcess != nullptr) {\n CloseHandle(hProcess);\n }\n if (tok != nullptr) {\n CloseHandle(tok);\n tok = nullptr;\n }\n results_data.push_back(r);\n}\n\nQueryData genProcesses(QueryContext& context) {\n QueryData results;\n\n std::string query = \"SELECT * FROM Win32_Process\";\n\n std::set<long> pidlist;\n if (context.constraints.count(\"pid\") > 0 &&\n context.constraints.at(\"pid\").exists(EQUALS)) {\n for (const auto& pid : context.constraints.at(\"pid\").getAll<int>(EQUALS)) {\n if (pid > 0) {\n pidlist.insert(pid);\n }\n }\n \/\/ None of the constraints returned valid pids, bail out early\n if (pidlist.empty()) {\n return results;\n }\n }\n\n if (pidlist.size() > 0) {\n std::vector<std::string> constraints;\n for (const auto& pid : pidlist) {\n constraints.push_back(\"ProcessId=\" + std::to_string(pid));\n }\n if (constraints.size() > 0) {\n query += \" WHERE \" + boost::algorithm::join(constraints, \" OR \");\n }\n }\n\n WmiRequest request(query);\n if (request.getStatus().ok()) {\n for (const auto& item : request.results()) {\n long pid = 0;\n if (item.GetLong(\"ProcessId\", pid).ok()) {\n genProcess(item, results);\n }\n }\n }\n\n return results;\n}\n\nQueryData genProcessMemoryMap(QueryContext& context) {\n QueryData results;\n\n std::set<long> pidlist;\n if (context.constraints.count(\"pid\") > 0 &&\n context.constraints.at(\"pid\").exists(EQUALS)) {\n for (const auto& pid : context.constraints.at(\"pid\").getAll<int>(EQUALS)) {\n if (pid > 0) {\n pidlist.insert(pid);\n }\n }\n }\n if (pidlist.empty()) {\n getProcList(pidlist);\n }\n\n for (const auto& pid : pidlist) {\n auto s = genMemoryMap(pid, results);\n if (!s.ok()) {\n VLOG(1) << s.getMessage();\n }\n }\n\n return results;\n}\n\n} \/\/ namespace tables\n} \/\/ namespace osquery\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/opencl\/syncclgl.h>\n#include <modules\/opencl\/openclexception.h>\n\nnamespace inviwo {\n\n#if defined(CL_VERSION_1_1)\nstd::map<cl_context, pfnclCreateEventFromSyncKHR> SyncCLGL::syncFunctionMap_;\n#endif\n\nSyncCLGL::SyncCLGL(const cl::Context& context, const cl::CommandQueue& queue)\n : context_(context)\n , queue_(queue)\n#if defined(CL_VERSION_1_1)\n , glFenceSync_(nullptr)\n#endif\n{\n#if defined(CL_VERSION_1_1)\n \/\/ Check if function clCreateEventFromGLsyncKHR has been fetched previously,\n \/\/ add it if it has not\n if (syncFunctionMap_.find(context()) == syncFunctionMap_.end()) {\n \/\/ Get clCreateEventFromGLsyncKHR function from platform since\n \/\/ it is a vendor extension and cannot be statically linked\n#if defined(CL_VERSION_1_2) \/\/ version >= 1.2\n \/\/ Function was renamed in version 1.2\n auto device = queue.getInfo<CL_QUEUE_DEVICE>();\n auto platform = device.getInfo<CL_DEVICE_PLATFORM>();\n syncFunctionMap_[context()] =\n (pfnclCreateEventFromSyncKHR)clGetExtensionFunctionAddressForPlatform(\n platform, \"clCreateEventFromGLsyncKHR\");\n#else \/\/ Version 1.1\n \/\/ Requirescl_khr_gl_sharing extension must be supported since we are using sharing\n syncFunctionMap_[context()] = (pfnclCreateEventFromSyncKHR)clGetExtensionFunctionAddress(\n \"clCreateEventFromGLsyncKHR\");\n#endif\n }\n pfnclCreateEventFromSyncKHR clCreateEventFromGLsync = syncFunctionMap_[context()];\n if (clCreateEventFromGLsync) {\n \/\/ Use more efficient synchronization\n \/\/ See section 9.9 in the OpenCL 1.1 spec for more information, also\n \/\/ https:\/\/www.cct.lsu.edu\/~korobkin\/tmp\/SC10\/tutorials\/docs\/M13\/M13.pdf\n\n \/\/ Get sync point from OpenGL to be used when acquiring objects\n \/\/ Note that glFenceSync is supported since it exit in OpenGl 3.2 and higher\n glFenceSync_ = glFenceSync(GL_SYNC_GPU_COMMANDS_COMPLETE, 0);\n } else {\n \/\/ clCreateEventFromGLsync not supported.\n \/\/ We need to use a slower synchronization\n glFinish();\n }\n#else\n glFinish();\n#endif\n}\n\nSyncCLGL::~SyncCLGL() {\n releaseAllGLObjects();\n#if defined(CL_VERSION_1_1)\n if (glFenceSync_) glDeleteSync(glFenceSync_);\n#endif\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const BufferCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const LayerCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const ImageCLGL* object) {\n addToAquireGLObjectList(object->getLayerCL());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const VolumeCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::aquireAllObjects(const std::vector<cl::Event>* waitForEvents \/*= nullptr*\/,\n cl::Event* event \/*= nullptr*\/) const {\n#if defined(CL_VERSION_1_1)\n \/\/ Use fast synchronization if we can\n if (glFenceSync_) {\n pfnclCreateEventFromSyncKHR clCreateEventFromGLsync = syncFunctionMap_[context_()];\n \/\/ Sync with OpenGL\n cl_int err;\n std::vector<cl::Event> waitForSyncAndEvents(\n 1, clCreateEventFromGLsync(context_(), glFenceSync_, &err));\n if (err != CL_SUCCESS) {\n throw OpenCLException(\"Failed to create sync event\");\n }\n if (waitForEvents) {\n \/\/ Add events to wait for\n waitForSyncAndEvents.reserve(waitForEvents->size() + 1);\n waitForSyncAndEvents.insert(std::end(waitForSyncAndEvents), std::begin(*waitForEvents),\n std::end(*waitForEvents));\n }\n queue_.enqueueAcquireGLObjects(&syncedObjects_, &waitForSyncAndEvents, event);\n } else {\n \/\/ Fast sync not supported, glFinish has been called in constructor instead\n queue_.enqueueAcquireGLObjects(&syncedObjects_, waitForEvents, event);\n }\n#else\n queue_.enqueueAcquireGLObjects(&syncedObjects_, waitForEvents, event);\n#endif\n}\n\nvoid SyncCLGL::releaseAllGLObjects(const std::vector<cl::Event>* waitForEvents, cl::Event* event) {\n if (!syncedObjects_.empty()) {\n#if defined(CL_VERSION_1_1)\n if (glFenceSync_) {\n cl::Event releaseEvent;\n \/\/ Use supplied event if existing\n cl::Event* releaseEventPtr = event != nullptr ? event : &releaseEvent;\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, releaseEventPtr);\n \/\/ Synchronize OpenCL and OpenGL\n GLsync clSync = glCreateSyncFromCLeventARB(context_(), (*releaseEventPtr)(), 0);\n \/\/ without stalling CPU-thread:\n glWaitSync(clSync, 0, GL_TIMEOUT_IGNORED);\n } else {\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, event);\n queue_.finish();\n }\n#else\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, event);\n queue_.finish();\n#endif\n syncedObjects_.clear();\n }\n}\n\n} \/\/ namespace inviwo\n<commit_msg>OpenCL: SyncCLGL comment adjustment<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/opencl\/syncclgl.h>\n#include <modules\/opencl\/openclexception.h>\n\nnamespace inviwo {\n\n#if defined(CL_VERSION_1_1)\nstd::map<cl_context, pfnclCreateEventFromSyncKHR> SyncCLGL::syncFunctionMap_;\n#endif\n\nSyncCLGL::SyncCLGL(const cl::Context& context, const cl::CommandQueue& queue)\n : context_(context)\n , queue_(queue)\n#if defined(CL_VERSION_1_1)\n , glFenceSync_(nullptr)\n#endif\n{\n#if defined(CL_VERSION_1_1)\n \/\/ Check if function clCreateEventFromGLsyncKHR has been fetched previously,\n \/\/ add it if it has not\n if (syncFunctionMap_.find(context()) == syncFunctionMap_.end()) {\n \/\/ Get clCreateEventFromGLsyncKHR function from platform since\n \/\/ it is a vendor extension and cannot be statically linked\n#if defined(CL_VERSION_1_2) \/\/ version >= 1.2\n \/\/ Function was renamed in version 1.2\n auto device = queue.getInfo<CL_QUEUE_DEVICE>();\n auto platform = device.getInfo<CL_DEVICE_PLATFORM>();\n syncFunctionMap_[context()] =\n (pfnclCreateEventFromSyncKHR)clGetExtensionFunctionAddressForPlatform(\n platform, \"clCreateEventFromGLsyncKHR\");\n#else \/\/ Version 1.1\n \/\/ Requires cl_khr_gl_sharing extension. Extension is supported since we are using sharing\n syncFunctionMap_[context()] = (pfnclCreateEventFromSyncKHR)clGetExtensionFunctionAddress(\n \"clCreateEventFromGLsyncKHR\");\n#endif\n }\n pfnclCreateEventFromSyncKHR clCreateEventFromGLsync = syncFunctionMap_[context()];\n if (clCreateEventFromGLsync) {\n \/\/ Use more efficient synchronization\n \/\/ See section 9.9 in the OpenCL 1.1 spec for more information, also\n \/\/ https:\/\/www.cct.lsu.edu\/~korobkin\/tmp\/SC10\/tutorials\/docs\/M13\/M13.pdf\n\n \/\/ Get sync point from OpenGL to be used when acquiring objects\n \/\/ Note that glFenceSync is supported since it exit in OpenGl 3.2 and higher\n glFenceSync_ = glFenceSync(GL_SYNC_GPU_COMMANDS_COMPLETE, 0);\n } else {\n \/\/ clCreateEventFromGLsync not supported.\n \/\/ We need to use a slower synchronization\n glFinish();\n }\n#else\n glFinish();\n#endif\n}\n\nSyncCLGL::~SyncCLGL() {\n releaseAllGLObjects();\n#if defined(CL_VERSION_1_1)\n if (glFenceSync_) glDeleteSync(glFenceSync_);\n#endif\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const BufferCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const LayerCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const ImageCLGL* object) {\n addToAquireGLObjectList(object->getLayerCL());\n}\n\nvoid SyncCLGL::addToAquireGLObjectList(const VolumeCLGL* object) {\n syncedObjects_.push_back(object->get());\n}\n\nvoid SyncCLGL::aquireAllObjects(const std::vector<cl::Event>* waitForEvents \/*= nullptr*\/,\n cl::Event* event \/*= nullptr*\/) const {\n#if defined(CL_VERSION_1_1)\n \/\/ Use fast synchronization if we can\n if (glFenceSync_) {\n pfnclCreateEventFromSyncKHR clCreateEventFromGLsync = syncFunctionMap_[context_()];\n \/\/ Sync with OpenGL\n cl_int err;\n std::vector<cl::Event> waitForSyncAndEvents(\n 1, clCreateEventFromGLsync(context_(), glFenceSync_, &err));\n if (err != CL_SUCCESS) {\n throw OpenCLException(\"Failed to create sync event\");\n }\n if (waitForEvents) {\n \/\/ Add events to wait for\n waitForSyncAndEvents.reserve(waitForEvents->size() + 1);\n waitForSyncAndEvents.insert(std::end(waitForSyncAndEvents), std::begin(*waitForEvents),\n std::end(*waitForEvents));\n }\n queue_.enqueueAcquireGLObjects(&syncedObjects_, &waitForSyncAndEvents, event);\n } else {\n \/\/ Fast sync not supported, glFinish has been called in constructor instead\n queue_.enqueueAcquireGLObjects(&syncedObjects_, waitForEvents, event);\n }\n#else\n queue_.enqueueAcquireGLObjects(&syncedObjects_, waitForEvents, event);\n#endif\n}\n\nvoid SyncCLGL::releaseAllGLObjects(const std::vector<cl::Event>* waitForEvents, cl::Event* event) {\n if (!syncedObjects_.empty()) {\n#if defined(CL_VERSION_1_1)\n if (glFenceSync_) {\n cl::Event releaseEvent;\n \/\/ Use supplied event if existing\n cl::Event* releaseEventPtr = event != nullptr ? event : &releaseEvent;\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, releaseEventPtr);\n \/\/ Synchronize OpenCL and OpenGL\n GLsync clSync = glCreateSyncFromCLeventARB(context_(), (*releaseEventPtr)(), 0);\n \/\/ without stalling CPU-thread:\n glWaitSync(clSync, 0, GL_TIMEOUT_IGNORED);\n } else {\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, event);\n queue_.finish();\n }\n#else\n queue_.enqueueReleaseGLObjects(&syncedObjects_, waitForEvents, event);\n queue_.finish();\n#endif\n syncedObjects_.clear();\n }\n}\n\n} \/\/ namespace inviwo\n<|endoftext|>"} {"text":"<commit_before>#include <cctype>\r\n#include <fstream>\r\n#include <stdio.h>\r\n#include \"utils\/logoutput.h\"\r\n\r\n#include \"settings.h\"\r\n\r\n#define STRINGIFY(_s) #_s\r\n#define SETTING(name, default) do { _index.push_back(_ConfigSettingIndex(STRINGIFY(name), &name)); name = (default); } while(0)\r\n#define SETTING2(name, altname, default) do { _index.push_back(_ConfigSettingIndex(STRINGIFY(name), &name)); _index.push_back(_ConfigSettingIndex(STRINGIFY(altname), &name)); name = (default); } while(0)\r\n\r\nConfigSettings::ConfigSettings()\r\n{\r\n SETTING(layerThickness, 100);\r\n SETTING(initialLayerThickness, 300);\r\n SETTING(filamentDiameter, 2890);\r\n SETTING(filamentFlow, 100);\r\n SETTING(extrusionWidth, 400);\r\n SETTING(insetCount, 2);\r\n SETTING(downSkinCount, 6);\r\n SETTING(upSkinCount, 6);\r\n SETTING(sparseInfillLineDistance, 100 * extrusionWidth \/ 20);\r\n SETTING(infillOverlap, 15);\r\n SETTING(skirtDistance, 6000);\r\n SETTING(skirtLineCount, 1);\r\n SETTING(skirtMinLength, 0);\r\n\r\n SETTING(initialSpeedupLayers, 4);\r\n SETTING(initialLayerSpeed, 20);\r\n SETTING(printSpeed, 50);\r\n SETTING(infillSpeed, 50);\r\n SETTING(inset0Speed, 50);\r\n SETTING(insetXSpeed, 50);\r\n SETTING(moveSpeed, 150);\r\n SETTING(fanFullOnLayerNr, 2);\r\n\r\n SETTING(supportAngle, -1);\r\n SETTING(supportEverywhere, 0);\r\n SETTING(supportLineDistance, sparseInfillLineDistance);\r\n SETTING(supportXYDistance, 700);\r\n SETTING(supportZDistance, 150);\r\n SETTING(supportExtruder, -1);\r\n\r\n SETTING(retractionAmount, 4500);\r\n SETTING(retractionSpeed, 45);\r\n SETTING(retractionAmountExtruderSwitch, 14500);\r\n SETTING(retractionMinimalDistance, 1500);\r\n SETTING(minimalExtrusionBeforeRetraction, 100);\r\n SETTING(retractionZHop, 0);\r\n\r\n SETTING(enableCombing, 1);\r\n SETTING(enableOozeShield, 0);\r\n SETTING(wipeTowerSize, 0);\r\n SETTING(multiVolumeOverlap, 0);\r\n SETTING2(objectPosition.X, posx, 102500);\r\n SETTING2(objectPosition.Y, posy, 102500);\r\n SETTING(objectSink, 0);\r\n\r\n SETTING(raftMargin, 5000);\r\n SETTING(raftLineSpacing, 1000);\r\n SETTING(raftBaseThickness, 0);\r\n SETTING(raftBaseLinewidth, 0);\r\n SETTING(raftInterfaceThickness, 0);\r\n SETTING(raftInterfaceLinewidth, 0);\r\n\r\n SETTING(minimalLayerTime, 5);\r\n SETTING(minimalFeedrate, 10);\r\n SETTING(coolHeadLift, 0);\r\n SETTING(fanSpeedMin, 100);\r\n SETTING(fanSpeedMax, 100);\r\n\r\n SETTING(fixHorrible, 0);\r\n SETTING(spiralizeMode, 0);\r\n SETTING(gcodeFlavor, GCODE_FLAVOR_REPRAP);\r\n\r\n SETTING(extruderOffset[1].X, 0);\r\n SETTING(extruderOffset[1].Y, 0);\r\n SETTING(extruderOffset[2].X, 0);\r\n SETTING(extruderOffset[2].Y, 0);\r\n SETTING(extruderOffset[3].X, 0);\r\n SETTING(extruderOffset[3].Y, 0);\r\n\r\n startCode =\r\n \"M109 S210 ;Heatup to 210C\\n\"\r\n \"G21 ;metric values\\n\"\r\n \"G90 ;absolute positioning\\n\"\r\n \"G28 ;Home\\n\"\r\n \"G1 Z15.0 F300 ;move the platform down 15mm\\n\"\r\n \"G92 E0 ;zero the extruded length\\n\"\r\n \"G1 F200 E5 ;extrude 5mm of feed stock\\n\"\r\n \"G92 E0 ;zero the extruded length again\\n\";\r\n endCode =\r\n \"M104 S0 ;extruder heater off\\n\"\r\n \"M140 S0 ;heated bed heater off (if you have it)\\n\"\r\n \"G91 ;relative positioning\\n\"\r\n \"G1 E-1 F300 ;retract the filament a bit before lifting the nozzle, to release some of the pressure\\n\"\r\n \"G1 Z+0.5 E-5 X-20 Y-20 F9000 ;move Z up a bit and retract filament even more\\n\"\r\n \"G28 X0 Y0 ;move X\/Y to min endstops, so the head is out of the way\\n\"\r\n \"M84 ;steppers off\\n\"\r\n \"G90 ;absolute positioning\\n\";\r\n}\r\n\r\n#undef STRINGIFY\r\n#undef SETTING\r\n\r\nbool ConfigSettings::setSetting(const char* key, const char* value)\r\n{\r\n for(unsigned int n=0; n < _index.size(); n++)\r\n {\r\n if (strcasecmp(key, _index[n].key) == 0)\r\n {\r\n *_index[n].ptr = atoi(value);\r\n return true;\r\n }\r\n }\r\n if (strcasecmp(key, \"startCode\") == 0)\r\n {\r\n this->startCode = value;\r\n return true;\r\n }\r\n if (strcasecmp(key, \"endCode\") == 0)\r\n {\r\n this->endCode = value;\r\n return true;\r\n }\r\n return false;\r\n}\r\n\r\nvoid _trim_string(std::string &s) {\r\n \/\/ ltrim\r\n while((s.length() > 0) && isspace(s[0])) {\r\n s.erase(0, 1);\r\n }\r\n \/\/ rtrim\r\n while((s.length() > 0) && isspace(s[s.length() - 1])) {\r\n s.erase(s.length() - 1);\r\n }\r\n}\r\n\r\nbool ConfigSettings::readSettings(const char* path) {\r\n std::ifstream config(path);\r\n std::string line;\r\n size_t line_number = 0;\r\n\r\n while(config.good()) {\r\n size_t pos = std::string::npos;\r\n std::getline(config, line);\r\n line_number += 1;\r\n\r\n \/\/ De-comment and trim, skipping anything that shows up empty\r\n pos = line.find_first_of('#');\r\n if(pos != std::string::npos) line.erase(pos);\r\n _trim_string(line);\r\n if(line.length() == 0) continue;\r\n\r\n \/\/ Split into key = val\r\n std::string key(\"\"), val(\"\");\r\n pos = line.find_first_of('=');\r\n if(pos != std::string::npos && line.length() > (pos + 1)) {\r\n key = line.substr(0, pos);\r\n val = line.substr(pos + 1);\r\n _trim_string(key);\r\n _trim_string(val);\r\n }\r\n\r\n \/\/ Fail if we don't get a key and val\r\n if(key.length() == 0 || val.length() == 0) {\r\n logError(\"Config(%s): Line %zd: No key value pair found\\n\", path, line_number);\r\n return false;\r\n }\r\n\r\n \/\/ Set a config setting for the current K=V\r\n if(!setSetting(key.c_str(), val.c_str())) {\r\n logError(\"Config(%s):L%zd: Failed to set '%s' to '%s'\\n\", path, line_number, key.c_str(), val.c_str());\r\n }\r\n }\r\n\r\n return true;\r\n}\r\n<commit_msg>_trim_string() is now TRIM_STRING() the macro<commit_after>#include <cctype>\r\n#include <fstream>\r\n#include <stdio.h>\r\n#include \"utils\/logoutput.h\"\r\n\r\n#include \"settings.h\"\r\n\r\n#define TRIM_STRING(s) do { while(((s).length() > 0) && isspace((s)[0])) { (s).erase(0, 1); } while(((s).length() > 0) && isspace((s)[(s).length() - 1])) { (s).erase((s).length() - 1); } } while(0)\r\n#define STRINGIFY(_s) #_s\r\n#define SETTING(name, default) do { _index.push_back(_ConfigSettingIndex(STRINGIFY(name), &name)); name = (default); } while(0)\r\n#define SETTING2(name, altname, default) do { _index.push_back(_ConfigSettingIndex(STRINGIFY(name), &name)); _index.push_back(_ConfigSettingIndex(STRINGIFY(altname), &name)); name = (default); } while(0)\r\n\r\nConfigSettings::ConfigSettings()\r\n{\r\n SETTING(layerThickness, 100);\r\n SETTING(initialLayerThickness, 300);\r\n SETTING(filamentDiameter, 2890);\r\n SETTING(filamentFlow, 100);\r\n SETTING(extrusionWidth, 400);\r\n SETTING(insetCount, 2);\r\n SETTING(downSkinCount, 6);\r\n SETTING(upSkinCount, 6);\r\n SETTING(sparseInfillLineDistance, 100 * extrusionWidth \/ 20);\r\n SETTING(infillOverlap, 15);\r\n SETTING(skirtDistance, 6000);\r\n SETTING(skirtLineCount, 1);\r\n SETTING(skirtMinLength, 0);\r\n\r\n SETTING(initialSpeedupLayers, 4);\r\n SETTING(initialLayerSpeed, 20);\r\n SETTING(printSpeed, 50);\r\n SETTING(infillSpeed, 50);\r\n SETTING(inset0Speed, 50);\r\n SETTING(insetXSpeed, 50);\r\n SETTING(moveSpeed, 150);\r\n SETTING(fanFullOnLayerNr, 2);\r\n\r\n SETTING(supportAngle, -1);\r\n SETTING(supportEverywhere, 0);\r\n SETTING(supportLineDistance, sparseInfillLineDistance);\r\n SETTING(supportXYDistance, 700);\r\n SETTING(supportZDistance, 150);\r\n SETTING(supportExtruder, -1);\r\n\r\n SETTING(retractionAmount, 4500);\r\n SETTING(retractionSpeed, 45);\r\n SETTING(retractionAmountExtruderSwitch, 14500);\r\n SETTING(retractionMinimalDistance, 1500);\r\n SETTING(minimalExtrusionBeforeRetraction, 100);\r\n SETTING(retractionZHop, 0);\r\n\r\n SETTING(enableCombing, 1);\r\n SETTING(enableOozeShield, 0);\r\n SETTING(wipeTowerSize, 0);\r\n SETTING(multiVolumeOverlap, 0);\r\n SETTING2(objectPosition.X, posx, 102500);\r\n SETTING2(objectPosition.Y, posy, 102500);\r\n SETTING(objectSink, 0);\r\n\r\n SETTING(raftMargin, 5000);\r\n SETTING(raftLineSpacing, 1000);\r\n SETTING(raftBaseThickness, 0);\r\n SETTING(raftBaseLinewidth, 0);\r\n SETTING(raftInterfaceThickness, 0);\r\n SETTING(raftInterfaceLinewidth, 0);\r\n\r\n SETTING(minimalLayerTime, 5);\r\n SETTING(minimalFeedrate, 10);\r\n SETTING(coolHeadLift, 0);\r\n SETTING(fanSpeedMin, 100);\r\n SETTING(fanSpeedMax, 100);\r\n\r\n SETTING(fixHorrible, 0);\r\n SETTING(spiralizeMode, 0);\r\n SETTING(gcodeFlavor, GCODE_FLAVOR_REPRAP);\r\n\r\n SETTING(extruderOffset[1].X, 0);\r\n SETTING(extruderOffset[1].Y, 0);\r\n SETTING(extruderOffset[2].X, 0);\r\n SETTING(extruderOffset[2].Y, 0);\r\n SETTING(extruderOffset[3].X, 0);\r\n SETTING(extruderOffset[3].Y, 0);\r\n\r\n startCode =\r\n \"M109 S210 ;Heatup to 210C\\n\"\r\n \"G21 ;metric values\\n\"\r\n \"G90 ;absolute positioning\\n\"\r\n \"G28 ;Home\\n\"\r\n \"G1 Z15.0 F300 ;move the platform down 15mm\\n\"\r\n \"G92 E0 ;zero the extruded length\\n\"\r\n \"G1 F200 E5 ;extrude 5mm of feed stock\\n\"\r\n \"G92 E0 ;zero the extruded length again\\n\";\r\n endCode =\r\n \"M104 S0 ;extruder heater off\\n\"\r\n \"M140 S0 ;heated bed heater off (if you have it)\\n\"\r\n \"G91 ;relative positioning\\n\"\r\n \"G1 E-1 F300 ;retract the filament a bit before lifting the nozzle, to release some of the pressure\\n\"\r\n \"G1 Z+0.5 E-5 X-20 Y-20 F9000 ;move Z up a bit and retract filament even more\\n\"\r\n \"G28 X0 Y0 ;move X\/Y to min endstops, so the head is out of the way\\n\"\r\n \"M84 ;steppers off\\n\"\r\n \"G90 ;absolute positioning\\n\";\r\n}\r\n\r\n#undef STRINGIFY\r\n#undef SETTING\r\n\r\nbool ConfigSettings::setSetting(const char* key, const char* value)\r\n{\r\n for(unsigned int n=0; n < _index.size(); n++)\r\n {\r\n if (strcasecmp(key, _index[n].key) == 0)\r\n {\r\n *_index[n].ptr = atoi(value);\r\n return true;\r\n }\r\n }\r\n if (strcasecmp(key, \"startCode\") == 0)\r\n {\r\n this->startCode = value;\r\n return true;\r\n }\r\n if (strcasecmp(key, \"endCode\") == 0)\r\n {\r\n this->endCode = value;\r\n return true;\r\n }\r\n return false;\r\n}\r\n\r\nbool ConfigSettings::readSettings(const char* path) {\r\n std::ifstream config(path);\r\n std::string line;\r\n size_t line_number = 0;\r\n\r\n while(config.good()) {\r\n size_t pos = std::string::npos;\r\n std::getline(config, line);\r\n line_number += 1;\r\n\r\n \/\/ De-comment and trim, skipping anything that shows up empty\r\n pos = line.find_first_of('#');\r\n if(pos != std::string::npos) line.erase(pos);\r\n TRIM_STRING(line);\r\n if(line.length() == 0) continue;\r\n\r\n \/\/ Split into key = val\r\n std::string key(\"\"), val(\"\");\r\n pos = line.find_first_of('=');\r\n if(pos != std::string::npos && line.length() > (pos + 1)) {\r\n key = line.substr(0, pos);\r\n val = line.substr(pos + 1);\r\n TRIM_STRING(key);\r\n TRIM_STRING(val);\r\n }\r\n\r\n \/\/ Fail if we don't get a key and val\r\n if(key.length() == 0 || val.length() == 0) {\r\n logError(\"Config(%s): Line %zd: No key value pair found\\n\", path, line_number);\r\n return false;\r\n }\r\n\r\n \/\/ Set a config setting for the current K=V\r\n if(!setSetting(key.c_str(), val.c_str())) {\r\n logError(\"Config(%s):L%zd: Failed to set '%s' to '%s'\\n\", path, line_number, key.c_str(), val.c_str());\r\n }\r\n }\r\n\r\n return true;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: ManifestDefines.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: mtg $ $Date: 2001-10-02 22:29:42 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _MANIFEST_DEFINES_HXX\n#define _MANIFEST_DEFINES_HXX\n\n#define ELEMENT_MANIFEST \"manifest:manifest\"\n#define ATTRIBUTE_XMLNS \"xmlns:manifest\"\n#define MANIFEST_NAMESPACE \"http:\/\/openoffice.org\/2001\/manifest\"\n#define MANIFEST_DOCTYPE \"<!DOCTYPE manifest:manifest PUBLIC \\\"-\/\/OpenOffice.org\/\/DTD Manifest 1.0\/\/EN\\\" \\\"Manifest.dtd\\\">\"\n#define ATTRIBUTE_CDATA \"CDATA\"\n\n#define ELEMENT_FILE_ENTRY \"manifest:file-entry\"\n#define ATTRIBUTE_FULL_PATH \"manifest:full-path\"\n#define ATTRIBUTE_MEDIA_TYPE \"manifest:media-type\"\n#define ATTRIBUTE_SIZE \"manifest:size\"\n\n#define ELEMENT_ENCRYPTION_DATA \"manifest:encryption-data\"\n#define ATTRIBUTE_CHECKSUM_TYPE \"manifest:checksum-type\"\n#define ATTRIBUTE_CHECKSUM \"manifest:checksum\"\n\n#define ELEMENT_ALGORITHM \"manifest:algorithm\"\n#define ATTRIBUTE_ALGORITHM_NAME \"manifest:algorithm-name\"\n#define ATTRIBUTE_INITIALISATION_VECTOR \"manifest:initialisation-vector\"\n\n#define ELEMENT_KEY_DERIVATION \"manifest:key-derivation\"\n#define ATTRIBUTE_KEY_DERIVATION_NAME \"manifest:key-derivation-name\"\n#define ATTRIBUTE_SALT \"manifest:salt\"\n#define ATTRIBUTE_ITERATION_COUNT \"manifest:iteration-count\"\n#define CHECKSUM_TYPE \"SHA1\/1K\"\n\n#endif\n<commit_msg>INTEGRATION: CWS oasisbf4 (1.5.186); FILE MERGED 2005\/01\/11 12:22:00 mav 1.5.186.1: #i38186# provide correct namespace information<commit_after>\/*************************************************************************\n *\n * $RCSfile: ManifestDefines.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-01-27 11:17:26 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Martin Gallwey (gallwey@sun.com)\n *\n *\n ************************************************************************\/\n#ifndef _MANIFEST_DEFINES_HXX\n#define _MANIFEST_DEFINES_HXX\n\n#define ELEMENT_MANIFEST \"manifest:manifest\"\n#define ATTRIBUTE_XMLNS \"xmlns:manifest\"\n#define MANIFEST_NAMESPACE \"http:\/\/openoffice.org\/2001\/manifest\"\n#define MANIFEST_OASIS_NAMESPACE \"urn:oasis:names:tc:opendocument:xmlns:manifest:1.0\"\n#define MANIFEST_DOCTYPE \"<!DOCTYPE manifest:manifest PUBLIC \\\"-\/\/OpenOffice.org\/\/DTD Manifest 1.0\/\/EN\\\" \\\"Manifest.dtd\\\">\"\n#define ATTRIBUTE_CDATA \"CDATA\"\n\n#define ELEMENT_FILE_ENTRY \"manifest:file-entry\"\n#define ATTRIBUTE_FULL_PATH \"manifest:full-path\"\n#define ATTRIBUTE_MEDIA_TYPE \"manifest:media-type\"\n#define ATTRIBUTE_SIZE \"manifest:size\"\n\n#define ELEMENT_ENCRYPTION_DATA \"manifest:encryption-data\"\n#define ATTRIBUTE_CHECKSUM_TYPE \"manifest:checksum-type\"\n#define ATTRIBUTE_CHECKSUM \"manifest:checksum\"\n\n#define ELEMENT_ALGORITHM \"manifest:algorithm\"\n#define ATTRIBUTE_ALGORITHM_NAME \"manifest:algorithm-name\"\n#define ATTRIBUTE_INITIALISATION_VECTOR \"manifest:initialisation-vector\"\n\n#define ELEMENT_KEY_DERIVATION \"manifest:key-derivation\"\n#define ATTRIBUTE_KEY_DERIVATION_NAME \"manifest:key-derivation-name\"\n#define ATTRIBUTE_SALT \"manifest:salt\"\n#define ATTRIBUTE_ITERATION_COUNT \"manifest:iteration-count\"\n#define CHECKSUM_TYPE \"SHA1\/1K\"\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Appcelerator Titanium - licensed under the Apache Public License 2\n * see LICENSE in the root folder for details on the license.\n * Copyright (c) 2009 Appcelerator, Inc. All Rights Reserved.\n *\/\n\n#include \"pipe.h\"\n#include \"native_pipe.h\"\n#include <vector>\n#include <cstring>\n\n#if defined(OS_WIN32)\n# include \"win32\/win32_pipe.h\"\n#else\n# include \"posix\/posix_pipe.h\"\n#endif\n\nnamespace ti\n{\n\tPipe::Pipe(const char *type) :\n\t\tKEventObject(type),\n\t\tactive(true),\n\t\teventsThreadAdapter(0)\n\t{\n\t\t\/\/TODO doc me\n\t\tSetMethod(\"close\", &Pipe::_Close);\n\t\tSetMethod(\"write\", &Pipe::_Write);\n\t\tSetMethod(\"flush\", &Pipe::_Flush);\n\t\tSetMethod(\"attach\", &Pipe::_Attach);\n\t\tSetMethod(\"detach\", &Pipe::_Detach);\n\t\tSetMethod(\"isAttached\", &Pipe::_IsAttached);\n\n\t\tthis->eventsThreadAdapter =\n\t\t\tnew Poco::RunnableAdapter<Pipe>(*this, &Pipe::FireEvents);\n\t\tthis->eventsThread.start(*this->eventsThreadAdapter);\n\t}\n\n\tPipe::~Pipe()\n\t{\n\t\tactive = false;\n\t\teventsThread.join();\n\t\tdelete eventsThreadAdapter;\n\t}\n\n\tvoid Pipe::Attach(SharedKObject object)\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\tattachedObjects.push_back(object);\n\t}\n\n\tvoid Pipe::Detach(SharedKObject object)\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\tstd::vector<SharedKObject>::iterator i = attachedObjects.begin();\n\t\twhile (i != attachedObjects.end())\n\t\t{\n\t\t\tSharedKObject obj = *i;\n\t\t\tif (obj->Equals(object))\n\t\t\t{\n\t\t\t\ti = attachedObjects.erase(i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool Pipe::IsAttached()\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\treturn attachedObjects.size() > 0;\n\t}\n\n\tint Pipe::FindFirstLineFeed(char *data, int length, int *charsToErase)\n\t{\n\t\tint newline = -1;\n\t\tfor (int i = 0; i < length; i++)\n\t\t{\n\t\t\tif (data[i] == '\\n')\n\t\t\t{\n\t\t\t\tnewline = i;\n\t\t\t\t*charsToErase = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (data[i] == '\\r')\n\t\t\t{\n\t\t\t\tif (i < length-1 && data[i+1] == '\\n')\n\t\t\t\t{\n\t\t\t\t\tnewline = i+1;\n\t\t\t\t\t*charsToErase = 2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn newline;\n\t}\n\n\tAutoPipe Pipe::Clone()\n\t{\n\t\tAutoPipe pipe = new Pipe();\n\t\treturn pipe;\n\t}\n\n\tvoid Pipe::_Attach(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"attach\", \"o\");\n\t\tthis->Attach(args.at(0)->ToObject());\n\t}\n\t\n\tvoid Pipe::_Detach(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"detach\", \"o\");\n\t\tthis->Detach(args.at(0)->ToObject());\n\t}\n\n\tvoid Pipe::_IsAttached(const ValueList& args, SharedValue result)\n\t{\n\t\tresult->SetBool(this->IsAttached());\n\t}\n\n\tvoid Pipe::_Write(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"write\", \"o|s\");\n\t\t\n\t\tAutoBlob blob = new Blob();\n\t\tif (args.at(0)->IsObject())\n\t\t{\n\t\t\tblob = args.at(0)->ToObject().cast<Blob>();\n\t\t}\n\t\telse if (args.at(0)->IsString())\n\t\t{\n\t\t\tblob = new Blob(args.at(0)->ToString());\n\t\t}\n\t\t\n\t\tif (blob.isNull())\n\t\t{\n\t\t\tthrow ValueException::FromString(\"Pipe.write argument should be a Blob or string\");\n\t\t}\n\n\t\tint written = this->Write(blob);\n\t\tresult->SetInt(written);\n\t}\n\n\tvoid Pipe::_Flush(const ValueList& args, SharedValue result)\n\t{\n\t\tthis->Flush();\n\t}\n\n\tvoid Pipe::_Close(const ValueList& args, SharedValue result)\n\t{\n\t\tthis->Close();\n\t}\n\n\tint Pipe::Write(AutoBlob blob)\n\t{\n\t\t{ \/\/ Start the callbacks\n\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\tbuffers.push(blob);\n\t\t}\n\n\t\t\/\/ We want this to execute on the same thread and to make all\n\t\t\/\/ our writeable objects thread safe. This will allow data to\n\t\t\/\/ flow through pipes more quickly.\n\t\t{\n\t\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\t\tfor (size_t i = 0; i < attachedObjects.size(); i++)\n\t\t\t{\n\t\t\t\tthis->CallWrite(attachedObjects.at(i), blob);\n\t\t\t}\n\t\t}\n\n\t\treturn blob->Length();\n\t}\n\n\tvoid Pipe::CallWrite(SharedKObject target, AutoBlob blob)\n\t{\n\t\tSharedKMethod writeMethod = target->GetMethod(\"write\");\n\n\t\tif (writeMethod.isNull())\n\t\t{\n\t\t\tlogger->Error(\"Target object did not have a write method\");\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\twriteMethod->Call(ValueList(Value::NewObject(blob)));\n\t\t\t}\n\t\t\tcatch (ValueException &e)\n\t\t\t{\n\t\t\t\tSharedString ss = e.DisplayString();\n\t\t\t\tlogger->Error(\"Exception while trying to write to target: %s\",\n\t\t\t\t\tss->c_str());\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::Close()\n\t{\n\t\t{ \/\/ A Null Blob on the qeueue signals a close event\n\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\tbuffers.push(0);\n\t\t}\n\n\t\t\/\/ Call the close method on our attached objects\n\t\t{\n\t\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\t\tfor (size_t i = 0; i < attachedObjects.size(); i++)\n\t\t\t{\n\t\t\t\tthis->CallClose(attachedObjects.at(i));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::CallClose(SharedKObject target)\n\t{\n\t\tSharedKMethod closeMethod = target->GetMethod(\"close\");\n\n\t\tif (closeMethod.isNull())\n\t\t{\n\t\t\tlogger->Warn(\"Target object did not have a write method\");\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tcloseMethod->Call(ValueList());\n\t\t\t}\n\t\t\tcatch (ValueException &e)\n\t\t\t{\n\t\t\t\tSharedString ss = e.DisplayString();\n\t\t\t\tlogger->Error(\"Exception while trying to write to target: %s\",\n\t\t\t\t\tss->c_str());\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::Flush()\n\t{\n\t}\n\n\tvoid Pipe::FireReadBuffers()\n\t{\n\t\tAutoBlob blob = 0;\n\t\tfor (size_t i = 0; i < buffers.size(); i++)\n\t\t{\n\t\t\t{\n\t\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\t\tblob = buffers.front();\n\t\t\t\tbuffers.pop();\n\t\t\t}\n\n\t\t\tif (!blob.isNull())\n\t\t\t{\n\t\t\t\tthis->duplicate();\n\t\t\t\tAutoPtr<KEventObject> autothis = this;\n\t\t\t\tAutoPtr<Event> event = new ReadEvent(autothis, blob);\n\t\t\t\tthis->FireEvent(event);\n\t\t\t\tblob = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ A null blob signifies a close event\n\t\t\t\tthis->FireEvent(Event::CLOSE);\n\t\t\t\tthis->FireEvent(Event::CLOSED);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid Pipe::FireEvents()\n\t{\n\t\twhile (active || buffers.size() > 0)\n\t\t{\n\t\t\tFireReadBuffers();\n\t\t\tPoco::Thread::sleep(50);\n\t\t}\n\t}\n}\n<commit_msg>Protect the FireEvents buffer a little more thoroughly.<commit_after>\/**\n * Appcelerator Titanium - licensed under the Apache Public License 2\n * see LICENSE in the root folder for details on the license.\n * Copyright (c) 2009 Appcelerator, Inc. All Rights Reserved.\n *\/\n\n#include \"pipe.h\"\n#include \"native_pipe.h\"\n#include <vector>\n#include <cstring>\n\n#if defined(OS_WIN32)\n# include \"win32\/win32_pipe.h\"\n#else\n# include \"posix\/posix_pipe.h\"\n#endif\n\nnamespace ti\n{\n\tPipe::Pipe(const char *type) :\n\t\tKEventObject(type),\n\t\tactive(true),\n\t\teventsThreadAdapter(0)\n\t{\n\t\t\/\/TODO doc me\n\t\tSetMethod(\"close\", &Pipe::_Close);\n\t\tSetMethod(\"write\", &Pipe::_Write);\n\t\tSetMethod(\"flush\", &Pipe::_Flush);\n\t\tSetMethod(\"attach\", &Pipe::_Attach);\n\t\tSetMethod(\"detach\", &Pipe::_Detach);\n\t\tSetMethod(\"isAttached\", &Pipe::_IsAttached);\n\n\t\tthis->eventsThreadAdapter =\n\t\t\tnew Poco::RunnableAdapter<Pipe>(*this, &Pipe::FireEvents);\n\t\tthis->eventsThread.start(*this->eventsThreadAdapter);\n\t}\n\n\tPipe::~Pipe()\n\t{\n\t\tactive = false;\n\t\teventsThread.join();\n\t\tdelete eventsThreadAdapter;\n\t}\n\n\tvoid Pipe::Attach(SharedKObject object)\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\tattachedObjects.push_back(object);\n\t}\n\n\tvoid Pipe::Detach(SharedKObject object)\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\tstd::vector<SharedKObject>::iterator i = attachedObjects.begin();\n\t\twhile (i != attachedObjects.end())\n\t\t{\n\t\t\tSharedKObject obj = *i;\n\t\t\tif (obj->Equals(object))\n\t\t\t{\n\t\t\t\ti = attachedObjects.erase(i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool Pipe::IsAttached()\n\t{\n\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\treturn attachedObjects.size() > 0;\n\t}\n\n\tint Pipe::FindFirstLineFeed(char *data, int length, int *charsToErase)\n\t{\n\t\tint newline = -1;\n\t\tfor (int i = 0; i < length; i++)\n\t\t{\n\t\t\tif (data[i] == '\\n')\n\t\t\t{\n\t\t\t\tnewline = i;\n\t\t\t\t*charsToErase = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (data[i] == '\\r')\n\t\t\t{\n\t\t\t\tif (i < length-1 && data[i+1] == '\\n')\n\t\t\t\t{\n\t\t\t\t\tnewline = i+1;\n\t\t\t\t\t*charsToErase = 2;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn newline;\n\t}\n\n\tAutoPipe Pipe::Clone()\n\t{\n\t\tAutoPipe pipe = new Pipe();\n\t\treturn pipe;\n\t}\n\n\tvoid Pipe::_Attach(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"attach\", \"o\");\n\t\tthis->Attach(args.at(0)->ToObject());\n\t}\n\t\n\tvoid Pipe::_Detach(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"detach\", \"o\");\n\t\tthis->Detach(args.at(0)->ToObject());\n\t}\n\n\tvoid Pipe::_IsAttached(const ValueList& args, SharedValue result)\n\t{\n\t\tresult->SetBool(this->IsAttached());\n\t}\n\n\tvoid Pipe::_Write(const ValueList& args, SharedValue result)\n\t{\n\t\targs.VerifyException(\"write\", \"o|s\");\n\t\t\n\t\tAutoBlob blob = new Blob();\n\t\tif (args.at(0)->IsObject())\n\t\t{\n\t\t\tblob = args.at(0)->ToObject().cast<Blob>();\n\t\t}\n\t\telse if (args.at(0)->IsString())\n\t\t{\n\t\t\tblob = new Blob(args.at(0)->ToString());\n\t\t}\n\t\t\n\t\tif (blob.isNull())\n\t\t{\n\t\t\tthrow ValueException::FromString(\"Pipe.write argument should be a Blob or string\");\n\t\t}\n\n\t\tint written = this->Write(blob);\n\t\tresult->SetInt(written);\n\t}\n\n\tvoid Pipe::_Flush(const ValueList& args, SharedValue result)\n\t{\n\t\tthis->Flush();\n\t}\n\n\tvoid Pipe::_Close(const ValueList& args, SharedValue result)\n\t{\n\t\tthis->Close();\n\t}\n\n\tint Pipe::Write(AutoBlob blob)\n\t{\n\t\t{ \/\/ Start the callbacks\n\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\tbuffers.push(blob);\n\t\t}\n\n\t\t\/\/ We want this to execute on the same thread and to make all\n\t\t\/\/ our writeable objects thread safe. This will allow data to\n\t\t\/\/ flow through pipes more quickly.\n\t\t{\n\t\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\t\tfor (size_t i = 0; i < attachedObjects.size(); i++)\n\t\t\t{\n\t\t\t\tthis->CallWrite(attachedObjects.at(i), blob);\n\t\t\t}\n\t\t}\n\n\t\treturn blob->Length();\n\t}\n\n\tvoid Pipe::CallWrite(SharedKObject target, AutoBlob blob)\n\t{\n\t\tSharedKMethod writeMethod = target->GetMethod(\"write\");\n\n\t\tif (writeMethod.isNull())\n\t\t{\n\t\t\tlogger->Error(\"Target object did not have a write method\");\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\twriteMethod->Call(ValueList(Value::NewObject(blob)));\n\t\t\t}\n\t\t\tcatch (ValueException &e)\n\t\t\t{\n\t\t\t\tSharedString ss = e.DisplayString();\n\t\t\t\tlogger->Error(\"Exception while trying to write to target: %s\",\n\t\t\t\t\tss->c_str());\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::Close()\n\t{\n\t\t{ \/\/ A Null Blob on the qeueue signals a close event\n\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\tbuffers.push(0);\n\t\t}\n\n\t\t\/\/ Call the close method on our attached objects\n\t\t{\n\t\t\tPoco::Mutex::ScopedLock lock(attachedMutex);\n\t\t\tfor (size_t i = 0; i < attachedObjects.size(); i++)\n\t\t\t{\n\t\t\t\tthis->CallClose(attachedObjects.at(i));\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::CallClose(SharedKObject target)\n\t{\n\t\tSharedKMethod closeMethod = target->GetMethod(\"close\");\n\n\t\tif (closeMethod.isNull())\n\t\t{\n\t\t\tlogger->Warn(\"Target object did not have a write method\");\n\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tcloseMethod->Call(ValueList());\n\t\t\t}\n\t\t\tcatch (ValueException &e)\n\t\t\t{\n\t\t\t\tSharedString ss = e.DisplayString();\n\t\t\t\tlogger->Error(\"Exception while trying to write to target: %s\",\n\t\t\t\t\tss->c_str());\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Pipe::Flush()\n\t{\n\t}\n\n\tvoid Pipe::FireReadBuffers()\n\t{\n\t\tAutoBlob blob = 0;\n\t\tint size = 0;\n\t\t{\n\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\tsize = buffers.size();\n\t\t}\n\t\twhile (size > 0)\n\t\t{\n\t\t\t{\n\t\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\t\tblob = buffers.front();\n\t\t\t\tbuffers.pop();\n\t\t\t}\n\n\t\t\tif (!blob.isNull())\n\t\t\t{\n\t\t\t\tthis->duplicate();\n\t\t\t\tAutoPtr<KEventObject> autothis = this;\n\t\t\t\tAutoPtr<Event> event = new ReadEvent(autothis, blob);\n\t\t\t\tthis->FireEvent(event);\n\t\t\t\tblob = 0;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/ A null blob signifies a close event\n\t\t\t\tthis->FireEvent(Event::CLOSE);\n\t\t\t\tthis->FireEvent(Event::CLOSED);\n\t\t\t}\n\n\t\t\t{\n\t\t\t\tPoco::Mutex::ScopedLock lock(buffersMutex);\n\t\t\t\tsize = buffers.size();\n\t\t\t}\n\t\t}\n\n\t}\n\t\n\tvoid Pipe::FireEvents()\n\t{\n\t\twhile (active || buffers.size() > 0)\n\t\t{\n\t\t\tFireReadBuffers();\n\t\t\tPoco::Thread::sleep(50);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"cmbNucPartsTreeItem.h\"\n#include \"cmbNucAssembly.h\"\n#include \"cmbNucCore.h\"\n#include <QFileInfo>\n#include <QFont>\n#include <QBrush>\n#include <QStyle>\n#include <QIcon>\n\n\/\/-----------------------------------------------------------------------------\ncmbNucPartsTreeItem::cmbNucPartsTreeItem(\n QTreeWidgetItem* pNode, AssyPartObj* obj)\n: FileChanged(false), NeedGeneration(false),\n QTreeWidgetItem(pNode), PartObject(obj)\n{\n this->connection = new cmbNucPartsTreeItemConnection();\n this->connection->v = this;\n std::string fname = this->PartObject->getFileName();\n if(fname.empty())\n {\n this->setText(3, \"\");\n }\n else\n {\n QFileInfo fi(fname.c_str());\n this->setText(3, fi.fileName());\n }\n}\n\n\/\/-----------------------------------------------------------------------------\ncmbNucPartsTreeItem::~cmbNucPartsTreeItem()\n{\n delete this->connection;\n}\n\/\/-----------------------------------------------------------------------------\nvoid cmbNucPartsTreeItem::setText ( int column, const QString & text )\n{\n this->QTreeWidgetItem::setText(column, text);\n if(column == 0)\n {\n this->PreviousText = text;\n }\n}\n\/\/-----------------------------------------------------------------------------\nvoid cmbNucPartsTreeItem::setData (\n int column, int role, const QVariant & value )\n{\n if(column == 0 && role == Qt::EditRole) \/\/ keep the original text\n {\n this->PreviousText = this->text(column);\n }\n this->QTreeWidgetItem::setData(column, role, value);\n}\n\nvoid cmbNucPartsTreeItemConnection::checkSaveAndGenerate()\n{\n v->checkSaveAndGenerate();\n}\n\nvoid cmbNucPartsTreeItem::checkSaveAndGenerate()\n{\n enumNucPartsType selType = PartObject->GetType();\n bool need_to_save = false;\n bool need_to_generate = false;\n switch(selType)\n {\n case CMBNUC_CORE:\n {\n cmbNucCore * core = dynamic_cast<cmbNucCore*>(PartObject);\n need_to_save = core->changeSinceLastSave();\n need_to_generate = core->changeSinceLastGenerate();\n }\n break;\n case CMBNUC_ASSEMBLY:\n {\n cmbNucAssembly * assy = dynamic_cast<cmbNucAssembly*>(PartObject);\n need_to_save = assy->changeSinceLastSave();\n need_to_generate = assy->changeSinceLastGenerate();\n }\n break;\n default:\n return;\n }\n this->setHightlights(need_to_save, need_to_generate);\n}\n\nbool cmbNucPartsTreeItem::fileChanged() const\n{\n return FileChanged;\n}\n\nbool cmbNucPartsTreeItem::needGeneration() const\n{\n return NeedGeneration;\n}\n\nvoid cmbNucPartsTreeItem::setHightlights(bool fc, bool ng)\n{\n FileChanged = fc;\n NeedGeneration = ng;\n if( FileChanged )\n {\n this->setText( 1, QChar(9999) );\n }\n else\n {\n QBrush b (Qt::green);\n setBackground( 1 , b );\n setForeground( 1 , b );\n this->setText( 1, \" \" );\n }\n\n std::string fname = this->PartObject->getFileName();\n if(fname.empty())\n {\n this->setText(3, \"\");\n }\n else\n {\n QFileInfo fi(fname.c_str());\n this->setText(3, fi.fileName());\n }\n\n if(NeedGeneration)\n {\n QBrush b;\n setForeground( 2 , b );\n this->setText( 2, QChar(9746) );\n }\n else\n {\n QBrush b (Qt::green);\n setBackground( 2 , b );\n setForeground( 2 , b );\n this->setText( 2, \" \" );\n }\n}\n\nQVariant cmbNucPartsTreeItem::data( int index, int role ) const\n{\n if(role == Qt::ToolTipRole && index == 3)\n {\n std::string fname = this->PartObject->getFileName();\n if(!fname.empty())\n {\n return QVariant(fname.c_str());\n }\n }\n if(role == Qt::ToolTipRole && index == 1)\n {\n if(FileChanged)\n {\n return QVariant(\"Needs to be saved\");\n }\n else\n {\n return QVariant(\"Saved\");\n }\n }\n if(role == Qt::ToolTipRole && index == 2)\n {\n if(NeedGeneration)\n {\n return QVariant(\"MeshKit needs to be run\");\n }\n else\n {\n return QVariant(\"MeshKit files up to date\");\n }\n }\n return this->QTreeWidgetItem::data(index, role);\n}\n<commit_msg>fixed missing clear of color<commit_after>\n#include \"cmbNucPartsTreeItem.h\"\n#include \"cmbNucAssembly.h\"\n#include \"cmbNucCore.h\"\n#include <QFileInfo>\n#include <QFont>\n#include <QBrush>\n#include <QStyle>\n#include <QIcon>\n\n\/\/-----------------------------------------------------------------------------\ncmbNucPartsTreeItem::cmbNucPartsTreeItem(\n QTreeWidgetItem* pNode, AssyPartObj* obj)\n: FileChanged(false), NeedGeneration(false),\n QTreeWidgetItem(pNode), PartObject(obj)\n{\n this->connection = new cmbNucPartsTreeItemConnection();\n this->connection->v = this;\n std::string fname = this->PartObject->getFileName();\n if(fname.empty())\n {\n this->setText(3, \"\");\n }\n else\n {\n QFileInfo fi(fname.c_str());\n this->setText(3, fi.fileName());\n }\n}\n\n\/\/-----------------------------------------------------------------------------\ncmbNucPartsTreeItem::~cmbNucPartsTreeItem()\n{\n delete this->connection;\n}\n\/\/-----------------------------------------------------------------------------\nvoid cmbNucPartsTreeItem::setText ( int column, const QString & text )\n{\n this->QTreeWidgetItem::setText(column, text);\n if(column == 0)\n {\n this->PreviousText = text;\n }\n}\n\/\/-----------------------------------------------------------------------------\nvoid cmbNucPartsTreeItem::setData (\n int column, int role, const QVariant & value )\n{\n if(column == 0 && role == Qt::EditRole) \/\/ keep the original text\n {\n this->PreviousText = this->text(column);\n }\n this->QTreeWidgetItem::setData(column, role, value);\n}\n\nvoid cmbNucPartsTreeItemConnection::checkSaveAndGenerate()\n{\n v->checkSaveAndGenerate();\n}\n\nvoid cmbNucPartsTreeItem::checkSaveAndGenerate()\n{\n enumNucPartsType selType = PartObject->GetType();\n bool need_to_save = false;\n bool need_to_generate = false;\n switch(selType)\n {\n case CMBNUC_CORE:\n {\n cmbNucCore * core = dynamic_cast<cmbNucCore*>(PartObject);\n need_to_save = core->changeSinceLastSave();\n need_to_generate = core->changeSinceLastGenerate();\n }\n break;\n case CMBNUC_ASSEMBLY:\n {\n cmbNucAssembly * assy = dynamic_cast<cmbNucAssembly*>(PartObject);\n need_to_save = assy->changeSinceLastSave();\n need_to_generate = assy->changeSinceLastGenerate();\n }\n break;\n default:\n return;\n }\n this->setHightlights(need_to_save, need_to_generate);\n}\n\nbool cmbNucPartsTreeItem::fileChanged() const\n{\n return FileChanged;\n}\n\nbool cmbNucPartsTreeItem::needGeneration() const\n{\n return NeedGeneration;\n}\n\nvoid cmbNucPartsTreeItem::setHightlights(bool fc, bool ng)\n{\n FileChanged = fc;\n NeedGeneration = ng;\n if( FileChanged )\n {\n this->setText( 1, QChar(9999) );\n QBrush b;\n setBackground( 1 , b );\n setForeground( 1 , b );\n }\n else\n {\n QBrush b (Qt::green);\n setBackground( 1 , b );\n setForeground( 1 , b );\n this->setText( 1, \" \" );\n }\n\n std::string fname = this->PartObject->getFileName();\n if(fname.empty())\n {\n this->setText(3, \"\");\n }\n else\n {\n QFileInfo fi(fname.c_str());\n this->setText(3, fi.fileName());\n }\n\n if(NeedGeneration)\n {\n QBrush b;\n setBackground( 2 , b );\n setForeground( 2 , b );\n this->setText( 2, QChar(9746) );\n }\n else\n {\n QBrush b (Qt::green);\n setBackground( 2 , b );\n setForeground( 2 , b );\n this->setText( 2, \" \" );\n }\n}\n\nQVariant cmbNucPartsTreeItem::data( int index, int role ) const\n{\n if(role == Qt::ToolTipRole && index == 3)\n {\n std::string fname = this->PartObject->getFileName();\n if(!fname.empty())\n {\n return QVariant(fname.c_str());\n }\n }\n if(role == Qt::ToolTipRole && index == 1)\n {\n if(FileChanged)\n {\n return QVariant(\"Needs to be saved\");\n }\n else\n {\n return QVariant(\"Saved\");\n }\n }\n if(role == Qt::ToolTipRole && index == 2)\n {\n if(NeedGeneration)\n {\n return QVariant(\"MeshKit needs to be run\");\n }\n else\n {\n return QVariant(\"MeshKit files up to date\");\n }\n }\n return this->QTreeWidgetItem::data(index, role);\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n This source file is part of the Avogadro project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"pluginmanager.h\"\n\n#include \"transport\/connectionlistenerfactory.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QMutex>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n\n#include <QtCore\/QDebug>\n\nnamespace MoleQueue\n{\n\nnamespace\n{\n\/\/ Compiler initializes this static pointer to 0.\nstatic PluginManager *pluginManagerInstance;\n}\n\nPluginManager::PluginManager(QObject *p) : QObject(p)\n{\n m_relativeToApp = \"\/..\/lib\/molequeue\/plugins\";\n#ifdef __APPLE__\n QString buildRelative(\"\/..\/..\/..\/..\");\n qDebug() << QCoreApplication::applicationDirPath() + buildRelative\n + \"\/CMakeCache.txt\";\n if (QFileInfo(QCoreApplication::applicationDirPath() + buildRelative\n + \"\/CMakeCache.txt\").exists()) {\n qDebug() << QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\";\n m_pluginDirs.append(QDir(QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\").absolutePath());\n qDebug() << QDir(QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\").absolutePath();\n }\n#endif\n\n\/\/ For multi configuration types add correct one to search path.\n#ifdef MULTI_CONFIG_BUILD\n \/\/ First extract the build type ( the name of the application dir )\n QDir appDir(QCoreApplication::applicationDirPath());\n QString buildType = appDir.dirName();\n\n QDir dir(QCoreApplication::applicationDirPath()\n + \"\/..\/..\/lib\/molequeue\/plugins\/\"+ buildType);\n m_pluginDirs.append(dir.absolutePath());\n#else\n QDir dir(QCoreApplication::applicationDirPath() + m_relativeToApp);\n m_pluginDirs.append(dir.absolutePath());\n#endif\n}\n\nPluginManager::~PluginManager()\n{\n}\n\nPluginManager * PluginManager::instance()\n{\n static QMutex mutex;\n if (!pluginManagerInstance) {\n mutex.lock();\n if (!pluginManagerInstance)\n pluginManagerInstance = new PluginManager(QCoreApplication::instance());\n mutex.unlock();\n }\n return pluginManagerInstance;\n}\n\nvoid PluginManager::load()\n{\n foreach(const QString &dir, m_pluginDirs)\n load(dir);\n}\n\nvoid PluginManager::load(const QString &path)\n{\n QDir dir(path);\n qDebug() << dir.entryList(QDir::Files);\n foreach(const QString &pluginPath, dir.entryList(QDir::Files)) {\n QPluginLoader pluginLoader(dir.absolutePath() + QDir::separator() + pluginPath);\n\n if (pluginLoader.isLoaded()) {\n qDebug() << \"Plugin already loaded: \" << pluginLoader.fileName();\n continue;\n }\n\n QObject *pluginInstance = pluginLoader.instance();\n\n \/\/ Check if the plugin loaded correctly. Keep debug output for now, should\n \/\/ go away once we have verified this (or added to a logger).\n if (!pluginInstance) {\n qDebug() << \"Failed to load\" << pluginPath << \"error\"\n << pluginLoader.errorString();\n }\n else {\n qDebug() << \"Loaded\" << pluginPath << \"->\";\n pluginInstance->dumpObjectInfo();\n }\n\n \/\/ Now attempt to cast to known factory types, and make it available.\n ConnectionListenerFactory *connectionListenerFactory =\n qobject_cast<ConnectionListenerFactory *>(pluginInstance);\n if (connectionListenerFactory &&\n !m_connectionListenerFactories.contains(connectionListenerFactory))\n m_connectionListenerFactories.append(connectionListenerFactory);\n }\n}\n\nQList<ConnectionListenerFactory *> PluginManager::connectionListenerFactories() const\n{\n return m_connectionListenerFactories;\n}\n\n} \/\/ End MoleQueue namespace\n<commit_msg>Fix for installed MoleQueue relative plugin paths<commit_after>\/******************************************************************************\n\n This source file is part of the Avogadro project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"pluginmanager.h\"\n\n#include \"transport\/connectionlistenerfactory.h\"\n\n#include <QtCore\/QCoreApplication>\n#include <QtCore\/QMutex>\n#include <QtCore\/QPluginLoader>\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n\n#include <QtCore\/QDebug>\n\nnamespace MoleQueue\n{\n\nnamespace\n{\n\/\/ Compiler initializes this static pointer to 0.\nstatic PluginManager *pluginManagerInstance;\n}\n\nPluginManager::PluginManager(QObject *p) : QObject(p)\n{\n m_relativeToApp = \"\/..\/lib\/molequeue\/plugins\";\n#ifdef __APPLE__\n QString buildRelative(\"\/..\/..\/..\/..\");\n m_relativeToApp = buildRelative + m_relativeToApp;\n qDebug() << QCoreApplication::applicationDirPath() + buildRelative\n + \"\/CMakeCache.txt\";\n if (QFileInfo(QCoreApplication::applicationDirPath() + buildRelative\n + \"\/CMakeCache.txt\").exists()) {\n qDebug() << QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\";\n m_pluginDirs.append(QDir(QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\").absolutePath());\n qDebug() << QDir(QCoreApplication::applicationDirPath()\n + buildRelative\n + \"\/lib\/molequeue\/plugins\").absolutePath();\n }\n#endif\n\n\/\/ For multi configuration types add correct one to search path.\n#ifdef MULTI_CONFIG_BUILD\n \/\/ First extract the build type ( the name of the application dir )\n QDir appDir(QCoreApplication::applicationDirPath());\n QString buildType = appDir.dirName();\n\n QDir dir(QCoreApplication::applicationDirPath()\n + \"\/..\/..\/lib\/molequeue\/plugins\/\"+ buildType);\n m_pluginDirs.append(dir.absolutePath());\n#else\n QDir dir(QCoreApplication::applicationDirPath() + m_relativeToApp);\n m_pluginDirs.append(dir.absolutePath());\n#endif\n}\n\nPluginManager::~PluginManager()\n{\n}\n\nPluginManager * PluginManager::instance()\n{\n static QMutex mutex;\n if (!pluginManagerInstance) {\n mutex.lock();\n if (!pluginManagerInstance)\n pluginManagerInstance = new PluginManager(QCoreApplication::instance());\n mutex.unlock();\n }\n return pluginManagerInstance;\n}\n\nvoid PluginManager::load()\n{\n foreach(const QString &dir, m_pluginDirs)\n load(dir);\n}\n\nvoid PluginManager::load(const QString &path)\n{\n QDir dir(path);\n qDebug() << dir.entryList(QDir::Files);\n foreach(const QString &pluginPath, dir.entryList(QDir::Files)) {\n QPluginLoader pluginLoader(dir.absolutePath() + QDir::separator() + pluginPath);\n\n if (pluginLoader.isLoaded()) {\n qDebug() << \"Plugin already loaded: \" << pluginLoader.fileName();\n continue;\n }\n\n QObject *pluginInstance = pluginLoader.instance();\n\n \/\/ Check if the plugin loaded correctly. Keep debug output for now, should\n \/\/ go away once we have verified this (or added to a logger).\n if (!pluginInstance) {\n qDebug() << \"Failed to load\" << pluginPath << \"error\"\n << pluginLoader.errorString();\n }\n else {\n qDebug() << \"Loaded\" << pluginPath << \"->\";\n pluginInstance->dumpObjectInfo();\n }\n\n \/\/ Now attempt to cast to known factory types, and make it available.\n ConnectionListenerFactory *connectionListenerFactory =\n qobject_cast<ConnectionListenerFactory *>(pluginInstance);\n if (connectionListenerFactory &&\n !m_connectionListenerFactories.contains(connectionListenerFactory))\n m_connectionListenerFactories.append(connectionListenerFactory);\n }\n}\n\nQList<ConnectionListenerFactory *> PluginManager::connectionListenerFactories() const\n{\n return m_connectionListenerFactories;\n}\n\n} \/\/ End MoleQueue namespace\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: stringtransfer.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 16:22:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SVTOOLS_STRINGTRANSFER_HXX_\n#include \"stringtransfer.hxx\"\n#endif\n\n\/\/........................................................................\nnamespace svt\n{\n\/\/........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::datatransfer;\n\n \/\/====================================================================\n \/\/= OStringTransferable\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n OStringTransferable::OStringTransferable(const ::rtl::OUString& _rContent)\n :TransferableHelper()\n ,m_sContent( _rContent )\n {\n }\n\n \/\/--------------------------------------------------------------------\n void OStringTransferable::AddSupportedFormats()\n {\n AddFormat(SOT_FORMAT_STRING);\n }\n\n \/\/--------------------------------------------------------------------\n sal_Bool OStringTransferable::GetData( const DataFlavor& _rFlavor )\n {\n sal_uInt32 nFormat = SotExchange::GetFormat( _rFlavor );\n if (SOT_FORMAT_STRING == nFormat)\n return SetString( m_sContent, _rFlavor );\n\n return sal_False;\n }\n\n \/\/====================================================================\n \/\/= OStringTransfer\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n void OStringTransfer::CopyString( const ::rtl::OUString& _rContent, Window* _pWindow )\n {\n OStringTransferable* pTransferable = new OStringTransferable( _rContent );\n Reference< XTransferable > xTransfer = pTransferable;\n pTransferable->CopyToClipboard( _pWindow );\n }\n\n \/\/--------------------------------------------------------------------\n sal_Bool OStringTransfer::PasteString( ::rtl::OUString& _rContent, Window* _pWindow )\n {\n TransferableDataHelper aClipboardData = TransferableDataHelper::CreateFromSystemClipboard( _pWindow );\n\n \/\/ check for a string format\n const DataFlavorExVector& rFormats = aClipboardData.GetDataFlavorExVector();\n for ( DataFlavorExVector::const_iterator aSearch = rFormats.begin();\n aSearch != rFormats.end();\n ++aSearch\n )\n {\n if (SOT_FORMAT_STRING == aSearch->mnSotId)\n {\n String sContent;\n sal_Bool bSuccess = aClipboardData.GetString( SOT_FORMAT_STRING, sContent );\n _rContent = sContent;\n return bSuccess;\n }\n }\n\n return sal_False;\n }\n\n \/\/--------------------------------------------------------------------\n void OStringTransfer::StartStringDrag( const ::rtl::OUString& _rContent, Window* _pWindow, sal_Int8 _nDragSourceActions )\n {\n OStringTransferable* pTransferable = new OStringTransferable( _rContent );\n Reference< XTransferable > xTransfer = pTransferable;\n pTransferable->StartDrag(_pWindow, _nDragSourceActions);\n }\n\n\/\/........................................................................\n} \/\/ namespace svt\n\/\/........................................................................\n\n\/*************************************************************************\n * history:\n * $Log: not supported by cvs2svn $\n * Revision 1.3.1096.1 2005\/09\/05 14:53:40 rt\n * #i54170# Change license header: remove SISSL\n *\n * Revision 1.3 2001\/05\/21 09:19:00 obr\n * #81916# copy and paste only with window\n *\n * Revision 1.2 2001\/03\/28 08:18:15 fs\n * +StartStringDrag\n *\n * Revision 1.1 2001\/03\/27 14:35:35 fs\n * initial checkin - helper classes for clipboard handling of strings\n *\n *\n * Revision 1.0 27.03.01 14:43:33 fs\n ************************************************************************\/\n\n<commit_msg>INTEGRATION: CWS rt15 (1.4.256); FILE MERGED 2006\/06\/27 10:18:40 rt 1.4.256.1: #i54459# CVS history removed from file.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: stringtransfer.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2006-07-25 09:48:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SVTOOLS_STRINGTRANSFER_HXX_\n#include \"stringtransfer.hxx\"\n#endif\n\n\/\/........................................................................\nnamespace svt\n{\n\/\/........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::datatransfer;\n\n \/\/====================================================================\n \/\/= OStringTransferable\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n OStringTransferable::OStringTransferable(const ::rtl::OUString& _rContent)\n :TransferableHelper()\n ,m_sContent( _rContent )\n {\n }\n\n \/\/--------------------------------------------------------------------\n void OStringTransferable::AddSupportedFormats()\n {\n AddFormat(SOT_FORMAT_STRING);\n }\n\n \/\/--------------------------------------------------------------------\n sal_Bool OStringTransferable::GetData( const DataFlavor& _rFlavor )\n {\n sal_uInt32 nFormat = SotExchange::GetFormat( _rFlavor );\n if (SOT_FORMAT_STRING == nFormat)\n return SetString( m_sContent, _rFlavor );\n\n return sal_False;\n }\n\n \/\/====================================================================\n \/\/= OStringTransfer\n \/\/====================================================================\n \/\/--------------------------------------------------------------------\n void OStringTransfer::CopyString( const ::rtl::OUString& _rContent, Window* _pWindow )\n {\n OStringTransferable* pTransferable = new OStringTransferable( _rContent );\n Reference< XTransferable > xTransfer = pTransferable;\n pTransferable->CopyToClipboard( _pWindow );\n }\n\n \/\/--------------------------------------------------------------------\n sal_Bool OStringTransfer::PasteString( ::rtl::OUString& _rContent, Window* _pWindow )\n {\n TransferableDataHelper aClipboardData = TransferableDataHelper::CreateFromSystemClipboard( _pWindow );\n\n \/\/ check for a string format\n const DataFlavorExVector& rFormats = aClipboardData.GetDataFlavorExVector();\n for ( DataFlavorExVector::const_iterator aSearch = rFormats.begin();\n aSearch != rFormats.end();\n ++aSearch\n )\n {\n if (SOT_FORMAT_STRING == aSearch->mnSotId)\n {\n String sContent;\n sal_Bool bSuccess = aClipboardData.GetString( SOT_FORMAT_STRING, sContent );\n _rContent = sContent;\n return bSuccess;\n }\n }\n\n return sal_False;\n }\n\n \/\/--------------------------------------------------------------------\n void OStringTransfer::StartStringDrag( const ::rtl::OUString& _rContent, Window* _pWindow, sal_Int8 _nDragSourceActions )\n {\n OStringTransferable* pTransferable = new OStringTransferable( _rContent );\n Reference< XTransferable > xTransfer = pTransferable;\n pTransferable->StartDrag(_pWindow, _nDragSourceActions);\n }\n\n\/\/........................................................................\n} \/\/ namespace svt\n\/\/........................................................................\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SwXTextDefaults.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 03:41:33 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _SW_XTEXT_DEFAULTS_HXX\n#define _SW_XTEXT_DEFAULTS_HXX\n\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _DOC_HXX\n#include <doc.hxx>\n#endif\n#ifndef _SFX_ITEMPROP_HXX\n#include <svtools\/itemprop.hxx>\n#endif\n\nclass SwXTextDefaults : public cppu::WeakImplHelper3\n <\n com::sun::star::beans::XPropertyState,\n com::sun::star::beans::XPropertySet,\n com::sun::star::lang::XServiceInfo\n >\n{\n SfxItemPropertySet aPropSet;\n SwDoc * pDoc;\npublic:\n SwXTextDefaults ( SwDoc * pNewDoc );\n ~SwXTextDefaults ();\n\n \/\/ XPropertySet\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo( )\n throw(::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL setPropertyValue( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Any& aValue )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::beans::PropertyVetoException, ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Any SAL_CALL getPropertyValue( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL addPropertyChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyChangeListener >& xListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL removePropertyChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL addVetoableChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL removeVetoableChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XPropertyState\n virtual ::com::sun::star::beans::PropertyState SAL_CALL getPropertyState( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyState > SAL_CALL getPropertyStates( const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropertyNames )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL setPropertyToDefault( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Any SAL_CALL getPropertyDefault( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XServiceInfo\n virtual ::rtl::OUString SAL_CALL getImplementationName( ) throw (::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName ) throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames( ) throw (::com::sun::star::uno::RuntimeException);\n};\n#endif\n<commit_msg>INTEGRATION: CWS writercorehandoff (1.2.1284); FILE MERGED 2005\/09\/13 13:47:03 tra 1.2.1284.2: RESYNC: (1.2-1.3); FILE MERGED 2005\/07\/13 13:24:23 fme 1.2.1284.1: #i50348# Make SwDoc accessible via interfaces<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SwXTextDefaults.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: hr $ $Date: 2006-08-14 16:17:15 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _SW_XTEXT_DEFAULTS_HXX\n#define _SW_XTEXT_DEFAULTS_HXX\n#ifndef _CPPUHELPER_IMPLBASE3_HXX_\n#include <cppuhelper\/implbase3.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSTATE_HPP_\n#include <com\/sun\/star\/beans\/XPropertyState.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n\n#ifndef _SFX_ITEMPROP_HXX\n#include <svtools\/itemprop.hxx>\n#endif\n\nclass SwDoc;\n\nclass SwXTextDefaults : public cppu::WeakImplHelper3\n <\n com::sun::star::beans::XPropertyState,\n com::sun::star::beans::XPropertySet,\n com::sun::star::lang::XServiceInfo\n >\n{\n SfxItemPropertySet aPropSet;\n SwDoc * pDoc;\npublic:\n SwXTextDefaults ( SwDoc * pNewDoc );\n ~SwXTextDefaults ();\n\n \/\/ XPropertySet\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertySetInfo > SAL_CALL getPropertySetInfo( )\n throw(::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL setPropertyValue( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Any& aValue )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::beans::PropertyVetoException, ::com::sun::star::lang::IllegalArgumentException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Any SAL_CALL getPropertyValue( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL addPropertyChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyChangeListener >& xListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL removePropertyChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XPropertyChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL addVetoableChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL removeVetoableChangeListener( const ::rtl::OUString& rPropertyName, const ::com::sun::star::uno::Reference< ::com::sun::star::beans::XVetoableChangeListener >& aListener )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XPropertyState\n virtual ::com::sun::star::beans::PropertyState SAL_CALL getPropertyState( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyState > SAL_CALL getPropertyStates( const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rPropertyNames )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL setPropertyToDefault( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Any SAL_CALL getPropertyDefault( const ::rtl::OUString& rPropertyName )\n throw(::com::sun::star::beans::UnknownPropertyException, ::com::sun::star::lang::WrappedTargetException, ::com::sun::star::uno::RuntimeException);\n\n \/\/ XServiceInfo\n virtual ::rtl::OUString SAL_CALL getImplementationName( ) throw (::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName ) throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames( ) throw (::com::sun::star::uno::RuntimeException);\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: unoevtlstnr.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: os $ $Date: 2000-12-19 15:49:21 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PRECOMPILED\n#include \"core_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n#ifndef _UNOEVTLSTNR_HXX\n#include <unoevtlstnr.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_EVENTOBJECT_HPP_\n#include <com\/sun\/star\/lang\/EventObject.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#endif\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::uno;\n\n\/* -----------------22.04.99 11:24-------------------\n *\n * --------------------------------------------------*\/\nSV_IMPL_PTRARR(SwEvtLstnrArray, XEventListenerPtr);\n\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nSwEventListenerContainer::SwEventListenerContainer( uno::XInterface* pxParent) :\n pListenerArr(0),\n pxParent(pxParent)\n{\n}\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nSwEventListenerContainer::~SwEventListenerContainer()\n{\n if(pListenerArr && pListenerArr->Count())\n {\n pListenerArr->DeleteAndDestroy(0, pListenerArr->Count());\n }\n delete pListenerArr;\n}\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SwEventListenerContainer::AddListener(const uno::Reference< lang::XEventListener > & rxListener)\n{\n if(!pListenerArr)\n pListenerArr = new SwEvtLstnrArray;\n uno::Reference< lang::XEventListener > * pInsert = new uno::Reference< lang::XEventListener > ;\n *pInsert = rxListener;\n pListenerArr->Insert(pInsert, pListenerArr->Count());\n}\n\/*-- 22.04.99 11:25:00---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SwEventListenerContainer::RemoveListener(const uno::Reference< lang::XEventListener > & rxListener)\n{\n if(!pListenerArr)\n return sal_False;\n else\n {\n lang::XEventListener* pLeft = rxListener.get();\n for(sal_uInt16 i = 0; i < pListenerArr->Count(); i++)\n {\n XEventListenerPtr pElem = pListenerArr->GetObject(i);\n lang::XEventListener* pRight = pElem->get();\n if(pLeft == pRight)\n {\n pListenerArr->Remove(i);\n delete pElem;\n return sal_True;\n }\n }\n }\n return sal_False;\n}\n\/*-- 22.04.99 11:25:00---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SwEventListenerContainer::Disposing()\n{\n if(!pListenerArr)\n return;\n\n lang::EventObject aObj(pxParent);\n for(sal_uInt16 i = 0; i < pListenerArr->Count(); i++)\n {\n XEventListenerPtr pElem = pListenerArr->GetObject(i);\n (*pElem)->disposing(aObj);\n }\n pListenerArr->DeleteAndDestroy(0, pListenerArr->Count());\n}\n\n\n<commit_msg>INTEGRATION: CWS os8 (1.1.176); FILE MERGED 2003\/04\/03 07:12:16 os 1.1.176.1: #108583# precompiled headers removed<commit_after>\/*************************************************************************\n *\n * $RCSfile: unoevtlstnr.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2003-04-17 14:42:44 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\n#pragma hdrstop\n\n#ifndef _UNOEVTLSTNR_HXX\n#include <unoevtlstnr.hxx>\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_EVENTOBJECT_HPP_\n#include <com\/sun\/star\/lang\/EventObject.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XEVENTLISTENER_HPP_\n#include <com\/sun\/star\/lang\/XEventListener.hpp>\n#endif\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace ::com::sun::star::uno;\n\n\/* -----------------22.04.99 11:24-------------------\n *\n * --------------------------------------------------*\/\nSV_IMPL_PTRARR(SwEvtLstnrArray, XEventListenerPtr);\n\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nSwEventListenerContainer::SwEventListenerContainer( uno::XInterface* pxParent) :\n pListenerArr(0),\n pxParent(pxParent)\n{\n}\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nSwEventListenerContainer::~SwEventListenerContainer()\n{\n if(pListenerArr && pListenerArr->Count())\n {\n pListenerArr->DeleteAndDestroy(0, pListenerArr->Count());\n }\n delete pListenerArr;\n}\n\/*-- 22.04.99 11:24:59---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SwEventListenerContainer::AddListener(const uno::Reference< lang::XEventListener > & rxListener)\n{\n if(!pListenerArr)\n pListenerArr = new SwEvtLstnrArray;\n uno::Reference< lang::XEventListener > * pInsert = new uno::Reference< lang::XEventListener > ;\n *pInsert = rxListener;\n pListenerArr->Insert(pInsert, pListenerArr->Count());\n}\n\/*-- 22.04.99 11:25:00---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nsal_Bool SwEventListenerContainer::RemoveListener(const uno::Reference< lang::XEventListener > & rxListener)\n{\n if(!pListenerArr)\n return sal_False;\n else\n {\n lang::XEventListener* pLeft = rxListener.get();\n for(sal_uInt16 i = 0; i < pListenerArr->Count(); i++)\n {\n XEventListenerPtr pElem = pListenerArr->GetObject(i);\n lang::XEventListener* pRight = pElem->get();\n if(pLeft == pRight)\n {\n pListenerArr->Remove(i);\n delete pElem;\n return sal_True;\n }\n }\n }\n return sal_False;\n}\n\/*-- 22.04.99 11:25:00---------------------------------------------------\n\n -----------------------------------------------------------------------*\/\nvoid SwEventListenerContainer::Disposing()\n{\n if(!pListenerArr)\n return;\n\n lang::EventObject aObj(pxParent);\n for(sal_uInt16 i = 0; i < pListenerArr->Count(); i++)\n {\n XEventListenerPtr pElem = pListenerArr->GetObject(i);\n (*pElem)->disposing(aObj);\n }\n pListenerArr->DeleteAndDestroy(0, pListenerArr->Count());\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ vim:ts=2:sw=2:expandtab:autoindent:filetype=cpp:\n\/*\nCopyright (c) 2008, 2009 Aristid Breitkreuz, Ash Berlin, Ruediger Sonderfeld\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <iconv.h>\n#include <errno.h>\n#include <sstream>\n#include <boost\/algorithm\/string.hpp>\n#include \"flusspferd\/binary.hpp\"\n#include \"flusspferd\/encodings.hpp\"\n#include \"flusspferd\/create.hpp\"\n\n\nusing namespace boost;\nusing namespace flusspferd;\n\nvoid flusspferd::load_encodings_module(object container) {\n object exports = container.get_property_object(\"exports\");\n\n \/\/ Load the binary module\n global().call(\"require\", \"binary\");\n\n create_native_function(\n exports,\n \"convertToString\", &encodings::convert_to_string);\n\n create_native_function(\n exports,\n \"convertFromString\", &encodings::convert_from_string);\n\n create_native_function( exports, \"convert\", &encodings::convert);\n}\n\n\/\/ HELPER METHODS\n\n\/\/ Actually do the conversion.\nbinary::vector_type do_convert(iconv_t conv, binary::element_type const* data, \n size_t bytes);\n\n\/\/ call iconv_open, or throw an error if it cant\niconv_t open_convert(std::string const &from, std::string const &to);\n\n\/\/ If no direct conversion is possible, do it via utf8. Helper method\nobject convert_via_utf8(std::string toEnc, std::string fromEnc,\n binary const &source);\n\nstatic const char16_t b1 = *(char16_t*)\"\\xff\\xfe\",\n b2 = 0xfffe;\n\nstatic const char * native_charset = b1 == b2\n ? \"utf-16be\"\n : \"utf-16le\";\n\nstring\nencodings::convert_to_string(std::string &enc, binary &source_binary) {\n\n \/\/ TODO: We probably need to strip an BOMs from the output (for all paths)\n binary::vector_type const &source = source_binary.get_const_data();\n\n to_lower(enc);\n if (enc == \"utf-8\") {\n binary::vector_type const &source = source_binary.get_const_data();\n return string( (char*)&source[0], source.size());\n }\n else if (enc == native_charset ) {\n \/\/ TODO: Assert on the possible alignment issue here\n binary::vector_type const &source = source_binary.get_const_data();\n return string( reinterpret_cast<char16_t const*>(&source[0]), source.size()\/2);\n }\n else {\n \/\/ Not UTF-8 or UTF-16, so convert to utf-16\n iconv_t conv = open_convert(enc, native_charset);\n binary::vector_type utf16 = do_convert(conv, &source[0], source.size());\n iconv_close(conv);\n return string(reinterpret_cast<char16_t const*>(&utf16[0]), utf16.size()\/2);\n }\n return string();\n}\n\n\nobject\nencodings::convert_from_string(std::string &enc, string const str) {\n binary::vector_type source;\n\n iconv_t conv = open_convert(native_charset, enc);\n const unsigned char *char_data = (const unsigned char*)str.data();\n\n binary::vector_type const &out = do_convert(conv, char_data, str.length()*2);\n iconv_close(conv);\n return create_native_object<byte_string>(object(), &out[0], out.size());\n}\n\nobject encodings::convert(std::string &from, std::string &to,\n binary &source_binary)\n{\n binary::vector_type const &source = source_binary.get_const_data();\n\n to_lower(from);\n to_lower(to);\n if ( from == to ) {\n \/\/ Encodings are the same, just return a copy of the binary\n return create_native_object<byte_string>(\n object(),\n &source[0],\n source.size()\n );\n }\n\n iconv_t conv = open_convert(from, to);\n\n binary::vector_type buf = do_convert(conv, &source[0], source.size());\n iconv_close(conv);\n return create_native_object<byte_string>(object(), &buf[0], buf.size());\n}\n\/\/ End JS methods\n\nbinary::vector_type\ndo_convert(iconv_t conv, binary::element_type const* data, size_t num_bytes) {\n binary::vector_type outbuf;\n\n size_t out_left,\n in_left = num_bytes;\n\n \/\/ Wikipedia says this:\n \/\/ The chance of a random string of bytes being valid UTF-8 and not pure\n \/\/ ASCII is 3.9% for a two-byte sequence, 0.41% for a three-byte sequence\n \/\/ and 0.026% for a four-byte sequence.\n out_left = in_left + in_left\/16 + 32; \/\/ GPSEE's Wild-assed guess.\n\n outbuf.resize(out_left);\n\n const unsigned char *inbytes = data,\n *outbytes = &outbuf[0];\n\n while (in_left) {\n size_t n = iconv(conv,\n (char**)&inbytes, &in_left,\n (char**)&outbytes, &out_left\n );\n\n if (n == (size_t)(-1)) {\n switch (errno) {\n case E2BIG: {\n \/\/ Not enough space in output\n \/\/ Use GPSEE's WAG again. +32 assumes no encoding needs more than 32\n \/\/ bytes(!) per character. Probably a safe bet.\n size_t new_size = in_left + in_left\/4 + 32,\n old_size = outbytes - &outbuf[0];\n\n outbuf.resize(old_size + new_size);\n\n \/\/ The vector has probably realloced, so recalculate outbytes\n outbytes = &outbuf[old_size];\n out_left += new_size;\n\n continue;\n }\n\n case EILSEQ:\n \/\/ An invalid multibyte sequence has been encountered in the input.\n case EINVAL:\n \/\/ An incomplete multibyte sequence has been encountered in the input.\n\n \/\/ Since we have provided the entire input, both these cases are the\n \/\/ same.\n size_t when = inbytes - data;\n std::stringstream ss;\n ss << \"Convert Error: Invalid or incomplete multibyte\"\n \" sequence after \" << when\n << (when == 1 ? \" byte\" : \" bytes\");\n throw flusspferd::exception(ss.str().c_str(), \"TypeError\");\n break;\n }\n }\n\n \/\/ Else all chars got converted\n in_left -= n;\n }\n outbuf.resize(outbytes - &outbuf[0]);\n return outbuf;\n}\n\niconv_t open_convert(std::string const &from, std::string const &to) {\n iconv_t conv = iconv_open(to.c_str(), from.c_str());\n\n if (conv == (iconv_t)(-1)) {\n std::stringstream ss;\n ss << \"Unable to convert from \\\"\" << from\n << \"\\\" to \\\"\" << to << \"\\\"\";\n throw flusspferd::exception(ss.str().c_str());\n }\n return conv;\n}\n\nobject\nconvert_via_utf8(std::string const &to, std::string const &from,\n binary const &) {\n iconv_t to_utf = iconv_open(\"utf-8\", from.c_str()),\n from_utf = iconv_open(to.c_str(), \"utf-8\");\n\n if (to_utf == (iconv_t)(-1) || from_utf == (iconv_t)(-1)) {\n\n if (to_utf)\n iconv_close(to_utf);\n if (from_utf)\n iconv_close(from_utf);\n\n std::stringstream ss;\n ss << \"Unable to convert from \\\"\" << from\n << \"\\\" to \\\"\" << to << \"\\\"\";\n throw flusspferd::exception(ss.str().c_str());\n }\n return object();\n}\n<commit_msg>core\/encodings: make constants actually constant<commit_after>\/\/ vim:ts=2:sw=2:expandtab:autoindent:filetype=cpp:\n\/*\nCopyright (c) 2008, 2009 Aristid Breitkreuz, Ash Berlin, Ruediger Sonderfeld\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <iconv.h>\n#include <errno.h>\n#include <sstream>\n#include <boost\/algorithm\/string.hpp>\n#include \"flusspferd\/binary.hpp\"\n#include \"flusspferd\/encodings.hpp\"\n#include \"flusspferd\/create.hpp\"\n\n\nusing namespace boost;\nusing namespace flusspferd;\n\nvoid flusspferd::load_encodings_module(object container) {\n object exports = container.get_property_object(\"exports\");\n\n \/\/ Load the binary module\n global().call(\"require\", \"binary\");\n\n create_native_function(\n exports,\n \"convertToString\", &encodings::convert_to_string);\n\n create_native_function(\n exports,\n \"convertFromString\", &encodings::convert_from_string);\n\n create_native_function( exports, \"convert\", &encodings::convert);\n}\n\n\/\/ HELPER METHODS\n\n\/\/ Actually do the conversion.\nbinary::vector_type do_convert(iconv_t conv, binary::element_type const* data, \n size_t bytes);\n\n\/\/ call iconv_open, or throw an error if it cant\niconv_t open_convert(std::string const &from, std::string const &to);\n\n\/\/ If no direct conversion is possible, do it via utf8. Helper method\nobject convert_via_utf8(std::string toEnc, std::string fromEnc,\n binary const &source);\n\nstatic char16_t const b1 = *(char16_t*)\"\\xff\\xfe\";\nstatic char16_t const b2 = 0xfffe;\n\nstatic char const * const native_charset = b1 == b2 ? \"utf-16be\" : \"utf-16le\";\n\nstring\nencodings::convert_to_string(std::string &enc, binary &source_binary) {\n\n \/\/ TODO: We probably need to strip an BOMs from the output (for all paths)\n binary::vector_type const &source = source_binary.get_const_data();\n\n to_lower(enc);\n if (enc == \"utf-8\") {\n binary::vector_type const &source = source_binary.get_const_data();\n return string( (char*)&source[0], source.size());\n }\n else if (enc == native_charset ) {\n \/\/ TODO: Assert on the possible alignment issue here\n binary::vector_type const &source = source_binary.get_const_data();\n return string( reinterpret_cast<char16_t const*>(&source[0]), source.size()\/2);\n }\n else {\n \/\/ Not UTF-8 or UTF-16, so convert to utf-16\n iconv_t conv = open_convert(enc, native_charset);\n binary::vector_type utf16 = do_convert(conv, &source[0], source.size());\n iconv_close(conv);\n return string(reinterpret_cast<char16_t const*>(&utf16[0]), utf16.size()\/2);\n }\n return string();\n}\n\n\nobject\nencodings::convert_from_string(std::string &enc, string const str) {\n binary::vector_type source;\n\n iconv_t conv = open_convert(native_charset, enc);\n const unsigned char *char_data = (const unsigned char*)str.data();\n\n binary::vector_type const &out = do_convert(conv, char_data, str.length()*2);\n iconv_close(conv);\n return create_native_object<byte_string>(object(), &out[0], out.size());\n}\n\nobject encodings::convert(std::string &from, std::string &to,\n binary &source_binary)\n{\n binary::vector_type const &source = source_binary.get_const_data();\n\n to_lower(from);\n to_lower(to);\n if ( from == to ) {\n \/\/ Encodings are the same, just return a copy of the binary\n return create_native_object<byte_string>(\n object(),\n &source[0],\n source.size()\n );\n }\n\n iconv_t conv = open_convert(from, to);\n\n binary::vector_type buf = do_convert(conv, &source[0], source.size());\n iconv_close(conv);\n return create_native_object<byte_string>(object(), &buf[0], buf.size());\n}\n\/\/ End JS methods\n\nbinary::vector_type\ndo_convert(iconv_t conv, binary::element_type const* data, size_t num_bytes) {\n binary::vector_type outbuf;\n\n size_t out_left,\n in_left = num_bytes;\n\n \/\/ Wikipedia says this:\n \/\/ The chance of a random string of bytes being valid UTF-8 and not pure\n \/\/ ASCII is 3.9% for a two-byte sequence, 0.41% for a three-byte sequence\n \/\/ and 0.026% for a four-byte sequence.\n out_left = in_left + in_left\/16 + 32; \/\/ GPSEE's Wild-assed guess.\n\n outbuf.resize(out_left);\n\n const unsigned char *inbytes = data,\n *outbytes = &outbuf[0];\n\n while (in_left) {\n size_t n = iconv(conv,\n (char**)&inbytes, &in_left,\n (char**)&outbytes, &out_left\n );\n\n if (n == (size_t)(-1)) {\n switch (errno) {\n case E2BIG: {\n \/\/ Not enough space in output\n \/\/ Use GPSEE's WAG again. +32 assumes no encoding needs more than 32\n \/\/ bytes(!) per character. Probably a safe bet.\n size_t new_size = in_left + in_left\/4 + 32,\n old_size = outbytes - &outbuf[0];\n\n outbuf.resize(old_size + new_size);\n\n \/\/ The vector has probably realloced, so recalculate outbytes\n outbytes = &outbuf[old_size];\n out_left += new_size;\n\n continue;\n }\n\n case EILSEQ:\n \/\/ An invalid multibyte sequence has been encountered in the input.\n case EINVAL:\n \/\/ An incomplete multibyte sequence has been encountered in the input.\n\n \/\/ Since we have provided the entire input, both these cases are the\n \/\/ same.\n size_t when = inbytes - data;\n std::stringstream ss;\n ss << \"Convert Error: Invalid or incomplete multibyte\"\n \" sequence after \" << when\n << (when == 1 ? \" byte\" : \" bytes\");\n throw flusspferd::exception(ss.str().c_str(), \"TypeError\");\n break;\n }\n }\n\n \/\/ Else all chars got converted\n in_left -= n;\n }\n outbuf.resize(outbytes - &outbuf[0]);\n return outbuf;\n}\n\niconv_t open_convert(std::string const &from, std::string const &to) {\n iconv_t conv = iconv_open(to.c_str(), from.c_str());\n\n if (conv == (iconv_t)(-1)) {\n std::stringstream ss;\n ss << \"Unable to convert from \\\"\" << from\n << \"\\\" to \\\"\" << to << \"\\\"\";\n throw flusspferd::exception(ss.str().c_str());\n }\n return conv;\n}\n\nobject\nconvert_via_utf8(std::string const &to, std::string const &from,\n binary const &) {\n iconv_t to_utf = iconv_open(\"utf-8\", from.c_str()),\n from_utf = iconv_open(to.c_str(), \"utf-8\");\n\n if (to_utf == (iconv_t)(-1) || from_utf == (iconv_t)(-1)) {\n\n if (to_utf)\n iconv_close(to_utf);\n if (from_utf)\n iconv_close(from_utf);\n\n std::stringstream ss;\n ss << \"Unable to convert from \\\"\" << from\n << \"\\\" to \\\"\" << to << \"\\\"\";\n throw flusspferd::exception(ss.str().c_str());\n }\n return object();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n#include <stdio.h>\n#include <float.h>\n\n#include \"cache.h\"\n#include \"io.h\"\n#include \"parse_regressor.h\"\n#include \"parser.h\"\n#include \"parse_args.h\"\n#include \"sender.h\"\n#include \"network.h\"\n\nconst float default_decay = 1. \/ sqrt(2.);\n\npo::variables_map parse_args(int argc, char *argv[], boost::program_options::options_description& desc,\n\t\t\t gd_vars& vars, float& eta_decay_rate,\n\t\t\t size_t &passes, regressor &r, parser* par,\n\t\t\t string& final_regressor_name)\n{\n vars.init();\n global.program_name = argv[0];\n \/\/ Declare the supported options.\n desc.add_options()\n (\"audit,a\", \"print weights of features\")\n (\"bit_precision,b\", po::value<size_t>(), \n \"number of bits in the feature table\")\n (\"cache,c\", \"Use a cache. The default is <data>.cache\")\n (\"cache_file\", po::value< vector<string> >(), \"The location(s) of cache_file.\")\n (\"data,d\", po::value< string >()->default_value(\"\"), \"Example Set\")\n (\"daemon\", \"read data from port 39523\")\n (\"decay_learning_rate\", po::value<float>(&eta_decay_rate)->default_value(default_decay), \n \"Set Decay factor for learning_rate between passes\")\n (\"final_regressor,f\", po::value< string >(), \"Final regressor\")\n (\"help,h\",\"Output Arguments\")\n (\"initial_regressor,i\", po::value< vector<string> >(), \"Initial regressor(s)\")\n (\"initial_t\", po::value<float>(&vars.t)->default_value(1.), \"initial t value\")\n (\"min_prediction\", po::value<double>(&global.min_label), \"Smallest prediction to output\")\n (\"max_prediction\", po::value<double>(&global.max_label), \"Largest prediction to output\")\n (\"multisource\", po::value<size_t>(), \"multiple sources for daemon input\")\n (\"noop\",\"do no learning\")\n (\"port\", po::value<size_t>(),\"port to listen on\")\n (\"power_t\", po::value<float>(&vars.power_t)->default_value(0.), \"t power value\")\n (\"predictto\", po::value< string > (), \"host to send predictions to\")\n (\"learning_rate,l\", po::value<float>(&vars.eta)->default_value(0.1), \n \"Set Learning Rate\")\n (\"passes\", po::value<size_t>(&passes)->default_value(1), \n \"Number of Training Passes\")\n (\"predictions,p\", po::value< string >(), \"File to output predictions to\")\n (\"quadratic,q\", po::value< vector<string> > (),\n \"Create and use quadratic features\")\n (\"quiet\", \"Don't output diagnostics\")\n (\"raw_predictions,r\", po::value< string >(), \n \"File to output unnormalized predictions to\")\n (\"sendto\", po::value< vector<string> >(), \"send example to <hosts>\")\n (\"testonly,t\", \"Ignore label information and just test\")\n (\"thread_bits\", po::value<size_t>(&global.thread_bits)->default_value(0), \"log_2 threads\")\n (\"loss_function\", po::value<string>()->default_value(\"squared\"), \"Specify the loss function to be used, uses squared by default. Currently available ones are squared, hinge, logistic and quantile.\")\n (\"quantile_tau\", po::value<double>()->default_value(0.5), \"Parameter \\\\tau associated with Quantile loss. Defaults to 0.5\")\n (\"unique_id\", po::value<size_t>(&global.unique_id)->default_value(0),\"unique id used for cluster parallel\")\n (\"compressed\", \"use gzip format whenever appropriate. If a cache file is being created, this option creates a compressed cache file. A mixture of raw-text & compressed inputs are supported if this option is on\");\n\n global.example_number = 0;\n global.weighted_examples = 0.;\n global.old_weighted_examples = 0.;\n global.weighted_labels = 0.;\n global.total_features = 0;\n global.sum_loss = 0.0;\n global.sum_loss_since_last_dump = 0.0;\n global.dump_interval = exp(1.);\n global.num_bits = 18;\n global.default_bits = true;\n global.final_prediction_sink = -1;\n global.raw_prediction = -1;\n global.local_prediction = -1;\n global.print = print_result;\n global.min_label = 0.;\n global.max_label = 1.;\n\n global.audit = false;\n global.reg = r;\n \n po::positional_options_description p;\n \n po::variables_map vm;\n\n po::store(po::command_line_parser(argc, argv).\n\t options(desc).positional(p).run(), vm);\n po::notify(vm);\n \n if (vm.count(\"help\") || argc == 1) {\n cerr << \"\\n\" << desc << \"\\n\";\n exit(1);\n }\n \n if (vm.count(\"bit_precision\"))\n {\n global.default_bits = false;\n global.num_bits = vm[\"bit_precision\"].as< size_t>();\n }\n\n if(vm.count(\"compressed\")){\n set_compressed(par);\n }\n\n if (global.num_bits > 31) {\n cerr << \"The system limits at 31 bits of precision!\\n\" << endl;\n exit(1);\n }\n if (vm.count(\"quiet\"))\n global.quiet = true;\n else\n global.quiet = false;\n\n if (vm.count(\"quadratic\")) \n {\n global.pairs = vm[\"quadratic\"].as< vector<string> >();\n if (!global.quiet)\n\t{\n\t cerr << \"creating quadratic features for pairs: \";\n\t for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n\t cerr << *i << \" \";\n\t if (i->length() > 2)\n\t cerr << endl << \"warning, ignoring characters after the 2nd.\\n\";\n\t if (i->length() < 2) {\n\t cerr << endl << \"error, quadratic features must involve two sets.\\n\";\n\t exit(0);\n\t }\n\t }\n\t cerr << endl;\n\t}\n }\n\n parse_regressor_args(vm, r, final_regressor_name, global.quiet);\n\n if (vm.count(\"min_prediction\"))\n global.min_label = vm[\"min_prediction\"].as<double>();\n if (vm.count(\"max_prediction\"))\n global.max_label = vm[\"max_prediction\"].as<double>();\n if (vm.count(\"min_prediction\") || vm.count(\"max_prediction\"))\n set_minmax = noop_mm;\n\n string loss_function;\n if(vm.count(\"loss_function\")) \n\t loss_function = vm[\"loss_function\"].as<string>();\n else\n\t loss_function = \"squaredloss\";\n\n double loss_parameter = 0.0;\n if(vm.count(\"quantile_tau\"))\n loss_parameter = vm[\"quantile_tau\"].as<double>();\n r.loss = getLossFunction(loss_function, loss_parameter);\n global.loss = r.loss;\n\n vars.eta *= pow(vars.t, vars.power_t);\n \n if (eta_decay_rate != default_decay && passes == 1)\n cerr << \"Warning: decay_learning_rate has no effect when there is only one pass\" << endl;\n\n if (pow(eta_decay_rate, passes) < 0.0001 )\n cerr << \"Warning: the learning rate for the last pass is multiplied by: \" << pow(eta_decay_rate, passes) \n\t << \" adjust to --decay_learning_rate larger to avoid this.\" << endl;\n \n parse_source_args(vm,par,global.quiet,passes);\n\n if (!global.quiet)\n {\n cerr << \"Num weight bits = \" << global.num_bits << endl;\n cerr << \"learning rate = \" << vars.eta << endl;\n cerr << \"initial_t = \" << vars.t << endl;\n cerr << \"power_t = \" << vars.power_t << endl;\n if (passes > 1)\n\tcerr << \"decay_learning_rate = \" << eta_decay_rate << endl;\n }\n \n if (vm.count(\"predictions\")) {\n if (!global.quiet)\n cerr << \"predictions = \" << vm[\"predictions\"].as< string >() << endl;\n if (strcmp(vm[\"predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.final_prediction_sink = 1;\/\/stdout\n else \n {\n\tconst char* fstr = (vm[\"predictions\"].as< string >().c_str());\n\tglobal.final_prediction_sink = fileno(fopen(fstr,\"w\"));\n\tif (global.final_prediction_sink < 0)\n\t cerr << \"Error opening the predictions file: \" << fstr << endl;\n }\n }\n \n if (vm.count(\"raw_predictions\")) {\n if (!global.quiet)\n cerr << \"raw predictions = \" << vm[\"raw_predictions\"].as< string >() << endl;\n if (strcmp(vm[\"raw_predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.raw_prediction = 1;\/\/stdout\n else\n global.raw_prediction = fileno(fopen(vm[\"raw_predictions\"].as< string >().c_str(), \"w\"));\n }\n\n if (vm.count(\"audit\"))\n global.audit = true;\n\n parse_send_args(vm, global.pairs, global.thread_bits);\n\n if (vm.count(\"testonly\"))\n {\n if (!global.quiet)\n\tcerr << \"only testing\" << endl;\n global.training = false;\n }\n else \n {\n global.training = true;\n if (!global.quiet)\n\tcerr << \"learning_rate set to \" << vars.eta << endl;\n }\n\n if (vm.count(\"predictto\"))\n {\n if (!global.quiet)\n\tcerr << \"predictto = \" << vm[\"predictto\"].as< string >() << endl;\n global.local_prediction = open_socket(vm[\"predictto\"].as< string > ().c_str(), global.unique_id);\n }\n\n return vm;\n}\n\n<commit_msg>RF+ENH: --version (new) and --help to print to stdout<commit_after>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n#include <stdio.h>\n#include <float.h>\n\n#include \"cache.h\"\n#include \"io.h\"\n#include \"parse_regressor.h\"\n#include \"parser.h\"\n#include \"parse_args.h\"\n#include \"sender.h\"\n#include \"network.h\"\n#include \"global_data.h\"\n\nconst float default_decay = 1. \/ sqrt(2.);\n\npo::variables_map parse_args(int argc, char *argv[], boost::program_options::options_description& desc,\n\t\t\t gd_vars& vars, float& eta_decay_rate,\n\t\t\t size_t &passes, regressor &r, parser* par,\n\t\t\t string& final_regressor_name)\n{\n vars.init();\n global.program_name = argv[0];\n \/\/ Declare the supported options.\n desc.add_options()\n (\"audit,a\", \"print weights of features\")\n (\"bit_precision,b\", po::value<size_t>(), \n \"number of bits in the feature table\")\n (\"cache,c\", \"Use a cache. The default is <data>.cache\")\n (\"cache_file\", po::value< vector<string> >(), \"The location(s) of cache_file.\")\n (\"data,d\", po::value< string >()->default_value(\"\"), \"Example Set\")\n (\"daemon\", \"read data from port 39523\")\n (\"decay_learning_rate\", po::value<float>(&eta_decay_rate)->default_value(default_decay), \n \"Set Decay factor for learning_rate between passes\")\n (\"final_regressor,f\", po::value< string >(), \"Final regressor\")\n (\"help,h\",\"Output Arguments\")\n (\"version\",\"Version information\")\n (\"initial_regressor,i\", po::value< vector<string> >(), \"Initial regressor(s)\")\n (\"initial_t\", po::value<float>(&vars.t)->default_value(1.), \"initial t value\")\n (\"min_prediction\", po::value<double>(&global.min_label), \"Smallest prediction to output\")\n (\"max_prediction\", po::value<double>(&global.max_label), \"Largest prediction to output\")\n (\"multisource\", po::value<size_t>(), \"multiple sources for daemon input\")\n (\"noop\",\"do no learning\")\n (\"port\", po::value<size_t>(),\"port to listen on\")\n (\"power_t\", po::value<float>(&vars.power_t)->default_value(0.), \"t power value\")\n (\"predictto\", po::value< string > (), \"host to send predictions to\")\n (\"learning_rate,l\", po::value<float>(&vars.eta)->default_value(0.1), \n \"Set Learning Rate\")\n (\"passes\", po::value<size_t>(&passes)->default_value(1), \n \"Number of Training Passes\")\n (\"predictions,p\", po::value< string >(), \"File to output predictions to\")\n (\"quadratic,q\", po::value< vector<string> > (),\n \"Create and use quadratic features\")\n (\"quiet\", \"Don't output diagnostics\")\n (\"raw_predictions,r\", po::value< string >(), \n \"File to output unnormalized predictions to\")\n (\"sendto\", po::value< vector<string> >(), \"send example to <hosts>\")\n (\"testonly,t\", \"Ignore label information and just test\")\n (\"thread_bits\", po::value<size_t>(&global.thread_bits)->default_value(0), \"log_2 threads\")\n (\"loss_function\", po::value<string>()->default_value(\"squared\"), \"Specify the loss function to be used, uses squared by default. Currently available ones are squared, hinge, logistic and quantile.\")\n (\"quantile_tau\", po::value<double>()->default_value(0.5), \"Parameter \\\\tau associated with Quantile loss. Defaults to 0.5\")\n (\"unique_id\", po::value<size_t>(&global.unique_id)->default_value(0),\"unique id used for cluster parallel\")\n (\"compressed\", \"use gzip format whenever appropriate. If a cache file is being created, this option creates a compressed cache file. A mixture of raw-text & compressed inputs are supported if this option is on\");\n\n global.example_number = 0;\n global.weighted_examples = 0.;\n global.old_weighted_examples = 0.;\n global.weighted_labels = 0.;\n global.total_features = 0;\n global.sum_loss = 0.0;\n global.sum_loss_since_last_dump = 0.0;\n global.dump_interval = exp(1.);\n global.num_bits = 18;\n global.default_bits = true;\n global.final_prediction_sink = -1;\n global.raw_prediction = -1;\n global.local_prediction = -1;\n global.print = print_result;\n global.min_label = 0.;\n global.max_label = 1.;\n\n global.audit = false;\n global.reg = r;\n \n po::positional_options_description p;\n \n po::variables_map vm;\n\n po::store(po::command_line_parser(argc, argv).\n\t options(desc).positional(p).run(), vm);\n po::notify(vm);\n \n if (vm.count(\"help\") || argc == 1) {\n \/* upon direct query for help -- spit it out to stdout *\/\n cout << \"\\n\" << desc << \"\\n\";\n exit(0);\n }\n\n if (vm.count(\"version\") || argc == 1) {\n \/* upon direct query for version -- spit it out to stdout *\/\n cout << version << \"\\n\";\n exit(0);\n }\n\n \n if (vm.count(\"bit_precision\"))\n {\n global.default_bits = false;\n global.num_bits = vm[\"bit_precision\"].as< size_t>();\n }\n\n if(vm.count(\"compressed\")){\n set_compressed(par);\n }\n\n if (global.num_bits > 31) {\n cerr << \"The system limits at 31 bits of precision!\\n\" << endl;\n exit(1);\n }\n if (vm.count(\"quiet\"))\n global.quiet = true;\n else\n global.quiet = false;\n\n if (vm.count(\"quadratic\")) \n {\n global.pairs = vm[\"quadratic\"].as< vector<string> >();\n if (!global.quiet)\n\t{\n\t cerr << \"creating quadratic features for pairs: \";\n\t for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n\t cerr << *i << \" \";\n\t if (i->length() > 2)\n\t cerr << endl << \"warning, ignoring characters after the 2nd.\\n\";\n\t if (i->length() < 2) {\n\t cerr << endl << \"error, quadratic features must involve two sets.\\n\";\n\t exit(0);\n\t }\n\t }\n\t cerr << endl;\n\t}\n }\n\n parse_regressor_args(vm, r, final_regressor_name, global.quiet);\n\n if (vm.count(\"min_prediction\"))\n global.min_label = vm[\"min_prediction\"].as<double>();\n if (vm.count(\"max_prediction\"))\n global.max_label = vm[\"max_prediction\"].as<double>();\n if (vm.count(\"min_prediction\") || vm.count(\"max_prediction\"))\n set_minmax = noop_mm;\n\n string loss_function;\n if(vm.count(\"loss_function\")) \n\t loss_function = vm[\"loss_function\"].as<string>();\n else\n\t loss_function = \"squaredloss\";\n\n double loss_parameter = 0.0;\n if(vm.count(\"quantile_tau\"))\n loss_parameter = vm[\"quantile_tau\"].as<double>();\n r.loss = getLossFunction(loss_function, loss_parameter);\n global.loss = r.loss;\n\n vars.eta *= pow(vars.t, vars.power_t);\n \n if (eta_decay_rate != default_decay && passes == 1)\n cerr << \"Warning: decay_learning_rate has no effect when there is only one pass\" << endl;\n\n if (pow(eta_decay_rate, passes) < 0.0001 )\n cerr << \"Warning: the learning rate for the last pass is multiplied by: \" << pow(eta_decay_rate, passes) \n\t << \" adjust to --decay_learning_rate larger to avoid this.\" << endl;\n \n parse_source_args(vm,par,global.quiet,passes);\n\n if (!global.quiet)\n {\n cerr << \"Num weight bits = \" << global.num_bits << endl;\n cerr << \"learning rate = \" << vars.eta << endl;\n cerr << \"initial_t = \" << vars.t << endl;\n cerr << \"power_t = \" << vars.power_t << endl;\n if (passes > 1)\n\tcerr << \"decay_learning_rate = \" << eta_decay_rate << endl;\n }\n \n if (vm.count(\"predictions\")) {\n if (!global.quiet)\n cerr << \"predictions = \" << vm[\"predictions\"].as< string >() << endl;\n if (strcmp(vm[\"predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.final_prediction_sink = 1;\/\/stdout\n else \n {\n\tconst char* fstr = (vm[\"predictions\"].as< string >().c_str());\n\tglobal.final_prediction_sink = fileno(fopen(fstr,\"w\"));\n\tif (global.final_prediction_sink < 0)\n\t cerr << \"Error opening the predictions file: \" << fstr << endl;\n }\n }\n \n if (vm.count(\"raw_predictions\")) {\n if (!global.quiet)\n cerr << \"raw predictions = \" << vm[\"raw_predictions\"].as< string >() << endl;\n if (strcmp(vm[\"raw_predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.raw_prediction = 1;\/\/stdout\n else\n global.raw_prediction = fileno(fopen(vm[\"raw_predictions\"].as< string >().c_str(), \"w\"));\n }\n\n if (vm.count(\"audit\"))\n global.audit = true;\n\n parse_send_args(vm, global.pairs, global.thread_bits);\n\n if (vm.count(\"testonly\"))\n {\n if (!global.quiet)\n\tcerr << \"only testing\" << endl;\n global.training = false;\n }\n else \n {\n global.training = true;\n if (!global.quiet)\n\tcerr << \"learning_rate set to \" << vars.eta << endl;\n }\n\n if (vm.count(\"predictto\"))\n {\n if (!global.quiet)\n\tcerr << \"predictto = \" << vm[\"predictto\"].as< string >() << endl;\n global.local_prediction = open_socket(vm[\"predictto\"].as< string > ().c_str(), global.unique_id);\n }\n\n return vm;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <openrave_ompl_bridge\/RRTConnectParameters.h>\n\nnamespace openrave_ompl_bridge\n{\n RRTConnectParameters::RRTConnectParameters() : is_processing(false) \n {\n _vXMLParameters.push_back(\"planning_timelimit\");\n _vXMLParameters.push_back(\"smoothing_timelimit\");\n\n }\n\n bool RRTConnectParameters::serialize(std::ostream& O, int options) const\n {\n if( !OpenRAVE::PlannerBase::PlannerParameters::serialize(O, options&~1) )\n {\n return false;\n }\n\n O << \"<planning_timelimit>\" << planning_timelimit << \"<\/planning_timelimit>\" << std::endl;\n O << \"<smoothing_timelimit>\" << smoothing_timelimit << \"<\/smoothing_timelimit>\" << std::endl;\n\n if( !(options & 1) ) \n {\n O << _sExtraParameters << std::endl;\n }\n \n return !!O;\n }\n \n OpenRAVE::BaseXMLReader::ProcessElement RRTConnectParameters::startElement(const std::string& name, const OpenRAVE::AttributesList& atts)\n {\n if( is_processing ) \n {\n return PE_Ignore;\n }\n\n switch( OpenRAVE::PlannerBase::PlannerParameters::startElement(name,atts) ) \n {\n case PE_Pass: break;\n case PE_Support: return PE_Support;\n case PE_Ignore: return PE_Ignore;\n }\n \n is_processing = name==\"planning_timelimit\" || name==\"smoothing_timelimit\";\n\n return is_processing ? PE_Support : PE_Pass;\n }\n \n bool RRTConnectParameters::endElement(const std::string& name)\n {\n if( is_processing ) \n {\n if( name == \"planning_timelimit\") \n {\n _ss >> planning_timelimit;\n }\n else if( name == \"smoothing_timelimit\") \n {\n _ss >> smoothing_timelimit;\n }\n else\n \n {\n RAVELOG_WARN(str(boost::format(\"unknown tag %s\\n\")%name));\n }\n is_processing = false;\n return false;\n }\n \n \/\/ give a chance for the default parameters to get processed\n return PlannerParameters::endElement(name);\n }\n\n std::vector<double> RRTConnectParameters::GetStartConfiguration()\n {\n return vinitialconfig;\n }\n\n std::vector<double> RRTConnectParameters::GetGoalConfiguration()\n {\n return vgoalconfig;\n }\n\n double RRTConnectParameters::GetPlanningTimeLimit()\n {\n return planning_timelimit;\n }\n\n double RRTConnectParameters::GetSmoothingTimeLimit()\n {\n return smoothing_timelimit;\n }\n} \/* namespace openrave_ompl_bridge *\/\n<commit_msg>Corrected indention.<commit_after>#include <openrave_ompl_bridge\/RRTConnectParameters.h>\n\nnamespace openrave_ompl_bridge\n{\n RRTConnectParameters::RRTConnectParameters() : is_processing(false) \n {\n _vXMLParameters.push_back(\"planning_timelimit\");\n _vXMLParameters.push_back(\"smoothing_timelimit\");\n }\n\n bool RRTConnectParameters::serialize(std::ostream& O, int options) const\n {\n if( !OpenRAVE::PlannerBase::PlannerParameters::serialize(O, options&~1) )\n {\n return false;\n }\n\n O << \"<planning_timelimit>\" << planning_timelimit << \"<\/planning_timelimit>\" << std::endl;\n O << \"<smoothing_timelimit>\" << smoothing_timelimit << \"<\/smoothing_timelimit>\" << std::endl;\n\n if( !(options & 1) ) \n {\n O << _sExtraParameters << std::endl;\n }\n \n return !!O;\n }\n \n OpenRAVE::BaseXMLReader::ProcessElement RRTConnectParameters::startElement(const std::string& name, const OpenRAVE::AttributesList& atts)\n {\n if( is_processing ) \n {\n return PE_Ignore;\n }\n\n switch( OpenRAVE::PlannerBase::PlannerParameters::startElement(name,atts) ) \n {\n case PE_Pass: break;\n case PE_Support: return PE_Support;\n case PE_Ignore: return PE_Ignore;\n }\n \n is_processing = name==\"planning_timelimit\" || name==\"smoothing_timelimit\";\n\n return is_processing ? PE_Support : PE_Pass;\n }\n \n bool RRTConnectParameters::endElement(const std::string& name)\n {\n if( is_processing ) \n {\n if( name == \"planning_timelimit\") \n {\n _ss >> planning_timelimit;\n }\n else if( name == \"smoothing_timelimit\") \n {\n _ss >> smoothing_timelimit;\n }\n else\n \n {\n RAVELOG_WARN(str(boost::format(\"unknown tag %s\\n\")%name));\n }\n is_processing = false;\n return false;\n }\n \n \/\/ give a chance for the default parameters to get processed\n return PlannerParameters::endElement(name);\n }\n\n std::vector<double> RRTConnectParameters::GetStartConfiguration()\n {\n return vinitialconfig;\n }\n\n std::vector<double> RRTConnectParameters::GetGoalConfiguration()\n {\n return vgoalconfig;\n }\n\n double RRTConnectParameters::GetPlanningTimeLimit()\n {\n return planning_timelimit;\n }\n\n double RRTConnectParameters::GetSmoothingTimeLimit()\n {\n return smoothing_timelimit;\n }\n} \/* namespace openrave_ompl_bridge *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2019 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"common\/Material.h\"\n#include \"common\/Data.h\"\n#include \"texture\/Texture2D.h\"\n#include \"math\/spectrum.h\"\n#include \"Principled_ispc.h\"\n\nnamespace ospray {\n namespace pathtracer {\n\n struct Principled : public ospray::Material\n {\n \/\/! \\brief common function to help printf-debugging\n \/*! Every derived class should override this! *\/\n virtual std::string toString() const override\n { return \"ospray::pathtracer::Principled\"; }\n\n Principled()\n {\n ispcEquivalent = ispc::PathTracer_Principled_create();\n }\n\n \/\/! \\brief commit the material's parameters\n virtual void commit() override\n {\n MaterialParam3f baseColor = getMaterialParam3f(\"baseColor\", vec3f(0.8f));\n MaterialParam3f edgeColor = getMaterialParam3f(\"edgeColor\", vec3f(1.f));\n MaterialParam1f metallic = getMaterialParam1f(\"metallic\", 0.f);\n MaterialParam1f diffuse = getMaterialParam1f(\"diffuse\", 1.f);\n MaterialParam1f specular = getMaterialParam1f(\"specular\", 1.f);\n MaterialParam1f ior = getMaterialParam1f(\"ior\", 1.f);\n MaterialParam1f transmission = getMaterialParam1f(\"transmission\", 0.f);\n MaterialParam3f transmissionColor = getMaterialParam3f(\"transmissionColor\", vec3f(1.f));\n MaterialParam1f transmissionDepth = getMaterialParam1f(\"transmissionDepth\", 1.f);\n MaterialParam1f roughness = getMaterialParam1f(\"roughness\", 0.f);\n MaterialParam1f anisotropy = getMaterialParam1f(\"anisotropy\", 0.f);\n MaterialParam1f rotation = getMaterialParam1f(\"rotation\", 0.f);\n MaterialParam1f normal = getMaterialParam1f(\"normal\", 1.f);\n MaterialParam1f baseNormal = getMaterialParam1f(\"baseNormal\", 1.f);\n\n MaterialParam1f coat = getMaterialParam1f(\"coat\", 0.f);\n MaterialParam1f coatIor = getMaterialParam1f(\"coatIor\", 1.5f);\n MaterialParam3f coatColor = getMaterialParam3f(\"coatColor\", vec3f(1.f));\n MaterialParam1f coatThickness = getMaterialParam1f(\"coatThickness\", 1.f);\n MaterialParam1f coatRoughness = getMaterialParam1f(\"coatRoughness\", 0.f);\n MaterialParam1f coatNormal = getMaterialParam1f(\"coatNormal\", 1.f);\n\n MaterialParam1f sheen = getMaterialParam1f(\"sheen\", 0.f);\n MaterialParam3f sheenColor = getMaterialParam3f(\"sheenColor\", vec3f(1.f));\n MaterialParam1f sheenTint = getMaterialParam1f(\"sheenTint\", 0.f);\n MaterialParam1f sheenRoughness = getMaterialParam1f(\"sheenRoughness\", 0.2f);\n\n MaterialParam1f opacity = getMaterialParam1f(\"opacity\", 1.f);\n\n bool thin = getParam1b(\"thin\", false) || (getParam1f(\"thin\", 0.f) > 0.f);\n MaterialParam1f backlight = getMaterialParam1f(\"backlight\", 0.f);\n MaterialParam1f thickness = getMaterialParam1f(\"thickness\", 1.f);\n\n float outsideIor = getParam1f(\"outsideIor\", 1.f);\n vec3f outsideTransmissionColor = getParam3f(\"outsideTransmissionColor\", vec3f(1.f));\n float outsideTransmissionDepth = getParam1f(\"outsideTransmissionDepth\", 1.f);\n\n ispc::PathTracer_Principled_set(getIE(),\n (const ispc::vec3f&)baseColor.factor, baseColor.map ? baseColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)baseColor.xform,\n (const ispc::vec3f&)edgeColor.factor, edgeColor.map ? edgeColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)edgeColor.xform,\n metallic.factor, metallic.map ? metallic.map->getIE() : nullptr, (const ispc::AffineSpace2f&)metallic.xform,\n diffuse.factor, diffuse.map ? diffuse.map->getIE() : nullptr, (const ispc::AffineSpace2f&)diffuse.xform,\n specular.factor, specular.map ? specular.map->getIE() : nullptr, (const ispc::AffineSpace2f&)specular.xform,\n ior.factor, ior.map ? ior.map->getIE() : nullptr, (const ispc::AffineSpace2f&)ior.xform,\n transmission.factor, transmission.map ? transmission.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmission.xform,\n (const ispc::vec3f&)transmissionColor.factor, transmissionColor.map ? transmissionColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmissionColor.xform,\n transmissionDepth.factor, transmissionDepth.map ? transmissionDepth.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmissionDepth.xform,\n roughness.factor, roughness.map ? roughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)roughness.xform,\n anisotropy.factor, anisotropy.map ? anisotropy.map->getIE() : nullptr, (const ispc::AffineSpace2f&)anisotropy.xform,\n rotation.factor, rotation.map ? rotation.map->getIE() : nullptr, (const ispc::AffineSpace2f&)rotation.xform,\n normal.factor, normal.map ? normal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)normal.xform, (const ispc::LinearSpace2f&)normal.rot,\n baseNormal.factor, baseNormal.map ? baseNormal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)baseNormal.xform, (const ispc::LinearSpace2f&)baseNormal.rot,\n\n coat.factor, coat.map ? coat.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coat.xform,\n coatIor.factor, coatIor.map ? coatIor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatIor.xform,\n (const ispc::vec3f&)coatColor.factor, coatColor.map ? coatColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatColor.xform,\n coatThickness.factor, coatThickness.map ? coatThickness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatThickness.xform,\n coatRoughness.factor, coatRoughness.map ? coatRoughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatRoughness.xform,\n coatNormal.factor, coatNormal.map ? coatNormal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatNormal.xform, (const ispc::LinearSpace2f&)coatNormal.rot,\n\n sheen.factor, sheen.map ? sheen.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheen.xform,\n (const ispc::vec3f&)sheenColor.factor, sheenColor.map ? sheenColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenColor.xform,\n sheenTint.factor, sheenTint.map ? sheenTint.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenTint.xform,\n sheenRoughness.factor, sheenRoughness.map ? sheenRoughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenRoughness.xform,\n\n opacity.factor, opacity.map ? opacity.map->getIE() : nullptr, (const ispc::AffineSpace2f&)opacity.xform,\n\n thin,\n backlight.factor, backlight.map ? backlight.map->getIE() : nullptr, (const ispc::AffineSpace2f&)backlight.xform,\n thickness.factor, thickness.map ? thickness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)thickness.xform,\n\n outsideIor,\n (const ispc::vec3f&)outsideTransmissionColor,\n outsideTransmissionDepth);\n }\n };\n\n OSP_REGISTER_MATERIAL(pathtracer, Principled, Principled);\n OSP_REGISTER_MATERIAL(pt, Principled, Principled);\n }\n}\n<commit_msg>Principled material “thin” parameter only consumes booleans.<commit_after>\/\/ ======================================================================== \/\/\n\/\/ Copyright 2009-2019 Intel Corporation \/\/\n\/\/ \/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); \/\/\n\/\/ you may not use this file except in compliance with the License. \/\/\n\/\/ You may obtain a copy of the License at \/\/\n\/\/ \/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0 \/\/\n\/\/ \/\/\n\/\/ Unless required by applicable law or agreed to in writing, software \/\/\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS, \/\/\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \/\/\n\/\/ See the License for the specific language governing permissions and \/\/\n\/\/ limitations under the License. \/\/\n\/\/ ======================================================================== \/\/\n\n#include \"common\/Material.h\"\n#include \"common\/Data.h\"\n#include \"texture\/Texture2D.h\"\n#include \"math\/spectrum.h\"\n#include \"Principled_ispc.h\"\n\nnamespace ospray {\n namespace pathtracer {\n\n struct Principled : public ospray::Material\n {\n \/\/! \\brief common function to help printf-debugging\n \/*! Every derived class should override this! *\/\n virtual std::string toString() const override\n { return \"ospray::pathtracer::Principled\"; }\n\n Principled()\n {\n ispcEquivalent = ispc::PathTracer_Principled_create();\n }\n\n \/\/! \\brief commit the material's parameters\n virtual void commit() override\n {\n MaterialParam3f baseColor = getMaterialParam3f(\"baseColor\", vec3f(0.8f));\n MaterialParam3f edgeColor = getMaterialParam3f(\"edgeColor\", vec3f(1.f));\n MaterialParam1f metallic = getMaterialParam1f(\"metallic\", 0.f);\n MaterialParam1f diffuse = getMaterialParam1f(\"diffuse\", 1.f);\n MaterialParam1f specular = getMaterialParam1f(\"specular\", 1.f);\n MaterialParam1f ior = getMaterialParam1f(\"ior\", 1.f);\n MaterialParam1f transmission = getMaterialParam1f(\"transmission\", 0.f);\n MaterialParam3f transmissionColor = getMaterialParam3f(\"transmissionColor\", vec3f(1.f));\n MaterialParam1f transmissionDepth = getMaterialParam1f(\"transmissionDepth\", 1.f);\n MaterialParam1f roughness = getMaterialParam1f(\"roughness\", 0.f);\n MaterialParam1f anisotropy = getMaterialParam1f(\"anisotropy\", 0.f);\n MaterialParam1f rotation = getMaterialParam1f(\"rotation\", 0.f);\n MaterialParam1f normal = getMaterialParam1f(\"normal\", 1.f);\n MaterialParam1f baseNormal = getMaterialParam1f(\"baseNormal\", 1.f);\n\n MaterialParam1f coat = getMaterialParam1f(\"coat\", 0.f);\n MaterialParam1f coatIor = getMaterialParam1f(\"coatIor\", 1.5f);\n MaterialParam3f coatColor = getMaterialParam3f(\"coatColor\", vec3f(1.f));\n MaterialParam1f coatThickness = getMaterialParam1f(\"coatThickness\", 1.f);\n MaterialParam1f coatRoughness = getMaterialParam1f(\"coatRoughness\", 0.f);\n MaterialParam1f coatNormal = getMaterialParam1f(\"coatNormal\", 1.f);\n\n MaterialParam1f sheen = getMaterialParam1f(\"sheen\", 0.f);\n MaterialParam3f sheenColor = getMaterialParam3f(\"sheenColor\", vec3f(1.f));\n MaterialParam1f sheenTint = getMaterialParam1f(\"sheenTint\", 0.f);\n MaterialParam1f sheenRoughness = getMaterialParam1f(\"sheenRoughness\", 0.2f);\n\n MaterialParam1f opacity = getMaterialParam1f(\"opacity\", 1.f);\n\n bool thin = getParam1b(\"thin\", false);\n MaterialParam1f backlight = getMaterialParam1f(\"backlight\", 0.f);\n MaterialParam1f thickness = getMaterialParam1f(\"thickness\", 1.f);\n\n float outsideIor = getParam1f(\"outsideIor\", 1.f);\n vec3f outsideTransmissionColor = getParam3f(\"outsideTransmissionColor\", vec3f(1.f));\n float outsideTransmissionDepth = getParam1f(\"outsideTransmissionDepth\", 1.f);\n\n ispc::PathTracer_Principled_set(getIE(),\n (const ispc::vec3f&)baseColor.factor, baseColor.map ? baseColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)baseColor.xform,\n (const ispc::vec3f&)edgeColor.factor, edgeColor.map ? edgeColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)edgeColor.xform,\n metallic.factor, metallic.map ? metallic.map->getIE() : nullptr, (const ispc::AffineSpace2f&)metallic.xform,\n diffuse.factor, diffuse.map ? diffuse.map->getIE() : nullptr, (const ispc::AffineSpace2f&)diffuse.xform,\n specular.factor, specular.map ? specular.map->getIE() : nullptr, (const ispc::AffineSpace2f&)specular.xform,\n ior.factor, ior.map ? ior.map->getIE() : nullptr, (const ispc::AffineSpace2f&)ior.xform,\n transmission.factor, transmission.map ? transmission.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmission.xform,\n (const ispc::vec3f&)transmissionColor.factor, transmissionColor.map ? transmissionColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmissionColor.xform,\n transmissionDepth.factor, transmissionDepth.map ? transmissionDepth.map->getIE() : nullptr, (const ispc::AffineSpace2f&)transmissionDepth.xform,\n roughness.factor, roughness.map ? roughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)roughness.xform,\n anisotropy.factor, anisotropy.map ? anisotropy.map->getIE() : nullptr, (const ispc::AffineSpace2f&)anisotropy.xform,\n rotation.factor, rotation.map ? rotation.map->getIE() : nullptr, (const ispc::AffineSpace2f&)rotation.xform,\n normal.factor, normal.map ? normal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)normal.xform, (const ispc::LinearSpace2f&)normal.rot,\n baseNormal.factor, baseNormal.map ? baseNormal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)baseNormal.xform, (const ispc::LinearSpace2f&)baseNormal.rot,\n\n coat.factor, coat.map ? coat.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coat.xform,\n coatIor.factor, coatIor.map ? coatIor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatIor.xform,\n (const ispc::vec3f&)coatColor.factor, coatColor.map ? coatColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatColor.xform,\n coatThickness.factor, coatThickness.map ? coatThickness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatThickness.xform,\n coatRoughness.factor, coatRoughness.map ? coatRoughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatRoughness.xform,\n coatNormal.factor, coatNormal.map ? coatNormal.map->getIE() : nullptr, (const ispc::AffineSpace2f&)coatNormal.xform, (const ispc::LinearSpace2f&)coatNormal.rot,\n\n sheen.factor, sheen.map ? sheen.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheen.xform,\n (const ispc::vec3f&)sheenColor.factor, sheenColor.map ? sheenColor.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenColor.xform,\n sheenTint.factor, sheenTint.map ? sheenTint.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenTint.xform,\n sheenRoughness.factor, sheenRoughness.map ? sheenRoughness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)sheenRoughness.xform,\n\n opacity.factor, opacity.map ? opacity.map->getIE() : nullptr, (const ispc::AffineSpace2f&)opacity.xform,\n\n thin,\n backlight.factor, backlight.map ? backlight.map->getIE() : nullptr, (const ispc::AffineSpace2f&)backlight.xform,\n thickness.factor, thickness.map ? thickness.map->getIE() : nullptr, (const ispc::AffineSpace2f&)thickness.xform,\n\n outsideIor,\n (const ispc::vec3f&)outsideTransmissionColor,\n outsideTransmissionDepth);\n }\n };\n\n OSP_REGISTER_MATERIAL(pathtracer, Principled, Principled);\n OSP_REGISTER_MATERIAL(pt, Principled, Principled);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <qcstring.h>\n#include <qdatetime.h>\n#include <qstring.h>\n#include <qtimer.h>\n\n#include <kiconloader.h>\n\n#include \"kapplication.h\" \/\/ kapp\n#include \"kdebug.h\"\n\n#include \"event.h\"\n\n#include \"karmutility.h\"\n#include \"task.h\"\n#include \"taskview.h\"\n#include \"preferences.h\"\n\n\nconst int gSecondsPerMinute = 60;\n\n\nQPtrVector<QPixmap> *Task::icons = 0;\n\nTask::Task( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, TaskView *parent)\n : QObject(), QListViewItem(parent)\n{\n init(taskName, minutes, sessionTime, desktops, 0);\n}\n\nTask::Task( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, Task *parent)\n : QObject(), QListViewItem(parent)\n{\n init(taskName, minutes, sessionTime, desktops, 0);\n}\n\nTask::Task( KCal::Todo* todo, TaskView* parent )\n : QObject(), QListViewItem( parent )\n{\n long minutes = 0;\n QString name;\n long sessionTime = 0;\n int percent_complete = 0;\n DesktopList desktops;\n\n parseIncidence(todo, minutes, sessionTime, name, desktops, percent_complete);\n init(name, minutes, sessionTime, desktops, percent_complete);\n}\n\nvoid Task::init( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, int percent_complete)\n{\n \/\/ If our parent is the taskview then connect our totalTimesChanged\n \/\/ signal to its receiver\n if ( ! parent() )\n connect( this, SIGNAL( totalTimesChanged ( long, long ) ),\n listView(), SLOT( taskTotalTimesChanged( long, long) ));\n\n connect( this, SIGNAL( deletingTask( Task* ) ),\n listView(), SLOT( deletingTask( Task* ) ));\n\n if (icons == 0) {\n icons = new QPtrVector<QPixmap>(8);\n for (int i=0; i<8; i++)\n {\n QPixmap *icon = new QPixmap();\n QString name;\n name.sprintf(\"watch-%d.xpm\",i);\n *icon = UserIcon(name);\n icons->insert(i,icon);\n }\n }\n\n \/\/kdDebug(5970) << \"Task::init(\" << taskName << \", \" << minutes << \", \"\n \/\/ << sessionTime << \", desktops)\" << endl;\n\n _name = taskName.stripWhiteSpace();\n _lastStart = QDateTime::currentDateTime();\n _totalTime = _time = minutes;\n _totalSessionTime = _sessionTime = sessionTime;\n noNegativeTimes();\n _timer = new QTimer(this);\n _desktops = desktops;\n connect(_timer, SIGNAL(timeout()), this, SLOT(updateActiveIcon()));\n setPixmap(1, UserIcon(QString::fromLatin1(\"empty-watch.xpm\")));\n _currentPic = 0;\n _percentcomplete = percent_complete;\n\n update();\n changeParentTotalTimes( _sessionTime, _time);\n}\n\nTask::~Task() {\n emit deletingTask(this);\n delete _timer;\n}\n\nvoid Task::setRunning( bool on, KarmStorage* storage )\n{\n if ( on ) {\n if (!_timer->isActive()) {\n _timer->start(1000);\n storage->startTimer(this);\n _currentPic=7;\n _lastStart = QDateTime::currentDateTime();\n updateActiveIcon();\n }\n }\n else {\n if (_timer->isActive()) {\n _timer->stop();\n storage->stopTimer(this);\n setPixmap(1, UserIcon(QString::fromLatin1(\"empty-watch.xpm\")));\n }\n }\n}\n\nvoid Task::setUid(QString uid) {\n _uid = uid;\n}\n\nbool Task::isRunning() const\n{\n return _timer->isActive();\n}\n\nvoid Task::setName( const QString& name, KarmStorage* storage )\n{\n kdDebug(5970) << \"Task:setName: \" << name << endl;\n\n QString oldname = _name;\n if ( oldname != name ) {\n _name = name;\n storage->setName(this, oldname);\n update();\n }\n}\n\nvoid Task::setPercentComplete(const int percent, KarmStorage *storage)\n{\n kdDebug(5970) << \"Task::setPercentComplete(\" << percent << \", storage): \"\n << _uid << endl;\n\n if (isRunning()) setRunning(false, storage);\n\n setEnabled(false);\n setOpen(false);\n\n if (!percent)\n _percentcomplete = 0;\n else if (percent > 100)\n _percentcomplete = 100;\n else if (percent < 0)\n _percentcomplete = 0;\n else\n _percentcomplete = percent;\n\n \/\/ When parent marked as complete, mark all children as complete as well.\n \/\/ Complete tasks are not displayed in the task view, so if a parent is\n \/\/ marked as complete and some of the children are not, then we get an error\n \/\/ message. KArm actually keep chugging along in this case and displays the\n \/\/ child tasks just fine, so an alternative solution is to remove that error\n \/\/ message (from KarmStorage::load). But I think it makes more sense that\n \/\/ if you mark a parent task as complete, then all children should be\n \/\/ complete as well.\n \/\/\n \/\/ This behavior is consistent with KOrganizer (as of 2003-09-24).\n if (_percentcomplete == 100)\n {\n for (Task* child= this->firstChild(); child; child = child->nextSibling())\n child->setPercentComplete(_percentcomplete, storage);\n }\n}\n\nbool Task::isComplete() { return _percentcomplete == 100; }\n\nvoid Task::removeFromView()\n{\n for (Task* child= this->firstChild(); child; child= child->nextSibling())\n child->removeFromView();\n delete this;\n}\n\nvoid Task::setDesktopList ( DesktopList desktopList )\n{\n _desktops = desktopList;\n}\n\nvoid Task::changeTime( long minutes, KarmStorage* storage )\n{\n changeTimes( minutes, minutes, storage); \n}\n\nvoid Task::changeTimes( long minutesSession, long minutes, KarmStorage* storage)\n{\n if( minutesSession != 0 || minutes != 0) \n {\n _sessionTime += minutesSession;\n _time += minutes;\n if ( storage ) storage->changeTime(this, minutes * gSecondsPerMinute);\n noNegativeTimes();\n changeTotalTimes( minutesSession, minutes );\n }\n}\n\nvoid Task::changeTotalTimes( long minutesSession, long minutes )\n{\n \/\/kdDebug(5970)\n \/\/ << \"Task::changeTotalTimes(\" << minutesSession << \", \"\n \/\/ << minutes << \") for \" << name() << endl;\n\n _totalSessionTime += minutesSession;\n _totalTime += minutes;\n noNegativeTimes();\n update();\n changeParentTotalTimes( minutesSession, minutes );\n}\n\nvoid Task::resetTimes()\n{\n _totalSessionTime -= _sessionTime;\n _totalTime -= _time;\n changeParentTotalTimes( -_sessionTime, -_time);\n _sessionTime = 0;\n _time = 0;\n update();\n}\n\nvoid Task::changeParentTotalTimes( long minutesSession, long minutes )\n{\n \/\/kdDebug(5970)\n \/\/ << \"Task::changeParentTotalTimes(\" << minutesSession << \", \"\n \/\/ << minutes << \") for \" << name() << endl;\n\n if ( isRoot() )\n emit totalTimesChanged( minutesSession, minutes );\n else\n parent()->changeTotalTimes( minutesSession, minutes );\n}\n\nbool Task::remove( QPtrList<Task>& activeTasks, KarmStorage* storage)\n{\n kdDebug(5970) << \"Task::remove: \" << _name << endl;\n\n bool ok = true;\n\n storage->removeTask(this);\n\n if( isRunning() ) setRunning( false, storage );\n\n for (Task* child = this->firstChild(); child; child = child->nextSibling())\n {\n if (child->isRunning())\n child->setRunning(false, storage);\n child->remove(activeTasks, storage);\n }\n\n changeParentTotalTimes( -_sessionTime, -_time);\n\n return ok;\n}\n\nvoid Task::updateActiveIcon()\n{\n _currentPic = (_currentPic+1) % 8;\n setPixmap(1, *(*icons)[_currentPic]);\n}\n\nvoid Task::noNegativeTimes()\n{\n if ( _time < 0 )\n _time = 0;\n if ( _sessionTime < 0 )\n _sessionTime = 0;\n}\n\nQString Task::fullName() const\n{\n if (isRoot())\n return name();\n else\n return parent()->fullName() + QString::fromLatin1(\"\/\") + name();\n}\n\nKCal::Todo* Task::asTodo(KCal::Todo* todo) const\n{\n\n todo->setSummary( name() );\n\n \/\/ Note: if the date start is empty, the KOrganizer GUI will have the\n \/\/ checkbox blank, but will prefill the todo's starting datetime to the\n \/\/ time the file is opened.\n \/\/ todo->setDtStart( current );\n\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"totalTaskTime\" ), QString::number( _time ) );\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"totalSessionTime\" ), QString::number( _sessionTime) );\n\n if (getDesktopStr().isEmpty())\n todo->removeCustomProperty(kapp->instanceName(), QCString(\"desktopList\"));\n else\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"desktopList\" ), getDesktopStr() );\n\n todo->setOrganizer( Preferences::instance()->userRealName() );\n\n todo->setPercentComplete(_percentcomplete);\n\n return todo;\n}\n\nbool Task::parseIncidence( KCal::Incidence* incident, long& minutes,\n long& sessionMinutes, QString& name, DesktopList& desktops,\n int& percent_complete )\n{\n bool ok;\n\n name = incident->summary();\n _uid = incident->uid();\n\n _comment = incident->description();\n\n ok = false;\n minutes = incident->customProperty( kapp->instanceName(),\n QCString( \"totalTaskTime\" )).toInt( &ok );\n if ( !ok )\n minutes = 0;\n\n ok = false;\n sessionMinutes = incident->customProperty( kapp->instanceName(),\n QCString( \"totalSessionTime\" )).toInt( &ok );\n if ( !ok )\n sessionMinutes = 0;\n\n QString desktopList = incident->customProperty( kapp->instanceName(),\n QCString( \"desktopList\" ) );\n QStringList desktopStrList = QStringList::split( QString::fromLatin1(\",\"),\n desktopList );\n desktops.clear();\n\n for ( QStringList::iterator iter = desktopStrList.begin();\n iter != desktopStrList.end();\n ++iter ) {\n int desktopInt = (*iter).toInt( &ok );\n if ( ok ) {\n desktops.push_back( desktopInt );\n }\n }\n\n percent_complete = static_cast<KCal::Todo*>(incident)->percentComplete();\n\n \/\/kdDebug(5970) << \"Task::parseIncidence: \"\n \/\/ << name << \", Minutes: \" << minutes\n \/\/ << \", desktop: \" << desktopList << endl;\n\n return true;\n}\n\nQString Task::getDesktopStr() const\n{\n if ( _desktops.empty() )\n return QString();\n\n QString desktopstr;\n for ( DesktopList::const_iterator iter = _desktops.begin();\n iter != _desktops.end();\n ++iter ) {\n desktopstr += QString::number( *iter ) + QString::fromLatin1( \",\" );\n }\n desktopstr.remove( desktopstr.length() - 1, 1 );\n return desktopstr;\n}\n\nvoid Task::cut()\n{\n \/\/kdDebug(5970) << \"Task::cut - \" << name() << endl;\n changeParentTotalTimes( -_totalSessionTime, -_totalTime);\n if ( ! parent())\n listView()->takeItem(this);\n else\n parent()->takeItem(this);\n}\n\nvoid Task::move(Task* destination)\n{\n cut();\n paste(destination);\n}\n\nvoid Task::paste(Task* destination)\n{\n destination->insertItem(this);\n changeParentTotalTimes( _totalSessionTime, _totalTime);\n}\n\nvoid Task::update()\n{\n setText(0, _name);\n setText(1, formatTime(_sessionTime));\n setText(2, formatTime(_time));\n setText(3, formatTime(_totalSessionTime));\n setText(4, formatTime(_totalTime));\n}\n\nvoid Task::addComment( QString comment, KarmStorage* storage )\n{\n _comment = _comment + QString::fromLatin1(\"\\n\") + comment;\n storage->addComment(this, comment);\n}\n\nQString Task::comment() const\n{\n return _comment;\n}\n\nint Task::compare ( QListViewItem * i, int col, bool ascending ) const\n{\n switch ( col )\n {\n case 1: \n if ( _sessionTime < static_cast<Task*>(i)->sessionTime() ) return -1;\n else if ( _sessionTime > static_cast<Task*>(i)->sessionTime() ) return 1;\n else return 0;\n break;\n case 2:\n if ( _time < static_cast<Task*>(i)->time() ) return -1;\n else if ( _time > static_cast<Task*>(i)->time() ) return 1;\n else return 0;\n break;\n case 3:\n if ( _totalSessionTime < static_cast<Task*>(i)->totalSessionTime() ) \n return -1;\n else if ( _totalSessionTime > static_cast<Task*>(i)->totalSessionTime() ) \n return 1;\n else return 0;\n break;\n case 4:\n if ( _totalTime < static_cast<Task*>(i)->totalTime() ) return -1;\n else if ( _totalTime > static_cast<Task*>(i)->totalTime() ) return 1;\n else return 0;\n break;\n default:\n return key(col, ascending).localeAwareCompare( i->key(col, ascending) );\n }\n}\n\n#include \"task.moc\"\n<commit_msg>Improved compare routine, per F. Raabe's suggestion.<commit_after>#include <qcstring.h>\n#include <qdatetime.h>\n#include <qstring.h>\n#include <qtimer.h>\n\n#include <kiconloader.h>\n\n#include \"kapplication.h\" \/\/ kapp\n#include \"kdebug.h\"\n\n#include \"event.h\"\n\n#include \"karmutility.h\"\n#include \"task.h\"\n#include \"taskview.h\"\n#include \"preferences.h\"\n\n\nconst int gSecondsPerMinute = 60;\n\n\nQPtrVector<QPixmap> *Task::icons = 0;\n\nTask::Task( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, TaskView *parent)\n : QObject(), QListViewItem(parent)\n{\n init(taskName, minutes, sessionTime, desktops, 0);\n}\n\nTask::Task( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, Task *parent)\n : QObject(), QListViewItem(parent)\n{\n init(taskName, minutes, sessionTime, desktops, 0);\n}\n\nTask::Task( KCal::Todo* todo, TaskView* parent )\n : QObject(), QListViewItem( parent )\n{\n long minutes = 0;\n QString name;\n long sessionTime = 0;\n int percent_complete = 0;\n DesktopList desktops;\n\n parseIncidence(todo, minutes, sessionTime, name, desktops, percent_complete);\n init(name, minutes, sessionTime, desktops, percent_complete);\n}\n\nvoid Task::init( const QString& taskName, long minutes, long sessionTime,\n DesktopList desktops, int percent_complete)\n{\n \/\/ If our parent is the taskview then connect our totalTimesChanged\n \/\/ signal to its receiver\n if ( ! parent() )\n connect( this, SIGNAL( totalTimesChanged ( long, long ) ),\n listView(), SLOT( taskTotalTimesChanged( long, long) ));\n\n connect( this, SIGNAL( deletingTask( Task* ) ),\n listView(), SLOT( deletingTask( Task* ) ));\n\n if (icons == 0) {\n icons = new QPtrVector<QPixmap>(8);\n for (int i=0; i<8; i++)\n {\n QPixmap *icon = new QPixmap();\n QString name;\n name.sprintf(\"watch-%d.xpm\",i);\n *icon = UserIcon(name);\n icons->insert(i,icon);\n }\n }\n\n \/\/kdDebug(5970) << \"Task::init(\" << taskName << \", \" << minutes << \", \"\n \/\/ << sessionTime << \", desktops)\" << endl;\n\n _name = taskName.stripWhiteSpace();\n _lastStart = QDateTime::currentDateTime();\n _totalTime = _time = minutes;\n _totalSessionTime = _sessionTime = sessionTime;\n noNegativeTimes();\n _timer = new QTimer(this);\n _desktops = desktops;\n connect(_timer, SIGNAL(timeout()), this, SLOT(updateActiveIcon()));\n setPixmap(1, UserIcon(QString::fromLatin1(\"empty-watch.xpm\")));\n _currentPic = 0;\n _percentcomplete = percent_complete;\n\n update();\n changeParentTotalTimes( _sessionTime, _time);\n}\n\nTask::~Task() {\n emit deletingTask(this);\n delete _timer;\n}\n\nvoid Task::setRunning( bool on, KarmStorage* storage )\n{\n if ( on ) {\n if (!_timer->isActive()) {\n _timer->start(1000);\n storage->startTimer(this);\n _currentPic=7;\n _lastStart = QDateTime::currentDateTime();\n updateActiveIcon();\n }\n }\n else {\n if (_timer->isActive()) {\n _timer->stop();\n storage->stopTimer(this);\n setPixmap(1, UserIcon(QString::fromLatin1(\"empty-watch.xpm\")));\n }\n }\n}\n\nvoid Task::setUid(QString uid) {\n _uid = uid;\n}\n\nbool Task::isRunning() const\n{\n return _timer->isActive();\n}\n\nvoid Task::setName( const QString& name, KarmStorage* storage )\n{\n kdDebug(5970) << \"Task:setName: \" << name << endl;\n\n QString oldname = _name;\n if ( oldname != name ) {\n _name = name;\n storage->setName(this, oldname);\n update();\n }\n}\n\nvoid Task::setPercentComplete(const int percent, KarmStorage *storage)\n{\n kdDebug(5970) << \"Task::setPercentComplete(\" << percent << \", storage): \"\n << _uid << endl;\n\n if (isRunning()) setRunning(false, storage);\n\n setEnabled(false);\n setOpen(false);\n\n if (!percent)\n _percentcomplete = 0;\n else if (percent > 100)\n _percentcomplete = 100;\n else if (percent < 0)\n _percentcomplete = 0;\n else\n _percentcomplete = percent;\n\n \/\/ When parent marked as complete, mark all children as complete as well.\n \/\/ Complete tasks are not displayed in the task view, so if a parent is\n \/\/ marked as complete and some of the children are not, then we get an error\n \/\/ message. KArm actually keep chugging along in this case and displays the\n \/\/ child tasks just fine, so an alternative solution is to remove that error\n \/\/ message (from KarmStorage::load). But I think it makes more sense that\n \/\/ if you mark a parent task as complete, then all children should be\n \/\/ complete as well.\n \/\/\n \/\/ This behavior is consistent with KOrganizer (as of 2003-09-24).\n if (_percentcomplete == 100)\n {\n for (Task* child= this->firstChild(); child; child = child->nextSibling())\n child->setPercentComplete(_percentcomplete, storage);\n }\n}\n\nbool Task::isComplete() { return _percentcomplete == 100; }\n\nvoid Task::removeFromView()\n{\n for (Task* child= this->firstChild(); child; child= child->nextSibling())\n child->removeFromView();\n delete this;\n}\n\nvoid Task::setDesktopList ( DesktopList desktopList )\n{\n _desktops = desktopList;\n}\n\nvoid Task::changeTime( long minutes, KarmStorage* storage )\n{\n changeTimes( minutes, minutes, storage); \n}\n\nvoid Task::changeTimes( long minutesSession, long minutes, KarmStorage* storage)\n{\n if( minutesSession != 0 || minutes != 0) \n {\n _sessionTime += minutesSession;\n _time += minutes;\n if ( storage ) storage->changeTime(this, minutes * gSecondsPerMinute);\n noNegativeTimes();\n changeTotalTimes( minutesSession, minutes );\n }\n}\n\nvoid Task::changeTotalTimes( long minutesSession, long minutes )\n{\n \/\/kdDebug(5970)\n \/\/ << \"Task::changeTotalTimes(\" << minutesSession << \", \"\n \/\/ << minutes << \") for \" << name() << endl;\n\n _totalSessionTime += minutesSession;\n _totalTime += minutes;\n noNegativeTimes();\n update();\n changeParentTotalTimes( minutesSession, minutes );\n}\n\nvoid Task::resetTimes()\n{\n _totalSessionTime -= _sessionTime;\n _totalTime -= _time;\n changeParentTotalTimes( -_sessionTime, -_time);\n _sessionTime = 0;\n _time = 0;\n update();\n}\n\nvoid Task::changeParentTotalTimes( long minutesSession, long minutes )\n{\n \/\/kdDebug(5970)\n \/\/ << \"Task::changeParentTotalTimes(\" << minutesSession << \", \"\n \/\/ << minutes << \") for \" << name() << endl;\n\n if ( isRoot() )\n emit totalTimesChanged( minutesSession, minutes );\n else\n parent()->changeTotalTimes( minutesSession, minutes );\n}\n\nbool Task::remove( QPtrList<Task>& activeTasks, KarmStorage* storage)\n{\n kdDebug(5970) << \"Task::remove: \" << _name << endl;\n\n bool ok = true;\n\n storage->removeTask(this);\n\n if( isRunning() ) setRunning( false, storage );\n\n for (Task* child = this->firstChild(); child; child = child->nextSibling())\n {\n if (child->isRunning())\n child->setRunning(false, storage);\n child->remove(activeTasks, storage);\n }\n\n changeParentTotalTimes( -_sessionTime, -_time);\n\n return ok;\n}\n\nvoid Task::updateActiveIcon()\n{\n _currentPic = (_currentPic+1) % 8;\n setPixmap(1, *(*icons)[_currentPic]);\n}\n\nvoid Task::noNegativeTimes()\n{\n if ( _time < 0 )\n _time = 0;\n if ( _sessionTime < 0 )\n _sessionTime = 0;\n}\n\nQString Task::fullName() const\n{\n if (isRoot())\n return name();\n else\n return parent()->fullName() + QString::fromLatin1(\"\/\") + name();\n}\n\nKCal::Todo* Task::asTodo(KCal::Todo* todo) const\n{\n\n todo->setSummary( name() );\n\n \/\/ Note: if the date start is empty, the KOrganizer GUI will have the\n \/\/ checkbox blank, but will prefill the todo's starting datetime to the\n \/\/ time the file is opened.\n \/\/ todo->setDtStart( current );\n\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"totalTaskTime\" ), QString::number( _time ) );\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"totalSessionTime\" ), QString::number( _sessionTime) );\n\n if (getDesktopStr().isEmpty())\n todo->removeCustomProperty(kapp->instanceName(), QCString(\"desktopList\"));\n else\n todo->setCustomProperty( kapp->instanceName(),\n QCString( \"desktopList\" ), getDesktopStr() );\n\n todo->setOrganizer( Preferences::instance()->userRealName() );\n\n todo->setPercentComplete(_percentcomplete);\n\n return todo;\n}\n\nbool Task::parseIncidence( KCal::Incidence* incident, long& minutes,\n long& sessionMinutes, QString& name, DesktopList& desktops,\n int& percent_complete )\n{\n bool ok;\n\n name = incident->summary();\n _uid = incident->uid();\n\n _comment = incident->description();\n\n ok = false;\n minutes = incident->customProperty( kapp->instanceName(),\n QCString( \"totalTaskTime\" )).toInt( &ok );\n if ( !ok )\n minutes = 0;\n\n ok = false;\n sessionMinutes = incident->customProperty( kapp->instanceName(),\n QCString( \"totalSessionTime\" )).toInt( &ok );\n if ( !ok )\n sessionMinutes = 0;\n\n QString desktopList = incident->customProperty( kapp->instanceName(),\n QCString( \"desktopList\" ) );\n QStringList desktopStrList = QStringList::split( QString::fromLatin1(\",\"),\n desktopList );\n desktops.clear();\n\n for ( QStringList::iterator iter = desktopStrList.begin();\n iter != desktopStrList.end();\n ++iter ) {\n int desktopInt = (*iter).toInt( &ok );\n if ( ok ) {\n desktops.push_back( desktopInt );\n }\n }\n\n percent_complete = static_cast<KCal::Todo*>(incident)->percentComplete();\n\n \/\/kdDebug(5970) << \"Task::parseIncidence: \"\n \/\/ << name << \", Minutes: \" << minutes\n \/\/ << \", desktop: \" << desktopList << endl;\n\n return true;\n}\n\nQString Task::getDesktopStr() const\n{\n if ( _desktops.empty() )\n return QString();\n\n QString desktopstr;\n for ( DesktopList::const_iterator iter = _desktops.begin();\n iter != _desktops.end();\n ++iter ) {\n desktopstr += QString::number( *iter ) + QString::fromLatin1( \",\" );\n }\n desktopstr.remove( desktopstr.length() - 1, 1 );\n return desktopstr;\n}\n\nvoid Task::cut()\n{\n \/\/kdDebug(5970) << \"Task::cut - \" << name() << endl;\n changeParentTotalTimes( -_totalSessionTime, -_totalTime);\n if ( ! parent())\n listView()->takeItem(this);\n else\n parent()->takeItem(this);\n}\n\nvoid Task::move(Task* destination)\n{\n cut();\n paste(destination);\n}\n\nvoid Task::paste(Task* destination)\n{\n destination->insertItem(this);\n changeParentTotalTimes( _totalSessionTime, _totalTime);\n}\n\nvoid Task::update()\n{\n setText(0, _name);\n setText(1, formatTime(_sessionTime));\n setText(2, formatTime(_time));\n setText(3, formatTime(_totalSessionTime));\n setText(4, formatTime(_totalTime));\n}\n\nvoid Task::addComment( QString comment, KarmStorage* storage )\n{\n _comment = _comment + QString::fromLatin1(\"\\n\") + comment;\n storage->addComment(this, comment);\n}\n\nQString Task::comment() const\n{\n return _comment;\n}\n\nint Task::compare ( QListViewItem * i, int col, bool ascending ) const\n{\n long thistime = 0;\n long thattime = 0;\n Task *task = static_cast<Task*>(i);\n\n switch ( col )\n {\n case 1: \n thistime = _sessionTime;\n thattime = task->sessionTime();\n break;\n case 2:\n thistime = _time;\n thattime = task->time();\n break;\n case 3:\n thistime = _totalSessionTime;\n thattime = task->totalSessionTime();\n break;\n case 4:\n thistime = _totalTime;\n thattime = task->totalTime();\n break;\n default:\n return key(col, ascending).localeAwareCompare( i->key(col, ascending) );\n }\n\n if ( thistime < thattime ) return -1;\n if ( thistime > thattime ) return 1;\n return 0;\n\n}\n\n#include \"task.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Program Name - S6_2DArrays.cpp\n\/\/ Series: GetOnToC++ Step: 6\n\/\/\n\/\/ Purpose: This program illustrates 2D Arrays\n\/\/\n\/\/ Compile: g++ S6_2DArrays.cpp -o S6_2DArrays\n\/\/ Execute: .\/S6_2DArrays\n\/\/\n\/\/ Created by Narayan Mahadevan on 18\/08\/13.\n\/\/ \n\n#include <iostream>\nusing namespace std;\n\nint matrix[10][10];\nint main(){\n\t\/\/Initializing 2D Array\n\tint counter = 0;\n\tfor(int row = 0; row < 10; row++){\n\t\tfor(int col = 0; col < 10; col++){\n\t\t\tmatrix[row][col] = counter++;\n\t\t}\n\t}\n\t\n\t\/\/Printing 2D array\n\tfor(int row = 0; row < 10; row++){\n\t\tfor(int col = 0; col < 10; col++){\n\t\t\tcout << matrix[row][col] << \"\t\";\n\t\t}\n\t\tcout << endl;\n\t}\n}\n<commit_msg>Update S6_2DArrays.cpp<commit_after>\/\/\n\/\/ Program Name - S6_2DArrays.cpp\n\/\/ Series: GetOnToC++ Step: 6\n\/\/\n\/\/ Purpose: This program illustrates 2D Arrays\n\/\/\n\/\/ Compile: g++ S6_2DArrays.cpp -o S6_2DArrays\n\/\/ Execute: .\/S6_2DArrays\n\/\/\n\/\/ Created by Narayan Mahadevan on 18\/08\/13.\n\/\/ \n\n#include <iostream>\nusing namespace std;\n\/\/Creating a two dimensional array\nint matrix[10][10];\nint main(){\n\t\/\/Initializing 2D Array\n\tint counter = 0;\n\tfor(int row = 0; row < 10; row++){ \/\/For loop to traverse the rows\n\t\tfor(int col = 0; col < 10; col++){ \/\/For loop to traverse each column of each row\n\t\t\tmatrix[row][col] = counter++; \/\/Setting matrix[row][col] to counter\n\t\t}\n\t}\n\t\n\t\/\/Printing 2D array\n\tfor(int row = 0; row < 10; row++){ \/\/For loop to traverse the rows\n\t\tfor(int col = 0; col < 10; col++){ \/\/For loop to traverse each column of each row\n\t\t\tcout << matrix[row][col] << \"\t\"; \/\/Printing the value of matrix[row][col]\n\t\t}\n\t\tcout << endl;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include \"..\/test\/JsonSpiritHeaders.h\"\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\nusing namespace std;\nusing namespace dev;\nnamespace js = json_spirit;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -r,--render Render the given RLP. Options:\" << endl\n\t\t<< \" --indent <string> Use string as the level indentation (default ' ').\" << endl\n\t\t<< \" --hex-ints Render integers in hex.\" << endl\n\t\t<< \" --ascii-strings Render data as C-style strings or hex depending on content being ASCII.\" << endl\n\t\t<< \" --force-string Force all data to be rendered as C-style strings.\" << endl\n\t\t<< \" --force-escape When rendering as C-style strings, force all characters to be escaped.\" << endl\n\t\t<< \" --force-hex Force all data to be rendered as raw hex.\" << endl\n\t\t<< \" -l,--list-archive List the items in the RLP list by hash and size.\" << endl\n\t\t<< \" -e,--extract-archive Extract all items in the RLP list, named by hash.\" << endl\n\t\t<< \" -c,--create Given a simplified JSON string, output the RLP.\" << endl\n\t\t<< \"General options:\" << endl\n\t\t<< \" -L,--lenience Try not to bomb out early if possible.\" << endl\n\t\t<< \" -x,--hex,--base-16 Treat input RLP as hex encoded data.\" << endl\n\t\t<< \" --64,--base-64 Treat input RLP as base-64 encoded data.\" << endl\n\t\t<< \" -b,--bin,--base-256 Treat input RLP as raw binary data.\" << endl\n\t\t<< \" -h,--help Print this help message and exit.\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n\tCreate\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\t\/\/ Always hex-encode anything beginning with 0x to avoid ambiguity.\n\tif (_s.size() >= 2 && _s.substr(0, 2) == \"0x\")\n\t\treturn false;\n\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent = \" \";\n\t\tbool hexInts = false;\n\t\tbool hexPrefix = true;\n\t\tbool forceString = true;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = false;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt())\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << (m_prefs.hexPrefix ? \"0x\" : \"\") << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire), 1), 1);\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData())\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << (m_prefs.hexPrefix ? \"0x\" : \"\") << toHex(_d.data());\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if (arg == \"-c\" || arg == \"--create\")\n\t\t\tmode = Mode::Create;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--ascii-strings\")\n\t\t\tprefs.forceString = prefs.forceHex = false;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\n\tbytes b;\n\n\tif (mode != Mode::Create)\n\t{\n\t\tif (encoding == Encoding::Auto)\n\t\t{\n\t\t\tencoding = Encoding::Hex;\n\t\t\tfor (char b: in)\n\t\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t\t{\n\t\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t\t{\n\t\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t\t}\n\t\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t\t{\n\t\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\tswitch (encoding)\n\t\t{\n\t\tcase Encoding::Hex:\n\t\t{\n\t\t\tstring s = asString(in);\n\t\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\t\tb = fromHex(s);\n\t\t\tbreak;\n\t\t}\n\t\tcase Encoding::Base64:\n\t\t{\n\t\t\tstring s = asString(in);\n\t\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\t\tb = fromBase64(s);\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\tswap(b, in);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttry\n\t{\n\t\tRLP rlp(b);\n\t\tswitch (mode)\n\t\t{\n\t\tcase Mode::ListArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::ExtractArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tofstream fout;\n\t\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Render:\n\t\t{\n\t\t\tRLPStreamer s(cout, prefs);\n\t\t\ts.output(rlp);\n\t\t\tcout << endl;\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Create:\n\t\t{\n\t\t\tvector<js::mValue> v(1);\n\t\t\ttry {\n\t\t\t\tjs::read_string(asString(in), v[0]);\n\t\t\t}\n\t\t\tcatch (...)\n\t\t\t{\n\t\t\t\tcerr << \"Error: Invalid format; bad JSON.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tRLPStream out;\n\t\t\twhile (!v.empty())\n\t\t\t{\n\t\t\t\tauto vb = v.back();\n\t\t\t\tv.pop_back();\n\t\t\t\tswitch (vb.type())\n\t\t\t\t{\n\t\t\t\tcase js::array_type:\n\t\t\t\t{\n\t\t\t\t\tjs::mArray a = vb.get_array();\n\t\t\t\t\tout.appendList(a.size());\n\t\t\t\t\tfor (int i = a.size() - 1; i >= 0; --i)\n\t\t\t\t\t\tv.push_back(a[i]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase js::str_type:\n\t\t\t\t{\n\t\t\t\t\tstring const& s = vb.get_str();\n\t\t\t\t\tif (s.size() >= 2 && s.substr(0, 2) == \"0x\")\n\t\t\t\t\t\tout << fromHex(s);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ assume it's a normal JS escaped string.\n\t\t\t\t\t\tbytes ss;\n\t\t\t\t\t\tss.reserve(s.size());\n\t\t\t\t\t\tfor (unsigned i = 0; i < s.size(); ++i)\n\t\t\t\t\t\t\tif (s[i] == '\\\\' && i + 1 < s.size())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (s[++i] == 'x' && i + 2 < s.size())\n\t\t\t\t\t\t\t\t\tss.push_back(fromHex(s.substr(i, 2))[0]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (s[i] != '\\\\')\n\t\t\t\t\t\t\t\tss.push_back((byte)s[i]);\n\t\t\t\t\t\tout << ss;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase js::int_type:\n\t\t\t\t\tout << vb.get_int();\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tcerr << \"ERROR: Unsupported type in JSON.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tswitch (encoding)\n\t\t\t{\n\t\t\tcase Encoding::Hex: case Encoding::Auto:\n\t\t\t\tcout << toHex(out.out()) << endl;\n\t\t\t\tbreak;\n\t\t\tcase Encoding::Base64:\n\t\t\t\tcout << toBase64(&out.out()) << endl;\n\t\t\t\tbreak;\n\t\t\tcase Encoding::Binary:\n\t\t\t\tcout.write((char const*)out.out().data(), out.out().size());\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tdefault:;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<commit_msg>Improvements to RLP executable.<commit_after>\/*\n\tThis file is part of cpp-ethereum.\n\n\tcpp-ethereum is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tcpp-ethereum is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with cpp-ethereum. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/** @file main.cpp\n * @author Gav Wood <i@gavwood.com>\n * @date 2014\n * RLP tool.\n *\/\n#include <fstream>\n#include <iostream>\n#include <boost\/algorithm\/string.hpp>\n#include \"..\/test\/JsonSpiritHeaders.h\"\n#include <libdevcore\/CommonIO.h>\n#include <libdevcore\/RLP.h>\n#include <libdevcrypto\/SHA3.h>\nusing namespace std;\nusing namespace dev;\nnamespace js = json_spirit;\n\nvoid help()\n{\n\tcout\n\t\t<< \"Usage rlp [OPTIONS] [ <file> | -- ]\" << endl\n\t\t<< \"Options:\" << endl\n\t\t<< \" -r,--render Render the given RLP. Options:\" << endl\n\t\t<< \" --indent <string> Use string as the level indentation (default ' ').\" << endl\n\t\t<< \" --hex-ints Render integers in hex.\" << endl\n\t\t<< \" --string-ints Render integers in the same way as strings.\" << endl\n\t\t<< \" --ascii-strings Render data as C-style strings or hex depending on content being ASCII.\" << endl\n\t\t<< \" --force-string Force all data to be rendered as C-style strings.\" << endl\n\t\t<< \" --force-escape When rendering as C-style strings, force all characters to be escaped.\" << endl\n\t\t<< \" --force-hex Force all data to be rendered as raw hex.\" << endl\n\t\t<< \" -l,--list-archive List the items in the RLP list by hash and size.\" << endl\n\t\t<< \" -e,--extract-archive Extract all items in the RLP list, named by hash.\" << endl\n\t\t<< \" -c,--create Given a simplified JSON string, output the RLP.\" << endl\n\t\t<< \"General options:\" << endl\n\t\t<< \" -L,--lenience Try not to bomb out early if possible.\" << endl\n\t\t<< \" -x,--hex,--base-16 Treat input RLP as hex encoded data.\" << endl\n\t\t<< \" --64,--base-64 Treat input RLP as base-64 encoded data.\" << endl\n\t\t<< \" -b,--bin,--base-256 Treat input RLP as raw binary data.\" << endl\n\t\t<< \" -h,--help Print this help message and exit.\" << endl\n\t\t<< \" -V,--version Show the version and exit.\" << endl\n\t\t;\n\texit(0);\n}\n\nvoid version()\n{\n\tcout << \"rlp version \" << dev::Version << endl;\n\texit(0);\n}\n\nenum class Mode {\n\tListArchive,\n\tExtractArchive,\n\tRender,\n\tCreate\n};\n\nenum class Encoding {\n\tAuto,\n\tHex,\n\tBase64,\n\tBinary,\n};\n\nbool isAscii(string const& _s)\n{\n\t\/\/ Always hex-encode anything beginning with 0x to avoid ambiguity.\n\tif (_s.size() >= 2 && _s.substr(0, 2) == \"0x\")\n\t\treturn false;\n\n\tfor (char c: _s)\n\t\tif (c < 32)\n\t\t\treturn false;\n\treturn true;\n}\n\nclass RLPStreamer\n{\npublic:\n\tstruct Prefs\n\t{\n\t\tstring indent;\n\t\tbool hexInts = false;\n\t\tbool stringInts = true;\n\t\tbool hexPrefix = true;\n\t\tbool forceString = false;\n\t\tbool escapeAll = false;\n\t\tbool forceHex = true;\n\t};\n\n\tRLPStreamer(ostream& _out, Prefs _p): m_out(_out), m_prefs(_p) {}\n\n\tvoid output(RLP const& _d, unsigned _level = 0)\n\t{\n\t\tif (_d.isNull())\n\t\t\tm_out << \"null\";\n\t\telse if (_d.isInt() && !m_prefs.stringInts)\n\t\t\tif (m_prefs.hexInts)\n\t\t\t\tm_out << (m_prefs.hexPrefix ? \"0x\" : \"\") << toHex(toCompactBigEndian(_d.toInt<bigint>(RLP::LaisezFaire), 1), 1);\n\t\t\telse\n\t\t\t\tm_out << _d.toInt<bigint>(RLP::LaisezFaire);\n\t\telse if (_d.isData() || (_d.isInt() && m_prefs.stringInts))\n\t\t\tif (m_prefs.forceString || (!m_prefs.forceHex && isAscii(_d.toString())))\n\t\t\t\tm_out << escaped(_d.toString(), m_prefs.escapeAll);\n\t\t\telse\n\t\t\t\tm_out << \"\\\"\" << (m_prefs.hexPrefix ? \"0x\" : \"\") << toHex(_d.toBytes()) << \"\\\"\";\n\t\telse if (_d.isList())\n\t\t{\n\t\t\tm_out << \"[\";\n\t\t\tstring newline = \"\\n\";\n\t\t\tfor (unsigned i = 0; i < _level + 1; ++i)\n\t\t\t\tnewline += m_prefs.indent;\n\t\t\tint j = 0;\n\t\t\tfor (auto i: _d)\n\t\t\t{\n\t\t\t\tm_out << (j++ ?\n\t\t\t\t\t(m_prefs.indent.empty() ? \", \" : (\",\" + newline)) :\n\t\t\t\t\t(m_prefs.indent.empty() ? \" \" : newline));\n\t\t\t\toutput(i, _level + 1);\n\t\t\t}\n\t\t\tnewline = newline.substr(0, newline.size() - m_prefs.indent.size());\n\t\t\tm_out << (m_prefs.indent.empty() ? (j ? \" ]\" : \"]\") : (j ? newline + \"]\" : \"]\"));\n\t\t}\n\t}\n\nprivate:\n\tstd::ostream& m_out;\n\tPrefs m_prefs;\n};\n\nint main(int argc, char** argv)\n{\n\tEncoding encoding = Encoding::Auto;\n\tMode mode = Mode::Render;\n\tstring inputFile = \"--\";\n\tbool lenience = false;\n\tRLPStreamer::Prefs prefs;\n\n\tfor (int i = 1; i < argc; ++i)\n\t{\n\t\tstring arg = argv[i];\n\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\thelp();\n\t\telse if (arg == \"-r\" || arg == \"--render\")\n\t\t\tmode = Mode::Render;\n\t\telse if (arg == \"-c\" || arg == \"--create\")\n\t\t\tmode = Mode::Create;\n\t\telse if ((arg == \"-i\" || arg == \"--indent\") && argc > i)\n\t\t\tprefs.indent = argv[++i];\n\t\telse if (arg == \"--hex-ints\")\n\t\t\tprefs.hexInts = true;\n\t\telse if (arg == \"--string-ints\")\n\t\t\tprefs.stringInts = true;\n\t\telse if (arg == \"--ascii-strings\")\n\t\t\tprefs.forceString = prefs.forceHex = false;\n\t\telse if (arg == \"--force-string\")\n\t\t\tprefs.forceString = true;\n\t\telse if (arg == \"--force-hex\")\n\t\t\tprefs.forceHex = true, prefs.forceString = false;\n\t\telse if (arg == \"--force-escape\")\n\t\t\tprefs.escapeAll = true;\n\t\telse if (arg == \"-n\" || arg == \"--nice\")\n\t\t\tprefs.forceString = true, prefs.stringInts = false, prefs.forceHex = false, prefs.indent = \" \";\n\t\telse if (arg == \"-l\" || arg == \"--list-archive\")\n\t\t\tmode = Mode::ListArchive;\n\t\telse if (arg == \"-e\" || arg == \"--extract-archive\")\n\t\t\tmode = Mode::ExtractArchive;\n\t\telse if (arg == \"-L\" || arg == \"--lenience\")\n\t\t\tlenience = true;\n\t\telse if (arg == \"-V\" || arg == \"--version\")\n\t\t\tversion();\n\t\telse if (arg == \"-x\" || arg == \"--hex\" || arg == \"--base-16\")\n\t\t\tencoding = Encoding::Hex;\n\t\telse if (arg == \"--64\" || arg == \"--base-64\")\n\t\t\tencoding = Encoding::Base64;\n\t\telse if (arg == \"-b\" || arg == \"--bin\" || arg == \"--base-256\")\n\t\t\tencoding = Encoding::Binary;\n\t\telse\n\t\t\tinputFile = arg;\n\t}\n\n\tbytes in;\n\tif (inputFile == \"--\")\n\t\tfor (int i = cin.get(); i != -1; i = cin.get())\n\t\t\tin.push_back((byte)i);\n\telse\n\t\tin = contents(inputFile);\n\n\tbytes b;\n\n\tif (mode != Mode::Create)\n\t{\n\t\tif (encoding == Encoding::Auto)\n\t\t{\n\t\t\tencoding = Encoding::Hex;\n\t\t\tfor (char b: in)\n\t\t\t\tif (b != '\\n' && b != ' ' && b != '\\t')\n\t\t\t\t{\n\t\t\t\t\tif (encoding == Encoding::Hex && (b < '0' || b > '9' ) && (b < 'a' || b > 'f' ) && (b < 'A' || b > 'F' ))\n\t\t\t\t\t{\n\t\t\t\t\t\tcerr << \"'\" << b << \"':\" << (int)b << endl;\n\t\t\t\t\t\tencoding = Encoding::Base64;\n\t\t\t\t\t}\n\t\t\t\t\tif (encoding == Encoding::Base64 && (b < '0' || b > '9' ) && (b < 'a' || b > 'z' ) && (b < 'A' || b > 'Z' ) && b != '+' && b != '\/')\n\t\t\t\t\t{\n\t\t\t\t\t\tencoding = Encoding::Binary;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t\tswitch (encoding)\n\t\t{\n\t\tcase Encoding::Hex:\n\t\t{\n\t\t\tstring s = asString(in);\n\t\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\t\tb = fromHex(s);\n\t\t\tbreak;\n\t\t}\n\t\tcase Encoding::Base64:\n\t\t{\n\t\t\tstring s = asString(in);\n\t\t\tboost::algorithm::replace_all(s, \" \", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\n\", \"\");\n\t\t\tboost::algorithm::replace_all(s, \"\\t\", \"\");\n\t\t\tb = fromBase64(s);\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\tswap(b, in);\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttry\n\t{\n\t\tRLP rlp(b);\n\t\tswitch (mode)\n\t\t{\n\t\tcase Mode::ListArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tcout << \" \" << i.size() << \" bytes: \" << sha3(i.data()) << endl;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::ExtractArchive:\n\t\t{\n\t\t\tif (!rlp.isList())\n\t\t\t{\n\t\t\t\tcout << \"Error: Invalid format; RLP data is not a list.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tcout << rlp.itemCount() << \" items:\" << endl;\n\t\t\tfor (auto i: rlp)\n\t\t\t{\n\t\t\t\tif (!i.isData())\n\t\t\t\t{\n\t\t\t\t\tcout << \"Error: Invalid format; RLP list item is not data.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\tofstream fout;\n\t\t\t\tfout.open(toString(sha3(i.data())));\n\t\t\t\tfout.write(reinterpret_cast<char const*>(i.data().data()), i.data().size());\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Render:\n\t\t{\n\t\t\tRLPStreamer s(cout, prefs);\n\t\t\ts.output(rlp);\n\t\t\tcout << endl;\n\t\t\tbreak;\n\t\t}\n\t\tcase Mode::Create:\n\t\t{\n\t\t\tvector<js::mValue> v(1);\n\t\t\ttry {\n\t\t\t\tjs::read_string(asString(in), v[0]);\n\t\t\t}\n\t\t\tcatch (...)\n\t\t\t{\n\t\t\t\tcerr << \"Error: Invalid format; bad JSON.\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\tRLPStream out;\n\t\t\twhile (!v.empty())\n\t\t\t{\n\t\t\t\tauto vb = v.back();\n\t\t\t\tv.pop_back();\n\t\t\t\tswitch (vb.type())\n\t\t\t\t{\n\t\t\t\tcase js::array_type:\n\t\t\t\t{\n\t\t\t\t\tjs::mArray a = vb.get_array();\n\t\t\t\t\tout.appendList(a.size());\n\t\t\t\t\tfor (int i = a.size() - 1; i >= 0; --i)\n\t\t\t\t\t\tv.push_back(a[i]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase js::str_type:\n\t\t\t\t{\n\t\t\t\t\tstring const& s = vb.get_str();\n\t\t\t\t\tif (s.size() >= 2 && s.substr(0, 2) == \"0x\")\n\t\t\t\t\t\tout << fromHex(s);\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ assume it's a normal JS escaped string.\n\t\t\t\t\t\tbytes ss;\n\t\t\t\t\t\tss.reserve(s.size());\n\t\t\t\t\t\tfor (unsigned i = 0; i < s.size(); ++i)\n\t\t\t\t\t\t\tif (s[i] == '\\\\' && i + 1 < s.size())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif (s[++i] == 'x' && i + 2 < s.size())\n\t\t\t\t\t\t\t\t\tss.push_back(fromHex(s.substr(i, 2))[0]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (s[i] != '\\\\')\n\t\t\t\t\t\t\t\tss.push_back((byte)s[i]);\n\t\t\t\t\t\tout << ss;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase js::int_type:\n\t\t\t\t\tout << vb.get_int();\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tcerr << \"ERROR: Unsupported type in JSON.\" << endl;\n\t\t\t\t\tif (!lenience)\n\t\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tswitch (encoding)\n\t\t\t{\n\t\t\tcase Encoding::Hex: case Encoding::Auto:\n\t\t\t\tcout << toHex(out.out()) << endl;\n\t\t\t\tbreak;\n\t\t\tcase Encoding::Base64:\n\t\t\t\tcout << toBase64(&out.out()) << endl;\n\t\t\t\tbreak;\n\t\t\tcase Encoding::Binary:\n\t\t\t\tcout.write((char const*)out.out().data(), out.out().size());\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tdefault:;\n\t\t}\n\t}\n\tcatch (...)\n\t{\n\t\tcerr << \"Error: Invalid format; bad RLP.\" << endl;\n\t\texit(1);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef PERCEPTRON_H\n#define PERCEPTRON_H\n\n#include <sstream>\n#include <vector>\n#include <numeric> \/\/ inner_product\n#include <algorithm> \/\/ transform\n#include <functional> \/\/ plus, minus\n#include <assert.h>\n#include <cmath> \/\/ sqrt\n#include <initializer_list>\n#include <iostream> \/\/ cout\n#include <iterator> \/\/ begin, end\n\n\n#include \"randomgen.hh\"\n#include \"classifier.hh\"\n#include \"activation.hh\"\n\n\nusing namespace std;\n\n\nusing epoch_parameter = function<double(int)>;\n\n\nepoch_parameter const_epoch_parameter(double eta) {\n return [eta](int) { return eta; };\n}\n\n\nusing Weights = vector<double>;\n\n\nclass APerceptron {\n \/\/\/ induced local field of activation potential $v_k$, page 11\n virtual double inducedLocalField(const Input &x) = 0;\n \/\/\/ neuron's output (activation function applied to the induced local field)\n virtual double output(const Input &x) = 0;\n \/\/\/ neuron's weights; weights[0] is bias\n virtual Weights getWeights() const = 0;\n};\n\n\n\/\/ TODO: rename to LinearPerceptron\nclass StandalonePerceptron : public APerceptron, public BinaryClassifier {\nprivate:\n \/\/ TODO: use weights[0] as bias\n double bias;\n Weights weights;\n const ActivationFunction &activationFunction;\n\n \/\/ TODO: implement via adjustWeights()\n void trainConverge_addSample(Input input, double output, double eta) {\n double y = this->output(input);\n double xfactor = eta * (output - y);\n bias += xfactor * 1.0;\n transform(\n weights.begin(), weights.end(), begin(input),\n weights.begin() \/* output *\/,\n [&xfactor](double w_i, double x_i) { return w_i + xfactor * x_i; });\n }\n\n void trainBatch_addBatch(LabeledDataset batch, double eta) {\n for (auto sample : batch) {\n double d = sample.label[0]; \/\/ desired output\n Input x = sample.data;\n bias += eta * 1.0 * d;\n transform(begin(x), end(x), weights.begin(), weights.begin(),\n [d, eta](double x_i, double w_i) {\n return w_i + eta * x_i * d;\n });\n }\n }\n\npublic:\n StandalonePerceptron(int n, const ActivationFunction &af = defaultSignum)\n : bias(0), weights(n), activationFunction(af) {}\n\n virtual double inducedLocalField(const Input &x) {\n assert(x.size() == weights.size());\n return inner_product(weights.begin(), weights.end(), begin(x), bias);\n }\n\n virtual double output(const Input &x) {\n return activationFunction(inducedLocalField(x));\n }\n\n virtual bool classify(const Input &x) { return output(x) > 0; }\n\n \/\/\/ perceptron convergence algorithm (Table 1.1)\n void trainConverge(const LabeledDataset &trainSet, int epochs,\n double eta = 1.0) {\n return trainConverge(trainSet, epochs, const_epoch_parameter(eta));\n }\n\n \/\/\/ perceptron convergence algorithm (Table 1.1)\n void trainConverge(const LabeledDataset &trainSet, int epochs,\n epoch_parameter eta) {\n assert(trainSet.outputDim() == 1);\n for (int epoch = 0; epoch < epochs; ++epoch) {\n double etaval = eta(epoch);\n for (auto sample : trainSet) {\n trainConverge_addSample(sample.data, sample.label[0], etaval);\n }\n }\n }\n\n \/\/\/ batch-training algorithm (Sec 1.6, Eq. 1.42)\n void trainBatch(const LabeledDataset &trainSet, int epochs, double eta = 1.0) {\n return trainBatch(trainSet, epochs, const_epoch_parameter(eta));\n }\n\n \/\/\/ batch-training algorithm (Sec 1.6, Eq. 1.42)\n void trainBatch(const LabeledDataset &trainSet, int epochs,\n epoch_parameter eta) {\n assert(trainSet.outputDim() == 1);\n assert(trainSet.inputDim() == weights.size());\n \/\/ \\nabla J(w) = \\sum_{\\vec{x}(n) \\in H} ( - \\vec{x}(n) d(n) ) (1.40)\n \/\/ w(n+1) = w(n) - eta(n) \\nabla J(w) (1.42)\n for (int epoch = 0; epoch < epochs; ++epoch) {\n double etaval = eta(epoch);\n \/\/ a new batch\n LabeledDataset misclassifiedSet;\n for (auto sample : trainSet) {\n if (output(sample.data) * sample.label[0] <= 0) {\n misclassifiedSet.append(sample);\n }\n }\n \/\/ sum cost gradient over the entire bactch\n trainBatch_addBatch(misclassifiedSet, etaval);\n }\n }\n\n virtual vector<double> getWeights() const {\n vector<double> biasAndWeights(weights);\n biasAndWeights.insert(biasAndWeights.begin(), bias);\n return biasAndWeights;\n }\n\n \/\/ TODO: move to non-member function\n string fmt() {\n ostringstream ss;\n for (auto it : getWeights()) {\n ss << \" \" << it;\n }\n return ss.str();\n }\n};\n\n\n\nostream &operator<<(ostream &out, const vector<double> &xs);\n\n#if 0\n\n\/**\n A basic perceptron, without built-in training facilities, with\n reasonable defaults to be used within `PerceptronsLayers`.\n *\/\nclass BasicPerceptron : public APerceptron {\nprivate:\n Weights weights; \/\/ weights[0] is bias\n const ActivationFunction &activationFunction;\n\n \/\/ remember the last input and internal parameters to use them\n \/\/ again in the back-propagation step\n double lastInducedLocalField; \/\/ v_j = \\sum w_i y_i\n double lastActivationValue; \/\/ y_j = \\phi (v_j)\n double lastActivationGradient; \/\/ y_j = \\phi^\\prime (v_j)\n double lastLocalGradient; \/\/ delta_j = \\phi^\\prime(v_j) e_j\n\npublic:\n BasicPerceptron(int n, const ActivationFunction &af = defaultTanh)\n : weights(n + 1), activationFunction(af) {}\n\n \/\/ one-sided Xavier initialization\n \/\/ see http:\/\/andyljones.tumblr.com\/post\/110998971763\/\n void init(unique_ptr<rng_type> &rng) {\n int n_in = weights.size()-1;\n double sigma = n_in > 0 ? sqrt(1.0\/n_in) : 1.0;\n uniform_real_distribution<double> nd(-sigma, sigma);\n generate(weights.begin(), weights.end(), [&nd, &rng] {\n double w = nd(*rng.get());\n return w;\n });\n }\n\n virtual double inducedLocalField(const Input &x) {\n double bias = weights[0];\n auto weights_2nd = next(weights.begin());\n return inner_product(weights_2nd, weights.end(), x.begin(), bias);\n }\n\n virtual double output(const Input &x) {\n double v = inducedLocalField(x);\n lastInducedLocalField = v;\n lastActivationValue = activationFunction(v);\n lastActivationGradient = activationFunction.derivative(v);\n return lastActivationValue;\n }\n\n virtual Weights getWeights() const {\n return weights;\n }\n\n void adjustWeights(Weights deltaW) {\n assert(deltaW.size() == weights.size());\n for (size_t i = 0; i < weights.size(); ++i) {\n weights[i] += deltaW[i];\n }\n }\n\n struct BPResult {\n Weights weightCorrection;\n double localGradient;\n };\n\n \/\/ Page 134. Equation (4.27) defines weight correction\n \/\/\n \/\/ $$ \\Delta w_{ji} (n) =\n \/\/ \\eta\n \/\/ \\times\n \/\/ \\delta_j (n)\n \/\/ \\times\n \/\/ y_{i} (n) $$\n \/\/\n \/\/ where $w_{ji}$ is the synaptic weight connecting neuron $i$ to neuron $j$,\n \/\/ $\\eta$ is learning rate, $delta_j (n)$ is the local [error] gradient,\n \/\/ $y_{i}$ is the input signal of the neuron $i$, $n$ is the epoch number\n \/\/\n \/\/ The local gradient is the product of the activation function derivative\n \/\/ and the error signal.\n \/\/\n \/\/ Return a vector of weight corrections and the local gradient value.\n \/\/\n \/\/ The method should be called _after_ `forwardPass`\n BPResult backwardPass(const Input &inputs, double errorSignal,\n double learningRate) {\n assert(inputs.size() + 1 == weights.size());\n size_t nInputs = weights.size();\n double localGradient = lastActivationGradient * errorSignal;\n double multiplier = learningRate * localGradient;\n Weights delta_W(nInputs, multiplier);\n for (size_t i = 0; i < inputs.size(); ++i) {\n delta_W[i + 1] *= inputs[i];\n }\n lastLocalGradient = localGradient;\n return BPResult{delta_W, localGradient};\n }\n};\n\n\n\/\/\/ A fully connected layer of perceptrons.\nclass PerceptronsLayer {\nprivate:\n unsigned int nInputs;\n unsigned int nNeurons;\n vector<BasicPerceptron> neurons;\n Output lastOutput;\n\npublic:\n PerceptronsLayer(unsigned int nInputs = 0, unsigned int nOutputs = 0,\n const ActivationFunction &af = defaultTanh)\n : nInputs(nInputs), nNeurons(nOutputs),\n neurons(nOutputs, BasicPerceptron(nInputs, af)),\n lastOutput(nOutputs) {}\n\n void init(unique_ptr<rng_type> &rng) {\n for (size_t i = 0; i < neurons.size(); ++i) {\n neurons[i].init(rng);\n }\n }\n\n void adjustWeights(vector<Weights> weightDeltas) {\n assert(nNeurons == weightDeltas.size());\n for (size_t i = 0; i < neurons.size(); ++i) {\n neurons[i].adjustWeights(weightDeltas[i]);\n }\n }\n\n \/\/ Pages 132-133.\n \/\/ Return a vector of outputs.\n Output forwardPass(const Input &inputs) {\n for (auto i = 0u; i < nNeurons; ++i) {\n lastOutput[i] = neurons[i].output(inputs);\n }\n return lastOutput;\n }\n\n struct BPResult {\n Output propagatedErrorSignals;\n vector<Weights> weightCorrections;\n };\n\n \/\/ Page 134. Calculate back-propagated error signal and corrections to\n \/\/ synaptic weights.\n \/\/\n \/\/ $$ e_j = \\sum_k \\delta_k w_{kj} $$\n \/\/\n \/\/ where $e_j$ is an error propagated from all downstream neurons to the\n \/\/ neuron $j$, $\\delta_k$ is the local gradient of the downstream neurons\n \/\/ $k$, $w_{kj}$ is the synaptic weight of the $j$-th input of the\n \/\/ downstream neuron $k$.\n \/\/\n \/\/ The method should be called _after_ `forwardPass`\n BPResult backwardPass(const Input &inputs, const Output &errorSignals,\n double learningRate) {\n assert(errorSignals.size() == neurons.size());\n auto eta = learningRate;\n vector<Weights> weightDeltas(0);\n Weights propagatedErrorSignals(nInputs, 0.0);\n for (auto k = 0u; k < nNeurons; ++k) {\n auto error_k = errorSignals[k];\n auto r = neurons[k].backwardPass(inputs, error_k, eta);\n Weights delta_Wk = r.weightCorrection;\n double delta_k = r.localGradient;\n Weights Wk = neurons[k].getWeights();\n for (auto j = 0u; j < nInputs; ++j) {\n propagatedErrorSignals[j] += delta_k * Wk[j + 1];\n }\n weightDeltas.push_back(delta_Wk);\n }\n return BPResult{propagatedErrorSignals, weightDeltas};\n }\n\n friend ostream &operator<<(ostream &out, const PerceptronsLayer &net);\n};\n\n\n\/\/\/ Multiple layers of perceptrons stack one upon another.\n\/\/ TODO: rename to MultilayerPerceptron\nclass PerceptronsNetwork {\nprivate:\n vector<PerceptronsLayer> layers;\n vector<Input> layersInputs;\n\npublic:\n PerceptronsNetwork(initializer_list<unsigned int> shape,\n const ActivationFunction &af = defaultTanh)\n : layers(0), layersInputs(0) {\n auto pIn = shape.begin();\n auto pOut = next(pIn);\n for (; pOut != shape.end(); ++pIn, ++pOut) {\n PerceptronsLayer layer(*pIn, *pOut, af);\n layers.push_back(layer);\n }\n }\n\n void init(unique_ptr<rng_type> &rng) {\n for (auto i = 0u; i < layers.size(); ++i) {\n layers[i].init(rng);\n }\n }\n\n Output forwardPass(const Input &inputs) {\n layersInputs.clear();\n layersInputs.push_back(inputs);\n for (auto i = 0u; i < layers.size(); ++i) {\n auto in = layersInputs[i];\n auto out = layers[i].forwardPass(in);\n layersInputs.push_back(out);\n }\n return layersInputs[layers.size()];\n }\n\n PerceptronsLayer::BPResult\n backwardPass(const Output &errorSignals, double learningRate) {\n Output err(errorSignals);\n PerceptronsLayer::BPResult r;\n\n for (int i = layers.size()-1; i >= 0; --i) {\n auto layerIn = layersInputs[i];\n r = layers[i].backwardPass(layerIn, err, learningRate);\n layers[i].adjustWeights(r.weightCorrections);\n err = r.propagatedErrorSignals;\n }\n return r;\n }\n\n friend ostream &operator<<(ostream &out, const PerceptronsNetwork &net);\n};\n\n\nostream &operator<<(ostream &out, const PerceptronsLayer &layer) {\n size_t n = layer.neurons.size();\n for (size_t j = 0; j < n; ++j) {\n if (j == 0) {\n out << \"[\";\n } else {\n out << \" \";\n }\n out << layer.neurons[j].getWeights();\n if (j >= n - 1) {\n out << \"]\";\n } else {\n out << \",\\n\";\n }\n }\n return out;\n}\n\n\nostream &operator<<(ostream &out, const PerceptronsNetwork &net) {\n for (PerceptronsLayer l : net.layers) {\n out << l << \"\\n\";\n }\n return out;\n}\n\n\nostream &operator<<(ostream &out, const vector<double> &xs) {\n int n = xs.size();\n out << \"[ \";\n for (int i = 0; i < n - 1; ++i) {\n out << xs[i] << \", \";\n }\n out << xs[n - 1] << \" ]\";\n return out;\n}\n\n#endif\n\n#endif \/* PERCEPTRON_H *\/\n<commit_msg>use adjustWeights() method of APerceptron in single perceptron training<commit_after>#ifndef PERCEPTRON_H\n#define PERCEPTRON_H\n\n#include <sstream>\n#include <vector>\n#include <numeric> \/\/ inner_product\n#include <algorithm> \/\/ transform\n#include <functional> \/\/ plus, minus\n#include <assert.h>\n#include <cmath> \/\/ sqrt\n#include <initializer_list>\n#include <iostream> \/\/ cout\n#include <iterator> \/\/ begin, end\n\n\n#include \"randomgen.hh\"\n#include \"classifier.hh\"\n#include \"activation.hh\"\n\n\nusing namespace std;\n\n\nusing epoch_parameter = function<double(int)>;\n\n\nepoch_parameter const_epoch_parameter(double eta) {\n return [eta](int) { return eta; };\n}\n\n\nusing Weights = vector<double>;\n\n\nclass APerceptron {\n \/\/\/ induced local field of activation potential $v_k$, page 11, eq (4)\n \/\/\/\n \/\/\/ $$ v_k = \\sum_{j = 0}^{m} w_{kj} x_j, $$\n \/\/\/\n \/\/\/ where $w_{kj}$ is the weight of the $j$-th input of the neuron $k$,\n \/\/\/ and $x_j$ is the $j$-th input.\n virtual double inducedLocalField(const Input &x) = 0;\n \/\/\/ neuron's output, page 12, eq (5)\n \/\/\/\n \/\/\/ $$ y_k = \\varphi (v_k) $$\n \/\/\/\n \/\/\/ @return the value activation function applied to the induced local field\n virtual double output(const Input &x) = 0;\n \/\/\/ get neuron's weights; weights[0] ($w_{k0}$) is bias\n virtual Weights getWeights() const = 0;\n \/\/\/ add weight correction to the neuron's weights\n virtual Weights adjustWeights(const Weights weightCorrection) = 0;\n};\n\n\n\/\/ TODO: rename to LinearPerceptron\nclass StandalonePerceptron : public APerceptron, public BinaryClassifier {\nprivate:\n \/\/ TODO: use weights[0] as bias\n double bias;\n Weights weights;\n const ActivationFunction &activationFunction;\n\n void trainConverge_addSample(Input input, double output, double eta) {\n double y = this->output(input);\n double xfactor = eta * (output - y);\n Weights deltaW(weights.size() + 1);\n deltaW[0] = xfactor * 1.0; \/\/ bias\n for (size_t i = 0; i < input.size(); ++i) {\n deltaW[i+1] = xfactor * input[i];\n }\n adjustWeights(deltaW);\n }\n\n void trainBatch_addBatch(LabeledDataset batch, double eta) {\n for (auto sample : batch) {\n double desired = sample.label[0]; \/\/ desired output\n Input input = sample.data;\n Weights deltaW(weights.size() + 1);\n deltaW[0] = eta * 1.0 * desired; \/\/ bias\n for (size_t i = 0; i < input.size(); ++i) {\n deltaW[i+1] = eta * input[i] * desired;\n }\n adjustWeights(deltaW);\n }\n }\n\npublic:\n StandalonePerceptron(int n, const ActivationFunction &af = defaultSignum)\n : bias(0), weights(n), activationFunction(af) {}\n\n virtual double inducedLocalField(const Input &x) {\n assert(x.size() == weights.size());\n return inner_product(weights.begin(), weights.end(), begin(x), bias);\n }\n\n virtual double output(const Input &x) {\n return activationFunction(inducedLocalField(x));\n }\n\n virtual vector<double> getWeights() const {\n vector<double> biasAndWeights(weights);\n biasAndWeights.insert(biasAndWeights.begin(), bias);\n return biasAndWeights;\n }\n\n virtual Weights adjustWeights(const Weights weightCorrection) {\n assert(weights.size() == weightCorrection.size()-1);\n assert(weightCorrection.size() > 0);\n bias += weightCorrection[0];\n auto second = ++weightCorrection.begin();\n transform(second, weightCorrection.end(), weights.begin(),\n weights.begin(), [](double w_i, double delta_w) {\n return w_i + delta_w;\n });\n return getWeights();\n }\n\n virtual bool classify(const Input &x) { return output(x) > 0; }\n\n \/\/\/ perceptron convergence algorithm (Table 1.1)\n void trainConverge(const LabeledDataset &trainSet, int epochs,\n double eta = 1.0) {\n return trainConverge(trainSet, epochs, const_epoch_parameter(eta));\n }\n\n \/\/\/ perceptron convergence algorithm (Table 1.1)\n void trainConverge(const LabeledDataset &trainSet, int epochs,\n epoch_parameter eta) {\n assert(trainSet.outputDim() == 1);\n for (int epoch = 0; epoch < epochs; ++epoch) {\n double etaval = eta(epoch);\n for (auto sample : trainSet) {\n trainConverge_addSample(sample.data, sample.label[0], etaval);\n }\n }\n }\n\n \/\/\/ batch-training algorithm (Sec 1.6, Eq. 1.42)\n void trainBatch(const LabeledDataset &trainSet, int epochs, double eta = 1.0) {\n return trainBatch(trainSet, epochs, const_epoch_parameter(eta));\n }\n\n \/\/\/ batch-training algorithm (Sec 1.6, Eq. 1.42)\n void trainBatch(const LabeledDataset &trainSet, int epochs,\n epoch_parameter eta) {\n assert(trainSet.outputDim() == 1);\n assert(trainSet.inputDim() == weights.size());\n \/\/ \\nabla J(w) = \\sum_{\\vec{x}(n) \\in H} ( - \\vec{x}(n) d(n) ) (1.40)\n \/\/ w(n+1) = w(n) - eta(n) \\nabla J(w) (1.42)\n for (int epoch = 0; epoch < epochs; ++epoch) {\n double etaval = eta(epoch);\n \/\/ a new batch\n LabeledDataset misclassifiedSet;\n for (auto sample : trainSet) {\n if (output(sample.data) * sample.label[0] <= 0) {\n misclassifiedSet.append(sample);\n }\n }\n \/\/ sum cost gradient over the entire bactch\n trainBatch_addBatch(misclassifiedSet, etaval);\n }\n }\n\n \/\/ TODO: move to non-member function\n string fmt() {\n ostringstream ss;\n for (auto it : getWeights()) {\n ss << \" \" << it;\n }\n return ss.str();\n }\n};\n\n\n\nostream &operator<<(ostream &out, const vector<double> &xs);\n\n#if 0\n\n\/**\n A basic perceptron, without built-in training facilities, with\n reasonable defaults to be used within `PerceptronsLayers`.\n *\/\nclass BasicPerceptron : public APerceptron {\nprivate:\n Weights weights; \/\/ weights[0] is bias\n const ActivationFunction &activationFunction;\n\n \/\/ remember the last input and internal parameters to use them\n \/\/ again in the back-propagation step\n double lastInducedLocalField; \/\/ v_j = \\sum w_i y_i\n double lastActivationValue; \/\/ y_j = \\phi (v_j)\n double lastActivationGradient; \/\/ y_j = \\phi^\\prime (v_j)\n double lastLocalGradient; \/\/ delta_j = \\phi^\\prime(v_j) e_j\n\npublic:\n BasicPerceptron(int n, const ActivationFunction &af = defaultTanh)\n : weights(n + 1), activationFunction(af) {}\n\n \/\/ one-sided Xavier initialization\n \/\/ see http:\/\/andyljones.tumblr.com\/post\/110998971763\/\n void init(unique_ptr<rng_type> &rng) {\n int n_in = weights.size()-1;\n double sigma = n_in > 0 ? sqrt(1.0\/n_in) : 1.0;\n uniform_real_distribution<double> nd(-sigma, sigma);\n generate(weights.begin(), weights.end(), [&nd, &rng] {\n double w = nd(*rng.get());\n return w;\n });\n }\n\n virtual double inducedLocalField(const Input &x) {\n double bias = weights[0];\n auto weights_2nd = next(weights.begin());\n return inner_product(weights_2nd, weights.end(), x.begin(), bias);\n }\n\n virtual double output(const Input &x) {\n double v = inducedLocalField(x);\n lastInducedLocalField = v;\n lastActivationValue = activationFunction(v);\n lastActivationGradient = activationFunction.derivative(v);\n return lastActivationValue;\n }\n\n virtual Weights getWeights() const {\n return weights;\n }\n\n void adjustWeights(Weights deltaW) {\n assert(deltaW.size() == weights.size());\n for (size_t i = 0; i < weights.size(); ++i) {\n weights[i] += deltaW[i];\n }\n }\n\n struct BPResult {\n Weights weightCorrection;\n double localGradient;\n };\n\n \/\/ Page 134. Equation (4.27) defines weight correction\n \/\/\n \/\/ $$ \\Delta w_{ji} (n) =\n \/\/ \\eta\n \/\/ \\times\n \/\/ \\delta_j (n)\n \/\/ \\times\n \/\/ y_{i} (n) $$\n \/\/\n \/\/ where $w_{ji}$ is the synaptic weight connecting neuron $i$ to neuron $j$,\n \/\/ $\\eta$ is learning rate, $delta_j (n)$ is the local [error] gradient,\n \/\/ $y_{i}$ is the input signal of the neuron $i$, $n$ is the epoch number\n \/\/\n \/\/ The local gradient is the product of the activation function derivative\n \/\/ and the error signal.\n \/\/\n \/\/ Return a vector of weight corrections and the local gradient value.\n \/\/\n \/\/ The method should be called _after_ `forwardPass`\n BPResult backwardPass(const Input &inputs, double errorSignal,\n double learningRate) {\n assert(inputs.size() + 1 == weights.size());\n size_t nInputs = weights.size();\n double localGradient = lastActivationGradient * errorSignal;\n double multiplier = learningRate * localGradient;\n Weights delta_W(nInputs, multiplier);\n for (size_t i = 0; i < inputs.size(); ++i) {\n delta_W[i + 1] *= inputs[i];\n }\n lastLocalGradient = localGradient;\n return BPResult{delta_W, localGradient};\n }\n};\n\n\n\/\/\/ A fully connected layer of perceptrons.\nclass PerceptronsLayer {\nprivate:\n unsigned int nInputs;\n unsigned int nNeurons;\n vector<BasicPerceptron> neurons;\n Output lastOutput;\n\npublic:\n PerceptronsLayer(unsigned int nInputs = 0, unsigned int nOutputs = 0,\n const ActivationFunction &af = defaultTanh)\n : nInputs(nInputs), nNeurons(nOutputs),\n neurons(nOutputs, BasicPerceptron(nInputs, af)),\n lastOutput(nOutputs) {}\n\n void init(unique_ptr<rng_type> &rng) {\n for (size_t i = 0; i < neurons.size(); ++i) {\n neurons[i].init(rng);\n }\n }\n\n void adjustWeights(vector<Weights> weightDeltas) {\n assert(nNeurons == weightDeltas.size());\n for (size_t i = 0; i < neurons.size(); ++i) {\n neurons[i].adjustWeights(weightDeltas[i]);\n }\n }\n\n \/\/ Pages 132-133.\n \/\/ Return a vector of outputs.\n Output forwardPass(const Input &inputs) {\n for (auto i = 0u; i < nNeurons; ++i) {\n lastOutput[i] = neurons[i].output(inputs);\n }\n return lastOutput;\n }\n\n struct BPResult {\n Output propagatedErrorSignals;\n vector<Weights> weightCorrections;\n };\n\n \/\/ Page 134. Calculate back-propagated error signal and corrections to\n \/\/ synaptic weights.\n \/\/\n \/\/ $$ e_j = \\sum_k \\delta_k w_{kj} $$\n \/\/\n \/\/ where $e_j$ is an error propagated from all downstream neurons to the\n \/\/ neuron $j$, $\\delta_k$ is the local gradient of the downstream neurons\n \/\/ $k$, $w_{kj}$ is the synaptic weight of the $j$-th input of the\n \/\/ downstream neuron $k$.\n \/\/\n \/\/ The method should be called _after_ `forwardPass`\n BPResult backwardPass(const Input &inputs, const Output &errorSignals,\n double learningRate) {\n assert(errorSignals.size() == neurons.size());\n auto eta = learningRate;\n vector<Weights> weightDeltas(0);\n Weights propagatedErrorSignals(nInputs, 0.0);\n for (auto k = 0u; k < nNeurons; ++k) {\n auto error_k = errorSignals[k];\n auto r = neurons[k].backwardPass(inputs, error_k, eta);\n Weights delta_Wk = r.weightCorrection;\n double delta_k = r.localGradient;\n Weights Wk = neurons[k].getWeights();\n for (auto j = 0u; j < nInputs; ++j) {\n propagatedErrorSignals[j] += delta_k * Wk[j + 1];\n }\n weightDeltas.push_back(delta_Wk);\n }\n return BPResult{propagatedErrorSignals, weightDeltas};\n }\n\n friend ostream &operator<<(ostream &out, const PerceptronsLayer &net);\n};\n\n\n\/\/\/ Multiple layers of perceptrons stack one upon another.\n\/\/ TODO: rename to MultilayerPerceptron\nclass PerceptronsNetwork {\nprivate:\n vector<PerceptronsLayer> layers;\n vector<Input> layersInputs;\n\npublic:\n PerceptronsNetwork(initializer_list<unsigned int> shape,\n const ActivationFunction &af = defaultTanh)\n : layers(0), layersInputs(0) {\n auto pIn = shape.begin();\n auto pOut = next(pIn);\n for (; pOut != shape.end(); ++pIn, ++pOut) {\n PerceptronsLayer layer(*pIn, *pOut, af);\n layers.push_back(layer);\n }\n }\n\n void init(unique_ptr<rng_type> &rng) {\n for (auto i = 0u; i < layers.size(); ++i) {\n layers[i].init(rng);\n }\n }\n\n Output forwardPass(const Input &inputs) {\n layersInputs.clear();\n layersInputs.push_back(inputs);\n for (auto i = 0u; i < layers.size(); ++i) {\n auto in = layersInputs[i];\n auto out = layers[i].forwardPass(in);\n layersInputs.push_back(out);\n }\n return layersInputs[layers.size()];\n }\n\n PerceptronsLayer::BPResult\n backwardPass(const Output &errorSignals, double learningRate) {\n Output err(errorSignals);\n PerceptronsLayer::BPResult r;\n\n for (int i = layers.size()-1; i >= 0; --i) {\n auto layerIn = layersInputs[i];\n r = layers[i].backwardPass(layerIn, err, learningRate);\n layers[i].adjustWeights(r.weightCorrections);\n err = r.propagatedErrorSignals;\n }\n return r;\n }\n\n friend ostream &operator<<(ostream &out, const PerceptronsNetwork &net);\n};\n\n\nostream &operator<<(ostream &out, const PerceptronsLayer &layer) {\n size_t n = layer.neurons.size();\n for (size_t j = 0; j < n; ++j) {\n if (j == 0) {\n out << \"[\";\n } else {\n out << \" \";\n }\n out << layer.neurons[j].getWeights();\n if (j >= n - 1) {\n out << \"]\";\n } else {\n out << \",\\n\";\n }\n }\n return out;\n}\n\n\nostream &operator<<(ostream &out, const PerceptronsNetwork &net) {\n for (PerceptronsLayer l : net.layers) {\n out << l << \"\\n\";\n }\n return out;\n}\n\n\nostream &operator<<(ostream &out, const vector<double> &xs) {\n int n = xs.size();\n out << \"[ \";\n for (int i = 0; i < n - 1; ++i) {\n out << xs[i] << \", \";\n }\n out << xs[n - 1] << \" ]\";\n return out;\n}\n\n#endif\n\n#endif \/* PERCEPTRON_H *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"base.hpp\"\n#include \"ButtonStatus.hpp\"\n#include \"Client.hpp\"\n#include \"CommonData.hpp\"\n#include \"Config.hpp\"\n#include \"Core.hpp\"\n#include \"RemapClass.hpp\"\n#include \"remap.hpp\"\n#include \"util\/CallBackWrapper.hpp\"\n#include \"util\/EventInputQueue.hpp\"\n#include \"util\/EventOutputQueue.hpp\"\n#include \"util\/EventWatcher.hpp\"\n#include \"util\/KeyboardRepeat.hpp\"\n#include \"util\/ListHookedConsumer.hpp\"\n#include \"util\/ListHookedKeyboard.hpp\"\n#include \"util\/ListHookedPointing.hpp\"\n#include \"util\/NumHeldDownKeys.hpp\"\n#include \"util\/PressDownKeys.hpp\"\n#include \"util\/TimerWrapper.hpp\"\n#include \"RemapFunc\/HoldingKeyToKey.hpp\"\n#include \"RemapFunc\/KeyOverlaidModifier.hpp\"\n#include \"VirtualKey.hpp\"\n\n#include <sys\/errno.h>\n#include <IOKit\/IOWorkLoop.h>\n#include <IOKit\/IOTimerEventSource.h>\n\nnamespace org_pqrs_KeyRemap4MacBook {\n namespace Core {\n namespace {\n IOWorkLoop* workLoop = NULL;\n TimerWrapper timer_refresh;\n\n \/\/ ------------------------------------------------------------\n enum {\n REFRESH_DEVICE_INTERVAL = 3000,\n };\n\n void\n refreshHookedDevice(OSObject* owner, IOTimerEventSource* sender)\n {\n IOLockWrapper::ScopedLock lk(timer_refresh.getlock());\n\n ListHookedKeyboard::instance().refresh_callback();\n ListHookedConsumer::instance().refresh_callback();\n ListHookedPointing::instance().refresh_callback();\n\n timer_refresh.setTimeoutMS(REFRESH_DEVICE_INTERVAL);\n }\n }\n\n void\n start(void)\n {\n EventWatcher::initialize();\n PressDownKeys::initialize();\n FlagStatus::initialize();\n ButtonStatus::initialize();\n KeyRemap4MacBook_client::initialize();\n CommonData::initialize();\n\n ListHookedKeyboard::instance().initialize();\n ListHookedConsumer::instance().initialize();\n ListHookedPointing::instance().initialize();\n\n workLoop = IOWorkLoop::workLoop();\n if (! workLoop) {\n IOLOG_ERROR(\"IOWorkLoop::workLoop failed\\n\");\n } else {\n timer_refresh.initialize(workLoop, NULL, refreshHookedDevice);\n timer_refresh.setTimeoutMS(REFRESH_DEVICE_INTERVAL);\n\n RemapClassManager::initialize(*workLoop);\n KeyboardRepeat::initialize(*workLoop);\n EventInputQueue::initialize(*workLoop);\n VirtualKey::initialize(*workLoop);\n EventOutputQueue::initialize(*workLoop);\n RemapFunc::HoldingKeyToKey::static_initialize(*workLoop);\n RemapFunc::KeyOverlaidModifier::static_initialize(*workLoop);\n }\n\n sysctl_register();\n }\n\n void\n stop(void)\n {\n sysctl_unregister();\n\n timer_refresh.terminate();\n ListHookedKeyboard::instance().terminate();\n ListHookedConsumer::instance().terminate();\n ListHookedPointing::instance().terminate();\n RemapClassManager::terminate();\n KeyboardRepeat::terminate();\n EventInputQueue::terminate();\n VirtualKey::terminate();\n EventOutputQueue::terminate();\n RemapFunc::HoldingKeyToKey::static_terminate();\n RemapFunc::KeyOverlaidModifier::static_terminate();\n\n if (workLoop) {\n workLoop->release();\n workLoop = NULL;\n }\n\n CommonData::terminate();\n KeyRemap4MacBook_client::terminate();\n EventWatcher::terminate();\n PressDownKeys::terminate();\n }\n\n \/\/ ======================================================================\n bool\n notifierfunc_hookKeyboard(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_hookKeyboard newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIDevice, newService);\n if (! device) return false;\n if (! OSDynamicCast(IOHIKeyboard, device)) return false;\n\n ListHookedKeyboard::instance().push_back(new ListHookedKeyboard::Item(device));\n ListHookedConsumer::instance().push_back(new ListHookedConsumer::Item(device));\n return true;\n }\n\n bool\n notifierfunc_unhookKeyboard(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_unhookKeyboard newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIDevice, newService);\n if (! device) return false;\n if (! OSDynamicCast(IOHIKeyboard, device)) return false;\n\n ListHookedKeyboard::instance().erase(device);\n ListHookedConsumer::instance().erase(device);\n return true;\n }\n\n bool\n notifierfunc_hookPointing(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_hookPointing newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIDevice, newService);\n if (! device) return false;\n if (! OSDynamicCast(IOHIPointing, device)) return false;\n\n ListHookedPointing::instance().push_back(new ListHookedPointing::Item(device));\n return true;\n }\n\n bool\n notifierfunc_unhookPointing(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_unhookPointing newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIDevice, newService);\n if (! device) return false;\n if (! OSDynamicCast(IOHIPointing, device)) return false;\n\n ListHookedPointing::instance().erase(device);\n return true;\n }\n\n \/\/ ======================================================================\n void\n remap_KeyboardEventCallback(Params_KeyboardEventCallBack& params)\n {\n params.log();\n\n \/\/ ------------------------------------------------------------\n RemapParams remapParams(params);\n\n \/\/ ------------------------------------------------------------\n FlagStatus::set(params.key, params.flags);\n\n RemapClassManager::remap_key(remapParams);\n\n \/\/ ------------------------------------------------------------\n if (! remapParams.isremapped) {\n params.flags = FlagStatus::makeFlags();\n KeyboardRepeat::set(params);\n EventOutputQueue::FireKey::fire(params);\n }\n\n if (NumHeldDownKeys::iszero()) {\n NumHeldDownKeys::reset();\n KeyboardRepeat::cancel();\n EventWatcher::reset();\n FlagStatus::reset();\n ButtonStatus::reset();\n EventOutputQueue::FireModifiers::fire(FlagStatus::makeFlags());\n EventOutputQueue::FireRelativePointer::fire();\n PressDownKeys::clear();\n }\n }\n\n void\n remap_KeyboardSpecialEventCallback(Params_KeyboardSpecialEventCallback& params)\n {\n params.log();\n\n RemapConsumerParams remapParams(params);\n\n \/\/ ------------------------------------------------------------\n RemapClassManager::remap_consumer(remapParams);\n\n \/\/ ----------------------------------------\n if (! remapParams.isremapped) {\n params.flags = FlagStatus::makeFlags();\n KeyboardRepeat::set(params);\n EventOutputQueue::FireConsumer::fire(params);\n }\n }\n\n void\n remap_RelativePointerEventCallback(Params_RelativePointerEventCallback& params)\n {\n params.log();\n\n RemapPointingParams_relative remapParams(params);\n\n ButtonStatus::set(params.ex_button, params.ex_isbuttondown);\n\n RemapClassManager::remap_pointing(remapParams);\n\n \/\/ ------------------------------------------------------------\n if (! remapParams.isremapped) {\n EventOutputQueue::FireRelativePointer::fire(ButtonStatus::makeButtons(), params.dx, params.dy);\n }\n }\n\n void\n remap_ScrollWheelEventCallback(Params_ScrollWheelEventCallback& params)\n {\n params.log();\n EventOutputQueue::FireScrollWheel::fire(params);\n }\n }\n}\n<commit_msg>update Core.cpp around ListHooked*<commit_after>#include \"base.hpp\"\n#include \"ButtonStatus.hpp\"\n#include \"Client.hpp\"\n#include \"CommonData.hpp\"\n#include \"Config.hpp\"\n#include \"Core.hpp\"\n#include \"RemapClass.hpp\"\n#include \"remap.hpp\"\n#include \"util\/CallBackWrapper.hpp\"\n#include \"util\/EventInputQueue.hpp\"\n#include \"util\/EventOutputQueue.hpp\"\n#include \"util\/EventWatcher.hpp\"\n#include \"util\/KeyboardRepeat.hpp\"\n#include \"util\/ListHookedConsumer.hpp\"\n#include \"util\/ListHookedKeyboard.hpp\"\n#include \"util\/ListHookedPointing.hpp\"\n#include \"util\/NumHeldDownKeys.hpp\"\n#include \"util\/PressDownKeys.hpp\"\n#include \"util\/TimerWrapper.hpp\"\n#include \"RemapFunc\/HoldingKeyToKey.hpp\"\n#include \"RemapFunc\/KeyOverlaidModifier.hpp\"\n#include \"VirtualKey.hpp\"\n\n#include <sys\/errno.h>\n#include <IOKit\/IOWorkLoop.h>\n#include <IOKit\/IOTimerEventSource.h>\n\nnamespace org_pqrs_KeyRemap4MacBook {\n namespace Core {\n namespace {\n IOWorkLoop* workLoop = NULL;\n TimerWrapper timer_refresh;\n\n \/\/ ------------------------------------------------------------\n enum {\n REFRESH_DEVICE_INTERVAL = 3000,\n };\n\n void\n refreshHookedDevice(OSObject* owner, IOTimerEventSource* sender)\n {\n IOLockWrapper::ScopedLock lk(timer_refresh.getlock());\n\n ListHookedKeyboard::instance().refresh_callback();\n ListHookedConsumer::instance().refresh_callback();\n ListHookedPointing::instance().refresh_callback();\n\n timer_refresh.setTimeoutMS(REFRESH_DEVICE_INTERVAL);\n }\n }\n\n void\n start(void)\n {\n EventWatcher::initialize();\n PressDownKeys::initialize();\n FlagStatus::initialize();\n ButtonStatus::initialize();\n KeyRemap4MacBook_client::initialize();\n CommonData::initialize();\n\n ListHookedKeyboard::instance().initialize();\n ListHookedConsumer::instance().initialize();\n ListHookedPointing::instance().initialize();\n\n workLoop = IOWorkLoop::workLoop();\n if (! workLoop) {\n IOLOG_ERROR(\"IOWorkLoop::workLoop failed\\n\");\n } else {\n timer_refresh.initialize(workLoop, NULL, refreshHookedDevice);\n timer_refresh.setTimeoutMS(REFRESH_DEVICE_INTERVAL);\n\n RemapClassManager::initialize(*workLoop);\n KeyboardRepeat::initialize(*workLoop);\n EventInputQueue::initialize(*workLoop);\n VirtualKey::initialize(*workLoop);\n EventOutputQueue::initialize(*workLoop);\n RemapFunc::HoldingKeyToKey::static_initialize(*workLoop);\n RemapFunc::KeyOverlaidModifier::static_initialize(*workLoop);\n }\n\n sysctl_register();\n }\n\n void\n stop(void)\n {\n sysctl_unregister();\n\n timer_refresh.terminate();\n ListHookedKeyboard::instance().terminate();\n ListHookedConsumer::instance().terminate();\n ListHookedPointing::instance().terminate();\n RemapClassManager::terminate();\n KeyboardRepeat::terminate();\n EventInputQueue::terminate();\n VirtualKey::terminate();\n EventOutputQueue::terminate();\n RemapFunc::HoldingKeyToKey::static_terminate();\n RemapFunc::KeyOverlaidModifier::static_terminate();\n\n if (workLoop) {\n workLoop->release();\n workLoop = NULL;\n }\n\n CommonData::terminate();\n KeyRemap4MacBook_client::terminate();\n EventWatcher::terminate();\n PressDownKeys::terminate();\n }\n\n \/\/ ======================================================================\n bool\n notifierfunc_hookKeyboard(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_hookKeyboard newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIKeyboard, newService);\n if (! device) return false;\n\n ListHookedKeyboard::instance().push_back(new ListHookedKeyboard::Item(device));\n ListHookedConsumer::instance().push_back(new ListHookedConsumer::Item(device));\n return true;\n }\n\n bool\n notifierfunc_unhookKeyboard(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_unhookKeyboard newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIKeyboard, newService);\n if (! device) return false;\n\n ListHookedKeyboard::instance().erase(device);\n ListHookedConsumer::instance().erase(device);\n return true;\n }\n\n bool\n notifierfunc_hookPointing(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_hookPointing newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIPointing, newService);\n if (! device) return false;\n\n ListHookedPointing::instance().push_back(new ListHookedPointing::Item(device));\n return true;\n }\n\n bool\n notifierfunc_unhookPointing(void* target, void* refCon, IOService* newService, IONotifier* notifier)\n {\n IOLOG_INFO(\"notifierfunc_unhookPointing newService:%p\\n\", newService);\n\n IOHIDevice* device = OSDynamicCast(IOHIPointing, newService);\n if (! device) return false;\n\n ListHookedPointing::instance().erase(device);\n return true;\n }\n\n \/\/ ======================================================================\n void\n remap_KeyboardEventCallback(Params_KeyboardEventCallBack& params)\n {\n params.log();\n\n \/\/ ------------------------------------------------------------\n RemapParams remapParams(params);\n\n \/\/ ------------------------------------------------------------\n FlagStatus::set(params.key, params.flags);\n\n RemapClassManager::remap_key(remapParams);\n\n \/\/ ------------------------------------------------------------\n if (! remapParams.isremapped) {\n params.flags = FlagStatus::makeFlags();\n KeyboardRepeat::set(params);\n EventOutputQueue::FireKey::fire(params);\n }\n\n if (NumHeldDownKeys::iszero()) {\n NumHeldDownKeys::reset();\n KeyboardRepeat::cancel();\n EventWatcher::reset();\n FlagStatus::reset();\n ButtonStatus::reset();\n EventOutputQueue::FireModifiers::fire(FlagStatus::makeFlags());\n EventOutputQueue::FireRelativePointer::fire();\n PressDownKeys::clear();\n }\n }\n\n void\n remap_KeyboardSpecialEventCallback(Params_KeyboardSpecialEventCallback& params)\n {\n params.log();\n\n RemapConsumerParams remapParams(params);\n\n \/\/ ------------------------------------------------------------\n RemapClassManager::remap_consumer(remapParams);\n\n \/\/ ----------------------------------------\n if (! remapParams.isremapped) {\n params.flags = FlagStatus::makeFlags();\n KeyboardRepeat::set(params);\n EventOutputQueue::FireConsumer::fire(params);\n }\n }\n\n void\n remap_RelativePointerEventCallback(Params_RelativePointerEventCallback& params)\n {\n params.log();\n\n RemapPointingParams_relative remapParams(params);\n\n ButtonStatus::set(params.ex_button, params.ex_isbuttondown);\n\n RemapClassManager::remap_pointing(remapParams);\n\n \/\/ ------------------------------------------------------------\n if (! remapParams.isremapped) {\n EventOutputQueue::FireRelativePointer::fire(ButtonStatus::makeButtons(), params.dx, params.dy);\n }\n }\n\n void\n remap_ScrollWheelEventCallback(Params_ScrollWheelEventCallback& params)\n {\n params.log();\n EventOutputQueue::FireScrollWheel::fire(params);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/#undef NDEBUG\n#include <cassert>\n#include <cstddef>\n#include <stdio.h>\n\n#include \"ctlr\/ctlr.h\"\n#include \"benchmark\/benchmark.h\"\n\nstatic uint32_t counter;\nstatic struct ctlr_dev_t* dev;\n\nstatic void clobber()\n{\n\tasm volatile(\"\" : : : \"memory\");\n}\nstatic void escape(void *p)\n{\n\tasm volatile(\"\" : : \"g\"(p) : \"memory\");\n}\n\nvoid perf_event_empty(struct ctlr_dev_t* dev,\n uint32_t num_events,\n struct ctlr_event_t** events,\n void *userdata)\n{\n\tcounter++;\n}\n\nvoid perf_event_switch(struct ctlr_dev_t* dev,\n uint32_t num_events,\n struct ctlr_event_t** events,\n void *userdata)\n{\n\tfor(uint32_t i = 0; i < num_events; i++) {\n\t\tstruct ctlr_event_t *e = events[i];\n\t\tswitch(e->type) {\n\t\tcase CTLR_EVENT_BUTTON:\n\t\t\tbreak;\n\t\tcase CTLR_EVENT_ENCODER:\n\t\t\tbreak;\n\t\tcase CTLR_EVENT_GRID:\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t};\n\t}\n\tcounter++;\n}\n\nvoid ctlr_dev_empty(benchmark::State& state)\n{\n\tdev = ctlr_dev_connect(CTLR_DEV_NI_MASCHINE_MIKRO_MK2, perf_event_empty, 0, 0);\n\tcounter = 0;\n\twhile (state.KeepRunning()) {\n\t\tctlr_dev_poll(dev);\n\t}\n\tctlr_dev_disconnect(dev);\n}\n\nvoid ctlr_dev_switch(benchmark::State& state)\n{\n\tdev = ctlr_dev_connect(CTLR_DEV_NI_MASCHINE_MIKRO_MK2, perf_event_switch, 0, 0);\n\tcounter = 0;\n\twhile (state.KeepRunning()) {\n\t\tctlr_dev_poll(dev);\n\t}\n\tctlr_dev_disconnect(dev);\n}\n\nBENCHMARK(ctlr_dev_empty);\nBENCHMARK(ctlr_dev_switch);\n\nBENCHMARK_MAIN()\n<commit_msg>remove unused old code<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012-2020 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/dbartolini\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"core\/math\/math.h\"\n#include \"core\/math\/types.h\"\n#include \"core\/types.h\"\n#include <math.h>\n#include <stdio.h> \/\/ snprintf\n\nnamespace crown\n{\nbool fequal(f32 a, f32 b, f32 epsilon)\n{\n\treturn b <= (a + epsilon)\n\t\t&& b >= (a - epsilon)\n\t\t;\n}\n\nf32 ffract(f32 a)\n{\n\treturn a - floorf(a);\n}\n\nf32 fabs(f32 a)\n{\n\treturn ::fabsf(a);\n}\n\nf32 fsin(f32 a)\n{\n\treturn sinf(a);\n}\n\nf32 fcos(f32 a)\n{\n\treturn cosf(a);\n}\n\nf32 facos(f32 a)\n{\n\treturn ::acosf(a);\n}\n\nf32 ftan(f32 a)\n{\n\treturn tanf(a);\n}\n\nf32 fsqrt(f32 a)\n{\n\treturn sqrtf(a);\n}\n\nf32 frad(f32 deg)\n{\n\treturn deg * PI \/ 180.0f;\n}\n\nf32 fdeg(f32 rad)\n{\n\treturn rad * 180.0f \/ PI;\n}\n\nf32 lerp(const f32 p0, const f32 p1, f32 t)\n{\n\treturn (1.0f - t) * p0 + t * p1;\n}\n\nf32 cosine(const f32 p0, const f32 p1, f32 t)\n{\n\tconst f32 f = t * PI;\n\tconst f32 g = (1.0f - fcos(f)) * 0.5f;\n\n\treturn p0 + g * (p1 - p0);\n}\n\nf32 cubic(const f32 p0, const f32 p1, f32 t)\n{\n\tconst f32 tt = t * t;\n\tconst f32 ttt = tt * t;\n\n\treturn p0 * (2.0f * ttt - 3.0f * tt + 1.0f) + p1 * (3.0f * tt - 2.0f * ttt);\n}\n\nf32 bezier(const f32 p0, const f32 p1, const f32 p2, const f32 p3, f32 t)\n{\n\tconst f32 u = 1.0f - t;\n\tconst f32 tt = t * t ;\n\tconst f32 uu = u * u;\n\tconst f32 uuu = uu * u;\n\tconst f32 ttt = tt * t;\n\n\tconst f32 tmp = (uuu * p0)\n\t\t+ (3.0f * uu * t * p1)\n\t\t+ (3.0f * u * tt * p2)\n\t\t+ (ttt * p3);\n\n\treturn tmp;\n}\n\nf32 catmull_rom(const f32 p0, const f32 p1, const f32 p2, const f32 p3, f32 t)\n{\n\tconst f32 tt = t * t;\n\tconst f32 ttt = tt * t;\n\n\tconst f32 tmp = (2.0f * p1)\n\t\t+ (-p0 + p2) * t\n\t\t+ ((2.0f * p0) - (5.0f * p1) + (4.0f * p2) - p3) * tt\n\t\t+ (-p0 + (3.0f * p1) + (-3.0f * p2) + p3) * ttt;\n\n\treturn tmp * 0.5f;\n}\n\nconst char* to_string(const Vector3& v, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"%.4f %.4f %.4f\", v.x, v.y, v.z);\n\treturn buf;\n}\n\nconst char* to_string(const Vector4& v, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"%.4f, %.4f, %.4f, %.4f\", v.x, v.y, v.z, v.w);\n\treturn buf;\n}\n\nconst char* to_string(const Quaternion& q, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"%.4f %.4f %.4f %.4f\", q.x, q.y, q.z, q.w);\n\treturn buf;\n}\n\nconst char* to_string(const Matrix4x4& m, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len,\n\t\t\"%.4f, %.4f, %.4f, %.4f\\n\"\n\t\t\"%.4f, %.4f, %.4f, %.4f\\n\"\n\t\t\"%.4f, %.4f, %.4f, %.4f\\n\"\n\t\t\"%.4f, %.4f, %.4f, %.4f\"\n\t\t, m.x.x, m.x.y, m.x.z, m.y.w\n\t\t, m.y.x, m.y.y, m.y.z, m.y.w\n\t\t, m.z.x, m.z.y, m.z.z, m.z.w\n\t\t, m.t.x, m.t.y, m.t.z, m.t.w\n\t\t);\n\treturn buf;\n}\n\n} \/\/ namespace crown\n<commit_msg>core: cleanup<commit_after>\/*\n * Copyright (c) 2012-2020 Daniele Bartolini and individual contributors.\n * License: https:\/\/github.com\/dbartolini\/crown\/blob\/master\/LICENSE\n *\/\n\n#include \"core\/math\/math.h\"\n#include \"core\/math\/types.h\"\n#include \"core\/types.h\"\n#include <math.h>\n#include <stdio.h> \/\/ snprintf\n\nnamespace crown\n{\nbool fequal(f32 a, f32 b, f32 epsilon)\n{\n\treturn b <= (a + epsilon)\n\t\t&& b >= (a - epsilon)\n\t\t;\n}\n\nf32 ffract(f32 a)\n{\n\treturn a - floorf(a);\n}\n\nf32 fabs(f32 a)\n{\n\treturn ::fabsf(a);\n}\n\nf32 fsin(f32 a)\n{\n\treturn sinf(a);\n}\n\nf32 fcos(f32 a)\n{\n\treturn cosf(a);\n}\n\nf32 facos(f32 a)\n{\n\treturn ::acosf(a);\n}\n\nf32 ftan(f32 a)\n{\n\treturn tanf(a);\n}\n\nf32 fsqrt(f32 a)\n{\n\treturn sqrtf(a);\n}\n\nf32 frad(f32 deg)\n{\n\treturn deg * PI \/ 180.0f;\n}\n\nf32 fdeg(f32 rad)\n{\n\treturn rad * 180.0f \/ PI;\n}\n\nf32 lerp(const f32 p0, const f32 p1, f32 t)\n{\n\treturn (1.0f - t) * p0 + t * p1;\n}\n\nf32 cosine(const f32 p0, const f32 p1, f32 t)\n{\n\tconst f32 f = t * PI;\n\tconst f32 g = (1.0f - fcos(f)) * 0.5f;\n\n\treturn p0 + g * (p1 - p0);\n}\n\nf32 cubic(const f32 p0, const f32 p1, f32 t)\n{\n\tconst f32 tt = t * t;\n\tconst f32 ttt = tt * t;\n\n\treturn p0 * (2.0f * ttt - 3.0f * tt + 1.0f) + p1 * (3.0f * tt - 2.0f * ttt);\n}\n\nf32 bezier(const f32 p0, const f32 p1, const f32 p2, const f32 p3, f32 t)\n{\n\tconst f32 u = 1.0f - t;\n\tconst f32 tt = t * t ;\n\tconst f32 uu = u * u;\n\tconst f32 uuu = uu * u;\n\tconst f32 ttt = tt * t;\n\n\tconst f32 tmp = (uuu * p0)\n\t\t+ (3.0f * uu * t * p1)\n\t\t+ (3.0f * u * tt * p2)\n\t\t+ (ttt * p3);\n\n\treturn tmp;\n}\n\nf32 catmull_rom(const f32 p0, const f32 p1, const f32 p2, const f32 p3, f32 t)\n{\n\tconst f32 tt = t * t;\n\tconst f32 ttt = tt * t;\n\n\tconst f32 tmp = (2.0f * p1)\n\t\t+ (-p0 + p2) * t\n\t\t+ ((2.0f * p0) - (5.0f * p1) + (4.0f * p2) - p3) * tt\n\t\t+ (-p0 + (3.0f * p1) + (-3.0f * p2) + p3) * ttt;\n\n\treturn tmp * 0.5f;\n}\n\nconst char* to_string(const Vector3& v, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"( %.4f, %.4f, %.4f )\", v.x, v.y, v.z);\n\treturn buf;\n}\n\nconst char* to_string(const Vector4& v, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"( %.4f, %.4f, %.4f, %.4f )\", v.x, v.y, v.z, v.w);\n\treturn buf;\n}\n\nconst char* to_string(const Quaternion& q, char* buf, u32 buf_len)\n{\n\tsnprintf(buf, buf_len, \"( %.4f, %.4f, %.4f, %.4f )\", q.x, q.y, q.z, q.w);\n\treturn buf;\n}\n\nconst char* to_string(const Matrix4x4& m, char* buf, u32 buf_len)\n{\n\tchar bufx[256];\n\tchar bufy[256];\n\tchar bufz[256];\n\tchar bufw[256];\n\tsnprintf(buf, buf_len,\n\t\t\"( %s, %s, %s, %s )\"\n\t\t, to_string(m.x, bufx, sizeof(bufx))\n\t\t, to_string(m.y, bufy, sizeof(bufy))\n\t\t, to_string(m.z, bufz, sizeof(bufz))\n\t\t, to_string(m.t, bufw, sizeof(bufw))\n\t\t);\n\treturn buf;\n}\n\n} \/\/ namespace crown\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * \\file dense_matrix_product.cpp\n * \\brief Function used to carry out a dense matrix multiplication.\n * \\author E. van der Weide\n * \\version 4.3.0 \"Cardinal\"\n *\n * SU2 Lead Developers: Dr. Francisco Palacios (Francisco.D.Palacios@boeing.com).\n * Dr. Thomas D. Economon (economon@stanford.edu).\n *\n * SU2 Developers: Prof. Juan J. Alonso's group at Stanford University.\n * Prof. Piero Colonna's group at Delft University of Technology.\n * Prof. Nicolas R. Gauger's group at Kaiserslautern University of Technology.\n * Prof. Alberto Guardone's group at Polytechnic University of Milan.\n * Prof. Rafael Palacios' group at Imperial College London.\n *\n * Copyright (C) 2012-2016 SU2, the open-source CFD code.\n *\n * SU2 is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * SU2 is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with SU2. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"..\/include\/dense_matrix_product.hpp\"\n#include <cstring>\n\nusing namespace std;\n\n#if !defined(HAVE_LIBXSMM) && !defined(HAVE_CBLAS) && !defined(HAVE_MKL)\n\n\/*--- Create an unnamed namespace to keep the functions for the\n native implementation of the matrix product local. ---*\/\nnamespace {\n\n\/* Macros for accessing submatrices of a matmul using the leading dimension. *\/\n#define A(i, j) a[(j)*lda + (i)]\n#define B(i, j) b[(j)*ldb + (i)]\n#define C(i, j) c[(j)*ldc + (i)]\n\n\/* Naive gemm implementation to handle arbitrary sized matrices. *\/\nvoid gemm_arbitrary(int m, int n, int k, const su2double *a, int lda,\n const su2double *b, int ldb, su2double *c, int ldc) {\n\n \/* The order of these loops is tuned for column-major matrices. *\/\n for (int p = 0; p < k; p++) {\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n C(i, j) += A(i, p) * B(p, j);\n }\n }\n }\n}\n\n\/* Local implementation of the matrix multiplication. *\/\nvoid su2_gemm(const int m, const int n, const int k,\n const su2double *a, const su2double *b, su2double *c) {\n\n \/* Initialize the elements of c to zero. *\/\n memset(c, 0, m*n*sizeof(su2double));\n\n \/* Set the leading dimensions of the three matrices. *\/\n const int lda = m;\n const int ldb = k;\n const int ldc = m;\n\n \/* Call gemm_arbitrary to do the actual job. *\/\n gemm_arbitrary(m, n, k, a, lda, b, ldb, c, ldc);\n}\n\n#undef C\n#undef B\n#undef A\n\n} \/* namespace *\/\n\n#endif\n\n\/*--- The actual function to carry out the dense matrix product. ---*\/\n\nvoid DenseMatrixProduct(const int M, const int N, const int K,\n const su2double *A, const su2double *B, su2double *C) {\n\n#ifdef HAVE_LIBXSMM\n\n \/* The gemm function of libxsmm is used to carry out the multiplication.\n Note that libxsmm_gemm expects the matrices in column major order. That's\n why the calling sequence is different from cblas_dgemm. *\/\n libxsmm_gemm(NULL, NULL, N, M, K, NULL, B, NULL, A, NULL, NULL, C, NULL);\n\n#elif defined (HAVE_CBLAS) || defined(HAVE_MKL)\n\n \/* The standard blas routine dgemm is used for the multiplication. *\/\n cblas_dgemm(CblasRowMajor, CblasNoTrans, CblasNoTrans, M, N, K,\n 1.0, A, K, B, N, 0.0, C, N);\n#else\n\n \/* Native implementation of the matrix product. This optimized implementation\n assumes that the matrices are in column major order. This can be\n accomplished by swapping N and M and A and B. This implementation is based\n on https:\/\/github.com\/flame\/how-to-optimize-gemm. *\/\n su2_gemm(N, M, K, B, A, C);\n \n#endif\n}\n<commit_msg>Splitting of the matrix multiplication into blocks.<commit_after>\/*!\n * \\file dense_matrix_product.cpp\n * \\brief Function used to carry out a dense matrix multiplication.\n * \\author E. van der Weide\n * \\version 4.3.0 \"Cardinal\"\n *\n * SU2 Lead Developers: Dr. Francisco Palacios (Francisco.D.Palacios@boeing.com).\n * Dr. Thomas D. Economon (economon@stanford.edu).\n *\n * SU2 Developers: Prof. Juan J. Alonso's group at Stanford University.\n * Prof. Piero Colonna's group at Delft University of Technology.\n * Prof. Nicolas R. Gauger's group at Kaiserslautern University of Technology.\n * Prof. Alberto Guardone's group at Polytechnic University of Milan.\n * Prof. Rafael Palacios' group at Imperial College London.\n *\n * Copyright (C) 2012-2016 SU2, the open-source CFD code.\n *\n * SU2 is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * SU2 is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with SU2. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"..\/include\/dense_matrix_product.hpp\"\n#include <cstring>\n\nusing namespace std;\n\n#if !defined(HAVE_LIBXSMM) && !defined(HAVE_CBLAS) && !defined(HAVE_MKL)\n\n\/*--- Create an unnamed namespace to keep the functions for the\n native implementation of the matrix product local. ---*\/\nnamespace {\n\n\/* Macros for accessing submatrices of a matmul using the leading dimension. *\/\n#define A(i, j) a[(j)*lda + (i)]\n#define B(i, j) b[(j)*ldb + (i)]\n#define C(i, j) c[(j)*ldc + (i)]\n\n\/* Naive gemm implementation to handle arbitrary sized matrices. *\/\nvoid gemm_arbitrary(int m, int n, int k, const su2double *a, int lda,\n const su2double *b, int ldb, su2double *c, int ldc) {\n\n \/* The order of these loops is tuned for column-major matrices. *\/\n for (int p = 0; p < k; p++) {\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n C(i, j) += A(i, p) * B(p, j);\n }\n }\n }\n}\n\n\/* Blocking parameters for the outer kernel. We multiply mc x kc blocks of A\n with kc x nc panels of B (this approach is referred to as `gebp` in the\n literature). *\/\nconstexpr int mc = 256;\nconstexpr int kc = 128;\nconstexpr int nc = 128;\n\n\/* Compute a portion of C one block at a time. Handle ragged edges with calls\n to a slow but general function. *\/\nvoid gemm_inner(int m, int n, int k, const su2double *a, int lda,\n const su2double *b, int ldb, su2double *c, int ldc) {\n\n \/* Carry out the multiplication for this block. At the\n moment simply a call to gemm_arbitrary. *\/\n gemm_arbitrary(m, n, k, a, lda, b, ldb, c, ldc);\n}\n\n\/* Local implementation of the matrix multiplication. *\/\nvoid su2_gemm(const int m, const int n, const int k,\n const su2double *a, const su2double *b, su2double *c) {\n\n \/* Initialize the elements of c to zero. *\/\n memset(c, 0, m*n*sizeof(su2double));\n\n \/* Set the leading dimensions of the three matrices. *\/\n const int lda = m;\n const int ldb = k;\n const int ldc = m;\n\n \/* The full matrix multiplication is split in several blocks.\n Loop over these blocks. *\/\n for(int p=0; p<k; p+=kc) {\n int pb = min(k-p, kc);\n for(int j=0; j<n; j+=nc) {\n int jb = min(n-j, nc);\n for(int i=0; i<m; i+=mc) {\n int ib = min(m-i, mc);\n\n \/* Carry out the multiplication for this block. *\/\n gemm_inner(ib, jb, pb, &A(i, p), lda, &B(p, j), ldb, &C(i, j), ldc);\n }\n }\n } \n}\n\n#undef C\n#undef B\n#undef A\n\n} \/* namespace *\/\n\n#endif\n\n\/*--- The actual function to carry out the dense matrix product. ---*\/\n\nvoid DenseMatrixProduct(const int M, const int N, const int K,\n const su2double *A, const su2double *B, su2double *C) {\n\n#ifdef HAVE_LIBXSMM\n\n \/* The gemm function of libxsmm is used to carry out the multiplication.\n Note that libxsmm_gemm expects the matrices in column major order. That's\n why the calling sequence is different from cblas_dgemm. *\/\n libxsmm_gemm(NULL, NULL, N, M, K, NULL, B, NULL, A, NULL, NULL, C, NULL);\n\n#elif defined (HAVE_CBLAS) || defined(HAVE_MKL)\n\n \/* The standard blas routine dgemm is used for the multiplication. *\/\n cblas_dgemm(CblasRowMajor, CblasNoTrans, CblasNoTrans, M, N, K,\n 1.0, A, K, B, N, 0.0, C, N);\n#else\n\n \/* Native implementation of the matrix product. This optimized implementation\n assumes that the matrices are in column major order. This can be\n accomplished by swapping N and M and A and B. This implementation is based\n on https:\/\/github.com\/flame\/how-to-optimize-gemm. *\/\n su2_gemm(N, M, K, B, A, C);\n \n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * libjingle\n * Copyright 2014 Google Inc.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * 3. The name of the author may not be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#if defined(HAVE_SRTP) && defined(ENABLE_EXTERNAL_AUTH)\n\n#include \"talk\/session\/media\/externalhmac.h\"\n\n#include <stdlib.h> \/\/ For malloc\/free.\n\n#ifdef SRTP_RELATIVE_PATH\n#include \"srtp.h\" \/\/ NOLINT\n#else\n#include \"third_party\/libsrtp\/include\/srtp.h\"\n#endif \/\/ SRTP_RELATIVE_PATH\n\n#include \"talk\/base\/logging.h\"\n\n\/\/ The debug module for authentiation\ndebug_module_t mod_external_hmac = {\n 0, \/\/ Debugging is off by default\n (char*)\"external-hmac-sha-1\" \/\/ Printable name for module\n};\n\nextern auth_type_t external_hmac;\n\n\/\/ Begin test case 0 *\/\nuint8_t\nexternal_hmac_test_case_0_key[20] = {\n 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,\n 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,\n 0x0b, 0x0b, 0x0b, 0x0b\n};\n\nuint8_t\nexternal_hmac_test_case_0_data[8] = {\n 0x48, 0x69, 0x20, 0x54, 0x68, 0x65, 0x72, 0x65 \/\/ \"Hi There\"\n};\n\nuint8_t\nexternal_hmac_fake_tag[10] = {\n 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd\n};\n\nauth_test_case_t\nexternal_hmac_test_case_0 = {\n 20, \/\/ Octets in key\n external_hmac_test_case_0_key, \/\/ Key\n 8, \/\/ Octets in data\n external_hmac_test_case_0_data, \/\/ Data\n 10, \/\/ Octets in tag\n external_hmac_fake_tag, \/\/ Tag\n NULL \/\/ Pointer to next testcase\n};\n\nerr_status_t\nexternal_hmac_alloc(auth_t** a, int key_len, int out_len) {\n uint8_t* pointer;\n\n \/\/ Check key length - note that we don't support keys larger\n \/\/ than 20 bytes yet\n if (key_len > 20)\n return err_status_bad_param;\n\n \/\/ Check output length - should be less than 20 bytes\/\n if (out_len > 20)\n return err_status_bad_param;\n\n \/\/ Allocate memory for auth and hmac_ctx_t structures.\n pointer = reinterpret_cast<uint8_t*>(\n malloc(sizeof(external_hmac_ctx_t) + sizeof(auth_t)));\n if (pointer == NULL)\n return err_status_alloc_fail;\n\n \/\/ Set pointers\n *a = (auth_t *)pointer;\n (*a)->type = &external_hmac;\n (*a)->state = pointer + sizeof(auth_t);\n (*a)->out_len = out_len;\n (*a)->key_len = key_len;\n (*a)->prefix_len = 0;\n\n \/\/ Increment global count of all hmac uses.\n external_hmac.ref_count++;\n\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_dealloc(auth_t* a) {\n \/\/ Zeroize entire state\n memset((uint8_t *)a, sizeof(external_hmac_ctx_t) + sizeof(auth_t));\n\n \/\/ Free memory\n free(a);\n\n \/\/ Decrement global count of all hmac uses.\n external_hmac.ref_count--;\n\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_init(external_hmac_ctx_t* state,\n const uint8_t* key, int key_len) {\n if (key_len > HMAC_KEY_LENGTH)\n return err_status_bad_param;\n\n memset(state->key, 0, key_len);\n memcpy(state->key, key, key_len);\n state->key_length = key_len;\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_start(external_hmac_ctx_t* state) {\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_update(external_hmac_ctx_t* state, const uint8_t* message,\n int msg_octets) {\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_compute(external_hmac_ctx_t* state, const void* message,\n int msg_octets, int tag_len, uint8_t* result) {\n memcpy(result, external_hmac_fake_tag, tag_len);\n return err_status_ok;\n}\n\nchar external_hmac_description[] = \"external hmac sha-1 authentication\";\n\n \/\/ auth_type_t external_hmac is the hmac metaobject\n\nauth_type_t\nexternal_hmac = {\n (auth_alloc_func) external_hmac_alloc,\n (auth_dealloc_func) external_hmac_dealloc,\n (auth_init_func) external_hmac_init,\n (auth_compute_func) external_hmac_compute,\n (auth_update_func) external_hmac_update,\n (auth_start_func) external_hmac_start,\n (char *) external_hmac_description,\n (int) 0, \/* instance count *\/\n (auth_test_case_t *) &external_hmac_test_case_0,\n (debug_module_t *) &mod_external_hmac,\n (auth_type_id_t) EXTERNAL_HMAC_SHA1\n};\n\nerr_status_t\nexternal_crypto_init() {\n err_status_t status = crypto_kernel_replace_auth_type(\n &external_hmac, EXTERNAL_HMAC_SHA1);\n if (status) {\n LOG(LS_ERROR) << \"Error in replacing default auth module, error: \"\n << status;\n return err_status_fail;\n }\n return err_status_ok;\n}\n\n#endif \/\/ defined(HAVE_SRTP) && defined(ENABLE_EXTERNAL_AUTH)\n<commit_msg>Fixing incorrect memset.<commit_after>\/*\n * libjingle\n * Copyright 2014 Google Inc.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * 3. The name of the author may not be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO\n * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;\n * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR\n * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#if defined(HAVE_SRTP) && defined(ENABLE_EXTERNAL_AUTH)\n\n#include \"talk\/session\/media\/externalhmac.h\"\n\n#include <stdlib.h> \/\/ For malloc\/free.\n\n#ifdef SRTP_RELATIVE_PATH\n#include \"srtp.h\" \/\/ NOLINT\n#else\n#include \"third_party\/libsrtp\/include\/srtp.h\"\n#endif \/\/ SRTP_RELATIVE_PATH\n\n#include \"talk\/base\/logging.h\"\n\n\/\/ The debug module for authentiation\ndebug_module_t mod_external_hmac = {\n 0, \/\/ Debugging is off by default\n (char*)\"external-hmac-sha-1\" \/\/ Printable name for module\n};\n\nextern auth_type_t external_hmac;\n\n\/\/ Begin test case 0 *\/\nuint8_t\nexternal_hmac_test_case_0_key[20] = {\n 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,\n 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b, 0x0b,\n 0x0b, 0x0b, 0x0b, 0x0b\n};\n\nuint8_t\nexternal_hmac_test_case_0_data[8] = {\n 0x48, 0x69, 0x20, 0x54, 0x68, 0x65, 0x72, 0x65 \/\/ \"Hi There\"\n};\n\nuint8_t\nexternal_hmac_fake_tag[10] = {\n 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd, 0xba, 0xdd\n};\n\nauth_test_case_t\nexternal_hmac_test_case_0 = {\n 20, \/\/ Octets in key\n external_hmac_test_case_0_key, \/\/ Key\n 8, \/\/ Octets in data\n external_hmac_test_case_0_data, \/\/ Data\n 10, \/\/ Octets in tag\n external_hmac_fake_tag, \/\/ Tag\n NULL \/\/ Pointer to next testcase\n};\n\nerr_status_t\nexternal_hmac_alloc(auth_t** a, int key_len, int out_len) {\n uint8_t* pointer;\n\n \/\/ Check key length - note that we don't support keys larger\n \/\/ than 20 bytes yet\n if (key_len > 20)\n return err_status_bad_param;\n\n \/\/ Check output length - should be less than 20 bytes\/\n if (out_len > 20)\n return err_status_bad_param;\n\n \/\/ Allocate memory for auth and hmac_ctx_t structures.\n pointer = reinterpret_cast<uint8_t*>(\n malloc(sizeof(external_hmac_ctx_t) + sizeof(auth_t)));\n if (pointer == NULL)\n return err_status_alloc_fail;\n\n \/\/ Set pointers\n *a = (auth_t *)pointer;\n (*a)->type = &external_hmac;\n (*a)->state = pointer + sizeof(auth_t);\n (*a)->out_len = out_len;\n (*a)->key_len = key_len;\n (*a)->prefix_len = 0;\n\n \/\/ Increment global count of all hmac uses.\n external_hmac.ref_count++;\n\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_dealloc(auth_t* a) {\n \/\/ Zeroize entire state\n memset((uint8_t *)a, 0, sizeof(external_hmac_ctx_t) + sizeof(auth_t));\n\n \/\/ Free memory\n free(a);\n\n \/\/ Decrement global count of all hmac uses.\n external_hmac.ref_count--;\n\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_init(external_hmac_ctx_t* state,\n const uint8_t* key, int key_len) {\n if (key_len > HMAC_KEY_LENGTH)\n return err_status_bad_param;\n\n memset(state->key, 0, key_len);\n memcpy(state->key, key, key_len);\n state->key_length = key_len;\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_start(external_hmac_ctx_t* state) {\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_update(external_hmac_ctx_t* state, const uint8_t* message,\n int msg_octets) {\n return err_status_ok;\n}\n\nerr_status_t\nexternal_hmac_compute(external_hmac_ctx_t* state, const void* message,\n int msg_octets, int tag_len, uint8_t* result) {\n memcpy(result, external_hmac_fake_tag, tag_len);\n return err_status_ok;\n}\n\nchar external_hmac_description[] = \"external hmac sha-1 authentication\";\n\n \/\/ auth_type_t external_hmac is the hmac metaobject\n\nauth_type_t\nexternal_hmac = {\n (auth_alloc_func) external_hmac_alloc,\n (auth_dealloc_func) external_hmac_dealloc,\n (auth_init_func) external_hmac_init,\n (auth_compute_func) external_hmac_compute,\n (auth_update_func) external_hmac_update,\n (auth_start_func) external_hmac_start,\n (char *) external_hmac_description,\n (int) 0, \/* instance count *\/\n (auth_test_case_t *) &external_hmac_test_case_0,\n (debug_module_t *) &mod_external_hmac,\n (auth_type_id_t) EXTERNAL_HMAC_SHA1\n};\n\nerr_status_t\nexternal_crypto_init() {\n err_status_t status = crypto_kernel_replace_auth_type(\n &external_hmac, EXTERNAL_HMAC_SHA1);\n if (status) {\n LOG(LS_ERROR) << \"Error in replacing default auth module, error: \"\n << status;\n return err_status_fail;\n }\n return err_status_ok;\n}\n\n#endif \/\/ defined(HAVE_SRTP) && defined(ENABLE_EXTERNAL_AUTH)\n<|endoftext|>"} {"text":"<commit_before>\/********************************************************************\n* Description: inivar.c\n* prints to stdout the INI file result of a variable-in-section\n* search, useful for scripts that want to pick things out of INI files.\n*\n* syntax: inivar -var <variable> {-sec <section>} {<-ini inifile>}\n*\n* Uses emc.ini as default. <variable> needs to be supplied. If <section>\n* is omitted, first instance of <variable> will be looked for in any\n* section. Otherwise only a match of the variable in <section> will\n* be returned.\n*\n* Derived from a work by Fred Proctor & Will Shackleford\n*\n* Author:\n* License: GPL Version 2\n* System: Linux\n* \n* Copyright (c) 2004 All rights reserved.\n*\n* Last change: \n********************************************************************\/\n\n#include <stdio.h>\t\t\/* printf(), fprintf(), FILE, fopen(),*\/\n#include <stdlib.h>\t\t\/* exit() *\/\n#include <string.h>\t\t\/* strcmp(), strcpy() *\/\n\n#include \"config.h\"\n#include \"inifile.hh\"\n\n\nint main(int argc, char *argv[])\n{\n int t;\n int num = 1;\n char _variable[LINELEN] = \"\";\n char *variable = 0;\n char _section[LINELEN] = \"\";\n char *section = 0;\n char path[LINELEN] = \"emc.ini\";\n const char *inistring;\n int retval;\n\n \/* process command line args, indexing argv[] from [1] *\/\n for (t = 1; t < argc; t++) {\n\tif (!strcmp(argv[t], \"-ini\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -ini, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: ini file not specified after -ini\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(path, argv[t + 1], LINELEN);\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-var\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -var, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: variable name not specified after -var\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(_variable, argv[t + 1], LINELEN);\n\t\tvariable = _variable;\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-sec\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -sec, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: section name not specified after -sec\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(_section, argv[t + 1], LINELEN);\n\t\tsection = _section;\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-num\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -num, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: line not specified after -num\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tif (sscanf(argv[t + 1], \"%i\", &num) != 1) {\n\t\t fprintf(stderr,\n\t\t\t\"%s: invalid number after -num\\n\", argv[0]);\n\t\t exit(1);\n\t\t}\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else{\n\t \/* invalid argument *\/\n\t fprintf(stderr,\n\t\t\"%s: -var <variable> {-sec <section>} {<-ini inifile>} [-num <nth item>]\\n\",\n\t\targv[0]);\n\t exit(1);\n\t}\n }\n\n \/* check that variable was supplied *\/\n if (0 == variable) {\n\tfprintf(stderr, \"%s: no variable supplied\\n\", argv[0]);\n\texit(1);\n }\n\n IniFile inifile;\n \/* open the inifile *\/\n inifile.Open(path);\n if (inifile.IsOpen() == false) {\n\tfprintf(stderr, \"%s: can't open %s\\n\", argv[0], path);\n\texit(-1);\n }\n\n inistring = inifile.Find(variable, section, num);\n if (inistring != NULL) {\n\tprintf(\"%s\\n\", inistring);\n\tretval = 0;\n } else {\n\tfprintf(stderr, \"Can not find -sec %s -var %s -num %i \\n\", section, variable, num);\n\tretval = 1;\n }\n\n exit(retval);\n}\n<commit_msg>inivar: do tilde expansion on request<commit_after>\/********************************************************************\n* Description: inivar.c\n* prints to stdout the INI file result of a variable-in-section\n* search, useful for scripts that want to pick things out of INI files.\n*\n* syntax: inivar -var <variable> {-sec <section>} {<-ini inifile>}\n*\n* Uses emc.ini as default. <variable> needs to be supplied. If <section>\n* is omitted, first instance of <variable> will be looked for in any\n* section. Otherwise only a match of the variable in <section> will\n* be returned.\n*\n* Derived from a work by Fred Proctor & Will Shackleford\n*\n* Author:\n* License: GPL Version 2\n* System: Linux\n* \n* Copyright (c) 2004 All rights reserved.\n*\n* Last change: \n********************************************************************\/\n\n#include <stdio.h>\t\t\/* printf(), fprintf(), FILE, fopen(),*\/\n#include <stdlib.h>\t\t\/* exit() *\/\n#include <string.h>\t\t\/* strcmp(), strcpy() *\/\n#include <limits.h>\n\n#include \"config.h\"\n#include \"inifile.hh\"\n\n\nint main(int argc, char *argv[])\n{\n int t;\n int num = 1;\n char _variable[LINELEN] = \"\";\n char *variable = 0;\n char _section[LINELEN] = \"\";\n char *section = 0;\n char path[LINELEN] = \"emc.ini\";\n const char *inistring;\n int retval;\n bool tildeexpand=false;\n\n \/* process command line args, indexing argv[] from [1] *\/\n for (t = 1; t < argc; t++) {\n\tif (!strcmp(argv[t], \"-ini\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -ini, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: ini file not specified after -ini\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(path, argv[t + 1], LINELEN);\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-var\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -var, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: variable name not specified after -var\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(_variable, argv[t + 1], LINELEN);\n\t\tvariable = _variable;\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-sec\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -sec, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: section name not specified after -sec\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tstrncpy(_section, argv[t + 1], LINELEN);\n\t\tsection = _section;\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-num\")) {\n\t if (t == argc - 1) {\n\t\t\/* no arg following -num, so abort *\/\n\t\tfprintf(stderr,\n\t\t \"%s: line not specified after -num\\n\", argv[0]);\n\t\texit(1);\n\t } else {\n\t\tif (sscanf(argv[t + 1], \"%i\", &num) != 1) {\n\t\t fprintf(stderr,\n\t\t\t\"%s: invalid number after -num\\n\", argv[0]);\n\t\t exit(1);\n\t\t}\n\t\tt++;\t\t\/* step over following arg *\/\n\t }\n\t} else if (!strcmp(argv[t], \"-tildeexpand\")) {\n\t tildeexpand = !tildeexpand;\n\t} else{\n\t \/* invalid argument *\/\n\t fprintf(stderr,\n\t\t\"%s: -var <variable> {-sec <section>} {<-ini inifile>} [-num <nth item>]\\n\",\n\t\targv[0]);\n\t exit(1);\n\t}\n }\n\n \/* check that variable was supplied *\/\n if (0 == variable) {\n\tfprintf(stderr, \"%s: no variable supplied\\n\", argv[0]);\n\texit(1);\n }\n\n IniFile inifile;\n \/* open the inifile *\/\n inifile.Open(path);\n if (inifile.IsOpen() == false) {\n\tfprintf(stderr, \"%s: can't open %s\\n\", argv[0], path);\n\texit(-1);\n }\n\n inistring = inifile.Find(variable, section, num);\n if (inistring != NULL) {\n\tif(tildeexpand)\n\t{\n\t char expanded[PATH_MAX];\n\t inifile.TildeExpansion(inistring, expanded, sizeof(expanded));\n\t printf(\"%s\\n\", expanded);\n\t} else {\n\t printf(\"%s\\n\", inistring);\n\t}\n\tretval = 0;\n } else {\n\tfprintf(stderr, \"Can not find -sec %s -var %s -num %i \\n\", section, variable, num);\n\tretval = 1;\n }\n\n exit(retval);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef SDL_TIMER_HH\r\n#define SDL_TIMER_HH\r\n\r\n#include \"Functor.hh\"\r\n#include <utility>\r\n#include <map>\r\n\r\n#include <iostream>\r\n\r\ntypedef struct _SDL_TimerID *SDL_TimerID;\r\n\r\nnamespace RAGE\r\n{\r\n namespace SDL\r\n {\r\n\t\/\/Simple overloaded implementations\r\n\t void Delay(long millisec);\r\n\t long GetTicks();\r\n\r\n\t \/\/these should be used through the timer class, not directly\r\n\t \/\/NB : AddGlobalTimer should not be called from an other thread thant the main one. Timers will behave strangely in multithreaded applications...\r\n\t SDL_TimerID AddGlobalTimer(unsigned int interval, unsigned int callback (unsigned int, void*) , void *param);\r\n\t bool RemoveGlobalTimer(SDL_TimerID t);\r\n\r\n\t \r\n\r\n \t\ttemplate <class TClass>\r\n\t\tclass Timer\r\n\t\t{\r\n\r\n\t\t\t\/\/Functor for Timer Callback\r\n\t \t\t\/\/the only constraint about the callback function is that it should return int (next interval to apply)\r\n\t \t\t\/\/and the arguments should be void* to be able to pass anything...\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tclass Callback : public TSpecificFunctor2<TClass,unsigned int,unsigned int>\r\n\t\t\t{\r\n\t\t\t\tpublic:\r\n\t\t\t\t\tCallback(TClass* ptobj, unsigned int (TClass::*ptfunc) (unsigned int interval,void * args))\r\n\t\t\t\t\t: TSpecificFunctor2<TClass,unsigned int,unsigned int>(ptobj,ptfunc)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t}\r\n\r\n\t\t\t};\r\n\r\n\r\n\t\t\t\/\/structure for arguments\r\n\t \t\ttypedef struct { int lookupindex; void* args;} cbargs;\r\n\t\t \r\n\t\t \t\/\/index of this functor instance in the static lookuptable\r\n\t\t\tunsigned int _index;\r\n\t\t\t\r\n\t\t\tcbargs* _cbargs;\r\n\r\n\t\t\t\/\/static table lookup that stores pointer to callback\r\n\t\t\tstatic std::map<unsigned int, Callback* > _cbtable;\r\n\t\t\tstatic std::map<unsigned int, SDL_TimerID* > _timertable;\r\n\t\t\t\r\n\t\t\tpublic:\r\n\r\n\t\t \t\/\/static callback function who calls the right functor from the table\r\n\t\t\tstatic unsigned int callback(unsigned int, void* args);\r\n\t\r\n\t\t\tSDL_TimerID _timerid; \/\/set after timer is started\r\n\t\t\t\/\/_timerid != 0 means the timer has been launched.\r\n\r\n\t\t\tTimer();\r\n\t\t\t~Timer();\r\n\r\n\t\t\tvoid setCallback(TClass* instance, unsigned int (TClass::*func) (unsigned int, void*) , void* args);\r\n\t\t\t\r\n\t\t\tbool launch(unsigned int interval);\r\n\t\t\tbool abort();\r\n\t\t};\r\n\r\n\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tstd::map<unsigned int,typename Timer<TClass>::Callback* > Timer<TClass>::_cbtable;\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tstd::map<unsigned int,SDL_TimerID* > Timer<TClass>::_timertable;\r\n\t\t\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tunsigned int Timer<TClass>::callback(unsigned int interval, void* args)\r\n\t\t{\r\n\t\t\tcbargs* callargs= static_cast<cbargs*>(args);\r\n\t\t\ttypename std::map<unsigned int,Callback* >::iterator itcb=_cbtable.find(callargs->lookupindex);\r\n\t\t\tif ( itcb == _cbtable.end() ) return 0; \/\/stop callback : function to call doesnt exists\r\n\r\n\t\t\t\/\/Do the actual client callback\r\n\t\t\tint res = itcb->second->call(interval,callargs->args);\r\n\r\n\t\t\tif ( res == 0 ) \/\/ to set timer to 0 and erase it from the list, to flag termination of timer, so it can be launched again.\r\n\t\t\t{\r\n\t\t\t\tstd::map<unsigned int,SDL_TimerID* >::iterator ittimer=_timertable.find(callargs->lookupindex);\r\n\t\t\t\tif ( ittimer != _timertable.end() )\r\n\t\t\t\t{\r\n\t\t\t\t\t*(ittimer->second) = 0;\r\n\t\t\t\t\t_timertable.erase(ittimer);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/else doesnt exists anymore ? should not happen, but it s fine...\r\n\t\t\t}\r\n\t\t\treturn res;\r\n\t\t}\r\n\t\t\r\n\t\ttemplate<class TClass>\r\n\t\t\t\tvoid Timer<TClass>::setCallback(TClass* instance,unsigned int (TClass::*func) (unsigned int, void*), void* args)\r\n\t\t{\r\n\t\t\ttypename std::map<unsigned int, Callback*>::iterator it=_cbtable.find(_index);\r\n\t\t\tif ( it != _cbtable.end() ) delete it->second;\r\n\t\t\tit->second = new Callback(instance,func);\r\n\t\t\t\r\n\t\t\t\/\/reinit _cbargs when needed\r\n\t\t\tif (_cbargs != NULL)\r\n\t\t\t{\r\n\t\t\t\tdelete _cbargs, _cbargs = NULL;\r\n\t\t\t}\r\n\t\t\t_cbargs = new cbargs();\r\n\t\t\t_cbargs->lookupindex = _index;\r\n\t\t\t_cbargs->args = args;\r\n\t\t}\r\n\r\n\t\ttemplate<class TClass>\r\n\t\tTimer<TClass>::Timer() : _cbargs(NULL), _timerid()\r\n\t\t{\r\n\t\t\t\r\n\t\t\t\/\/setting the index for the current instance\r\n\t\t\tstatic unsigned int index=0;\r\n\t\t\t_index = index;\r\n\t\t\tindex++;\r\n\t\t\t\/\/preparing callback\r\n\t\t\t\/\/_cbtable.push_back(NULL);\r\n\t\t\t\/\/useful ? really ??\r\n\t\t}\r\n\r\n\t\ttemplate<class TClass>\r\n\t\tTimer<TClass>::~Timer()\r\n\t\t{\r\n\t\t\tabort();\/\/ destructor abort a running timer if needed\r\n\t\t\tif (_cbargs != NULL)\r\n\t\t\t\tdelete _cbargs, _cbargs = NULL;\r\n\t\t\ttypename std::map<unsigned int, Callback*>::iterator it=_cbtable.find(_index);\r\n\t\t\tif (it != _cbtable.end())\r\n\t\t\t{\r\n\t\t\t\tdelete it->second;\r\n\t\t\t\t_cbtable.erase(it);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/returns true if the timer has been successfully launched. A timer can be launched only once. If this timer has already been launched this will return false.\r\n\t\t\/\/returns false if the timer could not be launched.\r\n\t\t\/\/NB : a timer cannot be launched from another timer's callback. Timer may behave strangely in multithreaded applications\r\n\t\ttemplate<class TClass>\r\n\t\tbool Timer<TClass>::launch(unsigned int interval)\r\n\t\t{\r\n\t\t\tif ( interval > 0 && _timerid == 0 && _timertable.count(_index) == 0)\r\n\t\t\t{\r\n\t\t\t\t_timerid = AddGlobalTimer(interval,callback,_cbargs);\r\n\t\t\t\tstd::pair<std::map<unsigned int,SDL_TimerID* >::iterator, bool > result = _timertable.insert(std::make_pair(_index,&_timerid));\r\n\t\t\t\treturn result.second;\r\n\t\t\t}\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t\/\/return true if abort successful. return false if abortion failed ( the timer may already have stopped for example )\r\n\t\ttemplate<class TClass>\r\n\t\tbool Timer<TClass>::abort()\r\n\t\t{\r\n\t\t\tif (_timerid != 0 && _timertable.count(_index) != 0 && RemoveGlobalTimer(_timerid) )\r\n\t\t\t{\r\n\t\t\t\t_timerid = 0;\r\n\t\t\t\t_timertable.erase(_index);\r\n\t\t\t}\r\n\t\t\treturn (_timerid == 0 );\r\n\t\t}\r\n\t\t\r\n\t}\r\n}\r\n\r\n\r\n\r\n#endif\r\n<commit_msg>fix in timer when setting callback<commit_after>#ifndef SDL_TIMER_HH\r\n#define SDL_TIMER_HH\r\n\r\n#include \"Functor.hh\"\r\n#include <utility>\r\n#include <map>\r\n\r\n#include <iostream>\r\n\r\ntypedef struct _SDL_TimerID *SDL_TimerID;\r\n\r\nnamespace RAGE\r\n{\r\n namespace SDL\r\n {\r\n\t\/\/Simple overloaded implementations\r\n\t void Delay(long millisec);\r\n\t long GetTicks();\r\n\r\n\t \/\/these should be used through the timer class, not directly\r\n\t \/\/NB : AddGlobalTimer should not be called from an other thread thant the main one. Timers will behave strangely in multithreaded applications...\r\n\t SDL_TimerID AddGlobalTimer(unsigned int interval, unsigned int callback (unsigned int, void*) , void *param);\r\n\t bool RemoveGlobalTimer(SDL_TimerID t);\r\n\r\n\t \r\n\r\n \t\ttemplate <class TClass>\r\n\t\tclass Timer\r\n\t\t{\r\n\r\n\t\t\t\/\/Functor for Timer Callback\r\n\t \t\t\/\/the only constraint about the callback function is that it should return int (next interval to apply)\r\n\t \t\t\/\/and the arguments should be void* to be able to pass anything...\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tclass Callback : public TSpecificFunctor2<TClass,unsigned int,unsigned int>\r\n\t\t\t{\r\n\t\t\t\tpublic:\r\n\t\t\t\t\tCallback(TClass* ptobj, unsigned int (TClass::*ptfunc) (unsigned int interval,void * args))\r\n\t\t\t\t\t: TSpecificFunctor2<TClass,unsigned int,unsigned int>(ptobj,ptfunc)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t}\r\n\r\n\t\t\t};\r\n\r\n\r\n\t\t\t\/\/structure for arguments\r\n\t \t\ttypedef struct { int lookupindex; void* args;} cbargs;\r\n\t\t \r\n\t\t \t\/\/index of this functor instance in the static lookuptable\r\n\t\t\tunsigned int _index;\r\n\t\t\t\r\n\t\t\tcbargs* _cbargs;\r\n\r\n\t\t\t\/\/static table lookup that stores pointer to callback\r\n\t\t\tstatic std::map<unsigned int, Callback* > _cbtable;\r\n\t\t\tstatic std::map<unsigned int, SDL_TimerID* > _timertable;\r\n\t\t\t\r\n\t\t\tpublic:\r\n\r\n\t\t \t\/\/static callback function who calls the right functor from the table\r\n\t\t\tstatic unsigned int callback(unsigned int, void* args);\r\n\t\r\n\t\t\tSDL_TimerID _timerid; \/\/set after timer is started\r\n\t\t\t\/\/_timerid != 0 means the timer has been launched.\r\n\r\n\t\t\tTimer();\r\n\t\t\t~Timer();\r\n\r\n\t\t\tvoid setCallback(TClass* instance, unsigned int (TClass::*func) (unsigned int, void*) , void* args);\r\n\t\t\t\r\n\t\t\tbool launch(unsigned int interval);\r\n\t\t\tbool abort();\r\n\t\t};\r\n\r\n\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tstd::map<unsigned int,typename Timer<TClass>::Callback* > Timer<TClass>::_cbtable;\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tstd::map<unsigned int,SDL_TimerID* > Timer<TClass>::_timertable;\r\n\t\t\r\n\t\ttemplate <class TClass>\r\n\t\t\t\tunsigned int Timer<TClass>::callback(unsigned int interval, void* args)\r\n\t\t{\r\n\t\t\tcbargs* callargs= static_cast<cbargs*>(args);\r\n\t\t\ttypename std::map<unsigned int,Callback* >::iterator itcb=_cbtable.find(callargs->lookupindex);\r\n\t\t\tif ( itcb == _cbtable.end() ) return 0; \/\/stop callback : function to call doesnt exists\r\n\r\n\t\t\t\/\/Do the actual client callback\r\n\t\t\tint res = itcb->second->call(interval,callargs->args);\r\n\r\n\t\t\tif ( res == 0 ) \/\/ to set timer to 0 and erase it from the list, to flag termination of timer, so it can be launched again.\r\n\t\t\t{\r\n\t\t\t\tstd::map<unsigned int,SDL_TimerID* >::iterator ittimer=_timertable.find(callargs->lookupindex);\r\n\t\t\t\tif ( ittimer != _timertable.end() )\r\n\t\t\t\t{\r\n\t\t\t\t\t*(ittimer->second) = 0;\r\n\t\t\t\t\t_timertable.erase(ittimer);\r\n\t\t\t\t}\r\n\t\t\t\t\/\/else doesnt exists anymore ? should not happen, but it s fine...\r\n\t\t\t}\r\n\t\t\treturn res;\r\n\t\t}\r\n\t\t\r\n\t\ttemplate<class TClass>\r\n\t\t\t\tvoid Timer<TClass>::setCallback(TClass* instance,unsigned int (TClass::*func) (unsigned int, void*), void* args)\r\n\t\t{\r\n\t\t\ttypename std::map<unsigned int, Callback*>::iterator it=_cbtable.find(_index);\r\n\t\t\tif ( it != _cbtable.end() )\r\n\t\t\t{\r\n\t\t\t\tdelete it->second;\r\n\t\t\t}\r\n\t\t\t_cbtable[_index] = new Callback(instance,func);\r\n\t\t\t\r\n\t\t\t\/\/reinit _cbargs when needed\r\n\t\t\tif (_cbargs != NULL)\r\n\t\t\t{\r\n\t\t\t\tdelete _cbargs, _cbargs = NULL;\r\n\t\t\t}\r\n\t\t\t_cbargs = new cbargs();\r\n\t\t\t_cbargs->lookupindex = _index;\r\n\t\t\t_cbargs->args = args;\r\n\t\t}\r\n\r\n\t\ttemplate<class TClass>\r\n\t\tTimer<TClass>::Timer() : _cbargs(NULL), _timerid()\r\n\t\t{\r\n\t\t\t\r\n\t\t\t\/\/setting the index for the current instance\r\n\t\t\tstatic unsigned int index=0;\r\n\t\t\t_index = index;\r\n\t\t\tindex++;\r\n\t\t\t\/\/preparing callback\r\n\t\t\t\/\/_cbtable.push_back(NULL);\r\n\t\t\t\/\/useful ? really ??\r\n\t\t}\r\n\r\n\t\ttemplate<class TClass>\r\n\t\tTimer<TClass>::~Timer()\r\n\t\t{\r\n\t\t\tabort();\/\/ destructor abort a running timer if needed\r\n\t\t\tif (_cbargs != NULL)\r\n\t\t\t\tdelete _cbargs, _cbargs = NULL;\r\n\t\t\ttypename std::map<unsigned int, Callback*>::iterator it=_cbtable.find(_index);\r\n\t\t\tif (it != _cbtable.end())\r\n\t\t\t{\r\n\t\t\t\tdelete it->second;\r\n\t\t\t\t_cbtable.erase(it);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/returns true if the timer has been successfully launched. A timer can be launched only once. If this timer has already been launched this will return false.\r\n\t\t\/\/returns false if the timer could not be launched.\r\n\t\t\/\/NB : a timer cannot be launched from another timer's callback. Timer may behave strangely in multithreaded applications\r\n\t\ttemplate<class TClass>\r\n\t\tbool Timer<TClass>::launch(unsigned int interval)\r\n\t\t{\r\n\t\t\tif ( interval > 0 && _timerid == 0 && _timertable.count(_index) == 0)\r\n\t\t\t{\r\n\t\t\t\t_timerid = AddGlobalTimer(interval,callback,_cbargs);\r\n\t\t\t\tstd::pair<std::map<unsigned int,SDL_TimerID* >::iterator, bool > result = _timertable.insert(std::make_pair(_index,&_timerid));\r\n\t\t\t\treturn result.second;\r\n\t\t\t}\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\t\/\/return true if abort successful. return false if abortion failed ( the timer may already have stopped for example )\r\n\t\ttemplate<class TClass>\r\n\t\tbool Timer<TClass>::abort()\r\n\t\t{\r\n\t\t\tif (_timerid != 0 && _timertable.count(_index) != 0 && RemoveGlobalTimer(_timerid) )\r\n\t\t\t{\r\n\t\t\t\t_timerid = 0;\r\n\t\t\t\t_timertable.erase(_index);\r\n\t\t\t}\r\n\t\t\treturn (_timerid == 0 );\r\n\t\t}\r\n\t\t\r\n\t}\r\n}\r\n\r\n\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"<commit_before>#ifndef Pipeline_HPP\n#define Pipeline_HPP\n\n#include <vector>\n#include \"PerPixelMesh.hpp\"\n#include \"Renderable.hpp\"\n#include \"Filters.hpp\"\n#include \"BeatDetect.hpp\"\n#include \"PipelineContext.hpp\"\n#include \"Shader.hpp\"\n\n\/\/This class is the input to projectM's renderer\n\/\/\n\/\/Most implemenatations should implement PerPixel in order to get multi-threaded\n\/\/dynamic PerPixel equations. If you MUST (ie Milkdrop compatability), you can use the\n\/\/setStaticPerPixel function and fill in x_mesh and y_mesh yourself.\nclass Pipeline\n{\npublic:\n\n\t \/\/static per pixel stuff\n\t bool staticPerPixel;\n\t int gx;\n\t int gy;\n\n\t float** x_mesh;\n\t float** y_mesh;\n\t \/\/end static per pixel\n\n\t bool textureWrap;\n\t float screenDecay;\n\n\t \/\/variables passed to pixel shaders\n\t float q[NUM_Q_VARIABLES];\n\n\t \/\/blur settings n=bias x=scale\n\t float blur1n;\n\t float blur2n;\n\t float blur3n;\n\t float blur1x;\n\t float blur2x;\n\t float blur3x;\n\t float blur1ed;\n\n\t Shader warpShader;\n\t Shader compositeShader;\n\n\t std::vector<RenderItem*> drawables;\n\t std::vector<RenderItem*> compositeDrawables;\n\n\t Pipeline();\n\t void setStaticPerPixel(int gx, int gy);\n\t virtual ~Pipeline();\n\t virtual Point PerPixel(Point p, const PerPixelContext context);\n};\n\n#endif\n<commit_msg>forgot to include common header<commit_after>#ifndef Pipeline_HPP\n#define Pipeline_HPP\n\n#include <vector>\n#include \"PerPixelMesh.hpp\"\n#include \"Renderable.hpp\"\n#include \"Filters.hpp\"\n#include \"BeatDetect.hpp\"\n#include \"PipelineContext.hpp\"\n#include \"Shader.hpp\"\n#include \"Common.hpp\"\n\/\/This class is the input to projectM's renderer\n\/\/\n\/\/Most implemenatations should implement PerPixel in order to get multi-threaded\n\/\/dynamic PerPixel equations. If you MUST (ie Milkdrop compatability), you can use the\n\/\/setStaticPerPixel function and fill in x_mesh and y_mesh yourself.\nclass Pipeline\n{\npublic:\n\n\t \/\/static per pixel stuff\n\t bool staticPerPixel;\n\t int gx;\n\t int gy;\n\n\t float** x_mesh;\n\t float** y_mesh;\n\t \/\/end static per pixel\n\n\t bool textureWrap;\n\t float screenDecay;\n\n\t \/\/variables passed to pixel shaders\n\t float q[NUM_Q_VARIABLES];\n\n\t \/\/blur settings n=bias x=scale\n\t float blur1n;\n\t float blur2n;\n\t float blur3n;\n\t float blur1x;\n\t float blur2x;\n\t float blur3x;\n\t float blur1ed;\n\n\t Shader warpShader;\n\t Shader compositeShader;\n\n\t std::vector<RenderItem*> drawables;\n\t std::vector<RenderItem*> compositeDrawables;\n\n\t Pipeline();\n\t void setStaticPerPixel(int gx, int gy);\n\t virtual ~Pipeline();\n\t virtual Point PerPixel(Point p, const PerPixelContext context);\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* Rapicorn-Python Bindings\n * Copyright (C) 2008 Tim Janik\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * A copy of the GNU Lesser General Public License should ship along\n * with this library; if not, see http:\/\/www.gnu.org\/copyleft\/.\n *\/\n#include \"rope.hh\" \/\/ must be included first to configure std headers\n#include <deque>\n\n\/\/ --- conventional Python module initializers ---\n#define MODULE_NAME pyRapicorn\n#define MODULE_NAME_STRING STRINGIFY (MODULE_NAME)\n#define MODULE_INIT_FUNCTION RAPICORN_CPP_PASTE2 (init, MODULE_NAME)\n\nstatic int cpu_affinity (int cpu); \/\/ FIXME\n\n\/\/ --- rope2cxx stubs (generated) ---\n#include \"rope2cxx.cc\"\n\n\/\/ --- Anonymous namespacing\nnamespace {\n\n\/\/ --- cpy2rope stubs (generated) ---\n#define HAVE_PLIC_CALL_REMOTE 1\nstatic Rapicorn::Plic::FieldBuffer* plic_call_remote (Rapicorn::Plic::FieldBuffer*);\nstatic PyObject* plic_cpy_trampoline (PyObject *pyself, PyObject *pyargs); \/\/ generated\n#include \"cpy2rope.cc\"\ntypedef Rapicorn::Plic::FieldBuffer FieldBuffer;\ntypedef Rapicorn::Plic::FieldBuffer8 FieldBuffer8;\n\n\/\/ --- globals ---\nstatic PyObject *rapicorn_exception = NULL;\n\n\/\/ --- rapicorn thread ---\nstatic int max_call_stack_size = 0;\nstatic void print_max_call_stack_size()\n{\n printerr (\"DEBUG:atexit: max_call_stack_size: %u\\n\", max_call_stack_size);\n}\n\nclass UIThread : public Thread {\n EventLoop * volatile m_loop;\n virtual void\n run ()\n {\n cpu_affinity (m_cpu);\n \/\/ rapicorn_init_core() already called\n Rapicorn::StringList slist;\n slist.strings = this->cmdline_args;\n App.init_with_x11 (this->application_name, slist);\n m_loop = ref_sink (EventLoop::create());\n EventLoop::Source *esource = new ProcSource (*this);\n (*m_loop).add_source (esource, MAXINT);\n esource->exitable (false);\n {\n FieldBuffer *fb = FieldBuffer::_new (2);\n fb->add_int64 (0x02000000); \/\/ proc_id\n Deletable *dapp = &App;\n fb->add_string (dapp->object_url());\n push_return (fb);\n }\n App.execute_loops();\n }\n bool\n dispatch ()\n {\n const FieldBuffer *call = pop_proc();\n if (call)\n {\n if (0)\n {\n#if 0\n std::string string;\n if (!google::protobuf::TextFormat::PrintToString (*proc, &string))\n string = \"{*protobuf::TextFormat ERROR*}\";\n printerr (\"Rapicorn::UIThread::call:\\n%s\\n\", string.c_str());\n#endif\n }\n FieldBuffer *fr;\n FieldBuffer8 fdummy (2);\n if (call->first_id() >= 0x02000000)\n fr = FieldBuffer::_new (2);\n else\n fr = &fdummy;\n bool success = plic_call_wrapper_switch (*call, *fr);\n if (!success)\n {\n printerr (\"UIThread::call error (see logs)\\n\"); \/\/ FIXME\n if (call->first_id() >= 0x02000000)\n {\n FieldBuffer *fb = FieldBuffer::_new (2);\n fb->add_int64 (0x02000000); \/\/ proc_id\n fb->add_string (\"*ERROR*\"); \/\/ FIXME\n push_return (fb);\n }\n if (call->first_id() >= 0x02000000)\n delete fr;\n }\n else if (call->first_id() >= 0x02000000)\n push_return (fr);\n delete call;\n }\n return true;\n }\nprotected:\n class ProcSource : public virtual EventLoop::Source {\n UIThread &m_thread;\n RAPICORN_PRIVATE_CLASS_COPY (ProcSource);\n protected:\n \/*Des*\/ ~ProcSource() {}\n virtual bool prepare (uint64 current_time_usecs,\n int64 *timeout_usecs_p) { return m_thread.check_dispatch(); }\n virtual bool check (uint64 current_time_usecs) { return m_thread.check_dispatch(); }\n virtual bool dispatch () { return m_thread.dispatch(); }\n public:\n explicit ProcSource (UIThread &thread) : m_thread (thread) {}\n };\npublic:\n int m_cpu;\n String application_name;\n vector<String> cmdline_args;\n UIThread (const String &name) :\n Thread (name),\n m_loop (NULL),\n m_cpu (-1),\n rrx (0),\n rpx (0)\n {\n rrv.reserve (1);\n atexit (print_max_call_stack_size);\n }\n ~UIThread()\n {\n unref (m_loop);\n m_loop = NULL;\n }\nprivate:\n Mutex rrm;\n Cond rrc;\n vector<FieldBuffer*> rrv, rro;\n size_t rrx;\npublic:\n void\n push_return (FieldBuffer *rret)\n {\n rrm.lock();\n rrv.push_back (rret);\n rrc.signal();\n rrm.unlock();\n Thread::Self::yield(); \/\/ allow fast return value handling on single core\n }\n FieldBuffer*\n fetch_return (void)\n {\n if (rrx >= rro.size())\n {\n if (rrx)\n rro.resize (0);\n rrm.lock();\n while (rrv.size() == 0)\n rrc.wait (rrm);\n rrv.swap (rro); \/\/ fetch result\n rrm.unlock();\n rrx = 0;\n }\n \/\/ rrx < rro.size()\n return rro[rrx++];\n }\nprivate:\n Mutex rps;\n vector<FieldBuffer*> rpv, rpo;\n size_t rpx;\npublic:\n void\n push_proc (FieldBuffer *proc)\n {\n int64 call_id = proc->first_id();\n size_t sz;\n rps.lock();\n rpv.push_back (proc);\n sz = rpv.size();\n rps.unlock();\n m_loop->wakeup();\n if (call_id >= 0x02000000 || \/\/ minimize turn-around times for two-way calls\n sz >= 1009) \/\/ allow batch processing of one-way call queue\n Thread::Self::yield(); \/\/ useless if threads have different CPU affinity\n }\n FieldBuffer*\n pop_proc (bool advance = true)\n {\n if (rpx >= rpo.size())\n {\n if (rpx)\n rpo.resize (0);\n rps.lock();\n rpv.swap (rpo);\n rps.unlock();\n rpx = 0;\n max_call_stack_size = MAX (max_call_stack_size, rpo.size());\n }\n if (rpx < rpo.size())\n {\n size_t indx = rpx;\n if (advance)\n rpx++;\n return rpo[indx];\n }\n return NULL;\n }\n bool\n check_dispatch ()\n {\n return pop_proc (false) != NULL;\n }\nprivate:\n static UIThread *ui_thread;\npublic:\n static String\n ui_thread_create (const String &application_name,\n const std::vector<String> &cmdline_args)\n {\n return_val_if_fail (ui_thread == NULL, \"\");\n \/* initialize core *\/\n RapicornInitValue ivalues[] = {\n { NULL }\n };\n int argc = 0;\n char **argv = NULL;\n rapicorn_init_core (&argc, &argv, NULL, ivalues);\n \/* start parallel thread *\/\n ui_thread = new UIThread (\"RapicornUI\");\n ref_sink (ui_thread);\n ui_thread->application_name = application_name;\n ui_thread->cmdline_args = cmdline_args;\n ui_thread->m_cpu = cpu_affinity (1);\n ui_thread->start();\n FieldBuffer *rpret = ui_thread->fetch_return();\n String appurl;\n if (rpret && rpret->first_id() == 0x02000000)\n {\n Rapicorn::Plic::FieldBufferReader rpr (*rpret);\n rpr.skip(); \/\/ proc_id\n if (rpr.remaining() > 0 && rpr.get_type() == Rapicorn::Plic::STRING)\n appurl = rpr.pop_string();\n }\n delete rpret;\n return appurl;\n }\n static FieldBuffer*\n ui_thread_call_remote (FieldBuffer *call)\n {\n if (!ui_thread)\n return false;\n int64 call_id = call->first_id();\n ui_thread->push_proc (call); \/\/ deletes call\n if (0) \/\/ debug\n printf (\"Remote Procedure Call, id=0x%08llx (%s-way)\\n\",\n call_id, call_id >= 0x02000000 ? \"two\" : \"one\");\n if (call_id >= 0x02000000)\n {\n FieldBuffer *rpret = ui_thread->fetch_return();\n if (0)\n printerr (\"Remote Procedure Return: 0x%08llx\\n\", rpret->first_id());\n return rpret;\n }\n return NULL;\n }\n};\nUIThread *UIThread::ui_thread = NULL;\n\nstatic Rapicorn::Plic::FieldBuffer*\nplic_call_remote (Rapicorn::Plic::FieldBuffer *call)\n{\n return UIThread::ui_thread_call_remote (call);\n}\n\n\/\/ --- PyC functions ---\nstatic PyObject*\nrope_printout (PyObject *self,\n PyObject *args)\n{\n const char *ns = NULL;\n unsigned int nl = 0;\n if (!PyArg_ParseTuple (args, \"s#\", &ns, &nl))\n return NULL;\n String str = String (ns, nl);\n printout (\"%s\", str.c_str());\n return None_INCREF();\n}\n\nstatic PyObject*\nrope_init_dispatcher (PyObject *self,\n PyObject *args)\n{\n const char *ns = NULL;\n unsigned int nl = 0;\n PyObject *list;\n if (!PyArg_ParseTuple (args, \"s#O\", &ns, &nl, &list))\n return NULL;\n const ssize_t len = PyList_Size (list);\n if (len < 0)\n return NULL;\n std::vector<String> strv;\n for (ssize_t k = 0; k < len; k++)\n {\n PyObject *item = PyList_GET_ITEM (list, k);\n char *as = NULL;\n Py_ssize_t al = 0;\n if (PyString_AsStringAndSize (item, &as, &al) < 0)\n return NULL;\n strv.push_back (String (as, al));\n }\n if (PyErr_Occurred())\n return NULL;\n String appurl = UIThread::ui_thread_create (String (ns, nl), strv);\n if (appurl.size() == 0)\n ; \/\/ FIXME: throw exception\n return PyString_FromStringAndSize (appurl.data(), appurl.size());\n}\n\n} \/\/ Anon\n\n\/\/ --- Python module definitions (global namespace) ---\nstatic PyMethodDef rope_vtable[] = {\n { \"_init_dispatcher\", rope_init_dispatcher, METH_VARARGS,\n \"Rapicorn::_init_dispatcher() - initial setup.\" },\n { \"__rope_pytrampoline__\", plic_cpy_trampoline, METH_VARARGS,\n \"Rapicorn function invokation trampoline.\" },\n { \"printout\", rope_printout, METH_VARARGS,\n \"Rapicorn::printout() - print to stdout.\" },\n { NULL, } \/\/ sentinel\n};\nstatic const char rapicorn_doc[] = \"Rapicorn Python Language Binding Module.\";\n\nPyMODINIT_FUNC\nMODULE_INIT_FUNCTION (void) \/\/ conventional dlmodule initializer\n{\n \/\/ register module\n PyObject *m = Py_InitModule3 (MODULE_NAME_STRING, rope_vtable, (char*) rapicorn_doc);\n if (!m)\n return;\n\n \/\/ register Rypicorn exception\n if (!rapicorn_exception)\n rapicorn_exception = PyErr_NewException ((char*) MODULE_NAME_STRING \".exception\", NULL, NULL);\n if (!rapicorn_exception)\n return;\n Py_INCREF (rapicorn_exception);\n PyModule_AddObject (m, \"exception\", rapicorn_exception);\n\n \/\/ retrieve argv[0]\n char *argv0;\n {\n PyObject *sysmod = PyImport_ImportModule (\"sys\");\n PyObject *astr = sysmod ? PyObject_GetAttrString (sysmod, \"argv\") : NULL;\n PyObject *arg0 = astr ? PySequence_GetItem (astr, 0) : NULL;\n argv0 = arg0 ? strdup (PyString_AsString (arg0)) : NULL;\n Py_XDECREF (arg0);\n Py_XDECREF (astr);\n Py_XDECREF (sysmod);\n if (!argv0)\n return; \/\/ exception set\n }\n\n \/\/ initialize Rapicorn with dummy argv, hardcode X11 temporarily\n {\n \/\/ int dummyargc = 1;\n char *dummyargs[] = { NULL, NULL };\n dummyargs[0] = argv0[0] ? argv0 : (char*) \"Python>>>\";\n \/\/ char **dummyargv = dummyargs;\n \/\/ FIXME: \/\/ App.init_with_x11 (&dummyargc, &dummyargv, dummyargs[0]);\n }\n free (argv0);\n}\n\/\/ using global namespace for Python module initialization\n\n\n\n\/\/ FIXME: move...\n\/\/#define _GNU_SOURCE\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n\nstatic int\ncpu_affinity (int cpu)\n{\n pthread_t thread = pthread_self();\n cpu_set_t cpuset;\n\n if (cpu >= 0 && cpu < CPU_SETSIZE)\n {\n CPU_ZERO (&cpuset);\n CPU_SET (cpu, &cpuset);\n if (pthread_setaffinity_np (thread, sizeof (cpu_set_t), &cpuset) != 0)\n perror (\"pthread_setaffinity_np\");\n }\n\n if (pthread_getaffinity_np (thread, sizeof (cpu_set_t), &cpuset) != 0)\n perror (\"pthread_getaffinity_np\");\n printf (\"Affinity(%ld\/%d cpus): thread=%p\", sysconf (_SC_NPROCESSORS_ONLN), CPU_SETSIZE, (void*)thread);\n for (int j = 0; j < CPU_SETSIZE; j++)\n if (CPU_ISSET (j, &cpuset))\n {\n printf (\" CPU %d\\n\", j);\n return j;\n }\n return -1;\n}\n<commit_msg>ROPE: fixed signedness warning<commit_after>\/* Rapicorn-Python Bindings\n * Copyright (C) 2008 Tim Janik\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * A copy of the GNU Lesser General Public License should ship along\n * with this library; if not, see http:\/\/www.gnu.org\/copyleft\/.\n *\/\n#include \"rope.hh\" \/\/ must be included first to configure std headers\n#include <deque>\n\n\/\/ --- conventional Python module initializers ---\n#define MODULE_NAME pyRapicorn\n#define MODULE_NAME_STRING STRINGIFY (MODULE_NAME)\n#define MODULE_INIT_FUNCTION RAPICORN_CPP_PASTE2 (init, MODULE_NAME)\n\nstatic int cpu_affinity (int cpu); \/\/ FIXME\n\n\/\/ --- rope2cxx stubs (generated) ---\n#include \"rope2cxx.cc\"\n\n\/\/ --- Anonymous namespacing\nnamespace {\n\n\/\/ --- cpy2rope stubs (generated) ---\n#define HAVE_PLIC_CALL_REMOTE 1\nstatic Rapicorn::Plic::FieldBuffer* plic_call_remote (Rapicorn::Plic::FieldBuffer*);\nstatic PyObject* plic_cpy_trampoline (PyObject *pyself, PyObject *pyargs); \/\/ generated\n#include \"cpy2rope.cc\"\ntypedef Rapicorn::Plic::FieldBuffer FieldBuffer;\ntypedef Rapicorn::Plic::FieldBuffer8 FieldBuffer8;\n\n\/\/ --- globals ---\nstatic PyObject *rapicorn_exception = NULL;\n\n\/\/ --- rapicorn thread ---\nstatic uint max_call_stack_size = 0;\nstatic void print_max_call_stack_size()\n{\n printerr (\"DEBUG:atexit: max_call_stack_size: %u\\n\", max_call_stack_size);\n}\n\nclass UIThread : public Thread {\n EventLoop * volatile m_loop;\n virtual void\n run ()\n {\n cpu_affinity (m_cpu);\n \/\/ rapicorn_init_core() already called\n Rapicorn::StringList slist;\n slist.strings = this->cmdline_args;\n App.init_with_x11 (this->application_name, slist);\n m_loop = ref_sink (EventLoop::create());\n EventLoop::Source *esource = new ProcSource (*this);\n (*m_loop).add_source (esource, MAXINT);\n esource->exitable (false);\n {\n FieldBuffer *fb = FieldBuffer::_new (2);\n fb->add_int64 (0x02000000); \/\/ proc_id\n Deletable *dapp = &App;\n fb->add_string (dapp->object_url());\n push_return (fb);\n }\n App.execute_loops();\n }\n bool\n dispatch ()\n {\n const FieldBuffer *call = pop_proc();\n if (call)\n {\n if (0)\n {\n#if 0\n std::string string;\n if (!google::protobuf::TextFormat::PrintToString (*proc, &string))\n string = \"{*protobuf::TextFormat ERROR*}\";\n printerr (\"Rapicorn::UIThread::call:\\n%s\\n\", string.c_str());\n#endif\n }\n FieldBuffer *fr;\n FieldBuffer8 fdummy (2);\n if (call->first_id() >= 0x02000000)\n fr = FieldBuffer::_new (2);\n else\n fr = &fdummy;\n bool success = plic_call_wrapper_switch (*call, *fr);\n if (!success)\n {\n printerr (\"UIThread::call error (see logs)\\n\"); \/\/ FIXME\n if (call->first_id() >= 0x02000000)\n {\n FieldBuffer *fb = FieldBuffer::_new (2);\n fb->add_int64 (0x02000000); \/\/ proc_id\n fb->add_string (\"*ERROR*\"); \/\/ FIXME\n push_return (fb);\n }\n if (call->first_id() >= 0x02000000)\n delete fr;\n }\n else if (call->first_id() >= 0x02000000)\n push_return (fr);\n delete call;\n }\n return true;\n }\nprotected:\n class ProcSource : public virtual EventLoop::Source {\n UIThread &m_thread;\n RAPICORN_PRIVATE_CLASS_COPY (ProcSource);\n protected:\n \/*Des*\/ ~ProcSource() {}\n virtual bool prepare (uint64 current_time_usecs,\n int64 *timeout_usecs_p) { return m_thread.check_dispatch(); }\n virtual bool check (uint64 current_time_usecs) { return m_thread.check_dispatch(); }\n virtual bool dispatch () { return m_thread.dispatch(); }\n public:\n explicit ProcSource (UIThread &thread) : m_thread (thread) {}\n };\npublic:\n int m_cpu;\n String application_name;\n vector<String> cmdline_args;\n UIThread (const String &name) :\n Thread (name),\n m_loop (NULL),\n m_cpu (-1),\n rrx (0),\n rpx (0)\n {\n rrv.reserve (1);\n atexit (print_max_call_stack_size);\n }\n ~UIThread()\n {\n unref (m_loop);\n m_loop = NULL;\n }\nprivate:\n Mutex rrm;\n Cond rrc;\n vector<FieldBuffer*> rrv, rro;\n size_t rrx;\npublic:\n void\n push_return (FieldBuffer *rret)\n {\n rrm.lock();\n rrv.push_back (rret);\n rrc.signal();\n rrm.unlock();\n Thread::Self::yield(); \/\/ allow fast return value handling on single core\n }\n FieldBuffer*\n fetch_return (void)\n {\n if (rrx >= rro.size())\n {\n if (rrx)\n rro.resize (0);\n rrm.lock();\n while (rrv.size() == 0)\n rrc.wait (rrm);\n rrv.swap (rro); \/\/ fetch result\n rrm.unlock();\n rrx = 0;\n }\n \/\/ rrx < rro.size()\n return rro[rrx++];\n }\nprivate:\n Mutex rps;\n vector<FieldBuffer*> rpv, rpo;\n size_t rpx;\npublic:\n void\n push_proc (FieldBuffer *proc)\n {\n int64 call_id = proc->first_id();\n size_t sz;\n rps.lock();\n rpv.push_back (proc);\n sz = rpv.size();\n rps.unlock();\n m_loop->wakeup();\n if (call_id >= 0x02000000 || \/\/ minimize turn-around times for two-way calls\n sz >= 1009) \/\/ allow batch processing of one-way call queue\n Thread::Self::yield(); \/\/ useless if threads have different CPU affinity\n }\n FieldBuffer*\n pop_proc (bool advance = true)\n {\n if (rpx >= rpo.size())\n {\n if (rpx)\n rpo.resize (0);\n rps.lock();\n rpv.swap (rpo);\n rps.unlock();\n rpx = 0;\n max_call_stack_size = MAX (max_call_stack_size, rpo.size());\n }\n if (rpx < rpo.size())\n {\n size_t indx = rpx;\n if (advance)\n rpx++;\n return rpo[indx];\n }\n return NULL;\n }\n bool\n check_dispatch ()\n {\n return pop_proc (false) != NULL;\n }\nprivate:\n static UIThread *ui_thread;\npublic:\n static String\n ui_thread_create (const String &application_name,\n const std::vector<String> &cmdline_args)\n {\n return_val_if_fail (ui_thread == NULL, \"\");\n \/* initialize core *\/\n RapicornInitValue ivalues[] = {\n { NULL }\n };\n int argc = 0;\n char **argv = NULL;\n rapicorn_init_core (&argc, &argv, NULL, ivalues);\n \/* start parallel thread *\/\n ui_thread = new UIThread (\"RapicornUI\");\n ref_sink (ui_thread);\n ui_thread->application_name = application_name;\n ui_thread->cmdline_args = cmdline_args;\n ui_thread->m_cpu = cpu_affinity (1);\n ui_thread->start();\n FieldBuffer *rpret = ui_thread->fetch_return();\n String appurl;\n if (rpret && rpret->first_id() == 0x02000000)\n {\n Rapicorn::Plic::FieldBufferReader rpr (*rpret);\n rpr.skip(); \/\/ proc_id\n if (rpr.remaining() > 0 && rpr.get_type() == Rapicorn::Plic::STRING)\n appurl = rpr.pop_string();\n }\n delete rpret;\n return appurl;\n }\n static FieldBuffer*\n ui_thread_call_remote (FieldBuffer *call)\n {\n if (!ui_thread)\n return false;\n int64 call_id = call->first_id();\n ui_thread->push_proc (call); \/\/ deletes call\n if (0) \/\/ debug\n printf (\"Remote Procedure Call, id=0x%08llx (%s-way)\\n\",\n call_id, call_id >= 0x02000000 ? \"two\" : \"one\");\n if (call_id >= 0x02000000)\n {\n FieldBuffer *rpret = ui_thread->fetch_return();\n if (0)\n printerr (\"Remote Procedure Return: 0x%08llx\\n\", rpret->first_id());\n return rpret;\n }\n return NULL;\n }\n};\nUIThread *UIThread::ui_thread = NULL;\n\nstatic Rapicorn::Plic::FieldBuffer*\nplic_call_remote (Rapicorn::Plic::FieldBuffer *call)\n{\n return UIThread::ui_thread_call_remote (call);\n}\n\n\/\/ --- PyC functions ---\nstatic PyObject*\nrope_printout (PyObject *self,\n PyObject *args)\n{\n const char *ns = NULL;\n unsigned int nl = 0;\n if (!PyArg_ParseTuple (args, \"s#\", &ns, &nl))\n return NULL;\n String str = String (ns, nl);\n printout (\"%s\", str.c_str());\n return None_INCREF();\n}\n\nstatic PyObject*\nrope_init_dispatcher (PyObject *self,\n PyObject *args)\n{\n const char *ns = NULL;\n unsigned int nl = 0;\n PyObject *list;\n if (!PyArg_ParseTuple (args, \"s#O\", &ns, &nl, &list))\n return NULL;\n const ssize_t len = PyList_Size (list);\n if (len < 0)\n return NULL;\n std::vector<String> strv;\n for (ssize_t k = 0; k < len; k++)\n {\n PyObject *item = PyList_GET_ITEM (list, k);\n char *as = NULL;\n Py_ssize_t al = 0;\n if (PyString_AsStringAndSize (item, &as, &al) < 0)\n return NULL;\n strv.push_back (String (as, al));\n }\n if (PyErr_Occurred())\n return NULL;\n String appurl = UIThread::ui_thread_create (String (ns, nl), strv);\n if (appurl.size() == 0)\n ; \/\/ FIXME: throw exception\n return PyString_FromStringAndSize (appurl.data(), appurl.size());\n}\n\n} \/\/ Anon\n\n\/\/ --- Python module definitions (global namespace) ---\nstatic PyMethodDef rope_vtable[] = {\n { \"_init_dispatcher\", rope_init_dispatcher, METH_VARARGS,\n \"Rapicorn::_init_dispatcher() - initial setup.\" },\n { \"__rope_pytrampoline__\", plic_cpy_trampoline, METH_VARARGS,\n \"Rapicorn function invokation trampoline.\" },\n { \"printout\", rope_printout, METH_VARARGS,\n \"Rapicorn::printout() - print to stdout.\" },\n { NULL, } \/\/ sentinel\n};\nstatic const char rapicorn_doc[] = \"Rapicorn Python Language Binding Module.\";\n\nPyMODINIT_FUNC\nMODULE_INIT_FUNCTION (void) \/\/ conventional dlmodule initializer\n{\n \/\/ register module\n PyObject *m = Py_InitModule3 (MODULE_NAME_STRING, rope_vtable, (char*) rapicorn_doc);\n if (!m)\n return;\n\n \/\/ register Rypicorn exception\n if (!rapicorn_exception)\n rapicorn_exception = PyErr_NewException ((char*) MODULE_NAME_STRING \".exception\", NULL, NULL);\n if (!rapicorn_exception)\n return;\n Py_INCREF (rapicorn_exception);\n PyModule_AddObject (m, \"exception\", rapicorn_exception);\n\n \/\/ retrieve argv[0]\n char *argv0;\n {\n PyObject *sysmod = PyImport_ImportModule (\"sys\");\n PyObject *astr = sysmod ? PyObject_GetAttrString (sysmod, \"argv\") : NULL;\n PyObject *arg0 = astr ? PySequence_GetItem (astr, 0) : NULL;\n argv0 = arg0 ? strdup (PyString_AsString (arg0)) : NULL;\n Py_XDECREF (arg0);\n Py_XDECREF (astr);\n Py_XDECREF (sysmod);\n if (!argv0)\n return; \/\/ exception set\n }\n\n \/\/ initialize Rapicorn with dummy argv, hardcode X11 temporarily\n {\n \/\/ int dummyargc = 1;\n char *dummyargs[] = { NULL, NULL };\n dummyargs[0] = argv0[0] ? argv0 : (char*) \"Python>>>\";\n \/\/ char **dummyargv = dummyargs;\n \/\/ FIXME: \/\/ App.init_with_x11 (&dummyargc, &dummyargv, dummyargs[0]);\n }\n free (argv0);\n}\n\/\/ using global namespace for Python module initialization\n\n\n\n\/\/ FIXME: move...\n\/\/#define _GNU_SOURCE\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <errno.h>\n\nstatic int\ncpu_affinity (int cpu)\n{\n pthread_t thread = pthread_self();\n cpu_set_t cpuset;\n\n if (cpu >= 0 && cpu < CPU_SETSIZE)\n {\n CPU_ZERO (&cpuset);\n CPU_SET (cpu, &cpuset);\n if (pthread_setaffinity_np (thread, sizeof (cpu_set_t), &cpuset) != 0)\n perror (\"pthread_setaffinity_np\");\n }\n\n if (pthread_getaffinity_np (thread, sizeof (cpu_set_t), &cpuset) != 0)\n perror (\"pthread_getaffinity_np\");\n printf (\"Affinity(%ld\/%d cpus): thread=%p\", sysconf (_SC_NPROCESSORS_ONLN), CPU_SETSIZE, (void*)thread);\n for (int j = 0; j < CPU_SETSIZE; j++)\n if (CPU_ISSET (j, &cpuset))\n {\n printf (\" CPU %d\\n\", j);\n return j;\n }\n return -1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"DELTAPAK_S.H\"\n\n#include \"DELTAPAK.H\"\n#include \"DRAW.H\"\n#include \"MATHS.H\"\n#include \"SETUP.H\"\n#include \"SPECIFIC.H\"\n\nvoid DrawCutSeqActors()\/\/90DCC(<),\n{\n\tstruct NEW_CUTSCENE* cut;\/\/$s3\n\n\tcut = &GLOBAL_cutme[0];\n\t\/\/a0 = meshes\n\t\/\/v0 = cut->numactors\n\t\/\/s6 = 1\n\n\tif (1 < cut->numactors)\n\t{\n\t\tmPushMatrix();\n\n\t\t\/\/loc_90E1C\n\t\tmPushMatrix();\n\n\t\t\/\/v1 = 1 << 2\n\t\t\/\/s7 = cutseq_meshbits[1];\/\/$v1 shft\n\t\t\/\/fp = cutseq_meshswapbits[1];\/\/$v1 shft\n\t\t\/\/v0 = 0x80000000 & cutseq_meshbits[1];\n\n\t\tif (0x80000000 & cutseq_meshbits[1])\n\t\t{\n\t\t\t\/\/v0 = &actor_pnodes[1];\/\/$v1 shft\n\n\t\t\t\/\/v1 = 1 << 3\n\t\t\t\/\/v1 = &cut[2];\n\t\t\tsizeof(struct NEW_CUTSCENE);\n\t\t}\/\/loc_90FDC\n\t}\/\/loc_91000\n\n#if 0\naddu $v1, $s3, $v1\nlh $a1, 0x1E($v1)\nlw $a0, 0($v0)\nli $a2, 0xA60FC\njal sub_91030\naddiu $a1, 1\nsll $v1, $s6, 3\naddu $v1, $s3, $v1\nlh $v1, 0x1C($v1)\nlw $a0, 4($s3)\nlw $a1, 8($s3)\nlw $a2, 0xC($s3)\nli $v0, 0x1F2480\nsll $v1, 6\njal sub_76568\naddu $s4, $v1, $v0\njal sub_91110\nnop\nlh $v0, 2($s4)\nlw $v1, 4($s4)\nsll $v0, 2\naddu $s1, $s0, $v0\nlw $v0, 0x2030($gp)\nsll $v1, 2\nli $a2, 0xA60FC\nlh $a0, 0xC($a2)\nlh $a1, 0xE($a2)\nlh $a2, 0x10($a2)\njal sub_7658C\naddu $s2, $v0, $v1\naddiu $a0, $sp, 0x48+var_38\nmove $a1, $zero\nli $v0, 0xA610E\njal sub_768BC\nsw $v0, 0x48+var_38($sp)\nandi $v0, $s7, 1\nbeqz $v0, loc_90F3C\nandi $v0, $fp, 1\nbeqz $v0, loc_90F1C\nlw $a0, 0($s1)\nlw $a0, 4($s1)\n\nloc_90F1C:\naddiu $at, $s6, -1\nbnez $at, loc_90F34\nnop\nlw $a1, 0x410($gp)\njal sub_7FAD4\naddiu $ra, 8\n\nloc_90F34:\njal sub_7EEC4\nli $a1, 0xFFFFFFFF\n\nloc_90F3C:\nlh $s4, 0($s4)\nli $s5, 1\naddiu $s4, -1\nblez $s4, loc_90FDC\naddiu $s1, 8\n\nloc_90F50:\nlw $a1, 0($s2)\naddiu $s4, -1\nandi $v0, $a1, 1\nbeqz $v0, loc_90F6C\nandi $a1, 2\njal sub_76520\nnop\n\nloc_90F6C:\nbeqz $a1, loc_90F7C\nsll $s5, 1\njal sub_764D0\nnop\n\nloc_90F7C:\nlw $a0, 4($s2)\nlw $a1, 8($s2)\njal sub_7658C\nlw $a2, 0xC($s2)\naddiu $a0, $sp, 0x48+var_38\njal sub_768BC\nmove $a1, $zero\nand $v0, $s5, $s7\nbeqz $v0, loc_90FD0\nand $v0, $s5, $fp\nbeqz $v0, loc_90FB0\nlw $a0, 0($s1)\nlw $a0, 4($s1)\n\nloc_90FB0:\naddiu $at, $s6, -1\nbnez $at, loc_90FC8\nnop\nlw $a1, 0x410($gp)\njal sub_7FAD4\naddiu $ra, 8\n\nloc_90FC8:\njal sub_7EEC4\nli $a1, 0xFFFFFFFF\n\nloc_90FD0:\naddiu $s2, 0x10\nbnez $s4, loc_90F50\naddiu $s1, 8\n\nloc_90FDC:\njal sub_76520\nnop\nlh $v1, 0($s3)\naddiu $s6, 1\nslt $v1, $s6, $v1\nbnez $v1, loc_90E1C\nnop\njal sub_76520\nnop\n\nloc_91000:\nlw $ra, 0x48+var_4($sp)\nlw $fp, 0x48+var_8($sp)\nlw $s7, 0x48+var_C($sp)\nlw $s6, 0x48+var_10($sp)\nlw $s5, 0x48+var_14($sp)\nlw $s4, 0x48+var_18($sp)\nlw $s3, 0x48+var_1C($sp)\nlw $s2, 0x48+var_20($sp)\nlw $s1, 0x48+var_24($sp)\nlw $s0, 0x48+var_28($sp)\njr $ra\naddiu $sp, 0x48\n#endif\n}\n\nvoid updateAnimFrame(struct PACKNODE* node, int flags, short* frame)\/\/ (F)\n{\n\tframe[7] = 3 * node->yrot_run;\n\n\tshort x = 3 * node->xrot_run;\n\tshort z = 3 * node->zrot_run;\n\n\tswitch (cutrot)\n\t{\n\tcase 0:\n\t\tframe[6] = x;\n\t\tframe[8] = z;\n\t\tbreak;\n\tcase 1:\n\t\tframe[6] = z;\n\t\tframe[8] = -x;\n\t\tbreak;\n\tcase 2:\n\t\tframe[6] = -x;\n\t\tframe[8] = -z;\n\t\tbreak;\n\tcase 3:\n\t\tframe[6] = -z;\n\t\tframe[8] = x;\n\t\tbreak;\n\t}\n\n\tshort* next = frame + 9;\n\n\tfor (int i = 1; i < flags; i++, next += 2)\n\t{\n\t\tshort x = node[i].yrot_run;\n\t\tshort y = node[i].zrot_run;\n\t\tshort z = node[i].xrot_run;\n\n\t\tif (cutrot && i == 1)\n\t\t{\n\t\t\tx = (x + ((short)cutrot << 8)) & 0x3FF;\n\t\t}\n\n\t\tnext[0] = (y | ((x | (z << 10)) << 10)) >> 16;\n\t\tnext[1] = y | ((x | (z << 10)) << 10);\n\t}\n}\n\nint GetTrackWord(unsigned long off, char* packed, unsigned char packmethod)\n{\n\tint a0 = off * packmethod;\n\tint v0 = a0 >> 3;\n\tpacked = &packed[v0];\n\ta0 &= 7;\n\tunsigned int at = ((unsigned char*)packed)[0] | (((unsigned char*)packed)[1] << 8) | (((unsigned char*)packed)[2] << 16) | (((unsigned char*)packed)[3] << 24);\n\tat = at >> a0;\n\tunsigned int v1 = (1 << packmethod) - 1;\n\tat &= v1;\n\tpackmethod -= 1;\n\tv0 = (1 << packmethod);\n\tv0 = at & v0;\n\n\tif (v0 != 0)\n\t{\n\t\tv0 = v1 ^ -1;\/\/\/@CHECKME nor $v0, $zero, $v1\n\t\tat |= v0;\n\t}\n\telse\n\t{\n\t\tv0 = v1 ^ -1;\/\/\/@CHECKME nor $v0, $zero, $v1\n\t}\n\t\/\/loc_90DC0\n\tv0 = at << 16;\n\tv0 >>= 16;\n\n\treturn v0;\n}\n\nint DecodeTrack(char* packed, struct RTDECODE* decode)\/\/90BD8(<), ?\n{\n\tint t0 = 0;\n\tint v0 = 0;\n\n\tif (decode->decodetype == 0)\n\t{\n\t\tt0 = GetTrackWord(decode->off, packed, decode->packmethod);\n\n\t\tif (!(t0 & 0x20))\n\t\t{\n\t\t\tdecode->decodetype = 2;\n\n\t\t\tif ((t0 & 0x10))\n\t\t\t{\n\t\t\t\tGetTrackWord(decode->off + 1, packed, decode->packmethod);\n\t\t\t\tdecode->counter = ((t0 & 7) << 5) | (GetTrackWord(decode->off + 1, packed, decode->packmethod) & 0x1F);\n\t\t\t\tdecode->data = GetTrackWord(decode->off + 2, packed, decode->packmethod);\n\t\t\t\tdecode->off += 3;\n\t\t\t\tdecode->length -= 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/loc_90C70\n\t\t\t\tdecode->data = GetTrackWord(decode->off + 1, packed, decode->packmethod);\n\t\t\t\tdecode->counter = t0 & 0x7;\n\t\t\t\tdecode->off += 2;\n\t\t\t\tdecode->length -= 2;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/loc_90CA0\n\t\t\tif (!(t0 & 0xF))\n\t\t\t{\n\t\t\t\tdecode->counter = 16;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdecode->counter = (t0 & 0xF);\n\t\t\t}\n\n\t\t\t\/\/loc_90CAC\n\t\t\tdecode->decodetype = 1;\n\t\t\tdecode->off += 1;\n\t\t\tdecode->length -= 1;\n\t\t}\n\t}\n\t\/\/loc_90CD0\n\tif (decode->decodetype == 2)\n\t{\n\t\tif (--decode->counter == 0)\n\t\t{\n\t\t\tdecode->decodetype = 0;\n\t\t}\n\n\t\t\/\/loc_90CFC\n\t\treturn decode->data;\n\t}\n\n\t\/\/loc_90D08\n\tv0 = GetTrackWord(decode->off, packed, decode->packmethod);\n\n\tdecode->counter -= 1;\n\tdecode->off += 1;\n\tdecode->length -= 1;\n\n\tif (!(decode->counter & 0xFFFF))\n\t{\n\t\tdecode->decodetype = 0;\n\t}\n\t\/\/loc_90D48\n\tv0 <<= 16;\n\tv0 >>= 16;\n\n\treturn v0;\n}\n\nvoid DecodeAnim(struct PACKNODE* node, int a1, int frame, short a3)\/\/90A88(<), ?\n{\n\tint t4;\n\t\/\/t7 = a3\n\t\/\/t3 = node\n\t\/\/t5 = a1\n\tstruct PACKNODE* pn = NULL;\/\/$t0\n\n\tif (frame == 0)\n\t{\n\t\tt4 = 0;\n\t\tif (a1 > 0)\n\t\t{\n\t\t\tpn = node;\n\t\t\t\/\/loc_90AA8\n\t\t\tdo\n\t\t\t{\n\t\t\t\tt4++;\n\n\t\t\t\tpn->decode_x.off = 0;\n\t\t\t\tpn->decode_x.counter = 0;\n\t\t\t\tpn->decode_x.data = 0;\n\t\t\t\tpn->decode_x.decodetype = 0;\n\n\t\t\t\tpn->decode_y.off = 0;\n\t\t\t\tpn->decode_y.counter = 0;\n\t\t\t\tpn->decode_y.data = 0;\n\t\t\t\tpn->decode_y.decodetype = 0;\n\n\t\t\t\tpn->decode_z.off = 0;\n\t\t\t\tpn->decode_z.counter = 0;\n\t\t\t\tpn->decode_z.data = 0;\n\t\t\t\tpn->decode_z.decodetype = 0;\n\n\t\t\t\tpn->xrot_run = (unsigned short)pn->xkey;\n\t\t\t\tpn->yrot_run = (unsigned short)pn->ykey;\n\t\t\t\tpn->zrot_run = (unsigned short)pn->zkey;\n\n\t\t\t\tpn->decode_x.length = pn->xlength;\n\t\t\t\tpn->decode_y.length = pn->ylength;\n\t\t\t\tpn->decode_z.length = pn->zlength;\n\t\t\t\tpn++;\n\t\t\t} while (t4 < a1);\n\t\t}\/\/loc_90BD0\n\t}\n\telse\n\t{\n\t\t\/\/loc_90B14\n\t\tDecodeTrack(node->xpacked, &node->decode_x);\n\t}\n#if 0\nloc_90B14:\nlw $a0, 0x48($t3)\njal sub_90BD8\naddiu $a1, $t3, 0xC\n\naddiu $a1, $t3, 0x1C\nlhu $v1, 0($t3)\nlw $a0, 0x4C($t3)\naddu $v1, $v0\njal sub_90BD8\nsh $v1, 0($t3)\n\naddiu $a1, $t3, 0x2C\nlhu $v1, 2($t3)\nlw $a0, 0x50($t3)\naddu $v1, $v0\njal sub_90BD8\nsh $v1, 2($t3)\n\nlhu $v1, 4($t3)\nli $t4, 1\naddu $v1, $v0\nslt $v0, $t4, $t5\nbeqz $v0, loc_90BD0\nsh $v1, 4($t3)\naddiu $t3, 0x54\n\nloc_90B6C:\nlw $a0, 0x48($t3)\njal sub_90BD8\naddiu $a1, $t3, 0xC\n\naddiu $a1, $t3, 0x1C\nlhu $v1, 0($t3)\nlw $a0, 0x4C($t3)\naddu $v1, $v0\nand $v1, $t7\njal sub_90BD8\nsh $v1, 0($t3)\n\naddiu $a1, $t3, 0x2C\nlhu $v1, 2($t3)\nlw $a0, 0x50($t3)\naddu $v1, $v0\nand $v1, $t7\njal sub_90BD8\nsh $v1, 2($t3)\n\nlhu $v1, 4($t3)\naddiu $t4, 1\naddu $v1, $v0\nand $v1, $t7\nsh $v1, 4($t3)\nslt $v0, $t4, $t5\nbnez $v0, loc_90B6C\naddiu $t3, 0x54\n\nloc_90BD0:\njr $t6\nnop\n#endif\n}\n<commit_msg>[Specific-PSXPC_N] Implement DecodeAnim.<commit_after>#include \"DELTAPAK_S.H\"\n\n#include \"DELTAPAK.H\"\n#include \"DRAW.H\"\n#include \"MATHS.H\"\n#include \"SETUP.H\"\n#include \"SPECIFIC.H\"\n\nvoid DrawCutSeqActors()\/\/90DCC(<),\n{\n\tstruct NEW_CUTSCENE* cut;\/\/$s3\n\n\tcut = &GLOBAL_cutme[0];\n\t\/\/a0 = meshes\n\t\/\/v0 = cut->numactors\n\t\/\/s6 = 1\n\n\tif (1 < cut->numactors)\n\t{\n\t\tmPushMatrix();\n\n\t\t\/\/loc_90E1C\n\t\tmPushMatrix();\n\n\t\t\/\/v1 = 1 << 2\n\t\t\/\/s7 = cutseq_meshbits[1];\/\/$v1 shft\n\t\t\/\/fp = cutseq_meshswapbits[1];\/\/$v1 shft\n\t\t\/\/v0 = 0x80000000 & cutseq_meshbits[1];\n\n\t\tif (0x80000000 & cutseq_meshbits[1])\n\t\t{\n\t\t\t\/\/v0 = &actor_pnodes[1];\/\/$v1 shft\n\n\t\t\t\/\/v1 = 1 << 3\n\t\t\t\/\/v1 = &cut[2];\n\t\t\tsizeof(struct NEW_CUTSCENE);\n\t\t}\/\/loc_90FDC\n\t}\/\/loc_91000\n\n#if 0\naddu $v1, $s3, $v1\nlh $a1, 0x1E($v1)\nlw $a0, 0($v0)\nli $a2, 0xA60FC\njal sub_91030\naddiu $a1, 1\nsll $v1, $s6, 3\naddu $v1, $s3, $v1\nlh $v1, 0x1C($v1)\nlw $a0, 4($s3)\nlw $a1, 8($s3)\nlw $a2, 0xC($s3)\nli $v0, 0x1F2480\nsll $v1, 6\njal sub_76568\naddu $s4, $v1, $v0\njal sub_91110\nnop\nlh $v0, 2($s4)\nlw $v1, 4($s4)\nsll $v0, 2\naddu $s1, $s0, $v0\nlw $v0, 0x2030($gp)\nsll $v1, 2\nli $a2, 0xA60FC\nlh $a0, 0xC($a2)\nlh $a1, 0xE($a2)\nlh $a2, 0x10($a2)\njal sub_7658C\naddu $s2, $v0, $v1\naddiu $a0, $sp, 0x48+var_38\nmove $a1, $zero\nli $v0, 0xA610E\njal sub_768BC\nsw $v0, 0x48+var_38($sp)\nandi $v0, $s7, 1\nbeqz $v0, loc_90F3C\nandi $v0, $fp, 1\nbeqz $v0, loc_90F1C\nlw $a0, 0($s1)\nlw $a0, 4($s1)\n\nloc_90F1C:\naddiu $at, $s6, -1\nbnez $at, loc_90F34\nnop\nlw $a1, 0x410($gp)\njal sub_7FAD4\naddiu $ra, 8\n\nloc_90F34:\njal sub_7EEC4\nli $a1, 0xFFFFFFFF\n\nloc_90F3C:\nlh $s4, 0($s4)\nli $s5, 1\naddiu $s4, -1\nblez $s4, loc_90FDC\naddiu $s1, 8\n\nloc_90F50:\nlw $a1, 0($s2)\naddiu $s4, -1\nandi $v0, $a1, 1\nbeqz $v0, loc_90F6C\nandi $a1, 2\njal sub_76520\nnop\n\nloc_90F6C:\nbeqz $a1, loc_90F7C\nsll $s5, 1\njal sub_764D0\nnop\n\nloc_90F7C:\nlw $a0, 4($s2)\nlw $a1, 8($s2)\njal sub_7658C\nlw $a2, 0xC($s2)\naddiu $a0, $sp, 0x48+var_38\njal sub_768BC\nmove $a1, $zero\nand $v0, $s5, $s7\nbeqz $v0, loc_90FD0\nand $v0, $s5, $fp\nbeqz $v0, loc_90FB0\nlw $a0, 0($s1)\nlw $a0, 4($s1)\n\nloc_90FB0:\naddiu $at, $s6, -1\nbnez $at, loc_90FC8\nnop\nlw $a1, 0x410($gp)\njal sub_7FAD4\naddiu $ra, 8\n\nloc_90FC8:\njal sub_7EEC4\nli $a1, 0xFFFFFFFF\n\nloc_90FD0:\naddiu $s2, 0x10\nbnez $s4, loc_90F50\naddiu $s1, 8\n\nloc_90FDC:\njal sub_76520\nnop\nlh $v1, 0($s3)\naddiu $s6, 1\nslt $v1, $s6, $v1\nbnez $v1, loc_90E1C\nnop\njal sub_76520\nnop\n\nloc_91000:\nlw $ra, 0x48+var_4($sp)\nlw $fp, 0x48+var_8($sp)\nlw $s7, 0x48+var_C($sp)\nlw $s6, 0x48+var_10($sp)\nlw $s5, 0x48+var_14($sp)\nlw $s4, 0x48+var_18($sp)\nlw $s3, 0x48+var_1C($sp)\nlw $s2, 0x48+var_20($sp)\nlw $s1, 0x48+var_24($sp)\nlw $s0, 0x48+var_28($sp)\njr $ra\naddiu $sp, 0x48\n#endif\n}\n\nvoid updateAnimFrame(struct PACKNODE* node, int flags, short* frame)\/\/ (F)\n{\n\tframe[7] = 3 * node->yrot_run;\n\n\tshort x = 3 * node->xrot_run;\n\tshort z = 3 * node->zrot_run;\n\n\tswitch (cutrot)\n\t{\n\tcase 0:\n\t\tframe[6] = x;\n\t\tframe[8] = z;\n\t\tbreak;\n\tcase 1:\n\t\tframe[6] = z;\n\t\tframe[8] = -x;\n\t\tbreak;\n\tcase 2:\n\t\tframe[6] = -x;\n\t\tframe[8] = -z;\n\t\tbreak;\n\tcase 3:\n\t\tframe[6] = -z;\n\t\tframe[8] = x;\n\t\tbreak;\n\t}\n\n\tshort* next = frame + 9;\n\n\tfor (int i = 1; i < flags; i++, next += 2)\n\t{\n\t\tshort x = node[i].yrot_run;\n\t\tshort y = node[i].zrot_run;\n\t\tshort z = node[i].xrot_run;\n\n\t\tif (cutrot && i == 1)\n\t\t{\n\t\t\tx = (x + ((short)cutrot << 8)) & 0x3FF;\n\t\t}\n\n\t\tnext[0] = (y | ((x | (z << 10)) << 10)) >> 16;\n\t\tnext[1] = y | ((x | (z << 10)) << 10);\n\t}\n}\n\nint GetTrackWord(unsigned long off, char* packed, unsigned char packmethod)\n{\n\tint a0 = off * packmethod;\n\tint v0 = a0 >> 3;\n\tpacked = &packed[v0];\n\ta0 &= 7;\n\tunsigned int at = ((unsigned char*)packed)[0] | (((unsigned char*)packed)[1] << 8) | (((unsigned char*)packed)[2] << 16) | (((unsigned char*)packed)[3] << 24);\n\tat = at >> a0;\n\tunsigned int v1 = (1 << packmethod) - 1;\n\tat &= v1;\n\tpackmethod -= 1;\n\tv0 = (1 << packmethod);\n\tv0 = at & v0;\n\n\tif (v0 != 0)\n\t{\n\t\tv0 = v1 ^ -1;\/\/\/@CHECKME nor $v0, $zero, $v1\n\t\tat |= v0;\n\t}\n\telse\n\t{\n\t\tv0 = v1 ^ -1;\/\/\/@CHECKME nor $v0, $zero, $v1\n\t}\n\t\/\/loc_90DC0\n\tv0 = at << 16;\n\tv0 >>= 16;\n\n\treturn v0;\n}\n\nint DecodeTrack(char* packed, struct RTDECODE* decode)\/\/90BD8(<), ?\n{\n\tint t0 = 0;\n\tint v0 = 0;\n\n\tif (decode->decodetype == 0)\n\t{\n\t\tt0 = GetTrackWord(decode->off, packed, decode->packmethod);\n\n\t\tif (!(t0 & 0x20))\n\t\t{\n\t\t\tdecode->decodetype = 2;\n\n\t\t\tif ((t0 & 0x10))\n\t\t\t{\n\t\t\t\tGetTrackWord(decode->off + 1, packed, decode->packmethod);\n\t\t\t\tdecode->counter = ((t0 & 7) << 5) | (GetTrackWord(decode->off + 1, packed, decode->packmethod) & 0x1F);\n\t\t\t\tdecode->data = GetTrackWord(decode->off + 2, packed, decode->packmethod);\n\t\t\t\tdecode->off += 3;\n\t\t\t\tdecode->length -= 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t\/\/loc_90C70\n\t\t\t\tdecode->data = GetTrackWord(decode->off + 1, packed, decode->packmethod);\n\t\t\t\tdecode->counter = t0 & 0x7;\n\t\t\t\tdecode->off += 2;\n\t\t\t\tdecode->length -= 2;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/loc_90CA0\n\t\t\tif (!(t0 & 0xF))\n\t\t\t{\n\t\t\t\tdecode->counter = 16;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdecode->counter = (t0 & 0xF);\n\t\t\t}\n\n\t\t\t\/\/loc_90CAC\n\t\t\tdecode->decodetype = 1;\n\t\t\tdecode->off += 1;\n\t\t\tdecode->length -= 1;\n\t\t}\n\t}\n\t\/\/loc_90CD0\n\tif (decode->decodetype == 2)\n\t{\n\t\tif (--decode->counter == 0)\n\t\t{\n\t\t\tdecode->decodetype = 0;\n\t\t}\n\n\t\t\/\/loc_90CFC\n\t\treturn decode->data;\n\t}\n\n\t\/\/loc_90D08\n\tv0 = GetTrackWord(decode->off, packed, decode->packmethod);\n\n\tdecode->counter -= 1;\n\tdecode->off += 1;\n\tdecode->length -= 1;\n\n\tif (!(decode->counter & 0xFFFF))\n\t{\n\t\tdecode->decodetype = 0;\n\t}\n\t\/\/loc_90D48\n\tv0 <<= 16;\n\tv0 >>= 16;\n\n\treturn v0;\n}\n\nvoid DecodeAnim(struct PACKNODE* node, int a1, int frame, short a3)\/\/90A88(<), ?\n{\n\tint t4 = 0;\n\n\tif (frame == 0)\n\t{\n\t\tt4 = 0;\n\t\tif (a1 > 0)\n\t\t{\n\t\t\t\/\/loc_90AA8\n\t\t\tdo\n\t\t\t{\n\t\t\t\tt4++;\n\n\t\t\t\tnode->decode_x.off = 0;\n\t\t\t\tnode->decode_x.counter = 0;\n\t\t\t\tnode->decode_x.data = 0;\n\t\t\t\tnode->decode_x.decodetype = 0;\n\n\t\t\t\tnode->decode_y.off = 0;\n\t\t\t\tnode->decode_y.counter = 0;\n\t\t\t\tnode->decode_y.data = 0;\n\t\t\t\tnode->decode_y.decodetype = 0;\n\n\t\t\t\tnode->decode_z.off = 0;\n\t\t\t\tnode->decode_z.counter = 0;\n\t\t\t\tnode->decode_z.data = 0;\n\t\t\t\tnode->decode_z.decodetype = 0;\n\n\t\t\t\tnode->xrot_run = (unsigned short)node->xkey;\n\t\t\t\tnode->yrot_run = (unsigned short)node->ykey;\n\t\t\t\tnode->zrot_run = (unsigned short)node->zkey;\n\n\t\t\t\tnode->decode_x.length = node->xlength;\n\t\t\t\tnode->decode_y.length = node->ylength;\n\t\t\t\tnode->decode_z.length = node->zlength;\n\t\t\t\tnode++;\n\t\t\t} while (t4 < a1);\n\t\t}\n\t\t\/\/loc_90BD0\n\t\treturn;\n\t}\n\telse\n\t{\n\t\t\/\/loc_90B14\n\t\tnode->xrot_run += DecodeTrack(node->xpacked, &node->decode_x);\n\t\tnode->yrot_run += DecodeTrack(node->ypacked, &node->decode_y);\n\t\tnode->zrot_run += DecodeTrack(node->zpacked, &node->decode_z);\n\t\tt4 = 1;\n\t\tnode++;\n\t\tif (t4 >= a1)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t}\n\n\t\/\/loc_90B6C\n\tdo\n\t{\n\t\tnode->xrot_run += DecodeTrack(node->xpacked, &node->decode_x) & a3;\n\t\tnode->yrot_run += DecodeTrack(node->ypacked, &node->decode_y) & a3;\n\t\tnode->zrot_run += DecodeTrack(node->zpacked, &node->decode_z) & a3;\n\t\tt4++;\n\t\tnode++;\n\t} while (t4 < a1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2007 Till Adam <adam@kde.org>\n\n This library is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This library is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to the\n Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n 02110-1301, USA.\n*\/\n\n#include \"maildir.h\"\n\n#include <QDir>\n#include <QFileInfo>\n#include <QUuid>\n\n#include <klocale.h>\n\nusing namespace KPIM;\n\nstruct Maildir::Private\n{\n Private( const QString& p )\n :path(p)\n {\n }\n\n Private( const Private& rhs )\n {\n path = rhs.path;\n }\n\n bool operator==( const Private& rhs ) const\n {\n return path == rhs.path;\n }\n bool accessIsPossible( QString& error ) const;\n bool canAccess( const QString& path ) const;\n\n QStringList subPaths() const \n {\n QStringList paths;\n paths << path + QString::fromLatin1(\"\/cur\");\n paths << path + QString::fromLatin1(\"\/new\");\n paths << path + QString::fromLatin1(\"\/tmp\");\n return paths;\n }\n\n QStringList listNew() const\n {\n QDir d( path + QString::fromLatin1(\"\/new\") );\n return d.entryList(QDir::Files);\n }\n\n QStringList listCurrent() const\n {\n QDir d( path + QString::fromLatin1(\"\/cur\") );\n return d.entryList(QDir::Files);\n }\n\n QString findRealKey( const QString& key ) const\n {\n QString realKey = path + QString::fromLatin1(\"\/new\/\") + key;\n QFile f( realKey );\n if ( !f.exists() )\n realKey = path + QString::fromLatin1(\"\/cur\/\") + key;\n QFile f2( realKey );\n if ( !f2.exists() )\n realKey = QString();\n return realKey;\n }\n\n QString path;\n};\n\nMaildir::Maildir( const QString& path )\n:d( new Private(path) )\n{\n}\n\nvoid Maildir::swap( const Maildir &rhs )\n{\n Private *p = d;\n d = new Private( *rhs.d );\n delete p;\n}\n\n\nMaildir::Maildir(const Maildir & rhs)\n :d( new Private(*rhs.d) )\n\n{\n}\n\n\nMaildir& Maildir::operator= (const Maildir & rhs)\n{\n \/\/ copy and swap, exception safe, and handles assignment to self\n Maildir temp(rhs);\n swap( temp );\n return *this;\n}\n\n\nbool Maildir::operator== (const Maildir & rhs) const\n{\n return *d == *rhs.d;\n}\n\n\nMaildir::~Maildir()\n{\n delete d;\n}\n\nbool Maildir::Private::canAccess( const QString& path ) const\n{\n \/\/return access(QFile::encodeName( path ), R_OK | W_OK | X_OK ) != 0;\n \/\/ FIXME X_OK?\n QFileInfo d(path);\n return d.isReadable() && d.isWritable();\n}\n\nbool Maildir::Private::accessIsPossible( QString& error ) const\n{\n QStringList paths = subPaths();\n paths.prepend( path );\n\n Q_FOREACH( QString p, paths )\n {\n if ( !QFile::exists(p) ) {\n error = i18n(\"Error opening %1; this folder is missing.\",p);\n return false;\n }\n if ( !canAccess( p ) ) {\n error = i18n(\"Error opening %1; either this is not a valid \"\n \"maildir folder, or you do not have sufficient access permissions.\" ,p);\n return false;\n }\n }\n return true;\n}\n\nbool Maildir::isValid() const\n{\n QString error;\n return isValid( error );\n}\n\nbool Maildir::isValid( QString &error ) const\n{\n if ( d->accessIsPossible( error ) ) {\n return true;\n }\n return false;\n}\n\n\nbool Maildir::create()\n{\n Q_FOREACH( QString p, d->subPaths() ) {\n QDir dir( p );\n if ( !dir.exists( p ) ) {\n if ( !dir.mkpath( p ) )\n return false;\n }\n }\n return true;\n}\n\nQStringList Maildir::entryList() const\n{\n QStringList result;\n if ( isValid() ) {\n result += d->listNew();\n result += d->listCurrent();\n }\n\/\/ kDebug() << \"Maildir::entryList()\" << result;\n return result;\n}\n\n\nQStringList Maildir::subFolderList() const\n{\n QDir dir( d->path );\n QString subDirPath = QString::fromLatin1(\".%1.directory\").arg( dir.dirName() ); \n dir.cdUp();\n if (!dir.exists( subDirPath ) ) return QStringList();\n dir.cd( subDirPath );\n dir.setFilter( QDir::Dirs | QDir::NoDotAndDotDot );\n return dir.entryList();\n}\n\nQByteArray Maildir::readEntry( const QString& key ) const\n{\n QByteArray result;\n\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::readEntry unable to find: \" << key;\n return result;\n }\n\n QFile f( realKey );\n f.open( QIODevice::ReadOnly );\n\n \/\/ FIXME be safer than this\n result = f.readAll();\n\n return result;\n}\n\nstatic QString createUniqueFileName()\n{\n return QUuid::createUuid().toString();\n}\n\nvoid Maildir::writeEntry( const QString& key, const QByteArray& data )\n{\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::writeEntry unable to find: \" << key;\n return;\n }\n QFile f( realKey );\n f.open( QIODevice::WriteOnly );\n f.write( data );\n f.close();\n}\n\nQString Maildir::addEntry( const QByteArray& data )\n{\n QString uniqueKey( createUniqueFileName() );\n QString key( d->path + \"\/tmp\/\" + uniqueKey );\n QString finalKey( d->path + \"\/new\/\" + uniqueKey );\n QFile f( key );\n f.open( QIODevice::WriteOnly );\n f.write( data );\n f.close();\n if (!f.rename( finalKey )) {\n qWarning() << \"Maildir: Failed to add entry: \" << finalKey << \"!\";\n }\n return uniqueKey;\n}\n\nbool Maildir::removeEntry( const QString& key )\n{\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::removeEntry unable to find: \" << key;\n return false;\n }\n return QFile::remove(realKey);\n}\n\n<commit_msg>Add a fixme.<commit_after>\/*\n Copyright (c) 2007 Till Adam <adam@kde.org>\n\n This library is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This library is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to the\n Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n 02110-1301, USA.\n*\/\n\n#include \"maildir.h\"\n\n#include <QDir>\n#include <QFileInfo>\n#include <QUuid>\n\n#include <klocale.h>\n\nusing namespace KPIM;\n\nstruct Maildir::Private\n{\n Private( const QString& p )\n :path(p)\n {\n }\n\n Private( const Private& rhs )\n {\n path = rhs.path;\n }\n\n bool operator==( const Private& rhs ) const\n {\n return path == rhs.path;\n }\n bool accessIsPossible( QString& error ) const;\n bool canAccess( const QString& path ) const;\n\n QStringList subPaths() const \n {\n QStringList paths;\n paths << path + QString::fromLatin1(\"\/cur\");\n paths << path + QString::fromLatin1(\"\/new\");\n paths << path + QString::fromLatin1(\"\/tmp\");\n return paths;\n }\n\n QStringList listNew() const\n {\n QDir d( path + QString::fromLatin1(\"\/new\") );\n return d.entryList(QDir::Files);\n }\n\n QStringList listCurrent() const\n {\n QDir d( path + QString::fromLatin1(\"\/cur\") );\n return d.entryList(QDir::Files);\n }\n\n QString findRealKey( const QString& key ) const\n {\n QString realKey = path + QString::fromLatin1(\"\/new\/\") + key;\n QFile f( realKey );\n if ( !f.exists() )\n realKey = path + QString::fromLatin1(\"\/cur\/\") + key;\n QFile f2( realKey );\n if ( !f2.exists() )\n realKey = QString();\n return realKey;\n }\n\n QString path;\n};\n\nMaildir::Maildir( const QString& path )\n:d( new Private(path) )\n{\n}\n\nvoid Maildir::swap( const Maildir &rhs )\n{\n Private *p = d;\n d = new Private( *rhs.d );\n delete p;\n}\n\n\nMaildir::Maildir(const Maildir & rhs)\n :d( new Private(*rhs.d) )\n\n{\n}\n\n\nMaildir& Maildir::operator= (const Maildir & rhs)\n{\n \/\/ copy and swap, exception safe, and handles assignment to self\n Maildir temp(rhs);\n swap( temp );\n return *this;\n}\n\n\nbool Maildir::operator== (const Maildir & rhs) const\n{\n return *d == *rhs.d;\n}\n\n\nMaildir::~Maildir()\n{\n delete d;\n}\n\nbool Maildir::Private::canAccess( const QString& path ) const\n{\n \/\/return access(QFile::encodeName( path ), R_OK | W_OK | X_OK ) != 0;\n \/\/ FIXME X_OK?\n QFileInfo d(path);\n return d.isReadable() && d.isWritable();\n}\n\nbool Maildir::Private::accessIsPossible( QString& error ) const\n{\n QStringList paths = subPaths();\n paths.prepend( path );\n\n Q_FOREACH( QString p, paths )\n {\n if ( !QFile::exists(p) ) {\n error = i18n(\"Error opening %1; this folder is missing.\",p);\n return false;\n }\n if ( !canAccess( p ) ) {\n error = i18n(\"Error opening %1; either this is not a valid \"\n \"maildir folder, or you do not have sufficient access permissions.\" ,p);\n return false;\n }\n }\n return true;\n}\n\nbool Maildir::isValid() const\n{\n QString error;\n return isValid( error );\n}\n\nbool Maildir::isValid( QString &error ) const\n{\n if ( d->accessIsPossible( error ) ) {\n return true;\n }\n return false;\n}\n\n\nbool Maildir::create()\n{\n Q_FOREACH( QString p, d->subPaths() ) {\n QDir dir( p );\n if ( !dir.exists( p ) ) {\n if ( !dir.mkpath( p ) )\n return false;\n }\n }\n return true;\n}\n\nQStringList Maildir::entryList() const\n{\n QStringList result;\n if ( isValid() ) {\n result += d->listNew();\n result += d->listCurrent();\n }\n\/\/ kDebug() << \"Maildir::entryList()\" << result;\n return result;\n}\n\n\nQStringList Maildir::subFolderList() const\n{\n QDir dir( d->path );\n QString subDirPath = QString::fromLatin1(\".%1.directory\").arg( dir.dirName() ); \n dir.cdUp();\n if (!dir.exists( subDirPath ) ) return QStringList();\n dir.cd( subDirPath );\n dir.setFilter( QDir::Dirs | QDir::NoDotAndDotDot );\n return dir.entryList();\n}\n\nQByteArray Maildir::readEntry( const QString& key ) const\n{\n QByteArray result;\n\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::readEntry unable to find: \" << key;\n return result;\n }\n\n QFile f( realKey );\n f.open( QIODevice::ReadOnly );\n\n \/\/ FIXME be safer than this\n result = f.readAll();\n\n return result;\n}\n\nstatic QString createUniqueFileName()\n{\n return QUuid::createUuid().toString();\n}\n\nvoid Maildir::writeEntry( const QString& key, const QByteArray& data )\n{\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::writeEntry unable to find: \" << key;\n return;\n }\n QFile f( realKey );\n f.open( QIODevice::WriteOnly );\n f.write( data );\n f.close();\n}\n\nQString Maildir::addEntry( const QByteArray& data )\n{\n QString uniqueKey( createUniqueFileName() );\n QString key( d->path + \"\/tmp\/\" + uniqueKey );\n QString finalKey( d->path + \"\/new\/\" + uniqueKey );\n QFile f( key );\n f.open( QIODevice::WriteOnly );\n f.write( data );\n f.close();\n \/*\n * FIXME:\n *\n * THe whole point of the locking free maildir idea is that the moves between\n * the internal directories are atomic. Afaik QFile::rename does not guarantee\n * that, so this will need to be done properly. - ta\n *\/\n if (!f.rename( finalKey )) {\n qWarning() << \"Maildir: Failed to add entry: \" << finalKey << \"!\";\n }\n return uniqueKey;\n}\n\nbool Maildir::removeEntry( const QString& key )\n{\n QString realKey( d->findRealKey( key ) );\n if ( realKey.isEmpty() ) {\n \/\/ FIXME error handling?\n qWarning() << \"Maildir::removeEntry unable to find: \" << key;\n return false;\n }\n return QFile::remove(realKey);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2009 Larry Gritz and the other authors and contributors.\n All Rights Reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the software's owners nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n (This is the Modified BSD License)\n*\/\n\n\n#include <iostream>\n#include <cstdio>\n\n#include \"OpenImageIO\/thread.h\"\n#include \"OpenImageIO\/ustring.h\"\n#include \"OpenImageIO\/strutil.h\"\n\n#include \"OpenImageIO\/unittest.h\"\n\n\nOIIO_NAMESPACE_USING;\n\n\/\/ Test ustring's internal locks by creating a bunch of strings in many\n\/\/ threads simultaneously. Hopefully something will crash if the \n\/\/ internal table is not being locked properly.\n\nstatic void\ncreate_lotso_ustrings ()\n{\n std::cout << \"thread \" << boost::this_thread::get_id() << \"\\n\";\n char buf[20];\n const int iterations = 1000000;\n for (int i = 0; i < iterations; ++i) {\n sprintf (buf, \"%d\", i);\n ustring s (buf);\n }\n}\n\n\n\nvoid test_ustring_lock ()\n{\n std::cout << \"hw threads = \" << boost::thread::hardware_concurrency() << \"\\n\";\n\n const int numthreads = 16;\n boost::thread_group threads;\n for (int i = 0; i < numthreads; ++i) {\n threads.create_thread (&create_lotso_ustrings);\n }\n std::cout << \"Created \" << threads.size() << \" threads\\n\";\n threads.join_all ();\n std::cout << \"\\n\" << ustring::getstats() << \"\\n\";\n OIIO_CHECK_ASSERT (true); \/\/ If we make it here without crashing, pass\n}\n\n\n\nint main (int argc, char *argv[])\n{\n test_ustring_lock ();\n\n return unit_test_failures;\n}\n<commit_msg>Modify ustring_test to give it thread wedging benchmark abilities (modeled after spinlock_test)<commit_after>\/*\n Copyright 2009 Larry Gritz and the other authors and contributors.\n All Rights Reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions are\n met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the software's owners nor the names of its\n contributors may be used to endorse or promote products derived from\n this software without specific prior written permission.\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n (This is the Modified BSD License)\n*\/\n\n\n#include <iostream>\n#include <cstdio>\n\n#include \"OpenImageIO\/thread.h\"\n#include \"OpenImageIO\/ustring.h\"\n#include \"OpenImageIO\/strutil.h\"\n#include \"OpenImageIO\/timer.h\"\n#include \"OpenImageIO\/argparse.h\"\n\n#include \"OpenImageIO\/unittest.h\"\n\n\nOIIO_NAMESPACE_USING;\n\n\/\/ Test ustring's internal locks by creating a bunch of strings in many\n\/\/ threads simultaneously. Hopefully something will crash if the \n\/\/ internal table is not being locked properly.\n\nstatic int iterations = 1000000;\nstatic int numthreads = 16;\nstatic int ntrials = 1;\nstatic bool verbose = false;\nstatic bool wedge = false;\nstatic spin_mutex print_mutex; \/\/ make the prints not clobber each other\n\n\n\nstatic void\ncreate_lotso_ustrings (int iterations)\n{\n if (verbose) {\n spin_lock lock(print_mutex);\n std::cout << \"thread \" << boost::this_thread::get_id() << \"\\n\";\n }\n for (int i = 0; i < iterations; ++i) {\n char buf[20];\n sprintf (buf, \"%d\", i);\n ustring s (buf);\n }\n}\n\n\n\nvoid test_ustring_lock (int numthreads, int iterations)\n{\n boost::thread_group threads;\n for (int i = 0; i < numthreads; ++i) {\n threads.create_thread (boost::bind (create_lotso_ustrings, iterations));\n }\n threads.join_all ();\n OIIO_CHECK_ASSERT (true); \/\/ If we make it here without crashing, pass\n}\n\n\n\nstatic void\ngetargs (int argc, char *argv[])\n{\n bool help = false;\n ArgParse ap;\n ap.options (\"ustring_test\\n\"\n OIIO_INTRO_STRING \"\\n\"\n \"Usage: ustring_test [options]\",\n \/\/ \"%*\", parse_files, \"\",\n \"--help\", &help, \"Print help message\",\n \"-v\", &verbose, \"Verbose mode\",\n \"--threads %d\", &numthreads, \n ustring::format(\"Number of threads (default: %d)\", numthreads).c_str(),\n \"--iters %d\", &iterations,\n ustring::format(\"Number of iterations (default: %d)\", iterations).c_str(),\n \"--trials %d\", &ntrials, \"Number of trials\",\n \"--wedge\", &wedge, \"Do a wedge test\",\n NULL);\n if (ap.parse (argc, (const char**)argv) < 0) {\n std::cerr << ap.geterror() << std::endl;\n ap.usage ();\n exit (EXIT_FAILURE);\n }\n if (help) {\n ap.usage ();\n exit (EXIT_FAILURE);\n }\n}\n\n\n\nint main (int argc, char *argv[])\n{\n getargs (argc, argv);\n\n std::cout << \"hw threads = \" << boost::thread::hardware_concurrency() << \"\\n\";\n std::cout << \"threads\\ttime (best of \" << ntrials << \")\\n\";\n std::cout << \"-------\\t----------\\n\";\n\n static int threadcounts[] = { 1, 2, 4, 8, 12, 16, 20, 24, 28, 32, 64, 128, 1024, 1<<30 };\n for (int i = 0; threadcounts[i] <= numthreads; ++i) {\n int nt = wedge ? threadcounts[i] : numthreads;\n int its = iterations\/nt;\n\n double range;\n double t = time_trial (boost::bind(test_ustring_lock,nt,its),\n ntrials, &range);\n\n std::cout << Strutil::format (\"%2d\\t%5.1f range %.2f\\t(%d iters\/thread)\\n\",\n nt, t, range, its);\n if (! wedge)\n break; \/\/ don't loop if we're not wedging\n }\n\n if (verbose)\n std::cout << \"\\n\" << ustring::getstats() << \"\\n\";\n\n return unit_test_failures;\n}\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (testabilitydriver@nokia.com)\n**\n** This file is part of Testability Driver Qt Agent\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at testabilitydriver@nokia.com .\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n\n\n#include <QApplication>\n#include <QPoint>\n#include <QRect>\n\n#include \"screenshotservice.h\"\n#include \"taslogger.h\"\n\n\/*!\n \\class FixtureService\n \\brief FixtureService closes the application\n\n*\/\n\nstatic QString NO_UI_ERROR = \"Application has not ui, cannot take screenshot!\";\n\nScreenshotService::ScreenshotService()\n{\n}\n\nScreenshotService::~ScreenshotService()\n{\n}\n\nbool ScreenshotService::executeService(TasCommandModel& model, TasResponse& response)\n{\n if(model.service() == serviceName() ){\n TasLogger::logger()->debug(\"ScreenshotService::executeService in\");\n if(qApp->type() != QApplication::Tty){\n getScreenshot(model, response);\n }\n else{\n TasLogger::logger()->debug(\"ScreenshotService::executeService application has no ui!\");\n response.setErrorMessage(NO_UI_ERROR);\n }\n return true;\n }\n else{\n return false;\n }\n}\n\nvoid ScreenshotService::getScreenshot(TasCommandModel& model, TasResponse& response)\n{\n QListIterator<TasTarget*> i(model.targetList());\n QString errorMsg = PARSE_ERROR;\n QImage screenshot;\n QString pictureFormat = \"PNG\";\n while (i.hasNext()){\n TasTarget* commandTarget = i.next();\n QString targetId = commandTarget->id();\n QString targetType = commandTarget->type();\n TasCommand* command = commandTarget->findCommand(\"Screenshot\");\n \/\/are required for command completion\n if(targetId.isEmpty() || targetType.isEmpty() || !command){\n continue;\n }\n\n if(!command->parameter(\"format\").isEmpty()){\n pictureFormat = command->parameter(\"format\");\n }\n\n if(!isFormatSupported(pictureFormat)){\n errorMsg = \"Given format \" + pictureFormat + \"is not supported. Supported formats are: PNG, JPEG and BMP.\";\n break;\n }\n\n bool draw = false;\n if(command->parameter(\"draw\") == \"true\"){\n draw = true;\n }\n\n QWidget* target = 0;\n errorMsg = \"Taking screenshot failed!\";\n if(targetType == TYPE_GRAPHICS_VIEW){\n \/\/TasLogger::logger()->debug(\"TYPE_GRAPHICS_VIEW Target id:\" + targetId);\n QGraphicsItem* item = findGraphicsItem(targetId);\n if(item){\n QGraphicsView* view = getViewForItem(item);\n if(view){\n QPoint point = view->mapFromScene(item->scenePos());\n QPoint windowPoint = view->mapTo(view->window(), point);\n QRectF itemRect = item->boundingRect();\n ItemLocationDetails locationDetails = TestabilityUtils::getItemLocationDetails(item);\n\n if(draw){\n screenshot = QPixmap::grabWidget(view->window(), locationDetails.windowPoint.x(), locationDetails.windowPoint.y(),\n locationDetails.width, locationDetails.height).toImage();\n }\n else{\n screenshot = QPixmap::grabWindow(view->window()->winId(), locationDetails.windowPoint.x(), locationDetails.windowPoint.y(),\n locationDetails.width, locationDetails.height).toImage();\n }\n\n if (!screenshot.isNull()) {\n screenshot.setText(\"tas_id\", objectId(view->window()));\n }\n }\n else{\n errorMsg = \"Could not find a GraphicsView for the GraphicsItem!\";\n }\n }\n else{\n errorMsg = \"Could not find the GraphicsItem!\";\n }\n }\n else{\n if(targetType == TYPE_STANDARD_VIEW){\n \/\/TasLogger::logger()->debug(\"TYPE_STANDARD_VIEW about to find widget Target id:\" + targetId);\n target = findWidget(targetId);\n }\n else{\n \/\/TasLogger::logger()->debug(\"TYPE_APPLICATION_VIEW about to find application window Target id:\" + targetId);\n target = getApplicationWindow();\n \/\/in case no window false, return the desktop\n if(!target){\n draw = false;\n target = qApp->desktop();\n }\n }\n\n if(target){\n\n if ( (target->isWindow() && !draw) || target->inherits(\"QDesktopWidget\")){\n screenshot = QPixmap::grabWindow(target->winId()).toImage();\n }\n\n else{\n if(draw){\n screenshot = QPixmap::grabWidget(target).toImage();\n }\n\n else{\n QPoint point = target->mapToGlobal(QPoint(0,0));\n QPoint windowPoint = target->window()->mapFromGlobal(point);\n screenshot = QPixmap::grabWindow(target->window()->winId(), windowPoint.x(), windowPoint.y(),\n target->rect().width(), target->rect().height()).toImage();\n }\n }\n\n if (!screenshot.isNull()) {\n screenshot.setText(\"tas_id\", objectId(target));\n }\n }\n else{\n TasLogger::logger()->debug(\"ScreenshotService::executeService application has no visible ui!\");\n errorMsg = \"Application has no visible ui!\";\n }\n }\n break;\n }\n\n if (!screenshot.isNull()){\n QByteArray bytes;\n QBuffer buffer(&bytes);\n buffer.open(QIODevice::WriteOnly);\n screenshot.save(&buffer, pictureFormat.toAscii());\n response.setData(bytes);\n }\n else{\n response.setErrorMessage(errorMsg);\n }\n\n}\n\nbool ScreenshotService::isFormatSupported(QString format)\n{\n if( QString::compare(format, \"PNG\", Qt::CaseInsensitive) == 0 ||\n QString::compare(format, \"JPEG\", Qt::CaseInsensitive) == 0 ||\n QString::compare(format, \"BMP\", Qt::CaseInsensitive) == 0){\n return true;\n }\n else{\n return false;\n }\n}\n<commit_msg>Cosmetic<commit_after>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (testabilitydriver@nokia.com)\n**\n** This file is part of Testability Driver Qt Agent\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at testabilitydriver@nokia.com .\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n\n\n#include <QApplication>\n#include <QPoint>\n#include <QRect>\n\n#include \"screenshotservice.h\"\n#include \"taslogger.h\"\n\n\/*!\n \\class ScreenshotService\n \\brief ScreenshotService closes the application\n\n*\/\n\nstatic QString NO_UI_ERROR = \"Application has not ui, cannot take screenshot!\";\n\nScreenshotService::ScreenshotService()\n{\n}\n\nScreenshotService::~ScreenshotService()\n{\n}\n\nbool ScreenshotService::executeService(TasCommandModel& model, TasResponse& response)\n{\n if(model.service() == serviceName() ){\n TasLogger::logger()->debug(\"ScreenshotService::executeService in\");\n if(qApp->type() != QApplication::Tty){\n getScreenshot(model, response);\n }\n else{\n TasLogger::logger()->debug(\"ScreenshotService::executeService application has no ui!\");\n response.setErrorMessage(NO_UI_ERROR);\n }\n return true;\n }\n else{\n return false;\n }\n}\n\nvoid ScreenshotService::getScreenshot(TasCommandModel& model, TasResponse& response)\n{\n QListIterator<TasTarget*> i(model.targetList());\n QString errorMsg = PARSE_ERROR;\n QImage screenshot;\n QString pictureFormat = \"PNG\";\n while (i.hasNext()){\n TasTarget* commandTarget = i.next();\n QString targetId = commandTarget->id();\n QString targetType = commandTarget->type();\n TasCommand* command = commandTarget->findCommand(\"Screenshot\");\n \/\/are required for command completion\n if(targetId.isEmpty() || targetType.isEmpty() || !command){\n continue;\n }\n\n if(!command->parameter(\"format\").isEmpty()){\n pictureFormat = command->parameter(\"format\");\n }\n\n if(!isFormatSupported(pictureFormat)){\n errorMsg = \"Given format \" + pictureFormat + \"is not supported. Supported formats are: PNG, JPEG and BMP.\";\n break;\n }\n\n bool draw = false;\n if(command->parameter(\"draw\") == \"true\"){\n draw = true;\n }\n\n QWidget* target = 0;\n errorMsg = \"Taking screenshot failed!\";\n if(targetType == TYPE_GRAPHICS_VIEW){\n \/\/TasLogger::logger()->debug(\"TYPE_GRAPHICS_VIEW Target id:\" + targetId);\n QGraphicsItem* item = findGraphicsItem(targetId);\n if(item){\n QGraphicsView* view = getViewForItem(item);\n if(view){\n QPoint point = view->mapFromScene(item->scenePos());\n QPoint windowPoint = view->mapTo(view->window(), point);\n QRectF itemRect = item->boundingRect();\n ItemLocationDetails locationDetails = TestabilityUtils::getItemLocationDetails(item);\n\n if(draw){\n screenshot = QPixmap::grabWidget(view->window(), locationDetails.windowPoint.x(), locationDetails.windowPoint.y(),\n locationDetails.width, locationDetails.height).toImage();\n }\n else{\n screenshot = QPixmap::grabWindow(view->window()->winId(), locationDetails.windowPoint.x(), locationDetails.windowPoint.y(),\n locationDetails.width, locationDetails.height).toImage();\n }\n\n if (!screenshot.isNull()) {\n screenshot.setText(\"tas_id\", objectId(view->window()));\n }\n }\n else{\n errorMsg = \"Could not find a GraphicsView for the GraphicsItem!\";\n }\n }\n else{\n errorMsg = \"Could not find the GraphicsItem!\";\n }\n }\n else{\n if(targetType == TYPE_STANDARD_VIEW){\n \/\/TasLogger::logger()->debug(\"TYPE_STANDARD_VIEW about to find widget Target id:\" + targetId);\n target = findWidget(targetId);\n }\n else{\n \/\/TasLogger::logger()->debug(\"TYPE_APPLICATION_VIEW about to find application window Target id:\" + targetId);\n target = getApplicationWindow();\n \/\/in case no window false, return the desktop\n if(!target){\n draw = false;\n target = qApp->desktop();\n }\n }\n\n if(target){\n\n if ( (target->isWindow() && !draw) || target->inherits(\"QDesktopWidget\")){\n screenshot = QPixmap::grabWindow(target->winId()).toImage();\n }\n\n else{\n if(draw){\n screenshot = QPixmap::grabWidget(target).toImage();\n }\n\n else{\n QPoint point = target->mapToGlobal(QPoint(0,0));\n QPoint windowPoint = target->window()->mapFromGlobal(point);\n screenshot = QPixmap::grabWindow(target->window()->winId(), windowPoint.x(), windowPoint.y(),\n target->rect().width(), target->rect().height()).toImage();\n }\n }\n\n if (!screenshot.isNull()) {\n screenshot.setText(\"tas_id\", objectId(target));\n }\n }\n else{\n TasLogger::logger()->debug(\"ScreenshotService::executeService application has no visible ui!\");\n errorMsg = \"Application has no visible ui!\";\n }\n }\n break;\n }\n\n if (!screenshot.isNull()){\n QByteArray bytes;\n QBuffer buffer(&bytes);\n buffer.open(QIODevice::WriteOnly);\n screenshot.save(&buffer, pictureFormat.toAscii());\n response.setData(bytes);\n }\n else{\n response.setErrorMessage(errorMsg);\n }\n\n}\n\nbool ScreenshotService::isFormatSupported(QString format)\n{\n if( QString::compare(format, \"PNG\", Qt::CaseInsensitive) == 0 ||\n QString::compare(format, \"JPEG\", Qt::CaseInsensitive) == 0 ||\n QString::compare(format, \"BMP\", Qt::CaseInsensitive) == 0){\n return true;\n }\n else{\n return false;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************\n * Copyright (c) 2014, ArrayFire\n * All rights reserved.\n *\n * This file is distributed under 3-clause BSD license.\n * The complete license agreement can be obtained at:\n * http:\/\/arrayfire.com\/licenses\/BSD-3-Clause\n ********************************************************\/\n\n\/\/ Parts of this code sourced from SnopyDogy\n\/\/ https:\/\/gist.github.com\/SnopyDogy\/a9a22497a893ec86aa3e\n\n#if defined (WITH_GRAPHICS)\n\n#include <Array.hpp>\n#include <image.hpp>\n#include <err_cpu.hpp>\n#include <cstdio>\n#include <stdexcept>\n#include <graphics_common.hpp>\n\nusing af::dim4;\n\nnamespace cpu\n{\n template<typename T>\n void copy_image(const Array<T> &in, const fg_image_handle image)\n {\n CheckGL(\"Before CopyArrayToPBO\");\n const T *d_X = in.get();\n\n glBufferData(GL_PIXEL_UNPACK_BUFFER_ARB, image->src_width * image->src_height * image->window->mode * sizeof(T),\n d_X, GL_STREAM_COPY);\n\n \/\/ Unlock array\n \/\/ Not implemented yet\n \/\/ X.unlock();\n CheckGL(\"In CopyArrayToPBO\");\n }\n\n #define INSTANTIATE(T) \\\n template void copy_image<T>(const Array<T> &in, const fg_image_handle image);\n\n INSTANTIATE(float)\n INSTANTIATE(double)\n INSTANTIATE(int)\n INSTANTIATE(uint)\n INSTANTIATE(uchar)\n INSTANTIATE(char)\n}\n\n#endif \/\/ WITH_GRAPHICS\n<commit_msg>BUGFIX: Corrected PBO binding for image cpu<commit_after>\/*******************************************************\n * Copyright (c) 2014, ArrayFire\n * All rights reserved.\n *\n * This file is distributed under 3-clause BSD license.\n * The complete license agreement can be obtained at:\n * http:\/\/arrayfire.com\/licenses\/BSD-3-Clause\n ********************************************************\/\n\n\/\/ Parts of this code sourced from SnopyDogy\n\/\/ https:\/\/gist.github.com\/SnopyDogy\/a9a22497a893ec86aa3e\n\n#if defined (WITH_GRAPHICS)\n\n#include <Array.hpp>\n#include <image.hpp>\n#include <err_cpu.hpp>\n#include <cstdio>\n#include <stdexcept>\n#include <graphics_common.hpp>\n\nusing af::dim4;\n\nnamespace cpu\n{\n template<typename T>\n void copy_image(const Array<T> &in, const fg_image_handle image)\n {\n CheckGL(\"Before CopyArrayToPBO\");\n const T *d_X = in.get();\n size_t data_size = image->src_width * image->src_height * image->window->mode * sizeof(T);\n\n glBindBuffer(GL_PIXEL_UNPACK_BUFFER_ARB, image->gl_PBO);\n glBufferSubData(GL_PIXEL_UNPACK_BUFFER_ARB, 0, data_size, d_X);\n\n CheckGL(\"In CopyArrayToPBO\");\n }\n\n #define INSTANTIATE(T) \\\n template void copy_image<T>(const Array<T> &in, const fg_image_handle image);\n\n INSTANTIATE(float)\n INSTANTIATE(double)\n INSTANTIATE(int)\n INSTANTIATE(uint)\n INSTANTIATE(uchar)\n INSTANTIATE(char)\n}\n\n#endif \/\/ WITH_GRAPHICS\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Steve Reinhardt\n *\/\n\n#include \"arch\/utility.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/inifile.hh\"\n#include \"base\/loader\/symtab.hh\"\n#include \"base\/misc.hh\"\n#include \"base\/pollevent.hh\"\n#include \"base\/range.hh\"\n#include \"base\/stats\/events.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/base.hh\"\n#include \"cpu\/cpu_exec_context.hh\"\n#include \"cpu\/exec_context.hh\"\n#include \"cpu\/exetrace.hh\"\n#include \"cpu\/profile.hh\"\n#include \"cpu\/sampler\/sampler.hh\"\n#include \"cpu\/simple\/base.hh\"\n#include \"cpu\/smt.hh\"\n#include \"cpu\/static_inst.hh\"\n#include \"kern\/kernel_stats.hh\"\n#include \"mem\/packet_impl.hh\"\n#include \"sim\/byteswap.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/debug.hh\"\n#include \"sim\/host.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/sim_object.hh\"\n#include \"sim\/stats.hh\"\n\n#if FULL_SYSTEM\n#include \"base\/remote_gdb.hh\"\n#include \"sim\/system.hh\"\n#include \"arch\/tlb.hh\"\n#include \"arch\/stacktrace.hh\"\n#include \"arch\/vtophys.hh\"\n#else \/\/ !FULL_SYSTEM\n#include \"mem\/mem_object.hh\"\n#endif \/\/ FULL_SYSTEM\n\nusing namespace std;\nusing namespace TheISA;\n\nBaseSimpleCPU::BaseSimpleCPU(Params *p)\n : BaseCPU(p), mem(p->mem), cpuXC(NULL)\n{\n#if FULL_SYSTEM\n cpuXC = new CPUExecContext(this, 0, p->system, p->itb, p->dtb);\n#else\n cpuXC = new CPUExecContext(this, \/* thread_num *\/ 0, p->process,\n \/* asid *\/ 0, mem);\n#endif \/\/ !FULL_SYSTEM\n\n xcProxy = cpuXC->getProxy();\n\n numInst = 0;\n startNumInst = 0;\n numLoad = 0;\n startNumLoad = 0;\n lastIcacheStall = 0;\n lastDcacheStall = 0;\n\n execContexts.push_back(xcProxy);\n}\n\nBaseSimpleCPU::~BaseSimpleCPU()\n{\n}\n\nvoid\nBaseSimpleCPU::deallocateContext(int thread_num)\n{\n \/\/ for now, these are equivalent\n suspendContext(thread_num);\n}\n\n\nvoid\nBaseSimpleCPU::haltContext(int thread_num)\n{\n \/\/ for now, these are equivalent\n suspendContext(thread_num);\n}\n\n\nvoid\nBaseSimpleCPU::regStats()\n{\n using namespace Stats;\n\n BaseCPU::regStats();\n\n numInsts\n .name(name() + \".num_insts\")\n .desc(\"Number of instructions executed\")\n ;\n\n numMemRefs\n .name(name() + \".num_refs\")\n .desc(\"Number of memory references\")\n ;\n\n notIdleFraction\n .name(name() + \".not_idle_fraction\")\n .desc(\"Percentage of non-idle cycles\")\n ;\n\n idleFraction\n .name(name() + \".idle_fraction\")\n .desc(\"Percentage of idle cycles\")\n ;\n\n icacheStallCycles\n .name(name() + \".icache_stall_cycles\")\n .desc(\"ICache total stall cycles\")\n .prereq(icacheStallCycles)\n ;\n\n dcacheStallCycles\n .name(name() + \".dcache_stall_cycles\")\n .desc(\"DCache total stall cycles\")\n .prereq(dcacheStallCycles)\n ;\n\n icacheRetryCycles\n .name(name() + \".icache_retry_cycles\")\n .desc(\"ICache total retry cycles\")\n .prereq(icacheRetryCycles)\n ;\n\n dcacheRetryCycles\n .name(name() + \".dcache_retry_cycles\")\n .desc(\"DCache total retry cycles\")\n .prereq(dcacheRetryCycles)\n ;\n\n idleFraction = constant(1.0) - notIdleFraction;\n}\n\nvoid\nBaseSimpleCPU::resetStats()\n{\n startNumInst = numInst;\n \/\/ notIdleFraction = (_status != Idle);\n}\n\nvoid\nBaseSimpleCPU::serialize(ostream &os)\n{\n BaseCPU::serialize(os);\n SERIALIZE_SCALAR(inst);\n nameOut(os, csprintf(\"%s.xc\", name()));\n cpuXC->serialize(os);\n}\n\nvoid\nBaseSimpleCPU::unserialize(Checkpoint *cp, const string §ion)\n{\n BaseCPU::unserialize(cp, section);\n UNSERIALIZE_SCALAR(inst);\n cpuXC->unserialize(cp, csprintf(\"%s.xc\", section));\n}\n\nvoid\nchange_thread_state(int thread_number, int activate, int priority)\n{\n}\n\nFault\nBaseSimpleCPU::copySrcTranslate(Addr src)\n{\n#if 0\n static bool no_warn = true;\n int blk_size = (dcacheInterface) ? dcacheInterface->getBlockSize() : 64;\n \/\/ Only support block sizes of 64 atm.\n assert(blk_size == 64);\n int offset = src & (blk_size - 1);\n\n \/\/ Make sure block doesn't span page\n if (no_warn &&\n (src & PageMask) != ((src + blk_size) & PageMask) &&\n (src >> 40) != 0xfffffc) {\n warn(\"Copied block source spans pages %x.\", src);\n no_warn = false;\n }\n\n memReq->reset(src & ~(blk_size - 1), blk_size);\n\n \/\/ translate to physical address\n Fault fault = cpuXC->translateDataReadReq(req);\n\n if (fault == NoFault) {\n cpuXC->copySrcAddr = src;\n cpuXC->copySrcPhysAddr = memReq->paddr + offset;\n } else {\n assert(!fault->isAlignmentFault());\n\n cpuXC->copySrcAddr = 0;\n cpuXC->copySrcPhysAddr = 0;\n }\n return fault;\n#else\n return NoFault;\n#endif\n}\n\nFault\nBaseSimpleCPU::copy(Addr dest)\n{\n#if 0\n static bool no_warn = true;\n int blk_size = (dcacheInterface) ? dcacheInterface->getBlockSize() : 64;\n \/\/ Only support block sizes of 64 atm.\n assert(blk_size == 64);\n uint8_t data[blk_size];\n \/\/assert(cpuXC->copySrcAddr);\n int offset = dest & (blk_size - 1);\n\n \/\/ Make sure block doesn't span page\n if (no_warn &&\n (dest & PageMask) != ((dest + blk_size) & PageMask) &&\n (dest >> 40) != 0xfffffc) {\n no_warn = false;\n warn(\"Copied block destination spans pages %x. \", dest);\n }\n\n memReq->reset(dest & ~(blk_size -1), blk_size);\n \/\/ translate to physical address\n Fault fault = cpuXC->translateDataWriteReq(req);\n\n if (fault == NoFault) {\n Addr dest_addr = memReq->paddr + offset;\n \/\/ Need to read straight from memory since we have more than 8 bytes.\n memReq->paddr = cpuXC->copySrcPhysAddr;\n cpuXC->mem->read(memReq, data);\n memReq->paddr = dest_addr;\n cpuXC->mem->write(memReq, data);\n if (dcacheInterface) {\n memReq->cmd = Copy;\n memReq->completionEvent = NULL;\n memReq->paddr = cpuXC->copySrcPhysAddr;\n memReq->dest = dest_addr;\n memReq->size = 64;\n memReq->time = curTick;\n memReq->flags &= ~INST_READ;\n dcacheInterface->access(memReq);\n }\n }\n else\n assert(!fault->isAlignmentFault());\n\n return fault;\n#else\n panic(\"copy not implemented\");\n return NoFault;\n#endif\n}\n\n#if FULL_SYSTEM\nAddr\nBaseSimpleCPU::dbg_vtophys(Addr addr)\n{\n return vtophys(xcProxy, addr);\n}\n#endif \/\/ FULL_SYSTEM\n\n#if FULL_SYSTEM\nvoid\nBaseSimpleCPU::post_interrupt(int int_num, int index)\n{\n BaseCPU::post_interrupt(int_num, index);\n\n if (cpuXC->status() == ExecContext::Suspended) {\n DPRINTF(IPI,\"Suspended Processor awoke\\n\");\n cpuXC->activate();\n }\n}\n#endif \/\/ FULL_SYSTEM\n\nvoid\nBaseSimpleCPU::checkForInterrupts()\n{\n#if FULL_SYSTEM\n if (checkInterrupts && check_interrupts() && !cpuXC->inPalMode()) {\n int ipl = 0;\n int summary = 0;\n checkInterrupts = false;\n\n if (cpuXC->readMiscReg(IPR_SIRR)) {\n for (int i = INTLEVEL_SOFTWARE_MIN;\n i < INTLEVEL_SOFTWARE_MAX; i++) {\n if (cpuXC->readMiscReg(IPR_SIRR) & (ULL(1) << i)) {\n \/\/ See table 4-19 of 21164 hardware reference\n ipl = (i - INTLEVEL_SOFTWARE_MIN) + 1;\n summary |= (ULL(1) << i);\n }\n }\n }\n\n uint64_t interrupts = cpuXC->cpu->intr_status();\n for (int i = INTLEVEL_EXTERNAL_MIN;\n i < INTLEVEL_EXTERNAL_MAX; i++) {\n if (interrupts & (ULL(1) << i)) {\n \/\/ See table 4-19 of 21164 hardware reference\n ipl = i;\n summary |= (ULL(1) << i);\n }\n }\n\n if (cpuXC->readMiscReg(IPR_ASTRR))\n panic(\"asynchronous traps not implemented\\n\");\n\n if (ipl && ipl > cpuXC->readMiscReg(IPR_IPLR)) {\n cpuXC->setMiscReg(IPR_ISR, summary);\n cpuXC->setMiscReg(IPR_INTID, ipl);\n\n Fault(new InterruptFault)->invoke(xcProxy);\n\n DPRINTF(Flow, \"Interrupt! IPLR=%d ipl=%d summary=%x\\n\",\n cpuXC->readMiscReg(IPR_IPLR), ipl, summary);\n }\n }\n#endif\n}\n\n\nFault\nBaseSimpleCPU::setupFetchRequest(Request *req)\n{\n \/\/ set up memory request for instruction fetch\n DPRINTF(Fetch,\"Fetch: PC:%08p NPC:%08p NNPC:%08p\\n\",cpuXC->readPC(),\n cpuXC->readNextPC(),cpuXC->readNextNPC());\n\n req->setVirt(0, cpuXC->readPC() & ~3, sizeof(MachInst),\n (FULL_SYSTEM && (cpuXC->readPC() & 1)) ? PHYSICAL : 0,\n cpuXC->readPC());\n\n Fault fault = cpuXC->translateInstReq(req);\n\n return fault;\n}\n\n\nvoid\nBaseSimpleCPU::preExecute()\n{\n \/\/ maintain $r0 semantics\n cpuXC->setIntReg(ZeroReg, 0);\n#if THE_ISA == ALPHA_ISA\n cpuXC->setFloatReg(ZeroReg, 0.0);\n#endif \/\/ ALPHA_ISA\n\n \/\/ keep an instruction count\n numInst++;\n numInsts++;\n\n cpuXC->func_exe_inst++;\n\n \/\/ check for instruction-count-based events\n comInstEventQueue[0]->serviceEvents(numInst);\n\n \/\/ decode the instruction\n inst = gtoh(inst);\n curStaticInst = StaticInst::decode(makeExtMI(inst, cpuXC->readPC()));\n\n traceData = Trace::getInstRecord(curTick, xcProxy, this, curStaticInst,\n cpuXC->readPC());\n\n DPRINTF(Decode,\"Decode: Decoded %s instruction (opcode: 0x%x): 0x%x\\n\",\n curStaticInst->getName(), curStaticInst->getOpcode(),\n curStaticInst->machInst);\n\n#if FULL_SYSTEM\n cpuXC->setInst(inst);\n#endif \/\/ FULL_SYSTEM\n}\n\nvoid\nBaseSimpleCPU::postExecute()\n{\n#if FULL_SYSTEM\n if (system->kernelBinning->fnbin) {\n assert(kernelStats);\n system->kernelBinning->execute(xcProxy, inst);\n }\n\n if (cpuXC->profile) {\n bool usermode =\n (cpuXC->readMiscReg(AlphaISA::IPR_DTB_CM) & 0x18) != 0;\n cpuXC->profilePC = usermode ? 1 : cpuXC->readPC();\n ProfileNode *node = cpuXC->profile->consume(xcProxy, inst);\n if (node)\n cpuXC->profileNode = node;\n }\n#endif\n\n if (curStaticInst->isMemRef()) {\n numMemRefs++;\n }\n\n if (curStaticInst->isLoad()) {\n ++numLoad;\n comLoadEventQueue[0]->serviceEvents(numLoad);\n }\n\n traceFunctions(cpuXC->readPC());\n\n if (traceData) {\n traceData->finalize();\n }\n}\n\n\nvoid\nBaseSimpleCPU::advancePC(Fault fault)\n{\n if (fault != NoFault) {\n#if FULL_SYSTEM\n fault->invoke(xcProxy);\n#else \/\/ !FULL_SYSTEM\n fatal(\"fault (%s) detected @ PC %08p\", fault->name(), cpuXC->readPC());\n#endif \/\/ FULL_SYSTEM\n }\n else {\n \/\/ go to the next instruction\n cpuXC->setPC(cpuXC->readNextPC());\n#if THE_ISA == ALPHA_ISA\n cpuXC->setNextPC(cpuXC->readNextPC() + sizeof(MachInst));\n#else\n cpuXC->setNextPC(cpuXC->readNextNPC());\n cpuXC->setNextNPC(cpuXC->readNextNPC() + sizeof(MachInst));\n#endif\n\n }\n\n#if FULL_SYSTEM\n Addr oldpc;\n do {\n oldpc = cpuXC->readPC();\n system->pcEventQueue.service(xcProxy);\n } while (oldpc != cpuXC->readPC());\n#endif\n}\n\n<commit_msg>Fix for full system compiling.<commit_after>\/*\n * Copyright (c) 2002-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Steve Reinhardt\n *\/\n\n#include \"arch\/utility.hh\"\n#include \"base\/cprintf.hh\"\n#include \"base\/inifile.hh\"\n#include \"base\/loader\/symtab.hh\"\n#include \"base\/misc.hh\"\n#include \"base\/pollevent.hh\"\n#include \"base\/range.hh\"\n#include \"base\/stats\/events.hh\"\n#include \"base\/trace.hh\"\n#include \"cpu\/base.hh\"\n#include \"cpu\/cpu_exec_context.hh\"\n#include \"cpu\/exec_context.hh\"\n#include \"cpu\/exetrace.hh\"\n#include \"cpu\/profile.hh\"\n#include \"cpu\/sampler\/sampler.hh\"\n#include \"cpu\/simple\/base.hh\"\n#include \"cpu\/smt.hh\"\n#include \"cpu\/static_inst.hh\"\n#include \"kern\/kernel_stats.hh\"\n#include \"mem\/packet_impl.hh\"\n#include \"sim\/byteswap.hh\"\n#include \"sim\/builder.hh\"\n#include \"sim\/debug.hh\"\n#include \"sim\/host.hh\"\n#include \"sim\/sim_events.hh\"\n#include \"sim\/sim_object.hh\"\n#include \"sim\/stats.hh\"\n\n#if FULL_SYSTEM\n#include \"base\/remote_gdb.hh\"\n#include \"sim\/system.hh\"\n#include \"arch\/tlb.hh\"\n#include \"arch\/stacktrace.hh\"\n#include \"arch\/vtophys.hh\"\n#else \/\/ !FULL_SYSTEM\n#include \"mem\/mem_object.hh\"\n#endif \/\/ FULL_SYSTEM\n\nusing namespace std;\nusing namespace TheISA;\n\nBaseSimpleCPU::BaseSimpleCPU(Params *p)\n : BaseCPU(p), mem(p->mem), cpuXC(NULL)\n{\n#if FULL_SYSTEM\n cpuXC = new CPUExecContext(this, 0, p->system, p->itb, p->dtb);\n#else\n cpuXC = new CPUExecContext(this, \/* thread_num *\/ 0, p->process,\n \/* asid *\/ 0, mem);\n#endif \/\/ !FULL_SYSTEM\n\n xcProxy = cpuXC->getProxy();\n\n numInst = 0;\n startNumInst = 0;\n numLoad = 0;\n startNumLoad = 0;\n lastIcacheStall = 0;\n lastDcacheStall = 0;\n\n execContexts.push_back(xcProxy);\n}\n\nBaseSimpleCPU::~BaseSimpleCPU()\n{\n}\n\nvoid\nBaseSimpleCPU::deallocateContext(int thread_num)\n{\n \/\/ for now, these are equivalent\n suspendContext(thread_num);\n}\n\n\nvoid\nBaseSimpleCPU::haltContext(int thread_num)\n{\n \/\/ for now, these are equivalent\n suspendContext(thread_num);\n}\n\n\nvoid\nBaseSimpleCPU::regStats()\n{\n using namespace Stats;\n\n BaseCPU::regStats();\n\n numInsts\n .name(name() + \".num_insts\")\n .desc(\"Number of instructions executed\")\n ;\n\n numMemRefs\n .name(name() + \".num_refs\")\n .desc(\"Number of memory references\")\n ;\n\n notIdleFraction\n .name(name() + \".not_idle_fraction\")\n .desc(\"Percentage of non-idle cycles\")\n ;\n\n idleFraction\n .name(name() + \".idle_fraction\")\n .desc(\"Percentage of idle cycles\")\n ;\n\n icacheStallCycles\n .name(name() + \".icache_stall_cycles\")\n .desc(\"ICache total stall cycles\")\n .prereq(icacheStallCycles)\n ;\n\n dcacheStallCycles\n .name(name() + \".dcache_stall_cycles\")\n .desc(\"DCache total stall cycles\")\n .prereq(dcacheStallCycles)\n ;\n\n icacheRetryCycles\n .name(name() + \".icache_retry_cycles\")\n .desc(\"ICache total retry cycles\")\n .prereq(icacheRetryCycles)\n ;\n\n dcacheRetryCycles\n .name(name() + \".dcache_retry_cycles\")\n .desc(\"DCache total retry cycles\")\n .prereq(dcacheRetryCycles)\n ;\n\n idleFraction = constant(1.0) - notIdleFraction;\n}\n\nvoid\nBaseSimpleCPU::resetStats()\n{\n startNumInst = numInst;\n \/\/ notIdleFraction = (_status != Idle);\n}\n\nvoid\nBaseSimpleCPU::serialize(ostream &os)\n{\n BaseCPU::serialize(os);\n SERIALIZE_SCALAR(inst);\n nameOut(os, csprintf(\"%s.xc\", name()));\n cpuXC->serialize(os);\n}\n\nvoid\nBaseSimpleCPU::unserialize(Checkpoint *cp, const string §ion)\n{\n BaseCPU::unserialize(cp, section);\n UNSERIALIZE_SCALAR(inst);\n cpuXC->unserialize(cp, csprintf(\"%s.xc\", section));\n}\n\nvoid\nchange_thread_state(int thread_number, int activate, int priority)\n{\n}\n\nFault\nBaseSimpleCPU::copySrcTranslate(Addr src)\n{\n#if 0\n static bool no_warn = true;\n int blk_size = (dcacheInterface) ? dcacheInterface->getBlockSize() : 64;\n \/\/ Only support block sizes of 64 atm.\n assert(blk_size == 64);\n int offset = src & (blk_size - 1);\n\n \/\/ Make sure block doesn't span page\n if (no_warn &&\n (src & PageMask) != ((src + blk_size) & PageMask) &&\n (src >> 40) != 0xfffffc) {\n warn(\"Copied block source spans pages %x.\", src);\n no_warn = false;\n }\n\n memReq->reset(src & ~(blk_size - 1), blk_size);\n\n \/\/ translate to physical address\n Fault fault = cpuXC->translateDataReadReq(req);\n\n if (fault == NoFault) {\n cpuXC->copySrcAddr = src;\n cpuXC->copySrcPhysAddr = memReq->paddr + offset;\n } else {\n assert(!fault->isAlignmentFault());\n\n cpuXC->copySrcAddr = 0;\n cpuXC->copySrcPhysAddr = 0;\n }\n return fault;\n#else\n return NoFault;\n#endif\n}\n\nFault\nBaseSimpleCPU::copy(Addr dest)\n{\n#if 0\n static bool no_warn = true;\n int blk_size = (dcacheInterface) ? dcacheInterface->getBlockSize() : 64;\n \/\/ Only support block sizes of 64 atm.\n assert(blk_size == 64);\n uint8_t data[blk_size];\n \/\/assert(cpuXC->copySrcAddr);\n int offset = dest & (blk_size - 1);\n\n \/\/ Make sure block doesn't span page\n if (no_warn &&\n (dest & PageMask) != ((dest + blk_size) & PageMask) &&\n (dest >> 40) != 0xfffffc) {\n no_warn = false;\n warn(\"Copied block destination spans pages %x. \", dest);\n }\n\n memReq->reset(dest & ~(blk_size -1), blk_size);\n \/\/ translate to physical address\n Fault fault = cpuXC->translateDataWriteReq(req);\n\n if (fault == NoFault) {\n Addr dest_addr = memReq->paddr + offset;\n \/\/ Need to read straight from memory since we have more than 8 bytes.\n memReq->paddr = cpuXC->copySrcPhysAddr;\n cpuXC->mem->read(memReq, data);\n memReq->paddr = dest_addr;\n cpuXC->mem->write(memReq, data);\n if (dcacheInterface) {\n memReq->cmd = Copy;\n memReq->completionEvent = NULL;\n memReq->paddr = cpuXC->copySrcPhysAddr;\n memReq->dest = dest_addr;\n memReq->size = 64;\n memReq->time = curTick;\n memReq->flags &= ~INST_READ;\n dcacheInterface->access(memReq);\n }\n }\n else\n assert(!fault->isAlignmentFault());\n\n return fault;\n#else\n panic(\"copy not implemented\");\n return NoFault;\n#endif\n}\n\n#if FULL_SYSTEM\nAddr\nBaseSimpleCPU::dbg_vtophys(Addr addr)\n{\n return vtophys(xcProxy, addr);\n}\n#endif \/\/ FULL_SYSTEM\n\n#if FULL_SYSTEM\nvoid\nBaseSimpleCPU::post_interrupt(int int_num, int index)\n{\n BaseCPU::post_interrupt(int_num, index);\n\n if (cpuXC->status() == ExecContext::Suspended) {\n DPRINTF(IPI,\"Suspended Processor awoke\\n\");\n cpuXC->activate();\n }\n}\n#endif \/\/ FULL_SYSTEM\n\nvoid\nBaseSimpleCPU::checkForInterrupts()\n{\n#if FULL_SYSTEM\n if (checkInterrupts && check_interrupts() && !cpuXC->inPalMode()) {\n int ipl = 0;\n int summary = 0;\n checkInterrupts = false;\n\n if (cpuXC->readMiscReg(IPR_SIRR)) {\n for (int i = INTLEVEL_SOFTWARE_MIN;\n i < INTLEVEL_SOFTWARE_MAX; i++) {\n if (cpuXC->readMiscReg(IPR_SIRR) & (ULL(1) << i)) {\n \/\/ See table 4-19 of 21164 hardware reference\n ipl = (i - INTLEVEL_SOFTWARE_MIN) + 1;\n summary |= (ULL(1) << i);\n }\n }\n }\n\n uint64_t interrupts = cpuXC->cpu->intr_status();\n for (int i = INTLEVEL_EXTERNAL_MIN;\n i < INTLEVEL_EXTERNAL_MAX; i++) {\n if (interrupts & (ULL(1) << i)) {\n \/\/ See table 4-19 of 21164 hardware reference\n ipl = i;\n summary |= (ULL(1) << i);\n }\n }\n\n if (cpuXC->readMiscReg(IPR_ASTRR))\n panic(\"asynchronous traps not implemented\\n\");\n\n if (ipl && ipl > cpuXC->readMiscReg(IPR_IPLR)) {\n cpuXC->setMiscReg(IPR_ISR, summary);\n cpuXC->setMiscReg(IPR_INTID, ipl);\n\n Fault(new InterruptFault)->invoke(xcProxy);\n\n DPRINTF(Flow, \"Interrupt! IPLR=%d ipl=%d summary=%x\\n\",\n cpuXC->readMiscReg(IPR_IPLR), ipl, summary);\n }\n }\n#endif\n}\n\n\nFault\nBaseSimpleCPU::setupFetchRequest(Request *req)\n{\n \/\/ set up memory request for instruction fetch\n DPRINTF(Fetch,\"Fetch: PC:%08p NPC:%08p NNPC:%08p\\n\",cpuXC->readPC(),\n cpuXC->readNextPC(),cpuXC->readNextNPC());\n\n req->setVirt(0, cpuXC->readPC() & ~3, sizeof(MachInst),\n (FULL_SYSTEM && (cpuXC->readPC() & 1)) ? PHYSICAL : 0,\n cpuXC->readPC());\n\n Fault fault = cpuXC->translateInstReq(req);\n\n return fault;\n}\n\n\nvoid\nBaseSimpleCPU::preExecute()\n{\n \/\/ maintain $r0 semantics\n cpuXC->setIntReg(ZeroReg, 0);\n#if THE_ISA == ALPHA_ISA\n cpuXC->setFloatReg(ZeroReg, 0.0);\n#endif \/\/ ALPHA_ISA\n\n \/\/ keep an instruction count\n numInst++;\n numInsts++;\n\n cpuXC->func_exe_inst++;\n\n \/\/ check for instruction-count-based events\n comInstEventQueue[0]->serviceEvents(numInst);\n\n \/\/ decode the instruction\n inst = gtoh(inst);\n curStaticInst = StaticInst::decode(makeExtMI(inst, cpuXC->readPC()));\n\n traceData = Trace::getInstRecord(curTick, xcProxy, this, curStaticInst,\n cpuXC->readPC());\n\n DPRINTF(Decode,\"Decode: Decoded %s instruction (opcode: 0x%x): 0x%x\\n\",\n curStaticInst->getName(), curStaticInst->getOpcode(),\n curStaticInst->machInst);\n\n#if FULL_SYSTEM\n cpuXC->setInst(inst);\n#endif \/\/ FULL_SYSTEM\n}\n\nvoid\nBaseSimpleCPU::postExecute()\n{\n#if FULL_SYSTEM\n if (system->kernelBinning->fnbin) {\n assert(cpuXC->getKernelStats());\n system->kernelBinning->execute(xcProxy, inst);\n }\n\n if (cpuXC->profile) {\n bool usermode =\n (cpuXC->readMiscReg(AlphaISA::IPR_DTB_CM) & 0x18) != 0;\n cpuXC->profilePC = usermode ? 1 : cpuXC->readPC();\n ProfileNode *node = cpuXC->profile->consume(xcProxy, inst);\n if (node)\n cpuXC->profileNode = node;\n }\n#endif\n\n if (curStaticInst->isMemRef()) {\n numMemRefs++;\n }\n\n if (curStaticInst->isLoad()) {\n ++numLoad;\n comLoadEventQueue[0]->serviceEvents(numLoad);\n }\n\n traceFunctions(cpuXC->readPC());\n\n if (traceData) {\n traceData->finalize();\n }\n}\n\n\nvoid\nBaseSimpleCPU::advancePC(Fault fault)\n{\n if (fault != NoFault) {\n#if FULL_SYSTEM\n fault->invoke(xcProxy);\n#else \/\/ !FULL_SYSTEM\n fatal(\"fault (%s) detected @ PC %08p\", fault->name(), cpuXC->readPC());\n#endif \/\/ FULL_SYSTEM\n }\n else {\n \/\/ go to the next instruction\n cpuXC->setPC(cpuXC->readNextPC());\n#if THE_ISA == ALPHA_ISA\n cpuXC->setNextPC(cpuXC->readNextPC() + sizeof(MachInst));\n#else\n cpuXC->setNextPC(cpuXC->readNextNPC());\n cpuXC->setNextNPC(cpuXC->readNextNPC() + sizeof(MachInst));\n#endif\n\n }\n\n#if FULL_SYSTEM\n Addr oldpc;\n do {\n oldpc = cpuXC->readPC();\n system->pcEventQueue.service(xcProxy);\n } while (oldpc != cpuXC->readPC());\n#endif\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2009-2014, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/bandwidth_manager.hpp\"\n#include \"libtorrent\/time.hpp\"\n\nnamespace libtorrent\n{\n\n\tbandwidth_manager::bandwidth_manager(int channel\n#ifdef TORRENT_VERBOSE_BANDWIDTH_LIMIT\n\t\t, bool log\n#endif\t\t\n\t\t)\n\t\t: m_queued_bytes(0)\n\t\t, m_channel(channel)\n\t\t, m_abort(false)\n\t{\n#ifdef TORRENT_VERBOSE_BANDWIDTH_LIMIT\n\t\tif (log)\n\t\t\tm_log.open(\"bandwidth_limiter.log\", std::ios::trunc);\n\t\tm_start = time_now();\n#endif\n\t}\n\n\tvoid bandwidth_manager::close()\n\t{\n\t\tm_abort = true;\n\t\tm_queue.clear();\n\t\tm_queued_bytes = 0;\n\t}\n\n#if TORRENT_USE_ASSERTS\n\tbool bandwidth_manager::is_queued(bandwidth_socket const* peer) const\n\t{\n\t\tfor (queue_t::const_iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tif (i->peer.get() == peer) return true;\n\t\t}\n\t\treturn false;\n\t}\n#endif\n\n\tint bandwidth_manager::queue_size() const\n\t{\n\t\treturn m_queue.size();\n\t}\n\n\tint bandwidth_manager::queued_bytes() const\n\t{\n\t\treturn m_queued_bytes;\n\t}\n\t\n\t\/\/ non prioritized means that, if there's a line for bandwidth,\n\t\/\/ others will cut in front of the non-prioritized peers.\n\t\/\/ this is used by web seeds\n\tint bandwidth_manager::request_bandwidth(boost::intrusive_ptr<bandwidth_socket> const& peer\n\t\t, int blk, int priority\n\t\t, bandwidth_channel* chan1\n\t\t, bandwidth_channel* chan2\n\t\t, bandwidth_channel* chan3\n\t\t, bandwidth_channel* chan4\n\t\t, bandwidth_channel* chan5\n\t\t)\n\t{\n\t\tINVARIANT_CHECK;\n\t\tif (m_abort) return 0;\n\n\t\tTORRENT_ASSERT(blk > 0);\n\t\tTORRENT_ASSERT(priority > 0);\n\t\tTORRENT_ASSERT(!is_queued(peer.get()));\n\n\t\tbw_request bwr(peer, blk, priority);\n\t\tint i = 0;\n\t\tif (chan1 && chan1->throttle() > 0 && chan1->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan1;\n\t\tif (chan2 && chan2->throttle() > 0 && chan2->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan2;\n\t\tif (chan3 && chan3->throttle() > 0 && chan3->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan3;\n\t\tif (chan4 && chan4->throttle() > 0 && chan4->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan4;\n\t\tif (chan5 && chan5->throttle() > 0 && chan5->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan5;\n\n\t\tif (i == 0)\n\t\t{\n\t\t\t\/\/ the connection is not rate limited by any of its\n\t\t\t\/\/ bandwidth channels, or it doesn't belong to any\n\t\t\t\/\/ channels. There's no point in adding it to\n\t\t\t\/\/ the queue, just satisfy the request immediately\n\t\t\treturn blk;\n\t\t}\n\n\t\tm_queued_bytes += blk;\n\t\tm_queue.push_back(bwr);\n\t\treturn 0;\n\t}\n\n#if TORRENT_USE_INVARIANT_CHECKS\n\tvoid bandwidth_manager::check_invariant() const\n\t{\n\t\tboost::int64_t queued = 0;\n\t\tfor (queue_t::const_iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tqueued += i->request_size - i->assigned;\n\t\t}\n\t\tTORRENT_ASSERT(queued == m_queued_bytes);\n\t}\n#endif\n\n\tvoid bandwidth_manager::update_quotas(time_duration const& dt)\n\t{\n\t\tif (m_abort) return;\n\t\tif (m_queue.empty()) return;\n\n\t\tINVARIANT_CHECK;\n\n\t\tint dt_milliseconds = total_milliseconds(dt);\n\t\tif (dt_milliseconds > 3000) dt_milliseconds = 3000;\n\n\t\t\/\/ for each bandwidth channel, call update_quota(dt)\n\n\t\tstd::vector<bandwidth_channel*> channels;\n\n\t\tqueue_t tm;\n\n\t\tfor (queue_t::iterator i = m_queue.begin();\n\t\t\ti != m_queue.end();)\n\t\t{\n\t\t\tif (i->peer->is_disconnecting())\n\t\t\t{\n\t\t\t\tm_queued_bytes -= i->request_size - i->assigned;\n\n\t\t\t\t\/\/ return all assigned quota to all the\n\t\t\t\t\/\/ bandwidth channels this peer belongs to\n\t\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t\t{\n\t\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\t\tbwc->return_quota(i->assigned);\n\t\t\t\t}\n\n\t\t\t\ti->assigned = 0;\n\t\t\t\ttm.push_back(*i);\n\t\t\t\ti = m_queue.erase(i);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t{\n\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\tbwc->tmp = 0;\n\t\t\t}\n\t\t\t++i;\n\t\t}\n\n\t\tfor (queue_t::iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t{\n\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\tif (bwc->tmp == 0) channels.push_back(bwc);\n\t\t\t\tTORRENT_ASSERT(INT_MAX - bwc->tmp > i->priority);\n\t\t\t\tbwc->tmp += i->priority;\n\t\t\t}\n\t\t}\n\n\t\tfor (std::vector<bandwidth_channel*>::iterator i = channels.begin()\n\t\t\t, end(channels.end()); i != end; ++i)\n\t\t{\n\t\t\t(*i)->update_quota(dt_milliseconds);\n\t\t}\n\n\t\tfor (queue_t::iterator i = m_queue.begin();\n\t\t\ti != m_queue.end();)\n\t\t{\n\t\t\tint a = i->assign_bandwidth();\n\t\t\tif (i->assigned == i->request_size\n\t\t\t\t|| (i->ttl <= 0 && i->assigned > 0))\n\t\t\t{\n\t\t\t\ta += i->request_size - i->assigned;\n\t\t\t\tTORRENT_ASSERT(i->assigned <= i->request_size);\n\t\t\t\ttm.push_back(*i);\n\t\t\t\ti = m_queue.erase(i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++i;\n\t\t\t}\n\t\t\tm_queued_bytes -= a;\n\t\t}\n\n\t\twhile (!tm.empty())\n\t\t{\n\t\t\tbw_request& bwr = tm.back();\n\t\t\tbwr.peer->assign_bandwidth(m_channel, bwr.assigned);\n\t\t\ttm.pop_back();\n\t\t}\n\t}\n}\n\n<commit_msg>back-port shutdown assert fix<commit_after>\/*\n\nCopyright (c) 2009-2014, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/bandwidth_manager.hpp\"\n#include \"libtorrent\/time.hpp\"\n\nnamespace libtorrent\n{\n\n\tbandwidth_manager::bandwidth_manager(int channel\n#ifdef TORRENT_VERBOSE_BANDWIDTH_LIMIT\n\t\t, bool log\n#endif\t\t\n\t\t)\n\t\t: m_queued_bytes(0)\n\t\t, m_channel(channel)\n\t\t, m_abort(false)\n\t{\n#ifdef TORRENT_VERBOSE_BANDWIDTH_LIMIT\n\t\tif (log)\n\t\t\tm_log.open(\"bandwidth_limiter.log\", std::ios::trunc);\n\t\tm_start = time_now();\n#endif\n\t}\n\n\tvoid bandwidth_manager::close()\n\t{\n\t\tm_abort = true;\n\n\t\tqueue_t tm;\n\t\ttm.swap(m_queue);\n\t\tm_queued_bytes = 0;\n\n\t\twhile (!tm.empty())\n\t\t{\n\t\t\tbw_request& bwr = tm.back();\n\t\t\tbwr.peer->assign_bandwidth(m_channel, bwr.assigned);\n\t\t\ttm.pop_back();\n\t\t}\n\t}\n\n#if TORRENT_USE_ASSERTS\n\tbool bandwidth_manager::is_queued(bandwidth_socket const* peer) const\n\t{\n\t\tfor (queue_t::const_iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tif (i->peer.get() == peer) return true;\n\t\t}\n\t\treturn false;\n\t}\n#endif\n\n\tint bandwidth_manager::queue_size() const\n\t{\n\t\treturn m_queue.size();\n\t}\n\n\tint bandwidth_manager::queued_bytes() const\n\t{\n\t\treturn m_queued_bytes;\n\t}\n\t\n\t\/\/ non prioritized means that, if there's a line for bandwidth,\n\t\/\/ others will cut in front of the non-prioritized peers.\n\t\/\/ this is used by web seeds\n\tint bandwidth_manager::request_bandwidth(boost::intrusive_ptr<bandwidth_socket> const& peer\n\t\t, int blk, int priority\n\t\t, bandwidth_channel* chan1\n\t\t, bandwidth_channel* chan2\n\t\t, bandwidth_channel* chan3\n\t\t, bandwidth_channel* chan4\n\t\t, bandwidth_channel* chan5\n\t\t)\n\t{\n\t\tINVARIANT_CHECK;\n\t\tif (m_abort) return 0;\n\n\t\tTORRENT_ASSERT(blk > 0);\n\t\tTORRENT_ASSERT(priority > 0);\n\t\tTORRENT_ASSERT(!is_queued(peer.get()));\n\n\t\tbw_request bwr(peer, blk, priority);\n\t\tint i = 0;\n\t\tif (chan1 && chan1->throttle() > 0 && chan1->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan1;\n\t\tif (chan2 && chan2->throttle() > 0 && chan2->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan2;\n\t\tif (chan3 && chan3->throttle() > 0 && chan3->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan3;\n\t\tif (chan4 && chan4->throttle() > 0 && chan4->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan4;\n\t\tif (chan5 && chan5->throttle() > 0 && chan5->need_queueing(blk))\n\t\t\tbwr.channel[i++] = chan5;\n\n\t\tif (i == 0)\n\t\t{\n\t\t\t\/\/ the connection is not rate limited by any of its\n\t\t\t\/\/ bandwidth channels, or it doesn't belong to any\n\t\t\t\/\/ channels. There's no point in adding it to\n\t\t\t\/\/ the queue, just satisfy the request immediately\n\t\t\treturn blk;\n\t\t}\n\n\t\tm_queued_bytes += blk;\n\t\tm_queue.push_back(bwr);\n\t\treturn 0;\n\t}\n\n#if TORRENT_USE_INVARIANT_CHECKS\n\tvoid bandwidth_manager::check_invariant() const\n\t{\n\t\tboost::int64_t queued = 0;\n\t\tfor (queue_t::const_iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tqueued += i->request_size - i->assigned;\n\t\t}\n\t\tTORRENT_ASSERT(queued == m_queued_bytes);\n\t}\n#endif\n\n\tvoid bandwidth_manager::update_quotas(time_duration const& dt)\n\t{\n\t\tif (m_abort) return;\n\t\tif (m_queue.empty()) return;\n\n\t\tINVARIANT_CHECK;\n\n\t\tint dt_milliseconds = total_milliseconds(dt);\n\t\tif (dt_milliseconds > 3000) dt_milliseconds = 3000;\n\n\t\t\/\/ for each bandwidth channel, call update_quota(dt)\n\n\t\tstd::vector<bandwidth_channel*> channels;\n\n\t\tqueue_t tm;\n\n\t\tfor (queue_t::iterator i = m_queue.begin();\n\t\t\ti != m_queue.end();)\n\t\t{\n\t\t\tif (i->peer->is_disconnecting())\n\t\t\t{\n\t\t\t\tm_queued_bytes -= i->request_size - i->assigned;\n\n\t\t\t\t\/\/ return all assigned quota to all the\n\t\t\t\t\/\/ bandwidth channels this peer belongs to\n\t\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t\t{\n\t\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\t\tbwc->return_quota(i->assigned);\n\t\t\t\t}\n\n\t\t\t\ti->assigned = 0;\n\t\t\t\ttm.push_back(*i);\n\t\t\t\ti = m_queue.erase(i);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t{\n\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\tbwc->tmp = 0;\n\t\t\t}\n\t\t\t++i;\n\t\t}\n\n\t\tfor (queue_t::iterator i = m_queue.begin()\n\t\t\t, end(m_queue.end()); i != end; ++i)\n\t\t{\n\t\t\tfor (int j = 0; j < bw_request::max_bandwidth_channels && i->channel[j]; ++j)\n\t\t\t{\n\t\t\t\tbandwidth_channel* bwc = i->channel[j];\n\t\t\t\tif (bwc->tmp == 0) channels.push_back(bwc);\n\t\t\t\tTORRENT_ASSERT(INT_MAX - bwc->tmp > i->priority);\n\t\t\t\tbwc->tmp += i->priority;\n\t\t\t}\n\t\t}\n\n\t\tfor (std::vector<bandwidth_channel*>::iterator i = channels.begin()\n\t\t\t, end(channels.end()); i != end; ++i)\n\t\t{\n\t\t\t(*i)->update_quota(dt_milliseconds);\n\t\t}\n\n\t\tfor (queue_t::iterator i = m_queue.begin();\n\t\t\ti != m_queue.end();)\n\t\t{\n\t\t\tint a = i->assign_bandwidth();\n\t\t\tif (i->assigned == i->request_size\n\t\t\t\t|| (i->ttl <= 0 && i->assigned > 0))\n\t\t\t{\n\t\t\t\ta += i->request_size - i->assigned;\n\t\t\t\tTORRENT_ASSERT(i->assigned <= i->request_size);\n\t\t\t\ttm.push_back(*i);\n\t\t\t\ti = m_queue.erase(i);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t++i;\n\t\t\t}\n\t\t\tm_queued_bytes -= a;\n\t\t}\n\n\t\twhile (!tm.empty())\n\t\t{\n\t\t\tbw_request& bwr = tm.back();\n\t\t\tbwr.peer->assign_bandwidth(m_channel, bwr.assigned);\n\t\t\ttm.pop_back();\n\t\t}\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n\/***************************************************************************\n jabberregister.cpp - Register dialog for Jabber\n -------------------\n begin : Sun Jul 11 2004\n copyright : (C) 2004 by Till Gerken <till@tantalo.net>\n\n\t\tKopete (C) 2001-2004 Kopete developers <kopete-devel@kde.org>\n ***************************************************************************\/\n\n\/***************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n ***************************************************************************\/\n\n#include \"jabberregisteraccount.h\"\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n#include <kmessagebox.h>\n#include <klineedit.h>\n#include <kpassdlg.h>\n#include <knuminput.h>\n#include <kpushbutton.h>\n#include <qlabel.h>\n#include <qcheckbox.h>\n#include <qtimer.h>\n#include <qregexp.h>\n\n#include \"qca.h\"\n#include \"xmpp.h\"\n#include \"xmpp_tasks.h\"\n\n#include \"kopeteuiglobal.h\"\n#include \"kopetepasswordwidget.h\"\n#include \"jabberprotocol.h\"\n#include \"jabberaccount.h\"\n#include \"jabberclient.h\"\n#include \"jabberconnector.h\"\n#include \"jabbereditaccountwidget.h\"\n#include \"jabberchooseserver.h\"\n#include \"dlgjabberregisteraccount.h\"\n\nJabberRegisterAccount::JabberRegisterAccount ( JabberEditAccountWidget *parent, const char *name )\n : KDialogBase ( parent, name, true, i18n(\"Register New Jabber Account\"),\n \t\t\t\t KDialogBase::Ok | KDialogBase::Cancel )\n{\n\n\tmParentWidget = parent;\n\n\t\/\/ setup main dialog\n\tmMainWidget = new DlgJabberRegisterAccount ( this );\n\tsetMainWidget ( mMainWidget );\n\n\t\/\/ replace \"Ok\" button with a \"Register\" button\n\tKGuiItem registerButton = KStdGuiItem::ok();\n\tregisterButton.setText ( i18n ( \"Register\" ) );\n\tsetButtonOK ( registerButton );\n\n\tenableButtonSeparator ( true );\n\n\t\/\/ clear variables\n\tjabberClient = new JabberClient ();\n\n\tconnect ( jabberClient, SIGNAL ( csError ( int ) ), this, SLOT ( slotCSError ( int ) ) );\n\tconnect ( jabberClient, SIGNAL ( tlsWarning ( int ) ), this, SLOT ( slotHandleTLSWarning ( int ) ) );\n\tconnect ( jabberClient, SIGNAL ( connected () ), this, SLOT ( slotConnected () ) );\n\t\n\tjidRegExp.setPattern ( \"[\\\\w\\\\d.+_-]{1,}@[\\\\w\\\\d.-]{1,}\" );\n\thintPixmap = KGlobal::iconLoader()->loadIcon ( \"jabber_online\", KIcon::Small );\n\n\tmSuccess = false;\n\n\t\/\/ get all settings from the main dialog\n\tmMainWidget->leServer->setText ( parent->mServer->text () );\n\tmMainWidget->leJID->setText ( parent->mID->text () );\n\tmMainWidget->lePassword->setText ( parent->mPass->password () );\n\tmMainWidget->lePasswordVerify->setText ( parent->mPass->password () );\n\tmMainWidget->sbPort->setValue ( parent->mPort->value () );\n\tmMainWidget->cbUseSSL->setChecked ( parent->cbUseSSL->isChecked () );\n\n\t\/\/ connect buttons to slots, ok is already connected by default\n\tconnect ( this, SIGNAL ( cancelClicked () ), this, SLOT ( slotDeleteDialog () ) );\n\tconnect ( mMainWidget->btnChooseServer, SIGNAL ( clicked () ), this, SLOT ( slotChooseServer () ) );\n\tconnect ( mMainWidget->leServer, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( slotJIDInformation () ) );\n\tconnect ( mMainWidget->leJID, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( slotJIDInformation () ) );\n\tconnect ( mMainWidget->cbUseSSL, SIGNAL ( toggled ( bool ) ), this, SLOT ( slotSSLToggled () ) );\n\n\tconnect ( mMainWidget->leServer, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->leJID, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->lePassword, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->lePasswordVerify, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\n\t\/\/ display JID info now\n\tslotJIDInformation ();\n\n\t\/\/ display validation info\n\tvalidateData ();\n}\n\n\nJabberRegisterAccount::~JabberRegisterAccount()\n{\n\tdelete jabberClient;\n}\n\nvoid JabberRegisterAccount::slotDeleteDialog ()\n{\n\n\tdeleteLater ();\n\n}\n\nvoid JabberRegisterAccount::validateData ()\n{\n\n\tint valid = true;\n\tint passwordHighlight = false;\n\n\tif ( mMainWidget->leServer->text().isEmpty () )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter a server name, or click Choose.\" ) );\n\t\tmMainWidget->pixServer->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse\n\t{\n\t\tmMainWidget->pixServer->setText ( \"\" );\n\t}\n\n\tif ( valid && !jidRegExp.exactMatch ( mMainWidget->leJID->text() ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter a valid Jabber ID.\" ) );\n\t\tmMainWidget->pixJID->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse\n\t{\n\t\tmMainWidget->pixJID->setText ( \"\" );\n\t}\n\n\tif ( valid &&\n\t ( QString::fromLatin1 ( mMainWidget->lePassword->password () ).isEmpty () ||\n\t QString::fromLatin1 ( mMainWidget->lePasswordVerify->password () ).isEmpty () ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter the same password twice.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid &&\n\t ( QString::fromLatin1 ( mMainWidget->lePassword->password () ) !=\n\t QString::fromLatin1 ( mMainWidget->lePasswordVerify->password () ) ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Password entries do not match.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( passwordHighlight == true )\n\t{\n\t\tmMainWidget->pixPassword->setPixmap ( hintPixmap );\n\t\tmMainWidget->pixPasswordVerify->setPixmap ( hintPixmap );\n\t}\n\telse {\n\t\tmMainWidget->pixPassword->setText ( \"\" );\n\t\tmMainWidget->pixPasswordVerify->setText ( \"\" );\n\t}\n\n\tif ( valid )\n\t{\n\t\t\/\/ clear status message if we have valid data\n\t\tmMainWidget->lblStatusMessage->setText ( \"\" );\n\t}\n\n\tenableButtonOK ( valid );\n\n}\n\nvoid JabberRegisterAccount::slotJIDInformation ()\n{\n\n\tif ( !mMainWidget->leServer->text().isEmpty () &&\n\t\t ( !jidRegExp.exactMatch ( mMainWidget->leJID->text () ) ||\n\t\t ( mMainWidget->leJID->text().section ( \"@\", 1 ) != mMainWidget->leServer->text () ) ) )\n\t{\n\t\tmMainWidget->lblJIDInformation->setText ( i18n ( \"Unless you know what you are doing, your JID should be of the form \"\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"\\\"username@server.com\\\". In your case for example \\\"username@%1\\\".\" ).\n\t\t\t\t\t\t\t\t\t\t\t\t\targ ( mMainWidget->leServer->text () ) );\n\t}\n\telse\n\t{\n\t\tmMainWidget->lblJIDInformation->setText ( \"\" );\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotSSLToggled ()\n{\n\n\tif ( mMainWidget->cbUseSSL->isChecked () )\n\t{\n\t\tif ( mMainWidget->sbPort->value () == 5222 )\n\t\t{\n\t\t\tmMainWidget->sbPort->setValue ( 5223 );\n\t\t}\n\t}\n\telse\n\t{\n\t\tif ( mMainWidget->sbPort->value () == 5223 )\n\t\t{\n\t\t\tmMainWidget->sbPort->setValue ( 5222 );\n\t\t}\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotChooseServer ()\n{\n\n\t(new JabberChooseServer ( this ))->show ();\n\n}\n\nvoid JabberRegisterAccount::setServer ( const QString &server )\n{\n\n\tmMainWidget->leServer->setText ( server );\n\tmMainWidget->leJID->setText ( QString ( \"@%1\" ).arg ( server ) );\n\n}\n\nvoid JabberRegisterAccount::slotOk ()\n{\n\n\tmMainWidget->lblStatusMessage->setText ( \"\" );\n\n\tkdDebug ( JABBER_DEBUG_GLOBAL ) << k_funcinfo << \"Registering a new Jabber account.\" << endl;\n\n\tenableButtonOK ( false );\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Connecting to server...\" ) );\n\n\t\/\/ cancel any previous attempt\n\tjabberClient->disconnect ();\n\n\t\/\/ FIXME: we need to use the old protocol for now\n\tjabberClient->setUseXMPP09 ( true );\n\n\tjabberClient->setUseSSL ( mMainWidget->cbUseSSL->isChecked () );\n\n\t\/\/ FIXME: check this when using the new protocol\n\tjabberClient->setOverrideHost ( true, mMainWidget->leServer->text (), mMainWidget->sbPort->value () );\n\n\t\/\/ start connection, no authentication\n\tswitch ( jabberClient->connect ( XMPP::Jid ( mMainWidget->leJID->text () ), QString::null, false ) )\n\t{\n\t\tcase JabberClient::NoTLS:\n\t\t\t\/\/ no SSL support, at the connecting stage this means the problem is client-side\n\t\t\tKMessageBox::queuedMessageBox(Kopete::UI::Global::mainWidget (), KMessageBox::Error,\n\t\t\t\t\t\t\t\ti18n (\"SSL support could not be initialized for account %1. This is most likely because the QCA TLS plugin is not installed on your system.\").\n\t\t\t\t\t\t\t\targ ( mMainWidget->leJID->text () ),\n\t\t\t\t\t\t\t\ti18n (\"Jabber SSL Error\"));\n\t\t\tbreak;\n\t\n\t\tcase JabberClient::Ok:\n\t\tdefault:\n\t\t\t\/\/ everything alright!\n\t\t\tbreak;\n\t}\n\n}\n\nvoid JabberRegisterAccount::disconnect ()\n{\n\n\tif(jabberClient)\n\t\tjabberClient->disconnect ();\n\n\tif ( !mSuccess )\n\t\tenableButtonOK ( true );\n\n}\n\nvoid JabberRegisterAccount::slotHandleTLSWarning ( int validityResult )\n{\n\tkdDebug ( JABBER_DEBUG_GLOBAL ) << k_funcinfo << \"Handling TLS warning...\" << endl;\n\n\tif ( JabberAccount::handleTLSWarning ( jabberClient, validityResult ) )\n\t{\n\t\t\/\/ resume stream\n\t\tjabberClient->continueAfterTLSWarning ();\n\t}\n\telse\n\t{\n\t\t\/\/ disconnect stream\n\t\tdisconnect ();\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotCSError (int error)\n{\n\tkdDebug(JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Error in stream signalled, disconnecting.\" << endl;\n\n\tKopete::Account::DisconnectReason errorClass;\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Protocol error.\" ) );\n\n\t\/\/ display message to user\n\tJabberAccount::handleStreamError (error, jabberClient->clientStream()->errorCondition (), jabberClient->clientConnector()->errorCode (), mMainWidget->leServer->text (), errorClass);\n\n\tdisconnect ();\n\n}\n\nvoid JabberRegisterAccount::slotConnected ()\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Launching registration task...\" << endl;\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Connected successfully, registering new account...\" ) );\n\n\tXMPP::JT_Register * task = new XMPP::JT_Register (jabberClient->rootTask ());\n\tQObject::connect (task, SIGNAL (finished ()), this, SLOT (slotRegisterUserDone ()));\n\ttask->reg (mMainWidget->leJID->text().section(\"@\", 0, 0), mMainWidget->lePassword->password ());\n\ttask->go (true);\n\n}\n\nvoid JabberRegisterAccount::slotRegisterUserDone ()\n{\n\tXMPP::JT_Register * task = (XMPP::JT_Register *) sender ();\n\n\tif (task->success ())\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Registration successful.\" ) );\n\n\t\t\/\/ save settings to parent\n\t\tmParentWidget->mServer->setText ( mMainWidget->leServer->text () );\n\t\tmParentWidget->mID->setText ( mMainWidget->leJID->text () );\n\t\tmParentWidget->mPass->setPassword ( mMainWidget->lePassword->password () );\n\t\tmParentWidget->mPort->setValue ( mMainWidget->sbPort->value () );\n\t\tmParentWidget->cbUseSSL->setChecked ( mMainWidget->cbUseSSL->isChecked () );\n\n\t\t\/\/ disable input widgets\n\t\tmMainWidget->btnChooseServer->setEnabled ( false );\n\t\tmMainWidget->leServer->setEnabled ( false );\n\t\tmMainWidget->leJID->setEnabled ( false );\n\t\tmMainWidget->lePassword->setEnabled ( false );\n\t\tmMainWidget->lePasswordVerify->setEnabled ( false );\n\t\tmMainWidget->sbPort->setEnabled ( false );\n\t\tmMainWidget->cbUseSSL->setEnabled ( false );\n\n\t\t\/\/ disable input widget labels\n\t\tmMainWidget->lblServer->setEnabled ( false );\n\t\tmMainWidget->lblJID->setEnabled ( false );\n\t\tmMainWidget->lblPassword->setEnabled ( false );\n\t\tmMainWidget->lblPasswordVerify->setEnabled ( false );\n\t\tmMainWidget->lblPort->setEnabled ( false );\n\n\t\tmSuccess = true;\n\n\t\t\/\/ rewire buttons\n\t\tenableButtonOK ( false );\n\t\tsetButtonCancel ( KStdGuiItem::close () );\n\t\tconnect ( this, SIGNAL ( closeClicked () ), this, SLOT ( slotDeleteDialog () ) );\n\t}\n\telse\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Registration failed.\" ) );\n\t\tKMessageBox::queuedMessageBox (Kopete::UI::Global::mainWidget (), KMessageBox::Information,\n\t\t\t\t\t\t\t\t i18n (\"Unable to create account on the server. The Jabber ID is probably already in use.\"),\n\t\t\t\t\t\t\t\t i18n (\"Jabber Account Registration\"));\n\n\t}\n\n\t\/\/ FIXME: this is required because Iris crashes if we try\n\t\/\/ to disconnect here. Hopefully Justin can fix this.\n\tQTimer::singleShot(0, this, SLOT(disconnect ()));\n\n}\n\n#include \"jabberregisteraccount.moc\"\n<commit_msg>backport fix for Bug 114631: Strange value in password field when registering a jabber account<commit_after>\n\/***************************************************************************\n jabberregister.cpp - Register dialog for Jabber\n -------------------\n begin : Sun Jul 11 2004\n copyright : (C) 2004 by Till Gerken <till@tantalo.net>\n\n\t\tKopete (C) 2001-2004 Kopete developers <kopete-devel@kde.org>\n ***************************************************************************\/\n\n\/***************************************************************************\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n ***************************************************************************\/\n\n#include \"jabberregisteraccount.h\"\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kiconloader.h>\n#include <kglobal.h>\n#include <kmessagebox.h>\n#include <klineedit.h>\n#include <kpassdlg.h>\n#include <knuminput.h>\n#include <kpushbutton.h>\n#include <qlabel.h>\n#include <qcheckbox.h>\n#include <qtimer.h>\n#include <qregexp.h>\n\n#include \"qca.h\"\n#include \"xmpp.h\"\n#include \"xmpp_tasks.h\"\n\n#include \"kopeteuiglobal.h\"\n#include \"kopetepasswordwidget.h\"\n#include \"jabberprotocol.h\"\n#include \"jabberaccount.h\"\n#include \"jabberclient.h\"\n#include \"jabberconnector.h\"\n#include \"jabbereditaccountwidget.h\"\n#include \"jabberchooseserver.h\"\n#include \"dlgjabberregisteraccount.h\"\n\nJabberRegisterAccount::JabberRegisterAccount ( JabberEditAccountWidget *parent, const char *name )\n : KDialogBase ( parent, name, true, i18n(\"Register New Jabber Account\"),\n \t\t\t\t KDialogBase::Ok | KDialogBase::Cancel )\n{\n\n\tmParentWidget = parent;\n\n\t\/\/ setup main dialog\n\tmMainWidget = new DlgJabberRegisterAccount ( this );\n\tsetMainWidget ( mMainWidget );\n\n\t\/\/ replace \"Ok\" button with a \"Register\" button\n\tKGuiItem registerButton = KStdGuiItem::ok();\n\tregisterButton.setText ( i18n ( \"Register\" ) );\n\tsetButtonOK ( registerButton );\n\n\tenableButtonSeparator ( true );\n\n\t\/\/ clear variables\n\tjabberClient = new JabberClient ();\n\n\tconnect ( jabberClient, SIGNAL ( csError ( int ) ), this, SLOT ( slotCSError ( int ) ) );\n\tconnect ( jabberClient, SIGNAL ( tlsWarning ( int ) ), this, SLOT ( slotHandleTLSWarning ( int ) ) );\n\tconnect ( jabberClient, SIGNAL ( connected () ), this, SLOT ( slotConnected () ) );\n\t\n\tjidRegExp.setPattern ( \"[\\\\w\\\\d.+_-]{1,}@[\\\\w\\\\d.-]{1,}\" );\n\thintPixmap = KGlobal::iconLoader()->loadIcon ( \"jabber_online\", KIcon::Small );\n\n\tmSuccess = false;\n\n\t\/\/ get all settings from the main dialog\n\tmMainWidget->leServer->setText ( parent->mServer->text () );\n\tmMainWidget->leJID->setText ( parent->mID->text () );\n\tmMainWidget->lePassword->setText ( parent->mPass->password () );\n\t\/\/\tmMainWidget->lePasswordVerify->setText ( parent->mPass->password () ); \/\/BUG 14631\n\tmMainWidget->sbPort->setValue ( parent->mPort->value () );\n\tmMainWidget->cbUseSSL->setChecked ( parent->cbUseSSL->isChecked () );\n\n\t\/\/ connect buttons to slots, ok is already connected by default\n\tconnect ( this, SIGNAL ( cancelClicked () ), this, SLOT ( slotDeleteDialog () ) );\n\tconnect ( mMainWidget->btnChooseServer, SIGNAL ( clicked () ), this, SLOT ( slotChooseServer () ) );\n\tconnect ( mMainWidget->leServer, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( slotJIDInformation () ) );\n\tconnect ( mMainWidget->leJID, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( slotJIDInformation () ) );\n\tconnect ( mMainWidget->cbUseSSL, SIGNAL ( toggled ( bool ) ), this, SLOT ( slotSSLToggled () ) );\n\n\tconnect ( mMainWidget->leServer, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->leJID, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->lePassword, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\tconnect ( mMainWidget->lePasswordVerify, SIGNAL ( textChanged ( const QString & ) ), this, SLOT ( validateData () ) );\n\n\t\/\/ display JID info now\n\tslotJIDInformation ();\n\n\t\/\/ display validation info\n\tvalidateData ();\n}\n\n\nJabberRegisterAccount::~JabberRegisterAccount()\n{\n\tdelete jabberClient;\n}\n\nvoid JabberRegisterAccount::slotDeleteDialog ()\n{\n\n\tdeleteLater ();\n\n}\n\nvoid JabberRegisterAccount::validateData ()\n{\n\n\tint valid = true;\n\tint passwordHighlight = false;\n\n\tif ( mMainWidget->leServer->text().isEmpty () )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter a server name, or click Choose.\" ) );\n\t\tmMainWidget->pixServer->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse\n\t{\n\t\tmMainWidget->pixServer->setText ( \"\" );\n\t}\n\n\tif ( valid && !jidRegExp.exactMatch ( mMainWidget->leJID->text() ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter a valid Jabber ID.\" ) );\n\t\tmMainWidget->pixJID->setPixmap ( hintPixmap );\n\t\tvalid = false;\n\t}\n\telse\n\t{\n\t\tmMainWidget->pixJID->setText ( \"\" );\n\t}\n\n\tif ( valid &&\n\t ( QString::fromLatin1 ( mMainWidget->lePassword->password () ).isEmpty () ||\n\t QString::fromLatin1 ( mMainWidget->lePasswordVerify->password () ).isEmpty () ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Please enter the same password twice.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( valid &&\n\t ( QString::fromLatin1 ( mMainWidget->lePassword->password () ) !=\n\t QString::fromLatin1 ( mMainWidget->lePasswordVerify->password () ) ) )\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Password entries do not match.\" ) );\n\t\tvalid = false;\n\t\tpasswordHighlight = true;\n\t}\n\n\tif ( passwordHighlight == true )\n\t{\n\t\tmMainWidget->pixPassword->setPixmap ( hintPixmap );\n\t\tmMainWidget->pixPasswordVerify->setPixmap ( hintPixmap );\n\t}\n\telse {\n\t\tmMainWidget->pixPassword->setText ( \"\" );\n\t\tmMainWidget->pixPasswordVerify->setText ( \"\" );\n\t}\n\n\tif ( valid )\n\t{\n\t\t\/\/ clear status message if we have valid data\n\t\tmMainWidget->lblStatusMessage->setText ( \"\" );\n\t}\n\n\tenableButtonOK ( valid );\n\n}\n\nvoid JabberRegisterAccount::slotJIDInformation ()\n{\n\n\tif ( !mMainWidget->leServer->text().isEmpty () &&\n\t\t ( !jidRegExp.exactMatch ( mMainWidget->leJID->text () ) ||\n\t\t ( mMainWidget->leJID->text().section ( \"@\", 1 ) != mMainWidget->leServer->text () ) ) )\n\t{\n\t\tmMainWidget->lblJIDInformation->setText ( i18n ( \"Unless you know what you are doing, your JID should be of the form \"\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t \"\\\"username@server.com\\\". In your case for example \\\"username@%1\\\".\" ).\n\t\t\t\t\t\t\t\t\t\t\t\t\targ ( mMainWidget->leServer->text () ) );\n\t}\n\telse\n\t{\n\t\tmMainWidget->lblJIDInformation->setText ( \"\" );\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotSSLToggled ()\n{\n\n\tif ( mMainWidget->cbUseSSL->isChecked () )\n\t{\n\t\tif ( mMainWidget->sbPort->value () == 5222 )\n\t\t{\n\t\t\tmMainWidget->sbPort->setValue ( 5223 );\n\t\t}\n\t}\n\telse\n\t{\n\t\tif ( mMainWidget->sbPort->value () == 5223 )\n\t\t{\n\t\t\tmMainWidget->sbPort->setValue ( 5222 );\n\t\t}\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotChooseServer ()\n{\n\n\t(new JabberChooseServer ( this ))->show ();\n\n}\n\nvoid JabberRegisterAccount::setServer ( const QString &server )\n{\n\n\tmMainWidget->leServer->setText ( server );\n\tmMainWidget->leJID->setText ( QString ( \"@%1\" ).arg ( server ) );\n\n}\n\nvoid JabberRegisterAccount::slotOk ()\n{\n\n\tmMainWidget->lblStatusMessage->setText ( \"\" );\n\n\tkdDebug ( JABBER_DEBUG_GLOBAL ) << k_funcinfo << \"Registering a new Jabber account.\" << endl;\n\n\tenableButtonOK ( false );\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Connecting to server...\" ) );\n\n\t\/\/ cancel any previous attempt\n\tjabberClient->disconnect ();\n\n\t\/\/ FIXME: we need to use the old protocol for now\n\tjabberClient->setUseXMPP09 ( true );\n\n\tjabberClient->setUseSSL ( mMainWidget->cbUseSSL->isChecked () );\n\n\t\/\/ FIXME: check this when using the new protocol\n\tjabberClient->setOverrideHost ( true, mMainWidget->leServer->text (), mMainWidget->sbPort->value () );\n\n\t\/\/ start connection, no authentication\n\tswitch ( jabberClient->connect ( XMPP::Jid ( mMainWidget->leJID->text () ), QString::null, false ) )\n\t{\n\t\tcase JabberClient::NoTLS:\n\t\t\t\/\/ no SSL support, at the connecting stage this means the problem is client-side\n\t\t\tKMessageBox::queuedMessageBox(Kopete::UI::Global::mainWidget (), KMessageBox::Error,\n\t\t\t\t\t\t\t\ti18n (\"SSL support could not be initialized for account %1. This is most likely because the QCA TLS plugin is not installed on your system.\").\n\t\t\t\t\t\t\t\targ ( mMainWidget->leJID->text () ),\n\t\t\t\t\t\t\t\ti18n (\"Jabber SSL Error\"));\n\t\t\tbreak;\n\t\n\t\tcase JabberClient::Ok:\n\t\tdefault:\n\t\t\t\/\/ everything alright!\n\t\t\tbreak;\n\t}\n\n}\n\nvoid JabberRegisterAccount::disconnect ()\n{\n\n\tif(jabberClient)\n\t\tjabberClient->disconnect ();\n\n\tif ( !mSuccess )\n\t\tenableButtonOK ( true );\n\n}\n\nvoid JabberRegisterAccount::slotHandleTLSWarning ( int validityResult )\n{\n\tkdDebug ( JABBER_DEBUG_GLOBAL ) << k_funcinfo << \"Handling TLS warning...\" << endl;\n\n\tif ( JabberAccount::handleTLSWarning ( jabberClient, validityResult ) )\n\t{\n\t\t\/\/ resume stream\n\t\tjabberClient->continueAfterTLSWarning ();\n\t}\n\telse\n\t{\n\t\t\/\/ disconnect stream\n\t\tdisconnect ();\n\t}\n\n}\n\nvoid JabberRegisterAccount::slotCSError (int error)\n{\n\tkdDebug(JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Error in stream signalled, disconnecting.\" << endl;\n\n\tKopete::Account::DisconnectReason errorClass;\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Protocol error.\" ) );\n\n\t\/\/ display message to user\n\tJabberAccount::handleStreamError (error, jabberClient->clientStream()->errorCondition (), jabberClient->clientConnector()->errorCode (), mMainWidget->leServer->text (), errorClass);\n\n\tdisconnect ();\n\n}\n\nvoid JabberRegisterAccount::slotConnected ()\n{\n\tkdDebug (JABBER_DEBUG_GLOBAL) << k_funcinfo << \"Launching registration task...\" << endl;\n\n\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Connected successfully, registering new account...\" ) );\n\n\tXMPP::JT_Register * task = new XMPP::JT_Register (jabberClient->rootTask ());\n\tQObject::connect (task, SIGNAL (finished ()), this, SLOT (slotRegisterUserDone ()));\n\ttask->reg (mMainWidget->leJID->text().section(\"@\", 0, 0), mMainWidget->lePassword->password ());\n\ttask->go (true);\n\n}\n\nvoid JabberRegisterAccount::slotRegisterUserDone ()\n{\n\tXMPP::JT_Register * task = (XMPP::JT_Register *) sender ();\n\n\tif (task->success ())\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Registration successful.\" ) );\n\n\t\t\/\/ save settings to parent\n\t\tmParentWidget->mServer->setText ( mMainWidget->leServer->text () );\n\t\tmParentWidget->mID->setText ( mMainWidget->leJID->text () );\n\t\tmParentWidget->mPass->setPassword ( mMainWidget->lePassword->password () );\n\t\tmParentWidget->mPort->setValue ( mMainWidget->sbPort->value () );\n\t\tmParentWidget->cbUseSSL->setChecked ( mMainWidget->cbUseSSL->isChecked () );\n\n\t\t\/\/ disable input widgets\n\t\tmMainWidget->btnChooseServer->setEnabled ( false );\n\t\tmMainWidget->leServer->setEnabled ( false );\n\t\tmMainWidget->leJID->setEnabled ( false );\n\t\tmMainWidget->lePassword->setEnabled ( false );\n\t\tmMainWidget->lePasswordVerify->setEnabled ( false );\n\t\tmMainWidget->sbPort->setEnabled ( false );\n\t\tmMainWidget->cbUseSSL->setEnabled ( false );\n\n\t\t\/\/ disable input widget labels\n\t\tmMainWidget->lblServer->setEnabled ( false );\n\t\tmMainWidget->lblJID->setEnabled ( false );\n\t\tmMainWidget->lblPassword->setEnabled ( false );\n\t\tmMainWidget->lblPasswordVerify->setEnabled ( false );\n\t\tmMainWidget->lblPort->setEnabled ( false );\n\n\t\tmSuccess = true;\n\n\t\t\/\/ rewire buttons\n\t\tenableButtonOK ( false );\n\t\tsetButtonCancel ( KStdGuiItem::close () );\n\t\tconnect ( this, SIGNAL ( closeClicked () ), this, SLOT ( slotDeleteDialog () ) );\n\t}\n\telse\n\t{\n\t\tmMainWidget->lblStatusMessage->setText ( i18n ( \"Registration failed.\" ) );\n\t\tKMessageBox::queuedMessageBox (Kopete::UI::Global::mainWidget (), KMessageBox::Information,\n\t\t\t\t\t\t\t\t i18n (\"Unable to create account on the server. The Jabber ID is probably already in use.\"),\n\t\t\t\t\t\t\t\t i18n (\"Jabber Account Registration\"));\n\n\t}\n\n\t\/\/ FIXME: this is required because Iris crashes if we try\n\t\/\/ to disconnect here. Hopefully Justin can fix this.\n\tQTimer::singleShot(0, this, SLOT(disconnect ()));\n\n}\n\n#include \"jabberregisteraccount.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (c) 2011 Laszlo Papp <djszapi@archlinux.us>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"qgitrepository.h\"\n#include \"qgitcommit.h\"\n#include \"qgitconfig.h\"\n#include \"qgittag.h\"\n#include \"qgittree.h\"\n#include \"qgitblob.h\"\n#include \"qgitsignature.h\"\n#include \"qgitexception.h\"\n\n#include <git2\/errors.h>\n#include <git2\/repository.h>\n#include <git2\/refs.h>\n#include <git2\/commit.h>\n#include <git2\/tag.h>\n#include <git2\/tree.h>\n#include <git2\/blob.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QVector>\n#include <QtCore\/QStringList>\n\n#include <QtDebug>\n#include <functional>\n\nnamespace {\nvoid do_not_free(git_repository*) {}\n}\n\nnamespace LibQGit2\n{\n\nQGitRepository::QGitRepository(git_repository *repository, bool own)\n : d(repository, own ? git_repository_free : do_not_free)\n{\n}\n\nQGitRepository::QGitRepository( const QGitRepository& other )\n : d(other.d)\n{\n}\n\nQGitRepository::~QGitRepository()\n{\n}\n\nQString QGitRepository::discover(const QString& startPath, bool acrossFs, const QStringList& ceilingDirs)\n{\n QByteArray repoPath(GIT_PATH_MAX, Qt::Uninitialized);\n QByteArray joinedCeilingDirs = QFile::encodeName(ceilingDirs.join(QChar(GIT_PATH_LIST_SEPARATOR)));\n qGitThrow(git_repository_discover(repoPath.data(), repoPath.length(),\n QFile::encodeName(startPath),\n acrossFs, joinedCeilingDirs));\n return QFile::decodeName(repoPath);\n}\n\nvoid QGitRepository::init(const QString& path, bool isBare)\n{\n d.clear();\n git_repository *repo = 0;\n qGitThrow(git_repository_init(&repo, QFile::encodeName(path), isBare));\n d = ptr_type(repo, git_repository_free);\n}\n\nvoid QGitRepository::open(const QString& path)\n{\n d.clear();\n git_repository *repo = 0;\n qGitThrow(git_repository_open(&repo, QFile::encodeName(path)));\n d = ptr_type(repo, git_repository_free);\n}\n\nvoid QGitRepository::discoverAndOpen(const QString &startPath,\n bool acrossFs,\n const QStringList &ceilingDirs)\n{\n open(discover(startPath, acrossFs, ceilingDirs));\n}\n\nQGitRef QGitRepository::head() const\n{\n git_reference *ref = 0;\n qGitThrow(git_repository_head(&ref, data()));\n return QGitRef(ref);\n}\n\nbool QGitRepository::isHeadDetached() const\n{\n return qGitThrow(git_repository_head_detached(data())) == 1;\n}\n\nbool QGitRepository::isHeadOrphan() const\n{\n return qGitThrow(git_repository_head_orphan(data())) == 1;\n}\n\nbool QGitRepository::isEmpty() const\n{\n return qGitThrow(git_repository_is_empty(data())) == 1;\n}\n\nbool QGitRepository::isBare() const\n{\n return qGitThrow(git_repository_is_bare(data())) == 1;\n}\n\nQString QGitRepository::name() const\n{\n QString repoPath = QDir::cleanPath( workDirPath() );\n if (isBare())\n repoPath = QDir::cleanPath( path() );\n\n return QFileInfo(repoPath).fileName();\n}\n\nQString QGitRepository::path() const\n{\n return QFile::decodeName(git_repository_path(data()));\n}\n\nQString QGitRepository::workDirPath() const\n{\n return QFile::decodeName(git_repository_workdir(data()));\n}\n\nQGitConfig QGitRepository::configuration() const\n{\n git_config *cfg;\n qGitThrow( git_repository_config(&cfg, data()) );\n return QGitConfig(cfg);\n}\n\nQGitRef QGitRepository::lookupRef(const QString& name) const\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_lookup(&ref, data(), QFile::encodeName(name)));\n return QGitRef(ref);\n}\n\nQGitCommit QGitRepository::lookupCommit(const QGitOId& oid) const\n{\n git_commit *commit = 0;\n qGitThrow(git_commit_lookup_prefix(&commit, data(), oid.constData(), oid.length()));\n return QGitCommit(commit);\n}\n\nQGitTag QGitRepository::lookupTag(const QGitOId& oid) const\n{\n git_tag *tag = 0;\n qGitThrow(git_tag_lookup_prefix(&tag, data(), oid.constData(), oid.length()));\n return QGitTag(tag);\n}\n\nQGitTree QGitRepository::lookupTree(const QGitOId& oid) const\n{\n git_tree *tree = 0;\n qGitThrow(git_tree_lookup_prefix(&tree, data(), oid.constData(), oid.length()));\n return QGitTree(tree);\n}\n\nQGitBlob QGitRepository::lookupBlob(const QGitOId& oid) const\n{\n git_blob *blob = 0;\n qGitThrow(git_blob_lookup_prefix(&blob, data(), oid.constData(), oid.length()));\n return QGitBlob(blob);\n}\n\nQGitObject QGitRepository::lookupAny(const QGitOId &oid) const\n{\n git_object *object = 0;\n qGitThrow(git_object_lookup_prefix(&object, data(), oid.constData(), oid.length(), GIT_OBJ_ANY));\n return QGitObject(object);\n}\n\nQGitRef QGitRepository::createRef(const QString& name, const QGitOId& oid, bool overwrite)\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_create(&ref, data(), QFile::encodeName(name), oid.constData(), overwrite));\n return QGitRef(ref);\n}\n\nQGitRef QGitRepository::createSymbolicRef(const QString& name, const QString& target, bool overwrite)\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_symbolic_create(&ref, data(), QFile::encodeName(name), QFile::encodeName(target), overwrite));\n return QGitRef(ref);\n}\n\nQGitOId QGitRepository::createCommit(const QString& ref,\n const QGitSignature& author,\n const QGitSignature& committer,\n const QString& message,\n const QGitTree& tree,\n const QList<QGitCommit>& parents)\n{\n QVector<const git_commit*> p;\n foreach (const QGitCommit& parent, parents) {\n p.append(parent.data());\n }\n\n QGitOId oid;\n qGitThrow(git_commit_create(oid.data(), data(), QFile::encodeName(ref), author.data(), committer.data(),\n NULL, message.toUtf8(), tree.data(), p.size(), p.data()));\n return oid;\n}\n\nQGitOId QGitRepository::createTag(const QString& name,\n const QGitObject& target,\n bool overwrite)\n{\n QGitOId oid;\n qGitThrow(git_tag_create_lightweight(oid.data(), data(), QFile::encodeName(name),\n target.data(), overwrite));\n return oid;\n}\n\nQGitOId QGitRepository::createTag(const QString& name,\n const QGitObject& target,\n const QGitSignature& tagger,\n const QString& message,\n bool overwrite)\n{\n QGitOId oid;\n qGitThrow(git_tag_create(oid.data(), data(), QFile::encodeName(name), target.data(),\n tagger.data(), message.toUtf8(), overwrite));\n return oid;\n}\n\nvoid QGitRepository::deleteTag(const QString& name)\n{\n qGitThrow(git_tag_delete(data(), QFile::encodeName(name)));\n}\n\nQGitOId QGitRepository::createBlobFromFile(const QString& path)\n{\n QGitOId oid;\n qGitThrow(git_blob_create_fromworkdir(oid.data(), data(), QFile::encodeName(path)));\n return oid;\n}\n\nQGitOId QGitRepository::createBlobFromBuffer(const QByteArray& buffer)\n{\n QGitOId oid;\n qGitThrow(git_blob_create_frombuffer(oid.data(), data(), buffer.data(), buffer.size()));\n return oid;\n}\n\nQStringList QGitRepository::listTags(const QString& pattern) const\n{\n QStringList list;\n git_strarray tags;\n qGitThrow(git_tag_list_match(&tags, qPrintable(pattern), data()));\n for (size_t i = 0; i < tags.count; ++i)\n {\n list << QString(tags.strings[i]);\n }\n git_strarray_free(&tags);\n return list;\n}\n\nQStringList QGitRepository::listReferences() const\n{\n QStringList list;\n git_strarray refs;\n qGitThrow(git_reference_list( &refs, data(), GIT_REF_LISTALL));\n for (size_t i = 0; i < refs.count; ++i)\n {\n list << QString(refs.strings[i]);\n }\n git_strarray_free(&refs);\n return list;\n}\n\nvoid QGitRepository::branches(const char *branch_name, git_branch_t branch_type)\n{\n \/\/ Do something\n repoBranches.insert(branch_name, branch_type);\n}\n\nextern \"C\" int branchesCallBack(const char *branch_name, git_branch_t branch_type,\n void *payload)\n{\n reinterpret_cast<QGitRepository*> (payload)->branches(branch_name, branch_type);\n\n \/\/ we want to continue looping so return 0\n return 0;\n}\n\nQStringList QGitRepository::showAllBranches(branchType type) const\n{\n QStringList list;\n\n qGitThrow(git_branch_foreach(data(), type, branchesCallBack,(void*)this));\n\n QMap<QString, git_branch_t>::const_iterator i = repoBranches.cbegin();\n while (i != repoBranches.constEnd())\n {\n list.append(i.key());\n ++i;\n }\n\n return list;\n}\n\nQGitDatabase QGitRepository::database() const\n{\n git_odb *odb;\n qGitThrow( git_repository_odb(&odb, data()) );\n return QGitDatabase(odb);\n}\n\nQGitIndex QGitRepository::index() const\n{\n git_index *idx;\n qGitThrow(git_repository_index(&idx, data()));\n return QGitIndex(idx);\n}\n\ngit_repository* QGitRepository::data() const\n{\n return d.data();\n}\n\nconst git_repository* QGitRepository::constData() const\n{\n return d.data();\n}\n\n} \/\/ namespace LibQGit2\n<commit_msg>Allow opening repository within sub directory<commit_after>\/******************************************************************************\n * This file is part of the Gluon Development Platform\n * Copyright (c) 2011 Laszlo Papp <djszapi@archlinux.us>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"qgitrepository.h\"\n#include \"qgitcommit.h\"\n#include \"qgitconfig.h\"\n#include \"qgittag.h\"\n#include \"qgittree.h\"\n#include \"qgitblob.h\"\n#include \"qgitsignature.h\"\n#include \"qgitexception.h\"\n\n#include <git2\/errors.h>\n#include <git2\/repository.h>\n#include <git2\/refs.h>\n#include <git2\/commit.h>\n#include <git2\/tag.h>\n#include <git2\/tree.h>\n#include <git2\/blob.h>\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFile>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QVector>\n#include <QtCore\/QStringList>\n\n#include <QtDebug>\n#include <functional>\n\nnamespace {\nvoid do_not_free(git_repository*) {}\n}\n\nnamespace LibQGit2\n{\n\nQGitRepository::QGitRepository(git_repository *repository, bool own)\n : d(repository, own ? git_repository_free : do_not_free)\n{\n}\n\nQGitRepository::QGitRepository( const QGitRepository& other )\n : d(other.d)\n{\n}\n\nQGitRepository::~QGitRepository()\n{\n}\n\nQString QGitRepository::discover(const QString& startPath, bool acrossFs, const QStringList& ceilingDirs)\n{\n QByteArray repoPath(GIT_PATH_MAX, Qt::Uninitialized);\n QByteArray joinedCeilingDirs = QFile::encodeName(ceilingDirs.join(QChar(GIT_PATH_LIST_SEPARATOR)));\n qGitThrow(git_repository_discover(repoPath.data(), repoPath.length(),\n QFile::encodeName(startPath),\n acrossFs, joinedCeilingDirs));\n return QFile::decodeName(repoPath);\n}\n\nvoid QGitRepository::init(const QString& path, bool isBare)\n{\n d.clear();\n git_repository *repo = 0;\n qGitThrow(git_repository_init(&repo, QFile::encodeName(path), isBare));\n d = ptr_type(repo, git_repository_free);\n}\n\n\nvoid QGitRepository::open(const QString& path)\n{\n d.clear();\n git_repository *repo = 0;\n QDir folder(path);\n\n do\n {\n if (folder.entryList(QDir::AllDirs | QDir::Hidden).contains(\".git\"))\n {\n break;\n }\n }\n while (folder.cdUp());\n\n qGitThrow(git_repository_open(&repo, QFile::encodeName(folder.absolutePath())));\n d = ptr_type(repo, git_repository_free);\n}\n\nvoid QGitRepository::discoverAndOpen(const QString &startPath,\n bool acrossFs,\n const QStringList &ceilingDirs)\n{\n open(discover(startPath, acrossFs, ceilingDirs));\n}\n\nQGitRef QGitRepository::head() const\n{\n git_reference *ref = 0;\n qGitThrow(git_repository_head(&ref, data()));\n return QGitRef(ref);\n}\n\nbool QGitRepository::isHeadDetached() const\n{\n return qGitThrow(git_repository_head_detached(data())) == 1;\n}\n\nbool QGitRepository::isHeadOrphan() const\n{\n return qGitThrow(git_repository_head_orphan(data())) == 1;\n}\n\nbool QGitRepository::isEmpty() const\n{\n return qGitThrow(git_repository_is_empty(data())) == 1;\n}\n\nbool QGitRepository::isBare() const\n{\n return qGitThrow(git_repository_is_bare(data())) == 1;\n}\n\nQString QGitRepository::name() const\n{\n QString repoPath = QDir::cleanPath( workDirPath() );\n if (isBare())\n repoPath = QDir::cleanPath( path() );\n\n return QFileInfo(repoPath).fileName();\n}\n\nQString QGitRepository::path() const\n{\n return QFile::decodeName(git_repository_path(data()));\n}\n\nQString QGitRepository::workDirPath() const\n{\n return QFile::decodeName(git_repository_workdir(data()));\n}\n\nQGitConfig QGitRepository::configuration() const\n{\n git_config *cfg;\n qGitThrow( git_repository_config(&cfg, data()) );\n return QGitConfig(cfg);\n}\n\nQGitRef QGitRepository::lookupRef(const QString& name) const\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_lookup(&ref, data(), QFile::encodeName(name)));\n return QGitRef(ref);\n}\n\nQGitCommit QGitRepository::lookupCommit(const QGitOId& oid) const\n{\n git_commit *commit = 0;\n qGitThrow(git_commit_lookup_prefix(&commit, data(), oid.constData(), oid.length()));\n return QGitCommit(commit);\n}\n\nQGitTag QGitRepository::lookupTag(const QGitOId& oid) const\n{\n git_tag *tag = 0;\n qGitThrow(git_tag_lookup_prefix(&tag, data(), oid.constData(), oid.length()));\n return QGitTag(tag);\n}\n\nQGitTree QGitRepository::lookupTree(const QGitOId& oid) const\n{\n git_tree *tree = 0;\n qGitThrow(git_tree_lookup_prefix(&tree, data(), oid.constData(), oid.length()));\n return QGitTree(tree);\n}\n\nQGitBlob QGitRepository::lookupBlob(const QGitOId& oid) const\n{\n git_blob *blob = 0;\n qGitThrow(git_blob_lookup_prefix(&blob, data(), oid.constData(), oid.length()));\n return QGitBlob(blob);\n}\n\nQGitObject QGitRepository::lookupAny(const QGitOId &oid) const\n{\n git_object *object = 0;\n qGitThrow(git_object_lookup_prefix(&object, data(), oid.constData(), oid.length(), GIT_OBJ_ANY));\n return QGitObject(object);\n}\n\nQGitRef QGitRepository::createRef(const QString& name, const QGitOId& oid, bool overwrite)\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_create(&ref, data(), QFile::encodeName(name), oid.constData(), overwrite));\n return QGitRef(ref);\n}\n\nQGitRef QGitRepository::createSymbolicRef(const QString& name, const QString& target, bool overwrite)\n{\n git_reference *ref = 0;\n qGitThrow(git_reference_symbolic_create(&ref, data(), QFile::encodeName(name), QFile::encodeName(target), overwrite));\n return QGitRef(ref);\n}\n\nQGitOId QGitRepository::createCommit(const QString& ref,\n const QGitSignature& author,\n const QGitSignature& committer,\n const QString& message,\n const QGitTree& tree,\n const QList<QGitCommit>& parents)\n{\n QVector<const git_commit*> p;\n foreach (const QGitCommit& parent, parents) {\n p.append(parent.data());\n }\n\n QGitOId oid;\n qGitThrow(git_commit_create(oid.data(), data(), QFile::encodeName(ref), author.data(), committer.data(),\n NULL, message.toUtf8(), tree.data(), p.size(), p.data()));\n return oid;\n}\n\nQGitOId QGitRepository::createTag(const QString& name,\n const QGitObject& target,\n bool overwrite)\n{\n QGitOId oid;\n qGitThrow(git_tag_create_lightweight(oid.data(), data(), QFile::encodeName(name),\n target.data(), overwrite));\n return oid;\n}\n\nQGitOId QGitRepository::createTag(const QString& name,\n const QGitObject& target,\n const QGitSignature& tagger,\n const QString& message,\n bool overwrite)\n{\n QGitOId oid;\n qGitThrow(git_tag_create(oid.data(), data(), QFile::encodeName(name), target.data(),\n tagger.data(), message.toUtf8(), overwrite));\n return oid;\n}\n\nvoid QGitRepository::deleteTag(const QString& name)\n{\n qGitThrow(git_tag_delete(data(), QFile::encodeName(name)));\n}\n\nQGitOId QGitRepository::createBlobFromFile(const QString& path)\n{\n QGitOId oid;\n qGitThrow(git_blob_create_fromworkdir(oid.data(), data(), QFile::encodeName(path)));\n return oid;\n}\n\nQGitOId QGitRepository::createBlobFromBuffer(const QByteArray& buffer)\n{\n QGitOId oid;\n qGitThrow(git_blob_create_frombuffer(oid.data(), data(), buffer.data(), buffer.size()));\n return oid;\n}\n\nQStringList QGitRepository::listTags(const QString& pattern) const\n{\n QStringList list;\n git_strarray tags;\n qGitThrow(git_tag_list_match(&tags, qPrintable(pattern), data()));\n for (size_t i = 0; i < tags.count; ++i)\n {\n list << QString(tags.strings[i]);\n }\n git_strarray_free(&tags);\n return list;\n}\n\nQStringList QGitRepository::listReferences() const\n{\n QStringList list;\n git_strarray refs;\n qGitThrow(git_reference_list( &refs, data(), GIT_REF_LISTALL));\n for (size_t i = 0; i < refs.count; ++i)\n {\n list << QString(refs.strings[i]);\n }\n git_strarray_free(&refs);\n return list;\n}\n\nvoid QGitRepository::branches(const char *branch_name, git_branch_t branch_type)\n{\n \/\/ Do something\n repoBranches.insert(branch_name, branch_type);\n}\n\nextern \"C\" int branchesCallBack(const char *branch_name, git_branch_t branch_type,\n void *payload)\n{\n reinterpret_cast<QGitRepository*> (payload)->branches(branch_name, branch_type);\n\n \/\/ we want to continue looping so return 0\n return 0;\n}\n\nQStringList QGitRepository::showAllBranches(branchType type) const\n{\n QStringList list;\n\n qGitThrow(git_branch_foreach(data(), type, branchesCallBack,(void*)this));\n\n QMap<QString, git_branch_t>::const_iterator i = repoBranches.cbegin();\n while (i != repoBranches.constEnd())\n {\n list.append(i.key());\n ++i;\n }\n\n return list;\n}\n\nQGitDatabase QGitRepository::database() const\n{\n git_odb *odb;\n qGitThrow( git_repository_odb(&odb, data()) );\n return QGitDatabase(odb);\n}\n\nQGitIndex QGitRepository::index() const\n{\n git_index *idx;\n qGitThrow(git_repository_index(&idx, data()));\n return QGitIndex(idx);\n}\n\ngit_repository* QGitRepository::data() const\n{\n return d.data();\n}\n\nconst git_repository* QGitRepository::constData() const\n{\n return d.data();\n}\n\n} \/\/ namespace LibQGit2\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n\n#include <llvm\/IR\/Value.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/IR\/Constants.h>\n#include <llvm\/IR\/DataLayout.h>\n#include <llvm\/Support\/raw_ostream.h>\n\n#include \"AnalysisGeneric.h\"\n#include \"LLVMDependenceGraph.h\"\n#include \"PointsTo.h\"\n\nusing namespace llvm;\n\nnamespace dg {\nnamespace analysis {\n\n\/\/ we assume that if the program uses inttoptr, it access this\n\/\/ memory only this way - so every access to this memory is done\n\/\/ via some inttoptr. Here we store the inttoptr objects\nstatic std::map<uint64_t, LLVMNode *> intToPtrMap;\n\n\/\/ pointer points to unknown memory location\nMemoryObj UnknownMemoryObject(nullptr);\n\/\/ unknown pointer value\nPointer UnknownMemoryLocation(&UnknownMemoryObject, 0);\n\nbool Pointer::isUnknown() const\n{\n return this == &UnknownMemoryLocation;\n}\n\nbool Pointer::pointsToUnknown() const\n{\n assert(obj && \"Pointer has not any memory object set\");\n return obj->isUnknown();\n}\n\nbool Pointer::isKnown() const\n{\n return !isUnknown() && !pointsToUnknown();\n}\n\nbool MemoryObj::isUnknown() const\n{\n return this == &UnknownMemoryObject;\n}\n\nstatic LLVMNode *createNodeWithMemAlloc(const Value *val)\n{\n LLVMNode *n = new LLVMNode(val);\n MemoryObj *&mo = n->getMemoryObj();\n mo = new MemoryObj(n);\n n->addPointsTo(Pointer(mo));\n\n return n;\n}\n\nstatic LLVMNode *getOrCreateNode(LLVMDependenceGraph *dg, const Value *val)\n{\n LLVMNode *n = dg->getNode(val);\n if (n)\n return n;\n\n if (llvm::isa<llvm::Function>(val)) {\n n = createNodeWithMemAlloc(val);\n } else\n errs() << \"ERR: unhandled not to create \" << *val << \"\\n\";\n\n return n;\n}\n\nstatic Pointer handleConstantBitCast(LLVMDependenceGraph *dg, const BitCastInst *BC)\n{\n if (!BC->isLosslessCast()) {\n errs() << \"WARN: Not a loss less cast unhandled ConstExpr\"\n << *BC << \"\\n\";\n return UnknownMemoryLocation;\n }\n\n const Value *llvmOp = BC->stripPointerCasts();\n LLVMNode *op = getOrCreateNode(dg, llvmOp);\n if (!op) {\n errs() << \"ERR: unsupported BitCast constant operand\" << *BC << \"\\n\";\n } else {\n PointsToSetT& ptset = op->getPointsTo();\n if (ptset.size() != 1) {\n errs() << \"ERR: constant BitCast with not only one pointer \"\n << *BC << \"\\n\";\n } else\n return *ptset.begin();\n }\n\n return UnknownMemoryLocation;\n}\n\nstatic inline unsigned getPointerBitwidth(const DataLayout *DL, const Value *ptr)\n{\n const Type *Ty = ptr->getType();\n return DL->getPointerSizeInBits(Ty->getPointerAddressSpace());\n}\n\nstatic Pointer handleConstantGep(LLVMDependenceGraph *dg,\n const GetElementPtrInst *GEP,\n const llvm::DataLayout *DL)\n{\n const Value *op = GEP->getPointerOperand();\n LLVMNode *opNode = dg->getNode(op);\n\n \/\/ FIXME this is sound, but may be unprecise\n \/\/ - we should use getOperand for getting opNode,\n \/\/ becaues we can have ConstantExpr inserted in ConstantExpr\n \/\/ (getelementptr (inttoptr ..) ...), so we can get null here\n \/\/ as opNode\n if (!opNode) {\n errs() << \"No node for Constant GEP operand: \" << *GEP << \"\\n\";\n return UnknownMemoryLocation;\n }\n\n PointsToSetT& S = opNode->getPointsTo();\n \/\/ since this is constant expr, there's no way how we could\n \/\/ get extra points-to binding in runtime\n assert(S.size() == 1);\n MemoryObj *mo = (*S.begin()).obj;\n if (!mo) {\n errs() << \"ERR: no memory object in \" << *opNode->getKey() << \"\\n\";\n return UnknownMemoryLocation;\n }\n\n Pointer pointer(mo, UNKNOWN_OFFSET);\n unsigned bitwidth = getPointerBitwidth(DL, op);\n APInt offset(bitwidth, 0);\n\n if (GEP->accumulateConstantOffset(*DL, offset)) {\n if (offset.isIntN(bitwidth))\n pointer.offset = offset.getZExtValue();\n else\n errs() << \"WARN: Offset greater than \"\n << bitwidth << \"-bit\" << *GEP << \"\\n\";\n }\n \/\/ else offset is set to UNKNOWN (in constructor)\n\n return pointer;\n}\n\nPointer getConstantExprPointer(const ConstantExpr *CE,\n LLVMDependenceGraph *dg,\n const llvm::DataLayout *DL)\n{\n Pointer pointer = UnknownMemoryLocation;\n\n const Instruction *Inst = const_cast<ConstantExpr*>(CE)->getAsInstruction();\n if (const GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) {\n pointer = handleConstantGep(dg, GEP, DL);\n } else if (const BitCastInst *BC = dyn_cast<BitCastInst>(Inst)) {\n pointer = handleConstantBitCast(dg, BC);\n } else {\n errs() << \"ERR: Unsupported ConstantExpr \" << *CE << \"\\n\";\n errs() << \" ^^ returning unknown pointer\\n\";\n }\n\n delete Inst;\n return pointer;\n}\n\nstatic LLVMNode *getConstantIntToPtrNode(const ConstantExpr *CE,\n const llvm::DataLayout *DL)\n{\n using namespace llvm;\n\n const Value *val = CE->getOperand(0);\n if (!isa<ConstantInt>(val)) {\n errs() << \"Unhandled constant inttoptr \" << *CE << \"\\n\";\n abort();\n }\n\n const ConstantInt *C = cast<ConstantInt>(val);\n uint64_t value = C->getLimitedValue();\n\n LLVMNode *&node = intToPtrMap[value];\n if (!node) {\n node = new LLVMNode(C);\n const Value *dest = CE->getOperand(1);\n Type *Ty = dest->getType()->getContainedType(0);\n uint64_t size = 0;\n if (Ty->isSized())\n size = DL->getTypeAllocSize(Ty);\n\n MemoryObj *&mo = node->getMemoryObj();\n mo = new MemoryObj(node, size);\n node->addPointsTo(mo);\n }\n\n return node;\n}\n\nstatic LLVMNode *getConstantExprNode(const llvm::ConstantExpr *CE,\n LLVMDependenceGraph *dg,\n const llvm::DataLayout *DL)\n{\n \/\/ we have these nodes stored\n if (isa<IntToPtrInst>(CE))\n return getConstantIntToPtrNode(CE, DL);\n\n\n \/\/ FIXME add these nodes somewhere,\n \/\/ so that we can delete them later\n LLVMNode *node = new LLVMNode(CE);\n\n \/\/ set points-to sets\n Pointer ptr = getConstantExprPointer(CE, dg, DL);\n node->addPointsTo(ptr);\n\n return node;\n}\n\nstatic LLVMNode *getUnknownNode(LLVMDependenceGraph *dg, const llvm::Value *val,\n const llvm::DataLayout *DL)\n{\n LLVMNode *node = nullptr;\n\n using namespace llvm;\n if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(val)) {\n node = getConstantExprNode(CE, dg, DL);\n } else if (isa<Function>(val)) {\n \/\/ if the function was created via function pointer during\n \/\/ points-to analysis, the operand may not be not be set.\n \/\/ What is worse, the function may not be created either,\n \/\/ so the node just may not exists at all, so we need to\n \/\/ create it\n node = getOrCreateNode(dg, val);\n } else if (isa<ConstantPointerNull>(val)) {\n \/\/ what to do with nullptr?\n node = createNodeWithMemAlloc(val);\n } else {\n errs() << \"ERR: Unsupported operand: \" << *val << \"\\n\";\n abort();\n }\n\n assert(node && \"Did not get a node\");\n return node;\n}\n\n\/*\n * we have DependenceGraph::getNode() which retrives existing node.\n * The operand nodes may not exists, though.\n * This function gets the existing node, or creates new one and sets\n * it as an operand.\n *\/\nLLVMNode *getOperand(LLVMNode *node, const llvm::Value *val,\n unsigned int idx, const llvm::DataLayout *DL)\n{\n \/\/ ok, before calling this we call llvm::Value::getOperand() to get val\n \/\/ and in node->getOperand() we call it too. It is small overhead, but just\n \/\/ to know where to optimize when going to extrems\n\n LLVMNode *op = node->getOperand(idx);\n if (op)\n return op;\n\n LLVMDependenceGraph *dg = node->getDG();\n\n \/\/ set new operand\n op = getUnknownNode(dg, val, DL);\n assert(op && \"Did not get op\");\n\n node->setOperand(op, idx);\n return op;\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace dg\n\n\n<commit_msg>analyses: handle recursive constant expressions<commit_after>#include <map>\n\n#include <llvm\/IR\/Value.h>\n#include <llvm\/IR\/Module.h>\n#include <llvm\/IR\/Constants.h>\n#include <llvm\/IR\/DataLayout.h>\n#include <llvm\/Support\/raw_ostream.h>\n\n#include \"AnalysisGeneric.h\"\n#include \"LLVMDependenceGraph.h\"\n#include \"PointsTo.h\"\n\nusing namespace llvm;\n\nnamespace dg {\nnamespace analysis {\n\n\/\/ we assume that if the program uses inttoptr, it access this\n\/\/ memory only this way - so every access to this memory is done\n\/\/ via some inttoptr. Here we store the inttoptr objects\nstatic std::map<uint64_t, LLVMNode *> intToPtrMap;\n\n\/\/ pointer points to unknown memory location\nMemoryObj UnknownMemoryObject(nullptr);\n\/\/ unknown pointer value\nPointer UnknownMemoryLocation(&UnknownMemoryObject, 0);\n\nbool Pointer::isUnknown() const\n{\n return this == &UnknownMemoryLocation;\n}\n\nbool Pointer::pointsToUnknown() const\n{\n assert(obj && \"Pointer has not any memory object set\");\n return obj->isUnknown();\n}\n\nbool Pointer::isKnown() const\n{\n return !isUnknown() && !pointsToUnknown();\n}\n\nbool MemoryObj::isUnknown() const\n{\n return this == &UnknownMemoryObject;\n}\n\nstatic LLVMNode *createNodeWithMemAlloc(const Value *val)\n{\n LLVMNode *n = new LLVMNode(val);\n MemoryObj *&mo = n->getMemoryObj();\n mo = new MemoryObj(n);\n n->addPointsTo(Pointer(mo));\n\n return n;\n}\n\nstatic LLVMNode *getOrCreateNode(LLVMDependenceGraph *dg, const Value *val)\n{\n LLVMNode *n = dg->getNode(val);\n if (n)\n return n;\n\n if (llvm::isa<llvm::Function>(val)) {\n n = createNodeWithMemAlloc(val);\n } else\n errs() << \"ERR: unhandled not to create \" << *val << \"\\n\";\n\n return n;\n}\n\nstatic Pointer handleConstantBitCast(LLVMDependenceGraph *dg, const BitCastInst *BC)\n{\n if (!BC->isLosslessCast()) {\n errs() << \"WARN: Not a loss less cast unhandled ConstExpr\"\n << *BC << \"\\n\";\n return UnknownMemoryLocation;\n }\n\n const Value *llvmOp = BC->stripPointerCasts();\n LLVMNode *op = getOrCreateNode(dg, llvmOp);\n if (!op) {\n errs() << \"ERR: unsupported BitCast constant operand\" << *BC << \"\\n\";\n } else {\n PointsToSetT& ptset = op->getPointsTo();\n if (ptset.size() != 1) {\n errs() << \"ERR: constant BitCast with not only one pointer \"\n << *BC << \"\\n\";\n } else\n return *ptset.begin();\n }\n\n return UnknownMemoryLocation;\n}\n\nstatic inline unsigned getPointerBitwidth(const DataLayout *DL, const Value *ptr)\n{\n const Type *Ty = ptr->getType();\n return DL->getPointerSizeInBits(Ty->getPointerAddressSpace());\n}\n\nstatic LLVMNode *getConstantExprNode(const llvm::ConstantExpr *CE,\n LLVMDependenceGraph *dg,\n const llvm::DataLayout *DL);\n\nstatic Pointer handleConstantGep(LLVMDependenceGraph *dg,\n const GetElementPtrInst *GEP,\n const llvm::DataLayout *DL)\n{\n const Value *op = GEP->getPointerOperand();\n\n LLVMNode *opNode = dg->getNode(op);\n\n \/\/ FIXME this is sound, but may be unprecise\n \/\/ - we should use getOperand for getting opNode,\n \/\/ becaues we can have ConstantExpr inserted in ConstantExpr\n \/\/ (getelementptr (inttoptr ..) ...), so we can get null here\n \/\/ as opNode\n if (!opNode) {\n \/\/ is this recursively created expression?\n if (isa<ConstantExpr>(op)) {\n opNode = getConstantExprNode(cast<ConstantExpr>(op), dg, DL);\n }\n\n if (!opNode) {\n errs() << \"No node for Constant GEP operand: \" << *GEP << \"\\n\";\n return UnknownMemoryLocation;\n }\n }\n\n PointsToSetT& S = opNode->getPointsTo();\n \/\/ since this is constant expr, there's no way how we could\n \/\/ get extra points-to binding in runtime\n assert(S.size() == 1);\n MemoryObj *mo = (*S.begin()).obj;\n if (!mo) {\n errs() << \"ERR: no memory object in \" << *opNode->getKey() << \"\\n\";\n return UnknownMemoryLocation;\n }\n\n Pointer pointer(mo, UNKNOWN_OFFSET);\n unsigned bitwidth = getPointerBitwidth(DL, op);\n APInt offset(bitwidth, 0);\n\n if (GEP->accumulateConstantOffset(*DL, offset)) {\n if (offset.isIntN(bitwidth))\n pointer.offset = offset.getZExtValue();\n else\n errs() << \"WARN: Offset greater than \"\n << bitwidth << \"-bit\" << *GEP << \"\\n\";\n }\n \/\/ else offset is set to UNKNOWN (in constructor)\n\n return pointer;\n}\n\nPointer getConstantExprPointer(const ConstantExpr *CE,\n LLVMDependenceGraph *dg,\n const llvm::DataLayout *DL)\n{\n Pointer pointer = UnknownMemoryLocation;\n\n const Instruction *Inst = const_cast<ConstantExpr*>(CE)->getAsInstruction();\n if (const GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Inst)) {\n pointer = handleConstantGep(dg, GEP, DL);\n } else if (const BitCastInst *BC = dyn_cast<BitCastInst>(Inst)) {\n pointer = handleConstantBitCast(dg, BC);\n } else {\n errs() << \"ERR: Unsupported ConstantExpr \" << *CE << \"\\n\";\n errs() << \" ^^ returning unknown pointer\\n\";\n }\n\n delete Inst;\n return pointer;\n}\n\nstatic LLVMNode *getConstantIntToPtrNode(const ConstantExpr *CE,\n const llvm::DataLayout *DL)\n{\n using namespace llvm;\n\n const Value *val = CE->getOperand(0);\n if (!isa<ConstantInt>(val)) {\n errs() << \"Unhandled constant inttoptr \" << *CE << \"\\n\";\n abort();\n }\n\n const ConstantInt *C = cast<ConstantInt>(val);\n uint64_t value = C->getLimitedValue();\n\n LLVMNode *&node = intToPtrMap[value];\n if (!node) {\n node = new LLVMNode(C);\n const Value *dest = CE->getOperand(1);\n Type *Ty = dest->getType()->getContainedType(0);\n uint64_t size = 0;\n if (Ty->isSized())\n size = DL->getTypeAllocSize(Ty);\n\n MemoryObj *&mo = node->getMemoryObj();\n mo = new MemoryObj(node, size);\n node->addPointsTo(mo);\n }\n\n return node;\n}\n\nstatic LLVMNode *getConstantExprNode(const llvm::ConstantExpr *CE,\n LLVMDependenceGraph *dg,\n const llvm::DataLayout *DL)\n{\n \/\/ we have these nodes stored\n if (isa<IntToPtrInst>(CE))\n return getConstantIntToPtrNode(CE, DL);\n\n\n \/\/ FIXME add these nodes somewhere,\n \/\/ so that we can delete them later\n LLVMNode *node = new LLVMNode(CE);\n\n \/\/ set points-to sets\n Pointer ptr = getConstantExprPointer(CE, dg, DL);\n node->addPointsTo(ptr);\n\n return node;\n}\n\nstatic LLVMNode *getUnknownNode(LLVMDependenceGraph *dg, const llvm::Value *val,\n const llvm::DataLayout *DL)\n{\n LLVMNode *node = nullptr;\n\n using namespace llvm;\n if (const ConstantExpr *CE = dyn_cast<ConstantExpr>(val)) {\n node = getConstantExprNode(CE, dg, DL);\n } else if (isa<Function>(val)) {\n \/\/ if the function was created via function pointer during\n \/\/ points-to analysis, the operand may not be not be set.\n \/\/ What is worse, the function may not be created either,\n \/\/ so the node just may not exists at all, so we need to\n \/\/ create it\n node = getOrCreateNode(dg, val);\n } else if (isa<ConstantPointerNull>(val)) {\n \/\/ what to do with nullptr?\n node = createNodeWithMemAlloc(val);\n } else {\n errs() << \"ERR: Unsupported operand: \" << *val << \"\\n\";\n abort();\n }\n\n assert(node && \"Did not get a node\");\n return node;\n}\n\n\/*\n * we have DependenceGraph::getNode() which retrives existing node.\n * The operand nodes may not exists, though.\n * This function gets the existing node, or creates new one and sets\n * it as an operand.\n *\/\nLLVMNode *getOperand(LLVMNode *node, const llvm::Value *val,\n unsigned int idx, const llvm::DataLayout *DL)\n{\n \/\/ ok, before calling this we call llvm::Value::getOperand() to get val\n \/\/ and in node->getOperand() we call it too. It is small overhead, but just\n \/\/ to know where to optimize when going to extrems\n\n LLVMNode *op = node->getOperand(idx);\n if (op)\n return op;\n\n LLVMDependenceGraph *dg = node->getDG();\n\n \/\/ set new operand\n op = getUnknownNode(dg, val, DL);\n assert(op && \"Did not get op\");\n\n node->setOperand(op, idx);\n return op;\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace dg\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"clientmodel.h\"\n#include \"guiconstants.h\"\n#include \"optionsmodel.h\"\n#include \"addresstablemodel.h\"\n#include \"transactiontablemodel.h\"\n\n#include \"alert.h\"\n#include \"main.h\"\n#include \"ui_interface.h\"\n\n#include <QDateTime>\n#include <QTimer>\n\nstatic const int64 nClientStartupTime = GetTime();\n\nClientModel::ClientModel(OptionsModel *optionsModel, QObject *parent) :\n QObject(parent), optionsModel(optionsModel),\n cachedNumBlocks(0), cachedNumBlocksOfPeers(0), pollTimer(0)\n{\n numBlocksAtStartup = -1;\n\n pollTimer = new QTimer(this);\n pollTimer->setInterval(MODEL_UPDATE_DELAY);\n pollTimer->start();\n connect(pollTimer, SIGNAL(timeout()), this, SLOT(updateTimer()));\n\n subscribeToCoreSignals();\n}\n\nClientModel::~ClientModel()\n{\n unsubscribeFromCoreSignals();\n}\n\nint ClientModel::getNumConnections() const\n{\n return vNodes.size();\n}\n\nint ClientModel::getNumBlocks() const\n{\n return nBestHeight;\n}\n\nint ClientModel::getNumBlocksAtStartup()\n{\n if (numBlocksAtStartup == -1) numBlocksAtStartup = getNumBlocks();\n return numBlocksAtStartup;\n}\n\nQDateTime ClientModel::getLastBlockDate() const\n{\n return QDateTime::fromTime_t(pindexBest->GetBlockTime());\n}\n\nvoid ClientModel::updateTimer()\n{\n \/\/ Some quantities (such as number of blocks) change so fast that we don't want to be notified for each change.\n \/\/ Periodically check and update with a timer.\n int newNumBlocks = getNumBlocks();\n int newNumBlocksOfPeers = getNumBlocksOfPeers();\n\n if(cachedNumBlocks != newNumBlocks || cachedNumBlocksOfPeers != newNumBlocksOfPeers)\n {\n cachedNumBlocks = newNumBlocks;\n cachedNumBlocksOfPeers = newNumBlocksOfPeers;\n\n emit numBlocksChanged(newNumBlocks, newNumBlocksOfPeers);\n }\n}\n\nvoid ClientModel::updateNumConnections(int numConnections)\n{\n emit numConnectionsChanged(numConnections);\n}\n\nvoid ClientModel::updateAlert(const QString &hash, int status)\n{\n \/\/ Show error message notification for new alert\n if(status == CT_NEW)\n {\n uint256 hash_256;\n hash_256.SetHex(hash.toStdString());\n CAlert alert = CAlert::getAlertByHash(hash_256);\n if(!alert.IsNull())\n {\n emit error(tr(\"Network Alert\"), QString::fromStdString(alert.strStatusBar), false);\n }\n }\n\n \/\/ Emit a numBlocksChanged when the status message changes,\n \/\/ so that the view recomputes and updates the status bar.\n emit numBlocksChanged(getNumBlocks(), getNumBlocksOfPeers());\n}\n\nbool ClientModel::isTestNet() const\n{\n return fTestNet;\n}\n\nbool ClientModel::inInitialBlockDownload() const\n{\n return IsInitialBlockDownload();\n}\n\nint ClientModel::getNumBlocksOfPeers() const\n{\n return GetNumBlocksOfPeers();\n}\n\nQString ClientModel::getStatusBarWarnings() const\n{\n return QString::fromStdString(GetWarnings(\"statusbar\"));\n}\n\nOptionsModel *ClientModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nQString ClientModel::formatFullVersion() const\n{\n return QString::fromStdString(FormatFullVersion());\n}\n\nQString ClientModel::formatBuildDate() const\n{\n return QString::fromStdString(CLIENT_DATE);\n}\n\nQString ClientModel::clientName() const\n{\n return QString::fromStdString(CLIENT_NAME);\n}\n\nQString ClientModel::formatClientStartupTime() const\n{\n return QDateTime::fromTime_t(nClientStartupTime).toString();\n}\n\n\/\/ Handlers for core signals\nstatic void NotifyBlocksChanged(ClientModel *clientmodel)\n{\n \/\/ This notification is too frequent. Don't trigger a signal.\n \/\/ Don't remove it, though, as it might be useful later.\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel *clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: OutputDebugStringF(\"NotifyNumConnectionsChanged %i\\n\", newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection,\n Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyAlertChanged(ClientModel *clientmodel, const uint256 &hash, ChangeType status)\n{\n OutputDebugStringF(\"NotifyAlertChanged %s status=%i\\n\", hash.GetHex().c_str(), status);\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(hash.GetHex())),\n Q_ARG(int, status));\n}\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.NotifyBlocksChanged.connect(boost::bind(NotifyBlocksChanged, this));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this, _1, _2));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.NotifyBlocksChanged.disconnect(boost::bind(NotifyBlocksChanged, this));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this, _1, _2));\n}\n<commit_msg>BUGFIX: prevent Qt client crash at startup with an empty directory<commit_after>#include \"clientmodel.h\"\n#include \"guiconstants.h\"\n#include \"optionsmodel.h\"\n#include \"addresstablemodel.h\"\n#include \"transactiontablemodel.h\"\n\n#include \"alert.h\"\n#include \"main.h\"\n#include \"ui_interface.h\"\n\n#include <QDateTime>\n#include <QTimer>\n\nstatic const int64 nClientStartupTime = GetTime();\n\nClientModel::ClientModel(OptionsModel *optionsModel, QObject *parent) :\n QObject(parent), optionsModel(optionsModel),\n cachedNumBlocks(0), cachedNumBlocksOfPeers(0), pollTimer(0)\n{\n numBlocksAtStartup = -1;\n\n pollTimer = new QTimer(this);\n pollTimer->setInterval(MODEL_UPDATE_DELAY);\n pollTimer->start();\n connect(pollTimer, SIGNAL(timeout()), this, SLOT(updateTimer()));\n\n subscribeToCoreSignals();\n}\n\nClientModel::~ClientModel()\n{\n unsubscribeFromCoreSignals();\n}\n\nint ClientModel::getNumConnections() const\n{\n return vNodes.size();\n}\n\nint ClientModel::getNumBlocks() const\n{\n return nBestHeight;\n}\n\nint ClientModel::getNumBlocksAtStartup()\n{\n if (numBlocksAtStartup == -1) numBlocksAtStartup = getNumBlocks();\n return numBlocksAtStartup;\n}\n\nQDateTime ClientModel::getLastBlockDate() const\n{\n if (pindexBest)\n return QDateTime::fromTime_t(pindexBest->GetBlockTime());\n else\n return QDateTime::fromTime_t(1360105017); \/\/ Genesis block's time\n}\n\nvoid ClientModel::updateTimer()\n{\n \/\/ Some quantities (such as number of blocks) change so fast that we don't want to be notified for each change.\n \/\/ Periodically check and update with a timer.\n int newNumBlocks = getNumBlocks();\n int newNumBlocksOfPeers = getNumBlocksOfPeers();\n\n if(cachedNumBlocks != newNumBlocks || cachedNumBlocksOfPeers != newNumBlocksOfPeers)\n {\n cachedNumBlocks = newNumBlocks;\n cachedNumBlocksOfPeers = newNumBlocksOfPeers;\n\n emit numBlocksChanged(newNumBlocks, newNumBlocksOfPeers);\n }\n}\n\nvoid ClientModel::updateNumConnections(int numConnections)\n{\n emit numConnectionsChanged(numConnections);\n}\n\nvoid ClientModel::updateAlert(const QString &hash, int status)\n{\n \/\/ Show error message notification for new alert\n if(status == CT_NEW)\n {\n uint256 hash_256;\n hash_256.SetHex(hash.toStdString());\n CAlert alert = CAlert::getAlertByHash(hash_256);\n if(!alert.IsNull())\n {\n emit error(tr(\"Network Alert\"), QString::fromStdString(alert.strStatusBar), false);\n }\n }\n\n \/\/ Emit a numBlocksChanged when the status message changes,\n \/\/ so that the view recomputes and updates the status bar.\n emit numBlocksChanged(getNumBlocks(), getNumBlocksOfPeers());\n}\n\nbool ClientModel::isTestNet() const\n{\n return fTestNet;\n}\n\nbool ClientModel::inInitialBlockDownload() const\n{\n return IsInitialBlockDownload();\n}\n\nint ClientModel::getNumBlocksOfPeers() const\n{\n return GetNumBlocksOfPeers();\n}\n\nQString ClientModel::getStatusBarWarnings() const\n{\n return QString::fromStdString(GetWarnings(\"statusbar\"));\n}\n\nOptionsModel *ClientModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nQString ClientModel::formatFullVersion() const\n{\n return QString::fromStdString(FormatFullVersion());\n}\n\nQString ClientModel::formatBuildDate() const\n{\n return QString::fromStdString(CLIENT_DATE);\n}\n\nQString ClientModel::clientName() const\n{\n return QString::fromStdString(CLIENT_NAME);\n}\n\nQString ClientModel::formatClientStartupTime() const\n{\n return QDateTime::fromTime_t(nClientStartupTime).toString();\n}\n\n\/\/ Handlers for core signals\nstatic void NotifyBlocksChanged(ClientModel *clientmodel)\n{\n \/\/ This notification is too frequent. Don't trigger a signal.\n \/\/ Don't remove it, though, as it might be useful later.\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel *clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: OutputDebugStringF(\"NotifyNumConnectionsChanged %i\\n\", newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection,\n Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyAlertChanged(ClientModel *clientmodel, const uint256 &hash, ChangeType status)\n{\n OutputDebugStringF(\"NotifyAlertChanged %s status=%i\\n\", hash.GetHex().c_str(), status);\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(hash.GetHex())),\n Q_ARG(int, status));\n}\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.NotifyBlocksChanged.connect(boost::bind(NotifyBlocksChanged, this));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this, _1, _2));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.NotifyBlocksChanged.disconnect(boost::bind(NotifyBlocksChanged, this));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this, _1, _2));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* This program is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program; if not, write to the Free Software\n* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\n* Copyright (C) Wallix 2010-2015\n* Author(s): Jonathan Poelen\n*\/\n\n#ifndef PPOCR_SRC_LOADER2_DATAS_LOADER_HPP\n#define PPOCR_SRC_LOADER2_DATAS_LOADER_HPP\n\n#include <array>\n#include <vector>\n#include <type_traits>\n\n#include \"image\/image.hpp\"\n\nnamespace ppocr {\n\nclass Image;\n\nnamespace loader2 {\n\nusing std::size_t;\n\nenum class PolicyLoader { img, img90 };\n\ntemplate<class Strategy_, PolicyLoader Policy>\nstruct Strategy\n{\n using strategy_type = Strategy_;\n constexpr static PolicyLoader policy = Policy;\n};\n\nnamespace details_ {\n template<class T, class...>\n struct first_type\n { using type = T; };\n\n\n struct Lt { template <class T> bool operator()(T const & a, T const & b) const { return a < b; } };\n struct Eq { template <class T> bool operator()(T const & a, T const & b) const { return a == b; } };\n struct Noop { template <class T> bool operator()(T const & , T const & ) const { return false; } };\n\n template<class Cmp, class Cmp2, class Data>\n bool cmp_datas(size_t i1, size_t i2, Cmp cmp, Cmp2, Data const & data) {\n return cmp(data[i1], data[i2]);\n }\n\n template<class Cmp, class Cmp2, class Data, class... Datas>\n bool cmp_datas(size_t i1, size_t i2, Cmp cmp, Cmp2 cmp2, Data const & data, Datas const & ... others) {\n if (cmp(data[i1], data[i2]) || cmp2(data[i1], data[i2])) {\n return cmp_datas(i1, i2, cmp, cmp2, others...);\n }\n return false;\n }\n}\n\ntemplate<class Strategy_>\ntypename Strategy_::value_type\nload(Strategy_ const & strategy, PolicyLoader policy, Image const & img, Image const & img90)\n{ return policy == PolicyLoader::img ? strategy.load(img, img90) : strategy.load(img90, img); }\n\ntemplate<class Strategy>\nstruct Data\n{\n using strategy_type = typename Strategy::strategy_type;\n using value_type = typename strategy_type::value_type;\n using relationship_type = typename strategy_type::relationship_type;\n\n using container_type = std::vector<value_type>;\n using iterator = typename container_type::const_iterator;\n using const_iterator = iterator;\n\n Data() = default;\n\n explicit Data(container_type && cont) noexcept\n : data_(std::move(cont))\n {}\n\n explicit Data(container_type const & cont)\n : data_(cont)\n {}\n\n container_type release() noexcept {\n return std::move(this->data_.values);\n }\n\n void load(Image const & img, Image const & img90) {\n this->data_.values.push_back(::ppocr::loader2::load(\n static_cast<strategy_type const &>(this->data_),\n Strategy::policy, img, img90)\n );\n }\n\n value_type const & operator[](size_t i) const {\n return data_.values[i];\n }\n\n typename relationship_type::result_type\n relationship(value_type const & a, value_type const & b) const {\n return static_cast<relationship_type const &>(data_)(a, b);\n }\n\n std::size_t count_posibilities() const {\n return static_cast<relationship_type const &>(data_).count();\n }\n\n std::size_t size() const noexcept {\n return this->data_.values.size();\n }\n\n container_type const & data() const noexcept {\n return this->data_.values;\n }\n\n iterator begin() const { return this->data().begin(); }\n iterator end() const { return this->data().end(); }\n\nprivate:\n struct impl : strategy_type, relationship_type \/*empty class optimization*\/ {\n container_type values;\n\n template<class... Args>\n impl(Args && ... args)\n : relationship_type(static_cast<strategy_type const &>(*this).relationship())\n , values(std::forward<Args>(args)...)\n {}\n } data_;\n};\n\ntemplate<class... Strategies>\nstruct Datas : private Data<Strategies>...\n{\n Datas() = default;\n\n explicit Datas(Data<Strategies> && ... datas)\n : Data<Strategies>(std::move(datas))...\n {}\n\n template<class Strategy>\n Data<Strategy> const & get() const noexcept {\n return static_cast<Data<Strategy> const &>(*this);\n }\n\n template<class Strategy>\n Data<Strategy> & get() noexcept {\n return static_cast<Data<Strategy> &>(*this);\n }\n\n std::size_t size() const noexcept {\n return this->get<typename details_::first_type<Strategies...>::type>().size();\n }\n\n std::size_t release() const noexcept {\n return this->get<typename details_::first_type<Strategies...>::type>().size();\n }\n\n void load(Image const & img) {\n auto img90 = img.rotate90();\n (void(std::initializer_list<char>{\n (static_cast<Data<Strategies>&>(*this).load(img, img90), char())...\n }));\n }\n\n bool lt(size_t i1, size_t i2) const {\n return details_::cmp_datas(i1, i2, details_::Lt(), details_::Eq(), get<Strategies>()...);\n }\n\n bool eq(size_t i1, size_t i2) const {\n return details_::cmp_datas(i1, i2, details_::Eq(), details_::Noop(), get<Strategies>()...);\n }\n};\n\ntemplate<class Fn, class... Strategies>\nvoid apply_from_datas(Datas<Strategies...> const & datas, Fn fn) {\n (void(std::initializer_list<char>{(void(fn(datas.template get<Strategies>())), char())...}));\n}\n\ntemplate<class Fn, class... Strategies>\nvoid apply_from_datas(Datas<Strategies...> & datas, Fn fn) {\n (void(std::initializer_list<char>{(void(fn(datas.template get<Strategies>())), char())...}));\n}\n\n} }\n\n#endif\n<commit_msg>loader2::Data<Strategy>::dist()<commit_after>\/*\n* This program is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This program is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program; if not, write to the Free Software\n* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\n* Copyright (C) Wallix 2010-2015\n* Author(s): Jonathan Poelen\n*\/\n\n#ifndef PPOCR_SRC_LOADER2_DATAS_LOADER_HPP\n#define PPOCR_SRC_LOADER2_DATAS_LOADER_HPP\n\n#include <array>\n#include <vector>\n#include <type_traits>\n\n#include \"image\/image.hpp\"\n#include \"sassert.hpp\"\n\nnamespace ppocr {\n\nclass Image;\n\nnamespace loader2 {\n\nusing std::size_t;\n\nenum class PolicyLoader { img, img90 };\n\ntemplate<class Strategy_, PolicyLoader Policy>\nstruct Strategy\n{\n using strategy_type = Strategy_;\n constexpr static PolicyLoader policy = Policy;\n};\n\nnamespace details_ {\n template<class T, class...>\n struct first_type\n { using type = T; };\n\n\n struct Lt { template <class T> bool operator()(T const & a, T const & b) const { return a < b; } };\n struct Eq { template <class T> bool operator()(T const & a, T const & b) const { return a == b; } };\n struct Noop { template <class T> bool operator()(T const & , T const & ) const { return false; } };\n\n template<class Cmp, class Cmp2, class Data>\n bool cmp_datas(size_t i1, size_t i2, Cmp cmp, Cmp2, Data const & data) {\n return cmp(data[i1], data[i2]);\n }\n\n template<class Cmp, class Cmp2, class Data, class... Datas>\n bool cmp_datas(size_t i1, size_t i2, Cmp cmp, Cmp2 cmp2, Data const & data, Datas const & ... others) {\n if (cmp(data[i1], data[i2]) || cmp2(data[i1], data[i2])) {\n return cmp_datas(i1, i2, cmp, cmp2, others...);\n }\n return false;\n }\n}\n\ntemplate<class Strategy_>\ntypename Strategy_::value_type\nload(Strategy_ const & strategy, PolicyLoader policy, Image const & img, Image const & img90)\n{ return policy == PolicyLoader::img ? strategy.load(img, img90) : strategy.load(img90, img); }\n\ntemplate<class Strategy>\nstruct Data\n{\n using strategy_type = typename Strategy::strategy_type;\n using value_type = typename strategy_type::value_type;\n using relationship_type = typename strategy_type::relationship_type;\n\n using container_type = std::vector<value_type>;\n using iterator = typename container_type::const_iterator;\n using const_iterator = iterator;\n\n Data() = default;\n\n explicit Data(container_type && cont) noexcept\n : data_(std::move(cont))\n {}\n\n explicit Data(container_type const & cont)\n : data_(cont)\n {}\n\n container_type release() noexcept {\n return std::move(this->data_.values);\n }\n\n void load(Image const & img, Image const & img90) {\n this->data_.values.push_back(::ppocr::loader2::load(\n static_cast<strategy_type const &>(this->data_),\n Strategy::policy, img, img90)\n );\n }\n\n value_type const & operator[](size_t i) const {\n return data_.values[i];\n }\n\n typename relationship_type::result_type\n relationship(value_type const & a, value_type const & b) const {\n return static_cast<relationship_type const &>(data_)(a, b);\n }\n\n double dist(value_type const & a, value_type const & b) const {\n double const ret = static_cast<relationship_type const &>(data_).dist(a, b);\n assert(0. <= ret && ret <= 1.);\n return ret;\n }\n\n std::size_t count_posibilities() const {\n return static_cast<relationship_type const &>(data_).count();\n }\n\n std::size_t size() const noexcept {\n return this->data_.values.size();\n }\n\n container_type const & data() const noexcept {\n return this->data_.values;\n }\n\n iterator begin() const { return this->data().begin(); }\n iterator end() const { return this->data().end(); }\n\nprivate:\n struct impl : strategy_type, relationship_type \/*empty class optimization*\/ {\n container_type values;\n\n template<class... Args>\n impl(Args && ... args)\n : relationship_type(static_cast<strategy_type const &>(*this).relationship())\n , values(std::forward<Args>(args)...)\n {}\n } data_;\n};\n\ntemplate<class... Strategies>\nstruct Datas : private Data<Strategies>...\n{\n Datas() = default;\n\n explicit Datas(Data<Strategies> && ... datas)\n : Data<Strategies>(std::move(datas))...\n {}\n\n template<class Strategy>\n Data<Strategy> const & get() const noexcept {\n return static_cast<Data<Strategy> const &>(*this);\n }\n\n template<class Strategy>\n Data<Strategy> & get() noexcept {\n return static_cast<Data<Strategy> &>(*this);\n }\n\n std::size_t size() const noexcept {\n return this->get<typename details_::first_type<Strategies...>::type>().size();\n }\n\n std::size_t release() const noexcept {\n return this->get<typename details_::first_type<Strategies...>::type>().size();\n }\n\n void load(Image const & img) {\n auto img90 = img.rotate90();\n (void(std::initializer_list<char>{\n (static_cast<Data<Strategies>&>(*this).load(img, img90), char())...\n }));\n }\n\n bool lt(size_t i1, size_t i2) const {\n return details_::cmp_datas(i1, i2, details_::Lt(), details_::Eq(), get<Strategies>()...);\n }\n\n bool eq(size_t i1, size_t i2) const {\n return details_::cmp_datas(i1, i2, details_::Eq(), details_::Noop(), get<Strategies>()...);\n }\n};\n\ntemplate<class Fn, class... Strategies>\nvoid apply_from_datas(Datas<Strategies...> const & datas, Fn fn) {\n (void(std::initializer_list<char>{(void(fn(datas.template get<Strategies>())), char())...}));\n}\n\ntemplate<class Fn, class... Strategies>\nvoid apply_from_datas(Datas<Strategies...> & datas, Fn fn) {\n (void(std::initializer_list<char>{(void(fn(datas.template get<Strategies>())), char())...}));\n}\n\n} }\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file license.txt or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n#include <boost\/tokenizer.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include \"headers.h\"\n\nusing namespace boost::interprocess;\nusing namespace boost::posix_time;\nusing namespace boost;\nusing namespace std;\n\nvoid ipcShutdown()\n{\n message_queue::remove(\"BitcoinURL\");\n}\n\nvoid ipcThread(void* parg)\n{\n message_queue* mq = (message_queue*)parg;\n char strBuf[257];\n size_t nSize;\n unsigned int nPriority;\n loop\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(100);\n if(mq->timed_receive(&strBuf, sizeof(strBuf), nSize, nPriority, d))\n {\n ThreadSafeHandleURL(std::string(strBuf, nSize));\n Sleep(1000);\n }\n if (fShutdown)\n {\n ipcShutdown();\n break;\n }\n }\n ipcShutdown();\n}\n\nvoid ipcInit()\n{\n message_queue* mq;\n char strBuf[257];\n size_t nSize;\n unsigned int nPriority;\n try {\n mq = new message_queue(open_or_create, \"BitcoinURL\", 2, 256);\n\n \/\/ Make sure we don't lose any bitcoin: URIs\n for (int i = 0; i < 2; i++)\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(1);\n if(mq->timed_receive(&strBuf, sizeof(strBuf), nSize, nPriority, d))\n {\n ThreadSafeHandleURL(std::string(strBuf, nSize));\n }\n else\n break;\n }\n\n \/\/ Make sure only one bitcoin instance is listening\n message_queue::remove(\"BitcoinURL\");\n mq = new message_queue(open_or_create, \"BitcoinURL\", 2, 256);\n }\n catch (interprocess_exception &ex) {\n return;\n }\n if (!CreateThread(ipcThread, mq))\n {\n delete mq;\n }\n}\n<commit_msg>Do not start bitcoin: thread on OSX. fixes #889<commit_after>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file license.txt or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n#include <boost\/tokenizer.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n\n#include \"headers.h\"\n\nusing namespace boost::interprocess;\nusing namespace boost::posix_time;\nusing namespace boost;\nusing namespace std;\n\nvoid ipcShutdown()\n{\n message_queue::remove(\"BitcoinURL\");\n}\n\nvoid ipcThread(void* parg)\n{\n message_queue* mq = (message_queue*)parg;\n char strBuf[257];\n size_t nSize;\n unsigned int nPriority;\n loop\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(100);\n if(mq->timed_receive(&strBuf, sizeof(strBuf), nSize, nPriority, d))\n {\n ThreadSafeHandleURL(std::string(strBuf, nSize));\n Sleep(1000);\n }\n if (fShutdown)\n {\n ipcShutdown();\n break;\n }\n }\n ipcShutdown();\n}\n\nvoid ipcInit()\n{\n#ifdef MAC_OSX\n \/\/ TODO: implement bitcoin: URI handling the Mac Way\n return;\n#endif\n\n message_queue* mq;\n char strBuf[257];\n size_t nSize;\n unsigned int nPriority;\n try {\n mq = new message_queue(open_or_create, \"BitcoinURL\", 2, 256);\n\n \/\/ Make sure we don't lose any bitcoin: URIs\n for (int i = 0; i < 2; i++)\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(1);\n if(mq->timed_receive(&strBuf, sizeof(strBuf), nSize, nPriority, d))\n {\n ThreadSafeHandleURL(std::string(strBuf, nSize));\n }\n else\n break;\n }\n\n \/\/ Make sure only one bitcoin instance is listening\n message_queue::remove(\"BitcoinURL\");\n mq = new message_queue(open_or_create, \"BitcoinURL\", 2, 256);\n }\n catch (interprocess_exception &ex) {\n return;\n }\n if (!CreateThread(ipcThread, mq))\n {\n delete mq;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <gtest\/gtest.h>\n#include <openssl\/err.h>\n#include <openssl\/evp.h>\n#include <string>\n\n#include \"log\/cert.h\"\n#include \"log\/cert_checker.h\"\n#include \"log\/ct_extensions.h\"\n#include \"util\/testing.h\"\n#include \"util\/util.h\"\n\nnamespace ct {\nusing std::string;\n\nDEFINE_string(test_certs_dir, \"..\/test\/testdata\", \"Path to test certificates\");\n\n\/\/ Valid certificates.\n\/\/ Self-signed\nstatic const char kCaCert[] = \"ca-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kLeafCert[] = \"test-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kCaPreCert[] = \"ca-pre-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kPreCert[] = \"test-embedded-pre-cert.pem\";\n\/\/ Issued by ca-pre-cert.pem\nstatic const char kPreWithPreCaCert[] = \"test-embedded-with-preca-pre-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kIntermediateCert[] = \"intermediate-cert.pem\";\n\/\/ Issued by intermediate-cert.pem\nstatic const char kChainLeafCert[] = \"test-intermediate-cert.pem\";\n\/\/ CA with no basic constraints.\nstatic const char kCaNoBCCert[] = \"test-no-bc-ca-cert.pem\";\n\/\/ Chain terminating in that CA.\nstatic const char kNoBCChain[] = \"test-no-bc-cert-chain.pem\";\n\/\/ Chain where a leaf cert issues another cert\nstatic const char kBadNoBCChain[] = \"test-no-ca-cert-chain.pem\";\n\n\nnamespace {\n\nclass CertCheckerTest : public ::testing::Test {\n protected:\n string leaf_pem_;\n string ca_precert_pem_;\n string precert_pem_;\n string precert_with_preca_pem_;\n string intermediate_pem_;\n string chain_leaf_pem_;\n string ca_pem_;\n CertChecker checker_;\n string cert_dir_;\n\n void SetUp() {\n cert_dir_ = FLAGS_test_certs_dir;\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kLeafCert, &leaf_pem_))\n << \"Could not read test data from \" << cert_dir_\n << \". Wrong --test_certs_dir?\";\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kCaPreCert, &ca_precert_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kPreCert, &precert_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kPreWithPreCaCert,\n &precert_with_preca_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kIntermediateCert,\n &intermediate_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kChainLeafCert,\n &chain_leaf_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kCaCert, &ca_pem_));\n }\n};\n\nTEST_F(CertCheckerTest, Certificate) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n\n \/\/ Fail as we have no CA certs.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, CertificateWithRoot) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n\n \/\/ Fail as even though we give a CA cert, it's not in the local store.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, TrimsRepeatedRoots) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, Intermediates) {\n \/\/ Load CA certs.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n \/\/ A chain with an intermediate.\n CertChain chain(chain_leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n \/\/ Fail as it doesn't chain to a trusted CA.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n \/\/ Add the intermediate and expect success.\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(intermediate_pem_)));\n ASSERT_EQ(2U, chain.Length());\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(3U, chain.Length());\n\n \/\/ An invalid chain, with two certs in wrong order.\n CertChain invalid(intermediate_pem_ + chain_leaf_pem_);\n ASSERT_TRUE(invalid.IsLoaded());\n EXPECT_EQ(CertChecker::INVALID_CERTIFICATE_CHAIN,\n checker_.CheckCertChain(&invalid));\n}\n\nTEST_F(CertCheckerTest, PreCert) {\n const string chain_pem = precert_pem_ + ca_pem_;\n PreCertChain chain(chain_pem);\n\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain.IsWellFormed());\n\n \/\/ Fail as we have no CA certs.\n string issuer_key_hash, tbs;\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n\n \/\/ Load CA certs and expect success.\n checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert);\n EXPECT_EQ(CertChecker::OK,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n string expected_key_hash;\n ASSERT_EQ(Cert::TRUE,\n chain.CertAt(1)->SPKISha256Digest(&expected_key_hash));\n EXPECT_EQ(expected_key_hash, issuer_key_hash);\n \/\/ TODO(ekasper): proper KAT tests.\n EXPECT_FALSE(tbs.empty());\n}\n\nTEST_F(CertCheckerTest, PreCertWithPreCa) {\n const string chain_pem = precert_with_preca_pem_ + ca_precert_pem_;\n PreCertChain chain(chain_pem);\n\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain.IsWellFormed());\n\n string issuer_key_hash, tbs;\n \/\/ Fail as we have no CA certs.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n\n \/\/ Load CA certs and expect success.\n checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert);\n EXPECT_EQ(CertChecker::OK,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n string expected_key_hash;\n ASSERT_EQ(Cert::TRUE,\n chain.CertAt(2)->SPKISha256Digest(&expected_key_hash));\n EXPECT_EQ(expected_key_hash, issuer_key_hash);\n \/\/ TODO(ekasper): proper KAT tests.\n EXPECT_FALSE(tbs.empty());\n\n \/\/ A second, invalid chain, with no CA precert.\n PreCertChain chain2(precert_with_preca_pem_);\n ASSERT_TRUE(chain2.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain2.IsWellFormed());\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain2, &issuer_key_hash, &tbs));\n}\n\nTEST_F(CertCheckerTest, CertAsPreCert) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n PreCertChain chain(leaf_pem_);\n string issuer_key_hash, tbs;\n EXPECT_EQ(CertChecker::PRECERT_CHAIN_NOT_WELL_FORMED,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n}\n\nTEST_F(CertCheckerTest, PreCertAsCert) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n const string chain_pem = precert_pem_ + ca_pem_;\n PreCertChain chain(chain_pem);\n EXPECT_EQ(CertChecker::PRECERT_EXTENSION_IN_CERT_CHAIN,\n checker_.CheckCertChain(&chain));\n}\n\n\/\/ Accept if the root cert has no CA:True constraint and is in the trust store\nTEST_F(CertCheckerTest, AcceptNoBasicConstraints) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaNoBCCert));\n\n string chain_pem;\n ASSERT_TRUE(util::ReadTextFile(cert_dir_ + \"\/\" + kNoBCChain, &chain_pem));\n\n CertChain chain(chain_pem);\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n}\n\n\/\/ Don't accept if some other cert without CA:True tries to issue.\nTEST_F(CertCheckerTest, DontAcceptNoBasicConstraints) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n string chain_pem;\n ASSERT_TRUE(util::ReadTextFile(cert_dir_ + \"\/\" + kBadNoBCChain, &chain_pem));\n\n CertChain chain(chain_pem);\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(CertChecker::INVALID_CERTIFICATE_CHAIN,\n\t checker_.CheckCertChain(&chain));\n}\n\n} \/\/ namespace\n} \/\/ namespace ct\n\nint main(int argc, char**argv) {\n ct::test::InitTesting(argv[0], &argc, &argv, true);\n OpenSSL_add_all_algorithms();\n ERR_load_crypto_strings();\n ct::LoadCtExtensions();\n return RUN_ALL_TESTS();\n}\n<commit_msg>Fix tab,<commit_after>\/* -*- indent-tabs-mode: nil -*- *\/\n#include <gflags\/gflags.h>\n#include <glog\/logging.h>\n#include <gtest\/gtest.h>\n#include <openssl\/err.h>\n#include <openssl\/evp.h>\n#include <string>\n\n#include \"log\/cert.h\"\n#include \"log\/cert_checker.h\"\n#include \"log\/ct_extensions.h\"\n#include \"util\/testing.h\"\n#include \"util\/util.h\"\n\nnamespace ct {\nusing std::string;\n\nDEFINE_string(test_certs_dir, \"..\/test\/testdata\", \"Path to test certificates\");\n\n\/\/ Valid certificates.\n\/\/ Self-signed\nstatic const char kCaCert[] = \"ca-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kLeafCert[] = \"test-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kCaPreCert[] = \"ca-pre-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kPreCert[] = \"test-embedded-pre-cert.pem\";\n\/\/ Issued by ca-pre-cert.pem\nstatic const char kPreWithPreCaCert[] = \"test-embedded-with-preca-pre-cert.pem\";\n\/\/ Issued by ca-cert.pem\nstatic const char kIntermediateCert[] = \"intermediate-cert.pem\";\n\/\/ Issued by intermediate-cert.pem\nstatic const char kChainLeafCert[] = \"test-intermediate-cert.pem\";\n\/\/ CA with no basic constraints.\nstatic const char kCaNoBCCert[] = \"test-no-bc-ca-cert.pem\";\n\/\/ Chain terminating in that CA.\nstatic const char kNoBCChain[] = \"test-no-bc-cert-chain.pem\";\n\/\/ Chain where a leaf cert issues another cert\nstatic const char kBadNoBCChain[] = \"test-no-ca-cert-chain.pem\";\n\n\nnamespace {\n\nclass CertCheckerTest : public ::testing::Test {\n protected:\n string leaf_pem_;\n string ca_precert_pem_;\n string precert_pem_;\n string precert_with_preca_pem_;\n string intermediate_pem_;\n string chain_leaf_pem_;\n string ca_pem_;\n CertChecker checker_;\n string cert_dir_;\n\n void SetUp() {\n cert_dir_ = FLAGS_test_certs_dir;\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kLeafCert, &leaf_pem_))\n << \"Could not read test data from \" << cert_dir_\n << \". Wrong --test_certs_dir?\";\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kCaPreCert, &ca_precert_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kPreCert, &precert_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kPreWithPreCaCert,\n &precert_with_preca_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kIntermediateCert,\n &intermediate_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kChainLeafCert,\n &chain_leaf_pem_));\n CHECK(util::ReadTextFile(cert_dir_ + \"\/\" + kCaCert, &ca_pem_));\n }\n};\n\nTEST_F(CertCheckerTest, Certificate) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n\n \/\/ Fail as we have no CA certs.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, CertificateWithRoot) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n\n \/\/ Fail as even though we give a CA cert, it's not in the local store.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, TrimsRepeatedRoots) {\n CertChain chain(leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(ca_pem_)));\n\n \/\/ Load CA certs and expect success.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(2U, chain.Length());\n}\n\nTEST_F(CertCheckerTest, Intermediates) {\n \/\/ Load CA certs.\n EXPECT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n \/\/ A chain with an intermediate.\n CertChain chain(chain_leaf_pem_);\n ASSERT_TRUE(chain.IsLoaded());\n \/\/ Fail as it doesn't chain to a trusted CA.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckCertChain(&chain));\n \/\/ Add the intermediate and expect success.\n ASSERT_EQ(Cert::TRUE, chain.AddCert(new Cert(intermediate_pem_)));\n ASSERT_EQ(2U, chain.Length());\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n EXPECT_EQ(3U, chain.Length());\n\n \/\/ An invalid chain, with two certs in wrong order.\n CertChain invalid(intermediate_pem_ + chain_leaf_pem_);\n ASSERT_TRUE(invalid.IsLoaded());\n EXPECT_EQ(CertChecker::INVALID_CERTIFICATE_CHAIN,\n checker_.CheckCertChain(&invalid));\n}\n\nTEST_F(CertCheckerTest, PreCert) {\n const string chain_pem = precert_pem_ + ca_pem_;\n PreCertChain chain(chain_pem);\n\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain.IsWellFormed());\n\n \/\/ Fail as we have no CA certs.\n string issuer_key_hash, tbs;\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n\n \/\/ Load CA certs and expect success.\n checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert);\n EXPECT_EQ(CertChecker::OK,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n string expected_key_hash;\n ASSERT_EQ(Cert::TRUE,\n chain.CertAt(1)->SPKISha256Digest(&expected_key_hash));\n EXPECT_EQ(expected_key_hash, issuer_key_hash);\n \/\/ TODO(ekasper): proper KAT tests.\n EXPECT_FALSE(tbs.empty());\n}\n\nTEST_F(CertCheckerTest, PreCertWithPreCa) {\n const string chain_pem = precert_with_preca_pem_ + ca_precert_pem_;\n PreCertChain chain(chain_pem);\n\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain.IsWellFormed());\n\n string issuer_key_hash, tbs;\n \/\/ Fail as we have no CA certs.\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n\n \/\/ Load CA certs and expect success.\n checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert);\n EXPECT_EQ(CertChecker::OK,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n string expected_key_hash;\n ASSERT_EQ(Cert::TRUE,\n chain.CertAt(2)->SPKISha256Digest(&expected_key_hash));\n EXPECT_EQ(expected_key_hash, issuer_key_hash);\n \/\/ TODO(ekasper): proper KAT tests.\n EXPECT_FALSE(tbs.empty());\n\n \/\/ A second, invalid chain, with no CA precert.\n PreCertChain chain2(precert_with_preca_pem_);\n ASSERT_TRUE(chain2.IsLoaded());\n EXPECT_EQ(Cert::TRUE, chain2.IsWellFormed());\n EXPECT_EQ(CertChecker::ROOT_NOT_IN_LOCAL_STORE,\n checker_.CheckPreCertChain(&chain2, &issuer_key_hash, &tbs));\n}\n\nTEST_F(CertCheckerTest, CertAsPreCert) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n PreCertChain chain(leaf_pem_);\n string issuer_key_hash, tbs;\n EXPECT_EQ(CertChecker::PRECERT_CHAIN_NOT_WELL_FORMED,\n checker_.CheckPreCertChain(&chain, &issuer_key_hash, &tbs));\n}\n\nTEST_F(CertCheckerTest, PreCertAsCert) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n const string chain_pem = precert_pem_ + ca_pem_;\n PreCertChain chain(chain_pem);\n EXPECT_EQ(CertChecker::PRECERT_EXTENSION_IN_CERT_CHAIN,\n checker_.CheckCertChain(&chain));\n}\n\n\/\/ Accept if the root cert has no CA:True constraint and is in the trust store\nTEST_F(CertCheckerTest, AcceptNoBasicConstraints) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaNoBCCert));\n\n string chain_pem;\n ASSERT_TRUE(util::ReadTextFile(cert_dir_ + \"\/\" + kNoBCChain, &chain_pem));\n\n CertChain chain(chain_pem);\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(CertChecker::OK, checker_.CheckCertChain(&chain));\n}\n\n\/\/ Don't accept if some other cert without CA:True tries to issue.\nTEST_F(CertCheckerTest, DontAcceptNoBasicConstraints) {\n ASSERT_TRUE(checker_.LoadTrustedCertificates(cert_dir_ + \"\/\" + kCaCert));\n\n string chain_pem;\n ASSERT_TRUE(util::ReadTextFile(cert_dir_ + \"\/\" + kBadNoBCChain, &chain_pem));\n\n CertChain chain(chain_pem);\n ASSERT_TRUE(chain.IsLoaded());\n EXPECT_EQ(CertChecker::INVALID_CERTIFICATE_CHAIN,\n checker_.CheckCertChain(&chain));\n}\n\n} \/\/ namespace\n} \/\/ namespace ct\n\nint main(int argc, char**argv) {\n ct::test::InitTesting(argv[0], &argc, &argv, true);\n OpenSSL_add_all_algorithms();\n ERR_load_crypto_strings();\n ct::LoadCtExtensions();\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"walletmodel.h\"\n#include \"guiconstants.h\"\n#include \"optionsmodel.h\"\n#include \"addresstablemodel.h\"\n#include \"transactiontablemodel.h\"\n\n#include \"headers.h\"\n\n#include <QTimer>\n#include <QSet>\n\nWalletModel::WalletModel(CWallet *wallet, OptionsModel *optionsModel, QObject *parent) :\n QObject(parent), wallet(wallet), optionsModel(optionsModel), addressTableModel(0),\n transactionTableModel(0),\n cachedBalance(0), cachedUnconfirmedBalance(0), cachedNumTransactions(0)\n{\n \/\/ Until signal notifications is built into the bitcoin core,\n \/\/ simply update everything after polling using a timer.\n QTimer *timer = new QTimer(this);\n connect(timer, SIGNAL(timeout()), this, SLOT(update()));\n timer->start(MODEL_UPDATE_DELAY);\n\n addressTableModel = new AddressTableModel(wallet, this);\n transactionTableModel = new TransactionTableModel(wallet, this);\n}\n\nqint64 WalletModel::getBalance() const\n{\n return wallet->GetBalance();\n}\n\nqint64 WalletModel::getUnconfirmedBalance() const\n{\n return wallet->GetUnconfirmedBalance();\n}\n\nint WalletModel::getNumTransactions() const\n{\n int numTransactions = 0;\n CRITICAL_BLOCK(wallet->cs_mapWallet)\n {\n numTransactions = wallet->mapWallet.size();\n }\n return numTransactions;\n}\n\nvoid WalletModel::update()\n{\n qint64 newBalance = getBalance();\n qint64 newUnconfirmedBalance = getUnconfirmedBalance();\n int newNumTransactions = getNumTransactions();\n\n if(cachedBalance != newBalance || cachedUnconfirmedBalance != newUnconfirmedBalance)\n emit balanceChanged(newBalance, newUnconfirmedBalance);\n\n if(cachedNumTransactions != newNumTransactions)\n emit numTransactionsChanged(newNumTransactions);\n\n cachedBalance = newBalance;\n cachedUnconfirmedBalance = newUnconfirmedBalance;\n cachedNumTransactions = newNumTransactions;\n\n addressTableModel->update();\n}\n\nbool WalletModel::validateAddress(const QString &address)\n{\n CBitcoinAddress addressParsed(address.toStdString());\n return addressParsed.IsValid();\n}\n\nWalletModel::SendCoinsReturn WalletModel::sendCoins(const QList<SendCoinsRecipient> &recipients)\n{\n qint64 total = 0;\n QSet<QString> setAddress;\n QString hex;\n\n if(recipients.empty())\n {\n return OK;\n }\n\n \/\/ Pre-check input data for validity\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n uint160 hash160 = 0;\n\n if(!validateAddress(rcp.address))\n {\n return InvalidAddress;\n }\n setAddress.insert(rcp.address);\n\n if(rcp.amount <= 0)\n {\n return InvalidAmount;\n }\n total += rcp.amount;\n }\n\n if(recipients.size() > setAddress.size())\n {\n return DuplicateAddress;\n }\n\n if(total > getBalance())\n {\n return AmountExceedsBalance;\n }\n\n if((total + nTransactionFee) > getBalance())\n {\n return SendCoinsReturn(AmountWithFeeExceedsBalance, nTransactionFee);\n }\n\n CRITICAL_BLOCK(cs_main)\n CRITICAL_BLOCK(wallet->cs_mapWallet)\n {\n \/\/ Sendmany\n std::vector<std::pair<CScript, int64> > vecSend;\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n CScript scriptPubKey;\n scriptPubKey.SetBitcoinAddress(rcp.address.toStdString());\n vecSend.push_back(make_pair(scriptPubKey, rcp.amount));\n }\n\n CWalletTx wtx;\n CReserveKey keyChange(wallet);\n int64 nFeeRequired = 0;\n bool fCreated = wallet->CreateTransaction(vecSend, wtx, keyChange, nFeeRequired);\n\n if(!fCreated)\n {\n if((total + nFeeRequired) > wallet->GetBalance())\n {\n return SendCoinsReturn(AmountWithFeeExceedsBalance, nFeeRequired);\n }\n return TransactionCreationFailed;\n }\n if(!ThreadSafeAskFee(nFeeRequired, tr(\"Sending...\").toStdString(), NULL))\n {\n return Aborted;\n }\n if(!wallet->CommitTransaction(wtx, keyChange))\n {\n return TransactionCommitFailed;\n }\n hex = QString::fromStdString(wtx.GetHash().GetHex());\n }\n\n \/\/ Add addresses that we've sent to to the address book\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n std::string strAddress = rcp.address.toStdString();\n CRITICAL_BLOCK(wallet->cs_mapAddressBook)\n {\n if (!wallet->mapAddressBook.count(strAddress))\n wallet->SetAddressBookName(strAddress, rcp.label.toStdString());\n }\n }\n\n return SendCoinsReturn(OK, 0, hex);\n}\n\nOptionsModel *WalletModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nAddressTableModel *WalletModel::getAddressTableModel()\n{\n return addressTableModel;\n}\n\nTransactionTableModel *WalletModel::getTransactionTableModel()\n{\n return transactionTableModel;\n}\n\n\n<commit_msg>make sure address book model is up to date after sending coins<commit_after>#include \"walletmodel.h\"\n#include \"guiconstants.h\"\n#include \"optionsmodel.h\"\n#include \"addresstablemodel.h\"\n#include \"transactiontablemodel.h\"\n\n#include \"headers.h\"\n\n#include <QTimer>\n#include <QSet>\n\nWalletModel::WalletModel(CWallet *wallet, OptionsModel *optionsModel, QObject *parent) :\n QObject(parent), wallet(wallet), optionsModel(optionsModel), addressTableModel(0),\n transactionTableModel(0),\n cachedBalance(0), cachedUnconfirmedBalance(0), cachedNumTransactions(0)\n{\n \/\/ Until signal notifications is built into the bitcoin core,\n \/\/ simply update everything after polling using a timer.\n QTimer *timer = new QTimer(this);\n connect(timer, SIGNAL(timeout()), this, SLOT(update()));\n timer->start(MODEL_UPDATE_DELAY);\n\n addressTableModel = new AddressTableModel(wallet, this);\n transactionTableModel = new TransactionTableModel(wallet, this);\n}\n\nqint64 WalletModel::getBalance() const\n{\n return wallet->GetBalance();\n}\n\nqint64 WalletModel::getUnconfirmedBalance() const\n{\n return wallet->GetUnconfirmedBalance();\n}\n\nint WalletModel::getNumTransactions() const\n{\n int numTransactions = 0;\n CRITICAL_BLOCK(wallet->cs_mapWallet)\n {\n numTransactions = wallet->mapWallet.size();\n }\n return numTransactions;\n}\n\nvoid WalletModel::update()\n{\n qint64 newBalance = getBalance();\n qint64 newUnconfirmedBalance = getUnconfirmedBalance();\n int newNumTransactions = getNumTransactions();\n\n if(cachedBalance != newBalance || cachedUnconfirmedBalance != newUnconfirmedBalance)\n emit balanceChanged(newBalance, newUnconfirmedBalance);\n\n if(cachedNumTransactions != newNumTransactions)\n emit numTransactionsChanged(newNumTransactions);\n\n cachedBalance = newBalance;\n cachedUnconfirmedBalance = newUnconfirmedBalance;\n cachedNumTransactions = newNumTransactions;\n\n addressTableModel->update();\n}\n\nbool WalletModel::validateAddress(const QString &address)\n{\n CBitcoinAddress addressParsed(address.toStdString());\n return addressParsed.IsValid();\n}\n\nWalletModel::SendCoinsReturn WalletModel::sendCoins(const QList<SendCoinsRecipient> &recipients)\n{\n qint64 total = 0;\n QSet<QString> setAddress;\n QString hex;\n\n if(recipients.empty())\n {\n return OK;\n }\n\n \/\/ Pre-check input data for validity\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n uint160 hash160 = 0;\n\n if(!validateAddress(rcp.address))\n {\n return InvalidAddress;\n }\n setAddress.insert(rcp.address);\n\n if(rcp.amount <= 0)\n {\n return InvalidAmount;\n }\n total += rcp.amount;\n }\n\n if(recipients.size() > setAddress.size())\n {\n return DuplicateAddress;\n }\n\n if(total > getBalance())\n {\n return AmountExceedsBalance;\n }\n\n if((total + nTransactionFee) > getBalance())\n {\n return SendCoinsReturn(AmountWithFeeExceedsBalance, nTransactionFee);\n }\n\n CRITICAL_BLOCK(cs_main)\n CRITICAL_BLOCK(wallet->cs_mapWallet)\n {\n \/\/ Sendmany\n std::vector<std::pair<CScript, int64> > vecSend;\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n CScript scriptPubKey;\n scriptPubKey.SetBitcoinAddress(rcp.address.toStdString());\n vecSend.push_back(make_pair(scriptPubKey, rcp.amount));\n }\n\n CWalletTx wtx;\n CReserveKey keyChange(wallet);\n int64 nFeeRequired = 0;\n bool fCreated = wallet->CreateTransaction(vecSend, wtx, keyChange, nFeeRequired);\n\n if(!fCreated)\n {\n if((total + nFeeRequired) > wallet->GetBalance())\n {\n return SendCoinsReturn(AmountWithFeeExceedsBalance, nFeeRequired);\n }\n return TransactionCreationFailed;\n }\n if(!ThreadSafeAskFee(nFeeRequired, tr(\"Sending...\").toStdString(), NULL))\n {\n return Aborted;\n }\n if(!wallet->CommitTransaction(wtx, keyChange))\n {\n return TransactionCommitFailed;\n }\n hex = QString::fromStdString(wtx.GetHash().GetHex());\n }\n\n \/\/ Add addresses that we've sent to to the address book\n foreach(const SendCoinsRecipient &rcp, recipients)\n {\n std::string strAddress = rcp.address.toStdString();\n CRITICAL_BLOCK(wallet->cs_mapAddressBook)\n {\n if (!wallet->mapAddressBook.count(strAddress))\n wallet->SetAddressBookName(strAddress, rcp.label.toStdString());\n }\n }\n addressTableModel->updateList();\n\n return SendCoinsReturn(OK, 0, hex);\n}\n\nOptionsModel *WalletModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nAddressTableModel *WalletModel::getAddressTableModel()\n{\n return addressTableModel;\n}\n\nTransactionTableModel *WalletModel::getTransactionTableModel()\n{\n return transactionTableModel;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Change an ASSERT_TRUE to a CHECK() to remove the gtest dependency.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright 2016 Nu-book Inc.\n* Copyright 2019 Axel Waggershauser\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include <vector>\n\n#include \"MultiFormatWriter.h\"\n#include \"BitMatrix.h\"\n#include \"ByteMatrix.h\"\n\nusing namespace ZXing;\nusing namespace std::literals;\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include \"stb_image_write.h\"\n\nvoid savePng(const BitMatrix& matrix, BarcodeFormat format)\n{\n\tauto bitmap = ToMatrix<uint8_t>(matrix);\n\tstbi_write_png((ToString(format) + \".png\"s).c_str(), bitmap.width(), bitmap.height(), 1, bitmap.data(), 0);\n}\n\nint main()\n{\n\tstd::wstring text = L\"http:\/\/www.google.com\/\";\n\tfor (auto format : {\n\t\tBarcodeFormat::AZTEC,\n\t\tBarcodeFormat::DATA_MATRIX,\n\t\tBarcodeFormat::PDF_417,\n\t\tBarcodeFormat::QR_CODE })\n\t{\n\t\tsavePng(MultiFormatWriter(format).encode(text, 200, 200), format);\n\t}\n\n\ttext = L\"012345678901234567890123456789\";\n\tusing FormatSpecs = std::vector<std::pair<BarcodeFormat, size_t>>;\n\tfor (const auto& [format, length] : FormatSpecs({\n\t\t{BarcodeFormat::CODABAR, 0},\n\t\t{BarcodeFormat::CODE_39, 0},\n\t\t{BarcodeFormat::CODE_93, 0},\n\t\t{BarcodeFormat::CODE_128, 0},\n\t\t{BarcodeFormat::EAN_8, 7},\n\t\t{BarcodeFormat::EAN_13, 12},\n\t\t{BarcodeFormat::ITF, 0},\n\t\t{BarcodeFormat::UPC_A, 11},\n\t\t{BarcodeFormat::UPC_E, 7} }))\n\t{\n\t\tauto input = length > 0 ? text.substr(0, length) : text;\n\t\tsavePng(MultiFormatWriter(format).encode(input, 100, 100), format);\n\t}\n}\n<commit_msg>Test: prevent unnecessary memory allocation<commit_after>\/*\n* Copyright 2016 Nu-book Inc.\n* Copyright 2019 Axel Waggershauser\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include <initializer_list>\n\n#include \"MultiFormatWriter.h\"\n#include \"BitMatrix.h\"\n#include \"ByteMatrix.h\"\n\nusing namespace ZXing;\nusing namespace std::literals;\n\n#define STB_IMAGE_WRITE_IMPLEMENTATION\n#include \"stb_image_write.h\"\n\nvoid savePng(const BitMatrix& matrix, BarcodeFormat format)\n{\n\tauto bitmap = ToMatrix<uint8_t>(matrix);\n\tstbi_write_png((ToString(format) + \".png\"s).c_str(), bitmap.width(), bitmap.height(), 1, bitmap.data(), 0);\n}\n\nint main()\n{\n\tstd::wstring text = L\"http:\/\/www.google.com\/\";\n\tfor (auto format : {\n\t\tBarcodeFormat::AZTEC,\n\t\tBarcodeFormat::DATA_MATRIX,\n\t\tBarcodeFormat::PDF_417,\n\t\tBarcodeFormat::QR_CODE })\n\t{\n\t\tsavePng(MultiFormatWriter(format).encode(text, 200, 200), format);\n\t}\n\n\ttext = L\"012345678901234567890123456789\";\n\tusing FormatSpecs = std::initializer_list<std::pair<BarcodeFormat, size_t>>;\n\tfor (const auto& [format, length] : FormatSpecs({\n\t\t{BarcodeFormat::CODABAR, 0},\n\t\t{BarcodeFormat::CODE_39, 0},\n\t\t{BarcodeFormat::CODE_93, 0},\n\t\t{BarcodeFormat::CODE_128, 0},\n\t\t{BarcodeFormat::EAN_8, 7},\n\t\t{BarcodeFormat::EAN_13, 12},\n\t\t{BarcodeFormat::ITF, 0},\n\t\t{BarcodeFormat::UPC_A, 11},\n\t\t{BarcodeFormat::UPC_E, 7} }))\n\t{\n\t\tauto input = length > 0 ? text.substr(0, length) : text;\n\t\tsavePng(MultiFormatWriter(format).encode(input, 100, 100), format);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dp_executable.cxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_desktop.hxx\"\n\n#include \"dp_backend.h\"\n#include \"dp_ucb.h\"\n#include \"dp_interact.h\"\n#include \"rtl\/string.hxx\"\n#include \"osl\/file.hxx\"\n#include \"ucbhelper\/content.hxx\"\n#include \"comphelper\/servicedecl.hxx\"\n#include \"svtools\/inettype.hxx\"\n#include \"cppuhelper\/implbase1.hxx\"\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing ::rtl::OUString;\n\nnamespace dp_registry {\nnamespace backend {\nnamespace executable {\nnamespace {\n\nclass BackendImpl : public ::dp_registry::backend::PackageRegistryBackend\n{\n class ExecutablePackageImpl : public ::dp_registry::backend::Package\n {\n BackendImpl * getMyBackend() const {\n return static_cast<BackendImpl *>(m_myBackend.get());\n }\n\n \/\/ Package\n virtual beans::Optional< beans::Ambiguous<sal_Bool> > isRegistered_(\n ::osl::ResettableMutexGuard & guard,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & xCmdEnv );\n virtual void processPackage_(\n ::osl::ResettableMutexGuard & guard,\n bool registerPackage,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & xCmdEnv );\n\n bool getFileAttributes(sal_uInt64& out_Attributes);\n bool isUrlTargetInExtension();\n\n public:\n inline ExecutablePackageImpl(\n ::rtl::Reference<PackageRegistryBackend> const & myBackend,\n OUString const & url, OUString const & name,\n Reference<deployment::XPackageTypeInfo> const & xPackageType)\n : Package( myBackend, url, name, name \/* display-name *\/,\n xPackageType ) \/\/,\n {}\n };\n friend class ExecutablePackageImpl;\n\n typedef ::std::hash_map< OUString, Reference<XInterface>,\n ::rtl::OUStringHash > t_string2object;\n\n \/\/ PackageRegistryBackend\n virtual Reference<deployment::XPackage> bindPackage_(\n OUString const & url, OUString const & mediaType,\n Reference<XCommandEnvironment> const & xCmdEnv );\n\n Reference<deployment::XPackageTypeInfo> m_xExecutableTypeInfo;\n\npublic:\n BackendImpl( Sequence<Any> const & args,\n Reference<XComponentContext> const & xComponentContext );\n\n \/\/ XPackageRegistry\n virtual Sequence< Reference<deployment::XPackageTypeInfo> > SAL_CALL\n getSupportedPackageTypes() throw (RuntimeException);\n\n using PackageRegistryBackend::disposing;\n};\n\n\nBackendImpl::BackendImpl(\n Sequence<Any> const & args,\n Reference<XComponentContext> const & xComponentContext )\n : PackageRegistryBackend( args, xComponentContext ),\n m_xExecutableTypeInfo(new Package::TypeInfo(\n OUSTR(\"application\/vnd.sun.star.executable\"),\n OUSTR(\"\"),\n OUSTR(\"Executable\"),\n RID_IMG_COMPONENT,\n RID_IMG_COMPONENT_HC ) )\n{\n\n}\n\n\/\/ XPackageRegistry\nSequence< Reference<deployment::XPackageTypeInfo> >\nBackendImpl::getSupportedPackageTypes() throw (RuntimeException)\n{\n return Sequence<Reference<deployment::XPackageTypeInfo> >(\n & m_xExecutableTypeInfo, 1);\n}\n\n\/\/ PackageRegistryBackend\nReference<deployment::XPackage> BackendImpl::bindPackage_(\n OUString const & url, OUString const & mediaType,\n Reference<XCommandEnvironment> const & xCmdEnv )\n{\n if (mediaType.getLength() == 0)\n {\n throw lang::IllegalArgumentException(\n StrCannotDetectMediaType::get() + url,\n static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n }\n\n String type, subType;\n INetContentTypeParameterList params;\n if (INetContentTypes::parse( mediaType, type, subType, ¶ms ))\n {\n if (type.EqualsIgnoreCaseAscii(\"application\"))\n {\n ::ucbhelper::Content ucbContent( url, xCmdEnv );\n const OUString name( ucbContent.getPropertyValue(\n dp_misc::StrTitle::get() ).get<OUString>() );\n if (subType.EqualsIgnoreCaseAscii(\"vnd.sun.star.executable\"))\n {\n return new BackendImpl::ExecutablePackageImpl(\n this, url, name, m_xExecutableTypeInfo);\n }\n }\n }\n return Reference<deployment::XPackage>();\n}\n\n\/\/##############################################################################\n\n\n\/\/ Package\nbeans::Optional< beans::Ambiguous<sal_Bool> >\nBackendImpl::ExecutablePackageImpl::isRegistered_(\n ::osl::ResettableMutexGuard &,\n ::rtl::Reference<dp_misc::AbortChannel> const &,\n Reference<XCommandEnvironment> const & )\n{\n \/\/We must return Optional.isPresent = true, otherwise\n \/\/processPackage is not called.\n \/\/The user shall not be able to enable\/disable the executable. This is not needed since\n \/\/the executable does not affect the office. The best thing is to show no\n \/\/status at all. See also BackendImpl::PackageImpl::isRegistered_ (dp_package.cxx)\n \/\/On Windows there is no executable file attribute. One has to use security API for this.\n \/\/However, on Windows we do not have the problem, that after unzipping the file cannot be\n \/\/executed.\n return beans::Optional< beans::Ambiguous<sal_Bool> >(\n sal_True \/* IsPresent *\/,\n beans::Ambiguous<sal_Bool>(\n sal_True, sal_True \/* IsAmbiguous *\/ ) );\n}\n\nvoid BackendImpl::ExecutablePackageImpl::processPackage_(\n ::osl::ResettableMutexGuard &,\n bool doRegisterPackage,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & \/*xCmdEnv*\/ )\n{\n checkAborted(abortChannel);\n if (doRegisterPackage)\n {\n if (!isUrlTargetInExtension())\n {\n OSL_ASSERT(0);\n return;\n }\n sal_uInt64 attributes = 0;\n \/\/Setting the executable attribut does not affect executables on Windows\n if (getFileAttributes(attributes))\n {\n if(getMyBackend()->m_context.equals(OUSTR(\"user\")))\n attributes |= osl_File_Attribute_OwnExe;\n else if (getMyBackend()->m_context.equals(OUSTR(\"shared\")))\n attributes |= (osl_File_Attribute_OwnExe | osl_File_Attribute_GrpExe\n | osl_File_Attribute_OthExe);\n else\n OSL_ASSERT(0);\n\n \/\/This won't have affect on Windows\n if (osl::File::E_None != osl::File::setAttributes(\n dp_misc::expandUnoRcUrl(m_url), attributes))\n OSL_ENSURE(0, \"Extension Manager: Could not set executable file attribute.\");\n }\n }\n}\n\n\/\/We currently cannot check if this XPackage represents a content of a particular exension\n\/\/But we can check if we are within $UNO_USER_PACKAGES_CACHE etc.\nbool BackendImpl::ExecutablePackageImpl::isUrlTargetInExtension()\n{\n bool bSuccess = false;\n OUString sExtensionDir;\n if(getMyBackend()->m_context.equals(OUSTR(\"user\")))\n sExtensionDir = dp_misc::expandUnoRcTerm(OUSTR(\"$UNO_USER_PACKAGES_CACHE\"));\n else if (getMyBackend()->m_context.equals(OUSTR(\"shared\")))\n sExtensionDir = dp_misc::expandUnoRcTerm(OUSTR(\"$UNO_SHARED_PACKAGES_CACHE\"));\n else\n OSL_ASSERT(0);\n \/\/remove file ellipses\n if (osl::File::E_None == osl::File::getAbsoluteFileURL(OUString(), sExtensionDir, sExtensionDir))\n {\n OUString sFile;\n if (osl::File::E_None == osl::File::getAbsoluteFileURL(\n OUString(), dp_misc::expandUnoRcUrl(m_url), sFile))\n {\n if (sal_True == sFile.match(sExtensionDir, 0))\n bSuccess = true;\n }\n }\n return bSuccess;\n}\n\nbool BackendImpl::ExecutablePackageImpl::getFileAttributes(sal_uInt64& out_Attributes)\n{\n bool bSuccess = false;\n const OUString url(dp_misc::expandUnoRcUrl(m_url));\n osl::DirectoryItem item;\n if (osl::FileBase::E_None == osl::DirectoryItem::get(url, item))\n {\n osl::FileStatus aStatus(osl_FileStatus_Mask_Attributes);\n if( osl::FileBase::E_None == item.getFileStatus(aStatus))\n {\n out_Attributes = aStatus.getAttributes();\n bSuccess = true;\n }\n }\n return bSuccess;\n}\n\n\/\/##############################################################################\n\n\n} \/\/ anon namespace\n\nnamespace sdecl = comphelper::service_decl;\nsdecl::class_<BackendImpl, sdecl::with_args<true> > serviceBI;\nextern sdecl::ServiceDecl const serviceDecl(\n serviceBI,\n \"com.sun.star.comp.deployment.executable.PackageRegistryBackend\",\n BACKEND_SERVICE_NAME );\n\n} \/\/ namespace component\n} \/\/ namespace backend\n} \/\/ namespace dp_registry\n\n\n<commit_msg>INTEGRATION: CWS jl100_DEV300 (1.2.52); FILE MERGED 2008\/05\/13 15:08:20 jl 1.2.52.1: #156271# The package::getMyBackend functions now throw a DisposedException<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: dp_executable.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_desktop.hxx\"\n\n#include \"dp_backend.h\"\n#include \"dp_ucb.h\"\n#include \"dp_interact.h\"\n#include \"rtl\/string.hxx\"\n#include \"osl\/file.hxx\"\n#include \"ucbhelper\/content.hxx\"\n#include \"comphelper\/servicedecl.hxx\"\n#include \"svtools\/inettype.hxx\"\n#include \"cppuhelper\/implbase1.hxx\"\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing ::rtl::OUString;\n\nnamespace dp_registry {\nnamespace backend {\nnamespace executable {\nnamespace {\n\nclass BackendImpl : public ::dp_registry::backend::PackageRegistryBackend\n{\n class ExecutablePackageImpl : public ::dp_registry::backend::Package\n {\n BackendImpl * getMyBackend() const;\n\n \/\/ Package\n virtual beans::Optional< beans::Ambiguous<sal_Bool> > isRegistered_(\n ::osl::ResettableMutexGuard & guard,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & xCmdEnv );\n virtual void processPackage_(\n ::osl::ResettableMutexGuard & guard,\n bool registerPackage,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & xCmdEnv );\n\n bool getFileAttributes(sal_uInt64& out_Attributes);\n bool isUrlTargetInExtension();\n\n public:\n inline ExecutablePackageImpl(\n ::rtl::Reference<PackageRegistryBackend> const & myBackend,\n OUString const & url, OUString const & name,\n Reference<deployment::XPackageTypeInfo> const & xPackageType)\n : Package( myBackend, url, name, name \/* display-name *\/,\n xPackageType ) \/\/,\n {}\n };\n friend class ExecutablePackageImpl;\n\n typedef ::std::hash_map< OUString, Reference<XInterface>,\n ::rtl::OUStringHash > t_string2object;\n\n \/\/ PackageRegistryBackend\n virtual Reference<deployment::XPackage> bindPackage_(\n OUString const & url, OUString const & mediaType,\n Reference<XCommandEnvironment> const & xCmdEnv );\n\n Reference<deployment::XPackageTypeInfo> m_xExecutableTypeInfo;\n\npublic:\n BackendImpl( Sequence<Any> const & args,\n Reference<XComponentContext> const & xComponentContext );\n\n \/\/ XPackageRegistry\n virtual Sequence< Reference<deployment::XPackageTypeInfo> > SAL_CALL\n getSupportedPackageTypes() throw (RuntimeException);\n\n using PackageRegistryBackend::disposing;\n};\n\n\nBackendImpl::BackendImpl(\n Sequence<Any> const & args,\n Reference<XComponentContext> const & xComponentContext )\n : PackageRegistryBackend( args, xComponentContext ),\n m_xExecutableTypeInfo(new Package::TypeInfo(\n OUSTR(\"application\/vnd.sun.star.executable\"),\n OUSTR(\"\"),\n OUSTR(\"Executable\"),\n RID_IMG_COMPONENT,\n RID_IMG_COMPONENT_HC ) )\n{\n\n}\n\n\/\/ XPackageRegistry\nSequence< Reference<deployment::XPackageTypeInfo> >\nBackendImpl::getSupportedPackageTypes() throw (RuntimeException)\n{\n return Sequence<Reference<deployment::XPackageTypeInfo> >(\n & m_xExecutableTypeInfo, 1);\n}\n\n\/\/ PackageRegistryBackend\nReference<deployment::XPackage> BackendImpl::bindPackage_(\n OUString const & url, OUString const & mediaType,\n Reference<XCommandEnvironment> const & xCmdEnv )\n{\n if (mediaType.getLength() == 0)\n {\n throw lang::IllegalArgumentException(\n StrCannotDetectMediaType::get() + url,\n static_cast<OWeakObject *>(this), static_cast<sal_Int16>(-1) );\n }\n\n String type, subType;\n INetContentTypeParameterList params;\n if (INetContentTypes::parse( mediaType, type, subType, ¶ms ))\n {\n if (type.EqualsIgnoreCaseAscii(\"application\"))\n {\n ::ucbhelper::Content ucbContent( url, xCmdEnv );\n const OUString name( ucbContent.getPropertyValue(\n dp_misc::StrTitle::get() ).get<OUString>() );\n if (subType.EqualsIgnoreCaseAscii(\"vnd.sun.star.executable\"))\n {\n return new BackendImpl::ExecutablePackageImpl(\n this, url, name, m_xExecutableTypeInfo);\n }\n }\n }\n return Reference<deployment::XPackage>();\n}\n\n\/\/##############################################################################\n\n\n\/\/ Package\nBackendImpl * BackendImpl::ExecutablePackageImpl::getMyBackend() const\n{\n BackendImpl * pBackend = static_cast<BackendImpl *>(m_myBackend.get());\n if (NULL == pBackend)\n {\n \/\/May throw a DisposedException\n check();\n \/\/We should never get here...\n throw RuntimeException(\n OUSTR(\"Failed to get the BackendImpl\"),\n static_cast<OWeakObject*>(const_cast<ExecutablePackageImpl *>(this)));\n }\n return pBackend;\n}\n\nbeans::Optional< beans::Ambiguous<sal_Bool> >\nBackendImpl::ExecutablePackageImpl::isRegistered_(\n ::osl::ResettableMutexGuard &,\n ::rtl::Reference<dp_misc::AbortChannel> const &,\n Reference<XCommandEnvironment> const & )\n{\n \/\/We must return Optional.isPresent = true, otherwise\n \/\/processPackage is not called.\n \/\/The user shall not be able to enable\/disable the executable. This is not needed since\n \/\/the executable does not affect the office. The best thing is to show no\n \/\/status at all. See also BackendImpl::PackageImpl::isRegistered_ (dp_package.cxx)\n \/\/On Windows there is no executable file attribute. One has to use security API for this.\n \/\/However, on Windows we do not have the problem, that after unzipping the file cannot be\n \/\/executed.\n return beans::Optional< beans::Ambiguous<sal_Bool> >(\n sal_True \/* IsPresent *\/,\n beans::Ambiguous<sal_Bool>(\n sal_True, sal_True \/* IsAmbiguous *\/ ) );\n}\n\nvoid BackendImpl::ExecutablePackageImpl::processPackage_(\n ::osl::ResettableMutexGuard &,\n bool doRegisterPackage,\n ::rtl::Reference<dp_misc::AbortChannel> const & abortChannel,\n Reference<XCommandEnvironment> const & \/*xCmdEnv*\/ )\n{\n checkAborted(abortChannel);\n if (doRegisterPackage)\n {\n if (!isUrlTargetInExtension())\n {\n OSL_ASSERT(0);\n return;\n }\n sal_uInt64 attributes = 0;\n \/\/Setting the executable attribut does not affect executables on Windows\n if (getFileAttributes(attributes))\n {\n if(getMyBackend()->m_context.equals(OUSTR(\"user\")))\n attributes |= osl_File_Attribute_OwnExe;\n else if (getMyBackend()->m_context.equals(OUSTR(\"shared\")))\n attributes |= (osl_File_Attribute_OwnExe | osl_File_Attribute_GrpExe\n | osl_File_Attribute_OthExe);\n else\n OSL_ASSERT(0);\n\n \/\/This won't have affect on Windows\n if (osl::File::E_None != osl::File::setAttributes(\n dp_misc::expandUnoRcUrl(m_url), attributes))\n OSL_ENSURE(0, \"Extension Manager: Could not set executable file attribute.\");\n }\n }\n}\n\n\/\/We currently cannot check if this XPackage represents a content of a particular exension\n\/\/But we can check if we are within $UNO_USER_PACKAGES_CACHE etc.\nbool BackendImpl::ExecutablePackageImpl::isUrlTargetInExtension()\n{\n bool bSuccess = false;\n OUString sExtensionDir;\n if(getMyBackend()->m_context.equals(OUSTR(\"user\")))\n sExtensionDir = dp_misc::expandUnoRcTerm(OUSTR(\"$UNO_USER_PACKAGES_CACHE\"));\n else if (getMyBackend()->m_context.equals(OUSTR(\"shared\")))\n sExtensionDir = dp_misc::expandUnoRcTerm(OUSTR(\"$UNO_SHARED_PACKAGES_CACHE\"));\n else\n OSL_ASSERT(0);\n \/\/remove file ellipses\n if (osl::File::E_None == osl::File::getAbsoluteFileURL(OUString(), sExtensionDir, sExtensionDir))\n {\n OUString sFile;\n if (osl::File::E_None == osl::File::getAbsoluteFileURL(\n OUString(), dp_misc::expandUnoRcUrl(m_url), sFile))\n {\n if (sal_True == sFile.match(sExtensionDir, 0))\n bSuccess = true;\n }\n }\n return bSuccess;\n}\n\nbool BackendImpl::ExecutablePackageImpl::getFileAttributes(sal_uInt64& out_Attributes)\n{\n bool bSuccess = false;\n const OUString url(dp_misc::expandUnoRcUrl(m_url));\n osl::DirectoryItem item;\n if (osl::FileBase::E_None == osl::DirectoryItem::get(url, item))\n {\n osl::FileStatus aStatus(osl_FileStatus_Mask_Attributes);\n if( osl::FileBase::E_None == item.getFileStatus(aStatus))\n {\n out_Attributes = aStatus.getAttributes();\n bSuccess = true;\n }\n }\n return bSuccess;\n}\n\n\/\/##############################################################################\n\n\n} \/\/ anon namespace\n\nnamespace sdecl = comphelper::service_decl;\nsdecl::class_<BackendImpl, sdecl::with_args<true> > serviceBI;\nextern sdecl::ServiceDecl const serviceDecl(\n serviceBI,\n \"com.sun.star.comp.deployment.executable.PackageRegistryBackend\",\n BACKEND_SERVICE_NAME );\n\n} \/\/ namespace component\n} \/\/ namespace backend\n} \/\/ namespace dp_registry\n\n\n<|endoftext|>"} {"text":"<commit_before>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2006 Refractions Research Inc.\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n *\n * This is free software; you can redistribute and\/or modify it under\n * the terms of the GNU Lesser General Public Licence as published\n * by the Free Software Foundation.\n * See the COPYING file for more information.\n *\n **********************************************************************\/\n\n\/\/ CTS.cpp : Testing class\n\/\/\n\n#include <iostream>\n#include <fstream>\n\n#include <geos\/io\/WKTWriter.h>\n#include <geos\/io\/WKTReader.h>\n#include <geos\/geom\/PrecisionModel.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/util\/GEOSException.h>\n\nusing namespace std;\nusing namespace geos::io;\nusing namespace geos::geom;\nusing namespace geos::util;\n\nint\nmain(int \/*argc*\/, char** \/*argv*\/)\n{\n\n try {\n ofstream out(\"WKTOut\");\n ifstream in(\"WKTIn\");\n string instr;\n string outstr;\n PrecisionModel pm;\n GeometryFactory::Ptr gf = GeometryFactory::create(&pm, 10);\n WKTReader* r = new WKTReader(gf.get());\n WKTWriter* w = new WKTWriter();\n Geometry* g;\n\n cout << \"Start Testing:\" << endl;\n while(!in.eof()) {\n getline(in, instr);\n if(instr != \"\") {\n g = r->read(instr).release();\n outstr = w->write(g);\n out << \"----------\" << endl;\n out << instr << endl;\n out << outstr << endl;\n out << \"----------\" << endl << endl;\n }\n }\n out.flush();\n out.close();\n cout << \"End of Testing\" << endl;\n\n }\n catch(const GEOSException& ge) {\n cout << ge.what() << endl;\n }\n\n return 0;\n}\n<commit_msg>SimpleWKTTester: Memory leaks<commit_after>\/**********************************************************************\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.osgeo.org\n *\n * Copyright (C) 2006 Refractions Research Inc.\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n *\n * This is free software; you can redistribute and\/or modify it under\n * the terms of the GNU Lesser General Public Licence as published\n * by the Free Software Foundation.\n * See the COPYING file for more information.\n *\n **********************************************************************\/\n\n\/\/ CTS.cpp : Testing class\n\/\/\n\n#include <iostream>\n#include <fstream>\n\n#include <geos\/io\/WKTWriter.h>\n#include <geos\/io\/WKTReader.h>\n#include <geos\/geom\/PrecisionModel.h>\n#include <geos\/geom\/GeometryFactory.h>\n#include <geos\/geom\/Geometry.h>\n#include <geos\/util\/GEOSException.h>\n\nusing namespace std;\nusing namespace geos::io;\nusing namespace geos::geom;\nusing namespace geos::util;\n\nint\nmain(int \/*argc*\/, char** \/*argv*\/)\n{\n\n try {\n ofstream out(\"WKTOut\");\n ifstream in(\"WKTIn\");\n string instr;\n string outstr;\n PrecisionModel pm;\n GeometryFactory::Ptr gf = GeometryFactory::create(&pm, 10);\n WKTReader* r = new WKTReader(gf.get());\n WKTWriter* w = new WKTWriter();\n Geometry* g;\n\n cout << \"Start Testing:\" << endl;\n while(!in.eof()) {\n getline(in, instr);\n if(instr != \"\") {\n g = r->read(instr).release();\n outstr = w->write(g);\n out << \"----------\" << endl;\n out << instr << endl;\n out << outstr << endl;\n out << \"----------\" << endl << endl;\n }\n }\n out.flush();\n out.close();\n cout << \"End of Testing\" << endl;\n\t\tdelete r;\n\t\tdelete w;\n\n }\n catch(const GEOSException& ge) {\n cout << ge.what() << endl;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <GeoffRenderer.h>\n\nnamespace geoff\n{\n\t\n\tGeoffRenderer::GeoffRenderer()\n\t{\n\t\tglGenBuffers( 1, &_vertexBuffer );\n\t\tglGenBuffers( 1, &_indexBuffer );\n\t}\n\t\n\tGeoffRenderer::~GeoffRenderer()\n\t{\n\t\tglDeleteBuffers( 1, &_vertexBuffer );\n\t\tglDeleteBuffers( 1, &_indexBuffer );\n\t}\n\t\n\tvoid GeoffRenderer::clear( float r, float g, float b, float a )\n\t{\n\t\tglClearColor( r, g, b, a );\n\t\tglClear( GL_COLOR_BUFFER_BIT );\n\t}\n\t\n\tint GeoffRenderer::compileShader( ::String vsSource, ::String fsSource )\n\t{\n\t\tGLint status = 0;\n\t\t\n\t\tGLuint vs = glCreateShader( GL_VERTEX_SHADER );\n\t\tconst char* vsSourceCStr = vsSource.__CStr();\n\t\tglShaderSource( vs, 1, &vsSourceCStr, &vsSource.length );\n\t\tglCompileShader( vs );\n\t\tglGetShaderiv( vs, GL_COMPILE_STATUS, &status );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem compiling the vertex shader\n\t\t\tglDeleteShader( vs );\n\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tGLuint fs = glCreateShader( GL_FRAGMENT_SHADER );\n\t\tconst char* fsSourceCStr = fsSource.__CStr();\n\t\tglShaderSource( fs, 1, &fsSourceCStr, &fsSource.length );\n\t\tglCompileShader( fs );\n\t\tglGetShaderiv( vs, GL_COMPILE_STATUS, &status );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem compiling the fragment shader\n\t\t\tglDeleteShader( vs );\n\t\t\tglDeleteShader( fs );\n\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tGLuint program = glCreateProgram();\n\t\tglAttachShader( program, vs );\n\t\tglAttachShader( program, fs );\n\t\tglLinkProgram( program );\n\t\tglGetProgramiv( program, GL_LINK_STATUS, &status );\n\t\t\n\t\tglDeleteShader( vs );\n\t\tglDeleteShader( fs );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem linking the shader\n\t\t\tglDeleteProgram( program );\n\t\t\treturn 0;\n\t\t}\t\t\n\t\t\n\t\treturn program;\n\t}\n}<commit_msg>Error codes for shader compile<commit_after>#include <GeoffRenderer.h>\n\nnamespace geoff\n{\n\t\n\tGeoffRenderer::GeoffRenderer()\n\t{\n\t\tglGenBuffers( 1, &_vertexBuffer );\n\t\tglGenBuffers( 1, &_indexBuffer );\n\t}\n\t\n\tGeoffRenderer::~GeoffRenderer()\n\t{\n\t\tglDeleteBuffers( 1, &_vertexBuffer );\n\t\tglDeleteBuffers( 1, &_indexBuffer );\n\t}\n\t\n\tvoid GeoffRenderer::clear( float r, float g, float b, float a )\n\t{\n\t\tglClearColor( r, g, b, a );\n\t\tglClear( GL_COLOR_BUFFER_BIT );\n\t}\n\t\n\tint GeoffRenderer::compileShader( ::String vsSource, ::String fsSource )\n\t{\n\t\tGLint status = 0;\n\t\t\n\t\tGLuint vs = glCreateShader( GL_VERTEX_SHADER );\n\t\tconst char* vsSourceCStr = vsSource.__CStr();\n\t\tglShaderSource( vs, 1, &vsSourceCStr, &vsSource.length );\n\t\tglCompileShader( vs );\n\t\tglGetShaderiv( vs, GL_COMPILE_STATUS, &status );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem compiling the vertex shader\n\t\t\tglDeleteShader( vs );\n\t\t\treturn -1;\n\t\t}\n\t\t\n\t\tGLuint fs = glCreateShader( GL_FRAGMENT_SHADER );\n\t\tconst char* fsSourceCStr = fsSource.__CStr();\n\t\tglShaderSource( fs, 1, &fsSourceCStr, &fsSource.length );\n\t\tglCompileShader( fs );\n\t\tglGetShaderiv( vs, GL_COMPILE_STATUS, &status );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem compiling the fragment shader\n\t\t\tglDeleteShader( vs );\n\t\t\tglDeleteShader( fs );\n\t\t\treturn 2;\n\t\t}\n\t\t\n\t\tGLuint program = glCreateProgram();\n\t\tglAttachShader( program, vs );\n\t\tglAttachShader( program, fs );\n\t\tglLinkProgram( program );\n\t\tglGetProgramiv( program, GL_LINK_STATUS, &status );\n\t\t\n\t\tglDeleteShader( vs );\n\t\tglDeleteShader( fs );\n\t\t\n\t\tif ( status == 0 ) \n\t\t{\n\t\t\t\/\/ There was a problem linking the shader\n\t\t\tglDeleteProgram( program );\n\t\t\treturn -3;\n\t\t}\t\t\n\t\t\n\t\treturn program;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\n\/\/ hack, see http:\/\/stackoverflow.com\/questions\/12523122\/what-is-glibcxx-use-nanosleep-all-about\n#define _GLIBCXX_USE_NANOSLEEP 1\n#include <chrono>\n#include <thread>\n#include <linux\/i2c-dev.h>\n\/\/#include <linux\/i2c.h>\n#include <sys\/ioctl.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#include <tinyxml.h>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#include \"arro.pb.h\"\n#include \"Trace.h\"\n#include \"INodeContext.h\"\n\n\n\/**\n * The PCA9685 PWM generator (used on the Esc Hat) has four main layers of structure:\n *\n * - a 25MHz internal clock\n * - a prescaler that emits 1 tick for every N ticks of the 25MHz clock\n * - a 12-bit counter triggered by the prescaler\n * - a set of comparison registers for each output channel\n *\n * The 12-bit counter resets to zero every 4096 ticks of the prescaler, and the number\n * of times that happens per second is the PWM frequency. See setPWMFreq().\n *\n * The output goes high when the 12-bit clock equals the value in the first comparison\n * register, and goes low when the 12-bit clock equals the value in the second comparison register.\n * See setPWM()\n *\n *\/\nnamespace Arro {\n class NodeEsc: public INodeDefinition {\n public:\n\n \/**\n * Constructor\n *\n * \\param d The Process node instance.\n * \\param name Name of this node.\n * \\param params List of parameters passed to this node.\n *\/\n NodeEsc(INodeContext* d, const std::string& name, StringMap& params, TiXmlElement*);\n virtual ~NodeEsc() {};\n\n \/\/ Copy and assignment is not supported.\n NodeEsc(const NodeEsc&) = delete;\n NodeEsc& operator=(const NodeEsc& other) = delete;\n\n virtual void finishConstruction();\n\n \/**\n * Make the node execute a processing cycle.\n *\/\n void runCycle();\n\n private:\n class PWM {\n public:\n PWM(double freq, int address = 0x40, const char* filename = \"\/dev\/i2c-1\");\n \/\/ Esc(int address = 0x60, const char* filename = \"\/dev\/i2c-1\");\n virtual ~PWM() {};\n void setPulse(int ch, int val);\n\n \/**\n * Read 1 byte from specified register.\n *\n * \\param command Register to read from.\n *\/\n unsigned char i2c_readU8(unsigned char command);\n\n \/**\n * Write 1 byte to register.\n *\n * \\param command Register to write to.\n *\/\n void i2c_write8(unsigned char command, unsigned short value);\n\n \/**\n * Sets a single PWM channel\n *\n * \\param channel PWM channel\n * \\param on On?\n * \\param off Offset?\n *\/\n void setPWM(int channel, int on, int off);\n\n \/**\n * Sets the PWM frequency.\n *\n * \\param freq Frequency.\n *\/\n void setPWMFreq(double freq);\n\n private:\n Trace m_trace;\n double m_prescaleval;\n char m_filename[40];\n int m_addr; \/\/ The I2C address\n int m_file;\n };\n\n Trace m_trace;\n INodeContext* m_elemBlock;\n double m_speed;\n int m_Ch;\n int m_maxPulse;\n int m_minPulse;\n int m_zeroPulse;\n\n INodeContext::ItRef m_speedPad;\n\n static PWM* m_pPWM;\n };\n}\n\nusing namespace std;\nusing namespace Arro;\nusing namespace arro;\n\n\/\/ To stub out\n#ifndef RPI\n #define i2c_smbus_write_byte_data(file, mode, data) 1\n #define i2c_smbus_read_byte_data(file, command) 1\n#endif\n\n\n\/\/ Registers\/etc.\n#define __SUBADR1 0x02\n#define __SUBADR2 0x03\n#define __SUBADR3 0x04\n#define __MODE1 0x00\n#define __PRESCALE 0xFE\n#define __LED0_ON_L 0x06\n#define __LED0_ON_H 0x07\n#define __LED0_OFF_L 0x08\n#define __LED0_OFF_H 0x09\n#define __ALLLED_ON_L 0xFA\n#define __ALLLED_ON_H 0xFB\n#define __ALLLED_OFF_L 0xFC\n#define __ALLLED_OFF_H 0xFD\n\n\nstatic RegisterMe<NodeEsc> registerMe(\"Esc\");\n\nunsigned char\nNodeEsc::PWM::i2c_readU8(unsigned char command) {\n \/\/ Using I2C Read, equivalent of i2c_smbus_read_byte(file)\n \/\/ if (read(file, buf, 1) != 1) {\n __s32 ret = i2c_smbus_read_byte_data(m_file, command);\n m_trace.println(\"---- i2c_read returned \", ret);\n if (ret == -1) {\n m_trace.fatal(\"Failed i2c_read errno\", errno);\n } else {\n \/\/ buf[0] contains the read byte\n }\n return ret;\n}\n\nvoid\nNodeEsc::PWM::i2c_write8(unsigned char command, unsigned short value) {\n \/\/ Using I2C Write, equivalent of\n \/\/ i2c_smbus_write_word_data(file, register, 0x6543)\n\n \/\/ unsigned char buf[10];\n \/\/ buf[0] = register;\n \/\/ buf[1] = value & 0x000000FF; \/\/ 0x43;\n \/\/ value = value >> 8;\n \/\/ buf[2] = value & 0x000000FF; \/\/ 0x65;\n \/\/ if (write(file, buf, 3) !=3) {\n\n __s32 ret = i2c_smbus_write_byte_data(m_file, command, value);\n m_trace.println(\"---- i2c_write8 Wrote\", value);\n m_trace.println(\"to \", (int)command);\n if (ret == -1) {\n m_trace.fatal(\"Failed i2c_write8 errno\", errno);\n }\n}\n\nvoid\nNodeEsc::PWM::setPWM(int channel, int on, int off) {\n i2c_write8(__LED0_ON_L+4*channel, on & 0xFF);\n i2c_write8(__LED0_ON_H+4*channel, on >> 8);\n i2c_write8(__LED0_OFF_L+4*channel, off & 0xFF);\n i2c_write8(__LED0_OFF_H+4*channel, off >> 8);\n}\n\nvoid\nNodeEsc::PWM::setPWMFreq(double freq) {\n m_prescaleval = 25000000.0; \/\/ 25MHz\n m_prescaleval \/= 4096.0; \/\/ 12-bit\n m_prescaleval \/= float(freq);\n m_prescaleval -= 1.0;\n\n m_trace.println(\"Setting PWM frequency to %d Hz\", freq);\n m_trace.println(\"Estimated pre-scale: %d\", m_prescaleval);\n\n int prescale = (int)(m_prescaleval + 0.5);\n m_trace.println(\"Final pre-scale\", prescale);\n\n int oldmode = i2c_readU8(__MODE1);\n int newmode = (oldmode & 0x7F) | 0x10; \/\/ sleep\n i2c_write8(__MODE1, newmode); \/\/ go to sleep\n i2c_write8(__PRESCALE, prescale);\n i2c_write8(__MODE1, oldmode);\n \/\/time.sleep(0.005)\n std::chrono::milliseconds timespan(5);\n std::this_thread::sleep_for(timespan);\n i2c_write8(__MODE1, oldmode | 0x80);\n}\n\nNodeEsc::PWM::PWM(double freq, int address, const char* filename):\n m_trace(\"Esc\", true),\n m_prescaleval(0),\n m_addr(address){\n\n\/\/ To stub out\n#ifdef RPI\n if ((m_file = open(filename,O_RDWR)) < 0) {\n m_trace.fatal(\"Failed to open the bus errno\", errno);\n }\n\n if (ioctl(m_file,I2C_SLAVE,m_addr) < 0) {\n m_trace.fatal(\"Failed to acquire bus access and\/or talk to slave\");\n }\n#endif\n \/* Reseting PCA9685 *\/\n i2c_smbus_write_byte_data(m_file, __MODE1, 0x00);\n\n setPWMFreq(freq);\n\n}\n\nvoid\nNodeEsc::PWM::setPulse(int ch, int val) {\n setPWM(ch, 0, val);\n}\n\nNodeEsc::PWM* NodeEsc::m_pPWM = nullptr;\n\n\/*\ndef __init__(self, controller=None,\n max_pulse=300,\n min_pulse=490,\n zero_pulse=350):\n\n self.controller = controller\n self.max_pulse = max_pulse\n self.min_pulse = min_pulse\n self.zero_pulse = zero_pulse\n\n #send zero pulse to calibrate ESC\n print(\"Init ESC\")\n self.controller.set_pulse(self.max_pulse)\n time.sleep(0.01)\n self.controller.set_pulse(self.min_pulse)\n time.sleep(0.01)\n self.controller.set_pulse(self.zero_pulse)\n time.sleep(1)\n*\/\n\nNodeEsc::NodeEsc(INodeContext* d, const string& \/*name*\/, StringMap& \/* params *\/, TiXmlElement*):\n m_trace(\"NodeEsc\", true),\n m_elemBlock(d),\n m_speed(0),\n m_Ch(0),\n m_speedPad{nullptr}\n {\n\n m_Ch = stod(d->getParameter(\"Channel\"));\n int freq = stod(d->getParameter(\"Freq\"));\n m_maxPulse = stod(d->getParameter(\"MaxPulse\"));\n m_minPulse = stod(d->getParameter(\"MinPulse\"));\n m_zeroPulse = stod(d->getParameter(\"ZeroPulse\"));\n\n if(!m_pPWM) {\n m_pPWM = new PWM((float)freq);\n }\n\n \/\/ Init ESC\n m_trace.println(\"Init ESC\");\n std::chrono::milliseconds timespan(10);\n m_pPWM->setPulse(m_Ch, m_maxPulse);\n std::this_thread::sleep_for(timespan);\n m_pPWM->setPulse(m_Ch, m_minPulse);\n std::this_thread::sleep_for(timespan);\n m_pPWM->setPulse(m_Ch, m_zeroPulse);\n std::chrono::milliseconds timespan1(1000);\n std::this_thread::sleep_for(timespan1);\n}\n\n\nvoid\nNodeEsc::finishConstruction() {\n m_trace.println(\"finishConstruction\");\n\n m_speedPad = m_elemBlock->begin(m_elemBlock->getInputPad(\"speed\"), 0, INodeContext::DELTA);\n\n}\n\n\nvoid\nNodeEsc::runCycle() {\n\n MessageBuf m1;\n if(m_speedPad->getNext(m1)) {\n Value* speed = new Value();\n speed->ParseFromString(m1->c_str());\n\n m_speed = speed->value();\n\n m_trace.println(string(\"NodeEsc speed = \") + to_string((long double)m_speed));\n\n m_pPWM->setPulse(m_Ch, m_speed);\n }\n}\n<commit_msg>Fix ESC speed control<commit_after>\n\/\/ hack, see http:\/\/stackoverflow.com\/questions\/12523122\/what-is-glibcxx-use-nanosleep-all-about\n#define _GLIBCXX_USE_NANOSLEEP 1\n#include <chrono>\n#include <thread>\n#include <linux\/i2c-dev.h>\n\/\/#include <linux\/i2c.h>\n#include <sys\/ioctl.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\n#include <tinyxml.h>\n#include <iostream>\n#include <sstream>\n#include <map>\n\n#include \"arro.pb.h\"\n#include \"Trace.h\"\n#include \"INodeContext.h\"\n\n\n\/**\n * The PCA9685 PWM generator (used on the Esc Hat) has four main layers of structure:\n *\n * - a 25MHz internal clock\n * - a prescaler that emits 1 tick for every N ticks of the 25MHz clock\n * - a 12-bit counter triggered by the prescaler\n * - a set of comparison registers for each output channel\n *\n * The 12-bit counter resets to zero every 4096 ticks of the prescaler, and the number\n * of times that happens per second is the PWM frequency. See setPWMFreq().\n *\n * The output goes high when the 12-bit clock equals the value in the first comparison\n * register, and goes low when the 12-bit clock equals the value in the second comparison register.\n * See setPWM()\n *\n *\/\nnamespace Arro {\n class NodeEsc: public INodeDefinition {\n public:\n\n \/**\n * Constructor\n *\n * \\param d The Process node instance.\n * \\param name Name of this node.\n * \\param params List of parameters passed to this node.\n *\/\n NodeEsc(INodeContext* d, const std::string& name, StringMap& params, TiXmlElement*);\n virtual ~NodeEsc() {};\n\n \/\/ Copy and assignment is not supported.\n NodeEsc(const NodeEsc&) = delete;\n NodeEsc& operator=(const NodeEsc& other) = delete;\n\n virtual void finishConstruction();\n\n \/**\n * Make the node execute a processing cycle.\n *\/\n void runCycle();\n\n private:\n class PWM {\n public:\n PWM(double freq, int address = 0x40, const char* filename = \"\/dev\/i2c-1\");\n \/\/ Esc(int address = 0x60, const char* filename = \"\/dev\/i2c-1\");\n virtual ~PWM() {};\n void setPulse(int ch, int val);\n\n \/**\n * Read 1 byte from specified register.\n *\n * \\param command Register to read from.\n *\/\n unsigned char i2c_readU8(unsigned char command);\n\n \/**\n * Write 1 byte to register.\n *\n * \\param command Register to write to.\n *\/\n void i2c_write8(unsigned char command, unsigned short value);\n\n \/**\n * Sets a single PWM channel\n *\n * \\param channel PWM channel\n * \\param on On?\n * \\param off Offset?\n *\/\n void setPWM(int channel, int on, int off);\n\n \/**\n * Sets the PWM frequency.\n *\n * \\param freq Frequency.\n *\/\n void setPWMFreq(double freq);\n\n private:\n Trace m_trace;\n double m_prescaleval;\n char m_filename[40];\n int m_addr; \/\/ The I2C address\n int m_file;\n };\n\n Trace m_trace;\n INodeContext* m_elemBlock;\n int m_speed;\n int m_Ch;\n int m_maxPulse;\n int m_minPulse;\n int m_zeroPulse;\n\n INodeContext::ItRef m_speedPad;\n\n static PWM* m_pPWM;\n };\n}\n\nusing namespace std;\nusing namespace Arro;\nusing namespace arro;\n\n\/\/ To stub out\n#ifndef RPI\n #define i2c_smbus_write_byte_data(file, mode, data) 1\n #define i2c_smbus_read_byte_data(file, command) 1\n#endif\n\n\n\/\/ Registers\/etc.\n#define __SUBADR1 0x02\n#define __SUBADR2 0x03\n#define __SUBADR3 0x04\n#define __MODE1 0x00\n#define __PRESCALE 0xFE\n#define __LED0_ON_L 0x06\n#define __LED0_ON_H 0x07\n#define __LED0_OFF_L 0x08\n#define __LED0_OFF_H 0x09\n#define __ALLLED_ON_L 0xFA\n#define __ALLLED_ON_H 0xFB\n#define __ALLLED_OFF_L 0xFC\n#define __ALLLED_OFF_H 0xFD\n\n\nstatic RegisterMe<NodeEsc> registerMe(\"Esc\");\n\nunsigned char\nNodeEsc::PWM::i2c_readU8(unsigned char command) {\n \/\/ Using I2C Read, equivalent of i2c_smbus_read_byte(file)\n \/\/ if (read(file, buf, 1) != 1) {\n __s32 ret = i2c_smbus_read_byte_data(m_file, command);\n m_trace.println(\"---- i2c_read returned \", ret);\n if (ret == -1) {\n m_trace.fatal(\"Failed i2c_read errno\", errno);\n } else {\n \/\/ buf[0] contains the read byte\n }\n return ret;\n}\n\nvoid\nNodeEsc::PWM::i2c_write8(unsigned char command, unsigned short value) {\n \/\/ Using I2C Write, equivalent of\n \/\/ i2c_smbus_write_word_data(file, register, 0x6543)\n\n \/\/ unsigned char buf[10];\n \/\/ buf[0] = register;\n \/\/ buf[1] = value & 0x000000FF; \/\/ 0x43;\n \/\/ value = value >> 8;\n \/\/ buf[2] = value & 0x000000FF; \/\/ 0x65;\n \/\/ if (write(file, buf, 3) !=3) {\n\n __s32 ret = i2c_smbus_write_byte_data(m_file, command, value);\n m_trace.println(\"---- i2c_write8 Wrote\", value);\n m_trace.println(\"to \", (int)command);\n if (ret == -1) {\n m_trace.fatal(\"Failed i2c_write8 errno\", errno);\n }\n}\n\nvoid\nNodeEsc::PWM::setPWM(int channel, int on, int off) {\n i2c_write8(__LED0_ON_L+4*channel, on & 0xFF);\n i2c_write8(__LED0_ON_H+4*channel, on >> 8);\n i2c_write8(__LED0_OFF_L+4*channel, off & 0xFF);\n i2c_write8(__LED0_OFF_H+4*channel, off >> 8);\n}\n\nvoid\nNodeEsc::PWM::setPWMFreq(double freq) {\n m_prescaleval = 25000000.0; \/\/ 25MHz\n m_prescaleval \/= 4096.0; \/\/ 12-bit\n m_prescaleval \/= float(freq);\n m_prescaleval -= 1.0;\n\n m_trace.println(\"Setting PWM frequency to %d Hz\", freq);\n m_trace.println(\"Estimated pre-scale: %d\", m_prescaleval);\n\n int prescale = (int)(m_prescaleval + 0.5);\n m_trace.println(\"Final pre-scale\", prescale);\n\n int oldmode = i2c_readU8(__MODE1);\n int newmode = (oldmode & 0x7F) | 0x10; \/\/ sleep\n i2c_write8(__MODE1, newmode); \/\/ go to sleep\n i2c_write8(__PRESCALE, prescale);\n i2c_write8(__MODE1, oldmode);\n \/\/time.sleep(0.005)\n std::chrono::milliseconds timespan(5);\n std::this_thread::sleep_for(timespan);\n i2c_write8(__MODE1, oldmode | 0x80);\n}\n\nNodeEsc::PWM::PWM(double freq, int address, const char* filename):\n m_trace(\"Esc\", true),\n m_prescaleval(0),\n m_addr(address){\n\n\/\/ To stub out\n#ifdef RPI\n if ((m_file = open(filename,O_RDWR)) < 0) {\n m_trace.fatal(\"Failed to open the bus errno\", errno);\n }\n\n if (ioctl(m_file,I2C_SLAVE,m_addr) < 0) {\n m_trace.fatal(\"Failed to acquire bus access and\/or talk to slave\");\n }\n#endif\n \/* Reseting PCA9685 *\/\n i2c_smbus_write_byte_data(m_file, __MODE1, 0x00);\n\n setPWMFreq(freq);\n\n}\n\nvoid\nNodeEsc::PWM::setPulse(int ch, int val) {\n setPWM(ch, 0, val);\n}\n\nNodeEsc::PWM* NodeEsc::m_pPWM = nullptr;\n\n\/*\ndef __init__(self, controller=None,\n max_pulse=300,\n min_pulse=490,\n zero_pulse=350):\n\n self.controller = controller\n self.max_pulse = max_pulse\n self.min_pulse = min_pulse\n self.zero_pulse = zero_pulse\n\n #send zero pulse to calibrate ESC\n print(\"Init ESC\")\n self.controller.set_pulse(self.max_pulse)\n time.sleep(0.01)\n self.controller.set_pulse(self.min_pulse)\n time.sleep(0.01)\n self.controller.set_pulse(self.zero_pulse)\n time.sleep(1)\n*\/\n\nNodeEsc::NodeEsc(INodeContext* d, const string& \/*name*\/, StringMap& \/* params *\/, TiXmlElement*):\n m_trace(\"NodeEsc\", true),\n m_elemBlock(d),\n m_speed(0),\n m_Ch(0),\n m_speedPad{nullptr}\n{\n\n m_Ch = stod(d->getParameter(\"Channel\"));\n int freq = stod(d->getParameter(\"Freq\"));\n m_maxPulse = stod(d->getParameter(\"MaxPulse\"));\n m_minPulse = stod(d->getParameter(\"MinPulse\"));\n m_zeroPulse = stod(d->getParameter(\"ZeroPulse\"));\n\n if(!m_pPWM) {\n m_pPWM = new PWM((float)freq);\n }\n\n \/\/ Init ESC\n m_trace.println(\"Init ESC\");\n std::chrono::milliseconds timespan(10);\n m_pPWM->setPulse(m_Ch, m_maxPulse);\n std::this_thread::sleep_for(timespan);\n m_pPWM->setPulse(m_Ch, m_minPulse);\n std::this_thread::sleep_for(timespan);\n m_pPWM->setPulse(m_Ch, m_zeroPulse);\n std::chrono::milliseconds timespan1(1000);\n std::this_thread::sleep_for(timespan1);\n}\n\n\nvoid\nNodeEsc::finishConstruction() {\n m_trace.println(\"finishConstruction\");\n\n m_speedPad = m_elemBlock->begin(m_elemBlock->getInputPad(\"speed\"), 0, INodeContext::DELTA);\n\n}\n\n\nvoid\nNodeEsc::runCycle() {\n\n MessageBuf m1;\n if(m_speedPad->getNext(m1)) {\n Value* speed = new Value();\n speed->ParseFromString(m1->c_str());\n\n m_speed = speed->value();\n\n \/\/ Limit speed\n if(m_speed > 0) {\n m_speed = std::min(m_speed, 30);\n }\n else\n {\n m_speed = std::max(m_speed, -30);\n }\n m_speed += m_zeroPulse;\n\n\n m_trace.println(string(\"NodeEsc speed = \") + to_string(m_speed));\n\n m_pPWM->setPulse(m_Ch, m_speed);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/audio_device\/android\/audio_manager_jni.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/system_wrappers\/interface\/trace.h\"\n\nnamespace {\n\nclass AttachThreadScoped {\n public:\n explicit AttachThreadScoped(JavaVM* jvm)\n : attached_(false), jvm_(jvm), env_(NULL) {\n jint ret_val = jvm->GetEnv(reinterpret_cast<void**>(&env_),\n REQUIRED_JNI_VERSION);\n if (ret_val == JNI_EDETACHED) {\n \/\/ Attach the thread to the Java VM.\n ret_val = jvm_->AttachCurrentThread(&env_, NULL);\n attached_ = ret_val > 0;\n assert(attached_);\n }\n }\n ~AttachThreadScoped() {\n if (attached_ && (jvm_->DetachCurrentThread() < 0)) {\n assert(false);\n }\n }\n\n JNIEnv* env() { return env_; }\n\n private:\n bool attached_;\n JavaVM* jvm_;\n JNIEnv* env_;\n};\n\n} \/\/ namespace\n\nnamespace webrtc {\n\nstatic JavaVM* g_jvm_ = NULL;\nstatic JNIEnv* g_jni_env_ = NULL;\nstatic jobject g_context_ = NULL;\nstatic jclass g_audio_manager_class_ = NULL;\nstatic jobject g_audio_manager_ = NULL;\n\nAudioManagerJni::AudioManagerJni()\n : low_latency_supported_(false),\n native_output_sample_rate_(0),\n native_buffer_size_(0) {\n if (!HasDeviceObjects()) {\n assert(false);\n }\n AttachThreadScoped ats(g_jvm_);\n JNIEnv* env = ats.env();\n assert(env && \"Unsupported JNI version!\");\n CreateInstance(env);\n \/\/ Pre-store device specific values.\n SetLowLatencySupported(env);\n SetNativeOutputSampleRate(env);\n SetNativeFrameSize(env);\n}\n\nvoid AudioManagerJni::SetAndroidAudioDeviceObjects(void* jvm, void* env,\n void* context) {\n assert(jvm);\n assert(env);\n assert(context);\n\n \/\/ Store global Java VM variables to be accessed by API calls.\n g_jvm_ = reinterpret_cast<JavaVM*>(jvm);\n g_jni_env_ = reinterpret_cast<JNIEnv*>(env);\n g_context_ = g_jni_env_->NewGlobalRef(reinterpret_cast<jobject>(context));\n\n \/\/ FindClass must be made in this function since this function's contract\n \/\/ requires it to be called by a Java thread.\n \/\/ See\n \/\/ http:\/\/developer.android.com\/training\/articles\/perf-jni.html#faq_FindClass\n \/\/ as to why this is necessary.\n \/\/ Get the AudioManagerAndroid class object.\n jclass javaAmClassLocal = g_jni_env_->FindClass(\n \"org\/webrtc\/voiceengine\/AudioManagerAndroid\");\n assert(javaAmClassLocal);\n\n \/\/ Create a global reference such that the class object is not recycled by\n \/\/ the garbage collector.\n g_audio_manager_class_ = reinterpret_cast<jclass>(\n g_jni_env_->NewGlobalRef(javaAmClassLocal));\n assert(g_audio_manager_class_);\n}\n\nvoid AudioManagerJni::ClearAndroidAudioDeviceObjects() {\n g_jni_env_->DeleteGlobalRef(g_audio_manager_class_);\n g_audio_manager_class_ = NULL;\n g_jni_env_->DeleteGlobalRef(g_context_);\n g_context_ = NULL;\n g_jni_env_->DeleteGlobalRef(g_audio_manager_);\n g_audio_manager_ = NULL;\n g_jni_env_ = NULL;\n g_jvm_ = NULL;\n}\n\nvoid AudioManagerJni::SetLowLatencySupported(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env, \"isAudioLowLatencySupported\", \"()Z\");\n low_latency_supported_ = env->CallBooleanMethod(g_audio_manager_, id);\n}\n\nvoid AudioManagerJni::SetNativeOutputSampleRate(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env, \"getNativeOutputSampleRate\", \"()I\");\n native_output_sample_rate_ = env->CallIntMethod(g_audio_manager_, id);\n}\n\nvoid AudioManagerJni::SetNativeFrameSize(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env,\n \"getAudioLowLatencyOutputFrameSize\", \"()I\");\n native_buffer_size_ = env->CallIntMethod(g_audio_manager_, id);\n}\n\nbool AudioManagerJni::HasDeviceObjects() {\n return g_jvm_ && g_jni_env_ && g_context_ && g_audio_manager_class_;\n}\n\njmethodID AudioManagerJni::LookUpMethodId(JNIEnv* env,\n const char* method_name,\n const char* method_signature) {\n jmethodID ret_val = env->GetMethodID(g_audio_manager_class_, method_name,\n method_signature);\n assert(ret_val);\n return ret_val;\n}\n\nvoid AudioManagerJni::CreateInstance(JNIEnv* env) {\n \/\/ Get the method ID for the constructor taking Context.\n jmethodID id = LookUpMethodId(env, \"<init>\", \"(Landroid\/content\/Context;)V\");\n g_audio_manager_ = env->NewObject(g_audio_manager_class_, id, g_context_);\n \/\/ Create a global reference so that the instance is accessible until no\n \/\/ longer needed.\n g_audio_manager_ = env->NewGlobalRef(g_audio_manager_);\n assert(g_audio_manager_);\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Android OpenSL: Fixes faulty assertion in jni-code.<commit_after>\/*\n * Copyright (c) 2013 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"webrtc\/modules\/audio_device\/android\/audio_manager_jni.h\"\n\n#include <assert.h>\n\n#include \"webrtc\/system_wrappers\/interface\/trace.h\"\n\nnamespace {\n\nclass AttachThreadScoped {\n public:\n explicit AttachThreadScoped(JavaVM* jvm)\n : attached_(false), jvm_(jvm), env_(NULL) {\n jint ret_val = jvm->GetEnv(reinterpret_cast<void**>(&env_),\n REQUIRED_JNI_VERSION);\n if (ret_val == JNI_EDETACHED) {\n \/\/ Attach the thread to the Java VM.\n ret_val = jvm_->AttachCurrentThread(&env_, NULL);\n attached_ = ret_val == JNI_OK;\n assert(attached_);\n }\n }\n ~AttachThreadScoped() {\n if (attached_ && (jvm_->DetachCurrentThread() < 0)) {\n assert(false);\n }\n }\n\n JNIEnv* env() { return env_; }\n\n private:\n bool attached_;\n JavaVM* jvm_;\n JNIEnv* env_;\n};\n\n} \/\/ namespace\n\nnamespace webrtc {\n\nstatic JavaVM* g_jvm_ = NULL;\nstatic JNIEnv* g_jni_env_ = NULL;\nstatic jobject g_context_ = NULL;\nstatic jclass g_audio_manager_class_ = NULL;\nstatic jobject g_audio_manager_ = NULL;\n\nAudioManagerJni::AudioManagerJni()\n : low_latency_supported_(false),\n native_output_sample_rate_(0),\n native_buffer_size_(0) {\n if (!HasDeviceObjects()) {\n assert(false);\n }\n AttachThreadScoped ats(g_jvm_);\n JNIEnv* env = ats.env();\n assert(env && \"Unsupported JNI version!\");\n CreateInstance(env);\n \/\/ Pre-store device specific values.\n SetLowLatencySupported(env);\n SetNativeOutputSampleRate(env);\n SetNativeFrameSize(env);\n}\n\nvoid AudioManagerJni::SetAndroidAudioDeviceObjects(void* jvm, void* env,\n void* context) {\n assert(jvm);\n assert(env);\n assert(context);\n\n \/\/ Store global Java VM variables to be accessed by API calls.\n g_jvm_ = reinterpret_cast<JavaVM*>(jvm);\n g_jni_env_ = reinterpret_cast<JNIEnv*>(env);\n g_context_ = g_jni_env_->NewGlobalRef(reinterpret_cast<jobject>(context));\n\n \/\/ FindClass must be made in this function since this function's contract\n \/\/ requires it to be called by a Java thread.\n \/\/ See\n \/\/ http:\/\/developer.android.com\/training\/articles\/perf-jni.html#faq_FindClass\n \/\/ as to why this is necessary.\n \/\/ Get the AudioManagerAndroid class object.\n jclass javaAmClassLocal = g_jni_env_->FindClass(\n \"org\/webrtc\/voiceengine\/AudioManagerAndroid\");\n assert(javaAmClassLocal);\n\n \/\/ Create a global reference such that the class object is not recycled by\n \/\/ the garbage collector.\n g_audio_manager_class_ = reinterpret_cast<jclass>(\n g_jni_env_->NewGlobalRef(javaAmClassLocal));\n assert(g_audio_manager_class_);\n}\n\nvoid AudioManagerJni::ClearAndroidAudioDeviceObjects() {\n g_jni_env_->DeleteGlobalRef(g_audio_manager_class_);\n g_audio_manager_class_ = NULL;\n g_jni_env_->DeleteGlobalRef(g_context_);\n g_context_ = NULL;\n g_jni_env_->DeleteGlobalRef(g_audio_manager_);\n g_audio_manager_ = NULL;\n g_jni_env_ = NULL;\n g_jvm_ = NULL;\n}\n\nvoid AudioManagerJni::SetLowLatencySupported(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env, \"isAudioLowLatencySupported\", \"()Z\");\n low_latency_supported_ = env->CallBooleanMethod(g_audio_manager_, id);\n}\n\nvoid AudioManagerJni::SetNativeOutputSampleRate(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env, \"getNativeOutputSampleRate\", \"()I\");\n native_output_sample_rate_ = env->CallIntMethod(g_audio_manager_, id);\n}\n\nvoid AudioManagerJni::SetNativeFrameSize(JNIEnv* env) {\n jmethodID id = LookUpMethodId(env,\n \"getAudioLowLatencyOutputFrameSize\", \"()I\");\n native_buffer_size_ = env->CallIntMethod(g_audio_manager_, id);\n}\n\nbool AudioManagerJni::HasDeviceObjects() {\n return g_jvm_ && g_jni_env_ && g_context_ && g_audio_manager_class_;\n}\n\njmethodID AudioManagerJni::LookUpMethodId(JNIEnv* env,\n const char* method_name,\n const char* method_signature) {\n jmethodID ret_val = env->GetMethodID(g_audio_manager_class_, method_name,\n method_signature);\n assert(ret_val);\n return ret_val;\n}\n\nvoid AudioManagerJni::CreateInstance(JNIEnv* env) {\n \/\/ Get the method ID for the constructor taking Context.\n jmethodID id = LookUpMethodId(env, \"<init>\", \"(Landroid\/content\/Context;)V\");\n g_audio_manager_ = env->NewObject(g_audio_manager_class_, id, g_context_);\n \/\/ Create a global reference so that the instance is accessible until no\n \/\/ longer needed.\n g_audio_manager_ = env->NewGlobalRef(g_audio_manager_);\n assert(g_audio_manager_);\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Set ITS chi2 in the coverion from AliVTrack to AliESDtrack<commit_after><|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\\\n * ANALYSIS PERFORMANCE TOOLS *\n * libparaver-api *\n * API Library for libparaver-kernel *\n *****************************************************************************\n * ___ This library is free software; you can redistribute it and\/or *\n * \/ __ modify it under the terms of the GNU LGPL as published *\n * \/ \/ _____ by the Free Software Foundation; either version 2.1 *\n * \/ \/ \/ \\ of the License, or (at your option) any later version. *\n * ( ( ( B S C ) *\n * \\ \\ \\_____\/ This library is distributed in hope that it will be *\n * \\ \\__ useful but WITHOUT ANY WARRANTY; without even the *\n * \\___ implied warranty of MERCHANTABILITY or FITNESS FOR A *\n * PARTICULAR PURPOSE. See the GNU LGPL for more details. *\n * *\n * You should have received a copy of the GNU Lesser General Public License *\n * along with this library; if not, write to the Free Software Foundation, *\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *\n * The GNU LEsser General Public License is contained in the file COPYING. *\n * --------- *\n * Barcelona Supercomputing Center - Centro Nacional de Supercomputacion *\n\\*****************************************************************************\/\n\n#include \"workspace.h\"\n\nusing std::string;\nusing std::vector;\nusing std::pair;\n\nWorkspace::Workspace()\n{\n}\n\nWorkspace::~Workspace()\n{\n}\n\nstring Workspace::getName() const\n{\n return name;\n}\n\nWorkspaceValue::WorkspaceType Workspace::getType() const\n{\n return myType;\n}\n\nvector<WorkspaceValue> Workspace::getAutoTypes() const\n{\n return autoTypes;\n}\n\nvector<pair<string,string> > Workspace::getHintCFGs() const\n{\n return hintCFGs;\n}\n\npair<string,string> Workspace::getHintCFG( size_t whichHint ) const\n{\n return hintCFGs[ whichHint ];\n}\n\nvoid Workspace::setName( string& whichName )\n{\n name = whichName;\n}\n\nvoid Workspace::setType( WorkspaceValue::WorkspaceType whichType )\n{\n myType = whichType;\n for( vector<WorkspaceValue>::iterator it = autoTypes.begin(); it != autoTypes.end(); ++it )\n it->myType = whichType;\n}\n\nvoid Workspace::setAutoTypes( vector<WorkspaceValue>& whichAutoTypes )\n{\n autoTypes = whichAutoTypes;\n}\n\nvoid Workspace::addHintCFG( pair<string,string>& whichCFG )\n{\n hintCFGs.push_back( whichCFG );\n}\n\nvoid Workspace::addHintCFG( size_t position, pair<string,string>& whichCFG )\n{\n hintCFGs.insert( hintCFGs.begin() + position, whichCFG );\n}\n\nvoid Workspace::removeHintCFG( size_t whichHint )\n{\n hintCFGs.erase( hintCFGs.begin() + whichHint );\n}\n\nvoid Workspace::modifyHintCFG( size_t position, pair<string,string>& whichCFG )\n{\n hintCFGs[ position ] = whichCFG;\n}\n\nvoid Workspace::clearHintCFGs()\n{\n hintCFGs.clear();\n}\n\n\n\/\/ load\/save XML for import\/export certain workspaces\n\nvoid Workspace::loadXML( std::string &wsDir )\n{\n \/\/ Read user defined\n std::ifstream ifs( wsDir );\n \/\/ifs.open( wsDir );\n if( ifs.good() ) \/\/ due to xml_iarchive needs to be destroyed before fstream is closed\n {\n boost::archive::xml_iarchive ia( ifs );\n ia >> boost::serialization::make_nvp( \"workspace\", *this );\n }\n ifs.close();\n}\n\n\nvoid Workspace::saveXML( std::string &wsDir )\n{\n std::ofstream ofs( wsDir );\n if( ofs.good() ) \/\/ due to xml_oarchive needs to be destroyed before fstream is closed\n {\n boost::archive::xml_oarchive oa( ofs );\n oa << boost::serialization::make_nvp( \"workspace\", *this );\n }\n ofs.close();\n}\n<commit_msg>Fixed compatibility constructor for fstream<commit_after>\/*****************************************************************************\\\n * ANALYSIS PERFORMANCE TOOLS *\n * libparaver-api *\n * API Library for libparaver-kernel *\n *****************************************************************************\n * ___ This library is free software; you can redistribute it and\/or *\n * \/ __ modify it under the terms of the GNU LGPL as published *\n * \/ \/ _____ by the Free Software Foundation; either version 2.1 *\n * \/ \/ \/ \\ of the License, or (at your option) any later version. *\n * ( ( ( B S C ) *\n * \\ \\ \\_____\/ This library is distributed in hope that it will be *\n * \\ \\__ useful but WITHOUT ANY WARRANTY; without even the *\n * \\___ implied warranty of MERCHANTABILITY or FITNESS FOR A *\n * PARTICULAR PURPOSE. See the GNU LGPL for more details. *\n * *\n * You should have received a copy of the GNU Lesser General Public License *\n * along with this library; if not, write to the Free Software Foundation, *\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA *\n * The GNU LEsser General Public License is contained in the file COPYING. *\n * --------- *\n * Barcelona Supercomputing Center - Centro Nacional de Supercomputacion *\n\\*****************************************************************************\/\n\n#include \"workspace.h\"\n\nusing std::string;\nusing std::vector;\nusing std::pair;\n\nWorkspace::Workspace()\n{\n}\n\nWorkspace::~Workspace()\n{\n}\n\nstring Workspace::getName() const\n{\n return name;\n}\n\nWorkspaceValue::WorkspaceType Workspace::getType() const\n{\n return myType;\n}\n\nvector<WorkspaceValue> Workspace::getAutoTypes() const\n{\n return autoTypes;\n}\n\nvector<pair<string,string> > Workspace::getHintCFGs() const\n{\n return hintCFGs;\n}\n\npair<string,string> Workspace::getHintCFG( size_t whichHint ) const\n{\n return hintCFGs[ whichHint ];\n}\n\nvoid Workspace::setName( string& whichName )\n{\n name = whichName;\n}\n\nvoid Workspace::setType( WorkspaceValue::WorkspaceType whichType )\n{\n myType = whichType;\n for( vector<WorkspaceValue>::iterator it = autoTypes.begin(); it != autoTypes.end(); ++it )\n it->myType = whichType;\n}\n\nvoid Workspace::setAutoTypes( vector<WorkspaceValue>& whichAutoTypes )\n{\n autoTypes = whichAutoTypes;\n}\n\nvoid Workspace::addHintCFG( pair<string,string>& whichCFG )\n{\n hintCFGs.push_back( whichCFG );\n}\n\nvoid Workspace::addHintCFG( size_t position, pair<string,string>& whichCFG )\n{\n hintCFGs.insert( hintCFGs.begin() + position, whichCFG );\n}\n\nvoid Workspace::removeHintCFG( size_t whichHint )\n{\n hintCFGs.erase( hintCFGs.begin() + whichHint );\n}\n\nvoid Workspace::modifyHintCFG( size_t position, pair<string,string>& whichCFG )\n{\n hintCFGs[ position ] = whichCFG;\n}\n\nvoid Workspace::clearHintCFGs()\n{\n hintCFGs.clear();\n}\n\n\n\/\/ load\/save XML for import\/export certain workspaces\n\nvoid Workspace::loadXML( std::string &wsDir )\n{\n \/\/ Read user defined\n std::ifstream ifs( wsDir.c_str() );\n \/\/ifs.open( wsDir );\n if( ifs.good() ) \/\/ due to xml_iarchive needs to be destroyed before fstream is closed\n {\n boost::archive::xml_iarchive ia( ifs );\n ia >> boost::serialization::make_nvp( \"workspace\", *this );\n }\n ifs.close();\n}\n\n\nvoid Workspace::saveXML( std::string &wsDir )\n{\n std::ofstream ofs( wsDir.c_str() );\n if( ofs.good() ) \/\/ due to xml_oarchive needs to be destroyed before fstream is closed\n {\n boost::archive::xml_oarchive oa( ofs );\n oa << boost::serialization::make_nvp( \"workspace\", *this );\n }\n ofs.close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Copyright (C) 2011-2013 Michael Krufky\n *\n * Author: Michael Krufky <mkrufky@linuxtv.org>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#include <inttypes.h>\n#include \"string.h\"\n\n#include \"stats.h\"\n#include \"log.h\"\n#define CLASS_MODULE \"stats\"\n\n#define DBG 0\n\n#define dprintf(fmt, arg...) __dprintf(DBG_STATS, \"(%s) \"fmt, parent, ##arg)\n\nstats::stats(const char *caller)\n : tei_count(0)\n , __timenow(0)\n , parent(caller)\n , streamtime_cb(NULL)\n , streamtime_priv(NULL)\n , statistics_cb(NULL)\n , statistics_priv(NULL)\n{\n\tdprintf(\"(%s)\", parent);\n}\n\nstats::~stats()\n{\n\tdprintf(\"(%s)\", parent);\n\tshow(false);\n}\n\n#if 0\nstats::stats(const stats&)\n{\n\tdprintf(\"(%s, copy)\", parent);\n}\n\nstats& stats::operator= (const stats& cSource)\n{\n\tdprintf(\"(%s, operator=)\", parent);\n\n\tif (this == &cSource)\n\t\treturn *this;\n\n\treturn *this;\n}\n#endif\n\nstatic void parse_pcr(uint8_t *pcr, uint64_t *pcr_base, unsigned int *pcr_ext)\n{\n\t*pcr_base = ((uint64_t)pcr[0] * 0x2000000) +\n\t\t ((uint64_t)pcr[1] * 0x20000) +\n\t\t ((uint64_t)pcr[2] * 0x200) +\n\t\t ((uint64_t)pcr[3] * 0x02) +\n\t\t ((uint64_t)(pcr[4] & 0x80) >> 7);\n\n\t*pcr_ext = ((pcr[4] & 0x01) * 0x100) + pcr[5];\n\n\treturn;\n}\n\nstatic time_t walltime(void *p) { (void)p; return time(NULL); }\n\nchar *stats_scale_unit(char *b, size_t n, uint64_t x)\n{\n\tmemset(b, 0, n);\n\n\tif (x >= 1000000) {\n\t\tif ((x % 1000000) < 100)\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" m\", x \/ 1000000, x % 1000000);\n\t\telse\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" m\", x \/ 1000000, x % 1000000);\n\t} else if (x >= 1000) {\n\t\tif ((x % 1000) < 100)\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" k\", x \/ 1000, x % 1000);\n\t\telse\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" k\", x \/ 1000, x % 1000);\n\t} else\n\t\tsnprintf(b, n, \" %3\" PRIu64 \" \", x);\n\treturn b;\n}\n\nvoid stats::show(bool per_sec)\n{\n\tif (statistics_cb) {\n\t\tstatistics_cb(statistics_priv, statistics, discontinuities, tei_count, per_sec);\n\t\treturn;\n\t}\n\tfor (stats_map::const_iterator iter = statistics.begin(); iter != statistics.end(); ++iter) {\n\t\tchar a[16];\n\t\tchar b[16];\n\t\tdprintf(\"pid %04x %5\" PRIu64 \" p%s %sb%s %sbit\",\n\t\t\titer->first, iter->second \/ 188, (per_sec) ? \"\/s\" : \"\",\n\t\t\tstats_scale_unit(a, sizeof(a), iter->second), (per_sec) ? \"\/s\" : \"\",\n\t\t\tstats_scale_unit(b, sizeof(b), iter->second * 8));\n\t}\n\tfor (stats_map::const_iterator iter = discontinuities.begin(); iter != discontinuities.end(); ++iter)\n\t\tdprintf(\"pid %04x\\t%\" PRIu64 \" continuity errors (%\" PRIu64 \"%%)\", iter->first, iter->second, ((!iter->second) || (!statistics[iter->first])) ? 0 : (!statistics.count(iter->first)) ? 0 : (100 * iter->second \/ (statistics[iter->first] \/ 188)));\n\n\tif (tei_count) dprintf(\"tei count: %\" PRIu64 \" (%\" PRIu64 \"%%)\", tei_count, (!statistics[0x2000]) ? 0 : (18800 * tei_count \/ statistics[0x2000]));\n}\n\nvoid stats::push_pid(int c, const uint16_t pid)\n{\n\tstreamtime_callback cb = (streamtime_cb) ? streamtime_cb : &walltime;\n\ttime_t timenow = cb(streamtime_priv);\n\n\tif (timenow > __timenow) {\n\t\tshow();\n\t\tclear_stats();\n\t\t__timenow = timenow;\n\t}\n\n\t__push_pid(c, pid);\n}\n\npkt_stats_t *stats::parse(const uint8_t *p, pkt_stats_t *pkt_stats)\n{\n\tadaptation_field_t adapt;\n\tpkt_hdr_t hdr;\n\n\treturn parse(p, pkt_stats, hdr, adapt);\n}\n\npkt_stats_t *stats::parse(const uint8_t *p, pkt_stats_t *pkt_stats, pkt_hdr_t &hdr, adaptation_field_t &adapt)\n{\n\tif (pkt_stats) {\n\t\tmemset(pkt_stats, 0, sizeof(pkt_stats_t));\n\n\t\tconst uint8_t *q = p;\n\n\t\tmemset(&adapt, 0, sizeof(adapt));\n\t\tmemset(&hdr, 0, sizeof(hdr));\n\n\t\thdr.sync_byte = q[0];\n\t\thdr.tei = (q[1] & 0x80) >> 7;\n\t\thdr.payload_unit_start = (q[1] & 0x40) >> 6;\n\t\thdr.transport_priority = (q[1] & 0x20) >> 5;\n\t\thdr.pid = ((q[1] & 0x1f) << 8) | q[2];\n\t\thdr.scrambling = (q[3] & 0xc0) >> 6;\n\t\thdr.adaptation_flags = (q[3] & 0x30) >> 4;\n\t\thdr.continuity_ctr = (q[3] & 0x0f);\n\n\t\tif (hdr.adaptation_flags & 0x02) {\n\t\t\tq += 4;\n\t\t\tadapt.field_length = q[0];\n\t\t\tadapt.discontinuity = (q[1] & 0x80) >> 7;\n\t\t\tadapt.random_access = (q[1] & 0x40) >> 6; \/* set to 1 if the PES pkt in this TS pkt starts an a\/v sequence *\/\n\t\t\tadapt.es_priority = (q[1] & 0x20) >> 5;\n\t\t\tadapt.pcr = (q[1] & 0x10) >> 4;\n\t\t\tadapt.opcr = (q[1] & 0x08) >> 3;\n\t\t\tadapt.splicing_point = (q[1] & 0x04) >> 2;\n\t\t\tadapt.tp_priv_data = (q[1] & 0x02) >> 1;\n\t\t\tadapt.field_ext = (q[1] & 0x01) >> 0;\n\n\t\t\tif (adapt.pcr) {\n\t\t\t\tmemcpy(adapt.PCR, &q[2], 6);\n\t\t\t\tq += 6;\n\t\t\t}\n\t\t\tif (adapt.opcr) {\n\t\t\t\tmemcpy(adapt.OPCR, &q[2], 6);\n\t\t\t\tq += 6;\n\t\t\t}\n\t\t\tif (adapt.splicing_point) {\n\t\t\t\tadapt.splicing_countdown = q[2];\n\t\t\t\tq ++;\n\t\t\t}\n\t\t}\n\n\t\tpkt_stats->sync_loss = (hdr.sync_byte != 0x47) ? true : false;\n\t\tif (!pkt_stats->sync_loss) {\n\t\t\tpkt_stats->tei = (hdr.tei) ? true : false;\n\t\t\tpkt_stats->pid = hdr.pid;\n\t\t} else\n\t\t\tpkt_stats->pid = (uint16_t) - 1;\n\t}\n\treturn pkt_stats;\n}\n\nvoid stats::clear_stats()\n{\n\tstatistics.clear();\n\tdiscontinuities.clear();\n\tlast_pcr_base.clear();\n\ttei_count = 0;\n}\n\nvoid stats::push_stats(pkt_stats_t *pkt_stats)\n{\n\tif (pkt_stats->tei) {\n\t\ttei_count++;\n\t\tpush_pid((uint16_t) - 1);\n\t} else\n\t\tpush_pid(pkt_stats->pid);\n}\n\nvoid stats::push(const uint8_t *p, pkt_stats_t *pkt_stats)\n{\n\tadaptation_field_t adapt;\n\tpkt_hdr_t hdr;\n\n\tif (!pkt_stats) {\n\t\t__push(p);\n\t\treturn;\n\t}\n\n\tmemset(pkt_stats, 0, sizeof(pkt_stats_t));\n\n\tparse(p, pkt_stats, hdr, adapt);\n\n\tif (hdr.adaptation_flags & 0x01) {\/\/ payload present\n\t\tif (continuity.count(hdr.pid)) {\n\t\t\tuint8_t next = (continuity[hdr.pid] + 1) & 0x0f;\n\t\t\tif ((next != (hdr.continuity_ctr & 0x0f)) && (hdr.continuity_ctr + continuity[hdr.pid] > 0)) {\n\t\t\t\tif (!(hdr.adaptation_flags & 0x02) && (adapt.discontinuity)) {\n\t\t\t\t\tpush_discontinuity(hdr.pid);\n#if DBG\n\t\t\t\t\tdprintf(\"CONTINUITY ERROR pid: %04x cur: 0x%x prev 0x%x\", hdr.pid, hdr.continuity_ctr, continuity[hdr.pid]);\n#endif\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcontinuity[hdr.pid] = hdr.continuity_ctr;\n\t}\n\n\tif (hdr.adaptation_flags & 0x02) {\n\t\tif (adapt.pcr) {\n\t\t\tuint64_t pcr_base;\n\t\t\tunsigned int pcr_ext;\n\n\t\t\tparse_pcr(adapt.PCR, &pcr_base, &pcr_ext);\n\t\t\tdprintf(\"PID: 0x%04x, PCR base: %\" PRIu64 \", ext: %d\", hdr.pid, pcr_base, pcr_ext);\n\n\t\t\tstats_map::const_iterator iter = last_pcr_base.find(hdr.pid);\n#if DBG\n\t\t\tif ((iter != last_pcr_base.end()) && (pcr_base < iter->second))\n\t\t\t\tfprintf(stderr, \"%s: PID: 0x%04x, %\" PRIu64 \" < %\" PRIu64 \" !!!\\n\",\n\t\t\t\t\t__func__, hdr.pid, pcr_base, iter->second);\n#endif\n\t\t\tlast_pcr_base[hdr.pid] = pcr_base;\n\t\t}\n\t\tif (adapt.opcr) {\n\t\t\tuint64_t pcr_base;\n\t\t\tunsigned int pcr_ext;\n\n\t\t\tparse_pcr(adapt.OPCR, &pcr_base, &pcr_ext);\n\t\t\tdprintf(\"PID: 0x%04x, PCR base: %\" PRIu64 \", ext: %d\", hdr.pid, pcr_base, pcr_ext);\n\t\t}\n\t\tif (adapt.splicing_point) {\n\t\t\tdprintf(\"PID: 0x%04x, splicing countdown: %d\", hdr.pid, adapt.splicing_countdown);\n\t\t}\n\t}\n\n\tpush_stats(pkt_stats);\n}\n<commit_msg>stats: fix warning: unused variable 'iter' [-Wunused-variable]<commit_after>\/*****************************************************************************\n * Copyright (C) 2011-2013 Michael Krufky\n *\n * Author: Michael Krufky <mkrufky@linuxtv.org>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#include <inttypes.h>\n#include \"string.h\"\n\n#include \"stats.h\"\n#include \"log.h\"\n#define CLASS_MODULE \"stats\"\n\n#define DBG 0\n\n#define dprintf(fmt, arg...) __dprintf(DBG_STATS, \"(%s) \"fmt, parent, ##arg)\n\nstats::stats(const char *caller)\n : tei_count(0)\n , __timenow(0)\n , parent(caller)\n , streamtime_cb(NULL)\n , streamtime_priv(NULL)\n , statistics_cb(NULL)\n , statistics_priv(NULL)\n{\n\tdprintf(\"(%s)\", parent);\n}\n\nstats::~stats()\n{\n\tdprintf(\"(%s)\", parent);\n\tshow(false);\n}\n\n#if 0\nstats::stats(const stats&)\n{\n\tdprintf(\"(%s, copy)\", parent);\n}\n\nstats& stats::operator= (const stats& cSource)\n{\n\tdprintf(\"(%s, operator=)\", parent);\n\n\tif (this == &cSource)\n\t\treturn *this;\n\n\treturn *this;\n}\n#endif\n\nstatic void parse_pcr(uint8_t *pcr, uint64_t *pcr_base, unsigned int *pcr_ext)\n{\n\t*pcr_base = ((uint64_t)pcr[0] * 0x2000000) +\n\t\t ((uint64_t)pcr[1] * 0x20000) +\n\t\t ((uint64_t)pcr[2] * 0x200) +\n\t\t ((uint64_t)pcr[3] * 0x02) +\n\t\t ((uint64_t)(pcr[4] & 0x80) >> 7);\n\n\t*pcr_ext = ((pcr[4] & 0x01) * 0x100) + pcr[5];\n\n\treturn;\n}\n\nstatic time_t walltime(void *p) { (void)p; return time(NULL); }\n\nchar *stats_scale_unit(char *b, size_t n, uint64_t x)\n{\n\tmemset(b, 0, n);\n\n\tif (x >= 1000000) {\n\t\tif ((x % 1000000) < 100)\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" m\", x \/ 1000000, x % 1000000);\n\t\telse\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" m\", x \/ 1000000, x % 1000000);\n\t} else if (x >= 1000) {\n\t\tif ((x % 1000) < 100)\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" k\", x \/ 1000, x % 1000);\n\t\telse\n\t\t\tsnprintf(b, n, \"%3\" PRIu64 \".%03\" PRIu64 \" k\", x \/ 1000, x % 1000);\n\t} else\n\t\tsnprintf(b, n, \" %3\" PRIu64 \" \", x);\n\treturn b;\n}\n\nvoid stats::show(bool per_sec)\n{\n\tif (statistics_cb) {\n\t\tstatistics_cb(statistics_priv, statistics, discontinuities, tei_count, per_sec);\n\t\treturn;\n\t}\n\tfor (stats_map::const_iterator iter = statistics.begin(); iter != statistics.end(); ++iter) {\n\t\tchar a[16];\n\t\tchar b[16];\n\t\tdprintf(\"pid %04x %5\" PRIu64 \" p%s %sb%s %sbit\",\n\t\t\titer->first, iter->second \/ 188, (per_sec) ? \"\/s\" : \"\",\n\t\t\tstats_scale_unit(a, sizeof(a), iter->second), (per_sec) ? \"\/s\" : \"\",\n\t\t\tstats_scale_unit(b, sizeof(b), iter->second * 8));\n\t}\n\tfor (stats_map::const_iterator iter = discontinuities.begin(); iter != discontinuities.end(); ++iter)\n\t\tdprintf(\"pid %04x\\t%\" PRIu64 \" continuity errors (%\" PRIu64 \"%%)\", iter->first, iter->second, ((!iter->second) || (!statistics[iter->first])) ? 0 : (!statistics.count(iter->first)) ? 0 : (100 * iter->second \/ (statistics[iter->first] \/ 188)));\n\n\tif (tei_count) dprintf(\"tei count: %\" PRIu64 \" (%\" PRIu64 \"%%)\", tei_count, (!statistics[0x2000]) ? 0 : (18800 * tei_count \/ statistics[0x2000]));\n}\n\nvoid stats::push_pid(int c, const uint16_t pid)\n{\n\tstreamtime_callback cb = (streamtime_cb) ? streamtime_cb : &walltime;\n\ttime_t timenow = cb(streamtime_priv);\n\n\tif (timenow > __timenow) {\n\t\tshow();\n\t\tclear_stats();\n\t\t__timenow = timenow;\n\t}\n\n\t__push_pid(c, pid);\n}\n\npkt_stats_t *stats::parse(const uint8_t *p, pkt_stats_t *pkt_stats)\n{\n\tadaptation_field_t adapt;\n\tpkt_hdr_t hdr;\n\n\treturn parse(p, pkt_stats, hdr, adapt);\n}\n\npkt_stats_t *stats::parse(const uint8_t *p, pkt_stats_t *pkt_stats, pkt_hdr_t &hdr, adaptation_field_t &adapt)\n{\n\tif (pkt_stats) {\n\t\tmemset(pkt_stats, 0, sizeof(pkt_stats_t));\n\n\t\tconst uint8_t *q = p;\n\n\t\tmemset(&adapt, 0, sizeof(adapt));\n\t\tmemset(&hdr, 0, sizeof(hdr));\n\n\t\thdr.sync_byte = q[0];\n\t\thdr.tei = (q[1] & 0x80) >> 7;\n\t\thdr.payload_unit_start = (q[1] & 0x40) >> 6;\n\t\thdr.transport_priority = (q[1] & 0x20) >> 5;\n\t\thdr.pid = ((q[1] & 0x1f) << 8) | q[2];\n\t\thdr.scrambling = (q[3] & 0xc0) >> 6;\n\t\thdr.adaptation_flags = (q[3] & 0x30) >> 4;\n\t\thdr.continuity_ctr = (q[3] & 0x0f);\n\n\t\tif (hdr.adaptation_flags & 0x02) {\n\t\t\tq += 4;\n\t\t\tadapt.field_length = q[0];\n\t\t\tadapt.discontinuity = (q[1] & 0x80) >> 7;\n\t\t\tadapt.random_access = (q[1] & 0x40) >> 6; \/* set to 1 if the PES pkt in this TS pkt starts an a\/v sequence *\/\n\t\t\tadapt.es_priority = (q[1] & 0x20) >> 5;\n\t\t\tadapt.pcr = (q[1] & 0x10) >> 4;\n\t\t\tadapt.opcr = (q[1] & 0x08) >> 3;\n\t\t\tadapt.splicing_point = (q[1] & 0x04) >> 2;\n\t\t\tadapt.tp_priv_data = (q[1] & 0x02) >> 1;\n\t\t\tadapt.field_ext = (q[1] & 0x01) >> 0;\n\n\t\t\tif (adapt.pcr) {\n\t\t\t\tmemcpy(adapt.PCR, &q[2], 6);\n\t\t\t\tq += 6;\n\t\t\t}\n\t\t\tif (adapt.opcr) {\n\t\t\t\tmemcpy(adapt.OPCR, &q[2], 6);\n\t\t\t\tq += 6;\n\t\t\t}\n\t\t\tif (adapt.splicing_point) {\n\t\t\t\tadapt.splicing_countdown = q[2];\n\t\t\t\tq ++;\n\t\t\t}\n\t\t}\n\n\t\tpkt_stats->sync_loss = (hdr.sync_byte != 0x47) ? true : false;\n\t\tif (!pkt_stats->sync_loss) {\n\t\t\tpkt_stats->tei = (hdr.tei) ? true : false;\n\t\t\tpkt_stats->pid = hdr.pid;\n\t\t} else\n\t\t\tpkt_stats->pid = (uint16_t) - 1;\n\t}\n\treturn pkt_stats;\n}\n\nvoid stats::clear_stats()\n{\n\tstatistics.clear();\n\tdiscontinuities.clear();\n\tlast_pcr_base.clear();\n\ttei_count = 0;\n}\n\nvoid stats::push_stats(pkt_stats_t *pkt_stats)\n{\n\tif (pkt_stats->tei) {\n\t\ttei_count++;\n\t\tpush_pid((uint16_t) - 1);\n\t} else\n\t\tpush_pid(pkt_stats->pid);\n}\n\nvoid stats::push(const uint8_t *p, pkt_stats_t *pkt_stats)\n{\n\tadaptation_field_t adapt;\n\tpkt_hdr_t hdr;\n\n\tif (!pkt_stats) {\n\t\t__push(p);\n\t\treturn;\n\t}\n\n\tmemset(pkt_stats, 0, sizeof(pkt_stats_t));\n\n\tparse(p, pkt_stats, hdr, adapt);\n\n\tif (hdr.adaptation_flags & 0x01) {\/\/ payload present\n\t\tif (continuity.count(hdr.pid)) {\n\t\t\tuint8_t next = (continuity[hdr.pid] + 1) & 0x0f;\n\t\t\tif ((next != (hdr.continuity_ctr & 0x0f)) && (hdr.continuity_ctr + continuity[hdr.pid] > 0)) {\n\t\t\t\tif (!(hdr.adaptation_flags & 0x02) && (adapt.discontinuity)) {\n\t\t\t\t\tpush_discontinuity(hdr.pid);\n#if DBG\n\t\t\t\t\tdprintf(\"CONTINUITY ERROR pid: %04x cur: 0x%x prev 0x%x\", hdr.pid, hdr.continuity_ctr, continuity[hdr.pid]);\n#endif\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcontinuity[hdr.pid] = hdr.continuity_ctr;\n\t}\n\n\tif (hdr.adaptation_flags & 0x02) {\n\t\tif (adapt.pcr) {\n\t\t\tuint64_t pcr_base;\n\t\t\tunsigned int pcr_ext;\n\n\t\t\tparse_pcr(adapt.PCR, &pcr_base, &pcr_ext);\n\t\t\tdprintf(\"PID: 0x%04x, PCR base: %\" PRIu64 \", ext: %d\", hdr.pid, pcr_base, pcr_ext);\n\n#if DBG\n\t\t\tstats_map::const_iterator iter = last_pcr_base.find(hdr.pid);\n\t\t\tif ((iter != last_pcr_base.end()) && (pcr_base < iter->second))\n\t\t\t\tfprintf(stderr, \"%s: PID: 0x%04x, %\" PRIu64 \" < %\" PRIu64 \" !!!\\n\",\n\t\t\t\t\t__func__, hdr.pid, pcr_base, iter->second);\n#endif\n\t\t\tlast_pcr_base[hdr.pid] = pcr_base;\n\t\t}\n\t\tif (adapt.opcr) {\n\t\t\tuint64_t pcr_base;\n\t\t\tunsigned int pcr_ext;\n\n\t\t\tparse_pcr(adapt.OPCR, &pcr_base, &pcr_ext);\n\t\t\tdprintf(\"PID: 0x%04x, PCR base: %\" PRIu64 \", ext: %d\", hdr.pid, pcr_base, pcr_ext);\n\t\t}\n\t\tif (adapt.splicing_point) {\n\t\t\tdprintf(\"PID: 0x%04x, splicing countdown: %d\", hdr.pid, adapt.splicing_countdown);\n\t\t}\n\t}\n\n\tpush_stats(pkt_stats);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2012-2020 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/basegl\/processors\/volumeraycaster.h>\n#include <inviwo\/core\/io\/serialization\/serialization.h>\n#include <inviwo\/core\/io\/serialization\/versionconverter.h>\n#include <inviwo\/core\/interaction\/events\/keyboardevent.h>\n#include <modules\/opengl\/volume\/volumegl.h>\n#include <modules\/opengl\/texture\/textureunit.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/volume\/volumeutils.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/util\/rendercontext.h>\n#include <inviwo\/core\/algorithm\/boundingbox.h>\n\nnamespace inviwo {\n\nconst ProcessorInfo VolumeRaycaster::processorInfo_{\n \"org.inviwo.VolumeRaycaster\", \/\/ Class identifier\n \"Volume Raycaster\", \/\/ Display name\n \"Volume Rendering\", \/\/ Category\n CodeState::Stable, \/\/ Code state\n \"GL, DVR, Raycasting\" \/\/ Tags\n};\n\nVolumeRaycaster::VolumeRaycaster()\n : Processor()\n , shader_(\"raycasting.frag\", false)\n , volumePort_(\"volume\")\n , entryPort_(\"entry\")\n , exitPort_(\"exit\")\n , backgroundPort_(\"bg\")\n , outport_(\"outport\")\n , channel_(\"channel\", \"Render Channel\")\n , raycasting_(\"raycaster\", \"Raycasting\")\n , isotfComposite_(\"isotfComposite\", \"TF & Isovalues\", &volumePort_,\n InvalidationLevel::InvalidResources)\n , camera_(\"camera\", \"Camera\", util::boundingBox(volumePort_))\n , lighting_(\"lighting\", \"Lighting\", &camera_)\n , positionIndicator_(\"positionindicator\", \"Position Indicator\")\n , toggleShading_(\"toggleShading\", \"Toggle Shading\", [this](Event* e) { toggleShading(e); },\n IvwKey::L) {\n\n shader_.onReload([this]() { invalidate(InvalidationLevel::InvalidResources); });\n\n addPort(volumePort_, \"VolumePortGroup\");\n addPort(entryPort_, \"ImagePortGroup1\");\n addPort(exitPort_, \"ImagePortGroup1\");\n addPort(outport_, \"ImagePortGroup1\");\n addPort(backgroundPort_, \"ImagePortGroup1\");\n\n backgroundPort_.setOptional(true);\n\n channel_.addOption(\"Channel 1\", \"Channel 1\", 0);\n channel_.setSerializationMode(PropertySerializationMode::All);\n channel_.setCurrentStateAsDefault();\n\n volumePort_.onChange([this]() {\n if (volumePort_.hasData()) {\n size_t channels = volumePort_.getData()->getDataFormat()->getComponents();\n\n if (channels == channel_.size()) return;\n\n std::vector<OptionPropertyIntOption> channelOptions;\n for (size_t i = 0; i < channels; i++) {\n channelOptions.emplace_back(\"Channel \" + toString(i + 1),\n \"Channel \" + toString(i + 1), static_cast<int>(i));\n }\n channel_.replaceOptions(channelOptions);\n channel_.setCurrentStateAsDefault();\n }\n });\n backgroundPort_.onConnect([&]() { this->invalidate(InvalidationLevel::InvalidResources); });\n backgroundPort_.onDisconnect([&]() { this->invalidate(InvalidationLevel::InvalidResources); });\n\n \/\/ change the currently selected channel when a pre-computed gradient is selected\n raycasting_.gradientComputation_.onChange([this]() {\n if (channel_.size() == 4) {\n if (raycasting_.gradientComputation_.get() ==\n RaycastingProperty::GradientComputation::PrecomputedXYZ) {\n channel_.set(3);\n } else if (raycasting_.gradientComputation_.get() ==\n RaycastingProperty::GradientComputation::PrecomputedYZW) {\n channel_.set(0);\n }\n }\n });\n\n addProperty(channel_);\n addProperty(raycasting_);\n addProperty(isotfComposite_);\n\n addProperty(camera_);\n addProperty(lighting_);\n addProperty(positionIndicator_);\n addProperty(toggleShading_);\n}\n\nconst ProcessorInfo VolumeRaycaster::getProcessorInfo() const { return processorInfo_; }\n\nvoid VolumeRaycaster::initializeResources() {\n utilgl::addDefines(shader_, raycasting_, isotfComposite_, camera_, lighting_,\n positionIndicator_);\n utilgl::addShaderDefinesBGPort(shader_, backgroundPort_);\n shader_.build();\n}\n\nvoid VolumeRaycaster::process() {\n if (volumePort_.isChanged()) {\n auto newVolume = volumePort_.getData();\n\n if (newVolume->hasRepresentation<VolumeGL>()) {\n loadedVolume_ = newVolume;\n } else {\n dispatchPool([this, newVolume]() {\n RenderContext::getPtr()->activateLocalRenderContext();\n newVolume->getRep<kind::GL>();\n glFinish();\n dispatchFront([this, newVolume]() {\n loadedVolume_ = newVolume;\n invalidate(InvalidationLevel::InvalidOutput);\n });\n });\n }\n }\n\n if (!loadedVolume_) return;\n if (!loadedVolume_->hasRepresentation<VolumeGL>()) {\n LogWarn(\"No GL rep !!!\");\n return;\n }\n\n utilgl::activateAndClearTarget(outport_);\n shader_.activate();\n\n TextureUnitContainer units;\n utilgl::bindAndSetUniforms(shader_, units, *loadedVolume_, \"volume\");\n utilgl::bindAndSetUniforms(shader_, units, isotfComposite_);\n utilgl::bindAndSetUniforms(shader_, units, entryPort_, ImageType::ColorDepthPicking);\n utilgl::bindAndSetUniforms(shader_, units, exitPort_, ImageType::ColorDepth);\n if (backgroundPort_.hasData()) {\n utilgl::bindAndSetUniforms(shader_, units, backgroundPort_, ImageType::ColorDepthPicking);\n }\n utilgl::setUniforms(shader_, outport_, camera_, lighting_, raycasting_, positionIndicator_,\n channel_, isotfComposite_);\n\n utilgl::singleDrawImagePlaneRect();\n\n shader_.deactivate();\n utilgl::deactivateCurrentTarget();\n}\n\nvoid VolumeRaycaster::toggleShading(Event*) {\n if (lighting_.shadingMode_.get() == ShadingMode::None) {\n lighting_.shadingMode_.set(ShadingMode::Phong);\n } else {\n lighting_.shadingMode_.set(ShadingMode::None);\n }\n}\n\n\/\/ override to do member renaming.\nvoid VolumeRaycaster::deserialize(Deserializer& d) {\n util::renamePort(d, {{&entryPort_, \"entry-points\"}, {&exitPort_, \"exit-points\"}});\n Processor::deserialize(d);\n}\n\n} \/\/ namespace inviwo\n<commit_msg>BaseGL: minor refactor<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2012-2020 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/basegl\/processors\/volumeraycaster.h>\n#include <inviwo\/core\/io\/serialization\/serialization.h>\n#include <inviwo\/core\/io\/serialization\/versionconverter.h>\n#include <inviwo\/core\/interaction\/events\/keyboardevent.h>\n#include <modules\/opengl\/volume\/volumegl.h>\n#include <modules\/opengl\/texture\/textureunit.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/volume\/volumeutils.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/util\/rendercontext.h>\n#include <inviwo\/core\/algorithm\/boundingbox.h>\n\nnamespace inviwo {\n\nconst ProcessorInfo VolumeRaycaster::processorInfo_{\n \"org.inviwo.VolumeRaycaster\", \/\/ Class identifier\n \"Volume Raycaster\", \/\/ Display name\n \"Volume Rendering\", \/\/ Category\n CodeState::Stable, \/\/ Code state\n \"GL, DVR, Raycasting\" \/\/ Tags\n};\n\nVolumeRaycaster::VolumeRaycaster()\n : Processor()\n , shader_(\"raycasting.frag\", false)\n , volumePort_(\"volume\")\n , entryPort_(\"entry\")\n , exitPort_(\"exit\")\n , backgroundPort_(\"bg\")\n , outport_(\"outport\")\n , channel_(\"channel\", \"Render Channel\", {{\"Channel 1\", \"Channel 1\", 0}}, 0)\n , raycasting_(\"raycaster\", \"Raycasting\")\n , isotfComposite_(\"isotfComposite\", \"TF & Isovalues\", &volumePort_,\n InvalidationLevel::InvalidResources)\n , camera_(\"camera\", \"Camera\", util::boundingBox(volumePort_))\n , lighting_(\"lighting\", \"Lighting\", &camera_)\n , positionIndicator_(\"positionindicator\", \"Position Indicator\")\n , toggleShading_(\n \"toggleShading\", \"Toggle Shading\", [this](Event* e) { toggleShading(e); }, IvwKey::L) {\n\n shader_.onReload([this]() { invalidate(InvalidationLevel::InvalidResources); });\n\n addPort(volumePort_, \"VolumePortGroup\");\n addPort(entryPort_, \"ImagePortGroup1\");\n addPort(exitPort_, \"ImagePortGroup1\");\n addPort(outport_, \"ImagePortGroup1\");\n addPort(backgroundPort_, \"ImagePortGroup1\");\n\n backgroundPort_.setOptional(true);\n\n channel_.setSerializationMode(PropertySerializationMode::All);\n\n volumePort_.onChange([this]() {\n if (volumePort_.hasData()) {\n size_t channels = volumePort_.getData()->getDataFormat()->getComponents();\n\n if (channels == channel_.size()) return;\n\n std::vector<OptionPropertyIntOption> channelOptions;\n for (size_t i = 0; i < channels; i++) {\n channelOptions.emplace_back(\"Channel \" + toString(i + 1),\n \"Channel \" + toString(i + 1), static_cast<int>(i));\n }\n channel_.replaceOptions(channelOptions);\n channel_.setCurrentStateAsDefault();\n }\n });\n backgroundPort_.onConnect([&]() { this->invalidate(InvalidationLevel::InvalidResources); });\n backgroundPort_.onDisconnect([&]() { this->invalidate(InvalidationLevel::InvalidResources); });\n\n \/\/ change the currently selected channel when a pre-computed gradient is selected\n raycasting_.gradientComputation_.onChange([this]() {\n if (channel_.size() == 4) {\n if (raycasting_.gradientComputation_.get() ==\n RaycastingProperty::GradientComputation::PrecomputedXYZ) {\n channel_.set(3);\n } else if (raycasting_.gradientComputation_.get() ==\n RaycastingProperty::GradientComputation::PrecomputedYZW) {\n channel_.set(0);\n }\n }\n });\n\n addProperty(channel_);\n addProperty(raycasting_);\n addProperty(isotfComposite_);\n\n addProperty(camera_);\n addProperty(lighting_);\n addProperty(positionIndicator_);\n addProperty(toggleShading_);\n}\n\nconst ProcessorInfo VolumeRaycaster::getProcessorInfo() const { return processorInfo_; }\n\nvoid VolumeRaycaster::initializeResources() {\n utilgl::addDefines(shader_, raycasting_, isotfComposite_, camera_, lighting_,\n positionIndicator_);\n utilgl::addShaderDefinesBGPort(shader_, backgroundPort_);\n shader_.build();\n}\n\nvoid VolumeRaycaster::process() {\n if (volumePort_.isChanged()) {\n auto newVolume = volumePort_.getData();\n\n if (newVolume->hasRepresentation<VolumeGL>()) {\n loadedVolume_ = newVolume;\n } else {\n dispatchPool([this, newVolume]() {\n RenderContext::getPtr()->activateLocalRenderContext();\n newVolume->getRep<kind::GL>();\n glFinish();\n dispatchFront([this, newVolume]() {\n loadedVolume_ = newVolume;\n invalidate(InvalidationLevel::InvalidOutput);\n });\n });\n }\n }\n\n if (!loadedVolume_) return;\n if (!loadedVolume_->hasRepresentation<VolumeGL>()) {\n LogWarn(\"No GL rep !!!\");\n return;\n }\n\n utilgl::activateAndClearTarget(outport_);\n shader_.activate();\n\n TextureUnitContainer units;\n utilgl::bindAndSetUniforms(shader_, units, *loadedVolume_, \"volume\");\n utilgl::bindAndSetUniforms(shader_, units, isotfComposite_);\n utilgl::bindAndSetUniforms(shader_, units, entryPort_, ImageType::ColorDepthPicking);\n utilgl::bindAndSetUniforms(shader_, units, exitPort_, ImageType::ColorDepth);\n if (backgroundPort_.hasData()) {\n utilgl::bindAndSetUniforms(shader_, units, backgroundPort_, ImageType::ColorDepthPicking);\n }\n utilgl::setUniforms(shader_, outport_, camera_, lighting_, raycasting_, positionIndicator_,\n channel_, isotfComposite_);\n\n utilgl::singleDrawImagePlaneRect();\n\n shader_.deactivate();\n utilgl::deactivateCurrentTarget();\n}\n\nvoid VolumeRaycaster::toggleShading(Event*) {\n if (lighting_.shadingMode_.get() == ShadingMode::None) {\n lighting_.shadingMode_.set(ShadingMode::Phong);\n } else {\n lighting_.shadingMode_.set(ShadingMode::None);\n }\n}\n\n\/\/ override to do member renaming.\nvoid VolumeRaycaster::deserialize(Deserializer& d) {\n util::renamePort(d, {{&entryPort_, \"entry-points\"}, {&exitPort_, \"exit-points\"}});\n Processor::deserialize(d);\n}\n\n} \/\/ namespace inviwo\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include \"modules\/common\/math\/linear_quadratic_regulator.h\"\n#include \"modules\/common\/log.h\"\n\n#include \"Eigen\/Dense\"\n\nnamespace apollo {\nnamespace common {\nnamespace math {\n\nusing Matrix = Eigen::MatrixXd;\n\nvoid SolveLQRProblem(const Matrix &A, const Matrix &B, const Matrix &Q,\n const Matrix &R, const double tolerance,\n const uint max_num_iteration, Matrix *ptr_K) {\n if (A.rows() != A.cols() || B.rows() != A.rows() || Q.rows() != Q.cols() ||\n Q.rows() != A.rows() || R.rows() != R.cols() || R.rows() != B.cols()) {\n AERROR << \"One or more matrices have incompatible dimensions.\";\n return;\n }\n\n Matrix AT = A.transpose();\n Matrix BT = B.transpose();\n\n \/\/ Solves a discrete-time Algebraic Riccati equation (DARE)\n \/\/ Calculate Matrix Difference Riccati Equation, initialize P and Q\n Matrix P = Q;\n uint num_iteration = 0;\n double diff = 0.0;\n while (num_iteration++ < max_num_iteration) {\n Matrix P_next =\n AT * P * A - AT * P * B * (R + BT * P * B).inverse() * BT * P * A + Q;\n \/\/ check the difference between P and P_next\n diff = fabs((P_next - P).maxCoeff());\n P = P_next;\n\n if (diff < tolerance) {\n break;\n }\n }\n\n if (num_iteration >= max_num_iteration) {\n AWARN << \"lqr_not_convergence, last_diff_is:\" << diff;\n } else {\n ADEBUG << \"Number of iterations until convergence: \" << num_iteration\n << \", max difference: \" << diff;\n }\n *ptr_K = (R + BT * P * B).inverse() * BT * P * A;\n}\n\n} \/\/ namespace math\n} \/\/ namespace common\n} \/\/ namespace apollo\n<commit_msg>common: minor restructured LQR solver<commit_after>\/******************************************************************************\n * Copyright 2017 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include \"modules\/common\/math\/linear_quadratic_regulator.h\"\n#include \"modules\/common\/log.h\"\n\n#include \"Eigen\/Dense\"\n\nnamespace apollo {\nnamespace common {\nnamespace math {\n\nusing Matrix = Eigen::MatrixXd;\n\nvoid SolveLQRProblem(const Matrix &A, const Matrix &B, const Matrix &Q,\n const Matrix &R, const double tolerance,\n const uint max_num_iteration, Matrix *ptr_K) {\n if (A.rows() != A.cols() || B.rows() != A.rows() || Q.rows() != Q.cols() ||\n Q.rows() != A.rows() || R.rows() != R.cols() || R.rows() != B.cols()) {\n AERROR << \"LQR solver: one or more matrices have incompatible dimensions.\";\n return;\n }\n\n Matrix AT = A.transpose();\n Matrix BT = B.transpose();\n\n \/\/ Solves a discrete-time Algebraic Riccati equation (DARE)\n \/\/ Calculate Matrix Difference Riccati Equation, initialize P and Q\n Matrix P = Q;\n uint num_iteration = 0;\n double diff = std::numeric_limits<double>::max();\n while (num_iteration++ < max_num_iteration && diff > tolerance) {\n Matrix P_next =\n AT * P * A - AT * P * B * (R + BT * P * B).inverse() * BT * P * A + Q;\n \/\/ check the difference between P and P_next\n diff = fabs((P_next - P).maxCoeff());\n P = P_next;\n }\n\n if (num_iteration >= max_num_iteration) {\n AWARN << \"LQR solver cannot converge to a solution, \"\n \"last consecutive result diff. is:\" << diff;\n } else {\n ADEBUG << \"LQR solver converged at iteration: \" << num_iteration\n << \", max consecutive result diff.: \" << diff;\n }\n *ptr_K = (R + BT * P * B).inverse() * BT * P * A;\n}\n\n} \/\/ namespace math\n} \/\/ namespace common\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_MODULE \"test_read_observer\"\n\n#ifdef BOOST_TEST_DYN_LINK\n#include <boost\/test\/unit_test.hpp>\n#else\n#include <boost\/test\/included\/unit_test.hpp>\n#endif\n\n#include <mjolnir\/core\/BoundaryCondition.hpp>\n#include <mjolnir\/core\/SimulatorTraits.hpp>\n#include <mjolnir\/input\/read_observer.hpp>\n\nBOOST_AUTO_TEST_CASE(read_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 2u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\");\n\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(xyz));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 2u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\");\n\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(xyz));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n\n \/\/ XXX\n \/\/ The following block tests read_observer successfully adds a path before\n \/\/ the prefix. But it requires the directory `test` under WORKING_DIRECTORY.\n \/\/ It strongly depends on the directory structure...\n \/\/ It is not good. We need to find a way to avoid this dependency.\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/test\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n\n BOOST_TEST(obs.observers().size() == 2u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\/test\");\n\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(xyz));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n}\n\n\/\/ check that read_observer returns XYZObserver or not\nBOOST_AUTO_TEST_CASE(read_xyz_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 2u);\n\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(xyz));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n}\n\n\/\/ check that read_observer returns DCDObserver or not\nBOOST_AUTO_TEST_CASE(read_dcd_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"dcd\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 2u);\n\n const auto dcd = dynamic_cast<mjolnir::DCDObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(dcd));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n}\n\n\/\/ check that read_observer returns TRRObserver or not\nBOOST_AUTO_TEST_CASE(read_trr_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"trr\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 2u);\n\n const auto trr = dynamic_cast<mjolnir::TRRObserver<traits_type>*>(\n obs.observers().at(0).get());\n BOOST_TEST(static_cast<bool>(trr));\n\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(\n obs.observers().at(1).get());\n BOOST_TEST(static_cast<bool>(ene));\n }\n}\n<commit_msg>test: update test_read_observer for MsgPack<commit_after>#define BOOST_TEST_MODULE \"test_read_observer\"\n\n#ifdef BOOST_TEST_DYN_LINK\n#include <boost\/test\/unit_test.hpp>\n#else\n#include <boost\/test\/included\/unit_test.hpp>\n#endif\n\n#include <mjolnir\/core\/BoundaryCondition.hpp>\n#include <mjolnir\/core\/SimulatorTraits.hpp>\n#include <mjolnir\/input\/read_observer.hpp>\n\nBOOST_AUTO_TEST_CASE(read_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 3u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(2)->prefix() == \".\/test\");\n\n bool has_xyz = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(xyz))\n {\n has_xyz = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n\n BOOST_TEST(has_xyz);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 3u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\");\n BOOST_TEST(obs.observers().at(2)->prefix() == \".\/test\");\n\n bool has_xyz = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(xyz))\n {\n has_xyz = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n BOOST_TEST(has_xyz);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n\n \/\/ XXX\n \/\/ The following block tests read_observer successfully adds a path before\n \/\/ the prefix. But it requires the directory `test` under WORKING_DIRECTORY.\n \/\/ It strongly depends on the directory structure...\n \/\/ It is not good. We need to find a way to avoid this dependency.\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/test\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n\n BOOST_TEST(obs.observers().size() == 3u);\n BOOST_TEST(obs.observers().at(0)->prefix() == \".\/test\/test\");\n BOOST_TEST(obs.observers().at(1)->prefix() == \".\/test\/test\");\n BOOST_TEST(obs.observers().at(2)->prefix() == \".\/test\/test\");\n\n bool has_xyz = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(xyz))\n {\n has_xyz = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n BOOST_TEST(has_xyz);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n}\n\n\/\/ check that read_observer returns XYZObserver or not\nBOOST_AUTO_TEST_CASE(read_xyz_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"xyz\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 3u);\n\n bool has_xyz = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto xyz = dynamic_cast<mjolnir::XYZObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(xyz))\n {\n has_xyz = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n BOOST_TEST(has_xyz);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n}\n\n\/\/ check that read_observer returns DCDObserver or not\nBOOST_AUTO_TEST_CASE(read_dcd_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"dcd\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 3u);\n\n bool has_dcd = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto dcd = dynamic_cast<mjolnir::DCDObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(dcd))\n {\n has_dcd = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n BOOST_TEST(has_dcd);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n}\n\n\/\/ check that read_observer returns TRRObserver or not\nBOOST_AUTO_TEST_CASE(read_trr_observer)\n{\n mjolnir::LoggerManager::set_default_logger(\"test_read_observer.log\");\n\n using real_type = double;\n using traits_type = mjolnir::SimulatorTraits<real_type, mjolnir::UnlimitedBoundary>;\n {\n using namespace toml::literals;\n const toml::table v = toml::get<toml::table>(u8R\"(\n [files]\n output.path = \".\/\"\n output.prefix = \"test\"\n output.format = \"trr\"\n )\"_toml);\n\n const auto obs = mjolnir::read_observer<traits_type>(v);\n BOOST_TEST(obs.observers().size() == 3u);\n\n bool has_trr = false;\n bool has_ene = false;\n bool has_msg = false;\n for(const auto ptr : obs.observers())\n {\n const auto trr = dynamic_cast<mjolnir::TRRObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(trr))\n {\n has_trr = true;\n }\n const auto ene = dynamic_cast<mjolnir::EnergyObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(ene))\n {\n has_ene = true;\n }\n const auto msg = dynamic_cast<mjolnir::MsgPackObserver<traits_type>*>(ptr.get());\n if(static_cast<bool>(msg))\n {\n has_msg = true;\n }\n }\n BOOST_TEST(has_trr);\n BOOST_TEST(has_ene);\n BOOST_TEST(has_msg);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"test\/cpp\/util\/cli_credentials.h\"\n\n#include <gflags\/gflags.h>\n\nDEFINE_bool(\n enable_ssl, false,\n \"Whether to use ssl\/tls. Deprecated. Use --channel_creds_type=ssl.\");\nDEFINE_bool(use_auth, false,\n \"Whether to create default google credentials. Deprecated. Use \"\n \"--channel_creds_type=google_default_credentials.\");\nDEFINE_string(\n access_token, \"\",\n \"The access token that will be sent to the server to authenticate RPCs.\");\nDEFINE_string(\n ssl_target, \"\",\n \"If not empty, treat the server host name as this for ssl\/tls certificate \"\n \"validation.\");\nDEFINE_string(\n channel_creds_type, \"\",\n \"The channel creds type: insecure, ssl, google_default_credentials or \"\n \"alts.\");\n\nnamespace grpc {\nnamespace testing {\n\ngrpc::string CliCredentials::GetDefaultChannelCredsType() const {\n \/\/ Compatibility logic for --enable_ssl.\n if (FLAGS_enable_ssl) {\n fprintf(stderr,\n \"warning: --enable_ssl is deprecated. Use \"\n \"--channel_creds_type=ssl.\\n\");\n return \"ssl\";\n }\n \/\/ Compatibility logic for --use_auth.\n if (FLAGS_access_token.empty() && FLAGS_use_auth) {\n fprintf(stderr,\n \"warning: --use_auth is deprecated. Use \"\n \"--channel_creds_type=google_default_credentials.\\n\");\n return \"google_default_credentials\";\n }\n return \"insecure\";\n}\n\nstd::shared_ptr<grpc::ChannelCredentials>\nCliCredentials::GetChannelCredentials() const {\n if (FLAGS_channel_creds_type.compare(\"insecure\") == 0) {\n return grpc::InsecureChannelCredentials();\n } else if (FLAGS_channel_creds_type.compare(\"ssl\") == 0) {\n return grpc::SslCredentials(grpc::SslCredentialsOptions());\n } else if (FLAGS_channel_creds_type.compare(\"google_default_credentials\") ==\n 0) {\n return grpc::GoogleDefaultCredentials();\n } else if (FLAGS_channel_creds_type.compare(\"alts\") == 0) {\n return grpc::experimental::AltsCredentials(\n grpc::experimental::AltsCredentialsOptions());\n }\n fprintf(stderr,\n \"--channel_creds_type=%s invalid; must be insecure, ssl, \"\n \"google_default_credentials or alts.\\n\",\n FLAGS_channel_creds_type.c_str());\n return std::shared_ptr<grpc::ChannelCredentials>();\n}\n\nstd::shared_ptr<grpc::CallCredentials> CliCredentials::GetCallCredentials()\n const {\n if (!FLAGS_access_token.empty()) {\n if (FLAGS_use_auth) {\n fprintf(stderr,\n \"warning: use_auth is ignored when access_token is provided.\");\n }\n return grpc::AccessTokenCredentials(FLAGS_access_token);\n }\n return std::shared_ptr<grpc::CallCredentials>();\n}\n\nstd::shared_ptr<grpc::ChannelCredentials> CliCredentials::GetCredentials()\n const {\n if (FLAGS_channel_creds_type.empty()) {\n FLAGS_channel_creds_type = GetDefaultChannelCredsType();\n } else if (FLAGS_enable_ssl && FLAGS_channel_creds_type.compare(\"ssl\") != 0) {\n fprintf(stderr,\n \"warning: ignoring --enable_ssl because \"\n \"--channel_creds_type already set to %s.\\n\",\n FLAGS_channel_creds_type.c_str());\n } else if (FLAGS_use_auth && FLAGS_channel_creds_type.compare(\n \"google_default_credentials\") != 0) {\n fprintf(stderr,\n \"warning: ignoring --use_auth because \"\n \"--channel_creds_type already set to %s.\\n\",\n FLAGS_channel_creds_type.c_str());\n }\n \/\/ Legacy transport upgrade logic for insecure requests.\n if (!FLAGS_access_token.empty() &&\n FLAGS_channel_creds_type.compare(\"insecure\") == 0) {\n fprintf(stderr,\n \"warning: --channel_creds_type=insecure upgraded to ssl because \"\n \"an access token was provided.\\n\");\n FLAGS_channel_creds_type = \"ssl\";\n }\n std::shared_ptr<grpc::ChannelCredentials> channel_creds =\n GetChannelCredentials();\n \/\/ Composite any call-type credentials on top of the base channel.\n std::shared_ptr<grpc::CallCredentials> call_creds = GetCallCredentials();\n return (channel_creds == nullptr || call_creds == nullptr)\n ? channel_creds\n : grpc::CompositeChannelCredentials(channel_creds, call_creds);\n}\n\nconst grpc::string CliCredentials::GetCredentialUsage() const {\n return \" --enable_ssl ; Set whether to use ssl (deprecated)\\n\"\n \" --use_auth ; Set whether to create default google\"\n \" credentials\\n\"\n \" --access_token ; Set the access token in metadata,\"\n \" overrides --use_auth\\n\"\n \" --ssl_target ; Set server host for ssl validation\\n\"\n \" --channel_creds_type ; Set to insecure, ssl, alts or\\n\"\n \" ; google_default_credentials\\n\";\n}\n\nconst grpc::string CliCredentials::GetSslTargetNameOverride() const {\n bool use_ssl =\n FLAGS_channel_creds_type.compare(\"ssl\") == 0 ||\n FLAGS_channel_creds_type.compare(\"google_default_credentials\") == 0;\n return use_ssl ? FLAGS_ssl_target : \"\";\n}\n\n} \/\/ namespace testing\n} \/\/ namespace grpc\n<commit_msg>Shorten flag value to gdc.<commit_after>\/*\n *\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include \"test\/cpp\/util\/cli_credentials.h\"\n\n#include <gflags\/gflags.h>\n\nDEFINE_bool(\n enable_ssl, false,\n \"Whether to use ssl\/tls. Deprecated. Use --channel_creds_type=ssl.\");\nDEFINE_bool(use_auth, false,\n \"Whether to create default google credentials. Deprecated. Use \"\n \"--channel_creds_type=gdc.\");\nDEFINE_string(\n access_token, \"\",\n \"The access token that will be sent to the server to authenticate RPCs.\");\nDEFINE_string(\n ssl_target, \"\",\n \"If not empty, treat the server host name as this for ssl\/tls certificate \"\n \"validation.\");\nDEFINE_string(\n channel_creds_type, \"\",\n \"The channel creds type: insecure, ssl, gdc (Google Default Credentials) \"\n \"or alts.\");\n\nnamespace grpc {\nnamespace testing {\n\ngrpc::string CliCredentials::GetDefaultChannelCredsType() const {\n \/\/ Compatibility logic for --enable_ssl.\n if (FLAGS_enable_ssl) {\n fprintf(stderr,\n \"warning: --enable_ssl is deprecated. Use \"\n \"--channel_creds_type=ssl.\\n\");\n return \"ssl\";\n }\n \/\/ Compatibility logic for --use_auth.\n if (FLAGS_access_token.empty() && FLAGS_use_auth) {\n fprintf(stderr,\n \"warning: --use_auth is deprecated. Use \"\n \"--channel_creds_type=gdc.\\n\");\n return \"gdc\";\n }\n return \"insecure\";\n}\n\nstd::shared_ptr<grpc::ChannelCredentials>\nCliCredentials::GetChannelCredentials() const {\n if (FLAGS_channel_creds_type.compare(\"insecure\") == 0) {\n return grpc::InsecureChannelCredentials();\n } else if (FLAGS_channel_creds_type.compare(\"ssl\") == 0) {\n return grpc::SslCredentials(grpc::SslCredentialsOptions());\n } else if (FLAGS_channel_creds_type.compare(\"gdc\") == 0) {\n return grpc::GoogleDefaultCredentials();\n } else if (FLAGS_channel_creds_type.compare(\"alts\") == 0) {\n return grpc::experimental::AltsCredentials(\n grpc::experimental::AltsCredentialsOptions());\n }\n fprintf(stderr,\n \"--channel_creds_type=%s invalid; must be insecure, ssl, gdc or \"\n \"alts.\\n\",\n FLAGS_channel_creds_type.c_str());\n return std::shared_ptr<grpc::ChannelCredentials>();\n}\n\nstd::shared_ptr<grpc::CallCredentials> CliCredentials::GetCallCredentials()\n const {\n if (!FLAGS_access_token.empty()) {\n if (FLAGS_use_auth) {\n fprintf(stderr,\n \"warning: use_auth is ignored when access_token is provided.\");\n }\n return grpc::AccessTokenCredentials(FLAGS_access_token);\n }\n return std::shared_ptr<grpc::CallCredentials>();\n}\n\nstd::shared_ptr<grpc::ChannelCredentials> CliCredentials::GetCredentials()\n const {\n if (FLAGS_channel_creds_type.empty()) {\n FLAGS_channel_creds_type = GetDefaultChannelCredsType();\n } else if (FLAGS_enable_ssl && FLAGS_channel_creds_type.compare(\"ssl\") != 0) {\n fprintf(stderr,\n \"warning: ignoring --enable_ssl because \"\n \"--channel_creds_type already set to %s.\\n\",\n FLAGS_channel_creds_type.c_str());\n } else if (FLAGS_use_auth && FLAGS_channel_creds_type.compare(\"gdc\") != 0) {\n fprintf(stderr,\n \"warning: ignoring --use_auth because \"\n \"--channel_creds_type already set to %s.\\n\",\n FLAGS_channel_creds_type.c_str());\n }\n \/\/ Legacy transport upgrade logic for insecure requests.\n if (!FLAGS_access_token.empty() &&\n FLAGS_channel_creds_type.compare(\"insecure\") == 0) {\n fprintf(stderr,\n \"warning: --channel_creds_type=insecure upgraded to ssl because \"\n \"an access token was provided.\\n\");\n FLAGS_channel_creds_type = \"ssl\";\n }\n std::shared_ptr<grpc::ChannelCredentials> channel_creds =\n GetChannelCredentials();\n \/\/ Composite any call-type credentials on top of the base channel.\n std::shared_ptr<grpc::CallCredentials> call_creds = GetCallCredentials();\n return (channel_creds == nullptr || call_creds == nullptr)\n ? channel_creds\n : grpc::CompositeChannelCredentials(channel_creds, call_creds);\n}\n\nconst grpc::string CliCredentials::GetCredentialUsage() const {\n return \" --enable_ssl ; Set whether to use ssl (deprecated)\\n\"\n \" --use_auth ; Set whether to create default google\"\n \" credentials\\n\"\n \" --access_token ; Set the access token in metadata,\"\n \" overrides --use_auth\\n\"\n \" --ssl_target ; Set server host for ssl validation\\n\"\n \" --channel_creds_type ; Set to insecure, ssl, gdc, or alts\\n\";\n}\n\nconst grpc::string CliCredentials::GetSslTargetNameOverride() const {\n bool use_ssl = FLAGS_channel_creds_type.compare(\"ssl\") == 0 ||\n FLAGS_channel_creds_type.compare(\"gdc\") == 0;\n return use_ssl ? FLAGS_ssl_target : \"\";\n}\n\n} \/\/ namespace testing\n} \/\/ namespace grpc\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2017 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef NET_IP4_CIDR_HPP\n#define NET_IP4_CIDR_HPP\n\n#include \"addr.hpp\"\n\nnamespace net {\nnamespace ip4 {\n\nclass Cidr {\npublic:\n Cidr(uint8_t p1, uint8_t p2, uint8_t p3, uint8_t p4, uint8_t mask)\n {\n uint32_t ip_whole = Addr{p1,p2,p3,p4}.whole;\n uint32_t ip_mask = net::ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n\n uint32_t from_ip = ip_whole & ip_mask;\n uint32_t to_ip = from_ip | ~ip_mask;\n\n from_ = Addr{from_ip};\n to_ = Addr{to_ip};\n }\n\n \/\/ Possibly not necessary\n Cidr(Addr from, Addr to)\n : from_{from}, to_{to}\n {}\n\n bool contains(Addr ip) {\n return ip >= from_ and ip <= to_;\n }\n\n Addr from() {\n return from_;\n }\n\n Addr to() {\n return to_;\n }\n\nprivate:\n Addr from_; \/\/ network address\n Addr to_; \/\/ broadcast address\n}; \/\/< class Cidr\n\n} \/\/< namespace ip4\n} \/\/< namespace net\n\n#endif\n<commit_msg>IPv4 Cidr: Adding missing const and noexcept, and specifying constexpr on constructor<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2017 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef NET_IP4_CIDR_HPP\n#define NET_IP4_CIDR_HPP\n\n#include \"addr.hpp\"\n\nnamespace net {\nnamespace ip4 {\n\nclass Cidr {\npublic:\n\n \/**\n * @brief Constructor\n *\n * Create an IPv4 cidr object to represent the cidr <p1.p2.p3.p4\/mask>\n *\n * @param[in] p1 The first part of the IPv4 cidr\n * @param[in] p2 The second part of the IPv4 cidr\n * @param[in] p3 The third part of the IPv4 cidr\n * @param[in] p4 The fourth part of the IPv4 cidr\n * @param[in] mask A number between 0 and 32, representing the number\n * of leading 1 bits in the netmask, f.ex.:\n * 32 represents the netmask 255.255.255.255\n * 24 represents the netmask 255.255.255.0\n *\/\n constexpr Cidr(const uint8_t p1, const uint8_t p2, const uint8_t p3, const uint8_t p4,\n const uint8_t mask) noexcept\n {\n Expects(mask >= 0 and mask <= 32);\n\n const uint32_t ip_whole = Addr{p1,p2,p3,p4}.whole;\n const uint32_t ip_mask = net::ntohl((0xFFFFFFFFUL << (32 - mask)) & 0xFFFFFFFFUL);\n\n const uint32_t from_ip = ip_whole & ip_mask;\n const uint32_t to_ip = from_ip | ~ip_mask;\n\n from_ = Addr{from_ip};\n to_ = Addr{to_ip};\n }\n\n bool contains(Addr ip) const noexcept {\n return ip >= from_ and ip <= to_;\n }\n\n Addr from() const noexcept {\n return from_;\n }\n\n Addr to() const noexcept {\n return to_;\n }\n\nprivate:\n Addr from_; \/\/ network address\n Addr to_; \/\/ broadcast address\n}; \/\/< class Cidr\n\n} \/\/< namespace ip4\n} \/\/< namespace net\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <QtGlobal>\n#include <QDir>\n#include <QFileInfo>\n#include <QSettings>\n#include <QDebug>\n#include <QIcon>\n\n#include \"icontheme.h\"\n\nQStringList IconTheme::base_dirs = QIcon::themeSearchPaths();\n\nIconTheme::IconTheme(const QString &theme_name): theme_name(theme_name)\n{\n if (theme_name.isNull()) {\n return;\n }\n for (const QString &dir: base_dirs) {\n if (!QFileInfo::exists(QString(\"%1\/%2\/index.theme\").arg(dir).arg(theme_name))) {\n continue;\n }\n base_path = dir + \"\/\" + theme_name;\n break;\n }\n \/\/ theme directory not found or doesn't contain index.theme file\n if (base_path.isNull()) {\n qDebug() << \"index.theme not found\";\n return;\n }\n QSettings theme_index(base_path + \"\/index.theme\", QSettings::IniFormat);\n theme_index.beginGroup(\"Icon Theme\");\n display_name = theme_index.value(\"Name\").toString();\n parent_themes = theme_index.value(\"Inherits\").toStringList();\n QStringList dir_list = theme_index.value(\"Directories\").toStringList();\n theme_dirs.reserve(dir_list.size());\n for (const QString &dir: dir_list) {\n theme_index.beginGroup(dir);\n int size = theme_index.value(\"Size\", 0).toInt();\n theme_dirs.append(Directory{\n size,\n theme_index.value(\"Scale\", 1).toInt(),\n theme_index.value(\"Context\", \"\").toString(),\n theme_index.value(\"Type\", \"Threshold\").toString(),\n theme_index.value(\"MaxSize\", size).toInt(),\n theme_index.value(\"MinSize\", size).toInt(),\n theme_index.value(\"Threshold\", 2).toInt(),\n dir\n });\n theme_index.endGroup();\n }\n \/\/ load icons\n for (int i = 0, len = theme_dirs.size(); i < len; i++) {\n QDir dir(base_path + \"\/\" + theme_dirs[i].path);\n for (const QFileInfo &icon: dir.entryInfoList({\"*.png\", \"*.svg\", \"*.xpm\"}, QDir::Files | QDir::Readable)) {\n QString icon_name = icon.completeBaseName();\n QString ext = icon.suffix();\n FileExtension ext_type = FileExtension::XPM;\n if (ext == \"png\")\n ext_type = FileExtension::PNG;\n else if (ext == \"svg\")\n ext_type = FileExtension::SVG;\n theme_icons[icon_name].append(std::pair<uint, FileExtension>{i, ext_type});\n }\n }\n}\n\nQStringList IconTheme::themes()\n{\n QSet<QString> themes;\n for (QDir dir: base_dirs) {\n \/\/ skip embedded themes\n if (dir.path().startsWith(':'))\n continue;\n for (const QString& theme: dir.entryList(QDir::Dirs | QDir::Readable |\n QDir::NoDotAndDotDot))\n {\n if (!QFileInfo::exists(dir.filePath(theme + \"\/index.theme\")))\n continue;\n themes += theme;\n }\n }\n return themes.toList();\n}\n\nvoid IconTheme::add_themes_dir(const QString &path)\n{\n base_dirs.append(path);\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\nvoid IconTheme::add_themes_dirs(const QStringList &paths)\n{\n base_dirs.append(paths);\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\nvoid IconTheme::set_themes_dirs(const QStringList &paths)\n{\n base_dirs = paths;\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\n\n<commit_msg>Fixed issue with directory information was not loading<commit_after>#include <QtGlobal>\n#include <QDir>\n#include <QFileInfo>\n#include <QSettings>\n#include <QDebug>\n#include <QIcon>\n\n#include \"icontheme.h\"\n\nQStringList IconTheme::base_dirs = QIcon::themeSearchPaths();\n\nIconTheme::IconTheme(const QString &theme_name): theme_name(theme_name)\n{\n if (theme_name.isNull()) {\n return;\n }\n for (const QString &dir: base_dirs) {\n if (!QFileInfo::exists(QString(\"%1\/%2\/index.theme\").arg(dir).arg(theme_name))) {\n continue;\n }\n base_path = dir + \"\/\" + theme_name;\n break;\n }\n \/\/ theme directory not found or doesn't contain index.theme file\n if (base_path.isNull()) {\n qDebug() << \"index.theme not found\";\n return;\n }\n QSettings theme_index(base_path + \"\/index.theme\", QSettings::IniFormat);\n theme_index.beginGroup(\"Icon Theme\");\n display_name = theme_index.value(\"Name\").toString();\n parent_themes = theme_index.value(\"Inherits\").toStringList();\n QStringList dir_list = theme_index.value(\"Directories\").toStringList();\n theme_index.endGroup();\n\n theme_dirs.reserve(dir_list.size());\n for (const QString &dir: dir_list) {\n theme_index.beginGroup(dir);\n int size = theme_index.value(\"Size\", 0).toInt();\n theme_dirs.append(Directory{\n size,\n theme_index.value(\"Scale\", 1).toInt(),\n theme_index.value(\"Context\", \"\").toString(),\n theme_index.value(\"Type\", \"Threshold\").toString(),\n theme_index.value(\"MaxSize\", size).toInt(),\n theme_index.value(\"MinSize\", size).toInt(),\n theme_index.value(\"Threshold\", 2).toInt(),\n dir\n });\n theme_index.endGroup();\n }\n \/\/ load icons\n for (int i = 0, len = theme_dirs.size(); i < len; i++) {\n QDir dir(base_path + \"\/\" + theme_dirs[i].path);\n for (const QFileInfo &icon: dir.entryInfoList({\"*.png\", \"*.svg\", \"*.xpm\"}, QDir::Files | QDir::Readable)) {\n QString icon_name = icon.completeBaseName();\n QString ext = icon.suffix();\n FileExtension ext_type = FileExtension::XPM;\n if (ext == \"png\")\n ext_type = FileExtension::PNG;\n else if (ext == \"svg\")\n ext_type = FileExtension::SVG;\n theme_icons[icon_name].append(std::pair<uint, FileExtension>{i, ext_type});\n }\n }\n}\n\nQStringList IconTheme::themes()\n{\n QSet<QString> themes;\n for (QDir dir: base_dirs) {\n \/\/ skip embedded themes\n if (dir.path().startsWith(':'))\n continue;\n for (const QString& theme: dir.entryList(QDir::Dirs | QDir::Readable |\n QDir::NoDotAndDotDot))\n {\n if (!QFileInfo::exists(dir.filePath(theme + \"\/index.theme\")))\n continue;\n themes += theme;\n }\n }\n return themes.toList();\n}\n\nvoid IconTheme::add_themes_dir(const QString &path)\n{\n base_dirs.append(path);\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\nvoid IconTheme::add_themes_dirs(const QStringList &paths)\n{\n base_dirs.append(paths);\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\nvoid IconTheme::set_themes_dirs(const QStringList &paths)\n{\n base_dirs = paths;\n QIcon::setThemeSearchPaths(base_dirs);\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\n#include \"async_modbus_task.h\"\n\nusing namespace v8;\n\nclass ReadRegistersTask : public AsyncModbusTask\n{\nprivate:\n\n\tconst int address_;\n\n\tconst int register_count_;\n\n\t\/\/! The result of reading.\n\tuint16_t* const results_;\n\n\tint registers_read_;\n\npublic:\n\n\tReadRegistersTask(modbus_t* context, int address, int register_count, const Persistent<Function>& callback)\n\t: AsyncModbusTask(context, callback),\n\t address_(address), \n\t register_count_(register_count),\n\t results_(new uint16_t[register_count]),\n\t registers_read_(0);\n\t{\n\t}\n\n\tvirtual ~ReadRegistersTask()\n\t{\n\t\tdelete [] results_;\n\t}\n\n\tvirtual void work()\n\t{\n\t\tconst int r = modbus_read_registers(context_, address_, register_count_, results_);\n\n\t\tif( -1 == r )\n\t\t{\n\t\t\tsetModbusError(errno);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tregisters_read_ = r;\n\t\t}\n\t}\n\n\tvirtual void after()\n\t{\n\t\tHandleScope scope;\n\n\t\tLocal<Value> error = error_flag_ ? Exception::Error(String::New(error_message_.c_str())) : Local<Value>::New(Null());\n\n\t\tv8::Local<v8::Array> register_data = v8::Array::New(registers_read_);\n\t\t\n\t\tfor( int i=0; i<registers_read_; ++i )\n\t\t{\n\t\t\tregister_data->Set(i, Integer::New(results_[i]));\n\t\t}\n\n\t\tconst unsigned argc = 2;\n\n\t\tLocal<Value> argv[argc] = {error, register_data};\n\n\t\tTryCatch try_catch;\n\t\t{\n\t\t\tcallback_->Call(Context::GetCurrent()->Global(), argc, argv);\n\n\t\t\tif( try_catch.HasCaught() )\n\t\t\t{\n\t\t\t\tnode::FatalException(try_catch);\n\t\t\t}\n\t\t}\n\t} \n};\n\n\/\/! Shedules int modbus_read_registers(modbus_t *ctx, int addr, int nb, uint16_t *dest)\nHandle<Value> read_registers(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tif( args.Length() < 4 )\n\t{\n\t\treturn ThrowException(Exception::TypeError(String::New(\"Wrong number of arguments\")));\n\t}\n\n\tif( !args[0]->IsExternal() || !args[1]->IsNumber() || !args[2]->IsNumber() || !args[3]->IsFunction() )\n\t{\n\t\treturn ThrowException(Exception::TypeError(String::New(\"Wrong arguments\")));\n\t}\n\n\tmodbus_t* const context = static_cast<modbus_t*>(External::Cast(*args[0])->Value());\n\n\tif( !context )\n\t{\n\t\treturn ThrowException(Exception::Error(String::New(\"Unable to cast argument to libmodbus context\")));\t\t\n\t}\n\n\tLocal<Function> callback = Local<Function>::Cast(args[3]);\n\n\tAsyncModbusTask* const task = new ReadRegistersTask(\n\t\t\t\t\tcontext,\t\t\t\t\/\/ ctx\n\t\t\t\t\targs[1]->Int32Value(),\t\/\/ addr\n\t\t\t\t\targs[2]->Int32Value(),\t\/\/ nb\n\t\t\t\t\tPersistent<Function>::New(callback)\n\t\t\t\t\t);\n\n\tif( ! task->queue() )\n\t{\n\t\tdelete task;\n\n\t\t\/\/ TODO: really throw exeception ?\n\t\treturn ThrowException(Exception::Error(String::New(\"Unable to queue work request\")));\t\t\n\t}\n\n\treturn Undefined();\n}\n<commit_msg>bugfix<commit_after>\n#include \"async_modbus_task.h\"\n\nusing namespace v8;\n\nclass ReadRegistersTask : public AsyncModbusTask\n{\nprivate:\n\n\tconst int address_;\n\n\tconst int register_count_;\n\n\t\/\/! The result of reading.\n\tuint16_t* const results_;\n\n\tint registers_read_;\n\npublic:\n\n\tReadRegistersTask(modbus_t* context, int address, int register_count, const Persistent<Function>& callback)\n\t: AsyncModbusTask(context, callback),\n\t address_(address), \n\t register_count_(register_count),\n\t results_(new uint16_t[register_count]),\n\t registers_read_(0)\n\t{\n\t}\n\n\tvirtual ~ReadRegistersTask()\n\t{\n\t\tdelete [] results_;\n\t}\n\n\tvirtual void work()\n\t{\n\t\tconst int r = modbus_read_registers(context_, address_, register_count_, results_);\n\n\t\tif( -1 == r )\n\t\t{\n\t\t\tsetModbusError(errno);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tregisters_read_ = r;\n\t\t}\n\t}\n\n\tvirtual void after()\n\t{\n\t\tHandleScope scope;\n\n\t\tLocal<Value> error = error_flag_ ? Exception::Error(String::New(error_message_.c_str())) : Local<Value>::New(Null());\n\n\t\tv8::Local<v8::Array> register_data = v8::Array::New(registers_read_);\n\t\t\n\t\tfor( int i=0; i<registers_read_; ++i )\n\t\t{\n\t\t\tregister_data->Set(i, Integer::New(results_[i]));\n\t\t}\n\n\t\tconst unsigned argc = 2;\n\n\t\tLocal<Value> argv[argc] = {error, register_data};\n\n\t\tTryCatch try_catch;\n\t\t{\n\t\t\tcallback_->Call(Context::GetCurrent()->Global(), argc, argv);\n\n\t\t\tif( try_catch.HasCaught() )\n\t\t\t{\n\t\t\t\tnode::FatalException(try_catch);\n\t\t\t}\n\t\t}\n\t} \n};\n\n\/\/! Shedules int modbus_read_registers(modbus_t *ctx, int addr, int nb, uint16_t *dest)\nHandle<Value> read_registers(const Arguments& args)\n{\n\tHandleScope scope;\n\n\tif( args.Length() < 4 )\n\t{\n\t\treturn ThrowException(Exception::TypeError(String::New(\"Wrong number of arguments\")));\n\t}\n\n\tif( !args[0]->IsExternal() || !args[1]->IsNumber() || !args[2]->IsNumber() || !args[3]->IsFunction() )\n\t{\n\t\treturn ThrowException(Exception::TypeError(String::New(\"Wrong arguments\")));\n\t}\n\n\tmodbus_t* const context = static_cast<modbus_t*>(External::Cast(*args[0])->Value());\n\n\tif( !context )\n\t{\n\t\treturn ThrowException(Exception::Error(String::New(\"Unable to cast argument to libmodbus context\")));\t\t\n\t}\n\n\tLocal<Function> callback = Local<Function>::Cast(args[3]);\n\n\tAsyncModbusTask* const task = new ReadRegistersTask(\n\t\t\t\t\tcontext,\t\t\t\t\/\/ ctx\n\t\t\t\t\targs[1]->Int32Value(),\t\/\/ addr\n\t\t\t\t\targs[2]->Int32Value(),\t\/\/ nb\n\t\t\t\t\tPersistent<Function>::New(callback)\n\t\t\t\t\t);\n\n\tif( ! task->queue() )\n\t{\n\t\tdelete task;\n\n\t\t\/\/ TODO: really throw exeception ?\n\t\treturn ThrowException(Exception::Error(String::New(\"Unable to queue work request\")));\t\t\n\t}\n\n\treturn Undefined();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 Google\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"stdio.h\"\n#include \"time.h\"\n\n#include \"base\/logging.h\"\n\nnamespace google_base {\nDateLogger::DateLogger() {\n#if defined(_MSC_VER)\n _tzset();\n#endif\n}\n\nchar* const DateLogger::HumanDate() {\n#if defined(_MSC_VER)\n _strtime_s(buffer_, sizeof(buffer_));\n#else\n time_t time_value = time(NULL);\n struct tm now;\n localtime_r(&time_value, &now);\n snprintf(buffer_, sizeof(buffer_), \"%02d:%02d:%02d\\0\",\n now.tm_hour, now.tm_min, now.tm_sec);\n#endif\n return buffer_;\n}\n} \/\/ namespace google_base\n<commit_msg>Fix string format warnings<commit_after>\/\/ Copyright 2010 Google\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"stdio.h\"\n#include \"time.h\"\n\n#include \"base\/logging.h\"\n\nnamespace google_base {\nDateLogger::DateLogger() {\n#if defined(_MSC_VER)\n _tzset();\n#endif\n}\n\nchar* const DateLogger::HumanDate() {\n#if defined(_MSC_VER)\n _strtime_s(buffer_, sizeof(buffer_));\n#else\n time_t time_value = time(NULL);\n struct tm now;\n localtime_r(&time_value, &now);\n snprintf(buffer_, sizeof(buffer_), \"%02d:%02d:%02d\",\n now.tm_hour, now.tm_min, now.tm_sec);\n#endif\n return buffer_;\n}\n} \/\/ namespace google_base\n<|endoftext|>"} {"text":"<commit_before>#include \"game_window.h\"\n#include <sstream>\n\nbool GameWindow::sdlInitialized = false;\n\nbool GameWindow::initialize() {\n\tLogger::getInstance()->writeInformation(\"Initializing graphics\");\n\tif (GameWindow::sdlInitialized) {\n\t\tLogger::getInstance()->writeWarning(\"SDL already initialized\");\n\t} else {\n\t\tatexit(SDL_Quit);\n\t\tif( SDL_Init( SDL_INIT_VIDEO ) < 0 ) {\n\t\t\tLogger::getInstance()->writeError(\"SDL could not initialize!\");\n\t\t\tLogger::getInstance()->writeError(SDL_GetError());\n\t\t\tGameWindow::sdlInitialized = false;\n\t\t} else {\n\t\t\tGameWindow::sdlInitialized = true;\n\t\t}\n\t}\n\treturn GameWindow::sdlInitialized;\n}\n\nGameWindow::GameWindow() {\n\tthis->parser = new ParserYAML(CONFIG_FILE_PATH);\n\tthis->model = NULL;\n\tthis->exit = false;\n\tthis->focus_x = 0;\n\tthis->focus_y = 0;\n\n\tLogger::getInstance()->writeInformation(\"Creating window\");\n\n\tGameWindow::initialize(); \n\twindow = SDL_CreateWindow(\"Trabajo Práctico 7542\",\n\t\tSDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED,\n\t\tANCHO_DEFAULT, ALTO_DEFAULT,\n\t\tSDL_WINDOW_SHOWN);\n\n\n\tLogger::getInstance()->writeInformation(\"Creating renderer\");\n\trenderer = SDL_CreateRenderer( window, -1, SDL_RENDERER_ACCELERATED );\n\n\n\t\/\/ TODO: IMG_INIT\n\n\tSDL_SetRenderDrawColor(renderer, 0, 0, 0, 255); \/\/ Color: negro opaco\n\tSDL_RenderClear(renderer); \/\/ Limpio pantalla inicialmente\n\tSDL_RenderPresent( renderer );\n}\n\nGameWindow::~GameWindow() {\n\tmap<std::string, SpriteSheet*>::const_iterator itr;\n\tfor(itr = spritesSheets.begin(); itr != spritesSheets.end(); ++itr){\n\t\tdelete itr->second;\n\t}\n\n\tdelete parser;\n\tdelete model;\n\n\tLogger::getInstance()->writeInformation(\"Destroying renderer\");\n\tif (renderer != NULL) {\n\t\tSDL_DestroyRenderer(renderer);\n\t\trenderer = NULL;\n\t}\n\n\tLogger::getInstance()->writeInformation(\"Destroying window\");\n\tif (window != NULL) {\n\t\tLogger::getInstance()->writeWarning(\"Window never initialized\");\n\t\tSDL_DestroyWindow(window);\n\t\twindow = NULL;\n\t}\n}\n\nbool GameWindow::endOfGame(){\n\treturn this->exit;\n}\n\nvoid GameWindow::render(){\n\t\/\/\tDibujar\n\tSDL_SetRenderDrawColor(renderer, 0, 0, 0, 255);\n\tSDL_RenderClear(renderer);\n\tstd::vector<std::shared_ptr<Entity>> entities = this->model->getBoard()->getEntities();\n\tstd::map<std::string,SpriteSheet*>::iterator it;\n\tSpriteSheet* ss;\n\tfor (std::size_t i =0; i < entities.size(); ++i){\n\t\tit = this->spritesSheets.find(entities[i]->name);\n\t\tif(it != this->spritesSheets.end()){\n\t\t\tss = it->second;\n\t\t\tss->render(*entities[i], 0, renderer);\n\t\t}\n\t\telse\n\t\t\tLogger::getInstance()->writeWarning(\"No existe SpriteSheet para este tipo de entidad\" + entities[i]->name);\n\t}\n\n\tSDL_RenderPresent( renderer );\n\treturn;\n}\n\nvoid GameWindow::restart(){\n\t\/\/model->restart()\tPARA NO TENER Q INSTANCIAR UN NUEVO MODEL\n\tdelete model;\n\n\tmap<std::string, SpriteSheet*>::const_iterator itr;\n\tfor(itr = spritesSheets.begin(); itr != spritesSheets.end(); ++itr){\n\t\tdelete itr->second;\n\t}\n\n\tinit();\n}\n\nvoid GameWindow::init(){\n\tthis->parser->parse();\n\n\tthis->model = new Game(parser);\n\n\tthis->spritesSheets[\"agua\"] = new SpriteSheet(\"resources\/\/agua.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"pasto\"] = new SpriteSheet(\"resources\/\/pasto.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"piedra\"] = new SpriteSheet(\"resources\/\/piedra.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"chancho\"] = new SpriteSheet(\"resources\/\/chanchos.png\", 10, 10, 44, 48, 15, 0, 1, *this);\n}\n\nvoid GameWindow::update(){\n\tmodel->update();\n\treturn;\n}\n\nvoid GameWindow::processInput(){\n\tint mouse_x_screen, mouse_y_screen;\n\n\t\/\/\tProcesar input del usuario\n\twhile(SDL_PollEvent(EventHandler::getInstance()->getEvent())) {\n\t\tif(EventHandler::getInstance()->getEvent()->type == SDL_QUIT )\n\t\t\tthis->exit = true;\n\t\tif(EventHandler::getInstance()->getEvent()->type == SDL_KEYDOWN ){\n\t\t\tLogger::getInstance()->writeInformation(\"Teclado\");\n\t\t\tif(EventHandler::getInstance()->getEvent()->key.keysym.sym == SDLK_r){\n\t\t\t\trestart();\n\t\t\t}\n\t\t}\n\t\tif( EventHandler::getInstance()->getEvent()->type == SDL_MOUSEBUTTONUP ){\n\t\t\tSDL_GetMouseState(&mouse_x_screen, &mouse_y_screen);\n\t\t\tstd::ostringstream oss;\n\t\t\toss << \"Mouse en \" << mouse_x_screen << \",\" << mouse_y_screen;\n\n\t\t\t\/\/ Conversion de coordenadas en pantalla a coordenadas mapa\n\n\t\t\tdouble XsTerm = (double)(mouse_x_screen - ANCHO_DEFAULT\/2)\/(double)TILE_WIDTH_DEFAULT;\n\t\t\tdouble YsTerm = (double)(mouse_y_screen - ALTO_DEFAULT\/2)\/(double)TILE_HEIGHT_DEFAULT;\n \n\t\t\tdouble x_mapa = focus_x + XsTerm + YsTerm + .5;\n\t\t\tdouble y_mapa = focus_y - XsTerm + YsTerm + .5;\n\n\t\t\toss << \"; mapa: \" << x_mapa << \",\" << y_mapa;\n\n\t\t\tLogger::getInstance()->writeInformation(oss.str().c_str());\n\t\t\tif( EventHandler::getInstance()->getEvent()->button.button == SDL_BUTTON_LEFT ) {\n\t\t\t\tLogger::getInstance()->writeInformation(\"Boton Izquierdo\");\n\t\t\t\tmodel->getBoard()->getProtagonist().setTarget(x_mapa, y_mapa);\n\t\t\t}\n\t\t\tif( EventHandler::getInstance()->getEvent()->button.button == SDL_BUTTON_RIGHT) {\n\t\t\t\tLogger::getInstance()->writeInformation(\"Boton derecho\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid GameWindow::scroll(){\n\tUint8 mouse_b;\n\tint mouse_x, mouse_y;\n\tconst double SCROLL_SPEED = 5;\n\n\tdouble ds = SCROLL_SPEED * model->getBoard()->dt \/ 1000; \/\/deltascroll\n\t\tSDL_GetMouseState(&mouse_x, &mouse_y);\n\n\t\tif(mouse_x <= MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = (1.0 - ((double)mouse_x \/ (double)MARGEN_PANTALLA_DEFAULT)) * ds; \n\n\t\t\tfocus_x -= dsi;\n\t\t\tfocus_y += dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia la izquierda\");\n\t\t}\n\t\telse if(mouse_x >= ANCHO_DEFAULT - MARGEN_PANTALLA_DEFAULT){\n\t\t\t\n\t\t\tdouble dsi = ((double)(mouse_x + MARGEN_PANTALLA_DEFAULT - ANCHO_DEFAULT)\/(double)MARGEN_PANTALLA_DEFAULT) * ds;\n\n\t\t\tfocus_x += dsi;\n\t\t\tfocus_y -= dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia la derecha\");\n\t\t}\n\t\tif(mouse_y <= MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = (1.0 - ((double)mouse_y \/ (double)MARGEN_PANTALLA_DEFAULT)) * ds;\n\t\t\tfocus_x -= dsi;\n\t\t\tfocus_y -= dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia arriba\");\n\t\t}\n\t\tif(mouse_y >= ALTO_DEFAULT - MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = ((double)(mouse_y + MARGEN_PANTALLA_DEFAULT - ALTO_DEFAULT)\/(double)MARGEN_PANTALLA_DEFAULT) * ds;\n\n\t\t\tfocus_x += dsi;\n\t\t\tfocus_y += dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia abajo\");\n\t\t}\n\t\t\n\t\tauto & board = *(model->getBoard());\n\t\t\n\t\tif(focus_x >= board.sizeX - 1){\n\t\t\tfocus_x = board.sizeX - 1;\n\t\t}\n\t\telse if(focus_x < 0){\n\t\t\tfocus_x = 0;\n\t\t}\n\n\t\tif(focus_y >= board.sizeY - 1){\n\t\t\tfocus_y = board.sizeY - 1;\n\t\t}else if(focus_y < 0){\n\t\t\tfocus_y = 0;\n\t\t}\n}\n\nint GameWindow::start(){\n\tinit();\n\n\twhile (!endOfGame())\n\t{\n\t\tscroll();\n\t\tprocessInput();\n\t\tupdate();\n\t\trender();\n\n\t\tSDL_Delay(model->getBoard()->dt); \/\/ TODO: Optimizar, sacar hardcodeo\n\t}\n\treturn 0;\n}\n\n\n<commit_msg>Empiezo centrado en el protagonista<commit_after>#include \"game_window.h\"\n#include <sstream>\n\nbool GameWindow::sdlInitialized = false;\n\nbool GameWindow::initialize() {\n\tLogger::getInstance()->writeInformation(\"Initializing graphics\");\n\tif (GameWindow::sdlInitialized) {\n\t\tLogger::getInstance()->writeWarning(\"SDL already initialized\");\n\t} else {\n\t\tatexit(SDL_Quit);\n\t\tif( SDL_Init( SDL_INIT_VIDEO ) < 0 ) {\n\t\t\tLogger::getInstance()->writeError(\"SDL could not initialize!\");\n\t\t\tLogger::getInstance()->writeError(SDL_GetError());\n\t\t\tGameWindow::sdlInitialized = false;\n\t\t} else {\n\t\t\tGameWindow::sdlInitialized = true;\n\t\t}\n\t}\n\treturn GameWindow::sdlInitialized;\n}\n\nGameWindow::GameWindow() {\n\tthis->parser = new ParserYAML(CONFIG_FILE_PATH);\n\tthis->model = NULL;\n\tthis->exit = false;\n\tthis->focus_x = 0;\n\tthis->focus_y = 0;\n\n\tLogger::getInstance()->writeInformation(\"Creating window\");\n\n\tGameWindow::initialize(); \n\twindow = SDL_CreateWindow(\"Trabajo Práctico 7542\",\n\t\tSDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED,\n\t\tANCHO_DEFAULT, ALTO_DEFAULT,\n\t\tSDL_WINDOW_SHOWN);\n\n\n\tLogger::getInstance()->writeInformation(\"Creating renderer\");\n\trenderer = SDL_CreateRenderer( window, -1, SDL_RENDERER_ACCELERATED );\n\n\n\t\/\/ TODO: IMG_INIT\n\n\tSDL_SetRenderDrawColor(renderer, 0, 0, 0, 255); \/\/ Color: negro opaco\n\tSDL_RenderClear(renderer); \/\/ Limpio pantalla inicialmente\n\tSDL_RenderPresent( renderer );\n}\n\nGameWindow::~GameWindow() {\n\tmap<std::string, SpriteSheet*>::const_iterator itr;\n\tfor(itr = spritesSheets.begin(); itr != spritesSheets.end(); ++itr){\n\t\tdelete itr->second;\n\t}\n\n\tdelete parser;\n\tdelete model;\n\n\tLogger::getInstance()->writeInformation(\"Destroying renderer\");\n\tif (renderer != NULL) {\n\t\tSDL_DestroyRenderer(renderer);\n\t\trenderer = NULL;\n\t}\n\n\tLogger::getInstance()->writeInformation(\"Destroying window\");\n\tif (window != NULL) {\n\t\tLogger::getInstance()->writeWarning(\"Window never initialized\");\n\t\tSDL_DestroyWindow(window);\n\t\twindow = NULL;\n\t}\n}\n\nbool GameWindow::endOfGame(){\n\treturn this->exit;\n}\n\nvoid GameWindow::render(){\n\t\/\/\tDibujar\n\tSDL_SetRenderDrawColor(renderer, 0, 0, 0, 255);\n\tSDL_RenderClear(renderer);\n\tstd::vector<std::shared_ptr<Entity>> entities = this->model->getBoard()->getEntities();\n\tstd::map<std::string,SpriteSheet*>::iterator it;\n\tSpriteSheet* ss;\n\tfor (std::size_t i =0; i < entities.size(); ++i){\n\t\tit = this->spritesSheets.find(entities[i]->name);\n\t\tif(it != this->spritesSheets.end()){\n\t\t\tss = it->second;\n\t\t\tss->render(*entities[i], 0, renderer);\n\t\t}\n\t\telse\n\t\t\tLogger::getInstance()->writeWarning(\"No existe SpriteSheet para este tipo de entidad\" + entities[i]->name);\n\t}\n\n\tSDL_RenderPresent( renderer );\n\treturn;\n}\n\nvoid GameWindow::restart(){\n\t\/\/model->restart()\tPARA NO TENER Q INSTANCIAR UN NUEVO MODEL\n\tdelete model;\n\n\tmap<std::string, SpriteSheet*>::const_iterator itr;\n\tfor(itr = spritesSheets.begin(); itr != spritesSheets.end(); ++itr){\n\t\tdelete itr->second;\n\t}\n\n\tinit();\n}\n\nvoid GameWindow::init(){\n\tthis->parser->parse();\n\n\tthis->model = new Game(parser);\n\n\tthis->spritesSheets[\"agua\"] = new SpriteSheet(\"resources\/\/agua.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"pasto\"] = new SpriteSheet(\"resources\/\/pasto.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"piedra\"] = new SpriteSheet(\"resources\/\/piedra.png\", 0, 0, TILE_HEIGHT_DEFAULT, TILE_WIDTH_DEFAULT, 1, 0, 0, *this);\n\tthis->spritesSheets[\"chancho\"] = new SpriteSheet(\"resources\/\/chanchos.png\", 10, 10, 44, 48, 15, 0, 1, *this);\n}\n\nvoid GameWindow::update(){\n\tmodel->update();\n\treturn;\n}\n\nvoid GameWindow::processInput(){\n\tint mouse_x_screen, mouse_y_screen;\n\n\t\/\/\tProcesar input del usuario\n\twhile(SDL_PollEvent(EventHandler::getInstance()->getEvent())) {\n\t\tif(EventHandler::getInstance()->getEvent()->type == SDL_QUIT )\n\t\t\tthis->exit = true;\n\t\tif(EventHandler::getInstance()->getEvent()->type == SDL_KEYDOWN ){\n\t\t\tLogger::getInstance()->writeInformation(\"Teclado\");\n\t\t\tif(EventHandler::getInstance()->getEvent()->key.keysym.sym == SDLK_r){\n\t\t\t\trestart();\n\t\t\t}\n\t\t}\n\t\tif( EventHandler::getInstance()->getEvent()->type == SDL_MOUSEBUTTONUP ){\n\t\t\tSDL_GetMouseState(&mouse_x_screen, &mouse_y_screen);\n\t\t\tstd::ostringstream oss;\n\t\t\toss << \"Mouse en \" << mouse_x_screen << \",\" << mouse_y_screen;\n\n\t\t\t\/\/ Conversion de coordenadas en pantalla a coordenadas mapa\n\n\t\t\tdouble XsTerm = (double)(mouse_x_screen - ANCHO_DEFAULT\/2)\/(double)TILE_WIDTH_DEFAULT;\n\t\t\tdouble YsTerm = (double)(mouse_y_screen - ALTO_DEFAULT\/2)\/(double)TILE_HEIGHT_DEFAULT;\n \n\t\t\tdouble x_mapa = focus_x + XsTerm + YsTerm + .5;\n\t\t\tdouble y_mapa = focus_y - XsTerm + YsTerm + .5;\n\n\t\t\toss << \"; mapa: \" << x_mapa << \",\" << y_mapa;\n\n\t\t\tLogger::getInstance()->writeInformation(oss.str().c_str());\n\t\t\tif( EventHandler::getInstance()->getEvent()->button.button == SDL_BUTTON_LEFT ) {\n\t\t\t\tLogger::getInstance()->writeInformation(\"Boton Izquierdo\");\n\t\t\t\tmodel->getBoard()->getProtagonist().setTarget(x_mapa, y_mapa);\n\t\t\t}\n\t\t\tif( EventHandler::getInstance()->getEvent()->button.button == SDL_BUTTON_RIGHT) {\n\t\t\t\tLogger::getInstance()->writeInformation(\"Boton derecho\");\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid GameWindow::scroll(){\n\tUint8 mouse_b;\n\tint mouse_x, mouse_y;\n\tconst double SCROLL_SPEED = 5;\n\n\tdouble ds = SCROLL_SPEED * model->getBoard()->dt \/ 1000; \/\/deltascroll\n\t\tSDL_GetMouseState(&mouse_x, &mouse_y);\n\n\t\tif(mouse_x <= MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = (1.0 - ((double)mouse_x \/ (double)MARGEN_PANTALLA_DEFAULT)) * ds; \n\n\t\t\tfocus_x -= dsi;\n\t\t\tfocus_y += dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia la izquierda\");\n\t\t}\n\t\telse if(mouse_x >= ANCHO_DEFAULT - MARGEN_PANTALLA_DEFAULT){\n\t\t\t\n\t\t\tdouble dsi = ((double)(mouse_x + MARGEN_PANTALLA_DEFAULT - ANCHO_DEFAULT)\/(double)MARGEN_PANTALLA_DEFAULT) * ds;\n\n\t\t\tfocus_x += dsi;\n\t\t\tfocus_y -= dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia la derecha\");\n\t\t}\n\t\tif(mouse_y <= MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = (1.0 - ((double)mouse_y \/ (double)MARGEN_PANTALLA_DEFAULT)) * ds;\n\t\t\tfocus_x -= dsi;\n\t\t\tfocus_y -= dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia arriba\");\n\t\t}\n\t\tif(mouse_y >= ALTO_DEFAULT - MARGEN_PANTALLA_DEFAULT)\n\t\t{\n\t\t\tdouble dsi = ((double)(mouse_y + MARGEN_PANTALLA_DEFAULT - ALTO_DEFAULT)\/(double)MARGEN_PANTALLA_DEFAULT) * ds;\n\n\t\t\tfocus_x += dsi;\n\t\t\tfocus_y += dsi;\n\t\t\tLogger::getInstance()->writeInformation(\"Scrolleando hacia abajo\");\n\t\t}\n\t\t\n\t\tauto & board = *(model->getBoard());\n\t\t\n\t\tif(focus_x >= board.sizeX - 1){\n\t\t\tfocus_x = board.sizeX - 1;\n\t\t}\n\t\telse if(focus_x < 0){\n\t\t\tfocus_x = 0;\n\t\t}\n\n\t\tif(focus_y >= board.sizeY - 1){\n\t\t\tfocus_y = board.sizeY - 1;\n\t\t}else if(focus_y < 0){\n\t\t\tfocus_y = 0;\n\t\t}\n}\n\nint GameWindow::start(){\n\tinit();\n\t{\n\t\tauto protagonist = model->getBoard()->getProtagonist();\n\t\tfocus_x = protagonist.getX();\n\t\tfocus_y = protagonist.getY();\n\t}\n\n\twhile (!endOfGame())\n\t{\n\t\tscroll();\n\t\tprocessInput();\n\t\tupdate();\n\t\trender();\n\n\t\tSDL_Delay(model->getBoard()->dt); \/\/ TODO: Optimizar, sacar hardcodeo\n\t}\n\treturn 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n ****************************************************************************\/\n\n\/**\n * @file\n * @brief Predicate --- Validate implementation\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#include \"validate.hpp\"\n\n#include <boost\/foreach.hpp>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace std;\n\nnamespace IronBee {\nnamespace Predicate {\nnamespace Validate {\n\nnamespace {\n\nnode_cp nth_child(\n NodeReporter reporter,\n size_t n\n)\n{\n size_t num_children = reporter.node()->children().size();\n\n if (reporter.node()->children().size() <= n) {\n reporter.error(\n \"Wanted \" + boost::lexical_cast<string>(n+1) +\n \"th child. But there are only \" +\n boost::lexical_cast<string>(num_children) + \" children.\"\n );\n return node_cp();\n }\n\n return *boost::next(reporter.node()->children().begin(), n);\n}\n\ntemplate <typename BaseClass>\nbool is_a(const node_cp& node)\n{\n return boost::dynamic_pointer_cast<const BaseClass>(node);\n}\n\n}\n\nvoid n_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children != n) {\n reporter.error(\n \"Expected \" + boost::lexical_cast<string>(n) + \" children \" +\n \" but have \" + boost::lexical_cast<string>(actual_children) +\n \".\"\n );\n }\n}\n\nvoid n_or_more_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children != n) {\n reporter.error(\n \"Expected at least \" + boost::lexical_cast<string>(n) +\n \" children but have \" +\n boost::lexical_cast<string>(actual_children) + \".\"\n );\n }\n}\n\nvoid n_or_fewer_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children != n) {\n reporter.error(\n \"Expected at most \" + boost::lexical_cast<string>(n) +\n \" children but have \" +\n boost::lexical_cast<string>(actual_children) + \".\"\n );\n }\n}\n\nvoid nth_child_is_string_literal(NodeReporter reporter, size_t n)\n{\n node_cp child = nth_child(reporter, n);\n if (child && ! is_a<String>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(n+1) + \" must be a \"\n \"string literal.\"\n );\n }\n}\n\nvoid nth_child_is_null(NodeReporter reporter, size_t n)\n{\n node_cp child = nth_child(reporter, n);\n if (child && ! is_a<Null>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(n+1) + \" must be a null.\"\n );\n }\n}\n\nvoid no_child_is_literal(NodeReporter reporter)\n{\n size_t i = 0;\n BOOST_FOREACH(const node_cp& child, reporter.node()->children()) {\n if (is_a<Literal>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(i+1) + \" must not be\"\n \"literal.\"\n );\n }\n ++i;\n }\n}\n\nvoid no_child_is_null(NodeReporter reporter)\n{\n size_t i = 0;\n BOOST_FOREACH(const node_cp& child, reporter.node()->children()) {\n if (is_a<Null>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(i+1) + \" must not be\"\n \"null.\"\n );\n }\n ++i;\n }\n}\n\n} \/\/ Validate\n} \/\/ Predicate\n} \/\/ IronBee\n<commit_msg>predicate\/validate: Fix bugs in NOrMoreChildren and NOrFewerChildren.<commit_after>\/*****************************************************************************\n * Licensed to Qualys, Inc. (QUALYS) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * QUALYS licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n ****************************************************************************\/\n\n\/**\n * @file\n * @brief Predicate --- Validate implementation\n *\n * @author Christopher Alfeld <calfeld@qualys.com>\n *\/\n\n#include \"validate.hpp\"\n\n#include <boost\/foreach.hpp>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace std;\n\nnamespace IronBee {\nnamespace Predicate {\nnamespace Validate {\n\nnamespace {\n\nnode_cp nth_child(\n NodeReporter reporter,\n size_t n\n)\n{\n size_t num_children = reporter.node()->children().size();\n\n if (reporter.node()->children().size() <= n) {\n reporter.error(\n \"Wanted \" + boost::lexical_cast<string>(n+1) +\n \"th child. But there are only \" +\n boost::lexical_cast<string>(num_children) + \" children.\"\n );\n return node_cp();\n }\n\n return *boost::next(reporter.node()->children().begin(), n);\n}\n\ntemplate <typename BaseClass>\nbool is_a(const node_cp& node)\n{\n return boost::dynamic_pointer_cast<const BaseClass>(node);\n}\n\n}\n\nvoid n_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children != n) {\n reporter.error(\n \"Expected \" + boost::lexical_cast<string>(n) + \" children \" +\n \" but have \" + boost::lexical_cast<string>(actual_children) +\n \".\"\n );\n }\n}\n\nvoid n_or_more_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children < n) {\n reporter.error(\n \"Expected at least \" + boost::lexical_cast<string>(n) +\n \" children but have \" +\n boost::lexical_cast<string>(actual_children) + \".\"\n );\n }\n}\n\nvoid n_or_fewer_children(NodeReporter reporter, size_t n)\n{\n size_t actual_children = reporter.node()->children().size();\n if (actual_children > n) {\n reporter.error(\n \"Expected at most \" + boost::lexical_cast<string>(n) +\n \" children but have \" +\n boost::lexical_cast<string>(actual_children) + \".\"\n );\n }\n}\n\nvoid nth_child_is_string_literal(NodeReporter reporter, size_t n)\n{\n node_cp child = nth_child(reporter, n);\n if (child && ! is_a<String>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(n+1) + \" must be a \"\n \"string literal.\"\n );\n }\n}\n\nvoid nth_child_is_null(NodeReporter reporter, size_t n)\n{\n node_cp child = nth_child(reporter, n);\n if (child && ! is_a<Null>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(n+1) + \" must be a null.\"\n );\n }\n}\n\nvoid no_child_is_literal(NodeReporter reporter)\n{\n size_t i = 0;\n BOOST_FOREACH(const node_cp& child, reporter.node()->children()) {\n if (is_a<Literal>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(i+1) + \" must not be\"\n \"literal.\"\n );\n }\n ++i;\n }\n}\n\nvoid no_child_is_null(NodeReporter reporter)\n{\n size_t i = 0;\n BOOST_FOREACH(const node_cp& child, reporter.node()->children()) {\n if (is_a<Null>(child)) {\n reporter.error(\n \"Child \" + boost::lexical_cast<string>(i+1) + \" must not be\"\n \"null.\"\n );\n }\n ++i;\n }\n}\n\n} \/\/ Validate\n} \/\/ Predicate\n} \/\/ IronBee\n<|endoftext|>"} {"text":"<commit_before>#ifndef __Data_course__\n#define __Data_course__\n\n#include \"general.hpp\"\n#include \"major.hpp\"\n#include \"id.hpp\"\nusing namespace std;\n\nclass Course {\nprivate: \/\/ variables\n\tID id;\n\tstring title;\n\tstring description;\n\t\n\tvector<Major> majors;\n\tvector<Department> department;\n\tstring concentrations;\n\tstring conversations;\n\tstring professor;\n\t\n\tint half_semester;\n\tbool pass_fail;\n\tfloat credits;\n\tstring location;\n\t\n\tcourse_type_t courseType;\n\tgened_t* geneds;\n\t\n\tbool days[7];\n\tfloat time[7];\nprivate: \/\/ methods\n\tvoid init(string identifier);\n\tvoid copy(const Course& c);\npublic:\n\tCourse();\n\tCourse(string str);\n\tCourse(const Course& c);\n\tCourse& operator= (const Course &c);\n\tCourse(istream &is);\n\n\tfriend bool operator== (const Course &c1, const Course &c2);\n friend bool operator!= (Course &c1, Course &c2);\n\tfriend Course getCourse(string identifier);\n\n\tvoid cleanTitle();\n\n\tDepartment getDepartment(int i = 0);\n\tstring getProfessor();\n\tID getID();\n\tstring getType();\n\tint getNumber();\n\tstring getSection();\n\n\tostream& getData(ostream& os);\n\tvoid display();\n\tvoid showAll();\n};\n\nextern vector<Course> all_courses;\n\nostream& operator<<(ostream& os, Course& item);\nCourse getCourse(string identifier);\n\n#endif\n<commit_msg>Include gened in Course<commit_after>#ifndef __Data_course__\n#define __Data_course__\n\n#include \"general.hpp\"\n#include \"major.hpp\"\n#include \"id.hpp\"\n#include \"gened.hpp\"\nusing namespace std;\n\nclass Course {\nprivate: \/\/ variables\n\tID id;\n\tstring title;\n\tstring description;\n\t\n\tvector<Major> majors;\n\tvector<Department> department;\n\tstring concentrations;\n\tstring conversations;\n\tstring professor;\n\t\n\tint half_semester;\n\tbool pass_fail;\n\tfloat credits;\n\tstring location;\n\t\n\tcourse_type_t courseType;\n\tgened_t* geneds;\n\t\n\tbool days[7];\n\tfloat time[7];\nprivate: \/\/ methods\n\tvoid init(string identifier);\n\tvoid copy(const Course& c);\npublic:\n\tCourse();\n\tCourse(string str);\n\tCourse(const Course& c);\n\tCourse& operator= (const Course &c);\n\tCourse(istream &is);\n\n\tfriend bool operator== (const Course &c1, const Course &c2);\n friend bool operator!= (Course &c1, Course &c2);\n\tfriend Course getCourse(string identifier);\n\n\tvoid cleanTitle();\n\n\tDepartment getDepartment(int i = 0);\n\tstring getProfessor();\n\tID getID();\n\tstring getType();\n\tint getNumber();\n\tstring getSection();\n\n\tostream& getData(ostream& os);\n\tvoid display();\n\tvoid showAll();\n};\n\nextern vector<Course> all_courses;\n\nostream& operator<<(ostream& os, Course& item);\nCourse getCourse(string identifier);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkXMLUnstructuredDataWriter.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkXMLUnstructuredDataWriter.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointSet.h\"\n#include \"vtkDataCompressor.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkPoints.h\"\n#include \"vtkDataSetAttributes.h\"\n\nvtkCxxRevisionMacro(vtkXMLUnstructuredDataWriter, \"1.1\");\n\n\/\/----------------------------------------------------------------------------\nvtkXMLUnstructuredDataWriter::vtkXMLUnstructuredDataWriter()\n{\n this->NumberOfPieces = 1;\n this->WritePiece = -1;\n this->GhostLevel = 0;\n this->CellPoints = vtkIdTypeArray::New();\n this->CellOffsets = vtkIdTypeArray::New();\n this->CellPoints->SetName(\"connectivity\");\n this->CellOffsets->SetName(\"offsets\");\n}\n\n\/\/----------------------------------------------------------------------------\nvtkXMLUnstructuredDataWriter::~vtkXMLUnstructuredDataWriter()\n{\n this->CellPoints->Delete();\n this->CellOffsets->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"NumberOfPieces: \" << this->NumberOfPieces << \"\\n\";\n os << indent << \"WritePiece: \" << this->WritePiece << \"\\n\";\n os << indent << \"GhostLevel: \" << this->GhostLevel << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkXMLUnstructuredDataWriter::GetInputAsPointSet()\n{\n if(this->NumberOfInputs < 1)\n {\n return 0;\n }\n \n return static_cast<vtkPointSet*>(this->Inputs[0]);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkXMLUnstructuredDataWriter::WriteData()\n{\n vtkIndent indent = vtkIndent().GetNextIndent();\n \n vtkPointSet* input = this->GetInputAsPointSet();\n input->UpdateInformation();\n \n \/\/ We don't want to write more pieces than the pipeline can produce,\n \/\/ but we need to preserve the user's requested number of pieces in\n \/\/ case the input changes later. If MaximumNumberOfPieces is lower\n \/\/ than 1, any number of pieces can be produced by the pipeline.\n int maxPieces = input->GetMaximumNumberOfPieces();\n int numPieces = this->NumberOfPieces;\n if((maxPieces > 0) && (this->NumberOfPieces > maxPieces))\n {\n this->NumberOfPieces = maxPieces;\n }\n \n \/\/ Write the file.\n this->StartFile();\n if(this->DataMode == vtkXMLWriter::Appended)\n {\n this->WriteAppendedMode(indent);\n }\n else\n {\n this->WriteInlineMode(indent);\n }\n this->EndFile();\n \n \/\/ Restore the user's number of pieces.\n this->NumberOfPieces = numPieces;\n \n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlineMode(vtkIndent indent)\n{\n ostream& os = *(this->Stream);\n vtkIndent nextIndent = indent.GetNextIndent();\n vtkPointSet* input = this->GetInputAsPointSet();\n \n \/\/ Open the primary element.\n os << indent << \"<\" << this->GetDataSetName() << \">\\n\";\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write it.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n this->SetInputUpdateExtent(i, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n \n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteInlinePieceAttributes();\n os << \">\\n\";\n \n this->WriteInlinePiece(nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n }\n else\n {\n \/\/ Write just the one requested piece.\n this->SetInputUpdateExtent(this->WritePiece, this->NumberOfPieces,\n this->GhostLevel);\n input->Update();\n \n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteInlinePieceAttributes();\n os << \">\\n\";\n \n this->WriteInlinePiece(nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n \n \/\/ Close the primary element.\n os << indent << \"<\/\" << this->GetDataSetName() << \">\\n\"; \n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlinePieceAttributes()\n{\n vtkPointSet* input = this->GetInputAsPointSet();\n this->WriteScalarAttribute(\"NumberOfPoints\",\n input->GetPoints()->GetNumberOfPoints());\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlinePiece(vtkIndent indent)\n{\n vtkPointSet* input = this->GetInputAsPointSet();\n this->WritePointsInline(input->GetPoints(), indent);\n this->WritePointDataInline(input->GetPointData(), indent);\n this->WriteCellDataInline(input->GetCellData(), indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedMode(vtkIndent indent)\n{\n ostream& os = *(this->Stream);\n vtkIndent nextIndent = indent.GetNextIndent();\n \n this->NumberOfPointsPositions = new unsigned long[this->NumberOfPieces];\n this->PointsPositions = new unsigned long[this->NumberOfPieces];\n this->PointDataPositions = new unsigned long*[this->NumberOfPieces];\n this->CellDataPositions = new unsigned long*[this->NumberOfPieces];\n \n \/\/ Update the first piece of the input to get the form of the data.\n vtkPointSet* input = this->GetInputAsPointSet();\n int piece = this->WritePiece;\n if((piece < 0) || (piece >= this->NumberOfPieces)) { piece = 0; }\n input->SetUpdateExtent(piece, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n \n \/\/ Open the primary element.\n os << indent << \"<\" << this->GetDataSetName() << \">\\n\";\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write its structure.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteAppendedPieceAttributes(i);\n os << \">\\n\";\n \n this->WriteAppendedPiece(i, nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\";\n }\n }\n else\n {\n \/\/ Write just the requested piece.\n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteAppendedPieceAttributes(this->WritePiece);\n os << \">\\n\";\n \n this->WriteAppendedPiece(this->WritePiece, nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n \n \/\/ Close the primary element.\n os << indent << \"<\/\" << this->GetDataSetName() << \">\\n\"; \n \n this->StartAppendedData();\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write its data.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n input->SetUpdateExtent(i, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n this->WriteAppendedPieceData(i);\n }\n }\n else\n {\n \/\/ Write just the requested piece.\n input->SetUpdateExtent(this->WritePiece, this->NumberOfPieces,\n this->GhostLevel);\n input->Update();\n this->WriteAppendedPieceData(this->WritePiece);\n }\n \n this->EndAppendedData();\n \n delete [] this->NumberOfPointsPositions;\n delete [] this->PointsPositions;\n delete [] this->PointDataPositions;\n delete [] this->CellDataPositions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPieceAttributes(int index)\n{\n this->NumberOfPointsPositions[index] =\n this->ReserveAttributeSpace(\"NumberOfPoints\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPiece(int index,\n vtkIndent indent)\n{\n vtkPointSet* input = this->GetInputAsPointSet(); \n \n this->PointDataPositions[index] =\n this->WritePointDataAppended(input->GetPointData(), indent);\n \n this->CellDataPositions[index] =\n this->WriteCellDataAppended(input->GetCellData(), indent);\n \n this->PointsPositions[index] =\n this->WritePointsAppended(input->GetPoints(), indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPieceData(int index)\n{\n ostream& os = *(this->Stream);\n vtkPointSet* input = this->GetInputAsPointSet();\n \n unsigned long returnPosition = os.tellp();\n os.seekp(this->NumberOfPointsPositions[index]);\n this->WriteScalarAttribute(\"NumberOfPoints\",\n input->GetPoints()->GetNumberOfPoints());\n os.seekp(returnPosition);\n \n this->WritePointDataAppendedData(input->GetPointData(),\n this->PointDataPositions[index]);\n \n this->WriteCellDataAppendedData(input->GetCellData(),\n this->CellDataPositions[index]);\n \n this->WritePointsAppendedData(input->GetPoints(),\n this->PointsPositions[index]);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteCellsInline(const char* name,\n vtkCellArray* cells,\n vtkDataArray* types,\n vtkIndent indent)\n{\n this->ConvertCells(cells);\n \n ostream& os = *(this->Stream);\n os << indent << \"<\" << name << \">\\n\";\n this->WriteDataArrayInline(this->CellPoints, indent.GetNextIndent());\n this->WriteDataArrayInline(this->CellOffsets, indent.GetNextIndent());\n if(types)\n {\n this->WriteDataArrayInline(types, indent.GetNextIndent(), \"types\");\n }\n os << indent << \"<\/\" << name << \">\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long*\nvtkXMLUnstructuredDataWriter::WriteCellsAppended(const char* name,\n vtkDataArray* types,\n vtkIndent indent)\n{\n unsigned long* positions = new unsigned long[3];\n ostream& os = *(this->Stream);\n os << indent << \"<\" << name << \">\\n\";\n positions[0] = this->WriteDataArrayAppended(this->CellPoints,\n indent.GetNextIndent());\n positions[1] = this->WriteDataArrayAppended(this->CellOffsets,\n indent.GetNextIndent());\n if(types)\n {\n positions[2] = this->WriteDataArrayAppended(types, indent.GetNextIndent(),\n \"types\");\n }\n os << indent << \"<\/\" << name << \">\\n\";\n return positions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nvtkXMLUnstructuredDataWriter::WriteCellsAppendedData(vtkCellArray* cells,\n vtkDataArray* types,\n unsigned long* positions)\n{\n this->ConvertCells(cells);\n this->WriteDataArrayAppendedData(this->CellPoints, positions[0]);\n this->WriteDataArrayAppendedData(this->CellOffsets, positions[1]);\n if(types)\n {\n this->WriteDataArrayAppendedData(types, positions[2]);\n }\n delete [] positions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::ConvertCells(vtkCellArray* cells)\n{\n vtkIdTypeArray* connectivity = cells->GetData();\n vtkIdType numberOfCells = cells->GetNumberOfCells();\n vtkIdType numberOfTuples = connectivity->GetNumberOfTuples();\n \n this->CellPoints->SetNumberOfTuples(numberOfTuples - numberOfCells);\n this->CellOffsets->SetNumberOfTuples(numberOfCells);\n \n vtkIdType* inCell = connectivity->GetPointer(0);\n vtkIdType* outCellPointsBase = this->CellPoints->GetPointer(0);\n vtkIdType* outCellPoints = outCellPointsBase;\n vtkIdType* outCellOffset = this->CellOffsets->GetPointer(0);\n \n vtkIdType i;\n for(i=0;i < numberOfCells; ++i)\n {\n vtkIdType numberOfPoints = *inCell++;\n memcpy(outCellPoints, inCell, sizeof(vtkIdType)*numberOfPoints);\n outCellPoints += numberOfPoints;\n inCell += numberOfPoints;\n *outCellOffset++ = outCellPoints - outCellPointsBase;\n }\n}\n<commit_msg>ERR: If input->GetPoints() is null, there are 0 points.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkXMLUnstructuredDataWriter.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkXMLUnstructuredDataWriter.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointSet.h\"\n#include \"vtkDataCompressor.h\"\n#include \"vtkCellArray.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkIdTypeArray.h\"\n#include \"vtkUnsignedCharArray.h\"\n#include \"vtkPoints.h\"\n#include \"vtkDataSetAttributes.h\"\n\nvtkCxxRevisionMacro(vtkXMLUnstructuredDataWriter, \"1.2\");\n\n\/\/----------------------------------------------------------------------------\nvtkXMLUnstructuredDataWriter::vtkXMLUnstructuredDataWriter()\n{\n this->NumberOfPieces = 1;\n this->WritePiece = -1;\n this->GhostLevel = 0;\n this->CellPoints = vtkIdTypeArray::New();\n this->CellOffsets = vtkIdTypeArray::New();\n this->CellPoints->SetName(\"connectivity\");\n this->CellOffsets->SetName(\"offsets\");\n}\n\n\/\/----------------------------------------------------------------------------\nvtkXMLUnstructuredDataWriter::~vtkXMLUnstructuredDataWriter()\n{\n this->CellPoints->Delete();\n this->CellOffsets->Delete();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"NumberOfPieces: \" << this->NumberOfPieces << \"\\n\";\n os << indent << \"WritePiece: \" << this->WritePiece << \"\\n\";\n os << indent << \"GhostLevel: \" << this->GhostLevel << \"\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nvtkPointSet* vtkXMLUnstructuredDataWriter::GetInputAsPointSet()\n{\n if(this->NumberOfInputs < 1)\n {\n return 0;\n }\n \n return static_cast<vtkPointSet*>(this->Inputs[0]);\n}\n\n\/\/----------------------------------------------------------------------------\nint vtkXMLUnstructuredDataWriter::WriteData()\n{\n vtkIndent indent = vtkIndent().GetNextIndent();\n \n vtkPointSet* input = this->GetInputAsPointSet();\n input->UpdateInformation();\n \n \/\/ We don't want to write more pieces than the pipeline can produce,\n \/\/ but we need to preserve the user's requested number of pieces in\n \/\/ case the input changes later. If MaximumNumberOfPieces is lower\n \/\/ than 1, any number of pieces can be produced by the pipeline.\n int maxPieces = input->GetMaximumNumberOfPieces();\n int numPieces = this->NumberOfPieces;\n if((maxPieces > 0) && (this->NumberOfPieces > maxPieces))\n {\n this->NumberOfPieces = maxPieces;\n }\n \n \/\/ Write the file.\n this->StartFile();\n if(this->DataMode == vtkXMLWriter::Appended)\n {\n this->WriteAppendedMode(indent);\n }\n else\n {\n this->WriteInlineMode(indent);\n }\n this->EndFile();\n \n \/\/ Restore the user's number of pieces.\n this->NumberOfPieces = numPieces;\n \n return 1;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlineMode(vtkIndent indent)\n{\n ostream& os = *(this->Stream);\n vtkIndent nextIndent = indent.GetNextIndent();\n vtkPointSet* input = this->GetInputAsPointSet();\n \n \/\/ Open the primary element.\n os << indent << \"<\" << this->GetDataSetName() << \">\\n\";\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write it.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n this->SetInputUpdateExtent(i, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n \n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteInlinePieceAttributes();\n os << \">\\n\";\n \n this->WriteInlinePiece(nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n }\n else\n {\n \/\/ Write just the one requested piece.\n this->SetInputUpdateExtent(this->WritePiece, this->NumberOfPieces,\n this->GhostLevel);\n input->Update();\n \n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteInlinePieceAttributes();\n os << \">\\n\";\n \n this->WriteInlinePiece(nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n \n \/\/ Close the primary element.\n os << indent << \"<\/\" << this->GetDataSetName() << \">\\n\"; \n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlinePieceAttributes()\n{\n vtkPointSet* input = this->GetInputAsPointSet();\n this->WriteScalarAttribute(\"NumberOfPoints\",\n input->GetPoints()->GetNumberOfPoints());\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteInlinePiece(vtkIndent indent)\n{\n vtkPointSet* input = this->GetInputAsPointSet();\n this->WritePointsInline(input->GetPoints(), indent);\n this->WritePointDataInline(input->GetPointData(), indent);\n this->WriteCellDataInline(input->GetCellData(), indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedMode(vtkIndent indent)\n{\n ostream& os = *(this->Stream);\n vtkIndent nextIndent = indent.GetNextIndent();\n \n this->NumberOfPointsPositions = new unsigned long[this->NumberOfPieces];\n this->PointsPositions = new unsigned long[this->NumberOfPieces];\n this->PointDataPositions = new unsigned long*[this->NumberOfPieces];\n this->CellDataPositions = new unsigned long*[this->NumberOfPieces];\n \n \/\/ Update the first piece of the input to get the form of the data.\n vtkPointSet* input = this->GetInputAsPointSet();\n int piece = this->WritePiece;\n if((piece < 0) || (piece >= this->NumberOfPieces)) { piece = 0; }\n input->SetUpdateExtent(piece, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n \n \/\/ Open the primary element.\n os << indent << \"<\" << this->GetDataSetName() << \">\\n\";\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write its structure.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteAppendedPieceAttributes(i);\n os << \">\\n\";\n \n this->WriteAppendedPiece(i, nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\";\n }\n }\n else\n {\n \/\/ Write just the requested piece.\n \/\/ Open the piece's element.\n os << nextIndent << \"<Piece\";\n this->WriteAppendedPieceAttributes(this->WritePiece);\n os << \">\\n\";\n \n this->WriteAppendedPiece(this->WritePiece, nextIndent.GetNextIndent());\n \n \/\/ Close the piece's element.\n os << nextIndent << \"<\/Piece>\\n\"; \n }\n \n \/\/ Close the primary element.\n os << indent << \"<\/\" << this->GetDataSetName() << \">\\n\"; \n \n this->StartAppendedData();\n \n if((this->WritePiece < 0) || (this->WritePiece >= this->NumberOfPieces))\n {\n \/\/ Loop over each piece and write its data.\n int i;\n for(i=0; i < this->NumberOfPieces; ++i)\n {\n input->SetUpdateExtent(i, this->NumberOfPieces, this->GhostLevel);\n input->Update();\n this->WriteAppendedPieceData(i);\n }\n }\n else\n {\n \/\/ Write just the requested piece.\n input->SetUpdateExtent(this->WritePiece, this->NumberOfPieces,\n this->GhostLevel);\n input->Update();\n this->WriteAppendedPieceData(this->WritePiece);\n }\n \n this->EndAppendedData();\n \n delete [] this->NumberOfPointsPositions;\n delete [] this->PointsPositions;\n delete [] this->PointDataPositions;\n delete [] this->CellDataPositions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPieceAttributes(int index)\n{\n this->NumberOfPointsPositions[index] =\n this->ReserveAttributeSpace(\"NumberOfPoints\");\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPiece(int index,\n vtkIndent indent)\n{\n vtkPointSet* input = this->GetInputAsPointSet(); \n \n this->PointDataPositions[index] =\n this->WritePointDataAppended(input->GetPointData(), indent);\n \n this->CellDataPositions[index] =\n this->WriteCellDataAppended(input->GetCellData(), indent);\n \n this->PointsPositions[index] =\n this->WritePointsAppended(input->GetPoints(), indent);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteAppendedPieceData(int index)\n{\n ostream& os = *(this->Stream);\n vtkPointSet* input = this->GetInputAsPointSet();\n \n unsigned long returnPosition = os.tellp();\n os.seekp(this->NumberOfPointsPositions[index]);\n vtkPoints* points = input->GetPoints();\n this->WriteScalarAttribute(\"NumberOfPoints\",\n (points?points->GetNumberOfPoints():0));\n os.seekp(returnPosition);\n \n this->WritePointDataAppendedData(input->GetPointData(),\n this->PointDataPositions[index]);\n \n this->WriteCellDataAppendedData(input->GetCellData(),\n this->CellDataPositions[index]);\n \n this->WritePointsAppendedData(input->GetPoints(),\n this->PointsPositions[index]);\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::WriteCellsInline(const char* name,\n vtkCellArray* cells,\n vtkDataArray* types,\n vtkIndent indent)\n{\n this->ConvertCells(cells);\n \n ostream& os = *(this->Stream);\n os << indent << \"<\" << name << \">\\n\";\n this->WriteDataArrayInline(this->CellPoints, indent.GetNextIndent());\n this->WriteDataArrayInline(this->CellOffsets, indent.GetNextIndent());\n if(types)\n {\n this->WriteDataArrayInline(types, indent.GetNextIndent(), \"types\");\n }\n os << indent << \"<\/\" << name << \">\\n\";\n}\n\n\/\/----------------------------------------------------------------------------\nunsigned long*\nvtkXMLUnstructuredDataWriter::WriteCellsAppended(const char* name,\n vtkDataArray* types,\n vtkIndent indent)\n{\n unsigned long* positions = new unsigned long[3];\n ostream& os = *(this->Stream);\n os << indent << \"<\" << name << \">\\n\";\n positions[0] = this->WriteDataArrayAppended(this->CellPoints,\n indent.GetNextIndent());\n positions[1] = this->WriteDataArrayAppended(this->CellOffsets,\n indent.GetNextIndent());\n if(types)\n {\n positions[2] = this->WriteDataArrayAppended(types, indent.GetNextIndent(),\n \"types\");\n }\n os << indent << \"<\/\" << name << \">\\n\";\n return positions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid\nvtkXMLUnstructuredDataWriter::WriteCellsAppendedData(vtkCellArray* cells,\n vtkDataArray* types,\n unsigned long* positions)\n{\n this->ConvertCells(cells);\n this->WriteDataArrayAppendedData(this->CellPoints, positions[0]);\n this->WriteDataArrayAppendedData(this->CellOffsets, positions[1]);\n if(types)\n {\n this->WriteDataArrayAppendedData(types, positions[2]);\n }\n delete [] positions;\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkXMLUnstructuredDataWriter::ConvertCells(vtkCellArray* cells)\n{\n vtkIdTypeArray* connectivity = cells->GetData();\n vtkIdType numberOfCells = cells->GetNumberOfCells();\n vtkIdType numberOfTuples = connectivity->GetNumberOfTuples();\n \n this->CellPoints->SetNumberOfTuples(numberOfTuples - numberOfCells);\n this->CellOffsets->SetNumberOfTuples(numberOfCells);\n \n vtkIdType* inCell = connectivity->GetPointer(0);\n vtkIdType* outCellPointsBase = this->CellPoints->GetPointer(0);\n vtkIdType* outCellPoints = outCellPointsBase;\n vtkIdType* outCellOffset = this->CellOffsets->GetPointer(0);\n \n vtkIdType i;\n for(i=0;i < numberOfCells; ++i)\n {\n vtkIdType numberOfPoints = *inCell++;\n memcpy(outCellPoints, inCell, sizeof(vtkIdType)*numberOfPoints);\n outCellPoints += numberOfPoints;\n inCell += numberOfPoints;\n *outCellOffset++ = outCellPoints - outCellPointsBase;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <sys\/stat.h>\n#include \"rawtiles.hpp\"\n\nvoid write_raw_tile(char *outdir, int z, int tx, int ty, std::string pbf) {\n\tmkdir(outdir, S_IRWXU | S_IRWXG | S_IRWXO);\n\tstd::string curdir(outdir);\n std::string slash( \"\/\" );\n std::string newdir = curdir + slash + std::to_string(z);\n\tmkdir(newdir.c_str(), S_IRWXU | S_IRWXG | S_IRWXO);\n \tnewdir = newdir + \"\/\" + std::to_string(tx);\n \tmkdir(newdir.c_str(), S_IRWXU | S_IRWXG | S_IRWXO);\n \tnewdir = newdir + \"\/\" + std::to_string(ty) + \".pbf\";\n\t\n std::ofstream pbfFile (newdir, std::ios::out | std::ios::binary);\n pbfFile.write (pbf.data(), pbf.size());\n pbfFile.close();\n}<commit_msg>Fix indentation for rawtiles.cpp<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <sys\/stat.h>\n#include \"rawtiles.hpp\"\n\nvoid write_raw_tile(char *outdir, int z, int tx, int ty, std::string pbf) {\n\tmkdir(outdir, S_IRWXU | S_IRWXG | S_IRWXO);\n\tstd::string curdir(outdir);\n\tstd::string slash( \"\/\" );\n\tstd::string newdir = curdir + slash + std::to_string(z);\n\tmkdir(newdir.c_str(), S_IRWXU | S_IRWXG | S_IRWXO);\n\tnewdir = newdir + \"\/\" + std::to_string(tx);\n\tmkdir(newdir.c_str(), S_IRWXU | S_IRWXG | S_IRWXO);\n\tnewdir = newdir + \"\/\" + std::to_string(ty) + \".pbf\";\n\n\tstd::ofstream pbfFile (newdir, std::ios::out | std::ios::binary);\n\tpbfFile.write (pbf.data(), pbf.size());\n\tpbfFile.close();\n}<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImageRectilinearWipe.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkImageRectilinearWipe.h\"\n\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkStandardNewMacro(vtkImageRectilinearWipe);\n\n\/\/----------------------------------------------------------------------------\nvtkImageRectilinearWipe::vtkImageRectilinearWipe()\n{\n this->Position[0] = 0;\n this->Position[1] = 0;\n this->Axis[0] = 0;\n this->Axis[1] = 1;\n this->Wipe = VTK_WIPE_QUAD;\n this->SetNumberOfInputPorts(2);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ This templated function executes the filter for any type of data.\n\/\/ Handles the two input operations\ntemplate <class T>\nvoid vtkImageRectilinearWipeExecute2(vtkImageRectilinearWipe *self,\n vtkImageData *inData, T *inPtr,\n vtkImageData *outData, \n T *outPtr,\n int outExt[6], int id)\n{\n int idxR, idxY, idxZ;\n int maxY, maxZ;\n vtkIdType inIncX, inIncY, inIncZ;\n vtkIdType outIncX, outIncY, outIncZ;\n int rowLength;\n unsigned long count = 0;\n unsigned long target;\n\n \/\/ find the region to loop over\n rowLength = (outExt[1] - outExt[0]+1)*inData->GetNumberOfScalarComponents();\n maxY = outExt[3] - outExt[2]; \n maxZ = outExt[5] - outExt[4];\n \n target = static_cast<unsigned long>((maxZ+1)*(maxY+1)\/50.0);\n target++;\n \n \/\/ Get increments to march through data \n inData->GetContinuousIncrements(outExt, inIncX, inIncY, inIncZ);\n outData->GetContinuousIncrements(outExt, outIncX, outIncY, outIncZ);\n\n \/\/ Loop through output pixels\n for (idxZ = 0; idxZ <= maxZ; idxZ++)\n {\n for (idxY = 0; idxY <= maxY; idxY++)\n {\n if (!id) \n {\n if (!(count%target))\n {\n self->UpdateProgress(count\/(50.0*target));\n }\n count++;\n }\n for (idxR = 0; idxR < rowLength; idxR++)\n {\n *outPtr = *inPtr;\n outPtr++;\n inPtr++;\n }\n outPtr += outIncY;\n inPtr += inIncY;\n }\n outPtr += outIncZ;\n inPtr += inIncZ;\n }\n}\n\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ This function adjusts the extents of the wipe to the output extents.\nint vtkImageRectilinearWipeClampExtents(int wipeExt[6], int outExt[6])\n{\n int status = 1;\n \n for (int i = 0; i < 3; i++)\n {\n \/\/ the lower and upper extents cannot be below the lower output extent\n if (wipeExt[2*i] < outExt[2*i])\n {\n wipeExt[2*i] = outExt[2*i];\n }\n if (wipeExt[2*i + 1] < outExt[2*i])\n {\n wipeExt[2*i + 1] = outExt[2*i];\n status = 0;\n }\n\n \/\/ the lower and upper extents cannot be above the upper output extent\n if (wipeExt[2*i] > outExt[2*i + 1])\n {\n wipeExt[2*i] = outExt[2*i + 1];\n status = 0;\n }\n if (wipeExt[2*i + 1] > outExt[2*i + 1])\n {\n wipeExt[2*i + 1] = outExt[2*i + 1];\n }\n }\n return status;\n}\n\/\/----------------------------------------------------------------------------\n\/\/ This method is passed a input and output regions, and executes the filter\n\/\/ algorithm to fill the output from the inputs based on the Wipe ivar.\nvoid vtkImageRectilinearWipe::ThreadedRequestData(\n vtkInformation * vtkNotUsed( request ), \n vtkInformationVector ** vtkNotUsed( inputVector ), \n vtkInformationVector * vtkNotUsed( outputVector ),\n vtkImageData ***inData, \n vtkImageData **outData,\n int outExt[6], int id)\n{\n void *inPtr;\n void *outPtr;\n int wipeExt[6];\n int wholeExt[6];\n int whichInput = 0;\n \n \/\/ Make sure the inputs\/output are valid\n if (inData[0][0] == NULL)\n {\n vtkErrorMacro(<< \"Input \" << 0 << \" must be specified.\");\n return;\n }\n \n \/\/ this filter expects that input is the same type as output.\n if (inData[0][0]->GetScalarType() != outData[0]->GetScalarType())\n {\n vtkErrorMacro(<< \"Execute: input ScalarType, \"\n << inData[0][0]->GetScalarType()\n << \", must match out ScalarType \"\n << outData[0]->GetScalarType());\n return;\n }\n\n if (inData[1][0] == NULL)\n {\n vtkErrorMacro(<< \"Input \" << 1 << \" must be specified.\");\n return;\n }\n\n \/\/ this filter expects that inputs that have the same number of components\n if (inData[0][0]->GetNumberOfScalarComponents() != \n inData[1][0]->GetNumberOfScalarComponents())\n {\n vtkErrorMacro(<< \"Execute: input1 NumberOfScalarComponents, \"\n << inData[0][0]->GetNumberOfScalarComponents()\n << \", must match out input2 NumberOfScalarComponents \"\n << inData[1][0]->GetNumberOfScalarComponents());\n return;\n }\n \n \/\/ Wipe pattern depends on the whole extent.\n outData[0]->GetWholeExtent(wholeExt);\n\n \/\/ Each quadrant is processed separately\n \/\/ lower left\n\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]+1] += this->Position[this->Axis[0]];\n wipeExt[2*this->Axis[1]+1] += this->Position[this->Axis[1]];\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 0;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 0;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0],\n static_cast<VTK_TT *>(inPtr),\n outData[0],\n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ lower right\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]] += (this->Position[this->Axis[0]]+1);\n wipeExt[2*this->Axis[1]+1] =\n wipeExt[2*this->Axis[1]] + this->Position[this->Axis[1]];\n\n wipeExt[0] = wholeExt[0] + this->Position[0] + 1;\n wipeExt[1] = wholeExt[1];\n wipeExt[2] = wholeExt[2];\n wipeExt[3] = wholeExt[2] + this->Position[1];\n wipeExt[4] = wholeExt[4];\n wipeExt[5] = wholeExt[5];\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 1;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 1;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 0;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0], \n static_cast<VTK_TT *>(inPtr),\n outData[0], \n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ upper left\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]+1] = wipeExt[2*this->Axis[0]] + this->Position[this->Axis[0]];\n wipeExt[2*this->Axis[1]] += (this->Position[this->Axis[1]] + 1);\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 1;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 0;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 0;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0], \n static_cast<VTK_TT *>(inPtr),\n outData[0], \n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ upper right\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]] += (this->Position[this->Axis[0]] + 1);\n wipeExt[2*this->Axis[1]] += (this->Position[this->Axis[1]] + 1);\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 0;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 1;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 0;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0], \n static_cast<VTK_TT *>(inPtr),\n outData[0], \n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n}\n\nvoid vtkImageRectilinearWipe::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"Position: (\" << this->Position[0] << \", \"\n << this->Position[1] << \")\\n\";\n os << indent << \"Wipe: \";\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n os << \"Quad\" << endl;\n break;\n case VTK_WIPE_HORIZONTAL:\n os << \"Horizontal\" << endl;\n break;\n case VTK_WIPE_VERTICAL:\n os << \"Vertical\" << endl;\n break;\n case VTK_WIPE_LOWER_LEFT:\n os << \"LowerLeft\" << endl;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n os << \"LowerRight\" << endl;\n break;\n case VTK_WIPE_UPPER_LEFT:\n os << \"UpperLeft\" << endl;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n os << \"UpperRight\" << endl;\n break;\n }\n}\n\n<commit_msg>BUG: Fix missing printself ivar.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkImageRectilinearWipe.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkImageRectilinearWipe.h\"\n\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n\nvtkStandardNewMacro(vtkImageRectilinearWipe);\n\n\/\/----------------------------------------------------------------------------\nvtkImageRectilinearWipe::vtkImageRectilinearWipe()\n{\n this->Position[0] = 0;\n this->Position[1] = 0;\n this->Axis[0] = 0;\n this->Axis[1] = 1;\n this->Wipe = VTK_WIPE_QUAD;\n this->SetNumberOfInputPorts(2);\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ This templated function executes the filter for any type of data.\n\/\/ Handles the two input operations\ntemplate <class T>\nvoid vtkImageRectilinearWipeExecute2(vtkImageRectilinearWipe *self,\n vtkImageData *inData, T *inPtr,\n vtkImageData *outData,\n T *outPtr,\n int outExt[6], int id)\n{\n int idxR, idxY, idxZ;\n int maxY, maxZ;\n vtkIdType inIncX, inIncY, inIncZ;\n vtkIdType outIncX, outIncY, outIncZ;\n int rowLength;\n unsigned long count = 0;\n unsigned long target;\n\n \/\/ find the region to loop over\n rowLength = (outExt[1] - outExt[0]+1)*inData->GetNumberOfScalarComponents();\n maxY = outExt[3] - outExt[2];\n maxZ = outExt[5] - outExt[4];\n\n target = static_cast<unsigned long>((maxZ+1)*(maxY+1)\/50.0);\n target++;\n\n \/\/ Get increments to march through data\n inData->GetContinuousIncrements(outExt, inIncX, inIncY, inIncZ);\n outData->GetContinuousIncrements(outExt, outIncX, outIncY, outIncZ);\n\n \/\/ Loop through output pixels\n for (idxZ = 0; idxZ <= maxZ; idxZ++)\n {\n for (idxY = 0; idxY <= maxY; idxY++)\n {\n if (!id)\n {\n if (!(count%target))\n {\n self->UpdateProgress(count\/(50.0*target));\n }\n count++;\n }\n for (idxR = 0; idxR < rowLength; idxR++)\n {\n *outPtr = *inPtr;\n outPtr++;\n inPtr++;\n }\n outPtr += outIncY;\n inPtr += inIncY;\n }\n outPtr += outIncZ;\n inPtr += inIncZ;\n }\n}\n\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ This function adjusts the extents of the wipe to the output extents.\nint vtkImageRectilinearWipeClampExtents(int wipeExt[6], int outExt[6])\n{\n int status = 1;\n\n for (int i = 0; i < 3; i++)\n {\n \/\/ the lower and upper extents cannot be below the lower output extent\n if (wipeExt[2*i] < outExt[2*i])\n {\n wipeExt[2*i] = outExt[2*i];\n }\n if (wipeExt[2*i + 1] < outExt[2*i])\n {\n wipeExt[2*i + 1] = outExt[2*i];\n status = 0;\n }\n\n \/\/ the lower and upper extents cannot be above the upper output extent\n if (wipeExt[2*i] > outExt[2*i + 1])\n {\n wipeExt[2*i] = outExt[2*i + 1];\n status = 0;\n }\n if (wipeExt[2*i + 1] > outExt[2*i + 1])\n {\n wipeExt[2*i + 1] = outExt[2*i + 1];\n }\n }\n return status;\n}\n\/\/----------------------------------------------------------------------------\n\/\/ This method is passed a input and output regions, and executes the filter\n\/\/ algorithm to fill the output from the inputs based on the Wipe ivar.\nvoid vtkImageRectilinearWipe::ThreadedRequestData(\n vtkInformation * vtkNotUsed( request ),\n vtkInformationVector ** vtkNotUsed( inputVector ),\n vtkInformationVector * vtkNotUsed( outputVector ),\n vtkImageData ***inData,\n vtkImageData **outData,\n int outExt[6], int id)\n{\n void *inPtr;\n void *outPtr;\n int wipeExt[6];\n int wholeExt[6];\n int whichInput = 0;\n\n \/\/ Make sure the inputs\/output are valid\n if (inData[0][0] == NULL)\n {\n vtkErrorMacro(<< \"Input \" << 0 << \" must be specified.\");\n return;\n }\n\n \/\/ this filter expects that input is the same type as output.\n if (inData[0][0]->GetScalarType() != outData[0]->GetScalarType())\n {\n vtkErrorMacro(<< \"Execute: input ScalarType, \"\n << inData[0][0]->GetScalarType()\n << \", must match out ScalarType \"\n << outData[0]->GetScalarType());\n return;\n }\n\n if (inData[1][0] == NULL)\n {\n vtkErrorMacro(<< \"Input \" << 1 << \" must be specified.\");\n return;\n }\n\n \/\/ this filter expects that inputs that have the same number of components\n if (inData[0][0]->GetNumberOfScalarComponents() !=\n inData[1][0]->GetNumberOfScalarComponents())\n {\n vtkErrorMacro(<< \"Execute: input1 NumberOfScalarComponents, \"\n << inData[0][0]->GetNumberOfScalarComponents()\n << \", must match out input2 NumberOfScalarComponents \"\n << inData[1][0]->GetNumberOfScalarComponents());\n return;\n }\n\n \/\/ Wipe pattern depends on the whole extent.\n outData[0]->GetWholeExtent(wholeExt);\n\n \/\/ Each quadrant is processed separately\n \/\/ lower left\n\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]+1] += this->Position[this->Axis[0]];\n wipeExt[2*this->Axis[1]+1] += this->Position[this->Axis[1]];\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 0;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 0;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0],\n static_cast<VTK_TT *>(inPtr),\n outData[0],\n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ lower right\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]] += (this->Position[this->Axis[0]]+1);\n wipeExt[2*this->Axis[1]+1] =\n wipeExt[2*this->Axis[1]] + this->Position[this->Axis[1]];\n\n wipeExt[0] = wholeExt[0] + this->Position[0] + 1;\n wipeExt[1] = wholeExt[1];\n wipeExt[2] = wholeExt[2];\n wipeExt[3] = wholeExt[2] + this->Position[1];\n wipeExt[4] = wholeExt[4];\n wipeExt[5] = wholeExt[5];\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 1;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 1;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 0;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 0;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0],\n static_cast<VTK_TT *>(inPtr),\n outData[0],\n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ upper left\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]+1] = wipeExt[2*this->Axis[0]] + this->Position[this->Axis[0]];\n wipeExt[2*this->Axis[1]] += (this->Position[this->Axis[1]] + 1);\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 1;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 0;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 0;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 1;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0],\n static_cast<VTK_TT *>(inPtr),\n outData[0],\n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n\n \/\/ upper right\n memcpy (wipeExt, wholeExt, 6 * sizeof (int));\n wipeExt[2*this->Axis[0]] += (this->Position[this->Axis[0]] + 1);\n wipeExt[2*this->Axis[1]] += (this->Position[this->Axis[1]] + 1);\n\n if (vtkImageRectilinearWipeClampExtents(wipeExt, outExt))\n {\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n whichInput = 0;\n break;\n case VTK_WIPE_HORIZONTAL:\n whichInput = 1;\n break;\n case VTK_WIPE_VERTICAL:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_LEFT:\n whichInput = 1;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n whichInput = 0;\n break;\n }\n inPtr = inData[whichInput][0]->GetScalarPointerForExtent(wipeExt);\n outPtr = outData[0]->GetScalarPointerForExtent(wipeExt);\n switch (inData[0][0]->GetScalarType())\n {\n vtkTemplateMacro(\n vtkImageRectilinearWipeExecute2(this,\n inData[whichInput][0],\n static_cast<VTK_TT *>(inPtr),\n outData[0],\n static_cast<VTK_TT *>(outPtr),\n wipeExt, id));\n default:\n vtkErrorMacro(<< \"Execute: Unknown ScalarType\");\n return;\n }\n }\n}\n\nvoid vtkImageRectilinearWipe::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"Position: (\" << this->Position[0] << \", \"\n << this->Position[1] << \")\\n\";\n os << indent << \"Position: (\" << this->Axis[0] << \", \"\n << this->Axis[1] << \", \" << this->Axis[1] << \")\\n\";\n os << indent << \"Wipe: \";\n switch (this->Wipe)\n {\n case VTK_WIPE_QUAD:\n os << \"Quad\" << endl;\n break;\n case VTK_WIPE_HORIZONTAL:\n os << \"Horizontal\" << endl;\n break;\n case VTK_WIPE_VERTICAL:\n os << \"Vertical\" << endl;\n break;\n case VTK_WIPE_LOWER_LEFT:\n os << \"LowerLeft\" << endl;\n break;\n case VTK_WIPE_LOWER_RIGHT:\n os << \"LowerRight\" << endl;\n break;\n case VTK_WIPE_UPPER_LEFT:\n os << \"UpperLeft\" << endl;\n break;\n case VTK_WIPE_UPPER_RIGHT:\n os << \"UpperRight\" << endl;\n break;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef LUCE_HEADER_UTILITY_CPP98HEADER_HH\r\n#define LUCE_HEADER_UTILITY_CPP98HEADER_HH\r\n\r\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/header\r\n\r\n\/\/ Utility\r\n#include <bitset>\r\n#include <csetjmp>\r\n#include <csignal>\r\n#include <cstdarg>\r\n#include <cstddef>\r\n#include <cstdlib>\r\n#include <ctime>\r\n#include <functional>\r\n#include <typeinfo>\r\n#include <utility>\r\n\r\n\/\/ Memory\r\n#include <memory>\r\n#include <new>\r\n\r\n\/\/ Numeric limit\r\n#include <cfloat>\r\n#include <climits>\r\n#include <limits>\r\n\r\n\/\/ Error\r\n#include <cassert>\r\n#include <cerrno>\r\n#include <exception>\r\n#include <stdexcept>\r\n\r\n\/\/ String\r\n#include <cctype>\r\n#include <cstring>\r\n#include <cwchar>\r\n#include <cwctype>\r\n#include <string>\r\n\r\n\/\/ Container\r\n#include <deque>\r\n#include <list>\r\n#include <map>\r\n#include <queue>\r\n#include <set>\r\n#include <stack>\r\n#include <vector>\r\n\r\n\/\/ Algorithm\r\n#include <algorithm>\r\n\r\n\/\/ Iterator\r\n#include <iterator>\r\n\r\n\/\/ Numberic\r\n#include <cmath>\r\n#include <complex>\r\n#include <numeric>\r\n#include <valarray>\r\n\r\n\/\/ IO\r\n#include <cstdio>\r\n#include <fstream>\r\n#include <iomanip>\r\n#include <ios>\r\n#include <iosfwd>\r\n#include <iostream>\r\n#include <istream>\r\n#include <ostream>\r\n#include <sstream>\r\n#include <strstream>\r\n#include <streambuf>\r\n\r\n\/\/ Localization\r\n#include <locale>\r\n#include <clocale>\r\n\r\n\/\/ Etc\r\n#include <ciso646>\r\n\r\n#endif<commit_msg>Fix Misprint<commit_after>#ifndef LUCE_HEADER_UTILITY_CPP98HEADER_HH\r\n#define LUCE_HEADER_UTILITY_CPP98HEADER_HH\r\n\r\n\/\/ http:\/\/en.cppreference.com\/w\/cpp\/header\r\n\r\n\/\/ Utility\r\n#include <bitset>\r\n#include <csetjmp>\r\n#include <csignal>\r\n#include <cstdarg>\r\n#include <cstddef>\r\n#include <cstdlib>\r\n#include <ctime>\r\n#include <functional>\r\n#include <typeinfo>\r\n#include <utility>\r\n\r\n\/\/ Memory\r\n#include <memory>\r\n#include <new>\r\n\r\n\/\/ Numeric limit\r\n#include <cfloat>\r\n#include <climits>\r\n#include <limits>\r\n\r\n\/\/ Error\r\n#include <cassert>\r\n#include <cerrno>\r\n#include <exception>\r\n#include <stdexcept>\r\n\r\n\/\/ String\r\n#include <cctype>\r\n#include <cstring>\r\n#include <cwchar>\r\n#include <cwctype>\r\n#include <string>\r\n\r\n\/\/ Container\r\n#include <deque>\r\n#include <list>\r\n#include <map>\r\n#include <queue>\r\n#include <set>\r\n#include <stack>\r\n#include <vector>\r\n\r\n\/\/ Algorithm\r\n#include <algorithm>\r\n\r\n\/\/ Iterator\r\n#include <iterator>\r\n\r\n\/\/ Numeric\r\n#include <cmath>\r\n#include <complex>\r\n#include <numeric>\r\n#include <valarray>\r\n\r\n\/\/ IO\r\n#include <cstdio>\r\n#include <fstream>\r\n#include <iomanip>\r\n#include <ios>\r\n#include <iosfwd>\r\n#include <iostream>\r\n#include <istream>\r\n#include <ostream>\r\n#include <sstream>\r\n#include <strstream>\r\n#include <streambuf>\r\n\r\n\/\/ Localization\r\n#include <locale>\r\n#include <clocale>\r\n\r\n\/\/ Etc\r\n#include <ciso646>\r\n\r\n#endif<|endoftext|>"} {"text":"<commit_before>\/* This is free and unencumbered software released into the public domain. *\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"md5.h\"\n<commit_msg>Added a static assertion to ensure sizeof(md5) is correct.<commit_after>\/* This is free and unencumbered software released into the public domain. *\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"md5.h\"\n\nusing namespace rfc1321;\n\nstatic_assert(sizeof(md5) == 16, \"sizeof(rfc1321::md5) != 16\");\n<|endoftext|>"} {"text":"<commit_before>\n#include \"SystemAudacity.h\"\n#include <Jumpropes\/Functions.h>\n\nAudacityRover::SystemAudacity::SystemAudacity() : OpenALRF::SystemLinux()\n{\n}\n\nbool AudacityRover::SystemAudacity::HasValidActiveNetwork()\n{\n bool HasNetwork = false;\n\n auto list = Jumpropes::ListNetworkInterfaces();\n for (auto netif : list)\n {\n std::cout << netif.IP.ip.getValue() << std::endl;\n\n if (!netif.IP.ip.startsWith_ansi(\"127.\") && !netif.IP.ip.startsWith_ansi(\"0.\") && !netif.IP.ip.startsWith_ansi(\"169.254.\"))\n {\n HasNetwork = true;\n break;\n }\n }\n std::cout << \"-----\" << std::endl;\n\n return HasNetwork;\n}\n\nstd::string AudacityRover::SystemAudacity::GetStatusInfo()\n{\n return std::string();\n}\n<commit_msg>so that's why<commit_after>\n#include \"SystemAudacity.h\"\n#include <Jumpropes\/Functions.h>\n\nAudacityRover::SystemAudacity::SystemAudacity() : OpenALRF::SystemLinux()\n{\n}\n\nbool AudacityRover::SystemAudacity::HasValidActiveNetwork()\n{\n bool HasNetwork = false;\n\n \/\/ note for RaspberryPi; you need to remove the 127.0.1.1 line in the \/etc\/hosts file as it will confuse this into thinking that's the only IP address we have\n auto list = Jumpropes::ListNetworkInterfaces();\n for (auto netif : list)\n {\n if (!netif.IP.ip.startsWith_ansi(\"127.\") && !netif.IP.ip.startsWith_ansi(\"0.\") && !netif.IP.ip.startsWith_ansi(\"169.254.\"))\n {\n HasNetwork = true;\n break;\n }\n }\n\n return HasNetwork;\n}\n\nstd::string AudacityRover::SystemAudacity::GetStatusInfo()\n{\n return std::string();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n#include <Riostream.h>\n\n#include <TDirectory.h>\n\n#include \"AliRunLoader.h\"\n#include <AliESD.h>\n#include \"AliLog.h\"\n#include \"AliT0Loader.h\"\n#include <TClonesArray.h>\n#include \"AliT0RecPoint.h\"\n#include \"AliRawReader.h\"\n#include \"AliT0RawReader.h\"\n#include \"AliT0digit.h\"\n#include \"AliT0Reconstructor.h\"\n#include \"AliT0Parameters.h\"\n#include \"AliT0Calibrator.h\"\n#include \"AliCDBLocal.h\"\n#include \"AliCDBStorage.h\"\n#include \"AliCDBManager.h\"\n#include \"AliCDBEntry.h\"\n\n#include <TArrayI.h>\n#include <TGraph.h>\n\nClassImp(AliT0Reconstructor)\n\n AliT0Reconstructor:: AliT0Reconstructor(): AliReconstructor(),\n\t\t\tfDigits(NULL),\n\t\t\tfTree(0x0),\n\t\t\tfZposition(0)\n\n{\n AliDebug(1,\"Start reconstructor \");\n}\n\/\/____________________________________________________________________\n\nAliT0Reconstructor::AliT0Reconstructor(const AliT0Reconstructor &r):\n fDigits(NULL),\n fTree(0x0),\n fZposition(0)\n \n{\n \/\/\n \/\/ AliT0Reconstructor copy constructor\n \/\/\n\n ((AliT0Reconstructor &) r).Copy(*this);\n\n}\n\n\/\/_____________________________________________________________________________\nAliT0Reconstructor &AliT0Reconstructor::operator=(const AliT0Reconstructor &r)\n{\n \/\/\n \/\/ Assignment operator\n \/\/\n\n if (this != &r) ((AliT0Reconstructor &) r).Copy(*this);\n return *this;\n\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliT0Reconstructor::Reconstruct(TTree*digitsTree, TTree*clustersTree) const\n\n{\n\/\/ T0 digits reconstruction\n\/\/ T0RecPoint writing \n\n \n Float_t timeDelayLED[24];\n Float_t zdetA,zdetC;\n TObjArray slewingLEDrec;\n TObjArray walk;\n \n TArrayI * timeCFD = new TArrayI(24); \n TArrayI * timeLED = new TArrayI(24); \n TArrayI * chargeQT0 = new TArrayI(24); \n TArrayI * chargeQT1 = new TArrayI(24); \n \n AliT0Parameters* param = AliT0Parameters::Instance();\n param->Init();\n AliT0Calibrator *calib=new AliT0Calibrator(); \n\n Int_t mV2Mip = param->GetmV2Mip(); \n \/\/mV2Mip = param->GetmV2Mip(); \n Int_t channelWidth = param->GetChannelWidth() ; \n \n for (Int_t i=0; i<24; i++){\n TGraph* gr = param ->GetSlewRec(i);\n slewingLEDrec.AddAtAndExpand(gr,i) ; \n }\n zdetC = param->GetZposition(0);\n zdetA = param->GetZposition(1);\n \n AliDebug(1,Form(\"Start DIGITS reconstruction \"));\n\n TBranch *brDigits=digitsTree->GetBranch(\"T0\");\n AliT0digit *fDigits = new AliT0digit() ;\n if (brDigits) {\n brDigits->SetAddress(&fDigits);\n }else{\n cerr<<\"EXEC Branch T0 digits not found\"<<endl;\n return;\n }\n \n digitsTree->GetEvent(0);\n digitsTree->GetEntry(0);\n brDigits->GetEntry(0);\n fDigits->GetTimeCFD(*timeCFD);\n fDigits->GetTimeLED(*timeLED);\n fDigits->GetQT0(*chargeQT0);\n fDigits->GetQT1(*chargeQT1);\n \n Float_t besttimeA=999999;\n Float_t besttimeC=999999;\n Int_t pmtBestA=99999;\n Int_t pmtBestC=99999;\n Float_t timeDiff=999999, meanTime=0;\n \n\n\n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n clustersTree->Branch( \"T0\", \"AliT0RecPoint\" ,&frecpoints, 405,1);\n\n Float_t time[24], adc[24];\n for (Int_t ipmt=0; ipmt<24; ipmt++) {\n if(timeCFD->At(ipmt)>0 ){\n Int_t qt0= chargeQT0->At(ipmt);\n Int_t qt1= chargeQT1->At(ipmt);\n if((qt1-qt0)>0) adc[ipmt] = TMath::Exp( Double_t (channelWidth*(qt1-qt0)\/1000));\n time[ipmt] = channelWidth * (calib-> WalkCorrection( ipmt,qt1 , timeCFD->At(ipmt) ) ) ;\n \n \/\/LED\n Double_t sl = (timeLED->At(ipmt) - timeCFD->At(ipmt)- (1000.*timeDelayLED[ipmt]\/channelWidth))*channelWidth;\n Double_t qt=((TGraph*)slewingLEDrec.At(ipmt))->Eval(sl\/1000.);\n frecpoints->SetTime(ipmt,time[ipmt]);\n frecpoints->SetAmp(ipmt,adc[ipmt]);\n frecpoints->SetAmpLED(ipmt,qt);\n }\n else {\n time[ipmt] = 0;\n adc[ipmt] = 0;\n }\n }\n\n for (Int_t ipmt=0; ipmt<12; ipmt++){\n if(time[ipmt] > 1 ) {\n if(time[ipmt]<besttimeC){\n\tbesttimeC=time[ipmt]; \/\/timeC\n\tpmtBestC=ipmt;\n }\n }\n }\n for ( Int_t ipmt=12; ipmt<24; ipmt++){\n if(time[ipmt] > 1) {\n if(time[ipmt]<besttimeA) {\n\tbesttimeA=time[ipmt]; \/\/timeA\n pmtBestA=ipmt;}\n }\n }\n if(besttimeA !=999999) frecpoints->SetTimeBestA(Int_t(besttimeA));\n if( besttimeC != 999999 ) frecpoints->SetTimeBestC(Int_t(besttimeC));\n AliDebug(1,Form(\" besttimeA %f ps, besttimeC %f ps\",besttimeA, besttimeC));\n Float_t c = 0.0299792; \/\/ cm\/ps\n Float_t vertex = 0;\n if(besttimeA !=999999 && besttimeC != 999999 ){\n timeDiff = besttimeC - besttimeA;\n meanTime = (besttimeA + besttimeC)\/2.;\n vertex = c*(timeDiff)\/2.; \/\/-(lenr-lenl))\/2;\n AliDebug(1,Form(\" timeDiff %f ps, meanTime %f ps, vertex %f cm\",timeDiff, meanTime,vertex ));\n frecpoints->SetVertex(vertex);\n frecpoints->SetMeanTime(Int_t(meanTime));\n \n }\n clustersTree->Fill();\n}\n\n\n\/\/_______________________________________________________________________\n\nvoid AliT0Reconstructor::Reconstruct(AliRawReader* rawReader, TTree*recTree) const\n{\n\/\/ T0 raw ->\n\/\/ T0RecPoint writing \n\n \/\/Q->T-> coefficients !!!! should be asked!!!\n Float_t timeDelayLED[24];\n Float_t zdetA,zdetC;\n TObjArray slewingLEDrec;\n TObjArray walk;\n \n TArrayI * timeCFD = new TArrayI(24); \n TArrayI * timeLED = new TArrayI(24); \n TArrayI * chargeQT0 = new TArrayI(24); \n TArrayI * chargeQT1 = new TArrayI(24); \n\n AliT0RawReader myrawreader(rawReader);\n if (!myrawreader.Next())\n AliDebug(1,Form(\" no raw data found!! %i\", myrawreader.Next()));\n Int_t allData[110][5];\n for (Int_t i=0; i<110; i++) {\n allData[i][0]=myrawreader.GetData(i,0);\n }\n\n AliT0Parameters* param = AliT0Parameters::Instance();\n param->Init();\n AliT0Calibrator *calib=new AliT0Calibrator(); \n\n Int_t mV2Mip = param->GetmV2Mip(); \n \/\/mV2Mip = param->GetmV2Mip(); \n Int_t channelWidth = param->GetChannelWidth() ; \n \n for (Int_t i=0; i<24; i++){\n TGraph* gr = param ->GetSlewRec(i);\n slewingLEDrec.AddAtAndExpand(gr,i) ; \n }\n \n zdetC = param->GetZposition(0);\n zdetA = param->GetZposition(1);\n \n for (Int_t in=0; in<24; in++)\n {\n timeLED->AddAt(allData[in+1][0],in);\n timeCFD->AddAt(allData[in+25][0],in);\n chargeQT1->AddAt(allData[in+55][0],in);\n chargeQT0->AddAt(allData[in+79][0],in);\n AliDebug(10, Form(\" readed Raw %i %i %i %i %i\", in, timeLED->At(in),timeCFD->At(in),chargeQT0->At(in),chargeQT1->At(in)));\n }\n\n Float_t besttimeA=999999;\n Float_t besttimeC=999999;\n Int_t pmtBestA=99999;\n Int_t pmtBestC=99999;\n Float_t timeDiff=999999, meanTime=0;\n\n \n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n \n recTree->Branch( \"T0\", \"AliT0RecPoint\" ,&frecpoints, 405,1);\n \n\n Float_t time[24], adc[24];\n for (Int_t ipmt=0; ipmt<24; ipmt++) {\n if(timeCFD->At(ipmt)>0 ){\n Int_t qt0= chargeQT0->At(ipmt);\n Int_t qt1= chargeQT1->At(ipmt);\n if((qt1-qt0)>0) adc[ipmt] = TMath::Exp( Double_t (channelWidth*(qt1-qt0)\/1000));\n time[ipmt] = channelWidth * (calib-> WalkCorrection( ipmt,qt1 , timeCFD->At(ipmt) ) ) ;\n Double_t sl = (timeLED->At(ipmt) - timeCFD->At(ipmt)- (1000.*timeDelayLED[ipmt]\/channelWidth))*channelWidth;\n Double_t qt=((TGraph*)slewingLEDrec.At(ipmt))->Eval(sl\/1000.);\n frecpoints->SetTime(ipmt,time[ipmt]);\n frecpoints->SetAmp(ipmt,adc[ipmt]);\n frecpoints->SetAmpLED(ipmt,qt);\n }\n else {\n time[ipmt] = 0;\n adc[ipmt] = 0;\n }\n }\n\n for (Int_t ipmt=0; ipmt<12; ipmt++){\n if(time[ipmt] > 1 ) {\n if(time[ipmt]<besttimeC){\n\tbesttimeC=time[ipmt]; \/\/timeC\n\tpmtBestC=ipmt;\n }\n }\n }\n for ( Int_t ipmt=12; ipmt<24; ipmt++){\n if(time[ipmt] > 1) {\n if(time[ipmt]<besttimeA) {\n\tbesttimeA=time[ipmt]; \/\/timeA\n pmtBestA=ipmt;}\n }\n }\n if(besttimeA !=999999) frecpoints->SetTimeBestA(Int_t(besttimeA));\n if( besttimeC != 999999 ) frecpoints->SetTimeBestC(Int_t(besttimeC));\n AliDebug(1,Form(\" besttimeA %f ps, besttimeC %f ps\",besttimeA, besttimeC));\n Float_t c = 0.0299792; \/\/ cm\/ps\n Float_t vertex = 0;\n if(besttimeA !=999999 && besttimeC != 999999 ){\n timeDiff = besttimeC - besttimeA;\n meanTime = (besttimeA + besttimeC)\/2.;\n vertex = c*(timeDiff)\/2.; \/\/-(lenr-lenl))\/2;\n AliDebug(1,Form(\" timeDiff %f ps, meanTime %f ps, vertex %f cm\",timeDiff, meanTime,vertex ));\n frecpoints->SetVertex(vertex);\n frecpoints->SetMeanTime(Int_t(meanTime));\n \n }\n recTree->Fill();\n}\n\/\/____________________________________________________________\n\nvoid AliT0Reconstructor::FillESD(AliRunLoader* runLoader, AliESD *pESD) const\n{\n\n \/***************************************************\n Resonstruct digits to vertex position\n ****************************************************\/\n \n \n if (!runLoader) {\n AliError(\"Reconstruct >> No run loader\");\n return;\n }\n \n AliDebug(1,Form(\"Start FillESD T0\"));\n\n AliT0Loader* pStartLoader = (AliT0Loader*) runLoader->GetLoader(\"T0Loader\");\n \n pStartLoader->LoadRecPoints(\"READ\");\n\n TTree *treeR = pStartLoader->TreeR();\n \n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n if (!frecpoints) {\n AliError(\"Reconstruct Fill ESD >> no recpoints found\");\n return;\n }\n \n AliDebug(1,Form(\"Start FillESD T0\"));\n TBranch *brRec = treeR->GetBranch(\"T0\");\n if (brRec) {\n brRec->SetAddress(&frecpoints);\n }else{\n cerr<<\"EXEC Branch T0 rec not found\"<<endl;\n \/\/ exit(111);\n return;\n } \n \n brRec->GetEntry(0);\n Float_t timeStart, Zposition, amp[24], time[24];\n Int_t mean0 = 12450;\n Int_t i;\n Zposition = frecpoints -> GetVertex();\n timeStart = frecpoints -> GetMeanTime() - mean0;\n for ( i=0; i<24; i++) {\n time[i] = Float_t (frecpoints -> GetTime(i)) \/ 1000.; \/\/ ps to ns\n amp[i] = frecpoints -> GetAmp(i);\n }\n pESD->SetT0zVertex(Zposition); \/\/vertex Z position \n pESD->SetT0(timeStart); \/\/ interaction time \n pESD->SetT0time(time); \/\/ best TOF on each PMT \n pESD->SetT0amplitude(amp); \/\/ number of particles(MIPs) on each PMT\n cout<<\" ESD >> \"<<Zposition<<\" \"<<timeStart<<endl;\n\n pStartLoader->UnloadRecPoints();\n \n} \/\/ vertex in 3 sigma\n\n\n\n\n\n\n<commit_msg>memory leak eliminated<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n#include <Riostream.h>\n\n#include <TDirectory.h>\n\n#include \"AliRunLoader.h\"\n#include <AliESD.h>\n#include \"AliLog.h\"\n#include \"AliT0Loader.h\"\n#include \"AliT0RecPoint.h\"\n#include \"AliRawReader.h\"\n#include \"AliT0RawReader.h\"\n#include \"AliT0digit.h\"\n#include \"AliT0Reconstructor.h\"\n#include \"AliT0Parameters.h\"\n#include \"AliT0Calibrator.h\"\n#include \"AliCDBLocal.h\"\n#include \"AliCDBStorage.h\"\n#include \"AliCDBManager.h\"\n#include \"AliCDBEntry.h\"\n\n#include <TArrayI.h>\n#include <TGraph.h>\n\/\/#include <TGeoManager.h>\n\/\/#include <TClonesArray.h>\n\/\/#include <TString.h>\n\/\/#include <TGeoPNEntry.h>\n\/\/#include <TGeoPhysicalNode.h>\n\/\/#include <TGeoHMatrix.h>\n\nClassImp(AliT0Reconstructor)\n\n AliT0Reconstructor:: AliT0Reconstructor(): AliReconstructor(),\n\t\t\t\t\t fZposition(0)\n\n{\n AliDebug(1,\"Start reconstructor \");\n}\n\/\/____________________________________________________________________\n\nAliT0Reconstructor::AliT0Reconstructor(const AliT0Reconstructor &r):\n fZposition(0)\n \n{\n \/\/\n \/\/ AliT0Reconstructor copy constructor\n \/\/\n\n ((AliT0Reconstructor &) r).Copy(*this);\n\n}\n\n\/\/_____________________________________________________________________________\nAliT0Reconstructor &AliT0Reconstructor::operator=(const AliT0Reconstructor &r)\n{\n \/\/\n \/\/ Assignment operator\n \/\/\n\n if (this != &r) ((AliT0Reconstructor &) r).Copy(*this);\n return *this;\n\n}\n\n\/\/_____________________________________________________________________________\n\nvoid AliT0Reconstructor::Reconstruct(TTree*digitsTree, TTree*clustersTree) const\n\n{\n\/\/ T0 digits reconstruction\n\/\/ T0RecPoint writing \n\n \n Float_t timeDelayLED[24];\n Float_t zdetA,zdetC;\n TObjArray slewingLEDrec;\n TObjArray walk;\n \n TArrayI * timeCFD = new TArrayI(24); \n TArrayI * timeLED = new TArrayI(24); \n TArrayI * chargeQT0 = new TArrayI(24); \n TArrayI * chargeQT1 = new TArrayI(24); \n \n AliT0Parameters* param = AliT0Parameters::Instance();\n param->Init();\n AliT0Calibrator *calib=new AliT0Calibrator(); \n\n Int_t mV2Mip = param->GetmV2Mip(); \n \/\/mV2Mip = param->GetmV2Mip(); \n Int_t channelWidth = param->GetChannelWidth() ; \n \n for (Int_t i=0; i<24; i++){\n TGraph* gr = param ->GetSlewRec(i);\n slewingLEDrec.AddAtAndExpand(gr,i) ; \n }\n zdetC = param->GetZposition(0);\n zdetA = param->GetZposition(1);\n \n AliDebug(1,Form(\"Start DIGITS reconstruction \"));\n\n TBranch *brDigits=digitsTree->GetBranch(\"T0\");\n AliT0digit *fDigits = new AliT0digit() ;\n if (brDigits) {\n brDigits->SetAddress(&fDigits);\n }else{\n cerr<<\"EXEC Branch T0 digits not found\"<<endl;\n return;\n }\n \n digitsTree->GetEvent(0);\n digitsTree->GetEntry(0);\n brDigits->GetEntry(0);\n fDigits->GetTimeCFD(*timeCFD);\n fDigits->GetTimeLED(*timeLED);\n fDigits->GetQT0(*chargeQT0);\n fDigits->GetQT1(*chargeQT1);\n \n Float_t besttimeA=999999;\n Float_t besttimeC=999999;\n Int_t pmtBestA=99999;\n Int_t pmtBestC=99999;\n Float_t timeDiff=999999, meanTime=0;\n \n\n\n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n clustersTree->Branch( \"T0\", \"AliT0RecPoint\" ,&frecpoints, 405,1);\n\n Float_t time[24], adc[24];\n for (Int_t ipmt=0; ipmt<24; ipmt++) {\n if(timeCFD->At(ipmt)>0 ){\n Int_t qt0= chargeQT0->At(ipmt);\n Int_t qt1= chargeQT1->At(ipmt);\n if((qt1-qt0)>0) adc[ipmt] = TMath::Exp( Double_t (channelWidth*(qt1-qt0)\/1000));\n time[ipmt] = channelWidth * (calib-> WalkCorrection( ipmt,qt1 , timeCFD->At(ipmt) ) ) ;\n \n \/\/LED\n Double_t sl = (timeLED->At(ipmt) - timeCFD->At(ipmt)- (1000.*timeDelayLED[ipmt]\/channelWidth))*channelWidth;\n Double_t qt=((TGraph*)slewingLEDrec.At(ipmt))->Eval(sl\/1000.);\n frecpoints->SetTime(ipmt,time[ipmt]);\n frecpoints->SetAmp(ipmt,adc[ipmt]);\n frecpoints->SetAmpLED(ipmt,qt);\n }\n else {\n time[ipmt] = 0;\n adc[ipmt] = 0;\n }\n }\n\n for (Int_t ipmt=0; ipmt<12; ipmt++){\n if(time[ipmt] > 1 ) {\n if(time[ipmt]<besttimeC){\n\tbesttimeC=time[ipmt]; \/\/timeC\n\tpmtBestC=ipmt;\n }\n }\n }\n for ( Int_t ipmt=12; ipmt<24; ipmt++){\n if(time[ipmt] > 1) {\n if(time[ipmt]<besttimeA) {\n\tbesttimeA=time[ipmt]; \/\/timeA\n pmtBestA=ipmt;}\n }\n }\n if(besttimeA !=999999) frecpoints->SetTimeBestA(Int_t(besttimeA));\n if( besttimeC != 999999 ) frecpoints->SetTimeBestC(Int_t(besttimeC));\n AliDebug(1,Form(\" besttimeA %f ps, besttimeC %f ps\",besttimeA, besttimeC));\n Float_t c = 0.0299792; \/\/ cm\/ps\n Float_t vertex = 0;\n if(besttimeA !=999999 && besttimeC != 999999 ){\n timeDiff = besttimeC - besttimeA;\n meanTime = (besttimeA + besttimeC)\/2.;\n vertex = c*(timeDiff)\/2.; \/\/-(lenr-lenl))\/2;\n AliDebug(1,Form(\" timeDiff %f ps, meanTime %f ps, vertex %f cm\",timeDiff, meanTime,vertex ));\n frecpoints->SetVertex(vertex);\n frecpoints->SetMeanTime(Int_t(meanTime));\n \n }\n clustersTree->Fill();\n\n delete timeCFD;\n delete timeLED;\n delete chargeQT0; \n delete chargeQT1; \n}\n\n\n\/\/_______________________________________________________________________\n\nvoid AliT0Reconstructor::Reconstruct(AliRawReader* rawReader, TTree*recTree) const\n{\n\/\/ T0 raw ->\n\/\/ T0RecPoint writing \n\n \/\/Q->T-> coefficients !!!! should be asked!!!\n Float_t timeDelayLED[24];\n Float_t zdetA,zdetC;\n TObjArray slewingLEDrec;\n TObjArray walk;\n \n TArrayI * timeCFD = new TArrayI(24); \n TArrayI * timeLED = new TArrayI(24); \n TArrayI * chargeQT0 = new TArrayI(24); \n TArrayI * chargeQT1 = new TArrayI(24); \n\n AliT0RawReader myrawreader(rawReader);\n if (!myrawreader.Next())\n AliDebug(1,Form(\" no raw data found!! %i\", myrawreader.Next()));\n Int_t allData[110][5];\n for (Int_t i=0; i<110; i++) {\n allData[i][0]=myrawreader.GetData(i,0);\n }\n\n AliT0Parameters* param = AliT0Parameters::Instance();\n param->Init();\n AliT0Calibrator *calib=new AliT0Calibrator(); \n\n Int_t mV2Mip = param->GetmV2Mip(); \n \/\/mV2Mip = param->GetmV2Mip(); \n Int_t channelWidth = param->GetChannelWidth() ; \n \n for (Int_t i=0; i<24; i++){\n TGraph* gr = param ->GetSlewRec(i);\n slewingLEDrec.AddAtAndExpand(gr,i) ; \n }\n \n zdetC = param->GetZposition(0);\n zdetA = param->GetZposition(1);\n \/\/ zdetC=GetZdet(\"C\");\n \/\/ zdetA=GetZdet(\"A\");\n cout<<\" !!!!! zdetC \"<<zdetC<<\" zdetA \"<< zdetA<<endl; \n for (Int_t in=0; in<24; in++)\n {\n timeLED->AddAt(allData[in+1][0],in);\n timeCFD->AddAt(allData[in+25][0],in);\n chargeQT1->AddAt(allData[in+55][0],in);\n chargeQT0->AddAt(allData[in+79][0],in);\n AliDebug(10, Form(\" readed Raw %i %i %i %i %i\", in, timeLED->At(in),timeCFD->At(in),chargeQT0->At(in),chargeQT1->At(in)));\n }\n\n Float_t besttimeA=999999;\n Float_t besttimeC=999999;\n Int_t pmtBestA=99999;\n Int_t pmtBestC=99999;\n Float_t timeDiff=999999, meanTime=0;\n\n \n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n \n recTree->Branch( \"T0\", \"AliT0RecPoint\" ,&frecpoints, 405,1);\n \n\n Float_t time[24], adc[24];\n for (Int_t ipmt=0; ipmt<24; ipmt++) {\n if(timeCFD->At(ipmt)>0 ){\n Int_t qt0= chargeQT0->At(ipmt);\n Int_t qt1= chargeQT1->At(ipmt);\n if((qt1-qt0)>0) adc[ipmt] = TMath::Exp( Double_t (channelWidth*(qt1-qt0)\/1000));\n time[ipmt] = channelWidth * (calib-> WalkCorrection( ipmt,qt1 , timeCFD->At(ipmt) ) ) ;\n Double_t sl = (timeLED->At(ipmt) - timeCFD->At(ipmt)- (1000.*timeDelayLED[ipmt]\/channelWidth))*channelWidth;\n Double_t qt=((TGraph*)slewingLEDrec.At(ipmt))->Eval(sl\/1000.);\n frecpoints->SetTime(ipmt,time[ipmt]);\n frecpoints->SetAmp(ipmt,adc[ipmt]);\n frecpoints->SetAmpLED(ipmt,qt);\n }\n else {\n time[ipmt] = 0;\n adc[ipmt] = 0;\n }\n }\n\n for (Int_t ipmt=0; ipmt<12; ipmt++){\n if(time[ipmt] > 1 ) {\n if(time[ipmt]<besttimeC){\n\tbesttimeC=time[ipmt]; \/\/timeC\n\tpmtBestC=ipmt;\n }\n }\n }\n for ( Int_t ipmt=12; ipmt<24; ipmt++){\n if(time[ipmt] > 1) {\n if(time[ipmt]<besttimeA) {\n\tbesttimeA=time[ipmt]; \/\/timeA\n pmtBestA=ipmt;}\n }\n }\n if(besttimeA !=999999) frecpoints->SetTimeBestA(Int_t(besttimeA));\n if( besttimeC != 999999 ) frecpoints->SetTimeBestC(Int_t(besttimeC));\n AliDebug(1,Form(\" besttimeA %f ps, besttimeC %f ps\",besttimeA, besttimeC));\n Float_t c = 0.0299792; \/\/ cm\/ps\n Float_t vertex = 0;\n if(besttimeA !=999999 && besttimeC != 999999 ){\n timeDiff = besttimeC - besttimeA;\n meanTime = (besttimeA + besttimeC)\/2.;\n vertex = c*(timeDiff)\/2.; \/\/-(lenr-lenl))\/2;\n AliDebug(1,Form(\" timeDiff %f ps, meanTime %f ps, vertex %f cm\",timeDiff, meanTime,vertex ));\n frecpoints->SetVertex(vertex);\n frecpoints->SetMeanTime(Int_t(meanTime));\n \n }\n recTree->Fill();\n\n\n delete timeCFD;\n delete timeLED;\n delete chargeQT0; \n delete chargeQT1; \n \n}\n\/\/____________________________________________________________\n\nvoid AliT0Reconstructor::FillESD(AliRunLoader* runLoader, AliESD *pESD) const\n{\n\n \/***************************************************\n Resonstruct digits to vertex position\n ****************************************************\/\n \n \n if (!runLoader) {\n AliError(\"Reconstruct >> No run loader\");\n return;\n }\n \n AliDebug(1,Form(\"Start FillESD T0\"));\n\n AliT0Loader* pStartLoader = (AliT0Loader*) runLoader->GetLoader(\"T0Loader\");\n \n pStartLoader->LoadRecPoints(\"READ\");\n\n TTree *treeR = pStartLoader->TreeR();\n \n AliT0RecPoint* frecpoints= new AliT0RecPoint ();\n if (!frecpoints) {\n AliError(\"Reconstruct Fill ESD >> no recpoints found\");\n return;\n }\n \n AliDebug(1,Form(\"Start FillESD T0\"));\n TBranch *brRec = treeR->GetBranch(\"T0\");\n if (brRec) {\n brRec->SetAddress(&frecpoints);\n }else{\n cerr<<\"EXEC Branch T0 rec not found\"<<endl;\n \/\/ exit(111);\n return;\n } \n \n brRec->GetEntry(0);\n Float_t timeStart, Zposition, amp[24], time[24];\n Int_t mean0 = 12450;\n Int_t i;\n Zposition = frecpoints -> GetVertex();\n timeStart = frecpoints -> GetMeanTime() - mean0;\n for ( i=0; i<24; i++) {\n time[i] = Float_t (frecpoints -> GetTime(i)) \/ 1000.; \/\/ ps to ns\n amp[i] = frecpoints -> GetAmp(i);\n }\n pESD->SetT0zVertex(Zposition); \/\/vertex Z position \n pESD->SetT0(timeStart); \/\/ interaction time \n pESD->SetT0time(time); \/\/ best TOF on each PMT \n pESD->SetT0amplitude(amp); \/\/ number of particles(MIPs) on each PMT\n cout<<\" ESD >> \"<<Zposition<<\" \"<<timeStart<<endl;\n\n pStartLoader->UnloadRecPoints();\n \n} \/\/ vertex in 3 sigma\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>minor fix<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <array>\n#include <chrono>\n#include <memory>\n#include <thread>\n\n#include <folly\/Memory.h>\n#include <folly\/io\/IOBuf.h>\n#include <folly\/io\/async\/ScopedEventBaseThread.h>\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include \"MockStats.h\"\n#include \"src\/ReactiveSocket.h\"\n#include \"test\/InlineConnection.h\"\n#include \"test\/MockRequestHandler.h\"\n#include \"test\/ReactiveStreamsMocksCompat.h\"\n\nusing namespace ::testing;\nusing namespace ::reactivesocket;\n\nclass ClientSideConcurrencyTest : public testing::Test {\n public:\n ClientSideConcurrencyTest() {\n auto clientConn = folly::make_unique<InlineConnection>();\n auto serverConn = folly::make_unique<InlineConnection>();\n clientConn->connectTo(*serverConn);\n\n clientSock = ReactiveSocket::fromClientConnection(\n std::move(clientConn),\n \/\/ No interactions on this mock, the client will not accept any\n \/\/ requests.\n folly::make_unique<StrictMock<MockRequestHandler>>(),\n ConnectionSetupPayload(\"\", \"\", Payload()));\n\n auto serverHandler = folly::make_unique<StrictMock<MockRequestHandler>>();\n auto& serverHandlerRef = *serverHandler;\n\n EXPECT_CALL(serverHandlerRef, handleSetupPayload_(_));\n\n serverSock = ReactiveSocket::fromServerConnection(\n std::move(serverConn), std::move(serverHandler));\n\n EXPECT_CALL(clientInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n clientInputSub = sub;\n \/\/ request is called from the thread1\n \/\/ but delivered on thread2\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { sub->request(2); });\n }));\n \/\/ The request reaches the other end and triggers new responder to be set\n \/\/ up.\n EXPECT_CALL(serverHandlerRef, handleRequestResponse_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestStream_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestSubscription_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestChannel_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n clientTerminatesInteraction_ = false;\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n\n EXPECT_CALL(serverInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverInputSub = sub;\n sub->request(2);\n }));\n EXPECT_CALL(serverInput, onNext_(_))\n .WillOnce(Invoke([&](Payload& payload) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverInputSub->cancel();\n }));\n EXPECT_CALL(serverInput, onComplete_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n }));\n\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n\n return &serverInput;\n }));\n\n EXPECT_CALL(serverOutputSub, request_(_))\n \/\/ The server delivers them immediately.\n .WillOnce(Invoke([&](size_t) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientInput, onNext_(_))\n \/\/ Client receives the payload. We will complete the interaction\n .WillOnce(Invoke([&](Payload&) {\n \/\/ cancel is called from the thread1\n \/\/ but delivered on thread2\n if (clientTerminatesInteraction_) {\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { clientInputSub->cancel(); });\n }\n }));\n\n EXPECT_CALL(serverOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onComplete();\n }));\n\n EXPECT_CALL(clientInput, onComplete_());\n }\n\n std::unique_ptr<ReactiveSocket> clientSock;\n std::unique_ptr<ReactiveSocket> serverSock;\n\n const std::unique_ptr<folly::IOBuf> originalPayload{\n folly::IOBuf::copyBuffer(\"foo\")};\n\n StrictMock<UnmanagedMockSubscriber<Payload>> clientInput;\n Subscription* clientInputSub{nullptr};\n\n Subscriber<Payload>* serverOutput{nullptr};\n StrictMock<UnmanagedMockSubscription> serverOutputSub;\n\n StrictMock<UnmanagedMockSubscriber<Payload>> serverInput;\n Subscription* serverInputSub;\n\n folly::ScopedEventBaseThread thread1;\n folly::ScopedEventBaseThread thread2;\n\n bool clientTerminatesInteraction_{true};\n};\n\nTEST_F(ClientSideConcurrencyTest, RequestResponseTest) {\n clientSock->requestResponse(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestStreamTest) {\n clientSock->requestStream(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestSubscriptionTest) {\n clientSock->requestSubscription(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestChannelTest) {\n auto& clientOutput =\n clientSock->requestChannel(clientInput, *thread2.getEventBase());\n\n StrictMock<UnmanagedMockSubscription> clientOutputSub;\n EXPECT_CALL(clientOutputSub, request_(1)).WillOnce(Invoke([&](size_t) {\n thread1.getEventBase()->runInEventBaseThread([&]() {\n \/\/ first payload for the server RequestHandler\n clientOutput.onNext(Payload(originalPayload->clone()));\n });\n }));\n EXPECT_CALL(clientOutputSub, request_(2)).WillOnce(Invoke([&](size_t) {\n \/\/ second payload for the server input subscriber\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, cancel_()).WillOnce(Invoke([&]() {\n thread1.getEventBase()->runInEventBaseThread(\n [&]() { clientOutput.onComplete(); });\n }));\n\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { clientOutput.onSubscribe(clientOutputSub); });\n\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nclass ServerSideConcurrencyTest : public testing::Test {\n public:\n ServerSideConcurrencyTest() {\n auto clientConn = folly::make_unique<InlineConnection>();\n auto serverConn = folly::make_unique<InlineConnection>();\n clientConn->connectTo(*serverConn);\n\n clientSock = ReactiveSocket::fromClientConnection(\n std::move(clientConn),\n \/\/ No interactions on this mock, the client will not accept any\n \/\/ requests.\n folly::make_unique<StrictMock<MockRequestHandler>>(),\n ConnectionSetupPayload(\"\", \"\", Payload()));\n\n auto serverHandler =\n folly::make_unique<StrictMock<MockRequestHandlerBase>>();\n auto& serverHandlerRef = *serverHandler;\n\n EXPECT_CALL(serverHandlerRef, handleSetupPayload_(_));\n\n serverSock = ReactiveSocket::fromServerConnection(\n std::move(serverConn), std::move(serverHandler));\n\n EXPECT_CALL(clientInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n clientInputSub = sub;\n sub->request(2);\n }));\n \/\/ The request reaches the other end and triggers new responder to be set\n \/\/ up.\n EXPECT_CALL(serverHandlerRef, handleRequestResponse_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n \/\/ TODO: should onSubscribe be queued and also called from\n \/\/ thread1?\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestStream_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestSubscription_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestChannel_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n clientTerminatesInteraction_ = false;\n\n EXPECT_CALL(serverInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n serverInputSub = sub;\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { sub->request(2); });\n }));\n EXPECT_CALL(serverInput, onNext_(_))\n .WillOnce(Invoke([&](Payload& payload) {\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { serverInputSub->cancel(); });\n }));\n EXPECT_CALL(serverInput, onComplete_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n }));\n\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n\n return &serverInput;\n }));\n\n EXPECT_CALL(serverOutputSub, request_(_))\n \/\/ The server delivers them immediately.\n .WillOnce(Invoke([&](size_t) {\n thread1.getEventBase()->runInEventBaseThreadAndWait([&]() {\n serverOutput->onNext(Payload(originalPayload->clone()));\n });\n }));\n EXPECT_CALL(clientInput, onNext_(_))\n \/\/ Client receives the payload. We will complete the interaction\n .WillOnce(Invoke([&](Payload&) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n \/\/ cancel is called from the thread1\n \/\/ but delivered on thread2\n if (clientTerminatesInteraction_) {\n clientInputSub->cancel();\n }\n }));\n\n EXPECT_CALL(serverOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onComplete();\n }));\n\n EXPECT_CALL(clientInput, onComplete_());\n }\n\n std::unique_ptr<ReactiveSocket> clientSock;\n std::unique_ptr<ReactiveSocket> serverSock;\n\n const std::unique_ptr<folly::IOBuf> originalPayload{\n folly::IOBuf::copyBuffer(\"foo\")};\n\n StrictMock<UnmanagedMockSubscriber<Payload>> clientInput;\n Subscription* clientInputSub{nullptr};\n\n Subscriber<Payload>* serverOutput{nullptr};\n StrictMock<UnmanagedMockSubscription> serverOutputSub;\n\n StrictMock<UnmanagedMockSubscriber<Payload>> serverInput;\n Subscription* serverInputSub;\n\n folly::ScopedEventBaseThread thread1;\n folly::ScopedEventBaseThread thread2;\n\n bool clientTerminatesInteraction_{true};\n};\n\nTEST_F(ServerSideConcurrencyTest, RequestResponseTest) {\n clientSock->requestResponse(Payload(originalPayload->clone()), clientInput);\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestStreamTest) {\n clientSock->requestStream(Payload(originalPayload->clone()), clientInput);\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestSubscriptionTest) {\n clientSock->requestSubscription(\n Payload(originalPayload->clone()), clientInput);\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestChannelTest) {\n auto& clientOutput = clientSock->requestChannel(clientInput);\n\n StrictMock<UnmanagedMockSubscription> clientOutputSub;\n EXPECT_CALL(clientOutputSub, request_(1)).WillOnce(Invoke([&](size_t n) {\n \/\/ first payload for the server RequestHandler\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, request_(2)).WillOnce(Invoke([&](size_t n) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n \/\/ second payload for the server input subscriber\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n clientOutput.onComplete();\n }));\n\n clientOutput.onSubscribe(clientOutputSub);\n\n \/\/ give the second thread a change to execute the code\n std::this_thread::sleep_for(std::chrono::milliseconds(10));\n}\n<commit_msg>fixing leaking tests<commit_after>\/\/ Copyright 2004-present Facebook. All Rights Reserved.\n\n#include <array>\n#include <chrono>\n#include <memory>\n#include <thread>\n#include <condition_variable>\n\n#include <folly\/Memory.h>\n#include <folly\/io\/IOBuf.h>\n#include <folly\/io\/async\/ScopedEventBaseThread.h>\n#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include \"MockStats.h\"\n#include \"src\/ReactiveSocket.h\"\n#include \"test\/InlineConnection.h\"\n#include \"test\/MockRequestHandler.h\"\n#include \"test\/ReactiveStreamsMocksCompat.h\"\n\nusing namespace ::testing;\nusing namespace ::reactivesocket;\n\nclass ClientSideConcurrencyTest : public testing::Test {\n public:\n ClientSideConcurrencyTest() {\n auto clientConn = folly::make_unique<InlineConnection>();\n auto serverConn = folly::make_unique<InlineConnection>();\n clientConn->connectTo(*serverConn);\n\n clientSock = ReactiveSocket::fromClientConnection(\n std::move(clientConn),\n \/\/ No interactions on this mock, the client will not accept any\n \/\/ requests.\n folly::make_unique<StrictMock<MockRequestHandler>>(),\n ConnectionSetupPayload(\"\", \"\", Payload()));\n\n auto serverHandler = folly::make_unique<StrictMock<MockRequestHandler>>();\n auto& serverHandlerRef = *serverHandler;\n\n EXPECT_CALL(serverHandlerRef, handleSetupPayload_(_));\n\n serverSock = ReactiveSocket::fromServerConnection(\n std::move(serverConn), std::move(serverHandler));\n\n EXPECT_CALL(clientInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n clientInputSub = sub;\n \/\/ request is called from the thread1\n \/\/ but delivered on thread2\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { sub->request(2); });\n }));\n \/\/ The request reaches the other end and triggers new responder to be set\n \/\/ up.\n EXPECT_CALL(serverHandlerRef, handleRequestResponse_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestStream_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestSubscription_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestChannel_(_, _))\n .Times(AtMost(1))\n .WillOnce(Invoke([&](Payload& request, Subscriber<Payload>* response) {\n clientTerminatesInteraction_ = false;\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n\n EXPECT_CALL(serverInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverInputSub = sub;\n sub->request(2);\n }));\n EXPECT_CALL(serverInput, onNext_(_))\n .WillOnce(Invoke([&](Payload& payload) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverInputSub->cancel();\n }));\n EXPECT_CALL(serverInput, onComplete_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n }));\n\n serverOutput = response;\n serverOutput->onSubscribe(serverOutputSub);\n\n return &serverInput;\n }));\n\n EXPECT_CALL(serverOutputSub, request_(_))\n \/\/ The server delivers them immediately.\n .WillOnce(Invoke([&](size_t) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientInput, onNext_(_))\n \/\/ Client receives the payload. We will complete the interaction\n .WillOnce(Invoke([&](Payload&) {\n \/\/ cancel is called from the thread1\n \/\/ but delivered on thread2\n if (clientTerminatesInteraction_) {\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { clientInputSub->cancel(); });\n }\n }));\n\n EXPECT_CALL(serverOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onComplete();\n }));\n\n EXPECT_CALL(clientInput, onComplete_()).WillOnce(Invoke([&]() {\n if (!clientTerminatesInteraction_) {\n clientInputSub->cancel();\n }\n done();\n }));\n }\n\n void done() {\n std::unique_lock<std::mutex> lock(mtx);\n isDone_ = true;\n cv.notify_one();\n }\n\n void wainUntilDone() {\n std::unique_lock<std::mutex> lock(mtx);\n cv.wait(lock,[&](){return isDone_;});\n }\n\n std::unique_ptr<ReactiveSocket> clientSock;\n std::unique_ptr<ReactiveSocket> serverSock;\n\n const std::unique_ptr<folly::IOBuf> originalPayload{\n folly::IOBuf::copyBuffer(\"foo\")};\n\n StrictMock<UnmanagedMockSubscriber<Payload>> clientInput;\n Subscription* clientInputSub{nullptr};\n\n Subscriber<Payload>* serverOutput{nullptr};\n StrictMock<UnmanagedMockSubscription> serverOutputSub;\n\n StrictMock<UnmanagedMockSubscriber<Payload>> serverInput;\n Subscription* serverInputSub;\n\n folly::ScopedEventBaseThread thread1;\n folly::ScopedEventBaseThread thread2;\n\n bool clientTerminatesInteraction_{true};\n\n std::mutex mtx;\n std::condition_variable cv;\n bool isDone_{false};\n};\n\nTEST_F(ClientSideConcurrencyTest, RequestResponseTest) {\n clientSock->requestResponse(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n wainUntilDone();\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestStreamTest) {\n clientSock->requestStream(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n wainUntilDone();\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestSubscriptionTest) {\n clientSock->requestSubscription(\n Payload(originalPayload->clone()), clientInput, *thread2.getEventBase());\n wainUntilDone();\n}\n\nTEST_F(ClientSideConcurrencyTest, RequestChannelTest) {\n auto& clientOutput =\n clientSock->requestChannel(clientInput, *thread2.getEventBase());\n\n StrictMock<UnmanagedMockSubscription> clientOutputSub;\n EXPECT_CALL(clientOutputSub, request_(1)).WillOnce(Invoke([&](size_t) {\n thread1.getEventBase()->runInEventBaseThread([&]() {\n \/\/ first payload for the server RequestHandler\n clientOutput.onNext(Payload(originalPayload->clone()));\n });\n }));\n EXPECT_CALL(clientOutputSub, request_(2)).WillOnce(Invoke([&](size_t) {\n \/\/ second payload for the server input subscriber\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, cancel_()).WillOnce(Invoke([&]() {\n thread1.getEventBase()->runInEventBaseThread(\n [&]() {\n clientOutput.onComplete();\n });\n }));\n\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { clientOutput.onSubscribe(clientOutputSub); });\n\n wainUntilDone();\n}\n\nclass ServerSideConcurrencyTest : public testing::Test {\n public:\n ServerSideConcurrencyTest() {\n auto clientConn = folly::make_unique<InlineConnection>();\n auto serverConn = folly::make_unique<InlineConnection>();\n clientConn->connectTo(*serverConn);\n\n clientSock = ReactiveSocket::fromClientConnection(\n std::move(clientConn),\n \/\/ No interactions on this mock, the client will not accept any\n \/\/ requests.\n folly::make_unique<StrictMock<MockRequestHandler>>(),\n ConnectionSetupPayload(\"\", \"\", Payload()));\n\n auto serverHandler =\n folly::make_unique<StrictMock<MockRequestHandlerBase>>();\n auto& serverHandlerRef = *serverHandler;\n\n EXPECT_CALL(serverHandlerRef, handleSetupPayload_(_));\n\n serverSock = ReactiveSocket::fromServerConnection(\n std::move(serverConn), std::move(serverHandler));\n\n EXPECT_CALL(clientInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n clientInputSub = sub;\n sub->request(2);\n }));\n \/\/ The request reaches the other end and triggers new responder to be set\n \/\/ up.\n EXPECT_CALL(serverHandlerRef, handleRequestResponse_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n \/\/ TODO: should onSubscribe be queued and also called from\n \/\/ thread1?\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestStream_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestSubscription_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n }));\n EXPECT_CALL(serverHandlerRef, handleRequestChannel_(_, _))\n .Times(AtMost(1))\n .WillOnce(\n Invoke([&](Payload& request, SubscriberFactory& subscriberFactory) {\n clientTerminatesInteraction_ = false;\n\n EXPECT_CALL(serverInput, onSubscribe_(_))\n .WillOnce(Invoke([&](Subscription* sub) {\n serverInputSub = sub;\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { sub->request(2); });\n }));\n EXPECT_CALL(serverInput, onNext_(_))\n .WillOnce(Invoke([&](Payload& payload) {\n thread1.getEventBase()->runInEventBaseThreadAndWait(\n [&]() { serverInputSub->cancel(); });\n }));\n EXPECT_CALL(serverInput, onComplete_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n }));\n\n serverOutput =\n &subscriberFactory.createSubscriber(*thread2.getEventBase());\n serverOutput->onSubscribe(serverOutputSub);\n\n return &serverInput;\n }));\n\n EXPECT_CALL(serverOutputSub, request_(_))\n \/\/ The server delivers them immediately.\n .WillOnce(Invoke([&](size_t) {\n thread1.getEventBase()->runInEventBaseThreadAndWait([&]() {\n serverOutput->onNext(Payload(originalPayload->clone()));\n });\n }));\n EXPECT_CALL(clientInput, onNext_(_))\n \/\/ Client receives the payload. We will complete the interaction\n .WillOnce(Invoke([&](Payload&) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n \/\/ cancel is called from the thread1\n \/\/ but delivered on thread2\n if (clientTerminatesInteraction_) {\n clientInputSub->cancel();\n }\n }));\n\n EXPECT_CALL(serverOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n serverOutput->onComplete();\n }));\n\n EXPECT_CALL(clientInput, onComplete_()).WillOnce(Invoke([&]() {\n if (!clientTerminatesInteraction_) {\n clientInputSub->cancel();\n }\n done();\n }));\n }\n\n void done() {\n std::unique_lock<std::mutex> lock(mtx);\n isDone_ = true;\n cv.notify_one();\n }\n\n void wainUntilDone() {\n std::unique_lock<std::mutex> lock(mtx);\n cv.wait(lock,[&](){return isDone_;});\n }\n\n std::unique_ptr<ReactiveSocket> clientSock;\n std::unique_ptr<ReactiveSocket> serverSock;\n\n const std::unique_ptr<folly::IOBuf> originalPayload{\n folly::IOBuf::copyBuffer(\"foo\")};\n\n StrictMock<UnmanagedMockSubscriber<Payload>> clientInput;\n Subscription* clientInputSub{nullptr};\n\n Subscriber<Payload>* serverOutput{nullptr};\n StrictMock<UnmanagedMockSubscription> serverOutputSub;\n\n StrictMock<UnmanagedMockSubscriber<Payload>> serverInput;\n Subscription* serverInputSub;\n\n folly::ScopedEventBaseThread thread1;\n folly::ScopedEventBaseThread thread2;\n\n bool clientTerminatesInteraction_{true};\n\n std::mutex mtx;\n std::condition_variable cv;\n bool isDone_{false};\n};\n\nTEST_F(ServerSideConcurrencyTest, RequestResponseTest) {\n clientSock->requestResponse(Payload(originalPayload->clone()), clientInput);\n wainUntilDone();\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestStreamTest) {\n clientSock->requestStream(Payload(originalPayload->clone()), clientInput);\n wainUntilDone();\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestSubscriptionTest) {\n clientSock->requestSubscription(\n Payload(originalPayload->clone()), clientInput);\n wainUntilDone();\n}\n\nTEST_F(ServerSideConcurrencyTest, RequestChannelTest) {\n auto& clientOutput = clientSock->requestChannel(clientInput);\n\n StrictMock<UnmanagedMockSubscription> clientOutputSub;\n EXPECT_CALL(clientOutputSub, request_(1)).WillOnce(Invoke([&](size_t n) {\n \/\/ first payload for the server RequestHandler\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, request_(2)).WillOnce(Invoke([&](size_t n) {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n \/\/ second payload for the server input subscriber\n clientOutput.onNext(Payload(originalPayload->clone()));\n }));\n EXPECT_CALL(clientOutputSub, cancel_()).WillOnce(Invoke([&]() {\n EXPECT_TRUE(thread2.getEventBase()->isInEventBaseThread());\n clientOutput.onComplete();\n }));\n\n clientOutput.onSubscribe(clientOutputSub);\n\n wainUntilDone();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <stdexcept>\n#include \"neural_network_trainer.h\"\n\nusing namespace JNF_NEAT;\nusing namespace std;\n\nNeuralNetworkTrainer::NeuralNetworkTrainer(vector<shared_ptr<IBody>> population, TrainingParameters parameters) :\n\tparameters(move(parameters)),\n\tpopulationSize(population.size()),\n\tbodies(move(population))\n{\n\tCreateInitialOrganisms();\n}\n\nauto NeuralNetworkTrainer::ResetPopulationToTeachableState() -> void {\n\tfor (auto& sp : species) {\n\t\tsp.ResetToTeachableState();\n\t}\n}\n\n\nauto NeuralNetworkTrainer::TrainUntilFitnessEquals(double fitnessToReach) -> void {\n\tif (loggingEnabled) {\n\t\tlogger.CreateLoggingDirs();\n\t}\n\tLetGenerationLive();\n\twhile (GetFittestOrganism().GetOrCalculateRawFitness() < (fitnessToReach - 1e-6)) {\n\t\tTrainGenerationAndLog();\n\t}\n}\n\nauto NeuralNetworkTrainer::TrainUntilGenerationEquals(size_t generationsToTrain) -> void {\n\tif (loggingEnabled) {\n\t\tlogger.CreateLoggingDirs();\n\t}\n\tgenerationsToTrain += generationsPassed;\n\tLetGenerationLive();\n\twhile (generationsPassed < generationsToTrain) {\n\t\tTrainGenerationAndLog();\n\t}\n}\n\nauto NeuralNetworkTrainer::GetTrainedNeuralNetwork() -> TrainedNeuralNetwork {\n\treturn TrainedNeuralNetwork(GetFittestOrganism().GetGenome());\n}\n\nauto NeuralNetworkTrainer::CreateInitialOrganisms() -> void {\n\tGenome standardGenes(parameters);\n\tfor (auto currTrainer : bodies) {\n\t\tNeuralNetwork network(standardGenes);\n\t\tOrganism organism(currTrainer, move(network));\n\t\tFillOrganismIntoSpecies(move(organism));\n\t}\n}\n\nauto NeuralNetworkTrainer::TrainGenerationAndLog() -> void {\n\tRepopulate();\n\tLetGenerationLive();\n\tgenerationsPassed++;\n\tif (loggingEnabled) {\n\t\tlogger.LogGeneration(generationsPassed, GetJSON());\n\t}\n}\n\nauto NeuralNetworkTrainer::GetFittestOrganism() -> Organism& {\n\tif (species.empty()) {\n\t\tthrow out_of_range(\"Your population is empty\");\n\t}\n\tauto CompareSpecies = [&](Species& lhs, Species& rhs) {\n\t\treturn lhs.GetFittestOrganism().GetOrCalculateFitness() < rhs.GetFittestOrganism().GetOrCalculateFitness();\n\t};\n\n\tsort(species.begin(), species.end(), CompareSpecies);\n\treturn species.front().GetFittestOrganism();\n}\n\nauto NeuralNetworkTrainer::LetGenerationLive() -> void {\n\tfor (auto& sp : species) {\n\t\tsp.LetPopulationLive();\n\t}\n}\n\nauto NeuralNetworkTrainer::PrepareSpeciesForPopulation() -> void {\n\tAnalyzeAndClearSpeciesPopulation();\n\tDeleteStagnantSpecies();\n}\n\nauto NeuralNetworkTrainer::FillOrganismIntoSpecies(Organism&& organism) -> void {\n\tbool isCompatibleWithExistingSpecies = false;\n\tfor (auto& currSpecies : species) {\n\t\tif (currSpecies.IsCompatible(organism.GetGenome())) {\n\t\t\tcurrSpecies.AddOrganism(move(organism));\n\t\t\tisCompatibleWithExistingSpecies = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (!isCompatibleWithExistingSpecies) {\n\t\tSpecies newSpecies(move(organism));\n\t\tspecies.push_back(move(newSpecies));\n\t}\n}\n\nauto NeuralNetworkTrainer::AnalyzeAndClearSpeciesPopulation() -> void {\n\tfor (auto& currSpecies : species) {\n\t\tcurrSpecies.AnalyzeAndClearPopulation();\n\t}\n}\n\nauto NeuralNetworkTrainer::DeleteStagnantSpecies() -> void {\n\tauto IsStagnant = [](Species& species) {\n\t\treturn species.IsStagnant();\n\t};\n\tauto removePos = remove_if(species.begin(), species.end(), IsStagnant);\n\t\/\/ Let at least one species survive\n\tif (!species.empty() && removePos == species.begin()) {\n\t\t++removePos;\n\t}\n\tspecies.erase(removePos, species.end());\n}\n\nauto NeuralNetworkTrainer::DeleteEmptySpecies() -> void {\n\tspecies.erase(\n\t\tremove_if(species.begin(), species.end(), [](const Species& s) {return s.IsEmpty(); }),\n\t\tspecies.end()\n\t);\n}\n\nauto NeuralNetworkTrainer::Repopulate() -> void {\n\tPrepareSpeciesForPopulation();\n\tauto DidChanceOccure = [](float chance) {\n\t\tauto num = rand() % 1000;\n\t\treturn num < int(1000.0f * chance);\n\t};\n\n\tfor (auto& trainer : bodies) {\n\t\tSpecies* sp = &SelectSpeciesToBreed();\n\t\tauto& father = sp->GetOrganismToBreed();\n\t\tif (DidChanceOccure(parameters.advanced.reproduction.chanceForInterspecialReproduction)) {\n\t\t\tsp = &SelectSpeciesToBreed();\n\t\t}\n\t\tauto& mother = sp->GetOrganismToBreed();\n\t\tauto childNeuralNetwork(move(father.BreedWith(mother)));\n\t\tOrganism child(trainer, move(childNeuralNetwork));\n\t\tFillOrganismIntoSpecies(move(child));\n\t}\n\tDeleteEmptySpecies();\n\tResetPopulationToTeachableState();\n\t\/\/ TODO jnf Add Concurrency\n}\n\nauto NeuralNetworkTrainer::SelectSpeciesToBreed() -> Species& {\n\t\/\/ TODO jnf: Switch to stochastic universal sampling\n\tif (species.empty()) {\n\t\tthrow out_of_range(\"There are no species\");\n\t}\n\tdouble totalSpeciesFitness = 0.0;\n\tfor (auto& s : species) {\n\t\ttotalSpeciesFitness += s.GetFittestOrganism().GetOrCalculateFitness();\n\t}\n\tif (totalSpeciesFitness == 0) {\n\t\treturn species[rand() % species.size()];\n\t}\n\tdouble chance = 0.0;\n\tauto GetChanceForSpecies = [&chance, &totalSpeciesFitness](Species& species) {\n\t\treturn chance + (species.GetFittestOrganism().GetOrCalculateFitness() \/ totalSpeciesFitness);\n\t};\n\twhile (true) {\n\t\tfor (auto& s : species) {\n\t\t\tdouble randNum = (double)(rand() % 10'000) \/ 9'999.0;\n\t\t\tchance = GetChanceForSpecies(s);\n\t\t\tif (randNum < chance) {\n\t\t\t\treturn s;\n\t\t\t}\n\t\t}\n\t}\n}\n\nauto NeuralNetworkTrainer::GetJSON() const -> string {\n\tstring s(\"{\\\"populationSize\\\":\");\n\ts += to_string(populationSize);\n\ts += \",\";\n\ts += \"\\\"generationsPassed\\\":\";\n\ts += to_string(generationsPassed);\n\ts += \",\";\n\ts += \"\\\"species\\\":[\";\n\tfor (size_t i = 0; i < species.size() - 1; ++i) {\n\t\ts += species[i].GetJSON();\n\t\ts += \",\";\n\t}\n\ts += species.back().GetJSON();\n\ts += \"]}\";\n\treturn s;\n}\n<commit_msg>Minor reformating<commit_after>#include <algorithm>\n#include <stdexcept>\n#include \"neural_network_trainer.h\"\n\nusing namespace JNF_NEAT;\nusing namespace std;\n\nNeuralNetworkTrainer::NeuralNetworkTrainer(vector<shared_ptr<IBody>> population, TrainingParameters parameters) :\n\tparameters(move(parameters)),\n\tpopulationSize(population.size()),\n\tbodies(move(population))\n{\n\tCreateInitialOrganisms();\n}\n\nauto NeuralNetworkTrainer::TrainUntilFitnessEquals(double fitnessToReach) -> void {\n\tif (loggingEnabled) {\n\t\tlogger.CreateLoggingDirs();\n\t}\n\tLetGenerationLive();\n\twhile (GetFittestOrganism().GetOrCalculateRawFitness() < (fitnessToReach - 1e-6)) {\n\t\tTrainGenerationAndLog();\n\t}\n}\n\nauto NeuralNetworkTrainer::TrainUntilGenerationEquals(size_t generationsToTrain) -> void {\n\tif (loggingEnabled) {\n\t\tlogger.CreateLoggingDirs();\n\t}\n\tgenerationsToTrain += generationsPassed;\n\tLetGenerationLive();\n\twhile (generationsPassed < generationsToTrain) {\n\t\tTrainGenerationAndLog();\n\t}\n}\n\nauto NeuralNetworkTrainer::GetTrainedNeuralNetwork() -> TrainedNeuralNetwork {\n\treturn TrainedNeuralNetwork(GetFittestOrganism().GetGenome());\n}\n\nauto NeuralNetworkTrainer::CreateInitialOrganisms() -> void {\n\tGenome standardGenes(parameters);\n\tfor (auto currTrainer : bodies) {\n\t\tNeuralNetwork network(standardGenes);\n\t\tOrganism organism(currTrainer, move(network));\n\t\tFillOrganismIntoSpecies(move(organism));\n\t}\n}\n\nauto NeuralNetworkTrainer::TrainGenerationAndLog() -> void {\n\tRepopulate();\n\tLetGenerationLive();\n\tgenerationsPassed++;\n\tif (loggingEnabled) {\n\t\tlogger.LogGeneration(generationsPassed, GetJSON());\n\t}\n}\n\nauto NeuralNetworkTrainer::GetFittestOrganism() -> Organism& {\n\tif (species.empty()) {\n\t\tthrow out_of_range(\"Your population is empty\");\n\t}\n\tauto CompareSpecies = [&](Species& lhs, Species& rhs) {\n\t\treturn lhs.GetFittestOrganism().GetOrCalculateFitness() < rhs.GetFittestOrganism().GetOrCalculateFitness();\n\t};\n\n\tsort(species.begin(), species.end(), CompareSpecies);\n\treturn species.front().GetFittestOrganism();\n}\n\nauto NeuralNetworkTrainer::LetGenerationLive() -> void {\n\tfor (auto& sp : species) {\n\t\tsp.LetPopulationLive();\n\t}\n}\n\nauto NeuralNetworkTrainer::FillOrganismIntoSpecies(Organism&& organism) -> void {\n\tbool isCompatibleWithExistingSpecies = false;\n\tfor (auto& currSpecies : species) {\n\t\tif (currSpecies.IsCompatible(organism.GetGenome())) {\n\t\t\tcurrSpecies.AddOrganism(move(organism));\n\t\t\tisCompatibleWithExistingSpecies = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (!isCompatibleWithExistingSpecies) {\n\t\tSpecies newSpecies(move(organism));\n\t\tspecies.push_back(move(newSpecies));\n\t}\n}\n\nauto NeuralNetworkTrainer::AnalyzeAndClearSpeciesPopulation() -> void {\n\tfor (auto& currSpecies : species) {\n\t\tcurrSpecies.AnalyzeAndClearPopulation();\n\t}\n}\n\nauto NeuralNetworkTrainer::DeleteStagnantSpecies() -> void {\n\tauto IsStagnant = [](Species& species) {\n\t\treturn species.IsStagnant();\n\t};\n\tauto removePos = remove_if(species.begin(), species.end(), IsStagnant);\n\t\/\/ Let at least one species survive\n\tif (!species.empty() && removePos == species.begin()) {\n\t\t++removePos;\n\t}\n\tspecies.erase(removePos, species.end());\n}\n\nauto NeuralNetworkTrainer::Repopulate() -> void {\n\tPrepareSpeciesForPopulation();\n\tauto DidChanceOccure = [](float chance) {\n\t\tauto num = rand() % 1000;\n\t\treturn num < int(1000.0f * chance);\n\t};\n\n\tfor (auto& body : bodies) {\n\t\tSpecies* sp = &SelectSpeciesToBreed();\n\t\tauto& father = sp->GetOrganismToBreed();\n\t\tif (DidChanceOccure(parameters.advanced.reproduction.chanceForInterspecialReproduction)) {\n\t\t\tsp = &SelectSpeciesToBreed();\n\t\t}\n\t\tauto& mother = sp->GetOrganismToBreed();\n\t\tauto childNeuralNetwork(move(father.BreedWith(mother)));\n\t\tOrganism child(body, move(childNeuralNetwork));\n\t\tFillOrganismIntoSpecies(move(child));\n\t}\n\tDeleteEmptySpecies();\n\tResetPopulationToTeachableState();\n\t\/\/ TODO jnf Add Concurrency\n}\n\nauto NeuralNetworkTrainer::PrepareSpeciesForPopulation() -> void\n{\n\tAnalyzeAndClearSpeciesPopulation();\n\tDeleteStagnantSpecies();\n}\n\nauto NeuralNetworkTrainer::DeleteEmptySpecies() -> void\n{\n\tspecies.erase(\n\t\tremove_if(species.begin(), species.end(), [](const Species& s) {return s.IsEmpty(); }),\n\t\tspecies.end()\n\t\t);\n}\n\nauto NeuralNetworkTrainer::ResetPopulationToTeachableState() -> void\n{\n\tfor (auto& sp : species) {\n\t\tsp.ResetToTeachableState();\n\t}\n}\n\nauto NeuralNetworkTrainer::SelectSpeciesToBreed() -> Species& {\n\t\/\/ TODO jnf: Switch to stochastic universal sampling\n\tif (species.empty()) {\n\t\tthrow out_of_range(\"There are no species\");\n\t}\n\tdouble totalSpeciesFitness = 0.0;\n\tfor (auto& s : species) {\n\t\ttotalSpeciesFitness += s.GetFittestOrganism().GetOrCalculateFitness();\n\t}\n\tif (totalSpeciesFitness == 0) {\n\t\treturn species[rand() % species.size()];\n\t}\n\tdouble chance = 0.0;\n\tauto GetChanceForSpecies = [&chance, &totalSpeciesFitness](Species& species) {\n\t\treturn chance + (species.GetFittestOrganism().GetOrCalculateFitness() \/ totalSpeciesFitness);\n\t};\n\twhile (true) {\n\t\tfor (auto& s : species) {\n\t\t\tdouble randNum = (double)(rand() % 10'000) \/ 9'999.0;\n\t\t\tchance = GetChanceForSpecies(s);\n\t\t\tif (randNum < chance) {\n\t\t\t\treturn s;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nauto NeuralNetworkTrainer::GetJSON() const -> string {\n\tstring s(\"{\\\"populationSize\\\":\");\n\ts += to_string(populationSize);\n\ts += \",\";\n\ts += \"\\\"generationsPassed\\\":\";\n\ts += to_string(generationsPassed);\n\ts += \",\";\n\ts += \"\\\"species\\\":[\";\n\tfor (size_t i = 0; i < species.size() - 1; ++i) {\n\t\ts += species[i].GetJSON();\n\t\ts += \",\";\n\t}\n\ts += species.back().GetJSON();\n\ts += \"]}\";\n\treturn s;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Ana Huaman <ahuaman3@gatech.edu>\n * Date: 03-08-2012\n *\n * Geoorgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n * CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n **\n * @file World.cpp\n *\/\n\n#include <iostream>\n#include \"World.h\"\n#include <kinematics\/BodyNode.h>\n#include <kinematics\/Shape.h>\n#include <collision\/CollisionSkeleton.h>\n#include <integration\/EulerIntegrator.h>\n#include <dynamics\/ContactDynamics.h>\n#include <dynamics\/SkeletonDynamics.h>\n#include <robotics\/Robot.h>\n#include <robotics\/Object.h>\n\nusing namespace Eigen;\n\nnamespace robotics {\n\n \/**\n * @function World\n * @brief Constructor\n *\/\n World::World()\n {\n mRobots.resize(0);\n mObjects.resize(0);\n mSkeletons.resize(0);\n mIndices.push_back(0);\n\n mGravity = Eigen::Vector3d(0, 0, -9.81);\n mTimeStep = 0.001;\n }\n\n \/**\n * @function ~World\n * @brief Destructor\n *\/\n World::~World() {\n for( size_t i = 0; i < mRobots.size(); ++i ) {\n delete mRobots[i];\n }\n mRobots.clear();\n\n for( size_t i = 0; i < mObjects.size(); ++i ) {\n delete mObjects[i];\n }\n mObjects.clear();\n\n mSkeletons.clear();\n }\n \n void World::rebuildCollision()\n {\n \/\/ for(unsigned int i = 0; i < mSkeletons.size(); i++)\n \/\/ mSkeletons[i]->initDynamics();\n mCollisionHandle = new dynamics::ContactDynamics(mSkeletons, mTimeStep);\n }\n\n \/**\n * @function addRobot\n * @brief Add a pointer to a new robot in the World\n *\/\n int World::addRobot( Robot* _robot ) {\n \/\/ add item\n mRobots.push_back( _robot );\n mSkeletons.push_back( _robot );\n\n _robot->initDynamics();\n \n mIndices.push_back(mIndices.back() + _robot->getNumDofs());\n mDofs.push_back(_robot->getPose());\n mDofVels.push_back(_robot->getQDotVector());\n\n if(!_robot->getImmobileState()) {\n _robot->computeDynamics(mGravity, mDofVels.back(), false); \/\/ Not sure if we need this\n }\n\n \/\/ create collision dynamics object\n \/\/ rebuildCollision();\n\n assert(mObjects.size() + mRobots.size() == mSkeletons.size());\n\n return mRobots.size();\n }\n\n \/**\n * @function addObject\n * @brief Add a pointer to a new object in the World\n *\/\n int World::addObject( Object* _object ) {\n \/\/ add item\n mObjects.push_back( _object );\n mSkeletons.push_back( _object );\n mIndices.push_back(mIndices.back() + _object->getNumDofs());\n\n _object->initDynamics();\n\n mIndices.push_back(mIndices.back() + _object->getNumDofs());\n mDofs.push_back(_object->getPose());\n mDofVels.push_back(_object->getQDotVector());\n\n if(!_object->getImmobileState()) {\n _object->computeDynamics(mGravity, mDofVels.back(), false); \/\/ Not sure if we need this\n }\n\n \/\/ create collision dynanmics object\n \/\/ rebuildCollision();\n\n assert(mObjects.size() + mRobots.size() == mSkeletons.size());\n \n return mObjects.size();\n }\n \n \/**\n * @function printInfo\n * @brief Print info w.r.t. robots and objects in World\n *\/\n void World::printInfo() {\n\n std::cout << \"* World Info * \" << std::endl;\n std::cout << \"----------------------\" << std::endl;\n\n \/\/-- Robots\n for( size_t i = 0; i < mRobots.size(); ++i ) {\n std::cout << \"* Robot[\"<<i<<\"]: \"<< mRobots[i]->getName()<<\" : \"<< mRobots[i]->getNumDofs() <<\" DOFs \" << std::endl;\n }\n \/\/-- Objects\n for( size_t i = 0; i < mObjects.size(); ++i ) {\n std::cout << \"* Object[\"<<i<<\"]: \"<< mObjects[i]->getName() << std::endl;\n }\n\n }\n\n \/**\n * @function getObject\n *\/\n Object* World::getObject( int _i ) {\n return mObjects[_i];\n }\n \n \/**\n * @function getRobot\n *\/\n Robot* World::getRobot( int _i ) {\n return mRobots[_i];\n }\n\n \/**\n * @function getSkeleton\n *\/\n dynamics::SkeletonDynamics* World::getSkeleton( int _i ) {\n return mSkeletons[_i];\n }\n\n bool World::checkCollision(bool checkAllCollisions) {\n return mCollisionHandle->getCollisionChecker()->checkCollision(checkAllCollisions, false);\n }\n\n void World::step() {\n mIntegrator.integrate(this, mTimeStep);\n mTime += mTimeStep;\n }\n\n VectorXd World::getState() {\n VectorXd state(mIndices.back() * 2);\n for (int i = 0; i < getNumSkeletons(); i++) {\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n state.segment(start, size) = mDofs[i];\n state.segment(start + size, size) = mDofVels[i];\n }\n return state;\n }\n\n VectorXd World::evalDeriv() {\n \/\/ compute dynamic equations\n for (int i = 0; i < getNumSkeletons(); i++) {\n if (getSkeleton(i)->getImmobileState()) {\n \/\/ need to update node transformation for collision\n getSkeleton(i)->setPose(mDofs[i], true, false);\n } else {\n \/\/ need to update first derivatives for collision\n getSkeleton(i)->setPose(mDofs[i], false, true);\n getSkeleton(i)->computeDynamics(mGravity, mDofVels[i], true);\n }\n }\n \/\/ compute contact forces\n mCollisionHandle->applyContactForces();\n\n \/\/ compute derivatives for integration\n VectorXd deriv = VectorXd::Zero(mIndices.back() * 2);\n for (int i = 0; i < getNumSkeletons(); i++) {\n \/\/ skip immobile objects in forward simulation\n if (getSkeleton(i)->getImmobileState())\n continue;\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n VectorXd qddot = getSkeleton(i)->getMassMatrix().fullPivHouseholderQr().solve(\n - getSkeleton(i)->getCombinedVector() + getSkeleton(i)->getExternalForces()\n + mCollisionHandle->getConstraintForce(i) + getSkeleton(i)->getInternalForces());\n\n getSkeleton(i)->clampRotation(mDofs[i], mDofVels[i]);\n deriv.segment(start, size) = mDofVels[i] + (qddot * mTimeStep); \/\/ set velocities\n deriv.segment(start + size, size) = qddot; \/\/ set qddot (accelerations)\n }\n return deriv;\n}\n\nvoid World::setState(VectorXd newState) {\n for (int i = 0; i < getNumSkeletons(); i++) {\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n mDofs[i] = newState.segment(start, size);\n mDofVels[i] = newState.segment(start + size, size);\n }\n}\n\n} \/\/ end namespace robotics\n\n\n\/\/ Local Variables:\n\/\/ c-basic-offset: 2\n\/\/ End:\n<commit_msg>Fix bug in World<commit_after>\/*\n * Copyright (c) 2012, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Ana Huaman <ahuaman3@gatech.edu>\n * Date: 03-08-2012\n *\n * Geoorgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n * CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n **\n * @file World.cpp\n *\/\n\n#include <iostream>\n#include \"World.h\"\n#include <kinematics\/BodyNode.h>\n#include <kinematics\/Shape.h>\n#include <collision\/CollisionSkeleton.h>\n#include <integration\/EulerIntegrator.h>\n#include <dynamics\/ContactDynamics.h>\n#include <dynamics\/SkeletonDynamics.h>\n#include <robotics\/Robot.h>\n#include <robotics\/Object.h>\n\nusing namespace Eigen;\n\nnamespace robotics {\n\n \/**\n * @function World\n * @brief Constructor\n *\/\n World::World()\n {\n mRobots.resize(0);\n mObjects.resize(0);\n mSkeletons.resize(0);\n mIndices.push_back(0);\n\n mGravity = Eigen::Vector3d(0, 0, -9.81);\n mTimeStep = 0.001;\n }\n\n \/**\n * @function ~World\n * @brief Destructor\n *\/\n World::~World() {\n for( size_t i = 0; i < mRobots.size(); ++i ) {\n delete mRobots[i];\n }\n mRobots.clear();\n\n for( size_t i = 0; i < mObjects.size(); ++i ) {\n delete mObjects[i];\n }\n mObjects.clear();\n\n mSkeletons.clear();\n }\n \n void World::rebuildCollision()\n {\n \/\/ for(unsigned int i = 0; i < mSkeletons.size(); i++)\n \/\/ mSkeletons[i]->initDynamics();\n mCollisionHandle = new dynamics::ContactDynamics(mSkeletons, mTimeStep);\n }\n\n \/**\n * @function addRobot\n * @brief Add a pointer to a new robot in the World\n *\/\n int World::addRobot( Robot* _robot ) {\n \/\/ add item\n mRobots.push_back( _robot );\n mSkeletons.push_back( _robot );\n\n _robot->initDynamics();\n \n mIndices.push_back(mIndices.back() + _robot->getNumDofs());\n mDofs.push_back(_robot->getPose());\n mDofVels.push_back(_robot->getQDotVector());\n\n if(!_robot->getImmobileState()) {\n _robot->computeDynamics(mGravity, mDofVels.back(), false); \/\/ Not sure if we need this\n }\n\n \/\/ create collision dynamics object\n \/\/ rebuildCollision();\n\n assert(mObjects.size() + mRobots.size() == mSkeletons.size());\n\n return mRobots.size();\n }\n\n \/**\n * @function addObject\n * @brief Add a pointer to a new object in the World\n *\/\n int World::addObject( Object* _object ) {\n \/\/ add item\n mObjects.push_back( _object );\n mSkeletons.push_back( _object );\n\n _object->initDynamics();\n\n mIndices.push_back(mIndices.back() + _object->getNumDofs());\n mDofs.push_back(_object->getPose());\n mDofVels.push_back(_object->getQDotVector());\n\n if(!_object->getImmobileState()) {\n _object->computeDynamics(mGravity, mDofVels.back(), false); \/\/ Not sure if we need this\n }\n\n \/\/ create collision dynanmics object\n \/\/ rebuildCollision();\n\n assert(mObjects.size() + mRobots.size() == mSkeletons.size());\n \n return mObjects.size();\n }\n \n \/**\n * @function printInfo\n * @brief Print info w.r.t. robots and objects in World\n *\/\n void World::printInfo() {\n\n std::cout << \"* World Info * \" << std::endl;\n std::cout << \"----------------------\" << std::endl;\n\n \/\/-- Robots\n for( size_t i = 0; i < mRobots.size(); ++i ) {\n std::cout << \"* Robot[\"<<i<<\"]: \"<< mRobots[i]->getName()<<\" : \"<< mRobots[i]->getNumDofs() <<\" DOFs \" << std::endl;\n }\n \/\/-- Objects\n for( size_t i = 0; i < mObjects.size(); ++i ) {\n std::cout << \"* Object[\"<<i<<\"]: \"<< mObjects[i]->getName() << std::endl;\n }\n\n }\n\n \/**\n * @function getObject\n *\/\n Object* World::getObject( int _i ) {\n return mObjects[_i];\n }\n \n \/**\n * @function getRobot\n *\/\n Robot* World::getRobot( int _i ) {\n return mRobots[_i];\n }\n\n \/**\n * @function getSkeleton\n *\/\n dynamics::SkeletonDynamics* World::getSkeleton( int _i ) {\n return mSkeletons[_i];\n }\n\n bool World::checkCollision(bool checkAllCollisions) {\n return mCollisionHandle->getCollisionChecker()->checkCollision(checkAllCollisions, false);\n }\n\n void World::step() {\n mIntegrator.integrate(this, mTimeStep);\n mTime += mTimeStep;\n }\n\n VectorXd World::getState() {\n VectorXd state(mIndices.back() * 2);\n for (int i = 0; i < getNumSkeletons(); i++) {\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n state.segment(start, size) = mDofs[i];\n state.segment(start + size, size) = mDofVels[i];\n }\n return state;\n }\n\n VectorXd World::evalDeriv() {\n \/\/ compute dynamic equations\n for (int i = 0; i < getNumSkeletons(); i++) {\n if (getSkeleton(i)->getImmobileState()) {\n \/\/ need to update node transformation for collision\n getSkeleton(i)->setPose(mDofs[i], true, false);\n } else {\n \/\/ need to update first derivatives for collision\n getSkeleton(i)->setPose(mDofs[i], false, true);\n getSkeleton(i)->computeDynamics(mGravity, mDofVels[i], true);\n }\n }\n \/\/ compute contact forces\n mCollisionHandle->applyContactForces();\n\n \/\/ compute derivatives for integration\n VectorXd deriv = VectorXd::Zero(mIndices.back() * 2);\n for (int i = 0; i < getNumSkeletons(); i++) {\n \/\/ skip immobile objects in forward simulation\n if (getSkeleton(i)->getImmobileState())\n continue;\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n VectorXd qddot = getSkeleton(i)->getMassMatrix().fullPivHouseholderQr().solve(\n - getSkeleton(i)->getCombinedVector() + getSkeleton(i)->getExternalForces()\n + mCollisionHandle->getConstraintForce(i) + getSkeleton(i)->getInternalForces());\n\n getSkeleton(i)->clampRotation(mDofs[i], mDofVels[i]);\n deriv.segment(start, size) = mDofVels[i] + (qddot * mTimeStep); \/\/ set velocities\n deriv.segment(start + size, size) = qddot; \/\/ set qddot (accelerations)\n }\n return deriv;\n}\n\nvoid World::setState(VectorXd newState) {\n for (int i = 0; i < getNumSkeletons(); i++) {\n int start = mIndices[i] * 2;\n int size = mDofs[i].size();\n mDofs[i] = newState.segment(start, size);\n mDofVels[i] = newState.segment(start + size, size);\n }\n}\n\n} \/\/ end namespace robotics\n\n\n\/\/ Local Variables:\n\/\/ c-basic-offset: 2\n\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The WebRTC Project Authors. All rights reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"rtc_base\/strings\/string_builder.h\"\n\n#include <stdarg.h>\n#include <cstring>\n\n#include \"rtc_base\/checks.h\"\n#include \"rtc_base\/numerics\/safe_minmax.h\"\n\nnamespace rtc {\n\nSimpleStringBuilder::SimpleStringBuilder(rtc::ArrayView<char> buffer)\n : buffer_(buffer) {\n buffer_[0] = '\\0';\n RTC_DCHECK(IsConsistent());\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(const char* str) {\n return Append(str);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(char ch) {\n return Append(&ch, 1);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(const std::string& str) {\n return Append(str.c_str(), str.length());\n}\n\n\/\/ Numeric conversion routines.\n\/\/\n\/\/ We use std::[v]snprintf instead of std::to_string because:\n\/\/ * std::to_string relies on the current locale for formatting purposes,\n\/\/ and therefore concurrent calls to std::to_string from multiple threads\n\/\/ may result in partial serialization of calls\n\/\/ * snprintf allows us to print the number directly into our buffer.\n\/\/ * avoid allocating a std::string (potential heap alloc).\n\/\/ TODO(tommi): Switch to std::to_chars in C++17.\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(int i) {\n return AppendFormat(\"%d\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(unsigned i) {\n return AppendFormat(\"%u\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long i) { \/\/ NOLINT\n return AppendFormat(\"%ld\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long long i) { \/\/ NOLINT\n return AppendFormat(\"%lld\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(\n unsigned long i) { \/\/ NOLINT\n return AppendFormat(\"%lu\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(\n unsigned long long i) { \/\/ NOLINT\n return AppendFormat(\"%llu\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(float f) {\n return AppendFormat(\"%g\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(double f) {\n return AppendFormat(\"%g\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long double f) {\n return AppendFormat(\"%Lg\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::AppendFormat(const char* fmt, ...) {\n va_list args;\n va_start(args, fmt);\n const int len =\n std::vsnprintf(&buffer_[size_], buffer_.size() - size_, fmt, args);\n if (len >= 0) {\n const size_t chars_added = rtc::SafeMin(len, buffer_.size() - 1 - size_);\n size_ += chars_added;\n RTC_DCHECK_EQ(len, chars_added) << \"Buffer size was insufficient\";\n } else {\n \/\/ This should never happen, but we're paranoid, so re-write the\n \/\/ terminator in case vsnprintf() overwrote it.\n RTC_NOTREACHED();\n buffer_[size_] = '\\0';\n }\n va_end(args);\n RTC_DCHECK(IsConsistent());\n return *this;\n}\n\nSimpleStringBuilder& SimpleStringBuilder::Append(const char* str,\n size_t length) {\n const size_t chars_added =\n rtc::strcpyn(&buffer_[size_], buffer_.size() - size_, str, length);\n size_ += chars_added;\n RTC_DCHECK_EQ(chars_added, length == SIZE_UNKNOWN ? std::strlen(str) : length)\n << \"Buffer size was insufficient\";\n RTC_DCHECK(IsConsistent());\n return *this;\n}\n\nStringBuilder& StringBuilder::AppendFormat(const char* fmt, ...) {\n va_list args, copy;\n va_start(args, fmt);\n va_copy(copy, args);\n const int predicted_length = std::vsnprintf(nullptr, 0, fmt, copy);\n va_end(copy);\n\n RTC_DCHECK_GE(predicted_length, 0);\n if (predicted_length > 0) {\n const size_t size = str_.size();\n str_.resize(size + predicted_length);\n \/\/ Pass \"+ 1\" to vsnprintf to include space for the '\\0'.\n const int actual_length =\n std::vsnprintf(&str_[size], predicted_length + 1, fmt, args);\n RTC_DCHECK_GE(actual_length, 0);\n }\n va_end(args);\n return *this;\n}\n\n} \/\/ namespace rtc\n<commit_msg>Add <cstdio> include to string_builder.cc to support Android NDK r17<commit_after>\/*\n * Copyright 2018 The WebRTC Project Authors. All rights reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"rtc_base\/strings\/string_builder.h\"\n\n#include <stdarg.h>\n#include <cstdio>\n#include <cstring>\n\n#include \"rtc_base\/checks.h\"\n#include \"rtc_base\/numerics\/safe_minmax.h\"\n\nnamespace rtc {\n\nSimpleStringBuilder::SimpleStringBuilder(rtc::ArrayView<char> buffer)\n : buffer_(buffer) {\n buffer_[0] = '\\0';\n RTC_DCHECK(IsConsistent());\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(const char* str) {\n return Append(str);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(char ch) {\n return Append(&ch, 1);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(const std::string& str) {\n return Append(str.c_str(), str.length());\n}\n\n\/\/ Numeric conversion routines.\n\/\/\n\/\/ We use std::[v]snprintf instead of std::to_string because:\n\/\/ * std::to_string relies on the current locale for formatting purposes,\n\/\/ and therefore concurrent calls to std::to_string from multiple threads\n\/\/ may result in partial serialization of calls\n\/\/ * snprintf allows us to print the number directly into our buffer.\n\/\/ * avoid allocating a std::string (potential heap alloc).\n\/\/ TODO(tommi): Switch to std::to_chars in C++17.\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(int i) {\n return AppendFormat(\"%d\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(unsigned i) {\n return AppendFormat(\"%u\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long i) { \/\/ NOLINT\n return AppendFormat(\"%ld\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long long i) { \/\/ NOLINT\n return AppendFormat(\"%lld\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(\n unsigned long i) { \/\/ NOLINT\n return AppendFormat(\"%lu\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(\n unsigned long long i) { \/\/ NOLINT\n return AppendFormat(\"%llu\", i);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(float f) {\n return AppendFormat(\"%g\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(double f) {\n return AppendFormat(\"%g\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::operator<<(long double f) {\n return AppendFormat(\"%Lg\", f);\n}\n\nSimpleStringBuilder& SimpleStringBuilder::AppendFormat(const char* fmt, ...) {\n va_list args;\n va_start(args, fmt);\n const int len =\n std::vsnprintf(&buffer_[size_], buffer_.size() - size_, fmt, args);\n if (len >= 0) {\n const size_t chars_added = rtc::SafeMin(len, buffer_.size() - 1 - size_);\n size_ += chars_added;\n RTC_DCHECK_EQ(len, chars_added) << \"Buffer size was insufficient\";\n } else {\n \/\/ This should never happen, but we're paranoid, so re-write the\n \/\/ terminator in case vsnprintf() overwrote it.\n RTC_NOTREACHED();\n buffer_[size_] = '\\0';\n }\n va_end(args);\n RTC_DCHECK(IsConsistent());\n return *this;\n}\n\nSimpleStringBuilder& SimpleStringBuilder::Append(const char* str,\n size_t length) {\n const size_t chars_added =\n rtc::strcpyn(&buffer_[size_], buffer_.size() - size_, str, length);\n size_ += chars_added;\n RTC_DCHECK_EQ(chars_added, length == SIZE_UNKNOWN ? std::strlen(str) : length)\n << \"Buffer size was insufficient\";\n RTC_DCHECK(IsConsistent());\n return *this;\n}\n\nStringBuilder& StringBuilder::AppendFormat(const char* fmt, ...) {\n va_list args, copy;\n va_start(args, fmt);\n va_copy(copy, args);\n const int predicted_length = std::vsnprintf(nullptr, 0, fmt, copy);\n va_end(copy);\n\n RTC_DCHECK_GE(predicted_length, 0);\n if (predicted_length > 0) {\n const size_t size = str_.size();\n str_.resize(size + predicted_length);\n \/\/ Pass \"+ 1\" to vsnprintf to include space for the '\\0'.\n const int actual_length =\n std::vsnprintf(&str_[size], predicted_length + 1, fmt, args);\n RTC_DCHECK_GE(actual_length, 0);\n }\n va_end(args);\n return *this;\n}\n\n} \/\/ namespace rtc\n<|endoftext|>"} {"text":"<commit_before>\/*\n * caosVM_debug.cpp\n * openc2e\n *\n * Created by Alyssa Milburn on Sun Oct 24 2004.\n * Copyright (c) 2004 Alyssa Milburn. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n\n#include \"caosVM.h\"\n#include \"openc2e.h\"\n#include \"Agent.h\"\n#include \"World.h\"\n#include <iostream>\n#include \"cmddata.h\"\n#include <cctype>\n#include \"dialect.h\"\n#include <algorithm>\n#include \"caosScript.h\"\n\n\/\/ #include \"malloc.h\" <- unportable horror!\n#include <sstream>\n#include <boost\/format.hpp>\n\nusing std::cerr;\nusing std::cout;\n\n\/**\n DBG: OUTS (command) val (string)\n %status maybe\n %pragma variants all\n\n Outputs a string to the debug log.\n*\/\nvoid caosVM::c_DBG_OUTS() {\n\tVM_PARAM_STRING(val)\n\t\n\tcout << val << std::endl;\n}\n\n\/**\n DBGM (command) val (bareword)\n %status maybe\n %pragma variants c1 c2\n %pragma implementation caosVM::c_DBG_OUTS\n*\/\n\n\/**\n DBG: OUTV (command) val (decimal)\n %status maybe\n %pragma variants all\n \n Outputs a decimal value to the debug log.\n*\/\nvoid caosVM::c_DBG_OUTV() {\n\tVM_VERIFY_SIZE(1)\n\tVM_PARAM_VALUE(val)\n\n\tif (val.hasFloat()) {\n\t\tcout << boost::format(\"%0.06f\") % val.getFloat();\n\t} else if (val.hasInt()) {\n\t\tcout << val.getInt();\n\t} else if (val.hasVector()) {\n\t\tconst Vector<float> &v = val.getVector();\n\t\tcout << boost::format(\"(%0.6f, %0.6f)\") % v.x % v.y;\n\t} else throw badParamException();\n\n\tcout << std::endl;\n}\n\n\/**\n DBGV (command) val (integer)\n %status maybe\n %pragma variants c1 c2\n %pragma implementation caosVM::c_DBG_OUTV\n*\/\n\n\/**\n DBUG (command) val (integer)\n %status maybe\n %pragma variants c1 c2\n*\/\nvoid caosVM::c_DBUG() {\n\tinst = true;\n\tc_DBG_OUTV();\n}\n\n\/**\n UNID (integer)\n %status maybe\n %pragma variants c3 cv sm\n\n Returns the unique ID of the target agent.\n This is currently no good for persisting.\n\nXXX: when serialization support works, this might well become good for\n\t persisting :)\n*\/\nvoid caosVM::v_UNID() {\n\tVM_VERIFY_SIZE(0)\n\tvalid_agent(targ);\n\tresult.setInt(targ->getUNID());\n}\n\n\/**\n UNID (agent)\n %status maybe\n %pragma variants c2\n %pragma implementation caosVM::v_UNID_c2\n\n Returns the unique ID of the target agent.\n This is currently no good for persisting.\n*\/\nvoid caosVM::v_UNID_c2() {\n\tVM_VERIFY_SIZE(0)\n\tvalid_agent(targ);\n\tresult.setAgent(targ);\n}\n\n\/**\n AGNT (agent) id (integer)\n %status maybe\n\n Returns the agent with the given UNID, or NULL if agent has been deleted.\n*\/\nvoid caosVM::v_AGNT() {\n\tVM_VERIFY_SIZE(1)\n\tVM_PARAM_INTEGER(id)\n\n\tresult.setAgent(world.lookupUNID(id));\n}\n\n\/**\n DBG: MALLOC (command)\n %status stub\n\n Dumps some random memory stats to stderr.\n*\/\nvoid caosVM::c_DBG_MALLOC() {\n\tVM_VERIFY_SIZE(0)\n\t\n\t\/\/ more unportable horror!\n\/*\tstruct mallinfo mi = mallinfo();\n#define MPRINT(name) \\\n\tfprintf(stderr, \"%10s = %d\\n\", #name, mi. name)\n\tMPRINT(arena);\n\tMPRINT(ordblks);\n\tMPRINT(smblks);\n\tMPRINT(hblks);\n\tMPRINT(hblkhd);\n\tMPRINT(usmblks);\n\tMPRINT(fsmblks);\n\tMPRINT(uordblks);\n\tMPRINT(fordblks);\n\tMPRINT(keepcost);\n\tmalloc_stats(); *\/\n\t\n\t\/*std::cerr << \"caosSlab free=\" << caosVarSlab.free_elements() <<\n\t\t\t\t \" used=\" << caosVarSlab.used_elements() <<\n\t\t\t\t \" total=\" << caosVarSlab.total_elements() <<\n\t\t\t\t std::endl;*\/\n}\n\t\n\/**\n DBG: DUMP (command)\n %status ok\n %pragma variants all\n\n Dumps the current script's bytecode to stderr.\n*\/\nvoid caosVM::c_DBG_DUMP() {\n\tstd::cerr << vm->currentscript->dump();\n}\t\n\n\/**\n DBG: TRACE (command) level (integer)\n %status ok\n %pragma variants all\n\n Sets opcode trace level. Zero disables.\n*\/\nvoid caosVM::c_DBG_TRACE() {\n\tVM_PARAM_INTEGER(en)\n\n\tstd::cerr << \"trace: \" << en << std::endl;\n\tvm->trace = en;\n\tif (vm->trace < 0)\n\t\tvm->trace = 0;\n}\n\n\/**\n MANN (command) cmd (string)\n %status stub\n \n Looks up documentation on the given command and spits it on the current output stream.\n*\/\nvoid caosVM::c_MANN() {\n\tVM_PARAM_STRING(cmd)\n\n\tcaos_assert(outputstream);\n\n\tstd::transform(cmd.begin(), cmd.end(), cmd.begin(), toupper);\n\tconst cmdinfo *i = currentscript->dialect->cmdbase();\n\t\n\tbool found = false;\n\twhile (i->lookup_key) {\n\t\t\/\/ TODO: this doesn't work for FACE at the moment due to hack elsewhere\n\t\tif (cmd == i->fullname) {\n\t\t\tfound = true;\n\t\t\tstd::string d = i->docs;\n\t\t\t\/\/ TODO: docs should always include name\/parameters\/etc, so should never be empty\n\t\t\tif (d.size())\n\t\t\t\t*outputstream << std::string(i->docs) << std::endl;\n\t\t\telse\n\t\t\t\t*outputstream << \"no documentation for \" << cmd << std::endl << std::endl;\n\t\t}\n\t\n\t\ti++;\n\t}\n\n\tif (!found) {\n\t\t*outputstream << \"didn't find \" << cmd << std::endl;\n\t\treturn;\n\t}\n}\n\n\/**\n DBG: DISA (command) family (integer) genus (integer) species (integer) event (integer)\n %pragma variants all\n %status ok\n\n Dumps the \"bytecode\" of the indicated script to the current output channel.\n Note that this isn't really bytecode yet (though that's a possible future\n improvement).\n\n If the script is not found no output will be generated.\n *\/\nvoid caosVM::c_DBG_DISA() {\n\tVM_PARAM_INTEGER(event)\n\tVM_PARAM_INTEGER(species)\n\tVM_PARAM_INTEGER(genus)\n\tVM_PARAM_INTEGER(family)\n\t\n\tcaos_assert(outputstream);\n\n\tshared_ptr<script> s = world.scriptorium.getScript(family, genus, species, event);\n\tif (s) {\n\t\tif (s->fmly != family || s->gnus != genus || s->spcs != species) {\n\t\t\t*outputstream << \"warning: search resulted in script from \" << s->fmly << \", \" << s->gnus << \", \" << s->spcs << \" script\" << std::endl;\n\t\t}\n\t\t*outputstream << s->dump();\n\t} else\n\t\t*outputstream << \"no such script\" << std::endl;\n}\n\n\/**\n DBG: ASRT (command) condition (condition)\n %pragma parser new AssertParser()\n %pragma variants all\n %status maybe\n\n Blows up unless the given condition is true.\n*\/\nvoid caosVM::c_DBG_ASRT() {\n\tthrow caosException(\"DBG: ASRT condition failed\");\n}\n\n\/**\n DBG: IDNT (string) agent (agent)\n %status ok\n %pragma variants all\n\n (openc2e-only)\n Return a nicely-formatted string identifying the classifier of the agent,\n using the catalogue to find the name if possible.\n*\/\nvoid caosVM::v_DBG_IDNT() {\n\tVM_PARAM_AGENT(a)\n\t\n\tif (!a)\n\t\tresult.setString(\"(null)\");\n\telse\n\t\tresult.setString(a->identify());\n}\n\n\/**\n DBG: PROF (command)\n %status stub\n\n Dumps the current agent profiling information to the output stream, in CSV format.\n*\/\nvoid caosVM::c_DBG_PROF() {\n\t\/\/ TODO\n}\n\n\/**\n DBG: CPRO (command)\n %status stub\n\n Clears the current agent profiling information.\n*\/\nvoid caosVM::c_DBG_CPRO() {\n\t\/\/ TODO\n}\n\n\/**\n DBG: STOK (string) bareword (bareword)\n %status ok\n %pragma variants all\n\n Returns the bare token in 'bareword' as a string.\n*\/\nvoid caosVM::v_DBG_STOK() {\n\tVM_PARAM_STRING(bareword)\n\t\n\tresult.setString(bareword);\n}\n\n\/**\n DBG: TSLC (command) timeslice (integer)\n %status ok\n %pragma variants all\n %cost 0\n\n Sets the currently executing script's remaining timeslice value. This command\n affects only the current timeslice; future slices use the normal amount for\n the dialect in question.\n*\/\nvoid caosVM::c_DBG_TSLC() {\n\tVM_PARAM_INTEGER(tslc);\n\ttimeslice = tslc;\n}\n\n\/**\n DBG: TSLC (integer)\n %status ok\n %pragma variants all\n \n Returns the number of ticks left in the current script's remaining timeslice.\n*\/\nvoid caosVM::v_DBG_TSLC() {\n\tresult.setInt(timeslice);\n}\n\n\/**\nDBG: SIZO (string)\n %status ok\n %pragma variants all\n\n Returns a human-readable description of the sizes of various internal data structures\n *\/\nvoid caosVM::v_DBG_SIZO() {\n\tstd::ostringstream oss;\n#define SIZEOF_OUT(t) do { oss << \"sizeof(\" #t \") = \" << sizeof(t) << std::endl; } while(0)\n\tSIZEOF_OUT(caosVM);\n\tSIZEOF_OUT(caosVar);\n\tSIZEOF_OUT(Agent);\n#undef SIZEOF_OUT\n#ifdef PROFILE_ALLOCATION_COUNT\n\tAllocationCounter::walk(oss);\n#else\n\toss << \"This build of openc2e does not have allocation profiling enabled.\" << std::endl;\n#endif\n\toss << \"Free caosVMs: \" << world.vmpool_size() << std::endl;\n\n\tresult.setString(oss.str());\n}\n\n\/* vim: set noet: *\/\n<commit_msg>Make the DBG: SIZO helpstring slightly more accurate.<commit_after>\/*\n * caosVM_debug.cpp\n * openc2e\n *\n * Created by Alyssa Milburn on Sun Oct 24 2004.\n * Copyright (c) 2004 Alyssa Milburn. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n\n#include \"caosVM.h\"\n#include \"openc2e.h\"\n#include \"Agent.h\"\n#include \"World.h\"\n#include <iostream>\n#include \"cmddata.h\"\n#include <cctype>\n#include \"dialect.h\"\n#include <algorithm>\n#include \"caosScript.h\"\n\n\/\/ #include \"malloc.h\" <- unportable horror!\n#include <sstream>\n#include <boost\/format.hpp>\n\nusing std::cerr;\nusing std::cout;\n\n\/**\n DBG: OUTS (command) val (string)\n %status maybe\n %pragma variants all\n\n Outputs a string to the debug log.\n*\/\nvoid caosVM::c_DBG_OUTS() {\n\tVM_PARAM_STRING(val)\n\t\n\tcout << val << std::endl;\n}\n\n\/**\n DBGM (command) val (bareword)\n %status maybe\n %pragma variants c1 c2\n %pragma implementation caosVM::c_DBG_OUTS\n*\/\n\n\/**\n DBG: OUTV (command) val (decimal)\n %status maybe\n %pragma variants all\n \n Outputs a decimal value to the debug log.\n*\/\nvoid caosVM::c_DBG_OUTV() {\n\tVM_VERIFY_SIZE(1)\n\tVM_PARAM_VALUE(val)\n\n\tif (val.hasFloat()) {\n\t\tcout << boost::format(\"%0.06f\") % val.getFloat();\n\t} else if (val.hasInt()) {\n\t\tcout << val.getInt();\n\t} else if (val.hasVector()) {\n\t\tconst Vector<float> &v = val.getVector();\n\t\tcout << boost::format(\"(%0.6f, %0.6f)\") % v.x % v.y;\n\t} else throw badParamException();\n\n\tcout << std::endl;\n}\n\n\/**\n DBGV (command) val (integer)\n %status maybe\n %pragma variants c1 c2\n %pragma implementation caosVM::c_DBG_OUTV\n*\/\n\n\/**\n DBUG (command) val (integer)\n %status maybe\n %pragma variants c1 c2\n*\/\nvoid caosVM::c_DBUG() {\n\tinst = true;\n\tc_DBG_OUTV();\n}\n\n\/**\n UNID (integer)\n %status maybe\n %pragma variants c3 cv sm\n\n Returns the unique ID of the target agent.\n This is currently no good for persisting.\n\nXXX: when serialization support works, this might well become good for\n\t persisting :)\n*\/\nvoid caosVM::v_UNID() {\n\tVM_VERIFY_SIZE(0)\n\tvalid_agent(targ);\n\tresult.setInt(targ->getUNID());\n}\n\n\/**\n UNID (agent)\n %status maybe\n %pragma variants c2\n %pragma implementation caosVM::v_UNID_c2\n\n Returns the unique ID of the target agent.\n This is currently no good for persisting.\n*\/\nvoid caosVM::v_UNID_c2() {\n\tVM_VERIFY_SIZE(0)\n\tvalid_agent(targ);\n\tresult.setAgent(targ);\n}\n\n\/**\n AGNT (agent) id (integer)\n %status maybe\n\n Returns the agent with the given UNID, or NULL if agent has been deleted.\n*\/\nvoid caosVM::v_AGNT() {\n\tVM_VERIFY_SIZE(1)\n\tVM_PARAM_INTEGER(id)\n\n\tresult.setAgent(world.lookupUNID(id));\n}\n\n\/**\n DBG: MALLOC (command)\n %status stub\n\n Dumps some random memory stats to stderr.\n*\/\nvoid caosVM::c_DBG_MALLOC() {\n\tVM_VERIFY_SIZE(0)\n\t\n\t\/\/ more unportable horror!\n\/*\tstruct mallinfo mi = mallinfo();\n#define MPRINT(name) \\\n\tfprintf(stderr, \"%10s = %d\\n\", #name, mi. name)\n\tMPRINT(arena);\n\tMPRINT(ordblks);\n\tMPRINT(smblks);\n\tMPRINT(hblks);\n\tMPRINT(hblkhd);\n\tMPRINT(usmblks);\n\tMPRINT(fsmblks);\n\tMPRINT(uordblks);\n\tMPRINT(fordblks);\n\tMPRINT(keepcost);\n\tmalloc_stats(); *\/\n\t\n\t\/*std::cerr << \"caosSlab free=\" << caosVarSlab.free_elements() <<\n\t\t\t\t \" used=\" << caosVarSlab.used_elements() <<\n\t\t\t\t \" total=\" << caosVarSlab.total_elements() <<\n\t\t\t\t std::endl;*\/\n}\n\t\n\/**\n DBG: DUMP (command)\n %status ok\n %pragma variants all\n\n Dumps the current script's bytecode to stderr.\n*\/\nvoid caosVM::c_DBG_DUMP() {\n\tstd::cerr << vm->currentscript->dump();\n}\t\n\n\/**\n DBG: TRACE (command) level (integer)\n %status ok\n %pragma variants all\n\n Sets opcode trace level. Zero disables.\n*\/\nvoid caosVM::c_DBG_TRACE() {\n\tVM_PARAM_INTEGER(en)\n\n\tstd::cerr << \"trace: \" << en << std::endl;\n\tvm->trace = en;\n\tif (vm->trace < 0)\n\t\tvm->trace = 0;\n}\n\n\/**\n MANN (command) cmd (string)\n %status stub\n \n Looks up documentation on the given command and spits it on the current output stream.\n*\/\nvoid caosVM::c_MANN() {\n\tVM_PARAM_STRING(cmd)\n\n\tcaos_assert(outputstream);\n\n\tstd::transform(cmd.begin(), cmd.end(), cmd.begin(), toupper);\n\tconst cmdinfo *i = currentscript->dialect->cmdbase();\n\t\n\tbool found = false;\n\twhile (i->lookup_key) {\n\t\t\/\/ TODO: this doesn't work for FACE at the moment due to hack elsewhere\n\t\tif (cmd == i->fullname) {\n\t\t\tfound = true;\n\t\t\tstd::string d = i->docs;\n\t\t\t\/\/ TODO: docs should always include name\/parameters\/etc, so should never be empty\n\t\t\tif (d.size())\n\t\t\t\t*outputstream << std::string(i->docs) << std::endl;\n\t\t\telse\n\t\t\t\t*outputstream << \"no documentation for \" << cmd << std::endl << std::endl;\n\t\t}\n\t\n\t\ti++;\n\t}\n\n\tif (!found) {\n\t\t*outputstream << \"didn't find \" << cmd << std::endl;\n\t\treturn;\n\t}\n}\n\n\/**\n DBG: DISA (command) family (integer) genus (integer) species (integer) event (integer)\n %pragma variants all\n %status ok\n\n Dumps the \"bytecode\" of the indicated script to the current output channel.\n Note that this isn't really bytecode yet (though that's a possible future\n improvement).\n\n If the script is not found no output will be generated.\n *\/\nvoid caosVM::c_DBG_DISA() {\n\tVM_PARAM_INTEGER(event)\n\tVM_PARAM_INTEGER(species)\n\tVM_PARAM_INTEGER(genus)\n\tVM_PARAM_INTEGER(family)\n\t\n\tcaos_assert(outputstream);\n\n\tshared_ptr<script> s = world.scriptorium.getScript(family, genus, species, event);\n\tif (s) {\n\t\tif (s->fmly != family || s->gnus != genus || s->spcs != species) {\n\t\t\t*outputstream << \"warning: search resulted in script from \" << s->fmly << \", \" << s->gnus << \", \" << s->spcs << \" script\" << std::endl;\n\t\t}\n\t\t*outputstream << s->dump();\n\t} else\n\t\t*outputstream << \"no such script\" << std::endl;\n}\n\n\/**\n DBG: ASRT (command) condition (condition)\n %pragma parser new AssertParser()\n %pragma variants all\n %status maybe\n\n Blows up unless the given condition is true.\n*\/\nvoid caosVM::c_DBG_ASRT() {\n\tthrow caosException(\"DBG: ASRT condition failed\");\n}\n\n\/**\n DBG: IDNT (string) agent (agent)\n %status ok\n %pragma variants all\n\n (openc2e-only)\n Return a nicely-formatted string identifying the classifier of the agent,\n using the catalogue to find the name if possible.\n*\/\nvoid caosVM::v_DBG_IDNT() {\n\tVM_PARAM_AGENT(a)\n\t\n\tif (!a)\n\t\tresult.setString(\"(null)\");\n\telse\n\t\tresult.setString(a->identify());\n}\n\n\/**\n DBG: PROF (command)\n %status stub\n\n Dumps the current agent profiling information to the output stream, in CSV format.\n*\/\nvoid caosVM::c_DBG_PROF() {\n\t\/\/ TODO\n}\n\n\/**\n DBG: CPRO (command)\n %status stub\n\n Clears the current agent profiling information.\n*\/\nvoid caosVM::c_DBG_CPRO() {\n\t\/\/ TODO\n}\n\n\/**\n DBG: STOK (string) bareword (bareword)\n %status ok\n %pragma variants all\n\n Returns the bare token in 'bareword' as a string.\n*\/\nvoid caosVM::v_DBG_STOK() {\n\tVM_PARAM_STRING(bareword)\n\t\n\tresult.setString(bareword);\n}\n\n\/**\n DBG: TSLC (command) timeslice (integer)\n %status ok\n %pragma variants all\n %cost 0\n\n Sets the currently executing script's remaining timeslice value. This command\n affects only the current timeslice; future slices use the normal amount for\n the dialect in question.\n*\/\nvoid caosVM::c_DBG_TSLC() {\n\tVM_PARAM_INTEGER(tslc);\n\ttimeslice = tslc;\n}\n\n\/**\n DBG: TSLC (integer)\n %status ok\n %pragma variants all\n \n Returns the number of ticks left in the current script's remaining timeslice.\n*\/\nvoid caosVM::v_DBG_TSLC() {\n\tresult.setInt(timeslice);\n}\n\n\/**\nDBG: SIZO (string)\n %status ok\n %pragma variants all\n\n Returns a human-readable profile of the sizes and allocation counts of\n various internal data structures\n *\/\nvoid caosVM::v_DBG_SIZO() {\n\tstd::ostringstream oss;\n#define SIZEOF_OUT(t) do { oss << \"sizeof(\" #t \") = \" << sizeof(t) << std::endl; } while(0)\n\tSIZEOF_OUT(caosVM);\n\tSIZEOF_OUT(caosVar);\n\tSIZEOF_OUT(Agent);\n#undef SIZEOF_OUT\n#ifdef PROFILE_ALLOCATION_COUNT\n\tAllocationCounter::walk(oss);\n#else\n\toss << \"This build of openc2e does not have allocation profiling enabled.\" << std::endl;\n#endif\n\toss << \"Free caosVMs: \" << world.vmpool_size() << std::endl;\n\n\tresult.setString(oss.str());\n}\n\n\/* vim: set noet: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*!\n \\copyright (c) RDO-Team, 2009-2012\n \\file main.cpp\n \\author (rdo@rk9.bmstu.ru)\n \\date 01.05.2012\n \\brief \n \\indent 4T\n*\/\n\n\/\/ ---------------------------------------------------------------------------- PCH\n\/\/ ----------------------------------------------------------------------- INCLUDES\n#define BOOST_TEST_MODULE RDOCalc_Test\n#include <boost\/test\/included\/unit_test.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/chrono.hpp>\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\n#include \"simulator\/runtime\/rdo_runtime.h\"\n#include \"simulator\/runtime\/calc\/procedural\/calc_const.h\"\n#include \"simulator\/runtime\/calc\/procedural\/calc_statement.h\"\n#include \"simulator\/runtime\/calc\/operation\/calc_arithm.h\"\n#include \"simulator\/runtime\/calc\/operation\/calc_logic.h\"\n#include \"simulator\/runtime\/calc\/function\/calc_function.h\"\n\/\/ --------------------------------------------------------------------------------\n\nOPEN_RDO_RUNTIME_NAMESPACE\n\nBOOST_AUTO_TEST_SUITE(RDOCalc_Test)\n\nstatic const double const1 = 10.5;\nstatic const double const2 = 11.4;\n\ntypedef boost::tuple<LPRDORuntime, LPRDOCalc, LPRDOCalc> CalcTriple;\n\ntemplate <class T>\nRDOValue calc(CREF(CalcTriple) calcTriple)\n{\n\tBOOST_CHECK(calcTriple.get<0>());\n\tBOOST_CHECK(calcTriple.get<1>());\n\tBOOST_CHECK(calcTriple.get<2>());\n\n\trdo::intrusive_ptr<T> pCalc = rdo::Factory<T>::create(calcTriple.get<1>(), calcTriple.get<2>());\n\tASSERT(pCalc);\n\n\treturn pCalc->calcValue(calcTriple.get<0>());\n}\n\nCalcTriple prepair()\n{\n\tstatic Error error;\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create(&error);\n\tBOOST_CHECK(pRuntime);\n\n\tLPRDOCalc pLeft = rdo::Factory<RDOCalcConst>::create(RDOValue(const1));\n\tBOOST_CHECK(pLeft);\n\n\tLPRDOCalc pRight = rdo::Factory<RDOCalcConst>::create(RDOValue(const2));\n\tBOOST_CHECK(pRight);\n\n\treturn CalcTriple(pRuntime, pLeft, pRight);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_MultDouble)\n{\n\tRDOValue result = calc<RDOCalcMult>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 * const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_DivDouble)\n{\n\tRDOValue result = calc<RDOCalcDiv>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 \/ const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_PlusDouble)\n{\n\tRDOValue result = calc<RDOCalcPlus>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 + const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_MinusDouble)\n{\n\tRDOValue result = calc<RDOCalcMinus>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 - const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_RecursSimulator)\n{\n\tstruct RecursCalcSimulator\n\t{\n\t\tstruct Param\n\t\t{\n\t\t\tParam(int value)\n\t\t\t\t: m_value(value)\n\t\t\t{}\n\n\t\t\t\/\/! , int, int&\n\t\t\t\/\/! 1\n\t\t\t\/\/! 1 120\n\t\t\tint value() \n\t\t\t{\n\t\t\t\treturn m_value;\n\t\t\t}\n\n\t\t\tParam& dec()\n\t\t\t{\n\t\t\t\t--m_value;\n\t\t\t\treturn *this;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tint m_value;\n\t\t};\n\n\t\tint funError(Param& param)\n\t\t{\n\t\t\tif (param.value() == 1)\n\t\t\t{\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn funError(param.dec()) * param.value();\n\t\t\t}\n\t\t}\n\n\t\tint funOk(Param& param)\n\t\t{\n\t\t\tif (param.value() == 1)\n\t\t\t{\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn param.value() * funOk(param.dec());\n\t\t\t}\n\t\t}\n\t};\n\n\tRecursCalcSimulator calc1;\n\tRecursCalcSimulator calc2;\n\tRecursCalcSimulator::Param param1(5);\n\tRecursCalcSimulator::Param param2(5);\n\n\tint resultError = calc1.funError(param1);\n\tint resultOk = calc2.funOk (param2);\n\tBOOST_CHECK(resultError == 1);\n\tBOOST_CHECK(resultOk == 120);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_Recurs)\n{\n\tstruct generator\n\t{\n\t\tenum MultOrder\n\t\t{\n\t\t\tMO_FUN_PARAM,\n\t\t\tMO_PARAM_FUN\n\t\t};\n\n\t\tstatic LPRDOCalc create(MultOrder order)\n\t\t{\n\t\t\t\/\/! \n\t\t\t\/\/! \n\t\t\t\/\/! int fun(int param)\n\t\t\t\/\/! {\n\t\t\t\/\/! if (param == 1)\n\t\t\t\/\/! {\n\t\t\t\/\/! return 1;\n\t\t\t\/\/! }\n\t\t\t\/\/! else\n\t\t\t\/\/! {\n\t\t\t\/\/! return fun(param - 1) * param;\n\t\t\t\/\/! }\n\t\t\t\/\/! }\n\n\t\t\tLPRDOCalcReturnCatch pReturnCatch = rdo::Factory<RDOCalcReturnCatch>::create();\n\t\t\tBOOST_CHECK(pReturnCatch);\n\n\t\t\tLPRDOCalc pGetFunParam = rdo::Factory<RDOCalcFuncParam>::create(0, RDOSrcInfo());\n\n\t\t\t\/\/! if (param == 1)\n\t\t\tLPRDOCalc pIFCondition;\n\t\t\t{\n\t\t\t\tLPRDOCalc pParamLeft = pGetFunParam;\n\t\t\t\tBOOST_CHECK(pParamLeft);\n\n\t\t\t\tLPRDOCalc pParamRight = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)));\n\t\t\t\tBOOST_CHECK(pParamRight);\n\n\t\t\t\tpIFCondition = rdo::Factory<RDOCalcIsEqual>::create(pParamLeft, pParamRight);\n\t\t\t}\n\t\t\tBOOST_CHECK(pIFCondition);\n\n\t\t\tLPRDOCalcIf pIf = rdo::Factory<RDOCalcIf>::create(pIFCondition);\n\t\t\tBOOST_CHECK(pIf);\n\n\t\t\t\/\/! return 1\n\t\t\tLPRDOCalc pThen = rdo::Factory<RDOCalcFunReturn>::create(\n\t\t\t\trdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)))\n\t\t\t);\n\t\t\tBOOST_CHECK(pThen);\n\n\t\t\t\/\/! return fun(param - 1) * param\n\t\t\tLPRDOCalc pElse;\n\t\t\t{\n\t\t\t\t\/\/! param - 1\n\t\t\t\tLPRDOCalc pParamValue;\n\t\t\t\t{\n\t\t\t\t\tLPRDOCalc pParamLeft = pGetFunParam;\n\t\t\t\t\tBOOST_CHECK(pParamLeft);\n\n\t\t\t\t\tLPRDOCalc pParamRight = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)));\n\t\t\t\t\tBOOST_CHECK(pParamRight);\n\n\t\t\t\t\tpParamValue = rdo::Factory<RDOCalcMinus>::create(pParamLeft, pParamRight);\n\t\t\t\t}\n\t\t\t\tBOOST_CHECK(pParamValue);\n\n\t\t\t\t\/\/! fun(param - 1)\n\t\t\t\tLPRDOCalc pFunctionCaller = caller(pReturnCatch, pParamValue);\n\t\t\t\tBOOST_CHECK(pFunctionCaller);\n\n\t\t\t\t\/\/! fun(param - 1) * param\n\t\t\t\t\/\/! \n\t\t\t\t\/\/! param * fun(param - 1)\n\t\t\t\tLPRDOCalc pMult;\n\t\t\t\tswitch (order)\n\t\t\t\t{\n\t\t\t\tcase MO_FUN_PARAM: pMult = rdo::Factory<RDOCalcMult>::create(pFunctionCaller, pGetFunParam); break;\n\t\t\t\tcase MO_PARAM_FUN: pMult = rdo::Factory<RDOCalcMult>::create(pGetFunParam, pFunctionCaller); break;\n\t\t\t\t}\n\t\t\t\tBOOST_CHECK(pMult);\n\n\t\t\t\tpElse = rdo::Factory<RDOCalcFunReturn>::create(pMult);\n\t\t\t}\n\t\t\tBOOST_CHECK(pElse);\n\n\t\t\tpIf->setThenStatement(pThen);\n\t\t\tpIf->setElseStatement(pElse);\n\n\t\t\tpReturnCatch->setTryCalc(pIf);\n\n\t\t\treturn externalCaller(pReturnCatch);\n\t\t}\n\n\tprivate:\n\t\t\/\/! int fun(5)\n\t\tstatic LPRDOCalc externalCaller(CREF(LPRDOCalc) pBody)\n\t\t{\n\t\t\tLPRDOCalc pParam = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(5)));\n\t\t\tBOOST_CHECK(pParam);\n\n\t\t\treturn caller(pBody, pParam);\n\t\t}\n\n\t\tstatic LPRDOCalc caller(CREF(LPRDOCalc) pBody, CREF(LPRDOCalc) pParam)\n\t\t{\n\t\t\tBOOST_CHECK(pBody );\n\t\t\tBOOST_CHECK(pParam);\n\n\t\t\tLPRDOCalcFunctionCaller pFunctionCaller = rdo::Factory<RDOCalcFunctionCaller>::create(pBody);\n\t\t\tBOOST_CHECK(pFunctionCaller);\n\n\t\t\tpFunctionCaller->addParameter(pParam);\n\n\t\t\treturn pFunctionCaller;\n\t\t}\n\t};\n\n\tError error;\n\n\tRDOValue resultFunParam = generator::create(generator::MO_FUN_PARAM)->calcValue(rdo::Factory<RDORuntime>::create(&error));\n\ttstring resultFunParamStr = resultFunParam.getAsString();\n\tBOOST_CHECK(resultFunParam.getInt() == 120);\n\n\tRDOValue resultParamFun = generator::create(generator::MO_PARAM_FUN)->calcValue(rdo::Factory<RDORuntime>::create(&error));\n\ttstring resultParamFunStr = resultParamFun.getAsString();\n\tBOOST_CHECK(resultParamFun.getInt() == 120);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_SpeedTest)\n{\n\tCalcTriple triple = prepair();\n\tLPRDOCalc pPlus = rdo::Factory<RDOCalcPlus>::create(triple.get<1>(), triple.get<2>());\n\tBOOST_CHECK(pPlus);\n\n\tLPRDORuntime pRuntime = triple.get<0>();\n\tBOOST_CHECK(pRuntime);\n\n\ttypedef boost::chrono::process_user_cpu_clock clock;\n\n\tstatic const ruint RUN_TEST_COUNT = 1000000;\n\n\tclock::time_point timeStart = clock::now();\n\tfor (ruint i = 0; i < RUN_TEST_COUNT; ++i)\n\t{\n\t\tpPlus->calcValue(pRuntime);\n\t}\n\tclock::duration duration(clock::now() - timeStart);\n\tboost::chrono::duration<double> seconds(duration);\n\n\t{\n\t\tusing namespace boost::unit_test;\n\t\tlog_level logLevelBackup = runtime_config::log_level();\n\t\tunit_test_log.set_threshold_level(log_messages);\n\n\t\tBOOST_TEST_MESSAGE(_T(\"RDOCalc_SpeedTest: \") << seconds);\n\n\t\tunit_test_log.set_threshold_level(logLevelBackup);\n\t}\n}\n\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDOCalc_Test\n\nCLOSE_RDO_RUNTIME_NAMESPACE\n<commit_msg> - логирование<commit_after>\/*!\n \\copyright (c) RDO-Team, 2009-2012\n \\file main.cpp\n \\author (rdo@rk9.bmstu.ru)\n \\date 01.05.2012\n \\brief \n \\indent 4T\n*\/\n\n\/\/ ---------------------------------------------------------------------------- PCH\n\/\/ ----------------------------------------------------------------------- INCLUDES\n#define BOOST_TEST_MODULE RDOCalc_Test\n#include <boost\/test\/included\/unit_test.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/chrono.hpp>\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\n#include \"simulator\/runtime\/rdo_runtime.h\"\n#include \"simulator\/runtime\/calc\/procedural\/calc_const.h\"\n#include \"simulator\/runtime\/calc\/procedural\/calc_statement.h\"\n#include \"simulator\/runtime\/calc\/operation\/calc_arithm.h\"\n#include \"simulator\/runtime\/calc\/operation\/calc_logic.h\"\n#include \"simulator\/runtime\/calc\/function\/calc_function.h\"\n\/\/ --------------------------------------------------------------------------------\n\nOPEN_RDO_RUNTIME_NAMESPACE\n\nBOOST_AUTO_TEST_SUITE(RDOCalc_Test)\n\nstatic const double const1 = 10.5;\nstatic const double const2 = 11.4;\n\ntypedef boost::tuple<LPRDORuntime, LPRDOCalc, LPRDOCalc> CalcTriple;\n\ntemplate <class T>\nRDOValue calc(CREF(CalcTriple) calcTriple)\n{\n\tBOOST_CHECK(calcTriple.get<0>());\n\tBOOST_CHECK(calcTriple.get<1>());\n\tBOOST_CHECK(calcTriple.get<2>());\n\n\trdo::intrusive_ptr<T> pCalc = rdo::Factory<T>::create(calcTriple.get<1>(), calcTriple.get<2>());\n\tASSERT(pCalc);\n\n\treturn pCalc->calcValue(calcTriple.get<0>());\n}\n\nCalcTriple prepair()\n{\n\tstatic Error error;\n\tLPRDORuntime pRuntime = rdo::Factory<RDORuntime>::create(&error);\n\tBOOST_CHECK(pRuntime);\n\n\tLPRDOCalc pLeft = rdo::Factory<RDOCalcConst>::create(RDOValue(const1));\n\tBOOST_CHECK(pLeft);\n\n\tLPRDOCalc pRight = rdo::Factory<RDOCalcConst>::create(RDOValue(const2));\n\tBOOST_CHECK(pRight);\n\n\treturn CalcTriple(pRuntime, pLeft, pRight);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_MultDouble)\n{\n\tRDOValue result = calc<RDOCalcMult>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 * const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_DivDouble)\n{\n\tRDOValue result = calc<RDOCalcDiv>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 \/ const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_PlusDouble)\n{\n\tRDOValue result = calc<RDOCalcPlus>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 + const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_MinusDouble)\n{\n\tRDOValue result = calc<RDOCalcMinus>(prepair());\n\tBOOST_CHECK(result.getDouble() == const1 - const2);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_RecursSimulator)\n{\n\tstruct RecursCalcSimulator\n\t{\n\t\tstruct Param\n\t\t{\n\t\t\tParam(int value)\n\t\t\t\t: m_value(value)\n\t\t\t{}\n\n\t\t\t\/\/! , int, int&\n\t\t\t\/\/! 1\n\t\t\t\/\/! 1 120\n\t\t\tint value() \n\t\t\t{\n\t\t\t\treturn m_value;\n\t\t\t}\n\n\t\t\tParam& dec()\n\t\t\t{\n\t\t\t\t--m_value;\n\t\t\t\treturn *this;\n\t\t\t}\n\n\t\tprivate:\n\t\t\tint m_value;\n\t\t};\n\n\t\tint funError(Param& param)\n\t\t{\n\t\t\tif (param.value() == 1)\n\t\t\t{\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn funError(param.dec()) * param.value();\n\t\t\t}\n\t\t}\n\n\t\tint funOk(Param& param)\n\t\t{\n\t\t\tif (param.value() == 1)\n\t\t\t{\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn param.value() * funOk(param.dec());\n\t\t\t}\n\t\t}\n\t};\n\n\tRecursCalcSimulator calc1;\n\tRecursCalcSimulator calc2;\n\tRecursCalcSimulator::Param param1(5);\n\tRecursCalcSimulator::Param param2(5);\n\n\tint resultError = calc1.funError(param1);\n\tint resultOk = calc2.funOk (param2);\n\n\tBOOST_CHECK_MESSAGE(resultError == 1, \"resultError \" << resultError << \" != 1\" );\n\tBOOST_CHECK_MESSAGE(resultOk == 120, \"resultOk \" << resultOk << \" != 120\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_Recurs)\n{\n\tstruct generator\n\t{\n\t\tenum MultOrder\n\t\t{\n\t\t\tMO_FUN_PARAM,\n\t\t\tMO_PARAM_FUN\n\t\t};\n\n\t\tstatic LPRDOCalc create(MultOrder order)\n\t\t{\n\t\t\t\/\/! \n\t\t\t\/\/! \n\t\t\t\/\/! int fun(int param)\n\t\t\t\/\/! {\n\t\t\t\/\/! if (param == 1)\n\t\t\t\/\/! {\n\t\t\t\/\/! return 1;\n\t\t\t\/\/! }\n\t\t\t\/\/! else\n\t\t\t\/\/! {\n\t\t\t\/\/! return fun(param - 1) * param;\n\t\t\t\/\/! }\n\t\t\t\/\/! }\n\n\t\t\tLPRDOCalcReturnCatch pReturnCatch = rdo::Factory<RDOCalcReturnCatch>::create();\n\t\t\tBOOST_CHECK(pReturnCatch);\n\n\t\t\tLPRDOCalc pGetFunParam = rdo::Factory<RDOCalcFuncParam>::create(0, RDOSrcInfo());\n\n\t\t\t\/\/! if (param == 1)\n\t\t\tLPRDOCalc pIFCondition;\n\t\t\t{\n\t\t\t\tLPRDOCalc pParamLeft = pGetFunParam;\n\t\t\t\tBOOST_CHECK(pParamLeft);\n\n\t\t\t\tLPRDOCalc pParamRight = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)));\n\t\t\t\tBOOST_CHECK(pParamRight);\n\n\t\t\t\tpIFCondition = rdo::Factory<RDOCalcIsEqual>::create(pParamLeft, pParamRight);\n\t\t\t}\n\t\t\tBOOST_CHECK(pIFCondition);\n\n\t\t\tLPRDOCalcIf pIf = rdo::Factory<RDOCalcIf>::create(pIFCondition);\n\t\t\tBOOST_CHECK(pIf);\n\n\t\t\t\/\/! return 1\n\t\t\tLPRDOCalc pThen = rdo::Factory<RDOCalcFunReturn>::create(\n\t\t\t\trdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)))\n\t\t\t);\n\t\t\tBOOST_CHECK(pThen);\n\n\t\t\t\/\/! return fun(param - 1) * param\n\t\t\tLPRDOCalc pElse;\n\t\t\t{\n\t\t\t\t\/\/! param - 1\n\t\t\t\tLPRDOCalc pParamValue;\n\t\t\t\t{\n\t\t\t\t\tLPRDOCalc pParamLeft = pGetFunParam;\n\t\t\t\t\tBOOST_CHECK(pParamLeft);\n\n\t\t\t\t\tLPRDOCalc pParamRight = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(1)));\n\t\t\t\t\tBOOST_CHECK(pParamRight);\n\n\t\t\t\t\tpParamValue = rdo::Factory<RDOCalcMinus>::create(pParamLeft, pParamRight);\n\t\t\t\t}\n\t\t\t\tBOOST_CHECK(pParamValue);\n\n\t\t\t\t\/\/! fun(param - 1)\n\t\t\t\tLPRDOCalc pFunctionCaller = caller(pReturnCatch, pParamValue);\n\t\t\t\tBOOST_CHECK(pFunctionCaller);\n\n\t\t\t\t\/\/! fun(param - 1) * param\n\t\t\t\t\/\/! \n\t\t\t\t\/\/! param * fun(param - 1)\n\t\t\t\tLPRDOCalc pMult;\n\t\t\t\tswitch (order)\n\t\t\t\t{\n\t\t\t\tcase MO_FUN_PARAM: pMult = rdo::Factory<RDOCalcMult>::create(pFunctionCaller, pGetFunParam); break;\n\t\t\t\tcase MO_PARAM_FUN: pMult = rdo::Factory<RDOCalcMult>::create(pGetFunParam, pFunctionCaller); break;\n\t\t\t\t}\n\t\t\t\tBOOST_CHECK(pMult);\n\n\t\t\t\tpElse = rdo::Factory<RDOCalcFunReturn>::create(pMult);\n\t\t\t}\n\t\t\tBOOST_CHECK(pElse);\n\n\t\t\tpIf->setThenStatement(pThen);\n\t\t\tpIf->setElseStatement(pElse);\n\n\t\t\tpReturnCatch->setTryCalc(pIf);\n\n\t\t\treturn externalCaller(pReturnCatch);\n\t\t}\n\n\tprivate:\n\t\t\/\/! int fun(5)\n\t\tstatic LPRDOCalc externalCaller(CREF(LPRDOCalc) pBody)\n\t\t{\n\t\t\tLPRDOCalc pParam = rdo::Factory<RDOCalcConst>::create(RDOValue(rsint(5)));\n\t\t\tBOOST_CHECK(pParam);\n\n\t\t\treturn caller(pBody, pParam);\n\t\t}\n\n\t\tstatic LPRDOCalc caller(CREF(LPRDOCalc) pBody, CREF(LPRDOCalc) pParam)\n\t\t{\n\t\t\tBOOST_CHECK(pBody );\n\t\t\tBOOST_CHECK(pParam);\n\n\t\t\tLPRDOCalcFunctionCaller pFunctionCaller = rdo::Factory<RDOCalcFunctionCaller>::create(pBody);\n\t\t\tBOOST_CHECK(pFunctionCaller);\n\n\t\t\tpFunctionCaller->addParameter(pParam);\n\n\t\t\treturn pFunctionCaller;\n\t\t}\n\t};\n\n\tError error;\n\n\tRDOValue resultFunParam = generator::create(generator::MO_FUN_PARAM)->calcValue(rdo::Factory<RDORuntime>::create(&error));\n\ttstring resultFunParamStr = resultFunParam.getAsString();\n\tBOOST_CHECK(resultFunParam.getInt() == 120);\n\n\tRDOValue resultParamFun = generator::create(generator::MO_PARAM_FUN)->calcValue(rdo::Factory<RDORuntime>::create(&error));\n\ttstring resultParamFunStr = resultParamFun.getAsString();\n\tBOOST_CHECK(resultParamFun.getInt() == 120);\n}\n\nBOOST_AUTO_TEST_CASE(RDOCalc_SpeedTest)\n{\n\tCalcTriple triple = prepair();\n\tLPRDOCalc pPlus = rdo::Factory<RDOCalcPlus>::create(triple.get<1>(), triple.get<2>());\n\tBOOST_CHECK(pPlus);\n\n\tLPRDORuntime pRuntime = triple.get<0>();\n\tBOOST_CHECK(pRuntime);\n\n\ttypedef boost::chrono::process_user_cpu_clock clock;\n\n\tstatic const ruint RUN_TEST_COUNT = 1000000;\n\n\tclock::time_point timeStart = clock::now();\n\tfor (ruint i = 0; i < RUN_TEST_COUNT; ++i)\n\t{\n\t\tpPlus->calcValue(pRuntime);\n\t}\n\tclock::duration duration(clock::now() - timeStart);\n\tboost::chrono::duration<double> seconds(duration);\n\n\t{\n\t\tusing namespace boost::unit_test;\n\t\tlog_level logLevelBackup = runtime_config::log_level();\n\t\tunit_test_log.set_threshold_level(log_messages);\n\n\t\tBOOST_TEST_MESSAGE(_T(\"RDOCalc_SpeedTest: \") << seconds);\n\n\t\tunit_test_log.set_threshold_level(logLevelBackup);\n\t}\n}\n\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDOCalc_Test\n\nCLOSE_RDO_RUNTIME_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/*!\n \\copyright (c) RDO-Team, 2011\n \\file main.cpp\n \\author Урусов Андрей (rdo@rk9.bmstu.ru)\n \\authors Пройдаков Евгений (lord.tiran@gmail.com)\n \\date 10.05.2009\n \\brief Тест common-библиотеки\n \\indent 4T\n*\/\n\n\/\/ ----------------------------------------------------------------------- PLATFORM\n#include \"utils\/platform.h\"\n\/\/ ---------------------------------------------------------------------------- PCH\n\/\/ ----------------------------------------------------------------------- INCLUDES\n#include <boost\/regex.hpp>\n#define BOOST_TEST_MODULE RDOCommon_Test\n#include <boost\/test\/included\/unit_test.hpp>\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\n#include \"utils\/rdocommon.h\"\n#include \"utils\/rdofile.h\"\n#include \"utils\/rdotime.h\"\n\/\/ --------------------------------------------------------------------------------\n\nconst tstring s_testFileName(\"test_file\");\nconst ruint64 s_createTestLocalTime = 129557633912040000;\n\nBOOST_AUTO_TEST_SUITE(RDOCommon_Test)\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileCreate)\n{\n\tBOOST_CHECK(rdo::File::create(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileExist)\n{\n\tBOOST_CHECK(rdo::File::exist(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileReadOnly)\n{\n\tBOOST_CHECK(!rdo::File::read_only(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileRemove)\n{\n\tBOOST_CHECK(rdo::File::unlink(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInLinux)\n{\n\ttstring file(\"\/rdo\/run and space\/files\/project.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"\/rdo\/run and space\/files\/\");\n\tBOOST_CHECK(name == \"project\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInLinux)\n{\n\ttstring file(\"\/project.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"\/\");\n\tBOOST_CHECK(name == \"project\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\n#ifdef OST_WINDOWS\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInWindows)\n{\n\ttstring file(\"С:\/rdo\/русский пробел\/files\/проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"С:\/rdo\/русский пробел\/files\/\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInWindows)\n{\n\ttstring file(\"С:\/проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"С:\/\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInWindows_BackSlash)\n{\n\ttstring file(\"С:\\\\rdo\\\\русский пробел\\\\files\\\\проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"С:\\\\rdo\\\\русский пробел\\\\files\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInWindows_BackSlash)\n{\n\ttstring file(\"С:\\\\проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"С:\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n#endif \/\/ #endif\n\nBOOST_AUTO_TEST_CASE(RDOCommon_GetTempFile)\n{\n\tstd::set<tstring> name_set;\n\tfor(int i = 0; i < 15; ++i)\n\t{\n\t\ttstring file_name = rdo::File::getTempFileName();\n\t\tBOOST_CHECK(name_set.find(file_name) == name_set.end());\n\t\tname_set.insert(file_name);\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_Time)\n{\n\trdo::Time timeValue = rdo::Time::local();\n\tBOOST_CHECK(timeValue > s_createTestLocalTime);\n\tstd::cout << \"Today: \" << timeValue.asString().c_str() << \" is not it?\";\n}\n\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDOCommon_Test\n<commit_msg> - исправлены тесты<commit_after>\/*!\n \\copyright (c) RDO-Team, 2011\n \\file main.cpp\n \\author Урусов Андрей (rdo@rk9.bmstu.ru)\n \\authors Пройдаков Евгений (lord.tiran@gmail.com)\n \\date 10.05.2009\n \\brief Тест common-библиотеки\n \\indent 4T\n*\/\n\n\/\/ ----------------------------------------------------------------------- PLATFORM\n#include \"utils\/platform.h\"\n\/\/ ---------------------------------------------------------------------------- PCH\n\/\/ ----------------------------------------------------------------------- INCLUDES\n#include <boost\/regex.hpp>\n#define BOOST_TEST_MODULE RDOCommon_Test\n#include <boost\/test\/included\/unit_test.hpp>\n\/\/ ----------------------------------------------------------------------- SYNOPSIS\n#include \"utils\/rdocommon.h\"\n#include \"utils\/rdofile.h\"\n#include \"utils\/rdotime.h\"\n#include \"utils\/rdolocale.h\"\n\/\/ --------------------------------------------------------------------------------\n\nconst tstring s_testFileName(\"test_file\");\nconst ruint64 s_createTestLocalTime = 129557633912040000;\n\nBOOST_AUTO_TEST_SUITE(RDOCommon_Test)\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileCreate)\n{\n\trdo::locale::init();\n\tBOOST_CHECK(rdo::File::create(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileExist)\n{\n\tBOOST_CHECK(rdo::File::exist(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileReadOnly)\n{\n\tBOOST_CHECK(!rdo::File::read_only(s_testFileName));\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileRemove)\n{\n\tBOOST_CHECK(rdo::File::unlink(s_testFileName));\n}\n\n#ifdef OST_LINUX\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInLinux)\n{\n\ttstring file(\"\/rdo\/run and space\/files\/project.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"\/rdo\/run and space\/files\/\");\n\tBOOST_CHECK(name == \"project\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInLinux)\n{\n\ttstring file(\"\/project.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"\/\");\n\tBOOST_CHECK(name == \"project\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n#endif\n\n#ifdef OST_WINDOWS\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInWindows)\n{\n\ttstring file(\"C:\/rdo\/русский пробел\/files\/проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"C:\\\\rdo\\\\русский пробел\\\\files\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInWindows)\n{\n\ttstring file(\"C:\/проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"C:\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitPathInWindows_BackSlash)\n{\n\ttstring file(\"C:\\\\rdo\\\\русский пробел\\\\files\\\\проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"C:\\\\rdo\\\\русский пробел\\\\files\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_FileSplitByRootPathInWindows_BackSlash)\n{\n\ttstring file(\"C:\\\\проект.smr\");\n\ttstring dir;\n\ttstring name;\n\ttstring ext;\n\n\tBOOST_CHECK(rdo::File::splitpath(file, dir, name, ext));\n\tBOOST_CHECK(dir == \"C:\\\\\");\n\tBOOST_CHECK(name == \"проект\");\n\tBOOST_CHECK(ext == \".smr\");\n}\n#endif \/\/ #endif\n\nBOOST_AUTO_TEST_CASE(RDOCommon_GetTempFile)\n{\n\tstd::set<tstring> name_set;\n\tfor(int i = 0; i < 15; ++i)\n\t{\n\t\ttstring file_name = rdo::File::getTempFileName();\n\t\tBOOST_CHECK(name_set.find(file_name) == name_set.end());\n\t\tname_set.insert(file_name);\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(RDOCommon_Time)\n{\n\trdo::Time timeValue = rdo::Time::local();\n\tBOOST_CHECK(timeValue > s_createTestLocalTime);\n\tstd::cout << \"Today: \" << timeValue.asString().c_str() << \" is not it?\";\n}\n\nBOOST_AUTO_TEST_SUITE_END() \/\/ RDOCommon_Test\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: not %clang_cc1 %s -fno-rtti -triple=i686-pc-win32 -emit-llvm -o \/dev\/null 2>&1 | FileCheck --check-prefix=CHECK32 %s\n\/\/ RUN: %clang_cc1 %s -fno-rtti -triple=x86_64-pc-win32 -emit-llvm -o - | FileCheck --check-prefix=CHECK64 %s\n\nnamespace byval_thunk {\nstruct Agg {\n Agg();\n Agg(const Agg &);\n ~Agg();\n int x;\n};\n\nstruct A { virtual void foo(Agg x); };\nstruct B { virtual void foo(Agg x); };\nstruct C : A, B { virtual void foo(Agg x); };\nC c;\n\n\/\/ CHECK32: cannot compile this non-trivial argument copy for thunk yet\n\n\/\/ CHECK64-LABEL: define linkonce_odr void @\"\\01?foo@C@byval_thunk@@W7EAAXUAgg@2@@Z\"\n\/\/ CHECK64: (%\"struct.byval_thunk::C\"* %this, %\"struct.byval_thunk::Agg\"* %x)\n\/\/ CHECK64: getelementptr i8* %{{.*}}, i32 -8\n\/\/ CHECK64: call void @\"\\01?foo@C@byval_thunk@@UEAAXUAgg@2@@Z\"(%\"struct.byval_thunk::C\"* %2, %\"struct.byval_thunk::Agg\"* %x)\n\/\/ CHECK64-NOT: call\n\/\/ CHECK64: ret void\n}\n<commit_msg>Fix my broken test case in NDEBUG :(<commit_after>\/\/ RUN: not %clang_cc1 %s -fno-rtti -triple=i686-pc-win32 -emit-llvm -o \/dev\/null 2>&1 | FileCheck --check-prefix=CHECK32 %s\n\/\/ RUN: %clang_cc1 %s -fno-rtti -triple=x86_64-pc-win32 -emit-llvm -o - | FileCheck --check-prefix=CHECK64 %s\n\nnamespace byval_thunk {\nstruct Agg {\n Agg();\n Agg(const Agg &);\n ~Agg();\n int x;\n};\n\nstruct A { virtual void foo(Agg x); };\nstruct B { virtual void foo(Agg x); };\nstruct C : A, B { virtual void foo(Agg x); };\nC c;\n\n\/\/ CHECK32: cannot compile this non-trivial argument copy for thunk yet\n\n\/\/ CHECK64-LABEL: define linkonce_odr void @\"\\01?foo@C@byval_thunk@@W7EAAXUAgg@2@@Z\"\n\/\/ CHECK64: (%\"struct.byval_thunk::C\"* %this, %\"struct.byval_thunk::Agg\"* %x)\n\/\/ CHECK64: getelementptr i8* %{{.*}}, i32 -8\n\/\/ CHECK64: call void @\"\\01?foo@C@byval_thunk@@UEAAXUAgg@2@@Z\"(%\"struct.byval_thunk::C\"* %{{.*}}, %\"struct.byval_thunk::Agg\"* %x)\n\/\/ CHECK64-NOT: call\n\/\/ CHECK64: ret void\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * kmajority_index.cpp\n *\n * Created on: Aug 28, 2013\n * Author: andresf\n *\/\n\n#include <KMajorityIndex.h>\n#include <CentersChooser.h>\n\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/flann\/random.h>\n#include <opencv2\/flann\/dist.h>\n\n#include <iostream>\n#include <functional>\n#include <bitset>\n\ntypedef cvflann::Hamming<uchar> Distance;\ntypedef typename Distance::ResultType DistanceType;\n\nKMajorityIndex::KMajorityIndex(uint _k, uint _max_iterations,\n\t\tconst cv::Mat& _data, cv::Ptr<int>& _indices,\n\t\tconst int& _indices_length, uint* _belongs_to,\n\t\tcvflann::flann_centers_init_t centers_init) :\n\t\tk(_k), max_iterations(_max_iterations), m_centers_init(centers_init), data(\n\t\t\t\t_data), indices(_indices), indices_length(_indices_length), dim(\n\t\t\t\t_data.cols), n(_indices_length), distance_to(\n\t\t\t\tnew uint[_indices_length]), cluster_counts(new uint[_k]) {\n\n\tbelongs_to = _belongs_to != NULL ? _belongs_to : new uint[_indices_length];\n\t\/\/ Set the pointer belongs_to to be deleted\n\tdelete_belongs_to = _belongs_to == NULL;\n\n\t\/\/ Initially all transactions belong to any cluster\n\tstd::fill_n(this->belongs_to, _indices_length, _k);\n\n\t\/\/ Initially all transactions are at the farthest possible distance\n\t\/\/ i.e. dim*8 the max hamming distance\n\tstd::fill_n(this->distance_to, _indices_length, _data.cols * 8);\n\n\t\/\/ Initially no transaction is assigned to any cluster\n\tstd::fill_n(this->cluster_counts, this->k, 0);\n}\n\nKMajorityIndex::~KMajorityIndex() {\n\tif (delete_belongs_to == true) {\n\t\tdelete[] belongs_to;\n\t}\n\tdelete[] distance_to;\n\tdelete[] cluster_counts;\n}\n\nvoid KMajorityIndex::cluster() {\n\tif (data.type() != CV_8U) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cluster: error, descriptors matrix is not binary\");\n\t}\n\n\tif (data.empty()) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cluster: error, descriptors is empty\");\n\t}\n\n\t\/\/ Trivial case: less data than clusters, assign one data point per cluster\n\tif (this->n <= this->k) {\n\t\tcentroids.create(this->k, dim, data.type());\n\t\tfor (uint i = 0; i < this->n; ++i) {\n\t\t\tdata.row(i).copyTo(\n\t\t\t\t\tcentroids(cv::Range(i, i + 1), cv::Range(0, this->dim)));\n\t\t\tbelongs_to[i] = i;\n\t\t}\n\t\treturn;\n\t}\n\n\t\/\/ Randomly generate clusters\n\tthis->initCentroids();\n\n\t\/\/ Assign data to clusters\n\tthis->quantize();\n\n\tbool converged = false;\n\tuint iteration = 0;\n\n\twhile (converged == false && iteration < max_iterations) {\n\n\t\titeration++;\n\n\t\t\/\/ Compute the new cluster centers\n\t\tthis->computeCentroids();\n\n\t\t\/\/ Reassign data to clusters\n\t\tconverged = this->quantize();\n\n\t\t\/\/ TODO handle empty clusters case\n\t\t\/\/ Find empty clusters\n\/\/\t\tfor (unsigned int j = 0; j < k; j++) {\n\/\/\t\t\tif (cluster_counts[j] == 0) {\n\/\/\t\t\t\tprintf(\"Cluster %u is empty\\n\", j);\n\/\/\t\t\t\t\/\/ Find farthest element to its assigned cluster\n\/\/\t\t\t\tunsigned int farthest_element_idx = 0;\n\/\/\t\t\t\tfor (unsigned int i = 1; i < n; i++) {\n\/\/\t\t\t\t\tif (distance_to[i] > distance_to[farthest_element_idx]) {\n\/\/\t\t\t\t\t\tfarthest_element_idx = i;\n\/\/\t\t\t\t\t}\n\/\/\t\t\t\t}\n\/\/\t\t\t\t\/\/ Re-assign farthest_element to the found empty cluster\n\/\/\t\t\t\tcluster_counts[belongs_to[farthest_element_idx]]--;\n\/\/\t\t\t\tbelongs_to[farthest_element_idx] = j;\n\/\/\t\t\t\tcluster_counts[j]++;\n\/\/\t\t\t\tkeypoints[farthest_element_idx].class_id = j;\n\/\/\t\t\t\tdistance_to[farthest_element_idx] = hammingDistance(\n\/\/\t\t\t\t\t\tdescriptors.row(farthest_element_idx),\n\/\/\t\t\t\t\t\tcentroids.row(j));\n\/\/\t\t\t}\n\/\/\t\t}\n\t}\n\n}\n\nvoid KMajorityIndex::initCentroids() {\n\n\t\/\/ Initializing variables useful for obtaining indexes of random chosen center\n\tcv::Ptr<int> centers_idx = new int[k];\n\tint centers_length;\n\n\t\/\/ Randomly chose centers\n\tCentersChooser<cv::flann::Hamming<uchar> >::create(m_centers_init)->chooseCenters(\n\t\t\tk, indices, n, centers_idx, centers_length, this->data);\n\n\t\/\/ Assign centers based on the chosen indexes\n\tcentroids.create(centers_length, dim, data.type());\n\tfor (int i = 0; i < centers_length; i++) {\n\t\tdata.row(centers_idx[i]).copyTo(\n\t\t\t\tcentroids(cv::Range(i, i + 1), cv::Range(0, this->dim)));\n\t}\n\n}\n\nbool KMajorityIndex::quantize() {\n\n\tbool converged = true;\n\n\t\/\/ Comparison of all descriptors vs. all centroids\n\tfor (size_t i = 0; i < this->n; i++) {\n\t\t\/\/ Set minimum distance as the distance to its assigned cluster\n\t\tint min_hd = distance_to[i];\n\n\t\tfor (size_t j = 0; j < this->k; j++) {\n\t\t\t\/\/ Compute hamming distance between ith descriptor and jth cluster\n\t\t\tcv::Hamming distance;\n\t\t\tint hd = distance(data.row(indices[i]).data, centroids.row(j).data,\n\t\t\t\t\tdata.cols);\n\n\t\t\t\/\/ Update cluster assignment to the nearest cluster\n\t\t\tif (hd < min_hd) {\n\t\t\t\tmin_hd = hd;\n\t\t\t\t\/\/ If cluster assignment changed that means the algorithm hasn't converged yet\n\t\t\t\tif (belongs_to[i] != j) {\n\t\t\t\t\tconverged = false;\n\t\t\t\t}\n\t\t\t\t\/\/ Decrease cluster count in case it was assigned to some valid cluster before.\n\t\t\t\t\/\/ Recall that initially all transaction are assigned to kth cluster which\n\t\t\t\t\/\/ is not valid since valid clusters run from 0 to k-1 both inclusive.\n\t\t\t\tif (belongs_to[i] != k) {\n\t\t\t\t\tcluster_counts[belongs_to[i]]--;\n\t\t\t\t}\n\t\t\t\tbelongs_to[i] = j;\n\t\t\t\tcluster_counts[j]++;\n\t\t\t\tdistance_to[i] = hd;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn converged;\n}\n\nvoid KMajorityIndex::computeCentroids() {\n\n\t\/\/ Warning: using matrix of integers, there might be an overflow when summing too much descriptors\n\tcv::Mat bitwiseCount(this->k, this->dim * 8, cv::DataType<int>::type);\n\t\/\/ Zeroing matrix of cumulative bits\n\tbitwiseCount = cv::Scalar::all(0);\n\t\/\/ Zeroing all the centroids dimensions\n\tcentroids = cv::Scalar::all(0);\n\n\t\/\/ Bitwise summing the data into each centroid\n\tfor (size_t i = 0; i < this->n; i++) {\n\t\tuint j = belongs_to[i];\n\t\tcv::Mat b = bitwiseCount.row(j);\n\t\tKMajorityIndex::cumBitSum(data.row(i), b);\n\t}\n\n\t\/\/ Bitwise majority voting\n\tfor (size_t j = 0; j < k; j++) {\n\t\tcv::Mat centroid = centroids.row(j);\n\t\tKMajorityIndex::majorityVoting(bitwiseCount.row(j), centroid,\n\t\t\t\tcluster_counts[j]);\n\t}\n}\n\nvoid KMajorityIndex::cumBitSum(const cv::Mat& data, cv::Mat& accVector) {\n\n\t\/\/ cumResult and data must be a row vectors\n\tif (data.rows != 1 || accVector.rows != 1) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cumBitSum: data and cumResult parameters must be row vectors\\n\");\n\t}\n\t\/\/ cumResult and data must be same length\n\tif (data.cols * 8 != accVector.cols) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cumBitSum: number of columns in cumResult must be that of data times 8\\n\");\n\t}\n\n\tuchar byte = 0;\n\tfor (int l = 0; l < accVector.cols; l++) {\n\t\t\/\/ bit: 7-(l%8) col: (int)l\/8 descriptor: i\n\t\t\/\/ Load byte every 8 bits\n\t\tif ((l % 8) == 0) {\n\t\t\tbyte = *(data.col((int) l \/ 8).data);\n\t\t}\n\t\t\/\/ Warning: ignore maybe-uninitialized warning because loop starts with l=0 that means byte gets a value as soon as the loop start\n\t\t\/\/ bit at ith position is mod(bitleftshift(byte,i),2) where ith position is 7-mod(l,8) i.e 7, 6, 5, 4, 3, 2, 1, 0\n\t\taccVector.at<int>(0, l) += ((int) ((byte >> (7 - (l % 8))) % 2));\n\t}\n\n}\n\nvoid KMajorityIndex::majorityVoting(const cv::Mat& accVector, cv::Mat& result,\n\t\tconst uint& threshold) {\n\n\t\/\/ cumResult and data must be a row vectors\n\tif (accVector.rows != 1 || result.rows != 1) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::majorityVoting: `bitwiseCount` and `centroid` parameters must be row vectors\\n\");\n\t}\n\n\t\/\/ cumResult and data must be same length\n\tif (result.cols * 8 != accVector.cols) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::majorityVoting: number of columns in `bitwiseCount` must be that of `data` times 8\\n\");\n\t}\n\n\t\/\/ In this point I already have stored in bitwiseCount the bitwise sum of all data assigned to jth cluster\n\tfor (size_t l = 0; (int) l < accVector.cols; l++) {\n\t\t\/\/ If the bitcount for jth cluster at dimension l is greater than half of the data assigned to it\n\t\t\/\/ then set lth centroid bit to 1 otherwise set it to 0 (break ties randomly)\n\t\tbool bit;\n\t\t\/\/ There is a tie if the number of data assigned to jth cluster is even\n\t\t\/\/ AND the number of bits set to 1 in lth dimension is the half of the data assigned to jth cluster\n\t\tif (threshold % 2 == 1\n\t\t\t\t&& 2 * accVector.at<int>(0, l) == (int) threshold) {\n\t\t\tbit = rand() % 2;\n\t\t} else {\n\t\t\tbit = 2 * accVector.at<int>(0, l) > (int) (threshold);\n\t\t}\n\t\t\/\/ Stores the majority voting result from the LSB to the MSB\n\t\tresult.at<unsigned char>(0, (int) (accVector.cols - 1 - l) \/ 8) += (bit)\n\t\t\t\t<< ((accVector.cols - 1 - l) % 8);\n\t}\n}\n\nconst cv::Mat& KMajorityIndex::getCentroids() const {\n\treturn centroids;\n}\n\nuint* KMajorityIndex::getClusterCounts() const {\n\treturn cluster_counts;\n}\n\nuint* KMajorityIndex::getClusterAssignments() const {\n\treturn belongs_to;\n}\n\nint KMajorityIndex::getNumberOfClusters() const {\n\treturn centroids.rows;\n}\n<commit_msg>KMajorityLib\/src\/KMajorityIndex.cpp<commit_after>\/*\n * kmajority_index.cpp\n *\n * Created on: Aug 28, 2013\n * Author: andresf\n *\/\n\n#include <KMajorityIndex.h>\n#include <CentersChooser.h>\n\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/flann\/random.h>\n#include <opencv2\/flann\/dist.h>\n\n#include <iostream>\n#include <functional>\n#include <bitset>\n\ntypedef cvflann::Hamming<uchar> Distance;\ntypedef typename Distance::ResultType DistanceType;\n\nKMajorityIndex::KMajorityIndex(uint _k, uint _max_iterations,\n\t\tconst cv::Mat& _data, cv::Ptr<int>& _indices,\n\t\tconst int& _indices_length, uint* _belongs_to,\n\t\tcvflann::flann_centers_init_t centers_init) :\n\t\tk(_k), max_iterations(_max_iterations), m_centers_init(centers_init), data(\n\t\t\t\t_data), indices(_indices), indices_length(_indices_length), dim(\n\t\t\t\t_data.cols), n(_indices_length), distance_to(\n\t\t\t\tnew uint[_indices_length]), cluster_counts(new uint[_k]) {\n\n\tbelongs_to = _belongs_to != NULL ? _belongs_to : new uint[_indices_length];\n\t\/\/ Set the pointer belongs_to to be deleted\n\tdelete_belongs_to = _belongs_to == NULL;\n\n\t\/\/ Initially all transactions belong to any cluster\n\tstd::fill_n(this->belongs_to, _indices_length, _k);\n\n\t\/\/ Initially all transactions are at the farthest possible distance\n\t\/\/ i.e. dim*8 the max hamming distance\n\tstd::fill_n(this->distance_to, _indices_length, _data.cols * 8);\n\n\t\/\/ Initially no transaction is assigned to any cluster\n\tstd::fill_n(this->cluster_counts, this->k, 0);\n}\n\nKMajorityIndex::~KMajorityIndex() {\n\tif (delete_belongs_to == true) {\n\t\tdelete[] belongs_to;\n\t}\n\tdelete[] distance_to;\n\tdelete[] cluster_counts;\n}\n\nvoid KMajorityIndex::cluster() {\n\tif (data.type() != CV_8U) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cluster: error, descriptors matrix is not binary\");\n\t}\n\n\tif (data.empty()) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cluster: error, descriptors is empty\");\n\t}\n\n\t\/\/ Trivial case: less data than clusters, assign one data point per cluster\n\tif (this->n <= this->k) {\n\t\tcentroids.create(this->k, dim, data.type());\n\t\tfor (uint i = 0; i < this->n; ++i) {\n\t\t\tdata.row(i).copyTo(\n\t\t\t\t\tcentroids(cv::Range(i, i + 1), cv::Range(0, this->dim)));\n\t\t\tbelongs_to[i] = i;\n\t\t}\n\t\treturn;\n\t}\n\n\t\/\/ Randomly generate clusters\n\tthis->initCentroids();\n\n\t\/\/ Assign data to clusters\n\tthis->quantize();\n\n\tbool converged = false;\n\tuint iteration = 0;\n\n\twhile (converged == false && iteration < max_iterations) {\n\n\t\titeration++;\n\n\t\t\/\/ Compute the new cluster centers\n\t\tthis->computeCentroids();\n\n\t\t\/\/ Reassign data to clusters\n\t\tconverged = this->quantize();\n\n\t\t\/\/ TODO handle empty clusters case\n\t\t\/\/ Find empty clusters\n\/\/\t\tfor (unsigned int j = 0; j < k; j++) {\n\/\/\t\t\tif (cluster_counts[j] == 0) {\n\/\/\t\t\t\tprintf(\"Cluster %u is empty\\n\", j);\n\/\/\t\t\t\t\/\/ Find farthest element to its assigned cluster\n\/\/\t\t\t\tunsigned int farthest_element_idx = 0;\n\/\/\t\t\t\tfor (unsigned int i = 1; i < n; i++) {\n\/\/\t\t\t\t\tif (distance_to[i] > distance_to[farthest_element_idx]) {\n\/\/\t\t\t\t\t\tfarthest_element_idx = i;\n\/\/\t\t\t\t\t}\n\/\/\t\t\t\t}\n\/\/\t\t\t\t\/\/ Re-assign farthest_element to the found empty cluster\n\/\/\t\t\t\tcluster_counts[belongs_to[farthest_element_idx]]--;\n\/\/\t\t\t\tbelongs_to[farthest_element_idx] = j;\n\/\/\t\t\t\tcluster_counts[j]++;\n\/\/\t\t\t\tkeypoints[farthest_element_idx].class_id = j;\n\/\/\t\t\t\tdistance_to[farthest_element_idx] = hammingDistance(\n\/\/\t\t\t\t\t\tdescriptors.row(farthest_element_idx),\n\/\/\t\t\t\t\t\tcentroids.row(j));\n\/\/\t\t\t}\n\/\/\t\t}\n\t}\n\n}\n\nvoid KMajorityIndex::initCentroids() {\n\n\t\/\/ Initializing variables useful for obtaining indexes of random chosen center\n\tcv::Ptr<int> centers_idx = new int[k];\n\tint centers_length;\n\n\t\/\/ Randomly chose centers\n\tCentersChooser<cvflann::Hamming<uchar> >::create(m_centers_init)->chooseCenters(\n\t\t\tk, indices, n, centers_idx, centers_length, this->data);\n\n\t\/\/ Assign centers based on the chosen indexes\n\tcentroids.create(centers_length, dim, data.type());\n\tfor (int i = 0; i < centers_length; i++) {\n\t\tdata.row(centers_idx[i]).copyTo(\n\t\t\t\tcentroids(cv::Range(i, i + 1), cv::Range(0, this->dim)));\n\t}\n\n}\n\nbool KMajorityIndex::quantize() {\n\n\tbool converged = true;\n\n\t\/\/ Comparison of all descriptors vs. all centroids\n\tfor (size_t i = 0; i < this->n; i++) {\n\t\t\/\/ Set minimum distance as the distance to its assigned cluster\n\t\tint min_hd = distance_to[i];\n\n\t\tfor (size_t j = 0; j < this->k; j++) {\n\t\t\t\/\/ Compute hamming distance between ith descriptor and jth cluster\n\t\t\tcv::Hamming distance;\n\t\t\tint hd = distance(data.row(indices[i]).data, centroids.row(j).data,\n\t\t\t\t\tdata.cols);\n\n\t\t\t\/\/ Update cluster assignment to the nearest cluster\n\t\t\tif (hd < min_hd) {\n\t\t\t\tmin_hd = hd;\n\t\t\t\t\/\/ If cluster assignment changed that means the algorithm hasn't converged yet\n\t\t\t\tif (belongs_to[i] != j) {\n\t\t\t\t\tconverged = false;\n\t\t\t\t}\n\t\t\t\t\/\/ Decrease cluster count in case it was assigned to some valid cluster before.\n\t\t\t\t\/\/ Recall that initially all transaction are assigned to kth cluster which\n\t\t\t\t\/\/ is not valid since valid clusters run from 0 to k-1 both inclusive.\n\t\t\t\tif (belongs_to[i] != k) {\n\t\t\t\t\tcluster_counts[belongs_to[i]]--;\n\t\t\t\t}\n\t\t\t\tbelongs_to[i] = j;\n\t\t\t\tcluster_counts[j]++;\n\t\t\t\tdistance_to[i] = hd;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn converged;\n}\n\nvoid KMajorityIndex::computeCentroids() {\n\n\t\/\/ Warning: using matrix of integers, there might be an overflow when summing too much descriptors\n\tcv::Mat bitwiseCount(this->k, this->dim * 8, cv::DataType<int>::type);\n\t\/\/ Zeroing matrix of cumulative bits\n\tbitwiseCount = cv::Scalar::all(0);\n\t\/\/ Zeroing all the centroids dimensions\n\tcentroids = cv::Scalar::all(0);\n\n\t\/\/ Bitwise summing the data into each centroid\n\tfor (size_t i = 0; i < this->n; i++) {\n\t\tuint j = belongs_to[i];\n\t\tcv::Mat b = bitwiseCount.row(j);\n\t\tKMajorityIndex::cumBitSum(data.row(i), b);\n\t}\n\n\t\/\/ Bitwise majority voting\n\tfor (size_t j = 0; j < k; j++) {\n\t\tcv::Mat centroid = centroids.row(j);\n\t\tKMajorityIndex::majorityVoting(bitwiseCount.row(j), centroid,\n\t\t\t\tcluster_counts[j]);\n\t}\n}\n\nvoid KMajorityIndex::cumBitSum(const cv::Mat& data, cv::Mat& accVector) {\n\n\t\/\/ cumResult and data must be a row vectors\n\tif (data.rows != 1 || accVector.rows != 1) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cumBitSum: data and cumResult parameters must be row vectors\\n\");\n\t}\n\t\/\/ cumResult and data must be same length\n\tif (data.cols * 8 != accVector.cols) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::cumBitSum: number of columns in cumResult must be that of data times 8\\n\");\n\t}\n\n\tuchar byte = 0;\n\tfor (int l = 0; l < accVector.cols; l++) {\n\t\t\/\/ bit: 7-(l%8) col: (int)l\/8 descriptor: i\n\t\t\/\/ Load byte every 8 bits\n\t\tif ((l % 8) == 0) {\n\t\t\tbyte = *(data.col((int) l \/ 8).data);\n\t\t}\n\t\t\/\/ Warning: ignore maybe-uninitialized warning because loop starts with l=0 that means byte gets a value as soon as the loop start\n\t\t\/\/ bit at ith position is mod(bitleftshift(byte,i),2) where ith position is 7-mod(l,8) i.e 7, 6, 5, 4, 3, 2, 1, 0\n\t\taccVector.at<int>(0, l) += ((int) ((byte >> (7 - (l % 8))) % 2));\n\t}\n\n}\n\nvoid KMajorityIndex::majorityVoting(const cv::Mat& accVector, cv::Mat& result,\n\t\tconst uint& threshold) {\n\n\t\/\/ cumResult and data must be a row vectors\n\tif (accVector.rows != 1 || result.rows != 1) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::majorityVoting: `bitwiseCount` and `centroid` parameters must be row vectors\\n\");\n\t}\n\n\t\/\/ cumResult and data must be same length\n\tif (result.cols * 8 != accVector.cols) {\n\t\tthrow std::runtime_error(\n\t\t\t\t\"KMajorityIndex::majorityVoting: number of columns in `bitwiseCount` must be that of `data` times 8\\n\");\n\t}\n\n\t\/\/ In this point I already have stored in bitwiseCount the bitwise sum of all data assigned to jth cluster\n\tfor (size_t l = 0; (int) l < accVector.cols; l++) {\n\t\t\/\/ If the bitcount for jth cluster at dimension l is greater than half of the data assigned to it\n\t\t\/\/ then set lth centroid bit to 1 otherwise set it to 0 (break ties randomly)\n\t\tbool bit;\n\t\t\/\/ There is a tie if the number of data assigned to jth cluster is even\n\t\t\/\/ AND the number of bits set to 1 in lth dimension is the half of the data assigned to jth cluster\n\t\tif (threshold % 2 == 1\n\t\t\t\t&& 2 * accVector.at<int>(0, l) == (int) threshold) {\n\t\t\tbit = rand() % 2;\n\t\t} else {\n\t\t\tbit = 2 * accVector.at<int>(0, l) > (int) (threshold);\n\t\t}\n\t\t\/\/ Stores the majority voting result from the LSB to the MSB\n\t\tresult.at<unsigned char>(0, (int) (accVector.cols - 1 - l) \/ 8) += (bit)\n\t\t\t\t<< ((accVector.cols - 1 - l) % 8);\n\t}\n}\n\nconst cv::Mat& KMajorityIndex::getCentroids() const {\n\treturn centroids;\n}\n\nuint* KMajorityIndex::getClusterCounts() const {\n\treturn cluster_counts;\n}\n\nuint* KMajorityIndex::getClusterAssignments() const {\n\treturn belongs_to;\n}\n\nint KMajorityIndex::getNumberOfClusters() const {\n\treturn centroids.rows;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2017 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <stdint.h>\n#include <string.h>\n\n#include <memory>\n\n#include <grpc\/grpc.h>\n#include <grpc\/impl\/codegen\/propagation_bits.h>\n#include <grpc\/slice.h>\n#include <grpc\/status.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_args.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"test\/core\/end2end\/cq_verifier.h\"\n#include \"test\/core\/end2end\/end2end_tests.h\"\n#include \"test\/core\/util\/test_config.h\"\n\n#define MAX_CONNECTION_IDLE_MS 500\n#define MAX_CONNECTION_AGE_MS 9999\n\nstatic void* tag(intptr_t t) { return reinterpret_cast<void*>(t); }\n\nstatic void drain_cq(grpc_completion_queue* cq) {\n grpc_event ev;\n do {\n ev = grpc_completion_queue_next(cq, grpc_timeout_seconds_to_deadline(5),\n nullptr);\n } while (ev.type != GRPC_QUEUE_SHUTDOWN);\n}\n\nstatic void simple_request_body(grpc_end2end_test_config \/*config*\/,\n grpc_end2end_test_fixture* f) {\n grpc_call* c;\n grpc_call* s;\n grpc_core::CqVerifier cqv(f->cq);\n grpc_op ops[6];\n grpc_op* op;\n grpc_metadata_array initial_metadata_recv;\n grpc_metadata_array trailing_metadata_recv;\n grpc_metadata_array request_metadata_recv;\n grpc_call_details call_details;\n grpc_status_code status;\n grpc_call_error error;\n grpc_slice details;\n int was_cancelled = 2;\n char* peer;\n\n gpr_timespec deadline = grpc_timeout_seconds_to_deadline(30);\n c = grpc_channel_create_call(f->client, nullptr, GRPC_PROPAGATE_DEFAULTS,\n f->cq, grpc_slice_from_static_string(\"\/foo\"),\n nullptr, deadline, nullptr);\n GPR_ASSERT(c);\n\n peer = grpc_call_get_peer(c);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"client_peer_before_call=%s\", peer);\n gpr_free(peer);\n\n grpc_metadata_array_init(&initial_metadata_recv);\n grpc_metadata_array_init(&trailing_metadata_recv);\n grpc_metadata_array_init(&request_metadata_recv);\n grpc_call_details_init(&call_details);\n\n memset(ops, 0, sizeof(ops));\n op = ops;\n op->op = GRPC_OP_SEND_INITIAL_METADATA;\n op->data.send_initial_metadata.count = 0;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_SEND_CLOSE_FROM_CLIENT;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_INITIAL_METADATA;\n op->data.recv_initial_metadata.recv_initial_metadata = &initial_metadata_recv;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_STATUS_ON_CLIENT;\n op->data.recv_status_on_client.trailing_metadata = &trailing_metadata_recv;\n op->data.recv_status_on_client.status = &status;\n op->data.recv_status_on_client.status_details = &details;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n error = grpc_call_start_batch(c, ops, static_cast<size_t>(op - ops), tag(1),\n nullptr);\n GPR_ASSERT(GRPC_CALL_OK == error);\n\n error =\n grpc_server_request_call(f->server, &s, &call_details,\n &request_metadata_recv, f->cq, f->cq, tag(101));\n GPR_ASSERT(GRPC_CALL_OK == error);\n cqv.Expect(tag(101), true);\n cqv.Verify();\n\n peer = grpc_call_get_peer(s);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"server_peer=%s\", peer);\n gpr_free(peer);\n peer = grpc_call_get_peer(c);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"client_peer=%s\", peer);\n gpr_free(peer);\n\n memset(ops, 0, sizeof(ops));\n op = ops;\n op->op = GRPC_OP_SEND_INITIAL_METADATA;\n op->data.send_initial_metadata.count = 0;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_SEND_STATUS_FROM_SERVER;\n op->data.send_status_from_server.trailing_metadata_count = 0;\n op->data.send_status_from_server.status = GRPC_STATUS_UNIMPLEMENTED;\n grpc_slice status_details = grpc_slice_from_static_string(\"xyz\");\n op->data.send_status_from_server.status_details = &status_details;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_CLOSE_ON_SERVER;\n op->data.recv_close_on_server.cancelled = &was_cancelled;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n error = grpc_call_start_batch(s, ops, static_cast<size_t>(op - ops), tag(102),\n nullptr);\n GPR_ASSERT(GRPC_CALL_OK == error);\n\n cqv.Expect(tag(102), true);\n cqv.Expect(tag(1), true);\n cqv.Verify();\n\n GPR_ASSERT(status == GRPC_STATUS_UNIMPLEMENTED);\n GPR_ASSERT(0 == grpc_slice_str_cmp(details, \"xyz\"));\n GPR_ASSERT(0 == grpc_slice_str_cmp(call_details.method, \"\/foo\"));\n GPR_ASSERT(was_cancelled == 0);\n\n grpc_slice_unref(details);\n grpc_metadata_array_destroy(&initial_metadata_recv);\n grpc_metadata_array_destroy(&trailing_metadata_recv);\n grpc_metadata_array_destroy(&request_metadata_recv);\n grpc_call_details_destroy(&call_details);\n\n grpc_call_unref(c);\n grpc_call_unref(s);\n}\n\nstatic void test_max_connection_idle(grpc_end2end_test_config config) {\n grpc_end2end_test_fixture f = config.create_fixture(nullptr, nullptr);\n grpc_connectivity_state state = GRPC_CHANNEL_IDLE;\n grpc_core::CqVerifier cqv(f.cq);\n\n auto client_args = grpc_core::ChannelArgs()\n .Set(GRPC_ARG_INITIAL_RECONNECT_BACKOFF_MS, 1000)\n .Set(GRPC_ARG_MAX_RECONNECT_BACKOFF_MS, 1000)\n .Set(GRPC_ARG_MIN_RECONNECT_BACKOFF_MS, 5000)\n .ToC();\n grpc_arg server_a[2];\n server_a[0].type = GRPC_ARG_INTEGER;\n server_a[0].key = const_cast<char*>(GRPC_ARG_MAX_CONNECTION_IDLE_MS);\n server_a[0].value.integer = MAX_CONNECTION_IDLE_MS;\n server_a[1].type = GRPC_ARG_INTEGER;\n server_a[1].key = const_cast<char*>(GRPC_ARG_MAX_CONNECTION_AGE_MS);\n server_a[1].value.integer = MAX_CONNECTION_AGE_MS;\n grpc_channel_args server_args = {GPR_ARRAY_SIZE(server_a), server_a};\n\n config.init_client(&f, client_args.get());\n config.init_server(&f, &server_args);\n\n \/* check that we're still in idle, and start connecting *\/\n GPR_ASSERT(grpc_channel_check_connectivity_state(f.client, 1) ==\n GRPC_CHANNEL_IDLE);\n \/* we'll go through some set of transitions (some might be missed), until\n READY is reached *\/\n while (state != GRPC_CHANNEL_READY) {\n grpc_channel_watch_connectivity_state(\n f.client, state, grpc_timeout_seconds_to_deadline(10), f.cq, tag(99));\n cqv.Expect(tag(99), true);\n cqv.Verify();\n state = grpc_channel_check_connectivity_state(f.client, 0);\n GPR_ASSERT(state == GRPC_CHANNEL_READY ||\n state == GRPC_CHANNEL_CONNECTING ||\n state == GRPC_CHANNEL_TRANSIENT_FAILURE);\n }\n\n \/* Use a simple request to cancel and reset the max idle timer *\/\n simple_request_body(config, &f);\n\n \/* wait for the channel to reach its maximum idle time *\/\n grpc_channel_watch_connectivity_state(\n f.client, GRPC_CHANNEL_READY,\n grpc_timeout_milliseconds_to_deadline(MAX_CONNECTION_IDLE_MS + 3000),\n f.cq, tag(99));\n cqv.Expect(tag(99), true);\n cqv.Verify();\n state = grpc_channel_check_connectivity_state(f.client, 0);\n GPR_ASSERT(state == GRPC_CHANNEL_TRANSIENT_FAILURE ||\n state == GRPC_CHANNEL_CONNECTING || state == GRPC_CHANNEL_IDLE);\n\n grpc_server_shutdown_and_notify(f.server, f.cq, tag(0xdead));\n cqv.Expect(tag(0xdead), true);\n cqv.Verify();\n\n grpc_server_destroy(f.server);\n grpc_channel_destroy(f.client);\n grpc_completion_queue_shutdown(f.cq);\n drain_cq(f.cq);\n grpc_completion_queue_destroy(f.cq);\n config.tear_down_data(&f);\n}\n\nvoid max_connection_idle(grpc_end2end_test_config config) {\n test_max_connection_idle(config);\n}\n\nvoid max_connection_idle_pre_init(void) {}\n<commit_msg>[fixit] MaxConnectionIdle: Increase idleness period to 2sec (#30632)<commit_after>\/*\n *\n * Copyright 2017 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <stdint.h>\n#include <string.h>\n\n#include <memory>\n\n#include <grpc\/grpc.h>\n#include <grpc\/impl\/codegen\/propagation_bits.h>\n#include <grpc\/slice.h>\n#include <grpc\/status.h>\n#include <grpc\/support\/alloc.h>\n#include <grpc\/support\/log.h>\n\n#include \"src\/core\/lib\/channel\/channel_args.h\"\n#include \"src\/core\/lib\/gpr\/useful.h\"\n#include \"test\/core\/end2end\/cq_verifier.h\"\n#include \"test\/core\/end2end\/end2end_tests.h\"\n#include \"test\/core\/util\/test_config.h\"\n\n#define MAX_CONNECTION_IDLE_MS 2000\n#define MAX_CONNECTION_AGE_MS 9999\n\nstatic void* tag(intptr_t t) { return reinterpret_cast<void*>(t); }\n\nstatic void drain_cq(grpc_completion_queue* cq) {\n grpc_event ev;\n do {\n ev = grpc_completion_queue_next(cq, grpc_timeout_seconds_to_deadline(5),\n nullptr);\n } while (ev.type != GRPC_QUEUE_SHUTDOWN);\n}\n\nstatic void simple_request_body(grpc_end2end_test_config \/*config*\/,\n grpc_end2end_test_fixture* f) {\n grpc_call* c;\n grpc_call* s;\n grpc_core::CqVerifier cqv(f->cq);\n grpc_op ops[6];\n grpc_op* op;\n grpc_metadata_array initial_metadata_recv;\n grpc_metadata_array trailing_metadata_recv;\n grpc_metadata_array request_metadata_recv;\n grpc_call_details call_details;\n grpc_status_code status;\n grpc_call_error error;\n grpc_slice details;\n int was_cancelled = 2;\n char* peer;\n\n gpr_timespec deadline = grpc_timeout_seconds_to_deadline(30);\n c = grpc_channel_create_call(f->client, nullptr, GRPC_PROPAGATE_DEFAULTS,\n f->cq, grpc_slice_from_static_string(\"\/foo\"),\n nullptr, deadline, nullptr);\n GPR_ASSERT(c);\n\n peer = grpc_call_get_peer(c);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"client_peer_before_call=%s\", peer);\n gpr_free(peer);\n\n grpc_metadata_array_init(&initial_metadata_recv);\n grpc_metadata_array_init(&trailing_metadata_recv);\n grpc_metadata_array_init(&request_metadata_recv);\n grpc_call_details_init(&call_details);\n\n memset(ops, 0, sizeof(ops));\n op = ops;\n op->op = GRPC_OP_SEND_INITIAL_METADATA;\n op->data.send_initial_metadata.count = 0;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_SEND_CLOSE_FROM_CLIENT;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_INITIAL_METADATA;\n op->data.recv_initial_metadata.recv_initial_metadata = &initial_metadata_recv;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_STATUS_ON_CLIENT;\n op->data.recv_status_on_client.trailing_metadata = &trailing_metadata_recv;\n op->data.recv_status_on_client.status = &status;\n op->data.recv_status_on_client.status_details = &details;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n error = grpc_call_start_batch(c, ops, static_cast<size_t>(op - ops), tag(1),\n nullptr);\n GPR_ASSERT(GRPC_CALL_OK == error);\n\n error =\n grpc_server_request_call(f->server, &s, &call_details,\n &request_metadata_recv, f->cq, f->cq, tag(101));\n GPR_ASSERT(GRPC_CALL_OK == error);\n cqv.Expect(tag(101), true);\n cqv.Verify();\n\n peer = grpc_call_get_peer(s);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"server_peer=%s\", peer);\n gpr_free(peer);\n peer = grpc_call_get_peer(c);\n GPR_ASSERT(peer != nullptr);\n gpr_log(GPR_DEBUG, \"client_peer=%s\", peer);\n gpr_free(peer);\n\n memset(ops, 0, sizeof(ops));\n op = ops;\n op->op = GRPC_OP_SEND_INITIAL_METADATA;\n op->data.send_initial_metadata.count = 0;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_SEND_STATUS_FROM_SERVER;\n op->data.send_status_from_server.trailing_metadata_count = 0;\n op->data.send_status_from_server.status = GRPC_STATUS_UNIMPLEMENTED;\n grpc_slice status_details = grpc_slice_from_static_string(\"xyz\");\n op->data.send_status_from_server.status_details = &status_details;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n op->op = GRPC_OP_RECV_CLOSE_ON_SERVER;\n op->data.recv_close_on_server.cancelled = &was_cancelled;\n op->flags = 0;\n op->reserved = nullptr;\n op++;\n error = grpc_call_start_batch(s, ops, static_cast<size_t>(op - ops), tag(102),\n nullptr);\n GPR_ASSERT(GRPC_CALL_OK == error);\n\n cqv.Expect(tag(102), true);\n cqv.Expect(tag(1), true);\n cqv.Verify();\n\n GPR_ASSERT(status == GRPC_STATUS_UNIMPLEMENTED);\n GPR_ASSERT(0 == grpc_slice_str_cmp(details, \"xyz\"));\n GPR_ASSERT(0 == grpc_slice_str_cmp(call_details.method, \"\/foo\"));\n GPR_ASSERT(was_cancelled == 0);\n\n grpc_slice_unref(details);\n grpc_metadata_array_destroy(&initial_metadata_recv);\n grpc_metadata_array_destroy(&trailing_metadata_recv);\n grpc_metadata_array_destroy(&request_metadata_recv);\n grpc_call_details_destroy(&call_details);\n\n grpc_call_unref(c);\n grpc_call_unref(s);\n}\n\nstatic void test_max_connection_idle(grpc_end2end_test_config config) {\n grpc_end2end_test_fixture f = config.create_fixture(nullptr, nullptr);\n grpc_connectivity_state state = GRPC_CHANNEL_IDLE;\n grpc_core::CqVerifier cqv(f.cq);\n\n auto client_args = grpc_core::ChannelArgs()\n .Set(GRPC_ARG_INITIAL_RECONNECT_BACKOFF_MS, 1000)\n .Set(GRPC_ARG_MAX_RECONNECT_BACKOFF_MS, 1000)\n .Set(GRPC_ARG_MIN_RECONNECT_BACKOFF_MS, 5000)\n .ToC();\n grpc_arg server_a[2];\n server_a[0].type = GRPC_ARG_INTEGER;\n server_a[0].key = const_cast<char*>(GRPC_ARG_MAX_CONNECTION_IDLE_MS);\n server_a[0].value.integer = MAX_CONNECTION_IDLE_MS;\n server_a[1].type = GRPC_ARG_INTEGER;\n server_a[1].key = const_cast<char*>(GRPC_ARG_MAX_CONNECTION_AGE_MS);\n server_a[1].value.integer = MAX_CONNECTION_AGE_MS;\n grpc_channel_args server_args = {GPR_ARRAY_SIZE(server_a), server_a};\n\n config.init_client(&f, client_args.get());\n config.init_server(&f, &server_args);\n\n \/* check that we're still in idle, and start connecting *\/\n GPR_ASSERT(grpc_channel_check_connectivity_state(f.client, 1) ==\n GRPC_CHANNEL_IDLE);\n \/* we'll go through some set of transitions (some might be missed), until\n READY is reached *\/\n while (state != GRPC_CHANNEL_READY) {\n grpc_channel_watch_connectivity_state(\n f.client, state, grpc_timeout_seconds_to_deadline(10), f.cq, tag(99));\n cqv.Expect(tag(99), true);\n cqv.Verify();\n state = grpc_channel_check_connectivity_state(f.client, 0);\n GPR_ASSERT(state == GRPC_CHANNEL_READY ||\n state == GRPC_CHANNEL_CONNECTING ||\n state == GRPC_CHANNEL_TRANSIENT_FAILURE);\n }\n\n \/* Use a simple request to cancel and reset the max idle timer *\/\n simple_request_body(config, &f);\n\n \/* wait for the channel to reach its maximum idle time *\/\n grpc_channel_watch_connectivity_state(\n f.client, GRPC_CHANNEL_READY,\n grpc_timeout_milliseconds_to_deadline(MAX_CONNECTION_IDLE_MS + 3000),\n f.cq, tag(99));\n cqv.Expect(tag(99), true);\n cqv.Verify();\n state = grpc_channel_check_connectivity_state(f.client, 0);\n GPR_ASSERT(state == GRPC_CHANNEL_TRANSIENT_FAILURE ||\n state == GRPC_CHANNEL_CONNECTING || state == GRPC_CHANNEL_IDLE);\n\n grpc_server_shutdown_and_notify(f.server, f.cq, tag(0xdead));\n cqv.Expect(tag(0xdead), true);\n cqv.Verify();\n\n grpc_server_destroy(f.server);\n grpc_channel_destroy(f.client);\n grpc_completion_queue_shutdown(f.cq);\n drain_cq(f.cq);\n grpc_completion_queue_destroy(f.cq);\n config.tear_down_data(&f);\n}\n\nvoid max_connection_idle(grpc_end2end_test_config config) {\n test_max_connection_idle(config);\n}\n\nvoid max_connection_idle_pre_init(void) {}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright 2020 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <chrono>\n#include <condition_variable>\n#include <map>\n#include <mutex>\n#include <set>\n#include <sstream>\n#include <string>\n#include <thread>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <grpcpp\/grpcpp.h>\n#include <grpcpp\/server.h>\n#include <grpcpp\/server_builder.h>\n#include <grpcpp\/server_context.h>\n\n#include \"src\/proto\/grpc\/testing\/empty.pb.h\"\n#include \"src\/proto\/grpc\/testing\/messages.pb.h\"\n#include \"src\/proto\/grpc\/testing\/test.grpc.pb.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/test_config.h\"\n\nDEFINE_int32(num_channels, 1, \"Number of channels.\");\nDEFINE_bool(print_response, false, \"Write RPC response to stdout.\");\nDEFINE_int32(qps, 1, \"Qps per channel.\");\nDEFINE_int32(rpc_timeout_sec, 10, \"Per RPC timeout seconds.\");\nDEFINE_string(server, \"localhost:50051\", \"Address of server.\");\nDEFINE_int32(stats_port, 50052,\n \"Port to expose peer distribution stats service.\");\n\nusing grpc::Channel;\nusing grpc::ClientContext;\nusing grpc::Server;\nusing grpc::ServerBuilder;\nusing grpc::ServerContext;\nusing grpc::ServerCredentials;\nusing grpc::ServerReader;\nusing grpc::ServerReaderWriter;\nusing grpc::ServerWriter;\nusing grpc::Status;\nusing grpc::testing::LoadBalancerStatsRequest;\nusing grpc::testing::LoadBalancerStatsResponse;\nusing grpc::testing::LoadBalancerStatsService;\nusing grpc::testing::SimpleRequest;\nusing grpc::testing::SimpleResponse;\nusing grpc::testing::TestService;\n\nclass XdsStatsWatcher;\n\n\/\/ Unique ID for each outgoing RPC\nint global_request_id;\n\/\/ Stores a set of watchers that should be notified upon outgoing RPC completion\nstd::set<XdsStatsWatcher*> watchers;\n\/\/ Mutex for global_request_id and watchers\nstd::mutex mu;\n\n\/** Records the remote peer distribution for a given range of RPCs. *\/\nclass XdsStatsWatcher {\n public:\n XdsStatsWatcher(int start_id, int end_id)\n : start_id_(start_id), end_id_(end_id), rpcs_needed_(end_id - start_id) {}\n\n void RpcCompleted(int request_id, const std::string& peer) {\n if (start_id_ <= request_id && request_id < end_id_) {\n {\n std::lock_guard<std::mutex> lk(m_);\n if (peer.empty()) {\n no_remote_peer_++;\n } else {\n rpcs_by_peer_[peer]++;\n }\n rpcs_needed_--;\n }\n cv_.notify_one();\n }\n }\n\n void WaitForRpcStatsResponse(LoadBalancerStatsResponse* response,\n int timeout_sec) {\n {\n std::unique_lock<std::mutex> lk(m_);\n cv_.wait_for(lk, std::chrono::seconds(timeout_sec),\n [this] { return rpcs_needed_ == 0; });\n response->mutable_rpcs_by_peer()->insert(rpcs_by_peer_.begin(),\n rpcs_by_peer_.end());\n response->set_num_failures(no_remote_peer_ + rpcs_needed_);\n }\n }\n\n private:\n int start_id_;\n int end_id_;\n int rpcs_needed_;\n std::map<std::string, int> rpcs_by_peer_;\n int no_remote_peer_;\n std::mutex m_;\n std::condition_variable cv_;\n};\n\nclass TestClient {\n public:\n TestClient(const std::shared_ptr<Channel>& channel)\n : stub_(TestService::NewStub(channel)) {}\n\n void UnaryCall() {\n SimpleResponse response;\n ClientContext context;\n\n int saved_request_id;\n {\n std::lock_guard<std::mutex> lk(mu);\n saved_request_id = ++global_request_id;\n }\n std::chrono::system_clock::time_point deadline =\n std::chrono::system_clock::now() +\n std::chrono::seconds(FLAGS_rpc_timeout_sec);\n context.set_deadline(deadline);\n Status status = stub_->UnaryCall(\n &context, SimpleRequest::default_instance(), &response);\n\n {\n std::lock_guard<std::mutex> lk(mu);\n for (auto watcher : watchers) {\n watcher->RpcCompleted(saved_request_id, response.hostname());\n }\n }\n\n if (FLAGS_print_response) {\n if (status.ok()) {\n std::cout << \"Greeting: Hello world, this is \" << response.hostname()\n << \", from \" << context.peer() << std::endl;\n } else {\n std::cout << \"RPC failed: \" << status.error_code() << \": \"\n << status.error_message() << std::endl;\n }\n }\n }\n\n private:\n std::unique_ptr<TestService::Stub> stub_;\n};\n\nclass LoadBalancerStatsServiceImpl : public LoadBalancerStatsService::Service {\n public:\n Status GetClientStats(ServerContext* context,\n const LoadBalancerStatsRequest* request,\n LoadBalancerStatsResponse* response) {\n int start_id;\n int end_id;\n XdsStatsWatcher* watcher;\n {\n std::lock_guard<std::mutex> lk(mu);\n start_id = global_request_id + 1;\n end_id = start_id + request->num_rpcs();\n watcher = new XdsStatsWatcher(start_id, end_id);\n watchers.insert(watcher);\n }\n watcher->WaitForRpcStatsResponse(response, request->timeout_sec());\n {\n std::lock_guard<std::mutex> lk(mu);\n watchers.erase(watcher);\n }\n delete watcher;\n return Status::OK;\n }\n};\n\nvoid RunTestLoop(const std::string& server,\n std::chrono::duration<double> duration_per_query) {\n TestClient client(\n grpc::CreateChannel(server, grpc::InsecureChannelCredentials()));\n std::chrono::time_point<std::chrono::system_clock> start =\n std::chrono::system_clock::now();\n std::chrono::duration<double> elapsed;\n\n while (true) {\n elapsed = std::chrono::system_clock::now() - start;\n if (elapsed > duration_per_query) {\n start = std::chrono::system_clock::now();\n client.UnaryCall();\n }\n }\n}\n\nvoid RunServer(const int port) {\n GPR_ASSERT(port != 0);\n std::ostringstream server_address;\n server_address << \"0.0.0.0:\" << port;\n\n LoadBalancerStatsServiceImpl service;\n\n ServerBuilder builder;\n builder.RegisterService(&service);\n builder.AddListeningPort(server_address.str(),\n grpc::InsecureServerCredentials());\n std::unique_ptr<Server> server(builder.BuildAndStart());\n gpr_log(GPR_INFO, \"Stats server listening on %s\",\n server_address.str().c_str());\n\n server->Wait();\n}\n\nint main(int argc, char** argv) {\n grpc::testing::TestEnvironment env(argc, argv);\n grpc::testing::InitTest(&argc, &argv, true);\n\n std::chrono::duration<double> duration_per_query =\n std::chrono::nanoseconds(std::chrono::seconds(1)) \/ FLAGS_qps;\n\n std::vector<std::thread> test_threads;\n\n for (int i = 0; i < FLAGS_num_channels; i++) {\n test_threads.emplace_back(\n std::thread(&RunTestLoop, FLAGS_server, duration_per_query));\n }\n\n RunServer(FLAGS_stats_port);\n\n for (auto it = test_threads.begin(); it != test_threads.end(); it++) {\n it->join();\n }\n\n return 0;\n}\n<commit_msg>Clang tidy xds interop client<commit_after>\/*\n *\n * Copyright 2020 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <chrono>\n#include <condition_variable>\n#include <map>\n#include <mutex>\n#include <set>\n#include <sstream>\n#include <string>\n#include <thread>\n#include <vector>\n\n#include <gflags\/gflags.h>\n#include <grpcpp\/grpcpp.h>\n#include <grpcpp\/server.h>\n#include <grpcpp\/server_builder.h>\n#include <grpcpp\/server_context.h>\n\n#include \"src\/proto\/grpc\/testing\/empty.pb.h\"\n#include \"src\/proto\/grpc\/testing\/messages.pb.h\"\n#include \"src\/proto\/grpc\/testing\/test.grpc.pb.h\"\n#include \"test\/core\/util\/test_config.h\"\n#include \"test\/cpp\/util\/test_config.h\"\n\nDEFINE_int32(num_channels, 1, \"Number of channels.\");\nDEFINE_bool(print_response, false, \"Write RPC response to stdout.\");\nDEFINE_int32(qps, 1, \"Qps per channel.\");\nDEFINE_int32(rpc_timeout_sec, 10, \"Per RPC timeout seconds.\");\nDEFINE_string(server, \"localhost:50051\", \"Address of server.\");\nDEFINE_int32(stats_port, 50052,\n \"Port to expose peer distribution stats service.\");\n\nusing grpc::Channel;\nusing grpc::ClientContext;\nusing grpc::Server;\nusing grpc::ServerBuilder;\nusing grpc::ServerContext;\nusing grpc::ServerCredentials;\nusing grpc::ServerReader;\nusing grpc::ServerReaderWriter;\nusing grpc::ServerWriter;\nusing grpc::Status;\nusing grpc::testing::LoadBalancerStatsRequest;\nusing grpc::testing::LoadBalancerStatsResponse;\nusing grpc::testing::LoadBalancerStatsService;\nusing grpc::testing::SimpleRequest;\nusing grpc::testing::SimpleResponse;\nusing grpc::testing::TestService;\n\nclass XdsStatsWatcher;\n\n\/\/ Unique ID for each outgoing RPC\nint global_request_id;\n\/\/ Stores a set of watchers that should be notified upon outgoing RPC completion\nstd::set<XdsStatsWatcher*> watchers;\n\/\/ Mutex for global_request_id and watchers\nstd::mutex mu;\n\n\/** Records the remote peer distribution for a given range of RPCs. *\/\nclass XdsStatsWatcher {\n public:\n XdsStatsWatcher(int start_id, int end_id)\n : start_id_(start_id), end_id_(end_id), rpcs_needed_(end_id - start_id) {}\n\n void RpcCompleted(int request_id, const std::string& peer) {\n if (start_id_ <= request_id && request_id < end_id_) {\n {\n std::lock_guard<std::mutex> lk(m_);\n if (peer.empty()) {\n no_remote_peer_++;\n } else {\n rpcs_by_peer_[peer]++;\n }\n rpcs_needed_--;\n }\n cv_.notify_one();\n }\n }\n\n void WaitForRpcStatsResponse(LoadBalancerStatsResponse* response,\n int timeout_sec) {\n {\n std::unique_lock<std::mutex> lk(m_);\n cv_.wait_for(lk, std::chrono::seconds(timeout_sec),\n [this] { return rpcs_needed_ == 0; });\n response->mutable_rpcs_by_peer()->insert(rpcs_by_peer_.begin(),\n rpcs_by_peer_.end());\n response->set_num_failures(no_remote_peer_ + rpcs_needed_);\n }\n }\n\n private:\n int start_id_;\n int end_id_;\n int rpcs_needed_;\n std::map<std::string, int> rpcs_by_peer_;\n int no_remote_peer_;\n std::mutex m_;\n std::condition_variable cv_;\n};\n\nclass TestClient {\n public:\n TestClient(const std::shared_ptr<Channel>& channel)\n : stub_(TestService::NewStub(channel)) {}\n\n void UnaryCall() {\n SimpleResponse response;\n ClientContext context;\n\n int saved_request_id;\n {\n std::lock_guard<std::mutex> lk(mu);\n saved_request_id = ++global_request_id;\n }\n std::chrono::system_clock::time_point deadline =\n std::chrono::system_clock::now() +\n std::chrono::seconds(FLAGS_rpc_timeout_sec);\n context.set_deadline(deadline);\n Status status = stub_->UnaryCall(\n &context, SimpleRequest::default_instance(), &response);\n\n {\n std::lock_guard<std::mutex> lk(mu);\n for (auto watcher : watchers) {\n watcher->RpcCompleted(saved_request_id, response.hostname());\n }\n }\n\n if (FLAGS_print_response) {\n if (status.ok()) {\n std::cout << \"Greeting: Hello world, this is \" << response.hostname()\n << \", from \" << context.peer() << std::endl;\n } else {\n std::cout << \"RPC failed: \" << status.error_code() << \": \"\n << status.error_message() << std::endl;\n }\n }\n }\n\n private:\n std::unique_ptr<TestService::Stub> stub_;\n};\n\nclass LoadBalancerStatsServiceImpl : public LoadBalancerStatsService::Service {\n public:\n Status GetClientStats(ServerContext* context,\n const LoadBalancerStatsRequest* request,\n LoadBalancerStatsResponse* response) {\n int start_id;\n int end_id;\n XdsStatsWatcher* watcher;\n {\n std::lock_guard<std::mutex> lk(mu);\n start_id = global_request_id + 1;\n end_id = start_id + request->num_rpcs();\n watcher = new XdsStatsWatcher(start_id, end_id);\n watchers.insert(watcher);\n }\n watcher->WaitForRpcStatsResponse(response, request->timeout_sec());\n {\n std::lock_guard<std::mutex> lk(mu);\n watchers.erase(watcher);\n }\n delete watcher;\n return Status::OK;\n }\n};\n\nvoid RunTestLoop(const std::string& server,\n std::chrono::duration<double> duration_per_query) {\n TestClient client(\n grpc::CreateChannel(server, grpc::InsecureChannelCredentials()));\n std::chrono::time_point<std::chrono::system_clock> start =\n std::chrono::system_clock::now();\n std::chrono::duration<double> elapsed;\n\n while (true) {\n elapsed = std::chrono::system_clock::now() - start;\n if (elapsed > duration_per_query) {\n start = std::chrono::system_clock::now();\n client.UnaryCall();\n }\n }\n}\n\nvoid RunServer(const int port) {\n GPR_ASSERT(port != 0);\n std::ostringstream server_address;\n server_address << \"0.0.0.0:\" << port;\n\n LoadBalancerStatsServiceImpl service;\n\n ServerBuilder builder;\n builder.RegisterService(&service);\n builder.AddListeningPort(server_address.str(),\n grpc::InsecureServerCredentials());\n std::unique_ptr<Server> server(builder.BuildAndStart());\n gpr_log(GPR_INFO, \"Stats server listening on %s\",\n server_address.str().c_str());\n\n server->Wait();\n}\n\nint main(int argc, char** argv) {\n grpc::testing::TestEnvironment env(argc, argv);\n grpc::testing::InitTest(&argc, &argv, true);\n\n std::chrono::duration<double> duration_per_query =\n std::chrono::nanoseconds(std::chrono::seconds(1)) \/ FLAGS_qps;\n\n std::vector<std::thread> test_threads;\n\n test_threads.reserve(FLAGS_num_channels);\n for (int i = 0; i < FLAGS_num_channels; i++) {\n test_threads.emplace_back(\n std::thread(&RunTestLoop, FLAGS_server, duration_per_query));\n }\n\n RunServer(FLAGS_stats_port);\n\n for (auto it = test_threads.begin(); it != test_threads.end(); it++) {\n it->join();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * kPPP: A pppd front end for the KDE project\n *\n * $Id$\n * \n * Copyright (C) 1997 Bernd Johannes Wuebben \n * wuebben@math.cornell.edu\n *\n * This file was contributed by Mario Weilguni <mweilguni@sime.com>\n * Thanks Mario !\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this program; if not, write to the Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <qdir.h>\n#include \"runtests.h\"\n#include <ctype.h>\n#include <unistd.h>\n#include <kmessagebox.h>\n#include <sys\/stat.h>\n#include <stdlib.h>\n#include <sys\/types.h>\n#include <pwd.h>\n#include <netinet\/in.h>\n\n#ifdef HAVE_RESOLV_H\n#include <resolv.h>\n#endif\n\n#ifndef _PATH_RESCONF\n#define _PATH_RESCONF \"\/etc\/resolv.conf\"\n#endif\n\n#include <klocale.h>\n#include \"pppdata.h\"\n\n\/\/ initial effective uid (main.cpp)\nextern uid_t euid;\n\n\/\/ secure pppd location (opener.cpp)\nextern const char* pppdPath();\n\n\/\/ shamelessly stolen from pppd-2.3.5\n\/********************************************************************\n *\n * Internal routine to decode the version.modification.patch level\n *\/\n\nstatic void decode_version (const char *_buf, int *version,\n\t\t\t int *modification, int *patch)\n {\n char *buffer = qstrdup(_buf);\n char *buf = buffer;\n *version = (int) strtoul (buf, &buf, 10);\n *modification = 0;\n *patch = 0;\n \n if (*buf == '.')\n {\n\t++buf;\n\t*modification = (int) strtoul (buf, &buf, 10);\n\tif (*buf == '.')\n\t {\n\t ++buf;\n\t *patch = (int) strtoul (buf, &buf, 10);\n\t }\n }\n \n if (*buf != '\\0')\n {\n\t*version =\n\t*modification =\n\t*patch = 0;\n }\n\n delete [] buffer;\n }\n\n\nvoid pppdVersion(int *version, int *modification, int *patch) {\n char buffer[30];\n const char *pppd;\n char *query;\n\n *version = *modification = *patch = 0;\n\n \/\/ locate pppd\n if(!(pppd = pppdPath()))\n return;\n\n \/\/ call pppd with --version option\n if(!(query = new char[strlen(pppd)+25]))\n return;\n strcpy(query, pppd);\n \/\/ had to add a dummy device to prevent a \"no device specified\n \/\/ and stdin is not a tty\" error from newer pppd versions.\n strcat(query, \" --version \/dev\/tty 2>&1\");\n FILE *output = popen(query, \"r\");\n delete [] query;\n if(!output)\n return;\n\n \/\/ read output\n int size = fread(buffer, sizeof(char), 29, output);\n\n if(ferror(output)) {\n pclose(output);\n return;\n }\n pclose(output);\n buffer[size] = '\\0';\n\n \/\/ find position of version number x.y.z\n char *p = buffer;\n while(!isdigit(*p))\n p++;\n char *p2 = p;\n while(*p2 == '.' || isdigit(*p2))\n p2++;\n *p2 = '\\0';\n\n decode_version(p, version, modification, patch);\n}\n\n\nint uidFromName(const char *uname) {\n struct passwd *pw;\n\n setpwent();\n while((pw = getpwent()) != NULL) {\n if(strcmp(uname, pw->pw_name) == 0) {\n int uid = pw->pw_uid;\n endpwent();\n return uid;\n }\n }\n \n endpwent();\n return -1;\n}\n\n\nconst char *homedirFromUid(uid_t uid) {\n struct passwd *pw;\n char *d = 0;\n\n setpwent();\n while((pw = getpwent()) != NULL) {\n if(pw->pw_uid == uid) {\n d = strdup(pw->pw_dir);\n endpwent();\n return d;\n }\n }\n\n endpwent();\n return d;\n}\n\n\nconst char* getHomeDir() {\n static const char *hd = 0;\n static bool ranTest = false;\n if(!ranTest) {\n hd = homedirFromUid(getuid());\n ranTest = true;\n }\n \n return hd;\n}\n\n\nint runTests() {\n int warning = 0;\n\n \/\/ Test pre-1: check if the user is allowed to dial-out\n if(access(\"\/etc\/kppp.allow\", R_OK) == 0 && getuid() != 0) {\n bool access = FALSE;\n FILE *f;\n if((f = fopen(\"\/etc\/kppp.allow\", \"r\")) != NULL) {\n char buf[2048]; \/\/ safe\n while(f != NULL && !feof(f)) {\n\tif(fgets(buf, sizeof(buf), f) != NULL) {\n\t QString s(buf);\n\n\t s = s.stripWhiteSpace();\n\t if(s[0] == '#' || s.length() == 0)\n\t continue;\n\n\t if((uid_t)uidFromName(QFile::encodeName(s)) == getuid()) {\n\t access = TRUE;\n\t fclose(f);\n\t f = NULL;\n\t }\n\t}\n }\n if(f)\n\tfclose(f);\n }\n\n if(!access) {\n KMessageBox::error(0,\n\t\t i18n(\"You're not allowed to dial out with \"\n\t\t \"kppp.\\nContact your system administrator.\"));\n return TEST_CRITICAL;\n }\n }\n\n \/\/ Test 1: search the pppd binary\n const char *f = pppdPath();\n\n if(!f) {\n KMessageBox::error(0,\n\t\t i18n(\"Cannot find the PPP daemon!\\n\\n\"\n \"Make sure that pppd is installed.\"));\n warning++;\n }\n\n \/\/ Test 2: check access to the pppd binary\n if(f) {\n#if 0\n if(access(f, X_OK) != 0 \/* && geteuid() != 0 *\/) {\n KMessageBox::error(0,\n\t\t i18n(\"You do not have the permission\\n\"\n\t\t\t\"to start pppd!\\n\\n\"\n\t\t\t\"Contact your system administrator\\n\"\n\t\t\t\"and ask to get access to pppd.\"));\n return TEST_CRITICAL;\n }\n#endif\n\n if(euid != 0) {\n struct stat st;\n stat(f, &st);\n if(st.st_uid != 0 || (st.st_mode & S_ISUID) == 0) {\n\tKMessageBox::error(0,\n i18n(\"You don't have sufficient permission to run\\n\"\n \"\\n%1\\n\\n\"\n \"Please make sure that kppp is owned by root\\n\"\n \"and has the SUID bit set.\\n\").arg(f));\n warning++;\n }\n }\n }\n\n \/\/ Test 5: check for existence of \/etc\/resolv.conf\n if (access(_PATH_RESCONF, R_OK) != 0) {\n QString file = _PATH_RESCONF\" \";\n QString msgstr = i18n(\"%1 is missing or can't be read!\\n\\n\"\n \"Ask your system administrator to create\\n\"\n \"this file (can be empty) with appropriate\\n\"\n \"read and write permissions.\").arg(file);\n KMessageBox::error(0, msgstr);\n warning ++;\n }\n\n if(warning == 0)\n return TEST_OK;\n else\n return TEST_WARNING;\n}\n\n<commit_msg>finally: a fflush(0) before popen() stops the crash once and for all. See BUGS section in the Linux man page for popen().<commit_after>\/*\n * kPPP: A pppd front end for the KDE project\n *\n * $Id$\n * \n * Copyright (C) 1997 Bernd Johannes Wuebben \n * wuebben@math.cornell.edu\n *\n * This file was contributed by Mario Weilguni <mweilguni@sime.com>\n * Thanks Mario !\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this program; if not, write to the Free\n * Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n *\/\n\n#include <qdir.h>\n#include \"runtests.h\"\n#include <ctype.h>\n#include <unistd.h>\n#include <kmessagebox.h>\n#include <sys\/stat.h>\n#include <stdlib.h>\n#include <sys\/types.h>\n#include <pwd.h>\n#include <netinet\/in.h>\n\n#ifdef HAVE_RESOLV_H\n#include <resolv.h>\n#endif\n\n#ifndef _PATH_RESCONF\n#define _PATH_RESCONF \"\/etc\/resolv.conf\"\n#endif\n\n#include <klocale.h>\n#include \"pppdata.h\"\n\n\/\/ initial effective uid (main.cpp)\nextern uid_t euid;\n\n\/\/ secure pppd location (opener.cpp)\nextern const char* pppdPath();\n\n\/\/ shamelessly stolen from pppd-2.3.5\n\/********************************************************************\n *\n * Internal routine to decode the version.modification.patch level\n *\/\n\nstatic void decode_version (const char *_buf, int *version,\n\t\t\t int *modification, int *patch)\n {\n char *buffer = qstrdup(_buf);\n char *buf = buffer;\n *version = (int) strtoul (buf, &buf, 10);\n *modification = 0;\n *patch = 0;\n \n if (*buf == '.')\n {\n\t++buf;\n\t*modification = (int) strtoul (buf, &buf, 10);\n\tif (*buf == '.')\n\t {\n\t ++buf;\n\t *patch = (int) strtoul (buf, &buf, 10);\n\t }\n }\n \n if (*buf != '\\0')\n {\n\t*version =\n\t*modification =\n\t*patch = 0;\n }\n\n delete [] buffer;\n }\n\n\nvoid pppdVersion(int *version, int *modification, int *patch) {\n char buffer[30];\n const char *pppd;\n char *query;\n\n *version = *modification = *patch = 0;\n\n \/\/ locate pppd\n if(!(pppd = pppdPath()))\n return;\n\n \/\/ call pppd with --version option\n if(!(query = new char[strlen(pppd)+25]))\n return;\n strcpy(query, pppd);\n \/\/ had to add a dummy device to prevent a \"no device specified\n \/\/ and stdin is not a tty\" error from newer pppd versions.\n strcat(query, \" --version \/dev\/tty 2>&1\");\n fflush(0L);\n FILE *output = popen(query, \"r\");\n delete [] query;\n if(!output)\n return;\n\n \/\/ read output\n int size = fread(buffer, sizeof(char), 29, output);\n\n if(ferror(output)) {\n pclose(output);\n return;\n }\n pclose(output);\n buffer[size] = '\\0';\n\n \/\/ find position of version number x.y.z\n char *p = buffer;\n while(!isdigit(*p))\n p++;\n char *p2 = p;\n while(*p2 == '.' || isdigit(*p2))\n p2++;\n *p2 = '\\0';\n\n decode_version(p, version, modification, patch);\n}\n\n\nint uidFromName(const char *uname) {\n struct passwd *pw;\n\n setpwent();\n while((pw = getpwent()) != NULL) {\n if(strcmp(uname, pw->pw_name) == 0) {\n int uid = pw->pw_uid;\n endpwent();\n return uid;\n }\n }\n \n endpwent();\n return -1;\n}\n\n\nconst char *homedirFromUid(uid_t uid) {\n struct passwd *pw;\n char *d = 0;\n\n setpwent();\n while((pw = getpwent()) != NULL) {\n if(pw->pw_uid == uid) {\n d = strdup(pw->pw_dir);\n endpwent();\n return d;\n }\n }\n\n endpwent();\n return d;\n}\n\n\nconst char* getHomeDir() {\n static const char *hd = 0;\n static bool ranTest = false;\n if(!ranTest) {\n hd = homedirFromUid(getuid());\n ranTest = true;\n }\n \n return hd;\n}\n\n\nint runTests() {\n int warning = 0;\n\n \/\/ Test pre-1: check if the user is allowed to dial-out\n if(access(\"\/etc\/kppp.allow\", R_OK) == 0 && getuid() != 0) {\n bool access = FALSE;\n FILE *f;\n if((f = fopen(\"\/etc\/kppp.allow\", \"r\")) != NULL) {\n char buf[2048]; \/\/ safe\n while(f != NULL && !feof(f)) {\n\tif(fgets(buf, sizeof(buf), f) != NULL) {\n\t QString s(buf);\n\n\t s = s.stripWhiteSpace();\n\t if(s[0] == '#' || s.length() == 0)\n\t continue;\n\n\t if((uid_t)uidFromName(QFile::encodeName(s)) == getuid()) {\n\t access = TRUE;\n\t fclose(f);\n\t f = NULL;\n\t }\n\t}\n }\n if(f)\n\tfclose(f);\n }\n\n if(!access) {\n KMessageBox::error(0,\n\t\t i18n(\"You're not allowed to dial out with \"\n\t\t \"kppp.\\nContact your system administrator.\"));\n return TEST_CRITICAL;\n }\n }\n\n \/\/ Test 1: search the pppd binary\n const char *f = pppdPath();\n\n if(!f) {\n KMessageBox::error(0,\n\t\t i18n(\"Cannot find the PPP daemon!\\n\\n\"\n \"Make sure that pppd is installed.\"));\n warning++;\n }\n\n \/\/ Test 2: check access to the pppd binary\n if(f) {\n#if 0\n if(access(f, X_OK) != 0 \/* && geteuid() != 0 *\/) {\n KMessageBox::error(0,\n\t\t i18n(\"You do not have the permission\\n\"\n\t\t\t\"to start pppd!\\n\\n\"\n\t\t\t\"Contact your system administrator\\n\"\n\t\t\t\"and ask to get access to pppd.\"));\n return TEST_CRITICAL;\n }\n#endif\n\n if(euid != 0) {\n struct stat st;\n stat(f, &st);\n if(st.st_uid != 0 || (st.st_mode & S_ISUID) == 0) {\n\tKMessageBox::error(0,\n i18n(\"You don't have sufficient permission to run\\n\"\n \"\\n%1\\n\\n\"\n \"Please make sure that kppp is owned by root\\n\"\n \"and has the SUID bit set.\\n\").arg(f));\n warning++;\n }\n }\n }\n\n \/\/ Test 5: check for existence of \/etc\/resolv.conf\n if (access(_PATH_RESCONF, R_OK) != 0) {\n QString file = _PATH_RESCONF\" \";\n QString msgstr = i18n(\"%1 is missing or can't be read!\\n\\n\"\n \"Ask your system administrator to create\\n\"\n \"this file (can be empty) with appropriate\\n\"\n \"read and write permissions.\").arg(file);\n KMessageBox::error(0, msgstr);\n warning ++;\n }\n\n if(warning == 0)\n return TEST_OK;\n else\n return TEST_WARNING;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\t\\file \ttest_main.cpp\n*\t\\brief\tTesting Kernels in MLearnKernels.h\n*\/\n\/\/ Test framework\n#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n#include <test_common.h>\n\n\/\/ MLearn\n#include <MLearn\/Core>\n#include <MLearn\/Sampling\/GaussianSampling.h>\n\n\/\/ Eigen \n#include <Eigen\/Core>\n#include <Eigen\/Cholesky>\n#include <Eigen\/LU>\n\n\/\/ Boost includes\n#include <boost\/random\/taus88.hpp>\n\nTEST_CASE(\"Test utility functions for multivariate gaussian sampling.\"){\t\n\ttypedef double FT;\n\tusing namespace MLearn;\n\tusing namespace Eigen;\n\tusing namespace Sampling::Gaussian;\n\tusing namespace SamplingImpl; \n\tuint dim = 3;\n\tuint N_samples = 10;\n\tMLMatrix<FT> A(dim, dim);\t\n\n\tA << 4, 1 ,-1,\n\t 1, 2 , 1,\n\t -1, 1 , 2;\n\n\tSECTION(\"Test transformation extraction\"){\n\t\t\/\/ Preallocation\n\t\tMLMatrix<FT> transform(dim, dim);\n\n\t\tSECTION(\"Test using pure cholesky!\"){\n\t\t\tLLT<MLMatrix<FT>> cholesky(A);\n\t\t\ttransform = MLMatrix<FT>::Random(dim, dim);\n\n\t\t\tREQUIRE_FALSE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t\ttransform_from_decomposition(transform, cholesky);\n\t\t\t\n\t\t\tREQUIRE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\n\t\tSECTION(\"Test using robust cholesky!\"){\n\t\t\tLDLT<MLMatrix<FT>> rob_cholesky(A);\n\t\t\ttransform = MLMatrix<FT>::Random(dim, dim);\n\t\t\t\n\t\t\tREQUIRE_FALSE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t\ttransform_from_decomposition(transform, rob_cholesky);\n\t\t\t\n\t\t\tREQUIRE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t}\n\n\t}\n\n\tSECTION(\"Test samples transformation\"){\n\t\tMLMatrix<FT> orig_samples = MLMatrix<FT>::Random(dim, N_samples);\n\t\tMLMatrix<FT> samples = orig_samples;\n\t\tMLVector<FT> mean = MLVector<FT>::Random(dim);\n\n\t\tMLMatrix<FT> transform(dim, dim);\n\t\ttransform_from_covariance<TransformMethod::CHOL>(transform, A);\n\n\t\tSECTION(\"Test transformation using transform\"){\n\t\t\ttransform_gaussian_samples_with_transform(mean, transform, samples);\n\n\t\t\tMLMatrix<FT> reverted_samples = samples;\n\t\t\treverted_samples.colwise() -= mean;\n\t\t\treverted_samples = transform.inverse()*reverted_samples;\n\n\t\t\tREQUIRE(\n\t\t\t\tTestUtils::diff_norm(orig_samples, reverted_samples) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\n\t\tSECTION(\"Test transformation using covariance\"){\n\t\t\ttransform_gaussian_samples_with_covariance<TransformMethod::CHOL>\n\t\t\t\t(mean, A, samples);\n\n\t\t\tMLMatrix<FT> reverted_samples = samples;\n\t\t\treverted_samples.colwise() -= mean;\n\t\t\treverted_samples = transform.inverse()*reverted_samples;\n\n\t\t\tREQUIRE(\n\t\t\t\tTestUtils::diff_norm(orig_samples, reverted_samples) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\t}\n\n\tSECTION(\"Test samples generation ...\"){\n\t\tuint N_samples = 34;\n\t\tuint dim = 5;\n\t\tSECTION(\"... with custom random number generator.\"){\n\t\t\tboost::random::taus88 rng(seed_from_time());\n\t\n\t\t\tMLMatrix<FT> samples = \n\t\t\t\tsample_standard_gaussian<FT>(dim, N_samples, rng);\n\t\n\t\t\tREQUIRE(samples.rows() == dim);\n\t\t\tREQUIRE(samples.cols() == N_samples);\n\t\t\tREQUIRE(samples.norm() > 0.0);\n\t\t}\n\t\n\t\tSECTION(\"... without random number generator.\"){\n\t\t\tMLMatrix<FT> samples = \n\t\t\t\tsample_standard_gaussian<FT>(dim, N_samples);\n\t\n\t\t\tREQUIRE(samples.rows() == dim);\n\t\t\tREQUIRE(samples.cols() == N_samples);\n\t\t\tREQUIRE(samples.norm() > 0.0);\n\t\t}\n\t}\n\n}\n\nTEST_CASE(\"Multivariate gaussian class test\"){\t\n\ttypedef double FT;\n\tusing namespace MLearn;\n\tusing namespace Eigen;\n\tusing namespace Sampling::Gaussian;\n\n\tuint N_samples = 17;\n\tuint dim = 3;\n\n\tMLVector<FT> mean = MLVector<FT>::Random(dim);\n\tMLMatrix<FT> covariance(dim, dim);\n\n\tcovariance << 4, 1 ,-1,\n\t 1, 2 , 1,\n\t -1, 1 , 2;\n\n\tSECTION(\"Test static sampling function\"){\n\t\tMLMatrix<FT> samples = MultivariateGaussian<FT>::sample(\n\t\t\tmean, covariance, N_samples);\n\n\t\tREQUIRE(samples.cols() == N_samples);\n\t\tREQUIRE(samples.rows() == dim);\n\t\tREQUIRE(samples.norm() > 0.0);\n\t}\n\n\tSECTION(\"Test sampling using instantiated class\"){\n\t\tMultivariateGaussian<FT> mg(mean, covariance);\n\t\tMLMatrix<FT> samples = mg.sample(N_samples);\n\n\t\tREQUIRE(samples.cols() == N_samples);\n\t\tREQUIRE(samples.rows() == dim);\n\t\tREQUIRE(samples.norm() > 0.0);\n\t}\n\n\tSECTION(\"Test class\"){\n\t\tMultivariateGaussian<FT> ref_mg(mean, covariance);\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, ref_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, ref_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\tMultivariateGaussian<FT> copy_mg(ref_mg);\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, copy_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, copy_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\n\t\tMultivariateGaussian<FT> \n\t\t\tmove_mg(std::move(MultivariateGaussian<FT>(ref_mg)));\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, move_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, move_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\tMultivariateGaussian<FT> copy_assign_mg;\n\t\tcopy_assign_mg = ref_mg;\n\t\tREQUIRE(TestUtils::diff_norm(mean, copy_assign_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, copy_assign_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\n\t\tMultivariateGaussian<FT> move_assign_mg;\n\t\tmove_assign_mg = std::move(MultivariateGaussian<FT>(ref_mg));\n\t\tREQUIRE(TestUtils::diff_norm(mean, move_assign_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, move_assign_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t}\n\n}<commit_msg>Removed useless tests<commit_after>\/**\t\\file \ttest_main.cpp\n*\t\\brief\tTesting Kernels in MLearnKernels.h\n*\/\n\/\/ Test framework\n#define CATCH_CONFIG_MAIN\n#include <catch.hpp>\n#include <test_common.h>\n\n\/\/ MLearn\n#include <MLearn\/Core>\n#include <MLearn\/Sampling\/GaussianSampling.h>\n\n\/\/ Eigen \n#include <Eigen\/Core>\n#include <Eigen\/Cholesky>\n#include <Eigen\/LU>\n\n\/\/ Boost includes\n#include <boost\/random\/taus88.hpp>\n\nTEST_CASE(\"Test utility functions for multivariate gaussian sampling.\"){\t\n\ttypedef double FT;\n\tusing namespace MLearn;\n\tusing namespace Eigen;\n\tusing namespace Sampling::Gaussian;\n\tusing namespace SamplingImpl; \n\tuint dim = 3;\n\tuint N_samples = 10;\n\tMLMatrix<FT> A(dim, dim);\t\n\n\tA << 4, 1 ,-1,\n\t 1, 2 , 1,\n\t -1, 1 , 2;\n\n\tSECTION(\"Test transformation extraction\"){\n\t\t\/\/ Preallocation\n\t\tMLMatrix<FT> transform(dim, dim);\n\n\t\tSECTION(\"Test using pure cholesky!\"){\n\t\t\tLLT<MLMatrix<FT>> cholesky(A);\n\t\t\ttransform = MLMatrix<FT>::Random(dim, dim);\n\n\t\t\tREQUIRE_FALSE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t\ttransform_from_decomposition(transform, cholesky);\n\t\t\t\n\t\t\tREQUIRE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\n\t\tSECTION(\"Test using robust cholesky!\"){\n\t\t\tLDLT<MLMatrix<FT>> rob_cholesky(A);\n\t\t\ttransform = MLMatrix<FT>::Random(dim, dim);\n\t\t\t\n\t\t\tREQUIRE_FALSE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t\ttransform_from_decomposition(transform, rob_cholesky);\n\t\t\t\n\t\t\tREQUIRE( \n\t\t\t\tTestUtils::diff_norm(transform*transform.transpose(), A) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\t}\n\n\t}\n\n\tSECTION(\"Test samples transformation\"){\n\t\tMLMatrix<FT> orig_samples = MLMatrix<FT>::Random(dim, N_samples);\n\t\tMLMatrix<FT> samples = orig_samples;\n\t\tMLVector<FT> mean = MLVector<FT>::Random(dim);\n\n\t\tMLMatrix<FT> transform(dim, dim);\n\t\ttransform_from_covariance<TransformMethod::CHOL>(transform, A);\n\n\t\tSECTION(\"Test transformation using transform\"){\n\t\t\ttransform_gaussian_samples_with_transform(mean, transform, samples);\n\n\t\t\tMLMatrix<FT> reverted_samples = samples;\n\t\t\treverted_samples.colwise() -= mean;\n\t\t\treverted_samples = transform.inverse()*reverted_samples;\n\n\t\t\tREQUIRE(\n\t\t\t\tTestUtils::diff_norm(orig_samples, reverted_samples) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\n\t\tSECTION(\"Test transformation using covariance\"){\n\t\t\ttransform_gaussian_samples_with_covariance<TransformMethod::CHOL>\n\t\t\t\t(mean, A, samples);\n\n\t\t\tMLMatrix<FT> reverted_samples = samples;\n\t\t\treverted_samples.colwise() -= mean;\n\t\t\treverted_samples = transform.inverse()*reverted_samples;\n\n\t\t\tREQUIRE(\n\t\t\t\tTestUtils::diff_norm(orig_samples, reverted_samples) ==\n\t\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\t}\n\t}\n\n\tSECTION(\"Test samples generation ...\"){\n\t\tuint N_samples = 34;\n\t\tuint dim = 5;\n\t\tSECTION(\"... with custom random number generator.\"){\n\t\t\tboost::random::taus88 rng(seed_from_time());\n\t\n\t\t\tMLMatrix<FT> samples = \n\t\t\t\tsample_standard_gaussian<FT>(dim, N_samples, rng);\n\t\n\t\t\tREQUIRE(samples.rows() == dim);\n\t\t\tREQUIRE(samples.cols() == N_samples);\n\t\t\tREQUIRE(samples.norm() > 0.0);\n\t\t}\n\t\n\t\tSECTION(\"... without random number generator.\"){\n\t\t\tMLMatrix<FT> samples = \n\t\t\t\tsample_standard_gaussian<FT>(dim, N_samples);\n\t\n\t\t\tREQUIRE(samples.rows() == dim);\n\t\t\tREQUIRE(samples.cols() == N_samples);\n\t\t\tREQUIRE(samples.norm() > 0.0);\n\t\t}\n\t}\n\n}\n\nTEST_CASE(\"Multivariate gaussian class test\"){\t\n\ttypedef double FT;\n\tusing namespace MLearn;\n\tusing namespace Eigen;\n\tusing namespace Sampling::Gaussian;\n\n\tuint N_samples = 17;\n\tuint dim = 3;\n\n\tMLVector<FT> mean = MLVector<FT>::Random(dim);\n\tMLMatrix<FT> covariance(dim, dim);\n\n\tcovariance << 4, 1 ,-1,\n\t 1, 2 , 1,\n\t -1, 1 , 2;\n\n\tSECTION(\"Test static sampling function\"){\n\t\tMLMatrix<FT> samples = MultivariateGaussian<FT>::sample(\n\t\t\tmean, covariance, N_samples);\n\n\t\tREQUIRE(samples.cols() == N_samples);\n\t\tREQUIRE(samples.rows() == dim);\n\t\tREQUIRE(samples.norm() > 0.0);\n\t}\n\n\tSECTION(\"Test sampling using instantiated class\"){\n\t\tMultivariateGaussian<FT> mg(mean, covariance);\n\t\tMLMatrix<FT> samples = mg.sample(N_samples);\n\n\t\tREQUIRE(samples.cols() == N_samples);\n\t\tREQUIRE(samples.rows() == dim);\n\t\tREQUIRE(samples.norm() > 0.0);\n\t}\n\n\tSECTION(\"Test class\"){\n\t\tMultivariateGaussian<FT> ref_mg(mean, covariance);\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, ref_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, ref_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\tMultivariateGaussian<FT> copy_mg(ref_mg);\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, copy_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, copy_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\n\t\tMultivariateGaussian<FT> \n\t\t\tmove_mg(std::move(MultivariateGaussian<FT>(ref_mg)));\n\n\t\tREQUIRE(TestUtils::diff_norm(mean, move_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, move_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\tMultivariateGaussian<FT> copy_assign_mg;\n\t\tcopy_assign_mg = ref_mg;\n\t\tREQUIRE(TestUtils::diff_norm(mean, copy_assign_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, copy_assign_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\n\t\tMultivariateGaussian<FT> move_assign_mg;\n\t\tmove_assign_mg = std::move(MultivariateGaussian<FT>(ref_mg));\n\t\tREQUIRE(TestUtils::diff_norm(mean, move_assign_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(covariance, move_assign_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\n\t\tMLVector<FT> new_mean = MLVector<FT>::Random(dim);\n\t\tMLMatrix<FT> new_covariance = 5.0*covariance;\n\n\t\tref_mg.set_mean(new_mean);\n\t\tREQUIRE(TestUtils::diff_norm(new_mean, ref_mg.mean()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tref_mg.set_covariance(new_covariance);\n\t\tREQUIRE(TestUtils::diff_norm(new_covariance, ref_mg.covariance()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t\tREQUIRE(TestUtils::diff_norm(new_covariance, \n\t\t\t\t\t\tref_mg.transform()*ref_mg.transform().transpose()) == \n\t\t\tApprox(0).margin(TEST_FLOAT_TOLERANCE));\n\t}\n\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * fontChar.cpp\n *\n * Created on: Jul 23, 2016\n * Author: Tomas Stibrany\n *\/\n#include \"fontChar.hpp\"\n\nusing namespace chip8::font;\n\nFontChar::FontChar(char charCode, u8 *rowData)\n{\n\tReSetFont(charCode, 5, rowData[0], rowData[1], rowData[2], rowData[3], rowData[4]);\n}\n\nFontChar::FontChar()\n{\n\tReSetFont(0, 0, 0);\n}\n\nFontChar::~FontChar()\n{\n\n}\n\nvoid FontChar::SetCharCode(char charCode)\n{\n\tthis->charCode = charCode;\n}\n\nvoid FontChar::SetRowData(u8 *rowData, u8 rowCount)\n{\n\tthis->rowData = rowData;\n\tthis->rowCount = rowCount;\n}\n\nvoid FontChar::ReSetFont(char charCode, u8 rowCount, u8 data...)\n{\n\tva_list args;\n\tva_start(args, data);\n\n\tthis->charCode = charCode;\n\tthis->rowData = new u8[rowCount];\n\tthis->rowCount = rowCount;\n\tfor (u8 i = 0; i < rowCount; i++)\n\t{\n\t\tthis->rowData[i] = va_arg(args, u8);\n\t}\n\tva_end(args);\n}\n\nu8 FontChar::GetCharCode()\n{\n\treturn this->charCode;\n}\n\nu8 FontChar::GetRowCount()\n{\n\treturn this->rowCount;\n}\n\nu8 FontChar::GetRow(u8 rowIndex)\n{\n\tif (this->rowData != 0)\n\t\treturn this->rowData[rowIndex % this->rowCount];\n\telse\n\t\treturn 0;\n}\n\n\n\n<commit_msg>[CHG] Fixed Font loading<commit_after>\/*\n * fontChar.cpp\n *\n * Created on: Jul 23, 2016\n * Author: Tomas Stibrany\n *\/\n#include \"fontChar.hpp\"\n\nusing namespace chip8::font;\n\nFontChar::FontChar(char charCode, u8 *rowData)\n{\n\tReSetFont(charCode, 5, rowData[0], rowData[1], rowData[2], rowData[3], rowData[4]);\n}\n\nFontChar::FontChar()\n{\n\tReSetFont(0, 0, 0);\n}\n\nFontChar::~FontChar()\n{\n\n}\n\nvoid FontChar::SetCharCode(char charCode)\n{\n\tthis->charCode = charCode;\n}\n\nvoid FontChar::SetRowData(u8 *rowData, u8 rowCount)\n{\n\tthis->rowData = rowData;\n\tthis->rowCount = rowCount;\n}\n\nvoid FontChar::ReSetFont(char charCode, u8 rowCount, u8 data...)\n{\n\tva_list args;\n\tva_start(args, rowCount);\n\n\tthis->charCode = charCode;\n\tthis->rowData = new u8[rowCount];\n\tthis->rowCount = rowCount;\n\tfor (u8 i = 0; i < rowCount; i++)\n\t{\n\t\tthis->rowData[i] = va_arg(args, u8);\n\t}\n\tva_end(args);\n}\n\nu8 FontChar::GetCharCode()\n{\n\treturn this->charCode;\n}\n\nu8 FontChar::GetRowCount()\n{\n\treturn this->rowCount;\n}\n\nu8 FontChar::GetRow(u8 rowIndex)\n{\n\tif (this->rowData != 0)\n\t\treturn this->rowData[rowIndex % this->rowCount];\n\telse\n\t\treturn 0;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"types.h\"\n#include \"kernel.hh\"\n#include \"buf.hh\"\n#include \"weakcache.hh\"\n\nstatic weakcache<buf::key_t, buf, &buf::keyhash, 257> bufcache;\n\nsref<buf>\nbuf::get(u32 dev, u64 sector)\n{\n buf::key_t k = { dev, sector };\n for (;;) {\n sref<buf> b = bufcache.lookup(k);\n if (b.get() != nullptr) {\n \/\/ Wait for buffer to load, by getting a read seqlock,\n \/\/ which waits for the write seqlock bit to be cleared.\n b->seq_.read_begin();\n return b;\n }\n\n sref<buf> nb = sref<buf>::newref(new buf(dev, sector));\n auto locked = nb->write();\n if (bufcache.insert(k, nb.get())) {\n ideread(dev, sector, locked->data);\n return nb;\n }\n\n nb->dec();\n }\n}\n\nvoid\nbuf::writeback()\n{\n lock_guard<sleeplock> l(&writeback_lock_);\n mark_clean();\n auto copy = read();\n\n \/\/ write copy[] to disk; don't need to wait for write to finish,\n \/\/ as long as write order to disk has been established.\n idewrite(dev_, sector_, copy->data);\n}\n\nvoid\nbuf::onzero()\n{\n bufcache.cleanup(weakref_);\n delete this;\n}\n<commit_msg>use sref::transfer instead of sref::newref<commit_after>#include \"types.h\"\n#include \"kernel.hh\"\n#include \"buf.hh\"\n#include \"weakcache.hh\"\n\nstatic weakcache<buf::key_t, buf, &buf::keyhash, 257> bufcache;\n\nsref<buf>\nbuf::get(u32 dev, u64 sector)\n{\n buf::key_t k = { dev, sector };\n for (;;) {\n sref<buf> b = bufcache.lookup(k);\n if (b.get() != nullptr) {\n \/\/ Wait for buffer to load, by getting a read seqlock,\n \/\/ which waits for the write seqlock bit to be cleared.\n b->seq_.read_begin();\n return b;\n }\n\n sref<buf> nb = sref<buf>::transfer(new buf(dev, sector));\n auto locked = nb->write();\n if (bufcache.insert(k, nb.get())) {\n nb->inc(); \/\/ keep it in the cache\n ideread(dev, sector, locked->data);\n return nb;\n }\n }\n}\n\nvoid\nbuf::writeback()\n{\n lock_guard<sleeplock> l(&writeback_lock_);\n mark_clean();\n auto copy = read();\n\n \/\/ write copy[] to disk; don't need to wait for write to finish,\n \/\/ as long as write order to disk has been established.\n idewrite(dev_, sector_, copy->data);\n}\n\nvoid\nbuf::onzero()\n{\n bufcache.cleanup(weakref_);\n delete this;\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n ** Filename: featdefs.cpp\n ** Purpose: Definitions of currently defined feature types.\n ** Author: Dan Johnson\n **\n ** (c) Copyright Hewlett-Packard Company, 1988.\n ** Licensed under the Apache License, Version 2.0 (the \"License\");\n ** you may not use this file except in compliance with the License.\n ** You may obtain a copy of the License at\n ** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n ** Unless required by applicable law or agreed to in writing, software\n ** distributed under the License is distributed on an \"AS IS\" BASIS,\n ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n ** See the License for the specific language governing permissions and\n ** limitations under the License.\n ******************************************************************************\/\n\/*-----------------------------------------------------------------------------\n Include Files and Type Defines\n-----------------------------------------------------------------------------*\/\n#include \"featdefs.h\"\n#include \"emalloc.h\"\n#include \"scanutils.h\"\n\n#include <cstring>\n#include <cstdio>\n\n#define PICO_FEATURE_LENGTH 0.05\n\n\/*-----------------------------------------------------------------------------\n Global Data Definitions and Declarations\n-----------------------------------------------------------------------------*\/\nconstexpr const char* kMicroFeatureType = \"mf\";\nconstexpr const char* kCNFeatureType = \"cn\";\nconstexpr const char* kIntFeatureType = \"if\";\nconstexpr const char* kGeoFeatureType = \"tb\";\n\n\/\/ Define all of the parameters for the MicroFeature type.\nStartParamDesc(MicroFeatureParams)\nDefineParam(0, 0, -0.5, 0.5)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 1, 0.0, 1.0)\nDefineParam(1, 0, 0.0, 1.0)\nDefineParam (0, 1, -0.5, 0.5)\nDefineParam (0, 1, -0.5, 0.5)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(MicroFeatureDesc, 5, 1, kMicroFeatureType, MicroFeatureParams)\n\n\/\/ Define all of the parameters for the NormFeat type.\nStartParamDesc (CharNormParams)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 1, 0.0, 1.0)\nDefineParam(0, 0, 0.0, 1.0)\nDefineParam(0, 0, 0.0, 1.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(CharNormDesc, 4, 0, kCNFeatureType, CharNormParams)\n\n\/\/ Define all of the parameters for the IntFeature type\nStartParamDesc(IntFeatParams)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(1, 0, 0.0, 255.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(IntFeatDesc, 2, 1, kIntFeatureType, IntFeatParams)\n\n\/\/ Define all of the parameters for the GeoFeature type\nStartParamDesc(GeoFeatParams)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(GeoFeatDesc, 3, 0, kGeoFeatureType, GeoFeatParams)\n\n\/\/ Other features used for training the adaptive classifier, but not used\n\/\/ during normal training, therefore not in the DescDefs array.\n\n\/\/ Define all of the parameters for the PicoFeature type\n\/\/ define knob that can be used to adjust pico-feature length.\nfloat PicoFeatureLength = PICO_FEATURE_LENGTH;\nStartParamDesc(PicoFeatParams)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(1, 0, 0.0, 1.0)\nDefineParam(0, 0, -0.5, 0.5)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(PicoFeatDesc, 2, 1, \"pf\", PicoFeatParams)\n\n\/\/ Define all of the parameters for the OutlineFeature type.\nStartParamDesc(OutlineFeatParams)\nDefineParam(0, 0, -0.5, 0.5)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 0, 0.0, 1.0)\nDefineParam(1, 0, 0.0, 1.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(OutlineFeatDesc, 3, 1, \"of\", OutlineFeatParams)\n\n\/\/ MUST be kept in-sync with ExtractorDefs in fxdefs.cpp.\nstatic const FEATURE_DESC_STRUCT *DescDefs[NUM_FEATURE_TYPES] = {\n &MicroFeatureDesc,\n &CharNormDesc,\n &IntFeatDesc,\n &GeoFeatDesc\n};\n\n\/*-----------------------------------------------------------------------------\n Public Code\n-----------------------------------------------------------------------------*\/\nvoid InitFeatureDefs(FEATURE_DEFS_STRUCT *featuredefs) {\n featuredefs->NumFeatureTypes = NUM_FEATURE_TYPES;\n for (int i = 0; i < NUM_FEATURE_TYPES; ++i) {\n featuredefs->FeatureDesc[i] = DescDefs[i];\n }\n}\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Release the memory consumed by the specified character\n * description and all of the features in that description.\n *\n * @param CharDesc character description to be deallocated\n *\n * Globals:\n * - none\n *\/\nvoid FreeCharDescription(CHAR_DESC CharDesc) {\n if (CharDesc) {\n for (size_t i = 0; i < CharDesc->NumFeatureSets; i++)\n FreeFeatureSet (CharDesc->FeatureSets[i]);\n Efree(CharDesc);\n }\n} \/* FreeCharDescription *\/\n\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Allocate a new character description, initialize its\n * feature sets to be empty, and return it.\n *\n * Globals:\n * - none\n *\n * @return New character description structure.\n *\/\nCHAR_DESC NewCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs) {\n CHAR_DESC CharDesc;\n CharDesc = static_cast<CHAR_DESC>(Emalloc (sizeof (CHAR_DESC_STRUCT)));\n CharDesc->NumFeatureSets = FeatureDefs.NumFeatureTypes;\n\n for (size_t i = 0; i < CharDesc->NumFeatureSets; i++)\n CharDesc->FeatureSets[i] = nullptr;\n\n return (CharDesc);\n} \/* NewCharDescription *\/\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Appends a textual representation of CharDesc to str.\n * The format used is to write out the number of feature\n * sets which will be written followed by a representation of\n * each feature set.\n *\n * Each set starts with the short name for that feature followed\n * by a description of the feature set. Feature sets which are\n * not present are not written.\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param str string to append CharDesc to\n * @param CharDesc character description to write to File\n *\/\nvoid WriteCharDescription(const FEATURE_DEFS_STRUCT& FeatureDefs,\n CHAR_DESC CharDesc, STRING* str) {\n int NumSetsToWrite = 0;\n\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++)\n if (CharDesc->FeatureSets[Type])\n NumSetsToWrite++;\n\n str->add_str_int(\" \", NumSetsToWrite);\n *str += \"\\n\";\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++) {\n if (CharDesc->FeatureSets[Type]) {\n *str += FeatureDefs.FeatureDesc[Type]->ShortName;\n *str += \" \";\n WriteFeatureSet(CharDesc->FeatureSets[Type], str);\n }\n }\n} \/* WriteCharDescription *\/\n\n\/\/ Return whether all of the fields of the given feature set\n\/\/ are well defined (not inf or nan).\nbool ValidCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs,\n CHAR_DESC CharDesc) {\n bool anything_written = false;\n bool well_formed = true;\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++) {\n if (CharDesc->FeatureSets[Type]) {\n for (int i = 0; i < CharDesc->FeatureSets[Type]->NumFeatures; i++) {\n FEATURE feat = CharDesc->FeatureSets[Type]->Features[i];\n for (int p = 0; p < feat->Type->NumParams; p++) {\n if (std::isnan(feat->Params[p]) || std::isinf(feat->Params[p]))\n well_formed = false;\n else\n anything_written = true;\n }\n }\n } else {\n return false;\n }\n }\n return anything_written && well_formed;\n} \/* ValidCharDescription *\/\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Read a character description from File, and return\n * a data structure containing this information. The data\n * is formatted as follows:\n * @verbatim\n NumberOfSets\n ShortNameForSet1 Set1\n ShortNameForSet2 Set2\n ...\n @endverbatim\n *\n * Globals:\n * - none\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param File open text file to read character description from\n * @return Character description read from File.\n *\/\nCHAR_DESC ReadCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs,\n FILE *File) {\n int NumSetsToRead;\n char ShortName[FEAT_NAME_SIZE];\n CHAR_DESC CharDesc;\n int Type;\n\n ASSERT_HOST(tfscanf(File, \"%d\", &NumSetsToRead) == 1);\n ASSERT_HOST(NumSetsToRead >= 0);\n ASSERT_HOST(NumSetsToRead <= FeatureDefs.NumFeatureTypes);\n\n CharDesc = NewCharDescription(FeatureDefs);\n for (; NumSetsToRead > 0; NumSetsToRead--) {\n tfscanf(File, \"%s\", ShortName);\n Type = ShortNameToFeatureType(FeatureDefs, ShortName);\n CharDesc->FeatureSets[Type] =\n ReadFeatureSet (File, FeatureDefs.FeatureDesc[Type]);\n }\n return CharDesc;\n}\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Search through all features currently defined and return\n * the feature type for the feature with the specified short\n * name. Trap an error if the specified name is not found.\n *\n * Globals:\n * - none\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param ShortName short name of a feature type\n * @return Feature type which corresponds to ShortName.\n *\/\nuint32_t ShortNameToFeatureType(const FEATURE_DEFS_STRUCT &FeatureDefs,\n const char *ShortName) {\n for (int i = 0; i < FeatureDefs.NumFeatureTypes; i++)\n if (!strcmp ((FeatureDefs.FeatureDesc[i]->ShortName), ShortName))\n return static_cast<uint32_t>(i);\n ASSERT_HOST(!\"Illegal short name for a feature\");\n return 0;\n}\n<commit_msg>featdefs: Add missing include statement<commit_after>\/******************************************************************************\n ** Filename: featdefs.cpp\n ** Purpose: Definitions of currently defined feature types.\n ** Author: Dan Johnson\n **\n ** (c) Copyright Hewlett-Packard Company, 1988.\n ** Licensed under the Apache License, Version 2.0 (the \"License\");\n ** you may not use this file except in compliance with the License.\n ** You may obtain a copy of the License at\n ** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n ** Unless required by applicable law or agreed to in writing, software\n ** distributed under the License is distributed on an \"AS IS\" BASIS,\n ** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n ** See the License for the specific language governing permissions and\n ** limitations under the License.\n ******************************************************************************\/\n\/*-----------------------------------------------------------------------------\n Include Files and Type Defines\n-----------------------------------------------------------------------------*\/\n#include \"featdefs.h\"\n#include <cstring>\n#include <cstdio>\n#include \"emalloc.h\"\n#include \"picofeat.h\" \/\/ for PicoFeatureLength\n#include \"scanutils.h\"\n\n#define PICO_FEATURE_LENGTH 0.05\n\n\/*-----------------------------------------------------------------------------\n Global Data Definitions and Declarations\n-----------------------------------------------------------------------------*\/\nconstexpr const char* kMicroFeatureType = \"mf\";\nconstexpr const char* kCNFeatureType = \"cn\";\nconstexpr const char* kIntFeatureType = \"if\";\nconstexpr const char* kGeoFeatureType = \"tb\";\n\n\/\/ Define all of the parameters for the MicroFeature type.\nStartParamDesc(MicroFeatureParams)\nDefineParam(0, 0, -0.5, 0.5)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 1, 0.0, 1.0)\nDefineParam(1, 0, 0.0, 1.0)\nDefineParam (0, 1, -0.5, 0.5)\nDefineParam (0, 1, -0.5, 0.5)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(MicroFeatureDesc, 5, 1, kMicroFeatureType, MicroFeatureParams)\n\n\/\/ Define all of the parameters for the NormFeat type.\nStartParamDesc (CharNormParams)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 1, 0.0, 1.0)\nDefineParam(0, 0, 0.0, 1.0)\nDefineParam(0, 0, 0.0, 1.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(CharNormDesc, 4, 0, kCNFeatureType, CharNormParams)\n\n\/\/ Define all of the parameters for the IntFeature type\nStartParamDesc(IntFeatParams)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(1, 0, 0.0, 255.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(IntFeatDesc, 2, 1, kIntFeatureType, IntFeatParams)\n\n\/\/ Define all of the parameters for the GeoFeature type\nStartParamDesc(GeoFeatParams)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nDefineParam(0, 0, 0.0, 255.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(GeoFeatDesc, 3, 0, kGeoFeatureType, GeoFeatParams)\n\n\/\/ Other features used for training the adaptive classifier, but not used\n\/\/ during normal training, therefore not in the DescDefs array.\n\n\/\/ Define all of the parameters for the PicoFeature type\n\/\/ define knob that can be used to adjust pico-feature length.\nfloat PicoFeatureLength = PICO_FEATURE_LENGTH;\nStartParamDesc(PicoFeatParams)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(1, 0, 0.0, 1.0)\nDefineParam(0, 0, -0.5, 0.5)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(PicoFeatDesc, 2, 1, \"pf\", PicoFeatParams)\n\n\/\/ Define all of the parameters for the OutlineFeature type.\nStartParamDesc(OutlineFeatParams)\nDefineParam(0, 0, -0.5, 0.5)\nDefineParam(0, 0, -0.25, 0.75)\nDefineParam(0, 0, 0.0, 1.0)\nDefineParam(1, 0, 0.0, 1.0)\nEndParamDesc\n\/\/ Now define the feature type itself (see features.h for parameters).\nDefineFeature(OutlineFeatDesc, 3, 1, \"of\", OutlineFeatParams)\n\n\/\/ MUST be kept in-sync with ExtractorDefs in fxdefs.cpp.\nstatic const FEATURE_DESC_STRUCT *DescDefs[NUM_FEATURE_TYPES] = {\n &MicroFeatureDesc,\n &CharNormDesc,\n &IntFeatDesc,\n &GeoFeatDesc\n};\n\n\/*-----------------------------------------------------------------------------\n Public Code\n-----------------------------------------------------------------------------*\/\nvoid InitFeatureDefs(FEATURE_DEFS_STRUCT *featuredefs) {\n featuredefs->NumFeatureTypes = NUM_FEATURE_TYPES;\n for (int i = 0; i < NUM_FEATURE_TYPES; ++i) {\n featuredefs->FeatureDesc[i] = DescDefs[i];\n }\n}\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Release the memory consumed by the specified character\n * description and all of the features in that description.\n *\n * @param CharDesc character description to be deallocated\n *\n * Globals:\n * - none\n *\/\nvoid FreeCharDescription(CHAR_DESC CharDesc) {\n if (CharDesc) {\n for (size_t i = 0; i < CharDesc->NumFeatureSets; i++)\n FreeFeatureSet (CharDesc->FeatureSets[i]);\n Efree(CharDesc);\n }\n} \/* FreeCharDescription *\/\n\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Allocate a new character description, initialize its\n * feature sets to be empty, and return it.\n *\n * Globals:\n * - none\n *\n * @return New character description structure.\n *\/\nCHAR_DESC NewCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs) {\n CHAR_DESC CharDesc;\n CharDesc = static_cast<CHAR_DESC>(Emalloc (sizeof (CHAR_DESC_STRUCT)));\n CharDesc->NumFeatureSets = FeatureDefs.NumFeatureTypes;\n\n for (size_t i = 0; i < CharDesc->NumFeatureSets; i++)\n CharDesc->FeatureSets[i] = nullptr;\n\n return (CharDesc);\n} \/* NewCharDescription *\/\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Appends a textual representation of CharDesc to str.\n * The format used is to write out the number of feature\n * sets which will be written followed by a representation of\n * each feature set.\n *\n * Each set starts with the short name for that feature followed\n * by a description of the feature set. Feature sets which are\n * not present are not written.\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param str string to append CharDesc to\n * @param CharDesc character description to write to File\n *\/\nvoid WriteCharDescription(const FEATURE_DEFS_STRUCT& FeatureDefs,\n CHAR_DESC CharDesc, STRING* str) {\n int NumSetsToWrite = 0;\n\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++)\n if (CharDesc->FeatureSets[Type])\n NumSetsToWrite++;\n\n str->add_str_int(\" \", NumSetsToWrite);\n *str += \"\\n\";\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++) {\n if (CharDesc->FeatureSets[Type]) {\n *str += FeatureDefs.FeatureDesc[Type]->ShortName;\n *str += \" \";\n WriteFeatureSet(CharDesc->FeatureSets[Type], str);\n }\n }\n} \/* WriteCharDescription *\/\n\n\/\/ Return whether all of the fields of the given feature set\n\/\/ are well defined (not inf or nan).\nbool ValidCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs,\n CHAR_DESC CharDesc) {\n bool anything_written = false;\n bool well_formed = true;\n for (size_t Type = 0; Type < CharDesc->NumFeatureSets; Type++) {\n if (CharDesc->FeatureSets[Type]) {\n for (int i = 0; i < CharDesc->FeatureSets[Type]->NumFeatures; i++) {\n FEATURE feat = CharDesc->FeatureSets[Type]->Features[i];\n for (int p = 0; p < feat->Type->NumParams; p++) {\n if (std::isnan(feat->Params[p]) || std::isinf(feat->Params[p]))\n well_formed = false;\n else\n anything_written = true;\n }\n }\n } else {\n return false;\n }\n }\n return anything_written && well_formed;\n} \/* ValidCharDescription *\/\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Read a character description from File, and return\n * a data structure containing this information. The data\n * is formatted as follows:\n * @verbatim\n NumberOfSets\n ShortNameForSet1 Set1\n ShortNameForSet2 Set2\n ...\n @endverbatim\n *\n * Globals:\n * - none\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param File open text file to read character description from\n * @return Character description read from File.\n *\/\nCHAR_DESC ReadCharDescription(const FEATURE_DEFS_STRUCT &FeatureDefs,\n FILE *File) {\n int NumSetsToRead;\n char ShortName[FEAT_NAME_SIZE];\n CHAR_DESC CharDesc;\n int Type;\n\n ASSERT_HOST(tfscanf(File, \"%d\", &NumSetsToRead) == 1);\n ASSERT_HOST(NumSetsToRead >= 0);\n ASSERT_HOST(NumSetsToRead <= FeatureDefs.NumFeatureTypes);\n\n CharDesc = NewCharDescription(FeatureDefs);\n for (; NumSetsToRead > 0; NumSetsToRead--) {\n tfscanf(File, \"%s\", ShortName);\n Type = ShortNameToFeatureType(FeatureDefs, ShortName);\n CharDesc->FeatureSets[Type] =\n ReadFeatureSet (File, FeatureDefs.FeatureDesc[Type]);\n }\n return CharDesc;\n}\n\n\/*---------------------------------------------------------------------------*\/\n\/**\n * Search through all features currently defined and return\n * the feature type for the feature with the specified short\n * name. Trap an error if the specified name is not found.\n *\n * Globals:\n * - none\n *\n * @param FeatureDefs definitions of feature types\/extractors\n * @param ShortName short name of a feature type\n * @return Feature type which corresponds to ShortName.\n *\/\nuint32_t ShortNameToFeatureType(const FEATURE_DEFS_STRUCT &FeatureDefs,\n const char *ShortName) {\n for (int i = 0; i < FeatureDefs.NumFeatureTypes; i++)\n if (!strcmp ((FeatureDefs.FeatureDesc[i]->ShortName), ShortName))\n return static_cast<uint32_t>(i);\n ASSERT_HOST(!\"Illegal short name for a feature\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"eventblock.h\"\n#include \"scene\/ingamescene.h\"\n#include <ctime>\n#include <iostream>\n#include <cstdlib>\n#include \"scene\/ingamescene.h\"\n#include \"localgame.h\"\n#include \"sellpopup.h\"\n\nusing namespace std;\n\n\/\/ Constructor & Destructor\nEventBlock::EventBlock(QGameItem * parent,QGraphicsScene * scene, MainWindow * window) : Block(parent)\n{\n}\n\n\nEventBlock::~EventBlock()\n{\n\n}\n\n\n\/\/ Methods\nvoid EventBlock::enter(Player* player)\n{\n checkEvent(player,this->scene(),this->getWindow());\n LocalGame::getInst()->turnOver();\n return;\n \/\/checkEvent(player);\n}\n\n\nvoid EventBlock::checkEvent(Player* player,QGraphicsScene * scene, MainWindow * window)\n{\n \/\/ generate random event\n int value = 6;\n\n switch(value) {\n case 0:\n drink(player);\n break;\n case 1:\n cc(player);\n break;\n case 2:\n takeSubject(player);\n break;\n case 3:\n loseSubject(player);\n break;\n case 4:\n lol(player);\n break;\n case 5:\n eatChicken(player);\n break;\n case 6:\n qDebug() << \"photogenic\";\n photoGenic(scene, window);\n break;\n }\n}\n\nvoid EventBlock::drink(Player* player)\n{\n qDebug() << \"Drink event!\";\n \/\/ 원하는 불금칸을 이동\n}\n\nvoid EventBlock::cc(Player* player)\n{\n qDebug() << \"CC event!\";\n \/\/ 행동력 감소 + 일정 확률로 휴학 또는 61콜 이동\n if(getType() != CharacterType::OUTSIDER)\n {\n \/\/ jump to gapyear\n if((rand() % 2) == 0)\n player->jumpTo(8);\n\n \/\/ jump to 61call\n else\n player->jumpTo(26);\n }\n}\n\nvoid EventBlock::takeSubject(Player* player)\n{\n qDebug() << \"Take Subject\";\n \/\/ 플레이어가 과목을 하나 선택한 후 buyBlock을 실행한다\n \/\/player->addBlock();\n}\n\nvoid EventBlock::loseSubject(Player* player)\n{\n qDebug() << \"Lose Subject\";\n \/\/ 플레이어가 과목 하나를 잃는다. (랜덤 or 선택)\n \/\/player->sellBlock();\n}\n\nvoid EventBlock::lol(Player* player)\n{\n qDebug() << \"LOL event!\";\n\n \/\/ 50:50으로 행동력 증가 또는 감소, lol타입 캐릭터의 경우 항상 증가\n if(getType() == CharacterType::LOL)\n player->setEnergy(player->getEnergy() + 50); \/\/\n else\n {\n if((rand() % 2) == 0)\n player->setEnergy(player->getEnergy() + 50); \/\/승리\n else\n player->setEnergy(player->getEnergy() - 100); \/\/ 패배\n }\n}\n\nvoid EventBlock::eatChicken(Player* player)\n{\n \/\/ 치느님을 영접하여 행동력 증가\n player->setEnergy(player->getEnergy() + 100);\n}\n\nvoid EventBlock::photoGenic(QGraphicsScene * scene, MainWindow * window)\n{\n\n \/\/팀원 사진 띄우기\n PhotoGenicItem* photogenicitem = new PhotoGenicItem(scene, window);\n photogenicitem->showPhotos();\n}\n<commit_msg>just enter key added<commit_after>#include \"eventblock.h\"\n#include \"scene\/ingamescene.h\"\n#include <ctime>\n#include <iostream>\n#include <cstdlib>\n#include \"scene\/ingamescene.h\"\n#include \"localgame.h\"\n#include \"sellpopup.h\"\n\nusing namespace std;\n\n\/\/ Constructor & Destructor\nEventBlock::EventBlock(QGameItem * parent,QGraphicsScene * scene, MainWindow * window) : Block(parent)\n{\n}\n\n\nEventBlock::~EventBlock()\n{\n\n}\n\n\n\/\/ Methods\nvoid EventBlock::enter(Player* player)\n{\n checkEvent(player,this->scene(),this->getWindow());\n LocalGame::getInst()->turnOver();\n return;\n \/\/checkEvent(player);\n}\n\n\nvoid EventBlock::checkEvent(Player* player,QGraphicsScene * scene, MainWindow * window)\n{\n \/\/ generate random event\n int value = 6;\n\n switch(value) {\n case 0:\n drink(player);\n break;\n case 1:\n cc(player);\n break;\n case 2:\n takeSubject(player);\n break;\n case 3:\n loseSubject(player);\n break;\n case 4:\n lol(player);\n break;\n case 5:\n eatChicken(player);\n break;\n case 6:\n qDebug() << \"photogenic\";\n photoGenic(scene, window);\n break;\n }\n}\n\nvoid EventBlock::drink(Player* player)\n{\n qDebug() << \"Drink event!\";\n \/\/ 원하는 불금칸을 이동\n}\n\nvoid EventBlock::cc(Player* player)\n{\n qDebug() << \"CC event!\";\n\n \/\/ 행동력 감소 + 일정 확률로 휴학 또는 61콜 이동\n if(getType() != CharacterType::OUTSIDER)\n {\n \/\/ jump to gapyear\n if((rand() % 2) == 0)\n player->jumpTo(8);\n\n \/\/ jump to 61call\n else\n player->jumpTo(26);\n }\n}\n\nvoid EventBlock::takeSubject(Player* player)\n{\n qDebug() << \"Take Subject\";\n \/\/ 플레이어가 과목을 하나 선택한 후 buyBlock을 실행한다\n \/\/player->addBlock();\n}\n\nvoid EventBlock::loseSubject(Player* player)\n{\n qDebug() << \"Lose Subject\";\n \/\/ 플레이어가 과목 하나를 잃는다. (랜덤 or 선택)\n \/\/player->sellBlock();\n}\n\nvoid EventBlock::lol(Player* player)\n{\n qDebug() << \"LOL event!\";\n\n \/\/ 50:50으로 행동력 증가 또는 감소, lol타입 캐릭터의 경우 항상 증가\n if(getType() == CharacterType::LOL)\n player->setEnergy(player->getEnergy() + 50); \/\/\n else\n {\n if((rand() % 2) == 0)\n player->setEnergy(player->getEnergy() + 50); \/\/승리\n else\n player->setEnergy(player->getEnergy() - 100); \/\/ 패배\n }\n}\n\nvoid EventBlock::eatChicken(Player* player)\n{\n \/\/ 치느님을 영접하여 행동력 증가\n player->setEnergy(player->getEnergy() + 100);\n}\n\nvoid EventBlock::photoGenic(QGraphicsScene * scene, MainWindow * window)\n{\n\n \/\/팀원 사진 띄우기\n PhotoGenicItem* photogenicitem = new PhotoGenicItem(scene, window);\n photogenicitem->showPhotos();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file FsIoTest.cpp\n * @brief FsIo class tester.\n * @author zer0\n * @date 2017-03-19\n *\/\n\n#include <gtest\/gtest.h>\n#include <tester\/DemoAsset.hpp>\n#include <libtbag\/filesystem\/details\/FsIo.hpp>\n\nusing namespace libtbag;\nusing namespace libtbag::filesystem;\nusing namespace libtbag::filesystem::details;\n\nTEST(FsIoTest, Default)\n{\n TBAG_CREATE_TESTER_TEMP_DIR;\n\n auto TEST_FILE = TBAG_GET_TESTER_TEMP_DIR \/ std::string(\"test.txt\");\n namespace fs = ::libtbag::filesystem::details;\n\n \/\/ Create test file.\n ufile f = fs::open(TEST_FILE);\n ASSERT_LT(0, f);\n ASSERT_TRUE(TEST_FILE.exists());\n\n { \/\/ 1st test.\n std::string BUFFER_TEST1 = \"11111\";\n std::string BUFFER_TEST2 = \"2222222222\";\n\n fs::binf wbinf[2];\n wbinf[0].buffer = &BUFFER_TEST1[0];\n wbinf[0].size = BUFFER_TEST1.size();\n wbinf[1].buffer = &BUFFER_TEST2[0];\n wbinf[1].size = BUFFER_TEST2.size();\n\n int wsize = fs::write(f, wbinf, 2, 0);\n ASSERT_EQ(BUFFER_TEST1.size() + BUFFER_TEST2.size(), wsize);\n\n std::string rbuf1(BUFFER_TEST1.size(), '\\0');\n std::string rbuf2(BUFFER_TEST2.size(), '\\0');\n\n fs::binf rbinf[2];\n rbinf[0].buffer = &rbuf1[0];\n rbinf[0].size = rbuf1.size();\n rbinf[1].buffer = &rbuf2[0];\n rbinf[1].size = rbuf2.size();\n\n int rsize = fs::read(f, rbinf, 2, 0);\n ASSERT_EQ(BUFFER_TEST1.size() + BUFFER_TEST2.size(), rsize);\n ASSERT_EQ(BUFFER_TEST1, rbuf1);\n ASSERT_EQ(BUFFER_TEST2, rbuf2);\n }\n\n { \/\/ 2nd test.\n std::string BUFFER = \"FsIoTest\/Default\";\n\n \/\/ Write file.\n int wsize = fs::write2(f, BUFFER.c_str(), BUFFER.size(), 0);\n ASSERT_EQ(BUFFER.size(), wsize);\n\n \/\/ Read file.\n std::string rbuf(BUFFER.size(), '\\0');\n int rsize = fs::read2(f, &rbuf[0], rbuf.size(), 0);\n ASSERT_EQ(BUFFER.size(), rsize);\n ASSERT_EQ(BUFFER, rbuf);\n }\n\n \/\/ Close file.\n ASSERT_TRUE(fs::close(f));\n}\n\n<commit_msg>Split FsIo tester.<commit_after>\/**\n * @file FsIoTest.cpp\n * @brief FsIo class tester.\n * @author zer0\n * @date 2017-03-19\n *\/\n\n#include <gtest\/gtest.h>\n#include <tester\/DemoAsset.hpp>\n#include <libtbag\/filesystem\/details\/FsIo.hpp>\n\nusing namespace libtbag;\nusing namespace libtbag::filesystem;\nusing namespace libtbag::filesystem::details;\n\nTEST(FsIoTest, rw1)\n{\n TBAG_CREATE_TESTER_TEMP_DIR;\n\n auto TEST_FILE = TBAG_GET_TESTER_TEMP_DIR \/ \"test.txt\";\n namespace fs = ::libtbag::filesystem::details;\n\n \/\/ Create test file.\n ufile f = fs::open(TEST_FILE);\n ASSERT_LT(0, f);\n ASSERT_TRUE(TEST_FILE.exists());\n\n std::string BUFFER_TEST1 = \"11111\";\n std::string BUFFER_TEST2 = \"2222222222\";\n\n fs::binf wbinf[2];\n wbinf[0].buffer = &BUFFER_TEST1[0];\n wbinf[0].size = BUFFER_TEST1.size();\n wbinf[1].buffer = &BUFFER_TEST2[0];\n wbinf[1].size = BUFFER_TEST2.size();\n\n int wsize = fs::write(f, wbinf, 2, 0);\n ASSERT_EQ(BUFFER_TEST1.size() + BUFFER_TEST2.size(), wsize);\n\n std::string rbuf1(BUFFER_TEST1.size(), '\\0');\n std::string rbuf2(BUFFER_TEST2.size(), '\\0');\n\n fs::binf rbinf[2];\n rbinf[0].buffer = &rbuf1[0];\n rbinf[0].size = rbuf1.size();\n rbinf[1].buffer = &rbuf2[0];\n rbinf[1].size = rbuf2.size();\n\n int rsize = fs::read(f, rbinf, 2, 0);\n ASSERT_EQ(BUFFER_TEST1.size() + BUFFER_TEST2.size(), rsize);\n ASSERT_EQ(BUFFER_TEST1, rbuf1);\n ASSERT_EQ(BUFFER_TEST2, rbuf2);\n\n \/\/ Close file.\n ASSERT_TRUE(fs::close(f));\n}\n\nTEST(FsIoTest, rw2)\n{\n TBAG_CREATE_TESTER_TEMP_DIR;\n\n auto TEST_FILE = TBAG_GET_TESTER_TEMP_DIR \/ \"test.txt\";\n namespace fs = ::libtbag::filesystem::details;\n\n \/\/ Create test file.\n ufile f = fs::open(TEST_FILE);\n ASSERT_LT(0, f);\n ASSERT_TRUE(TEST_FILE.exists());\n\n std::string BUFFER = \"FsIoTest\/Default\";\n\n \/\/ Write file.\n int wsize = fs::write2(f, BUFFER.c_str(), BUFFER.size(), 0);\n ASSERT_EQ(BUFFER.size(), wsize);\n\n \/\/ Read file.\n std::string rbuf(BUFFER.size(), '\\0');\n int rsize = fs::read2(f, &rbuf[0], rbuf.size(), 0);\n ASSERT_EQ(BUFFER.size(), rsize);\n ASSERT_EQ(BUFFER, rbuf);\n\n \/\/ Close file.\n ASSERT_TRUE(fs::close(f));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/www.qtsoftware.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n#include <QtScript\/qscriptengine.h>\n#include <QtScript\/qscriptstring.h>\n\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=\n\nclass tst_QScriptString : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QScriptString();\n virtual ~tst_QScriptString();\n\nprivate slots:\n void test();\n};\n\ntst_QScriptString::tst_QScriptString()\n{\n}\n\ntst_QScriptString::~tst_QScriptString()\n{\n}\n\nvoid tst_QScriptString::test()\n{\n QScriptEngine eng;\n\n {\n QScriptString str;\n QVERIFY(!str.isValid());\n QVERIFY(str == str);\n QVERIFY(!(str != str));\n QVERIFY(str.toString().isNull());\n\n QScriptString str1(str);\n QVERIFY(!str1.isValid());\n\n QScriptString str2 = str;\n QVERIFY(!str2.isValid());\n }\n\n for (int x = 0; x < 2; ++x) {\n QString ciao = QString::fromLatin1(\"ciao\");\n QScriptString str = eng.toStringHandle(ciao);\n QVERIFY(str.isValid());\n QVERIFY(str == str);\n QVERIFY(!(str != str));\n QCOMPARE(str.toString(), ciao);\n\n QScriptString str1(str);\n QCOMPARE(str, str1);\n\n QScriptString str2 = str;\n QCOMPARE(str, str2);\n\n QScriptString str3 = eng.toStringHandle(ciao);\n QVERIFY(str3.isValid());\n QCOMPARE(str, str3);\n\n eng.collectGarbage();\n\n QVERIFY(str.isValid());\n QCOMPARE(str.toString(), ciao);\n QVERIFY(str1.isValid());\n QCOMPARE(str1.toString(), ciao);\n QVERIFY(str2.isValid());\n QCOMPARE(str2.toString(), ciao);\n QVERIFY(str3.isValid());\n QCOMPARE(str3.toString(), ciao);\n }\n\n {\n QScriptEngine *eng2 = new QScriptEngine;\n QString one = QString::fromLatin1(\"one\");\n QString two = QString::fromLatin1(\"two\");\n QScriptString oneInterned = eng2->toStringHandle(one);\n QCOMPARE(oneInterned.toString(), one);\n QScriptString twoInterned = eng2->toStringHandle(two);\n QCOMPARE(twoInterned.toString(), two);\n QVERIFY(oneInterned != twoInterned);\n QVERIFY(!(oneInterned == twoInterned));\n\n delete eng2;\n\n QVERIFY(!oneInterned.isValid());\n QVERIFY(!twoInterned.isValid());\n }\n}\n\nQTEST_MAIN(tst_QScriptString)\n#include \"tst_qscriptstring.moc\"\n<commit_msg>add QEXPECT_FAIL (QScriptString isn't properly implemented yet)<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/www.qtsoftware.com\/contact.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtTest\/QtTest>\n\n#include <QtScript\/qscriptengine.h>\n#include <QtScript\/qscriptstring.h>\n\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=\n\nclass tst_QScriptString : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QScriptString();\n virtual ~tst_QScriptString();\n\nprivate slots:\n void test();\n};\n\ntst_QScriptString::tst_QScriptString()\n{\n}\n\ntst_QScriptString::~tst_QScriptString()\n{\n}\n\nvoid tst_QScriptString::test()\n{\n QScriptEngine eng;\n\n {\n QScriptString str;\n QVERIFY(!str.isValid());\n QVERIFY(str == str);\n QVERIFY(!(str != str));\n QVERIFY(str.toString().isNull());\n\n QScriptString str1(str);\n QVERIFY(!str1.isValid());\n\n QScriptString str2 = str;\n QVERIFY(!str2.isValid());\n }\n\n for (int x = 0; x < 2; ++x) {\n QString ciao = QString::fromLatin1(\"ciao\");\n QScriptString str = eng.toStringHandle(ciao);\n QVERIFY(str.isValid());\n QVERIFY(str == str);\n QVERIFY(!(str != str));\n QCOMPARE(str.toString(), ciao);\n\n QScriptString str1(str);\n QCOMPARE(str, str1);\n\n QScriptString str2 = str;\n QCOMPARE(str, str2);\n\n QScriptString str3 = eng.toStringHandle(ciao);\n QVERIFY(str3.isValid());\n QCOMPARE(str, str3);\n\n eng.collectGarbage();\n\n QVERIFY(str.isValid());\n QCOMPARE(str.toString(), ciao);\n QVERIFY(str1.isValid());\n QCOMPARE(str1.toString(), ciao);\n QVERIFY(str2.isValid());\n QCOMPARE(str2.toString(), ciao);\n QVERIFY(str3.isValid());\n QCOMPARE(str3.toString(), ciao);\n }\n\n {\n QScriptEngine *eng2 = new QScriptEngine;\n QString one = QString::fromLatin1(\"one\");\n QString two = QString::fromLatin1(\"two\");\n QScriptString oneInterned = eng2->toStringHandle(one);\n QCOMPARE(oneInterned.toString(), one);\n QScriptString twoInterned = eng2->toStringHandle(two);\n QCOMPARE(twoInterned.toString(), two);\n QVERIFY(oneInterned != twoInterned);\n QVERIFY(!(oneInterned == twoInterned));\n\n delete eng2;\n\n QEXPECT_FAIL(\"\", \"String handles aren't properly implemented yet\", Continue);\n QVERIFY(!oneInterned.isValid());\n QEXPECT_FAIL(\"\", \"String handles aren't properly implemented yet\", Continue);\n QVERIFY(!twoInterned.isValid());\n }\n}\n\nQTEST_MAIN(tst_QScriptString)\n#include \"tst_qscriptstring.moc\"\n<|endoftext|>"} {"text":"<commit_before>#define _CRT_SECURE_NO_DEPRECATE\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <memory.h>\n#include <time.h>\n#include <ctime>\n#include <windows.h>\n\n\n#define ARR_SIZE 32000\n\n#ifdef _CTIME_\ntypedef unsigned int size_t;\n#endif\n\nvoid print_array(unsigned short *arr, size_t arr_size);\nvoid bubble_sort(unsigned short *arr, size_t arr_size);\n\n#pragma warning (disable: 4100)\n#pragma comment (lib, \"opengl32.lib\")\n\nint main(int argc, char ** argv) {\n\n\tsrand((unsigned int)time(NULL));\n\tunsigned short somearray[ARR_SIZE];\n\tmemset(somearray, 0, sizeof(somearray));\n\n\tfor (size_t i = 0; i < ARR_SIZE; i++) {\n\t\tsomearray[i] = rand() % 100;\n\t}\n\t\/\/print_array(somearray, ARR_SIZE);\n\tprintf(\"Sorting!\\n\");\n\tdouble start = clock();\n\tbubble_sort(somearray, ARR_SIZE);\n\tprintf(\"%.4lf\\n\", (clock() - start \/ CLOCKS_PER_SEC) \/ 1000);\n\t\/\/print_array(somearray, ARR_SIZE);\n\treturn 0;\n}\n\nvoid print_array(unsigned short *arr, size_t arr_size) {\n\tfor (size_t i = 0; i < arr_size; i++){\n\t\tprintf(\"%4d\", arr[i]);\n\t}\n}\n\nvoid bubble_sort(unsigned short *arr, size_t arr_size) {\n\tfor (unsigned int i = 0; i < arr_size; i++){\n\t\tfor (unsigned int j = i; j < arr_size; j++){\n\t\t\tif (arr[i] > arr[j]){\n\t\t\t\t\/\/int tmp = arr[j];\n\t\t\t\t\/\/arr[j] = arr[i];\n\t\t\t\t\/\/arr[i] = tmp;\n\n\t\t\t\tarr[j] ^= arr[i];\n\t\t\t\tarr[i] ^= arr[j];\n\t\t\t\tarr[j] ^= arr[i];\n\n\t\t\t\t\/\/arr[j] += arr[i];\n\t\t\t\t\/\/arr[i] = arr[j] - arr[i];\n\t\t\t\t\/\/arr[j] -= arr[i];\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>добавлена новая сортировка - qsort<commit_after>#define _CRT_SECURE_NO_DEPRECATE\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <memory.h>\n#include <time.h>\n\n#define ARR_SIZE 640000\n\nvoid print_array(unsigned short *arr, size_t arr_size);\nvoid bubble_sort(unsigned short *arr, size_t arr_size);\nvoid qsort(unsigned short *arr, size_t arr_size);\nvoid qsort_o(unsigned short *arr, size_t arr_size);\n\nint main(int argc, char ** argv) {\n\tsrand((unsigned int)time(NULL));\n\tunsigned short somearray[ARR_SIZE], somearray2[ARR_SIZE];\n\tfor (size_t i = 0; i < ARR_SIZE; i++) {\n\t\tsomearray[i] = rand() % 100000;\n\t}\n\tmemcpy(somearray2, somearray, sizeof(somearray));\n\tprintf(\"\\nSorting!\\n\");\n\t\n\tdouble start = clock();\n\tqsort(somearray, ARR_SIZE);\n\tprintf(\"Обычный qsort - %.4lf sec.\\n\", (clock() - start \/ CLOCKS_PER_SEC) \/ 1000000);\n\n\tdouble start2 = clock();\n\tqsort_o(somearray2, ARR_SIZE);\n\tprintf(\"Оптимизированный qsort - %.4lf sec.\\n\", (clock() - start2 \/ CLOCKS_PER_SEC) \/ 1000000);\n\tprintf(\"\\n\");\n\treturn 0;\n}\n\nvoid print_array(unsigned short *arr, size_t arr_size) {\n\tfor (size_t i = 0; i < arr_size; i++){\n\t\tprintf(\"%4d\", arr[i]);\n\t}\n\tprintf(\"\\n\");\n}\n\nvoid swap(unsigned short *el1, unsigned short *el2) {\n\t*el2 ^= *el1;\n\t*el1 ^= *el2;\n\t*el2 ^= *el1;\n}\n\nvoid qsort(unsigned short *arr, size_t arr_size) {\n\t\/\/ sleep(1);\n\tif (arr_size <= 1)\n\t\treturn;\n\tint central = arr_size \/ 2;\n\n\tint i = 0, j = arr_size;\n\tfor (; i < j ;) {\n\t\twhile ((arr[i] <= arr[central]) && (i < central)) i++;\n\t\twhile ((arr[j] >= arr[central]) && (j > central)) j--;\n\t\tif (i < j){\n\t\t\tif (i == central)\n\t\t\t\tcentral = j;\n\t\t\telse if (j == central)\n\t\t\t\tcentral = i;\n\t\t\tswap(arr + i, arr + j);\n\t\t\tif (i < central)\n\t\t\t\ti++;\n\t\t\tif (j > central)\n\t\t\t\tj--;\n\t\t}\n\t}\n\t\/\/ printf(\"central element #%d, value - %d, i = %d, j = %d\\n\", central, arr[central], i, j);\n\t\/\/ if\n\tif (j > 0)\n\t\tqsort(arr, j);\n\tif (i < arr_size)\n\t\tqsort(arr + i, arr_size - i);\n}\n\nvoid qsort_o(unsigned short *arr, size_t arr_size) {\n\tdo {\n\t\tif (arr_size <= 1)\n\t\t\treturn;\n\t\tint central = arr_size \/ 2;\n\n\t\tint i = 0, j = arr_size;\n\t\tfor (; i < j ;) {\n\t\t\twhile ((arr[i] <= arr[central]) && (i < central)) i++;\n\t\t\twhile ((arr[j] >= arr[central]) && (j > central)) j--;\n\t\t\tif (i < j){\n\t\t\t\tif (i == central)\n\t\t\t\t\tcentral = j;\n\t\t\t\telse if (j == central)\n\t\t\t\t\tcentral = i;\n\t\t\t\tswap(arr + i, arr + j);\n\t\t\t\tif (i < central)\n\t\t\t\t\ti++;\n\t\t\t\tif (j > central)\n\t\t\t\t\tj--;\n\t\t\t}\n\t\t}\n\t\tif (j < arr_size - i){\n\t\t\tif (j > 0)\n\t\t\t\tqsort(arr, j);\n\t\t\tarr = arr + i;\n\t\t\tarr_size -= i;\n\t\t}\n\t\telse {\n\t\t\tif (i < arr_size)\n\t\t\t\tqsort(arr + i, arr_size - i);\n\t\t\tarr_size = j;\n\t\t}\n\t} while (arr_size > 1);\n}\n\nvoid bubble_sort(unsigned short *arr, size_t arr_size) {\n\tfor (unsigned int i = 0; i < arr_size; i++){\n\t\tfor (unsigned int j = i; j < arr_size; j++){\n\t\t\tif (arr[i] > arr[j]){\n\t\t\t\t\/\/int tmp = arr[j];\n\t\t\t\t\/\/arr[j] = arr[i];\n\t\t\t\t\/\/arr[i] = tmp;\n\n\t\t\t\tarr[j] ^= arr[i];\n\t\t\t\tarr[i] ^= arr[j];\n\t\t\t\tarr[j] ^= arr[i];\n\n\t\t\t\t\/\/arr[j] += arr[i];\n\t\t\t\t\/\/arr[i] = arr[j] - arr[i];\n\t\t\t\t\/\/arr[j] -= arr[i];\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2012 Daniele Bartolini, Simone Boscaratto\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"TGACompiler.h\"\n#include \"FileStream.h\"\n#include \"Pixel.h\"\n\nnamespace crown\n{\n\n\/\/-----------------------------------------------------------------------------\nTGACompiler::TGACompiler(const char* root_path, const char* dest_path, const char* resource, uint32_t seed) :\n\tCompiler(root_path, dest_path, resource, seed),\n\tm_image_format(PF_UNKNOWN),\n\tm_image_channels(0),\n\tm_image_size(0),\n\tm_image_data(NULL)\n{\n\tmemset(&m_tga_header, 0, sizeof(TGAHeader));\n}\n\n\/\/-----------------------------------------------------------------------------\nbool TGACompiler::compile()\n{\n\tFileStream* file = Compiler::source_file();\n\n\t\/\/ Read the header\n\tfile->read(&m_tga_header, sizeof(TGAHeader));\n\n\t\/\/ Skip TGA ID\n\tfile->skip(m_tga_header.id_length);\n\n\t\/\/ Compute color channels\t\n\tm_image_channels = m_tga_header.pixel_depth \/ 8;\n\t\n\t\/\/ Compute image size\n\tm_image_size = m_tga_header.width * m_tga_header.height;\n\n\t\/\/ Select the appropriate pixel format and allocate\n\t\/\/ resource data based on tga size and channels\n\tswitch (m_image_channels)\n\t{\n\t\tcase 2:\n\t\tcase 3:\n\t\t{\n\t\t\tm_image_format = PF_RGB_8;\n\t\t\tm_image_data = new uint8_t[(uint32_t)(m_image_size * 3)];\n\t\t\t\n\t\t\tbreak;\n\t\t}\n\t\tcase 4:\n\t\t{\n\t\t\tm_image_format = PF_RGBA_8;\n\t\t\tm_image_data = new uint8_t[(uint32_t)(m_image_size * m_image_channels)];\n\t\t\t\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t{\n\t\t\tprintf(\"Fatal: Unable to determine TGA channels. Aborting.\\n\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Determine image type (compressed\/uncompressed) and call proper function to load TGA\n\tswitch (m_tga_header.image_type)\n\t{\n\t\tcase 0:\n\t\t{\n\t\t\tprintf(\"Fatal: The resource does not contain image data. Aborting.\\n\");\n\t\t\treturn false;\n\t\t}\n\t\tcase 2:\n\t\t{\n\t\t\tload_uncompressed();\n\t\t\tbreak;\n\t\t}\n\n\t\tcase 10:\n\t\t{\n\t\t\tload_compressed();\n\t\t\tbreak;\n\t\t}\n\n\t\tdefault:\n\t\t{\n\t\t\tprintf(\"Fatal: Image type not supported. Aborting.\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Prepare for writing\n\tCompiler::prepare_header(m_image_size * m_image_channels +\n\t\t\t\t\t\t\t sizeof(PixelFormat) + sizeof(uint16_t) * 2);\n\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::write()\n{\n\tCompiler::write_header();\n\n\tFileStream* file = Compiler::destination_file();\n\n\t\/\/ Write out the data\n\tfile->write(&m_image_format, sizeof(PixelFormat));\n\tfile->write(&m_tga_header.width, sizeof(uint16_t));\n\tfile->write(&m_tga_header.height, sizeof(uint16_t));\n\tfile->write(m_image_data, m_image_size * m_image_channels);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::load_uncompressed()\n{\n\tFileStream* file = Compiler::source_file();\n\n\tuint64_t size = m_tga_header.width * m_tga_header.height;\n\n\tif (m_image_channels == 2)\n\t{\n\t\tint32_t j = 0;\n\n\t\tfor (uint64_t i = 0; i < size * m_image_channels; i++)\n\t\t{\n\t\t\tuint16_t pixel_data;\n\t\t\t\n\t\t\tfile->read(&pixel_data, sizeof(pixel_data));\n\t\t\t\n\t\t\tm_image_data[j + 0] = (pixel_data & 0x7c) >> 10;\n\t\t\tm_image_data[j + 1] = (pixel_data & 0x3e) >> 5;\n\t\t\tm_image_data[j + 2] = (pixel_data & 0x1f);\n\t\t\t\n\t\t\tj += 3;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfile->read(m_image_data, (size_t)(size * m_image_channels));\n\n\t\tswap_red_blue();\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::load_compressed()\n{\n\tFileStream* file = Compiler::source_file();\n\n\tuint8_t rle_id = 0;\n\tuint32_t i = 0;\n\tuint32_t colors_read = 0;\n\tuint64_t size = m_tga_header.width * m_tga_header.height;\n\n\t\/\/ Can't be more than 4 channels\n\tuint8_t colors[4];\n\n\twhile (i < size)\n\t{\n\t\tfile->read(&rle_id, sizeof(uint8_t));\n\n\t\t\/\/ If MSB == 1\n\t\tif (rle_id & 0x80)\n\t\t{\n\t\t\trle_id -= 127;\n\t\t\t\n\t\t\tfile->read(&colors, m_image_channels);\n\n\t\t\twhile (rle_id)\n\t\t\t{\n\t\t\t\tm_image_data[colors_read + 0] = colors[2];\n\t\t\t\tm_image_data[colors_read + 1] = colors[1];\n\t\t\t\tm_image_data[colors_read + 2] = colors[0];\n\n\t\t\t\tif (m_image_channels == 4)\n\t\t\t\t{\n\t\t\t\t\tm_image_data[colors_read + 3] = colors[3];\n\t\t\t\t}\n\n\t\t\t\trle_id--;\n\t\t\t\tcolors_read += m_image_channels;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\trle_id++;\n\n\t\t\twhile (rle_id)\n\t\t\t{\n\t\t\t\tfile->read(colors, m_image_channels);\n\t\t\t\t\n\t\t\t\tm_image_data[colors_read + 0] = colors[2];\n\t\t\t\tm_image_data[colors_read + 1] = colors[1];\n\t\t\t\tm_image_data[colors_read + 2] = colors[0];\n\n\t\t\t\tif (m_image_channels == 4)\n\t\t\t\t{\n\t\t\t\t\tm_image_data[colors_read + 3] = colors[3];\n\t\t\t\t}\n\n\t\t\t\trle_id--;\n\t\t\t\tcolors_read += m_image_channels;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::swap_red_blue()\n{\n\tfor (uint64_t i = 0; i < m_image_size; i += m_image_channels)\n\t{\n\t\tm_image_data[i + 0] ^= m_image_data[i + 2];\n\t\tm_image_data[i + 2] ^= m_image_data[i + 0];\n\t\tm_image_data[i + 0] ^= m_image_data[i + 2];\n\t}\n}\n\n} \/\/ namespace crown\n\n<commit_msg>Fix swapping red\/blue channels<commit_after>\/*\nCopyright (c) 2012 Daniele Bartolini, Simone Boscaratto\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"TGACompiler.h\"\n#include \"FileStream.h\"\n#include \"Pixel.h\"\n\nnamespace crown\n{\n\n\/\/-----------------------------------------------------------------------------\nTGACompiler::TGACompiler(const char* root_path, const char* dest_path, const char* resource, uint32_t seed) :\n\tCompiler(root_path, dest_path, resource, seed),\n\tm_image_format(PF_UNKNOWN),\n\tm_image_channels(0),\n\tm_image_size(0),\n\tm_image_data(NULL)\n{\n\tmemset(&m_tga_header, 0, sizeof(TGAHeader));\n}\n\n\/\/-----------------------------------------------------------------------------\nbool TGACompiler::compile()\n{\n\tFileStream* file = Compiler::source_file();\n\n\t\/\/ Read the header\n\tfile->read(&m_tga_header, sizeof(TGAHeader));\n\n\t\/\/ Skip TGA ID\n\tfile->skip(m_tga_header.id_length);\n\n\t\/\/ Compute color channels\t\n\tm_image_channels = m_tga_header.pixel_depth \/ 8;\n\t\n\t\/\/ Compute image size\n\tm_image_size = m_tga_header.width * m_tga_header.height;\n\n\t\/\/ Select the appropriate pixel format and allocate\n\t\/\/ resource data based on tga size and channels\n\tswitch (m_image_channels)\n\t{\n\t\tcase 2:\n\t\tcase 3:\n\t\t{\n\t\t\tm_image_format = PF_RGB_8;\n\t\t\tm_image_data = new uint8_t[(uint32_t)(m_image_size * 3)];\n\t\t\t\n\t\t\tbreak;\n\t\t}\n\t\tcase 4:\n\t\t{\n\t\t\tm_image_format = PF_RGBA_8;\n\t\t\tm_image_data = new uint8_t[(uint32_t)(m_image_size * m_image_channels)];\n\t\t\t\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t{\n\t\t\tprintf(\"Fatal: Unable to determine TGA channels. Aborting.\\n\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Determine image type (compressed\/uncompressed) and call proper function to load TGA\n\tswitch (m_tga_header.image_type)\n\t{\n\t\tcase 0:\n\t\t{\n\t\t\tprintf(\"Fatal: The resource does not contain image data. Aborting.\\n\");\n\t\t\treturn false;\n\t\t}\n\t\tcase 2:\n\t\t{\n\t\t\tload_uncompressed();\n\t\t\tbreak;\n\t\t}\n\n\t\tcase 10:\n\t\t{\n\t\t\tload_compressed();\n\t\t\tbreak;\n\t\t}\n\n\t\tdefault:\n\t\t{\n\t\t\tprintf(\"Fatal: Image type not supported. Aborting.\");\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/\/ Prepare for writing\n\tCompiler::prepare_header(m_image_size * m_image_channels +\n\t\t\t\t\t\t\t sizeof(PixelFormat) + sizeof(uint16_t) * 2);\n\n\treturn true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::write()\n{\n\tCompiler::write_header();\n\n\tFileStream* file = Compiler::destination_file();\n\n\t\/\/ Write out the data\n\tfile->write(&m_image_format, sizeof(PixelFormat));\n\tfile->write(&m_tga_header.width, sizeof(uint16_t));\n\tfile->write(&m_tga_header.height, sizeof(uint16_t));\n\tfile->write(m_image_data, m_image_size * m_image_channels);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::load_uncompressed()\n{\n\tFileStream* file = Compiler::source_file();\n\n\tuint64_t size = m_tga_header.width * m_tga_header.height;\n\n\tif (m_image_channels == 2)\n\t{\n\t\tint32_t j = 0;\n\n\t\tfor (uint64_t i = 0; i < size * m_image_channels; i++)\n\t\t{\n\t\t\tuint16_t pixel_data;\n\t\t\t\n\t\t\tfile->read(&pixel_data, sizeof(pixel_data));\n\t\t\t\n\t\t\tm_image_data[j + 0] = (pixel_data & 0x7c) >> 10;\n\t\t\tm_image_data[j + 1] = (pixel_data & 0x3e) >> 5;\n\t\t\tm_image_data[j + 2] = (pixel_data & 0x1f);\n\t\t\t\n\t\t\tj += 3;\n\t\t}\n\t}\n\telse\n\t{\n\t\tfile->read(m_image_data, (size_t)(size * m_image_channels));\n\n\t\tswap_red_blue();\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::load_compressed()\n{\n\tFileStream* file = Compiler::source_file();\n\n\tuint8_t rle_id = 0;\n\tuint32_t i = 0;\n\tuint32_t colors_read = 0;\n\tuint64_t size = m_tga_header.width * m_tga_header.height;\n\n\t\/\/ Can't be more than 4 channels\n\tuint8_t colors[4];\n\n\twhile (i < size)\n\t{\n\t\tfile->read(&rle_id, sizeof(uint8_t));\n\n\t\t\/\/ If MSB == 1\n\t\tif (rle_id & 0x80)\n\t\t{\n\t\t\trle_id -= 127;\n\t\t\t\n\t\t\tfile->read(&colors, m_image_channels);\n\n\t\t\twhile (rle_id)\n\t\t\t{\n\t\t\t\tm_image_data[colors_read + 0] = colors[2];\n\t\t\t\tm_image_data[colors_read + 1] = colors[1];\n\t\t\t\tm_image_data[colors_read + 2] = colors[0];\n\n\t\t\t\tif (m_image_channels == 4)\n\t\t\t\t{\n\t\t\t\t\tm_image_data[colors_read + 3] = colors[3];\n\t\t\t\t}\n\n\t\t\t\trle_id--;\n\t\t\t\tcolors_read += m_image_channels;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\trle_id++;\n\n\t\t\twhile (rle_id)\n\t\t\t{\n\t\t\t\tfile->read(colors, m_image_channels);\n\t\t\t\t\n\t\t\t\tm_image_data[colors_read + 0] = colors[2];\n\t\t\t\tm_image_data[colors_read + 1] = colors[1];\n\t\t\t\tm_image_data[colors_read + 2] = colors[0];\n\n\t\t\t\tif (m_image_channels == 4)\n\t\t\t\t{\n\t\t\t\t\tm_image_data[colors_read + 3] = colors[3];\n\t\t\t\t}\n\n\t\t\t\trle_id--;\n\t\t\t\tcolors_read += m_image_channels;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TGACompiler::swap_red_blue()\n{\n\tfor (uint64_t i = 0; i < m_image_size * m_image_channels; i += m_image_channels)\n\t{\n\t\tm_image_data[i + 0] ^= m_image_data[i + 2];\n\t\tm_image_data[i + 2] ^= m_image_data[i + 0];\n\t\tm_image_data[i + 0] ^= m_image_data[i + 2];\n\t}\n}\n\n} \/\/ namespace crown\n\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2016 by contributors. All Rights Reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/------------------------------------------------------------------------------\n\n\/*\nAuthor: Chao Ma (mctt90@gmail.com)\nThis file is the implementation of FFMScore class.\n*\/\n\n#include \"src\/score\/ffm_score.h\"\n#include \"src\/base\/math.h\"\n\nnamespace xLearn {\n\n#ifdef __AVX__\n\nfloat sum8(__m256 x) {\n \/\/ hiQuad = ( x7, x6, x5, x4 )\n const __m128 hiQuad = _mm256_extractf128_ps(x, 1);\n \/\/ loQuad = ( x3, x2, x1, x0 )\n const __m128 loQuad = _mm256_castps256_ps128(x);\n \/\/ sumQuad = ( x3 + x7, x2 + x6, x1 + x5, x0 + x4 )\n const __m128 sumQuad = _mm_add_ps(loQuad, hiQuad);\n \/\/ loDual = ( -, -, x1 + x5, x0 + x4 )\n const __m128 loDual = sumQuad;\n \/\/ hiDual = ( -, -, x3 + x7, x2 + x6 )\n const __m128 hiDual = _mm_movehl_ps(sumQuad, sumQuad);\n \/\/ sumDual = ( -, -, x1 + x3 + x5 + x7, x0 + x2 + x4 + x6 )\n const __m128 sumDual = _mm_add_ps(loDual, hiDual);\n \/\/ lo = ( -, -, -, x0 + x2 + x4 + x6 )\n const __m128 lo = sumDual;\n \/\/ hi = ( -, -, -, x1 + x3 + x5 + x7 )\n const __m128 hi = _mm_shuffle_ps(sumDual, sumDual, 0x1);\n \/\/ sum = ( -, -, -, x0 + x1 + x2 + x3 + x4 + x5 + x6 + x7 )\n const __m128 sum = _mm_add_ss(lo, hi);\n return _mm_cvtss_f32(sum);\n}\n\n#endif\n\n\/\/ y = wTx + sum[(V_i_fj*V_j_fi)(x_i * x_j)]\n\/\/ Using sse\/avx to speed up\nreal_t FFMScore::CalcScore(const SparseRow* row,\n Model& model) {\n real_t score = 0.0;\n \/*********************************************************\n * linear term *\n *********************************************************\/\n real_t *w = model.GetParameter_w();\n for (SparseRow::const_iterator iter = row->begin();\n iter != row->end(); ++iter) {\n index_t pos = iter->feat_id;\n score += w[pos] * iter->feat_val;\n }\n \/*********************************************************\n * latent factor *\n *********************************************************\/\n index_t align0 = model.GetNumK();\n index_t align1 = model.GetNumField() * model.GetNumK();\n w = model.GetParameter_w() + model.GetNumFeature();\n __MX _sum = _MMX_SETZERO_PS();\n for (SparseRow::const_iterator iter_i = row->begin();\n iter_i != row->end(); ++iter_i) {\n real_t v1 = iter_i->feat_val;\n index_t j1 = iter_i->feat_id;\n index_t f1 = iter_i->field_id;\n for (SparseRow::const_iterator iter_j = iter_i+1;\n iter_j != row->end(); ++iter_j) {\n real_t v2 = iter_j->feat_val;\n index_t j2 = iter_j->feat_id;\n index_t f2 = iter_j->field_id;\n real_t* w1_base = w + j1*align1 + f2*align0;\n real_t* w2_base = w + j2*align1 + f1*align0;\n __MX _v = _MMX_SET1_PS(v1*v2);\n for (index_t k = 0; k < align0; k += _MMX_INCREMENT) {\n __MX _w1 = _MMX_LOAD_PS(w1_base + k);\n __MX _w2 = _MMX_LOAD_PS(w2_base + k);\n _sum = _MMX_ADD_PS(_sum,\n _MMX_MUL_PS(_MMX_MUL_PS(_w1, _w2), _v));\n }\n }\n }\n real_t sum = 0;\n#ifdef __AVX__\n sum += sum8(_sum);\n#else \/\/ SSE\n _sum = _mm_hadd_ps(_sum, _sum);\n _sum = _mm_hadd_ps(_sum, _sum);\n _mm_store_ss(&sum, _sum);\n#endif\n score += sum;\n return score;\n}\n\n\/\/ Calculate gradient and update current model\n\/\/ parameters. Using sse\/avx to speed up\nvoid FFMScore::CalcGrad(const SparseRow* row,\n Model& model,\n real_t pg) {\n \/*********************************************************\n * linear term *\n *********************************************************\/\n real_t *w = model.GetParameter_w();\n real_t* cache = model.GetParameter_cache();\n for (SparseRow::const_iterator iter = row->begin();\n iter != row->end(); ++iter) {\n real_t gradient = pg * iter->feat_val;\n index_t idx = iter->feat_id;\n gradient += regu_lambda_ * w[idx];\n cache[idx] += (gradient * gradient);\n w[idx] -= (learning_rate_ * gradient *\n InvSqrt((cache)[idx]));\n }\n \/*********************************************************\n * latent factor *\n *********************************************************\/\n index_t align0 = model.GetNumK();\n index_t align1 = model.GetNumField() * model.GetNumK();\n w = model.GetParameter_w() + model.GetNumFeature();\n cache = model.GetParameter_cache() + model.GetNumFeature();\n __MX _pg = _MMX_SET1_PS(pg);\n __MX _lr = _MMX_SET1_PS(learning_rate_);\n __MX _lamb = _MMX_SET1_PS(regu_lambda_);\n for (SparseRow::const_iterator iter_i = row->begin();\n iter_i != row->end(); ++iter_i) {\n real_t v1 = iter_i->feat_val;\n index_t j1 = iter_i->feat_id;\n index_t f1 = iter_i->field_id;\n for (SparseRow::const_iterator iter_j = iter_i+1;\n iter_j != row->end(); ++iter_j) {\n real_t v2 = iter_j->feat_val;\n index_t j2 = iter_j->feat_id;\n index_t f2 = iter_j->field_id;\n index_t bias_1 = j1*align1 + f2*align0;\n index_t bias_2 = j2*align1 + f1*align0;\n real_t* w1_base = w + bias_1;\n real_t* w2_base = w + bias_2;\n real_t* c1_base = cache + bias_1;\n real_t* c2_base = cache + bias_2;\n __MX _v = _MMX_SET1_PS(v1*v2);\n __MX _v_pg = _MMX_MUL_PS(_v, _pg);\n for (size_t k = 0; k < align0; k += _MMX_INCREMENT) {\n real_t* w1 = w1_base + k;\n real_t* w2 = w2_base + k;\n real_t* c1 = c1_base + k;\n real_t* c2 = c2_base + k;\n __MX _w1 = _MMX_LOAD_PS(w1);\n __MX _w2 = _MMX_LOAD_PS(w2);\n __MX _c1 = _MMX_LOAD_PS(c1);\n __MX _c2 = _MMX_LOAD_PS(c2);\n __MX _g1 = _MMX_ADD_PS(\n _MMX_MUL_PS(_lamb, _w1),\n _MMX_MUL_PS(_v_pg, _w2));\n __MX _g2 = _MMX_ADD_PS(\n _MMX_MUL_PS(_lamb, _w2),\n _MMX_MUL_PS(_v_pg, _w1));\n _c1 = _MMX_ADD_PS(_c1, _MMX_MUL_PS(_g1, _g1));\n _c2 = _MMX_ADD_PS(_c2, _MMX_MUL_PS(_g2, _g2));\n _w1 = _MMX_SUB_PS(_w1, _MMX_MUL_PS(_lr,\n _MMX_MUL_PS(_MMX_RSQRT_PS(_c1), _g1)));\n _w2 = _MMX_SUB_PS(_w2, _MMX_MUL_PS(_lr,\n _MMX_MUL_PS(_MMX_RSQRT_PS(_c2), _g2)));\n _MMX_STORE_PS(w1, _w1);\n _MMX_STORE_PS(w2, _w2);\n _MMX_STORE_PS(c1, _c1);\n _MMX_STORE_PS(c2, _c2);\n }\n }\n }\n}\n\n} \/\/ namespace xLearn\n<commit_msg>update<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ Copyright (c) 2016 by contributors. All Rights Reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/------------------------------------------------------------------------------\n\n\/*\nAuthor: Chao Ma (mctt90@gmail.com)\nThis file is the implementation of FFMScore class.\n*\/\n\n#include \"src\/score\/ffm_score.h\"\n#include \"src\/base\/math.h\"\n\nnamespace xLearn {\n\n#ifdef __AVX__\n\nfloat sum8(__m256 x) {\n \/\/ hiQuad = ( x7, x6, x5, x4 )\n const __m128 hiQuad = _mm256_extractf128_ps(x, 1);\n \/\/ loQuad = ( x3, x2, x1, x0 )\n const __m128 loQuad = _mm256_castps256_ps128(x);\n \/\/ sumQuad = ( x3 + x7, x2 + x6, x1 + x5, x0 + x4 )\n const __m128 sumQuad = _mm_add_ps(loQuad, hiQuad);\n \/\/ loDual = ( -, -, x1 + x5, x0 + x4 )\n const __m128 loDual = sumQuad;\n \/\/ hiDual = ( -, -, x3 + x7, x2 + x6 )\n const __m128 hiDual = _mm_movehl_ps(sumQuad, sumQuad);\n \/\/ sumDual = ( -, -, x1 + x3 + x5 + x7, x0 + x2 + x4 + x6 )\n const __m128 sumDual = _mm_add_ps(loDual, hiDual);\n \/\/ lo = ( -, -, -, x0 + x2 + x4 + x6 )\n const __m128 lo = sumDual;\n \/\/ hi = ( -, -, -, x1 + x3 + x5 + x7 )\n const __m128 hi = _mm_shuffle_ps(sumDual, sumDual, 0x1);\n \/\/ sum = ( -, -, -, x0 + x1 + x2 + x3 + x4 + x5 + x6 + x7 )\n const __m128 sum = _mm_add_ss(lo, hi);\n return _mm_cvtss_f32(sum);\n}\n\n#endif\n\n\/\/ y = wTx + sum[(V_i_fj*V_j_fi)(x_i * x_j)]\n\/\/ Using sse\/avx to speed up\nreal_t FFMScore::CalcScore(const SparseRow* row,\n Model& model) {\n real_t score = 0.0;\n \/*********************************************************\n * linear term *\n *********************************************************\/\n static real_t *w = model.GetParameter_w();\n for (SparseRow::const_iterator iter = row->begin();\n iter != row->end(); ++iter) {\n index_t pos = iter->feat_id;\n score += w[pos] * iter->feat_val;\n }\n \/*********************************************************\n * latent factor *\n *********************************************************\/\n static index_t align0 = model.GetNumK();\n static index_t align1 = model.GetNumField() * model.GetNumK();\n static __MX _sum = _MMX_SETZERO_PS();\n w = model.GetParameter_w() + model.GetNumFeature();\n for (SparseRow::const_iterator iter_i = row->begin();\n iter_i != row->end(); ++iter_i) {\n real_t v1 = iter_i->feat_val;\n index_t j1 = iter_i->feat_id;\n index_t f1 = iter_i->field_id;\n for (SparseRow::const_iterator iter_j = iter_i+1;\n iter_j != row->end(); ++iter_j) {\n real_t v2 = iter_j->feat_val;\n index_t j2 = iter_j->feat_id;\n index_t f2 = iter_j->field_id;\n real_t* w1_base = w + j1*align1 + f2*align0;\n real_t* w2_base = w + j2*align1 + f1*align0;\n __MX _v = _MMX_SET1_PS(v1*v2);\n for (index_t k = 0; k < align0; k += _MMX_INCREMENT) {\n __MX _w1 = _MMX_LOAD_PS(w1_base + k);\n __MX _w2 = _MMX_LOAD_PS(w2_base + k);\n _sum = _MMX_ADD_PS(_sum,\n _MMX_MUL_PS(_MMX_MUL_PS(_w1, _w2), _v));\n }\n }\n }\n real_t sum = 0;\n#ifdef __AVX__\n sum += sum8(_sum);\n#else \/\/ SSE\n _sum = _mm_hadd_ps(_sum, _sum);\n _sum = _mm_hadd_ps(_sum, _sum);\n _mm_store_ss(&sum, _sum);\n#endif\n score += sum;\n return score;\n}\n\n\/\/ Calculate gradient and update current model\n\/\/ parameters. Using sse\/avx to speed up\nvoid FFMScore::CalcGrad(const SparseRow* row,\n Model& model,\n real_t pg) {\n \/*********************************************************\n * linear term *\n *********************************************************\/\n static real_t *w = model.GetParameter_w();\n static real_t* cache = model.GetParameter_cache();\n for (SparseRow::const_iterator iter = row->begin();\n iter != row->end(); ++iter) {\n real_t gradient = pg * iter->feat_val;\n index_t idx = iter->feat_id;\n gradient += regu_lambda_ * w[idx];\n cache[idx] += (gradient * gradient);\n w[idx] -= (learning_rate_ * gradient *\n InvSqrt((cache)[idx]));\n }\n \/*********************************************************\n * latent factor *\n *********************************************************\/\n static index_t align0 = model.GetNumK();\n static index_t align1 = model.GetNumField() * model.GetNumK();\n static __MX _pg = _MMX_SET1_PS(pg);\n static __MX _lr = _MMX_SET1_PS(learning_rate_);\n static __MX _lamb = _MMX_SET1_PS(regu_lambda_);\n w = model.GetParameter_w() + model.GetNumFeature();\n cache = model.GetParameter_cache() + model.GetNumFeature();\n for (SparseRow::const_iterator iter_i = row->begin();\n iter_i != row->end(); ++iter_i) {\n real_t v1 = iter_i->feat_val;\n index_t j1 = iter_i->feat_id;\n index_t f1 = iter_i->field_id;\n for (SparseRow::const_iterator iter_j = iter_i+1;\n iter_j != row->end(); ++iter_j) {\n real_t v2 = iter_j->feat_val;\n index_t j2 = iter_j->feat_id;\n index_t f2 = iter_j->field_id;\n index_t bias_1 = j1*align1 + f2*align0;\n index_t bias_2 = j2*align1 + f1*align0;\n real_t* w1_base = w + bias_1;\n real_t* w2_base = w + bias_2;\n real_t* c1_base = cache + bias_1;\n real_t* c2_base = cache + bias_2;\n __MX _v = _MMX_SET1_PS(v1*v2);\n __MX _v_pg = _MMX_MUL_PS(_v, _pg);\n for (size_t k = 0; k < align0; k += _MMX_INCREMENT) {\n real_t* w1 = w1_base + k;\n real_t* w2 = w2_base + k;\n real_t* c1 = c1_base + k;\n real_t* c2 = c2_base + k;\n __MX _w1 = _MMX_LOAD_PS(w1);\n __MX _w2 = _MMX_LOAD_PS(w2);\n __MX _c1 = _MMX_LOAD_PS(c1);\n __MX _c2 = _MMX_LOAD_PS(c2);\n __MX _g1 = _MMX_ADD_PS(\n _MMX_MUL_PS(_lamb, _w1),\n _MMX_MUL_PS(_v_pg, _w2));\n __MX _g2 = _MMX_ADD_PS(\n _MMX_MUL_PS(_lamb, _w2),\n _MMX_MUL_PS(_v_pg, _w1));\n _c1 = _MMX_ADD_PS(_c1, _MMX_MUL_PS(_g1, _g1));\n _c2 = _MMX_ADD_PS(_c2, _MMX_MUL_PS(_g2, _g2));\n _w1 = _MMX_SUB_PS(_w1, _MMX_MUL_PS(_lr,\n _MMX_MUL_PS(_MMX_RSQRT_PS(_c1), _g1)));\n _w2 = _MMX_SUB_PS(_w2, _MMX_MUL_PS(_lr,\n _MMX_MUL_PS(_MMX_RSQRT_PS(_c2), _g2)));\n _MMX_STORE_PS(w1, _w1);\n _MMX_STORE_PS(w2, _w2);\n _MMX_STORE_PS(c1, _c1);\n _MMX_STORE_PS(c2, _c2);\n }\n }\n }\n}\n\n} \/\/ namespace xLearn\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: operators_new_delete.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 14:25:22 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifdef WNT \/* avoid 'std::bad_alloc' unresolved externals *\/\n#define _CRTIMP\n#define _NTSDK\n#endif \/* WNT *\/\n\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm>\n#define INCLUDED_ALGORITHM\n#endif\n\n#ifndef INCLUDED_NEW\n#include <new>\n#define INCLUDED_NEW\n#endif\n\n#ifndef INCLUDED_STRING_H\n#include <string.h>\n#define INCLUDED_STRING_H\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _RTL_ALLOC_H_\n#include <rtl\/alloc.h>\n#endif\n\nusing std::nothrow_t;\n\n\/\/ =======================================================================\n\/\/ AllocatorTraits\n\/\/ =======================================================================\n\nnamespace\n{\n\nstruct AllocatorTraits\n{\n typedef char const signature_type[8];\n const signature_type & m_signature;\n\n explicit AllocatorTraits (signature_type const & s) SAL_THROW(())\n : m_signature (s)\n {}\n\n std::size_t size (std::size_t n) const SAL_THROW(())\n {\n n = std::max(n, std::size_t(1));\n#if OSL_DEBUG_LEVEL > 0\n n += sizeof(signature_type);\n#endif \/* OSL_DEBUG_LEVEL *\/\n return n;\n }\n\n void* init (void * p) const SAL_THROW(())\n {\n#if OSL_DEBUG_LEVEL > 0\n memcpy (p, m_signature, sizeof(signature_type));\n p = static_cast<char*>(p) + sizeof(signature_type);\n#endif \/* OSL_DEBUG_LEVEL *\/\n return p;\n }\n\n void* fini (void * p) const SAL_THROW(())\n {\n#if OSL_DEBUG_LEVEL > 0\n p = static_cast<char*>(p) - sizeof(signature_type);\n if (memcmp (p, m_signature, sizeof(signature_type)) != 0)\n {\n OSL_ENSURE(0, \"operator delete mismatch\");\n }\n#endif \/* OSL_DEBUG_LEVEL *\/\n return p;\n }\n};\n\n\/\/ =======================================================================\n\nstruct VectorTraits : public AllocatorTraits\n{\n static const signature_type g_signature;\n\n VectorTraits() SAL_THROW(())\n : AllocatorTraits (g_signature)\n {}\n};\n\nstruct ScalarTraits : public AllocatorTraits\n{\n static const signature_type g_signature;\n\n ScalarTraits() SAL_THROW(())\n : AllocatorTraits (g_signature)\n {}\n};\n\nconst AllocatorTraits::signature_type VectorTraits::g_signature = \"new[]()\";\nconst AllocatorTraits::signature_type ScalarTraits::g_signature = \"new() \";\n\n} \/\/ anonymous namespace\n\n\/\/ =======================================================================\n\/\/ Allocator\n\/\/ =======================================================================\n\nstatic void default_handler (void)\n{\n \/\/ Multithreading race in 'std::set_new_handler()' call sequence below.\n throw std::bad_alloc();\n}\n\n\/\/ =======================================================================\n\nstatic void* allocate (\n std::size_t n, AllocatorTraits const & rTraits)\n SAL_THROW((std::bad_alloc))\n{\n n = rTraits.size (n);\n for (;;)\n {\n void * p = rtl_allocateMemory (sal_uInt32(n));\n if (p != 0)\n return rTraits.init (p);\n\n std::new_handler d = default_handler, f = std::set_new_handler (d);\n if (f != d)\n std::set_new_handler (f);\n\n if (f == 0)\n throw std::bad_alloc();\n (*f)();\n }\n}\n\n\/\/ =======================================================================\n\nstatic void* allocate (\n std::size_t n, AllocatorTraits const & rTraits, std::nothrow_t const &)\n SAL_THROW(())\n{\n try\n {\n return allocate (n, rTraits);\n }\n catch (std::bad_alloc const &)\n {\n return (0);\n }\n}\n\n\/\/ =======================================================================\n\nstatic void deallocate (void * p, AllocatorTraits const & rTraits)\n SAL_THROW(())\n{\n if (p)\n {\n rtl_freeMemory (rTraits.fini(p));\n }\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new T; delete p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new (std::size_t n) throw (std::bad_alloc)\n{\n return allocate (n, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete (void * p) throw ()\n{\n deallocate (p, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new(nothrow) T; delete(nothrow) p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new (std::size_t n, std::nothrow_t const &) throw ()\n{\n return allocate (n, ScalarTraits(), nothrow_t());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete (void * p, std::nothrow_t const &) throw ()\n{\n deallocate (p, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new T[n]; delete[] p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new[] (std::size_t n) throw (std::bad_alloc)\n{\n return allocate (n, VectorTraits());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete[] (void * p) throw ()\n{\n deallocate (p, VectorTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new(nothrow) T[n]; delete(nothrow)[] p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new[] (std::size_t n, std::nothrow_t const &) throw ()\n{\n return allocate (n, VectorTraits(), nothrow_t());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete[] (void * p, std::nothrow_t const &) throw ()\n{\n deallocate (p, VectorTraits());\n}\n\n\/\/ =======================================================================\n<commit_msg>INTEGRATION: CWS sixtyfour01 (1.4.60); FILE MERGED 2006\/01\/14 12:57:49 pjanik 1.4.60.1: #i57893#: 64bit fixes for module sal. Patch from Jan Holesovsky (JCA).<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: operators_new_delete.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2006-02-28 10:33:55 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifdef WNT \/* avoid 'std::bad_alloc' unresolved externals *\/\n#define _CRTIMP\n#define _NTSDK\n#endif \/* WNT *\/\n\n#ifndef INCLUDED_ALGORITHM\n#include <algorithm>\n#define INCLUDED_ALGORITHM\n#endif\n\n#ifndef INCLUDED_NEW\n#include <new>\n#define INCLUDED_NEW\n#endif\n\n#ifndef INCLUDED_STRING_H\n#include <string.h>\n#define INCLUDED_STRING_H\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _RTL_ALLOC_H_\n#include <rtl\/alloc.h>\n#endif\n\nusing std::nothrow_t;\n\n\/\/ =======================================================================\n\/\/ AllocatorTraits\n\/\/ =======================================================================\n\nnamespace\n{\n\nstruct AllocatorTraits\n{\n typedef char const signature_type[8];\n const signature_type & m_signature;\n\n explicit AllocatorTraits (signature_type const & s) SAL_THROW(())\n : m_signature (s)\n {}\n\n std::size_t size (std::size_t n) const SAL_THROW(())\n {\n n = std::max(n, std::size_t(1));\n#if OSL_DEBUG_LEVEL > 0\n n += sizeof(signature_type);\n#endif \/* OSL_DEBUG_LEVEL *\/\n return n;\n }\n\n void* init (void * p) const SAL_THROW(())\n {\n#if OSL_DEBUG_LEVEL > 0\n memcpy (p, m_signature, sizeof(signature_type));\n p = static_cast<char*>(p) + sizeof(signature_type);\n#endif \/* OSL_DEBUG_LEVEL *\/\n return p;\n }\n\n void* fini (void * p) const SAL_THROW(())\n {\n#if OSL_DEBUG_LEVEL > 0\n p = static_cast<char*>(p) - sizeof(signature_type);\n if (memcmp (p, m_signature, sizeof(signature_type)) != 0)\n {\n OSL_ENSURE(0, \"operator delete mismatch\");\n }\n#endif \/* OSL_DEBUG_LEVEL *\/\n return p;\n }\n};\n\n\/\/ =======================================================================\n\nstruct VectorTraits : public AllocatorTraits\n{\n static const signature_type g_signature;\n\n VectorTraits() SAL_THROW(())\n : AllocatorTraits (g_signature)\n {}\n};\n\nstruct ScalarTraits : public AllocatorTraits\n{\n static const signature_type g_signature;\n\n ScalarTraits() SAL_THROW(())\n : AllocatorTraits (g_signature)\n {}\n};\n\nconst AllocatorTraits::signature_type VectorTraits::g_signature = \"new[]()\";\nconst AllocatorTraits::signature_type ScalarTraits::g_signature = \"new() \";\n\n} \/\/ anonymous namespace\n\n\/\/ =======================================================================\n\/\/ Allocator\n\/\/ =======================================================================\n\nstatic void default_handler (void)\n{\n \/\/ Multithreading race in 'std::set_new_handler()' call sequence below.\n throw std::bad_alloc();\n}\n\n\/\/ =======================================================================\n\nstatic void* allocate (\n std::size_t n, AllocatorTraits const & rTraits)\n SAL_THROW((std::bad_alloc))\n{\n n = rTraits.size (n);\n for (;;)\n {\n void * p = rtl_allocateMemory (sal_Size(n));\n if (p != 0)\n return rTraits.init (p);\n\n std::new_handler d = default_handler, f = std::set_new_handler (d);\n if (f != d)\n std::set_new_handler (f);\n\n if (f == 0)\n throw std::bad_alloc();\n (*f)();\n }\n}\n\n\/\/ =======================================================================\n\nstatic void* allocate (\n std::size_t n, AllocatorTraits const & rTraits, std::nothrow_t const &)\n SAL_THROW(())\n{\n try\n {\n return allocate (n, rTraits);\n }\n catch (std::bad_alloc const &)\n {\n return (0);\n }\n}\n\n\/\/ =======================================================================\n\nstatic void deallocate (void * p, AllocatorTraits const & rTraits)\n SAL_THROW(())\n{\n if (p)\n {\n rtl_freeMemory (rTraits.fini(p));\n }\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new T; delete p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new (std::size_t n) throw (std::bad_alloc)\n{\n return allocate (n, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete (void * p) throw ()\n{\n deallocate (p, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new(nothrow) T; delete(nothrow) p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new (std::size_t n, std::nothrow_t const &) throw ()\n{\n return allocate (n, ScalarTraits(), nothrow_t());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete (void * p, std::nothrow_t const &) throw ()\n{\n deallocate (p, ScalarTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new T[n]; delete[] p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new[] (std::size_t n) throw (std::bad_alloc)\n{\n return allocate (n, VectorTraits());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete[] (void * p) throw ()\n{\n deallocate (p, VectorTraits());\n}\n\n\/\/ =======================================================================\n\/\/ T * p = new(nothrow) T[n]; delete(nothrow)[] p;\n\/\/ =======================================================================\n\nvoid* SAL_CALL operator new[] (std::size_t n, std::nothrow_t const &) throw ()\n{\n return allocate (n, VectorTraits(), nothrow_t());\n}\n\n\/\/ =======================================================================\n\nvoid SAL_CALL operator delete[] (void * p, std::nothrow_t const &) throw ()\n{\n deallocate (p, VectorTraits());\n}\n\n\/\/ =======================================================================\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\r\n Copyright 2004-2008 Steve Menard\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n \r\n*****************************************************************************\/ \r\n#include <jpype.h>\r\n\r\nHostEnvironment* JPEnv::s_Host = NULL;\r\nJPJavaEnv* JPEnv::s_Java = NULL;\r\n\r\nvoid JPEnv::init(HostEnvironment* hostEnv)\r\n{\r\n\ts_Host = hostEnv;\r\n\t\r\n\tJPTypeName::init(); \r\n}\r\n\t\r\nvoid JPEnv::loadJVM(const string& vmPath, char ignoreUnrecognized, const StringVector& args)\r\n{\r\n\tTRACE_IN(\"JPEnv::loadJVM\");\r\n\t\r\n\tJavaVMInitArgs jniArgs;\r\n\tjniArgs.options = NULL;\r\n\t\r\n\tJPJavaEnv::load(vmPath);\r\n\r\n\t\/\/ prepare this ...\r\n\tjniArgs.version = JNI_VERSION_1_4;\r\n\tjniArgs.ignoreUnrecognized = ignoreUnrecognized;\r\n\t\t\r\n\tjniArgs.nOptions = (jint)args.size();\r\n\tjniArgs.options = (JavaVMOption*)malloc(sizeof(JavaVMOption)*jniArgs.nOptions);\r\n\tmemset(jniArgs.options, 0, sizeof(JavaVMOption)*jniArgs.nOptions);\r\n\t\r\n\tfor (int i = 0; i < jniArgs.nOptions; i++)\r\n\t{\r\n\t\tjniArgs.options[i].optionString = (char*)args[i].c_str();\r\n\t}\r\n\r\n\ts_Java = JPJavaEnv::CreateJavaVM((void*)&jniArgs);\r\n\tfree(jniArgs.options);\r\n \r\n\tif (s_Java == NULL) {\r\n\t\tRAISE(JPypeException, \"Unable to start JVM\");\r\n\t}\r\n\r\n\tJPTypeManager::init();\r\n\tJPJni::init();\r\n\tJPProxy::init();\r\n\r\n\tTRACE_OUT;\r\n}\r\n\r\nvoid JPEnv::attachJVM(const string& vmPath)\r\n{\r\n\tTRACE_IN(\"JPEnv::attachJVM\");\r\n\r\n\tJPJavaEnv::load(vmPath);\r\n\r\n\ts_Java = JPJavaEnv::GetCreatedJavaVM(); \r\n\t\r\n\tif (s_Java == NULL) {\r\n\t\tRAISE(JPypeException, \"Unable to attach to JVM\");\r\n\t}\r\n\r\n\tJPTypeManager::init();\r\n\tJPJni::init();\r\n\tJPProxy::init();\r\n\r\n\tTRACE_OUT;\r\n\t\r\n}\r\n\r\nvoid JPEnv::attachCurrentThread()\r\n{\r\n\ts_Java->AttachCurrentThread();\r\n}\r\n\r\nvoid JPEnv::attachCurrentThreadAsDaemon() \r\n{\r\n\ts_Java->AttachCurrentThreadAsDaemon();\r\n}\r\n\r\nbool JPEnv::isThreadAttached()\r\n{\r\n\treturn s_Java->isThreadAttached();\r\n}\r\n\r\n\r\nvoid JPEnv::registerRef(HostRef* ref, HostRef* targetRef)\r\n{\r\n\tTRACE_IN(\"JPEnv::registerRef\");\r\n\tJPObject* objRef = s_Host->asObject(ref);\r\n\tJPCleaner cleaner;\r\n\tTRACE1(\"A\");\r\n\tjobject srcObject = objRef->getObject();\r\n\tcleaner.addLocal(srcObject);\r\n\tJPJni::registerRef(s_Java->getReferenceQueue(), srcObject, (jlong)targetRef->copy());\r\n\tTRACE_OUT;\r\n\tTRACE1(\"B\");\r\n}\r\n\r\n\r\nstatic int jpype_traceLevel = 0;\r\n\r\n#ifdef JPYPE_TRACING_INTERNAL\r\n\tstatic const bool trace_internal = true; \r\n#else\r\n\tstatic const bool trace_internal = false;\r\n#endif\r\n\r\n\r\nvoid JPypeTracer::traceIn(const char* msg)\r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT << \"<B msg=\\\"\" << msg << \"\\\" >\" << endl;\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t\tjpype_traceLevel ++;\r\n\t}\r\n}\r\n\r\nvoid JPypeTracer::traceOut(const char* msg, bool error)\r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tjpype_traceLevel --;\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tif (error)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \"<\/B> <!-- !!!!!!!! EXCEPTION !!!!!! \" << msg << \" -->\" << endl;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \"<\/B> <!-- \" << msg << \" -->\" << endl;\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t}\r\n} \r\n\r\nvoid JPypeTracer::trace1(const char* name, const string& msg) \r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT << \"<M>\" << name << \" : \" << msg << \"<\/M>\" << endl;\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t}\r\n}\r\n\r\nJPCleaner::JPCleaner()\r\n{\r\n}\r\n\r\nJPCleaner::~JPCleaner()\r\n{\r\n\/\/AT's comments on porting:\r\n\/\/ A variety of Unix compilers do not allow redifinition of the same variable in \"for\" cycless\r\n\tvector<jobject>::iterator cur;\r\n\tfor (cur = m_GlobalJavaObjects.begin(); cur != m_GlobalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tJPEnv::getJava()->DeleteGlobalRef(*cur);\r\n\t}\r\n\t\r\n\tfor (cur = m_LocalJavaObjects.begin(); cur != m_LocalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tJPEnv::getJava()->DeleteLocalRef(*cur);\r\n\t}\r\n\r\n\tfor (vector<HostRef*>::iterator cur2 = m_HostObjects.begin(); cur2 != m_HostObjects.end(); cur2++)\r\n\t{\r\n\t\t(*cur2)->release();\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addGlobal(jobject obj)\r\n{\r\n\tm_GlobalJavaObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::addLocal(jobject obj)\r\n{\r\n\tm_LocalJavaObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::add(HostRef* obj)\r\n{\r\n\tm_HostObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::removeGlobal(jobject obj)\r\n{\r\n\tfor (vector<jobject>::iterator cur = m_GlobalJavaObjects.begin(); cur != m_GlobalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tif (*cur == obj)\r\n\t\t{\r\n\t\t\tm_GlobalJavaObjects.erase(cur);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeLocal(jobject obj)\r\n{\r\n\tfor (vector<jobject>::iterator cur = m_LocalJavaObjects.begin(); cur != m_LocalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tif (*cur == obj)\r\n\t\t{\r\n\t\t\tm_LocalJavaObjects.erase(cur);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::remove(HostRef* obj)\r\n{\r\n\tfor (vector<HostRef*>::iterator cur2 = m_HostObjects.begin(); cur2 != m_HostObjects.end(); cur2++)\r\n\t{\r\n\t\tif (*cur2 == obj)\r\n\t\t{\r\n\t\t\tm_HostObjects.erase(cur2);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAllGlobal(vector<jobject>& r) \r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\taddGlobal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAllGlobal(vector<jclass>& r) \r\n{\r\n\tfor (vector<jclass>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\taddGlobal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAllLocal(vector<jobject>& r) \r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\taddLocal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAllLocal(vector<jclass>& r) \r\n{\r\n\tfor (vector<jclass>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\taddLocal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAll(vector<HostRef*>& r) \r\n{\r\n\tfor (vector<HostRef*>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tadd(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeAllGlobal(vector<jobject>& r)\r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremoveGlobal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeAllLocal(vector<jobject>& r)\r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremoveLocal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeAll(vector<HostRef*>& r)\r\n{\r\n\tfor (vector<HostRef*>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremove(*cur);\r\n\t}\r\n}\r\n\r\nHostRef::HostRef(void* data, bool acquire)\r\n{\r\n\tif (acquire)\r\n\t{\r\n\t\tm_HostData = JPEnv::getHost()->acquireRef(data);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tm_HostData = data;\r\n\t}\r\n}\r\n\r\nHostRef::HostRef(void* data)\r\n{\r\n\tm_HostData = JPEnv::getHost()->acquireRef(data);\r\n}\r\n\r\nHostRef::~HostRef()\r\n{\r\n\tJPEnv::getHost()->releaseRef(m_HostData);\r\n}\r\n\t\r\nHostRef* HostRef::copy()\r\n{\r\n\treturn new HostRef(m_HostData);\r\n}\r\n\r\nvoid HostRef::release()\r\n{\r\n\tdelete this;\r\n}\r\n\r\nbool HostRef::isNull()\r\n{\r\n\treturn JPEnv::getHost()->isRefNull(m_HostData);\r\n}\r\n\r\nvoid* HostRef::data()\r\n{\r\n\treturn m_HostData;\r\n}\r\n\r\nJCharString::JCharString(const jchar* c)\r\n{\r\n\tm_Length = 0;\r\n\twhile (c[m_Length] != 0)\r\n\t{\r\n\t\tm_Length ++;\r\n\t}\r\n\t\r\n\tm_Value = new jchar[m_Length+1];\r\n\tm_Value[m_Length] = 0;\r\n\tfor (unsigned int i = 0; i < m_Length; i++)\r\n\t{\r\n\t\tm_Value[i] = c[i];\r\n\t}\r\n}\r\n\r\nJCharString::JCharString(const JCharString& c)\r\n{\r\n\tm_Length = c.m_Length;\r\n\tm_Value = new jchar[m_Length+1];\r\n\tm_Value[m_Length] = 0;\r\n\tfor (unsigned int i = 0; i < m_Length; i++)\r\n\t{\r\n\t\tm_Value[i] = c.m_Value[i];\r\n\t}\r\n\t\r\n}\r\n\r\nJCharString::JCharString(size_t len)\r\n{\r\n\tm_Length = len;\r\n\tm_Value = new jchar[len+1];\r\n\tfor (size_t i = 0; i <= len; i++)\r\n\t{\r\n\t\tm_Value[i] = 0;\r\n\t}\r\n}\r\n\r\nJCharString::~JCharString()\r\n{\r\n\tif (m_Value != NULL)\r\n\t{\r\n\t\tdelete[] m_Value;\r\n\t}\r\n}\r\n\t\r\nconst jchar* JCharString::c_str()\r\n{\r\n\treturn m_Value;\r\n}\r\n<commit_msg>use vector::insert in addAll methods instead of calling add* method for each element<commit_after>\/*****************************************************************************\r\n Copyright 2004-2008 Steve Menard\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n \r\n*****************************************************************************\/ \r\n#include <jpype.h>\r\n\r\nHostEnvironment* JPEnv::s_Host = NULL;\r\nJPJavaEnv* JPEnv::s_Java = NULL;\r\n\r\nvoid JPEnv::init(HostEnvironment* hostEnv)\r\n{\r\n\ts_Host = hostEnv;\r\n\t\r\n\tJPTypeName::init(); \r\n}\r\n\t\r\nvoid JPEnv::loadJVM(const string& vmPath, char ignoreUnrecognized, const StringVector& args)\r\n{\r\n\tTRACE_IN(\"JPEnv::loadJVM\");\r\n\t\r\n\tJavaVMInitArgs jniArgs;\r\n\tjniArgs.options = NULL;\r\n\t\r\n\tJPJavaEnv::load(vmPath);\r\n\r\n\t\/\/ prepare this ...\r\n\tjniArgs.version = JNI_VERSION_1_4;\r\n\tjniArgs.ignoreUnrecognized = ignoreUnrecognized;\r\n\t\t\r\n\tjniArgs.nOptions = (jint)args.size();\r\n\tjniArgs.options = (JavaVMOption*)malloc(sizeof(JavaVMOption)*jniArgs.nOptions);\r\n\tmemset(jniArgs.options, 0, sizeof(JavaVMOption)*jniArgs.nOptions);\r\n\t\r\n\tfor (int i = 0; i < jniArgs.nOptions; i++)\r\n\t{\r\n\t\tjniArgs.options[i].optionString = (char*)args[i].c_str();\r\n\t}\r\n\r\n\ts_Java = JPJavaEnv::CreateJavaVM((void*)&jniArgs);\r\n\tfree(jniArgs.options);\r\n \r\n\tif (s_Java == NULL) {\r\n\t\tRAISE(JPypeException, \"Unable to start JVM\");\r\n\t}\r\n\r\n\tJPTypeManager::init();\r\n\tJPJni::init();\r\n\tJPProxy::init();\r\n\r\n\tTRACE_OUT;\r\n}\r\n\r\nvoid JPEnv::attachJVM(const string& vmPath)\r\n{\r\n\tTRACE_IN(\"JPEnv::attachJVM\");\r\n\r\n\tJPJavaEnv::load(vmPath);\r\n\r\n\ts_Java = JPJavaEnv::GetCreatedJavaVM(); \r\n\t\r\n\tif (s_Java == NULL) {\r\n\t\tRAISE(JPypeException, \"Unable to attach to JVM\");\r\n\t}\r\n\r\n\tJPTypeManager::init();\r\n\tJPJni::init();\r\n\tJPProxy::init();\r\n\r\n\tTRACE_OUT;\r\n\t\r\n}\r\n\r\nvoid JPEnv::attachCurrentThread()\r\n{\r\n\ts_Java->AttachCurrentThread();\r\n}\r\n\r\nvoid JPEnv::attachCurrentThreadAsDaemon() \r\n{\r\n\ts_Java->AttachCurrentThreadAsDaemon();\r\n}\r\n\r\nbool JPEnv::isThreadAttached()\r\n{\r\n\treturn s_Java->isThreadAttached();\r\n}\r\n\r\n\r\nvoid JPEnv::registerRef(HostRef* ref, HostRef* targetRef)\r\n{\r\n\tTRACE_IN(\"JPEnv::registerRef\");\r\n\tJPObject* objRef = s_Host->asObject(ref);\r\n\tJPCleaner cleaner;\r\n\tTRACE1(\"A\");\r\n\tjobject srcObject = objRef->getObject();\r\n\tcleaner.addLocal(srcObject);\r\n\tJPJni::registerRef(s_Java->getReferenceQueue(), srcObject, (jlong)targetRef->copy());\r\n\tTRACE_OUT;\r\n\tTRACE1(\"B\");\r\n}\r\n\r\n\r\nstatic int jpype_traceLevel = 0;\r\n\r\n#ifdef JPYPE_TRACING_INTERNAL\r\n\tstatic const bool trace_internal = true; \r\n#else\r\n\tstatic const bool trace_internal = false;\r\n#endif\r\n\r\n\r\nvoid JPypeTracer::traceIn(const char* msg)\r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT << \"<B msg=\\\"\" << msg << \"\\\" >\" << endl;\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t\tjpype_traceLevel ++;\r\n\t}\r\n}\r\n\r\nvoid JPypeTracer::traceOut(const char* msg, bool error)\r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tjpype_traceLevel --;\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tif (error)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \"<\/B> <!-- !!!!!!!! EXCEPTION !!!!!! \" << msg << \" -->\" << endl;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \"<\/B> <!-- \" << msg << \" -->\" << endl;\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t}\r\n} \r\n\r\nvoid JPypeTracer::trace1(const char* name, const string& msg) \r\n{\r\n\tif (trace_internal)\r\n\t{\r\n\t\tfor (int i = 0; i < jpype_traceLevel; i++)\r\n\t\t{\r\n\t\t\tJPYPE_TRACING_OUTPUT << \" \";\r\n\t\t}\r\n\t\tJPYPE_TRACING_OUTPUT << \"<M>\" << name << \" : \" << msg << \"<\/M>\" << endl;\r\n\t\tJPYPE_TRACING_OUTPUT.flush();\r\n\t}\r\n}\r\n\r\nJPCleaner::JPCleaner()\r\n{\r\n}\r\n\r\nJPCleaner::~JPCleaner()\r\n{\r\n\/\/AT's comments on porting:\r\n\/\/ A variety of Unix compilers do not allow redifinition of the same variable in \"for\" cycless\r\n\tvector<jobject>::iterator cur;\r\n\tfor (cur = m_GlobalJavaObjects.begin(); cur != m_GlobalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tJPEnv::getJava()->DeleteGlobalRef(*cur);\r\n\t}\r\n\t\r\n\tfor (cur = m_LocalJavaObjects.begin(); cur != m_LocalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tJPEnv::getJava()->DeleteLocalRef(*cur);\r\n\t}\r\n\r\n\tfor (vector<HostRef*>::iterator cur2 = m_HostObjects.begin(); cur2 != m_HostObjects.end(); cur2++)\r\n\t{\r\n\t\t(*cur2)->release();\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addGlobal(jobject obj)\r\n{\r\n\tm_GlobalJavaObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::addLocal(jobject obj)\r\n{\r\n\tm_LocalJavaObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::add(HostRef* obj)\r\n{\r\n\tm_HostObjects.push_back(obj);\r\n}\r\n\r\nvoid JPCleaner::removeGlobal(jobject obj)\r\n{\r\n\tfor (vector<jobject>::iterator cur = m_GlobalJavaObjects.begin(); cur != m_GlobalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tif (*cur == obj)\r\n\t\t{\r\n\t\t\tm_GlobalJavaObjects.erase(cur);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeLocal(jobject obj)\r\n{\r\n\tfor (vector<jobject>::iterator cur = m_LocalJavaObjects.begin(); cur != m_LocalJavaObjects.end(); cur++)\r\n\t{\r\n\t\tif (*cur == obj)\r\n\t\t{\r\n\t\t\tm_LocalJavaObjects.erase(cur);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::remove(HostRef* obj)\r\n{\r\n\tfor (vector<HostRef*>::iterator cur2 = m_HostObjects.begin(); cur2 != m_HostObjects.end(); cur2++)\r\n\t{\r\n\t\tif (*cur2 == obj)\r\n\t\t{\r\n\t\t\tm_HostObjects.erase(cur2);\r\n\t\t\treturn;\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::addAllGlobal(vector<jobject>& r) \r\n{\r\n\tm_GlobalJavaObjects.insert(m_GlobalJavaObjects.end(), r.begin(), r.end());\r\n}\r\n\r\nvoid JPCleaner::addAllGlobal(vector<jclass>& r) \r\n{\r\n\tm_GlobalJavaObjects.insert(m_GlobalJavaObjects.end(), r.begin(), r.end());\r\n}\r\n\r\nvoid JPCleaner::addAllLocal(vector<jobject>& r) \r\n{\r\n\tm_LocalJavaObjects.insert(m_LocalJavaObjects.end(), r.begin(), r.end());\r\n}\r\n\r\nvoid JPCleaner::addAllLocal(vector<jclass>& r) \r\n{\r\n\tm_LocalJavaObjects.insert(m_LocalJavaObjects.end(), r.begin(), r.end());\r\n}\r\n\r\nvoid JPCleaner::addAll(vector<HostRef*>& r) \r\n{\r\n\tm_HostObjects.insert(m_HostObjects.end(), r.begin(), r.end());\r\n}\r\n\r\nvoid JPCleaner::removeAllGlobal(vector<jobject>& r)\r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremoveGlobal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeAllLocal(vector<jobject>& r)\r\n{\r\n\tfor (vector<jobject>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremoveLocal(*cur);\r\n\t}\r\n}\r\n\r\nvoid JPCleaner::removeAll(vector<HostRef*>& r)\r\n{\r\n\tfor (vector<HostRef*>::iterator cur = r.begin(); cur != r.end(); cur++)\r\n\t{\r\n\t\tremove(*cur);\r\n\t}\r\n}\r\n\r\nHostRef::HostRef(void* data, bool acquire)\r\n{\r\n\tif (acquire)\r\n\t{\r\n\t\tm_HostData = JPEnv::getHost()->acquireRef(data);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tm_HostData = data;\r\n\t}\r\n}\r\n\r\nHostRef::HostRef(void* data)\r\n{\r\n\tm_HostData = JPEnv::getHost()->acquireRef(data);\r\n}\r\n\r\nHostRef::~HostRef()\r\n{\r\n\tJPEnv::getHost()->releaseRef(m_HostData);\r\n}\r\n\t\r\nHostRef* HostRef::copy()\r\n{\r\n\treturn new HostRef(m_HostData);\r\n}\r\n\r\nvoid HostRef::release()\r\n{\r\n\tdelete this;\r\n}\r\n\r\nbool HostRef::isNull()\r\n{\r\n\treturn JPEnv::getHost()->isRefNull(m_HostData);\r\n}\r\n\r\nvoid* HostRef::data()\r\n{\r\n\treturn m_HostData;\r\n}\r\n\r\nJCharString::JCharString(const jchar* c)\r\n{\r\n\tm_Length = 0;\r\n\twhile (c[m_Length] != 0)\r\n\t{\r\n\t\tm_Length ++;\r\n\t}\r\n\t\r\n\tm_Value = new jchar[m_Length+1];\r\n\tm_Value[m_Length] = 0;\r\n\tfor (unsigned int i = 0; i < m_Length; i++)\r\n\t{\r\n\t\tm_Value[i] = c[i];\r\n\t}\r\n}\r\n\r\nJCharString::JCharString(const JCharString& c)\r\n{\r\n\tm_Length = c.m_Length;\r\n\tm_Value = new jchar[m_Length+1];\r\n\tm_Value[m_Length] = 0;\r\n\tfor (unsigned int i = 0; i < m_Length; i++)\r\n\t{\r\n\t\tm_Value[i] = c.m_Value[i];\r\n\t}\r\n\t\r\n}\r\n\r\nJCharString::JCharString(size_t len)\r\n{\r\n\tm_Length = len;\r\n\tm_Value = new jchar[len+1];\r\n\tfor (size_t i = 0; i <= len; i++)\r\n\t{\r\n\t\tm_Value[i] = 0;\r\n\t}\r\n}\r\n\r\nJCharString::~JCharString()\r\n{\r\n\tif (m_Value != NULL)\r\n\t{\r\n\t\tdelete[] m_Value;\r\n\t}\r\n}\r\n\t\r\nconst jchar* JCharString::c_str()\r\n{\r\n\treturn m_Value;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"BLITSaw_vst3_controller.h\"\r\n#include \"pluginterfaces\/base\/ibstream.h\"\r\n#include \"pluginterfaces\/base\/ustring.h\"\r\n#include \"pluginterfaces\/vst\/ivstmidicontrollers.h\"\r\n#include \"base\/source\/fstring.h\"\r\n#include \"vstgui\/plugin-bindings\/vst3editor.h\"\r\n\r\n#include <math.h>\r\n\r\nnamespace Steinberg {namespace Vst {\r\n\r\n\/\/-------------------------------------------------------------------------\r\n\/\/ BLITSaw_vst3_controller Implementation\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_vst3_controller::BLITSaw_vst3_controller()\r\n{\r\n\tsetKnobMode( kLinearMode );\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nFUnknown* BLITSaw_vst3_controller::create(void* context)\r\n{\r\n\treturn (IEditController*)new BLITSaw_vst3_controller();\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\ntresult PLUGIN_API BLITSaw_vst3_controller::initialize(FUnknown* context)\r\n{\r\n\ttresult result = EditController::initialize(context); \r\n\tif (result != kResultOk)\r\n\t{ \r\n\t\treturn result; \r\n\t}\r\n\r\n\tparameters.addParameter(new BLITSaw_FeedBackParameter());\r\n\tparameters.addParameter(new BLITSaw_CoarsePitchParameter());\r\n\tparameters.addParameter(new BLITSaw_FinePitchParameter());\r\n\tparameters.addParameter(new BLITSaw_AttackParameter());\r\n\tparameters.addParameter(new BLITSaw_ReleaseParameter());\r\n\tparameters.addParameter(new BLITSaw_CutoffParameter());\r\n\tparameters.addParameter(new BLITSaw_ResonanceParameter());\r\n\tparameters.addParameter(new BLITSaw_HighParameter());\r\n\tparameters.addParameter(new BLITSaw_BandParameter());\r\n\tparameters.addParameter(new BLITSaw_LowParameter());\r\n\r\n\treturn kResultOk;\r\n}\r\n\r\nIPlugView* PLUGIN_API BLITSaw_vst3_controller::createView (const char* name)\r\n{\r\n\t\/\/ TODO: とりあえずここで\r\n\tfor( int ii = 0; ii < parameters.getParameterCount(); ii++ )\r\n\t{\r\n\t\tperformEdit(ii, getParamNormalized(ii) );\r\n\t}\r\n\r\n\tif (name != nullptr && strcmp(name, ViewType::kEditor) == 0)\r\n\t{\r\n\t\tVST3Editor *editor= new VSTGUI::VST3Editor(this, \"view\", \"BLITSaw_vst3.uidesc\");\r\n\t\teditor->setIdleRate(50);\r\n\t\treturn editor;\r\n\t}\r\n\treturn nullptr;\r\n}\r\n\r\ntresult PLUGIN_API BLITSaw_vst3_controller::setComponentHandler(IComponentHandler* handler)\r\n{\r\n\ttresult result = EditController::setComponentHandler(handler);\r\n\tif (result != kResultOk)\r\n\t{ \r\n\t\treturn result; \r\n\t}\r\n\r\n\t\/\/for( int ii = 0; ii < parameters.getParameterCount(); ii++ )\r\n\t\/\/{\r\n\t\/\/\tperformEdit(ii, getParamNormalized(ii) );\r\n\t\/\/}\r\n\r\n\treturn kResultOk;\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_FeedBackParameter::BLITSaw_FeedBackParameter()\r\n\t:Parameter(L\"Feedback\", 0, L\"%%\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_FeedBackParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\",( 0.99 + 0.01 * normValue ) * 100);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_CoarsePitchParameter::BLITSaw_CoarsePitchParameter()\r\n\t:Parameter(L\"Coarse Pitch\", 1, L\"semitone\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_CoarsePitchParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%+d\", static_cast<int>( 48 * normValue + 0.5 ) - 24);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_FinePitchParameter::BLITSaw_FinePitchParameter()\r\n\t:Parameter(L\"Fine Pitch\", 2, L\"cent\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_FinePitchParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%+d\", static_cast<int>( 200 * normValue + 0.5 ) - 100);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_AttackParameter::BLITSaw_AttackParameter()\r\n\t:Parameter(L\"Attack Time\", 3, L\"msec\", 0.05)\r\n{\r\n}\r\n\r\nvoid BLITSaw_AttackParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue * 0.2);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_ReleaseParameter::BLITSaw_ReleaseParameter()\r\n\t:Parameter(L\"Release Time\", 4, L\"msec\", 0.05)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_ReleaseParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue * 0.2);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_CutoffParameter::BLITSaw_CutoffParameter()\r\n\t:Parameter(L\"Cutoff Frequency\", 5, L\"Hz\", 0.0)\r\n{\t\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_CutoffParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", 200.0 * ::pow(20.0, normValue));\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_ResonanceParameter::BLITSaw_ResonanceParameter()\r\n\t:Parameter(L\"Resonance\", 6, L\"\", 0.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_ResonanceParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", 0.70710678118654757274 * (1.0 - normValue) + 20.0*normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_HighParameter::BLITSaw_HighParameter()\r\n\t:Parameter(L\"High\", 7, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_HighParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_BandParameter::BLITSaw_BandParameter()\r\n\t:Parameter(L\"Band\", 8, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_BandParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_LowParameter::BLITSaw_LowParameter()\r\n\t:Parameter(L\"Low\", 9, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_LowParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n}}\r\n<commit_msg>不要なincludeを削除<commit_after>#include \"BLITSaw_vst3_controller.h\"\r\n#include \"vstgui\/plugin-bindings\/vst3editor.h\"\r\n#include <math.h>\r\n\r\nnamespace Steinberg {namespace Vst {\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_vst3_controller::BLITSaw_vst3_controller()\r\n{\r\n\tsetKnobMode( kLinearMode );\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nFUnknown* BLITSaw_vst3_controller::create(void* context)\r\n{\r\n\treturn (IEditController*)new BLITSaw_vst3_controller();\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\ntresult PLUGIN_API BLITSaw_vst3_controller::initialize(FUnknown* context)\r\n{\r\n\ttresult result = EditController::initialize(context); \r\n\tif (result != kResultOk)\r\n\t{ \r\n\t\treturn result; \r\n\t}\r\n\r\n\tparameters.addParameter(new BLITSaw_FeedBackParameter());\r\n\tparameters.addParameter(new BLITSaw_CoarsePitchParameter());\r\n\tparameters.addParameter(new BLITSaw_FinePitchParameter());\r\n\tparameters.addParameter(new BLITSaw_AttackParameter());\r\n\tparameters.addParameter(new BLITSaw_ReleaseParameter());\r\n\tparameters.addParameter(new BLITSaw_CutoffParameter());\r\n\tparameters.addParameter(new BLITSaw_ResonanceParameter());\r\n\tparameters.addParameter(new BLITSaw_HighParameter());\r\n\tparameters.addParameter(new BLITSaw_BandParameter());\r\n\tparameters.addParameter(new BLITSaw_LowParameter());\r\n\r\n\treturn kResultOk;\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nIPlugView* PLUGIN_API BLITSaw_vst3_controller::createView (const char* name)\r\n{\r\n\t\/\/ TODO: とりあえずここで\r\n\tfor( int ii = 0; ii < parameters.getParameterCount(); ii++ )\r\n\t{\r\n\t\tperformEdit(ii, getParamNormalized(ii) );\r\n\t}\r\n\r\n\tif (name != nullptr && strcmp(name, ViewType::kEditor) == 0)\r\n\t{\r\n\t\tVST3Editor *editor= new VSTGUI::VST3Editor(this, \"view\", \"BLITSaw_vst3.uidesc\");\r\n\t\teditor->setIdleRate(50);\r\n\t\treturn editor;\r\n\t}\r\n\treturn nullptr;\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\ntresult PLUGIN_API BLITSaw_vst3_controller::setComponentHandler(IComponentHandler* handler)\r\n{\r\n\ttresult result = EditController::setComponentHandler(handler);\r\n\tif (result != kResultOk)\r\n\t{ \r\n\t\treturn result; \r\n\t}\r\n\r\n\t\/\/for( int ii = 0; ii < parameters.getParameterCount(); ii++ )\r\n\t\/\/{\r\n\t\/\/\tperformEdit(ii, getParamNormalized(ii) );\r\n\t\/\/}\r\n\r\n\treturn kResultOk;\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_FeedBackParameter::BLITSaw_FeedBackParameter()\r\n\t:Parameter(L\"Feedback\", 0, L\"%%\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_FeedBackParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\",( 0.99 + 0.01 * normValue ) * 100);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_CoarsePitchParameter::BLITSaw_CoarsePitchParameter()\r\n\t:Parameter(L\"Coarse Pitch\", 1, L\"semitone\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_CoarsePitchParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%+d\", static_cast<int>( 48 * normValue + 0.5 ) - 24);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_FinePitchParameter::BLITSaw_FinePitchParameter()\r\n\t:Parameter(L\"Fine Pitch\", 2, L\"cent\", 0.5)\r\n{\r\n}\r\n\r\nvoid BLITSaw_FinePitchParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%+d\", static_cast<int>( 200 * normValue + 0.5 ) - 100);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_AttackParameter::BLITSaw_AttackParameter()\r\n\t:Parameter(L\"Attack Time\", 3, L\"msec\", 0.05)\r\n{\r\n}\r\n\r\nvoid BLITSaw_AttackParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue * 0.2);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_ReleaseParameter::BLITSaw_ReleaseParameter()\r\n\t:Parameter(L\"Release Time\", 4, L\"msec\", 0.05)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_ReleaseParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue * 0.2);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_CutoffParameter::BLITSaw_CutoffParameter()\r\n\t:Parameter(L\"Cutoff Frequency\", 5, L\"Hz\", 0.0)\r\n{\t\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_CutoffParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", 200.0 * ::pow(20.0, normValue));\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_ResonanceParameter::BLITSaw_ResonanceParameter()\r\n\t:Parameter(L\"Resonance\", 6, L\"\", 0.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_ResonanceParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", 0.70710678118654757274 * (1.0 - normValue) + 20.0*normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_HighParameter::BLITSaw_HighParameter()\r\n\t:Parameter(L\"High\", 7, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_HighParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_BandParameter::BLITSaw_BandParameter()\r\n\t:Parameter(L\"Band\", 8, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_BandParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nBLITSaw_LowParameter::BLITSaw_LowParameter()\r\n\t:Parameter(L\"Low\", 9, L\"\", 1.0)\r\n{\r\n}\r\n\r\n\/\/-------------------------------------------------------------------------\r\nvoid BLITSaw_LowParameter::toString(ParamValue normValue, String128 string)const\r\n{\r\n\t::swprintf_s(string, 128, L\"%.3f\", normValue);\r\n}\r\n\r\n}}\r\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n * Copyright (c) 2012-2019 by the DataTransferKit authors *\n * All rights reserved. *\n * *\n * This file is part of the DataTransferKit library. DataTransferKit is *\n * distributed under a BSD 3-clause license. For the licensing terms see *\n * the LICENSE file in the top-level directory. *\n * *\n * SPDX-License-Identifier: BSD-3-Clause *\n ****************************************************************************\/\n\n#include <DTK_DetailsAlgorithms.hpp>\n\n#include <Teuchos_UnitTestHarness.hpp>\n\n#include \"DTK_BoostGeometryAdapters.hpp\"\n\nnamespace bg = boost::geometry;\nnamespace dtk = DataTransferKit::Details;\n\/\/ Conveniently importing Point and Box in DataTransferKit::Details:: namespace\n\/\/ and declaring type aliases within boost::geometry:: so that we are able to\n\/\/ just use dtk:: and bg:: to specify what geometry or algorithm we mean.\nnamespace DataTransferKit\n{\nnamespace Details\n{\nusing DataTransferKit::Box;\nusing DataTransferKit::Point;\n} \/\/ namespace Details\n} \/\/ namespace DataTransferKit\nnamespace boost\n{\nnamespace geometry\n{\nusing Point = model::point<double, 3, cs::cartesian>;\nusing Box = model::box<Point>;\n} \/\/ namespace geometry\n} \/\/ namespace boost\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, equals )\n{\n dtk::Point point = {{1., 2., 3.}};\n TEST_ASSERT( dtk::equals( point, {{1., 2., 3.}} ) );\n TEST_ASSERT( !dtk::equals( point, {{0., 0., 0.}} ) );\n TEST_ASSERT( bg::equals( point, bg::make<dtk::Point>( 1., 2., 3. ) ) );\n TEST_ASSERT( !bg::equals( point, bg::make<dtk::Point>( 4., 5., 6. ) ) );\n TEST_ASSERT( bg::equals( point, bg::make<bg::Point>( 1., 2., 3. ) ) );\n TEST_ASSERT( !bg::equals( point, bg::make<bg::Point>( 0., 0., 0. ) ) );\n\n dtk::Box box = {{{1., 2., 3.}}, {{4., 5., 6.}}};\n TEST_ASSERT( dtk::equals( box, {{{1., 2., 3.}}, {{4., 5., 6.}}} ) );\n TEST_ASSERT( !dtk::equals( box, {{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n TEST_ASSERT( bg::equals( box, dtk::Box{{{1., 2., 3.}}, {{4., 5., 6.}}} ) );\n TEST_ASSERT( !bg::equals( box, dtk::Box{{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n TEST_ASSERT(\n bg::equals( box, bg::Box( bg::make<bg::Point>( 1., 2., 3. ),\n bg::make<bg::Point>( 4., 5., 6. ) ) ) );\n TEST_ASSERT(\n !bg::equals( box, bg::Box( bg::make<bg::Point>( 0., 0., 0. ),\n bg::make<bg::Point>( 1., 1., 1. ) ) ) );\n \/\/ Now just for fun compare the DTK box to a Boost.Geometry box composed of\n \/\/ DTK points.\n TEST_ASSERT( bg::equals(\n box, bg::model::box<dtk::Point>( {{1., 2., 3.}}, {{4., 5., 6.}} ) ) );\n TEST_ASSERT( !bg::equals(\n box, bg::model::box<dtk::Point>( {{0., 0., 0.}}, {{0., 0., 0.}} ) ) );\n}\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, distance )\n{\n \/\/ NOTE unsure if should test for floating point equality here\n dtk::Point a = {{0., 0., 0.}};\n dtk::Point b = {{0., 1., 0.}};\n TEST_EQUALITY( dtk::distance( a, b ), 1. );\n TEST_EQUALITY( bg::distance( a, b ), 1. );\n\n std::tie( a, b ) = std::make_pair<dtk::Point, dtk::Point>( {{0., 0., 0.}},\n {{1., 1., 1.}} );\n TEST_EQUALITY( dtk::distance( a, b ), std::sqrt( 3. ) );\n TEST_EQUALITY( bg::distance( a, b ), std::sqrt( 3. ) );\n\n TEST_EQUALITY( dtk::distance( a, a ), 0. );\n TEST_EQUALITY( bg::distance( a, a ), 0. );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n dtk::Point p = {{.5, .5, .5}};\n \/\/ NOTE DTK has no overload distance( Box, Point )\n TEST_EQUALITY( dtk::distance( p, unit_box ), 0. );\n \/\/ TEST_EQUALITY( dtk::distance( unit_box, p ), 0. );\n TEST_EQUALITY( bg::distance( p, unit_box ), 0. );\n TEST_EQUALITY( bg::distance( unit_box, p ), 0. );\n\n p = {{-1., -1., -1.}};\n TEST_EQUALITY( dtk::distance( p, unit_box ), std::sqrt( 3. ) );\n TEST_EQUALITY( bg::distance( p, unit_box ), std::sqrt( 3. ) );\n\n p = {{-1., .5, -1.}};\n TEST_EQUALITY( dtk::distance( p, unit_box ), std::sqrt( 2. ) );\n TEST_EQUALITY( bg::distance( p, unit_box ), std::sqrt( 2. ) );\n\n p = {{-1., .5, .5}};\n TEST_EQUALITY( dtk::distance( p, unit_box ), 1. );\n TEST_EQUALITY( bg::distance( p, unit_box ), 1. );\n}\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, expand )\n{\n using dtk::equals;\n dtk::Box box;\n \/\/ NOTE even though not considered valid, default constructed DTK box can be\n \/\/ expanded using Boost.Geometry algorithm.\n TEST_ASSERT( !bg::is_valid( box ) );\n bg::expand( box, dtk::Point{{0., 0., 0.}} );\n dtk::expand( box, {{1., 1., 1.}} );\n TEST_ASSERT( equals( box, {{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n bg::expand( box, dtk::Box{{{1., 2., 3.}}, {{4., 5., 6.}}} );\n dtk::expand( box, {{{-1., -2., -3.}}, {{0., 0., 0.}}} );\n TEST_ASSERT( equals( box, {{{-1., -2., -3.}}, {{4., 5., 6.}}} ) );\n}\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, centroid )\n{\n using dtk::equals;\n \/\/ For convenience define a function that returns the centroid.\n \/\/ Boost.Geometry defines both `void centroid(Geometry const & geometry,\n \/\/ Point &c )` and `Point return_centroid(Geometry const& geometry)`\n auto const dtkReturnCentroid = []( dtk::Box b ) {\n dtk::Point c;\n dtk::centroid( b, c );\n return c;\n };\n\n \/\/ Interestingly enough, even though for Boost.Geometry, the DTK default\n \/\/ constructed \"empty\" box is not valid, it will still calculate its\n \/\/ centroid. Admittedly, the result (centroid at origin) is garbage :)\n dtk::Box empty_box = {};\n TEST_ASSERT( !bg::is_valid( empty_box ) );\n TEST_ASSERT( equals( bg::return_centroid<dtk::Point>( empty_box ),\n {{0., 0., 0.}} ) );\n TEST_ASSERT( equals( dtkReturnCentroid( empty_box ), {{0., 0., 0.}} ) );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n TEST_ASSERT(\n equals( bg::return_centroid<dtk::Point>( unit_box ), {{.5, .5, .5}} ) );\n TEST_ASSERT( equals( dtkReturnCentroid( unit_box ), {{.5, .5, .5}} ) );\n\n \/\/ NOTE DTK does not have an overload of centroid() for Point at the\n \/\/ moment.\n dtk::Point a_point = {{1., 2., 3.}};\n TEST_ASSERT(\n equals( bg::return_centroid<dtk::Point>( a_point ), a_point ) );\n \/\/ TEST_ASSERT( equals( dtk::centroid(\n \/\/ []( dtk::Point p ) {\n \/\/ dtk::Point c;\n \/\/ dtk::centroid( p, c );\n \/\/ return c;\n \/\/ }( a_point ),\n \/\/ a_point ) ) );\n}\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, is_valid )\n{\n \/\/ NOTE \"empty\" box is considered as valid in DataTransferKit but it is\n \/\/ not according to Boost.Geometry\n dtk::Box empty_box = {};\n TEST_ASSERT( dtk::isValid( empty_box ) );\n std::string message;\n TEST_ASSERT( !bg::is_valid( empty_box, message ) );\n TEST_EQUALITY( message, \"Box has corners in wrong order\" );\n\n \/\/ Same issue with infinitesimal box around a point (here the origin)\n dtk::Box a_box = {{{0., 0., 0.}}, {{0., 0., 0.}}};\n TEST_ASSERT( dtk::isValid( a_box ) );\n TEST_ASSERT( !bg::is_valid( a_box, message ) );\n TEST_EQUALITY( message, \"Geometry has wrong topological dimension\" );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n TEST_ASSERT( dtk::isValid( unit_box ) );\n TEST_ASSERT( bg::is_valid( unit_box ) );\n\n dtk::Box invalid_box = {{{1., 2., 3.}}, {{4., NAN, 6.}}};\n TEST_ASSERT( !dtk::isValid( invalid_box ) );\n TEST_ASSERT( !bg::is_valid( invalid_box, message ) );\n TEST_EQUALITY( message,\n \"Geometry has point(s) with invalid coordinate(s)\" );\n\n dtk::Point a_point = {{1., 2., 3.}};\n TEST_ASSERT( dtk::isValid( a_point ) );\n TEST_ASSERT( bg::is_valid( a_point ) );\n\n auto const infty = std::numeric_limits<double>::infinity();\n dtk::Point invalid_point = {{infty, 1.41, 3.14}};\n TEST_ASSERT( !dtk::isValid( invalid_point ) );\n TEST_ASSERT( !bg::is_valid( invalid_point, message ) );\n TEST_EQUALITY( message,\n \"Geometry has point(s) with invalid coordinate(s)\" );\n\n \/\/ Also Boost.Geometry has a is_empty() algorithm but it has a different\n \/\/ meaning, it checks whether a geometry is an empty set and always returns\n \/\/ false for a point or a box.\n TEST_ASSERT( !bg::is_empty( empty_box ) );\n TEST_ASSERT( !bg::is_empty( a_box ) );\n TEST_ASSERT( !bg::is_empty( unit_box ) );\n}\n\nTEUCHOS_UNIT_TEST( BoostGeometryAdapters, intersects )\n{\n dtk::Box const unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n\n \/\/ self-intersection\n TEST_ASSERT( dtk::intersects( unit_box, unit_box ) );\n TEST_ASSERT( bg::intersects( unit_box, unit_box ) );\n\n \/\/ share a corner\n dtk::Box other_box = {{{1., 1., 1.}}, {{2., 2., 2.}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ share an edge\n other_box = {{{1., 0., 1.}}, {{2., 1., 2.}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ share a face\n other_box = {{{0., -1., 0.}}, {{1., 0., 1.}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ contains the other box\n other_box = {{{.3, .3, .3}}, {{.6, .6, .6}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ within the other box\n other_box = {{{-1., -1., -1.}}, {{2., 2., 2.}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ overlapping\n other_box = {{{.5, .5, .5}}, {{2., 2., 2.}}};\n TEST_ASSERT( dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( bg::intersects( unit_box, other_box ) );\n\n \/\/ disjoint\n other_box = {{{1., 2., 3.}}, {{4., 5., 6.}}};\n TEST_ASSERT( !dtk::intersects( unit_box, other_box ) );\n TEST_ASSERT( !bg::intersects( unit_box, other_box ) );\n}\n<commit_msg>Remove Teuchos UTF in test for Boost.Geometry adapters<commit_after>\/****************************************************************************\n * Copyright (c) 2012-2019 by the DataTransferKit authors *\n * All rights reserved. *\n * *\n * This file is part of the DataTransferKit library. DataTransferKit is *\n * distributed under a BSD 3-clause license. For the licensing terms see *\n * the LICENSE file in the top-level directory. *\n * *\n * SPDX-License-Identifier: BSD-3-Clause *\n ****************************************************************************\/\n\n#include \"DTK_BoostGeometryAdapters.hpp\"\n\n#include <DTK_DetailsAlgorithms.hpp>\n\n#include <boost\/test\/unit_test.hpp>\n\n#define BOOST_TEST_MODULE BoostGeometryAdapters\n\nnamespace bg = boost::geometry;\nnamespace dtk = DataTransferKit::Details;\n\/\/ Conveniently importing Point and Box in DataTransferKit::Details:: namespace\n\/\/ and declaring type aliases within boost::geometry:: so that we are able to\n\/\/ just use dtk:: and bg:: to specify what geometry or algorithm we mean.\nnamespace DataTransferKit\n{\nnamespace Details\n{\nusing DataTransferKit::Box;\nusing DataTransferKit::Point;\n} \/\/ namespace Details\n} \/\/ namespace DataTransferKit\nnamespace boost\n{\nnamespace geometry\n{\nusing Point = model::point<double, 3, cs::cartesian>;\nusing Box = model::box<Point>;\n} \/\/ namespace geometry\n} \/\/ namespace boost\n\nBOOST_AUTO_TEST_CASE( equals )\n{\n dtk::Point point = {{1., 2., 3.}};\n BOOST_TEST( dtk::equals( point, {{1., 2., 3.}} ) );\n BOOST_TEST( !dtk::equals( point, {{0., 0., 0.}} ) );\n BOOST_TEST( bg::equals( point, bg::make<dtk::Point>( 1., 2., 3. ) ) );\n BOOST_TEST( !bg::equals( point, bg::make<dtk::Point>( 4., 5., 6. ) ) );\n BOOST_TEST( bg::equals( point, bg::make<bg::Point>( 1., 2., 3. ) ) );\n BOOST_TEST( !bg::equals( point, bg::make<bg::Point>( 0., 0., 0. ) ) );\n\n dtk::Box box = {{{1., 2., 3.}}, {{4., 5., 6.}}};\n BOOST_TEST( dtk::equals( box, {{{1., 2., 3.}}, {{4., 5., 6.}}} ) );\n BOOST_TEST( !dtk::equals( box, {{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n BOOST_TEST( bg::equals( box, dtk::Box{{{1., 2., 3.}}, {{4., 5., 6.}}} ) );\n BOOST_TEST( !bg::equals( box, dtk::Box{{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n BOOST_TEST(\n bg::equals( box, bg::Box( bg::make<bg::Point>( 1., 2., 3. ),\n bg::make<bg::Point>( 4., 5., 6. ) ) ) );\n BOOST_TEST(\n !bg::equals( box, bg::Box( bg::make<bg::Point>( 0., 0., 0. ),\n bg::make<bg::Point>( 1., 1., 1. ) ) ) );\n \/\/ Now just for fun compare the DTK box to a Boost.Geometry box composed of\n \/\/ DTK points.\n BOOST_TEST( bg::equals(\n box, bg::model::box<dtk::Point>( {{1., 2., 3.}}, {{4., 5., 6.}} ) ) );\n BOOST_TEST( !bg::equals(\n box, bg::model::box<dtk::Point>( {{0., 0., 0.}}, {{0., 0., 0.}} ) ) );\n}\n\nBOOST_AUTO_TEST_CASE( distance )\n{\n \/\/ NOTE unsure if should test for floating point equality here\n dtk::Point a = {{0., 0., 0.}};\n dtk::Point b = {{0., 1., 0.}};\n BOOST_TEST( dtk::distance( a, b ) == 1. );\n BOOST_TEST( bg::distance( a, b ) == 1. );\n\n std::tie( a, b ) = std::make_pair<dtk::Point, dtk::Point>( {{0., 0., 0.}},\n {{1., 1., 1.}} );\n BOOST_TEST( dtk::distance( a, b ) == std::sqrt( 3. ) );\n BOOST_TEST( bg::distance( a, b ) == std::sqrt( 3. ) );\n\n BOOST_TEST( dtk::distance( a, a ) == 0. );\n BOOST_TEST( bg::distance( a, a ) == 0. );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n dtk::Point p = {{.5, .5, .5}};\n \/\/ NOTE DTK has no overload distance( Box, Point )\n BOOST_TEST( dtk::distance( p, unit_box ) == 0. );\n \/\/ BOOST_TEST( dtk::distance( unit_box, p ) == 0. );\n BOOST_TEST( bg::distance( p, unit_box ) == 0. );\n BOOST_TEST( bg::distance( unit_box, p ) == 0. );\n\n p = {{-1., -1., -1.}};\n BOOST_TEST( dtk::distance( p, unit_box ) == std::sqrt( 3. ) );\n BOOST_TEST( bg::distance( p, unit_box ) == std::sqrt( 3. ) );\n\n p = {{-1., .5, -1.}};\n BOOST_TEST( dtk::distance( p, unit_box ) == std::sqrt( 2. ) );\n BOOST_TEST( bg::distance( p, unit_box ) == std::sqrt( 2. ) );\n\n p = {{-1., .5, .5}};\n BOOST_TEST( dtk::distance( p, unit_box ) == 1. );\n BOOST_TEST( bg::distance( p, unit_box ) == 1. );\n}\n\nBOOST_AUTO_TEST_CASE( expand )\n{\n using dtk::equals;\n dtk::Box box;\n \/\/ NOTE even though not considered valid, default constructed DTK box can be\n \/\/ expanded using Boost.Geometry algorithm.\n BOOST_TEST( !bg::is_valid( box ) );\n bg::expand( box, dtk::Point{{0., 0., 0.}} );\n dtk::expand( box, {{1., 1., 1.}} );\n BOOST_TEST( equals( box, {{{0., 0., 0.}}, {{1., 1., 1.}}} ) );\n bg::expand( box, dtk::Box{{{1., 2., 3.}}, {{4., 5., 6.}}} );\n dtk::expand( box, {{{-1., -2., -3.}}, {{0., 0., 0.}}} );\n BOOST_TEST( equals( box, {{{-1., -2., -3.}}, {{4., 5., 6.}}} ) );\n}\n\nBOOST_AUTO_TEST_CASE( centroid )\n{\n using dtk::equals;\n \/\/ For convenience define a function that returns the centroid.\n \/\/ Boost.Geometry defines both `void centroid(Geometry const & geometry,\n \/\/ Point &c )` and `Point return_centroid(Geometry const& geometry)`\n auto const dtkReturnCentroid = []( dtk::Box b ) {\n dtk::Point c;\n dtk::centroid( b, c );\n return c;\n };\n\n \/\/ Interestingly enough, even though for Boost.Geometry, the DTK default\n \/\/ constructed \"empty\" box is not valid, it will still calculate its\n \/\/ centroid. Admittedly, the result (centroid at origin) is garbage :)\n dtk::Box empty_box = {};\n BOOST_TEST( !bg::is_valid( empty_box ) );\n BOOST_TEST( equals( bg::return_centroid<dtk::Point>( empty_box ),\n {{0., 0., 0.}} ) );\n BOOST_TEST( equals( dtkReturnCentroid( empty_box ), {{0., 0., 0.}} ) );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n BOOST_TEST(\n equals( bg::return_centroid<dtk::Point>( unit_box ), {{.5, .5, .5}} ) );\n BOOST_TEST( equals( dtkReturnCentroid( unit_box ), {{.5, .5, .5}} ) );\n\n \/\/ NOTE DTK does not have an overload of centroid() for Point at the\n \/\/ moment.\n dtk::Point a_point = {{1., 2., 3.}};\n BOOST_TEST( equals( bg::return_centroid<dtk::Point>( a_point ), a_point ) );\n \/\/ BOOST_TEST( equals( dtk::centroid(\n \/\/ []( dtk::Point p ) {\n \/\/ dtk::Point c;\n \/\/ dtk::centroid( p, c );\n \/\/ return c;\n \/\/ }( a_point ),\n \/\/ a_point ) ) );\n}\n\nBOOST_AUTO_TEST_CASE( is_valid )\n{\n \/\/ NOTE \"empty\" box is considered as valid in DataTransferKit but it is\n \/\/ not according to Boost.Geometry\n dtk::Box empty_box = {};\n BOOST_TEST( dtk::isValid( empty_box ) );\n std::string message;\n BOOST_TEST( !bg::is_valid( empty_box, message ) );\n BOOST_TEST( message == \"Box has corners in wrong order\" );\n\n \/\/ Same issue with infinitesimal box around a point (here the origin)\n dtk::Box a_box = {{{0., 0., 0.}}, {{0., 0., 0.}}};\n BOOST_TEST( dtk::isValid( a_box ) );\n BOOST_TEST( !bg::is_valid( a_box, message ) );\n BOOST_TEST( message == \"Geometry has wrong topological dimension\" );\n\n dtk::Box unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n BOOST_TEST( dtk::isValid( unit_box ) );\n BOOST_TEST( bg::is_valid( unit_box ) );\n\n dtk::Box invalid_box = {{{1., 2., 3.}}, {{4., NAN, 6.}}};\n BOOST_TEST( !dtk::isValid( invalid_box ) );\n BOOST_TEST( !bg::is_valid( invalid_box, message ) );\n BOOST_TEST( message == \"Geometry has point(s) with invalid coordinate(s)\" );\n\n dtk::Point a_point = {{1., 2., 3.}};\n BOOST_TEST( dtk::isValid( a_point ) );\n BOOST_TEST( bg::is_valid( a_point ) );\n\n auto const infty = std::numeric_limits<double>::infinity();\n dtk::Point invalid_point = {{infty, 1.41, 3.14}};\n BOOST_TEST( !dtk::isValid( invalid_point ) );\n BOOST_TEST( !bg::is_valid( invalid_point, message ) );\n BOOST_TEST( message == \"Geometry has point(s) with invalid coordinate(s)\" );\n\n \/\/ Also Boost.Geometry has a is_empty() algorithm but it has a different\n \/\/ meaning, it checks whether a geometry is an empty set and always returns\n \/\/ false for a point or a box.\n BOOST_TEST( !bg::is_empty( empty_box ) );\n BOOST_TEST( !bg::is_empty( a_box ) );\n BOOST_TEST( !bg::is_empty( unit_box ) );\n}\n\nBOOST_AUTO_TEST_CASE( intersects )\n{\n dtk::Box const unit_box = {{{0., 0., 0.}}, {{1., 1., 1.}}};\n\n \/\/ self-intersection\n BOOST_TEST( dtk::intersects( unit_box, unit_box ) );\n BOOST_TEST( bg::intersects( unit_box, unit_box ) );\n\n \/\/ share a corner\n dtk::Box other_box = {{{1., 1., 1.}}, {{2., 2., 2.}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ share an edge\n other_box = {{{1., 0., 1.}}, {{2., 1., 2.}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ share a face\n other_box = {{{0., -1., 0.}}, {{1., 0., 1.}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ contains the other box\n other_box = {{{.3, .3, .3}}, {{.6, .6, .6}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ within the other box\n other_box = {{{-1., -1., -1.}}, {{2., 2., 2.}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ overlapping\n other_box = {{{.5, .5, .5}}, {{2., 2., 2.}}};\n BOOST_TEST( dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( bg::intersects( unit_box, other_box ) );\n\n \/\/ disjoint\n other_box = {{{1., 2., 3.}}, {{4., 5., 6.}}};\n BOOST_TEST( !dtk::intersects( unit_box, other_box ) );\n BOOST_TEST( !bg::intersects( unit_box, other_box ) );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/2014.04.01 - 2014.04.02 Gustaf - CTG.\n\n\n\/* OBJECTIVE :\n\n\n\n=== PLAN ===\n\n- Function to identify the start and end positions of the target inside the source string.\n ok- Convert to a function and Test functionality.\n\n - Return a dynamic array.\n For each target string, just the initial position is needed.\n The final can be calculated easily with the length of the target string.\n\n*\/\n\n\n\n#include <iostream>\n\nusing namespace std;\n\n\n\ntypedef char *arrayString;\ntypedef int *arrayInt;\n\n\nstruct posIniNode\n{\n int posInitial;\n\n posIniNode *next; \/\/ Pointer to the same struct.\n};\n\ntypedef posIniNode *posList;\n\n\n\nint lengthFunction(arrayString s)\n{\n \/\/ Determine the length of a string array.\n int count = 0;\n while (s[count] != 0) \/\/ not includes the \"null terminator\".\n {\n count++;\n }\n return count;\n}\n\n\n\nvoid identifyLimits (arrayString sourceStr, arrayString targetStr, arrayInt &arrayLimitsResult)\n{\n\n int posIni = -1, posFinal = -1;\n\n\n const int RESULT_SIZE = 2;\n arrayInt newArrayLimits = new int[RESULT_SIZE]; \/\/ At the end it is going to point to: arrayLimitsResult.\n\n\n int SOURCE_SIZE = lengthFunction(sourceStr);\n int TARGET_SIZE = lengthFunction(targetStr);\n\n\n \/\/ -----------------------------------\n \/\/ -----------------------------------\n\n\n posIni = -1, posFinal = -1;\n for (int i = 0; i < SOURCE_SIZE; ++i)\n {\n\n \/\/ Find first character.\n if ( (posIni == -1) && (posFinal == -1) && (sourceStr[i] == targetStr[0]) )\n {\n posIni = i;\n\n\n \/\/ Handles special case of one character.\n if (TARGET_SIZE == 1)\n {\n cout << \"Target initial\/final - index: \" << targetStr[0] << \" - \" << posIni << endl;\n cout << endl;\n\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n\n\n \/\/ Handles cases from two characters until ...\n for (int j = 1; j < TARGET_SIZE; ++j)\n {\n\n \/\/ Check second adjacent character.\n if ( (posFinal == -1) && ( (i + j) == (posIni + j)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n }\n\n if (sourceStr[i + j] != targetStr[j])\n {\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n }\n\n\n \/\/ Check next adjacent character. BUT not the last.\n if ( (posFinal != -1) && ((i + j) == (posIni + j)) && (j <= (TARGET_SIZE - 2)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n }\n\n if (sourceStr[i + j] != targetStr[j])\n {\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n }\n\n\n \/\/ Check last adjacent character.\n if ( (posFinal != -1) && ((i + j) == (posIni + j)) && (j == (TARGET_SIZE - 1)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n\n cout << \"Target initial - index: \" << targetStr[0] << \" - \" << posIni << endl;\n cout << \"Target final - index: \" << targetStr[j] << \" - \" << posFinal << endl;\n cout << endl;\n }\n\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n\n } \/\/ internal for\n } \/\/ if that check the first character.\n\n } \/\/ external for\n\n\n\n\n \/\/ -----------------------------------\n \/\/ -----------------------------------\n\n\n\n\n\n\n \/\/ ---\n \/\/ To avoid a memory leak, we have to deallocate the array in the heap\n \/\/ that our parameter originally pointed to.\n delete[] arrayLimitsResult;\n\n arrayLimitsResult = newArrayLimits;\n}\n\n\n\nvoid identifyLimitsTester ()\n{\n\n const int ARRAY_SIZE = 9;\n arrayString a = new char[ARRAY_SIZE];\n\n a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'd';\n a[4] = 'a'; a[5] = 'b'; a[6] = 'c'; a[7] = 'e'; a[8] = 0;\n\n\n \/\/ -- Different tests for the TARGET STRING\n\n \/\/ const int TARGET_SIZE = 9;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 'd';\n \/\/ t[4] = 'a'; t[5] = 'b'; t[6] = 'c'; t[7] = 'e'; t[8] = 'f'; t[9] = 0;\n\n \/\/ const int TARGET_SIZE = 8;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 'd';\n \/\/ t[4] = 'a'; t[5] = 'b'; t[6] = 'c'; t[7] = 'e'; t[8] = 0;\n\n \/\/ const int TARGET_SIZE = 4;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 0;\n\n \/\/ const int TARGET_SIZE = 3;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 0;\n\n const int TARGET_SIZE = 2; arrayString t = new char[TARGET_SIZE];\n t[0] = 'a'; t[1] = 0;\n\n \/\/\/ ---\n\n\n\n\n\n\/\/--------------------------\n\n const int RESULT_SIZE = 1;\n arrayInt resultLimits = new int[RESULT_SIZE];\n\n\n\/*=================\n\n\nstruct posIniNode\n{\n int posInitial;\n\n posIniNode *next; \/\/ Pointer to the same struct.\n};\n\ntypedef posIniNode *posList;\n==========================\n\n*\/\n\n\n \/\/ -- Linked list\n\n \/\/ Head pointer\n posList resultLimits; \n\n \/\/ Nodes\n posIniNode *node1 = new posIniNode;\n node1 -> posInitial = -1;\n\n \/\/Linked list of just one node.\n resultLimits = node1;\n node1 -> next = NULL;\n\n \/\/ Cleaning things up to avoid cross-linking.\n node1 = NULL;\n\n\n\/\/-------------------------------------------------\n\n\n cout << \"Initial string : \" << a << endl;\n cout << \"Target string : \" << t << endl;\n cout << endl;\n identifyLimits(a, t, resultLimits);\n\n\n\n \/\/ Free dynamic memory.\n delete[] a;\n delete[] t;\n delete[] resultLimits;\n\n}\n\n\n\nint main()\n{\n cout << \"Variable-Length String Manipulation. Function to identify limits.\" << endl;\n identifyLimitsTester();\n\n\n cout << endl;\n return 0;\n}\n<commit_msg>Chapter 04 exercice 4-3 partial progress. Now return a linked list of (JUST ONE) target positions. Work in progress.<commit_after>\/\/2014.04.01 - 2014.04.02 - 2014.04.03 Gustaf - CTG.\n\n\n\/* OBJECTIVE :\n\n\n\n=== PLAN ===\n\n- Function to identify the start and end positions of the target inside the source string.\n ok- Convert to a function and Test functionality.\n\n - Return a list with the positions.\n For each target string, just the initial position is needed.\n The final can be calculated easily with the length of the target string.\n\n*\/\n\n\n\n#include <iostream>\n\nusing namespace std;\n\n\n\ntypedef char *arrayString;\ntypedef int *arrayInt;\n\n\nstruct posIniNode\n{\n int posInitial;\n\n posIniNode *next; \/\/ Pointer to the same struct.\n};\n\ntypedef posIniNode *posList; \/\/ type reserved for the head pointer.\n\n\n\nint lengthFunction(arrayString s)\n{\n \/\/ Determine the length of a string array.\n int count = 0;\n while (s[count] != 0) \/\/ not includes the \"null terminator\".\n {\n count++;\n }\n return count;\n}\n\n\n\n\/\/ void identifyLimits (arrayString sourceStr, arrayString targetStr, arrayInt &arrayLimitsResult)\nvoid identifyLimits (arrayString sourceStr, arrayString targetStr, posList &positionsResult)\n{\n\n int posIni = -1, posFinal = -1;\n\n \/*\n const int RESULT_SIZE = 2;\n arrayInt newArrayLimits = new int[RESULT_SIZE]; \/\/ At the end it is going to point to: arrayLimitsResult.\n\n *\/\n\n int SOURCE_SIZE = lengthFunction(sourceStr);\n int TARGET_SIZE = lengthFunction(targetStr);\n\n\n \/\/ --- Linked list\n\n \/\/ Head pointer\n posList newPositionsResult;\n\n \/\/ Nodes\n posIniNode *node1 = new posIniNode;\n node1 -> posInitial = -1;\n\n \/\/Linking the list, just one node.\n newPositionsResult = node1;\n node1 -> next = NULL;\n\n \/\/ Cleaning things up to avoid cross-linking.\n node1 = NULL;\n\n \/\/ ---\n\n\n\n \/\/ -----------------------------------\n \/\/ -----------------------------------\n\n posIni = -1, posFinal = -1;\n for (int i = 0; i < SOURCE_SIZE; ++i)\n {\n\n \/\/ Find first character.\n if ( (posIni == -1) && (posFinal == -1) && (sourceStr[i] == targetStr[0]) )\n {\n posIni = i;\n newPositionsResult -> posInitial = posIni; \/\/New node????\n\n\n \/\/ Handles special case of one character.\n if (TARGET_SIZE == 1)\n {\n cout << \"Target initial\/final - index: \" << targetStr[0] << \" - \" << posIni << endl;\n cout << endl;\n\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n\n\n \/\/ Handles cases from two characters until ...\n for (int j = 1; j < TARGET_SIZE; ++j)\n {\n\n \/\/ Check second adjacent character.\n if ( (posFinal == -1) && ( (i + j) == (posIni + j)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n }\n\n if (sourceStr[i + j] != targetStr[j])\n {\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n }\n\n\n \/\/ Check next adjacent character. BUT not the last.\n if ( (posFinal != -1) && ((i + j) == (posIni + j)) && (j <= (TARGET_SIZE - 2)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n }\n\n if (sourceStr[i + j] != targetStr[j])\n {\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n }\n\n\n \/\/ Check last adjacent character.\n if ( (posFinal != -1) && ((i + j) == (posIni + j)) && (j == (TARGET_SIZE - 1)) )\n {\n if (sourceStr[i + j] == targetStr[j])\n {\n posFinal = i + j;\n\n cout << \"Target initial - index: \" << targetStr[0] << \" - \" << posIni << endl;\n cout << \"Target final - index: \" << targetStr[j] << \" - \" << posFinal << endl;\n cout << endl;\n }\n\n posIni = -1, posFinal = -1; \/\/ Reset.\n }\n\n } \/\/ internal for\n } \/\/ if that check the first character.\n\n } \/\/ external for\n\n\n \/\/ -----------------------------------\n \/\/ -----------------------------------\n\n\n\n\n \/\/ -- To avoid a memory leak.\n\n \/*\n delete[] arrayLimitsResult;\n arrayLimitsResult = newArrayLimits;\n *\/\n\n delete[] positionsResult;\n positionsResult = newPositionsResult;\n\n}\n\n\n\nvoid identifyLimitsTester ()\n{\n\n const int ARRAY_SIZE = 9;\n arrayString a = new char[ARRAY_SIZE];\n\n a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'd';\n a[4] = 'a'; a[5] = 'b'; a[6] = 'c'; a[7] = 'e'; a[8] = 0;\n\n\n \/\/ -- Different tests for the TARGET STRING\n\n \/\/ const int TARGET_SIZE = 9;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 'd';\n \/\/ t[4] = 'a'; t[5] = 'b'; t[6] = 'c'; t[7] = 'e'; t[8] = 'f'; t[9] = 0;\n\n \/\/ const int TARGET_SIZE = 8;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 'd';\n \/\/ t[4] = 'a'; t[5] = 'b'; t[6] = 'c'; t[7] = 'e'; t[8] = 0;\n\n \/\/ const int TARGET_SIZE = 4;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 'c'; t[3] = 0;\n\n \/\/ const int TARGET_SIZE = 3;\n \/\/ arrayString t = new char[TARGET_SIZE];\n \/\/ t[0] = 'a'; t[1] = 'b'; t[2] = 0;\n\n const int TARGET_SIZE = 2; arrayString t = new char[TARGET_SIZE];\n t[0] = 'a'; t[1] = 0;\n\n \/\/\/ ---\n\n\n\n\n\n \/\/--------------------------\n\n \/\/ const int RESULT_SIZE = 1;\n \/\/ arrayInt resultLimits = new int[RESULT_SIZE];\n\n\n \/*=================\n\n\n struct posIniNode\n {\n int posInitial;\n\n posIniNode *next; \/\/ Pointer to the same struct.\n };\n\n typedef posIniNode *posList;\n ==========================\n\n *\/\n\n\n \/\/ -- Linked list\n\n \/\/ Head pointer\n posList resultLimits;\n\n \/\/ Nodes\n posIniNode *node1 = new posIniNode;\n node1 -> posInitial = -1;\n\n \/\/Linking the list, just one node.\n resultLimits = node1;\n node1 -> next = NULL;\n\n \/\/ Cleaning things up to avoid cross-linking.\n node1 = NULL;\n\n\n \/\/-------------------------------------------------\n\n\n cout << \"Initial string : \" << a << endl;\n cout << \"Target string : \" << t << endl;\n cout << endl;\n identifyLimits(a, t, resultLimits);\n\n\n cout << \"Positions: \" << resultLimits -> posInitial << endl;\n cout << endl;\n\n\n \/\/ Free dynamic memory.\n delete[] a;\n delete[] t;\n delete[] resultLimits;\n\n}\n\n\n\nint main()\n{\n cout << \"Variable-Length String Manipulation. Function to identify limits.\" << endl;\n identifyLimitsTester();\n\n\n cout << endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>WaE: C4065 switch contains default but no case<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit_view.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_popup_model.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/location_bar.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass AutocompleteBrowserTest : public InProcessBrowserTest {\n protected:\n LocationBar* GetLocationBar() const {\n return browser()->window()->GetLocationBar();\n }\n\n AutocompleteController* GetAutocompleteController() const {\n return GetLocationBar()->location_entry()->model()->popup_model()->\n autocomplete_controller();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(AutocompleteBrowserTest, Basic) {\n LocationBar* location_bar = GetLocationBar();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->FocusLocation();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->SetUserText(L\"chrome\");\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(L\"chrome\", location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->RevertAll();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->SetUserText(L\"chrome\");\n location_bar->Revert();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n}\n\nIN_PROC_BROWSER_TEST_F(AutocompleteBrowserTest, Autocomplete) {\n LocationBar* location_bar = GetLocationBar();\n AutocompleteController* autocomplete_controller = GetAutocompleteController();\n\n {\n autocomplete_controller->Start(L\"chrome\", std::wstring(),\n true, false, true);\n\n EXPECT_TRUE(autocomplete_controller->done());\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(std::wstring(), location_bar->location_entry()->GetText());\n EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n const AutocompleteResult& result = autocomplete_controller->result();\n ASSERT_EQ(1U, result.size());\n AutocompleteMatch match = result.match_at(0);\n EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n EXPECT_FALSE(match.deletable);\n }\n\n {\n location_bar->Revert();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n const AutocompleteResult& result = autocomplete_controller->result();\n EXPECT_TRUE(result.empty());\n }\n}\n<commit_msg>Remove an EXPECT in new autocomplete browser test which failes on Windows.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/autocomplete\/autocomplete.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_edit_view.h\"\n#include \"chrome\/browser\/autocomplete\/autocomplete_popup_model.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/location_bar.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nclass AutocompleteBrowserTest : public InProcessBrowserTest {\n protected:\n LocationBar* GetLocationBar() const {\n return browser()->window()->GetLocationBar();\n }\n\n AutocompleteController* GetAutocompleteController() const {\n return GetLocationBar()->location_entry()->model()->popup_model()->\n autocomplete_controller();\n }\n};\n\nIN_PROC_BROWSER_TEST_F(AutocompleteBrowserTest, Basic) {\n LocationBar* location_bar = GetLocationBar();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n \/\/ TODO(phajdan.jr): check state of IsSelectAll when it's consistent across\n \/\/ platforms.\n\n location_bar->FocusLocation();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->SetUserText(L\"chrome\");\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(L\"chrome\", location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->RevertAll();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n\n location_bar->location_entry()->SetUserText(L\"chrome\");\n location_bar->Revert();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n}\n\nIN_PROC_BROWSER_TEST_F(AutocompleteBrowserTest, Autocomplete) {\n LocationBar* location_bar = GetLocationBar();\n AutocompleteController* autocomplete_controller = GetAutocompleteController();\n\n {\n autocomplete_controller->Start(L\"chrome\", std::wstring(),\n true, false, true);\n\n EXPECT_TRUE(autocomplete_controller->done());\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(std::wstring(), location_bar->location_entry()->GetText());\n EXPECT_TRUE(location_bar->location_entry()->IsSelectAll());\n const AutocompleteResult& result = autocomplete_controller->result();\n ASSERT_EQ(1U, result.size());\n AutocompleteMatch match = result.match_at(0);\n EXPECT_EQ(AutocompleteMatch::SEARCH_WHAT_YOU_TYPED, match.type);\n EXPECT_FALSE(match.deletable);\n }\n\n {\n location_bar->Revert();\n\n EXPECT_EQ(std::wstring(), location_bar->GetInputString());\n EXPECT_EQ(UTF8ToWide(chrome::kAboutBlankURL),\n location_bar->location_entry()->GetText());\n EXPECT_FALSE(location_bar->location_entry()->IsSelectAll());\n const AutocompleteResult& result = autocomplete_controller->result();\n EXPECT_TRUE(result.empty());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/network_selection_view.h\"\n\n#include <signal.h>\n#include <sys\/types.h>\n#include <string>\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/login\/network_screen_delegate.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/language_switch_menu.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/combobox\/combobox.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/throbber.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/widget\/widget_gtk.h\"\n#include \"views\/window\/non_client_view.h\"\n#include \"views\/window\/window.h\"\n#include \"views\/window\/window_gtk.h\"\n\nusing views::Background;\nusing views::Label;\nusing views::SmoothedThrobber;\nusing views::View;\nusing views::Widget;\nusing views::WidgetGtk;\n\nnamespace {\n\nconst int kWelcomeLabelY = 150;\nconst int kContinueButtonSpacingX = 30;\nconst int kSpacing = 25;\nconst int kHorizontalSpacing = 25;\nconst int kSelectionBoxWidthMin = 200;\nconst int kSelectionBoxHeight = 29;\nconst int kSelectionBoxSpacing = 7;\n\n\/\/ Menu button is drawn using our custom icons in resources. See\n\/\/ TextButtonBorder::Paint() for details. So this offset compensate\n\/\/ horizontal size, eaten by those icons.\nconst int kMenuButtonHorizontalOffset = 1;\n\n\/\/ Vertical addition to the menu window to make it appear exactly below\n\/\/ MenuButton.\nconst int kMenuButtonVerticalOffset = 3;\n\nconst SkColor kWelcomeColor = 0xFF1D6AB1;\n\nconst int kThrobberFrameMs = 60;\nconst int kThrobberStartDelayMs = 500;\n\n} \/\/ namespace\n\nnamespace chromeos {\n\nNetworkSelectionView::NetworkSelectionView(NetworkScreenDelegate* delegate)\n : network_combobox_(NULL),\n languages_menubutton_(NULL),\n welcome_label_(NULL),\n select_language_label_(NULL),\n select_network_label_(NULL),\n connecting_network_label_(NULL),\n continue_button_(NULL),\n throbber_(NULL),\n delegate_(delegate) {\n}\n\nNetworkSelectionView::~NetworkSelectionView() {\n network_combobox_->set_listener(NULL);\n network_combobox_ = NULL;\n throbber_->Stop();\n throbber_ = NULL;\n}\n\nvoid NetworkSelectionView::Init() {\n \/\/ Use rounded rect background.\n views::Painter* painter = CreateWizardPainter(\n &BorderDefinition::kScreenBorder);\n set_background(\n views::Background::CreateBackgroundPainter(true, painter));\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n gfx::Font welcome_label_font =\n rb.GetFont(ResourceBundle::LargeFont).DeriveFont(0, gfx::Font::BOLD);\n\n welcome_label_ = new views::Label();\n welcome_label_->SetColor(kWelcomeColor);\n welcome_label_->SetFont(welcome_label_font);\n\n select_language_label_ = new views::Label();\n select_language_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n\n select_network_label_ = new views::Label();\n select_network_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n\n connecting_network_label_ = new views::Label();\n connecting_network_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n connecting_network_label_->SetVisible(false);\n\n throbber_ = new views::SmoothedThrobber(kThrobberFrameMs);\n throbber_->SetFrames(\n ResourceBundle::GetSharedInstance().GetBitmapNamed(IDR_SPINNER));\n throbber_->set_start_delay_ms(kThrobberStartDelayMs);\n AddChildView(throbber_);\n\n network_combobox_ = new views::Combobox(delegate_);\n network_combobox_->set_listener(delegate_);\n\n languages_menubutton_ = new views::MenuButton(\n NULL, std::wstring(), delegate_->language_switch_menu(), true);\n languages_menubutton_->SetFocusable(true);\n languages_menubutton_->SetNormalHasBorder(true);\n delegate_->language_switch_menu()->set_menu_offset(\n kMenuButtonHorizontalOffset, kMenuButtonVerticalOffset);\n\n AddChildView(welcome_label_);\n AddChildView(select_language_label_);\n AddChildView(select_network_label_);\n AddChildView(connecting_network_label_);\n AddChildView(languages_menubutton_);\n AddChildView(network_combobox_);\n\n UpdateLocalizedStrings();\n}\n\nvoid NetworkSelectionView::UpdateLocalizedStrings() {\n RecreateNativeControls();\n languages_menubutton_->SetText(\n delegate_->language_switch_menu()->GetCurrentLocaleName());\n welcome_label_->SetText(l10n_util::GetStringF(IDS_NETWORK_SELECTION_TITLE,\n l10n_util::GetString(IDS_PRODUCT_OS_NAME)));\n select_language_label_->SetText(\n l10n_util::GetString(IDS_LANGUAGE_SELECTION_SELECT));\n select_network_label_->SetText(\n l10n_util::GetString(IDS_NETWORK_SELECTION_SELECT));\n continue_button_->SetLabel(\n l10n_util::GetString(IDS_NETWORK_SELECTION_CONTINUE_BUTTON));\n UpdateConnectingNetworkLabel();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ views::View: implementation:\n\nvoid NetworkSelectionView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\nvoid NetworkSelectionView::LocaleChanged() {\n UpdateLocalizedStrings();\n NetworkModelChanged();\n \/\/ Explicitly set selected item - index 0 is a localized string.\n if (GetSelectedNetworkItem() <= 0 &&\n delegate_->GetItemCount() > 0) {\n SetSelectedNetworkItem(0);\n }\n Layout();\n SchedulePaint();\n}\n\ngfx::Size NetworkSelectionView::GetPreferredSize() {\n return gfx::Size(width(), height());\n}\n\nvoid NetworkSelectionView::Layout() {\n int y = kWelcomeLabelY;\n welcome_label_->SetBounds(\n (width() - welcome_label_->GetPreferredSize().width()) \/ 2,\n y,\n welcome_label_->GetPreferredSize().width(),\n welcome_label_->GetPreferredSize().height());\n y += welcome_label_->GetPreferredSize().height() + kSpacing;\n\n \/\/ Use menu preffered size to calculate boxes width accordingly.\n int box_width = delegate_->language_switch_menu()->GetFirstLevelMenuWidth() +\n kMenuButtonHorizontalOffset * 2;\n const int widest_label = std::max(\n select_language_label_->GetPreferredSize().width(),\n select_network_label_->GetPreferredSize().width());\n if (box_width < kSelectionBoxWidthMin) {\n box_width = kSelectionBoxWidthMin;\n delegate_->language_switch_menu()->SetFirstLevelMenuWidth(\n box_width - kMenuButtonHorizontalOffset * 2);\n } else if (widest_label + box_width + 2 * kHorizontalSpacing > width()) {\n box_width = width() - widest_label - 2 * kHorizontalSpacing;\n }\n const int labels_x = (width() - widest_label - box_width) \/ 2;\n select_language_label_->SetBounds(\n labels_x,\n y,\n select_language_label_->GetPreferredSize().width(),\n select_language_label_->GetPreferredSize().height());\n\n const int selection_box_x = labels_x + widest_label + kHorizontalSpacing;\n const int label_y_offset =\n (kSelectionBoxHeight -\n select_language_label_->GetPreferredSize().height()) \/ 2;\n languages_menubutton_->SetBounds(selection_box_x, y - label_y_offset,\n box_width, kSelectionBoxHeight);\n\n y += kSelectionBoxHeight + kSelectionBoxSpacing;\n select_network_label_->SetBounds(\n labels_x,\n y,\n select_network_label_->GetPreferredSize().width(),\n select_network_label_->GetPreferredSize().height());\n\n connecting_network_label_->SetBounds(\n kHorizontalSpacing,\n y,\n width() - kHorizontalSpacing * 2,\n connecting_network_label_->GetPreferredSize().height());\n\n throbber_->SetBounds(\n width() \/ 2 + connecting_network_label_->GetPreferredSize().width() \/ 2 +\n kHorizontalSpacing,\n y + (connecting_network_label_->GetPreferredSize().height() -\n throbber_->GetPreferredSize().height()) \/ 2,\n throbber_->GetPreferredSize().width(),\n throbber_->GetPreferredSize().height());\n\n network_combobox_->SetBounds(selection_box_x, y - label_y_offset,\n box_width, kSelectionBoxHeight);\n\n y = height() - continue_button_->GetPreferredSize().height() - kSpacing;\n continue_button_->SetBounds(\n width() - kContinueButtonSpacingX -\n continue_button_->GetPreferredSize().width(),\n y,\n continue_button_->GetPreferredSize().width(),\n continue_button_->GetPreferredSize().height());\n\n \/\/ Need to refresh combobox layout explicitly.\n network_combobox_->Layout();\n continue_button_->Layout();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NetworkSelectionView, public:\n\nint NetworkSelectionView::GetSelectedNetworkItem() const {\n return network_combobox_->selected_item();\n}\n\nvoid NetworkSelectionView::SetSelectedNetworkItem(int index) {\n network_combobox_->SetSelectedItem(index);\n}\n\ngfx::NativeWindow NetworkSelectionView::GetNativeWindow() {\n return GTK_WINDOW(static_cast<WidgetGtk*>(GetWidget())->GetNativeView());\n}\n\nvoid NetworkSelectionView::NetworkModelChanged() {\n network_combobox_->ModelChanged();\n}\n\nvoid NetworkSelectionView::ShowConnectingStatus(bool connecting,\n const string16& network_id) {\n network_id_ = network_id;\n UpdateConnectingNetworkLabel();\n select_language_label_->SetVisible(!connecting);\n languages_menubutton_->SetVisible(!connecting);\n select_network_label_->SetVisible(!connecting);\n network_combobox_->SetVisible(!connecting);\n connecting_network_label_->SetVisible(connecting);\n Layout();\n if (connecting) {\n throbber_->Start();\n } else {\n throbber_->Stop();\n }\n}\n\nvoid NetworkSelectionView::EnableContinue(bool enabled) {\n if (continue_button_)\n continue_button_->SetEnabled(enabled);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NetworkSelectionView, private:\n\nvoid NetworkSelectionView::RecreateNativeControls() {\n \/\/ There is no way to get native button preferred size after the button was\n \/\/ sized so delete and recreate the button on text update.\n delete continue_button_;\n continue_button_ = new views::NativeButton(delegate_, std::wstring());\n continue_button_->SetEnabled(false);\n AddChildView(continue_button_);\n}\n\nvoid NetworkSelectionView::UpdateConnectingNetworkLabel() {\n connecting_network_label_->SetText(l10n_util::GetStringF(\n IDS_NETWORK_SELECTION_CONNECTING, UTF16ToWide(network_id_)));\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Make welcome message multiline if needed.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/network_selection_view.h\"\n\n#include <signal.h>\n#include <sys\/types.h>\n#include <string>\n\n#include \"app\/l10n_util.h\"\n#include \"app\/resource_bundle.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/chromeos\/login\/network_screen_delegate.h\"\n#include \"chrome\/browser\/chromeos\/login\/rounded_rect_painter.h\"\n#include \"chrome\/browser\/chromeos\/login\/language_switch_menu.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/combobox\/combobox.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/throbber.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/widget\/widget_gtk.h\"\n#include \"views\/window\/non_client_view.h\"\n#include \"views\/window\/window.h\"\n#include \"views\/window\/window_gtk.h\"\n\nusing views::Background;\nusing views::Label;\nusing views::SmoothedThrobber;\nusing views::View;\nusing views::Widget;\nusing views::WidgetGtk;\n\nnamespace {\n\nconst int kWelcomeLabelY = 170;\nconst int kContinueButtonSpacingX = 30;\nconst int kSpacing = 25;\nconst int kHorizontalSpacing = 25;\nconst int kSelectionBoxWidthMin = 200;\nconst int kSelectionBoxHeight = 29;\nconst int kSelectionBoxSpacing = 7;\n\n\/\/ Menu button is drawn using our custom icons in resources. See\n\/\/ TextButtonBorder::Paint() for details. So this offset compensate\n\/\/ horizontal size, eaten by those icons.\nconst int kMenuButtonHorizontalOffset = 1;\n\n\/\/ Vertical addition to the menu window to make it appear exactly below\n\/\/ MenuButton.\nconst int kMenuButtonVerticalOffset = 3;\n\nconst SkColor kWelcomeColor = 0xFF1D6AB1;\n\nconst int kThrobberFrameMs = 60;\nconst int kThrobberStartDelayMs = 500;\n\n} \/\/ namespace\n\nnamespace chromeos {\n\nNetworkSelectionView::NetworkSelectionView(NetworkScreenDelegate* delegate)\n : network_combobox_(NULL),\n languages_menubutton_(NULL),\n welcome_label_(NULL),\n select_language_label_(NULL),\n select_network_label_(NULL),\n connecting_network_label_(NULL),\n continue_button_(NULL),\n throbber_(NULL),\n delegate_(delegate) {\n}\n\nNetworkSelectionView::~NetworkSelectionView() {\n network_combobox_->set_listener(NULL);\n network_combobox_ = NULL;\n throbber_->Stop();\n throbber_ = NULL;\n}\n\nvoid NetworkSelectionView::Init() {\n \/\/ Use rounded rect background.\n views::Painter* painter = CreateWizardPainter(\n &BorderDefinition::kScreenBorder);\n set_background(\n views::Background::CreateBackgroundPainter(true, painter));\n\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n gfx::Font welcome_label_font =\n rb.GetFont(ResourceBundle::LargeFont).DeriveFont(0, gfx::Font::BOLD);\n\n welcome_label_ = new views::Label();\n welcome_label_->SetColor(kWelcomeColor);\n welcome_label_->SetFont(welcome_label_font);\n welcome_label_->SetMultiLine(true);\n\n select_language_label_ = new views::Label();\n select_language_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n\n select_network_label_ = new views::Label();\n select_network_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n\n connecting_network_label_ = new views::Label();\n connecting_network_label_->SetFont(rb.GetFont(ResourceBundle::MediumFont));\n connecting_network_label_->SetVisible(false);\n\n throbber_ = new views::SmoothedThrobber(kThrobberFrameMs);\n throbber_->SetFrames(\n ResourceBundle::GetSharedInstance().GetBitmapNamed(IDR_SPINNER));\n throbber_->set_start_delay_ms(kThrobberStartDelayMs);\n AddChildView(throbber_);\n\n network_combobox_ = new views::Combobox(delegate_);\n network_combobox_->set_listener(delegate_);\n\n languages_menubutton_ = new views::MenuButton(\n NULL, std::wstring(), delegate_->language_switch_menu(), true);\n languages_menubutton_->SetFocusable(true);\n languages_menubutton_->SetNormalHasBorder(true);\n delegate_->language_switch_menu()->set_menu_offset(\n kMenuButtonHorizontalOffset, kMenuButtonVerticalOffset);\n\n AddChildView(welcome_label_);\n AddChildView(select_language_label_);\n AddChildView(select_network_label_);\n AddChildView(connecting_network_label_);\n AddChildView(languages_menubutton_);\n AddChildView(network_combobox_);\n\n UpdateLocalizedStrings();\n}\n\nvoid NetworkSelectionView::UpdateLocalizedStrings() {\n RecreateNativeControls();\n languages_menubutton_->SetText(\n delegate_->language_switch_menu()->GetCurrentLocaleName());\n welcome_label_->SetText(l10n_util::GetStringF(IDS_NETWORK_SELECTION_TITLE,\n l10n_util::GetString(IDS_PRODUCT_OS_NAME)));\n select_language_label_->SetText(\n l10n_util::GetString(IDS_LANGUAGE_SELECTION_SELECT));\n select_network_label_->SetText(\n l10n_util::GetString(IDS_NETWORK_SELECTION_SELECT));\n continue_button_->SetLabel(\n l10n_util::GetString(IDS_NETWORK_SELECTION_CONTINUE_BUTTON));\n UpdateConnectingNetworkLabel();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ views::View: implementation:\n\nvoid NetworkSelectionView::ChildPreferredSizeChanged(View* child) {\n Layout();\n SchedulePaint();\n}\n\nvoid NetworkSelectionView::LocaleChanged() {\n UpdateLocalizedStrings();\n NetworkModelChanged();\n \/\/ Explicitly set selected item - index 0 is a localized string.\n if (GetSelectedNetworkItem() <= 0 &&\n delegate_->GetItemCount() > 0) {\n SetSelectedNetworkItem(0);\n }\n Layout();\n SchedulePaint();\n}\n\ngfx::Size NetworkSelectionView::GetPreferredSize() {\n return gfx::Size(width(), height());\n}\n\nvoid NetworkSelectionView::Layout() {\n gfx::Insets insets = GetInsets();\n int max_width = this->width() - insets.width() - 2 * kHorizontalSpacing;\n welcome_label_->SizeToFit(max_width);\n int y = kWelcomeLabelY;\n y -= welcome_label_->GetPreferredSize().height() \/ 2;\n\n welcome_label_->SetBounds(\n (width() - welcome_label_->GetPreferredSize().width()) \/ 2,\n y,\n welcome_label_->GetPreferredSize().width(),\n welcome_label_->GetPreferredSize().height());\n y += welcome_label_->GetPreferredSize().height() + kSpacing;\n\n \/\/ Use menu preffered size to calculate boxes width accordingly.\n int box_width = delegate_->language_switch_menu()->GetFirstLevelMenuWidth() +\n kMenuButtonHorizontalOffset * 2;\n const int widest_label = std::max(\n select_language_label_->GetPreferredSize().width(),\n select_network_label_->GetPreferredSize().width());\n if (box_width < kSelectionBoxWidthMin) {\n box_width = kSelectionBoxWidthMin;\n delegate_->language_switch_menu()->SetFirstLevelMenuWidth(\n box_width - kMenuButtonHorizontalOffset * 2);\n } else if (widest_label + box_width + 2 * kHorizontalSpacing > width()) {\n box_width = width() - widest_label - 2 * kHorizontalSpacing;\n }\n const int labels_x = (width() - widest_label - box_width) \/ 2;\n select_language_label_->SetBounds(\n labels_x,\n y,\n select_language_label_->GetPreferredSize().width(),\n select_language_label_->GetPreferredSize().height());\n\n const int selection_box_x = labels_x + widest_label + kHorizontalSpacing;\n const int label_y_offset =\n (kSelectionBoxHeight -\n select_language_label_->GetPreferredSize().height()) \/ 2;\n languages_menubutton_->SetBounds(selection_box_x, y - label_y_offset,\n box_width, kSelectionBoxHeight);\n\n y += kSelectionBoxHeight + kSelectionBoxSpacing;\n select_network_label_->SetBounds(\n labels_x,\n y,\n select_network_label_->GetPreferredSize().width(),\n select_network_label_->GetPreferredSize().height());\n\n connecting_network_label_->SetBounds(\n kHorizontalSpacing,\n y,\n width() - kHorizontalSpacing * 2,\n connecting_network_label_->GetPreferredSize().height());\n\n throbber_->SetBounds(\n width() \/ 2 + connecting_network_label_->GetPreferredSize().width() \/ 2 +\n kHorizontalSpacing,\n y + (connecting_network_label_->GetPreferredSize().height() -\n throbber_->GetPreferredSize().height()) \/ 2,\n throbber_->GetPreferredSize().width(),\n throbber_->GetPreferredSize().height());\n\n network_combobox_->SetBounds(selection_box_x, y - label_y_offset,\n box_width, kSelectionBoxHeight);\n\n y = height() - continue_button_->GetPreferredSize().height() - kSpacing;\n continue_button_->SetBounds(\n width() - kContinueButtonSpacingX -\n continue_button_->GetPreferredSize().width(),\n y,\n continue_button_->GetPreferredSize().width(),\n continue_button_->GetPreferredSize().height());\n\n \/\/ Need to refresh combobox layout explicitly.\n network_combobox_->Layout();\n continue_button_->Layout();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NetworkSelectionView, public:\n\nint NetworkSelectionView::GetSelectedNetworkItem() const {\n return network_combobox_->selected_item();\n}\n\nvoid NetworkSelectionView::SetSelectedNetworkItem(int index) {\n network_combobox_->SetSelectedItem(index);\n}\n\ngfx::NativeWindow NetworkSelectionView::GetNativeWindow() {\n return GTK_WINDOW(static_cast<WidgetGtk*>(GetWidget())->GetNativeView());\n}\n\nvoid NetworkSelectionView::NetworkModelChanged() {\n network_combobox_->ModelChanged();\n}\n\nvoid NetworkSelectionView::ShowConnectingStatus(bool connecting,\n const string16& network_id) {\n network_id_ = network_id;\n UpdateConnectingNetworkLabel();\n select_language_label_->SetVisible(!connecting);\n languages_menubutton_->SetVisible(!connecting);\n select_network_label_->SetVisible(!connecting);\n network_combobox_->SetVisible(!connecting);\n connecting_network_label_->SetVisible(connecting);\n Layout();\n if (connecting) {\n throbber_->Start();\n } else {\n throbber_->Stop();\n }\n}\n\nvoid NetworkSelectionView::EnableContinue(bool enabled) {\n if (continue_button_)\n continue_button_->SetEnabled(enabled);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NetworkSelectionView, private:\n\nvoid NetworkSelectionView::RecreateNativeControls() {\n \/\/ There is no way to get native button preferred size after the button was\n \/\/ sized so delete and recreate the button on text update.\n delete continue_button_;\n continue_button_ = new views::NativeButton(delegate_, std::wstring());\n continue_button_->SetEnabled(false);\n AddChildView(continue_button_);\n}\n\nvoid NetworkSelectionView::UpdateConnectingNetworkLabel() {\n connecting_network_label_->SetText(l10n_util::GetStringF(\n IDS_NETWORK_SELECTION_CONNECTING, UTF16ToWide(network_id_)));\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>#include <map>\n#include <string>\n#include <list>\n#include <functional> \n#include <algorithm>\n#include \"boost\\crc.hpp\"\n#include \"boost\\format\\free_funcs.hpp\"\n\n#ifndef __CONSISTENT_HASH_H__\n#define __CONSISTENT_HASH_H__\n\n\/\/ڵ\nclass NFIVirtualNode \n{\npublic:\n\n \/\/IPĵڼڵ\n NFIVirtualNode(const int nVirID)\n :nVirtualIndex(nVirID)\n {\n\n }\n\n\tNFIVirtualNode()\n\t{\n\t\tnVirtualIndex = 0;\n\t}\n\n\tvirtual ~NFIVirtualNode()\n\t{\n\t\tnVirtualIndex = 0;\n\t}\n\n\tvirtual std::string GetDataStr() = 0;\n\n std::string ToStr() const \n {\n return boost::str(boost::format(\"%1%-%2%\") % GetDataStr() % nVirtualIndex);\n }\n\nprivate:\n\n\n int nVirtualIndex;\/\/ڵ\n};\n\nclass NFCMachineNode : public NFIVirtualNode\n{\n\tNFCMachineNode(const int nVirID) : NFIVirtualNode(nVirID)\n\t{\n\t\tstrIP = \"\";\n\t\tnPort = 0;\n\t\tnWeight = 0;\/\/ܹȨؼǶڵ\n\t\tnMachineID = 0;\n\t}\n\n\tNFCMachineNode()\n\t{\n\t\tstrIP = \"\";\n\t\tnPort = 0;\n\t\tnWeight = 0;\/\/ܹȨؼǶڵ\n\t\tnMachineID = 0;\n\t}\n\n\tvirtual std::string GetDataStr()\n\t{\n\t\treturn strIP;\n\t}\n\n\tstd::string strIP;\n\tint nPort;\n\tint nWeight;\n\tint nMachineID;\n};\n\nclass NFIHasher\n{\npublic:\n virtual uint32_t GetHashValue(const NFIVirtualNode& vNode) = 0;\n};\n\nclass NFCHasher : public NFIHasher\n{\npublic:\n virtual uint32_t GetHashValue(const NFIVirtualNode& vNode)\n {\n boost::crc_32_type ret;\n std::string vnode = vNode.ToStr();\n ret.process_bytes(vnode.c_str(), vnode.size());\n\n return ret.checksum();\n }\n};\n\nclass NFCConsistentHash\n{\npublic:\n\npublic:\n\n NFCConsistentHash()\n {\n m_pHasher = new NFCHasher();\n }\n\n virtual ~NFCConsistentHash()\n {\n delete m_pHasher;\n m_pHasher = NULL;\n }\n\npublic:\n std::size_t Size() const\n {\n return mxNodes.size();\n }\n\n bool Empty() const \n {\n return mxNodes.empty();\n }\n\n void Insert(const NFIVirtualNode& xNode) \n {\n uint32_t hash = m_pHasher->GetHashValue(xNode);\n auto it = mxNodes.find(hash);\n if (it == mxNodes.end())\n {\n mxNodes.insert(TMAP_TYPE::value_type(hash,xNode));\n }\n }\n\n\n std::size_t Erase(const NFIVirtualNode& xNode) \n {\n uint32_t hash = m_pHasher->GetHashValue(xNode);\n return mxNodes.erase(hash);\n }\n\n\tbool SuitNode(uint32_t hashValue, NFIVirtualNode& node)\n\t{\n\t\tif(mxNodes.empty())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tTMAP_TYPE::iterator it = mxNodes.lower_bound(hashValue);\n\n\t\tif (it == mxNodes.end())\n\t\t{\n\t\t\tit = mxNodes.begin();\n\t\t}\n\n\t\tnode = it->second;\n\n\t\treturn true;\n\t}\nprivate:\n\ttypedef std::map<uint32_t, NFIVirtualNode> TMAP_TYPE;\n\ttypedef TMAP_TYPE::iterator iterator;\n\n NFIHasher* m_pHasher;\n TMAP_TYPE mxNodes;\n};\n\n\n#endif\n<commit_msg>modified consistent hash<commit_after>#include <map>\n#include <string>\n#include <list>\n#include <functional> \n#include <algorithm>\n#include \"boost\/crc.hpp\"\n#include \"boost\/format\/free_funcs.hpp\"\n\n#ifndef __CONSISTENT_HASH_H__\n#define __CONSISTENT_HASH_H__\n\n\/\/ڵ\nclass NFIVirtualNode \n{\npublic:\n\n \/\/IPĵڼڵ\n NFIVirtualNode(const int nVirID)\n :nVirtualIndex(nVirID)\n {\n\n }\n\n\tNFIVirtualNode()\n\t{\n\t\tnVirtualIndex = 0;\n\t}\n\n\tvirtual ~NFIVirtualNode()\n\t{\n\t\tnVirtualIndex = 0;\n\t}\n\n\tvirtual std::string GetDataStr() = 0;\n\n std::string ToStr() const \n {\n return boost::str(boost::format(\"%1%-%2%\") % GetDataStr() % nVirtualIndex);\n }\n\nprivate:\n\n\n int nVirtualIndex;\/\/ڵ\n};\n\nclass NFCMachineNode : public NFIVirtualNode\n{\n\tNFCMachineNode(const int nVirID) : NFIVirtualNode(nVirID)\n\t{\n\t\tstrIP = \"\";\n\t\tnPort = 0;\n\t\tnWeight = 0;\/\/ܹȨؼǶڵ\n\t\tnMachineID = 0;\n\t}\n\n\tNFCMachineNode()\n\t{\n\t\tstrIP = \"\";\n\t\tnPort = 0;\n\t\tnWeight = 0;\/\/ܹȨؼǶڵ\n\t\tnMachineID = 0;\n\t}\n\n\tvirtual std::string GetDataStr()\n\t{\n\t\treturn strIP;\n\t}\n\n\tstd::string strIP;\n\tint nPort;\n\tint nWeight;\n\tint nMachineID;\n};\n\nclass NFIHasher\n{\npublic:\n virtual uint32_t GetHashValue(const NFIVirtualNode& vNode) = 0;\n};\n\nclass NFCHasher : public NFIHasher\n{\npublic:\n virtual uint32_t GetHashValue(const NFIVirtualNode& vNode)\n {\n boost::crc_32_type ret;\n std::string vnode = vNode.ToStr();\n ret.process_bytes(vnode.c_str(), vnode.size());\n\n return ret.checksum();\n }\n};\n\nclass NFCConsistentHash\n{\npublic:\n\npublic:\n\n NFCConsistentHash()\n {\n m_pHasher = new NFCHasher();\n }\n\n virtual ~NFCConsistentHash()\n {\n delete m_pHasher;\n m_pHasher = NULL;\n }\n\npublic:\n std::size_t Size() const\n {\n return mxNodes.size();\n }\n\n bool Empty() const \n {\n return mxNodes.empty();\n }\n\n void Insert(const NFIVirtualNode& xNode) \n {\n uint32_t hash = m_pHasher->GetHashValue(xNode);\n auto it = mxNodes.find(hash);\n if (it == mxNodes.end())\n {\n mxNodes.insert(TMAP_TYPE::value_type(hash,xNode));\n }\n }\n\n\n std::size_t Erase(const NFIVirtualNode& xNode) \n {\n uint32_t hash = m_pHasher->GetHashValue(xNode);\n return mxNodes.erase(hash);\n }\n\n\tbool SuitNode(uint32_t hashValue, NFIVirtualNode& node)\n\t{\n\t\tif(mxNodes.empty())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tTMAP_TYPE::iterator it = mxNodes.lower_bound(hashValue);\n\n\t\tif (it == mxNodes.end())\n\t\t{\n\t\t\tit = mxNodes.begin();\n\t\t}\n\n\t\tnode = it->second;\n\n\t\treturn true;\n\t}\nprivate:\n\ttypedef std::map<uint32_t, NFIVirtualNode> TMAP_TYPE;\n\ttypedef TMAP_TYPE::iterator iterator;\n\n NFIHasher* m_pHasher;\n TMAP_TYPE mxNodes;\n};\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ -------------------------------------------------------------------------\r\n\/\/ @FileName\t\t\t: NFCLogModule.cpp\r\n\/\/ @Author : LvSheng.Huang\r\n\/\/ @Date : 2012-12-15\r\n\/\/ @Module : NFCLogModule\r\n\/\/ @Desc :\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n#define GLOG_NO_ABBREVIATED_SEVERITIES\r\n#include <stdarg.h>\r\n#include \"NFCLogModule.h\"\r\n#include \"easylogging++.h\"\r\n\r\nINITIALIZE_EASYLOGGINGPP\r\n\r\nunsigned int NFCLogModule::idx = 0;\r\n\r\nbool NFCLogModule::CheckLogFileExist(const char* filename)\r\n{\r\n std::stringstream stream;\r\n stream << filename << \".\" << ++idx;\r\n std::fstream file;\r\n file.open(stream.str(), std::ios::in);\r\n if (file)\r\n {\r\n return CheckLogFileExist(filename);\r\n }\r\n\r\n return false;\r\n}\r\n\r\nvoid NFCLogModule::rolloutHandler(const char* filename, std::size_t size)\r\n{\r\n std::stringstream stream;\r\n if (!CheckLogFileExist(filename))\r\n {\r\n stream << filename << \".\" << idx;\r\n rename(filename, stream.str().c_str());\r\n }\r\n}\r\n\r\nNFCLogModule::NFCLogModule(NFIPluginManager* p)\r\n{\r\n pPluginManager = p;\r\n}\r\n\r\nbool NFCLogModule::Init()\r\n{\r\n mnLogCountTotal = 0;\r\n\r\n el::Loggers::addFlag(el::LoggingFlag::StrictLogFileSizeCheck);\r\n el::Loggers::addFlag(el::LoggingFlag::DisableApplicationAbortOnFatalLog);\r\n#if NF_PLATFORM == NF_PLATFORM_WIN\r\n el::Configurations conf(\"log_win.conf\");\r\n#else\r\n el::Configurations conf(\"log.conf\");\r\n#endif\r\n el::Loggers::reconfigureAllLoggers(conf);\r\n el::Helpers::installPreRollOutCallback(rolloutHandler);\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::Shut()\r\n{\r\n el::Helpers::uninstallPreRollOutCallback();\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::BeforeShut()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::AfterInit()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::Execute()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::Log(const NF_LOG_LEVEL nll, const char* format, ...)\r\n{\r\n mnLogCountTotal++;\r\n\r\n char szBuffer[1024 * 10] = {0};\r\n\r\n va_list args;\r\n va_start(args, format);\r\n vsnprintf(szBuffer, sizeof(szBuffer) - 1, format, args);\r\n va_end(args);\r\n\r\n switch (nll)\r\n {\r\n case NFILogModule::NLL_DEBUG_NORMAL:\r\n LOG(DEBUG) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_INFO_NORMAL:\r\n LOG(INFO) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_WARING_NORMAL:\r\n LOG(WARNING) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_ERROR_NORMAL:\r\n {\r\n LOG(ERROR) << mnLogCountTotal << \" | \" << szBuffer;\r\n \/\/LogStack();\r\n }\r\n break;\r\n case NFILogModule::NLL_FATAL_NORMAL:\r\n LOG(FATAL) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n default:\r\n LOG(INFO) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogElement(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strElement, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[ELEMENT] Indent[%s] Element[%s] %s %s %d\", ident.ToString().c_str(), strElement.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[ELEMENT] Indent[%s] Element[%s] %s\", ident.ToString().c_str(), strElement.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogProperty(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strProperty, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[PROPERTY] Indent[%s] Property[%s] %s %s %d\", ident.ToString().c_str(), strProperty.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[PROPERTY] Indent[%s] Property[%s] %s\", ident.ToString().c_str(), strProperty.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::LogRecord(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strRecord, const std::string& strDesc, const int nRow, const int nCol, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] Row[%d] Col[%d] %s %s %d\", ident.ToString().c_str(), strRecord.c_str(), nRow, nCol, strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] Row[%d] Col[%d] %s\", ident.ToString().c_str(), strRecord.c_str(), nRow, nCol, strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::LogRecord(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strRecord, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] %s %s %d\", ident.ToString().c_str(), strRecord.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] %s\", ident.ToString().c_str(), strRecord.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogObject(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[OBJECT] Indent[%s] %s %s %d\", ident.ToString().c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[OBJECT] Indent[%s] %s\", ident.ToString().c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nvoid NFCLogModule::LogStack()\r\n{\r\n\r\n \/\/To Add\r\n \/*\r\n #ifdef NF_DEBUG_MODE\r\n time_t t = time(0);\r\n char szDmupName[MAX_PATH];\r\n tm* ptm = localtime(&t);\r\n\r\n sprintf(szDmupName, \"%d_%d_%d_%d_%d_%d.dmp\", ptm->tm_year + 1900, ptm->tm_mon, ptm->tm_mday, ptm->tm_hour, ptm->tm_min, ptm->tm_sec);\r\n \/\/ 创建Dump文件\r\n HANDLE hDumpFile = CreateFile(szDmupName, GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);\r\n\r\n \/\/ Dump信息\r\n MINIDUMP_EXCEPTION_INFORMATION dumpInfo;\r\n \/\/dumpInfo.ExceptionPointers = pException;\r\n dumpInfo.ThreadId = GetCurrentThreadId();\r\n dumpInfo.ClientPointers = TRUE;\r\n\r\n \/\/ 写入Dump文件内容\r\n MiniDumpWriteDump(GetCurrentProcess(), GetCurrentProcessId(), hDumpFile, MiniDumpNormal, &dumpInfo, NULL, NULL);\r\n\r\n CloseHandle(hDumpFile);\r\n\r\n #endif\r\n *\/\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %s %s %d\", ident.ToString().c_str(), strInfo.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s %s\", ident.ToString().c_str(), strInfo.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const int nDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %d %s %d\", ident.ToString().c_str(), strInfo.c_str(), nDesc, func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s %d\", ident.ToString().c_str(), strInfo.c_str(), nDesc);\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::ostringstream& stream, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %d\", ident.ToString().c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s\", ident.ToString().c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const char* func \/*= \"\"*\/, int line \/*= 0*\/)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %s %d\", ident.ToString().c_str(), strInfo.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s\", ident.ToString().c_str(), strInfo.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogDebugFunctionDump(const NFGUID ident, const int nMsg, const std::string& strArg, const char* func \/*= \"\"*\/, const int line \/*= 0*\/)\r\n{\r\n \/\/#ifdef NF_DEBUG_MODE\r\n LogNormal(NFILogModule::NLL_WARING_NORMAL, ident, strArg + \"MsgID:\", nMsg, func, line);\r\n \/\/#endif\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::ChangeLogLevel(const std::string& strLevel)\r\n{\r\n el::Level logLevel = el::LevelHelper::convertFromString(strLevel.c_str());\r\n el::Logger* pLogger = el::Loggers::getLogger(\"default\");\r\n if (NULL == pLogger)\r\n {\r\n return false;\r\n }\r\n\r\n el::Configurations* pConfigurations = pLogger->configurations();\r\n el::base::TypedConfigurations* pTypeConfigurations = pLogger->typedConfigurations();\r\n if (NULL == pConfigurations)\r\n {\r\n return false;\r\n }\r\n\r\n \/\/ log级别为debug, info, warning, error, fatal(级别逐渐提高)\r\n \/\/ 当传入为info时，则高于(包含)info的级别会输出\r\n \/\/ !!!!!! NOTICE:故意没有break，请千万注意 !!!!!!\r\n switch (logLevel)\r\n {\r\n case el::Level::Fatal:\r\n {\r\n el::Configuration errorConfiguration(el::Level::Error, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&errorConfiguration);\r\n }\r\n case el::Level::Error:\r\n {\r\n el::Configuration warnConfiguration(el::Level::Warning, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&warnConfiguration);\r\n }\r\n case el::Level::Warning:\r\n {\r\n el::Configuration infoConfiguration(el::Level::Info, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&infoConfiguration);\r\n }\r\n case el::Level::Info:\r\n {\r\n el::Configuration debugConfiguration(el::Level::Debug, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&debugConfiguration);\r\n\r\n }\r\n case el::Level::Debug:\r\n break;\r\n default:\r\n break;\r\n }\r\n\r\n el::Loggers::reconfigureAllLoggers(*pConfigurations);\r\n LogNormal(NFILogModule::NLL_INFO_NORMAL, NFGUID(), \"[Log] Change log level\", strLevel, __FUNCTION__, __LINE__);\r\n return true;\r\n}\r\n<commit_msg>log bug fix<commit_after>\/\/ -------------------------------------------------------------------------\r\n\/\/ @FileName\t\t\t: NFCLogModule.cpp\r\n\/\/ @Author : LvSheng.Huang\r\n\/\/ @Date : 2012-12-15\r\n\/\/ @Module : NFCLogModule\r\n\/\/ @Desc :\r\n\/\/ -------------------------------------------------------------------------\r\n\r\n#define GLOG_NO_ABBREVIATED_SEVERITIES\r\n#include <stdarg.h>\r\n#include \"NFCLogModule.h\"\r\n#include \"easylogging++.h\"\r\n\r\nINITIALIZE_EASYLOGGINGPP\r\n\r\nunsigned int NFCLogModule::idx = 0;\r\n\r\nbool NFCLogModule::CheckLogFileExist(const char* filename)\r\n{\r\n std::stringstream stream;\r\n stream << filename << \".\" << ++idx;\r\n std::fstream file;\r\n file.open(stream.str(), std::ios::in);\r\n if (file)\r\n {\r\n return CheckLogFileExist(filename);\r\n }\r\n\r\n return false;\r\n}\r\n\r\nvoid NFCLogModule::rolloutHandler(const char* filename, std::size_t size)\r\n{\r\n std::stringstream stream;\r\n if (!CheckLogFileExist(filename))\r\n {\r\n stream << filename << \".\" << idx;\r\n rename(filename, stream.str().c_str());\r\n }\r\n}\r\n\r\nNFCLogModule::NFCLogModule(NFIPluginManager* p)\r\n{\r\n pPluginManager = p;\r\n}\r\n\r\nbool NFCLogModule::Init()\r\n{\r\n mnLogCountTotal = 0;\r\n\r\n el::Loggers::addFlag(el::LoggingFlag::StrictLogFileSizeCheck);\r\n el::Loggers::addFlag(el::LoggingFlag::DisableApplicationAbortOnFatalLog);\r\n#if NF_PLATFORM == NF_PLATFORM_WIN\r\n el::Configurations conf(\"log_win.conf\");\r\n#else\r\n el::Configurations conf(\"log.conf\");\r\n#endif\r\n el::Loggers::reconfigureAllLoggers(conf);\r\n el::Helpers::installPreRollOutCallback(rolloutHandler);\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::Shut()\r\n{\r\n el::Helpers::uninstallPreRollOutCallback();\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::BeforeShut()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::AfterInit()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::Execute()\r\n{\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::Log(const NF_LOG_LEVEL nll, const char* format, ...)\r\n{\r\n mnLogCountTotal++;\r\n\r\n char szBuffer[1024 * 10] = {0};\r\n\r\n va_list args;\r\n va_start(args, format);\r\n vsnprintf(szBuffer, sizeof(szBuffer) - 1, format, args);\r\n va_end(args);\r\n\r\n switch (nll)\r\n {\r\n case NFILogModule::NLL_DEBUG_NORMAL:\r\n LOG(DEBUG) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_INFO_NORMAL:\r\n LOG(INFO) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_WARING_NORMAL:\r\n LOG(WARNING) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n case NFILogModule::NLL_ERROR_NORMAL:\r\n {\r\n LOG(ERROR) << mnLogCountTotal << \" | \" << szBuffer;\r\n \/\/LogStack();\r\n }\r\n break;\r\n case NFILogModule::NLL_FATAL_NORMAL:\r\n LOG(FATAL) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n default:\r\n LOG(INFO) << mnLogCountTotal << \" | \" << szBuffer;\r\n break;\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogElement(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strElement, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[ELEMENT] Indent[%s] Element[%s] %s %s %d\", ident.ToString().c_str(), strElement.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[ELEMENT] Indent[%s] Element[%s] %s\", ident.ToString().c_str(), strElement.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogProperty(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strProperty, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[PROPERTY] Indent[%s] Property[%s] %s %s %d\", ident.ToString().c_str(), strProperty.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[PROPERTY] Indent[%s] Property[%s] %s\", ident.ToString().c_str(), strProperty.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::LogRecord(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strRecord, const std::string& strDesc, const int nRow, const int nCol, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] Row[%d] Col[%d] %s %s %d\", ident.ToString().c_str(), strRecord.c_str(), nRow, nCol, strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] Row[%d] Col[%d] %s\", ident.ToString().c_str(), strRecord.c_str(), nRow, nCol, strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nbool NFCLogModule::LogRecord(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strRecord, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] %s %s %d\", ident.ToString().c_str(), strRecord.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[RECORD] Indent[%s] Record[%s] %s\", ident.ToString().c_str(), strRecord.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogObject(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"[OBJECT] Indent[%s] %s %s %d\", ident.ToString().c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"[OBJECT] Indent[%s] %s\", ident.ToString().c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n\r\n}\r\n\r\nvoid NFCLogModule::LogStack()\r\n{\r\n\r\n \/\/To Add\r\n \/*\r\n #ifdef NF_DEBUG_MODE\r\n time_t t = time(0);\r\n char szDmupName[MAX_PATH];\r\n tm* ptm = localtime(&t);\r\n\r\n sprintf(szDmupName, \"%d_%d_%d_%d_%d_%d.dmp\", ptm->tm_year + 1900, ptm->tm_mon, ptm->tm_mday, ptm->tm_hour, ptm->tm_min, ptm->tm_sec);\r\n \/\/ 创建Dump文件\r\n HANDLE hDumpFile = CreateFile(szDmupName, GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL);\r\n\r\n \/\/ Dump信息\r\n MINIDUMP_EXCEPTION_INFORMATION dumpInfo;\r\n \/\/dumpInfo.ExceptionPointers = pException;\r\n dumpInfo.ThreadId = GetCurrentThreadId();\r\n dumpInfo.ClientPointers = TRUE;\r\n\r\n \/\/ 写入Dump文件内容\r\n MiniDumpWriteDump(GetCurrentProcess(), GetCurrentProcessId(), hDumpFile, MiniDumpNormal, &dumpInfo, NULL, NULL);\r\n\r\n CloseHandle(hDumpFile);\r\n\r\n #endif\r\n *\/\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const std::string& strDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %s %s %d\", ident.ToString().c_str(), strInfo.c_str(), strDesc.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s %s\", ident.ToString().c_str(), strInfo.c_str(), strDesc.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const int nDesc, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %d %s %d\", ident.ToString().c_str(), strInfo.c_str(), nDesc, func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s %d\", ident.ToString().c_str(), strInfo.c_str(), nDesc);\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::ostringstream& stream, const char* func, int line)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %s %d\", ident.ToString().c_str(), stream.str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s\", ident.ToString().c_str(), stream.str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogNormal(const NF_LOG_LEVEL nll, const NFGUID ident, const std::string& strInfo, const char* func \/*= \"\"*\/, int line \/*= 0*\/)\r\n{\r\n if (line > 0)\r\n {\r\n Log(nll, \"Indent[%s] %s %s %d\", ident.ToString().c_str(), strInfo.c_str(), func, line);\r\n }\r\n else\r\n {\r\n Log(nll, \"Indent[%s] %s\", ident.ToString().c_str(), strInfo.c_str());\r\n }\r\n\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::LogDebugFunctionDump(const NFGUID ident, const int nMsg, const std::string& strArg, const char* func \/*= \"\"*\/, const int line \/*= 0*\/)\r\n{\r\n \/\/#ifdef NF_DEBUG_MODE\r\n LogNormal(NFILogModule::NLL_WARING_NORMAL, ident, strArg + \"MsgID:\", nMsg, func, line);\r\n \/\/#endif\r\n return true;\r\n}\r\n\r\nbool NFCLogModule::ChangeLogLevel(const std::string& strLevel)\r\n{\r\n el::Level logLevel = el::LevelHelper::convertFromString(strLevel.c_str());\r\n el::Logger* pLogger = el::Loggers::getLogger(\"default\");\r\n if (NULL == pLogger)\r\n {\r\n return false;\r\n }\r\n\r\n el::Configurations* pConfigurations = pLogger->configurations();\r\n el::base::TypedConfigurations* pTypeConfigurations = pLogger->typedConfigurations();\r\n if (NULL == pConfigurations)\r\n {\r\n return false;\r\n }\r\n\r\n \/\/ log级别为debug, info, warning, error, fatal(级别逐渐提高)\r\n \/\/ 当传入为info时，则高于(包含)info的级别会输出\r\n \/\/ !!!!!! NOTICE:故意没有break，请千万注意 !!!!!!\r\n switch (logLevel)\r\n {\r\n case el::Level::Fatal:\r\n {\r\n el::Configuration errorConfiguration(el::Level::Error, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&errorConfiguration);\r\n }\r\n case el::Level::Error:\r\n {\r\n el::Configuration warnConfiguration(el::Level::Warning, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&warnConfiguration);\r\n }\r\n case el::Level::Warning:\r\n {\r\n el::Configuration infoConfiguration(el::Level::Info, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&infoConfiguration);\r\n }\r\n case el::Level::Info:\r\n {\r\n el::Configuration debugConfiguration(el::Level::Debug, el::ConfigurationType::Enabled, \"false\");\r\n pConfigurations->set(&debugConfiguration);\r\n\r\n }\r\n case el::Level::Debug:\r\n break;\r\n default:\r\n break;\r\n }\r\n\r\n el::Loggers::reconfigureAllLoggers(*pConfigurations);\r\n LogNormal(NFILogModule::NLL_INFO_NORMAL, NFGUID(), \"[Log] Change log level\", strLevel, __FUNCTION__, __LINE__);\r\n return true;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#pragma sw require header org.sw.demo.google.protobuf.protoc\n#pragma sw require header org.sw.demo.qtproject.qt.base.tools.moc-5\n\n#define QT_VERSION \"-5\"\n\n\/*void configure(Build &s)\n{\n if (s.isConfigSelected(\"mt\"))\n {\n auto ss = s.createSettings();\n ss.Native.LibrariesType = LibraryType::Static;\n ss.Native.MT = true;\n s.addSettings(ss);\n }\n}*\/\n\nvoid build(Solution &s)\n{\n auto &aspia = s.addProject(\"aspia\", \"master\");\n aspia += Git(\"https:\/\/github.com\/dchapyshev\/aspia\", \"\", \"{v}\");\n\n constexpr auto cppstd = cpp17;\n\n auto setup_target = [&aspia](auto &t, const String &name, bool add_tests = false, String dir = {}) -> decltype(auto)\n {\n if (dir.empty())\n dir = name;\n\n t += cppstd;\n t.Public += \".\"_idir;\n t.setRootDirectory(dir);\n t += IncludeDirectory(\".\"s);\n t += \".*\"_rr;\n\n \/\/\n t.AllowEmptyRegexes = true;\n\n \/\/ os specific\n t -= \".*_win.*\"_rr;\n t -= \".*_linux.*\"_rr;\n t -= \".*\/linux\/.*\"_rr;\n t -= \".*_pulse.*\"_rr;\n t -= \".*_mac.*\"_rr;\n t -= \".*_posix.*\"_rr;\n t -= \".*_x11.*\"_rr;\n if (t.getBuildSettings().TargetOS.Type == OSType::Windows)\n t += \".*_win.*\"_rr;\n else if (t.getBuildSettings().TargetOS.isApple())\n t += \".*_mac.*\"_rr;\n else\n {\n t += \".*_pulse.*\"_rr;\n t += \".*_linux.*\"_rr;\n t += \".*\/linux\/.*\"_rr;\n t += \".*_x11.*\"_rr;\n }\n if (t.getBuildSettings().TargetOS.Type != OSType::Windows)\n t += \".*_posix.*\"_rr;\n\n t -= \".*_unittest.*\"_rr;\n t -= \".*tests.*\"_rr;\n\n \/\/\n t.AllowEmptyRegexes = false;\n\n \/\/ test\n if (add_tests)\n {\n auto &bt = t.addExecutable(\"test\");\n bt += cppstd;\n bt += FileRegex(dir, \".*_unittest.*\", true);\n bt += t;\n bt += \"org.sw.demo.google.googletest.gmock\"_dep;\n bt += \"org.sw.demo.google.googletest.gtest.main\"_dep;\n t.addTest(bt);\n }\n\n return t;\n };\n\n auto add_lib = [&aspia, &setup_target](const String &name, bool add_tests = false, String dir = {}) -> decltype(auto)\n {\n return setup_target(aspia.addStaticLibrary(name), name, add_tests, dir);\n };\n\n auto &protocol = aspia.addStaticLibrary(\"proto\");\n protocol += \"proto\/.*\\\\.proto\"_rr;\n for (const auto &[p, _] : protocol[FileRegex(protocol.SourceDir \/ \"proto\", \".*\\\\.proto\", false)])\n {\n ProtobufData d;\n d.outdir = protocol.BinaryDir \/ \"proto\";\n d.public_protobuf = true;\n d.addIncludeDirectory(protocol.SourceDir \/ \"proto\");\n gen_protobuf_cpp(\"org.sw.demo.google.protobuf\"_dep, protocol, p, d);\n }\n\n auto &base = aspia.addStaticLibrary(\"base\");\n base += \"third_party\/modp_b64\/.*\\\\.[hc]\"_rr;\n base += \"third_party\/x11region\/.*\\\\.[hc]\"_rr;\n base += \"third_party\/tbb_c_allocator\/.*\"_rr;\n base -= \"build\/.*\"_rr;\n setup_target(base, \"base\", false);\n base.Public += \"UNICODE\"_def;\n base.Public += \"WIN32_LEAN_AND_MEAN\"_def;\n base.Public += \"NOMINMAX\"_def;\n base.Public += protocol;\n base.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.qtproject.qt.base.network\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.qtproject.qt.base.xml\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.boost.align\"_dep;\n base.Public += \"org.sw.demo.imneme.pcg_cpp-master\"_dep;\n base.Public += \"org.sw.demo.chriskohlhoff.asio\"_dep;\n base.Public += \"org.sw.demo.rapidxml\"_dep;\n base.Public += \"org.sw.demo.miloyip.rapidjson\"_dep;\n base.Public += \"org.sw.demo.google.protobuf.protobuf\"_dep; \/\/ should be protobuf_lite actually?\n base.Public += \"org.sw.demo.chromium.libyuv-master\"_dep;\n base.Public += \"org.sw.demo.webmproject.vpx\"_dep;\n base.Public += \"org.sw.demo.webmproject.webm\"_dep;\n base.Public += \"org.sw.demo.xiph.opus\"_dep;\n if (base.getBuildSettings().TargetOS.Type == OSType::Windows)\n {\n base -= \"x11\/.*\"_rr;\n base.Public += \"com.Microsoft.Windows.SDK.winrt\"_dep;\n base +=\n \"Dbghelp.lib\"_slib,\n \"Mswsock.lib\"_slib,\n \"Avrt.lib\"_slib,\n \"comsuppw.lib\"_slib,\n \"Winspool.lib\"_slib,\n \"Setupapi.lib\"_slib\n ;\n }\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, base);\n\n auto &relay = aspia.addExecutable(\"relay\");\n relay += cppstd;\n relay += \"relay\/.*\"_rr;\n relay += base;\n\n auto &router = aspia.addExecutable(\"router\");\n router += cppstd;\n router += \"router\/.*\"_rr;\n router += base;\n router += \"org.sw.demo.sqlite3\"_dep;\n\n auto qt_progs = [](auto &t, const String &name_override = {}, const path &path_override = {})\n {\n auto name = name_override.empty() ? t.getPackage().getPath().back() : name_override;\n\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, t);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t, t.SourceDir \/ path_override \/ (\"resources\/\" + name + \".qrc\"));\n qt_uic(\"org.sw.demo.qtproject.qt.base.tools.uic\" QT_VERSION \"\"_dep, t);\n };\n\n auto qt_progs2 = [](auto &t)\n {\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, t);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t, t.SourceDir \/ \"ui\/resources.qrc\");\n qt_uic(\"org.sw.demo.qtproject.qt.base.tools.uic\" QT_VERSION \"\"_dep, t);\n };\n\n auto qt_progs_and_tr = [&qt_progs](auto &t, const String &name_override = {}, const path &path_override = {})\n {\n auto name = name_override.empty() ? t.getPackage().getPath().back() : name_override;\n\n qt_progs(t, name_override, path_override);\n\n \/\/ trs\n qt_tr(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, t);\n t.configureFile(t.SourceDir \/ path_override \/ (\"translations\/\" + name + \"_translations.qrc\"),\n t.BinaryDir \/ (name + \"_translations.qrc\"), ConfigureFlags::CopyOnly);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t,\n t.BinaryDir \/ (name + \"_translations.qrc\"))\n ->working_directory = t.BinaryDir;\n };\n\n auto qt_progs_and_tr2 = [&qt_progs2](auto &t)\n {\n qt_progs2(t);\n\n \/\/ trs\n qt_tr(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, t);\n t.configureFile(t.SourceDir \/ \"ui\/translations.qrc\",\n t.BinaryDir \/ \"translations.qrc\", ConfigureFlags::CopyOnly);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t,\n t.BinaryDir \/ \"translations.qrc\")->working_directory = t.BinaryDir;\n };\n\n auto &common = add_lib(\"common\");\n if (common.getBuildSettings().TargetOS.Type == OSType::Windows)\n {\n common -= \"file_enumerator_fs.cc\";\n common.Public += \"Shlwapi.lib\"_slib;\n }\n common.Public += base, protocol;\n common.Public += \"org.sw.demo.openssl.crypto\"_dep;\n common.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n common.Public += \"org.sw.demo.qtproject.qt.winextras\" QT_VERSION \"\"_dep;\n qt_progs_and_tr(common);\n\n auto &qt_base = add_lib(\"qt_base\");\n qt_base.Public += base;\n qt_base.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, qt_base);\n qt_translations_rcc(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, aspia, qt_base, \"qt_translations.qrc\");\n\n auto setup_exe = [](auto &t) -> decltype(auto)\n {\n if (auto L = t.getSelectedTool()->template as<VisualStudioLinker*>(); L)\n L->Subsystem = vs::Subsystem::Windows;\n t += \"org.sw.demo.qtproject.qt.base.winmain\" QT_VERSION \"\"_dep;\n return t;\n };\n\n \/\/\n auto &client_core = add_lib(\"client\");\n client_core.Public += common;\n if (client_core.getBuildSettings().TargetOS.Type == OSType::Windows)\n client_core.Public += \"org.sw.demo.qtproject.qt.base.plugins.printsupport.windows\" QT_VERSION \"\"_dep;\n qt_progs_and_tr(client_core);\n\n auto add_exe = [&setup_exe](auto &base, const String &name) -> decltype(auto)\n {\n return setup_exe(base.addExecutable(name));\n };\n\n \/\/\n auto &console = add_exe(aspia, \"console\");\n setup_target(console, \"console\");\n console.Public += client_core, qt_base;\n if (console.getBuildSettings().TargetOS.Type == OSType::Windows)\n {\n console.Public += \"org.sw.demo.qtproject.qt.base.plugins.platforms.windows\" QT_VERSION \"\"_dep;\n console.Public += \"org.sw.demo.qtproject.qt.base.plugins.styles.windowsvista\" QT_VERSION \"\"_dep;\n }\n qt_progs_and_tr(console);\n\n auto &host = aspia.addExecutable(\"host\");\n auto &core = host.addSharedLibrary(\"core\");\n setup_target(core, \"host\");\n core -= \".*_entry_point.cc\"_rr, \".*\\\\.rc\"_rr;\n core += \"HOST_IMPLEMENTATION\"_def;\n if (core.getBuildSettings().TargetOS.Type == OSType::Windows)\n core.Public += \"sas.lib\"_slib;\n core.Public += common, qt_base;\n core.Public += \"org.sw.demo.boost.property_tree\"_dep;\n core.Public += \"org.sw.demo.qtproject.qt.base.plugins.platforms.windows\" QT_VERSION \"\"_dep;\n core.Public += \"org.sw.demo.qtproject.qt.base.plugins.styles.windowsvista\" QT_VERSION \"\"_dep;\n qt_progs_and_tr2(core);\n\n setup_exe(host);\n host += \"host\/ui\/host_entry_point.cc\";\n host += \"host\/ui\/host.rc\";\n host += core;\n\n auto &service = add_exe(host, \"service\");\n service += \"host\/win\/service_entry_point.cc\";\n service += \"host\/win\/service.rc\";\n service += core;\n\n auto &desktop_agent = add_exe(aspia, \"desktop_agent\");\n desktop_agent += \"host\/desktop_agent_entry_point.cc\";\n desktop_agent += \"host\/desktop_agent.rc\";\n desktop_agent += core;\n\n auto &client = add_exe(aspia, \"client_exe\");\n client += \"client\/client_entry_point.cc\";\n client += \"client\/client.rc\";\n client += client_core, qt_base;\n}\n<commit_msg>[sw] Initial linux build.<commit_after>#pragma sw require header org.sw.demo.google.protobuf.protoc\n#pragma sw require header org.sw.demo.qtproject.qt.base.tools.moc-6\n\n#define QT_VERSION \"-6\"\n\n\/*void configure(Build &s)\n{\n if (s.isConfigSelected(\"mt\"))\n {\n auto ss = s.createSettings();\n ss.Native.LibrariesType = LibraryType::Static;\n ss.Native.MT = true;\n s.addSettings(ss);\n }\n}*\/\n\nvoid build(Solution &s) {\n auto &aspia = s.addProject(\"aspia\", \"master\");\n aspia += Git(\"https:\/\/github.com\/dchapyshev\/aspia\", \"\", \"{v}\");\n\n constexpr auto cppstd = cpp17;\n\n auto setup_target = [&](auto &t, const String &name, bool add_tests = false, String dir = {}) -> decltype(auto) {\n if (dir.empty())\n dir = name;\n\n t += cppstd;\n t.Public += \".\"_idir;\n t.setRootDirectory(dir);\n t += IncludeDirectory(\".\"s);\n t += \".*\"_rr;\n\n \/\/\n t.AllowEmptyRegexes = true;\n\n \/\/ os specific\n t -= \".*_win\\\\..*\"_rr;\n t -= \".*\/win\/.*\"_rr;\n t -= \".*_linux.*\"_rr;\n t -= \".*\/linux\/.*\"_rr;\n t -= \".*_pulse.*\"_rr;\n t -= \".*_mac.*\"_rr;\n t -= \".*_posix.*\"_rr;\n t -= \".*_x11.*\"_rr;\n if (t.getBuildSettings().TargetOS.Type == OSType::Windows) {\n t += \".*_win.*\"_rr;\n t += \".*\/win\/.*\"_rr;\n } else if (t.getBuildSettings().TargetOS.isApple()) {\n t += \".*_mac.*\"_rr;\n } else {\n t += \".*_pulse.*\"_rr;\n t += \".*_linux.*\"_rr;\n t += \".*\/linux\/.*\"_rr;\n t += \".*_x11.*\"_rr;\n }\n if (t.getBuildSettings().TargetOS.Type != OSType::Windows) {\n t.ExportAllSymbols = true;\n t += \".*_posix.*\"_rr;\n }\n\n t -= \".*_unittest.*\"_rr;\n t -= \".*tests.*\"_rr;\n\n \/\/\n t.AllowEmptyRegexes = false;\n\n \/\/ test\n if (add_tests) {\n auto &bt = t.addExecutable(\"test\");\n bt += cppstd;\n bt += FileRegex(dir, \".*_unittest.*\", true);\n bt += t;\n bt += \"org.sw.demo.google.googletest.gmock\"_dep;\n bt += \"org.sw.demo.google.googletest.gtest.main\"_dep;\n t.addTest(bt);\n }\n\n return t;\n };\n\n auto add_lib = [&aspia, &setup_target](const String &name, bool add_tests = false, String dir = {}) -> decltype(auto) {\n return setup_target(aspia.addStaticLibrary(name), name, add_tests, dir);\n };\n\n auto &protocol = aspia.addStaticLibrary(\"proto\");\n protocol += \"proto\/.*\\\\.proto\"_rr;\n for (const auto &[p, _] : protocol[FileRegex(protocol.SourceDir \/ \"proto\", \".*\\\\.proto\", false)]) {\n ProtobufData d;\n d.outdir = protocol.BinaryDir \/ \"proto\";\n d.public_protobuf = true;\n d.addIncludeDirectory(protocol.SourceDir \/ \"proto\");\n gen_protobuf_cpp(\"org.sw.demo.google.protobuf\"_dep, protocol, p, d);\n }\n\n auto &base = aspia.addStaticLibrary(\"base\");\n {\n base += \"third_party\/modp_b64\/.*\\\\.[hc]\"_rr;\n base += \"third_party\/x11region\/.*\\\\.[hc]\"_rr;\n base -= \"third_party\/xdg_user_dirs\/.*\"_rr;\n if (base.getBuildSettings().TargetOS.Type == OSType::Linux)\n base += \"third_party\/xdg_user_dirs\/.*\"_rr;\n base += \"third_party\/tbb_c_allocator\/.*\"_rr;\n base -= \"build\/.*\"_rr;\n setup_target(base, \"base\", false);\n if (base.getBuildSettings().TargetOS.Type == OSType::Windows) {\n base.Public += \"UNICODE\"_def;\n base.Public += \"WIN32_LEAN_AND_MEAN\"_def;\n base.Public += \"NOMINMAX\"_def;\n }\n base.Public += protocol;\n base.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.qtproject.qt.base.network\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.qtproject.qt.base.xml\" QT_VERSION \"\"_dep;\n base.Public += \"org.sw.demo.boost.align\"_dep;\n base.Public += \"org.sw.demo.imneme.pcg_cpp-master\"_dep;\n base.Public += \"org.sw.demo.chriskohlhoff.asio\"_dep;\n base.Public += \"org.sw.demo.rapidxml\"_dep;\n base.Public += \"org.sw.demo.miloyip.rapidjson\"_dep;\n base.Public += \"org.sw.demo.google.protobuf.protobuf\"_dep; \/\/ should be protobuf_lite actually?\n base.Public += \"org.sw.demo.chromium.libyuv-master\"_dep;\n base.Public += \"org.sw.demo.webmproject.vpx\"_dep;\n base.Public += \"org.sw.demo.webmproject.webm\"_dep;\n base.Public += \"org.sw.demo.xiph.opus\"_dep;\n if (base.getBuildSettings().TargetOS.Type == OSType::Windows) {\n base.Public += \"com.Microsoft.Windows.SDK.winrt\"_dep;\n base +=\n \"Dbghelp.lib\"_slib,\n \"Mswsock.lib\"_slib,\n \"Avrt.lib\"_slib,\n \"comsuppw.lib\"_slib,\n \"Winspool.lib\"_slib,\n \"Setupapi.lib\"_slib\n ;\n } else {\n base -= \"win\/.*\"_rr;\n base -= \"desktop\/frame_dib.cc\";\n base -= \"desktop\/screen_capturer_dxgi.cc\";\n base -= \"desktop\/screen_capturer_wrapper.cc\";\n base -= \"desktop\/screen_capturer_mirror.cc\";\n base -= \"desktop\/screen_capturer_gdi.cc\";\n base -= \"net\/connect_enumerator.cc\";\n base -= \"net\/firewall_manager.cc\";\n base -= \"net\/route_enumerator.cc\";\n base += \"X11\"_slib;\n base += \"Xext\"_slib;\n \/\/base += \"Xdamage\"_slib;\n base += \"Xfixes\"_slib;\n base += \"Xtst\"_slib;\n }\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, base);\n }\n\n auto &relay = aspia.addExecutable(\"relay\");\n {\n relay += cppstd;\n relay -= \"relay\/.*\"_rr;\n relay += \"relay\/.*\"_r;\n if (relay.getBuildSettings().TargetOS.Type == OSType::Windows) {\n relay += \"relay\/win\/.*\"_rr;\n } else if (relay.getBuildSettings().TargetOS.Type == OSType::Linux) {\n relay += \"relay\/linux\/.*\"_rr;\n }\n relay += base;\n }\n\n auto &router = aspia.addExecutable(\"router\");\n {\n router += cppstd;\n router -= \"router\/.*\"_rr;\n router += \"router\/.*\"_r;\n if (router.getBuildSettings().TargetOS.Type == OSType::Windows) {\n router += \"router\/win\/.*\"_rr;\n } else if (router.getBuildSettings().TargetOS.Type == OSType::Linux) {\n router += \"router\/linux\/.*\"_rr;\n }\n router += base;\n router += \"org.sw.demo.sqlite3\"_dep;\n }\n\n auto qt_progs = [](auto &t, const String &name_override = {}, const path &path_override = {}) {\n auto name = name_override.empty() ? t.getPackage().getPath().back() : name_override;\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, t);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t, t.SourceDir \/ path_override \/ (\"resources\/\" + name + \".qrc\"));\n qt_uic(\"org.sw.demo.qtproject.qt.base.tools.uic\" QT_VERSION \"\"_dep, t);\n };\n\n auto qt_progs2 = [](auto &t) {\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, t);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t, t.SourceDir \/ \"ui\/resources.qrc\");\n qt_uic(\"org.sw.demo.qtproject.qt.base.tools.uic\" QT_VERSION \"\"_dep, t);\n };\n\n auto qt_progs_and_tr = [&qt_progs](auto &t, const String &name_override = {}, const path &path_override = {}) {\n auto name = name_override.empty() ? t.getPackage().getPath().back() : name_override;\n\n qt_progs(t, name_override, path_override);\n\n \/\/ trs\n qt_tr(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, t);\n t.configureFile(t.SourceDir \/ path_override \/ (\"translations\/\" + name + \"_translations.qrc\"),\n t.BinaryDir \/ (name + \"_translations.qrc\"), ConfigureFlags::CopyOnly);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t,\n t.BinaryDir \/ (name + \"_translations.qrc\"))\n ->working_directory = t.BinaryDir;\n };\n\n auto qt_progs_and_tr2 = [&qt_progs2](auto &t) {\n qt_progs2(t);\n \/\/ trs\n qt_tr(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, t);\n t.configureFile(t.SourceDir \/ \"ui\/translations.qrc\",\n t.BinaryDir \/ \"translations.qrc\", ConfigureFlags::CopyOnly);\n rcc(\"org.sw.demo.qtproject.qt.base.tools.rcc\" QT_VERSION \"\"_dep, t,\n t.BinaryDir \/ \"translations.qrc\")->working_directory = t.BinaryDir;\n };\n\n auto &common = add_lib(\"common\");\n {\n if (common.getBuildSettings().TargetOS.Type == OSType::Windows) {\n common -= \"file_enumerator_fs.cc\";\n common.Public += \"Shlwapi.lib\"_slib;\n }\n common.Public += base, protocol;\n common.Public += \"org.sw.demo.openssl.crypto\"_dep;\n common.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n if (common.getBuildSettings().TargetOS.Type == OSType::Windows) {\n common.Public += \"org.sw.demo.qtproject.qt.winextras\" QT_VERSION \"\"_dep;\n }\n qt_progs_and_tr(common);\n }\n\n auto &qt_base = add_lib(\"qt_base\");\n {\n qt_base.Public += base;\n qt_base.Public += \"org.sw.demo.qtproject.qt.base.widgets\" QT_VERSION \"\"_dep;\n automoc(\"org.sw.demo.qtproject.qt.base.tools.moc\" QT_VERSION \"\"_dep, qt_base);\n qt_translations_rcc(\"org.sw.demo.qtproject.qt\" QT_VERSION \"\"_dep, aspia, qt_base, \"qt_translations.qrc\");\n }\n\n auto setup_exe = [](auto &t) -> decltype(auto) {\n if (t.getBuildSettings().TargetOS.Type == OSType::Windows) {\n if (auto L = t.getSelectedTool()->template as<VisualStudioLinker*>(); L)\n L->Subsystem = vs::Subsystem::Windows;\n t += \"org.sw.demo.qtproject.qt.base.winmain\" QT_VERSION \"\"_dep;\n }\n return t;\n };\n\n \/\/\n auto &client_core = add_lib(\"client\");\n {\n client_core += \".*\"_rr;\n client_core.Public += common;\n client_core.Public += \"org.sw.demo.qtproject.qt.base.printsupport\" QT_VERSION \"\"_dep;\n if (client_core.getBuildSettings().TargetOS.Type == OSType::Windows)\n client_core.Public += \"org.sw.demo.qtproject.qt.base.plugins.printsupport.windows\" QT_VERSION \"\"_dep;\n else if (client_core.getBuildSettings().TargetOS.Type == OSType::Linux)\n client_core.Public += \"org.sw.demo.qtproject.qt.base.plugins.printsupport.cups\" QT_VERSION \"\"_dep;\n qt_progs_and_tr(client_core);\n }\n\n auto add_exe = [&setup_exe](auto &base, const String &name) -> decltype(auto) {\n return setup_exe(base.addExecutable(name));\n };\n\n \/\/\n auto &console = add_exe(aspia, \"console\");\n setup_target(console, \"console\");\n console.Public += client_core, qt_base;\n if (console.getBuildSettings().TargetOS.Type == OSType::Windows) {\n console.Public += \"org.sw.demo.qtproject.qt.base.plugins.platforms.windows\" QT_VERSION \"\"_dep;\n console.Public += \"org.sw.demo.qtproject.qt.base.plugins.styles.windowsvista\" QT_VERSION \"\"_dep;\n }\n qt_progs_and_tr(console);\n\n auto &client = add_exe(aspia, \"client_exe\");\n client += \"client\/client_entry_point.cc\";\n client += \"client\/client.rc\";\n client += client_core, qt_base;\n\n if (router.getBuildSettings().TargetOS.Type == OSType::Windows) {\n auto &host = aspia.addExecutable(\"host\");\n auto &core = host.addSharedLibrary(\"core\");\n setup_target(core, \"host\");\n core -= \".*_entry_point.cc\"_rr, \".*\\\\.rc\"_rr;\n core += \"HOST_IMPLEMENTATION\"_def;\n if (core.getBuildSettings().TargetOS.Type == OSType::Windows)\n core.Public += \"sas.lib\"_slib;\n core.Public += common, qt_base;\n core.Public += \"org.sw.demo.boost.property_tree\"_dep;\n if (core.getBuildSettings().TargetOS.Type == OSType::Windows)\n {\n core.Public += \"org.sw.demo.qtproject.qt.base.plugins.platforms.windows\" QT_VERSION \"\"_dep;\n core.Public += \"org.sw.demo.qtproject.qt.base.plugins.styles.windowsvista\" QT_VERSION \"\"_dep;\n }\n qt_progs_and_tr2(core);\n\n setup_exe(host);\n host += \"host\/ui\/host_entry_point.cc\";\n host += \"host\/ui\/host.rc\";\n host += core;\n\n auto &service = add_exe(host, \"service\");\n service += \"host\/win\/service_entry_point.cc\";\n service += \"host\/win\/service.rc\";\n service += core;\n\n auto &desktop_agent = add_exe(aspia, \"desktop_agent\");\n desktop_agent += \"host\/desktop_agent_entry_point.cc\";\n desktop_agent += \"host\/desktop_agent.rc\";\n desktop_agent += core;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtCore\/QtCore>\n#include <QtNetwork\/QtNetwork>\n#include <QtTest\/QtTest>\n\n#include \"..\/network-settings.h\"\n\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=\n\nclass tst_QIODevice : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QIODevice();\n virtual ~tst_QIODevice();\n\n\npublic slots:\n void init();\n void cleanup();\nprivate slots:\n void getSetCheck();\n void constructing_QTcpSocket();\n void constructing_QFile();\n void read_QByteArray();\n void unget();\n void peek();\n void getch();\n void putch();\n\n void readLine_data();\n void readLine();\n};\n\n\/\/ Testing get\/set functions\nvoid tst_QIODevice::getSetCheck()\n{\n \/\/ OpenMode QIODevice::openMode()\n \/\/ void QIODevice::setOpenMode(OpenMode)\n class MyIODevice : public QIODevice {\n public:\n void setOpenMode(OpenMode openMode) { QIODevice::setOpenMode(openMode); }\n };\n QTcpSocket var1;\n MyIODevice *obj1 = reinterpret_cast<MyIODevice*>(&var1);\n obj1->setOpenMode(QIODevice::OpenMode(QIODevice::NotOpen));\n QCOMPARE(QIODevice::OpenMode(QIODevice::NotOpen), obj1->openMode());\n obj1->setOpenMode(QIODevice::OpenMode(QIODevice::ReadWrite));\n QCOMPARE(QIODevice::OpenMode(QIODevice::ReadWrite), obj1->openMode());\n}\n\ntst_QIODevice::tst_QIODevice()\n{\n}\n\ntst_QIODevice::~tst_QIODevice()\n{\n\n}\n\nvoid tst_QIODevice::init()\n{\n}\n\nvoid tst_QIODevice::cleanup()\n{\n}\n\n\/\/----------------------------------------------------------------------------------\nvoid tst_QIODevice::constructing_QTcpSocket()\n{\n#if defined(Q_OS_WINCE) && defined(WINCE_EMULATOR_TEST)\n QSKIP(\"Networking tests in a WinCE emulator are unstable\", SkipAll);\n#endif\n QTcpSocket socket;\n QIODevice *device = &socket;\n\n QVERIFY(!device->isOpen());\n\n socket.connectToHost(\"imap.troll.no\", 143);\n QVERIFY(socket.waitForConnected(5000));\n QVERIFY(device->isOpen());\n\n while (!device->canReadLine())\n QVERIFY(device->waitForReadyRead(5000));\n\n char buf[1024];\n memset(buf, 0, sizeof(buf));\n qlonglong lineLength = device->readLine(buf, sizeof(buf));\n QVERIFY(lineLength > 0);\n QCOMPARE(socket.pos(), qlonglong(0));\n\n socket.close();\n socket.connectToHost(\"imap.troll.no\", 143);\n QVERIFY(socket.waitForConnected(5000));\n\n while (!device->canReadLine())\n QVERIFY(device->waitForReadyRead(5000));\n\n char buf2[1024];\n memset(buf2, 0, sizeof(buf2));\n QCOMPARE(socket.readLine(buf2, sizeof(buf2)), lineLength);\n\n char *c1 = buf;\n char *c2 = buf2;\n while (*c1 && *c2) {\n QCOMPARE(*c1, *c2);\n ++c1;\n ++c2;\n }\n QCOMPARE(*c1, *c2);\n}\n\n\/\/----------------------------------------------------------------------------------\nvoid tst_QIODevice::constructing_QFile()\n{\n QFile file;\n QIODevice *device = &file;\n\n QVERIFY(!device->isOpen());\n\n file.setFileName(SRCDIR \"tst_qiodevice.cpp\");\n QVERIFY(file.open(QFile::ReadOnly));\n QVERIFY(device->isOpen());\n QCOMPARE((int) device->openMode(), (int) QFile::ReadOnly);\n\n char buf[1024];\n memset(buf, 0, sizeof(buf));\n qlonglong lineLength = device->readLine(buf, sizeof(buf));\n QVERIFY(lineLength > 0);\n QCOMPARE(file.pos(), lineLength);\n\n file.seek(0);\n char buf2[1024];\n memset(buf2, 0, sizeof(buf2));\n QCOMPARE(file.readLine(buf2, sizeof(buf2)), lineLength);\n\n char *c1 = buf;\n char *c2 = buf2;\n while (*c1 && *c2) {\n QCOMPARE(*c1, *c2);\n ++c1;\n ++c2;\n }\n QCOMPARE(*c1, *c2);\n}\n\n\nvoid tst_QIODevice::read_QByteArray()\n{\n QFile f(SRCDIR \"tst_qiodevice.cpp\");\n f.open(QIODevice::ReadOnly);\n\n QByteArray b = f.read(10);\n QCOMPARE(b.length(), 10);\n\n b = f.read(256);\n QCOMPARE(b.length(), 256);\n\n b = f.read(0);\n QCOMPARE(b.length(), 0);\n}\n\n\/\/--------------------------------------------------------------------\nvoid tst_QIODevice::unget()\n{\n#if defined(Q_OS_WINCE) && defined(WINCE_EMULATOR_TEST)\n QSKIP(\"Networking tests in a WinCE emulator are unstable\", SkipAll);\n#endif\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.write(\"ZXCV\");\n buffer.seek(0);\n QCOMPARE(buffer.read(4), QByteArray(\"ZXCV\"));\n QCOMPARE(buffer.pos(), qint64(4));\n\n buffer.ungetChar('a');\n buffer.ungetChar('b');\n buffer.ungetChar('c');\n buffer.ungetChar('d');\n\n QCOMPARE(buffer.pos(), qint64(0));\n\n char buf[6];\n QCOMPARE(buffer.readLine(buf, 5), qint64(4));\n QCOMPARE(buffer.pos(), qint64(4));\n QCOMPARE(static_cast<const char*>(buf), \"dcba\");\n\n buffer.ungetChar('a');\n buffer.ungetChar('b');\n buffer.ungetChar('c');\n buffer.ungetChar('d');\n\n QCOMPARE(buffer.pos(), qint64(0));\n\n for (int i = 0; i < 5; ++i) {\n buf[0] = '@';\n buf[1] = '@';\n QTest::ignoreMessage(QtWarningMsg,\n \"QIODevice::readLine: Called with maxSize < 2\");\n QCOMPARE(buffer.readLine(buf, 1), qint64(-1));\n QCOMPARE(buffer.readLine(buf, 2), qint64(i < 4 ? 1 : -1));\n switch (i) {\n case 0: QCOMPARE(buf[0], 'd'); break;\n case 1: QCOMPARE(buf[0], 'c'); break;\n case 2: QCOMPARE(buf[0], 'b'); break;\n case 3: QCOMPARE(buf[0], 'a'); break;\n case 4: QCOMPARE(buf[0], '\\0'); break;\n }\n QCOMPARE(buf[1], i < 4 ? '\\0' : '@');\n }\n\n buffer.ungetChar('\\n');\n QCOMPARE(buffer.readLine(), QByteArray(\"\\n\"));\n\n buffer.seek(1);\n buffer.readLine(buf, 3);\n QCOMPARE(static_cast<const char*>(buf), \"XC\");\n\n buffer.seek(4);\n buffer.ungetChar('Q');\n QCOMPARE(buffer.readLine(buf, 3), qint64(1));\n\n for (int i = 0; i < 2; ++i) {\n QTcpSocket socket;\n\tQIODevice *dev;\n\tQByteArray result;\n\tconst char *lineResult;\n\tif (i == 0) {\n dev = &buffer;\n result = QByteArray(\"ZXCV\");\n lineResult = \"ZXCV\";\n } else {\n socket.connectToHost(QtNetworkSettings::serverName(), 80);\n socket.write(\"GET \/ HTTP\/1.0\\r\\n\\r\\n\");\n QVERIFY(socket.waitForReadyRead());\n dev = &socket;\n result = QByteArray(\"HTTP\");\n lineResult = \"Date\";\n\t}\n\tchar ch, ch2;\n\tdev->seek(0);\n\tdev->getChar(&ch);\n\tdev->ungetChar(ch);\n\tQCOMPARE(dev->peek(4), result);\n\tdev->getChar(&ch);\n\tdev->getChar(&ch2);\n\tdev->ungetChar(ch2);\n\tdev->ungetChar(ch);\n\tQCOMPARE(dev->read(1), result.left(1));\n\tQCOMPARE(dev->read(3), result.right(3));\n\n if (i == 0)\n\t dev->seek(0);\n else\n dev->readLine();\n dev->getChar(&ch);\n dev->ungetChar(ch);\n dev->readLine(buf, 5);\n QCOMPARE(static_cast<const char*>(buf), lineResult);\n\n if (i == 1)\n socket.close();\n }\n}\n\n\/\/--------------------------------------------------------------------\nvoid tst_QIODevice::peek()\n{\n QBuffer buffer;\n QFile::remove(\"peektestfile\");\n QFile file(\"peektestfile\");\n\n for (int i = 0; i < 2; ++i) {\n\tQIODevice *device = i ? (QIODevice *)&file : (QIODevice *)&buffer;\n\n\tdevice->open(QBuffer::ReadWrite);\n\tdevice->write(\"ZXCV\");\n\n\tdevice->seek(0);\n\tQCOMPARE(device->peek(4), QByteArray(\"ZXCV\"));\n\tQCOMPARE(device->pos(), qint64(0));\n\tdevice->write(\"ABCDE\");\n\tdevice->seek(3);\n\tQCOMPARE(device->peek(1), QByteArray(\"D\"));\n\tQCOMPARE(device->peek(5), QByteArray(\"DE\"));\n\tdevice->seek(0);\n\tQCOMPARE(device->read(4), QByteArray(\"ABCD\"));\n\tQCOMPARE(device->pos(), qint64(4));\n\n\tdevice->seek(0);\n\tdevice->write(\"ZXCV\");\n\tdevice->seek(0);\n\tchar buf[5];\n\tbuf[4] = 0;\n\tdevice->peek(buf, 4);\n\tQCOMPARE(static_cast<const char *>(buf), \"ZXCV\");\n\tQCOMPARE(device->pos(), qint64(0));\n\tdevice->read(buf, 4);\n\tQCOMPARE(static_cast<const char *>(buf), \"ZXCV\");\n\tQCOMPARE(device->pos(), qint64(4));\n }\n QFile::remove(\"peektestfile\");\n}\n\nvoid tst_QIODevice::getch()\n{\n#ifdef QT3_SUPPORT\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.write(\"\\xff\\x7f\\x80\\x00\", 4);\n buffer.reset();\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n\n buffer.ungetch(0x00);\n buffer.ungetch(0x80);\n buffer.ungetch(0x7f);\n buffer.ungetch(0xff);\n\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n#endif\n}\n\nvoid tst_QIODevice::putch()\n{\n#ifdef QT3_SUPPORT\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.putch(0xff);\n buffer.putch(0x7f);\n buffer.putch(0x80);\n buffer.putch(0x00);\n buffer.reset();\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n#endif\n}\n\nvoid tst_QIODevice::readLine_data()\n{\n QTest::addColumn<QByteArray>(\"data\");\n\n QTest::newRow(\"0\") << QByteArray(\"\\nAA\");\n QTest::newRow(\"1\") << QByteArray(\"A\\nAA\");\n\n QByteArray data(9000, 'A');\n data[8193] = '\\n';\n QTest::newRow(\"8194\") << data;\n data[8193] = 'A';\n data[8192] = '\\n';\n QTest::newRow(\"8193\") << data;\n data[8192] = 'A';\n data[8191] = '\\n';\n QTest::newRow(\"8192\") << data;\n data[8191] = 'A';\n data[8190] = '\\n';\n QTest::newRow(\"8191\") << data;\n\n data[5999] = '\\n';\n QTest::newRow(\"6000\") << data;\n\n data[4095] = '\\n';\n QTest::newRow(\"4096\") << data;\n\n data[4094] = '\\n';\n data[4095] = 'A';\n QTest::newRow(\"4095\") << data;\n}\n\nvoid tst_QIODevice::readLine()\n{\n QFETCH(QByteArray, data);\n QBuffer buffer(&data);\n QVERIFY(buffer.open(QIODevice::ReadWrite));\n QVERIFY(buffer.canReadLine());\n\n int linelen = data.indexOf('\\n') + 1;\n QByteArray line;\n line.reserve(linelen + 100);\n\n int result = buffer.readLine(line.data(), linelen + 100);\n QCOMPARE(result, linelen);\n\n \/\/ try the exact length of the line (plus terminating \\0)\n QVERIFY(buffer.seek(0));\n result = buffer.readLine(line.data(), linelen + 1);\n QCOMPARE(result, linelen);\n\n \/\/ try with a line length limit\n QVERIFY(buffer.seek(0));\n line = buffer.readLine(linelen + 100);\n QCOMPARE(line.size(), linelen);\n\n \/\/ try without a length limit\n QVERIFY(buffer.seek(0));\n line = buffer.readLine();\n QCOMPARE(line.size(), linelen);\n}\n\nQTEST_MAIN(tst_QIODevice)\n#include \"tst_qiodevice.moc\"\n<commit_msg>Use QtNetworkSettings, don't hard code IMAP host name. This should fix failures in Berlin.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n\n#include <QtCore\/QtCore>\n#include <QtNetwork\/QtNetwork>\n#include <QtTest\/QtTest>\n\n#include \"..\/network-settings.h\"\n\n\/\/TESTED_CLASS=\n\/\/TESTED_FILES=\n\nclass tst_QIODevice : public QObject\n{\n Q_OBJECT\n\npublic:\n tst_QIODevice();\n virtual ~tst_QIODevice();\n\n\npublic slots:\n void init();\n void cleanup();\nprivate slots:\n void getSetCheck();\n void constructing_QTcpSocket();\n void constructing_QFile();\n void read_QByteArray();\n void unget();\n void peek();\n void getch();\n void putch();\n\n void readLine_data();\n void readLine();\n};\n\n\/\/ Testing get\/set functions\nvoid tst_QIODevice::getSetCheck()\n{\n \/\/ OpenMode QIODevice::openMode()\n \/\/ void QIODevice::setOpenMode(OpenMode)\n class MyIODevice : public QIODevice {\n public:\n void setOpenMode(OpenMode openMode) { QIODevice::setOpenMode(openMode); }\n };\n QTcpSocket var1;\n MyIODevice *obj1 = reinterpret_cast<MyIODevice*>(&var1);\n obj1->setOpenMode(QIODevice::OpenMode(QIODevice::NotOpen));\n QCOMPARE(QIODevice::OpenMode(QIODevice::NotOpen), obj1->openMode());\n obj1->setOpenMode(QIODevice::OpenMode(QIODevice::ReadWrite));\n QCOMPARE(QIODevice::OpenMode(QIODevice::ReadWrite), obj1->openMode());\n}\n\ntst_QIODevice::tst_QIODevice()\n{\n}\n\ntst_QIODevice::~tst_QIODevice()\n{\n\n}\n\nvoid tst_QIODevice::init()\n{\n}\n\nvoid tst_QIODevice::cleanup()\n{\n}\n\n\/\/----------------------------------------------------------------------------------\nvoid tst_QIODevice::constructing_QTcpSocket()\n{\n#if defined(Q_OS_WINCE) && defined(WINCE_EMULATOR_TEST)\n QSKIP(\"Networking tests in a WinCE emulator are unstable\", SkipAll);\n#endif\n QTcpSocket socket;\n QIODevice *device = &socket;\n\n QVERIFY(!device->isOpen());\n\n socket.connectToHost(QtNetworkSettings::serverName(), 143);\n QVERIFY(socket.waitForConnected(5000));\n QVERIFY(device->isOpen());\n\n while (!device->canReadLine())\n QVERIFY(device->waitForReadyRead(5000));\n\n char buf[1024];\n memset(buf, 0, sizeof(buf));\n qlonglong lineLength = device->readLine(buf, sizeof(buf));\n QVERIFY(lineLength > 0);\n QCOMPARE(socket.pos(), qlonglong(0));\n\n socket.close();\n socket.connectToHost(QtNetworkSettings::serverName(), 143);\n QVERIFY(socket.waitForConnected(5000));\n\n while (!device->canReadLine())\n QVERIFY(device->waitForReadyRead(5000));\n\n char buf2[1024];\n memset(buf2, 0, sizeof(buf2));\n QCOMPARE(socket.readLine(buf2, sizeof(buf2)), lineLength);\n\n char *c1 = buf;\n char *c2 = buf2;\n while (*c1 && *c2) {\n QCOMPARE(*c1, *c2);\n ++c1;\n ++c2;\n }\n QCOMPARE(*c1, *c2);\n}\n\n\/\/----------------------------------------------------------------------------------\nvoid tst_QIODevice::constructing_QFile()\n{\n QFile file;\n QIODevice *device = &file;\n\n QVERIFY(!device->isOpen());\n\n file.setFileName(SRCDIR \"tst_qiodevice.cpp\");\n QVERIFY(file.open(QFile::ReadOnly));\n QVERIFY(device->isOpen());\n QCOMPARE((int) device->openMode(), (int) QFile::ReadOnly);\n\n char buf[1024];\n memset(buf, 0, sizeof(buf));\n qlonglong lineLength = device->readLine(buf, sizeof(buf));\n QVERIFY(lineLength > 0);\n QCOMPARE(file.pos(), lineLength);\n\n file.seek(0);\n char buf2[1024];\n memset(buf2, 0, sizeof(buf2));\n QCOMPARE(file.readLine(buf2, sizeof(buf2)), lineLength);\n\n char *c1 = buf;\n char *c2 = buf2;\n while (*c1 && *c2) {\n QCOMPARE(*c1, *c2);\n ++c1;\n ++c2;\n }\n QCOMPARE(*c1, *c2);\n}\n\n\nvoid tst_QIODevice::read_QByteArray()\n{\n QFile f(SRCDIR \"tst_qiodevice.cpp\");\n f.open(QIODevice::ReadOnly);\n\n QByteArray b = f.read(10);\n QCOMPARE(b.length(), 10);\n\n b = f.read(256);\n QCOMPARE(b.length(), 256);\n\n b = f.read(0);\n QCOMPARE(b.length(), 0);\n}\n\n\/\/--------------------------------------------------------------------\nvoid tst_QIODevice::unget()\n{\n#if defined(Q_OS_WINCE) && defined(WINCE_EMULATOR_TEST)\n QSKIP(\"Networking tests in a WinCE emulator are unstable\", SkipAll);\n#endif\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.write(\"ZXCV\");\n buffer.seek(0);\n QCOMPARE(buffer.read(4), QByteArray(\"ZXCV\"));\n QCOMPARE(buffer.pos(), qint64(4));\n\n buffer.ungetChar('a');\n buffer.ungetChar('b');\n buffer.ungetChar('c');\n buffer.ungetChar('d');\n\n QCOMPARE(buffer.pos(), qint64(0));\n\n char buf[6];\n QCOMPARE(buffer.readLine(buf, 5), qint64(4));\n QCOMPARE(buffer.pos(), qint64(4));\n QCOMPARE(static_cast<const char*>(buf), \"dcba\");\n\n buffer.ungetChar('a');\n buffer.ungetChar('b');\n buffer.ungetChar('c');\n buffer.ungetChar('d');\n\n QCOMPARE(buffer.pos(), qint64(0));\n\n for (int i = 0; i < 5; ++i) {\n buf[0] = '@';\n buf[1] = '@';\n QTest::ignoreMessage(QtWarningMsg,\n \"QIODevice::readLine: Called with maxSize < 2\");\n QCOMPARE(buffer.readLine(buf, 1), qint64(-1));\n QCOMPARE(buffer.readLine(buf, 2), qint64(i < 4 ? 1 : -1));\n switch (i) {\n case 0: QCOMPARE(buf[0], 'd'); break;\n case 1: QCOMPARE(buf[0], 'c'); break;\n case 2: QCOMPARE(buf[0], 'b'); break;\n case 3: QCOMPARE(buf[0], 'a'); break;\n case 4: QCOMPARE(buf[0], '\\0'); break;\n }\n QCOMPARE(buf[1], i < 4 ? '\\0' : '@');\n }\n\n buffer.ungetChar('\\n');\n QCOMPARE(buffer.readLine(), QByteArray(\"\\n\"));\n\n buffer.seek(1);\n buffer.readLine(buf, 3);\n QCOMPARE(static_cast<const char*>(buf), \"XC\");\n\n buffer.seek(4);\n buffer.ungetChar('Q');\n QCOMPARE(buffer.readLine(buf, 3), qint64(1));\n\n for (int i = 0; i < 2; ++i) {\n QTcpSocket socket;\n\tQIODevice *dev;\n\tQByteArray result;\n\tconst char *lineResult;\n\tif (i == 0) {\n dev = &buffer;\n result = QByteArray(\"ZXCV\");\n lineResult = \"ZXCV\";\n } else {\n socket.connectToHost(QtNetworkSettings::serverName(), 80);\n socket.write(\"GET \/ HTTP\/1.0\\r\\n\\r\\n\");\n QVERIFY(socket.waitForReadyRead());\n dev = &socket;\n result = QByteArray(\"HTTP\");\n lineResult = \"Date\";\n\t}\n\tchar ch, ch2;\n\tdev->seek(0);\n\tdev->getChar(&ch);\n\tdev->ungetChar(ch);\n\tQCOMPARE(dev->peek(4), result);\n\tdev->getChar(&ch);\n\tdev->getChar(&ch2);\n\tdev->ungetChar(ch2);\n\tdev->ungetChar(ch);\n\tQCOMPARE(dev->read(1), result.left(1));\n\tQCOMPARE(dev->read(3), result.right(3));\n\n if (i == 0)\n\t dev->seek(0);\n else\n dev->readLine();\n dev->getChar(&ch);\n dev->ungetChar(ch);\n dev->readLine(buf, 5);\n QCOMPARE(static_cast<const char*>(buf), lineResult);\n\n if (i == 1)\n socket.close();\n }\n}\n\n\/\/--------------------------------------------------------------------\nvoid tst_QIODevice::peek()\n{\n QBuffer buffer;\n QFile::remove(\"peektestfile\");\n QFile file(\"peektestfile\");\n\n for (int i = 0; i < 2; ++i) {\n\tQIODevice *device = i ? (QIODevice *)&file : (QIODevice *)&buffer;\n\n\tdevice->open(QBuffer::ReadWrite);\n\tdevice->write(\"ZXCV\");\n\n\tdevice->seek(0);\n\tQCOMPARE(device->peek(4), QByteArray(\"ZXCV\"));\n\tQCOMPARE(device->pos(), qint64(0));\n\tdevice->write(\"ABCDE\");\n\tdevice->seek(3);\n\tQCOMPARE(device->peek(1), QByteArray(\"D\"));\n\tQCOMPARE(device->peek(5), QByteArray(\"DE\"));\n\tdevice->seek(0);\n\tQCOMPARE(device->read(4), QByteArray(\"ABCD\"));\n\tQCOMPARE(device->pos(), qint64(4));\n\n\tdevice->seek(0);\n\tdevice->write(\"ZXCV\");\n\tdevice->seek(0);\n\tchar buf[5];\n\tbuf[4] = 0;\n\tdevice->peek(buf, 4);\n\tQCOMPARE(static_cast<const char *>(buf), \"ZXCV\");\n\tQCOMPARE(device->pos(), qint64(0));\n\tdevice->read(buf, 4);\n\tQCOMPARE(static_cast<const char *>(buf), \"ZXCV\");\n\tQCOMPARE(device->pos(), qint64(4));\n }\n QFile::remove(\"peektestfile\");\n}\n\nvoid tst_QIODevice::getch()\n{\n#ifdef QT3_SUPPORT\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.write(\"\\xff\\x7f\\x80\\x00\", 4);\n buffer.reset();\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n\n buffer.ungetch(0x00);\n buffer.ungetch(0x80);\n buffer.ungetch(0x7f);\n buffer.ungetch(0xff);\n\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n#endif\n}\n\nvoid tst_QIODevice::putch()\n{\n#ifdef QT3_SUPPORT\n QBuffer buffer;\n buffer.open(QBuffer::ReadWrite);\n buffer.putch(0xff);\n buffer.putch(0x7f);\n buffer.putch(0x80);\n buffer.putch(0x00);\n buffer.reset();\n QCOMPARE(buffer.getch(), 0xff);\n QCOMPARE(buffer.getch(), 0x7f);\n QCOMPARE(buffer.getch(), 0x80);\n QCOMPARE(buffer.getch(), 0x00);\n#endif\n}\n\nvoid tst_QIODevice::readLine_data()\n{\n QTest::addColumn<QByteArray>(\"data\");\n\n QTest::newRow(\"0\") << QByteArray(\"\\nAA\");\n QTest::newRow(\"1\") << QByteArray(\"A\\nAA\");\n\n QByteArray data(9000, 'A');\n data[8193] = '\\n';\n QTest::newRow(\"8194\") << data;\n data[8193] = 'A';\n data[8192] = '\\n';\n QTest::newRow(\"8193\") << data;\n data[8192] = 'A';\n data[8191] = '\\n';\n QTest::newRow(\"8192\") << data;\n data[8191] = 'A';\n data[8190] = '\\n';\n QTest::newRow(\"8191\") << data;\n\n data[5999] = '\\n';\n QTest::newRow(\"6000\") << data;\n\n data[4095] = '\\n';\n QTest::newRow(\"4096\") << data;\n\n data[4094] = '\\n';\n data[4095] = 'A';\n QTest::newRow(\"4095\") << data;\n}\n\nvoid tst_QIODevice::readLine()\n{\n QFETCH(QByteArray, data);\n QBuffer buffer(&data);\n QVERIFY(buffer.open(QIODevice::ReadWrite));\n QVERIFY(buffer.canReadLine());\n\n int linelen = data.indexOf('\\n') + 1;\n QByteArray line;\n line.reserve(linelen + 100);\n\n int result = buffer.readLine(line.data(), linelen + 100);\n QCOMPARE(result, linelen);\n\n \/\/ try the exact length of the line (plus terminating \\0)\n QVERIFY(buffer.seek(0));\n result = buffer.readLine(line.data(), linelen + 1);\n QCOMPARE(result, linelen);\n\n \/\/ try with a line length limit\n QVERIFY(buffer.seek(0));\n line = buffer.readLine(linelen + 100);\n QCOMPARE(line.size(), linelen);\n\n \/\/ try without a length limit\n QVERIFY(buffer.seek(0));\n line = buffer.readLine();\n QCOMPARE(line.size(), linelen);\n}\n\nQTEST_MAIN(tst_QIODevice)\n#include \"tst_qiodevice.moc\"\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/time.h>\r\n\r\n#include <sstream>\r\n#include <algorithm>\r\n\r\n#include <benchmark.h>\r\n\r\nextern \"C\" {\r\n#include \"MerkleTree.h\"\r\n}\r\n\r\nstatic const size_t hash_size = 32;\r\n\r\nclass MerkleInsert : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerkleInsert(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerkleInsert() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(hash_size, tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(hash_size, tree, hashes[i]);\r\n }\r\n\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n free_hash(hash_size, hashes[i]);\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nclass MerklePathExtraction : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n std::vector<LowStar_Vector_vector_str___uint8_t_*> paths;\r\n std::vector<uint8_t*> roots;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerklePathExtraction(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerklePathExtraction() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n uint8_t *hash = init_hash(hash_size);\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(hash_size, tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(hash_size, tree, hash);\r\n }\r\n\r\n paths.resize(num_nodes);\r\n roots.resize(num_nodes);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n roots[i] = init_hash(hash_size);\r\n paths[i] = init_path(hash_size);\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_get_path_pre(tree, i, paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_get_path(tree, i, paths[i], roots[i]);\r\n }\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n clear_path(hash_size, paths[i]);\r\n free_path(hash_size, paths[i]);\r\n free_hash(hash_size, roots[i]);\r\n free_hash(hash_size, hashes[i]);\r\n }\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nclass MerklePathVerification : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n std::vector<LowStar_Vector_vector_str___uint8_t_*> paths;\r\n std::vector<uint8_t*> roots;\r\n std::vector<uint32_t> js;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerklePathVerification(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerklePathVerification() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n uint8_t *hash = init_hash(hash_size);\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(hash_size, tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(hash_size, tree, hash);\r\n }\r\n\r\n paths.resize(num_nodes);\r\n roots.resize(num_nodes);\r\n js.resize(num_nodes);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n roots[i] = init_hash(hash_size);\r\n paths[i] = init_path(hash_size);\r\n\r\n #ifdef _DEBUG\r\n if (!mt_get_path_pre(tree, i, paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n js[i] = mt_get_path(tree, i, paths[i], roots[i]);\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_verify(tree, i, js[i], paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n bool ok =\r\n #endif\r\n mt_verify(tree, i, js[i], paths[i], roots[i]);\r\n #ifdef _DEBUG\r\n if (!ok)\r\n throw std::logic_error(\"postcondition violation\");\r\n #endif\r\n }\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n clear_path(hash_size, paths[i]);\r\n free_path(hash_size, paths[i]);\r\n free_hash(hash_size, roots[i]);\r\n free_hash(hash_size, hashes[i]);\r\n }\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nvoid bench_merkle_insert(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_insert.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerkleInsert(ds));\r\n\r\n Benchmark::run_batch(s, MerkleInsert::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree insertion performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/insertion]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_insert_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree insertion performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [insertion\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_insert_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle_get_path(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_get_path.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerklePathExtraction(ds));\r\n\r\n Benchmark::run_batch(s, MerklePathExtraction::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path extraction performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/path]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_get_path_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path extraction performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [paths\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_get_path_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle_verify(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_verify.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerklePathVerification(ds));\r\n\r\n Benchmark::run_batch(s, MerklePathVerification::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path verification performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/verification]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_verify_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path verification performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [paths\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_verify_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle(const BenchmarkSettings & s)\r\n{\r\n \/\/ These amortize over a number of tree nodes, so shouldn't need many samples.\r\n BenchmarkSettings s_local = s;\r\n s_local.samples = std::max<size_t>(s.samples \/ 1000, 1ul);\r\n s_local.warmup_samples = 0;\r\n\r\n bench_merkle_insert(s_local);\r\n bench_merkle_get_path(s_local);\r\n bench_merkle_verify(s_local);\r\n}<commit_msg>Fix Merkle tree benchmark<commit_after>#include <sys\/time.h>\r\n\r\n#include <sstream>\r\n#include <algorithm>\r\n\r\n#include <benchmark.h>\r\n\r\nextern \"C\" {\r\n#include \"MerkleTree.h\"\r\n}\r\n\r\nstatic const size_t hash_size = 32;\r\n\r\nclass MerkleInsert : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerkleInsert(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerkleInsert() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(tree, hashes[i]);\r\n }\r\n\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n free_hash(hash_size, hashes[i]);\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nclass MerklePathExtraction : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n std::vector<LowStar_Vector_vector_str___uint8_t_*> paths;\r\n std::vector<uint8_t*> roots;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerklePathExtraction(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerklePathExtraction() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n uint8_t *hash = init_hash(hash_size);\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(tree, hash);\r\n }\r\n\r\n paths.resize(num_nodes);\r\n roots.resize(num_nodes);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n roots[i] = init_hash(hash_size);\r\n paths[i] = init_path(hash_size);\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_get_path_pre(tree, i, paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_get_path(tree, i, paths[i], roots[i]);\r\n }\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n clear_path(hash_size, paths[i]);\r\n free_path(hash_size, paths[i]);\r\n free_hash(hash_size, roots[i]);\r\n free_hash(hash_size, hashes[i]);\r\n }\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nclass MerklePathVerification : public Benchmark\r\n{\r\n protected:\r\n size_t num_nodes = 0;\r\n merkle_tree *tree;\r\n std::vector<uint8_t*> hashes;\r\n std::vector<LowStar_Vector_vector_str___uint8_t_*> paths;\r\n std::vector<uint8_t*> roots;\r\n std::vector<uint32_t> js;\r\n\r\n public:\r\n static std::string column_headers() { return \"\\\"Nodes\\\"\" + Benchmark::column_headers(); }\r\n\r\n MerklePathVerification(size_t num_nodes) : Benchmark(), num_nodes(num_nodes) { }\r\n\r\n virtual ~MerklePathVerification() {}\r\n\r\n virtual void bench_setup(const BenchmarkSettings & s)\r\n {\r\n Benchmark::bench_setup(s);\r\n uint8_t *ih = init_hash(hash_size);\r\n tree = mt_create(ih);\r\n free_hash(hash_size, ih);\r\n\r\n hashes.resize(num_nodes, NULL);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n uint8_t *hash = init_hash(hash_size);\r\n hashes[i] = init_hash(hash_size);\r\n for (size_t j = 0; j < 8; j++)\r\n *(hashes[i] + j) = rand() % 8;\r\n #ifdef _DEBUG\r\n if (!mt_insert_pre(tree, hashes[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n mt_insert(tree, hash);\r\n }\r\n\r\n paths.resize(num_nodes);\r\n roots.resize(num_nodes);\r\n js.resize(num_nodes);\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n roots[i] = init_hash(hash_size);\r\n paths[i] = init_path(hash_size);\r\n\r\n #ifdef _DEBUG\r\n if (!mt_get_path_pre(tree, i, paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n #endif\r\n js[i] = mt_get_path(tree, i, paths[i], roots[i]);\r\n }\r\n }\r\n\r\n virtual void bench_func()\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n #ifdef _DEBUG\r\n if (!mt_verify(tree, i, js[i], paths[i], roots[i]))\r\n throw std::logic_error(\"precondition violation\");\r\n bool ok =\r\n #endif\r\n mt_verify(tree, i, js[i], paths[i], roots[i]);\r\n #ifdef _DEBUG\r\n if (!ok)\r\n throw std::logic_error(\"postcondition violation\");\r\n #endif\r\n }\r\n }\r\n\r\n virtual void bench_cleanup(const BenchmarkSettings & s)\r\n {\r\n for (uint64_t i = 0; i < num_nodes; i++)\r\n {\r\n clear_path(hash_size, paths[i]);\r\n free_path(hash_size, paths[i]);\r\n free_hash(hash_size, roots[i]);\r\n free_hash(hash_size, hashes[i]);\r\n }\r\n mt_free(tree);\r\n Benchmark::bench_cleanup(s);\r\n }\r\n\r\n virtual void report(std::ostream & rs, const BenchmarkSettings & s) const\r\n {\r\n rs << num_nodes;\r\n Benchmark::report(rs, s);\r\n rs << \"\\n\";\r\n }\r\n};\r\n\r\nvoid bench_merkle_insert(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_insert.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerkleInsert(ds));\r\n\r\n Benchmark::run_batch(s, MerkleInsert::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree insertion performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/insertion]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_insert_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree insertion performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [insertion\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_insert_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle_get_path(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_get_path.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerklePathExtraction(ds));\r\n\r\n Benchmark::run_batch(s, MerklePathExtraction::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path extraction performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/path]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_get_path_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path extraction performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [paths\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_get_path_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle_verify(const BenchmarkSettings & s)\r\n{\r\n size_t data_sizes[] = { 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576 };\r\n std::string data_filename = \"bench_merkle_verify.csv\";\r\n\r\n std::list<Benchmark*> todo;\r\n for (size_t ds: data_sizes)\r\n todo.push_back(new MerklePathVerification(ds));\r\n\r\n Benchmark::run_batch(s, MerklePathVerification::column_headers(), data_filename, todo);\r\n\r\n std::stringstream extras;\r\n extras << \"set boxwidth 0.8\\n\";\r\n extras << \"set key off\\n\";\r\n extras << \"set style histogram clustered gap 3 title\\n\";\r\n extras << \"set style data histograms\\n\";\r\n extras << \"set bmargin 5\\n\";\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path verification performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [CPU cycles\/verification]\",\r\n Benchmark::histogram_line(data_filename, \"\", \"Avg\", \"strcol('Nodes')\", 0),\r\n \"bench_merkle_verify_cycles.svg\",\r\n extras.str());\r\n\r\n std::string X = \"((\" + std::to_string(s.samples) + \" * column('Nodes'))\/(column('CPUexcl')\/1000000000))\";\r\n std::string lbls = \"sprintf(\\\"%dk\\\", column('Nodes')\/1024)\";\r\n Benchmark::PlotSpec plot_specs_timed = {\r\n std::make_pair(data_filename, \"using \" + X + \":xticlabels(\" + lbls + \") with boxes\"),\r\n std::make_pair(\"\", \"using 0:\" + X + \":xticlabels(\" + lbls + \"):(sprintf(\\\"%0.0f\\\", \" + X + \")) with labels font \\\"Courier,8\\\" offset char 0,.5 center notitle\"),\r\n };\r\n\r\n Benchmark::make_plot(s,\r\n \"svg\",\r\n \"Merkle tree path verification performance\",\r\n \"# tree nodes\",\r\n \"Avg. performance [paths\/sec]\",\r\n plot_specs_timed,\r\n \"bench_merkle_verify_timed.svg\",\r\n extras.str());\r\n}\r\n\r\nvoid bench_merkle(const BenchmarkSettings & s)\r\n{\r\n \/\/ These amortize over a number of tree nodes, so shouldn't need many samples.\r\n BenchmarkSettings s_local = s;\r\n s_local.samples = std::max<size_t>(s.samples \/ 1000, 1ul);\r\n s_local.warmup_samples = 0;\r\n\r\n bench_merkle_insert(s_local);\r\n bench_merkle_get_path(s_local);\r\n bench_merkle_verify(s_local);\r\n}<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------- get_dof_indices_01.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$ \n\/\/\n\/\/ Copyright (C) 2006 by the deal.II authors and Anna Schneebeli\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------- get_dof_indices_01.cc ---------------------------\n\n\n\/\/ make sure we can call DoFCellAccessor::get_dof_indices also for\n\/\/ inactive cells\n\n#include \"..\/tests.h\"\n#include <base\/function.h>\n#include <base\/logstream.h>\n#include <lac\/vector.h>\n\n#include <grid\/tria.h>\n#include <dofs\/dof_handler.h>\n#include <grid\/grid_generator.h>\n#include <grid\/grid_refinement.h>\n#include <grid\/tria_accessor.h>\n#include <grid\/tria_iterator.h>\n#include <grid\/tria_boundary_lib.h>\n#include <dofs\/dof_accessor.h>\n#include <dofs\/dof_tools.h>\n#include <fe\/fe_q.h>\n\n#include <fstream>\n#include <iostream>\n#include <vector>\n\n\n\n\n\ntemplate <int dim>\nvoid test ()\n{\n Triangulation<dim> triangulation;\n DoFHandler<dim> dof_handler(triangulation);\n \n GridGenerator::hyper_cube (triangulation);\n triangulation.refine_global (1);\n\n FE_Q<dim> fe(1);\n dof_handler.distribute_dofs (fe);\n\n\t\t\t\t \/\/ loop over all cells, active or\n\t\t\t\t \/\/ not\n std::vector<unsigned int> local_dof_indices (fe.dofs_per_cell);\n for (typename DoFHandler<dim>::cell_iterator cell=dof_handler.begin();\n cell != dof_handler.end(); ++cell)\n {\n cell->get_dof_indices (local_dof_indices);\n\n deallog << \"Cell = \" << cell\n\t << \", DoFs=\";\n for (unsigned int i=0; i<fe.dofs_per_cell; ++i)\n\t{\n\t Assert (local_dof_indices[i] != DoFHandler<dim>::invalid_dof_index,\n\t\t ExcInternalError());\n\t deallog << local_dof_indices[i] << ' ';\n\t}\n \n deallog << std::endl;\n }\n}\n\n\n\nint main ()\n{\n std::ofstream logfile(\"get_dof_indices_01\/output\");\n deallog.attach(logfile);\n deallog.depth_console(0);\n deallog.threshold_double(1.e-10);\n\n test<1>();\n test<2>();\n test<3>();\n \n return 0;\n}\n\n<commit_msg>Avoid exception with Subscriptor.<commit_after>\/\/---------------------------- get_dof_indices_01.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$ \n\/\/\n\/\/ Copyright (C) 2006 by the deal.II authors and Anna Schneebeli\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------- get_dof_indices_01.cc ---------------------------\n\n\n\/\/ make sure we can call DoFCellAccessor::get_dof_indices also for\n\/\/ inactive cells\n\n#include \"..\/tests.h\"\n#include <base\/function.h>\n#include <base\/logstream.h>\n#include <lac\/vector.h>\n\n#include <grid\/tria.h>\n#include <dofs\/dof_handler.h>\n#include <grid\/grid_generator.h>\n#include <grid\/grid_refinement.h>\n#include <grid\/tria_accessor.h>\n#include <grid\/tria_iterator.h>\n#include <grid\/tria_boundary_lib.h>\n#include <dofs\/dof_accessor.h>\n#include <dofs\/dof_tools.h>\n#include <fe\/fe_q.h>\n\n#include <fstream>\n#include <iostream>\n#include <vector>\n\n\n\n\n\ntemplate <int dim>\nvoid test ()\n{\n Triangulation<dim> triangulation;\n FE_Q<dim> fe(1);\n DoFHandler<dim> dof_handler(triangulation);\n \n GridGenerator::hyper_cube (triangulation);\n triangulation.refine_global (1);\n\n dof_handler.distribute_dofs (fe);\n\n\t\t\t\t \/\/ loop over all cells, active or\n\t\t\t\t \/\/ not\n std::vector<unsigned int> local_dof_indices (fe.dofs_per_cell);\n for (typename DoFHandler<dim>::cell_iterator cell=dof_handler.begin();\n cell != dof_handler.end(); ++cell)\n {\n cell->get_dof_indices (local_dof_indices);\n\n deallog << \"Cell = \" << cell\n\t << \", DoFs=\";\n for (unsigned int i=0; i<fe.dofs_per_cell; ++i)\n\t{\n\t Assert (local_dof_indices[i] != DoFHandler<dim>::invalid_dof_index,\n\t\t ExcInternalError());\n\t deallog << local_dof_indices[i] << ' ';\n\t}\n \n deallog << std::endl;\n }\n}\n\n\n\nint main ()\n{\n std::ofstream logfile(\"get_dof_indices_01\/output\");\n deallog.attach(logfile);\n deallog.depth_console(0);\n deallog.threshold_double(1.e-10);\n\n test<1>();\n test<2>();\n test<3>();\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <sparsehash\/dense_hash_map>\n#include <unordered_map>\n\n#include \"hashtable_test_interface.h\"\n#include \"gtest\/gtest.h\"\n#include <unordered_map>\n#include <unordered_set>\n#include <chrono>\n\nusing google::dense_hash_map;\nusing google::dense_hash_set;\n\nnamespace sparsehash_internal = google::sparsehash_internal;\n\nTEST(HashtableMoveTest, Insert_RValue)\n{\n dense_hash_map<int, std::unique_ptr<int>> h;\n h.set_empty_key(0);\n\n auto p1 = std::make_pair(5, std::unique_ptr<int>(new int(1234)));\n auto p = h.insert(std::move(p1));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(5, p.first->first);\n ASSERT_EQ(1234, *p.first->second);\n\n p = h.insert(std::make_pair(10, std::unique_ptr<int>(new int(5678))));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(10, p.first->first);\n ASSERT_EQ(5678, *p.first->second);\n\n ASSERT_EQ(2, (int)h.size());\n}\n\nTEST(HashtableMoveTest, Emplace)\n{\n dense_hash_map<int, std::unique_ptr<int>> h;\n h.set_empty_key(0);\n\n auto p = h.emplace(5, new int(1234));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(5, p.first->first);\n ASSERT_EQ(1234, *p.first->second);\n\n p = h.emplace(10, new int(5678));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(10, p.first->first);\n ASSERT_EQ(5678, *p.first->second);\n\n ASSERT_EQ(2, (int)h.size());\n\n ASSERT_TRUE(h.emplace(11, new int(1)).second);\n ASSERT_FALSE(h.emplace(11, new int(1)).second);\n ASSERT_TRUE(h.emplace(12, new int(1)).second);\n ASSERT_FALSE(h.emplace(12, new int(1)).second);\n}\n\nTEST(HashtableMoveTest, EmplaceHint)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n\n h[1] = 1;\n h[3] = 3;\n h[5] = 5;\n\n ASSERT_FALSE(h.emplace_hint(h.find(1), 1, 0).second);\n ASSERT_FALSE(h.emplace_hint(h.find(3), 1, 0).second);\n ASSERT_FALSE(h.emplace_hint(h.end(), 1, 0).second);\n ASSERT_EQ(3, (int)h.size());\n\n ASSERT_TRUE(h.emplace_hint(h.find(1), 2, 0).second);\n ASSERT_TRUE(h.emplace_hint(h.find(3), 4, 0).second);\n ASSERT_TRUE(h.emplace_hint(h.end(), 6, 0).second);\n ASSERT_EQ(6, (int)h.size());\n}\n\nTEST(HashtableMoveTest, EmplaceHint_SpeedComparison)\n{\n static const int Elements = 1e6;\n static const int Duplicates = 5;\n\n std::vector<int> v(Elements * Duplicates);\n\n for (int i = 0; i < Elements * Duplicates; i += Duplicates)\n {\n auto r = std::rand();\n\n for (int j = 0; j < Duplicates; ++j)\n v[i + j] = r;\n }\n\n std::sort(std::begin(v), std::end(v));\n\n auto start = std::chrono::system_clock::now();\n\n {\n dense_hash_map<int, int> h;\n h.set_empty_key(-1);\n\n for (int i = 0; i < Elements; ++i)\n h.emplace(v[i], 0);\n }\n\n auto end = std::chrono::system_clock::now();\n auto emplace_time = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();\n\n start = std::chrono::system_clock::now();\n\n {\n dense_hash_map<int, int> h;\n h.set_empty_key(-1);\n\n auto hint = h.begin();\n for (int i = 0; i < Elements; ++i)\n hint = h.emplace_hint(hint, v[i], 0).first;\n }\n\n end = std::chrono::system_clock::now();\n auto emplace_hint_time = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();\n\n ASSERT_LE(emplace_hint_time, emplace_time);\n}\n\nstruct A\n{\n A() =default;\n A(int i) noexcept : _i(i) {}\n\n A(const A&) =delete;\n A& operator=(const A&) =delete;\n\n A(A&& a) { _i = a._i; move_ctor = a.move_ctor + 1; }\n A& operator=(A&& a) { _i = a._i; move_assign = a.move_assign + 1; return *this; }\n\n int _i = 0;\n int move_ctor = 0;\n int move_assign = 0;\n};\n\nbool operator==(const A& a1, const A& a2) { return a1._i == a2._i; }\n\nstruct HashA\n{\n std::size_t operator()(const A& a) const { return std::hash<int>()(a._i); }\n};\n\nTEST(HashtableMoveTest, MoveCount)\n{\n dense_hash_map<int, A> h(10);\n h.set_empty_key(0);\n\n h.insert(std::make_pair(5, A()));\n ASSERT_EQ(0, h[5].move_assign);\n ASSERT_EQ(3, h[5].move_ctor);\n}\n\nTEST(HashtableMoveTest, EmplaceMoveCount)\n{\n dense_hash_map<int, A> h;\n h.set_empty_key(0);\n\n h.emplace(1, 2);\n ASSERT_EQ(0, h[1].move_assign);\n ASSERT_EQ(0, h[1].move_ctor);\n}\n\n\nstruct B\n{\n B() =default;\n B(int i) noexcept : _i(i) {}\n\n B(const B& b) { _i = b._i; ++copy_ctor;; }\n B& operator=(const B& b) { _i = b._i; ++copy_assign; return *this; }\n\n B(B&& b) { _i = b._i; ++move_ctor; }\n B& operator=(B&& b) { _i = b._i; ++move_assign; return *this; }\n\n static void reset()\n {\n copy_ctor = 0;\n copy_assign = 0;\n move_ctor = 0;\n move_assign = 0;\n }\n\n int _i = 0;\n\n static int copy_ctor;\n static int copy_assign;\n static int move_ctor;\n static int move_assign;\n};\n\nint B::copy_ctor = 0;\nint B::copy_assign = 0;\nint B::move_ctor = 0;\nint B::move_assign = 0;\n\nstd::ostream& operator<<(std::ostream& os, const B& b)\n{\n return os << b._i << \" copy_ctor=\" << b.copy_ctor << \" copy_assign=\" << b.copy_assign <<\n \" move_ctor=\" << b.move_ctor << \" move_assign=\" << b.move_assign;\n}\n\nbool operator==(const B& b1, const B& b2) { return b1._i == b2._i; }\n\nstruct HashB\n{\n std::size_t operator()(const B& b) const { return std::hash<int>()(b._i); }\n};\n\nTEST(HashtableMoveTest, EmplaceKeyMoveCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n auto p = h.emplace(1, 2);\n ASSERT_EQ(0, p.first->first.copy_ctor);\n ASSERT_EQ(0, p.first->first.copy_assign);\n ASSERT_EQ(0, p.first->first.move_ctor);\n ASSERT_EQ(0, p.first->first.move_assign);\n}\n\nTEST(HashtableMoveTest, InsertKeyRValueCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n auto p = h.insert(std::make_pair(B(2), 2));\n std::cout << p.first->first << std::endl;\n ASSERT_EQ(0, p.first->first.copy_ctor);\n ASSERT_EQ(0, p.first->first.copy_assign);\n}\n\nTEST(HashtableMoveTest, InsertKeyMovedCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n auto m = std::make_pair(B(2), 2);\n auto p = h.insert(std::move(m));\n\n std::cout << p.first->first << std::endl;\n ASSERT_EQ(0, p.first->first.copy_ctor);\n ASSERT_EQ(0, p.first->first.copy_assign);\n}\n\nTEST(HashtableMoveTest, InsertValueRValueCount)\n{\n dense_hash_map<int, B> h;\n h.set_empty_key(0);\n\n B::reset();\n auto p = h.insert(std::make_pair(2, B(2)));\n\n std::cout << p.first->second << std::endl;\n ASSERT_EQ(0, p.first->second.copy_ctor);\n ASSERT_EQ(0, p.first->second.copy_assign);\n}\nTEST(HashtableMoveTest, InsertValueMovedCount)\n{\n dense_hash_map<int, B> h;\n h.set_empty_key(0);\n\n B::reset();\n auto m = std::make_pair(2, B(2));\n auto p = h.insert(std::move(m));\n\n std::cout << p.first->second << std::endl;\n ASSERT_EQ(0, p.first->second.copy_ctor);\n ASSERT_EQ(0, p.first->second.copy_assign);\n}\n\nTEST(HashtableMoveTest, OperatorInsertRValueCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n h[B(1)] = 1;\n\n std::cout << B() << std::endl;\n \/\/ without operator[](const K&): copy_ctor=2 copy_assign=0 move_ctor=1 move_assign=0\n \/\/ now: copy_ctor=0 copy_assign=0 move_ctor=1 move_assign=0\n ASSERT_EQ(0, B::copy_ctor);\n ASSERT_EQ(0, B::copy_assign);\n ASSERT_EQ(1, B::move_ctor);\n ASSERT_EQ(0, B::move_assign);\n}\n\nTEST(HashtableMoveTest, EraseConstIterator)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n const auto it = h.begin();\n ASSERT_TRUE(h.end() == h.erase(it));\n ASSERT_EQ(0, (int)h.size());\n}\n\nTEST(HashtableMoveTest, EraseRange)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n for (int i = 0; i < 10; ++i)\n h[i + 1] = i;\n\n auto it = h.begin();\n std::advance(it, 2);\n\n auto it2 = h.begin();\n std::advance(it2, 8);\n\n auto nextit = h.erase(it, it2);\n ASSERT_FALSE(h.end() == nextit);\n nextit = h.erase(nextit);\n ASSERT_FALSE(h.end() == nextit);\n ASSERT_TRUE(h.end() == h.erase(nextit));\n\n ASSERT_FALSE(h.end() == h.erase(h.begin()));\n ASSERT_TRUE(h.end() == h.erase(h.begin()));\n\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, EraseRangeEntireMap)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n for (int i = 0; i < 10; ++i)\n h[i + 1] = i;\n\n ASSERT_TRUE(h.end() == h.erase(h.begin(), h.end()));\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, EraseNextElementReturned)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n h[2] = 2;\n\n int first = h.begin()->first;\n int second = first == 1 ? 2 : 1;\n\n ASSERT_EQ(second, h.erase(h.begin())->first); \/\/ second element is returned when erasing the first one\n ASSERT_TRUE(h.end() == h.erase(h.begin())); \/\/ end() is returned when erasing the second and last element\n}\n\nTEST(HashtableMoveTest, EraseNumberOfElementsDeleted)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n h[2] = 2;\n\n ASSERT_EQ(0, (int)h.erase(3));\n ASSERT_EQ(1, (int)h.erase(1));\n ASSERT_EQ(1, (int)h.erase(2));\n ASSERT_EQ(0, (int)h.erase(4));\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, CBeginCEnd)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n\n auto it = h.cbegin();\n ASSERT_EQ(1, it->first);\n\n std::advance(it, 1);\n ASSERT_TRUE(it == h.cend());\n\n using cit = dense_hash_map<int, int>::const_iterator;\n cit begin = h.begin();\n cit end = h.end();\n ASSERT_TRUE(begin == h.cbegin());\n ASSERT_TRUE(end == h.cend());\n}\n<commit_msg>Clean up in unit tests<commit_after>#include <sparsehash\/dense_hash_map>\n#include <unordered_map>\n\n#include \"hashtable_test_interface.h\"\n#include \"gtest\/gtest.h\"\n#include <unordered_map>\n#include <unordered_set>\n#include <chrono>\n\nusing google::dense_hash_map;\nusing google::dense_hash_set;\n\nnamespace sparsehash_internal = google::sparsehash_internal;\n\nTEST(HashtableMoveTest, Insert_RValue)\n{\n dense_hash_map<int, std::unique_ptr<int>> h;\n h.set_empty_key(0);\n\n auto p1 = std::make_pair(5, std::unique_ptr<int>(new int(1234)));\n auto p = h.insert(std::move(p1));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(5, p.first->first);\n ASSERT_EQ(1234, *p.first->second);\n\n p = h.insert(std::make_pair(10, std::unique_ptr<int>(new int(5678))));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(10, p.first->first);\n ASSERT_EQ(5678, *p.first->second);\n\n ASSERT_EQ(2, (int)h.size());\n}\n\nTEST(HashtableMoveTest, Emplace)\n{\n dense_hash_map<int, std::unique_ptr<int>> h;\n h.set_empty_key(0);\n\n auto p = h.emplace(5, new int(1234));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(5, p.first->first);\n ASSERT_EQ(1234, *p.first->second);\n\n p = h.emplace(10, new int(5678));\n ASSERT_EQ(true, p.second);\n ASSERT_EQ(10, p.first->first);\n ASSERT_EQ(5678, *p.first->second);\n\n ASSERT_EQ(2, (int)h.size());\n\n ASSERT_TRUE(h.emplace(11, new int(1)).second);\n ASSERT_FALSE(h.emplace(11, new int(1)).second);\n ASSERT_TRUE(h.emplace(12, new int(1)).second);\n ASSERT_FALSE(h.emplace(12, new int(1)).second);\n}\n\nTEST(HashtableMoveTest, EmplaceHint)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n\n h[1] = 1;\n h[3] = 3;\n h[5] = 5;\n\n ASSERT_FALSE(h.emplace_hint(h.find(1), 1, 0).second);\n ASSERT_FALSE(h.emplace_hint(h.find(3), 1, 0).second);\n ASSERT_FALSE(h.emplace_hint(h.end(), 1, 0).second);\n ASSERT_EQ(3, (int)h.size());\n\n ASSERT_TRUE(h.emplace_hint(h.find(1), 2, 0).second);\n ASSERT_TRUE(h.emplace_hint(h.find(3), 4, 0).second);\n ASSERT_TRUE(h.emplace_hint(h.end(), 6, 0).second);\n ASSERT_EQ(6, (int)h.size());\n}\n\nTEST(HashtableMoveTest, EmplaceHint_SpeedComparison)\n{\n static const int Elements = 1e6;\n static const int Duplicates = 5;\n\n std::vector<int> v(Elements * Duplicates);\n\n for (int i = 0; i < Elements * Duplicates; i += Duplicates)\n {\n auto r = std::rand();\n\n for (int j = 0; j < Duplicates; ++j)\n v[i + j] = r;\n }\n\n std::sort(std::begin(v), std::end(v));\n\n auto start = std::chrono::system_clock::now();\n\n {\n dense_hash_map<int, int> h;\n h.set_empty_key(-1);\n\n for (int i = 0; i < Elements; ++i)\n h.emplace(v[i], 0);\n }\n\n auto end = std::chrono::system_clock::now();\n auto emplace_time = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();\n\n start = std::chrono::system_clock::now();\n\n {\n dense_hash_map<int, int> h;\n h.set_empty_key(-1);\n\n auto hint = h.begin();\n for (int i = 0; i < Elements; ++i)\n hint = h.emplace_hint(hint, v[i], 0).first;\n }\n\n end = std::chrono::system_clock::now();\n auto emplace_hint_time = std::chrono::duration_cast<std::chrono::microseconds>(end - start).count();\n\n ASSERT_LE(emplace_hint_time, emplace_time);\n}\n\nstruct A\n{\n A() =default;\n A(int i) noexcept : _i(i) {}\n\n A(const A&) =delete;\n A& operator=(const A&) =delete;\n\n A(A&& a) { _i = a._i; move_ctor = a.move_ctor + 1; }\n A& operator=(A&& a) { _i = a._i; move_assign = a.move_assign + 1; return *this; }\n\n int _i = 0;\n int move_ctor = 0;\n int move_assign = 0;\n};\n\nbool operator==(const A& a1, const A& a2) { return a1._i == a2._i; }\n\nstruct HashA\n{\n std::size_t operator()(const A& a) const { return std::hash<int>()(a._i); }\n};\n\nTEST(HashtableMoveTest, MoveCount)\n{\n dense_hash_map<int, A> h(10);\n h.set_empty_key(0);\n\n h.insert(std::make_pair(5, A()));\n ASSERT_EQ(0, h[5].move_assign);\n ASSERT_EQ(3, h[5].move_ctor);\n}\n\nTEST(HashtableMoveTest, EmplaceMoveCount)\n{\n dense_hash_map<int, A> h;\n h.set_empty_key(0);\n\n h.emplace(1, 2);\n ASSERT_EQ(0, h[1].move_assign);\n ASSERT_EQ(0, h[1].move_ctor);\n}\n\n\nstruct B\n{\n B() =default;\n B(int i) noexcept : _i(i) {}\n\n B(const B& b) { _i = b._i; ++copy_ctor;; }\n B& operator=(const B& b) { _i = b._i; ++copy_assign; return *this; }\n\n B(B&& b) { _i = b._i; ++move_ctor; }\n B& operator=(B&& b) { _i = b._i; ++move_assign; return *this; }\n\n static void reset()\n {\n copy_ctor = 0;\n copy_assign = 0;\n move_ctor = 0;\n move_assign = 0;\n }\n\n int _i = 0;\n\n static int copy_ctor;\n static int copy_assign;\n static int move_ctor;\n static int move_assign;\n};\n\nint B::copy_ctor = 0;\nint B::copy_assign = 0;\nint B::move_ctor = 0;\nint B::move_assign = 0;\n\nstd::ostream& operator<<(std::ostream& os, const B& b)\n{\n return os << b._i << \" copy_ctor=\" << b.copy_ctor << \" copy_assign=\" << b.copy_assign <<\n \" move_ctor=\" << b.move_ctor << \" move_assign=\" << b.move_assign;\n}\n\nbool operator==(const B& b1, const B& b2) { return b1._i == b2._i; }\n\nstruct HashB\n{\n std::size_t operator()(const B& b) const { return std::hash<int>()(b._i); }\n};\n\nTEST(HashtableMoveTest, EmplaceKeyMoveCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n auto p = h.emplace(1, 2);\n ASSERT_EQ(0, p.first->first.copy_ctor);\n ASSERT_EQ(0, p.first->first.copy_assign);\n ASSERT_EQ(0, p.first->first.move_ctor);\n ASSERT_EQ(0, p.first->first.move_assign);\n}\n\nTEST(HashtableMoveTest, InsertKeyRValueCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n h.insert(std::make_pair(B(2), 2));\n\n std::cout << B() << std::endl;\n ASSERT_EQ(0, B::copy_ctor);\n ASSERT_EQ(0, B::copy_assign);\n}\n\nTEST(HashtableMoveTest, InsertKeyMovedCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n auto m = std::make_pair(B(2), 2);\n h.insert(std::move(m));\n\n std::cout << B() << std::endl;\n ASSERT_EQ(0, B::copy_ctor);\n ASSERT_EQ(0, B::copy_assign);\n}\n\nTEST(HashtableMoveTest, InsertValueRValueCount)\n{\n dense_hash_map<int, B> h;\n h.set_empty_key(0);\n\n B::reset();\n auto p = h.insert(std::make_pair(2, B(2)));\n\n std::cout << p.first->second << std::endl;\n ASSERT_EQ(0, p.first->second.copy_ctor);\n ASSERT_EQ(0, p.first->second.copy_assign);\n}\nTEST(HashtableMoveTest, InsertValueMovedCount)\n{\n dense_hash_map<int, B> h;\n h.set_empty_key(0);\n\n B::reset();\n auto m = std::make_pair(2, B(2));\n auto p = h.insert(std::move(m));\n\n std::cout << p.first->second << std::endl;\n ASSERT_EQ(0, p.first->second.copy_ctor);\n ASSERT_EQ(0, p.first->second.copy_assign);\n}\n\nTEST(HashtableMoveTest, OperatorInsertRValueCount)\n{\n dense_hash_map<B, int, HashB> h;\n h.set_empty_key(B(0));\n\n B::reset();\n h[B(1)] = 1;\n\n std::cout << B() << std::endl;\n \/\/ without operator[](const K&): copy_ctor=2 copy_assign=0 move_ctor=1 move_assign=0\n \/\/ now: copy_ctor=0 copy_assign=0 move_ctor=1 move_assign=0\n ASSERT_EQ(0, B::copy_ctor);\n ASSERT_EQ(0, B::copy_assign);\n ASSERT_EQ(1, B::move_ctor);\n ASSERT_EQ(0, B::move_assign);\n}\n\nTEST(HashtableMoveTest, EraseConstIterator)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n const auto it = h.begin();\n ASSERT_TRUE(h.end() == h.erase(it));\n ASSERT_EQ(0, (int)h.size());\n}\n\nTEST(HashtableMoveTest, EraseRange)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n for (int i = 0; i < 10; ++i)\n h[i + 1] = i;\n\n auto it = h.begin();\n std::advance(it, 2);\n\n auto it2 = h.begin();\n std::advance(it2, 8);\n\n auto nextit = h.erase(it, it2);\n ASSERT_FALSE(h.end() == nextit);\n nextit = h.erase(nextit);\n ASSERT_FALSE(h.end() == nextit);\n ASSERT_TRUE(h.end() == h.erase(nextit));\n\n ASSERT_FALSE(h.end() == h.erase(h.begin()));\n ASSERT_TRUE(h.end() == h.erase(h.begin()));\n\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, EraseRangeEntireMap)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n for (int i = 0; i < 10; ++i)\n h[i + 1] = i;\n\n ASSERT_TRUE(h.end() == h.erase(h.begin(), h.end()));\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, EraseNextElementReturned)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n h[2] = 2;\n\n int first = h.begin()->first;\n int second = first == 1 ? 2 : 1;\n\n ASSERT_EQ(second, h.erase(h.begin())->first); \/\/ second element is returned when erasing the first one\n ASSERT_TRUE(h.end() == h.erase(h.begin())); \/\/ end() is returned when erasing the second and last element\n}\n\nTEST(HashtableMoveTest, EraseNumberOfElementsDeleted)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n h[2] = 2;\n\n ASSERT_EQ(0, (int)h.erase(3));\n ASSERT_EQ(1, (int)h.erase(1));\n ASSERT_EQ(1, (int)h.erase(2));\n ASSERT_EQ(0, (int)h.erase(4));\n ASSERT_TRUE(h.empty());\n}\n\nTEST(HashtableMoveTest, CBeginCEnd)\n{\n dense_hash_map<int, int> h;\n h.set_empty_key(0);\n h.set_deleted_key(-1);\n\n h[1] = 1;\n\n auto it = h.cbegin();\n ASSERT_EQ(1, it->first);\n\n std::advance(it, 1);\n ASSERT_TRUE(it == h.cend());\n\n using cit = dense_hash_map<int, int>::const_iterator;\n cit begin = h.begin();\n cit end = h.end();\n ASSERT_TRUE(begin == h.cbegin());\n ASSERT_TRUE(end == h.cend());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n *\n * Copyright (C) 2008, Simon Kagstrom\n *\n * Filename: registerallocator.cc\n * Author: Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description: The register allocator class\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <string.h>\n#include <registerallocator.hh>\n\nRegisterAllocator::RegisterAllocator()\n{\n memset(this->mips_to_local, 0, sizeof(this->mips_to_local));\n memset(this->mips_to_static, 0, sizeof(this->mips_to_static));\n\n this->n_locals = 0;\n}\n\nstatic int allocateRegister(int n, MIPS_register_t reg, MIPS_register_t *sorted, int *usage)\n{\n sorted[n++] = reg;\n usage[reg] = 0;\n return n;\n}\n\nvoid RegisterAllocator::setAllocation(int *registerUsage)\n{\n MIPS_register_t sorted[N_REGS];\n int usage[N_REGS];\n int n = 0;\n\n memset(this->mips_to_local, -1, sizeof(this->mips_to_local));\n memset(sorted, 0, sizeof(sorted));\n memcpy(usage, registerUsage, sizeof(usage));\n\n \/* Allocate initial registers *\/\n if (registerUsage[R_SP] > 0)\n n = allocateRegister(n, R_SP, sorted, usage);\n if (registerUsage[R_A0] > 0)\n n = allocateRegister(n, R_A0, sorted, usage);\n if (registerUsage[R_A1] > 0)\n n = allocateRegister(n, R_A1, sorted, usage);\n if (registerUsage[R_A2] > 0)\n n = allocateRegister(n, R_A2, sorted, usage);\n if (registerUsage[R_A3] > 0)\n n = allocateRegister(n, R_A3, sorted, usage);\n\n \/* Allocate the rest of the registers *\/\n int largest;\n do\n {\n largest = 0;\n MIPS_register_t largestIndex = R_ZERO;\n for (int i = 0; i < N_REGS; i++)\n\t{\n\t if (usage[i] > 0 && usage[i] > largest)\n\t {\n\t largest = usage[i];\n\t largestIndex = (MIPS_register_t)i;\n\t }\n\t}\n if (largest != 0)\n\tn = allocateRegister(n, largestIndex, sorted, usage);\n } while (largest != 0);\n\n \/* Setup the register to local mapping *\/\n for (int i = 0; i < n; i++)\n this->mips_to_local[sorted[i]] = i;\n\n this->n_locals = n;\n}\n\nbool RegisterAllocator::regIsStatic(MIPS_register_t reg)\n{\n return this->regToStatic(reg) != NULL;\n}\n\nconst char *RegisterAllocator::regToStatic(MIPS_register_t reg)\n{\n return this->mips_to_static[reg];\n}\n\nint RegisterAllocator::regToLocal(MIPS_register_t reg)\n{\n return this->mips_to_local[reg];\n}\n\nRegisterAllocator *regalloc;\n<commit_msg>Always pass R_FNA as the last arg if it's used<commit_after>\/*********************************************************************\n *\n * Copyright (C) 2008, Simon Kagstrom\n *\n * Filename: registerallocator.cc\n * Author: Simon Kagstrom <simon.kagstrom@gmail.com>\n * Description: The register allocator class\n *\n * $Id:$\n *\n ********************************************************************\/\n#include <string.h>\n#include <registerallocator.hh>\n\nRegisterAllocator::RegisterAllocator()\n{\n memset(this->mips_to_local, 0, sizeof(this->mips_to_local));\n memset(this->mips_to_static, 0, sizeof(this->mips_to_static));\n\n this->n_locals = 0;\n}\n\nstatic int allocateRegister(int n, MIPS_register_t reg, MIPS_register_t *sorted, int *usage)\n{\n sorted[n++] = reg;\n usage[reg] = 0;\n return n;\n}\n\nvoid RegisterAllocator::setAllocation(int *registerUsage)\n{\n MIPS_register_t sorted[N_REGS];\n int usage[N_REGS];\n int n = 0;\n\n memset(this->mips_to_local, -1, sizeof(this->mips_to_local));\n memset(sorted, 0, sizeof(sorted));\n memcpy(usage, registerUsage, sizeof(usage));\n\n \/* Allocate initial registers *\/\n if (registerUsage[R_SP] > 0)\n n = allocateRegister(n, R_SP, sorted, usage);\n if (registerUsage[R_A0] > 0)\n n = allocateRegister(n, R_A0, sorted, usage);\n if (registerUsage[R_A1] > 0)\n n = allocateRegister(n, R_A1, sorted, usage);\n if (registerUsage[R_A2] > 0)\n n = allocateRegister(n, R_A2, sorted, usage);\n if (registerUsage[R_A3] > 0)\n n = allocateRegister(n, R_A3, sorted, usage);\n if (registerUsage[R_FNA] > 0)\n n = allocateRegister(n, R_FNA, sorted, usage);\n\n \/* Allocate the rest of the registers *\/\n int largest;\n do\n {\n largest = 0;\n MIPS_register_t largestIndex = R_ZERO;\n for (int i = 0; i < N_REGS; i++)\n\t{\n\t if (usage[i] > 0 && usage[i] > largest)\n\t {\n\t largest = usage[i];\n\t largestIndex = (MIPS_register_t)i;\n\t }\n\t}\n if (largest != 0)\n\tn = allocateRegister(n, largestIndex, sorted, usage);\n } while (largest != 0);\n\n \/* Setup the register to local mapping *\/\n for (int i = 0; i < n; i++)\n this->mips_to_local[sorted[i]] = i;\n\n this->n_locals = n;\n}\n\nbool RegisterAllocator::regIsStatic(MIPS_register_t reg)\n{\n return this->regToStatic(reg) != NULL;\n}\n\nconst char *RegisterAllocator::regToStatic(MIPS_register_t reg)\n{\n return this->mips_to_static[reg];\n}\n\nint RegisterAllocator::regToLocal(MIPS_register_t reg)\n{\n return this->mips_to_local[reg];\n}\n\nRegisterAllocator *regalloc;\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <sstream>\n\nstd::string GetHelloString(std::string in)\n{\n\tstd::stringstream ss;\n\tss << \"Hello, \" << in << \"!\";\n\treturn ss.str();\n}\n\n\nint main (int argc, char * argv[])\n{\n\tstd::string name = \"Bob\";\n\n\tif(argc > 1)\n\t\tname = argv[1];\n\n\tstd::cout << GetHelloString(name) << std::endl;\n}<commit_msg>Changing default name to Larry.<commit_after>#include <iostream>\n#include <string>\n#include <sstream>\n\nstd::string GetHelloString(std::string in)\n{\n\tstd::stringstream ss;\n\tss << \"Hello, \" << in << \"!\";\n\treturn ss.str();\n}\n\n\nint main (int argc, char * argv[])\n{\n\tstd::string name = \"Larry\";\n\n\tif(argc > 1)\n\t\tname = argv[1];\n\n\tstd::cout << GetHelloString(name) << std::endl;\n}<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"SkBBoxRecord.h\"\n\nvoid SkBBoxRecord::drawOval(const SkRect& rect, const SkPaint& paint) {\n if (this->transformBounds(rect, &paint)) {\n INHERITED::drawOval(rect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawRRect(const SkRRect& rrect, const SkPaint& paint) {\n if (this->transformBounds(rrect.rect(), &paint)) {\n INHERITED::drawRRect(rrect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawRect(const SkRect& rect, const SkPaint& paint) {\n if (this->transformBounds(rect, &paint)) {\n INHERITED::drawRect(rect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPath(const SkPath& path, const SkPaint& paint) {\n if (this->transformBounds(path.getBounds(), &paint)) {\n INHERITED::drawPath(path, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPoints(PointMode mode, size_t count, const SkPoint pts[],\n const SkPaint& paint) {\n SkRect bbox;\n bbox.set(pts, count);\n \/\/ Small min width value, just to ensure hairline point bounding boxes aren't empty.\n \/\/ Even though we know hairline primitives are drawn one pixel wide, we do not use a\n \/\/ minimum of 1 because the playback scale factor is unknown at record time. Later\n \/\/ outsets will take care of adding additional padding for antialiasing and rounding out\n \/\/ to integer device coordinates, guaranteeing that the rasterized pixels will be included\n \/\/ in the computed bounds.\n \/\/ Note: The device coordinate outset in SkBBoxHierarchyRecord::handleBBox is currently\n \/\/ done in the recording coordinate space, which is wrong.\n \/\/ http:\/\/code.google.com\/p\/skia\/issues\/detail?id=1021\n static const SkScalar kMinWidth = SkFloatToScalar(0.01f); \n SkScalar halfStrokeWidth = SkMaxScalar(paint.getStrokeWidth(), kMinWidth) \/ 2;\n bbox.outset(halfStrokeWidth, halfStrokeWidth);\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPoints(mode, count, pts, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPaint(const SkPaint& paint) {\n SkRect bbox;\n if (this->getClipBounds(&bbox)) {\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPaint(paint);\n }\n }\n}\n\nvoid SkBBoxRecord::clear(SkColor color) {\n SkISize size = this->getDeviceSize();\n SkRect bbox = {0, 0, SkIntToScalar(size.width()), SkIntToScalar(size.height())};\n this->handleBBox(bbox);\n INHERITED::clear(color);\n}\n\nvoid SkBBoxRecord::drawText(const void* text, size_t byteLength, SkScalar x, SkScalar y,\n const SkPaint& paint) {\n SkRect bbox;\n paint.measureText(text, byteLength, &bbox);\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ Vertical and aligned text need to be offset\n if (paint.isVerticalText()) {\n SkScalar h = bbox.fBottom - bbox.fTop;\n if (paint.getTextAlign() == SkPaint::kCenter_Align) {\n bbox.fTop -= h \/ 2;\n bbox.fBottom -= h \/ 2;\n }\n \/\/ Pad top and bottom with max extents from FontMetrics\n bbox.fBottom += metrics.fBottom;\n bbox.fTop += metrics.fTop;\n } else {\n SkScalar w = bbox.fRight - bbox.fLeft;\n if (paint.getTextAlign() == SkPaint::kCenter_Align) {\n bbox.fLeft -= w \/ 2;\n bbox.fRight -= w \/ 2;\n } else if (paint.getTextAlign() == SkPaint::kRight_Align) {\n bbox.fLeft -= w;\n bbox.fRight -= w;\n }\n \/\/ Set vertical bounds to max extents from font metrics\n bbox.fTop = metrics.fTop;\n bbox.fBottom = metrics.fBottom;\n }\n\n \/\/ Pad horizontal bounds on each side by half of max vertical extents (this is sort of\n \/\/ arbitrary, but seems to produce reasonable results, if there were a way of getting max\n \/\/ glyph X-extents to pad by, that may be better here, but FontMetrics fXMin and fXMax seem\n \/\/ incorrect on most platforms (too small in Linux, never even set in Windows).\n SkScalar pad = (metrics.fBottom - metrics.fTop) \/ 2;\n bbox.fLeft -= pad;\n bbox.fRight += pad;\n\n bbox.fLeft += x;\n bbox.fRight += x;\n bbox.fTop += y;\n bbox.fBottom += y;\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawText(text, byteLength, x, y, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmap(const SkBitmap& bitmap, SkScalar left, SkScalar top,\n const SkPaint* paint) {\n SkRect bbox = {left, top, left + bitmap.width(), top + bitmap.height()};\n if (this->transformBounds(bbox, paint)) {\n INHERITED::drawBitmap(bitmap, left, top, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapRectToRect(const SkBitmap& bitmap, const SkRect* src,\n const SkRect& dst, const SkPaint* paint) {\n if (this->transformBounds(dst, paint)) {\n INHERITED::drawBitmapRectToRect(bitmap, src, dst, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapMatrix(const SkBitmap& bitmap, const SkMatrix& mat,\n const SkPaint* paint) {\n SkMatrix m = mat;\n SkRect bbox = {0, 0, SkIntToScalar(bitmap.width()), SkIntToScalar(bitmap.height())};\n m.mapRect(&bbox);\n if (this->transformBounds(bbox, paint)) {\n INHERITED::drawBitmapMatrix(bitmap, mat, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapNine(const SkBitmap& bitmap, const SkIRect& center,\n const SkRect& dst, const SkPaint* paint) {\n if (this->transformBounds(dst, paint)) {\n INHERITED::drawBitmapNine(bitmap, center, dst, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPosText(const void* text, size_t byteLength,\n const SkPoint pos[], const SkPaint& paint) {\n SkRect bbox;\n bbox.set(pos, paint.countText(text, byteLength));\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n bbox.fTop += metrics.fTop;\n bbox.fBottom += metrics.fBottom;\n\n \/\/ pad on left and right by half of max vertical glyph extents\n SkScalar pad = (metrics.fTop - metrics.fBottom) \/ 2;\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPosText(text, byteLength, pos, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPosTextH(const void* text, size_t byteLength, const SkScalar xpos[],\n SkScalar constY, const SkPaint& paint) {\n SkRect bbox;\n size_t numChars = paint.countText(text, byteLength);\n if (numChars > 0) {\n bbox.fLeft = xpos[0];\n bbox.fRight = xpos[numChars - 1];\n \/\/ if we had a guarantee that these will be monotonically increasing, this could be sped up\n for (size_t i = 1; i < numChars; ++i) {\n if (xpos[i] < bbox.fLeft) {\n bbox.fLeft = xpos[i];\n }\n if (xpos[i] > bbox.fRight) {\n bbox.fRight = xpos[i];\n }\n }\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ pad horizontally by max glyph height\n SkScalar pad = (metrics.fTop - metrics.fBottom);\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n\n bbox.fTop = metrics.fTop + constY;\n bbox.fBottom = metrics.fBottom + constY;\n if (!this->transformBounds(bbox, &paint)) {\n return;\n }\n }\n INHERITED::drawPosTextH(text, byteLength, xpos, constY, paint);\n}\n\nvoid SkBBoxRecord::drawSprite(const SkBitmap& bitmap, int left, int top,\n const SkPaint* paint) {\n SkRect bbox = {SkIntToScalar(left), SkIntToScalar(top), SkIntToScalar(left + bitmap.width()), SkIntToScalar(top + bitmap.height())};\n this->handleBBox(bbox); \/\/ directly call handleBBox, matrix is ignored\n INHERITED::drawBitmap(bitmap, left, top, paint);\n}\n\nvoid SkBBoxRecord::drawTextOnPath(const void* text, size_t byteLength,\n const SkPath& path, const SkMatrix* matrix,\n const SkPaint& paint) {\n SkRect bbox = path.getBounds();\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ pad out all sides by the max glyph height above baseline\n SkScalar pad = metrics.fTop;\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n bbox.fTop += pad;\n bbox.fBottom -= pad;\n\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawTextOnPath(text, byteLength, path, matrix, paint);\n }\n}\n\nvoid SkBBoxRecord::drawVertices(VertexMode mode, int vertexCount,\n const SkPoint vertices[], const SkPoint texs[],\n const SkColor colors[], SkXfermode* xfer,\n const uint16_t indices[], int indexCount,\n const SkPaint& paint) {\n SkRect bbox;\n bbox.set(vertices, vertexCount);\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawVertices(mode, vertexCount, vertices, texs,\n colors, xfer, indices, indexCount, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPicture(SkPicture& picture) {\n if (picture.width() > 0 && picture.height() > 0 &&\n this->transformBounds(SkRect::MakeWH(picture.width(), picture.height()), NULL)) {\n INHERITED::drawPicture(picture);\n }\n}\n\nbool SkBBoxRecord::transformBounds(const SkRect& bounds, const SkPaint* paint) {\n SkRect outBounds = bounds;\n\n if (paint) {\n \/\/ account for stroking, path effects, shadows, etc\n if (paint->canComputeFastBounds()) {\n SkRect temp;\n outBounds = paint->computeFastBounds(bounds, &temp);\n } else {\n \/\/ set bounds to current clip\n if (!this->getClipBounds(&outBounds)) {\n \/\/ current clip is empty\n return false;\n }\n }\n }\n\n SkRect clip;\n\n if (this->getClipBounds(&clip) && outBounds.intersect(clip)) {\n this->getTotalMatrix().mapRect(&outBounds);\n this->handleBBox(outBounds);\n return true;\n }\n\n return false;\n}\n\n<commit_msg>Fixing bounding box computation for inverse filled paths in SkBBoxRecord<commit_after>\n\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"SkBBoxRecord.h\"\n\nvoid SkBBoxRecord::drawOval(const SkRect& rect, const SkPaint& paint) {\n if (this->transformBounds(rect, &paint)) {\n INHERITED::drawOval(rect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawRRect(const SkRRect& rrect, const SkPaint& paint) {\n if (this->transformBounds(rrect.rect(), &paint)) {\n INHERITED::drawRRect(rrect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawRect(const SkRect& rect, const SkPaint& paint) {\n if (this->transformBounds(rect, &paint)) {\n INHERITED::drawRect(rect, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPath(const SkPath& path, const SkPaint& paint) {\n if (path.isInverseFillType()) {\n \/\/ If path is inverse filled, use the current clip bounds as the\n \/\/ path's device-space bounding box.\n SkIRect clipBounds;\n if (this->getClipDeviceBounds(&clipBounds)) {\n this->handleBBox(SkRect::MakeFromIRect(clipBounds));\n INHERITED::drawPath(path, paint);\n }\n } else if (this->transformBounds(path.getBounds(), &paint)) {\n INHERITED::drawPath(path, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPoints(PointMode mode, size_t count, const SkPoint pts[],\n const SkPaint& paint) {\n SkRect bbox;\n bbox.set(pts, count);\n \/\/ Small min width value, just to ensure hairline point bounding boxes aren't empty.\n \/\/ Even though we know hairline primitives are drawn one pixel wide, we do not use a\n \/\/ minimum of 1 because the playback scale factor is unknown at record time. Later\n \/\/ outsets will take care of adding additional padding for antialiasing and rounding out\n \/\/ to integer device coordinates, guaranteeing that the rasterized pixels will be included\n \/\/ in the computed bounds.\n \/\/ Note: The device coordinate outset in SkBBoxHierarchyRecord::handleBBox is currently\n \/\/ done in the recording coordinate space, which is wrong.\n \/\/ http:\/\/code.google.com\/p\/skia\/issues\/detail?id=1021\n static const SkScalar kMinWidth = SkFloatToScalar(0.01f); \n SkScalar halfStrokeWidth = SkMaxScalar(paint.getStrokeWidth(), kMinWidth) \/ 2;\n bbox.outset(halfStrokeWidth, halfStrokeWidth);\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPoints(mode, count, pts, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPaint(const SkPaint& paint) {\n SkRect bbox;\n if (this->getClipBounds(&bbox)) {\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPaint(paint);\n }\n }\n}\n\nvoid SkBBoxRecord::clear(SkColor color) {\n SkISize size = this->getDeviceSize();\n SkRect bbox = {0, 0, SkIntToScalar(size.width()), SkIntToScalar(size.height())};\n this->handleBBox(bbox);\n INHERITED::clear(color);\n}\n\nvoid SkBBoxRecord::drawText(const void* text, size_t byteLength, SkScalar x, SkScalar y,\n const SkPaint& paint) {\n SkRect bbox;\n paint.measureText(text, byteLength, &bbox);\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ Vertical and aligned text need to be offset\n if (paint.isVerticalText()) {\n SkScalar h = bbox.fBottom - bbox.fTop;\n if (paint.getTextAlign() == SkPaint::kCenter_Align) {\n bbox.fTop -= h \/ 2;\n bbox.fBottom -= h \/ 2;\n }\n \/\/ Pad top and bottom with max extents from FontMetrics\n bbox.fBottom += metrics.fBottom;\n bbox.fTop += metrics.fTop;\n } else {\n SkScalar w = bbox.fRight - bbox.fLeft;\n if (paint.getTextAlign() == SkPaint::kCenter_Align) {\n bbox.fLeft -= w \/ 2;\n bbox.fRight -= w \/ 2;\n } else if (paint.getTextAlign() == SkPaint::kRight_Align) {\n bbox.fLeft -= w;\n bbox.fRight -= w;\n }\n \/\/ Set vertical bounds to max extents from font metrics\n bbox.fTop = metrics.fTop;\n bbox.fBottom = metrics.fBottom;\n }\n\n \/\/ Pad horizontal bounds on each side by half of max vertical extents (this is sort of\n \/\/ arbitrary, but seems to produce reasonable results, if there were a way of getting max\n \/\/ glyph X-extents to pad by, that may be better here, but FontMetrics fXMin and fXMax seem\n \/\/ incorrect on most platforms (too small in Linux, never even set in Windows).\n SkScalar pad = (metrics.fBottom - metrics.fTop) \/ 2;\n bbox.fLeft -= pad;\n bbox.fRight += pad;\n\n bbox.fLeft += x;\n bbox.fRight += x;\n bbox.fTop += y;\n bbox.fBottom += y;\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawText(text, byteLength, x, y, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmap(const SkBitmap& bitmap, SkScalar left, SkScalar top,\n const SkPaint* paint) {\n SkRect bbox = {left, top, left + bitmap.width(), top + bitmap.height()};\n if (this->transformBounds(bbox, paint)) {\n INHERITED::drawBitmap(bitmap, left, top, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapRectToRect(const SkBitmap& bitmap, const SkRect* src,\n const SkRect& dst, const SkPaint* paint) {\n if (this->transformBounds(dst, paint)) {\n INHERITED::drawBitmapRectToRect(bitmap, src, dst, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapMatrix(const SkBitmap& bitmap, const SkMatrix& mat,\n const SkPaint* paint) {\n SkMatrix m = mat;\n SkRect bbox = {0, 0, SkIntToScalar(bitmap.width()), SkIntToScalar(bitmap.height())};\n m.mapRect(&bbox);\n if (this->transformBounds(bbox, paint)) {\n INHERITED::drawBitmapMatrix(bitmap, mat, paint);\n }\n}\n\nvoid SkBBoxRecord::drawBitmapNine(const SkBitmap& bitmap, const SkIRect& center,\n const SkRect& dst, const SkPaint* paint) {\n if (this->transformBounds(dst, paint)) {\n INHERITED::drawBitmapNine(bitmap, center, dst, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPosText(const void* text, size_t byteLength,\n const SkPoint pos[], const SkPaint& paint) {\n SkRect bbox;\n bbox.set(pos, paint.countText(text, byteLength));\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n bbox.fTop += metrics.fTop;\n bbox.fBottom += metrics.fBottom;\n\n \/\/ pad on left and right by half of max vertical glyph extents\n SkScalar pad = (metrics.fTop - metrics.fBottom) \/ 2;\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawPosText(text, byteLength, pos, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPosTextH(const void* text, size_t byteLength, const SkScalar xpos[],\n SkScalar constY, const SkPaint& paint) {\n SkRect bbox;\n size_t numChars = paint.countText(text, byteLength);\n if (numChars > 0) {\n bbox.fLeft = xpos[0];\n bbox.fRight = xpos[numChars - 1];\n \/\/ if we had a guarantee that these will be monotonically increasing, this could be sped up\n for (size_t i = 1; i < numChars; ++i) {\n if (xpos[i] < bbox.fLeft) {\n bbox.fLeft = xpos[i];\n }\n if (xpos[i] > bbox.fRight) {\n bbox.fRight = xpos[i];\n }\n }\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ pad horizontally by max glyph height\n SkScalar pad = (metrics.fTop - metrics.fBottom);\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n\n bbox.fTop = metrics.fTop + constY;\n bbox.fBottom = metrics.fBottom + constY;\n if (!this->transformBounds(bbox, &paint)) {\n return;\n }\n }\n INHERITED::drawPosTextH(text, byteLength, xpos, constY, paint);\n}\n\nvoid SkBBoxRecord::drawSprite(const SkBitmap& bitmap, int left, int top,\n const SkPaint* paint) {\n SkRect bbox = {SkIntToScalar(left), SkIntToScalar(top), SkIntToScalar(left + bitmap.width()), SkIntToScalar(top + bitmap.height())};\n this->handleBBox(bbox); \/\/ directly call handleBBox, matrix is ignored\n INHERITED::drawBitmap(bitmap, left, top, paint);\n}\n\nvoid SkBBoxRecord::drawTextOnPath(const void* text, size_t byteLength,\n const SkPath& path, const SkMatrix* matrix,\n const SkPaint& paint) {\n SkRect bbox = path.getBounds();\n SkPaint::FontMetrics metrics;\n paint.getFontMetrics(&metrics);\n\n \/\/ pad out all sides by the max glyph height above baseline\n SkScalar pad = metrics.fTop;\n bbox.fLeft += pad;\n bbox.fRight -= pad;\n bbox.fTop += pad;\n bbox.fBottom -= pad;\n\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawTextOnPath(text, byteLength, path, matrix, paint);\n }\n}\n\nvoid SkBBoxRecord::drawVertices(VertexMode mode, int vertexCount,\n const SkPoint vertices[], const SkPoint texs[],\n const SkColor colors[], SkXfermode* xfer,\n const uint16_t indices[], int indexCount,\n const SkPaint& paint) {\n SkRect bbox;\n bbox.set(vertices, vertexCount);\n if (this->transformBounds(bbox, &paint)) {\n INHERITED::drawVertices(mode, vertexCount, vertices, texs,\n colors, xfer, indices, indexCount, paint);\n }\n}\n\nvoid SkBBoxRecord::drawPicture(SkPicture& picture) {\n if (picture.width() > 0 && picture.height() > 0 &&\n this->transformBounds(SkRect::MakeWH(picture.width(), picture.height()), NULL)) {\n INHERITED::drawPicture(picture);\n }\n}\n\nbool SkBBoxRecord::transformBounds(const SkRect& bounds, const SkPaint* paint) {\n SkRect outBounds = bounds;\n\n if (paint) {\n \/\/ account for stroking, path effects, shadows, etc\n if (paint->canComputeFastBounds()) {\n SkRect temp;\n outBounds = paint->computeFastBounds(bounds, &temp);\n } else {\n \/\/ set bounds to current clip\n if (!this->getClipBounds(&outBounds)) {\n \/\/ current clip is empty\n return false;\n }\n }\n }\n\n SkRect clip;\n\n if (this->getClipBounds(&clip) && outBounds.intersect(clip)) {\n this->getTotalMatrix().mapRect(&outBounds);\n this->handleBBox(outBounds);\n return true;\n }\n\n return false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef ENTITY_MANAGER_HPP\n#define ENTITY_MANAGER_HPP\n\n#include <string>\n#include <map>\n\n#include \"item.hpp\"\n#include \"weapon.hpp\"\n#include \"armor.hpp\"\n#include \"creature.hpp\"\n#include \"area.hpp\"\n#include \"door.hpp\"\n\nclass EntityManager\n{\n\tprivate:\n\n\tstd::map<std::string, Item> dataItem;\n\tstd::map<std::string, Weapon> dataWeapon;\n\tstd::map<std::string, Armor> dataArmor;\n\tstd::map<std::string, Creature> dataCreature;\n\tstd::map<std::string, Area> dataArea;\n\tstd::map<std::string, Door> dataDoor;\n\n\ttemplate<typename T>\n\tvoid loadJson(std::string filename, std::map<std::string, T>& data);\n\n\tpublic:\n\n\ttemplate<typename T>\n\tvoid loadJson(std::string filename);\n\n\ttemplate<typename T>\n\tT* getEntity(std::string id);\n\n\tEntityManager();\n\n};\n#endif \/* ENTITY_MANAGER_HPP *\/<commit_msg>Commented EntityManager<commit_after>#ifndef ENTITY_MANAGER_HPP\n#define ENTITY_MANAGER_HPP\n\n#include <string>\n#include <map>\n\n#include \"item.hpp\"\n#include \"weapon.hpp\"\n#include \"armor.hpp\"\n#include \"creature.hpp\"\n#include \"area.hpp\"\n#include \"door.hpp\"\n\nclass EntityManager\n{\n\tprivate:\n\n\tstd::map<std::string, Item> dataItem;\n\tstd::map<std::string, Weapon> dataWeapon;\n\tstd::map<std::string, Armor> dataArmor;\n\tstd::map<std::string, Creature> dataCreature;\n\tstd::map<std::string, Area> dataArea;\n\tstd::map<std::string, Door> dataDoor;\n\n\t\/\/ Read the JSON file given by filename and interpret it according\n\t\/\/ to the type T, before storing all entities read in the data map\n\ttemplate<typename T>\n\tvoid loadJson(std::string filename, std::map<std::string, T>& data);\n\n\tpublic:\n\n\t\/\/ Load the JSON file and determine which map to save the data to\n\t\/\/ according to the type T\n\ttemplate<typename T>\n\tvoid loadJson(std::string filename);\n\n\t\/\/ Return the entity given by id\n\ttemplate<typename T>\n\tT* getEntity(std::string id);\n\n\t\/\/ Constructor\n\tEntityManager();\n\n};\n#endif \/* ENTITY_MANAGER_HPP *\/<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2016 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the author nor the names of other contributors may\n\/\/ be used to endorse or promote products derived from this software\n\/\/ without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"pch.hpp\"\n\n#include <core\/debug.h>\n#include <core\/audio\/Player.h>\n#include <core\/plugin\/PluginFactory.h>\n#include <algorithm>\n\n#define MAX_PREBUFFER_QUEUE_COUNT 8\n\nusing namespace musik::core::audio;\nusing std::min;\nusing std::max;\n\nstatic std::string TAG = \"Player\";\n\nPlayerPtr Player::Create(const std::string &url, OutputPtr output) {\n return PlayerPtr(new Player(url, output));\n}\n\nOutputPtr Player::CreateDefaultOutput() {\n \/* if no output is specified, find all output plugins, and select the first one. *\/\n typedef std::vector<OutputPtr> OutputVector;\n\n OutputVector outputs = musik::core::PluginFactory::Instance().QueryInterface<\n IOutput, musik::core::PluginFactory::DestroyDeleter<IOutput> >(\"GetAudioOutput\");\n\n if (!outputs.empty()) {\n musik::debug::info(TAG, \"found an IOutput device!\");\n return outputs.front();\n }\n\n return OutputPtr();\n}\n\nPlayer::Player(const std::string &url, OutputPtr output)\n: state(Player::Precache)\n, url(url)\n, currentPosition(0)\n, output(output)\n, notifiedStarted(false)\n, setPosition(-1) {\n musik::debug::info(TAG, \"new instance created\");\n\n \/* we allow callers to specify an output device; but if they don't,\n we will create and manage our own. *\/\n if (!this->output) {\n throw std::runtime_error(\"output cannot be null!\");\n }\n\n \/* each player instance is driven by a background thread. start it. *\/\n this->thread.reset(new boost::thread(boost::bind(&Player::ThreadLoop, this)));\n}\n\nPlayer::~Player() {\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Quit;\n this->prebufferQueue.clear();\n this->writeToOutputCondition.notify_all();\n }\n\n this->thread->join();\n}\n\nvoid Player::Play() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Playing;\n this->writeToOutputCondition.notify_all();\n}\n\nvoid Player::Stop() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Quit;\n this->writeToOutputCondition.notify_all();\n}\n\ndouble Player::Position() {\n boost::mutex::scoped_lock lock(this->positionMutex);\n return this->currentPosition;\n}\n\nvoid Player::SetPosition(double seconds) {\n boost::mutex::scoped_lock lock(this->positionMutex);\n this->setPosition = std::max(0.0, seconds);\n}\n\nint Player::State() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n return this->state;\n}\n\nvoid Player::ThreadLoop() {\n \/* create and open the stream *\/\n this->stream = Stream::Create();\n\n if (this->stream->OpenStream(this->url)) {\n \/* precache until buffers are full *\/\n bool keepPrecaching = true;\n while (this->State() == Precache && keepPrecaching) {\n keepPrecaching = this->PreBuffer();\n }\n\n \/* wait until we enter the Playing or Quit state; we may still\n be in the Precache state. *\/\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->state == Precache) {\n this->writeToOutputCondition.wait(lock);\n }\n }\n\n \/* we're ready to go.... *\/\n bool finished = false;\n BufferPtr buffer;\n\n while (!finished && !this->Exited()) {\n \/* see if we've been asked to seek since the last sample was\n played. if we have, clear our output buffer and seek the\n stream. *\/\n double position = -1;\n\n {\n boost::mutex::scoped_lock lock(this->positionMutex);\n position = this->setPosition;\n this->setPosition = -1;\n }\n\n if (position != -1) {\n this->output->Stop(); \/* flush all buffers *\/\n this->output->Resume(); \/* start it back up *\/\n\n \/* if we've allocated a buffer, but it hasn't been written\n to the output yet, unlock it. this is an important step, and if\n not performed, will result in a deadlock just below while \n waiting for all buffers to complete. *\/\n if (buffer) {\n this->OnBufferProcessed(buffer.get());\n buffer.reset();\n }\n\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->lockedBuffers.size() > 0) {\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n\n this->stream->SetPosition(position);\n\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->prebufferQueue.clear();\n }\n }\n\n \/* let's see if we can find some samples to play *\/\n if (!buffer) {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n \/* the buffer queue may already have some available if it was prefetched. *\/\n if (!this->prebufferQueue.empty()) {\n buffer = this->prebufferQueue.front();\n this->prebufferQueue.pop_front();\n }\n \/* otherwise, we need to grab a buffer from the stream and add it to the queue *\/\n else {\n buffer = this->stream->GetNextProcessedOutputBuffer();\n }\n\n \/* lock it down until it's processed *\/\n if (buffer) {\n this->lockedBuffers.push_back(buffer);\n }\n }\n\n \/* if we have a decoded, processed buffer available. let's try to send it to\n the output device. *\/\n if (buffer) {\n if (this->output->Play(buffer.get(), this)) {\n \/* success! the buffer was accepted by the output.*\/\n \/* lock it down so it's not destroyed until the output device lets us\n know it's done with it. *\/\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n if (this->lockedBuffers.size() == 1) {\n this->currentPosition = buffer->Position();\n }\n\n buffer.reset(); \/* important! we're done with this one locally. *\/\n }\n else {\n \/* the output device queue is full. we should block and wait until\n the output lets us know that it needs more data *\/\n boost::mutex::scoped_lock lock(this->queueMutex);\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n \/* if we're unable to obtain a buffer, it means we're out of data and the\n player is finished. terminate the thread. *\/\n else {\n finished = true;\n }\n }\n\n \/* if the Quit flag isn't set, that means the stream has ended \"naturally\", i.e.\n it wasn't stopped by the user. raise the \"almost ended\" flag. *\/\n if (!this->Exited()) {\n this->PlaybackAlmostEnded(this);\n }\n }\n\n \/* if the stream failed to open... *\/\n else {\n this->PlaybackError(this);\n }\n\n this->state = Player::Quit;\n\n \/* wait until all remaining buffers have been written, set final state... *\/\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->lockedBuffers.size() > 0) {\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n\n this->PlaybackFinished(this);\n}\n\nvoid Player::ReleaseAllBuffers() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->lockedBuffers.empty();\n}\n\nbool Player::PreBuffer() {\n \/* don't prebuffer if the buffer is already full *\/\n if (this->prebufferQueue.size() < MAX_PREBUFFER_QUEUE_COUNT) {\n BufferPtr newBuffer = this->stream->GetNextProcessedOutputBuffer();\n\n if (newBuffer) {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->prebufferQueue.push_back(newBuffer);\n }\n\n return true;\n }\n\n return false;\n}\n\nbool Player::Exited() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n return (this->state == Player::Quit);\n}\n\nvoid Player::OnBufferProcessed(IBuffer *buffer) {\n bool started = false;\n bool found = false;\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n \/* removes the specified buffer from the list of locked buffers, and also\n lets the stream know it can be recycled. *\/\n BufferList::iterator it = this->lockedBuffers.begin();\n while (it != this->lockedBuffers.end() && !found) {\n if (it->get() == buffer) {\n found = true;\n\n if (this->stream) {\n this->stream->OnBufferProcessedByPlayer(*it);\n }\n\n it = this->lockedBuffers.erase(it);\n\n \/* this sets the current time in the stream. it does this by grabbing\n the time at the next buffer in the queue *\/\n if (!this->lockedBuffers.empty()) {\n this->currentPosition = this->lockedBuffers.front()->Position();\n }\n else {\n \/* if the queue is drained, use the position from the buffer\n that was just processed *\/\n this->currentPosition = ((Buffer*) buffer)->Position();\n }\n\n \/* if the output device's internal buffers are full, it will stop\n accepting new samples. now that a buffer has been processed, we can\n try to enqueue another sample. the thread loop blocks on this condition *\/\n this->writeToOutputCondition.notify_all();\n }\n else {\n ++it;\n }\n }\n\n if (!this->notifiedStarted) {\n this->notifiedStarted = true;\n started = true;\n }\n }\n\n \/* we notify our listeners that we've started playing only after the first\n buffer has been consumed. this is because sometimes we precache buffers\n and send them to the output before they are actually processed by the\n output device *\/\n if (started) {\n this->PlaybackStarted(this);\n }\n}\n<commit_msg>Fixed a bug that could result in Player threads being unable to terminate.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2016 musikcube team\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the author nor the names of other contributors may\n\/\/ be used to endorse or promote products derived from this software\n\/\/ without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"pch.hpp\"\n\n#include <core\/debug.h>\n#include <core\/audio\/Player.h>\n#include <core\/plugin\/PluginFactory.h>\n#include <algorithm>\n\n#define MAX_PREBUFFER_QUEUE_COUNT 8\n\nusing namespace musik::core::audio;\nusing std::min;\nusing std::max;\n\nstatic std::string TAG = \"Player\";\n\nPlayerPtr Player::Create(const std::string &url, OutputPtr output) {\n return PlayerPtr(new Player(url, output));\n}\n\nOutputPtr Player::CreateDefaultOutput() {\n \/* if no output is specified, find all output plugins, and select the first one. *\/\n typedef std::vector<OutputPtr> OutputVector;\n\n OutputVector outputs = musik::core::PluginFactory::Instance().QueryInterface<\n IOutput, musik::core::PluginFactory::DestroyDeleter<IOutput> >(\"GetAudioOutput\");\n\n if (!outputs.empty()) {\n musik::debug::info(TAG, \"found an IOutput device!\");\n return outputs.front();\n }\n\n return OutputPtr();\n}\n\nPlayer::Player(const std::string &url, OutputPtr output)\n: state(Player::Precache)\n, url(url)\n, currentPosition(0)\n, output(output)\n, notifiedStarted(false)\n, setPosition(-1) {\n musik::debug::info(TAG, \"new instance created\");\n\n \/* we allow callers to specify an output device; but if they don't,\n we will create and manage our own. *\/\n if (!this->output) {\n throw std::runtime_error(\"output cannot be null!\");\n }\n\n \/* each player instance is driven by a background thread. start it. *\/\n this->thread.reset(new boost::thread(boost::bind(&Player::ThreadLoop, this)));\n}\n\nPlayer::~Player() {\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Quit;\n this->prebufferQueue.clear();\n this->writeToOutputCondition.notify_all();\n }\n\n this->thread->join();\n}\n\nvoid Player::Play() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Playing;\n this->writeToOutputCondition.notify_all();\n}\n\nvoid Player::Stop() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->state = Player::Quit;\n this->writeToOutputCondition.notify_all();\n}\n\ndouble Player::Position() {\n boost::mutex::scoped_lock lock(this->positionMutex);\n return this->currentPosition;\n}\n\nvoid Player::SetPosition(double seconds) {\n boost::mutex::scoped_lock lock(this->positionMutex);\n this->setPosition = std::max(0.0, seconds);\n}\n\nint Player::State() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n return this->state;\n}\n\nvoid Player::ThreadLoop() {\n \/* create and open the stream *\/\n this->stream = Stream::Create();\n\n BufferPtr buffer;\n\n if (this->stream->OpenStream(this->url)) {\n \/* precache until buffers are full *\/\n bool keepPrecaching = true;\n while (this->State() == Precache && keepPrecaching) {\n keepPrecaching = this->PreBuffer();\n }\n\n \/* wait until we enter the Playing or Quit state; we may still\n be in the Precache state. *\/\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->state == Precache) {\n this->writeToOutputCondition.wait(lock);\n }\n }\n\n \/* we're ready to go.... *\/\n bool finished = false;\n\n while (!finished && !this->Exited()) {\n \/* see if we've been asked to seek since the last sample was\n played. if we have, clear our output buffer and seek the\n stream. *\/\n double position = -1;\n\n {\n boost::mutex::scoped_lock lock(this->positionMutex);\n position = this->setPosition;\n this->setPosition = -1;\n }\n\n if (position != -1) {\n this->output->Stop(); \/* flush all buffers *\/\n this->output->Resume(); \/* start it back up *\/\n\n \/* if we've allocated a buffer, but it hasn't been written\n to the output yet, unlock it. this is an important step, and if\n not performed, will result in a deadlock just below while\n waiting for all buffers to complete. *\/\n if (buffer) {\n this->OnBufferProcessed(buffer.get());\n buffer.reset();\n }\n\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->lockedBuffers.size() > 0) {\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n\n this->stream->SetPosition(position);\n\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->prebufferQueue.clear();\n }\n }\n\n \/* let's see if we can find some samples to play *\/\n if (!buffer) {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n \/* the buffer queue may already have some available if it was prefetched. *\/\n if (!this->prebufferQueue.empty()) {\n buffer = this->prebufferQueue.front();\n this->prebufferQueue.pop_front();\n }\n \/* otherwise, we need to grab a buffer from the stream and add it to the queue *\/\n else {\n buffer = this->stream->GetNextProcessedOutputBuffer();\n }\n\n \/* lock it down until it's processed *\/\n if (buffer) {\n this->lockedBuffers.push_back(buffer);\n }\n }\n\n \/* if we have a decoded, processed buffer available. let's try to send it to\n the output device. *\/\n if (buffer) {\n if (this->output->Play(buffer.get(), this)) {\n \/* success! the buffer was accepted by the output.*\/\n \/* lock it down so it's not destroyed until the output device lets us\n know it's done with it. *\/\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n if (this->lockedBuffers.size() == 1) {\n this->currentPosition = buffer->Position();\n }\n\n buffer.reset(); \/* important! we're done with this one locally. *\/\n }\n else {\n \/* the output device queue is full. we should block and wait until\n the output lets us know that it needs more data *\/\n boost::mutex::scoped_lock lock(this->queueMutex);\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n \/* if we're unable to obtain a buffer, it means we're out of data and the\n player is finished. terminate the thread. *\/\n else {\n finished = true;\n }\n }\n\n \/* if the Quit flag isn't set, that means the stream has ended \"naturally\", i.e.\n it wasn't stopped by the user. raise the \"almost ended\" flag. *\/\n if (!this->Exited()) {\n this->PlaybackAlmostEnded(this);\n }\n }\n\n \/* if the stream failed to open... *\/\n else {\n this->PlaybackError(this);\n }\n\n this->state = Player::Quit;\n\n \/* unlock any remaining buffers... see comment above *\/\n if (buffer) {\n this->OnBufferProcessed(buffer.get());\n buffer.reset();\n }\n\n \/* wait until all remaining buffers have been written, set final state... *\/\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n while (this->lockedBuffers.size() > 0) {\n writeToOutputCondition.wait(this->queueMutex);\n }\n }\n\n this->PlaybackFinished(this);\n}\n\nvoid Player::ReleaseAllBuffers() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->lockedBuffers.empty();\n}\n\nbool Player::PreBuffer() {\n \/* don't prebuffer if the buffer is already full *\/\n if (this->prebufferQueue.size() < MAX_PREBUFFER_QUEUE_COUNT) {\n BufferPtr newBuffer = this->stream->GetNextProcessedOutputBuffer();\n\n if (newBuffer) {\n boost::mutex::scoped_lock lock(this->queueMutex);\n this->prebufferQueue.push_back(newBuffer);\n }\n\n return true;\n }\n\n return false;\n}\n\nbool Player::Exited() {\n boost::mutex::scoped_lock lock(this->queueMutex);\n return (this->state == Player::Quit);\n}\n\nvoid Player::OnBufferProcessed(IBuffer *buffer) {\n bool started = false;\n bool found = false;\n {\n boost::mutex::scoped_lock lock(this->queueMutex);\n\n \/* removes the specified buffer from the list of locked buffers, and also\n lets the stream know it can be recycled. *\/\n BufferList::iterator it = this->lockedBuffers.begin();\n while (it != this->lockedBuffers.end() && !found) {\n if (it->get() == buffer) {\n found = true;\n\n if (this->stream) {\n this->stream->OnBufferProcessedByPlayer(*it);\n }\n\n it = this->lockedBuffers.erase(it);\n\n \/* this sets the current time in the stream. it does this by grabbing\n the time at the next buffer in the queue *\/\n if (!this->lockedBuffers.empty()) {\n this->currentPosition = this->lockedBuffers.front()->Position();\n }\n else {\n \/* if the queue is drained, use the position from the buffer\n that was just processed *\/\n this->currentPosition = ((Buffer*) buffer)->Position();\n }\n\n \/* if the output device's internal buffers are full, it will stop\n accepting new samples. now that a buffer has been processed, we can\n try to enqueue another sample. the thread loop blocks on this condition *\/\n this->writeToOutputCondition.notify_all();\n }\n else {\n ++it;\n }\n }\n\n if (!this->notifiedStarted) {\n this->notifiedStarted = true;\n started = true;\n }\n }\n\n \/* we notify our listeners that we've started playing only after the first\n buffer has been consumed. this is because sometimes we precache buffers\n and send them to the output before they are actually processed by the\n output device *\/\n if (started) {\n this->PlaybackStarted(this);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"OpenAssetImport.h\"\n\n#include <assimp.hpp> \/\/ C++ importer interface\n#include <aiScene.h> \/\/ Output data structure\n#include <aiPostProcess.h> \/\/ Post processing flags\n#include <Logger.h>\n#include <DefaultLogger.h>\n#include <Ogre.h>\n\nusing namespace Assimp;\n\nnamespace AssImp\n{\n OpenAssetImport::OpenAssetImport() : \n importer_(new Importer()), \n logstream_(new AssImpLogStream()), \n loglevels_(Logger::DEBUGGING | Logger::INFO | Logger::ERR | Logger::WARN),\n default_flags_( aiProcess_JoinIdenticalVertices\t\t|\n aiProcess_Triangulate\t\t\t\t|\n aiProcess_RemoveComponent\t\t\t|\n aiProcess_GenNormals\t\t\t\t|\t\/\/ ignored if model already has normals\n aiProcess_LimitBoneWeights\t\t\t|\n aiProcess_SortByPType\t\t\t\t|\t\/\/ remove point and line primitive types\n aiProcess_ValidateDataStructure \/\/ makes sure that all indices are valid, all animations and bones are linked correctly, all material references are correct...\n )\n {\n \/\/ set up importer\n importer_->SetPropertyInteger(AI_CONFIG_PP_LBW_MAX_WEIGHTS, 4);\t\/\/ limit bone weights to 4 vertices\n\t\t\n importer_->SetPropertyInteger(\t\t\t\/\/ ignore vertex colours, textures, lights and cameras (for now)\n AI_CONFIG_PP_RVC_FLAGS, \n aiComponent_COLORS\t\t|\n aiComponent_TEXTURES\t|\n aiComponent_LIGHTS\t\t|\n aiComponent_CAMERAS\n );\n\n importer_->SetPropertyInteger(\t\t\t\/\/ ignore point and line primitives (for now)\n AI_CONFIG_PP_SBP_REMOVE, \n aiPrimitiveType_POINT\t\t|\n aiPrimitiveType_LINE\n );\n\n Assimp::DefaultLogger::get()->attachStream(logstream_, loglevels_);\n }\n\n OpenAssetImport::~OpenAssetImport()\n {\n Assimp::DefaultLogger::get()->detatchStream(logstream_, loglevels_);\n delete logstream_;\n }\n\n bool OpenAssetImport::IsSupportedExtension(const QString& filename)\n {\n boost::filesystem::path path(filename.toStdString());\n QString extension = QString(path.extension().c_str()).toLower();\n\n return importer_->IsExtensionSupported(extension.toStdString());\n }\n\n void OpenAssetImport::GetMeshData(const QString& file, std::vector<MeshData> &outMeshData)\n {\n const aiScene *scene = importer_->ReadFile(file.toStdString(), default_flags_);\n\n if (scene)\n {\n const struct aiNode *rootNode = scene->mRootNode;\n \n aiMatrix4x4 transform;\n GetNodeData(scene, rootNode, file, transform, outMeshData);\n } else\n { \n \/\/ report error\n Foundation::RootLogError(importer_->GetErrorString());\n }\n }\n\n void OpenAssetImport::Import(const void *data, size_t length, const QString &name, const char* hint, const QString &nodeName, std::vector<std::string> &outMeshNames)\n {\n const aiScene *scene = importer_->ReadFileFromMemory(data, length, default_flags_, hint);\n\n if (scene)\n {\n const struct aiNode *rootNode = scene->mRootNode;\n \n ImportNode(scene, rootNode, name, nodeName, outMeshNames);\n } else\n { \n \/\/ report error\n Foundation::RootLogError(importer_->GetErrorString());\n \/\/return QString(importer_->GetErrorString());\n }\n }\n\n void OpenAssetImport::GetNodeData(const aiScene *scene, const aiNode *node, const QString& file,\n const aiMatrix4x4 &parentTransform, std::vector<MeshData> &outMeshNames)\n {\n aiMatrix4x4 aiTransform = node->mTransformation;\n\n aiMatrix4x4 worldTransform = parentTransform * aiTransform;\n \n aiVector3D pos;\n aiVector3D scale;\n Vector3df rote;\n aiQuaternion rotq;\n worldTransform.Decompose(scale, rotq, pos);\n Quaternion quat(rotq.x, rotq.y, rotq.z, rotq.w);\n \n quat.toEuler(rote);\n rote *= RADTODEG;\n\n\n if (node->mNumMeshes > 0)\n {\n MeshData data = { file, QString(node->mName.data), Transform(Vector3df(pos.x, pos.y, pos.z), rote, Vector3df(scale.x, scale.y, scale.z)) };\n outMeshNames.push_back(data); \n }\n\n \/\/ import children\n for (int i=0 ; i<node->mNumChildren ; ++i)\n GetNodeData(scene, node->mChildren[i], file, worldTransform, outMeshNames);\n }\n\n void OpenAssetImport::ImportNode(const aiScene *scene, const aiNode *node, const QString& file,\n const QString &nodeName, std::vector<std::string> &outMeshNames)\n {\n try\n {\n \/\/ boost::filesystem::path path(file.toStdString());\n \/\/ std::string meshname = path.filename() + boost::lexical_cast<std::string>(nodeIdx);\n std::string ogreMeshName = file.toStdString(); \/\/std::string(\"mesh___\") + meshname;\n std::string meshname = ogreMeshName;\n\n \/*if (scene->mNumMaterials > 0)\n {\n \/\/ testing getting Ogre material.xml names\n aiString name;\n scene->mMaterials[0]->Get(AI_MATKEY_NAME,name);\n Foundation::RootLogInfo(std::string(\"Found material \") + std::string(name.data));\n }*\/\n\n\n \/\/aiMatrix4x4 transform = node->mTransformation;\n if (node->mNumMeshes > 0 && nodeName.compare(QString(node->mName.data)) == 0 && !Ogre::MeshManager::getSingleton().resourceExists(ogreMeshName))\n {\n Ogre::MeshPtr ogreMesh = Ogre::MeshManager::getSingleton().createManual(ogreMeshName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n ogreMesh->setAutoBuildEdgeLists(false);\n\n Ogre::Vector3 vmin(std::numeric_limits<float>::max(), std::numeric_limits<float>::max(), std::numeric_limits<float>::max());\n Ogre::Vector3 vmax(std::numeric_limits<float>::min(), std::numeric_limits<float>::min(), std::numeric_limits<float>::min());\n\n for (unsigned int i=0 ; i<node->mNumMeshes ; ++i)\n {\n const aiMesh *mesh = scene->mMeshes[node->mMeshes[i]];\n \n Ogre::SubMesh *ogreSubmesh = ogreMesh->createSubMesh();\n \n ogreSubmesh->useSharedVertices = false;\n ogreSubmesh->vertexData = new Ogre::VertexData();\n ogreSubmesh->vertexData->vertexCount = mesh->mNumVertices;\n Ogre::VertexData *data = ogreSubmesh->vertexData;\n \n \/\/ Vertex declarations\n size_t offset = 0;\n Ogre::VertexDeclaration* decl = data->vertexDeclaration;\n decl->addElement(0, offset, Ogre::VET_FLOAT3, Ogre::VES_POSITION);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n decl->addElement(0, offset, Ogre::VET_FLOAT3, Ogre::VES_NORMAL);\n\n offset = 0;\n for (int tn=0 ; tn<AI_MAX_NUMBER_OF_TEXTURECOORDS ; ++tn)\n {\n if (mesh->mTextureCoords[tn])\n {\n if (mesh->mNumUVComponents[tn] == 3)\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_TEXTURE_COORDINATES, tn);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n } else\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT2, Ogre::VES_TEXTURE_COORDINATES, tn);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT2);\n }\n }\n }\n if (mesh->HasTangentsAndBitangents())\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_TANGENT);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_BINORMAL);\n }\n\n \/\/ Write vertex data to buffer\n Ogre::HardwareVertexBufferSharedPtr vbuf = Ogre::HardwareBufferManager::getSingleton().createVertexBuffer(\n decl->getVertexSize(0), \/\/ This value is the size of a vertex in memory\n data->vertexCount, \/\/ The number of vertices you'll put into this buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n Ogre::Real *vbData = static_cast<Ogre::Real*>(vbuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n \n offset = 0;\n for (unsigned int n=0 ; n<data->vertexCount ; ++n)\n {\n vbData[offset++] = mesh->mVertices[n].x;\n vbData[offset++] = mesh->mVertices[n].y;\n vbData[offset++] = mesh->mVertices[n].z;\n\n vbData[offset++] = mesh->mNormals[n].x;\n vbData[offset++] = mesh->mNormals[n].y;\n vbData[offset++] = mesh->mNormals[n].z;\n\n vmin.x = std::min(vmin.x, mesh->mVertices[n].x);\n vmin.y = std::min(vmin.y, mesh->mVertices[n].y);\n vmin.z = std::min(vmin.z, mesh->mVertices[n].z);\n\n vmax.x = std::max(vmax.x, mesh->mVertices[n].x);\n vmax.y = std::max(vmax.y, mesh->mVertices[n].y);\n vmax.z = std::max(vmax.z, mesh->mVertices[n].z);\n }\n vbuf->unlock();\n data->vertexBufferBinding->setBinding(0, vbuf);\n \n if (mesh->HasTextureCoords(0))\n {\n vbuf = Ogre::HardwareBufferManager::getSingleton().createVertexBuffer(\n decl->getVertexSize(1), \/\/ This value is the size of a vertex in memory\n data->vertexCount, \/\/ The number of vertices you'll put into this buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n vbData = static_cast<Ogre::Real*>(vbuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n \n offset = 0;\n for (unsigned int n=0 ; n<data->vertexCount ; ++n)\n {\n for (int tn=0 ; tn<AI_MAX_NUMBER_OF_TEXTURECOORDS ; ++tn)\n {\n if (mesh->mTextureCoords[tn])\n {\n if (mesh->mNumUVComponents[tn] == 3)\n {\n vbData[offset++] = mesh->mTextureCoords[tn][n].x;\n vbData[offset++] = mesh->mTextureCoords[tn][n].y;\n vbData[offset++] = mesh->mTextureCoords[tn][n].z;\n } else\n {\n vbData[offset++] = mesh->mTextureCoords[tn][n].x;\n vbData[offset++] = mesh->mTextureCoords[tn][n].y;\n }\n }\n }\n\n if (mesh->HasTangentsAndBitangents())\n {\n vbData[offset++] = mesh->mTangents[n].x;\n vbData[offset++] = mesh->mTangents[n].y;\n vbData[offset++] = mesh->mTangents[n].z;\n\n vbData[offset++] = mesh->mBitangents[n].x;\n vbData[offset++] = mesh->mBitangents[n].y;\n vbData[offset++] = mesh->mBitangents[n].z;\n }\n }\n vbuf->unlock();\n data->vertexBufferBinding->setBinding(1, vbuf);\n }\n\n \/\/ indices\n size_t numIndices = mesh->mNumFaces * 3; \/\/ support only triangles, so 3 indices per face\n \n Ogre::HardwareIndexBuffer::IndexType idxType = Ogre::HardwareIndexBuffer::IT_16BIT;\n if (numIndices > 65535)\n idxType = Ogre::HardwareIndexBuffer::IT_32BIT;\n\n Ogre::HardwareIndexBufferSharedPtr ibuf = Ogre::HardwareBufferManager::getSingleton().createIndexBuffer(\n idxType, \/\/ You can use several different value types here\n numIndices, \/\/ The number of indices you'll put in that buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n \n if (idxType == Ogre::HardwareIndexBuffer::IT_16BIT)\n {\n u16 *idxData = static_cast<u16*>(ibuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n offset = 0;\n for (int n=0 ; n<mesh->mNumFaces ; ++n)\n {\n idxData[offset++] = mesh->mFaces[n].mIndices[0];\n idxData[offset++] = mesh->mFaces[n].mIndices[1];\n idxData[offset++] = mesh->mFaces[n].mIndices[2];\n }\n } else\n {\n u32 *idxData = static_cast<u32*>(ibuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n offset = 0;\n for (int n=0 ; n<mesh->mNumFaces ; ++n)\n {\n idxData[offset++] = mesh->mFaces[n].mIndices[0];\n idxData[offset++] = mesh->mFaces[n].mIndices[1];\n idxData[offset++] = mesh->mFaces[n].mIndices[2];\n }\n }\n ibuf->unlock();\n\n ogreSubmesh->indexData->indexBuffer = ibuf; \/\/ The pointer to the index buffer\n ogreSubmesh->indexData->indexCount = numIndices; \/\/ The number of indices we'll use\n ogreSubmesh->indexData->indexStart = 0;\n }\n\n if (vmin.x <= vmax.x && vmin.y <= vmax.y && vmin.z <= vmax.z)\n {\n ogreMesh->_setBounds(Ogre::AxisAlignedBox(vmin, vmax));\n Ogre::Real maxvertex = std::max(abs(vmax.x), std::max(abs(vmin.x), std::max(abs(vmax.y), std::max(abs(vmin.y), std::max(vmax.z, vmin.z)))));\n ogreMesh->_setBoundingSphereRadius(maxvertex \/ 2.f);\n ogreMesh->load();\n outMeshNames.push_back(meshname);\n }\n }\n } catch (Ogre::Exception &)\n {\n \/\/ error\n }\n\n \/\/ import children\n for (int i=0 ; i<node->mNumChildren ; ++i)\n ImportNode(scene, node->mChildren[i], file, nodeName, outMeshNames);\n }\n \n void OpenAssetImport::AssImpLogStream::write(const char* message)\n {\n \/\/! \\todo doesn't work, check assimp docs for reason -cmayhem\n Foundation::RootLogInfo(message);\n }\n}\n<commit_msg>Fixed log capturing for Open Asset Import lib.<commit_after>\/\/ For conditions of distribution and use, see copyright notice in license.txt\n\n#include \"StableHeaders.h\"\n#include \"OpenAssetImport.h\"\n\n#include <assimp.hpp> \/\/ C++ importer interface\n#include <aiScene.h> \/\/ Output data structure\n#include <aiPostProcess.h> \/\/ Post processing flags\n#include <Logger.h>\n#include <DefaultLogger.h>\n#include <Ogre.h>\n\nusing namespace Assimp;\n\nnamespace AssImp\n{\n OpenAssetImport::OpenAssetImport() : \n importer_(new Importer()), \n logstream_(new AssImpLogStream()), \n loglevels_(Logger::DEBUGGING | Logger::INFO | Logger::ERR | Logger::WARN),\n default_flags_( aiProcess_JoinIdenticalVertices\t\t|\n aiProcess_Triangulate\t\t\t\t|\n aiProcess_RemoveComponent\t\t\t|\n aiProcess_GenNormals\t\t\t\t|\t\/\/ ignored if model already has normals\n aiProcess_LimitBoneWeights\t\t\t|\n aiProcess_SortByPType\t\t\t\t|\t\/\/ remove point and line primitive types\n aiProcess_ValidateDataStructure \/\/ makes sure that all indices are valid, all animations and bones are linked correctly, all material references are correct...\n )\n {\n \/\/ set up importer\n importer_->SetPropertyInteger(AI_CONFIG_PP_LBW_MAX_WEIGHTS, 4);\t\/\/ limit bone weights to 4 vertices\n\t\t\n importer_->SetPropertyInteger(\t\t\t\/\/ ignore vertex colours, textures, lights and cameras (for now)\n AI_CONFIG_PP_RVC_FLAGS, \n aiComponent_COLORS\t\t|\n aiComponent_TEXTURES\t|\n aiComponent_LIGHTS\t\t|\n aiComponent_CAMERAS\n );\n\n importer_->SetPropertyInteger(\t\t\t\/\/ ignore point and line primitives (for now)\n AI_CONFIG_PP_SBP_REMOVE, \n aiPrimitiveType_POINT\t\t|\n aiPrimitiveType_LINE\n );\n#ifdef _DEBUG\n DefaultLogger::create(\"\", Logger::VERBOSE); \/\/ enable debug messages\n#else\n DefaultLogger::create();\n#endif\n Assimp::DefaultLogger::get()->attachStream(logstream_, loglevels_);\n }\n\n OpenAssetImport::~OpenAssetImport()\n {\n Assimp::DefaultLogger::get()->detatchStream(logstream_, loglevels_);\n delete logstream_;\n DefaultLogger::kill();\n }\n\n bool OpenAssetImport::IsSupportedExtension(const QString& filename)\n {\n boost::filesystem::path path(filename.toStdString());\n QString extension = QString(path.extension().c_str()).toLower();\n\n return importer_->IsExtensionSupported(extension.toStdString());\n }\n\n void OpenAssetImport::GetMeshData(const QString& file, std::vector<MeshData> &outMeshData)\n {\n const aiScene *scene = importer_->ReadFile(file.toStdString(), default_flags_);\n\n if (scene)\n {\n const struct aiNode *rootNode = scene->mRootNode;\n \n aiMatrix4x4 transform;\n GetNodeData(scene, rootNode, file, transform, outMeshData);\n } else\n { \n \/\/ report error\n Foundation::RootLogError(importer_->GetErrorString());\n }\n }\n\n void OpenAssetImport::Import(const void *data, size_t length, const QString &name, const char* hint, const QString &nodeName, std::vector<std::string> &outMeshNames)\n {\n const aiScene *scene = importer_->ReadFileFromMemory(data, length, default_flags_, hint);\n\n if (scene)\n {\n const struct aiNode *rootNode = scene->mRootNode;\n \n ImportNode(scene, rootNode, name, nodeName, outMeshNames);\n } else\n { \n \/\/ report error\n Foundation::RootLogError(importer_->GetErrorString());\n \/\/return QString(importer_->GetErrorString());\n }\n }\n\n void OpenAssetImport::GetNodeData(const aiScene *scene, const aiNode *node, const QString& file,\n const aiMatrix4x4 &parentTransform, std::vector<MeshData> &outMeshNames)\n {\n aiMatrix4x4 aiTransform = node->mTransformation;\n\n aiMatrix4x4 worldTransform = parentTransform * aiTransform;\n \n aiVector3D pos;\n aiVector3D scale;\n Vector3df rote;\n aiQuaternion rotq;\n worldTransform.Decompose(scale, rotq, pos);\n Quaternion quat(rotq.x, rotq.y, rotq.z, rotq.w);\n \n quat.toEuler(rote);\n rote *= RADTODEG;\n\n\n if (node->mNumMeshes > 0)\n {\n MeshData data = { file, QString(node->mName.data), Transform(Vector3df(pos.x, pos.y, pos.z), rote, Vector3df(scale.x, scale.y, scale.z)) };\n outMeshNames.push_back(data); \n }\n\n \/\/ import children\n for (int i=0 ; i<node->mNumChildren ; ++i)\n GetNodeData(scene, node->mChildren[i], file, worldTransform, outMeshNames);\n }\n\n void OpenAssetImport::ImportNode(const aiScene *scene, const aiNode *node, const QString& file,\n const QString &nodeName, std::vector<std::string> &outMeshNames)\n {\n try\n {\n \/\/ boost::filesystem::path path(file.toStdString());\n \/\/ std::string meshname = path.filename() + boost::lexical_cast<std::string>(nodeIdx);\n std::string ogreMeshName = file.toStdString(); \/\/std::string(\"mesh___\") + meshname;\n std::string meshname = ogreMeshName;\n\n \/*if (scene->mNumMaterials > 0)\n {\n \/\/ testing getting Ogre material.xml names\n aiString name;\n scene->mMaterials[0]->Get(AI_MATKEY_NAME,name);\n Foundation::RootLogInfo(std::string(\"Found material \") + std::string(name.data));\n }*\/\n\n\n \/\/aiMatrix4x4 transform = node->mTransformation;\n if (node->mNumMeshes > 0 && nodeName.compare(QString(node->mName.data)) == 0 && !Ogre::MeshManager::getSingleton().resourceExists(ogreMeshName))\n {\n Ogre::MeshPtr ogreMesh = Ogre::MeshManager::getSingleton().createManual(ogreMeshName, Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n ogreMesh->setAutoBuildEdgeLists(false);\n\n Ogre::Vector3 vmin(std::numeric_limits<float>::max(), std::numeric_limits<float>::max(), std::numeric_limits<float>::max());\n Ogre::Vector3 vmax(std::numeric_limits<float>::min(), std::numeric_limits<float>::min(), std::numeric_limits<float>::min());\n\n for (unsigned int i=0 ; i<node->mNumMeshes ; ++i)\n {\n const aiMesh *mesh = scene->mMeshes[node->mMeshes[i]];\n \n Ogre::SubMesh *ogreSubmesh = ogreMesh->createSubMesh();\n \n ogreSubmesh->useSharedVertices = false;\n ogreSubmesh->vertexData = new Ogre::VertexData();\n ogreSubmesh->vertexData->vertexCount = mesh->mNumVertices;\n Ogre::VertexData *data = ogreSubmesh->vertexData;\n \n \/\/ Vertex declarations\n size_t offset = 0;\n Ogre::VertexDeclaration* decl = data->vertexDeclaration;\n decl->addElement(0, offset, Ogre::VET_FLOAT3, Ogre::VES_POSITION);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n decl->addElement(0, offset, Ogre::VET_FLOAT3, Ogre::VES_NORMAL);\n\n offset = 0;\n for (int tn=0 ; tn<AI_MAX_NUMBER_OF_TEXTURECOORDS ; ++tn)\n {\n if (mesh->mTextureCoords[tn])\n {\n if (mesh->mNumUVComponents[tn] == 3)\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_TEXTURE_COORDINATES, tn);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n } else\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT2, Ogre::VES_TEXTURE_COORDINATES, tn);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT2);\n }\n }\n }\n if (mesh->HasTangentsAndBitangents())\n {\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_TANGENT);\n offset += Ogre::VertexElement::getTypeSize(Ogre::VET_FLOAT3);\n decl->addElement(1, offset, Ogre::VET_FLOAT3, Ogre::VES_BINORMAL);\n }\n\n \/\/ Write vertex data to buffer\n Ogre::HardwareVertexBufferSharedPtr vbuf = Ogre::HardwareBufferManager::getSingleton().createVertexBuffer(\n decl->getVertexSize(0), \/\/ This value is the size of a vertex in memory\n data->vertexCount, \/\/ The number of vertices you'll put into this buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n Ogre::Real *vbData = static_cast<Ogre::Real*>(vbuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n \n offset = 0;\n for (unsigned int n=0 ; n<data->vertexCount ; ++n)\n {\n vbData[offset++] = mesh->mVertices[n].x;\n vbData[offset++] = mesh->mVertices[n].y;\n vbData[offset++] = mesh->mVertices[n].z;\n\n vbData[offset++] = mesh->mNormals[n].x;\n vbData[offset++] = mesh->mNormals[n].y;\n vbData[offset++] = mesh->mNormals[n].z;\n\n vmin.x = std::min(vmin.x, mesh->mVertices[n].x);\n vmin.y = std::min(vmin.y, mesh->mVertices[n].y);\n vmin.z = std::min(vmin.z, mesh->mVertices[n].z);\n\n vmax.x = std::max(vmax.x, mesh->mVertices[n].x);\n vmax.y = std::max(vmax.y, mesh->mVertices[n].y);\n vmax.z = std::max(vmax.z, mesh->mVertices[n].z);\n }\n vbuf->unlock();\n data->vertexBufferBinding->setBinding(0, vbuf);\n \n if (mesh->HasTextureCoords(0))\n {\n vbuf = Ogre::HardwareBufferManager::getSingleton().createVertexBuffer(\n decl->getVertexSize(1), \/\/ This value is the size of a vertex in memory\n data->vertexCount, \/\/ The number of vertices you'll put into this buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n vbData = static_cast<Ogre::Real*>(vbuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n \n offset = 0;\n for (unsigned int n=0 ; n<data->vertexCount ; ++n)\n {\n for (int tn=0 ; tn<AI_MAX_NUMBER_OF_TEXTURECOORDS ; ++tn)\n {\n if (mesh->mTextureCoords[tn])\n {\n if (mesh->mNumUVComponents[tn] == 3)\n {\n vbData[offset++] = mesh->mTextureCoords[tn][n].x;\n vbData[offset++] = mesh->mTextureCoords[tn][n].y;\n vbData[offset++] = mesh->mTextureCoords[tn][n].z;\n } else\n {\n vbData[offset++] = mesh->mTextureCoords[tn][n].x;\n vbData[offset++] = mesh->mTextureCoords[tn][n].y;\n }\n }\n }\n\n if (mesh->HasTangentsAndBitangents())\n {\n vbData[offset++] = mesh->mTangents[n].x;\n vbData[offset++] = mesh->mTangents[n].y;\n vbData[offset++] = mesh->mTangents[n].z;\n\n vbData[offset++] = mesh->mBitangents[n].x;\n vbData[offset++] = mesh->mBitangents[n].y;\n vbData[offset++] = mesh->mBitangents[n].z;\n }\n }\n vbuf->unlock();\n data->vertexBufferBinding->setBinding(1, vbuf);\n }\n\n \/\/ indices\n size_t numIndices = mesh->mNumFaces * 3; \/\/ support only triangles, so 3 indices per face\n \n Ogre::HardwareIndexBuffer::IndexType idxType = Ogre::HardwareIndexBuffer::IT_16BIT;\n if (numIndices > 65535)\n idxType = Ogre::HardwareIndexBuffer::IT_32BIT;\n\n Ogre::HardwareIndexBufferSharedPtr ibuf = Ogre::HardwareBufferManager::getSingleton().createIndexBuffer(\n idxType, \/\/ You can use several different value types here\n numIndices, \/\/ The number of indices you'll put in that buffer\n Ogre::HardwareBuffer::HBU_DYNAMIC \/\/ Properties\n );\n \n if (idxType == Ogre::HardwareIndexBuffer::IT_16BIT)\n {\n u16 *idxData = static_cast<u16*>(ibuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n offset = 0;\n for (int n=0 ; n<mesh->mNumFaces ; ++n)\n {\n idxData[offset++] = mesh->mFaces[n].mIndices[0];\n idxData[offset++] = mesh->mFaces[n].mIndices[1];\n idxData[offset++] = mesh->mFaces[n].mIndices[2];\n }\n } else\n {\n u32 *idxData = static_cast<u32*>(ibuf->lock(Ogre::HardwareBuffer::HBL_NORMAL));\n offset = 0;\n for (int n=0 ; n<mesh->mNumFaces ; ++n)\n {\n idxData[offset++] = mesh->mFaces[n].mIndices[0];\n idxData[offset++] = mesh->mFaces[n].mIndices[1];\n idxData[offset++] = mesh->mFaces[n].mIndices[2];\n }\n }\n ibuf->unlock();\n\n ogreSubmesh->indexData->indexBuffer = ibuf; \/\/ The pointer to the index buffer\n ogreSubmesh->indexData->indexCount = numIndices; \/\/ The number of indices we'll use\n ogreSubmesh->indexData->indexStart = 0;\n }\n\n if (vmin.x <= vmax.x && vmin.y <= vmax.y && vmin.z <= vmax.z)\n {\n ogreMesh->_setBounds(Ogre::AxisAlignedBox(vmin, vmax));\n Ogre::Real maxvertex = std::max(abs(vmax.x), std::max(abs(vmin.x), std::max(abs(vmax.y), std::max(abs(vmin.y), std::max(vmax.z, vmin.z)))));\n ogreMesh->_setBoundingSphereRadius(maxvertex \/ 2.f);\n ogreMesh->load();\n outMeshNames.push_back(meshname);\n }\n }\n } catch (Ogre::Exception &)\n {\n \/\/ error\n }\n\n \/\/ import children\n for (int i=0 ; i<node->mNumChildren ; ++i)\n ImportNode(scene, node->mChildren[i], file, nodeName, outMeshNames);\n }\n \n void OpenAssetImport::AssImpLogStream::write(const char* message)\n {\n \/\/! \\todo doesn't work, check assimp docs for reason -cmayhem\n Foundation::RootLogInfo(message);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#if HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <xorg\/gtest\/xorg-gtest.h>\n\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/extensions\/Xfixes.h>\n#include <X11\/extensions\/XInput2.h>\n\n#include \"barriers-common.h\"\n#include \"xit-event.h\"\n#include \"helpers.h\"\n\nusing namespace xorg::testing::evemu;\n\nclass BarrierNotify : public BarrierTest {};\n\n#define ASSERT_PTR_POS(x, y) \\\n QueryPointerPosition(dpy, &root_x, &root_y); \\\n ASSERT_EQ(x, root_x); \\\n ASSERT_EQ(y, root_y);\n\nTEST_F(BarrierNotify, ReceivesNotifyEvents)\n{\n XORG_TESTCASE(\"Ensure that we receive BarrierNotify events\\n\"\n \"when barriers are hit.\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHitNotify);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n \/* Ensure we have a BarrierHitNotify on our hands. *\/\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHitNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(20, event.ev->x);\n ASSERT_EQ(-40, event.ev->dx);\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n\nTEST_F(BarrierNotify, CorrectEventIDs)\n{\n XORG_TESTCASE(\"Ensure that barrier event IDs have correct and \"\n \"sequential values, and that multiple chained hits \"\n \"have the same event ID\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHitNotify);\n XISetMask(mask.mask, XI_BarrierLeaveNotify);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n \/* Ensure we have a bunch of BarrierHitNotifys on our hands. *\/\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n \/* Ensure we have a BarrierHitNotify on our hands. *\/\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHitNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(20, event.ev->x);\n ASSERT_EQ(30, event.ev->y);\n ASSERT_EQ(-40, event.ev->dx);\n ASSERT_EQ(0, event.ev->dy);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n \/* Move outside the hitbox, and ensure that we\n * get a BarrierNewEventNotify *\/\n dev->PlayOne(EV_REL, REL_X, 20, True);\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierLeaveNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHitNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n \/* Ensure that we're still inside the hit box. Event ID\n * should stay the same on such a minor change. *\/\n dev->PlayOne(EV_REL, REL_X, 1, True);\n\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHitNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n\nTEST_F(BarrierNotify, BarrierReleases)\n{\n XORG_TESTCASE(\"Ensure that releasing barriers works without \"\n \"erroring out and allows pointer movement over \"\n \"the barrier, and that we properly get a \"\n \"XI_BarrierPointerReleasedNotify.\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHitNotify);\n XISetMask(mask.mask, XI_BarrierPointerReleasedNotify);\n XISetMask(mask.mask, XI_BarrierLeaveNotify);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n {\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHitNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n XIBarrierReleasePointer(dpy, barrier, 1, VIRTUAL_CORE_POINTER_ID);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n {\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierPointerReleasedNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n \/* Immediately afterwards, we should have a new event notify\n * because we exited the hit box *\/\n {\n XITEvent<XIBarrierNotifyEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierLeaveNotify);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n<commit_msg>Fix up for new protocol.<commit_after>#if HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include <xorg\/gtest\/xorg-gtest.h>\n\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/extensions\/Xfixes.h>\n#include <X11\/extensions\/XInput2.h>\n\n#include \"barriers-common.h\"\n#include \"xit-event.h\"\n#include \"helpers.h\"\n\nusing namespace xorg::testing::evemu;\n\nclass BarrierNotify : public BarrierTest {};\n\n#define ASSERT_PTR_POS(x, y) \\\n QueryPointerPosition(dpy, &root_x, &root_y); \\\n ASSERT_EQ(x, root_x); \\\n ASSERT_EQ(y, root_y);\n\nTEST_F(BarrierNotify, ReceivesNotifyEvents)\n{\n XORG_TESTCASE(\"Ensure that we receive BarrierNotify events\\n\"\n \"when barriers are hit.\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHit);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n \/* Ensure we have a BarrierHit on our hands. *\/\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHit);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(20, event.ev->root_x);\n ASSERT_EQ(-40, event.ev->dx);\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n\nTEST_F(BarrierNotify, CorrectEventIDs)\n{\n XORG_TESTCASE(\"Ensure that barrier event IDs have correct and \"\n \"sequential values, and that multiple chained hits \"\n \"have the same event ID\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHit);\n XISetMask(mask.mask, XI_BarrierLeave);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n \/* Ensure we have a bunch of BarrierHits on our hands. *\/\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n \/* Ensure we have a BarrierHit on our hands. *\/\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHit);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(20, event.ev->root_x);\n ASSERT_EQ(30, event.ev->root_y);\n ASSERT_EQ(-40, event.ev->dx);\n ASSERT_EQ(0, event.ev->dy);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n \/* Move outside the hitbox, and ensure that we\n * get a BarrierNewEvent *\/\n dev->PlayOne(EV_REL, REL_X, 20, True);\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierLeave);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHit);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n \/* Ensure that we're still inside the hit box. Event ID\n * should stay the same on such a minor change. *\/\n dev->PlayOne(EV_REL, REL_X, 1, True);\n\n for (int i = 0; i < 10; i++) {\n dev->PlayOne(EV_REL, REL_X, -40, True);\n\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHit);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n\nTEST_F(BarrierNotify, BarrierReleases)\n{\n XORG_TESTCASE(\"Ensure that releasing barriers works without \"\n \"erroring out and allows pointer movement over \"\n \"the barrier, and that we properly get a \"\n \"XI_BarrierPointerReleased.\\n\");\n\n ::Display *dpy = Display();\n Window root = DefaultRootWindow(dpy);\n PointerBarrier barrier;\n\n XIEventMask mask;\n mask.deviceid = XIAllMasterDevices;\n mask.mask_len = XIMaskLen(XI_LASTEVENT);\n mask.mask = reinterpret_cast<unsigned char*>(calloc(mask.mask_len, 1));\n XISetMask(mask.mask, XI_BarrierHit);\n XISetMask(mask.mask, XI_BarrierPointerReleased);\n XISetMask(mask.mask, XI_BarrierLeave);\n XISelectEvents(dpy, root, &mask, 1);\n free(mask.mask);\n XSync(dpy, False);\n\n XIWarpPointer(dpy, VIRTUAL_CORE_POINTER_ID, None, root, 0, 0, 0, 0, 30, 30);\n\n barrier = XFixesCreatePointerBarrier(dpy, root, 20, 20, 20, 40, 0, 0, NULL);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n {\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierHit);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n XIBarrierReleasePointer(dpy, barrier, 1, VIRTUAL_CORE_POINTER_ID);\n XSync(dpy, False);\n\n dev->PlayOne(EV_REL, REL_X, -40, True);\n {\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierPointerReleased);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(1, event.ev->event_id);\n }\n\n \/* Immediately afterwards, we should have a new event\n * because we exited the hit box *\/\n {\n XITEvent<XIBarrierEvent> event(dpy, GenericEvent, xi2_opcode, XI_BarrierLeave);\n ASSERT_EQ(barrier, event.ev->barrier);\n ASSERT_EQ(2, event.ev->event_id);\n }\n\n XFixesDestroyPointerBarrier(dpy, barrier);\n}\n<|endoftext|>"} {"text":"<commit_before>#if !defined(__CINT__) || defined(__MAKECINT__)\n\/\/ ROOT includes\n#include \"TSystem.h\"\n#include \"TROOT.h\"\n#include \"TString.h\"\n\n#endif\n\n\/\/_____________________________\nvoid LoadRootAnalysis()\n{\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libProof\");\n}\n\n\/\/_____________________________\nvoid LoadAnalysis(const char* option = \"\")\n{\n gSystem->Load(\"libANALYSIS.so\");\n gSystem->Load(\"libOADB.so\");\n gSystem->Load(\"libANALYSISalice.so\");\n gSystem->Load(\"libCORRFW.so\");\n TString opt(option);\n opt.ToUpper();\n if ( opt.Contains(\"PWG\") ) {\n gSystem->Load(\"libPWGmuon.so\");\n }\n if ( opt.Contains(\"PWGPP\") ) {\n gSystem->Load(\"libPWGPPMUONlite.so\");\n }\n}\n\n\/\/_____________________________\nvoid IncludeAliroot()\n{\n gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/include\");\n gSystem->AddIncludePath(\"-I${ALICE_INSTALL}\/include\");\n gSystem->AddIncludePath(\"-I${ALICE_BUILD}\/include\");\n}\n\n\/\/_____________________________\nvoid IncludeMuon()\n{\n gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/MUON\");\n}\n\n\/\/_____________________________\nvoid LoadLibsForMuonQA ( const char* option )\n{\n TString opt(option);\n opt.ToLower();\n if ( opt.Contains(\"maketrend\") ) {\n IncludeAliroot();\n gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/PWGPP\/MUON\/lite\");\n LoadRootAnalysis();\n LoadAnalysis(\"PWGPP\");\n }\n if ( opt.Contains(\"trigtrend\") ) {\n IncludeAliroot();\n IncludeMuon();\n LoadAnalysis(\"PWG\");\n gSystem->Load(\"libPWGmuondep.so\");\n }\n if (opt.Contains(\"tracktrend\") ) {\n IncludeAliroot();\n LoadAnalysis(\"PWG\");\n }\n}\n<commit_msg>Check aliroot environmental variables before including path<commit_after>#if !defined(__CINT__) || defined(__MAKECINT__)\n\/\/ ROOT includes\n#include \"TSystem.h\"\n#include \"TROOT.h\"\n#include \"TString.h\"\n\n#endif\n\n\/\/_____________________________\nvoid LoadRootAnalysis()\n{\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libGeom\");\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libProof\");\n}\n\n\/\/_____________________________\nvoid LoadAnalysis(const char* option = \"\")\n{\n gSystem->Load(\"libANALYSIS.so\");\n gSystem->Load(\"libOADB.so\");\n gSystem->Load(\"libANALYSISalice.so\");\n gSystem->Load(\"libCORRFW.so\");\n TString opt(option);\n opt.ToUpper();\n if ( opt.Contains(\"PWG\") ) {\n gSystem->Load(\"libPWGmuon.so\");\n }\n if ( opt.Contains(\"PWGPP\") ) {\n gSystem->Load(\"libPWGPPMUONlite.so\");\n }\n}\n\n\/\/_____________________________\nvoid IncludeAliroot()\n{\n TString envList[3] = {\"ALICE_ROOT\",\"ALICE_INSTALL\",\"ALICE_BUILD\"};\n for ( Int_t ienv=0; ienv<3; ienv++ ) {\n if ( ! gSystem->Getenv(envList[ienv].Data()) ) continue;\n if ( gSystem->AccessPathName(gSystem->ExpandPathName(Form(\"${%s}\/include\",envList[ienv].Data()))) ) continue;\n gSystem->AddIncludePath(Form(\"-I${%s}\/include\",envList[ienv].Data()));\n }\n}\n\n\/\/_____________________________\nvoid IncludeMuon()\n{\n gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/MUON\");\n}\n\n\/\/_____________________________\nvoid LoadLibsForMuonQA ( const char* option )\n{\n TString opt(option);\n opt.ToLower();\n if ( opt.Contains(\"maketrend\") ) {\n IncludeAliroot();\n gSystem->AddIncludePath(\"-I${ALICE_ROOT}\/PWGPP\/MUON\/lite\");\n LoadRootAnalysis();\n LoadAnalysis(\"PWGPP\");\n }\n if ( opt.Contains(\"trigtrend\") ) {\n IncludeAliroot();\n IncludeMuon();\n LoadAnalysis(\"PWG\");\n gSystem->Load(\"libPWGmuondep.so\");\n }\n if (opt.Contains(\"tracktrend\") ) {\n IncludeAliroot();\n LoadAnalysis(\"PWG\");\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#if ! defined (__CINT__) || defined (__MAKECINT__)\n#include \"TError.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliLog.h\"\n#include \"PWGPP\/TRD\/AliTRDpwgppHelper.h\"\n#include \"PWGPP\/TRD\/AliTRDefficiency.h\"\n#include \"PWGPP\/TRD\/AliTRDefficiencyMC.h\"\n#include \"PWGPP\/TRD\/AliTRDmultiplicity.h\"\n#endif\n\nvoid AddTRDefficiency(AliAnalysisManager *mgr, Int_t map, AliAnalysisDataContainer **ci\/*, AliAnalysisDataContainer **co*\/)\n{\n Info(\"AddTRDefficiency\", Form(\"[0]=\\\"%s\\\" [1]=\\\"%s\\\" [2]=\\\"%s\\\" [3]=\\\"%s\\\" [4]=\\\"%s\\\"\", ci[0]->GetName(), ci[1]->GetName(), ci[2]->GetName(), ci[3]->GetName(), ci[4]->GetName()));\n\n AliAnalysisDataContainer *evInfoContainer = ci[3];\n AliTRDrecoTask *eff(NULL);\n mgr->AddTask(eff = new AliTRDefficiency((char*)\"TRDefficiency\"));\n res->SetMCdata((Bool_t)mgr->GetMCtruthEventHandler());\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDefficiency\", 5); \n Int_t trackStatus = 0; \/\/ barrel tracks\n\/\/ = 1; \/\/ kink tracks\n\/\/ = 2; \/\/ SA tracks\n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \/\/ connect main (ESD) container\n mgr->ConnectInput(eff, 1, ci[trackStatus]); \/\/ conect track info container\n mgr->ConnectInput(eff, 2, evInfoContainer); \/\/ conect event info container\n mgr->ConnectInput(eff, 3, ci[4]); \/\/ conect clusters container\n mgr->ConnectOutput(eff,1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Performance\", mgr->GetCommonFileName())));\n \n\n \/\/ TRD combined tracking efficiency\n if(mgr->GetMCtruthEventHandler() && TESTBIT(map, AliTRDpwgppHelper::kEfficiencyMC)) {\n mgr->AddTask(eff = new AliTRDefficiencyMC((char*)\"TRDefficiencyMC\"));\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDefficiencyMC\", 5); \n\n \/\/ Create containers for input\/output\n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \n mgr->ConnectInput(eff, 1, ci[trackStatus]);\n mgr->ConnectInput(eff, 2, evInfoContainer);\n mgr->ConnectOutput(eff, 1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Performance\", mgr->GetCommonFileName())));\n }\n\n \/\/ TRD single track selection\n if(!(TESTBIT(map, AliTRDpwgppHelper::kMultiplicity))) return;\n\n mgr->AddTask(eff = new AliTRDmultiplicity((char*)\"TRDmultiplicity\"));\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDmultiplicity\", 5); \n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \n mgr->ConnectInput(eff, 1, ci[0]);\n mgr->ConnectOutput(eff, 1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Calibration\", mgr->GetCommonFileName())));\n}\n\n<commit_msg>fix compilation<commit_after>#if ! defined (__CINT__) || defined (__MAKECINT__)\n#include \"TError.h\"\n#include \"AliAnalysisManager.h\"\n#include \"AliAnalysisDataContainer.h\"\n#include \"AliLog.h\"\n#include \"PWGPP\/TRD\/AliTRDpwgppHelper.h\"\n#include \"PWGPP\/TRD\/AliTRDefficiency.h\"\n#include \"PWGPP\/TRD\/AliTRDefficiencyMC.h\"\n#include \"PWGPP\/TRD\/AliTRDmultiplicity.h\"\n#endif\n\nvoid AddTRDefficiency(AliAnalysisManager *mgr, Int_t map, AliAnalysisDataContainer **ci\/*, AliAnalysisDataContainer **co*\/)\n{\n Info(\"AddTRDefficiency\", Form(\"[0]=\\\"%s\\\" [1]=\\\"%s\\\" [2]=\\\"%s\\\" [3]=\\\"%s\\\" [4]=\\\"%s\\\"\", ci[0]->GetName(), ci[1]->GetName(), ci[2]->GetName(), ci[3]->GetName(), ci[4]->GetName()));\n\n AliAnalysisDataContainer *evInfoContainer = ci[3];\n AliTRDrecoTask *eff(NULL);\n mgr->AddTask(eff = new AliTRDefficiency((char*)\"TRDefficiency\"));\n eff->SetMCdata((Bool_t)mgr->GetMCtruthEventHandler());\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDefficiency\", 5); \n Int_t trackStatus = 0; \/\/ barrel tracks\n\/\/ = 1; \/\/ kink tracks\n\/\/ = 2; \/\/ SA tracks\n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \/\/ connect main (ESD) container\n mgr->ConnectInput(eff, 1, ci[trackStatus]); \/\/ conect track info container\n mgr->ConnectInput(eff, 2, evInfoContainer); \/\/ conect event info container\n mgr->ConnectInput(eff, 3, ci[4]); \/\/ conect clusters container\n mgr->ConnectOutput(eff,1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Performance\", mgr->GetCommonFileName())));\n \n\n \/\/ TRD combined tracking efficiency\n if(mgr->GetMCtruthEventHandler() && TESTBIT(map, AliTRDpwgppHelper::kEfficiencyMC)) {\n mgr->AddTask(eff = new AliTRDefficiencyMC((char*)\"TRDefficiencyMC\"));\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDefficiencyMC\", 5); \n\n \/\/ Create containers for input\/output\n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \n mgr->ConnectInput(eff, 1, ci[trackStatus]);\n mgr->ConnectInput(eff, 2, evInfoContainer);\n mgr->ConnectOutput(eff, 1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Performance\", mgr->GetCommonFileName())));\n }\n\n \/\/ TRD single track selection\n if(!(TESTBIT(map, AliTRDpwgppHelper::kMultiplicity))) return;\n\n mgr->AddTask(eff = new AliTRDmultiplicity((char*)\"TRDmultiplicity\"));\n eff->SetDebugLevel(0);\n \/\/AliLog::SetClassDebugLevel(\"AliTRDmultiplicity\", 5); \n mgr->ConnectInput(eff, 0, mgr->GetCommonInputContainer()); \n mgr->ConnectInput(eff, 1, ci[0]);\n mgr->ConnectOutput(eff, 1, mgr->CreateContainer(eff->GetName(), TObjArray::Class(), AliAnalysisManager::kOutputContainer, Form(\"%s:TRD_Calibration\", mgr->GetCommonFileName())));\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Resizer, LEF\/DEF gate resizer\n\/\/ Copyright (c) 2019, Parallax Software, Inc.\n\/\/ \n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\n#include \"Machine.hh\"\n#include \"PatternMatch.hh\"\n#include \"ParseBus.hh\"\n#include \"dbSdcNetwork.hh\"\n\nnamespace sta {\n\nstatic const char *\nescapeDividers(const char *token,\n\t const Network *network);\n\ndbSdcNetwork::dbSdcNetwork(Network *network) :\n SdcNetwork(network)\n{\n}\n\n\/\/ Override SdcNetwork to NetworkNameAdapter.\nInstance *\ndbSdcNetwork::findInstance(const char *path_name) const\n{\n Instance *inst = network_->findInstance(path_name);\n if (inst == nullptr)\n inst = network_->findInstance(escapeDividers(path_name, this));\n return inst;\n}\n\nvoid\ndbSdcNetwork::findInstancesMatching(const Instance *,\n\t\t\t\t const PatternMatch *pattern,\n\t\t\t\t InstanceSeq *insts) const\n{\n if (pattern->hasWildcards())\n findInstancesMatching1(pattern, insts);\n else {\n Instance *inst = findInstance(pattern->pattern());\n if (inst)\n insts->push_back(inst);\n else {\n \/\/ Look for a match with path dividers escaped.\n const char *escaped = escapeChars(pattern->pattern(), divider_, '\\0',\n\t\t\t\t\tescape_);\n inst = findInstance(escaped);\n if (inst)\n\tinsts->push_back(inst);\n else\n\t\/\/ Malo\n\tfindInstancesMatching1(pattern, insts);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findInstancesMatching1(const PatternMatch *pattern,\n\t\t\t\t InstanceSeq *insts) const\n{\n InstanceChildIterator *child_iter = childIterator(topInstance());\n while (child_iter->hasNext()) {\n Instance *child = child_iter->next();\n if (pattern->match(staToSdc(name(child))))\n insts->push_back(child);\n }\n delete child_iter;\n}\n\nvoid\ndbSdcNetwork::findNetsMatching(const Instance *,\n\t\t\t const PatternMatch *pattern,\n\t\t\t NetSeq *nets) const\n{\n if (pattern->hasWildcards())\n findNetsMatching1(pattern, nets);\n else {\n Net *net = findNet(pattern->pattern());\n if (net)\n nets->push_back(net);\n else {\n \/\/ Look for a match with path dividers escaped.\n const char *escaped = escapeChars(pattern->pattern(), divider_, '\\0',\n\t\t\t\t\tescape_);\n net = findNet(escaped);\n if (net)\n\tnets->push_back(net);\n else\n\tfindNetsMatching1(pattern, nets);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findNetsMatching1(const PatternMatch *pattern,\n\t\t\t\tNetSeq *nets) const\n{\n NetIterator *net_iter = netIterator(topInstance());\n while (net_iter->hasNext()) {\n Net *net = net_iter->next();\n if (pattern->match(staToSdc(name(net))))\n nets->push_back(net);\n }\n delete net_iter;\n}\n\nvoid\ndbSdcNetwork::findPinsMatching(const Instance *instance,\n\t\t\t const PatternMatch *pattern,\n\t\t\t PinSeq *pins) const\n{\n if (stringEq(pattern->pattern(), \"*\")) {\n \/\/ Pattern of '*' matches all child instance pins.\n InstanceChildIterator *child_iter = childIterator(instance);\n while (child_iter->hasNext()) {\n Instance *child = child_iter->next();\n InstancePinIterator *pin_iter = pinIterator(child);\n while (pin_iter->hasNext()) {\n\tPin *pin = pin_iter->next();\n\tpins->push_back(pin);\n }\n delete pin_iter;\n }\n delete child_iter;\n }\n else {\n char *inst_path, *port_name;\n pathNameLast(pattern->pattern(), inst_path, port_name);\n if (port_name) {\n PatternMatch inst_pattern(inst_path, pattern);\n InstanceSeq insts;\n findInstancesMatching(nullptr, &inst_pattern, &insts);\n PatternMatch port_pattern(port_name, pattern);\n for (auto inst : insts)\n\tfindMatchingPins(inst, &port_pattern, pins);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findMatchingPins(const Instance *instance,\n\t\t\t const PatternMatch *port_pattern,\n\t\t\t PinSeq *pins) const\n{\n if (instance != network_->topInstance()) {\n Cell *cell = network_->cell(instance);\n CellPortIterator *port_iter = network_->portIterator(cell);\n while (port_iter->hasNext()) {\n Port *port = port_iter->next();\n const char *port_name = network_->name(port);\n if (network_->hasMembers(port)) {\n\tbool bus_matches = port_pattern->match(port_name)\n\t || port_pattern->match(escapeDividers(port_name, network_));\n\tPortMemberIterator *member_iter = network_->memberIterator(port);\n\twhile (member_iter->hasNext()) {\n\t Port *member_port = member_iter->next();\n\t Pin *pin = network_->findPin(instance, member_port);\n\t if (pin) {\n\t if (bus_matches)\n\t pins->push_back(pin);\n\t else {\n\t const char *member_name = network_->name(member_port);\n\t if (port_pattern->match(member_name)\n\t\t || port_pattern->match(escapeDividers(member_name, network_)))\n\t\tpins->push_back(pin);\n\t }\n\t }\n\t}\n\tdelete member_iter;\n }\n else if (port_pattern->match(port_name)\n\t || port_pattern->match(escapeDividers(port_name, network_))) {\n\tPin *pin = network_->findPin(instance, port);\n\tif (pin)\n\t pins->push_back(pin);\n }\n }\n delete port_iter;\n }\n}\n\nPin *\ndbSdcNetwork::findPin(const char *path_name) const\n{\n char *inst_path, *port_name;\n pathNameLast(path_name, inst_path, port_name);\n if (inst_path) {\n Instance *inst = findInstance(inst_path);\n if (inst)\n return findPin(inst, port_name);\n else\n return nullptr;\n }\n else\n return findPin(topInstance(), path_name);\n}\n\nstatic const char *\nescapeDividers(const char *token,\n\t const Network *network)\n{\n return escapeChars(token, network->pathDivider(), '\\0',\n\t\t network->pathEscape());\n}\n\n} \/\/ namespace\n<commit_msg>dbSdcNetwork leak<commit_after>\/\/ Resizer, LEF\/DEF gate resizer\n\/\/ Copyright (c) 2019, Parallax Software, Inc.\n\/\/ \n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/ \n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\n#include \"Machine.hh\"\n#include \"PatternMatch.hh\"\n#include \"ParseBus.hh\"\n#include \"dbSdcNetwork.hh\"\n\nnamespace sta {\n\nstatic const char *\nescapeDividers(const char *token,\n\t const Network *network);\n\ndbSdcNetwork::dbSdcNetwork(Network *network) :\n SdcNetwork(network)\n{\n}\n\n\/\/ Override SdcNetwork to NetworkNameAdapter.\nInstance *\ndbSdcNetwork::findInstance(const char *path_name) const\n{\n Instance *inst = network_->findInstance(path_name);\n if (inst == nullptr)\n inst = network_->findInstance(escapeDividers(path_name, this));\n return inst;\n}\n\nvoid\ndbSdcNetwork::findInstancesMatching(const Instance *,\n\t\t\t\t const PatternMatch *pattern,\n\t\t\t\t InstanceSeq *insts) const\n{\n if (pattern->hasWildcards())\n findInstancesMatching1(pattern, insts);\n else {\n Instance *inst = findInstance(pattern->pattern());\n if (inst)\n insts->push_back(inst);\n else {\n \/\/ Look for a match with path dividers escaped.\n const char *escaped = escapeChars(pattern->pattern(), divider_, '\\0',\n\t\t\t\t\tescape_);\n inst = findInstance(escaped);\n if (inst)\n\tinsts->push_back(inst);\n else\n\t\/\/ Malo\n\tfindInstancesMatching1(pattern, insts);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findInstancesMatching1(const PatternMatch *pattern,\n\t\t\t\t InstanceSeq *insts) const\n{\n InstanceChildIterator *child_iter = childIterator(topInstance());\n while (child_iter->hasNext()) {\n Instance *child = child_iter->next();\n if (pattern->match(staToSdc(name(child))))\n insts->push_back(child);\n }\n delete child_iter;\n}\n\nvoid\ndbSdcNetwork::findNetsMatching(const Instance *,\n\t\t\t const PatternMatch *pattern,\n\t\t\t NetSeq *nets) const\n{\n if (pattern->hasWildcards())\n findNetsMatching1(pattern, nets);\n else {\n Net *net = findNet(pattern->pattern());\n if (net)\n nets->push_back(net);\n else {\n \/\/ Look for a match with path dividers escaped.\n const char *escaped = escapeChars(pattern->pattern(), divider_, '\\0',\n\t\t\t\t\tescape_);\n net = findNet(escaped);\n if (net)\n\tnets->push_back(net);\n else\n\tfindNetsMatching1(pattern, nets);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findNetsMatching1(const PatternMatch *pattern,\n\t\t\t\tNetSeq *nets) const\n{\n NetIterator *net_iter = netIterator(topInstance());\n while (net_iter->hasNext()) {\n Net *net = net_iter->next();\n if (pattern->match(staToSdc(name(net))))\n nets->push_back(net);\n }\n delete net_iter;\n}\n\nvoid\ndbSdcNetwork::findPinsMatching(const Instance *instance,\n\t\t\t const PatternMatch *pattern,\n\t\t\t PinSeq *pins) const\n{\n if (stringEq(pattern->pattern(), \"*\")) {\n \/\/ Pattern of '*' matches all child instance pins.\n InstanceChildIterator *child_iter = childIterator(instance);\n while (child_iter->hasNext()) {\n Instance *child = child_iter->next();\n InstancePinIterator *pin_iter = pinIterator(child);\n while (pin_iter->hasNext()) {\n\tPin *pin = pin_iter->next();\n\tpins->push_back(pin);\n }\n delete pin_iter;\n }\n delete child_iter;\n }\n else {\n char *inst_path, *port_name;\n pathNameLast(pattern->pattern(), inst_path, port_name);\n if (port_name) {\n PatternMatch inst_pattern(inst_path, pattern);\n InstanceSeq insts;\n findInstancesMatching(nullptr, &inst_pattern, &insts);\n PatternMatch port_pattern(port_name, pattern);\n for (auto inst : insts)\n\tfindMatchingPins(inst, &port_pattern, pins);\n }\n }\n}\n\nvoid\ndbSdcNetwork::findMatchingPins(const Instance *instance,\n\t\t\t const PatternMatch *port_pattern,\n\t\t\t PinSeq *pins) const\n{\n if (instance != network_->topInstance()) {\n Cell *cell = network_->cell(instance);\n CellPortIterator *port_iter = network_->portIterator(cell);\n while (port_iter->hasNext()) {\n Port *port = port_iter->next();\n const char *port_name = network_->name(port);\n if (network_->hasMembers(port)) {\n\tbool bus_matches = port_pattern->match(port_name)\n\t || port_pattern->match(escapeDividers(port_name, network_));\n\tPortMemberIterator *member_iter = network_->memberIterator(port);\n\twhile (member_iter->hasNext()) {\n\t Port *member_port = member_iter->next();\n\t Pin *pin = network_->findPin(instance, member_port);\n\t if (pin) {\n\t if (bus_matches)\n\t pins->push_back(pin);\n\t else {\n\t const char *member_name = network_->name(member_port);\n\t if (port_pattern->match(member_name)\n\t\t || port_pattern->match(escapeDividers(member_name, network_)))\n\t\tpins->push_back(pin);\n\t }\n\t }\n\t}\n\tdelete member_iter;\n }\n else if (port_pattern->match(port_name)\n\t || port_pattern->match(escapeDividers(port_name, network_))) {\n\tPin *pin = network_->findPin(instance, port);\n\tif (pin)\n\t pins->push_back(pin);\n }\n }\n delete port_iter;\n }\n}\n\nPin *\ndbSdcNetwork::findPin(const char *path_name) const\n{\n char *inst_path, *port_name;\n pathNameLast(path_name, inst_path, port_name);\n Pin *pin = nullptr;\n if (inst_path) {\n Instance *inst = findInstance(inst_path);\n if (inst)\n pin = findPin(inst, port_name);\n else\n pin = nullptr;\n }\n else\n pin = findPin(topInstance(), path_name);\n stringDelete(inst_path);\n stringDelete(port_name);\n return pin;\n}\n\nstatic const char *\nescapeDividers(const char *token,\n\t const Network *network)\n{\n return escapeChars(token, network->pathDivider(), '\\0',\n\t\t network->pathEscape());\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"GraphTypes.hpp\"\nnamespace envire { namespace core\n{\n \/** Structure to store the parent and children relation for a vertex in a tree.\n *\/\n struct VertexRelation\n {\n VertexRelation* parentRelation; \/**<can be NULL *\/\n GraphTraits::vertex_descriptor parent; \/**<can be null_vertex *\/\n std::unordered_set<GraphTraits::vertex_descriptor> children;\n };\n\n \/**A map that shows the vertex information (parent and children) of the vertices in a tree.\n The key is the vertex descriptor.*\/\n using VertexRelationMap = std::unordered_map<GraphTraits::vertex_descriptor, VertexRelation>;\n \n \n class TreeView;\n \/**A class that notifies TreeViews about updates *\/\n struct TreeUpdatePublisher\n {\n virtual ~TreeUpdatePublisher() {}\n \/**Unsubscribe the view from the publisher *\/\n virtual void unsubscribeTreeView(TreeView* view) = 0;\n \/**Subscribe the view to the publisher *\/\n virtual void subscribeTreeView(TreeView* view) = 0;\n };\n \n \/** A TreeView is a tree shaped snapshot of the graph structure.\n * it is generated by traversing the graph in bfs order, starting from a \n * root node. The vertex_descriptors used in the graph are pointers to\n * vertices in the graph and can be used to manipulate the graph.\n *\/\n class TreeView\n {\n public:\n \n TreeView(GraphTraits::vertex_descriptor root) : root(root) {}\n \n TreeView() : root(GraphTraits::null_vertex()) {}\n \n \/**Creates a copy ***without*** retaining the treeUpdated subscribers *\/\n TreeView(const TreeView& other) {*this = other;}\n \n \/**Creates a copy ***without*** retaining the treeUpdated subscribers *\/\n TreeView& operator=(const TreeView& other);\n \n TreeView(TreeView&& other) noexcept;\n \n virtual ~TreeView();\n \n \/**If a publisher is set the TreeView will automatically unsubscribe \n * from the publisher on destruction. *\/\n void setPublisher(TreeUpdatePublisher* pub);\n\n bool isRoot(const GraphTraits::vertex_descriptor vd) const;\n \n \/**Removes all content from this TreeView *\/\n void clear();\n \n \/**Unsibscribe from the currently subscribed publisher *\/\n void unsubscribe();\n \n \/**Returns true if an edge between a and b exists in @p view \n * and is not a cross-edge*\/\n bool edgeExists(const GraphTraits::vertex_descriptor a, const GraphTraits::vertex_descriptor b) const;\n \/**Returns true if @p vd exists in the view. *\/\n bool vertexExists(const GraphTraits::vertex_descriptor vd) const;\n \n \/**visits all vertices in the tree starting at @p node in dfs order.\n * I.e. it first visits node, then all its children.\n * Calls @p f(vertex_descriptor node, vertex_descriptor parent) for each node.*\/\n template <class Func>\n void visitDfs(const GraphTraits::vertex_descriptor node, Func f)\n {\n const auto& parent = tree[node].parent;\n const auto& children = tree[node].children;\n f(node, parent);\n for(const GraphTraits::vertex_descriptor child : children)\n {\n visitDfs(child, f);\n }\n }\n \n \/**visits all vertices in the tree starting at @p node in bfs order.\n * Calls @p f(vertex_descriptor node, vertex_descriptor parent) for each node.*\/\n template <class Func>\n void visitBfs(const GraphTraits::vertex_descriptor node, Func f)\n {\n std::deque<GraphTraits::vertex_descriptor> nodesToVisit;\n nodesToVisit.push_back(node);\n while(nodesToVisit.size() > 0)\n {\n const GraphTraits::vertex_descriptor current = nodesToVisit.front();\n nodesToVisit.pop_front();\n const GraphTraits::vertex_descriptor parent = getParent(current);\n f(current, parent);\n for(GraphTraits::vertex_descriptor child : tree[current].children)\n {\n nodesToVisit.push_back(child);\n }\n }\n }\n \n \/**Add a cross edge to the view.\n * Emits crossEdgeAdded event *\/\n void addCrossEdge(const GraphTraits::edge_descriptor edge);\n \n \/**Add an edge to the view.\n * Emits edgeAdded*\/\n void addEdge(GraphTraits::vertex_descriptor origin, GraphTraits::vertex_descriptor target);\n \n \/**Adds the initial root node to the TreeView *\/\n void addRoot(GraphTraits::vertex_descriptor root);\n \n \/\/FIXME comment exception?!\n GraphTraits::vertex_descriptor getParent(GraphTraits::vertex_descriptor node) const;\n \n \/**The signals are invoked whenever the tree is updated by the TransformGraph\n * @note This is only the case if you requested an updating TreeView. \n * Otherwise they'll never be invoked.\n *\/\n boost::signals2::signal<void (GraphTraits::edge_descriptor)> crossEdgeAdded;\n boost::signals2::signal<void (GraphTraits::vertex_descriptor origin,\n GraphTraits::vertex_descriptor target)> edgeAdded;\n \n\n \/* The edges, that had to be removed to create the tree.\n * I.e. All edges that lead to a vertex that has already been discovered.\n * This does **not** include back-edges. I.e. edges that lead to a vertex that\n * has already been visited.\n * @note The TransformGraph always contains two edges between connected nodes (the edge and the inverse edge)\n * However only one of them will be in the crossEdges. The other one automatically becomes a back-edge \n * and is ignored. *\/\n std::vector<GraphTraits::edge_descriptor> crossEdges;\n \n \/**The root node of this TreeView *\/\n GraphTraits::vertex_descriptor root;\n VertexRelationMap tree; \n protected:\n TreeUpdatePublisher* publisher = nullptr;\/*< Used for automatic unsubscribing in dtor *\/\n };\n}}<commit_msg>TreeView: Fix indentation<commit_after>#pragma once\n\n#include \"GraphTypes.hpp\"\nnamespace envire { namespace core\n{\n \/** Structure to store the parent and children relation for a vertex in a tree.\n *\/\n struct VertexRelation\n {\n VertexRelation* parentRelation; \/**<can be NULL *\/\n GraphTraits::vertex_descriptor parent; \/**<can be null_vertex *\/\n std::unordered_set<GraphTraits::vertex_descriptor> children;\n };\n\n \/**A map that shows the vertex information (parent and children) of the vertices in a tree.\n The key is the vertex descriptor.*\/\n using VertexRelationMap = std::unordered_map<GraphTraits::vertex_descriptor, VertexRelation>;\n \n \n class TreeView;\n \/**A class that notifies TreeViews about updates *\/\n struct TreeUpdatePublisher\n {\n virtual ~TreeUpdatePublisher() {}\n \/**Unsubscribe the view from the publisher *\/\n virtual void unsubscribeTreeView(TreeView* view) = 0;\n \/**Subscribe the view to the publisher *\/\n virtual void subscribeTreeView(TreeView* view) = 0;\n };\n \n \/** A TreeView is a tree shaped snapshot of the graph structure.\n * it is generated by traversing the graph in bfs order, starting from a \n * root node. The vertex_descriptors used in the graph are pointers to\n * vertices in the graph and can be used to manipulate the graph.\n *\/\n class TreeView\n {\n public:\n \n TreeView(GraphTraits::vertex_descriptor root) : root(root) {}\n \n TreeView() : root(GraphTraits::null_vertex()) {}\n \n \/**Creates a copy ***without*** retaining the treeUpdated subscribers *\/\n TreeView(const TreeView& other) {*this = other;}\n \n \/**Creates a copy ***without*** retaining the treeUpdated subscribers *\/\n TreeView& operator=(const TreeView& other);\n \n TreeView(TreeView&& other) noexcept;\n \n virtual ~TreeView();\n \n \/**If a publisher is set the TreeView will automatically unsubscribe \n * from the publisher on destruction. *\/\n void setPublisher(TreeUpdatePublisher* pub);\n\n bool isRoot(const GraphTraits::vertex_descriptor vd) const;\n \n \/**Removes all content from this TreeView *\/\n void clear();\n \n \/**Unsibscribe from the currently subscribed publisher *\/\n void unsubscribe();\n \n \/**Returns true if an edge between a and b exists in @p view \n * and is not a cross-edge*\/\n bool edgeExists(const GraphTraits::vertex_descriptor a, const GraphTraits::vertex_descriptor b) const;\n \/**Returns true if @p vd exists in the view. *\/\n bool vertexExists(const GraphTraits::vertex_descriptor vd) const;\n \n \/**visits all vertices in the tree starting at @p node in dfs order.\n * I.e. it first visits node, then all its children.\n * Calls @p f(vertex_descriptor node, vertex_descriptor parent) for each node.*\/\n template <class Func>\n void visitDfs(const GraphTraits::vertex_descriptor node, Func f)\n {\n const auto& parent = tree[node].parent;\n const auto& children = tree[node].children;\n f(node, parent);\n for(const GraphTraits::vertex_descriptor child : children)\n {\n visitDfs(child, f);\n }\n }\n \n \/**visits all vertices in the tree starting at @p node in bfs order.\n * Calls @p f(vertex_descriptor node, vertex_descriptor parent) for each node.*\/\n template <class Func>\n void visitBfs(const GraphTraits::vertex_descriptor node, Func f)\n {\n std::deque<GraphTraits::vertex_descriptor> nodesToVisit;\n nodesToVisit.push_back(node);\n while(nodesToVisit.size() > 0)\n {\n const GraphTraits::vertex_descriptor current = nodesToVisit.front();\n nodesToVisit.pop_front();\n const GraphTraits::vertex_descriptor parent = getParent(current);\n f(current, parent);\n for(GraphTraits::vertex_descriptor child : tree[current].children)\n {\n nodesToVisit.push_back(child);\n }\n }\n }\n \n \/**Add a cross edge to the view.\n * Emits crossEdgeAdded event *\/\n void addCrossEdge(const GraphTraits::edge_descriptor edge);\n \n \/**Add an edge to the view.\n * Emits edgeAdded*\/\n void addEdge(GraphTraits::vertex_descriptor origin, GraphTraits::vertex_descriptor target);\n \n \/**Adds the initial root node to the TreeView *\/\n void addRoot(GraphTraits::vertex_descriptor root);\n \n \/\/FIXME comment exception?!\n GraphTraits::vertex_descriptor getParent(GraphTraits::vertex_descriptor node) const;\n \n \/**The signals are invoked whenever the tree is updated by the TransformGraph\n * @note This is only the case if you requested an updating TreeView. \n * Otherwise they'll never be invoked.\n *\/\n boost::signals2::signal<void (GraphTraits::edge_descriptor)> crossEdgeAdded;\n boost::signals2::signal<void (GraphTraits::vertex_descriptor origin,\n GraphTraits::vertex_descriptor target)> edgeAdded;\n \n\n \/* The edges, that had to be removed to create the tree.\n * I.e. All edges that lead to a vertex that has already been discovered.\n * This does **not** include back-edges. I.e. edges that lead to a vertex that\n * has already been visited.\n * @note The TransformGraph always contains two edges between connected nodes (the edge and the inverse edge)\n * However only one of them will be in the crossEdges. The other one automatically becomes a back-edge \n * and is ignored. *\/\n std::vector<GraphTraits::edge_descriptor> crossEdges;\n \n \/**The root node of this TreeView *\/\n GraphTraits::vertex_descriptor root;\n VertexRelationMap tree; \n protected:\n TreeUpdatePublisher* publisher = nullptr;\/*< Used for automatic unsubscribing in dtor *\/\n };\n}}<|endoftext|>"} {"text":"<commit_before>#include \"Model.h\"\n\nModel::Model(std::string filename)\n{\n\tloadModel(filename);\n}\n\nModel::~Model()\n{\n\n}\n\nvoid Model::loadModel(std::string& path)\n{\n\tAssimp::Importer importer;\n\tconst aiScene* scene = importer.ReadFile(path, aiProcess_Triangulate | aiProcess_FlipUVs | aiProcess_GenNormals | aiProcess_OptimizeMeshes);\n\n\tif (!scene || scene->mFlags == AI_SCENE_FLAGS_INCOMPLETE || !scene->mRootNode)\n\t{\n\t\tprintf(\"ERROR::ASSIMP:: %s\\n\", importer.GetErrorString());\n\t\treturn;\n\t}\n\n\tdirectory = path.substr(0, path.find_last_of('\/'));\n\n\tthis->processNode(scene->mRootNode, scene);\n}\n\nvoid Model::processNode(aiNode* node, const aiScene* scene)\n{\n\tfor (GLuint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tmeshes.push_back(processMesh(mesh, scene));\n\t}\n\n\tfor (GLuint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tprocessNode(node->mChildren[i], scene);\n\t}\n}\n\nMesh Model::processMesh(aiMesh* mesh, const aiScene* scene)\n{\n\tstd::vector<Vertex> vertices;\n\tstd::vector<GLuint> indices;\n\tstd::vector<Texture> textures;\n\n\tfor (GLuint i = 0; i < mesh->mNumVertices; i++)\n\t{\n\t\tVertex vertex;\n\n\t\tglm::vec3 vector;\n\n\t\tvector.x = mesh->mVertices[i].x;\n\t\tvector.y = mesh->mVertices[i].y;\n\t\tvector.z = mesh->mVertices[i].z;\n\t\tvertex.Position = vector;\n\n\t\tif (mesh->HasNormals())\n\t\t{\n\t\t\tvector.x = mesh->mNormals[i].x;\n\t\t\tvector.y = mesh->mNormals[i].y;\n\t\t\tvector.z = mesh->mNormals[i].z;\n\t\t\tvertex.Normal = vector;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvertex.Normal = glm::vec3(0.0f, 0.0f, 0.0f);\n\t\t}\n\n\t\tif (mesh->mTextureCoords[0])\n\t\t{\n\t\t\tglm::vec2 vec;\n\t\t\tvec.x = mesh->mTextureCoords[0][i].x;\n\t\t\tvec.y = mesh->mTextureCoords[0][i].y;\n\t\t\tvertex.TexCoords = vec;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvertex.TexCoords = glm::vec2(0.0f, 0.0f);\n\t\t}\n\n\t\tvertices.push_back(vertex);\n\t}\n\n\tfor (GLuint i = 0; i < mesh->mNumFaces; i++)\n\t{\n\t\taiFace face = mesh->mFaces[i];\n\n\t\tfor (GLuint j = 0; j < face.mNumIndices; j++)\n\t\t{\n\t\t\tindices.push_back(face.mIndices[j]);\n\t\t}\n\t}\n\n\tif (mesh->mMaterialIndex >= 0)\n\t{\n\t\taiMaterial* material = scene->mMaterials[mesh->mMaterialIndex];\n\n\t\tstd::vector<Texture> diffuseMaps = loadMaterialTextures(material, aiTextureType_DIFFUSE, \"texture_diffuse\");\n\t\ttextures.insert(textures.end(), diffuseMaps.begin(), diffuseMaps.end());\n\n\t\tstd::vector<Texture> specularMaps = loadMaterialTextures(material, aiTextureType_SPECULAR, \"texture_specular\");\n\t\ttextures.insert(textures.end(), specularMaps.begin(), specularMaps.end());\n\t}\n\n\treturn Mesh(vertices, indices, textures);\n}\n\nstd::vector<Texture> Model::loadMaterialTextures(aiMaterial* mat, aiTextureType type, std::string typeName)\n{\n\tTextureLoader textureLoader = TextureLoader::instance();\n\n\tstd::vector<Texture> textures;\n\n\tfor (GLuint i = 0; i < mat->GetTextureCount(type); i++)\n\t{\n\t\taiString str;\n\t\tmat->GetTexture(type, i, &str);\n\n\t\tGLboolean skip = false;\n\t\tfor (GLuint j = 0; j < texturesLoaded.size(); j++)\n\t\t{\n\t\t\tif (texturesLoaded[j].path == str)\n\t\t\t{\n\t\t\t\ttextures.push_back(texturesLoaded[j]);\n\t\t\t\tskip = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!skip)\n\t\t{\n\t\t\tTexture texture;\n\t\t\ttexture.id = textureLoader.loadTexture(directory + \"\/\" + std::string(str.C_Str()));\n\t\t\ttexture.type = typeName;\n\t\t\ttexture.path = str;\n\t\t\ttextures.push_back(texture);\n\n\t\t\ttexturesLoaded.push_back(texture);\n\t\t}\n\t}\n\treturn textures;\n}\n\nvoid Model::draw(ShaderProgram* shader)\n{\n\tfor (GLuint i = 0; i < meshes.size(); i++)\n\t\tmeshes[i].Draw(shader);\n}<commit_msg>Tangent and Bitangent fix<commit_after>#include \"Model.h\"\n\nModel::Model(std::string filename)\n{\n\tloadModel(filename);\n}\n\nModel::~Model()\n{\n\n}\n\nvoid Model::loadModel(std::string& path)\n{\n\tAssimp::Importer importer;\n\tconst aiScene* scene = importer.ReadFile(path, aiProcess_Triangulate | aiProcess_FlipUVs | aiProcess_GenNormals | aiProcess_OptimizeMeshes | aiProcess_CalcTangentSpace);\n\n\tif (!scene || scene->mFlags == AI_SCENE_FLAGS_INCOMPLETE || !scene->mRootNode)\n\t{\n\t\tprintf(\"ERROR::ASSIMP:: %s\\n\", importer.GetErrorString());\n\t\treturn;\n\t}\n\n\tdirectory = path.substr(0, path.find_last_of('\/'));\n\n\tthis->processNode(scene->mRootNode, scene);\n}\n\nvoid Model::processNode(aiNode* node, const aiScene* scene)\n{\n\tfor (GLuint i = 0; i < node->mNumMeshes; i++)\n\t{\n\t\taiMesh* mesh = scene->mMeshes[node->mMeshes[i]];\n\t\tmeshes.push_back(processMesh(mesh, scene));\n\t}\n\n\tfor (GLuint i = 0; i < node->mNumChildren; i++)\n\t{\n\t\tprocessNode(node->mChildren[i], scene);\n\t}\n}\n\nMesh Model::processMesh(aiMesh* mesh, const aiScene* scene)\n{\n\tstd::vector<Vertex> vertices;\n\tstd::vector<GLuint> indices;\n\tstd::vector<Texture> textures;\n\n\tfor (GLuint i = 0; i < mesh->mNumVertices; i++)\n\t{\n\t\tVertex vertex;\n\n\t\tglm::vec3 vector;\n\n\t\tvector.x = mesh->mVertices[i].x;\n\t\tvector.y = mesh->mVertices[i].y;\n\t\tvector.z = mesh->mVertices[i].z;\n\t\tvertex.Position = vector;\n\n\t\tif (mesh->HasNormals())\n\t\t{\n\t\t\tvector.x = mesh->mNormals[i].x;\n\t\t\tvector.y = mesh->mNormals[i].y;\n\t\t\tvector.z = mesh->mNormals[i].z;\n\t\t\tvertex.Normal = vector;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvertex.Normal = glm::vec3(0.0f, 0.0f, 0.0f);\n\t\t}\n\n\t\tif (mesh->mTextureCoords[0])\n\t\t{\n\t\t\tglm::vec2 vec;\n\t\t\tvec.x = mesh->mTextureCoords[0][i].x;\n\t\t\tvec.y = mesh->mTextureCoords[0][i].y;\n\t\t\tvertex.TexCoords = vec;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvertex.TexCoords = glm::vec2(0.0f, 0.0f);\n\t\t}\n\n\t\tif (mesh->HasTangentsAndBitangents())\n\t\t{\n\t\t\tvector.x = mesh->mTangents[i].x;\n\t\t\tvector.y = mesh->mTangents[i].y;\n\t\t\tvector.z = mesh->mTangents[i].z;\n\t\t\tvertex.Tangent = vector;\n\n\t\t\tvector.x = mesh->mBitangents[i].x;\n\t\t\tvector.y = mesh->mBitangents[i].y;\n\t\t\tvector.z = mesh->mBitangents[i].z;\n\t\t\tvertex.Bitangent = vector;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tvertex.TexCoords = glm::vec2(0.0f, 0.0f);\n\t\t}\n\n\t\tvertices.push_back(vertex);\n\t}\n\n\tfor (GLuint i = 0; i < mesh->mNumFaces; i++)\n\t{\n\t\taiFace face = mesh->mFaces[i];\n\n\t\tfor (GLuint j = 0; j < face.mNumIndices; j++)\n\t\t{\n\t\t\tindices.push_back(face.mIndices[j]);\n\t\t}\n\t}\n\n\tif (mesh->mMaterialIndex >= 0)\n\t{\n\t\taiMaterial* material = scene->mMaterials[mesh->mMaterialIndex];\n\n\t\tstd::vector<Texture> diffuseMaps = loadMaterialTextures(material, aiTextureType_DIFFUSE, \"texture_diffuse\");\n\t\ttextures.insert(textures.end(), diffuseMaps.begin(), diffuseMaps.end());\n\n\t\tstd::vector<Texture> specularMaps = loadMaterialTextures(material, aiTextureType_HEIGHT, \"texture_normal\");\n\n\t\tstd::vector<Texture> specularMaps = loadMaterialTextures(material, aiTextureType_SPECULAR, \"texture_specular\");\n\t\ttextures.insert(textures.end(), specularMaps.begin(), specularMaps.end());\n\t}\n\n\treturn Mesh(vertices, indices, textures);\n}\n\nstd::vector<Texture> Model::loadMaterialTextures(aiMaterial* mat, aiTextureType type, std::string typeName)\n{\n\tTextureLoader textureLoader = TextureLoader::instance();\n\n\tstd::vector<Texture> textures;\n\n\tfor (GLuint i = 0; i < mat->GetTextureCount(type); i++)\n\t{\n\t\taiString str;\n\t\tmat->GetTexture(type, i, &str);\n\n\t\tGLboolean skip = false;\n\t\tfor (GLuint j = 0; j < texturesLoaded.size(); j++)\n\t\t{\n\t\t\tif (texturesLoaded[j].path == str)\n\t\t\t{\n\t\t\t\ttextures.push_back(texturesLoaded[j]);\n\t\t\t\tskip = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (!skip)\n\t\t{\n\t\t\tTexture texture;\n\t\t\ttexture.id = textureLoader.loadTexture(directory + \"\/\" + std::string(str.C_Str()));\n\t\t\ttexture.type = typeName;\n\t\t\ttexture.path = str;\n\t\t\ttextures.push_back(texture);\n\n\t\t\ttexturesLoaded.push_back(texture);\n\t\t}\n\t}\n\treturn textures;\n}\n\nvoid Model::draw(ShaderProgram* shader)\n{\n\tfor (GLuint i = 0; i < meshes.size(); i++)\n\t\tmeshes[i].Draw(shader);\n}<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, OpenROAD\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice, this\n\/\/ list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the copyright holder nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#include <utility>\n#include <tuple> \n#include \"dbShape.h\"\n#include \"search_gui.h\"\n\nnamespace gui {\n\n\/\/ Build the rtree's for the block\nvoid Search::init(odb::dbBlock* block)\n{\n for (odb::dbNet* net : block->getNets()) {\n addNet(net);\n addSNet(net);\n }\n\n for (odb::dbInst* inst : block->getInsts()) {\n odb::dbPlacementStatus status = inst->getPlacementStatus();\n if (status == odb::dbPlacementStatus::NONE\n || status == odb::dbPlacementStatus::UNPLACED) {\n continue;\n }\n addInst(inst);\n }\n}\n\nvoid Search::addVia(odb::dbNet* net,\n odb::dbShape* shape,\n int x,\n int y)\n{\n if (shape->getType() == odb::dbShape::TECH_VIA) {\n odb::dbTechVia* via = shape->getTechVia();\n for (odb::dbBox* box : via->getBoxes()) {\n point_t ll(x + box->xMin(), y + box->yMin());\n point_t ur(x + box->xMax(), y + box->yMax());\n box_t bbox(ll, ur);\n polygon_t poly;\n bg::convert(bbox,poly);\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n } else {\n odb::dbVia* via = shape->getVia();\n for (odb::dbBox* box : via->getBoxes()) {\n point_t ll(x + box->xMin(), y + box->yMin());\n point_t ur(x + box->xMax(), y + box->yMax());\n box_t bbox(ll, ur);\n polygon_t poly;\n bg::convert(bbox,poly);\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n }\n}\n\nvoid Search::addSNet(odb::dbNet* net)\n{\n odb::dbSet<odb::dbSWire> swires = net->getSWires();\n\n for (auto itr = swires.begin(); itr != swires.end(); ++itr) {\n odb::dbSWire* swire = *itr;\n odb::dbSet<odb::dbSBox> wires = swire->getWires();\n odb::dbSet<odb::dbSBox>::iterator box_itr;\n\n for (box_itr = wires.begin(); box_itr != wires.end(); ++box_itr) {\n odb::dbSBox* box = *box_itr;\n if (box->isVia()) {\n continue;\n }\n\n box_t bbox(point_t(box->xMin(), box->yMin()),\n point_t(box->xMax(), box->yMax()));\n polygon_t poly;\n auto points = box->getGeomShape()->getPoints();\n for(auto point:points)\n bg::append(poly.outer(),point_t(point.getX(),point.getY()));\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n }\n}\n\nvoid Search::addNet(odb::dbNet* net)\n{\n odb::dbWire* wire = net->getWire();\n\n if (wire == NULL)\n return;\n\n odb::dbWireShapeItr itr;\n odb::dbShape s;\n\n for (itr.begin(wire); itr.next(s);) {\n int shapeId = itr.getShapeId();\n if (s.isVia()) {\n addVia(net, &s, itr._prev_x, itr._prev_y);\n } else {\n box_t box(point_t(s.xMin(), s.yMin()), point_t(s.xMax(), s.yMax()));\n polygon_t poly;\n bg::convert(box,poly);\n shapes_[s.getTechLayer()].insert(std::make_tuple(box,poly, net));\n }\n }\n}\n\nvoid Search::addInst(odb::dbInst* inst)\n{\n odb::dbBox* bbox = inst->getBBox();\n point_t ll(bbox->xMin(), bbox->yMin());\n point_t ur(bbox->xMax(), bbox->yMax());\n box_t box(ll, ur);\n polygon_t poly;\n bg::convert(box,poly);\n insts_.insert(std::make_tuple(box,poly, inst));\n}\n\nvoid Search::clear()\n{\n insts_.clear();\n shapes_.clear();\n}\n\ntemplate <typename T>\nclass Search::MinSizePredicate\n{\n public:\n MinSizePredicate(int min_size) : min_size_(min_size) {}\n bool operator()(const std::tuple<box_t,polygon_t, T>& o) const\n {\n box_t box = std::get<0>(o);\n const point_t& ll = box.min_corner();\n const point_t& ur = box.max_corner();\n int w = ur.x() - ll.x();\n int h = ur.y() - ll.y();\n return std::max(w, h) >= min_size_;\n }\n\n private:\n int min_size_;\n};\n\ntemplate <typename T>\nclass Search::MinHeightPredicate\n{\n public:\n MinHeightPredicate(int min_height) : min_height_(min_height) {}\n bool operator()(const std::tuple<box_t,polygon_t, T>& o) const\n {\n box_t box = std::get<0>(o);\n const point_t& ll = box.min_corner();\n const point_t& ur = box.max_corner();\n int h = ur.y() - ll.y();\n return h >= min_height_;\n }\n\n private:\n int min_height_;\n};\n\nSearch::ShapeRange Search::search_shapes(odb::dbTechLayer* layer,\n int xLo,\n int yLo,\n int xHi,\n int yHi,\n int minSize)\n{\n auto it = shapes_.find(layer);\n if (it == shapes_.end()) {\n return ShapeRange();\n }\n\n auto& rtree = it->second;\n \n box_t query(point_t(xLo, yLo), point_t(xHi, yHi));\n if (minSize > 0) {\n return ShapeRange(\n rtree.qbegin(bgi::intersects(query)\n && bgi::satisfies(MinSizePredicate<odb::dbNet*>(minSize))),\n rtree.qend());\n }\n\n return ShapeRange(rtree.qbegin(bgi::intersects(query)), rtree.qend());\n}\n\nSearch::InstRange Search::search_insts(int xLo,\n int yLo,\n int xHi,\n int yHi,\n int minHeight)\n{\n box_t query(point_t(xLo, yLo), point_t(xHi, yHi));\n if (minHeight > 0) {\n return InstRange(\n insts_.qbegin(\n bgi::intersects(query)\n && bgi::satisfies(MinHeightPredicate<odb::dbInst*>(minHeight))),\n insts_.qend());\n }\n\n return InstRange(insts_.qbegin(bgi::intersects(query)), insts_.qend());\n}\n\n} \/\/ namespace gui\n<commit_msg>include bug fix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BSD 3-Clause License\n\/\/\n\/\/ Copyright (c) 2019, OpenROAD\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright notice, this\n\/\/ list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of the copyright holder nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\n#include <utility>\n#include <tuple> \n#include \"dbShape.h\"\n#include \"search.h\"\n\nnamespace gui {\n\n\/\/ Build the rtree's for the block\nvoid Search::init(odb::dbBlock* block)\n{\n for (odb::dbNet* net : block->getNets()) {\n addNet(net);\n addSNet(net);\n }\n\n for (odb::dbInst* inst : block->getInsts()) {\n odb::dbPlacementStatus status = inst->getPlacementStatus();\n if (status == odb::dbPlacementStatus::NONE\n || status == odb::dbPlacementStatus::UNPLACED) {\n continue;\n }\n addInst(inst);\n }\n}\n\nvoid Search::addVia(odb::dbNet* net,\n odb::dbShape* shape,\n int x,\n int y)\n{\n if (shape->getType() == odb::dbShape::TECH_VIA) {\n odb::dbTechVia* via = shape->getTechVia();\n for (odb::dbBox* box : via->getBoxes()) {\n point_t ll(x + box->xMin(), y + box->yMin());\n point_t ur(x + box->xMax(), y + box->yMax());\n box_t bbox(ll, ur);\n polygon_t poly;\n bg::convert(bbox,poly);\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n } else {\n odb::dbVia* via = shape->getVia();\n for (odb::dbBox* box : via->getBoxes()) {\n point_t ll(x + box->xMin(), y + box->yMin());\n point_t ur(x + box->xMax(), y + box->yMax());\n box_t bbox(ll, ur);\n polygon_t poly;\n bg::convert(bbox,poly);\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n }\n}\n\nvoid Search::addSNet(odb::dbNet* net)\n{\n odb::dbSet<odb::dbSWire> swires = net->getSWires();\n\n for (auto itr = swires.begin(); itr != swires.end(); ++itr) {\n odb::dbSWire* swire = *itr;\n odb::dbSet<odb::dbSBox> wires = swire->getWires();\n odb::dbSet<odb::dbSBox>::iterator box_itr;\n\n for (box_itr = wires.begin(); box_itr != wires.end(); ++box_itr) {\n odb::dbSBox* box = *box_itr;\n if (box->isVia()) {\n continue;\n }\n\n box_t bbox(point_t(box->xMin(), box->yMin()),\n point_t(box->xMax(), box->yMax()));\n polygon_t poly;\n auto points = box->getGeomShape()->getPoints();\n for(auto point:points)\n bg::append(poly.outer(),point_t(point.getX(),point.getY()));\n shapes_[box->getTechLayer()].insert(std::make_tuple(bbox,poly, net));\n }\n }\n}\n\nvoid Search::addNet(odb::dbNet* net)\n{\n odb::dbWire* wire = net->getWire();\n\n if (wire == NULL)\n return;\n\n odb::dbWireShapeItr itr;\n odb::dbShape s;\n\n for (itr.begin(wire); itr.next(s);) {\n int shapeId = itr.getShapeId();\n if (s.isVia()) {\n addVia(net, &s, itr._prev_x, itr._prev_y);\n } else {\n box_t box(point_t(s.xMin(), s.yMin()), point_t(s.xMax(), s.yMax()));\n polygon_t poly;\n bg::convert(box,poly);\n shapes_[s.getTechLayer()].insert(std::make_tuple(box,poly, net));\n }\n }\n}\n\nvoid Search::addInst(odb::dbInst* inst)\n{\n odb::dbBox* bbox = inst->getBBox();\n point_t ll(bbox->xMin(), bbox->yMin());\n point_t ur(bbox->xMax(), bbox->yMax());\n box_t box(ll, ur);\n polygon_t poly;\n bg::convert(box,poly);\n insts_.insert(std::make_tuple(box,poly, inst));\n}\n\nvoid Search::clear()\n{\n insts_.clear();\n shapes_.clear();\n}\n\ntemplate <typename T>\nclass Search::MinSizePredicate\n{\n public:\n MinSizePredicate(int min_size) : min_size_(min_size) {}\n bool operator()(const std::tuple<box_t,polygon_t, T>& o) const\n {\n box_t box = std::get<0>(o);\n const point_t& ll = box.min_corner();\n const point_t& ur = box.max_corner();\n int w = ur.x() - ll.x();\n int h = ur.y() - ll.y();\n return std::max(w, h) >= min_size_;\n }\n\n private:\n int min_size_;\n};\n\ntemplate <typename T>\nclass Search::MinHeightPredicate\n{\n public:\n MinHeightPredicate(int min_height) : min_height_(min_height) {}\n bool operator()(const std::tuple<box_t,polygon_t, T>& o) const\n {\n box_t box = std::get<0>(o);\n const point_t& ll = box.min_corner();\n const point_t& ur = box.max_corner();\n int h = ur.y() - ll.y();\n return h >= min_height_;\n }\n\n private:\n int min_height_;\n};\n\nSearch::ShapeRange Search::search_shapes(odb::dbTechLayer* layer,\n int xLo,\n int yLo,\n int xHi,\n int yHi,\n int minSize)\n{\n auto it = shapes_.find(layer);\n if (it == shapes_.end()) {\n return ShapeRange();\n }\n\n auto& rtree = it->second;\n \n box_t query(point_t(xLo, yLo), point_t(xHi, yHi));\n if (minSize > 0) {\n return ShapeRange(\n rtree.qbegin(bgi::intersects(query)\n && bgi::satisfies(MinSizePredicate<odb::dbNet*>(minSize))),\n rtree.qend());\n }\n\n return ShapeRange(rtree.qbegin(bgi::intersects(query)), rtree.qend());\n}\n\nSearch::InstRange Search::search_insts(int xLo,\n int yLo,\n int xHi,\n int yHi,\n int minHeight)\n{\n box_t query(point_t(xLo, yLo), point_t(xHi, yHi));\n if (minHeight > 0) {\n return InstRange(\n insts_.qbegin(\n bgi::intersects(query)\n && bgi::satisfies(MinHeightPredicate<odb::dbInst*>(minHeight))),\n insts_.qend());\n }\n\n return InstRange(insts_.qbegin(bgi::intersects(query)), insts_.qend());\n}\n\n} \/\/ namespace gui\n<|endoftext|>"} {"text":"<commit_before>#include \"v4l2capture.h\"\n#include \"v4l2camera.h\"\n\n\nV4L2Capture::V4L2Capture( const int cameras )\n{\n}\n\nV4L2Capture::~V4L2Capture()\n{\n}\n\nvoid V4L2Capture::addCamera( const std::string& a_fileName )\n{\n m_cameras.push_back( new V4L2Camera( a_fileName ) );\n m_acquisition.push_back( false );\n}\n\nbool V4L2Capture::isTerminated()\n{\n return m_terminate;\n}\n\nvoid V4L2Capture::start()\n{\n for( unsigned int i = 0; i < m_cameras.size(); i++ )\n {\n m_threads.push_back( new boost::thread( boost::bind( &V4L2Capture::acquisition_thread, this, i ) ) );\n }\n}\n\nvoid V4L2Capture::stop()\n{\n m_terminate = true;\n}\n\nvoid V4L2Capture::join()\n{\n for( unsigned int i = 0; i < m_threads.size(); i++ )\n {\n m_threads[i]->join();\n }\n}\n\n\nvoid V4L2Capture::receive( const cuttlefish_msgs::V4L2Control* msg )\n{\n const int camera = msg->camera_no();\n\n switch( msg->command() )\n {\n case cuttlefish_msgs::V4L2Control_CommandType_OPEN:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_CLOSE:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_START:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_STOP:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_TERMINATE:\n break;\n }\n}\n\n\nvoid V4L2Capture::acquisition_thread( const int camera_id )\n{\n V4L2Camera* input = m_cameras.at( camera_id );\n \/*\n input->stopCapture();\n sleep( 2 );\n\n int frame=0;\n input->init_mmap();\n input->readyCapture();\n\n barrier->wait();\n input->startCapture();\n\n image_t* image = data->localImage( id );\n image->info.width = settings::width;\n image->info.height = settings::height;\n image->info.Kb = 1.0;\n image->info.Kg = 1.0;\n image->info.Kr = 1.0;\n image->info.max_size = image->info.width * image->info.height * 2; \/\/ YUV = 2 bytes per pixel.\n image->data = new unsigned char[ image->info.max_size ];\n\n\n if( !( input->readyFrame() &&\n input->readFrame( image->data, image->info.size, image->info.timestamp )\n ) )\n {\n std::cerr << \"Unable to read the first frame.\" << std::endl;\n return;\n }\n\n std::cerr << \"Camera(\" << id << \") - frame size: \" << image->info.size << std::endl;\n\n bool ok = true;\n\n int accum_diff = 0; \/\/ only used by id == 0\n int accum_frames = 0; \/\/ only used by id == 0\n int accum_diff01 = 0; \/\/ only used by id == 0\n\n int default_exposure = 0;\n input->getAbsoluteExposure( default_exposure );\n\n while( true )\n {\n ok = input->readyFrame();\n\n if( !ok )\n {\n std::cerr << \"readyFrame failed.\" << std::endl;\n break;\n }\n input->readFrame( (unsigned char*) image->data, image->info.size, image->info.timestamp );\n input->getAbsoluteExposure( image->info.exposure_time );\n\n if( image->info.exposure_time != default_exposure )\n {\n input->setAbsoluteExposure( default_exposure );\n }\n\n frame++;\n\n image->info.frame_number = frame;\n\n barrier->wait();\n\n if( id == 0 ) \/\/ only one thread executes this code.\n {\n int diff = 0;\n struct timeval min = image->info.timestamp;\n struct timeval max = image->info.timestamp;\n\n for( unsigned int i = 0; i < data->localGroupSize(); i++ )\n {\n struct timeval tv = m_outputData->localImage( i )->info.timestamp;\n\n if( timevaldiff( &min, &tv ) > 0 )\n {\n min = tv;\n }\n if( timevaldiff( &max, &tv ) < 0 )\n {\n max = tv;\n }\n }\n diff = abs( timevaldiff( &max, &min ) );\n int diff01 = timevaldiff( &m_outputData->localImage( 0 )->info.timestamp, &m_outputData->localImage( 1 )->info.timestamp );\n accum_diff01 += diff01;\n\n accum_diff += diff;\n accum_frames++;\n\n if( diff < 2500 )\n {\n data->writeAndNotify();\n std::cerr << \".\" << std::flush;\n }\n else\n {\n std::cerr << \"\\n\" << \"frame \" << frame << \" dropped - time delta: \" << diff\/1000.0 << \" ms\" << std::endl;\n }\n if( accum_frames > 5 )\n {\n if( ( accum_diff \/ accum_frames ) > 10000 )\n {\n m_needSync = true;\n }\n else\n {\n \/\/int diff = accum_diff \/ ( accum_frames * 1000.0 ) + 0.5;\n\n if( accum_diff01 \/ accum_frames > 75 )\n {\n diff = 1;\n }\n else if( accum_diff01 \/ accum_frames < -75 )\n {\n diff = -1;\n }\n else\n {\n diff = 0;\n }\n if( diff != 0 )\n {\n input->setAbsoluteExposure( default_exposure + diff );\n int value;\n input->getAbsoluteExposure( value );\n std::cout << \"used exposure: \" << value << std::endl;\n accum_diff = 0;\n accum_frames = 0;\n accum_diff01 = 0;\n }\n }\n }\n }\n\n barrier->wait();\n if( m_needSync == true )\n {\n std::cerr << \"sync required. - doing sync.\" << std::endl;\n input->stopCapture();\n input->readyCapture();\n barrier->wait();\n input->startCapture();\n\n if( id == 0 )\n {\n *need_sync = false;\n accum_diff = 0;\n accum_frames = 0;\n accum_diff01 = 0;\n }\n }\n\n if( id == 0 && accum_frames >= 50 )\n {\n std::cerr << \"Avg: \" << accum_diff \/ accum_frames \/ 1000.0 << \" ms\" << std::endl;\n accum_frames = 0;\n accum_diff = 0;\n accum_diff01 = 0;\n }\n }\n input->stopCapture();\n *\/\n}\n<commit_msg>fixed V4L2 constructor.<commit_after>#include \"v4l2capture.h\"\n#include \"v4l2camera.h\"\n\n\nV4L2Capture::V4L2Capture( const int cameras )\n{\n std::string name = \"\/dev\/video\";\n for( int i = 0; i < cameras; i++ )\n {\n addCamera( name + std::to_string( i ) );\n }\n}\n\nV4L2Capture::~V4L2Capture()\n{\n}\n\nvoid V4L2Capture::addCamera( const std::string& a_fileName )\n{\n m_cameras.push_back( new V4L2Camera( a_fileName ) );\n m_acquisition.push_back( false );\n}\n\nbool V4L2Capture::isTerminated()\n{\n return m_terminate;\n}\n\nvoid V4L2Capture::start()\n{\n for( unsigned int i = 0; i < m_cameras.size(); i++ )\n {\n m_threads.push_back( new boost::thread( boost::bind( &V4L2Capture::acquisition_thread, this, i ) ) );\n }\n}\n\nvoid V4L2Capture::stop()\n{\n m_terminate = true;\n}\n\nvoid V4L2Capture::join()\n{\n for( unsigned int i = 0; i < m_threads.size(); i++ )\n {\n m_threads[i]->join();\n }\n}\n\n\nvoid V4L2Capture::receive( const cuttlefish_msgs::V4L2Control* msg )\n{\n const int camera = msg->camera_no();\n\n switch( msg->command() )\n {\n case cuttlefish_msgs::V4L2Control_CommandType_OPEN:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_CLOSE:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_START:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_STOP:\n break;\n case cuttlefish_msgs::V4L2Control_CommandType_TERMINATE:\n break;\n }\n}\n\n\nvoid V4L2Capture::acquisition_thread( const int camera_id )\n{\n V4L2Camera* input = m_cameras.at( camera_id );\n \/*\n input->stopCapture();\n sleep( 2 );\n\n int frame=0;\n input->init_mmap();\n input->readyCapture();\n\n barrier->wait();\n input->startCapture();\n\n image_t* image = data->localImage( id );\n image->info.width = settings::width;\n image->info.height = settings::height;\n image->info.Kb = 1.0;\n image->info.Kg = 1.0;\n image->info.Kr = 1.0;\n image->info.max_size = image->info.width * image->info.height * 2; \/\/ YUV = 2 bytes per pixel.\n image->data = new unsigned char[ image->info.max_size ];\n\n\n if( !( input->readyFrame() &&\n input->readFrame( image->data, image->info.size, image->info.timestamp )\n ) )\n {\n std::cerr << \"Unable to read the first frame.\" << std::endl;\n return;\n }\n\n std::cerr << \"Camera(\" << id << \") - frame size: \" << image->info.size << std::endl;\n\n bool ok = true;\n\n int accum_diff = 0; \/\/ only used by id == 0\n int accum_frames = 0; \/\/ only used by id == 0\n int accum_diff01 = 0; \/\/ only used by id == 0\n\n int default_exposure = 0;\n input->getAbsoluteExposure( default_exposure );\n\n while( true )\n {\n ok = input->readyFrame();\n\n if( !ok )\n {\n std::cerr << \"readyFrame failed.\" << std::endl;\n break;\n }\n input->readFrame( (unsigned char*) image->data, image->info.size, image->info.timestamp );\n input->getAbsoluteExposure( image->info.exposure_time );\n\n if( image->info.exposure_time != default_exposure )\n {\n input->setAbsoluteExposure( default_exposure );\n }\n\n frame++;\n\n image->info.frame_number = frame;\n\n barrier->wait();\n\n if( id == 0 ) \/\/ only one thread executes this code.\n {\n int diff = 0;\n struct timeval min = image->info.timestamp;\n struct timeval max = image->info.timestamp;\n\n for( unsigned int i = 0; i < data->localGroupSize(); i++ )\n {\n struct timeval tv = m_outputData->localImage( i )->info.timestamp;\n\n if( timevaldiff( &min, &tv ) > 0 )\n {\n min = tv;\n }\n if( timevaldiff( &max, &tv ) < 0 )\n {\n max = tv;\n }\n }\n diff = abs( timevaldiff( &max, &min ) );\n int diff01 = timevaldiff( &m_outputData->localImage( 0 )->info.timestamp, &m_outputData->localImage( 1 )->info.timestamp );\n accum_diff01 += diff01;\n\n accum_diff += diff;\n accum_frames++;\n\n if( diff < 2500 )\n {\n data->writeAndNotify();\n std::cerr << \".\" << std::flush;\n }\n else\n {\n std::cerr << \"\\n\" << \"frame \" << frame << \" dropped - time delta: \" << diff\/1000.0 << \" ms\" << std::endl;\n }\n if( accum_frames > 5 )\n {\n if( ( accum_diff \/ accum_frames ) > 10000 )\n {\n m_needSync = true;\n }\n else\n {\n \/\/int diff = accum_diff \/ ( accum_frames * 1000.0 ) + 0.5;\n\n if( accum_diff01 \/ accum_frames > 75 )\n {\n diff = 1;\n }\n else if( accum_diff01 \/ accum_frames < -75 )\n {\n diff = -1;\n }\n else\n {\n diff = 0;\n }\n if( diff != 0 )\n {\n input->setAbsoluteExposure( default_exposure + diff );\n int value;\n input->getAbsoluteExposure( value );\n std::cout << \"used exposure: \" << value << std::endl;\n accum_diff = 0;\n accum_frames = 0;\n accum_diff01 = 0;\n }\n }\n }\n }\n\n barrier->wait();\n if( m_needSync == true )\n {\n std::cerr << \"sync required. - doing sync.\" << std::endl;\n input->stopCapture();\n input->readyCapture();\n barrier->wait();\n input->startCapture();\n\n if( id == 0 )\n {\n *need_sync = false;\n accum_diff = 0;\n accum_frames = 0;\n accum_diff01 = 0;\n }\n }\n\n if( id == 0 && accum_frames >= 50 )\n {\n std::cerr << \"Avg: \" << accum_diff \/ accum_frames \/ 1000.0 << \" ms\" << std::endl;\n accum_frames = 0;\n accum_diff = 0;\n accum_diff01 = 0;\n }\n }\n input->stopCapture();\n *\/\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QEventLoop>\n#include <QTimer>\n\n#include \"connectiontester.h\"\n#include \"iceflowcontrol.h\"\n#include \"ice.h\"\n\nFlowAgent::FlowAgent():\n candidates_(nullptr),\n sessionID_(0)\n{\n}\n\nFlowAgent::~FlowAgent()\n{\n delete candidates_;\n}\n\nvoid FlowAgent::run() { }\n\nvoid FlowAgent::setCandidates(QList<ICEPair *> *candidates)\n{\n candidates_ = candidates;\n}\n\nvoid FlowAgent::setSessionID(uint32_t sessionID)\n{\n sessionID_ = sessionID;\n}\n\nvoid FlowAgent::nominationDone(ICEPair *rtp, ICEPair *rtcp)\n{\n if (nominated_mtx.try_lock())\n {\n nominated_rtp_ = rtp;\n nominated_rtcp_ = rtcp;\n }\n\n emit endNomination();\n}\n\nbool FlowAgent::waitForResponses(unsigned long timeout)\n{\n QTimer timer;\n QEventLoop loop;\n\n timer.setSingleShot(true);\n\n connect(this, &FlowAgent::endNomination, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(20000);\n loop.exec();\n\n return timer.isActive();\n}\n\nvoid FlowController::run()\n{\n Stun stun;\n\n \/\/ TODO how long should we sleep???\n for (volatile int i = 0; i < 10000000; ++i)\n ;\n\n if (candidates_ == nullptr || candidates_->size() == 0)\n {\n qDebug() << \"ERROR: invalid candidates, unable to perform ICE candidate negotiation!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n std::vector<std::unique_ptr<ConnectionTester>> workerThreads;\n\n for (int i = 0; i < candidates_->size(); i += 2)\n {\n workerThreads.push_back(std::make_unique<ConnectionTester>());\n\n connect(workerThreads.back().get(), &ConnectionTester::testingDone, this, &FlowAgent::nominationDone, Qt::DirectConnection);\n\n workerThreads.back()->setCandidatePair(candidates_->at(i), candidates_->at(i + 1));\n workerThreads.back()->isController(true);\n workerThreads.back()->start();\n }\n\n \/\/ we've spawned threads for each candidate, wait for responses at most 10 seconds\n if (!waitForResponses(10000))\n {\n qDebug() << \"Remote didn't respond to our request in time!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n \/\/ we got a response, suspend all threads and start nomination\n for (size_t i = 0; i < workerThreads.size(); ++i)\n {\n workerThreads[i]->quit();\n workerThreads[i]->wait();\n }\n\n if (!stun.sendNominationRequest(nominated_rtp_))\n {\n qDebug() << \"Failed to nominate RTP candidate!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n if (!stun.sendNominationRequest(nominated_rtcp_))\n {\n qDebug() << \"Failed to nominate RTCP candidate!\";\n emit ready(nominated_rtp_, nullptr, sessionID_);\n return;\n }\n\n nominated_rtp_->state = PAIR_NOMINATED;\n nominated_rtcp_->state = PAIR_NOMINATED;\n\n emit ready(nominated_rtp_, nominated_rtcp_, sessionID_);\n}\n\nvoid FlowControllee::run()\n{\n QTimer timer;\n QEventLoop loop;\n\n if (candidates_ == nullptr || candidates_->size() == 0)\n {\n qDebug() << \"ERROR: invalid candidates, unable to perform ICE candidate negotiation!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n std::vector<std::unique_ptr<ConnectionTester>> workerThreads;\n\n for (int i = 0; i < candidates_->size(); i += 2)\n {\n workerThreads.push_back(std::make_unique<ConnectionTester>());\n\n connect(workerThreads.back().get(), &ConnectionTester::testingDone, this, &FlowAgent::nominationDone, Qt::DirectConnection);\n\n workerThreads.back()->setCandidatePair(candidates_->at(i), candidates_->at(i + 1));\n workerThreads.back()->isController(false);\n workerThreads.back()->start();\n }\n\n \/\/ wait for nomination from remote, wait at most 20 seconds\n if (!waitForResponses(20000))\n {\n qDebug() << \"Nomination from remote was not received in time!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n \/\/ we got a nomination from remote, kill all threads and start the media transmission\n for (size_t i = 0; i < workerThreads.size(); ++i)\n {\n workerThreads[i]->quit();\n workerThreads[i]->wait();\n }\n\n emit ready(nominated_rtp_, nominated_rtcp_, sessionID_);\n}\n<commit_msg>Terminate threads before killing the FlowAgent<commit_after>#include <QEventLoop>\n#include <QTimer>\n\n#include \"connectiontester.h\"\n#include \"iceflowcontrol.h\"\n#include \"ice.h\"\n\nFlowAgent::FlowAgent():\n candidates_(nullptr),\n sessionID_(0)\n{\n}\n\nFlowAgent::~FlowAgent()\n{\n delete candidates_;\n}\n\nvoid FlowAgent::run() { }\n\nvoid FlowAgent::setCandidates(QList<ICEPair *> *candidates)\n{\n candidates_ = candidates;\n}\n\nvoid FlowAgent::setSessionID(uint32_t sessionID)\n{\n sessionID_ = sessionID;\n}\n\nvoid FlowAgent::nominationDone(ICEPair *rtp, ICEPair *rtcp)\n{\n if (nominated_mtx.try_lock())\n {\n nominated_rtp_ = rtp;\n nominated_rtcp_ = rtcp;\n }\n\n emit endNomination();\n}\n\nbool FlowAgent::waitForResponses(unsigned long timeout)\n{\n QTimer timer;\n QEventLoop loop;\n\n timer.setSingleShot(true);\n\n connect(this, &FlowAgent::endNomination, &loop, &QEventLoop::quit);\n connect(&timer, &QTimer::timeout, &loop, &QEventLoop::quit);\n\n timer.start(20000);\n loop.exec();\n\n return timer.isActive();\n}\n\nvoid FlowController::run()\n{\n Stun stun;\n\n \/\/ TODO how long should we sleep???\n \/* for (volatile int i = 0; i < 10000000; ++i) *\/\n \/* ; *\/\n\n if (candidates_ == nullptr || candidates_->size() == 0)\n {\n qDebug() << \"ERROR: invalid candidates, unable to perform ICE candidate negotiation!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n std::vector<std::unique_ptr<ConnectionTester>> workerThreads;\n\n for (int i = 0; i < candidates_->size(); i += 2)\n {\n workerThreads.push_back(std::make_unique<ConnectionTester>());\n\n connect(workerThreads.back().get(), &ConnectionTester::testingDone, this, &FlowAgent::nominationDone, Qt::DirectConnection);\n\n workerThreads.back()->setCandidatePair(candidates_->at(i), candidates_->at(i + 1));\n workerThreads.back()->isController(true);\n workerThreads.back()->start();\n }\n\n bool nominationSucceeded = waitForResponses(10000);\n\n \/\/ we got a response, suspend all threads and start nomination\n for (size_t i = 0; i < workerThreads.size(); ++i)\n {\n workerThreads[i]->quit();\n workerThreads[i]->wait();\n }\n\n \/\/ we've spawned threads for each candidate, wait for responses at most 10 seconds\n if (!nominationSucceeded)\n {\n qDebug() << \"Remote didn't respond to our request in time!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n if (!stun.sendNominationRequest(nominated_rtp_))\n {\n qDebug() << \"Failed to nominate RTP candidate!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n if (!stun.sendNominationRequest(nominated_rtcp_))\n {\n qDebug() << \"Failed to nominate RTCP candidate!\";\n emit ready(nominated_rtp_, nullptr, sessionID_);\n return;\n }\n\n nominated_rtp_->state = PAIR_NOMINATED;\n nominated_rtcp_->state = PAIR_NOMINATED;\n\n emit ready(nominated_rtp_, nominated_rtcp_, sessionID_);\n}\n\nvoid FlowControllee::run()\n{\n QTimer timer;\n QEventLoop loop;\n\n if (candidates_ == nullptr || candidates_->size() == 0)\n {\n qDebug() << \"ERROR: invalid candidates, unable to perform ICE candidate negotiation!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n std::vector<std::unique_ptr<ConnectionTester>> workerThreads;\n\n for (int i = 0; i < candidates_->size(); i += 2)\n {\n workerThreads.push_back(std::make_unique<ConnectionTester>());\n\n connect(workerThreads.back().get(), &ConnectionTester::testingDone, this, &FlowAgent::nominationDone, Qt::DirectConnection);\n\n workerThreads.back()->setCandidatePair(candidates_->at(i), candidates_->at(i + 1));\n workerThreads.back()->isController(false);\n workerThreads.back()->start();\n }\n\n\n bool nominationSucceeded = waitForResponses(20000);\n\n \/\/ kill all threads, regardless of whether nomination succeeded or not\n for (size_t i = 0; i < workerThreads.size(); ++i)\n {\n workerThreads[i]->quit();\n workerThreads[i]->wait();\n }\n\n \/\/ wait for nomination from remote, wait at most 20 seconds\n if (!nominationSucceeded)\n {\n qDebug() << \"Nomination from remote was not received in time!\";\n emit ready(nullptr, nullptr, sessionID_);\n return;\n }\n\n \/\/ media transmission can be started\n emit ready(nominated_rtp_, nominated_rtcp_, sessionID_);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Core\/Utils\/Observable.hpp>\n#include <catch2\/catch.hpp>\n\nusing Ra::Core::Utils::Observable;\n\nclass ObservableTest : public Observable<>\n{};\n\nclass ObservableTest2 : public Observable<int>\n{};\n\nclass A\n{\n public:\n void f() { m_a++; }\n void f2( int a ) { m_a = a; }\n static void g() { m_b++; }\n static void g2( int b ) { m_b = b; }\n\n int m_a {0};\n static int m_b;\n};\n\nint A::m_b = 0;\n\nTEST_CASE( \"Core\/Utils\/Observable\", \"[Core][Core\/Utils][Observable]\" ) {\n ObservableTest test;\n ObservableTest2 test2;\n\n A a;\n int c = 0;\n A::m_b = 0;\n\n using Observer = std::function<void( void )>;\n using Observer2 = std::function<void( int )>;\n\n auto bf = std::bind( &A::f, &a );\n\n Observer obf = bf;\n auto& observerTarget = obf.target_type();\n \/\/ \"Type failed.\"\n REQUIRE( obf.target_type() == observerTarget );\n\n auto gid = test.attach( A::g );\n test.attach( bf );\n test.attach( [&c]() { c++; } );\n test.notify();\n\n REQUIRE( c == 1 );\n REQUIRE( a.m_a == 1 );\n REQUIRE( A::m_b == 1 );\n\n test.detach( gid );\n test.notify();\n\n REQUIRE( c == 2 );\n REQUIRE( a.m_a == 2 );\n \/\/ Test detach\n REQUIRE( A::m_b == 1 );\n\n test.attach( A::g );\n test.attach( A::g );\n test.attach( bf );\n test.attach( [&c]() { c++; } );\n test.notify();\n\n REQUIRE( c == 4 );\n REQUIRE( a.m_a == 4 );\n REQUIRE( A::m_b == 3 );\n\n test.detachAll();\n test.notify();\n\n \/\/ Test detach\n REQUIRE( c == 4 );\n REQUIRE( a.m_a == 4 );\n REQUIRE( A::m_b == 3 );\n\n test2.attachMember( &a, &A::f2 );\n test2.attach( &A::g2 );\n test2.attach( [&c]( int pc ) { c = pc; } );\n\n test2.notify( 5 );\n\n REQUIRE( c == 5 );\n REQUIRE( a.m_a == 5 );\n REQUIRE( A::m_b == 5 );\n\n test2.notify( 6 );\n\n REQUIRE( c == 6 );\n REQUIRE( a.m_a == 6 );\n REQUIRE( A::m_b == 6 );\n\n ObservableTest2 test2copy;\n test2.copyObserversTo( test2copy );\n\n test2.detachAll();\n test2.notify( 7 );\n\n REQUIRE( c == 6 );\n REQUIRE( a.m_a == 6 );\n REQUIRE( A::m_b == 6 );\n\n test2copy.notify( 7 );\n\n REQUIRE( c == 7 );\n REQUIRE( a.m_a == 7 );\n REQUIRE( A::m_b == 7 );\n}\n<commit_msg>[tests] comment and todo.<commit_after>#include <Core\/Utils\/Observable.hpp>\n#include <catch2\/catch.hpp>\n\nusing Ra::Core::Utils::Observable;\n\nclass ObservableTest : public Observable<>\n{};\n\nclass ObservableTest2 : public Observable<int>\n{};\n\nclass A\n{\n public:\n void f() { m_a++; }\n void f2( int a ) { m_a = a; }\n static void g() { m_b++; }\n static void g2( int b ) { m_b = b; }\n\n int m_a {0};\n static int m_b;\n};\n\nint A::m_b = 0;\n\nTEST_CASE( \"Core\/Utils\/Observable\", \"[Core][Core\/Utils][Observable]\" ) {\n ObservableTest test;\n ObservableTest2 test2;\n\n A a;\n int c = 0;\n A::m_b = 0;\n\n using Observer = std::function<void( void )>;\n \/\/\/\\todo add more tests with\n \/\/ using Observer2 = std::function<void( int )>;\n\n auto bf = std::bind( &A::f, &a );\n\n Observer obf = bf;\n auto& observerTarget = obf.target_type();\n \/\/ \"Type failed.\"\n REQUIRE( obf.target_type() == observerTarget );\n\n auto gid = test.attach( A::g );\n test.attach( bf );\n test.attach( [&c]() { c++; } );\n test.notify();\n\n REQUIRE( c == 1 );\n REQUIRE( a.m_a == 1 );\n REQUIRE( A::m_b == 1 );\n\n test.detach( gid );\n test.notify();\n\n REQUIRE( c == 2 );\n REQUIRE( a.m_a == 2 );\n \/\/ Test detach\n REQUIRE( A::m_b == 1 );\n\n test.attach( A::g );\n test.attach( A::g );\n test.attach( bf );\n test.attach( [&c]() { c++; } );\n test.notify();\n\n REQUIRE( c == 4 );\n REQUIRE( a.m_a == 4 );\n REQUIRE( A::m_b == 3 );\n\n test.detachAll();\n test.notify();\n\n \/\/ Test detach\n REQUIRE( c == 4 );\n REQUIRE( a.m_a == 4 );\n REQUIRE( A::m_b == 3 );\n\n test2.attachMember( &a, &A::f2 );\n test2.attach( &A::g2 );\n test2.attach( [&c]( int pc ) { c = pc; } );\n\n test2.notify( 5 );\n\n REQUIRE( c == 5 );\n REQUIRE( a.m_a == 5 );\n REQUIRE( A::m_b == 5 );\n\n test2.notify( 6 );\n\n REQUIRE( c == 6 );\n REQUIRE( a.m_a == 6 );\n REQUIRE( A::m_b == 6 );\n\n ObservableTest2 test2copy;\n test2.copyObserversTo( test2copy );\n\n test2.detachAll();\n test2.notify( 7 );\n\n REQUIRE( c == 6 );\n REQUIRE( a.m_a == 6 );\n REQUIRE( A::m_b == 6 );\n\n test2copy.notify( 7 );\n\n REQUIRE( c == 7 );\n REQUIRE( a.m_a == 7 );\n REQUIRE( A::m_b == 7 );\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"index\/LodRange.hpp\"\n#include \"formats\/shape\/ShapeParser.hpp\"\n#include \"index\/GeoStore.hpp\"\n#include \"index\/InMemoryElementStore.hpp\"\n#include \"index\/PersistentElementStore.hpp\"\n#include \"index\/ShapeDataVisitor.hpp\"\n\n#include <stdexcept>\n#include <unordered_map>\n\nusing namespace utymap::entities;\nusing namespace utymap::formats;\nusing namespace utymap::index;\nusing namespace utymap::mapcss;\n\nclass GeoStore::GeoStoreImpl\n{\npublic:\n\n GeoStoreImpl(StringTable& stringTable) :\n stringTable_(stringTable)\n {\n }\n\n void registerStore(const std::string& storeKey, ElementStore& store)\n {\n storeMap_[storeKey] = &store;\n }\n\n void add(const std::string& storeKey, const Element& element, const LodRange& range, const StyleProvider& styleProvider)\n {\n }\n\n void add(const std::string& storeKey, const std::string& path, const LodRange& range, const StyleProvider& styleProvider)\n {\n ElementStore* elementStorePtr = storeMap_[storeKey];\n switch (getFormatTypeFromPath(path))\n {\n case FormatType::Shape:\n {\n ShapeDataVisitor shpVisitor(*elementStorePtr, styleProvider, stringTable_, range);\n utymap::formats::ShapeParser<ShapeDataVisitor> parser;\n parser.parse(path, shpVisitor);\n break;\n }\n default:\n throw std::domain_error(\"Not implemented.\");\n }\n }\n\n void search(const QuadKey& quadKey, const utymap::mapcss::StyleProvider& styleProvider, ElementVisitor& visitor)\n {\n for (const auto& pair : storeMap_) {\n pair.second->search(quadKey, styleProvider, visitor);\n }\n }\n\n void search(const GeoCoordinate& coordinate, double radius, const StyleProvider& styleProvider, ElementVisitor& visitor)\n {\n throw std::domain_error(\"Not implemented\");\n }\n\nprivate:\n StringTable& stringTable_;\n std::unordered_map<std::string, ElementStore*> storeMap_;\n\n FormatType getFormatTypeFromPath(const std::string& path)\n {\n \/\/ TODO\n return FormatType::Shape;\n }\n};\n\nGeoStore::GeoStore(StringTable& stringTable) :\n pimpl_(std::unique_ptr<GeoStore::GeoStoreImpl>(new GeoStore::GeoStoreImpl(stringTable)))\n{\n}\n\nGeoStore::~GeoStore()\n{\n}\n\nvoid utymap::index::GeoStore::registerStore(const std::string& storeKey, ElementStore& store)\n{\n pimpl_->registerStore(storeKey, store);\n}\n\nvoid utymap::index::GeoStore::add(const std::string& storeKey, const Element& element, const LodRange& range, const StyleProvider& styleProvider)\n{\n pimpl_->add(storeKey, element, range, styleProvider);\n}\n\nvoid utymap::index::GeoStore::add(const std::string& storeKey, const std::string& path, const LodRange& range, const StyleProvider& styleProvider)\n{\n pimpl_->add(storeKey, path, range, styleProvider);\n}\n\nvoid utymap::index::GeoStore::search(const QuadKey& quadKey, const utymap::mapcss::StyleProvider& styleProvider, ElementVisitor& visitor)\n{\n pimpl_->search(quadKey, styleProvider, visitor);\n}\n\nvoid utymap::index::GeoStore::search(const GeoCoordinate& coordinate, double radius, const StyleProvider& styleProvider, ElementVisitor& visitor)\n{\n pimpl_->search(coordinate, radius, styleProvider, visitor);\n}\n<commit_msg>index: do not visit the same element twice<commit_after>#include \"entities\/Element.hpp\"\n#include \"index\/LodRange.hpp\"\n#include \"formats\/shape\/ShapeParser.hpp\"\n#include \"index\/GeoStore.hpp\"\n#include \"index\/InMemoryElementStore.hpp\"\n#include \"index\/PersistentElementStore.hpp\"\n#include \"index\/ShapeDataVisitor.hpp\"\n\n#include <set>\n#include <stdexcept>\n#include <cstdint>\n#include <unordered_map>\n\nusing namespace utymap::entities;\nusing namespace utymap::formats;\nusing namespace utymap::index;\nusing namespace utymap::mapcss;\n\nclass GeoStore::GeoStoreImpl\n{\n \/\/ Prevents to visit element twice if it exists in multiply stores.\n class FilterElementVisitor : public ElementVisitor\n {\n public:\n FilterElementVisitor(ElementVisitor& visitor) : visitor_(visitor)\n {\n }\n\n void visitNode(const Node& node) { visitIfNecessary(node); }\n\n void visitWay(const Way& way) { visitIfNecessary(way); }\n\n void visitArea(const Area& area) { visitIfNecessary(area); }\n\n void visitRelation(const Relation& relation) { visitIfNecessary(relation); }\n\n private:\n\n inline bool visitIfNecessary(const Element& element)\n { \n if (element.id == 0 || ids_.find(element.id) == ids_.end())\n {\n element.accept(visitor_);\n ids_.insert(element.id);\n }\n }\n\n ElementVisitor& visitor_;\n std::set<std::uint64_t> ids_;\n };\n\npublic:\n\n GeoStoreImpl(StringTable& stringTable) :\n stringTable_(stringTable)\n {\n }\n\n void registerStore(const std::string& storeKey, ElementStore& store)\n {\n storeMap_[storeKey] = &store;\n }\n\n void add(const std::string& storeKey, const Element& element, const LodRange& range, const StyleProvider& styleProvider)\n {\n }\n\n void add(const std::string& storeKey, const std::string& path, const LodRange& range, const StyleProvider& styleProvider)\n {\n ElementStore* elementStorePtr = storeMap_[storeKey];\n switch (getFormatTypeFromPath(path))\n {\n case FormatType::Shape:\n {\n ShapeDataVisitor shpVisitor(*elementStorePtr, styleProvider, stringTable_, range);\n utymap::formats::ShapeParser<ShapeDataVisitor> parser;\n parser.parse(path, shpVisitor);\n break;\n }\n default:\n throw std::domain_error(\"Not implemented.\");\n }\n }\n\n void search(const QuadKey& quadKey, const utymap::mapcss::StyleProvider& styleProvider, ElementVisitor& visitor)\n {\n FilterElementVisitor filter(visitor);\n for (const auto& pair : storeMap_) {\n pair.second->search(quadKey, styleProvider, filter);\n }\n }\n\n void search(const GeoCoordinate& coordinate, double radius, const StyleProvider& styleProvider, ElementVisitor& visitor)\n {\n throw std::domain_error(\"Not implemented\");\n }\n\nprivate:\n StringTable& stringTable_;\n std::unordered_map<std::string, ElementStore*> storeMap_;\n\n FormatType getFormatTypeFromPath(const std::string& path)\n {\n \/\/ TODO\n return FormatType::Shape;\n }\n};\n\nGeoStore::GeoStore(StringTable& stringTable) :\n pimpl_(std::unique_ptr<GeoStore::GeoStoreImpl>(new GeoStore::GeoStoreImpl(stringTable)))\n{\n}\n\nGeoStore::~GeoStore()\n{\n}\n\nvoid utymap::index::GeoStore::registerStore(const std::string& storeKey, ElementStore& store)\n{\n pimpl_->registerStore(storeKey, store);\n}\n\nvoid utymap::index::GeoStore::add(const std::string& storeKey, const Element& element, const LodRange& range, const StyleProvider& styleProvider)\n{\n pimpl_->add(storeKey, element, range, styleProvider);\n}\n\nvoid utymap::index::GeoStore::add(const std::string& storeKey, const std::string& path, const LodRange& range, const StyleProvider& styleProvider)\n{\n pimpl_->add(storeKey, path, range, styleProvider);\n}\n\nvoid utymap::index::GeoStore::search(const QuadKey& quadKey, const utymap::mapcss::StyleProvider& styleProvider, ElementVisitor& visitor)\n{\n pimpl_->search(quadKey, styleProvider, visitor);\n}\n\nvoid utymap::index::GeoStore::search(const GeoCoordinate& coordinate, double radius, const StyleProvider& styleProvider, ElementVisitor& visitor)\n{\n pimpl_->search(coordinate, radius, styleProvider, visitor);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n This file is part of Deformable Shape Tracking (DEST).\n \n Copyright Christoph Heindl 2015\n \n Deformable Shape Tracking is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n \n Deformable Shape Tracking is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with Deformable Shape Tracking. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <dest\/io\/database_io.h>\n#include <dest\/util\/log.h>\n#include <dest\/util\/draw.h>\n#include <dest\/util\/convert.h>\n#include <dest\/util\/glob.h>\n#include <dest\/io\/rect_io.h>\n#include <opencv2\/opencv.hpp>\n#include <iomanip>\n#include <fstream>\n\nnamespace dest {\n namespace io {\n \n ImportParameters::ImportParameters() {\n maxImageSideLength = std::numeric_limits<int>::max();\n generateVerticallyMirrored = false;\n }\n\n bool importDatabase(const std::string & directory, const std::string &rectangleFile, std::vector<core::Image>& images, std::vector<core::Shape>& shapes, std::vector<core::Rect>& rects, const ImportParameters & opts)\n {\n const bool isIMM = util::findFilesInDir(directory, \"asf\", true).size() > 0;\n const bool isIBUG = util::findFilesInDir(directory, \"pts\", true).size() > 0;\n\n if (isIMM)\n return importIMMFaceDatabase(directory, rectangleFile, images, shapes, rects, opts);\n else if (isIBUG)\n return importIBugAnnotatedFaceDatabase(directory, rectangleFile, images, shapes, rects, opts);\n else {\n DEST_LOG(\"Unknown database format.\" << std::endl);\n return false;\n }\n }\n \n bool imageNeedsScaling(cv::Size s, const ImportParameters &p, float &factor) {\n int maxLen = std::max<int>(s.width, s.height);\n if (maxLen > p.maxImageSideLength) {\n factor = static_cast<float>(p.maxImageSideLength) \/ static_cast<float>(maxLen);\n return true;\n } else {\n return false;\n }\n }\n \n void scaleImageShapeAndRect(cv::Mat &img, core::Shape &s, core::Rect &r, float factor) {\n cv::resize(img, img, cv::Size(0,0), factor, factor, CV_INTER_CUBIC);\n s *= factor;\n r *= factor;\n }\n \n void mirrorImageShapeAndRectVertically(const cv::Mat &img, const core::Shape &s, const core::Rect &r, cv::Mat &dstImage, core::Shape &dstShape, core::Rect &dstRect) {\n cv::flip(img, dstImage, 1);\n dstShape.resize(2, s.cols());\n for (core::Shape::Index i = 0; i < s.cols(); ++i) {\n dstShape(0, i) = static_cast<float>(img.cols - 1) - s(0, i);\n dstShape(1, i) = s(1, i);\n }\n\n for (core::Rect::Index i = 0; i < r.cols(); ++i) {\n dstRect(0, i) = static_cast<float>(img.cols - 1) - r(0, i);\n dstRect(1, i) = r(1, i);\n }\n }\n \n bool parseAsfFile(const std::string& fileName, core::Shape &s) {\n \n int landmarkCount = 0;\n \n std::ifstream file(fileName);\n \n std::string line;\n while (std::getline(file, line)) {\n if (line.size() > 0 && line[0] != '#') {\n if (line.find(\".jpg\") != std::string::npos) {\n \/\/ ignored: file name of jpg image\n }\n else if (line.size() < 10) {\n int nbPoints = atol(line.c_str());\n \n s.resize(2, nbPoints);\n s.fill(0);\n }\n else {\n std::stringstream stream(line);\n \n std::string path;\n std::string type;\n float x, y;\n \n stream >> path;\n stream >> type;\n stream >> x;\n stream >> y;\n \n s(0, landmarkCount) = x;\n s(1, landmarkCount) = y;\n \n ++landmarkCount;\n }\n }\n }\n \n return s.rows() > 0 && s.cols() > 0;\n }\n \n bool importIMMFaceDatabase(const std::string &directory, const std::string &rectangleFile, std::vector<core::Image> &images, std::vector<core::Shape> &shapes, std::vector<core::Rect>& rects, const ImportParameters &opts) {\n \n std::vector<std::string> paths = util::findFilesInDir(directory, \"asf\", true);\n DEST_LOG(\"Loading IMM database. Found \" << paths.size() << \" canditate entries.\" << std::endl);\n\n std::vector<core::Rect> loadedRects;\n io::importRectangles(rectangleFile, loadedRects);\n\n if (loadedRects.empty()) {\n DEST_LOG(\"No rectangles found, using tight bounds.\" << std::endl);\n } else {\n if (paths.size() != loadedRects.size()) {\n DEST_LOG(\"Mismatch between number of shapes in database and rectangles found.\" << std::endl);\n return false;\n }\n }\n \n size_t initialSize = images.size();\n \n for (size_t i = 0; i < paths.size(); ++i) {\n const std::string fileNameImg = paths[i] + \".jpg\";\n const std::string fileNamePts = paths[i] + \".asf\";\n \n core::Shape s;\n core::Rect r;\n bool asfOk = parseAsfFile(fileNamePts, s);\n cv::Mat cvImg = cv::imread(fileNameImg, cv::IMREAD_GRAYSCALE);\n \n if(asfOk && !cvImg.empty()) {\n \n \/\/ Scale to image dimensions\n s.row(0) *= static_cast<float>(cvImg.cols);\n s.row(1) *= static_cast<float>(cvImg.rows);\n\n if (loadedRects.empty()) {\n r = core::shapeBounds(s);\n } else {\n r = loadedRects[i];\n }\n \n float f;\n if (imageNeedsScaling(cvImg.size(), opts, f)) {\n scaleImageShapeAndRect(cvImg, s, r, f);\n }\n \n core::Image img;\n util::toDest(cvImg, img);\n \n images.push_back(img);\n shapes.push_back(s);\n rects.push_back(r);\n \n if (opts.generateVerticallyMirrored) {\n cv::Mat cvFlipped;\n core::Shape shapeFlipped;\n core::Rect rectFlipped;\n mirrorImageShapeAndRectVertically(cvImg, s, r, cvFlipped, shapeFlipped, rectFlipped);\n \n core::Image imgFlipped;\n util::toDest(cvFlipped, imgFlipped);\n \n images.push_back(imgFlipped);\n shapes.push_back(shapeFlipped);\n rects.push_back(rectFlipped);\n }\n }\n }\n \n DEST_LOG(\"Successfully loaded \" << (shapes.size() - initialSize) << \" entries from database.\" << std::endl);\n return shapes.size() > 0;\n }\n \n \n bool parsePtsFile(const std::string& fileName, core::Shape &s) {\n \n std::ifstream file(fileName);\n \n std::string line;\n std::getline(file, line); \/\/ Version\n std::getline(file, line); \/\/ NPoints\n \n int numPoints;\n std::stringstream str(line);\n str >> line >> numPoints;\n \n std::getline(file, line); \/\/ {\n \n s.resize(2, numPoints);\n s.fill(0);\n \n for (int i = 0; i < numPoints; ++i) {\n if (!std::getline(file, line)) {\n DEST_LOG(\"Failed to read points.\" << std::endl);\n return false;\n }\n str = std::stringstream(line);\n \n float x, y;\n str >> x >> y;\n \n s(0, i) = x - 1.f; \/\/ Matlab to C++ offset\n s(1, i) = y - 1.f;\n \n }\n \n return true;\n \n }\n \n bool importIBugAnnotatedFaceDatabase(const std::string &directory, const std::string &rectangleFile, std::vector<core::Image> &images, std::vector<core::Shape> &shapes, std::vector<core::Rect> &rects, const ImportParameters &opts) {\n \n std::vector<std::string> paths = util::findFilesInDir(directory, \"pts\", true);\n DEST_LOG(\"Loading ibug database. Found \" << paths.size() << \" canditate entries.\" << std::endl);\n\n std::vector<core::Rect> loadedRects;\n io::importRectangles(rectangleFile, loadedRects);\n\n if (loadedRects.empty()) {\n DEST_LOG(\"No rectangles found, using tight bounds.\" << std::endl);\n }\n else {\n if (paths.size() != loadedRects.size()) {\n DEST_LOG(\"Mismatch between number of shapes in database and rectangles found.\" << std::endl);\n return false;\n }\n }\n \n size_t initialSize = images.size();\n \n for (size_t i = 0; i < paths.size(); ++i) {\n const std::string fileNameImg = paths[i] + \".jpg\";\n const std::string fileNamePts = paths[i] + \".pts\";\n \n core::Shape s;\n core::Rect r;\n bool ptsOk = parsePtsFile(fileNamePts, s);\n cv::Mat cvImg = cv::imread(fileNameImg, cv::IMREAD_GRAYSCALE);\n \n if(ptsOk && !cvImg.empty()) {\n\n if (loadedRects.empty()) {\n r = core::shapeBounds(s);\n }\n else {\n r = loadedRects[i];\n }\n \n float f;\n if (imageNeedsScaling(cvImg.size(), opts, f)) {\n scaleImageShapeAndRect(cvImg, s, r, f);\n }\n \n core::Image img;\n util::toDest(cvImg, img);\n \n images.push_back(img);\n shapes.push_back(s);\n rects.push_back(r);\n \n \n if (opts.generateVerticallyMirrored) {\n cv::Mat cvFlipped;\n core::Shape shapeFlipped;\n core::Rect rectFlipped;\n mirrorImageShapeAndRectVertically(cvImg, s, r, cvFlipped, shapeFlipped, rectFlipped);\n \n core::Image imgFlipped;\n util::toDest(cvFlipped, imgFlipped);\n \n images.push_back(imgFlipped);\n shapes.push_back(shapeFlipped);\n shapes.push_back(rectFlipped);\n }\n }\n }\n \n DEST_LOG(\"Successfully loaded \" << (shapes.size() - initialSize) << \" entries from database.\" << std::endl);\n return (shapes.size() - initialSize) > 0;\n\n }\n \n }\n}<commit_msg>Verbosity<commit_after>\/**\n This file is part of Deformable Shape Tracking (DEST).\n \n Copyright Christoph Heindl 2015\n \n Deformable Shape Tracking is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n \n Deformable Shape Tracking is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with Deformable Shape Tracking. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <dest\/io\/database_io.h>\n#include <dest\/util\/log.h>\n#include <dest\/util\/draw.h>\n#include <dest\/util\/convert.h>\n#include <dest\/util\/glob.h>\n#include <dest\/io\/rect_io.h>\n#include <opencv2\/opencv.hpp>\n#include <iomanip>\n#include <fstream>\n\nnamespace dest {\n namespace io {\n \n ImportParameters::ImportParameters() {\n maxImageSideLength = std::numeric_limits<int>::max();\n generateVerticallyMirrored = false;\n }\n\n bool importDatabase(const std::string & directory, const std::string &rectangleFile, std::vector<core::Image>& images, std::vector<core::Shape>& shapes, std::vector<core::Rect>& rects, const ImportParameters & opts)\n {\n const bool isIMM = util::findFilesInDir(directory, \"asf\", true).size() > 0;\n const bool isIBUG = util::findFilesInDir(directory, \"pts\", true).size() > 0;\n\n if (isIMM)\n return importIMMFaceDatabase(directory, rectangleFile, images, shapes, rects, opts);\n else if (isIBUG)\n return importIBugAnnotatedFaceDatabase(directory, rectangleFile, images, shapes, rects, opts);\n else {\n DEST_LOG(\"Unknown database format.\" << std::endl);\n return false;\n }\n }\n \n bool imageNeedsScaling(cv::Size s, const ImportParameters &p, float &factor) {\n int maxLen = std::max<int>(s.width, s.height);\n if (maxLen > p.maxImageSideLength) {\n factor = static_cast<float>(p.maxImageSideLength) \/ static_cast<float>(maxLen);\n return true;\n } else {\n return false;\n }\n }\n \n void scaleImageShapeAndRect(cv::Mat &img, core::Shape &s, core::Rect &r, float factor) {\n cv::resize(img, img, cv::Size(0,0), factor, factor, CV_INTER_CUBIC);\n s *= factor;\n r *= factor;\n }\n \n void mirrorImageShapeAndRectVertically(const cv::Mat &img, const core::Shape &s, const core::Rect &r, cv::Mat &dstImage, core::Shape &dstShape, core::Rect &dstRect) {\n cv::flip(img, dstImage, 1);\n dstShape.resize(2, s.cols());\n for (core::Shape::Index i = 0; i < s.cols(); ++i) {\n dstShape(0, i) = static_cast<float>(img.cols - 1) - s(0, i);\n dstShape(1, i) = s(1, i);\n }\n\n for (core::Rect::Index i = 0; i < r.cols(); ++i) {\n dstRect(0, i) = static_cast<float>(img.cols - 1) - r(0, i);\n dstRect(1, i) = r(1, i);\n }\n }\n \n bool parseAsfFile(const std::string& fileName, core::Shape &s) {\n \n int landmarkCount = 0;\n \n std::ifstream file(fileName);\n \n std::string line;\n while (std::getline(file, line)) {\n if (line.size() > 0 && line[0] != '#') {\n if (line.find(\".jpg\") != std::string::npos) {\n \/\/ ignored: file name of jpg image\n }\n else if (line.size() < 10) {\n int nbPoints = atol(line.c_str());\n \n s.resize(2, nbPoints);\n s.fill(0);\n }\n else {\n std::stringstream stream(line);\n \n std::string path;\n std::string type;\n float x, y;\n \n stream >> path;\n stream >> type;\n stream >> x;\n stream >> y;\n \n s(0, landmarkCount) = x;\n s(1, landmarkCount) = y;\n \n ++landmarkCount;\n }\n }\n }\n \n return s.rows() > 0 && s.cols() > 0;\n }\n \n bool importIMMFaceDatabase(const std::string &directory, const std::string &rectangleFile, std::vector<core::Image> &images, std::vector<core::Shape> &shapes, std::vector<core::Rect>& rects, const ImportParameters &opts) {\n \n std::vector<std::string> paths = util::findFilesInDir(directory, \"asf\", true);\n DEST_LOG(\"Loading IMM database. Found \" << paths.size() << \" canditate entries.\" << std::endl);\n\n std::vector<core::Rect> loadedRects;\n io::importRectangles(rectangleFile, loadedRects);\n\n if (loadedRects.empty()) {\n DEST_LOG(\"No rectangles found, using tight axis aligned bounds.\" << std::endl);\n } else {\n if (paths.size() != loadedRects.size()) {\n DEST_LOG(\"Mismatch between number of shapes in database and rectangles found.\" << std::endl);\n return false;\n }\n }\n \n size_t initialSize = images.size();\n \n for (size_t i = 0; i < paths.size(); ++i) {\n const std::string fileNameImg = paths[i] + \".jpg\";\n const std::string fileNamePts = paths[i] + \".asf\";\n \n core::Shape s;\n core::Rect r;\n bool asfOk = parseAsfFile(fileNamePts, s);\n cv::Mat cvImg = cv::imread(fileNameImg, cv::IMREAD_GRAYSCALE);\n \n if(asfOk && !cvImg.empty()) {\n \n \/\/ Scale to image dimensions\n s.row(0) *= static_cast<float>(cvImg.cols);\n s.row(1) *= static_cast<float>(cvImg.rows);\n\n if (loadedRects.empty()) {\n r = core::shapeBounds(s);\n } else {\n r = loadedRects[i];\n }\n \n float f;\n if (imageNeedsScaling(cvImg.size(), opts, f)) {\n scaleImageShapeAndRect(cvImg, s, r, f);\n }\n \n core::Image img;\n util::toDest(cvImg, img);\n \n images.push_back(img);\n shapes.push_back(s);\n rects.push_back(r);\n \n if (opts.generateVerticallyMirrored) {\n cv::Mat cvFlipped;\n core::Shape shapeFlipped;\n core::Rect rectFlipped;\n mirrorImageShapeAndRectVertically(cvImg, s, r, cvFlipped, shapeFlipped, rectFlipped);\n \n core::Image imgFlipped;\n util::toDest(cvFlipped, imgFlipped);\n \n images.push_back(imgFlipped);\n shapes.push_back(shapeFlipped);\n rects.push_back(rectFlipped);\n }\n }\n }\n \n DEST_LOG(\"Successfully loaded \" << (shapes.size() - initialSize) << \" entries from database.\" << std::endl);\n return shapes.size() > 0;\n }\n \n \n bool parsePtsFile(const std::string& fileName, core::Shape &s) {\n \n std::ifstream file(fileName);\n \n std::string line;\n std::getline(file, line); \/\/ Version\n std::getline(file, line); \/\/ NPoints\n \n int numPoints;\n std::stringstream str(line);\n str >> line >> numPoints;\n \n std::getline(file, line); \/\/ {\n \n s.resize(2, numPoints);\n s.fill(0);\n \n for (int i = 0; i < numPoints; ++i) {\n if (!std::getline(file, line)) {\n DEST_LOG(\"Failed to read points.\" << std::endl);\n return false;\n }\n str = std::stringstream(line);\n \n float x, y;\n str >> x >> y;\n \n s(0, i) = x - 1.f; \/\/ Matlab to C++ offset\n s(1, i) = y - 1.f;\n \n }\n \n return true;\n \n }\n \n bool importIBugAnnotatedFaceDatabase(const std::string &directory, const std::string &rectangleFile, std::vector<core::Image> &images, std::vector<core::Shape> &shapes, std::vector<core::Rect> &rects, const ImportParameters &opts) {\n \n std::vector<std::string> paths = util::findFilesInDir(directory, \"pts\", true);\n DEST_LOG(\"Loading ibug database. Found \" << paths.size() << \" canditate entries.\" << std::endl);\n\n std::vector<core::Rect> loadedRects;\n io::importRectangles(rectangleFile, loadedRects);\n\n if (loadedRects.empty()) {\n DEST_LOG(\"No rectangles found, using tight axis aligned bounds.\" << std::endl);\n }\n else {\n if (paths.size() != loadedRects.size()) {\n DEST_LOG(\"Mismatch between number of shapes in database and rectangles found.\" << std::endl);\n return false;\n }\n }\n \n size_t initialSize = images.size();\n \n for (size_t i = 0; i < paths.size(); ++i) {\n const std::string fileNameImg = paths[i] + \".jpg\";\n const std::string fileNamePts = paths[i] + \".pts\";\n \n core::Shape s;\n core::Rect r;\n bool ptsOk = parsePtsFile(fileNamePts, s);\n cv::Mat cvImg = cv::imread(fileNameImg, cv::IMREAD_GRAYSCALE);\n \n if(ptsOk && !cvImg.empty()) {\n\n if (loadedRects.empty()) {\n r = core::shapeBounds(s);\n }\n else {\n r = loadedRects[i];\n }\n \n float f;\n if (imageNeedsScaling(cvImg.size(), opts, f)) {\n scaleImageShapeAndRect(cvImg, s, r, f);\n }\n \n core::Image img;\n util::toDest(cvImg, img);\n \n images.push_back(img);\n shapes.push_back(s);\n rects.push_back(r);\n \n \n if (opts.generateVerticallyMirrored) {\n cv::Mat cvFlipped;\n core::Shape shapeFlipped;\n core::Rect rectFlipped;\n mirrorImageShapeAndRectVertically(cvImg, s, r, cvFlipped, shapeFlipped, rectFlipped);\n \n core::Image imgFlipped;\n util::toDest(cvFlipped, imgFlipped);\n \n images.push_back(imgFlipped);\n shapes.push_back(shapeFlipped);\n shapes.push_back(rectFlipped);\n }\n }\n }\n \n DEST_LOG(\"Successfully loaded \" << (shapes.size() - initialSize) << \" entries from database.\" << std::endl);\n return (shapes.size() - initialSize) > 0;\n\n }\n \n }\n}<|endoftext|>"} {"text":"<commit_before>\/\/ vim:ts=2:sw=2:expandtab:autoindent:filetype=cpp:\n\/*\nCopyright (c) 2008 Aristid Breitkreuz, Ruediger Sonderfeld\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include \"flusspferd\/io\/stream_base.hpp\"\n#include \"flusspferd\/local_root_scope.hpp\"\n#include \"flusspferd\/create.hpp\"\n#include \"flusspferd\/string.hpp\"\n#include \"flusspferd\/string_io.hpp\"\n#include \"flusspferd\/create.hpp\"\n#include \"flusspferd\/blob.hpp\"\n#include <boost\/scoped_array.hpp>\n#include <cstdlib>\n\nusing namespace flusspferd;\nusing namespace flusspferd::io;\n\nstream_base::stream_base(object const &o, std::streambuf *p)\n : native_object_base(o), streambuf(p)\n{\n register_native_method(\"readWhole\", &stream_base::read_whole);\n register_native_method(\"read\", &stream_base::read);\n register_native_method(\"readWholeBlob\", &stream_base::read_whole_blob);\n register_native_method(\"readBlob\", &stream_base::read_blob);\n register_native_method(\"write\", &stream_base::write);\n register_native_method(\"print\", &stream_base::print);\n register_native_method(\"flush\", &stream_base::flush);\n\n define_property(\"fieldSeparator\", string(\" \"));\n define_property(\"recordSeparator\", string(\"\\n\"));\n}\n\nstream_base::~stream_base()\n{}\n\nvoid stream_base::set_streambuf(std::streambuf *p) {\n streambuf = p;\n}\n\nobject stream_base::class_info::create_prototype() {\n local_root_scope scope;\n\n object proto = create_object();\n\n create_native_method(proto, \"readWhole\", 0);\n create_native_method(proto, \"read\", 1);\n create_native_method(proto, \"readWholeBlob\", 0);\n create_native_method(proto, \"readBlob\", 1);\n create_native_method(proto, \"write\", 1);\n create_native_method(proto, \"print\", 0);\n create_native_method(proto, \"flush\", 0);\n\n return proto;\n}\n\nstring stream_base::read_whole() {\n std::string data;\n char buf[4096];\n\n std::streamsize length;\n\n do { \n length = streambuf->sgetn(buf, sizeof(buf));\n if (length < 0)\n length = 0;\n data.append(buf, length);\n } while (length > 0);\n\n return string(data);\n}\n\nobject stream_base::read_whole_blob() {\n unsigned const N = 4096;\n\n std::vector<char> data;\n\n std::streamsize length;\n\n do {\n data.resize(data.size() + N);\n length = streambuf->sgetn(&data[data.size() - N], N);\n if (length < 0)\n length = 0;\n data.resize(data.size() - N + length);\n } while (length > 0);\n\n return create_native_object<blob>(\n object(), (unsigned char const *)&data[0], data.size());\n}\n\nstring stream_base::read(unsigned size) {\n if (!size)\n size = 4096;\n\n boost::scoped_array<char> buf(new char[size + 1]);\n\n std::streamsize length = streambuf->sgetn(buf.get(), size);\n if (length < 0)\n length = 0;\n buf[length] = '\\0';\n\n return string(buf.get());\n}\n\nobject stream_base::read_blob(unsigned size) {\n if (!size)\n size = 4096;\n\n boost::scoped_array<char> buf(new char[size]);\n\n std::streamsize length = streambuf->sgetn(buf.get(), size);\n if (length < 0)\n length = 0;\n\n return create_native_object<blob>(\n object(),\n (unsigned char const *) buf.get(),\n length);\n}\n\nvoid stream_base::write(value const &data) {\n if (data.is_string()) {\n string text = data.get_string();\n char const *str = text.c_str();\n streambuf->sputn(text.c_str(), std::strlen(str));\n } else if (data.is_object()) {\n native_object_base *ptr = native_object_base::get_native(data.get_object());\n blob &b = dynamic_cast<blob&>(*ptr);\n streambuf->sputn((char const*) b.get_data(), b.size());\n }\n}\n\nvoid stream_base::print(call_context &x) {\n local_root_scope scope;\n\n value delim_v = get_property(\"fieldSeparator\");\n string delim;\n if (!delim_v.is_void_or_null())\n delim = delim_v.to_string();\n\n std::size_t n = x.arg.size();\n for (std::size_t i = 0; i < n; ++i) {\n write(x.arg[i].to_string());\n if (i < n - 1)\n write(delim);\n }\n\n value record_v = get_property(\"recordSeparator\");\n if (!record_v.is_void_or_null())\n write(record_v.to_string());\n\n flush();\n}\n\nvoid stream_base::flush() {\n streambuf->pubsync();\n}\n<commit_msg>IO: add autoflush<commit_after>\/\/ vim:ts=2:sw=2:expandtab:autoindent:filetype=cpp:\n\/*\nCopyright (c) 2008 Aristid Breitkreuz, Ruediger Sonderfeld\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include \"flusspferd\/io\/stream_base.hpp\"\n#include \"flusspferd\/local_root_scope.hpp\"\n#include \"flusspferd\/create.hpp\"\n#include \"flusspferd\/string.hpp\"\n#include \"flusspferd\/string_io.hpp\"\n#include \"flusspferd\/create.hpp\"\n#include \"flusspferd\/blob.hpp\"\n#include <boost\/scoped_array.hpp>\n#include <cstdlib>\n\nusing namespace flusspferd;\nusing namespace flusspferd::io;\n\nstream_base::stream_base(object const &o, std::streambuf *p)\n : native_object_base(o), streambuf(p)\n{\n register_native_method(\"readWhole\", &stream_base::read_whole);\n register_native_method(\"read\", &stream_base::read);\n register_native_method(\"readWholeBlob\", &stream_base::read_whole_blob);\n register_native_method(\"readBlob\", &stream_base::read_blob);\n register_native_method(\"write\", &stream_base::write);\n register_native_method(\"print\", &stream_base::print);\n register_native_method(\"flush\", &stream_base::flush);\n\n define_property(\"fieldSeparator\", string(\" \"));\n define_property(\"recordSeparator\", string(\"\\n\"));\n define_property(\"autoflush\", false);\n}\n\nstream_base::~stream_base()\n{}\n\nvoid stream_base::set_streambuf(std::streambuf *p) {\n streambuf = p;\n}\n\nobject stream_base::class_info::create_prototype() {\n local_root_scope scope;\n\n object proto = create_object();\n\n create_native_method(proto, \"readWhole\", 0);\n create_native_method(proto, \"read\", 1);\n create_native_method(proto, \"readWholeBlob\", 0);\n create_native_method(proto, \"readBlob\", 1);\n create_native_method(proto, \"write\", 1);\n create_native_method(proto, \"print\", 0);\n create_native_method(proto, \"flush\", 0);\n\n return proto;\n}\n\nstring stream_base::read_whole() {\n std::string data;\n char buf[4096];\n\n std::streamsize length;\n\n do { \n length = streambuf->sgetn(buf, sizeof(buf));\n if (length < 0)\n length = 0;\n data.append(buf, length);\n } while (length > 0);\n\n return string(data);\n}\n\nobject stream_base::read_whole_blob() {\n unsigned const N = 4096;\n\n std::vector<char> data;\n\n std::streamsize length;\n\n do {\n data.resize(data.size() + N);\n length = streambuf->sgetn(&data[data.size() - N], N);\n if (length < 0)\n length = 0;\n data.resize(data.size() - N + length);\n } while (length > 0);\n\n return create_native_object<blob>(\n object(), (unsigned char const *)&data[0], data.size());\n}\n\nstring stream_base::read(unsigned size) {\n if (!size)\n size = 4096;\n\n boost::scoped_array<char> buf(new char[size + 1]);\n\n std::streamsize length = streambuf->sgetn(buf.get(), size);\n if (length < 0)\n length = 0;\n buf[length] = '\\0';\n\n return string(buf.get());\n}\n\nobject stream_base::read_blob(unsigned size) {\n if (!size)\n size = 4096;\n\n boost::scoped_array<char> buf(new char[size]);\n\n std::streamsize length = streambuf->sgetn(buf.get(), size);\n if (length < 0)\n length = 0;\n\n return create_native_object<blob>(\n object(),\n (unsigned char const *) buf.get(),\n length);\n}\n\nvoid stream_base::write(value const &data) {\n if (data.is_string()) {\n string text = data.get_string();\n char const *str = text.c_str();\n streambuf->sputn(text.c_str(), std::strlen(str));\n } else if (data.is_object()) {\n native_object_base *ptr = native_object_base::get_native(data.get_object());\n blob &b = dynamic_cast<blob&>(*ptr);\n streambuf->sputn((char const*) b.get_data(), b.size());\n }\n \/\/TODO slow?\n if (get_property(\"autoflush\").to_boolean())\n flush();\n}\n\nvoid stream_base::print(call_context &x) {\n local_root_scope scope;\n\n value delim_v = get_property(\"fieldSeparator\");\n string delim;\n if (!delim_v.is_void_or_null())\n delim = delim_v.to_string();\n\n std::size_t n = x.arg.size();\n for (std::size_t i = 0; i < n; ++i) {\n write(x.arg[i].to_string());\n if (i < n - 1)\n write(delim);\n }\n\n value record_v = get_property(\"recordSeparator\");\n if (!record_v.is_void_or_null())\n write(record_v.to_string());\n\n flush();\n}\n\nvoid stream_base::flush() {\n streambuf->pubsync();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n\r\n Image Uploader - free application for uploading images\/files to the Internet\r\n\r\n Copyright 2007-2018 Sergey Svistunov (zenden2k@yandex.ru)\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n\r\n*\/\r\n\r\n#include \"OutputCodeGenerator.h\"\r\n#include \"Utils\/CoreUtils.h\"\r\n\r\nZOutputCodeGenerator::ZOutputCodeGenerator()\r\n{\r\n\tm_PreferDirectLinks = true;\r\n\tm_lang = clPlain;\r\n\tm_CodeType = ctLinks;\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setLang(CodeLang lang)\r\n{\r\n\tm_lang = lang;\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setType(CodeType type)\r\n{\r\n\tm_CodeType = type;\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::generate(const std::vector<ZUploadObject>& items)\r\n{\r\n std::string result =\"\";\r\n\tfor(int i=0; i < items.size(); i++)\r\n\t{\r\n\t\tif(i) result += \"\\r\\n\";\r\n\t\tresult += generateCodeForItem(items[i], i);\r\n\t}\r\n\treturn result;\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::generateCodeForItem(const ZUploadObject& item, int index)\r\n{\r\n\tif(m_lang == clPlain)\r\n return item.directUrl.empty()?item.viewUrl:item.directUrl;\r\n\telse\r\n\t{\r\n if((m_CodeType == ctClickableThumbnails || m_CodeType == ctTableOfThumbnails) && !item.thumbUrl.empty())\r\n return link(item.directUrl, image(item.thumbUrl));\r\n else if (m_CodeType == ctImages && !item.directUrl.empty())\r\n return image(item.directUrl);\r\n else\r\n \/\/ if (m_CodeType == ctLinks || item.directUrl.empty())\r\n return link(item.directUrl.empty()?item.viewUrl:item.directUrl, IuCoreUtils::ExtractFileName(item.displayFileName));\r\n\t}\r\n return \"\";\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::image(std::string url)\r\n{\r\n\tif (m_lang == clBBCode)\r\n\t\treturn \"[img]\" + url +\"[\/img]\";\r\n\telse return \"<img border='0' src='\" + url+ \"'\/>\";\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::link(std::string url, std::string body)\r\n{\r\n\tif (m_lang == clBBCode)\r\n\t\treturn \"[url=\" + url +\"]\"+body+\"[\/url]\";\r\n\telse return \"<a href='\"+url+\"'>\"+body+\"<\/a>\";\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setPreferDirectLinks(bool prefer)\r\n{\r\n\tm_PreferDirectLinks = prefer;\r\n}\r\n<commit_msg>Fixed output code generation in CLI, closes #238<commit_after>\/*\r\n\r\n Image Uploader - free application for uploading images\/files to the Internet\r\n\r\n Copyright 2007-2018 Sergey Svistunov (zenden2k@yandex.ru)\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n\r\n*\/\r\n\r\n#include \"OutputCodeGenerator.h\"\r\n#include \"Utils\/CoreUtils.h\"\r\n\r\nZOutputCodeGenerator::ZOutputCodeGenerator()\r\n{\r\n\tm_PreferDirectLinks = true;\r\n\tm_lang = clPlain;\r\n\tm_CodeType = ctLinks;\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setLang(CodeLang lang)\r\n{\r\n\tm_lang = lang;\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setType(CodeType type)\r\n{\r\n\tm_CodeType = type;\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::generate(const std::vector<ZUploadObject>& items)\r\n{\r\n std::string result =\"\";\r\n\tfor(int i=0; i < items.size(); i++)\r\n\t{\r\n\t\tif(i) result += \"\\r\\n\";\r\n\t\tresult += generateCodeForItem(items[i], i);\r\n\t}\r\n\treturn result;\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::generateCodeForItem(const ZUploadObject& item, int index)\r\n{\r\n\tif(m_lang == clPlain)\r\n return item.directUrl.empty()?item.viewUrl:item.directUrl;\r\n\telse\r\n\t{\r\n if((m_CodeType == ctClickableThumbnails || m_CodeType == ctTableOfThumbnails) && !item.thumbUrl.empty())\r\n return link(item.directUrl.empty() ? item.viewUrl : item.directUrl, image(item.thumbUrl));\r\n else if (m_CodeType == ctImages && !item.directUrl.empty())\r\n return image(item.directUrl);\r\n else\r\n \/\/ if (m_CodeType == ctLinks || item.directUrl.empty())\r\n return link(item.directUrl.empty()?item.viewUrl:item.directUrl, IuCoreUtils::ExtractFileName(item.displayFileName));\r\n\t}\r\n return \"\";\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::image(std::string url)\r\n{\r\n\tif (m_lang == clBBCode)\r\n\t\treturn \"[img]\" + url +\"[\/img]\";\r\n\telse return \"<img border='0' src='\" + url+ \"'\/>\";\r\n}\r\n\r\nstd::string ZOutputCodeGenerator::link(std::string url, std::string body)\r\n{\r\n\tif (m_lang == clBBCode)\r\n\t\treturn \"[url=\" + url +\"]\"+body+\"[\/url]\";\r\n\telse return \"<a href='\"+url+\"'>\"+body+\"<\/a>\";\r\n}\r\n\r\nvoid ZOutputCodeGenerator::setPreferDirectLinks(bool prefer)\r\n{\r\n\tm_PreferDirectLinks = prefer;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2003, 2004, 2005, 2006, 2007 Apple Inc. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"config.h\"\n#include \"core\/rendering\/InlineBox.h\"\n\n#include \"core\/rendering\/InlineFlowBox.h\"\n#include \"core\/rendering\/PaintInfo.h\"\n#include \"core\/rendering\/RenderBlockFlow.h\"\n#include \"core\/rendering\/RootInlineBox.h\"\n#include \"platform\/Partitions.h\"\n#include \"platform\/fonts\/FontMetrics.h\"\n\n#ifndef NDEBUG\n#include <stdio.h>\n#endif\n\nusing namespace std;\n\nnamespace WebCore {\n\nstruct SameSizeAsInlineBox {\n virtual ~SameSizeAsInlineBox() { }\n void* a[4];\n FloatPoint b;\n float c;\n uint32_t d : 32;\n#ifndef NDEBUG\n bool f;\n#endif\n};\n\nCOMPILE_ASSERT(sizeof(InlineBox) == sizeof(SameSizeAsInlineBox), InlineBox_size_guard);\n\n#ifndef NDEBUG\n\nInlineBox::~InlineBox()\n{\n if (!m_hasBadParent && m_parent)\n m_parent->setHasBadChildList();\n}\n\n#endif\n\nvoid InlineBox::remove()\n{\n if (parent())\n parent()->removeChild(this);\n}\n\nvoid* InlineBox::operator new(size_t sz)\n{\n return partitionAlloc(Partitions::getRenderingPartition(), sz);\n}\n\nvoid InlineBox::operator delete(void* ptr)\n{\n partitionFree(ptr);\n}\n\n#ifndef NDEBUG\nconst char* InlineBox::boxName() const\n{\n return \"InlineBox\";\n}\n\nvoid InlineBox::showTreeForThis() const\n{\n renderer().showTreeForThis();\n}\n\nvoid InlineBox::showLineTreeForThis() const\n{\n renderer().containingBlock()->showLineTreeAndMark(this, \"*\");\n}\n\nvoid InlineBox::showLineTreeAndMark(const InlineBox* markedBox1, const char* markedLabel1, const InlineBox* markedBox2, const char* markedLabel2, const RenderObject* obj, int depth) const\n{\n int printedCharacters = 0;\n if (this == markedBox1)\n printedCharacters += fprintf(stderr, \"%s\", markedLabel1);\n if (this == markedBox2)\n printedCharacters += fprintf(stderr, \"%s\", markedLabel2);\n if (&renderer() == obj)\n printedCharacters += fprintf(stderr, \"*\");\n for (; printedCharacters < depth * 2; printedCharacters++)\n fputc(' ', stderr);\n\n showBox(printedCharacters);\n}\n\nvoid InlineBox::showBox(int printedCharacters) const\n{\n printedCharacters += fprintf(stderr, \"%s\\t%p\", boxName(), this);\n for (; printedCharacters < showTreeCharacterOffset; printedCharacters++)\n fputc(' ', stderr);\n fprintf(stderr, \"\\t%s %p\\n\", renderer().renderName(), &renderer());\n}\n#endif\n\nfloat InlineBox::logicalHeight() const\n{\n if (hasVirtualLogicalHeight())\n return virtualLogicalHeight();\n\n if (renderer().isText())\n return m_bitfields.isText() ? renderer().style(isFirstLineStyle())->fontMetrics().height() : 0;\n if (renderer().isBox() && parent())\n return isHorizontal() ? toRenderBox(renderer()).height().toFloat() : toRenderBox(renderer()).width().toFloat();\n\n ASSERT(isInlineFlowBox());\n RenderBoxModelObject* flowObject = boxModelObject();\n const FontMetrics& fontMetrics = renderer().style(isFirstLineStyle())->fontMetrics();\n float result = fontMetrics.height();\n if (parent())\n result += flowObject->borderAndPaddingLogicalHeight();\n return result;\n}\n\nint InlineBox::baselinePosition(FontBaseline baselineType) const\n{\n return boxModelObject()->baselinePosition(baselineType, m_bitfields.firstLine(), isHorizontal() ? HorizontalLine : VerticalLine, PositionOnContainingLine);\n}\n\nLayoutUnit InlineBox::lineHeight() const\n{\n return boxModelObject()->lineHeight(m_bitfields.firstLine(), isHorizontal() ? HorizontalLine : VerticalLine, PositionOnContainingLine);\n}\n\nint InlineBox::caretMinOffset() const\n{\n return renderer().caretMinOffset();\n}\n\nint InlineBox::caretMaxOffset() const\n{\n return renderer().caretMaxOffset();\n}\n\nvoid InlineBox::dirtyLineBoxes()\n{\n markDirty();\n for (InlineFlowBox* curr = parent(); curr && !curr->isDirty(); curr = curr->parent())\n curr->markDirty();\n}\n\nvoid InlineBox::deleteLine()\n{\n if (!m_bitfields.extracted() && renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(0);\n destroy();\n}\n\nvoid InlineBox::extractLine()\n{\n m_bitfields.setExtracted(true);\n if (renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(0);\n}\n\nvoid InlineBox::attachLine()\n{\n m_bitfields.setExtracted(false);\n if (renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(this);\n}\n\nvoid InlineBox::adjustPosition(float dx, float dy)\n{\n m_topLeft.move(dx, dy);\n\n if (renderer().isReplaced())\n toRenderBox(renderer()).move(dx, dy);\n}\n\nvoid InlineBox::paint(PaintInfo& paintInfo, const LayoutPoint& paintOffset, LayoutUnit \/* lineTop *\/, LayoutUnit \/*lineBottom*\/)\n{\n if (!paintInfo.shouldPaintWithinRoot(&renderer()) || (paintInfo.phase != PaintPhaseForeground && paintInfo.phase != PaintPhaseSelection))\n return;\n\n LayoutPoint childPoint = paintOffset;\n if (parent()->renderer().style()->isFlippedBlocksWritingMode()) \/\/ Faster than calling containingBlock().\n childPoint = renderer().containingBlock()->flipForWritingModeForChild(&toRenderBox(renderer()), childPoint);\n\n RenderBlock::paintAsInlineBlock(&renderer(), paintInfo, childPoint);\n}\n\nbool InlineBox::nodeAtPoint(const HitTestRequest& request, HitTestResult& result, const HitTestLocation& locationInContainer, const LayoutPoint& accumulatedOffset, LayoutUnit \/* lineTop *\/, LayoutUnit \/*lineBottom*\/)\n{\n \/\/ Hit test all phases of replaced elements atomically, as though the replaced element established its\n \/\/ own stacking context. (See Appendix E.2, section 6.4 on inline block\/table elements in the CSS2.1\n \/\/ specification.)\n LayoutPoint childPoint = accumulatedOffset;\n if (parent()->renderer().style()->isFlippedBlocksWritingMode()) \/\/ Faster than calling containingBlock().\n childPoint = renderer().containingBlock()->flipForWritingModeForChild(&toRenderBox(renderer()), childPoint);\n\n return renderer().hitTest(request, result, locationInContainer, childPoint);\n}\n\nconst RootInlineBox& InlineBox::root() const\n{\n if (m_parent)\n return m_parent->root();\n ASSERT(isRootInlineBox());\n return static_cast<const RootInlineBox&>(*this);\n}\n\nRootInlineBox& InlineBox::root()\n{\n if (m_parent)\n return m_parent->root();\n ASSERT(isRootInlineBox());\n return static_cast<RootInlineBox&>(*this);\n}\n\nbool InlineBox::nextOnLineExists() const\n{\n if (!m_bitfields.determinedIfNextOnLineExists()) {\n m_bitfields.setDeterminedIfNextOnLineExists(true);\n\n if (!parent())\n m_bitfields.setNextOnLineExists(false);\n else if (nextOnLine())\n m_bitfields.setNextOnLineExists(true);\n else\n m_bitfields.setNextOnLineExists(parent()->nextOnLineExists());\n }\n return m_bitfields.nextOnLineExists();\n}\n\nInlineBox* InlineBox::nextLeafChild() const\n{\n InlineBox* leaf = 0;\n for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine())\n leaf = box->isLeaf() ? box : toInlineFlowBox(box)->firstLeafChild();\n if (!leaf && parent())\n leaf = parent()->nextLeafChild();\n return leaf;\n}\n\nInlineBox* InlineBox::prevLeafChild() const\n{\n InlineBox* leaf = 0;\n for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine())\n leaf = box->isLeaf() ? box : toInlineFlowBox(box)->lastLeafChild();\n if (!leaf && parent())\n leaf = parent()->prevLeafChild();\n return leaf;\n}\n\nInlineBox* InlineBox::nextLeafChildIgnoringLineBreak() const\n{\n InlineBox* leaf = nextLeafChild();\n if (leaf && leaf->isLineBreak())\n return 0;\n return leaf;\n}\n\nInlineBox* InlineBox::prevLeafChildIgnoringLineBreak() const\n{\n InlineBox* leaf = prevLeafChild();\n if (leaf && leaf->isLineBreak())\n return 0;\n return leaf;\n}\n\nRenderObject::SelectionState InlineBox::selectionState()\n{\n return renderer().selectionState();\n}\n\nbool InlineBox::canAccommodateEllipsis(bool ltr, int blockEdge, int ellipsisWidth) const\n{\n \/\/ Non-replaced elements can always accommodate an ellipsis.\n if (!renderer().isReplaced())\n return true;\n\n IntRect boxRect(left(), 0, m_logicalWidth, 10);\n IntRect ellipsisRect(ltr ? blockEdge - ellipsisWidth : blockEdge, 0, ellipsisWidth, 10);\n return !(boxRect.intersects(ellipsisRect));\n}\n\nfloat InlineBox::placeEllipsisBox(bool, float, float, float, float& truncatedWidth, bool&)\n{\n \/\/ Use -1 to mean \"we didn't set the position.\"\n truncatedWidth += logicalWidth();\n return -1;\n}\n\nvoid InlineBox::clearKnownToHaveNoOverflow()\n{\n m_bitfields.setKnownToHaveNoOverflow(false);\n if (parent() && parent()->knownToHaveNoOverflow())\n parent()->clearKnownToHaveNoOverflow();\n}\n\nFloatPoint InlineBox::locationIncludingFlipping()\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return FloatPoint(x(), y());\n RenderBlockFlow& block = root().block();\n if (block.style()->isHorizontalWritingMode())\n return FloatPoint(x(), block.height() - height() - y());\n\n return FloatPoint(block.width() - width() - x(), y());\n}\n\nvoid InlineBox::flipForWritingMode(FloatRect& rect)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return;\n root().block().flipForWritingMode(rect);\n}\n\nFloatPoint InlineBox::flipForWritingMode(const FloatPoint& point)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return point;\n return root().block().flipForWritingMode(point);\n}\n\nvoid InlineBox::flipForWritingMode(LayoutRect& rect)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return;\n root().block().flipForWritingMode(rect);\n}\n\nLayoutPoint InlineBox::flipForWritingMode(const LayoutPoint& point)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return point;\n return root().block().flipForWritingMode(point);\n}\n\n} \/\/ namespace WebCore\n\n#ifndef NDEBUG\n\nvoid showTree(const WebCore::InlineBox* b)\n{\n if (b)\n b->showTreeForThis();\n}\n\nvoid showLineTree(const WebCore::InlineBox* b)\n{\n if (b)\n b->showLineTreeForThis();\n}\n\n#endif\n<commit_msg>Add more details to showLineTree() output<commit_after>\/*\n * Copyright (C) 2003, 2004, 2005, 2006, 2007 Apple Inc. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"config.h\"\n#include \"core\/rendering\/InlineBox.h\"\n\n#include \"core\/rendering\/InlineFlowBox.h\"\n#include \"core\/rendering\/PaintInfo.h\"\n#include \"core\/rendering\/RenderBlockFlow.h\"\n#include \"core\/rendering\/RootInlineBox.h\"\n#include \"platform\/Partitions.h\"\n#include \"platform\/fonts\/FontMetrics.h\"\n\n#ifndef NDEBUG\n#include <stdio.h>\n#endif\n\nusing namespace std;\n\nnamespace WebCore {\n\nstruct SameSizeAsInlineBox {\n virtual ~SameSizeAsInlineBox() { }\n void* a[4];\n FloatPoint b;\n float c;\n uint32_t d : 32;\n#ifndef NDEBUG\n bool f;\n#endif\n};\n\nCOMPILE_ASSERT(sizeof(InlineBox) == sizeof(SameSizeAsInlineBox), InlineBox_size_guard);\n\n#ifndef NDEBUG\n\nInlineBox::~InlineBox()\n{\n if (!m_hasBadParent && m_parent)\n m_parent->setHasBadChildList();\n}\n\n#endif\n\nvoid InlineBox::remove()\n{\n if (parent())\n parent()->removeChild(this);\n}\n\nvoid* InlineBox::operator new(size_t sz)\n{\n return partitionAlloc(Partitions::getRenderingPartition(), sz);\n}\n\nvoid InlineBox::operator delete(void* ptr)\n{\n partitionFree(ptr);\n}\n\n#ifndef NDEBUG\nconst char* InlineBox::boxName() const\n{\n return \"InlineBox\";\n}\n\nvoid InlineBox::showTreeForThis() const\n{\n renderer().showTreeForThis();\n}\n\nvoid InlineBox::showLineTreeForThis() const\n{\n renderer().containingBlock()->showLineTreeAndMark(this, \"*\");\n}\n\nvoid InlineBox::showLineTreeAndMark(const InlineBox* markedBox1, const char* markedLabel1, const InlineBox* markedBox2, const char* markedLabel2, const RenderObject* obj, int depth) const\n{\n int printedCharacters = 0;\n if (this == markedBox1)\n printedCharacters += fprintf(stderr, \"%s\", markedLabel1);\n if (this == markedBox2)\n printedCharacters += fprintf(stderr, \"%s\", markedLabel2);\n if (&renderer() == obj)\n printedCharacters += fprintf(stderr, \"*\");\n for (; printedCharacters < depth * 2; printedCharacters++)\n fputc(' ', stderr);\n\n showBox(printedCharacters);\n}\n\nvoid InlineBox::showBox(int printedCharacters) const\n{\n printedCharacters += fprintf(stderr, \"%s\\t%p\", boxName(), this);\n for (; printedCharacters < showTreeCharacterOffset; printedCharacters++)\n fputc(' ', stderr);\n fprintf(stderr, \"\\t%s %p {pos=%g,%g size=%g,%g} baseline=%i\/%i\\n\",\n renderer().renderName(), &renderer(), x(), y(), width(), height(),\n baselinePosition(AlphabeticBaseline),\n baselinePosition(IdeographicBaseline));\n}\n#endif\n\nfloat InlineBox::logicalHeight() const\n{\n if (hasVirtualLogicalHeight())\n return virtualLogicalHeight();\n\n if (renderer().isText())\n return m_bitfields.isText() ? renderer().style(isFirstLineStyle())->fontMetrics().height() : 0;\n if (renderer().isBox() && parent())\n return isHorizontal() ? toRenderBox(renderer()).height().toFloat() : toRenderBox(renderer()).width().toFloat();\n\n ASSERT(isInlineFlowBox());\n RenderBoxModelObject* flowObject = boxModelObject();\n const FontMetrics& fontMetrics = renderer().style(isFirstLineStyle())->fontMetrics();\n float result = fontMetrics.height();\n if (parent())\n result += flowObject->borderAndPaddingLogicalHeight();\n return result;\n}\n\nint InlineBox::baselinePosition(FontBaseline baselineType) const\n{\n return boxModelObject()->baselinePosition(baselineType, m_bitfields.firstLine(), isHorizontal() ? HorizontalLine : VerticalLine, PositionOnContainingLine);\n}\n\nLayoutUnit InlineBox::lineHeight() const\n{\n return boxModelObject()->lineHeight(m_bitfields.firstLine(), isHorizontal() ? HorizontalLine : VerticalLine, PositionOnContainingLine);\n}\n\nint InlineBox::caretMinOffset() const\n{\n return renderer().caretMinOffset();\n}\n\nint InlineBox::caretMaxOffset() const\n{\n return renderer().caretMaxOffset();\n}\n\nvoid InlineBox::dirtyLineBoxes()\n{\n markDirty();\n for (InlineFlowBox* curr = parent(); curr && !curr->isDirty(); curr = curr->parent())\n curr->markDirty();\n}\n\nvoid InlineBox::deleteLine()\n{\n if (!m_bitfields.extracted() && renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(0);\n destroy();\n}\n\nvoid InlineBox::extractLine()\n{\n m_bitfields.setExtracted(true);\n if (renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(0);\n}\n\nvoid InlineBox::attachLine()\n{\n m_bitfields.setExtracted(false);\n if (renderer().isBox())\n toRenderBox(renderer()).setInlineBoxWrapper(this);\n}\n\nvoid InlineBox::adjustPosition(float dx, float dy)\n{\n m_topLeft.move(dx, dy);\n\n if (renderer().isReplaced())\n toRenderBox(renderer()).move(dx, dy);\n}\n\nvoid InlineBox::paint(PaintInfo& paintInfo, const LayoutPoint& paintOffset, LayoutUnit \/* lineTop *\/, LayoutUnit \/*lineBottom*\/)\n{\n if (!paintInfo.shouldPaintWithinRoot(&renderer()) || (paintInfo.phase != PaintPhaseForeground && paintInfo.phase != PaintPhaseSelection))\n return;\n\n LayoutPoint childPoint = paintOffset;\n if (parent()->renderer().style()->isFlippedBlocksWritingMode()) \/\/ Faster than calling containingBlock().\n childPoint = renderer().containingBlock()->flipForWritingModeForChild(&toRenderBox(renderer()), childPoint);\n\n RenderBlock::paintAsInlineBlock(&renderer(), paintInfo, childPoint);\n}\n\nbool InlineBox::nodeAtPoint(const HitTestRequest& request, HitTestResult& result, const HitTestLocation& locationInContainer, const LayoutPoint& accumulatedOffset, LayoutUnit \/* lineTop *\/, LayoutUnit \/*lineBottom*\/)\n{\n \/\/ Hit test all phases of replaced elements atomically, as though the replaced element established its\n \/\/ own stacking context. (See Appendix E.2, section 6.4 on inline block\/table elements in the CSS2.1\n \/\/ specification.)\n LayoutPoint childPoint = accumulatedOffset;\n if (parent()->renderer().style()->isFlippedBlocksWritingMode()) \/\/ Faster than calling containingBlock().\n childPoint = renderer().containingBlock()->flipForWritingModeForChild(&toRenderBox(renderer()), childPoint);\n\n return renderer().hitTest(request, result, locationInContainer, childPoint);\n}\n\nconst RootInlineBox& InlineBox::root() const\n{\n if (m_parent)\n return m_parent->root();\n ASSERT(isRootInlineBox());\n return static_cast<const RootInlineBox&>(*this);\n}\n\nRootInlineBox& InlineBox::root()\n{\n if (m_parent)\n return m_parent->root();\n ASSERT(isRootInlineBox());\n return static_cast<RootInlineBox&>(*this);\n}\n\nbool InlineBox::nextOnLineExists() const\n{\n if (!m_bitfields.determinedIfNextOnLineExists()) {\n m_bitfields.setDeterminedIfNextOnLineExists(true);\n\n if (!parent())\n m_bitfields.setNextOnLineExists(false);\n else if (nextOnLine())\n m_bitfields.setNextOnLineExists(true);\n else\n m_bitfields.setNextOnLineExists(parent()->nextOnLineExists());\n }\n return m_bitfields.nextOnLineExists();\n}\n\nInlineBox* InlineBox::nextLeafChild() const\n{\n InlineBox* leaf = 0;\n for (InlineBox* box = nextOnLine(); box && !leaf; box = box->nextOnLine())\n leaf = box->isLeaf() ? box : toInlineFlowBox(box)->firstLeafChild();\n if (!leaf && parent())\n leaf = parent()->nextLeafChild();\n return leaf;\n}\n\nInlineBox* InlineBox::prevLeafChild() const\n{\n InlineBox* leaf = 0;\n for (InlineBox* box = prevOnLine(); box && !leaf; box = box->prevOnLine())\n leaf = box->isLeaf() ? box : toInlineFlowBox(box)->lastLeafChild();\n if (!leaf && parent())\n leaf = parent()->prevLeafChild();\n return leaf;\n}\n\nInlineBox* InlineBox::nextLeafChildIgnoringLineBreak() const\n{\n InlineBox* leaf = nextLeafChild();\n if (leaf && leaf->isLineBreak())\n return 0;\n return leaf;\n}\n\nInlineBox* InlineBox::prevLeafChildIgnoringLineBreak() const\n{\n InlineBox* leaf = prevLeafChild();\n if (leaf && leaf->isLineBreak())\n return 0;\n return leaf;\n}\n\nRenderObject::SelectionState InlineBox::selectionState()\n{\n return renderer().selectionState();\n}\n\nbool InlineBox::canAccommodateEllipsis(bool ltr, int blockEdge, int ellipsisWidth) const\n{\n \/\/ Non-replaced elements can always accommodate an ellipsis.\n if (!renderer().isReplaced())\n return true;\n\n IntRect boxRect(left(), 0, m_logicalWidth, 10);\n IntRect ellipsisRect(ltr ? blockEdge - ellipsisWidth : blockEdge, 0, ellipsisWidth, 10);\n return !(boxRect.intersects(ellipsisRect));\n}\n\nfloat InlineBox::placeEllipsisBox(bool, float, float, float, float& truncatedWidth, bool&)\n{\n \/\/ Use -1 to mean \"we didn't set the position.\"\n truncatedWidth += logicalWidth();\n return -1;\n}\n\nvoid InlineBox::clearKnownToHaveNoOverflow()\n{\n m_bitfields.setKnownToHaveNoOverflow(false);\n if (parent() && parent()->knownToHaveNoOverflow())\n parent()->clearKnownToHaveNoOverflow();\n}\n\nFloatPoint InlineBox::locationIncludingFlipping()\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return FloatPoint(x(), y());\n RenderBlockFlow& block = root().block();\n if (block.style()->isHorizontalWritingMode())\n return FloatPoint(x(), block.height() - height() - y());\n\n return FloatPoint(block.width() - width() - x(), y());\n}\n\nvoid InlineBox::flipForWritingMode(FloatRect& rect)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return;\n root().block().flipForWritingMode(rect);\n}\n\nFloatPoint InlineBox::flipForWritingMode(const FloatPoint& point)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return point;\n return root().block().flipForWritingMode(point);\n}\n\nvoid InlineBox::flipForWritingMode(LayoutRect& rect)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return;\n root().block().flipForWritingMode(rect);\n}\n\nLayoutPoint InlineBox::flipForWritingMode(const LayoutPoint& point)\n{\n if (!renderer().style()->isFlippedBlocksWritingMode())\n return point;\n return root().block().flipForWritingMode(point);\n}\n\n} \/\/ namespace WebCore\n\n#ifndef NDEBUG\n\nvoid showTree(const WebCore::InlineBox* b)\n{\n if (b)\n b->showTreeForThis();\n}\n\nvoid showLineTree(const WebCore::InlineBox* b)\n{\n if (b)\n b->showLineTreeForThis();\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n\/* @doc \\file Object to generate a file following AMELIF format.\n\n Copyright (c) 2010\n @author Olivier Stasse\n JRL-Japan, CNRS\/AIST\n \n All rights reserved.\n\n Please refers to file License.txt for details on the license.\n\n*\/\n#include \"GenerateRobotForAMELIF.h\"\n#include <cmath>\n\nusing namespace std;\n\nnamespace {\n\tdouble FilterPrecision(double x)\n\t{\n\t\tx *= 1e6;\n\t\tx =floor(x+0.5);\n\t\tx *= 1e-6;\n\t\treturn x;\n\t}\n\n\tvoid ComputeEulerAngles(const matrix3d &aRotationMatrix, vector3d &EulerAngles)\n\t{\n\t\tdouble r11 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,0);\n\t\tdouble r12 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,1);\n\t\tdouble r13 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,2);\n\n\t\tdouble r21 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,1,0);\n\n\t\tdouble r31 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,0);\n\t\tdouble r32 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,1);\n\t\tdouble r33 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,2);\n\n\n\t\tif (fabs(fabs(r31)-1.0)>1e-8)\n\t\t{\n\n\t\t\tdouble Y1 = -asin(r31);\n\t\t\tdouble Y2 = M_PI - Y1;\n\t\t\tY2 = fmod(Y2,M_PI);\n\t\t\tdouble c0_1 = cos(Y1);\n\t\t\tdouble c0_2 = cos(Y2);\n\n\t\t\tdouble X1 = atan2(r32\/c0_1,r33\/c0_1);\n\t\t\tdouble X2 = atan2(r32\/c0_2,r33\/c0_2);\n\n\t\t\tdouble c0;\n\t\t\tif (fabs(X1)<fabs(X2))\n\t\t\t{\n\t\t\t\tEulerAngles(1) = Y1;\n\t\t\t\tEulerAngles(0) = X1;\n\t\t\t\tc0 = c0_1;\n\t\t\t}\n\t\t\telse \n\t\t\t{\n\t\t\t\tEulerAngles(1) = Y2;\n\t\t\t\tEulerAngles(0) = X2;\n\t\t\t\tc0 = c0_2;\n\t\t\t}\n\n\t\t\tEulerAngles(2) = atan2(r21\/c0,r11\/c0);\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tEulerAngles(2) = 0;\n\t\t\tdouble d = atan2(r12,r13);\n\t\t\td = fmod(d,M_PI);\n\t\t\tif (fabs(r31+1.0)<1e-8)\n\t\t\t{\n\t\t\t\tEulerAngles(1) = M_PI\/2;\n\t\t\t\tEulerAngles(0) = d;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tEulerAngles(1) = -M_PI\/2;\n\t\t\t\tEulerAngles(0) = -d;\n\t\t\t}\n\t\t}\n\t}\n}\n\nnamespace dynamicsJRLJapan {\n\n GenerateRobotForAMELIF::GenerateRobotForAMELIF()\n {\n }\n\n GenerateRobotForAMELIF::~GenerateRobotForAMELIF()\n {\n }\n\n void GenerateRobotForAMELIF::Header(ostream &os)\n {\n os << \"<!DOCTYPE MultiBody SYSTEM \\\".\/AMELIFMultiBody.xsd\\\">\" << endl;\n }\n\n void GenerateRobotForAMELIF::StaticParameters(CjrlJoint *aJoint,\n\t\t\t\t\t\tostream &os,\n\t\t\t\t\t\tstring &shifttab)\n {\n MAL_S4x4_MATRIX(aTransformation,double);\n MAL_S4x4_MATRIX(FinalTransformation,double);\n aTransformation = aJoint->currentTransformation();\n unsigned int indexparent=0;\n\n \/* Compute transformation in local coordinates *\/\n CjrlJoint *parentJoint = aJoint->parentJoint();\n if (parentJoint!=0)\n {\n\tMAL_S4x4_MATRIX(parentTransformation,double);\n\tparentTransformation = parentJoint->currentTransformation();\n\n\tMAL_S4x4_MATRIX(invParentTransformation,double);\n\tMAL_S4x4_INVERSE(parentTransformation,invParentTransformation,double);\n\tMAL_S4x4_C_eq_A_by_B(FinalTransformation,invParentTransformation,aTransformation);\n }\n else\n FinalTransformation = aTransformation;\n\n \/* Project rotation axis *\/\n\n matrix3d aRotation;\n vector3d anAxis, EulerAngles;\n for(unsigned int i=0;i<3;i++)\n {\n\tfor(unsigned int j=0;j<3;j++)\n\t MAL_S3x3_MATRIX_ACCESS_I_J(aRotation,i,j) = \n\t MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,i,j);\n }\n\n ComputeEulerAngles(aRotation, EulerAngles);\n\n os << shifttab\n << \" <StaticParameters> \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,0,3) << \" \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,1,3) << \" \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,2,3) << \" \"\n << FilterPrecision(EulerAngles(0) * 180.0\/M_PI) << \" \" \n << FilterPrecision(EulerAngles(1) * 180.0\/M_PI) << \" \" \n << FilterPrecision(EulerAngles(2) * 180.0\/M_PI)\n << \"<\/StaticParameters>\"\n\t << std::endl;\n }\n \n void GenerateRobotForAMELIF::GenerateJoint(CjrlJoint *aJoint, \n\t\t\t\t\t ostream &os,\n\t\t\t\t\t string shifttab, unsigned int &gindex)\n {\n\tos.precision(15);\n\tif (aJoint->rankInConfiguration() == 0)\n\t{\n\t\tgindex++;\n\t\t\/\/ Call the sons.\n\t\tfor(unsigned int i=0;i<aJoint->countChildJoints();i++)\n\t\t\tGenerateJoint(aJoint->childJoint(i),os,shifttab,gindex);\n\t\treturn;\n\t}\n\n \/\/ Joint name and type.\n os << shifttab << \"<Joint id=\\\"\" \n << aJoint->rankInConfiguration() ;\n if (gindex==0)\n os << \"\\\" type=\\\"revolute\\\"\";\n else\n os << \"\\\" type=\\\"revolute\\\"\";\n \n os << \" axis=\\\"x\\\" \" ;\n\n if (aJoint->parentJoint()!=0)\n os << \"innerId=\\\"\"<<aJoint->parentJoint()->rankInConfiguration();\n \n os << \"\\\" outerId=\\\"\"<<aJoint->rankInConfiguration()\n << \"\\\"> \" << endl;\n\n \/\/ Label\n os << shifttab << \" <Label>JOINT_\" \n << aJoint->rankInConfiguration() \n << \" <\/Label>\" << endl;\n \n \/\/ Static parameters\n StaticParameters(aJoint, os, shifttab);\n \n \/\/ Position min and max.\n os << shifttab << \" <PositionMin>\"\n << FilterPrecision(aJoint->lowerBound(0) * 180.0\/M_PI)\n <<\"<\/PositionMin>\" << endl;\n \n os << shifttab << \" <PositionMax>\"\n << FilterPrecision(aJoint->upperBound(0) * 180.0\/M_PI)\n << \"<\/PositionMax>\" << endl;\n\n \/\/ Close the joint description\n os << shifttab << \"<\/Joint>\"<< endl;\n\n gindex++;\n\n \/\/ Call the sons.\n for(unsigned int i=0;i<aJoint->countChildJoints();i++)\n {\n\tGenerateJoint(aJoint->childJoint(i),os,shifttab,gindex);\n }\n\n }\n\n void GenerateRobotForAMELIF::GenerateBody(CjrlJoint *aJoint, \n\t\t\t\t\t ostream &os,\n\t\t\t\t\t string shifttab,\n\t\t\t\t\t unsigned int &gindex)\n {\n\tos.precision(15);\n CjrlBody *aBody= aJoint->linkedBody();\n if (aBody==0)\n return;\n\n os << shifttab << \"<Body id=\\\"\" \n << aJoint->rankInConfiguration()\n << \"\\\">\" << endl;\n\n \/\/ Label\n os << shifttab << \" <Label>LINK_\" \n << aJoint->rankInConfiguration()\n << \"<\/Label>\" << endl;\n\n\t\/\/ Mass\n\tconst double mass = aBody->mass();\n os << shifttab << \" <Mass>\"<< mass <<\"<\/Mass>\" << endl;\n\n \/\/ CoM\n const vector3d lcom = aBody->localCenterOfMass();\n os << shifttab << \" <CoM>\" \n << MAL_S3_VECTOR_ACCESS(lcom,0) << \" \" \n << MAL_S3_VECTOR_ACCESS(lcom,1) << \" \"\n << MAL_S3_VECTOR_ACCESS(lcom,2) << \"<\/CoM>\" << endl;\n\n \/\/ Inertia\n os << shifttab << \" <Inertia>\" ;\n matrix3d Inertia = aBody->inertiaMatrix();\n\n for(unsigned int i=0;i<3;i++)\n for(unsigned int j=0;j<3;j++)\n\tos << MAL_S3x3_MATRIX_ACCESS_I_J(Inertia,i,j) << \" \";\n os << \"<\/Inertia>\" << endl;\n\n \/\/ Geometric file.\n\tconst std::vector< std::string > & urls = m_AccessToData[gindex].getURLs();\n\tfor(unsigned i=0; i < urls.size(); ++i)\n\t\tos << shifttab << \" <File>\" << urls[i] << \"<\/File>\" << endl;\n\n gindex++;\n \/\/ Close body description.\n os << shifttab << \"<\/Body>\" << endl;\n\n \/\/ Call the sons.\n for(unsigned int i=0;i<aJoint->countChildJoints();i++)\n {\n\tGenerateBody(aJoint->childJoint(i),os,shifttab,gindex);\n }\n \n }\n\n void GenerateRobotForAMELIF::SetAccessToData(vector<BodyGeometricalData> &AccessToData)\n {\n m_AccessToData = AccessToData;\n }\n\n void GenerateRobotForAMELIF::GenerateBodies(ostream &os,\n\t\t\t\t\t string shifttab)\n {\n CjrlJoint *RootJoint = m_HDR->rootJoint();\n string lshifttab = shifttab+\" \";\n os << shifttab << \"<Bodies>\" << endl;\n unsigned int gindex=0;\n GenerateBody(RootJoint,os, lshifttab,gindex);\n os << shifttab << \"<\/Bodies>\" << endl;\n }\n\n void GenerateRobotForAMELIF::GenerateJoints(ostream &os,\n\t\t\t\t\t string shifttab)\n {\n CjrlJoint *RootJoint = m_HDR->rootJoint();\n string lshifttab = shifttab+\" \";\n os << shifttab << \"<Joints>\" << endl;\n unsigned int gindex=0;\n GenerateJoint(RootJoint,os, lshifttab,gindex);\n os << shifttab << \"<\/Joints>\" << endl;\n }\n\n void GenerateRobotForAMELIF::GenerateRobot(std::string &RobotName,\n\t\t\t\t\t CjrlHumanoidDynamicRobot *aHDR)\n {\n m_HDR = aHDR;\n ofstream aof;\n \n string FileName = RobotName;\n FileName += \".xml\";\n \n aof.open(FileName.c_str(),fstream::out);\n if (!aof.is_open())\n return;\n\n Header(aof);\n\n string shifttab;\n aof << \"<MultiBody>\" << endl;\n shifttab = \" \";\n aof << shifttab << \"<Root id=\\\"0\\\" \/>\" << endl;\n GenerateBodies(aof, shifttab);\n GenerateJoints(aof, shifttab);\n aof << \"<\/MultiBody>\" << endl;\n\n aof.close();\n }\n};\n<commit_msg>Fix warning at compile time.<commit_after>\n\/* @doc \\file Object to generate a file following AMELIF format.\n\n Copyright (c) 2010\n @author Olivier Stasse\n JRL-Japan, CNRS\/AIST\n \n All rights reserved.\n\n Please refers to file License.txt for details on the license.\n\n*\/\n#include \"GenerateRobotForAMELIF.h\"\n#include <cmath>\n\nusing namespace std;\n\nnamespace {\n\tdouble FilterPrecision(double x)\n\t{\n\t\tx *= 1e6;\n\t\tx =floor(x+0.5);\n\t\tx *= 1e-6;\n\t\treturn x;\n\t}\n\n\tvoid ComputeEulerAngles(const matrix3d &aRotationMatrix, vector3d &EulerAngles)\n\t{\n\t\tdouble r11 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,0);\n\t\tdouble r12 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,1);\n\t\tdouble r13 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,0,2);\n\n\t\tdouble r21 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,1,0);\n\n\t\tdouble r31 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,0);\n\t\tdouble r32 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,1);\n\t\tdouble r33 = MAL_S3x3_MATRIX_ACCESS_I_J(aRotationMatrix,2,2);\n\n\n\t\tif (fabs(fabs(r31)-1.0)>1e-8)\n\t\t{\n\n\t\t\tdouble Y1 = -asin(r31);\n\t\t\tdouble Y2 = M_PI - Y1;\n\t\t\tY2 = fmod(Y2,M_PI);\n\t\t\tdouble c0_1 = cos(Y1);\n\t\t\tdouble c0_2 = cos(Y2);\n\n\t\t\tdouble X1 = atan2(r32\/c0_1,r33\/c0_1);\n\t\t\tdouble X2 = atan2(r32\/c0_2,r33\/c0_2);\n\n\t\t\tdouble c0;\n\t\t\tif (fabs(X1)<fabs(X2))\n\t\t\t{\n\t\t\t\tEulerAngles(1) = Y1;\n\t\t\t\tEulerAngles(0) = X1;\n\t\t\t\tc0 = c0_1;\n\t\t\t}\n\t\t\telse \n\t\t\t{\n\t\t\t\tEulerAngles(1) = Y2;\n\t\t\t\tEulerAngles(0) = X2;\n\t\t\t\tc0 = c0_2;\n\t\t\t}\n\n\t\t\tEulerAngles(2) = atan2(r21\/c0,r11\/c0);\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tEulerAngles(2) = 0;\n\t\t\tdouble d = atan2(r12,r13);\n\t\t\td = fmod(d,M_PI);\n\t\t\tif (fabs(r31+1.0)<1e-8)\n\t\t\t{\n\t\t\t\tEulerAngles(1) = M_PI\/2;\n\t\t\t\tEulerAngles(0) = d;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tEulerAngles(1) = -M_PI\/2;\n\t\t\t\tEulerAngles(0) = -d;\n\t\t\t}\n\t\t}\n\t}\n}\n\nnamespace dynamicsJRLJapan {\n\n GenerateRobotForAMELIF::GenerateRobotForAMELIF()\n {\n }\n\n GenerateRobotForAMELIF::~GenerateRobotForAMELIF()\n {\n }\n\n void GenerateRobotForAMELIF::Header(ostream &os)\n {\n os << \"<!DOCTYPE MultiBody SYSTEM \\\".\/AMELIFMultiBody.xsd\\\">\" << endl;\n }\n\n void GenerateRobotForAMELIF::StaticParameters(CjrlJoint *aJoint,\n\t\t\t\t\t\tostream &os,\n\t\t\t\t\t\tstring &shifttab)\n {\n MAL_S4x4_MATRIX(aTransformation,double);\n MAL_S4x4_MATRIX(FinalTransformation,double);\n aTransformation = aJoint->currentTransformation();\n\n \/* Compute transformation in local coordinates *\/\n CjrlJoint *parentJoint = aJoint->parentJoint();\n if (parentJoint!=0)\n {\n\tMAL_S4x4_MATRIX(parentTransformation,double);\n\tparentTransformation = parentJoint->currentTransformation();\n\n\tMAL_S4x4_MATRIX(invParentTransformation,double);\n\tMAL_S4x4_INVERSE(parentTransformation,invParentTransformation,double);\n\tMAL_S4x4_C_eq_A_by_B(FinalTransformation,invParentTransformation,aTransformation);\n }\n else\n FinalTransformation = aTransformation;\n\n \/* Project rotation axis *\/\n\n matrix3d aRotation;\n vector3d anAxis, EulerAngles;\n for(unsigned int i=0;i<3;i++)\n {\n\tfor(unsigned int j=0;j<3;j++)\n\t MAL_S3x3_MATRIX_ACCESS_I_J(aRotation,i,j) = \n\t MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,i,j);\n }\n\n ComputeEulerAngles(aRotation, EulerAngles);\n\n os << shifttab\n << \" <StaticParameters> \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,0,3) << \" \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,1,3) << \" \"\n << MAL_S4x4_MATRIX_ACCESS_I_J(FinalTransformation,2,3) << \" \"\n << FilterPrecision(EulerAngles(0) * 180.0\/M_PI) << \" \" \n << FilterPrecision(EulerAngles(1) * 180.0\/M_PI) << \" \" \n << FilterPrecision(EulerAngles(2) * 180.0\/M_PI)\n << \"<\/StaticParameters>\"\n\t << std::endl;\n }\n \n void GenerateRobotForAMELIF::GenerateJoint(CjrlJoint *aJoint, \n\t\t\t\t\t ostream &os,\n\t\t\t\t\t string shifttab, unsigned int &gindex)\n {\n\tos.precision(15);\n\tif (aJoint->rankInConfiguration() == 0)\n\t{\n\t\tgindex++;\n\t\t\/\/ Call the sons.\n\t\tfor(unsigned int i=0;i<aJoint->countChildJoints();i++)\n\t\t\tGenerateJoint(aJoint->childJoint(i),os,shifttab,gindex);\n\t\treturn;\n\t}\n\n \/\/ Joint name and type.\n os << shifttab << \"<Joint id=\\\"\" \n << aJoint->rankInConfiguration() ;\n if (gindex==0)\n os << \"\\\" type=\\\"revolute\\\"\";\n else\n os << \"\\\" type=\\\"revolute\\\"\";\n \n os << \" axis=\\\"x\\\" \" ;\n\n if (aJoint->parentJoint()!=0)\n os << \"innerId=\\\"\"<<aJoint->parentJoint()->rankInConfiguration();\n \n os << \"\\\" outerId=\\\"\"<<aJoint->rankInConfiguration()\n << \"\\\"> \" << endl;\n\n \/\/ Label\n os << shifttab << \" <Label>JOINT_\" \n << aJoint->rankInConfiguration() \n << \" <\/Label>\" << endl;\n \n \/\/ Static parameters\n StaticParameters(aJoint, os, shifttab);\n \n \/\/ Position min and max.\n os << shifttab << \" <PositionMin>\"\n << FilterPrecision(aJoint->lowerBound(0) * 180.0\/M_PI)\n <<\"<\/PositionMin>\" << endl;\n \n os << shifttab << \" <PositionMax>\"\n << FilterPrecision(aJoint->upperBound(0) * 180.0\/M_PI)\n << \"<\/PositionMax>\" << endl;\n\n \/\/ Close the joint description\n os << shifttab << \"<\/Joint>\"<< endl;\n\n gindex++;\n\n \/\/ Call the sons.\n for(unsigned int i=0;i<aJoint->countChildJoints();i++)\n {\n\tGenerateJoint(aJoint->childJoint(i),os,shifttab,gindex);\n }\n\n }\n\n void GenerateRobotForAMELIF::GenerateBody(CjrlJoint *aJoint, \n\t\t\t\t\t ostream &os,\n\t\t\t\t\t string shifttab,\n\t\t\t\t\t unsigned int &gindex)\n {\n\tos.precision(15);\n CjrlBody *aBody= aJoint->linkedBody();\n if (aBody==0)\n return;\n\n os << shifttab << \"<Body id=\\\"\" \n << aJoint->rankInConfiguration()\n << \"\\\">\" << endl;\n\n \/\/ Label\n os << shifttab << \" <Label>LINK_\" \n << aJoint->rankInConfiguration()\n << \"<\/Label>\" << endl;\n\n\t\/\/ Mass\n\tconst double mass = aBody->mass();\n os << shifttab << \" <Mass>\"<< mass <<\"<\/Mass>\" << endl;\n\n \/\/ CoM\n const vector3d lcom = aBody->localCenterOfMass();\n os << shifttab << \" <CoM>\" \n << MAL_S3_VECTOR_ACCESS(lcom,0) << \" \" \n << MAL_S3_VECTOR_ACCESS(lcom,1) << \" \"\n << MAL_S3_VECTOR_ACCESS(lcom,2) << \"<\/CoM>\" << endl;\n\n \/\/ Inertia\n os << shifttab << \" <Inertia>\" ;\n matrix3d Inertia = aBody->inertiaMatrix();\n\n for(unsigned int i=0;i<3;i++)\n for(unsigned int j=0;j<3;j++)\n\tos << MAL_S3x3_MATRIX_ACCESS_I_J(Inertia,i,j) << \" \";\n os << \"<\/Inertia>\" << endl;\n\n \/\/ Geometric file.\n\tconst std::vector< std::string > & urls = m_AccessToData[gindex].getURLs();\n\tfor(unsigned i=0; i < urls.size(); ++i)\n\t\tos << shifttab << \" <File>\" << urls[i] << \"<\/File>\" << endl;\n\n gindex++;\n \/\/ Close body description.\n os << shifttab << \"<\/Body>\" << endl;\n\n \/\/ Call the sons.\n for(unsigned int i=0;i<aJoint->countChildJoints();i++)\n {\n\tGenerateBody(aJoint->childJoint(i),os,shifttab,gindex);\n }\n \n }\n\n void GenerateRobotForAMELIF::SetAccessToData(vector<BodyGeometricalData> &AccessToData)\n {\n m_AccessToData = AccessToData;\n }\n\n void GenerateRobotForAMELIF::GenerateBodies(ostream &os,\n\t\t\t\t\t string shifttab)\n {\n CjrlJoint *RootJoint = m_HDR->rootJoint();\n string lshifttab = shifttab+\" \";\n os << shifttab << \"<Bodies>\" << endl;\n unsigned int gindex=0;\n GenerateBody(RootJoint,os, lshifttab,gindex);\n os << shifttab << \"<\/Bodies>\" << endl;\n }\n\n void GenerateRobotForAMELIF::GenerateJoints(ostream &os,\n\t\t\t\t\t string shifttab)\n {\n CjrlJoint *RootJoint = m_HDR->rootJoint();\n string lshifttab = shifttab+\" \";\n os << shifttab << \"<Joints>\" << endl;\n unsigned int gindex=0;\n GenerateJoint(RootJoint,os, lshifttab,gindex);\n os << shifttab << \"<\/Joints>\" << endl;\n }\n\n void GenerateRobotForAMELIF::GenerateRobot(std::string &RobotName,\n\t\t\t\t\t CjrlHumanoidDynamicRobot *aHDR)\n {\n m_HDR = aHDR;\n ofstream aof;\n \n string FileName = RobotName;\n FileName += \".xml\";\n \n aof.open(FileName.c_str(),fstream::out);\n if (!aof.is_open())\n return;\n\n Header(aof);\n\n string shifttab;\n aof << \"<MultiBody>\" << endl;\n shifttab = \" \";\n aof << shifttab << \"<Root id=\\\"0\\\" \/>\" << endl;\n GenerateBodies(aof, shifttab);\n GenerateJoints(aof, shifttab);\n aof << \"<\/MultiBody>\" << endl;\n\n aof.close();\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2010 Nokia Corporation\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <TelepathyQt4\/DBusProxyFactory>\n#include \"TelepathyQt4\/dbus-proxy-factory-internal.h\"\n\n#include \"TelepathyQt4\/_gen\/dbus-proxy-factory-internal.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/Account>\n#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/DBusProxy>\n#include <TelepathyQt4\/Feature>\n#include <TelepathyQt4\/ReadyObject>\n#include <TelepathyQt4\/PendingReady>\n\n#include <QDBusConnection>\n\nnamespace Tp\n{\n\nstruct DBusProxyFactory::Private\n{\n Private(const QDBusConnection &bus)\n : bus(bus), cache(new Cache) {}\n\n ~Private()\n {\n delete cache;\n }\n\n QDBusConnection bus;\n Cache *cache;\n};\n\nDBusProxyFactory::DBusProxyFactory(const QDBusConnection &bus)\n : mPriv(new Private(bus))\n{\n}\n\nDBusProxyFactory::~DBusProxyFactory()\n{\n delete mPriv;\n}\n\nconst QDBusConnection &DBusProxyFactory::dbusConnection() const\n{\n return mPriv->bus;\n}\n\nSharedPtr<RefCounted> DBusProxyFactory::cachedProxy(const QString &busName,\n const QString &objectPath) const\n{\n QString finalName = finalBusNameFrom(busName);\n return mPriv->cache->get(Cache::Key(finalName, objectPath));\n}\n\nPendingReady *DBusProxyFactory::nowHaveProxy(const SharedPtr<RefCounted> &proxy, bool created) const\n{\n Q_ASSERT(!proxy.isNull());\n\n \/\/ I really hate the casts needed in this function - we must really do something about the\n \/\/ DBusProxy class hierarchy so that every DBusProxy(Something) is always a ReadyObject and a\n \/\/ RefCounted, in the API\/ABI break - then most of these proxyMisc-> things become just proxy->\n\n DBusProxy *proxyProxy = dynamic_cast<DBusProxy *>(proxy.data());\n ReadyObject *proxyReady = dynamic_cast<ReadyObject *>(proxy.data());\n\n Features specificFeatures = featuresFor(proxy);\n\n \/\/ TODO: lookup existing prepareOp, if any, from a private mapping\n PendingOperation *prepareOp = NULL;\n\n if (created) {\n mPriv->cache->put(Cache::Key(proxyProxy->busName(), proxyProxy->objectPath()), proxy);\n prepareOp = prepare(proxy);\n \/\/ TODO: insert to private prepare op mapping and make sure it's removed when it finishes\/is\n \/\/ destroyed\n }\n\n if (prepareOp || (!specificFeatures.isEmpty() && !proxyReady->isReady(specificFeatures))) {\n return new PendingReady(prepareOp, specificFeatures, proxy, proxyProxy);\n }\n\n \/\/ No features requested or they are all ready - optimize a bit by not calling ReadinessHelper\n PendingReady *readyOp = new PendingReady(0, specificFeatures, proxy, proxyProxy);\n readyOp->setFinished();\n return readyOp;\n}\n\nPendingOperation *DBusProxyFactory::prepare(const SharedPtr<RefCounted> &object) const\n{\n \/\/ Nothing we could think about needs doing\n return NULL;\n}\n\nDBusProxyFactory::Cache::Cache()\n{\n}\n\nDBusProxyFactory::Cache::~Cache()\n{\n}\n\nSharedPtr<RefCounted> DBusProxyFactory::Cache::get(const Key &key) const\n{\n SharedPtr<RefCounted> counted(proxies.value(key));\n\n if (!counted || !dynamic_cast<DBusProxy *>(counted.data())->isValid()) {\n \/\/ Weak pointer invalidated or proxy invalidated during this mainloop iteration and we still\n \/\/ haven't got the invalidated() signal for it\n return SharedPtr<RefCounted>();\n }\n\n return counted;\n}\n\nvoid DBusProxyFactory::Cache::put(const Key &key, const SharedPtr<RefCounted> &obj)\n{\n Q_ASSERT(!proxies.contains(key));\n\n \/\/ This sucks because DBusProxy is not RefCounted...\n connect(dynamic_cast<DBusProxy*>(obj.data()),\n SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)),\n SLOT(onProxyInvalidated(Tp::DBusProxy*)));\n\n debug() << \"Inserting to factory cache proxy for\" << key;\n\n proxies.insert(key, obj);\n}\n\nvoid DBusProxyFactory::Cache::onProxyInvalidated(Tp::DBusProxy *proxy)\n{\n Key key(proxy->busName(), proxy->objectPath());\n\n \/\/ Not having it would indicate invalidated() signaled twice for the same proxy, or us having\n \/\/ connected to two proxies with the same key, neither of which should happen\n Q_ASSERT(proxies.contains(key));\n\n debug() << \"Removing from factory cache invalidated proxy for\" << key;\n\n proxies.remove(key);\n}\n\nstruct FixedFeatureFactory::Private\n{\n Features features;\n};\n\nFixedFeatureFactory::FixedFeatureFactory(const QDBusConnection &bus)\n : DBusProxyFactory(bus), mPriv(new Private)\n{\n}\n\nFixedFeatureFactory::~FixedFeatureFactory()\n{\n delete mPriv;\n}\n\nFeatures FixedFeatureFactory::features() const\n{\n return mPriv->features;\n}\n\nvoid FixedFeatureFactory::addFeature(const Feature &feature)\n{\n addFeatures(Features(feature));\n}\n\nvoid FixedFeatureFactory::addFeatures(const Features &features)\n{\n mPriv->features.unite(features);\n}\n\nFeatures FixedFeatureFactory::featuresFor(const SharedPtr<RefCounted> &proxy) const\n{\n Q_UNUSED(proxy);\n\n return features();\n}\n\nAccountFactoryPtr AccountFactory::create(const QDBusConnection &bus)\n{\n return AccountFactoryPtr(new AccountFactory(bus));\n}\n\nAccountFactoryPtr AccountFactory::coreFactory(const QDBusConnection &bus)\n{\n AccountFactoryPtr factory(create(bus));\n\n factory->addFeature(Account::FeatureCore);\n\n return factory;\n}\n\nAccountFactory::AccountFactory(const QDBusConnection &bus)\n : FixedFeatureFactory(bus)\n{\n}\n\nAccountFactory::~AccountFactory()\n{\n}\n\nPendingReady *AccountFactory::proxy(const QString &busName, const QString &objectPath,\n const ConnectionFactoryConstPtr &connFactory,\n const ChannelFactoryConstPtr &chanFactory) const\n{\n SharedPtr<RefCounted> proxy = cachedProxy(busName, objectPath);\n if (proxy) {\n return nowHaveProxy(proxy, false);\n }\n\n proxy = Account::create(dbusConnection(), busName, objectPath\/*, connFactory, chanFactory*\/);\n return nowHaveProxy(proxy, true);\n}\n\nQString AccountFactory::finalBusNameFrom(const QString &uniqueOrWellKnown) const\n{\n return uniqueOrWellKnown;\n}\n\nConnectionFactoryPtr ConnectionFactory::create(const QDBusConnection &bus)\n{\n return ConnectionFactoryPtr(new ConnectionFactory(bus));\n}\n\nConnectionFactory::ConnectionFactory(const QDBusConnection &bus)\n : FixedFeatureFactory(bus)\n{\n}\n\nConnectionFactory::~ConnectionFactory()\n{\n}\n\nPendingReady *ConnectionFactory::proxy(const QString &busName, const QString &objectPath,\n const ChannelFactoryConstPtr &chanFactory) const\n{\n SharedPtr<RefCounted> proxy = cachedProxy(busName, objectPath);\n if (proxy) {\n return nowHaveProxy(proxy, false);\n }\n\n proxy = Connection::create(dbusConnection(), busName, objectPath\/*, chanFactory*\/);\n return nowHaveProxy(proxy, true);\n}\n\nQString ConnectionFactory::finalBusNameFrom(const QString &uniqueOrWellKnown) const\n{\n return StatefulDBusProxy::uniqueNameFrom(dbusConnection(), uniqueOrWellKnown);\n}\n\n}\n<commit_msg>Assert on the DBusProxyFactory dynamic_casts succeeding as appropriate<commit_after>\/*\n * This file is part of TelepathyQt4\n *\n * Copyright (C) 2010 Collabora Ltd. <http:\/\/www.collabora.co.uk\/>\n * Copyright (C) 2010 Nokia Corporation\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <TelepathyQt4\/DBusProxyFactory>\n#include \"TelepathyQt4\/dbus-proxy-factory-internal.h\"\n\n#include \"TelepathyQt4\/_gen\/dbus-proxy-factory-internal.moc.hpp\"\n\n#include \"TelepathyQt4\/debug-internal.h\"\n\n#include <TelepathyQt4\/Account>\n#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/DBusProxy>\n#include <TelepathyQt4\/Feature>\n#include <TelepathyQt4\/ReadyObject>\n#include <TelepathyQt4\/PendingReady>\n\n#include <QDBusConnection>\n\nnamespace Tp\n{\n\nstruct DBusProxyFactory::Private\n{\n Private(const QDBusConnection &bus)\n : bus(bus), cache(new Cache) {}\n\n ~Private()\n {\n delete cache;\n }\n\n QDBusConnection bus;\n Cache *cache;\n};\n\nDBusProxyFactory::DBusProxyFactory(const QDBusConnection &bus)\n : mPriv(new Private(bus))\n{\n}\n\nDBusProxyFactory::~DBusProxyFactory()\n{\n delete mPriv;\n}\n\nconst QDBusConnection &DBusProxyFactory::dbusConnection() const\n{\n return mPriv->bus;\n}\n\nSharedPtr<RefCounted> DBusProxyFactory::cachedProxy(const QString &busName,\n const QString &objectPath) const\n{\n QString finalName = finalBusNameFrom(busName);\n return mPriv->cache->get(Cache::Key(finalName, objectPath));\n}\n\nPendingReady *DBusProxyFactory::nowHaveProxy(const SharedPtr<RefCounted> &proxy, bool created) const\n{\n Q_ASSERT(!proxy.isNull());\n\n \/\/ I really hate the casts needed in this function - we must really do something about the\n \/\/ DBusProxy class hierarchy so that every DBusProxy(Something) is always a ReadyObject and a\n \/\/ RefCounted, in the API\/ABI break - then most of these proxyMisc-> things become just proxy->\n\n DBusProxy *proxyProxy = dynamic_cast<DBusProxy *>(proxy.data());\n ReadyObject *proxyReady = dynamic_cast<ReadyObject *>(proxy.data());\n\n Q_ASSERT(proxyProxy != NULL);\n Q_ASSERT(proxyReady != NULL);\n\n Features specificFeatures = featuresFor(proxy);\n\n \/\/ TODO: lookup existing prepareOp, if any, from a private mapping\n PendingOperation *prepareOp = NULL;\n\n if (created) {\n mPriv->cache->put(Cache::Key(proxyProxy->busName(), proxyProxy->objectPath()), proxy);\n prepareOp = prepare(proxy);\n \/\/ TODO: insert to private prepare op mapping and make sure it's removed when it finishes\/is\n \/\/ destroyed\n }\n\n if (prepareOp || (!specificFeatures.isEmpty() && !proxyReady->isReady(specificFeatures))) {\n return new PendingReady(prepareOp, specificFeatures, proxy, proxyProxy);\n }\n\n \/\/ No features requested or they are all ready - optimize a bit by not calling ReadinessHelper\n PendingReady *readyOp = new PendingReady(0, specificFeatures, proxy, proxyProxy);\n readyOp->setFinished();\n return readyOp;\n}\n\nPendingOperation *DBusProxyFactory::prepare(const SharedPtr<RefCounted> &object) const\n{\n \/\/ Nothing we could think about needs doing\n return NULL;\n}\n\nDBusProxyFactory::Cache::Cache()\n{\n}\n\nDBusProxyFactory::Cache::~Cache()\n{\n}\n\nSharedPtr<RefCounted> DBusProxyFactory::Cache::get(const Key &key) const\n{\n SharedPtr<RefCounted> counted(proxies.value(key));\n\n \/\/ We already assert for it being a DBusProxy in put()\n if (!counted || !dynamic_cast<DBusProxy *>(counted.data())->isValid()) {\n \/\/ Weak pointer invalidated or proxy invalidated during this mainloop iteration and we still\n \/\/ haven't got the invalidated() signal for it\n return SharedPtr<RefCounted>();\n }\n\n return counted;\n}\n\nvoid DBusProxyFactory::Cache::put(const Key &key, const SharedPtr<RefCounted> &obj)\n{\n Q_ASSERT(!proxies.contains(key));\n\n DBusProxy *proxyProxy = dynamic_cast<DBusProxy *>(obj.data());\n Q_ASSERT(proxyProxy != NULL);\n\n \/\/ This sucks because DBusProxy is not RefCounted...\n connect(proxyProxy,\n SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)),\n SLOT(onProxyInvalidated(Tp::DBusProxy*)));\n\n debug() << \"Inserting to factory cache proxy for\" << key;\n\n proxies.insert(key, obj);\n}\n\nvoid DBusProxyFactory::Cache::onProxyInvalidated(Tp::DBusProxy *proxy)\n{\n Key key(proxy->busName(), proxy->objectPath());\n\n \/\/ Not having it would indicate invalidated() signaled twice for the same proxy, or us having\n \/\/ connected to two proxies with the same key, neither of which should happen\n Q_ASSERT(proxies.contains(key));\n\n debug() << \"Removing from factory cache invalidated proxy for\" << key;\n\n proxies.remove(key);\n}\n\nstruct FixedFeatureFactory::Private\n{\n Features features;\n};\n\nFixedFeatureFactory::FixedFeatureFactory(const QDBusConnection &bus)\n : DBusProxyFactory(bus), mPriv(new Private)\n{\n}\n\nFixedFeatureFactory::~FixedFeatureFactory()\n{\n delete mPriv;\n}\n\nFeatures FixedFeatureFactory::features() const\n{\n return mPriv->features;\n}\n\nvoid FixedFeatureFactory::addFeature(const Feature &feature)\n{\n addFeatures(Features(feature));\n}\n\nvoid FixedFeatureFactory::addFeatures(const Features &features)\n{\n mPriv->features.unite(features);\n}\n\nFeatures FixedFeatureFactory::featuresFor(const SharedPtr<RefCounted> &proxy) const\n{\n Q_UNUSED(proxy);\n\n return features();\n}\n\nAccountFactoryPtr AccountFactory::create(const QDBusConnection &bus)\n{\n return AccountFactoryPtr(new AccountFactory(bus));\n}\n\nAccountFactoryPtr AccountFactory::coreFactory(const QDBusConnection &bus)\n{\n AccountFactoryPtr factory(create(bus));\n\n factory->addFeature(Account::FeatureCore);\n\n return factory;\n}\n\nAccountFactory::AccountFactory(const QDBusConnection &bus)\n : FixedFeatureFactory(bus)\n{\n}\n\nAccountFactory::~AccountFactory()\n{\n}\n\nPendingReady *AccountFactory::proxy(const QString &busName, const QString &objectPath,\n const ConnectionFactoryConstPtr &connFactory,\n const ChannelFactoryConstPtr &chanFactory) const\n{\n SharedPtr<RefCounted> proxy = cachedProxy(busName, objectPath);\n if (proxy) {\n return nowHaveProxy(proxy, false);\n }\n\n proxy = Account::create(dbusConnection(), busName, objectPath\/*, connFactory, chanFactory*\/);\n return nowHaveProxy(proxy, true);\n}\n\nQString AccountFactory::finalBusNameFrom(const QString &uniqueOrWellKnown) const\n{\n return uniqueOrWellKnown;\n}\n\nConnectionFactoryPtr ConnectionFactory::create(const QDBusConnection &bus)\n{\n return ConnectionFactoryPtr(new ConnectionFactory(bus));\n}\n\nConnectionFactory::ConnectionFactory(const QDBusConnection &bus)\n : FixedFeatureFactory(bus)\n{\n}\n\nConnectionFactory::~ConnectionFactory()\n{\n}\n\nPendingReady *ConnectionFactory::proxy(const QString &busName, const QString &objectPath,\n const ChannelFactoryConstPtr &chanFactory) const\n{\n SharedPtr<RefCounted> proxy = cachedProxy(busName, objectPath);\n if (proxy) {\n return nowHaveProxy(proxy, false);\n }\n\n proxy = Connection::create(dbusConnection(), busName, objectPath\/*, chanFactory*\/);\n return nowHaveProxy(proxy, true);\n}\n\nQString ConnectionFactory::finalBusNameFrom(const QString &uniqueOrWellKnown) const\n{\n return StatefulDBusProxy::uniqueNameFrom(dbusConnection(), uniqueOrWellKnown);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ SceneOSG.cpp\n\/\/\n\/\/ Implementation of vtScene for the OSG library\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"ProjectedShadows.h\"\n\n#include <osg\/LightSource>\n#include <osg\/PolygonMode>\n#include <osg\/Switch>\n#include <osg\/Fog>\n#include <osgDB\/Registry>\n#include <time.h>\t\t\/\/ clock() & CLOCKS_PER_SEC\n\n#ifdef __FreeBSD__\n# include <sys\/types.h>\n# include <sys\/time.h>\n# include <sys\/resource.h>\n#endif\n\n#include <iostream>\n#include \"vtdata\/vtLog.h\"\n\nusing namespace osg;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Trap for OSG messages\n\/\/\n\nclass OsgMsgTrap : public std::streambuf\n{\npublic:\n\tinline virtual int_type overflow(int_type c = std::streambuf::traits_type::eof())\n\t{\n\t\tif (c == std::streambuf::traits_type::eof()) return std::streambuf::traits_type::not_eof(c);\n\t\tg_Log._Log((char) c);\n\t\treturn c;\n\t}\n} g_Trap;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ There is always and only one global vtScene object\nvtScene g_Scene;\n\nvtScene::vtScene() : vtSceneBase()\n{\n\tm_bInitialized = false;\n\tm_bWireframe = false;\n\tm_bWinInfo = false;\n}\n\nvtScene::~vtScene()\n{\n\t\/\/ Do not release camera, that is left for the application.\n}\n\nvtScene *vtGetScene()\n{\n\treturn &g_Scene;\n}\n\nfloat vtGetTime()\n{\n\treturn g_Scene.GetTime();\n}\n\nfloat vtGetFrameTime()\n{\n\treturn g_Scene.GetFrameTime();\n}\n\nvoid vtScene::SetBgColor(RGBf color)\n{\n\tVec4 color2;\n\tv2s(color, color2);\n\tm_pOsgSceneView->setBackgroundColor(color2);\n}\n\nbool vtScene::Init()\n{\n\t\/\/ Redirect cout messages (where OSG sends its messages) to our own log\n\tstd::cout.rdbuf(&g_Trap);\n\tstd::cerr.rdbuf(&g_Trap);\n\n\tSetCamera(new vtCamera());\n\n\tm_pOsgSceneView = new osgUtil::SceneView();\n\tm_pOsgSceneView->setDefaults();\n\n\t\/\/ OSG 0.9.0 and newer\n\tm_pOsgSceneView->setComputeNearFarMode(osgUtil::CullVisitor::DO_NOT_COMPUTE_NEAR_FAR);\n\n\tm_pOsgSceneView->setLightingMode(osgUtil::SceneView::NO_SCENEVIEW_LIGHT);\n\n\t\/\/ OSG 0.9.2 and newer: turn off \"small feature culling\"\n\tm_pOsgSceneView->setCullingMode( m_pOsgSceneView->getCullingMode() & ~osg::CullStack::SMALL_FEATURE_CULLING);\n\n\tm_bInitialized = true;\n\n\t_initialTick = _timer.tick();\n\t_frameTick = _initialTick;\n\n\treturn true;\n}\n\nvoid vtScene::Shutdown()\n{\n\tvtNode::ClearOsgModelCache();\n\tosgDB::Registry::instance()->clearObjectCache();\n}\n\nvoid vtScene::DoUpdate()\n{\n\tif (!m_bInitialized)\n\t\treturn;\n\n\t_lastFrameTick = _frameTick;\n\t_frameTick = _timer.tick();\n\n\tDoEngines();\n\n\t\/\/ As of OSG 0.9.5, we need to store our own camera params and recreate\n\t\/\/ the projection matrix each frame.\n\tfloat aspect;\n\tif (m_WindowSize.x == 0 || m_WindowSize.y == 0)\t\t\/\/ safety\n\t\taspect = 1.0;\n\telse\n\t\taspect = (float) m_WindowSize.x \/ m_WindowSize.y;\n\n\tif (m_pCamera->IsOrtho())\n\t{\n\t\t\/\/ Arguments are left, right, bottom, top, zNear, zFar\n\t\tfloat w2 = m_pCamera->GetWidth() \/2;\n\t\tfloat h2 = w2 \/ aspect;\n\t\tm_pOsgSceneView->setProjectionMatrixAsOrtho(-w2, w2, -h2, h2,\n\t\t\tm_pCamera->GetHither(), m_pCamera->GetYon());\n\t}\n\telse\n\t{\n\t\tfloat fov_x = m_pCamera->GetFOV();\n\t\tfloat a = tan (fov_x\/2);\n\t\tfloat b = a \/ aspect;\n\t\tfloat fov_y_div2 = atan(b);\n\t\tfloat fov_y_deg = RadiansToDegrees(fov_y_div2 * 2);\n\n\t\tm_pOsgSceneView->setProjectionMatrixAsPerspective(fov_y_deg,\n\t\t\taspect, m_pCamera->GetHither(), m_pCamera->GetYon());\n\t}\n\n\t\/\/ And apply the rotation and translation of the camera itself\n\tosg::Matrix &mat2 = m_pCamera->m_pTransform->getMatrix();\n\tosg::Matrix imat;\n\timat.invert(mat2);\n\tm_pOsgSceneView->setViewMatrix(imat);\n\n\tCalcCullPlanes();\n\n\tm_pOsgSceneView->setViewport(0, 0, m_WindowSize.x, m_WindowSize.y);\n\tm_pOsgSceneView->cull();\n\tm_pOsgSceneView->draw();\n}\n\nvoid vtScene::SetRoot(vtGroup *pRoot)\n{\n\tif (pRoot)\n\t\tm_pOsgSceneRoot = pRoot->GetOsgGroup();\n\telse\n\t\tm_pOsgSceneRoot = NULL;\n\tif (m_pOsgSceneView != NULL)\n\t\tm_pOsgSceneView->setSceneData(m_pOsgSceneRoot.get());\n\tm_pRoot = pRoot;\n}\n\n\/**\n * Convert window coordinates (in pixels) to a ray from the camera\n * in world coordinates.\n *\/\nbool vtScene::CameraRay(const IPoint2 &win, FPoint3 &pos, FPoint3 &dir)\n{\n\tVec3 near_point, far_point, diff;\n\n\t\/\/ call the handy OSG function\n\tm_pOsgSceneView->projectWindowXYIntoObject(win.x, m_WindowSize.y-win.y, near_point, far_point);\n\n\tdiff = far_point - near_point;\n\tdiff.normalize();\n\n\ts2v(near_point, pos);\n\ts2v(diff, dir);\n\n\treturn true;\n}\n\n\/\/ Debugging helper\nvoid LogCullPlanes(FPlane *planes)\n{\n\tfor (int i = 0; i < 4; i++)\n\t\tVTLOG(\" plane %d: %.3f %.3f %.3f %.3f\\n\", i, planes[i].x, planes[i].y, planes[i].z, planes[i].w);\n\tVTLOG(\"\\n\");\n}\n\nvoid vtScene::CalcCullPlanes()\n{\n#if 0\n\t\/\/ Non-API-Specific code - will work correctly as long as the Camera\n\t\/\/ methods are fully functional.\n\tFMatrix4 mat;\n\tm_pCamera->GetTransform1(mat);\n\n\tassert(( m_WindowSize.x > 0 ) && ( m_WindowSize.y > 0 ));\n\n\tdouble fov = m_pCamera->GetFOV();\n\n\tdouble aspect = (float)m_WindowSize.y \/ m_WindowSize.x;\n\tdouble hither = m_pCamera->GetHither();\n\n\tdouble a = hither * tan(fov \/ 2);\n\tdouble b = a * aspect;\n\n\tFPoint3 vec_l(-a, 0, -hither);\n\tFPoint3 vec_r(a, 0, -hither);\n\tFPoint3 vec_t(0, b, -hither);\n\tFPoint3 vec_b(0, -b, -hither);\n\n\tvec_l.Normalize();\n\tvec_r.Normalize();\n\tvec_t.Normalize();\n\tvec_b.Normalize();\n\n\tFPoint3 up(0.0f, 1.0f, 0.0f);\n\tFPoint3 right(1.0f, 0.0f, 0.0f);\n\n\tFPoint3 temp;\n\n\tFPoint3 center;\n\tFPoint3 norm_l, norm_r, norm_t, norm_b;\n\n\ttemp = up.Cross(vec_l);\n\tmat.TransformVector(temp, norm_l);\n\n\ttemp = vec_r.Cross(up);\n\tmat.TransformVector(temp, norm_r);\n\n\ttemp = right.Cross(vec_t);\n\tmat.TransformVector(temp, norm_t);\n\n\ttemp = vec_b.Cross(right);\n\tmat.TransformVector(temp, norm_b);\n\n\tmat.Transform(FPoint3(0.0f, 0.0f, 0.0f), center);\n\n\t\/\/ set up m_cullPlanes in world coordinates!\n\tm_cullPlanes[0].Set(center, norm_l);\n\tm_cullPlanes[1].Set(center, norm_r);\n\tm_cullPlanes[2].Set(center, norm_t);\n\tm_cullPlanes[3].Set(center, norm_b);\n#else\n\t\/\/ Get the view frustum clipping planes directly from OSG\n\n\t\/\/ OSG 0.8.44\n\/\/\tconst ClippingVolume &clipvol = pCam->m_pOsgCamera->getClippingVolume();\n\t\/\/ OSG 0.8.45\n\/\/\tconst ClippingVolume &clipvol = hack_global_state->getClippingVolume();\n\t\/\/ OSG 0.9.0\n\t\/\/ clipvol1 is the global camera frustum (in world coordinates)\n\/\/\tconst Polytope &clipvol1 = pCam->m_pOsgCamera->getViewFrustum();\n\t\/\/ OSG 0.9.6\n\t\/\/ clipvol2 is the camera's frustum after it's been transformed to the\n\t\/\/\t\tlocal coordinates.\n\/\/\tconst Polytope &clipvol2 = hack_global_state->getViewFrustum();\n\/\/\tconst Polytope::PlaneList &planes = clipvol2.getPlaneList();\n\t\/\/ Actually no - we can't get the planes from the state, because\n\t\/\/ the state includes the funny modelview matrix used to scale\n\t\/\/ the heightfield. We must get it from the 'scene' instead.\n\n\tosg::Matrixd &_projection = m_pOsgSceneView->getProjectionMatrix();\n\tosg::Matrixd &_modelView = m_pOsgSceneView->getViewMatrix();\n\n\tPolytope tope;\n\ttope.setToUnitFrustum();\n\ttope.transformProvidingInverse((_modelView)*(_projection));\n\n\tconst Polytope::PlaneList &planes = tope.getPlaneList();\n\n\tint i = 0;\n\tfor (Polytope::PlaneList::const_iterator itr=planes.begin();\n\t\titr!=planes.end(); ++itr)\n\t{\n\t\t\/\/ make a copy of the clipping plane\n\t\tPlane plane = *itr;\n\n\t\t\/\/ extract the OSG plane to our own structure\n\t\tVec4 pvec = plane.asVec4();\n\t\tm_cullPlanes[i++].Set(-pvec.x(), -pvec.y(), -pvec.z(), -pvec.w());\n\t}\n#endif\n\n\t\/\/ For debugging\n\/\/\tLogCullPlanes(m_cullPlanes);\n}\n\n\nvoid vtScene::DrawFrameRateChart()\n{\n\tstatic float fps[100];\n\tstatic int s = 0;\n\tfps[s] = GetFrameRate();\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\/\/\tglMatrixMode(GL_PROJECTION);\n\/\/\tglLoadIdentity();\n\n\tglDisable(GL_TEXTURE_2D);\n\tglDisable(GL_LIGHTING);\n\tglColor3f(1.0f, 1.0f, 0.0f);\n\n\tglBegin(GL_LINE_STRIP);\n\tfor (int i = 1; i <= 100; i++)\n\t{\n\t\tglVertex3f(-1.0 + i\/200.0f, -1.0f + fps[(s+i)%100]\/200.0f, 0.0f);\n\t}\n\tglEnd();\n\n\ts++;\n\tif (s == 100) s = 0;\n}\n\nvoid vtScene::SetGlobalWireframe(bool bWire)\n{\n\tm_bWireframe = bWire;\n\n\t\/\/ Set the scene's global PolygonMode attribute, which will affect all\n\t\/\/ other materials in the scene, except those which explicitly override\n\t\/\/ the attribute themselves.\n\tStateSet *global_state = m_pOsgSceneView->getGlobalStateSet();\n\tPolygonMode *npm = new PolygonMode();\n\tif (m_bWireframe)\n\t\tnpm->setMode(PolygonMode::FRONT_AND_BACK, PolygonMode::LINE);\n\telse\n\t\tnpm->setMode(PolygonMode::FRONT_AND_BACK, PolygonMode::FILL);\n\tglobal_state->setAttributeAndModes(npm, StateAttribute::ON);\n}\n\nbool vtScene::GetGlobalWireframe()\n{\n\treturn m_bWireframe;\n}\n\nvoid vtScene::SetShadowedNode(vtTransform *pLight, vtNode *pShadowNode,\n\t\t\t\t\t\t\t vtTransform *pTransform, int iRez)\n{\n\tif (!m_pShadowVisitor.valid())\n\t\tm_pShadowVisitor = new CreateProjectedShadowTextureCullCallback(pShadowNode->GetOsgNode(), iRez);\n\telse\n\t\tm_pShadowVisitor->SetShadower(pShadowNode->GetOsgNode());\n\t\tm_pShadowVisitor->SetInitialLightPosition(v2s(-(pLight->GetDirection()) * 10000));\n\t\tpTransform->GetOsgNode()->setCullCallback(m_pShadowVisitor.get());\n#ifdef _DEBUG\n\t{\n\t\tosg::Group *pGroup = (osg::Group*)pTransform->GetOsgNode();\n\t\tosg::Geode *pGeode = (osg::Geode*)pGroup->getChild(0);\n\t\tosg::Drawable* pDrawable = pGeode->getDrawable(0);\n\t\tpDrawable->setDrawCallback(new MyDrawCallback);\n\t}\n#endif\n}\n\nvoid vtScene::UnsetShadowedNode(vtTransform *pTransform)\n{\n\tpTransform->GetOsgNode()->setCullCallback(NULL);\n#ifdef _DEBUG\n\t{\n\t\tosg::Group *pGroup = (osg::Group*)pTransform->GetOsgNode();\n\t\tosg::Geode *pGeode = (osg::Geode*)pGroup->getChild(0);\n\t\tosg::Drawable* pDrawable = pGeode->getDrawable(0);\n\t\tpDrawable->setDrawCallback(NULL);\n\t}\n#endif\n}\n\nvoid vtScene::UpdateShadowLightDirection(vtTransform *pLight)\n{\n\tif (m_pShadowVisitor.valid())\n\t{\n\t\tm_pShadowVisitor.get()->SetLightPosition(v2s(-(pLight->GetDirection()) * 10000));\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<commit_msg>chg to setClearColor for OSG 0.9.7<commit_after>\/\/\n\/\/ SceneOSG.cpp\n\/\/\n\/\/ Implementation of vtScene for the OSG library\n\/\/\n\/\/ Copyright (c) 2001-2004 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#include \"vtlib\/vtlib.h\"\n#include \"ProjectedShadows.h\"\n\n#include <osg\/LightSource>\n#include <osg\/PolygonMode>\n#include <osg\/Switch>\n#include <osg\/Fog>\n#include <osgDB\/Registry>\n#include <time.h>\t\t\/\/ clock() & CLOCKS_PER_SEC\n\n#ifdef __FreeBSD__\n# include <sys\/types.h>\n# include <sys\/time.h>\n# include <sys\/resource.h>\n#endif\n\n#include <iostream>\n#include \"vtdata\/vtLog.h\"\n\nusing namespace osg;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Trap for OSG messages\n\/\/\n\nclass OsgMsgTrap : public std::streambuf\n{\npublic:\n\tinline virtual int_type overflow(int_type c = std::streambuf::traits_type::eof())\n\t{\n\t\tif (c == std::streambuf::traits_type::eof()) return std::streambuf::traits_type::not_eof(c);\n\t\tg_Log._Log((char) c);\n\t\treturn c;\n\t}\n} g_Trap;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ There is always and only one global vtScene object\nvtScene g_Scene;\n\nvtScene::vtScene() : vtSceneBase()\n{\n\tm_bInitialized = false;\n\tm_bWireframe = false;\n\tm_bWinInfo = false;\n}\n\nvtScene::~vtScene()\n{\n\t\/\/ Do not release camera, that is left for the application.\n}\n\nvtScene *vtGetScene()\n{\n\treturn &g_Scene;\n}\n\nfloat vtGetTime()\n{\n\treturn g_Scene.GetTime();\n}\n\nfloat vtGetFrameTime()\n{\n\treturn g_Scene.GetFrameTime();\n}\n\nvoid vtScene::SetBgColor(RGBf color)\n{\n\tVec4 color2;\n\tv2s(color, color2);\n\tm_pOsgSceneView->setClearColor(color2);\n}\n\nbool vtScene::Init()\n{\n\t\/\/ Redirect cout messages (where OSG sends its messages) to our own log\n\tstd::cout.rdbuf(&g_Trap);\n\tstd::cerr.rdbuf(&g_Trap);\n\n\tSetCamera(new vtCamera());\n\n\tm_pOsgSceneView = new osgUtil::SceneView();\n\tm_pOsgSceneView->setDefaults();\n\n\t\/\/ OSG 0.9.0 and newer\n\tm_pOsgSceneView->setComputeNearFarMode(osgUtil::CullVisitor::DO_NOT_COMPUTE_NEAR_FAR);\n\n\tm_pOsgSceneView->setLightingMode(osgUtil::SceneView::NO_SCENEVIEW_LIGHT);\n\n\t\/\/ OSG 0.9.2 and newer: turn off \"small feature culling\"\n\tm_pOsgSceneView->setCullingMode( m_pOsgSceneView->getCullingMode() & ~osg::CullStack::SMALL_FEATURE_CULLING);\n\n\tm_bInitialized = true;\n\n\t_initialTick = _timer.tick();\n\t_frameTick = _initialTick;\n\n\treturn true;\n}\n\nvoid vtScene::Shutdown()\n{\n\tvtNode::ClearOsgModelCache();\n\tosgDB::Registry::instance()->clearObjectCache();\n}\n\nvoid vtScene::DoUpdate()\n{\n\tif (!m_bInitialized)\n\t\treturn;\n\n\t_lastFrameTick = _frameTick;\n\t_frameTick = _timer.tick();\n\n\tDoEngines();\n\n\t\/\/ As of OSG 0.9.5, we need to store our own camera params and recreate\n\t\/\/ the projection matrix each frame.\n\tfloat aspect;\n\tif (m_WindowSize.x == 0 || m_WindowSize.y == 0)\t\t\/\/ safety\n\t\taspect = 1.0;\n\telse\n\t\taspect = (float) m_WindowSize.x \/ m_WindowSize.y;\n\n\tif (m_pCamera->IsOrtho())\n\t{\n\t\t\/\/ Arguments are left, right, bottom, top, zNear, zFar\n\t\tfloat w2 = m_pCamera->GetWidth() \/2;\n\t\tfloat h2 = w2 \/ aspect;\n\t\tm_pOsgSceneView->setProjectionMatrixAsOrtho(-w2, w2, -h2, h2,\n\t\t\tm_pCamera->GetHither(), m_pCamera->GetYon());\n\t}\n\telse\n\t{\n\t\tfloat fov_x = m_pCamera->GetFOV();\n\t\tfloat a = tan (fov_x\/2);\n\t\tfloat b = a \/ aspect;\n\t\tfloat fov_y_div2 = atan(b);\n\t\tfloat fov_y_deg = RadiansToDegrees(fov_y_div2 * 2);\n\n\t\tm_pOsgSceneView->setProjectionMatrixAsPerspective(fov_y_deg,\n\t\t\taspect, m_pCamera->GetHither(), m_pCamera->GetYon());\n\t}\n\n\t\/\/ And apply the rotation and translation of the camera itself\n\tosg::Matrix &mat2 = m_pCamera->m_pTransform->getMatrix();\n\tosg::Matrix imat;\n\timat.invert(mat2);\n\tm_pOsgSceneView->setViewMatrix(imat);\n\n\tCalcCullPlanes();\n\n\tm_pOsgSceneView->setViewport(0, 0, m_WindowSize.x, m_WindowSize.y);\n\tm_pOsgSceneView->cull();\n\tm_pOsgSceneView->draw();\n}\n\nvoid vtScene::SetRoot(vtGroup *pRoot)\n{\n\tif (pRoot)\n\t\tm_pOsgSceneRoot = pRoot->GetOsgGroup();\n\telse\n\t\tm_pOsgSceneRoot = NULL;\n\tif (m_pOsgSceneView != NULL)\n\t\tm_pOsgSceneView->setSceneData(m_pOsgSceneRoot.get());\n\tm_pRoot = pRoot;\n}\n\n\/**\n * Convert window coordinates (in pixels) to a ray from the camera\n * in world coordinates.\n *\/\nbool vtScene::CameraRay(const IPoint2 &win, FPoint3 &pos, FPoint3 &dir)\n{\n\tVec3 near_point, far_point, diff;\n\n\t\/\/ call the handy OSG function\n\tm_pOsgSceneView->projectWindowXYIntoObject(win.x, m_WindowSize.y-win.y, near_point, far_point);\n\n\tdiff = far_point - near_point;\n\tdiff.normalize();\n\n\ts2v(near_point, pos);\n\ts2v(diff, dir);\n\n\treturn true;\n}\n\n\/\/ Debugging helper\nvoid LogCullPlanes(FPlane *planes)\n{\n\tfor (int i = 0; i < 4; i++)\n\t\tVTLOG(\" plane %d: %.3f %.3f %.3f %.3f\\n\", i, planes[i].x, planes[i].y, planes[i].z, planes[i].w);\n\tVTLOG(\"\\n\");\n}\n\nvoid vtScene::CalcCullPlanes()\n{\n#if 0\n\t\/\/ Non-API-Specific code - will work correctly as long as the Camera\n\t\/\/ methods are fully functional.\n\tFMatrix4 mat;\n\tm_pCamera->GetTransform1(mat);\n\n\tassert(( m_WindowSize.x > 0 ) && ( m_WindowSize.y > 0 ));\n\n\tdouble fov = m_pCamera->GetFOV();\n\n\tdouble aspect = (float)m_WindowSize.y \/ m_WindowSize.x;\n\tdouble hither = m_pCamera->GetHither();\n\n\tdouble a = hither * tan(fov \/ 2);\n\tdouble b = a * aspect;\n\n\tFPoint3 vec_l(-a, 0, -hither);\n\tFPoint3 vec_r(a, 0, -hither);\n\tFPoint3 vec_t(0, b, -hither);\n\tFPoint3 vec_b(0, -b, -hither);\n\n\tvec_l.Normalize();\n\tvec_r.Normalize();\n\tvec_t.Normalize();\n\tvec_b.Normalize();\n\n\tFPoint3 up(0.0f, 1.0f, 0.0f);\n\tFPoint3 right(1.0f, 0.0f, 0.0f);\n\n\tFPoint3 temp;\n\n\tFPoint3 center;\n\tFPoint3 norm_l, norm_r, norm_t, norm_b;\n\n\ttemp = up.Cross(vec_l);\n\tmat.TransformVector(temp, norm_l);\n\n\ttemp = vec_r.Cross(up);\n\tmat.TransformVector(temp, norm_r);\n\n\ttemp = right.Cross(vec_t);\n\tmat.TransformVector(temp, norm_t);\n\n\ttemp = vec_b.Cross(right);\n\tmat.TransformVector(temp, norm_b);\n\n\tmat.Transform(FPoint3(0.0f, 0.0f, 0.0f), center);\n\n\t\/\/ set up m_cullPlanes in world coordinates!\n\tm_cullPlanes[0].Set(center, norm_l);\n\tm_cullPlanes[1].Set(center, norm_r);\n\tm_cullPlanes[2].Set(center, norm_t);\n\tm_cullPlanes[3].Set(center, norm_b);\n#else\n\t\/\/ Get the view frustum clipping planes directly from OSG\n\n\t\/\/ OSG 0.8.44\n\/\/\tconst ClippingVolume &clipvol = pCam->m_pOsgCamera->getClippingVolume();\n\t\/\/ OSG 0.8.45\n\/\/\tconst ClippingVolume &clipvol = hack_global_state->getClippingVolume();\n\t\/\/ OSG 0.9.0\n\t\/\/ clipvol1 is the global camera frustum (in world coordinates)\n\/\/\tconst Polytope &clipvol1 = pCam->m_pOsgCamera->getViewFrustum();\n\t\/\/ OSG 0.9.6\n\t\/\/ clipvol2 is the camera's frustum after it's been transformed to the\n\t\/\/\t\tlocal coordinates.\n\/\/\tconst Polytope &clipvol2 = hack_global_state->getViewFrustum();\n\/\/\tconst Polytope::PlaneList &planes = clipvol2.getPlaneList();\n\t\/\/ Actually no - we can't get the planes from the state, because\n\t\/\/ the state includes the funny modelview matrix used to scale\n\t\/\/ the heightfield. We must get it from the 'scene' instead.\n\n\tosg::Matrixd &_projection = m_pOsgSceneView->getProjectionMatrix();\n\tosg::Matrixd &_modelView = m_pOsgSceneView->getViewMatrix();\n\n\tPolytope tope;\n\ttope.setToUnitFrustum();\n\ttope.transformProvidingInverse((_modelView)*(_projection));\n\n\tconst Polytope::PlaneList &planes = tope.getPlaneList();\n\n\tint i = 0;\n\tfor (Polytope::PlaneList::const_iterator itr=planes.begin();\n\t\titr!=planes.end(); ++itr)\n\t{\n\t\t\/\/ make a copy of the clipping plane\n\t\tPlane plane = *itr;\n\n\t\t\/\/ extract the OSG plane to our own structure\n\t\tVec4 pvec = plane.asVec4();\n\t\tm_cullPlanes[i++].Set(-pvec.x(), -pvec.y(), -pvec.z(), -pvec.w());\n\t}\n#endif\n\n\t\/\/ For debugging\n\/\/\tLogCullPlanes(m_cullPlanes);\n}\n\n\nvoid vtScene::DrawFrameRateChart()\n{\n\tstatic float fps[100];\n\tstatic int s = 0;\n\tfps[s] = GetFrameRate();\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\/\/\tglMatrixMode(GL_PROJECTION);\n\/\/\tglLoadIdentity();\n\n\tglDisable(GL_TEXTURE_2D);\n\tglDisable(GL_LIGHTING);\n\tglColor3f(1.0f, 1.0f, 0.0f);\n\n\tglBegin(GL_LINE_STRIP);\n\tfor (int i = 1; i <= 100; i++)\n\t{\n\t\tglVertex3f(-1.0 + i\/200.0f, -1.0f + fps[(s+i)%100]\/200.0f, 0.0f);\n\t}\n\tglEnd();\n\n\ts++;\n\tif (s == 100) s = 0;\n}\n\nvoid vtScene::SetGlobalWireframe(bool bWire)\n{\n\tm_bWireframe = bWire;\n\n\t\/\/ Set the scene's global PolygonMode attribute, which will affect all\n\t\/\/ other materials in the scene, except those which explicitly override\n\t\/\/ the attribute themselves.\n\tStateSet *global_state = m_pOsgSceneView->getGlobalStateSet();\n\tPolygonMode *npm = new PolygonMode();\n\tif (m_bWireframe)\n\t\tnpm->setMode(PolygonMode::FRONT_AND_BACK, PolygonMode::LINE);\n\telse\n\t\tnpm->setMode(PolygonMode::FRONT_AND_BACK, PolygonMode::FILL);\n\tglobal_state->setAttributeAndModes(npm, StateAttribute::ON);\n}\n\nbool vtScene::GetGlobalWireframe()\n{\n\treturn m_bWireframe;\n}\n\nvoid vtScene::SetShadowedNode(vtTransform *pLight, vtNode *pShadowNode,\n\t\t\t\t\t\t\t vtTransform *pTransform, int iRez)\n{\n\tif (!m_pShadowVisitor.valid())\n\t\tm_pShadowVisitor = new CreateProjectedShadowTextureCullCallback(pShadowNode->GetOsgNode(), iRez);\n\telse\n\t\tm_pShadowVisitor->SetShadower(pShadowNode->GetOsgNode());\n\t\tm_pShadowVisitor->SetInitialLightPosition(v2s(-(pLight->GetDirection()) * 10000));\n\t\tpTransform->GetOsgNode()->setCullCallback(m_pShadowVisitor.get());\n#ifdef _DEBUG\n\t{\n\t\tosg::Group *pGroup = (osg::Group*)pTransform->GetOsgNode();\n\t\tosg::Geode *pGeode = (osg::Geode*)pGroup->getChild(0);\n\t\tosg::Drawable* pDrawable = pGeode->getDrawable(0);\n\t\tpDrawable->setDrawCallback(new MyDrawCallback);\n\t}\n#endif\n}\n\nvoid vtScene::UnsetShadowedNode(vtTransform *pTransform)\n{\n\tpTransform->GetOsgNode()->setCullCallback(NULL);\n#ifdef _DEBUG\n\t{\n\t\tosg::Group *pGroup = (osg::Group*)pTransform->GetOsgNode();\n\t\tosg::Geode *pGeode = (osg::Geode*)pGroup->getChild(0);\n\t\tosg::Drawable* pDrawable = pGeode->getDrawable(0);\n\t\tpDrawable->setDrawCallback(NULL);\n\t}\n#endif\n}\n\nvoid vtScene::UpdateShadowLightDirection(vtTransform *pLight)\n{\n\tif (m_pShadowVisitor.valid())\n\t{\n\t\tm_pShadowVisitor.get()->SetLightPosition(v2s(-(pLight->GetDirection()) * 10000));\n\t}\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 Jens-Michael Hoffmann <jmho@c-xx.com>\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include \"TileLoader.h\"\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QMetaType>\n#include <QtGui\/QImage>\n\n#include \"GeoSceneTexture.h\"\n#include \"HttpDownloadManager.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleDirs.h\"\n#include \"TileLoaderHelper.h\"\n\nQ_DECLARE_METATYPE( Marble::DownloadUsage )\n\nnamespace Marble\n{\n\nTileLoader::TileLoader( HttpDownloadManager * const downloadManager )\n{\n qRegisterMetaType<DownloadUsage>( \"DownloadUsage\" );\n connect( this, SIGNAL( downloadTile( QUrl, QString, QString, DownloadUsage )),\n downloadManager, SLOT( addJob( QUrl, QString, QString, DownloadUsage )));\n connect( downloadManager, SIGNAL( downloadComplete( QByteArray, QString )),\n SLOT( updateTile( QByteArray, QString )));\n}\n\nvoid TileLoader::setTextureLayers( const QVector<const GeoSceneTexture *> &textureLayers )\n{\n foreach ( const GeoSceneTexture *texture, textureLayers ) {\n const uint hash = qHash( texture->sourceDir() );\n m_textureLayers.insert( hash, texture );\n }\n}\n\n\/\/ If the tile is locally available:\n\/\/ - if not expired: create TextureTile, set state to \"uptodate\", return it => done\n\/\/ - if expired: create TextureTile, state is set to Expired by default, trigger dl,\n\nQImage TileLoader::loadTile( GeoSceneTexture const *textureLayer, TileId const & tileId, DownloadUsage const usage )\n{\n QString const fileName = tileFileName( textureLayer, tileId );\n TileStatus status = tileStatus( textureLayer, tileId );\n if ( status != Missing ) {\n \/\/ check if an update should be triggered\n\n if ( status == Available ) {\n mDebug() << Q_FUNC_INFO << tileId << \"StateUptodate\";\n } else {\n Q_ASSERT( status == Expired );\n mDebug() << Q_FUNC_INFO << tileId << \"StateExpired\";\n triggerDownload( textureLayer, tileId, usage );\n }\n\n QImage const image( fileName );\n if ( !image.isNull() ) {\n \/\/ file is there, so create and return a tile object in any case\n return image;\n }\n }\n\n \/\/ tile was not locally available => trigger download and look for tiles in other levels\n \/\/ for scaling\n QImage replacementTile = scaledLowerLevelTile( tileId );\n Q_ASSERT( !replacementTile.isNull() );\n\n triggerDownload( textureLayer, tileId, usage );\n\n return replacementTile;\n}\n\n\/\/ This method triggers a download of the given tile (without checking\n\/\/ expiration). It is called by upper layer (StackedTileLoader) when the tile\n\/\/ that should be reloaded is currently loaded in memory.\n\/\/\n\/\/ post condition\n\/\/ - download is triggered\nvoid TileLoader::downloadTile( GeoSceneTexture const *textureLayer, TileId const &tileId, DownloadUsage const usage )\n{\n triggerDownload( textureLayer, tileId, usage );\n}\n\nint TileLoader::maximumTileLevel( GeoSceneTexture const & texture )\n{\n \/\/ if maximum tile level is configured in the DGML files,\n \/\/ then use it, otherwise use old detection code.\n if ( texture.maximumTileLevel() >= 0 ) {\n return texture.maximumTileLevel();\n }\n\n int maximumTileLevel = -1;\n const QFileInfo themeStr( texture.themeStr() );\n const QString tilepath = themeStr.isAbsolute() ? themeStr.absoluteFilePath() : MarbleDirs::path( texture.themeStr() );\n \/\/ mDebug() << \"StackedTileLoader::maxPartialTileLevel tilepath\" << tilepath;\n QStringList leveldirs = QDir( tilepath ).entryList( QDir::AllDirs | QDir::NoSymLinks\n | QDir::NoDotAndDotDot );\n\n QStringList::const_iterator it = leveldirs.constBegin();\n QStringList::const_iterator const end = leveldirs.constEnd();\n for (; it != end; ++it ) {\n bool ok = true;\n const int value = (*it).toInt( &ok, 10 );\n\n if ( ok && value > maximumTileLevel )\n maximumTileLevel = value;\n }\n\n \/\/ mDebug() << \"Detected maximum tile level that contains data: \"\n \/\/ << maxtilelevel;\n return maximumTileLevel + 1;\n}\n\nbool TileLoader::baseTilesAvailable( GeoSceneTexture const & texture )\n{\n const int levelZeroColumns = texture.levelZeroColumns();\n const int levelZeroRows = texture.levelZeroRows();\n\n bool result = true;\n\n \/\/ Check whether the tiles from the lowest texture level are available\n \/\/\n for ( int column = 0; result && column < levelZeroColumns; ++column ) {\n for ( int row = 0; result && row < levelZeroRows; ++row ) {\n const TileId id( texture.sourceDir(), 0, column, row );\n const QString tilepath = tileFileName( &texture, id );\n result &= QFile::exists( tilepath );\n }\n }\n\n return result;\n}\n\nTileLoader::TileStatus TileLoader::tileStatus( GeoSceneTexture const *textureLayer, const TileId &tileId )\n{\n QString const fileName = tileFileName( textureLayer, tileId );\n QFileInfo fileInfo( fileName );\n if ( !fileInfo.exists() ) {\n return Missing;\n }\n\n const QDateTime lastModified = fileInfo.lastModified();\n const int expireSecs = textureLayer->expire();\n const bool isExpired = lastModified.secsTo( QDateTime::currentDateTime() ) >= expireSecs;\n return isExpired ? Expired : Available;\n}\n\nvoid TileLoader::updateTile( QByteArray const & data, QString const & tileId )\n{\n TileId const id = TileId::fromString( tileId );\n\n QImage const tileImage = QImage::fromData( data );\n if ( tileImage.isNull() )\n return;\n\n emit tileCompleted( id, tileImage );\n}\n\ninline GeoSceneTexture const * TileLoader::findTextureLayer( TileId const & id ) const\n{\n GeoSceneTexture const * const textureLayer = m_textureLayers.value( id.mapThemeIdHash(), 0 );\n Q_ASSERT( textureLayer );\n return textureLayer;\n}\n\nQString TileLoader::tileFileName( GeoSceneTexture const * textureLayer, TileId const & tileId )\n{\n QString const fileName = textureLayer->relativeTileFileName( tileId );\n QFileInfo const dirInfo( fileName );\n return dirInfo.isAbsolute() ? fileName : MarbleDirs::path( fileName );\n}\n\nvoid TileLoader::triggerDownload( GeoSceneTexture const *textureLayer, TileId const &id, DownloadUsage const usage )\n{\n QUrl const sourceUrl = textureLayer->downloadUrl( id );\n QString const destFileName = textureLayer->relativeTileFileName( id );\n emit downloadTile( sourceUrl, destFileName, id.toString(), usage );\n}\n\nQImage TileLoader::scaledLowerLevelTile( TileId const & id ) const\n{\n mDebug() << Q_FUNC_INFO << id;\n GeoSceneTexture const * const textureLayer = findTextureLayer( id );\n\n for ( int level = qMax<int>( 0, id.zoomLevel() - 1 ); level >= 0; --level ) {\n int const deltaLevel = id.zoomLevel() - level;\n TileId const replacementTileId( id.mapThemeIdHash(), level,\n id.x() >> deltaLevel, id.y() >> deltaLevel );\n QString const fileName = tileFileName( textureLayer, replacementTileId );\n mDebug() << \"TileLoader::scaledLowerLevelTile\" << \"trying\" << fileName;\n QImage toScale( fileName );\n\n if ( level == 0 && toScale.isNull() ) {\n mDebug() << \"No level zero tile installed in map theme dir. Falling back to a transparent image for now.\";\n GeoSceneTexture const * const textureLayer = findTextureLayer( replacementTileId );\n QSize tileSize = textureLayer->tileSize();\n Q_ASSERT( !tileSize.isEmpty() ); \/\/ assured by textureLayer\n toScale = QImage( tileSize, QImage::Format_ARGB32_Premultiplied );\n toScale.fill( qRgba( 0, 0, 0, 0 ) );\n }\n\n if ( !toScale.isNull() ) {\n \/\/ which rect to scale?\n int const restTileX = id.x() % ( 1 << deltaLevel );\n int const restTileY = id.y() % ( 1 << deltaLevel );\n int const partWidth = toScale.width() >> deltaLevel;\n int const partHeight = toScale.height() >> deltaLevel;\n int const startX = restTileX * partWidth;\n int const startY = restTileY * partHeight;\n mDebug() << \"QImage::copy:\" << startX << startY << partWidth << partHeight;\n QImage const part = toScale.copy( startX, startY, partWidth, partHeight );\n mDebug() << \"QImage::scaled:\" << toScale.size();\n return part.scaled( toScale.size() );\n }\n }\n\n Q_ASSERT_X( false, \"scaled image\", \"level zero image missing\" ); \/\/ not reached\n return QImage();\n}\n\n}\n\n#include \"TileLoader.moc\"\n<commit_msg>reuse textureLayer from above<commit_after>\/\/ Copyright 2010 Jens-Michael Hoffmann <jmho@c-xx.com>\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#include \"TileLoader.h\"\n\n#include <QtCore\/QDateTime>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QMetaType>\n#include <QtGui\/QImage>\n\n#include \"GeoSceneTexture.h\"\n#include \"HttpDownloadManager.h\"\n#include \"MarbleDebug.h\"\n#include \"MarbleDirs.h\"\n#include \"TileLoaderHelper.h\"\n\nQ_DECLARE_METATYPE( Marble::DownloadUsage )\n\nnamespace Marble\n{\n\nTileLoader::TileLoader( HttpDownloadManager * const downloadManager )\n{\n qRegisterMetaType<DownloadUsage>( \"DownloadUsage\" );\n connect( this, SIGNAL( downloadTile( QUrl, QString, QString, DownloadUsage )),\n downloadManager, SLOT( addJob( QUrl, QString, QString, DownloadUsage )));\n connect( downloadManager, SIGNAL( downloadComplete( QByteArray, QString )),\n SLOT( updateTile( QByteArray, QString )));\n}\n\nvoid TileLoader::setTextureLayers( const QVector<const GeoSceneTexture *> &textureLayers )\n{\n foreach ( const GeoSceneTexture *texture, textureLayers ) {\n const uint hash = qHash( texture->sourceDir() );\n m_textureLayers.insert( hash, texture );\n }\n}\n\n\/\/ If the tile is locally available:\n\/\/ - if not expired: create TextureTile, set state to \"uptodate\", return it => done\n\/\/ - if expired: create TextureTile, state is set to Expired by default, trigger dl,\n\nQImage TileLoader::loadTile( GeoSceneTexture const *textureLayer, TileId const & tileId, DownloadUsage const usage )\n{\n QString const fileName = tileFileName( textureLayer, tileId );\n TileStatus status = tileStatus( textureLayer, tileId );\n if ( status != Missing ) {\n \/\/ check if an update should be triggered\n\n if ( status == Available ) {\n mDebug() << Q_FUNC_INFO << tileId << \"StateUptodate\";\n } else {\n Q_ASSERT( status == Expired );\n mDebug() << Q_FUNC_INFO << tileId << \"StateExpired\";\n triggerDownload( textureLayer, tileId, usage );\n }\n\n QImage const image( fileName );\n if ( !image.isNull() ) {\n \/\/ file is there, so create and return a tile object in any case\n return image;\n }\n }\n\n \/\/ tile was not locally available => trigger download and look for tiles in other levels\n \/\/ for scaling\n QImage replacementTile = scaledLowerLevelTile( tileId );\n Q_ASSERT( !replacementTile.isNull() );\n\n triggerDownload( textureLayer, tileId, usage );\n\n return replacementTile;\n}\n\n\/\/ This method triggers a download of the given tile (without checking\n\/\/ expiration). It is called by upper layer (StackedTileLoader) when the tile\n\/\/ that should be reloaded is currently loaded in memory.\n\/\/\n\/\/ post condition\n\/\/ - download is triggered\nvoid TileLoader::downloadTile( GeoSceneTexture const *textureLayer, TileId const &tileId, DownloadUsage const usage )\n{\n triggerDownload( textureLayer, tileId, usage );\n}\n\nint TileLoader::maximumTileLevel( GeoSceneTexture const & texture )\n{\n \/\/ if maximum tile level is configured in the DGML files,\n \/\/ then use it, otherwise use old detection code.\n if ( texture.maximumTileLevel() >= 0 ) {\n return texture.maximumTileLevel();\n }\n\n int maximumTileLevel = -1;\n const QFileInfo themeStr( texture.themeStr() );\n const QString tilepath = themeStr.isAbsolute() ? themeStr.absoluteFilePath() : MarbleDirs::path( texture.themeStr() );\n \/\/ mDebug() << \"StackedTileLoader::maxPartialTileLevel tilepath\" << tilepath;\n QStringList leveldirs = QDir( tilepath ).entryList( QDir::AllDirs | QDir::NoSymLinks\n | QDir::NoDotAndDotDot );\n\n QStringList::const_iterator it = leveldirs.constBegin();\n QStringList::const_iterator const end = leveldirs.constEnd();\n for (; it != end; ++it ) {\n bool ok = true;\n const int value = (*it).toInt( &ok, 10 );\n\n if ( ok && value > maximumTileLevel )\n maximumTileLevel = value;\n }\n\n \/\/ mDebug() << \"Detected maximum tile level that contains data: \"\n \/\/ << maxtilelevel;\n return maximumTileLevel + 1;\n}\n\nbool TileLoader::baseTilesAvailable( GeoSceneTexture const & texture )\n{\n const int levelZeroColumns = texture.levelZeroColumns();\n const int levelZeroRows = texture.levelZeroRows();\n\n bool result = true;\n\n \/\/ Check whether the tiles from the lowest texture level are available\n \/\/\n for ( int column = 0; result && column < levelZeroColumns; ++column ) {\n for ( int row = 0; result && row < levelZeroRows; ++row ) {\n const TileId id( texture.sourceDir(), 0, column, row );\n const QString tilepath = tileFileName( &texture, id );\n result &= QFile::exists( tilepath );\n }\n }\n\n return result;\n}\n\nTileLoader::TileStatus TileLoader::tileStatus( GeoSceneTexture const *textureLayer, const TileId &tileId )\n{\n QString const fileName = tileFileName( textureLayer, tileId );\n QFileInfo fileInfo( fileName );\n if ( !fileInfo.exists() ) {\n return Missing;\n }\n\n const QDateTime lastModified = fileInfo.lastModified();\n const int expireSecs = textureLayer->expire();\n const bool isExpired = lastModified.secsTo( QDateTime::currentDateTime() ) >= expireSecs;\n return isExpired ? Expired : Available;\n}\n\nvoid TileLoader::updateTile( QByteArray const & data, QString const & tileId )\n{\n TileId const id = TileId::fromString( tileId );\n\n QImage const tileImage = QImage::fromData( data );\n if ( tileImage.isNull() )\n return;\n\n emit tileCompleted( id, tileImage );\n}\n\ninline GeoSceneTexture const * TileLoader::findTextureLayer( TileId const & id ) const\n{\n GeoSceneTexture const * const textureLayer = m_textureLayers.value( id.mapThemeIdHash(), 0 );\n Q_ASSERT( textureLayer );\n return textureLayer;\n}\n\nQString TileLoader::tileFileName( GeoSceneTexture const * textureLayer, TileId const & tileId )\n{\n QString const fileName = textureLayer->relativeTileFileName( tileId );\n QFileInfo const dirInfo( fileName );\n return dirInfo.isAbsolute() ? fileName : MarbleDirs::path( fileName );\n}\n\nvoid TileLoader::triggerDownload( GeoSceneTexture const *textureLayer, TileId const &id, DownloadUsage const usage )\n{\n QUrl const sourceUrl = textureLayer->downloadUrl( id );\n QString const destFileName = textureLayer->relativeTileFileName( id );\n emit downloadTile( sourceUrl, destFileName, id.toString(), usage );\n}\n\nQImage TileLoader::scaledLowerLevelTile( TileId const & id ) const\n{\n mDebug() << Q_FUNC_INFO << id;\n GeoSceneTexture const * const textureLayer = findTextureLayer( id );\n\n for ( int level = qMax<int>( 0, id.zoomLevel() - 1 ); level >= 0; --level ) {\n int const deltaLevel = id.zoomLevel() - level;\n TileId const replacementTileId( id.mapThemeIdHash(), level,\n id.x() >> deltaLevel, id.y() >> deltaLevel );\n QString const fileName = tileFileName( textureLayer, replacementTileId );\n mDebug() << \"TileLoader::scaledLowerLevelTile\" << \"trying\" << fileName;\n QImage toScale( fileName );\n\n if ( level == 0 && toScale.isNull() ) {\n mDebug() << \"No level zero tile installed in map theme dir. Falling back to a transparent image for now.\";\n QSize tileSize = textureLayer->tileSize();\n Q_ASSERT( !tileSize.isEmpty() ); \/\/ assured by textureLayer\n toScale = QImage( tileSize, QImage::Format_ARGB32_Premultiplied );\n toScale.fill( qRgba( 0, 0, 0, 0 ) );\n }\n\n if ( !toScale.isNull() ) {\n \/\/ which rect to scale?\n int const restTileX = id.x() % ( 1 << deltaLevel );\n int const restTileY = id.y() % ( 1 << deltaLevel );\n int const partWidth = toScale.width() >> deltaLevel;\n int const partHeight = toScale.height() >> deltaLevel;\n int const startX = restTileX * partWidth;\n int const startY = restTileY * partHeight;\n mDebug() << \"QImage::copy:\" << startX << startY << partWidth << partHeight;\n QImage const part = toScale.copy( startX, startY, partWidth, partHeight );\n mDebug() << \"QImage::scaled:\" << toScale.size();\n return part.scaled( toScale.size() );\n }\n }\n\n Q_ASSERT_X( false, \"scaled image\", \"level zero image missing\" ); \/\/ not reached\n return QImage();\n}\n\n}\n\n#include \"TileLoader.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2016 Volker Krause <vkrause@kde.org>\n\n This program is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This program is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"downloader.h\"\n#include \"definition.h\"\n#include \"repository.h\"\n\n#include <QDebug>\n#include <QDir>\n#include <QFile>\n#include <QNetworkAccessManager>\n#include <QNetworkReply>\n#include <QNetworkRequest>\n#include <QStandardPaths>\n#include <QTimer>\n#include <QXmlStreamReader>\n\nusing namespace SyntaxHighlighting;\n\nDownloader::Downloader(Repository *repo, QObject *parent) :\n QObject(parent),\n m_repo(repo),\n m_nam(new QNetworkAccessManager(this)),\n m_pendingDownloads(0)\n{\n Q_ASSERT(repo);\n\n m_downloadLocation = QStandardPaths::writableLocation(QStandardPaths::GenericDataLocation) + QStringLiteral(\"\/org.kde.syntax-highlighting\/syntax\");\n QDir().mkpath(m_downloadLocation);\n Q_ASSERT(QFile::exists(m_downloadLocation));\n}\n\nDownloader::~Downloader()\n{\n}\n\nvoid Downloader::start()\n{\n QNetworkRequest req(QUrl(QStringLiteral(\"https:\/\/www.kate-editor.org\/syntax\/update-5.24.xml\")));\n req.setAttribute(QNetworkRequest::FollowRedirectsAttribute, true);\n auto reply = m_nam->get(req);\n connect(reply, &QNetworkReply::finished, this, [this, reply]() {\n definitionListDownloadFinished(reply);\n });\n}\n\nvoid Downloader::definitionListDownloadFinished(QNetworkReply *reply)\n{\n if (reply->error() != QNetworkReply::NoError) {\n qWarning() << reply->error();\n emit done(); \/\/ TODO return error\n return;\n }\n\n QXmlStreamReader parser(reply);\n while (!parser.atEnd()) {\n switch (parser.readNext()) {\n case QXmlStreamReader::StartElement:\n if (parser.name() == QLatin1String(\"Definition\"))\n updateDefinition(parser);\n break;\n default:\n break;\n }\n }\n\n if (m_pendingDownloads == 0)\n emit informationMessage(tr(\"All syntax definitions are up-to-date.\"));\n checkDone();\n}\n\nvoid Downloader::updateDefinition(QXmlStreamReader &parser)\n{\n const auto name = parser.attributes().value(QLatin1String(\"name\"));\n if (name.isEmpty())\n return;\n\n auto localDef = m_repo->definitionForName(name.toString());\n if (!localDef.isValid()) {\n emit informationMessage(tr(\"Downloading new syntax definition for '%1'...\").arg(name.toString()));\n downloadDefinition(QUrl(parser.attributes().value(QLatin1String(\"url\")).toString()));\n return;\n }\n\n const auto version = parser.attributes().value(QLatin1String(\"version\"));\n if (localDef.version() < version.toFloat()) {\n emit informationMessage(tr(\"Updating syntax definition for '%1' to version %2...\").arg(name.toString(), version.toString()));\n downloadDefinition(QUrl(parser.attributes().value(QLatin1String(\"url\")).toString()));\n }\n}\n\nvoid Downloader::downloadDefinition(const QUrl& downloadUrl)\n{\n if (!downloadUrl.isValid())\n return;\n auto url = downloadUrl;\n if (url.scheme() == QLatin1String(\"http\"))\n url.setScheme(QStringLiteral(\"https\"));\n\n QNetworkRequest req(url);\n auto reply = m_nam->get(req);\n connect(reply, &QNetworkReply::finished, this, [this, reply]() {\n downloadDefinitionFinished(reply);\n });\n ++m_pendingDownloads;\n}\n\nvoid Downloader::downloadDefinitionFinished(QNetworkReply *reply)\n{\n --m_pendingDownloads;\n if (reply->error() != QNetworkReply::NoError) {\n qWarning() << \"Failed to download definition file\" << reply->url() << reply->error();\n checkDone();\n return;\n }\n\n \/\/ handle redirects\n \/\/ needs to be done manually, download server redirects to unsafe http links\n const auto redirectUrl = reply->attribute(QNetworkRequest::RedirectionTargetAttribute).toUrl();\n if (!redirectUrl.isEmpty()) {\n downloadDefinition(reply->url().resolved(redirectUrl));\n checkDone();\n return;\n }\n\n QFile file(m_downloadLocation + QLatin1Char('\/') + reply->url().fileName());\n if (!file.open(QFile::WriteOnly)) {\n qWarning() << \"Failed to open\" << file.fileName() << file.error();\n } else {\n file.write(reply->readAll());\n }\n checkDone();\n}\n\nvoid Downloader::checkDone()\n{\n if (m_pendingDownloads == 0)\n emit QTimer::singleShot(0, this, &Downloader::done);\n}\n<commit_msg>Don't hardcode the download URL<commit_after>\/*\n Copyright (C) 2016 Volker Krause <vkrause@kde.org>\n\n This program is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This program is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"syntaxhighlighting_version.h\"\n#include \"downloader.h\"\n#include \"definition.h\"\n#include \"repository.h\"\n\n#include <QDebug>\n#include <QDir>\n#include <QFile>\n#include <QNetworkAccessManager>\n#include <QNetworkReply>\n#include <QNetworkRequest>\n#include <QStandardPaths>\n#include <QTimer>\n#include <QXmlStreamReader>\n\nusing namespace SyntaxHighlighting;\n\nDownloader::Downloader(Repository *repo, QObject *parent) :\n QObject(parent),\n m_repo(repo),\n m_nam(new QNetworkAccessManager(this)),\n m_pendingDownloads(0)\n{\n Q_ASSERT(repo);\n\n m_downloadLocation = QStandardPaths::writableLocation(QStandardPaths::GenericDataLocation) + QStringLiteral(\"\/org.kde.syntax-highlighting\/syntax\");\n QDir().mkpath(m_downloadLocation);\n Q_ASSERT(QFile::exists(m_downloadLocation));\n}\n\nDownloader::~Downloader()\n{\n}\n\nvoid Downloader::start()\n{\n const QString url = QLatin1String(\"https:\/\/www.kate-editor.org\/syntax\/update-\")\n + QString::number(SyntaxHighlighting_VERSION_MAJOR)\n + QLatin1Char('.')\n + QString::number(SyntaxHighlighting_VERSION_MINOR)\n + QLatin1String(\".xml\");\n auto req = QNetworkRequest(QUrl(url));\n req.setAttribute(QNetworkRequest::FollowRedirectsAttribute, true);\n auto reply = m_nam->get(req);\n connect(reply, &QNetworkReply::finished, this, [this, reply]() {\n definitionListDownloadFinished(reply);\n });\n}\n\nvoid Downloader::definitionListDownloadFinished(QNetworkReply *reply)\n{\n if (reply->error() != QNetworkReply::NoError) {\n qWarning() << reply->error();\n emit done(); \/\/ TODO return error\n return;\n }\n\n QXmlStreamReader parser(reply);\n while (!parser.atEnd()) {\n switch (parser.readNext()) {\n case QXmlStreamReader::StartElement:\n if (parser.name() == QLatin1String(\"Definition\"))\n updateDefinition(parser);\n break;\n default:\n break;\n }\n }\n\n if (m_pendingDownloads == 0)\n emit informationMessage(tr(\"All syntax definitions are up-to-date.\"));\n checkDone();\n}\n\nvoid Downloader::updateDefinition(QXmlStreamReader &parser)\n{\n const auto name = parser.attributes().value(QLatin1String(\"name\"));\n if (name.isEmpty())\n return;\n\n auto localDef = m_repo->definitionForName(name.toString());\n if (!localDef.isValid()) {\n emit informationMessage(tr(\"Downloading new syntax definition for '%1'...\").arg(name.toString()));\n downloadDefinition(QUrl(parser.attributes().value(QLatin1String(\"url\")).toString()));\n return;\n }\n\n const auto version = parser.attributes().value(QLatin1String(\"version\"));\n if (localDef.version() < version.toFloat()) {\n emit informationMessage(tr(\"Updating syntax definition for '%1' to version %2...\").arg(name.toString(), version.toString()));\n downloadDefinition(QUrl(parser.attributes().value(QLatin1String(\"url\")).toString()));\n }\n}\n\nvoid Downloader::downloadDefinition(const QUrl& downloadUrl)\n{\n if (!downloadUrl.isValid())\n return;\n auto url = downloadUrl;\n if (url.scheme() == QLatin1String(\"http\"))\n url.setScheme(QStringLiteral(\"https\"));\n\n QNetworkRequest req(url);\n auto reply = m_nam->get(req);\n connect(reply, &QNetworkReply::finished, this, [this, reply]() {\n downloadDefinitionFinished(reply);\n });\n ++m_pendingDownloads;\n}\n\nvoid Downloader::downloadDefinitionFinished(QNetworkReply *reply)\n{\n --m_pendingDownloads;\n if (reply->error() != QNetworkReply::NoError) {\n qWarning() << \"Failed to download definition file\" << reply->url() << reply->error();\n checkDone();\n return;\n }\n\n \/\/ handle redirects\n \/\/ needs to be done manually, download server redirects to unsafe http links\n const auto redirectUrl = reply->attribute(QNetworkRequest::RedirectionTargetAttribute).toUrl();\n if (!redirectUrl.isEmpty()) {\n downloadDefinition(reply->url().resolved(redirectUrl));\n checkDone();\n return;\n }\n\n QFile file(m_downloadLocation + QLatin1Char('\/') + reply->url().fileName());\n if (!file.open(QFile::WriteOnly)) {\n qWarning() << \"Failed to open\" << file.fileName() << file.error();\n } else {\n file.write(reply->readAll());\n }\n checkDone();\n}\n\nvoid Downloader::checkDone()\n{\n if (m_pendingDownloads == 0)\n emit QTimer::singleShot(0, this, &Downloader::done);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n\/\/ We are making my contributions\/submissions to this project solely in our\n\/\/ personal capacity and are not conveying any rights to any intellectual\n\/\/ property of any third parties.\n\n#include <Utils\/TestUtils.hpp>\n#include \"gtest\/gtest.h\"\n\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Games\/GameConfig.hpp>\n#include <Rosetta\/Games\/GameManager.hpp>\n#include <Rosetta\/Policies\/BasicPolicy.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/AttackTask.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/EndTurnTask.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/PlayCardTask.hpp>\n\nusing namespace RosettaStone;\nusing namespace PlayerTasks;\n\nstruct MulliganTestPolicy : BasicPolicy\n{\n TaskMeta RequireMulligan(Player&) override\n {\n return TaskMeta(TaskMetaTrait(TaskID::MULLIGAN), std::vector<size_t>());\n }\n};\n\nTEST(Game, Mulligan)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.skipMulligan = false;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n\n auto& curPlayer = game.GetCurrentPlayer();\n auto& opPlayer = game.GetOpponentPlayer();\n\n MulliganTestPolicy policy;\n curPlayer.policy = &policy;\n opPlayer.policy = &policy;\n\n game.nextStep = Step::BEGIN_MULLIGAN;\n GameManager::ProcessNextStep(game, game.nextStep);\n}\n\nTEST(Game, GameOver_Player1Won)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n game.Process(PlayCardTask::Minion(curPlayer, card1));\n game.Process(AttackTask(card1, opPlayer.GetHero()));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::WON);\n EXPECT_EQ(opPlayer.playState, PlayState::LOST);\n}\n\nTEST(Game, GameOver_Player2Won)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER2;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n game.Process(PlayCardTask::Minion(curPlayer, card1));\n game.Process(AttackTask(card1, opPlayer.GetHero()));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::WON);\n EXPECT_EQ(opPlayer.playState, PlayState::LOST);\n}\n\nTEST(Game, GameOver_Tied)\n{\n GameConfig config;\n config.player1Class = CardClass::WARLOCK;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n curPlayer.GetHero()->SetDamage(29);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Hellfire\"));\n\n game.Process(PlayCardTask::Spell(curPlayer, card1));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::TIED);\n EXPECT_EQ(opPlayer.playState, PlayState::TIED);\n}<commit_msg>refactor: Remove unnecessary header file<commit_after>\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n\/\/ We are making my contributions\/submissions to this project solely in our\n\/\/ personal capacity and are not conveying any rights to any intellectual\n\/\/ property of any third parties.\n\n#include <Utils\/TestUtils.hpp>\n#include \"gtest\/gtest.h\"\n\n#include <Rosetta\/Actions\/Draw.hpp>\n#include <Rosetta\/Cards\/Cards.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Games\/GameConfig.hpp>\n#include <Rosetta\/Games\/GameManager.hpp>\n#include <Rosetta\/Policies\/BasicPolicy.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/AttackTask.hpp>\n#include <Rosetta\/Tasks\/PlayerTasks\/PlayCardTask.hpp>\n\nusing namespace RosettaStone;\nusing namespace PlayerTasks;\n\nstruct MulliganTestPolicy : BasicPolicy\n{\n TaskMeta RequireMulligan(Player&) override\n {\n return TaskMeta(TaskMetaTrait(TaskID::MULLIGAN), std::vector<size_t>());\n }\n};\n\nTEST(Game, Mulligan)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.skipMulligan = false;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n\n auto& curPlayer = game.GetCurrentPlayer();\n auto& opPlayer = game.GetOpponentPlayer();\n\n MulliganTestPolicy policy;\n curPlayer.policy = &policy;\n opPlayer.policy = &policy;\n\n game.nextStep = Step::BEGIN_MULLIGAN;\n GameManager::ProcessNextStep(game, game.nextStep);\n}\n\nTEST(Game, GameOver_Player1Won)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n game.Process(PlayCardTask::Minion(curPlayer, card1));\n game.Process(AttackTask(card1, opPlayer.GetHero()));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::WON);\n EXPECT_EQ(opPlayer.playState, PlayState::LOST);\n}\n\nTEST(Game, GameOver_Player2Won)\n{\n GameConfig config;\n config.player1Class = CardClass::WARRIOR;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER2;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Wolfrider\"));\n\n game.Process(PlayCardTask::Minion(curPlayer, card1));\n game.Process(AttackTask(card1, opPlayer.GetHero()));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::WON);\n EXPECT_EQ(opPlayer.playState, PlayState::LOST);\n}\n\nTEST(Game, GameOver_Tied)\n{\n GameConfig config;\n config.player1Class = CardClass::WARLOCK;\n config.player2Class = CardClass::ROGUE;\n config.startPlayer = PlayerType::PLAYER1;\n config.doFillDecks = true;\n config.autoRun = false;\n\n Game game(config);\n game.StartGame();\n game.ProcessUntil(Step::MAIN_START);\n\n Player& curPlayer = game.GetCurrentPlayer();\n Player& opPlayer = game.GetOpponentPlayer();\n curPlayer.SetTotalMana(10);\n curPlayer.SetUsedMana(0);\n opPlayer.SetTotalMana(10);\n opPlayer.SetUsedMana(0);\n curPlayer.GetHero()->SetDamage(29);\n opPlayer.GetHero()->SetDamage(29);\n\n const auto card1 = Generic::DrawCard(\n curPlayer, Cards::GetInstance().FindCardByName(\"Hellfire\"));\n\n game.Process(PlayCardTask::Spell(curPlayer, card1));\n\n EXPECT_EQ(game.state, State::COMPLETE);\n EXPECT_EQ(curPlayer.playState, PlayState::TIED);\n EXPECT_EQ(opPlayer.playState, PlayState::TIED);\n}<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"GameManager.h\"\n#include \"FileStuff.h\"\n#include \"ConstVars.h\"\n\/\/̾\n#include \"GameLayer.h\"\n#include \"UILayer.h\"\n\/\/\n#include \"StageInformation.h\"\n#include \"StageScene.h\"\n#include \"GameScene.h\"\n\/\/Ŵ\n#include \"ColliderManager.h\"\n#include \"TargetManager.h\"\n\/\/ö̴\n#include \"Collider.h\"\n#include \"Bullet.h\"\n#include \"CrossBullet.h\"\n#include \"Explosion.h\"\n\/\/Ÿ\n#include \"Target.h\"\n\/\/\n#include \"Sling.h\"\n\n\nGameManager* GameManager::m_instance = nullptr;\n\nGameManager* GameManager::GetInstance()\n{\n\tif (m_instance == nullptr)\n\t{\n\t\tm_instance = new GameManager();\n\t}\n\treturn m_instance;\n}\n\nGameManager::GameManager()\n{\n\tm_sling = nullptr;\n\tm_colliderManager = new ColliderManager();\n\tm_targetManager = new TargetManager();\n\tm_isJudged = false;\n}\n\nvoid GameManager::Reset()\n{\n\tm_sling = nullptr;\n\tdelete m_colliderManager;\n\tm_colliderManager = new ColliderManager();\n\tdelete m_targetManager;\n\tm_targetManager = new TargetManager();\n\tm_isJudged = false;\n}\n\nGameManager::~GameManager() {}\n\nvoid GameManager::SetStage(GameLayer* gameLayer, int stageNumber)\n{\t\n\tReset();\n\tStageInformation stageInfo(stageNumber);\n\tm_targetManager->InitTargets(&stageInfo);\n\tAppendTargetsToLayer(gameLayer);\n\tm_colliderManager->InitBullets(&stageInfo);\n\tm_sling = SetSling(gameLayer);\n\tm_stage = stageNumber;\n\tm_isJudged = false;\n}\n\nSling* GameManager::SetSling(GameLayer* gameLayer)\n{\n\tSling* sling = Sling::create();\n\tgameLayer->addChild(sling);\n\tsling->LoadBullet();\n\treturn sling;\n}\n\nvoid GameManager::AppendTargetsToLayer(GameLayer* gameLayer)\n{\n\tfor (Target* target : m_targetManager->m_targets)\n\t{\n\t\tgameLayer->addChild(target);\n\t}\n}\n\nvoid GameManager::ShotBullet(Sling* sling)\n{\n\tBullet* bullet = m_colliderManager->GetBulletToShot(sling);\n\t\n\tif (bullet)\n\t{\n\t\tScene* currentScene = Director::getInstance()->getRunningScene();\n\t\tScene* gameScene = static_cast<Scene*>(currentScene->getChildByName(\"GameScene\"));\n\t\tLayer* gameLayer = static_cast<Layer*>(gameScene->getChildByName(\"GameLayer\"));\n\n\t\tgameLayer->addChild(bullet);\n\n\t\tsling->ShotComplete();\n\n\t\tif (m_colliderManager->HasBulletToShot())\n\t\t{\n\t\t\tsling->LoadBullet();\n\t\t}\n\t}\n}\n\nvoid GameManager::Play(GameLayer* gameLayer, UILayer* uiLayer)\n{\n\tVector<Collider*>& colliders = m_colliderManager->m_colliders;\n\tVector<Target*>& targets = m_targetManager->m_targets;\n\tCollider* collider = nullptr;\n\n\tfor (int i = 0; i < colliders.size(); i++)\n\t{\n\t\tcollider = colliders.at(i);\n\t\tif (collider->IsFlying())\n\t\t{\n\t\t\tcollider->Act();\n\t\t\tCheckCollide(collider, targets);\n\t\t}\n\n\t\tif (Bullet* bullet = dynamic_cast<Bullet*>(collider))\n\t\t{\n\t\t\tif (bullet->IsToExplode())\n\t\t\t{\n\t\t\t\tExplosion* explosion = bullet->GetExplosion();\n\t\t\t\tm_colliderManager->AddExplosion(explosion);\n\t\t\t\tgameLayer->addChild(explosion);\n\t\t\t}\n\t\t}\n\t}\n\n\tm_colliderManager->EraseDeadColliders();\n\tm_targetManager->EraseDeadTargets();\n\tControlProgress(gameLayer, uiLayer);\n}\n\nvoid GameManager::CheckCollide(Collider* collider, Vector<Target*>& targets)\n{\n\/\/\tstatic Target* lastTarget = nullptr;\n\tfor (Target* target : targets)\n\t{\n\/\/\t\tif (target == lastTarget)\n\/\/\t\t\tcontinue;\n\n\t\tif (collider->IsBullet())\n\t\t{\n\t\t\tconst Rect colliderBoundingBox = dynamic_cast<Bullet*>(collider)->GetBoundingArea();\n\t\t\tconst Rect targetBoundingBox = target->GetBoundingArea();\n\n\t\t\tif (colliderBoundingBox.intersectsRect(targetBoundingBox))\n\t\t\t{\n\/\/\t\t\t\tlastTarget = target;\n\t\t\t\ttarget->ApplyCollisionEffect(collider);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\/\/\t\t\t\tif (lastTarget == target)\n\/\/\t\t\t\t\tlastTarget = nullptr;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tExplosion* explosion = dynamic_cast<Explosion*>(collider);\n\t\t\tconst float explosionRadius = explosion->GetBoundingRadius();\n\t\t\tconst Vec2 explosionPosition = explosion->getPosition();\n\t\t\tconst Rect targetBoundingBox = target->GetBoundingArea();\n\n\t\t\tif ( targetBoundingBox.intersectsCircle( explosionPosition, explosionRadius) )\n\t\t\t{\n\/\/\t\t\t\tlastTarget = target;\n\t\t\t\ttarget->ApplyCollisionEffect(explosion);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid GameManager::WinProgress(UILayer* uiLayer)\n{\n\tint lastStage = UserDefault::getInstance()->getIntegerForKey(ConstVars::LASTSTAGE);\n\tif (lastStage < m_stage + 1 && m_stage + 1 <= StageInformation::GetMaxStageNum())\n\t{\n\t\tUserDefault::getInstance()->setIntegerForKey(ConstVars::LASTSTAGE, m_stage + 1);\n\t}\n\tuiLayer->MakeSuccessWidget(m_stage);\n}\n\nvoid GameManager::FailProgress(UILayer* uiLayer)\n{\n\tuiLayer->MakeFailWidget(m_stage);\n}\n\nvoid GameManager::ControlProgress(GameLayer* gameLayer, UILayer* uiLayer)\n{\n\tif (!m_isJudged)\n\t{\n\t\tif (!m_targetManager->HasEnemy())\n\t\t{\n\t\t\tm_isJudged = true;\n\t\t\tm_sling->ShotComplete();\n\t\t\tm_sling->removeAllChildren();\n\t\t\tWinProgress(uiLayer);\n\t\t}\n\t\telse if (!m_colliderManager->HasCollider()){\n\t\t\tm_isJudged = true;\n\t\t\tm_sling->ShotComplete();\n\t\t\tm_sling->removeAllChildren();\n\t\t\tFailProgress(uiLayer);\n\t\t}\n\t}\n}\n<commit_msg>multiple collision check problem solved<commit_after>#include \"stdafx.h\"\n#include \"GameManager.h\"\n#include \"FileStuff.h\"\n#include \"ConstVars.h\"\n\/\/̾\n#include \"GameLayer.h\"\n#include \"UILayer.h\"\n\/\/\n#include \"StageInformation.h\"\n#include \"StageScene.h\"\n#include \"GameScene.h\"\n\/\/Ŵ\n#include \"ColliderManager.h\"\n#include \"TargetManager.h\"\n\/\/ö̴\n#include \"Collider.h\"\n#include \"Bullet.h\"\n#include \"CrossBullet.h\"\n#include \"Explosion.h\"\n\/\/Ÿ\n#include \"Target.h\"\n\/\/\n#include \"Sling.h\"\n\n\nGameManager* GameManager::m_instance = nullptr;\n\nGameManager* GameManager::GetInstance()\n{\n\tif (m_instance == nullptr)\n\t{\n\t\tm_instance = new GameManager();\n\t}\n\treturn m_instance;\n}\n\nGameManager::GameManager()\n{\n\tm_sling = nullptr;\n\tm_colliderManager = new ColliderManager();\n\tm_targetManager = new TargetManager();\n\tm_isJudged = false;\n}\n\nvoid GameManager::Reset()\n{\n\tm_sling = nullptr;\n\tdelete m_colliderManager;\n\tm_colliderManager = new ColliderManager();\n\tdelete m_targetManager;\n\tm_targetManager = new TargetManager();\n\tm_isJudged = false;\n}\n\nGameManager::~GameManager() {}\n\nvoid GameManager::SetStage(GameLayer* gameLayer, int stageNumber)\n{\t\n\tReset();\n\tStageInformation stageInfo(stageNumber);\n\tm_targetManager->InitTargets(&stageInfo);\n\tAppendTargetsToLayer(gameLayer);\n\tm_colliderManager->InitBullets(&stageInfo);\n\tm_sling = SetSling(gameLayer);\n\tm_stage = stageNumber;\n\tm_isJudged = false;\n}\n\nSling* GameManager::SetSling(GameLayer* gameLayer)\n{\n\tSling* sling = Sling::create();\n\tgameLayer->addChild(sling);\n\tsling->LoadBullet();\n\treturn sling;\n}\n\nvoid GameManager::AppendTargetsToLayer(GameLayer* gameLayer)\n{\n\tfor (Target* target : m_targetManager->m_targets)\n\t{\n\t\tgameLayer->addChild(target);\n\t}\n}\n\nvoid GameManager::ShotBullet(Sling* sling)\n{\n\tBullet* bullet = m_colliderManager->GetBulletToShot(sling);\n\t\n\tif (bullet)\n\t{\n\t\tScene* currentScene = Director::getInstance()->getRunningScene();\n\t\tScene* gameScene = static_cast<Scene*>(currentScene->getChildByName(\"GameScene\"));\n\t\tLayer* gameLayer = static_cast<Layer*>(gameScene->getChildByName(\"GameLayer\"));\n\n\t\tgameLayer->addChild(bullet);\n\n\t\tsling->ShotComplete();\n\n\t\tif (m_colliderManager->HasBulletToShot())\n\t\t{\n\t\t\tsling->LoadBullet();\n\t\t}\n\t}\n}\n\nvoid GameManager::Play(GameLayer* gameLayer, UILayer* uiLayer)\n{\n\tVector<Collider*>& colliders = m_colliderManager->m_colliders;\n\tVector<Target*>& targets = m_targetManager->m_targets;\n\tCollider* collider = nullptr;\n\n\tfor (int i = 0; i < colliders.size(); i++)\n\t{\n\t\tcollider = colliders.at(i);\n\t\tif (collider->IsFlying())\n\t\t{\n\t\t\tcollider->Act();\n\t\t\tCheckCollide(collider, targets);\n\t\t}\n\n\t\tif (Bullet* bullet = dynamic_cast<Bullet*>(collider))\n\t\t{\n\t\t\tif (bullet->IsToExplode())\n\t\t\t{\n\t\t\t\tExplosion* explosion = bullet->GetExplosion();\n\t\t\t\tm_colliderManager->AddExplosion(explosion);\n\t\t\t\tgameLayer->addChild(explosion);\n\t\t\t}\n\t\t}\n\t}\n\n\tm_colliderManager->EraseDeadColliders();\n\tm_targetManager->EraseDeadTargets();\n\tControlProgress(gameLayer, uiLayer);\n}\n\nvoid GameManager::CheckCollide(Collider* collider, Vector<Target*>& targets)\n{\n\tstatic Target* lastTarget = nullptr; \/\/ ѹ 浹 Ÿٿ 浹üũ ʵ .\n\tbool collidingCheck = false; \/\/ 浹 Ÿ ִ üũ. --> lastTarget ʿ䰡 ִüũ\n\tfor (Target* target : targets)\n\t{\n\t\tif (target == lastTarget)\n\t\t\tcontinue;\n\n\t\tif (collider->IsBullet())\n\t\t{\n\t\t\tconst Rect colliderBoundingBox = dynamic_cast<Bullet*>(collider)->GetBoundingArea();\n\t\t\tconst Rect targetBoundingBox = target->GetBoundingArea();\n\n\t\t\tif (colliderBoundingBox.intersectsRect(targetBoundingBox))\n\t\t\t{\n\t\t\t\tlastTarget = target;\n\t\t\t\ttarget->ApplyCollisionEffect(collider);\n\t\t\t\tcollidingCheck = true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tExplosion* explosion = dynamic_cast<Explosion*>(collider);\n\t\t\tconst float explosionRadius = explosion->GetBoundingRadius();\n\t\t\tconst Vec2 explosionPosition = explosion->getPosition();\n\t\t\tconst Rect targetBoundingBox = target->GetBoundingArea();\n\n\t\t\tif ( targetBoundingBox.intersectsCircle( explosionPosition, explosionRadius) )\n\t\t\t{\n\t\t\t\tlastTarget = target;\n\t\t\t\ttarget->ApplyCollisionEffect(explosion);\n\t\t\t}\n\t\t}\n\t}\n\tif (!collidingCheck)\n\t\tlastTarget = nullptr;\n}\n\nvoid GameManager::WinProgress(UILayer* uiLayer)\n{\n\tint lastStage = UserDefault::getInstance()->getIntegerForKey(ConstVars::LASTSTAGE);\n\tif (lastStage < m_stage + 1 && m_stage + 1 <= StageInformation::GetMaxStageNum())\n\t{\n\t\tUserDefault::getInstance()->setIntegerForKey(ConstVars::LASTSTAGE, m_stage + 1);\n\t}\n\tuiLayer->MakeSuccessWidget(m_stage);\n}\n\nvoid GameManager::FailProgress(UILayer* uiLayer)\n{\n\tuiLayer->MakeFailWidget(m_stage);\n}\n\nvoid GameManager::ControlProgress(GameLayer* gameLayer, UILayer* uiLayer)\n{\n\tif (!m_isJudged)\n\t{\n\t\tif (!m_targetManager->HasEnemy())\n\t\t{\n\t\t\tm_isJudged = true;\n\t\t\tm_sling->ShotComplete();\n\t\t\tm_sling->removeAllChildren();\n\t\t\tWinProgress(uiLayer);\n\t\t}\n\t\telse if (!m_colliderManager->HasCollider()){\n\t\t\tm_isJudged = true;\n\t\t\tm_sling->ShotComplete();\n\t\t\tm_sling->removeAllChildren();\n\t\t\tFailProgress(uiLayer);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * (c) Copyright Ascensio System SIA 2010-2019\r\n *\r\n * This program is a free software product. You can redistribute it and\/or\r\n * modify it under the terms of the GNU Affero General Public License (AGPL)\r\n * version 3 as published by the Free Software Foundation. In accordance with\r\n * Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect\r\n * that Ascensio System SIA expressly excludes the warranty of non-infringement\r\n * of any third-party rights.\r\n *\r\n * This program is distributed WITHOUT ANY WARRANTY; without even the implied\r\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For\r\n * details, see the GNU AGPL at: http:\/\/www.gnu.org\/licenses\/agpl-3.0.html\r\n *\r\n * You can contact Ascensio System SIA at 20A-12 Ernesta Birznieka-Upisha\r\n * street, Riga, Latvia, EU, LV-1050.\r\n *\r\n * The interactive user interfaces in modified source and object code versions\r\n * of the Program must display Appropriate Legal Notices, as required under\r\n * Section 5 of the GNU AGPL version 3.\r\n *\r\n * Pursuant to Section 7(b) of the License you must retain the original Product\r\n * logo when distributing the program. Pursuant to Section 7(e) we decline to\r\n * grant you any rights under trademark law for use of our trademarks.\r\n *\r\n * All the Product's GUI elements, including illustrations and icon sets, as\r\n * well as technical writing content are licensed under the terms of the\r\n * Creative Commons Attribution-ShareAlike 4.0 International. See the License\r\n * terms at http:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/legalcode\r\n *\r\n *\/\r\n#include \"Common.h\"\r\n\r\n#include \"BinReaderWriterDefines.h\"\r\n#include \"..\/..\/Common\/DocxFormat\/Source\/XlsxFormat\/Xlsx.h\"\r\n#include \"..\/..\/Common\/DocxFormat\/Source\/Common\/SimpleTypes_Shared.h\"\r\n#include \"..\/..\/Common\/Base64.h\"\r\n#include \"..\/..\/DesktopEditor\/common\/Types.h\"\r\n#include \"..\/..\/DesktopEditor\/raster\/ImageFileFormatChecker.h\"\r\n\r\n#ifndef DISABLE_FILE_DOWNLOADER\r\n #include \"..\/..\/Common\/Network\/FileTransporter\/include\/FileTransporter.h\"\r\n#endif\r\n#include \"..\/..\/DesktopEditor\/common\/File.h\"\r\n\r\nnamespace SerializeCommon\r\n{\r\n std::wstring DownloadImage(const std::wstring& strFile)\r\n\t{\r\n#ifndef DISABLE_FILE_DOWNLOADER\r\n std::wstring strFileName;\r\n\t\t\r\n NSNetwork::NSFileTransport::CFileDownloader oDownloader(strFile, false);\r\n\t\tif ( oDownloader.DownloadSync() )\r\n\t\t{\r\n\t\t\tstrFileName = oDownloader.GetFilePath();\r\n\t\t\t\r\n\t\t\tCImageFileFormatChecker checker;\r\n\t\t\tif (false == checker.isImageFile(strFileName))\r\n\t\t\t{\r\n\t\t\t\tstrFileName.clear();\r\n\t\t\t} \r\n\t\t}\r\n\t\treturn strFileName;\r\n#else\r\n\t\treturn L\"\";\r\n#endif\r\n\t}\r\n VOID convertBase64ToImage (NSFile::CFileBinary& oFile, std::wstring &pBase64)\r\n\t{\r\n\t\tBYTE* pUtf8 = NULL;\r\n\t\tlong nUtf8Size;\r\n NSFile::CUtf8Converter::GetUtf8StringFromUnicode(pBase64.c_str(), pBase64.length(), pUtf8, nUtf8Size);\r\n std::string sUnicode((char*)pUtf8, nUtf8Size);\r\n\t\tRELEASEARRAYOBJECTS(pUtf8);\r\n\r\n\t\t\/\/Убираем \"data:image\/jpg;base64,\"\r\n\t\tint nShift = 0;\r\n int nIndex = sUnicode.find(\"base64,\");\r\n\t\tif(-1 != nIndex)\r\n\t\t{\r\n\t\t\tnShift = nIndex + 7;\r\n\t\t}\r\n\t\t\/\/ Получаем размер файла\r\n LONG lFileSize = sUnicode.length () - nShift;\r\n\t\tINT nDstLength = lFileSize;\r\n\t\tBYTE *pBuffer = new BYTE [lFileSize];\r\n\t\tmemset(pBuffer, 0, lFileSize);\r\n Base64::Base64Decode (sUnicode.c_str() + nShift, lFileSize, pBuffer, &nDstLength);\r\n\r\n\t\tCImageFileFormatChecker checker;\r\n\t\tstd::wstring detectImageExtension = checker.DetectFormatByData(pBuffer, nDstLength);\r\n\r\n\t\tif (false == detectImageExtension.empty())\r\n\t\t{\r\n\t\t\toFile.WriteFile(pBuffer, nDstLength);\r\n\t\t}\r\n\r\n\t\tRELEASEARRAYOBJECTS (pBuffer);\r\n\t}\r\n\r\n\tlong Round(double val)\r\n\t{\r\n\t\treturn (long)(val+ 0.5);\r\n\t}\r\n std::wstring changeExtention(const std::wstring& sSourcePath, const std::wstring& sTargetExt)\r\n\t{\r\n int nIndex = sSourcePath.rfind('.');\r\n\t\tif(-1 != nIndex)\r\n return sSourcePath.substr(0, nIndex + 1) + sTargetExt;\r\n\t\treturn sSourcePath;\r\n\t}\r\n\tvoid ReadFileType(const std::wstring& sXMLOptions, BYTE& result, UINT& nCodePage, std::wstring& sDelimiter, BYTE& cSaveFileType)\r\n\t{\r\n\t\tresult = BinXlsxRW::c_oFileTypes::XLSX;\r\n\t\tnCodePage = 46;\/\/todo 46 временно CP_UTF8\r\n\t\tsDelimiter = _T(\"\");\r\n\t\tcSaveFileType = BinXlsxRW::c_oFileTypes::XLSX;\r\n\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> fileType;\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> codePage;\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> saveFileType;\r\n nullable<std::wstring> delimiter;\r\n\r\n\t\t\/\/ Read options\r\n\t\tXmlUtils::CXmlLiteReader oReader;\r\n if (true != oReader.FromString(sXMLOptions) || true != oReader.IsValid())\r\n\t\t\treturn;\r\n\r\n\t\toReader.ReadNextNode(); \/\/ XmlOptions\r\n\t\tif (oReader.IsEmptyNode())\r\n\t\t\treturn;\r\n\r\n\t\tint nCurDepth = oReader.GetDepth();\r\n\t\twhile(oReader.ReadNextSiblingNode(nCurDepth))\r\n\t\t{\r\n\t\t\tstd::wstring sName = oReader.GetName();\r\n\t\t\tif (_T(\"fileOptions\") == sName)\r\n\t\t\t{\r\n\t\t\t\t\/\/ Читаем атрибуты\r\n\t\t\t\tWritingElement_ReadAttributes_Start(oReader)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_if (oReader, _T(\"fileType\"), fileType)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, _T(\"codePage\"), codePage)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, _T(\"delimiter\"), delimiter)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, _T(\"saveFileType\"), saveFileType)\r\n\t\t\t\tWritingElement_ReadAttributes_End(oReader)\r\n\t\t\t\t\r\n\t\t\t\tif (fileType.IsInit())\r\n\t\t\t\t\tresult = (BYTE)fileType->GetValue();\r\n\t\t\t\tif (codePage.IsInit())\r\n\t\t\t\t\tnCodePage = (UINT)codePage->GetValue();\r\n\t\t\t\tif (saveFileType.IsInit())\r\n\t\t\t\t\tcSaveFileType = (BYTE)saveFileType->GetValue();\r\n\t\t\t\tif (delimiter.IsInit())\r\n\t\t\t\t{\r\n\t\t\t\t\tsDelimiter = delimiter.get();\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn;\r\n\t}\r\n}\r\n<commit_msg>for bug #55431<commit_after>\/*\r\n * (c) Copyright Ascensio System SIA 2010-2019\r\n *\r\n * This program is a free software product. You can redistribute it and\/or\r\n * modify it under the terms of the GNU Affero General Public License (AGPL)\r\n * version 3 as published by the Free Software Foundation. In accordance with\r\n * Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect\r\n * that Ascensio System SIA expressly excludes the warranty of non-infringement\r\n * of any third-party rights.\r\n *\r\n * This program is distributed WITHOUT ANY WARRANTY; without even the implied\r\n * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For\r\n * details, see the GNU AGPL at: http:\/\/www.gnu.org\/licenses\/agpl-3.0.html\r\n *\r\n * You can contact Ascensio System SIA at 20A-12 Ernesta Birznieka-Upisha\r\n * street, Riga, Latvia, EU, LV-1050.\r\n *\r\n * The interactive user interfaces in modified source and object code versions\r\n * of the Program must display Appropriate Legal Notices, as required under\r\n * Section 5 of the GNU AGPL version 3.\r\n *\r\n * Pursuant to Section 7(b) of the License you must retain the original Product\r\n * logo when distributing the program. Pursuant to Section 7(e) we decline to\r\n * grant you any rights under trademark law for use of our trademarks.\r\n *\r\n * All the Product's GUI elements, including illustrations and icon sets, as\r\n * well as technical writing content are licensed under the terms of the\r\n * Creative Commons Attribution-ShareAlike 4.0 International. See the License\r\n * terms at http:\/\/creativecommons.org\/licenses\/by-sa\/4.0\/legalcode\r\n *\r\n *\/\r\n#include \"Common.h\"\r\n\r\n#include \"BinReaderWriterDefines.h\"\r\n#include \"..\/..\/Common\/DocxFormat\/Source\/XlsxFormat\/Xlsx.h\"\r\n#include \"..\/..\/Common\/DocxFormat\/Source\/Common\/SimpleTypes_Shared.h\"\r\n#include \"..\/..\/Common\/Base64.h\"\r\n#include \"..\/..\/DesktopEditor\/common\/Types.h\"\r\n#include \"..\/..\/DesktopEditor\/raster\/ImageFileFormatChecker.h\"\r\n\r\n#ifndef DISABLE_FILE_DOWNLOADER\r\n #include \"..\/..\/Common\/Network\/FileTransporter\/include\/FileTransporter.h\"\r\n#endif\r\n#include \"..\/..\/DesktopEditor\/common\/File.h\"\r\n\r\nnamespace SerializeCommon\r\n{\r\n std::wstring DownloadImage(const std::wstring& strFile)\r\n\t{\r\n#ifndef DISABLE_FILE_DOWNLOADER\r\n std::wstring strFileName;\r\n\t\t\r\n NSNetwork::NSFileTransport::CFileDownloader oDownloader(strFile, false);\r\n\t\tif ( oDownloader.DownloadSync() )\r\n\t\t{\r\n\t\t\tstrFileName = oDownloader.GetFilePath();\r\n\t\t\t\r\n\t\t\tCImageFileFormatChecker checker;\r\n\t\t\tif (false == checker.isImageFile(strFileName))\r\n\t\t\t{\r\n\t\t\t\tstrFileName.clear();\r\n\t\t\t} \r\n\t\t}\r\n\t\treturn strFileName;\r\n#else\r\n\t\treturn L\"\";\r\n#endif\r\n\t}\r\n VOID convertBase64ToImage (NSFile::CFileBinary& oFile, std::wstring &pBase64)\r\n\t{\r\n\t\tBYTE* pUtf8 = NULL;\r\n\t\tlong nUtf8Size;\r\n NSFile::CUtf8Converter::GetUtf8StringFromUnicode(pBase64.c_str(), pBase64.length(), pUtf8, nUtf8Size);\r\n std::string sUnicode((char*)pUtf8, nUtf8Size);\r\n\t\tRELEASEARRAYOBJECTS(pUtf8);\r\n\r\n\t\t\/\/Убираем \"data:image\/jpg;base64,\"\r\n\t\tint nShift = 0;\r\n int nIndex = sUnicode.find(\"base64,\");\r\n\t\tif(-1 != nIndex)\r\n\t\t{\r\n\t\t\tnShift = nIndex + 7;\r\n\t\t}\r\n\t\t\/\/ Получаем размер файла\r\n LONG lFileSize = sUnicode.length () - nShift;\r\n\t\tINT nDstLength = lFileSize;\r\n\t\tBYTE *pBuffer = new BYTE [lFileSize];\r\n\t\tmemset(pBuffer, 0, lFileSize);\r\n Base64::Base64Decode (sUnicode.c_str() + nShift, lFileSize, pBuffer, &nDstLength);\r\n\r\n\t\tCImageFileFormatChecker checker;\r\n\t\tstd::wstring detectImageExtension = checker.DetectFormatByData(pBuffer, nDstLength);\r\n\r\n\t\tif (false == detectImageExtension.empty())\r\n\t\t{\r\n\t\t\toFile.WriteFile(pBuffer, nDstLength);\r\n\t\t}\r\n\r\n\t\tRELEASEARRAYOBJECTS (pBuffer);\r\n\t}\r\n\r\n\tlong Round(double val)\r\n\t{\r\n\t\treturn (long)(val+ 0.5);\r\n\t}\r\n std::wstring changeExtention(const std::wstring& sSourcePath, const std::wstring& sTargetExt)\r\n\t{\r\n int nIndex = sSourcePath.rfind('.');\r\n\t\tif(-1 != nIndex)\r\n return sSourcePath.substr(0, nIndex + 1) + sTargetExt;\r\n\t\treturn sSourcePath;\r\n\t}\r\n\tvoid ReadFileType(const std::wstring& sXMLOptions, BYTE& result, UINT& nCodePage, std::wstring& sDelimiter, BYTE& cSaveFileType)\r\n\t{\r\n\t\tresult = BinXlsxRW::c_oFileTypes::XLSX;\r\n\t\tnCodePage = 46;\t\t\/\/default 46 временно CP_UTF8\r\n\t\tsDelimiter = L\",\"; \/\/ default\r\n\t\tcSaveFileType = BinXlsxRW::c_oFileTypes::XLSX;\/\/ default\r\n\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> fileType;\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> codePage;\r\n\t\tnullable<SimpleTypes::CUnsignedDecimalNumber<>> saveFileType;\r\n nullable<std::wstring> delimiter;\r\n\r\n\t\t\/\/ Read options\r\n\t\tXmlUtils::CXmlLiteReader oReader;\r\n if (true != oReader.FromString(sXMLOptions) || true != oReader.IsValid())\r\n\t\t\treturn;\r\n\r\n\t\toReader.ReadNextNode(); \/\/ XmlOptions\r\n\t\tif (oReader.IsEmptyNode())\r\n\t\t\treturn;\r\n\r\n\t\tint nCurDepth = oReader.GetDepth();\r\n\t\twhile(oReader.ReadNextSiblingNode(nCurDepth))\r\n\t\t{\r\n\t\t\tstd::wstring sName = oReader.GetName();\r\n\t\t\tif (L\"fileOptions\" == sName)\r\n\t\t\t{\r\n\t\t\t\tWritingElement_ReadAttributes_Start(oReader)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_if (oReader, L\"fileType\", fileType)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, L\"codePage\", codePage)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, L\"delimiter\", delimiter)\r\n\t\t\t\tWritingElement_ReadAttributes_Read_else_if (oReader, L\"saveFileType\", saveFileType)\r\n\t\t\t\tWritingElement_ReadAttributes_End(oReader)\r\n\t\t\t\t\r\n\t\t\t\tif (fileType.IsInit())\r\n\t\t\t\t\tresult = (BYTE)fileType->GetValue();\r\n\t\t\t\tif (codePage.IsInit())\r\n\t\t\t\t\tnCodePage = (UINT)codePage->GetValue();\r\n\t\t\t\tif (saveFileType.IsInit())\r\n\t\t\t\t\tcSaveFileType = (BYTE)saveFileType->GetValue();\r\n\t\t\t\tif (delimiter.IsInit())\r\n\t\t\t\t{\r\n\t\t\t\t\tsDelimiter = delimiter.get();\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn;\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2015 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\n\nAuthor: Leonardo de Moura\n*\/\n#include <unordered_map>\n#include \"kernel\/expr_maps.h\"\n#include \"kernel\/for_each_fn.h\"\n#include \"kernel\/inductive\/inductive.h\"\n#include \"library\/max_sharing.h\"\n#include \"library\/module.h\"\n#include \"library\/unfold_macros.h\"\n\nnamespace lean {\ntemplate<typename T>\nusing level_map = typename std::unordered_map<level, T, level_hash, level_eq>;\n\ntemplate<typename T>\nusing name_hmap = typename std::unordered_map<name, T, name_hash, name_eq>;\n\n\nclass exporter {\n std::ostream & m_out;\n environment m_env;\n bool m_all;\n name_set m_exported;\n max_sharing_fn m_max_sharing;\n name_hmap<unsigned> m_name2idx;\n level_map<unsigned> m_level2idx;\n expr_map<unsigned> m_expr2idx;\n\n void mark(name const & n) {\n m_exported.insert(n);\n }\n\n bool already_exported(name const & n) {\n return m_exported.contains(n);\n }\n\n unsigned export_name(name const & n) {\n auto it = m_name2idx.find(n);\n if (it != m_name2idx.end())\n return it->second;\n unsigned i;\n if (n.is_anonymous()) {\n lean_unreachable();\n } else if (n.is_string()) {\n unsigned p = export_name(n.get_prefix());\n i = m_name2idx.size();\n m_out << i << \" #NS \" << p << \" \" << n.get_string() << \"\\n\";\n } else {\n unsigned p = export_name(n.get_prefix());\n i = m_name2idx.size();\n m_out << i << \" #NI \" << p << \" \" << n.get_numeral() << \"\\n\";\n }\n m_name2idx.insert(mk_pair(n, i));\n return i;\n }\n\n unsigned export_level(level const & l) {\n auto it = m_level2idx.find(l);\n if (it != m_level2idx.end())\n return it->second;\n unsigned i = 0;\n unsigned l1, l2, n;\n switch (l.kind()) {\n case level_kind::Zero:\n lean_unreachable();\n break;\n case level_kind::Succ:\n l1 = export_level(succ_of(l));\n i = m_level2idx.size();\n m_out << i << \" #US \" << l1 << \"\\n\";\n break;\n case level_kind::Max:\n l1 = export_level(max_lhs(l));\n l2 = export_level(max_rhs(l));\n i = m_level2idx.size();\n m_out << i << \" #UM \" << l1 << \" \" << l2 << \"\\n\";\n break;\n case level_kind::IMax:\n l1 = export_level(imax_lhs(l));\n l2 = export_level(imax_rhs(l));\n i = m_level2idx.size();\n m_out << i << \" #UIM \" << l1 << \" \" << l2 << \"\\n\";\n break;\n case level_kind::Param:\n n = export_name(param_id(l));\n i = m_level2idx.size();\n m_out << i << \" #UP \" << n << \"\\n\";\n break;\n case level_kind::Global:\n n = export_name(global_id(l));\n i = m_level2idx.size();\n m_out << i << \" #UG \" << n << \"\\n\";\n break;\n case level_kind::Meta:\n throw exception(\"invald 'export', universe meta-variables cannot be exported\");\n }\n m_level2idx.insert(mk_pair(l, i));\n return i;\n }\n\n void display_binder_info(binder_info const & bi) {\n if (bi.is_implicit())\n m_out << \"#BI\";\n else if (bi.is_strict_implicit())\n m_out << \"#BS\";\n else if (bi.is_inst_implicit())\n m_out << \"#BC\";\n else\n m_out << \"#BD\";\n }\n\n unsigned export_binding(expr const & e, char const * k) {\n unsigned n = export_name(binding_name(e));\n unsigned e1 = export_expr(binding_domain(e));\n unsigned e2 = export_expr(binding_body(e));\n unsigned i = m_expr2idx.size();\n m_out << i << \" \" << k << \" \";\n display_binder_info(binding_info(e));\n m_out << \" \" << n << \" \" << e1 << \" \" << e2 << \"\\n\";\n return i;\n }\n\n unsigned export_const(expr const & e) {\n buffer<unsigned> ls;\n unsigned n = export_name(const_name(e));\n for (level const & l : const_levels(e))\n ls.push_back(export_level(l));\n unsigned i = m_expr2idx.size();\n m_out << i << \" #EC \" << n;\n for (unsigned l : ls)\n m_out << \" \" << l;\n m_out << \"\\n\";\n return i;\n }\n\n unsigned export_expr(expr const & e) {\n auto it = m_expr2idx.find(e);\n if (it != m_expr2idx.end())\n return it->second;\n unsigned i = 0;\n unsigned l, e1, e2;\n switch (e.kind()) {\n case expr_kind::Var:\n i = m_expr2idx.size();\n m_out << i << \" #EV \" << var_idx(e) << \"\\n\";\n break;\n case expr_kind::Sort:\n l = export_level(sort_level(e));\n i = m_expr2idx.size();\n m_out << i << \" #ES \" << l << \"\\n\";\n break;\n case expr_kind::Constant:\n i = export_const(e);\n break;\n case expr_kind::App:\n e1 = export_expr(app_fn(e));\n e2 = export_expr(app_arg(e));\n i = m_expr2idx.size();\n m_out << i << \" #EA \" << e1 << \" \" << e2 << \"\\n\";\n break;\n case expr_kind::Lambda:\n i = export_binding(e, \"#EL\");\n break;\n case expr_kind::Pi:\n i = export_binding(e, \"#EP\");\n break;\n case expr_kind::Meta:\n throw exception(\"invald 'export', meta-variables cannot be exported\");\n case expr_kind::Local:\n throw exception(\"invald 'export', local constants cannot be exported\");\n case expr_kind::Macro:\n throw exception(\"invald 'export', macros cannot be exported\");\n }\n m_expr2idx.insert(mk_pair(e, i));\n return i;\n }\n\n unsigned export_root_expr(expr const & e) {\n return export_expr(m_max_sharing(unfold_all_macros(m_env, e)));\n }\n\n void export_dependencies(expr const & e) {\n for_each(e, [&](expr const & e, unsigned) {\n if (is_constant(e)) {\n name const & n = const_name(e);\n if (!inductive::is_intro_rule(m_env, n) &&\n !inductive::is_elim_rule(m_env, n))\n export_declaration(n);\n }\n return true;\n });\n }\n\n void export_definition(declaration const & d) {\n if (already_exported(d.get_name()))\n return;\n mark(d.get_name());\n unsigned n = export_name(d.get_name());\n buffer<unsigned> ps;\n if (m_all) {\n export_dependencies(d.get_type());\n export_dependencies(d.get_value());\n }\n for (name const & p : d.get_univ_params())\n ps.push_back(export_name(p));\n unsigned t = export_root_expr(d.get_type());\n unsigned v = export_root_expr(d.get_value());\n m_out << \"#DEF \" << n;\n for (unsigned p : ps)\n m_out << \" \" << p;\n m_out << \" | \" << t << \" \" << v << \"\\n\";\n }\n\n void export_axiom(declaration const & d) {\n if (already_exported(d.get_name()))\n return;\n mark(d.get_name());\n unsigned n = export_name(d.get_name());\n buffer<unsigned> ps;\n if (m_all)\n export_dependencies(d.get_type());\n for (name const & p : d.get_univ_params())\n ps.push_back(export_name(p));\n unsigned t = export_root_expr(d.get_type());\n m_out << \"#AX \" << n;\n for (unsigned p : ps)\n m_out << \" \" << p;\n m_out << \" | \" << t << \"\\n\";\n }\n\n void export_inductive(name const & n) {\n if (already_exported(n))\n return;\n mark(n);\n std::tuple<level_param_names, unsigned, list<inductive::inductive_decl>> decls =\n *inductive::is_inductive_decl(m_env, n);\n if (m_all) {\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n export_dependencies(inductive::inductive_decl_type(d));\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n export_dependencies(inductive::intro_rule_type(c));\n }\n }\n }\n for (name const & p : std::get<0>(decls))\n export_name(p);\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n export_name(inductive::inductive_decl_name(d));\n export_root_expr(inductive::inductive_decl_type(d));\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n export_name(inductive::intro_rule_name(c));\n export_root_expr(inductive::intro_rule_type(c));\n }\n }\n m_out << \"#BIND \" << std::get<1>(decls) << \" \" << length(std::get<2>(decls));\n for (name const & p : std::get<0>(decls))\n m_out << \" \" << export_name(p);\n m_out << \"\\n\";\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n m_out << \"#IND \" << export_name(inductive::inductive_decl_name(d)) << \" \"\n << export_root_expr(inductive::inductive_decl_type(d)) << \"\\n\";\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n m_out << \"#INTRO \" << export_name(inductive::intro_rule_name(c)) << \" \"\n << export_root_expr(inductive::intro_rule_type(c)) << \"\\n\";\n }\n }\n m_out << \"#EIND\\n\";\n }\n\n void export_declaration(name const & n) {\n if (inductive::is_inductive_decl(m_env, n)) {\n export_inductive(n);\n } else {\n declaration const & d = m_env.get(n);\n if (d.is_definition())\n export_definition(d);\n else\n export_axiom(d);\n }\n }\n\n void export_declarations() {\n buffer<name> ns;\n to_buffer(get_curr_module_decl_names(m_env), ns);\n std::reverse(ns.begin(), ns.end());\n for (name const & n : ns) {\n export_declaration(n);\n }\n }\n\n void export_direct_imports() {\n buffer<module_name> imports;\n to_buffer(get_curr_module_imports(m_env), imports);\n std::reverse(imports.begin(), imports.end());\n for (module_name const & m : imports) {\n unsigned n = export_name(m.get_name());\n if (m.is_relative()) {\n m_out << \"#RI \" << *m.get_k() << \" \" << n << \"\\n\";\n } else {\n m_out << \"#DI \" << n << \"\\n\";\n }\n }\n }\n\n void export_global_universes() {\n buffer<name> ns;\n to_buffer(get_curr_module_univ_names(m_env), ns);\n std::reverse(ns.begin(), ns.end());\n for (name const & u : ns) {\n unsigned n = export_name(u);\n m_out << \"#UNI \" << n << \"\\n\";\n }\n }\n\npublic:\n exporter(std::ostream & out, environment const & env, bool all):m_out(out), m_env(env), m_all(all) {}\n\n void operator()() {\n m_name2idx.insert(mk_pair(name(), 0));\n m_level2idx.insert(mk_pair(level(), 0));\n if (!m_all)\n export_direct_imports();\n export_global_universes();\n export_declarations();\n }\n};\n\nvoid export_module_as_lowtext(std::ostream & out, environment const & env) {\n exporter(out, env, false)();\n}\n\nvoid export_all_as_lowtext(std::ostream & out, environment const & env) {\n exporter(out, env, true)();\n}\n}\n<commit_msg>feat(library\/export): export the whole environment when using \"--expor-all\"<commit_after>\/*\nCopyright (c) 2015 Microsoft Corporation. All rights reserved.\nReleased under Apache 2.0 license as described in the file LICENSE.\n\nAuthor: Leonardo de Moura\n*\/\n#include <unordered_map>\n#include \"kernel\/expr_maps.h\"\n#include \"kernel\/for_each_fn.h\"\n#include \"kernel\/inductive\/inductive.h\"\n#include \"library\/max_sharing.h\"\n#include \"library\/module.h\"\n#include \"library\/unfold_macros.h\"\n\nnamespace lean {\ntemplate<typename T>\nusing level_map = typename std::unordered_map<level, T, level_hash, level_eq>;\n\ntemplate<typename T>\nusing name_hmap = typename std::unordered_map<name, T, name_hash, name_eq>;\n\n\nclass exporter {\n std::ostream & m_out;\n environment m_env;\n bool m_all;\n name_set m_exported;\n max_sharing_fn m_max_sharing;\n name_hmap<unsigned> m_name2idx;\n level_map<unsigned> m_level2idx;\n expr_map<unsigned> m_expr2idx;\n\n void mark(name const & n) {\n m_exported.insert(n);\n }\n\n bool already_exported(name const & n) {\n return m_exported.contains(n);\n }\n\n unsigned export_name(name const & n) {\n auto it = m_name2idx.find(n);\n if (it != m_name2idx.end())\n return it->second;\n unsigned i;\n if (n.is_anonymous()) {\n lean_unreachable();\n } else if (n.is_string()) {\n unsigned p = export_name(n.get_prefix());\n i = m_name2idx.size();\n m_out << i << \" #NS \" << p << \" \" << n.get_string() << \"\\n\";\n } else {\n unsigned p = export_name(n.get_prefix());\n i = m_name2idx.size();\n m_out << i << \" #NI \" << p << \" \" << n.get_numeral() << \"\\n\";\n }\n m_name2idx.insert(mk_pair(n, i));\n return i;\n }\n\n unsigned export_level(level const & l) {\n auto it = m_level2idx.find(l);\n if (it != m_level2idx.end())\n return it->second;\n unsigned i = 0;\n unsigned l1, l2, n;\n switch (l.kind()) {\n case level_kind::Zero:\n lean_unreachable();\n break;\n case level_kind::Succ:\n l1 = export_level(succ_of(l));\n i = m_level2idx.size();\n m_out << i << \" #US \" << l1 << \"\\n\";\n break;\n case level_kind::Max:\n l1 = export_level(max_lhs(l));\n l2 = export_level(max_rhs(l));\n i = m_level2idx.size();\n m_out << i << \" #UM \" << l1 << \" \" << l2 << \"\\n\";\n break;\n case level_kind::IMax:\n l1 = export_level(imax_lhs(l));\n l2 = export_level(imax_rhs(l));\n i = m_level2idx.size();\n m_out << i << \" #UIM \" << l1 << \" \" << l2 << \"\\n\";\n break;\n case level_kind::Param:\n n = export_name(param_id(l));\n i = m_level2idx.size();\n m_out << i << \" #UP \" << n << \"\\n\";\n break;\n case level_kind::Global:\n n = export_name(global_id(l));\n i = m_level2idx.size();\n m_out << i << \" #UG \" << n << \"\\n\";\n break;\n case level_kind::Meta:\n throw exception(\"invald 'export', universe meta-variables cannot be exported\");\n }\n m_level2idx.insert(mk_pair(l, i));\n return i;\n }\n\n void display_binder_info(binder_info const & bi) {\n if (bi.is_implicit())\n m_out << \"#BI\";\n else if (bi.is_strict_implicit())\n m_out << \"#BS\";\n else if (bi.is_inst_implicit())\n m_out << \"#BC\";\n else\n m_out << \"#BD\";\n }\n\n unsigned export_binding(expr const & e, char const * k) {\n unsigned n = export_name(binding_name(e));\n unsigned e1 = export_expr(binding_domain(e));\n unsigned e2 = export_expr(binding_body(e));\n unsigned i = m_expr2idx.size();\n m_out << i << \" \" << k << \" \";\n display_binder_info(binding_info(e));\n m_out << \" \" << n << \" \" << e1 << \" \" << e2 << \"\\n\";\n return i;\n }\n\n unsigned export_const(expr const & e) {\n buffer<unsigned> ls;\n unsigned n = export_name(const_name(e));\n for (level const & l : const_levels(e))\n ls.push_back(export_level(l));\n unsigned i = m_expr2idx.size();\n m_out << i << \" #EC \" << n;\n for (unsigned l : ls)\n m_out << \" \" << l;\n m_out << \"\\n\";\n return i;\n }\n\n unsigned export_expr(expr const & e) {\n auto it = m_expr2idx.find(e);\n if (it != m_expr2idx.end())\n return it->second;\n unsigned i = 0;\n unsigned l, e1, e2;\n switch (e.kind()) {\n case expr_kind::Var:\n i = m_expr2idx.size();\n m_out << i << \" #EV \" << var_idx(e) << \"\\n\";\n break;\n case expr_kind::Sort:\n l = export_level(sort_level(e));\n i = m_expr2idx.size();\n m_out << i << \" #ES \" << l << \"\\n\";\n break;\n case expr_kind::Constant:\n i = export_const(e);\n break;\n case expr_kind::App:\n e1 = export_expr(app_fn(e));\n e2 = export_expr(app_arg(e));\n i = m_expr2idx.size();\n m_out << i << \" #EA \" << e1 << \" \" << e2 << \"\\n\";\n break;\n case expr_kind::Lambda:\n i = export_binding(e, \"#EL\");\n break;\n case expr_kind::Pi:\n i = export_binding(e, \"#EP\");\n break;\n case expr_kind::Meta:\n throw exception(\"invald 'export', meta-variables cannot be exported\");\n case expr_kind::Local:\n throw exception(\"invald 'export', local constants cannot be exported\");\n case expr_kind::Macro:\n throw exception(\"invald 'export', macros cannot be exported\");\n }\n m_expr2idx.insert(mk_pair(e, i));\n return i;\n }\n\n unsigned export_root_expr(expr const & e) {\n return export_expr(m_max_sharing(unfold_all_macros(m_env, e)));\n }\n\n void export_dependencies(expr const & e) {\n for_each(e, [&](expr const & e, unsigned) {\n if (is_constant(e)) {\n name const & n = const_name(e);\n export_declaration(n);\n }\n return true;\n });\n }\n\n void export_definition(declaration const & d) {\n if (inductive::is_intro_rule(m_env, d.get_name()) || inductive::is_elim_rule(m_env, d.get_name()))\n return;\n if (already_exported(d.get_name()))\n return;\n mark(d.get_name());\n unsigned n = export_name(d.get_name());\n buffer<unsigned> ps;\n if (m_all) {\n export_dependencies(d.get_type());\n export_dependencies(d.get_value());\n }\n for (name const & p : d.get_univ_params())\n ps.push_back(export_name(p));\n unsigned t = export_root_expr(d.get_type());\n unsigned v = export_root_expr(d.get_value());\n m_out << \"#DEF \" << n;\n for (unsigned p : ps)\n m_out << \" \" << p;\n m_out << \" | \" << t << \" \" << v << \"\\n\";\n }\n\n void export_axiom(declaration const & d) {\n if (already_exported(d.get_name()))\n return;\n mark(d.get_name());\n unsigned n = export_name(d.get_name());\n buffer<unsigned> ps;\n if (m_all)\n export_dependencies(d.get_type());\n for (name const & p : d.get_univ_params())\n ps.push_back(export_name(p));\n unsigned t = export_root_expr(d.get_type());\n m_out << \"#AX \" << n;\n for (unsigned p : ps)\n m_out << \" \" << p;\n m_out << \" | \" << t << \"\\n\";\n }\n\n void export_inductive(name const & n) {\n if (already_exported(n))\n return;\n mark(n);\n std::tuple<level_param_names, unsigned, list<inductive::inductive_decl>> decls =\n *inductive::is_inductive_decl(m_env, n);\n if (m_all) {\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n export_dependencies(inductive::inductive_decl_type(d));\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n export_dependencies(inductive::intro_rule_type(c));\n }\n }\n }\n for (name const & p : std::get<0>(decls))\n export_name(p);\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n export_name(inductive::inductive_decl_name(d));\n export_root_expr(inductive::inductive_decl_type(d));\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n export_name(inductive::intro_rule_name(c));\n export_root_expr(inductive::intro_rule_type(c));\n }\n }\n m_out << \"#BIND \" << std::get<1>(decls) << \" \" << length(std::get<2>(decls));\n for (name const & p : std::get<0>(decls))\n m_out << \" \" << export_name(p);\n m_out << \"\\n\";\n for (inductive::inductive_decl const & d : std::get<2>(decls)) {\n m_out << \"#IND \" << export_name(inductive::inductive_decl_name(d)) << \" \"\n << export_root_expr(inductive::inductive_decl_type(d)) << \"\\n\";\n for (inductive::intro_rule const & c : inductive::inductive_decl_intros(d)) {\n m_out << \"#INTRO \" << export_name(inductive::intro_rule_name(c)) << \" \"\n << export_root_expr(inductive::intro_rule_type(c)) << \"\\n\";\n }\n }\n m_out << \"#EIND\\n\";\n }\n\n void export_declaration(name const & n) {\n if (inductive::is_inductive_decl(m_env, n)) {\n export_inductive(n);\n } else {\n declaration const & d = m_env.get(n);\n if (d.is_definition())\n export_definition(d);\n else\n export_axiom(d);\n }\n }\n\n void export_declarations() {\n if (m_all) {\n m_env.for_each_declaration([&](declaration const & d) {\n export_declaration(d.get_name());\n });\n } else {\n buffer<name> ns;\n to_buffer(get_curr_module_decl_names(m_env), ns);\n std::reverse(ns.begin(), ns.end());\n for (name const & n : ns) {\n export_declaration(n);\n }\n }\n }\n\n void export_direct_imports() {\n if (!m_all) {\n buffer<module_name> imports;\n to_buffer(get_curr_module_imports(m_env), imports);\n std::reverse(imports.begin(), imports.end());\n for (module_name const & m : imports) {\n unsigned n = export_name(m.get_name());\n if (m.is_relative()) {\n m_out << \"#RI \" << *m.get_k() << \" \" << n << \"\\n\";\n } else {\n m_out << \"#DI \" << n << \"\\n\";\n }\n }\n }\n }\n\n void export_global_universes() {\n if (m_all) {\n m_env.for_each_universe([&](name const & u) {\n unsigned n = export_name(u);\n m_out << \"#UNI \" << n << \"\\n\";\n });\n } else {\n buffer<name> ns;\n to_buffer(get_curr_module_univ_names(m_env), ns);\n std::reverse(ns.begin(), ns.end());\n for (name const & u : ns) {\n unsigned n = export_name(u);\n m_out << \"#UNI \" << n << \"\\n\";\n }\n }\n }\n\npublic:\n exporter(std::ostream & out, environment const & env, bool all):m_out(out), m_env(env), m_all(all) {}\n\n void operator()() {\n m_name2idx.insert(mk_pair(name(), 0));\n m_level2idx.insert(mk_pair(level(), 0));\n export_direct_imports();\n export_global_universes();\n export_declarations();\n }\n};\n\nvoid export_module_as_lowtext(std::ostream & out, environment const & env) {\n exporter(out, env, false)();\n}\n\nvoid export_all_as_lowtext(std::ostream & out, environment const & env) {\n exporter(out, env, true)();\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_ALL_DYN_LINK\n#define BOOST_LOG_USE_NATIVE_SYSLOG\n#include <logging\/logger.hpp>\n#include <boost\/utility\/empty_deleter.hpp>\n#include <boost\/log\/sinks\/text_file_backend.hpp>\n#include <boost\/log\/sinks\/text_ostream_backend.hpp>\n#include <boost\/log\/sinks\/syslog_backend.hpp>\n#include <boost\/log\/sinks\/sync_frontend.hpp>\n#include <boost\/log\/sources\/logger.hpp>\n#include <boost\/log\/common.hpp>\n#include <boost\/log\/core.hpp>\n#include <ios>\n#include <utility>\n\nnamespace fc\n{\n\nstream_handle::stream_handle(std::function<void()> deleter) : deleter(deleter)\n{\n}\n\nstream_handle::~stream_handle()\n{\n\tdeleter();\n}\n\nlogger* logger::get()\n{\n\tstatic logger instance;\n\treturn &instance;\n}\n\nusing namespace boost::log;\n\ntemplate <class backend>\nusing sync_sink = sinks::synchronous_sink<backend>;\n\nvoid logger::add_file_log(std::string filename)\n{\n\tauto file_sink = boost::make_shared<sinks::text_file_backend>(\n\t keywords::file_name = filename,\n\t keywords::open_mode = std::ios_base::app | std::ios_base::out);\n\tcore::get()->add_sink(boost::make_shared<sync_sink<sinks::text_file_backend>>(file_sink));\n}\n\nvoid logger::add_syslog_log(std::string progname)\n{\n\tauto syslog_sink = boost::make_shared<sinks::syslog_backend>(\n\t keywords::use_impl = sinks::syslog::impl_types::native,\n\t keywords::ident = progname);\n\tcore::get()->add_sink(boost::make_shared<sync_sink<sinks::syslog_backend>>(syslog_sink));\n}\n\nstream_handle logger::add_stream_log(std::ostream& stream, logger::flush flush,\n logger::cleanup cleanup)\n{\n\tauto stream_sink = boost::make_shared<sinks::text_ostream_backend>();\n\tauto shared_stream = boost::shared_ptr<std::ostream>(&stream, boost::empty_deleter());\n\tstream_sink->add_stream(shared_stream);\n\tstream_sink->auto_flush(static_cast<bool>(flush));\n\tcore::get()->add_sink(boost::make_shared<sync_sink<sinks::text_ostream_backend>>(stream_sink));\n\n\t\/\/ Prepare a function that will remove the stream from the sink\n\tstd::function<void()> cleanup_fun;\n\tif (static_cast<bool>(cleanup))\n\t\tcleanup_fun = [=]() { stream_sink->remove_stream(shared_stream); };\n\telse\n\t\tcleanup_fun = []() {};\n\n\treturn stream_handle(cleanup_fun);\n}\n\nlogger::logger()\n{\n}\n\nclass log_client::log_client_impl\n{\npublic:\n\tlog_client_impl(const region_info* region)\n\t : lg(keywords::channel = (region ? region->get_id().key : \"(null)\"))\n\t{\n\t}\n\tvoid write(const std::string& msg)\n\t{\n\t\tBOOST_LOG(lg) << msg;\n\t}\nprivate:\n\tsources::channel_logger<> lg;\n};\n\nvoid log_client::write(const std::string& msg)\n{\n\tlog_client_pimpl->write(msg);\n}\n\nlog_client::log_client() : log_client_pimpl(std::make_unique<log_client::log_client_impl>(nullptr))\n{\n}\n\nlog_client::log_client(const region_info* region)\n : log_client_pimpl(std::make_unique<log_client::log_client_impl>(region))\n{\n}\n\nlog_client::log_client(const log_client& other)\n : log_client_pimpl(std::make_unique<log_client::log_client_impl>(*other.log_client_pimpl))\n{\n}\n\nlog_client& log_client::operator=(log_client other)\n{\n\tstd::swap(log_client_pimpl, other.log_client_pimpl);\n\treturn *this;\n}\n\nlog_client::log_client(log_client&&) = default;\nlog_client::~log_client() = default;\n\n} \/\/ namespace fc\n<commit_msg>logging: output region in all backends.<commit_after>#define BOOST_ALL_DYN_LINK\n#define BOOST_LOG_USE_NATIVE_SYSLOG\n#include <logging\/logger.hpp>\n#include <boost\/utility\/empty_deleter.hpp>\n#include <boost\/log\/expressions.hpp>\n#include <boost\/log\/sinks\/text_file_backend.hpp>\n#include <boost\/log\/sinks\/text_ostream_backend.hpp>\n#include <boost\/log\/sinks\/syslog_backend.hpp>\n#include <boost\/log\/sinks\/sync_frontend.hpp>\n#include <boost\/log\/sources\/logger.hpp>\n#include <boost\/log\/common.hpp>\n#include <boost\/log\/core.hpp>\n#include <ios>\n#include <utility>\n\nnamespace fc\n{\n\nstream_handle::stream_handle(std::function<void()> deleter) : deleter(deleter)\n{\n}\n\nstream_handle::~stream_handle()\n{\n\tdeleter();\n}\n\nlogger* logger::get()\n{\n\tstatic logger instance;\n\treturn &instance;\n}\n\nusing namespace boost::log;\n\ntemplate <class backend>\nusing sync_sink = sinks::synchronous_sink<backend>;\n\nnamespace\n{\nBOOST_LOG_ATTRIBUTE_KEYWORD(region, \"Channel\", std::string);\nBOOST_LOG_ATTRIBUTE_KEYWORD(severity, \"Severity\", int);\n\nauto get_formatter()\n{\n\tnamespace expr = boost::log::expressions;\n\treturn expr::stream << severity << \"[\" << region << \"] \" << expr::smessage;\n}\n} \/\/ anonymous namespace\n\nvoid logger::add_file_log(std::string filename)\n{\n\tauto file_sink = boost::make_shared<sinks::text_file_backend>(\n\t keywords::file_name = filename,\n\t keywords::open_mode = std::ios_base::app | std::ios_base::out);\n\tauto sink_front = boost::make_shared<sync_sink<sinks::text_file_backend>>(file_sink);\n\tsink_front->set_formatter(get_formatter());\n\tcore::get()->add_sink(sink_front);\n}\n\nvoid logger::add_syslog_log(std::string progname)\n{\n\tauto syslog_sink = boost::make_shared<sinks::syslog_backend>(\n\t keywords::use_impl = sinks::syslog::impl_types::native,\n\t keywords::ident = progname);\n\tauto sink_front = boost::make_shared<sync_sink<sinks::syslog_backend>>(syslog_sink);\n\tsink_front->set_formatter(get_formatter());\n\tcore::get()->add_sink(sink_front);\n}\n\nstream_handle logger::add_stream_log(std::ostream& stream, logger::flush flush,\n logger::cleanup cleanup)\n{\n\tauto stream_sink = boost::make_shared<sinks::text_ostream_backend>();\n\tauto shared_stream = boost::shared_ptr<std::ostream>(&stream, boost::empty_deleter());\n\tstream_sink->add_stream(shared_stream);\n\tstream_sink->auto_flush(static_cast<bool>(flush));\n\tauto sink_front = boost::make_shared<sync_sink<sinks::text_ostream_backend>>(stream_sink);\n\tsink_front->set_formatter(get_formatter());\n\tcore::get()->add_sink(sink_front);\n\n\t\/\/ Prepare a function that will remove the stream from the sink\n\tstd::function<void()> cleanup_fun;\n\tif (static_cast<bool>(cleanup))\n\t\tcleanup_fun = [=]() { stream_sink->remove_stream(shared_stream); };\n\telse\n\t\tcleanup_fun = []() {};\n\n\treturn stream_handle(cleanup_fun);\n}\n\nlogger::logger()\n{\n}\n\nclass log_client::log_client_impl\n{\npublic:\n\tlog_client_impl(const region_info* region)\n\t : lg(keywords::channel = (region ? region->get_id().key : \"(null)\"))\n\t{\n\t}\n\tvoid write(const std::string& msg)\n\t{\n\t\tBOOST_LOG(lg) << msg;\n\t}\nprivate:\n\tsources::channel_logger<> lg;\n};\n\nvoid log_client::write(const std::string& msg)\n{\n\tlog_client_pimpl->write(msg);\n}\n\nlog_client::log_client() : log_client_pimpl(std::make_unique<log_client::log_client_impl>(nullptr))\n{\n}\n\nlog_client::log_client(const region_info* region)\n : log_client_pimpl(std::make_unique<log_client::log_client_impl>(region))\n{\n}\n\nlog_client::log_client(const log_client& other)\n : log_client_pimpl(std::make_unique<log_client::log_client_impl>(*other.log_client_pimpl))\n{\n}\n\nlog_client& log_client::operator=(log_client other)\n{\n\tstd::swap(log_client_pimpl, other.log_client_pimpl);\n\treturn *this;\n}\n\nlog_client::log_client(log_client&&) = default;\nlog_client::~log_client() = default;\n\n} \/\/ namespace fc\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 Chirstopher Torres (Raven), L3nn0x\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http :\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <cxxopts.hpp>\n#include \"cloginserver.h\"\n#include \"config.h\"\n#include \"logconsole.h\"\n#include \"version.h\"\n#include \"network_thread_pool.h\"\n\n#include \"connection.h\"\n#include \"mysqlconnection.h\"\n\nnamespace {\nvoid DisplayTitle()\n{\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n {\n log->info( \"--------------------------------\" );\n log->info( \" osIROSE 2 Alpha \" );\n log->info( \" http:\/\/forum.dev-osrose.com\/ \" );\n log->info( \"--------------------------------\" );\n log->info( \"Git Branch\/Revision: {}\/{}\", GIT_BRANCH, GIT_COMMIT_HASH );\n }\n}\n\nvoid CheckUser()\n{\n#ifndef _WIN32\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n {\n if ((getuid() == 0) && (getgid() == 0)) {\n log->warn( \"You are running as the root superuser.\" );\n log->warn( \"It is unnecessary and unsafe to run with root privileges.\" );\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(2000));\n }\n#endif\n}\n\nvoid ParseCommandLine(int argc, char** argv)\n{\n cxxopts::Options options(argv[0], \"osIROSE login server\");\n\n try {\n std::string config_file_path = \"\";\n options.add_options()\n (\"f,file\", \"Config file path\", cxxopts::value<std::string>(config_file_path)\n ->default_value(\"server.json\"), \"FILE_PATH\")\n (\"l,level\", \"Logging level (0-9)\", cxxopts::value<int>()\n ->default_value(\"3\"), \"LEVEL\")\n (\"ip\", \"Client listen IP Address\", cxxopts::value<std::string>()\n ->default_value(\"0.0.0.0\"), \"IP\")\n (\"port\", \"Client listen port\", cxxopts::value<int>()\n ->default_value(\"29000\"), \"PORT\")\n (\"iscip\", \"ISC listen IP Address\", cxxopts::value<std::string>()\n ->default_value(\"127.0.0.1\"), \"IP\")\n (\"iscport\", \"ISC listen port\", cxxopts::value<int>()\n ->default_value(\"29010\"), \"PORT\")\n (\"t,maxthreads\", \"Max thread count\", cxxopts::value<int>()\n ->default_value(\"512\"), \"COUNT\")\n (\"h,help\", \"Print this help text\")\n ;\n\n options.parse(argc, argv);\n\n \/\/ Check to see if the user wants to see the help text\n if (options.count(\"help\"))\n {\n std::cout << options.help({\"\", \"Group\"}) << std::endl;\n exit(0);\n }\n\n Core::Config& config = Core::Config::getInstance(config_file_path);\n\n \/\/ We are using if checks here because we only want to override the config file if the option was supplied\n \/\/ Since this is a login server startup function we can get away with a little bit of overhead\n if( options.count(\"level\") )\n config.loginServer().logLevel = options[\"level\"].as<int>();\n\n if( options.count(\"ip\") )\n config.serverData().ip = options[\"ip\"].as<std::string>();\n\n if( options.count(\"port\") )\n config.loginServer().clientPort = options[\"port\"].as<int>();\n\n if( options.count(\"iscip\") )\n config.serverData().iscListenIp = options[\"iscip\"].as<std::string>();\n\n if( options.count(\"iscport\") )\n config.loginServer().iscPort = options[\"iscport\"].as<int>();\n\n if( options.count(\"maxthreads\") )\n config.serverData().maxThreads = options[\"maxthreads\"].as<int>();\n }\n catch (const cxxopts::OptionException& ex) {\n std::cout << ex.what() << std::endl;\n std::cout << options.help({\"\", \"Group\"}) << std::endl;\n exit(1);\n }\n}\n\nvoid clearSessions() {\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::SessionTable session;\n conn(sqlpp::remove_from(session).unconditionally()); \/\/ .where(session.time < floor<::sqlpp::chrono::minutes>(std::chrono::system_clock::now()) - 5m)\n Core::AccountTable table;\n conn(sqlpp::update(table).set(table.online = 0).unconditionally());\n}\n\n} \/\/ end namespace\n\nint main(int argc, char* argv[]) {\n try {\n ParseCommandLine(argc, argv);\n\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n log->info( \"Starting up server...\" );\n\n Core::Config& config = Core::Config::getInstance();\n Core::CLog::SetLevel((spdlog::level::level_enum)config.loginServer().logLevel);\n DisplayTitle();\n CheckUser();\n\n if(auto log = console.lock()) {\n log->set_level((spdlog::level::level_enum)config.loginServer().logLevel);\n log->trace(\"Trace logs are enabled.\");\n log->debug(\"Debug logs are enabled.\");\n }\n\n Core::NetworkThreadPool::GetInstance(config.serverData().maxThreads);\n\n Core::connectionPool.addConnector(Core::osirose, std::bind(\n Core::mysqlFactory,\n config.database().user,\n config.database().password,\n config.database().database,\n config.database().host));\n\n clearSessions();\n\n CLoginServer clientServer;\n CLoginServer iscServer(true);\n\n clientServer.init(config.serverData().ip, config.loginServer().clientPort);\n clientServer.listen();\n\n iscServer.init(config.serverData().iscListenIp, config.loginServer().iscPort);\n iscServer.listen();\n\n while (clientServer.is_active()) {\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n }\n\n if(auto log = console.lock())\n log->info( \"Server shutting down...\" );\n Core::NetworkThreadPool::DeleteInstance();\n spdlog::drop_all();\n\n }\n catch (const spdlog::spdlog_ex& ex) {\n std::cout << \"Log failed: \" << ex.what() << std::endl;\n }\n return 0;\n}\n<commit_msg>Login server will now only delete stale sessions<commit_after>\/\/ Copyright 2016 Chirstopher Torres (Raven), L3nn0x\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ http :\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <cxxopts.hpp>\n#include \"cloginserver.h\"\n#include \"config.h\"\n#include \"logconsole.h\"\n#include \"version.h\"\n#include \"network_thread_pool.h\"\n\n#include \"connection.h\"\n#include \"mysqlconnection.h\"\n\n#include <chrono>\n\nnamespace {\nvoid DisplayTitle()\n{\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n {\n log->info( \"--------------------------------\" );\n log->info( \" osIROSE 2 Alpha \" );\n log->info( \" http:\/\/forum.dev-osrose.com\/ \" );\n log->info( \"--------------------------------\" );\n log->info( \"Git Branch\/Revision: {}\/{}\", GIT_BRANCH, GIT_COMMIT_HASH );\n }\n}\n\nvoid CheckUser()\n{\n#ifndef _WIN32\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n {\n if ((getuid() == 0) && (getgid() == 0)) {\n log->warn( \"You are running as the root superuser.\" );\n log->warn( \"It is unnecessary and unsafe to run with root privileges.\" );\n }\n std::this_thread::sleep_for(std::chrono::milliseconds(2000));\n }\n#endif\n}\n\nvoid ParseCommandLine(int argc, char** argv)\n{\n cxxopts::Options options(argv[0], \"osIROSE login server\");\n\n try {\n std::string config_file_path = \"\";\n options.add_options()\n (\"f,file\", \"Config file path\", cxxopts::value<std::string>(config_file_path)\n ->default_value(\"server.json\"), \"FILE_PATH\")\n (\"l,level\", \"Logging level (0-9)\", cxxopts::value<int>()\n ->default_value(\"3\"), \"LEVEL\")\n (\"ip\", \"Client listen IP Address\", cxxopts::value<std::string>()\n ->default_value(\"0.0.0.0\"), \"IP\")\n (\"port\", \"Client listen port\", cxxopts::value<int>()\n ->default_value(\"29000\"), \"PORT\")\n (\"iscip\", \"ISC listen IP Address\", cxxopts::value<std::string>()\n ->default_value(\"127.0.0.1\"), \"IP\")\n (\"iscport\", \"ISC listen port\", cxxopts::value<int>()\n ->default_value(\"29010\"), \"PORT\")\n (\"t,maxthreads\", \"Max thread count\", cxxopts::value<int>()\n ->default_value(\"512\"), \"COUNT\")\n (\"h,help\", \"Print this help text\")\n ;\n\n options.parse(argc, argv);\n\n \/\/ Check to see if the user wants to see the help text\n if (options.count(\"help\"))\n {\n std::cout << options.help({\"\", \"Group\"}) << std::endl;\n exit(0);\n }\n\n Core::Config& config = Core::Config::getInstance(config_file_path);\n\n \/\/ We are using if checks here because we only want to override the config file if the option was supplied\n \/\/ Since this is a login server startup function we can get away with a little bit of overhead\n if( options.count(\"level\") )\n config.loginServer().logLevel = options[\"level\"].as<int>();\n\n if( options.count(\"ip\") )\n config.serverData().ip = options[\"ip\"].as<std::string>();\n\n if( options.count(\"port\") )\n config.loginServer().clientPort = options[\"port\"].as<int>();\n\n if( options.count(\"iscip\") )\n config.serverData().iscListenIp = options[\"iscip\"].as<std::string>();\n\n if( options.count(\"iscport\") )\n config.loginServer().iscPort = options[\"iscport\"].as<int>();\n\n if( options.count(\"maxthreads\") )\n config.serverData().maxThreads = options[\"maxthreads\"].as<int>();\n }\n catch (const cxxopts::OptionException& ex) {\n std::cout << ex.what() << std::endl;\n std::cout << options.help({\"\", \"Group\"}) << std::endl;\n exit(1);\n }\n}\n\nvoid deleteStaleSessions() {\n using namespace std::chrono_literals;\n using ::date::floor;\n static std::chrono::steady_clock::time_point time{};\n if (Core::Time::GetTickCount() - time < 5min)\n return;\n auto conn = Core::connectionPool.getConnection(Core::osirose);\n Core::SessionTable session;\n Core::AccountTable table;\n conn(sqlpp::update(table.join(session).on(table.id == session.userid)).set(table.online = 0).where(session.time < floor<std::chrono::minutes>(std::chrono::system_clock::now()) - 5min));\n conn(sqlpp::remove_from(session).where(session.time < floor<std::chrono::minutes>(std::chrono::system_clock::now()) - 5min));\n}\n\n} \/\/ end namespace\n\nint main(int argc, char* argv[]) {\n try {\n ParseCommandLine(argc, argv);\n\n auto console = Core::CLog::GetLogger(Core::log_type::GENERAL);\n if(auto log = console.lock())\n log->info( \"Starting up server...\" );\n\n Core::Config& config = Core::Config::getInstance();\n Core::CLog::SetLevel((spdlog::level::level_enum)config.loginServer().logLevel);\n DisplayTitle();\n CheckUser();\n\n if(auto log = console.lock()) {\n log->set_level((spdlog::level::level_enum)config.loginServer().logLevel);\n log->trace(\"Trace logs are enabled.\");\n log->debug(\"Debug logs are enabled.\");\n }\n\n Core::NetworkThreadPool::GetInstance(config.serverData().maxThreads);\n\n Core::connectionPool.addConnector(Core::osirose, std::bind(\n Core::mysqlFactory,\n config.database().user,\n config.database().password,\n config.database().database,\n config.database().host));\n\n CLoginServer clientServer;\n CLoginServer iscServer(true);\n\n clientServer.init(config.serverData().ip, config.loginServer().clientPort);\n clientServer.listen();\n\n iscServer.init(config.serverData().iscListenIp, config.loginServer().iscPort);\n iscServer.listen();\n\n while (clientServer.is_active()) {\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n deleteStaleSessions();\n }\n\n if(auto log = console.lock())\n log->info( \"Server shutting down...\" );\n Core::NetworkThreadPool::DeleteInstance();\n spdlog::drop_all();\n\n }\n catch (const spdlog::spdlog_ex& ex) {\n std::cout << \"Log failed: \" << ex.what() << std::endl;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2019, NVIDIA CORPORATION. All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of NVIDIA CORPORATION nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <regex>\n\n#include \"parser.hpp\"\n#include \"arch-properties.hpp\"\n\nnamespace mapping\n{\n\n\/\/\n\/\/ Shared state.\n\/\/\n\nArchProperties arch_props_;\nproblem::Workload workload_;\n\n\/\/\n\/\/ Forward declarations.\n\/\/\nunsigned FindTargetTilingLevel(config::CompoundConfigNode constraint, std::string type);\nstd::map<problem::Shape::DimensionID, int> ParseUserFactors(config::CompoundConfigNode constraint);\nstd::vector<problem::Shape::DimensionID> ParseUserPermutations(config::CompoundConfigNode constraint);\nvoid ParseUserDatatypeBypassSettings(config::CompoundConfigNode constraint,\n unsigned level,\n problem::PerDataSpace<std::string>& user_bypass_strings);\n\/\/\n\/\/ Parse mapping in libconfig format and generate data structure.\n\/\/\nMapping ParseAndConstruct(config::CompoundConfigNode config,\n model::Engine::Specs& arch_specs,\n problem::Workload workload)\n{\n arch_props_.Construct(arch_specs);\n workload_ = workload;\n \n std::map<unsigned, std::map<problem::Shape::DimensionID, int>> user_factors;\n std::map<unsigned, std::vector<problem::Shape::DimensionID>> user_permutations;\n std::map<unsigned, std::uint32_t> user_spatial_splits;\n problem::PerDataSpace<std::string> user_bypass_strings;\n\n \/\/ Initialize user bypass strings to \"XXXXX...1\" (note the 1 at the end).\n \/\/ FIXME: there's probably a cleaner way\/place to initialize this.\n for (unsigned pvi = 0; pvi < unsigned(problem::GetShape()->NumDataSpaces); pvi++)\n {\n std::string xxx(arch_props_.StorageLevels(), 'X');\n xxx.back() = '1';\n user_bypass_strings[problem::Shape::DataSpaceID(pvi)] = xxx;\n }\n\n \/\/ Parse user-provided mapping.\n assert(config.isList());\n \n \/\/ Iterate over all the directives.\n int len = config.getLength();\n for (int i = 0; i < len; i ++)\n {\n auto directive = config[i];\n \/\/ Find out if this is a temporal directive or a spatial directive.\n std::string type;\n assert(directive.lookupValue(\"type\", type));\n\n auto level_id = FindTargetTilingLevel(directive, type);\n\n if (type == \"temporal\" || type == \"spatial\")\n {\n auto level_factors = ParseUserFactors(directive);\n if (level_factors.size() > 0)\n {\n user_factors[level_id] = level_factors;\n }\n \n auto level_permutations = ParseUserPermutations(directive);\n if (level_permutations.size() > 0)\n {\n user_permutations[level_id] = level_permutations;\n }\n\n if (type == \"spatial\")\n {\n \/\/ Initialize user spatial splits to map all dimensions to the hardware X-axis.\n std::uint32_t user_split = unsigned(problem::GetShape()->NumDimensions);\n directive.lookupValue(\"split\", user_split);\n user_spatial_splits[level_id] = user_split;\n }\n }\n else if (type == \"datatype\" || type == \"bypass\")\n {\n ParseUserDatatypeBypassSettings(directive,\n arch_props_.TilingToStorage(level_id),\n user_bypass_strings);\n }\n else\n {\n assert(false);\n }\n }\n\n \/\/ Validity checks.\n std::map<problem::Shape::DimensionID, int> dimension_factor_products;\n for (unsigned dim = 0; dim < problem::GetShape()->NumDimensions; dim++)\n dimension_factor_products[dim] = 1;\n\n \/\/ Construct the mapping from the parsed sub-structures.\n \/\/ A set of subnests, one for each tiling level.\n loop::NestConfig subnests(arch_props_.TilingLevels());\n\n \/\/ Construct num_storage_levels loop-nest partitions and assign factors, dimensions\n \/\/ and spatial split points.\n for (uint64_t level = 0; level < arch_props_.TilingLevels(); level++)\n {\n auto permutation = user_permutations.find(level);\n if (permutation == user_permutations.end())\n {\n std::cerr << \"ERROR: parsing mapping: permutation not found for level: \"\n << arch_props_.TilingLevelName(level) << std::endl;\n exit(1);\n }\n assert(permutation->second.size() == std::size_t(problem::GetShape()->NumDimensions));\n \n auto factors = user_factors.find(level);\n if (factors == user_factors.end())\n {\n std::cerr << \"ERROR: parsing mapping: factors not found for level: \"\n << arch_props_.TilingLevelName(level) << std::endl;\n exit(1);\n }\n assert(factors->second.size() == std::size_t(problem::GetShape()->NumDimensions));\n\n \/\/ Each partition has problem::GetShape()->NumDimensions loops.\n for (unsigned idim = 0; idim < unsigned(problem::GetShape()->NumDimensions); idim++)\n {\n loop::Descriptor loop;\n loop.dimension = permutation->second.at(idim);\n loop.start = 0;\n loop.end = factors->second.at(loop.dimension);\n loop.stride = 1; \/\/ FIXME.\n loop.spacetime_dimension = arch_props_.IsSpatial(level)\n ? (idim < user_spatial_splits.at(level) ? spacetime::Dimension::SpaceX : spacetime::Dimension::SpaceY)\n : spacetime::Dimension::Time;\n subnests.at(level).push_back(loop);\n\n dimension_factor_products[loop.dimension] *= loop.end;\n }\n }\n\n \/\/ All user-provided factors must multiply-up to the dimension size.\n bool fault = false;\n for (unsigned dim = 0; dim < problem::GetShape()->NumDimensions; dim++)\n {\n if (dimension_factor_products[dim] != workload_.GetBound(dim))\n {\n std::cerr << \"ERROR: parsing mapping: product of all factors of dimension \"\n << problem::GetShape()->DimensionIDToName.at(dim) << \" is \"\n << dimension_factor_products[dim] << \", which is not equal to \"\n << \"the dimension bound \" << workload_.GetBound(dim)\n << std::endl;\n fault = true;\n }\n }\n if (fault)\n {\n exit(1);\n }\n\n \/\/ Concatenate the subnests to form the final mapping nest.\n Mapping mapping;\n \n std::uint64_t storage_level = 0;\n for (uint64_t i = 0; i < arch_props_.TilingLevels(); i++)\n {\n uint64_t num_subnests_added = 0;\n for (int dim = 0; dim < int(problem::GetShape()->NumDimensions); dim++)\n {\n \/\/ Ignore trivial factors\n \/\/ This reduces computation time by 1.5x on average.\n if (subnests[i][dim].start + subnests[i][dim].stride < subnests[i][dim].end)\n {\n mapping.loop_nest.AddLoop(subnests[i][dim]);\n num_subnests_added++;\n }\n }\n if (!arch_props_.IsSpatial(i))\n {\n if (num_subnests_added == 0)\n {\n \/\/ Add a trivial temporal nest to make sure\n \/\/ we have at least one subnest in each level.\n mapping.loop_nest.AddLoop(problem::Shape::DimensionID(int(problem::GetShape()->NumDimensions) - 1),\n 0, 1, 1, spacetime::Dimension::Time);\n }\n mapping.loop_nest.AddStorageTilingBoundary();\n storage_level++;\n }\n }\n\n \/\/ The user_mask input is a set of per-datatype strings. Each string has a length\n \/\/ equal to num_storage_levels, and contains the characters 0 (bypass), 1 (keep),\n \/\/ or X (evaluate both). \n for (unsigned pvi = 0; pvi < unsigned(problem::GetShape()->NumDataSpaces); pvi++)\n {\n auto pv = problem::Shape::DataSpaceID(pvi);\n\n \/\/ Start parsing the user mask string.\n assert(user_bypass_strings.at(pv).length() <= arch_props_.StorageLevels());\n\n \/\/ The first loop runs the length of the user-specified string.\n unsigned level = 0;\n for (; level < user_bypass_strings.at(pv).length(); level++)\n {\n char spec = user_bypass_strings.at(pv).at(level);\n switch (spec)\n {\n case '0':\n mapping.datatype_bypass_nest.at(pvi).reset(level);\n break;\n \n case '1':\n mapping.datatype_bypass_nest.at(pvi).set(level);\n break;\n\n case 'X':\n \/\/ We allow this to be left un-specified by the user. Default is \"keep\".\n mapping.datatype_bypass_nest.at(pvi).set(level);\n break; \n \n default:\n assert(false);\n break;\n }\n }\n } \/\/ for (pvi)\n\n \/\/ Finalize mapping.\n mapping.id = 0;\n\n return mapping;\n}\n\n\/\/\n\/\/ FindTargetTilingLevel()\n\/\/\nunsigned FindTargetTilingLevel(config::CompoundConfigNode directive, std::string type)\n{\n auto num_storage_levels = arch_props_.StorageLevels();\n \n \/\/\n \/\/ Find the target storage level. This can be specified as either a name or an ID.\n \/\/\n std::string storage_level_name;\n unsigned storage_level_id;\n \n if (directive.lookupValue(\"target\", storage_level_name))\n {\n \/\/ Find this name within the storage hierarchy in the arch specs.\n for (storage_level_id = 0; storage_level_id < num_storage_levels; storage_level_id++)\n {\n if (arch_props_.Specs().topology.GetStorageLevel(storage_level_id)->level_name == storage_level_name)\n break;\n }\n if (storage_level_id == num_storage_levels)\n {\n std::cerr << \"ERROR: target storage level not found: \" << storage_level_name << std::endl;\n exit(1);\n }\n }\n else\n {\n int id;\n assert(directive.lookupValue(\"target\", id));\n assert(id >= 0 && id < int(num_storage_levels));\n storage_level_id = static_cast<unsigned>(id);\n }\n\n assert(storage_level_id < num_storage_levels);\n\n \/\/\n \/\/ Translate this storage ID to a tiling ID.\n \/\/\n unsigned tiling_level_id;\n if (type == \"temporal\" || type == \"datatype\" || type == \"bypass\")\n {\n \/\/ This should always succeed.\n tiling_level_id = arch_props_.TemporalToTiling(storage_level_id);\n }\n else if (type == \"spatial\")\n {\n \/\/ This will fail if this level isn't a spatial tiling level.\n tiling_level_id = arch_props_.SpatialToTiling(storage_level_id);\n }\n else\n {\n std::cerr << \"ERROR: unrecognized mapping directive type: \" << type << std::endl;\n exit(1);\n }\n\n return tiling_level_id;\n}\n\n\/\/\n\/\/ Parse user factors.\n\/\/\nstd::map<problem::Shape::DimensionID, int> ParseUserFactors(config::CompoundConfigNode directive)\n{\n std::map<problem::Shape::DimensionID, int> retval;\n \n std::string buffer;\n if (directive.lookupValue(\"factors\", buffer))\n {\n std::regex re(\"([A-Za-z]+)[[:space:]]*[=]*[[:space:]]*([0-9]+)\", std::regex::extended);\n std::smatch sm;\n std::string str = std::string(buffer);\n\n while (std::regex_search(str, sm, re))\n {\n std::string dimension_name = sm[1];\n problem::Shape::DimensionID dimension;\n try\n {\n dimension = problem::GetShape()->DimensionNameToID.at(dimension_name);\n }\n catch (const std::out_of_range& oor)\n {\n std::cerr << \"ERROR: parsing factors: \" << buffer << \": dimension \" << dimension_name\n << \" not found in problem shape.\" << std::endl;\n exit(1);\n }\n\n int end = std::stoi(sm[2]);\n if (end == 0)\n {\n std::cerr << \"WARNING: Interpreting 0 to mean full problem dimension instead of residue.\" << std::endl;\n end = workload_.GetBound(dimension);\n }\n else if (end > workload_.GetBound(dimension))\n {\n std::cerr << \"WARNING: Directive \" << dimension << \"=\" << end\n << \" exceeds problem dimension \" << dimension << \"=\"\n << workload_.GetBound(dimension) << \". Setting directive \"\n << dimension << \"=\" << workload_.GetBound(dimension) << std::endl;\n end = workload_.GetBound(dimension);\n }\n else\n {\n assert(end > 0);\n }\n\n \/\/ Found all the information we need to setup a factor!\n retval[dimension] = end;\n\n str = sm.suffix().str();\n }\n }\n\n return retval;\n}\n\n\/\/\n\/\/ Parse user permutations.\n\/\/\nstd::vector<problem::Shape::DimensionID> ParseUserPermutations(config::CompoundConfigNode directive)\n{\n std::vector<problem::Shape::DimensionID> retval;\n \n std::string buffer;\n if (directive.lookupValue(\"permutation\", buffer))\n {\n std::istringstream iss(buffer);\n char token;\n while (iss >> token)\n {\n auto dimension = problem::GetShape()->DimensionNameToID.at(std::string(1, token)); \/\/ note: can fault.\n retval.push_back(dimension);\n }\n }\n\n return retval;\n}\n\n\/\/\n\/\/ Parse user datatype bypass settings.\n\/\/\nvoid ParseUserDatatypeBypassSettings(config::CompoundConfigNode directive,\n unsigned level,\n problem::PerDataSpace<std::string>& user_bypass_strings)\n{\n \/\/ Datatypes to \"keep\" at this level.\n if (directive.exists(\"keep\"))\n {\n std::vector<std::string> datatype_strings;\n directive.lookupArrayValue(\"keep\", datatype_strings);\n for (const std::string& datatype_string: datatype_strings)\n {\n auto datatype = problem::GetShape()->DataSpaceNameToID.at(datatype_string);\n user_bypass_strings.at(datatype).at(level) = '1';\n }\n }\n \n \/\/ Datatypes to \"bypass\" at this level.\n if (directive.exists(\"bypass\"))\n {\n std::vector<std::string> datatype_strings;\n directive.lookupArrayValue(\"bypass\", datatype_strings);\n for (const std::string& datatype_string: datatype_strings)\n {\n auto datatype = problem::GetShape()->DataSpaceNameToID.at(datatype_string);\n user_bypass_strings.at(datatype).at(level) = '0';\n }\n }\n}\n\n} \/\/ namespace mapping\n<commit_msg>Improve error message language.<commit_after>\/* Copyright (c) 2019, NVIDIA CORPORATION. All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of NVIDIA CORPORATION nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <regex>\n\n#include \"parser.hpp\"\n#include \"arch-properties.hpp\"\n\nnamespace mapping\n{\n\n\/\/\n\/\/ Shared state.\n\/\/\n\nArchProperties arch_props_;\nproblem::Workload workload_;\n\n\/\/\n\/\/ Forward declarations.\n\/\/\nunsigned FindTargetTilingLevel(config::CompoundConfigNode constraint, std::string type);\nstd::map<problem::Shape::DimensionID, int> ParseUserFactors(config::CompoundConfigNode constraint);\nstd::vector<problem::Shape::DimensionID> ParseUserPermutations(config::CompoundConfigNode constraint);\nvoid ParseUserDatatypeBypassSettings(config::CompoundConfigNode constraint,\n unsigned level,\n problem::PerDataSpace<std::string>& user_bypass_strings);\n\/\/\n\/\/ Parse mapping in libconfig format and generate data structure.\n\/\/\nMapping ParseAndConstruct(config::CompoundConfigNode config,\n model::Engine::Specs& arch_specs,\n problem::Workload workload)\n{\n arch_props_.Construct(arch_specs);\n workload_ = workload;\n \n std::map<unsigned, std::map<problem::Shape::DimensionID, int>> user_factors;\n std::map<unsigned, std::vector<problem::Shape::DimensionID>> user_permutations;\n std::map<unsigned, std::uint32_t> user_spatial_splits;\n problem::PerDataSpace<std::string> user_bypass_strings;\n\n \/\/ Initialize user bypass strings to \"XXXXX...1\" (note the 1 at the end).\n \/\/ FIXME: there's probably a cleaner way\/place to initialize this.\n for (unsigned pvi = 0; pvi < unsigned(problem::GetShape()->NumDataSpaces); pvi++)\n {\n std::string xxx(arch_props_.StorageLevels(), 'X');\n xxx.back() = '1';\n user_bypass_strings[problem::Shape::DataSpaceID(pvi)] = xxx;\n }\n\n \/\/ Parse user-provided mapping.\n assert(config.isList());\n \n \/\/ Iterate over all the directives.\n int len = config.getLength();\n for (int i = 0; i < len; i ++)\n {\n auto directive = config[i];\n \/\/ Find out if this is a temporal directive or a spatial directive.\n std::string type;\n assert(directive.lookupValue(\"type\", type));\n\n auto level_id = FindTargetTilingLevel(directive, type);\n\n if (type == \"temporal\" || type == \"spatial\")\n {\n auto level_factors = ParseUserFactors(directive);\n if (level_factors.size() > 0)\n {\n user_factors[level_id] = level_factors;\n }\n \n auto level_permutations = ParseUserPermutations(directive);\n if (level_permutations.size() > 0)\n {\n user_permutations[level_id] = level_permutations;\n }\n\n if (type == \"spatial\")\n {\n \/\/ Initialize user spatial splits to map all dimensions to the hardware X-axis.\n std::uint32_t user_split = unsigned(problem::GetShape()->NumDimensions);\n directive.lookupValue(\"split\", user_split);\n user_spatial_splits[level_id] = user_split;\n }\n }\n else if (type == \"datatype\" || type == \"bypass\")\n {\n ParseUserDatatypeBypassSettings(directive,\n arch_props_.TilingToStorage(level_id),\n user_bypass_strings);\n }\n else\n {\n assert(false);\n }\n }\n\n \/\/ Validity checks.\n std::map<problem::Shape::DimensionID, int> dimension_factor_products;\n for (unsigned dim = 0; dim < problem::GetShape()->NumDimensions; dim++)\n dimension_factor_products[dim] = 1;\n\n \/\/ Construct the mapping from the parsed sub-structures.\n \/\/ A set of subnests, one for each tiling level.\n loop::NestConfig subnests(arch_props_.TilingLevels());\n\n \/\/ Construct num_storage_levels loop-nest partitions and assign factors, dimensions\n \/\/ and spatial split points.\n for (uint64_t level = 0; level < arch_props_.TilingLevels(); level++)\n {\n auto permutation = user_permutations.find(level);\n if (permutation == user_permutations.end())\n {\n std::cerr << \"ERROR: parsing mapping: permutation not found for level: \"\n << arch_props_.TilingLevelName(level) << std::endl;\n exit(1);\n }\n assert(permutation->second.size() == std::size_t(problem::GetShape()->NumDimensions));\n \n auto factors = user_factors.find(level);\n if (factors == user_factors.end())\n {\n std::cerr << \"ERROR: parsing mapping: factors not found for level: \"\n << arch_props_.TilingLevelName(level) << std::endl;\n exit(1);\n }\n assert(factors->second.size() == std::size_t(problem::GetShape()->NumDimensions));\n\n \/\/ Each partition has problem::GetShape()->NumDimensions loops.\n for (unsigned idim = 0; idim < unsigned(problem::GetShape()->NumDimensions); idim++)\n {\n loop::Descriptor loop;\n loop.dimension = permutation->second.at(idim);\n loop.start = 0;\n loop.end = factors->second.at(loop.dimension);\n loop.stride = 1; \/\/ FIXME.\n loop.spacetime_dimension = arch_props_.IsSpatial(level)\n ? (idim < user_spatial_splits.at(level) ? spacetime::Dimension::SpaceX : spacetime::Dimension::SpaceY)\n : spacetime::Dimension::Time;\n subnests.at(level).push_back(loop);\n\n dimension_factor_products[loop.dimension] *= loop.end;\n }\n }\n\n \/\/ All user-provided factors must multiply-up to the dimension size.\n bool fault = false;\n for (unsigned dim = 0; dim < problem::GetShape()->NumDimensions; dim++)\n {\n if (dimension_factor_products[dim] != workload_.GetBound(dim))\n {\n std::cerr << \"ERROR: parsing mapping: product of all factors of dimension \"\n << problem::GetShape()->DimensionIDToName.at(dim) << \" is \"\n << dimension_factor_products[dim] << \", which is not equal to \"\n << \"the dimension size of the workload \" << workload_.GetBound(dim)\n << \".\" << std::endl;\n fault = true;\n }\n }\n if (fault)\n {\n exit(1);\n }\n\n \/\/ Concatenate the subnests to form the final mapping nest.\n Mapping mapping;\n \n std::uint64_t storage_level = 0;\n for (uint64_t i = 0; i < arch_props_.TilingLevels(); i++)\n {\n uint64_t num_subnests_added = 0;\n for (int dim = 0; dim < int(problem::GetShape()->NumDimensions); dim++)\n {\n \/\/ Ignore trivial factors\n \/\/ This reduces computation time by 1.5x on average.\n if (subnests[i][dim].start + subnests[i][dim].stride < subnests[i][dim].end)\n {\n mapping.loop_nest.AddLoop(subnests[i][dim]);\n num_subnests_added++;\n }\n }\n if (!arch_props_.IsSpatial(i))\n {\n if (num_subnests_added == 0)\n {\n \/\/ Add a trivial temporal nest to make sure\n \/\/ we have at least one subnest in each level.\n mapping.loop_nest.AddLoop(problem::Shape::DimensionID(int(problem::GetShape()->NumDimensions) - 1),\n 0, 1, 1, spacetime::Dimension::Time);\n }\n mapping.loop_nest.AddStorageTilingBoundary();\n storage_level++;\n }\n }\n\n \/\/ The user_mask input is a set of per-datatype strings. Each string has a length\n \/\/ equal to num_storage_levels, and contains the characters 0 (bypass), 1 (keep),\n \/\/ or X (evaluate both). \n for (unsigned pvi = 0; pvi < unsigned(problem::GetShape()->NumDataSpaces); pvi++)\n {\n auto pv = problem::Shape::DataSpaceID(pvi);\n\n \/\/ Start parsing the user mask string.\n assert(user_bypass_strings.at(pv).length() <= arch_props_.StorageLevels());\n\n \/\/ The first loop runs the length of the user-specified string.\n unsigned level = 0;\n for (; level < user_bypass_strings.at(pv).length(); level++)\n {\n char spec = user_bypass_strings.at(pv).at(level);\n switch (spec)\n {\n case '0':\n mapping.datatype_bypass_nest.at(pvi).reset(level);\n break;\n \n case '1':\n mapping.datatype_bypass_nest.at(pvi).set(level);\n break;\n\n case 'X':\n \/\/ We allow this to be left un-specified by the user. Default is \"keep\".\n mapping.datatype_bypass_nest.at(pvi).set(level);\n break; \n \n default:\n assert(false);\n break;\n }\n }\n } \/\/ for (pvi)\n\n \/\/ Finalize mapping.\n mapping.id = 0;\n\n return mapping;\n}\n\n\/\/\n\/\/ FindTargetTilingLevel()\n\/\/\nunsigned FindTargetTilingLevel(config::CompoundConfigNode directive, std::string type)\n{\n auto num_storage_levels = arch_props_.StorageLevels();\n \n \/\/\n \/\/ Find the target storage level. This can be specified as either a name or an ID.\n \/\/\n std::string storage_level_name;\n unsigned storage_level_id;\n \n if (directive.lookupValue(\"target\", storage_level_name))\n {\n \/\/ Find this name within the storage hierarchy in the arch specs.\n for (storage_level_id = 0; storage_level_id < num_storage_levels; storage_level_id++)\n {\n if (arch_props_.Specs().topology.GetStorageLevel(storage_level_id)->level_name == storage_level_name)\n break;\n }\n if (storage_level_id == num_storage_levels)\n {\n std::cerr << \"ERROR: target storage level not found: \" << storage_level_name << std::endl;\n exit(1);\n }\n }\n else\n {\n int id;\n assert(directive.lookupValue(\"target\", id));\n assert(id >= 0 && id < int(num_storage_levels));\n storage_level_id = static_cast<unsigned>(id);\n }\n\n assert(storage_level_id < num_storage_levels);\n\n \/\/\n \/\/ Translate this storage ID to a tiling ID.\n \/\/\n unsigned tiling_level_id;\n if (type == \"temporal\" || type == \"datatype\" || type == \"bypass\")\n {\n \/\/ This should always succeed.\n tiling_level_id = arch_props_.TemporalToTiling(storage_level_id);\n }\n else if (type == \"spatial\")\n {\n \/\/ This will fail if this level isn't a spatial tiling level.\n tiling_level_id = arch_props_.SpatialToTiling(storage_level_id);\n }\n else\n {\n std::cerr << \"ERROR: unrecognized mapping directive type: \" << type << std::endl;\n exit(1);\n }\n\n return tiling_level_id;\n}\n\n\/\/\n\/\/ Parse user factors.\n\/\/\nstd::map<problem::Shape::DimensionID, int> ParseUserFactors(config::CompoundConfigNode directive)\n{\n std::map<problem::Shape::DimensionID, int> retval;\n \n std::string buffer;\n if (directive.lookupValue(\"factors\", buffer))\n {\n std::regex re(\"([A-Za-z]+)[[:space:]]*[=]*[[:space:]]*([0-9]+)\", std::regex::extended);\n std::smatch sm;\n std::string str = std::string(buffer);\n\n while (std::regex_search(str, sm, re))\n {\n std::string dimension_name = sm[1];\n problem::Shape::DimensionID dimension;\n try\n {\n dimension = problem::GetShape()->DimensionNameToID.at(dimension_name);\n }\n catch (const std::out_of_range& oor)\n {\n std::cerr << \"ERROR: parsing factors: \" << buffer << \": dimension \" << dimension_name\n << \" not found in problem shape.\" << std::endl;\n exit(1);\n }\n\n int end = std::stoi(sm[2]);\n if (end == 0)\n {\n std::cerr << \"WARNING: Interpreting 0 to mean full problem dimension instead of residue.\" << std::endl;\n end = workload_.GetBound(dimension);\n }\n else if (end > workload_.GetBound(dimension))\n {\n std::cerr << \"WARNING: Directive \" << dimension << \"=\" << end\n << \" exceeds problem dimension \" << dimension << \"=\"\n << workload_.GetBound(dimension) << \". Setting directive \"\n << dimension << \"=\" << workload_.GetBound(dimension) << std::endl;\n end = workload_.GetBound(dimension);\n }\n else\n {\n assert(end > 0);\n }\n\n \/\/ Found all the information we need to setup a factor!\n retval[dimension] = end;\n\n str = sm.suffix().str();\n }\n }\n\n return retval;\n}\n\n\/\/\n\/\/ Parse user permutations.\n\/\/\nstd::vector<problem::Shape::DimensionID> ParseUserPermutations(config::CompoundConfigNode directive)\n{\n std::vector<problem::Shape::DimensionID> retval;\n \n std::string buffer;\n if (directive.lookupValue(\"permutation\", buffer))\n {\n std::istringstream iss(buffer);\n char token;\n while (iss >> token)\n {\n auto dimension = problem::GetShape()->DimensionNameToID.at(std::string(1, token)); \/\/ note: can fault.\n retval.push_back(dimension);\n }\n }\n\n return retval;\n}\n\n\/\/\n\/\/ Parse user datatype bypass settings.\n\/\/\nvoid ParseUserDatatypeBypassSettings(config::CompoundConfigNode directive,\n unsigned level,\n problem::PerDataSpace<std::string>& user_bypass_strings)\n{\n \/\/ Datatypes to \"keep\" at this level.\n if (directive.exists(\"keep\"))\n {\n std::vector<std::string> datatype_strings;\n directive.lookupArrayValue(\"keep\", datatype_strings);\n for (const std::string& datatype_string: datatype_strings)\n {\n auto datatype = problem::GetShape()->DataSpaceNameToID.at(datatype_string);\n user_bypass_strings.at(datatype).at(level) = '1';\n }\n }\n \n \/\/ Datatypes to \"bypass\" at this level.\n if (directive.exists(\"bypass\"))\n {\n std::vector<std::string> datatype_strings;\n directive.lookupArrayValue(\"bypass\", datatype_strings);\n for (const std::string& datatype_string: datatype_strings)\n {\n auto datatype = problem::GetShape()->DataSpaceNameToID.at(datatype_string);\n user_bypass_strings.at(datatype).at(level) = '0';\n }\n }\n}\n\n} \/\/ namespace mapping\n<|endoftext|>"} {"text":"<commit_before>#include <offboard_control\/mavros_adapter.h>\n\n#include <mavros_msgs\/CommandBool.h>\n#include <mavros_msgs\/CommandTOL.h>\n#include <mavros_msgs\/SetMode.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <geometry_msgs\/TwistStamped.h>\n\nstatic const std::string PX4_MODE_OFFBOARD = \"OFFBOARD\";\nstatic const float REQUEST_INTERVAL = 2.0;\n\nMavrosAdapter::MavrosAdapter(ros::NodeHandle &rosNode) {\n this->mRosNode = &rosNode;\n this->mArmingService = this->mRosNode->serviceClient<mavros_msgs::CommandBool>(\"mavros\/cmd\/arming\");\n this->mSetModeService = this->mRosNode->serviceClient<mavros_msgs::SetMode>(\"mavros\/set_mode\");\n this->mStateSubscriber = this->mRosNode->subscribe<mavros_msgs::State>(\"mavros\/state\", 1, &MavrosAdapter::stateCallback, this);\n this->mRcInSubscriber = this->mRosNode->subscribe<mavros_msgs::RCIn>(\"mavros\/rc\/in\", 1, &MavrosAdapter::rcInCallback, this);\n this->mWaypointPublisher = this->mRosNode->advertise<geometry_msgs::PoseStamped>(\"mavros\/setpoint_position\/local\", 1);\n this->mVelocityPublisher = this->mRosNode->advertise<geometry_msgs::TwistStamped>(\"mavros\/setpoint_velocity\/cmd_vel\", 1);\n this->mLastRequest = ros::Time::now();\n this->mOffboardMode = OffboardMode::WAYPOINT;\n this->mRcFlightModePulseValue = 0;\n this->mIsRcInterrupt = false;\n this->mIsRunning = false;\n this->mIsEnabled = false;\n this->mMavrosThread = new std::thread(&MavrosAdapter::threadLoop, this);\n}\n\nMavrosAdapter::~MavrosAdapter() {\n if (this->mMavrosThread != NULL) {\n this->mIsRunning = false;\n this->mMavrosThread->join();\n delete this->mMavrosThread;\n }\n}\n\nvoid MavrosAdapter::initialize() {\n this->connectToFlightController();\n this->mIsEnabled = true;\n}\n\nbool MavrosAdapter::arm(bool doArm) {\n mavros_msgs::CommandBool armMsg;\n armMsg.request.value = doArm;\n return this->mArmingService.call(armMsg);\n}\n\nvoid MavrosAdapter::waypoint(geometry_msgs::Pose pose) {\n this->mOffboardWaypoint = pose;\n this->mOffboardMode = OffboardMode::WAYPOINT;\n}\n\nvoid MavrosAdapter::velocity(geometry_msgs::Twist twist) {\n this->mOffboardVelocity = twist;\n this->mOffboardMode = OffboardMode::VELOCITY;\n}\n\nvoid MavrosAdapter::setEnabled(bool isEnabled) {\n this->mIsEnabled = isEnabled;\n}\n\nbool MavrosAdapter::isFcuConnected() const {\n return this->mFcuState.connected;\n}\n\nbool MavrosAdapter::isFcuArmed() const {\n return this->mFcuState.armed;\n}\n\nbool MavrosAdapter::isEnabled() const {\n return this->mIsEnabled;\n}\n\nvoid MavrosAdapter::stateCallback(const mavros_msgs::State::ConstPtr& msg) {\n this->mFcuState = *msg;\n}\n\nvoid MavrosAdapter::rcInCallback(const mavros_msgs::RCIn::ConstPtr& msg) {\n if (msg->channels.size() >= 5) {\n if (this->mRcFlightModePulseValue != 0 && abs(this->mRcFlightModePulseValue - msg->channels[4]) > 5) {\n if (this->mIsEnabled) {\n ROS_INFO(\"RC interrupt detected; disabling offboard control.\");\n this->mIsEnabled = false;\n }\n }\n this->mRcFlightModePulseValue = msg->channels[4];\n }\n}\n\nvoid MavrosAdapter::publishWaypoint() const {\n geometry_msgs::PoseStamped poseMsg;\n poseMsg.pose = this->mOffboardWaypoint;\n this->mWaypointPublisher.publish(poseMsg);\n}\n\nvoid MavrosAdapter::publishVelocity() const {\n geometry_msgs::TwistStamped twistMsg;\n twistMsg.twist = this->mOffboardVelocity;\n this->mVelocityPublisher.publish(twistMsg);\n}\n\nvoid MavrosAdapter::connectToFlightController() {\n \/\/ Before publishing anything, we wait for the connection to be established between mavros and the autopilot.\n \/\/ This loop should exit as soon as a heartbeat message is received.\n ROS_INFO(\"Connecting to flight control unit.\");\n ros::Rate rosRate(10.0);\n while (ros::ok() && !this->mFcuState.connected) {\n ros::spinOnce();\n rosRate.sleep();\n }\n ROS_INFO(\"Connection between MAVROS and flight control unit established.\");\n}\n\nvoid MavrosAdapter::configureOffboardMode() {\n if (this->mFcuState.mode != PX4_MODE_OFFBOARD && (ros::Time::now() - this->mLastRequest > ros::Duration(REQUEST_INTERVAL))) {\n \/\/ Before entering offboard mode, you must have already started streaming setpoints otherwise the mode switch will be rejected.\n ros::Rate rosRate(20.0);\n for (int i = 40; ros::ok() && i > 0; --i) {\n this->publishWaypoint();\n ros::spinOnce();\n rosRate.sleep();\n }\n mavros_msgs::SetMode setModeCommand;\n setModeCommand.request.custom_mode = PX4_MODE_OFFBOARD;\n if (this->mSetModeService.call(setModeCommand)) {\n ROS_INFO_STREAM(\"Setting flight mode to \" + PX4_MODE_OFFBOARD + \".\");\n }\n this->mLastRequest = ros::Time::now();\n }\n}\n\nvoid MavrosAdapter::threadLoop() {\n ros::Rate rosRate(20.0);\n this->mIsRunning = true;\n while (this->mRosNode->ok() && this->mIsRunning) {\n if (this->mIsEnabled) {\n this->configureOffboardMode();\n switch (this->mOffboardMode) {\n case OffboardMode::WAYPOINT:\n this->publishWaypoint();\n break;\n case OffboardMode::VELOCITY:\n this->publishVelocity();\n break;\n default:\n break;\n }\n }\n ros::spinOnce();\n rosRate.sleep();\n }\n}\n<commit_msg>Fixed casting issue when detecting change to flight mode.<commit_after>#include <offboard_control\/mavros_adapter.h>\n\n#include <mavros_msgs\/CommandBool.h>\n#include <mavros_msgs\/CommandTOL.h>\n#include <mavros_msgs\/SetMode.h>\n#include <geometry_msgs\/PoseStamped.h>\n#include <geometry_msgs\/TwistStamped.h>\n\nstatic const std::string PX4_MODE_OFFBOARD = \"OFFBOARD\";\nstatic const float REQUEST_INTERVAL = 2.0;\n\nMavrosAdapter::MavrosAdapter(ros::NodeHandle &rosNode) {\n this->mRosNode = &rosNode;\n this->mArmingService = this->mRosNode->serviceClient<mavros_msgs::CommandBool>(\"mavros\/cmd\/arming\");\n this->mSetModeService = this->mRosNode->serviceClient<mavros_msgs::SetMode>(\"mavros\/set_mode\");\n this->mStateSubscriber = this->mRosNode->subscribe<mavros_msgs::State>(\"mavros\/state\", 1, &MavrosAdapter::stateCallback, this);\n this->mRcInSubscriber = this->mRosNode->subscribe<mavros_msgs::RCIn>(\"mavros\/rc\/in\", 1, &MavrosAdapter::rcInCallback, this);\n this->mWaypointPublisher = this->mRosNode->advertise<geometry_msgs::PoseStamped>(\"mavros\/setpoint_position\/local\", 1);\n this->mVelocityPublisher = this->mRosNode->advertise<geometry_msgs::TwistStamped>(\"mavros\/setpoint_velocity\/cmd_vel\", 1);\n this->mLastRequest = ros::Time::now();\n this->mOffboardMode = OffboardMode::WAYPOINT;\n this->mRcFlightModePulseValue = 0;\n this->mIsRcInterrupt = false;\n this->mIsRunning = false;\n this->mIsEnabled = false;\n this->mMavrosThread = new std::thread(&MavrosAdapter::threadLoop, this);\n}\n\nMavrosAdapter::~MavrosAdapter() {\n if (this->mMavrosThread != NULL) {\n this->mIsRunning = false;\n this->mMavrosThread->join();\n delete this->mMavrosThread;\n }\n}\n\nvoid MavrosAdapter::initialize() {\n this->connectToFlightController();\n this->mIsEnabled = true;\n}\n\nbool MavrosAdapter::arm(bool doArm) {\n mavros_msgs::CommandBool armMsg;\n armMsg.request.value = doArm;\n return this->mArmingService.call(armMsg);\n}\n\nvoid MavrosAdapter::waypoint(geometry_msgs::Pose pose) {\n this->mOffboardWaypoint = pose;\n this->mOffboardMode = OffboardMode::WAYPOINT;\n}\n\nvoid MavrosAdapter::velocity(geometry_msgs::Twist twist) {\n this->mOffboardVelocity = twist;\n this->mOffboardMode = OffboardMode::VELOCITY;\n}\n\nvoid MavrosAdapter::setEnabled(bool isEnabled) {\n this->mIsEnabled = isEnabled;\n}\n\nbool MavrosAdapter::isFcuConnected() const {\n return this->mFcuState.connected;\n}\n\nbool MavrosAdapter::isFcuArmed() const {\n return this->mFcuState.armed;\n}\n\nbool MavrosAdapter::isEnabled() const {\n return this->mIsEnabled;\n}\n\nvoid MavrosAdapter::stateCallback(const mavros_msgs::State::ConstPtr& msg) {\n this->mFcuState = *msg;\n}\n\nvoid MavrosAdapter::rcInCallback(const mavros_msgs::RCIn::ConstPtr& msg) {\n if (msg->channels.size() >= 5) {\n if (this->mRcFlightModePulseValue != 0 && abs((int)this->mRcFlightModePulseValue - (int)msg->channels[4]) > 5) {\n if (this->mIsEnabled) {\n ROS_INFO(\"RC interrupt detected; disabling offboard control.\");\n this->mIsEnabled = false;\n }\n }\n this->mRcFlightModePulseValue = msg->channels[4];\n }\n}\n\nvoid MavrosAdapter::publishWaypoint() const {\n geometry_msgs::PoseStamped poseMsg;\n poseMsg.pose = this->mOffboardWaypoint;\n this->mWaypointPublisher.publish(poseMsg);\n}\n\nvoid MavrosAdapter::publishVelocity() const {\n geometry_msgs::TwistStamped twistMsg;\n twistMsg.twist = this->mOffboardVelocity;\n this->mVelocityPublisher.publish(twistMsg);\n}\n\nvoid MavrosAdapter::connectToFlightController() {\n \/\/ Before publishing anything, we wait for the connection to be established between mavros and the autopilot.\n \/\/ This loop should exit as soon as a heartbeat message is received.\n ROS_INFO(\"Connecting to flight control unit.\");\n ros::Rate rosRate(10.0);\n while (ros::ok() && !this->mFcuState.connected) {\n ros::spinOnce();\n rosRate.sleep();\n }\n ROS_INFO(\"Connection between MAVROS and flight control unit established.\");\n}\n\nvoid MavrosAdapter::configureOffboardMode() {\n if (this->mFcuState.mode != PX4_MODE_OFFBOARD && (ros::Time::now() - this->mLastRequest > ros::Duration(REQUEST_INTERVAL))) {\n \/\/ Before entering offboard mode, you must have already started streaming setpoints otherwise the mode switch will be rejected.\n ros::Rate rosRate(20.0);\n for (int i = 40; ros::ok() && i > 0; --i) {\n this->publishWaypoint();\n ros::spinOnce();\n rosRate.sleep();\n }\n mavros_msgs::SetMode setModeCommand;\n setModeCommand.request.custom_mode = PX4_MODE_OFFBOARD;\n if (this->mSetModeService.call(setModeCommand)) {\n ROS_INFO_STREAM(\"Setting flight mode to \" + PX4_MODE_OFFBOARD + \".\");\n }\n this->mLastRequest = ros::Time::now();\n }\n}\n\nvoid MavrosAdapter::threadLoop() {\n ros::Rate rosRate(20.0);\n this->mIsRunning = true;\n while (this->mRosNode->ok() && this->mIsRunning) {\n if (this->mIsEnabled) {\n this->configureOffboardMode();\n switch (this->mOffboardMode) {\n case OffboardMode::WAYPOINT:\n this->publishWaypoint();\n break;\n case OffboardMode::VELOCITY:\n this->publishVelocity();\n break;\n default:\n break;\n }\n }\n ros::spinOnce();\n rosRate.sleep();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012-2013, 2015-2016, 2018 ARM Limited\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Erik Hallnor\n * Andreas Sandberg\n * Andreas Hansson\n *\/\n\n\/** @file\n * Declaration of a high-level queue structure\n *\/\n\n#ifndef __MEM_CACHE_QUEUE_HH__\n#define __MEM_CACHE_QUEUE_HH__\n\n#include <cassert>\n#include <string>\n\n#include \"base\/logging.hh\"\n#include \"base\/trace.hh\"\n#include \"base\/types.hh\"\n#include \"debug\/Drain.hh\"\n#include \"mem\/cache\/queue_entry.hh\"\n#include \"mem\/packet.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/drain.hh\"\n\n\/**\n * A high-level queue interface, to be used by both the MSHR queue and\n * the write buffer.\n *\/\ntemplate<class Entry>\nclass Queue : public Drainable\n{\n protected:\n \/** Local label (for functional print requests) *\/\n const std::string label;\n\n \/**\n * The total number of entries in this queue. This number is set\n * as the number of entries requested plus any reserve. This\n * allows for the same number of effective entries while still\n * maintaining an overflow reserve.\n *\/\n const int numEntries;\n\n \/**\n * The number of entries to hold as a temporary overflow\n * space. This is used to allow temporary overflow of the number\n * of entries as we only check the full condition under certain\n * conditions.\n *\/\n const int numReserve;\n\n \/** Actual storage. *\/\n std::vector<Entry> entries;\n \/** Holds pointers to all allocated entries. *\/\n typename Entry::List allocatedList;\n \/** Holds pointers to entries that haven't been sent downstream. *\/\n typename Entry::List readyList;\n \/** Holds non allocated entries. *\/\n typename Entry::List freeList;\n\n typename Entry::Iterator addToReadyList(Entry* entry)\n {\n if (readyList.empty() ||\n readyList.back()->readyTime <= entry->readyTime) {\n return readyList.insert(readyList.end(), entry);\n }\n\n for (auto i = readyList.begin(); i != readyList.end(); ++i) {\n if ((*i)->readyTime > entry->readyTime) {\n return readyList.insert(i, entry);\n }\n }\n panic(\"Failed to add to ready list.\");\n }\n\n \/** The number of entries that are in service. *\/\n int _numInService;\n\n \/** The number of currently allocated entries. *\/\n int allocated;\n\n public:\n\n \/**\n * Create a queue with a given number of entries.\n *\n * @param num_entries The number of entries in this queue.\n * @param reserve The extra overflow entries needed.\n *\/\n Queue(const std::string &_label, int num_entries, int reserve) :\n label(_label), numEntries(num_entries + reserve),\n numReserve(reserve), entries(numEntries), _numInService(0),\n allocated(0)\n {\n for (int i = 0; i < numEntries; ++i) {\n freeList.push_back(&entries[i]);\n }\n }\n\n bool isEmpty() const\n {\n return allocated == 0;\n }\n\n bool isFull() const\n {\n return (allocated >= numEntries - numReserve);\n }\n\n int numInService() const\n {\n return _numInService;\n }\n\n \/**\n * Find the first entry that matches the provided address.\n *\n * @param blk_addr The block address to find.\n * @param is_secure True if the target memory space is secure.\n * @param ignore_uncacheable Should uncacheables be ignored or not\n * @return Pointer to the matching WriteQueueEntry, null if not found.\n *\/\n Entry* findMatch(Addr blk_addr, bool is_secure,\n bool ignore_uncacheable = true) const\n {\n for (const auto& entry : allocatedList) {\n \/\/ we ignore any entries allocated for uncacheable\n \/\/ accesses and simply ignore them when matching, in the\n \/\/ cache we never check for matches when adding new\n \/\/ uncacheable entries, and we do not want normal\n \/\/ cacheable accesses being added to an WriteQueueEntry\n \/\/ serving an uncacheable access\n if (!(ignore_uncacheable && entry->isUncacheable()) &&\n entry->blkAddr == blk_addr && entry->isSecure == is_secure) {\n return entry;\n }\n }\n return nullptr;\n }\n\n bool trySatisfyFunctional(PacketPtr pkt, Addr blk_addr)\n {\n pkt->pushLabel(label);\n for (const auto& entry : allocatedList) {\n if (entry->blkAddr == blk_addr && entry->trySatisfyFunctional(pkt)) {\n pkt->popLabel();\n return true;\n }\n }\n pkt->popLabel();\n return false;\n }\n\n \/**\n * Find any pending requests that overlap the given request.\n * @param blk_addr Block address.\n * @param is_secure True if the target memory space is secure.\n * @return A pointer to the earliest matching WriteQueueEntry.\n *\/\n Entry* findPending(Addr blk_addr, bool is_secure) const\n {\n for (const auto& entry : readyList) {\n if (entry->blkAddr == blk_addr && entry->isSecure == is_secure) {\n return entry;\n }\n }\n return nullptr;\n }\n\n \/**\n * Returns the WriteQueueEntry at the head of the readyList.\n * @return The next request to service.\n *\/\n Entry* getNext() const\n {\n if (readyList.empty() || readyList.front()->readyTime > curTick()) {\n return nullptr;\n }\n return readyList.front();\n }\n\n Tick nextReadyTime() const\n {\n return readyList.empty() ? MaxTick : readyList.front()->readyTime;\n }\n\n \/**\n * Removes the given entry from the queue. This places the entry\n * on the free list.\n *\n * @param entry\n *\/\n void deallocate(Entry *entry)\n {\n allocatedList.erase(entry->allocIter);\n freeList.push_front(entry);\n allocated--;\n if (entry->inService) {\n _numInService--;\n } else {\n readyList.erase(entry->readyIter);\n }\n entry->deallocate();\n if (drainState() == DrainState::Draining && allocated == 0) {\n \/\/ Notify the drain manager that we have completed\n \/\/ draining if there are no other outstanding requests in\n \/\/ this queue.\n DPRINTF(Drain, \"Queue now empty, signalling drained\\n\");\n signalDrainDone();\n }\n }\n\n DrainState drain() override\n {\n return allocated == 0 ? DrainState::Drained : DrainState::Draining;\n }\n};\n\n#endif \/\/__MEM_CACHE_QUEUE_HH__\n<commit_msg>mem-cache: Assert Entry inherits from QueueEntry in Queue<commit_after>\/*\n * Copyright (c) 2012-2013, 2015-2016, 2018 ARM Limited\n * All rights reserved.\n *\n * The license below extends only to copyright in the software and shall\n * not be construed as granting a license to any other intellectual\n * property including but not limited to intellectual property relating\n * to a hardware implementation of the functionality of the software\n * licensed hereunder. You may use the software subject to the license\n * terms below provided that you ensure that this notice is replicated\n * unmodified and in its entirety in all distributions of the software,\n * modified or unmodified, in source code or in binary form.\n *\n * Copyright (c) 2003-2005 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Erik Hallnor\n * Andreas Sandberg\n * Andreas Hansson\n *\/\n\n\/** @file\n * Declaration of a high-level queue structure\n *\/\n\n#ifndef __MEM_CACHE_QUEUE_HH__\n#define __MEM_CACHE_QUEUE_HH__\n\n#include <cassert>\n#include <string>\n#include <type_traits>\n\n#include \"base\/logging.hh\"\n#include \"base\/trace.hh\"\n#include \"base\/types.hh\"\n#include \"debug\/Drain.hh\"\n#include \"mem\/cache\/queue_entry.hh\"\n#include \"mem\/packet.hh\"\n#include \"sim\/core.hh\"\n#include \"sim\/drain.hh\"\n\n\/**\n * A high-level queue interface, to be used by both the MSHR queue and\n * the write buffer.\n *\/\ntemplate<class Entry>\nclass Queue : public Drainable\n{\n static_assert(std::is_base_of<QueueEntry, Entry>::value,\n \"Entry must be derived from QueueEntry\");\n\n protected:\n \/** Local label (for functional print requests) *\/\n const std::string label;\n\n \/**\n * The total number of entries in this queue. This number is set\n * as the number of entries requested plus any reserve. This\n * allows for the same number of effective entries while still\n * maintaining an overflow reserve.\n *\/\n const int numEntries;\n\n \/**\n * The number of entries to hold as a temporary overflow\n * space. This is used to allow temporary overflow of the number\n * of entries as we only check the full condition under certain\n * conditions.\n *\/\n const int numReserve;\n\n \/** Actual storage. *\/\n std::vector<Entry> entries;\n \/** Holds pointers to all allocated entries. *\/\n typename Entry::List allocatedList;\n \/** Holds pointers to entries that haven't been sent downstream. *\/\n typename Entry::List readyList;\n \/** Holds non allocated entries. *\/\n typename Entry::List freeList;\n\n typename Entry::Iterator addToReadyList(Entry* entry)\n {\n if (readyList.empty() ||\n readyList.back()->readyTime <= entry->readyTime) {\n return readyList.insert(readyList.end(), entry);\n }\n\n for (auto i = readyList.begin(); i != readyList.end(); ++i) {\n if ((*i)->readyTime > entry->readyTime) {\n return readyList.insert(i, entry);\n }\n }\n panic(\"Failed to add to ready list.\");\n }\n\n \/** The number of entries that are in service. *\/\n int _numInService;\n\n \/** The number of currently allocated entries. *\/\n int allocated;\n\n public:\n\n \/**\n * Create a queue with a given number of entries.\n *\n * @param num_entries The number of entries in this queue.\n * @param reserve The extra overflow entries needed.\n *\/\n Queue(const std::string &_label, int num_entries, int reserve) :\n label(_label), numEntries(num_entries + reserve),\n numReserve(reserve), entries(numEntries), _numInService(0),\n allocated(0)\n {\n for (int i = 0; i < numEntries; ++i) {\n freeList.push_back(&entries[i]);\n }\n }\n\n bool isEmpty() const\n {\n return allocated == 0;\n }\n\n bool isFull() const\n {\n return (allocated >= numEntries - numReserve);\n }\n\n int numInService() const\n {\n return _numInService;\n }\n\n \/**\n * Find the first entry that matches the provided address.\n *\n * @param blk_addr The block address to find.\n * @param is_secure True if the target memory space is secure.\n * @param ignore_uncacheable Should uncacheables be ignored or not\n * @return Pointer to the matching WriteQueueEntry, null if not found.\n *\/\n Entry* findMatch(Addr blk_addr, bool is_secure,\n bool ignore_uncacheable = true) const\n {\n for (const auto& entry : allocatedList) {\n \/\/ we ignore any entries allocated for uncacheable\n \/\/ accesses and simply ignore them when matching, in the\n \/\/ cache we never check for matches when adding new\n \/\/ uncacheable entries, and we do not want normal\n \/\/ cacheable accesses being added to an WriteQueueEntry\n \/\/ serving an uncacheable access\n if (!(ignore_uncacheable && entry->isUncacheable()) &&\n entry->blkAddr == blk_addr && entry->isSecure == is_secure) {\n return entry;\n }\n }\n return nullptr;\n }\n\n bool trySatisfyFunctional(PacketPtr pkt, Addr blk_addr)\n {\n pkt->pushLabel(label);\n for (const auto& entry : allocatedList) {\n if (entry->blkAddr == blk_addr && entry->trySatisfyFunctional(pkt)) {\n pkt->popLabel();\n return true;\n }\n }\n pkt->popLabel();\n return false;\n }\n\n \/**\n * Find any pending requests that overlap the given request.\n * @param blk_addr Block address.\n * @param is_secure True if the target memory space is secure.\n * @return A pointer to the earliest matching WriteQueueEntry.\n *\/\n Entry* findPending(Addr blk_addr, bool is_secure) const\n {\n for (const auto& entry : readyList) {\n if (entry->blkAddr == blk_addr && entry->isSecure == is_secure) {\n return entry;\n }\n }\n return nullptr;\n }\n\n \/**\n * Returns the WriteQueueEntry at the head of the readyList.\n * @return The next request to service.\n *\/\n Entry* getNext() const\n {\n if (readyList.empty() || readyList.front()->readyTime > curTick()) {\n return nullptr;\n }\n return readyList.front();\n }\n\n Tick nextReadyTime() const\n {\n return readyList.empty() ? MaxTick : readyList.front()->readyTime;\n }\n\n \/**\n * Removes the given entry from the queue. This places the entry\n * on the free list.\n *\n * @param entry\n *\/\n void deallocate(Entry *entry)\n {\n allocatedList.erase(entry->allocIter);\n freeList.push_front(entry);\n allocated--;\n if (entry->inService) {\n _numInService--;\n } else {\n readyList.erase(entry->readyIter);\n }\n entry->deallocate();\n if (drainState() == DrainState::Draining && allocated == 0) {\n \/\/ Notify the drain manager that we have completed\n \/\/ draining if there are no other outstanding requests in\n \/\/ this queue.\n DPRINTF(Drain, \"Queue now empty, signalling drained\\n\");\n signalDrainDone();\n }\n }\n\n DrainState drain() override\n {\n return allocated == 0 ? DrainState::Drained : DrainState::Draining;\n }\n};\n\n#endif \/\/__MEM_CACHE_QUEUE_HH__\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun 07\/04\/2001\n\n\/*************************************************************************\n * Copyright (C) 1995-2001, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TFriendElement \/\/\n\/\/ \/\/\n\/\/ A TFriendElement TF describes a TTree object TF in a file. \/\/\n\/\/ When a TFriendElement TF is added to the the list of friends of an \/\/\n\/\/ existing TTree T, any variable from TF can be referenced in a query \/\/\n\/\/ to T. \/\/\n\/\/ \/\/\n\/\/ To add a TFriendElement to an existing TTree T, do: \/\/\n\/\/ T.AddFriend(\"friendTreename\",\"friendTreeFile\"); \/\/\n\/\/ \/\/\n\/\/ See TTree::AddFriend for more information. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TTree.h\"\n#include \"TFriendElement.h\"\n#include \"TFile.h\"\n#include \"TROOT.h\"\n\nR__EXTERN TTree *gTree;\n\nClassImp(TFriendElement)\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement() : TNamed()\n{\n\/\/*-*-*-*-*-*Default constructor for a friend element*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* =======================================\n\n fFile = 0;\n fTree = 0;\n fOwnFile = kFALSE;\n fParentTree = gTree;\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, const char *treename, const char *filename)\n :TNamed(treename,filename)\n{\n\/\/*-*-*-*-*-*-*-*-*-*-*-*-*Create a friend element*-*-*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* ======================\n\/\/\n\/\/ If treename is of the form \"a=b\", an alias called \"a\" is created for\n\/\/ treename = \"b\" by default the alias name is the name of the tree.\n\n fFile = 0;\n fTree = 0;\n fOwnFile = kTRUE;\n fParentTree = tree;\n fTreeName = treename;\n if (strchr(treename,'=')) {\n char *temp = Compress(treename);\n char *equal = strchr(temp,'=');\n *equal=0;\n fTreeName = equal+1;\n SetName(temp);\n delete [] temp;\n }\n\n Connect();\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, const char *treename, TFile *file)\n :TNamed(treename,file?file->GetName():\"\")\n{\n\/\/*-*-*-*-*-*-*-*-*-*-*-*-*Create a friend element*-*-*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* ======================\n\/\/\n\/\/ If treename is of the form \"a=b\", an alias called \"a\" is created for\n\/\/ treename = \"b\" by default the alias name is the name of the tree.\n\/\/ The passed TFile is managed by the user (i.e. user must delete the TFile).\n\n fFile = file;\n fTree = 0;\n fOwnFile = kFALSE;\n fParentTree = tree;\n fTreeName = treename;\n if (strchr(treename,'=')) {\n char *temp = Compress(treename);\n char *equal = strchr(temp,'=');\n *equal=0;\n fTreeName = equal+1;\n SetName(temp);\n delete [] temp;\n }\n\n Connect();\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, TTree* friendtree, const char *alias)\n : TNamed(friendtree?friendtree->GetName():\"\",\n friendtree\n ? ( friendtree->GetDirectory()\n ? ( friendtree->GetDirectory()->GetFile()\n ? friendtree->GetDirectory()->GetFile()->GetName()\n : \"\")\n : \"\")\n : \"\")\n{\n \/\/ Create a friend element.\n\n fTree = friendtree;\n fTreeName = \"\";\n fFile = 0;\n if (fTree) {\n fTreeName = fTree->GetName();\n if (fTree->GetDirectory()) fFile = fTree->GetDirectory()->GetFile();\n }\n fOwnFile = kFALSE;\n fParentTree = tree;\n if (alias && strlen(alias)) {\n char *temp = Compress(alias);\n SetName(temp);\n delete [] temp;\n }\n\n \/\/ No need to Connect.\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(const TFriendElement& tfe) : \n TNamed(tfe),\n fParentTree(tfe.fParentTree),\n fTree(tfe.fTree),\n fFile(tfe.fFile),\n fTreeName(tfe.fTreeName),\n fOwnFile(tfe.fOwnFile)\n{ \n \/\/ Copy constructor\n}\n\n\/\/______________________________________________________________________________\nTFriendElement& TFriendElement::operator=(const TFriendElement& tfe) \n{\n \/\/ Equal operator\n if(this!=&tfe) {\n TNamed::operator=(tfe);\n fParentTree=tfe.fParentTree;\n fTree=tfe.fTree;\n fFile=tfe.fFile;\n fTreeName=tfe.fTreeName;\n fOwnFile=tfe.fOwnFile;\n } return *this;\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::~TFriendElement()\n{\n \/\/ Destructor. Disconnect from the owning tree if needed.\n\n DisConnect();\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::Connect()\n{\n \/\/ Connect file and return TTree.\n\n GetFile();\n return GetTree();\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::DisConnect()\n{\n \/\/ DisConnect file and TTree.\n\n if (fOwnFile) delete fFile;\n fFile = 0;\n fTree = 0;\n return 0;\n}\n\n\/\/_______________________________________________________________________\nTFile *TFriendElement::GetFile()\n{\n \/\/ Return pointer to TFile containing this friend TTree.\n\n if (fFile || IsZombie()) return fFile;\n\n\n if (strlen(GetTitle())) {\n TDirectory::TContext ctxt(gDirectory, 0);\n fFile = TFile::Open(GetTitle());\n fOwnFile = kTRUE;\n } else {\n TDirectory *dir = fParentTree->GetDirectory();\n if (dir) {\n fFile = dir->GetFile();\n fOwnFile = kFALSE;\n }\n }\n if (fFile && fFile->IsZombie()) {\n MakeZombie();\n delete fFile;\n fFile = 0;\n }\n return fFile;\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::GetTree()\n{\n \/\/ Return pointer to friend TTree.\n\n if (fTree) return fTree;\n\n if (GetFile()) {\n fFile->GetObject(GetTreeName(),fTree);\n if (fTree) return fTree;\n }\n\n \/\/ This could be a memory tree or chain\n fTree = dynamic_cast<TTree*>( gROOT->FindObject(GetTreeName()) );\n\n return fTree;\n}\n\n\/\/_______________________________________________________________________\nvoid TFriendElement::ls(Option_t *) const\n{\n \/\/ List this friend element.\n\n printf(\" Friend Tree: %s in file: %s\\n\",GetName(),GetTitle());\n}\n<commit_msg>If the TreeFriend is entered via a TTree*, properly detect that it is in the same file and do _not_ record the filename (since we will alway know where to find it\\!)<commit_after>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Rene Brun 07\/04\/2001\n\n\/*************************************************************************\n * Copyright (C) 1995-2001, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TFriendElement \/\/\n\/\/ \/\/\n\/\/ A TFriendElement TF describes a TTree object TF in a file. \/\/\n\/\/ When a TFriendElement TF is added to the the list of friends of an \/\/\n\/\/ existing TTree T, any variable from TF can be referenced in a query \/\/\n\/\/ to T. \/\/\n\/\/ \/\/\n\/\/ To add a TFriendElement to an existing TTree T, do: \/\/\n\/\/ T.AddFriend(\"friendTreename\",\"friendTreeFile\"); \/\/\n\/\/ \/\/\n\/\/ See TTree::AddFriend for more information. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TTree.h\"\n#include \"TFriendElement.h\"\n#include \"TFile.h\"\n#include \"TROOT.h\"\n\nR__EXTERN TTree *gTree;\n\nClassImp(TFriendElement)\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement() : TNamed()\n{\n\/\/*-*-*-*-*-*Default constructor for a friend element*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* =======================================\n\n fFile = 0;\n fTree = 0;\n fOwnFile = kFALSE;\n fParentTree = gTree;\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, const char *treename, const char *filename)\n :TNamed(treename,filename)\n{\n\/\/*-*-*-*-*-*-*-*-*-*-*-*-*Create a friend element*-*-*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* ======================\n\/\/\n\/\/ If treename is of the form \"a=b\", an alias called \"a\" is created for\n\/\/ treename = \"b\" by default the alias name is the name of the tree.\n\n fFile = 0;\n fTree = 0;\n fOwnFile = kTRUE;\n fParentTree = tree;\n fTreeName = treename;\n if (strchr(treename,'=')) {\n char *temp = Compress(treename);\n char *equal = strchr(temp,'=');\n *equal=0;\n fTreeName = equal+1;\n SetName(temp);\n delete [] temp;\n }\n\n Connect();\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, const char *treename, TFile *file)\n :TNamed(treename,file?file->GetName():\"\")\n{\n\/\/*-*-*-*-*-*-*-*-*-*-*-*-*Create a friend element*-*-*-*-*-*-*-*-*-*-*-*-*-*-*\n\/\/*-* ======================\n\/\/\n\/\/ If treename is of the form \"a=b\", an alias called \"a\" is created for\n\/\/ treename = \"b\" by default the alias name is the name of the tree.\n\/\/ The passed TFile is managed by the user (i.e. user must delete the TFile).\n\n fFile = file;\n fTree = 0;\n fOwnFile = kFALSE;\n fParentTree = tree;\n fTreeName = treename;\n if (fParentTree && fParentTree->GetDirectory() \n && fTree->GetDirectory()->GetFile() == fFile) {\n \/\/ The friend and the TTree are in the same file, let's not record\n \/\/ the filename.\n SetTitle(\"\");\n }\n if (strchr(treename,'=')) {\n char *temp = Compress(treename);\n char *equal = strchr(temp,'=');\n *equal=0;\n fTreeName = equal+1;\n SetName(temp);\n delete [] temp;\n }\n\n Connect();\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(TTree *tree, TTree* friendtree, const char *alias)\n : TNamed(friendtree?friendtree->GetName():\"\",\n friendtree\n ? ( friendtree->GetDirectory()\n ? ( friendtree->GetDirectory()->GetFile()\n ? friendtree->GetDirectory()->GetFile()->GetName()\n : \"\")\n : \"\")\n : \"\")\n{\n \/\/ Create a friend element.\n\n fTree = friendtree;\n fTreeName = \"\";\n fFile = 0;\n fOwnFile = kFALSE;\n fParentTree = tree;\n if (fTree) {\n fTreeName = fTree->GetName();\n if (fTree->GetDirectory()) fFile = fTree->GetDirectory()->GetFile();\n if (fParentTree && fParentTree->GetDirectory() \n && fTree->GetDirectory()->GetFile() == fFile) {\n \/\/ The friend and the TTree are in the same file, let's not record\n \/\/ the filename.\n SetTitle(\"\");\n }\n }\n if (alias && strlen(alias)) {\n char *temp = Compress(alias);\n SetName(temp);\n delete [] temp;\n }\n\n \/\/ No need to Connect.\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::TFriendElement(const TFriendElement& tfe) : \n TNamed(tfe),\n fParentTree(tfe.fParentTree),\n fTree(tfe.fTree),\n fFile(tfe.fFile),\n fTreeName(tfe.fTreeName),\n fOwnFile(tfe.fOwnFile)\n{ \n \/\/ Copy constructor\n}\n\n\/\/______________________________________________________________________________\nTFriendElement& TFriendElement::operator=(const TFriendElement& tfe) \n{\n \/\/ Equal operator\n if(this!=&tfe) {\n TNamed::operator=(tfe);\n fParentTree=tfe.fParentTree;\n fTree=tfe.fTree;\n fFile=tfe.fFile;\n fTreeName=tfe.fTreeName;\n fOwnFile=tfe.fOwnFile;\n } return *this;\n}\n\n\/\/______________________________________________________________________________\nTFriendElement::~TFriendElement()\n{\n \/\/ Destructor. Disconnect from the owning tree if needed.\n\n DisConnect();\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::Connect()\n{\n \/\/ Connect file and return TTree.\n\n GetFile();\n return GetTree();\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::DisConnect()\n{\n \/\/ DisConnect file and TTree.\n\n if (fOwnFile) delete fFile;\n fFile = 0;\n fTree = 0;\n return 0;\n}\n\n\/\/_______________________________________________________________________\nTFile *TFriendElement::GetFile()\n{\n \/\/ Return pointer to TFile containing this friend TTree.\n\n if (fFile || IsZombie()) return fFile;\n\n\n if (strlen(GetTitle())) {\n TDirectory::TContext ctxt(gDirectory, 0);\n fFile = TFile::Open(GetTitle());\n fOwnFile = kTRUE;\n } else {\n TDirectory *dir = fParentTree->GetDirectory();\n if (dir) {\n fFile = dir->GetFile();\n fOwnFile = kFALSE;\n }\n }\n if (fFile && fFile->IsZombie()) {\n MakeZombie();\n delete fFile;\n fFile = 0;\n }\n return fFile;\n}\n\n\/\/_______________________________________________________________________\nTTree *TFriendElement::GetTree()\n{\n \/\/ Return pointer to friend TTree.\n\n if (fTree) return fTree;\n\n if (GetFile()) {\n fFile->GetObject(GetTreeName(),fTree);\n if (fTree) return fTree;\n }\n\n \/\/ This could be a memory tree or chain\n fTree = dynamic_cast<TTree*>( gROOT->FindObject(GetTreeName()) );\n\n return fTree;\n}\n\n\/\/_______________________________________________________________________\nvoid TFriendElement::ls(Option_t *) const\n{\n \/\/ List this friend element.\n\n printf(\" Friend Tree: %s in file: %s\\n\",GetName(),GetTitle());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: ftpintreq.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 13:51:29 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_ucb.hxx\"\n#include <com\/sun\/star\/ucb\/UnsupportedNameClashException.hpp>\n#include <com\/sun\/star\/ucb\/NameClash.hpp>\n#include \"ftpintreq.hxx\"\n\nusing namespace cppu;\nusing namespace com::sun::star;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::ucb;\nusing namespace com::sun::star::task;\nusing namespace ftp;\n\n\nXInteractionApproveImpl::XInteractionApproveImpl()\n : m_bSelected(false)\n{\n}\n\n\nvoid SAL_CALL\nXInteractionApproveImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\nvoid SAL_CALL\nXInteractionApproveImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionApproveImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionApprove*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionApproveImpl,\n XTypeProvider,\n XInteractionApprove )\n\n\nvoid SAL_CALL XInteractionApproveImpl::select()\n throw (RuntimeException)\n{\n m_bSelected = true;\n}\n\n\nbool XInteractionApproveImpl::isSelected() const\n{\n return m_bSelected;\n}\n\n\n\n\/\/ XInteractionDisapproveImpl\n\nXInteractionDisapproveImpl::XInteractionDisapproveImpl()\n : m_bSelected(false)\n{\n}\n\n\nvoid SAL_CALL\nXInteractionDisapproveImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\nvoid SAL_CALL\nXInteractionDisapproveImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionDisapproveImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionDisapprove*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionDisapproveImpl,\n XTypeProvider,\n XInteractionDisapprove )\n\n\nvoid SAL_CALL XInteractionDisapproveImpl::select()\n throw (RuntimeException)\n\n{\n m_bSelected = true;\n}\n\n\nbool XInteractionDisapproveImpl::isSelected() const\n{\n return m_bSelected;\n}\n\n\n\n\/\/ XInteractionRequestImpl\n\nXInteractionRequestImpl::XInteractionRequestImpl(const rtl::OUString& aName)\n : p1( new XInteractionApproveImpl ),\n p2( new XInteractionDisapproveImpl ),\n m_aName(aName),\n m_aSeq( 2 )\n{\n m_aSeq[0] = Reference<XInteractionContinuation>(p1);\n m_aSeq[1] = Reference<XInteractionContinuation>(p2);\n}\n\n\nvoid SAL_CALL\nXInteractionRequestImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\n\nvoid SAL_CALL\nXInteractionRequestImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionRequestImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionRequest*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionRequestImpl,\n XTypeProvider,\n XInteractionRequest )\n\n\nAny SAL_CALL XInteractionRequestImpl::getRequest( )\n throw (RuntimeException)\n{\n Any aAny;\n UnsupportedNameClashException excep;\n excep.NameClash = NameClash::ERROR;\n aAny <<= excep;\n return aAny;\n}\n\n\nSequence<Reference<XInteractionContinuation > > SAL_CALL\nXInteractionRequestImpl::getContinuations( )\n throw (RuntimeException)\n{\n return m_aSeq;\n}\n\n\nbool XInteractionRequestImpl::aborted() const\n{\n return p2->isSelected();\n}\n\n\nbool XInteractionRequestImpl::approved() const\n{\n return p1->isSelected();\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.118); FILE MERGED 2008\/03\/31 15:30:20 rt 1.4.118.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: ftpintreq.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_ucb.hxx\"\n#include <com\/sun\/star\/ucb\/UnsupportedNameClashException.hpp>\n#include <com\/sun\/star\/ucb\/NameClash.hpp>\n#include \"ftpintreq.hxx\"\n\nusing namespace cppu;\nusing namespace com::sun::star;\nusing namespace com::sun::star::uno;\nusing namespace com::sun::star::lang;\nusing namespace com::sun::star::ucb;\nusing namespace com::sun::star::task;\nusing namespace ftp;\n\n\nXInteractionApproveImpl::XInteractionApproveImpl()\n : m_bSelected(false)\n{\n}\n\n\nvoid SAL_CALL\nXInteractionApproveImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\nvoid SAL_CALL\nXInteractionApproveImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionApproveImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionApprove*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionApproveImpl,\n XTypeProvider,\n XInteractionApprove )\n\n\nvoid SAL_CALL XInteractionApproveImpl::select()\n throw (RuntimeException)\n{\n m_bSelected = true;\n}\n\n\nbool XInteractionApproveImpl::isSelected() const\n{\n return m_bSelected;\n}\n\n\n\n\/\/ XInteractionDisapproveImpl\n\nXInteractionDisapproveImpl::XInteractionDisapproveImpl()\n : m_bSelected(false)\n{\n}\n\n\nvoid SAL_CALL\nXInteractionDisapproveImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\nvoid SAL_CALL\nXInteractionDisapproveImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionDisapproveImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionDisapprove*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionDisapproveImpl,\n XTypeProvider,\n XInteractionDisapprove )\n\n\nvoid SAL_CALL XInteractionDisapproveImpl::select()\n throw (RuntimeException)\n\n{\n m_bSelected = true;\n}\n\n\nbool XInteractionDisapproveImpl::isSelected() const\n{\n return m_bSelected;\n}\n\n\n\n\/\/ XInteractionRequestImpl\n\nXInteractionRequestImpl::XInteractionRequestImpl(const rtl::OUString& aName)\n : p1( new XInteractionApproveImpl ),\n p2( new XInteractionDisapproveImpl ),\n m_aName(aName),\n m_aSeq( 2 )\n{\n m_aSeq[0] = Reference<XInteractionContinuation>(p1);\n m_aSeq[1] = Reference<XInteractionContinuation>(p2);\n}\n\n\nvoid SAL_CALL\nXInteractionRequestImpl::acquire( void )\n throw()\n{\n OWeakObject::acquire();\n}\n\n\n\nvoid SAL_CALL\nXInteractionRequestImpl::release( void )\n throw()\n{\n OWeakObject::release();\n}\n\n\n\nAny SAL_CALL\nXInteractionRequestImpl::queryInterface( const Type& rType )\n throw( RuntimeException )\n{\n Any aRet = cppu::queryInterface(\n rType,\n SAL_STATIC_CAST( lang::XTypeProvider*, this ),\n SAL_STATIC_CAST( XInteractionRequest*,this) );\n return aRet.hasValue() ? aRet : OWeakObject::queryInterface( rType );\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ XTypeProvider\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nXTYPEPROVIDER_IMPL_2( XInteractionRequestImpl,\n XTypeProvider,\n XInteractionRequest )\n\n\nAny SAL_CALL XInteractionRequestImpl::getRequest( )\n throw (RuntimeException)\n{\n Any aAny;\n UnsupportedNameClashException excep;\n excep.NameClash = NameClash::ERROR;\n aAny <<= excep;\n return aAny;\n}\n\n\nSequence<Reference<XInteractionContinuation > > SAL_CALL\nXInteractionRequestImpl::getContinuations( )\n throw (RuntimeException)\n{\n return m_aSeq;\n}\n\n\nbool XInteractionRequestImpl::aborted() const\n{\n return p2->isSelected();\n}\n\n\nbool XInteractionRequestImpl::approved() const\n{\n return p1->isSelected();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n#pragma once\n\n#ifndef _LIBQI_QI_ATOMIC_HPP_\n#define _LIBQI_QI_ATOMIC_HPP_\n\n#ifdef _MSC_VER\n# include <windows.h>\n#endif\n\nnamespace qi\n{\n template <typename T>\n class atomic\n {\n public:\n atomic()\n : _value(0)\n {\n }\n\n atomic(T value)\n : _value(value)\n {\n }\n\n \/* prefix operators *\/\n T operator++();\n T operator--();\n\n T operator*()\n {\n return _value;\n }\n\n private:\n T _value;\n };\n\n#ifdef __GNUC__\n template <typename T>\n T atomic<T>::operator++()\n {\n return __sync_add_and_fetch(&_value, 1);\n }\n\n template <typename T>\n T atomic<T>::operator--()\n {\n return __sync_sub_and_fetch(&_value, 1);\n }\n#endif\n\n#ifdef _MSC_VER\n template<>\n short atomic<short>::operator++()\n {\n return _InterlockedIncrement16(&_value);\n }\n\n template<>\n short atomic<short>::operator--()\n {\n return _InterlockedDecrement16(&_value);\n }\n\n template <>\n long atomic<long>::operator++()\n {\n return _InterlockedIncrement(&_value);\n }\n\n template <>\n long atomic<long>::operator--()\n {\n return _InterlockedDecrement(&_value);\n }\n#endif\n}\n\n#endif \/\/ _LIBQI_QI_ATOMIC_HPP_\n<commit_msg>Inline templates.<commit_after>\/*\n * Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n#pragma once\n\n#ifndef _LIBQI_QI_ATOMIC_HPP_\n#define _LIBQI_QI_ATOMIC_HPP_\n\n#ifdef _MSC_VER\n# include <windows.h>\n#endif\n\n#include <qi\/config.hpp>\n\nnamespace qi\n{\n template <typename T>\n class QI_API atomic\n {\n public:\n atomic()\n : _value(0)\n {\n }\n\n atomic(T value)\n : _value(value)\n {\n }\n\n \/* prefix operators *\/\n T operator++();\n T operator--();\n\n T operator*()\n {\n return _value;\n }\n\n private:\n T _value;\n };\n\n#ifdef __GNUC__\n template <typename T>\n T atomic<T>::operator++()\n {\n return __sync_add_and_fetch(&_value, 1);\n }\n\n template <typename T>\n T atomic<T>::operator--()\n {\n return __sync_sub_and_fetch(&_value, 1);\n }\n#endif\n\n#ifdef _MSC_VER\n template<>\n inline short atomic<short>::operator++()\n {\n return _InterlockedIncrement16(&_value);\n }\n\n template<>\n inline short atomic<short>::operator--()\n {\n return _InterlockedDecrement16(&_value);\n }\n\n template <>\n inline long atomic<long>::operator++()\n {\n return _InterlockedIncrement(&_value);\n }\n\n template <>\n inline long atomic<long>::operator--()\n {\n return _InterlockedDecrement(&_value);\n }\n#endif\n}\n\n#endif \/\/ _LIBQI_QI_ATOMIC_HPP_\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QITYPE_FUTURE_HPP_\n#define _QITYPE_FUTURE_HPP_\n\n#include <qi\/api.hpp>\n#include <vector>\n#include <qi\/atomic.hpp>\n#include <qi\/config.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/make_shared.hpp>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/thread\/recursive_mutex.hpp>\n\n#ifdef _MSC_VER\n# pragma warning( push )\n# pragma warning( disable: 4251 )\n# pragma warning( disable: 4275 ) \/\/std::runtime_error: no dll interface\n#endif\n\nnamespace qi {\n\n template<typename T>\n struct FutureType\n {\n typedef T type;\n typedef T typecast;\n };\n\n struct FutureHasNoValue {};\n \/\/ Hold a void* for Future<void>\n template<>\n struct FutureType<void>\n {\n typedef void* type;\n typedef FutureHasNoValue typecast;\n };\n\n template <typename T> class FutureInterface;\n template <typename T> class Future;\n template <typename T> class FutureSync;\n template <typename T> class Promise;\n\n namespace detail {\n template <typename T> class FutureBaseTyped;\n }\n\n \/** State of the future.\n *\/\n enum FutureState {\n FutureState_None, \/\/\/ Future is not tied to a promise\n FutureState_Running, \/\/\/ Operation pending\n FutureState_Canceled, \/\/\/ The future has been canceled\n FutureState_FinishedWithError, \/\/\/ The operation is finished with an error\n FutureState_FinishedWithValue, \/\/\/ The operation is finished with a value\n };\n\n enum FutureTimeout {\n FutureTimeout_Infinite = ((int) 0x7fffffff),\n FutureTimeout_None = 0,\n };\n\n \/** base exception raised for all future error.\n *\/\n class QI_API FutureException : public std::runtime_error {\n public:\n enum ExceptionState {\n \/\/No result ready\n ExceptionState_FutureTimeout,\n \/\/The future has been canceled\n ExceptionState_FutureCanceled,\n \/\/The future is not cancelable\n ExceptionState_FutureNotCancelable,\n \/\/asked for error, but there is no error\n ExceptionState_FutureHasNoError,\n \/\/real future error\n ExceptionState_FutureUserError,\n \/\/when the promise is already set.\n ExceptionState_PromiseAlreadySet,\n };\n\n explicit FutureException(const ExceptionState &es, const std::string &str = std::string())\n : std::runtime_error(stateToString(es) + str)\n , _state(es)\n {}\n\n inline ExceptionState state() const { return _state; }\n\n std::string stateToString(const ExceptionState &es);\n\n virtual ~FutureException() throw()\n {}\n\n private:\n ExceptionState _state;\n };\n\n \/** Exception inherited from FutureException\n * This exception represent an error reported by the operation.\n *\/\n class QI_API FutureUserException : public FutureException {\n public:\n\n explicit FutureUserException(const std::string &str = std::string())\n : FutureException(ExceptionState_FutureUserError, str)\n {}\n\n virtual ~FutureUserException() throw()\n {}\n };\n\n template <typename T>\n class Future {\n public:\n typedef typename FutureType<T>::type ValueType;\n typedef typename FutureType<T>::typecast ValueTypeCast;\n\n public:\n Future()\n : _p(boost::make_shared<detail::FutureBaseTyped<T> >())\n {\n }\n\n Future(const Future<T>& b)\n : _p(b._p)\n {}\n\n bool operator==(const Future<T> &other)\n {\n return _p.get() == other._p.get();\n }\n\n inline Future<T>& operator=(const Future<T>& b)\n {\n _p = b._p;\n return *this;\n }\n\n bool operator < (const Future<T>& b) const\n {\n return _p.get() < b._p.get();\n }\n explicit Future<T>(const ValueType& v)\n {\n Promise<T> promise;\n promise.setValue(v);\n *this = promise.future();\n }\n\n \/**\n * @brief Return the value associated to a Future.\n * @param msecs timeout\n * @return the value\n *\n * This function can throw for many reason:\n * - wait timeout\n * - user error\n * - future canceled\n *\n * if an error is set, then value throw a FutureUserException, others errors are FutureException.\n *\/\n inline const ValueType &value(int msecs = FutureTimeout_Infinite) const { return _p->value(msecs); }\n\n \/** same as value() with an infinite timeout.\n *\/\n inline operator const ValueTypeCast&() const { return _p->value(FutureTimeout_Infinite); }\n\n \/** Wait for future to contain a value or an error\n @param msecs: Maximum time to wait in milliseconds, 0 means forever and -1 means return immediately.\n @return true if future contains a value or an error, false if timeout was reached\n *\/\n inline FutureState wait(int msecs = FutureTimeout_Infinite) const { return _p->wait(msecs); }\n\n \/**\n * @brief isFinished\n * @return true if finished\n * do not throw\n *\/\n inline bool isFinished() const { return _p->isFinished(); }\n\n \/**\n * @brief isRunning\n * @return\n * do not throw\n *\/\n inline bool isRunning() const { return _p->isRunning(); }\n\n \/**\n * @brief isCanceled\n * @return\n * do not throw\n *\/\n inline bool isCanceled() const { return _p->isCanceled(); }\n\n \/**\n * @brief hasError\n * @param msecs timeout\n * @return true if the future has an error.\n * throw in the following case:\n * - timeout\n *\/\n inline bool hasError(int msecs = FutureTimeout_Infinite) const { return _p->hasError(msecs); }\n \/**\n * @brief hasValue\n * @param msecs timeout\n * @return\n * true if the future has a value.\n * throw in the following case:\n * - timeout\n *\/\n inline bool hasValue(int msecs = FutureTimeout_Infinite) const { return _p->hasValue(msecs); }\n\n \/**\n * @brief error\n * @param msecs\n * @return the error\n * throw on timeout\n * throw if the future do not have an actual error.\n *\/\n inline const std::string &error(int msecs = FutureTimeout_Infinite) const { return _p->error(msecs); }\n\n\n inline FutureSync<T> sync()\n {\n return FutureSync<T>(*this);\n };\n\n \/** cancel() the asynchronous operation if possible\n * Exact effect is controlled by the cancel implementation, but it is\n * expected to set a value or an error to the Future as fast as possible.\n * Note that cancelation may be asynchronous.\n * @throw ExceptionState_FutureNotCancelable if isCanceleable() is false.\n *\/\n void cancel()\n {\n _p->cancel();\n }\n\n \/** return true if the future can be canceled. This does not mean that cancel will succeed.\n *\/\n bool isCanceleable() const\n {\n return _p->isCanceleable();\n }\n public: \/\/Signals\n typedef boost::function<void (Future<T>) > Connection;\n inline void connect(const Connection& s) { _p->connect(*this, s);}\n\n\n \/\/ Our companion library libqitype requires a connect with same signature for all instantiations\n inline void _connect(const boost::function<void()>& s) { connect(boost::bind(s));}\n\n protected:\n \/\/ C4251 needs to have dll-interface to be used by clients of class 'qi::Future<T>'\n boost::shared_ptr< detail::FutureBaseTyped<T> > _p;\n friend class Promise<T>;\n friend class FutureSync<T>;\n };\n\n\n\n \/** this class allow throwing on error and being synchronous\n * when the future is not handled by the client.\n *\/\n template<typename T>\n class FutureSync\n {\n public:\n typedef typename Future<T>::ValueType ValueType;\n typedef typename Future<T>::ValueTypeCast ValueTypeCast;\n typedef typename Future<T>::Connection Connection;\n \/\/ This future cannot be set, so sync starts at false\n FutureSync() : _sync(false) {}\n\n FutureSync(const Future<T>& b)\n : _sync(true)\n {\n _future = b;\n }\n\n FutureSync(const FutureSync<T>& b)\n : _sync(true)\n {\n _future = b._future;\n b._sync = false;\n }\n\n explicit FutureSync<T>(const ValueType& v)\n : _sync(false)\n {\n Promise<T> promise;\n promise.setValue(v);\n _future = promise.future();\n }\n\n inline FutureSync<T>& operator=(const FutureSync<T>& b)\n {\n _future = b;\n _sync = true;\n b._sync = false;\n return *this;\n }\n\n inline FutureSync<T>& operator=(const Future<T>& b)\n {\n _future = b;\n _sync = true;\n return *this;\n }\n\n ~FutureSync()\n {\n if (_sync)\n _future.value();\n }\n\n operator Future<T>()\n {\n return async();\n }\n\n bool operator < (const FutureSync<T>& b) const\n {\n return _future._p.get() < b._future._p.get();\n }\n\n inline const ValueType &value() const { _sync = false; return _future.value(); }\n inline operator const typename Future<T>::ValueTypeCast&() const { _sync = false; return _future.value(); }\n inline FutureState wait(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.wait(msecs); }\n inline bool isRunning() const { _sync = false; return _future.isRunning(); }\n inline bool isFinished() const { _sync = false; return _future.isFinished(); }\n inline bool isCanceled() const { _sync = false; return _future.isCanceled(); }\n inline bool hasError(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.hasError(msecs); }\n inline bool hasValue(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.hasValue(msecs); }\n\n inline const std::string &error() const { _sync = false; return _future.error(); }\n inline void cancel() { _sync = false; _future.cancel(); }\n inline bool isCanceleable() const { _sync = false; return _future.isCanceleable(); }\n inline void connect(const Connection& s) { _sync = false; _future.connect(s);}\n inline void _connect(const boost::function<void()>& s) { _sync = false; _future._connect(s);}\n\n Future<T> async()\n {\n _sync = false;\n return _future;\n }\n\n protected:\n mutable bool _sync;\n Future<T> _future;\n friend class Future<T>;\n };\n\n\n template <typename T>\n class Promise {\n public:\n typedef typename FutureType<T>::type ValueType;\n\n Promise() {\n _f._p->reportStart();\n }\n\n \/** Create a canceleable promise. If Future<T>::cancel is invoked,\n * onCancel() will be called. It is expected to call setValue(),\n * setError() or setCanceled() as quickly as possible, but can do so\n * in an asynchronous way.\n *\/\n Promise(boost::function<void (qi::Promise<T>)> cancelCallback)\n {\n _f._p->reportStart();\n _f._p->setOnCancel(boost::bind<void>(cancelCallback, *this));\n }\n\n \/** notify all future that a value has been set.\n * throw if state != running\n *\/\n void setValue(const ValueType &value) {\n _f._p->setValue(_f, value);\n }\n\n \/** set the error, and notify all futures\n * throw if state != running\n *\/\n void setError(const std::string &msg) {\n _f._p->setError(_f, msg);\n }\n\n \/** set the cancel state, and notify all futures\n * throw if state != running\n *\/\n void setCanceled() {\n _f._p->setCanceled(_f);\n }\n\n \/* reset the promise and the future *\/\n void reset() {\n _f._p->reset();\n }\n\n \/* get the future from the promise, you can call this function many times. *\/\n Future<T> future() { return _f; }\n\n \/** Gives access to the underlying value for in-place modification.\n * trigger() must be called after the value is written to trigger the promise.\n *\/\n ValueType& value() { return _f._p->_value;}\n \/** Trigger the promise with the current value.\n *\/\n void trigger() { _f._p->set(_f);}\n protected:\n Future<T> _f;\n };\n\n template<typename T>\n class FutureBarrier {\n public:\n \/\/\/ FutureBarrier constructor taking no argument.\n FutureBarrier()\n : _closed(false)\n , _count(0)\n , _futures()\n , _promise()\n {}\n\n \/\/\/ Adds the future to the barrier.\n bool addFuture(qi::Future<T> fut) {\n \/\/ Can't add future from closed qi::FutureBarrier.\n if (this->_closed)\n return false;\n\n ++(this->_count);\n fut.connect(boost::bind<void>(&FutureBarrier::onFutureFinish, this));\n this->_futures.push_back(fut);\n return true;\n }\n\n \/\/\/ Gets the future result for the barrier.\n Future< std::vector< Future<T> > > future() {\n this->close();\n return this->_promise.future();\n }\n\n protected:\n bool _closed;\n Atomic<int> _count;\n std::vector< Future<T> > _futures;\n Promise< std::vector< Future<T> > > _promise;\n\n private:\n void onFutureFinish() {\n if (--(this->_count) == 0 && this->_closed) {\n this->_promise.setValue(this->_futures);\n }\n }\n\n void close() {\n this->_closed = true;\n if (*(this->_count) == 0) {\n this->_promise.setValue(this->_futures);\n }\n }\n };\n\n template <typename T>\n qi::Future<T> makeFutureError(const std::string &value);\n\n \/\/\/ Helper function to wait on a vector of futures.\n template <typename T>\n void waitForAll(std::vector< Future<T> >& vect);\n\n \/\/\/ Helper function to wait for the first valid future.\n template <typename T>\n qi::FutureSync< qi::Future<T> > waitForFirst(std::vector< Future<T> >& vect);\n\n \/\/\/ Specialize this struct to provide conversion between future values\n template<typename FT, typename PT>\n struct FutureValueConverter\n {\n void operator()(const FT& vIn, PT& vOut) { vOut = vIn;}\n };\n\n \/** Feed a promise from a future of possibly different type.\n * Will monitor \\p f, and bounce its state to \\p p.\n * Error and canceled state are bounced as is.\n * Valued state is bounced through FutureValueConverter<FT, PT>::convert()\n *\/\n template<typename FT, typename PT>\n void adaptFuture(const Future<FT>& f, Promise<PT>& p);\n\n \/\/\/ Similar to adaptFuture(f, p) but with a custom converter\n template<typename FT, typename PT, typename CONV>\n void adaptFuture(const Future<FT>& f, Promise<PT>& p, CONV converter);\n}\n\n#ifdef _MSC_VER\n# pragma warning( pop )\n#endif\n\n#include <qi\/details\/future.hxx>\n\n#endif \/\/ _QITYPE_FUTURE_HPP_\n<commit_msg>FutureSync: remove inline, fix value and error. (default args)<commit_after>#pragma once\n\/*\n** Copyright (C) 2012 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#ifndef _QITYPE_FUTURE_HPP_\n#define _QITYPE_FUTURE_HPP_\n\n#include <qi\/api.hpp>\n#include <vector>\n#include <qi\/atomic.hpp>\n#include <qi\/config.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/make_shared.hpp>\n#include <boost\/function.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/thread\/recursive_mutex.hpp>\n\n#ifdef _MSC_VER\n# pragma warning( push )\n# pragma warning( disable: 4251 )\n# pragma warning( disable: 4275 ) \/\/std::runtime_error: no dll interface\n#endif\n\nnamespace qi {\n\n template<typename T>\n struct FutureType\n {\n typedef T type;\n typedef T typecast;\n };\n\n struct FutureHasNoValue {};\n \/\/ Hold a void* for Future<void>\n template<>\n struct FutureType<void>\n {\n typedef void* type;\n typedef FutureHasNoValue typecast;\n };\n\n template <typename T> class FutureInterface;\n template <typename T> class Future;\n template <typename T> class FutureSync;\n template <typename T> class Promise;\n\n namespace detail {\n template <typename T> class FutureBaseTyped;\n }\n\n \/** State of the future.\n *\/\n enum FutureState {\n FutureState_None, \/\/\/ Future is not tied to a promise\n FutureState_Running, \/\/\/ Operation pending\n FutureState_Canceled, \/\/\/ The future has been canceled\n FutureState_FinishedWithError, \/\/\/ The operation is finished with an error\n FutureState_FinishedWithValue, \/\/\/ The operation is finished with a value\n };\n\n enum FutureTimeout {\n FutureTimeout_Infinite = ((int) 0x7fffffff),\n FutureTimeout_None = 0,\n };\n\n \/** base exception raised for all future error.\n *\/\n class QI_API FutureException : public std::runtime_error {\n public:\n enum ExceptionState {\n \/\/No result ready\n ExceptionState_FutureTimeout,\n \/\/The future has been canceled\n ExceptionState_FutureCanceled,\n \/\/The future is not cancelable\n ExceptionState_FutureNotCancelable,\n \/\/asked for error, but there is no error\n ExceptionState_FutureHasNoError,\n \/\/real future error\n ExceptionState_FutureUserError,\n \/\/when the promise is already set.\n ExceptionState_PromiseAlreadySet,\n };\n\n explicit FutureException(const ExceptionState &es, const std::string &str = std::string())\n : std::runtime_error(stateToString(es) + str)\n , _state(es)\n {}\n\n inline ExceptionState state() const { return _state; }\n\n std::string stateToString(const ExceptionState &es);\n\n virtual ~FutureException() throw()\n {}\n\n private:\n ExceptionState _state;\n };\n\n \/** Exception inherited from FutureException\n * This exception represent an error reported by the operation.\n *\/\n class QI_API FutureUserException : public FutureException {\n public:\n\n explicit FutureUserException(const std::string &str = std::string())\n : FutureException(ExceptionState_FutureUserError, str)\n {}\n\n virtual ~FutureUserException() throw()\n {}\n };\n\n template <typename T>\n class Future {\n public:\n typedef typename FutureType<T>::type ValueType;\n typedef typename FutureType<T>::typecast ValueTypeCast;\n\n public:\n Future()\n : _p(boost::make_shared<detail::FutureBaseTyped<T> >())\n {\n }\n\n Future(const Future<T>& b)\n : _p(b._p)\n {}\n\n bool operator==(const Future<T> &other)\n {\n return _p.get() == other._p.get();\n }\n\n inline Future<T>& operator=(const Future<T>& b)\n {\n _p = b._p;\n return *this;\n }\n\n bool operator < (const Future<T>& b) const\n {\n return _p.get() < b._p.get();\n }\n explicit Future<T>(const ValueType& v)\n {\n Promise<T> promise;\n promise.setValue(v);\n *this = promise.future();\n }\n\n \/**\n * @brief Return the value associated to a Future.\n * @param msecs timeout\n * @return the value\n *\n * This function can throw for many reason:\n * - wait timeout\n * - user error\n * - future canceled\n *\n * if an error is set, then value throw a FutureUserException, others errors are FutureException.\n *\/\n inline const ValueType &value(int msecs = FutureTimeout_Infinite) const { return _p->value(msecs); }\n\n \/** same as value() with an infinite timeout.\n *\/\n inline operator const ValueTypeCast&() const { return _p->value(FutureTimeout_Infinite); }\n\n \/** Wait for future to contain a value or an error\n @param msecs: Maximum time to wait in milliseconds, 0 means forever and -1 means return immediately.\n @return true if future contains a value or an error, false if timeout was reached\n *\/\n inline FutureState wait(int msecs = FutureTimeout_Infinite) const { return _p->wait(msecs); }\n\n \/**\n * @brief isFinished\n * @return true if finished\n * do not throw\n *\/\n inline bool isFinished() const { return _p->isFinished(); }\n\n \/**\n * @brief isRunning\n * @return\n * do not throw\n *\/\n inline bool isRunning() const { return _p->isRunning(); }\n\n \/**\n * @brief isCanceled\n * @return\n * do not throw\n *\/\n inline bool isCanceled() const { return _p->isCanceled(); }\n\n \/**\n * @brief hasError\n * @param msecs timeout\n * @return true if the future has an error.\n * throw in the following case:\n * - timeout\n *\/\n inline bool hasError(int msecs = FutureTimeout_Infinite) const { return _p->hasError(msecs); }\n \/**\n * @brief hasValue\n * @param msecs timeout\n * @return\n * true if the future has a value.\n * throw in the following case:\n * - timeout\n *\/\n inline bool hasValue(int msecs = FutureTimeout_Infinite) const { return _p->hasValue(msecs); }\n\n \/**\n * @brief error\n * @param msecs\n * @return the error\n * throw on timeout\n * throw if the future do not have an actual error.\n *\/\n inline const std::string &error(int msecs = FutureTimeout_Infinite) const { return _p->error(msecs); }\n\n\n inline FutureSync<T> sync()\n {\n return FutureSync<T>(*this);\n };\n\n \/** cancel() the asynchronous operation if possible\n * Exact effect is controlled by the cancel implementation, but it is\n * expected to set a value or an error to the Future as fast as possible.\n * Note that cancelation may be asynchronous.\n * @throw ExceptionState_FutureNotCancelable if isCanceleable() is false.\n *\/\n void cancel()\n {\n _p->cancel();\n }\n\n \/** return true if the future can be canceled. This does not mean that cancel will succeed.\n *\/\n bool isCanceleable() const\n {\n return _p->isCanceleable();\n }\n public: \/\/Signals\n typedef boost::function<void (Future<T>) > Connection;\n inline void connect(const Connection& s) { _p->connect(*this, s);}\n\n\n \/\/ Our companion library libqitype requires a connect with same signature for all instantiations\n inline void _connect(const boost::function<void()>& s) { connect(boost::bind(s));}\n\n protected:\n \/\/ C4251 needs to have dll-interface to be used by clients of class 'qi::Future<T>'\n boost::shared_ptr< detail::FutureBaseTyped<T> > _p;\n friend class Promise<T>;\n friend class FutureSync<T>;\n };\n\n\n\n \/** this class allow throwing on error and being synchronous\n * when the future is not handled by the client.\n *\/\n template<typename T>\n class FutureSync\n {\n public:\n typedef typename Future<T>::ValueType ValueType;\n typedef typename Future<T>::ValueTypeCast ValueTypeCast;\n typedef typename Future<T>::Connection Connection;\n \/\/ This future cannot be set, so sync starts at false\n FutureSync() : _sync(false) {}\n\n FutureSync(const Future<T>& b)\n : _sync(true)\n {\n _future = b;\n }\n\n FutureSync(const FutureSync<T>& b)\n : _sync(true)\n {\n _future = b._future;\n b._sync = false;\n }\n\n explicit FutureSync<T>(const ValueType& v)\n : _sync(false)\n {\n Promise<T> promise;\n promise.setValue(v);\n _future = promise.future();\n }\n\n inline FutureSync<T>& operator=(const FutureSync<T>& b)\n {\n _future = b;\n _sync = true;\n b._sync = false;\n return *this;\n }\n\n inline FutureSync<T>& operator=(const Future<T>& b)\n {\n _future = b;\n _sync = true;\n return *this;\n }\n\n ~FutureSync()\n {\n if (_sync)\n _future.value();\n }\n\n operator Future<T>()\n {\n return async();\n }\n\n bool operator < (const FutureSync<T>& b) const\n {\n return _future._p.get() < b._future._p.get();\n }\n\n const ValueType &value(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.value(msecs); }\n operator const typename Future<T>::ValueTypeCast&() const { _sync = false; return _future.value(); }\n FutureState wait(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.wait(msecs); }\n bool isRunning() const { _sync = false; return _future.isRunning(); }\n bool isFinished() const { _sync = false; return _future.isFinished(); }\n bool isCanceled() const { _sync = false; return _future.isCanceled(); }\n bool hasError(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.hasError(msecs); }\n bool hasValue(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.hasValue(msecs); }\n const std::string &error(int msecs = FutureTimeout_Infinite) const { _sync = false; return _future.error(msecs); }\n void cancel() { _sync = false; _future.cancel(); }\n bool isCanceleable() const { _sync = false; return _future.isCanceleable(); }\n void connect(const Connection& s) { _sync = false; _future.connect(s);}\n void _connect(const boost::function<void()>& s) { _sync = false; _future._connect(s);}\n\n Future<T> async()\n {\n _sync = false;\n return _future;\n }\n\n protected:\n mutable bool _sync;\n Future<T> _future;\n friend class Future<T>;\n };\n\n\n template <typename T>\n class Promise {\n public:\n typedef typename FutureType<T>::type ValueType;\n\n Promise() {\n _f._p->reportStart();\n }\n\n \/** Create a canceleable promise. If Future<T>::cancel is invoked,\n * onCancel() will be called. It is expected to call setValue(),\n * setError() or setCanceled() as quickly as possible, but can do so\n * in an asynchronous way.\n *\/\n Promise(boost::function<void (qi::Promise<T>)> cancelCallback)\n {\n _f._p->reportStart();\n _f._p->setOnCancel(boost::bind<void>(cancelCallback, *this));\n }\n\n \/** notify all future that a value has been set.\n * throw if state != running\n *\/\n void setValue(const ValueType &value) {\n _f._p->setValue(_f, value);\n }\n\n \/** set the error, and notify all futures\n * throw if state != running\n *\/\n void setError(const std::string &msg) {\n _f._p->setError(_f, msg);\n }\n\n \/** set the cancel state, and notify all futures\n * throw if state != running\n *\/\n void setCanceled() {\n _f._p->setCanceled(_f);\n }\n\n \/* reset the promise and the future *\/\n void reset() {\n _f._p->reset();\n }\n\n \/* get the future from the promise, you can call this function many times. *\/\n Future<T> future() { return _f; }\n\n \/** Gives access to the underlying value for in-place modification.\n * trigger() must be called after the value is written to trigger the promise.\n *\/\n ValueType& value() { return _f._p->_value;}\n \/** Trigger the promise with the current value.\n *\/\n void trigger() { _f._p->set(_f);}\n protected:\n Future<T> _f;\n };\n\n template<typename T>\n class FutureBarrier {\n public:\n \/\/\/ FutureBarrier constructor taking no argument.\n FutureBarrier()\n : _closed(false)\n , _count(0)\n , _futures()\n , _promise()\n {}\n\n \/\/\/ Adds the future to the barrier.\n bool addFuture(qi::Future<T> fut) {\n \/\/ Can't add future from closed qi::FutureBarrier.\n if (this->_closed)\n return false;\n\n ++(this->_count);\n fut.connect(boost::bind<void>(&FutureBarrier::onFutureFinish, this));\n this->_futures.push_back(fut);\n return true;\n }\n\n \/\/\/ Gets the future result for the barrier.\n Future< std::vector< Future<T> > > future() {\n this->close();\n return this->_promise.future();\n }\n\n protected:\n bool _closed;\n Atomic<int> _count;\n std::vector< Future<T> > _futures;\n Promise< std::vector< Future<T> > > _promise;\n\n private:\n void onFutureFinish() {\n if (--(this->_count) == 0 && this->_closed) {\n this->_promise.setValue(this->_futures);\n }\n }\n\n void close() {\n this->_closed = true;\n if (*(this->_count) == 0) {\n this->_promise.setValue(this->_futures);\n }\n }\n };\n\n template <typename T>\n qi::Future<T> makeFutureError(const std::string &value);\n\n \/\/\/ Helper function to wait on a vector of futures.\n template <typename T>\n void waitForAll(std::vector< Future<T> >& vect);\n\n \/\/\/ Helper function to wait for the first valid future.\n template <typename T>\n qi::FutureSync< qi::Future<T> > waitForFirst(std::vector< Future<T> >& vect);\n\n \/\/\/ Specialize this struct to provide conversion between future values\n template<typename FT, typename PT>\n struct FutureValueConverter\n {\n void operator()(const FT& vIn, PT& vOut) { vOut = vIn;}\n };\n\n \/** Feed a promise from a future of possibly different type.\n * Will monitor \\p f, and bounce its state to \\p p.\n * Error and canceled state are bounced as is.\n * Valued state is bounced through FutureValueConverter<FT, PT>::convert()\n *\/\n template<typename FT, typename PT>\n void adaptFuture(const Future<FT>& f, Promise<PT>& p);\n\n \/\/\/ Similar to adaptFuture(f, p) but with a custom converter\n template<typename FT, typename PT, typename CONV>\n void adaptFuture(const Future<FT>& f, Promise<PT>& p, CONV converter);\n}\n\n#ifdef _MSC_VER\n# pragma warning( pop )\n#endif\n\n#include <qi\/details\/future.hxx>\n\n#endif \/\/ _QITYPE_FUTURE_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/ime\/input_method_bridge.h\"\n\n#include \"ui\/base\/ime\/input_method.h\"\n#include \"ui\/base\/ime\/input_method_observer.h\"\n#include \"ui\/events\/event.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/views\/view.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace views {\n\n\/\/ InputMethodBridge::HostObserver class ---------------------------------------\n\n\/\/ An observer class for observing the host input method. When the host input\n\/\/ method is destroyed, it will null out the |host_| field on the\n\/\/ InputMethodBridge object.\nclass InputMethodBridge::HostObserver : public ui::InputMethodObserver {\n public:\n explicit HostObserver(InputMethodBridge* bridge);\n virtual ~HostObserver();\n\n virtual void OnTextInputTypeChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnFocus() OVERRIDE {}\n virtual void OnBlur() OVERRIDE {}\n virtual void OnCaretBoundsChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnTextInputStateChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnInputMethodDestroyed(\n const ui::InputMethod* input_method) OVERRIDE;\n\n private:\n InputMethodBridge* bridge_;\n\n DISALLOW_COPY_AND_ASSIGN(HostObserver);\n};\n\nInputMethodBridge::HostObserver::HostObserver(InputMethodBridge* bridge)\n : bridge_(bridge) {\n bridge_->host_->AddObserver(this);\n}\n\nInputMethodBridge::HostObserver::~HostObserver() {\n if (bridge_->host_)\n bridge_->host_->RemoveObserver(this);\n}\n\nvoid InputMethodBridge::HostObserver::OnInputMethodDestroyed(\n const ui::InputMethod* input_method) {\n DCHECK_EQ(bridge_->host_, input_method);\n bridge_->host_->RemoveObserver(this);\n bridge_->host_ = NULL;\n}\n\n\/\/ InputMethodBridge class -----------------------------------------------------\n\nInputMethodBridge::InputMethodBridge(internal::InputMethodDelegate* delegate,\n ui::InputMethod* host,\n bool shared_input_method)\n : host_(host),\n shared_input_method_(shared_input_method) {\n DCHECK(host_);\n SetDelegate(delegate);\n\n host_observer_.reset(new HostObserver(this));\n}\n\nInputMethodBridge::~InputMethodBridge() {\n \/\/ By the time we get here it's very likely |widget_|'s NativeWidget has been\n \/\/ destroyed. This means any calls to |widget_| that go to the NativeWidget,\n \/\/ such as IsActive(), will crash. SetFocusedTextInputClient() may callback to\n \/\/ this and go into |widget_|. NULL out |widget_| so we don't attempt to use\n \/\/ it.\n DetachFromWidget();\n\n \/\/ Host input method might have been destroyed at this point.\n if (host_)\n host_->DetachTextInputClient(this);\n}\n\nvoid InputMethodBridge::OnFocus() {\n DCHECK(host_);\n\n \/\/ Direct the shared IME to send TextInputClient messages to |this| object.\n if (shared_input_method_ || !host_->GetTextInputClient())\n host_->SetFocusedTextInputClient(this);\n\n \/\/ TODO(yusukes): We don't need to call OnTextInputTypeChanged() once we move\n \/\/ text input type tracker code to ui::InputMethodBase.\n if (GetFocusedView())\n OnTextInputTypeChanged(GetFocusedView());\n}\n\nvoid InputMethodBridge::OnBlur() {\n DCHECK(host_);\n\n if (HasCompositionText()) {\n ConfirmCompositionText();\n host_->CancelComposition(this);\n }\n\n if (host_->GetTextInputClient() == this)\n host_->SetFocusedTextInputClient(NULL);\n}\n\nbool InputMethodBridge::OnUntranslatedIMEMessage(const base::NativeEvent& event,\n NativeEventResult* result) {\n DCHECK(host_);\n\n return host_->OnUntranslatedIMEMessage(event, result);\n}\n\nvoid InputMethodBridge::DispatchKeyEvent(const ui::KeyEvent& key) {\n DCHECK(key.type() == ui::ET_KEY_PRESSED || key.type() == ui::ET_KEY_RELEASED);\n\n \/\/ We can just dispatch the event here since the |key| is already processed by\n \/\/ the system-wide IME.\n DispatchKeyEventPostIME(key);\n}\n\nvoid InputMethodBridge::OnTextInputTypeChanged(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view))\n host_->OnTextInputTypeChanged(this);\n InputMethodBase::OnTextInputTypeChanged(view);\n}\n\nvoid InputMethodBridge::OnCaretBoundsChanged(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view) && !IsTextInputTypeNone())\n host_->OnCaretBoundsChanged(this);\n}\n\nvoid InputMethodBridge::CancelComposition(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view))\n host_->CancelComposition(this);\n}\n\nvoid InputMethodBridge::OnInputLocaleChanged() {\n DCHECK(host_);\n\n host_->OnInputLocaleChanged();\n}\n\nstd::string InputMethodBridge::GetInputLocale() {\n DCHECK(host_);\n\n return host_->GetInputLocale();\n}\n\nbase::i18n::TextDirection InputMethodBridge::GetInputTextDirection() {\n DCHECK(host_);\n\n return host_->GetInputTextDirection();\n}\n\nbool InputMethodBridge::IsActive() {\n DCHECK(host_);\n\n return host_->IsActive();\n}\n\nbool InputMethodBridge::IsCandidatePopupOpen() const {\n DCHECK(host_);\n\n return host_->IsCandidatePopupOpen();\n}\n\n\/\/ Overridden from TextInputClient. Forward an event from the system-wide IME\n\/\/ to the text input |client|, which is e.g. views::NativeTextfieldViews.\nvoid InputMethodBridge::SetCompositionText(\n const ui::CompositionText& composition) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->SetCompositionText(composition);\n}\n\nvoid InputMethodBridge::ConfirmCompositionText() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ConfirmCompositionText();\n}\n\nvoid InputMethodBridge::ClearCompositionText() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ClearCompositionText();\n}\n\nvoid InputMethodBridge::InsertText(const string16& text) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->InsertText(text);\n}\n\nvoid InputMethodBridge::InsertChar(char16 ch, int flags) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->InsertChar(ch, flags);\n}\n\ngfx::NativeWindow InputMethodBridge::GetAttachedWindow() const {\n TextInputClient* client = GetTextInputClient();\n return client ?\n client->GetAttachedWindow() : static_cast<gfx::NativeWindow>(NULL);\n}\n\nui::TextInputType InputMethodBridge::GetTextInputType() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextInputType() : ui::TEXT_INPUT_TYPE_NONE;\n}\n\nui::TextInputMode InputMethodBridge::GetTextInputMode() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextInputMode() : ui::TEXT_INPUT_MODE_DEFAULT;\n}\n\nbool InputMethodBridge::CanComposeInline() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->CanComposeInline() : true;\n}\n\ngfx::Rect InputMethodBridge::GetCaretBounds() const {\n TextInputClient* client = GetTextInputClient();\n if (!client)\n return gfx::Rect();\n\n return client->GetCaretBounds();\n}\n\nbool InputMethodBridge::GetCompositionCharacterBounds(uint32 index,\n gfx::Rect* rect) const {\n DCHECK(rect);\n TextInputClient* client = GetTextInputClient();\n if (!client)\n return false;\n\n return client->GetCompositionCharacterBounds(index, rect);\n}\n\nbool InputMethodBridge::HasCompositionText() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->HasCompositionText() : false;\n}\n\nbool InputMethodBridge::GetTextRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetCompositionTextRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetCompositionTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetSelectionRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::SetSelectionRange(const gfx::Range& range) {\n TextInputClient* client = GetTextInputClient();\n return client ? client->SetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::DeleteRange(const gfx::Range& range) {\n TextInputClient* client = GetTextInputClient();\n return client ? client->DeleteRange(range) : false;\n}\n\nbool InputMethodBridge::GetTextFromRange(const gfx::Range& range,\n string16* text) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextFromRange(range, text) : false;\n}\n\nvoid InputMethodBridge::OnInputMethodChanged() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->OnInputMethodChanged();\n}\n\nbool InputMethodBridge::ChangeTextDirectionAndLayoutAlignment(\n base::i18n::TextDirection direction) {\n TextInputClient* client = GetTextInputClient();\n return client ?\n client->ChangeTextDirectionAndLayoutAlignment(direction) : false;\n}\n\nvoid InputMethodBridge::ExtendSelectionAndDelete(size_t before, size_t after) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ExtendSelectionAndDelete(before, after);\n}\n\nvoid InputMethodBridge::EnsureCaretInRect(const gfx::Rect& rect) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->EnsureCaretInRect(rect);\n}\n\nvoid InputMethodBridge::OnCandidateWindowShown() {\n}\n\nvoid InputMethodBridge::OnCandidateWindowUpdated() {\n}\n\nvoid InputMethodBridge::OnCandidateWindowHidden() {\n}\n\n\/\/ Overridden from FocusChangeListener.\nvoid InputMethodBridge::OnWillChangeFocus(View* focused_before, View* focused) {\n if (HasCompositionText()) {\n ConfirmCompositionText();\n CancelComposition(focused_before);\n }\n}\n\nvoid InputMethodBridge::OnDidChangeFocus(View* focused_before, View* focused) {\n DCHECK_EQ(GetFocusedView(), focused);\n OnTextInputTypeChanged(focused);\n OnCaretBoundsChanged(focused);\n}\n\nui::InputMethod* InputMethodBridge::GetHostInputMethod() const {\n return host_;\n}\n\n\n} \/\/ namespace views\n<commit_msg>Call OnCaretBoundsChanged in InputMethodBridge::OnFocus<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/ime\/input_method_bridge.h\"\n\n#include \"ui\/base\/ime\/input_method.h\"\n#include \"ui\/base\/ime\/input_method_observer.h\"\n#include \"ui\/events\/event.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/views\/view.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nnamespace views {\n\n\/\/ InputMethodBridge::HostObserver class ---------------------------------------\n\n\/\/ An observer class for observing the host input method. When the host input\n\/\/ method is destroyed, it will null out the |host_| field on the\n\/\/ InputMethodBridge object.\nclass InputMethodBridge::HostObserver : public ui::InputMethodObserver {\n public:\n explicit HostObserver(InputMethodBridge* bridge);\n virtual ~HostObserver();\n\n virtual void OnTextInputTypeChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnFocus() OVERRIDE {}\n virtual void OnBlur() OVERRIDE {}\n virtual void OnCaretBoundsChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnTextInputStateChanged(\n const ui::TextInputClient* client) OVERRIDE {}\n virtual void OnInputMethodDestroyed(\n const ui::InputMethod* input_method) OVERRIDE;\n\n private:\n InputMethodBridge* bridge_;\n\n DISALLOW_COPY_AND_ASSIGN(HostObserver);\n};\n\nInputMethodBridge::HostObserver::HostObserver(InputMethodBridge* bridge)\n : bridge_(bridge) {\n bridge_->host_->AddObserver(this);\n}\n\nInputMethodBridge::HostObserver::~HostObserver() {\n if (bridge_->host_)\n bridge_->host_->RemoveObserver(this);\n}\n\nvoid InputMethodBridge::HostObserver::OnInputMethodDestroyed(\n const ui::InputMethod* input_method) {\n DCHECK_EQ(bridge_->host_, input_method);\n bridge_->host_->RemoveObserver(this);\n bridge_->host_ = NULL;\n}\n\n\/\/ InputMethodBridge class -----------------------------------------------------\n\nInputMethodBridge::InputMethodBridge(internal::InputMethodDelegate* delegate,\n ui::InputMethod* host,\n bool shared_input_method)\n : host_(host),\n shared_input_method_(shared_input_method) {\n DCHECK(host_);\n SetDelegate(delegate);\n\n host_observer_.reset(new HostObserver(this));\n}\n\nInputMethodBridge::~InputMethodBridge() {\n \/\/ By the time we get here it's very likely |widget_|'s NativeWidget has been\n \/\/ destroyed. This means any calls to |widget_| that go to the NativeWidget,\n \/\/ such as IsActive(), will crash. SetFocusedTextInputClient() may callback to\n \/\/ this and go into |widget_|. NULL out |widget_| so we don't attempt to use\n \/\/ it.\n DetachFromWidget();\n\n \/\/ Host input method might have been destroyed at this point.\n if (host_)\n host_->DetachTextInputClient(this);\n}\n\nvoid InputMethodBridge::OnFocus() {\n DCHECK(host_);\n\n \/\/ Direct the shared IME to send TextInputClient messages to |this| object.\n if (shared_input_method_ || !host_->GetTextInputClient())\n host_->SetFocusedTextInputClient(this);\n\n \/\/ TODO(yusukes): We don't need to call OnTextInputTypeChanged() once we move\n \/\/ text input type tracker code to ui::InputMethodBase.\n if (GetFocusedView()) {\n OnTextInputTypeChanged(GetFocusedView());\n OnCaretBoundsChanged(GetFocusedView());\n }\n}\n\nvoid InputMethodBridge::OnBlur() {\n DCHECK(host_);\n\n if (HasCompositionText()) {\n ConfirmCompositionText();\n host_->CancelComposition(this);\n }\n\n if (host_->GetTextInputClient() == this)\n host_->SetFocusedTextInputClient(NULL);\n}\n\nbool InputMethodBridge::OnUntranslatedIMEMessage(const base::NativeEvent& event,\n NativeEventResult* result) {\n DCHECK(host_);\n\n return host_->OnUntranslatedIMEMessage(event, result);\n}\n\nvoid InputMethodBridge::DispatchKeyEvent(const ui::KeyEvent& key) {\n DCHECK(key.type() == ui::ET_KEY_PRESSED || key.type() == ui::ET_KEY_RELEASED);\n\n \/\/ We can just dispatch the event here since the |key| is already processed by\n \/\/ the system-wide IME.\n DispatchKeyEventPostIME(key);\n}\n\nvoid InputMethodBridge::OnTextInputTypeChanged(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view))\n host_->OnTextInputTypeChanged(this);\n InputMethodBase::OnTextInputTypeChanged(view);\n}\n\nvoid InputMethodBridge::OnCaretBoundsChanged(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view) && !IsTextInputTypeNone())\n host_->OnCaretBoundsChanged(this);\n}\n\nvoid InputMethodBridge::CancelComposition(View* view) {\n DCHECK(host_);\n\n if (IsViewFocused(view))\n host_->CancelComposition(this);\n}\n\nvoid InputMethodBridge::OnInputLocaleChanged() {\n DCHECK(host_);\n\n host_->OnInputLocaleChanged();\n}\n\nstd::string InputMethodBridge::GetInputLocale() {\n DCHECK(host_);\n\n return host_->GetInputLocale();\n}\n\nbase::i18n::TextDirection InputMethodBridge::GetInputTextDirection() {\n DCHECK(host_);\n\n return host_->GetInputTextDirection();\n}\n\nbool InputMethodBridge::IsActive() {\n DCHECK(host_);\n\n return host_->IsActive();\n}\n\nbool InputMethodBridge::IsCandidatePopupOpen() const {\n DCHECK(host_);\n\n return host_->IsCandidatePopupOpen();\n}\n\n\/\/ Overridden from TextInputClient. Forward an event from the system-wide IME\n\/\/ to the text input |client|, which is e.g. views::NativeTextfieldViews.\nvoid InputMethodBridge::SetCompositionText(\n const ui::CompositionText& composition) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->SetCompositionText(composition);\n}\n\nvoid InputMethodBridge::ConfirmCompositionText() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ConfirmCompositionText();\n}\n\nvoid InputMethodBridge::ClearCompositionText() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ClearCompositionText();\n}\n\nvoid InputMethodBridge::InsertText(const string16& text) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->InsertText(text);\n}\n\nvoid InputMethodBridge::InsertChar(char16 ch, int flags) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->InsertChar(ch, flags);\n}\n\ngfx::NativeWindow InputMethodBridge::GetAttachedWindow() const {\n TextInputClient* client = GetTextInputClient();\n return client ?\n client->GetAttachedWindow() : static_cast<gfx::NativeWindow>(NULL);\n}\n\nui::TextInputType InputMethodBridge::GetTextInputType() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextInputType() : ui::TEXT_INPUT_TYPE_NONE;\n}\n\nui::TextInputMode InputMethodBridge::GetTextInputMode() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextInputMode() : ui::TEXT_INPUT_MODE_DEFAULT;\n}\n\nbool InputMethodBridge::CanComposeInline() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->CanComposeInline() : true;\n}\n\ngfx::Rect InputMethodBridge::GetCaretBounds() const {\n TextInputClient* client = GetTextInputClient();\n if (!client)\n return gfx::Rect();\n\n return client->GetCaretBounds();\n}\n\nbool InputMethodBridge::GetCompositionCharacterBounds(uint32 index,\n gfx::Rect* rect) const {\n DCHECK(rect);\n TextInputClient* client = GetTextInputClient();\n if (!client)\n return false;\n\n return client->GetCompositionCharacterBounds(index, rect);\n}\n\nbool InputMethodBridge::HasCompositionText() const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->HasCompositionText() : false;\n}\n\nbool InputMethodBridge::GetTextRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetCompositionTextRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetCompositionTextRange(range) : false;\n}\n\nbool InputMethodBridge::GetSelectionRange(gfx::Range* range) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::SetSelectionRange(const gfx::Range& range) {\n TextInputClient* client = GetTextInputClient();\n return client ? client->SetSelectionRange(range) : false;\n}\n\nbool InputMethodBridge::DeleteRange(const gfx::Range& range) {\n TextInputClient* client = GetTextInputClient();\n return client ? client->DeleteRange(range) : false;\n}\n\nbool InputMethodBridge::GetTextFromRange(const gfx::Range& range,\n string16* text) const {\n TextInputClient* client = GetTextInputClient();\n return client ? client->GetTextFromRange(range, text) : false;\n}\n\nvoid InputMethodBridge::OnInputMethodChanged() {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->OnInputMethodChanged();\n}\n\nbool InputMethodBridge::ChangeTextDirectionAndLayoutAlignment(\n base::i18n::TextDirection direction) {\n TextInputClient* client = GetTextInputClient();\n return client ?\n client->ChangeTextDirectionAndLayoutAlignment(direction) : false;\n}\n\nvoid InputMethodBridge::ExtendSelectionAndDelete(size_t before, size_t after) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->ExtendSelectionAndDelete(before, after);\n}\n\nvoid InputMethodBridge::EnsureCaretInRect(const gfx::Rect& rect) {\n TextInputClient* client = GetTextInputClient();\n if (client)\n client->EnsureCaretInRect(rect);\n}\n\nvoid InputMethodBridge::OnCandidateWindowShown() {\n}\n\nvoid InputMethodBridge::OnCandidateWindowUpdated() {\n}\n\nvoid InputMethodBridge::OnCandidateWindowHidden() {\n}\n\n\/\/ Overridden from FocusChangeListener.\nvoid InputMethodBridge::OnWillChangeFocus(View* focused_before, View* focused) {\n if (HasCompositionText()) {\n ConfirmCompositionText();\n CancelComposition(focused_before);\n }\n}\n\nvoid InputMethodBridge::OnDidChangeFocus(View* focused_before, View* focused) {\n DCHECK_EQ(GetFocusedView(), focused);\n OnTextInputTypeChanged(focused);\n OnCaretBoundsChanged(focused);\n}\n\nui::InputMethod* InputMethodBridge::GetHostInputMethod() const {\n return host_;\n}\n\n\n} \/\/ namespace views\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"main.hh\"\n#include \"strings.hh\"\n#include <string.h>\n#include <algorithm>\n\n#include <glib.h>\n\nnamespace Rapicorn {\n\n\/\/ === initialization hooks ===\nstatic InitHook *init_hooks = NULL;\n\nInitHook::InitHook (const String &fname, InitHookFunc func) :\n next (NULL), hook (func), m_name (fname)\n{\n next = init_hooks;\n init_hooks = this;\n}\n\nstatic int\ninit_hook_cmp (const InitHook *const &v1, const InitHook *const &v2)\n{\n static const char *levels[] = { \"core\/\", \"threading\/\", \"ui\/\" };\n uint l1 = UINT_MAX, l2 = UINT_MAX;\n for (uint i = 0; i < RAPICORN_ARRAY_SIZE (levels); i++)\n {\n const uint len = strlen (levels[i]);\n if (l1 == UINT_MAX && strncmp (levels[i], v1->name().c_str(), len) == 0)\n {\n l1 = i;\n if (l2 != UINT_MAX)\n break;\n }\n if (l2 == UINT_MAX && strncmp (levels[i], v2->name().c_str(), len) == 0)\n {\n l2 = i;\n if (l1 != UINT_MAX)\n break;\n }\n }\n if (l1 != l2)\n return l1 < l2 ? -1 : l2 > l1;\n return strverscmp (v1->name().c_str(), v2->name().c_str()) < 0;\n}\n\nstatic StringVector *init_hook_main_args = NULL;\n\nStringVector\nInitHook::main_args () const\n{\n return *init_hook_main_args;\n}\n\nvoid\nInitHook::invoke_hooks (const String &kind, int *argcp, char **argv, const StringVector &args)\n{\n std::vector<InitHook*> hv;\n for (InitHook *ihook = init_hooks; ihook; ihook = ihook->next)\n hv.push_back (ihook);\n stable_sort (hv.begin(), hv.end(), init_hook_cmp);\n StringVector main_args;\n for (uint i = 1; i < uint (*argcp); i++)\n main_args.push_back (argv[i]);\n init_hook_main_args = &main_args;\n for (std::vector<InitHook*>::iterator it = hv.begin(); it != hv.end(); it++)\n {\n String name = (*it)->name();\n if (name.size() > kind.size() && strncmp (name.data(), kind.data(), kind.size()) == 0)\n {\n RAPICORN_DEBUG (\"InitHook: %s\", name.c_str());\n (*it)->hook (args);\n }\n }\n init_hook_main_args = NULL;\n}\n\n\/\/ === arg parsers ===\n\/**\n * Try to parse argument @a arg at position @a i in @a argv.\n * If successfull, @a i is incremented and the argument\n * is set to NULL.\n * @returns true if successfull.\n *\/\nbool\narg_parse_option (uint argc,\n char **argv,\n size_t *i,\n const char *arg)\n{\n if (strcmp (argv[*i], arg) == 0)\n {\n argv[*i] = NULL;\n return true;\n }\n return false;\n}\n\n\/**\n * Try to parse argument @a arg at position @a i in @a argv.\n * If successfull, @a i is incremented and the argument and possibly\n * the next option argument are set to NULL.\n * @returns true if successfull and the string option in @a strp.\n *\/\nbool\narg_parse_string_option (uint argc,\n char **argv,\n size_t *i,\n const char *arg,\n const char **strp)\n{\n const size_t length = strlen (arg);\n if (strncmp (argv[*i], arg, length) == 0)\n {\n const char *equal = argv[*i] + length;\n if (*equal == '=') \/\/ -x=VAL\n *strp = equal + 1;\n else if (*equal) \/\/ -xVAL\n *strp = equal;\n else if (*i + 1 < argc) \/\/ -x VAL\n {\n argv[(*i)++] = NULL;\n *strp = argv[*i];\n }\n else\n *strp = NULL;\n argv[*i] = NULL;\n if (*strp)\n return true;\n }\n return false;\n}\n\n\/**\n * Collapse @a argv by eliminating NULL strings.\n * @returns Number of collapsed arguments.\n *\/\nint\narg_parse_collapse (int *argcp,\n char **argv)\n{\n \/\/ collapse args\n const uint argc = *argcp;\n uint e = 1;\n for (uint i = 1; i < argc; i++)\n if (argv[i])\n {\n argv[e++] = argv[i];\n if (i >= e)\n argv[i] = NULL;\n }\n const int collapsed = *argcp - e;\n *argcp = e;\n return collapsed;\n}\n\nstatic bool\nparse_bool_option (const String &s, const char *arg, bool *boolp)\n{\n const size_t length = strlen (arg);\n if (s.size() > length && s[length] == '=' && strncmp (&s[0], arg, length) == 0)\n {\n *boolp = string_to_bool (s.substr (length + 1));\n return true;\n }\n return false;\n}\n\n\/\/ === initialization ===\nstruct VInitSettings : InitSettings {\n bool& autonomous() { return m_autonomous; }\n uint& test_codes() { return m_test_codes; }\n VInitSettings() { m_autonomous = false; m_test_codes = 0; }\n} static vsettings;\nstatic VInitSettings vinit_settings;\nconst InitSettings *InitSettings::sis = &vinit_settings;\n\nstatic void\nparse_settings_and_args (VInitSettings &vsettings,\n const StringVector &args,\n int *argcp,\n char **argv)\n{\n bool b = 0, pta = false;\n \/\/ apply init settings\n for (StringVector::const_iterator it = args.begin(); it != args.end(); it++)\n if (parse_bool_option (*it, \"autonomous\", &b))\n vsettings.autonomous() = b;\n else if (parse_bool_option (*it, \"parse-testargs\", &b))\n pta = b;\n else if (parse_bool_option (*it, \"test-verbose\", &b))\n vsettings.test_codes() |= 0x1;\n else if (parse_bool_option (*it, \"test-log\", &b))\n vsettings.test_codes() |= 0x2;\n else if (parse_bool_option (*it, \"test-slow\", &b))\n vsettings.test_codes() |= 0x4;\n \/\/ parse command line args\n const size_t argc = *argcp;\n for (size_t i = 1; i < argc; i++)\n {\n if ( arg_parse_option (*argcp, argv, &i, \"--g-fatal-warnings\"))\n {\n const uint fatal_mask = g_log_set_always_fatal (GLogLevelFlags (G_LOG_FATAL_MASK));\n g_log_set_always_fatal (GLogLevelFlags (fatal_mask | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_CRITICAL));\n }\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-verbose\"))\n vsettings.test_codes() |= 0x1;\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-log\"))\n vsettings.test_codes() |= 0x2;\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-slow\"))\n vsettings.test_codes() |= 0x4;\n else if (pta && strcmp (\"--verbose\", argv[i]) == 0)\n {\n vsettings.test_codes() |= 0x1;\n \/* interpret --verbose for GLib compat but don't delete the argument\n * since regular non-test programs may need this. could be fixed by\n * having a separate test program argument parser.\n *\/\n }\n }\n \/\/ collapse NULL arguments\n arg_parse_collapse (argcp, argv);\n}\n\nstatic String program_argv0 = \"\";\nstatic String program_app_ident = \"\";\nstatic String program_cwd0 = \"\";\n\n\/**\n * File name of the current process as set in argv[0] at startup.\n *\/\nString\nprogram_file ()\n{\n return program_argv0;\n}\n\n\/**\n * The program identifier @a app_ident as specified during initialization of Rapicorn.\n *\/\nString\nprogram_ident ()\n{\n return program_app_ident;\n}\n\n\/**\n * The current working directory during startup.\n *\/\nString\nprogram_cwd ()\n{\n return program_cwd0;\n}\n\nstatic struct __StaticCTorTest { int v; __StaticCTorTest() : v (0x12affe16) { v++; } } __staticctortest;\n\n\/**\n * @param app_ident Application identifier, needed to associate persistent resources\n * @param argcp location of the 'argc' argument to main()\n * @param argv location of the 'argv' arguments to main()\n * @param args program specific initialization values\n *\n * Initialize the Rapicorn toolkit, including threading, CPU detection, loading resource libraries, etc.\n * The arguments passed in @a argcp and @a argv are parsed and any Rapicorn specific arguments\n * are stripped.\n * Supported command line arguments are:\n * - @c --test-verbose - execute test cases verbosely.\n * - @c --test-log - execute logtest test cases.\n * - @c --test-slow - execute slow test cases.\n * - @c --verbose - behaves like @c --test-verbose, this option is recognized but not stripped.\n * .\n * Additional initialization arguments can be passed in @a args, currently supported are:\n * - @c autonomous - For test programs to request a self-contained runtime environment.\n * - @c cpu-affinity - CPU# to bind rapicorn thread to.\n * - @c parse-testargs - Used by init_core_test() internally.\n * - @c test-verbose - acts like --test-verbose.\n * - @c test-log - acts like --test-log.\n * - @c test-slow - acts like --test-slow.\n * .\n * Additionally, the @c $RAPICORN environment variable affects toolkit behaviour. It supports\n * multiple colon (':') separated options (options can be prfixed with 'no-' to disable):\n * - @c debug - Enables verbose debugging output (default=off).\n * - @c fatal-syslog - Fatal program conditions that lead to aborting are recorded via syslog (default=on).\n * - @c syslog - Critical and warning conditions are recorded via syslog (default=off).\n * - @c fatal-warnings - Critical and warning conditions are treated as fatal conditions (default=off).\n * - @c logfile=FILENAME - Record all messages and conditions into FILENAME.\n * .\n *\/\nvoid\ninit_core (const String &app_ident,\n int *argcp,\n char **argv,\n const StringVector &args)\n{\n return_if_fail (app_ident.empty() == false);\n \/\/ assert global_ctors work\n if (__staticctortest.v != 0x12affe17)\n fatal (\"librapicorncore: link error: C++ constructors have not been executed\");\n\n \/\/ guard against double initialization\n if (program_app_ident.empty() == false)\n fatal (\"librapicorncore: multiple calls to Rapicorn::init_app()\");\n program_app_ident = app_ident;\n\n \/\/ mandatory threading initialization\n if (!g_threads_got_initialized)\n g_thread_init (NULL);\n\n \/\/ setup program and application name\n if (program_argv0.empty() && argcp && *argcp && argv && argv[0] && argv[0][0] != 0)\n program_argv0 = argv[0];\n if (program_cwd0.empty())\n program_cwd0 = Path::cwd();\n if (!g_get_prgname() && !program_argv0.empty())\n g_set_prgname (Path::basename (program_argv0).c_str());\n if (!g_get_application_name() || g_get_application_name() == g_get_prgname())\n g_set_application_name (program_app_ident.c_str());\n\n \/\/ ensure logging works correctly\n const char *env_rapicorn = getenv (\"RAPICORN\");\n Logging::configure (env_rapicorn ? env_rapicorn : \"\");\n RAPICORN_DEBUG (\"startup; RAPICORN=%s\", env_rapicorn ? env_rapicorn : \"\");\n\n \/\/ setup init settings\n parse_settings_and_args (vinit_settings, args, argcp, argv);\n\n \/\/ initialize sub systems\n struct InitHookCaller : public InitHook {\n static void invoke (const String &kind, int *argcp, char **argv, const StringVector &args)\n { invoke_hooks (kind, argcp, argv, args); }\n };\n InitHookCaller::invoke (\"core\/\", argcp, argv, args);\n InitHookCaller::invoke (\"threading\/\", argcp, argv, args);\n}\n\n} \/\/ Rapicorn\n<commit_msg>RCORE: docu fixup<commit_after>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"main.hh\"\n#include \"strings.hh\"\n#include <string.h>\n#include <algorithm>\n\n#include <glib.h>\n\nnamespace Rapicorn {\n\n\/\/ === initialization hooks ===\nstatic InitHook *init_hooks = NULL;\n\nInitHook::InitHook (const String &fname, InitHookFunc func) :\n next (NULL), hook (func), m_name (fname)\n{\n next = init_hooks;\n init_hooks = this;\n}\n\nstatic int\ninit_hook_cmp (const InitHook *const &v1, const InitHook *const &v2)\n{\n static const char *levels[] = { \"core\/\", \"threading\/\", \"ui\/\" };\n uint l1 = UINT_MAX, l2 = UINT_MAX;\n for (uint i = 0; i < RAPICORN_ARRAY_SIZE (levels); i++)\n {\n const uint len = strlen (levels[i]);\n if (l1 == UINT_MAX && strncmp (levels[i], v1->name().c_str(), len) == 0)\n {\n l1 = i;\n if (l2 != UINT_MAX)\n break;\n }\n if (l2 == UINT_MAX && strncmp (levels[i], v2->name().c_str(), len) == 0)\n {\n l2 = i;\n if (l1 != UINT_MAX)\n break;\n }\n }\n if (l1 != l2)\n return l1 < l2 ? -1 : l2 > l1;\n return strverscmp (v1->name().c_str(), v2->name().c_str()) < 0;\n}\n\nstatic StringVector *init_hook_main_args = NULL;\n\nStringVector\nInitHook::main_args () const\n{\n return *init_hook_main_args;\n}\n\nvoid\nInitHook::invoke_hooks (const String &kind, int *argcp, char **argv, const StringVector &args)\n{\n std::vector<InitHook*> hv;\n for (InitHook *ihook = init_hooks; ihook; ihook = ihook->next)\n hv.push_back (ihook);\n stable_sort (hv.begin(), hv.end(), init_hook_cmp);\n StringVector main_args;\n for (uint i = 1; i < uint (*argcp); i++)\n main_args.push_back (argv[i]);\n init_hook_main_args = &main_args;\n for (std::vector<InitHook*>::iterator it = hv.begin(); it != hv.end(); it++)\n {\n String name = (*it)->name();\n if (name.size() > kind.size() && strncmp (name.data(), kind.data(), kind.size()) == 0)\n {\n RAPICORN_DEBUG (\"InitHook: %s\", name.c_str());\n (*it)->hook (args);\n }\n }\n init_hook_main_args = NULL;\n}\n\n\/\/ === arg parsers ===\n\/**\n * Try to parse argument @a arg at position @a i in @a argv.\n * If successfull, @a i is incremented and the argument\n * is set to NULL.\n * @returns true if successfull.\n *\/\nbool\narg_parse_option (uint argc,\n char **argv,\n size_t *i,\n const char *arg)\n{\n if (strcmp (argv[*i], arg) == 0)\n {\n argv[*i] = NULL;\n return true;\n }\n return false;\n}\n\n\/**\n * Try to parse argument @a arg at position @a i in @a argv.\n * If successfull, @a i is incremented and the argument and possibly\n * the next option argument are set to NULL.\n * @returns true if successfull and the string option in @a strp.\n *\/\nbool\narg_parse_string_option (uint argc,\n char **argv,\n size_t *i,\n const char *arg,\n const char **strp)\n{\n const size_t length = strlen (arg);\n if (strncmp (argv[*i], arg, length) == 0)\n {\n const char *equal = argv[*i] + length;\n if (*equal == '=') \/\/ -x=VAL\n *strp = equal + 1;\n else if (*equal) \/\/ -xVAL\n *strp = equal;\n else if (*i + 1 < argc) \/\/ -x VAL\n {\n argv[(*i)++] = NULL;\n *strp = argv[*i];\n }\n else\n *strp = NULL;\n argv[*i] = NULL;\n if (*strp)\n return true;\n }\n return false;\n}\n\n\/**\n * Collapse @a argv by eliminating NULL strings.\n * @returns Number of collapsed arguments.\n *\/\nint\narg_parse_collapse (int *argcp,\n char **argv)\n{\n \/\/ collapse args\n const uint argc = *argcp;\n uint e = 1;\n for (uint i = 1; i < argc; i++)\n if (argv[i])\n {\n argv[e++] = argv[i];\n if (i >= e)\n argv[i] = NULL;\n }\n const int collapsed = *argcp - e;\n *argcp = e;\n return collapsed;\n}\n\nstatic bool\nparse_bool_option (const String &s, const char *arg, bool *boolp)\n{\n const size_t length = strlen (arg);\n if (s.size() > length && s[length] == '=' && strncmp (&s[0], arg, length) == 0)\n {\n *boolp = string_to_bool (s.substr (length + 1));\n return true;\n }\n return false;\n}\n\n\/\/ === initialization ===\nstruct VInitSettings : InitSettings {\n bool& autonomous() { return m_autonomous; }\n uint& test_codes() { return m_test_codes; }\n VInitSettings() { m_autonomous = false; m_test_codes = 0; }\n} static vsettings;\nstatic VInitSettings vinit_settings;\nconst InitSettings *InitSettings::sis = &vinit_settings;\n\nstatic void\nparse_settings_and_args (VInitSettings &vsettings,\n const StringVector &args,\n int *argcp,\n char **argv)\n{\n bool b = 0, pta = false;\n \/\/ apply init settings\n for (StringVector::const_iterator it = args.begin(); it != args.end(); it++)\n if (parse_bool_option (*it, \"autonomous\", &b))\n vsettings.autonomous() = b;\n else if (parse_bool_option (*it, \"parse-testargs\", &b))\n pta = b;\n else if (parse_bool_option (*it, \"test-verbose\", &b))\n vsettings.test_codes() |= 0x1;\n else if (parse_bool_option (*it, \"test-log\", &b))\n vsettings.test_codes() |= 0x2;\n else if (parse_bool_option (*it, \"test-slow\", &b))\n vsettings.test_codes() |= 0x4;\n \/\/ parse command line args\n const size_t argc = *argcp;\n for (size_t i = 1; i < argc; i++)\n {\n if ( arg_parse_option (*argcp, argv, &i, \"--g-fatal-warnings\"))\n {\n const uint fatal_mask = g_log_set_always_fatal (GLogLevelFlags (G_LOG_FATAL_MASK));\n g_log_set_always_fatal (GLogLevelFlags (fatal_mask | G_LOG_LEVEL_WARNING | G_LOG_LEVEL_CRITICAL));\n }\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-verbose\"))\n vsettings.test_codes() |= 0x1;\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-log\"))\n vsettings.test_codes() |= 0x2;\n else if (pta && arg_parse_option (*argcp, argv, &i, \"--test-slow\"))\n vsettings.test_codes() |= 0x4;\n else if (pta && strcmp (\"--verbose\", argv[i]) == 0)\n {\n vsettings.test_codes() |= 0x1;\n \/* interpret --verbose for GLib compat but don't delete the argument\n * since regular non-test programs may need this. could be fixed by\n * having a separate test program argument parser.\n *\/\n }\n }\n \/\/ collapse NULL arguments\n arg_parse_collapse (argcp, argv);\n}\n\nstatic String program_argv0 = \"\";\nstatic String program_app_ident = \"\";\nstatic String program_cwd0 = \"\";\n\n\/**\n * File name of the current process as set in argv[0] at startup.\n *\/\nString\nprogram_file ()\n{\n return program_argv0;\n}\n\n\/**\n * The program identifier @a app_ident as specified during initialization of Rapicorn.\n *\/\nString\nprogram_ident ()\n{\n return program_app_ident;\n}\n\n\/**\n * The current working directory during startup.\n *\/\nString\nprogram_cwd ()\n{\n return program_cwd0;\n}\n\nstatic struct __StaticCTorTest { int v; __StaticCTorTest() : v (0x12affe16) { v++; } } __staticctortest;\n\n\/**\n * @param app_ident Application identifier, used to associate persistent resources\n * @param argcp location of the 'argc' argument to main()\n * @param argv location of the 'argv' arguments to main()\n * @param args program specific initialization values\n *\n * Initialize the Rapicorn toolkit, including threading, CPU detection, loading resource libraries, etc.\n * The arguments passed in @a argcp and @a argv are parsed and any Rapicorn specific arguments\n * are stripped.\n * Supported command line arguments are:\n * - @c --test-verbose - execute test cases verbosely.\n * - @c --test-log - execute logtest test cases.\n * - @c --test-slow - execute slow test cases.\n * - @c --verbose - behaves like @c --test-verbose, this option is recognized but not stripped.\n * .\n * Additional initialization arguments can be passed in @a args, currently supported are:\n * - @c autonomous - For test programs to request a self-contained runtime environment.\n * - @c cpu-affinity - CPU# to bind rapicorn thread to.\n * - @c parse-testargs - Used by init_core_test() internally.\n * - @c test-verbose - acts like --test-verbose.\n * - @c test-log - acts like --test-log.\n * - @c test-slow - acts like --test-slow.\n * .\n * Additionally, the @c $RAPICORN environment variable affects toolkit behaviour. It supports\n * multiple colon (':') separated options (options can be prfixed with 'no-' to disable):\n * - @c debug - Enables verbose debugging output (default=off).\n * - @c fatal-syslog - Fatal program conditions that lead to aborting are recorded via syslog (default=on).\n * - @c syslog - Critical and warning conditions are recorded via syslog (default=off).\n * - @c fatal-warnings - Critical and warning conditions are treated as fatal conditions (default=off).\n * - @c logfile=FILENAME - Record all messages and conditions into FILENAME.\n * .\n *\/\nvoid\ninit_core (const String &app_ident,\n int *argcp,\n char **argv,\n const StringVector &args)\n{\n return_if_fail (app_ident.empty() == false);\n \/\/ assert global_ctors work\n if (__staticctortest.v != 0x12affe17)\n fatal (\"librapicorncore: link error: C++ constructors have not been executed\");\n\n \/\/ guard against double initialization\n if (program_app_ident.empty() == false)\n fatal (\"librapicorncore: multiple calls to Rapicorn::init_app()\");\n program_app_ident = app_ident;\n\n \/\/ mandatory threading initialization\n if (!g_threads_got_initialized)\n g_thread_init (NULL);\n\n \/\/ setup program and application name\n if (program_argv0.empty() && argcp && *argcp && argv && argv[0] && argv[0][0] != 0)\n program_argv0 = argv[0];\n if (program_cwd0.empty())\n program_cwd0 = Path::cwd();\n if (!g_get_prgname() && !program_argv0.empty())\n g_set_prgname (Path::basename (program_argv0).c_str());\n if (!g_get_application_name() || g_get_application_name() == g_get_prgname())\n g_set_application_name (program_app_ident.c_str());\n\n \/\/ ensure logging works correctly\n const char *env_rapicorn = getenv (\"RAPICORN\");\n Logging::configure (env_rapicorn ? env_rapicorn : \"\");\n RAPICORN_DEBUG (\"startup; RAPICORN=%s\", env_rapicorn ? env_rapicorn : \"\");\n\n \/\/ setup init settings\n parse_settings_and_args (vinit_settings, args, argcp, argv);\n\n \/\/ initialize sub systems\n struct InitHookCaller : public InitHook {\n static void invoke (const String &kind, int *argcp, char **argv, const StringVector &args)\n { invoke_hooks (kind, argcp, argv, args); }\n };\n InitHookCaller::invoke (\"core\/\", argcp, argv, args);\n InitHookCaller::invoke (\"threading\/\", argcp, argv, args);\n}\n\n} \/\/ Rapicorn\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ ASTThirdLevelExpressionNode.cpp\n\/\/ lut-lang\n\/\/\n\/\/ Created by Robin Ricard on 22\/03\/15.\n\/\/ Copyright (c) 2015 INSA Lyon. All rights reserved.\n\/\/\n\n#include \"ASTThirdLevelExpressionNode.h\"\n\n#include <tuple>\n#include <iostream>\n#include <utility>\n#include <string>\n#include <sstream>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::pair;\nusing std::stringstream;\n\nASTThirdLevelExpressionNode::ASTThirdLevelExpressionNode(ASTTokenNode* identifierOrValue,\n TokenType type) : ASTNode(type) {\n this->identifierOrValue = identifierOrValue;\n this->expression = NULL;\n}\n\nASTThirdLevelExpressionNode::ASTThirdLevelExpressionNode(ASTFirstLevelExpressionNode* expression,\n TokenType type) : ASTNode(type) {\n this->identifierOrValue = NULL;\n this->expression = expression;\n}\n\nASTTokenNode* ASTThirdLevelExpressionNode::getIdentifierOrValue() {\n return this->identifierOrValue;\n}\n\nASTFirstLevelExpressionNode* ASTThirdLevelExpressionNode::getExpression() {\n return this->expression;\n}\n\nbool ASTThirdLevelExpressionNode::analyze(analyze_table* table) {\n if (expression != NULL && !expression->analyze(table)) {\n return false;\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID &&\n (table->count(this->identifierOrValue->getValue()) < 1 ||\n !std::get<0>((*table)[this->identifierOrValue->getValue()]))) {\n cerr << \"variable non affectee : \" << this->identifierOrValue->getValue() << endl;\n return false;\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID) {\n bool isConst = std::get<1>((*table)[this->identifierOrValue->getValue()]);\n (*table)[this->identifierOrValue->getValue()] = std::make_tuple(true, isConst, true);\n }\n return true;\n}\n\nint64_t ASTThirdLevelExpressionNode::exec(exec_table* table) {\n if (this->identifierOrValue != NULL) {\n if (this->identifierOrValue->getTokenType() == TokenType::ID &&\n table->count(this->identifierOrValue->getValue()) > 0) {\n return std::get<0>((*table)[this->identifierOrValue->getValue()]);\n } else if (this->identifierOrValue->getTokenType() == TokenType::ID) {\n throw std::logic_error(\"does not exist\");\n } else {\n stringstream ss;\n ss << this->identifierOrValue->getValue();\n int64_t value;\n ss >> value;\n return value;\n }\n } else {\n return expression->exec(table);\n }\n}\n\nvoid ASTThirdLevelExpressionNode::print() {\n if (this->identifierOrValue != NULL) {\n this->identifierOrValue->print();\n } else {\n cout << \"(\";\n this->expression->print();\n cout << \")\";\n }\n}\n\nvoid ASTThirdLevelExpressionNode::transform(exec_table* table) {\n if (this->expression != NULL) {\n this->expression->transform(table);\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID &&\n table->count(this->identifierOrValue->getValue()) > 0) {\n std::tuple<int64_t, bool> constTerm = (*table)[this->identifierOrValue->getValue()];\n if (std::get<1>(constTerm)) {\n stringstream ss;\n ss << std::get<0>(constTerm);\n string val = ss.str();\n this->identifierOrValue = new ASTTokenNode(TokenType::VAL, val);\n }\n }\n}\n<commit_msg>Fix Circle<commit_after>\/\/\n\/\/ ASTThirdLevelExpressionNode.cpp\n\/\/ lut-lang\n\/\/\n\/\/ Created by Robin Ricard on 22\/03\/15.\n\/\/ Copyright (c) 2015 INSA Lyon. All rights reserved.\n\/\/\n\n#include \"ASTThirdLevelExpressionNode.h\"\n\n#include <tuple>\n#include <iostream>\n#include <utility>\n#include <string>\n#include <sstream>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::pair;\nusing std::stringstream;\n\nASTThirdLevelExpressionNode::ASTThirdLevelExpressionNode(ASTTokenNode* identifierOrValue,\n TokenType type) : ASTNode(type) {\n this->identifierOrValue = identifierOrValue;\n this->expression = NULL;\n}\n\nASTThirdLevelExpressionNode::ASTThirdLevelExpressionNode(ASTFirstLevelExpressionNode* expression,\n TokenType type) : ASTNode(type) {\n this->identifierOrValue = NULL;\n this->expression = expression;\n}\n\nASTTokenNode* ASTThirdLevelExpressionNode::getIdentifierOrValue() {\n return this->identifierOrValue;\n}\n\nASTFirstLevelExpressionNode* ASTThirdLevelExpressionNode::getExpression() {\n return this->expression;\n}\n\nbool ASTThirdLevelExpressionNode::analyze(analyze_table* table) {\n if (expression != NULL && !expression->analyze(table)) {\n return false;\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID &&\n (table->count(this->identifierOrValue->getValue()) < 1 ||\n !std::get<0>((*table)[this->identifierOrValue->getValue()]))) {\n cerr << \"variable non affectee : \" << this->identifierOrValue->getValue() << endl;\n return false;\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID) {\n bool isConst = std::get<1>((*table)[this->identifierOrValue->getValue()]);\n (*table)[this->identifierOrValue->getValue()] = std::make_tuple(true, isConst, true);\n }\n return true;\n}\n\nint64_t ASTThirdLevelExpressionNode::exec(exec_table* table) {\n if (this->identifierOrValue != NULL) {\n if (this->identifierOrValue->getTokenType() == TokenType::ID &&\n table->count(this->identifierOrValue->getValue()) > 0) {\n return std::get<0>((*table)[this->identifierOrValue->getValue()]);\n } else if (this->identifierOrValue->getTokenType() == TokenType::ID) {\n throw std::exception();\n return false;\n } else {\n stringstream ss;\n ss << this->identifierOrValue->getValue();\n int64_t value;\n ss >> value;\n return value;\n }\n } else {\n return expression->exec(table);\n }\n}\n\nvoid ASTThirdLevelExpressionNode::print() {\n if (this->identifierOrValue != NULL) {\n this->identifierOrValue->print();\n } else {\n cout << \"(\";\n this->expression->print();\n cout << \")\";\n }\n}\n\nvoid ASTThirdLevelExpressionNode::transform(exec_table* table) {\n if (this->expression != NULL) {\n this->expression->transform(table);\n } else if (this->identifierOrValue != NULL &&\n this->identifierOrValue->getTokenType() == TokenType::ID &&\n table->count(this->identifierOrValue->getValue()) > 0) {\n std::tuple<int64_t, bool> constTerm = (*table)[this->identifierOrValue->getValue()];\n if (std::get<1>(constTerm)) {\n stringstream ss;\n ss << std::get<0>(constTerm);\n string val = ss.str();\n this->identifierOrValue = new ASTTokenNode(TokenType::VAL, val);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salgdiutils.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2007-07-05 16:01:22 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_vcl.hxx\"\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <basebmp\/scanlineformats.hxx>\n#include <basebmp\/color.hxx>\n#include <basegfx\/range\/b2drectangle.hxx>\n#include <basegfx\/range\/b2irange.hxx>\n#include <basegfx\/vector\/b2ivector.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <boost\/bind.hpp>\n\n#include <vcl\/svapp.hxx>\n\n#include \"saldata.hxx\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid AquaSalGraphics::SetWindowGraphics( CarbonViewRef rView, CarbonWindowRef rWindow, bool bScreenCompatible )\n{\n mrView = rView;\n mrWindow = rWindow;\n mbScreen = bScreenCompatible;\n\n mbWindow = true;\n mbPrinter = false;\n mbVirDev = false;\n}\n\nvoid AquaSalGraphics::SetPrinterGraphics( CGContextRef xContext, long nDPIX, long nDPIY )\n{\n mrView = 0;\n mbScreen = false;\n\n mbWindow = false;\n mbPrinter = true;\n mbVirDev = false;\n\n mrContext = xContext;\n mnDPIX = nDPIX;\n mnDPIY = nDPIY;\n\n if( mrContext )\n {\n CGContextSetFillColorSpace( mrContext, mrRGBColorSpace );\n CGContextSetStrokeColorSpace( mrContext, mrRGBColorSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n}\n\nstatic void nil_free( void* )\n{\n}\n\nvoid AquaSalGraphics::SetVirDevGraphics( CGContextRef xContext, bool bScreenCompatible )\n{\n mrView = 0;\n mbScreen = bScreenCompatible;\n\n mbWindow = false;\n mbPrinter = false;\n mbVirDev = true;\n\n mrContext = xContext;\n sal_uInt8* pMemory = NULL;\n if( mrContext )\n {\n pMemory = reinterpret_cast<sal_uInt8*>(CGBitmapContextGetData( mrContext ));\n CGContextSetFillColorSpace( mrContext, mrRGBColorSpace );\n CGContextSetStrokeColorSpace( mrContext, mrRGBColorSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n maContextMemory.reset( pMemory, boost::bind( nil_free, _1 ) );\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvoid AquaSalGraphics::SetState()\n{\n CGContextRestoreGState( mrContext );\n CGContextSaveGState( mrContext );\n \/\/ set up clipping area\n if( mrClippingPath )\n {\n CGContextBeginPath( mrContext ); \/\/ discard any existing path\n CGContextAddPath( mrContext, mrClippingPath ); \/\/ set the current path to the clipping path\n CGContextClip( mrContext ); \/\/ use it for clipping\n }\n\n \/\/ set RGB colorspace and line and fill colors\n CGContextSetFillColor( mrContext, mpFillColor );\n CGContextSetStrokeColor( mrContext, mpLineColor );\n if( mbXORMode && (mbWindow || mbVirDev) )\n {\n CGContextSetBlendMode(mrContext, kCGBlendModeDifference);\n int nWidth = CGBitmapContextGetWidth(mrContext);\n int nHeight = CGBitmapContextGetHeight(mrContext);\n if( ! maXORDevice )\n {\n maXORDevice = basebmp::createBitmapDevice( basegfx::B2IVector( nWidth, nHeight ),\n mbWindow,\n basebmp::Format::THIRTYTWO_BIT_TC_MASK_ARGB,\n maContextMemory,\n basebmp::PaletteMemorySharedVector() );\n if( mrClippingPath && maClippingRects.size() == 1 )\n {\n \/*\n * optimization: the case with only one clip rectangle is quite common\n * in this case it is much cheaper to constrain the XOR device to a smaller\n * area than to clip every pixel with the mask\n *\/\n maXORClipMask.reset();\n CGRect aBounds( maClippingRects.front() );\n basegfx::B2IRange aRect( aBounds.origin.x, aBounds.origin.y,\n aBounds.origin.x+aBounds.size.width,\n aBounds.origin.y+aBounds.size.height );\n maXORDevice = basebmp::subsetBitmapDevice( maXORDevice, aRect );\n }\n }\n if( mrClippingPath )\n {\n if( ! maXORClipMask && maClippingRects.size() > 1 )\n {\n maXORClipMask = basebmp::createBitmapDevice( basegfx::B2IVector( nWidth, nHeight ),\n mbWindow,\n basebmp::Format::ONE_BIT_MSB_GREY );\n maXORClipMask->clear( basebmp::Color(0xffffffff) );\n for( std::vector<CGRect>::const_iterator it = maClippingRects.begin(); it != maClippingRects.end(); ++it )\n {\n basegfx::B2DRectangle aRect( it->origin.x, it->origin.y,\n it->origin.x+it->size.width,\n it->origin.y+it->size.height );\n maXORClipMask->fillPolyPolygon( basegfx::B2DPolyPolygon( basegfx::tools::createPolygonFromRect( aRect ) ),\n basebmp::Color( 0 ),\n basebmp::DrawMode_PAINT\n );\n }\n }\n }\n else\n maXORClipMask.reset();\n }\n\n CGContextSetShouldAntialias( mrContext, false );\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\nbool AquaSalGraphics::CheckContext()\n{\n if( mrWindow != NULL )\n {\n Rect windowBounds;\n GetWindowPortBounds( mrWindow, &windowBounds );\n const unsigned int nWidth = windowBounds.right - windowBounds.left;\n const unsigned int nHeight = windowBounds.bottom - windowBounds.top;\n\n CGContextRef rReleaseContext = 0;\n unsigned int nReleaseContextWidth = 0;\n unsigned int nReleaseContextHeight = 0;\n\n boost::shared_array<sal_uInt8> aOldMem;\n if( mrContext )\n {\n nReleaseContextWidth = CGBitmapContextGetWidth(mrContext);\n nReleaseContextHeight = CGBitmapContextGetHeight(mrContext);\n \/\/ check if window size changed and we need to create a new bitmap context\n if( (nReleaseContextWidth != nWidth) || (nReleaseContextHeight != nHeight) )\n {\n rReleaseContext = mrContext;\n mrContext = 0;\n aOldMem = maContextMemory;\n maXORDevice.reset();\n maXORClipMask.reset();\n }\n }\n\n if( !mrContext )\n {\n maContextMemory.reset( reinterpret_cast<sal_uInt8*>( rtl_allocateMemory( nWidth * 4 * nHeight ) ),\n boost::bind( rtl_freeMemory, _1 ) );\n if( maContextMemory )\n {\n mrContext = CGBitmapContextCreate( maContextMemory.get(), nWidth, nHeight, 8, nWidth * 4, mrRGBColorSpace, kCGImageAlphaNoneSkipFirst );\n\n if( mrContext )\n {\n \/\/ copy bitmap data to new context\n if( rReleaseContext )\n {\n CGRect aBounds;\n aBounds.origin.x = aBounds.origin.y = 0;\n aBounds.size.width = nReleaseContextWidth;\n aBounds.size.height = nReleaseContextHeight;\n CGImageRef xImage = CGBitmapContextCreateImage( rReleaseContext );\n CGContextDrawImage( mrContext, aBounds, xImage );\n CGImageRelease(xImage);\n }\n\n CGContextTranslateCTM( mrContext, 0, nHeight );\n CGContextScaleCTM( mrContext, 1.0, -1.0 );\n CGContextSetFillColorSpace( mrContext, mrRGBColorSpace );\n CGContextSetStrokeColorSpace( mrContext, mrRGBColorSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n else\n {\n maContextMemory.reset(); \/\/ free memory again\n }\n }\n }\n\n if( rReleaseContext ) \/\/ released memory runs out of scope and is then freed\n CFRelease( rReleaseContext );\n }\n if( mrContext )\n {\n if( mbXORMode )\n {\n if( ! maXORDevice )\n SetState();\n }\n return true;\n }\n else\n {\n AquaLog(\"<<<WARNING>>> AquaSalGraphics::CheckContext() FAILED!!!!\\n\" );\n return false;\n }\n}\n\n\nvoid AquaSalGraphics::RefreshRect(float lX, float lY, float lWidth, float lHeight)\n{\n if( ! mbWindow ) \/\/ view only on Window graphics\n return;\n\n AquaLog(\"-->%s refresh %d - %d - %d - %d\\n\", __func__, static_cast<int>(lX), static_cast<int>(lY), static_cast<int>(lWidth), static_cast<int>(lHeight));\n\n \/\/ Refresh windows rect content\n HIRect aHIRect;\n aHIRect.origin.x = static_cast<int>(lX);\n aHIRect.origin.y = static_cast<int>(lY);\n aHIRect.size.width = static_cast<int>(lWidth);\n aHIRect.size.height = static_cast<int>(lHeight);\n OSStatus retVal = HIViewSetNeedsDisplayInRect(mrView,&aHIRect,true);\n if (retVal)\n AquaLog( \"FIXME: HIViewSetNeedsDisplayInRect returned %d (mrView is %p)\\n\", (int) retVal, mrView);\n\n Rect aRect;\n aRect.left = (short)lX;\n aRect.top = (short)lY;\n aRect.right = (short)(lX + lWidth );\n aRect.bottom = (short)(lY + lHeight );\n InvalWindowRect(mrWindow, &aRect);\n}\n\nvoid AquaSalGraphics::Flush()\n{\n if( mbWindow )\n {\n UpdateWindow();\n }\n}\n\nCGPoint* AquaSalGraphics::makeCGptArray(ULONG nPoints, const SalPoint* pPtAry)\n{\n AquaLog(\"-->%s\\n\",__func__);\n CGPoint *CGpoints = new (CGPoint[nPoints]);\n if ( CGpoints )\n {\n for(ULONG i=0;i<nPoints;i++)\n {\n CGpoints[i].x = (float)(pPtAry[i].mnX);\n CGpoints[i].y = (float)(pPtAry[i].mnY);\n }\n }\n return CGpoints;\n}\n\n\n\/\/ -----------------------------------------------------------------------\n\nvoid AquaSalGraphics::UpdateWindow()\n{\n if( mrContext != NULL && mrWindow != NULL )\n {\n SetPortWindowPort(mrWindow);\n CGContextRef xWindowContext = 0;\n if( noErr == QDBeginCGContext (GetWindowPort (mrWindow), &xWindowContext))\n {\n Rect windowBounds;\n GetWindowPortBounds( mrWindow, &windowBounds);\n CGImageRef xImage = CGBitmapContextCreateImage( mrContext );\n CGContextDrawImage(xWindowContext, CGRectMake(windowBounds.left, windowBounds.top, windowBounds.right - windowBounds.left, windowBounds.bottom - windowBounds.top ), xImage);\n CGImageRelease(xImage);\n CGContextFlush( xWindowContext );\n QDEndCGContext (GetWindowPort(mrWindow), &xWindowContext);\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\n<commit_msg>INTEGRATION: CWS aquavcl02 (1.8.262); FILE MERGED 2007\/07\/11 10:50:18 pjanik 1.8.262.3: RESYNC: (1.8-1.10); FILE MERGED 2007\/07\/10 08:14:43 pl 1.8.262.2: #i79424# reuse colorspace 2007\/07\/02 11:53:46 pl 1.8.262.1: join from aquavcl01<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: salgdiutils.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: hr $ $Date: 2007-08-03 14:02:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_vcl.hxx\"\n\n#ifndef _SV_SALGDI_H\n#include <salgdi.h>\n#endif\n\n#include <basebmp\/scanlineformats.hxx>\n#include <basebmp\/color.hxx>\n#include <basegfx\/range\/b2drectangle.hxx>\n#include <basegfx\/range\/b2irange.hxx>\n#include <basegfx\/vector\/b2ivector.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <boost\/bind.hpp>\n\n#include <vcl\/svapp.hxx>\n\n#include \"saldata.hxx\"\n\n\/\/ ----------------------------------------------------------------------\n\nvoid AquaSalGraphics::SetWindowGraphics( CarbonViewRef rView, CarbonWindowRef rWindow, bool bScreenCompatible )\n{\n mrView = rView;\n mrWindow = rWindow;\n mbScreen = bScreenCompatible;\n\n mbWindow = true;\n mbPrinter = false;\n mbVirDev = false;\n}\n\nvoid AquaSalGraphics::SetPrinterGraphics( CGContextRef xContext, long nDPIX, long nDPIY )\n{\n mrView = 0;\n mbScreen = false;\n\n mbWindow = false;\n mbPrinter = true;\n mbVirDev = false;\n\n mrContext = xContext;\n mnDPIX = nDPIX;\n mnDPIY = nDPIY;\n\n if( mrContext )\n {\n CGContextSetFillColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSetStrokeColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n}\n\nstatic void nil_free( void* )\n{\n}\n\nvoid AquaSalGraphics::SetVirDevGraphics( CGContextRef xContext, bool bScreenCompatible )\n{\n mrView = 0;\n mbScreen = bScreenCompatible;\n\n mbWindow = false;\n mbPrinter = false;\n mbVirDev = true;\n\n mrContext = xContext;\n sal_uInt8* pMemory = NULL;\n if( mrContext )\n {\n pMemory = reinterpret_cast<sal_uInt8*>(CGBitmapContextGetData( mrContext ));\n CGContextSetFillColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSetStrokeColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n maContextMemory.reset( pMemory, boost::bind( nil_free, _1 ) );\n}\n\n\/\/ ----------------------------------------------------------------------\n\nvoid AquaSalGraphics::SetState()\n{\n CGContextRestoreGState( mrContext );\n CGContextSaveGState( mrContext );\n \/\/ set up clipping area\n if( mrClippingPath )\n {\n CGContextBeginPath( mrContext ); \/\/ discard any existing path\n CGContextAddPath( mrContext, mrClippingPath ); \/\/ set the current path to the clipping path\n CGContextClip( mrContext ); \/\/ use it for clipping\n }\n\n \/\/ set RGB colorspace and line and fill colors\n CGContextSetFillColor( mrContext, mpFillColor );\n CGContextSetStrokeColor( mrContext, mpLineColor );\n if( mbXORMode && (mbWindow || mbVirDev) )\n {\n CGContextSetBlendMode(mrContext, kCGBlendModeDifference);\n int nWidth = CGBitmapContextGetWidth(mrContext);\n int nHeight = CGBitmapContextGetHeight(mrContext);\n if( ! maXORDevice )\n {\n maXORDevice = basebmp::createBitmapDevice( basegfx::B2IVector( nWidth, nHeight ),\n mbWindow,\n basebmp::Format::THIRTYTWO_BIT_TC_MASK_ARGB,\n maContextMemory,\n basebmp::PaletteMemorySharedVector() );\n if( mrClippingPath && maClippingRects.size() == 1 )\n {\n \/*\n * optimization: the case with only one clip rectangle is quite common\n * in this case it is much cheaper to constrain the XOR device to a smaller\n * area than to clip every pixel with the mask\n *\/\n maXORClipMask.reset();\n CGRect aBounds( maClippingRects.front() );\n basegfx::B2IRange aRect( aBounds.origin.x, aBounds.origin.y,\n aBounds.origin.x+aBounds.size.width,\n aBounds.origin.y+aBounds.size.height );\n maXORDevice = basebmp::subsetBitmapDevice( maXORDevice, aRect );\n }\n }\n if( mrClippingPath )\n {\n if( ! maXORClipMask && maClippingRects.size() > 1 )\n {\n maXORClipMask = basebmp::createBitmapDevice( basegfx::B2IVector( nWidth, nHeight ),\n mbWindow,\n basebmp::Format::ONE_BIT_MSB_GREY );\n maXORClipMask->clear( basebmp::Color(0xffffffff) );\n for( std::vector<CGRect>::const_iterator it = maClippingRects.begin(); it != maClippingRects.end(); ++it )\n {\n basegfx::B2DRectangle aRect( it->origin.x, it->origin.y,\n it->origin.x+it->size.width,\n it->origin.y+it->size.height );\n maXORClipMask->fillPolyPolygon( basegfx::B2DPolyPolygon( basegfx::tools::createPolygonFromRect( aRect ) ),\n basebmp::Color( 0 ),\n basebmp::DrawMode_PAINT\n );\n }\n }\n }\n else\n maXORClipMask.reset();\n }\n\n CGContextSetShouldAntialias( mrContext, false );\n\n}\n\n\/\/ ----------------------------------------------------------------------\n\nbool AquaSalGraphics::CheckContext()\n{\n if( mrWindow != NULL )\n {\n Rect windowBounds;\n GetWindowPortBounds( mrWindow, &windowBounds );\n const unsigned int nWidth = windowBounds.right - windowBounds.left;\n const unsigned int nHeight = windowBounds.bottom - windowBounds.top;\n\n CGContextRef rReleaseContext = 0;\n unsigned int nReleaseContextWidth = 0;\n unsigned int nReleaseContextHeight = 0;\n\n boost::shared_array<sal_uInt8> aOldMem;\n if( mrContext )\n {\n nReleaseContextWidth = CGBitmapContextGetWidth(mrContext);\n nReleaseContextHeight = CGBitmapContextGetHeight(mrContext);\n \/\/ check if window size changed and we need to create a new bitmap context\n if( (nReleaseContextWidth != nWidth) || (nReleaseContextHeight != nHeight) )\n {\n rReleaseContext = mrContext;\n mrContext = 0;\n aOldMem = maContextMemory;\n maXORDevice.reset();\n maXORClipMask.reset();\n }\n }\n\n if( !mrContext )\n {\n maContextMemory.reset( reinterpret_cast<sal_uInt8*>( rtl_allocateMemory( nWidth * 4 * nHeight ) ),\n boost::bind( rtl_freeMemory, _1 ) );\n if( maContextMemory )\n {\n mrContext = CGBitmapContextCreate( maContextMemory.get(), nWidth, nHeight, 8, nWidth * 4, GetSalData()->mxRGBSpace, kCGImageAlphaNoneSkipFirst );\n\n if( mrContext )\n {\n \/\/ copy bitmap data to new context\n if( rReleaseContext )\n {\n CGRect aBounds;\n aBounds.origin.x = aBounds.origin.y = 0;\n aBounds.size.width = nReleaseContextWidth;\n aBounds.size.height = nReleaseContextHeight;\n CGImageRef xImage = CGBitmapContextCreateImage( rReleaseContext );\n CGContextDrawImage( mrContext, aBounds, xImage );\n CGImageRelease(xImage);\n }\n\n CGContextTranslateCTM( mrContext, 0, nHeight );\n CGContextScaleCTM( mrContext, 1.0, -1.0 );\n CGContextSetFillColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSetStrokeColorSpace( mrContext, GetSalData()->mxRGBSpace );\n CGContextSaveGState( mrContext );\n SetState();\n }\n else\n {\n maContextMemory.reset(); \/\/ free memory again\n }\n }\n }\n\n if( rReleaseContext ) \/\/ released memory runs out of scope and is then freed\n CFRelease( rReleaseContext );\n }\n if( mrContext )\n {\n if( mbXORMode )\n {\n if( ! maXORDevice )\n SetState();\n }\n return true;\n }\n else\n {\n AquaLog(\"<<<WARNING>>> AquaSalGraphics::CheckContext() FAILED!!!!\\n\" );\n return false;\n }\n}\n\n\nvoid AquaSalGraphics::RefreshRect(float lX, float lY, float lWidth, float lHeight)\n{\n if( ! mbWindow ) \/\/ view only on Window graphics\n return;\n\n AquaLog(\"-->%s refresh %d - %d - %d - %d\\n\", __func__, static_cast<int>(lX), static_cast<int>(lY), static_cast<int>(lWidth), static_cast<int>(lHeight));\n\n \/\/ Refresh windows rect content\n HIRect aHIRect;\n aHIRect.origin.x = static_cast<int>(lX);\n aHIRect.origin.y = static_cast<int>(lY);\n aHIRect.size.width = static_cast<int>(lWidth);\n aHIRect.size.height = static_cast<int>(lHeight);\n OSStatus retVal = HIViewSetNeedsDisplayInRect(mrView,&aHIRect,true);\n if (retVal)\n AquaLog( \"FIXME: HIViewSetNeedsDisplayInRect returned %d (mrView is %p)\\n\", (int) retVal, mrView);\n\n Rect aRect;\n aRect.left = (short)lX;\n aRect.top = (short)lY;\n aRect.right = (short)(lX + lWidth );\n aRect.bottom = (short)(lY + lHeight );\n InvalWindowRect(mrWindow, &aRect);\n}\n\nvoid AquaSalGraphics::Flush()\n{\n if( mbWindow )\n {\n UpdateWindow();\n }\n}\n\nCGPoint* AquaSalGraphics::makeCGptArray(ULONG nPoints, const SalPoint* pPtAry)\n{\n AquaLog(\"-->%s\\n\",__func__);\n CGPoint *CGpoints = new (CGPoint[nPoints]);\n if ( CGpoints )\n {\n for(ULONG i=0;i<nPoints;i++)\n {\n CGpoints[i].x = (float)(pPtAry[i].mnX);\n CGpoints[i].y = (float)(pPtAry[i].mnY);\n }\n }\n return CGpoints;\n}\n\n\n\/\/ -----------------------------------------------------------------------\n\nvoid AquaSalGraphics::UpdateWindow()\n{\n if( mrContext != NULL && mrWindow != NULL )\n {\n SetPortWindowPort(mrWindow);\n CGContextRef xWindowContext = 0;\n if( noErr == QDBeginCGContext (GetWindowPort (mrWindow), &xWindowContext))\n {\n Rect windowBounds;\n GetWindowPortBounds( mrWindow, &windowBounds);\n CGImageRef xImage = CGBitmapContextCreateImage( mrContext );\n CGContextDrawImage(xWindowContext, CGRectMake(windowBounds.left, windowBounds.top, windowBounds.right - windowBounds.left, windowBounds.bottom - windowBounds.top ), xImage);\n CGImageRelease(xImage);\n CGContextFlush( xWindowContext );\n QDEndCGContext (GetWindowPort(mrWindow), &xWindowContext);\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#ifndef INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n#define INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n\n#include \"generic\/glyphcache.hxx\"\n\nclass X11GlyphPeer : public GlyphCachePeer\n{\npublic:\n X11GlyphPeer();\n virtual ~X11GlyphPeer();\n};\n\nclass X11GlyphCache : public GlyphCache\n{\npublic:\n X11GlyphCache( X11GlyphPeer& );\n X11GlyphPeer& GetPeer()\n {\n return static_cast<X11GlyphPeer&>(mrPeer);\n }\n static X11GlyphCache& GetInstance();\n static void KillInstance();\n};\n\n#endif \/\/ INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>unused GetPeer inline<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#ifndef INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n#define INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n\n#include \"generic\/glyphcache.hxx\"\n\nclass X11GlyphPeer : public GlyphCachePeer\n{\npublic:\n X11GlyphPeer();\n virtual ~X11GlyphPeer();\n};\n\nclass X11GlyphCache : public GlyphCache\n{\npublic:\n X11GlyphCache( X11GlyphPeer& );\n static X11GlyphCache& GetInstance();\n static void KillInstance();\n};\n\n#endif \/\/ INCLUDED_VCL_UNX_GENERIC_GDI_GCACH_XPEER_HXX\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#708670 Uninitialized scalar field<commit_after><|endoftext|>"} {"text":"<commit_before>#include <Bull\/Core\/Memory\/ByteVector.hpp>\n\nnamespace Bull\n{\n ByteVector::ByteVector(std::size_t size) :\n ByteVector(size, 0)\n {\n \/\/\/ Nothing\n }\n\n ByteVector::ByteVector(std::size_t size, Uint8 value) :\n MemoryVector<Uint8>(size, value)\n {\n \/\/\/ Nothing\n }\n\n String ByteVector::toString() const\n {\n return String(reinterpret_cast<const char*>(getBuffer(), getCapacity()));\n }\n}<commit_msg>[Core\/ByteVector] Fix toString method<commit_after>#include <Bull\/Core\/Memory\/ByteVector.hpp>\n\nnamespace Bull\n{\n ByteVector::ByteVector(std::size_t size) :\n ByteVector(size, 0)\n {\n \/\/\/ Nothing\n }\n\n ByteVector::ByteVector(std::size_t size, Uint8 value) :\n MemoryVector<Uint8>(size, value)\n {\n \/\/\/ Nothing\n }\n\n String ByteVector::toString() const\n {\n return String(reinterpret_cast<const char*>(getBuffer()), getCapacity());\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * SchemeSmob.c\n *\n * Scheme small objects (SMOBS) for opencog -- core functions.\n *\n * Copyright (c) 2008, 2013, 2014, 2015 Linas Vepstas <linas@linas.org>\n *\/\n\n#ifdef HAVE_GUILE\n\n#include <cstddef>\n#include <libguile.h>\n\n#include <opencog\/atomspace\/AtomSpace.h>\n#include \"SchemePrimitive.h\"\n#include \"SchemeSmob.h\"\n\nusing namespace opencog;\n\n\/**\n * Just one scheme smob type is used to implement the interface.\n *\n * The cog_misc_tag is used to store all structures, such as atoms\n * and truth values. It is assumed that these structures are all\n * ephemeral (garbage-collected), including the Handles. Note that\n * atoms in the atomspace have a concrete existence outside of the\n * scheme shell. By contrast, truth values created by the scheme\n * shell are garbage collected by the shell.\n *\n * The type of the \"misc\" structure is stored in the flag bits;\n * thus, handling is dispatched based on these flags.\n *\n * XXX TODO:\n * The cog_misc_tag should be replaced by a tag-per-class (i.e. we\n * should have a separate tag for handles, tv's, etc.) This would\n * simplify that code, and probably improve performance just a bit.\n *\/\n\nscm_t_bits SchemeSmob::cog_misc_tag;\nstd::atomic_flag SchemeSmob::is_inited = ATOMIC_FLAG_INIT;\nSCM SchemeSmob::_radix_ten;\n\nvoid SchemeSmob::init()\n{\n\tif (is_inited.test_and_set()) return;\n\n\tinit_smob_type();\n\tscm_c_define_module(\"opencog\", register_procs, NULL);\n\tscm_c_use_module(\"opencog\");\n\n\tatomspace_fluid = scm_make_fluid();\n\tatomspace_fluid = scm_permanent_object(atomspace_fluid);\n\t_radix_ten = scm_from_int8(10);\n}\n\nSchemeSmob::SchemeSmob()\n{\n\tinit();\n}\n\nvoid opencog_guile_init(void)\n{\n\tSchemeSmob::init();\n}\n\n\/* ============================================================== *\/\n\nvoid SchemeSmob::init_smob_type(void)\n{\n\t\/\/ A SMOB type for everything, incuding atoms.\n\tcog_misc_tag = scm_make_smob_type (\"opencog-misc\", sizeof (scm_t_bits));\n\tscm_set_smob_print (cog_misc_tag, print_misc);\n\tscm_set_smob_equalp (cog_misc_tag, equalp_misc);\n\t\/\/ scm_set_smob_mark (cog_misc_tag, mark_misc);\n\tscm_set_smob_free (cog_misc_tag, free_misc);\n}\n\n\/* ============================================================== *\/\n\nSCM SchemeSmob::equalp_misc(SCM a, SCM b)\n{\n\t\/\/ If they're not something we know about, let scheme sort it out.\n\t\/\/ (Actualy, this should never happen ...)\n\tif (not SCM_SMOB_PREDICATE(SchemeSmob::cog_misc_tag, a))\n\t\treturn scm_equal_p(a, b);\n\n\t\/\/ If the types don't match, they can't be equal.\n\tscm_t_bits ta = SCM_SMOB_FLAGS(a);\n\tscm_t_bits tb = SCM_SMOB_FLAGS(b);\n\tif (ta != tb)\n\t\treturn SCM_BOOL_F;\n\n\tswitch (ta)\n\t{\n\t\tdefault: \/\/ Should never happen.\n\t\tcase 0: \/\/ Should never happen.\n\t\t\treturn SCM_BOOL_F;\n\t\tcase COG_AS:\n\t\t{\n\t\t\tAtomSpace* as = (AtomSpace *) SCM_SMOB_DATA(a);\n\t\t\tAtomSpace* bs = (AtomSpace *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\t\/* Just a simple pointer comparison *\/\n\t\t\tif (as == bs) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_AV:\n\t\t{\n\t\t\tAttentionValue* av = (AttentionValue *) SCM_SMOB_DATA(a);\n\t\t\tAttentionValue* bv = (AttentionValue *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\tif (*av == *bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_EXTEND:\n\t\t{\n\t\t\t\/\/ We compare pointers here, only.\n\t\t\tPrimitiveEnviron* av = (PrimitiveEnviron *) SCM_SMOB_DATA(a);\n\t\t\tPrimitiveEnviron* bv = (PrimitiveEnviron *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_HANDLE:\n\t\t{\n\t\t\tHandle ha(scm_to_handle(a));\n\t\t\tHandle hb(scm_to_handle(b));\n\t\t\tif (ha == hb) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_TV:\n\t\t{\n\t\t\tTruthValue* av = (TruthValue *) SCM_SMOB_DATA(a);\n\t\t\tTruthValue* bv = (TruthValue *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\tif (*av == *bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t}\n}\n\n\/* ============================================================== *\/\n\nvoid SchemeSmob::throw_exception(const char *msg, const char * func)\n{\n\tif (msg) {\n\t\t\/\/ Should we even bother to log this? Probably not ...\n\t\tlogger().info(\"Guile caught C++ exception: %s\", msg);\n\n\t\t\/\/ scm_misc_error(fe->get_name(), msg, SCM_EOL);\n\t\tscm_throw(\n\t\t\tscm_from_utf8_symbol(\"C++-EXCEPTION\"),\n\t\t\tscm_cons(\n\t\t\t\tscm_from_utf8_string(func),\n\t\t\t\tscm_cons(\n\t\t\t\t\tscm_from_utf8_string(msg),\n\t\t\t\t\tSCM_EOL)));\n\t\t\/\/ Hmm. scm_throw never returns.\n\t}\n\telse\n\t{\n\t\t\/\/ scm_misc_error(fe->get_name(), \"unknown C++ exception\", SCM_EOL);\n\t\tscm_error_scm(\n\t\t\tscm_from_utf8_symbol(\"C++ exception\"),\n\t\t\tscm_from_utf8_string(func),\n\t\t\tscm_from_utf8_string(\"unknown C++ exception\"),\n\t\t\tSCM_EOL,\n\t\t\tSCM_EOL);\n\t\tlogger().error(\"Guile caught unknown C++ exception\");\n\t}\n}\n\n\/* ============================================================== *\/\n\n#ifdef HAVE_GUILE2\n #define C(X) ((scm_t_subr) X)\n#else\n #define C(X) ((SCM (*) ()) X)\n#endif\n\nvoid SchemeSmob::register_procs(void*)\n{\n\tregister_proc(\"cog-atom\", 1, 0, 0, C(ss_atom));\n\tregister_proc(\"cog-handle\", 1, 0, 0, C(ss_handle));\n\tregister_proc(\"cog-undefined-handle\", 0, 0, 0, C(ss_undefined_handle));\n\tregister_proc(\"cog-new-value\", 1, 0, 1, C(ss_new_value));\n\tregister_proc(\"cog-new-node\", 2, 0, 1, C(ss_new_node));\n\tregister_proc(\"cog-new-link\", 1, 0, 1, C(ss_new_link));\n\tregister_proc(\"cog-node\", 2, 0, 1, C(ss_node));\n\tregister_proc(\"cog-link\", 1, 0, 1, C(ss_link));\n\tregister_proc(\"cog-delete\", 1, 0, 1, C(ss_delete));\n\tregister_proc(\"cog-delete-recursive\", 1, 0, 1, C(ss_delete_recursive));\n\tregister_proc(\"cog-purge\", 1, 0, 1, C(ss_purge));\n\tregister_proc(\"cog-purge-recursive\", 1, 0, 1, C(ss_purge_recursive));\n\tregister_proc(\"cog-value?\", 1, 0, 1, C(ss_value_p));\n\tregister_proc(\"cog-atom?\", 1, 0, 1, C(ss_atom_p));\n\tregister_proc(\"cog-node?\", 1, 0, 1, C(ss_node_p));\n\tregister_proc(\"cog-link?\", 1, 0, 1, C(ss_link_p));\n\n\t\/\/ property setters on atoms\n\tregister_proc(\"cog-set-av!\", 2, 0, 0, C(ss_set_av));\n\tregister_proc(\"cog-set-tv!\", 2, 0, 0, C(ss_set_tv));\n\tregister_proc(\"cog-merge-tv!\", 2, 0, 0, C(ss_merge_tv));\n\tregister_proc(\"cog-merge-hi-conf-tv!\", 2, 0, 0, C(ss_merge_hi_conf_tv));\n\tregister_proc(\"cog-inc-vlti!\", 1, 0, 0, C(ss_inc_vlti));\n\tregister_proc(\"cog-dec-vlti!\", 1, 0, 0, C(ss_dec_vlti));\n\n\t\/\/ property getters on atoms\n\tregister_proc(\"cog-name\", 1, 0, 0, C(ss_name));\n\tregister_proc(\"cog-type\", 1, 0, 0, C(ss_type));\n\tregister_proc(\"cog-arity\", 1, 0, 0, C(ss_arity));\n\tregister_proc(\"cog-incoming-set\", 1, 0, 0, C(ss_incoming_set));\n\tregister_proc(\"cog-outgoing-set\", 1, 0, 0, C(ss_outgoing_set));\n\tregister_proc(\"cog-tv\", 1, 0, 0, C(ss_tv));\n\tregister_proc(\"cog-av\", 1, 0, 0, C(ss_av));\n\tregister_proc(\"cog-as\", 1, 0, 0, C(ss_as));\n\n\t\/\/ Truth-values\n\tregister_proc(\"cog-new-stv\", 2, 0, 0, C(ss_new_stv));\n\tregister_proc(\"cog-new-ctv\", 3, 0, 0, C(ss_new_ctv));\n\tregister_proc(\"cog-new-itv\", 3, 0, 0, C(ss_new_itv));\n\tregister_proc(\"cog-new-ptv\", 3, 0, 0, C(ss_new_ptv));\n\tregister_proc(\"cog-new-ftv\", 2, 0, 0, C(ss_new_ftv));\n\tregister_proc(\"cog-tv?\", 1, 0, 0, C(ss_tv_p));\n\tregister_proc(\"cog-stv?\", 1, 0, 0, C(ss_stv_p));\n\tregister_proc(\"cog-ctv?\", 1, 0, 0, C(ss_ctv_p));\n\tregister_proc(\"cog-itv?\", 1, 0, 0, C(ss_itv_p));\n\tregister_proc(\"cog-ptv?\", 1, 0, 0, C(ss_ptv_p));\n\tregister_proc(\"cog-ftv?\", 1, 0, 0, C(ss_ftv_p));\n\tregister_proc(\"cog-tv->alist\", 1, 0, 0, C(ss_tv_get_value));\n\tregister_proc(\"cog-tv-mean\", 1, 0, 0, C(ss_tv_get_mean));\n\tregister_proc(\"cog-tv-confidence\", 1, 0, 0, C(ss_tv_get_confidence));\n\tregister_proc(\"cog-tv-count\", 1, 0, 0, C(ss_tv_get_count));\n\n\t\/\/ Atom Spaces\n\tregister_proc(\"cog-new-atomspace\", 0, 1, 0, C(ss_new_as));\n\tregister_proc(\"cog-atomspace?\", 1, 0, 0, C(ss_as_p));\n\tregister_proc(\"cog-atomspace\", 0, 0, 0, C(ss_get_as));\n\tregister_proc(\"cog-set-atomspace!\", 1, 0, 0, C(ss_set_as));\n\tregister_proc(\"cog-atomspace-env\", 1, 0, 0, C(ss_as_env));\n\tregister_proc(\"cog-atomspace-uuid\", 1, 0, 0, C(ss_as_uuid));\n\tregister_proc(\"cog-atomspace-clear\", 1, 0, 0, C(ss_as_clear));\n\n\t\/\/ Attention values\n\tregister_proc(\"cog-new-av\", 3, 0, 0, C(ss_new_av));\n\tregister_proc(\"cog-av?\", 1, 0, 0, C(ss_av_p));\n\tregister_proc(\"cog-av->alist\", 1, 0, 0, C(ss_av_get_value));\n\n\t\/\/ AttentionalFocus\n\tregister_proc(\"cog-af-boundary\", 0, 0, 0, C(ss_af_boundary));\n\tregister_proc(\"cog-set-af-boundary!\", 1, 0, 0, C(ss_set_af_boundary));\n\tregister_proc(\"cog-af\", 0, 0, 0, C(ss_af));\n\n\t\/\/ Atom types\n\tregister_proc(\"cog-get-types\", 0, 0, 0, C(ss_get_types));\n\tregister_proc(\"cog-type->int\", 1, 0, 0, C(ss_get_type));\n\tregister_proc(\"cog-type?\", 1, 0, 0, C(ss_type_p));\n\tregister_proc(\"cog-value-type?\", 1, 0, 0, C(ss_value_type_p));\n\tregister_proc(\"cog-node-type?\", 1, 0, 0, C(ss_node_type_p));\n\tregister_proc(\"cog-link-type?\", 1, 0, 0, C(ss_link_type_p));\n\tregister_proc(\"cog-get-subtypes\", 1, 0, 0, C(ss_get_subtypes));\n\tregister_proc(\"cog-subtype?\", 2, 0, 0, C(ss_subtype_p));\n\n\t\/\/ Iterators\n\tregister_proc(\"cog-map-type\", 2, 0, 0, C(ss_map_type));\n}\n\nvoid SchemeSmob::register_proc(const char* name, int req, int opt, int rst, scm_t_subr fcn)\n{\n\tscm_c_define_gsubr(name, req, opt, rst, fcn);\n\tscm_c_export(name, NULL);\n}\n\n#endif\n\/* ===================== END OF FILE ============================ *\/\n<commit_msg>Some code is throwing something .. unexpected.<commit_after>\/*\n * SchemeSmob.c\n *\n * Scheme small objects (SMOBS) for opencog -- core functions.\n *\n * Copyright (c) 2008, 2013, 2014, 2015 Linas Vepstas <linas@linas.org>\n *\/\n\n#ifdef HAVE_GUILE\n\n#include <cstddef>\n#include <libguile.h>\n\n#include <opencog\/atomspace\/AtomSpace.h>\n#include \"SchemePrimitive.h\"\n#include \"SchemeSmob.h\"\n\nusing namespace opencog;\n\n\/**\n * Just one scheme smob type is used to implement the interface.\n *\n * The cog_misc_tag is used to store all structures, such as atoms\n * and truth values. It is assumed that these structures are all\n * ephemeral (garbage-collected), including the Handles. Note that\n * atoms in the atomspace have a concrete existence outside of the\n * scheme shell. By contrast, truth values created by the scheme\n * shell are garbage collected by the shell.\n *\n * The type of the \"misc\" structure is stored in the flag bits;\n * thus, handling is dispatched based on these flags.\n *\n * XXX TODO:\n * The cog_misc_tag should be replaced by a tag-per-class (i.e. we\n * should have a separate tag for handles, tv's, etc.) This would\n * simplify that code, and probably improve performance just a bit.\n *\/\n\nscm_t_bits SchemeSmob::cog_misc_tag;\nstd::atomic_flag SchemeSmob::is_inited = ATOMIC_FLAG_INIT;\nSCM SchemeSmob::_radix_ten;\n\nvoid SchemeSmob::init()\n{\n\tif (is_inited.test_and_set()) return;\n\n\tinit_smob_type();\n\tscm_c_define_module(\"opencog\", register_procs, NULL);\n\tscm_c_use_module(\"opencog\");\n\n\tatomspace_fluid = scm_make_fluid();\n\tatomspace_fluid = scm_permanent_object(atomspace_fluid);\n\t_radix_ten = scm_from_int8(10);\n}\n\nSchemeSmob::SchemeSmob()\n{\n\tinit();\n}\n\nvoid opencog_guile_init(void)\n{\n\tSchemeSmob::init();\n}\n\n\/* ============================================================== *\/\n\nvoid SchemeSmob::init_smob_type(void)\n{\n\t\/\/ A SMOB type for everything, incuding atoms.\n\tcog_misc_tag = scm_make_smob_type (\"opencog-misc\", sizeof (scm_t_bits));\n\tscm_set_smob_print (cog_misc_tag, print_misc);\n\tscm_set_smob_equalp (cog_misc_tag, equalp_misc);\n\t\/\/ scm_set_smob_mark (cog_misc_tag, mark_misc);\n\tscm_set_smob_free (cog_misc_tag, free_misc);\n}\n\n\/* ============================================================== *\/\n\nSCM SchemeSmob::equalp_misc(SCM a, SCM b)\n{\n\t\/\/ If they're not something we know about, let scheme sort it out.\n\t\/\/ (Actualy, this should never happen ...)\n\tif (not SCM_SMOB_PREDICATE(SchemeSmob::cog_misc_tag, a))\n\t\treturn scm_equal_p(a, b);\n\n\t\/\/ If the types don't match, they can't be equal.\n\tscm_t_bits ta = SCM_SMOB_FLAGS(a);\n\tscm_t_bits tb = SCM_SMOB_FLAGS(b);\n\tif (ta != tb)\n\t\treturn SCM_BOOL_F;\n\n\tswitch (ta)\n\t{\n\t\tdefault: \/\/ Should never happen.\n\t\tcase 0: \/\/ Should never happen.\n\t\t\treturn SCM_BOOL_F;\n\t\tcase COG_AS:\n\t\t{\n\t\t\tAtomSpace* as = (AtomSpace *) SCM_SMOB_DATA(a);\n\t\t\tAtomSpace* bs = (AtomSpace *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\t\/* Just a simple pointer comparison *\/\n\t\t\tif (as == bs) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_AV:\n\t\t{\n\t\t\tAttentionValue* av = (AttentionValue *) SCM_SMOB_DATA(a);\n\t\t\tAttentionValue* bv = (AttentionValue *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\tif (*av == *bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_EXTEND:\n\t\t{\n\t\t\t\/\/ We compare pointers here, only.\n\t\t\tPrimitiveEnviron* av = (PrimitiveEnviron *) SCM_SMOB_DATA(a);\n\t\t\tPrimitiveEnviron* bv = (PrimitiveEnviron *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_HANDLE:\n\t\t{\n\t\t\tHandle ha(scm_to_handle(a));\n\t\t\tHandle hb(scm_to_handle(b));\n\t\t\tif (ha == hb) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t\tcase COG_TV:\n\t\t{\n\t\t\tTruthValue* av = (TruthValue *) SCM_SMOB_DATA(a);\n\t\t\tTruthValue* bv = (TruthValue *) SCM_SMOB_DATA(b);\n\t\t\tscm_remember_upto_here_1(a);\n\t\t\tscm_remember_upto_here_1(b);\n\t\t\tif (av == bv) return SCM_BOOL_T;\n\t\t\tif (*av == *bv) return SCM_BOOL_T;\n\t\t\treturn SCM_BOOL_F;\n\t\t}\n\t}\n}\n\n\/* ============================================================== *\/\n\nvoid SchemeSmob::throw_exception(const char *msg, const char * func)\n{\n\tif (msg and msg[0] != 0)\n\t{\n\t\t\/\/ Should we even bother to log this? Probably not ...\n\t\tlogger().info(\"Guile caught C++ exception: %s\", msg);\n\n\t\t\/\/ scm_misc_error(fe->get_name(), msg, SCM_EOL);\n\t\tscm_throw(\n\t\t\tscm_from_utf8_symbol(\"C++-EXCEPTION\"),\n\t\t\tscm_cons(\n\t\t\t\tscm_from_utf8_string(func),\n\t\t\t\tscm_cons(\n\t\t\t\t\tscm_from_utf8_string(msg),\n\t\t\t\t\tSCM_EOL)));\n\t\t\/\/ Hmm. scm_throw never returns.\n\t}\n\telse\n\t{\n\t\t\/\/ scm_misc_error(fe->get_name(), \"unknown C++ exception\", SCM_EOL);\n\t\tscm_error_scm(\n\t\t\tscm_from_utf8_symbol(\"C++ exception\"),\n\t\t\tscm_from_utf8_string(func),\n\t\t\tscm_from_utf8_string(\"unknown C++ exception\"),\n\t\t\tSCM_EOL,\n\t\t\tSCM_EOL);\n\t\tlogger().error(\"Guile caught unknown C++ exception\");\n\t}\n}\n\n\/* ============================================================== *\/\n\n#ifdef HAVE_GUILE2\n #define C(X) ((scm_t_subr) X)\n#else\n #define C(X) ((SCM (*) ()) X)\n#endif\n\nvoid SchemeSmob::register_procs(void*)\n{\n\tregister_proc(\"cog-atom\", 1, 0, 0, C(ss_atom));\n\tregister_proc(\"cog-handle\", 1, 0, 0, C(ss_handle));\n\tregister_proc(\"cog-undefined-handle\", 0, 0, 0, C(ss_undefined_handle));\n\tregister_proc(\"cog-new-value\", 1, 0, 1, C(ss_new_value));\n\tregister_proc(\"cog-new-node\", 2, 0, 1, C(ss_new_node));\n\tregister_proc(\"cog-new-link\", 1, 0, 1, C(ss_new_link));\n\tregister_proc(\"cog-node\", 2, 0, 1, C(ss_node));\n\tregister_proc(\"cog-link\", 1, 0, 1, C(ss_link));\n\tregister_proc(\"cog-delete\", 1, 0, 1, C(ss_delete));\n\tregister_proc(\"cog-delete-recursive\", 1, 0, 1, C(ss_delete_recursive));\n\tregister_proc(\"cog-purge\", 1, 0, 1, C(ss_purge));\n\tregister_proc(\"cog-purge-recursive\", 1, 0, 1, C(ss_purge_recursive));\n\tregister_proc(\"cog-value?\", 1, 0, 1, C(ss_value_p));\n\tregister_proc(\"cog-atom?\", 1, 0, 1, C(ss_atom_p));\n\tregister_proc(\"cog-node?\", 1, 0, 1, C(ss_node_p));\n\tregister_proc(\"cog-link?\", 1, 0, 1, C(ss_link_p));\n\n\t\/\/ property setters on atoms\n\tregister_proc(\"cog-set-av!\", 2, 0, 0, C(ss_set_av));\n\tregister_proc(\"cog-set-tv!\", 2, 0, 0, C(ss_set_tv));\n\tregister_proc(\"cog-merge-tv!\", 2, 0, 0, C(ss_merge_tv));\n\tregister_proc(\"cog-merge-hi-conf-tv!\", 2, 0, 0, C(ss_merge_hi_conf_tv));\n\tregister_proc(\"cog-inc-vlti!\", 1, 0, 0, C(ss_inc_vlti));\n\tregister_proc(\"cog-dec-vlti!\", 1, 0, 0, C(ss_dec_vlti));\n\n\t\/\/ property getters on atoms\n\tregister_proc(\"cog-name\", 1, 0, 0, C(ss_name));\n\tregister_proc(\"cog-type\", 1, 0, 0, C(ss_type));\n\tregister_proc(\"cog-arity\", 1, 0, 0, C(ss_arity));\n\tregister_proc(\"cog-incoming-set\", 1, 0, 0, C(ss_incoming_set));\n\tregister_proc(\"cog-outgoing-set\", 1, 0, 0, C(ss_outgoing_set));\n\tregister_proc(\"cog-tv\", 1, 0, 0, C(ss_tv));\n\tregister_proc(\"cog-av\", 1, 0, 0, C(ss_av));\n\tregister_proc(\"cog-as\", 1, 0, 0, C(ss_as));\n\n\t\/\/ Truth-values\n\tregister_proc(\"cog-new-stv\", 2, 0, 0, C(ss_new_stv));\n\tregister_proc(\"cog-new-ctv\", 3, 0, 0, C(ss_new_ctv));\n\tregister_proc(\"cog-new-itv\", 3, 0, 0, C(ss_new_itv));\n\tregister_proc(\"cog-new-ptv\", 3, 0, 0, C(ss_new_ptv));\n\tregister_proc(\"cog-new-ftv\", 2, 0, 0, C(ss_new_ftv));\n\tregister_proc(\"cog-tv?\", 1, 0, 0, C(ss_tv_p));\n\tregister_proc(\"cog-stv?\", 1, 0, 0, C(ss_stv_p));\n\tregister_proc(\"cog-ctv?\", 1, 0, 0, C(ss_ctv_p));\n\tregister_proc(\"cog-itv?\", 1, 0, 0, C(ss_itv_p));\n\tregister_proc(\"cog-ptv?\", 1, 0, 0, C(ss_ptv_p));\n\tregister_proc(\"cog-ftv?\", 1, 0, 0, C(ss_ftv_p));\n\tregister_proc(\"cog-tv->alist\", 1, 0, 0, C(ss_tv_get_value));\n\tregister_proc(\"cog-tv-mean\", 1, 0, 0, C(ss_tv_get_mean));\n\tregister_proc(\"cog-tv-confidence\", 1, 0, 0, C(ss_tv_get_confidence));\n\tregister_proc(\"cog-tv-count\", 1, 0, 0, C(ss_tv_get_count));\n\n\t\/\/ Atom Spaces\n\tregister_proc(\"cog-new-atomspace\", 0, 1, 0, C(ss_new_as));\n\tregister_proc(\"cog-atomspace?\", 1, 0, 0, C(ss_as_p));\n\tregister_proc(\"cog-atomspace\", 0, 0, 0, C(ss_get_as));\n\tregister_proc(\"cog-set-atomspace!\", 1, 0, 0, C(ss_set_as));\n\tregister_proc(\"cog-atomspace-env\", 1, 0, 0, C(ss_as_env));\n\tregister_proc(\"cog-atomspace-uuid\", 1, 0, 0, C(ss_as_uuid));\n\tregister_proc(\"cog-atomspace-clear\", 1, 0, 0, C(ss_as_clear));\n\n\t\/\/ Attention values\n\tregister_proc(\"cog-new-av\", 3, 0, 0, C(ss_new_av));\n\tregister_proc(\"cog-av?\", 1, 0, 0, C(ss_av_p));\n\tregister_proc(\"cog-av->alist\", 1, 0, 0, C(ss_av_get_value));\n\n\t\/\/ AttentionalFocus\n\tregister_proc(\"cog-af-boundary\", 0, 0, 0, C(ss_af_boundary));\n\tregister_proc(\"cog-set-af-boundary!\", 1, 0, 0, C(ss_set_af_boundary));\n\tregister_proc(\"cog-af\", 0, 0, 0, C(ss_af));\n\n\t\/\/ Atom types\n\tregister_proc(\"cog-get-types\", 0, 0, 0, C(ss_get_types));\n\tregister_proc(\"cog-type->int\", 1, 0, 0, C(ss_get_type));\n\tregister_proc(\"cog-type?\", 1, 0, 0, C(ss_type_p));\n\tregister_proc(\"cog-value-type?\", 1, 0, 0, C(ss_value_type_p));\n\tregister_proc(\"cog-node-type?\", 1, 0, 0, C(ss_node_type_p));\n\tregister_proc(\"cog-link-type?\", 1, 0, 0, C(ss_link_type_p));\n\tregister_proc(\"cog-get-subtypes\", 1, 0, 0, C(ss_get_subtypes));\n\tregister_proc(\"cog-subtype?\", 2, 0, 0, C(ss_subtype_p));\n\n\t\/\/ Iterators\n\tregister_proc(\"cog-map-type\", 2, 0, 0, C(ss_map_type));\n}\n\nvoid SchemeSmob::register_proc(const char* name, int req, int opt, int rst, scm_t_subr fcn)\n{\n\tscm_c_define_gsubr(name, req, opt, rst, fcn);\n\tscm_c_export(name, NULL);\n}\n\n#endif\n\/* ===================== END OF FILE ============================ *\/\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n\n#include <Bull\/Window\/JoystickManager.hpp>\n\nnamespace Bull\n{\n namespace prv\n {\n JoystickManager::JoystickManager() :\n m_keyrepeat(true),\n m_threshold(0.f),\n m_repeatDelay(0.f)\n {\n \/\/\/ Nothing\n }\n\n void JoystickManager::processEvents(std::queue<WindowEvent>& eventQueue)\n {\n for(unsigned int i = 0; i < Joystick::Count; i++)\n {\n processJoystick(i, eventQueue);\n }\n }\n\n void JoystickManager::enableKeyRepeat(bool enable)\n {\n m_keyrepeat = enable;\n }\n\n bool JoystickManager::isKeyRepeatEnable() const\n {\n return m_keyrepeat;\n }\n\n void JoystickManager::setThreshold(float threshold)\n {\n m_threshold = threshold;\n }\n\n float JoystickManager::getThreshold() const\n {\n return m_threshold;\n }\n\n void JoystickManager::setRepeatDelay(const Time& delay)\n {\n m_repeatDelay = delay;\n }\n\n const Time& JoystickManager::getRepeatDelay()\n {\n return m_repeatDelay;\n }\n\n void JoystickManager::processJoystick(Uint8 joystick, std::queue<WindowEvent>& eventQueue)\n {\n JoystickState state(joystick);\n JoystickState cached = m_stateCache[joystick];\n\n if(!state.connected && !cached.connected)\n {\n return;\n }\n\n if(state.connected != cached.connected)\n {\n WindowEvent e;\n\n e.type = (state.connected) ? WindowEvent::JoystickConnected : WindowEvent::JoystickDisconnected;\n\n e.joystickConnection.joystick = joystick;\n\n eventQueue.push(e);\n }\n\n for(unsigned int i = 0; i < state.buttons.size(); i++)\n {\n if(cached.buttons[i].second.isRunning())\n {\n state.buttons[i].second = cached.buttons[i].second;\n }\n\n if(state.buttons[i].first != cached.buttons[i].first)\n {\n WindowEvent e;\n e.type = (state.buttons[i].first) ? WindowEvent::JoystickButtonDown : WindowEvent::JoystickButtonUp;\n\n e.joystickButton.joystick = joystick;\n e.joystickButton.button = static_cast<Uint8>(i);\n\n eventQueue.push(e);\n\n if(e.type == WindowEvent::JoystickButtonDown)\n {\n state.buttons[i].second.start();\n }\n else\n {\n state.buttons[i].second.restart();\n }\n }\n else if(state.buttons[i].first &&\n cached.buttons[i].first &&\n m_keyrepeat &&\n cached.buttons[i].second.getElapsedTime() > m_repeatDelay)\n {\n WindowEvent e;\n e.type = WindowEvent::JoystickButtonDown;\n\n e.joystickButton.joystick = joystick;\n e.joystickButton.button = static_cast<Uint8>(i);\n\n eventQueue.push(e);\n\n state.buttons[i].second.restart();\n }\n }\n\n for(unsigned int i = 0; i < state.axes.size(); i++)\n {\n float relative = state.axes[i] - cached.axes[i];\n\n if(state.axes[i] != cached.axes[i] && std::abs(relative) > m_threshold)\n {\n WindowEvent e;\n\n e.type = WindowEvent::JoystickMoved;\n\n e.joystickMoved.joystick = joystick;\n e.joystickMoved.axis = static_cast<Joystick::Axis>(i);\n e.joystickMoved.position = state.axes[i];\n e.joystickMoved.relative = relative;\n\n eventQueue.push(e);\n }\n }\n\n m_stateCache[joystick] = state;\n }\n }\n}\n<commit_msg>[Core\/NonMovable] Add NonMovable pattern<commit_after>#include <cmath>\n\n#include <Bull\/Window\/JoystickManager.hpp>\n\nnamespace Bull\n{\n namespace prv\n {\n JoystickManager::JoystickManager() :\n m_keyrepeat(true),\n m_threshold(0.f),\n m_repeatDelay(0.f)\n {\n \/\/\/ Nothing\n }\n\n void JoystickManager::processEvents(std::queue<WindowEvent>& eventQueue)\n {\n for(Uint8 i = 0; i < Joystick::Count; i++)\n {\n processJoystick(i, eventQueue);\n }\n }\n\n void JoystickManager::enableKeyRepeat(bool enable)\n {\n m_keyrepeat = enable;\n }\n\n bool JoystickManager::isKeyRepeatEnable() const\n {\n return m_keyrepeat;\n }\n\n void JoystickManager::setThreshold(float threshold)\n {\n m_threshold = threshold;\n }\n\n float JoystickManager::getThreshold() const\n {\n return m_threshold;\n }\n\n void JoystickManager::setRepeatDelay(const Time& delay)\n {\n m_repeatDelay = delay;\n }\n\n const Time& JoystickManager::getRepeatDelay()\n {\n return m_repeatDelay;\n }\n\n void JoystickManager::processJoystick(Uint8 joystick, std::queue<WindowEvent>& eventQueue)\n {\n JoystickState state(joystick);\n JoystickState cached = m_stateCache[joystick];\n\n if(!state.connected && !cached.connected)\n {\n return;\n }\n\n if(state.connected != cached.connected)\n {\n WindowEvent e;\n\n e.type = (state.connected) ? WindowEvent::JoystickConnected : WindowEvent::JoystickDisconnected;\n\n e.joystickConnection.joystick = joystick;\n\n eventQueue.push(e);\n }\n\n for(unsigned int i = 0; i < state.buttons.size(); i++)\n {\n if(cached.buttons[i].second.isRunning())\n {\n state.buttons[i].second = cached.buttons[i].second;\n }\n\n if(state.buttons[i].first != cached.buttons[i].first)\n {\n WindowEvent e;\n e.type = (state.buttons[i].first) ? WindowEvent::JoystickButtonDown : WindowEvent::JoystickButtonUp;\n\n e.joystickButton.joystick = joystick;\n e.joystickButton.button = static_cast<Uint8>(i);\n\n eventQueue.push(e);\n\n if(e.type == WindowEvent::JoystickButtonDown)\n {\n state.buttons[i].second.start();\n }\n else\n {\n state.buttons[i].second.restart();\n }\n }\n else if(state.buttons[i].first &&\n cached.buttons[i].first &&\n m_keyrepeat &&\n cached.buttons[i].second.getElapsedTime() > m_repeatDelay)\n {\n WindowEvent e;\n e.type = WindowEvent::JoystickButtonDown;\n\n e.joystickButton.joystick = joystick;\n e.joystickButton.button = static_cast<Uint8>(i);\n\n eventQueue.push(e);\n\n state.buttons[i].second.restart();\n }\n }\n\n for(unsigned int i = 0; i < state.axes.size(); i++)\n {\n float relative = state.axes[i] - cached.axes[i];\n\n if(state.axes[i] != cached.axes[i] && std::abs(relative) > m_threshold)\n {\n WindowEvent e;\n\n e.type = WindowEvent::JoystickMoved;\n\n e.joystickMoved.joystick = joystick;\n e.joystickMoved.axis = static_cast<Joystick::Axis>(i);\n e.joystickMoved.position = state.axes[i];\n e.joystickMoved.relative = relative;\n\n eventQueue.push(e);\n }\n }\n\n m_stateCache[joystick] = state;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\/\/ Copyright (c) 2018 Intel Corporation\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n*\/\n\n#include <iomanip>\n#include <vector>\n#include <memory>\n#include <string>\n#include <cstdlib>\n#include <vector>\n\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <inference_engine.hpp>\n\n\/\/ window height and width 4:3 ratio\n#define WINDOW_WIDTH 640\n#define WINDOW_HEIGHT 480\n#define WINDOW_NAME \"simple_classifier_cpp_camera - Press any key to quit\"\n\nusing namespace InferenceEngine;\n\n#define TEXTGREEN '\\033[1;32m'\n#define TEXTRED '\\033[1;31m'\n#define TEXTNOCOLOR '\\033[0m'\n#define TEXTYELLOW '\\033[1;33m'\n\nconst std::string DEVICE = \"MYRIAD\";\nstd::vector<std::string> labels;\nconst unsigned int MAX_PATH = 256;\n\nconst int FONT = cv::FONT_HERSHEY_SIMPLEX;\nconst float FONT_SIZE = 0.5;\nconst cv::Scalar BLUE = cv::Scalar(255, 0, 0, 255);\nconst cv::Scalar GREEN = cv::Scalar(0, 255, 0, 255);\nunsigned int SKIP_AFTER = 5;\n\nvoid getNetworkLabels(std::string labelsDir, std::vector<std::string>* labelsVector)\n{\n char filename[MAX_PATH];\n strncpy(filename, labelsDir.c_str(), MAX_PATH);\n FILE* cat_file = fopen(filename, \"r\");\n if (cat_file == nullptr) {\n std::cerr << \"Could not find Category file.\" << std::endl;\n exit(1);\n }\n\n char cat_line[255];\n while (fgets(cat_line , 255 , cat_file) != NULL) {\n if (cat_line[strlen(cat_line) - 1] == '\\n')\n cat_line[strlen(cat_line) - 1] = '\\0';\n labelsVector->push_back(std::string(cat_line));\n }\n fclose (cat_file);\n}\n\n\nint main(int argc, char *argv[]) {\n try {\n if (argc != 3) {\n std::cout << \"Usage : .\/simple_classifier_cpp_camera <path_to_model> <path_to_labels>\" << std::endl;\n return EXIT_FAILURE;\n }\n std::cout << \"\\n Press any key to quit.\\n\";\n const std::string input_model{argv[1]};\n const std::string labels_file{argv[2]};\n\n cv::Mat frame;\n int key;\n cv::VideoCapture capture;\n \n \/\/ Set up the camera\n capture.open(0);\n capture.set(cv::CAP_PROP_FRAME_WIDTH, WINDOW_WIDTH);\n capture.set(cv::CAP_PROP_FRAME_HEIGHT, WINDOW_HEIGHT);\n\n \/\/ Set up the display window\n cv::namedWindow(WINDOW_NAME, cv::WINDOW_AUTOSIZE);\n cv::resizeWindow(WINDOW_NAME, WINDOW_WIDTH, WINDOW_HEIGHT);\n cv::moveWindow(WINDOW_NAME, 0, 0);\n\n \/\/ Create the ie core object\n Core ie;\n\n \/\/ --------------------Load IR Generated by ModelOptimizer (.xml and .bin files)------------------------\n \/\/ Read the xml and bin files, set the batch size and get the network object\n CNNNetReader network_reader;\n network_reader.ReadNetwork(input_model);\n network_reader.ReadWeights(input_model.substr(0, input_model.size() - 4) + \".bin\");\n network_reader.getNetwork().setBatchSize(1);\n CNNNetwork network = network_reader.getNetwork();\n\n \/\/ -----------------------------Prepare input blobs-----------------------------------------------------\n \n auto input_info = network.getInputsInfo().begin()->second;\n \/\/ Get the input node name\n auto input_name = network.getInputsInfo().begin()->first;\n\n input_info->setPrecision(Precision::U8);\n\n \/\/ ---------------------------Prepare output blobs------------------------------------------------------\n\n auto output_info = network.getOutputsInfo().begin()->second;\n \/\/ Get the output node name\n auto output_name = network.getOutputsInfo().begin()->first;\n\n output_info->setPrecision(Precision::FP32);\n\n \/\/ -------------------------Loading model to the plugin and then infer----------------------------------\n \/\/ Create executable network object by loading the network via ie core api\n auto executable_network = ie.LoadNetwork(network, DEVICE);\n \/\/ Create the inference request\n auto infer_request = executable_network.CreateInferRequestPtr();\n \/\/ Set the precision for the input\n auto input = infer_request->GetBlob(input_name);\n auto input_data = input->buffer().as<PrecisionTrait<Precision::U8>::value_type*>();\n \n \/\/ Get various input dimension values\n unsigned int channels_number = input->getTensorDesc().getDims().at(1);\n unsigned int net_input_height = input->getTensorDesc().getDims().at(2);\n unsigned int net_input_width = input->getTensorDesc().getDims().at(3);\n \n unsigned int frame_count = 0;\n \/\/ Main loop\n while (true)\n {\n \/\/ Read a frame\n capture >> frame;\n if (frame_count++ >= SKIP_AFTER) {\n \t capture >> frame;\n frame_count = 0;\n }\n \/\/ Flip the image horizontally\n cv::flip(frame, frame, 1);\n cv::Mat imgInput;\n \/\/ Image preprocessing\n cv::resize(frame, imgInput, cv::Size(net_input_height, net_input_width));\n \/\/ Buffer for input\n size_t image_size = net_input_height * net_input_width;\n \/\/ Fill the buffer with the input image data\n for (size_t pid = 0; pid < image_size; ++pid) {\n for (size_t ch = 0; ch < channels_number; ++ch) {\n input_data[ch * image_size + pid] = imgInput.at<cv::Vec3b>(pid)[ch];\n }\n }\n\n \/* Running the request synchronously *\/\n infer_request->StartAsync();\n if (OK == infer_request->Wait(IInferRequest::WaitMode::RESULT_READY)) {\n \/\/ ---------------------------Postprocess output blobs--------------------------------------------------\n \/\/ Get the inference results\n auto output = infer_request->GetBlob(output_name);\n auto output_data = output->buffer().as<PrecisionTrait<Precision::FP32>::value_type*>();\n \/\/ How many results should we display?\n unsigned int results_to_display = 1;\n \n \/* This is to sort output probabilities and put it to results vector *\/\n std::vector<unsigned> results;\n TopResults(results_to_display, *output, results);\n \n \/\/ Read the network labels\n getNetworkLabels(labels_file, &labels);\n \n \/\/ Get the top result\n auto result = output_data[results[0]];\n \/\/ Put together the result text that we will display\n std::string resultText = labels[results.at(0)] + \" - \" + std::to_string((int)(result*100)) + \"%\";\n \/\/ Determine the text size\n cv::Size text_size = cv::getTextSize(resultText, cv::FONT_HERSHEY_SIMPLEX, FONT_SIZE, 0, 0);\n \/\/ Draw a gray rectangle for text background\n cv::rectangle(frame, cv::Point2f(0,WINDOW_HEIGHT-20), cv::Point2f(WINDOW_WIDTH, WINDOW_HEIGHT), cv::Scalar(75,75,75), cv::FILLED);\n \/\/ Calculate the coordinate to print the text so that the text is centered\n int print_text_width = (int)((WINDOW_WIDTH - text_size.width)\/2);\n \/\/ Put the text in the frame\n cv::putText(frame, resultText, cv::Point2f(print_text_width, WINDOW_HEIGHT-5), FONT, FONT_SIZE, GREEN, 1); \n }\n \/\/ Display the image in the window\n imshow(WINDOW_NAME, frame);\n \n \/\/ If the user presses the break key exit the loop\n key = cv::waitKey(1);\n if (key != -1) {\n break;\n }\n }\n cv::destroyAllWindows();\n } catch (const std::exception & ex) {\n std::cerr << ex.what() << std::endl;\n return EXIT_FAILURE;\n }\n std::cout << \"\\n Finished.\\n\";\n return EXIT_SUCCESS;\n}\n\n<commit_msg>Rewritten to get rid of apache license<commit_after>\/\/ Simple classifier cpp camera\n\n#include <opencv2\/opencv.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <inference_engine.hpp>\n#include <vector>\n\nusing namespace InferenceEngine;\n\n#define DEVICE \"MYRIAD\"\n\n\/\/ window properties\n#define WINDOW_NAME \"simple_classifier_cpp_camera - Press any key to quit\"\n#define WINDOW_WIDTH 640\n#define WINDOW_HEIGHT 480\n\n\/\/ text properties\nconst int FONT = cv::FONT_HERSHEY_SIMPLEX;\nconst float FONT_SIZE = 0.5;\nconst cv::Scalar BLUE = cv::Scalar(255, 0, 0, 255);\nconst cv::Scalar GREEN = cv::Scalar(0, 255, 0, 255);\n\nstd::vector<std::string> labels;\nconst unsigned int MAX_PATH = 256;\nunsigned int SKIP_AFTER = 5;\n\n\/\/ *************************************************************************\n\/\/ Read the network labels from the provided labels file\n\/\/ *************************************************************************\nvoid getNetworkLabels(std::string labelsDir, std::vector<std::string>* labelsVector)\n{\n char filename[MAX_PATH];\n strncpy(filename, labelsDir.c_str(), MAX_PATH);\n FILE* cat_file = fopen(filename, \"r\");\n if (cat_file == nullptr) {\n std::cerr << \"Could not find Category file.\" << std::endl;\n exit(1);\n }\n\n char cat_line[255];\n while (fgets(cat_line , 255 , cat_file) != NULL) {\n if (cat_line[strlen(cat_line) - 1] == '\\n')\n cat_line[strlen(cat_line) - 1] = '\\0';\n labelsVector->push_back(std::string(cat_line));\n }\n fclose (cat_file);\n}\n\n\/\/ *************************************************************************\n\/\/ Entrypoint for the application\n\/\/ *************************************************************************\nint main(int argc, char *argv[]) {\n cv::Mat imgInput;\n unsigned int frameCount = 0;\n \n if (argc != 3) {\n std::cout << \" .\/simple_classifier_cpp <XML FILE> <LABELS> \";\n exit(1);\n }\n \/\/ Get all of the parameters that we need to run the inference\n std::string XML = argv[1];\n std::string BIN = XML.substr(0, XML.length()-3) + \"bin\";\n std::string LABELS = argv[2];\n \n cv::Mat frame;\n int key;\n cv::VideoCapture capture;\n\n \/\/ Set up the camera\n capture.open(0);\n capture.set(cv::CAP_PROP_FRAME_WIDTH, WINDOW_WIDTH);\n capture.set(cv::CAP_PROP_FRAME_HEIGHT, WINDOW_HEIGHT);\n\n \/\/ Set up the display window\n cv::namedWindow(WINDOW_NAME, cv::WINDOW_AUTOSIZE);\n cv::resizeWindow(WINDOW_NAME, WINDOW_WIDTH, WINDOW_HEIGHT);\n cv::moveWindow(WINDOW_NAME, 0, 0);\n \n \/\/ Read the labels\n getNetworkLabels(LABELS, &labels);\n \n \/\/ ----------------------- Create IE core object and read the network ----------------------- \/\/\n \/\/ Create the inference engine core object\n Core ie_core;\n \/\/ Create a network reader and read in the network and weights\n CNNNetReader networkReader;\n networkReader.ReadNetwork(XML);\n networkReader.ReadWeights(BIN);\n auto network = networkReader.getNetwork();\n \n \/\/ ----------------------- Set up the network input ----------------------- \/\/\n InputsDataMap inputDataMap(network.getInputsInfo());\n InputInfo::Ptr& inputInfo = inputDataMap.begin()->second;\n \/\/ Get the input node name\n std::string inputLayerName = inputDataMap.begin()->first;\n \/\/ Set precision for the input\n inputInfo->setPrecision(Precision::U8);\n\n \/\/ ----------------------- Set up the network output ----------------------- \/\/\n OutputsDataMap outputDataMap(network.getOutputsInfo());\n auto outputData = outputDataMap.begin()->second;\n \/\/ Get the output node name\n std::string outputLayerName = outputDataMap.begin()->first;\n \/\/ Set precision for output\n outputData->setPrecision(Precision::FP32);\n \n \/\/ ----------------------- Load the network and create the inference request ----------------------- \/\/\n \/\/ Load the network to the device (default: Myriad)\n auto executableNetwork = ie_core.LoadNetwork(network, DEVICE);\n \/\/ Create the inference request\n auto inferenceRequest = executableNetwork.CreateInferRequestPtr();\n \n \/\/ ----------------------- 5. Prepare the input data ----------------------- \/\/\n \/\/ Create buffer to hold input data\n auto inputBlob = inferenceRequest->GetBlob(inputLayerName);\n auto inputData = inputBlob->buffer().as<PrecisionTrait<Precision::U8>::value_type*>();\n \n \/\/ Get the input dimensions for the network\n auto inputDims = inferenceRequest->GetBlob(inputLayerName)->getTensorDesc().getDims();\n unsigned int inputNumberOfChannels = inputDims.at(1);\n unsigned int inputHeight = inputDims.at(2);\n unsigned int inputWidth = inputDims.at(3);\n \n while (true) {\n \n \/\/ Use OpenCV to read in an image\n \n capture >> frame;\n if (frameCount++ >= SKIP_AFTER) {\n capture >> frame;\n frameCount = 0;\n }\n \/\/ Flip the image horizontally\n cv::flip(frame, frame, 1);\n \/\/ Resize the input image in accordance to the network input size\n cv::resize(frame, imgInput, cv::Size(inputHeight, inputWidth));\n \n \/\/ Prepare to fill the buffer with the image data\n size_t imageSize = inputHeight * inputWidth;\n \/\/ Fills buffer with the image data. This data will be sent to the device for inference\n for (size_t pixelIndex = 0; pixelIndex < imageSize; ++pixelIndex) {\n for (size_t channel = 0; channel < inputNumberOfChannels; ++channel) {\n inputData[channel * imageSize + pixelIndex] = imgInput.at<cv::Vec3b>(pixelIndex)[channel];\n }\n }\n \n \/\/ ----------------------- 6. Make the inference ----------------------- \/\/\n inferenceRequest->StartAsync();\n if (OK == inferenceRequest->Wait(IInferRequest::WaitMode::RESULT_READY)) {\n \/\/ ----------------------- 7. Process the results ----------------------- \/\/\n \/\/ Get the inference results\n auto inferenceResults = inferenceRequest->GetBlob(outputLayerName);\n \/\/ Get all of the confidence scores. \n auto scores = inferenceResults->buffer().as<PrecisionTrait<Precision::FP32>::value_type*>(); \n\n \/\/ Sort the results and get the number of desired top results\n std::vector<unsigned> sortedResults; \/\/ This vector will hold all of the top sorted results\n unsigned int resultsToDisplay = 1; \/\/ How many results should return?\n TopResults(resultsToDisplay, *inferenceResults, sortedResults);\n\n \/\/ Get the top result\n auto topScore = scores[sortedResults[0]] * 100;\n \/\/ Put together the result text that we will display\n std::string resultText = labels[sortedResults.at(0)] + \" - \" + std::to_string((int)(topScore)) + \"%\";\n \/\/ Determine the text size\n cv::Size textSize = cv::getTextSize(resultText, cv::FONT_HERSHEY_SIMPLEX, FONT_SIZE, 0, 0);\n \/\/ Draw a gray rectangle for text background\n cv::rectangle(frame, cv::Point2f(0,WINDOW_HEIGHT-20), cv::Point2f(WINDOW_WIDTH, WINDOW_HEIGHT), cv::Scalar(75,75,75), cv::FILLED);\n \/\/ Calculate the coordinate to print the text so that the text is centered\n int printTextWidth = (int)((WINDOW_WIDTH - textSize.width)\/2);\n \/\/ Put the text in the frame\n cv::putText(frame, resultText, cv::Point2f(printTextWidth, WINDOW_HEIGHT-5), FONT, FONT_SIZE, GREEN, 1);\n }\n \n \/\/ Display the image in the window\n imshow(WINDOW_NAME, frame);\n \n \/\/ If the user presses the break key exit the loop\n key = cv::waitKey(1);\n if (key != -1) {\n break; \n }\n }\n cv::destroyAllWindows();\n std::cout << \"\\n Finished.\\n\"; \n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xlfd_extd.hxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: vg $ $Date: 2003-04-15 16:11:13 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef XLFD_EXTENDED_HXX\n#define XLFD_EXTENDED_HXX\n\n#ifndef _SALUNX_H\n#include <salunx.h>\n#endif\n#ifndef _VCL_VCLENUM_HXX\n#include <enum.hxx>\n#endif\n\nclass Xlfd;\nclass AttributeProvider;\nclass ImplFontData;\nclass ByteString;\n\n\/\/ --------------------------------------------------------------------------\n\/\/\n\/\/ classes for Xlfd handling that contain more than a single encoding.\n\/\/ Members that may vary through different encodings are stored in\n\/\/ a mpEncodingInfo member. There are three different classes:\n\/\/ true scalable fonts (truetype and type1) scalable bitmap fonts\n\/\/ (the ugly ones) and bitmap fonts. The ExtendedXlfd stores all the members\n\/\/ that are specific to a font outline\n\/\/ ( e.g. adobe-times-roman-medium-r-normal- * -p- * )\n\/\/ and specifies the interface.\n\/\/\n\/\/ --------------------------------------------------------------------------\n\n\/\/ base class\n\nclass VirtualXlfd;\nclass XlfdStorage;\n\nclass ExtendedXlfd {\n\n friend VirtualXlfd;\n friend XlfdStorage;\n\n public:\n ExtendedXlfd();\n virtual ~ExtendedXlfd();\n virtual Bool AddEncoding( const Xlfd *pXlfd );\n Bool HasEncoding( rtl_TextEncoding nEncoding ) const;\n int GetEncodingIdx( rtl_TextEncoding nEncoding ) const;\n unsigned short NumEncodings() const\n { return mnEncodings; }\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const ;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const { return TYPE_DONTKNOW; }\n FontFamily GetFamily() const;\n FontWeight GetWeight() const;\n FontItalic GetItalic() const;\n FontWidth GetWidth() const;\n virtual FontPitch GetSpacing() const;\n virtual FontPitch GetSpacing( rtl_TextEncoding nEnc ) const;\n rtl_TextEncoding GetAsciiEncoding( int *pAsciiRange = NULL ) const;\n rtl_TextEncoding GetEncoding() const;\n rtl_TextEncoding GetEncoding( int i ) const;\n\n int GetFontCodeRanges( sal_uInt32* pCodePairs ) const;\n\n #if OSL_DEBUG_LEVEL > 1\n void Dump() const;\n #endif\n\n protected:\n\n AttributeProvider* mpFactory;\n\n #ifdef GCC\n public:\n #endif\n\n unsigned short mnFoundry;\n unsigned short mnFamily;\n unsigned short mnWeight;\n unsigned short mnSlant;\n unsigned short mnSetwidth;\n\n #ifdef GCC\n protected:\n #endif\n\n unsigned short mnEncodings;\n struct EncodingInfo {\n unsigned char mcSpacing;\n unsigned short mnResolutionX;\n unsigned short mnResolutionY;\n unsigned short mnAddstyle;\n unsigned short mnCharset;\n\n rtl_TextEncoding mnEncoding;\n\n EncodingInfo& operator= ( const Xlfd *pXlfd );\n EncodingInfo& operator= ( const EncodingInfo& rInfo );\n } *mpEncodingInfo;\n};\n\n\/\/ class to handle scalable bitmap fonts\n\nclass ScalableBitmapXlfd : public ExtendedXlfd {\n\n public:\n ScalableBitmapXlfd();\n virtual ~ScalableBitmapXlfd();\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n};\n\n\/\/ class to handle true bitmap fonts\n\nclass ScalableXlfd;\n\nclass BitmapXlfd : public ExtendedXlfd {\n\n public:\n BitmapXlfd();\n ~BitmapXlfd();\n Bool AddEncoding( const Xlfd *pXlfd );\n Bool AddEncoding( const ScalableXlfd *pXlfd );\n unsigned short GetPixelSize() const\n { return mnPixelSize; }\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_RASTER; }\n protected:\n\n unsigned short mnPixelSize;\n unsigned short mnPointSize;\n unsigned short mnAverageWidth;\n};\n\n\/\/ class to handle true scalable fonts\n\nclass ScalableXlfd : public ExtendedXlfd {\n\n friend class BitmapXlfd;\n\n public:\n ScalableXlfd();\n virtual ~ScalableXlfd();\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n};\n\n\/\/ class to maintain a list of fonts ( bitmap and scalable )\n\nclass XlfdStorage {\n\n public:\n XlfdStorage();\n ~XlfdStorage();\n\n void Dispose();\n void Reset();\n\n void Add( const ExtendedXlfd *pXlfd );\n void Add( const XlfdStorage *pXlfd );\n unsigned short GetCount() const\n { return mnCount; }\n const ExtendedXlfd* Get(int nIdx) const;\n #if OSL_DEBUG_LEVEL > 1\n void Dump() const ;\n #endif\n\n protected:\n\n void Enlarge();\n\n unsigned short mnCount;\n unsigned short mnSize;\n const ExtendedXlfd**\n mpList;\n};\n\n\/\/ list of fonts specific for bitmap fonts\n\nclass BitmapXlfdStorage : public XlfdStorage {\n\n public:\n\n void AddBitmapFont( const Xlfd *pXlfd );\n};\n\n\n\/* Virtual font for User Interface *\/\n\nclass VirtualXlfd : public ExtendedXlfd\n{\n private:\n\n int GetFontQuality (unsigned short nFamily);\n\n public:\n VirtualXlfd();\n virtual ~VirtualXlfd();\n virtual Bool AddEncoding( const Xlfd *pXlfd );\n void FilterInterfaceFont (const Xlfd *pXlfd);\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const ;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n protected:\n\n struct ExtEncodingInfo {\n\n unsigned short mnFoundry;\n unsigned short mnFamily;\n unsigned short mnWeight;\n unsigned short mnSlant;\n unsigned short mnSetwidth;\n\n ExtEncodingInfo& operator= ( const Xlfd *pXlfd );\n ExtEncodingInfo& operator= ( const ExtEncodingInfo& rInfo );\n } *mpExtEncodingInfo;\n\n friend class ExtEncodingInfo;\n};\n\n#endif \/* XLFD_EXTENDED_HXX *\/\n\n<commit_msg>INTEGRATION: CWS geordi2q10 (1.9.208); FILE MERGED 2003\/11\/27 10:28:52 rt 1.9.208.1: #111934#: join CWS vcl7pp1r2<commit_after>\/*************************************************************************\n *\n * $RCSfile: xlfd_extd.hxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2003-12-01 09:58:25 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef XLFD_EXTENDED_HXX\n#define XLFD_EXTENDED_HXX\n\n#ifndef _SALUNX_H\n#include <salunx.h>\n#endif\n#ifndef _VCL_VCLENUM_HXX\n#include <enum.hxx>\n#endif\n\nclass Xlfd;\nclass AttributeProvider;\nclass ImplFontData;\nclass ByteString;\n\n\/\/ --------------------------------------------------------------------------\n\/\/\n\/\/ classes for Xlfd handling that contain more than a single encoding.\n\/\/ Members that may vary through different encodings are stored in\n\/\/ a mpEncodingInfo member. There are three different classes:\n\/\/ true scalable fonts (truetype and type1) scalable bitmap fonts\n\/\/ (the ugly ones) and bitmap fonts. The ExtendedXlfd stores all the members\n\/\/ that are specific to a font outline\n\/\/ ( e.g. adobe-times-roman-medium-r-normal- * -p- * )\n\/\/ and specifies the interface.\n\/\/\n\/\/ --------------------------------------------------------------------------\n\n\/\/ base class\n\nclass VirtualXlfd;\nclass XlfdStorage;\n\nclass ExtendedXlfd {\n\n friend VirtualXlfd;\n friend XlfdStorage;\n\n public:\n ExtendedXlfd();\n virtual ~ExtendedXlfd();\n virtual Bool AddEncoding( const Xlfd *pXlfd );\n Bool HasEncoding( rtl_TextEncoding nEncoding ) const;\n int GetEncodingIdx( rtl_TextEncoding nEncoding ) const;\n unsigned short NumEncodings() const\n { return mnEncodings; }\n virtual unsigned short GetPixelSize( int nOrigPixelSize ) const\n { return nOrigPixelSize; }\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const ;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const { return TYPE_DONTKNOW; }\n FontFamily GetFamily() const;\n FontWeight GetWeight() const;\n FontItalic GetItalic() const;\n FontWidth GetWidth() const;\n virtual FontPitch GetSpacing() const;\n virtual FontPitch GetSpacing( rtl_TextEncoding nEnc ) const;\n rtl_TextEncoding GetAsciiEncoding( int *pAsciiRange = NULL ) const;\n rtl_TextEncoding GetEncoding() const;\n rtl_TextEncoding GetEncoding( int i ) const;\n\n int GetFontCodeRanges( sal_uInt32* pCodePairs ) const;\n\n #if OSL_DEBUG_LEVEL > 1\n void Dump() const;\n #endif\n\n protected:\n\n AttributeProvider* mpFactory;\n\n #ifdef GCC\n public:\n #endif\n\n unsigned short mnFoundry;\n unsigned short mnFamily;\n unsigned short mnWeight;\n unsigned short mnSlant;\n unsigned short mnSetwidth;\n\n #ifdef GCC\n protected:\n #endif\n\n unsigned short mnEncodings;\n struct EncodingInfo {\n unsigned char mcSpacing;\n unsigned short mnResolutionX;\n unsigned short mnResolutionY;\n unsigned short mnAddstyle;\n unsigned short mnCharset;\n\n rtl_TextEncoding mnEncoding;\n\n EncodingInfo& operator= ( const Xlfd *pXlfd );\n EncodingInfo& operator= ( const EncodingInfo& rInfo );\n } *mpEncodingInfo;\n};\n\n\/\/ class to handle scalable bitmap fonts\n\nclass ScalableBitmapXlfd : public ExtendedXlfd {\n\n public:\n ScalableBitmapXlfd();\n virtual ~ScalableBitmapXlfd();\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n};\n\n\/\/ class to handle true bitmap fonts\n\nclass ScalableXlfd;\n\nclass BitmapXlfd : public ExtendedXlfd {\n\n public:\n BitmapXlfd();\n ~BitmapXlfd();\n Bool AddEncoding( const Xlfd *pXlfd );\n Bool AddEncoding( const ScalableXlfd *pXlfd );\n virtual unsigned short GetPixelSize( int ) const\n { return mnPixelSize; }\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_RASTER; }\n protected:\n\n unsigned short mnPixelSize;\n unsigned short mnPointSize;\n unsigned short mnAverageWidth;\n};\n\n\/\/ class to handle true scalable fonts\n\nclass ScalableXlfd : public ExtendedXlfd {\n\n friend class BitmapXlfd;\n\n public:\n ScalableXlfd();\n virtual ~ScalableXlfd();\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n};\n\n\/\/ class to maintain a list of fonts ( bitmap and scalable )\n\nclass XlfdStorage {\n\n public:\n XlfdStorage();\n ~XlfdStorage();\n\n void Dispose();\n void Reset();\n\n void Add( const ExtendedXlfd *pXlfd );\n void Add( const XlfdStorage *pXlfd );\n unsigned short GetCount() const\n { return mnCount; }\n const ExtendedXlfd* Get(int nIdx) const;\n #if OSL_DEBUG_LEVEL > 1\n void Dump() const ;\n #endif\n\n protected:\n\n void Enlarge();\n\n unsigned short mnCount;\n unsigned short mnSize;\n const ExtendedXlfd**\n mpList;\n};\n\n\/\/ list of fonts specific for bitmap fonts\n\nclass BitmapXlfdStorage : public XlfdStorage {\n\n public:\n\n void AddBitmapFont( const Xlfd *pXlfd );\n};\n\n\n\/* Virtual font for User Interface *\/\n\nclass VirtualXlfd : public ExtendedXlfd\n{\n private:\n\n int GetFontQuality (unsigned short nFamily);\n\n public:\n VirtualXlfd();\n virtual ~VirtualXlfd();\n virtual Bool AddEncoding( const Xlfd *pXlfd );\n void FilterInterfaceFont (const Xlfd *pXlfd);\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n rtl_TextEncoding nEncoding ) const ;\n virtual void ToString( ByteString &rString,\n unsigned short nPixelSize,\n char* pMatricsString,\n rtl_TextEncoding nEncoding ) const;\n\n virtual void ToImplFontData( ImplFontData *pFontData ) const ;\n virtual FontType GetFontType() const\n { return TYPE_SCALABLE; }\n protected:\n\n struct ExtEncodingInfo {\n\n unsigned short mnFoundry;\n unsigned short mnFamily;\n unsigned short mnWeight;\n unsigned short mnSlant;\n unsigned short mnSetwidth;\n\n ExtEncodingInfo& operator= ( const Xlfd *pXlfd );\n ExtEncodingInfo& operator= ( const ExtEncodingInfo& rInfo );\n } *mpExtEncodingInfo;\n\n friend class ExtEncodingInfo;\n};\n\n#endif \/* XLFD_EXTENDED_HXX *\/\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkImage.h\"\n#include \"mitkAbstractTransformGeometry.h\"\n#include \"mitkPlaneGeometry.h\"\n#include \"mitkTimeSlicedGeometry.h\"\n#include \"mitkSlicedGeometry3D.h\"\n\n#include <vtkSphericalTransform.h>\n\n#include <fstream>\n\nint mitkAbstractTransformGeometryTest(int argc, char* argv[])\n{\n mitk::Point3D origin;\n mitk::Vector3D right, bottom;\n mitk::ScalarType width, height;\n mitk::ScalarType widthInMM, heightInMM;\n\n std::cout << \"Initializing an x-\/y-plane (xyPlane) as parameter plane by InitializeStandardPlane(rightVector, downVector, spacing = NULL): \"<<std::endl;\n mitk::PlaneGeometry::Pointer xyPlane = mitk::PlaneGeometry::New();\n width = 100; widthInMM = width;\n height = 200; heightInMM = height;\n mitk::ScalarType bounds[6] = {0, width, 0, height, 0, 1};\n mitk::FillVector3D(origin, 4.5, 7.3, 11.2);\n mitk::FillVector3D(right, widthInMM, 0, 0);\n mitk::FillVector3D(bottom, 0, heightInMM, 0);\n xyPlane->InitializeStandardPlane(right, bottom);\n xyPlane->SetOrigin(origin);\n xyPlane->SetSizeInUnits(width, height);\n\n std::cout << \"Creating AbstractTransformGeometry: \" <<std::endl;\n mitk::AbstractTransformGeometry::Pointer abstractgeometry=mitk::AbstractTransformGeometry::New();\n\n std::cout << \"Setting xyPlane as parameter plane of AbstractTransformGeometry: \"<<std::endl;\n abstractgeometry->SetPlane(xyPlane);\n\n std::cout << \"Testing whether the bounds of xyPlane and the parametric bounds of AbstractTransformGeometry are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(xyPlane->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(xyPlane->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing whether the parametic bounds of AbstractTransformGeometry and the bounds of the plane accessed from there are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Change parametic bounds of AbstractTransformGeometry and test whether they are equal to the bounds of the plane accessed from there: \"<<std::endl;\n height = 300;\n bounds[3] = height;\n abstractgeometry->SetParametricBounds(bounds);\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n\n\n std::cout << \"Initializing an phi-\/theta-plane (sphereParameterPlane) as parameter plane by InitializeStandardPlane(rightVector, downVector, spacing = NULL): \"<<std::endl;\n mitk::PlaneGeometry::Pointer sphereParameterPlane = mitk::PlaneGeometry::New();\n width = 100; widthInMM = 2*vnl_math::pi;\n height = 200; heightInMM = vnl_math::pi;\n mitk::ScalarType radiusInMM = 2.5;\n\n mitk::FillVector3D(origin, radiusInMM, 0, widthInMM);\n mitk::FillVector3D(right, 0, 0, -widthInMM);\n mitk::FillVector3D(bottom, 0, heightInMM, 0);\n sphereParameterPlane->InitializeStandardPlane(right, bottom);\n sphereParameterPlane->SetOrigin(origin);\n sphereParameterPlane->SetSizeInUnits(width, height);\n\n std::cout << \"Creating an vtkSphericalTransform (sphericalTransform) to use with sphereParameterPlane: \"<<std::endl;\n vtkSphericalTransform* sphericalTransform = vtkSphericalTransform::New();\n\n std::cout << \"Setting sphereParameterPlane as parameter plane and sphericalTransform as transform of AbstractTransformGeometry: \"<<std::endl;\n abstractgeometry->SetPlane(sphereParameterPlane);\n abstractgeometry->SetVtkAbstractTransform(sphericalTransform);\n\n std::cout << \"Testing whether the bounds of sphereParameterPlane and the parametric bounds of AbstractTransformGeometry are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(sphereParameterPlane->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(sphereParameterPlane->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing whether the parametic bounds of AbstractTransformGeometry and the bounds of the plane accessed from there are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing mapping Map(pt2d_mm(phi=Pi,theta=Pi\/2.0), pt3d_mm) and compare with expected (-radius, 0, 0): \";\n mitk::Point2D pt2d_mm;\n mitk::Point3D pt3d_mm, expected_pt3d_mm;\n pt2d_mm[0] = vnl_math::pi; pt2d_mm[1] = vnl_math::pi_over_2;\n mitk::FillVector3D(expected_pt3d_mm, -radiusInMM, 0, 0);\n abstractgeometry->Map(pt2d_mm, pt3d_mm);\n if(mitk::Equal(pt3d_mm, expected_pt3d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing mapping Map(pt3d_mm, pt2d_mm) and compare with expected: \";\n mitk::Point2D testpt2d_mm;\n abstractgeometry->Map(pt3d_mm, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing IndexToWorld(pt2d_units, pt2d_mm) and compare with expected: \";\n mitk::Point2D pt2d_units;\n pt2d_units[0] = width\/2.0; pt2d_units[1] = height\/2.0;\n pt2d_mm[0] = widthInMM\/2.0; pt2d_mm[1] = heightInMM\/2.0;\n abstractgeometry->IndexToWorld(pt2d_units, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Change parametic bounds of AbstractTransformGeometry and test whether they are equal to the bounds of the plane accessed from there: \"<<std::endl;\n height = 300;\n bounds[3] = height;\n abstractgeometry->SetParametricBounds(bounds);\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing IndexToWorld(pt2d_units, pt2d_mm) and compare with expected: \";\n pt2d_units[0] = width\/2.0; pt2d_units[1] = height\/2.0;\n pt2d_mm[0] = widthInMM\/2.0; pt2d_mm[1] = heightInMM\/2.0;\n abstractgeometry->IndexToWorld(pt2d_units, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n\n \/\/std::cout << \"Testing availability and type (PlaneGeometry) of first geometry in the SlicedGeometry3D: \";\n \/\/mitk::PlaneGeometry* accessedplanegeometry3 = dynamic_cast<mitk::PlaneGeometry*>(slicedWorldGeometry->GetGeometry2D(0));\n \/\/if(accessedplanegeometry3==NULL)\n \/\/{\n \/\/ std::cout<<\"[FAILED]\"<<std::endl;\n \/\/ return EXIT_FAILURE;\n \/\/}\n \/\/std::cout<<\"[PASSED]\"<<std::endl;\n\n \/\/std::cout << \"Testing whether the first geometry in the SlicedGeometry3D is identical to planegeometry3 by axis comparison: \"<<std::endl;\n \/\/if((mitk::Equal(accessedplanegeometry3->GetAxisVector(0), planegeometry3->GetAxisVector(0))==false) || \n \/\/ (mitk::Equal(accessedplanegeometry3->GetAxisVector(1), planegeometry3->GetAxisVector(1))==false) || \n \/\/ (mitk::Equal(accessedplanegeometry3->GetAxisVector(2), planegeometry3->GetAxisVector(2))==false))\n \/\/{\n \/\/ std::cout<<\"[FAILED]\"<<std::endl;\n \/\/ return EXIT_FAILURE;\n \/\/}\n \/\/std::cout<<\"[PASSED]\"<<std::endl;\n\n\n std::cout<<\"[TEST DONE]\"<<std::endl;\n return EXIT_SUCCESS;\n}\n<commit_msg>CHG: change according to changes in AbstractGeometry<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkImage.h\"\n#include \"mitkExternAbstractTransformGeometry.h\"\n#include \"mitkPlaneGeometry.h\"\n#include \"mitkTimeSlicedGeometry.h\"\n#include \"mitkSlicedGeometry3D.h\"\n\n#include <vtkSphericalTransform.h>\n\n#include <fstream>\n\nint mitkAbstractTransformGeometryTest(int argc, char* argv[])\n{\n mitk::Point3D origin;\n mitk::Vector3D right, bottom;\n mitk::ScalarType width, height;\n mitk::ScalarType widthInMM, heightInMM;\n\n std::cout << \"Initializing an x-\/y-plane (xyPlane) as parameter plane by InitializeStandardPlane(rightVector, downVector, spacing = NULL): \"<<std::endl;\n mitk::PlaneGeometry::Pointer xyPlane = mitk::PlaneGeometry::New();\n width = 100; widthInMM = width;\n height = 200; heightInMM = height;\n mitk::ScalarType bounds[6] = {0, width, 0, height, 0, 1};\n mitk::FillVector3D(origin, 4.5, 7.3, 11.2);\n mitk::FillVector3D(right, widthInMM, 0, 0);\n mitk::FillVector3D(bottom, 0, heightInMM, 0);\n xyPlane->InitializeStandardPlane(right, bottom);\n xyPlane->SetOrigin(origin);\n xyPlane->SetSizeInUnits(width, height);\n\n std::cout << \"Creating AbstractTransformGeometry: \" <<std::endl;\n mitk::ExternAbstractTransformGeometry::Pointer abstractgeometry=mitk::ExternAbstractTransformGeometry::New();\n\n std::cout << \"Setting xyPlane as parameter plane of AbstractTransformGeometry: \"<<std::endl;\n abstractgeometry->SetPlane(xyPlane);\n\n std::cout << \"Testing whether the bounds of xyPlane and the parametric bounds of AbstractTransformGeometry are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(xyPlane->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(xyPlane->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing whether the parametic bounds of AbstractTransformGeometry and the bounds of the plane accessed from there are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Change parametic bounds of AbstractTransformGeometry and test whether they are equal to the bounds of the plane accessed from there: \"<<std::endl;\n height = 300;\n bounds[3] = height;\n abstractgeometry->SetParametricBounds(bounds);\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n\n\n std::cout << \"Initializing an phi-\/theta-plane (sphereParameterPlane) as parameter plane by InitializeStandardPlane(rightVector, downVector, spacing = NULL): \"<<std::endl;\n mitk::PlaneGeometry::Pointer sphereParameterPlane = mitk::PlaneGeometry::New();\n width = 100; widthInMM = 2*vnl_math::pi;\n height = 200; heightInMM = vnl_math::pi;\n mitk::ScalarType radiusInMM = 2.5;\n\n mitk::FillVector3D(origin, radiusInMM, 0, widthInMM);\n mitk::FillVector3D(right, 0, 0, -widthInMM);\n mitk::FillVector3D(bottom, 0, heightInMM, 0);\n sphereParameterPlane->InitializeStandardPlane(right, bottom);\n sphereParameterPlane->SetOrigin(origin);\n sphereParameterPlane->SetSizeInUnits(width, height);\n\n std::cout << \"Creating an vtkSphericalTransform (sphericalTransform) to use with sphereParameterPlane: \"<<std::endl;\n vtkSphericalTransform* sphericalTransform = vtkSphericalTransform::New();\n\n std::cout << \"Setting sphereParameterPlane as parameter plane and sphericalTransform as transform of AbstractTransformGeometry: \"<<std::endl;\n abstractgeometry->SetPlane(sphereParameterPlane);\n abstractgeometry->SetVtkAbstractTransform(sphericalTransform);\n\n std::cout << \"Testing whether the bounds of sphereParameterPlane and the parametric bounds of AbstractTransformGeometry are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(sphereParameterPlane->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(sphereParameterPlane->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing whether the parametic bounds of AbstractTransformGeometry and the bounds of the plane accessed from there are equal: \";\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing mapping Map(pt2d_mm(phi=Pi,theta=Pi\/2.0), pt3d_mm) and compare with expected (-radius, 0, 0): \";\n mitk::Point2D pt2d_mm;\n mitk::Point3D pt3d_mm, expected_pt3d_mm;\n pt2d_mm[0] = vnl_math::pi; pt2d_mm[1] = vnl_math::pi_over_2;\n mitk::FillVector3D(expected_pt3d_mm, -radiusInMM, 0, 0);\n abstractgeometry->Map(pt2d_mm, pt3d_mm);\n if(mitk::Equal(pt3d_mm, expected_pt3d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing mapping Map(pt3d_mm, pt2d_mm) and compare with expected: \";\n mitk::Point2D testpt2d_mm;\n abstractgeometry->Map(pt3d_mm, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing IndexToWorld(pt2d_units, pt2d_mm) and compare with expected: \";\n mitk::Point2D pt2d_units;\n pt2d_units[0] = width\/2.0; pt2d_units[1] = height\/2.0;\n pt2d_mm[0] = widthInMM\/2.0; pt2d_mm[1] = heightInMM\/2.0;\n abstractgeometry->IndexToWorld(pt2d_units, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Change parametic bounds of AbstractTransformGeometry and test whether they are equal to the bounds of the plane accessed from there: \"<<std::endl;\n height = 300;\n bounds[3] = height;\n abstractgeometry->SetParametricBounds(bounds);\n if((mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMinimum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMinimum())==false) || \n (mitk::Equal(const_cast<mitk::BoundingBox*>(abstractgeometry->GetParametricBoundingBox())->GetMaximum(), const_cast<mitk::BoundingBox*>(abstractgeometry->GetPlane()->GetBoundingBox())->GetMaximum())==false))\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n std::cout << \"Testing IndexToWorld(pt2d_units, pt2d_mm) and compare with expected: \";\n pt2d_units[0] = width\/2.0; pt2d_units[1] = height\/2.0;\n pt2d_mm[0] = widthInMM\/2.0; pt2d_mm[1] = heightInMM\/2.0;\n abstractgeometry->IndexToWorld(pt2d_units, testpt2d_mm);\n if(mitk::Equal(pt2d_mm, testpt2d_mm) == false)\n {\n std::cout<<\"[FAILED]\"<<std::endl;\n return EXIT_FAILURE;\n }\n std::cout<<\"[PASSED]\"<<std::endl;\n\n\n \/\/std::cout << \"Testing availability and type (PlaneGeometry) of first geometry in the SlicedGeometry3D: \";\n \/\/mitk::PlaneGeometry* accessedplanegeometry3 = dynamic_cast<mitk::PlaneGeometry*>(slicedWorldGeometry->GetGeometry2D(0));\n \/\/if(accessedplanegeometry3==NULL)\n \/\/{\n \/\/ std::cout<<\"[FAILED]\"<<std::endl;\n \/\/ return EXIT_FAILURE;\n \/\/}\n \/\/std::cout<<\"[PASSED]\"<<std::endl;\n\n \/\/std::cout << \"Testing whether the first geometry in the SlicedGeometry3D is identical to planegeometry3 by axis comparison: \"<<std::endl;\n \/\/if((mitk::Equal(accessedplanegeometry3->GetAxisVector(0), planegeometry3->GetAxisVector(0))==false) || \n \/\/ (mitk::Equal(accessedplanegeometry3->GetAxisVector(1), planegeometry3->GetAxisVector(1))==false) || \n \/\/ (mitk::Equal(accessedplanegeometry3->GetAxisVector(2), planegeometry3->GetAxisVector(2))==false))\n \/\/{\n \/\/ std::cout<<\"[FAILED]\"<<std::endl;\n \/\/ return EXIT_FAILURE;\n \/\/}\n \/\/std::cout<<\"[PASSED]\"<<std::endl;\n\n\n std::cout<<\"[TEST DONE]\"<<std::endl;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"maemo6tapsensor.h\"\n\n#include <tapdata.h>\n\nconst char *maemo6tapsensor::id(\"maemo6.tapsensor\");\nbool maemo6tapsensor::m_initDone = false;\n\nmaemo6tapsensor::maemo6tapsensor(QSensor *sensor)\n : maemo6sensorbase(sensor), m_sensor(sensor)\n{\n setReading<QTapReading>(&m_reading);\n\n if (!m_initDone) {\n qDBusRegisterMetaType<Tap>();\n initSensor<TapSensorChannelInterface>(\"tapsensor\");\n\n if (m_sensorInterface)\n QObject::connect(static_cast<TapSensorChannelInterface*>(m_sensorInterface), SIGNAL(dataAvailable(const Tap&)), this, SLOT(slotDataAvailable(const Tap&)));\n else\n qWarning() << \"Unable to initialize tap sensor.\";\n\n \/\/ metadata\n addDataRate(100, 100); \/\/ 100Hz\n sensor->setDataRate(100);\n addOutputRange(0, 9, 1);\n setDescription(QLatin1String(\"Measures single and double taps and gives tap direction\"));\n\n m_initDone = true;\n }\n}\n\nvoid maemo6tapsensor::slotDataAvailable(const Tap& data)\n{\n \/\/ Set tap type (single\/double)\n bool doubleTap;\n switch (data.type()) {\n case TapData::DoubleTap: doubleTap = true; break;\n case TapData::SingleTap: doubleTap = false; break;\n default: doubleTap = false;\n }\n QVariant v = m_sensor->property(\"returnDoubleTapEvents\");\n if (v.isValid() && v.toBool() == false)\n m_reading.setDoubleTap(false);\n else\n m_reading.setDoubleTap(doubleTap);\n\n \/\/ Set tap direction\n QTapReading::TapDirection o;\n switch (data.direction()) {\n case TapData::X: o = QTapReading::X; break;\n case TapData::Y: o = QTapReading::Y; break;\n case TapData::Z: o = QTapReading::Z; break;\n case TapData::LeftRight: o = QTapReading::X_Pos; break;\n case TapData::RightLeft: o = QTapReading::X_Neg; break;\n case TapData::TopBottom: o = QTapReading::Z_Neg; break;\n case TapData::BottomTop: o = QTapReading::Z_Pos; break;\n case TapData::FaceBack: o = QTapReading::Y_Pos; break;\n case TapData::BackFace: o = QTapReading::Y_Neg; break;\n default: o = QTapReading::Undefined;\n }\n m_reading.setTapDirection(o);\n\n m_reading.setTimestamp(data.tapData().timestamp_);\n newReadingAvailable();\n}\n<commit_msg>Drop wrong kinds of tap events<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"maemo6tapsensor.h\"\n\n#include <tapdata.h>\n\nconst char *maemo6tapsensor::id(\"maemo6.tapsensor\");\nbool maemo6tapsensor::m_initDone = false;\n\nmaemo6tapsensor::maemo6tapsensor(QSensor *sensor)\n : maemo6sensorbase(sensor), m_sensor(sensor)\n{\n setReading<QTapReading>(&m_reading);\n\n if (!m_initDone) {\n qDBusRegisterMetaType<Tap>();\n initSensor<TapSensorChannelInterface>(\"tapsensor\");\n\n if (m_sensorInterface)\n QObject::connect(static_cast<TapSensorChannelInterface*>(m_sensorInterface), SIGNAL(dataAvailable(const Tap&)), this, SLOT(slotDataAvailable(const Tap&)));\n else\n qWarning() << \"Unable to initialize tap sensor.\";\n\n \/\/ metadata\n addDataRate(100, 100); \/\/ 100Hz\n sensor->setDataRate(100);\n addOutputRange(0, 9, 1);\n setDescription(QLatin1String(\"Measures single and double taps and gives tap direction\"));\n\n m_initDone = true;\n }\n}\n\nvoid maemo6tapsensor::slotDataAvailable(const Tap& data)\n{\n \/\/ Set tap type (single\/double)\n bool doubleTap;\n switch (data.type()) {\n case TapData::DoubleTap: doubleTap = true; break;\n case TapData::SingleTap: doubleTap = false; break;\n default: doubleTap = false;\n }\n QVariant v = m_sensor->property(\"returnDoubleTapEvents\");\n if (v.isValid() && v.toBool() == false) {\n if (doubleTap)\n return;\n } else {\n if (! doubleTap)\n return;\n }\n m_reading.setDoubleTap(doubleTap);\n\n \/\/ Set tap direction\n QTapReading::TapDirection o;\n switch (data.direction()) {\n case TapData::X: o = QTapReading::X; break;\n case TapData::Y: o = QTapReading::Y; break;\n case TapData::Z: o = QTapReading::Z; break;\n case TapData::LeftRight: o = QTapReading::X_Pos; break;\n case TapData::RightLeft: o = QTapReading::X_Neg; break;\n case TapData::TopBottom: o = QTapReading::Z_Neg; break;\n case TapData::BottomTop: o = QTapReading::Z_Pos; break;\n case TapData::FaceBack: o = QTapReading::Y_Pos; break;\n case TapData::BackFace: o = QTapReading::Y_Neg; break;\n default: o = QTapReading::Undefined;\n }\n m_reading.setTapDirection(o);\n\n m_reading.setTimestamp(data.tapData().timestamp_);\n newReadingAvailable();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2013 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"TerrainTests.h\"\n#include \"OgreTerrain.h\"\n#include \"OgreConfigFile.h\"\n#include \"OgreResourceGroupManager.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n#include \"macUtils.h\"\n#endif\n\nCPPUNIT_TEST_SUITE_REGISTRATION( TerrainTests );\n\nvoid TerrainTests::setUp()\n{\n \/\/ set up silent logging to not pollute output\n\tif(LogManager::getSingletonPtr())\n\t\tOGRE_DELETE Ogre::LogManager::getSingletonPtr();\n\n\tif(LogManager::getSingletonPtr() == 0)\n\t{\n\t\tLogManager* logManager = OGRE_NEW LogManager();\n\t\tlogManager->createLog(\"testTerrain.log\", true, false);\n\t}\n LogManager::getSingleton().setLogDetail(LL_LOW);\n\n\tmRoot = OGRE_NEW Root();\n\tmTerrainOpts = OGRE_NEW TerrainGlobalOptions();\n\n\t\/\/ Load resource paths from config file\n\tConfigFile cf;\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n\tcf.load(macBundlePath() + \"\/Contents\/Resources\/resources.cfg\");\n#elif OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\tcf.load(\"bin\/release\/resources.cfg\");\n#else\n\tcf.load(\"bin\/resources.cfg\");\n#endif\n\n\t\/\/ Go through all sections & settings in the file\n\tConfigFile::SectionIterator seci = cf.getSectionIterator();\n\n\tString secName, typeName, archName;\n\twhile (seci.hasMoreElements())\n\t{\n\t\tsecName = seci.peekNextKey();\n\t\tConfigFile::SettingsMultiMap *settings = seci.getNext();\n\t\tConfigFile::SettingsMultiMap::iterator i;\n\t\tfor (i = settings->begin(); i != settings->end(); ++i)\n\t\t{\n\t\t\ttypeName = i->first;\n\t\t\tarchName = i->second;\n\t\t\tResourceGroupManager::getSingleton().addResourceLocation(\n\t\t\t\tarchName, typeName, secName);\n\n\t\t}\n\t}\n\n\tmSceneMgr = mRoot->createSceneManager(ST_GENERIC);\n\n}\n\nvoid TerrainTests::tearDown()\n{\n\tOGRE_DELETE mTerrainOpts;\n\tOGRE_DELETE mRoot;\n}\n\nvoid TerrainTests::testCreate()\n{\n\tTerrain* t = OGRE_NEW Terrain(mSceneMgr);\n\tImage img;\n\timg.load(\"terrain.png\", ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\n\tTerrain::ImportData imp;\n\timp.inputImage = &img;\n\timp.terrainSize = 513;\n\timp.worldSize = 1000;\n\timp.minBatchSize = 33;\n\timp.maxBatchSize = 65;\n\tt->prepare(imp);\n\t\/\/ don't load, this requires GPU access\n\t\/\/t->load();\n\n\tOGRE_DELETE t;\n}\n<commit_msg>Fix path for resource config file in linux terrain test.<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\/\n\nCopyright (c) 2000-2013 Torus Knot Software Ltd\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"TerrainTests.h\"\n#include \"OgreTerrain.h\"\n#include \"OgreConfigFile.h\"\n#include \"OgreResourceGroupManager.h\"\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n#include \"macUtils.h\"\n#endif\n\nCPPUNIT_TEST_SUITE_REGISTRATION( TerrainTests );\n\nvoid TerrainTests::setUp()\n{\n \/\/ set up silent logging to not pollute output\n\tif(LogManager::getSingletonPtr())\n\t\tOGRE_DELETE Ogre::LogManager::getSingletonPtr();\n\n\tif(LogManager::getSingletonPtr() == 0)\n\t{\n\t\tLogManager* logManager = OGRE_NEW LogManager();\n\t\tlogManager->createLog(\"testTerrain.log\", true, false);\n\t}\n LogManager::getSingleton().setLogDetail(LL_LOW);\n\n\tmRoot = OGRE_NEW Root();\n\tmTerrainOpts = OGRE_NEW TerrainGlobalOptions();\n\n\t\/\/ Load resource paths from config file\n\tConfigFile cf;\n#if OGRE_PLATFORM == OGRE_PLATFORM_APPLE\n\tcf.load(macBundlePath() + \"\/Contents\/Resources\/resources.cfg\");\n#elif OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\tcf.load(\"bin\/release\/resources.cfg\");\n#else\n#ifdef OGRE_STATIC_LIB\n\tcf.load(\"bin\/resources.cfg\");\n#else\n\tcf.load(\"resources.cfg\");\n#endif\n#endif\n\n\t\/\/ Go through all sections & settings in the file\n\tConfigFile::SectionIterator seci = cf.getSectionIterator();\n\n\tString secName, typeName, archName;\n\twhile (seci.hasMoreElements())\n\t{\n\t\tsecName = seci.peekNextKey();\n\t\tConfigFile::SettingsMultiMap *settings = seci.getNext();\n\t\tConfigFile::SettingsMultiMap::iterator i;\n\t\tfor (i = settings->begin(); i != settings->end(); ++i)\n\t\t{\n\t\t\ttypeName = i->first;\n\t\t\tarchName = i->second;\n\t\t\tResourceGroupManager::getSingleton().addResourceLocation(\n\t\t\t\tarchName, typeName, secName);\n\n\t\t}\n\t}\n\n\tmSceneMgr = mRoot->createSceneManager(ST_GENERIC);\n\n}\n\nvoid TerrainTests::tearDown()\n{\n\tOGRE_DELETE mTerrainOpts;\n\tOGRE_DELETE mRoot;\n}\n\nvoid TerrainTests::testCreate()\n{\n\tTerrain* t = OGRE_NEW Terrain(mSceneMgr);\n\tImage img;\n\timg.load(\"terrain.png\", ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\n\tTerrain::ImportData imp;\n\timp.inputImage = &img;\n\timp.terrainSize = 513;\n\timp.worldSize = 1000;\n\timp.minBatchSize = 33;\n\timp.maxBatchSize = 65;\n\tt->prepare(imp);\n\t\/\/ don't load, this requires GPU access\n\t\/\/t->load();\n\n\tOGRE_DELETE t;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: impframe.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2004-10-04 21:02:28 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SFX_IMPFRAME_HXX\n#define _SFX_IMPFRAME_HXX\n\n#ifndef _SFXCANCEL_HXX \/\/autogen\n#include <svtools\/cancel.hxx>\n#endif\n\n#pragma hdrstop\n\n#include \"frame.hxx\"\n#include \"loadenv.hxx\"\n#include \"viewfrm.hxx\" \/\/ SvBorder\n\nclass SfxViewFrame;\nclass SfxObjectShell;\nclass SfxExplorerBrowserConfig;\n\n#ifndef _COM_SUN_STAR_FRAME_XCONTROLLER_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XTOPWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XTopWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_POSSIZE_HPP_\n#include <com\/sun\/star\/awt\/PosSize.hpp>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n#include <viewsh.hxx>\n#include <sfxuno.hxx>\n\n#ifndef FRAME_SEARCH_PARENT\n#define FRAME_SEARCH_PARENT 0x00000001\n#define FRAME_SEARCH_SELF 0x00000002\n#define FRAME_SEARCH_CHILDREN 0x00000004\n#define FRAME_SEARCH_CREATE 0x00000008\n#endif\n\nclass SfxFrame_Impl : public SfxBroadcaster, public SvCompatWeakBase, public SfxListener\n{\nfriend class SfxFrame;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::frame::XFrame > xFrame;\n String aFrameIdName;\n sal_uInt32 nType;\n sal_uInt32 nHistoryPos;\n SfxViewFrame* pCurrentViewFrame;\n SfxObjectShell* pCurrentObjectShell;\n SfxFrameDescriptor* pDescr;\n SfxExplorerBrowserConfig* pBrowserCfg;\n sal_uInt16 nFrameId;\n sal_uInt16 nLocks;\n sal_Bool bCloseOnUnlock : 1;\n sal_Bool bClosing : 1;\n sal_Bool bPrepClosing : 1;\n sal_Bool bInCancelTransfers : 1;\n sal_Bool bOwnsBindings : 1;\n sal_Bool bReleasingComponent : 1;\n sal_Bool bFocusLocked : 1;\n sal_Bool bInPlace : 1;\n sal_uInt16 nHasBrowser;\n SfxCancelManager* pCancelMgr;\n SfxCancellable* pLoadCancellable;\n SfxFrame* pFrame;\n const SfxItemSet* pSet;\n SfxWorkWindow* pWorkWin;\n SvBorder aBorder;\n\n SfxFrame_Impl( SfxFrame* pAntiImplP ) :\n SvCompatWeakBase( pAntiImplP ),\n pFrame( pAntiImplP ),\n bClosing(sal_False),\n bPrepClosing(sal_False),\n nType( 0L ),\n nHistoryPos( 0 ),\n nFrameId( 0 ),\n pCurrentObjectShell( NULL ),\n pCurrentViewFrame( NULL ),\n bInCancelTransfers( sal_False ),\n bCloseOnUnlock( sal_False ),\n bOwnsBindings( sal_False ),\n bReleasingComponent( sal_False ),\n bFocusLocked( sal_False ),\n bInPlace( sal_False ),\n nLocks( 0 ),\n pBrowserCfg( NULL ),\n pDescr( NULL ),\n nHasBrowser( SFX_BEAMER_OFF ),\n pCancelMgr( 0 ),\n pLoadCancellable( 0 ),\n pSet( 0 ),\n pWorkWin( 0 )\n {}\n\n ~SfxFrame_Impl() { delete pCancelMgr;\n delete pLoadCancellable; }\n virtual void Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.5.434); FILE MERGED 2005\/09\/06 13:06:08 rt 1.5.434.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: impframe.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 19:27:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SFX_IMPFRAME_HXX\n#define _SFX_IMPFRAME_HXX\n\n#ifndef _SFXCANCEL_HXX \/\/autogen\n#include <svtools\/cancel.hxx>\n#endif\n\n#pragma hdrstop\n\n#include \"frame.hxx\"\n#include \"loadenv.hxx\"\n#include \"viewfrm.hxx\" \/\/ SvBorder\n\nclass SfxViewFrame;\nclass SfxObjectShell;\nclass SfxExplorerBrowserConfig;\n\n#ifndef _COM_SUN_STAR_FRAME_XCONTROLLER_HPP_\n#include <com\/sun\/star\/frame\/XController.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XTOPWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XTopWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XWINDOW_HPP_\n#include <com\/sun\/star\/awt\/XWindow.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_POSSIZE_HPP_\n#include <com\/sun\/star\/awt\/PosSize.hpp>\n#endif\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\n#include <viewsh.hxx>\n#include <sfxuno.hxx>\n\n#ifndef FRAME_SEARCH_PARENT\n#define FRAME_SEARCH_PARENT 0x00000001\n#define FRAME_SEARCH_SELF 0x00000002\n#define FRAME_SEARCH_CHILDREN 0x00000004\n#define FRAME_SEARCH_CREATE 0x00000008\n#endif\n\nclass SfxFrame_Impl : public SfxBroadcaster, public SvCompatWeakBase, public SfxListener\n{\nfriend class SfxFrame;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::frame::XFrame > xFrame;\n String aFrameIdName;\n sal_uInt32 nType;\n sal_uInt32 nHistoryPos;\n SfxViewFrame* pCurrentViewFrame;\n SfxObjectShell* pCurrentObjectShell;\n SfxFrameDescriptor* pDescr;\n SfxExplorerBrowserConfig* pBrowserCfg;\n sal_uInt16 nFrameId;\n sal_uInt16 nLocks;\n sal_Bool bCloseOnUnlock : 1;\n sal_Bool bClosing : 1;\n sal_Bool bPrepClosing : 1;\n sal_Bool bInCancelTransfers : 1;\n sal_Bool bOwnsBindings : 1;\n sal_Bool bReleasingComponent : 1;\n sal_Bool bFocusLocked : 1;\n sal_Bool bInPlace : 1;\n sal_uInt16 nHasBrowser;\n SfxCancelManager* pCancelMgr;\n SfxCancellable* pLoadCancellable;\n SfxFrame* pFrame;\n const SfxItemSet* pSet;\n SfxWorkWindow* pWorkWin;\n SvBorder aBorder;\n\n SfxFrame_Impl( SfxFrame* pAntiImplP ) :\n SvCompatWeakBase( pAntiImplP ),\n pFrame( pAntiImplP ),\n bClosing(sal_False),\n bPrepClosing(sal_False),\n nType( 0L ),\n nHistoryPos( 0 ),\n nFrameId( 0 ),\n pCurrentObjectShell( NULL ),\n pCurrentViewFrame( NULL ),\n bInCancelTransfers( sal_False ),\n bCloseOnUnlock( sal_False ),\n bOwnsBindings( sal_False ),\n bReleasingComponent( sal_False ),\n bFocusLocked( sal_False ),\n bInPlace( sal_False ),\n nLocks( 0 ),\n pBrowserCfg( NULL ),\n pDescr( NULL ),\n nHasBrowser( SFX_BEAMER_OFF ),\n pCancelMgr( 0 ),\n pLoadCancellable( 0 ),\n pSet( 0 ),\n pWorkWin( 0 )\n {}\n\n ~SfxFrame_Impl() { delete pCancelMgr;\n delete pLoadCancellable; }\n virtual void Notify( SfxBroadcaster& rBC, const SfxHint& rHint );\n};\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#ifdef USE_MEM_CHECK\n#include <mcheck.h>\n#endif\n\n#include <osg\/Group>\n#include <osg\/Notify>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/FlightManipulator>\n#include <osgGA\/DriveManipulator>\n\n#include <osgGLUT\/glut>\n#include <osgGLUT\/Viewer>\n\n#include <osg\/Quat>\n\n#if defined (WIN32)\n#include <winsock.h>\n#endif\n\n#include \"receiver.h\"\n#include \"broadcaster.h\"\n\ntypedef unsigned char * BytePtr;\ntemplate <class T>\ninline void swapBytes( T &s )\n{\n if( sizeof( T ) == 1 ) return;\n\n T d = s;\n BytePtr sptr = (BytePtr)&s;\n BytePtr dptr = &(((BytePtr)&d)[sizeof(T)-1]); \n\n for( unsigned int i = 0; i < sizeof(T); i++ )\n *(sptr++) = *(dptr--);\n}\n\nclass CameraPacket {\n public:\n \n CameraPacket():_masterKilled(false) \n\t{\n\t _byte_order = 0x12345678;\n\t}\n \n void setPacket(const osg::Camera& camera,const osg::FrameStamp* frameStamp)\n {\n _eye = camera.getEyePoint();\n _center = camera.getCenterPoint();\n _up = camera.getUpVector();\n if (frameStamp)\n {\n _frameStamp = *frameStamp;\n }\n }\n \n void getCamera(osg::Camera& camera,float angle_offset=0.0f)\n {\n \n osg::Vec3 lv = _center-_eye;\n osg::Matrix matrix;\n matrix.makeIdentity();\n matrix.makeRotate(angle_offset,_up.x(),_up.y(),_up.z());\n lv = lv*matrix;\n \n camera.setLookAt(_eye,_eye+lv,_up);\n \n }\n \n void getSceneViewUpdate(osgUtil::SceneView& sv)\n {\n \/\/ note pass a seperate reference counted FrameStamp\n \/\/ rather than this frame stamp as it can get overwritten.\n sv.setFrameStamp(new osg::FrameStamp(_frameStamp));\n }\n\n\n\tvoid checkByteOrder( void )\n\t{\n\t if( _byte_order == 0x78563412 ) \/\/ We're backwards\n\t {\n\t swapBytes( _byte_order );\n\t\tswapBytes( _masterKilled );\n\t\tswapBytes( _eye[0] );\n\t\tswapBytes( _eye[1] );\n\t\tswapBytes( _eye[2] );\n\t\tswapBytes( _center[0] );\n\t\tswapBytes( _center[1] );\n\t\tswapBytes( _center[2] );\n\t\tswapBytes( _up[0] );\n\t\tswapBytes( _up[1] );\n\t\tswapBytes( _up[2] );\n\t\tswapBytes( _attachMatrix );\n\t\tfor( int i = 0; i < 16; i++ )\n\t\t swapBytes( _matrix.ptr()[i] );\n\t }\n\t}\n\n \n void setMasterKilled(const bool flag) { _masterKilled = flag; }\n const bool getMasterKilled() const { return _masterKilled; }\n \n\tunsigned long _byte_order;\n bool _masterKilled;\n osg::Vec3 _eye;\n osg::Vec3 _center;\n osg::Vec3 _up;\n bool _attachMatrix;\n osg::Matrix _matrix;\n\n \/\/ note don't use a ref_ptr as used elsewhere for FrameStamp\n \/\/ since we don't want to copy the pointer - but the memory.\n \/\/ FrameStamp doesn't have a private destructor to allow\n \/\/ us to do this, even though its a reference counted object. \n osg::FrameStamp _frameStamp;\n \n};\n\n\nclass MySceneView : public osgUtil::SceneView {\n\n public:\n \n enum ViewerMode\n {\n STAND_ALONE,\n SLAVE,\n MASTER\n };\n \n MySceneView(ViewerMode viewerMode,int socketNumber,float camera_fov, float camera_offset):\n _viewerMode(viewerMode),_socketNumber(socketNumber),\n _camera_fov(camera_fov), _camera_offset(camera_offset)\n {\n setDefaults();\n getCamera()->setAdjustAspectRatioMode(osg::Camera::ADJUST_VERTICAL);\n getCamera()->setFOV(camera_fov,camera_fov*(600.0f\/800.0f),1.0f,1000.0f);\n \n _bc.setPort(socketNumber);\n _rc.setPort(socketNumber);\n };\n \n ~MySceneView()\n {\n if (_viewerMode==MASTER)\n {\n \/\/ need to broadcast my death.\n CameraPacket cp;\n cp.setPacket(*getCamera(),getFrameStamp());\n cp.setMasterKilled(true);\n \n _bc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _bc.sync();\n \n std::cout << \"broadcasting death\"<<std::endl;\n \n }\n }\n \n \/\/ override the basic SceneView::app traversal.\n virtual void app()\n {\n SceneView::app();\n switch (_viewerMode)\n {\n case(MASTER):\n {\n CameraPacket cp;\n cp.setPacket(*getCamera(),getFrameStamp());\n\n _bc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _bc.sync();\n\n }\n break;\n case(SLAVE):\n {\n CameraPacket cp;\n\n _rc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _rc.sync();\n\n\t\t cp.checkByteOrder();\n\n\n cp.getCamera(*getCamera(),_camera_offset);\n cp.getSceneViewUpdate(*this);\n \n if (cp.getMasterKilled()) \n {\n std::cout << \"recieved master killed\"<<std::endl;\n _viewerMode = STAND_ALONE;\n }\n }\n break;\n default:\n \/\/ no need to anything here, just a normal interactive viewer.\n break;\n }\n }\n \n protected:\n \n ViewerMode _viewerMode;\n int _socketNumber;\n float _camera_fov;\n float _camera_offset;\n\tunsigned long _byte_order;\n \n\n Broadcaster _bc;\n Receiver _rc;\n\n\n};\n\n\/*\n * Function to read several files (typically one) as specified on the command\n * line, and return them in an osg::Node\n *\/\nosg::Node* getNodeFromFiles(int argc,char **argv, \n MySceneView::ViewerMode& viewerMode, int& socketNumber,\n float& camera_fov, float& camera_offset)\n{\n osg::Node *rootnode = new osg::Node;\n\n int i;\n\n typedef std::vector<osg::Node*> NodeList;\n NodeList nodeList;\n for( i = 1; i < argc; i++ )\n {\n\n if (argv[i][0]=='-')\n {\n switch(argv[i][1])\n {\n\n case('m'):\n viewerMode = MySceneView::MASTER;\n break;\n case('s'):\n viewerMode = MySceneView::SLAVE;\n break;\n case('n'):\n ++i;\n if (i<argc)\n {\n socketNumber = atoi(argv[i]);\n }\n break;\n case('f'):\n ++i;\n if (i<argc)\n {\n camera_fov = atoi(argv[i]);\n }\n break;\n case('o'):\n ++i;\n if (i<argc)\n {\n camera_offset = atoi(argv[i]);\n }\n break;\n \n case('l'):\n ++i;\n if (i<argc)\n {\n osgDB::Registry::instance()->loadLibrary(argv[i]);\n }\n break;\n case('e'):\n ++i;\n if (i<argc)\n {\n std::string libName = osgDB::Registry::instance()->createLibraryNameForExt(argv[i]);\n osgDB::Registry::instance()->loadLibrary(libName);\n }\n break;\n }\n } else\n {\n osg::Node *node = osgDB::readNodeFile( argv[i] );\n\n if( node != (osg::Node *)0L )\n {\n if (node->getName().empty()) node->setName( argv[i] );\n nodeList.push_back(node);\n }\n }\n\n }\n\n if (nodeList.size()==0)\n {\n osg::notify(osg::WARN) << \"No data loaded.\"<<std::endl;\n exit(0);\n }\n \n \n\/*\n if (master) osg::notify(osg::NOTICE)<<\"set to MASTER, broadcasting on socketNumber \"<<socketNumber<<std::endl;\n else osg::notify(osg::NOTICE)<<\"set to SLAVE, reciving on socketNumber \"<<socketNumber<<std::endl;\n \n*\/\n \n\n if (nodeList.size()==1)\n {\n rootnode = nodeList.front();\n }\n else \/\/ size >1\n {\n osg::Group* group = new osg::Group();\n for(NodeList::iterator itr=nodeList.begin();\n itr!=nodeList.end();\n ++itr)\n {\n group->addChild(*itr);\n }\n\n rootnode = group;\n }\n\n return rootnode;\n}\n\n\nint main( int argc, char **argv )\n{\n\n \/\/ initialize the GLUT\n glutInit( &argc, argv );\n\n if (argc<2)\n {\n osg::notify(osg::NOTICE)<<\"usage:\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" osgcluster [options] infile1 [infile2 ...]\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n osg::notify(osg::NOTICE)<<\"options:\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -m - set this viewer to be master\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -s - set this viewer to be a slave\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -o - offset the slave camera from the master position\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" by specified number of degress. A positive offset \"<<std::endl;\n osg::notify(osg::NOTICE)<<\" turns camera towards right.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -f - set the horizontal field of view of the camera.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -n SocketNumber - set the socket number, defaults to 8100.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" to broadcast on if a master\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" to reciever on if a slave\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n osg::notify(osg::NOTICE)<<\" -l libraryName - load plugin of name libraryName\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" i.e. -l osgdb_pfb\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" Useful for loading reader\/writers which can load\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" other file formats in addition to its extension.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -e extensionName - load reader\/wrter plugin for file extension\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" i.e. -e pfb\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" Useful short hand for specifying full library name as\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" done with -l above, as it automatically expands to the\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" full library name appropriate for each platform.\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n\n return 0;\n }\n\n osg::Timer timer;\n osg::Timer_t before_load = timer.tick();\n \n MySceneView::ViewerMode viewerMode = MySceneView::STAND_ALONE;\n int socketNumber=8100;\n float camera_fov=45.0f;\n float camera_offset=45.0f;\n\n osg::Node* rootnode = getNodeFromFiles( argc, argv, viewerMode, socketNumber,camera_fov,camera_offset);\n \n osg::Timer_t after_load = timer.tick();\n std::cout << \"Time for load = \"<<timer.delta_s(before_load,after_load)<<\" seconds\"<<std::endl;\n\n osg::ref_ptr<MySceneView> mySceneView = new MySceneView(viewerMode,socketNumber,camera_fov,osg::inDegrees(camera_offset));\n mySceneView->setSceneData(rootnode);\n\n \/\/ initialize the viewer.\n osgGLUT::Viewer viewer;\n viewer.setWindowTitle(argv[0]);\n viewer.addViewport( mySceneView.get() );\n \n \/\/ register trackball, flight and drive.\n viewer.registerCameraManipulator(new osgGA::TrackballManipulator);\n viewer.registerCameraManipulator(new osgGA::FlightManipulator);\n viewer.registerCameraManipulator(new osgGA::DriveManipulator);\n\n viewer.open();\n viewer.run();\n\n return 0;\n}\n<commit_msg>Added using namespace osgUtil to get round IRIX\/Windows compiler differences.<commit_after>#ifdef USE_MEM_CHECK\n#include <mcheck.h>\n#endif\n\n#include <osg\/Group>\n#include <osg\/Notify>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgGA\/TrackballManipulator>\n#include <osgGA\/FlightManipulator>\n#include <osgGA\/DriveManipulator>\n\n#include <osgGLUT\/glut>\n#include <osgGLUT\/Viewer>\n\n#include <osg\/Quat>\n\n#if defined (WIN32)\n#include <winsock.h>\n#endif\n\n#include \"receiver.h\"\n#include \"broadcaster.h\"\n\ntypedef unsigned char * BytePtr;\ntemplate <class T>\ninline void swapBytes( T &s )\n{\n if( sizeof( T ) == 1 ) return;\n\n T d = s;\n BytePtr sptr = (BytePtr)&s;\n BytePtr dptr = &(((BytePtr)&d)[sizeof(T)-1]); \n\n for( unsigned int i = 0; i < sizeof(T); i++ )\n *(sptr++) = *(dptr--);\n}\n\nclass CameraPacket {\n public:\n \n CameraPacket():_masterKilled(false) \n\t{\n\t _byte_order = 0x12345678;\n\t}\n \n void setPacket(const osg::Camera& camera,const osg::FrameStamp* frameStamp)\n {\n _eye = camera.getEyePoint();\n _center = camera.getCenterPoint();\n _up = camera.getUpVector();\n if (frameStamp)\n {\n _frameStamp = *frameStamp;\n }\n }\n \n void getCamera(osg::Camera& camera,float angle_offset=0.0f)\n {\n \n osg::Vec3 lv = _center-_eye;\n osg::Matrix matrix;\n matrix.makeIdentity();\n matrix.makeRotate(angle_offset,_up.x(),_up.y(),_up.z());\n lv = lv*matrix;\n \n camera.setLookAt(_eye,_eye+lv,_up);\n \n }\n \n void getSceneViewUpdate(osgUtil::SceneView& sv)\n {\n \/\/ note pass a seperate reference counted FrameStamp\n \/\/ rather than this frame stamp as it can get overwritten.\n sv.setFrameStamp(new osg::FrameStamp(_frameStamp));\n }\n\n\n\tvoid checkByteOrder( void )\n\t{\n\t if( _byte_order == 0x78563412 ) \/\/ We're backwards\n\t {\n\t swapBytes( _byte_order );\n\t\tswapBytes( _masterKilled );\n\t\tswapBytes( _eye[0] );\n\t\tswapBytes( _eye[1] );\n\t\tswapBytes( _eye[2] );\n\t\tswapBytes( _center[0] );\n\t\tswapBytes( _center[1] );\n\t\tswapBytes( _center[2] );\n\t\tswapBytes( _up[0] );\n\t\tswapBytes( _up[1] );\n\t\tswapBytes( _up[2] );\n\t\tswapBytes( _attachMatrix );\n\t\tfor( int i = 0; i < 16; i++ )\n\t\t swapBytes( _matrix.ptr()[i] );\n\t }\n\t}\n\n \n void setMasterKilled(const bool flag) { _masterKilled = flag; }\n const bool getMasterKilled() const { return _masterKilled; }\n \n\tunsigned long _byte_order;\n bool _masterKilled;\n osg::Vec3 _eye;\n osg::Vec3 _center;\n osg::Vec3 _up;\n bool _attachMatrix;\n osg::Matrix _matrix;\n\n \/\/ note don't use a ref_ptr as used elsewhere for FrameStamp\n \/\/ since we don't want to copy the pointer - but the memory.\n \/\/ FrameStamp doesn't have a private destructor to allow\n \/\/ us to do this, even though its a reference counted object. \n osg::FrameStamp _frameStamp;\n \n};\n\n\/\/ using namespace osgUtil required to get round VisualStudio's inablility\n\/\/ to handle osgUtil::SceneView::app() in the code below, only SceneView::app\n\/\/ works..but this breaks the IRIX build, unless you have the osgUtil??!\n\/\/ Robert Osfield, July 2002.\nusing namespace osgUtil;\n\nclass MySceneView : public SceneView {\n\n public:\n \n enum ViewerMode\n {\n STAND_ALONE,\n SLAVE,\n MASTER\n };\n \n MySceneView(ViewerMode viewerMode,int socketNumber,float camera_fov, float camera_offset):\n _viewerMode(viewerMode),_socketNumber(socketNumber),\n _camera_fov(camera_fov), _camera_offset(camera_offset)\n {\n setDefaults();\n getCamera()->setAdjustAspectRatioMode(osg::Camera::ADJUST_VERTICAL);\n getCamera()->setFOV(camera_fov,camera_fov*(600.0f\/800.0f),1.0f,1000.0f);\n \n _bc.setPort(socketNumber);\n _rc.setPort(socketNumber);\n };\n \n ~MySceneView()\n {\n if (_viewerMode==MASTER)\n {\n \/\/ need to broadcast my death.\n CameraPacket cp;\n cp.setPacket(*getCamera(),getFrameStamp());\n cp.setMasterKilled(true);\n \n _bc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _bc.sync();\n \n std::cout << \"broadcasting death\"<<std::endl;\n \n }\n }\n \n \/\/ override the basic SceneView::app traversal.\n virtual void app()\n {\n SceneView::app();\n switch (_viewerMode)\n {\n case(MASTER):\n {\n CameraPacket cp;\n cp.setPacket(*getCamera(),getFrameStamp());\n\n _bc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _bc.sync();\n\n }\n break;\n case(SLAVE):\n {\n CameraPacket cp;\n\n _rc.setBuffer(&cp, sizeof( CameraPacket ));\n\t _rc.sync();\n\n\t\t cp.checkByteOrder();\n\n\n cp.getCamera(*getCamera(),_camera_offset);\n cp.getSceneViewUpdate(*this);\n \n if (cp.getMasterKilled()) \n {\n std::cout << \"recieved master killed\"<<std::endl;\n _viewerMode = STAND_ALONE;\n }\n }\n break;\n default:\n \/\/ no need to anything here, just a normal interactive viewer.\n break;\n }\n }\n \n protected:\n \n ViewerMode _viewerMode;\n int _socketNumber;\n float _camera_fov;\n float _camera_offset;\n\tunsigned long _byte_order;\n \n\n Broadcaster _bc;\n Receiver _rc;\n\n\n};\n\n\/*\n * Function to read several files (typically one) as specified on the command\n * line, and return them in an osg::Node\n *\/\nosg::Node* getNodeFromFiles(int argc,char **argv, \n MySceneView::ViewerMode& viewerMode, int& socketNumber,\n float& camera_fov, float& camera_offset)\n{\n osg::Node *rootnode = new osg::Node;\n\n int i;\n\n typedef std::vector<osg::Node*> NodeList;\n NodeList nodeList;\n for( i = 1; i < argc; i++ )\n {\n\n if (argv[i][0]=='-')\n {\n switch(argv[i][1])\n {\n\n case('m'):\n viewerMode = MySceneView::MASTER;\n break;\n case('s'):\n viewerMode = MySceneView::SLAVE;\n break;\n case('n'):\n ++i;\n if (i<argc)\n {\n socketNumber = atoi(argv[i]);\n }\n break;\n case('f'):\n ++i;\n if (i<argc)\n {\n camera_fov = atoi(argv[i]);\n }\n break;\n case('o'):\n ++i;\n if (i<argc)\n {\n camera_offset = atoi(argv[i]);\n }\n break;\n \n case('l'):\n ++i;\n if (i<argc)\n {\n osgDB::Registry::instance()->loadLibrary(argv[i]);\n }\n break;\n case('e'):\n ++i;\n if (i<argc)\n {\n std::string libName = osgDB::Registry::instance()->createLibraryNameForExt(argv[i]);\n osgDB::Registry::instance()->loadLibrary(libName);\n }\n break;\n }\n } else\n {\n osg::Node *node = osgDB::readNodeFile( argv[i] );\n\n if( node != (osg::Node *)0L )\n {\n if (node->getName().empty()) node->setName( argv[i] );\n nodeList.push_back(node);\n }\n }\n\n }\n\n if (nodeList.size()==0)\n {\n osg::notify(osg::WARN) << \"No data loaded.\"<<std::endl;\n exit(0);\n }\n \n \n\/*\n if (master) osg::notify(osg::NOTICE)<<\"set to MASTER, broadcasting on socketNumber \"<<socketNumber<<std::endl;\n else osg::notify(osg::NOTICE)<<\"set to SLAVE, reciving on socketNumber \"<<socketNumber<<std::endl;\n \n*\/\n \n\n if (nodeList.size()==1)\n {\n rootnode = nodeList.front();\n }\n else \/\/ size >1\n {\n osg::Group* group = new osg::Group();\n for(NodeList::iterator itr=nodeList.begin();\n itr!=nodeList.end();\n ++itr)\n {\n group->addChild(*itr);\n }\n\n rootnode = group;\n }\n\n return rootnode;\n}\n\n\nint main( int argc, char **argv )\n{\n\n \/\/ initialize the GLUT\n glutInit( &argc, argv );\n\n if (argc<2)\n {\n osg::notify(osg::NOTICE)<<\"usage:\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" osgcluster [options] infile1 [infile2 ...]\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n osg::notify(osg::NOTICE)<<\"options:\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -m - set this viewer to be master\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -s - set this viewer to be a slave\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -o - offset the slave camera from the master position\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" by specified number of degress. A positive offset \"<<std::endl;\n osg::notify(osg::NOTICE)<<\" turns camera towards right.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -f - set the horizontal field of view of the camera.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -n SocketNumber - set the socket number, defaults to 8100.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" to broadcast on if a master\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" to reciever on if a slave\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n osg::notify(osg::NOTICE)<<\" -l libraryName - load plugin of name libraryName\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" i.e. -l osgdb_pfb\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" Useful for loading reader\/writers which can load\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" other file formats in addition to its extension.\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" -e extensionName - load reader\/wrter plugin for file extension\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" i.e. -e pfb\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" Useful short hand for specifying full library name as\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" done with -l above, as it automatically expands to the\"<<std::endl;\n osg::notify(osg::NOTICE)<<\" full library name appropriate for each platform.\"<<std::endl;\n osg::notify(osg::NOTICE)<<std::endl;\n\n return 0;\n }\n\n osg::Timer timer;\n osg::Timer_t before_load = timer.tick();\n \n MySceneView::ViewerMode viewerMode = MySceneView::STAND_ALONE;\n int socketNumber=8100;\n float camera_fov=45.0f;\n float camera_offset=45.0f;\n\n osg::Node* rootnode = getNodeFromFiles( argc, argv, viewerMode, socketNumber,camera_fov,camera_offset);\n \n osg::Timer_t after_load = timer.tick();\n std::cout << \"Time for load = \"<<timer.delta_s(before_load,after_load)<<\" seconds\"<<std::endl;\n\n osg::ref_ptr<MySceneView> mySceneView = new MySceneView(viewerMode,socketNumber,camera_fov,osg::inDegrees(camera_offset));\n mySceneView->setSceneData(rootnode);\n\n \/\/ initialize the viewer.\n osgGLUT::Viewer viewer;\n viewer.setWindowTitle(argv[0]);\n viewer.addViewport( mySceneView.get() );\n \n \/\/ register trackball, flight and drive.\n viewer.registerCameraManipulator(new osgGA::TrackballManipulator);\n viewer.registerCameraManipulator(new osgGA::FlightManipulator);\n viewer.registerCameraManipulator(new osgGA::DriveManipulator);\n\n viewer.open();\n viewer.run();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2011, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <cuda_runtime_api.h>\n#include <omp.h>\n\n#include \"apps\/lib\/oskar_Settings.h\"\n#include \"apps\/lib\/oskar_set_up_sky.h\"\n#include \"apps\/lib\/oskar_set_up_telescope.h\"\n#include \"apps\/lib\/oskar_set_up_visibilities.h\"\n#include \"apps\/lib\/oskar_write_ms.h\"\n#include \"interferometry\/oskar_evaluate_baseline_uvw.h\"\n#include \"interferometry\/oskar_interferometer.h\"\n#include \"interferometry\/oskar_SimTime.h\"\n#include \"interferometry\/oskar_TelescopeModel.h\"\n#include \"interferometry\/oskar_Visibilities.h\"\n#include \"station\/oskar_station_model_resize.h\"\n#include \"sky\/oskar_SkyModel.h\"\n#include \"sky\/oskar_sky_model_split.h\"\n#include \"utility\/oskar_exit.h\"\n#include \"utility\/oskar_Mem.h\"\n#include \"math\/oskar_round_robin.h\"\n#include \"utility\/oskar_mem_init.h\"\n#include \"utility\/oskar_mem_free.h\"\n#include \"utility\/oskar_mem_add.h\"\n#include \"utility\/oskar_mem_clear_contents.h\"\n#include \"utility\/oskar_vector_types.h\"\n\n#include <QtCore\/QByteArray>\n#include <QtCore\/QTime>\n\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n\nusing std::min;\nusing std::pow;\n\nint main(int argc, char** argv)\n{\n int error = OSKAR_SUCCESS;\n\n \/\/ Parse command line.\n if (argc != 2)\n {\n fprintf(stderr, \"ERROR: Missing command line arguments.\\n\");\n fprintf(stderr, \"Usage: $ oskar_sim_benchmark [settings file]\\n\");\n return EXIT_FAILURE;\n }\n\n \/\/ Load the settings file.\n oskar_Settings settings;\n if (!settings.load(QString(argv[1]))) return EXIT_FAILURE;\n int type = settings.double_precision() ? OSKAR_DOUBLE : OSKAR_SINGLE;\n const oskar_SimTime* times = settings.obs().sim_time();\n\n \/\/ Find out how many GPU's we have.\n int device_count = 0;\n error = (int)cudaGetDeviceCount(&device_count);\n if (device_count < (int)settings.num_devices())\n {\n fprintf(stderr, \"ERROR: Only found %i devices, %i specified!\\n\",\n device_count, settings.num_devices());\n oskar_exit(OSKAR_ERR_UNKNOWN);\n }\n\n \/\/ Construct sky and telescope.\n oskar_SkyModel* sky_cpu = oskar_set_up_sky(settings);\n oskar_TelescopeModel* telescope_cpu = oskar_set_up_telescope(settings);\n if (sky_cpu == NULL) oskar_exit(OSKAR_ERR_UNKNOWN);\n if (telescope_cpu == NULL) oskar_exit(OSKAR_ERR_UNKNOWN);\n\n \/\/ Split the sky model into chunks.\n oskar_SkyModel* sky_chunk_cpu = NULL;\n int max_sources_per_chunk = min((int)settings.max_sources_per_chunk(),\n (int)ceil((double)sky_cpu->num_sources \/ (double)settings.num_devices()));\n\n int num_sky_chunks = 0;\n error = oskar_sky_model_split(&sky_chunk_cpu, &num_sky_chunks,\n max_sources_per_chunk, sky_cpu);\n if (error) oskar_exit(error);\n printf(\"* Input sky model of %i sources will be split into %i chunks. \"\n \"(max chunk size = %i)\\n\",\n sky_cpu->num_sources, num_sky_chunks, max_sources_per_chunk);\n\n \/\/ Create the global visibility structure on the CPU.\n oskar_Visibilities* vis_global = oskar_set_up_visibilities(settings,\n telescope_cpu, type | OSKAR_COMPLEX | OSKAR_MATRIX);\n\n \/\/ Set the number of host threads to use.\n int num_omp_threads = min(device_count, (int)settings.max_host_threads());\n omp_set_num_threads(num_omp_threads);\n\n if (num_omp_threads > (int)settings.num_devices())\n oskar_exit(OSKAR_ERR_DIMENSION_MISMATCH);\n\n \/\/ Create temporary and accumulation buffers to hold visibility amplitudes\n \/\/ (one per thread\/GPU).\n size_t num_bytes = settings.num_devices() * sizeof(oskar_Mem);\n oskar_Mem* vis_acc = (oskar_Mem*)malloc(num_bytes);\n oskar_Mem* vis_temp = (oskar_Mem*)malloc(num_bytes);\n for (int i = 0; i < (int)settings.num_devices(); ++i)\n {\n int complex_matrix = type | OSKAR_COMPLEX | OSKAR_MATRIX;\n error = oskar_mem_init(&vis_acc[i], complex_matrix, OSKAR_LOCATION_CPU,\n telescope_cpu->num_baselines() * times->num_vis_dumps, OSKAR_TRUE);\n if (error) oskar_exit(error);\n error = oskar_mem_init(&vis_temp[i], complex_matrix, OSKAR_LOCATION_CPU,\n telescope_cpu->num_baselines() * times->num_vis_dumps, OSKAR_TRUE);\n if (error) oskar_exit(error);\n }\n\n printf(\"\\n\");\n printf(\">> no. GPUs = %i\\n\", settings.num_devices());\n printf(\">> total sources = %i\\n\", sky_cpu->num_sources);\n printf(\">> no. stations = %i\\n\", telescope_cpu->num_stations);\n printf(\">> no. antennas per station = %i\\n\", telescope_cpu->station[0].num_elements);\n printf(\">> no. vis dumps = %i\\n\", times->num_vis_dumps);\n printf(\">> no. vis averages = %i\\n\", times->num_vis_ave);\n printf(\">> no. fringe averages = %i\\n\", times->num_fringe_ave);\n printf(\">> no. channels = %i\\n\", settings.obs().num_channels());\n printf(\"\\n\");\n\n\n\/\/ printf(\">>>> num_sources = %i\\n\", sky_cpu->num_sources);\n\/\/ typedef float real;\n\/\/ for (int source = 0; source < sky_cpu->num_sources; ++source)\n\/\/ {\n\/\/ printf(\">>>> source[%3i] % .2f % .2f | %.2f %.2f %.2f %.2f | %.2f %.2f | % .2f % .2f % .2f\\n\",\n\/\/ source,\n\/\/ ((real*)sky_cpu->RA.data)[source],\n\/\/ ((real*)sky_cpu->Dec.data)[source],\n\/\/ ((real*)sky_cpu->I.data)[source],\n\/\/ ((real*)sky_cpu->Q.data)[source],\n\/\/ ((real*)sky_cpu->U.data)[source],\n\/\/ ((real*)sky_cpu->V.data)[source],\n\/\/ ((real*)sky_cpu->reference_freq.data)[source],\n\/\/ ((real*)sky_cpu->spectral_index.data)[source],\n\/\/ ((real*)sky_cpu->rel_l.data)[source],\n\/\/ ((real*)sky_cpu->rel_m.data)[source],\n\/\/ ((real*)sky_cpu->rel_n.data)[source]);\n\/\/ }\n\n \/\/ ################## SIMULATION ###########################################\n printf(\"\\n== Starting simulation ...\\n\");\n\n for (int i = 0; i < settings.num_devices(); ++i)\n {\n cudaSetDevice(settings.use_devices()[i]);\n cudaDeviceSynchronize();\n }\n\n QTime timer;\n timer.start();\n int num_channels = settings.obs().num_channels();\n for (int c = 0; c < num_channels; ++c)\n {\n printf(\"\\n<< channel %i of %i >>\\n\", c + 1, num_channels);\n double freq = settings.obs().frequency(c);\n\n #pragma omp parallel shared(vis_acc, vis_temp)\n {\n int num_threads = omp_get_num_threads();\n int thread_id = omp_get_thread_num();\n int device_id = settings.use_devices()[thread_id];\n int num_chunks = 0, start_chunk = 0;\n oskar_round_robin(num_sky_chunks, num_threads, thread_id, &num_chunks,\n &start_chunk);\n cudaDeviceProp device_prop;\n cudaGetDeviceProperties(&device_prop, device_id);\n printf(\"*** Thread %i (of %i) using device %i [%s] to process sky \"\n \"chunks from %i to %i.\\n\", thread_id + 1, num_threads,\n device_id, device_prop.name, start_chunk,\n start_chunk + num_chunks - 1);\n error = cudaSetDevice(device_id);\n if (error) oskar_exit(error);\n for (int i = start_chunk; i < start_chunk + num_chunks; ++i)\n {\n printf(\"*** Sky chunk %i (num sources = %i), device[%i] (%s).\\n\",\n i, sky_chunk_cpu[i].num_sources, device_id, device_prop.name);\n error = oskar_interferometer(&(vis_temp[thread_id]),\n &(sky_chunk_cpu[i]), telescope_cpu, times, freq);\n if (error) oskar_exit(error);\n error = oskar_mem_add(&(vis_acc[thread_id]), &(vis_acc[thread_id]),\n &(vis_temp[thread_id]));\n if (error) oskar_exit(error);\n }\n }\n #pragma omp barrier\n\n oskar_Mem vis_amp;\n vis_global->get_channel_amps(&vis_amp, c);\n\n \/\/ Accumulate into global vis structure.\n for (int t = 0; t < num_omp_threads; ++t)\n {\n error = oskar_mem_add(&vis_amp, &vis_amp, &vis_acc[t]);\n if (error) oskar_exit(error);\n }\n\n } \/\/ end loop over channels\n printf(\"\\n== Simulation complete after %f seconds.\\n\",\n timer.elapsed() \/ 1000.0);\n\n \/\/ Compute baseline u,v,w coordinates for simulation.\n error = oskar_evaluate_baseline_uvw(vis_global, telescope_cpu, times);\n if (error) oskar_exit(error);\n\n \/\/ Write global visibilities to disk.\n if (!settings.obs().oskar_vis_filename().isEmpty())\n {\n QByteArray outname = settings.obs().oskar_vis_filename().toAscii();\n printf(\"\\n--> Writing visibility file: '%s'\\n\", outname.constData());\n error = vis_global->write(outname);\n if (error) oskar_exit(error);\n }\n\n \/\/ Delete data structures.\n delete vis_global;\n delete sky_cpu;\n delete telescope_cpu;\n for (int i = 0; i < (int)settings.num_devices(); ++i)\n {\n error = oskar_mem_free(&vis_acc[i]);\n if (error) oskar_exit(error);\n error = oskar_mem_free(&vis_temp[i]);\n if (error) oskar_exit(error);\n }\n free(vis_acc);\n free(vis_temp);\n free(sky_chunk_cpu);\n cudaDeviceReset();\n\n return EXIT_SUCCESS;\n}\n\n<commit_msg>update log message<commit_after>\/*\n * Copyright (c) 2011, The University of Oxford\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n * 3. Neither the name of the University of Oxford nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <cuda_runtime_api.h>\n#include <omp.h>\n\n#include \"apps\/lib\/oskar_Settings.h\"\n#include \"apps\/lib\/oskar_set_up_sky.h\"\n#include \"apps\/lib\/oskar_set_up_telescope.h\"\n#include \"apps\/lib\/oskar_set_up_visibilities.h\"\n#include \"apps\/lib\/oskar_write_ms.h\"\n#include \"interferometry\/oskar_evaluate_baseline_uvw.h\"\n#include \"interferometry\/oskar_interferometer.h\"\n#include \"interferometry\/oskar_SimTime.h\"\n#include \"interferometry\/oskar_TelescopeModel.h\"\n#include \"interferometry\/oskar_Visibilities.h\"\n#include \"station\/oskar_station_model_resize.h\"\n#include \"sky\/oskar_SkyModel.h\"\n#include \"sky\/oskar_sky_model_split.h\"\n#include \"utility\/oskar_exit.h\"\n#include \"utility\/oskar_Mem.h\"\n#include \"math\/oskar_round_robin.h\"\n#include \"utility\/oskar_mem_init.h\"\n#include \"utility\/oskar_mem_free.h\"\n#include \"utility\/oskar_mem_add.h\"\n#include \"utility\/oskar_mem_clear_contents.h\"\n#include \"utility\/oskar_vector_types.h\"\n\n#include <QtCore\/QByteArray>\n#include <QtCore\/QTime>\n\n#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n\nusing std::min;\nusing std::pow;\n\nint main(int argc, char** argv)\n{\n int error = OSKAR_SUCCESS;\n\n \/\/ Parse command line.\n if (argc != 2)\n {\n fprintf(stderr, \"ERROR: Missing command line arguments.\\n\");\n fprintf(stderr, \"Usage: $ oskar_sim_benchmark [settings file]\\n\");\n return EXIT_FAILURE;\n }\n\n \/\/ Load the settings file.\n oskar_Settings settings;\n if (!settings.load(QString(argv[1]))) return EXIT_FAILURE;\n int type = settings.double_precision() ? OSKAR_DOUBLE : OSKAR_SINGLE;\n const oskar_SimTime* times = settings.obs().sim_time();\n\n \/\/ Find out how many GPU's we have.\n int device_count = 0;\n error = (int)cudaGetDeviceCount(&device_count);\n if (device_count < (int)settings.num_devices())\n {\n fprintf(stderr, \"ERROR: Only found %i devices, %i specified!\\n\",\n device_count, settings.num_devices());\n oskar_exit(OSKAR_ERR_UNKNOWN);\n }\n\n \/\/ Construct sky and telescope.\n oskar_SkyModel* sky_cpu = oskar_set_up_sky(settings);\n oskar_TelescopeModel* telescope_cpu = oskar_set_up_telescope(settings);\n if (sky_cpu == NULL) oskar_exit(OSKAR_ERR_UNKNOWN);\n if (telescope_cpu == NULL) oskar_exit(OSKAR_ERR_UNKNOWN);\n\n \/\/ Split the sky model into chunks.\n oskar_SkyModel* sky_chunk_cpu = NULL;\n int max_sources_per_chunk = min((int)settings.max_sources_per_chunk(),\n (int)ceil((double)sky_cpu->num_sources \/ (double)settings.num_devices()));\n\n int num_sky_chunks = 0;\n error = oskar_sky_model_split(&sky_chunk_cpu, &num_sky_chunks,\n max_sources_per_chunk, sky_cpu);\n if (error) oskar_exit(error);\n printf(\"* Input sky model of %i sources will be split into %i chunks. \"\n \"(max chunk size = %i)\\n\",\n sky_cpu->num_sources, num_sky_chunks, max_sources_per_chunk);\n\n \/\/ Create the global visibility structure on the CPU.\n oskar_Visibilities* vis_global = oskar_set_up_visibilities(settings,\n telescope_cpu, type | OSKAR_COMPLEX | OSKAR_MATRIX);\n\n \/\/ Set the number of host threads to use.\n int num_omp_threads = min(device_count, (int)settings.max_host_threads());\n omp_set_num_threads(num_omp_threads);\n\n if (num_omp_threads > (int)settings.num_devices())\n oskar_exit(OSKAR_ERR_DIMENSION_MISMATCH);\n\n \/\/ Create temporary and accumulation buffers to hold visibility amplitudes\n \/\/ (one per thread\/GPU).\n size_t num_bytes = settings.num_devices() * sizeof(oskar_Mem);\n oskar_Mem* vis_acc = (oskar_Mem*)malloc(num_bytes);\n oskar_Mem* vis_temp = (oskar_Mem*)malloc(num_bytes);\n for (int i = 0; i < (int)settings.num_devices(); ++i)\n {\n int complex_matrix = type | OSKAR_COMPLEX | OSKAR_MATRIX;\n error = oskar_mem_init(&vis_acc[i], complex_matrix, OSKAR_LOCATION_CPU,\n telescope_cpu->num_baselines() * times->num_vis_dumps, OSKAR_TRUE);\n if (error) oskar_exit(error);\n error = oskar_mem_init(&vis_temp[i], complex_matrix, OSKAR_LOCATION_CPU,\n telescope_cpu->num_baselines() * times->num_vis_dumps, OSKAR_TRUE);\n if (error) oskar_exit(error);\n }\n\n printf(\"\\n\");\n printf(\">> no. GPUs = %i\\n\", settings.num_devices());\n printf(\">> total sources = %i\\n\", sky_cpu->num_sources);\n printf(\">> no. stations = %i\\n\", telescope_cpu->num_stations);\n printf(\">> no. antennas per station = %i\\n\", telescope_cpu->station[0].num_elements);\n printf(\">> no. vis dumps = %i\\n\", times->num_vis_dumps);\n printf(\">> no. vis averages = %i\\n\", times->num_vis_ave);\n printf(\">> no. fringe averages = %i\\n\", times->num_fringe_ave);\n printf(\">> no. channels = %i\\n\", settings.obs().num_channels());\n printf(\"\\n\");\n\n\n\/\/ printf(\">>>> num_sources = %i\\n\", sky_cpu->num_sources);\n\/\/ typedef float real;\n\/\/ for (int source = 0; source < sky_cpu->num_sources; ++source)\n\/\/ {\n\/\/ printf(\">>>> source[%3i] % .2f % .2f | %.2f %.2f %.2f %.2f | %.2f %.2f | % .2f % .2f % .2f\\n\",\n\/\/ source,\n\/\/ ((real*)sky_cpu->RA.data)[source],\n\/\/ ((real*)sky_cpu->Dec.data)[source],\n\/\/ ((real*)sky_cpu->I.data)[source],\n\/\/ ((real*)sky_cpu->Q.data)[source],\n\/\/ ((real*)sky_cpu->U.data)[source],\n\/\/ ((real*)sky_cpu->V.data)[source],\n\/\/ ((real*)sky_cpu->reference_freq.data)[source],\n\/\/ ((real*)sky_cpu->spectral_index.data)[source],\n\/\/ ((real*)sky_cpu->rel_l.data)[source],\n\/\/ ((real*)sky_cpu->rel_m.data)[source],\n\/\/ ((real*)sky_cpu->rel_n.data)[source]);\n\/\/ }\n\n \/\/ ################## SIMULATION ###########################################\n printf(\"\\n== Starting simulation ...\\n\");\n\n for (int i = 0; i < settings.num_devices(); ++i)\n {\n cudaSetDevice(settings.use_devices()[i]);\n cudaDeviceSynchronize();\n }\n\n QTime timer;\n timer.start();\n int num_channels = settings.obs().num_channels();\n for (int c = 0; c < num_channels; ++c)\n {\n printf(\"\\n<< channel %i of %i >>\\n\", c + 1, num_channels);\n double freq = settings.obs().frequency(c);\n\n #pragma omp parallel shared(vis_acc, vis_temp)\n {\n int num_threads = omp_get_num_threads();\n int thread_id = omp_get_thread_num();\n int device_id = settings.use_devices()[thread_id];\n int num_chunks = 0, start_chunk = 0;\n oskar_round_robin(num_sky_chunks, num_threads, thread_id, &num_chunks,\n &start_chunk);\n cudaDeviceProp device_prop;\n cudaGetDeviceProperties(&device_prop, device_id);\n printf(\"*** Thread %i (of %i) using device %i [%s] to process sky \"\n \"chunks from %i to %i.\\n\", thread_id + 1, num_threads,\n device_id, device_prop.name, start_chunk,\n start_chunk + num_chunks - 1);\n error = cudaSetDevice(device_id);\n if (error) oskar_exit(error);\n for (int i = start_chunk; i < start_chunk + num_chunks; ++i)\n {\n printf(\"*** Sky chunk %i (of %i) (num sources = %i), device[%i] (%s).\\n\",\n i, num_sky_chunks, sky_chunk_cpu[i].num_sources,\n device_id, device_prop.name);\n error = oskar_interferometer(&(vis_temp[thread_id]),\n &(sky_chunk_cpu[i]), telescope_cpu, times, freq);\n if (error) oskar_exit(error);\n error = oskar_mem_add(&(vis_acc[thread_id]), &(vis_acc[thread_id]),\n &(vis_temp[thread_id]));\n if (error) oskar_exit(error);\n }\n }\n #pragma omp barrier\n\n oskar_Mem vis_amp;\n vis_global->get_channel_amps(&vis_amp, c);\n\n \/\/ Accumulate into global vis structure.\n for (int t = 0; t < num_omp_threads; ++t)\n {\n error = oskar_mem_add(&vis_amp, &vis_amp, &vis_acc[t]);\n if (error) oskar_exit(error);\n }\n\n } \/\/ end loop over channels\n printf(\"\\n== Simulation complete after %f seconds.\\n\",\n timer.elapsed() \/ 1000.0);\n\n \/\/ Compute baseline u,v,w coordinates for simulation.\n error = oskar_evaluate_baseline_uvw(vis_global, telescope_cpu, times);\n if (error) oskar_exit(error);\n\n \/\/ Write global visibilities to disk.\n if (!settings.obs().oskar_vis_filename().isEmpty())\n {\n QByteArray outname = settings.obs().oskar_vis_filename().toAscii();\n printf(\"\\n--> Writing visibility file: '%s'\\n\", outname.constData());\n error = vis_global->write(outname);\n if (error) oskar_exit(error);\n }\n\n \/\/ Delete data structures.\n delete vis_global;\n delete sky_cpu;\n delete telescope_cpu;\n for (int i = 0; i < (int)settings.num_devices(); ++i)\n {\n error = oskar_mem_free(&vis_acc[i]);\n if (error) oskar_exit(error);\n error = oskar_mem_free(&vis_temp[i]);\n if (error) oskar_exit(error);\n }\n free(vis_acc);\n free(vis_temp);\n free(sky_chunk_cpu);\n cudaDeviceReset();\n\n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file base64url.c\n * @brief Base64url encoding scheme\n *\n * @section License\n *\n * SPDX-License-Identifier: GPL-2.0-or-later\n *\n * Copyright (C) 2010-2019 Oryx Embedded SARL. All rights reserved.\n *\n * This file is part of CycloneCrypto Open.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n * @author Oryx Embedded SARL (www.oryx-embedded.com)\n * @version 1.9.6\n **\/\n \n#include \"Base64Url.h\"\n\n#include <string>\n\nusing namespace std;\n\n\/\/ Base64url encoding table\nstatic const char base64urlEncTable[64] =\n {\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',\n 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\n 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_'\n };\n\n\/\/ Base64url decoding table\nstatic const uint8_t base64urlDecTable[128] =\n {\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x3E, 0xFF, 0xFF,\n 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,\n 0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0xFF, 0xFF, 0xFF, 0xFF, 0x3F,\n 0xFF, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,\n 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30, 0x31, 0x32, 0x33, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF\n };\n \nstd::string\nBase64Url::encode(const void * input, size_t inputLen) {\n uint8_t a;\n uint8_t b;\n uint8_t c;\n uint8_t d;\n\n std::string output;\n \n \/\/Point to the first byte of the input data\n const uint8_t *p = (const uint8_t *) input;\n \n \/\/Divide the input stream into blocks of 3 bytes\n size_t n = inputLen \/ 3;\n \n \/\/A full encoding quantum is always completed at the end of a quantity\n if (inputLen == (n * 3 + 1)) { \n \/\/ The final quantum of encoding input is exactly 8 bits\n if (input) {\n output = std::string(n * 4 + 2, ' ');\n\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = (p[n * 3] & 0x03) << 4;\n \n \/\/The final unit of encoded output will be two characters\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n }\n } else if(inputLen == (n * 3 + 2)) {\n \/\/ The final quantum of encoding input is exactly 16 bits\n if (input) {\n output = std::string(n * 4 + 3, ' ');\n\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = ((p[n * 3] & 0x03) << 4) | ((p[n * 3 + 1] & 0xF0) >> 4);\n c = (p[n * 3 + 1] & 0x0F) << 2;\n \n \/\/ The final unit of encoded output will be three characters followed\n \/\/ by one \"=\" padding character\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n output[n * 4 + 2] = base64urlEncTable[c];\n }\n } else {\n \/\/ The final quantum of encoding input is an integral multiple of 24 bits\n \/\/ The final unit of encoded output will be an integral multiple of 4 characters\n output = std::string(n * 4, ' ');\n }\n \n if (input) {\n \/\/ The input data is processed block by block\n while (n-- > 0) {\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = ((p[n * 3] & 0x03) << 4) | ((p[n * 3 + 1] & 0xF0) >> 4);\n c = ((p[n * 3 + 1] & 0x0F) << 2) | ((p[n * 3 + 2] & 0xC0) >> 6);\n d = p[n * 3 + 2] & 0x3F;\n \n \/\/ Map each 3-byte block to 4 printable characters using the Base64url character set\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n output[n * 4 + 2] = base64urlEncTable[c];\n output[n * 4 + 3] = base64urlEncTable[d];\n }\n }\n\n return output;\n}\n \n \n\/**\n * @brief Base64url decoding algorithm\n * @param[in] input Base64url-encoded string\n * @param[in] inputLen Length of the encoded string\n * @param[out] output Resulting decoded data\n * @param[out] outputLen Length of the decoded data\n * @return Error code\n **\/\n \nbool\nBase64Url::decode(const char *input, size_t inputLen, void *output, size_t *outputLen)\n{\n error_t error;\n uint32_t value;\n unsigned int c;\n size_t i;\n size_t n;\n uint8_t *p;\n \n \/\/Check parameters\n if(input == NULL && inputLen != 0)\n return false;\n if(outputLen == NULL)\n return false;\n \n \/\/Check the length of the input string\n if((inputLen % 4) == 1)\n return false;\n \n \/\/Initialize status code\n error = 0;\n \n \/\/Point to the buffer where to write the decoded data\n p = (uint8_t *) output;\n \n \/\/Initialize variables\n n = 0;\n value = 0;\n \n \/\/Process the Base64url-encoded string\n for(i = 0; i < inputLen && !error; i++)\n {\n \/\/Get current character\n c = (unsigned int) input[i];\n \n \/\/Check the value of the current character\n if(c < 128 && base64urlDecTable[c] < 64)\n\t{\n \/\/Decode the current character\n value = (value << 6) | base64urlDecTable[c];\n \n \/\/Divide the input stream into blocks of 4 characters\n if((i % 4) == 3)\n\t {\n\t \/\/Map each 4-character block to 3 bytes\n\t if(p != NULL)\n\t\t{\n\t\t p[n] = (value >> 16) & 0xFF;\n\t\t p[n + 1] = (value >> 8) & 0xFF;\n\t\t p[n + 2] = value & 0xFF;\n\t\t}\n \n\t \/\/Adjust the length of the decoded data\n\t n += 3;\n\t \/\/Decode next block\n\t value = 0;\n\t }\n\t}\n else\n\t{\n \/\/Implementations must reject the encoded data if it contains\n \/\/characters outside the base alphabet\n error = 1;\n\t}\n }\n \n \/\/Check status code\n if(!error)\n {\n \/\/All trailing pad characters are omitted in Base64url\n if((inputLen % 4) == 2)\n\t{\n \/\/The last block contains only 1 byte\n if(p != NULL)\n\t {\n\t \/\/Decode the last byte\n\t p[n] = (value >> 4) & 0xFF;\n\t }\n \n \/\/Adjust the length of the decoded data\n n++;\n\t}\n else if((inputLen % 4) == 3)\n\t{\n \/\/The last block contains only 2 bytes\n if(p != NULL)\n\t {\n\t \/\/Decode the last two bytes\n\t p[n] = (value >> 10) & 0xFF;\n\t p[n + 1] = (value >> 2) & 0xFF;\n\t }\n \n \/\/Adjust the length of the decoded data\n n += 2;\n\t}\n else\n\t{\n \/\/No pad characters in this case\n\t}\n }\n \n \/\/Total number of bytes that have been written\n *outputLen = n;\n \n \/\/Return status code\n return !error;\n}\n\nlong long\nBase64Url::decode_id(const std::string & s) {\n unsigned char * bytes = new unsigned char[4 * s.size()];\n size_t len = 0;\n decode(s.c_str(), s.size(), bytes, &len);\n \n long long id = (long long)bytes[0] + ((long long)bytes[1] << 8) + ((long long)bytes[2] << 16) + ((long long)bytes[3] << 24) + ((long long)bytes[4] << 32) + ((long long)bytes[5] << 40) + ((long long)bytes[6] << 48) + ((long long)bytes[7] << 56);\n delete[] bytes;\n return id;\n}\n\nstd::string\nBase64Url::encode_id(long long id) {\n unsigned char bytes[8];\n bytes[0] = id & 0xff;\n bytes[1] = (id >> 8) & 0xff;\n bytes[2] = (id >> 16) & 0xff;\n bytes[3] = (id >> 24) & 0xff;\n bytes[4] = (id >> 32) & 0xff;\n bytes[5] = (id >> 40) & 0xff;\n bytes[6] = (id >> 48) & 0xff;\n bytes[7] = (id >> 56) & 0xff;\n\n return encode(bytes, 8);\n}\n\nstd::string\nBase64Url::encode_id_bigendian(long long id) {\n unsigned char bytes[8];\n bytes[7] = id & 0xff;\n bytes[6] = (id >> 8) & 0xff;\n bytes[5] = (id >> 16) & 0xff;\n bytes[4] = (id >> 24) & 0xff;\n bytes[3] = (id >> 32) & 0xff;\n bytes[2] = (id >> 40) & 0xff;\n bytes[1] = (id >> 48) & 0xff;\n bytes[0] = (id >> 56) & 0xff;\n\n return encode(bytes, 8);\n}\n<commit_msg>Change type for WIN32<commit_after>\/**\n * @file base64url.c\n * @brief Base64url encoding scheme\n *\n * @section License\n *\n * SPDX-License-Identifier: GPL-2.0-or-later\n *\n * Copyright (C) 2010-2019 Oryx Embedded SARL. All rights reserved.\n *\n * This file is part of CycloneCrypto Open.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n * @author Oryx Embedded SARL (www.oryx-embedded.com)\n * @version 1.9.6\n **\/\n \n#include \"Base64Url.h\"\n\n#include <string>\n\nusing namespace std;\n\n\/\/ Base64url encoding table\nstatic const char base64urlEncTable[64] =\n {\n 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',\n 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',\n 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v',\n 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '_'\n };\n\n\/\/ Base64url decoding table\nstatic const uint8_t base64urlDecTable[128] =\n {\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x3E, 0xFF, 0xFF,\n 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B, 0x3C, 0x3D, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,\n 0xFF, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E,\n 0x0F, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0xFF, 0xFF, 0xFF, 0xFF, 0x3F,\n 0xFF, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,\n 0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30, 0x31, 0x32, 0x33, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF\n };\n \nstd::string\nBase64Url::encode(const void * input, size_t inputLen) {\n uint8_t a;\n uint8_t b;\n uint8_t c;\n uint8_t d;\n\n std::string output;\n \n \/\/Point to the first byte of the input data\n const uint8_t *p = (const uint8_t *) input;\n \n \/\/Divide the input stream into blocks of 3 bytes\n size_t n = inputLen \/ 3;\n \n \/\/A full encoding quantum is always completed at the end of a quantity\n if (inputLen == (n * 3 + 1)) { \n \/\/ The final quantum of encoding input is exactly 8 bits\n if (input) {\n output = std::string(n * 4 + 2, ' ');\n\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = (p[n * 3] & 0x03) << 4;\n \n \/\/The final unit of encoded output will be two characters\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n }\n } else if(inputLen == (n * 3 + 2)) {\n \/\/ The final quantum of encoding input is exactly 16 bits\n if (input) {\n output = std::string(n * 4 + 3, ' ');\n\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = ((p[n * 3] & 0x03) << 4) | ((p[n * 3 + 1] & 0xF0) >> 4);\n c = (p[n * 3 + 1] & 0x0F) << 2;\n \n \/\/ The final unit of encoded output will be three characters followed\n \/\/ by one \"=\" padding character\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n output[n * 4 + 2] = base64urlEncTable[c];\n }\n } else {\n \/\/ The final quantum of encoding input is an integral multiple of 24 bits\n \/\/ The final unit of encoded output will be an integral multiple of 4 characters\n output = std::string(n * 4, ' ');\n }\n \n if (input) {\n \/\/ The input data is processed block by block\n while (n-- > 0) {\n \/\/ Read input data\n a = (p[n * 3] & 0xFC) >> 2;\n b = ((p[n * 3] & 0x03) << 4) | ((p[n * 3 + 1] & 0xF0) >> 4);\n c = ((p[n * 3 + 1] & 0x0F) << 2) | ((p[n * 3 + 2] & 0xC0) >> 6);\n d = p[n * 3 + 2] & 0x3F;\n \n \/\/ Map each 3-byte block to 4 printable characters using the Base64url character set\n output[n * 4] = base64urlEncTable[a];\n output[n * 4 + 1] = base64urlEncTable[b];\n output[n * 4 + 2] = base64urlEncTable[c];\n output[n * 4 + 3] = base64urlEncTable[d];\n }\n }\n\n return output;\n}\n \n \n\/**\n * @brief Base64url decoding algorithm\n * @param[in] input Base64url-encoded string\n * @param[in] inputLen Length of the encoded string\n * @param[out] output Resulting decoded data\n * @param[out] outputLen Length of the decoded data\n * @return Error code\n **\/\n \nbool\nBase64Url::decode(const char *input, size_t inputLen, void *output, size_t *outputLen)\n{\n int error;\n uint32_t value;\n unsigned int c;\n size_t i;\n size_t n;\n uint8_t *p;\n \n \/\/Check parameters\n if(input == NULL && inputLen != 0)\n return false;\n if(outputLen == NULL)\n return false;\n \n \/\/Check the length of the input string\n if((inputLen % 4) == 1)\n return false;\n \n \/\/Initialize status code\n error = 0;\n \n \/\/Point to the buffer where to write the decoded data\n p = (uint8_t *) output;\n \n \/\/Initialize variables\n n = 0;\n value = 0;\n \n \/\/Process the Base64url-encoded string\n for(i = 0; i < inputLen && !error; i++)\n {\n \/\/Get current character\n c = (unsigned int) input[i];\n \n \/\/Check the value of the current character\n if(c < 128 && base64urlDecTable[c] < 64)\n\t{\n \/\/Decode the current character\n value = (value << 6) | base64urlDecTable[c];\n \n \/\/Divide the input stream into blocks of 4 characters\n if((i % 4) == 3)\n\t {\n\t \/\/Map each 4-character block to 3 bytes\n\t if(p != NULL)\n\t\t{\n\t\t p[n] = (value >> 16) & 0xFF;\n\t\t p[n + 1] = (value >> 8) & 0xFF;\n\t\t p[n + 2] = value & 0xFF;\n\t\t}\n \n\t \/\/Adjust the length of the decoded data\n\t n += 3;\n\t \/\/Decode next block\n\t value = 0;\n\t }\n\t}\n else\n\t{\n \/\/Implementations must reject the encoded data if it contains\n \/\/characters outside the base alphabet\n error = 1;\n\t}\n }\n \n \/\/Check status code\n if(!error)\n {\n \/\/All trailing pad characters are omitted in Base64url\n if((inputLen % 4) == 2)\n\t{\n \/\/The last block contains only 1 byte\n if(p != NULL)\n\t {\n\t \/\/Decode the last byte\n\t p[n] = (value >> 4) & 0xFF;\n\t }\n \n \/\/Adjust the length of the decoded data\n n++;\n\t}\n else if((inputLen % 4) == 3)\n\t{\n \/\/The last block contains only 2 bytes\n if(p != NULL)\n\t {\n\t \/\/Decode the last two bytes\n\t p[n] = (value >> 10) & 0xFF;\n\t p[n + 1] = (value >> 2) & 0xFF;\n\t }\n \n \/\/Adjust the length of the decoded data\n n += 2;\n\t}\n else\n\t{\n \/\/No pad characters in this case\n\t}\n }\n \n \/\/Total number of bytes that have been written\n *outputLen = n;\n \n \/\/Return status code\n return !error;\n}\n\nlong long\nBase64Url::decode_id(const std::string & s) {\n unsigned char * bytes = new unsigned char[4 * s.size()];\n size_t len = 0;\n decode(s.c_str(), s.size(), bytes, &len);\n \n long long id = (long long)bytes[0] + ((long long)bytes[1] << 8) + ((long long)bytes[2] << 16) + ((long long)bytes[3] << 24) + ((long long)bytes[4] << 32) + ((long long)bytes[5] << 40) + ((long long)bytes[6] << 48) + ((long long)bytes[7] << 56);\n delete[] bytes;\n return id;\n}\n\nstd::string\nBase64Url::encode_id(long long id) {\n unsigned char bytes[8];\n bytes[0] = id & 0xff;\n bytes[1] = (id >> 8) & 0xff;\n bytes[2] = (id >> 16) & 0xff;\n bytes[3] = (id >> 24) & 0xff;\n bytes[4] = (id >> 32) & 0xff;\n bytes[5] = (id >> 40) & 0xff;\n bytes[6] = (id >> 48) & 0xff;\n bytes[7] = (id >> 56) & 0xff;\n\n return encode(bytes, 8);\n}\n\nstd::string\nBase64Url::encode_id_bigendian(long long id) {\n unsigned char bytes[8];\n bytes[7] = id & 0xff;\n bytes[6] = (id >> 8) & 0xff;\n bytes[5] = (id >> 16) & 0xff;\n bytes[4] = (id >> 24) & 0xff;\n bytes[3] = (id >> 32) & 0xff;\n bytes[2] = (id >> 40) & 0xff;\n bytes[1] = (id >> 48) & 0xff;\n bytes[0] = (id >> 56) & 0xff;\n\n return encode(bytes, 8);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013 The OpenMx Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"omxDefines.h\"\n#include \"omxState.h\"\n#include \"omxFitFunction.h\"\n#include \"omxNPSOLSpecific.h\"\n#include \"omxExportBackendState.h\"\n#include \"omxCsolnp.h\"\n#include \"nloptcpp.h\"\n#include \"Compute.h\"\n#include \"npsolswitch.h\"\n#include \"glue.h\"\n\nenum OptEngine {\n\tOptEngine_NPSOL,\n\tOptEngine_CSOLNP,\n OptEngine_NLOPT\n};\n\nclass ComputeGDBase : public omxCompute {\nprotected:\n\ttypedef omxCompute super;\n\tenum OptEngine engine;\n\tomxMatrix *fitMatrix;\n\tint verbose;\n\tdouble optimalityTolerance;\n\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n};\n\nclass omxComputeGD : public ComputeGDBase {\n\ttypedef ComputeGDBase super;\n\tbool useGradient;\n\tSEXP hessChol;\n\n\tint warmStartSize;\n\tdouble *warmStart;\n \npublic:\n\tomxComputeGD();\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n\tvirtual void computeImpl(FitContext *fc);\n\tvirtual void reportResults(FitContext *fc, MxRList *slots, MxRList *out);\n};\n\nclass omxCompute *newComputeGradientDescent()\n{\n\treturn new omxComputeGD();\n}\n\nclass ComputeCI : public ComputeGDBase {\n\ttypedef ComputeGDBase super;\n\tSEXP intervals, intervalCodes;\n\npublic:\n\tComputeCI();\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n\tvirtual void computeImpl(FitContext *fc);\n\tvirtual void reportResults(FitContext *fc, MxRList *slots, MxRList *out);\n};\n\nomxCompute *newComputeConfidenceInterval()\n{\n\treturn new ComputeCI();\n}\n\nomxComputeGD::omxComputeGD()\n{\n\thessChol = NULL;\n\twarmStart = NULL;\n}\n\nvoid ComputeGDBase::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n\n\tSEXP slotValue;\n\tfitMatrix = omxNewMatrixFromSlot(rObj, globalState, \"fitfunction\");\n\tsetFreeVarGroup(fitMatrix->fitFunction, varGroup);\n\tomxCompleteFitFunction(fitMatrix);\n\n\tScopedProtect p1(slotValue, R_do_slot(rObj, Rf_install(\"verbose\")));\n\tverbose = Rf_asInteger(slotValue);\n \n\tScopedProtect p2(slotValue, R_do_slot(rObj, Rf_install(\"tolerance\")));\n\toptimalityTolerance = Rf_asReal(slotValue);\n \n\tScopedProtect p3(slotValue, R_do_slot(rObj, Rf_install(\"engine\")));\n\tconst char *engine_name = CHAR(Rf_asChar(slotValue));\n\tif (strEQ(engine_name, \"CSOLNP\")) {\n\t\tengine = OptEngine_CSOLNP;\n\t} else if (strEQ(engine_name, \"NLOPT\")) {\n#ifdef HAS_NLOPT\n\t\tengine = OptEngine_NLOPT;\n#else\n\t\tRf_error(\"NLOPT is not available in this build\");\n#endif\n\t} else if (strEQ(engine_name, \"NPSOL\")) {\n#if HAS_NPSOL\n\t\tengine = OptEngine_NPSOL;\n#else\n\t\tRf_error(\"NPSOL is not available in this build\");\n#endif\n\t} else {\n\t\tRf_error(\"%s: engine %s unknown\", name, engine_name);\n\t}\n}\n\nvoid omxComputeGD::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n \n\tSEXP slotValue;\n\tScopedProtect p1(slotValue, R_do_slot(rObj, Rf_install(\"useGradient\")));\n\tif (Rf_length(slotValue)) {\n\t\tuseGradient = Rf_asLogical(slotValue);\n\t} else {\n\t\tuseGradient = Global->analyticGradients;\n\t}\n\n\tScopedProtect p2(slotValue, R_do_slot(rObj, Rf_install(\"warmStart\")));\n\tif (!Rf_isNull(slotValue)) {\n\t\tSEXP matrixDims;\n\t\tRf_protect(matrixDims = Rf_getAttrib(slotValue, R_DimSymbol));\n\t\tint *dimList = INTEGER(matrixDims);\n\t\tint rows = dimList[0];\n\t\tint cols = dimList[1];\n\t\tif (rows != cols) Rf_error(\"%s: warmStart matrix must be square\", name);\n\n\t\twarmStartSize = rows;\n\t\twarmStart = REAL(slotValue);\n\t}\n}\n\nvoid omxComputeGD::computeImpl(FitContext *fc)\n{\n size_t numParam = varGroup->vars.size();\n\tif (numParam <= 0) {\n\t\tomxRaiseErrorf(\"%s: model has no free parameters\", name);\n\t\treturn;\n\t}\n \n\tomxFitFunctionCompute(fitMatrix->fitFunction, FF_COMPUTE_PREOPTIMIZE, fc);\n\n\tfc->createChildren();\n \n\tswitch (engine) {\n case OptEngine_NPSOL:{\n#if HAS_NPSOL\n\t\tif (!hessChol) {\n\t\t\tRf_protect(hessChol = Rf_allocMatrix(REALSXP, numParam, numParam));\n\t\t}\n\t\tbool doWarm = false;\n\t\tif (warmStart) {\n\t\t\tif (warmStartSize != int(numParam)) {\n\t\t\t\tRf_warning(\"%s: warmStart size %d does not match number of free parameters %d (ignored)\",\n\t\t\t\t\t warmStartSize, numParam);\n\t\t\t} else {\n\t\t\t\tmemcpy(REAL(hessChol), warmStart, sizeof(double) * numParam * numParam);\n\t\t\t\tdoWarm = true;\n\t\t\t}\n\t\t}\n\t\tomxInvokeNPSOL(fitMatrix, fc, &fc->inform, useGradient, varGroup, verbose,\n\t\t\t REAL(hessChol), optimalityTolerance, doWarm);\n\t\tEigen::Map<Eigen::MatrixXd> hc(REAL(hessChol), numParam, numParam);\n\t\tEigen::MatrixXd hcT = hc.transpose();\n\t\tEigen::Map<Eigen::MatrixXd> dest(fc->getDenseHessUninitialized(), numParam, numParam);\n\t\tdest.noalias() = hcT * hc;\n#endif\n\t\tbreak;}\n case OptEngine_CSOLNP:\n omxInvokeCSOLNP(fitMatrix, fc, &fc->inform, varGroup, verbose,\n\t\t\t fc->getDenseHessUninitialized(), optimalityTolerance);\n\t break;\n#ifdef HAS_NLOPT\n case OptEngine_NLOPT:\n omxInvokeNLOPTorSANN(fitMatrix, fc, &fc->inform, varGroup, verbose,\n fc->getDenseHessUninitialized(), optimalityTolerance);\n break;\n#endif\n default: Rf_error(\"Optimizer %d is not available\", engine);\n\t}\n\tfc->wanted |= FF_COMPUTE_GRADIENT | FF_COMPUTE_HESSIAN;\n \n\t\/\/ It seems we cannot avoid this. Both optimizers can terminate\n\t\/\/ with fit not at the optimum.\n\tComputeFit(fitMatrix, FF_COMPUTE_FIT, fc);\n\n\tif (fitMatrix->rows == 1) {\n\t\tif (!std::isfinite(fc->fit) || fc->fit == 1e24) { \/\/ remove magic number 1e24 TODO\n\t\t\tstd::string diag = fc->getIterationError();\n\t\t\tomxRaiseErrorf(\"MxComputeGradientDescent: fitfunction %s evaluated to %f (%s)\",\n\t\t\t\t fitMatrix->name, fc->fit, diag.c_str());\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfc->wanted |= FF_COMPUTE_BESTFIT;\n \/*printf(\"fc->hess in computeGD\\n\");\n printf(\"%2f\", fc->hess[0]); putchar('\\n');\n printf(\"%2f\", fc->hess[1]); putchar('\\n');\n printf(\"%2f\", fc->hess[2]); putchar('\\n');\n *\/\n}\n\nvoid omxComputeGD::reportResults(FitContext *fc, MxRList *slots, MxRList *out)\n{\n\tomxPopulateFitFunction(fitMatrix, out);\n \n \/*printf(\"fc->hess in computeGD:report results\\n\");\n printf(\"%2f\", fc->hess[0]); putchar('\\n');\n printf(\"%2f\", fc->hess[1]); putchar('\\n');\n printf(\"%2f\", fc->hess[2]); putchar('\\n');\n*\/\n\tif (engine == OptEngine_NPSOL) {\n\t\tout->add(\"hessianCholesky\", hessChol);\n\t}\n}\n\nComputeCI::ComputeCI()\n{\n\tintervals = 0;\n\tintervalCodes = 0;\n}\n\nvoid ComputeCI::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n}\n\nvoid ComputeCI::computeImpl(FitContext *fc)\n{\n\tGlobal->unpackConfidenceIntervals();\n\n\tint numInts = (int) Global->intervalList.size();\n\tif (verbose >= 1) mxLog(\"%s: starting work on %d intervals\", name, numInts);\n\tif (!numInts) return;\n\n\t\/\/ I'm not sure why INFORM_NOT_AT_OPTIMUM is okay, but that's how it was.\n\tif (fc->inform >= INFORM_LINEAR_CONSTRAINTS_INFEASIBLE && fc->inform != INFORM_NOT_AT_OPTIMUM) {\n\t\t\/\/ TODO: allow forcing\n\t\tRf_warning(\"Not calculating confidence intervals because of optimizer status %d\", fc->inform);\n\t\treturn;\n\t}\n\n\tEigen::ArrayXd mle(fc->numParam);\n\tmemcpy(mle.data(), fc->est, sizeof(double) * fc->numParam);\n\n\tRf_protect(intervals = Rf_allocMatrix(REALSXP, numInts, 3));\n\tRf_protect(intervalCodes = Rf_allocMatrix(INTSXP, numInts, 2));\n\n\tswitch (engine) {\n\tcase OptEngine_NPSOL:\n#if HAS_NPSOL\n\t\tomxNPSOLConfidenceIntervals(fitMatrix, fc, optimalityTolerance);\n#endif\n\t\tbreak;\n\tcase OptEngine_CSOLNP:\n\t\tomxCSOLNPConfidenceIntervals(fitMatrix, fc, verbose, optimalityTolerance);\n\t\tbreak;\n#ifdef HAS_NLOPT\n case OptEngine_NLOPT:\n omxNLOPTorSANNConfidenceIntervals(fitMatrix, fc, optimalityTolerance);\n break;\n#endif\n\tdefault:\n\t\tRf_error(\"huh?\");\n\t}\n\n\tif(OMX_DEBUG) { mxLog(\"Populating CIs for %d fit functions.\", numInts); }\n\n\tmemcpy(fc->est, mle.data(), sizeof(double) * fc->numParam);\n\tfc->copyParamToModel();\n\n\tEigen::Map< Eigen::ArrayXXd > interval(REAL(intervals), numInts, 3);\n\tint* intervalCode = INTEGER(intervalCodes);\n\tfor(int j = 0; j < numInts; j++) {\n\t\tomxConfidenceInterval *oCI = Global->intervalList[j];\n\t\tinterval(j, 0) = oCI->min;\n\t\tomxRecompute(oCI->matrix, FF_COMPUTE_FIT, fc);\n\t\tinterval(j, 1) = omxMatrixElement(oCI->matrix, oCI->row, oCI->col);\n\t\tinterval(j, 2) = oCI->max;\n\t\tintervalCode[j] = oCI->lCode;\n\t\tintervalCode[j + numInts] = oCI->uCode;\n\t}\n}\n\nvoid ComputeCI::reportResults(FitContext *fc, MxRList *slots, MxRList *out)\n{\n\tif (!intervals) return;\n\n\tint numInt = (int) Global->intervalList.size();\n\n\tSEXP dimnames;\n\tSEXP names;\n\tRf_protect(dimnames = Rf_allocVector(VECSXP, 2));\n\tRf_protect(names = Rf_allocVector(STRSXP, 3));\n\tSET_STRING_ELT(names, 0, Rf_mkChar(\"lbound\"));\n\tSET_STRING_ELT(names, 1, Rf_mkChar(\"estimate\"));\n\tSET_STRING_ELT(names, 2, Rf_mkChar(\"ubound\"));\n\tSET_VECTOR_ELT(dimnames, 1, names);\n\n\tRf_protect(names = Rf_allocVector(STRSXP, numInt)); \/\/shared between the two matrices\n\tfor (int nx=0; nx < numInt; ++nx) {\n\t\tomxConfidenceInterval *ci = Global->intervalList[nx];\n\t\tSET_STRING_ELT(names, nx, Rf_mkChar(ci->name));\n\t}\n\tSET_VECTOR_ELT(dimnames, 0, names);\n\n\tRf_setAttrib(intervals, R_DimNamesSymbol, dimnames);\n\n\tout->add(\"confidenceIntervals\", intervals);\n\n\tRf_protect(dimnames = Rf_allocVector(VECSXP, 2));\n\tSET_VECTOR_ELT(dimnames, 0, names);\n\n\tRf_protect(names = Rf_allocVector(STRSXP, 2));\n\tSET_STRING_ELT(names, 0, Rf_mkChar(\"lbound\"));\n\tSET_STRING_ELT(names, 1, Rf_mkChar(\"ubound\"));\n\tSET_VECTOR_ELT(dimnames, 1, names);\n\n\tRf_setAttrib(intervalCodes, R_DimNamesSymbol, dimnames);\n\n\tout->add(\"confidenceIntervalCodes\", intervalCodes);\n}\n<commit_msg>(Re?)enable parallel processing for confidence intervals<commit_after>\/*\n * Copyright 2013 The OpenMx Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"omxDefines.h\"\n#include \"omxState.h\"\n#include \"omxFitFunction.h\"\n#include \"omxNPSOLSpecific.h\"\n#include \"omxExportBackendState.h\"\n#include \"omxCsolnp.h\"\n#include \"nloptcpp.h\"\n#include \"Compute.h\"\n#include \"npsolswitch.h\"\n#include \"glue.h\"\n\nenum OptEngine {\n\tOptEngine_NPSOL,\n\tOptEngine_CSOLNP,\n OptEngine_NLOPT\n};\n\nclass ComputeGDBase : public omxCompute {\nprotected:\n\ttypedef omxCompute super;\n\tenum OptEngine engine;\n\tomxMatrix *fitMatrix;\n\tint verbose;\n\tdouble optimalityTolerance;\n\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n};\n\nclass omxComputeGD : public ComputeGDBase {\n\ttypedef ComputeGDBase super;\n\tbool useGradient;\n\tSEXP hessChol;\n\n\tint warmStartSize;\n\tdouble *warmStart;\n \npublic:\n\tomxComputeGD();\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n\tvirtual void computeImpl(FitContext *fc);\n\tvirtual void reportResults(FitContext *fc, MxRList *slots, MxRList *out);\n};\n\nclass omxCompute *newComputeGradientDescent()\n{\n\treturn new omxComputeGD();\n}\n\nclass ComputeCI : public ComputeGDBase {\n\ttypedef ComputeGDBase super;\n\tSEXP intervals, intervalCodes;\n\npublic:\n\tComputeCI();\n\tvirtual void initFromFrontend(omxState *, SEXP rObj);\n\tvirtual void computeImpl(FitContext *fc);\n\tvirtual void reportResults(FitContext *fc, MxRList *slots, MxRList *out);\n};\n\nomxCompute *newComputeConfidenceInterval()\n{\n\treturn new ComputeCI();\n}\n\nomxComputeGD::omxComputeGD()\n{\n\thessChol = NULL;\n\twarmStart = NULL;\n}\n\nvoid ComputeGDBase::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n\n\tSEXP slotValue;\n\tfitMatrix = omxNewMatrixFromSlot(rObj, globalState, \"fitfunction\");\n\tsetFreeVarGroup(fitMatrix->fitFunction, varGroup);\n\tomxCompleteFitFunction(fitMatrix);\n\n\tScopedProtect p1(slotValue, R_do_slot(rObj, Rf_install(\"verbose\")));\n\tverbose = Rf_asInteger(slotValue);\n \n\tScopedProtect p2(slotValue, R_do_slot(rObj, Rf_install(\"tolerance\")));\n\toptimalityTolerance = Rf_asReal(slotValue);\n \n\tScopedProtect p3(slotValue, R_do_slot(rObj, Rf_install(\"engine\")));\n\tconst char *engine_name = CHAR(Rf_asChar(slotValue));\n\tif (strEQ(engine_name, \"CSOLNP\")) {\n\t\tengine = OptEngine_CSOLNP;\n\t} else if (strEQ(engine_name, \"NLOPT\")) {\n#ifdef HAS_NLOPT\n\t\tengine = OptEngine_NLOPT;\n#else\n\t\tRf_error(\"NLOPT is not available in this build\");\n#endif\n\t} else if (strEQ(engine_name, \"NPSOL\")) {\n#if HAS_NPSOL\n\t\tengine = OptEngine_NPSOL;\n#else\n\t\tRf_error(\"NPSOL is not available in this build\");\n#endif\n\t} else {\n\t\tRf_error(\"%s: engine %s unknown\", name, engine_name);\n\t}\n}\n\nvoid omxComputeGD::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n \n\tSEXP slotValue;\n\tScopedProtect p1(slotValue, R_do_slot(rObj, Rf_install(\"useGradient\")));\n\tif (Rf_length(slotValue)) {\n\t\tuseGradient = Rf_asLogical(slotValue);\n\t} else {\n\t\tuseGradient = Global->analyticGradients;\n\t}\n\n\tScopedProtect p2(slotValue, R_do_slot(rObj, Rf_install(\"warmStart\")));\n\tif (!Rf_isNull(slotValue)) {\n\t\tSEXP matrixDims;\n\t\tRf_protect(matrixDims = Rf_getAttrib(slotValue, R_DimSymbol));\n\t\tint *dimList = INTEGER(matrixDims);\n\t\tint rows = dimList[0];\n\t\tint cols = dimList[1];\n\t\tif (rows != cols) Rf_error(\"%s: warmStart matrix must be square\", name);\n\n\t\twarmStartSize = rows;\n\t\twarmStart = REAL(slotValue);\n\t}\n}\n\nvoid omxComputeGD::computeImpl(FitContext *fc)\n{\n size_t numParam = varGroup->vars.size();\n\tif (numParam <= 0) {\n\t\tomxRaiseErrorf(\"%s: model has no free parameters\", name);\n\t\treturn;\n\t}\n \n\tomxFitFunctionCompute(fitMatrix->fitFunction, FF_COMPUTE_PREOPTIMIZE, fc);\n\n\tfc->createChildren();\n \n\tswitch (engine) {\n case OptEngine_NPSOL:{\n#if HAS_NPSOL\n\t\tif (!hessChol) {\n\t\t\tRf_protect(hessChol = Rf_allocMatrix(REALSXP, numParam, numParam));\n\t\t}\n\t\tbool doWarm = false;\n\t\tif (warmStart) {\n\t\t\tif (warmStartSize != int(numParam)) {\n\t\t\t\tRf_warning(\"%s: warmStart size %d does not match number of free parameters %d (ignored)\",\n\t\t\t\t\t warmStartSize, numParam);\n\t\t\t} else {\n\t\t\t\tmemcpy(REAL(hessChol), warmStart, sizeof(double) * numParam * numParam);\n\t\t\t\tdoWarm = true;\n\t\t\t}\n\t\t}\n\t\tomxInvokeNPSOL(fitMatrix, fc, &fc->inform, useGradient, varGroup, verbose,\n\t\t\t REAL(hessChol), optimalityTolerance, doWarm);\n\t\tEigen::Map<Eigen::MatrixXd> hc(REAL(hessChol), numParam, numParam);\n\t\tEigen::MatrixXd hcT = hc.transpose();\n\t\tEigen::Map<Eigen::MatrixXd> dest(fc->getDenseHessUninitialized(), numParam, numParam);\n\t\tdest.noalias() = hcT * hc;\n#endif\n\t\tbreak;}\n case OptEngine_CSOLNP:\n omxInvokeCSOLNP(fitMatrix, fc, &fc->inform, varGroup, verbose,\n\t\t\t fc->getDenseHessUninitialized(), optimalityTolerance);\n\t break;\n#ifdef HAS_NLOPT\n case OptEngine_NLOPT:\n omxInvokeNLOPTorSANN(fitMatrix, fc, &fc->inform, varGroup, verbose,\n fc->getDenseHessUninitialized(), optimalityTolerance);\n break;\n#endif\n default: Rf_error(\"Optimizer %d is not available\", engine);\n\t}\n\tfc->wanted |= FF_COMPUTE_GRADIENT | FF_COMPUTE_HESSIAN;\n \n\t\/\/ It seems we cannot avoid this. Both optimizers can terminate\n\t\/\/ with fit not at the optimum.\n\tComputeFit(fitMatrix, FF_COMPUTE_FIT, fc);\n\n\tif (fitMatrix->rows == 1) {\n\t\tif (!std::isfinite(fc->fit) || fc->fit == 1e24) { \/\/ remove magic number 1e24 TODO\n\t\t\tstd::string diag = fc->getIterationError();\n\t\t\tomxRaiseErrorf(\"MxComputeGradientDescent: fitfunction %s evaluated to %f (%s)\",\n\t\t\t\t fitMatrix->name, fc->fit, diag.c_str());\n\t\t\treturn;\n\t\t}\n\t}\n\n\tfc->wanted |= FF_COMPUTE_BESTFIT;\n \/*printf(\"fc->hess in computeGD\\n\");\n printf(\"%2f\", fc->hess[0]); putchar('\\n');\n printf(\"%2f\", fc->hess[1]); putchar('\\n');\n printf(\"%2f\", fc->hess[2]); putchar('\\n');\n *\/\n}\n\nvoid omxComputeGD::reportResults(FitContext *fc, MxRList *slots, MxRList *out)\n{\n\tomxPopulateFitFunction(fitMatrix, out);\n \n \/*printf(\"fc->hess in computeGD:report results\\n\");\n printf(\"%2f\", fc->hess[0]); putchar('\\n');\n printf(\"%2f\", fc->hess[1]); putchar('\\n');\n printf(\"%2f\", fc->hess[2]); putchar('\\n');\n*\/\n\tif (engine == OptEngine_NPSOL) {\n\t\tout->add(\"hessianCholesky\", hessChol);\n\t}\n}\n\nComputeCI::ComputeCI()\n{\n\tintervals = 0;\n\tintervalCodes = 0;\n}\n\nvoid ComputeCI::initFromFrontend(omxState *globalState, SEXP rObj)\n{\n\tsuper::initFromFrontend(globalState, rObj);\n}\n\nvoid ComputeCI::computeImpl(FitContext *fc)\n{\n\tGlobal->unpackConfidenceIntervals();\n\n\tint numInts = (int) Global->intervalList.size();\n\tif (verbose >= 1) mxLog(\"%s: starting work on %d intervals\", name, numInts);\n\tif (!numInts) return;\n\n\t\/\/ I'm not sure why INFORM_NOT_AT_OPTIMUM is okay, but that's how it was.\n\tif (fc->inform >= INFORM_LINEAR_CONSTRAINTS_INFEASIBLE && fc->inform != INFORM_NOT_AT_OPTIMUM) {\n\t\t\/\/ TODO: allow forcing\n\t\tRf_warning(\"Not calculating confidence intervals because of optimizer status %d\", fc->inform);\n\t\treturn;\n\t}\n\n\tEigen::ArrayXd mle(fc->numParam);\n\tmemcpy(mle.data(), fc->est, sizeof(double) * fc->numParam);\n\n\tRf_protect(intervals = Rf_allocMatrix(REALSXP, numInts, 3));\n\tRf_protect(intervalCodes = Rf_allocMatrix(INTSXP, numInts, 2));\n\n\tfc->createChildren();\n\n\tswitch (engine) {\n\tcase OptEngine_NPSOL:\n#if HAS_NPSOL\n\t\tomxNPSOLConfidenceIntervals(fitMatrix, fc, optimalityTolerance);\n#endif\n\t\tbreak;\n\tcase OptEngine_CSOLNP:\n\t\tomxCSOLNPConfidenceIntervals(fitMatrix, fc, verbose, optimalityTolerance);\n\t\tbreak;\n#ifdef HAS_NLOPT\n case OptEngine_NLOPT:\n omxNLOPTorSANNConfidenceIntervals(fitMatrix, fc, optimalityTolerance);\n break;\n#endif\n\tdefault:\n\t\tRf_error(\"huh?\");\n\t}\n\n\tif(OMX_DEBUG) { mxLog(\"Populating CIs for %d fit functions.\", numInts); }\n\n\tmemcpy(fc->est, mle.data(), sizeof(double) * fc->numParam);\n\tfc->copyParamToModel();\n\n\tEigen::Map< Eigen::ArrayXXd > interval(REAL(intervals), numInts, 3);\n\tint* intervalCode = INTEGER(intervalCodes);\n\tfor(int j = 0; j < numInts; j++) {\n\t\tomxConfidenceInterval *oCI = Global->intervalList[j];\n\t\tinterval(j, 0) = oCI->min;\n\t\tomxRecompute(oCI->matrix, FF_COMPUTE_FIT, fc);\n\t\tinterval(j, 1) = omxMatrixElement(oCI->matrix, oCI->row, oCI->col);\n\t\tinterval(j, 2) = oCI->max;\n\t\tintervalCode[j] = oCI->lCode;\n\t\tintervalCode[j + numInts] = oCI->uCode;\n\t}\n}\n\nvoid ComputeCI::reportResults(FitContext *fc, MxRList *slots, MxRList *out)\n{\n\tif (!intervals) return;\n\n\tint numInt = (int) Global->intervalList.size();\n\n\tSEXP dimnames;\n\tSEXP names;\n\tRf_protect(dimnames = Rf_allocVector(VECSXP, 2));\n\tRf_protect(names = Rf_allocVector(STRSXP, 3));\n\tSET_STRING_ELT(names, 0, Rf_mkChar(\"lbound\"));\n\tSET_STRING_ELT(names, 1, Rf_mkChar(\"estimate\"));\n\tSET_STRING_ELT(names, 2, Rf_mkChar(\"ubound\"));\n\tSET_VECTOR_ELT(dimnames, 1, names);\n\n\tRf_protect(names = Rf_allocVector(STRSXP, numInt)); \/\/shared between the two matrices\n\tfor (int nx=0; nx < numInt; ++nx) {\n\t\tomxConfidenceInterval *ci = Global->intervalList[nx];\n\t\tSET_STRING_ELT(names, nx, Rf_mkChar(ci->name));\n\t}\n\tSET_VECTOR_ELT(dimnames, 0, names);\n\n\tRf_setAttrib(intervals, R_DimNamesSymbol, dimnames);\n\n\tout->add(\"confidenceIntervals\", intervals);\n\n\tRf_protect(dimnames = Rf_allocVector(VECSXP, 2));\n\tSET_VECTOR_ELT(dimnames, 0, names);\n\n\tRf_protect(names = Rf_allocVector(STRSXP, 2));\n\tSET_STRING_ELT(names, 0, Rf_mkChar(\"lbound\"));\n\tSET_STRING_ELT(names, 1, Rf_mkChar(\"ubound\"));\n\tSET_VECTOR_ELT(dimnames, 1, names);\n\n\tRf_setAttrib(intervalCodes, R_DimNamesSymbol, dimnames);\n\n\tout->add(\"confidenceIntervalCodes\", intervalCodes);\n}\n<|endoftext|>"} {"text":"<commit_before>\/************************************************************************\/\n\/* *\/\n\/* Copyright 2011-2012 by Ullrich Koethe *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/hci.iwr.uni-heidelberg.de\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* ullrich.koethe@iwr.uni-heidelberg.de or *\/\n\/* vigra@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person *\/\n\/* obtaining a copy of this software and associated documentation *\/\n\/* files (the \"Software\"), to deal in the Software without *\/\n\/* restriction, including without limitation the rights to use, *\/\n\/* copy, modify, merge, publish, distribute, sublicense, and\/or *\/\n\/* sell copies of the Software, and to permit persons to whom the *\/\n\/* Software is furnished to do so, subject to the following *\/\n\/* conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the *\/\n\/* Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES *\/\n\/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\/\n\/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\/\n\/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, *\/\n\/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *\/\n\/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *\/\n\/* OTHER DEALINGS IN THE SOFTWARE. *\/\n\/* *\/\n\/************************************************************************\/\n\n#define PY_ARRAY_UNIQUE_SYMBOL vigranumpyanalysis_PyArray_API\n#define NO_IMPORT_ARRAY\n\n#include <vigra\/numpy_array.hxx>\n#include <vigra\/numpy_array_converters.hxx>\n#include <vigra\/accumulator.hxx>\n#include <vigra\/timing.hxx>\n#include <map>\n\nnamespace python = boost::python;\n\nnamespace vigra\n{\n\nnamespace acc1 \n{\n\nstruct GetTagVisitor\n{\n mutable python::object result;\n \n template <class TAG, class Accu>\n void exec(Accu & a) const\n {\n result = python::object(get<TAG>(a));\n }\n};\n\ntemplate <class T>\nstruct InspectResultType\n{\n typedef typename PromoteTraits<T, double>::Promote type;\n};\n\ntemplate <class T, int N>\nstruct InspectResultType<TinyVector<T, N> >\n{\n typedef TinyVector<typename PromoteTraits<T, double>::Promote, N> type;\n};\n\ntemplate <class T>\nstruct InspectResultType<Singleband<T> >\n{\n typedef typename PromoteTraits<T, double>::Promote type;\n};\n\ntypedef std::map<std::string, std::string> AliasMap;\n\nAliasMap createAliasMap()\n{\n AliasMap res;\n res[\"DivideByCount<Central<PowerSum<2> > >\"] = \"Variance\";\n res[\"DivideUnbiased<Central<PowerSum<2> > >\"] = \"UnbiasedVariance\";\n res[\"DivideByCount<Principal<PowerSum<2> > >\"] = \"Principal<Variance>\";\n res[\"DivideByCount<FlatScatterMatrix>\"] = \"Covariance\";\n res[\"DivideByCount<PowerSum<1> >\"] = \"Mean\";\n res[\"PowerSum<1>\"] = \"Sum\";\n res[\"PowerSum<0>\"] = \"Count\";\n res[\"StandardQuantiles<AutoRangeHistogram<100> >\"] = \"Quantiles\";\n return res;\n}\n\nstatic AliasMap const & tagToAlias()\n{\n static const AliasMap m = createAliasMap();\n return m;\n}\n\nAliasMap createInverseAliasMap()\n{\n AliasMap res;\n for(AliasMap::const_iterator k = tagToAlias().begin(); k != tagToAlias().end(); ++k)\n res[normalizeString(k->second)] = normalizeString(k->first);\n return res;\n}\n\nstatic AliasMap const & aliasToTag()\n{\n static const AliasMap m = createInverseAliasMap();\n return m;\n}\n\nstatic std::string const & resolveAlias(std::string const & n)\n{\n AliasMap::const_iterator k = aliasToTag().find(n);\n if(k == aliasToTag().end())\n return n;\n else\n return k->second;\n}\n\nstatic std::string const & createAlias(std::string const & n)\n{\n AliasMap::const_iterator k = tagToAlias().find(n);\n if(k == tagToAlias().end())\n return n;\n else\n return k->second;\n}\n\ntemplate <class PixelType, class Accumulators>\nstruct PythonAccumulator\n: public DynamicAccumulatorChain<PixelType, Accumulators>\n{\n typedef DynamicAccumulatorChain<PixelType, Accumulators> BaseType;\n typedef typename BaseType::AccumulatorTags AccumulatorTags;\n \n void activate(std::string tag)\n {\n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec((BaseType &)*this, \n resolveAlias(normalizeString(tag)), detail::ActivateTagVisitor());\n vigra_precondition(found, std::string(\"PythonAccumulator::activate(): Tag '\") + tag + \"' not found.\");\n }\n \n python::list namesImpl(bool activeOnly) const\n {\n ArrayVector<std::string> a = BaseType::namesImpl(activeOnly);\n for(unsigned int k=0; k<a.size(); ++k)\n a[k] = createAlias(a[k]);\n\n std::sort(a.begin(), a.end());\n \n python::list result;\n for(unsigned int k=0; k<a.size(); ++k)\n result.append(python::object(a[k]));\n return result;\n }\n \n python::list activeNames() const\n {\n return namesImpl(true);\n }\n \n python::list names() const\n {\n return namesImpl(false);\n }\n \n python::object get(std::string tag)\n {\n GetTagVisitor v;\n \n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec(*this, \n resolveAlias(normalizeString(tag)), v);\n vigra_precondition(found, std::string(\"PythonAccumulator::get(): Tag '\") + tag + \"' not found.\");\n return v.result;\n }\n \n void mergeImpl(PythonAccumulator const & o)\n {\n this->merge(o);\n }\n};\n\ntemplate <class Accumulators, unsigned int ndim, class T>\nPythonAccumulator<typename InspectResultType<T>::type, Accumulators> *\npythonInspect(NumpyArray<ndim, T> in, python::object tags)\n{\n typedef PythonAccumulator<typename InspectResultType<T>::type, Accumulators> Accu;\n \n std::auto_ptr<Accu> res(new Accu);\n \n if(python::len(tags) == 0)\n {\n res->activateAll();\n }\n else if(PyString_Check(tags.ptr()))\n {\n res->activate(python::extract<std::string>(tags)());\n }\n else\n {\n for(int k=0; k<python::len(tags); ++k)\n {\n res->activate(python::extract<std::string>(tags[k])());\n }\n }\n \n {\n PyAllowThreads _pythread;\n \n collectStatistics(in.begin(), in.end(), *res);\n }\n \n return res.release();\n}\n\n} \/\/ namespace acc1\n\ntemplate <class T, class Accumulators>\nvoid definePythonAccumulator()\n{\n using namespace python;\n\n docstring_options doc_options(true, true, false);\n\n typedef typename acc1::InspectResultType<T>::type ResultType;\n \n typedef acc1::PythonAccumulator<ResultType, Accumulators> Accu;\n class_<Accu>(\"Accumulator\", python::no_init)\n .def(\"__getitem__\", &Accu::get)\n .def(\"activeNames\", &Accu::activeNames)\n .def(\"names\", &Accu::names)\n .def(\"merge\", &Accu::mergeImpl)\n ;\n \n def(\"extractFeatures\", &acc1::pythonInspect<Accumulators, 2, T>,\n (arg(\"image\"), arg(\"tags\") = \"\"),\n return_value_policy<manage_new_object>());\n \n def(\"extractFeatures\", &acc1::pythonInspect<Accumulators, 3, T>,\n (arg(\"volume\"), arg(\"tags\") = \"\"),\n return_value_policy<manage_new_object>());\n}\n\nvoid defineAccumulators()\n{\n using namespace python;\n using namespace vigra::acc1;\n\n docstring_options doc_options(true, true, false);\n\n definePythonAccumulator<Singleband<float>, \n Select<Count, Mean, Variance, Skewness, Kurtosis, \n UnbiasedVariance, UnbiasedSkewness, UnbiasedKurtosis,\n Minimum, Maximum, StandardQuantiles<AutoRangeHistogram<100> > > >();\n \n typedef Select<Count, Mean, Variance, Skewness, Kurtosis, Minimum, Maximum, \n Covariance, Principal<Variance>, Principal<Skewness>, Principal<Kurtosis> \n > VectorAccumulators;\n definePythonAccumulator<TinyVector<float, 2>, VectorAccumulators>();\n definePythonAccumulator<TinyVector<float, 3>, VectorAccumulators>();\n definePythonAccumulator<TinyVector<float, 4>, VectorAccumulators>();\n}\n\n} \/\/ namespace vigra\n<commit_msg>first working Python version of region accumulators<commit_after>\/************************************************************************\/\n\/* *\/\n\/* Copyright 2011-2012 by Ullrich Koethe *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/hci.iwr.uni-heidelberg.de\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* ullrich.koethe@iwr.uni-heidelberg.de or *\/\n\/* vigra@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person *\/\n\/* obtaining a copy of this software and associated documentation *\/\n\/* files (the \"Software\"), to deal in the Software without *\/\n\/* restriction, including without limitation the rights to use, *\/\n\/* copy, modify, merge, publish, distribute, sublicense, and\/or *\/\n\/* sell copies of the Software, and to permit persons to whom the *\/\n\/* Software is furnished to do so, subject to the following *\/\n\/* conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the *\/\n\/* Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES *\/\n\/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND *\/\n\/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\/\n\/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, *\/\n\/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *\/\n\/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR *\/\n\/* OTHER DEALINGS IN THE SOFTWARE. *\/\n\/* *\/\n\/************************************************************************\/\n\n#define PY_ARRAY_UNIQUE_SYMBOL vigranumpyanalysis_PyArray_API\n#define NO_IMPORT_ARRAY\n\n#ifdef _MSC_VER\n#pragma warning (disable: 4503)\n#endif\n\n#include <vigra\/numpy_array.hxx>\n#include <vigra\/numpy_array_converters.hxx>\n#include <vigra\/accumulator.hxx>\n#include <vigra\/timing.hxx>\n#include <map>\n\nnamespace python = boost::python;\n\nnamespace vigra\n{\n\nnamespace acc1 \n{\n\nstruct GetTag_Visitor\n{\n mutable python::object result;\n \n template <class T>\n void to_python(T const & t) const\n {\n result = python::object(t);\n }\n \n template <class T, int N>\n void to_python(TinyVector<T, N> const & t) const\n {\n NumpyArray<1, T> a = NumpyArray<1, T>(Shape1(N));\n for(int k=0; k<N; ++k)\n a(k) = t[k];\n result = python::object(a);\n }\n \n template <class TAG, class Accu>\n void exec(Accu & a) const\n {\n to_python(get<TAG>(a));\n }\n};\n\nstruct GetArrayTag_Visitor\n: public GetTag_Visitor\n{\n template <class TAG, class T, class Accu>\n struct ToPythonArray\n {\n static python::object exec(Accu & a)\n {\n unsigned int n = a.regionCount();\n Shape1 s(n);\n NumpyArray<1, T> res(s);\n \n for(unsigned int k=0; k<n; ++k)\n res(k) = get<TAG>(a, k);\n return python::object(res);\n }\n };\n \n template <class TAG, class T, int N, class Accu>\n struct ToPythonArray<TAG, TinyVector<T, N>, Accu>\n {\n static python::object exec(Accu & a)\n {\n unsigned int n = a.regionCount();\n Shape2 s(n, N);\n NumpyArray<2, T> res(s);\n \n for(unsigned int k=0; k<n; ++k)\n for(int j=0; j<N; ++j)\n res(k, j) = get<TAG>(a, k)[j];\n return python::object(res);\n }\n };\n \n template <class TAG, class T, class Accu>\n struct ToPythonArray<TAG, Matrix<T>, Accu>\n {\n static python::object exec(Accu & a)\n {\n unsigned int n = a.regionCount();\n Shape2 m = get<TAG>(a, 0).shape();\n Shape3 s(n, m[0], m[1]);\n NumpyArray<3, T> res(s);\n \n for(unsigned int k=0; k<n; ++k)\n for(int j=0; j<m[0]; ++j)\n for(int i=0; i<m[1]; ++i)\n res(k, j, i) = get<TAG>(a, k)(j,i);\n return python::object(res);\n }\n };\n \n template <class TAG, class T, class Accu>\n struct ToPythonArray<TAG, Error__Attempt_to_access_inactive_statistic<T>, Accu>\n {\n static python::object exec(Accu & a)\n {\n return python::object();\n }\n };\n \n template <class TAG, class T, int N, class Accu>\n struct ToPythonArray<TAG, std::pair<TinyVector<T,N>, Matrix<T> >, Accu>\n {\n static python::object exec(Accu & a)\n {\n return python::object();\n }\n };\n \n template <class TAG, class Accu>\n void exec(Accu & a) const\n {\n exec(a, (TAG *)0);\n }\n \n template <class Accu, class TAG>\n void exec(Accu & a, TAG *) const\n {\n this->result = ToPythonArray<TAG, typename LookupTag<TAG, Accu>::value_type, Accu>::exec(a);\n }\n \n template <class Accu, class TAG>\n void exec(Accu & a, Global<TAG> *) const\n {\n to_python(get<Global<TAG> >(a));\n }\n \n};\n\ntemplate <class T>\nstruct AccumulatorValueTypeTraits\n{\n \/\/ typedef typename PromoteTraits<T, double>::Promote type;\n typedef T type;\n};\n\n\/\/ template <class T, int N>\n\/\/ struct AccumulatorValueTypeTraits<TinyVector<T, N> >\n\/\/ {\n \/\/ typedef TinyVector<typename PromoteTraits<T, double>::Promote, N> type;\n\/\/ };\n\ntemplate <class T>\nstruct AccumulatorValueTypeTraits<Singleband<T> >\n{\n \/\/ typedef typename PromoteTraits<T, double>::Promote type;\n typedef T type;\n};\n\ntypedef std::map<std::string, std::string> AliasMap;\n\nAliasMap defineAliasMap()\n{\n AliasMap res;\n res[\"DivideByCount<Central<PowerSum<2> > >\"] = \"Variance\";\n res[\"DivideUnbiased<Central<PowerSum<2> > >\"] = \"UnbiasedVariance\";\n res[\"DivideByCount<Principal<PowerSum<2> > >\"] = \"Principal<Variance>\";\n res[\"DivideByCount<FlatScatterMatrix>\"] = \"Covariance\";\n res[\"DivideByCount<PowerSum<1> >\"] = \"Mean\";\n res[\"PowerSum<1>\"] = \"Sum\";\n res[\"PowerSum<0>\"] = \"Count\";\n res[\"StandardQuantiles<AutoRangeHistogram<100> >\"] = \"Quantiles\";\n res[\"StandardQuantiles<GlobalRangeHistogram<100> >\"] = \"Quantiles\";\n res[\"Coord<DivideByCount<PowerSum<1> > >\"] = \"GeometricCenter\";\n res[\"Coord<RootDivideByCount<Principal<PowerSum<2> > > >\"] = \"PrincipalRadii\";\n res[\"Coord<Principal<CoordinateSystem> >\"] = \"PrincipalCoordSystem\";\n res[\"Weighted<Coord<DivideByCount<PowerSum<1> > > >\"] = \"CenterOfMass\";\n res[\"Weighted<Coord<DivideByCount<Principal<PowerSum<2> > > > >\"] = \"MomentsOfInertia\";\n res[\"Weighted<Coord<Principal<CoordinateSystem> > >\"] = \"CoordSystemOfInertia\";\n return res;\n}\n\nAliasMap createTagToAlias(ArrayVector<std::string> const & names)\n{\n static const AliasMap aliases = defineAliasMap();\n AliasMap res;\n for(unsigned int k=0; k<names.size(); ++k)\n {\n AliasMap::const_iterator a = aliases.find(names[k]);\n if(a == aliases.end())\n res[names[k]] = names[k];\n else\n res[names[k]] = a->second;\n }\n return res; \n}\n\nAliasMap createAliasToTag(AliasMap const & tagToAlias)\n{\n AliasMap res;\n for(AliasMap::const_iterator k = tagToAlias.begin(); k != tagToAlias.end(); ++k)\n res[normalizeString(k->second)] = normalizeString(k->first);\n return res;\n}\n\ntemplate <class PixelType, class Accumulators>\nstruct PythonAccumulator\n: public DynamicAccumulatorChain<PixelType, Accumulators>\n{\n typedef DynamicAccumulatorChain<PixelType, Accumulators> BaseType;\n typedef typename BaseType::AccumulatorTags AccumulatorTags;\n \n void activate(std::string tag)\n {\n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec((BaseType &)*this, \n resolveAlias(tag), detail::ActivateTag_Visitor());\n vigra_precondition(found, std::string(\"PythonAccumulator::activate(): Tag '\") + tag + \"' not found.\");\n }\n \n python::list namesImpl(bool activeOnly) const\n {\n ArrayVector<std::string> a = BaseType::namesImpl(activeOnly);\n for(unsigned int k=0; k<a.size(); ++k)\n a[k] = createAlias(a[k]);\n\n std::sort(a.begin(), a.end());\n \n python::list result;\n for(unsigned int k=0; k<a.size(); ++k)\n result.append(python::object(a[k]));\n return result;\n }\n \n python::list activeNames() const\n {\n return namesImpl(true);\n }\n \n python::list names() const\n {\n return namesImpl(false);\n }\n \n python::object get(std::string tag)\n {\n GetTag_Visitor v;\n \n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec(*this, resolveAlias(tag), v);\n vigra_precondition(found, std::string(\"PythonAccumulator::get(): Tag '\") + tag + \"' not found.\");\n return v.result;\n }\n \n void merge(PythonAccumulator const & o)\n {\n BaseType::merge(o);\n }\n \n static std::string createAlias(std::string const & n)\n {\n AliasMap::const_iterator k = tagToAlias().find(n);\n if(k == tagToAlias().end())\n return n;\n else\n return k->second;\n }\n \n static std::string resolveAlias(std::string const & n)\n {\n AliasMap::const_iterator k = aliasToTag().find(normalizeString(n));\n if(k == aliasToTag().end())\n return n;\n else\n return k->second;\n }\n \n static AliasMap const & tagToAlias()\n {\n static const AliasMap a = createTagToAlias(tagNames());\n return a; \n }\n \n static AliasMap const & aliasToTag()\n {\n static const AliasMap a = createAliasToTag(tagToAlias());\n return a; \n }\n};\n\ntemplate <class Accumulators, unsigned int ndim, class T>\nPythonAccumulator<typename AccumulatorValueTypeTraits<T>::type, Accumulators> *\npythonInspect(NumpyArray<ndim, T> in, python::object tags)\n{\n typedef PythonAccumulator<typename AccumulatorValueTypeTraits<T>::type, Accumulators> Accu;\n \n std::auto_ptr<Accu> res(new Accu);\n \n if(python::len(tags) == 0)\n {\n res->activateAll();\n }\n else if(PyString_Check(tags.ptr()))\n {\n res->activate(python::extract<std::string>(tags)());\n }\n else\n {\n for(int k=0; k<python::len(tags); ++k)\n {\n res->activate(python::extract<std::string>(tags[k])());\n }\n }\n \n {\n PyAllowThreads _pythread;\n \n collectStatistics(in.begin(), in.end(), *res);\n }\n \n return res.release();\n}\n\ntemplate <class PixelType, class Accumulators>\nstruct PythonAccumulatorArray\n: public DynamicAccumulatorChainArray<PixelType, Accumulators>\n{\n typedef DynamicAccumulatorChainArray<PixelType, Accumulators> BaseType;\n typedef typename BaseType::AccumulatorTags AccumulatorTags;\n \n void activate(std::string tag)\n {\n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec((BaseType &)*this, \n resolveAlias(tag), detail::ActivateTag_Visitor());\n vigra_precondition(found, std::string(\"PythonAccumulatorArray::activate(): Tag '\") + tag + \"' not found.\");\n }\n \n python::list namesImpl(bool activeOnly) const\n {\n ArrayVector<std::string> a = BaseType::namesImpl(activeOnly);\n for(unsigned int k=0; k<a.size(); ++k)\n a[k] = createAlias(a[k]);\n\n std::sort(a.begin(), a.end());\n \n python::list result;\n for(unsigned int k=0; k<a.size(); ++k)\n result.append(python::object(a[k]));\n return result;\n }\n \n python::list activeNames() const\n {\n return namesImpl(true);\n }\n \n python::list names() const\n {\n ArrayVector<std::string> a;\n for(AliasMap::const_iterator k = tagToAlias().begin(); k != tagToAlias().end(); ++k)\n a.push_back(k->second);\n std::sort(a.begin(), a.end());\n \n python::list result;\n for(unsigned int k=0; k<a.size(); ++k)\n result.append(python::object(a[k]));\n return result;\n }\n \n static std::string createAlias(std::string const & n)\n {\n AliasMap::const_iterator k = tagToAlias().find(n);\n if(k == tagToAlias().end())\n return n;\n else\n return k->second;\n }\n \n static std::string resolveAlias(std::string const & n)\n {\n AliasMap::const_iterator k = aliasToTag().find(normalizeString(n));\n if(k == aliasToTag().end())\n return n;\n else\n return k->second;\n }\n \n static AliasMap const & tagToAlias()\n {\n static const AliasMap a = createTagToAlias(tagNames());\n return a; \n }\n \n static AliasMap const & aliasToTag()\n {\n static const AliasMap a = createAliasToTag(tagToAlias());\n return a; \n }\n \n python::object get(std::string tag)\n {\n GetArrayTag_Visitor v;\n \n bool found = detail::ApplyVisitorToTag<AccumulatorTags>::exec((BaseType &)*this, resolveAlias(tag), v);\n vigra_precondition(found, std::string(\"PythonAccumulatorArray::get(): Tag '\") + tag + \"' not found.\");\n return v.result;\n }\n \n \/\/ void merge(PythonAccumulator const & o)\n \/\/ {\n \/\/ BaseType::merge(o);\n \/\/ }\n};\n\ntemplate <class Accumulators, unsigned int ndim, class T>\nPythonAccumulatorArray<typename CoupledIteratorType<ndim, \n typename AccumulatorValueTypeTraits<T>::type, npy_uint32>::type::value_type, Accumulators> *\npythonRegionInspect(NumpyArray<ndim, T> in, \n NumpyArray<ndim, Singleband<npy_uint32> > labels,\n python::object tags)\n{\n typedef typename CoupledIteratorType<ndim, typename AccumulatorValueTypeTraits<T>::type, npy_uint32>::type Iterator;\n typedef Iterator::value_type Handle;\n typedef PythonAccumulatorArray<Handle, Accumulators> Accu;\n \n std::auto_ptr<Accu> res(new Accu);\n \n if(python::len(tags) == 0)\n {\n res->activateAll();\n }\n else if(PyString_Check(tags.ptr()))\n {\n res->activate(python::extract<std::string>(tags)());\n }\n else\n {\n for(int k=0; k<python::len(tags); ++k)\n {\n res->activate(python::extract<std::string>(tags[k])());\n }\n }\n \n {\n PyAllowThreads _pythread;\n \n Iterator i = createCoupledIterator(in, labels),\n end = i.getEndIterator();\n collectStatistics(i, end, *res);\n }\n \n return res.release();\n}\n\n} \/\/ namespace acc1\n\ntemplate <class T, class Accumulators>\nvoid definePythonAccumulator()\n{\n using namespace python;\n\n docstring_options doc_options(true, true, false);\n\n typedef typename acc1::AccumulatorValueTypeTraits<T>::type ResultType;\n \n typedef acc1::PythonAccumulator<ResultType, Accumulators> Accu;\n class_<Accu>(\"Accumulator\", python::no_init)\n .def(\"__getitem__\", &Accu::get)\n .def(\"activeNames\", &Accu::activeNames)\n .def(\"names\", &Accu::names)\n .def(\"merge\", &Accu::merge)\n ;\n \n def(\"extractFeatures\", &acc1::pythonInspect<Accumulators, 2, T>,\n (arg(\"image\"), arg(\"tags\") = \"\"),\n return_value_policy<manage_new_object>());\n \n def(\"extractFeatures\", &acc1::pythonInspect<Accumulators, 3, T>,\n (arg(\"volume\"), arg(\"tags\") = \"\"),\n return_value_policy<manage_new_object>());\n}\n\ntemplate <class T, class Accumulators>\nvoid definePythonAccumulatorArray()\n{\n using namespace python;\n\n docstring_options doc_options(true, true, false);\n\n typedef typename acc1::AccumulatorValueTypeTraits<T>::type ResultType;\n typedef typename CoupledIteratorType<2, ResultType, npy_uint32>::type Iterator;\n typedef Iterator::value_type Handle;\n \n typedef acc1::PythonAccumulatorArray<Handle, Accumulators> Accu;\n class_<Accu>(\"AccumulatorArray2\", python::no_init)\n .def(\"__getitem__\", &Accu::get)\n .def(\"activeNames\", &Accu::activeNames)\n .def(\"names\", &Accu::names)\n\/\/ .def(\"merge\", &Accu::merge)\n ;\n \n def(\"extractRegionFeatures\", &acc1::pythonRegionInspect<Accumulators, 2, T>,\n (arg(\"image\"), arg(\"labels\"), arg(\"tags\") = \"\"),\n return_value_policy<manage_new_object>());\n \n \/\/ def(\"extractFeatures\", &acc1::pythonInspect<Accumulators, 3, T>,\n \/\/ (arg(\"volume\"), arg(\"tags\") = \"\"),\n \/\/ return_value_policy<manage_new_object>());\n}\n\nvoid defineAccumulators()\n{\n using namespace python;\n using namespace vigra::acc1;\n\n docstring_options doc_options(true, true, false);\n \n NumpyArrayConverter<NumpyArray<1, float> >();\n NumpyArrayConverter<NumpyArray<2, MultiArrayIndex> >();\n NumpyArrayConverter<NumpyArray<3, double> >();\n\n typedef Select<Count, Mean, Variance, Skewness, Kurtosis, \n UnbiasedVariance, UnbiasedSkewness, UnbiasedKurtosis,\n Minimum, Maximum, StandardQuantiles<AutoRangeHistogram<100> > \n > ScalarAccumulators;\n definePythonAccumulator<Singleband<float>, ScalarAccumulators>();\n \n typedef Select<Count, Mean, Variance, Skewness, Kurtosis, \n Covariance, Principal<Variance>, Principal<Skewness>, Principal<Kurtosis>,\n Minimum, Maximum, Principal<Minimum>, Principal<Maximum>\n > VectorAccumulators;\n definePythonAccumulator<TinyVector<float, 2>, VectorAccumulators>();\n definePythonAccumulator<TinyVector<float, 3>, VectorAccumulators>();\n definePythonAccumulator<TinyVector<float, 4>, VectorAccumulators>();\n\n typedef Select<Count, Mean, Variance, Skewness, Kurtosis, \n Minimum, Maximum, StandardQuantiles<GlobalRangeHistogram<100> >,\n GeometricCenter, PrincipalRadii, PrincipalCoordSystem,\n CenterOfMass, MomentsOfInertia, CoordSystemOfInertia,\n Coord<ArgMinWeight>, Coord<ArgMaxWeight>,\n DataArg<1>, WeightArg<1>, LabelArg<2>\n > ScalarRegionAccumulators;\n \/\/ typedef Select<Coord<ArgMinWeight>, \n \/\/ DataArg<1>, WeightArg<1>, LabelArg<2>\n \/\/ > ScalarRegionAccumulators;\n definePythonAccumulatorArray<Singleband<float>, ScalarRegionAccumulators>();\n}\n\n} \/\/ namespace vigra\n<|endoftext|>"} {"text":"<commit_before>\n#include <boost\/thread\/tss.hpp>\n#include \"vtrc-thread.h\"\n\n#include <google\/protobuf\/message.h>\n#include <google\/protobuf\/descriptor.h>\n\n#include \"vtrc-atomic.h\"\n#include \"vtrc-mutex.h\"\n#include \"vtrc-mutex-typedefs.h\"\n\n#include \"vtrc-protocol-layer.h\"\n\n#include \"vtrc-data-queue.h\"\n#include \"vtrc-hash-iface.h\"\n#include \"vtrc-transformer-iface.h\"\n\n#include \"vtrc-transport-iface.h\"\n\n#include \"vtrc-condition-queues.h\"\n#include \"vtrc-exception.h\"\n#include \"vtrc-call-context.h\"\n\n#include \"proto-helper\/message-utilities.h\"\n\n#include \"protocol\/vtrc-rpc-lowlevel.pb.h\"\n#include \"protocol\/vtrc-errors.pb.h\"\n\nnamespace vtrc { namespace common {\n\n namespace gpb = google::protobuf;\n\n namespace {\n\n typedef protocol_layer::message_queue_type message_queue_type;\n\n void raise_error( unsigned code )\n {\n throw vtrc::common::exception( code );\n }\n\n void raise_wait_error( wait_result_codes wr )\n {\n switch ( wr ) {\n case WAIT_RESULT_CANCELED:\n raise_error( vtrc_errors::ERR_CANCELED );\n break;\n case WAIT_RESULT_TIMEOUT:\n raise_error( vtrc_errors::ERR_TIMEOUT );\n break;\n default:\n break;\n }\n }\n\n static const size_t maximum_message_length = 1024 * 1024;\n\n struct rpc_unit_index {\n gpb::uint64 id_;\n rpc_unit_index( gpb::uint64 id )\n :id_(id)\n { }\n };\n\n inline bool operator < ( const rpc_unit_index &lhs,\n const rpc_unit_index &rhs )\n {\n return lhs.id_ < rhs.id_;\n }\n\n typedef vtrc_rpc_lowlevel::lowlevel_unit ll_unit_type;\n typedef vtrc::shared_ptr<ll_unit_type> ll_unit_sptr;\n\n typedef condition_queues<rpc_unit_index, ll_unit_sptr> rpc_queue_type;\n\n typedef boost::thread_specific_ptr<call_context> call_context_ptr;\n\n typedef std::map <\n const google::protobuf::MethodDescriptor *\n ,vtrc::shared_ptr<vtrc_rpc_lowlevel::options>\n > options_map_type;\n\n }\n\n struct protocol_layer::impl {\n\n transport_iface *connection_;\n protocol_layer *parent_;\n hasher_iface_sptr hash_maker_;\n hasher_iface_sptr hash_checker_;\n transformer_iface_sptr transformer_;\n transformer_iface_sptr reverter_;\n\n data_queue::queue_base_sptr queue_;\n\n rpc_queue_type rpc_queue_;\n vtrc::atomic<uint64_t> rpc_index_;\n\n call_context_ptr context_;\n\n options_map_type options_map_;\n mutable vtrc::shared_mutex options_map_lock_;\n\n impl( transport_iface *c )\n :connection_(c)\n ,hash_maker_(common::hash::create_default( ))\n ,hash_checker_(common::hash::create_default( ))\n\/\/ ,transformer_(common::transformers::erseefor::create( \"1234\", 4 ))\n\/\/ ,reverter_(common::transformers::erseefor::create( \"1234\", 4 ))\n ,transformer_(common::transformers::none::create( ))\n ,reverter_(common::transformers::none::create( ))\n ,queue_(data_queue::varint::create_parser(maximum_message_length))\n ,rpc_index_(100)\n {}\n\n std::string prepare_data( const char *data, size_t length)\n {\n \/* here is:\n * message =\n * <packed_size(data_length+hash_length)><hash(data)><data>\n *\/\n std::string result(queue_->pack_size(\n length + hash_maker_->hash_size( )));\n\n result.append( hash_maker_->get_data_hash(data, length ));\n result.append( data, data + length );\n\n \/*\n * message = transform( message )\n *\/\n\n transformer_->transform(\n result.empty( ) ? NULL : &result[0],\n result.size( ) );\n return result;\n }\n\n void process_data( const char *data, size_t length )\n {\n if( length > 0 ) {\n std::string next_data(data, data + length);\n\n const size_t old_size = queue_->messages( ).size( );\n\n \/*\n * message = revert( message )\n *\/\n reverter_->transform( &next_data[0], next_data.size( ) );\n queue_->append( &next_data[0], next_data.size( ));\n\n queue_->process( );\n\n if( queue_->messages( ).size( ) > old_size ) {\n parent_->on_data_ready( );\n }\n }\n\n }\n\n void drop_first( )\n {\n queue_->messages( ).pop_front( );\n }\n\n void send_data( const char *data, size_t length )\n {\n connection_->write( data, length );\n }\n\n void send_message( const gpb::Message &message )\n {\n std::string ser(message.SerializeAsString( ));\n send_data( ser.c_str( ), ser.size( ) );\n }\n\n uint64_t next_index( )\n {\n return ++rpc_index_;\n }\n\n \/\/ --------------- sett ----------------- \/\/\n\n message_queue_type &message_queue( )\n {\n return queue_->messages( );\n }\n\n const message_queue_type &message_queue( ) const\n {\n return queue_->messages( );\n }\n\n void parse_message( const std::string &mess,\n google::protobuf::Message &result )\n {\n const size_t hash_length = hash_checker_->hash_size( );\n const size_t diff_len = mess.size( ) - hash_length;\n result.ParseFromArray( mess.c_str( ) + hash_length, diff_len );\n }\n\n bool check_message( const std::string &mess )\n {\n const size_t hash_length = hash_checker_->hash_size( );\n const size_t diff_len = mess.size( ) - hash_length;\n\n bool result = false;\n\n if( mess.size( ) >= hash_length ) {\n result = hash_checker_->\n check_data_hash( mess.c_str( ) + hash_length,\n diff_len,\n mess.c_str( ) );\n }\n return result;\n }\n\n call_context *release_call_context( )\n {\n call_context *old = context_.get( );\n context_.release( );\n return old;\n }\n\n call_context *reset_call_context( call_context *cc )\n {\n context_.reset( cc );\n return cc;\n }\n\n const call_context *get_call_context( ) const\n {\n return context_.get( );\n }\n\n call_context *get_call_context( )\n {\n return context_.get( );\n }\n\n void change_sign_checker( hash_iface *new_signer )\n {\n hash_checker_.reset(new_signer);\n }\n\n void change_sign_maker( hash_iface *new_signer )\n {\n hash_maker_.reset(new_signer);\n }\n\n void change_transformer( transformer_iface *new_transformer )\n {\n transformer_.reset(new_transformer);\n }\n\n void change_reverter( transformer_iface *new_reverter)\n {\n reverter_.reset(new_reverter);\n }\n\n void pop_message( )\n {\n queue_->messages( ).pop_front( );\n }\n\n void push_rpc_message(uint64_t slot_id, ll_unit_sptr mess)\n {\n if( rpc_queue_.queue_exists( slot_id ) )\n rpc_queue_.write_queue( slot_id, mess );\n }\n\n void push_rpc_message_all( ll_unit_sptr mess)\n {\n rpc_queue_.write_all( mess );\n }\n\n void call_rpc_method( uint64_t slot_id, const ll_unit_type &llu )\n {\n rpc_queue_.add_queue( slot_id );\n send_message( llu );\n }\n\n void call_rpc_method( const ll_unit_type &llu )\n {\n send_message( llu );\n }\n\n void wait_call_slot( uint64_t slot_id, uint32_t millisec)\n {\n wait_result_codes qwr = rpc_queue_.wait_queue( slot_id,\n vtrc::chrono::milliseconds(millisec) );\n raise_wait_error( qwr );\n }\n\n void wait_call_slot(uint64_t slot_id, ll_unit_sptr &mess,\n uint32_t millisec)\n {\n wait_result_codes qwr =\n rpc_queue_.read(\n slot_id, mess,\n vtrc::chrono::milliseconds(millisec) );\n raise_wait_error( qwr );\n }\n\n void wait_call_slot(\n uint64_t slot_id, std::deque<ll_unit_sptr> &data_list,\n uint32_t millisec )\n {\n wait_result_codes qwr = rpc_queue_.read_queue(\n slot_id, data_list,\n vtrc::chrono::milliseconds(millisec)) ;\n raise_wait_error( qwr );\n }\n\n void close_slot( uint64_t slot_id )\n {\n rpc_queue_.erase_queue( slot_id );\n }\n\n void cancel_slot( uint64_t slot_id )\n {\n rpc_queue_.cancel( slot_id );\n }\n\n const vtrc_rpc_lowlevel::options &get_method_options(\n const gpb::MethodDescriptor *method)\n {\n upgradable_lock lck(options_map_lock_);\n\n options_map_type::const_iterator f(options_map_.find(method));\n\n vtrc::shared_ptr<vtrc_rpc_lowlevel::options> result;\n\n if( f == options_map_.end( ) ) {\n\n const vtrc_rpc_lowlevel::rpc_options_type &serv (\n method->service( )->options( )\n .GetExtension( vtrc_rpc_lowlevel::service_options ));\n\n const vtrc_rpc_lowlevel::rpc_options_type &meth (\n method->options( )\n .GetExtension( vtrc_rpc_lowlevel::method_options));\n\n result = vtrc::make_shared<vtrc_rpc_lowlevel::options>\n (serv.opt( ));\n if( meth.has_opt( ) )\n utilities::merge_messages( *result, meth.opt( ) );\n\n upgrade_to_unique ulck( lck );\n options_map_.insert( std::make_pair( method, result ) );\n\n } else {\n result = f->second;\n }\n\n return *result;\n }\n\n void cancel_all_slots( bool erase )\n {\n if( erase )\n rpc_queue_.erase_all( );\n else\n rpc_queue_.cancel_all( );\n }\n\n };\n\n protocol_layer::protocol_layer( transport_iface *connection )\n :impl_(new impl(connection))\n {\n impl_->parent_ = this;\n }\n\n protocol_layer::~protocol_layer( )\n {\n delete impl_;\n }\n\n void protocol_layer::process_data( const char *data, size_t length )\n {\n impl_->process_data( data, length );\n }\n\n std::string protocol_layer::prepare_data( const char *data, size_t length)\n {\n return impl_->prepare_data( data, length );\n }\n\n void protocol_layer::send_message(const google::protobuf::Message &message)\n {\n impl_->send_message( message );\n }\n\n call_context *protocol_layer::reset_call_context(call_context *cc)\n {\n return impl_->reset_call_context( cc );\n }\n\n call_context *protocol_layer::release_call_context( )\n {\n return impl_->release_call_context( );\n }\n\n const vtrc_rpc_lowlevel::options &protocol_layer::get_method_options(\n const gpb::MethodDescriptor *method)\n {\n return impl_->get_method_options( method );\n }\n\n\n const call_context *protocol_layer::get_call_context( ) const\n {\n return impl_->get_call_context( );\n }\n\n call_context *protocol_layer::get_call_context( )\n {\n return impl_->get_call_context( );\n }\n\n bool protocol_layer::check_message( const std::string &mess )\n {\n return impl_->check_message( mess );\n }\n\n void protocol_layer::parse_message( const std::string &mess,\n google::protobuf::Message &result )\n {\n impl_->parse_message(mess, result);\n }\n\n message_queue_type &protocol_layer::message_queue( )\n {\n return impl_->message_queue( );\n }\n\n const message_queue_type &protocol_layer::message_queue( ) const\n {\n return impl_->message_queue( );\n }\n\n void protocol_layer::change_hash_maker( hash_iface *new_hasher )\n {\n impl_->change_sign_maker( new_hasher );\n }\n\n void protocol_layer::change_hash_checker( hash_iface *new_hasher )\n {\n impl_->change_sign_checker( new_hasher );\n }\n\n void protocol_layer::change_transformer( transformer_iface *new_transformer)\n {\n impl_->change_transformer( new_transformer );\n }\n\n void protocol_layer::change_reverter( transformer_iface *new_reverter)\n {\n impl_->change_reverter( new_reverter );\n }\n\n void protocol_layer::pop_message( )\n {\n impl_->pop_message( );\n }\n\n uint64_t protocol_layer::next_index( )\n {\n return impl_->next_index( );\n }\n\n void protocol_layer::call_rpc_method( const ll_unit_type &llu )\n {\n impl_->call_rpc_method( llu );\n }\n\n void protocol_layer::call_rpc_method( uint64_t slot_id,\n const ll_unit_type &llu )\n {\n impl_->call_rpc_method( slot_id, llu );\n }\n\n void protocol_layer::wait_call_slot( uint64_t slot_id, uint32_t millisec)\n {\n impl_->wait_call_slot( slot_id, millisec);\n }\n\n void protocol_layer::wait_call_slot(uint64_t slot_id, ll_unit_sptr &mess,\n uint32_t millisec)\n {\n impl_->wait_call_slot( slot_id, mess, millisec);\n }\n\n void protocol_layer::wait_call_slot( uint64_t slot_id,\n std::deque<ll_unit_sptr> &data_list,\n uint32_t millisec )\n {\n impl_->wait_call_slot( slot_id, data_list, millisec);\n }\n\n void protocol_layer::close_slot(uint64_t slot_id)\n {\n impl_->close_slot( slot_id );\n }\n\n void protocol_layer::cancel_slot(uint64_t slot_id)\n {\n impl_->cancel_slot( slot_id );\n }\n\n void protocol_layer::cancel_all_slots( bool erase )\n {\n impl_->cancel_all_slots( erase );\n }\n\n void protocol_layer::push_rpc_message(uint64_t slot_id, ll_unit_sptr mess)\n {\n impl_->push_rpc_message(slot_id, mess);\n }\n\n void protocol_layer::push_rpc_message_all( ll_unit_sptr mess)\n {\n impl_->push_rpc_message_all( mess );\n }\n\n void protocol_layer::on_write_error(const boost::system::error_code & \/*e*\/)\n {\n\n }\n\n void protocol_layer::on_read_error(const boost::system::error_code & \/*e*\/)\n {\n\n }\n\n}}\n<commit_msg>protocol<commit_after>\n#include <boost\/thread\/tss.hpp>\n#include \"vtrc-thread.h\"\n\n#include <google\/protobuf\/message.h>\n#include <google\/protobuf\/descriptor.h>\n\n#include \"vtrc-atomic.h\"\n#include \"vtrc-mutex.h\"\n#include \"vtrc-mutex-typedefs.h\"\n\n#include \"vtrc-protocol-layer.h\"\n\n#include \"vtrc-data-queue.h\"\n#include \"vtrc-hash-iface.h\"\n#include \"vtrc-transformer-iface.h\"\n\n#include \"vtrc-transport-iface.h\"\n\n#include \"vtrc-condition-queues.h\"\n#include \"vtrc-exception.h\"\n#include \"vtrc-call-context.h\"\n\n#include \"proto-helper\/message-utilities.h\"\n\n#include \"protocol\/vtrc-rpc-lowlevel.pb.h\"\n#include \"protocol\/vtrc-errors.pb.h\"\n\nnamespace vtrc { namespace common {\n\n namespace gpb = google::protobuf;\n\n namespace {\n\n typedef protocol_layer::message_queue_type message_queue_type;\n\n void raise_error( unsigned code )\n {\n throw vtrc::common::exception( code );\n }\n\n void raise_wait_error( wait_result_codes wr )\n {\n switch ( wr ) {\n case WAIT_RESULT_CANCELED:\n raise_error( vtrc_errors::ERR_CANCELED );\n break;\n case WAIT_RESULT_TIMEOUT:\n raise_error( vtrc_errors::ERR_TIMEOUT );\n break;\n default:\n break;\n }\n }\n\n static const size_t maximum_message_length = 1024 * 1024;\n\n struct rpc_unit_index {\n gpb::uint64 id_;\n rpc_unit_index( gpb::uint64 id )\n :id_(id)\n { }\n };\n\n inline bool operator < ( const rpc_unit_index &lhs,\n const rpc_unit_index &rhs )\n {\n return lhs.id_ < rhs.id_;\n }\n\n typedef vtrc_rpc_lowlevel::lowlevel_unit ll_unit_type;\n typedef vtrc::shared_ptr<ll_unit_type> ll_unit_sptr;\n\n typedef condition_queues<rpc_unit_index, ll_unit_sptr> rpc_queue_type;\n\n typedef boost::thread_specific_ptr<call_context> call_context_ptr;\n\n typedef std::map <\n const google::protobuf::MethodDescriptor *\n ,vtrc::shared_ptr<vtrc_rpc_lowlevel::options>\n > options_map_type;\n\n }\n\n struct protocol_layer::impl {\n\n transport_iface *connection_;\n protocol_layer *parent_;\n hasher_iface_sptr hash_maker_;\n hasher_iface_sptr hash_checker_;\n transformer_iface_sptr transformer_;\n transformer_iface_sptr reverter_;\n\n data_queue::queue_base_sptr queue_;\n\n rpc_queue_type rpc_queue_;\n vtrc::atomic<uint64_t> rpc_index_;\n\n call_context_ptr context_;\n\n options_map_type options_map_;\n mutable vtrc::shared_mutex options_map_lock_;\n\n impl( transport_iface *c )\n :connection_(c)\n ,hash_maker_(common::hash::create_default( ))\n ,hash_checker_(common::hash::create_default( ))\n\/\/ ,transformer_(common::transformers::erseefor::create( \"1234\", 4 ))\n\/\/ ,reverter_(common::transformers::erseefor::create( \"1234\", 4 ))\n ,transformer_(common::transformers::none::create( ))\n ,reverter_(common::transformers::none::create( ))\n ,queue_(data_queue::varint::create_parser(maximum_message_length))\n ,rpc_index_(100)\n {}\n\n std::string prepare_data( const char *data, size_t length)\n {\n \/* here is:\n * message =\n * <packed_size(data_length+hash_length)><hash(data)><data>\n *\/\n std::string result(queue_->pack_size(\n length + hash_maker_->hash_size( )));\n\n result.append( hash_maker_->get_data_hash(data, length ));\n result.append( data, data + length );\n\n \/*\n * message = transform( message )\n *\/\n\n transformer_->transform(\n result.empty( ) ? NULL : &result[0],\n result.size( ) );\n return result;\n }\n\n void process_data( const char *data, size_t length )\n {\n if( length > 0 ) {\n std::string next_data(data, data + length);\n\n const size_t old_size = queue_->messages( ).size( );\n\n \/*\n * message = revert( message )\n *\/\n reverter_->transform( &next_data[0], next_data.size( ) );\n queue_->append( &next_data[0], next_data.size( ));\n\n queue_->process( );\n\n if( queue_->messages( ).size( ) > old_size ) {\n parent_->on_data_ready( );\n }\n }\n\n }\n\n void drop_first( )\n {\n queue_->messages( ).pop_front( );\n }\n\n void send_data( const char *data, size_t length )\n {\n connection_->write( data, length );\n }\n\n void send_message( const gpb::Message &message )\n {\n std::string ser(message.SerializeAsString( ));\n send_data( ser.c_str( ), ser.size( ) );\n }\n\n uint64_t next_index( )\n {\n return ++rpc_index_;\n }\n\n \/\/ --------------- sett ----------------- \/\/\n\n message_queue_type &message_queue( )\n {\n return queue_->messages( );\n }\n\n const message_queue_type &message_queue( ) const\n {\n return queue_->messages( );\n }\n\n void parse_message( const std::string &mess,\n google::protobuf::Message &result )\n {\n const size_t hash_length = hash_checker_->hash_size( );\n const size_t diff_len = mess.size( ) - hash_length;\n result.ParseFromArray( mess.c_str( ) + hash_length, diff_len );\n }\n\n bool check_message( const std::string &mess )\n {\n const size_t hash_length = hash_checker_->hash_size( );\n const size_t diff_len = mess.size( ) - hash_length;\n\n bool result = false;\n\n if( mess.size( ) >= hash_length ) {\n result = hash_checker_->\n check_data_hash( mess.c_str( ) + hash_length,\n diff_len,\n mess.c_str( ) );\n }\n return result;\n }\n\n call_context *release_call_context( )\n {\n call_context *old = context_.get( );\n context_.release( );\n return old;\n }\n\n call_context *reset_call_context( call_context *cc )\n {\n context_.reset( cc );\n return cc;\n }\n\n const call_context *get_call_context( ) const\n {\n return context_.get( );\n }\n\n call_context *get_call_context( )\n {\n return context_.get( );\n }\n\n void change_sign_checker( hash_iface *new_signer )\n {\n hash_checker_.reset(new_signer);\n }\n\n void change_sign_maker( hash_iface *new_signer )\n {\n hash_maker_.reset(new_signer);\n }\n\n void change_transformer( transformer_iface *new_transformer )\n {\n transformer_.reset(new_transformer);\n }\n\n void change_reverter( transformer_iface *new_reverter)\n {\n reverter_.reset(new_reverter);\n }\n\n void pop_message( )\n {\n queue_->messages( ).pop_front( );\n }\n\n void push_rpc_message(uint64_t slot_id, ll_unit_sptr mess)\n {\n if( rpc_queue_.queue_exists( slot_id ) )\n rpc_queue_.write_queue( slot_id, mess );\n }\n\n void push_rpc_message_all( ll_unit_sptr mess)\n {\n rpc_queue_.write_all( mess );\n }\n\n void call_rpc_method( uint64_t slot_id, const ll_unit_type &llu )\n {\n rpc_queue_.add_queue( slot_id );\n send_message( llu );\n }\n\n void call_rpc_method( const ll_unit_type &llu )\n {\n send_message( llu );\n }\n\n void wait_call_slot( uint64_t slot_id, uint32_t millisec)\n {\n wait_result_codes qwr = rpc_queue_.wait_queue( slot_id,\n vtrc::chrono::milliseconds(millisec) );\n raise_wait_error( qwr );\n }\n\n void wait_call_slot(uint64_t slot_id, ll_unit_sptr &mess,\n uint32_t millisec)\n {\n wait_result_codes qwr =\n rpc_queue_.read(\n slot_id, mess,\n vtrc::chrono::milliseconds(millisec) );\n raise_wait_error( qwr );\n }\n\n void wait_call_slot(uint64_t slot_id,\n std::deque<ll_unit_sptr> &data_list, uint32_t millisec )\n {\n wait_result_codes qwr = rpc_queue_.read_queue(\n slot_id, data_list,\n vtrc::chrono::milliseconds(millisec)) ;\n raise_wait_error( qwr );\n }\n\n void close_slot( uint64_t slot_id )\n {\n rpc_queue_.erase_queue( slot_id );\n }\n\n void cancel_slot( uint64_t slot_id )\n {\n rpc_queue_.cancel( slot_id );\n }\n\n const vtrc_rpc_lowlevel::options &get_method_options(\n const gpb::MethodDescriptor *method)\n {\n upgradable_lock lck(options_map_lock_);\n\n options_map_type::const_iterator f(options_map_.find(method));\n\n vtrc::shared_ptr<vtrc_rpc_lowlevel::options> result;\n\n if( f == options_map_.end( ) ) {\n\n const vtrc_rpc_lowlevel::rpc_options_type &serv (\n method->service( )->options( )\n .GetExtension( vtrc_rpc_lowlevel::service_options ));\n\n const vtrc_rpc_lowlevel::rpc_options_type &meth (\n method->options( )\n .GetExtension( vtrc_rpc_lowlevel::method_options));\n\n result = vtrc::make_shared<vtrc_rpc_lowlevel::options>\n (serv.opt( ));\n if( meth.has_opt( ) )\n utilities::merge_messages( *result, meth.opt( ) );\n\n upgrade_to_unique ulck( lck );\n options_map_.insert( std::make_pair( method, result ) );\n\n } else {\n result = f->second;\n }\n\n return *result;\n }\n\n void cancel_all_slots( bool erase )\n {\n if( erase )\n rpc_queue_.erase_all( );\n else\n rpc_queue_.cancel_all( );\n }\n\n };\n\n protocol_layer::protocol_layer( transport_iface *connection )\n :impl_(new impl(connection))\n {\n impl_->parent_ = this;\n }\n\n protocol_layer::~protocol_layer( )\n {\n delete impl_;\n }\n\n void protocol_layer::process_data( const char *data, size_t length )\n {\n impl_->process_data( data, length );\n }\n\n std::string protocol_layer::prepare_data( const char *data, size_t length)\n {\n return impl_->prepare_data( data, length );\n }\n\n void protocol_layer::send_message(const google::protobuf::Message &message)\n {\n impl_->send_message( message );\n }\n\n call_context *protocol_layer::reset_call_context(call_context *cc)\n {\n return impl_->reset_call_context( cc );\n }\n\n call_context *protocol_layer::release_call_context( )\n {\n return impl_->release_call_context( );\n }\n\n const vtrc_rpc_lowlevel::options &protocol_layer::get_method_options(\n const gpb::MethodDescriptor *method)\n {\n return impl_->get_method_options( method );\n }\n\n\n const call_context *protocol_layer::get_call_context( ) const\n {\n return impl_->get_call_context( );\n }\n\n call_context *protocol_layer::get_call_context( )\n {\n return impl_->get_call_context( );\n }\n\n bool protocol_layer::check_message( const std::string &mess )\n {\n return impl_->check_message( mess );\n }\n\n void protocol_layer::parse_message( const std::string &mess,\n google::protobuf::Message &result )\n {\n impl_->parse_message(mess, result);\n }\n\n message_queue_type &protocol_layer::message_queue( )\n {\n return impl_->message_queue( );\n }\n\n const message_queue_type &protocol_layer::message_queue( ) const\n {\n return impl_->message_queue( );\n }\n\n void protocol_layer::change_hash_maker( hash_iface *new_hasher )\n {\n impl_->change_sign_maker( new_hasher );\n }\n\n void protocol_layer::change_hash_checker( hash_iface *new_hasher )\n {\n impl_->change_sign_checker( new_hasher );\n }\n\n void protocol_layer::change_transformer( transformer_iface *new_transformer)\n {\n impl_->change_transformer( new_transformer );\n }\n\n void protocol_layer::change_reverter( transformer_iface *new_reverter)\n {\n impl_->change_reverter( new_reverter );\n }\n\n void protocol_layer::pop_message( )\n {\n impl_->pop_message( );\n }\n\n uint64_t protocol_layer::next_index( )\n {\n return impl_->next_index( );\n }\n\n void protocol_layer::call_rpc_method( const ll_unit_type &llu )\n {\n impl_->call_rpc_method( llu );\n }\n\n void protocol_layer::call_rpc_method( uint64_t slot_id,\n const ll_unit_type &llu )\n {\n impl_->call_rpc_method( slot_id, llu );\n }\n\n void protocol_layer::wait_call_slot( uint64_t slot_id, uint32_t millisec)\n {\n impl_->wait_call_slot( slot_id, millisec);\n }\n\n void protocol_layer::wait_call_slot(uint64_t slot_id, ll_unit_sptr &mess,\n uint32_t millisec)\n {\n impl_->wait_call_slot( slot_id, mess, millisec);\n }\n\n void protocol_layer::wait_call_slot( uint64_t slot_id,\n std::deque<ll_unit_sptr> &data_list,\n uint32_t millisec )\n {\n impl_->wait_call_slot( slot_id, data_list, millisec);\n }\n\n void protocol_layer::close_slot(uint64_t slot_id)\n {\n impl_->close_slot( slot_id );\n }\n\n void protocol_layer::cancel_slot(uint64_t slot_id)\n {\n impl_->cancel_slot( slot_id );\n }\n\n void protocol_layer::cancel_all_slots( bool erase )\n {\n impl_->cancel_all_slots( erase );\n }\n\n void protocol_layer::push_rpc_message(uint64_t slot_id, ll_unit_sptr mess)\n {\n impl_->push_rpc_message(slot_id, mess);\n }\n\n void protocol_layer::push_rpc_message_all( ll_unit_sptr mess)\n {\n impl_->push_rpc_message_all( mess );\n }\n\n void protocol_layer::on_write_error(const boost::system::error_code & \/*e*\/)\n {\n\n }\n\n void protocol_layer::on_read_error(const boost::system::error_code & \/*e*\/)\n {\n\n }\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\n\n\/**\n * delays\n * Copyright (c) 2015 Daniele Olmisani\n * \n * see LICENSE file\n *\n * Compile using: gcc -Wall delays.cpp -o delays\n *\/ \n\n#include <cstdio>\n#include <ctime>\n\n#include <unistd.h>\n\n\nvoid delay(int seconds) \n{\n\tstruct timespec current;\n\tclock_gettime(CLOCK_MONOTONIC, ¤t);\n\n\tlong threshold;\n\tthreshold = current.tv_sec + seconds;\n\n\twhile (current.tv_sec < threshold) {\n\n\t\tprintf(\"\\rdelays: %5lds\", threshold-current.tv_sec);\n\n\t\tsleep(1);\n\t\tclock_gettime(CLOCK_MONOTONIC, ¤t);\t\t\n\t}\n\tprintf(\"\\n\");\t\n}\n\n\nint main(int argc, char** argv) \n{\n\n\tsetbuf(stdout, NULL);\n\t\n\tdelay(10);\n\n\treturn 0;\n}\n<commit_msg>fixed behavior<commit_after>\n\n\/**\n * delays\n * Copyright (c) 2015 Daniele Olmisani\n * \n * see LICENSE file\n *\n * Compile using: gcc -Wall delays.cpp -o delays\n *\/ \n\n#include <cstdio>\n#include <ctime>\n#include <cstdlib>\n\n#include <unistd.h>\n\n\nvoid delay(int seconds) \n{\n\tstruct timespec current;\n\tclock_gettime(CLOCK_MONOTONIC, ¤t);\n\n\tlong threshold;\n\tthreshold = current.tv_sec + seconds;\n\n\twhile (current.tv_sec < threshold) {\n\n\t\tprintf(\"\\rdelays: %7lds\", threshold-current.tv_sec);\n\n\t\tsleep(1);\n\t\tclock_gettime(CLOCK_MONOTONIC, ¤t);\t\t\n\t}\n\tprintf(\"\\n\");\t\n}\n\n\nint main(int argc, char** argv) \n{\n\n\tsetbuf(stdout, NULL);\n\n\tif (argc != 2) {\n\t\tprintf(\"usage: %s <secs>\\n\", argv[0]);\n\t}\n\t\n\tint seconds;\n\tseconds = strtol(argv[1], 0, 0);\n\n\tdelay(seconds);\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * $Id$\n *\n * Project: libLAS - http:\/\/liblas.org - A BSD library for LAS format data.\n * Purpose: LAS Dimension implementation for C++ libLAS\n * Author: Howard Butler, hobu.inc@gmail.com\n *\n ******************************************************************************\n * Copyright (c) 2010, Howard Butler\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following\n * conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Martin Isenburg or Iowa Department\n * of Natural Resources nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n * OF SUCH DAMAGE.\n ****************************************************************************\/\n\n#include <libpc\/Dimension.hpp>\n\n#include <libpc\/exceptions.hpp>\n#include <libpc\/Utils.hpp>\n\nnamespace libpc\n{\n\nstd::string Dimension::s_fieldNames[Field_LAST];\nbool Dimension::s_fieldNamesValid = false;\n\n\nDimension::Dimension(Field field, DataType dataType)\n : m_dataType(dataType)\n , m_field(field)\n , m_endian(libpc::Endian_Little)\n , m_byteSize(0)\n , m_description(std::string(\"\"))\n , m_min(0.0)\n , m_max(0.0)\n , m_precise(false)\n , m_numericScale(0.0)\n , m_numericOffset(0.0)\n{\n m_byteSize = getDataTypeSize(m_dataType);\n}\n\n\/\/\/ copy constructor\nDimension::Dimension(Dimension const& other) \n : m_dataType(other.m_dataType)\n , m_field(other.m_field)\n , m_endian(other.m_endian)\n , m_byteSize(other.m_byteSize)\n , m_description(other.m_description)\n , m_min(other.m_min)\n , m_max(other.m_max)\n , m_precise(other.m_precise)\n , m_numericScale(other.m_numericScale)\n , m_numericOffset(other.m_numericOffset)\n{\n}\n\n\/\/\/ assignment operator\nDimension& Dimension::operator=(Dimension const& rhs)\n{\n if (&rhs != this)\n {\n m_dataType = rhs.m_dataType;\n m_field = rhs.m_field;\n m_endian = rhs.m_endian;\n m_byteSize = rhs.m_byteSize;\n m_description = rhs.m_description;\n m_min = rhs.m_min;\n m_max = rhs.m_max;\n m_precise = rhs.m_precise;\n m_numericScale = rhs.m_numericScale;\n m_numericOffset = rhs.m_numericOffset;\n }\n\n return *this;\n}\n\n\nbool Dimension::operator==(const Dimension& other) const\n{\n if (m_dataType == other.m_dataType &&\n m_field == other.m_field &&\n m_endian == other.m_endian &&\n m_byteSize == other.m_byteSize &&\n m_description == other.m_description &&\n Utils::compare_approx(m_min, other.m_min, (std::numeric_limits<double>::min)()) &&\n Utils::compare_approx(m_max, other.m_max, (std::numeric_limits<double>::min)()) &&\n m_precise == other.m_precise &&\n\n Utils::compare_approx(m_numericScale, other.m_numericScale, (std::numeric_limits<double>::min)()) &&\n Utils::compare_approx(m_numericOffset, other.m_numericOffset, (std::numeric_limits<double>::min)()) \n \n )\n {\n return true;\n }\n\n return false;\n}\n\n\nbool Dimension::operator!=(const Dimension& other) const\n{\n return !(*this==other);\n}\n\n\nboost::property_tree::ptree Dimension::GetPTree() const\n{\n using boost::property_tree::ptree;\n ptree dim;\n dim.put(\"name\", getFieldName());\n dim.put(\"datatype\", getDataTypeName(getDataType()));\n dim.put(\"description\", getDescription());\n dim.put(\"bytesize\", getByteSize());\n \n std::string e(\"little\");\n if (getEndianness() == Endian_Big) \n e = std::string(\"big\");\n dim.put(\"endianness\", e);\n\n if (isNumeric())\n {\n if (! (Utils::compare_distance(getMinimum(), getMaximum()) && \n Utils::compare_distance(0.0, getMaximum())))\n {\n dim.put(\"minimum\", getMinimum());\n dim.put(\"maximum\", getMaximum());\n }\n }\n\n return dim;\n}\n\n\nstd::ostream& operator<<(std::ostream& os, libpc::Dimension const& d)\n{\n using boost::property_tree::ptree;\n ptree tree = d.GetPTree();\n\n std::string const name = tree.get<std::string>(\"name\");\n\n std::ostringstream quoted_name;\n quoted_name << \"'\" << name << \"'\";\n std::ostringstream pad;\n std::string const& cur = quoted_name.str();\n std::string::size_type size = cur.size();\n std::string::size_type pad_size = 30 - size;\n\n for (std::string::size_type i=0; i != pad_size; i++ )\n {\n pad << \" \";\n }\n os << quoted_name.str() << pad.str() <<\" -- \"<< \" size: \" << tree.get<boost::uint32_t>(\"bytesize\");\n \/\/os << \" offset: \" << tree.get<boost::uint32_t>(\"byteoffset\");\n os << std::endl;\n\n return os;\n}\n\nstd::string Dimension::getDataTypeName(DataType type)\n{\n switch (type)\n {\n case Int8:\n return \"Int8\";\n case Uint8:\n return \"Uint8\";\n case Int16:\n return \"Int16\";\n case Uint16:\n return \"Uint16\";\n case Int32:\n return \"Int32\";\n case Uint32:\n return \"Uint32\";\n case Int64:\n return \"Int64\";\n case Uint64:\n return \"Uint64\";\n case Float:\n return \"Float\";\n case Double:\n return \"Double\";\n case Undefined:\n return \"Undefined\";\n }\n throw;\n}\n\n\nstd::size_t Dimension::getDataTypeSize(DataType type)\n{\n switch (type)\n {\n case Int8:\n return 1;\n case Uint8:\n return 1;\n case Int16:\n return 2;\n case Uint16:\n return 2;\n case Int32:\n return 4;\n case Uint32:\n return 4;\n case Int64:\n return 8;\n case Uint64:\n return 8;\n case Float:\n return 4;\n case Double:\n return 8;\n case Undefined:\n throw;\n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsNumeric(DataType type)\n{\n switch (type)\n {\n case Int8:\n case Uint8:\n case Int16:\n case Uint16:\n case Int32:\n case Uint32:\n case Int64:\n case Uint64:\n return true;\n case Float:\n case Double:\n return true;\n case Undefined:\n throw;\n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsSigned(DataType type)\n{\n switch (type)\n {\n case Uint8:\n case Uint16:\n case Uint32:\n case Uint64:\n return false;\n case Int8:\n case Int16:\n case Int32:\n case Int64:\n return true;\n case Float:\n case Double:\n return true;\n case Undefined:\n throw;\n \n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsInteger(DataType type)\n{\n switch (type)\n {\n case Uint8:\n case Uint16:\n case Uint32:\n case Uint64:\n return true;\n case Int8:\n case Int16:\n case Int32:\n case Int64:\n return true;\n case Float:\n case Double:\n return false;\n case Undefined:\n throw;\n\n }\n throw;\n}\n\n\nDimension::DataType Dimension::getDataTypeFromString(const std::string& s)\n{\n if (s == \"Int8\") return Int8;\n if (s == \"Uint8\") return Uint8;\n if (s == \"Int16\") return Int16;\n if (s == \"Uint16\") return Uint16;\n if (s == \"Int32\") return Int32;\n if (s == \"Uint32\") return Uint32;\n if (s == \"Int64\") return Int64;\n if (s == \"Uint64\") return Uint64;\n if (s == \"Float\") return Float;\n if (s == \"Double\") return Double;\n throw;\n}\n\n\nstd::string const& Dimension::getFieldName() const\n{\n return getFieldName(m_field);\n}\n\n\nstd::string const& Dimension::getFieldName(Field field)\n{\n if (!s_fieldNamesValid)\n initFieldNames();\n\n if (field > Field_LAST)\n throw libpc_error(\"invalid field value (too large)\");\n\n const std::string& s = s_fieldNames[field];\n if (s.empty())\n {\n throw libpc_error(\"Field name not set for built-in field value\");\n } \n\n return s;\n}\n\n\nvoid Dimension::initFieldNames()\n{\n for (int i=0; i<Dimension::Field_LAST; i++)\n {\n std::ostringstream ostr;\n ostr << \"Unnamed field \" << i;\n s_fieldNames[i] = ostr.str();\n }\n\n \/\/ BUG: not threadsafe\n s_fieldNames[Field_INVALID] = \"invalid\";\n s_fieldNames[Field_X] = \"X\";\n s_fieldNames[Field_Y] = \"Y\";\n s_fieldNames[Field_Z] = \"Z\";\n s_fieldNames[Field_Intensity] = \"Intensity\";\n s_fieldNames[Field_ReturnNumber] = \"ReturnNumber\";\n s_fieldNames[Field_NumberOfReturns] = \"NumberOfReturns\";\n s_fieldNames[Field_ScanDirectionFlag] = \"ScanDirectionFlag\";\n s_fieldNames[Field_EdgeOfFlightLine] = \"EdgeOfFlightLine\";\n s_fieldNames[Field_Classification] = \"Classification\";\n s_fieldNames[Field_ScanAngleRank] = \"ScanAngleRank\";\n s_fieldNames[Field_UserData] = \"UserData\";\n s_fieldNames[Field_PointSourceId] = \"PointSourceId\";\n s_fieldNames[Field_Time] = \"Time\";\n s_fieldNames[Field_Red] = \"Red\";\n s_fieldNames[Field_Green] = \"Green\";\n s_fieldNames[Field_Blue] = \"Blue\";\n s_fieldNames[Field_WavePacketDescriptorIndex] = \"WavePacketDescriptorIndex\";\n s_fieldNames[Field_WaveformDataOffset] = \"WaveformDataOffset\";\n s_fieldNames[Field_ReturnPointWaveformLocation] = \"ReturnPointWaveformLocation\";\n s_fieldNames[Field_WaveformXt] = \"WaveformXt\";\n s_fieldNames[Field_WaveformYt] = \"WaveformYt\";\n s_fieldNames[Field_WaveformZt] = \"WaveformZt\";\n\n s_fieldNamesValid = true;\n}\n\n\n} \/\/ namespace libpc\n<commit_msg>add Field_Alpha name<commit_after>\/******************************************************************************\n * $Id$\n *\n * Project: libLAS - http:\/\/liblas.org - A BSD library for LAS format data.\n * Purpose: LAS Dimension implementation for C++ libLAS\n * Author: Howard Butler, hobu.inc@gmail.com\n *\n ******************************************************************************\n * Copyright (c) 2010, Howard Butler\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following\n * conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Martin Isenburg or Iowa Department\n * of Natural Resources nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n * OF SUCH DAMAGE.\n ****************************************************************************\/\n\n#include <libpc\/Dimension.hpp>\n\n#include <libpc\/exceptions.hpp>\n#include <libpc\/Utils.hpp>\n\nnamespace libpc\n{\n\nstd::string Dimension::s_fieldNames[Field_LAST];\nbool Dimension::s_fieldNamesValid = false;\n\n\nDimension::Dimension(Field field, DataType dataType)\n : m_dataType(dataType)\n , m_field(field)\n , m_endian(libpc::Endian_Little)\n , m_byteSize(0)\n , m_description(std::string(\"\"))\n , m_min(0.0)\n , m_max(0.0)\n , m_precise(false)\n , m_numericScale(0.0)\n , m_numericOffset(0.0)\n{\n m_byteSize = getDataTypeSize(m_dataType);\n}\n\n\/\/\/ copy constructor\nDimension::Dimension(Dimension const& other) \n : m_dataType(other.m_dataType)\n , m_field(other.m_field)\n , m_endian(other.m_endian)\n , m_byteSize(other.m_byteSize)\n , m_description(other.m_description)\n , m_min(other.m_min)\n , m_max(other.m_max)\n , m_precise(other.m_precise)\n , m_numericScale(other.m_numericScale)\n , m_numericOffset(other.m_numericOffset)\n{\n}\n\n\/\/\/ assignment operator\nDimension& Dimension::operator=(Dimension const& rhs)\n{\n if (&rhs != this)\n {\n m_dataType = rhs.m_dataType;\n m_field = rhs.m_field;\n m_endian = rhs.m_endian;\n m_byteSize = rhs.m_byteSize;\n m_description = rhs.m_description;\n m_min = rhs.m_min;\n m_max = rhs.m_max;\n m_precise = rhs.m_precise;\n m_numericScale = rhs.m_numericScale;\n m_numericOffset = rhs.m_numericOffset;\n }\n\n return *this;\n}\n\n\nbool Dimension::operator==(const Dimension& other) const\n{\n if (m_dataType == other.m_dataType &&\n m_field == other.m_field &&\n m_endian == other.m_endian &&\n m_byteSize == other.m_byteSize &&\n m_description == other.m_description &&\n Utils::compare_approx(m_min, other.m_min, (std::numeric_limits<double>::min)()) &&\n Utils::compare_approx(m_max, other.m_max, (std::numeric_limits<double>::min)()) &&\n m_precise == other.m_precise &&\n\n Utils::compare_approx(m_numericScale, other.m_numericScale, (std::numeric_limits<double>::min)()) &&\n Utils::compare_approx(m_numericOffset, other.m_numericOffset, (std::numeric_limits<double>::min)()) \n \n )\n {\n return true;\n }\n\n return false;\n}\n\n\nbool Dimension::operator!=(const Dimension& other) const\n{\n return !(*this==other);\n}\n\n\nboost::property_tree::ptree Dimension::GetPTree() const\n{\n using boost::property_tree::ptree;\n ptree dim;\n dim.put(\"name\", getFieldName());\n dim.put(\"datatype\", getDataTypeName(getDataType()));\n dim.put(\"description\", getDescription());\n dim.put(\"bytesize\", getByteSize());\n \n std::string e(\"little\");\n if (getEndianness() == Endian_Big) \n e = std::string(\"big\");\n dim.put(\"endianness\", e);\n\n if (isNumeric())\n {\n if (! (Utils::compare_distance(getMinimum(), getMaximum()) && \n Utils::compare_distance(0.0, getMaximum())))\n {\n dim.put(\"minimum\", getMinimum());\n dim.put(\"maximum\", getMaximum());\n }\n }\n\n return dim;\n}\n\n\nstd::ostream& operator<<(std::ostream& os, libpc::Dimension const& d)\n{\n using boost::property_tree::ptree;\n ptree tree = d.GetPTree();\n\n std::string const name = tree.get<std::string>(\"name\");\n\n std::ostringstream quoted_name;\n quoted_name << \"'\" << name << \"'\";\n std::ostringstream pad;\n std::string const& cur = quoted_name.str();\n std::string::size_type size = cur.size();\n std::string::size_type pad_size = 30 - size;\n\n for (std::string::size_type i=0; i != pad_size; i++ )\n {\n pad << \" \";\n }\n os << quoted_name.str() << pad.str() <<\" -- \"<< \" size: \" << tree.get<boost::uint32_t>(\"bytesize\");\n \/\/os << \" offset: \" << tree.get<boost::uint32_t>(\"byteoffset\");\n os << std::endl;\n\n return os;\n}\n\nstd::string Dimension::getDataTypeName(DataType type)\n{\n switch (type)\n {\n case Int8:\n return \"Int8\";\n case Uint8:\n return \"Uint8\";\n case Int16:\n return \"Int16\";\n case Uint16:\n return \"Uint16\";\n case Int32:\n return \"Int32\";\n case Uint32:\n return \"Uint32\";\n case Int64:\n return \"Int64\";\n case Uint64:\n return \"Uint64\";\n case Float:\n return \"Float\";\n case Double:\n return \"Double\";\n case Undefined:\n return \"Undefined\";\n }\n throw;\n}\n\n\nstd::size_t Dimension::getDataTypeSize(DataType type)\n{\n switch (type)\n {\n case Int8:\n return 1;\n case Uint8:\n return 1;\n case Int16:\n return 2;\n case Uint16:\n return 2;\n case Int32:\n return 4;\n case Uint32:\n return 4;\n case Int64:\n return 8;\n case Uint64:\n return 8;\n case Float:\n return 4;\n case Double:\n return 8;\n case Undefined:\n throw;\n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsNumeric(DataType type)\n{\n switch (type)\n {\n case Int8:\n case Uint8:\n case Int16:\n case Uint16:\n case Int32:\n case Uint32:\n case Int64:\n case Uint64:\n return true;\n case Float:\n case Double:\n return true;\n case Undefined:\n throw;\n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsSigned(DataType type)\n{\n switch (type)\n {\n case Uint8:\n case Uint16:\n case Uint32:\n case Uint64:\n return false;\n case Int8:\n case Int16:\n case Int32:\n case Int64:\n return true;\n case Float:\n case Double:\n return true;\n case Undefined:\n throw;\n \n }\n throw;\n}\n\n\nbool Dimension::getDataTypeIsInteger(DataType type)\n{\n switch (type)\n {\n case Uint8:\n case Uint16:\n case Uint32:\n case Uint64:\n return true;\n case Int8:\n case Int16:\n case Int32:\n case Int64:\n return true;\n case Float:\n case Double:\n return false;\n case Undefined:\n throw;\n\n }\n throw;\n}\n\n\nDimension::DataType Dimension::getDataTypeFromString(const std::string& s)\n{\n if (s == \"Int8\") return Int8;\n if (s == \"Uint8\") return Uint8;\n if (s == \"Int16\") return Int16;\n if (s == \"Uint16\") return Uint16;\n if (s == \"Int32\") return Int32;\n if (s == \"Uint32\") return Uint32;\n if (s == \"Int64\") return Int64;\n if (s == \"Uint64\") return Uint64;\n if (s == \"Float\") return Float;\n if (s == \"Double\") return Double;\n throw;\n}\n\n\nstd::string const& Dimension::getFieldName() const\n{\n return getFieldName(m_field);\n}\n\n\nstd::string const& Dimension::getFieldName(Field field)\n{\n if (!s_fieldNamesValid)\n initFieldNames();\n\n if (field > Field_LAST)\n throw libpc_error(\"invalid field value (too large)\");\n\n const std::string& s = s_fieldNames[field];\n if (s.empty())\n {\n throw libpc_error(\"Field name not set for built-in field value\");\n } \n\n return s;\n}\n\n\nvoid Dimension::initFieldNames()\n{\n for (int i=0; i<Dimension::Field_LAST; i++)\n {\n std::ostringstream ostr;\n ostr << \"Unnamed field \" << i;\n s_fieldNames[i] = ostr.str();\n }\n\n \/\/ BUG: not threadsafe\n s_fieldNames[Field_INVALID] = \"invalid\";\n s_fieldNames[Field_X] = \"X\";\n s_fieldNames[Field_Y] = \"Y\";\n s_fieldNames[Field_Z] = \"Z\";\n s_fieldNames[Field_Intensity] = \"Intensity\";\n s_fieldNames[Field_ReturnNumber] = \"ReturnNumber\";\n s_fieldNames[Field_NumberOfReturns] = \"NumberOfReturns\";\n s_fieldNames[Field_ScanDirectionFlag] = \"ScanDirectionFlag\";\n s_fieldNames[Field_EdgeOfFlightLine] = \"EdgeOfFlightLine\";\n s_fieldNames[Field_Classification] = \"Classification\";\n s_fieldNames[Field_ScanAngleRank] = \"ScanAngleRank\";\n s_fieldNames[Field_UserData] = \"UserData\";\n s_fieldNames[Field_PointSourceId] = \"PointSourceId\";\n s_fieldNames[Field_Time] = \"Time\";\n s_fieldNames[Field_Red] = \"Red\";\n s_fieldNames[Field_Green] = \"Green\";\n s_fieldNames[Field_Blue] = \"Blue\";\n s_fieldNames[Field_WavePacketDescriptorIndex] = \"WavePacketDescriptorIndex\";\n s_fieldNames[Field_WaveformDataOffset] = \"WaveformDataOffset\";\n s_fieldNames[Field_ReturnPointWaveformLocation] = \"ReturnPointWaveformLocation\";\n s_fieldNames[Field_WaveformXt] = \"WaveformXt\";\n s_fieldNames[Field_WaveformYt] = \"WaveformYt\";\n s_fieldNames[Field_WaveformZt] = \"WaveformZt\";\n s_fieldNames[Field_Alpha] = \"Alpha\";\n\n s_fieldNamesValid = true;\n}\n\n\n} \/\/ namespace libpc\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: printerinfomanager.hxx,v $\n *\n * $Revision: 1.18 $\n *\n * last change: $Author: kz $ $Date: 2007-12-12 14:55:25 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PSPRINT_PRINTERINFOMANAGER_HXX_\n#define _PSPRINT_PRINTERINFOMANAGER_HXX_\n\n#include <hash_map>\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n#ifndef _PSPRINT_HELPER_HXX_\n#include <psprint\/helper.hxx>\n#endif\n#ifndef _PSPRINT_JOBDATA_HXX_\n#include <psprint\/jobdata.hxx>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _PSPRINT_HELPER_HXX_\n#include <psprint\/helper.hxx>\n#endif\n#include <cstdio>\n\nnamespace psp\n{\n\nclass SystemQueueInfo;\n\nstruct PrinterInfo : JobData\n{\n \/\/ basename of PPD\n rtl::OUString m_aDriverName;\n \/\/ can be the queue\n rtl::OUString m_aLocation;\n \/\/ a user defined comment\n rtl::OUString m_aComment;\n \/\/ a command line to pipe a PS-file to\n rtl::OUString m_aCommand;\n \/\/ a command line to pipe a PS-file to in case of direct print\n rtl::OUString m_aQuickCommand;\n \/\/ a list of special features separated by ',' not used by psprint\n \/\/ but assigned from the outside (currently for \"fax\",\"pdf=\",\"autoqueue\",\"external_dialog\")\n rtl::OUString m_aFeatures;\n \/\/ a mapping of fonts to other fonts.\n \/\/ this provides a method for the user\n \/\/ to replace arbitrary fonts by printer builtin fonts\n \/\/ currently this is only a mapping between font names\n \/\/ assuming that only adbobe standard encoding fonts are\n \/\/ built into the printer. in future it may be necessary\n \/\/ to map to a font name and UCS2 vector which should be mapped\n \/\/ this vector is currently implicitly given by the adobe\n \/\/ standard encoding\n bool m_bPerformFontSubstitution;\n std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >\n m_aFontSubstitutes;\n std::hash_map< fontID, fontID >\n m_aFontSubstitutions;\n\n PrinterInfo() :\n JobData(),\n m_bPerformFontSubstitution( false )\n {}\n};\n\nclass PrinterInfoManager\n{\npublic:\n enum Type { Default = 0, CUPS = 1 };\n\n struct SystemPrintQueue\n {\n rtl::OUString m_aQueue;\n rtl::OUString m_aLocation;\n rtl::OUString m_aComment;\n };\nprotected:\n \/\/ needed for checkPrintersChanged: files (not necessarily existant)\n \/\/ and their last known modification time\n struct WatchFile\n {\n \/\/ the file in question\n rtl::OUString m_aFilePath;\n \/\/ the last know modification time or 0, if file did not exist\n TimeValue m_aModified;\n };\n\n \/\/ internal data to describe a printer\n struct Printer\n {\n \/\/ configuration file containing this printer\n \/\/ empty means a freshly added printer that has to be saved yet\n rtl::OUString m_aFile;\n \/\/ details other config files that have this printer\n \/\/ in case of removal all have to be removed\n std::list< rtl::OUString > m_aAlternateFiles;\n \/\/ group in m_aFile containing the printer\n \/\/ this must be unique over all configuration files\n \/\/ it usually should be the printer name\n rtl::OString m_aGroup;\n \/\/ whether changes need to be saved\n bool m_bModified;\n \/\/ the corresponding info and job data\n PrinterInfo m_aInfo;\n };\n\n std::hash_map< rtl::OUString, Printer, rtl::OUStringHash > m_aPrinters;\n PrinterInfo m_aGlobalDefaults;\n std::list< WatchFile > m_aWatchFiles;\n rtl::OUString m_aDefaultPrinter;\n rtl::OUString m_aSystemPrintCommand;\n\n std::list< SystemPrintQueue > m_aSystemPrintQueues;\n\n SystemQueueInfo* m_pQueueInfo;\n\n Type m_eType;\n bool m_bUseIncludeFeature;\n rtl::OUString m_aSystemDefaultPaper;\n\n PrinterInfoManager( Type eType = Default );\n virtual ~PrinterInfoManager();\n\n virtual void initialize();\n\n \/\/ fill in font substitutions\n \/\/ the resulting hash_map maps from source to target font ids\n void fillFontSubstitutions( PrinterInfo& rInfo ) const;\n\n \/\/ fill default paper if not configured in config file\n \/\/ default paper is e.g. locale dependent\n \/\/ if a paper is already set it will not be overwritten\n void setDefaultPaper( PPDContext& rInfo ) const;\n\n void initSystemDefaultPaper();\npublic:\n\n \/\/ there can only be one\n static PrinterInfoManager& get();\n\n \/\/ get PrinterInfoManager type\n Type getType() const { return m_eType; }\n\n \/\/ lists the names of all known printers\n void listPrinters( std::list< rtl::OUString >& rList ) const;\n\n \/\/ gets the number of known printers\n int countPrinters() const { return m_aPrinters.size(); }\n\n \/\/ gets info about a named printer\n const PrinterInfo& getPrinterInfo( const rtl::OUString& rPrinter ) const;\n\n \/\/ gets the name of the default printer\n const rtl::OUString& getDefaultPrinter() const { return m_aDefaultPrinter; }\n\n virtual void setupJobContextData( JobData& rData );\n\n \/\/ changes the info about a named printer\n virtual void changePrinterInfo( const rtl::OUString& rPrinter, const PrinterInfo& rNewInfo );\n\n \/\/ check if the printer configuration has changed\n \/\/ if bwait is true, then this method waits for eventual asynchronous\n \/\/ printer discovery to finish\n virtual bool checkPrintersChanged( bool bWait );\n\n \/\/ members for administration (->padmin)\n\n \/\/ add a named printer\n \/\/ addPrinter fails if a printer with the same name already exists\n \/\/ or the driver does not exist\n virtual bool addPrinter( const rtl::OUString& rPrinterName, const rtl::OUString& rDriverName );\n\n \/\/ remove a named printer\n \/\/ this fails if the config file belonging to this printer\n \/\/ is not writeable\n \/\/ if bCheckOnly is true, the printer is not really removed;\n \/\/ this is for checking if the removal would fail\n virtual bool removePrinter( const rtl::OUString& rPrinterName, bool bCheckOnly = false );\n\n \/\/ save the changes to all printers. this fails if there\n \/\/ is no writable config file at all\n virtual bool writePrinterConfig();\n\n \/\/ set a new default printer\n \/\/ fails if the specified printer does not exist\n virtual bool setDefaultPrinter( const rtl::OUString& rPrinterName );\n\n \/\/ primarily used internally but also by padmin\n \/\/ returns the printer queue names\n virtual const std::list< SystemPrintQueue >& getSystemPrintQueues();\n\n \/\/ similar but returnse whole commandlines\n virtual void getSystemPrintCommands( std::list< rtl::OUString >& rCommands );\n\n \/\/ abstract print command\n \/\/ returns a stdio FILE* that a postscript file may be written to\n \/\/ this may either be a regular file or the result of popen()\n virtual FILE* startSpool( const rtl::OUString& rPrinterName, bool bQuickCommand );\n \/\/ close the FILE* returned by startSpool and does the actual spooling\n \/\/ returns a numerical job id\n virtual int endSpool( const rtl::OUString& rPrinterName, const rtl::OUString& rJobTitle, FILE* pFile, const JobData& rDocumentJobData );\n\n \/\/ for spadmin: whether adding or removing a printer is possible\n virtual bool addOrRemovePossible() const;\n\n bool getUseIncludeFeature() const { return m_bUseIncludeFeature; }\n\n \/\/ check whether a printer's feature string contains a subfeature\n bool checkFeatureToken( const rtl::OUString& rPrinterName, const char* pToken ) const;\n};\n\n} \/\/ namespace\n\n#endif \/\/ _PSPRINT_PRINTERINFOMANAGER_HXX_\n<commit_msg>INTEGRATION: CWS vcl86_DEV300 (1.18.6); FILE MERGED 2008\/02\/20 17:37:12 pl 1.18.6.1: #i83676# add disable CUPS api for the very few people who want that<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: printerinfomanager.hxx,v $\n *\n * $Revision: 1.19 $\n *\n * last change: $Author: kz $ $Date: 2008-03-05 16:47:29 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _PSPRINT_PRINTERINFOMANAGER_HXX_\n#define _PSPRINT_PRINTERINFOMANAGER_HXX_\n\n#include <hash_map>\n#ifndef __SGI_STL_LIST\n#include <list>\n#endif\n#ifndef _PSPRINT_HELPER_HXX_\n#include <psprint\/helper.hxx>\n#endif\n#ifndef _PSPRINT_JOBDATA_HXX_\n#include <psprint\/jobdata.hxx>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _PSPRINT_HELPER_HXX_\n#include <psprint\/helper.hxx>\n#endif\n#include <cstdio>\n\nnamespace psp\n{\n\nclass SystemQueueInfo;\n\nstruct PrinterInfo : JobData\n{\n \/\/ basename of PPD\n rtl::OUString m_aDriverName;\n \/\/ can be the queue\n rtl::OUString m_aLocation;\n \/\/ a user defined comment\n rtl::OUString m_aComment;\n \/\/ a command line to pipe a PS-file to\n rtl::OUString m_aCommand;\n \/\/ a command line to pipe a PS-file to in case of direct print\n rtl::OUString m_aQuickCommand;\n \/\/ a list of special features separated by ',' not used by psprint\n \/\/ but assigned from the outside (currently for \"fax\",\"pdf=\",\"autoqueue\",\"external_dialog\")\n rtl::OUString m_aFeatures;\n \/\/ a mapping of fonts to other fonts.\n \/\/ this provides a method for the user\n \/\/ to replace arbitrary fonts by printer builtin fonts\n \/\/ currently this is only a mapping between font names\n \/\/ assuming that only adbobe standard encoding fonts are\n \/\/ built into the printer. in future it may be necessary\n \/\/ to map to a font name and UCS2 vector which should be mapped\n \/\/ this vector is currently implicitly given by the adobe\n \/\/ standard encoding\n bool m_bPerformFontSubstitution;\n std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >\n m_aFontSubstitutes;\n std::hash_map< fontID, fontID >\n m_aFontSubstitutions;\n\n PrinterInfo() :\n JobData(),\n m_bPerformFontSubstitution( false )\n {}\n};\n\nclass PrinterInfoManager\n{\npublic:\n enum Type { Default = 0, CUPS = 1 };\n\n struct SystemPrintQueue\n {\n rtl::OUString m_aQueue;\n rtl::OUString m_aLocation;\n rtl::OUString m_aComment;\n };\nprotected:\n \/\/ needed for checkPrintersChanged: files (not necessarily existant)\n \/\/ and their last known modification time\n struct WatchFile\n {\n \/\/ the file in question\n rtl::OUString m_aFilePath;\n \/\/ the last know modification time or 0, if file did not exist\n TimeValue m_aModified;\n };\n\n \/\/ internal data to describe a printer\n struct Printer\n {\n \/\/ configuration file containing this printer\n \/\/ empty means a freshly added printer that has to be saved yet\n rtl::OUString m_aFile;\n \/\/ details other config files that have this printer\n \/\/ in case of removal all have to be removed\n std::list< rtl::OUString > m_aAlternateFiles;\n \/\/ group in m_aFile containing the printer\n \/\/ this must be unique over all configuration files\n \/\/ it usually should be the printer name\n rtl::OString m_aGroup;\n \/\/ whether changes need to be saved\n bool m_bModified;\n \/\/ the corresponding info and job data\n PrinterInfo m_aInfo;\n };\n\n std::hash_map< rtl::OUString, Printer, rtl::OUStringHash > m_aPrinters;\n PrinterInfo m_aGlobalDefaults;\n std::list< WatchFile > m_aWatchFiles;\n rtl::OUString m_aDefaultPrinter;\n rtl::OUString m_aSystemPrintCommand;\n\n std::list< SystemPrintQueue > m_aSystemPrintQueues;\n\n SystemQueueInfo* m_pQueueInfo;\n\n Type m_eType;\n bool m_bUseIncludeFeature;\n rtl::OUString m_aSystemDefaultPaper;\n\n bool m_bDisableCUPS;\n\n PrinterInfoManager( Type eType = Default );\n virtual ~PrinterInfoManager();\n\n virtual void initialize();\n\n \/\/ fill in font substitutions\n \/\/ the resulting hash_map maps from source to target font ids\n void fillFontSubstitutions( PrinterInfo& rInfo ) const;\n\n \/\/ fill default paper if not configured in config file\n \/\/ default paper is e.g. locale dependent\n \/\/ if a paper is already set it will not be overwritten\n void setDefaultPaper( PPDContext& rInfo ) const;\n\n void initSystemDefaultPaper();\npublic:\n\n \/\/ there can only be one\n static PrinterInfoManager& get();\n\n \/\/ get PrinterInfoManager type\n Type getType() const { return m_eType; }\n\n \/\/ lists the names of all known printers\n void listPrinters( std::list< rtl::OUString >& rList ) const;\n\n \/\/ gets the number of known printers\n int countPrinters() const { return m_aPrinters.size(); }\n\n \/\/ gets info about a named printer\n const PrinterInfo& getPrinterInfo( const rtl::OUString& rPrinter ) const;\n\n \/\/ gets the name of the default printer\n const rtl::OUString& getDefaultPrinter() const { return m_aDefaultPrinter; }\n\n virtual void setupJobContextData( JobData& rData );\n\n \/\/ changes the info about a named printer\n virtual void changePrinterInfo( const rtl::OUString& rPrinter, const PrinterInfo& rNewInfo );\n\n \/\/ check if the printer configuration has changed\n \/\/ if bwait is true, then this method waits for eventual asynchronous\n \/\/ printer discovery to finish\n virtual bool checkPrintersChanged( bool bWait );\n\n \/\/ members for administration (->padmin)\n\n \/\/ add a named printer\n \/\/ addPrinter fails if a printer with the same name already exists\n \/\/ or the driver does not exist\n virtual bool addPrinter( const rtl::OUString& rPrinterName, const rtl::OUString& rDriverName );\n\n \/\/ remove a named printer\n \/\/ this fails if the config file belonging to this printer\n \/\/ is not writeable\n \/\/ if bCheckOnly is true, the printer is not really removed;\n \/\/ this is for checking if the removal would fail\n virtual bool removePrinter( const rtl::OUString& rPrinterName, bool bCheckOnly = false );\n\n \/\/ save the changes to all printers. this fails if there\n \/\/ is no writable config file at all\n virtual bool writePrinterConfig();\n\n \/\/ set a new default printer\n \/\/ fails if the specified printer does not exist\n virtual bool setDefaultPrinter( const rtl::OUString& rPrinterName );\n\n \/\/ primarily used internally but also by padmin\n \/\/ returns the printer queue names\n virtual const std::list< SystemPrintQueue >& getSystemPrintQueues();\n\n \/\/ similar but returnse whole commandlines\n virtual void getSystemPrintCommands( std::list< rtl::OUString >& rCommands );\n\n \/\/ abstract print command\n \/\/ returns a stdio FILE* that a postscript file may be written to\n \/\/ this may either be a regular file or the result of popen()\n virtual FILE* startSpool( const rtl::OUString& rPrinterName, bool bQuickCommand );\n \/\/ close the FILE* returned by startSpool and does the actual spooling\n \/\/ returns a numerical job id\n virtual int endSpool( const rtl::OUString& rPrinterName, const rtl::OUString& rJobTitle, FILE* pFile, const JobData& rDocumentJobData );\n\n \/\/ for spadmin: whether adding or removing a printer is possible\n virtual bool addOrRemovePossible() const;\n\n bool getUseIncludeFeature() const { return m_bUseIncludeFeature; }\n\n \/\/ check whether a printer's feature string contains a subfeature\n bool checkFeatureToken( const rtl::OUString& rPrinterName, const char* pToken ) const;\n\n \/\/ set m_bDisableCUPS and update printer config\n void setCUPSDisabled( bool );\n\n \/\/ gets m_bDisableCUPS, initialized from printer config\n bool isCUPSDisabled() const;\n};\n\n} \/\/ namespace\n\n#endif \/\/ _PSPRINT_PRINTERINFOMANAGER_HXX_\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file Dynamixel.cpp\n*\/\n\n#include \"Dynamixel.h\"\n\nuint8_t DynamixelPacket::checkSum()\n{\n\tuint8_t result=mID+mLenght+mInstruction;\n\tfor(int i=0; i<(mLenght-2); ++i)\n\t{\n\t\tresult+=mData[i];\n\t}\n\treturn ~result;\n}\n\n\nDynamixelDevice::DynamixelDevice(DynamixelInterface &aInterface, DynamixelID aID):\n\tmInterface(aInterface), mID(aID), mStatusReturnLevel(255)\n{\n\tmPacket.mStatus=DYN_STATUS_OK;\n\tif(mID==BROADCAST_ID)\n\t\tmStatusReturnLevel=0;\n}\n\nuint8_t DynamixelDevice::statusReturnLevel()\n{\n\tif(mStatusReturnLevel==255)\n\t{\n\t\tinit();\n\t}\n\treturn mStatusReturnLevel;\n}\n\nvoid DynamixelDevice::statusReturnLevel(uint8_t aSRL)\n{\n\twrite(DYN_ADDRESS_SRL, aSRL);\n\tif(status()==DYN_STATUS_OK)\n\t{\n\t\tmStatusReturnLevel=aSRL;\n\t}\n}\n\nuint16_t DynamixelDevice::model()\n{\n\tuint16_t result;\n\tread(DYN_ADDRESS_ID, result);\n\treturn result;\n}\n\nuint8_t DynamixelDevice::firmware()\n{\n\tuint8_t result;\n\tread(DYN_ADDRESS_FIRMWARE, result);\n\treturn result;\n}\n\nvoid DynamixelDevice::communicationSpeed(uint32_t aSpeed)\n{\n\tuint8_t value=2000000\/aSpeed-1;\n\twrite(DYN_ADDRESS_BAUDRATE, value);\n}\n\nDynamixelStatus DynamixelDevice::ping()\n{\n\ttransaction(DYN_PING, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\n\nDynamixelStatus DynamixelDevice::read(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[0]=aAddress;\n\taPtr[1]=aSize;\n\ttransaction(DYN_READ, 2, aPtr);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::write(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[-1]=aAddress;\n\ttransaction(DYN_WRITE, aSize+1, const_cast<uint8_t*>(aPtr-1));\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::regWrite(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[-1]=aAddress;\n\ttransaction(DYN_REG_WRITE, aSize+1, const_cast<uint8_t*>(aPtr-1));\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::action()\n{\n\ttransaction(DYN_ACTION, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::reset()\n{\n\ttransaction(DYN_RESET, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::init()\n{\n\tmStatusReturnLevel=2;\n\tDynamixelStatus status=ping();\n\tif(status!=DYN_STATUS_OK)\n\t{\n\t\treturn status;\n\t}\n\tstatus=read(DYN_ADDRESS_SRL, mStatusReturnLevel);\n\tif(status&DYN_STATUS_TIMEOUT)\n\t{\n\t\tmStatusReturnLevel=0;\n\t}\n\treturn DYN_STATUS_OK;\n}\n\nuint8_t DynamixelDevice::sInternalBuffer[]={0};\n\nvoid DynamixelDevice::transaction(uint8_t aInstruction, uint8_t aLenght, uint8_t *aData)\n{\n\tbool response_expected=(mStatusReturnLevel>1 || (mStatusReturnLevel>0 && mPacket.mInstruction==DYN_READ) || mPacket.mInstruction==DYN_PING);\n\t\n\tmPacket.mID=mID;\n\tmPacket.mInstruction=aInstruction;\n\tmPacket.mLenght=aLenght+2;\n\tmPacket.mData=aData;\n\tmPacket.mCheckSum=mPacket.checkSum();\n\tmInterface.sendPacket(mPacket);\n\tif(response_expected)\n\t{\n\t\tmInterface.receivePacket(mPacket);\n\t}\n\telse\n\t{\n\t\tmPacket.mStatus=DYN_STATUS_OK;\n\t}\n}\n\n\n\n<commit_msg>more safe communicationSpeed : forbid 2MBd<commit_after>\/**\n * \\file Dynamixel.cpp\n*\/\n\n#include \"Dynamixel.h\"\n\nuint8_t DynamixelPacket::checkSum()\n{\n\tuint8_t result=mID+mLenght+mInstruction;\n\tfor(int i=0; i<(mLenght-2); ++i)\n\t{\n\t\tresult+=mData[i];\n\t}\n\treturn ~result;\n}\n\n\nDynamixelDevice::DynamixelDevice(DynamixelInterface &aInterface, DynamixelID aID):\n\tmInterface(aInterface), mID(aID), mStatusReturnLevel(255)\n{\n\tmPacket.mStatus=DYN_STATUS_OK;\n\tif(mID==BROADCAST_ID)\n\t\tmStatusReturnLevel=0;\n}\n\nuint8_t DynamixelDevice::statusReturnLevel()\n{\n\tif(mStatusReturnLevel==255)\n\t{\n\t\tinit();\n\t}\n\treturn mStatusReturnLevel;\n}\n\nvoid DynamixelDevice::statusReturnLevel(uint8_t aSRL)\n{\n\twrite(DYN_ADDRESS_SRL, aSRL);\n\tif(status()==DYN_STATUS_OK)\n\t{\n\t\tmStatusReturnLevel=aSRL;\n\t}\n}\n\nuint16_t DynamixelDevice::model()\n{\n\tuint16_t result;\n\tread(DYN_ADDRESS_ID, result);\n\treturn result;\n}\n\nuint8_t DynamixelDevice::firmware()\n{\n\tuint8_t result;\n\tread(DYN_ADDRESS_FIRMWARE, result);\n\treturn result;\n}\n\nvoid DynamixelDevice::communicationSpeed(uint32_t aSpeed)\n{\n\tuint8_t value=2000000\/aSpeed-1;\n\tif(value!=0) \/\/ forbid 2MBd rate, because it is out of spec, and can be difficult to undo\n\t{\n\t\twrite(DYN_ADDRESS_BAUDRATE, value);\n\t}\n}\n\nDynamixelStatus DynamixelDevice::ping()\n{\n\ttransaction(DYN_PING, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\n\nDynamixelStatus DynamixelDevice::read(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[0]=aAddress;\n\taPtr[1]=aSize;\n\ttransaction(DYN_READ, 2, aPtr);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::write(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[-1]=aAddress;\n\ttransaction(DYN_WRITE, aSize+1, const_cast<uint8_t*>(aPtr-1));\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::regWrite(uint8_t aAddress, uint8_t aSize, uint8_t *aPtr)\n{\n\taPtr[-1]=aAddress;\n\ttransaction(DYN_REG_WRITE, aSize+1, const_cast<uint8_t*>(aPtr-1));\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::action()\n{\n\ttransaction(DYN_ACTION, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::reset()\n{\n\ttransaction(DYN_RESET, 0, NULL);\n\treturn mPacket.mStatus;\n}\n\nDynamixelStatus DynamixelDevice::init()\n{\n\tmStatusReturnLevel=2;\n\tDynamixelStatus status=ping();\n\tif(status!=DYN_STATUS_OK)\n\t{\n\t\treturn status;\n\t}\n\tstatus=read(DYN_ADDRESS_SRL, mStatusReturnLevel);\n\tif(status&DYN_STATUS_TIMEOUT)\n\t{\n\t\tmStatusReturnLevel=0;\n\t}\n\treturn DYN_STATUS_OK;\n}\n\nuint8_t DynamixelDevice::sInternalBuffer[]={0};\n\nvoid DynamixelDevice::transaction(uint8_t aInstruction, uint8_t aLenght, uint8_t *aData)\n{\n\tbool response_expected=(mStatusReturnLevel>1 || (mStatusReturnLevel>0 && mPacket.mInstruction==DYN_READ) || mPacket.mInstruction==DYN_PING);\n\t\n\tmPacket.mID=mID;\n\tmPacket.mInstruction=aInstruction;\n\tmPacket.mLenght=aLenght+2;\n\tmPacket.mData=aData;\n\tmPacket.mCheckSum=mPacket.checkSum();\n\tmInterface.sendPacket(mPacket);\n\tif(response_expected)\n\t{\n\t\tmInterface.receivePacket(mPacket);\n\t}\n\telse\n\t{\n\t\tmPacket.mStatus=DYN_STATUS_OK;\n\t}\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#define _USE_MATH_DEFINES\n\n#include <Windows.h>\n#include \"Game.h\"\n#include <gl\\GL.h>\n#include <gl\\glut.h>\n#include \"RGBAColor.h\"\n#include \"SpriteLayer.h\"\n#include \"WallPlayer.h\"\n\n#include <math.h>\n#include <iostream>\n\nGame::Game() :\n window(800, 600, \"Foul Kicker\"), level(0)\n{\n Layer* background = new Layer();\n background->addImage(\"resources\/img\/stadium.ptm\");\n background->setX(0);\n background->setY(0);\n\n Image* bgImg = background->getImage();\n\n this->scene = new Image(*bgImg);\n this->bgCopy = bgImg;\n this->layers.push_back(background);\n\n Layer* goalkeeper = new Layer();\n goalkeeper->addImage(\"resources\/img\/goalkeeper1.ptm\");\n goalkeeper->setX(399);\n goalkeeper->setY(208);\n\n this->layers.push_back(goalkeeper);\n\n \/*\n * TODO: Level layout initialization should be in\n * another place. Maybe on a file later.\n *\/\n level.addPlayerOnWall(Position(270, 150));\n loadLevel(level);\n\n Level l(1);\n l.addPlayerOnWall(Position(490, 150));\n levels.push_back(l);\n\n Level l2(2);\n l2.addPlayerOnWall(Position(270, 150));\n l2.addPlayerOnWall(Position(320, 150));\n levels.push_back(l2);\n\n Level l3(3);\n l3.addPlayerOnWall(Position(440, 150));\n l3.addPlayerOnWall(Position(490, 150));\n levels.push_back(l3);\n\n Level l4(4);\n l4.addPlayerOnWall(Position(270, 150));\n l4.addPlayerOnWall(Position(320, 150));\n l4.addPlayerOnWall(Position(370, 150));\n levels.push_back(l4);\n\n Level l5(5);\n l5.addPlayerOnWall(Position(390, 150));\n l5.addPlayerOnWall(Position(440, 150));\n l5.addPlayerOnWall(Position(490, 150));\n levels.push_back(l5);\n\n \/\/ set initial speed of the ball\n ball.setSpeedX(0);\n ball.setSpeedY(0);\n\n ballLayer.setSprite(ball.getCurrentSprite());\n ballLayer.setX(400);\n ballLayer.setY(0);\n\n this->goalkeeperDirection = 1;\n\n currentTime = 1;\n\n this->run();\n}\n\nGame::~Game()\n{\n delete this->scene;\n delete this->bgCopy;\n\n \/\/ Properly clean the vector\n while (!this->layers.empty()) {\n delete this->layers.back();\n this->layers.pop_back();\n }\n}\n\nbool Game::checkForCollision() {\n\n\tbool collision = false;\n\n\tLayer* goalkeeper = this->layers.at(1);\n\n\t\/\/ GoalKeeper collision\n\tif ((ballLayer.getY() >= goalkeeper->getY() && ballLayer.getY() <= 224) &&\n\t\t(ballLayer.getX() >= goalkeeper->getX() && ballLayer.getX() <= goalkeeper->getX() + goalkeeper->getWidth())) {\n\t\tcollision = true;\n\t}\n\n\tLayer wall = wallLayers.at(0);\n\n\t\/\/ WallLayer collision\n\tif (ballLayer.getY() == wall.getY() &&\n\t\tballLayer.getX() >= wall.getX() &&\n\t\tballLayer.getX() <= (wall.getX() + wall.getWidth() * (int)wallLayers.size())) {\n\t\tcollision = true;\n\t}\n\n\t\/\/ GoalLine collision\n\tif (isBallOutOfPlay() && !hasCrossedGoalLine()) {\n\t\tcollision = true;\n\t}\n\n\t\/\/ Sideline collision\n\tif (ballLayer.getX() > window.getWidth() || ballLayer.getX() < 0) {\n\t\tcollision = true;\n\t}\n\n\treturn collision;\n}\n\n\nint Game::animateBall(int time) {\n ballLayer.saveCurrentPosition();\t\n\n\t\/\/ToDo:: Aplicar calculo de balistica\n\tif (currentAngleDirection > 0) {\n\t\tdouble v = ball.getSpeedY();\n\t\tdouble a = currentAngleDirection * M_PI \/ 180.0;\n\t\tdouble z = v * cos(a) * ++time;\n\t\tdouble temp = z \/ (v * cos(a));\n\t\tdouble w = z * tan(a) - 0.5 * 98 * (temp * temp);\n\n\t\t\/\/ToDo:: Troca de Bola em Funcao do time por \"v\"\n\t\tif (ballLayer.getY() \/ 45 >= currentTime) {\n\t\t\tball.nextBall();\n\t\t\tballLayer.setSprite(ball.getCurrentSprite());\n\t\t\tcurrentTime++;\n\t\t}\n\n\t\tint posY = ballLayer.getY() + v;\n\t\tballLayer.setX(400 + z);\n\t\tballLayer.setY(posY);\n\t}\n\n Layer* goalkeeper = this->layers.at(1);\n\n\t\/* Detectar gol\n\t * Linha do Gol y@226\n\t *\/\n\tif (checkForCollision()) {\n\t\t\/\/Goal Defense\n\t\tprepare();\n\t\tstd::cout << \"Goal Defense\" << \"\\n\";\n\t\ttime = 0;\n\t}\n\n\tif (isBallOutOfPlay() && hasCrossedGoalLine()) {\n\t\t\/\/Goal\n\t\tprepare();\n\t\tstd::cout << \"Goal\" << \"\\n\";\n\t\ttime = 0;\n\t\tnextLevel();\n\t}\n\n\t\/*\n * Trave Esquerda x@286\n * Trave Direita x@490\n *\/\n\n if (goalkeeper->getX() >= 490) {\n goalkeeperDirection = -1;\n } else {\n if (goalkeeper->getX() <= 286) {\n goalkeeperDirection = 1;\n }\n }\n\n goalkeeper->saveCurrentPosition();\n\n int goalkeeperPos = goalkeeper->getX();\n goalkeeperPos += 5 * goalkeeperDirection;\n goalkeeper->setX(goalkeeperPos);\n\n this->run();\n\n return time;\n}\n\nvoid Game::run() {\n if (!this->scene) {\n this->scene = new Image(this->window.getWidth(), this->window.getHeight());\n }\n\n int length = this->layers.size();\n\n for (int i = 1; i < length; i++) {\n drawLayer(layers.at(i));\n }\n\n for (unsigned i = 0; i < wallLayers.size(); i++) {\n drawLayer(&wallLayers.at(i));\n }\n\n drawLayer(&ballLayer);\n}\n\nvoid Game::drawLayer(Layer* layer) {\n Position* lastPos = layer->getLastPosition();\n\n \/* TODO: Refactor it. This code probably should not be here.\n *\n * Redraw the part where the layer was located in the previous frame\n * so it deletes its trace.\n *\/\n if (lastPos) {\n int height = lastPos->getPosY() + lastPos->getHeight(),\n width = lastPos->getPosX() + lastPos->getWidth();\n\n for (int y = lastPos->getPosY(); y < height; y++) {\n if (y >= scene->getHeight()) break;\n if (y < 0) continue;\n\n for (int x = lastPos->getPosX(); x < width; x++) {\n if (x >= scene->getWidth()) break;\n if (x < 0) continue;\n\n unsigned pixel = this->bgCopy->getPixel(x, y);\n this->scene->setPixel(pixel, x, y);\n }\n }\n }\n\n layer->draw(this->scene, layer->getX(), layer->getY());\n}\n\nvoid Game::display(void) {\n\n glDrawPixels(scene->getWidth(), scene->getHeight(), GL_BGRA_EXT, GL_UNSIGNED_BYTE, scene->getPixels());\n\n glFlush();\n}\n\nvoid Game::loadLevel(Level newLevel) {\n while (!wallLayers.empty()) {\n wallLayers.pop_back();\n }\n\n for (int a = 0; a < newLevel.getNumberOfPlayersOnWall(); a++) {\n Layer player;\n player.setImage(wallPlayer.getImage());\n\n const Position* position = level.getPlayerPosition(a);\n\n if (position) {\n player.setX(position->getPosX());\n player.setY(position->getPosY());\n }\n\n wallLayers.push_back(player);\n }\n}\n\nbool Game::isBallOutOfPlay() {\n\treturn ballLayer.getY() > 225;\n}\n\nbool Game::hasCrossedGoalLine() {\n\treturn ballLayer.getX() >= 280 && ballLayer.getX() <= 520;\n}\n\nvoid Game::prepare() {\n\tballLayer.setX(400);\n\tballLayer.setY(0);\n\tball.setSpeedX(0);\n\tball.setSpeedY(2.0);\n\tcurrentAngleDirection = 0;\n\n currentTime = 1;\n ball.setCurrentBall(0);\n ballLayer.setSprite(ball.getCurrentSprite());\n}\n\nvoid Game::kick(int x, int y) {\n\tstd::cout << \"Kick \" << x << \"\\t\" << y << \"\\n\";\n\n\tint diffY = window.getHeight() - y;\n\n\tint initialX = ballLayer.getX();\n\tint finalX = initialX + ballLayer.getWidth();\n\n\tint initialY = ballLayer.getY();\n\tint finalY = initialY + ballLayer.getHeight();\n\n\tint axisX = finalX - x;\n\tint axisY = finalY - abs(diffY);\n\n\tif (initialY == 0 &&\n\t\t(axisX >= 0 && axisX <= ballLayer.getWidth()) &&\n\t\t(axisY >= 0 && axisY <= ballLayer.getHeight())) {\n\t\tprepare();\n\t\tcurrentAngleDirection = abs(180 - axisX * 6);\n\t\tstd::cout << axisX << \"\\t\" << axisY << \"\\n\";\n\t}\n}\n\nbool Game::nextLevel() {\n if (levels.size() > 0) {\n Level l = levels.front();\n levels.erase(levels.begin());\n level = l;\n std::cout << level.getLevel() << \"\\n\";\n \/\/ draw background\n drawLayer(layers.at(0));\n loadLevel(l);\n } else {\n std::cout << \"Out of levels\\n\";\n return false;\n }\n\n return true;\n}\n\n<commit_msg>Better Goal Defense Detection and Brief Pause<commit_after>#define _USE_MATH_DEFINES\n\n#include <Windows.h>\n#include \"Game.h\"\n#include <gl\\GL.h>\n#include <gl\\glut.h>\n#include \"RGBAColor.h\"\n#include \"SpriteLayer.h\"\n#include \"WallPlayer.h\"\n\n#include <math.h>\n#include <iostream>\n\nGame::Game() :\n window(800, 600, \"Foul Kicker\"), level(0)\n{\n Layer* background = new Layer();\n background->addImage(\"resources\/img\/stadium.ptm\");\n background->setX(0);\n background->setY(0);\n\n Image* bgImg = background->getImage();\n\n this->scene = new Image(*bgImg);\n this->bgCopy = bgImg;\n this->layers.push_back(background);\n\n Layer* goalkeeper = new Layer();\n goalkeeper->addImage(\"resources\/img\/goalkeeper1.ptm\");\n goalkeeper->setX(399);\n goalkeeper->setY(208);\n\n this->layers.push_back(goalkeeper);\n\n \/*\n * TODO: Level layout initialization should be in\n * another place. Maybe on a file later.\n *\/\n level.addPlayerOnWall(Position(270, 150));\n loadLevel(level);\n\n Level l(1);\n l.addPlayerOnWall(Position(490, 150));\n levels.push_back(l);\n\n Level l2(2);\n l2.addPlayerOnWall(Position(270, 150));\n l2.addPlayerOnWall(Position(320, 150));\n levels.push_back(l2);\n\n Level l3(3);\n l3.addPlayerOnWall(Position(440, 150));\n l3.addPlayerOnWall(Position(490, 150));\n levels.push_back(l3);\n\n Level l4(4);\n l4.addPlayerOnWall(Position(270, 150));\n l4.addPlayerOnWall(Position(320, 150));\n l4.addPlayerOnWall(Position(370, 150));\n levels.push_back(l4);\n\n Level l5(5);\n l5.addPlayerOnWall(Position(390, 150));\n l5.addPlayerOnWall(Position(440, 150));\n l5.addPlayerOnWall(Position(490, 150));\n levels.push_back(l5);\n\n \/\/ set initial speed of the ball\n ball.setSpeedX(0);\n ball.setSpeedY(0);\n\n ballLayer.setSprite(ball.getCurrentSprite());\n ballLayer.setX(400);\n ballLayer.setY(0);\n\n this->goalkeeperDirection = 1;\n\n currentTime = 1;\n\n this->run();\n}\n\nGame::~Game()\n{\n delete this->scene;\n delete this->bgCopy;\n\n \/\/ Properly clean the vector\n while (!this->layers.empty()) {\n delete this->layers.back();\n this->layers.pop_back();\n }\n}\n\nbool Game::checkForCollision() {\n\n\tbool collision = false;\n\n\tLayer* goalkeeper = this->layers.at(1);\n\n\tint Y = goalkeeper->getY();\n\t\/\/ GoalKeeper collision\n\tif ((ballLayer.getY() >= goalkeeper->getY() && ballLayer.getY() < 220) &&\n\t\t(ballLayer.getX() >= goalkeeper->getX() && ballLayer.getX() <= goalkeeper->getX() + goalkeeper->getWidth())) {\n\t\tcollision = true;\n\t}\n\n\tLayer wall = wallLayers.at(0);\n\n\t\/\/ WallLayer collision\n\tif (ballLayer.getY() == wall.getY() &&\n\t\tballLayer.getX() >= wall.getX() &&\n\t\tballLayer.getX() <= (wall.getX() + wall.getWidth() * (int)wallLayers.size())) {\n\t\tcollision = true;\n\t}\n\n\t\/\/ GoalLine collision\n\tif (isBallOutOfPlay() && !hasCrossedGoalLine()) {\n\t\tcollision = true;\n\t}\n\n\t\/\/ Sideline collision\n\tif (ballLayer.getX() > window.getWidth() || ballLayer.getX() < 0) {\n\t\tcollision = true;\n\t}\n\n\treturn collision;\n}\n\n\nint Game::animateBall(int time) {\n ballLayer.saveCurrentPosition();\t\n\n\t\/\/ToDo:: Aplicar calculo de balistica\n\tif (currentAngleDirection > 0) {\n\t\tdouble v = ball.getSpeedY();\n\t\tdouble a = currentAngleDirection * M_PI \/ 180.0;\n\t\tdouble z = v * cos(a) * ++time;\n\t\tdouble temp = z \/ (v * cos(a));\n\t\tdouble w = z * tan(a) - 0.5 * 98 * (temp * temp);\n\n\t\t\/\/ToDo:: Troca de Bola em Funcao do time por \"v\"\n\t\tif (ballLayer.getY() \/ 45 >= currentTime) {\n\t\t\tball.nextBall();\n\t\t\tballLayer.setSprite(ball.getCurrentSprite());\n\t\t\tcurrentTime++;\n\t\t}\n\n\t\tint posY = ballLayer.getY() + v;\n\t\tballLayer.setX(400 + z);\n\t\tballLayer.setY(posY);\n\t}\n\n Layer* goalkeeper = this->layers.at(1);\n\n\t\/* Detectar gol\n\t * Linha do Gol y@226\n\t *\/\n\tif (checkForCollision()) {\n\t\t\/\/Goal Defense\n\t\tprepare();\n\t\tSleep(250);\n\n\t\tstd::cout << \"Goal Defense\" << \"\\n\";\n\t\ttime = 0;\n\t}\n\n\tif (isBallOutOfPlay() && hasCrossedGoalLine()) {\n\t\t\/\/Goal\n\t\tprepare();\n\t\tSleep(250);\n\n\t\tstd::cout << \"Goal\" << \"\\n\";\n\t\ttime = 0;\n\t\tnextLevel();\n\t}\n\n\t\/*\n * Trave Esquerda x@286\n * Trave Direita x@490\n *\/\n\n if (goalkeeper->getX() >= 490) {\n goalkeeperDirection = -1;\n } else {\n if (goalkeeper->getX() <= 286) {\n goalkeeperDirection = 1;\n }\n }\n\n goalkeeper->saveCurrentPosition();\n\n int goalkeeperPos = goalkeeper->getX();\n goalkeeperPos += 5 * goalkeeperDirection;\n goalkeeper->setX(goalkeeperPos);\n\n this->run();\n\n return time;\n}\n\nvoid Game::run() {\n if (!this->scene) {\n this->scene = new Image(this->window.getWidth(), this->window.getHeight());\n }\n\n int length = this->layers.size();\n\n for (int i = 1; i < length; i++) {\n drawLayer(layers.at(i));\n }\n\n for (unsigned i = 0; i < wallLayers.size(); i++) {\n drawLayer(&wallLayers.at(i));\n }\n\n drawLayer(&ballLayer);\n}\n\nvoid Game::drawLayer(Layer* layer) {\n Position* lastPos = layer->getLastPosition();\n\n \/* TODO: Refactor it. This code probably should not be here.\n *\n * Redraw the part where the layer was located in the previous frame\n * so it deletes its trace.\n *\/\n if (lastPos) {\n int height = lastPos->getPosY() + lastPos->getHeight(),\n width = lastPos->getPosX() + lastPos->getWidth();\n\n for (int y = lastPos->getPosY(); y < height; y++) {\n if (y >= scene->getHeight()) break;\n if (y < 0) continue;\n\n for (int x = lastPos->getPosX(); x < width; x++) {\n if (x >= scene->getWidth()) break;\n if (x < 0) continue;\n\n unsigned pixel = this->bgCopy->getPixel(x, y);\n this->scene->setPixel(pixel, x, y);\n }\n }\n }\n\n layer->draw(this->scene, layer->getX(), layer->getY());\n}\n\nvoid Game::display(void) {\n\n glDrawPixels(scene->getWidth(), scene->getHeight(), GL_BGRA_EXT, GL_UNSIGNED_BYTE, scene->getPixels());\n\n glFlush();\n}\n\nvoid Game::loadLevel(Level newLevel) {\n while (!wallLayers.empty()) {\n wallLayers.pop_back();\n }\n\n for (int a = 0; a < newLevel.getNumberOfPlayersOnWall(); a++) {\n Layer player;\n player.setImage(wallPlayer.getImage());\n\n const Position* position = level.getPlayerPosition(a);\n\n if (position) {\n player.setX(position->getPosX());\n player.setY(position->getPosY());\n }\n\n wallLayers.push_back(player);\n }\n}\n\nbool Game::isBallOutOfPlay() {\n\treturn ballLayer.getY() > 225;\n}\n\nbool Game::hasCrossedGoalLine() {\n\treturn ballLayer.getX() >= 280 && ballLayer.getX() <= 520;\n}\n\nvoid Game::prepare() {\n\tballLayer.setX(400);\n\tballLayer.setY(0);\n\tball.setSpeedX(0);\n\tball.setSpeedY(2.0);\n\tcurrentAngleDirection = 0;\n\n currentTime = 1;\n ball.setCurrentBall(0);\n ballLayer.setSprite(ball.getCurrentSprite());\n}\n\nvoid Game::kick(int x, int y) {\n\tstd::cout << \"Kick \" << x << \"\\t\" << y << \"\\n\";\n\n\tint diffY = window.getHeight() - y;\n\n\tint initialX = ballLayer.getX();\n\tint finalX = initialX + ballLayer.getWidth();\n\n\tint initialY = ballLayer.getY();\n\tint finalY = initialY + ballLayer.getHeight();\n\n\tint axisX = finalX - x;\n\tint axisY = finalY - abs(diffY);\n\n\tif (initialY == 0 &&\n\t\t(axisX >= 0 && axisX <= ballLayer.getWidth()) &&\n\t\t(axisY >= 0 && axisY <= ballLayer.getHeight())) {\n\t\tprepare();\n\t\tcurrentAngleDirection = abs(180 - axisX * 6);\n\t\tstd::cout << axisX << \"\\t\" << axisY << \"\\n\";\n\t}\n}\n\nbool Game::nextLevel() {\n if (levels.size() > 0) {\n Level l = levels.front();\n levels.erase(levels.begin());\n level = l;\n std::cout << level.getLevel() << \"\\n\";\n \/\/ draw background\n drawLayer(layers.at(0));\n loadLevel(l);\n } else {\n std::cout << \"Out of levels\\n\";\n return false;\n }\n\n return true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ SerialReader.cpp\n\/\/ GoldsprintsFX\n\/\/\n\/\/ Created by Charlie Whitney on 8\/28\/14.\n\/\/\n\/\/\n\n#include \"data\/SerialReader.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\nusing namespace gfx;\nusing namespace Cinder::Serial;\n\nSerialReader::SerialReader() :\n BAUD_RATE(115200),\n mStringBuffer(\"\"),\n mHardwareVersion(\"\"),\n mProtoculVersion(\"\"),\n mFirmwareVersion(\"\"),\n mSerial(NULL),\n mReceiveBuffer(100),\n mSendBuffer(100)\n{\n \n}\n\nSerialReader::~SerialReader()\n{\n stopRace();\n bThreadShouldQuit = true;\n mSerialThread->join();\n}\n\nvoid SerialReader::setup()\n{\n mStateManager = StateManager::getInstance();\n \n mSerialThread = std::shared_ptr<std::thread>( new std::thread( std::bind(&SerialReader::updateSerialThread, this) ) );\n}\n\nvoid SerialReader::update()\n{\n \/\/ if we connected since the last update, notify\n if( bSerialConnected && !bLastConnection){\n\t\tmSerial->flush();\n onConnect();\n timeline().add( [&](){ getVersion(); }, timeline().getCurrentTime() + 2.0 );\n }else if( !bSerialConnected && bLastConnection ){\n onDisconnect();\n }\n bLastConnection = bSerialConnected;\n \n \/\/ parse buffered data\n parseFromBuffer();\n}\n\nvoid SerialReader::updateSerialThread()\n{\n ThreadSetup threadSetup;\n \n while( !bThreadShouldQuit ){\n std::lock_guard<std::mutex> guard(mSerialMutex);\n \n if(!bSerialConnected ){ \/\/ we aren't connected try to connect\n\t\t\tauto ports = SerialPort::getPorts(true);\n \/*\n\t\t\tfor (auto port : ports) {\n\t\t\t\tconsole() << \"SERIAL DEVICE\" << endl;\n\t\t\t\tconsole() << \"\\tNAME: \" << port->getName() << endl;\n\t\t\t\tconsole() << \"\\tDESCRIPTION: \" << port->getDescription() << endl;\n\t\t\t\tconsole() << \"\\tHARDWARE IDENTIFIER: \" << port->getHardwareIdentifier() << endl;\n\t\t\t}\n *\/\n\t\t\ttry {\n\t\t\t\tif (!ports.empty()) {\n\t\t\t\t\tSerialPortRef port = SerialPort::findPortByDescriptionMatching(std::regex(\"Arduino.*\"), true);\n\t\t\t\t\tif (!port) {\n\t\t\t\t\t\tport = ports.back();\n\t\t\t\t\t}\n\n\t\t\t\t\tmSerial = SerialDevice::create(port, BAUD_RATE);\n\t\t\t\t\tmSerial->flush();\n\t\t\t\t\tbSerialConnected = true;\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0; i < mSendBuffer.getSize(); i++) { \/\/ clear send buffer\n\t\t\t\t\t\tstd::string tmp;\n\t\t\t\t\t\tmSendBuffer.popBack(&tmp);\n\t\t\t\t\t}\n\t\t\t\t\tstopRace();\n\n\t\t\t\t\tfor (int i = 0; i < mReceiveBuffer.getSize(); i++) { \/\/ clear receive buffer\n\t\t\t\t\t\tstd::vector<std::string> tmp;\n\t\t\t\t\t\tmReceiveBuffer.popBack(&tmp);\n\t\t\t\t\t}\n\t\t\t\t\tCI_LOG_I(\"OpenSprints hardware found successfully. :: \") << mSerial->getPortName();\n\t\t\t\t}\n\t\t\t}catch (serial::IOException& e) {\n\t\t\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\t\t\tmSerial->close();\n\t\t\t\t}\n bSerialConnected = false;\n }\n }else{\n \/\/ make sure we're still connected\n\t\t\tauto pOpen = SerialPort::findPortByDescriptionMatching(std::regex(\"Arduino.*\"), true);\n\n if(pOpen == nullptr){\n\t\t\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\t\t\tmSerial->close();\n\t\t\t\t}\n bSerialConnected = false;\n }else{ \n\t\t\t\t\/\/ send to arduino\n for(int i=0; i<mSendBuffer.getSize(); i++){\n std::string msgToSend;\n mSendBuffer.popBack( &msgToSend );\n\n\t\t\t\t\tCI_LOG_I(\"Sending :: \") << msgToSend;\n\n mSerial->writeString( msgToSend );\n }\n \n \/\/ receive from arduino\n readSerial();\n }\n }\n }\n}\n\nvoid SerialReader::readSerial()\n{\n try {\n\t\tsize_t bytesAvailable = mSerial->getNumBytesAvailable();\n\t\tsize_t charsAvailable = floor(bytesAvailable \/ sizeof(char));\n\n for(int i=0; i<charsAvailable; i++){\n\t\t\tunsigned char c;\t\/\/ uint8_t\n\t\t\tmSerial->readBytes(&c, 1);\n mStringBuffer += c;\n }\n }catch(serial::IOException& e){\n bSerialConnected = false;\n\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\tmSerial->close();\n\t\t\t\/\/mSerial = nullptr;\n\t\t}\n }\n \n auto index = mStringBuffer.find(\"\\r\\n\");\n if(index != string::npos){\n std::string cmd = mStringBuffer.substr(0, index);\n mStringBuffer.replace(0, index+2, \"\"); \/\/ The newline is 2 bytes (\\r\\n) so add two to remove it\n \n parseCommandToBuffer( cmd );\n }\n}\n\nvoid SerialReader::parseCommandToBuffer( std::string command )\n{\n std::vector<std::string> strs;\n boost::split(strs, command, boost::is_any_of(\":\"));\n \n std::vector<std::string> tmpBuffer;\n tmpBuffer.push_back( strs[0] );\n \n std::string args = \"\";\n if( strs.size() > 1){\n tmpBuffer.push_back(strs[1]);\n }\n \n mReceiveBuffer.tryPushFront(tmpBuffer);\n}\n\n\/\/ Parse commands in the main thread that we grabbed during the updateSerial thread\nvoid SerialReader::parseFromBuffer()\n{\n auto numCmds = mReceiveBuffer.getSize();\n \n for( int i=0; i<numCmds; i++) {\n std::vector<std::string> cmdArgs;\n mReceiveBuffer.popBack( &cmdArgs );\n \n std::string cmd = cmdArgs[0];\n std::string args = (cmdArgs.size() > 1) ? cmdArgs[1] : \"\";\n \n if(cmd == \"\"){\n return;\n }\n \/\/ ------------------------------------------------------------------------------\n \/\/ KIOSK MODE\n if(cmd == \"G\"){\n if(mStateManager->getCurrentRaceState() == RACE_STATE::RACE_STOPPED){\n mStateManager->changeRaceState( RACE_STATE::RACE_STARTING );\n }\n }else if(cmd == \"S\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_STOPPED );\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ RACE FINISH (ars are the time the race finished in millis)\n else if(cmd == \"0F\"){\n CI_LOG_I(\"RACER 1 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(0, fromString<int>(args), Model::instance().playerData[0]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"1F\"){\n CI_LOG_I(\"RACER 2 FINISHED \" +args);\n mStateManager->signalRacerFinish.emit(1, fromString<int>(args), Model::instance().playerData[1]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"2F\"){\n CI_LOG_I(\"RACER 3 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(2, fromString<int>(args), Model::instance().playerData[2]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"3F\"){\n CI_LOG_I(\"RACER 4 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(3, fromString<int>(args), Model::instance().playerData[3]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ RACE PROGRESS (args are race ticks, then race time millis)\n else if(cmd == \"R\"){\n std::vector<std::string> rdata;\n boost::split(rdata, args, boost::is_any_of(\",\"));\n \n int raceMillis = fromString<int>( rdata.back() );\n \n float dt = raceMillis - Model::instance().elapsedRaceTimeMillis;\n \n for( int i=0; i<rdata.size()-1; i++){\n Model::instance().playerData[i]->updateRaceTicks( fromString<int>(rdata[i]), dt );\n }\n\/\/ Model::instance().playerData[0]->updateRaceTicks( fromString<int>(rdata[0]), dt );\n\/\/ Model::instance().playerData[1]->updateRaceTicks( fromString<int>(rdata[1]), dt );\n\/\/ Model::instance().playerData[2]->updateRaceTicks( fromString<int>(rdata[2]), dt );\n\/\/ Model::instance().playerData[3]->updateRaceTicks( fromString<int>(rdata[3]), dt );\n Model::instance().elapsedRaceTimeMillis = raceMillis;\n Model::instance().startTimeMillis = ci::app::getElapsedSeconds() * 1000.0 - Model::instance().elapsedRaceTimeMillis;\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ SETTINGS\n else if( cmd == \"CD\"){\n CI_LOG_I(\"SerialReader :: Countdown :: \" + args);\n \n if( args == \"3\" ){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_3 );\n }else if( args == \"2\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_2 );\n }else if( args == \"1\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_1 );\n }else if( args == \"0\" ){\n Model::instance().startTimeMillis = ci::app::getElapsedSeconds() * 1000.0;\n \n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_GO );\n mStateManager->changeRaceState( RACE_STATE::RACE_RUNNING );\n }\n }\n else if( cmd == \"FS\"){\n CI_LOG_I(\"SerialReader :: False start. Racer: \" + args); \/\/ 0 based\n\/\/ mStateManager->changeRaceState( RACE_STATE::RACE_FALSE_START );\n\/\/ mStateManager->changeRaceState( RACE_STATE::RACE_STOPPED );\n }\n else if( cmd == \"L\"){ \/\/ After sending a race length, it will send this confirmation\n CI_LOG_I(\"SerialReader :: Race Length \" + args + \".\");\n }\n else if( cmd == \"M\"){ \/\/ Mock mode confirmation\n CI_LOG_I(\"SerialReader :: Mock mode turned \" + args);\n }\n else if(cmd == \"V\"){ \/\/ version\n mFirmwareVersion = args;\n Model::instance().mFirmwareVersion = args;\n }\n \n else{\n CI_LOG_I(\"SerialReader :: Unrecognized command :: \");\n\t\t\ttry {\n\t\t\t\tCI_LOG_I(cmd);\n\t\t\t}catch (...) {}\n\n if(args != \"\"){\n\t\t\t\ttry {\n\t\t\t\t\tCI_LOG_I(\" with arg :: '\" + args + \"'\");\n\t\t\t\t}catch (...) {}\n }\n }\n }\n}\n\nvoid SerialReader::onConnect()\n{\n CI_LOG_I(\"OpenSprints hardware connected.\");\n Model::instance().setHardwareConnected(bSerialConnected);\n Model::instance().mFirmwareVersion = \"Unknown\";\n}\n\nvoid SerialReader::onDisconnect()\n{\n CI_LOG_I(\"OpenSprints hardware disconnected.\");\n Model::instance().setHardwareConnected(bSerialConnected);\n}\n\nvoid SerialReader::startRace(){\n sendSerialMessage(\"g\");\n}\n\nvoid SerialReader::stopRace(){\n sendSerialMessage(\"s\");\n}\n\nvoid SerialReader::setRaceDuration(int numSeconds){\n sendSerialMessage(\"t\" + to_string(numSeconds) );\n}\n\nvoid SerialReader::setRaceLengthTicks( int numTicks ){\n sendSerialMessage( \"l\"+to_string(numTicks) );\n}\n\nvoid SerialReader::setMockMode( bool enabled ){\n bMockEnabled = enabled;\n sendSerialMessage(\"m\");\n}\n\nvoid SerialReader::getVersion(){\n sendSerialMessage(\"v\");\n}\n\nvoid SerialReader::setRaceType( gfx::RACE_TYPE raceType)\n{\n if(raceType == RACE_TYPE_DISTANCE){\n sendSerialMessage(\"d\");\n }else{\n sendSerialMessage(\"x\");\n }\n}\n\nvoid SerialReader::sendSerialMessage( std::string msg )\n{\n std::string toSend = msg + \"\\n\";\n mSendBuffer.pushFront( toSend );\n}\n\nbool SerialReader::isRaceFinished()\n{\n for( int i=0; i<Model::instance().getNumRacers(); i++){\n if( !Model::instance().playerData[i]->isFinished() ){\n return false;\n }\n }\n \n return true;\n}\n\n\n\n<commit_msg>Fixed a bug where error reporting was crashing<commit_after>\/\/\n\/\/ SerialReader.cpp\n\/\/ GoldsprintsFX\n\/\/\n\/\/ Created by Charlie Whitney on 8\/28\/14.\n\/\/\n\/\/\n\n#include \"data\/SerialReader.h\"\n\nusing namespace ci;\nusing namespace ci::app;\nusing namespace std;\nusing namespace gfx;\nusing namespace Cinder::Serial;\n\nSerialReader::SerialReader() :\n BAUD_RATE(115200),\n mStringBuffer(\"\"),\n mHardwareVersion(\"\"),\n mProtoculVersion(\"\"),\n mFirmwareVersion(\"\"),\n mSerial(NULL),\n mReceiveBuffer(100),\n mSendBuffer(100)\n{\n \n}\n\nSerialReader::~SerialReader()\n{\n stopRace();\n bThreadShouldQuit = true;\n mSerialThread->join();\n}\n\nvoid SerialReader::setup()\n{\n mStateManager = StateManager::getInstance();\n \n mSerialThread = std::shared_ptr<std::thread>( new std::thread( std::bind(&SerialReader::updateSerialThread, this) ) );\n}\n\nvoid SerialReader::update()\n{\n \/\/ if we connected since the last update, notify\n if( bSerialConnected && !bLastConnection){\n\t\tmSerial->flush();\n onConnect();\n timeline().add( [&](){ getVersion(); }, timeline().getCurrentTime() + 2.0 );\n }else if( !bSerialConnected && bLastConnection ){\n onDisconnect();\n }\n bLastConnection = bSerialConnected;\n \n \/\/ parse buffered data\n parseFromBuffer();\n}\n\nvoid SerialReader::updateSerialThread()\n{\n ThreadSetup threadSetup;\n \n while( !bThreadShouldQuit ){\n std::lock_guard<std::mutex> guard(mSerialMutex);\n \n if(!bSerialConnected ){ \/\/ we aren't connected try to connect\n\t\t\tauto ports = SerialPort::getPorts(true);\n \/*\n\t\t\tfor (auto port : ports) {\n\t\t\t\tconsole() << \"SERIAL DEVICE\" << endl;\n\t\t\t\tconsole() << \"\\tNAME: \" << port->getName() << endl;\n\t\t\t\tconsole() << \"\\tDESCRIPTION: \" << port->getDescription() << endl;\n\t\t\t\tconsole() << \"\\tHARDWARE IDENTIFIER: \" << port->getHardwareIdentifier() << endl;\n\t\t\t}\n *\/\n\t\t\ttry {\n\t\t\t\tif (!ports.empty()) {\n\t\t\t\t\tSerialPortRef port = SerialPort::findPortByDescriptionMatching(std::regex(\"Arduino.*\"), true);\n\t\t\t\t\tif (!port) {\n\t\t\t\t\t\tport = ports.back();\n\t\t\t\t\t}\n\n\t\t\t\t\tmSerial = SerialDevice::create(port, BAUD_RATE);\n\t\t\t\t\tmSerial->flush();\n\t\t\t\t\tbSerialConnected = true;\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0; i < mSendBuffer.getSize(); i++) { \/\/ clear send buffer\n\t\t\t\t\t\tstd::string tmp;\n\t\t\t\t\t\tmSendBuffer.popBack(&tmp);\n\t\t\t\t\t}\n\t\t\t\t\tstopRace();\n\n\t\t\t\t\tfor (int i = 0; i < mReceiveBuffer.getSize(); i++) { \/\/ clear receive buffer\n\t\t\t\t\t\tstd::vector<std::string> tmp;\n\t\t\t\t\t\tmReceiveBuffer.popBack(&tmp);\n\t\t\t\t\t}\n\t\t\t\t\tCI_LOG_I(\"OpenSprints hardware found successfully. :: \") << mSerial->getPortName();\n\t\t\t\t}\n\t\t\t}catch (serial::IOException& e) {\n\t\t\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\t\t\tmSerial->close();\n\t\t\t\t}\n bSerialConnected = false;\n }\n }else{\n \/\/ make sure we're still connected\n\t\t\tauto pOpen = SerialPort::findPortByDescriptionMatching(std::regex(\"Arduino.*\"), true);\n\n if(pOpen == nullptr){\n\t\t\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\t\t\tmSerial->close();\n\t\t\t\t}\n bSerialConnected = false;\n }else{ \n\t\t\t\t\/\/ send to arduino\n for(int i=0; i<mSendBuffer.getSize(); i++){\n std::string msgToSend;\n mSendBuffer.popBack( &msgToSend );\n\n\t\t\t\t\tCI_LOG_I(\"Sending :: \") << msgToSend;\n\n mSerial->writeString( msgToSend );\n }\n \n \/\/ receive from arduino\n readSerial();\n }\n }\n }\n}\n\nvoid SerialReader::readSerial()\n{\n try {\n\t\tsize_t bytesAvailable = mSerial->getNumBytesAvailable();\n\t\tsize_t charsAvailable = floor(bytesAvailable \/ sizeof(char));\n\n for(int i=0; i<charsAvailable; i++){\n\t\t\tunsigned char c;\t\/\/ uint8_t\n\t\t\tmSerial->readBytes(&c, 1);\n mStringBuffer += c;\n }\n }catch(serial::IOException& e){\n bSerialConnected = false;\n\t\tif (mSerial && mSerial->isOpen()) {\n\t\t\tmSerial->close();\n\t\t\t\/\/mSerial = nullptr;\n\t\t}\n }\n \n auto index = mStringBuffer.find(\"\\r\\n\");\n if(index != string::npos){\n std::string cmd = mStringBuffer.substr(0, index);\n mStringBuffer.replace(0, index+2, \"\"); \/\/ The newline is 2 bytes (\\r\\n) so add two to remove it\n \n parseCommandToBuffer( cmd );\n }\n}\n\nvoid SerialReader::parseCommandToBuffer( std::string command )\n{\n std::vector<std::string> strs;\n boost::split(strs, command, boost::is_any_of(\":\"));\n \n std::vector<std::string> tmpBuffer;\n tmpBuffer.push_back( strs[0] );\n \n std::string args = \"\";\n if( strs.size() > 1){\n tmpBuffer.push_back(strs[1]);\n }\n \n mReceiveBuffer.tryPushFront(tmpBuffer);\n}\n\n\/\/ Parse commands in the main thread that we grabbed during the updateSerial thread\nvoid SerialReader::parseFromBuffer()\n{\n auto numCmds = mReceiveBuffer.getSize();\n \n for( int i=0; i<numCmds; i++) {\n std::vector<std::string> cmdArgs;\n mReceiveBuffer.popBack( &cmdArgs );\n \n std::string cmd = cmdArgs[0];\n std::string args = (cmdArgs.size() > 1) ? cmdArgs[1] : \"\";\n \n if(cmd == \"\"){\n return;\n }\n \/\/ ------------------------------------------------------------------------------\n \/\/ KIOSK MODE\n if(cmd == \"G\"){\n if(mStateManager->getCurrentRaceState() == RACE_STATE::RACE_STOPPED){\n mStateManager->changeRaceState( RACE_STATE::RACE_STARTING );\n }\n }else if(cmd == \"S\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_STOPPED );\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ RACE FINISH (ars are the time the race finished in millis)\n else if(cmd == \"0F\"){\n CI_LOG_I(\"RACER 1 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(0, fromString<int>(args), Model::instance().playerData[0]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"1F\"){\n CI_LOG_I(\"RACER 2 FINISHED \" +args);\n mStateManager->signalRacerFinish.emit(1, fromString<int>(args), Model::instance().playerData[1]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"2F\"){\n CI_LOG_I(\"RACER 3 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(2, fromString<int>(args), Model::instance().playerData[2]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n else if( cmd == \"3F\"){\n CI_LOG_I(\"RACER 4 FINISHED \" + args);\n mStateManager->signalRacerFinish.emit(3, fromString<int>(args), Model::instance().playerData[3]->getCurrentRaceTicks());\n if( isRaceFinished() ){ mStateManager->signalOnRaceFinished.emit(); }\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ RACE PROGRESS (args are race ticks, then race time millis)\n else if(cmd == \"R\"){\n std::vector<std::string> rdata;\n boost::split(rdata, args, boost::is_any_of(\",\"));\n \n int raceMillis = fromString<int>( rdata.back() );\n \n float dt = raceMillis - Model::instance().elapsedRaceTimeMillis;\n \n for( int i=0; i<rdata.size()-1; i++){\n Model::instance().playerData[i]->updateRaceTicks( fromString<int>(rdata[i]), dt );\n }\n\/\/ Model::instance().playerData[0]->updateRaceTicks( fromString<int>(rdata[0]), dt );\n\/\/ Model::instance().playerData[1]->updateRaceTicks( fromString<int>(rdata[1]), dt );\n\/\/ Model::instance().playerData[2]->updateRaceTicks( fromString<int>(rdata[2]), dt );\n\/\/ Model::instance().playerData[3]->updateRaceTicks( fromString<int>(rdata[3]), dt );\n Model::instance().elapsedRaceTimeMillis = raceMillis;\n Model::instance().startTimeMillis = ci::app::getElapsedSeconds() * 1000.0 - Model::instance().elapsedRaceTimeMillis;\n }\n \n \/\/ ------------------------------------------------------------------------------\n \/\/ SETTINGS\n else if( cmd == \"CD\"){\n CI_LOG_I(\"SerialReader :: Countdown :: \" + args);\n \n if( args == \"3\" ){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_3 );\n }else if( args == \"2\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_2 );\n }else if( args == \"1\"){\n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_1 );\n }else if( args == \"0\" ){\n Model::instance().startTimeMillis = ci::app::getElapsedSeconds() * 1000.0;\n \n mStateManager->changeRaceState( RACE_STATE::RACE_COUNTDOWN_GO );\n mStateManager->changeRaceState( RACE_STATE::RACE_RUNNING );\n }\n }\n else if( cmd == \"FS\"){\n CI_LOG_I(\"SerialReader :: False start. Racer: \" + args); \/\/ 0 based\n\/\/ mStateManager->changeRaceState( RACE_STATE::RACE_FALSE_START );\n\/\/ mStateManager->changeRaceState( RACE_STATE::RACE_STOPPED );\n }\n else if( cmd == \"L\"){ \/\/ After sending a race length, it will send this confirmation\n CI_LOG_I(\"SerialReader :: Race Length \" + args + \".\");\n }\n else if( cmd == \"M\"){ \/\/ Mock mode confirmation\n CI_LOG_I(\"SerialReader :: Mock mode turned \" + args);\n }\n else if(cmd == \"V\"){ \/\/ version\n mFirmwareVersion = args;\n Model::instance().mFirmwareVersion = args;\n }\n \n else{\n CI_LOG_I(\"SerialReader :: Unrecognized command :: \");\n\t\t\t\/*\n\t\t\ttry {\n\t\t\t\tCI_LOG_I(cmd);\n\t\t\t}catch (std::exception exc) {\n\t\t\t\tCI_LOG_EXCEPTION(\"Error parsing arduino\", exc);\n\t\t\t}\n\n if(args != \"\"){\n\t\t\t\ttry {\n\t\t\t\t\tCI_LOG_I(\" with arg :: '\" + args + \"'\");\n\t\t\t\t}catch (std::exception exc) {\n\t\t\t\t\tCI_LOG_EXCEPTION(\"Error parsing arduino\", exc);\n\t\t\t\t}\n }\n\t\t\t*\/\n }\n }\n}\n\nvoid SerialReader::onConnect()\n{\n CI_LOG_I(\"OpenSprints hardware connected.\");\n Model::instance().setHardwareConnected(bSerialConnected);\n Model::instance().mFirmwareVersion = \"Unknown\";\n}\n\nvoid SerialReader::onDisconnect()\n{\n CI_LOG_I(\"OpenSprints hardware disconnected.\");\n Model::instance().setHardwareConnected(bSerialConnected);\n}\n\nvoid SerialReader::startRace(){\n sendSerialMessage(\"g\");\n}\n\nvoid SerialReader::stopRace(){\n sendSerialMessage(\"s\");\n}\n\nvoid SerialReader::setRaceDuration(int numSeconds){\n sendSerialMessage(\"t\" + to_string(numSeconds) );\n}\n\nvoid SerialReader::setRaceLengthTicks( int numTicks ){\n sendSerialMessage( \"l\"+to_string(numTicks) );\n}\n\nvoid SerialReader::setMockMode( bool enabled ){\n bMockEnabled = enabled;\n sendSerialMessage(\"m\");\n}\n\nvoid SerialReader::getVersion(){\n sendSerialMessage(\"v\");\n}\n\nvoid SerialReader::setRaceType( gfx::RACE_TYPE raceType)\n{\n if(raceType == RACE_TYPE_DISTANCE){\n sendSerialMessage(\"d\");\n }else{\n sendSerialMessage(\"x\");\n }\n}\n\nvoid SerialReader::sendSerialMessage( std::string msg )\n{\n std::string toSend = msg + \"\\n\";\n mSendBuffer.pushFront( toSend );\n}\n\nbool SerialReader::isRaceFinished()\n{\n for( int i=0; i<Model::instance().getNumRacers(); i++){\n if( !Model::instance().playerData[i]->isFinished() ){\n return false;\n }\n }\n \n return true;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Halide.h\"\nusing namespace Halide;\n\nVar x, y;\n\n\/\/ Downsample with a 1 3 3 1 filter\nFunc downsample(Func f) {\n Func downx, downy;\n\n downx(x, y, _) = (f(2*x-1, y, _) + 3.0f * (f(2*x, y, _) + f(2*x+1, y, _)) + f(2*x+2, y, _)) \/ 8.0f;\n downy(x, y, _) = (downx(x, 2*y-1, _) + 3.0f * (downx(x, 2*y, _) + downx(x, 2*y+1, _)) + downx(x, 2*y+2, _)) \/ 8.0f;\n\n return downy;\n}\n\n\/\/ Upsample using bilinear interpolation\nFunc upsample(Func f) {\n Func upx, upy;\n\n upx(x, y, _) = 0.25f * f((x\/2) - 1 + 2*(x % 2), y, _) + 0.75f * f(x\/2, y, _);\n upy(x, y, _) = 0.25f * upx(x, (y\/2) - 1 + 2*(y % 2), _) + 0.75f * upx(x, y\/2, _);\n\n return upy;\n\n}\n\nint main(int argc, char **argv) {\n\n \/* THE ALGORITHM *\/\n\n \/\/ Number of pyramid levels\n const int J = 8;\n\n \/\/ number of intensity levels\n Param<int> levels;\n \/\/ Parameters controlling the filter\n Param<float> alpha, beta;\n \/\/ Takes a 16-bit input\n ImageParam input(UInt(16), 3);\n\n \/\/ loop variables\n Var c, k;\n\n \/\/ Make the remapping function as a lookup table.\n Func remap;\n Expr fx = cast<float>(x) \/ 256.0f;\n remap(x) = alpha*fx*exp(-fx*fx\/2.0f);\n\n \/\/ Set a boundary condition\n Func clamped = BoundaryConditions::repeat_edge(input);\n\n \/\/ Convert to floating point\n Func floating;\n floating(x, y, c) = clamped(x, y, c) \/ 65535.0f;\n\n \/\/ Get the luminance channel\n Func gray;\n gray(x, y) = 0.299f * floating(x, y, 0) + 0.587f * floating(x, y, 1) + 0.114f * floating(x, y, 2);\n\n \/\/ Make the processed Gaussian pyramid.\n Func gPyramid[J];\n \/\/ Do a lookup into a lut with 256 entires per intensity level\n Expr level = k * (1.0f \/ (levels - 1));\n Expr idx = gray(x, y)*cast<float>(levels-1)*256.0f;\n idx = clamp(cast<int>(idx), 0, (levels-1)*256);\n gPyramid[0](x, y, k) = beta*(gray(x, y) - level) + level + remap(idx - 256*k);\n for (int j = 1; j < J; j++) {\n gPyramid[j](x, y, k) = downsample(gPyramid[j-1])(x, y, k);\n }\n\n \/\/ Get its laplacian pyramid\n Func lPyramid[J];\n lPyramid[J-1](x, y, k) = gPyramid[J-1](x, y, k);\n for (int j = J-2; j >= 0; j--) {\n lPyramid[j](x, y, k) = gPyramid[j](x, y, k) - upsample(gPyramid[j+1])(x, y, k);\n }\n\n \/\/ Make the Gaussian pyramid of the input\n Func inGPyramid[J];\n inGPyramid[0](x, y) = gray(x, y);\n for (int j = 1; j < J; j++) {\n inGPyramid[j](x, y) = downsample(inGPyramid[j-1])(x, y);\n }\n\n \/\/ Make the laplacian pyramid of the output\n Func outLPyramid[J];\n for (int j = 0; j < J; j++) {\n \/\/ Split input pyramid value into integer and floating parts\n Expr level = inGPyramid[j](x, y) * cast<float>(levels-1);\n Expr li = clamp(cast<int>(level), 0, levels-2);\n Expr lf = level - cast<float>(li);\n \/\/ Linearly interpolate between the nearest processed pyramid levels\n outLPyramid[j](x, y) = (1.0f - lf) * lPyramid[j](x, y, li) + lf * lPyramid[j](x, y, li+1);\n }\n\n \/\/ Make the Gaussian pyramid of the output\n Func outGPyramid[J];\n outGPyramid[J-1](x, y) = outLPyramid[J-1](x, y);\n for (int j = J-2; j >= 0; j--) {\n outGPyramid[j](x, y) = upsample(outGPyramid[j+1])(x, y) + outLPyramid[j](x, y);\n }\n\n \/\/ Reintroduce color (Connelly: use eps to avoid scaling up noise w\/ apollo3.png input)\n Func color;\n float eps = 0.01f;\n color(x, y, c) = outGPyramid[0](x, y) * (floating(x, y, c)+eps) \/ (gray(x, y)+eps);\n\n Func output(\"local_laplacian\");\n \/\/ Convert back to 16-bit\n output(x, y, c) = cast<uint16_t>(clamp(color(x, y, c), 0.0f, 1.0f) * 65535.0f);\n\n\n\n \/* THE SCHEDULE *\/\n remap.compute_root();\n\n Target target = get_target_from_environment();\n if (target.has_gpu_feature()) {\n \/\/ gpu schedule\n output.compute_root().gpu_tile(x, y, 16, 8, DeviceAPI::Default_GPU);\n for (int j = 0; j < J; j++) {\n int blockw = 16, blockh = 8;\n if (j > 3) {\n blockw = 2;\n blockh = 2;\n }\n if (j > 0) inGPyramid[j].compute_root().gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n if (j > 0) gPyramid[j].compute_root().reorder(k, x, y).gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n outGPyramid[j].compute_root().gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n }\n } else {\n \/\/ cpu schedule\n Var yi;\n output.parallel(y, 4).vectorize(x, 8);\n gray.compute_root().parallel(y, 4).vectorize(x, 8);\n for (int j = 0; j < 4; j++) {\n if (j > 0) inGPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n if (j > 0) gPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n outGPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n }\n for (int j = 4; j < J; j++) {\n inGPyramid[j].compute_root().parallel(y);\n gPyramid[j].compute_root().parallel(k);\n outGPyramid[j].compute_root().parallel(y);\n }\n }\n\n output.compile_to_file(\"local_laplacian\", {levels, alpha, beta, input}, target);\n output.compile_to_assembly(\"local_laplacian.s\", {levels, alpha, beta, input}, target);\n\n return 0;\n}\n<commit_msg>Remove accidental change<commit_after>#include \"Halide.h\"\nusing namespace Halide;\n\nVar x, y;\n\n\/\/ Downsample with a 1 3 3 1 filter\nFunc downsample(Func f) {\n Func downx, downy;\n\n downx(x, y, _) = (f(2*x-1, y, _) + 3.0f * (f(2*x, y, _) + f(2*x+1, y, _)) + f(2*x+2, y, _)) \/ 8.0f;\n downy(x, y, _) = (downx(x, 2*y-1, _) + 3.0f * (downx(x, 2*y, _) + downx(x, 2*y+1, _)) + downx(x, 2*y+2, _)) \/ 8.0f;\n\n return downy;\n}\n\n\/\/ Upsample using bilinear interpolation\nFunc upsample(Func f) {\n Func upx, upy;\n\n upx(x, y, _) = 0.25f * f((x\/2) - 1 + 2*(x % 2), y, _) + 0.75f * f(x\/2, y, _);\n upy(x, y, _) = 0.25f * upx(x, (y\/2) - 1 + 2*(y % 2), _) + 0.75f * upx(x, y\/2, _);\n\n return upy;\n\n}\n\nint main(int argc, char **argv) {\n\n \/* THE ALGORITHM *\/\n\n \/\/ Number of pyramid levels\n const int J = 8;\n\n \/\/ number of intensity levels\n Param<int> levels;\n \/\/ Parameters controlling the filter\n Param<float> alpha, beta;\n \/\/ Takes a 16-bit input\n ImageParam input(UInt(16), 3);\n\n \/\/ loop variables\n Var c, k;\n\n \/\/ Make the remapping function as a lookup table.\n Func remap;\n Expr fx = cast<float>(x) \/ 256.0f;\n remap(x) = alpha*fx*exp(-fx*fx\/2.0f);\n\n \/\/ Set a boundary condition\n Func clamped = BoundaryConditions::repeat_edge(input);\n\n \/\/ Convert to floating point\n Func floating;\n floating(x, y, c) = clamped(x, y, c) \/ 65535.0f;\n\n \/\/ Get the luminance channel\n Func gray;\n gray(x, y) = 0.299f * floating(x, y, 0) + 0.587f * floating(x, y, 1) + 0.114f * floating(x, y, 2);\n\n \/\/ Make the processed Gaussian pyramid.\n Func gPyramid[J];\n \/\/ Do a lookup into a lut with 256 entires per intensity level\n Expr level = k * (1.0f \/ (levels - 1));\n Expr idx = gray(x, y)*cast<float>(levels-1)*256.0f;\n idx = clamp(cast<int>(idx), 0, (levels-1)*256);\n gPyramid[0](x, y, k) = beta*(gray(x, y) - level) + level + remap(idx - 256*k);\n for (int j = 1; j < J; j++) {\n gPyramid[j](x, y, k) = downsample(gPyramid[j-1])(x, y, k);\n }\n\n \/\/ Get its laplacian pyramid\n Func lPyramid[J];\n lPyramid[J-1](x, y, k) = gPyramid[J-1](x, y, k);\n for (int j = J-2; j >= 0; j--) {\n lPyramid[j](x, y, k) = gPyramid[j](x, y, k) - upsample(gPyramid[j+1])(x, y, k);\n }\n\n \/\/ Make the Gaussian pyramid of the input\n Func inGPyramid[J];\n inGPyramid[0](x, y) = gray(x, y);\n for (int j = 1; j < J; j++) {\n inGPyramid[j](x, y) = downsample(inGPyramid[j-1])(x, y);\n }\n\n \/\/ Make the laplacian pyramid of the output\n Func outLPyramid[J];\n for (int j = 0; j < J; j++) {\n \/\/ Split input pyramid value into integer and floating parts\n Expr level = inGPyramid[j](x, y) * cast<float>(levels-1);\n Expr li = clamp(cast<int>(level), 0, levels-2);\n Expr lf = level - cast<float>(li);\n \/\/ Linearly interpolate between the nearest processed pyramid levels\n outLPyramid[j](x, y) = (1.0f - lf) * lPyramid[j](x, y, li) + lf * lPyramid[j](x, y, li+1);\n }\n\n \/\/ Make the Gaussian pyramid of the output\n Func outGPyramid[J];\n outGPyramid[J-1](x, y) = outLPyramid[J-1](x, y);\n for (int j = J-2; j >= 0; j--) {\n outGPyramid[j](x, y) = upsample(outGPyramid[j+1])(x, y) + outLPyramid[j](x, y);\n }\n\n \/\/ Reintroduce color (Connelly: use eps to avoid scaling up noise w\/ apollo3.png input)\n Func color;\n float eps = 0.01f;\n color(x, y, c) = outGPyramid[0](x, y) * (floating(x, y, c)+eps) \/ (gray(x, y)+eps);\n\n Func output(\"local_laplacian\");\n \/\/ Convert back to 16-bit\n output(x, y, c) = cast<uint16_t>(clamp(color(x, y, c), 0.0f, 1.0f) * 65535.0f);\n\n\n\n \/* THE SCHEDULE *\/\n remap.compute_root();\n\n Target target = get_target_from_environment();\n if (target.has_gpu_feature()) {\n \/\/ gpu schedule\n output.compute_root().gpu_tile(x, y, 16, 8, DeviceAPI::Default_GPU);\n for (int j = 0; j < J; j++) {\n int blockw = 16, blockh = 8;\n if (j > 3) {\n blockw = 2;\n blockh = 2;\n }\n if (j > 0) inGPyramid[j].compute_root().gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n if (j > 0) gPyramid[j].compute_root().reorder(k, x, y).gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n outGPyramid[j].compute_root().gpu_tile(x, y, blockw, blockh, DeviceAPI::Default_GPU);\n }\n } else {\n \/\/ cpu schedule\n Var yi;\n output.parallel(y, 4).vectorize(x, 8);\n gray.compute_root().parallel(y, 4).vectorize(x, 8);\n for (int j = 0; j < 4; j++) {\n if (j > 0) inGPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n if (j > 0) gPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n outGPyramid[j].compute_root().parallel(y, 4).vectorize(x, 8);\n }\n for (int j = 4; j < J; j++) {\n inGPyramid[j].compute_root().parallel(y);\n gPyramid[j].compute_root().parallel(k);\n outGPyramid[j].compute_root().parallel(y);\n }\n }\n\n output.compile_to_file(\"local_laplacian\", {levels, alpha, beta, input}, target);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Project: SC4Fix Patches for SimCity 4\n File: TitleBarMod.cpp\n\n Copyright (c) 2015 Nelson Gomez (simmaster07)\n\n Licensed under the MIT License. A copy of the License is available in\n LICENSE or at:\n\n http:\/\/opensource.org\/licenses\/MIT\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n\n#include \"TitleBarMod.h\"\n#include <string>\n\n\/\/ This is restricted to 15 characters + the null terminator\nstd::string szCaption(\"SC4Fix pre3\");\n\nvoid __declspec(naked) TitleBarMod::Hook_Sub44C2B0(void) {\n\t_asm mov edx, offset szCaption\n\tRETJMP(44C99Ch);\n}\n\nvoid __declspec(naked) TitleBarMod::Hook_Steam_Sub44C2B0(void) {\n\t_asm mov ecx, offset szCaption\n\tRETJMP(44CA80h)\n}\n\nvoid TitleBarMod::InstallPatch(void) {\n\tswitch (GetGameVersion()) {\n\tcase 640:\n\t\tCPatcher::InstallHook(0x44C996, Hook_Sub44C2B0);\n\t\tbreak;\n\n\tcase 641:\n\t\tCPatcher::InstallHook(0x44CA7A, Hook_Steam_Sub44C2B0);\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}<commit_msg>Bump version number<commit_after>\/*\n Project: SC4Fix Patches for SimCity 4\n File: TitleBarMod.cpp\n\n Copyright (c) 2015 Nelson Gomez (simmaster07)\n\n Licensed under the MIT License. A copy of the License is available in\n LICENSE or at:\n\n http:\/\/opensource.org\/licenses\/MIT\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n*\/\n\n#include \"TitleBarMod.h\"\n#include <string>\n\n\/\/ This is restricted to 15 characters + the null terminator\nstd::string szCaption(\"SC4Fix r4\");\n\nvoid __declspec(naked) TitleBarMod::Hook_Sub44C2B0(void) {\n\t_asm mov edx, offset szCaption\n\tRETJMP(44C99Ch);\n}\n\nvoid __declspec(naked) TitleBarMod::Hook_Steam_Sub44C2B0(void) {\n\t_asm mov ecx, offset szCaption\n\tRETJMP(44CA80h)\n}\n\nvoid TitleBarMod::InstallPatch(void) {\n\tswitch (GetGameVersion()) {\n\tcase 640:\n\t\tCPatcher::InstallHook(0x44C996, Hook_Sub44C2B0);\n\t\tbreak;\n\n\tcase 641:\n\t\tCPatcher::InstallHook(0x44CA7A, Hook_Steam_Sub44C2B0);\n\t\tbreak;\n\n\tdefault:\n\t\tbreak;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Development Kit\"\n\/\/ For conditions of distribution and use, see copyright notice in Prerequesites.hpp\n\n#include <NDK\/Entity.hpp>\n#include <NDK\/BaseComponent.hpp>\n#include <NDK\/World.hpp>\n\nnamespace Ndk\n{\n\t\/*!\n\t* \\ingroup NDK\n\t* \\class Ndk::Entity\n\t* \\brief NDK class that represents an entity in a world\n\t*\/\n\n\t\/*!\n\t* \\brief Constructs a Entity object by move semantic\n\t*\n\t* \\param entity Entity to move into this\n\t*\/\n\n\tEntity::Entity(Entity&& entity) :\n\tHandledObject(std::move(entity)),\n\tm_components(std::move(entity.m_components)),\n\tm_componentBits(std::move(entity.m_componentBits)),\n\tm_systemBits(std::move(entity.m_systemBits)),\n\tm_id(entity.m_id),\n\tm_world(entity.m_world),\n\tm_enabled(entity.m_enabled),\n\tm_valid(entity.m_valid)\n\t{\n\t}\n\n\t\/*!\n\t* \\brief Constructs a Entity object linked to a world and with an id\n\t*\n\t* \\param world World in which the entity interact\n\t* \\param id Identifier of the entity\n\t*\/\n\n\tEntity::Entity(World* world, EntityId id) :\n\tm_id(id),\n\tm_world(world)\n\t{\n\t}\n\n\t\/*!\n\t* \\brief Destructs the object and calls Destroy\n\t*\n\t* \\see Destroy\n\t*\/\n\n\tEntity::~Entity()\n\t{\n\t\tDestroy();\n\t}\n\n\t\/*!\n\t* \\brief Adds a component to the entity\n\t* \\return A reference to the newly added component\n\t*\n\t* \\param componentPtr Component to add to the entity\n\t*\n\t* \\remark Produces a NazaraAssert if component is nullptr\n\t*\/\n\n\tBaseComponent& Entity::AddComponent(std::unique_ptr<BaseComponent>&& componentPtr)\n\t{\n\t\tNazaraAssert(componentPtr, \"Component must be valid\");\n\n\t\tComponentIndex index = componentPtr->GetIndex();\n\n\t\t\/\/ We ensure that the vector has enough space\n\t\tif (index >= m_components.size())\n\t\t\tm_components.resize(index + 1);\n\n\t\t\/\/ Affectation and return of the component\n\t\tm_components[index] = std::move(componentPtr);\n\t\tm_componentBits.UnboundedSet(index);\n\t\tm_removedComponentBits.UnboundedReset(index);\n\n\t\tInvalidate();\n\n\t\t\/\/ We get the new component and we alert other existing components of the new one\n\t\tBaseComponent& component = *m_components[index].get();\n\t\tcomponent.SetEntity(this);\n\n\t\tfor (std::size_t i = m_componentBits.FindFirst(); i != m_componentBits.npos; i = m_componentBits.FindNext(i))\n\t\t{\n\t\t\tif (i != index)\n\t\t\t\tm_components[i]->OnComponentAttached(component);\n\t\t}\n\n\t\treturn component;\n\t}\n\n\t\/*!\n\t* \\brief Clones the entity\n\t* \\return The clone newly created\n\t*\n\t* \\remark The close is enable by default, even if the original is disabled\n\t* \\remark Produces a NazaraAssert if the entity is not valid\n\t*\/\n\n\tconst EntityHandle& Entity::Clone() const\n\t{\n\t\tNazaraAssert(IsValid(), \"Invalid entity\");\n\n\t\treturn m_world->CloneEntity(m_id);\n\t}\n\n\t\/*!\n\t* \\brief Kills the entity\n\t*\/\n\n\tvoid Entity::Kill()\n\t{\n\t\tm_world->KillEntity(this);\n\t}\n\n\t\/*!\n\t* \\brief Invalidates the entity\n\t*\/\n\n\tvoid Entity::Invalidate()\n\t{\n\t\t\/\/ We alert everyone that we have been updated\n\t\tm_world->Invalidate(m_id);\n\t}\n\n\t\/*!\n\t* \\brief Creates the entity\n\t*\/\n\n\tvoid Entity::Create()\n\t{\n\t\tm_enabled = true;\n\t\tm_valid = true;\n\t}\n\n\t\/*!\n\t* \\brief Destroys the entity\n\t*\/\n\n\tvoid Entity::Destroy()\n\t{\n\t\t\/\/ We alert each system\n\t\tfor (std::size_t index = m_systemBits.FindFirst(); index != m_systemBits.npos; index = m_systemBits.FindNext(index))\n\t\t{\n\t\t\tauto sysIndex = static_cast<Ndk::SystemIndex>(index);\n\n\t\t\tif (m_world->HasSystem(sysIndex))\n\t\t\t{\n\t\t\t\tBaseSystem& system = m_world->GetSystem(sysIndex);\n\t\t\t\tsystem.RemoveEntity(this);\n\t\t\t}\n\t\t}\n\t\tm_systemBits.Clear();\n\n\t\tUnregisterAllHandles();\n\n\t\tm_components.clear();\n\t\tm_componentBits.Reset();\n\n\t\tm_valid = false;\n\t}\n\n\t\/*!\n\t* \\brief Destroys a component by index\n\t*\n\t* \\param index Index of the component\n\t*\n\t* \\remark If component is not available, no action is performed\n\t*\/\n\n\tvoid Entity::DestroyComponent(ComponentIndex index)\n\t{\n\t\tif (HasComponent(index))\n\t\t{\n\t\t\t\/\/ We get the component and we alert existing components of the deleted one\n\t\t\tBaseComponent& component = *m_components[index].get();\n\t\t\tfor (std::size_t i = m_componentBits.FindFirst(); i != m_componentBits.npos; i = m_componentBits.FindNext(i))\n\t\t\t{\n\t\t\t\tif (i != index)\n\t\t\t\t\tm_components[i]->OnComponentDetached(component);\n\t\t\t}\n\n\t\t\tcomponent.SetEntity(nullptr);\n\n\t\t\tm_components[index].reset();\n\t\t\tm_componentBits.Reset(index);\n\t\t}\n\t}\n\n}\n<commit_msg>Sdk\/Entity: Fix entity destruction not calling Component::OnDetached<commit_after>\/\/ Copyright (C) 2017 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Development Kit\"\n\/\/ For conditions of distribution and use, see copyright notice in Prerequesites.hpp\n\n#include <NDK\/Entity.hpp>\n#include <NDK\/BaseComponent.hpp>\n#include <NDK\/World.hpp>\n\nnamespace Ndk\n{\n\t\/*!\n\t* \\ingroup NDK\n\t* \\class Ndk::Entity\n\t* \\brief NDK class that represents an entity in a world\n\t*\/\n\n\t\/*!\n\t* \\brief Constructs a Entity object by move semantic\n\t*\n\t* \\param entity Entity to move into this\n\t*\/\n\n\tEntity::Entity(Entity&& entity) :\n\tHandledObject(std::move(entity)),\n\tm_components(std::move(entity.m_components)),\n\tm_componentBits(std::move(entity.m_componentBits)),\n\tm_systemBits(std::move(entity.m_systemBits)),\n\tm_id(entity.m_id),\n\tm_world(entity.m_world),\n\tm_enabled(entity.m_enabled),\n\tm_valid(entity.m_valid)\n\t{\n\t}\n\n\t\/*!\n\t* \\brief Constructs a Entity object linked to a world and with an id\n\t*\n\t* \\param world World in which the entity interact\n\t* \\param id Identifier of the entity\n\t*\/\n\n\tEntity::Entity(World* world, EntityId id) :\n\tm_id(id),\n\tm_world(world)\n\t{\n\t}\n\n\t\/*!\n\t* \\brief Destructs the object and calls Destroy\n\t*\n\t* \\see Destroy\n\t*\/\n\n\tEntity::~Entity()\n\t{\n\t\tDestroy();\n\t}\n\n\t\/*!\n\t* \\brief Adds a component to the entity\n\t* \\return A reference to the newly added component\n\t*\n\t* \\param componentPtr Component to add to the entity\n\t*\n\t* \\remark Produces a NazaraAssert if component is nullptr\n\t*\/\n\n\tBaseComponent& Entity::AddComponent(std::unique_ptr<BaseComponent>&& componentPtr)\n\t{\n\t\tNazaraAssert(componentPtr, \"Component must be valid\");\n\n\t\tComponentIndex index = componentPtr->GetIndex();\n\n\t\t\/\/ We ensure that the vector has enough space\n\t\tif (index >= m_components.size())\n\t\t\tm_components.resize(index + 1);\n\n\t\t\/\/ Affectation and return of the component\n\t\tm_components[index] = std::move(componentPtr);\n\t\tm_componentBits.UnboundedSet(index);\n\t\tm_removedComponentBits.UnboundedReset(index);\n\n\t\tInvalidate();\n\n\t\t\/\/ We get the new component and we alert other existing components of the new one\n\t\tBaseComponent& component = *m_components[index].get();\n\t\tcomponent.SetEntity(this);\n\n\t\tfor (std::size_t i = m_componentBits.FindFirst(); i != m_componentBits.npos; i = m_componentBits.FindNext(i))\n\t\t{\n\t\t\tif (i != index)\n\t\t\t\tm_components[i]->OnComponentAttached(component);\n\t\t}\n\n\t\treturn component;\n\t}\n\n\t\/*!\n\t* \\brief Clones the entity\n\t* \\return The clone newly created\n\t*\n\t* \\remark The close is enable by default, even if the original is disabled\n\t* \\remark Produces a NazaraAssert if the entity is not valid\n\t*\/\n\n\tconst EntityHandle& Entity::Clone() const\n\t{\n\t\tNazaraAssert(IsValid(), \"Invalid entity\");\n\n\t\treturn m_world->CloneEntity(m_id);\n\t}\n\n\t\/*!\n\t* \\brief Kills the entity\n\t*\/\n\n\tvoid Entity::Kill()\n\t{\n\t\tm_world->KillEntity(this);\n\t}\n\n\t\/*!\n\t* \\brief Invalidates the entity\n\t*\/\n\n\tvoid Entity::Invalidate()\n\t{\n\t\t\/\/ We alert everyone that we have been updated\n\t\tm_world->Invalidate(m_id);\n\t}\n\n\t\/*!\n\t* \\brief Creates the entity\n\t*\/\n\n\tvoid Entity::Create()\n\t{\n\t\tm_enabled = true;\n\t\tm_valid = true;\n\t}\n\n\t\/*!\n\t* \\brief Destroys the entity\n\t*\/\n\n\tvoid Entity::Destroy()\n\t{\n\t\t\/\/ We alert each system\n\t\tfor (std::size_t index = m_systemBits.FindFirst(); index != m_systemBits.npos; index = m_systemBits.FindNext(index))\n\t\t{\n\t\t\tauto sysIndex = static_cast<Ndk::SystemIndex>(index);\n\n\t\t\tif (m_world->HasSystem(sysIndex))\n\t\t\t{\n\t\t\t\tBaseSystem& system = m_world->GetSystem(sysIndex);\n\t\t\t\tsystem.RemoveEntity(this);\n\t\t\t}\n\t\t}\n\t\tm_systemBits.Clear();\n\n\t\t\/\/ We properly destroy each component\n\t\tfor (std::size_t i = m_componentBits.FindFirst(); i != m_componentBits.npos; i = m_componentBits.FindNext(i))\n\t\t\tm_components[i]->SetEntity(nullptr);\n\n\t\tm_components.clear();\n\t\tm_componentBits.Reset();\n\n\t\t\/\/ And then free every handle\n\t\tUnregisterAllHandles();\n\n\t\tm_valid = false;\n\t}\n\n\t\/*!\n\t* \\brief Destroys a component by index\n\t*\n\t* \\param index Index of the component\n\t*\n\t* \\remark If component is not available, no action is performed\n\t*\/\n\n\tvoid Entity::DestroyComponent(ComponentIndex index)\n\t{\n\t\tif (HasComponent(index))\n\t\t{\n\t\t\t\/\/ We get the component and we alert existing components of the deleted one\n\t\t\tBaseComponent& component = *m_components[index].get();\n\t\t\tfor (std::size_t i = m_componentBits.FindFirst(); i != m_componentBits.npos; i = m_componentBits.FindNext(i))\n\t\t\t{\n\t\t\t\tif (i != index)\n\t\t\t\t\tm_components[i]->OnComponentDetached(component);\n\t\t\t}\n\n\t\t\tcomponent.SetEntity(nullptr);\n\n\t\t\tm_components[index].reset();\n\t\t\tm_componentBits.Reset(index);\n\t\t}\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"3rdparty\/GL\/OpenGL.h\"\n#include \"texture.h\"\n\n#include \"augs\/graphics\/renderer.h\"\n\nnamespace augs {\n\tnamespace graphics {\n\t\ttexture::~texture() {\n\t\t\tdestroy();\n\t\t}\n\n\t\tvoid texture::create(const augs::image& source) {\n\t\t\tdestroy();\n\n\t\t\tglGenTextures(1, &id); glerr;\n\t\t\taugs::renderer::get_current().bind_texture(*this);\n\n\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glerr;\n\n\t\t\tglTexImage2D(\n\t\t\t\tGL_TEXTURE_2D, \n\t\t\t\t0, \n\t\t\t\tGL_RGBA, \n\t\t\t\tsource.get_size().x, \n\t\t\t\tsource.get_size().y, \n\t\t\t\t0, \n\t\t\t\tGL_BGRA, \n\t\t\t\tGL_UNSIGNED_BYTE, \n\t\t\t\tsource.get_data()\n\t\t\t); glerr;\n\n\t\t\tbuilt = true;\n\t\t}\n\n\t\tvoid texture::destroy() {\n\t\t\tif (built) {\n\t\t\t\tglDeleteTextures(1, &id); glerr;\n\t\t\t}\n\t\t\t\n\t\t\tbuilt = false;\n\t\t}\n\t}\n}\n\n\/\/ glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP); glerr;\n<commit_msg>fixed texture filtering<commit_after>#include \"3rdparty\/GL\/OpenGL.h\"\n#include \"texture.h\"\n\n#include \"augs\/graphics\/renderer.h\"\n\nnamespace augs {\n\tnamespace graphics {\n\t\ttexture::~texture() {\n\t\t\tdestroy();\n\t\t}\n\n\t\tvoid texture::create(const augs::image& source) {\n\t\t\tdestroy();\n\n\t\t\tglGenTextures(1, &id); glerr;\n\t\t\taugs::renderer::get_current().bind_texture(*this);\n\n\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST); glerr;\n\t\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST); glerr;\n\n\t\t\tglTexImage2D(\n\t\t\t\tGL_TEXTURE_2D, \n\t\t\t\t0, \n\t\t\t\tGL_RGBA, \n\t\t\t\tsource.get_size().x, \n\t\t\t\tsource.get_size().y, \n\t\t\t\t0, \n\t\t\t\tGL_BGRA, \n\t\t\t\tGL_UNSIGNED_BYTE, \n\t\t\t\tsource.get_data()\n\t\t\t); glerr;\n\n\t\t\tbuilt = true;\n\t\t}\n\n\t\tvoid texture::destroy() {\n\t\t\tif (built) {\n\t\t\t\tglDeleteTextures(1, &id); glerr;\n\t\t\t}\n\t\t\t\n\t\t\tbuilt = false;\n\t\t}\n\t}\n}\n\n\/\/ glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP); glerr;\n<|endoftext|>"} {"text":"<commit_before>#include \"rack.hpp\"\n\nusing namespace rack;\nextern Plugin *plugin;\n\nstruct SimpleClockWidget : ModuleWidget {\n\tSimpleClockWidget();\n};\n\nstruct RMSWidget : ModuleWidget {\n\tRMSWidget();\n};\n\nstruct XYPadWidget : ModuleWidget {\n\tXYPadWidget();\n\tMenu *createContextMenu();\n};\n\nstruct BouncyBallWidget : ModuleWidget {\n\tBouncyBallWidget();\n};\n\nstruct QuantizerWidget : ModuleWidget {\n\tQuantizerWidget();\n\tenum Notes {\n\t\tNOTE_C, \n\t\tNOTE_C_SHARP,\n\t\tNOTE_D,\n\t\tNOTE_D_SHARP,\n\t\tNOTE_E,\n\t\tNOTE_F,\n\t\tNOTE_F_SHARP,\n\t\tNOTE_G,\n\t\tNOTE_G_SHARP,\n\t\tNOTE_A,\n\t\tNOTE_A_SHARP,\n\t\tNOTE_B,\n\t\tNUM_NOTES\n\t};\n\t\n\tenum ScalesEnum {\n\t\tAEOLIAN,\n\t\tBLUES,\n\t\tCHROMATIC,\n\t\tDIATONIC_MINOR,\n\t\tDORIAN,\n\t\tHARMONIC_MINOR,\n\t\tINDIAN,\n\t\tLOCRIAN,\n\t\tLYDIAN,\n\t\tMAJOR,\n\t\tMELODIC_MINOR,\n\t\tMINOR,\n\t\tMIXOLYDIAN,\n\t\tNATURAL_MINOR,\n\t\tPENTATONIC,\n\t\tPHRYGIAN,\n\t\tTURKISH,\n\t\tNONE,\n\t\tNUM_SCALES\n\t};\n};\n\nstruct FullScopeWidget : ModuleWidget {\n\tPanel *panel;\n\tWidget *rightHandle;\n\tTransparentWidget *display;\n\tFullScopeWidget();\n\tvoid step();\n\tjson_t *toJson();\n\tvoid fromJson(json_t *rootJ);\n};\n\nstruct GridSeqWidget : ModuleWidget {\n\tstd::vector<ParamWidget*> seqKnobs;\n\tstd::vector<ParamWidget*> gateButtons;\n\tGridSeqWidget();\n\t~GridSeqWidget(){ \n\t\tseqKnobs.clear(); \n\t\tgateButtons.clear(); \n\t}\n\tMenu *createContextMenu();\n};\n\nstruct CenteredLabel : Widget {\n\tstd::string text;\n\tint fontSize;\n\tCenteredLabel(int _fontSize = 12) {\n\t\tfontSize = _fontSize;\n\t\tbox.size.y = BND_WIDGET_HEIGHT;\n\t}\n\tvoid draw(NVGcontext *vg) override {\n\t\tnvgTextAlign(vg, NVG_ALIGN_CENTER);\n\t\tnvgFillColor(vg, nvgRGB(25, 150, 252));\n\t\tnvgFontSize(vg, fontSize);\n\t\tnvgText(vg, box.pos.x, box.pos.y, text.c_str(), NULL);\n\t}\n};\n\nstruct SmallWhiteKnob : RoundKnob {\n\tSmallWhiteKnob() {\n\t\tsetSVG(SVG::load(assetPlugin(plugin, \"res\/SmallWhiteKnob.svg\")));\n\t}\n\tCenteredLabel* linkedLabel = nullptr;\n\t\n\tvoid connectLabel(CenteredLabel* label) {\n\t\tlinkedLabel = label;\n\t\tif (linkedLabel) {\n\t\t\tlinkedLabel->text = formatCurrentValue();\n\t\t}\n\t}\n\n\tvoid onChange(EventChange &e) override {\n\t\tRoundKnob::onChange(e);\n\t\tif (linkedLabel) {\n\t\t\tlinkedLabel->text = formatCurrentValue();\n\t\t}\n\t}\n\n\tvirtual std::string formatCurrentValue() {\n\t\treturn std::to_string(static_cast<unsigned int>(value));\n\t}\n};\n\nstruct LEDButtonSmall : SVGSwitch, MomentarySwitch {\n\tLEDButtonSmall() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LEDButton_small.svg\")));\n\t}\n};\n\nstruct Screw_J : SVGScrew {\n\tScrew_J() {\n\t\tsw->setSVG(SVG::load(assetPlugin(plugin, \"res\/Screw_J.svg\")));\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct Screw_W : SVGScrew {\n\tScrew_W() {\n\t\tsw->setSVG(SVG::load(assetPlugin(plugin, \"res\/Screw_W.svg\")));\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct TinyBlackKnob : RoundKnob {\n\tTinyBlackKnob() {\n\t\tsetSVG(SVG::load(assetGlobal(\"res\/ComponentLibrary\/RoundBlack.svg\")));\n\t\tbox.size = Vec(15, 15);\n\t}\n};\n\nstruct TinyPJ301MPort : SVGPort {\n\tTinyPJ301MPort() {\n\t\tbackground->svg = SVG::load(assetPlugin(plugin, \"res\/TinyPJ301M.svg\"));\n\t\tbackground->wrap();\n\t\tbox.size = background->box.size;\n\t}\n};\n\nstruct MyBlueValueLight : ColorLightWidget {\n\tMyBlueValueLight() {\n\t\taddColor(nvgRGB(25, 150, 252));\n\t}\n};\n\nstruct NoteKnob : SmallWhiteKnob {\n\tstd::string formatCurrentValue() override {\n\t\tswitch(int(value)){\n\t\t\tcase QuantizerWidget::NOTE_C: return \"C\";\n\t\t\tcase QuantizerWidget::NOTE_C_SHARP: return \"C#\";\n\t\t\tcase QuantizerWidget::NOTE_D: return \"D\";\n\t\t\tcase QuantizerWidget::NOTE_D_SHARP: return \"D#\";\n\t\t\tcase QuantizerWidget::NOTE_E: return \"E\";\n\t\t\tcase QuantizerWidget::NOTE_F: return \"F\";\n\t\t\tcase QuantizerWidget::NOTE_F_SHARP: return \"F#\";\n\t\t\tcase QuantizerWidget::NOTE_G: return \"G\";\n\t\t\tcase QuantizerWidget::NOTE_G_SHARP: return \"G#\";\n\t\t\tcase QuantizerWidget::NOTE_A: return \"A\";\n\t\t\tcase QuantizerWidget::NOTE_A_SHARP: return \"A#\";\n\t\t\tcase QuantizerWidget::NOTE_B: return \"B\";\n\t\t\tdefault: return \"\";\n\t\t}\n\t}\n};\n\nstruct ScaleKnob : SmallWhiteKnob {\n\tstd::string formatCurrentValue() override {\n\t\tswitch(int(value)){\n\t\t\tcase QuantizerWidget::AEOLIAN: return \"Aeolian\";\n\t\t\tcase QuantizerWidget::BLUES: return \"Blues\";\n\t\t\tcase QuantizerWidget::CHROMATIC: return \"Chromat\";\n\t\t\tcase QuantizerWidget::DIATONIC_MINOR: return \"Diat Min\";\n\t\t\tcase QuantizerWidget::DORIAN: return \"Dorian\";\n\t\t\tcase QuantizerWidget::HARMONIC_MINOR: return \"Harm Min\";\n\t\t\tcase QuantizerWidget::INDIAN: return \"Indian\";\n\t\t\tcase QuantizerWidget::LOCRIAN: return \"Locrian\";\n\t\t\tcase QuantizerWidget::LYDIAN: return \"Lydian\";\n\t\t\tcase QuantizerWidget::MAJOR: return \"Major\";\n\t\t\tcase QuantizerWidget::MELODIC_MINOR: return \"Mel Min\";\n\t\t\tcase QuantizerWidget::MINOR: return \"Minor\";\n\t\t\tcase QuantizerWidget::MIXOLYDIAN: return \"Mixolyd\";\n\t\t\tcase QuantizerWidget::NATURAL_MINOR: return \"Nat Min\";\n\t\t\tcase QuantizerWidget::PENTATONIC: return \"Penta\";\n\t\t\tcase QuantizerWidget::PHRYGIAN: return \"Phrygian\";\n\t\t\tcase QuantizerWidget::TURKISH: return \"Turkish\";\n\t\t\tcase QuantizerWidget::NONE: return \"None\";\n\t\t\tdefault: return \"\";\n\t\t}\n\t}\n};\n\nstruct RightMoveButton : SVGSwitch, MomentarySwitch {\n\tRightMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RightButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RightButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct LeftMoveButton : SVGSwitch, MomentarySwitch {\n\tLeftMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LeftButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LeftButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct DownMoveButton : SVGSwitch, MomentarySwitch {\n\tDownMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/DownButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/DownButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct UpMoveButton : SVGSwitch, MomentarySwitch {\n\tUpMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/UpButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/UpButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct RndMoveButton : SVGSwitch, MomentarySwitch {\n\tRndMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RndButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RndButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct RepMoveButton : SVGSwitch, MomentarySwitch {\n\tRepMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RepButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RepButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct SmallButton : SVGSwitch, MomentarySwitch {\n\tSmallButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/ButtonUp.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/ButtonDown.svg\")));\n\t}\n};\n\nstruct ModuleResizeHandle : Widget {\n\tfloat minWidth;\n\tbool right = false;\n\tfloat dragX;\n\tRect originalBox;\n\tModuleResizeHandle(float _minWidth) {\n\t\tbox.size = Vec(RACK_GRID_WIDTH * 1, RACK_GRID_HEIGHT);\n\t\tminWidth = _minWidth;\n\t}\n\tvoid onMouseDown(EventMouseDown &e) override {\n\t\tif (e.button == 0) {\n\t\t\te.consumed = true;\n\t\t\te.target = this;\n\t\t}\n\t}\n\tvoid onDragStart(EventDragStart &e) override {\n\t\tdragX = gRackWidget->lastMousePos.x;\n\t\tModuleWidget *m = getAncestorOfType<ModuleWidget>();\n\t\toriginalBox = m->box;\n\t}\n\tvoid onDragMove(EventDragMove &e) override {\n\t\tModuleWidget *m = getAncestorOfType<ModuleWidget>();\n\n\t\tfloat newDragX = gRackWidget->lastMousePos.x;\n\t\tfloat deltaX = newDragX - dragX;\n\n\t\tRect newBox = originalBox;\n\t\tif (right) {\n\t\t\tnewBox.size.x += deltaX;\n\t\t\tnewBox.size.x = fmaxf(newBox.size.x, minWidth);\n\t\t\tnewBox.size.x = roundf(newBox.size.x \/ RACK_GRID_WIDTH) * RACK_GRID_WIDTH;\n\t\t}\n\t\telse {\n\t\t\tnewBox.size.x -= deltaX;\n\t\t\tnewBox.size.x = fmaxf(newBox.size.x, minWidth);\n\t\t\tnewBox.size.x = roundf(newBox.size.x \/ RACK_GRID_WIDTH) * RACK_GRID_WIDTH;\n\t\t\tnewBox.pos.x = originalBox.pos.x + originalBox.size.x - newBox.size.x;\n\t\t}\n\t\tgRackWidget->requestModuleBox(m, newBox);\n\t}\n};\n\n\n\n<commit_msg>fixed lights<commit_after>#include \"rack.hpp\"\n\nusing namespace rack;\nextern Plugin *plugin;\n\nstruct SimpleClockWidget : ModuleWidget {\n\tSimpleClockWidget();\n};\n\nstruct RMSWidget : ModuleWidget {\n\tRMSWidget();\n};\n\nstruct XYPadWidget : ModuleWidget {\n\tXYPadWidget();\n\tMenu *createContextMenu();\n};\n\nstruct BouncyBallWidget : ModuleWidget {\n\tBouncyBallWidget();\n};\n\nstruct QuantizerWidget : ModuleWidget {\n\tQuantizerWidget();\n\tenum Notes {\n\t\tNOTE_C, \n\t\tNOTE_C_SHARP,\n\t\tNOTE_D,\n\t\tNOTE_D_SHARP,\n\t\tNOTE_E,\n\t\tNOTE_F,\n\t\tNOTE_F_SHARP,\n\t\tNOTE_G,\n\t\tNOTE_G_SHARP,\n\t\tNOTE_A,\n\t\tNOTE_A_SHARP,\n\t\tNOTE_B,\n\t\tNUM_NOTES\n\t};\n\t\n\tenum ScalesEnum {\n\t\tAEOLIAN,\n\t\tBLUES,\n\t\tCHROMATIC,\n\t\tDIATONIC_MINOR,\n\t\tDORIAN,\n\t\tHARMONIC_MINOR,\n\t\tINDIAN,\n\t\tLOCRIAN,\n\t\tLYDIAN,\n\t\tMAJOR,\n\t\tMELODIC_MINOR,\n\t\tMINOR,\n\t\tMIXOLYDIAN,\n\t\tNATURAL_MINOR,\n\t\tPENTATONIC,\n\t\tPHRYGIAN,\n\t\tTURKISH,\n\t\tNONE,\n\t\tNUM_SCALES\n\t};\n};\n\nstruct FullScopeWidget : ModuleWidget {\n\tPanel *panel;\n\tWidget *rightHandle;\n\tTransparentWidget *display;\n\tFullScopeWidget();\n\tvoid step();\n\tjson_t *toJson();\n\tvoid fromJson(json_t *rootJ);\n};\n\nstruct GridSeqWidget : ModuleWidget {\n\tstd::vector<ParamWidget*> seqKnobs;\n\tstd::vector<ParamWidget*> gateButtons;\n\tGridSeqWidget();\n\t~GridSeqWidget(){ \n\t\tseqKnobs.clear(); \n\t\tgateButtons.clear(); \n\t}\n\tMenu *createContextMenu();\n};\n\nstruct CenteredLabel : Widget {\n\tstd::string text;\n\tint fontSize;\n\tCenteredLabel(int _fontSize = 12) {\n\t\tfontSize = _fontSize;\n\t\tbox.size.y = BND_WIDGET_HEIGHT;\n\t}\n\tvoid draw(NVGcontext *vg) override {\n\t\tnvgTextAlign(vg, NVG_ALIGN_CENTER);\n\t\tnvgFillColor(vg, nvgRGB(25, 150, 252));\n\t\tnvgFontSize(vg, fontSize);\n\t\tnvgText(vg, box.pos.x, box.pos.y, text.c_str(), NULL);\n\t}\n};\n\nstruct SmallWhiteKnob : RoundKnob {\n\tSmallWhiteKnob() {\n\t\tsetSVG(SVG::load(assetPlugin(plugin, \"res\/SmallWhiteKnob.svg\")));\n\t}\n\tCenteredLabel* linkedLabel = nullptr;\n\t\n\tvoid connectLabel(CenteredLabel* label) {\n\t\tlinkedLabel = label;\n\t\tif (linkedLabel) {\n\t\t\tlinkedLabel->text = formatCurrentValue();\n\t\t}\n\t}\n\n\tvoid onChange(EventChange &e) override {\n\t\tRoundKnob::onChange(e);\n\t\tif (linkedLabel) {\n\t\t\tlinkedLabel->text = formatCurrentValue();\n\t\t}\n\t}\n\n\tvirtual std::string formatCurrentValue() {\n\t\treturn std::to_string(static_cast<unsigned int>(value));\n\t}\n};\n\nstruct LEDButtonSmall : SVGSwitch, MomentarySwitch {\n\tLEDButtonSmall() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LEDButton_small.svg\")));\n\t}\n};\n\nstruct Screw_J : SVGScrew {\n\tScrew_J() {\n\t\tsw->setSVG(SVG::load(assetPlugin(plugin, \"res\/Screw_J.svg\")));\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct Screw_W : SVGScrew {\n\tScrew_W() {\n\t\tsw->setSVG(SVG::load(assetPlugin(plugin, \"res\/Screw_W.svg\")));\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct TinyBlackKnob : RoundKnob {\n\tTinyBlackKnob() {\n\t\tsetSVG(SVG::load(assetGlobal(\"res\/ComponentLibrary\/RoundBlack.svg\")));\n\t\tbox.size = Vec(15, 15);\n\t}\n};\n\nstruct TinyPJ301MPort : SVGPort {\n\tTinyPJ301MPort() {\n\t\tbackground->svg = SVG::load(assetPlugin(plugin, \"res\/TinyPJ301M.svg\"));\n\t\tbackground->wrap();\n\t\tbox.size = background->box.size;\n\t}\n};\n\nstruct MyBlueValueLight : ModuleLightWidget {\n\tMyBlueValueLight() {\n\t\tfirstLightId = 1;\n\t\taddBaseColor(nvgRGB(25, 150, 252));\n\t}\n};\n\nstruct NoteKnob : SmallWhiteKnob {\n\tstd::string formatCurrentValue() override {\n\t\tswitch(int(value)){\n\t\t\tcase QuantizerWidget::NOTE_C: return \"C\";\n\t\t\tcase QuantizerWidget::NOTE_C_SHARP: return \"C#\";\n\t\t\tcase QuantizerWidget::NOTE_D: return \"D\";\n\t\t\tcase QuantizerWidget::NOTE_D_SHARP: return \"D#\";\n\t\t\tcase QuantizerWidget::NOTE_E: return \"E\";\n\t\t\tcase QuantizerWidget::NOTE_F: return \"F\";\n\t\t\tcase QuantizerWidget::NOTE_F_SHARP: return \"F#\";\n\t\t\tcase QuantizerWidget::NOTE_G: return \"G\";\n\t\t\tcase QuantizerWidget::NOTE_G_SHARP: return \"G#\";\n\t\t\tcase QuantizerWidget::NOTE_A: return \"A\";\n\t\t\tcase QuantizerWidget::NOTE_A_SHARP: return \"A#\";\n\t\t\tcase QuantizerWidget::NOTE_B: return \"B\";\n\t\t\tdefault: return \"\";\n\t\t}\n\t}\n};\n\nstruct ScaleKnob : SmallWhiteKnob {\n\tstd::string formatCurrentValue() override {\n\t\tswitch(int(value)){\n\t\t\tcase QuantizerWidget::AEOLIAN: return \"Aeolian\";\n\t\t\tcase QuantizerWidget::BLUES: return \"Blues\";\n\t\t\tcase QuantizerWidget::CHROMATIC: return \"Chromat\";\n\t\t\tcase QuantizerWidget::DIATONIC_MINOR: return \"Diat Min\";\n\t\t\tcase QuantizerWidget::DORIAN: return \"Dorian\";\n\t\t\tcase QuantizerWidget::HARMONIC_MINOR: return \"Harm Min\";\n\t\t\tcase QuantizerWidget::INDIAN: return \"Indian\";\n\t\t\tcase QuantizerWidget::LOCRIAN: return \"Locrian\";\n\t\t\tcase QuantizerWidget::LYDIAN: return \"Lydian\";\n\t\t\tcase QuantizerWidget::MAJOR: return \"Major\";\n\t\t\tcase QuantizerWidget::MELODIC_MINOR: return \"Mel Min\";\n\t\t\tcase QuantizerWidget::MINOR: return \"Minor\";\n\t\t\tcase QuantizerWidget::MIXOLYDIAN: return \"Mixolyd\";\n\t\t\tcase QuantizerWidget::NATURAL_MINOR: return \"Nat Min\";\n\t\t\tcase QuantizerWidget::PENTATONIC: return \"Penta\";\n\t\t\tcase QuantizerWidget::PHRYGIAN: return \"Phrygian\";\n\t\t\tcase QuantizerWidget::TURKISH: return \"Turkish\";\n\t\t\tcase QuantizerWidget::NONE: return \"None\";\n\t\t\tdefault: return \"\";\n\t\t}\n\t}\n};\n\nstruct RightMoveButton : SVGSwitch, MomentarySwitch {\n\tRightMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RightButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RightButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct LeftMoveButton : SVGSwitch, MomentarySwitch {\n\tLeftMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LeftButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/LeftButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct DownMoveButton : SVGSwitch, MomentarySwitch {\n\tDownMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/DownButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/DownButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct UpMoveButton : SVGSwitch, MomentarySwitch {\n\tUpMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/UpButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/UpButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct RndMoveButton : SVGSwitch, MomentarySwitch {\n\tRndMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RndButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RndButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct RepMoveButton : SVGSwitch, MomentarySwitch {\n\tRepMoveButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RepButton.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/RepButtonDown.svg\")));\n\t\tsw->wrap();\n\t\tbox.size = sw->box.size;\n\t}\n};\n\nstruct SmallButton : SVGSwitch, MomentarySwitch {\n\tSmallButton() {\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/ButtonUp.svg\")));\n\t\taddFrame(SVG::load(assetPlugin(plugin, \"res\/ButtonDown.svg\")));\n\t}\n};\n\nstruct ModuleResizeHandle : Widget {\n\tfloat minWidth;\n\tbool right = false;\n\tfloat dragX;\n\tRect originalBox;\n\tModuleResizeHandle(float _minWidth) {\n\t\tbox.size = Vec(RACK_GRID_WIDTH * 1, RACK_GRID_HEIGHT);\n\t\tminWidth = _minWidth;\n\t}\n\tvoid onMouseDown(EventMouseDown &e) override {\n\t\tif (e.button == 0) {\n\t\t\te.consumed = true;\n\t\t\te.target = this;\n\t\t}\n\t}\n\tvoid onDragStart(EventDragStart &e) override {\n\t\tdragX = gRackWidget->lastMousePos.x;\n\t\tModuleWidget *m = getAncestorOfType<ModuleWidget>();\n\t\toriginalBox = m->box;\n\t}\n\tvoid onDragMove(EventDragMove &e) override {\n\t\tModuleWidget *m = getAncestorOfType<ModuleWidget>();\n\n\t\tfloat newDragX = gRackWidget->lastMousePos.x;\n\t\tfloat deltaX = newDragX - dragX;\n\n\t\tRect newBox = originalBox;\n\t\tif (right) {\n\t\t\tnewBox.size.x += deltaX;\n\t\t\tnewBox.size.x = fmaxf(newBox.size.x, minWidth);\n\t\t\tnewBox.size.x = roundf(newBox.size.x \/ RACK_GRID_WIDTH) * RACK_GRID_WIDTH;\n\t\t}\n\t\telse {\n\t\t\tnewBox.size.x -= deltaX;\n\t\t\tnewBox.size.x = fmaxf(newBox.size.x, minWidth);\n\t\t\tnewBox.size.x = roundf(newBox.size.x \/ RACK_GRID_WIDTH) * RACK_GRID_WIDTH;\n\t\t\tnewBox.pos.x = originalBox.pos.x + originalBox.size.x - newBox.size.x;\n\t\t}\n\t\tgRackWidget->requestModuleBox(m, newBox);\n\t}\n};\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <fcntl.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' || \n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic void getRangeLowered(unsigned int start,\n\t\tunsigned int end,\n\t\tAccessor &styler,\n\t\tchar *s,\n\t\tunsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast<char>(tolower(styler[start + i]));\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\ninline bool IsASpace(unsigned int ch) {\n return (ch == ' ') || ((ch >= 0x09) && (ch <= 0x0d));\n}\n\ninline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADigit(unsigned int ch) {\n\treturn (ch >= '0') && (ch <= '9');\n}\n\n\/\/ All languages handled so far can treat all characters >= 0x80 as one class\n\/\/ which just continues the current token or starts an identifier if in default.\n\/\/ DBCS treated specially as the second character can be < 0x80 and hence \n\/\/ syntactically significant. UTF-8 avoids this as all trail bytes are >= 0x80\nclass ColouriseContext {\n\tAccessor &styler;\n\tint lengthDoc;\n\tint currentPos;\n\tColouriseContext& operator=(const ColouriseContext&) {\n\t\treturn *this;\n\t}\npublic:\n\tint state;\n\tunsigned int chPrev;\n\tunsigned int ch;\n\tunsigned int chNext;\n\n\tColouriseContext(unsigned int startPos, int length,\n int initStyle, Accessor &styler_) : \n\t\tstyler(styler_),\n\t\tlengthDoc(startPos + length),\n\t\tcurrentPos(startPos), \n\t\tstate(initStyle), \n\t\tchPrev(0),\n\t\tch(0), \n\t\tchNext(0) {\n\t\tstyler.StartAt(startPos);\n\t\tstyler.StartSegment(startPos);\n\t\tint pos = currentPos;\n\t\tch = static_cast<unsigned char>(styler.SafeGetCharAt(pos));\n\t\tif (styler.IsLeadByte(static_cast<char>(ch))) {\n\t\t\tpos++;\n\t\t\tch = ch << 8;\n\t\t\tch |= static_cast<unsigned char>(styler.SafeGetCharAt(pos));\n\t\t}\n\t\tchNext = static_cast<unsigned char>(styler.SafeGetCharAt(pos+1));\n\t\tif (styler.IsLeadByte(static_cast<char>(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast<unsigned char>(styler.SafeGetCharAt(pos+2));\n\t\t}\n\t}\n\tvoid Complete() {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t}\n\tbool More() {\n\t\treturn currentPos <= lengthDoc;\n\t}\n\tvoid Forward() {\n\t\tchPrev = ch;\n\t\tcurrentPos++;\n\t\tif (ch >= 0x100)\n\t\t\tcurrentPos++;\n\t\tch = chNext;\n\t\tchNext = static_cast<unsigned char>(styler.SafeGetCharAt(currentPos+1));\n\t\tif (styler.IsLeadByte(static_cast<char>(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast<unsigned char>(styler.SafeGetCharAt(currentPos + 2));\n\t\t}\n\t}\n\tvoid ChangeState(int state_) {\n\t\tstate = state_;\n\t}\n\tvoid SetState(int state_) {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t\tstate = state_;\n\t}\n\tvoid GetCurrentLowered(char *s, int len) {\n\t\tgetRangeLowered(styler.GetStartSegment(), currentPos - 1, styler, s, len);\n\t}\n};\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tColouriseContext lc(startPos, length, initStyle, styler);\n\n\tfor (; lc.More(); lc.Forward()) {\n\n\t\tif (lc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (lc.ch != '\\r' && lc.ch != '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (lc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tlc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tlc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (lc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (lc.ch == '-' && lc.chNext == '-') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(lc.ch) || (lc.ch == '.')) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tlc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) || \n\t\t\t\t(strcmp(s, \"debug\") == 0) || \n\t\t\t\t(strcmp(s, \"deferred\") == 0) || \n\t\t\t\t(strcmp(s, \"do\") == 0) || \n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) || \n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0) \n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords);\n<commit_msg>Changed name of ColouriseContext to allow debugging.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexEiffel.cxx\n ** Lexer for Eiffel.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdarg.h>\n#include <stdio.h>\n#include <fcntl.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\ninline bool isEiffelOperator(unsigned int ch) {\n\t\/\/ '.' left out as it is used to make up numbers\n\treturn ch == '*' || ch == '\/' || ch == '\\\\' || ch == '-' || ch == '+' ||\n\t ch == '(' || ch == ')' || ch == '=' ||\n\t ch == '{' || ch == '}' || ch == '~' ||\n\t ch == '[' || ch == ']' || ch == ';' ||\n\t ch == '<' || ch == '>' || ch == ',' ||\n\t ch == '.' || ch == '^' || ch == '%' || ch == ':' || \n\t\tch == '!' || ch == '@' || ch == '?';\n}\n\nstatic void getRangeLowered(unsigned int start,\n\t\tunsigned int end,\n\t\tAccessor &styler,\n\t\tchar *s,\n\t\tunsigned int len) {\n\tunsigned int i = 0;\n\twhile ((i < end - start + 1) && (i < len-1)) {\n\t\ts[i] = static_cast<char>(tolower(styler[start + i]));\n\t\ti++;\n\t}\n\ts[i] = '\\0';\n}\n\ninline bool IsASpace(unsigned int ch) {\n return (ch == ' ') || ((ch >= 0x09) && (ch <= 0x0d));\n}\n\ninline bool IsAWordChar(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(unsigned int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADigit(unsigned int ch) {\n\treturn (ch >= '0') && (ch <= '9');\n}\n\n\/\/ All languages handled so far can treat all characters >= 0x80 as one class\n\/\/ which just continues the current token or starts an identifier if in default.\n\/\/ DBCS treated specially as the second character can be < 0x80 and hence \n\/\/ syntactically significant. UTF-8 avoids this as all trail bytes are >= 0x80\nclass xColouriseContext {\n\tAccessor &styler;\n\tint lengthDoc;\n\tint currentPos;\n\txColouriseContext& operator=(const xColouriseContext&) {\n\t\treturn *this;\n\t}\npublic:\n\tint state;\n\tunsigned int chPrev;\n\tunsigned int ch;\n\tunsigned int chNext;\n\n\txColouriseContext(unsigned int startPos, int length,\n int initStyle, Accessor &styler_) : \n\t\tstyler(styler_),\n\t\tlengthDoc(startPos + length),\n\t\tcurrentPos(startPos), \n\t\tstate(initStyle), \n\t\tchPrev(0),\n\t\tch(0), \n\t\tchNext(0) {\n\t\tstyler.StartAt(startPos);\n\t\tstyler.StartSegment(startPos);\n\t\tint pos = currentPos;\n\t\tch = static_cast<unsigned char>(styler.SafeGetCharAt(pos));\n\t\tif (styler.IsLeadByte(static_cast<char>(ch))) {\n\t\t\tpos++;\n\t\t\tch = ch << 8;\n\t\t\tch |= static_cast<unsigned char>(styler.SafeGetCharAt(pos));\n\t\t}\n\t\tchNext = static_cast<unsigned char>(styler.SafeGetCharAt(pos+1));\n\t\tif (styler.IsLeadByte(static_cast<char>(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast<unsigned char>(styler.SafeGetCharAt(pos+2));\n\t\t}\n\t}\n\tvoid Complete() {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t}\n\tbool More() {\n\t\treturn currentPos <= lengthDoc;\n\t}\n\tvoid Forward() {\n\t\tchPrev = ch;\n\t\tcurrentPos++;\n\t\tif (ch >= 0x100)\n\t\t\tcurrentPos++;\n\t\tch = chNext;\n\t\tchNext = static_cast<unsigned char>(styler.SafeGetCharAt(currentPos+1));\n\t\tif (styler.IsLeadByte(static_cast<char>(chNext))) {\n\t\t\tchNext = chNext << 8;\n\t\t\tchNext |= static_cast<unsigned char>(styler.SafeGetCharAt(currentPos + 2));\n\t\t}\n\t}\n\tvoid ChangeState(int state_) {\n\t\tstate = state_;\n\t}\n\tvoid SetState(int state_) {\n\t\tstyler.ColourTo(currentPos - 1, state);\n\t\tstate = state_;\n\t}\n\tvoid GetCurrentLowered(char *s, int len) {\n\t\tgetRangeLowered(styler.GetStartSegment(), currentPos - 1, styler, s, len);\n\t}\n};\n\nstatic void ColouriseEiffelDoc(unsigned int startPos,\n int length,\n int initStyle,\n WordList *keywordlists[],\n Accessor &styler) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\txColouriseContext lc(startPos, length, initStyle, styler);\n\n\tfor (; lc.More(); lc.Forward()) {\n\n\t\tif (lc.state == SCE_EIFFEL_STRINGEOL) {\n\t\t\tif (lc.ch != '\\r' && lc.ch != '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_OPERATOR) {\n\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t} else if (lc.state == SCE_EIFFEL_WORD) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tchar s[100];\n\t\t\t\tlc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\tif (!keywords.InList(s)) {\n\t\t\t\t\tlc.ChangeState(SCE_EIFFEL_IDENTIFIER);\n\t\t\t\t}\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_NUMBER) {\n\t\t\tif (!IsAWordChar(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_COMMENTLINE) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_STRING) {\n\t\t\tif (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t} else if (lc.state == SCE_EIFFEL_CHARACTER) {\n\t\t\tif (lc.ch == '\\r' || lc.ch == '\\n') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRINGEOL);\n\t\t\t} else if (lc.ch == '%') {\n\t\t\t\tlc.Forward();\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.Forward();\n\t\t\t\tlc.SetState(SCE_EIFFEL_DEFAULT);\n\t\t\t}\n\t\t}\n\n\t\tif (lc.state == SCE_EIFFEL_DEFAULT) {\n\t\t\tif (lc.ch == '-' && lc.chNext == '-') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_COMMENTLINE);\n\t\t\t} else if (lc.ch == '\\\"') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_STRING);\n\t\t\t} else if (lc.ch == '\\'') {\n\t\t\t\tlc.SetState(SCE_EIFFEL_CHARACTER);\n\t\t\t} else if (IsADigit(lc.ch) || (lc.ch == '.')) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_NUMBER);\n\t\t\t} else if (IsAWordStart(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_WORD);\n\t\t\t} else if (isEiffelOperator(lc.ch)) {\n\t\t\t\tlc.SetState(SCE_EIFFEL_OPERATOR);\n\t\t\t}\n\t\t}\n\t}\n\tlc.Complete();\n}\n\nstatic bool IsEiffelComment(Accessor &styler, int pos, int len) {\n\treturn len>1 && styler[pos]=='-' && styler[pos+1]=='-';\n}\n\nstatic void FoldEiffelDocIndent(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint lengthDoc = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsEiffelComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == lengthDoc)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsEiffelComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsEiffelComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void FoldEiffelDocKeyWords(unsigned int startPos, int length, int \/* initStyle *\/, WordList *[],\n Accessor &styler) {\n\tunsigned int lengthDoc = startPos + length;\n\tint visibleChars = 0;\n\tint lineCurrent = styler.GetLine(startPos);\n\tint levelPrev = styler.LevelAt(lineCurrent) & SC_FOLDLEVELNUMBERMASK;\n\tint levelCurrent = levelPrev;\n\tchar chNext = styler[startPos];\n\tint stylePrev = 0;\n\tint styleNext = styler.StyleAt(startPos);\n\t\/\/ lastDeferred should be determined by looking back to last keyword in case\n\t\/\/ the \"deferred\" is on a line before \"class\"\n\tbool lastDeferred = false;\n\tfor (unsigned int i = startPos; i < lengthDoc; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\t\tint style = styleNext;\n\t\tstyleNext = styler.StyleAt(i + 1);\n\t\tbool atEOL = (ch == '\\r' && chNext != '\\n') || (ch == '\\n');\n\t\tif ((stylePrev != SCE_EIFFEL_WORD) && (style == SCE_EIFFEL_WORD)) {\n\t\t\tchar s[20];\n\t\t\tunsigned int j = 0;\n\t\t\twhile ((j < (sizeof(s) - 1)) && (iswordchar(styler[i + j]))) {\n\t\t\t\ts[j] = styler[i + j];\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ts[j] = '\\0';\n\n\t\t\tif (\n\t\t\t\t(strcmp(s, \"check\") == 0) || \n\t\t\t\t(strcmp(s, \"debug\") == 0) || \n\t\t\t\t(strcmp(s, \"deferred\") == 0) || \n\t\t\t\t(strcmp(s, \"do\") == 0) || \n\t\t\t\t(strcmp(s, \"from\") == 0) ||\n\t\t\t\t(strcmp(s, \"if\") == 0) ||\n\t\t\t\t(strcmp(s, \"inspect\") == 0) || \n\t\t\t\t(strcmp(s, \"once\") == 0)\n\t\t\t)\n\t\t\t\tlevelCurrent++;\n\t\t\tif (!lastDeferred && (strcmp(s, \"class\") == 0))\n\t\t\t\tlevelCurrent++;\n\t\t\tif (strcmp(s, \"end\") == 0) \n\t\t\t\tlevelCurrent--;\n\t\t\tlastDeferred = strcmp(s, \"deferred\") == 0;\n\t\t}\n\n\t\tif (atEOL) {\n\t\t\tint lev = levelPrev;\n\t\t\tif (visibleChars == 0)\n\t\t\t\tlev |= SC_FOLDLEVELWHITEFLAG;\n\t\t\tif ((levelCurrent > levelPrev) && (visibleChars > 0))\n\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\tif (lev != styler.LevelAt(lineCurrent)) {\n\t\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\t}\n\t\t\tlineCurrent++;\n\t\t\tlevelPrev = levelCurrent;\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!isspacechar(ch))\n\t\t\tvisibleChars++;\n\t\tstylePrev = style;\n\t}\n\t\/\/ Fill in the real level of the next line, keeping the current flags as they will be filled in later\n\tint flagsNext = styler.LevelAt(lineCurrent) & ~SC_FOLDLEVELNUMBERMASK;\n\tstyler.SetLevel(lineCurrent, levelPrev | flagsNext);\n}\n\nLexerModule lmEiffel(SCLEX_EIFFEL, ColouriseEiffelDoc, \"eiffel\", FoldEiffelDocIndent);\nLexerModule lmEiffelkw(SCLEX_EIFFELKW, ColouriseEiffelDoc, \"eiffelkw\", FoldEiffelDocKeyWords);\n<|endoftext|>"} {"text":"<commit_before>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tstd::cout << \"entering MenuState\\n\";\n\tm_menuBeingChanged = false;\n\tm_nbButtons = 2;\n\tm_activeButtonIndex = 0;\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tstd::cout << \"exiting MenuState\\n\";\n\treturn true;\n}\n<commit_msg>this is not needed here, already initialised in the construct<commit_after>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tstd::cout << \"exiting MenuState\\n\";\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tstd::cout << \"entering MenuState\\n\";\n\tm_menuBeingChanged = false;\n\tm_nbButtons = 2;\n\tm_activeButtonIndex = 0;\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tstd::cout << \"exiting MenuState\\n\";\n\treturn true;\n}\n<commit_msg>the directions where inverted<commit_after>#include \"MenuState.h\"\n#include \"Game.h\"\n#include \"InputHandler.h\"\n#include \"PlayState.h\"\n#include <iostream>\n\nMenuState::MenuState(const int nbButtons) : m_nbButtons(nbButtons) {}\n\nvoid MenuState::update() {\n\tInputHandler* handlerInstance = InputHandler::Instance();\n\tif (handlerInstance->joysticksInitialised()) {\n\t\tint yAxisValue = handlerInstance->stickYValue(0, LEFT_STICK);\n\t\t\/\/ The stick must be brought back to neutral position to choose another\n\t\t\/\/ menu element, otherwise, it moves too fast.\n\t\tif (m_menuBeingChanged && yAxisValue == 0) {\n\t\t\tm_menuBeingChanged = false;\n\t\t}\n\t\telse if (!m_menuBeingChanged && yAxisValue != 0) {\n\t\t\t\/\/ deactivate the current menu element, change the current active\n\t\t\t\/\/ index, activate the new current menu element\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(false);\n\t\t\tif (yAxisValue < 0) {\n\t\t\t\tm_activeButtonIndex = (m_nbButtons + m_activeButtonIndex - 1) % m_nbButtons;\n\t\t\t}\n\t\t\telse if (yAxisValue > 0) {\n\t\t\t\tm_activeButtonIndex = (m_activeButtonIndex + 1) % m_nbButtons;\n\t\t\t}\n\t\t\tm_buttons[m_activeButtonIndex]->setActive(true);\n\t\t\tm_menuBeingChanged = true;\n\t\t}\n\n\t\tif (InputHandler::Instance()->getButtonState(0, 0)) {\n\t\t\tm_buttons[m_activeButtonIndex]->executeAction();\n\t\t}\n\t}\n}\n\nvoid MenuState::render() {\n\tfor (std::vector<GameObject*>::size_type i = 0; i != m_renderableObjects.size(); i++) {\n\t\tm_renderableObjects[i]->render(Game::Instance()->getRenderer());\n\t}\n}\n\nbool MenuState::onEnter() {\n\tstd::cout << \"entering MenuState\\n\";\n\tm_menuBeingChanged = false;\n\tm_nbButtons = 2;\n\tm_activeButtonIndex = 0;\n\tfor (int i = 0; i < m_nbButtons; ++i) {\n\t\tm_buttons.push_back(createButton(i));\n\t\tm_gameObjects.push_back(m_buttons[i]);\n\t\tm_renderableObjects.push_back(m_buttons[i]);\n\t}\n\treturn true;\n}\n\nbool MenuState::onExit() {\n\tstd::cout << \"exiting MenuState\\n\";\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (C) 2012 Kolibre\n\nThis file is part of kolibre-narrator.\n\nKolibre-narrator is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 of the License, or\n(at your option) any later version.\n\nKolibre-narrator is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with kolibre-narrator. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"Message.h\"\n#include \"Mp3Stream.h\"\n\n#include <cstdio>\n#include <sstream>\n#include <math.h>\n#include <log4cxx\/logger.h>\n\n\/\/ create logger which will become a child to logger kolibre.narrator\nlog4cxx::LoggerPtr narratorMsLog(log4cxx::Logger::getLogger(\"kolibre.narrator.mp3stream\"));\n\nMp3Stream::Mp3Stream()\n{\n LOG4CXX_INFO(narratorMsLog, \"Initializing mp3stream\");\n\n mError = 0;\n mEncoding = 0;\n mChannels = 0;\n mRate = 0;\n isOpen = false;\n openTmpFile = false;\n mTmpFile = \"\";\n scaleNegative = powf(2, 16);\n scalePositive = scaleNegative - 1;\n\n mpg123_init();\n mh = mpg123_new(NULL, &mError);\n mFrameSize = mpg123_outblock(mh);\n}\n\nMp3Stream::~Mp3Stream()\n{\n close();\n if (mh) mpg123_delete(mh);\n mpg123_exit();\n}\n\nbool Mp3Stream::open(const MessageAudio &ma)\n{\n \/\/ opening mp3 audio from database could possibly be done by libmpg123 feed API calls\n \/\/ but since this fearture will bu used very seldom it's sufficient to create temporary files\n \/\/ and let libmpg123 open a file on the filesystem\n\n size_t bytesToRead = ma.getSize();\n\n \/\/ read audio data from database to buffer\n LOG4CXX_DEBUG(narratorMsLog, \"reading \" << bytesToRead << \" bytes from database\");\n currentAudio = ma;\n char *buffer;\n buffer = (char *) malloc (bytesToRead * sizeof(char));\n size_t bytesRead = currentAudio.read(buffer, sizeof(char), bytesToRead);\n currentAudio.close();\n\n \/\/ write buffer data to tmp file\n mTmpFile = std::tmpnam(NULL);\n LOG4CXX_DEBUG(narratorMsLog, \"creating temporary file \" << mTmpFile);\n FILE *pFile = fopen(mTmpFile.c_str(), \"wb\");\n if (pFile == NULL)\n {\n LOG4CXX_ERROR(narratorMsLog, \"failed to open temporary file\");\n free(buffer);\n return false;\n }\n LOG4CXX_DEBUG(narratorMsLog, \"writing \" << bytesRead << \" bytes to file\");\n fwrite(buffer, sizeof(char), bytesRead, pFile);\n fclose(pFile);\n free(buffer);\n\n openTmpFile = true;\n return open(mTmpFile);\n}\n\nbool Mp3Stream::open(string path)\n{\n \/\/ open file\n int result = mpg123_open(mh, path.c_str());\n if (result != MPG123_OK)\n {\n LOG4CXX_ERROR(narratorMsLog, \"File \" << path << \" could not be opened\");\n return false;\n }\n\n \/\/ get rate, channels and encoding\n mpg123_getformat(mh, &mRate, &mChannels, &mEncoding);\n isOpen = true;\n\n return true;\n}\n\n\/\/ Returns samples (1 sample contains data from all channels)\nlong Mp3Stream::read(float* buffer, int bytes)\n{\n LOG4CXX_TRACE(narratorMsLog, \"read \" << bytes << \" bytes from mp3 file\");\n\n \/\/ mpg123 uses enconding MPG123_ENC_SIGNED_16 which results in decoded short samples\n short *shortBuffer;\n shortBuffer = new short[bytes*mChannels];\n\n size_t done = 0;\n int result = mpg123_read(mh, (unsigned char*)shortBuffer, bytes*mChannels*sizeof(short), &done);\n\n switch (result)\n {\n case MPG123_DONE:\n LOG4CXX_DEBUG(narratorMsLog, \"End of stream\");\n break;\n case MPG123_OK:\n break;\n }\n\n LOG4CXX_TRACE(narratorMsLog, done << \" bytes decoded\");\n\n \/\/ convert short buffer to scaled float buffer\n float *bufptr = buffer;\n for (int i = 0; i < done\/sizeof(short); i++)\n {\n int value = (int)shortBuffer[i];\n if (value == 0)\n {\n *buffer++ = 0.f;\n }\n else if (value < 0)\n {\n \/\/ multiple with 2.0f to increase volume by a factor of 2 (+6dB)\n *buffer++ = (float)(value\/scaleNegative) * 2.0f;\n }\n else\n {\n \/\/ multiple with 2.0f to increase volume by a factor of 2 (+6dB)\n *buffer++ = (float)(value\/scalePositive) * 2.0f;\n }\n }\n delete shortBuffer;\n\n return done\/sizeof(short);\n}\n\nbool Mp3Stream::close()\n{\n if (openTmpFile)\n {\n LOG4CXX_DEBUG(narratorMsLog, \"deleting temporary file \" << mTmpFile);\n if (remove(mTmpFile.c_str()) != 0) LOG4CXX_WARN(narratorMsLog, \"file could not be deleted\");\n openTmpFile = false;\n mTmpFile = \"\";\n }\n if (isOpen)\n {\n mpg123_close(mh);\n isOpen = false;\n }\n return true;\n}\n\nlong Mp3Stream::getRate()\n{\n return mRate;\n}\n\nlong Mp3Stream::getChannels()\n{\n return mChannels;\n}\n<commit_msg>Fix double free crash when decoding mp3 audio with two channels<commit_after>\/*\nCopyright (C) 2012 Kolibre\n\nThis file is part of kolibre-narrator.\n\nKolibre-narrator is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 of the License, or\n(at your option) any later version.\n\nKolibre-narrator is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with kolibre-narrator. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"Message.h\"\n#include \"Mp3Stream.h\"\n\n#include <cstdio>\n#include <sstream>\n#include <math.h>\n#include <log4cxx\/logger.h>\n\n\/\/ create logger which will become a child to logger kolibre.narrator\nlog4cxx::LoggerPtr narratorMsLog(log4cxx::Logger::getLogger(\"kolibre.narrator.mp3stream\"));\n\nMp3Stream::Mp3Stream()\n{\n LOG4CXX_INFO(narratorMsLog, \"Initializing mp3stream\");\n\n mError = 0;\n mEncoding = 0;\n mChannels = 0;\n mRate = 0;\n isOpen = false;\n openTmpFile = false;\n mTmpFile = \"\";\n scaleNegative = powf(2, 16);\n scalePositive = scaleNegative - 1;\n\n mpg123_init();\n mh = mpg123_new(NULL, &mError);\n mFrameSize = mpg123_outblock(mh);\n}\n\nMp3Stream::~Mp3Stream()\n{\n close();\n if (mh) mpg123_delete(mh);\n mpg123_exit();\n}\n\nbool Mp3Stream::open(const MessageAudio &ma)\n{\n \/\/ opening mp3 audio from database could possibly be done by libmpg123 feed API calls\n \/\/ but since this fearture will bu used very seldom it's sufficient to create temporary files\n \/\/ and let libmpg123 open a file on the filesystem\n\n size_t bytesToRead = ma.getSize();\n\n \/\/ read audio data from database to buffer\n LOG4CXX_DEBUG(narratorMsLog, \"reading \" << bytesToRead << \" bytes from database\");\n currentAudio = ma;\n char *buffer;\n buffer = (char *) malloc (bytesToRead * sizeof(char));\n size_t bytesRead = currentAudio.read(buffer, sizeof(char), bytesToRead);\n currentAudio.close();\n\n \/\/ write buffer data to tmp file\n mTmpFile = std::tmpnam(NULL);\n LOG4CXX_DEBUG(narratorMsLog, \"creating temporary file \" << mTmpFile);\n FILE *pFile = fopen(mTmpFile.c_str(), \"wb\");\n if (pFile == NULL)\n {\n LOG4CXX_ERROR(narratorMsLog, \"failed to open temporary file\");\n free(buffer);\n return false;\n }\n LOG4CXX_DEBUG(narratorMsLog, \"writing \" << bytesRead << \" bytes to file\");\n fwrite(buffer, sizeof(char), bytesRead, pFile);\n fclose(pFile);\n free(buffer);\n\n openTmpFile = true;\n return open(mTmpFile);\n}\n\nbool Mp3Stream::open(string path)\n{\n \/\/ open file\n int result = mpg123_open(mh, path.c_str());\n if (result != MPG123_OK)\n {\n LOG4CXX_ERROR(narratorMsLog, \"File \" << path << \" could not be opened\");\n return false;\n }\n\n \/\/ get rate, channels and encoding\n mpg123_getformat(mh, &mRate, &mChannels, &mEncoding);\n isOpen = true;\n\n return true;\n}\n\n\/\/ Returns samples (1 sample contains data from all channels)\nlong Mp3Stream::read(float* buffer, int bytes)\n{\n LOG4CXX_TRACE(narratorMsLog, \"read \" << bytes << \" bytes from mp3 file\");\n\n \/\/ mpg123 uses enconding MPG123_ENC_SIGNED_16 which results in decoded short samples\n short *shortBuffer;\n shortBuffer = new short[bytes*mChannels];\n\n size_t done = 0;\n int result = mpg123_read(mh, (unsigned char*)shortBuffer, bytes*sizeof(short), &done);\n\n switch (result)\n {\n case MPG123_DONE:\n LOG4CXX_DEBUG(narratorMsLog, \"End of stream\");\n break;\n case MPG123_OK:\n break;\n }\n\n LOG4CXX_TRACE(narratorMsLog, done << \" bytes decoded\");\n\n \/\/ convert short buffer to scaled float buffer\n float *bufptr = buffer;\n for (int i = 0; i < done\/sizeof(short); i++)\n {\n int value = (int)shortBuffer[i];\n if (value == 0)\n {\n *buffer++ = 0.f;\n }\n else if (value < 0)\n {\n \/\/ multiple with 2.0f to increase volume by a factor of 2 (+6dB)\n *buffer++ = (float)(value\/scaleNegative) * 2.0f;\n }\n else\n {\n \/\/ multiple with 2.0f to increase volume by a factor of 2 (+6dB)\n *buffer++ = (float)(value\/scalePositive) * 2.0f;\n }\n }\n delete shortBuffer;\n\n return done\/sizeof(short);\n}\n\nbool Mp3Stream::close()\n{\n if (openTmpFile)\n {\n LOG4CXX_DEBUG(narratorMsLog, \"deleting temporary file \" << mTmpFile);\n if (remove(mTmpFile.c_str()) != 0) LOG4CXX_WARN(narratorMsLog, \"file could not be deleted\");\n openTmpFile = false;\n mTmpFile = \"\";\n }\n if (isOpen)\n {\n mpg123_close(mh);\n isOpen = false;\n }\n return true;\n}\n\nlong Mp3Stream::getRate()\n{\n return mRate;\n}\n\nlong Mp3Stream::getChannels()\n{\n return mChannels;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2016 Johannes Ohlemacher (https:\/\/github.com\/eXistence\/TeeTime-Cpp)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <iostream>\n#include <teetime\/stages\/RandomIntProducer.h>\n#include <teetime\/stages\/AbstractConsumerStage.h>\n#include <teetime\/stages\/FunctionStage.h>\n#include <teetime\/stages\/CollectorSink.h>\n#include <teetime\/stages\/DistributorStage.h>\n#include <teetime\/stages\/MergerStage.h> \n#include <teetime\/Configuration.h>\n#include <teetime\/Md5Hash.h>\n#include <teetime\/ports\/Port.h>\n#include <teetime\/logging.h>\n#include <teetime\/platform.h>\n#include <climits>\n#include <string>\n#include <random>\n#include \"Benchmark.h\"\n\nusing namespace teetime;\n\nnamespace {\n\nclass Producer : public AbstractProducerStage<Md5Hash>\n{\npublic:\n Producer(int min, int max, int num)\n : m_min(min)\n , m_max(max)\n , m_num(num)\n {}\n\nprivate:\n virtual void execute() override\n {\n if (m_min == m_max)\n {\n auto hash = Md5Hash::generate(&m_min, sizeof(m_min));\n for (int i = 0; i < m_num; ++i)\n {\n AbstractProducerStage<Md5Hash>::getOutputPort().send(Md5Hash(hash));\n }\n }\n else\n {\n \/\/std::random_device rand_dev;\n std::mt19937 generator(0); \/\/TODO(johl): currently using 0 as seed (instead of rand_dev) for reproducable results. This should be adjustable.\n std::uniform_int_distribution<int> distr(m_min, m_max);\n\n for (int i = 0; i < m_num; ++i)\n {\n int value = distr(generator);\n AbstractProducerStage<Md5Hash>::getOutputPort().send(Md5Hash::generate(&value, sizeof(value)));\n }\n }\n\n\n AbstractProducerStage<Md5Hash>::terminate();\n }\n\n int m_min;\n int m_max;\n int m_num;\n};\n\nint reverseHash(Md5Hash hash) {\n for(int i=0; i<INT_MAX; ++i) {\n if( Md5Hash::generate(&i, sizeof(i)) == hash ) {\n return i;\n }\n }\n\n return -1;\n}\n\n\n\nclass Config2 : public Configuration\n{\npublic:\n Config2(const Params& params, int threads, const std::vector<int>& affinity)\n {\n CpuDispenser cpus(affinity);\n\n int min = params.getInt32(\"minvalue\");\n int max = params.getInt32(\"maxvalue\");\n int num = params.getInt32(\"num\");\n\n auto producer = createStage<Producer>(min, max, num);\n auto distributor = createStage<DistributorStage<Md5Hash>>();\n auto merger = createStage<MergerStage<int>>();\n auto sink = createStage<CollectorSink<int>>();\n\n declareStageActive(producer, cpus.next());\n declareStageActive(merger, cpus.next());\n\n for(int i=0; i<threads; ++i)\n {\n auto revhash = createStageFromFunction<Md5Hash, int, reverseHash>();\n declareStageActive(revhash, cpus.next());\n\n connectPorts(distributor->getNewOutputPort(), revhash->getInputPort());\n connectPorts(revhash->getOutputPort(), merger->getNewInputPort());\n }\n\n connectPorts(producer->getOutputPort(), distributor->getInputPort());\n connectPorts(merger->getOutputPort(), sink->getInputPort()); \n }\n};\n\n}\n\nvoid benchmark_teetime(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_none);\n config.executeBlocking();\n}\n\nvoid benchmark_teetime_prefer_same_cpu(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_preferSameCpu);\n config.executeBlocking();\n}\n\nvoid benchmark_teetime_avoid_same_core(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_avoidSameCore);\n config.executeBlocking();\n}<commit_msg>fixed queue capacity<commit_after>\/**\n * Copyright (C) 2016 Johannes Ohlemacher (https:\/\/github.com\/eXistence\/TeeTime-Cpp)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <iostream>\n#include <teetime\/stages\/RandomIntProducer.h>\n#include <teetime\/stages\/AbstractConsumerStage.h>\n#include <teetime\/stages\/FunctionStage.h>\n#include <teetime\/stages\/CollectorSink.h>\n#include <teetime\/stages\/DistributorStage.h>\n#include <teetime\/stages\/MergerStage.h> \n#include <teetime\/Configuration.h>\n#include <teetime\/Md5Hash.h>\n#include <teetime\/ports\/Port.h>\n#include <teetime\/logging.h>\n#include <teetime\/platform.h>\n#include <climits>\n#include <string>\n#include <random>\n#include \"Benchmark.h\"\n\nusing namespace teetime;\n\nnamespace {\n\nclass Producer : public AbstractProducerStage<Md5Hash>\n{\npublic:\n Producer(int min, int max, int num)\n : m_min(min)\n , m_max(max)\n , m_num(num)\n {}\n\nprivate:\n virtual void execute() override\n {\n if (m_min == m_max)\n {\n auto hash = Md5Hash::generate(&m_min, sizeof(m_min));\n for (int i = 0; i < m_num; ++i)\n {\n AbstractProducerStage<Md5Hash>::getOutputPort().send(Md5Hash(hash));\n }\n }\n else\n {\n \/\/std::random_device rand_dev;\n std::mt19937 generator(0); \/\/TODO(johl): currently using 0 as seed (instead of rand_dev) for reproducable results. This should be adjustable.\n std::uniform_int_distribution<int> distr(m_min, m_max);\n\n for (int i = 0; i < m_num; ++i)\n {\n int value = distr(generator);\n AbstractProducerStage<Md5Hash>::getOutputPort().send(Md5Hash::generate(&value, sizeof(value)));\n }\n }\n\n\n AbstractProducerStage<Md5Hash>::terminate();\n }\n\n int m_min;\n int m_max;\n int m_num;\n};\n\nint reverseHash(Md5Hash hash) {\n for(int i=0; i<INT_MAX; ++i) {\n if( Md5Hash::generate(&i, sizeof(i)) == hash ) {\n return i;\n }\n }\n\n return -1;\n}\n\n\n\nclass Config2 : public Configuration\n{\npublic:\n Config2(const Params& params, int threads, const std::vector<int>& affinity)\n {\n CpuDispenser cpus(affinity);\n\n int min = params.getInt32(\"minvalue\");\n int max = params.getInt32(\"maxvalue\");\n int num = params.getInt32(\"num\");\n\n auto producer = createStage<Producer>(min, max, num);\n auto distributor = createStage<DistributorStage<Md5Hash>>();\n auto merger = createStage<MergerStage<int>>();\n auto sink = createStage<CollectorSink<int>>();\n\n declareStageActive(producer, cpus.next());\n declareStageActive(merger, cpus.next());\n\n for(int i=0; i<threads; ++i)\n {\n auto revhash = createStageFromFunction<Md5Hash, int, reverseHash>();\n declareStageActive(revhash, cpus.next());\n\n connectPorts(distributor->getNewOutputPort(), revhash->getInputPort(), 4096);\n connectPorts(revhash->getOutputPort(), merger->getNewInputPort(), 4096);\n }\n\n connectPorts(producer->getOutputPort(), distributor->getInputPort(), 4096);\n connectPorts(merger->getOutputPort(), sink->getInputPort(), 4096); \n }\n};\n\n}\n\nvoid benchmark_teetime(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_none);\n config.executeBlocking();\n}\n\nvoid benchmark_teetime_prefer_same_cpu(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_preferSameCpu);\n config.executeBlocking();\n}\n\nvoid benchmark_teetime_avoid_same_core(const Params& params, int threads)\n{\n Config2 config(params, threads, affinity_avoidSameCore);\n config.executeBlocking();\n}<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <thread>\n\n#include \"Processor.hpp\"\n\nusing namespace std;\n\nconst uint32_t Processor::interruptHandlerAddress = 0x00010000;\n\nvoid Processor::handleInterruption() {\n if (cp0->interruptable() && cp0->interrupting()) {\n \/\/ save current PC to EPC\n cp0->regs[14] = pc;\n \/\/ set PC to interrupt handler address\n pc = interruptHandlerAddress;\n \/\/ disable interrupt from the same device\n cp0->disableInterruptForCode(cp0->interruptingBusCode());\n }\n}\n\nvoid Processor::tick() {\n d.deAsm(bus->at(pc >> 2)->get());\n pc += 4;\n handleInterruption();\n\n switch(d.opcode) {\n case 0b000000:\n \/\/ R-type instruction\n switch(d.func) {\n case 0b100000: regs[d.rd] = regs[d.rs] + regs[d.rt]; break; \/\/ add\n case 0b100001: regs[d.rd] = regs[d.rs] + regs[d.rt]; break; \/\/ addu\n case 0b100010: regs[d.rd] = regs[d.rs] - regs[d.rt]; break; \/\/ sub\n case 0b100011: regs[d.rd] = regs[d.rs] - regs[d.rt]; break; \/\/ subu\n case 0b100100: regs[d.rd] = regs[d.rs] & regs[d.rt]; break; \/\/ and\n case 0b100101: regs[d.rd] = regs[d.rs] | regs[d.rt]; break; \/\/ or\n case 0b100110: regs[d.rd] = regs[d.rs] ^ regs[d.rt]; break; \/\/ xor\n case 0b100111: regs[d.rd] = ~(regs[d.rs] | regs[d.rt]); break; \/\/ nor\n case 0b101010: \n regs[d.rd] = (int32_t)(regs[d.rs] - regs[d.rt]) < 0 ? 1 : 0; break; \/\/ slt\n case 0b101011:\n regs[d.rd] = (int32_t)(regs[d.rs] - regs[d.rt]) < 0 ? 1 : 0; break; \/\/ sltu\n case 0b000000: regs[d.rd] = regs[d.rt] << regs[d.shamt]; break; \/\/ sll\n case 0b000010: regs[d.rd] = regs[d.rt] >> regs[d.shamt]; break; \/\/ srl\n case 0b000011:\n regs[d.rd] = (uint32_t)((int32_t)regs[d.rs] >> regs[d.rt]); \/\/ sra\n break; \n case 0b000100: regs[d.rd] = regs[d.rt] << regs[d.rs]; break; \/\/ sllv\n case 0b000110: regs[d.rd] = regs[d.rt] >> regs[d.rs]; break; \/\/ srlv\n case 0b000111:\n regs[d.rd] = (uint32_t)((int32_t)regs[d.rt] >> regs[d.rs]); \/\/ srav\n break;\n case 0b001000: pc = regs[d.rs]; break; \/\/ jr\n }\n break;\n \/\/ I-type instruction\n case 0b001000: regs[d.rt] = regs[d.rs] + d.signedExtImm; break; \/\/ addi\n case 0b001001: regs[d.rt] = regs[d.rs] + d.signedExtImm; break; \/\/ addiu\n case 0b001100: regs[d.rt] = regs[d.rs] & d.signedExtImm; break; \/\/ andi\n case 0b001101: regs[d.rt] = regs[d.rs] | d.signedExtImm; break; \/\/ ori\n case 0b001110: regs[d.rt] = regs[d.rs] ^ d.signedExtImm; break; \/\/ xori\n case 0b001111: regs[d.rt] = d.signedExtImm << 16; break; \/\/ lui\n case 0b100011: regs[d.rt] = bus->at(regs[d.rs] + d.signedExtImm)->get(); break; \/\/ lw\n case 0b101011: bus->at(regs[d.rs] + d.signedExtImm)->set(regs[d.rt]); break; \/\/ sw\n case 0b000100: if (regs[d.rs] == regs[d.rt]) pc += d.signedExtImm; break; \/\/ beq\n case 0b000101: if (regs[d.rt] != regs[d.rs]) pc += d.signedExtImm; break; \/\/ bne\n case 0b001010: regs[d.rt] = regs[d.rs] < d.signedExtImm ? 1 : 0; break; \/\/ slti\n case 0b001011: regs[d.rt] = regs[d.rs] < d.signedExtImm ? 1 : 0; break; \/\/ sltiu\n \/\/ J-type instruction\n case 0b000010: pc = d.address; break; \/\/ j\n case 0b000011: regs[31] = pc; pc = d.address; break; \/\/ jal\n }\n\n \/\/dump();\n \/\/cout << \"0x\" << setfill('0') << setw(8) << hex << ((pc >> 2) - 1) << endl << endl;\n}\n\nvoid Processor::dump() const {\n const static string regNames[] = {\n \"zero\", \"at\",\n \"v0\", \"v1\", \"a0\", \"a1\", \"a2\", \"a3\",\n \"t0\", \"t1\", \"t2\", \"t3\", \"t4\", \"t5\", \"t6\", \"t7\",\n \"s0\", \"s1\", \"s2\", \"s3\", \"s4\", \"s5\", \"s6\", \"s7\",\n \"t8\", \"t9\",\n \"k0\", \"k1\",\n \"gp\", \"sp\", \"fp\", \"ra\"\n };\n\n for (int i = 0; i < 32; ++i) {\n cout << regNames[i] << \": \" << \"0x\" << setfill('0') << setw(8) << hex << regs[i] << \"\\t\";\n if (((i + 1) % 8) == 0)\n cout << endl;\n }\n}\n<commit_msg>fix: shift shamt instead of regs[shamt]<commit_after>#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <thread>\n\n#include \"Processor.hpp\"\n\nusing namespace std;\n\nconst uint32_t Processor::interruptHandlerAddress = 0x00010000;\n\nvoid Processor::handleInterruption() {\n if (cp0->interruptable() && cp0->interrupting()) {\n \/\/ save current PC to EPC\n cp0->regs[14] = pc;\n \/\/ set PC to interrupt handler address\n pc = interruptHandlerAddress;\n \/\/ disable interrupt from the same device\n cp0->disableInterruptForCode(cp0->interruptingBusCode());\n }\n}\n\nvoid Processor::tick() {\n d.deAsm(bus->at(pc >> 2)->get());\n pc += 4;\n handleInterruption();\n\n switch(d.opcode) {\n case 0b000000:\n \/\/ R-type instruction\n switch(d.func) {\n case 0b100000: regs[d.rd] = regs[d.rs] + regs[d.rt]; break; \/\/ add\n case 0b100001: regs[d.rd] = regs[d.rs] + regs[d.rt]; break; \/\/ addu\n case 0b100010: regs[d.rd] = regs[d.rs] - regs[d.rt]; break; \/\/ sub\n case 0b100011: regs[d.rd] = regs[d.rs] - regs[d.rt]; break; \/\/ subu\n case 0b100100: regs[d.rd] = regs[d.rs] & regs[d.rt]; break; \/\/ and\n case 0b100101: regs[d.rd] = regs[d.rs] | regs[d.rt]; break; \/\/ or\n case 0b100110: regs[d.rd] = regs[d.rs] ^ regs[d.rt]; break; \/\/ xor\n case 0b100111: regs[d.rd] = ~(regs[d.rs] | regs[d.rt]); break; \/\/ nor\n case 0b101010: \n regs[d.rd] = (int32_t)(regs[d.rs] - regs[d.rt]) < 0 ? 1 : 0; break; \/\/ slt\n case 0b101011:\n regs[d.rd] = (int32_t)(regs[d.rs] - regs[d.rt]) < 0 ? 1 : 0; break; \/\/ sltu\n case 0b000000: regs[d.rd] = regs[d.rt] << d.shamt; break; \/\/ sll\n case 0b000010: regs[d.rd] = regs[d.rt] >> d.shamt; break; \/\/ srl\n case 0b000011:\n regs[d.rd] = (uint32_t)((int32_t)regs[d.rs] >> regs[d.rt]); \/\/ sra\n break; \n case 0b000100: regs[d.rd] = regs[d.rt] << regs[d.rs]; break; \/\/ sllv\n case 0b000110: regs[d.rd] = regs[d.rt] >> regs[d.rs]; break; \/\/ srlv\n case 0b000111:\n regs[d.rd] = (uint32_t)((int32_t)regs[d.rt] >> regs[d.rs]); \/\/ srav\n break;\n case 0b001000: pc = regs[d.rs]; break; \/\/ jr\n }\n break;\n \/\/ I-type instruction\n case 0b001000: regs[d.rt] = regs[d.rs] + d.signedExtImm; break; \/\/ addi\n case 0b001001: regs[d.rt] = regs[d.rs] + d.signedExtImm; break; \/\/ addiu\n case 0b001100: regs[d.rt] = regs[d.rs] & d.signedExtImm; break; \/\/ andi\n case 0b001101: regs[d.rt] = regs[d.rs] | d.signedExtImm; break; \/\/ ori\n case 0b001110: regs[d.rt] = regs[d.rs] ^ d.signedExtImm; break; \/\/ xori\n case 0b001111: regs[d.rt] = d.signedExtImm << 16; break; \/\/ lui\n case 0b100011: regs[d.rt] = bus->at(regs[d.rs] + d.signedExtImm)->get(); break; \/\/ lw\n case 0b101011: bus->at(regs[d.rs] + d.signedExtImm)->set(regs[d.rt]); break; \/\/ sw\n case 0b000100: if (regs[d.rs] == regs[d.rt]) pc += d.signedExtImm; break; \/\/ beq\n case 0b000101: if (regs[d.rt] != regs[d.rs]) pc += d.signedExtImm; break; \/\/ bne\n case 0b001010: regs[d.rt] = regs[d.rs] < d.signedExtImm ? 1 : 0; break; \/\/ slti\n case 0b001011: regs[d.rt] = regs[d.rs] < d.signedExtImm ? 1 : 0; break; \/\/ sltiu\n \/\/ J-type instruction\n case 0b000010: pc = d.address; break; \/\/ j\n case 0b000011: regs[31] = pc; pc = d.address; break; \/\/ jal\n }\n\n if (debug) {\n dump();\n cout << \"PC: 0x\" << setfill('0') << setw(8) << hex << ((pc >> 2) - 1) << endl << endl;\n }\n}\n\nvoid Processor::dump() const {\n const static string regNames[] = {\n \"zero\", \"at\",\n \"v0\", \"v1\", \"a0\", \"a1\", \"a2\", \"a3\",\n \"t0\", \"t1\", \"t2\", \"t3\", \"t4\", \"t5\", \"t6\", \"t7\",\n \"s0\", \"s1\", \"s2\", \"s3\", \"s4\", \"s5\", \"s6\", \"s7\",\n \"t8\", \"t9\",\n \"k0\", \"k1\",\n \"gp\", \"sp\", \"fp\", \"ra\"\n };\n\n for (int i = 0; i < 32; ++i) {\n cout << regNames[i] << \": \" << \"0x\" << setfill('0') << setw(8) << hex << regs[i] << \"\\t\";\n if (((i + 1) % 8) == 0)\n cout << endl;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file RunStyles.cxx\n ** Data structure used to store sparse styles.\n **\/\n\/\/ Copyright 1998-2007 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdarg.h>\n\n#include <stdexcept>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n#include \"SplitVector.h\"\n#include \"Partitioning.h\"\n#include \"RunStyles.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\n\/\/ Find the first run at a position\nint RunStyles::RunFromPosition(int position) const {\n\tint run = starts->PartitionFromPosition(position);\n\t\/\/ Go to first element with this position\n\twhile ((run > 0) && (position == starts->PositionFromPartition(run-1))) {\n\t\trun--;\n\t}\n\treturn run;\n}\n\n\/\/ If there is no run boundary at position, insert one continuing style.\nint RunStyles::SplitRun(int position) {\n\tint run = RunFromPosition(position);\n\tint posRun = starts->PositionFromPartition(run);\n\tif (posRun < position) {\n\t\tint runStyle = ValueAt(position);\n\t\trun++;\n\t\tstarts->InsertPartition(run, position);\n\t\tstyles->InsertValue(run, 1, runStyle);\n\t}\n\treturn run;\n}\n\nvoid RunStyles::RemoveRun(int run) {\n\tstarts->RemovePartition(run);\n\tstyles->DeleteRange(run, 1);\n}\n\nvoid RunStyles::RemoveRunIfEmpty(int run) {\n\tif ((run < starts->Partitions()) && (starts->Partitions() > 1)) {\n\t\tif (starts->PositionFromPartition(run) == starts->PositionFromPartition(run+1)) {\n\t\t\tRemoveRun(run);\n\t\t}\n\t}\n}\n\nvoid RunStyles::RemoveRunIfSameAsPrevious(int run) {\n\tif ((run > 0) && (run < starts->Partitions())) {\n\t\tif (styles->ValueAt(run-1) == styles->ValueAt(run)) {\n\t\t\tRemoveRun(run);\n\t\t}\n\t}\n}\n\nRunStyles::RunStyles() {\n\tstarts = new Partitioning(8);\n\tstyles = new SplitVector<int>();\n\tstyles->InsertValue(0, 2, 0);\n}\n\nRunStyles::~RunStyles() {\n\tdelete starts;\n\tstarts = NULL;\n\tdelete styles;\n\tstyles = NULL;\n}\n\nint RunStyles::Length() const {\n\treturn starts->PositionFromPartition(starts->Partitions());\n}\n\nint RunStyles::ValueAt(int position) const {\n\treturn styles->ValueAt(starts->PartitionFromPosition(position));\n}\n\nint RunStyles::FindNextChange(int position, int end) {\n\tint run = starts->PartitionFromPosition(position);\n\tif (run < starts->Partitions()) {\n\t\tint runChange = starts->PositionFromPartition(run);\n\t\tif (runChange > position)\n\t\t\treturn runChange;\n\t\tint nextChange = starts->PositionFromPartition(run + 1);\n\t\tif (nextChange > position) {\n\t\t\treturn nextChange;\n\t\t} else if (position < end) {\n\t\t\treturn end;\n\t\t} else {\n\t\t\treturn end + 1;\n\t\t}\n\t} else {\n\t\treturn end + 1;\n\t}\n}\n\nint RunStyles::StartRun(int position) {\n\treturn starts->PositionFromPartition(starts->PartitionFromPosition(position));\n}\n\nint RunStyles::EndRun(int position) {\n\treturn starts->PositionFromPartition(starts->PartitionFromPosition(position) + 1);\n}\n\nbool RunStyles::FillRange(int &position, int value, int &fillLength) {\n\tif (fillLength <= 0) {\n\t\tthrow std::invalid_argument(\"RunStyles::FillRange <= 0 length.\");\n\t}\n\tint end = position + fillLength;\n\tif (end > Length()) {\n\t\tthrow std::invalid_argument(\"RunStyles::FillRange length goes past end.\");\n\t}\n\tint runEnd = RunFromPosition(end);\n\tif (styles->ValueAt(runEnd) == value) {\n\t\t\/\/ End already has value so trim range.\n\t\tend = starts->PositionFromPartition(runEnd);\n\t\tif (position >= end) {\n\t\t\t\/\/ Whole range is already same as value so no action\n\t\t\treturn false;\n\t\t}\n\t\tfillLength = end - position;\n\t} else {\n\t\trunEnd = SplitRun(end);\n\t}\n\tint runStart = RunFromPosition(position);\n\tif (styles->ValueAt(runStart) == value) {\n\t\t\/\/ Start is in expected value so trim range.\n\t\trunStart++;\n\t\tposition = starts->PositionFromPartition(runStart);\n\t\tfillLength = end - position;\n\t} else {\n\t\tif (starts->PositionFromPartition(runStart) < position) {\n\t\t\trunStart = SplitRun(position);\n\t\t\trunEnd++;\n\t\t}\n\t}\n\tif (runStart < runEnd) {\n\t\tstyles->SetValueAt(runStart, value);\n\t\t\/\/ Remove each old run over the range\n\t\tfor (int run=runStart+1; run<runEnd; run++) {\n\t\t\tRemoveRun(runStart+1);\n\t\t}\n\t\trunEnd = RunFromPosition(end);\n\t\tRemoveRunIfSameAsPrevious(runEnd);\n\t\tRemoveRunIfSameAsPrevious(runStart);\n\t\trunEnd = RunFromPosition(end);\n\t\tRemoveRunIfEmpty(runEnd);\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid RunStyles::SetValueAt(int position, int value) {\n\tint len = 1;\n\tFillRange(position, value, len);\n}\n\nvoid RunStyles::InsertSpace(int position, int insertLength) {\n\tint runStart = RunFromPosition(position);\n\tif (starts->PositionFromPartition(runStart) == position) {\n\t\tint runStyle = ValueAt(position);\n\t\t\/\/ Inserting at start of run so make previous longer\n\t\tif (runStart == 0) {\n\t\t\t\/\/ Inserting at start of document so ensure 0\n\t\t\tif (runStyle) {\n\t\t\t\tstyles->SetValueAt(0, 0);\n\t\t\t\tstarts->InsertPartition(1, 0);\n\t\t\t\tstyles->InsertValue(1, 1, runStyle);\n\t\t\t\tstarts->InsertText(0, insertLength);\n\t\t\t} else {\n\t\t\t\tstarts->InsertText(runStart, insertLength);\n\t\t\t}\n\t\t} else {\n\t\t\tif (runStyle) {\n\t\t\t\tstarts->InsertText(runStart-1, insertLength);\n\t\t\t} else {\n\t\t\t\t\/\/ Insert at end of run so do not extend style\n\t\t\t\tstarts->InsertText(runStart, insertLength);\n\t\t\t}\n\t\t}\n\t} else {\n\t\tstarts->InsertText(runStart, insertLength);\n\t}\n}\n\nvoid RunStyles::DeleteAll() {\n\tdelete starts;\n\tstarts = NULL;\n\tdelete styles;\n\tstyles = NULL;\n\tstarts = new Partitioning(8);\n\tstyles = new SplitVector<int>();\n\tstyles->InsertValue(0, 2, 0);\n}\n\nvoid RunStyles::DeleteRange(int position, int deleteLength) {\n\tint end = position + deleteLength;\n\tint runStart = RunFromPosition(position);\n\tint runEnd = RunFromPosition(end);\n\tif (runStart == runEnd) {\n\t\t\/\/ Deleting from inside one run\n\t\tstarts->InsertText(runStart, -deleteLength);\n\t\tRemoveRunIfEmpty(runStart);\n\t} else {\n\t\trunStart = SplitRun(position);\n\t\trunEnd = SplitRun(end);\n\t\tstarts->InsertText(runStart, -deleteLength);\n\t\t\/\/ Remove each old run over the range\n\t\tfor (int run=runStart; run<runEnd; run++) {\n\t\t\tRemoveRun(runStart);\n\t\t}\n\t\tRemoveRunIfEmpty(runStart);\n\t\tRemoveRunIfSameAsPrevious(runStart);\n\t}\n}\n\nint RunStyles::Runs() const {\n\treturn starts->Partitions();\n}\n\nbool RunStyles::AllSame() const {\n\tfor (int run = 1; run < starts->Partitions(); run++) {\n\t\tif (styles->ValueAt(run) != styles->ValueAt(run - 1))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nbool RunStyles::AllSameAs(int value) const {\n\treturn AllSame() && (styles->ValueAt(0) == value);\n}\n\nint RunStyles::Find(int value, int start) const {\n\tif (start < Length()) {\n\t\tint run = start ? RunFromPosition(start) : 0;\n\t\tif (styles->ValueAt(run) == value)\n\t\t\treturn start;\n\t\trun++;\n\t\twhile (run < starts->Partitions()) {\n\t\t\tif (styles->ValueAt(run) == value)\n\t\t\t\treturn starts->PositionFromPartition(run);\n\t\t\trun++;\n\t\t}\n\t}\n\treturn -1;\n}\n\nvoid RunStyles::Check() {\n\tif (Length() < 0) {\n\t\tthrow std::runtime_error(\"RunStyles: Length can not be negative.\");\n\t}\n\tif (starts->Partitions() < 1) {\n\t\tthrow std::runtime_error(\"RunStyles: Must always have 1 or more partitions.\");\n\t}\n\tif (starts->Partitions() != styles->Length()-1) {\n\t\tthrow std::runtime_error(\"RunStyles: Partitions and styles different lengths.\");\n\t}\n\tint start=0;\n\twhile (start < Length()) {\n\t\tint end = EndRun(start);\n\t\tif (start >= end) {\n\t\t\tthrow std::runtime_error(\"RunStyles: Partition is 0 length.\");\n\t\t}\n\t\tstart = end;\n\t}\n\tif (styles->ValueAt(styles->Length()-1) != 0) {\n\t\tthrow std::runtime_error(\"RunStyles: Unused style at end changed.\");\n\t}\n\tfor (int j=1; j<styles->Length()-1; j++) {\n\t\tif (styles->ValueAt(j) == styles->ValueAt(j-1)) {\n\t\t\tthrow std::runtime_error(\"RunStyles: Style of a partition same as previous.\");\n\t\t}\n\t}\n}\n<commit_msg>Existing code fills 0 length ranges and ranges after document end so simply return instead of throwing exceptions.<commit_after>\/** @file RunStyles.cxx\n ** Data structure used to store sparse styles.\n **\/\n\/\/ Copyright 1998-2007 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdarg.h>\n\n#include <stdexcept>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n#include \"SplitVector.h\"\n#include \"Partitioning.h\"\n#include \"RunStyles.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\n\/\/ Find the first run at a position\nint RunStyles::RunFromPosition(int position) const {\n\tint run = starts->PartitionFromPosition(position);\n\t\/\/ Go to first element with this position\n\twhile ((run > 0) && (position == starts->PositionFromPartition(run-1))) {\n\t\trun--;\n\t}\n\treturn run;\n}\n\n\/\/ If there is no run boundary at position, insert one continuing style.\nint RunStyles::SplitRun(int position) {\n\tint run = RunFromPosition(position);\n\tint posRun = starts->PositionFromPartition(run);\n\tif (posRun < position) {\n\t\tint runStyle = ValueAt(position);\n\t\trun++;\n\t\tstarts->InsertPartition(run, position);\n\t\tstyles->InsertValue(run, 1, runStyle);\n\t}\n\treturn run;\n}\n\nvoid RunStyles::RemoveRun(int run) {\n\tstarts->RemovePartition(run);\n\tstyles->DeleteRange(run, 1);\n}\n\nvoid RunStyles::RemoveRunIfEmpty(int run) {\n\tif ((run < starts->Partitions()) && (starts->Partitions() > 1)) {\n\t\tif (starts->PositionFromPartition(run) == starts->PositionFromPartition(run+1)) {\n\t\t\tRemoveRun(run);\n\t\t}\n\t}\n}\n\nvoid RunStyles::RemoveRunIfSameAsPrevious(int run) {\n\tif ((run > 0) && (run < starts->Partitions())) {\n\t\tif (styles->ValueAt(run-1) == styles->ValueAt(run)) {\n\t\t\tRemoveRun(run);\n\t\t}\n\t}\n}\n\nRunStyles::RunStyles() {\n\tstarts = new Partitioning(8);\n\tstyles = new SplitVector<int>();\n\tstyles->InsertValue(0, 2, 0);\n}\n\nRunStyles::~RunStyles() {\n\tdelete starts;\n\tstarts = NULL;\n\tdelete styles;\n\tstyles = NULL;\n}\n\nint RunStyles::Length() const {\n\treturn starts->PositionFromPartition(starts->Partitions());\n}\n\nint RunStyles::ValueAt(int position) const {\n\treturn styles->ValueAt(starts->PartitionFromPosition(position));\n}\n\nint RunStyles::FindNextChange(int position, int end) {\n\tint run = starts->PartitionFromPosition(position);\n\tif (run < starts->Partitions()) {\n\t\tint runChange = starts->PositionFromPartition(run);\n\t\tif (runChange > position)\n\t\t\treturn runChange;\n\t\tint nextChange = starts->PositionFromPartition(run + 1);\n\t\tif (nextChange > position) {\n\t\t\treturn nextChange;\n\t\t} else if (position < end) {\n\t\t\treturn end;\n\t\t} else {\n\t\t\treturn end + 1;\n\t\t}\n\t} else {\n\t\treturn end + 1;\n\t}\n}\n\nint RunStyles::StartRun(int position) {\n\treturn starts->PositionFromPartition(starts->PartitionFromPosition(position));\n}\n\nint RunStyles::EndRun(int position) {\n\treturn starts->PositionFromPartition(starts->PartitionFromPosition(position) + 1);\n}\n\nbool RunStyles::FillRange(int &position, int value, int &fillLength) {\n\tif (fillLength <= 0) {\n\t\treturn false;\n\t}\n\tint end = position + fillLength;\n\tif (end > Length()) {\n\t\treturn false;\n\t}\n\tint runEnd = RunFromPosition(end);\n\tif (styles->ValueAt(runEnd) == value) {\n\t\t\/\/ End already has value so trim range.\n\t\tend = starts->PositionFromPartition(runEnd);\n\t\tif (position >= end) {\n\t\t\t\/\/ Whole range is already same as value so no action\n\t\t\treturn false;\n\t\t}\n\t\tfillLength = end - position;\n\t} else {\n\t\trunEnd = SplitRun(end);\n\t}\n\tint runStart = RunFromPosition(position);\n\tif (styles->ValueAt(runStart) == value) {\n\t\t\/\/ Start is in expected value so trim range.\n\t\trunStart++;\n\t\tposition = starts->PositionFromPartition(runStart);\n\t\tfillLength = end - position;\n\t} else {\n\t\tif (starts->PositionFromPartition(runStart) < position) {\n\t\t\trunStart = SplitRun(position);\n\t\t\trunEnd++;\n\t\t}\n\t}\n\tif (runStart < runEnd) {\n\t\tstyles->SetValueAt(runStart, value);\n\t\t\/\/ Remove each old run over the range\n\t\tfor (int run=runStart+1; run<runEnd; run++) {\n\t\t\tRemoveRun(runStart+1);\n\t\t}\n\t\trunEnd = RunFromPosition(end);\n\t\tRemoveRunIfSameAsPrevious(runEnd);\n\t\tRemoveRunIfSameAsPrevious(runStart);\n\t\trunEnd = RunFromPosition(end);\n\t\tRemoveRunIfEmpty(runEnd);\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\nvoid RunStyles::SetValueAt(int position, int value) {\n\tint len = 1;\n\tFillRange(position, value, len);\n}\n\nvoid RunStyles::InsertSpace(int position, int insertLength) {\n\tint runStart = RunFromPosition(position);\n\tif (starts->PositionFromPartition(runStart) == position) {\n\t\tint runStyle = ValueAt(position);\n\t\t\/\/ Inserting at start of run so make previous longer\n\t\tif (runStart == 0) {\n\t\t\t\/\/ Inserting at start of document so ensure 0\n\t\t\tif (runStyle) {\n\t\t\t\tstyles->SetValueAt(0, 0);\n\t\t\t\tstarts->InsertPartition(1, 0);\n\t\t\t\tstyles->InsertValue(1, 1, runStyle);\n\t\t\t\tstarts->InsertText(0, insertLength);\n\t\t\t} else {\n\t\t\t\tstarts->InsertText(runStart, insertLength);\n\t\t\t}\n\t\t} else {\n\t\t\tif (runStyle) {\n\t\t\t\tstarts->InsertText(runStart-1, insertLength);\n\t\t\t} else {\n\t\t\t\t\/\/ Insert at end of run so do not extend style\n\t\t\t\tstarts->InsertText(runStart, insertLength);\n\t\t\t}\n\t\t}\n\t} else {\n\t\tstarts->InsertText(runStart, insertLength);\n\t}\n}\n\nvoid RunStyles::DeleteAll() {\n\tdelete starts;\n\tstarts = NULL;\n\tdelete styles;\n\tstyles = NULL;\n\tstarts = new Partitioning(8);\n\tstyles = new SplitVector<int>();\n\tstyles->InsertValue(0, 2, 0);\n}\n\nvoid RunStyles::DeleteRange(int position, int deleteLength) {\n\tint end = position + deleteLength;\n\tint runStart = RunFromPosition(position);\n\tint runEnd = RunFromPosition(end);\n\tif (runStart == runEnd) {\n\t\t\/\/ Deleting from inside one run\n\t\tstarts->InsertText(runStart, -deleteLength);\n\t\tRemoveRunIfEmpty(runStart);\n\t} else {\n\t\trunStart = SplitRun(position);\n\t\trunEnd = SplitRun(end);\n\t\tstarts->InsertText(runStart, -deleteLength);\n\t\t\/\/ Remove each old run over the range\n\t\tfor (int run=runStart; run<runEnd; run++) {\n\t\t\tRemoveRun(runStart);\n\t\t}\n\t\tRemoveRunIfEmpty(runStart);\n\t\tRemoveRunIfSameAsPrevious(runStart);\n\t}\n}\n\nint RunStyles::Runs() const {\n\treturn starts->Partitions();\n}\n\nbool RunStyles::AllSame() const {\n\tfor (int run = 1; run < starts->Partitions(); run++) {\n\t\tif (styles->ValueAt(run) != styles->ValueAt(run - 1))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\nbool RunStyles::AllSameAs(int value) const {\n\treturn AllSame() && (styles->ValueAt(0) == value);\n}\n\nint RunStyles::Find(int value, int start) const {\n\tif (start < Length()) {\n\t\tint run = start ? RunFromPosition(start) : 0;\n\t\tif (styles->ValueAt(run) == value)\n\t\t\treturn start;\n\t\trun++;\n\t\twhile (run < starts->Partitions()) {\n\t\t\tif (styles->ValueAt(run) == value)\n\t\t\t\treturn starts->PositionFromPartition(run);\n\t\t\trun++;\n\t\t}\n\t}\n\treturn -1;\n}\n\nvoid RunStyles::Check() {\n\tif (Length() < 0) {\n\t\tthrow std::runtime_error(\"RunStyles: Length can not be negative.\");\n\t}\n\tif (starts->Partitions() < 1) {\n\t\tthrow std::runtime_error(\"RunStyles: Must always have 1 or more partitions.\");\n\t}\n\tif (starts->Partitions() != styles->Length()-1) {\n\t\tthrow std::runtime_error(\"RunStyles: Partitions and styles different lengths.\");\n\t}\n\tint start=0;\n\twhile (start < Length()) {\n\t\tint end = EndRun(start);\n\t\tif (start >= end) {\n\t\t\tthrow std::runtime_error(\"RunStyles: Partition is 0 length.\");\n\t\t}\n\t\tstart = end;\n\t}\n\tif (styles->ValueAt(styles->Length()-1) != 0) {\n\t\tthrow std::runtime_error(\"RunStyles: Unused style at end changed.\");\n\t}\n\tfor (int j=1; j<styles->Length()-1; j++) {\n\t\tif (styles->ValueAt(j) == styles->ValueAt(j-1)) {\n\t\t\tthrow std::runtime_error(\"RunStyles: Style of a partition same as previous.\");\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <assert.h>\n#include <iostream>\n#include <stack>\n#include <string>\n#include <sys\/time.h>\n\n#include \"ast.h\"\n#include \"cell.h\"\n#include \"number.h\"\n\ntypedef void (*Thunk)(std::stack<Variant> &stack, void *func);\n\nstatic std::map<std::string, std::pair<Thunk, void *> > Functions;\n\nnamespace rtl {\n\nNumber abs(Number x)\n{\n return number_abs(x);\n}\n\nstd::string chr(Number x)\n{\n assert(number_is_integer(x));\n return std::string(1, static_cast<char>(number_to_uint32(x)));\n}\n\nstd::string concat(const std::string &a, const std::string &b)\n{\n return a + b;\n}\n\nstd::string input(const std::string &prompt)\n{\n std::cout << prompt;\n std::string r;\n std::getline(std::cin, r);\n return r;\n}\n\nNumber max(Number a, Number b)\n{\n if (number_is_greater(a, b)) {\n return a;\n } else {\n return b;\n }\n}\n\nNumber min(Number a, Number b)\n{\n if (number_is_less(a, b)) {\n return a;\n } else {\n return b;\n }\n}\n\nNumber num(const std::string &s)\n{\n return number_from_string(s.c_str());\n}\n\nNumber ord(const std::string &s)\n{\n assert(s.length() == 1);\n return number_from_uint32(s.at(0));\n}\n\nvoid print(const std::string &s)\n{\n std::cout << s << \"\\n\";\n}\n\nstd::string splice(const std::string &t, const std::string &s, Number offset, Number length)\n{\n uint32_t o = number_to_uint32(offset);\n return s.substr(0, o) + t + s.substr(o + number_to_uint32(length));\n}\n\nstd::string str(Number x)\n{\n return number_to_string(x);\n}\n\nstd::string strb(bool x)\n{\n return x ? \"TRUE\" : \"FALSE\";\n}\n\nstd::string substring(const std::string &s, Number offset, Number length)\n{\n assert(number_is_integer(offset));\n assert(number_is_integer(length));\n return s.substr(number_to_uint32(offset), number_to_uint32(length));\n}\n\nNumber math$acos(Number x)\n{\n return number_acos(x);\n}\n\nNumber math$asin(Number x)\n{\n return number_asin(x);\n}\n\nNumber math$atan(Number x)\n{\n return number_atan(x);\n}\n\nNumber math$ceil(Number x)\n{\n return number_ceil(x);\n}\n\nNumber math$cos(Number x)\n{\n return number_cos(x);\n}\n\nNumber math$exp(Number x)\n{\n return number_exp(x);\n}\n\nNumber math$floor(Number x)\n{\n return number_floor(x);\n}\n\nNumber math$log(Number x)\n{\n return number_log(x);\n}\n\nNumber math$sin(Number x)\n{\n return number_sin(x);\n}\n\nNumber math$sqrt(Number x)\n{\n return number_sqrt(x);\n}\n\nNumber math$tan(Number x)\n{\n return number_tan(x);\n}\n\nNumber time$now()\n{\n struct timeval tv;\n if (gettimeofday(&tv, NULL) != 0) {\n return number_from_uint32(0);\n }\n return number_add(number_from_uint32(tv.tv_sec), number_divide(number_from_uint32(tv.tv_usec), number_from_uint32(1e6)));\n}\n\n} \/\/ namespace rtl\n\n#include \"thunks.inc\"\n#include \"functions.inc\"\n\nvoid rtl_init(Scope *scope)\n{\n for (auto f: BuiltinFunctions) {\n std::vector<const ParameterType *> params;\n for (auto p: f.params) {\n if (p == nullptr) {\n break;\n }\n params.push_back(new ParameterType(ParameterType::IN, p));\n }\n scope->names[f.name] = new PredefinedFunction(f.name, new TypeFunction(f.returntype, params));\n Functions[f.name] = std::make_pair(f.thunk, f.func);\n }\n}\n\nvoid rtl_import(Scope *scope, const std::string &name)\n{\n std::string prefix = name + \"$\";\n Module *module = new Module(scope, name);\n for (auto f: BuiltinFunctions) {\n std::string qualified_name(f.name);\n if (qualified_name.substr(0, prefix.length()) == prefix) {\n std::vector<const ParameterType *> params;\n for (auto p: f.params) {\n if (p == nullptr) {\n break;\n }\n params.push_back(new ParameterType(ParameterType::IN, p));\n }\n module->scope->names[qualified_name.substr(prefix.length())] = new PredefinedFunction(f.name, new TypeFunction(f.returntype, params));\n }\n }\n scope->names[name] = module;\n}\n\nvoid rtl_call(std::stack<Variant> &stack, const std::string &name)\n{\n auto f = Functions.find(name);\n if (f == Functions.end()) {\n fprintf(stderr, \"simple: function not found: %s\\n\", name.c_str());\n abort();\n }\n f->second.first(stack, f->second.second);\n}\n<commit_msg>remove .c_str() redundancy<commit_after>#include <assert.h>\n#include <iostream>\n#include <stack>\n#include <string>\n#include <sys\/time.h>\n\n#include \"ast.h\"\n#include \"cell.h\"\n#include \"number.h\"\n\ntypedef void (*Thunk)(std::stack<Variant> &stack, void *func);\n\nstatic std::map<std::string, std::pair<Thunk, void *> > Functions;\n\nnamespace rtl {\n\nNumber abs(Number x)\n{\n return number_abs(x);\n}\n\nstd::string chr(Number x)\n{\n assert(number_is_integer(x));\n return std::string(1, static_cast<char>(number_to_uint32(x)));\n}\n\nstd::string concat(const std::string &a, const std::string &b)\n{\n return a + b;\n}\n\nstd::string input(const std::string &prompt)\n{\n std::cout << prompt;\n std::string r;\n std::getline(std::cin, r);\n return r;\n}\n\nNumber max(Number a, Number b)\n{\n if (number_is_greater(a, b)) {\n return a;\n } else {\n return b;\n }\n}\n\nNumber min(Number a, Number b)\n{\n if (number_is_less(a, b)) {\n return a;\n } else {\n return b;\n }\n}\n\nNumber num(const std::string &s)\n{\n return number_from_string(s);\n}\n\nNumber ord(const std::string &s)\n{\n assert(s.length() == 1);\n return number_from_uint32(s.at(0));\n}\n\nvoid print(const std::string &s)\n{\n std::cout << s << \"\\n\";\n}\n\nstd::string splice(const std::string &t, const std::string &s, Number offset, Number length)\n{\n uint32_t o = number_to_uint32(offset);\n return s.substr(0, o) + t + s.substr(o + number_to_uint32(length));\n}\n\nstd::string str(Number x)\n{\n return number_to_string(x);\n}\n\nstd::string strb(bool x)\n{\n return x ? \"TRUE\" : \"FALSE\";\n}\n\nstd::string substring(const std::string &s, Number offset, Number length)\n{\n assert(number_is_integer(offset));\n assert(number_is_integer(length));\n return s.substr(number_to_uint32(offset), number_to_uint32(length));\n}\n\nNumber math$acos(Number x)\n{\n return number_acos(x);\n}\n\nNumber math$asin(Number x)\n{\n return number_asin(x);\n}\n\nNumber math$atan(Number x)\n{\n return number_atan(x);\n}\n\nNumber math$ceil(Number x)\n{\n return number_ceil(x);\n}\n\nNumber math$cos(Number x)\n{\n return number_cos(x);\n}\n\nNumber math$exp(Number x)\n{\n return number_exp(x);\n}\n\nNumber math$floor(Number x)\n{\n return number_floor(x);\n}\n\nNumber math$log(Number x)\n{\n return number_log(x);\n}\n\nNumber math$sin(Number x)\n{\n return number_sin(x);\n}\n\nNumber math$sqrt(Number x)\n{\n return number_sqrt(x);\n}\n\nNumber math$tan(Number x)\n{\n return number_tan(x);\n}\n\nNumber time$now()\n{\n struct timeval tv;\n if (gettimeofday(&tv, NULL) != 0) {\n return number_from_uint32(0);\n }\n return number_add(number_from_uint32(tv.tv_sec), number_divide(number_from_uint32(tv.tv_usec), number_from_uint32(1e6)));\n}\n\n} \/\/ namespace rtl\n\n#include \"thunks.inc\"\n#include \"functions.inc\"\n\nvoid rtl_init(Scope *scope)\n{\n for (auto f: BuiltinFunctions) {\n std::vector<const ParameterType *> params;\n for (auto p: f.params) {\n if (p == nullptr) {\n break;\n }\n params.push_back(new ParameterType(ParameterType::IN, p));\n }\n scope->names[f.name] = new PredefinedFunction(f.name, new TypeFunction(f.returntype, params));\n Functions[f.name] = std::make_pair(f.thunk, f.func);\n }\n}\n\nvoid rtl_import(Scope *scope, const std::string &name)\n{\n std::string prefix = name + \"$\";\n Module *module = new Module(scope, name);\n for (auto f: BuiltinFunctions) {\n std::string qualified_name(f.name);\n if (qualified_name.substr(0, prefix.length()) == prefix) {\n std::vector<const ParameterType *> params;\n for (auto p: f.params) {\n if (p == nullptr) {\n break;\n }\n params.push_back(new ParameterType(ParameterType::IN, p));\n }\n module->scope->names[qualified_name.substr(prefix.length())] = new PredefinedFunction(f.name, new TypeFunction(f.returntype, params));\n }\n }\n scope->names[name] = module;\n}\n\nvoid rtl_call(std::stack<Variant> &stack, const std::string &name)\n{\n auto f = Functions.find(name);\n if (f == Functions.end()) {\n fprintf(stderr, \"simple: function not found: %s\\n\", name.c_str());\n abort();\n }\n f->second.first(stack, f->second.second);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * project collectd_edit\n * ing. Carlo Capelli\n * Brescia 2015\n * Copyright 2015 Sputnik7\n *\/\n\n#include \"join.h\"\n#include \"settings.h\"\n#include \"ui_structure.h\"\n\n#include <gtkmmconfig.h>\n#include <fstream>\n\nsettings::settings() {\n auto path = store_path();\n struct stat buffer;\n if (stat(path.c_str(), &buffer) == 0) {\n Glib::KeyFile kf;\n kf.load_from_file(path);\n for (auto f: kf.get_string_list(\"servers\", \"name\"))\n servers[f] = server{\n f,\n kf.get_string(f, \"address\"),\n kf.get_string(f, \"alias\"),\n kf.get_string(f, \"folder\")\n };\n }\n if (servers.empty())\n initialize();\n}\n\nsettings::~settings() {\n std::vector<std::string> v;\n if (GTKMM_MAJOR_VERSION >= 3 || (GTKMM_MAJOR_VERSION == 3 && GTKMM_MINOR_VERSION >= 10)) {\n Glib::KeyFile kf;\n for (auto s: servers) {\n auto n = s.first;\n v.push_back(n);\n kf.set_string(n, \"address\", s.second.address);\n kf.set_string(n, \"alias\", s.second.alias);\n kf.set_string(n, \"folder\", s.second.folder);\n }\n kf.set_string_list(\"servers\", \"name\", v);\n kf.save_to_file(store_path());\n }\n else {\n \/\/ CentOS 7 have GTKMM_MINOR_VERSION == 8, missing save_to_file\n std::ofstream kf(store_path());\n for (auto s: servers) {\n auto n = s.first;\n kf << '[' << n << ']' << std::endl;\n v.push_back(n);\n kf << \"address\" << '=' << s.second.address << std::endl;\n kf << \"alias\" << '=' << s.second.alias << std::endl;\n kf << \"folder\" << '=' << s.second.folder << std::endl;\n }\n kf << '[' << join(v) << ']' << std::endl;\n }\n}\n\n\/**\n * @brief initialize\n * setup some defaults - assume localhost and collectd installed\n *\/\nvoid settings::initialize() {\n g_assert(servers.empty());\n servers[\"localhost\"] = server{\"localhost\", \"127.0.0.1\", \"computer\", \"\/etc\/collectd\"};\n}\n\nstd::string settings::store_path() const {\n return ui_structure::get_resource_path(\"settings\", \"ini\");\n}\n<commit_msg>version check x CentOS 7<commit_after>\/*\n * project collectd_edit\n * ing. Carlo Capelli\n * Brescia 2015\n * Copyright 2015 Sputnik7\n *\/\n\n#include \"join.h\"\n#include \"settings.h\"\n#include \"ui_structure.h\"\n\n#include <gtkmmconfig.h>\n#include <fstream>\n\nsettings::settings() {\n auto path = store_path();\n struct stat buffer;\n if (stat(path.c_str(), &buffer) == 0) {\n Glib::KeyFile kf;\n kf.load_from_file(path);\n for (auto f: kf.get_string_list(\"servers\", \"name\"))\n servers[f] = server{\n f,\n kf.get_string(f, \"address\"),\n kf.get_string(f, \"alias\"),\n kf.get_string(f, \"folder\")\n };\n }\n if (servers.empty())\n initialize();\n}\n\nsettings::~settings() {\n std::vector<std::string> v;\n if (GTKMM_MAJOR_VERSION >= 3 && GTKMM_MINOR_VERSION >= 10) {\n Glib::KeyFile kf;\n for (auto s: servers) {\n auto n = s.first;\n v.push_back(n);\n kf.set_string(n, \"address\", s.second.address);\n kf.set_string(n, \"alias\", s.second.alias);\n kf.set_string(n, \"folder\", s.second.folder);\n }\n kf.set_string_list(\"servers\", \"name\", v);\n kf.save_to_file(store_path());\n }\n else {\n \/\/ CentOS 7 have GTKMM_MINOR_VERSION == 8, missing save_to_file\n std::ofstream kf(store_path());\n for (auto s: servers) {\n auto n = s.first;\n kf << '[' << n << ']' << std::endl;\n v.push_back(n);\n kf << \"address\" << '=' << s.second.address << std::endl;\n kf << \"alias\" << '=' << s.second.alias << std::endl;\n kf << \"folder\" << '=' << s.second.folder << std::endl;\n }\n kf << '[' << join(v) << ']' << std::endl;\n }\n}\n\n\/**\n * @brief initialize\n * setup some defaults - assume localhost and collectd installed\n *\/\nvoid settings::initialize() {\n g_assert(servers.empty());\n servers[\"localhost\"] = server{\"localhost\", \"127.0.0.1\", \"computer\", \"\/etc\/collectd\"};\n}\n\nstd::string settings::store_path() const {\n return ui_structure::get_resource_path(\"settings\", \"ini\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ SlitClient.cc for fluxbox\n\/\/ Copyright (c) 2003 Henrik Kinnunen (fluxgen at users.sourceforge.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: SlitClient.cc,v 1.2 2003\/06\/22 12:30:59 fluxgen Exp $\n\n#include \"SlitClient.hh\"\n\n#include \"Screen.hh\"\n#include \"App.hh\"\n#include \"Xutil.hh\"\n\n#include <X11\/Xutil.h>\n#include <X11\/Xatom.h>\n\nSlitClient::SlitClient(BScreen *screen, Window win) {\n initialize(screen, win);\n}\n\nSlitClient::SlitClient(const char *name):m_match_name(name == 0 ? \"\" : name) { \n initialize();\n}\n\n\nvoid SlitClient::initialize(BScreen *screen, Window win) {\n \/\/ Now we pre-initialize a list of slit clients with names for\n \/\/ comparison with incoming client windows. This allows the slit\n \/\/ to maintain a sorted order based on a saved window name list.\n \/\/ Incoming windows not found in the list are appended. Matching\n \/\/ duplicates are inserted after the last found instance of the\n \/\/ matching name.\n\n m_client_window = win;\n m_window = m_icon_window = None;\n move(0, 0);\n resize(0, 0);\n\n if (matchName().empty())\n m_match_name = Xutil::getWMName(clientWindow());\n m_visible = true; \n}\n\nvoid SlitClient::disableEvents() {\n if (window() == 0)\n return;\n Display *disp = FbTk::App::instance()->display();\n XSelectInput(disp, window(), NoEventMask);\n}\n\nvoid SlitClient::enableEvents() {\n if (window() == 0)\n return;\n Display *disp = FbTk::App::instance()->display();\n XSelectInput(disp, window(), StructureNotifyMask |\n SubstructureNotifyMask | EnterWindowMask);\n}\n\nvoid SlitClient::hide() {\n XUnmapWindow(FbTk::App::instance()->display(), window());\n}\n\nvoid SlitClient::show() {\n XMapWindow(FbTk::App::instance()->display(), window());\n}\n<commit_msg>fix small oversight with slitlist fixes<commit_after>\/\/ SlitClient.cc for fluxbox\n\/\/ Copyright (c) 2003 Henrik Kinnunen (fluxgen at users.sourceforge.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: SlitClient.cc,v 1.3 2004\/01\/31 11:39:32 rathnor Exp $\n\n#include \"SlitClient.hh\"\n\n#include \"Screen.hh\"\n#include \"App.hh\"\n#include \"Xutil.hh\"\n\n#include <X11\/Xutil.h>\n#include <X11\/Xatom.h>\n\nSlitClient::SlitClient(BScreen *screen, Window win) {\n initialize(screen, win);\n}\n\nSlitClient::SlitClient(const char *name):m_match_name(name == 0 ? \"\" : name) { \n initialize();\n}\n\n\nvoid SlitClient::initialize(BScreen *screen, Window win) {\n \/\/ Now we pre-initialize a list of slit clients with names for\n \/\/ comparison with incoming client windows. This allows the slit\n \/\/ to maintain a sorted order based on a saved window name list.\n \/\/ Incoming windows not found in the list are appended. Matching\n \/\/ duplicates are inserted after the last found instance of the\n \/\/ matching name.\n\n m_client_window = win;\n m_window = m_icon_window = None;\n move(0, 0);\n resize(0, 0);\n\n if (matchName().empty())\n m_match_name = Xutil::getWMClassName(clientWindow());\n m_visible = true; \n}\n\nvoid SlitClient::disableEvents() {\n if (window() == 0)\n return;\n Display *disp = FbTk::App::instance()->display();\n XSelectInput(disp, window(), NoEventMask);\n}\n\nvoid SlitClient::enableEvents() {\n if (window() == 0)\n return;\n Display *disp = FbTk::App::instance()->display();\n XSelectInput(disp, window(), StructureNotifyMask |\n SubstructureNotifyMask | EnterWindowMask);\n}\n\nvoid SlitClient::hide() {\n XUnmapWindow(FbTk::App::instance()->display(), window());\n}\n\nvoid SlitClient::show() {\n XMapWindow(FbTk::App::instance()->display(), window());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ast.hpp\"\n\n#include <sstream>\n#include <iostream>\n\nextern \"C\" {\n#include <lua.h>\n#include <lualib.h>\n#include <lauxlib.h>\n}\n\nnamespace lua {\n\nstruct environment {\n lua_State* state;\n\n environment(): state(luaL_newstate()) {\n luaL_openlibs(state);\n\n const int error = luaL_dofile(state, find(\"prelude.lua\").c_str());\n check(error);\n }\n\n void check(int error) const {\n if(error) {\n std::string what = lua_tostring(state, -1);\n lua_pop(state, 1);\n throw std::runtime_error(what);\n }\n }\n \n\n std::string find(std::string filename) const {\n return SLIP_DIR + std::string(\"\/\") + filename;\n }\n \n void run(std::string code) {\n const int error = luaL_dostring(state, code.c_str());\n check(error);\n }\n \n ~environment() {\n lua_close(state);\n }\n};\n\n\nstd::shared_ptr<environment> make_environment() {\n return std::make_shared<environment>();\n}\n\nstruct ret;\nstruct def;\nstruct local;\nstruct call;\nstruct thunk;\nstruct cond;\n\nstruct var;\nstruct lit;\nstruct func;\nstruct table;\nstruct getattr;\n\nstruct term: variant<ret, local, def, call, cond> {\n using term::variant::variant;\n};\n\nstruct expr: variant<var, lit, call, func, thunk, table, getattr> {\n using expr::variant::variant;\n};\n\nstruct lit: variant<bool, long, double, std::string> {\n using lit::variant::variant;\n};\n\nstruct call {\n expr func;\n list<expr> args;\n};\n\nstruct func {\n list<symbol> args;\n list<term> body;\n};\n\nstruct thunk {\n list<term> body;\n};\n\nstruct ret {\n expr value;\n};\n\nstruct local {\n symbol name;\n};\n\nstruct var {\n symbol name;\n};\n\nstruct def {\n symbol name;\n expr value;\n};\n\nstruct cond {\n expr pred;\n list<term> conseq, alt; \n};\n\nstruct table {\n list<def> attrs;\n};\n\nstruct getattr {\n expr arg;\n symbol attr;\n};\n\n\nclass state {\n std::ostream& out;\n std::size_t indent = 0;\n\npublic:\n state(std::ostream& out): out(out) { }\n\n template<class T>\n state& operator<<(const T& value) {\n out << value;\n return *this;\n }\n\n state& newline() {\n (out << \"\\n\" << std::string(2 * indent, ' '));;\n return *this;\n }\n \n state& operator<<(std::ostream& (*func)(std::ostream&)) {\n out << func;\n return *this;\n }\n\n template<class Cont>\n void with_indent(Cont cont) {\n const std::size_t old = indent++;\n cont();\n indent = old;\n }\n \n};\n\n\nnamespace alt {\n\ntemplate<class T>\nstatic expr compile(T) {\n throw std::runtime_error(\"unimplemented\");\n}\n\nstatic expr compile(ast::expr self);\n\n\nstatic expr compile(ast::lit self) {\n return match(self, [](auto self) -> expr {\n return lit{self};\n });\n}\n\n\nstatic expr compile(ast::app self) {\n return call{compile(self.func), map(self.args, [](auto arg) {\n return compile(arg);\n })};\n}\n\nstatic expr compile(ast::abs self) {\n const term body = ret{compile(self.body)};\n return func{map(self.args, [](auto arg) {\n return arg.name;\n }), body %= list<term>() };\n}\n\nstatic expr compile(ast::var self) {\n return var{self.name};\n}\n\n\nstatic expr compile(ast::cond self) {\n const expr pred = compile(self.pred);\n const term conseq = ret{compile(self.conseq)};\n const term alt = ret{compile(self.alt)};\n \n const term body = cond{pred,\n conseq %= list<term>(),\n alt %= list<term>()};\n \n return thunk{body %= list<term>()};\n}\n\n\nstatic expr compile(ast::let self) {\n const list<term> decls = map(self.defs, [](ast::def self) -> term {\n return local{self.name};\n });\n\n const list<term> defs = map(self.defs, [](ast::def self) -> term {\n return def{self.name, compile(self.value)};\n });\n\n const term body = ret{compile(self.body)};\n \n return thunk{concat(concat(decls, defs),\n body %= list<term>())};\n}\n\n\nstatic expr compile(ast::record self) {\n return table{map(self.attrs, [](auto attr) {\n return def{attr.name, compile(attr.value)};\n })};\n}\n\nstatic expr compile(ast::attr self) {\n return getattr{compile(self.arg), self.name};\n}\n\n\nstatic expr compile(ast::expr self) {\n return match(self, [](auto self) {\n return compile(self);\n });\n}\n\n\nstatic void format(expr self, state& ss);\n\ntemplate<class T>\nstatic void format(T self, state& ss) {\n throw std::runtime_error(\"unimplemented\");\n}\n\nstatic void format(lit self, state& ss) {\n return match(self,\n [&](bool self) { ss << (self ? \"true\" : \"false\"); },\n [&](std::string self) { ss << '\"' << self << '\"'; }, \n [&](auto self) { ss << self; }); \n}\n\n\n\n} \/\/ namespace alt\n\n\ntemplate<class T>\nstatic void compile(const T& self, state&) {\n throw std::runtime_error(\"unimplemented\");\n}\n\n\n\nstatic void compile(const ast::expr& self, state& ss);\n\nstatic void compile(const ast::lit& self, state& ss) {\n return match(self,\n [&](bool self) { ss << (self ? \"true\" : \"false\"); },\n [&](std::string self) { ss << '\"' << self << '\"'; }, \n [&](auto self) { ss << self; }); \n}\n\n\nstatic void compile(const ast::var& self, state& ss) {\n ss << self.name.repr;\n}\n\n\nstatic void compile(const ast::app& self, state& ss) {\n compile(self.func, ss);\n ss << \"(\";\n unsigned sep = 0;\n for(auto arg: self.args) {\n if(sep++) {\n ss << \", \";\n }\n compile(arg, ss);\n }\n ss << \")\";\n}\n\n\nstatic const auto thunk = [](auto expr) {\n return [=](state& ss) {\n ss << \"(function()\";\n ss.with_indent([&] {\n expr(ss.newline());\n });\n ss.newline() << \"end)()\";\n };\n};\n\n\nstatic void compile(const ast::record& self, state& ss) {\n ss << \"{\";\n\n int sep = 0;\n for(ast::def def: self.attrs) {\n if(sep++) {\n ss << \", \";\n }\n \n ss << def.name.repr << \" = \";\n compile(def.value, ss);\n }\n ss << \"}\";\n}\n\nstatic void compile(const ast::attr& self, state& ss) {\n ss << \"(\";\n compile(self.arg, ss);\n ss << \").\";\n ss << self.name.repr;\n}\n\n\nstatic void compile(const ast::abs& self, state& ss, const char* name) {\n ss << \"function\";\n\n if(name) {\n ss << \" \" << name;\n }\n \n ss << \"(\";\n \n unsigned sep = 0;\n for(auto arg: self.args) {\n if(sep++) {\n ss << \", \";\n }\n ss << arg.name.repr;\n }\n\n ss << \")\";\n ss.with_indent([&] {\n ss.newline() << \"return \";\n compile(self.body, ss);\n });\n ss.newline() << \"end\";\n}\n\nstatic void compile(const ast::abs& self, state& ss) {\n ss << \"(\";\n compile(self, ss, nullptr);\n ss << \")\";\n}\n\n\nstatic void compile(const ast::cond& self, state& ss) {\n return thunk([=](auto& ss) {\n ss << \"if \";\n compile(self.pred, ss);\n ss.newline() << \"then return \";\n compile(self.conseq, ss);\n ss.newline() << \"else return \";\n compile(self.alt, ss);\n ss.newline() << \"end\";\n })(ss);\n}\n\nstatic void compile(const ast::let& self, state& ss) {\n return thunk([=](state& ss) {\n int sep = 0;\n for(auto def: self.defs) {\n if(sep++) {\n ss.newline();\n }\n if(auto fun = def.value.cast<ast::abs>()) {\n compile(*fun, ss, def.name.repr);\n } else {\n ss << \"local \" << def.name.repr << \" = \";\n compile(def.value, ss);\n }\n }\n \n ss.newline() << \"return \";\n compile(self.body, ss);\n })(ss);\n}\n\n\n\nstatic void compile(const ast::expr& self, state& ss) {\n return match(self, [&](auto self) {\n return compile(self, ss);\n });\n}\n\n\nstd::string run(std::shared_ptr<environment> env, const ast::expr& self) {\n std::stringstream buffer;\n state ss(buffer);\n \n ss << \"return \";\n \n compile(self, ss);\n ss << std::flush;\n\n std::clog << buffer.str() << std::endl;\n\n env->run(buffer.str());\n \n std::string result = luaL_tolstring(env->state, -1, nullptr);\n lua_pop(env->state, 1);\n return result;\n}\n\n}\n<commit_msg>whole new lua backend<commit_after>#include \"ast.hpp\"\n\n#include <sstream>\n#include <iostream>\n\nextern \"C\" {\n#include <lua.h>\n#include <lualib.h>\n#include <lauxlib.h>\n}\n\nnamespace lua {\n\nstruct environment {\n lua_State* state;\n\n environment(): state(luaL_newstate()) {\n luaL_openlibs(state);\n\n const int error = luaL_dofile(state, find(\"prelude.lua\").c_str());\n check(error);\n }\n\n void check(int error) const {\n if(error) {\n std::string what = lua_tostring(state, -1);\n lua_pop(state, 1);\n throw std::runtime_error(what);\n }\n }\n \n\n std::string find(std::string filename) const {\n return SLIP_DIR + std::string(\"\/\") + filename;\n }\n \n void run(std::string code) {\n const int error = luaL_dostring(state, code.c_str());\n check(error);\n }\n \n ~environment() {\n lua_close(state);\n }\n};\n\n\nstd::shared_ptr<environment> make_environment() {\n return std::make_shared<environment>();\n}\n\nstruct ret;\nstruct def;\nstruct local;\nstruct call;\nstruct thunk;\nstruct cond;\n\nstruct var;\nstruct lit;\nstruct func;\nstruct table;\nstruct getattr;\n\nstruct term: variant<ret, local, def, call, cond> {\n using term::variant::variant;\n};\n\nstruct expr: variant<var, lit, call, func, thunk, table, getattr> {\n using expr::variant::variant;\n};\n\nstruct lit: variant<bool, long, double, std::string> {\n using lit::variant::variant;\n};\n\nstruct call {\n expr func;\n list<expr> args;\n};\n\nstruct func {\n list<symbol> args;\n list<term> body;\n};\n\nstruct thunk {\n list<term> body;\n};\n\nstruct ret {\n expr value;\n};\n\nstruct local {\n symbol name;\n};\n\nstruct var {\n symbol name;\n};\n\nstruct def {\n symbol name;\n expr value;\n};\n\nstruct cond {\n expr pred;\n list<term> conseq, alt; \n};\n\nstruct table {\n list<def> attrs;\n};\n\nstruct getattr {\n expr arg;\n symbol name;\n};\n\n\nclass state {\n std::ostream& out;\n std::size_t indent = 0;\n\npublic:\n state(std::ostream& out): out(out) { }\n\n template<class T>\n state& operator<<(const T& value) {\n out << value;\n return *this;\n }\n\n state& newline() {\n (out << \"\\n\" << std::string(2 * indent, ' '));;\n return *this;\n }\n \n state& operator<<(std::ostream& (*func)(std::ostream&)) {\n out << func;\n return *this;\n }\n\n template<class Cont>\n void with_indent(Cont cont) {\n const std::size_t old = indent++;\n cont();\n indent = old;\n }\n \n};\n\n\n\ntemplate<class T>\nstatic expr compile(T) {\n throw std::runtime_error(\"unimplemented compile: \" +\n std::string(typeid(T).name()));\n}\n\nstatic expr compile(ast::expr self);\n\n\nstatic expr compile(ast::lit self) {\n return match(self, [](auto self) -> expr {\n return lit{self};\n });\n}\n\n\nstatic expr compile(ast::app self) {\n return call{compile(self.func), map(self.args, [](auto arg) {\n return compile(arg);\n })};\n}\n\nstatic expr compile(ast::abs self) {\n const term body = ret{compile(self.body)};\n return func{map(self.args, [](auto arg) {\n return arg.name;\n }), body %= list<term>() };\n}\n\nstatic expr compile(ast::var self) {\n return var{self.name};\n}\n\n\nstatic expr compile(ast::cond self) {\n const expr pred = compile(self.pred);\n const term conseq = ret{compile(self.conseq)};\n const term alt = ret{compile(self.alt)};\n \n const term body = cond{pred,\n conseq %= list<term>(),\n alt %= list<term>()};\n \n return thunk{body %= list<term>()};\n}\n\n\nstatic expr compile(ast::let self) {\n const list<term> decls = map(self.defs, [](ast::def self) -> term {\n return local{self.name};\n });\n\n const list<term> defs = map(self.defs, [](ast::def self) -> term {\n return def{self.name, compile(self.value)};\n });\n\n const term body = ret{compile(self.body)};\n \n return thunk{concat(concat(decls, defs),\n body %= list<term>())};\n}\n\n\nstatic expr compile(ast::record self) {\n return table{map(self.attrs, [](auto attr) {\n return def{attr.name, compile(attr.value)};\n })};\n}\n\nstatic expr compile(ast::attr self) {\n return getattr{compile(self.arg), self.name};\n}\n\n\nstatic expr compile(ast::expr self) {\n return match(self, [](auto self) {\n return compile(self);\n });\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstatic void format(expr self, state& ss);\nstatic void format(term self, state& ss);\n\ntemplate<class T>\nstatic void format(T self, state& ss) {\n throw std::runtime_error(\"unimplemented format: \" +\n std::string(typeid(T).name()));\n}\n\nstatic void format(lit self, state& ss) {\n return match(self,\n [&](bool self) { ss << (self ? \"true\" : \"false\"); },\n [&](std::string self) { ss << '\"' << self << '\"'; }, \n [&](auto self) { ss << self; }); \n}\n\nstatic void format(var self, state& ss) {\n ss << self.name.repr;\n}\n\n\nstatic void format(ret self, state& ss) {\n format(self.value, ss << \"return \");\n}\n\nstatic void format(local self, state& ss) {\n ss << \"local \" << self.name;\n}\n\nstatic void format(def self, state& ss) {\n ss << self.name << \" = \";\n format(self.value, ss);\n}\n\n\n\nstatic void format(call self, state& ss) {\n format(self.func, ss);\n ss << \"(\";\n unsigned sep = 0;\n for(auto arg: self.args) {\n if(sep++) {\n ss << \", \";\n }\n format(arg, ss);\n }\n ss << \")\";\n}\n\n\nstatic void format(thunk self, state& ss) {\n ss << \"(function()\";\n ss.with_indent([&] {\n for(term t: self.body) {\n format(t, ss.newline());\n }\n });\n ss.newline() << \"end)()\";\n}\n\n\n\n\nstatic void format(table self, state& ss) {\n ss << \"{\";\n\n int sep = 0;\n for(auto def: self.attrs) {\n if(sep++) {\n ss << \", \";\n }\n \n ss << def.name.repr << \" = \";\n format(def.value, ss);\n }\n ss << \"}\";\n}\n\n\nstatic void format(getattr self, state& ss) {\n ss << \"(\";\n format(self.arg, ss);\n ss << \").\";\n ss << self.name.repr;\n}\n\n\nstatic void format(func self, state& ss) {\n ss << \"function(\";\n \n unsigned sep = 0;\n for(auto arg: self.args) {\n if(sep++) {\n ss << \", \";\n }\n ss << arg.repr;\n }\n\n ss << \")\";\n ss.with_indent([&] {\n for(term t: self.body) {\n format(t, ss.newline());\n }\n });\n ss.newline() << \"end\";\n}\n\nstatic void format(cond self, state& ss) {\n format(self.pred, ss << \"if \");\n\n ss.newline() << \"then\";\n ss.with_indent([&] {\n for(term t: self.conseq) {\n format(t, ss.newline());\n }\n });\n ss.newline() << \"else\";\n ss.with_indent([&] {\n for(term t: self.alt) {\n format(t, ss.newline());\n }\n });\n ss.newline() << \"end\";\n}\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic void format(expr self, state& ss) {\n return match(self, [&](auto self) {\n return format(self, ss);\n });\n}\n\nstatic void format(term self, state& ss) {\n return match(self, [&](auto self) {\n return format(self, ss);\n });\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TODO optimization\n\n\n\nstd::string run(std::shared_ptr<environment> env, const ast::expr& self) {\n std::stringstream buffer;\n state ss(buffer);\n\n const term code = ret{compile(self)};\n format(code, ss);\n\n std::clog << buffer.str() << std::endl;\n\n env->run(buffer.str());\n \n std::string result = luaL_tolstring(env->state, -1, nullptr);\n lua_pop(env->state, 1);\n return result;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <jansson.h>\n\n#include <vector>\n\n#include \"utils\/translate-commit-desc.h\"\n\n\n#include \"event.h\"\n\nnamespace {\n\nQString getStringFromJson(const json_t *json, const char* key)\n{\n return QString::fromUtf8(json_string_value(json_object_get(json, key)));\n}\n\nconst char *kEventTypeRepoCreate = \"repo-create\";\nconst char *kEventTypeRepoDelete = \"repo-delete\";\n\n} \/\/ namespace\n\n\nSeafEvent SeafEvent::fromJSON(const json_t *json, json_error_t *\/* error *\/)\n{\n SeafEvent event;\n\n event.author = getStringFromJson(json, \"author\");\n if (event.author.isEmpty()) {\n event.author = \"anonymous\";\n event.anonymous = true;\n }\n event.nick = getStringFromJson(json, \"nick\");\n if (event.nick.isEmpty()) {\n event.nick = \"anonymous\";\n }\n\n event.repo_id = getStringFromJson(json, \"repo_id\");\n event.repo_name = getStringFromJson(json, \"repo_name\");\n\n event.commit_id = getStringFromJson(json, \"commit_id\");\n event.etype = getStringFromJson(json, \"etype\");\n event.desc = getStringFromJson(json, \"desc\");\n\n event.timestamp = json_integer_value(json_object_get(json, \"time\"));\n\n if (event.etype == kEventTypeRepoCreate) {\n event.desc = QObject::tr(\"Created library \\\"%1\\\"\").arg(event.repo_name);\n } else if (event.etype == kEventTypeRepoDelete) {\n event.desc = QObject::tr(\"Deleted library \\\"%1\\\"\").arg(event.repo_name);\n }\n\n event.desc = translateCommitDesc(event.desc);\n\n return event;\n}\n\nstd::vector<SeafEvent> SeafEvent::listFromJSON(const json_t *json, json_error_t *error)\n{\n std::vector<SeafEvent> events;\n\n for (size_t i = 0; i < json_array_size(json); i++) {\n SeafEvent event = fromJSON(json_array_get(json, i), error);\n events.push_back(event);\n }\n\n return events;\n}\n\nQString SeafEvent::toString() const\n{\n return QString(\"type=\\\"%1\\\",author=\\\"%2\\\",repo_name=\\\"%3\\\",desc=\\\"%4\\\",commit=\\\"%5\\\"\")\n .arg(etype).arg(author).arg(repo_name).arg(desc).arg(commit_id);\n}\n\nbool SeafEvent::isDetailsDisplayable() const\n{\n if (commit_id.isEmpty()) {\n return false;\n }\n \/\/ TODO: determine if there are files change in this commit\n return true;\n}\n<commit_msg>fix a bug caused by using uninitialized value<commit_after>#include <jansson.h>\n\n#include <vector>\n\n#include \"utils\/translate-commit-desc.h\"\n\n\n#include \"event.h\"\n\nnamespace {\n\nQString getStringFromJson(const json_t *json, const char* key)\n{\n return QString::fromUtf8(json_string_value(json_object_get(json, key)));\n}\n\nconst char *kEventTypeRepoCreate = \"repo-create\";\nconst char *kEventTypeRepoDelete = \"repo-delete\";\n\n} \/\/ namespace\n\n\nSeafEvent SeafEvent::fromJSON(const json_t *json, json_error_t *\/* error *\/)\n{\n SeafEvent event;\n\n event.author = getStringFromJson(json, \"author\");\n if (event.author.isEmpty()) {\n event.author = \"anonymous\";\n event.anonymous = true;\n } else {\n event.anonymous = false;\n }\n\n event.nick = getStringFromJson(json, \"nick\");\n if (event.nick.isEmpty()) {\n event.nick = \"anonymous\";\n }\n\n event.repo_id = getStringFromJson(json, \"repo_id\");\n event.repo_name = getStringFromJson(json, \"repo_name\");\n\n event.commit_id = getStringFromJson(json, \"commit_id\");\n event.etype = getStringFromJson(json, \"etype\");\n event.desc = getStringFromJson(json, \"desc\");\n\n event.timestamp = json_integer_value(json_object_get(json, \"time\"));\n\n if (event.etype == kEventTypeRepoCreate) {\n event.desc = QObject::tr(\"Created library \\\"%1\\\"\").arg(event.repo_name);\n } else if (event.etype == kEventTypeRepoDelete) {\n event.desc = QObject::tr(\"Deleted library \\\"%1\\\"\").arg(event.repo_name);\n }\n\n event.desc = translateCommitDesc(event.desc);\n\n return event;\n}\n\nstd::vector<SeafEvent> SeafEvent::listFromJSON(const json_t *json, json_error_t *error)\n{\n std::vector<SeafEvent> events;\n\n for (size_t i = 0; i < json_array_size(json); i++) {\n SeafEvent event = fromJSON(json_array_get(json, i), error);\n events.push_back(event);\n }\n\n return events;\n}\n\nQString SeafEvent::toString() const\n{\n return QString(\"type=\\\"%1\\\",author=\\\"%2\\\",repo_name=\\\"%3\\\",desc=\\\"%4\\\",commit=\\\"%5\\\"\")\n .arg(etype).arg(author).arg(repo_name).arg(desc).arg(commit_id);\n}\n\nbool SeafEvent::isDetailsDisplayable() const\n{\n if (commit_id.isEmpty()) {\n return false;\n }\n \/\/ TODO: determine if there are files change in this commit\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <app\/Scene.hpp>\n#include <app\/ModuleBrowser.hpp>\n#include <app.hpp>\n#include <system.hpp>\n#include <network.hpp>\n#include <history.hpp>\n#include <settings.hpp>\n#include <patch.hpp>\n#include <asset.hpp>\n#include <osdialog.h>\n#include <thread>\n\n\nnamespace rack {\nnamespace app {\n\n\nScene::Scene() {\n\trackScroll = new RackScrollWidget;\n\taddChild(rackScroll);\n\n\track = rackScroll->rackWidget;\n\n\tmenuBar = createMenuBar();\n\taddChild(menuBar);\n\trackScroll->box.pos.y = menuBar->box.size.y;\n\n\tmoduleBrowser = moduleBrowserCreate();\n\tmoduleBrowser->hide();\n\taddChild(moduleBrowser);\n}\n\nScene::~Scene() {\n}\n\nvoid Scene::step() {\n\t\/\/ Resize owned descendants\n\tmenuBar->box.size.x = box.size.x;\n\trackScroll->box.size = box.size.minus(rackScroll->box.pos);\n\n\t\/\/ Autosave every 15 seconds\n\tif (settings::autosavePeriod > 0.0) {\n\t\tdouble time = glfwGetTime();\n\t\tif (time - lastAutosaveTime >= settings::autosavePeriod) {\n\t\t\tlastAutosaveTime = time;\n\t\t\tAPP->patch->save(asset::autosavePath);\n\t\t\tsettings::save(asset::settingsPath);\n\t\t}\n\t}\n\n\tWidget::step();\n}\n\nvoid Scene::draw(const DrawArgs &args) {\n\tWidget::draw(args);\n}\n\nvoid Scene::onHoverKey(const event::HoverKey &e) {\n\tOpaqueWidget::onHoverKey(e);\n\tif (e.isConsumed())\n\t\treturn;\n\n\tif (e.action == GLFW_PRESS || e.action == GLFW_REPEAT) {\n\t\tswitch (e.key) {\n\t\t\tcase GLFW_KEY_N: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->resetDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_Q: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->window->close();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_O: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->loadDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->patch->revertDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_S: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->saveDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->patch->saveAsDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_Z: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->history->undo();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->history->redo();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_MINUS: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tfloat zoom = settings::zoom;\n\t\t\t\t\tzoom *= 2;\n\t\t\t\t\tzoom = std::ceil(zoom - 0.01) - 1;\n\t\t\t\t\tzoom \/= 2;\n\t\t\t\t\tsettings::zoom = zoom;\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_EQUAL: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tfloat zoom = settings::zoom;\n\t\t\t\t\tzoom *= 2;\n\t\t\t\t\tzoom = std::floor(zoom + 0.01) + 1;\n\t\t\t\t\tzoom \/= 2;\n\t\t\t\t\tsettings::zoom = zoom;\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_ENTER: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tmoduleBrowser->show();\n\t\t\t\t}\n\t\t\t\te.consume(this);\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_F1: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tstd::thread t([] {\n\t\t\t\t\t\tsystem::openBrowser(\"https:\/\/vcvrack.com\/manual\/\");\n\t\t\t\t\t});\n\t\t\t\t\tt.detach();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_F11: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tAPP->window->setFullScreen(!APP->window->isFullScreen());\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t}\n\t}\n}\n\nvoid Scene::onPathDrop(const event::PathDrop &e) {\n\tOpaqueWidget::onPathDrop(e);\n\tif (e.isConsumed())\n\t\treturn;\n\n\tif (e.paths.size() >= 1) {\n\t\tconst std::string &path = e.paths[0];\n\t\tif (string::filenameExtension(string::filename(path)) == \"vcv\") {\n\t\t\tAPP->patch->load(path);\n\t\t\te.consume(this);\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace app\n} \/\/ namespace rack\n<commit_msg>Add Ctrl-0 key command for resetting zoom.<commit_after>#include <app\/Scene.hpp>\n#include <app\/ModuleBrowser.hpp>\n#include <app.hpp>\n#include <system.hpp>\n#include <network.hpp>\n#include <history.hpp>\n#include <settings.hpp>\n#include <patch.hpp>\n#include <asset.hpp>\n#include <osdialog.h>\n#include <thread>\n\n\nnamespace rack {\nnamespace app {\n\n\nScene::Scene() {\n\trackScroll = new RackScrollWidget;\n\taddChild(rackScroll);\n\n\track = rackScroll->rackWidget;\n\n\tmenuBar = createMenuBar();\n\taddChild(menuBar);\n\trackScroll->box.pos.y = menuBar->box.size.y;\n\n\tmoduleBrowser = moduleBrowserCreate();\n\tmoduleBrowser->hide();\n\taddChild(moduleBrowser);\n}\n\nScene::~Scene() {\n}\n\nvoid Scene::step() {\n\t\/\/ Resize owned descendants\n\tmenuBar->box.size.x = box.size.x;\n\trackScroll->box.size = box.size.minus(rackScroll->box.pos);\n\n\t\/\/ Autosave every 15 seconds\n\tif (settings::autosavePeriod > 0.0) {\n\t\tdouble time = glfwGetTime();\n\t\tif (time - lastAutosaveTime >= settings::autosavePeriod) {\n\t\t\tlastAutosaveTime = time;\n\t\t\tAPP->patch->save(asset::autosavePath);\n\t\t\tsettings::save(asset::settingsPath);\n\t\t}\n\t}\n\n\tWidget::step();\n}\n\nvoid Scene::draw(const DrawArgs &args) {\n\tWidget::draw(args);\n}\n\nvoid Scene::onHoverKey(const event::HoverKey &e) {\n\tOpaqueWidget::onHoverKey(e);\n\tif (e.isConsumed())\n\t\treturn;\n\n\tif (e.action == GLFW_PRESS || e.action == GLFW_REPEAT) {\n\t\tswitch (e.key) {\n\t\t\tcase GLFW_KEY_N: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->resetDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_Q: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->window->close();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_O: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->loadDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->patch->revertDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_S: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->patch->saveDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->patch->saveAsDialog();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_Z: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tAPP->history->undo();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == (RACK_MOD_CTRL | GLFW_MOD_SHIFT)) {\n\t\t\t\t\tAPP->history->redo();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_MINUS: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tfloat zoom = settings::zoom;\n\t\t\t\t\tzoom *= 2;\n\t\t\t\t\tzoom = std::ceil(zoom - 0.01f) - 1;\n\t\t\t\t\tzoom \/= 2;\n\t\t\t\t\tsettings::zoom = zoom;\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_EQUAL: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tfloat zoom = settings::zoom;\n\t\t\t\t\tzoom *= 2;\n\t\t\t\t\tzoom = std::floor(zoom + 0.01f) + 1;\n\t\t\t\t\tzoom \/= 2;\n\t\t\t\t\tsettings::zoom = zoom;\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_0: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == RACK_MOD_CTRL) {\n\t\t\t\t\tsettings::zoom = 0.f;\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_ENTER: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tmoduleBrowser->show();\n\t\t\t\t}\n\t\t\t\te.consume(this);\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_F1: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tstd::thread t([] {\n\t\t\t\t\t\tsystem::openBrowser(\"https:\/\/vcvrack.com\/manual\/\");\n\t\t\t\t\t});\n\t\t\t\t\tt.detach();\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase GLFW_KEY_F11: {\n\t\t\t\tif ((e.mods & RACK_MOD_MASK) == 0) {\n\t\t\t\t\tAPP->window->setFullScreen(!APP->window->isFullScreen());\n\t\t\t\t\te.consume(this);\n\t\t\t\t}\n\t\t\t} break;\n\t\t}\n\t}\n}\n\nvoid Scene::onPathDrop(const event::PathDrop &e) {\n\tOpaqueWidget::onPathDrop(e);\n\tif (e.isConsumed())\n\t\treturn;\n\n\tif (e.paths.size() >= 1) {\n\t\tconst std::string &path = e.paths[0];\n\t\tif (string::filenameExtension(string::filename(path)) == \"vcv\") {\n\t\t\tAPP->patch->load(path);\n\t\t\te.consume(this);\n\t\t}\n\t}\n}\n\n\n} \/\/ namespace app\n} \/\/ namespace rack\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include <sensor_msgs\/Image.h>\n#include <image_transport\/image_transport.h>\n#include <visualization_msgs\/Marker.h>\n#include <opencv\/cv.h>\n#include <opencv\/highgui.h>\n#include <cv_bridge\/CvBridge.h>\n\n#include <AprilTags\/TagDetector.h>\n#include <AprilTags\/Tag16h5.h>\n#include <AprilTags\/Tag25h7.h>\n#include <AprilTags\/Tag25h9.h>\n#include <AprilTags\/Tag36h9.h>\n#include <AprilTags\/Tag36h11.h>\n\n#include <visualization_msgs\/MarkerArray.h>\n#include \"yaml-cpp\/yaml.h\"\n#include <sstream>\n#include <fstream>\n\n#include <boost\/unordered_map.hpp>\n\nusing namespace std;\n\n#define DEFAULT_TAG_FAMILY string(\"36h11\")\n\nclass AprilTagsNode {\n ros::NodeHandle node_;\n image_transport::ImageTransport image_;\n ros::Publisher marker_publisher_;\n ros::ServiceServer detect_enable_;\n \n AprilTags::TagDetector* tag_detector_;\n AprilTags::TagCodes tag_codes_;\n \n sensor_msgs::CameraInfo camera_info_;\n \n int viewer_;\n string tag_family_name_;\n boost::unordered_map<size_t, double> tag_sizes_;\n double default_tag_size_;\n string frame_;\n \n ros::Subscriber image_subscriber;\n ros::Subscriber info_subscriber;\n \n int enabled_;\n\npublic:\n AprilTagsNode() : node_(\"~\"),\n image_(node_),\n tag_codes_(AprilTags::tagCodes36h11){\n \n string camera_topic_name = \"\/Image\"; \/\/ \"\/head_kinect\/rgb\/image_color\";\n string output_marker_list_topic_name = \"\/marker_array\";\n string enable_service_name = \"\/Enable\";\n string tag_data;\n \n \/\/ Get Parameters\n node_.param(\"\/viewer\", viewer_, 1);\n node_.param(\"\/tag_family\", tag_family_name_, DEFAULT_TAG_FAMILY);\n node_.param(\"\/tag_data\", tag_data, string(\"\"));\n \n double small_tag_size = 0.0358968; \/\/0.0378968; \/\/ (~1.5\" tags)\n double med_tag_size = 0.0630174; \/\/ (~2.5\" tags)\n double page_tag_size = 0.165;\n node_.param(\"\/default_tag_size\", default_tag_size_, med_tag_size);\n node_.param(\"\/tf_frame\", frame_, \/*string(\"\/prosilica_cam\"));*\/ string(\"\/head_kinect_rgb_frame\"));\n \n \/\/ Start the viewer if speficified\n if(viewer_){\n cvNamedWindow(\"AprilTags\");\n cvStartWindowThread();\n }\n \n \/\/ Tag Detector\n SetTagCodeFromString(tag_family_name_);\n tag_detector_ = new AprilTags::TagDetector(tag_codes_);\n \n \/\/ Publisher\n marker_publisher_ = node_.advertise<visualization_msgs::MarkerArray>(\n output_marker_list_topic_name, 0);\n \n \/\/ Subscriber\n \/\/image_transport::CameraSubscriber sub = image_.subscribeCamera(\n \/\/ camera_topic_name, 1, &AprilTagsNode::ImageCallback, this);\n \n image_subscriber = node_.subscribe(camera_topic_name, 10, &AprilTagsNode::ImageCallback, this);\n \n info_subscriber = node_.subscribe(\"\/camera_info\", 10, &AprilTagsNode::InfoCallback, this);\n \n \/\/ Store Tag Sizes\n StoreTagSizes(tag_data);\n }\n \n ~AprilTagsNode(){\n cvDestroyWindow(\"AprilTags\");\n delete tag_detector_;\n }\n \n void SetTagCodeFromString(string code_string){\n if(code_string == \"16h5\"){\n tag_codes_ = AprilTags::tagCodes16h5;\n }\n else if(code_string == \"25h7\"){\n tag_codes_ = AprilTags::tagCodes25h7;\n }\n else if(code_string == \"25h9\"){\n tag_codes_ = AprilTags::tagCodes25h9;\n }\n else if(code_string == \"36h9\"){\n tag_codes_ = AprilTags::tagCodes36h9;\n }\n else if(code_string == \"36h11\"){\n tag_codes_ = AprilTags::tagCodes36h11;\n }\n else{\n cout << \"Invalid tag family specified : \" << code_string << endl;\n exit(1);\n }\n }\n \n void StoreTagSizes(string tag_data){\n stringstream tag_ss;\n tag_ss << tag_data;\n YAML::Parser parser(tag_ss);\n YAML::Node doc;\n parser.GetNextDocument(doc);\n \n for(YAML::Iterator field = doc.begin(); field != doc.end(); ++field){\n \/\/string index_str;\n \/\/field.first() >> index_str;\n \/\/size_t index = atoi(index_str.c_str());\n \n int index;\n field.first() >> index;\n \n const YAML::Node& value = field.second();\n for(YAML::Iterator sub_field = value.begin();\n sub_field != value.end(); ++sub_field){\n \n string key;\n sub_field.first() >> key;\n \n if(key == \"size\"){\n sub_field.second() >> tag_sizes_[index];\n }\n }\n }\n }\n \n void InfoCallback(\n const sensor_msgs::CameraInfoConstPtr& camera_info){\n \/\/std::cout << \"INFO CALLBACK\" << endl;\n camera_info_ = (*camera_info);\n }\n \n void ImageCallback(\n const sensor_msgs::ImageConstPtr& msg )\/\/,\n \/\/ const sensor_msgs::CameraInfoConstPtr& camera_info)\n {\n \n \/\/std::cout << \"IMAGE CALLBACK\" << endl;\n \n sensor_msgs::CvBridge bridge;\n cv::Mat subscribed_image;\n try{\n subscribed_image = bridge.imgMsgToCv(msg, \"bgr8\");\n }\n catch(sensor_msgs::CvBridgeException& e){\n ROS_ERROR(\"Could not convert from '%s' to 'bgr8'.\",\n msg->encoding.c_str());\n return;\n }\n \n cv::Mat subscribed_gray;\n cv::cvtColor(subscribed_image, subscribed_gray, CV_BGR2GRAY);\n vector<AprilTags::TagDetection> detections =\n tag_detector_->extractTags(subscribed_gray);\n \n \/\/cout << \"Found \" << detections.size() << endl;\n \n visualization_msgs::MarkerArray marker_transforms;\n \n for(unsigned int i = 0; i < detections.size(); ++i){\n double tag_size = default_tag_size_;\n boost::unordered_map<size_t, double>::iterator tag_size_it =\n tag_sizes_.find(detections[i].id);\n \n if(tag_size_it != tag_sizes_.end()){\n tag_size = (*tag_size_it).second; \n }\n \n detections[i].draw(subscribed_image);\n Eigen::Matrix4d pose;\n pose = detections[i].getRelativeTransform(\n tag_size,\n (camera_info_).K[0], (camera_info_).K[4],\n (camera_info_).K[2], (camera_info_).K[5]);\n Eigen::Matrix3d R = pose.block<3,3>(0,0);\n Eigen::Quaternion<double> q(R);\n \n visualization_msgs::Marker marker_transform;\n marker_transform.header.frame_id = frame_;\n marker_transform.header.stamp = ros::Time::now();\n stringstream convert;\n convert << \"tag\" << detections[i].id;\n marker_transform.ns = convert.str().c_str();\n marker_transform.id = detections[i].id;\n marker_transform.type = visualization_msgs::Marker::CUBE;\n marker_transform.action = visualization_msgs::Marker::ADD;\n marker_transform.pose.position.x = pose(0,3);\n marker_transform.pose.position.y = pose(1,3);\n marker_transform.pose.position.z = pose(2,3);\n marker_transform.pose.orientation.x = q.x();\n marker_transform.pose.orientation.y = q.y();\n marker_transform.pose.orientation.z = q.z();\n marker_transform.pose.orientation.w = q.w();\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size;\n marker_transform.scale.z = 0.05 * tag_size;\n marker_transform.color.r = 0.5;\n marker_transform.color.g = 0.5;\n marker_transform.color.b = 0.5;\n marker_transform.color.a = 1.0;\n marker_transforms.markers.push_back(marker_transform);\n }\n \n marker_publisher_.publish(marker_transforms);\n \n if(viewer_){\n cv::imshow(\"AprilTags\", subscribed_image);\n }\n }\n};\n\nint main(int argc, char **argv){\n ros::init(argc, argv, \"apriltags\");\n \n AprilTagsNode detector;\n ros::spin();\n \n return EXIT_SUCCESS;\n}\n<commit_msg>cleaning up<commit_after>#include <ros\/ros.h>\n#include <sensor_msgs\/Image.h>\n\/\/#include <image_transport\/image_transport.h>\n#include <visualization_msgs\/Marker.h>\n#include <opencv\/cv.h>\n#include <opencv\/highgui.h>\n#include <cv_bridge\/CvBridge.h>\n\n#include <AprilTags\/TagDetector.h>\n#include <AprilTags\/Tag16h5.h>\n#include <AprilTags\/Tag25h7.h>\n#include <AprilTags\/Tag25h9.h>\n#include <AprilTags\/Tag36h9.h>\n#include <AprilTags\/Tag36h11.h>\n\n#include <visualization_msgs\/MarkerArray.h>\n#include \"yaml-cpp\/yaml.h\"\n#include <sstream>\n#include <fstream>\n\n#include <boost\/unordered_map.hpp>\n\nusing namespace std;\n\n#define SMALL_TAG_SIZE = 0.0358968; \/\/0.0378968; \/\/ (~1.5\" tags)\n#define MED_TAG_SIZE = 0.0630174; \/\/ (~2.5\" tags)\n#define PAGE_TAG_SIZE = 0.165;\n\n#define DEFAULT_TAG_FAMILY string(\"36h11\")\n\nclass AprilTagsNode {\n ros::NodeHandle node_;\n \/\/image_transport::ImageTransport image_;\n ros::Publisher marker_publisher_;\n ros::ServiceServer detect_enable_;\n \n AprilTags::TagDetector* tag_detector_;\n AprilTags::TagCodes tag_codes_;\n string tag_family_name_;\n \n sensor_msgs::CameraInfo camera_info_;\n \n int viewer_;\n boost::unordered_map<size_t, double> tag_sizes_;\n double default_tag_size_;\n string frame_;\n \n ros::Subscriber image_subscriber;\n ros::Subscriber info_subscriber;\n \n int enabled_;\n\npublic:\n AprilTagsNode() : node_(\"~\"),\n image_(node_),\n tag_codes_(AprilTags::tagCodes36h11){\n \n string camera_topic_name = \"\/Image\";\n string output_marker_list_topic_name = \"\/marker_array\";\n string enable_service_name = \"\/Enable\";\n string tag_data;\n \n \/\/ Get Parameters\n node_.param(\"\/viewer\", viewer_, 0);\n node_.param(\"\/tag_family\", tag_family_name_, DEFAULT_TAG_FAMILY);\n node_.param(\"\/tag_data\", tag_data, string(\"\"));\n \n node_.param(\"\/default_tag_size\", default_tag_size_, SMALL_TAG_SIZE);\n node_.param(\"\/tf_frame\", frame_, string(\"\/head_kinect_rgb_frame\"));\n \n \/\/ Start the viewer if speficified\n if(viewer_){\n cvNamedWindow(\"AprilTags\");\n cvStartWindowThread();\n }\n \n \/\/ Tag Detector\n SetTagCodeFromString(tag_family_name_);\n tag_detector_ = new AprilTags::TagDetector(tag_codes_);\n \n \/\/ Publisher\n marker_publisher_ = node_.advertise<visualization_msgs::MarkerArray>(\n output_marker_list_topic_name, 0);\n \n \/\/ Subscriber\n \/\/image_transport::CameraSubscriber sub = image_.subscribeCamera(\n \/\/ camera_topic_name, 1, &AprilTagsNode::ImageCallback, this);\n \n image_subscriber = node_.subscribe(camera_topic_name, 10, &AprilTagsNode::ImageCallback, this);\n \n info_subscriber = node_.subscribe(\"\/camera_info\", 10, &AprilTagsNode::InfoCallback, this);\n \n \/\/ Store Tag Sizes\n StoreTagSizes(tag_data);\n }\n \n ~AprilTagsNode(){\n cvDestroyWindow(\"AprilTags\");\n delete tag_detector_;\n }\n \n void SetTagCodeFromString(string code_string){\n if(code_string == \"16h5\"){\n tag_codes_ = AprilTags::tagCodes16h5;\n }\n else if(code_string == \"25h7\"){\n tag_codes_ = AprilTags::tagCodes25h7;\n }\n else if(code_string == \"25h9\"){\n tag_codes_ = AprilTags::tagCodes25h9;\n }\n else if(code_string == \"36h9\"){\n tag_codes_ = AprilTags::tagCodes36h9;\n }\n else if(code_string == \"36h11\"){\n tag_codes_ = AprilTags::tagCodes36h11;\n }\n else{\n cout << \"Invalid tag family specified : \" << code_string << endl;\n exit(1);\n }\n }\n \n void StoreTagSizes(string tag_data){\n stringstream tag_ss;\n tag_ss << tag_data;\n YAML::Parser parser(tag_ss);\n YAML::Node doc;\n parser.GetNextDocument(doc);\n \n for(YAML::Iterator field = doc.begin(); field != doc.end(); ++field){\n \/\/string index_str;\n \/\/field.first() >> index_str;\n \/\/size_t index = atoi(index_str.c_str());\n \n int index;\n field.first() >> index;\n \n const YAML::Node& value = field.second();\n for(YAML::Iterator sub_field = value.begin();\n sub_field != value.end(); ++sub_field){\n \n string key;\n sub_field.first() >> key;\n \n if(key == \"size\"){\n sub_field.second() >> tag_sizes_[index];\n }\n }\n }\n }\n \n void InfoCallback(\n const sensor_msgs::CameraInfoConstPtr& camera_info){\n camera_info_ = (*camera_info);\n }\n \n void ImageCallback(\n const sensor_msgs::ImageConstPtr& msg )\/\/,\n \/\/ const sensor_msgs::CameraInfoConstPtr& camera_info)\n {\n \n sensor_msgs::CvBridge bridge;\n cv::Mat subscribed_image;\n try{\n subscribed_image = bridge.imgMsgToCv(msg, \"bgr8\");\n }\n catch(sensor_msgs::CvBridgeException& e){\n ROS_ERROR(\"Could not convert from '%s' to 'bgr8'.\",\n msg->encoding.c_str());\n return;\n }\n \n cv::Mat subscribed_gray;\n cv::cvtColor(subscribed_image, subscribed_gray, CV_BGR2GRAY);\n vector<AprilTags::TagDetection> detections =\n tag_detector_->extractTags(subscribed_gray);\n \n visualization_msgs::MarkerArray marker_transforms;\n \n for(unsigned int i = 0; i < detections.size(); ++i){\n double tag_size = default_tag_size_;\n boost::unordered_map<size_t, double>::iterator tag_size_it =\n tag_sizes_.find(detections[i].id);\n \n if(tag_size_it != tag_sizes_.end()){\n tag_size = (*tag_size_it).second; \n }\n \n if(viewer_){\n detections[i].draw(subscribed_image);\n }\n \n Eigen::Matrix4d pose;\n pose = detections[i].getRelativeTransform(\n tag_size,\n (camera_info_).K[0], (camera_info_).K[4],\n (camera_info_).K[2], (camera_info_).K[5]);\n Eigen::Matrix3d R = pose.block<3,3>(0,0);\n Eigen::Quaternion<double> q(R);\n \n visualization_msgs::Marker marker_transform;\n marker_transform.header.frame_id = frame_;\n marker_transform.header.stamp = ros::Time::now();\n stringstream convert;\n convert << \"tag\" << detections[i].id;\n marker_transform.ns = convert.str().c_str();\n marker_transform.id = detections[i].id;\n marker_transform.type = visualization_msgs::Marker::CUBE;\n marker_transform.action = visualization_msgs::Marker::ADD;\n marker_transform.pose.position.x = pose(0,3);\n marker_transform.pose.position.y = pose(1,3);\n marker_transform.pose.position.z = pose(2,3);\n marker_transform.pose.orientation.x = q.x();\n marker_transform.pose.orientation.y = q.y();\n marker_transform.pose.orientation.z = q.z();\n marker_transform.pose.orientation.w = q.w();\n marker_transform.scale.x = tag_size;\n marker_transform.scale.y = tag_size;\n marker_transform.scale.z = 0.05 * tag_size;\n marker_transform.color.r = 0.5;\n marker_transform.color.g = 0.5;\n marker_transform.color.b = 0.5;\n marker_transform.color.a = 1.0;\n marker_transforms.markers.push_back(marker_transform);\n }\n \n marker_publisher_.publish(marker_transforms);\n \n if(viewer_){\n cv::imshow(\"AprilTags\", subscribed_image);\n }\n }\n};\n\nint main(int argc, char **argv){\n ros::init(argc, argv, \"apriltags\");\n \n AprilTagsNode detector;\n ros::spin();\n \n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"CLog.hpp\"\n\n#include <amx\/amx.h>\n\n\nvoid CDebugInfoManager::Update(AMX * const amx, const char *func)\n{\n\tm_Amx = amx;\n\tm_NativeName = func;\n\n\tm_Available =\n\t\tsamplog::GetLastAmxLine(amx, m_Info.line) &&\n\t\tsamplog::GetLastAmxFile(amx, m_Info.file) &&\n\t\tsamplog::GetLastAmxFunction(amx, m_Info.function);\n}\n\nvoid CDebugInfoManager::Clear()\n{\n\tm_Amx = nullptr;\n\tm_NativeName = nullptr;\n\tm_Available = false;\n\tm_Info.line = 0;\n\tm_Info.function = nullptr;\n\tm_Info.file = nullptr;\n}\n\nCScopedDebugInfo::CScopedDebugInfo(AMX * const amx, const char *func,\n\t\t\t\t\t\t\t\t const char *params_format \/* = \"\"*\/)\n{\n\tuint16_t amx_flags = 0;\n\tamx_Flags(amx, &amx_flags);\n\tm_HasAmxDebugSymbols = (amx_flags & AMX_FLAG_DEBUG) == AMX_FLAG_DEBUG;\n\n\tif (m_HasAmxDebugSymbols)\n\t\tCDebugInfoManager::Get()->Update(amx, func);\n\n\tauto &logger = CLog::Get()->m_Logger;\n\tif (logger.IsLogLevel(LogLevel::DEBUG))\n\t\tlogger.LogNativeCall(amx, func, params_format);\n}\n<commit_msg>bug-fix: log calls from natives don't work when PAWN debug informations aren't available<commit_after>#include \"CLog.hpp\"\n\n#include <amx\/amx.h>\n\n\nvoid CDebugInfoManager::Update(AMX * const amx, const char *func)\n{\n\tm_Amx = amx;\n\tm_NativeName = func;\n\n\tm_Available =\n\t\tsamplog::GetLastAmxLine(amx, m_Info.line) &&\n\t\tsamplog::GetLastAmxFile(amx, m_Info.file) &&\n\t\tsamplog::GetLastAmxFunction(amx, m_Info.function);\n}\n\nvoid CDebugInfoManager::Clear()\n{\n\tm_Amx = nullptr;\n\tm_NativeName = nullptr;\n\tm_Available = false;\n\tm_Info.line = 0;\n\tm_Info.function = nullptr;\n\tm_Info.file = nullptr;\n}\n\nCScopedDebugInfo::CScopedDebugInfo(AMX * const amx, const char *func,\n\t\t\t\t\t\t\t\t const char *params_format \/* = \"\"*\/)\n{\n\tCDebugInfoManager::Get()->Update(amx, func);\n\n\tauto &logger = CLog::Get()->m_Logger;\n\tif (logger.IsLogLevel(LogLevel::DEBUG))\n\t\tlogger.LogNativeCall(amx, func, params_format);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cassert>\n\n#include <QChar>\n#include <QTextStream>\n#include <QString>\n\n#include \"StreamIterator\"\n#include \"TokenRule\"\n#include \"OptionalRule\"\n#include \"DiscardRule\"\n#include \"MultipleRule\"\n#include \"PredicateRule\"\n#include \"ProxyRule\"\n#include \"AlternativeRule\"\n#include \"ReduceRule\"\n#include \"config.h\"\n\n#include <QRegExp>\n#include <QElapsedTimer>\n\n#ifdef HAVE_BOOST\n#include <boost\/config\/warning_disable.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#endif\n\n#include \"rules.hpp\"\n\nusing namespace sprout;\n\nconst int RUNS = 1e5;\n\ntemplate <class Runner>\nvoid runBenchmark(const char* name, Runner runner)\n{\n QElapsedTimer timer;\n timer.start();\n\n for (int i = 0; i < RUNS; ++i) {\n runner();\n }\n\n std::cout << name << \" took \" << timer.elapsed() << \" ms\\n\";\n}\n\nint main()\n{\n using namespace make;\n\n auto fastWhitespace = rule::whitespace<QString>();\n\n auto whitespace = discard(\n multiple(predicate<QChar, QString>([](const QChar& input, QString&) {\n return input.isSpace();\n }))\n );\n\n auto name = aggregate<QString>(\n multiple(simplePredicate<QChar>([](const QChar& input) {\n return input.isLetter() || input == '_';\n })),\n [](QString& aggregate, const QChar& c) {\n aggregate += c;\n }\n );\n\n auto fastName = [](Cursor<QChar>& orig, Result<QString>& result) {\n auto iter = orig;\n QString aggr;\n while (iter) {\n auto input = *iter++;\n if (input.isLetter() || input == '_') {\n aggr += input;\n } else {\n break;\n }\n }\n if (aggr.isNull()) {\n return false;\n }\n result.insert(aggr);\n orig = iter;\n return true;\n };\n\n std::cout << \"Running \" << RUNS << \" iteration\" << (RUNS == 1 ? \"\" : \"s\") << \"\\n\";\n\n std::cout << std::endl;\n std::cout << \"=== Parser Benchmarks ===\\n\";\n\n const QString inputString(\"var bar\");\n const QString targetString(\"bar\");\n\n {\n QRegExp re(\"^var\\\\s+(\\\\w+)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n whitespace,\n name\n );\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(targetString == *results);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n fastWhitespace,\n fastName\n );\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(targetString == *results);\n });\n }\n\n {\n runBenchmark(\"Inline\", [&]() {\n QString result;\n\n if (!inputString.startsWith(\"var\")) {\n assert(false);\n }\n int mark = 3;\n while (mark < inputString.size() && inputString.at(mark).isSpace()) {\n ++mark;\n }\n QString aggr;\n while (mark < inputString.size() && inputString.at(mark).isLetter()) {\n aggr += inputString.at(mark++);\n }\n assert(aggr == targetString);\n });\n }\n\n std::cout << std::endl;\n std::cout << \"=== Direct Match Benchmarks ===\\n\";\n\n const QString simpleTarget(\"var\");\n\n {\n QRegExp re(\"^var\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(0) == simpleTarget);\n });\n }\n\n {\n auto benchmark = OrderedTokenRule<QChar, QString>(\"var\", \"var\");\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == simpleTarget);\n });\n }\n\n {\n QString varStr(\"var\");\n auto benchmark = [&](Cursor<QChar>& orig, Result<QString>& results) {\n auto iter = orig;\n for (int i = 0; i < varStr.size(); ++i) {\n if (!iter || *iter++ != varStr.at(i)) {\n return false;\n }\n }\n orig = iter;\n results.insert(varStr);\n return true;\n };\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == simpleTarget);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string input(\"varbar\");\n std::string target(\"bar\");\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n \"var\" >> qi::string(\"bar\")[phoenix::ref(word) = \"bar\"]\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n\n std::cout << std::endl;\n std::cout << \"=== Aggregating Match Benchmarks ===\\n\";\n\n {\n const QString inputString(\"varbar\");\n const QString targetString(\"bar\");\n\n {\n QRegExp re(\"^var(\\\\w+)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n name\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n fastName\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string inputString = \"varbar\";\n std::string targetString = \"bar\";\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::double_;\n using qi::_1;\n\n std::vector<char> letters;\n auto result = qi::phrase_parse(\n inputString.begin(),\n inputString.end(),\n (\n \"var\" >> (+ascii::char_)[phoenix::ref(letters) = _1]\n ),\n ascii::space\n );\n std::string word(letters.begin(), letters.end());\n\n assert(result);\n assert(word == targetString);\n });\n }\n #endif\n }\n\n std::cout << std::endl;\n std::cout << \"=== Whitespace Match Benchmarks ===\\n\";\n\n {\n const QString inputString(\" foo\");\n const QString targetString(\"foo\");\n\n {\n QRegExp re(\"^\\\\s+(foo)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n whitespace,\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\")\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n fastWhitespace,\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\")\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string input(\" foo\");\n std::string target(\"foo\");\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n *ascii::space >> qi::string(\"foo\")[phoenix::ref(word) = \"foo\"]\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n }\n\n std::cout << std::endl;\n std::cout << \"=== Lazy Match Benchmarks ===\\n\";\n\n {\n const QString inputString(\"foo #notime\");\n const QString targetString(\"foo\");\n\n {\n QRegExp re(\"^(foo)\\\\s*(#.*)?$\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\"),\n discard(rule::whitespace<QString>()),\n discard(proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"#\"),\n proxyLazy<QChar, QString>(\n any<QChar, QString>(),\n proxyAlternative<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"\\n\"),\n make::end<QChar, QString>()\n )\n )\n ))\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\"),\n discard(optional(fastWhitespace)),\n [](Cursor<QChar>& iter, Result<QString>& result) {\n if (!iter || *iter != '#') {\n return false;\n }\n while (iter && *iter != '\\n') {\n \/\/ Skip commented characters\n ++iter;\n }\n return true;\n }\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n auto input = inputString.toStdString();\n auto target = targetString.toStdString();\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::double_;\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n qi::string(\"foo\")[phoenix::ref(word) = \"foo\"] >> *ascii::space >> -(\"#\" >> *ascii::char_)\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n }\n\n std::cout << std::endl;\n std::cout << \"=== Cursor Benchmarks ===\\n\";\n\n {\n QString target(\"var foo\");\n QString str(\"var foo\");\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&str);\n for (int j = 0; j < target.size(); ++j) {\n if (target.at(j) != *cursor++) {\n assert(false);\n }\n }\n });\n }\n\n {\n QString target(\"var foo\");\n QString str(\"var foo\");\n runBenchmark(\"Inline\", [&]() {\n QString result;\n auto cursor = makeCursor<QChar>(&str);\n result = \"foo\";\n for (int j = 0; j < target.size(); ++j) {\n if (target.at(j) != str.at(j)) {\n result = \"\";\n }\n }\n });\n }\n\n return 0;\n}\n\n\/\/ vim: set ts=4 sw=4 :\n<commit_msg>Fixed inconsistent indentation in benchmark<commit_after>#include <iostream>\n#include <cassert>\n\n#include <QChar>\n#include <QTextStream>\n#include <QString>\n\n#include \"StreamIterator\"\n#include \"TokenRule\"\n#include \"OptionalRule\"\n#include \"DiscardRule\"\n#include \"MultipleRule\"\n#include \"PredicateRule\"\n#include \"ProxyRule\"\n#include \"AlternativeRule\"\n#include \"ReduceRule\"\n#include \"config.h\"\n\n#include <QRegExp>\n#include <QElapsedTimer>\n\n#ifdef HAVE_BOOST\n#include <boost\/config\/warning_disable.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <boost\/spirit\/include\/phoenix_operator.hpp>\n#endif\n\n#include \"rules.hpp\"\n\nusing namespace sprout;\n\nconst int RUNS = 1e5;\n\ntemplate <class Runner>\nvoid runBenchmark(const char* name, Runner runner)\n{\n QElapsedTimer timer;\n timer.start();\n\n for (int i = 0; i < RUNS; ++i) {\n runner();\n }\n\n std::cout << name << \" took \" << timer.elapsed() << \" ms\\n\";\n}\n\nint main()\n{\n using namespace make;\n\n auto fastWhitespace = rule::whitespace<QString>();\n\n auto whitespace = discard(\n multiple(predicate<QChar, QString>([](const QChar& input, QString&) {\n return input.isSpace();\n }))\n );\n\n auto name = aggregate<QString>(\n multiple(simplePredicate<QChar>([](const QChar& input) {\n return input.isLetter() || input == '_';\n })),\n [](QString& aggregate, const QChar& c) {\n aggregate += c;\n }\n );\n\n auto fastName = [](Cursor<QChar>& orig, Result<QString>& result) {\n auto iter = orig;\n QString aggr;\n while (iter) {\n auto input = *iter++;\n if (input.isLetter() || input == '_') {\n aggr += input;\n } else {\n break;\n }\n }\n if (aggr.isNull()) {\n return false;\n }\n result.insert(aggr);\n orig = iter;\n return true;\n };\n\n std::cout << \"Running \" << RUNS << \" iteration\" << (RUNS == 1 ? \"\" : \"s\") << \"\\n\";\n std::cout << std::endl;\n\n {\n std::cout << \"=== Parser Benchmarks ===\\n\";\n\n const QString inputString(\"var bar\");\n const QString targetString(\"bar\");\n\n {\n QRegExp re(\"^var\\\\s+(\\\\w+)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n whitespace,\n name\n );\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(targetString == *results);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n fastWhitespace,\n fastName\n );\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(targetString == *results);\n });\n }\n\n {\n runBenchmark(\"Inline\", [&]() {\n QString result;\n\n if (!inputString.startsWith(\"var\")) {\n assert(false);\n }\n int mark = 3;\n while (mark < inputString.size() && inputString.at(mark).isSpace()) {\n ++mark;\n }\n QString aggr;\n while (mark < inputString.size() && inputString.at(mark).isLetter()) {\n aggr += inputString.at(mark++);\n }\n assert(aggr == targetString);\n });\n }\n\n std::cout << std::endl;\n }\n\n {\n std::cout << \"=== Direct Match Benchmarks ===\\n\";\n\n const QString inputString(\"var\");\n const QString targetString(\"var\");\n\n {\n QRegExp re(\"^var\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(0) == targetString);\n });\n }\n\n {\n auto benchmark = OrderedTokenRule<QChar, QString>(\"var\", \"var\");\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n QString varStr(\"var\");\n auto benchmark = [&](Cursor<QChar>& orig, Result<QString>& results) {\n auto iter = orig;\n for (int i = 0; i < varStr.size(); ++i) {\n if (!iter || *iter++ != varStr.at(i)) {\n return false;\n }\n }\n orig = iter;\n results.insert(varStr);\n return true;\n };\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string input(\"varbar\");\n std::string target(\"bar\");\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n \"var\" >> qi::string(\"bar\")[phoenix::ref(word) = \"bar\"]\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n\n std::cout << std::endl;\n }\n\n\n {\n std::cout << \"=== Aggregating Match Benchmarks ===\\n\";\n\n const QString inputString(\"varbar\");\n const QString targetString(\"bar\");\n\n {\n QRegExp re(\"^var(\\\\w+)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n name\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n discard(OrderedTokenRule<QChar, QString>(\"var\")),\n fastName\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string inputString = \"varbar\";\n std::string targetString = \"bar\";\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::double_;\n using qi::_1;\n\n std::vector<char> letters;\n auto result = qi::phrase_parse(\n inputString.begin(),\n inputString.end(),\n (\n \"var\" >> (+ascii::char_)[phoenix::ref(letters) = _1]\n ),\n ascii::space\n );\n std::string word(letters.begin(), letters.end());\n\n assert(result);\n assert(word == targetString);\n });\n }\n #endif\n\n std::cout << std::endl;\n }\n\n {\n std::cout << \"=== Whitespace Match Benchmarks ===\\n\";\n\n const QString inputString(\" foo\");\n const QString targetString(\"foo\");\n\n {\n QRegExp re(\"^\\\\s+(foo)\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n whitespace,\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\")\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n fastWhitespace,\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\")\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n std::string input(\" foo\");\n std::string target(\"foo\");\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n *ascii::space >> qi::string(\"foo\")[phoenix::ref(word) = \"foo\"]\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n\n std::cout << std::endl;\n }\n\n {\n std::cout << \"=== Lazy Match Benchmarks ===\\n\";\n\n const QString inputString(\"foo #notime\");\n const QString targetString(\"foo\");\n\n {\n QRegExp re(\"^(foo)\\\\s*(#.*)?$\");\n runBenchmark(\"RegExp\", [&]() {\n assert(re.indexIn(inputString, 0) == 0);\n assert(re.cap(1) == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\"),\n discard(rule::whitespace<QString>()),\n discard(proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"#\"),\n proxyLazy<QChar, QString>(\n any<QChar, QString>(),\n proxyAlternative<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"\\n\"),\n make::end<QChar, QString>()\n )\n )\n ))\n );\n\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n {\n auto benchmark = proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"foo\", \"foo\"),\n discard(optional(fastWhitespace)),\n [](Cursor<QChar>& iter, Result<QString>& result) {\n if (!iter || *iter != '#') {\n return false;\n }\n while (iter && *iter != '\\n') {\n \/\/ Skip commented characters\n ++iter;\n }\n return true;\n }\n );\n\n runBenchmark(\"Spfast\", [&]() {\n auto cursor = makeCursor<QChar>(&inputString);\n Result<QString> results;\n\n assert(benchmark(cursor, results));\n assert(*results == targetString);\n });\n }\n\n #ifdef HAVE_BOOST\n {\n auto input = inputString.toStdString();\n auto target = targetString.toStdString();\n runBenchmark(\"Booost\", [&]() {\n namespace qi = boost::spirit::qi;\n namespace ascii = boost::spirit::ascii;\n namespace phoenix = boost::phoenix;\n\n using qi::double_;\n using qi::_1;\n\n std::string word;\n auto result = qi::phrase_parse(\n input.begin(),\n input.end(),\n (\n qi::string(\"foo\")[phoenix::ref(word) = \"foo\"] >> *ascii::space >> -(\"#\" >> *ascii::char_)\n ),\n ascii::space\n );\n\n assert(result);\n assert(word == target);\n });\n }\n #endif\n\n std::cout << std::endl;\n }\n\n {\n std::cout << \"=== Cursor Benchmarks ===\\n\";\n\n {\n QString target(\"var foo\");\n QString str(\"var foo\");\n runBenchmark(\"Sprout\", [&]() {\n auto cursor = makeCursor<QChar>(&str);\n for (int j = 0; j < target.size(); ++j) {\n if (target.at(j) != *cursor++) {\n assert(false);\n }\n }\n });\n }\n\n {\n QString target(\"var foo\");\n QString str(\"var foo\");\n runBenchmark(\"Inline\", [&]() {\n QString result;\n auto cursor = makeCursor<QChar>(&str);\n result = \"foo\";\n for (int j = 0; j < target.size(); ++j) {\n if (target.at(j) != str.at(j)) {\n result = \"\";\n }\n }\n });\n }\n }\n\n return 0;\n}\n\n\/\/ vim: set ts=4 sw=4 :\n<|endoftext|>"} {"text":"<commit_before>#include \"Game.hpp\"\n\n#include \"SystemInfo\/SystemInfo.hpp\"\n\nnamespace swift\n{\n\tGame::Game(const std::string& t, unsigned tps)\n\t\t:\trunning(false),\n\t\t\ttitle(t),\n\t\t\tconsole(500, 200, defaultFont, \"$:\"),\n\t\t\tgraphics(Quality::Medium),\n\t\t\tsmoothing(true),\n\t\t\tfullscreen(false),\n\t\t\tverticalSync(true),\n\t\t\tresolution({800, 600}),\n\t\t\tsoundLevel(100),\n\t\t\tmusicLevel(75),\n\t\t\tticksPerSecond(tps)\n\t{\n\t}\n\n\tGame::~Game()\n\t{\n\t\tif(currentState)\n\t\t\tdelete currentState;\n\t}\n\n\t\/\/ Do any pre-game data loading\n\t\/\/ Such as setting up the scripting virtual machine\n\t\/\/ and setting game quality settings.\n\t\/\/ That's about it\n\tvoid Game::start(int c, char** args)\n\t{\n\t\t\/\/ c is the total arguments\n\t\t\/\/ args is the arguments\n\n\t\t\/\/ loads settings from the settings file\n\t\tloadSettings(\".\/data\/settings\/settings.ini\");\n\n\t\thandleLaunchOps(c, args);\n\n\t\t\/\/ Window set up.\n\t\tif(fullscreen)\n\t\t\twindow.create(sf::VideoMode::getDesktopMode(), title, sf::Style::Fullscreen);\n\t\telse\n\t\t\twindow.create({resolution.x, resolution.y, 32}, title, sf::Style::Titlebar | sf::Style::Close);\n\t\t\n\t\t\/\/ get System Info\n\t\tlog\t<< \"OS:\\t\\t\" << getOSName() << '\\n'\n\t\t\t<< \"Version:\\t\" << getOSVersion() << '\\n'\n\t\t\t<< \"Arch:\\t\\t\" << getOSArch() << '\\n'\n\t\t\t<< \"Total Mem:\\t\" << getTotalMem() << '\\n'\n\t\t\t<< \"CPU:\\t\\t\" << getCPUModel() << '\\n'\n\t\t\t<< \"Video Vendor:\\t\" << getVideoVendor() << '\\n'\n\t\t\t<< \"Video Card:\\t\" << getVideoCard() << '\\n'\n\t\t\t<< \"Video Driver:\\t\" << getVideoDriver() << \"\\n\\n\";\n\t\t\n\t\t\/\/window.setIcon(SwiftEngineIcon.width, SwiftEngineIcon.height, SwiftEngineIcon.pixel_data);\n\t\twindow.setVerticalSyncEnabled(verticalSync);\n\t\twindow.setKeyRepeatEnabled(false);\n\n\t\tassets.setSmooth(smoothing);\n\t\tassets.loadResourceFolder(\".\/data\/animations\");\n\t\tassets.loadResourceFolder(\".\/data\/textures\");\n\t\tassets.loadResourceFolder(\".\/data\/fonts\");\n\t\tassets.loadResourceFolder(\".\/data\/music\");\n\t\tassets.loadResourceFolder(\".\/data\/scripts\");\n\t\tassets.loadResourceFolder(\".\/data\/skeletons\");\n\t\tassets.loadResourceFolder(\".\/data\/sounds\");\n\t\t\n\t\tlog << '\\n';\n\n\t\tmods.loadMods(\".\/data\/mods\");\n\n\t\tfor(auto &m : mods.getMods())\n\t\t{\n\t\t\tassets.loadMod(m.second.mod);\n\t\t}\n\t\t\n\t\tdefaultFont = assets.getFont(\".\/data\/fonts\/segoeuisl.ttf\");\n\n\t\trunning = true;\n\n\t\t\/\/ fps display\n\t\tif(debug)\n\t\t{\n\t\t\tFPS.setFont(defaultFont);\n\t\t\tFPS.setScale(0.7, 0.7);\n\t\t\tFPS.setString(\"000.000\");\n\t\t\tFPS.setColor(sf::Color::White);\n\t\t\tFPS.setPosition(window.getSize().x - (FPS.getGlobalBounds().width + 10), 10);\n\t\t}\n\n\t\t\/\/ setup Script static variables\n\t\tScript::setWindow(window);\n\t\tScript::setAssetManager(assets);\n\t\tScript::setClock(GameTime);\n\t\tScript::setSettings(settings);\n\n\t\t\/\/ state setup\n\t\tcurrentState = new MainMenu(window, assets);\n\t\tcurrentState->setup();\n\t}\n\n\tvoid Game::gameLoop()\n\t{\n\t\tconst sf::Time dt = sf::seconds(1.f \/ ticksPerSecond);\n\n\t\tsf::Time currentTime = GameTime.getElapsedTime();\n\t\tsf::Time lag = sf::seconds(0);\n\n\t\twhile(running)\n\t\t{\n\t\t\tsf::Time newTime = GameTime.getElapsedTime();\n\t\t\tsf::Time frameTime = newTime - currentTime;\n\n\t\t\tif(frameTime > sf::seconds(0.25))\n\t\t\t\tframeTime = sf::seconds(0.25);\n\n\t\t\tcurrentTime = newTime;\n\n\t\t\tlag += frameTime;\n\n\t\t\twhile(lag >= dt)\n\t\t\t{\n\t\t\t\tupdate(dt);\n\t\t\t\tlag -= dt;\n\t\t\t}\n\n\t\t\tdraw(lag.asSeconds() \/ dt.asSeconds());\n\t\t\t\n\t\t\t\/\/ frames per second measurement\n\t\t\tif(debug)\n\t\t\t\tFPS.setString(std::to_string(1 \/ frameTime.asSeconds()).substr(0, 7));\n\t\t}\n\t}\n\n\t\/\/ Finish cleaning up memory, close cleanly, etc\n\tvoid Game::finish()\n\t{\n\t\twindow.close();\n\t}\n\n\tvoid Game::update(sf::Time dt)\n\t{\n\t\tif(running)\n\t\t{\n\t\t\tmanageStates();\n\t\t}\n\t\t\n\t\tsf::Event event;\n\t\twhile(window.pollEvent(event))\n\t\t{\n\t\t\tkeyboard(event);\n\t\t\tmouse(event);\n\n\t\t\t\/\/ avoid having the console type the key that toggles it\n\t\t\tif(event.type == sf::Event::TextEntered && event.text.unicode != '\\\\')\n\t\t\t\tconsole.update(event);\n\n\t\t\tif(event.type == sf::Event::Closed)\n\t\t\t\trunning = false;\n\n\t\t\tcurrentState->handleEvent(event);\n\t\t}\n\t\t\n\t\tif(running)\n\t\t{\n\t\t\tcurrentState->update(dt);\n\t\t}\n\t}\n\n\tvoid Game::manageStates()\n\t{\n\t\tif(currentState->switchFrom())\n\t\t{\n\t\t\tState::Type nextState = currentState->finish();\n\t\t\tdelete currentState;\n\t\t\tcurrentState = nullptr;\n\n\t\t\tswitch(nextState)\n\t\t\t{\n\t\t\t\tcase State::Type::MainMenu:\n\t\t\t\t\tcurrentState = new MainMenu(window, assets);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::SettingsMenu:\n\t\t\t\t\tcurrentState = new SettingsMenu(window, assets, settings);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Play:\n\t\t\t\t\tcurrentState = new Play(window, assets);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Exit:\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tlog << \"[ERROR]: State machine error, state not valid\\n\";\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif(running)\n\t\t\t\tcurrentState->setup();\n\t\t}\n\t}\n\n\tvoid Game::draw(float e)\n\t{\n\t\tif(running)\n\t\t{\n\t\t\t\/* clear display *\/\n\t\t\twindow.clear();\n\n\t\t\t\/* state drawing *\/\n\t\t\tcurrentState->draw(e);\n\t\t\t\n\t\t\t\/* other drawing *\/\n\t\t\twindow.draw(console);\n\t\t\t\n\t\t\tif(debug)\n\t\t\t\twindow.draw(FPS);\n\n\t\t\t\/* display drawing *\/\n\t\t\twindow.display();\n\t\t}\n\t}\n\t\n\tvoid Game::addKeyboardCommands()\n\t{\n\t\t\/\/ add some default keybindings\n\t\tkeyboard.newBinding(\"toggleTerminal\", sf::Keyboard::BackSlash, [&]()\n\t\t{\n\t\t\tconsole.activate(!console.isActivated());\n\t\t});\n\t}\n\t\t\t\n\tvoid Game::addConsoleCommands()\n\t{\n\t\t\/\/ add some console commands\n\t\tconsole.addCommand(\"hello\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\tconsole << \"\\nHello to you too!\";\n\t\t\treturn 0;\n\t\t});\n\t\t\n\t\tconsole.addCommand(\"fps\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\tconsole << \"\\n\" << FPS.getString();\n\t\t\treturn 0;\n\t\t});\n\n\t\tconsole.addCommand(\"exit\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\trunning = false;\n\t\t\treturn 0;\n\t\t});\n\t}\n\n\tvoid Game::handleLaunchOps(int c, char** args)\n\t{\n\t\t\/\/ launch options\n\t\teditor = false;\n\t\tdebug = false;\n\t\tfullscreen = false;\n\n\t\t\/\/ loop through options\n\t\tint arg = 1;\t\/\/ we skip arg 0 because arg 0 is the executable\n\t\twhile(arg < c)\n\t\t{\n\t\t\tif(args[arg] == std::string(\"editor\"))\n\t\t\t{\n\t\t\t\teditor = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"debug\"))\n\t\t\t{\n\t\t\t\tdebug = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"fullscreen\"))\n\t\t\t{\n\t\t\t\tfullscreen = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"res\"))\n\t\t\t{\n\t\t\t\tresolution.x = std::stoi(args[arg + 1]);\n\t\t\t\tresolution.y = std::stoi(args[arg + 2]);\n\t\t\t\targ += 2;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"videoModes\"))\n\t\t\t{\n\t\t\t\tlog << \"Supported Fullscreen Video Modes:\\n\";\n\n\t\t\t\tstd::vector<sf::VideoMode> modes = sf::VideoMode::getFullscreenModes();\n\t\t\t\tfor(std::size_t i = 0; i < modes.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tsf::VideoMode mode = modes[i];\n\t\t\t\t\tlog << \"Mode #\" << i << \": \" << mode.width << \"x\" << mode.height << \" - \" << mode.bitsPerPixel << \" bpp\\n\";\n\t\t\t\t\t\/\/ ex: \"Mode #0: 1920x1080 - 32 bbp\"\n\t\t\t\t}\n\t\t\t\tlog << '\\n';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlog << \"\\nUnknown launch option: \" << args[arg] << '\\n';\n\t\t\t}\n\n\t\t\targ++;\n\t\t}\n\t}\n\t\n\tvoid Game::loadSettings(const std::string& file)\n\t{\n\t\t\/\/ settings file settings\n\t\tif(!settings.loadFile(file))\n\t\t\tlog << \"Could not open settings file, default settings will be used\\n\";\n\n\t\tsettings.get(\"fullscreen\", fullscreen);\n\t\tsettings.get(\"vsync\", verticalSync);\n\t\tsettings.get(\"res.x\", resolution.x);\n\t\tsettings.get(\"res.y\", resolution.y);\n\t\tsettings.get(\"sound\", soundLevel);\n\t\tsettings.get(\"music\", musicLevel);\n\t}\n}\n<commit_msg>Fixed a misplaced & for a reference variable.<commit_after>#include \"Game.hpp\"\n\n#include \"SystemInfo\/SystemInfo.hpp\"\n\nnamespace swift\n{\n\tGame::Game(const std::string& t, unsigned tps)\n\t\t:\trunning(false),\n\t\t\ttitle(t),\n\t\t\tconsole(500, 200, defaultFont, \"$:\"),\n\t\t\tgraphics(Quality::Medium),\n\t\t\tsmoothing(true),\n\t\t\tfullscreen(false),\n\t\t\tverticalSync(true),\n\t\t\tresolution({800, 600}),\n\t\t\tsoundLevel(100),\n\t\t\tmusicLevel(75),\n\t\t\tticksPerSecond(tps)\n\t{\n\t}\n\n\tGame::~Game()\n\t{\n\t\tif(currentState)\n\t\t\tdelete currentState;\n\t}\n\n\t\/\/ Do any pre-game data loading\n\t\/\/ Such as setting up the scripting virtual machine\n\t\/\/ and setting game quality settings.\n\t\/\/ That's about it\n\tvoid Game::start(int c, char** args)\n\t{\n\t\t\/\/ c is the total arguments\n\t\t\/\/ args is the arguments\n\n\t\t\/\/ loads settings from the settings file\n\t\tloadSettings(\".\/data\/settings\/settings.ini\");\n\n\t\thandleLaunchOps(c, args);\n\n\t\t\/\/ Window set up.\n\t\tif(fullscreen)\n\t\t\twindow.create(sf::VideoMode::getDesktopMode(), title, sf::Style::Fullscreen);\n\t\telse\n\t\t\twindow.create({resolution.x, resolution.y, 32}, title, sf::Style::Titlebar | sf::Style::Close);\n\t\t\n\t\t\/\/ get System Info\n\t\tlog\t<< \"OS:\\t\\t\" << getOSName() << '\\n'\n\t\t\t<< \"Version:\\t\" << getOSVersion() << '\\n'\n\t\t\t<< \"Arch:\\t\\t\" << getOSArch() << '\\n'\n\t\t\t<< \"Total Mem:\\t\" << getTotalMem() << '\\n'\n\t\t\t<< \"CPU:\\t\\t\" << getCPUModel() << '\\n'\n\t\t\t<< \"Video Vendor:\\t\" << getVideoVendor() << '\\n'\n\t\t\t<< \"Video Card:\\t\" << getVideoCard() << '\\n'\n\t\t\t<< \"Video Driver:\\t\" << getVideoDriver() << \"\\n\\n\";\n\t\t\n\t\t\/\/window.setIcon(SwiftEngineIcon.width, SwiftEngineIcon.height, SwiftEngineIcon.pixel_data);\n\t\twindow.setVerticalSyncEnabled(verticalSync);\n\t\twindow.setKeyRepeatEnabled(false);\n\n\t\tassets.setSmooth(smoothing);\n\t\tassets.loadResourceFolder(\".\/data\/animations\");\n\t\tassets.loadResourceFolder(\".\/data\/textures\");\n\t\tassets.loadResourceFolder(\".\/data\/fonts\");\n\t\tassets.loadResourceFolder(\".\/data\/music\");\n\t\tassets.loadResourceFolder(\".\/data\/scripts\");\n\t\tassets.loadResourceFolder(\".\/data\/skeletons\");\n\t\tassets.loadResourceFolder(\".\/data\/sounds\");\n\t\t\n\t\tlog << '\\n';\n\n\t\tmods.loadMods(\".\/data\/mods\");\n\n\t\tfor(auto& m : mods.getMods())\n\t\t{\n\t\t\tassets.loadMod(m.second.mod);\n\t\t}\n\t\t\n\t\tdefaultFont = assets.getFont(\".\/data\/fonts\/segoeuisl.ttf\");\n\n\t\trunning = true;\n\n\t\t\/\/ fps display\n\t\tif(debug)\n\t\t{\n\t\t\tFPS.setFont(defaultFont);\n\t\t\tFPS.setScale(0.7, 0.7);\n\t\t\tFPS.setString(\"000.000\");\n\t\t\tFPS.setColor(sf::Color::White);\n\t\t\tFPS.setPosition(window.getSize().x - (FPS.getGlobalBounds().width + 10), 10);\n\t\t}\n\n\t\t\/\/ setup Script static variables\n\t\tScript::setWindow(window);\n\t\tScript::setAssetManager(assets);\n\t\tScript::setClock(GameTime);\n\t\tScript::setSettings(settings);\n\n\t\t\/\/ state setup\n\t\tcurrentState = new MainMenu(window, assets);\n\t\tcurrentState->setup();\n\t}\n\n\tvoid Game::gameLoop()\n\t{\n\t\tconst sf::Time dt = sf::seconds(1.f \/ ticksPerSecond);\n\n\t\tsf::Time currentTime = GameTime.getElapsedTime();\n\t\tsf::Time lag = sf::seconds(0);\n\n\t\twhile(running)\n\t\t{\n\t\t\tsf::Time newTime = GameTime.getElapsedTime();\n\t\t\tsf::Time frameTime = newTime - currentTime;\n\n\t\t\tif(frameTime > sf::seconds(0.25))\n\t\t\t\tframeTime = sf::seconds(0.25);\n\n\t\t\tcurrentTime = newTime;\n\n\t\t\tlag += frameTime;\n\n\t\t\twhile(lag >= dt)\n\t\t\t{\n\t\t\t\tupdate(dt);\n\t\t\t\tlag -= dt;\n\t\t\t}\n\n\t\t\tdraw(lag.asSeconds() \/ dt.asSeconds());\n\t\t\t\n\t\t\t\/\/ frames per second measurement\n\t\t\tif(debug)\n\t\t\t\tFPS.setString(std::to_string(1 \/ frameTime.asSeconds()).substr(0, 7));\n\t\t}\n\t}\n\n\t\/\/ Finish cleaning up memory, close cleanly, etc\n\tvoid Game::finish()\n\t{\n\t\twindow.close();\n\t}\n\n\tvoid Game::update(sf::Time dt)\n\t{\n\t\tif(running)\n\t\t{\n\t\t\tmanageStates();\n\t\t}\n\t\t\n\t\tsf::Event event;\n\t\twhile(window.pollEvent(event))\n\t\t{\n\t\t\tkeyboard(event);\n\t\t\tmouse(event);\n\n\t\t\t\/\/ avoid having the console type the key that toggles it\n\t\t\tif(event.type == sf::Event::TextEntered && event.text.unicode != '\\\\')\n\t\t\t\tconsole.update(event);\n\n\t\t\tif(event.type == sf::Event::Closed)\n\t\t\t\trunning = false;\n\n\t\t\tcurrentState->handleEvent(event);\n\t\t}\n\t\t\n\t\tif(running)\n\t\t{\n\t\t\tcurrentState->update(dt);\n\t\t}\n\t}\n\n\tvoid Game::manageStates()\n\t{\n\t\tif(currentState->switchFrom())\n\t\t{\n\t\t\tState::Type nextState = currentState->finish();\n\t\t\tdelete currentState;\n\t\t\tcurrentState = nullptr;\n\n\t\t\tswitch(nextState)\n\t\t\t{\n\t\t\t\tcase State::Type::MainMenu:\n\t\t\t\t\tcurrentState = new MainMenu(window, assets);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::SettingsMenu:\n\t\t\t\t\tcurrentState = new SettingsMenu(window, assets, settings);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Play:\n\t\t\t\t\tcurrentState = new Play(window, assets);\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Exit:\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tlog << \"[ERROR]: State machine error, state not valid\\n\";\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tif(running)\n\t\t\t\tcurrentState->setup();\n\t\t}\n\t}\n\n\tvoid Game::draw(float e)\n\t{\n\t\tif(running)\n\t\t{\n\t\t\t\/* clear display *\/\n\t\t\twindow.clear();\n\n\t\t\t\/* state drawing *\/\n\t\t\tcurrentState->draw(e);\n\t\t\t\n\t\t\t\/* other drawing *\/\n\t\t\twindow.draw(console);\n\t\t\t\n\t\t\tif(debug)\n\t\t\t\twindow.draw(FPS);\n\n\t\t\t\/* display drawing *\/\n\t\t\twindow.display();\n\t\t}\n\t}\n\t\n\tvoid Game::addKeyboardCommands()\n\t{\n\t\t\/\/ add some default keybindings\n\t\tkeyboard.newBinding(\"toggleTerminal\", sf::Keyboard::BackSlash, [&]()\n\t\t{\n\t\t\tconsole.activate(!console.isActivated());\n\t\t});\n\t}\n\t\t\t\n\tvoid Game::addConsoleCommands()\n\t{\n\t\t\/\/ add some console commands\n\t\tconsole.addCommand(\"hello\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\tconsole << \"\\nHello to you too!\";\n\t\t\treturn 0;\n\t\t});\n\t\t\n\t\tconsole.addCommand(\"fps\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\tconsole << \"\\n\" << FPS.getString();\n\t\t\treturn 0;\n\t\t});\n\n\t\tconsole.addCommand(\"exit\", [&](ArgVec \/*args*\/)\n\t\t{\n\t\t\trunning = false;\n\t\t\treturn 0;\n\t\t});\n\t}\n\n\tvoid Game::handleLaunchOps(int c, char** args)\n\t{\n\t\t\/\/ launch options\n\t\teditor = false;\n\t\tdebug = false;\n\t\tfullscreen = false;\n\n\t\t\/\/ loop through options\n\t\tint arg = 1;\t\/\/ we skip arg 0 because arg 0 is the executable\n\t\twhile(arg < c)\n\t\t{\n\t\t\tif(args[arg] == std::string(\"editor\"))\n\t\t\t{\n\t\t\t\teditor = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"debug\"))\n\t\t\t{\n\t\t\t\tdebug = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"fullscreen\"))\n\t\t\t{\n\t\t\t\tfullscreen = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"res\"))\n\t\t\t{\n\t\t\t\tresolution.x = std::stoi(args[arg + 1]);\n\t\t\t\tresolution.y = std::stoi(args[arg + 2]);\n\t\t\t\targ += 2;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"videoModes\"))\n\t\t\t{\n\t\t\t\tlog << \"Supported Fullscreen Video Modes:\\n\";\n\n\t\t\t\tstd::vector<sf::VideoMode> modes = sf::VideoMode::getFullscreenModes();\n\t\t\t\tfor(std::size_t i = 0; i < modes.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tsf::VideoMode mode = modes[i];\n\t\t\t\t\tlog << \"Mode #\" << i << \": \" << mode.width << \"x\" << mode.height << \" - \" << mode.bitsPerPixel << \" bpp\\n\";\n\t\t\t\t\t\/\/ ex: \"Mode #0: 1920x1080 - 32 bbp\"\n\t\t\t\t}\n\t\t\t\tlog << '\\n';\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlog << \"\\nUnknown launch option: \" << args[arg] << '\\n';\n\t\t\t}\n\n\t\t\targ++;\n\t\t}\n\t}\n\t\n\tvoid Game::loadSettings(const std::string& file)\n\t{\n\t\t\/\/ settings file settings\n\t\tif(!settings.loadFile(file))\n\t\t\tlog << \"Could not open settings file, default settings will be used\\n\";\n\n\t\tsettings.get(\"fullscreen\", fullscreen);\n\t\tsettings.get(\"vsync\", verticalSync);\n\t\tsettings.get(\"res.x\", resolution.x);\n\t\tsettings.get(\"res.y\", resolution.y);\n\t\tsettings.get(\"sound\", soundLevel);\n\t\tsettings.get(\"music\", musicLevel);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by dar on 11\/27\/15.\n\/\/\n\n#include \"Game.h\"\n\nGame::Game(Core *core) : core(core), renderer(core) {\n}\n\nvoid Game::run() {\n this->renderer.init();\n SDL_StartTextInput();\n double deltaTime = timer.GetDelta();\n double accumulator = 0.0;\n while (this->core->isRunning()) {\n deltaTime = timer.GetDelta();\n accumulator += deltaTime;\n while (accumulator > TIME_STEP) {\n this->update();\n accumulator -= TIME_STEP;\n }\n this->renderer.run();\n }\n SDL_StopTextInput();\n}\n\nvoid Game::update() {\n for (int i = 0; i < 256; i++) {\n if (this->pressDelays[i] > 0) this->pressDelays[i]--;\n }\n handleKeyboard();\n SDL_Event e;\n while (SDL_PollEvent(&e) != 0) {\n switch (e.type) {\n case SDL_QUIT:\n this->core->stop();\n break;\n case SDL_WINDOWEVENT:\n if (e.window.event == SDL_WINDOWEVENT_RESIZED || e.window.event == SDL_WINDOWEVENT_SIZE_CHANGED) {\n this->renderer.resize((unsigned int) e.window.data1, (unsigned int) e.window.data2);\n }\n break;\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n if (e.key.repeat == 0)\n handleKeypress(e);\n break;\n }\n }\n this->core->getMap()->update();\n this->core->getMap()->getWorld()->Step(TIME_STEP, 8, 3);\n for (int i = 0; i < this->core->getMap()->getEntities().size(); i++) {\n Entity *entity = this->core->getMap()->getEntities().at(i);\n if (entity->isToBeDeleted()) {\n this->core->getMap()->removeEntity(entity);\n i--;\n\n }\n }\n this->core->setCamX(-this->core->getCamX() + (this->core->getPlayer()->getX() * this->core->getBlockSize() * this->core->getGeneralScale() + this->core->getCamX()) * 0.05);\n this->core->setCamY(-this->core->getCamY() + (this->core->getPlayer()->getY() * this->core->getBlockSize() * this->core->getGeneralScale() + this->core->getCamY()) * 0.05);\n}\n\nvoid Game::handleKeyboard() {\n float SPEED = 1.0f;\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n if (keystate[SDL_SCANCODE_W]) {\n this->core->getPlayer()->setVelY(-SPEED);\n }\n if (keystate[SDL_SCANCODE_S]) {\n this->core->getPlayer()->setVelY(SPEED);\n }\n if (keystate[SDL_SCANCODE_A]) {\n this->core->getPlayer()->setVelX(-SPEED);\n }\n if (keystate[SDL_SCANCODE_D]) {\n this->core->getPlayer()->setVelX(SPEED);\n }\n if (keystate[SDL_SCANCODE_Q]) {\n this->core->stop();\n }\n if (keystate[SDL_SCANCODE_MINUS]) {\n this->core->setBlockSize(this->core->getBlockSize() - 0.15);\n }\n if (keystate[SDL_SCANCODE_EQUALS]) {\n this->core->setBlockSize(this->core->getBlockSize() + 0.15);\n }\n}\n\nvoid Game::handleKeypress(SDL_Event event) {\n switch (event.type) {\n case SDL_KEYDOWN: {\n SDL_Keycode key = event.key.keysym.sym;\n unsigned char delay_tmp = 255;\n static int TELEPORT_DELAY = 255 - 25;\n switch (key) {\n case SDLK_a:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(-1.95, 0);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_d:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(1.95, 0);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_w:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(0, -1.95);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_s:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(0, 1.95);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_c: {\n double angle = atan2(this->core->getPlayer()->getVelY(), this->core->getPlayer()->getVelX()) + M_PI;\n EntityBullet *p = new EntityBullet(this->core, angle, 1);\n p->setX(this->core->getPlayer()->getX() - (this->core->getPlayer()->getWidth() - p->getWidth()) \/ 2 + 0.5 * cos(angle));\n p->setY(this->core->getPlayer()->getY() - (this->core->getPlayer()->getHeight() - p->getHeight()) \/ 2 + 0.5 * sin(angle));\n this->core->getMap()->addEntity(p);\n break;\n }\n case SDLK_n: {\n Player *p = new Player(this->core);\n p->setX(this->core->getPlayer()->getX() - this->core->getPlayer()->getWidth() \/ 2);\n p->setY(this->core->getPlayer()->getY() - this->core->getPlayer()->getHeight() \/ 2);\n this->core->getMap()->addEntity(p);\n break;\n }\n default:\n break;\n }\n if (event.key.keysym.sym >= 0 && event.key.keysym.sym < 256)\n this->pressDelays[event.key.keysym.sym] = delay_tmp;\n break;\n }\n case SDL_KEYUP:\n break;\n\n default:\n break;\n }\n}\n\nvoid Game::resetMovementPressDelays() {\n this->pressDelays[SDLK_a] = this->pressDelays[SDLK_d] = this->pressDelays[SDLK_w] = this->pressDelays[SDLK_s] = 0;\n}\n\nGame::~Game() {\n delete this->core;\n}\n<commit_msg>Stabilized camera<commit_after>\/\/\n\/\/ Created by dar on 11\/27\/15.\n\/\/\n\n#include \"Game.h\"\n\nGame::Game(Core *core) : core(core), renderer(core) {\n}\n\nvoid Game::run() {\n this->renderer.init();\n SDL_StartTextInput();\n double deltaTime = timer.GetDelta();\n double accumulator = 0.0;\n while (this->core->isRunning()) {\n deltaTime = timer.GetDelta();\n accumulator += deltaTime;\n while (accumulator > TIME_STEP) {\n this->update();\n accumulator -= TIME_STEP;\n }\n this->renderer.run();\n }\n SDL_StopTextInput();\n}\n\nvoid Game::update() {\n for (int i = 0; i < 256; i++) {\n if (this->pressDelays[i] > 0) this->pressDelays[i]--;\n }\n handleKeyboard();\n SDL_Event e;\n while (SDL_PollEvent(&e) != 0) {\n switch (e.type) {\n case SDL_QUIT:\n this->core->stop();\n break;\n case SDL_WINDOWEVENT:\n if (e.window.event == SDL_WINDOWEVENT_RESIZED || e.window.event == SDL_WINDOWEVENT_SIZE_CHANGED) {\n this->renderer.resize((unsigned int) e.window.data1, (unsigned int) e.window.data2);\n }\n break;\n case SDL_KEYDOWN:\n case SDL_KEYUP:\n if (e.key.repeat == 0)\n handleKeypress(e);\n break;\n }\n }\n this->core->getMap()->update();\n this->core->getMap()->getWorld()->Step(TIME_STEP, 8, 3);\n for (int i = 0; i < this->core->getMap()->getEntities().size(); i++) {\n Entity *entity = this->core->getMap()->getEntities().at(i);\n if (entity->isToBeDeleted()) {\n this->core->getMap()->removeEntity(entity);\n i--;\n\n }\n }\n double dx = this->core->getPlayer()->getX() * this->core->getBlockSize() * this->core->getGeneralScale() + this->core->getCamX();\n double dy = this->core->getPlayer()->getY() * this->core->getBlockSize() * this->core->getGeneralScale() + this->core->getCamY();\n if (abs(dx) > 2) this->core->setCamX(-this->core->getCamX() + (dx) * 0.05);\n if (abs(dy) > 2) this->core->setCamY(-this->core->getCamY() + (dy) * 0.05);\n}\n\nvoid Game::handleKeyboard() {\n float SPEED = 1.0f;\n const Uint8 *keystate = SDL_GetKeyboardState(NULL);\n if (keystate[SDL_SCANCODE_W]) {\n this->core->getPlayer()->setVelY(-SPEED);\n }\n if (keystate[SDL_SCANCODE_S]) {\n this->core->getPlayer()->setVelY(SPEED);\n }\n if (keystate[SDL_SCANCODE_A]) {\n this->core->getPlayer()->setVelX(-SPEED);\n }\n if (keystate[SDL_SCANCODE_D]) {\n this->core->getPlayer()->setVelX(SPEED);\n }\n if (keystate[SDL_SCANCODE_Q]) {\n this->core->stop();\n }\n if (keystate[SDL_SCANCODE_MINUS]) {\n this->core->setBlockSize(this->core->getBlockSize() - 0.15);\n }\n if (keystate[SDL_SCANCODE_EQUALS]) {\n this->core->setBlockSize(this->core->getBlockSize() + 0.15);\n }\n}\n\nvoid Game::handleKeypress(SDL_Event event) {\n switch (event.type) {\n case SDL_KEYDOWN: {\n SDL_Keycode key = event.key.keysym.sym;\n unsigned char delay_tmp = 255;\n static int TELEPORT_DELAY = 255 - 25;\n switch (key) {\n case SDLK_a:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(-1.95, 0);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_d:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(1.95, 0);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_w:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(0, -1.95);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_s:\n if (this->pressDelays[event.key.keysym.sym] > TELEPORT_DELAY) {\n this->core->getPlayer()->teleport(0, 1.95);\n delay_tmp = 0, resetMovementPressDelays();\n }\n break;\n case SDLK_c: {\n double angle = atan2(this->core->getPlayer()->getVelY(), this->core->getPlayer()->getVelX()) + M_PI;\n EntityBullet *p = new EntityBullet(this->core, angle, 1);\n p->setX(this->core->getPlayer()->getX() - (this->core->getPlayer()->getWidth() - p->getWidth()) \/ 2 + 0.5 * cos(angle));\n p->setY(this->core->getPlayer()->getY() - (this->core->getPlayer()->getHeight() - p->getHeight()) \/ 2 + 0.5 * sin(angle));\n this->core->getMap()->addEntity(p);\n break;\n }\n case SDLK_n: {\n Player *p = new Player(this->core);\n p->setX(this->core->getPlayer()->getX() - this->core->getPlayer()->getWidth() \/ 2);\n p->setY(this->core->getPlayer()->getY() - this->core->getPlayer()->getHeight() \/ 2);\n this->core->getMap()->addEntity(p);\n break;\n }\n default:\n break;\n }\n if (event.key.keysym.sym >= 0 && event.key.keysym.sym < 256)\n this->pressDelays[event.key.keysym.sym] = delay_tmp;\n break;\n }\n case SDL_KEYUP:\n break;\n\n default:\n break;\n }\n}\n\nvoid Game::resetMovementPressDelays() {\n this->pressDelays[SDLK_a] = this->pressDelays[SDLK_d] = this->pressDelays[SDLK_w] = this->pressDelays[SDLK_s] = 0;\n}\n\nGame::~Game() {\n delete this->core;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <windows.h>\r\n\r\n#include <gl\\gl.h>\r\n\r\n#ifdef _MSC_VER\r\n#define _USE_MATH_DEFINES\r\n#endif\r\n#include <math.h>\r\n\r\n#include \"Window.h\"\r\n#include \"Body.h\"\r\n#include \"Error.h\"\r\n#include \"Info.h\"\r\n\r\n\r\n\r\n\r\n#define NAME_FONT_NAME \"Arial\"\r\n#define NAME_FONT_SIZE_AT_800_600 24\r\n#define NAME_FONT_SIZE (NAME_FONT_SIZE_AT_800_600*CWindow::GetWidth()\/800)\r\n\r\n#define NAME_TEXT_COLOR_R 1.00f\r\n#define NAME_TEXT_COLOR_G 1.00f\r\n#define NAME_TEXT_COLOR_B 1.00f\r\n#define NAME_TEXT_COLOR_A 0.50f\r\n\r\n#define INFO_FONT_NAME \"Arial\"\r\n#define INFO_FONT_SIZE_AT_800_600 16\r\n#define INFO_FONT_SIZE (INFO_FONT_SIZE_AT_800_600*CWindow::GetWidth()\/800)\r\n\r\n#define INFO_TEXT_COLOR_R 1.00f\r\n#define INFO_TEXT_COLOR_G 1.00f\r\n#define INFO_TEXT_COLOR_B 1.00f\r\n#define INFO_TEXT_COLOR_A 0.50f\r\n\r\n#define SPACING_COEF 1.75f\r\n#define LINES_AFTER_NAME 1.00f\r\n\r\n\r\n\r\n#define WINDOW_COLOR_R 0.50f\r\n#define WINDOW_COLOR_G 0.50f\r\n#define WINDOW_COLOR_B 0.50f\r\n#define WINDOW_COLOR_A 0.25f\r\n\r\n#define WINDOW_RECT_LEFT 0.0125f\r\n#define WINDOW_RECT_RIGHT 0.32f\r\n#define WINDOW_RECT_BOTTOM 0.0125f\r\n#define WINDOW_RECT_TOP 0.27f\r\n\r\n#define WINDOW_MARGIN_TOP 0.100f\r\n#define WINDOW_MARGIN_LEFT 0.075f\r\n\r\n\r\n#define MAX_FADE_TIME 3.0f\r\n#define FADE_TIME_RATIO 0.10f\r\n#define FADE_TIME(totaltime) min(MAX_FADE_TIME, (totaltime)*FADE_TIME_RATIO)\r\n\r\n#define WINDOW_POS_X (WINDOW_RECT_LEFT*scrwidth)\r\n#define WINDOW_POS_Y (WINDOW_RECT_TOP*scrheight)\r\n#define WINDOW_WIDTH ((WINDOW_RECT_RIGHT-WINDOW_RECT_LEFT)*scrwidth)\r\n#define WINDOW_HEIGHT ((WINDOW_RECT_TOP-WINDOW_RECT_BOTTOM)*scrheight)\r\n#define MARGIN_WIDTH (WINDOW_WIDTH*WINDOW_MARGIN_LEFT)\r\n#define MARGIN_HEIGHT (WINDOW_HEIGHT*WINDOW_MARGIN_TOP)\r\n\r\n\r\n\r\n\r\n\r\n\r\nCInfo::CInfo()\r\n{\r\n\tInit();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nCInfo::~CInfo()\r\n{\r\n\tFree();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Init()\r\n{\r\n\tloaded=false;\r\n\tscrwidth=0;\r\n\tscrheight=0;\r\n\twinlist=0;\r\n\tnamelist=infolist=0;\r\n\ttime=0;\r\n\tstarttime=endtime=0;\r\n\tfadetime=1;\r\n\talpha=0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Free()\r\n{\r\n\tnametext.Free();\r\n\tinfotext.Free();\r\n\tif (winlist)\r\n\t{\r\n\t\tif (glIsList(winlist))\r\n\t\t\tglDeleteLists(winlist,3);\r\n\t}\r\n\tInit();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nbool CInfo::Load()\r\n{\r\n\tFree();\r\n\r\n\tscrwidth=(float)CWindow::GetWidth();\r\n\tscrheight=(float)CWindow::GetHeight();\r\n\r\n\twinlist=glGenLists(3);\r\n\tif (!winlist)\r\n\t{\r\n\t\tCError::LogError(WARNING_CODE,\"Unable to load planet info - failed to generate display lists.\");\r\n\t\tFree();\r\n\t\treturn false;\r\n\t}\r\n\tnamelist=winlist+1;\r\n\tinfolist=namelist+1;\r\n\r\n\tMakeWindow(winlist);\r\n\r\n\tloaded=true;\r\n\tloaded&=nametext.BuildFTFont(NAME_FONT_NAME,NAME_FONT_SIZE);\r\n\tloaded&=infotext.BuildFTFont(INFO_FONT_NAME,INFO_FONT_SIZE);\r\n\tif (!loaded)\r\n\t{\r\n\t\tCError::LogError(WARNING_CODE,\"Unable to load planet info - failed to load font.\");\r\n\t\tFree();\r\n\t}\r\n\r\n\treturn loaded;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeWindow(int list)\r\n{\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tfloat l=scrwidth*WINDOW_RECT_LEFT;\r\n\t\tfloat r=scrwidth*WINDOW_RECT_RIGHT;\r\n\t\tfloat b=scrheight*WINDOW_RECT_BOTTOM;\r\n\t\tfloat t=scrheight*WINDOW_RECT_TOP;\r\n\t\tglDisable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tglBegin(GL_QUADS);\r\n\t\t{\r\n\t\t\tglVertex2f(l,b);\r\n\t\t\tglVertex2f(r,b);\r\n\t\t\tglVertex2f(r,t);\r\n\t\t\tglVertex2f(l,t);\r\n\t\t}\r\n\t\tglEnd();\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::GetNameCoords(const char *text, float *x, float *y)\r\n{\r\n\tfloat tw,th;\r\n\tnametext.GetTextSize(text,&tw,&th);\r\n\tif (x) *x=WINDOW_POS_X+(WINDOW_WIDTH-tw)*0.5f;\r\n\tif (y) *y=WINDOW_POS_Y-MARGIN_HEIGHT-th;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::GetInfoCoords(int linenum, float *x, float *y)\r\n{\r\n\tfloat namey;\r\n\tGetNameCoords(\"\",NULL,&namey);\r\n\tfloat nameadd;\r\n\tnametext.GetTextSize(\"\",NULL,&nameadd);\r\n\tnameadd*=(SPACING_COEF*LINES_AFTER_NAME);\r\n\r\n\tfloat th;\r\n\tinfotext.GetTextSize(\"\",NULL,&th);\r\n\tth*=SPACING_COEF*(float)(linenum-1);\r\n\r\n\tif (x) *x=WINDOW_POS_X+MARGIN_WIDTH;\r\n\tif (y) *y=namey-nameadd-th;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeName(int list, char *targetname)\r\n{\r\n\tif (!targetname) return;\r\n\tif (*targetname==' ') targetname++;\r\n\tfloat x,y;\r\n\tGetNameCoords(targetname,&x,&y);\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tglTranslatef(x,y,0);\r\n\t\tnametext.Print(targetname);\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeInfoLine(int linenum, char *line)\r\n{\r\n\tfloat x,y;\r\n\tGetInfoCoords(linenum,&x,&y);\r\n\tglPushMatrix();\r\n\tglTranslatef(x,y,0);\r\n\tinfotext.Print(line);\r\n\tglPopMatrix();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeInfo(int list, CBody *targetbody)\r\n{\r\n\tbool star=(targetbody==NULL);\r\n\tif (star) targetbody=CBody::bodycache[0];\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tint n=0;\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tif (star)\r\n\t\t{\r\n\t\t\tchar line[64];\r\n\t\t\tn++;\r\n\t\t\tsprintf(line,\"star name: %s\",targetbody->name);\r\n\t\t\tMakeInfoLine(n,line);\r\n\t\t}\r\n\t\tfor (int i=0;i<targetbody->info.numlines;i++)\r\n\t\t{\r\n\t\t\tif (targetbody->info.textlines[i][0]=='\/') continue;\r\n\t\t\tn++;\r\n\t\t\tMakeInfoLine(n,targetbody->info.textlines[i]);\r\n\t\t}\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Start(float seconds, float duration, char *targetname, CBody *targetbody)\r\n{\r\n\tif (!loaded)\r\n\t\treturn;\r\n\tchar name[32];\r\n\tstrcpy(name,targetname);\r\n\tint l=strlen(name);\r\n\tfor (int i=0;i<l;i++)\r\n\t\tif (name[i]=='_')\r\n\t\t\tname[i]=' ';\r\n\tstarttime=seconds;\r\n\tendtime=starttime+duration;\r\n\tfadetime=FADE_TIME(duration);\r\n\tMakeName(namelist,name);\r\n\tMakeInfo(infolist,targetbody);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Update(float seconds)\r\n{\r\n\ttime=seconds;\r\n\tif (time<(endtime-fadetime))\r\n\t\talpha=min(1,(time-starttime)\/fadetime);\r\n\telse\r\n\t\talpha=max(0,(endtime-time)\/fadetime);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Restart()\r\n{\r\n\tstarttime-=time;\r\n\tendtime-=time;\r\n\ttime=0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Draw()\r\n{\r\n\tif (!alpha || !loaded)\r\n\t\treturn;\r\n\r\n\tglPushAttrib(GL_ENABLE_BIT);\r\n\r\n\tglDisable(GL_LIGHTING);\r\n\tglDisable(GL_DEPTH_TEST);\r\n\tglDisable(GL_CULL_FACE);\r\n\tglDisable(GL_NORMALIZE);\r\n\tglEnable(GL_BLEND);\r\n\r\n\tglColor4f(WINDOW_COLOR_R,WINDOW_COLOR_G,WINDOW_COLOR_B,WINDOW_COLOR_A*alpha);\r\n\tglCallList(winlist);\r\n\r\n\tglColor4f(NAME_TEXT_COLOR_R,NAME_TEXT_COLOR_G,NAME_TEXT_COLOR_B,NAME_TEXT_COLOR_A*alpha);\r\n\tglCallList(namelist);\r\n\r\n\tglColor4f(INFO_TEXT_COLOR_R,INFO_TEXT_COLOR_G,INFO_TEXT_COLOR_B,INFO_TEXT_COLOR_A*alpha);\r\n\tglCallList(infolist);\r\n\r\n\tglPopAttrib();\r\n}\r\n<commit_msg>Shortcut.<commit_after>#include <windows.h>\r\n\r\n#include <gl\\gl.h>\r\n\r\n#ifdef _MSC_VER\r\n#define _USE_MATH_DEFINES\r\n#endif\r\n#include <math.h>\r\n\r\n#include \"Window.h\"\r\n#include \"Body.h\"\r\n#include \"Error.h\"\r\n#include \"Info.h\"\r\n\r\n\r\n\r\n\r\n#define NAME_FONT_NAME \"Arial\"\r\n#define NAME_FONT_SIZE_AT_800_600 24\r\n#define NAME_FONT_SIZE (NAME_FONT_SIZE_AT_800_600*scrwidth\/800)\r\n\r\n#define NAME_TEXT_COLOR_R 1.00f\r\n#define NAME_TEXT_COLOR_G 1.00f\r\n#define NAME_TEXT_COLOR_B 1.00f\r\n#define NAME_TEXT_COLOR_A 0.50f\r\n\r\n#define INFO_FONT_NAME \"Arial\"\r\n#define INFO_FONT_SIZE_AT_800_600 16\r\n#define INFO_FONT_SIZE (INFO_FONT_SIZE_AT_800_600*scrwidth\/800)\r\n\r\n#define INFO_TEXT_COLOR_R 1.00f\r\n#define INFO_TEXT_COLOR_G 1.00f\r\n#define INFO_TEXT_COLOR_B 1.00f\r\n#define INFO_TEXT_COLOR_A 0.50f\r\n\r\n#define SPACING_COEF 1.75f\r\n#define LINES_AFTER_NAME 1.00f\r\n\r\n\r\n\r\n#define WINDOW_COLOR_R 0.50f\r\n#define WINDOW_COLOR_G 0.50f\r\n#define WINDOW_COLOR_B 0.50f\r\n#define WINDOW_COLOR_A 0.25f\r\n\r\n#define WINDOW_RECT_LEFT 0.0125f\r\n#define WINDOW_RECT_RIGHT 0.32f\r\n#define WINDOW_RECT_BOTTOM 0.0125f\r\n#define WINDOW_RECT_TOP 0.27f\r\n\r\n#define WINDOW_MARGIN_TOP 0.100f\r\n#define WINDOW_MARGIN_LEFT 0.075f\r\n\r\n\r\n#define MAX_FADE_TIME 3.0f\r\n#define FADE_TIME_RATIO 0.10f\r\n#define FADE_TIME(totaltime) min(MAX_FADE_TIME, (totaltime)*FADE_TIME_RATIO)\r\n\r\n#define WINDOW_POS_X (WINDOW_RECT_LEFT*scrwidth)\r\n#define WINDOW_POS_Y (WINDOW_RECT_TOP*scrheight)\r\n#define WINDOW_WIDTH ((WINDOW_RECT_RIGHT-WINDOW_RECT_LEFT)*scrwidth)\r\n#define WINDOW_HEIGHT ((WINDOW_RECT_TOP-WINDOW_RECT_BOTTOM)*scrheight)\r\n#define MARGIN_WIDTH (WINDOW_WIDTH*WINDOW_MARGIN_LEFT)\r\n#define MARGIN_HEIGHT (WINDOW_HEIGHT*WINDOW_MARGIN_TOP)\r\n\r\n\r\n\r\n\r\n\r\n\r\nCInfo::CInfo()\r\n{\r\n\tInit();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nCInfo::~CInfo()\r\n{\r\n\tFree();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Init()\r\n{\r\n\tloaded=false;\r\n\tscrwidth=0;\r\n\tscrheight=0;\r\n\twinlist=0;\r\n\tnamelist=infolist=0;\r\n\ttime=0;\r\n\tstarttime=endtime=0;\r\n\tfadetime=1;\r\n\talpha=0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Free()\r\n{\r\n\tnametext.Free();\r\n\tinfotext.Free();\r\n\tif (winlist)\r\n\t{\r\n\t\tif (glIsList(winlist))\r\n\t\t\tglDeleteLists(winlist,3);\r\n\t}\r\n\tInit();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nbool CInfo::Load()\r\n{\r\n\tFree();\r\n\r\n\tscrwidth=(float)CWindow::GetWidth();\r\n\tscrheight=(float)CWindow::GetHeight();\r\n\r\n\twinlist=glGenLists(3);\r\n\tif (!winlist)\r\n\t{\r\n\t\tCError::LogError(WARNING_CODE,\"Unable to load planet info - failed to generate display lists.\");\r\n\t\tFree();\r\n\t\treturn false;\r\n\t}\r\n\tnamelist=winlist+1;\r\n\tinfolist=namelist+1;\r\n\r\n\tMakeWindow(winlist);\r\n\r\n\tloaded=true;\r\n\tloaded&=nametext.BuildFTFont(NAME_FONT_NAME,NAME_FONT_SIZE);\r\n\tloaded&=infotext.BuildFTFont(INFO_FONT_NAME,INFO_FONT_SIZE);\r\n\tif (!loaded)\r\n\t{\r\n\t\tCError::LogError(WARNING_CODE,\"Unable to load planet info - failed to load font.\");\r\n\t\tFree();\r\n\t}\r\n\r\n\treturn loaded;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeWindow(int list)\r\n{\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tfloat l=scrwidth*WINDOW_RECT_LEFT;\r\n\t\tfloat r=scrwidth*WINDOW_RECT_RIGHT;\r\n\t\tfloat b=scrheight*WINDOW_RECT_BOTTOM;\r\n\t\tfloat t=scrheight*WINDOW_RECT_TOP;\r\n\t\tglDisable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tglBegin(GL_QUADS);\r\n\t\t{\r\n\t\t\tglVertex2f(l,b);\r\n\t\t\tglVertex2f(r,b);\r\n\t\t\tglVertex2f(r,t);\r\n\t\t\tglVertex2f(l,t);\r\n\t\t}\r\n\t\tglEnd();\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::GetNameCoords(const char *text, float *x, float *y)\r\n{\r\n\tfloat tw,th;\r\n\tnametext.GetTextSize(text,&tw,&th);\r\n\tif (x) *x=WINDOW_POS_X+(WINDOW_WIDTH-tw)*0.5f;\r\n\tif (y) *y=WINDOW_POS_Y-MARGIN_HEIGHT-th;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::GetInfoCoords(int linenum, float *x, float *y)\r\n{\r\n\tfloat namey;\r\n\tGetNameCoords(\"\",NULL,&namey);\r\n\tfloat nameadd;\r\n\tnametext.GetTextSize(\"\",NULL,&nameadd);\r\n\tnameadd*=(SPACING_COEF*LINES_AFTER_NAME);\r\n\r\n\tfloat th;\r\n\tinfotext.GetTextSize(\"\",NULL,&th);\r\n\tth*=SPACING_COEF*(float)(linenum-1);\r\n\r\n\tif (x) *x=WINDOW_POS_X+MARGIN_WIDTH;\r\n\tif (y) *y=namey-nameadd-th;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeName(int list, char *targetname)\r\n{\r\n\tif (!targetname) return;\r\n\tif (*targetname==' ') targetname++;\r\n\tfloat x,y;\r\n\tGetNameCoords(targetname,&x,&y);\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tglTranslatef(x,y,0);\r\n\t\tnametext.Print(targetname);\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeInfoLine(int linenum, char *line)\r\n{\r\n\tfloat x,y;\r\n\tGetInfoCoords(linenum,&x,&y);\r\n\tglPushMatrix();\r\n\tglTranslatef(x,y,0);\r\n\tinfotext.Print(line);\r\n\tglPopMatrix();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::MakeInfo(int list, CBody *targetbody)\r\n{\r\n\tbool star=(targetbody==NULL);\r\n\tif (star) targetbody=CBody::bodycache[0];\r\n\tglNewList(list,GL_COMPILE);\r\n\t{\r\n\t\tint n=0;\r\n\t\tglEnable(GL_TEXTURE_2D);\r\n\t\tglLoadIdentity();\r\n\t\tif (star)\r\n\t\t{\r\n\t\t\tchar line[64];\r\n\t\t\tn++;\r\n\t\t\tsprintf(line,\"star name: %s\",targetbody->name);\r\n\t\t\tMakeInfoLine(n,line);\r\n\t\t}\r\n\t\tfor (int i=0;i<targetbody->info.numlines;i++)\r\n\t\t{\r\n\t\t\tif (targetbody->info.textlines[i][0]=='\/') continue;\r\n\t\t\tn++;\r\n\t\t\tMakeInfoLine(n,targetbody->info.textlines[i]);\r\n\t\t}\r\n\t}\r\n\tglEndList();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Start(float seconds, float duration, char *targetname, CBody *targetbody)\r\n{\r\n\tif (!loaded)\r\n\t\treturn;\r\n\tchar name[32];\r\n\tstrcpy(name,targetname);\r\n\tint l=strlen(name);\r\n\tfor (int i=0;i<l;i++)\r\n\t\tif (name[i]=='_')\r\n\t\t\tname[i]=' ';\r\n\tstarttime=seconds;\r\n\tendtime=starttime+duration;\r\n\tfadetime=FADE_TIME(duration);\r\n\tMakeName(namelist,name);\r\n\tMakeInfo(infolist,targetbody);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Update(float seconds)\r\n{\r\n\ttime=seconds;\r\n\tif (time<(endtime-fadetime))\r\n\t\talpha=min(1,(time-starttime)\/fadetime);\r\n\telse\r\n\t\talpha=max(0,(endtime-time)\/fadetime);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Restart()\r\n{\r\n\tstarttime-=time;\r\n\tendtime-=time;\r\n\ttime=0;\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid CInfo::Draw()\r\n{\r\n\tif (!alpha || !loaded)\r\n\t\treturn;\r\n\r\n\tglPushAttrib(GL_ENABLE_BIT);\r\n\r\n\tglDisable(GL_LIGHTING);\r\n\tglDisable(GL_DEPTH_TEST);\r\n\tglDisable(GL_CULL_FACE);\r\n\tglDisable(GL_NORMALIZE);\r\n\tglEnable(GL_BLEND);\r\n\r\n\tglColor4f(WINDOW_COLOR_R,WINDOW_COLOR_G,WINDOW_COLOR_B,WINDOW_COLOR_A*alpha);\r\n\tglCallList(winlist);\r\n\r\n\tglColor4f(NAME_TEXT_COLOR_R,NAME_TEXT_COLOR_G,NAME_TEXT_COLOR_B,NAME_TEXT_COLOR_A*alpha);\r\n\tglCallList(namelist);\r\n\r\n\tglColor4f(INFO_TEXT_COLOR_R,INFO_TEXT_COLOR_G,INFO_TEXT_COLOR_B,INFO_TEXT_COLOR_A*alpha);\r\n\tglCallList(infolist);\r\n\r\n\tglPopAttrib();\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * ws: a node.js websocket client\n * Copyright(c) 2011 Einar Otto Stangvik <einaros@gmail.com>\n * MIT Licensed\n *\/\n\n#include <v8.h>\n#include <node.h>\n#include <node_version.h>\n#include <node_buffer.h>\n#include <node_object_wrap.h>\n#include <stdlib.h>\n#include <string.h>\n#include <wchar.h>\n#include <stdio.h>\n#include \"nan.h\"\n\nusing namespace v8;\nusing namespace node;\n\nclass BufferUtil : public ObjectWrap\n{\npublic:\n\n static void Initialize(v8::Handle<v8::Object> target)\n {\n NanScope();\n Local<FunctionTemplate> t = NanNew<FunctionTemplate>(New);\n t->InstanceTemplate()->SetInternalFieldCount(1);\n NODE_SET_METHOD(t, \"unmask\", BufferUtil::Unmask);\n NODE_SET_METHOD(t, \"mask\", BufferUtil::Mask);\n NODE_SET_METHOD(t, \"merge\", BufferUtil::Merge);\n target->Set(NanNew<String>(\"BufferUtil\"), t->GetFunction());\n }\n\nprotected:\n\n static NAN_METHOD(New)\n {\n NanScope();\n BufferUtil* bufferUtil = new BufferUtil();\n bufferUtil->Wrap(args.This());\n NanReturnValue(args.This());\n }\n\n static NAN_METHOD(Merge)\n {\n NanScope();\n Local<Object> bufferObj = args[0]->ToObject();\n char* buffer = Buffer::Data(bufferObj);\n Local<Array> array = Local<Array>::Cast(args[1]);\n unsigned int arrayLength = array->Length();\n size_t offset = 0;\n unsigned int i;\n for (i = 0; i < arrayLength; ++i) {\n Local<Object> src = array->Get(i)->ToObject();\n size_t length = Buffer::Length(src);\n memcpy(buffer + offset, Buffer::Data(src), length);\n offset += length;\n }\n NanReturnValue(NanTrue());\n }\n\n static NAN_METHOD(Unmask)\n {\n NanScope();\n Local<Object> buffer_obj = args[0]->ToObject();\n size_t length = Buffer::Length(buffer_obj);\n Local<Object> mask_obj = args[1]->ToObject();\n unsigned int *mask = (unsigned int*)Buffer::Data(mask_obj);\n unsigned int* from = (unsigned int*)Buffer::Data(buffer_obj);\n size_t len32 = length \/ 4;\n unsigned int i;\n for (i = 0; i < len32; ++i) *(from + i) ^= *mask;\n from += i;\n switch (length % 4) {\n case 3: *((unsigned char*)from+2) = *((unsigned char*)from+2) ^ ((unsigned char*)mask)[2];\n case 2: *((unsigned char*)from+1) = *((unsigned char*)from+1) ^ ((unsigned char*)mask)[1];\n case 1: *((unsigned char*)from ) = *((unsigned char*)from ) ^ ((unsigned char*)mask)[0];\n case 0:;\n }\n NanReturnValue(NanTrue());\n }\n\n static NAN_METHOD(Mask)\n {\n NanScope();\n Local<Object> buffer_obj = args[0]->ToObject();\n Local<Object> mask_obj = args[1]->ToObject();\n unsigned int *mask = (unsigned int*)Buffer::Data(mask_obj);\n Local<Object> output_obj = args[2]->ToObject();\n unsigned int dataOffset = args[3]->Int32Value();\n unsigned int length = args[4]->Int32Value();\n unsigned int* to = (unsigned int*)(Buffer::Data(output_obj) + dataOffset);\n unsigned int* from = (unsigned int*)Buffer::Data(buffer_obj);\n unsigned int len32 = length \/ 4;\n unsigned int i;\n for (i = 0; i < len32; ++i) *(to + i) = *(from + i) ^ *mask;\n to += i;\n from += i;\n switch (length % 4) {\n case 3: *((unsigned char*)to+2) = *((unsigned char*)from+2) ^ *((unsigned char*)mask+2);\n case 2: *((unsigned char*)to+1) = *((unsigned char*)from+1) ^ *((unsigned char*)mask+1);\n case 1: *((unsigned char*)to ) = *((unsigned char*)from ) ^ *((unsigned char*)mask);\n case 0:;\n }\n NanReturnValue(NanTrue());\n }\n};\n\n#if !NODE_VERSION_AT_LEAST(0,10,0)\nextern \"C\"\n#endif\nvoid init (Handle<Object> target)\n{\n NanScope();\n BufferUtil::Initialize(target);\n}\n\nNODE_MODULE(bufferutil, init)\n\n<commit_msg>[fix] Correct the license<commit_after>\/*!\n * bufferutil: WebSocket buffer utils\n * Copyright(c) 2015 Einar Otto Stangvik <einaros@gmail.com>\n * MIT Licensed\n *\/\n\n#include <v8.h>\n#include <node.h>\n#include <node_version.h>\n#include <node_buffer.h>\n#include <node_object_wrap.h>\n#include <stdlib.h>\n#include <string.h>\n#include <wchar.h>\n#include <stdio.h>\n#include \"nan.h\"\n\nusing namespace v8;\nusing namespace node;\n\nclass BufferUtil : public ObjectWrap\n{\npublic:\n\n static void Initialize(v8::Handle<v8::Object> target)\n {\n NanScope();\n Local<FunctionTemplate> t = NanNew<FunctionTemplate>(New);\n t->InstanceTemplate()->SetInternalFieldCount(1);\n NODE_SET_METHOD(t, \"unmask\", BufferUtil::Unmask);\n NODE_SET_METHOD(t, \"mask\", BufferUtil::Mask);\n NODE_SET_METHOD(t, \"merge\", BufferUtil::Merge);\n target->Set(NanNew<String>(\"BufferUtil\"), t->GetFunction());\n }\n\nprotected:\n\n static NAN_METHOD(New)\n {\n NanScope();\n BufferUtil* bufferUtil = new BufferUtil();\n bufferUtil->Wrap(args.This());\n NanReturnValue(args.This());\n }\n\n static NAN_METHOD(Merge)\n {\n NanScope();\n Local<Object> bufferObj = args[0]->ToObject();\n char* buffer = Buffer::Data(bufferObj);\n Local<Array> array = Local<Array>::Cast(args[1]);\n unsigned int arrayLength = array->Length();\n size_t offset = 0;\n unsigned int i;\n for (i = 0; i < arrayLength; ++i) {\n Local<Object> src = array->Get(i)->ToObject();\n size_t length = Buffer::Length(src);\n memcpy(buffer + offset, Buffer::Data(src), length);\n offset += length;\n }\n NanReturnValue(NanTrue());\n }\n\n static NAN_METHOD(Unmask)\n {\n NanScope();\n Local<Object> buffer_obj = args[0]->ToObject();\n size_t length = Buffer::Length(buffer_obj);\n Local<Object> mask_obj = args[1]->ToObject();\n unsigned int *mask = (unsigned int*)Buffer::Data(mask_obj);\n unsigned int* from = (unsigned int*)Buffer::Data(buffer_obj);\n size_t len32 = length \/ 4;\n unsigned int i;\n for (i = 0; i < len32; ++i) *(from + i) ^= *mask;\n from += i;\n switch (length % 4) {\n case 3: *((unsigned char*)from+2) = *((unsigned char*)from+2) ^ ((unsigned char*)mask)[2];\n case 2: *((unsigned char*)from+1) = *((unsigned char*)from+1) ^ ((unsigned char*)mask)[1];\n case 1: *((unsigned char*)from ) = *((unsigned char*)from ) ^ ((unsigned char*)mask)[0];\n case 0:;\n }\n NanReturnValue(NanTrue());\n }\n\n static NAN_METHOD(Mask)\n {\n NanScope();\n Local<Object> buffer_obj = args[0]->ToObject();\n Local<Object> mask_obj = args[1]->ToObject();\n unsigned int *mask = (unsigned int*)Buffer::Data(mask_obj);\n Local<Object> output_obj = args[2]->ToObject();\n unsigned int dataOffset = args[3]->Int32Value();\n unsigned int length = args[4]->Int32Value();\n unsigned int* to = (unsigned int*)(Buffer::Data(output_obj) + dataOffset);\n unsigned int* from = (unsigned int*)Buffer::Data(buffer_obj);\n unsigned int len32 = length \/ 4;\n unsigned int i;\n for (i = 0; i < len32; ++i) *(to + i) = *(from + i) ^ *mask;\n to += i;\n from += i;\n switch (length % 4) {\n case 3: *((unsigned char*)to+2) = *((unsigned char*)from+2) ^ *((unsigned char*)mask+2);\n case 2: *((unsigned char*)to+1) = *((unsigned char*)from+1) ^ *((unsigned char*)mask+1);\n case 1: *((unsigned char*)to ) = *((unsigned char*)from ) ^ *((unsigned char*)mask);\n case 0:;\n }\n NanReturnValue(NanTrue());\n }\n};\n\n#if !NODE_VERSION_AT_LEAST(0,10,0)\nextern \"C\"\n#endif\nvoid init (Handle<Object> target)\n{\n NanScope();\n BufferUtil::Initialize(target);\n}\n\nNODE_MODULE(bufferutil, init)\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode: c++, encoding: utf-8 -*-\n\/**\n * tbrpg – Text based roll playing game\n * \n * Copyright © 2012 Mattias Andrée (maandree@kth.se)\n * \n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n * \n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n * \n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#ifndef __CHARACTER__\n#define __CHARACTER__\n\n\n#include <stdlib.h>\n#include <algorithm>\n#include <string>\n\n\n\/**\n * Text based roll playing game\n * \n * DD2387 Program construction with C++\n * Laboration 3\n * \n * @author Mattias Andrée <maandree@kth.se>\n *\/\nnamespace tbrpg\n{\n \/**\n * Character class\n *\/\n class Character\n {\n public:\n \/**\n * Gender: female\n *\/\n const static bool FEMALE = false;\n \n \/**\n * Gender: male\n *\/\n const static bool MALE = true;\n \n \n \/**\n * Alignment: lawful good\n *\/\n const static char LAWFUL_GOOD = 8;\n \n \/**\n * Alignment: neutral good\n *\/\n const static char NEUTRAL_GOOD = 7;\n \n \/**\n * Alignment: chaotic good\n *\/\n const static char CHAOTIC_GOOD = 6;\n \n \/**\n * Alignment: lawful neutral\n *\/\n const static char LAWFUL_NEUTRAL = 5;\n \n \/**\n * Alignment: neutral\n *\/\n const static char TRUE_NEUTRAL = 4;\n \n \/**\n * Alignment: chaotic neutral\n *\/\n const static char CHAOTIC_NEUTRAL = 3;\n \n \/**\n * Alignment: lawful evil\n *\/\n const static char LAWFUL_EVIL = 2;\n \n \/**\n * Alignment: neutral evil\n *\/\n const static char NEUTRAL_EVIL = 1;\n \n \/**\n * Alignment: chaotic evil\n *\/\n const static char CHAOTIC_EVIL = 0;\n \n \n \n protected:\n \/**\n * The gender of the character\n *\/\n bool gender;\n \n \/**\n * The name of the character\n *\/\n std::string name;\n \n \/**\n * Optional image, no bigger than 80x80 pixels\n *\/\n std::string image;\n \n \/**\n * ANSI colour value used on the character name\n *\/\n char colour;\n \n \/**\n * Character alignment\n *\/\n char alignment;\n \n \/**\n * The characters reputation\n *\/\n char reputation;\n \n \/**\n * The character's strength\n *\/\n char strength;\n \n \/**\n * The character's constitution\n *\/\n char constitution;\n \n \/**\n * The character's dexterity\n *\/\n char dexterity;\n \n \/**\n * The character's intelligence\n *\/\n char intelligence;\n \n \/**\n * The character's wisdom\n *\/\n char wisdom;\n \n \/**\n * The character's charisma\n *\/\n char charisma;\n \n \n \n public:\n \/**\n * Constructor\n *\/\n Character();\n \n \/**\n * Copy constructor\n *\n * @param original The object to clone\n *\/\n Character(const Character& original);\n \n \/**\n * Copy constructor\n *\n * @param original The object to clone\n *\/\n Character(Character& original);\n \n \/**\n * Move constructor\n *\n * @param original The object to clone\n *\/\n Character(Character&& original);\n \n \n \n \/**\n * Destructor\n *\/\n virtual ~Character();\n \n \n \n \/**\n * Assignment operator\n * \n * @param original The reference object\n * @return The invoked object\n *\/\n virtual Character& operator =(const Character& original);\n \n \/**\n * Assignment operator\n * \n * @param original The reference object\n * @return The invoked object\n *\/\n virtual Character& operator =(Character& original);\n \n \/**\n * Move operator\n * \n * @param original The moved object, its resourced will be moved\n * @return The invoked object\n *\/\n virtual Character& operator =(Character&& original);\n \n };\n}\n\n\n#endif\/\/__ITEM__\n\n<commit_msg>remove character.hpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ client-cpp.cc\n\/\/ C++ CORBA client interface for SceneViewer.\n\/\/\n\/\/ Created by Mathieu Geisert in December 2014.\n\/\/ Copyright (c) 2014 LAAS-CNRS. All rights reserved.\n\/\/\n\n#include <gepetto\/viewer\/corba\/client.hh>\n\nnamespace graphics { \nnamespace corbaServer {\n\nvoid ClientCpp::se3ToCorba(CORBA::Double* corbaPosition, const se3::SE3& se3position)\n{\n Eigen::Quaternion<double> q(se3position.rotation());\n corbaPosition[0] = se3position.translation()(0);\n corbaPosition[1] = se3position.translation()(1);\n corbaPosition[2] = se3position.translation()(2); \n corbaPosition[3] = q.w();\n corbaPosition[4] = q.x();\n corbaPosition[5] = q.y();\n corbaPosition[5] = q.z(); \n}\n\nClientCpp::ClientCpp()\n{\n int argc=0; \/\/ Dummy variables to support following call.\n char** argv=0;\n orb_ = CORBA::ORB_init(argc, argv);\n\n \/\/ Get a reference to the Naming Service\n CORBA::Object_var rootContextObj = \n orb_->resolve_initial_references(\"NameService\");\n CosNaming::NamingContext_var nc =\n\tCosNaming::NamingContext::_narrow(rootContextObj.in());\n\n CosNaming::Name name;\n name.length(2);\n name[0].id = (const char *) \"gepetto\";\n name[0].kind = (const char *) \"viewer\";\n name[1].id = (const char *) \"corbaserver\";\n name[1].kind = (const char *) \"gui\";\n \/\/ Invoke the root context to retrieve the object reference\n CORBA::Object_var managerObj = nc->resolve(name);\n \/\/ Narrow the previous object to obtain the correct type\n manager_ =\n gepetto::corbaserver::GraphicalInterface::_narrow(managerObj.in());\n}\n\nClientCpp::~ClientCpp()\n{\n \/\/manager_->shutdown();\n if (!CORBA::is_nil(orb_)) {\n\ttry {\n\t orb_->destroy();\n\t std::cout << \"Ending CORBA...\" << std::endl;\n\t} catch(const CORBA::Exception& e) {\n\t std::cout << \"orb->destroy failed\" << std::endl;\n\t}\n }\n}\n\nvoid ClientCpp::getNodeList()\n{\n manager_->getNodeList();\n}\n\n\nvoid ClientCpp::getWindowList()\n{\n manager_->getWindowList();\n}\n\nbool ClientCpp::setRate(int rate)\n{\n return manager_->setRate(rate);\n}\n\nvoid ClientCpp::refresh()\n{\n manager_->refresh();\n}\n\nClientCpp::WindowID ClientCpp::createWindow(const char* windowName)\n{\n return manager_->createWindow(windowName);\n}\n\n\n \/\/void ClientCpp::createWindow(const char* name, CORBA::ULong x, CORBA::ULong y, CORBA::ULong width, CORBA::ULong height) ;\n\nvoid ClientCpp::createScene(const char* sceneName)\n{\n manager_->createScene(sceneName);\n}\n\nvoid ClientCpp::createSceneWithFloor(const char* sceneName)\n{\n manager_->createSceneWithFloor(sceneName);\n}\n\nbool ClientCpp::addSceneToWindow(const char* sceneName, const ClientCpp::WindowID windowId)\n{\n return manager_->addSceneToWindow(sceneName, windowId);\n}\n\n\/*bool ClientCpp::addBox(const char* boxName, float boxSize1, float boxSize2, float boxSize3)\n{\n return manager_->addBox(boxName, boxSize1, boxSize2, boxSize3);\n}*\/\n\nbool ClientCpp::addBox(const char* boxName, const float boxSize1, const float boxSize2, const float boxSize3, const double* color)\n{\n return manager_->addBox(boxName, boxSize1, boxSize2, boxSize3, color);\n}\n\n\/*bool ClientCpp::addCapsule(const char* capsuleName, float radius, float height)\n{\n return manager_->addCapsule(capsuleName, radius, height);\n}*\/\n\nbool ClientCpp::addCapsule(const char* capsuleName, const float radius, const float height, const double* color)\n{\n return manager_->addCapsule(capsuleName, radius, height, color);\n}\n\nbool ClientCpp::addMesh(const char* meshName, const char* meshPath)\n{\n return manager_->addMesh(meshName, meshPath);\n}\n\n\/*bool ClientCpp::addCone(const char* coneName, float radius, float height)\n{\n return manager_->addCone(coneName, radius, height);\n}*\/\n\nbool ClientCpp::addCone(const char* coneName, const float radius, const float height, const double* color)\n{\n return manager_->addCone(coneName, radius, height, color);\n}\n\n\/*bool ClientCpp::addCylinder(const char* cylinderName, float radius, float height)\n{\n return manager_->addCylinder(cylinderName, radius, height);\n}*\/\n\nbool ClientCpp::addCylinder(const char* cylinderName, const float radius, const float height, const double* color)\n{\n return manager_->addCylinder(cylinderName, radius, height, color);\n}\n\n\/*bool ClientCpp::addSphere(const char* sphereName, float radius)\n{\n return manager_->addSphere(sphereName, radius);\n}*\/\n\nbool ClientCpp::addSphere(const char* sphereName, const float radius, const double* color)\n{\n return manager_->addSphere(sphereName, radius, color);\n}\n\nbool ClientCpp::addLine(const char* lineName, const double* pos1, const double* pos2, const double* color)\n{\n return manager_->addLine(lineName, pos1, pos2, color);\n}\n\nbool ClientCpp::addTriangleFace(const char* faceName, const double* pos1, const double* pos2, const double* pos3, const double* color)\n{\n return manager_->addTriangleFace(faceName, pos1, pos2, pos3, color);\n}\n\nbool ClientCpp::addSquareFace(const char* faceName, const double* pos1, const double* pos2, const double* pos3, const double* pos4, const double* color)\n{\n return manager_->addSquareFace(faceName, pos1, pos2, pos3, pos4, color);\n}\n\nbool ClientCpp::addURDF(const char* urdfName, const char* urdfPath, const char* urdfPackagePath)\n{\n return manager_->addURDF(urdfName, urdfPath, urdfPackagePath);\n}\n\nbool ClientCpp::createGroup(const char* groupName)\n{\n return manager_->createGroup(groupName);\n}\n\nbool ClientCpp::addToGroup(const char* nodeName, const char* groupName)\n{\n return manager_->addToGroup(nodeName, groupName);\n}\n\nbool ClientCpp::applyConfiguration(const char* nodeName, const se3::SE3& se3position)\n{\n CORBA::Double corbaPosition[7];\n ClientCpp::se3ToCorba(corbaPosition, se3position);\n return manager_->applyConfiguration(nodeName, corbaPosition);\n}\n\nbool ClientCpp::setVisibility(const char* nodeName, const char* visibilityMode)\n{\n return manager_->setVisibility(nodeName, visibilityMode);\n}\n\nbool ClientCpp::setWireFrameMode(const char* nodeName, const char* wireFrameMode)\n{\n return manager_->setWireFrameMode(nodeName, wireFrameMode);\n}\nbool ClientCpp::setLightingMode(const char* nodeName, const char* lightingMode)\n{\n return manager_->setLightingMode(nodeName, lightingMode);\n}\n\nbool ClientCpp::startCapture (const WindowID windowId, const char* filename, const char* extension)\n{\n return manager_->startCapture (windowId, filename, extension);\n}\n\nbool ClientCpp::stopCapture (const WindowID windowId)\n{\n return manager_->stopCapture (windowId);\n}\n\nbool ClientCpp::writeNodeFile (const WindowID windowId, const char* filename)\n{\n return manager_->writeNodeFile (windowId, filename);\n}\n\n} \/\/ end of namespace corbaserver\n} \/\/ end of namespace graphics\n<commit_msg>[Bug fixed] Fix bug about se3 transformation to corba data<commit_after>\/\/\n\/\/ client-cpp.cc\n\/\/ C++ CORBA client interface for SceneViewer.\n\/\/\n\/\/ Created by Mathieu Geisert in December 2014.\n\/\/ Copyright (c) 2014 LAAS-CNRS. All rights reserved.\n\/\/\n\n#include <gepetto\/viewer\/corba\/client.hh>\n\nnamespace graphics { \nnamespace corbaServer {\n\nvoid ClientCpp::se3ToCorba(CORBA::Double* corbaPosition, const se3::SE3& se3position)\n{\n Eigen::Quaternion<double> q(se3position.rotation());\n corbaPosition[0] = se3position.translation()(0);\n corbaPosition[1] = se3position.translation()(1);\n corbaPosition[2] = se3position.translation()(2); \n corbaPosition[3] = q.w();\n corbaPosition[4] = q.x();\n corbaPosition[5] = q.y();\n corbaPosition[6] = q.z(); \n}\n\nClientCpp::ClientCpp()\n{\n int argc=0; \/\/ Dummy variables to support following call.\n char** argv=0;\n orb_ = CORBA::ORB_init(argc, argv);\n\n \/\/ Get a reference to the Naming Service\n CORBA::Object_var rootContextObj = \n orb_->resolve_initial_references(\"NameService\");\n CosNaming::NamingContext_var nc =\n\tCosNaming::NamingContext::_narrow(rootContextObj.in());\n\n CosNaming::Name name;\n name.length(2);\n name[0].id = (const char *) \"gepetto\";\n name[0].kind = (const char *) \"viewer\";\n name[1].id = (const char *) \"corbaserver\";\n name[1].kind = (const char *) \"gui\";\n \/\/ Invoke the root context to retrieve the object reference\n CORBA::Object_var managerObj = nc->resolve(name);\n \/\/ Narrow the previous object to obtain the correct type\n manager_ =\n gepetto::corbaserver::GraphicalInterface::_narrow(managerObj.in());\n}\n\nClientCpp::~ClientCpp()\n{\n \/\/manager_->shutdown();\n if (!CORBA::is_nil(orb_)) {\n\ttry {\n\t orb_->destroy();\n\t std::cout << \"Ending CORBA...\" << std::endl;\n\t} catch(const CORBA::Exception& e) {\n\t std::cout << \"orb->destroy failed\" << std::endl;\n\t}\n }\n}\n\nvoid ClientCpp::getNodeList()\n{\n manager_->getNodeList();\n}\n\n\nvoid ClientCpp::getWindowList()\n{\n manager_->getWindowList();\n}\n\nbool ClientCpp::setRate(int rate)\n{\n return manager_->setRate(rate);\n}\n\nvoid ClientCpp::refresh()\n{\n manager_->refresh();\n}\n\nClientCpp::WindowID ClientCpp::createWindow(const char* windowName)\n{\n return manager_->createWindow(windowName);\n}\n\n\n \/\/void ClientCpp::createWindow(const char* name, CORBA::ULong x, CORBA::ULong y, CORBA::ULong width, CORBA::ULong height) ;\n\nvoid ClientCpp::createScene(const char* sceneName)\n{\n manager_->createScene(sceneName);\n}\n\nvoid ClientCpp::createSceneWithFloor(const char* sceneName)\n{\n manager_->createSceneWithFloor(sceneName);\n}\n\nbool ClientCpp::addSceneToWindow(const char* sceneName, const ClientCpp::WindowID windowId)\n{\n return manager_->addSceneToWindow(sceneName, windowId);\n}\n\n\/*bool ClientCpp::addBox(const char* boxName, float boxSize1, float boxSize2, float boxSize3)\n{\n return manager_->addBox(boxName, boxSize1, boxSize2, boxSize3);\n}*\/\n\nbool ClientCpp::addBox(const char* boxName, const float boxSize1, const float boxSize2, const float boxSize3, const double* color)\n{\n return manager_->addBox(boxName, boxSize1, boxSize2, boxSize3, color);\n}\n\n\/*bool ClientCpp::addCapsule(const char* capsuleName, float radius, float height)\n{\n return manager_->addCapsule(capsuleName, radius, height);\n}*\/\n\nbool ClientCpp::addCapsule(const char* capsuleName, const float radius, const float height, const double* color)\n{\n return manager_->addCapsule(capsuleName, radius, height, color);\n}\n\nbool ClientCpp::addMesh(const char* meshName, const char* meshPath)\n{\n return manager_->addMesh(meshName, meshPath);\n}\n\n\/*bool ClientCpp::addCone(const char* coneName, float radius, float height)\n{\n return manager_->addCone(coneName, radius, height);\n}*\/\n\nbool ClientCpp::addCone(const char* coneName, const float radius, const float height, const double* color)\n{\n return manager_->addCone(coneName, radius, height, color);\n}\n\n\/*bool ClientCpp::addCylinder(const char* cylinderName, float radius, float height)\n{\n return manager_->addCylinder(cylinderName, radius, height);\n}*\/\n\nbool ClientCpp::addCylinder(const char* cylinderName, const float radius, const float height, const double* color)\n{\n return manager_->addCylinder(cylinderName, radius, height, color);\n}\n\n\/*bool ClientCpp::addSphere(const char* sphereName, float radius)\n{\n return manager_->addSphere(sphereName, radius);\n}*\/\n\nbool ClientCpp::addSphere(const char* sphereName, const float radius, const double* color)\n{\n return manager_->addSphere(sphereName, radius, color);\n}\n\nbool ClientCpp::addLine(const char* lineName, const double* pos1, const double* pos2, const double* color)\n{\n return manager_->addLine(lineName, pos1, pos2, color);\n}\n\nbool ClientCpp::addTriangleFace(const char* faceName, const double* pos1, const double* pos2, const double* pos3, const double* color)\n{\n return manager_->addTriangleFace(faceName, pos1, pos2, pos3, color);\n}\n\nbool ClientCpp::addSquareFace(const char* faceName, const double* pos1, const double* pos2, const double* pos3, const double* pos4, const double* color)\n{\n return manager_->addSquareFace(faceName, pos1, pos2, pos3, pos4, color);\n}\n\nbool ClientCpp::addURDF(const char* urdfName, const char* urdfPath, const char* urdfPackagePath)\n{\n return manager_->addURDF(urdfName, urdfPath, urdfPackagePath);\n}\n\nbool ClientCpp::createGroup(const char* groupName)\n{\n return manager_->createGroup(groupName);\n}\n\nbool ClientCpp::addToGroup(const char* nodeName, const char* groupName)\n{\n return manager_->addToGroup(nodeName, groupName);\n}\n\nbool ClientCpp::applyConfiguration(const char* nodeName, const se3::SE3& se3position)\n{\n CORBA::Double corbaPosition[7];\n ClientCpp::se3ToCorba(corbaPosition, se3position);\n return manager_->applyConfiguration(nodeName, corbaPosition);\n}\n\nbool ClientCpp::setVisibility(const char* nodeName, const char* visibilityMode)\n{\n return manager_->setVisibility(nodeName, visibilityMode);\n}\n\nbool ClientCpp::setWireFrameMode(const char* nodeName, const char* wireFrameMode)\n{\n return manager_->setWireFrameMode(nodeName, wireFrameMode);\n}\nbool ClientCpp::setLightingMode(const char* nodeName, const char* lightingMode)\n{\n return manager_->setLightingMode(nodeName, lightingMode);\n}\n\nbool ClientCpp::startCapture (const WindowID windowId, const char* filename, const char* extension)\n{\n return manager_->startCapture (windowId, filename, extension);\n}\n\nbool ClientCpp::stopCapture (const WindowID windowId)\n{\n return manager_->stopCapture (windowId);\n}\n\nbool ClientCpp::writeNodeFile (const WindowID windowId, const char* filename)\n{\n return manager_->writeNodeFile (windowId, filename);\n}\n\n} \/\/ end of namespace corbaserver\n} \/\/ end of namespace graphics\n<|endoftext|>"} {"text":"<commit_before>#include \"Ruby.h\"\n#include \"RubyObject.h\"\n#include \"common.h\"\n#include <cstring>\n#include <string>\n\nusing namespace v8;\n\nPersistent<Function> Ruby::s_getCtor;\nVALUE Ruby::BLOCK_WRAPPER_CLASS;\n\nvoid Ruby::Init(Handle<Object> module)\n{\n static char* argv[] = { (char*)\"norby\", (char*)\"-e\", (char*)\"\" };\n\n RUBY_INIT_STACK;\n ruby_init();\n ruby_options(3, argv);\n \n BLOCK_WRAPPER_CLASS = rb_define_class(\"BlockWrapper\", rb_cObject);\n \n node::AtExit(Cleanup);\n \n module->Set(NanNew<String>(\"exports\"),\n NanNew<FunctionTemplate>(New)->GetFunction());\n}\n\nvoid Ruby::Cleanup(void*)\n{\n log(\"Cleaning up!\");\n RubyObject::Cleanup();\n ruby_cleanup(0);\n}\n\nNAN_METHOD(Ruby::New)\n{\n NanScope();\n \n assert(args[0]->IsFunction());\n NanAssignPersistent(s_getCtor, args[0].As<Function>());\n \n Local<Object> bindings = NanNew<Object>();\n NODE_SET_METHOD(bindings, \"_getClass\", GetClass);\n NODE_SET_METHOD(bindings, \"_defineClass\", DefineClass);\n NODE_SET_METHOD(bindings, \"eval\", Eval);\n NODE_SET_METHOD(bindings, \"getMethod\", GetMethod);\n \/\/ TODO: Maybe we should load the constants here and place them in an object?\n NODE_SET_METHOD(bindings, \"getConstant\", GetConstant);\n \n NanReturnValue(bindings);\n}\n\nLocal<Function> Ruby::GetCtor(Local<Function> rubyClass)\n{\n NanEscapableScope();\n \n Local<Function> getCtor = NanNew<Function>(s_getCtor);\n Handle<Value> argv[] = { rubyClass };\n return NanEscapeScope(NanMakeCallback(NanGetCurrentContext()->Global(),\n getCtor, 1, argv).As<Function>());\n}\n\nstruct ConstGetter\n{\n ConstGetter(Handle<Value> nv) : nameVal(nv) {}\n VALUE operator()() const\n {\n NanScope();\n\n Local<String> constName = nameVal->ToString();\n String::Utf8Value constStr(constName);\n \n ID id;\n VALUE mod;\n const char* split = std::strstr(*constStr, \"::\");\n if (split) {\n id = rb_intern(split + 2);\n mod = rb_const_get(rb_cObject, rb_intern2(*constStr, split - *constStr));\n }\n else {\n id = rb_intern2(*constStr, constStr.length());\n mod = rb_cObject;\n }\n\n return rb_const_get(mod, id);\n }\n\n Handle<Value> nameVal;\n};\n\n\/\/ TODO: Should\/could we combine this with RubyObject::GetClass?\nNAN_METHOD(Ruby::GetClass)\n{\n NanScope();\n\n VALUE klass;\n SAFE_RUBY_CALL(klass, ConstGetter(args[0]));\n \n if (TYPE(klass) != T_CLASS) {\n std::string msg(*String::Utf8Value(args[0]));\n msg.append(\" is not a class\");\n NanThrowTypeError(msg.c_str());\n NanReturnUndefined();\n }\n \n NanReturnValue(RubyObject::GetClass(klass));\n}\n\nstruct ClassDefiner\n{\n ClassDefiner(Handle<Value> nv, VALUE s) : nameVal(nv), super(s) {}\n VALUE operator()() const\n {\n NanScope();\n \n Local<String> className = nameVal->ToString();\n return rb_define_class(*String::Utf8Value(className), super);\n }\n \n Handle<Value> nameVal;\n VALUE super;\n};\n\nNAN_METHOD(Ruby::DefineClass)\n{\n NanScope();\n\n Local<String> name = args[0]->ToString();\n log(\"Inherit called for \" << *String::Utf8Value(name));\n\n VALUE super;\n SAFE_RUBY_CALL(super, ConstGetter(args[1]));\n VALUE klass;\n SAFE_RUBY_CALL(klass, ClassDefiner(args[0], super));\n \n NanReturnValue(RubyObject::GetClass(klass));\n}\n\nstruct EvalCaller\n{\n EvalCaller(const char* s) : str(s) {}\n VALUE operator()() const\n {\n return rb_eval_string(str);\n }\n\n const char* str;\n};\n\nNAN_METHOD(Ruby::Eval)\n{\n NanScope();\n\n Local<String> str = args[0]->ToString();\n VALUE res;\n SAFE_RUBY_CALL(res, EvalCaller(*String::Utf8Value(str)));\n\n NanReturnValue(rubyToV8(res));\n}\n\nNAN_METHOD(CallMethod)\n{\n NanScope();\n NanReturnValue(CallRubyFromV8(rb_cObject, args));\n}\n\n\/\/ TODO: Should this throw immediately if the function doesnt exist?\nNAN_METHOD(Ruby::GetMethod)\n{\n NanScope();\n\n Local<String> name = args[0]->ToString();\n ID methodID = rb_intern(*String::Utf8Value(name));\n Local<Function> func =\n NanNew<FunctionTemplate>(CallMethod, EXTERNAL_WRAP((void*)methodID))->GetFunction();\n func->SetName(name);\n\n NanReturnValue(func);\n}\n\nNAN_METHOD(Ruby::GetConstant)\n{\n NanScope();\n\n VALUE constant;\n SAFE_RUBY_CALL(constant, ConstGetter(args[0]));\n \n \/\/ TODO: Should we allow getting classes this way? Maybe throw an exception?\n NanReturnValue(rubyToV8(constant));\n}\n<commit_msg>Fixed compiler warning<commit_after>#include \"Ruby.h\"\n#include \"RubyObject.h\"\n#include \"common.h\"\n#include <cstring>\n#include <string>\n\nusing namespace v8;\n\nPersistent<Function> Ruby::s_getCtor;\nVALUE Ruby::BLOCK_WRAPPER_CLASS;\n\nvoid Ruby::Init(Handle<Object> module)\n{\n static char* argv[] = { (char*)\"norby\", (char*)\"-e\", (char*)\"\" };\n\n RUBY_INIT_STACK;\n ruby_init();\n ruby_options(3, argv);\n\n BLOCK_WRAPPER_CLASS = rb_define_class(\"BlockWrapper\", rb_cObject);\n\n node::AtExit(Cleanup);\n\n module->Set(NanNew<String>(\"exports\"),\n NanNew<FunctionTemplate>(New)->GetFunction());\n}\n\nvoid Ruby::Cleanup(void*)\n{\n log(\"Cleaning up!\");\n RubyObject::Cleanup();\n ruby_cleanup(0);\n}\n\nNAN_METHOD(Ruby::New)\n{\n NanScope();\n\n assert(args[0]->IsFunction());\n NanAssignPersistent(s_getCtor, args[0].As<Function>());\n\n Local<Object> bindings = NanNew<Object>();\n NODE_SET_METHOD(bindings, \"_getClass\", GetClass);\n NODE_SET_METHOD(bindings, \"_defineClass\", DefineClass);\n NODE_SET_METHOD(bindings, \"eval\", Eval);\n NODE_SET_METHOD(bindings, \"getMethod\", GetMethod);\n \/\/ TODO: Maybe we should load the constants here and place them in an object?\n NODE_SET_METHOD(bindings, \"getConstant\", GetConstant);\n\n NanReturnValue(bindings);\n}\n\nLocal<Function> Ruby::GetCtor(Local<Function> rubyClass)\n{\n NanEscapableScope();\n\n Local<Function> getCtor = NanNew<Function>(s_getCtor);\n Handle<Value> argv[] = { rubyClass };\n return NanEscapeScope(NanMakeCallback(NanGetCurrentContext()->Global(),\n getCtor, 1, argv).As<Function>());\n}\n\nstruct ConstGetter\n{\n ConstGetter(Handle<Value> nv) : nameVal(nv) {}\n VALUE operator()() const\n {\n NanScope();\n\n Local<String> constName = nameVal->ToString();\n String::Utf8Value constStr(constName);\n\n ID id;\n VALUE mod;\n const char* split = std::strstr(*constStr, \"::\");\n if (split) {\n id = rb_intern(split + 2);\n mod = rb_const_get(rb_cObject, rb_intern2(*constStr, split - *constStr));\n }\n else {\n id = rb_intern2(*constStr, constStr.length());\n mod = rb_cObject;\n }\n\n return rb_const_get(mod, id);\n }\n\n Handle<Value> nameVal;\n};\n\n\/\/ TODO: Should\/could we combine this with RubyObject::GetClass?\nNAN_METHOD(Ruby::GetClass)\n{\n NanScope();\n\n VALUE klass;\n SAFE_RUBY_CALL(klass, ConstGetter(args[0]));\n\n if (TYPE(klass) != T_CLASS) {\n std::string msg(*String::Utf8Value(args[0]));\n msg.append(\" is not a class\");\n NanThrowTypeError(msg.c_str());\n NanReturnUndefined();\n }\n\n NanReturnValue(RubyObject::GetClass(klass));\n}\n\nstruct ClassDefiner\n{\n ClassDefiner(Handle<Value> nv, VALUE s) : nameVal(nv), super(s) {}\n VALUE operator()() const\n {\n NanScope();\n\n Local<String> className = nameVal->ToString();\n return rb_define_class(*String::Utf8Value(className), super);\n }\n\n Handle<Value> nameVal;\n VALUE super;\n};\n\nNAN_METHOD(Ruby::DefineClass)\n{\n NanScope();\n\n log(\"Inherit called for \" << *String::Utf8Value(args[0]));\n\n VALUE super;\n SAFE_RUBY_CALL(super, ConstGetter(args[1]));\n VALUE klass;\n SAFE_RUBY_CALL(klass, ClassDefiner(args[0], super));\n\n NanReturnValue(RubyObject::GetClass(klass));\n}\n\nstruct EvalCaller\n{\n EvalCaller(const char* s) : str(s) {}\n VALUE operator()() const\n {\n return rb_eval_string(str);\n }\n\n const char* str;\n};\n\nNAN_METHOD(Ruby::Eval)\n{\n NanScope();\n\n Local<String> str = args[0]->ToString();\n VALUE res;\n SAFE_RUBY_CALL(res, EvalCaller(*String::Utf8Value(str)));\n\n NanReturnValue(rubyToV8(res));\n}\n\nNAN_METHOD(CallMethod)\n{\n NanScope();\n NanReturnValue(CallRubyFromV8(rb_cObject, args));\n}\n\n\/\/ TODO: Should this throw immediately if the function doesnt exist?\nNAN_METHOD(Ruby::GetMethod)\n{\n NanScope();\n\n Local<String> name = args[0]->ToString();\n ID methodID = rb_intern(*String::Utf8Value(name));\n Local<Function> func =\n NanNew<FunctionTemplate>(CallMethod, EXTERNAL_WRAP((void*)methodID))->GetFunction();\n func->SetName(name);\n\n NanReturnValue(func);\n}\n\nNAN_METHOD(Ruby::GetConstant)\n{\n NanScope();\n\n VALUE constant;\n SAFE_RUBY_CALL(constant, ConstGetter(args[0]));\n\n \/\/ TODO: Should we allow getting classes this way? Maybe throw an exception?\n NanReturnValue(rubyToV8(constant));\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-http\/httpconnectionpool.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include <fnord-fts\/fts.h>\n#include <fnord-fts\/fts_common.h>\n#include \"CustomerNamespace.h\"\n#include \"logjoin\/LogJoin.h\"\n#include \"logjoin\/LogJoinTarget.h\"\n#include \"logjoin\/LogJoinUpload.h\"\n#include \"DocStore.h\"\n#include \"IndexChangeRequest.h\"\n#include \"DocIndex.h\"\n#include \"ItemRef.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nstd::atomic<bool> cm_logjoin_shutdown;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n cm_logjoin_shutdown = true;\n}\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n \/* shutdown hook *\/\n cm_logjoin_shutdown = false;\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = quit;\n sigaction(SIGTERM, &sa, NULL);\n sigaction(SIGQUIT, &sa, NULL);\n sigaction(SIGINT, &sa, NULL);\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"conf\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n \".\/conf\",\n \"conf directory\",\n \"<path>\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"data dir\",\n \"<path>\");\n\n flags.defineFlag(\n \"index\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"index directory\",\n \"<path>\");\n\n flags.defineFlag(\n \"publish_to\",\n fnord::cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"upload target url\",\n \"<addr>\");\n\n flags.defineFlag(\n \"statsd_addr\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"127.0.0.1:8192\",\n \"Statsd addr\",\n \"<addr>\");\n\n flags.defineFlag(\n \"batch_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"2048\",\n \"batch_size\",\n \"<num>\");\n\n flags.defineFlag(\n \"buffer_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8192\",\n \"buffer_size\",\n \"<num>\");\n\n flags.defineFlag(\n \"flush_interval\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"5\",\n \"flush_interval\",\n \"<num>\");\n\n flags.defineFlag(\n \"db_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"128\",\n \"max sessiondb size\",\n \"<MB>\");\n\n flags.defineFlag(\n \"no_dryrun\",\n fnord::cli::FlagParser::T_SWITCH,\n false,\n NULL,\n NULL,\n \"no dryrun\",\n \"<bool>\");\n\n flags.defineFlag(\n \"shard\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"shard\",\n \"<name>\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"<level>\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* schema... *\/\n auto joined_sessions_schema = joinedSessionsSchema();\n\n \/* start event loop *\/\n auto evloop_thread = std::thread([] {\n ev.run();\n });\n\n \/* set up rpc client *\/\n HTTPRPCClient rpc_client(&ev);\n http::HTTPConnectionPool http(&ev);\n\n \/* start stats reporting *\/\n fnord::stats::StatsdAgent statsd_agent(\n fnord::net::InetAddr::resolve(flags.getString(\"statsd_addr\")),\n 10 * fnord::kMicrosPerSecond);\n\n statsd_agent.start();\n\n \/* get logjoin shard *\/\n cm::LogJoinShardMap shard_map;\n auto shard = shard_map.getShard(flags.getString(\"shard\"));\n\n \/* set up logjoin *\/\n auto dry_run = !flags.isSet(\"no_dryrun\");\n size_t batch_size = flags.getInt(\"batch_size\");\n size_t buffer_size = flags.getInt(\"buffer_size\");\n size_t flush_interval = flags.getInt(\"flush_interval\");\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Starting cm-logjoin with:\\n dry_run=$0\\n batch_size=$1\\n\" \\\n \" buffer_size=$2\\n flush_interval=$9\\n\"\n \" max_dbsize=$4MB\\n\" \\\n \" shard=$5\\n shard_range=[$6, $7)\\n shard_modulo=$8\",\n dry_run,\n batch_size,\n buffer_size,\n 0,\n flags.getInt(\"db_size\"),\n shard.shard_name,\n shard.begin,\n shard.end,\n cm::LogJoinShard::modulo,\n flush_interval);\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Using session schema:\\n$0\",\n joined_sessions_schema.toString());\n\n \/* open session db *\/\n auto sessdb = mdb::MDB::open(\n flags.getString(\"datadir\"),\n false,\n 1000000 * flags.getInt(\"db_size\"),\n shard.shard_name + \".db\",\n shard.shard_name + \".db.lck\",\n false);\n\n \/* set up input feed reader *\/\n feeds::RemoteFeedReader feed_reader(&rpc_client);\n feed_reader.setMaxSpread(10 * kMicrosPerSecond);\n\n HashMap<String, URI> input_feeds;\n input_feeds.emplace(\n \"tracker_log.feedserver01.nue01.production.fnrd.net\",\n URI(\"http:\/\/s01.nue01.production.fnrd.net:7001\/rpc\"));\n input_feeds.emplace(\n \"tracker_log.feedserver02.nue01.production.fnrd.net\",\n URI(\"http:\/\/s02.nue01.production.fnrd.net:7001\/rpc\"));\n\n \/* setup time backfill *\/\n feed_reader.setTimeBackfill([] (const feeds::FeedEntry& entry) -> DateTime {\n const auto& log_line = entry.data;\n\n auto c_end = log_line.find(\"|\");\n if (c_end == std::string::npos) return 0;\n auto t_end = log_line.find(\"|\", c_end + 1);\n if (t_end == std::string::npos) return 0;\n\n auto timestr = log_line.substr(c_end + 1, t_end - c_end - 1);\n return std::stoul(timestr) * fnord::kMicrosPerSecond;\n });\n\n \/* open index *\/\n RefPtr<DocIndex> index(\n new DocIndex(\n flags.getString(\"index\"),\n \"documents-dawanda\",\n true));\n\n \/* set up logjoin target *\/\n fnord::fts::Analyzer analyzer(flags.getString(\"conf\"));\n cm::LogJoinTarget logjoin_target(\n joined_sessions_schema,\n &analyzer,\n index,\n dry_run);\n\n \/* set up logjoin upload *\/\n cm::LogJoinUpload logjoin_upload(\n sessdb,\n flags.getString(\"publish_to\"),\n &http);\n\n \/* setup logjoin *\/\n cm::LogJoin logjoin(shard, dry_run, &logjoin_target);\n logjoin.exportStats(\"\/cm-logjoin\/global\");\n logjoin.exportStats(StringUtil::format(\"\/cm-logjoin\/$0\", shard.shard_name));\n\n fnord::stats::Counter<uint64_t> stat_stream_time_low;\n fnord::stats::Counter<uint64_t> stat_stream_time_high;\n fnord::stats::Counter<uint64_t> stat_active_sessions;\n fnord::stats::Counter<uint64_t> stat_dbsize;\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_low\", shard.shard_name),\n &stat_stream_time_low,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_high\", shard.shard_name),\n &stat_stream_time_high,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/active_sessions\", shard.shard_name),\n &stat_active_sessions,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/dbsize\", shard.shard_name),\n &stat_dbsize,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n\n \/* upload pending q *\/\n if (!dry_run) {\n logjoin_upload.upload();\n }\n\n \/* resume from last offset *\/\n auto txn = sessdb->startTransaction(true);\n try {\n logjoin.importTimeoutList(txn.get());\n\n for (const auto& input_feed : input_feeds) {\n uint64_t offset = 0;\n\n auto last_offset = txn->get(\n StringUtil::format(\"__logjoin_offset~$0\", input_feed.first));\n\n if (!last_offset.isEmpty()) {\n offset = std::stoul(last_offset.get().toString());\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Adding source feed:\\n feed=$0\\n url=$1\\n offset: $2\",\n input_feed.first,\n input_feed.second.toString(),\n offset);\n\n feed_reader.addSourceFeed(\n input_feed.second,\n input_feed.first,\n offset,\n batch_size,\n buffer_size);\n }\n\n txn->abort();\n } catch (...) {\n txn->abort();\n throw;\n }\n\n fnord::logInfo(\"cm.logjoin\", \"Resuming logjoin...\");\n\n DateTime last_flush;\n uint64_t rate_limit_micros = flush_interval * kMicrosPerSecond;\n\n for (;;) {\n auto begin = WallClock::unixMicros();\n\n feed_reader.fillBuffers();\n auto txn = sessdb->startTransaction();\n\n int i = 0;\n for (; i < batch_size; ++i) {\n auto entry = feed_reader.fetchNextEntry();\n\n if (entry.isEmpty()) {\n break;\n }\n\n try {\n logjoin.insertLogline(entry.get().data, txn.get());\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"invalid log line\");\n }\n }\n\n auto watermarks = feed_reader.watermarks();\n\n auto etime = WallClock::now().unixMicros() - last_flush.unixMicros();\n if (etime > rate_limit_micros) {\n last_flush = WallClock::now();\n logjoin.flush(txn.get(), watermarks.first);\n }\n\n auto stream_offsets = feed_reader.streamOffsets();\n String stream_offsets_str;\n\n for (const auto& soff : stream_offsets) {\n txn->update(\n StringUtil::format(\"__logjoin_offset~$0\", soff.first),\n StringUtil::toString(soff.second));\n\n stream_offsets_str +=\n StringUtil::format(\"\\n offset[$0]=$1\", soff.first, soff.second);\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"LogJoin comitting...\\n stream_time=<$0 ... $1>\\n\" \\\n \" active_sessions=$2\\n flushed_sessions=$3$4\",\n watermarks.first,\n watermarks.second,\n logjoin.numSessions(),\n logjoin_target.num_sessions,\n stream_offsets_str);\n\n if (dry_run) {\n txn->abort();\n } else {\n txn->commit();\n\n try {\n logjoin_upload.upload();\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"upload failed\");\n }\n }\n\n if (cm_logjoin_shutdown.load()) {\n break;\n }\n\n stat_stream_time_low.set(watermarks.first.unixMicros());\n stat_stream_time_high.set(watermarks.second.unixMicros());\n stat_active_sessions.set(logjoin.numSessions());\n \/\/stat_dbsize.set(FileUtil::du_c(flags.getString(\"datadir\"));\n\n auto rtime = WallClock::unixMicros() - begin;\n auto rlimit = kMicrosPerSecond;\n if (i < 2 && rtime < rlimit) {\n usleep(rlimit - rtime);\n }\n }\n\n ev.shutdown();\n evloop_thread.join();\n\n sessdb->sync();\n fnord::logInfo(\"cm.logjoin\", \"LogJoin exiting...\");\n return 0;\n}\n\n<commit_msg>don't read from nue01<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-http\/httpconnectionpool.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include <fnord-fts\/fts.h>\n#include <fnord-fts\/fts_common.h>\n#include \"CustomerNamespace.h\"\n#include \"logjoin\/LogJoin.h\"\n#include \"logjoin\/LogJoinTarget.h\"\n#include \"logjoin\/LogJoinUpload.h\"\n#include \"DocStore.h\"\n#include \"IndexChangeRequest.h\"\n#include \"DocIndex.h\"\n#include \"ItemRef.h\"\n#include \"common.h\"\n#include \"schemas.h\"\n\nusing namespace cm;\nusing namespace fnord;\n\nstd::atomic<bool> cm_logjoin_shutdown;\nfnord::thread::EventLoop ev;\n\nvoid quit(int n) {\n cm_logjoin_shutdown = true;\n}\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n \/* shutdown hook *\/\n cm_logjoin_shutdown = false;\n struct sigaction sa;\n memset(&sa, 0, sizeof(struct sigaction));\n sa.sa_handler = quit;\n sigaction(SIGTERM, &sa, NULL);\n sigaction(SIGQUIT, &sa, NULL);\n sigaction(SIGINT, &sa, NULL);\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"conf\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n \".\/conf\",\n \"conf directory\",\n \"<path>\");\n\n flags.defineFlag(\n \"datadir\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"data dir\",\n \"<path>\");\n\n flags.defineFlag(\n \"index\",\n cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"index directory\",\n \"<path>\");\n\n flags.defineFlag(\n \"publish_to\",\n fnord::cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"upload target url\",\n \"<addr>\");\n\n flags.defineFlag(\n \"statsd_addr\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"127.0.0.1:8192\",\n \"Statsd addr\",\n \"<addr>\");\n\n flags.defineFlag(\n \"batch_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"2048\",\n \"batch_size\",\n \"<num>\");\n\n flags.defineFlag(\n \"buffer_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8192\",\n \"buffer_size\",\n \"<num>\");\n\n flags.defineFlag(\n \"flush_interval\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"5\",\n \"flush_interval\",\n \"<num>\");\n\n flags.defineFlag(\n \"db_size\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"128\",\n \"max sessiondb size\",\n \"<MB>\");\n\n flags.defineFlag(\n \"no_dryrun\",\n fnord::cli::FlagParser::T_SWITCH,\n false,\n NULL,\n NULL,\n \"no dryrun\",\n \"<bool>\");\n\n flags.defineFlag(\n \"shard\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n NULL,\n \"shard\",\n \"<name>\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"<level>\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* schema... *\/\n auto joined_sessions_schema = joinedSessionsSchema();\n\n \/* start event loop *\/\n auto evloop_thread = std::thread([] {\n ev.run();\n });\n\n \/* set up rpc client *\/\n HTTPRPCClient rpc_client(&ev);\n http::HTTPConnectionPool http(&ev);\n\n \/* start stats reporting *\/\n fnord::stats::StatsdAgent statsd_agent(\n fnord::net::InetAddr::resolve(flags.getString(\"statsd_addr\")),\n 10 * fnord::kMicrosPerSecond);\n\n statsd_agent.start();\n\n \/* get logjoin shard *\/\n cm::LogJoinShardMap shard_map;\n auto shard = shard_map.getShard(flags.getString(\"shard\"));\n\n \/* set up logjoin *\/\n auto dry_run = !flags.isSet(\"no_dryrun\");\n size_t batch_size = flags.getInt(\"batch_size\");\n size_t buffer_size = flags.getInt(\"buffer_size\");\n size_t flush_interval = flags.getInt(\"flush_interval\");\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Starting cm-logjoin with:\\n dry_run=$0\\n batch_size=$1\\n\" \\\n \" buffer_size=$2\\n flush_interval=$9\\n\"\n \" max_dbsize=$4MB\\n\" \\\n \" shard=$5\\n shard_range=[$6, $7)\\n shard_modulo=$8\",\n dry_run,\n batch_size,\n buffer_size,\n 0,\n flags.getInt(\"db_size\"),\n shard.shard_name,\n shard.begin,\n shard.end,\n cm::LogJoinShard::modulo,\n flush_interval);\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Using session schema:\\n$0\",\n joined_sessions_schema.toString());\n\n \/* open session db *\/\n auto sessdb = mdb::MDB::open(\n flags.getString(\"datadir\"),\n false,\n 1000000 * flags.getInt(\"db_size\"),\n shard.shard_name + \".db\",\n shard.shard_name + \".db.lck\",\n false);\n\n \/* set up input feed reader *\/\n feeds::RemoteFeedReader feed_reader(&rpc_client);\n feed_reader.setMaxSpread(10 * kMicrosPerSecond);\n\n HashMap<String, URI> input_feeds;\n \/\/input_feeds.emplace(\n \/\/ \"tracker_log.feedserver01.nue01.production.fnrd.net\",\n \/\/ URI(\"http:\/\/s01.nue01.production.fnrd.net:7001\/rpc\"));\n input_feeds.emplace(\n \"tracker_log.feedserver02.nue01.production.fnrd.net\",\n URI(\"http:\/\/s02.nue01.production.fnrd.net:7001\/rpc\"));\n\n \/* setup time backfill *\/\n feed_reader.setTimeBackfill([] (const feeds::FeedEntry& entry) -> DateTime {\n const auto& log_line = entry.data;\n\n auto c_end = log_line.find(\"|\");\n if (c_end == std::string::npos) return 0;\n auto t_end = log_line.find(\"|\", c_end + 1);\n if (t_end == std::string::npos) return 0;\n\n auto timestr = log_line.substr(c_end + 1, t_end - c_end - 1);\n return std::stoul(timestr) * fnord::kMicrosPerSecond;\n });\n\n \/* open index *\/\n RefPtr<DocIndex> index(\n new DocIndex(\n flags.getString(\"index\"),\n \"documents-dawanda\",\n true));\n\n \/* set up logjoin target *\/\n fnord::fts::Analyzer analyzer(flags.getString(\"conf\"));\n cm::LogJoinTarget logjoin_target(\n joined_sessions_schema,\n &analyzer,\n index,\n dry_run);\n\n \/* set up logjoin upload *\/\n cm::LogJoinUpload logjoin_upload(\n sessdb,\n flags.getString(\"publish_to\"),\n &http);\n\n \/* setup logjoin *\/\n cm::LogJoin logjoin(shard, dry_run, &logjoin_target);\n logjoin.exportStats(\"\/cm-logjoin\/global\");\n logjoin.exportStats(StringUtil::format(\"\/cm-logjoin\/$0\", shard.shard_name));\n\n fnord::stats::Counter<uint64_t> stat_stream_time_low;\n fnord::stats::Counter<uint64_t> stat_stream_time_high;\n fnord::stats::Counter<uint64_t> stat_active_sessions;\n fnord::stats::Counter<uint64_t> stat_dbsize;\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_low\", shard.shard_name),\n &stat_stream_time_low,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/stream_time_high\", shard.shard_name),\n &stat_stream_time_high,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/active_sessions\", shard.shard_name),\n &stat_active_sessions,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n exportStat(\n StringUtil::format(\"\/cm-logjoin\/$0\/dbsize\", shard.shard_name),\n &stat_dbsize,\n fnord::stats::ExportMode::EXPORT_VALUE);\n\n\n \/* upload pending q *\/\n if (!dry_run) {\n logjoin_upload.upload();\n }\n\n \/* resume from last offset *\/\n auto txn = sessdb->startTransaction(true);\n try {\n logjoin.importTimeoutList(txn.get());\n\n for (const auto& input_feed : input_feeds) {\n uint64_t offset = 0;\n\n auto last_offset = txn->get(\n StringUtil::format(\"__logjoin_offset~$0\", input_feed.first));\n\n if (!last_offset.isEmpty()) {\n offset = std::stoul(last_offset.get().toString());\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"Adding source feed:\\n feed=$0\\n url=$1\\n offset: $2\",\n input_feed.first,\n input_feed.second.toString(),\n offset);\n\n feed_reader.addSourceFeed(\n input_feed.second,\n input_feed.first,\n offset,\n batch_size,\n buffer_size);\n }\n\n txn->abort();\n } catch (...) {\n txn->abort();\n throw;\n }\n\n fnord::logInfo(\"cm.logjoin\", \"Resuming logjoin...\");\n\n DateTime last_flush;\n uint64_t rate_limit_micros = flush_interval * kMicrosPerSecond;\n\n for (;;) {\n auto begin = WallClock::unixMicros();\n\n feed_reader.fillBuffers();\n auto txn = sessdb->startTransaction();\n\n int i = 0;\n for (; i < batch_size; ++i) {\n auto entry = feed_reader.fetchNextEntry();\n\n if (entry.isEmpty()) {\n break;\n }\n\n try {\n logjoin.insertLogline(entry.get().data, txn.get());\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"invalid log line\");\n }\n }\n\n auto watermarks = feed_reader.watermarks();\n\n auto etime = WallClock::now().unixMicros() - last_flush.unixMicros();\n if (etime > rate_limit_micros) {\n last_flush = WallClock::now();\n logjoin.flush(txn.get(), watermarks.first);\n }\n\n auto stream_offsets = feed_reader.streamOffsets();\n String stream_offsets_str;\n\n for (const auto& soff : stream_offsets) {\n txn->update(\n StringUtil::format(\"__logjoin_offset~$0\", soff.first),\n StringUtil::toString(soff.second));\n\n stream_offsets_str +=\n StringUtil::format(\"\\n offset[$0]=$1\", soff.first, soff.second);\n }\n\n fnord::logInfo(\n \"cm.logjoin\",\n \"LogJoin comitting...\\n stream_time=<$0 ... $1>\\n\" \\\n \" active_sessions=$2\\n flushed_sessions=$3$4\",\n watermarks.first,\n watermarks.second,\n logjoin.numSessions(),\n logjoin_target.num_sessions,\n stream_offsets_str);\n\n if (dry_run) {\n txn->abort();\n } else {\n txn->commit();\n\n try {\n logjoin_upload.upload();\n } catch (const std::exception& e) {\n fnord::logError(\"cm.logjoin\", e, \"upload failed\");\n }\n }\n\n if (cm_logjoin_shutdown.load()) {\n break;\n }\n\n stat_stream_time_low.set(watermarks.first.unixMicros());\n stat_stream_time_high.set(watermarks.second.unixMicros());\n stat_active_sessions.set(logjoin.numSessions());\n \/\/stat_dbsize.set(FileUtil::du_c(flags.getString(\"datadir\"));\n\n auto rtime = WallClock::unixMicros() - begin;\n auto rlimit = kMicrosPerSecond;\n if (i < 2 && rtime < rlimit) {\n usleep(rlimit - rtime);\n }\n }\n\n ev.shutdown();\n evloop_thread.join();\n\n sessdb->sync();\n fnord::logInfo(\"cm.logjoin\", \"LogJoin exiting...\");\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n\n#include \"SkArithmeticMode.h\"\n#include \"SkDevice.h\"\n#include \"SkBitmapSource.h\"\n#include \"SkBlurImageFilter.h\"\n#include \"SkColorFilter.h\"\n#include \"SkColorFilterImageFilter.h\"\n#include \"SkColorMatrixFilter.h\"\n#include \"SkReadBuffer.h\"\n#include \"SkWriteBuffer.h\"\n#include \"SkMergeImageFilter.h\"\n#include \"SkMorphologyImageFilter.h\"\n#include \"SkTestImageFilters.h\"\n#include \"SkXfermodeImageFilter.h\"\n\n\/\/ More closely models how Blink's OffsetFilter works as of 10\/23\/13. SkOffsetImageFilter doesn't\n\/\/ perform a draw and this one does.\nclass SimpleOffsetFilter : public SkImageFilter {\npublic:\n class Registrar {\n public:\n Registrar() {\n SkFlattenable::Register(\"SimpleOffsetFilter\",\n SimpleOffsetFilter::CreateProc,\n SimpleOffsetFilter::GetFlattenableType());\n }\n };\n static SkImageFilter* Create(SkScalar dx, SkScalar dy, SkImageFilter* input) {\n return SkNEW_ARGS(SimpleOffsetFilter, (dx, dy, input));\n }\n\n virtual bool onFilterImage(Proxy* proxy, const SkBitmap& src, const Context& ctx,\n SkBitmap* dst, SkIPoint* offset) const override {\n SkBitmap source = src;\n SkImageFilter* input = getInput(0);\n SkIPoint srcOffset = SkIPoint::Make(0, 0);\n if (input && !input->filterImage(proxy, src, ctx, &source, &srcOffset)) {\n return false;\n }\n\n SkIRect bounds;\n if (!this->applyCropRect(ctx, proxy, source, &srcOffset, &bounds, &source)) {\n return false;\n }\n\n SkAutoTUnref<SkBaseDevice> device(proxy->createDevice(bounds.width(), bounds.height()));\n SkCanvas canvas(device);\n SkPaint paint;\n paint.setXfermodeMode(SkXfermode::kSrc_Mode);\n canvas.drawBitmap(source, fDX - bounds.left(), fDY - bounds.top(), &paint);\n *dst = device->accessBitmap(false);\n offset->fX += bounds.left();\n offset->fY += bounds.top();\n return true;\n }\n\n SK_TO_STRING_OVERRIDE()\n SK_DECLARE_PUBLIC_FLATTENABLE_DESERIALIZATION_PROCS(SimpleOffsetFilter);\n\nprotected:\n void flatten(SkWriteBuffer& buffer) const override {\n this->INHERITED::flatten(buffer);\n buffer.writeScalar(fDX);\n buffer.writeScalar(fDY);\n }\n\nprivate:\n SimpleOffsetFilter(SkScalar dx, SkScalar dy, SkImageFilter* input)\n : SkImageFilter(1, &input), fDX(dx), fDY(dy) {}\n\n SkScalar fDX, fDY;\n\n typedef SkImageFilter INHERITED;\n};\n\nstatic SimpleOffsetFilter::Registrar gReg;\n\nSkFlattenable* SimpleOffsetFilter::CreateProc(SkReadBuffer& buffer) {\n SK_IMAGEFILTER_UNFLATTEN_COMMON(common, 1);\n SkScalar dx = buffer.readScalar();\n SkScalar dy = buffer.readScalar();\n return Create(dx, dy, common.getInput(0));\n}\n\n#ifndef SK_IGNORE_TO_STRING\nvoid SimpleOffsetFilter::toString(SkString* str) const {\n str->appendf(\"SimpleOffsetFilter: (\");\n str->append(\")\");\n}\n#endif\n\nclass ImageFiltersGraphGM : public skiagm::GM {\npublic:\n ImageFiltersGraphGM() {}\n\nprotected:\n\n virtual SkString onShortName() {\n return SkString(\"imagefiltersgraph\");\n }\n\n void make_bitmap() {\n fBitmap.allocN32Pixels(100, 100);\n SkCanvas canvas(fBitmap);\n canvas.clear(0x00000000);\n SkPaint paint;\n paint.setAntiAlias(true);\n sk_tool_utils::set_portable_typeface(&paint);\n paint.setColor(0xFFFFFFFF);\n paint.setTextSize(SkIntToScalar(96));\n const char* str = \"e\";\n canvas.drawText(str, strlen(str), SkIntToScalar(20), SkIntToScalar(70), paint);\n }\n\n void drawClippedBitmap(SkCanvas* canvas, const SkBitmap& bitmap, const SkPaint& paint) {\n canvas->save();\n canvas->clipRect(SkRect::MakeXYWH(0, 0,\n SkIntToScalar(bitmap.width()), SkIntToScalar(bitmap.height())));\n canvas->drawBitmap(bitmap, 0, 0, &paint);\n canvas->restore();\n }\n\n virtual SkISize onISize() { return SkISize::Make(500, 150); }\n\n virtual void onOnceBeforeDraw() {\n this->make_bitmap();\n }\n\n virtual void onDraw(SkCanvas* canvas) {\n canvas->clear(0x00000000);\n {\n SkAutoTUnref<SkImageFilter> bitmapSource(SkBitmapSource::Create(fBitmap));\n SkAutoTUnref<SkColorFilter> cf(SkColorFilter::CreateModeFilter(SK_ColorRED,\n SkXfermode::kSrcIn_Mode));\n SkAutoTUnref<SkImageFilter> blur(SkBlurImageFilter::Create(4.0f, 4.0f, bitmapSource));\n SkAutoTUnref<SkImageFilter> erode(SkErodeImageFilter::Create(4, 4, blur));\n SkAutoTUnref<SkImageFilter> color(SkColorFilterImageFilter::Create(cf, erode));\n SkAutoTUnref<SkImageFilter> merge(SkMergeImageFilter::Create(blur, color));\n\n SkPaint paint;\n paint.setImageFilter(merge);\n canvas->drawPaint(paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkAutoTUnref<SkImageFilter> morph(SkDilateImageFilter::Create(5, 5));\n\n SkScalar matrix[20] = { SK_Scalar1, 0, 0, 0, 0,\n 0, SK_Scalar1, 0, 0, 0,\n 0, 0, SK_Scalar1, 0, 0,\n 0, 0, 0, 0.5f, 0 };\n\n SkAutoTUnref<SkColorFilter> matrixFilter(SkColorMatrixFilter::Create(matrix));\n SkAutoTUnref<SkImageFilter> colorMorph(SkColorFilterImageFilter::Create(matrixFilter, morph));\n SkAutoTUnref<SkXfermode> mode(SkXfermode::Create(SkXfermode::kSrcOver_Mode));\n SkAutoTUnref<SkImageFilter> blendColor(SkXfermodeImageFilter::Create(mode, colorMorph));\n\n SkPaint paint;\n paint.setImageFilter(blendColor);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkScalar matrix[20] = { SK_Scalar1, 0, 0, 0, 0,\n 0, SK_Scalar1, 0, 0, 0,\n 0, 0, SK_Scalar1, 0, 0,\n 0, 0, 0, 0.5f, 0 };\n SkAutoTUnref<SkColorMatrixFilter> matrixCF(SkColorMatrixFilter::Create(matrix));\n SkAutoTUnref<SkImageFilter> matrixFilter(SkColorFilterImageFilter::Create(matrixCF));\n SkAutoTUnref<SkImageFilter> offsetFilter(\n SimpleOffsetFilter::Create(10.0f, 10.f, matrixFilter));\n\n SkAutoTUnref<SkXfermode> arith(SkArithmeticMode::Create(0, SK_Scalar1, SK_Scalar1, 0));\n SkAutoTUnref<SkXfermodeImageFilter> arithFilter(\n SkXfermodeImageFilter::Create(arith, matrixFilter, offsetFilter));\n\n SkPaint paint;\n paint.setImageFilter(arithFilter);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkAutoTUnref<SkImageFilter> blur(SkBlurImageFilter::Create(\n SkIntToScalar(10), SkIntToScalar(10)));\n\n SkAutoTUnref<SkXfermode> mode(SkXfermode::Create(SkXfermode::kSrcIn_Mode));\n SkImageFilter::CropRect cropRect(SkRect::MakeWH(SkIntToScalar(95), SkIntToScalar(100)));\n SkAutoTUnref<SkImageFilter> blend(\n SkXfermodeImageFilter::Create(mode, blur, NULL, &cropRect));\n\n SkPaint paint;\n paint.setImageFilter(blend);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n \/\/ Test that crop offsets are absolute, not relative to the parent's crop rect.\n SkAutoTUnref<SkColorFilter> cf1(SkColorFilter::CreateModeFilter(SK_ColorBLUE,\n SkXfermode::kSrcIn_Mode));\n SkAutoTUnref<SkColorFilter> cf2(SkColorFilter::CreateModeFilter(SK_ColorGREEN,\n SkXfermode::kSrcIn_Mode));\n SkImageFilter::CropRect outerRect(SkRect::MakeXYWH(SkIntToScalar(10), SkIntToScalar(10),\n SkIntToScalar(80), SkIntToScalar(80)));\n SkImageFilter::CropRect innerRect(SkRect::MakeXYWH(SkIntToScalar(20), SkIntToScalar(20),\n SkIntToScalar(60), SkIntToScalar(60)));\n SkAutoTUnref<SkImageFilter> color1(SkColorFilterImageFilter::Create(cf1, NULL, &outerRect));\n SkAutoTUnref<SkImageFilter> color2(SkColorFilterImageFilter::Create(cf2, color1, &innerRect));\n\n SkPaint paint;\n paint.setImageFilter(color2);\n paint.setColor(0xFFFF0000);\n canvas->drawRect(SkRect::MakeXYWH(0, 0, 100, 100), paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n }\n\nprivate:\n typedef GM INHERITED;\n SkBitmap fBitmap;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic skiagm::GM* MyFactory(void*) { return new ImageFiltersGraphGM; }\nstatic skiagm::GMRegistry reg(MyFactory);\n<commit_msg>Use a black background in imagefiltersgraph so 8888 and 565 look similar.<commit_after>\/*\n * Copyright 2012 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"gm.h\"\n\n#include \"SkArithmeticMode.h\"\n#include \"SkDevice.h\"\n#include \"SkBitmapSource.h\"\n#include \"SkBlurImageFilter.h\"\n#include \"SkColorFilter.h\"\n#include \"SkColorFilterImageFilter.h\"\n#include \"SkColorMatrixFilter.h\"\n#include \"SkReadBuffer.h\"\n#include \"SkWriteBuffer.h\"\n#include \"SkMergeImageFilter.h\"\n#include \"SkMorphologyImageFilter.h\"\n#include \"SkTestImageFilters.h\"\n#include \"SkXfermodeImageFilter.h\"\n\n\/\/ More closely models how Blink's OffsetFilter works as of 10\/23\/13. SkOffsetImageFilter doesn't\n\/\/ perform a draw and this one does.\nclass SimpleOffsetFilter : public SkImageFilter {\npublic:\n class Registrar {\n public:\n Registrar() {\n SkFlattenable::Register(\"SimpleOffsetFilter\",\n SimpleOffsetFilter::CreateProc,\n SimpleOffsetFilter::GetFlattenableType());\n }\n };\n static SkImageFilter* Create(SkScalar dx, SkScalar dy, SkImageFilter* input) {\n return SkNEW_ARGS(SimpleOffsetFilter, (dx, dy, input));\n }\n\n virtual bool onFilterImage(Proxy* proxy, const SkBitmap& src, const Context& ctx,\n SkBitmap* dst, SkIPoint* offset) const override {\n SkBitmap source = src;\n SkImageFilter* input = getInput(0);\n SkIPoint srcOffset = SkIPoint::Make(0, 0);\n if (input && !input->filterImage(proxy, src, ctx, &source, &srcOffset)) {\n return false;\n }\n\n SkIRect bounds;\n if (!this->applyCropRect(ctx, proxy, source, &srcOffset, &bounds, &source)) {\n return false;\n }\n\n SkAutoTUnref<SkBaseDevice> device(proxy->createDevice(bounds.width(), bounds.height()));\n SkCanvas canvas(device);\n SkPaint paint;\n paint.setXfermodeMode(SkXfermode::kSrc_Mode);\n canvas.drawBitmap(source, fDX - bounds.left(), fDY - bounds.top(), &paint);\n *dst = device->accessBitmap(false);\n offset->fX += bounds.left();\n offset->fY += bounds.top();\n return true;\n }\n\n SK_TO_STRING_OVERRIDE()\n SK_DECLARE_PUBLIC_FLATTENABLE_DESERIALIZATION_PROCS(SimpleOffsetFilter);\n\nprotected:\n void flatten(SkWriteBuffer& buffer) const override {\n this->INHERITED::flatten(buffer);\n buffer.writeScalar(fDX);\n buffer.writeScalar(fDY);\n }\n\nprivate:\n SimpleOffsetFilter(SkScalar dx, SkScalar dy, SkImageFilter* input)\n : SkImageFilter(1, &input), fDX(dx), fDY(dy) {}\n\n SkScalar fDX, fDY;\n\n typedef SkImageFilter INHERITED;\n};\n\nstatic SimpleOffsetFilter::Registrar gReg;\n\nSkFlattenable* SimpleOffsetFilter::CreateProc(SkReadBuffer& buffer) {\n SK_IMAGEFILTER_UNFLATTEN_COMMON(common, 1);\n SkScalar dx = buffer.readScalar();\n SkScalar dy = buffer.readScalar();\n return Create(dx, dy, common.getInput(0));\n}\n\n#ifndef SK_IGNORE_TO_STRING\nvoid SimpleOffsetFilter::toString(SkString* str) const {\n str->appendf(\"SimpleOffsetFilter: (\");\n str->append(\")\");\n}\n#endif\n\nclass ImageFiltersGraphGM : public skiagm::GM {\npublic:\n ImageFiltersGraphGM() {}\n\nprotected:\n\n virtual SkString onShortName() {\n return SkString(\"imagefiltersgraph\");\n }\n\n void make_bitmap() {\n fBitmap.allocN32Pixels(100, 100);\n SkCanvas canvas(fBitmap);\n canvas.clear(SK_ColorTRANSPARENT);\n SkPaint paint;\n paint.setAntiAlias(true);\n sk_tool_utils::set_portable_typeface(&paint);\n paint.setColor(SK_ColorWHITE);\n paint.setTextSize(SkIntToScalar(96));\n const char* str = \"e\";\n canvas.drawText(str, strlen(str), SkIntToScalar(20), SkIntToScalar(70), paint);\n }\n\n void drawClippedBitmap(SkCanvas* canvas, const SkBitmap& bitmap, const SkPaint& paint) {\n canvas->save();\n canvas->clipRect(SkRect::MakeXYWH(0, 0,\n SkIntToScalar(bitmap.width()), SkIntToScalar(bitmap.height())));\n canvas->drawBitmap(bitmap, 0, 0, &paint);\n canvas->restore();\n }\n\n virtual SkISize onISize() { return SkISize::Make(500, 150); }\n\n virtual void onOnceBeforeDraw() {\n this->make_bitmap();\n }\n\n virtual void onDraw(SkCanvas* canvas) {\n canvas->clear(SK_ColorBLACK);\n {\n SkAutoTUnref<SkImageFilter> bitmapSource(SkBitmapSource::Create(fBitmap));\n SkAutoTUnref<SkColorFilter> cf(SkColorFilter::CreateModeFilter(SK_ColorRED,\n SkXfermode::kSrcIn_Mode));\n SkAutoTUnref<SkImageFilter> blur(SkBlurImageFilter::Create(4.0f, 4.0f, bitmapSource));\n SkAutoTUnref<SkImageFilter> erode(SkErodeImageFilter::Create(4, 4, blur));\n SkAutoTUnref<SkImageFilter> color(SkColorFilterImageFilter::Create(cf, erode));\n SkAutoTUnref<SkImageFilter> merge(SkMergeImageFilter::Create(blur, color));\n\n SkPaint paint;\n paint.setImageFilter(merge);\n canvas->drawPaint(paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkAutoTUnref<SkImageFilter> morph(SkDilateImageFilter::Create(5, 5));\n\n SkScalar matrix[20] = { SK_Scalar1, 0, 0, 0, 0,\n 0, SK_Scalar1, 0, 0, 0,\n 0, 0, SK_Scalar1, 0, 0,\n 0, 0, 0, 0.5f, 0 };\n\n SkAutoTUnref<SkColorFilter> matrixFilter(SkColorMatrixFilter::Create(matrix));\n SkAutoTUnref<SkImageFilter> colorMorph(SkColorFilterImageFilter::Create(matrixFilter, morph));\n SkAutoTUnref<SkXfermode> mode(SkXfermode::Create(SkXfermode::kSrcOver_Mode));\n SkAutoTUnref<SkImageFilter> blendColor(SkXfermodeImageFilter::Create(mode, colorMorph));\n\n SkPaint paint;\n paint.setImageFilter(blendColor);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkScalar matrix[20] = { SK_Scalar1, 0, 0, 0, 0,\n 0, SK_Scalar1, 0, 0, 0,\n 0, 0, SK_Scalar1, 0, 0,\n 0, 0, 0, 0.5f, 0 };\n SkAutoTUnref<SkColorMatrixFilter> matrixCF(SkColorMatrixFilter::Create(matrix));\n SkAutoTUnref<SkImageFilter> matrixFilter(SkColorFilterImageFilter::Create(matrixCF));\n SkAutoTUnref<SkImageFilter> offsetFilter(\n SimpleOffsetFilter::Create(10.0f, 10.f, matrixFilter));\n\n SkAutoTUnref<SkXfermode> arith(SkArithmeticMode::Create(0, SK_Scalar1, SK_Scalar1, 0));\n SkAutoTUnref<SkXfermodeImageFilter> arithFilter(\n SkXfermodeImageFilter::Create(arith, matrixFilter, offsetFilter));\n\n SkPaint paint;\n paint.setImageFilter(arithFilter);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n SkAutoTUnref<SkImageFilter> blur(SkBlurImageFilter::Create(\n SkIntToScalar(10), SkIntToScalar(10)));\n\n SkAutoTUnref<SkXfermode> mode(SkXfermode::Create(SkXfermode::kSrcIn_Mode));\n SkImageFilter::CropRect cropRect(SkRect::MakeWH(SkIntToScalar(95), SkIntToScalar(100)));\n SkAutoTUnref<SkImageFilter> blend(\n SkXfermodeImageFilter::Create(mode, blur, NULL, &cropRect));\n\n SkPaint paint;\n paint.setImageFilter(blend);\n drawClippedBitmap(canvas, fBitmap, paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n {\n \/\/ Test that crop offsets are absolute, not relative to the parent's crop rect.\n SkAutoTUnref<SkColorFilter> cf1(SkColorFilter::CreateModeFilter(SK_ColorBLUE,\n SkXfermode::kSrcIn_Mode));\n SkAutoTUnref<SkColorFilter> cf2(SkColorFilter::CreateModeFilter(SK_ColorGREEN,\n SkXfermode::kSrcIn_Mode));\n SkImageFilter::CropRect outerRect(SkRect::MakeXYWH(SkIntToScalar(10), SkIntToScalar(10),\n SkIntToScalar(80), SkIntToScalar(80)));\n SkImageFilter::CropRect innerRect(SkRect::MakeXYWH(SkIntToScalar(20), SkIntToScalar(20),\n SkIntToScalar(60), SkIntToScalar(60)));\n SkAutoTUnref<SkImageFilter> color1(SkColorFilterImageFilter::Create(cf1, NULL, &outerRect));\n SkAutoTUnref<SkImageFilter> color2(SkColorFilterImageFilter::Create(cf2, color1, &innerRect));\n\n SkPaint paint;\n paint.setImageFilter(color2);\n paint.setColor(SK_ColorRED);\n canvas->drawRect(SkRect::MakeXYWH(0, 0, 100, 100), paint);\n canvas->translate(SkIntToScalar(100), 0);\n }\n }\n\nprivate:\n typedef GM INHERITED;\n SkBitmap fBitmap;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic skiagm::GM* MyFactory(void*) { return new ImageFiltersGraphGM; }\nstatic skiagm::GMRegistry reg(MyFactory);\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2007-2014 Frank Mertens.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version\n * 2 of the License, or (at your option) any later version.\n *\/\n\n#include <math.h> \/\/ pow\n#include \"Singleton.h\"\n#include \"FloatSyntax.h\"\n\nnamespace flux\n{\n\nFloatSyntax::FloatSyntax()\n{\n\tSYNTAX(\"float\");\n\n\tsign_ = DEFINE(\"Sign\", RANGE(\"+-\"));\n\tintegerPart_ = DEFINE(\"IntegerPart\", REPEAT(1, 20, RANGE('0', '9')));\n\tfractionPart_ = DEFINE(\"FractionPart\", REPEAT(1, 20, RANGE('0', '9')));\n\texponentSign_ = DEFINE(\"ExponentSign\", RANGE(\"+-\"));\n\texponent_ = DEFINE(\"Exponent\", REPEAT(1, 3, RANGE('0', '9')));\n\tnan_ = DEFINE(\"NaN\", CHOICE(STRING(\"NaN\"), STRING(\"nan\")));\n\tinfinite_ = DEFINE(\"Infinite\", GLUE(REPEAT(0, 1, CHAR('-')), CHOICE(STRING(\"INFINITE\"), STRING(\"inf\"))));\n\n\tliteral_ =\n\t\tDEFINE(\"Literal\",\n\t\t\tCHOICE(\n\t\t\t\tREF(\"NaN\"),\n\t\t\t\tREF(\"Infinite\"),\n\t\t\t\tGLUE(\n\t\t\t\t\tREPEAT(0, 1, REF(\"Sign\")),\n\t\t\t\t\tCHOICE(\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tREF(\"IntegerPart\"),\n\t\t\t\t\t\t\tREPEAT(0, 1,\n\t\t\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\t\t\tCHAR('.'),\n\t\t\t\t\t\t\t\t\tREPEAT(0, 1, REF(\"FractionPart\"))\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t),\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tCHAR('.'),\n\t\t\t\t\t\t\tREF(\"FractionPart\")\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\tREPEAT(0, 1,\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tRANGE(\"eE\"),\n\t\t\t\t\t\t\tREPEAT(0, 1, REF(\"ExponentSign\")),\n\t\t\t\t\t\t\tREF(\"Exponent\")\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\tNOT(RANGE(\".eE\"))\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\n\tENTRY(\"Literal\");\n\tLINK();\n}\n\nvoid FloatSyntax::read(float64_t *value, const ByteArray *text, Token *token) const\n{\n\ttoken = token->firstChild();\n\n\tif (token->rule() == nan_)\n\t{\n\t\t*value = nan;\n\t}\n\telse if (token->rule() == infinite_)\n\t{\n\t\tfloat64_t one, zero;\n\t\tone = 1.; zero = 0.;\n\n\t\tif (text->at(token->index()) == '-')\n\t\t\t*value = -one \/ zero;\n\t\telse\n\t\t\t*value = one \/ zero;\n\t}\n\telse\n\t{\n\t\tint sign = 1;\n\t\tfloat64_t mantissa = 0.;\n\t\tint epSign = 1;\n\t\tint ep = 0;\n\n\t\twhile (token)\n\t\t{\n\t\t\tif (token->rule() == sign_)\n\t\t\t{\n\t\t\t\tif (text->at(token->index()) == '-')\n\t\t\t\t\tsign = -1;\n\t\t\t}\n\t\t\telse if (token->rule() == integerPart_)\n\t\t\t{\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i)\n\t\t\t\t{\n\t\t\t\t\tmantissa *= 10;\n\t\t\t\t\tmantissa += text->at(i) - '0';\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (token->rule() == fractionPart_)\n\t\t\t{\n\t\t\t\tfloat64_t h = 0.1;\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i, h \/= 10)\n\t\t\t\t\tmantissa += h * (text->at(i) - '0');\n\t\t\t}\n\t\t\telse if (token->rule() == exponentSign_)\n\t\t\t{\n\t\t\t\tif (text->at(token->index()) == '-')\n\t\t\t\t\tepSign = -1;\n\t\t\t}\n\t\t\telse if (token->rule() == exponent_)\n\t\t\t{\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i)\n\t\t\t\t{\n\t\t\t\t\tep *= 10;\n\t\t\t\t\tep += text->at(i) - '0';\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttoken = token->nextSibling();\n\t\t}\n\n\t\t*value = sign * mantissa;\n\t\tif (ep != 0)\n\t\t\t*value *= ::pow(10., float64_t(epSign * ep));\n\t}\n}\n\nRef<Token> FloatSyntax::read(float64_t *value, const ByteArray *text, int i) const\n{\n\tRef<Token> token = match(text, i)->rootToken();\n\tif (token) read(value, text, token);\n\treturn token;\n}\n\nconst FloatSyntax *floatSyntax() { return Singleton<FloatSyntax>::instance(); }\n\n} \/\/ namespace flux\n<commit_msg>Fix: reduced ambiguity in reading infinite<commit_after>\/*\n * Copyright (C) 2007-2014 Frank Mertens.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version\n * 2 of the License, or (at your option) any later version.\n *\/\n\n#include <math.h> \/\/ pow\n#include \"Singleton.h\"\n#include \"FloatSyntax.h\"\n\nnamespace flux\n{\n\nFloatSyntax::FloatSyntax()\n{\n\tSYNTAX(\"float\");\n\n\tsign_ = DEFINE(\"Sign\", RANGE(\"+-\"));\n\tintegerPart_ = DEFINE(\"IntegerPart\", REPEAT(1, 20, RANGE('0', '9')));\n\tfractionPart_ = DEFINE(\"FractionPart\", REPEAT(1, 20, RANGE('0', '9')));\n\texponentSign_ = DEFINE(\"ExponentSign\", RANGE(\"+-\"));\n\texponent_ = DEFINE(\"Exponent\", REPEAT(1, 3, RANGE('0', '9')));\n\tnan_ = DEFINE(\"NaN\", CHOICE(STRING(\"NaN\"), STRING(\"nan\")));\n\tinfinite_ = DEFINE(\"Infinite\", GLUE(REPEAT(0, 1, CHAR('-')), CHOICE(STRING(\"INFINITE\"), STRING(\"inf\"))));\n\n\tliteral_ =\n\t\tDEFINE(\"Literal\",\n\t\t\tCHOICE(\n\t\t\t\tGLUE(\n\t\t\t\t\tREPEAT(0, 1, REF(\"Sign\")),\n\t\t\t\t\tCHOICE(\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tREF(\"IntegerPart\"),\n\t\t\t\t\t\t\tREPEAT(0, 1,\n\t\t\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\t\t\tCHAR('.'),\n\t\t\t\t\t\t\t\t\tREPEAT(0, 1, REF(\"FractionPart\"))\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t)\n\t\t\t\t\t\t),\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tCHAR('.'),\n\t\t\t\t\t\t\tREF(\"FractionPart\")\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\tREPEAT(0, 1,\n\t\t\t\t\t\tGLUE(\n\t\t\t\t\t\t\tRANGE(\"eE\"),\n\t\t\t\t\t\t\tREPEAT(0, 1, REF(\"ExponentSign\")),\n\t\t\t\t\t\t\tREF(\"Exponent\")\n\t\t\t\t\t\t)\n\t\t\t\t\t),\n\t\t\t\t\tNOT(RANGE(\".eE\"))\n\t\t\t\t),\n\t\t\t\tGLUE(\n\t\t\t\t\tCHOICE(\n\t\t\t\t\t\tREF(\"NaN\"),\n\t\t\t\t\t\tREF(\"Infinite\")\n\t\t\t\t\t),\n\t\t\t\t\tNOT(RANGE('a', 'z')),\n\t\t\t\t\tNOT(RANGE('A', 'Z'))\n\t\t\t\t)\n\t\t\t)\n\t\t);\n\n\tENTRY(\"Literal\");\n\tLINK();\n}\n\nvoid FloatSyntax::read(float64_t *value, const ByteArray *text, Token *token) const\n{\n\ttoken = token->firstChild();\n\n\tif (token->rule() == nan_)\n\t{\n\t\t*value = nan;\n\t}\n\telse if (token->rule() == infinite_)\n\t{\n\t\tfloat64_t one, zero;\n\t\tone = 1.; zero = 0.;\n\n\t\tif (text->at(token->index()) == '-')\n\t\t\t*value = -one \/ zero;\n\t\telse\n\t\t\t*value = one \/ zero;\n\t}\n\telse\n\t{\n\t\tint sign = 1;\n\t\tfloat64_t mantissa = 0.;\n\t\tint epSign = 1;\n\t\tint ep = 0;\n\n\t\twhile (token)\n\t\t{\n\t\t\tif (token->rule() == sign_)\n\t\t\t{\n\t\t\t\tif (text->at(token->index()) == '-')\n\t\t\t\t\tsign = -1;\n\t\t\t}\n\t\t\telse if (token->rule() == integerPart_)\n\t\t\t{\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i)\n\t\t\t\t{\n\t\t\t\t\tmantissa *= 10;\n\t\t\t\t\tmantissa += text->at(i) - '0';\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (token->rule() == fractionPart_)\n\t\t\t{\n\t\t\t\tfloat64_t h = 0.1;\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i, h \/= 10)\n\t\t\t\t\tmantissa += h * (text->at(i) - '0');\n\t\t\t}\n\t\t\telse if (token->rule() == exponentSign_)\n\t\t\t{\n\t\t\t\tif (text->at(token->index()) == '-')\n\t\t\t\t\tepSign = -1;\n\t\t\t}\n\t\t\telse if (token->rule() == exponent_)\n\t\t\t{\n\t\t\t\tfor (int i = token->i0(); i < token->i1(); ++i)\n\t\t\t\t{\n\t\t\t\t\tep *= 10;\n\t\t\t\t\tep += text->at(i) - '0';\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttoken = token->nextSibling();\n\t\t}\n\n\t\t*value = sign * mantissa;\n\t\tif (ep != 0)\n\t\t\t*value *= ::pow(10., float64_t(epSign * ep));\n\t}\n}\n\nRef<Token> FloatSyntax::read(float64_t *value, const ByteArray *text, int i) const\n{\n\tRef<Token> token = match(text, i)->rootToken();\n\tif (token) read(value, text, token);\n\treturn token;\n}\n\nconst FloatSyntax *floatSyntax() { return Singleton<FloatSyntax>::instance(); }\n\n} \/\/ namespace flux\n<|endoftext|>"} {"text":"<commit_before>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <jitk\/transformer.hpp>\n\nusing namespace std;\n\nnamespace bohrium {\nnamespace jitk {\n\nvector<InstrPtr> swap_axis(const vector<InstrPtr> &instr_list, int64_t axis1, int64_t axis2) {\n vector<InstrPtr> ret;\n for (const InstrPtr &instr: instr_list) {\n bh_instruction tmp(*instr);\n tmp.transpose(axis1, axis2);\n ret.push_back(std::make_shared<bh_instruction>(tmp));\n }\n return ret;\n}\n\nvector<Block> swap_blocks(const LoopB &parent, const LoopB *child) {\n vector<Block> ret;\n for (const Block &b: parent._block_list) {\n LoopB loop;\n loop.rank = parent.rank;\n if (b.isInstr() or &b.getLoop() != child) {\n loop.size = parent.size;\n loop._block_list.push_back(b);\n } else {\n loop.size = child->size;\n const vector<InstrPtr> t = swap_axis(child->getAllInstr(), parent.rank, child->rank);\n loop._block_list.push_back(create_nested_block(t, child->rank, parent.size));\n }\n loop.metadata_update();\n ret.push_back(Block(std::move(loop)));\n }\n return ret;\n}\n\nconst LoopB *find_swappable_sub_block(const LoopB &parent) {\n \/\/ For each sweep, we look for a sub-block that contains that sweep instructions.\n for (const InstrPtr sweep: parent._sweeps) {\n for (const Block &b: parent._block_list) {\n if (not b.isInstr()) {\n for (const Block &instr_block: b.getLoop()._block_list) {\n if (instr_block.isInstr()) {\n if (*instr_block.getInstr() == *sweep) {\n return &b.getLoop();\n }\n }\n }\n }\n }\n }\n return NULL;\n}\n\nvector<Block> push_reductions_inwards(const vector<Block> &block_list) {\n vector<Block> block_list2(block_list);\n for(Block &b: block_list2) {\n if (not b.isInstr()) {\n b.getLoop()._block_list = push_reductions_inwards(b.getLoop()._block_list);\n }\n }\n vector<Block> ret;\n for(const Block &b: block_list2) {\n const LoopB *swappable;\n if (not b.isInstr() and (swappable = find_swappable_sub_block(b.getLoop())) != NULL) {\n const vector<Block>tmp = swap_blocks(b.getLoop(), swappable);\n ret.insert(ret.end(), tmp.begin(), tmp.end());\n } else {\n ret.push_back(b);\n }\n }\n return ret;\n}\n\nvector<Block> split_for_threading(const vector<Block> &block_list, uint64_t min_threading, uint64_t cur_threading) {\n vector<Block> ret;\n\n for (const Block &block: block_list) {\n \/\/ For now, we cannot make an instruction or a sweeped block threadable\n if (block.isInstr() or block.getLoop()._sweeps.size() > 0) {\n ret.push_back(block);\n continue;\n }\n const LoopB &loop = block.getLoop();\n uint64_t max_nelem = 0; \/\/ The maximum number of element in loop, which tells use the best-case scenario\n for (const InstrPtr instr: loop.getAllInstr()) {\n if (bh_noperands(instr->opcode) > 0) {\n const uint64_t nelem = static_cast<uint64_t>(bh_nelements(instr->operand[0]));\n if (nelem > max_nelem)\n max_nelem = nelem;\n }\n }\n if (loop._block_list.size() > 1 \/\/ We need minimum two blocks in order to split!\n and max_nelem > min_threading \/\/ Is it even possible to achieve our goal?\n and find_threaded_blocks(loop).second < min_threading-cur_threading) { \/\/ Is the goal already achieved?\n\n for (auto it = loop._block_list.begin(); it != loop._block_list.end(); ++it) {\n \/\/ First we will place all sub-blocks that cannot be threaded in a shared block\n {\n LoopB newloop;\n newloop.rank = loop.rank;\n newloop.size = loop.size;\n while (it != loop._block_list.end() and (it->isInstr() or it->getLoop()._sweeps.size() > 0)) {\n assert(it->rank() == newloop.rank+1);\n newloop._block_list.push_back(*it);\n ++it;\n }\n if (not newloop._block_list.empty()) {\n newloop.metadata_update();\n ret.push_back(Block(std::move(newloop)));\n }\n }\n \/\/ Then we place the highly threaded sub-block in its own block\n if (it != loop._block_list.end()) {\n assert(not it->isInstr());\n assert(it->getLoop()._sweeps.size() == 0);\n LoopB newloop;\n newloop.rank = loop.rank;\n newloop.size = loop.size;\n newloop._block_list.push_back(*it);\n newloop.metadata_update();\n ret.push_back(Block(std::move(newloop)));\n } else {\n break;\n }\n }\n } else {\n ret.push_back(block);\n }\n }\n return ret;\n}\n\n\/\/ Help function that collapses 'axis' and 'axis+1' in all instructions within 'loop'\n\/\/ Returns false if encountering a non-compatible instruction\nstatic bool collapse_instr_axes(LoopB &loop, const int axis) {\n for (Block &block: loop._block_list) {\n if (block.isInstr()) {\n bh_instruction instr(*block.getInstr());\n const int sa = instr.sweep_axis();\n assert(sa != axis);\n assert(sa != axis+1);\n if (sa == axis or sa == axis+1) {\n return false;\n }\n const int nop = bh_noperands(instr.opcode);\n for (int i=0; i<nop; ++i) {\n bh_view &view = instr.operand[i];\n if (not bh_is_constant(&view)) {\n int _axis = axis;\n if (i==0 and bh_opcode_is_reduction(instr.opcode)) {\n _axis = sa < _axis ? _axis-1 : _axis;\n }\n assert(view.ndim > _axis+1);\n if (view.shape[_axis+1] * view.stride[_axis+1] != view.stride[_axis]) {\n return false;\n }\n view.shape[_axis] *= view.shape[_axis+1];\n view.stride[_axis] = view.stride[_axis+1];\n }\n }\n instr.remove_axis(axis+1);\n block.setInstr(instr);\n } else {\n --block.getLoop().rank;\n if (not collapse_instr_axes(block.getLoop(), axis)) {\n return false;\n }\n }\n }\n loop.metadata_update();\n assert(loop.validation());\n return true;\n}\n\n\/\/ Help function that collapses 'loop' with its child if possible\nstatic bool collapse_loop_with_child(LoopB &loop) {\n \/\/ In order to be collapsable, 'loop' can only have one child, that child must be a loop, and both 'loop'\n \/\/ and the child cannot be sweeped\n if (loop._sweeps.empty() and loop._block_list.size() == 1) {\n Block &child = loop._block_list[0];\n if ((not child.isInstr()) and child.getLoop()._sweeps.empty()) {\n \/\/ Let's collapse with our single child\n loop.size *= loop._block_list[0].getLoop().size;\n \/\/ NB: we need the temporary step in order to avoid copying deleted data\n auto tmp = std::move(loop._block_list[0].getLoop()._block_list);\n loop._block_list = std::move(tmp);\n return collapse_instr_axes(loop, loop.rank);\n }\n }\n return false;\n}\n\nvector<Block> collapse_redundant_axes(const vector<Block> &block_list) {\n vector<Block> block_list2(block_list);\n for(Block &b: block_list2) {\n if (not b.isInstr()) {\n b.getLoop()._block_list = collapse_redundant_axes(b.getLoop()._block_list);\n }\n }\n vector<Block> ret;\n for (const Block &block: block_list) {\n if (not block.isInstr()) {\n Block b(block);\n if (collapse_loop_with_child(b.getLoop())) {\n ret.push_back(std::move(b));\n } else { \/\/ If it didn't succeeded, we just push the original block\n ret.push_back(block);\n }\n } else {\n ret.push_back(block);\n }\n }\n return ret;\n}\n} \/\/ jitk\n} \/\/ bohrium\n\n<commit_msg>jitk: collapse_instr_axes() makes a reshapable check<commit_after>\/*\nThis file is part of Bohrium and copyright (c) 2012 the Bohrium\nteam <http:\/\/www.bh107.org>.\n\nBohrium is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as\npublished by the Free Software Foundation, either version 3\nof the License, or (at your option) any later version.\n\nBohrium is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU General Public License for more details.\n\nYou should have received a copy of the\nGNU Lesser General Public License along with Bohrium.\n\nIf not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <jitk\/transformer.hpp>\n\nusing namespace std;\n\nnamespace bohrium {\nnamespace jitk {\n\nvector<InstrPtr> swap_axis(const vector<InstrPtr> &instr_list, int64_t axis1, int64_t axis2) {\n vector<InstrPtr> ret;\n for (const InstrPtr &instr: instr_list) {\n bh_instruction tmp(*instr);\n tmp.transpose(axis1, axis2);\n ret.push_back(std::make_shared<bh_instruction>(tmp));\n }\n return ret;\n}\n\nvector<Block> swap_blocks(const LoopB &parent, const LoopB *child) {\n vector<Block> ret;\n for (const Block &b: parent._block_list) {\n LoopB loop;\n loop.rank = parent.rank;\n if (b.isInstr() or &b.getLoop() != child) {\n loop.size = parent.size;\n loop._block_list.push_back(b);\n } else {\n loop.size = child->size;\n const vector<InstrPtr> t = swap_axis(child->getAllInstr(), parent.rank, child->rank);\n loop._block_list.push_back(create_nested_block(t, child->rank, parent.size));\n }\n loop.metadata_update();\n ret.push_back(Block(std::move(loop)));\n }\n return ret;\n}\n\nconst LoopB *find_swappable_sub_block(const LoopB &parent) {\n \/\/ For each sweep, we look for a sub-block that contains that sweep instructions.\n for (const InstrPtr sweep: parent._sweeps) {\n for (const Block &b: parent._block_list) {\n if (not b.isInstr()) {\n for (const Block &instr_block: b.getLoop()._block_list) {\n if (instr_block.isInstr()) {\n if (*instr_block.getInstr() == *sweep) {\n return &b.getLoop();\n }\n }\n }\n }\n }\n }\n return NULL;\n}\n\nvector<Block> push_reductions_inwards(const vector<Block> &block_list) {\n vector<Block> block_list2(block_list);\n for(Block &b: block_list2) {\n if (not b.isInstr()) {\n b.getLoop()._block_list = push_reductions_inwards(b.getLoop()._block_list);\n }\n }\n vector<Block> ret;\n for(const Block &b: block_list2) {\n const LoopB *swappable;\n if (not b.isInstr() and (swappable = find_swappable_sub_block(b.getLoop())) != NULL) {\n const vector<Block>tmp = swap_blocks(b.getLoop(), swappable);\n ret.insert(ret.end(), tmp.begin(), tmp.end());\n } else {\n ret.push_back(b);\n }\n }\n return ret;\n}\n\nvector<Block> split_for_threading(const vector<Block> &block_list, uint64_t min_threading, uint64_t cur_threading) {\n vector<Block> ret;\n\n for (const Block &block: block_list) {\n \/\/ For now, we cannot make an instruction or a sweeped block threadable\n if (block.isInstr() or block.getLoop()._sweeps.size() > 0) {\n ret.push_back(block);\n continue;\n }\n const LoopB &loop = block.getLoop();\n uint64_t max_nelem = 0; \/\/ The maximum number of element in loop, which tells use the best-case scenario\n for (const InstrPtr instr: loop.getAllInstr()) {\n if (bh_noperands(instr->opcode) > 0) {\n const uint64_t nelem = static_cast<uint64_t>(bh_nelements(instr->operand[0]));\n if (nelem > max_nelem)\n max_nelem = nelem;\n }\n }\n if (loop._block_list.size() > 1 \/\/ We need minimum two blocks in order to split!\n and max_nelem > min_threading \/\/ Is it even possible to achieve our goal?\n and find_threaded_blocks(loop).second < min_threading-cur_threading) { \/\/ Is the goal already achieved?\n\n for (auto it = loop._block_list.begin(); it != loop._block_list.end(); ++it) {\n \/\/ First we will place all sub-blocks that cannot be threaded in a shared block\n {\n LoopB newloop;\n newloop.rank = loop.rank;\n newloop.size = loop.size;\n while (it != loop._block_list.end() and (it->isInstr() or it->getLoop()._sweeps.size() > 0)) {\n assert(it->rank() == newloop.rank+1);\n newloop._block_list.push_back(*it);\n ++it;\n }\n if (not newloop._block_list.empty()) {\n newloop.metadata_update();\n ret.push_back(Block(std::move(newloop)));\n }\n }\n \/\/ Then we place the highly threaded sub-block in its own block\n if (it != loop._block_list.end()) {\n assert(not it->isInstr());\n assert(it->getLoop()._sweeps.size() == 0);\n LoopB newloop;\n newloop.rank = loop.rank;\n newloop.size = loop.size;\n newloop._block_list.push_back(*it);\n newloop.metadata_update();\n ret.push_back(Block(std::move(newloop)));\n } else {\n break;\n }\n }\n } else {\n ret.push_back(block);\n }\n }\n return ret;\n}\n\n\/\/ Help function that collapses 'axis' and 'axis+1' in all instructions within 'loop'\n\/\/ Returns false if encountering a non-compatible instruction\nstatic bool collapse_instr_axes(LoopB &loop, const int axis) {\n for (Block &block: loop._block_list) {\n if (block.isInstr()) {\n bh_instruction instr(*block.getInstr());\n const int sa = instr.sweep_axis();\n assert(sa != axis);\n assert(sa != axis+1);\n if (sa == axis or sa == axis+1) {\n return false;\n }\n const int nop = bh_noperands(instr.opcode);\n for (int i=0; i<nop; ++i) {\n bh_view &view = instr.operand[i];\n if (not bh_is_constant(&view)) {\n int _axis = axis;\n if (i==0 and bh_opcode_is_reduction(instr.opcode)) {\n _axis = sa < _axis ? _axis-1 : _axis;\n }\n assert(view.ndim > _axis+1);\n if (view.shape[_axis+1] * view.stride[_axis+1] != view.stride[_axis]) {\n return false;\n }\n view.shape[_axis] *= view.shape[_axis+1];\n view.stride[_axis] = view.stride[_axis+1];\n }\n }\n instr.remove_axis(axis+1);\n block.setInstr(instr);\n } else {\n --block.getLoop().rank;\n if (not collapse_instr_axes(block.getLoop(), axis)) {\n return false;\n }\n }\n }\n loop.metadata_update();\n assert(loop.validation());\n return true;\n}\n\n\/\/ Help function that collapses 'loop' with its child if possible\nstatic bool collapse_loop_with_child(LoopB &loop) {\n \/\/ In order to be collapsable, 'loop' can only have one child, that child must be a loop, and both 'loop'\n \/\/ and the child cannot be sweeped\n if (loop._sweeps.empty() and loop._block_list.size() == 1 and loop._reshapable) {\n Block &child = loop._block_list[0];\n if ((not child.isInstr()) and child.getLoop()._sweeps.empty() and child.getLoop()._reshapable) {\n \/\/ Let's collapse with our single child\n loop.size *= loop._block_list[0].getLoop().size;\n \/\/ NB: we need the temporary step in order to avoid copying deleted data\n auto tmp = std::move(loop._block_list[0].getLoop()._block_list);\n loop._block_list = std::move(tmp);\n return collapse_instr_axes(loop, loop.rank);\n }\n }\n return false;\n}\n\nvector<Block> collapse_redundant_axes(const vector<Block> &block_list) {\n vector<Block> block_list2(block_list);\n for(Block &b: block_list2) {\n if (not b.isInstr()) {\n b.getLoop()._block_list = collapse_redundant_axes(b.getLoop()._block_list);\n }\n }\n vector<Block> ret;\n for (const Block &block: block_list) {\n if (not block.isInstr()) {\n Block b(block);\n if (collapse_loop_with_child(b.getLoop())) {\n ret.push_back(std::move(b));\n } else { \/\/ If it didn't succeeded, we just push the original block\n ret.push_back(block);\n }\n } else {\n ret.push_back(block);\n }\n }\n return ret;\n}\n} \/\/ jitk\n} \/\/ bohrium\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/sync\/glue\/preference_model_associator.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/logging.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/sync\/engine\/syncapi.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/protocol\/preference_specifics.pb.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"chrome\/common\/pref_names.h\"\n\nnamespace browser_sync {\n\nPreferenceModelAssociator::PreferenceModelAssociator(\n ProfileSyncService* sync_service)\n : sync_service_(sync_service),\n preferences_node_id_(sync_api::kInvalidId),\n ALLOW_THIS_IN_INITIALIZER_LIST(persist_associations_(this)) {\n DCHECK(sync_service_);\n synced_preferences_.insert(prefs::kHomePageIsNewTabPage);\n synced_preferences_.insert(prefs::kHomePage);\n synced_preferences_.insert(prefs::kRestoreOnStartup);\n synced_preferences_.insert(prefs::kURLsToRestoreOnStartup);\n synced_preferences_.insert(prefs::kShowBookmarkBar);\n}\n\nbool PreferenceModelAssociator::AssociateModels() {\n\n \/\/ TODO(albertb): Attempt to load the model association from storage.\n PrefService* pref_service = sync_service_->profile()->GetPrefs();\n\n int64 root_id;\n if (!GetSyncIdForTaggedNode(kPreferencesTag, &root_id)) {\n sync_service_->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n\n sync_api::WriteTransaction trans(\n sync_service()->backend()->GetUserShareHandle());\n sync_api::ReadNode root(&trans);\n if (!root.InitByIdLookup(root_id)) {\n sync_service_->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n\n base::JSONReader reader;\n for (std::set<std::wstring>::iterator it = synced_preferences_.begin();\n it != synced_preferences_.end(); ++it) {\n std::string tag = WideToUTF8(*it);\n\n sync_api::ReadNode node(&trans);\n if (node.InitByClientTagLookup(syncable::PREFERENCES, tag)) {\n const sync_pb::PreferenceSpecifics& preference(\n node.GetPreferenceSpecifics());\n DCHECK_EQ(tag, preference.name());\n\n scoped_ptr<Value> value(\n reader.JsonToValue(preference.value(), false, false));\n std::wstring pref_name = UTF8ToWide(preference.name());\n if (!value.get()) {\n LOG(ERROR) << \"Failed to deserialize preference value: \"\n << reader.error_message();\n sync_service_->OnUnrecoverableError();\n return false;\n }\n\n \/\/ Update the local preference based on what we got from the sync server.\n const PrefService::Preference* pref =\n pref_service->FindPreference((*it).c_str());\n if (!pref) {\n LOG(ERROR) << \"Unrecognized preference -- ignoring.\";\n continue;\n }\n\n pref_service->Set(pref_name.c_str(), *value);\n Associate(pref, node.GetId());\n } else {\n sync_api::WriteNode node(&trans);\n if (!node.InitUniqueByCreation(syncable::PREFERENCES, root, tag)) {\n LOG(ERROR) << \"Failed to create preference sync node.\";\n sync_service_->OnUnrecoverableError();\n return false;\n }\n\n \/\/ Update the sync node with the local value for this preference.\n const PrefService::Preference* pref =\n pref_service->FindPreference((*it).c_str());\n if (!pref) {\n LOG(ERROR) << \"Unrecognized preference -- ignoring.\";\n continue;\n }\n\n std::string serialized;\n JSONStringValueSerializer json(&serialized);\n if (!json.Serialize(*(pref->GetValue()))) {\n LOG(ERROR) << \"Failed to serialize preference value.\";\n sync_service_->OnUnrecoverableError();\n return false;\n }\n sync_pb::PreferenceSpecifics preference;\n preference.set_name(tag);\n preference.set_value(serialized);\n node.SetPreferenceSpecifics(preference);\n node.SetTitle(*it);\n Associate(pref, node.GetId());\n }\n }\n return true;\n}\n\nbool PreferenceModelAssociator::DisassociateModels() {\n id_map_.clear();\n id_map_inverse_.clear();\n dirty_associations_sync_ids_.clear();\n return true;\n}\n\nbool PreferenceModelAssociator::SyncModelHasUserCreatedNodes() {\n int64 preferences_sync_id;\n if (!GetSyncIdForTaggedNode(kPreferencesTag, &preferences_sync_id)) {\n sync_service()->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n sync_api::ReadTransaction trans(\n sync_service()->backend()->GetUserShareHandle());\n\n sync_api::ReadNode preferences_node(&trans);\n if (!preferences_node.InitByIdLookup(preferences_sync_id)) {\n sync_service()->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n }\n\n \/\/ The sync model has user created nodes if the preferences folder has any\n \/\/ children.\n return sync_api::kInvalidId != preferences_node.GetFirstChildId();\n}\n\nbool PreferenceModelAssociator::ChromeModelHasUserCreatedNodes() {\n \/\/ Assume the preferences model always have user-created nodes.\n return true;\n}\n\nint64 PreferenceModelAssociator::GetSyncIdFromChromeId(\n const std::wstring preference_name) {\n PreferenceNameToSyncIdMap::const_iterator iter =\n id_map_.find(preference_name);\n return iter == id_map_.end() ? sync_api::kInvalidId : iter->second;\n}\n\nvoid PreferenceModelAssociator::Associate(\n const PrefService::Preference* preference, int64 sync_id) {\n DCHECK_NE(sync_api::kInvalidId, sync_id);\n DCHECK(id_map_.find(preference->name()) == id_map_.end());\n DCHECK(id_map_inverse_.find(sync_id) == id_map_inverse_.end());\n id_map_[preference->name()] = sync_id;\n id_map_inverse_[sync_id] = preference->name();\n dirty_associations_sync_ids_.insert(sync_id);\n PostPersistAssociationsTask();\n}\n\nvoid PreferenceModelAssociator::Disassociate(int64 sync_id) {\n SyncIdToPreferenceNameMap::iterator iter = id_map_inverse_.find(sync_id);\n if (iter == id_map_inverse_.end())\n return;\n id_map_.erase(iter->second);\n id_map_inverse_.erase(iter);\n dirty_associations_sync_ids_.erase(sync_id);\n}\n\nbool PreferenceModelAssociator::GetSyncIdForTaggedNode(const std::string& tag,\n int64* sync_id) {\n sync_api::ReadTransaction trans(\n sync_service_->backend()->GetUserShareHandle());\n sync_api::ReadNode sync_node(&trans);\n if (!sync_node.InitByTagLookup(tag.c_str()))\n return false;\n *sync_id = sync_node.GetId();\n return true;\n}\n\nvoid PreferenceModelAssociator::PostPersistAssociationsTask() {\n \/\/ No need to post a task if a task is already pending.\n if (!persist_associations_.empty())\n return;\n MessageLoop::current()->PostTask(\n FROM_HERE,\n persist_associations_.NewRunnableMethod(\n &PreferenceModelAssociator::PersistAssociations));\n}\n\nvoid PreferenceModelAssociator::PersistAssociations() {\n \/\/ If there are no dirty associations we have nothing to do. We handle this\n \/\/ explicity instead of letting the for loop do it to avoid creating a write\n \/\/ transaction in this case.\n if (dirty_associations_sync_ids_.empty()) {\n DCHECK(id_map_.empty());\n DCHECK(id_map_inverse_.empty());\n return;\n }\n\n sync_api::WriteTransaction trans(\n sync_service_->backend()->GetUserShareHandle());\n DirtyAssociationsSyncIds::iterator iter;\n for (iter = dirty_associations_sync_ids_.begin();\n iter != dirty_associations_sync_ids_.end();\n ++iter) {\n int64 sync_id = *iter;\n sync_api::WriteNode sync_node(&trans);\n if (!sync_node.InitByIdLookup(sync_id)) {\n sync_service_->OnUnrecoverableError();\n return;\n }\n \/\/ TODO(sync): Make ExternalId a string?\n \/\/ sync_node.SetExternalId(id_map_inverse_[*iter]);\n }\n dirty_associations_sync_ids_.clear();\n}\n\n} \/\/ namespace browser_sync\n<commit_msg>Add home button to synced prefs.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/sync\/glue\/preference_model_associator.h\"\n\n#include \"base\/json\/json_reader.h\"\n#include \"base\/logging.h\"\n#include \"base\/values.h\"\n#include \"chrome\/browser\/pref_service.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/sync\/engine\/syncapi.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/sync\/protocol\/preference_specifics.pb.h\"\n#include \"chrome\/common\/json_value_serializer.h\"\n#include \"chrome\/common\/pref_names.h\"\n\nnamespace browser_sync {\n\nPreferenceModelAssociator::PreferenceModelAssociator(\n ProfileSyncService* sync_service)\n : sync_service_(sync_service),\n preferences_node_id_(sync_api::kInvalidId),\n ALLOW_THIS_IN_INITIALIZER_LIST(persist_associations_(this)) {\n DCHECK(sync_service_);\n synced_preferences_.insert(prefs::kHomePageIsNewTabPage);\n synced_preferences_.insert(prefs::kHomePage);\n synced_preferences_.insert(prefs::kRestoreOnStartup);\n synced_preferences_.insert(prefs::kURLsToRestoreOnStartup);\n synced_preferences_.insert(prefs::kShowBookmarkBar);\n synced_preferences_.insert(prefs::kShowHomeButton);\n}\n\nbool PreferenceModelAssociator::AssociateModels() {\n\n \/\/ TODO(albertb): Attempt to load the model association from storage.\n PrefService* pref_service = sync_service_->profile()->GetPrefs();\n\n int64 root_id;\n if (!GetSyncIdForTaggedNode(kPreferencesTag, &root_id)) {\n sync_service_->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n\n sync_api::WriteTransaction trans(\n sync_service()->backend()->GetUserShareHandle());\n sync_api::ReadNode root(&trans);\n if (!root.InitByIdLookup(root_id)) {\n sync_service_->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n\n base::JSONReader reader;\n for (std::set<std::wstring>::iterator it = synced_preferences_.begin();\n it != synced_preferences_.end(); ++it) {\n std::string tag = WideToUTF8(*it);\n\n sync_api::ReadNode node(&trans);\n if (node.InitByClientTagLookup(syncable::PREFERENCES, tag)) {\n const sync_pb::PreferenceSpecifics& preference(\n node.GetPreferenceSpecifics());\n DCHECK_EQ(tag, preference.name());\n\n scoped_ptr<Value> value(\n reader.JsonToValue(preference.value(), false, false));\n std::wstring pref_name = UTF8ToWide(preference.name());\n if (!value.get()) {\n LOG(ERROR) << \"Failed to deserialize preference value: \"\n << reader.error_message();\n sync_service_->OnUnrecoverableError();\n return false;\n }\n\n \/\/ Update the local preference based on what we got from the sync server.\n const PrefService::Preference* pref =\n pref_service->FindPreference((*it).c_str());\n if (!pref) {\n LOG(ERROR) << \"Unrecognized preference -- ignoring.\";\n continue;\n }\n\n pref_service->Set(pref_name.c_str(), *value);\n Associate(pref, node.GetId());\n } else {\n sync_api::WriteNode node(&trans);\n if (!node.InitUniqueByCreation(syncable::PREFERENCES, root, tag)) {\n LOG(ERROR) << \"Failed to create preference sync node.\";\n sync_service_->OnUnrecoverableError();\n return false;\n }\n\n \/\/ Update the sync node with the local value for this preference.\n const PrefService::Preference* pref =\n pref_service->FindPreference((*it).c_str());\n if (!pref) {\n LOG(ERROR) << \"Unrecognized preference -- ignoring.\";\n continue;\n }\n\n std::string serialized;\n JSONStringValueSerializer json(&serialized);\n if (!json.Serialize(*(pref->GetValue()))) {\n LOG(ERROR) << \"Failed to serialize preference value.\";\n sync_service_->OnUnrecoverableError();\n return false;\n }\n sync_pb::PreferenceSpecifics preference;\n preference.set_name(tag);\n preference.set_value(serialized);\n node.SetPreferenceSpecifics(preference);\n node.SetTitle(*it);\n Associate(pref, node.GetId());\n }\n }\n return true;\n}\n\nbool PreferenceModelAssociator::DisassociateModels() {\n id_map_.clear();\n id_map_inverse_.clear();\n dirty_associations_sync_ids_.clear();\n return true;\n}\n\nbool PreferenceModelAssociator::SyncModelHasUserCreatedNodes() {\n int64 preferences_sync_id;\n if (!GetSyncIdForTaggedNode(kPreferencesTag, &preferences_sync_id)) {\n sync_service()->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n return false;\n }\n sync_api::ReadTransaction trans(\n sync_service()->backend()->GetUserShareHandle());\n\n sync_api::ReadNode preferences_node(&trans);\n if (!preferences_node.InitByIdLookup(preferences_sync_id)) {\n sync_service()->OnUnrecoverableError();\n LOG(ERROR) << \"Server did not create the top-level preferences node. We \"\n << \"might be running against an out-of-date server.\";\n }\n\n \/\/ The sync model has user created nodes if the preferences folder has any\n \/\/ children.\n return sync_api::kInvalidId != preferences_node.GetFirstChildId();\n}\n\nbool PreferenceModelAssociator::ChromeModelHasUserCreatedNodes() {\n \/\/ Assume the preferences model always have user-created nodes.\n return true;\n}\n\nint64 PreferenceModelAssociator::GetSyncIdFromChromeId(\n const std::wstring preference_name) {\n PreferenceNameToSyncIdMap::const_iterator iter =\n id_map_.find(preference_name);\n return iter == id_map_.end() ? sync_api::kInvalidId : iter->second;\n}\n\nvoid PreferenceModelAssociator::Associate(\n const PrefService::Preference* preference, int64 sync_id) {\n DCHECK_NE(sync_api::kInvalidId, sync_id);\n DCHECK(id_map_.find(preference->name()) == id_map_.end());\n DCHECK(id_map_inverse_.find(sync_id) == id_map_inverse_.end());\n id_map_[preference->name()] = sync_id;\n id_map_inverse_[sync_id] = preference->name();\n dirty_associations_sync_ids_.insert(sync_id);\n PostPersistAssociationsTask();\n}\n\nvoid PreferenceModelAssociator::Disassociate(int64 sync_id) {\n SyncIdToPreferenceNameMap::iterator iter = id_map_inverse_.find(sync_id);\n if (iter == id_map_inverse_.end())\n return;\n id_map_.erase(iter->second);\n id_map_inverse_.erase(iter);\n dirty_associations_sync_ids_.erase(sync_id);\n}\n\nbool PreferenceModelAssociator::GetSyncIdForTaggedNode(const std::string& tag,\n int64* sync_id) {\n sync_api::ReadTransaction trans(\n sync_service_->backend()->GetUserShareHandle());\n sync_api::ReadNode sync_node(&trans);\n if (!sync_node.InitByTagLookup(tag.c_str()))\n return false;\n *sync_id = sync_node.GetId();\n return true;\n}\n\nvoid PreferenceModelAssociator::PostPersistAssociationsTask() {\n \/\/ No need to post a task if a task is already pending.\n if (!persist_associations_.empty())\n return;\n MessageLoop::current()->PostTask(\n FROM_HERE,\n persist_associations_.NewRunnableMethod(\n &PreferenceModelAssociator::PersistAssociations));\n}\n\nvoid PreferenceModelAssociator::PersistAssociations() {\n \/\/ If there are no dirty associations we have nothing to do. We handle this\n \/\/ explicity instead of letting the for loop do it to avoid creating a write\n \/\/ transaction in this case.\n if (dirty_associations_sync_ids_.empty()) {\n DCHECK(id_map_.empty());\n DCHECK(id_map_inverse_.empty());\n return;\n }\n\n sync_api::WriteTransaction trans(\n sync_service_->backend()->GetUserShareHandle());\n DirtyAssociationsSyncIds::iterator iter;\n for (iter = dirty_associations_sync_ids_.begin();\n iter != dirty_associations_sync_ids_.end();\n ++iter) {\n int64 sync_id = *iter;\n sync_api::WriteNode sync_node(&trans);\n if (!sync_node.InitByIdLookup(sync_id)) {\n sync_service_->OnUnrecoverableError();\n return;\n }\n \/\/ TODO(sync): Make ExternalId a string?\n \/\/ sync_node.SetExternalId(id_map_inverse_[*iter]);\n }\n dirty_associations_sync_ids_.clear();\n}\n\n} \/\/ namespace browser_sync\n<|endoftext|>"} {"text":"<commit_before>\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#ifdef CHROME_PERSONALIZATION\n\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n#include \"base\/json_writer.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/views\/sync\/sync_setup_flow.h\"\n#include \"chrome\/browser\/views\/sync\/sync_setup_wizard.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/test\/browser_with_test_window_test.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"chrome\/test\/test_browser_window.h\"\n\nstatic const char* kTestUser = \"chrome.p13n.test@gmail.com\";\nstatic const char* kTestPassword = \"g00gl3g00gl3\";\n\n\/\/ A PSS subtype to inject.\nclass ProfileSyncServiceForWizardTest : public ProfileSyncService {\n public:\n explicit ProfileSyncServiceForWizardTest(Profile* profile)\n : ProfileSyncService(profile), user_accepted_merge_and_sync_(false),\n user_cancelled_dialog_(false) {\n RegisterPreferences();\n }\n\n virtual ~ProfileSyncServiceForWizardTest() { }\n\n virtual void OnUserSubmittedAuth(const std::string& username,\n const std::string& password) {\n username_ = username;\n password_ = password;\n }\n virtual void OnUserAcceptedMergeAndSync() {\n user_accepted_merge_and_sync_ = true;\n }\n virtual void OnUserCancelledDialog() {\n user_cancelled_dialog_ = true;\n }\n\n virtual string16 GetAuthenticatedUsername() const {\n return UTF8ToWide(username_);\n }\n\n void set_auth_state(const std::string& last_email, AuthErrorState state) {\n last_attempted_user_email_ = last_email;\n last_auth_error_ = state;\n }\n\n void ResetTestStats() {\n username_.clear();\n password_.clear();\n user_accepted_merge_and_sync_ = false;\n user_cancelled_dialog_ = false;\n }\n\n std::string username_;\n std::string password_;\n bool user_accepted_merge_and_sync_;\n bool user_cancelled_dialog_;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(ProfileSyncServiceForWizardTest);\n};\n\nclass TestingProfileWithSyncService : public TestingProfile {\n public:\n TestingProfileWithSyncService() {\n sync_service_.reset(new ProfileSyncServiceForWizardTest(this));\n }\n\n virtual ProfileSyncService* GetProfileSyncService() {\n return sync_service_.get();\n }\n private:\n scoped_ptr<ProfileSyncService> sync_service_;\n};\n\nclass TestBrowserWindowForWizardTest : public TestBrowserWindow {\n public:\n explicit TestBrowserWindowForWizardTest(Browser* browser)\n : TestBrowserWindow(browser), flow_(NULL),\n was_show_html_dialog_called_(false) {\n }\n\n virtual ~TestBrowserWindowForWizardTest() {\n if (flow_.get()) {\n \/\/ In real life, the handlers are destroyed by the DOMUI infrastructure,\n \/\/ which calls GetDOMMessageHandlers to take ownership. This does not\n \/\/ exist in our test, so we perform cleanup manually.\n std::vector<DOMMessageHandler*> handlers;\n flow_->GetDOMMessageHandlers(&handlers);\n \/\/ The handler contract is that they are valid for the lifetime of the\n \/\/ HTMLDialogUIDelegate, but are cleaned up after the dialog is closed\n \/\/ and\/or deleted.\n flow_.reset();\n STLDeleteElements(&handlers);\n }\n }\n\n \/\/ We intercept this call to hijack the flow created and then use it to\n \/\/ drive the wizard as if we were the HTML page.\n virtual void ShowHTMLDialog(HtmlDialogUIDelegate* delegate,\n gfx::NativeWindow parent_window) {\n flow_.reset(static_cast<SyncSetupFlow*>(delegate));\n was_show_html_dialog_called_ = true;\n }\n\n bool TestAndResetWasShowHTMLDialogCalled() {\n bool ret = was_show_html_dialog_called_;\n was_show_html_dialog_called_ = false;\n return ret;\n }\n\n \/\/ Simulates the user (or browser view hierarchy) closing the html dialog.\n \/\/ Handles cleaning up the delegate and associated handlers.\n void CloseDialog() {\n if (flow_.get()) {\n std::vector<DOMMessageHandler*> handlers;\n flow_->GetDOMMessageHandlers(&handlers);\n \/\/ The flow deletes itself here. Don't use reset().\n flow_.release()->OnDialogClosed(\"\");\n STLDeleteElements(&handlers);\n }\n }\n\n SyncSetupFlow* flow() { return flow_.get(); }\n\n private:\n \/\/ In real life, this is owned by the view that is opened by the browser. We\n \/\/ mock all that out, so we need to take ownership so the flow doesn't leak.\n scoped_ptr<SyncSetupFlow> flow_;\n\n bool was_show_html_dialog_called_;\n};\n\nclass SyncSetupWizardTest : public BrowserWithTestWindowTest {\n public:\n SyncSetupWizardTest() : test_window_(NULL), wizard_(NULL) { }\n virtual ~SyncSetupWizardTest() { }\n virtual void SetUp() {\n set_profile(new TestingProfileWithSyncService());\n profile()->CreateBookmarkModel(false);\n \/\/ Wait for the bookmarks model to load.\n profile()->BlockUntilBookmarkModelLoaded();\n set_browser(new Browser(Browser::TYPE_NORMAL, profile()));\n test_window_ = new TestBrowserWindowForWizardTest(browser());\n set_window(test_window_);\n browser()->set_window(window());\n BrowserList::SetLastActive(browser());\n service_ = static_cast<ProfileSyncServiceForWizardTest*>(\n profile()->GetProfileSyncService());\n wizard_.reset(new SyncSetupWizard(service_));\n }\n\n virtual void TearDown() {\n test_window_ = NULL;\n service_ = NULL;\n wizard_.reset();\n }\n\n TestBrowserWindowForWizardTest* test_window_;\n scoped_ptr<SyncSetupWizard> wizard_;\n ProfileSyncServiceForWizardTest* service_;\n};\n\nTEST_F(SyncSetupWizardTest, InitialStepLogin) {\n DictionaryValue dialog_args;\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n std::string json_start_args;\n JSONWriter::Write(&dialog_args, false, &json_start_args);\n ListValue credentials;\n std::string auth = \"{\\\"user\\\":\\\"\";\n auth += std::string(kTestUser) + \"\\\",\\\"pass\\\":\\\"\";\n auth += std::string(kTestPassword) + \"\\\"}\";\n credentials.Append(new StringValue(auth));\n\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->flow());\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->end_state_);\n EXPECT_EQ(json_start_args, test_window_->flow()->dialog_start_args_);\n\n \/\/ Simulate the user submitting credentials.\n test_window_->flow()->flow_handler_->HandleSubmitAuth(&credentials);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n EXPECT_EQ(kTestUser, service_->username_);\n EXPECT_EQ(kTestPassword, service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n EXPECT_FALSE(service_->user_cancelled_dialog_);\n service_->ResetTestStats();\n\n \/\/ Simulate failed credentials.\n service_->set_auth_state(kTestUser, AUTH_ERROR_INVALID_GAIA_CREDENTIALS);\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n dialog_args.Clear();\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n EXPECT_EQ(2, dialog_args.GetSize());\n std::string actual_user;\n dialog_args.GetString(L\"user\", &actual_user);\n EXPECT_EQ(kTestUser, actual_user);\n int error = -1;\n dialog_args.GetInteger(L\"error\", &error);\n EXPECT_EQ(static_cast<int>(AUTH_ERROR_INVALID_GAIA_CREDENTIALS), error);\n service_->set_auth_state(kTestUser, AUTH_ERROR_NONE);\n\n \/\/ Simulate success.\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_SUCCESS,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::DONE); \/\/ No merge and sync.\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, InitialStepMergeAndSync) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->end_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n test_window_->flow()->flow_handler_->HandleSubmitMergeAndSync(NULL);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_TRUE(service_->user_accepted_merge_and_sync_);\n EXPECT_FALSE(service_->user_cancelled_dialog_);\n service_->ResetTestStats();\n wizard_->Step(SyncSetupWizard::DONE); \/\/ No merge and sync.\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, DialogCancelled) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n \/\/ Simulate the user closing the dialog.\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->user_cancelled_dialog_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->user_cancelled_dialog_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n}\n\nTEST_F(SyncSetupWizardTest, InvalidTransitions) {\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::DONE);\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::DONE);\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::FATAL_ERROR);\n EXPECT_EQ(SyncSetupWizard::FATAL_ERROR, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, FullSuccessfulRunSetsPref) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n wizard_->Step(SyncSetupWizard::DONE);\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->profile()->GetPrefs()->GetBoolean(\n prefs::kSyncHasSetupCompleted));\n}\n\nTEST_F(SyncSetupWizardTest, DiscreteRun) {\n DictionaryValue dialog_args;\n \/\/ For a discrete run, we need to have ran through setup once.\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n wizard_->Step(SyncSetupWizard::DONE);\n test_window_->CloseDialog();\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_EQ(SyncSetupWizard::GAIA_SUCCESS, test_window_->flow()->end_state_);\n\n service_->set_auth_state(kTestUser, AUTH_ERROR_INVALID_GAIA_CREDENTIALS);\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n EXPECT_EQ(2, dialog_args.GetSize());\n std::string actual_user;\n dialog_args.GetString(L\"user\", &actual_user);\n EXPECT_EQ(kTestUser, actual_user);\n int error = -1;\n dialog_args.GetInteger(L\"error\", &error);\n EXPECT_EQ(static_cast<int>(AUTH_ERROR_INVALID_GAIA_CREDENTIALS), error);\n service_->set_auth_state(kTestUser, AUTH_ERROR_NONE);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n}\n\n#endif \/\/ CHROME_PERSONALIZATION\n\n<commit_msg>Tweak constants used by sync setup wizard unittest. Reviewed by nick.<commit_after>\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#ifdef CHROME_PERSONALIZATION\n\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\n#include \"base\/json_writer.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/stl_util-inl.h\"\n#include \"chrome\/browser\/browser.h\"\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/sync\/profile_sync_service.h\"\n#include \"chrome\/browser\/views\/sync\/sync_setup_flow.h\"\n#include \"chrome\/browser\/views\/sync\/sync_setup_wizard.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/test\/browser_with_test_window_test.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"chrome\/test\/test_browser_window.h\"\n\nstatic const char* kTestUser = \"chrome.p13n.test@gmail.com\";\nstatic const char* kTestPassword = \"passwd\";\n\n\/\/ A PSS subtype to inject.\nclass ProfileSyncServiceForWizardTest : public ProfileSyncService {\n public:\n explicit ProfileSyncServiceForWizardTest(Profile* profile)\n : ProfileSyncService(profile), user_accepted_merge_and_sync_(false),\n user_cancelled_dialog_(false) {\n RegisterPreferences();\n }\n\n virtual ~ProfileSyncServiceForWizardTest() { }\n\n virtual void OnUserSubmittedAuth(const std::string& username,\n const std::string& password) {\n username_ = username;\n password_ = password;\n }\n virtual void OnUserAcceptedMergeAndSync() {\n user_accepted_merge_and_sync_ = true;\n }\n virtual void OnUserCancelledDialog() {\n user_cancelled_dialog_ = true;\n }\n\n virtual string16 GetAuthenticatedUsername() const {\n return UTF8ToWide(username_);\n }\n\n void set_auth_state(const std::string& last_email, AuthErrorState state) {\n last_attempted_user_email_ = last_email;\n last_auth_error_ = state;\n }\n\n void ResetTestStats() {\n username_.clear();\n password_.clear();\n user_accepted_merge_and_sync_ = false;\n user_cancelled_dialog_ = false;\n }\n\n std::string username_;\n std::string password_;\n bool user_accepted_merge_and_sync_;\n bool user_cancelled_dialog_;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(ProfileSyncServiceForWizardTest);\n};\n\nclass TestingProfileWithSyncService : public TestingProfile {\n public:\n TestingProfileWithSyncService() {\n sync_service_.reset(new ProfileSyncServiceForWizardTest(this));\n }\n\n virtual ProfileSyncService* GetProfileSyncService() {\n return sync_service_.get();\n }\n private:\n scoped_ptr<ProfileSyncService> sync_service_;\n};\n\nclass TestBrowserWindowForWizardTest : public TestBrowserWindow {\n public:\n explicit TestBrowserWindowForWizardTest(Browser* browser)\n : TestBrowserWindow(browser), flow_(NULL),\n was_show_html_dialog_called_(false) {\n }\n\n virtual ~TestBrowserWindowForWizardTest() {\n if (flow_.get()) {\n \/\/ In real life, the handlers are destroyed by the DOMUI infrastructure,\n \/\/ which calls GetDOMMessageHandlers to take ownership. This does not\n \/\/ exist in our test, so we perform cleanup manually.\n std::vector<DOMMessageHandler*> handlers;\n flow_->GetDOMMessageHandlers(&handlers);\n \/\/ The handler contract is that they are valid for the lifetime of the\n \/\/ HTMLDialogUIDelegate, but are cleaned up after the dialog is closed\n \/\/ and\/or deleted.\n flow_.reset();\n STLDeleteElements(&handlers);\n }\n }\n\n \/\/ We intercept this call to hijack the flow created and then use it to\n \/\/ drive the wizard as if we were the HTML page.\n virtual void ShowHTMLDialog(HtmlDialogUIDelegate* delegate,\n gfx::NativeWindow parent_window) {\n flow_.reset(static_cast<SyncSetupFlow*>(delegate));\n was_show_html_dialog_called_ = true;\n }\n\n bool TestAndResetWasShowHTMLDialogCalled() {\n bool ret = was_show_html_dialog_called_;\n was_show_html_dialog_called_ = false;\n return ret;\n }\n\n \/\/ Simulates the user (or browser view hierarchy) closing the html dialog.\n \/\/ Handles cleaning up the delegate and associated handlers.\n void CloseDialog() {\n if (flow_.get()) {\n std::vector<DOMMessageHandler*> handlers;\n flow_->GetDOMMessageHandlers(&handlers);\n \/\/ The flow deletes itself here. Don't use reset().\n flow_.release()->OnDialogClosed(\"\");\n STLDeleteElements(&handlers);\n }\n }\n\n SyncSetupFlow* flow() { return flow_.get(); }\n\n private:\n \/\/ In real life, this is owned by the view that is opened by the browser. We\n \/\/ mock all that out, so we need to take ownership so the flow doesn't leak.\n scoped_ptr<SyncSetupFlow> flow_;\n\n bool was_show_html_dialog_called_;\n};\n\nclass SyncSetupWizardTest : public BrowserWithTestWindowTest {\n public:\n SyncSetupWizardTest() : test_window_(NULL), wizard_(NULL) { }\n virtual ~SyncSetupWizardTest() { }\n virtual void SetUp() {\n set_profile(new TestingProfileWithSyncService());\n profile()->CreateBookmarkModel(false);\n \/\/ Wait for the bookmarks model to load.\n profile()->BlockUntilBookmarkModelLoaded();\n set_browser(new Browser(Browser::TYPE_NORMAL, profile()));\n test_window_ = new TestBrowserWindowForWizardTest(browser());\n set_window(test_window_);\n browser()->set_window(window());\n BrowserList::SetLastActive(browser());\n service_ = static_cast<ProfileSyncServiceForWizardTest*>(\n profile()->GetProfileSyncService());\n wizard_.reset(new SyncSetupWizard(service_));\n }\n\n virtual void TearDown() {\n test_window_ = NULL;\n service_ = NULL;\n wizard_.reset();\n }\n\n TestBrowserWindowForWizardTest* test_window_;\n scoped_ptr<SyncSetupWizard> wizard_;\n ProfileSyncServiceForWizardTest* service_;\n};\n\nTEST_F(SyncSetupWizardTest, InitialStepLogin) {\n DictionaryValue dialog_args;\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n std::string json_start_args;\n JSONWriter::Write(&dialog_args, false, &json_start_args);\n ListValue credentials;\n std::string auth = \"{\\\"user\\\":\\\"\";\n auth += std::string(kTestUser) + \"\\\",\\\"pass\\\":\\\"\";\n auth += std::string(kTestPassword) + \"\\\"}\";\n credentials.Append(new StringValue(auth));\n\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->flow());\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->end_state_);\n EXPECT_EQ(json_start_args, test_window_->flow()->dialog_start_args_);\n\n \/\/ Simulate the user submitting credentials.\n test_window_->flow()->flow_handler_->HandleSubmitAuth(&credentials);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n EXPECT_EQ(kTestUser, service_->username_);\n EXPECT_EQ(kTestPassword, service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n EXPECT_FALSE(service_->user_cancelled_dialog_);\n service_->ResetTestStats();\n\n \/\/ Simulate failed credentials.\n service_->set_auth_state(kTestUser, AUTH_ERROR_INVALID_GAIA_CREDENTIALS);\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n dialog_args.Clear();\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n EXPECT_EQ(2, dialog_args.GetSize());\n std::string actual_user;\n dialog_args.GetString(L\"user\", &actual_user);\n EXPECT_EQ(kTestUser, actual_user);\n int error = -1;\n dialog_args.GetInteger(L\"error\", &error);\n EXPECT_EQ(static_cast<int>(AUTH_ERROR_INVALID_GAIA_CREDENTIALS), error);\n service_->set_auth_state(kTestUser, AUTH_ERROR_NONE);\n\n \/\/ Simulate success.\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::GAIA_SUCCESS,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::DONE); \/\/ No merge and sync.\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, InitialStepMergeAndSync) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->end_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n test_window_->flow()->flow_handler_->HandleSubmitMergeAndSync(NULL);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_TRUE(service_->user_accepted_merge_and_sync_);\n EXPECT_FALSE(service_->user_cancelled_dialog_);\n service_->ResetTestStats();\n wizard_->Step(SyncSetupWizard::DONE); \/\/ No merge and sync.\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n EXPECT_EQ(SyncSetupWizard::DONE, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, DialogCancelled) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n \/\/ Simulate the user closing the dialog.\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->user_cancelled_dialog_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->user_cancelled_dialog_);\n EXPECT_EQ(std::string(), service_->username_);\n EXPECT_EQ(std::string(), service_->password_);\n EXPECT_FALSE(service_->user_accepted_merge_and_sync_);\n}\n\nTEST_F(SyncSetupWizardTest, InvalidTransitions) {\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::DONE);\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_FALSE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::DONE);\n EXPECT_EQ(SyncSetupWizard::GAIA_LOGIN, test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_EQ(SyncSetupWizard::MERGE_AND_SYNC,\n test_window_->flow()->current_state_);\n\n wizard_->Step(SyncSetupWizard::FATAL_ERROR);\n EXPECT_EQ(SyncSetupWizard::FATAL_ERROR, test_window_->flow()->current_state_);\n}\n\nTEST_F(SyncSetupWizardTest, FullSuccessfulRunSetsPref) {\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n wizard_->Step(SyncSetupWizard::DONE);\n test_window_->CloseDialog();\n EXPECT_FALSE(wizard_->IsVisible());\n EXPECT_TRUE(service_->profile()->GetPrefs()->GetBoolean(\n prefs::kSyncHasSetupCompleted));\n}\n\nTEST_F(SyncSetupWizardTest, DiscreteRun) {\n DictionaryValue dialog_args;\n \/\/ For a discrete run, we need to have ran through setup once.\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n wizard_->Step(SyncSetupWizard::MERGE_AND_SYNC);\n wizard_->Step(SyncSetupWizard::DONE);\n test_window_->CloseDialog();\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_EQ(SyncSetupWizard::GAIA_SUCCESS, test_window_->flow()->end_state_);\n\n service_->set_auth_state(kTestUser, AUTH_ERROR_INVALID_GAIA_CREDENTIALS);\n wizard_->Step(SyncSetupWizard::GAIA_LOGIN);\n EXPECT_TRUE(wizard_->IsVisible());\n SyncSetupFlow::GetArgsForGaiaLogin(service_, &dialog_args);\n EXPECT_EQ(2, dialog_args.GetSize());\n std::string actual_user;\n dialog_args.GetString(L\"user\", &actual_user);\n EXPECT_EQ(kTestUser, actual_user);\n int error = -1;\n dialog_args.GetInteger(L\"error\", &error);\n EXPECT_EQ(static_cast<int>(AUTH_ERROR_INVALID_GAIA_CREDENTIALS), error);\n service_->set_auth_state(kTestUser, AUTH_ERROR_NONE);\n\n wizard_->Step(SyncSetupWizard::GAIA_SUCCESS);\n EXPECT_TRUE(test_window_->TestAndResetWasShowHTMLDialogCalled());\n}\n\n#endif \/\/ CHROME_PERSONALIZATION\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xecontent.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2003-09-16 08:18:58 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/ ============================================================================\n\n#ifndef SC_XECONTENT_HXX\n#define SC_XECONTENT_HXX\n\n#ifndef SC_RANGELST_HXX\n#include \"rangelst.hxx\"\n#endif\n\n#ifndef SC_XLCONTENT_HXX\n#include \"xlcontent.hxx\"\n#endif\n#ifndef SC_XERECORD_HXX\n#include \"xerecord.hxx\"\n#endif\n#ifndef SC_XEHELPER_HXX\n#include \"xehelper.hxx\"\n#endif\n\n\n\/* ============================================================================\nClasses to export the big Excel document contents (related to several cells or\nglobals for the document).\n- Shared string table\n- Background bitmap\n- Hyperlinks\n- Label ranges\n- Conditional formatting\n- Data validation\n- Web Queries\n============================================================================ *\/\n\n\/\/ Shared string table ========================================================\n\n\/** Provides export of the SST (shared string table) record.\n @descr Contains all strings in the document and writes the SST. *\/\nclass XclExpSst : public XclExpRecordBase\n{\nprivate:\n ScfDelList< XclExpString > maStringList; \/\/\/ List with formatted and unformatted strings.\n\npublic:\n inline explicit XclExpSst() {}\n virtual ~XclExpSst();\n\n \/** Inserts a new string into the table.\n @return The index of the string in the SST. *\/\n sal_uInt32 Insert( XclExpString* pString );\n\n \/** Writes the complete SST and EXTSST records. *\/\n virtual void Save( XclExpStream& rStrm );\n};\n\n\n\/\/ Background bitmap ==========================================================\n\nclass Graphic;\n\n\/** Provides export of a background bitmap of a sheet. *\/\nclass XclExpBitmap : public XclExpRecord\n{\nprivate:\n const Graphic* mpGraphic; \/\/\/ Pointer to the bitmap in a brush item.\n\npublic:\n explicit XclExpBitmap( const XclExpRoot& rRoot );\n\n \/** Writes the BITMAP record, if mpGraphic points to a bitmap. *\/\n virtual void Save( XclExpStream& rStrm );\n};\n\n\n\/\/ Hyperlinks =================================================================\n\nclass SvxURLField;\nclass INetURLObject;\n\n\/** Provides export of hyperlink data. *\/\nclass XclExpHyperlink : public XclExpRecord\n{\nprivate:\n typedef ::std::auto_ptr< String > StringPtr;\n typedef ::std::auto_ptr< SvStream > SvStreamPtr;\n\nprivate:\n ScAddress maPos; \/\/\/ Position of the hyperlink.\n sal_uInt32 mnFlags; \/\/\/ Option flags.\n StringPtr mpRepr; \/\/\/ Cell representation text.\n SvStreamPtr mpVarData; \/\/\/ Buffer stream with variable data.\n\npublic:\n \/** Constructs the HLINK record from an URL text field. *\/\n explicit XclExpHyperlink( const XclExpRoot& rRoot, const SvxURLField& rUrlField );\n virtual ~XclExpHyperlink();\n\n \/** Sets the cell position of the hyperlink. *\/\n inline void SetPosition( const ScAddress& rPos ) { maPos = rPos; }\n\n \/** Returns the cell representation text or NULL, if not available. *\/\n inline const String* GetRepr() const { return mpRepr.get(); }\n\nprivate:\n \/** Builds path and file name from the passed URL object.\n @param rName (out) The path + file name for export.\n @param rnLevel (out) The parent directory level.\n @param rbRel (out) true = path is relative. *\/\n void BuildFileName(\n String& rName, sal_uInt16& rnLevel, bool& rbRel,\n const INetURLObject& rUrlObj, const XclExpRoot& rRoot ) const;\n\n \/** Writes the body of the HLINK record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\ntypedef XclExpRecordList< XclExpHyperlink > XclExpHyperlinkList;\n\n\n\/\/ Label ranges ===============================================================\n\n\/** Provides export of the row\/column label range list of a sheet. *\/\nclass XclExpLabelranges : public XclExpRecord\n{\npublic:\n \/** Fills the cell range lists with all ranges of the current sheet. *\/\n explicit XclExpLabelranges( const XclExpRoot& rRoot );\n\n \/** Writes the LABELRANGES record if it contains at least one range. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Fills the specified range list with all label headers of the current sheet.\n @param rRanges The cell range list to fill.\n @param xLabelRangesRef The core range list with all ranges.\n @param nTab The current sheet index. *\/\n void FillRangeList( ScRangeList& rRanges, ScRangePairListRef xLabelRangesRef, sal_uInt16 nTab );\n\n \/** Writes the body of the LABELRANGES record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n ScRangeList maRowRanges; \/\/\/ Cell range list for row labels.\n ScRangeList maColRanges; \/\/\/ Cell range list for column labels.\n};\n\n\n\/\/ Conditional formatting =====================================================\n\nclass ScCondFormatEntry;\nclass XclExpCF_Impl;\n\n\/** Represents a CF record that contains one condition of a conditional format. *\/\nclass XclExpCF : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpCF( const XclExpRoot& rRoot, const ScCondFormatEntry& rFormatEntry );\n virtual ~XclExpCF();\n\nprivate:\n \/** Writes the body of the CF record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef ::std::auto_ptr< XclExpCF_Impl > XclExpCF_ImplPtr;\n XclExpCF_ImplPtr mpImpl;\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScConditionalFormat;\n\n\/** Represents a CONDFMT record that contains all conditions of a conditional format.\n @descr Contains the conditions which are stored in CF records. *\/\nclass XclExpCondfmt : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpCondfmt( const XclExpRoot& rRoot, const ScConditionalFormat& rCondFormat );\n virtual ~XclExpCondfmt();\n\n \/** Returns true, if this conditional format contains at least one cell range and CF record. *\/\n bool IsValid() const;\n\n \/** Writes the CONDFMT record with following CF records, if there is valid data. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Writes the body of the CONDFMT record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpCF > XclExpCFList;\n\n XclExpCFList maCFList; \/\/\/ List of CF records.\n ScRangeList maRanges; \/\/\/ Cell ranges for this conditional format.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains all conditional formats of a specific sheet. *\/\nclass XclExpCondFormatBuffer : public XclExpRecordBase\n{\npublic:\n \/** Constructs CONDFMT and CF records containing the conditional formats of the current sheet. *\/\n explicit XclExpCondFormatBuffer( const XclExpRoot& rRoot );\n\n \/** Writes all contained CONDFMT records with their CF records. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpCondfmt > XclExpCondfmtList;\n XclExpCondfmtList maCondfmtList; \/\/\/ List of CONDFMT records.\n};\n\n\n\/\/ Data Validation ============================================================\n\nclass ScValidationData;\n\n\/** Provides export of the data of a DV record.\n @descr This record contains the settings for a data validation. In detail\n this is a pointer to the core validation data and a cell range list with all\n affected cells. The handle index is used to optimize list search algorithm. *\/\nclass XclExpDV : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpDV( const XclExpRoot& rRoot, sal_uInt32 nHandle );\n\n \/** Returns the core handle of the validation data. *\/\n inline sal_uInt32 GetHandle() const { return mnHandle; }\n\n \/** Inserts a new cell range into the cell range list. *\/\n void InsertCellRange( const ScRange& rPos );\n \/** Checks the record contents and crops the range list.\n @return false = Do not write this record. *\/\n bool CheckWriteRecord();\n\nprivate:\n \/** Writes the body of the DV record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n ScRangeList maRanges; \/\/\/ A list with all affected cells.\n const ScValidationData* mpValData; \/\/\/ Pointer to the core data (no ownership).\n sal_uInt32 mnHandle; \/\/\/ The core handle for quick list search.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** This class contains the DV record list following the DVAL record. *\/\nclass XclExpDval : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpDval( const XclExpRoot& rRoot );\n\n \/** Inserts the specified cell range into the range list of the DV record with\n the specified handle. *\/\n void InsertCellRange( const ScRange& rRange, sal_uInt32 nHandle );\n\n \/** Writes the DVAL record and the DV record list. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Searches for or creates a XclExpDV record object with the specified handle. *\/\n XclExpDV& SearchOrCreateDv( sal_uInt32 nHandle );\n\n \/** Writes the body of the DVAL record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpDV > XclExpDVList;\n\n XclExpDVList maDVList; \/\/\/ List of DV records\n XclExpDV* mpLastFoundDV; \/\/\/ For search optimization.\n};\n\n\n\/\/ Web Queries ================================================================\n\n\/** Contains all records for a web query (linked tables in an HTML document).\n @descr mode 1 (entire document): mpQryTables==NULL, mbEntireDoc==true;\n mode 2 (all tables): mpQryTables==NULL, mbEntireDoc==false;\n mode 3 (custom range list): mpQryTables!=NULL, mbEntireDoc==false. *\/\nclass XclExpWebQuery : public XclExpRecordBase\n{\npublic:\n \/** Constructs a web query record container with settings from Calc. *\/\n explicit XclExpWebQuery(\n const String& rRangeName,\n const String& rUrl,\n const String& rSource,\n sal_Int32 nRefrSecs );\n virtual ~XclExpWebQuery();\n\n \/** Writes all needed records for this web query. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n XclExpString maDestRange; \/\/\/ Destination range.\n XclExpString maUrl; \/\/\/ Source document URL.\n XclExpString* mpQryTables; \/\/\/ List of source range names.\n sal_Int16 mnRefresh; \/\/\/ Refresh time in minutes.\n bool mbEntireDoc; \/\/\/ true = entire document.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains all web query records for this document. *\/\nclass XclExpWebQueryBuffer : public XclExpRecordList< XclExpWebQuery >\n{\npublic:\n explicit XclExpWebQueryBuffer( const XclExpRoot& rRoot );\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calc17 (1.2.124); FILE MERGED 2003\/09\/22 16:54:41 dr 1.2.124.4: #100887# reduce SST with hash table 2003\/09\/19 07:43:15 dr 1.2.124.3: #100887# preparations for SST optimisation 2003\/09\/18 06:57:33 dr 1.2.124.2: RESYNC: (1.2-1.3); FILE MERGED 2003\/08\/18 14:14:35 dr 1.2.124.1: #111865# page settings reimplemented<commit_after>\/*************************************************************************\n *\n * $RCSfile: xecontent.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: hr $ $Date: 2003-11-05 13:39:52 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/ ============================================================================\n\n#ifndef SC_XECONTENT_HXX\n#define SC_XECONTENT_HXX\n\n#ifndef SC_RANGELST_HXX\n#include \"rangelst.hxx\"\n#endif\n\n#ifndef SC_XLCONTENT_HXX\n#include \"xlcontent.hxx\"\n#endif\n#ifndef SC_XEROOT_HXX\n#include \"xeroot.hxx\"\n#endif\n#ifndef SC_XERECORD_HXX\n#include \"xerecord.hxx\"\n#endif\n#ifndef SC_XESTRING_HXX\n#include \"xestring.hxx\"\n#endif\n\n\n\/* ============================================================================\nClasses to export the big Excel document contents (related to several cells or\nglobals for the document).\n- Shared string table\n- Hyperlinks\n- Label ranges\n- Conditional formatting\n- Data validation\n- Web Queries\n============================================================================ *\/\n\n\/\/ Shared string table ========================================================\n\nclass XclExpSst_Impl;\n\n\/** Provides export of the SST (shared string table) record.\n @descr Contains all strings in the document and writes the SST. *\/\nclass XclExpSst : public XclExpRecordBase\n{\npublic:\n explicit XclExpSst();\n virtual ~XclExpSst();\n\n \/** Inserts a new string into the table.\n @return The index of the string in the SST, used in other records. *\/\n sal_uInt32 Insert( XclExpStringPtr pString );\n\n \/** Writes the complete SST and EXTSST records. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n typedef ::std::auto_ptr< XclExpSst_Impl > XclExpSst_ImplPtr;\n XclExpSst_ImplPtr mpImpl;\n};\n\n\n\/\/ Hyperlinks =================================================================\n\nclass SvxURLField;\nclass INetURLObject;\n\n\/** Provides export of hyperlink data. *\/\nclass XclExpHyperlink : public XclExpRecord\n{\npublic:\n \/** Constructs the HLINK record from an URL text field. *\/\n explicit XclExpHyperlink( const XclExpRoot& rRoot, const SvxURLField& rUrlField );\n virtual ~XclExpHyperlink();\n\n \/** Sets the cell position of the hyperlink. *\/\n inline void SetPosition( const ScAddress& rPos ) { maPos = rPos; }\n\n \/** Returns the cell representation text or NULL, if not available. *\/\n inline const String* GetRepr() const { return mpRepr.get(); }\n\nprivate:\n \/** Builds path and file name from the passed URL object.\n @param rName (out) The path + file name for export.\n @param rnLevel (out) The parent directory level.\n @param rbRel (out) true = path is relative. *\/\n void BuildFileName(\n String& rName, sal_uInt16& rnLevel, bool& rbRel,\n const INetURLObject& rUrlObj, const XclExpRoot& rRoot ) const;\n\n \/** Writes the body of the HLINK record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef ::std::auto_ptr< String > StringPtr;\n typedef ::std::auto_ptr< SvStream > SvStreamPtr;\n\n ScAddress maPos; \/\/\/ Position of the hyperlink.\n StringPtr mpRepr; \/\/\/ Cell representation text.\n SvStreamPtr mpVarData; \/\/\/ Buffer stream with variable data.\n sal_uInt32 mnFlags; \/\/\/ Option flags.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\ntypedef XclExpRecordList< XclExpHyperlink > XclExpHyperlinkList;\n\n\n\/\/ Label ranges ===============================================================\n\n\/** Provides export of the row\/column label range list of a sheet. *\/\nclass XclExpLabelranges : public XclExpRecord\n{\npublic:\n \/** Fills the cell range lists with all ranges of the current sheet. *\/\n explicit XclExpLabelranges( const XclExpRoot& rRoot );\n\n \/** Writes the LABELRANGES record if it contains at least one range. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Fills the specified range list with all label headers of the current sheet.\n @param rRanges The cell range list to fill.\n @param xLabelRangesRef The core range list with all ranges.\n @param nTab The current sheet index. *\/\n void FillRangeList( ScRangeList& rRanges, ScRangePairListRef xLabelRangesRef, sal_uInt16 nTab );\n\n \/** Writes the body of the LABELRANGES record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n ScRangeList maRowRanges; \/\/\/ Cell range list for row labels.\n ScRangeList maColRanges; \/\/\/ Cell range list for column labels.\n};\n\n\n\/\/ Conditional formatting =====================================================\n\nclass ScCondFormatEntry;\nclass XclExpCF_Impl;\n\n\/** Represents a CF record that contains one condition of a conditional format. *\/\nclass XclExpCF : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpCF( const XclExpRoot& rRoot, const ScCondFormatEntry& rFormatEntry );\n virtual ~XclExpCF();\n\nprivate:\n \/** Writes the body of the CF record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef ::std::auto_ptr< XclExpCF_Impl > XclExpCF_ImplPtr;\n XclExpCF_ImplPtr mpImpl;\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\nclass ScConditionalFormat;\n\n\/** Represents a CONDFMT record that contains all conditions of a conditional format.\n @descr Contains the conditions which are stored in CF records. *\/\nclass XclExpCondfmt : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpCondfmt( const XclExpRoot& rRoot, const ScConditionalFormat& rCondFormat );\n virtual ~XclExpCondfmt();\n\n \/** Returns true, if this conditional format contains at least one cell range and CF record. *\/\n bool IsValid() const;\n\n \/** Writes the CONDFMT record with following CF records, if there is valid data. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Writes the body of the CONDFMT record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpCF > XclExpCFList;\n\n XclExpCFList maCFList; \/\/\/ List of CF records.\n ScRangeList maRanges; \/\/\/ Cell ranges for this conditional format.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains all conditional formats of a specific sheet. *\/\nclass XclExpCondFormatBuffer : public XclExpRecordBase\n{\npublic:\n \/** Constructs CONDFMT and CF records containing the conditional formats of the current sheet. *\/\n explicit XclExpCondFormatBuffer( const XclExpRoot& rRoot );\n\n \/** Writes all contained CONDFMT records with their CF records. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpCondfmt > XclExpCondfmtList;\n XclExpCondfmtList maCondfmtList; \/\/\/ List of CONDFMT records.\n};\n\n\n\/\/ Data Validation ============================================================\n\nclass ScValidationData;\n\n\/** Provides export of the data of a DV record.\n @descr This record contains the settings for a data validation. In detail\n this is a pointer to the core validation data and a cell range list with all\n affected cells. The handle index is used to optimize list search algorithm. *\/\nclass XclExpDV : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpDV( const XclExpRoot& rRoot, sal_uInt32 nHandle );\n\n \/** Returns the core handle of the validation data. *\/\n inline sal_uInt32 GetHandle() const { return mnHandle; }\n\n \/** Inserts a new cell range into the cell range list. *\/\n void InsertCellRange( const ScRange& rPos );\n \/** Checks the record contents and crops the range list.\n @return false = Do not write this record. *\/\n bool CheckWriteRecord();\n\nprivate:\n \/** Writes the body of the DV record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n ScRangeList maRanges; \/\/\/ A list with all affected cells.\n const ScValidationData* mpValData; \/\/\/ Pointer to the core data (no ownership).\n sal_uInt32 mnHandle; \/\/\/ The core handle for quick list search.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** This class contains the DV record list following the DVAL record. *\/\nclass XclExpDval : public XclExpRecord, protected XclExpRoot\n{\npublic:\n explicit XclExpDval( const XclExpRoot& rRoot );\n\n \/** Inserts the specified cell range into the range list of the DV record with\n the specified handle. *\/\n void InsertCellRange( const ScRange& rRange, sal_uInt32 nHandle );\n\n \/** Writes the DVAL record and the DV record list. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n \/** Searches for or creates a XclExpDV record object with the specified handle. *\/\n XclExpDV& SearchOrCreateDv( sal_uInt32 nHandle );\n\n \/** Writes the body of the DVAL record. *\/\n virtual void WriteBody( XclExpStream& rStrm );\n\nprivate:\n typedef XclExpRecordList< XclExpDV > XclExpDVList;\n\n XclExpDVList maDVList; \/\/\/ List of DV records\n XclExpDV* mpLastFoundDV; \/\/\/ For search optimization.\n};\n\n\n\/\/ Web Queries ================================================================\n\n\/** Contains all records for a web query (linked tables in an HTML document).\n @descr mode 1 (entire document): mpQryTables==NULL, mbEntireDoc==true;\n mode 2 (all tables): mpQryTables==NULL, mbEntireDoc==false;\n mode 3 (custom range list): mpQryTables!=NULL, mbEntireDoc==false. *\/\nclass XclExpWebQuery : public XclExpRecordBase\n{\npublic:\n \/** Constructs a web query record container with settings from Calc. *\/\n explicit XclExpWebQuery(\n const String& rRangeName,\n const String& rUrl,\n const String& rSource,\n sal_Int32 nRefrSecs );\n virtual ~XclExpWebQuery();\n\n \/** Writes all needed records for this web query. *\/\n virtual void Save( XclExpStream& rStrm );\n\nprivate:\n XclExpString maDestRange; \/\/\/ Destination range.\n XclExpString maUrl; \/\/\/ Source document URL.\n XclExpStringPtr mpQryTables; \/\/\/ List of source range names.\n sal_Int16 mnRefresh; \/\/\/ Refresh time in minutes.\n bool mbEntireDoc; \/\/\/ true = entire document.\n};\n\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** Contains all web query records for this document. *\/\nclass XclExpWebQueryBuffer : public XclExpRecordList< XclExpWebQuery >\n{\npublic:\n explicit XclExpWebQueryBuffer( const XclExpRoot& rRoot );\n};\n\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: xladdress.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2005-02-21 13:46:20 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef SC_XLADDRESS_HXX\n#define SC_XLADDRESS_HXX\n\n#include <vector>\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\nclass ScRangeList;\nclass XclImpStream;\nclass XclExpStream;\n\n\/\/ ============================================================================\n\n\/** A 2D cell address struct with Excel column and row indexes. *\/\nstruct XclAddress\n{\n sal_uInt16 mnCol;\n sal_uInt16 mnRow;\n\n inline explicit XclAddress( ScAddress::Uninitialized ) {}\n inline explicit XclAddress() : mnCol( 0 ), mnRow( 0 ) {}\n inline explicit XclAddress( sal_uInt16 nCol, sal_uInt16 nRow ) : mnCol( nCol ), mnRow( nRow ) {}\n\n inline void Set( sal_uInt16 nCol, sal_uInt16 nRow ) { mnCol = nCol; mnRow = nRow; }\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n};\n\ninline bool operator==( const XclAddress& rL, const XclAddress& rR )\n{\n return (rL.mnCol == rR.mnCol) && (rL.mnRow == rR.mnRow);\n}\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclAddress& rXclPos )\n{\n rXclPos.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclAddress& rXclPos )\n{\n rXclPos.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** A 2D cell range address struct with Excel column and row indexes. *\/\nstruct XclRange\n{\n XclAddress maFirst;\n XclAddress maLast;\n\n inline explicit XclRange( ScAddress::Uninitialized e ) : maFirst( e ), maLast( e ) {}\n inline explicit XclRange() {}\n inline explicit XclRange( const XclAddress& rPos ) : maFirst( rPos ), maLast( rPos ) {}\n inline explicit XclRange( const XclAddress& rFirst, const XclAddress& rLast ) : maFirst( rFirst ), maLast( rLast ) {}\n inline explicit XclRange( sal_uInt16 nCol1, sal_uInt16 nRow1, sal_uInt16 nCol2, sal_uInt16 nRow2 ) :\n maFirst( nCol1, nRow1 ), maLast( nCol2, nRow2 ) {}\n\n inline void Set( const XclAddress& rFirst, const XclAddress& rLast )\n { maFirst = rFirst; maLast = rLast; }\n inline void Set( sal_uInt16 nCol1, sal_uInt16 nRow1, sal_uInt16 nCol2, sal_uInt16 nRow2 )\n { maFirst.Set( nCol1, nRow1 ); maLast.Set( nCol2, nRow2 ); }\n\n inline sal_uInt16 GetColCount() const { return maLast.mnCol - maFirst.mnCol + 1; }\n inline sal_uInt16 GetRowCount() const { return maLast.mnRow - maFirst.mnRow + 1; }\n bool Contains( const XclAddress& rPos ) const;\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n};\n\ninline bool operator==( const XclRange& rL, const XclRange& rR )\n{\n return (rL.maFirst == rR.maFirst) && (rL.maLast == rR.maLast);\n}\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclRange& rXclRange )\n{\n rXclRange.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclRange& rXclRange )\n{\n rXclRange.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** A 2D cell range address list with Excel column and row indexes. *\/\nclass XclRangeList : public ::std::vector< XclRange >\n{\npublic:\n inline explicit XclRangeList() {}\n\n XclRange GetEnclosingRange() const;\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n void WriteSubList( XclExpStream& rStrm,\n size_t nBegin, size_t nCount, bool bCol16Bit = true ) const;\n};\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclRangeList& rXclRanges )\n{\n rXclRanges.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclRangeList& rXclRanges )\n{\n rXclRanges.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ============================================================================\n\nclass XclTracer;\n\n\/** Base class for import\/export address converters. *\/\nclass XclAddressConverterBase\n{\npublic:\n explicit XclAddressConverterBase( XclTracer& rTracer, const ScAddress& rMaxPos );\n virtual ~XclAddressConverterBase();\n\n \/** Returns whether the \"some columns have been cut\" warning box should be shown. *\/\n inline bool IsColTruncated() const { return mbColTrunc; }\n \/** Returns whether the \"some rows have been cut\" warning box should be shown. *\/\n inline bool IsRowTruncated() const { return mbRowTrunc; }\n \/** Returns whether the \"some sheets have been cut\" warning box should be shown. *\/\n inline bool IsTabTruncated() const { return mbTabTrunc; }\n\n \/\/ ------------------------------------------------------------------------\n\n \/** Checks if the passed sheet index is valid.\n @param nScTab The sheet index to check.\n @param bWarn true = Sets the internal flag that produces a warning box\n after loading\/saving the file, if the sheet index is not valid.\n @return true = Sheet index in nScTab is valid. *\/\n bool CheckScTab( SCTAB nScTab, bool bWarn );\n\n \/\/ ------------------------------------------------------------------------\nprotected:\n XclTracer& mrTracer; \/\/\/ Tracer for invalid addresses.\n ScAddress maMaxPos; \/\/\/ Default maximum position.\n sal_uInt16 mnMaxCol; \/\/\/ Maximum column index, as 16-bit value.\n sal_uInt16 mnMaxRow; \/\/\/ Maximum row index, as 16-bit value.\n bool mbColTrunc; \/\/\/ Flag for \"columns truncated\" warning box.\n bool mbRowTrunc; \/\/\/ Flag for \"rows truncated\" warning box.\n bool mbTabTrunc; \/\/\/ Flag for \"tables truncated\" warning box.\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<commit_msg>INTEGRATION: CWS calc31 (1.2.34); FILE MERGED 2005\/03\/22 10:49:32 dr 1.2.34.1: #110921# import\/export of formatted hyperlinks<commit_after>\/*************************************************************************\n *\n * $RCSfile: xladdress.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-03-29 11:49:34 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef SC_XLADDRESS_HXX\n#define SC_XLADDRESS_HXX\n\n#include <vector>\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\nclass ScRangeList;\nclass XclImpStream;\nclass XclExpStream;\n\n\/\/ ============================================================================\n\n\/** A 2D cell address struct with Excel column and row indexes. *\/\nstruct XclAddress\n{\n sal_uInt16 mnCol;\n sal_uInt16 mnRow;\n\n inline explicit XclAddress( ScAddress::Uninitialized ) {}\n inline explicit XclAddress() : mnCol( 0 ), mnRow( 0 ) {}\n inline explicit XclAddress( sal_uInt16 nCol, sal_uInt16 nRow ) : mnCol( nCol ), mnRow( nRow ) {}\n\n inline void Set( sal_uInt16 nCol, sal_uInt16 nRow ) { mnCol = nCol; mnRow = nRow; }\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n};\n\ninline bool operator==( const XclAddress& rL, const XclAddress& rR )\n{\n return (rL.mnCol == rR.mnCol) && (rL.mnRow == rR.mnRow);\n}\n\ninline bool operator<( const XclAddress& rL, const XclAddress& rR )\n{\n return (rL.mnCol < rR.mnCol) || ((rL.mnCol == rR.mnCol) && (rL.mnRow < rR.mnRow));\n}\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclAddress& rXclPos )\n{\n rXclPos.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclAddress& rXclPos )\n{\n rXclPos.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** A 2D cell range address struct with Excel column and row indexes. *\/\nstruct XclRange\n{\n XclAddress maFirst;\n XclAddress maLast;\n\n inline explicit XclRange( ScAddress::Uninitialized e ) : maFirst( e ), maLast( e ) {}\n inline explicit XclRange() {}\n inline explicit XclRange( const XclAddress& rPos ) : maFirst( rPos ), maLast( rPos ) {}\n inline explicit XclRange( const XclAddress& rFirst, const XclAddress& rLast ) : maFirst( rFirst ), maLast( rLast ) {}\n inline explicit XclRange( sal_uInt16 nCol1, sal_uInt16 nRow1, sal_uInt16 nCol2, sal_uInt16 nRow2 ) :\n maFirst( nCol1, nRow1 ), maLast( nCol2, nRow2 ) {}\n\n inline void Set( const XclAddress& rFirst, const XclAddress& rLast )\n { maFirst = rFirst; maLast = rLast; }\n inline void Set( sal_uInt16 nCol1, sal_uInt16 nRow1, sal_uInt16 nCol2, sal_uInt16 nRow2 )\n { maFirst.Set( nCol1, nRow1 ); maLast.Set( nCol2, nRow2 ); }\n\n inline sal_uInt16 GetColCount() const { return maLast.mnCol - maFirst.mnCol + 1; }\n inline sal_uInt16 GetRowCount() const { return maLast.mnRow - maFirst.mnRow + 1; }\n bool Contains( const XclAddress& rPos ) const;\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n};\n\ninline bool operator==( const XclRange& rL, const XclRange& rR )\n{\n return (rL.maFirst == rR.maFirst) && (rL.maLast == rR.maLast);\n}\n\ninline bool operator<( const XclRange& rL, const XclRange& rR )\n{\n return (rL.maFirst < rR.maFirst) || ((rL.maFirst == rR.maFirst) && (rL.maLast < rR.maLast));\n}\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclRange& rXclRange )\n{\n rXclRange.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclRange& rXclRange )\n{\n rXclRange.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ----------------------------------------------------------------------------\n\n\/** A 2D cell range address list with Excel column and row indexes. *\/\nclass XclRangeList : public ::std::vector< XclRange >\n{\npublic:\n inline explicit XclRangeList() {}\n\n XclRange GetEnclosingRange() const;\n\n void Read( XclImpStream& rStrm, bool bCol16Bit = true );\n void Write( XclExpStream& rStrm, bool bCol16Bit = true ) const;\n void WriteSubList( XclExpStream& rStrm,\n size_t nBegin, size_t nCount, bool bCol16Bit = true ) const;\n};\n\ninline XclImpStream& operator>>( XclImpStream& rStrm, XclRangeList& rXclRanges )\n{\n rXclRanges.Read( rStrm );\n return rStrm;\n}\n\ninline XclExpStream& operator<<( XclExpStream& rStrm, const XclRangeList& rXclRanges )\n{\n rXclRanges.Write( rStrm );\n return rStrm;\n}\n\n\/\/ ============================================================================\n\nclass XclTracer;\n\n\/** Base class for import\/export address converters. *\/\nclass XclAddressConverterBase\n{\npublic:\n explicit XclAddressConverterBase( XclTracer& rTracer, const ScAddress& rMaxPos );\n virtual ~XclAddressConverterBase();\n\n \/** Returns whether the \"some columns have been cut\" warning box should be shown. *\/\n inline bool IsColTruncated() const { return mbColTrunc; }\n \/** Returns whether the \"some rows have been cut\" warning box should be shown. *\/\n inline bool IsRowTruncated() const { return mbRowTrunc; }\n \/** Returns whether the \"some sheets have been cut\" warning box should be shown. *\/\n inline bool IsTabTruncated() const { return mbTabTrunc; }\n\n \/\/ ------------------------------------------------------------------------\n\n \/** Checks if the passed sheet index is valid.\n @param nScTab The sheet index to check.\n @param bWarn true = Sets the internal flag that produces a warning box\n after loading\/saving the file, if the sheet index is not valid.\n @return true = Sheet index in nScTab is valid. *\/\n bool CheckScTab( SCTAB nScTab, bool bWarn );\n\n \/\/ ------------------------------------------------------------------------\nprotected:\n XclTracer& mrTracer; \/\/\/ Tracer for invalid addresses.\n ScAddress maMaxPos; \/\/\/ Default maximum position.\n sal_uInt16 mnMaxCol; \/\/\/ Maximum column index, as 16-bit value.\n sal_uInt16 mnMaxRow; \/\/\/ Maximum row index, as 16-bit value.\n bool mbColTrunc; \/\/\/ Flag for \"columns truncated\" warning box.\n bool mbRowTrunc; \/\/\/ Flag for \"rows truncated\" warning box.\n bool mbTabTrunc; \/\/\/ Flag for \"tables truncated\" warning box.\n};\n\n\/\/ ============================================================================\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Peloton\n\/\/\n\/\/ properties.cpp\n\/\/\n\/\/ Identification: src\/optimizer\/properties.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"optimizer\/properties.h\"\n\n#include \"optimizer\/property.h\"\n#include \"optimizer\/property_visitor.h\"\n\nnamespace peloton {\nnamespace optimizer {\n\n\/*************** PropertyColumns *****************\/\n\nPropertyColumns::PropertyColumns(\n std::vector<std::shared_ptr<expression::AbstractExpression>> column_exprs)\n : column_exprs_(std::move(column_exprs)) {}\n\nPropertyType PropertyColumns::Type() const { return PropertyType::COLUMNS; }\n\nbool PropertyColumns::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::COLUMNS) {\n return false;\n }\n const PropertyColumns &r_columns =\n *reinterpret_cast<const PropertyColumns *>(&r);\n \/\/ lhs is less than rhs if size is smaller\n if (column_exprs_.size() < r_columns.column_exprs_.size()) {\n return false;\n }\n \/\/ check that every column in the right hand side property exists in the left\n \/\/ hand side property\n for (auto r_column : r_columns.column_exprs_) {\n bool has_column = false;\n for (auto column : column_exprs_) {\n if (column->Equals(r_column.get())) {\n has_column = true;\n break;\n }\n }\n if (has_column == false) return false;\n }\n\n return true;\n}\n\nbool PropertyColumns::HasStarExpression() const {\n for (auto expr : column_exprs_) {\n if (expr->GetExpressionType() == ExpressionType::STAR) return true;\n }\n return false;\n}\n\nhash_t PropertyColumns::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n for (auto expr : column_exprs_) {\n hash = HashUtil::SumHashes(hash, expr->Hash());\n }\n return hash;\n}\n\nvoid PropertyColumns::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyColumns *)this);\n}\n\nstd::string PropertyColumns::ToString() const {\n std::string str = PropertyTypeToString(Type()) + \": \";\n for (auto column_expr : column_exprs_) {\n if (column_expr->GetExpressionType() == ExpressionType::VALUE_TUPLE) {\n str += ((expression::TupleValueExpression *)column_expr.get())\n ->GetColumnName();\n str += \" \";\n } else {\n column_expr->DeduceExpressionName();\n str += column_expr->GetExpressionName();\n str += \" \";\n }\n }\n return str + \"\\n\";\n}\n\n\/*************** PropertyDistinct *****************\/\n\nPropertyDistinct::PropertyDistinct(\n std::vector<std::shared_ptr<expression::AbstractExpression>>\n distinct_column_exprs)\n : distinct_column_exprs_(std::move(distinct_column_exprs)) {\n LOG_TRACE(\"Size of column property: %ld\", distinct_column_exprs_.size());\n}\n\nPropertyType PropertyDistinct::Type() const { return PropertyType::DISTINCT; }\n\nbool PropertyDistinct::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::DISTINCT) return false;\n const PropertyDistinct &r_columns =\n *reinterpret_cast<const PropertyDistinct *>(&r);\n\n \/\/ check that every column in the left hand side property exists in the right\n \/\/ hand side property. which is the opposite to\n \/\/ the condition of propertyColumns\n \/\/ e.g. distinct(col_a) >= distinct(col_a, col_b)\n for (auto r_column : r_columns.distinct_column_exprs_) {\n bool has_column = false;\n for (auto column : distinct_column_exprs_) {\n if (column->Equals(r_column.get())) {\n has_column = true;\n break;\n }\n }\n if (has_column == false) return false;\n }\n\n return true;\n}\n\nhash_t PropertyDistinct::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n for (auto expr : distinct_column_exprs_) {\n hash = HashUtil::CombineHashes(hash, expr->Hash());\n }\n return hash;\n}\n\nvoid PropertyDistinct::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyDistinct *)this);\n}\n\nstd::string PropertyDistinct::ToString() const {\n std::string str = PropertyTypeToString(Type()) + \": \";\n for (auto column_expr : distinct_column_exprs_) {\n if (column_expr->GetExpressionType() == ExpressionType::VALUE_TUPLE) {\n str += ((expression::TupleValueExpression *)column_expr.get())\n ->GetColumnName();\n str += \" \";\n } else {\n \/\/ TODO: Add support for other expression\n str += \"expr \";\n }\n }\n return str + \"\\n\";\n}\n\n\/*************** PropertyLimit *****************\/\n\nPropertyType PropertyLimit::Type() const { return PropertyType::LIMIT; }\n\nbool PropertyLimit::operator>=(const Property &r) const {\n if (r.Type() != PropertyType::LIMIT) return false;\n const PropertyLimit &r_limit = *reinterpret_cast<const PropertyLimit *>(&r);\n return offset_ == r_limit.offset_ && limit_ == r_limit.limit_;\n}\n\nhash_t PropertyLimit::Hash() const {\n hash_t hash = Property::Hash();\n HashUtil::CombineHashes(hash, offset_);\n HashUtil::CombineHashes(hash, limit_);\n return hash;\n}\n\nvoid PropertyLimit::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyLimit *)this);\n}\n\nstd::string PropertyLimit::ToString() const {\n std::string res = PropertyTypeToString(Type());\n res += std::to_string(offset_) + \" \" + std::to_string(limit_) + \"\\n\";\n return res;\n}\n\n\/*************** PropertySort *****************\/\n\nPropertySort::PropertySort(\n std::vector<std::shared_ptr<expression::AbstractExpression>> sort_columns,\n std::vector<bool> sort_ascending)\n : sort_columns_(std::move(sort_columns)),\n sort_ascending_(std::move(sort_ascending)) {}\n\nPropertyType PropertySort::Type() const { return PropertyType::SORT; }\n\nbool PropertySort::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::SORT) return false;\n const PropertySort &r_sort = *reinterpret_cast<const PropertySort *>(&r);\n\n \/\/ All the sorting orders in r must be satisfied\n size_t num_sort_columns = r_sort.sort_columns_.size();\n PL_ASSERT(num_sort_columns == r_sort.sort_ascending_.size());\n for (size_t i = 0; i < num_sort_columns; ++i) {\n if (!sort_columns_[i]->Equals(r_sort.sort_columns_[i].get())) return false;\n if (sort_ascending_[i] != r_sort.sort_ascending_[i]) return false;\n }\n return true;\n}\n\nhash_t PropertySort::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n\n \/\/ hash sorting columns\n size_t num_sort_columns = sort_columns_.size();\n for (size_t i = 0; i < num_sort_columns; ++i) {\n hash = HashUtil::CombineHashes(hash, sort_columns_[i]->Hash());\n hash = HashUtil::CombineHashes(hash, sort_ascending_[i]);\n }\n return hash;\n}\n\nvoid PropertySort::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertySort *)this);\n}\n\nstd::string PropertySort::ToString() const {\n return PropertyTypeToString(Type()) + \"\\n\";\n}\n\n} \/\/ namespace optimizer\n} \/\/ namespace peloton\n<commit_msg>Modify logic for PropertySort::operator>=<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Peloton\n\/\/\n\/\/ properties.cpp\n\/\/\n\/\/ Identification: src\/optimizer\/properties.cpp\n\/\/\n\/\/ Copyright (c) 2015-16, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"optimizer\/properties.h\"\n\n#include \"optimizer\/property.h\"\n#include \"optimizer\/property_visitor.h\"\n\nnamespace peloton {\nnamespace optimizer {\n\n\/*************** PropertyColumns *****************\/\n\nPropertyColumns::PropertyColumns(\n std::vector<std::shared_ptr<expression::AbstractExpression>> column_exprs)\n : column_exprs_(std::move(column_exprs)) {}\n\nPropertyType PropertyColumns::Type() const { return PropertyType::COLUMNS; }\n\nbool PropertyColumns::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::COLUMNS) {\n return false;\n }\n const PropertyColumns &r_columns =\n *reinterpret_cast<const PropertyColumns *>(&r);\n \/\/ lhs is less than rhs if size is smaller\n if (column_exprs_.size() < r_columns.column_exprs_.size()) {\n return false;\n }\n \/\/ check that every column in the right hand side property exists in the left\n \/\/ hand side property\n for (auto r_column : r_columns.column_exprs_) {\n bool has_column = false;\n for (auto column : column_exprs_) {\n if (column->Equals(r_column.get())) {\n has_column = true;\n break;\n }\n }\n if (has_column == false) return false;\n }\n\n return true;\n}\n\nbool PropertyColumns::HasStarExpression() const {\n for (auto expr : column_exprs_) {\n if (expr->GetExpressionType() == ExpressionType::STAR) return true;\n }\n return false;\n}\n\nhash_t PropertyColumns::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n for (auto expr : column_exprs_) {\n hash = HashUtil::SumHashes(hash, expr->Hash());\n }\n return hash;\n}\n\nvoid PropertyColumns::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyColumns *)this);\n}\n\nstd::string PropertyColumns::ToString() const {\n std::string str = PropertyTypeToString(Type()) + \": \";\n for (auto column_expr : column_exprs_) {\n if (column_expr->GetExpressionType() == ExpressionType::VALUE_TUPLE) {\n str += ((expression::TupleValueExpression *)column_expr.get())\n ->GetColumnName();\n str += \" \";\n } else {\n column_expr->DeduceExpressionName();\n str += column_expr->GetExpressionName();\n str += \" \";\n }\n }\n return str + \"\\n\";\n}\n\n\/*************** PropertyDistinct *****************\/\n\nPropertyDistinct::PropertyDistinct(std::vector<\n std::shared_ptr<expression::AbstractExpression>> distinct_column_exprs)\n : distinct_column_exprs_(std::move(distinct_column_exprs)) {\n LOG_TRACE(\"Size of column property: %ld\", distinct_column_exprs_.size());\n}\n\nPropertyType PropertyDistinct::Type() const { return PropertyType::DISTINCT; }\n\nbool PropertyDistinct::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::DISTINCT) return false;\n const PropertyDistinct &r_columns =\n *reinterpret_cast<const PropertyDistinct *>(&r);\n\n \/\/ check that every column in the left hand side property exists in the right\n \/\/ hand side property. which is the opposite to\n \/\/ the condition of propertyColumns\n \/\/ e.g. distinct(col_a) >= distinct(col_a, col_b)\n for (auto r_column : r_columns.distinct_column_exprs_) {\n bool has_column = false;\n for (auto column : distinct_column_exprs_) {\n if (column->Equals(r_column.get())) {\n has_column = true;\n break;\n }\n }\n if (has_column == false) return false;\n }\n\n return true;\n}\n\nhash_t PropertyDistinct::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n for (auto expr : distinct_column_exprs_) {\n hash = HashUtil::CombineHashes(hash, expr->Hash());\n }\n return hash;\n}\n\nvoid PropertyDistinct::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyDistinct *)this);\n}\n\nstd::string PropertyDistinct::ToString() const {\n std::string str = PropertyTypeToString(Type()) + \": \";\n for (auto column_expr : distinct_column_exprs_) {\n if (column_expr->GetExpressionType() == ExpressionType::VALUE_TUPLE) {\n str += ((expression::TupleValueExpression *)column_expr.get())\n ->GetColumnName();\n str += \" \";\n } else {\n \/\/ TODO: Add support for other expression\n str += \"expr \";\n }\n }\n return str + \"\\n\";\n}\n\n\/*************** PropertyLimit *****************\/\n\nPropertyType PropertyLimit::Type() const { return PropertyType::LIMIT; }\n\nbool PropertyLimit::operator>=(const Property &r) const {\n if (r.Type() != PropertyType::LIMIT) return false;\n const PropertyLimit &r_limit = *reinterpret_cast<const PropertyLimit *>(&r);\n return offset_ == r_limit.offset_ && limit_ == r_limit.limit_;\n}\n\nhash_t PropertyLimit::Hash() const {\n hash_t hash = Property::Hash();\n HashUtil::CombineHashes(hash, offset_);\n HashUtil::CombineHashes(hash, limit_);\n return hash;\n}\n\nvoid PropertyLimit::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertyLimit *)this);\n}\n\nstd::string PropertyLimit::ToString() const {\n std::string res = PropertyTypeToString(Type());\n res += std::to_string(offset_) + \" \" + std::to_string(limit_) + \"\\n\";\n return res;\n}\n\n\/*************** PropertySort *****************\/\n\nPropertySort::PropertySort(\n std::vector<std::shared_ptr<expression::AbstractExpression>> sort_columns,\n std::vector<bool> sort_ascending)\n : sort_columns_(std::move(sort_columns)),\n sort_ascending_(std::move(sort_ascending)) {}\n\nPropertyType PropertySort::Type() const { return PropertyType::SORT; }\n\nbool PropertySort::operator>=(const Property &r) const {\n \/\/ check the type\n if (r.Type() != PropertyType::SORT) return false;\n const PropertySort &r_sort = *reinterpret_cast<const PropertySort *>(&r);\n\n \/\/ All the sorting orders in r must be satisfied\n size_t l_num_sort_columns = sort_columns_.size();\n size_t r_num_sort_columns = r_sort.sort_columns_.size();\n PL_ASSERT(num_sort_columns == r_sort.sort_ascending_.size());\n size_t l_sort_col_idx = 0;\n \/\/ We want to ensure that Sort(a, b, c, d, e) >= Sort(a, c, e)\n for (size_t r_sort_col_idx = 0; r_sort_col_idx < r_num_sort_columns;\n ++r_sort_col_idx) {\n while (l_sort_col_idx < l_num_sort_columns &&\n !sort_columns_[l_sort_col_idx]->Equals(\n r_sort.sort_columns_[r_sort_col_idx].get())) {\n ++l_sort_col_idx;\n }\n if (l_sort_col_idx == l_num_sort_columns ||\n sort_ascending_[l_sort_col_idx] !=\n r_sort.sort_ascending_[r_sort_col_idx]) {\n return false;\n }\n ++l_sort_col_idx;\n }\n return true;\n}\n\nhash_t PropertySort::Hash() const {\n \/\/ hash the type\n hash_t hash = Property::Hash();\n\n \/\/ hash sorting columns\n size_t num_sort_columns = sort_columns_.size();\n for (size_t i = 0; i < num_sort_columns; ++i) {\n hash = HashUtil::CombineHashes(hash, sort_columns_[i]->Hash());\n hash = HashUtil::CombineHashes(hash, sort_ascending_[i]);\n }\n return hash;\n}\n\nvoid PropertySort::Accept(PropertyVisitor *v) const {\n v->Visit((const PropertySort *)this);\n}\n\nstd::string PropertySort::ToString() const {\n return PropertyTypeToString(Type()) + \"\\n\";\n}\n\n} \/\/ namespace optimizer\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: drformsh.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: mh $ $Date: 2001-10-22 17:23:45 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"ui_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/------------------------------------------------------------------\n\n#include <svx\/eeitem.hxx>\n#include <svx\/fontwork.hxx>\n#include <svx\/labdlg.hxx>\n#include <svx\/srchitem.hxx>\n#include <svx\/tabarea.hxx>\n#include <svx\/tabline.hxx>\n#include <svx\/textanim.hxx>\n#include <svx\/transfrm.hxx>\n#include <sfx2\/app.hxx>\n#include <sfx2\/objface.hxx>\n#include <sfx2\/request.hxx>\n#include <svtools\/whiter.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"drformsh.hxx\"\n#include \"drwlayer.hxx\"\n#include \"sc.hrc\"\n#include \"viewdata.hxx\"\n#include \"document.hxx\"\n#include \"docpool.hxx\"\n#include \"drawview.hxx\"\n#include \"scresid.hxx\"\n\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n\n#define ScDrawFormShell\n#include \"scslots.hxx\"\n\n\nSFX_IMPL_INTERFACE(ScDrawFormShell, ScDrawShell, ScResId(SCSTR_DRAWFORMSHELL) )\n{\n SFX_OBJECTBAR_REGISTRATION( SFX_OBJECTBAR_OBJECT|SFX_VISIBILITY_STANDARD|SFX_VISIBILITY_SERVER,\n ScResId(RID_OBJECTBAR_DRAWFORM) );\n SFX_POPUPMENU_REGISTRATION( ScResId(RID_POPUP_DRAWFORM) );\n SFX_OBJECTMENU_REGISTRATION( SID_OBJECTMENU0, ScResId(RID_OBJECTMENU_DRAWFORM) );\n}\n\nTYPEINIT1( ScDrawFormShell, ScDrawShell );\n\nScDrawFormShell::ScDrawFormShell(ScViewData* pData) :\n ScDrawShell(pData)\n{\n SetHelpId(HID_SCSHELL_DRAWFORMSH);\n SetName(String::CreateFromAscii(RTL_CONSTASCII_STRINGPARAM(\"DrawForm\")));\n}\n\nScDrawFormShell::~ScDrawFormShell()\n{\n}\n\n\n\n<commit_msg>INTEGRATION: CWS dialogdiet (1.3.318); FILE MERGED 2004\/01\/13 02:56:42 mwu 1.3.318.2: DialogDiet 2004_01_13 2003\/11\/28 15:35:53 mba 1.3.318.1: #i22969#: obsolete include<commit_after>\/*************************************************************************\n *\n * $RCSfile: drformsh.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: hr $ $Date: 2004-02-03 20:31:57 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef PCH\n#include \"ui_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/------------------------------------------------------------------\n\n#include <svx\/eeitem.hxx>\n#include <svx\/fontwork.hxx>\n\/\/CHINA001 #include <svx\/labdlg.hxx>\n#include <svx\/srchitem.hxx>\n#include <svx\/tabarea.hxx>\n#include <svx\/tabline.hxx>\n\/\/CHINA001 #include <svx\/transfrm.hxx>\n#include <sfx2\/app.hxx>\n#include <sfx2\/objface.hxx>\n#include <sfx2\/request.hxx>\n#include <svtools\/whiter.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"drformsh.hxx\"\n#include \"drwlayer.hxx\"\n#include \"sc.hrc\"\n#include \"viewdata.hxx\"\n#include \"document.hxx\"\n#include \"docpool.hxx\"\n#include \"drawview.hxx\"\n#include \"scresid.hxx\"\n\n#ifndef _SVDOBJ_HXX \/\/autogen\n#include <svx\/svdobj.hxx>\n#endif\n\n#define ScDrawFormShell\n#include \"scslots.hxx\"\n\n\nSFX_IMPL_INTERFACE(ScDrawFormShell, ScDrawShell, ScResId(SCSTR_DRAWFORMSHELL) )\n{\n SFX_OBJECTBAR_REGISTRATION( SFX_OBJECTBAR_OBJECT|SFX_VISIBILITY_STANDARD|SFX_VISIBILITY_SERVER,\n ScResId(RID_OBJECTBAR_DRAWFORM) );\n SFX_POPUPMENU_REGISTRATION( ScResId(RID_POPUP_DRAWFORM) );\n SFX_OBJECTMENU_REGISTRATION( SID_OBJECTMENU0, ScResId(RID_OBJECTMENU_DRAWFORM) );\n}\n\nTYPEINIT1( ScDrawFormShell, ScDrawShell );\n\nScDrawFormShell::ScDrawFormShell(ScViewData* pData) :\n ScDrawShell(pData)\n{\n SetHelpId(HID_SCSHELL_DRAWFORMSH);\n SetName(String::CreateFromAscii(RTL_CONSTASCII_STRINGPARAM(\"DrawForm\")));\n}\n\nScDrawFormShell::~ScDrawFormShell()\n{\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009 The Android Open Source Project\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"SkBitmapProcState_opts_SSE2.h\"\n#include \"SkBitmapProcState_opts_SSSE3.h\"\n#include \"SkBitmapFilter_opts_SSE2.h\"\n#include \"SkBlitMask.h\"\n#include \"SkBlitRow.h\"\n#include \"SkBlitRect_opts_SSE2.h\"\n#include \"SkBlitRow_opts_SSE2.h\"\n#include \"SkBlurImage_opts_SSE2.h\"\n#include \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.h\"\n#include \"SkMorphology_opts.h\"\n#include \"SkMorphology_opts_SSE2.h\"\n#include \"SkXfermode.h\"\n#include \"SkXfermode_proccoeff.h\"\n\n#include \"SkRTConf.h\"\n\n#if defined(_MSC_VER) && defined(_WIN64)\n#include <intrin.h>\n#endif\n\n\/* This file must *not* be compiled with -msse or -msse2, otherwise\n gcc may generate sse2 even for scalar ops (and thus give an invalid\n instruction on Pentium3 on the code below). Only files named *_SSE2.cpp\n in this directory should be compiled with -msse2. *\/\n\n\n#ifdef _MSC_VER\nstatic inline void getcpuid(int info_type, int info[4]) {\n#if defined(_WIN64)\n __cpuid(info, info_type);\n#else\n __asm {\n mov eax, [info_type]\n cpuid\n mov edi, [info]\n mov [edi], eax\n mov [edi+4], ebx\n mov [edi+8], ecx\n mov [edi+12], edx\n }\n#endif\n}\n#else\n#if defined(__x86_64__)\nstatic inline void getcpuid(int info_type, int info[4]) {\n asm volatile (\n \"cpuid \\n\\t\"\n : \"=a\"(info[0]), \"=b\"(info[1]), \"=c\"(info[2]), \"=d\"(info[3])\n : \"a\"(info_type)\n );\n}\n#else\nstatic inline void getcpuid(int info_type, int info[4]) {\n \/\/ We save and restore ebx, so this code can be compatible with -fPIC\n asm volatile (\n \"pushl %%ebx \\n\\t\"\n \"cpuid \\n\\t\"\n \"movl %%ebx, %1 \\n\\t\"\n \"popl %%ebx \\n\\t\"\n : \"=a\"(info[0]), \"=r\"(info[1]), \"=c\"(info[2]), \"=d\"(info[3])\n : \"a\"(info_type)\n );\n}\n#endif\n#endif\n\n#if defined(__x86_64__) || defined(_WIN64) || SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_SSE2\n\/* All x86_64 machines have SSE2, or we know it's supported at compile time, so don't even bother checking. *\/\nstatic inline bool hasSSE2() {\n return true;\n}\n#else\n\nstatic inline bool hasSSE2() {\n int cpu_info[4] = { 0 };\n getcpuid(1, cpu_info);\n return (cpu_info[3] & (1<<26)) != 0;\n}\n#endif\n\n#if SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_SSSE3\n\/* If we know SSSE3 is supported at compile time, don't even bother checking. *\/\nstatic inline bool hasSSSE3() {\n return true;\n}\n#else\n\nstatic inline bool hasSSSE3() {\n int cpu_info[4] = { 0 };\n getcpuid(1, cpu_info);\n return (cpu_info[2] & 0x200) != 0;\n}\n#endif\n\nstatic bool cachedHasSSE2() {\n static bool gHasSSE2 = hasSSE2();\n return gHasSSE2;\n}\n\nstatic bool cachedHasSSSE3() {\n static bool gHasSSSE3 = hasSSSE3();\n return gHasSSSE3;\n}\n\nSK_CONF_DECLARE( bool, c_hqfilter_sse, \"bitmap.filter.highQualitySSE\", false, \"Use SSE optimized version of high quality image filters\");\n\nvoid SkBitmapProcState::platformConvolutionProcs(SkConvolutionProcs* procs) {\n if (cachedHasSSE2()) {\n procs->fExtraHorizontalReads = 3;\n procs->fConvolveVertically = &convolveVertically_SSE2;\n procs->fConvolve4RowsHorizontally = &convolve4RowsHorizontally_SSE2;\n procs->fConvolveHorizontally = &convolveHorizontally_SSE2;\n procs->fApplySIMDPadding = &applySIMDPadding_SSE2;\n }\n}\n\nvoid SkBitmapProcState::platformProcs() {\n if (cachedHasSSSE3()) {\n if (fSampleProc32 == S32_opaque_D32_filter_DX) {\n fSampleProc32 = S32_opaque_D32_filter_DX_SSSE3;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DX) {\n fSampleProc32 = S32_alpha_D32_filter_DX_SSSE3;\n }\n\n if (fSampleProc32 == S32_opaque_D32_filter_DXDY) {\n fSampleProc32 = S32_opaque_D32_filter_DXDY_SSSE3;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DXDY) {\n fSampleProc32 = S32_alpha_D32_filter_DXDY_SSSE3;\n }\n } else if (cachedHasSSE2()) {\n if (fSampleProc32 == S32_opaque_D32_filter_DX) {\n fSampleProc32 = S32_opaque_D32_filter_DX_SSE2;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DX) {\n fSampleProc32 = S32_alpha_D32_filter_DX_SSE2;\n }\n\n if (fSampleProc16 == S32_D16_filter_DX) {\n fSampleProc16 = S32_D16_filter_DX_SSE2;\n }\n }\n\n if (cachedHasSSSE3() || cachedHasSSE2()) {\n if (fMatrixProc == ClampX_ClampY_filter_scale) {\n fMatrixProc = ClampX_ClampY_filter_scale_SSE2;\n } else if (fMatrixProc == ClampX_ClampY_nofilter_scale) {\n fMatrixProc = ClampX_ClampY_nofilter_scale_SSE2;\n }\n\n if (fMatrixProc == ClampX_ClampY_filter_affine) {\n fMatrixProc = ClampX_ClampY_filter_affine_SSE2;\n } else if (fMatrixProc == ClampX_ClampY_nofilter_affine) {\n fMatrixProc = ClampX_ClampY_nofilter_affine_SSE2;\n }\n if (c_hqfilter_sse) {\n if (fShaderProc32 == highQualityFilter32) {\n fShaderProc32 = highQualityFilter_SSE2;\n }\n }\n }\n}\n\nstatic SkBlitRow::Proc platform_16_procs[] = {\n S32_D565_Opaque_SSE2, \/\/ S32_D565_Opaque\n NULL, \/\/ S32_D565_Blend\n S32A_D565_Opaque_SSE2, \/\/ S32A_D565_Opaque\n NULL, \/\/ S32A_D565_Blend\n S32_D565_Opaque_Dither_SSE2, \/\/ S32_D565_Opaque_Dither\n NULL, \/\/ S32_D565_Blend_Dither\n S32A_D565_Opaque_Dither_SSE2, \/\/ S32A_D565_Opaque_Dither\n NULL, \/\/ S32A_D565_Blend_Dither\n};\n\nstatic SkBlitRow::Proc32 platform_32_procs[] = {\n NULL, \/\/ S32_Opaque,\n S32_Blend_BlitRow32_SSE2, \/\/ S32_Blend,\n S32A_Opaque_BlitRow32_SSE2, \/\/ S32A_Opaque\n S32A_Blend_BlitRow32_SSE2, \/\/ S32A_Blend,\n};\n\nSkBlitRow::Proc SkBlitRow::PlatformProcs565(unsigned flags) {\n if (cachedHasSSE2()) {\n return platform_16_procs[flags];\n } else {\n return NULL;\n }\n}\n\nSkBlitRow::ColorProc SkBlitRow::PlatformColorProc() {\n if (cachedHasSSE2()) {\n return Color32_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkBlitRow::Proc32 SkBlitRow::PlatformProcs32(unsigned flags) {\n if (cachedHasSSE2()) {\n return platform_32_procs[flags];\n } else {\n return NULL;\n }\n}\n\n\nSkBlitMask::ColorProc SkBlitMask::PlatformColorProcs(SkBitmap::Config dstConfig,\n SkMask::Format maskFormat,\n SkColor color) {\n if (SkMask::kA8_Format != maskFormat) {\n return NULL;\n }\n\n ColorProc proc = NULL;\n if (cachedHasSSE2()) {\n switch (dstConfig) {\n case SkBitmap::kARGB_8888_Config:\n \/\/ The SSE2 version is not (yet) faster for black, so we check\n \/\/ for that.\n if (SK_ColorBLACK != color) {\n proc = SkARGB32_A8_BlitMask_SSE2;\n }\n break;\n default:\n break;\n }\n }\n return proc;\n}\n\nSkBlitMask::BlitLCD16RowProc SkBlitMask::PlatformBlitRowProcs16(bool isOpaque) {\n if (cachedHasSSE2()) {\n if (isOpaque) {\n return SkBlitLCD16OpaqueRow_SSE2;\n } else {\n return SkBlitLCD16Row_SSE2;\n }\n } else {\n return NULL;\n }\n\n}\nSkBlitMask::RowProc SkBlitMask::PlatformRowProcs(SkBitmap::Config dstConfig,\n SkMask::Format maskFormat,\n RowFlags flags) {\n return NULL;\n}\n\nSkMemset16Proc SkMemset16GetPlatformProc() {\n if (cachedHasSSE2()) {\n return sk_memset16_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkMemset32Proc SkMemset32GetPlatformProc() {\n if (cachedHasSSE2()) {\n return sk_memset32_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkMorphologyImageFilter::Proc SkMorphologyGetPlatformProc(SkMorphologyProcType type) {\n if (!cachedHasSSE2()) {\n return NULL;\n }\n switch (type) {\n case kDilateX_SkMorphologyProcType:\n return SkDilateX_SSE2;\n case kDilateY_SkMorphologyProcType:\n return SkDilateY_SSE2;\n case kErodeX_SkMorphologyProcType:\n return SkErodeX_SSE2;\n case kErodeY_SkMorphologyProcType:\n return SkErodeY_SSE2;\n default:\n return NULL;\n }\n}\n\nbool SkBoxBlurGetPlatformProcs(SkBoxBlurProc* boxBlurX,\n SkBoxBlurProc* boxBlurY,\n SkBoxBlurProc* boxBlurXY,\n SkBoxBlurProc* boxBlurYX) {\n#ifdef SK_DISABLE_BLUR_DIVISION_OPTIMIZATION\n return false;\n#else\n if (!cachedHasSSE2()) {\n return false;\n }\n return SkBoxBlurGetPlatformProcs_SSE2(boxBlurX, boxBlurY, boxBlurXY, boxBlurYX);\n#endif\n}\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory(); \/\/ suppress warning\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n if (cachedHasSSE2()) {\n return ColorRect32_SSE2;\n } else {\n return NULL;\n }\n}\n\nextern SkProcCoeffXfermode* SkPlatformXfermodeFactory_impl_SSE2(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory_impl(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory_impl(const ProcCoeff& rec,\n SkXfermode::Mode mode) {\n return NULL;\n}\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory(const ProcCoeff& rec,\n SkXfermode::Mode mode) {\n if (cachedHasSSE2()) {\n return SkPlatformXfermodeFactory_impl_SSE2(rec, mode);\n } else {\n return SkPlatformXfermodeFactory_impl(rec, mode);\n }\n}\n\nSkXfermodeProc SkPlatformXfermodeProcFactory(SkXfermode::Mode mode);\n\nSkXfermodeProc SkPlatformXfermodeProcFactory(SkXfermode::Mode mode) {\n return NULL;\n}\n<commit_msg>fix x86 emulator for Android framework.<commit_after>\/*\n * Copyright 2009 The Android Open Source Project\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include \"SkBitmapProcState_opts_SSE2.h\"\n#include \"SkBitmapProcState_opts_SSSE3.h\"\n#include \"SkBitmapFilter_opts_SSE2.h\"\n#include \"SkBlitMask.h\"\n#include \"SkBlitRow.h\"\n#include \"SkBlitRect_opts_SSE2.h\"\n#include \"SkBlitRow_opts_SSE2.h\"\n#include \"SkBlurImage_opts_SSE2.h\"\n#include \"SkUtils_opts_SSE2.h\"\n#include \"SkUtils.h\"\n#include \"SkMorphology_opts.h\"\n#include \"SkMorphology_opts_SSE2.h\"\n#include \"SkXfermode.h\"\n#include \"SkXfermode_proccoeff.h\"\n\n#include \"SkRTConf.h\"\n\n#if defined(_MSC_VER) && defined(_WIN64)\n#include <intrin.h>\n#endif\n\n\/* This file must *not* be compiled with -msse or -msse2, otherwise\n gcc may generate sse2 even for scalar ops (and thus give an invalid\n instruction on Pentium3 on the code below). Only files named *_SSE2.cpp\n in this directory should be compiled with -msse2. *\/\n\n\n#ifdef _MSC_VER\nstatic inline void getcpuid(int info_type, int info[4]) {\n#if defined(_WIN64)\n __cpuid(info, info_type);\n#else\n __asm {\n mov eax, [info_type]\n cpuid\n mov edi, [info]\n mov [edi], eax\n mov [edi+4], ebx\n mov [edi+8], ecx\n mov [edi+12], edx\n }\n#endif\n}\n#else\n#if defined(__x86_64__)\nstatic inline void getcpuid(int info_type, int info[4]) {\n asm volatile (\n \"cpuid \\n\\t\"\n : \"=a\"(info[0]), \"=b\"(info[1]), \"=c\"(info[2]), \"=d\"(info[3])\n : \"a\"(info_type)\n );\n}\n#else\nstatic inline void getcpuid(int info_type, int info[4]) {\n \/\/ We save and restore ebx, so this code can be compatible with -fPIC\n asm volatile (\n \"pushl %%ebx \\n\\t\"\n \"cpuid \\n\\t\"\n \"movl %%ebx, %1 \\n\\t\"\n \"popl %%ebx \\n\\t\"\n : \"=a\"(info[0]), \"=r\"(info[1]), \"=c\"(info[2]), \"=d\"(info[3])\n : \"a\"(info_type)\n );\n}\n#endif\n#endif\n\n#if defined(__x86_64__) || defined(_WIN64) || SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_SSE2\n\/* All x86_64 machines have SSE2, or we know it's supported at compile time, so don't even bother checking. *\/\nstatic inline bool hasSSE2() {\n return true;\n}\n#else\n\nstatic inline bool hasSSE2() {\n int cpu_info[4] = { 0 };\n getcpuid(1, cpu_info);\n return (cpu_info[3] & (1<<26)) != 0;\n}\n#endif\n\n#if SK_CPU_SSE_LEVEL >= SK_CPU_SSE_LEVEL_SSSE3\n\/* If we know SSSE3 is supported at compile time, don't even bother checking. *\/\nstatic inline bool hasSSSE3() {\n return true;\n}\n#elif defined(SK_BUILD_FOR_ANDROID_FRAMEWORK)\n\/* For the Android framework we should always know at compile time if the device\n * we are building for supports SSSE3. The one exception to this rule is on the\n * emulator where we are compiled without the -msse3 option (so we have no SSSE3\n * procs) but can be run on a host machine that supports SSSE3 instructions. So\n * for that particular case we disable our SSSE3 options.\n *\/\nstatic inline bool hasSSSE3() {\n return false;\n}\n#else\n\nstatic inline bool hasSSSE3() {\n int cpu_info[4] = { 0 };\n getcpuid(1, cpu_info);\n return (cpu_info[2] & 0x200) != 0;\n}\n#endif\n\nstatic bool cachedHasSSE2() {\n static bool gHasSSE2 = hasSSE2();\n return gHasSSE2;\n}\n\nstatic bool cachedHasSSSE3() {\n static bool gHasSSSE3 = hasSSSE3();\n return gHasSSSE3;\n}\n\nSK_CONF_DECLARE( bool, c_hqfilter_sse, \"bitmap.filter.highQualitySSE\", false, \"Use SSE optimized version of high quality image filters\");\n\nvoid SkBitmapProcState::platformConvolutionProcs(SkConvolutionProcs* procs) {\n if (cachedHasSSE2()) {\n procs->fExtraHorizontalReads = 3;\n procs->fConvolveVertically = &convolveVertically_SSE2;\n procs->fConvolve4RowsHorizontally = &convolve4RowsHorizontally_SSE2;\n procs->fConvolveHorizontally = &convolveHorizontally_SSE2;\n procs->fApplySIMDPadding = &applySIMDPadding_SSE2;\n }\n}\n\nvoid SkBitmapProcState::platformProcs() {\n if (cachedHasSSSE3()) {\n if (fSampleProc32 == S32_opaque_D32_filter_DX) {\n fSampleProc32 = S32_opaque_D32_filter_DX_SSSE3;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DX) {\n fSampleProc32 = S32_alpha_D32_filter_DX_SSSE3;\n }\n\n if (fSampleProc32 == S32_opaque_D32_filter_DXDY) {\n fSampleProc32 = S32_opaque_D32_filter_DXDY_SSSE3;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DXDY) {\n fSampleProc32 = S32_alpha_D32_filter_DXDY_SSSE3;\n }\n } else if (cachedHasSSE2()) {\n if (fSampleProc32 == S32_opaque_D32_filter_DX) {\n fSampleProc32 = S32_opaque_D32_filter_DX_SSE2;\n } else if (fSampleProc32 == S32_alpha_D32_filter_DX) {\n fSampleProc32 = S32_alpha_D32_filter_DX_SSE2;\n }\n\n if (fSampleProc16 == S32_D16_filter_DX) {\n fSampleProc16 = S32_D16_filter_DX_SSE2;\n }\n }\n\n if (cachedHasSSSE3() || cachedHasSSE2()) {\n if (fMatrixProc == ClampX_ClampY_filter_scale) {\n fMatrixProc = ClampX_ClampY_filter_scale_SSE2;\n } else if (fMatrixProc == ClampX_ClampY_nofilter_scale) {\n fMatrixProc = ClampX_ClampY_nofilter_scale_SSE2;\n }\n\n if (fMatrixProc == ClampX_ClampY_filter_affine) {\n fMatrixProc = ClampX_ClampY_filter_affine_SSE2;\n } else if (fMatrixProc == ClampX_ClampY_nofilter_affine) {\n fMatrixProc = ClampX_ClampY_nofilter_affine_SSE2;\n }\n if (c_hqfilter_sse) {\n if (fShaderProc32 == highQualityFilter32) {\n fShaderProc32 = highQualityFilter_SSE2;\n }\n }\n }\n}\n\nstatic SkBlitRow::Proc platform_16_procs[] = {\n S32_D565_Opaque_SSE2, \/\/ S32_D565_Opaque\n NULL, \/\/ S32_D565_Blend\n S32A_D565_Opaque_SSE2, \/\/ S32A_D565_Opaque\n NULL, \/\/ S32A_D565_Blend\n S32_D565_Opaque_Dither_SSE2, \/\/ S32_D565_Opaque_Dither\n NULL, \/\/ S32_D565_Blend_Dither\n S32A_D565_Opaque_Dither_SSE2, \/\/ S32A_D565_Opaque_Dither\n NULL, \/\/ S32A_D565_Blend_Dither\n};\n\nstatic SkBlitRow::Proc32 platform_32_procs[] = {\n NULL, \/\/ S32_Opaque,\n S32_Blend_BlitRow32_SSE2, \/\/ S32_Blend,\n S32A_Opaque_BlitRow32_SSE2, \/\/ S32A_Opaque\n S32A_Blend_BlitRow32_SSE2, \/\/ S32A_Blend,\n};\n\nSkBlitRow::Proc SkBlitRow::PlatformProcs565(unsigned flags) {\n if (cachedHasSSE2()) {\n return platform_16_procs[flags];\n } else {\n return NULL;\n }\n}\n\nSkBlitRow::ColorProc SkBlitRow::PlatformColorProc() {\n if (cachedHasSSE2()) {\n return Color32_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkBlitRow::Proc32 SkBlitRow::PlatformProcs32(unsigned flags) {\n if (cachedHasSSE2()) {\n return platform_32_procs[flags];\n } else {\n return NULL;\n }\n}\n\n\nSkBlitMask::ColorProc SkBlitMask::PlatformColorProcs(SkBitmap::Config dstConfig,\n SkMask::Format maskFormat,\n SkColor color) {\n if (SkMask::kA8_Format != maskFormat) {\n return NULL;\n }\n\n ColorProc proc = NULL;\n if (cachedHasSSE2()) {\n switch (dstConfig) {\n case SkBitmap::kARGB_8888_Config:\n \/\/ The SSE2 version is not (yet) faster for black, so we check\n \/\/ for that.\n if (SK_ColorBLACK != color) {\n proc = SkARGB32_A8_BlitMask_SSE2;\n }\n break;\n default:\n break;\n }\n }\n return proc;\n}\n\nSkBlitMask::BlitLCD16RowProc SkBlitMask::PlatformBlitRowProcs16(bool isOpaque) {\n if (cachedHasSSE2()) {\n if (isOpaque) {\n return SkBlitLCD16OpaqueRow_SSE2;\n } else {\n return SkBlitLCD16Row_SSE2;\n }\n } else {\n return NULL;\n }\n\n}\nSkBlitMask::RowProc SkBlitMask::PlatformRowProcs(SkBitmap::Config dstConfig,\n SkMask::Format maskFormat,\n RowFlags flags) {\n return NULL;\n}\n\nSkMemset16Proc SkMemset16GetPlatformProc() {\n if (cachedHasSSE2()) {\n return sk_memset16_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkMemset32Proc SkMemset32GetPlatformProc() {\n if (cachedHasSSE2()) {\n return sk_memset32_SSE2;\n } else {\n return NULL;\n }\n}\n\nSkMorphologyImageFilter::Proc SkMorphologyGetPlatformProc(SkMorphologyProcType type) {\n if (!cachedHasSSE2()) {\n return NULL;\n }\n switch (type) {\n case kDilateX_SkMorphologyProcType:\n return SkDilateX_SSE2;\n case kDilateY_SkMorphologyProcType:\n return SkDilateY_SSE2;\n case kErodeX_SkMorphologyProcType:\n return SkErodeX_SSE2;\n case kErodeY_SkMorphologyProcType:\n return SkErodeY_SSE2;\n default:\n return NULL;\n }\n}\n\nbool SkBoxBlurGetPlatformProcs(SkBoxBlurProc* boxBlurX,\n SkBoxBlurProc* boxBlurY,\n SkBoxBlurProc* boxBlurXY,\n SkBoxBlurProc* boxBlurYX) {\n#ifdef SK_DISABLE_BLUR_DIVISION_OPTIMIZATION\n return false;\n#else\n if (!cachedHasSSE2()) {\n return false;\n }\n return SkBoxBlurGetPlatformProcs_SSE2(boxBlurX, boxBlurY, boxBlurXY, boxBlurYX);\n#endif\n}\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory(); \/\/ suppress warning\n\nSkBlitRow::ColorRectProc PlatformColorRectProcFactory() {\n if (cachedHasSSE2()) {\n return ColorRect32_SSE2;\n } else {\n return NULL;\n }\n}\n\nextern SkProcCoeffXfermode* SkPlatformXfermodeFactory_impl_SSE2(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory_impl(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory_impl(const ProcCoeff& rec,\n SkXfermode::Mode mode) {\n return NULL;\n}\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory(const ProcCoeff& rec,\n SkXfermode::Mode mode);\n\nSkProcCoeffXfermode* SkPlatformXfermodeFactory(const ProcCoeff& rec,\n SkXfermode::Mode mode) {\n if (cachedHasSSE2()) {\n return SkPlatformXfermodeFactory_impl_SSE2(rec, mode);\n } else {\n return SkPlatformXfermodeFactory_impl(rec, mode);\n }\n}\n\nSkXfermodeProc SkPlatformXfermodeProcFactory(SkXfermode::Mode mode);\n\nSkXfermodeProc SkPlatformXfermodeProcFactory(SkXfermode::Mode mode) {\n return NULL;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: fuconpol.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: vg $ $Date: 2007-02-27 13:11:29 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n\/\/------------------------------------------------------------------------\n\n\/\/ TOOLS\n#define _BIGINT_HXX\n#define _SFXMULTISEL_HXX\n#define _STACK_HXX\n#define _QUEUE_HXX\n#define _DYNARR_HXX\n#define _TREELIST_HXX\n#define _CACHESTR_HXX\n#define _NEW_HXX\n\/\/#define _SHL_HXX\n\/\/#define _LINK_HXX\n\/\/#define _ERRCODE_HXX\n\/\/#define _GEN_HXX\n\/\/#define _FRACT_HXX\n\/\/#define _STRING_HXX\n\/\/#define _MTF_HXX\n\/\/#define _CONTNR_HXX\n\/\/#define _LIST_HXX\n\/\/#define _TABLE_HXX\n#define _DYNARY_HXX\n\/\/#define _UNQIDX_HXX\n#define _SVMEMPOOL_HXX\n\/\/#define _UNQID_HXX\n\/\/#define _DEBUG_HXX\n\/\/#define _DATE_HXX\n\/\/#define _TIME_HXX\n\/\/#define _DATETIME_HXX\n\/\/#define _INTN_HXX\n\/\/#define _WLDCRD_HXX\n\/\/#define _FSYS_HXX\n\/\/#define _STREAM_HXX\n#define _CACHESTR_HXX\n#define _SV_MULTISEL_HXX\n\n\/\/SV\n\/\/#define _CLIP_HXX ***\n#define _CONFIG_HXX\n#define _CURSOR_HXX\n#define _FONTDLG_HXX\n#define _PRVWIN_HXX\n\/\/#define _COLOR_HXX\n\/\/#define _PAL_HXX\n\/\/#define _BITMAP_HXX\n\/\/#define _GDIOBJ_HXX\n\/\/#define _POINTR_HXX\n\/\/#define _ICON_HXX\n\/\/#define _IMAGE_HXX\n\/\/#define _KEYCOD_HXX\n\/\/#define _EVENT_HXX\n#define _HELP_HXX\n\/\/#define _APP_HXX\n\/\/#define _MDIAPP_HXX\n\/\/#define _TIMER_HXX\n\/\/#define _METRIC_HXX\n\/\/#define _REGION_HXX\n\/\/#define _OUTDEV_HXX\n\/\/#define _SYSTEM_HXX\n\/\/#define _VIRDEV_HXX\n\/\/#define _JOBSET_HXX\n\/\/#define _PRINT_HXX\n\/\/#define _WINDOW_HXX\n\/\/#define _SYSWIN_HXX\n\/\/#define _WRKWIN_HXX\n#define _MDIWIN_HXX\n\/\/#define _FLOATWIN_HXX\n\/\/#define _DOCKWIN_HXX\n\/\/#define _CTRL_HXX\n\/\/#define _SCRBAR_HXX\n\/\/#define _BUTTON_HXX\n\/\/#define _IMAGEBTN_HXX\n\/\/#define _FIXED_HXX\n\/\/#define _GROUP_HXX\n\/\/#define _EDIT_HXX\n\/\/#define _COMBOBOX_HXX\n\/\/#define _LSTBOX_HXX\n\/\/#define _SELENG_HXX ***\n\/\/#define _SPLIT_HXX\n#define _SPIN_HXX\n\/\/#define _FIELD_HXX\n\/\/#define _MOREBTN_HXX ***\n\/\/#define _TOOLBOX_HXX\n\/\/#define _STATUS_HXX ***\n\/\/#define _DIALOG_HXX\n\/\/#define _MSGBOX_HXX\n\/\/#define _SYSDLG_HXX\n\/\/#define _FILDLG_HXX\n\/\/#define _PRNDLG_HXX\n#define _COLDLG_HXX\n\/\/#define _TABDLG_HXX\n\/\/#define _MENU_HXX\n\/\/#define _GDIMTF_HXX\n\/\/#define _POLY_HXX\n\/\/#define _ACCEL_HXX\n\/\/#define _GRAPH_HXX\n#define _SOUND_HXX\n\n\/\/------------------------------------------------------------------------\n\n#include <svx\/svdview.hxx>\n#ifndef _SVDOBJ_HXX\n#include <svx\/svdobj.hxx>\n#endif\n\n#include \"fuconpol.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"sc.hrc\"\n\n\/\/ #98185# Create default drawing objects via keyboard\n#ifndef _SVDOPATH_HXX\n#include <svx\/svdopath.hxx>\n#endif\n\n#ifndef _BGFX_POLYGON_B2DPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#endif\n\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n\n\/\/ Pixelabstand zum Schliessen von Freihand-Zeichnungen\n#ifndef CLOSE_PIXDIST\n#define CLOSE_PIXDIST 5\n#endif\n\n\/\/------------------------------------------------------------------------\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConstPolygon::FuConstPolygon(ScTabViewShell* pViewSh, Window* pWin, SdrView* pViewP,\n SdrModel* pDoc, SfxRequest& rReq)\n : FuConstruct(pViewSh, pWin, pViewP, pDoc, rReq)\n{\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nFuConstPolygon::~FuConstPolygon()\n{\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonDown-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseButtonDown(const MouseEvent& rMEvt)\n{\n \/\/ #95491# remember button state for creation of own MouseEvents\n SetMouseButtonCode(rMEvt.GetButtons());\n\n BOOL bReturn = FuConstruct::MouseButtonDown(rMEvt);\n\n SdrViewEvent aVEvt;\n (void)pView->PickAnything(rMEvt, SDRMOUSEBUTTONDOWN, aVEvt);\n if (aVEvt.eEvent == SDREVENT_BEGTEXTEDIT)\n {\n \/\/ Texteingabe hier nicht zulassen\n aVEvt.eEvent = SDREVENT_BEGDRAGOBJ;\n pView->EnableExtendedMouseEventDispatcher(FALSE);\n }\n else\n {\n pView->EnableExtendedMouseEventDispatcher(TRUE);\n }\n\n if ( pView->MouseButtonDown(rMEvt, pWindow) )\n bReturn = TRUE;\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseMove-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseMove(const MouseEvent& rMEvt)\n{\n pView->MouseMove(rMEvt, pWindow);\n BOOL bReturn = FuConstruct::MouseMove(rMEvt);\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonUp-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseButtonUp(const MouseEvent& rMEvt)\n{\n \/\/ #95491# remember button state for creation of own MouseEvents\n SetMouseButtonCode(rMEvt.GetButtons());\n\n BOOL bReturn = FALSE;\n BOOL bSimple = FALSE;\n\n SdrViewEvent aVEvt;\n (void)pView->PickAnything(rMEvt, SDRMOUSEBUTTONUP, aVEvt);\n\n pView->MouseButtonUp(rMEvt, pWindow);\n\n if (aVEvt.eEvent == SDREVENT_ENDCREATE)\n {\n bReturn = TRUE;\n bSimple = TRUE; \/\/ Doppelklick nicht weiterreichen\n }\n\n BOOL bParent;\n if (bSimple)\n bParent = FuConstruct::SimpleMouseButtonUp(rMEvt);\n else\n bParent = FuConstruct::MouseButtonUp(rMEvt);\n\n return (bParent || bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Tastaturereignisse bearbeiten\n|*\n|* Wird ein KeyEvent bearbeitet, so ist der Return-Wert TRUE, andernfalls\n|* FALSE.\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::KeyInput(const KeyEvent& rKEvt)\n{\n BOOL bReturn = FuConstruct::KeyInput(rKEvt);\n\n return(bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Function aktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstPolygon::Activate()\n{\n pView->EnableExtendedMouseEventDispatcher(TRUE);\n\n SdrObjKind eKind;\n\n switch (GetSlotID())\n {\n case SID_DRAW_POLYGON_NOFILL:\n case SID_DRAW_XPOLYGON_NOFILL:\n {\n eKind = OBJ_PLIN;\n }\n break;\n\n case SID_DRAW_POLYGON:\n case SID_DRAW_XPOLYGON:\n {\n eKind = OBJ_POLY;\n }\n break;\n\n case SID_DRAW_BEZIER_NOFILL:\n {\n eKind = OBJ_PATHLINE;\n }\n break;\n\n case SID_DRAW_BEZIER_FILL:\n {\n eKind = OBJ_PATHFILL;\n }\n break;\n\n case SID_DRAW_FREELINE_NOFILL:\n {\n eKind = OBJ_FREELINE;\n }\n break;\n\n case SID_DRAW_FREELINE:\n {\n eKind = OBJ_FREEFILL;\n }\n break;\n\n default:\n {\n eKind = OBJ_PATHLINE;\n }\n break;\n }\n\n pView->SetCurrentObj(sal::static_int_cast<UINT16>(eKind));\n\n pView->SetEditMode(SDREDITMODE_CREATE);\n\n FuConstruct::Activate();\n\n aNewPointer = Pointer( POINTER_DRAW_POLYGON );\n aOldPointer = pWindow->GetPointer();\n pViewShell->SetActivePointer( aNewPointer );\n}\n\n\/*************************************************************************\n|*\n|* Function deaktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstPolygon::Deactivate()\n{\n pView->SetEditMode(SDREDITMODE_EDIT);\n\n pView->EnableExtendedMouseEventDispatcher(FALSE);\n\n FuConstruct::Deactivate();\n\n pViewShell->SetActivePointer( aOldPointer );\n}\n\n\/\/ #98185# Create default drawing objects via keyboard\nSdrObject* FuConstPolygon::CreateDefaultObject(const sal_uInt16 nID, const Rectangle& rRectangle)\n{\n \/\/ case SID_DRAW_POLYGON:\n \/\/ case SID_DRAW_POLYGON_NOFILL:\n \/\/ case SID_DRAW_BEZIER_NOFILL:\n \/\/ case SID_DRAW_FREELINE_NOFILL:\n\n SdrObject* pObj = SdrObjFactory::MakeNewObject(\n pView->GetCurrentObjInventor(), pView->GetCurrentObjIdentifier(),\n 0L, pDrDoc);\n\n if(pObj)\n {\n if(pObj->ISA(SdrPathObj))\n {\n basegfx::B2DPolyPolygon aPoly;\n\n switch(nID)\n {\n case SID_DRAW_BEZIER_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n aInnerPoly.setControlPointA(0L, basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Bottom()));\n aInnerPoly.setControlPointB(0L, aInnerPoly.getControlPointA(0L));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Center().Y()));\n aInnerPoly.setControlPointA(1L, basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Top()));\n aInnerPoly.setControlPointB(1L, aInnerPoly.getControlPointA(1L));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Right(), rRectangle.Top()));\n aPoly.append(aInnerPoly);\n break;\n }\n case SID_DRAW_FREELINE_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n aInnerPoly.setControlPointA(0L, basegfx::B2DPoint(rRectangle.Left(), rRectangle.Top()));\n aInnerPoly.setControlPointB(0L, basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Top()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Center().Y()));\n aInnerPoly.setControlPointA(1L, basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Bottom()));\n aInnerPoly.setControlPointB(1L, basegfx::B2DPoint(rRectangle.Right(), rRectangle.Bottom()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Right(), rRectangle.Top()));\n aPoly.append(aInnerPoly);\n break;\n }\n case SID_DRAW_POLYGON:\n case SID_DRAW_POLYGON_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n sal_Int32 nWdt(rRectangle.GetWidth());\n sal_Int32 nHgt(rRectangle.GetHeight());\n\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 30) \/ 100, rRectangle.Top() + (nHgt * 70) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Top() + (nHgt * 15) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 65) \/ 100, rRectangle.Top()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + nWdt, rRectangle.Top() + (nHgt * 30) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 80) \/ 100, rRectangle.Top() + (nHgt * 50) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 80) \/ 100, rRectangle.Top() + (nHgt * 75) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Bottom(), rRectangle.Right()));\n\n if(SID_DRAW_POLYGON_NOFILL == nID)\n {\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Bottom()));\n }\n else\n {\n aInnerPoly.setClosed(true);\n }\n\n aPoly.append(aInnerPoly);\n break;\n }\n }\n\n ((SdrPathObj*)pObj)->SetPathPoly(aPoly);\n }\n else\n {\n DBG_ERROR(\"Object is NO path object\");\n }\n\n pObj->SetLogicRect(rRectangle);\n }\n\n return pObj;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS aw051 (1.7.64); FILE MERGED 2007\/06\/09 11:50:16 aw 1.7.64.1: #i77162# Adaptions to changed B2DPolygon bezier handling<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: fuconpol.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: obo $ $Date: 2007-07-18 11:12:35 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n\n\/\/------------------------------------------------------------------------\n\n\/\/ TOOLS\n#define _BIGINT_HXX\n#define _SFXMULTISEL_HXX\n#define _STACK_HXX\n#define _QUEUE_HXX\n#define _DYNARR_HXX\n#define _TREELIST_HXX\n#define _CACHESTR_HXX\n#define _NEW_HXX\n\/\/#define _SHL_HXX\n\/\/#define _LINK_HXX\n\/\/#define _ERRCODE_HXX\n\/\/#define _GEN_HXX\n\/\/#define _FRACT_HXX\n\/\/#define _STRING_HXX\n\/\/#define _MTF_HXX\n\/\/#define _CONTNR_HXX\n\/\/#define _LIST_HXX\n\/\/#define _TABLE_HXX\n#define _DYNARY_HXX\n\/\/#define _UNQIDX_HXX\n#define _SVMEMPOOL_HXX\n\/\/#define _UNQID_HXX\n\/\/#define _DEBUG_HXX\n\/\/#define _DATE_HXX\n\/\/#define _TIME_HXX\n\/\/#define _DATETIME_HXX\n\/\/#define _INTN_HXX\n\/\/#define _WLDCRD_HXX\n\/\/#define _FSYS_HXX\n\/\/#define _STREAM_HXX\n#define _CACHESTR_HXX\n#define _SV_MULTISEL_HXX\n\n\/\/SV\n\/\/#define _CLIP_HXX ***\n#define _CONFIG_HXX\n#define _CURSOR_HXX\n#define _FONTDLG_HXX\n#define _PRVWIN_HXX\n\/\/#define _COLOR_HXX\n\/\/#define _PAL_HXX\n\/\/#define _BITMAP_HXX\n\/\/#define _GDIOBJ_HXX\n\/\/#define _POINTR_HXX\n\/\/#define _ICON_HXX\n\/\/#define _IMAGE_HXX\n\/\/#define _KEYCOD_HXX\n\/\/#define _EVENT_HXX\n#define _HELP_HXX\n\/\/#define _APP_HXX\n\/\/#define _MDIAPP_HXX\n\/\/#define _TIMER_HXX\n\/\/#define _METRIC_HXX\n\/\/#define _REGION_HXX\n\/\/#define _OUTDEV_HXX\n\/\/#define _SYSTEM_HXX\n\/\/#define _VIRDEV_HXX\n\/\/#define _JOBSET_HXX\n\/\/#define _PRINT_HXX\n\/\/#define _WINDOW_HXX\n\/\/#define _SYSWIN_HXX\n\/\/#define _WRKWIN_HXX\n#define _MDIWIN_HXX\n\/\/#define _FLOATWIN_HXX\n\/\/#define _DOCKWIN_HXX\n\/\/#define _CTRL_HXX\n\/\/#define _SCRBAR_HXX\n\/\/#define _BUTTON_HXX\n\/\/#define _IMAGEBTN_HXX\n\/\/#define _FIXED_HXX\n\/\/#define _GROUP_HXX\n\/\/#define _EDIT_HXX\n\/\/#define _COMBOBOX_HXX\n\/\/#define _LSTBOX_HXX\n\/\/#define _SELENG_HXX ***\n\/\/#define _SPLIT_HXX\n#define _SPIN_HXX\n\/\/#define _FIELD_HXX\n\/\/#define _MOREBTN_HXX ***\n\/\/#define _TOOLBOX_HXX\n\/\/#define _STATUS_HXX ***\n\/\/#define _DIALOG_HXX\n\/\/#define _MSGBOX_HXX\n\/\/#define _SYSDLG_HXX\n\/\/#define _FILDLG_HXX\n\/\/#define _PRNDLG_HXX\n#define _COLDLG_HXX\n\/\/#define _TABDLG_HXX\n\/\/#define _MENU_HXX\n\/\/#define _GDIMTF_HXX\n\/\/#define _POLY_HXX\n\/\/#define _ACCEL_HXX\n\/\/#define _GRAPH_HXX\n#define _SOUND_HXX\n\n\/\/------------------------------------------------------------------------\n\n#include <svx\/svdview.hxx>\n#ifndef _SVDOBJ_HXX\n#include <svx\/svdobj.hxx>\n#endif\n\n#include \"fuconpol.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"sc.hrc\"\n\n\/\/ #98185# Create default drawing objects via keyboard\n#ifndef _SVDOPATH_HXX\n#include <svx\/svdopath.hxx>\n#endif\n\n#ifndef _BGFX_POLYGON_B2DPOLYGON_HXX\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#endif\n\n#ifndef _BGFX_POINT_B2DPOINT_HXX\n#include <basegfx\/point\/b2dpoint.hxx>\n#endif\n\n\/\/ Pixelabstand zum Schliessen von Freihand-Zeichnungen\n#ifndef CLOSE_PIXDIST\n#define CLOSE_PIXDIST 5\n#endif\n\n\/\/------------------------------------------------------------------------\n\n\/*************************************************************************\n|*\n|* Konstruktor\n|*\n\\************************************************************************\/\n\nFuConstPolygon::FuConstPolygon(ScTabViewShell* pViewSh, Window* pWin, SdrView* pViewP,\n SdrModel* pDoc, SfxRequest& rReq)\n : FuConstruct(pViewSh, pWin, pViewP, pDoc, rReq)\n{\n}\n\n\/*************************************************************************\n|*\n|* Destruktor\n|*\n\\************************************************************************\/\n\nFuConstPolygon::~FuConstPolygon()\n{\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonDown-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseButtonDown(const MouseEvent& rMEvt)\n{\n \/\/ #95491# remember button state for creation of own MouseEvents\n SetMouseButtonCode(rMEvt.GetButtons());\n\n BOOL bReturn = FuConstruct::MouseButtonDown(rMEvt);\n\n SdrViewEvent aVEvt;\n (void)pView->PickAnything(rMEvt, SDRMOUSEBUTTONDOWN, aVEvt);\n if (aVEvt.eEvent == SDREVENT_BEGTEXTEDIT)\n {\n \/\/ Texteingabe hier nicht zulassen\n aVEvt.eEvent = SDREVENT_BEGDRAGOBJ;\n pView->EnableExtendedMouseEventDispatcher(FALSE);\n }\n else\n {\n pView->EnableExtendedMouseEventDispatcher(TRUE);\n }\n\n if ( pView->MouseButtonDown(rMEvt, pWindow) )\n bReturn = TRUE;\n\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseMove-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseMove(const MouseEvent& rMEvt)\n{\n pView->MouseMove(rMEvt, pWindow);\n BOOL bReturn = FuConstruct::MouseMove(rMEvt);\n return bReturn;\n}\n\n\/*************************************************************************\n|*\n|* MouseButtonUp-event\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::MouseButtonUp(const MouseEvent& rMEvt)\n{\n \/\/ #95491# remember button state for creation of own MouseEvents\n SetMouseButtonCode(rMEvt.GetButtons());\n\n BOOL bReturn = FALSE;\n BOOL bSimple = FALSE;\n\n SdrViewEvent aVEvt;\n (void)pView->PickAnything(rMEvt, SDRMOUSEBUTTONUP, aVEvt);\n\n pView->MouseButtonUp(rMEvt, pWindow);\n\n if (aVEvt.eEvent == SDREVENT_ENDCREATE)\n {\n bReturn = TRUE;\n bSimple = TRUE; \/\/ Doppelklick nicht weiterreichen\n }\n\n BOOL bParent;\n if (bSimple)\n bParent = FuConstruct::SimpleMouseButtonUp(rMEvt);\n else\n bParent = FuConstruct::MouseButtonUp(rMEvt);\n\n return (bParent || bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Tastaturereignisse bearbeiten\n|*\n|* Wird ein KeyEvent bearbeitet, so ist der Return-Wert TRUE, andernfalls\n|* FALSE.\n|*\n\\************************************************************************\/\n\nBOOL __EXPORT FuConstPolygon::KeyInput(const KeyEvent& rKEvt)\n{\n BOOL bReturn = FuConstruct::KeyInput(rKEvt);\n\n return(bReturn);\n}\n\n\/*************************************************************************\n|*\n|* Function aktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstPolygon::Activate()\n{\n pView->EnableExtendedMouseEventDispatcher(TRUE);\n\n SdrObjKind eKind;\n\n switch (GetSlotID())\n {\n case SID_DRAW_POLYGON_NOFILL:\n case SID_DRAW_XPOLYGON_NOFILL:\n {\n eKind = OBJ_PLIN;\n }\n break;\n\n case SID_DRAW_POLYGON:\n case SID_DRAW_XPOLYGON:\n {\n eKind = OBJ_POLY;\n }\n break;\n\n case SID_DRAW_BEZIER_NOFILL:\n {\n eKind = OBJ_PATHLINE;\n }\n break;\n\n case SID_DRAW_BEZIER_FILL:\n {\n eKind = OBJ_PATHFILL;\n }\n break;\n\n case SID_DRAW_FREELINE_NOFILL:\n {\n eKind = OBJ_FREELINE;\n }\n break;\n\n case SID_DRAW_FREELINE:\n {\n eKind = OBJ_FREEFILL;\n }\n break;\n\n default:\n {\n eKind = OBJ_PATHLINE;\n }\n break;\n }\n\n pView->SetCurrentObj(sal::static_int_cast<UINT16>(eKind));\n\n pView->SetEditMode(SDREDITMODE_CREATE);\n\n FuConstruct::Activate();\n\n aNewPointer = Pointer( POINTER_DRAW_POLYGON );\n aOldPointer = pWindow->GetPointer();\n pViewShell->SetActivePointer( aNewPointer );\n}\n\n\/*************************************************************************\n|*\n|* Function deaktivieren\n|*\n\\************************************************************************\/\n\nvoid FuConstPolygon::Deactivate()\n{\n pView->SetEditMode(SDREDITMODE_EDIT);\n\n pView->EnableExtendedMouseEventDispatcher(FALSE);\n\n FuConstruct::Deactivate();\n\n pViewShell->SetActivePointer( aOldPointer );\n}\n\n\/\/ #98185# Create default drawing objects via keyboard\nSdrObject* FuConstPolygon::CreateDefaultObject(const sal_uInt16 nID, const Rectangle& rRectangle)\n{\n \/\/ case SID_DRAW_POLYGON:\n \/\/ case SID_DRAW_POLYGON_NOFILL:\n \/\/ case SID_DRAW_BEZIER_NOFILL:\n \/\/ case SID_DRAW_FREELINE_NOFILL:\n\n SdrObject* pObj = SdrObjFactory::MakeNewObject(\n pView->GetCurrentObjInventor(), pView->GetCurrentObjIdentifier(),\n 0L, pDrDoc);\n\n if(pObj)\n {\n if(pObj->ISA(SdrPathObj))\n {\n basegfx::B2DPolyPolygon aPoly;\n\n switch(nID)\n {\n case SID_DRAW_BEZIER_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n\n const basegfx::B2DPoint aCenterBottom(rRectangle.Center().X(), rRectangle.Bottom());\n aInnerPoly.appendBezierSegment(\n aCenterBottom,\n aCenterBottom,\n basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Center().Y()));\n\n const basegfx::B2DPoint aCenterTop(rRectangle.Center().X(), rRectangle.Top());\n aInnerPoly.appendBezierSegment(\n aCenterTop,\n aCenterTop,\n basegfx::B2DPoint(rRectangle.Right(), rRectangle.Top()));\n\n aPoly.append(aInnerPoly);\n break;\n }\n case SID_DRAW_FREELINE_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n\n aInnerPoly.appendBezierSegment(\n basegfx::B2DPoint(rRectangle.Left(), rRectangle.Top()),\n basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Top()),\n basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Center().Y()));\n\n aInnerPoly.appendBezierSegment(\n basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Bottom()),\n basegfx::B2DPoint(rRectangle.Right(), rRectangle.Bottom()),\n basegfx::B2DPoint(rRectangle.Right(), rRectangle.Top()));\n\n aPoly.append(aInnerPoly);\n break;\n }\n case SID_DRAW_POLYGON:\n case SID_DRAW_POLYGON_NOFILL:\n {\n basegfx::B2DPolygon aInnerPoly;\n const sal_Int32 nWdt(rRectangle.GetWidth());\n const sal_Int32 nHgt(rRectangle.GetHeight());\n\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Bottom()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 30) \/ 100, rRectangle.Top() + (nHgt * 70) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left(), rRectangle.Top() + (nHgt * 15) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 65) \/ 100, rRectangle.Top()));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + nWdt, rRectangle.Top() + (nHgt * 30) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 80) \/ 100, rRectangle.Top() + (nHgt * 50) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Left() + (nWdt * 80) \/ 100, rRectangle.Top() + (nHgt * 75) \/ 100));\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Bottom(), rRectangle.Right()));\n\n if(SID_DRAW_POLYGON_NOFILL == nID)\n {\n aInnerPoly.append(basegfx::B2DPoint(rRectangle.Center().X(), rRectangle.Bottom()));\n }\n else\n {\n aInnerPoly.setClosed(true);\n }\n\n aPoly.append(aInnerPoly);\n break;\n }\n }\n\n ((SdrPathObj*)pObj)->SetPathPoly(aPoly);\n }\n else\n {\n DBG_ERROR(\"Object is NO path object\");\n }\n\n pObj->SetLogicRect(rRectangle);\n }\n\n return pObj;\n}\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010-2020 DatasysLab@iit.edu(http:\/\/datasys.cs.iit.edu\/index.html).\n * Director: Ioan Raicu(iraicu@cs.iit.edu)\n *\t \n * This file is part of ZHT library(http:\/\/datasys.cs.iit.edu\/projects\/ZHT\/index.html).\n * Ioan Raicu(iraicu@cs.iit.edu),\n * Tonglin Li(tli13@hawk.iit.edu) with nickname tony,\n * Xiaobing Zhou(xzhou40@hawk.iit.edu) with nickname xiaobingo.\n * \n * The ZHT Library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * The ZHT Library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with the ZHT Library; if not, write to the \n * Data-Intensive Distributed Systems Laboratory, 10 W. 31st Street,\n * Stuart Building, Room 003B, Chicago, IL 60616 USA.\n *\n * iteration.cpp\n *\n * Created on: Aug 12, 2012\n * Author: tony, xiaobingo\n *\/\n\n#include \"novoht.h\"\n\nint main(int argc, char **argv) {\n\n\tNoVoHT *map = new NoVoHT(\"hash.table\", 1000, 100);\n\/\/\tmap->put(\"kevin\", \"hello\");\n\tmap->put(\"kevin\", \"overwrite\");\n\tmap->put(\"hello1\", \"zht1\");\n\tmap->put(\"hello2\", \"zht2\");\n\/\/\tprintf(\"The value is %s\\n\", (map->get(\"kevin\"))->c_str());\n\n\t\/*\tkey_iterator ki = map->keyIterator();\n\t while (ki.hasNext()) {\n\t printf(\"The next key is %s\\n\", ki.next().c_str());\n\t }\n\n\t val_iterator vi = map->valIterator();\n\t while (vi.hasNext()) {\n\t printf(\"The next value is %s\\n\", vi.next().c_str());\n\t }*\/\n\n\tint i = 0;\n\tpair_iterator kvi = map->pairIterator();\n\twhile (kvi.hasNext()) {\n\t\t\/*kvpair kv = kvi.next();\n\t\tprintf(\"The next key is %s\\n\", kv.key.c_str());\n\t\tprintf(\"The next value is %s\\n\", kv.val.c_str());*\/\n\n\t\tkvi.next();\n\t\t\/\/map->remove(kv.key);\n\n\n\/\/\t\tkvi.remove();\n\t}\n\n\tprintf(\"%s\\n\", \"---------------\");\n\n\tkvi = map->pairIterator();\n\twhile (kvi.hasNext()) {\n\t\tkvpair kv = kvi.next();\n\t\tprintf(\"The next key is %s\\n\", kv.key.c_str());\n\t\tprintf(\"The next value is %s\\n\", kv.val.c_str());\n\t}\n\n\t\/*while (ki.hasNext() && vi.hasNext()) {\n\t printf(\"The next key is %s\\n\", ki.next().c_str());\n\t printf(\"The next value is %s\\n\", vi.next().c_str());\n\t }*\/\n\n\t\/\/bool b = ki.hasNext();\n\t\/*\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\t *\/\n\t\/*\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\t *\/\n\n}\n\n<commit_msg>test novoht constructor with single parameter, filename<commit_after>\/*\n * Copyright (C) 2010-2020 DatasysLab@iit.edu(http:\/\/datasys.cs.iit.edu\/index.html).\n * Director: Ioan Raicu(iraicu@cs.iit.edu)\n *\t \n * This file is part of ZHT library(http:\/\/datasys.cs.iit.edu\/projects\/ZHT\/index.html).\n * Ioan Raicu(iraicu@cs.iit.edu),\n * Tonglin Li(tli13@hawk.iit.edu) with nickname tony,\n * Xiaobing Zhou(xzhou40@hawk.iit.edu) with nickname xiaobingo.\n * \n * The ZHT Library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * The ZHT Library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with the ZHT Library; if not, write to the \n * Data-Intensive Distributed Systems Laboratory, 10 W. 31st Street,\n * Stuart Building, Room 003B, Chicago, IL 60616 USA.\n *\n * iteration.cpp\n *\n * Created on: Aug 12, 2012\n * Author: tony, xiaobingo\n *\/\n\n#include \"novoht.h\"\n\nint main(int argc, char **argv) {\n\n\/\/\tNoVoHT *map = new NoVoHT(\"hash.table\", 1000, 100);\n\tNoVoHT *map = new NoVoHT(\"hash.table\");\n\/\/\tmap->put(\"kevin\", \"hello\");\n\tmap->put(\"kevin\", \"overwrite\");\n\tmap->put(\"hello1\", \"zht1\");\n\tmap->put(\"hello2\", \"zht2\");\n\/\/\tprintf(\"The value is %s\\n\", (map->get(\"kevin\"))->c_str());\n\n\t\/*\tkey_iterator ki = map->keyIterator();\n\t while (ki.hasNext()) {\n\t printf(\"The next key is %s\\n\", ki.next().c_str());\n\t }\n\n\t val_iterator vi = map->valIterator();\n\t while (vi.hasNext()) {\n\t printf(\"The next value is %s\\n\", vi.next().c_str());\n\t }*\/\n\n\tint i = 0;\n\tpair_iterator kvi = map->pairIterator();\n\twhile (kvi.hasNext()) {\n\t\tkvpair kv = kvi.next();\n\t\tprintf(\"The next key is %s\\n\", kv.key.c_str());\n\t\tprintf(\"The next value is %s\\n\", kv.val.c_str());\n\n\/\/\t\tkvi.next();\n\t\t\/\/map->remove(kv.key);\n\n\/\/\t\tkvi.remove();\n\t}\n\n\tprintf(\"%s\\n\", \"---------------\");\n\n\tkvi = map->pairIterator();\n\twhile (kvi.hasNext()) {\n\t\tkvpair kv = kvi.next();\n\t\tprintf(\"The next key is %s\\n\", kv.key.c_str());\n\t\tprintf(\"The next value is %s\\n\", kv.val.c_str());\n\t}\n\n\t\/*while (ki.hasNext() && vi.hasNext()) {\n\t printf(\"The next key is %s\\n\", ki.next().c_str());\n\t printf(\"The next value is %s\\n\", vi.next().c_str());\n\t }*\/\n\n\t\/\/bool b = ki.hasNext();\n\t\/*\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\t *\/\n\t\/*\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\n\t printf(\"The next key is %s\\n\", ki.hasNext() ? ki.next().c_str() : \"no key\");\n\t printf(\"The next value is %s\\n\",\n\t vi.hasNext() ? vi.next().c_str() : \"no value\");\n\t *\/\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: instbdlg.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 22:10:05 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#undef SC_DLLIMPLEMENTATION\n\n#ifdef PCH\n#include \"ui_pch.hxx\"\n#endif\n\n#pragma hdrstop\n\n\/\/------------------------------------------------------------------\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/docfile.hxx>\n#include <svtools\/ehdl.hxx>\n#include <svtools\/sfxecode.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"global.hxx\"\n#include \"docsh.hxx\"\n#include \"viewdata.hxx\"\n#include \"scresid.hxx\"\n#include \"instbdlg.hrc\"\n#include \"globstr.hrc\"\n\n\n#define SC_INSTBDLG_CXX\n#include \"instbdlg.hxx\"\n\nconst long SC_DLG_BROWSE_OK = 0;\nconst long SC_DLG_BROWSE_CANCEL = 1;\n\n\/\/==================================================================\n\nScInsertTableDlg::ScInsertTableDlg( Window* pParent, ScViewData& rData, SCTAB nTabCount, bool bFromFile )\n\n : ModalDialog ( pParent, ScResId( RID_SCDLG_INSERT_TABLE ) ),\n \/\/\n aBtnBefore ( this, ScResId( RB_BEFORE ) ),\n aBtnBehind ( this, ScResId( RB_BEHIND ) ),\n aFlPos ( this, ScResId( FL_POSITION ) ),\n aFtCount ( this, ScResId( FT_COUNT ) ),\n aNfCount ( this, ScResId( NF_COUNT ) ),\n aFtName ( this, ScResId( FT_NAME ) ),\n aEdName ( this, ScResId( ED_TABNAME ) ),\n aLbTables ( this, ScResId( LB_TABLES ) ),\n aFtPath ( this, ScResId( FT_PATH ) ),\n aBtnBrowse ( this, ScResId( BTN_BROWSE ) ),\n aBtnLink ( this, ScResId( CB_LINK ) ),\n aFlTable ( this, ScResId( FL_TABLE ) ),\n aBtnNew ( this, ScResId( RB_NEW ) ),\n aBtnFromFile ( this, ScResId( RB_FROMFILE ) ),\n aBtnOk ( this, ScResId( BTN_OK ) ),\n aBtnCancel ( this, ScResId( BTN_CANCEL ) ),\n aBtnHelp ( this, ScResId( BTN_HELP ) ),\n rViewData ( rData ),\n rDoc ( *rData.GetDocument() ),\n pDocShTables ( NULL ),\n nSelTabIndex ( 0 ),\n nTableCount (nTabCount)\n{\n Init_Impl( bFromFile );\n FreeResource();\n}\n\n\/\/------------------------------------------------------------------------\n\n__EXPORT ScInsertTableDlg::~ScInsertTableDlg()\n{\n if (pDocShTables)\n pDocShTables->DoClose();\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::Init_Impl( bool bFromFile )\n{\n aBtnBrowse .SetClickHdl( LINK( this, ScInsertTableDlg, BrowseHdl_Impl ) );\n aBtnNew .SetClickHdl( LINK( this, ScInsertTableDlg, ChoiceHdl_Impl ) );\n aBtnFromFile .SetClickHdl( LINK( this, ScInsertTableDlg, ChoiceHdl_Impl ) );\n aLbTables .SetSelectHdl( LINK( this, ScInsertTableDlg, SelectHdl_Impl ) );\n aNfCount .SetModifyHdl( LINK( this, ScInsertTableDlg, CountHdl_Impl));\n aBtnOk .SetClickHdl( LINK( this, ScInsertTableDlg, DoEnterHdl ));\n aBtnBefore.Check();\n\n ScMarkData& rMark = rViewData.GetMarkData();\n SCTAB nTabSelCount = rMark.GetSelectCount();\n\n aNfCount.SetText( String::CreateFromInt32(nTableCount) );\n aNfCount.SetMax( MAXTAB - rDoc.GetTableCount() + 1 );\n\n if(nTableCount==1)\n {\n String aName;\n rDoc.CreateValidTabName( aName );\n aEdName.SetText( aName );\n }\n else\n {\n String aName=aFlTable.GetText();\n aName.AppendAscii(RTL_CONSTASCII_STRINGPARAM(\"...\"));\n aEdName.SetText( aName );\n aFtName.Disable();\n aEdName.Disable();\n }\n\n if( bFromFile )\n {\n aBtnFromFile.Check();\n SetFromTo_Impl();\n }\n else\n {\n aBtnNew.Check();\n SetNewTable_Impl();\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nshort __EXPORT ScInsertTableDlg::Execute()\n{\n \/\/ Parent fuer InsertDocumentDialog und Doc-Manager setzen:\n\n Window* pOldDefParent = Application::GetDefDialogParent();\n Application::SetDefDialogParent( this );\n\n bool bExecute = true;\n if( aBtnFromFile.IsChecked() )\n bExecute = BrowseHdl_Impl( &aBtnBrowse ) == SC_DLG_BROWSE_OK;\n\n short nRet = bExecute ? ModalDialog::Execute() : RET_CANCEL;\n\n Application::SetDefDialogParent( pOldDefParent );\n\n return nRet;\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::SetNewTable_Impl()\n{\n if (aBtnNew.IsChecked() )\n {\n aNfCount .Enable();\n aFtCount .Enable();\n aLbTables .Disable();\n aFtPath .Disable();\n aBtnBrowse .Disable();\n aBtnLink .Disable();\n\n if(nTableCount==1)\n {\n aEdName.Enable();\n aFtName.Enable();\n }\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::SetFromTo_Impl()\n{\n if (aBtnFromFile.IsChecked() )\n {\n aEdName .Disable();\n aFtName .Disable();\n aFtCount .Disable();\n aNfCount .Disable();\n aLbTables .Enable();\n aFtPath .Enable();\n aBtnBrowse .Enable();\n aBtnLink .Enable();\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::FillTables_Impl( ScDocument* pSrcDoc )\n{\n aLbTables.SetUpdateMode( FALSE );\n aLbTables.Clear();\n\n if ( pSrcDoc )\n {\n SCTAB nCount = pSrcDoc->GetTableCount();\n String aName;\n\n for ( SCTAB i=0; i<nCount; i++ )\n {\n pSrcDoc->GetName( i, aName );\n aLbTables.InsertEntry( aName );\n }\n }\n\n aLbTables.SetUpdateMode( TRUE );\n\n if(aLbTables.GetEntryCount()==1)\n aLbTables.SelectEntryPos(0);\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String* ScInsertTableDlg::GetFirstTable( USHORT* pN )\n{\n const String* pStr = NULL;\n\n if ( aBtnNew.IsChecked() )\n {\n aStrCurSelTable = aEdName.GetText();\n pStr = &aStrCurSelTable;\n }\n else if ( nSelTabIndex < aLbTables.GetSelectEntryCount() )\n {\n aStrCurSelTable = aLbTables.GetSelectEntry( 0 );\n pStr = &aStrCurSelTable;\n if ( pN )\n *pN = aLbTables.GetSelectEntryPos( 0 );\n nSelTabIndex = 1;\n }\n\n return pStr;\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String* ScInsertTableDlg::GetNextTable( USHORT* pN )\n{\n const String* pStr = NULL;\n\n if ( !aBtnNew.IsChecked() && nSelTabIndex < aLbTables.GetSelectEntryCount() )\n {\n aStrCurSelTable = aLbTables.GetSelectEntry( nSelTabIndex );\n pStr = &aStrCurSelTable;\n if ( pN )\n *pN = aLbTables.GetSelectEntryPos( nSelTabIndex );\n nSelTabIndex++;\n }\n\n return pStr;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Handler:\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, CountHdl_Impl, NumericField*, EMPTYARG )\n{\n nTableCount = static_cast<SCTAB>(aNfCount.GetValue());\n if ( nTableCount==1)\n {\n String aName;\n rDoc.CreateValidTabName( aName );\n aEdName.SetText( aName );\n aFtName.Enable();\n aEdName.Enable();\n }\n else\n {\n String aName=aFlTable.GetText();\n aName.AppendAscii(RTL_CONSTASCII_STRINGPARAM(\"...\"));\n aEdName.SetText( aName );\n aFtName.Disable();\n aEdName.Disable();\n }\n\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\nIMPL_LINK( ScInsertTableDlg, ChoiceHdl_Impl, RadioButton*, EMPTYARG )\n{\n if ( aBtnNew.IsChecked() )\n SetNewTable_Impl();\n else\n SetFromTo_Impl();\n\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, BrowseHdl_Impl, PushButton*, EMPTYARG )\n{\n \/\/ Dialog-Parent ist schon in Execute gesetzt worden\n\n SfxApplication* pApp = SFX_APP();\n SfxMedium* pMed = pApp->InsertDocumentDialog( 0, String::CreateFromAscii( ScDocShell::Factory().GetShortName() ) );\n\n if ( pMed )\n {\n \/\/ ERRCTX_SFX_OPENDOC -> \"Fehler beim Laden des Dokumentes\"\n SfxErrorContext aEc( ERRCTX_SFX_OPENDOC, pMed->GetName() );\n\n if (pDocShTables)\n pDocShTables->DoClose(); \/\/ delete passiert beim Zuweisen auf die Ref\n\n pMed->UseInteractionHandler( TRUE ); \/\/ to enable the filter options dialog\n\n pDocShTables = new ScDocShell;\n aDocShTablesRef = pDocShTables;\n\n Pointer aOldPtr( GetPointer() );\n SetPointer( Pointer( POINTER_WAIT ) );\n pDocShTables->DoLoad( pMed );\n SetPointer( aOldPtr );\n\n ULONG nErr = pDocShTables->GetErrorCode();\n if (nErr)\n ErrorHandler::HandleError( nErr ); \/\/ auch Warnings\n\n if ( !pDocShTables->GetError() ) \/\/ nur Errors\n {\n FillTables_Impl( pDocShTables->GetDocument() );\n aFtPath.SetText( pDocShTables->GetTitle( SFX_TITLE_FULLNAME ) );\n }\n else\n {\n pDocShTables->DoClose();\n aDocShTablesRef.Clear();\n pDocShTables = NULL;\n\n FillTables_Impl( NULL );\n aFtPath.SetText( EMPTY_STRING );\n }\n }\n\n DoEnable_Impl();\n return pMed ? SC_DLG_BROWSE_OK : SC_DLG_BROWSE_CANCEL;\n}\n\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, SelectHdl_Impl, MultiListBox*, EMPTYARG )\n{\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::DoEnable_Impl()\n{\n if ( aBtnNew.IsChecked() || ( pDocShTables && aLbTables.GetSelectEntryCount() ) )\n aBtnOk.Enable();\n else\n aBtnOk.Disable();\n}\n\nIMPL_LINK( ScInsertTableDlg, DoEnterHdl, PushButton*, EMPTYARG )\n{\n if(nTableCount > 1 || rDoc.ValidTabName(aEdName.GetText()))\n {\n EndDialog(RET_OK);\n }\n else\n {\n String aErrMsg ( ScGlobal::GetRscString( STR_INVALIDTABNAME ) );\n USHORT nRet = ErrorBox( this,WinBits( WB_OK | WB_DEF_OK ),aErrMsg).Execute();\n }\n return 0;\n}\n\n\n\n<commit_msg>INTEGRATION: CWS pchfix01 (1.10.216); FILE MERGED 2006\/07\/12 10:02:44 kaib 1.10.216.1: #i67080# Converted cxx files in sc, added initial project level pch and stripped old PCH definitions.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: instbdlg.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: kz $ $Date: 2006-07-21 14:07:02 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n#undef SC_DLLIMPLEMENTATION\n\n\n\n\/\/------------------------------------------------------------------\n\n#include <sfx2\/app.hxx>\n#include <sfx2\/docfile.hxx>\n#include <svtools\/ehdl.hxx>\n#include <svtools\/sfxecode.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"global.hxx\"\n#include \"docsh.hxx\"\n#include \"viewdata.hxx\"\n#include \"scresid.hxx\"\n#include \"instbdlg.hrc\"\n#include \"globstr.hrc\"\n\n\n#define SC_INSTBDLG_CXX\n#include \"instbdlg.hxx\"\n\nconst long SC_DLG_BROWSE_OK = 0;\nconst long SC_DLG_BROWSE_CANCEL = 1;\n\n\/\/==================================================================\n\nScInsertTableDlg::ScInsertTableDlg( Window* pParent, ScViewData& rData, SCTAB nTabCount, bool bFromFile )\n\n : ModalDialog ( pParent, ScResId( RID_SCDLG_INSERT_TABLE ) ),\n \/\/\n aBtnBefore ( this, ScResId( RB_BEFORE ) ),\n aBtnBehind ( this, ScResId( RB_BEHIND ) ),\n aFlPos ( this, ScResId( FL_POSITION ) ),\n aFtCount ( this, ScResId( FT_COUNT ) ),\n aNfCount ( this, ScResId( NF_COUNT ) ),\n aFtName ( this, ScResId( FT_NAME ) ),\n aEdName ( this, ScResId( ED_TABNAME ) ),\n aLbTables ( this, ScResId( LB_TABLES ) ),\n aFtPath ( this, ScResId( FT_PATH ) ),\n aBtnBrowse ( this, ScResId( BTN_BROWSE ) ),\n aBtnLink ( this, ScResId( CB_LINK ) ),\n aFlTable ( this, ScResId( FL_TABLE ) ),\n aBtnNew ( this, ScResId( RB_NEW ) ),\n aBtnFromFile ( this, ScResId( RB_FROMFILE ) ),\n aBtnOk ( this, ScResId( BTN_OK ) ),\n aBtnCancel ( this, ScResId( BTN_CANCEL ) ),\n aBtnHelp ( this, ScResId( BTN_HELP ) ),\n rViewData ( rData ),\n rDoc ( *rData.GetDocument() ),\n pDocShTables ( NULL ),\n nSelTabIndex ( 0 ),\n nTableCount (nTabCount)\n{\n Init_Impl( bFromFile );\n FreeResource();\n}\n\n\/\/------------------------------------------------------------------------\n\n__EXPORT ScInsertTableDlg::~ScInsertTableDlg()\n{\n if (pDocShTables)\n pDocShTables->DoClose();\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::Init_Impl( bool bFromFile )\n{\n aBtnBrowse .SetClickHdl( LINK( this, ScInsertTableDlg, BrowseHdl_Impl ) );\n aBtnNew .SetClickHdl( LINK( this, ScInsertTableDlg, ChoiceHdl_Impl ) );\n aBtnFromFile .SetClickHdl( LINK( this, ScInsertTableDlg, ChoiceHdl_Impl ) );\n aLbTables .SetSelectHdl( LINK( this, ScInsertTableDlg, SelectHdl_Impl ) );\n aNfCount .SetModifyHdl( LINK( this, ScInsertTableDlg, CountHdl_Impl));\n aBtnOk .SetClickHdl( LINK( this, ScInsertTableDlg, DoEnterHdl ));\n aBtnBefore.Check();\n\n ScMarkData& rMark = rViewData.GetMarkData();\n SCTAB nTabSelCount = rMark.GetSelectCount();\n\n aNfCount.SetText( String::CreateFromInt32(nTableCount) );\n aNfCount.SetMax( MAXTAB - rDoc.GetTableCount() + 1 );\n\n if(nTableCount==1)\n {\n String aName;\n rDoc.CreateValidTabName( aName );\n aEdName.SetText( aName );\n }\n else\n {\n String aName=aFlTable.GetText();\n aName.AppendAscii(RTL_CONSTASCII_STRINGPARAM(\"...\"));\n aEdName.SetText( aName );\n aFtName.Disable();\n aEdName.Disable();\n }\n\n if( bFromFile )\n {\n aBtnFromFile.Check();\n SetFromTo_Impl();\n }\n else\n {\n aBtnNew.Check();\n SetNewTable_Impl();\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nshort __EXPORT ScInsertTableDlg::Execute()\n{\n \/\/ Parent fuer InsertDocumentDialog und Doc-Manager setzen:\n\n Window* pOldDefParent = Application::GetDefDialogParent();\n Application::SetDefDialogParent( this );\n\n bool bExecute = true;\n if( aBtnFromFile.IsChecked() )\n bExecute = BrowseHdl_Impl( &aBtnBrowse ) == SC_DLG_BROWSE_OK;\n\n short nRet = bExecute ? ModalDialog::Execute() : RET_CANCEL;\n\n Application::SetDefDialogParent( pOldDefParent );\n\n return nRet;\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::SetNewTable_Impl()\n{\n if (aBtnNew.IsChecked() )\n {\n aNfCount .Enable();\n aFtCount .Enable();\n aLbTables .Disable();\n aFtPath .Disable();\n aBtnBrowse .Disable();\n aBtnLink .Disable();\n\n if(nTableCount==1)\n {\n aEdName.Enable();\n aFtName.Enable();\n }\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::SetFromTo_Impl()\n{\n if (aBtnFromFile.IsChecked() )\n {\n aEdName .Disable();\n aFtName .Disable();\n aFtCount .Disable();\n aNfCount .Disable();\n aLbTables .Enable();\n aFtPath .Enable();\n aBtnBrowse .Enable();\n aBtnLink .Enable();\n }\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::FillTables_Impl( ScDocument* pSrcDoc )\n{\n aLbTables.SetUpdateMode( FALSE );\n aLbTables.Clear();\n\n if ( pSrcDoc )\n {\n SCTAB nCount = pSrcDoc->GetTableCount();\n String aName;\n\n for ( SCTAB i=0; i<nCount; i++ )\n {\n pSrcDoc->GetName( i, aName );\n aLbTables.InsertEntry( aName );\n }\n }\n\n aLbTables.SetUpdateMode( TRUE );\n\n if(aLbTables.GetEntryCount()==1)\n aLbTables.SelectEntryPos(0);\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String* ScInsertTableDlg::GetFirstTable( USHORT* pN )\n{\n const String* pStr = NULL;\n\n if ( aBtnNew.IsChecked() )\n {\n aStrCurSelTable = aEdName.GetText();\n pStr = &aStrCurSelTable;\n }\n else if ( nSelTabIndex < aLbTables.GetSelectEntryCount() )\n {\n aStrCurSelTable = aLbTables.GetSelectEntry( 0 );\n pStr = &aStrCurSelTable;\n if ( pN )\n *pN = aLbTables.GetSelectEntryPos( 0 );\n nSelTabIndex = 1;\n }\n\n return pStr;\n}\n\n\/\/------------------------------------------------------------------------\n\nconst String* ScInsertTableDlg::GetNextTable( USHORT* pN )\n{\n const String* pStr = NULL;\n\n if ( !aBtnNew.IsChecked() && nSelTabIndex < aLbTables.GetSelectEntryCount() )\n {\n aStrCurSelTable = aLbTables.GetSelectEntry( nSelTabIndex );\n pStr = &aStrCurSelTable;\n if ( pN )\n *pN = aLbTables.GetSelectEntryPos( nSelTabIndex );\n nSelTabIndex++;\n }\n\n return pStr;\n}\n\n\n\/\/------------------------------------------------------------------------\n\/\/ Handler:\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, CountHdl_Impl, NumericField*, EMPTYARG )\n{\n nTableCount = static_cast<SCTAB>(aNfCount.GetValue());\n if ( nTableCount==1)\n {\n String aName;\n rDoc.CreateValidTabName( aName );\n aEdName.SetText( aName );\n aFtName.Enable();\n aEdName.Enable();\n }\n else\n {\n String aName=aFlTable.GetText();\n aName.AppendAscii(RTL_CONSTASCII_STRINGPARAM(\"...\"));\n aEdName.SetText( aName );\n aFtName.Disable();\n aEdName.Disable();\n }\n\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\nIMPL_LINK( ScInsertTableDlg, ChoiceHdl_Impl, RadioButton*, EMPTYARG )\n{\n if ( aBtnNew.IsChecked() )\n SetNewTable_Impl();\n else\n SetFromTo_Impl();\n\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, BrowseHdl_Impl, PushButton*, EMPTYARG )\n{\n \/\/ Dialog-Parent ist schon in Execute gesetzt worden\n\n SfxApplication* pApp = SFX_APP();\n SfxMedium* pMed = pApp->InsertDocumentDialog( 0, String::CreateFromAscii( ScDocShell::Factory().GetShortName() ) );\n\n if ( pMed )\n {\n \/\/ ERRCTX_SFX_OPENDOC -> \"Fehler beim Laden des Dokumentes\"\n SfxErrorContext aEc( ERRCTX_SFX_OPENDOC, pMed->GetName() );\n\n if (pDocShTables)\n pDocShTables->DoClose(); \/\/ delete passiert beim Zuweisen auf die Ref\n\n pMed->UseInteractionHandler( TRUE ); \/\/ to enable the filter options dialog\n\n pDocShTables = new ScDocShell;\n aDocShTablesRef = pDocShTables;\n\n Pointer aOldPtr( GetPointer() );\n SetPointer( Pointer( POINTER_WAIT ) );\n pDocShTables->DoLoad( pMed );\n SetPointer( aOldPtr );\n\n ULONG nErr = pDocShTables->GetErrorCode();\n if (nErr)\n ErrorHandler::HandleError( nErr ); \/\/ auch Warnings\n\n if ( !pDocShTables->GetError() ) \/\/ nur Errors\n {\n FillTables_Impl( pDocShTables->GetDocument() );\n aFtPath.SetText( pDocShTables->GetTitle( SFX_TITLE_FULLNAME ) );\n }\n else\n {\n pDocShTables->DoClose();\n aDocShTablesRef.Clear();\n pDocShTables = NULL;\n\n FillTables_Impl( NULL );\n aFtPath.SetText( EMPTY_STRING );\n }\n }\n\n DoEnable_Impl();\n return pMed ? SC_DLG_BROWSE_OK : SC_DLG_BROWSE_CANCEL;\n}\n\n\/\/------------------------------------------------------------------------\n\nIMPL_LINK( ScInsertTableDlg, SelectHdl_Impl, MultiListBox*, EMPTYARG )\n{\n DoEnable_Impl();\n return 0;\n}\n\n\/\/------------------------------------------------------------------------\n\nvoid ScInsertTableDlg::DoEnable_Impl()\n{\n if ( aBtnNew.IsChecked() || ( pDocShTables && aLbTables.GetSelectEntryCount() ) )\n aBtnOk.Enable();\n else\n aBtnOk.Disable();\n}\n\nIMPL_LINK( ScInsertTableDlg, DoEnterHdl, PushButton*, EMPTYARG )\n{\n if(nTableCount > 1 || rDoc.ValidTabName(aEdName.GetText()))\n {\n EndDialog(RET_OK);\n }\n else\n {\n String aErrMsg ( ScGlobal::GetRscString( STR_INVALIDTABNAME ) );\n USHORT nRet = ErrorBox( this,WinBits( WB_OK | WB_DEF_OK ),aErrMsg).Execute();\n }\n return 0;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: textdlgs.cxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: vg $ $Date: 2007-02-27 13:34:18 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n#undef SC_DLLIMPLEMENTATION\n\n\/\/ ohne precompiled Headers uebersetzen !!!\n\n\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include <svx\/svxids.hrc>\n#define ITEMID_TABSTOP 0\n\n\/\/CHINA001 #include <svx\/chardlg.hxx>\n#include <svx\/flstitem.hxx>\n\/\/CHINA001 #include <svx\/paragrph.hxx>\n\/\/CHINA001 #include <svx\/tabstpge.hxx>\n#include <sfx2\/objsh.hxx>\n#include <svtools\/cjkoptions.hxx>\n\n#include \"textdlgs.hxx\"\n#include \"scresid.hxx\"\n#include \"sc.hrc\"\n#include <svx\/svxids.hrc> \/\/add CHINA001\n#include <svtools\/intitem.hxx> \/\/add CHINA001\n#include <svx\/flagsdef.hxx> \/\/CHINA001\n\/\/ -----------------------------------------------------------------------\n\nScCharDlg::ScCharDlg( Window* pParent, const SfxItemSet* pAttr,\n const SfxObjectShell* pDocShell ) :\n SfxTabDialog ( pParent, ScResId( RID_SCDLG_CHAR ), pAttr ),\n rOutAttrs ( *pAttr ),\n rDocShell ( *pDocShell )\n{\n FreeResource();\n\n AddTabPage( RID_SVXPAGE_CHAR_NAME ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_NAME, SvxCharNamePage::Create, 0);\n AddTabPage( RID_SVXPAGE_CHAR_EFFECTS ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_EFFECTS, SvxCharEffectsPage::Create, 0);\n AddTabPage( RID_SVXPAGE_CHAR_POSITION ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_POSITION, SvxCharPositionPage::Create, 0);\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScCharDlg::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool())); \/\/CHINA001\n switch( nId )\n {\n case RID_SVXPAGE_CHAR_NAME:\n {\n SvxFontListItem aItem(*( (const SvxFontListItem*)\n ( rDocShell.GetItem( SID_ATTR_CHAR_FONTLIST) ) ) );\n\n \/\/CHINA001 ( (SvxCharNamePage&) rPage ).SetFontList( aItem );\n aSet.Put (SvxFontListItem( aItem.GetFontList(), SID_ATTR_CHAR_FONTLIST));\n rPage.PageCreated(aSet);\n }\n break;\n\n case RID_SVXPAGE_CHAR_EFFECTS:\n \/\/CHINA001 ( (SvxCharEffectsPage&) rPage ).DisableControls(\n \/\/CHINA001 DISABLE_CASEMAP);\n aSet.Put (SfxUInt16Item(SID_DISABLE_CTL,DISABLE_CASEMAP)); \/\/CHINA001\n rPage.PageCreated(aSet);\n break;\n\n default:\n break;\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nScParagraphDlg::ScParagraphDlg( Window* pParent, const SfxItemSet* pAttr ) :\n SfxTabDialog ( pParent, ScResId( RID_SCDLG_PARAGRAPH ), pAttr ),\n rOutAttrs ( *pAttr )\n{\n FreeResource();\n\n SvtCJKOptions aCJKOptions;\n\n AddTabPage( RID_SVXPAGE_STD_PARAGRAPH );\/\/CHINA001 AddTabPage( RID_SVXPAGE_STD_PARAGRAPH, SvxStdParagraphTabPage::Create, 0);\n AddTabPage( RID_SVXPAGE_ALIGN_PARAGRAPH );\/\/CHINA001 AddTabPage( RID_SVXPAGE_ALIGN_PARAGRAPH, SvxParaAlignTabPage::Create, 0);\n \/\/AddTabPage( RID_SVXPAGE_EXT_PARAGRAPH, SvxExtParagraphTabPage::Create, 0);\n if ( aCJKOptions.IsAsianTypographyEnabled() )\n AddTabPage( RID_SVXPAGE_PARA_ASIAN);\/\/CHINA001 AddTabPage( RID_SVXPAGE_PARA_ASIAN, SvxAsianTabPage::Create,0);\n else\n RemoveTabPage( RID_SVXPAGE_PARA_ASIAN );\n AddTabPage( RID_SVXPAGE_TABULATOR );\/\/CHINA001 AddTabPage( RID_SVXPAGE_TABULATOR, SvxTabulatorTabPage::Create, 0);\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScParagraphDlg::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n switch( nId )\n {\n case RID_SVXPAGE_TABULATOR:\n {\n \/\/CHINA001 ( (SvxTabulatorTabPage&) rPage ).\n \/\/CHINA001 DisableControls( TABTYPE_ALL &~TABTYPE_LEFT |\n \/\/CHINA001 TABFILL_ALL &~TABFILL_NONE );\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool()));\/\/add CHINA001\n aSet.Put(SfxUInt16Item(SID_SVXTABULATORTABPAGE_CONTROLFLAGS,TABTYPE_ALL &~TABTYPE_LEFT |\n TABFILL_ALL &~TABFILL_NONE ));\n rPage.PageCreated(aSet);\/\/add CHINA001\n }\n break;\n }\n}\n\n\n\n<commit_msg>INTEGRATION: CWS pchfix04 (1.8.104); FILE MERGED 2007\/04\/26 04:51:58 hjs 1.8.104.2: RESYNC: (1.8-1.9); FILE MERGED 2007\/02\/05 08:35:32 os 1.8.104.1: #i73604# usage of ITEMID_* removed<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: textdlgs.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: kz $ $Date: 2007-05-10 16:57:47 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n#undef SC_DLLIMPLEMENTATION\n\n\/\/ ohne precompiled Headers uebersetzen !!!\n\n\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n#include <svx\/svxids.hrc>\n\n\/\/CHINA001 #include <svx\/chardlg.hxx>\n#include <svx\/flstitem.hxx>\n\/\/CHINA001 #include <svx\/paragrph.hxx>\n\/\/CHINA001 #include <svx\/tabstpge.hxx>\n#include <sfx2\/objsh.hxx>\n#include <svtools\/cjkoptions.hxx>\n\n#include \"textdlgs.hxx\"\n#include \"scresid.hxx\"\n#include \"sc.hrc\"\n#include <svx\/svxids.hrc> \/\/add CHINA001\n#include <svtools\/intitem.hxx> \/\/add CHINA001\n#include <svx\/flagsdef.hxx> \/\/CHINA001\n\/\/ -----------------------------------------------------------------------\n\nScCharDlg::ScCharDlg( Window* pParent, const SfxItemSet* pAttr,\n const SfxObjectShell* pDocShell ) :\n SfxTabDialog ( pParent, ScResId( RID_SCDLG_CHAR ), pAttr ),\n rOutAttrs ( *pAttr ),\n rDocShell ( *pDocShell )\n{\n FreeResource();\n\n AddTabPage( RID_SVXPAGE_CHAR_NAME ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_NAME, SvxCharNamePage::Create, 0);\n AddTabPage( RID_SVXPAGE_CHAR_EFFECTS ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_EFFECTS, SvxCharEffectsPage::Create, 0);\n AddTabPage( RID_SVXPAGE_CHAR_POSITION ); \/\/CHINA001 AddTabPage( RID_SVXPAGE_CHAR_POSITION, SvxCharPositionPage::Create, 0);\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScCharDlg::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool())); \/\/CHINA001\n switch( nId )\n {\n case RID_SVXPAGE_CHAR_NAME:\n {\n SvxFontListItem aItem(*( (const SvxFontListItem*)\n ( rDocShell.GetItem( SID_ATTR_CHAR_FONTLIST) ) ) );\n\n \/\/CHINA001 ( (SvxCharNamePage&) rPage ).SetFontList( aItem );\n aSet.Put (SvxFontListItem( aItem.GetFontList(), SID_ATTR_CHAR_FONTLIST));\n rPage.PageCreated(aSet);\n }\n break;\n\n case RID_SVXPAGE_CHAR_EFFECTS:\n \/\/CHINA001 ( (SvxCharEffectsPage&) rPage ).DisableControls(\n \/\/CHINA001 DISABLE_CASEMAP);\n aSet.Put (SfxUInt16Item(SID_DISABLE_CTL,DISABLE_CASEMAP)); \/\/CHINA001\n rPage.PageCreated(aSet);\n break;\n\n default:\n break;\n }\n}\n\n\/\/ -----------------------------------------------------------------------\n\nScParagraphDlg::ScParagraphDlg( Window* pParent, const SfxItemSet* pAttr ) :\n SfxTabDialog ( pParent, ScResId( RID_SCDLG_PARAGRAPH ), pAttr ),\n rOutAttrs ( *pAttr )\n{\n FreeResource();\n\n SvtCJKOptions aCJKOptions;\n\n AddTabPage( RID_SVXPAGE_STD_PARAGRAPH );\/\/CHINA001 AddTabPage( RID_SVXPAGE_STD_PARAGRAPH, SvxStdParagraphTabPage::Create, 0);\n AddTabPage( RID_SVXPAGE_ALIGN_PARAGRAPH );\/\/CHINA001 AddTabPage( RID_SVXPAGE_ALIGN_PARAGRAPH, SvxParaAlignTabPage::Create, 0);\n \/\/AddTabPage( RID_SVXPAGE_EXT_PARAGRAPH, SvxExtParagraphTabPage::Create, 0);\n if ( aCJKOptions.IsAsianTypographyEnabled() )\n AddTabPage( RID_SVXPAGE_PARA_ASIAN);\/\/CHINA001 AddTabPage( RID_SVXPAGE_PARA_ASIAN, SvxAsianTabPage::Create,0);\n else\n RemoveTabPage( RID_SVXPAGE_PARA_ASIAN );\n AddTabPage( RID_SVXPAGE_TABULATOR );\/\/CHINA001 AddTabPage( RID_SVXPAGE_TABULATOR, SvxTabulatorTabPage::Create, 0);\n}\n\n\/\/ -----------------------------------------------------------------------\n\nvoid __EXPORT ScParagraphDlg::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n switch( nId )\n {\n case RID_SVXPAGE_TABULATOR:\n {\n \/\/CHINA001 ( (SvxTabulatorTabPage&) rPage ).\n \/\/CHINA001 DisableControls( TABTYPE_ALL &~TABTYPE_LEFT |\n \/\/CHINA001 TABFILL_ALL &~TABFILL_NONE );\n SfxAllItemSet aSet(*(GetInputSetImpl()->GetPool()));\/\/add CHINA001\n aSet.Put(SfxUInt16Item(SID_SVXTABULATORTABPAGE_CONTROLFLAGS,TABTYPE_ALL &~TABTYPE_LEFT |\n TABFILL_ALL &~TABFILL_NONE ));\n rPage.PageCreated(aSet);\/\/add CHINA001\n }\n break;\n }\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright IBM Corporation 2009, 2010.\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"vbafilesearch.hxx\"\n#include \"vbaapplication.hxx\"\n#include \"vbafoundfiles.hxx\"\n#include <comphelper\/processfactory.hxx>\n#include <tools\/urlobj.hxx>\n#include <tools\/wldcrd.hxx>\n#include <com\/sun\/star\/ucb\/XSimpleFileAccess3.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <vector>\n#include \"unotools\/viewoptions.hxx\"\n#include <osl\/file.hxx>\n\nusing namespace ::ooo::vba;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::lang;\nusing namespace comphelper;\n\nstatic Reference< XSimpleFileAccess3 > getFileAccess( void )\n{\n static Reference< XSimpleFileAccess3 > xSFI;\n if( !xSFI.is() )\n {\n Reference< XMultiServiceFactory > xSMgr = getProcessServiceFactory();\n if( xSMgr.is() )\n {\n xSFI = Reference< XSimpleFileAccess3 >( xSMgr->createInstance\n ( ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.ucb.SimpleFileAccess\" )) ), UNO_QUERY );\n }\n }\n return xSFI;\n}\n\nScVbaFileSearch::ScVbaFileSearch( ScVbaApplication* pApp, const css::uno::Reference< ov::XHelperInterface >& xParent, const css::uno::Reference< css::uno::XComponentContext >& xContext )\n : ScVbaFileSearchImpl_BASE( xParent, xContext ), m_pApplication( pApp )\n{\n NewSearch();\n}\n\nScVbaFileSearch::~ScVbaFileSearch()\n{\n}\n\n::rtl::OUString SAL_CALL ScVbaFileSearch::getFileName() throw (css::uno::RuntimeException)\n{\n return m_sFileName;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setFileName(const ::rtl::OUString& _fileName ) throw (css::uno::RuntimeException)\n{\n m_sFileName = _fileName;\n}\n\n::rtl::OUString SAL_CALL ScVbaFileSearch::getLookIn() throw (css::uno::RuntimeException)\n{\n return m_sLookIn;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setLookIn( const ::rtl::OUString& _lookIn ) throw (css::uno::RuntimeException)\n{\n m_sLookIn = _lookIn;\n}\n\nsal_Bool SAL_CALL ScVbaFileSearch::getSearchSubFolders() throw (css::uno::RuntimeException)\n{\n return m_bSearchSubFolders;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setSearchSubFolders( sal_Bool _searchSubFolders ) throw (css::uno::RuntimeException)\n{\n m_bSearchSubFolders = _searchSubFolders;\n}\n\nsal_Bool SAL_CALL ScVbaFileSearch::getMatchTextExactly() throw (css::uno::RuntimeException)\n{\n return m_bMatchTextExactly;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setMatchTextExactly( sal_Bool _matchTextExactly ) throw (css::uno::RuntimeException)\n{\n m_bMatchTextExactly = _matchTextExactly;\n}\n\nstatic bool IsWildCard( const ::rtl::OUString& fileName )\n{\n static sal_Char cWild1 = '*';\n static sal_Char cWild2 = '?';\n\n return ( ( fileName.indexOf( cWild1 ) >= 0 )\n || ( fileName.indexOf( cWild2 ) >= 0 ) );\n}\n\nstatic void SearchWildCard(const WildCard& wildCard, const ::rtl::OUString& aDir, bool bSearchSubFolders, css::uno::Sequence< rtl::OUString >& aSearchedFiles)\n{\n Reference< XSimpleFileAccess3 > xSFI = getFileAccess();\n Sequence< rtl::OUString > aDirSeq;\n try\n {\n if ( xSFI.is() )\n {\n aDirSeq = xSFI->getFolderContents( aDir, bSearchSubFolders );\n }\n }\n catch( css::uno::Exception& )\n {\n }\n sal_Int32 nLength = aDirSeq.getLength();\n for ( sal_Int32 i = 0; i < nLength; i++ )\n {\n rtl::OUString aURLStr = aDirSeq[i];\n if ( xSFI->isFolder( aURLStr ) )\n {\n if ( bSearchSubFolders )\n {\n SearchWildCard( wildCard, aURLStr, true, aSearchedFiles );\n }\n }\n else\n {\n INetURLObject aFileURL( aURLStr );\n rtl::OUString aFileName = aFileURL.GetLastName( INetURLObject::DECODE_UNAMBIGUOUS );\n if ( wildCard.Matches( aFileName.toAsciiLowerCase() ) )\n {\n sal_Int32 nFilesLength = aSearchedFiles.getLength();\n aSearchedFiles.realloc( nFilesLength + 1 );\n rtl::OUString sSystemPath;\n ::osl::File::getSystemPathFromFileURL( aURLStr, sSystemPath );\n aSearchedFiles[nFilesLength] = sSystemPath;\n }\n }\n }\n}\n\nsal_Int32 SAL_CALL ScVbaFileSearch::Execute( ) throw (css::uno::RuntimeException)\n{\n m_aSearchedFiles.realloc(0);\n Reference< XSimpleFileAccess3 > xSFI = getFileAccess();\n if ( !xSFI.is() || !xSFI->isFolder( m_sLookIn ) )\n {\n return 0;\n }\n\n if ( m_sFileName == ::rtl::OUString() )\n {\n return 1;\n }\n\n ::rtl::OUString aTempFileName = m_sFileName.toAsciiLowerCase();\n if ( IsWildCard( aTempFileName ) )\n {\n bool bEndWithAsterisk = aTempFileName.endsWithAsciiL(\"*\", 1);\n bool bStartWithAsterisk = (aTempFileName.indexOf(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"))) == 0);\n if ( !bEndWithAsterisk && !bStartWithAsterisk )\n {\n aTempFileName = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\")); + aTempFileName + ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"));\n }\n }\n else\n {\n aTempFileName = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\")); + aTempFileName + ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"));\n }\n WildCard wildCard( aTempFileName );\n SearchWildCard( wildCard, m_sLookIn, m_bSearchSubFolders, m_aSearchedFiles );\n\n return m_aSearchedFiles.getLength();\n}\n\n\/\/ set ScVbaApplication::getDefaultFilePath( ) as the InitPath for FileSearch\n ::rtl::OUString ScVbaFileSearch::getInitPath() throw (css::uno::RuntimeException)\n{\n String aPath;\n\n if (m_pApplication != NULL)\n {\n aPath = m_pApplication->getDefaultFilePath();\n }\n\n return aPath;\n}\n\nvoid SAL_CALL ScVbaFileSearch::NewSearch( ) throw (css::uno::RuntimeException)\n{\n m_sFileName = ::rtl::OUString();\n m_sLookIn = getInitPath();\n m_bSearchSubFolders = false;\n m_bMatchTextExactly = false;\n m_aSearchedFiles.realloc(0);\n}\n\nReference< XFoundFiles > SAL_CALL ScVbaFileSearch::getFoundFiles() throw (css::uno::RuntimeException)\n{\n css::uno::Reference< ov::XFoundFiles > xFoundFiles = new VbaFoundFiles(\n mxParent, mxContext, (css::container::XIndexAccess *) new VbaFoundFilesEnum(m_aSearchedFiles) );\n return xFoundFiles;\n}\n\nrtl::OUString& ScVbaFileSearch::getServiceImplName()\n{\n static rtl::OUString sImplName( RTL_CONSTASCII_USTRINGPARAM(\"VbaFileSearch\") );\n return sImplName;\n}\n\ncss::uno::Sequence< rtl::OUString > ScVbaFileSearch::getServiceNames()\n{\n static css::uno::Sequence< rtl::OUString > aServiceNames;\n if ( aServiceNames.getLength() == 0 )\n {\n aServiceNames.realloc( 1 );\n aServiceNames[ 0 ] = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\"ooo.vba.FileSearch\") );\n }\n return aServiceNames;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Revert part of cab7e33c which added ';' into the expression<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright IBM Corporation 2009, 2010.\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#include \"vbafilesearch.hxx\"\n#include \"vbaapplication.hxx\"\n#include \"vbafoundfiles.hxx\"\n#include <comphelper\/processfactory.hxx>\n#include <tools\/urlobj.hxx>\n#include <tools\/wldcrd.hxx>\n#include <com\/sun\/star\/ucb\/XSimpleFileAccess3.hpp>\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <vector>\n#include \"unotools\/viewoptions.hxx\"\n#include <osl\/file.hxx>\n\nusing namespace ::ooo::vba;\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::ucb;\nusing namespace ::com::sun::star::lang;\nusing namespace comphelper;\n\nstatic Reference< XSimpleFileAccess3 > getFileAccess( void )\n{\n static Reference< XSimpleFileAccess3 > xSFI;\n if( !xSFI.is() )\n {\n Reference< XMultiServiceFactory > xSMgr = getProcessServiceFactory();\n if( xSMgr.is() )\n {\n xSFI = Reference< XSimpleFileAccess3 >( xSMgr->createInstance\n ( ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM( \"com.sun.star.ucb.SimpleFileAccess\" )) ), UNO_QUERY );\n }\n }\n return xSFI;\n}\n\nScVbaFileSearch::ScVbaFileSearch( ScVbaApplication* pApp, const css::uno::Reference< ov::XHelperInterface >& xParent, const css::uno::Reference< css::uno::XComponentContext >& xContext )\n : ScVbaFileSearchImpl_BASE( xParent, xContext ), m_pApplication( pApp )\n{\n NewSearch();\n}\n\nScVbaFileSearch::~ScVbaFileSearch()\n{\n}\n\n::rtl::OUString SAL_CALL ScVbaFileSearch::getFileName() throw (css::uno::RuntimeException)\n{\n return m_sFileName;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setFileName(const ::rtl::OUString& _fileName ) throw (css::uno::RuntimeException)\n{\n m_sFileName = _fileName;\n}\n\n::rtl::OUString SAL_CALL ScVbaFileSearch::getLookIn() throw (css::uno::RuntimeException)\n{\n return m_sLookIn;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setLookIn( const ::rtl::OUString& _lookIn ) throw (css::uno::RuntimeException)\n{\n m_sLookIn = _lookIn;\n}\n\nsal_Bool SAL_CALL ScVbaFileSearch::getSearchSubFolders() throw (css::uno::RuntimeException)\n{\n return m_bSearchSubFolders;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setSearchSubFolders( sal_Bool _searchSubFolders ) throw (css::uno::RuntimeException)\n{\n m_bSearchSubFolders = _searchSubFolders;\n}\n\nsal_Bool SAL_CALL ScVbaFileSearch::getMatchTextExactly() throw (css::uno::RuntimeException)\n{\n return m_bMatchTextExactly;\n}\n\nvoid SAL_CALL ScVbaFileSearch::setMatchTextExactly( sal_Bool _matchTextExactly ) throw (css::uno::RuntimeException)\n{\n m_bMatchTextExactly = _matchTextExactly;\n}\n\nstatic bool IsWildCard( const ::rtl::OUString& fileName )\n{\n static sal_Char cWild1 = '*';\n static sal_Char cWild2 = '?';\n\n return ( ( fileName.indexOf( cWild1 ) >= 0 )\n || ( fileName.indexOf( cWild2 ) >= 0 ) );\n}\n\nstatic void SearchWildCard(const WildCard& wildCard, const ::rtl::OUString& aDir, bool bSearchSubFolders, css::uno::Sequence< rtl::OUString >& aSearchedFiles)\n{\n Reference< XSimpleFileAccess3 > xSFI = getFileAccess();\n Sequence< rtl::OUString > aDirSeq;\n try\n {\n if ( xSFI.is() )\n {\n aDirSeq = xSFI->getFolderContents( aDir, bSearchSubFolders );\n }\n }\n catch( css::uno::Exception& )\n {\n }\n sal_Int32 nLength = aDirSeq.getLength();\n for ( sal_Int32 i = 0; i < nLength; i++ )\n {\n rtl::OUString aURLStr = aDirSeq[i];\n if ( xSFI->isFolder( aURLStr ) )\n {\n if ( bSearchSubFolders )\n {\n SearchWildCard( wildCard, aURLStr, true, aSearchedFiles );\n }\n }\n else\n {\n INetURLObject aFileURL( aURLStr );\n rtl::OUString aFileName = aFileURL.GetLastName( INetURLObject::DECODE_UNAMBIGUOUS );\n if ( wildCard.Matches( aFileName.toAsciiLowerCase() ) )\n {\n sal_Int32 nFilesLength = aSearchedFiles.getLength();\n aSearchedFiles.realloc( nFilesLength + 1 );\n rtl::OUString sSystemPath;\n ::osl::File::getSystemPathFromFileURL( aURLStr, sSystemPath );\n aSearchedFiles[nFilesLength] = sSystemPath;\n }\n }\n }\n}\n\nsal_Int32 SAL_CALL ScVbaFileSearch::Execute( ) throw (css::uno::RuntimeException)\n{\n m_aSearchedFiles.realloc(0);\n Reference< XSimpleFileAccess3 > xSFI = getFileAccess();\n if ( !xSFI.is() || !xSFI->isFolder( m_sLookIn ) )\n {\n return 0;\n }\n\n if ( m_sFileName == ::rtl::OUString() )\n {\n return 1;\n }\n\n ::rtl::OUString aTempFileName = m_sFileName.toAsciiLowerCase();\n if ( IsWildCard( aTempFileName ) )\n {\n bool bEndWithAsterisk = aTempFileName.endsWithAsciiL(\"*\", 1);\n bool bStartWithAsterisk = (aTempFileName.indexOf(::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"))) == 0);\n if ( !bEndWithAsterisk && !bStartWithAsterisk )\n {\n aTempFileName = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\")) + aTempFileName + ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"));\n }\n }\n else\n {\n aTempFileName = ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\")) + aTempFileName + ::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"*\"));\n }\n WildCard wildCard( aTempFileName );\n SearchWildCard( wildCard, m_sLookIn, m_bSearchSubFolders, m_aSearchedFiles );\n\n return m_aSearchedFiles.getLength();\n}\n\n\/\/ set ScVbaApplication::getDefaultFilePath( ) as the InitPath for FileSearch\n ::rtl::OUString ScVbaFileSearch::getInitPath() throw (css::uno::RuntimeException)\n{\n String aPath;\n\n if (m_pApplication != NULL)\n {\n aPath = m_pApplication->getDefaultFilePath();\n }\n\n return aPath;\n}\n\nvoid SAL_CALL ScVbaFileSearch::NewSearch( ) throw (css::uno::RuntimeException)\n{\n m_sFileName = ::rtl::OUString();\n m_sLookIn = getInitPath();\n m_bSearchSubFolders = false;\n m_bMatchTextExactly = false;\n m_aSearchedFiles.realloc(0);\n}\n\nReference< XFoundFiles > SAL_CALL ScVbaFileSearch::getFoundFiles() throw (css::uno::RuntimeException)\n{\n css::uno::Reference< ov::XFoundFiles > xFoundFiles = new VbaFoundFiles(\n mxParent, mxContext, (css::container::XIndexAccess *) new VbaFoundFilesEnum(m_aSearchedFiles) );\n return xFoundFiles;\n}\n\nrtl::OUString& ScVbaFileSearch::getServiceImplName()\n{\n static rtl::OUString sImplName( RTL_CONSTASCII_USTRINGPARAM(\"VbaFileSearch\") );\n return sImplName;\n}\n\ncss::uno::Sequence< rtl::OUString > ScVbaFileSearch::getServiceNames()\n{\n static css::uno::Sequence< rtl::OUString > aServiceNames;\n if ( aServiceNames.getLength() == 0 )\n {\n aServiceNames.realloc( 1 );\n aServiceNames[ 0 ] = rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(\"ooo.vba.FileSearch\") );\n }\n return aServiceNames;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include <cucumber-cpp\/internal\/connectors\/wire\/WireProtocol.hpp>\n#include <cucumber-cpp\/internal\/connectors\/wire\/WireProtocolCommands.hpp>\n\n#include <gmock\/gmock.h>\n#include <boost\/assign\/list_of.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include <typeinfo>\n\nusing namespace cucumber::internal;\nusing namespace std;\nusing namespace testing;\n\nusing boost::assign::list_of;\n\nclass MockCukeEngine : public CukeEngine {\npublic:\n MOCK_CONST_METHOD1(stepMatches, std::vector<StepMatch>(const std::string & name));\n MOCK_METHOD1(endScenario, void(const tags_type & tags));\n MOCK_METHOD3(invokeStep, void(const std::string & id, const invoke_args_type & args, const invoke_table_type & tableArg));\n MOCK_METHOD1(beginScenario, void(const tags_type & tags));\n MOCK_CONST_METHOD3(snippetText, std::string(const std::string & keyword, const std::string & name, const std::string & multilineArgClass));\n};\n\n#define EXPECT_TYPE(classname, expression) \\\n EXPECT_THAT(typeid(classname).name(), StrEq(typeid(expression).name()))\n\n#define EXPECT_PTRTYPE(classname, expression) \\\n EXPECT_TYPE(classname, *expression)\n\n\n\nclass WireMessageCodecTest : public Test {\npublic:\n WireMessageCodecTest() {};\n\nprotected:\n boost::shared_ptr<WireCommand> commandAutoPtr;\n\n WireCommand& decode(const char *jsonStr) {\n commandAutoPtr = codec.decode(jsonStr);\n return *commandAutoPtr;\n }\n\n std::string encode(const WireResponse& response) const {\n return codec.encode(response);\n }\n\nprotected:\n const JsonSpiritWireMessageCodec codec;\n};\n\n\n\/*\n * Request decoding\n *\/\n\nTEST_F(WireMessageCodecTest, decodesUnknownOrMalformedMessage) {\n MockCukeEngine engine;\n\n EXPECT_EQ(encode(*decode(\"[\\\"unknown_command\\\"]\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"rubbish\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"{\\\"malformed_command\\\"}\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"[42]\").run(engine)), \"[\\\"fail\\\"]\");\n}\n\nTEST_F(WireMessageCodecTest, handlesStepMatchesMessage) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, stepMatches(\"name to match\"))\n .Times(1)\n .WillRepeatedly(Return(std::vector<StepMatch>(0)));\n\n decode(\"[\\\"step_matches\\\",\"\n \"{\\\"name_to_match\\\":\\\"name to match\\\"}]\")\n .run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithoutArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"begin_scenario\\\"]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithTagsArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre(\"bar\",\"baz\",\"foo\"))).Times(1);\n\n decode(\"[\\\"begin_scenario\\\",\"\n \"{\\\"tags\\\":[\"\n \"\\\"bar\\\",\"\n \"\\\"baz\\\",\"\n \"\\\"foo\\\"\"\n \"]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithNullArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"begin_scenario\\\",null]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithNoArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\\\"id\\\":\\\"42\\\",\\\"args\\\":[]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithoutTableArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(\"p1\",\"p2\",\"p3\"), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\"\n \"\\\"id\\\":\\\"42\\\",\"\n \"\\\"args\\\":[\"\n \"\\\"p1\\\",\"\n \"\\\"p2\\\",\"\n \"\\\"p3\\\"\"\n \"}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithTableArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\n \"42\",\n ElementsAre(\"p1\"),\n ElementsAre(\n ElementsAre(\"col1\",\"col2\"),\n ElementsAre(\"r1c1\",\"r1c2\"),\n ElementsAre(\"r2c1\",\"r2c2\"),\n ElementsAre(\"r3c1\",\"r3c2\")\n )\n )).Times(1);\n\n decode(\"[\\\"invoke\\\",{\"\n \"\\\"id\\\":\\\"42\\\",\"\n \"\\\"args\\\":[\"\n \"\\\"p1\\\",\"\n \"[\"\n \"[\\\"col1\\\",\\\"col2\\\"],\"\n \"[\\\"r1c1\\\",\\\"r1c2\\\"],\"\n \"[\\\"r2c1\\\",\\\"r2c2\\\"],\"\n \"[\\\"r3c1\\\",\\\"r3c2\\\"]\"\n \"]\"\n \"}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithNullArg) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\\\"id\\\":\\\"42\\\",\\\"args\\\":[null]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithoutArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"end_scenario\\\"]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithNullArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"end_scenario\\\",null]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithTagsArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre(\"cu\",\"cum\",\"ber\"))).Times(1);\n\n decode(\"[\\\"end_scenario\\\",\"\n \"{\\\"tags\\\":[\"\n \"\\\"cu\\\",\"\n \"\\\"cum\\\",\"\n \"\\\"ber\\\"\"\n \"]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesSnippetTextMessage) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, snippetText(\"Keyword\", \"step description\",\"Some::Class\")).Times(1);\n\n decode(\"[\\\"snippet_text\\\",\"\n \"{\\\"step_keyword\\\":\\\"Keyword\\\",\"\n \"\\\"multiline_arg_class\\\":\\\"Some::Class\\\",\"\n \"\\\"step_name\\\":\\\"step description\\\"}]\")\n .run(engine);\n}\n\n\/*\n * Response encoding\n *\/\n\nTEST_F(WireMessageCodecTest, handlesSuccessResponse) {\n SuccessResponse response;\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesSimpleFailureResponse) {\n FailureResponse response;\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"fail\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesDetailedFailureResponse) {\n FailureResponse response(\"My message\",\"ExceptionClassName\");\n EXPECT_THAT(codec.encode(response), StrEq(\n \"[\\\"fail\\\",{\"\n \"\\\"exception\\\":\\\"ExceptionClassName\\\",\"\n \"\\\"message\\\":\\\"My message\\\"\"\n \"}]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesPendingResponse) {\n PendingResponse response(\"I'm lazy!\");\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"pending\\\",\\\"I'm lazy!\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesEmptyStepMatchesResponse) {\n StepMatchesResponse response(std::vector<StepMatch>(0));\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\",[]]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesStepMatchesResponse) {\n std::vector<StepMatch> matches;\n StepMatch sm1;\n sm1.id = \"1234\";\n sm1.source = \"MyClass.cpp:56\";\n sm1.regexp = \"Some (.*) regexp\";\n matches.push_back(sm1);\n StepMatch sm2;\n sm2.id = \"9876\";\n StepMatchArg sm2arg1;\n sm2arg1.value = \"odd\";\n sm2arg1.position = 5;\n sm2.args.push_back(sm2arg1);\n matches.push_back(sm2);\n StepMatchesResponse response(matches);\n\n EXPECT_THAT(codec.encode(response), StrEq(\n \"[\\\"success\\\",[{\"\n \"\\\"args\\\":[],\"\n \"\\\"id\\\":\\\"1234\\\",\"\n \"\\\"regexp\\\":\\\"Some (.*) regexp\\\",\"\n \"\\\"source\\\":\\\"MyClass.cpp:56\\\"\"\n \"},{\"\n \"\\\"args\\\":[{\"\n \"\\\"pos\\\":5,\"\n \"\\\"val\\\":\\\"odd\\\"\"\n \"}],\"\n \"\\\"id\\\":\\\"9876\\\"\"\n \"}]]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesSnippetTextResponse) {\n SnippetTextResponse response(\"GIVEN(...)\");\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\",\\\"GIVEN(...)\\\"]\"));\n}\n\n\/*\n * Command response\n *\/\n\nTEST(WireCommandsTest, succesfulInvokeReturnsSuccess) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1);\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(SuccessResponse, response.get());\n}\n\nTEST(WireCommandsTest, throwingFailureInvokeReturnsFailure) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(InvokeFailureException(\"A\", \"B\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(FailureResponse, response.get());\n \/\/ TODO Test A and B\n}\n\nTEST(WireCommandsTest, throwingPendingStepReturnsPending) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(PendingStepException(\"S\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(PendingResponse, response.get());\n \/\/ TODO Test S\n}\n\nTEST(WireCommandsTest, throwingAnythingInvokeReturnsFailure) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(string(\"something\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(FailureResponse, response.get());\n \/\/ TODO Test empty\n}\n\n\n\n\n\n\n<commit_msg>get rid of clang warning<commit_after>#include <cucumber-cpp\/internal\/connectors\/wire\/WireProtocol.hpp>\n#include <cucumber-cpp\/internal\/connectors\/wire\/WireProtocolCommands.hpp>\n\n#include <gmock\/gmock.h>\n#include <boost\/assign\/list_of.hpp>\n#include <boost\/shared_ptr.hpp>\n\n#include <typeinfo>\n\nusing namespace cucumber::internal;\nusing namespace std;\nusing namespace testing;\n\nusing boost::assign::list_of;\n\nclass MockCukeEngine : public CukeEngine {\npublic:\n MOCK_CONST_METHOD1(stepMatches, std::vector<StepMatch>(const std::string & name));\n MOCK_METHOD1(endScenario, void(const tags_type & tags));\n MOCK_METHOD3(invokeStep, void(const std::string & id, const invoke_args_type & args, const invoke_table_type & tableArg));\n MOCK_METHOD1(beginScenario, void(const tags_type & tags));\n MOCK_CONST_METHOD3(snippetText, std::string(const std::string & keyword, const std::string & name, const std::string & multilineArgClass));\n};\n\n#define EXPECT_PTRTYPE(classname, expression) \\\n EXPECT_NE(dynamic_cast<const classname*>(expression), (void*)NULL)\n\nclass WireMessageCodecTest : public Test {\npublic:\n WireMessageCodecTest() {};\n\nprotected:\n boost::shared_ptr<WireCommand> commandAutoPtr;\n\n WireCommand& decode(const char *jsonStr) {\n commandAutoPtr = codec.decode(jsonStr);\n return *commandAutoPtr;\n }\n\n std::string encode(const WireResponse& response) const {\n return codec.encode(response);\n }\n\nprotected:\n const JsonSpiritWireMessageCodec codec;\n};\n\n\n\/*\n * Request decoding\n *\/\n\nTEST_F(WireMessageCodecTest, decodesUnknownOrMalformedMessage) {\n MockCukeEngine engine;\n\n EXPECT_EQ(encode(*decode(\"[\\\"unknown_command\\\"]\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"rubbish\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"{\\\"malformed_command\\\"}\").run(engine)), \"[\\\"fail\\\"]\");\n EXPECT_EQ(encode(*decode(\"[42]\").run(engine)), \"[\\\"fail\\\"]\");\n}\n\nTEST_F(WireMessageCodecTest, handlesStepMatchesMessage) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, stepMatches(\"name to match\"))\n .Times(1)\n .WillRepeatedly(Return(std::vector<StepMatch>(0)));\n\n decode(\"[\\\"step_matches\\\",\"\n \"{\\\"name_to_match\\\":\\\"name to match\\\"}]\")\n .run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithoutArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"begin_scenario\\\"]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithTagsArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre(\"bar\",\"baz\",\"foo\"))).Times(1);\n\n decode(\"[\\\"begin_scenario\\\",\"\n \"{\\\"tags\\\":[\"\n \"\\\"bar\\\",\"\n \"\\\"baz\\\",\"\n \"\\\"foo\\\"\"\n \"]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesBeginScenarioMessageWithNullArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, beginScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"begin_scenario\\\",null]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithNoArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\\\"id\\\":\\\"42\\\",\\\"args\\\":[]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithoutTableArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(\"p1\",\"p2\",\"p3\"), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\"\n \"\\\"id\\\":\\\"42\\\",\"\n \"\\\"args\\\":[\"\n \"\\\"p1\\\",\"\n \"\\\"p2\\\",\"\n \"\\\"p3\\\"\"\n \"}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithTableArgs) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\n \"42\",\n ElementsAre(\"p1\"),\n ElementsAre(\n ElementsAre(\"col1\",\"col2\"),\n ElementsAre(\"r1c1\",\"r1c2\"),\n ElementsAre(\"r2c1\",\"r2c2\"),\n ElementsAre(\"r3c1\",\"r3c2\")\n )\n )).Times(1);\n\n decode(\"[\\\"invoke\\\",{\"\n \"\\\"id\\\":\\\"42\\\",\"\n \"\\\"args\\\":[\"\n \"\\\"p1\\\",\"\n \"[\"\n \"[\\\"col1\\\",\\\"col2\\\"],\"\n \"[\\\"r1c1\\\",\\\"r1c2\\\"],\"\n \"[\\\"r2c1\\\",\\\"r2c2\\\"],\"\n \"[\\\"r3c1\\\",\\\"r3c2\\\"]\"\n \"]\"\n \"}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesInvokeMessageWithNullArg) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, invokeStep(\"42\", ElementsAre(), ElementsAre())).Times(1);\n\n decode(\"[\\\"invoke\\\",{\\\"id\\\":\\\"42\\\",\\\"args\\\":[null]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithoutArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"end_scenario\\\"]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithNullArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre())).Times(1);\n\n decode(\"[\\\"end_scenario\\\",null]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesEndScenarioMessageWithTagsArgument) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, endScenario(ElementsAre(\"cu\",\"cum\",\"ber\"))).Times(1);\n\n decode(\"[\\\"end_scenario\\\",\"\n \"{\\\"tags\\\":[\"\n \"\\\"cu\\\",\"\n \"\\\"cum\\\",\"\n \"\\\"ber\\\"\"\n \"]}]\").run(engine);\n}\n\nTEST_F(WireMessageCodecTest, handlesSnippetTextMessage) {\n MockCukeEngine engine;\n EXPECT_CALL(engine, snippetText(\"Keyword\", \"step description\",\"Some::Class\")).Times(1);\n\n decode(\"[\\\"snippet_text\\\",\"\n \"{\\\"step_keyword\\\":\\\"Keyword\\\",\"\n \"\\\"multiline_arg_class\\\":\\\"Some::Class\\\",\"\n \"\\\"step_name\\\":\\\"step description\\\"}]\")\n .run(engine);\n}\n\n\/*\n * Response encoding\n *\/\n\nTEST_F(WireMessageCodecTest, handlesSuccessResponse) {\n SuccessResponse response;\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesSimpleFailureResponse) {\n FailureResponse response;\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"fail\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesDetailedFailureResponse) {\n FailureResponse response(\"My message\",\"ExceptionClassName\");\n EXPECT_THAT(codec.encode(response), StrEq(\n \"[\\\"fail\\\",{\"\n \"\\\"exception\\\":\\\"ExceptionClassName\\\",\"\n \"\\\"message\\\":\\\"My message\\\"\"\n \"}]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesPendingResponse) {\n PendingResponse response(\"I'm lazy!\");\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"pending\\\",\\\"I'm lazy!\\\"]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesEmptyStepMatchesResponse) {\n StepMatchesResponse response(std::vector<StepMatch>(0));\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\",[]]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesStepMatchesResponse) {\n std::vector<StepMatch> matches;\n StepMatch sm1;\n sm1.id = \"1234\";\n sm1.source = \"MyClass.cpp:56\";\n sm1.regexp = \"Some (.*) regexp\";\n matches.push_back(sm1);\n StepMatch sm2;\n sm2.id = \"9876\";\n StepMatchArg sm2arg1;\n sm2arg1.value = \"odd\";\n sm2arg1.position = 5;\n sm2.args.push_back(sm2arg1);\n matches.push_back(sm2);\n StepMatchesResponse response(matches);\n\n EXPECT_THAT(codec.encode(response), StrEq(\n \"[\\\"success\\\",[{\"\n \"\\\"args\\\":[],\"\n \"\\\"id\\\":\\\"1234\\\",\"\n \"\\\"regexp\\\":\\\"Some (.*) regexp\\\",\"\n \"\\\"source\\\":\\\"MyClass.cpp:56\\\"\"\n \"},{\"\n \"\\\"args\\\":[{\"\n \"\\\"pos\\\":5,\"\n \"\\\"val\\\":\\\"odd\\\"\"\n \"}],\"\n \"\\\"id\\\":\\\"9876\\\"\"\n \"}]]\"));\n}\n\nTEST_F(WireMessageCodecTest, handlesSnippetTextResponse) {\n SnippetTextResponse response(\"GIVEN(...)\");\n EXPECT_THAT(codec.encode(response), StrEq(\"[\\\"success\\\",\\\"GIVEN(...)\\\"]\"));\n}\n\n\/*\n * Command response\n *\/\n\nTEST(WireCommandsTest, succesfulInvokeReturnsSuccess) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1);\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(SuccessResponse, response.get());\n}\n\nTEST(WireCommandsTest, throwingFailureInvokeReturnsFailure) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(InvokeFailureException(\"A\", \"B\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(FailureResponse, response.get());\n \/\/ TODO Test A and B\n}\n\nTEST(WireCommandsTest, throwingPendingStepReturnsPending) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(PendingStepException(\"S\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(PendingResponse, response.get());\n \/\/ TODO Test S\n}\n\nTEST(WireCommandsTest, throwingAnythingInvokeReturnsFailure) {\n MockCukeEngine engine;\n InvokeCommand invokeCommand(\"x\", CukeEngine::invoke_args_type(), CukeEngine::invoke_table_type());\n EXPECT_CALL(engine, invokeStep(_, _, _))\n .Times(1)\n .WillOnce(Throw(string(\"something\")));\n\n boost::shared_ptr<const WireResponse> response(invokeCommand.run(engine));\n EXPECT_PTRTYPE(FailureResponse, response.get());\n \/\/ TODO Test empty\n}\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2003-2016 Rony Shapiro <ronys@pwsafe.org>.\n* All rights reserved. Use of the code is allowed under the\n* Artistic License 2.0 terms, as specified in the LICENSE file\n* distributed with this code, or available from\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\n*\/\n\n\/*\n * macsendstring - sends keyboard events to the app in focus\n *\n *\/\n#include \".\/macsendstring.h\"\n\n#include <ApplicationServices\/ApplicationServices.h> \/\/ OSX-only header\n#include <Carbon\/Carbon.h>\n#include \"..\/sleep.h\"\n#include \"..\/..\/core\/PwsPlatform.h\"\n#include \"..\/debug.h\"\n\nvoid SendString(CFStringRef str, unsigned delayMS)\n{\n \/\/virtual keycodes copied from 10.6 SDK. Could not find them in 10.4 SDK\n enum { VK_RETURN = 0x24 \/*KVK_Return*\/, VK_TAB = 0x30 \/*kVK_Tab*\/, VK_SPACE = 0x31\/*kVK_Space*\/};\n \n \/\/A list of chars for which we must specify the virtual keycode\n static const CFStringRef specialChars = CFSTR(\"\\n\\t \");\n \n static const UniChar verticalTab = CFStringGetCharacterAtIndex(CFSTR(\"\\v\"), 0);\n\n \/\/each keycode must correspond to the correct char in 'specialChars'\n CGKeyCode specialKeyCodes[] = {VK_RETURN, VK_TAB, VK_SPACE };\n \n assert(CFStringGetLength(specialChars) == NumberOf(specialKeyCodes));\n\n for (unsigned i = 0, len = CFStringGetLength(str); i < len; ++i) {\n \/\/The next char to send\n UniChar c = CFStringGetCharacterAtIndex(str, i);\n \n \/\/throw away 'vertical tab' chars which are only used on Windows to send a shift+tab\n \/\/as a workaround for some issues with IE \n if (verticalTab == c)\n continue;\n \n \/\/see if we need to specify the virtual ekycode for this char\n CGKeyCode vKey = 0; \/\/0 = kVK_ANSI_A, but I don't know of a more appropriate default value\n for (size_t j = 0; j < NumberOf(specialKeyCodes); ++j) {\n if ( CFStringGetCharacterAtIndex(specialChars, j) == c) {\n vKey = specialKeyCodes[j];\n break;\n }\n }\n \n CGEventRef keyDown = CGEventCreateKeyboardEvent(NULL, vKey, true);\n CGEventRef keyUp = CGEventCreateKeyboardEvent(NULL, vKey, false);\n \n if (keyDown && keyUp) {\n \/\/may be we should not do this if we found the virtual keycode?\n CGEventKeyboardSetUnicodeString(keyDown, 1, &c);\n CGEventKeyboardSetUnicodeString(keyUp, 1, &c);\n \n CGEventPost(kCGSessionEventTap, keyDown);\n CGEventPost(kCGSessionEventTap, keyUp);\n \n pws_os::sleep_ms(delayMS);\n \n CFRelease(keyDown);\n CFRelease(keyUp);\n }\n else {\n if (keyDown) CFRelease(keyDown);\n if (keyUp) CFRelease(keyUp);\n pws_os::IssueError(_T(\"Out of memory trying to allocate CGEventRef\"));\n return;\n }\n }\n}\n\nvoid pws_os::SendString(const char* str, unsigned delayMS)\n{\n \/\/GetApplicationTextEncoding call here certainly seems wrong. We should store the keyboard layout\n \/\/and string encoding in password db. But this works for now.\n CFStringRef cfstr = CFStringCreateWithCString(kCFAllocatorDefault, str, GetApplicationTextEncoding());\n SendString(cfstr, delayMS);\n CFRelease(cfstr);\n}\n\nstruct KeyStroke {\n CGKeyCode virtualKey;\n bool down;\n bool mask;\n};\n\nbool EmulateKeyStrokes(const KeyStroke *KeySequence, size_t num, unsigned delayMS)\n{\n for (size_t idx = 0; idx < num; ++idx) {\n CGEventRef keystroke = CGEventCreateKeyboardEvent(NULL, KeySequence[idx].virtualKey, KeySequence[idx].down);\n if (keystroke) {\n if (KeySequence[idx].mask) {\n CGEventSetFlags(keystroke, kCGEventFlagMaskCommand);\n }\n CGEventPost(kCGSessionEventTap, keystroke);\n CFRelease(keystroke);\n if (delayMS)\n pws_os::sleep_ms(delayMS);\n }\n else {\n return false;\n }\n }\n return true;\n}\n\nbool pws_os::MacSimulateApplicationSwitch(unsigned delayMS)\n{\n enum { VK_CMD = 55, VK_TAB = 48 };\n\n KeyStroke KeySequence[] = { {VK_CMD, true, true},\n {VK_TAB, true, true},\n {VK_TAB, false, true},\n {VK_CMD, false, false}\n };\n\n\n return EmulateKeyStrokes(KeySequence, NumberOf(KeySequence), delayMS);\n}\n\nbool pws_os::SelectAll()\n{\n enum { VK_A = kVK_ANSI_A, VK_CMD = kVK_Command };\n\n KeyStroke KeySequence[]={ {VK_CMD, true, true},\n {VK_A, true, true},\n {VK_A, false, true},\n {VK_CMD, false, false}\n };\n\n return EmulateKeyStrokes(KeySequence, NumberOf(KeySequence), 0);\n}\n\n#if 0\nint main (int argc, const char * argv[])\n{\n for (int i = 1; i < argc; ++i)\n {\n printf(\"Sending \\\"%s\\\", switch to another application in 5 seconds...\\n\", argv[i]);\n sleep(5);\n SendString(argv[i], 5000);\n }\n return 0;\n}\n\n#endif\n<commit_msg>spelling: keycode<commit_after>\/*\n* Copyright (c) 2003-2016 Rony Shapiro <ronys@pwsafe.org>.\n* All rights reserved. Use of the code is allowed under the\n* Artistic License 2.0 terms, as specified in the LICENSE file\n* distributed with this code, or available from\n* http:\/\/www.opensource.org\/licenses\/artistic-license-2.0.php\n*\/\n\n\/*\n * macsendstring - sends keyboard events to the app in focus\n *\n *\/\n#include \".\/macsendstring.h\"\n\n#include <ApplicationServices\/ApplicationServices.h> \/\/ OSX-only header\n#include <Carbon\/Carbon.h>\n#include \"..\/sleep.h\"\n#include \"..\/..\/core\/PwsPlatform.h\"\n#include \"..\/debug.h\"\n\nvoid SendString(CFStringRef str, unsigned delayMS)\n{\n \/\/virtual keycodes copied from 10.6 SDK. Could not find them in 10.4 SDK\n enum { VK_RETURN = 0x24 \/*KVK_Return*\/, VK_TAB = 0x30 \/*kVK_Tab*\/, VK_SPACE = 0x31\/*kVK_Space*\/};\n \n \/\/A list of chars for which we must specify the virtual keycode\n static const CFStringRef specialChars = CFSTR(\"\\n\\t \");\n \n static const UniChar verticalTab = CFStringGetCharacterAtIndex(CFSTR(\"\\v\"), 0);\n\n \/\/each keycode must correspond to the correct char in 'specialChars'\n CGKeyCode specialKeyCodes[] = {VK_RETURN, VK_TAB, VK_SPACE };\n \n assert(CFStringGetLength(specialChars) == NumberOf(specialKeyCodes));\n\n for (unsigned i = 0, len = CFStringGetLength(str); i < len; ++i) {\n \/\/The next char to send\n UniChar c = CFStringGetCharacterAtIndex(str, i);\n \n \/\/throw away 'vertical tab' chars which are only used on Windows to send a shift+tab\n \/\/as a workaround for some issues with IE \n if (verticalTab == c)\n continue;\n \n \/\/see if we need to specify the virtual keycode for this char\n CGKeyCode vKey = 0; \/\/0 = kVK_ANSI_A, but I don't know of a more appropriate default value\n for (size_t j = 0; j < NumberOf(specialKeyCodes); ++j) {\n if ( CFStringGetCharacterAtIndex(specialChars, j) == c) {\n vKey = specialKeyCodes[j];\n break;\n }\n }\n \n CGEventRef keyDown = CGEventCreateKeyboardEvent(NULL, vKey, true);\n CGEventRef keyUp = CGEventCreateKeyboardEvent(NULL, vKey, false);\n \n if (keyDown && keyUp) {\n \/\/may be we should not do this if we found the virtual keycode?\n CGEventKeyboardSetUnicodeString(keyDown, 1, &c);\n CGEventKeyboardSetUnicodeString(keyUp, 1, &c);\n \n CGEventPost(kCGSessionEventTap, keyDown);\n CGEventPost(kCGSessionEventTap, keyUp);\n \n pws_os::sleep_ms(delayMS);\n \n CFRelease(keyDown);\n CFRelease(keyUp);\n }\n else {\n if (keyDown) CFRelease(keyDown);\n if (keyUp) CFRelease(keyUp);\n pws_os::IssueError(_T(\"Out of memory trying to allocate CGEventRef\"));\n return;\n }\n }\n}\n\nvoid pws_os::SendString(const char* str, unsigned delayMS)\n{\n \/\/GetApplicationTextEncoding call here certainly seems wrong. We should store the keyboard layout\n \/\/and string encoding in password db. But this works for now.\n CFStringRef cfstr = CFStringCreateWithCString(kCFAllocatorDefault, str, GetApplicationTextEncoding());\n SendString(cfstr, delayMS);\n CFRelease(cfstr);\n}\n\nstruct KeyStroke {\n CGKeyCode virtualKey;\n bool down;\n bool mask;\n};\n\nbool EmulateKeyStrokes(const KeyStroke *KeySequence, size_t num, unsigned delayMS)\n{\n for (size_t idx = 0; idx < num; ++idx) {\n CGEventRef keystroke = CGEventCreateKeyboardEvent(NULL, KeySequence[idx].virtualKey, KeySequence[idx].down);\n if (keystroke) {\n if (KeySequence[idx].mask) {\n CGEventSetFlags(keystroke, kCGEventFlagMaskCommand);\n }\n CGEventPost(kCGSessionEventTap, keystroke);\n CFRelease(keystroke);\n if (delayMS)\n pws_os::sleep_ms(delayMS);\n }\n else {\n return false;\n }\n }\n return true;\n}\n\nbool pws_os::MacSimulateApplicationSwitch(unsigned delayMS)\n{\n enum { VK_CMD = 55, VK_TAB = 48 };\n\n KeyStroke KeySequence[] = { {VK_CMD, true, true},\n {VK_TAB, true, true},\n {VK_TAB, false, true},\n {VK_CMD, false, false}\n };\n\n\n return EmulateKeyStrokes(KeySequence, NumberOf(KeySequence), delayMS);\n}\n\nbool pws_os::SelectAll()\n{\n enum { VK_A = kVK_ANSI_A, VK_CMD = kVK_Command };\n\n KeyStroke KeySequence[]={ {VK_CMD, true, true},\n {VK_A, true, true},\n {VK_A, false, true},\n {VK_CMD, false, false}\n };\n\n return EmulateKeyStrokes(KeySequence, NumberOf(KeySequence), 0);\n}\n\n#if 0\nint main (int argc, const char * argv[])\n{\n for (int i = 1; i < argc; ++i)\n {\n printf(\"Sending \\\"%s\\\", switch to another application in 5 seconds...\\n\", argv[i]);\n sleep(5);\n SendString(argv[i], 5000);\n }\n return 0;\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"osg\/Depth\"\n\n#include \"osgDB\/Registry\"\n#include \"osgDB\/Input\"\n#include \"osgDB\/Output\"\n\nusing namespace osg;\nusing namespace osgDB;\n\n\/\/ forward declare functions to use later.\nbool Depth_readLocalData(Object& obj, Input& fr);\nbool Depth_writeLocalData(const Object& obj, Output& fw);\n\nbool Depth_matchFuncStr(const char* str,Depth::Function& func);\nconst char* Depth_getFuncStr(Depth::Function func);\n\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_DepthProxy\n(\n new osg::Depth,\n \"Depth\",\n \"Object StateAttribute Depth\",\n &Depth_readLocalData,\n &Depth_writeLocalData\n);\n\n\nbool Depth_readLocalData(Object& obj, Input& fr)\n{\n bool iteratorAdvanced = false;\n\n Depth& depth = static_cast<Depth&>(obj);\n \n Depth::Function func;\n if (fr[0].matchWord(\"function\") && Depth_matchFuncStr(fr[1].getStr(),func))\n {\n depth.setFunction(func);\n fr+=2;\n iteratorAdvanced = true;\n }\n\n if (fr[0].matchWord(\"writeMask\"))\n {\n if (fr[1].matchWord(\"TRUE\") || fr[1].matchWord(\"ON\"))\n {\n depth.setWriteMask(true);\n fr+=2;\n iteratorAdvanced = true;\n }\n else if (fr[1].matchWord(\"FALSE\") || fr[1].matchWord(\"OFF\"))\n {\n depth.setWriteMask(false);\n fr+=2;\n iteratorAdvanced = true;\n }\n }\n\n double znear,zfar;\n if (fr[0].matchWord(\"range\") && fr[1].getDouble(znear) && fr[2].getDouble(zfar))\n {\n depth.setRange(znear,zfar);\n fr+=2;\n iteratorAdvanced = true;\n }\n\n return iteratorAdvanced;\n}\n\n\nbool Depth_writeLocalData(const Object& obj,Output& fw)\n{\n const Depth& depth = static_cast<const Depth&>(obj);\n\n fw.indent() << \"function \" << Depth_getFuncStr(depth.getFunction()) << std::endl;\n \n fw.indent() << \"writeMask \";\n if (depth.getWriteMask()) fw << \"TRUE\" << std::endl;\n else fw << \"TRUE\" << std::endl;\n \n fw.indent() << \"range \" << depth.getZNear() << \" \" << depth.getZFar() << std::endl;\n\n return true;\n}\n\n\nbool Depth_matchFuncStr(const char* str,Depth::Function& func)\n{\n if (strcmp(str,\"NEVER\")==0) func = Depth::NEVER;\n else if (strcmp(str,\"LESS\")==0) func = Depth::LESS;\n else if (strcmp(str,\"EQUAL\")==0) func = Depth::EQUAL;\n else if (strcmp(str,\"LEQUAL\")==0) func = Depth::LEQUAL;\n else if (strcmp(str,\"GREATER\")==0) func = Depth::GREATER;\n else if (strcmp(str,\"NOTEQUAL\")==0) func = Depth::NOTEQUAL;\n else if (strcmp(str,\"GEQUAL\")==0) func = Depth::GEQUAL;\n else if (strcmp(str,\"ALWAYS\")==0) func = Depth::ALWAYS;\n else return false;\n return true;\n}\n\n\nconst char* Depth_getFuncStr(Depth::Function func)\n{\n switch(func)\n {\n case(Depth::NEVER): return \"NEVER\";\n case(Depth::LESS): return \"LESS\";\n case(Depth::EQUAL): return \"EQUAL\";\n case(Depth::LEQUAL): return \"LEQUAL\";\n case(Depth::GREATER): return \"GREATER\";\n case(Depth::NOTEQUAL): return \"NOTEQUAL\";\n case(Depth::GEQUAL): return \"GEQUAL\";\n case(Depth::ALWAYS): return \"ALWAYS\";\n }\n return \"\";\n}\n<commit_msg>Changed incorrect instance \"TRUE\" to \"FALSE\" to match DepthMask state.<commit_after>#include \"osg\/Depth\"\n\n#include \"osgDB\/Registry\"\n#include \"osgDB\/Input\"\n#include \"osgDB\/Output\"\n\nusing namespace osg;\nusing namespace osgDB;\n\n\/\/ forward declare functions to use later.\nbool Depth_readLocalData(Object& obj, Input& fr);\nbool Depth_writeLocalData(const Object& obj, Output& fw);\n\nbool Depth_matchFuncStr(const char* str,Depth::Function& func);\nconst char* Depth_getFuncStr(Depth::Function func);\n\n\n\/\/ register the read and write functions with the osgDB::Registry.\nRegisterDotOsgWrapperProxy g_DepthProxy\n(\n new osg::Depth,\n \"Depth\",\n \"Object StateAttribute Depth\",\n &Depth_readLocalData,\n &Depth_writeLocalData\n);\n\n\nbool Depth_readLocalData(Object& obj, Input& fr)\n{\n bool iteratorAdvanced = false;\n\n Depth& depth = static_cast<Depth&>(obj);\n \n Depth::Function func;\n if (fr[0].matchWord(\"function\") && Depth_matchFuncStr(fr[1].getStr(),func))\n {\n depth.setFunction(func);\n fr+=2;\n iteratorAdvanced = true;\n }\n\n if (fr[0].matchWord(\"writeMask\"))\n {\n if (fr[1].matchWord(\"TRUE\") || fr[1].matchWord(\"ON\"))\n {\n depth.setWriteMask(true);\n fr+=2;\n iteratorAdvanced = true;\n }\n else if (fr[1].matchWord(\"FALSE\") || fr[1].matchWord(\"OFF\"))\n {\n depth.setWriteMask(false);\n fr+=2;\n iteratorAdvanced = true;\n }\n }\n\n double znear,zfar;\n if (fr[0].matchWord(\"range\") && fr[1].getDouble(znear) && fr[2].getDouble(zfar))\n {\n depth.setRange(znear,zfar);\n fr+=2;\n iteratorAdvanced = true;\n }\n\n return iteratorAdvanced;\n}\n\n\nbool Depth_writeLocalData(const Object& obj,Output& fw)\n{\n const Depth& depth = static_cast<const Depth&>(obj);\n\n fw.indent() << \"function \" << Depth_getFuncStr(depth.getFunction()) << std::endl;\n \n fw.indent() << \"writeMask \";\n if (depth.getWriteMask()) fw << \"TRUE\" << std::endl;\n else fw << \"FALSE\" << std::endl;\n \n fw.indent() << \"range \" << depth.getZNear() << \" \" << depth.getZFar() << std::endl;\n\n return true;\n}\n\n\nbool Depth_matchFuncStr(const char* str,Depth::Function& func)\n{\n if (strcmp(str,\"NEVER\")==0) func = Depth::NEVER;\n else if (strcmp(str,\"LESS\")==0) func = Depth::LESS;\n else if (strcmp(str,\"EQUAL\")==0) func = Depth::EQUAL;\n else if (strcmp(str,\"LEQUAL\")==0) func = Depth::LEQUAL;\n else if (strcmp(str,\"GREATER\")==0) func = Depth::GREATER;\n else if (strcmp(str,\"NOTEQUAL\")==0) func = Depth::NOTEQUAL;\n else if (strcmp(str,\"GEQUAL\")==0) func = Depth::GEQUAL;\n else if (strcmp(str,\"ALWAYS\")==0) func = Depth::ALWAYS;\n else return false;\n return true;\n}\n\n\nconst char* Depth_getFuncStr(Depth::Function func)\n{\n switch(func)\n {\n case(Depth::NEVER): return \"NEVER\";\n case(Depth::LESS): return \"LESS\";\n case(Depth::EQUAL): return \"EQUAL\";\n case(Depth::LEQUAL): return \"LEQUAL\";\n case(Depth::GREATER): return \"GREATER\";\n case(Depth::NOTEQUAL): return \"NOTEQUAL\";\n case(Depth::GEQUAL): return \"GEQUAL\";\n case(Depth::ALWAYS): return \"ALWAYS\";\n }\n return \"\";\n}\n<|endoftext|>"} {"text":"<commit_before><?hh \/\/strict\n\n\/**\n * This file is part of hhpack\\color.\n *\n * (c) Noritaka Horio <holy.shared.design@gmail.com>\n *\n * This source file is subject to the MIT license that is bundled\n * with this source code in the file LICENSE.\n *\/\n\nnamespace hhpack\\color;\n\nfinal class Color\n{\n\n private Set<StyleType> $styles;\n\n public function __construct(\n private ForegroundColor $color = ForegroundColor::DefaultColor,\n private BackgroundColor $backgroundColor = BackgroundColor::DefaultColor\n )\n {\n $this->styles = Set {};\n }\n\n public function color(ForegroundColor $color) : this\n {\n $this->color = $color;\n return $this;\n }\n\n public function background(BackgroundColor $color) : this\n {\n $this->backgroundColor = $color;\n return $this;\n }\n\n public function addStyle(StyleType $style) : this\n {\n $this->styles->add($style);\n return $this;\n }\n\n public function removeStyle(StyleType $style) : this\n {\n $this->styles->remove($style);\n return $this;\n }\n\n public function println(string $format, ...) : void\n {\n $text = call_user_func_array([ $this, 'format' ], func_get_args());\n fwrite(STDOUT, $text . PHP_EOL);\n }\n\n public function display(string $format, ...) : void\n {\n $text = call_user_func_array([ $this, 'format' ], func_get_args());\n fwrite(STDOUT, $text);\n }\n\n public static function fromColor(ForegroundColor $color) : this\n {\n return new Color($color);\n }\n\n public static function fromBackground(BackgroundColor $color) : this\n {\n return new Color(ForegroundColor::DefaultColor, $color);\n }\n\n public static function fromDefault() : this\n {\n return new Color();\n }\n\n public function format(string $format, ...) : string\n {\n $parts = Set { $format };\n $parts->addAll( func_get_args() );\n\n $text = call_user_func_array('sprintf', $parts->toArray());\n\n return $this->applyTo($text);\n }\n\n public function applyTo(string $text) : string\n {\n $parts = Set {};\n $parts->add(\"\\e[%s;%s;%sm%s\\e[0m\");\n\n if ($this->styles->isEmpty()) {\n $this->addStyle(StyleType::DefaultStyle);\n }\n\n $styles = $this->styles->toValuesArray();\n $styleText = implode(';', $styles);\n $parts->add($styleText);\n\n $parts->add((string) $this->color);\n $parts->add((string) $this->backgroundColor);\n $parts->add($text);\n\n return call_user_func_array('sprintf', $parts->toArray());\n }\n\n}\n<commit_msg>refactoring<commit_after><?hh \/\/strict\n\n\/**\n * This file is part of hhpack\\color.\n *\n * (c) Noritaka Horio <holy.shared.design@gmail.com>\n *\n * This source file is subject to the MIT license that is bundled\n * with this source code in the file LICENSE.\n *\/\n\nnamespace hhpack\\color;\n\nfinal class Color\n{\n\n private Set<StyleType> $styles;\n\n public function __construct(\n private ForegroundColor $color = ForegroundColor::DefaultColor,\n private BackgroundColor $backgroundColor = BackgroundColor::DefaultColor\n )\n {\n $this->styles = Set {};\n }\n\n public function color(ForegroundColor $color) : this\n {\n $this->color = $color;\n return $this;\n }\n\n public function background(BackgroundColor $color) : this\n {\n $this->backgroundColor = $color;\n return $this;\n }\n\n public function addStyle(StyleType $style) : this\n {\n $this->styles->add($style);\n return $this;\n }\n\n public function removeStyle(StyleType $style) : this\n {\n $this->styles->remove($style);\n return $this;\n }\n\n public function println(string $format, ...) : void\n {\n $text = call_user_func_array([ $this, 'format' ], func_get_args());\n fwrite(STDOUT, $text . PHP_EOL);\n }\n\n public function display(string $format, ...) : void\n {\n $text = call_user_func_array([ $this, 'format' ], func_get_args());\n fwrite(STDOUT, $text);\n }\n\n public static function fromColor(ForegroundColor $color) : this\n {\n return new Color($color);\n }\n\n public static function fromBackground(BackgroundColor $color) : this\n {\n return new Color(ForegroundColor::DefaultColor, $color);\n }\n\n public static function fromDefault() : this\n {\n return new Color();\n }\n\n public function format(string $format, ...) : string\n {\n $parts = Set { $format };\n $parts->addAll( func_get_args() );\n\n $text = call_user_func_array('sprintf', $parts->toArray());\n\n return $this->applyTo($text);\n }\n\n public function applyTo(string $text) : string\n {\n $styles = Set {};\n\n if ($this->styles->isEmpty()) {\n $this->addStyle(StyleType::DefaultStyle);\n }\n\n $styles->addAll($this->styles);\n\n $styles->add((string) $this->color);\n $styles->add((string) $this->backgroundColor);\n\n $styleText = implode(';', $styles->toValuesArray());\n\n return sprintf(\"\\e[%sm%s\\e[0m\", $styleText, $text);\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <cmath>\n#include <cstring>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\nusing std::setprecision;\nusing std::ofstream;\nusing std::ceil;\nusing std::pow;\n\n#include <ArgumentList.hpp>\n#include <InitializeOpenCL.hpp>\n#include <CLData.hpp>\n#include <Exceptions.hpp>\n#include <Copy.hpp>\n#include <utils.hpp>\nusing isa::utils::ArgumentList;\nusing isa::OpenCL::initializeOpenCL;\nusing isa::OpenCL::CLData;\nusing isa::Exceptions::OpenCLError;\nusing isa::Benchmarks::Copy;\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int nrThreadsPerBlock = 0;\n\tunsigned int nrRows = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 11 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -n <dim> -t <threads_per_block> -r <rows>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tarrayDim = commandLine.getSwitchArgument< unsigned int >(\"-n\");\n\t\tnrThreadsPerBlock = commandLine.getSwitchArgument< unsigned int >(\"-t\");\n\t\tnrRows = commandLine.getSwitchArgument< unsigned int >(\"-r\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tCLData< float > * A = new CLData< float >(\"A\", true);\n\tCLData< float > * B = new CLData< float >(\"B\", true);\n\n\tA->setCLContext(oclContext);\n\tA->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tA->allocateHostData(arrayDim);\n\tB->setCLContext(oclContext);\n\tB->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tB->allocateHostData(arrayDim);\n\ttry {\n\t\tA->setDeviceWriteOnly();\n\t\tA->allocateDeviceData();\n\t\tB->setDeviceReadOnly();\n\t\tB->allocateDeviceData();\n\t} catch ( OpenCLError err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tCopy< float > copy = Copy< float >(\"float\");\n\ttry {\n\t\tcopy.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\tcopy.setNrThreadsPerBlock(nrThreadsPerBlock);\n\t\tcopy.setNrThreads(arrayDim);\n\t\tcopy.setNrRows(nrRows);\n\t\tcopy.generateCode();\n\n\t\tB->copyHostToDevice(true);\n\t\tcopy(A,B);\n\t\t(copy.getTimer()).reset();\n\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\tcopy(A, B);\n\t\t}\n\t} catch ( OpenCLError err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << endl;\n\tcout << fixed << setprecision(3) << copy.getGB() \/ (copy.getTimer()).getAverageTime() << endl;\n\tcout << endl;\n\n\treturn 0;\n}\n<commit_msg>Tuning the OpenCL copy benchmark.<commit_after>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <cmath>\n#include <cstring>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\nusing std::setprecision;\nusing std::ofstream;\nusing std::ceil;\nusing std::pow;\n\n#include <ArgumentList.hpp>\n#include <InitializeOpenCL.hpp>\n#include <CLData.hpp>\n#include <Exceptions.hpp>\n#include <Copy.hpp>\n#include <utils.hpp>\nusing isa::utils::ArgumentList;\nusing isa::OpenCL::initializeOpenCL;\nusing isa::OpenCL::CLData;\nusing isa::Exceptions::OpenCLError;\nusing isa::Benchmarks::Copy;\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int maxThreads = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 7 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -m <max_threads>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tmaxThreads = commandLine.getSwitchArgument< unsigned int >(\"-max_threads\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\t(oclDevices->at(oclDevices)).getInfo< unsigned int >(CL_DEVICE_MAX_MEM_ALLOC_SIZE, &arrayDim);\n\tarrayDim \/= 4;\n\n\tCLData< float > * A = new CLData< float >(\"A\", true);\n\tCLData< float > * B = new CLData< float >(\"B\", true);\n\n\tA->setCLContext(oclContext);\n\tA->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tA->allocateHostData(arrayDim);\n\tB->setCLContext(oclContext);\n\tB->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tB->allocateHostData(arrayDim);\n\ttry {\n\t\tA->setDeviceWriteOnly();\n\t\tA->allocateDeviceData();\n\t\tB->setDeviceWriteOnly();\n\t\tB->allocateDeviceData();\n\t} catch ( OpenCLError err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << fixed << setprecision(3) << endl;\n\tfor (unsigned int threads0 = 2; threads0 <= maxThreads; threads0 *= 2 ) {\n\t\tfor (unsigned int threads1 = 1; threads1 <= 32; threads1++ ) {\n\t\t\tif ( (threads0 * threads1) > maxThreads ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tCopy< float > copy = Copy< float >(\"float\");\n\t\t\ttry {\n\t\t\t\tcopy.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\t\t\tcopy.setNrThreads(arrayDim);\n\t\t\t\tcopy.setNrThreadsPerBlock(threads0);\t\t\t\t\n\t\t\t\tcopy.setNrRows(threads1);\n\t\t\t\tcopy.generateCode();\n\n\t\t\t\tB->copyHostToDevice(true);\n\t\t\t\tcopy(A,B);\n\t\t\t\t(copy.getTimer()).reset();\n\t\t\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\t\t\tcopy(A, B);\n\t\t\t\t}\n\t\t\t} catch ( OpenCLError err ) {\n\t\t\t\tcerr << err.what() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tcout << threads0 << \" \" << threads1 << \" \" << copy.getGB() \/ (copy.getTimer()).getAverageTime() << endl;\n\t\t\t\n\t\t}\n\t}\n\tcout << endl;\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2014 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner\n\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\/\/ System Includes\n#include <algorithm>\n#include <iostream>\n\n\/\/ Local Includes\n#include \"libmesh\/libmesh_common.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/parallel_hilbert.h\"\n#include \"libmesh\/parallel_sort.h\"\n#include \"libmesh\/parallel_bin_sorter.h\"\n#ifdef LIBMESH_HAVE_LIBHILBERT\n# include \"hilbert.h\"\n#endif\n\nnamespace libMesh\n{\n\n\nnamespace Parallel {\n\n\/\/ The Constructor sorts the local data using\n\/\/ std::sort(). Therefore, the construction of\n\/\/ a Parallel::Sort object takes O(nlogn) time,\n\/\/ where n is the length of _data.\ntemplate <typename KeyType, typename IdxType>\nSort<KeyType,IdxType>::Sort(const Parallel::Communicator &comm_in,\n std::vector<KeyType>& d) :\n ParallelObject(comm_in),\n _n_procs(cast_int<processor_id_type>(comm_in.size())),\n _proc_id(cast_int<processor_id_type>(comm_in.rank())),\n _bin_is_sorted(false),\n _data(d)\n{\n std::sort(_data.begin(), _data.end());\n\n \/\/ Allocate storage\n _local_bin_sizes.resize(_n_procs);\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::sort()\n{\n \/\/ Find the global data size. The sorting\n \/\/ algorithms assume they have a range to\n \/\/ work with, so catch the degenerate cases here\n IdxType global_data_size = cast_int<IdxType>(_data.size());\n\n this->comm().sum (global_data_size);\n\n if (global_data_size < 2)\n {\n \/\/ the entire global range is either empty\n \/\/ or contains only one element\n _my_bin = _data;\n\n this->comm().allgather (static_cast<IdxType>(_my_bin.size()),\n _local_bin_sizes);\n }\n else\n {\n if (this->n_processors() > 1)\n {\n this->binsort();\n this->communicate_bins();\n }\n else\n _my_bin = _data;\n\n this->sort_local_bin();\n }\n\n \/\/ Set sorted flag to true\n _bin_is_sorted = true;\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::binsort()\n{\n \/\/ Find the global min and max from all the\n \/\/ processors.\n std::vector<KeyType> global_min_max(2);\n\n \/\/ Insert the local min and max for this processor\n global_min_max[0] = -_data.front();\n global_min_max[1] = _data.back();\n\n \/\/ Communicate to determine the global\n \/\/ min and max for all processors.\n this->comm().max(global_min_max);\n\n \/\/ Multiply the min by -1 to obtain the true min\n global_min_max[0] *= -1;\n\n \/\/ Bin-Sort based on the global min and max\n Parallel::BinSorter<KeyType> bs(this->comm(), _data);\n bs.binsort(_n_procs, global_min_max[1], global_min_max[0]);\n\n \/\/ Now save the local bin sizes in a vector so\n \/\/ we don't have to keep around the BinSorter.\n for (processor_id_type i=0; i<_n_procs; ++i)\n _local_bin_sizes[i] = bs.sizeof_bin(i);\n}\n\n\n\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\/\/ Full specialization for HilbertIndices, there is a fair amount of\n\/\/ code duplication here that could potentially be consolidated with the\n\/\/ above method\ntemplate <>\nvoid Sort<Hilbert::HilbertIndices,unsigned int>::binsort()\n{\n \/\/ Find the global min and max from all the\n \/\/ processors. Do this using MPI_Allreduce.\n Hilbert::HilbertIndices\n local_min, local_max,\n global_min, global_max;\n\n if (_data.empty())\n {\n local_min.rack0 = local_min.rack1 = local_min.rack2 = static_cast<Hilbert::inttype>(-1);\n local_max.rack0 = local_max.rack1 = local_max.rack2 = 0;\n }\n else\n {\n local_min = _data.front();\n local_max = _data.back();\n }\n\n MPI_Op hilbert_max, hilbert_min;\n\n MPI_Op_create ((MPI_User_function*)__hilbert_max_op, true, &hilbert_max);\n MPI_Op_create ((MPI_User_function*)__hilbert_min_op, true, &hilbert_min);\n\n \/\/ Communicate to determine the global\n \/\/ min and max for all processors.\n MPI_Allreduce(&local_min,\n &global_min,\n 1,\n Parallel::StandardType<Hilbert::HilbertIndices>(),\n hilbert_min,\n this->comm().get());\n\n MPI_Allreduce(&local_max,\n &global_max,\n 1,\n Parallel::StandardType<Hilbert::HilbertIndices>(),\n hilbert_max,\n this->comm().get());\n\n MPI_Op_free (&hilbert_max);\n MPI_Op_free (&hilbert_min);\n\n \/\/ Bin-Sort based on the global min and max\n Parallel::BinSorter<Hilbert::HilbertIndices> bs(this->comm(),_data);\n bs.binsort(_n_procs, global_max, global_min);\n\n \/\/ Now save the local bin sizes in a vector so\n \/\/ we don't have to keep around the BinSorter.\n for (processor_id_type i=0; i<_n_procs; ++i)\n _local_bin_sizes[i] = bs.sizeof_bin(i);\n}\n\n#endif \/\/ #ifdef LIBMESH_HAVE_LIBHILBERT\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::communicate_bins()\n{\n#ifdef LIBMESH_HAVE_MPI\n \/\/ Create storage for the global bin sizes. This\n \/\/ is the number of keys which will be held in\n \/\/ each bin over all processors.\n std::vector<IdxType> global_bin_sizes = _local_bin_sizes;\n\n \/\/ Sum to find the total number of entries in each bin.\n this->comm().sum(global_bin_sizes);\n\n \/\/ Create a vector to temporarily hold the results of MPI_Gatherv\n \/\/ calls. The vector dest may be saved away to _my_bin depending on which\n \/\/ processor is being MPI_Gatherv'd.\n std::vector<KeyType> dest;\n\n IdxType local_offset = 0;\n\n for (processor_id_type i=0; i<_n_procs; ++i)\n {\n \/\/ Vector to receive the total bin size for each\n \/\/ processor. Processor i's bin size will be\n \/\/ held in proc_bin_size[i]\n std::vector<IdxType> proc_bin_size;\n\n \/\/ Find the number of contributions coming from each\n \/\/ processor for this bin. Note: allgather combines\n \/\/ the MPI_Gather and MPI_Bcast operations into one.\n this->comm().allgather(_local_bin_sizes[i], proc_bin_size);\n\n \/\/ Compute the offsets into my_bin for each processor's\n \/\/ portion of the bin. These are basically partial sums\n \/\/ of the proc_bin_size vector.\n std::vector<IdxType> displacements(_n_procs);\n for (processor_id_type j=1; j<_n_procs; ++j)\n displacements[j] = proc_bin_size[j-1] + displacements[j-1];\n\n \/\/ Resize the destination buffer\n dest.resize (global_bin_sizes[i]);\n\n MPI_Gatherv((_data.size() > local_offset) ?\n &_data[local_offset] :\n NULL, \/\/ Points to the beginning of the bin to be sent\n _local_bin_sizes[i], \/\/ How much data is in the bin being sent.\n Parallel::StandardType<KeyType>(), \/\/ The data type we are sorting\n (dest.empty()) ?\n NULL :\n &dest[0], \/\/ Enough storage to hold all bin contributions\n (int*) &proc_bin_size[0], \/\/ How much is to be received from each processor\n (int*) &displacements[0], \/\/ Offsets into the receive buffer\n Parallel::StandardType<KeyType>(), \/\/ The data type we are sorting\n i, \/\/ The root process (we do this once for each proc)\n this->comm().get());\n\n \/\/ Copy the destination buffer if it\n \/\/ corresponds to the bin for this processor\n if (i == _proc_id)\n _my_bin = dest;\n\n \/\/ Increment the local offset counter\n local_offset += _local_bin_sizes[i];\n }\n#endif \/\/ LIBMESH_HAVE_MPI\n}\n\n\n\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\/\/ Full specialization for HilbertIndices, there is a fair amount of\n\/\/ code duplication here that could potentially be consolidated with the\n\/\/ above method\ntemplate <>\nvoid Sort<Hilbert::HilbertIndices,unsigned int>::communicate_bins()\n{\n \/\/ Create storage for the global bin sizes. This\n \/\/ is the number of keys which will be held in\n \/\/ each bin over all processors.\n std::vector<unsigned int> global_bin_sizes(_n_procs);\n\n libmesh_assert_equal_to (_local_bin_sizes.size(), global_bin_sizes.size());\n\n \/\/ Sum to find the total number of entries in each bin.\n \/\/ This is stored in global_bin_sizes. Note, we\n \/\/ explicitly know that we are communicating MPI_UNSIGNED's here.\n MPI_Allreduce(&_local_bin_sizes[0],\n &global_bin_sizes[0],\n _n_procs,\n MPI_UNSIGNED,\n MPI_SUM,\n this->comm().get());\n\n \/\/ Create a vector to temporarily hold the results of MPI_Gatherv\n \/\/ calls. The vector dest may be saved away to _my_bin depending on which\n \/\/ processor is being MPI_Gatherv'd.\n std::vector<Hilbert::HilbertIndices> dest;\n\n unsigned int local_offset = 0;\n\n for (unsigned int i=0; i<_n_procs; ++i)\n {\n \/\/ Vector to receive the total bin size for each\n \/\/ processor. Processor i's bin size will be\n \/\/ held in proc_bin_size[i]\n std::vector<unsigned int> proc_bin_size(_n_procs);\n\n \/\/ Find the number of contributions coming from each\n \/\/ processor for this bin. Note: Allgather combines\n \/\/ the MPI_Gather and MPI_Bcast operations into one.\n \/\/ Note: Here again we know that we are communicating\n \/\/ MPI_UNSIGNED's so there is no need to check the MPI_traits.\n MPI_Allgather(&_local_bin_sizes[i], \/\/ Source: # of entries on this proc in bin i\n 1, \/\/ Number of items to gather\n MPI_UNSIGNED,\n &proc_bin_size[0], \/\/ Destination: Total # of entries in bin i\n 1,\n MPI_UNSIGNED,\n this->comm().get());\n\n \/\/ Compute the offsets into my_bin for each processor's\n \/\/ portion of the bin. These are basically partial sums\n \/\/ of the proc_bin_size vector.\n std::vector<unsigned int> displacements(_n_procs);\n for (unsigned int j=1; j<_n_procs; ++j)\n displacements[j] = proc_bin_size[j-1] + displacements[j-1];\n\n \/\/ Resize the destination buffer\n dest.resize (global_bin_sizes[i]);\n\n MPI_Gatherv((_data.size() > local_offset) ?\n &_data[local_offset] :\n NULL, \/\/ Points to the beginning of the bin to be sent\n _local_bin_sizes[i], \/\/ How much data is in the bin being sent.\n Parallel::StandardType<Hilbert::HilbertIndices>(), \/\/ The data type we are sorting\n (dest.empty()) ?\n NULL :\n &dest[0], \/\/ Enough storage to hold all bin contributions\n (int*) &proc_bin_size[0], \/\/ How much is to be received from each processor\n (int*) &displacements[0], \/\/ Offsets into the receive buffer\n Parallel::StandardType<Hilbert::HilbertIndices>(), \/\/ The data type we are sorting\n i, \/\/ The root process (we do this once for each proc)\n this->comm().get());\n\n \/\/ Copy the destination buffer if it\n \/\/ corresponds to the bin for this processor\n if (i == _proc_id)\n _my_bin = dest;\n\n \/\/ Increment the local offset counter\n local_offset += _local_bin_sizes[i];\n }\n}\n\n#endif \/\/ #if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::sort_local_bin()\n{\n std::sort(_my_bin.begin(), _my_bin.end());\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nconst std::vector<KeyType>& Sort<KeyType,IdxType>::bin()\n{\n if (!_bin_is_sorted)\n {\n libMesh::out << \"Warning! Bin is not yet sorted!\" << std::endl;\n }\n\n return _my_bin;\n}\n\n}\n\n\n\n\/\/ Explicitly instantiate for int, double\ntemplate class Parallel::Sort<int, unsigned int>;\ntemplate class Parallel::Sort<double, unsigned int>;\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\ntemplate class Parallel::Sort<Hilbert::HilbertIndices, unsigned int>;\n#endif\n\n} \/\/ namespace libMesh\n<commit_msg>MPI expects a vector of ints, let's give it one instead of casting.<commit_after>\/\/ The libMesh Finite Element Library.\n\/\/ Copyright (C) 2002-2014 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner\n\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n\n\/\/ System Includes\n#include <algorithm>\n#include <iostream>\n\n\/\/ Local Includes\n#include \"libmesh\/libmesh_common.h\"\n#include \"libmesh\/parallel.h\"\n#include \"libmesh\/parallel_hilbert.h\"\n#include \"libmesh\/parallel_sort.h\"\n#include \"libmesh\/parallel_bin_sorter.h\"\n#ifdef LIBMESH_HAVE_LIBHILBERT\n# include \"hilbert.h\"\n#endif\n\nnamespace libMesh\n{\n\n\nnamespace Parallel {\n\n\/\/ The Constructor sorts the local data using\n\/\/ std::sort(). Therefore, the construction of\n\/\/ a Parallel::Sort object takes O(nlogn) time,\n\/\/ where n is the length of _data.\ntemplate <typename KeyType, typename IdxType>\nSort<KeyType,IdxType>::Sort(const Parallel::Communicator &comm_in,\n std::vector<KeyType>& d) :\n ParallelObject(comm_in),\n _n_procs(cast_int<processor_id_type>(comm_in.size())),\n _proc_id(cast_int<processor_id_type>(comm_in.rank())),\n _bin_is_sorted(false),\n _data(d)\n{\n std::sort(_data.begin(), _data.end());\n\n \/\/ Allocate storage\n _local_bin_sizes.resize(_n_procs);\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::sort()\n{\n \/\/ Find the global data size. The sorting\n \/\/ algorithms assume they have a range to\n \/\/ work with, so catch the degenerate cases here\n IdxType global_data_size = cast_int<IdxType>(_data.size());\n\n this->comm().sum (global_data_size);\n\n if (global_data_size < 2)\n {\n \/\/ the entire global range is either empty\n \/\/ or contains only one element\n _my_bin = _data;\n\n this->comm().allgather (static_cast<IdxType>(_my_bin.size()),\n _local_bin_sizes);\n }\n else\n {\n if (this->n_processors() > 1)\n {\n this->binsort();\n this->communicate_bins();\n }\n else\n _my_bin = _data;\n\n this->sort_local_bin();\n }\n\n \/\/ Set sorted flag to true\n _bin_is_sorted = true;\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::binsort()\n{\n \/\/ Find the global min and max from all the\n \/\/ processors.\n std::vector<KeyType> global_min_max(2);\n\n \/\/ Insert the local min and max for this processor\n global_min_max[0] = -_data.front();\n global_min_max[1] = _data.back();\n\n \/\/ Communicate to determine the global\n \/\/ min and max for all processors.\n this->comm().max(global_min_max);\n\n \/\/ Multiply the min by -1 to obtain the true min\n global_min_max[0] *= -1;\n\n \/\/ Bin-Sort based on the global min and max\n Parallel::BinSorter<KeyType> bs(this->comm(), _data);\n bs.binsort(_n_procs, global_min_max[1], global_min_max[0]);\n\n \/\/ Now save the local bin sizes in a vector so\n \/\/ we don't have to keep around the BinSorter.\n for (processor_id_type i=0; i<_n_procs; ++i)\n _local_bin_sizes[i] = bs.sizeof_bin(i);\n}\n\n\n\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\/\/ Full specialization for HilbertIndices, there is a fair amount of\n\/\/ code duplication here that could potentially be consolidated with the\n\/\/ above method\ntemplate <>\nvoid Sort<Hilbert::HilbertIndices,unsigned int>::binsort()\n{\n \/\/ Find the global min and max from all the\n \/\/ processors. Do this using MPI_Allreduce.\n Hilbert::HilbertIndices\n local_min, local_max,\n global_min, global_max;\n\n if (_data.empty())\n {\n local_min.rack0 = local_min.rack1 = local_min.rack2 = static_cast<Hilbert::inttype>(-1);\n local_max.rack0 = local_max.rack1 = local_max.rack2 = 0;\n }\n else\n {\n local_min = _data.front();\n local_max = _data.back();\n }\n\n MPI_Op hilbert_max, hilbert_min;\n\n MPI_Op_create ((MPI_User_function*)__hilbert_max_op, true, &hilbert_max);\n MPI_Op_create ((MPI_User_function*)__hilbert_min_op, true, &hilbert_min);\n\n \/\/ Communicate to determine the global\n \/\/ min and max for all processors.\n MPI_Allreduce(&local_min,\n &global_min,\n 1,\n Parallel::StandardType<Hilbert::HilbertIndices>(),\n hilbert_min,\n this->comm().get());\n\n MPI_Allreduce(&local_max,\n &global_max,\n 1,\n Parallel::StandardType<Hilbert::HilbertIndices>(),\n hilbert_max,\n this->comm().get());\n\n MPI_Op_free (&hilbert_max);\n MPI_Op_free (&hilbert_min);\n\n \/\/ Bin-Sort based on the global min and max\n Parallel::BinSorter<Hilbert::HilbertIndices> bs(this->comm(),_data);\n bs.binsort(_n_procs, global_max, global_min);\n\n \/\/ Now save the local bin sizes in a vector so\n \/\/ we don't have to keep around the BinSorter.\n for (processor_id_type i=0; i<_n_procs; ++i)\n _local_bin_sizes[i] = bs.sizeof_bin(i);\n}\n\n#endif \/\/ #ifdef LIBMESH_HAVE_LIBHILBERT\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::communicate_bins()\n{\n#ifdef LIBMESH_HAVE_MPI\n \/\/ Create storage for the global bin sizes. This\n \/\/ is the number of keys which will be held in\n \/\/ each bin over all processors.\n std::vector<IdxType> global_bin_sizes = _local_bin_sizes;\n\n \/\/ Sum to find the total number of entries in each bin.\n this->comm().sum(global_bin_sizes);\n\n \/\/ Create a vector to temporarily hold the results of MPI_Gatherv\n \/\/ calls. The vector dest may be saved away to _my_bin depending on which\n \/\/ processor is being MPI_Gatherv'd.\n std::vector<KeyType> dest;\n\n IdxType local_offset = 0;\n\n for (processor_id_type i=0; i<_n_procs; ++i)\n {\n \/\/ Vector to receive the total bin size for each\n \/\/ processor. Processor i's bin size will be\n \/\/ held in proc_bin_size[i]\n std::vector<IdxType> proc_bin_size;\n\n \/\/ Find the number of contributions coming from each\n \/\/ processor for this bin. Note: allgather combines\n \/\/ the MPI_Gather and MPI_Bcast operations into one.\n this->comm().allgather(_local_bin_sizes[i], proc_bin_size);\n\n \/\/ Compute the offsets into my_bin for each processor's\n \/\/ portion of the bin. These are basically partial sums\n \/\/ of the proc_bin_size vector.\n std::vector<int> displacements(_n_procs);\n for (processor_id_type j=1; j<_n_procs; ++j)\n displacements[j] = proc_bin_size[j-1] + displacements[j-1];\n\n \/\/ Resize the destination buffer\n dest.resize (global_bin_sizes[i]);\n\n MPI_Gatherv((_data.size() > local_offset) ?\n &_data[local_offset] :\n NULL, \/\/ Points to the beginning of the bin to be sent\n _local_bin_sizes[i], \/\/ How much data is in the bin being sent.\n Parallel::StandardType<KeyType>(), \/\/ The data type we are sorting\n (dest.empty()) ?\n NULL :\n &dest[0], \/\/ Enough storage to hold all bin contributions\n (int*) &proc_bin_size[0], \/\/ How much is to be received from each processor\n &displacements[0], \/\/ Offsets into the receive buffer\n Parallel::StandardType<KeyType>(), \/\/ The data type we are sorting\n i, \/\/ The root process (we do this once for each proc)\n this->comm().get());\n\n \/\/ Copy the destination buffer if it\n \/\/ corresponds to the bin for this processor\n if (i == _proc_id)\n _my_bin = dest;\n\n \/\/ Increment the local offset counter\n local_offset += _local_bin_sizes[i];\n }\n#endif \/\/ LIBMESH_HAVE_MPI\n}\n\n\n\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\/\/ Full specialization for HilbertIndices, there is a fair amount of\n\/\/ code duplication here that could potentially be consolidated with the\n\/\/ above method\ntemplate <>\nvoid Sort<Hilbert::HilbertIndices,unsigned int>::communicate_bins()\n{\n \/\/ Create storage for the global bin sizes. This\n \/\/ is the number of keys which will be held in\n \/\/ each bin over all processors.\n std::vector<unsigned int> global_bin_sizes(_n_procs);\n\n libmesh_assert_equal_to (_local_bin_sizes.size(), global_bin_sizes.size());\n\n \/\/ Sum to find the total number of entries in each bin.\n \/\/ This is stored in global_bin_sizes. Note, we\n \/\/ explicitly know that we are communicating MPI_UNSIGNED's here.\n MPI_Allreduce(&_local_bin_sizes[0],\n &global_bin_sizes[0],\n _n_procs,\n MPI_UNSIGNED,\n MPI_SUM,\n this->comm().get());\n\n \/\/ Create a vector to temporarily hold the results of MPI_Gatherv\n \/\/ calls. The vector dest may be saved away to _my_bin depending on which\n \/\/ processor is being MPI_Gatherv'd.\n std::vector<Hilbert::HilbertIndices> dest;\n\n unsigned int local_offset = 0;\n\n for (unsigned int i=0; i<_n_procs; ++i)\n {\n \/\/ Vector to receive the total bin size for each\n \/\/ processor. Processor i's bin size will be\n \/\/ held in proc_bin_size[i]\n std::vector<unsigned int> proc_bin_size(_n_procs);\n\n \/\/ Find the number of contributions coming from each\n \/\/ processor for this bin. Note: Allgather combines\n \/\/ the MPI_Gather and MPI_Bcast operations into one.\n \/\/ Note: Here again we know that we are communicating\n \/\/ MPI_UNSIGNED's so there is no need to check the MPI_traits.\n MPI_Allgather(&_local_bin_sizes[i], \/\/ Source: # of entries on this proc in bin i\n 1, \/\/ Number of items to gather\n MPI_UNSIGNED,\n &proc_bin_size[0], \/\/ Destination: Total # of entries in bin i\n 1,\n MPI_UNSIGNED,\n this->comm().get());\n\n \/\/ Compute the offsets into my_bin for each processor's\n \/\/ portion of the bin. These are basically partial sums\n \/\/ of the proc_bin_size vector.\n std::vector<int> displacements(_n_procs);\n for (unsigned int j=1; j<_n_procs; ++j)\n displacements[j] = proc_bin_size[j-1] + displacements[j-1];\n\n \/\/ Resize the destination buffer\n dest.resize (global_bin_sizes[i]);\n\n MPI_Gatherv((_data.size() > local_offset) ?\n &_data[local_offset] :\n NULL, \/\/ Points to the beginning of the bin to be sent\n _local_bin_sizes[i], \/\/ How much data is in the bin being sent.\n Parallel::StandardType<Hilbert::HilbertIndices>(), \/\/ The data type we are sorting\n (dest.empty()) ?\n NULL :\n &dest[0], \/\/ Enough storage to hold all bin contributions\n (int*) &proc_bin_size[0], \/\/ How much is to be received from each processor\n &displacements[0], \/\/ Offsets into the receive buffer\n Parallel::StandardType<Hilbert::HilbertIndices>(), \/\/ The data type we are sorting\n i, \/\/ The root process (we do this once for each proc)\n this->comm().get());\n\n \/\/ Copy the destination buffer if it\n \/\/ corresponds to the bin for this processor\n if (i == _proc_id)\n _my_bin = dest;\n\n \/\/ Increment the local offset counter\n local_offset += _local_bin_sizes[i];\n }\n}\n\n#endif \/\/ #if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\n\n\n\ntemplate <typename KeyType, typename IdxType>\nvoid Sort<KeyType,IdxType>::sort_local_bin()\n{\n std::sort(_my_bin.begin(), _my_bin.end());\n}\n\n\n\ntemplate <typename KeyType, typename IdxType>\nconst std::vector<KeyType>& Sort<KeyType,IdxType>::bin()\n{\n if (!_bin_is_sorted)\n {\n libMesh::out << \"Warning! Bin is not yet sorted!\" << std::endl;\n }\n\n return _my_bin;\n}\n\n}\n\n\n\n\/\/ Explicitly instantiate for int, double\ntemplate class Parallel::Sort<int, unsigned int>;\ntemplate class Parallel::Sort<double, unsigned int>;\n#if defined(LIBMESH_HAVE_LIBHILBERT) && defined(LIBMESH_HAVE_MPI)\ntemplate class Parallel::Sort<Hilbert::HilbertIndices, unsigned int>;\n#endif\n\n} \/\/ namespace libMesh\n<|endoftext|>"} {"text":"<commit_before>#include \"detail\/Threadpool.hh\"\n\nnamespace Task {\nnamespace Detail {\n\nThreadpool::Threadpool(size_t threadCount) {\n _workers.reserve(threadCount);\n for (size_t i = 0; i < threadCount; ++i) {\n _workers.emplace_back([this] { this->processTasks(); });\n }\n}\n\nThreadpool::~Threadpool() {\n _stopRequested = true;\n _cv.notify_all();\n for (auto& worker : _workers) {\n worker.join();\n }\n}\n\nvoid Threadpool::schedule(TimedTask task) {\n {\n std::lock_guard<std::mutex> guard(_mutex);\n\n _tasks.push(std::move(task));\n }\n _cv.notify_one();\n}\n\nvoid Threadpool::processTasks() {\n while (!_stopRequested) {\n std::unique_lock<std::mutex> lock(_mutex);\n auto timeout = Clock::now() + std::chrono::hours(1);\n bool taskReady = false;\n\n while (!taskReady) {\n \/\/ The condvar can be unblocked by calling notify_xxx to signal that a new task has been added.\n \/\/ We should update the timeout if the new task has a higher priority.\n if (!_tasks.empty()) {\n timeout = _tasks.top().timepoint();\n }\n taskReady = _cv.wait_until(lock, timeout, [this] { \/\/\n return !_tasks.empty() || _stopRequested;\n });\n if (_stopRequested) {\n return;\n }\n \/\/ This is done to avoid executing the most recent task when another one gets added.\n \/\/ Still, it is necessary to wake up the thread in order to update the timeout.\n \/\/ The container's size needs to be checked as the condvar is not garanted to obtain the lock first.\n if (_tasks.empty() || _tasks.top().timepoint() > Clock::now()) {\n taskReady = false;\n }\n }\n\n auto task = _tasks.top();\n _tasks.pop();\n\n lock.unlock();\n task();\n }\n}\n\n} \/* namespace Detail *\/\n} \/* namespace Task *\/\n<commit_msg>develop #comment Check that threads are joinable before joning them.<commit_after>#include \"detail\/Threadpool.hh\"\n\nnamespace Task {\nnamespace Detail {\n\nThreadpool::Threadpool(size_t threadCount) {\n _workers.reserve(threadCount);\n for (size_t i = 0; i < threadCount; ++i) {\n _workers.emplace_back(&Threadpool::processTasks, this);\n }\n}\n\nThreadpool::~Threadpool() {\n _stopRequested = true;\n _cv.notify_all();\n for (auto& worker : _workers) {\n if (worker.joinable()) {\n worker.join();\n }\n }\n}\n\nvoid Threadpool::schedule(TimedTask task) {\n {\n std::lock_guard<std::mutex> guard(_mutex);\n\n _tasks.push(std::move(task));\n }\n _cv.notify_one();\n}\n\nvoid Threadpool::processTasks() {\n while (!_stopRequested) {\n std::unique_lock<std::mutex> lock(_mutex);\n auto timeout = Clock::now() + std::chrono::hours(1);\n bool taskReady = false;\n\n while (!taskReady) {\n \/\/ The condvar can be unblocked by calling notify_xxx to signal that a new task has been added.\n \/\/ We should update the timeout if the new task has a higher priority.\n if (!_tasks.empty()) {\n timeout = _tasks.top().timepoint();\n }\n taskReady = _cv.wait_until(lock, timeout, [this] { \/\/\n return !_tasks.empty() || _stopRequested;\n });\n if (_stopRequested) {\n return;\n }\n \/\/ This is done to avoid executing the most recent task when another one gets added.\n \/\/ Still, it is necessary to wake up the thread in order to update the timeout.\n \/\/ The container's size needs to be checked as the condvar is not garanted to obtain the lock first.\n if (_tasks.empty() || _tasks.top().timepoint() > Clock::now()) {\n taskReady = false;\n }\n }\n\n auto task = _tasks.top();\n _tasks.pop();\n\n lock.unlock();\n task();\n }\n}\n\n} \/* namespace Detail *\/\n} \/* namespace Task *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of UDPipe <http:\/\/github.com\/ufal\/udpipe\/>.\n\/\/\n\/\/ Copyright 2015 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"pipeline.h\"\n#include \"sentence\/input_format.h\"\n\nnamespace ufal {\nnamespace udpipe {\n\npipeline::pipeline(const model* m, const string& tokenizer, const string& tagger, const string& parser)\n : m(m), tokenizer(tokenizer), tagger(tagger), parser(parser), conllu_output(output_format::new_conllu_output_format()) {}\n\nvoid pipeline::set_model(const model* m) {\n this->m = m;\n}\n\nvoid pipeline::set_tokenizer(const string& tokenizer) {\n this->tokenizer = tokenizer;\n}\n\nvoid pipeline::set_tagger(const string& tagger) {\n this->tagger = tagger;\n}\n\nvoid pipeline::set_parser(const string& parser) {\n this->parser = parser;\n}\n\nbool pipeline::process(const string& input, ostream& os, string& error) const {\n error.clear();\n\n sentence s;\n\n unique_ptr<ufal::udpipe::tokenizer> t;\n unique_ptr<input_format> conllu_input;\n if (tokenizer != \"none\") {\n t.reset(m->new_tokenizer(tokenizer));\n if (!t) return error.assign(\"Cannot allocate new tokenizer!\"), false;\n t->set_text(input);\n } else {\n conllu_input.reset(input_format::new_conllu_input_format());\n if (!conllu_input) return error.assign(\"Cannot allocate CoNLL-U input format instance!\"), false;\n conllu_input->set_text(input);\n }\n\n while (t ? t->next_sentence(s, error) : conllu_input->next_sentence(s, error)) {\n if (tagger != \"none\")\n if (!m->tag(s, tagger, error))\n return false;\n\n if (parser != \"none\")\n if (!m->parse(s, parser, error))\n return false;\n\n conllu_output->write_sentence(s, os);\n }\n if (!error.empty()) return false;\n\n return true;\n}\n\nbool pipeline::evaluate(const string& input, ostream& os, string& error) const {\n error.clear();\n\n sentence system, gold;\n\n unique_ptr<ufal::udpipe::tokenizer> t;\n unique_ptr<input_format> conllu_input;\n if (tokenizer != \"none\") {\n t.reset(m->new_tokenizer(tokenizer));\n if (!t) return error.assign(\"Cannot allocate new tokenizer!\"), false;\n t->set_text(input);\n } else {\n conllu_input.reset(input_format::new_conllu_input_format());\n if (!conllu_input) return error.assign(\"Cannot allocate CoNLL-U input format instance!\"), false;\n conllu_input->set_text(input);\n }\n\n int words = 0, upostag = 0, xpostag = 0, feats = 0, all_tags = 0, lemma = 0;\n int punct = 0, punct_uas = 0, punct_las = 0, nopunct = 0, nopunct_uas = 0, nopunct_las = 0;\n while (t ? t->next_sentence(gold, error) : conllu_input->next_sentence(gold, error)) {\n \/\/ Create empty copy\n system.clear();\n for (size_t i = 1; i < gold.words.size(); i++)\n system.add_word(gold.words[i].form);\n\n if (tagger != \"none\") {\n if (!m->tag(system, tagger, error))\n return false;\n for (size_t i = 1; i < gold.words.size(); i++) {\n words++;\n upostag += gold.words[i].upostag == system.words[i].upostag;\n xpostag += gold.words[i].xpostag == system.words[i].xpostag;\n feats += gold.words[i].feats == system.words[i].feats;\n all_tags += gold.words[i].upostag == system.words[i].upostag && gold.words[i].xpostag == system.words[i].xpostag && gold.words[i].feats == system.words[i].feats;\n lemma += gold.words[i].lemma == system.words[i].lemma;\n }\n } else {\n for (size_t i = 1; i < gold.words.size(); i++) {\n system.words[i].upostag = gold.words[i].upostag;\n system.words[i].xpostag = gold.words[i].xpostag;\n system.words[i].feats = gold.words[i].feats;\n system.words[i].lemma = gold.words[i].lemma;\n }\n }\n\n if (parser != \"none\") {\n if (!m->parse(system, parser, error))\n return false;\n for (size_t i = 1; i < gold.words.size(); i++) {\n punct++;\n punct_uas += gold.words[i].head == system.words[i].head;\n punct_las += gold.words[i].head == system.words[i].head && gold.words[i].deprel == system.words[i].deprel;\n if (gold.words[i].upostag != \"PUNCT\") {\n nopunct++;\n nopunct_uas += gold.words[i].head == system.words[i].head;\n nopunct_las += gold.words[i].head == system.words[i].head && gold.words[i].deprel == system.words[i].deprel;\n }\n }\n }\n }\n if (!error.empty()) return false;\n\n if (tagger != \"none\")\n os << \"Tagging - forms: \" << words << \", upostag: \" << fixed << setprecision(2) << 100. * upostag \/ words << \"%, xpostag: \" << 100. * xpostag \/ words\n << \"%, feats: \" << 100. * feats \/ words << \"%, all tags: \" << 100. * all_tags \/ words << \"%, lemma: \" << 100. * lemma \/ words << '%' << endl;\n if (parser != \"none\")\n os << \"Parsing - UAS: \" << 100. * punct_uas \/ punct << \"%, LAS: \" << 100. * punct_las \/ punct << \"%, \"\n << \"without punctuation - UAS: \" << 100. * nopunct_uas \/ nopunct << \"%, LAS: \" << 100. * nopunct_las \/ nopunct << '%' << endl;\n\n return true;\n}\n\n} \/\/ namespace udpipe\n} \/\/ namespace ufal\n<commit_msg>Set number format when printing parsing accuracy too.<commit_after>\/\/ This file is part of UDPipe <http:\/\/github.com\/ufal\/udpipe\/>.\n\/\/\n\/\/ Copyright 2015 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"pipeline.h\"\n#include \"sentence\/input_format.h\"\n\nnamespace ufal {\nnamespace udpipe {\n\npipeline::pipeline(const model* m, const string& tokenizer, const string& tagger, const string& parser)\n : m(m), tokenizer(tokenizer), tagger(tagger), parser(parser), conllu_output(output_format::new_conllu_output_format()) {}\n\nvoid pipeline::set_model(const model* m) {\n this->m = m;\n}\n\nvoid pipeline::set_tokenizer(const string& tokenizer) {\n this->tokenizer = tokenizer;\n}\n\nvoid pipeline::set_tagger(const string& tagger) {\n this->tagger = tagger;\n}\n\nvoid pipeline::set_parser(const string& parser) {\n this->parser = parser;\n}\n\nbool pipeline::process(const string& input, ostream& os, string& error) const {\n error.clear();\n\n sentence s;\n\n unique_ptr<ufal::udpipe::tokenizer> t;\n unique_ptr<input_format> conllu_input;\n if (tokenizer != \"none\") {\n t.reset(m->new_tokenizer(tokenizer));\n if (!t) return error.assign(\"Cannot allocate new tokenizer!\"), false;\n t->set_text(input);\n } else {\n conllu_input.reset(input_format::new_conllu_input_format());\n if (!conllu_input) return error.assign(\"Cannot allocate CoNLL-U input format instance!\"), false;\n conllu_input->set_text(input);\n }\n\n while (t ? t->next_sentence(s, error) : conllu_input->next_sentence(s, error)) {\n if (tagger != \"none\")\n if (!m->tag(s, tagger, error))\n return false;\n\n if (parser != \"none\")\n if (!m->parse(s, parser, error))\n return false;\n\n conllu_output->write_sentence(s, os);\n }\n if (!error.empty()) return false;\n\n return true;\n}\n\nbool pipeline::evaluate(const string& input, ostream& os, string& error) const {\n error.clear();\n\n sentence system, gold;\n\n unique_ptr<ufal::udpipe::tokenizer> t;\n unique_ptr<input_format> conllu_input;\n if (tokenizer != \"none\") {\n t.reset(m->new_tokenizer(tokenizer));\n if (!t) return error.assign(\"Cannot allocate new tokenizer!\"), false;\n t->set_text(input);\n } else {\n conllu_input.reset(input_format::new_conllu_input_format());\n if (!conllu_input) return error.assign(\"Cannot allocate CoNLL-U input format instance!\"), false;\n conllu_input->set_text(input);\n }\n\n int words = 0, upostag = 0, xpostag = 0, feats = 0, all_tags = 0, lemma = 0;\n int punct = 0, punct_uas = 0, punct_las = 0, nopunct = 0, nopunct_uas = 0, nopunct_las = 0;\n while (t ? t->next_sentence(gold, error) : conllu_input->next_sentence(gold, error)) {\n \/\/ Create empty copy\n system.clear();\n for (size_t i = 1; i < gold.words.size(); i++)\n system.add_word(gold.words[i].form);\n\n if (tagger != \"none\") {\n if (!m->tag(system, tagger, error))\n return false;\n for (size_t i = 1; i < gold.words.size(); i++) {\n words++;\n upostag += gold.words[i].upostag == system.words[i].upostag;\n xpostag += gold.words[i].xpostag == system.words[i].xpostag;\n feats += gold.words[i].feats == system.words[i].feats;\n all_tags += gold.words[i].upostag == system.words[i].upostag && gold.words[i].xpostag == system.words[i].xpostag && gold.words[i].feats == system.words[i].feats;\n lemma += gold.words[i].lemma == system.words[i].lemma;\n }\n } else {\n for (size_t i = 1; i < gold.words.size(); i++) {\n system.words[i].upostag = gold.words[i].upostag;\n system.words[i].xpostag = gold.words[i].xpostag;\n system.words[i].feats = gold.words[i].feats;\n system.words[i].lemma = gold.words[i].lemma;\n }\n }\n\n if (parser != \"none\") {\n if (!m->parse(system, parser, error))\n return false;\n for (size_t i = 1; i < gold.words.size(); i++) {\n punct++;\n punct_uas += gold.words[i].head == system.words[i].head;\n punct_las += gold.words[i].head == system.words[i].head && gold.words[i].deprel == system.words[i].deprel;\n if (gold.words[i].upostag != \"PUNCT\") {\n nopunct++;\n nopunct_uas += gold.words[i].head == system.words[i].head;\n nopunct_las += gold.words[i].head == system.words[i].head && gold.words[i].deprel == system.words[i].deprel;\n }\n }\n }\n }\n if (!error.empty()) return false;\n\n if (tagger != \"none\")\n os << \"Tagging - forms: \" << words << \", upostag: \" << fixed << setprecision(2) << 100. * upostag \/ words << \"%, xpostag: \" << 100. * xpostag \/ words\n << \"%, feats: \" << 100. * feats \/ words << \"%, all tags: \" << 100. * all_tags \/ words << \"%, lemma: \" << 100. * lemma \/ words << '%' << endl;\n if (parser != \"none\")\n os << \"Parsing - UAS: \" << fixed << setprecision(2) << 100. * punct_uas \/ punct << \"%, LAS: \" << 100. * punct_las \/ punct << \"%, \"\n << \"without punctuation - UAS: \" << 100. * nopunct_uas \/ nopunct << \"%, LAS: \" << 100. * nopunct_las \/ nopunct << '%' << endl;\n\n return true;\n}\n\n} \/\/ namespace udpipe\n} \/\/ namespace ufal\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/ui\/ui_layout_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/base\/net_util.h\"\n\nstatic const char* kRootFiles[] = {\n \"clear.html\",\n\/\/ \"complex-keys.html\", \/\/ Output too big for a cookie. crbug.com\/33472\n\/\/ \"complex-values.html\", \/\/ crbug.com\/33472\n \"quota.html\",\n \"remove-item.html\",\n \"window-attributes-exist.html\",\n NULL\n};\n\nstatic const char* kEventsFiles[] = {\n\/\/ \"basic-body-attribute.html\", \/\/ crbug.com\/33472\n\/\/ \"basic.html\", \/\/ crbug.com\/33472\n\/\/ \"basic-setattribute.html\", \/\/ crbug.com\/33472\n \"case-sensitive.html\",\n \"documentURI.html\",\n NULL\n};\n\nstatic const char* kStorageFiles[] = {\n \"delete-removal.html\",\n \"enumerate-storage.html\",\n \"enumerate-with-length-and-key.html\",\n \"index-get-and-set.html\",\n \"simple-usage.html\",\n \"string-conversion.html\",\n\/\/ \"window-open.html\", \/\/ TODO(jorlow): Fix\n NULL\n};\n\nclass DOMStorageTest : public UILayoutTest {\n protected:\n DOMStorageTest()\n : UILayoutTest(),\n test_dir_(FilePath().\n AppendASCII(\"storage\").AppendASCII(\"domstorage\")) {\n }\n\n virtual ~DOMStorageTest() { }\n\n virtual void SetUp() {\n launch_arguments_.AppendSwitch(switches::kDisablePopupBlocking);\n UILayoutTest::SetUp();\n }\n\n \/\/ We require fast\/js\/resources for most of the DOM Storage layout tests.\n \/\/ Add those to the list to be copied.\n void AddJSTestResources() {\n \/\/ Add other paths our tests require.\n FilePath js_dir = FilePath().\n AppendASCII(\"fast\").AppendASCII(\"js\");\n AddResourceForLayoutTest(js_dir, FilePath().AppendASCII(\"resources\"));\n }\n\n \/\/ This is somewhat of a hack because we're running a real browser that\n \/\/ actually persists the LocalStorage state vs. DRT and TestShell which don't.\n \/\/ The correct fix is to fix the LayoutTests, but similar patches have been\n \/\/ rejected in the past.\n void ClearDOMStorage() {\n scoped_refptr<TabProxy> tab(GetActiveTab());\n ASSERT_TRUE(tab.get());\n\n const FilePath dir(FILE_PATH_LITERAL(\"layout_tests\"));\n const FilePath file(FILE_PATH_LITERAL(\"clear_dom_storage.html\"));\n GURL url = ui_test_utils::GetTestUrl(dir, file);\n ASSERT_TRUE(tab->SetCookie(url, \"\"));\n ASSERT_TRUE(tab->NavigateToURL(url));\n\n WaitUntilCookieNonEmpty(tab.get(), url, \"cleared\",\n TestTimeouts::action_max_timeout_ms());\n }\n\n \/\/ Runs each test in an array of strings until it hits a NULL.\n void RunTests(const char** files) {\n while (*files) {\n ClearDOMStorage();\n RunLayoutTest(*files, kNoHttpPort);\n ++files;\n }\n }\n\n FilePath test_dir_;\n};\n\n\nTEST_F(DOMStorageTest, RootLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath(), kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"script-tests\"));\n RunTests(kRootFiles);\n}\n\nTEST_F(DOMStorageTest, EventLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\").\n AppendASCII(\"resources\"));\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\").\n AppendASCII(\"script-tests\"));\n RunTests(kEventsFiles);\n}\n\nTEST_F(DOMStorageTest, LocalStorageLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"localstorage\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"localstorage\").\n AppendASCII(\"resources\"));\n RunTests(kStorageFiles);\n}\n\nTEST_F(DOMStorageTest, SessionStorageLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"sessionstorage\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"sessionstorage\").\n AppendASCII(\"resources\"));\n RunTests(kStorageFiles);\n}\n\nclass DomStorageEmptyDatabaseTest : public UITest {\n protected:\n FilePath StorageDir() const {\n FilePath storage_dir = user_data_dir();\n storage_dir = storage_dir.AppendASCII(\"Default\");\n storage_dir = storage_dir.AppendASCII(\"Local Storage\");\n return storage_dir;\n }\n\n bool StorageDirIsEmpty() const {\n FilePath storage_dir = StorageDir();\n if (!file_util::DirectoryExists(storage_dir))\n return true;\n return file_util::IsDirectoryEmpty(storage_dir);\n }\n\n GURL TestUrl() const {\n FilePath test_dir = test_data_directory_;\n FilePath test_file = test_dir.AppendASCII(\"dom_storage_empty_db.html\");\n return net::FilePathToFileURL(test_file);\n }\n};\n\n\/\/ Fails, see http:\/\/crbug.com\/76008\nTEST_F(DomStorageEmptyDatabaseTest, FAILS_EmptyDirAfterClear) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:set()\"));\n NavigateToURL(GURL(\"javascript:clear()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n\nTEST_F(DomStorageEmptyDatabaseTest, EmptyDirAfterGet) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:get()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n\n\/\/ Flaky, see http:\/\/crbug.com\/73776\nTEST_F(DomStorageEmptyDatabaseTest, FLAKY_NonEmptyDirAfterSet) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:set()\"));\n QuitBrowser();\n EXPECT_FALSE(StorageDirIsEmpty());\n\n LaunchBrowserAndServer();\n NavigateToURL(TestUrl());\n NavigateToURL(GURL(\"javascript:clear()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n<commit_msg>Remove \"FAILS\" from DomStorageEmptyDatabaseTest.EmptyDirAfterClear.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"base\/test\/test_timeouts.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/ui\/ui_layout_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"net\/base\/net_util.h\"\n\nstatic const char* kRootFiles[] = {\n \"clear.html\",\n\/\/ \"complex-keys.html\", \/\/ Output too big for a cookie. crbug.com\/33472\n\/\/ \"complex-values.html\", \/\/ crbug.com\/33472\n \"quota.html\",\n \"remove-item.html\",\n \"window-attributes-exist.html\",\n NULL\n};\n\nstatic const char* kEventsFiles[] = {\n\/\/ \"basic-body-attribute.html\", \/\/ crbug.com\/33472\n\/\/ \"basic.html\", \/\/ crbug.com\/33472\n\/\/ \"basic-setattribute.html\", \/\/ crbug.com\/33472\n \"case-sensitive.html\",\n \"documentURI.html\",\n NULL\n};\n\nstatic const char* kStorageFiles[] = {\n \"delete-removal.html\",\n \"enumerate-storage.html\",\n \"enumerate-with-length-and-key.html\",\n \"index-get-and-set.html\",\n \"simple-usage.html\",\n \"string-conversion.html\",\n\/\/ \"window-open.html\", \/\/ TODO(jorlow): Fix\n NULL\n};\n\nclass DOMStorageTest : public UILayoutTest {\n protected:\n DOMStorageTest()\n : UILayoutTest(),\n test_dir_(FilePath().\n AppendASCII(\"storage\").AppendASCII(\"domstorage\")) {\n }\n\n virtual ~DOMStorageTest() { }\n\n virtual void SetUp() {\n launch_arguments_.AppendSwitch(switches::kDisablePopupBlocking);\n UILayoutTest::SetUp();\n }\n\n \/\/ We require fast\/js\/resources for most of the DOM Storage layout tests.\n \/\/ Add those to the list to be copied.\n void AddJSTestResources() {\n \/\/ Add other paths our tests require.\n FilePath js_dir = FilePath().\n AppendASCII(\"fast\").AppendASCII(\"js\");\n AddResourceForLayoutTest(js_dir, FilePath().AppendASCII(\"resources\"));\n }\n\n \/\/ This is somewhat of a hack because we're running a real browser that\n \/\/ actually persists the LocalStorage state vs. DRT and TestShell which don't.\n \/\/ The correct fix is to fix the LayoutTests, but similar patches have been\n \/\/ rejected in the past.\n void ClearDOMStorage() {\n scoped_refptr<TabProxy> tab(GetActiveTab());\n ASSERT_TRUE(tab.get());\n\n const FilePath dir(FILE_PATH_LITERAL(\"layout_tests\"));\n const FilePath file(FILE_PATH_LITERAL(\"clear_dom_storage.html\"));\n GURL url = ui_test_utils::GetTestUrl(dir, file);\n ASSERT_TRUE(tab->SetCookie(url, \"\"));\n ASSERT_TRUE(tab->NavigateToURL(url));\n\n WaitUntilCookieNonEmpty(tab.get(), url, \"cleared\",\n TestTimeouts::action_max_timeout_ms());\n }\n\n \/\/ Runs each test in an array of strings until it hits a NULL.\n void RunTests(const char** files) {\n while (*files) {\n ClearDOMStorage();\n RunLayoutTest(*files, kNoHttpPort);\n ++files;\n }\n }\n\n FilePath test_dir_;\n};\n\n\nTEST_F(DOMStorageTest, RootLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath(), kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"script-tests\"));\n RunTests(kRootFiles);\n}\n\nTEST_F(DOMStorageTest, EventLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\").\n AppendASCII(\"resources\"));\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"events\").\n AppendASCII(\"script-tests\"));\n RunTests(kEventsFiles);\n}\n\nTEST_F(DOMStorageTest, LocalStorageLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"localstorage\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"localstorage\").\n AppendASCII(\"resources\"));\n RunTests(kStorageFiles);\n}\n\nTEST_F(DOMStorageTest, SessionStorageLayoutTests) {\n InitializeForLayoutTest(test_dir_, FilePath().AppendASCII(\"sessionstorage\"),\n kNoHttpPort);\n AddJSTestResources();\n AddResourceForLayoutTest(test_dir_, FilePath().AppendASCII(\"sessionstorage\").\n AppendASCII(\"resources\"));\n RunTests(kStorageFiles);\n}\n\nclass DomStorageEmptyDatabaseTest : public UITest {\n protected:\n FilePath StorageDir() const {\n FilePath storage_dir = user_data_dir();\n storage_dir = storage_dir.AppendASCII(\"Default\");\n storage_dir = storage_dir.AppendASCII(\"Local Storage\");\n return storage_dir;\n }\n\n bool StorageDirIsEmpty() const {\n FilePath storage_dir = StorageDir();\n if (!file_util::DirectoryExists(storage_dir))\n return true;\n return file_util::IsDirectoryEmpty(storage_dir);\n }\n\n GURL TestUrl() const {\n FilePath test_dir = test_data_directory_;\n FilePath test_file = test_dir.AppendASCII(\"dom_storage_empty_db.html\");\n return net::FilePathToFileURL(test_file);\n }\n};\n\nTEST_F(DomStorageEmptyDatabaseTest, EmptyDirAfterClear) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:set()\"));\n NavigateToURL(GURL(\"javascript:clear()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n\nTEST_F(DomStorageEmptyDatabaseTest, EmptyDirAfterGet) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:get()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n\n\/\/ Flaky, see http:\/\/crbug.com\/73776\nTEST_F(DomStorageEmptyDatabaseTest, FLAKY_NonEmptyDirAfterSet) {\n NavigateToURL(TestUrl());\n ASSERT_TRUE(StorageDirIsEmpty());\n\n NavigateToURL(GURL(\"javascript:set()\"));\n QuitBrowser();\n EXPECT_FALSE(StorageDirIsEmpty());\n\n LaunchBrowserAndServer();\n NavigateToURL(TestUrl());\n NavigateToURL(GURL(\"javascript:clear()\"));\n QuitBrowser();\n EXPECT_TRUE(StorageDirIsEmpty());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2011 Ivan Cukic <ivan.cukic(at)kde.org>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License version 2,\n * or (at your option) any later version, as published by the Free\n * Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"Documents.h\"\n#include \"Documents_p.h\"\n#include \"rankingsclientadaptor.h\"\n\n#include <QList>\n#include <QDBusConnection>\n#include <QDesktopServices>\n\n#include <Nepomuk\/Resource>\n#include <Nepomuk\/Variant>\n\n#include <KDebug>\n#include <KUrl>\n#include <KFileItem>\n\n#include \"nfo.h\"\n#include \"nie.h\"\n#include \"kext.h\"\n\n#define KAMD_DBUS_ADDRESS \"org.kde.kactivitymanagerd\"\n\nusing namespace Nepomuk::Vocabulary;\n\n\/\/ Private\n\nDocumentsEnginePrivate::DocumentsEnginePrivate(DocumentsEngine * parent)\n : q(parent)\n{\n activitymanager = new KActivities::Consumer(this);\n\n QDBusConnection dbus = QDBusConnection::sessionBus();\n\n \/\/ Making us visible on d-bus\n new RankingsClientAdaptor(this);\n \/\/ kDebug() << \"registering the client\" <<\n dbus.registerObject(\"\/RankingsClient\", this);\n\n if (dbus.interface()->isServiceRegistered(KAMD_DBUS_ADDRESS)) {\n serviceOnline();\n }\n\n QDBusServiceWatcher * watcher = new QDBusServiceWatcher(\n KAMD_DBUS_ADDRESS, dbus,\n QDBusServiceWatcher::WatchForRegistration | QDBusServiceWatcher::WatchForUnregistration,\n this\n );\n connect(watcher, SIGNAL(serviceRegistered(QString)),\n this, SLOT(serviceOnline()));\n connect(watcher, SIGNAL(serviceUnregistered(QString)),\n this, SLOT(serviceOffline()));\n}\n\nvoid DocumentsEnginePrivate::serviceOnline()\n{\n kDebug() << KAMD_DBUS_ADDRESS << \"went online\";\n\n QDBusInterface rankingsservice(KAMD_DBUS_ADDRESS,\n \"\/Rankings\", \"org.kde.ActivityManager.Rankings\");\n\n rankingsservice.asyncCall(\"registerClient\", \"org.kde.Contour\", QString(), \"nao:Document\");\n}\n\nvoid DocumentsEnginePrivate::serviceOffline()\n{\n kDebug() << KAMD_DBUS_ADDRESS << \"went offline\";\n\n q->recommendationsUpdated(QList<Contour::RecommendationItem>());\n}\n\nDocumentsEnginePrivate::~DocumentsEnginePrivate()\n{\n}\n\nvoid DocumentsEnginePrivate::updated(const QVariantList & data)\n{\n kDebug() << \"@@@@@@@@@@@@@@@@@@\" << data;\n recommendations.clear();\n\n double score = 1.0;\n\n foreach (const QVariant & item, data) {\n Nepomuk::Resource resource(KUrl(item.toString()));\n\n \/\/ The problem is when the resource has no particular type set (web page)\n \/\/ if (!resource.hasType(Nepomuk::Vocabulary::NFO::FileDataObject())) continue;\n\n Nepomuk::Resource currentActivityResource(activitymanager->currentActivity(), KEXT::Activity());\n\n \/\/ TODO: See ActivityManager.coo\n \/\/ I'd like a resource isRelated activity more than vice-versa\n \/\/ but the active models are checking for the other way round.\n \/\/ It is defined in the ontologies as a symmetric relation, but\n \/\/ Nepomuk doesn't care about that.\n\n \/\/ if (resource.isRelateds().contains(currentActivityResource)) continue;\n if (currentActivityResource.isRelateds().contains(resource)) continue;\n\n Contour::RecommendationItem recommendation;\n\n recommendation.score = score;\n recommendation.id = item.toString();\n score \/= 2;\n\n recommendation.title = resource.genericLabel();\n recommendation.description = i18n(\"Open and add to the current activity\");\n recommendation.icon = resource.genericIcon();\n\n if (recommendation.icon.isEmpty()) {\n KFileItem fileItem(KFileItem::Unknown, KFileItem::Unknown,\n KUrl(resource.property(Nepomuk::Vocabulary::NIE::url()).toString()));\n recommendation.icon = fileItem.iconName();\n }\n\n kDebug() << recommendation;\n\n recommendations << recommendation;\n\n if (recommendations.size() >= 10) break;\n\n }\n\n q->recommendationsUpdated(recommendations);\n\n}\n\nvoid DocumentsEnginePrivate::removeRecommendation(const QString & id)\n{\n for (int i = 0; i < recommendations.size(); i++) {\n if (recommendations[i].id == id) {\n recommendations.removeAt(i);\n break;\n }\n }\n}\n\nvoid DocumentsEnginePrivate::inserted(int position, const QVariantList & item)\n{\n}\n\nvoid DocumentsEnginePrivate::removed(int position)\n{\n}\n\nvoid DocumentsEnginePrivate::changed(int position, const QVariantList & item)\n{\n}\n\n\n\/\/ DocumentsEngine\n\nDocumentsEngine::DocumentsEngine(QObject * parent, const QVariantList & args)\n : Contour::RecommendationEngine(parent), d(new DocumentsEnginePrivate(this))\n{\n}\n\nDocumentsEngine::~DocumentsEngine()\n{\n delete d;\n}\n\nvoid DocumentsEngine::init()\n{\n Contour::RecommendationEngine::init();\n\n emit recommendationsUpdated(d->recommendations);\n}\n\nvoid DocumentsEngine::activate(const QString & id, const QString & action)\n{\n KUrl url(id);\n\n d->removeRecommendation(id);\n\n d->activitymanager->linkResourceToActivity(url);\n\n QDesktopServices::openUrl(url);\n\n}\n\nRECOMMENDATION_EXPORT_PLUGIN(DocumentsEngine, \"contour_recommendationengine_documents\")\n\n<commit_msg>Removing selected recommendation<commit_after>\/*\n * Copyright (C) 2011 Ivan Cukic <ivan.cukic(at)kde.org>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License version 2,\n * or (at your option) any later version, as published by the Free\n * Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include \"Documents.h\"\n#include \"Documents_p.h\"\n#include \"rankingsclientadaptor.h\"\n\n#include <QList>\n#include <QDBusConnection>\n#include <QDesktopServices>\n\n#include <Nepomuk\/Resource>\n#include <Nepomuk\/Variant>\n\n#include <KDebug>\n#include <KUrl>\n#include <KFileItem>\n\n#include \"nfo.h\"\n#include \"nie.h\"\n#include \"kext.h\"\n\n#define KAMD_DBUS_ADDRESS \"org.kde.kactivitymanagerd\"\n\nusing namespace Nepomuk::Vocabulary;\n\n\/\/ Private\n\nDocumentsEnginePrivate::DocumentsEnginePrivate(DocumentsEngine * parent)\n : q(parent)\n{\n activitymanager = new KActivities::Consumer(this);\n\n QDBusConnection dbus = QDBusConnection::sessionBus();\n\n \/\/ Making us visible on d-bus\n new RankingsClientAdaptor(this);\n \/\/ kDebug() << \"registering the client\" <<\n dbus.registerObject(\"\/RankingsClient\", this);\n\n if (dbus.interface()->isServiceRegistered(KAMD_DBUS_ADDRESS)) {\n serviceOnline();\n }\n\n QDBusServiceWatcher * watcher = new QDBusServiceWatcher(\n KAMD_DBUS_ADDRESS, dbus,\n QDBusServiceWatcher::WatchForRegistration | QDBusServiceWatcher::WatchForUnregistration,\n this\n );\n connect(watcher, SIGNAL(serviceRegistered(QString)),\n this, SLOT(serviceOnline()));\n connect(watcher, SIGNAL(serviceUnregistered(QString)),\n this, SLOT(serviceOffline()));\n}\n\nvoid DocumentsEnginePrivate::serviceOnline()\n{\n kDebug() << KAMD_DBUS_ADDRESS << \"went online\";\n\n QDBusInterface rankingsservice(KAMD_DBUS_ADDRESS,\n \"\/Rankings\", \"org.kde.ActivityManager.Rankings\");\n\n rankingsservice.asyncCall(\"registerClient\", \"org.kde.Contour\", QString(), \"nao:Document\");\n}\n\nvoid DocumentsEnginePrivate::serviceOffline()\n{\n kDebug() << KAMD_DBUS_ADDRESS << \"went offline\";\n\n q->recommendationsUpdated(QList<Contour::RecommendationItem>());\n}\n\nDocumentsEnginePrivate::~DocumentsEnginePrivate()\n{\n}\n\nvoid DocumentsEnginePrivate::updated(const QVariantList & data)\n{\n kDebug() << \"@@@@@@@@@@@@@@@@@@\" << data;\n recommendations.clear();\n\n double score = 1.0;\n\n foreach (const QVariant & item, data) {\n Nepomuk::Resource resource(KUrl(item.toString()));\n\n \/\/ The problem is when the resource has no particular type set (web page)\n \/\/ if (!resource.hasType(Nepomuk::Vocabulary::NFO::FileDataObject())) continue;\n\n Nepomuk::Resource currentActivityResource(activitymanager->currentActivity(), KEXT::Activity());\n\n \/\/ TODO: See ActivityManager.coo\n \/\/ I'd like a resource isRelated activity more than vice-versa\n \/\/ but the active models are checking for the other way round.\n \/\/ It is defined in the ontologies as a symmetric relation, but\n \/\/ Nepomuk doesn't care about that.\n\n \/\/ if (resource.isRelateds().contains(currentActivityResource)) continue;\n if (currentActivityResource.isRelateds().contains(resource)) continue;\n\n Contour::RecommendationItem recommendation;\n\n recommendation.score = score;\n recommendation.id = item.toString();\n score \/= 2;\n\n recommendation.title = resource.genericLabel();\n recommendation.description = i18n(\"Open and add to the current activity\");\n recommendation.icon = resource.genericIcon();\n\n if (recommendation.icon.isEmpty()) {\n KFileItem fileItem(KFileItem::Unknown, KFileItem::Unknown,\n KUrl(resource.property(Nepomuk::Vocabulary::NIE::url()).toString()));\n recommendation.icon = fileItem.iconName();\n }\n\n kDebug()\n << \"score:\" << recommendation.score\n << \"id:\" << recommendation.id\n << \"title:\" << recommendation.title\n << \"description:\" << recommendation.description\n ;\n\n recommendations << recommendation;\n\n if (recommendations.size() >= 10) break;\n\n }\n\n q->recommendationsUpdated(recommendations);\n\n}\n\nvoid DocumentsEnginePrivate::removeRecommendation(const QString & id)\n{\n \/\/ kDebug() << \"removing\" << id;\n\n for (int i = 0; i < recommendations.size(); i++) {\n if (recommendations[i].id == id) {\n \/\/ kDebug() << \"before removal:\" << recommendations;\n recommendations.removeAt(i);\n \/\/ kDebug() << \"after removal:\" << recommendations;\n break;\n }\n }\n}\n\nvoid DocumentsEnginePrivate::inserted(int position, const QVariantList & item)\n{\n}\n\nvoid DocumentsEnginePrivate::removed(int position)\n{\n}\n\nvoid DocumentsEnginePrivate::changed(int position, const QVariantList & item)\n{\n}\n\n\n\/\/ DocumentsEngine\n\nDocumentsEngine::DocumentsEngine(QObject * parent, const QVariantList & args)\n : Contour::RecommendationEngine(parent), d(new DocumentsEnginePrivate(this))\n{\n}\n\nDocumentsEngine::~DocumentsEngine()\n{\n delete d;\n}\n\nvoid DocumentsEngine::init()\n{\n Contour::RecommendationEngine::init();\n\n emit recommendationsUpdated(d->recommendations);\n}\n\nvoid DocumentsEngine::activate(const QString & id, const QString & action)\n{\n KUrl url(id);\n\n d->removeRecommendation(id);\n\n d->activitymanager->linkResourceToActivity(url);\n\n QDesktopServices::openUrl(url);\n\n recommendationsUpdated(d->recommendations);\n}\n\nRECOMMENDATION_EXPORT_PLUGIN(DocumentsEngine, \"contour_recommendationengine_documents\")\n\n<|endoftext|>"} {"text":"<commit_before>#include <mos\/gfx\/assets.hpp>\n#include <cstring>\n#include <filesystem\/path.h>\n#include <fstream>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/euler_angles.hpp>\n#include <glm\/gtx\/io.hpp>\n#include <glm\/gtx\/matrix_decompose.hpp>\n#include <mos\/util.hpp>\n#include <iostream>\n\nnamespace mos {\nnamespace gfx {\nusing namespace nlohmann;\n\nAssets::Assets(const std::string directory) : directory_(directory) {}\n\nAssets::~Assets() {}\n\nModel Assets::model_value(const std::string &base_path, const json &value, const glm::mat4 &parent_transform) {\n auto name = value.value(\"name\", \"\");\n auto mesh_name = std::string(\"\");\n if (!value[\"mesh\"].is_null()) {\n mesh_name = value.value(\"mesh\", \"\");\n }\n std::string material_name = \"\";\n if (!value[\"material\"].is_null()) {\n material_name = value.value(\"material\", \"\");\n }\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n\n auto created_model = Model(\n name, mesh(base_path + mesh_name),\n transform,\n material(base_path + material_name));\n\n for (auto &m : value[\"children\"]) {\n filesystem::path t = std::string(m);\n if(t.extension() == \"model\") {\n created_model.models.push_back(model(base_path + t.str()));\n }\n }\n return created_model;\n}\n\nModel Assets::model(const std::string &path, const glm::mat4 &parent_transform) {\n std::cout << \"Loading: \" << path << std::endl;\n filesystem::path fpath = path;\n auto doc = json::parse(mos::text(directory_ + path));\n\n return model_value(fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\", doc, parent_transform);\n}\n\nAnimation Assets::animation(const std::string &path) {\n auto doc = json::parse(mos::text(directory_ + path));\n auto frame_rate = doc[\"frame_rate\"];\n std::map<unsigned int, std::shared_ptr<Mesh const>> keyframes;\n\n for (auto &keyframe : doc[\"keyframes\"]) {\n auto key = keyframe[\"key\"];\n auto mesh_path = keyframe[\"mesh\"];\n keyframes.insert({key, mesh(mesh_path)});\n }\n Animation animation(keyframes, frame_rate);\n return animation;\n}\n\nstd::shared_ptr<Mesh> Assets::mesh(const std::string &path) {\n if (meshes_.find(path) == meshes_.end()) {\n meshes_.insert(MeshPair(path, Mesh::load(directory_ + path)));\n }\n return meshes_.at(path);\n}\n\nstd::shared_ptr<Texture2D>\nAssets::texture(const std::string &path,\n const bool color_data,\n const bool mipmaps,\n const Texture2D::Wrap &wrap) {\n if (!path.empty()) {\n if (textures_.find(path) == textures_.end()) {\n textures_.insert(TexturePair(path, Texture2D::load(directory_ + path, color_data, mipmaps, wrap)));\n }\n return textures_.at(path);\n } else {\n return std::shared_ptr<Texture2D>(nullptr);\n }\n}\n\nMaterial Assets::material(const std::string &path) {\n if (path.empty()) {\n return Material();\n } else {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"material\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto read_texture = [&](const std::string &name, const bool color_data = true) {\n std::string file_name = \"\";\n if (!value[name].is_null()) {\n file_name = value[name];\n }\n auto tex = file_name.empty() ? texture(\"\") : texture(base_path + file_name, color_data);\n return tex;\n };\n\n auto albedo_map = read_texture(\"albedo_map\");\n auto emission_map = read_texture(\"emission_map\");\n auto normal_map = read_texture(\"normal_map\");\n if (normal_map) {\n if (normal_map->format == Texture::Format::SRGB){\n normal_map->format = Texture::Format::RGB;\n }\n else if (normal_map->format == Texture::Format::SRGBA){\n normal_map->format = Texture::Format::RGBA;\n }\n \/\/normal_map->format = normal_map->format == Texture::Format::SRGB ? Texture::Format::RGB : Texture::Format::RGBA;\n }\n auto metallic_map = read_texture(\"metallic_map\");\n auto roughness_map = read_texture(\"roughness_map\");\n auto ambient_occlusion_map = read_texture(\"ambient_occlusion_map\");\n\n auto diffuse = glm::vec3(value[\"albedo\"][0], value[\"albedo\"][1], value[\"albedo\"][2]);\n auto opacity = value[\"opacity\"];\n auto roughness = value[\"roughness\"];\n auto metallic = value[\"metallic\"];\n auto emission = glm::vec3(value[\"emission\"][0], value[\"emission\"][1], value[\"emission\"][2]);\n auto ambient_occlusion = value[\"ambient_occlusion\"];\n return Material(albedo_map,\n emission_map,\n normal_map,\n metallic_map,\n roughness_map,\n ambient_occlusion_map,\n diffuse,\n opacity,\n roughness,\n metallic,\n emission);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n }\n}\n\nLight Assets::light(const std::string &path, const glm::mat4 &parent_transform) {\n if (path.empty()) {\n return Light();\n } else {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"light\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n auto position = glm::vec3(transform[3]);\n auto center = position + glm::vec3(transform * glm::vec4(0.0f, 0.0f, -1.0f, 0.0f));\n\n\t std::string t = value[\"light\"];\n auto data_value = json::parse(mos::text(directory_ + t));\n\n auto color = glm::vec3(data_value[\"color\"][0],\n data_value[\"color\"][1],\n data_value[\"color\"][2]);\n auto strength = data_value[\"strength\"];\n auto size = data_value[\"size\"];\n auto blend = value[\"blend\"];\n\n return Light(position,\n center,\n size,\n color,\n strength);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n }\n}\n\nEnvironmentLight Assets::environment_light(const std::string &path, const glm::mat4 &parent_transform) {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"environment_light\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n\n auto position = glm::vec3(transform[3]);\n\n glm::vec3 scale;\n glm::quat rotation;\n glm::vec3 translation;\n glm::vec3 skew;\n glm::vec4 perspective;\n glm::decompose(transform, scale, rotation, translation, skew, perspective);\n\n auto extent = float(value[\"extent\"]) * scale;\n auto strength = value.value(\"strength\", 1.0f);\n auto resolution = value.value(\"resolution\", 128.0f);\n\n return EnvironmentLight(position,\n extent,\n strength);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n}\n\nvoid Assets::clear_unused() {\n for (auto it = textures_.begin(); it != textures_.end();) {\n if (it->second.use_count() <= 1) {\n textures_.erase(it++);\n } else {\n ++it;\n }\n }\n for (auto it = meshes_.begin(); it != meshes_.end();) {\n if (it->second.use_count() <= 1) {\n meshes_.erase(it++);\n } else {\n ++it;\n }\n }\n}\nstd::string Assets::directory() const {\n return directory_;\n}\n\n}\n}\n<commit_msg>Nullptr<commit_after>#include <mos\/gfx\/assets.hpp>\n#include <cstring>\n#include <filesystem\/path.h>\n#include <fstream>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/euler_angles.hpp>\n#include <glm\/gtx\/io.hpp>\n#include <glm\/gtx\/matrix_decompose.hpp>\n#include <mos\/util.hpp>\n#include <iostream>\n\nnamespace mos {\nnamespace gfx {\nusing namespace nlohmann;\n\nAssets::Assets(const std::string directory) : directory_(directory) {}\n\nAssets::~Assets() {}\n\nModel Assets::model_value(const std::string &base_path, const json &value, const glm::mat4 &parent_transform) {\n auto name = value.value(\"name\", \"\");\n auto mesh_name = std::string(\"\");\n if (!value[\"mesh\"].is_null()) {\n mesh_name = value.value(\"mesh\", \"\");\n }\n std::string material_name = \"\";\n if (!value[\"material\"].is_null()) {\n material_name = value.value(\"material\", \"\");\n }\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n\n auto created_model = Model(\n name, mesh(base_path + mesh_name),\n transform,\n material(base_path + material_name));\n\n for (auto &m : value[\"children\"]) {\n filesystem::path t = std::string(m);\n if(t.extension() == \"model\") {\n created_model.models.push_back(model(base_path + t.str()));\n }\n }\n return created_model;\n}\n\nModel Assets::model(const std::string &path, const glm::mat4 &parent_transform) {\n std::cout << \"Loading: \" << path << std::endl;\n filesystem::path fpath = path;\n auto doc = json::parse(mos::text(directory_ + path));\n\n return model_value(fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\", doc, parent_transform);\n}\n\nAnimation Assets::animation(const std::string &path) {\n auto doc = json::parse(mos::text(directory_ + path));\n auto frame_rate = doc[\"frame_rate\"];\n std::map<unsigned int, std::shared_ptr<Mesh const>> keyframes;\n\n for (auto &keyframe : doc[\"keyframes\"]) {\n auto key = keyframe[\"key\"];\n auto mesh_path = keyframe[\"mesh\"];\n keyframes.insert({key, mesh(mesh_path)});\n }\n Animation animation(keyframes, frame_rate);\n return animation;\n}\n\nstd::shared_ptr<Mesh> Assets::mesh(const std::string &path) {\n if (path.empty()){\n return SharedMesh(nullptr);\n }\n if (meshes_.find(path) == meshes_.end()) {\n meshes_.insert(MeshPair(path, Mesh::load(directory_ + path)));\n }\n return meshes_.at(path);\n}\n\nstd::shared_ptr<Texture2D>\nAssets::texture(const std::string &path,\n const bool color_data,\n const bool mipmaps,\n const Texture2D::Wrap &wrap) {\n if (!path.empty()) {\n if (textures_.find(path) == textures_.end()) {\n textures_.insert(TexturePair(path, Texture2D::load(directory_ + path, color_data, mipmaps, wrap)));\n }\n return textures_.at(path);\n } else {\n return SharedTexture2D(nullptr);\n }\n}\n\nMaterial Assets::material(const std::string &path) {\n if (path.empty()) {\n return Material();\n } else {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"material\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto read_texture = [&](const std::string &name, const bool color_data = true) {\n std::string file_name = \"\";\n if (!value[name].is_null()) {\n file_name = value[name];\n }\n auto tex = file_name.empty() ? texture(\"\") : texture(base_path + file_name, color_data);\n return tex;\n };\n\n auto albedo_map = read_texture(\"albedo_map\");\n auto emission_map = read_texture(\"emission_map\");\n auto normal_map = read_texture(\"normal_map\");\n if (normal_map) {\n if (normal_map->format == Texture::Format::SRGB){\n normal_map->format = Texture::Format::RGB;\n }\n else if (normal_map->format == Texture::Format::SRGBA){\n normal_map->format = Texture::Format::RGBA;\n }\n \/\/normal_map->format = normal_map->format == Texture::Format::SRGB ? Texture::Format::RGB : Texture::Format::RGBA;\n }\n auto metallic_map = read_texture(\"metallic_map\");\n auto roughness_map = read_texture(\"roughness_map\");\n auto ambient_occlusion_map = read_texture(\"ambient_occlusion_map\");\n\n auto diffuse = glm::vec3(value[\"albedo\"][0], value[\"albedo\"][1], value[\"albedo\"][2]);\n auto opacity = value[\"opacity\"];\n auto roughness = value[\"roughness\"];\n auto metallic = value[\"metallic\"];\n auto emission = glm::vec3(value[\"emission\"][0], value[\"emission\"][1], value[\"emission\"][2]);\n auto ambient_occlusion = value[\"ambient_occlusion\"];\n return Material(albedo_map,\n emission_map,\n normal_map,\n metallic_map,\n roughness_map,\n ambient_occlusion_map,\n diffuse,\n opacity,\n roughness,\n metallic,\n emission);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n }\n}\n\nLight Assets::light(const std::string &path, const glm::mat4 &parent_transform) {\n if (path.empty()) {\n return Light();\n } else {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"light\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n auto position = glm::vec3(transform[3]);\n auto center = position + glm::vec3(transform * glm::vec4(0.0f, 0.0f, -1.0f, 0.0f));\n\n\t std::string t = value[\"light\"];\n auto data_value = json::parse(mos::text(directory_ + t));\n\n auto color = glm::vec3(data_value[\"color\"][0],\n data_value[\"color\"][1],\n data_value[\"color\"][2]);\n auto strength = data_value[\"strength\"];\n auto size = data_value[\"size\"];\n auto blend = value[\"blend\"];\n\n return Light(position,\n center,\n size,\n color,\n strength);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n }\n}\n\nEnvironmentLight Assets::environment_light(const std::string &path, const glm::mat4 &parent_transform) {\n filesystem::path fpath = path;\n auto base_path = fpath.parent_path().empty() ? \"\" : fpath.parent_path().str() + \"\/\";\n\n if (fpath.extension() == \"environment_light\") {\n auto value = json::parse(mos::text(directory_ + fpath.str()));\n\n auto transform = parent_transform * jsonarray_to_mat4(value[\"transform\"]);\n\n auto position = glm::vec3(transform[3]);\n\n glm::vec3 scale;\n glm::quat rotation;\n glm::vec3 translation;\n glm::vec3 skew;\n glm::vec4 perspective;\n glm::decompose(transform, scale, rotation, translation, skew, perspective);\n\n auto extent = float(value[\"extent\"]) * scale;\n auto strength = value.value(\"strength\", 1.0f);\n auto resolution = value.value(\"resolution\", 128.0f);\n\n return EnvironmentLight(position,\n extent,\n strength);\n } else {\n throw std::runtime_error(path.substr(path.find_last_of(\".\")) +\n \" file format is not supported.\");\n }\n}\n\nvoid Assets::clear_unused() {\n for (auto it = textures_.begin(); it != textures_.end();) {\n if (it->second.use_count() <= 1) {\n textures_.erase(it++);\n } else {\n ++it;\n }\n }\n for (auto it = meshes_.begin(); it != meshes_.end();) {\n if (it->second.use_count() <= 1) {\n meshes_.erase(it++);\n } else {\n ++it;\n }\n }\n}\nstd::string Assets::directory() const {\n return directory_;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n\n#include \"VisitorUtils.hpp\"\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Printer.hpp\"\n#include \"mtac\/TemporaryAllocator.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/VariableOptimizations.hpp\"\n#include \"mtac\/FunctionOptimizations.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/BasicBlockOptimizations.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/ConcatReduction.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_optimizations.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/RemoveAssign.hpp\"\n#include \"mtac\/RemoveMultipleAssign.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nconst unsigned int MAX_THREADS = 2;\n\ntemplate<typename Visitor>\nbool apply_to_all(std::shared_ptr<mtac::Function> function){\n Visitor visitor;\n\n mtac::visit_all_statements(visitor, function);\n\n return visitor.optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks_two_pass(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visitor.pass = mtac::Pass::DATA_MINING;\n\n visit_each(visitor, block->statements);\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Problem, typename... Args>\nbool data_flow_optimization(std::shared_ptr<mtac::Function> function, Args... args){\n bool optimized = false;\n\n Problem problem(args...);\n\n auto results = mtac::data_flow(function, problem);\n\n \/\/Once the data-flow problem is fixed, statements can be optimized\n for(auto& block : function->getBasicBlocks()){\n for(auto& statement : block->statements){\n optimized |= problem.optimize(statement, results);\n }\n }\n\n return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n if(b){\n log::emit<Debug>(\"Optimizer\") << \"Optimization\" << name << \" returned true\" << log::endl;\n\n \/\/Print the function\n print(function);\n } else {\n log::emit<Debug>(\"Optimizer\") << \"Optimization\" << name << \" returned false\" << log::endl;\n }\n }\n\n return b;\n}\n\ntemplate<typename Functor, typename... Args>\nbool debug(const std::string& name, Functor functor, std::shared_ptr<mtac::Function> function, Args... args){\n bool b;\n {\n PerfsTimer timer(name);\n\n b = functor(function, args...);\n }\n\n return debug(name, b, function);\n}\n\nvoid remove_nop(std::shared_ptr<mtac::Function> function){\n for(auto& block : function->getBasicBlocks()){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(unlikely(boost::get<std::shared_ptr<mtac::NoOp>>(&*it))){\n it.erase();\n continue;\n } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&*it)){\n if((*ptr)->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n }\n\n ++it;\n }\n }\n}\n\nvoid optimize_function(std::shared_ptr<mtac::Function> function, std::shared_ptr<StringPool> pool, Platform platform){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n bool optimized;\n do {\n optimized = false;\n\n optimized |= debug(\"Aritmetic Identities\", &apply_to_all<mtac::ArithmeticIdentities>, function);\n optimized |= debug(\"Reduce in Strength\", &apply_to_all<mtac::ReduceInStrength>, function);\n optimized |= debug(\"Constant folding\", &apply_to_all<mtac::ConstantFolding>, function);\n\n optimized |= debug(\"Constant propagation\", &data_flow_optimization<mtac::ConstantPropagationProblem>, function);\n optimized |= debug(\"Offset Constant Propagation\", &data_flow_optimization<mtac::OffsetConstantPropagationProblem, std::shared_ptr<StringPool>, Platform>, function, pool, platform);\n\n \/\/If there was optimizations here, better to try again before perfoming common subexpression\n if(optimized){\n continue;\n }\n\n optimized |= debug(\"Common Subexpression Elimination\", &data_flow_optimization<mtac::CommonSubexpressionElimination>, function);\n\n optimized |= debug(\"Pointer Propagation\", &apply_to_basic_blocks<mtac::PointerPropagation>, function);\n optimized |= debug(\"Math Propagation\", &apply_to_basic_blocks_two_pass<mtac::MathPropagation>, function);\n\n optimized |= debug(\"Optimize Branches\", &mtac::optimize_branches, function);\n optimized |= debug(\"Optimize Concat\", &mtac::optimize_concat, function, pool);\n optimized |= debug(\"Remove dead basic block\", &mtac::remove_dead_basic_blocks, function);\n optimized |= debug(\"Merge basic block\", &mtac::merge_basic_blocks, function);\n\n remove_nop(function);\n optimized |= debug(\"Dead-Code Elimination\", &mtac::dead_code_elimination, function);\n \n optimized |= debug(\"Remove aliases\", &mtac::remove_aliases, function);\n\n optimized |= debug(\"Loop Invariant Code Motion\", &mtac::loop_invariant_code_motion, function);\n } while (optimized);\n\n \/\/Remove variables that are not used after optimizations\n clean_variables(function);\n}\n\nvoid basic_optimize_function(std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start basic optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n debug(\"Constant folding\", apply_to_all<mtac::ConstantFolding>(function), function);\n}\n\nvoid optimize_all_functions(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration){\n PerfsTimer timer(\"Whole optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"dev\")){\n for(auto& function : functions){\n optimize_function(function, string_pool, platform);\n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &string_pool, platform, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n optimize_function(functions[i], string_pool, platform); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n bool optimized = false;\n do{\n mtac::remove_unused_functions(program);\n\n optimize_all_functions(program, string_pool, platform, configuration);\n\n optimized = mtac::remove_empty_functions(program);\n optimized = mtac::inline_functions(program, configuration);\n } while(optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n basic_optimize(program, string_pool, configuration);\n }\n \n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n}\n\nvoid mtac::Optimizer::basic_optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> \/*string_pool*\/, std::shared_ptr<Configuration> configuration) const {\n PerfsTimer timer(\"Whole basic optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"dev\")){\n for(auto& function : functions){\n basic_optimize_function(function); \n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n basic_optimize_function(functions[i]); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n<commit_msg>Activate loop strength reduction<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <memory>\n#include <thread>\n\n#include \"VisitorUtils.hpp\"\n#include \"Options.hpp\"\n#include \"PerfsTimer.hpp\"\n#include \"iterators.hpp\"\n#include \"likely.hpp\"\n#include \"logging.hpp\"\n\n#include \"mtac\/Utils.hpp\"\n#include \"mtac\/Pass.hpp\"\n#include \"mtac\/Optimizer.hpp\"\n#include \"mtac\/Program.hpp\"\n#include \"mtac\/Printer.hpp\"\n#include \"mtac\/TemporaryAllocator.hpp\"\n\n\/\/The custom optimizations\n#include \"mtac\/VariableOptimizations.hpp\"\n#include \"mtac\/FunctionOptimizations.hpp\"\n#include \"mtac\/DeadCodeElimination.hpp\"\n#include \"mtac\/BasicBlockOptimizations.hpp\"\n#include \"mtac\/BranchOptimizations.hpp\"\n#include \"mtac\/ConcatReduction.hpp\"\n#include \"mtac\/inlining.hpp\"\n#include \"mtac\/loop_optimizations.hpp\"\n\n\/\/The optimization visitors\n#include \"mtac\/ArithmeticIdentities.hpp\"\n#include \"mtac\/ReduceInStrength.hpp\"\n#include \"mtac\/ConstantFolding.hpp\"\n#include \"mtac\/RemoveAssign.hpp\"\n#include \"mtac\/RemoveMultipleAssign.hpp\"\n#include \"mtac\/MathPropagation.hpp\"\n#include \"mtac\/PointerPropagation.hpp\"\n\n\/\/The data-flow problems\n#include \"mtac\/GlobalOptimizations.hpp\"\n#include \"mtac\/ConstantPropagationProblem.hpp\"\n#include \"mtac\/OffsetConstantPropagationProblem.hpp\"\n#include \"mtac\/CommonSubexpressionElimination.hpp\"\n\nusing namespace eddic;\n\nnamespace {\n\nconst unsigned int MAX_THREADS = 2;\n\ntemplate<typename Visitor>\nbool apply_to_all(std::shared_ptr<mtac::Function> function){\n Visitor visitor;\n\n mtac::visit_all_statements(visitor, function);\n\n return visitor.optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Visitor>\nbool apply_to_basic_blocks_two_pass(std::shared_ptr<mtac::Function> function){\n bool optimized = false;\n\n for(auto& block : function->getBasicBlocks()){\n Visitor visitor;\n visitor.pass = mtac::Pass::DATA_MINING;\n\n visit_each(visitor, block->statements);\n\n visitor.pass = mtac::Pass::OPTIMIZE;\n\n visit_each(visitor, block->statements);\n\n optimized |= visitor.optimized;\n }\n\n return optimized;\n}\n\ntemplate<typename Problem, typename... Args>\nbool data_flow_optimization(std::shared_ptr<mtac::Function> function, Args... args){\n bool optimized = false;\n\n Problem problem(args...);\n\n auto results = mtac::data_flow(function, problem);\n\n \/\/Once the data-flow problem is fixed, statements can be optimized\n for(auto& block : function->getBasicBlocks()){\n for(auto& statement : block->statements){\n optimized |= problem.optimize(statement, results);\n }\n }\n\n return optimized;\n}\n\nbool debug(const std::string& name, bool b, std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n if(b){\n log::emit<Debug>(\"Optimizer\") << \"Optimization\" << name << \" returned true\" << log::endl;\n\n \/\/Print the function\n print(function);\n } else {\n log::emit<Debug>(\"Optimizer\") << \"Optimization\" << name << \" returned false\" << log::endl;\n }\n }\n\n return b;\n}\n\ntemplate<typename Functor, typename... Args>\nbool debug(const std::string& name, Functor functor, std::shared_ptr<mtac::Function> function, Args... args){\n bool b;\n {\n PerfsTimer timer(name);\n\n b = functor(function, args...);\n }\n\n return debug(name, b, function);\n}\n\nvoid remove_nop(std::shared_ptr<mtac::Function> function){\n for(auto& block : function->getBasicBlocks()){\n auto it = iterate(block->statements);\n\n while(it.has_next()){\n if(unlikely(boost::get<std::shared_ptr<mtac::NoOp>>(&*it))){\n it.erase();\n continue;\n } else if(auto* ptr = boost::get<std::shared_ptr<mtac::Quadruple>>(&*it)){\n if((*ptr)->op == mtac::Operator::NOP){\n it.erase();\n continue;\n }\n }\n\n ++it;\n }\n }\n}\n\nvoid optimize_function(std::shared_ptr<mtac::Function> function, std::shared_ptr<StringPool> pool, Platform platform){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n bool optimized;\n do {\n optimized = false;\n\n optimized |= debug(\"Aritmetic Identities\", &apply_to_all<mtac::ArithmeticIdentities>, function);\n optimized |= debug(\"Reduce in Strength\", &apply_to_all<mtac::ReduceInStrength>, function);\n optimized |= debug(\"Constant folding\", &apply_to_all<mtac::ConstantFolding>, function);\n\n optimized |= debug(\"Constant propagation\", &data_flow_optimization<mtac::ConstantPropagationProblem>, function);\n optimized |= debug(\"Offset Constant Propagation\", &data_flow_optimization<mtac::OffsetConstantPropagationProblem, std::shared_ptr<StringPool>, Platform>, function, pool, platform);\n\n \/\/If there was optimizations here, better to try again before perfoming common subexpression\n if(optimized){\n continue;\n }\n\n optimized |= debug(\"Common Subexpression Elimination\", &data_flow_optimization<mtac::CommonSubexpressionElimination>, function);\n\n optimized |= debug(\"Pointer Propagation\", &apply_to_basic_blocks<mtac::PointerPropagation>, function);\n optimized |= debug(\"Math Propagation\", &apply_to_basic_blocks_two_pass<mtac::MathPropagation>, function);\n\n optimized |= debug(\"Optimize Branches\", &mtac::optimize_branches, function);\n optimized |= debug(\"Optimize Concat\", &mtac::optimize_concat, function, pool);\n optimized |= debug(\"Remove dead basic block\", &mtac::remove_dead_basic_blocks, function);\n optimized |= debug(\"Merge basic block\", &mtac::merge_basic_blocks, function);\n\n remove_nop(function);\n optimized |= debug(\"Dead-Code Elimination\", &mtac::dead_code_elimination, function);\n \n optimized |= debug(\"Remove aliases\", &mtac::remove_aliases, function);\n\n optimized |= debug(\"Loop Invariant Code Motion\", &mtac::loop_invariant_code_motion, function);\n optimized |= debug(\"Loop Strength Reduction\", &mtac::loop_strength_reduction, function);\n } while (optimized);\n\n \/\/Remove variables that are not used after optimizations\n clean_variables(function);\n}\n\nvoid basic_optimize_function(std::shared_ptr<mtac::Function> function){\n if(log::enabled<Debug>()){\n log::emit<Debug>(\"Optimizer\") << \"Start basic optimizations on \" << function->getName() << log::endl;\n\n print(function);\n }\n\n debug(\"Constant folding\", apply_to_all<mtac::ConstantFolding>(function), function);\n}\n\nvoid optimize_all_functions(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration){\n PerfsTimer timer(\"Whole optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"dev\")){\n for(auto& function : functions){\n optimize_function(function, string_pool, platform);\n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &string_pool, platform, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n optimize_function(functions[i], string_pool, platform); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n\n} \/\/end of anonymous namespace\n\nvoid mtac::Optimizer::optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> string_pool, Platform platform, std::shared_ptr<Configuration> configuration) const {\n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n\n if(configuration->option_defined(\"fglobal-optimization\")){\n bool optimized = false;\n do{\n mtac::remove_unused_functions(program);\n\n optimize_all_functions(program, string_pool, platform, configuration);\n\n optimized = mtac::remove_empty_functions(program);\n optimized = mtac::inline_functions(program, configuration);\n } while(optimized);\n } else {\n \/\/Even if global optimizations are disabled, perform basic optimization (only constant folding)\n basic_optimize(program, string_pool, configuration);\n }\n \n \/\/Allocate storage for the temporaries that need to be stored\n allocate_temporary(program, platform);\n}\n\nvoid mtac::Optimizer::basic_optimize(std::shared_ptr<mtac::Program> program, std::shared_ptr<StringPool> \/*string_pool*\/, std::shared_ptr<Configuration> configuration) const {\n PerfsTimer timer(\"Whole basic optimizations\");\n\n auto& functions = program->functions;\n\n if(configuration->option_defined(\"dev\")){\n for(auto& function : functions){\n basic_optimize_function(function); \n }\n } else {\n \/\/Find a better heuristic to configure the number of threads\n std::size_t threads = std::min(functions.size(), static_cast<std::size_t>(MAX_THREADS));\n\n std::vector<std::thread> pool;\n for(std::size_t tid = 0; tid < threads; ++tid){\n pool.push_back(std::thread([tid, threads, &functions](){\n std::size_t i = tid;\n\n while(i < functions.size()){\n basic_optimize_function(functions[i]); \n\n i += threads;\n }\n }));\n }\n\n \/\/Wait for all the threads to finish\n std::for_each(pool.begin(), pool.end(), [](std::thread& thread){thread.join();});\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fan spinning wrong way<commit_after><|endoftext|>"} {"text":"<commit_before>\/************************************************************************\n*\n* Flood Project (2008-201x)\n* Licensed under the simplified BSD license. All rights reserved.\n*\n************************************************************************\/\n\n#pragma once\n\n#include \"Engine\/API.h\"\n#include \"Engine\/Texture\/TextureAtlas.h\"\n\nNAMESPACE_ENGINE_BEGIN\n\n\/\/-----------------------------------\/\/\n\nstatic const MaxRectsBinPack::FreeRectChoiceHeuristic gs_heuristic = \n MaxRectsBinPack::FreeRectChoiceHeuristic::RectBestAreaFit;\n\nTextureAtlas::TextureAtlas(uint maxSize)\n{\n atlasMaxSize = maxSize;\n atlasSize = std::min(maxSize, DefaultSize);\n rectanglePacker.Init(atlasSize,atlasSize);\n atlasImageHandle = ImageCreate(AllocatorGetHeap(),atlasSize,atlasSize,PixelFormat::R8G8B8A8);\n}\n\nstatic const int RBLOCK = 96;\n\n\/\/ We use this function to rotate images in-place since sometimes\n\/\/ the packing algorithm will rotate the image to have a better fit.\nstatic void RotateImage(Image* srcImage, Image* dstImage, Vector2i dstOffset)\n{\n assert(srcImage->getPixelFormat() == dstImage->getPixelFormat());\n\n int bpp = srcImage->getPixelSize();\n\n int srcWidth = srcImage->getWidth();\n int srcHeight = srcImage->getHeight();\n int dstWidth = srcHeight;\n int dstHeight = srcWidth;\n\n \/\/ get src and dst scan width\n int srcPitch = srcWidth*bpp;\n int dstPitch = dstImage->getWidth()*bpp;\n\n byte* bsrc = srcImage->getBuffer().data();\n byte* bdst = dstImage->getBuffer().data();\n\n for(int xs = 0; xs < dstWidth; xs += RBLOCK) { \/\/ for all image blocks of RBLOCK*RBLOCK pixels\n for(int ys = 0; ys < dstHeight; ys += RBLOCK) {\n for(int y = ys; y < std::min(dstHeight, ys + RBLOCK); y++) { \/\/ do rotation\n int y2 = dstHeight - y - 1;\n \/\/ point to src pixel at (y2, xs)\n byte* src_bits = bsrc + (xs * srcPitch) + (y2 * bpp);\n \/\/ point to dst pixel at (xs, y)\n byte* dst_bits = bdst + (( y + dstOffset.y) * dstPitch) + ((xs + dstOffset.x) * bpp);\n for (int x = xs; x < std::min(dstWidth, xs + RBLOCK); x++) {\n \/\/ dst.SetPixel(x, y, src.GetPixel(y2, x));\n for(int j = 0; j < bpp; j++) {\n dst_bits[j] = src_bits[j];\n }\n dst_bits += bpp;\n src_bits += srcPitch;\n }\n }\n }\n }\n}\n\nbool TextureAtlas::addImage(const ImageHandle& newImageHandle) \n{\n if(imageSubTextures.find( newImageHandle ) != imageSubTextures.end())\n return true;\n\n Image* newImage = newImageHandle.Resolve();\n\n Rect newRect = rectanglePacker.Insert(newImage->getWidth(), newImage->getHeight(), gs_heuristic);\n\n if (newRect.height == 0 || newRect.width == 0){\n if (atlasSize >= atlasMaxSize)\n return false;\n\n atlasSize = std::min(atlasSize*2, atlasMaxSize);\n resizeAtlas(atlasSize);\n\n return addImage(newImageHandle);\n }\n\n addImage(newImageHandle,newRect);\n\n return true;\n}\n\nbool TextureAtlas::getImageSubTexture(const ImageHandle& imageHandle, SubTexture& subTexture)\n{\n if(imageSubTextures.find( imageHandle ) == imageSubTextures.end())\n return false;\n\n subTexture = imageSubTextures[imageHandle];\n return true;\n}\n\nImageHandle TextureAtlas::getAtlasImageHandle() const\n{\n return atlasImageHandle;\n}\n\n\nvoid TextureAtlas::resizeAtlas(uint newSize)\n{\n rectanglePacker.Init(newSize,newSize);\n\n std::vector<Vector2i> rectSizes;\n std::vector<Rect> newRects;\n\n Image* atlasImage = atlasImageHandle.Resolve();\n\n std::map<ImageHandle, SubTexture>::iterator iter;\n for (iter = imageSubTextures.begin(); iter != imageSubTextures.end(); ++iter) {\n Vector2i rectSize;\n int width = (iter->second.rightBottomUV.x - iter->second.leftTopUV.x)*width;\n int height = (iter->second.rightBottomUV.y - iter->second.leftTopUV.y)*height;\n rectSize.x = width;\n rectSize.y = height;\n rectSizes.push_back(rectSize);\n }\n\n rectanglePacker.Insert(rectSizes, newRects, gs_heuristic);\n\n assert(newRects.size() == imageSubTextures.size());\n\n int i;\n for (i = 0, iter = imageSubTextures.begin(); iter != imageSubTextures.end(); ++iter, ++i) \n {\n ImageHandle newImageHandle = iter->first;\n Rect newRect = newRects[i];\n\n addImage(newImageHandle, newRect);\n }\n}\n\nvoid TextureAtlas::addImage(ImageHandle newImageHandle, Rect newRect)\n{\n Image* newImage = newImageHandle.Resolve();\n\n bool wasRotated = newImage->getWidth() == newRect.height &&\n newImage->getHeight() == newRect.width;\n\n Image* atlasImage = atlasImageHandle.Resolve();\n if (newImage->getPixelFormat() == atlasImage->getPixelFormat())\n {\n atlasImage->setBuffer(newImage,Vector2i(newRect.x,newRect.y));\n } \n else \n {\n assert(newImage->getPixelFormat() == PixelFormat::Depth &&\n atlasImage->getPixelFormat() == PixelFormat::R8G8B8A8);\n\n Image tmpImage(newImage->getWidth(),newImage->getHeight(),PixelFormat::R8G8B8A8);\n\n int newImageSize = newImage->getSize();\n std::vector<byte>& buffer = tmpImage.getBuffer();\n buffer.resize(newImageSize*4,0);\n\n for (int i = 0; i < newImageSize; i++)\n {\n buffer[i*4+3] = newImage->getBuffer()[i]; \/\/A\n }\n\n if (wasRotated)\n RotateImage(&tmpImage,atlasImage,Vector2i(newRect.x,newRect.y));\n else\n atlasImage->setBuffer(&tmpImage,Vector2i(newRect.x,newRect.y));\n }\n\n SubTexture subTexture;\n subTexture.atlas = this;\n\n float bottom = (float)(newRect.y+newRect.height)\/atlasSize;\n float top = (float)newRect.y\/atlasSize;\n float right = (float)(newRect.x+newRect.width)\/atlasSize;\n float left = (float)newRect.x\/atlasSize;\n\n if(!wasRotated)\n {\n subTexture.leftTopUV = Vector2(left,top);\n subTexture.rightTopUV = Vector2(right,top);\n subTexture.rightBottomUV = Vector2(right,bottom);\n subTexture.leftBottomUV = Vector2(left,bottom);\n } \n else \n {\n subTexture.rightTopUV = Vector2(left,top);\n subTexture.rightBottomUV = Vector2(right,top);\n subTexture.leftBottomUV = Vector2(right,bottom);\n subTexture.leftTopUV = Vector2(left,bottom);\n }\n\n imageSubTextures[newImageHandle] = subTexture;\n}\n\n\/\/-----------------------------------\/\/\n\nNAMESPACE_ENGINE_END<commit_msg>TextureAtlas now converts added images with PixelFormat::Depth to PixelFormat::R8G8B8A8 white images instead of black so vertex color can be applied<commit_after>\/************************************************************************\n*\n* Flood Project (2008-201x)\n* Licensed under the simplified BSD license. All rights reserved.\n*\n************************************************************************\/\n\n#pragma once\n\n#include \"Engine\/API.h\"\n#include \"Engine\/Texture\/TextureAtlas.h\"\n\nNAMESPACE_ENGINE_BEGIN\n\n\/\/-----------------------------------\/\/\n\nstatic const MaxRectsBinPack::FreeRectChoiceHeuristic gs_heuristic = \n MaxRectsBinPack::FreeRectChoiceHeuristic::RectBestAreaFit;\n\nTextureAtlas::TextureAtlas(uint maxSize)\n{\n atlasMaxSize = maxSize;\n atlasSize = std::min(maxSize, DefaultSize);\n rectanglePacker.Init(atlasSize,atlasSize);\n atlasImageHandle = ImageCreate(AllocatorGetHeap(),atlasSize,atlasSize,PixelFormat::R8G8B8A8);\n}\n\nstatic const int RBLOCK = 96;\n\n\/\/ We use this function to rotate images in-place since sometimes\n\/\/ the packing algorithm will rotate the image to have a better fit.\nstatic void RotateImage(Image* srcImage, Image* dstImage, Vector2i dstOffset)\n{\n assert(srcImage->getPixelFormat() == dstImage->getPixelFormat());\n\n int bpp = srcImage->getPixelSize();\n\n int srcWidth = srcImage->getWidth();\n int srcHeight = srcImage->getHeight();\n int dstWidth = srcHeight;\n int dstHeight = srcWidth;\n\n \/\/ get src and dst scan width\n int srcPitch = srcWidth*bpp;\n int dstPitch = dstImage->getWidth()*bpp;\n\n byte* bsrc = srcImage->getBuffer().data();\n byte* bdst = dstImage->getBuffer().data();\n\n for(int xs = 0; xs < dstWidth; xs += RBLOCK) { \/\/ for all image blocks of RBLOCK*RBLOCK pixels\n for(int ys = 0; ys < dstHeight; ys += RBLOCK) {\n for(int y = ys; y < std::min(dstHeight, ys + RBLOCK); y++) { \/\/ do rotation\n int y2 = dstHeight - y - 1;\n \/\/ point to src pixel at (y2, xs)\n byte* src_bits = bsrc + (xs * srcPitch) + (y2 * bpp);\n \/\/ point to dst pixel at (xs, y)\n byte* dst_bits = bdst + (( y + dstOffset.y) * dstPitch) + ((xs + dstOffset.x) * bpp);\n for (int x = xs; x < std::min(dstWidth, xs + RBLOCK); x++) {\n \/\/ dst.SetPixel(x, y, src.GetPixel(y2, x));\n for(int j = 0; j < bpp; j++) {\n dst_bits[j] = src_bits[j];\n }\n dst_bits += bpp;\n src_bits += srcPitch;\n }\n }\n }\n }\n}\n\nbool TextureAtlas::addImage(const ImageHandle& newImageHandle) \n{\n if(imageSubTextures.find( newImageHandle ) != imageSubTextures.end())\n return true;\n\n Image* newImage = newImageHandle.Resolve();\n\n Rect newRect = rectanglePacker.Insert(newImage->getWidth(), newImage->getHeight(), gs_heuristic);\n\n if (newRect.height == 0 || newRect.width == 0){\n if (atlasSize >= atlasMaxSize)\n return false;\n\n atlasSize = std::min(atlasSize*2, atlasMaxSize);\n resizeAtlas(atlasSize);\n\n return addImage(newImageHandle);\n }\n\n addImage(newImageHandle,newRect);\n\n return true;\n}\n\nbool TextureAtlas::getImageSubTexture(const ImageHandle& imageHandle, SubTexture& subTexture)\n{\n if(imageSubTextures.find( imageHandle ) == imageSubTextures.end())\n return false;\n\n subTexture = imageSubTextures[imageHandle];\n return true;\n}\n\nImageHandle TextureAtlas::getAtlasImageHandle() const\n{\n return atlasImageHandle;\n}\n\n\nvoid TextureAtlas::resizeAtlas(uint newSize)\n{\n rectanglePacker.Init(newSize,newSize);\n\n std::vector<Vector2i> rectSizes;\n std::vector<Rect> newRects;\n\n Image* atlasImage = atlasImageHandle.Resolve();\n\n std::map<ImageHandle, SubTexture>::iterator iter;\n for (iter = imageSubTextures.begin(); iter != imageSubTextures.end(); ++iter) {\n Vector2i rectSize;\n int width = (iter->second.rightBottomUV.x - iter->second.leftTopUV.x)*width;\n int height = (iter->second.rightBottomUV.y - iter->second.leftTopUV.y)*height;\n rectSize.x = width;\n rectSize.y = height;\n rectSizes.push_back(rectSize);\n }\n\n rectanglePacker.Insert(rectSizes, newRects, gs_heuristic);\n\n assert(newRects.size() == imageSubTextures.size());\n\n int i;\n for (i = 0, iter = imageSubTextures.begin(); iter != imageSubTextures.end(); ++iter, ++i) \n {\n ImageHandle newImageHandle = iter->first;\n Rect newRect = newRects[i];\n\n addImage(newImageHandle, newRect);\n }\n}\n\nvoid TextureAtlas::addImage(ImageHandle newImageHandle, Rect newRect)\n{\n Image* newImage = newImageHandle.Resolve();\n\n bool wasRotated = newImage->getWidth() == newRect.height &&\n newImage->getHeight() == newRect.width;\n\n Image* atlasImage = atlasImageHandle.Resolve();\n if (newImage->getPixelFormat() == atlasImage->getPixelFormat())\n {\n atlasImage->setBuffer(newImage,Vector2i(newRect.x,newRect.y));\n } \n else \n {\n assert(newImage->getPixelFormat() == PixelFormat::Depth &&\n atlasImage->getPixelFormat() == PixelFormat::R8G8B8A8);\n\n Image tmpImage(newImage->getWidth(),newImage->getHeight(),PixelFormat::R8G8B8A8);\n\n int newImageSize = newImage->getSize();\n std::vector<byte>& buffer = tmpImage.getBuffer();\n buffer.resize(newImageSize*4);\n\n for (int i = 0; i < newImageSize; i++)\n {\n int p = i*4;\n buffer[p+0] = 255; \/\/R\n buffer[p+1] = 255; \/\/G\n buffer[p+2] = 255; \/\/B\n buffer[p+3] = newImage->getBuffer()[i]; \/\/A\n }\n\n if (wasRotated)\n RotateImage(&tmpImage,atlasImage,Vector2i(newRect.x,newRect.y));\n else\n atlasImage->setBuffer(&tmpImage,Vector2i(newRect.x,newRect.y));\n }\n\n SubTexture subTexture;\n subTexture.atlas = this;\n\n float bottom = (float)(newRect.y+newRect.height)\/atlasSize;\n float top = (float)newRect.y\/atlasSize;\n float right = (float)(newRect.x+newRect.width)\/atlasSize;\n float left = (float)newRect.x\/atlasSize;\n\n if(!wasRotated)\n {\n subTexture.leftTopUV = Vector2(left,top);\n subTexture.rightTopUV = Vector2(right,top);\n subTexture.rightBottomUV = Vector2(right,bottom);\n subTexture.leftBottomUV = Vector2(left,bottom);\n } \n else \n {\n subTexture.rightTopUV = Vector2(left,top);\n subTexture.rightBottomUV = Vector2(right,top);\n subTexture.leftBottomUV = Vector2(right,bottom);\n subTexture.leftTopUV = Vector2(left,bottom);\n }\n\n imageSubTextures[newImageHandle] = subTexture;\n}\n\n\/\/-----------------------------------\/\/\n\nNAMESPACE_ENGINE_END<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixes two bugs in tree view: . Invoking SetRootShown before the tree was created resulted in updating internal structures with wrong info. This caused problems if you later tried to delete. I've added a DCHECK to make sure we don't hit this again. . Adding a node to the root when the root wasn't shown silently failed.<commit_after><|endoftext|>"} {"text":"<commit_before>#ifndef UTENSOR_SDTENSOR_H\n#define UTENSOR_SDTENSOR_H\n#include \"tensor.hpp\"\n#include \"tensorIdxImporter.hpp\"\ntemplate <class T>\nclass SDTensor : public Tensor {\n public:\n SDTensor(TName _name, std::string filename) : Tensor(_name) {\n _filename = filename;\n cursor = 0;\n dirty = false;\n }\n\n SDTensor(std::initializer_list<uint32_t> l, TName _name, std::string file) : Tensor(_name) {\n std::vector<uint32_t> v;\n for (auto i : l) {\n v.push_back(i);\n }\n Tensor::init<T>(v);\n _filename = file;\n cursor = 0;\n setIdxType();\n data_importer.load_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n dirty = false;\n }\n\n SDTensor(std::vector<uint32_t> v, TName _name, std::string file) : Tensor(_name) {\n Tensor::init<T>(v);\n _filename = file;\n cursor = 0;\n setIdxType();\n data_importer.load_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n dirty = false;\n }\n void setIdxType() {\n if (std::is_same<T, unsigned char>::value) {\n type = idx_ubyte;\n } else if (std::is_same<T, char>::value) {\n type = idx_byte;\n } else if (std::is_same<T, short>::value) {\n type = idx_short;\n } else if (std::is_same<T, int>::value) {\n type = idx_int;\n } else if (std::is_same<T, float>::value) {\n type = idx_float;\n } else if (std::is_same<T, double>::value) {\n type = idx_double;\n } else {\n ERR_EXIT(\"idx type not supported\");\n }\n }\n virtual void* read(size_t offset, size_t ele) override {\n if (ele > s->total_size) {\n ERR_EXIT(\"data overflow\");\n }\n if (offset + ele < cursor + s->total_size && !dirty) {\n return (void *)((T*)s->data + offset - cursor);\n } else if (offset + ele >= cursor + s->total_size || dirty) { \n data_importer.flush_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n dirty = false;\n data_importer.load_data<T>(_filename, type, unit_size(), ele, offset, (T*)s->data);\n cursor = offset;\n } \n return (void *)((T*)s->data);\n }\n virtual void* write(size_t offset, size_t ele) override {\n if (ele > s->total_size) {\n ERR_EXIT(\"data overflow\");\n }\n dirty = true;\n if (offset + ele < cursor + s->total_size) {\n return (void *)((T*)s->data + offset - cursor);\n } else if (offset + ele >= cursor + s->total_size) {\n data_importer.flush_data<T>(_filename, type, unit_size(), cursor, s->total_size, (T*)s->data);\n data_importer.load_data<T>(_filename, type, unit_size(), offset, ele, (T*)s->data);\n cursor = offset;\n }\n return (void*)((T*)s->data + offset);\n }\n\n\n \/\/ virtual void* read(size_t offset, size_t ele) override{};\n virtual uint16_t unit_size(void) override {\n return sizeof(T);\n }\n ~SDTensor() {}\n private:\n SDTensor(const SDTensor&);\n TensorIdxImporter data_importer;\n std::string _filename;\n bool dirty;\n long int cursor;\n SDTensor& operator=(const SDTensor&);\n IDX_DTYPE type;\n\n};\n#endif\n<commit_msg> 1. complete the cache mechanism and add some comment for readable 2. it include three states: 1. shared state: the memory is read and shared with same value in sd card 2. dirty state: the memory is changed and should be writed back 3. miss state: the request memory address is not in the memory<commit_after>#ifndef UTENSOR_SDTENSOR_H\n#define UTENSOR_SDTENSOR_H\n#include \"tensor.hpp\"\n#include \"tensorIdxImporter.hpp\"\ntemplate <class T>\nclass SDTensor : public Tensor {\n public:\n SDTensor(TName _name, std::string filename) : Tensor(_name) {\n _filename = filename;\n cursor = 0;\n dirty = false;\n }\n\n SDTensor(std::initializer_list<uint32_t> l, TName _name, std::string file) : Tensor(_name) {\n std::vector<uint32_t> v;\n for (auto i : l) {\n v.push_back(i);\n }\n Tensor::init<T>(v);\n _filename = file;\n cursor = 0;\n setIdxType();\n data_importer.load_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n dirty = false;\n }\n\n SDTensor(std::vector<uint32_t> v, TName _name, std::string file) : Tensor(_name) {\n Tensor::init<T>(v);\n _filename = file;\n cursor = 0;\n setIdxType();\n data_importer.load_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n dirty = false;\n }\n void setIdxType() {\n if (std::is_same<T, unsigned char>::value) {\n type = idx_ubyte;\n } else if (std::is_same<T, char>::value) {\n type = idx_byte;\n } else if (std::is_same<T, short>::value) {\n type = idx_short;\n } else if (std::is_same<T, int>::value) {\n type = idx_int;\n } else if (std::is_same<T, float>::value) {\n type = idx_float;\n } else if (std::is_same<T, double>::value) {\n type = idx_double;\n } else {\n ERR_EXIT(\"idx type not supported\");\n }\n }\n virtual void* read(size_t offset, size_t ele) override {\n if (ele > s->total_size) {\n ERR_EXIT(\"data overflow\");\n }\n if (offset + ele < cursor + s->total_size) {\n \/\/1. shared && not miss state\n \/\/2. dirty && not miss state\n dirty = false;\n return (void *)((T*)s->data + offset - cursor);\n } else if (dirty && offset + ele >= cursor + s->total_size) { \n \/\/1. dirty && miss state\n data_importer.flush_data<T>(_filename, type, unit_size(), s->total_size, cursor, (T*)s->data);\n data_importer.load_data<T>(_filename, type, unit_size(), ele, offset, (T*)s->data);\n cursor = offset;\n dirty = false;\n } else if (!dirty && offset + ele >= cursor + s->total_size) {\n \/\/1. shared && miss state\n data_importer.load_data<T>(_filename, type, unit_size(), ele, offset, (T*)s->data);\n cursor = offset;\n } \n return (void *)((T*)s->data);\n }\n virtual void* write(size_t offset, size_t ele) override {\n if (ele > s->total_size) {\n ERR_EXIT(\"data overflow\");\n }\n if (offset + ele < cursor + s->total_size) {\n \/\/1. dirty && not miss state\n \/\/2. shared && not miss state\n dirty = true;\n return (void *)((T*)s->data + offset - cursor);\n } else if (dirty && offset + ele >= cursor + s->total_size) {\n \/\/1. dirty && miss state\n data_importer.flush_data<T>(_filename, type, unit_size(), cursor, s->total_size, (T*)s->data);\n data_importer.load_data<T>(_filename, type, unit_size(), offset, ele, (T*)s->data);\n cursor = offset;\n } else if (!dirty && offset + ele >= cursor + s->total_size) {\n \/\/1. shared && miss state\n data_importer.load_data<T>(_filename, type, unit_size(), offset, ele, (T*)s->data);\n cursor = offset;\n dirty = true;\n }\n return (void*)((T*)s->data + offset);\n }\n\n\n \/\/ virtual void* read(size_t offset, size_t ele) override{};\n virtual uint16_t unit_size(void) override {\n return sizeof(T);\n }\n ~SDTensor() {}\n private:\n SDTensor(const SDTensor&);\n TensorIdxImporter data_importer;\n std::string _filename;\n bool dirty;\n long int cursor;\n SDTensor& operator=(const SDTensor&);\n IDX_DTYPE type;\n\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2006 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"FFMpegDecoder.h\"\n\n#include \"Player.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/ScopeTimer.h\"\n\n#include <iostream>\n#include <sstream>\n#include <unistd.h>\n\nusing namespace std;\n\nnamespace avg {\n\nbool FFMpegDecoder::m_bInitialized = false;\n\nFFMpegDecoder::FFMpegDecoder ()\n : m_pFormatContext(0),\n m_pVStream(0),\n m_pPacketData(0)\n{\n initVideoSupport();\n}\n\nFFMpegDecoder::~FFMpegDecoder ()\n{\n if (m_pFormatContext) {\n close();\n }\n}\n\n\nvoid avcodecError(const string & filename, int err)\n{\n switch(err) {\n case AVERROR_NUMEXPECTED:\n AVG_TRACE(Logger::ERROR, \n filename << \": Incorrect image filename syntax.\");\n AVG_TRACE(Logger::ERROR, \n \"Use '%%d' to specify the image number:\");\n AVG_TRACE(Logger::ERROR, \n \" for img1.jpg, img2.jpg, ..., use 'img%%d.jpg';\");\n AVG_TRACE(Logger::ERROR, \n \" for img001.jpg, img002.jpg, ..., use 'img%%03d.jpg'.\"); \n break;\n case AVERROR_INVALIDDATA:\n AVG_TRACE(Logger::ERROR, \n filename << \": Error while parsing header\");\n break;\n case AVERROR_NOFMT:\n AVG_TRACE(Logger::ERROR, \n filename << \": Unknown format\");\n break;\n default:\n AVG_TRACE(Logger::ERROR, \n filename << \": Error while opening file (Num:\" << err << \")\");\n break;\n }\n \/\/ TODO: Continue without video.\n exit(-1);\n}\n\n\nvoid dump_stream_info(AVFormatContext *s)\n{\n cerr << \"Stream info: \" << endl;\n if (s->track != 0)\n fprintf(stderr, \" Track: %d\\n\", s->track);\n if (s->title[0] != '\\0')\n fprintf(stderr, \" Title: %s\\n\", s->title);\n if (s->author[0] != '\\0')\n fprintf(stderr, \" Author: %s\\n\", s->author);\n if (s->album[0] != '\\0')\n fprintf(stderr, \" Album: %s\\n\", s->album);\n if (s->year != 0)\n fprintf(stderr, \" Year: %d\\n\", s->year);\n if (s->genre[0] != '\\0')\n fprintf(stderr, \" Genre: %s\\n\", s->genre);\n}\n\n\nbool FFMpegDecoder::open (const std::string& sFilename, \n int* pWidth, int* pHeight)\n{\n AVFormatParameters params;\n int err;\n m_sFilename = sFilename;\n\n AVG_TRACE(Logger::PROFILE, \"Opening \" << sFilename);\n memset(¶ms, 0, sizeof(params));\n params.image_format = 0;\n\n err = av_open_input_file(&m_pFormatContext, sFilename.c_str(), \n 0, 0, ¶ms);\n if (err < 0) {\n avcodecError(sFilename, err);\n }\n \n err = av_find_stream_info(m_pFormatContext);\n if (err < 0) {\n AVG_TRACE(Logger::ERROR, \n sFilename << \": Could not find codec parameters.\");\n return false;\n }\n\n av_read_play(m_pFormatContext);\n \n m_VStreamIndex = -1;\n for(int i = 0; i < m_pFormatContext->nb_streams; i++) {\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pFormatContext->streams[i]->codec;\n#else \n AVCodecContext *enc = m_pFormatContext->streams[i]->codec;\n#endif\n switch(enc->codec_type) {\n\/*\n case CODEC_TYPE_AUDIO:\n if (audio_index < 0 && !audio_disable)\n audio_index = i;\n break;\n*\/\n case CODEC_TYPE_VIDEO:\n if (m_VStreamIndex < 0)\n m_VStreamIndex = i;\n break;\n default:\n break;\n }\n }\n\/\/ dump_format(m_pFormatContext, 0, m_sFilename.c_str(), 0);\n\/\/ dump_stream_info(m_pFormatContext);\n if (m_VStreamIndex < 0) {\n AVG_TRACE(Logger::ERROR, \n sFilename << \" does not contain any video streams.\");\n return false;\n } \n AVCodecContext *enc;\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n enc = &(m_pFormatContext->streams[m_VStreamIndex]->codec);\n#else\n enc = m_pFormatContext->streams[m_VStreamIndex]->codec;\n#endif\n\/\/ enc->debug = 0x0001; \/\/ see avcodec.h\n\n AVCodec * codec = avcodec_find_decoder(enc->codec_id);\n if (!codec ||\n avcodec_open(enc, codec) < 0)\n {\n AVG_TRACE(Logger::ERROR, \n sFilename << \": could not open codec (?!).\");\n return false;\n } \n m_pVStream = m_pFormatContext->streams[m_VStreamIndex];\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n *pWidth = m_pVStream->codec.width;\n *pHeight = m_pVStream->codec.height;\n#else\n *pWidth = m_pVStream->codec->width;\n *pHeight = m_pVStream->codec->height;\n#endif\n m_bFirstPacket = true;\n m_PacketLenLeft = 0;\n m_bEOF = false;\n return true;\n} \n\nvoid FFMpegDecoder::close() \n{\n AVG_TRACE(Logger::PROFILE, \"Closing \" << m_sFilename);\n AVCodecContext * enc;\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n enc = &(m_pFormatContext->streams[m_VStreamIndex]->codec);\n#else\n enc = m_pFormatContext->streams[m_VStreamIndex]->codec;\n#endif\n if (!m_bFirstPacket) {\n av_free_packet(&m_Packet);\n }\n m_pPacketData = 0;\n avcodec_close(enc);\n m_pVStream = 0;\n av_close_input_file(m_pFormatContext);\n m_pFormatContext = 0;\n}\n\nvoid FFMpegDecoder::seek(int DestFrame, int CurFrame) \n{\n#if LIBAVFORMAT_BUILD <= 4616\n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*1000000*1000)\/m_pVStream->r_frame_rate));\n#else\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*1000000*1000)\/m_pVStream->r_frame_rate), 0);\n#else\n double framerate = (m_pVStream->r_frame_rate.num)\/m_pVStream->r_frame_rate.den;\n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*1000000*1000)\/framerate), 0);\n#endif\n#endif \n}\n\nint FFMpegDecoder::getNumFrames()\n{\n \/\/ This is broken for some videos, but the code here is correct.\n \/\/ So fix the videos or ffmpeg :-).\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n return m_pVStream->r_frame_rate*(m_pVStream->duration\/AV_TIME_BASE);\n#else\n return (m_pVStream->r_frame_rate.num\/m_pVStream->r_frame_rate.den)*(m_pVStream->duration\/AV_TIME_BASE);\n#endif \n}\n\ndouble FFMpegDecoder::getFPS()\n{\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n return m_pVStream->r_frame_rate;\n#else\n return (m_pVStream->r_frame_rate.num\/m_pVStream->r_frame_rate.den);\n#endif \n}\n\nstatic ProfilingZone RenderToBmpProfilingZone(\" FFMpeg: renderToBmp\");\nstatic ProfilingZone ImgConvertProfilingZone(\" FFMpeg: img_convert\");\n\nbool FFMpegDecoder::renderToBmp(BitmapPtr pBmp)\n{\n ScopeTimer Timer(RenderToBmpProfilingZone);\n AVFrame Frame;\n readFrame(Frame);\n if (!m_bEOF) {\n AVPicture DestPict;\n unsigned char * pDestBits = pBmp->getPixels();\n DestPict.data[0] = pDestBits;\n DestPict.data[1] = pDestBits+1;\n DestPict.data[2] = pDestBits+2;\n DestPict.data[3] = pDestBits+3;\n DestPict.linesize[0] = pBmp->getStride();\n DestPict.linesize[1] = pBmp->getStride();\n DestPict.linesize[2] = pBmp->getStride();\n DestPict.linesize[3] = pBmp->getStride();\n int DestFmt;\n switch(pBmp->getPixelFormat()) {\n case R8G8B8X8:\n DestFmt = PIX_FMT_RGBA32;\n break;\n case B8G8R8X8:\n \/\/ This isn't supported directly by FFMpeg.\n DestFmt = PIX_FMT_RGBA32;\n DestPict.data[1] = pDestBits+3;\n DestPict.data[3] = pDestBits+1;\n break;\n case R8G8B8:\n DestFmt = PIX_FMT_RGB24;\n break;\n case B8G8R8:\n DestFmt = PIX_FMT_BGR24;\n break;\n case YCbCr422:\n DestFmt = PIX_FMT_YUV422;\n break;\n default:\n AVG_TRACE(Logger::ERROR, \"FFMpegDecoder: Dest format \" \n << pBmp->getPixelFormatString() << \" not supported.\");\n assert(false);\n }\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pVStream->codec;\n#else\n AVCodecContext *enc = m_pVStream->codec;\n#endif\n {\n ScopeTimer Timer(ImgConvertProfilingZone);\n img_convert(&DestPict, DestFmt,\n (AVPicture*)&Frame, enc->pix_fmt,\n enc->width, enc->height);\n }\n }\n return m_bEOF;\n}\n\nbool FFMpegDecoder::isYCbCrSupported() \n{\n return true;\n}\n\nbool FFMpegDecoder::canRenderToBuffer(int BPP)\n{\n\/\/TODO: This is a bug: We should enable direct rendering if DFB is being \n\/\/ used and not just compiled in!\n#ifdef AVG_ENABLE_DFB\n return (BPP == 24);\n#else\n return false;\n#endif\n}\n\nvoid FFMpegDecoder::initVideoSupport()\n{\n if (!m_bInitialized) {\n av_register_all();\n m_bInitialized = true;\n \/\/ Avoid libavcodec console spam - turn this up again when libavcodec\n \/\/ doesn't spam anymore :-).\n\/\/ av_log_set_level(AV_LOG_DEBUG);\n av_log_set_level(AV_LOG_QUIET);\n }\n}\n\nvoid FFMpegDecoder::readFrame(AVFrame& Frame)\n{\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pVStream->codec;\n#else\n AVCodecContext *enc = m_pVStream->codec;\n#endif\n if (enc->codec_id == CODEC_ID_RAWVIDEO) {\n AVPacket Packet;\n m_bEOF = getNextVideoPacket(Packet);\n if (m_bEOF) {\n return ;\n }\n avpicture_fill((AVPicture*)&Frame, Packet.data, \n enc->pix_fmt, \n enc->width, enc->height);\n av_free_packet(&Packet);\n } else {\n int gotPicture = 0;\n while (!gotPicture) {\n if (m_PacketLenLeft <= 0) {\n if (!m_bFirstPacket) {\n av_free_packet(&m_Packet);\n }\n m_bFirstPacket = false;\n m_bEOF = getNextVideoPacket(m_Packet);\n if (m_bEOF) {\n return ;\n }\n m_PacketLenLeft = m_Packet.size;\n m_pPacketData = m_Packet.data;\n }\n int Len1 = avcodec_decode_video(enc, &Frame,\n &gotPicture, m_pPacketData, m_PacketLenLeft);\n if (Len1 < 0) {\n AVG_TRACE(Logger::WARNING, \"Error decoding \" <<\n m_sFilename);\n \/\/ TODO: simulate eof.\n }\n m_pPacketData += Len1;\n m_PacketLenLeft -= Len1;\n }\n\/*\n cerr << \"coded_picture_number: \" << Frame.coded_picture_number <<\n \", display_picture_number: \" << Frame.display_picture_number <<\n \", pts: \" << Frame.pts << endl;\n\n cerr << \"key_frame: \" << Frame.key_frame << \n \", pict_type: \" << Frame.pict_type << endl;\n AVFrac spts = m_pVStream->pts;\n cerr << \"Stream.pts: \" << spts.val + double(spts.num)\/spts.den << endl;\n*\/ \n }\n}\n\nbool FFMpegDecoder::getNextVideoPacket(AVPacket & Packet) {\n AVPacket CurPacket;\n int err = av_read_frame(m_pFormatContext, &CurPacket);\n if (err < 0) {\n return true;\n }\n while (CurPacket.stream_index != m_VStreamIndex) {\n av_free_packet(&CurPacket);\n int err = av_read_frame(m_pFormatContext, &CurPacket);\n if (err < 0) {\n return true;\n }\n } \n Packet = CurPacket;\n\/* if (Packet.pts != AV_NOPTS_VALUE) {\n cerr << \"Packet.pts: \" << \n double(Packet.pts)*m_pFormatContext->pts_num\/m_pFormatContext->pts_den << endl;\n }\n*\/\n return false;\n}\n\n}\n\n<commit_msg>Fixed seek with newer ffmpeg.<commit_after>\/\/\n\/\/ libavg - Media Playback Engine. \n\/\/ Copyright (C) 2003-2006 Ulrich von Zadow\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ Current versions can be found at www.libavg.de\n\/\/\n\n#include \"FFMpegDecoder.h\"\n\n#include \"Player.h\"\n#include \"..\/base\/Exception.h\"\n#include \"..\/base\/Logger.h\"\n#include \"..\/base\/ScopeTimer.h\"\n\n#include <iostream>\n#include <sstream>\n#include <unistd.h>\n\nusing namespace std;\n\nnamespace avg {\n\nbool FFMpegDecoder::m_bInitialized = false;\n\nFFMpegDecoder::FFMpegDecoder ()\n : m_pFormatContext(0),\n m_pVStream(0),\n m_pPacketData(0)\n{\n initVideoSupport();\n}\n\nFFMpegDecoder::~FFMpegDecoder ()\n{\n if (m_pFormatContext) {\n close();\n }\n}\n\n\nvoid avcodecError(const string & filename, int err)\n{\n switch(err) {\n case AVERROR_NUMEXPECTED:\n AVG_TRACE(Logger::ERROR, \n filename << \": Incorrect image filename syntax.\");\n AVG_TRACE(Logger::ERROR, \n \"Use '%%d' to specify the image number:\");\n AVG_TRACE(Logger::ERROR, \n \" for img1.jpg, img2.jpg, ..., use 'img%%d.jpg';\");\n AVG_TRACE(Logger::ERROR, \n \" for img001.jpg, img002.jpg, ..., use 'img%%03d.jpg'.\"); \n break;\n case AVERROR_INVALIDDATA:\n AVG_TRACE(Logger::ERROR, \n filename << \": Error while parsing header\");\n break;\n case AVERROR_NOFMT:\n AVG_TRACE(Logger::ERROR, \n filename << \": Unknown format\");\n break;\n default:\n AVG_TRACE(Logger::ERROR, \n filename << \": Error while opening file (Num:\" << err << \")\");\n break;\n }\n \/\/ TODO: Continue without video.\n exit(-1);\n}\n\n\nvoid dump_stream_info(AVFormatContext *s)\n{\n cerr << \"Stream info: \" << endl;\n if (s->track != 0)\n fprintf(stderr, \" Track: %d\\n\", s->track);\n if (s->title[0] != '\\0')\n fprintf(stderr, \" Title: %s\\n\", s->title);\n if (s->author[0] != '\\0')\n fprintf(stderr, \" Author: %s\\n\", s->author);\n if (s->album[0] != '\\0')\n fprintf(stderr, \" Album: %s\\n\", s->album);\n if (s->year != 0)\n fprintf(stderr, \" Year: %d\\n\", s->year);\n if (s->genre[0] != '\\0')\n fprintf(stderr, \" Genre: %s\\n\", s->genre);\n}\n\n\nbool FFMpegDecoder::open (const std::string& sFilename, \n int* pWidth, int* pHeight)\n{\n AVFormatParameters params;\n int err;\n m_sFilename = sFilename;\n\n AVG_TRACE(Logger::PROFILE, \"Opening \" << sFilename);\n memset(¶ms, 0, sizeof(params));\n params.image_format = 0;\n\n err = av_open_input_file(&m_pFormatContext, sFilename.c_str(), \n 0, 0, ¶ms);\n if (err < 0) {\n avcodecError(sFilename, err);\n }\n \n err = av_find_stream_info(m_pFormatContext);\n if (err < 0) {\n AVG_TRACE(Logger::ERROR, \n sFilename << \": Could not find codec parameters.\");\n return false;\n }\n\n av_read_play(m_pFormatContext);\n \n m_VStreamIndex = -1;\n for(int i = 0; i < m_pFormatContext->nb_streams; i++) {\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pFormatContext->streams[i]->codec;\n#else \n AVCodecContext *enc = m_pFormatContext->streams[i]->codec;\n#endif\n switch(enc->codec_type) {\n\/*\n case CODEC_TYPE_AUDIO:\n if (audio_index < 0 && !audio_disable)\n audio_index = i;\n break;\n*\/\n case CODEC_TYPE_VIDEO:\n if (m_VStreamIndex < 0)\n m_VStreamIndex = i;\n break;\n default:\n break;\n }\n }\n\/\/ dump_format(m_pFormatContext, 0, m_sFilename.c_str(), 0);\n\/\/ dump_stream_info(m_pFormatContext);\n if (m_VStreamIndex < 0) {\n AVG_TRACE(Logger::ERROR, \n sFilename << \" does not contain any video streams.\");\n return false;\n } \n AVCodecContext *enc;\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n enc = &(m_pFormatContext->streams[m_VStreamIndex]->codec);\n#else\n enc = m_pFormatContext->streams[m_VStreamIndex]->codec;\n#endif\n\/\/ enc->debug = 0x0001; \/\/ see avcodec.h\n\n AVCodec * codec = avcodec_find_decoder(enc->codec_id);\n if (!codec ||\n avcodec_open(enc, codec) < 0)\n {\n AVG_TRACE(Logger::ERROR, \n sFilename << \": could not open codec (?!).\");\n return false;\n } \n m_pVStream = m_pFormatContext->streams[m_VStreamIndex];\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n *pWidth = m_pVStream->codec.width;\n *pHeight = m_pVStream->codec.height;\n#else\n *pWidth = m_pVStream->codec->width;\n *pHeight = m_pVStream->codec->height;\n#endif\n m_bFirstPacket = true;\n m_PacketLenLeft = 0;\n m_bEOF = false;\n return true;\n} \n\nvoid FFMpegDecoder::close() \n{\n AVG_TRACE(Logger::PROFILE, \"Closing \" << m_sFilename);\n AVCodecContext * enc;\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n enc = &(m_pFormatContext->streams[m_VStreamIndex]->codec);\n#else\n enc = m_pFormatContext->streams[m_VStreamIndex]->codec;\n#endif\n if (!m_bFirstPacket) {\n av_free_packet(&m_Packet);\n }\n m_pPacketData = 0;\n avcodec_close(enc);\n m_pVStream = 0;\n av_close_input_file(m_pFormatContext);\n m_pFormatContext = 0;\n}\n\nvoid FFMpegDecoder::seek(int DestFrame, int CurFrame) \n{\n#if LIBAVFORMAT_BUILD <= 4616\n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*1000000*1000)\/m_pVStream->r_frame_rate));\n#else\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*1000000*1000)\/m_pVStream->r_frame_rate), 0);\n#else\n double framerate = (m_pVStream->r_frame_rate.num)\/m_pVStream->r_frame_rate.den;\n \n av_seek_frame(m_pFormatContext, m_VStreamIndex, \n int((double(DestFrame)*AV_TIME_BASE)\/framerate), 0);\n#endif\n#endif \n}\n\nint FFMpegDecoder::getNumFrames()\n{\n \/\/ This is broken for some videos, but the code here is correct.\n \/\/ So fix the videos or ffmpeg :-).\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n return m_pVStream->r_frame_rate*(m_pVStream->duration\/AV_TIME_BASE);\n#else\n return (m_pVStream->r_frame_rate.num\/m_pVStream->r_frame_rate.den)*(m_pVStream->duration\/AV_TIME_BASE);\n#endif \n}\n\ndouble FFMpegDecoder::getFPS()\n{\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n return m_pVStream->r_frame_rate;\n#else\n return (m_pVStream->r_frame_rate.num\/m_pVStream->r_frame_rate.den);\n#endif \n}\n\nstatic ProfilingZone RenderToBmpProfilingZone(\" FFMpeg: renderToBmp\");\nstatic ProfilingZone ImgConvertProfilingZone(\" FFMpeg: img_convert\");\n\nbool FFMpegDecoder::renderToBmp(BitmapPtr pBmp)\n{\n ScopeTimer Timer(RenderToBmpProfilingZone);\n AVFrame Frame;\n readFrame(Frame);\n if (!m_bEOF) {\n AVPicture DestPict;\n unsigned char * pDestBits = pBmp->getPixels();\n DestPict.data[0] = pDestBits;\n DestPict.data[1] = pDestBits+1;\n DestPict.data[2] = pDestBits+2;\n DestPict.data[3] = pDestBits+3;\n DestPict.linesize[0] = pBmp->getStride();\n DestPict.linesize[1] = pBmp->getStride();\n DestPict.linesize[2] = pBmp->getStride();\n DestPict.linesize[3] = pBmp->getStride();\n int DestFmt;\n switch(pBmp->getPixelFormat()) {\n case R8G8B8X8:\n DestFmt = PIX_FMT_RGBA32;\n break;\n case B8G8R8X8:\n \/\/ This isn't supported directly by FFMpeg.\n DestFmt = PIX_FMT_RGBA32;\n DestPict.data[1] = pDestBits+3;\n DestPict.data[3] = pDestBits+1;\n break;\n case R8G8B8:\n DestFmt = PIX_FMT_RGB24;\n break;\n case B8G8R8:\n DestFmt = PIX_FMT_BGR24;\n break;\n case YCbCr422:\n DestFmt = PIX_FMT_YUV422;\n break;\n default:\n AVG_TRACE(Logger::ERROR, \"FFMpegDecoder: Dest format \" \n << pBmp->getPixelFormatString() << \" not supported.\");\n assert(false);\n }\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pVStream->codec;\n#else\n AVCodecContext *enc = m_pVStream->codec;\n#endif\n {\n ScopeTimer Timer(ImgConvertProfilingZone);\n img_convert(&DestPict, DestFmt,\n (AVPicture*)&Frame, enc->pix_fmt,\n enc->width, enc->height);\n }\n }\n return m_bEOF;\n}\n\nbool FFMpegDecoder::isYCbCrSupported() \n{\n return true;\n}\n\nbool FFMpegDecoder::canRenderToBuffer(int BPP)\n{\n\/\/TODO: This is a bug: We should enable direct rendering if DFB is being \n\/\/ used and not just compiled in!\n#ifdef AVG_ENABLE_DFB\n return (BPP == 24);\n#else\n return false;\n#endif\n}\n\nvoid FFMpegDecoder::initVideoSupport()\n{\n if (!m_bInitialized) {\n av_register_all();\n m_bInitialized = true;\n \/\/ Avoid libavcodec console spam - turn this up again when libavcodec\n \/\/ doesn't spam anymore :-).\n\/\/ av_log_set_level(AV_LOG_DEBUG);\n av_log_set_level(AV_LOG_QUIET);\n }\n}\n\nvoid FFMpegDecoder::readFrame(AVFrame& Frame)\n{\n#if LIBAVFORMAT_BUILD < ((49<<16)+(0<<8)+0)\n AVCodecContext *enc = &m_pVStream->codec;\n#else\n AVCodecContext *enc = m_pVStream->codec;\n#endif\n if (enc->codec_id == CODEC_ID_RAWVIDEO) {\n AVPacket Packet;\n m_bEOF = getNextVideoPacket(Packet);\n if (m_bEOF) {\n return ;\n }\n avpicture_fill((AVPicture*)&Frame, Packet.data, \n enc->pix_fmt, \n enc->width, enc->height);\n av_free_packet(&Packet);\n } else {\n int gotPicture = 0;\n while (!gotPicture) {\n if (m_PacketLenLeft <= 0) {\n if (!m_bFirstPacket) {\n av_free_packet(&m_Packet);\n }\n m_bFirstPacket = false;\n m_bEOF = getNextVideoPacket(m_Packet);\n if (m_bEOF) {\n return ;\n }\n m_PacketLenLeft = m_Packet.size;\n m_pPacketData = m_Packet.data;\n }\n int Len1 = avcodec_decode_video(enc, &Frame,\n &gotPicture, m_pPacketData, m_PacketLenLeft);\n if (Len1 < 0) {\n AVG_TRACE(Logger::WARNING, \"Error decoding \" <<\n m_sFilename);\n \/\/ TODO: simulate eof.\n }\n m_pPacketData += Len1;\n m_PacketLenLeft -= Len1;\n }\n\/*\n cerr << \"coded_picture_number: \" << Frame.coded_picture_number <<\n \", display_picture_number: \" << Frame.display_picture_number <<\n \", pts: \" << Frame.pts << endl;\n\n cerr << \"key_frame: \" << Frame.key_frame << \n \", pict_type: \" << Frame.pict_type << endl;\n AVFrac spts = m_pVStream->pts;\n cerr << \"Stream.pts: \" << spts.val + double(spts.num)\/spts.den << endl;\n*\/ \n }\n}\n\nbool FFMpegDecoder::getNextVideoPacket(AVPacket & Packet) {\n AVPacket CurPacket;\n int err = av_read_frame(m_pFormatContext, &CurPacket);\n if (err < 0) {\n return true;\n }\n while (CurPacket.stream_index != m_VStreamIndex) {\n av_free_packet(&CurPacket);\n int err = av_read_frame(m_pFormatContext, &CurPacket);\n if (err < 0) {\n return true;\n }\n } \n Packet = CurPacket;\n\/* if (Packet.pts != AV_NOPTS_VALUE) {\n cerr << \"Packet.pts: \" << \n double(Packet.pts)*m_pFormatContext->pts_num\/m_pFormatContext->pts_den << endl;\n }\n*\/\n return false;\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <numeric>\n#include <iostream>\n\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include \"mem.h\"\n\nusing Buffer = std::vector<uint8_t>;\n\nint main(int argc, char** argv) {\n\n \/\/if (argc != 2) {\n \/\/ std::cerr << \"provide image filename\" << std::endl;\n \/\/ return 1;\n \/\/}\n\n \/\/const std::string filename(argv[1]);\n\n \/\/cv::Mat rgb = cv::imread(filename);\n\n \/\/if (rgb.empty()) {\n \/\/ std::cerr << \"empty image\";\n \/\/ return 1;\n \/\/}\n \/\/\n cv::VideoCapture cap(0);\n if (!cap.isOpened())\n return -1;\n\n if (!cap.set(CV_CAP_PROP_FRAME_WIDTH, 640.0))\n return -1;\n\n if (!cap.set(CV_CAP_PROP_FRAME_HEIGHT, 480.0))\n return -1;\n\n const size_t n_pixels = 640 * 480;\n cv::Mat rgb = cv::Mat(cv::Size(640, 480), CV_8UC3, cv::Scalar::all(0));\n cv::Mat dog = cv::Mat(cv::Size(640, 480), CV_8UC3, cv::Scalar::all(0));\n cv::Mat grey = cv::Mat(cv::Size(640, 480), CV_8UC1, cv::Scalar(0));\n\n double total_duration = 0.0;\n int count = 0;\n\n Buffer b(n_pixels);\n Buffer g(n_pixels);\n Buffer r(n_pixels);\n Buffer dog_r(n_pixels);\n\n std::vector<cv::Mat> channels;\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n\n while (true) {\n\n cap >> rgb;\n\n auto t1 = cv::getTickCount();\n\n cv::split(rgb, channels);\n\n std::copy(channels.at(0).data, channels.at(0).data + channels.at(0).cols * channels.at(0).rows, b.begin());\n std::copy(channels.at(1).data, channels.at(1).data + channels.at(0).cols * channels.at(0).rows, g.begin());\n std::copy(channels.at(2).data, channels.at(2).data + channels.at(0).cols * channels.at(0).rows, r.begin());\n\n Buffer& dog_b = b;\n\n auto color_corrector =\n [] (const uint8_t g, const uint8_t r) -> uint8_t {\n return (static_cast<uint64_t>(g) + static_cast<uint64_t>(r)) \/ 2;\n };\n std::transform(g.begin(), g.end(), r.begin(), dog_r.begin(), color_corrector);\n Buffer& dog_g = dog_r;\n\n cv::cvtColor(rgb, grey, cv::COLOR_RGB2GRAY);\n double avg_brightness = cv::mean(grey)[0];\n\n auto averager =\n [avg_brightness] (const uint8_t n) -> uint8_t {\n return uint8_t((static_cast<double>(n) + avg_brightness) \/ 2.0);\n };\n\n std::transform(dog_b.begin(), dog_b.end(), dog_b.begin(), averager);\n std::transform(dog_g.begin(), dog_g.end(), dog_g.begin(), averager);\n std::transform(dog_r.begin(), dog_r.end(), dog_r.begin(), averager);\n\n for (size_t i = 0; i < dog.rows * dog.cols; ++i) {\n dog.at<cv::Vec3b>(i) = cv::Vec3b(dog_b[i], dog_g[i], dog_r[i]);\n }\n\n cv::GaussianBlur(dog, dog, cv::Size(3, 3), 0, 0);\n cv::GaussianBlur(dog, dog, cv::Size(5, 5), 0, 0);\n cv::GaussianBlur(dog, dog, cv::Size(7, 7), 0, 0);\n\n auto t2 = cv::getTickCount();\n\n auto duration = ((double)t2-t1) \/ cv::getTickFrequency();\n total_duration += duration;\n ++count;\n std::cout << \"mean fps: \" << 1.0 \/ (total_duration \/ static_cast<double>(count))\n << \" mem usage: \" << getCurrentRSS() \/ (1024 * 1024) << \"mb peak: \" << getPeakRSS() \/ (1024*1024) << \"mb\"\n << std::endl;\n\n cv::namedWindow(\"original\");\n cv::moveWindow(\"original\", 0, 0);\n cv::resize(rgb, rgb, cv::Size(640,480));\n cv::imshow(\"original\", rgb);\n\n cv::namedWindow(\"dog\");\n cv::moveWindow(\"dog\", rgb.cols, 0);\n cv::resize(dog, dog, cv::Size(640, 480));\n cv::imshow(\"dog\", dog);\n if (cv::waitKey(1) >= 0) break;\n\n \/\/if (count > 90)\n \/\/ break;\n }\n\n return 0;\n}\n<commit_msg>more cleanup<commit_after>#include <algorithm>\n#include <numeric>\n#include <iostream>\n\n#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n\n#include \"mem.h\"\n\nusing Buffer = std::vector<uint8_t>;\n\nint main(int argc, char** argv) {\n\n cv::VideoCapture cap(0);\n if (!cap.isOpened())\n return -1;\n\n if (!cap.set(CV_CAP_PROP_FRAME_WIDTH, 640.0))\n return -1;\n\n if (!cap.set(CV_CAP_PROP_FRAME_HEIGHT, 480.0))\n return -1;\n\n const size_t n_pixels = 640 * 480;\n cv::Mat rgb = cv::Mat(cv::Size(640, 480), CV_8UC3, cv::Scalar::all(0));\n cv::Mat dog = cv::Mat(cv::Size(640, 480), CV_8UC3, cv::Scalar::all(0));\n cv::Mat grey = cv::Mat(cv::Size(640, 480), CV_8UC1, cv::Scalar(0));\n\n double total_duration = 0.0;\n int count = 0;\n\n Buffer b(n_pixels);\n Buffer g(n_pixels);\n Buffer r(n_pixels);\n Buffer dog_r(n_pixels);\n\n std::vector<cv::Mat> channels;\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n channels.push_back(cv::Mat(rgb.size(), CV_8UC1, cv::Scalar(0)));\n\n cv::namedWindow(\"original\");\n cv::moveWindow(\"original\", 0, 0);\n cv::namedWindow(\"dog\");\n cv::moveWindow(\"dog\", rgb.cols, 0);\n\n while (true) {\n\n cap >> rgb;\n\n auto t1 = cv::getTickCount();\n\n cv::split(rgb, channels);\n\n std::copy(channels.at(0).data, channels.at(0).data + channels.at(0).cols * channels.at(0).rows, b.begin());\n std::copy(channels.at(1).data, channels.at(1).data + channels.at(0).cols * channels.at(0).rows, g.begin());\n std::copy(channels.at(2).data, channels.at(2).data + channels.at(0).cols * channels.at(0).rows, r.begin());\n\n Buffer& dog_b = b;\n\n auto color_corrector =\n [] (const uint8_t g, const uint8_t r) -> uint8_t {\n return (static_cast<uint64_t>(g) + static_cast<uint64_t>(r)) \/ 2;\n };\n std::transform(g.begin(), g.end(), r.begin(), dog_r.begin(), color_corrector);\n Buffer& dog_g = dog_r;\n\n cv::cvtColor(rgb, grey, cv::COLOR_RGB2GRAY);\n double avg_brightness = cv::mean(grey)[0];\n\n auto averager =\n [avg_brightness] (const uint8_t n) -> uint8_t {\n return uint8_t((static_cast<double>(n) + avg_brightness) \/ 2.0);\n };\n\n std::transform(dog_b.begin(), dog_b.end(), dog_b.begin(), averager);\n std::transform(dog_g.begin(), dog_g.end(), dog_g.begin(), averager);\n std::transform(dog_r.begin(), dog_r.end(), dog_r.begin(), averager);\n\n for (size_t i = 0; i < dog.rows * dog.cols; ++i) {\n dog.at<cv::Vec3b>(i) = cv::Vec3b(dog_b[i], dog_g[i], dog_r[i]);\n }\n\n cv::GaussianBlur(dog, dog, cv::Size(3, 3), 0, 0);\n cv::GaussianBlur(dog, dog, cv::Size(5, 5), 0, 0);\n cv::GaussianBlur(dog, dog, cv::Size(7, 7), 0, 0);\n\n auto t2 = cv::getTickCount();\n\n auto duration = ((double)t2-t1) \/ cv::getTickFrequency();\n total_duration += duration;\n ++count;\n std::cout << \"mean fps: \" << 1.0 \/ (total_duration \/ static_cast<double>(count))\n << \" mem usage: \" << getCurrentRSS() \/ (1024 * 1024) << \"mb peak: \" << getPeakRSS() \/ (1024*1024) << \"mb\"\n << std::endl;\n\n cv::resize(rgb, rgb, cv::Size(640,480));\n cv::imshow(\"original\", rgb);\n\n cv::resize(dog, dog, cv::Size(640, 480));\n cv::imshow(\"dog\", dog);\n if (cv::waitKey(1) >= 0) break;\n\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SceneFactory.hpp\"\n\n#include <algorithm>\n#include <assert.h>\n#include \"..\/Image\/ImageLoader.hpp\"\n#include \"..\/Geometry\/ModelLoader.hpp\"\n#include \"..\/..\/Util\/FileLoad.hpp\"\n\nSceneFactory::SceneFactory(TextureStore* tStore, ModelStore* mdlStore, MaterialStore* matStore, ScreenContext::FileDataCache* fdc)\n : mTextureStore(tStore)\n , mModelStore(mdlStore)\n , mMaterialStore(matStore)\n , mFileDataCache(fdc)\n{\n}\n\nstd::unique_ptr<Scene> SceneFactory::CreateFromSceneFile(const SceneFile& sceneFile)\n{\n std::unique_ptr<Scene> scene(std::make_unique<Scene>());\n\n LoadTextures(sceneFile.textures, sceneFile.images);\n LoadMaterials(sceneFile.materials);\n LoadGeometries(sceneFile.geometries);\n\n BakeScene(scene.get(), sceneFile.object.children);\n\n return std::move(scene);\n}\n\nvoid SceneFactory::LoadTextures(const std::vector<SceneFile::Texture>& textures, const std::vector<SceneFile::Image>& images)\n{\n \/\/ The ImageLoader object\n ImageLoader imageLoader;\n\n for(auto& texture : textures)\n {\n \/\/ Ignore that texture if it has already been loaded\n if((*mTextureStore)[std::to_string(texture.id)] != nullptr)\n continue;\n\n \/\/ Find the coresponding image\n auto img = std::find_if(std::begin(images), std::end(images),\n [&texture](const SceneFile::Image& image)->bool\n {\n return texture.image == image.id;\n }\n );\n\n \/\/ Assert if no image with the given UUID exists in scene file\n assert(img != std::end(images));\n\n std::string ext = img->url.substr(img->url.find_last_of(\".\") + 1);\n RawImage<> pb = imageLoader.Load(*(*mFileDataCache)[img->url], ext);\n mTextureStore->Load(std::to_string(texture.id), pb);\n }\n}\n\nvoid SceneFactory::LoadMaterials(const std::vector<SceneFile::Material>& materials)\n{\n for(auto& material : materials)\n {\n \/\/ Ignore that material if it has already been loaded\n if((*mMaterialStore)[std::to_string(material.id)] != nullptr)\n continue;\n\n Material newMat;\n\n const std::string& diffId = std::to_string(material.map);\n const std::string& specId = std::to_string(material.specMap);\n const std::string& normalMapId = std::to_string(material.nmap);\n\n if(diffId.compare(\"\") != 0)\n newMat.SetDiffuseTexture((*mTextureStore)[diffId]->texId);\n\n \/\/ Add specular\n if(specId.compare(\"\") != 0)\n newMat.SetSpecularTexture((*mTextureStore)[specId]->texId);\n\n \/\/ Add normal map\n if(normalMapId.compare(\"\") != 0)\n newMat.SetNormalMapTexture((*mTextureStore)[normalMapId]->texId);\n\n \/\/ Add color\n newMat.SetDiffuseColor(glm::vec3(material.color.r, material.color.g, material.color.b));\n newMat.SetShininess(material.shininess);\n\n mMaterialStore->Load(std::to_string(material.id), newMat);\n }\n}\n\nvoid SceneFactory::LoadGeometries(const std::vector<SceneFile::Geometry>& geometries)\n{\n \/\/ Model loader instance\n ModelLoader modelLoader;\n\n for(auto& geometry : geometries)\n {\n \/\/ Ignore that geometry if it has alredy been loaded\n if((*mModelStore)[std::to_string(geometry.id)] != nullptr)\n continue;\n\n \/\/ Check if path not empty\n if(geometry.url.empty())\n continue;\n\n \/\/ Check if model is already loaded and if not, load it now!\n if((*mFileDataCache).find(geometry.url) == std::end(*mFileDataCache))\n {\n mFileDataCache->emplace(geometry.url, FileLoad<BufferType>(geometry.url));\n if(!(*mFileDataCache)[geometry.url])\n throw std::runtime_error(\"Couldn't load file (\" + geometry.url + \")\");\n }\n\n \/\/ Find the file\n auto& file = (*mFileDataCache)[geometry.url];\n\n \/\/ Find file extension\n std::string ext = geometry.url.substr(geometry.url.find_last_of(\".\") + 1);\n\n \/\/ Load model\n ModelData model = modelLoader.Load(*file, ext.c_str());\n if(model.meshes.size() == 0)\n throw std::runtime_error(\"Couldn't load model (\" + geometry.url + \")\");\n\n mModelStore->Load(std::to_string(geometry.id), std::move(model));\n\n \/\/(*mModelStore)[geometry.uuid.ToString()]->material = *(*mMaterialStore)[m.material];\n }\n}\n\nvoid SceneFactory::BakeScene(Scene* const sceneToBake, const std::vector<SceneFile::Object::Child>& children)\n{\n \/\/ Add objects to scene\n for(auto& child : children)\n {\n \/\/ Find the right geometry\n ModelDescription* model = (*mModelStore)[std::to_string(child.geometry)];\n\n \/\/ Find the right category\n Category category = (child.type.compare(\"Mesh\") == 0) ? Category::Normal : Category::Light;\n\n \/\/ Create Scene Node\n const auto& initAABB = model->localAABB;\n std::vector<std::string> materials;\n for (const auto& mat : child.materials)\n materials.push_back(std::to_string(mat));\n sceneToBake->CreateNode(std::to_string(child.geometry), materials, child.name, category, initAABB);\n\n \/\/ Set initial transformation\n SceneNode* node = sceneToBake->FindNodeByUuid(child.name);\n node->Move(child.transform.position);\n node->Scale(child.transform.scale);\n node->Rotate(RotationAxis::X, child.transform.rotation.x);\n node->Rotate(RotationAxis::Y, child.transform.rotation.y);\n node->Rotate(RotationAxis::Z, child.transform.rotation.z);\n }\n}\n<commit_msg>Specular color values are now taken into account when building scene<commit_after>#include \"SceneFactory.hpp\"\n\n#include <algorithm>\n#include <assert.h>\n#include \"..\/Image\/ImageLoader.hpp\"\n#include \"..\/Geometry\/ModelLoader.hpp\"\n#include \"..\/..\/Util\/FileLoad.hpp\"\n\nSceneFactory::SceneFactory(TextureStore* tStore, ModelStore* mdlStore, MaterialStore* matStore, ScreenContext::FileDataCache* fdc)\n : mTextureStore(tStore)\n , mModelStore(mdlStore)\n , mMaterialStore(matStore)\n , mFileDataCache(fdc)\n{\n}\n\nstd::unique_ptr<Scene> SceneFactory::CreateFromSceneFile(const SceneFile& sceneFile)\n{\n std::unique_ptr<Scene> scene(std::make_unique<Scene>());\n\n LoadTextures(sceneFile.textures, sceneFile.images);\n LoadMaterials(sceneFile.materials);\n LoadGeometries(sceneFile.geometries);\n\n BakeScene(scene.get(), sceneFile.object.children);\n\n return std::move(scene);\n}\n\nvoid SceneFactory::LoadTextures(const std::vector<SceneFile::Texture>& textures, const std::vector<SceneFile::Image>& images)\n{\n \/\/ The ImageLoader object\n ImageLoader imageLoader;\n\n for(auto& texture : textures)\n {\n \/\/ Ignore that texture if it has already been loaded\n if((*mTextureStore)[std::to_string(texture.id)] != nullptr)\n continue;\n\n \/\/ Find the coresponding image\n auto img = std::find_if(std::begin(images), std::end(images),\n [&texture](const SceneFile::Image& image)->bool\n {\n return texture.image == image.id;\n }\n );\n\n \/\/ Assert if no image with the given UUID exists in scene file\n assert(img != std::end(images));\n\n std::string ext = img->url.substr(img->url.find_last_of(\".\") + 1);\n RawImage<> pb = imageLoader.Load(*(*mFileDataCache)[img->url], ext);\n mTextureStore->Load(std::to_string(texture.id), pb);\n }\n}\n\nvoid SceneFactory::LoadMaterials(const std::vector<SceneFile::Material>& materials)\n{\n for(auto& material : materials)\n {\n \/\/ Ignore that material if it has already been loaded\n if((*mMaterialStore)[std::to_string(material.id)] != nullptr)\n continue;\n\n Material newMat;\n\n const std::string& diffId = std::to_string(material.map);\n const std::string& specId = std::to_string(material.specMap);\n const std::string& normalMapId = std::to_string(material.nmap);\n\n if(diffId.compare(\"\") != 0)\n newMat.SetDiffuseTexture((*mTextureStore)[diffId]->texId);\n\n \/\/ Add specular\n if(specId.compare(\"\") != 0)\n newMat.SetSpecularTexture((*mTextureStore)[specId]->texId);\n\n \/\/ Add normal map\n if(normalMapId.compare(\"\") != 0)\n newMat.SetNormalMapTexture((*mTextureStore)[normalMapId]->texId);\n\n \/\/ Add color\n newMat.SetDiffuseColor(glm::vec3(material.color.r, material.color.g, material.color.b));\n newMat.SetSpecularColor(glm::vec3(material.specular.r, material.specular.g, material.specular.b));\n newMat.SetShininess(material.shininess);\n\n mMaterialStore->Load(std::to_string(material.id), newMat);\n }\n}\n\nvoid SceneFactory::LoadGeometries(const std::vector<SceneFile::Geometry>& geometries)\n{\n \/\/ Model loader instance\n ModelLoader modelLoader;\n\n for(auto& geometry : geometries)\n {\n \/\/ Ignore that geometry if it has alredy been loaded\n if((*mModelStore)[std::to_string(geometry.id)] != nullptr)\n continue;\n\n \/\/ Check if path not empty\n if(geometry.url.empty())\n continue;\n\n \/\/ Check if model is already loaded and if not, load it now!\n if((*mFileDataCache).find(geometry.url) == std::end(*mFileDataCache))\n {\n mFileDataCache->emplace(geometry.url, FileLoad<BufferType>(geometry.url));\n if(!(*mFileDataCache)[geometry.url])\n throw std::runtime_error(\"Couldn't load file (\" + geometry.url + \")\");\n }\n\n \/\/ Find the file\n auto& file = (*mFileDataCache)[geometry.url];\n\n \/\/ Find file extension\n std::string ext = geometry.url.substr(geometry.url.find_last_of(\".\") + 1);\n\n \/\/ Load model\n ModelData model = modelLoader.Load(*file, ext.c_str());\n if(model.meshes.size() == 0)\n throw std::runtime_error(\"Couldn't load model (\" + geometry.url + \")\");\n\n mModelStore->Load(std::to_string(geometry.id), std::move(model));\n\n \/\/(*mModelStore)[geometry.uuid.ToString()]->material = *(*mMaterialStore)[m.material];\n }\n}\n\nvoid SceneFactory::BakeScene(Scene* const sceneToBake, const std::vector<SceneFile::Object::Child>& children)\n{\n \/\/ Add objects to scene\n for(auto& child : children)\n {\n \/\/ Find the right geometry\n ModelDescription* model = (*mModelStore)[std::to_string(child.geometry)];\n\n \/\/ Find the right category\n Category category = (child.type.compare(\"Mesh\") == 0) ? Category::Normal : Category::Light;\n\n \/\/ Create Scene Node\n const auto& initAABB = model->localAABB;\n std::vector<std::string> materials;\n for (const auto& mat : child.materials)\n materials.push_back(std::to_string(mat));\n sceneToBake->CreateNode(std::to_string(child.geometry), materials, child.name, category, initAABB);\n\n \/\/ Set initial transformation\n SceneNode* node = sceneToBake->FindNodeByUuid(child.name);\n node->Move(child.transform.position);\n node->Scale(child.transform.scale);\n node->Rotate(RotationAxis::X, child.transform.rotation.x);\n node->Rotate(RotationAxis::Y, child.transform.rotation.y);\n node->Rotate(RotationAxis::Z, child.transform.rotation.z);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"common.h\"\n\n#define __STDC_LIMIT_MACROS\n#define __STDC_CONSTANT_MACROS\n#include \"llvm\/Instruction.h\"\n#include \"llvm\/Type.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nnamespace spirsim\n{\n TypedValue clone(const TypedValue& source)\n {\n TypedValue dest;\n dest.size = source.size;\n dest.data = new unsigned char[dest.size];\n memcpy(dest.data, source.data, dest.size);\n return dest;\n }\n\n void dumpInstruction(const llvm::Instruction& instruction, bool align)\n {\n cout << setfill(' ');\n\n size_t resultSize = getInstructionResultSize(instruction);\n if (resultSize > 0)\n {\n cout << \"%\" << setw(12) << left\n << instruction.getName().str()\n << \"(\" << resultSize << \") = \";\n }\n else if (align)\n {\n cout << setw(19) << \" \";\n }\n\n cout << left << setw(align?14:0) << instruction.getOpcodeName();\n\n llvm::User::const_op_iterator opItr;\n for (opItr = instruction.op_begin(); opItr != instruction.op_end(); opItr++)\n {\n \/\/ TODO: Constant values\n cout << \" %\" << opItr->get()->getName().str();\n }\n\n cout << right << endl;\n }\n\n size_t getInstructionResultSize(const llvm::Instruction& instruction)\n {\n size_t bits = instruction.getType()->getPrimitiveSizeInBits();\n size_t resultSize = bits >> 3;\n\n \/\/ Special case for GEP\n if (instruction.getOpcode() == llvm::Instruction::GetElementPtr)\n {\n resultSize = sizeof(size_t);\n }\n\n \/\/ Special case for boolean results\n if (bits == 1)\n {\n resultSize = sizeof(bool);\n }\n\n return resultSize;\n }\n\n size_t getTypeSize(const llvm::Type *type)\n {\n if (type->isArrayTy())\n {\n size_t num = type->getArrayNumElements();\n size_t sz = getTypeSize(type->getArrayElementType());\n return num*sz;\n }\n else if (type->isStructTy())\n {\n size_t size = 0;\n for (int i = 0; i < type->getStructNumElements(); i++)\n {\n size += getTypeSize(type->getStructElementType(i));\n }\n return size;\n }\n else\n {\n return ((llvm::Type*)type)->getScalarSizeInBits()>>3;\n }\n }\n\n bool isConstantOperand(const llvm::Value *operand)\n {\n unsigned id = operand->getValueID();\n return (id >= llvm::Value::ConstantFirstVal &&\n id <= llvm::Value::ConstantLastVal);\n }\n}\n<commit_msg>Added support for vector types sizes.<commit_after>#include \"common.h\"\n\n#define __STDC_LIMIT_MACROS\n#define __STDC_CONSTANT_MACROS\n#include \"llvm\/Instruction.h\"\n#include \"llvm\/Type.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nnamespace spirsim\n{\n TypedValue clone(const TypedValue& source)\n {\n TypedValue dest;\n dest.size = source.size;\n dest.data = new unsigned char[dest.size];\n memcpy(dest.data, source.data, dest.size);\n return dest;\n }\n\n void dumpInstruction(const llvm::Instruction& instruction, bool align)\n {\n cout << setfill(' ');\n\n size_t resultSize = getInstructionResultSize(instruction);\n if (resultSize > 0)\n {\n cout << \"%\" << setw(12) << left\n << instruction.getName().str()\n << \"(\" << resultSize << \") = \";\n }\n else if (align)\n {\n cout << setw(19) << \" \";\n }\n\n cout << left << setw(align?14:0) << instruction.getOpcodeName();\n\n llvm::User::const_op_iterator opItr;\n for (opItr = instruction.op_begin(); opItr != instruction.op_end(); opItr++)\n {\n \/\/ TODO: Constant values\n cout << \" %\" << opItr->get()->getName().str();\n }\n\n cout << right << endl;\n }\n\n size_t getInstructionResultSize(const llvm::Instruction& instruction)\n {\n size_t bits = instruction.getType()->getPrimitiveSizeInBits();\n size_t resultSize = bits >> 3;\n\n \/\/ Special case for GEP\n if (instruction.getOpcode() == llvm::Instruction::GetElementPtr)\n {\n resultSize = sizeof(size_t);\n }\n\n \/\/ Special case for boolean results\n if (bits == 1)\n {\n resultSize = sizeof(bool);\n }\n\n return resultSize;\n }\n\n size_t getTypeSize(const llvm::Type *type)\n {\n if (type->isArrayTy())\n {\n size_t num = type->getArrayNumElements();\n size_t sz = getTypeSize(type->getArrayElementType());\n return num*sz;\n }\n else if (type->isStructTy())\n {\n size_t size = 0;\n for (int i = 0; i < type->getStructNumElements(); i++)\n {\n size += getTypeSize(type->getStructElementType(i));\n }\n return size;\n }\n else if (type->isVectorTy())\n {\n size_t num = type->getVectorNumElements();\n size_t sz = getTypeSize(type->getVectorElementType());\n return num*sz;\n }\n else\n {\n return ((llvm::Type*)type)->getScalarSizeInBits()>>3;\n }\n }\n\n bool isConstantOperand(const llvm::Value *operand)\n {\n unsigned id = operand->getValueID();\n return (id >= llvm::Value::ConstantFirstVal &&\n id <= llvm::Value::ConstantLastVal);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __STAN__IO__WRITER_HPP__\n#define __STAN__IO__WRITER_HPP__\n\n#include <cstddef>\n#include <stdexcept>\n#include <vector>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <stan\/math\/matrix.hpp>\n#include <stan\/math\/special_functions.hpp>\n\n#include <stan\/prob\/transform.hpp>\n\nnamespace stan {\n\n namespace io {\n\n \/**\n * A stream-based writer for integer, scalar, vector, matrix\n * and array data types, which transforms from constrained to\n * a sequence of constrained variables. \n *\n * <p>This class converts constrained values to unconstrained\n * values with mappings that invert those defined in\n * <code>stan::io::reader<\/code> to convert unconstrained values\n * to constrained values.\n *\n * @tparam T Basic scalar type.\n *\/\n template <typename T>\n class writer {\n private:\n std::vector<T> data_r_;\n std::vector<int> data_i_;\n public:\n\n typedef typename stan::math::EigenType<T>::matrix matrix_t;\n typedef typename stan::math::EigenType<T>::vector vector_t;\n typedef typename stan::math::EigenType<T>::row_vector row_vector_t;\n \n typedef Eigen::Array<T,Eigen::Dynamic,1> array_vec_t;\n\n \/**\n * This is the tolerance for checking arithmetic bounds\n * in rank and in simplexes. The current value is <code>1E-8<\/code>.\n *\/\n const double CONSTRAINT_TOLERANCE;\n\n \/**\n * Construct a writer that writes to the specified\n * scalar and integer vectors.\n *\n * @param data_r Scalar values.\n * @param data_i Integer values.\n *\/\n writer(std::vector<T>& data_r,\n std::vector<int>& data_i)\n : data_r_(data_r),\n data_i_(data_i),\n CONSTRAINT_TOLERANCE(1E-8) {\n }\n\n \/**\n * Destroy this writer.\n *\/\n ~writer() { }\n\n \/**\n * Return a reference to the underlying vector of real values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<T>& data_r() {\n return &data_r_;\n }\n\n\n \/**\n * Return a reference to the underlying vector of integer values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<int>& data_i() {\n return &data_i_;\n }\n\n \/**\n * Write the specified integer to the sequence of integer values.\n *\n * @param n Integer to write.\n *\/\n void integer(int n) {\n data_i_.push_back(n);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * scalar. Here, the unconstrain operation is a no-op, which\n * matches <code>reader::scalar_constrain()<\/code>.\n *\n * @param y The value.\n *\/\n void scalar_unconstrain(T& y) {\n data_r_.push_back(y);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * positive-constrained scalar. The transformation applied is\n * <code>log(y)<\/code>, which is the inverse of constraining\n * transform specified in <code>reader::scalar_pos_constrain()<\/code>.\n *\n * <p>This method will fail if the argument is not non-negative.\n *\n * @param y The positive value.\n * @throw std::runtime_error if y is negative.\n *\/\n void scalar_pos_unconstrain(T& y) {\n if (y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is negative\"));\n data_r_.push_back(log(y));\n }\n\n \/**\n * Return the unconstrained version of the specified input,\n * which is constrained to be above the specified lower bound.\n * The unconstraining transform is <code>log(y - lb)<\/code>, which \n * inverts the constraining\n * transform defined in <code>reader::scalar_lb_constrain(double)<\/code>,\n *\n * @param lb Lower bound.\n * @param y Lower-bounded value.\n * @throw std::runtime_error if y is lower than the lower bound provided.\n *\/\n void scalar_lb_unconstrain(double lb, T& y) {\n if (y < lb)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is lower than the lower bound\"));\n data_r_.push_back(log(y - lb));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * lower-bounded value. The unconstraining transform is\n * <code>log(ub - y)<\/code>, which reverses the constraining\n * transform defined in <code>reader::scalar_ub_constrain(double)<\/code>.\n *\n * @param ub Upper bound.\n * @param y Constrained value.\n * @throw std::runtime_error if y is higher than the upper bound provided.\n *\/\n void scalar_ub_unconstrain(double ub, T& y) {\n if (y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is higher than the lower bound\"));\n data_r_.push_back(log(ub - y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * value with the specified bounds. The unconstraining\n * transform is given by <code>reader::logit((y-L)\/(U-L))<\/code>, which\n * inverts the constraining transform defined in\n * <code>scalar_lub_constrain(double,double)<\/code>.\n *\n * @param lb Lower bound.\n * @param ub Upper bound.\n * @param y Bounded value.\n * @throw std::runtime_error if y is not between the lower and upper bounds\n *\/\n void scalar_lub_unconstrain(double lb, double ub, T& y) {\n if (y < lb || y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between the lower and upper bounds\"));\n data_r_.push_back(stan::math::logit((y - lb) \/ (ub - lb)));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * correlation-constrained variable.\n *\n * <p>The unconstraining transform is <code>atanh(y)<\/code>, which\n * reverses the transfrom in <code>corr_constrain()<\/code>.\n *\n * @param y Correlation value.\n * @throw std::runtime_error if y is not between -1.0 and 1.0\n *\/\n void corr_unconstrain(T& y) {\n if (y > 1.0 || y < -1.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between -1.0 and 1.0\"));\n data_r_.push_back(atanh(y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the\n * specified probability value.\n *\n * <p>The unconstraining transform is <code>logit(y)<\/code>,\n * which inverts the constraining transform defined in\n * <code>prob_constrain()<\/code>.\n *\n * @param y Probability value.\n * @throw std::runtime_error if y is not between 0.0 and 1.0\n *\/\n void prob_unconstrain(T& y) {\n if (y > 1.0 || y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between 0.0 and 1.0\"));\n data_r_.push_back(stan::math::logit(y));\n }\n\n \/**\n * Write the unconstrained vector that corresponds to the specified\n * positive ordered vector.\n * \n * <p>The unconstraining transform is defined for input vector <code>y<\/code>\n * to produce an output vector <code>x<\/code> of the same size, defined\n * by <code>x[0] = log(y[0])<\/code> and by\n * <code>x[k] = log(y[k] - y[k-1])<\/code> for <code>k > 0<\/code>. This\n * unconstraining transform inverts the constraining transform specified\n * in <code>pos_ordered_constrain(size_t)<\/code>.\n *\n * @param y Positive, ordered vector.\n * @return Unconstrained vector corresponding to the specified vector.\n * @throw std::runtime_error if vector is not positive ordered\n *\/\n void pos_ordered_unconstrain(vector_t& y) {\n if (y.size() == 0) return;\n if(!stan::prob::pos_ordered_validate(y)) \n BOOST_THROW_EXCEPTION(std::runtime_error (\"vector is not positive ordered\"));\n data_r_.push_back(log(y[0]));\n for (size_t i = 1; i < y.size(); ++i) {\n data_r_.push_back(log(y[i] - y[i-1]));\n }\n }\n\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void row_vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained matrix.\n *\n * @param y Matrix to write.\n *\/\n void matrix_unconstrain(const matrix_t& y) {\n for (size_t i = 0; i < y.rows(); ++i)\n for (size_t j = 0; j < y.cols(); ++j) \n data_r_.push_back(y(i,j));\n }\n\n \n\n \/**\n * Write the unconstrained vector corresponding to the specified simplex \n * value. If the specified constrained simplex is of size <code>K<\/code>,\n * the returned unconstrained vector is of size <code>K-1<\/code>.\n *\n * <p>The transform takes <code>y = y[1],...,y[K]<\/code> and\n * produces the unconstrained vector <code>x = log(y[1]) -\n * log(y[K]), ..., log(y[K-1]) - log(y[K])<\/code>. This inverts\n * the constraining transform of\n * <code>simplex_constrain(size_t)<\/code>.\n *\n * @param y Simplex constrained value.\n * @return Unconstrained value.\n * @throw std::runtime_error if the vector is not a simplex.\n *\/\n void simplex_unconstrain(vector_t& y) {\n if (!stan::prob::simplex_validate(y))\n BOOST_THROW_EXCEPTION(std::runtime_error(\"y is not a simplex\"));\n size_t k_minus_1 = y.size() - 1;\n double log_y_k = log(y[k_minus_1]);\n for (size_t i = 0; i < k_minus_1; ++i) {\n data_r_.push_back(log(y[i]) - log_y_k);\n }\n }\n\n \/**\n * Writes the unconstrained correlation matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>corr_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained correlation matrix.\n * @throw std::runtime_error if the correlation matrix has no elements or\n * is not a square matrix.\n * @throw std::runtime_error if the correlation matrix cannot be factorized\n * by factor_cov_matrix() or if the sds returned by factor_cov_matrix()\n * on log scale are unconstrained.\n *\/\n void corr_matrix_unconstrain(matrix_t& y) {\n if (!stan::prob::corr_matrix_validate(y))\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not a valid correlation matrix\"));\n size_t k = y.rows();\n size_t k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if (!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y cannot be factorized by factor_cov_matrix\"));\n for (size_t i = 0; i < k; ++i) {\n \/\/ sds on log scale unconstrained\n if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"sds on log scale are unconstrained\"));\n }\n for (size_t i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n }\n\n \/**\n * Writes the unconstrained covariance matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>cov_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained covariance matrix.\n * @throw std::runtime_error if y has no elements or if it is not square\n *\/\n void cov_matrix_unconstrain(matrix_t& y) {\n size_t k = y.rows();\n if (k == 0 || y.cols() != k)\n BOOST_THROW_EXCEPTION(\n std::runtime_error (\"y must have elements and y must be a square matrix\"));\n size_t k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if(!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"factor_cov_matrix failed\"));\n for (size_t i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n for (size_t i = 0; i < k; ++i)\n data_r_.push_back(sds[i]);\n }\n };\n }\n\n}\n\n#endif\n<commit_msg>removed unsigned int warnings for test\/io\/writer<commit_after>#ifndef __STAN__IO__WRITER_HPP__\n#define __STAN__IO__WRITER_HPP__\n\n#include <cstddef>\n#include <stdexcept>\n#include <vector>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <stan\/math\/matrix.hpp>\n#include <stan\/math\/special_functions.hpp>\n\n#include <stan\/prob\/transform.hpp>\n\nnamespace stan {\n\n namespace io {\n\n \/**\n * A stream-based writer for integer, scalar, vector, matrix\n * and array data types, which transforms from constrained to\n * a sequence of constrained variables. \n *\n * <p>This class converts constrained values to unconstrained\n * values with mappings that invert those defined in\n * <code>stan::io::reader<\/code> to convert unconstrained values\n * to constrained values.\n *\n * @tparam T Basic scalar type.\n *\/\n template <typename T>\n class writer {\n private:\n std::vector<T> data_r_;\n std::vector<int> data_i_;\n public:\n\n typedef typename stan::math::EigenType<T>::matrix matrix_t;\n typedef typename stan::math::EigenType<T>::vector vector_t;\n typedef typename stan::math::EigenType<T>::row_vector row_vector_t;\n \n typedef Eigen::Array<T,Eigen::Dynamic,1> array_vec_t;\n\n \/**\n * This is the tolerance for checking arithmetic bounds\n * in rank and in simplexes. The current value is <code>1E-8<\/code>.\n *\/\n const double CONSTRAINT_TOLERANCE;\n\n \/**\n * Construct a writer that writes to the specified\n * scalar and integer vectors.\n *\n * @param data_r Scalar values.\n * @param data_i Integer values.\n *\/\n writer(std::vector<T>& data_r,\n std::vector<int>& data_i)\n : data_r_(data_r),\n data_i_(data_i),\n CONSTRAINT_TOLERANCE(1E-8) {\n }\n\n \/**\n * Destroy this writer.\n *\/\n ~writer() { }\n\n \/**\n * Return a reference to the underlying vector of real values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<T>& data_r() {\n return &data_r_;\n }\n\n\n \/**\n * Return a reference to the underlying vector of integer values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<int>& data_i() {\n return &data_i_;\n }\n\n \/**\n * Write the specified integer to the sequence of integer values.\n *\n * @param n Integer to write.\n *\/\n void integer(int n) {\n data_i_.push_back(n);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * scalar. Here, the unconstrain operation is a no-op, which\n * matches <code>reader::scalar_constrain()<\/code>.\n *\n * @param y The value.\n *\/\n void scalar_unconstrain(T& y) {\n data_r_.push_back(y);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * positive-constrained scalar. The transformation applied is\n * <code>log(y)<\/code>, which is the inverse of constraining\n * transform specified in <code>reader::scalar_pos_constrain()<\/code>.\n *\n * <p>This method will fail if the argument is not non-negative.\n *\n * @param y The positive value.\n * @throw std::runtime_error if y is negative.\n *\/\n void scalar_pos_unconstrain(T& y) {\n if (y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is negative\"));\n data_r_.push_back(log(y));\n }\n\n \/**\n * Return the unconstrained version of the specified input,\n * which is constrained to be above the specified lower bound.\n * The unconstraining transform is <code>log(y - lb)<\/code>, which \n * inverts the constraining\n * transform defined in <code>reader::scalar_lb_constrain(double)<\/code>,\n *\n * @param lb Lower bound.\n * @param y Lower-bounded value.\n * @throw std::runtime_error if y is lower than the lower bound provided.\n *\/\n void scalar_lb_unconstrain(double lb, T& y) {\n if (y < lb)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is lower than the lower bound\"));\n data_r_.push_back(log(y - lb));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * lower-bounded value. The unconstraining transform is\n * <code>log(ub - y)<\/code>, which reverses the constraining\n * transform defined in <code>reader::scalar_ub_constrain(double)<\/code>.\n *\n * @param ub Upper bound.\n * @param y Constrained value.\n * @throw std::runtime_error if y is higher than the upper bound provided.\n *\/\n void scalar_ub_unconstrain(double ub, T& y) {\n if (y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is higher than the lower bound\"));\n data_r_.push_back(log(ub - y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * value with the specified bounds. The unconstraining\n * transform is given by <code>reader::logit((y-L)\/(U-L))<\/code>, which\n * inverts the constraining transform defined in\n * <code>scalar_lub_constrain(double,double)<\/code>.\n *\n * @param lb Lower bound.\n * @param ub Upper bound.\n * @param y Bounded value.\n * @throw std::runtime_error if y is not between the lower and upper bounds\n *\/\n void scalar_lub_unconstrain(double lb, double ub, T& y) {\n if (y < lb || y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between the lower and upper bounds\"));\n data_r_.push_back(stan::math::logit((y - lb) \/ (ub - lb)));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * correlation-constrained variable.\n *\n * <p>The unconstraining transform is <code>atanh(y)<\/code>, which\n * reverses the transfrom in <code>corr_constrain()<\/code>.\n *\n * @param y Correlation value.\n * @throw std::runtime_error if y is not between -1.0 and 1.0\n *\/\n void corr_unconstrain(T& y) {\n if (y > 1.0 || y < -1.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between -1.0 and 1.0\"));\n data_r_.push_back(atanh(y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the\n * specified probability value.\n *\n * <p>The unconstraining transform is <code>logit(y)<\/code>,\n * which inverts the constraining transform defined in\n * <code>prob_constrain()<\/code>.\n *\n * @param y Probability value.\n * @throw std::runtime_error if y is not between 0.0 and 1.0\n *\/\n void prob_unconstrain(T& y) {\n if (y > 1.0 || y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between 0.0 and 1.0\"));\n data_r_.push_back(stan::math::logit(y));\n }\n\n \/**\n * Write the unconstrained vector that corresponds to the specified\n * positive ordered vector.\n * \n * <p>The unconstraining transform is defined for input vector <code>y<\/code>\n * to produce an output vector <code>x<\/code> of the same size, defined\n * by <code>x[0] = log(y[0])<\/code> and by\n * <code>x[k] = log(y[k] - y[k-1])<\/code> for <code>k > 0<\/code>. This\n * unconstraining transform inverts the constraining transform specified\n * in <code>pos_ordered_constrain(size_t)<\/code>.\n *\n * @param y Positive, ordered vector.\n * @return Unconstrained vector corresponding to the specified vector.\n * @throw std::runtime_error if vector is not positive ordered\n *\/\n void pos_ordered_unconstrain(vector_t& y) {\n if (y.size() == 0) return;\n if(!stan::prob::pos_ordered_validate(y)) \n BOOST_THROW_EXCEPTION(std::runtime_error (\"vector is not positive ordered\"));\n data_r_.push_back(log(y[0]));\n for (typename vector_t::size_type i = 1; i < y.size(); ++i) {\n data_r_.push_back(log(y[i] - y[i-1]));\n }\n }\n\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void row_vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained matrix.\n *\n * @param y Matrix to write.\n *\/\n void matrix_unconstrain(const matrix_t& y) {\n for (size_t i = 0; i < y.rows(); ++i)\n for (size_t j = 0; j < y.cols(); ++j) \n data_r_.push_back(y(i,j));\n }\n\n \n\n \/**\n * Write the unconstrained vector corresponding to the specified simplex \n * value. If the specified constrained simplex is of size <code>K<\/code>,\n * the returned unconstrained vector is of size <code>K-1<\/code>.\n *\n * <p>The transform takes <code>y = y[1],...,y[K]<\/code> and\n * produces the unconstrained vector <code>x = log(y[1]) -\n * log(y[K]), ..., log(y[K-1]) - log(y[K])<\/code>. This inverts\n * the constraining transform of\n * <code>simplex_constrain(size_t)<\/code>.\n *\n * @param y Simplex constrained value.\n * @return Unconstrained value.\n * @throw std::runtime_error if the vector is not a simplex.\n *\/\n void simplex_unconstrain(vector_t& y) {\n if (!stan::prob::simplex_validate(y))\n BOOST_THROW_EXCEPTION(std::runtime_error(\"y is not a simplex\"));\n size_t k_minus_1 = y.size() - 1;\n double log_y_k = log(y[k_minus_1]);\n for (size_t i = 0; i < k_minus_1; ++i) {\n data_r_.push_back(log(y[i]) - log_y_k);\n }\n }\n\n \/**\n * Writes the unconstrained correlation matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>corr_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained correlation matrix.\n * @throw std::runtime_error if the correlation matrix has no elements or\n * is not a square matrix.\n * @throw std::runtime_error if the correlation matrix cannot be factorized\n * by factor_cov_matrix() or if the sds returned by factor_cov_matrix()\n * on log scale are unconstrained.\n *\/\n void corr_matrix_unconstrain(matrix_t& y) {\n if (!stan::prob::corr_matrix_validate(y))\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not a valid correlation matrix\"));\n size_t k = y.rows();\n size_t k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if (!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y cannot be factorized by factor_cov_matrix\"));\n for (size_t i = 0; i < k; ++i) {\n \/\/ sds on log scale unconstrained\n if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"sds on log scale are unconstrained\"));\n }\n for (size_t i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n }\n\n \/**\n * Writes the unconstrained covariance matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>cov_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained covariance matrix.\n * @throw std::runtime_error if y has no elements or if it is not square\n *\/\n void cov_matrix_unconstrain(matrix_t& y) {\n typename matrix_t::size_type k = y.rows();\n if (k == 0 || y.cols() != k)\n BOOST_THROW_EXCEPTION(\n std::runtime_error (\"y must have elements and y must be a square matrix\"));\n typename matrix_t::size_type k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if(!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"factor_cov_matrix failed\"));\n for (typename matrix_t::size_type i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n for (typename matrix_t::size_type i = 0; i < k; ++i)\n data_r_.push_back(sds[i]);\n }\n };\n }\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2003-2005 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSCryptCryptoBase64 := Internal implementation of a base64 \n * encoder\/decoder\n *\n * Author(s): Berin Lautenbach\n *\n * $Id$\n *\n *\/\n\n#include <xsec\/enc\/XSCrypt\/XSCryptCryptoBase64.hpp>\n#include <xsec\/enc\/XSECCryptoException.hpp>\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Lookup tables and macros\n\/\/ --------------------------------------------------------------------------------\n\nchar Base64LookupTable[] = {\n\t'A','B','C','D','E','F','G','H','I','J','K','L','M',\n\t'N','O','P','Q','R','S','T','U','V','W','X','Y','Z',\n\t'a','b','c','d','e','f','g','h','i','j','k','l','m',\n\t'n','o','p','q','r','s','t','u','v','w','x','y','z',\n\t'0','1','2','3','4','5','6','7','8','9','+','\/',\n};\n\n#define IS_UPPER(c) (c >= 'A' && c <= 'Z')\n#define IS_LOWER(c) (c >= 'a' && c <= 'z')\n#define IS_NUMBR(c) (c >= '0' && c <= '9')\n#define IS_OTHER(c) (c == '+' || c == '\/')\n#define IS_B64CH(c) (IS_LOWER(c) || IS_UPPER(c) || IS_NUMBR(c) || IS_OTHER(c))\n#define IS_B64OE(c) (IS_B64CH(c) || c == '=')\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Decoding\n\/\/ --------------------------------------------------------------------------------\n\nunsigned char decodeCh(unsigned char c) {\n\n\tif (IS_UPPER(c))\n\t\treturn c - 'A';\n\n\tif (IS_LOWER(c))\n\t\treturn (c - 'a') + 26;\n\n\tif (IS_NUMBR(c))\n\t\treturn (c - '0') + 52;\n\n\tif (c == '+')\n\t\treturn 62;\n\tif (c == '\/')\n\t\treturn 63;\n\n\tif (c == '=')\n\t\treturn 64;\n\n\treturn 65;\t\t\/\/ error;\n\n}\n\nvoid XSCryptCryptoBase64::canonicaliseInput(const unsigned char *inData, \n\t\t\t\t\t\t\t\t\t\t\tunsigned int inLength) {\n\n\t\/\/ Canonicalise the input buffer into m_inputBuffer\n\n\tunsigned char buf[400];\t\t\t\/\/ Do 400 bytes at a time\n\n\tunsigned int i, j;\n\tj = 0;\n\n\tfor (i = 0; i < inLength; ++i) {\n\n\t\tif (IS_B64OE(inData[i])) {\n\n\t\t\t\/\/ Have a base64 or '=' char\n\t\t\tbuf[j++] = inData[i];\n\n\t\t\tif (j == 400) {\n\t\t\t\tm_inputBuffer.sbMemcpyIn(m_remainingInput, buf, 400);\n\t\t\t\tm_remainingInput += 400;\n\t\t\t\tj = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (j > 0) {\n\t\tm_inputBuffer.sbMemcpyIn(m_remainingInput, buf, j);\n\t\tm_remainingInput += j;\n\t}\n\n}\n\n\nvoid XSCryptCryptoBase64::decodeInit(void) {\n\n\tm_remainingInput = m_remainingOutput = 0;\n\tm_allDone = false;\n\tm_state = B64_DECODE;\n\n}\n\nunsigned int XSCryptCryptoBase64::decode(const unsigned char * inData, \n\t\t\t\t\t\t \t unsigned int inLength,\n\t\t\t\t\t\t\t\tunsigned char * outData,\n\t\t\t\t\t\t\t\tunsigned int outLength) {\n\n\n\t\/\/ Ensure we are in an appropriate state\n\tif (m_state != B64_DECODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to decode when not in decode state\");\n\t\n\t}\n\n\t\/\/ Copy the data into our input buffer\n\tcanonicaliseInput(inData, inLength);\n\n\tunsigned int i = 0;\n\tunsigned char t;\n\n\twhile (m_allDone != true && m_remainingInput - i >= 4) {\n\n\t\t\/\/ BYTE 1\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 63) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tm_outputBuffer[m_remainingOutput] = (t << 2);\n\n\t\t\/\/ BYTE 2\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 63) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\t\/\/ Take top two bits and place at end of current byte\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] |\n\t\t\t(t >> 4);\n\n\t\tm_remainingOutput++;\t\t\/\/ Have a new complete byte\n\n\t\t\/\/ Take remaining 4 bits and add to outputBuffer\n\t\tm_outputBuffer[m_remainingOutput] = ( t << 4);\n\n\t\t\/\/ BYTE 3\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 64) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tif (t == 64) {\n\n\t\t\t\/\/ '=' character found\n\n\t\t\tm_allDone = true;\n\t\t\tbreak;\n\n\t\t}\n\n\t\t\/\/ Take 4 bits and append to current buffer\n\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] | (t >> 2);\n\t\tm_remainingOutput++;\n\n\t\t\/\/ Take last 2 bits and append to buffer\n\n\t\tm_outputBuffer[m_remainingOutput] = (t << 6);\n\n\t\t\/\/ BYTE 4\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 64) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tif (t == 64) {\n\n\t\t\tm_allDone = true;\n\t\t\tbreak;\n\n\t\t}\n\n\t\t\/\/ Place all six bits and end of current byte\n\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] | t;\n\t\tm_remainingOutput++;\n\n\t}\n\n\t\/\/ Now whatever we've decoded can be placed in the output buffer\n\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse\n\t\tm_remainingOutput = 0;\n\n\tif (i != m_remainingInput) {\n\t\tm_remainingInput -= i;\n\t\tm_inputBuffer.sbMemshift(0, i, m_remainingInput);\n\t}\n\telse\n\t\tm_remainingInput = 0;\n\n\t\/\/ Return however much we have decoded\n\treturn cpyOut;\n\n}\n\nunsigned int XSCryptCryptoBase64::decodeFinish(unsigned char * outData,\n\t\t\t\t\t\t\t \t unsigned int outLength) {\n\n\tif (m_state != B64_DECODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to complete a decode when not in decode state\");\n\t\n\t}\n\n\tm_allDone = true;\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse {\n\t\tm_remainingOutput = 0;\n\t}\n\n\treturn cpyOut;\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Encoding\n\/\/ --------------------------------------------------------------------------------\n\nvoid XSCryptCryptoBase64::encodeInit(void) {\n\n\tm_remainingInput = m_remainingOutput = 0;\n\tm_allDone = false;\n\tm_charCount = 0;\n\tm_state = B64_ENCODE;\n\n}\n\n\nunsigned int XSCryptCryptoBase64::encode(const unsigned char * inData, \n\t\t\t\t\t\t \t unsigned int inLength,\n\t\t\t\t\t\t\t\tunsigned char * outData,\n\t\t\t\t\t\t\t\tunsigned int outLength) {\n\n\tif (m_state != B64_ENCODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to encode when not in encoding state\");\n\t\n\t}\n\n\t\/\/ Copy input data into end of input buffer\n\tm_inputBuffer.sbMemcpyIn(m_remainingInput, inData, inLength);\n\tm_remainingInput += inLength;\n\n\tunsigned int i = 0;\n\tunsigned char t;\n\n\twhile (m_allDone == false && m_remainingInput - i >= 3) {\n\n\t\t\/\/ Have a complete block of three bytes to encode\n\n\t\t\/\/ First 6 bits;\n\t\tt = (m_inputBuffer[i] >> 2);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 2 bits from byte one and 4 from byte 2\n\t\tt = ((m_inputBuffer[i++] << 4) & 0x30) | (m_inputBuffer[i] >> 4);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 4 from byte 2 and 2 from byte 3\n\t\tt = ((m_inputBuffer[i++] << 2) & 0x3C) | (m_inputBuffer[i] >> 6);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ last 6 bits from byte 3\n\t\tt = m_inputBuffer[i++] & 0x3F;\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\tm_charCount += 4;\n\n\t\tif (m_charCount >= 76) {\n\n\t\t\tm_outputBuffer[m_remainingOutput++] = '\\n';\n\t\t\tm_charCount = 0;\n\t\t\n\t\t}\n\n\t}\n\n\t\/\/ Now copy data out to output buffer\n\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse\n\t\tm_remainingOutput = 0;\n\n\tif (i != m_remainingInput) {\n\t\tm_remainingInput -= i;\n\t\tm_inputBuffer.sbMemshift(0, i, m_remainingInput);\n\t}\n\n\telse\n\n\t\tm_remainingInput = 0;\n\n\t\/\/ Return however much we have decoded\n\treturn cpyOut;\n\n}\n\nunsigned int XSCryptCryptoBase64::encodeFinish(unsigned char * outData,\n\t\t\t\t\t\t\t \t unsigned int outLength) {\n\n\tif (m_state != B64_ENCODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to complete an encode when not in encoding state\");\n\t\n\t}\n\n\tif (m_allDone == false && m_remainingInput > 0) {\n\n\t\t\/\/ Will always be < 3 characters remaining in inputBuffer\n\t\t\/\/ If necessary - terminate the Base64 string\n\n\t\tif (m_remainingInput >= 3) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\t\"XSCrypt:Base64 - Too much remaining input in input buffer\");\n\n\t\t}\n\n\t\t\/\/ First 6 bits;\n\t\tunsigned int t = (m_inputBuffer[0] >> 2);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 2 bits from byte one and 4 from byte 2\n\t\tt = ((m_inputBuffer[0] << 4) & 0x30);\n\t\t\n\t\tif (m_remainingInput == 1) {\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t}\n\n\t\telse {\n\n\t\t\tt |= (m_inputBuffer[1] >> 4);\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\t\/\/ 4 from byte 2\n\t\t\tt = ((m_inputBuffer[1] << 2) & 0x3C);\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t}\n\n\t}\n\n\tm_allDone = true;\n\n\t\/\/ Copy out\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse {\n\t\tm_remainingOutput = 0;\n\t}\n\n\treturn cpyOut;\n}\n<commit_msg>Bug in encode() fixed.<commit_after>\/*\n * Copyright 2003-2005 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XSCryptCryptoBase64 := Internal implementation of a base64 \n * encoder\/decoder\n *\n * Author(s): Berin Lautenbach\n *\n * $Id$\n *\n *\/\n\n#include <xsec\/enc\/XSCrypt\/XSCryptCryptoBase64.hpp>\n#include <xsec\/enc\/XSECCryptoException.hpp>\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Lookup tables and macros\n\/\/ --------------------------------------------------------------------------------\n\nchar Base64LookupTable[] = {\n\t'A','B','C','D','E','F','G','H','I','J','K','L','M',\n\t'N','O','P','Q','R','S','T','U','V','W','X','Y','Z',\n\t'a','b','c','d','e','f','g','h','i','j','k','l','m',\n\t'n','o','p','q','r','s','t','u','v','w','x','y','z',\n\t'0','1','2','3','4','5','6','7','8','9','+','\/',\n};\n\n#define IS_UPPER(c) (c >= 'A' && c <= 'Z')\n#define IS_LOWER(c) (c >= 'a' && c <= 'z')\n#define IS_NUMBR(c) (c >= '0' && c <= '9')\n#define IS_OTHER(c) (c == '+' || c == '\/')\n#define IS_B64CH(c) (IS_LOWER(c) || IS_UPPER(c) || IS_NUMBR(c) || IS_OTHER(c))\n#define IS_B64OE(c) (IS_B64CH(c) || c == '=')\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Decoding\n\/\/ --------------------------------------------------------------------------------\n\nunsigned char decodeCh(unsigned char c) {\n\n\tif (IS_UPPER(c))\n\t\treturn c - 'A';\n\n\tif (IS_LOWER(c))\n\t\treturn (c - 'a') + 26;\n\n\tif (IS_NUMBR(c))\n\t\treturn (c - '0') + 52;\n\n\tif (c == '+')\n\t\treturn 62;\n\tif (c == '\/')\n\t\treturn 63;\n\n\tif (c == '=')\n\t\treturn 64;\n\n\treturn 65;\t\t\/\/ error;\n\n}\n\nvoid XSCryptCryptoBase64::canonicaliseInput(const unsigned char *inData, \n\t\t\t\t\t\t\t\t\t\t\tunsigned int inLength) {\n\n\t\/\/ Canonicalise the input buffer into m_inputBuffer\n\n\tunsigned char buf[400];\t\t\t\/\/ Do 400 bytes at a time\n\n\tunsigned int i, j;\n\tj = 0;\n\n\tfor (i = 0; i < inLength; ++i) {\n\n\t\tif (IS_B64OE(inData[i])) {\n\n\t\t\t\/\/ Have a base64 or '=' char\n\t\t\tbuf[j++] = inData[i];\n\n\t\t\tif (j == 400) {\n\t\t\t\tm_inputBuffer.sbMemcpyIn(m_remainingInput, buf, 400);\n\t\t\t\tm_remainingInput += 400;\n\t\t\t\tj = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tif (j > 0) {\n\t\tm_inputBuffer.sbMemcpyIn(m_remainingInput, buf, j);\n\t\tm_remainingInput += j;\n\t}\n\n}\n\n\nvoid XSCryptCryptoBase64::decodeInit(void) {\n\n\tm_remainingInput = m_remainingOutput = 0;\n\tm_allDone = false;\n\tm_state = B64_DECODE;\n\n}\n\nunsigned int XSCryptCryptoBase64::decode(const unsigned char * inData, \n\t\t\t\t\t\t \t unsigned int inLength,\n\t\t\t\t\t\t\t\tunsigned char * outData,\n\t\t\t\t\t\t\t\tunsigned int outLength) {\n\n\n\t\/\/ Ensure we are in an appropriate state\n\tif (m_state != B64_DECODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to decode when not in decode state\");\n\t\n\t}\n\n\t\/\/ Copy the data into our input buffer\n\tcanonicaliseInput(inData, inLength);\n\n\tunsigned int i = 0;\n\tunsigned char t;\n\n\twhile (m_allDone != true && m_remainingInput - i >= 4) {\n\n\t\t\/\/ BYTE 1\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 63) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tm_outputBuffer[m_remainingOutput] = (t << 2);\n\n\t\t\/\/ BYTE 2\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 63) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\t\/\/ Take top two bits and place at end of current byte\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] |\n\t\t\t(t >> 4);\n\n\t\tm_remainingOutput++;\t\t\/\/ Have a new complete byte\n\n\t\t\/\/ Take remaining 4 bits and add to outputBuffer\n\t\tm_outputBuffer[m_remainingOutput] = ( t << 4);\n\n\t\t\/\/ BYTE 3\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 64) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tif (t == 64) {\n\n\t\t\t\/\/ '=' character found\n\n\t\t\tm_allDone = true;\n\t\t\tbreak;\n\n\t\t}\n\n\t\t\/\/ Take 4 bits and append to current buffer\n\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] | (t >> 2);\n\t\tm_remainingOutput++;\n\n\t\t\/\/ Take last 2 bits and append to buffer\n\n\t\tm_outputBuffer[m_remainingOutput] = (t << 6);\n\n\t\t\/\/ BYTE 4\n\n\t\tt = decodeCh(m_inputBuffer[i++]);\n\n\t\tif (t > 64) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Invalid character at start of base 64 block\");\n\n\t\t}\n\n\t\tif (t == 64) {\n\n\t\t\tm_allDone = true;\n\t\t\tbreak;\n\n\t\t}\n\n\t\t\/\/ Place all six bits and end of current byte\n\n\t\tm_outputBuffer[m_remainingOutput] = m_outputBuffer[m_remainingOutput] | t;\n\t\tm_remainingOutput++;\n\n\t}\n\n\t\/\/ Now whatever we've decoded can be placed in the output buffer\n\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse\n\t\tm_remainingOutput = 0;\n\n\tif (i != m_remainingInput) {\n\t\tm_remainingInput -= i;\n\t\tm_inputBuffer.sbMemshift(0, i, m_remainingInput);\n\t}\n\telse\n\t\tm_remainingInput = 0;\n\n\t\/\/ Return however much we have decoded\n\treturn cpyOut;\n\n}\n\nunsigned int XSCryptCryptoBase64::decodeFinish(unsigned char * outData,\n\t\t\t\t\t\t\t \t unsigned int outLength) {\n\n\tif (m_state != B64_DECODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to complete a decode when not in decode state\");\n\t\n\t}\n\n\tm_allDone = true;\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse {\n\t\tm_remainingOutput = 0;\n\t}\n\n\treturn cpyOut;\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Encoding\n\/\/ --------------------------------------------------------------------------------\n\nvoid XSCryptCryptoBase64::encodeInit(void) {\n\n\tm_remainingInput = m_remainingOutput = 0;\n\tm_allDone = false;\n\tm_charCount = 0;\n\tm_state = B64_ENCODE;\n\n}\n\n\nunsigned int XSCryptCryptoBase64::encode(const unsigned char * inData, \n\t\t\t\t\t\t \t unsigned int inLength,\n\t\t\t\t\t\t\t\tunsigned char * outData,\n\t\t\t\t\t\t\t\tunsigned int outLength) {\n\n\tif (m_state != B64_ENCODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to encode when not in encoding state\");\n\t\n\t}\n\n\t\/\/ Copy input data into end of input buffer\n\tm_inputBuffer.sbMemcpyIn(m_remainingInput, inData, inLength);\n\tm_remainingInput += inLength;\n\n\tunsigned int i = 0;\n\tunsigned char t;\n\n\twhile (m_allDone == false && m_remainingInput - i >= 3) {\n\n\t\t\/\/ Have a complete block of three bytes to encode\n\n\t\t\/\/ First 6 bits;\n\t\tt = (m_inputBuffer[i] >> 2);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 2 bits from byte one and 4 from byte 2\n\t\tt = ((m_inputBuffer[i++] << 4) & 0x30);\n\t\tt |= (m_inputBuffer[i] >> 4);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 4 from byte 2 and 2 from byte 3\n\t\tt = ((m_inputBuffer[i++] << 2) & 0x3C);\n\t\tt |= (m_inputBuffer[i] >> 6);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ last 6 bits from byte 3\n\t\tt = m_inputBuffer[i++] & 0x3F;\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\tm_charCount += 4;\n\n\t\tif (m_charCount >= 76) {\n\n\t\t\tm_outputBuffer[m_remainingOutput++] = '\\n';\n\t\t\tm_charCount = 0;\n\t\t\n\t\t}\n\n\t}\n\n\t\/\/ Now copy data out to output buffer\n\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse\n\t\tm_remainingOutput = 0;\n\n\tif (i != m_remainingInput) {\n\t\tm_remainingInput -= i;\n\t\tm_inputBuffer.sbMemshift(0, i, m_remainingInput);\n\t}\n\n\telse\n\n\t\tm_remainingInput = 0;\n\n\t\/\/ Return however much we have decoded\n\treturn cpyOut;\n\n}\n\nunsigned int XSCryptCryptoBase64::encodeFinish(unsigned char * outData,\n\t\t\t\t\t\t\t \t unsigned int outLength) {\n\n\tif (m_state != B64_ENCODE) {\n\n\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\"XSCrypt:Base64 - Attempt to complete an encode when not in encoding state\");\n\t\n\t}\n\n\tif (m_allDone == false && m_remainingInput > 0) {\n\n\t\t\/\/ Will always be < 3 characters remaining in inputBuffer\n\t\t\/\/ If necessary - terminate the Base64 string\n\n\t\tif (m_remainingInput >= 3) {\n\n\t\t\tthrow XSECCryptoException(XSECCryptoException::Base64Error,\n\t\t\t\t\"XSCrypt:Base64 - Too much remaining input in input buffer\");\n\n\t\t}\n\n\t\t\/\/ First 6 bits;\n\t\tunsigned int t = (m_inputBuffer[0] >> 2);\n\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\/\/ 2 bits from byte one and 4 from byte 2\n\t\tt = ((m_inputBuffer[0] << 4) & 0x30);\n\t\t\n\t\tif (m_remainingInput == 1) {\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t}\n\n\t\telse {\n\n\t\t\tt |= (m_inputBuffer[1] >> 4);\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\n\t\t\t\/\/ 4 from byte 2\n\t\t\tt = ((m_inputBuffer[1] << 2) & 0x3C);\n\t\t\tm_outputBuffer[m_remainingOutput++] = Base64LookupTable[t];\n\t\t\tm_outputBuffer[m_remainingOutput++] = '=';\n\t\t}\n\n\t}\n\n\tm_allDone = true;\n\n\t\/\/ Copy out\n\tunsigned int cpyOut = (m_remainingOutput < outLength ? m_remainingOutput : outLength);\n\n\tm_outputBuffer.sbMemcpyOut(outData, cpyOut);\n\n\t\/\/ Move the buffers down\n\tif (cpyOut != m_remainingOutput) {\n\t\tm_remainingOutput = m_remainingOutput - cpyOut;\n\t\tm_outputBuffer.sbMemshift(0, cpyOut, m_remainingOutput);\n\t}\n\telse {\n\t\tm_remainingOutput = 0;\n\t}\n\n\treturn cpyOut;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"content\/browser\/renderer_host\/accelerated_surface_container_linux.h\"\n\n#include <X11\/Xlib.h>\n#include <X11\/extensions\/Xcomposite.h>\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/memory\/scoped_ptr.h\"\n#include \"third_party\/angle\/include\/EGL\/egl.h\"\n#include \"third_party\/angle\/include\/EGL\/eglext.h\"\n#include \"ui\/gfx\/gl\/gl_bindings.h\"\n#include \"ui\/gfx\/gl\/gl_implementation.h\"\n#include \"ui\/gfx\/gl\/gl_surface_egl.h\"\n#include \"ui\/gfx\/gl\/gl_surface_glx.h\"\n#include \"ui\/gfx\/rect.h\"\n#include \"ui\/gfx\/transform.h\"\n\nnamespace {\n\nclass AcceleratedSurfaceContainerLinuxEGL\n : public AcceleratedSurfaceContainerLinux {\n public:\n explicit AcceleratedSurfaceContainerLinuxEGL(const gfx::Size& size);\n\n virtual bool Initialize(uint64* surface_id) OVERRIDE;\n\n \/\/ TextureGL implementation\n virtual void Draw(const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) OVERRIDE;\n\n private:\n virtual ~AcceleratedSurfaceContainerLinuxEGL();\n\n void* image_;\n\n DISALLOW_COPY_AND_ASSIGN(AcceleratedSurfaceContainerLinuxEGL);\n};\n\nclass AcceleratedSurfaceContainerLinuxGLX\n : public AcceleratedSurfaceContainerLinux {\n public:\n explicit AcceleratedSurfaceContainerLinuxGLX(const gfx::Size& size);\n\n virtual bool Initialize(uint64* surface_id) OVERRIDE;\n\n \/\/ TextureGL implementation\n virtual void Draw(const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) OVERRIDE;\n\n protected:\n static bool InitializeOneOff();\n\n static base::LazyInstance<GLXFBConfig> fbconfig_;\n\n private:\n virtual ~AcceleratedSurfaceContainerLinuxGLX();\n\n XID pixmap_;\n XID glx_pixmap_;\n\n DISALLOW_COPY_AND_ASSIGN(AcceleratedSurfaceContainerLinuxGLX);\n};\n\nclass AcceleratedSurfaceContainerLinuxOSMesa\n : public AcceleratedSurfaceContainerLinux {\n public:\n explicit AcceleratedSurfaceContainerLinuxOSMesa(const gfx::Size& size);\n\n virtual bool Initialize(uint64* surface_id) OVERRIDE;\n\n \/\/ TextureGL implementation\n virtual void Draw(const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) OVERRIDE;\n\n \/\/ Some implementations of this class use shared memory, this gives the handle\n \/\/ to the shared buffer, which is part of the surface container.\n \/\/ When shared memory is not used, this will return\n \/\/ TransportDIB::DefaultHandleValue().\n virtual TransportDIB::Handle Handle() const OVERRIDE;\n\n private:\n virtual ~AcceleratedSurfaceContainerLinuxOSMesa();\n\n scoped_ptr<TransportDIB> shared_mem_;\n\n DISALLOW_COPY_AND_ASSIGN(AcceleratedSurfaceContainerLinuxOSMesa);\n};\n\nclass ScopedPtrXFree {\n public:\n void operator()(void* x) const {\n ::XFree(x);\n }\n};\n\n\/\/ static\nbase::LazyInstance<GLXFBConfig> AcceleratedSurfaceContainerLinuxGLX::fbconfig_(\n base::LINKER_INITIALIZED);\n\nAcceleratedSurfaceContainerLinuxEGL::AcceleratedSurfaceContainerLinuxEGL(\n const gfx::Size& size)\n : AcceleratedSurfaceContainerLinux(size),\n image_(NULL) {\n}\n\nbool AcceleratedSurfaceContainerLinuxEGL::Initialize(uint64* surface_id) {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n instance->MakeSharedContextCurrent();\n\n image_ = eglCreateImageKHR(\n gfx::GLSurfaceEGL::GetHardwareDisplay(), EGL_NO_CONTEXT,\n EGL_NATIVE_PIXMAP_KHR, reinterpret_cast<void*>(*surface_id), NULL);\n\n glGenTextures(1, &texture_id_);\n glBindTexture(GL_TEXTURE_2D, texture_id_);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n glEGLImageTargetTexture2DOES(GL_TEXTURE_2D, image_);\n glFlush();\n\n return true;\n}\n\nAcceleratedSurfaceContainerLinuxEGL::~AcceleratedSurfaceContainerLinuxEGL() {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n instance->MakeSharedContextCurrent();\n\n eglDestroyImageKHR(gfx::GLSurfaceEGL::GetHardwareDisplay(), image_);\n glFlush();\n}\n\nvoid AcceleratedSurfaceContainerLinuxEGL::Draw(\n const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n\n ui::TextureDrawParams modified_params = params;\n modified_params.vertically_flipped = true;\n\n DrawInternal(*instance->program_no_swizzle(),\n modified_params,\n clip_bounds_in_texture);\n}\n\nAcceleratedSurfaceContainerLinuxGLX::AcceleratedSurfaceContainerLinuxGLX(\n const gfx::Size& size)\n : AcceleratedSurfaceContainerLinux(size),\n pixmap_(0),\n glx_pixmap_(0) {\n}\n\nbool AcceleratedSurfaceContainerLinuxGLX::Initialize(uint64* surface_id) {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n instance->MakeSharedContextCurrent();\n\n if (!AcceleratedSurfaceContainerLinuxGLX::InitializeOneOff())\n return false;\n\n \/\/ Create pixmap from window.\n \/\/ We receive a window here rather than a pixmap directly because drivers\n \/\/ require (or required) that the pixmap used to create the GL texture be\n \/\/ created in the same process as the texture.\n Display* dpy = instance->GetDisplay();\n pixmap_ = XCompositeNameWindowPixmap(dpy, *surface_id);\n\n \/\/ Wrap the pixmap in a GLXPixmap\n const int pixmapAttribs[] = {\n GLX_TEXTURE_TARGET_EXT, GLX_TEXTURE_2D_EXT,\n GLX_TEXTURE_FORMAT_EXT, GLX_TEXTURE_FORMAT_RGB_EXT,\n 0\n };\n\n glx_pixmap_ = glXCreatePixmap(\n dpy, fbconfig_.Get(), pixmap_, pixmapAttribs);\n\n \/\/ Create texture.\n glGenTextures(1, &texture_id_);\n glBindTexture(GL_TEXTURE_2D, texture_id_);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n return true;\n}\n\nAcceleratedSurfaceContainerLinuxGLX::~AcceleratedSurfaceContainerLinuxGLX() {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n instance->MakeSharedContextCurrent();\n\n Display* dpy = instance->GetDisplay();\n if (glx_pixmap_)\n glXDestroyGLXPixmap(dpy, glx_pixmap_);\n if (pixmap_)\n XFreePixmap(dpy, pixmap_);\n}\n\nvoid AcceleratedSurfaceContainerLinuxGLX::Draw(\n const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n\n Display* dpy = instance->GetDisplay();\n\n glBindTexture(GL_TEXTURE_2D, texture_id_);\n glXBindTexImageEXT(dpy, glx_pixmap_, GLX_FRONT_LEFT_EXT, NULL);\n DrawInternal(*instance->program_no_swizzle(),\n params,\n clip_bounds_in_texture);\n glXReleaseTexImageEXT(dpy, glx_pixmap_, GLX_FRONT_LEFT_EXT);\n}\n\n\/\/ static\nbool AcceleratedSurfaceContainerLinuxGLX::InitializeOneOff()\n{\n static bool initialized = false;\n if (initialized)\n return true;\n\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n\n Display* dpy = instance->GetDisplay();\n int event_base, error_base;\n if (XCompositeQueryExtension(dpy, &event_base, &error_base)) {\n int major = 0, minor = 2;\n XCompositeQueryVersion(dpy, &major, &minor);\n if (major == 0 && minor < 2) {\n LOG(ERROR) << \"Pixmap from window not supported.\";\n return false;\n }\n }\n\n \/\/ Wrap the pixmap in a GLXPixmap\n int screen = DefaultScreen(dpy);\n XWindowAttributes gwa;\n XGetWindowAttributes(dpy, RootWindow(dpy, screen), &gwa);\n unsigned int visualid = XVisualIDFromVisual(gwa.visual);\n\n int nfbconfigs, config;\n scoped_ptr_malloc<GLXFBConfig, ScopedPtrXFree> fbconfigs(\n glXGetFBConfigs(dpy, screen, &nfbconfigs));\n\n for (config = 0; config < nfbconfigs; config++) {\n XVisualInfo* visinfo = glXGetVisualFromFBConfig(\n dpy, fbconfigs.get()[config]);\n if (!visinfo || visinfo->visualid != visualid)\n continue;\n\n int value;\n glXGetFBConfigAttrib(dpy,\n fbconfigs.get()[config],\n GLX_DRAWABLE_TYPE,\n &value);\n if (!(value & GLX_PIXMAP_BIT))\n continue;\n\n glXGetFBConfigAttrib(dpy,\n fbconfigs.get()[config],\n GLX_BIND_TO_TEXTURE_TARGETS_EXT,\n &value);\n if (!(value & GLX_TEXTURE_2D_BIT_EXT))\n continue;\n\n glXGetFBConfigAttrib(dpy,\n fbconfigs.get()[config],\n GLX_BIND_TO_TEXTURE_RGB_EXT,\n &value);\n if (value == GL_FALSE)\n continue;\n\n break;\n }\n\n if (config == nfbconfigs) {\n LOG(ERROR)\n << \"Could not find configuration suitable for binding a pixmap \"\n << \"as a texture.\";\n return false;\n }\n\n fbconfig_.Get() = fbconfigs.get()[config];\n\n initialized = true;\n return initialized;\n}\n\nAcceleratedSurfaceContainerLinuxOSMesa::AcceleratedSurfaceContainerLinuxOSMesa(\n const gfx::Size& size)\n : AcceleratedSurfaceContainerLinux(size) {\n}\n\nbool AcceleratedSurfaceContainerLinuxOSMesa::Initialize(uint64* surface_id) {\n static uint32 next_id = 1;\n\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n instance->MakeSharedContextCurrent();\n\n \/\/ We expect to make the id here, so don't want the other end giving us one\n DCHECK_EQ(*surface_id, static_cast<uint64>(0));\n\n \/\/ It's possible that this ID gneration could clash with IDs from other\n \/\/ AcceleratedSurfaceContainerLinux* objects, however we should never have\n \/\/ ids active from more than one type at the same time, so we have free\n \/\/ reign of the id namespace.\n *surface_id = next_id++;\n\n shared_mem_.reset(\n TransportDIB::Create(size_.GetArea() * 4, \/\/ GL_RGBA=4 B\/px\n *surface_id));\n \/\/ Create texture.\n glGenTextures(1, &texture_id_);\n glBindTexture(GL_TEXTURE_2D, texture_id_);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n \/\/ we generate the ID to be used here.\n return true;\n}\n\nvoid AcceleratedSurfaceContainerLinuxOSMesa::Draw(\n const ui::TextureDrawParams& params,\n const gfx::Rect& clip_bounds_in_texture) {\n ui::SharedResources* instance = ui::SharedResources::GetInstance();\n DCHECK(instance);\n\n if (shared_mem_.get()) {\n glBindTexture(GL_TEXTURE_2D, texture_id_);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA,\n size_.width(), size_.height(), 0,\n GL_RGBA, GL_UNSIGNED_BYTE, shared_mem_->memory());\n\n DrawInternal(*instance->program_no_swizzle(),\n params,\n clip_bounds_in_texture);\n }\n}\n\nTransportDIB::Handle AcceleratedSurfaceContainerLinuxOSMesa::Handle() const {\n if (shared_mem_.get())\n return shared_mem_->handle();\n else\n return TransportDIB::DefaultHandleValue();\n}\n\nAcceleratedSurfaceContainerLinuxOSMesa::\n ~AcceleratedSurfaceContainerLinuxOSMesa() {\n}\n\n} \/\/ namespace\n\nAcceleratedSurfaceContainerLinux::AcceleratedSurfaceContainerLinux(\n const gfx::Size& size) : TextureGL(size) {\n}\n\nTransportDIB::Handle AcceleratedSurfaceContainerLinux::Handle() const {\n return TransportDIB::DefaultHandleValue();\n}\n\n\/\/ static\nAcceleratedSurfaceContainerLinux*\nAcceleratedSurfaceContainerLinux::CreateAcceleratedSurfaceContainer(\n const gfx::Size& size) {\n switch (gfx::GetGLImplementation()) {\n case gfx::kGLImplementationDesktopGL:\n return new AcceleratedSurfaceContainerLinuxGLX(size);\n case gfx::kGLImplementationEGLGLES2:\n return new AcceleratedSurfaceContainerLinuxEGL(size);\n case gfx::kGLImplementationOSMesaGL:\n return new AcceleratedSurfaceContainerLinuxOSMesa(size);\n default:\n NOTREACHED();\n return NULL;\n }\n}\n\nvoid AcceleratedSurfaceContainerLinux::SetCanvas(\n const SkCanvas& canvas,\n const gfx::Point& origin,\n const gfx::Size& overall_size) {\n NOTREACHED();\n}\n\n<commit_msg>Unnecessary file.<commit_after><|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2006 The Android Open Source Project\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n#include \"SkOSFile.h\"\n\n#include <errno.h>\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifdef _WIN32\n#include <direct.h>\n#include <io.h>\n#else\n#include <unistd.h>\n#endif\n\nSkFILE* sk_fopen(const char path[], SkFILE_Flags flags)\n{\n char perm[4];\n char* p = perm;\n\n if (flags & kRead_SkFILE_Flag)\n *p++ = 'r';\n if (flags & kWrite_SkFILE_Flag)\n *p++ = 'w';\n *p++ = 'b';\n *p = 0;\n\n SkFILE* f = (SkFILE*)::fopen(path, perm);\n#if 0\n if (NULL == f)\n SkDebugf(\"sk_fopen failed for %s (%s), errno=%s\\n\", path, perm, strerror(errno));\n#endif\n return f;\n}\n\nchar* sk_fgets(char* str, int size, SkFILE* f) {\n return ::fgets(str, size, (FILE *)f);\n}\n\n\nint sk_feof(SkFILE *f) {\n return ::feof((FILE *)f);\n}\n\nsize_t sk_fgetsize(SkFILE* f)\n{\n SkASSERT(f);\n\n long curr = ::ftell((FILE*)f); \/\/ remember where we are\n if (curr < 0) {\n return 0;\n }\n ::fseek((FILE*)f, 0, SEEK_END); \/\/ go to the end\n long size = ::ftell((FILE*)f); \/\/ record the size\n if (size < 0) {\n size = 0;\n }\n ::fseek((FILE*)f, curr, SEEK_SET); \/\/ go back to our prev loc\n return size;\n}\n\nbool sk_frewind(SkFILE* f)\n{\n SkASSERT(f);\n ::rewind((FILE*)f);\n\/\/ ::fseek((FILE*)f, 0, SEEK_SET);\n return true;\n}\n\nsize_t sk_fread(void* buffer, size_t byteCount, SkFILE* f)\n{\n SkASSERT(f);\n if (buffer == NULL)\n {\n size_t curr = ::ftell((FILE*)f);\n if ((long)curr == -1) {\n SkDEBUGF((\"sk_fread: ftell(%p) returned -1 feof:%d ferror:%d\\n\", f, feof((FILE*)f), ferror((FILE*)f)));\n return 0;\n }\n \/\/ ::fseek((FILE*)f, (long)(curr + byteCount), SEEK_SET);\n int err = ::fseek((FILE*)f, (long)byteCount, SEEK_CUR);\n if (err != 0) {\n SkDEBUGF((\"sk_fread: fseek(%d) tell:%d failed with feof:%d ferror:%d returned:%d\\n\",\n byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));\n return 0;\n }\n return byteCount;\n }\n else\n return ::fread(buffer, 1, byteCount, (FILE*)f);\n}\n\nsize_t sk_fwrite(const void* buffer, size_t byteCount, SkFILE* f)\n{\n SkASSERT(f);\n return ::fwrite(buffer, 1, byteCount, (FILE*)f);\n}\n\nvoid sk_fflush(SkFILE* f)\n{\n SkASSERT(f);\n ::fflush((FILE*)f);\n}\n\nvoid sk_fclose(SkFILE* f)\n{\n SkASSERT(f);\n ::fclose((FILE*)f);\n}\n\nbool sk_exists(const char *path)\n{\n#ifdef _WIN32\n return (0 == _access(path, 0));\n#else\n return (0 == access(path, 0));\n#endif\n}\n\nbool sk_isdir(const char *path)\n{\n struct stat status;\n if (0 != stat(path, &status)) {\n return false;\n }\n return SkToBool(status.st_mode & S_IFDIR);\n}\n\nbool sk_mkdir(const char* path)\n{\n if (sk_isdir(path)) {\n return true;\n }\n if (sk_exists(path)) {\n fprintf(stderr,\n \"sk_mkdir: path '%s' already exists but is not a directory\\n\",\n path);\n return false;\n }\n\n int retval;\n#ifdef _WIN32\n retval = _mkdir(path);\n#else\n retval = mkdir(path, 0777);\n#endif\n if (0 == retval) {\n return true;\n } else {\n fprintf(stderr, \"sk_mkdir: error %d creating dir '%s'\\n\", errno, path);\n return false;\n }\n}\n<commit_msg>remove namespace qualifier for feof; it's making android unhappy<commit_after>\n\/*\n * Copyright 2006 The Android Open Source Project\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n#include \"SkOSFile.h\"\n\n#include <errno.h>\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifdef _WIN32\n#include <direct.h>\n#include <io.h>\n#else\n#include <unistd.h>\n#endif\n\nSkFILE* sk_fopen(const char path[], SkFILE_Flags flags)\n{\n char perm[4];\n char* p = perm;\n\n if (flags & kRead_SkFILE_Flag)\n *p++ = 'r';\n if (flags & kWrite_SkFILE_Flag)\n *p++ = 'w';\n *p++ = 'b';\n *p = 0;\n\n SkFILE* f = (SkFILE*)::fopen(path, perm);\n#if 0\n if (NULL == f)\n SkDebugf(\"sk_fopen failed for %s (%s), errno=%s\\n\", path, perm, strerror(errno));\n#endif\n return f;\n}\n\nchar* sk_fgets(char* str, int size, SkFILE* f) {\n return ::fgets(str, size, (FILE *)f);\n}\n\n\nint sk_feof(SkFILE *f) {\n \/\/ no :: namespace qualifier because it breaks android\n return feof((FILE *)f);\n}\n\nsize_t sk_fgetsize(SkFILE* f)\n{\n SkASSERT(f);\n\n long curr = ::ftell((FILE*)f); \/\/ remember where we are\n if (curr < 0) {\n return 0;\n }\n ::fseek((FILE*)f, 0, SEEK_END); \/\/ go to the end\n long size = ::ftell((FILE*)f); \/\/ record the size\n if (size < 0) {\n size = 0;\n }\n ::fseek((FILE*)f, curr, SEEK_SET); \/\/ go back to our prev loc\n return size;\n}\n\nbool sk_frewind(SkFILE* f)\n{\n SkASSERT(f);\n ::rewind((FILE*)f);\n\/\/ ::fseek((FILE*)f, 0, SEEK_SET);\n return true;\n}\n\nsize_t sk_fread(void* buffer, size_t byteCount, SkFILE* f)\n{\n SkASSERT(f);\n if (buffer == NULL)\n {\n size_t curr = ::ftell((FILE*)f);\n if ((long)curr == -1) {\n SkDEBUGF((\"sk_fread: ftell(%p) returned -1 feof:%d ferror:%d\\n\", f, feof((FILE*)f), ferror((FILE*)f)));\n return 0;\n }\n \/\/ ::fseek((FILE*)f, (long)(curr + byteCount), SEEK_SET);\n int err = ::fseek((FILE*)f, (long)byteCount, SEEK_CUR);\n if (err != 0) {\n SkDEBUGF((\"sk_fread: fseek(%d) tell:%d failed with feof:%d ferror:%d returned:%d\\n\",\n byteCount, curr, feof((FILE*)f), ferror((FILE*)f), err));\n return 0;\n }\n return byteCount;\n }\n else\n return ::fread(buffer, 1, byteCount, (FILE*)f);\n}\n\nsize_t sk_fwrite(const void* buffer, size_t byteCount, SkFILE* f)\n{\n SkASSERT(f);\n return ::fwrite(buffer, 1, byteCount, (FILE*)f);\n}\n\nvoid sk_fflush(SkFILE* f)\n{\n SkASSERT(f);\n ::fflush((FILE*)f);\n}\n\nvoid sk_fclose(SkFILE* f)\n{\n SkASSERT(f);\n ::fclose((FILE*)f);\n}\n\nbool sk_exists(const char *path)\n{\n#ifdef _WIN32\n return (0 == _access(path, 0));\n#else\n return (0 == access(path, 0));\n#endif\n}\n\nbool sk_isdir(const char *path)\n{\n struct stat status;\n if (0 != stat(path, &status)) {\n return false;\n }\n return SkToBool(status.st_mode & S_IFDIR);\n}\n\nbool sk_mkdir(const char* path)\n{\n if (sk_isdir(path)) {\n return true;\n }\n if (sk_exists(path)) {\n fprintf(stderr,\n \"sk_mkdir: path '%s' already exists but is not a directory\\n\",\n path);\n return false;\n }\n\n int retval;\n#ifdef _WIN32\n retval = _mkdir(path);\n#else\n retval = mkdir(path, 0777);\n#endif\n if (0 == retval) {\n return true;\n } else {\n fprintf(stderr, \"sk_mkdir: error %d creating dir '%s'\\n\", errno, path);\n return false;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013-2014 Google Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <cstdlib>\n#include \"pkcs11test.h\"\n\nusing namespace std; \/\/ So sue me\n\nnamespace pkcs11 {\nnamespace test {\n\nclass DigestTest : public ReadOnlySessionTest {\n public:\n DigestTest(CK_MECHANISM_TYPE mode, int digestsize)\n : mode_(mode),\n digestsize_(digestsize),\n mechanism_({mode_, NULL_PTR, 0}),\n datalen_(std::rand() % 1024),\n data_(randmalloc(datalen_)) {\n if (g_verbose) cout << \"DATA: \" << hex_data(data_.get(), min(40, datalen_))\n << ((datalen_>40) ? \"...\" : \"\") << endl;\n }\n\n string TestDigest() {\n CK_RV rv = g_fns->C_DigestInit(session_, &mechanism_);\n EXPECT_CKR_OK(rv);\n if (rv == CKR_MECHANISM_INVALID) return \"unimplemented\";\n CK_BYTE buffer[512];\n CK_ULONG digest_len = sizeof(buffer);\n EXPECT_CKR_OK(g_fns->C_Digest(session_, data_.get(), datalen_, buffer, &digest_len));\n EXPECT_EQ(digestsize_, digest_len);\n if (g_verbose) cout << \"DIGEST: \" << hex_data(buffer, digest_len) << endl;\n return string(reinterpret_cast<char*>(buffer), digest_len);\n }\n\n string TestDigestUpdate() {\n CK_RV rv = g_fns->C_DigestInit(session_, &mechanism_);\n EXPECT_CKR_OK(rv);\n if (rv == CKR_MECHANISM_INVALID) return \"unimplemented\";\n const int kChunkSize = 10;\n CK_BYTE_PTR p = data_.get();\n int dataleft = datalen_;\n int count = 0;\n while (dataleft > 0) {\n int size = min(kChunkSize, dataleft);\n EXPECT_CKR_OK(g_fns->C_DigestUpdate(session_, p, size));\n p += size;\n dataleft -= size;\n ++count;\n }\n\n CK_BYTE buffer[512];\n CK_ULONG digest_len = sizeof(buffer);\n EXPECT_CKR_OK(g_fns->C_DigestFinal(session_, buffer, &digest_len));\n EXPECT_EQ(digestsize_, digest_len);\n if (g_verbose) cout << \"DIGEST: \" << hex_data(buffer, digest_len) << endl;\n return string(reinterpret_cast<char*>(buffer), digest_len);\n }\n\n private:\n const CK_MECHANISM_TYPE mode_;\n const int digestsize_;\n CK_MECHANISM mechanism_;\n const int datalen_;\n unique_ptr<CK_BYTE, freer> data_;\n};\n\n\nclass Md5DigestTest : public DigestTest {\n public:\n Md5DigestTest(): DigestTest(CKM_MD5, 16) {}\n};\n\nTEST_F(Md5DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\nclass Sha1DigestTest : public DigestTest {\n public:\n Sha1DigestTest(): DigestTest(CKM_SHA_1, 20) {}\n};\n\nTEST_F(Sha1DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\nclass Sha256DigestTest : public DigestTest {\n public:\n Sha256DigestTest(): DigestTest(CKM_SHA256, 256\/8) {}\n};\n\nTEST_F(Sha256DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\n} \/\/ namespace test\n} \/\/ namespace pkcs11\n<commit_msg>Cope with SHA-256 unimplemented<commit_after>\/\/ Copyright 2013-2014 Google Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <cstdlib>\n#include \"pkcs11test.h\"\n\nusing namespace std; \/\/ So sue me\n\nnamespace pkcs11 {\nnamespace test {\n\nclass DigestTest : public ReadOnlySessionTest {\n public:\n DigestTest(CK_MECHANISM_TYPE mode, int digestsize)\n : mode_(mode),\n digestsize_(digestsize),\n mechanism_({mode_, NULL_PTR, 0}),\n datalen_(std::rand() % 1024),\n data_(randmalloc(datalen_)) {\n if (g_verbose) cout << \"DATA: \" << hex_data(data_.get(), min(40, datalen_))\n << ((datalen_>40) ? \"...\" : \"\") << endl;\n }\n\n string TestDigest() {\n CK_RV rv = g_fns->C_DigestInit(session_, &mechanism_);\n if (rv == CKR_MECHANISM_INVALID) return \"unimplemented\";\n EXPECT_CKR_OK(rv);\n CK_BYTE buffer[512];\n CK_ULONG digest_len = sizeof(buffer);\n EXPECT_CKR_OK(g_fns->C_Digest(session_, data_.get(), datalen_, buffer, &digest_len));\n EXPECT_EQ(digestsize_, digest_len);\n if (g_verbose) cout << \"DIGEST: \" << hex_data(buffer, digest_len) << endl;\n return string(reinterpret_cast<char*>(buffer), digest_len);\n }\n\n string TestDigestUpdate() {\n CK_RV rv = g_fns->C_DigestInit(session_, &mechanism_);\n if (rv == CKR_MECHANISM_INVALID) return \"unimplemented\";\n EXPECT_CKR_OK(rv);\n const int kChunkSize = 10;\n CK_BYTE_PTR p = data_.get();\n int dataleft = datalen_;\n int count = 0;\n while (dataleft > 0) {\n int size = min(kChunkSize, dataleft);\n EXPECT_CKR_OK(g_fns->C_DigestUpdate(session_, p, size));\n p += size;\n dataleft -= size;\n ++count;\n }\n\n CK_BYTE buffer[512];\n CK_ULONG digest_len = sizeof(buffer);\n EXPECT_CKR_OK(g_fns->C_DigestFinal(session_, buffer, &digest_len));\n EXPECT_EQ(digestsize_, digest_len);\n if (g_verbose) cout << \"DIGEST: \" << hex_data(buffer, digest_len) << endl;\n return string(reinterpret_cast<char*>(buffer), digest_len);\n }\n\n private:\n const CK_MECHANISM_TYPE mode_;\n const int digestsize_;\n CK_MECHANISM mechanism_;\n const int datalen_;\n unique_ptr<CK_BYTE, freer> data_;\n};\n\n\nclass Md5DigestTest : public DigestTest {\n public:\n Md5DigestTest(): DigestTest(CKM_MD5, 16) {}\n};\n\nTEST_F(Md5DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\nclass Sha1DigestTest : public DigestTest {\n public:\n Sha1DigestTest(): DigestTest(CKM_SHA_1, 20) {}\n};\n\nTEST_F(Sha1DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\nclass Sha256DigestTest : public DigestTest {\n public:\n Sha256DigestTest(): DigestTest(CKM_SHA256, 256\/8) {}\n};\n\nTEST_F(Sha256DigestTest, Digest) {\n string d1 = TestDigest();\n string d2 = TestDigestUpdate();\n if (d1 == \"unimplemented\" || d2 == \"unimplemented\") {\n TEST_SKIPPED(\"SHA-256 not implemented\");\n }\n EXPECT_EQ(hex_data(d1), hex_data(d2));\n}\n\n} \/\/ namespace test\n} \/\/ namespace pkcs11\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <SFML\/Audio.hpp>\n#include <SFML\/Graphics.hpp>\n#include <SFML\/Network.hpp>\n#include <SFML\/System.hpp>\n#include <SFML\/Window.hpp>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PhysicsFS.hpp\"\n#include \"LuaState.hpp\"\n\n#include \"App.hpp\"\n#include \"State.hpp\"\n\n#include <cmath>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass PauseState : public State\n{\npublic:\n PauseState() {}\n\nprotected:\n void onUpdate(sf::Time delta)\n {\n }\n\n bool onEvent(const sf::Event &event)\n {\n if (event.type == sf::Event::KeyPressed)\n {\n if (event.key.code == sf::Keyboard::Return)\n {\n throw App::Exit;\n }\n else if (event.key.code == sf::Keyboard::Escape)\n {\n exit();\n }\n }\n\n return false;\n }\n\n void draw(sf::RenderTarget &target, sf::RenderStates states) const\n {\n sf::RectangleShape rect(sf::Vector2f(target.getSize()));\n rect.setFillColor(sf::Color(0,0,0,128));\n target.draw(rect, states);\n }\n\n bool isOpaque() const { return false; }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass MyState : public State\n{\npublic:\n MyState()\n {\n static const unsigned int numSides[10] = {\n 90, 3, 4, 5, 6, 7, 8, 10, 12, 20\n };\n\n m_shapes.resize(10);\n\n for (unsigned int i = 0; i < 10; i++)\n {\n initShape(m_shapes[i], sf::Vector2f(80+150*((i+1)%5), 270+150*((i+1)\/5)), 50, numSides[i]);\n }\n }\n\nprotected:\n void initShape(sf::ConvexShape &shape, const sf::Vector2f &position, float radius, unsigned int sides = 0)\n {\n if (sides < 3) sides = 3;\n\n static const float PI = 3.14159265359f;\n\n float angle = PI \/ float(sides);\n float step = angle * 2.f;\n\n shape.setPointCount(sides);\n\n for (unsigned int i = 0; i < sides; i++)\n {\n shape.setPoint(i, sf::Vector2f(radius*std::cos(angle), radius*std::sin(angle)));\n angle += step;\n }\n\n shape.setOutlineThickness(5);\n shape.setOutlineColor(sf::Color::Black);\n shape.setFillColor(sf::Color(160,160,160));\n shape.setPosition(position);\n }\n\n void onUpdate(sf::Time delta)\n {\n for (sf::Shape &shape : m_shapes)\n {\n shape.rotate(90.f * delta.asSeconds());\n }\n }\n\n bool onEvent(const sf::Event &event)\n {\n switch (event.type)\n {\n case sf::Event::KeyPressed:\n {\n switch (event.key.code)\n {\n case sf::Keyboard::Num0:\n case sf::Keyboard::Num1:\n case sf::Keyboard::Num2:\n case sf::Keyboard::Num3:\n case sf::Keyboard::Num4:\n case sf::Keyboard::Num5:\n case sf::Keyboard::Num6:\n case sf::Keyboard::Num7:\n case sf::Keyboard::Num8:\n case sf::Keyboard::Num9:\n {\n m_shapes[event.key.code - sf::Keyboard::Num0].\n setFillColor(sf::Color::Red);\n return true;\n }\n\n default: break;\n }\n break;\n }\n\n case sf::Event::KeyReleased:\n {\n switch (event.key.code)\n {\n case sf::Keyboard::Num0:\n case sf::Keyboard::Num1:\n case sf::Keyboard::Num2:\n case sf::Keyboard::Num3:\n case sf::Keyboard::Num4:\n case sf::Keyboard::Num5:\n case sf::Keyboard::Num6:\n case sf::Keyboard::Num7:\n case sf::Keyboard::Num8:\n case sf::Keyboard::Num9:\n {\n m_shapes[event.key.code - sf::Keyboard::Num0].\n setFillColor(sf::Color::Green);\n return true;\n }\n\n default: break;\n }\n break;\n }\n\n default: break;\n }\n\n return false;\n }\n\n void draw(sf::RenderTarget &target, sf::RenderStates states) const\n {\n target.clear(sf::Color(0x6688aa));\n for (const sf::Shape &shape : m_shapes)\n {\n target.draw(shape, states);\n }\n }\n\nprivate:\n std::vector < sf::ConvexShape > m_shapes;\n};\n\nclass MyApp : public App\n{\npublic:\n MyApp()\n {\n setTargetFPS(120.f);\n setWindowStyle(sf::Style::Titlebar | sf::Style::Close);\n }\n\nprotected:\n void onStart()\n {\n createWindow();\n pushState(m_myState);\n }\n\n bool onEvent(const sf::Event &event)\n {\n switch (event.type)\n {\n case sf::Event::KeyPressed:\n {\n if (event.key.code == sf::Keyboard::Escape)\n {\n if (getState() != &m_pauseState)\n {\n pushState(m_pauseState);\n return true;\n }\n }\n break;\n }\n default: break;\n }\n\n return false;\n }\n\nprivate:\n PauseState m_pauseState;\n MyState m_myState;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nextern \"C\"\nint main (int argc, char **argv)\n{\n PhysicsFS physfs(argv[0]);\n\n try\n {\n LuaState lua;\n\n try\n {\n lua.doFile(\"config.lua\");\n }\n catch (LuaState::Error &exc)\n {\n sf::err() << \"Config script error: \" << exc.what() << \"\\n\";\n }\n\n lua.loadSafeLibs();\n\n try\n {\n lua.doFile(\"init.lua\");\n }\n catch (LuaState::Error &exc)\n {\n sf::err() << \"Init script error: \" << exc.what() << \"\\n\";\n throw;\n }\n\n MyApp app;\n app.run();\n }\n catch (std::exception &exc)\n {\n sf::err() << \"Unhandled exception: \" << exc.what() << \"\\n\";\n }\n\n return(0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ EOF\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<commit_msg>Fix demo shape layout (finally)<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <SFML\/Audio.hpp>\n#include <SFML\/Graphics.hpp>\n#include <SFML\/Network.hpp>\n#include <SFML\/System.hpp>\n#include <SFML\/Window.hpp>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"PhysicsFS.hpp\"\n#include \"LuaState.hpp\"\n\n#include \"App.hpp\"\n#include \"State.hpp\"\n\n#include <cmath>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass PauseState : public State\n{\npublic:\n PauseState() {}\n\nprotected:\n void onUpdate(sf::Time delta)\n {\n }\n\n bool onEvent(const sf::Event &event)\n {\n if (event.type == sf::Event::KeyPressed)\n {\n if (event.key.code == sf::Keyboard::Return)\n {\n throw App::Exit;\n }\n else if (event.key.code == sf::Keyboard::Escape)\n {\n exit();\n }\n }\n\n return false;\n }\n\n void draw(sf::RenderTarget &target, sf::RenderStates states) const\n {\n sf::RectangleShape rect(sf::Vector2f(target.getSize()));\n rect.setFillColor(sf::Color(0,0,0,128));\n target.draw(rect, states);\n }\n\n bool isOpaque() const { return false; }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass MyState : public State\n{\npublic:\n MyState()\n {\n static const unsigned int numSides[10] = {\n 90, 3, 4, 5, 6, 7, 8, 10, 12, 20\n };\n\n m_shapes.resize(10);\n\n for (unsigned int i = 0; i < 10; i++)\n {\n int r = ((i+9)\/5)%2, c = (i+9)%5;\n initShape(m_shapes[i], sf::Vector2f(80+150*c, 270+150*r), 50, numSides[i]);\n }\n }\n\nprotected:\n void initShape(sf::ConvexShape &shape, const sf::Vector2f &position, float radius, unsigned int sides = 0)\n {\n if (sides < 3) sides = 3;\n\n static const float PI = 3.14159265359f;\n\n float angle = PI \/ float(sides);\n float step = angle * 2.f;\n\n shape.setPointCount(sides);\n\n for (unsigned int i = 0; i < sides; i++)\n {\n shape.setPoint(i, sf::Vector2f(radius*std::cos(angle), radius*std::sin(angle)));\n angle += step;\n }\n\n shape.setOutlineThickness(5);\n shape.setOutlineColor(sf::Color::Black);\n shape.setFillColor(sf::Color(160,160,160));\n shape.setPosition(position);\n }\n\n void onUpdate(sf::Time delta)\n {\n for (sf::Shape &shape : m_shapes)\n {\n shape.rotate(90.f * delta.asSeconds());\n }\n }\n\n bool onEvent(const sf::Event &event)\n {\n switch (event.type)\n {\n case sf::Event::KeyPressed:\n {\n switch (event.key.code)\n {\n case sf::Keyboard::Num0:\n case sf::Keyboard::Num1:\n case sf::Keyboard::Num2:\n case sf::Keyboard::Num3:\n case sf::Keyboard::Num4:\n case sf::Keyboard::Num5:\n case sf::Keyboard::Num6:\n case sf::Keyboard::Num7:\n case sf::Keyboard::Num8:\n case sf::Keyboard::Num9:\n {\n m_shapes[event.key.code - sf::Keyboard::Num0].\n setFillColor(sf::Color::Red);\n return true;\n }\n\n default: break;\n }\n break;\n }\n\n case sf::Event::KeyReleased:\n {\n switch (event.key.code)\n {\n case sf::Keyboard::Num0:\n case sf::Keyboard::Num1:\n case sf::Keyboard::Num2:\n case sf::Keyboard::Num3:\n case sf::Keyboard::Num4:\n case sf::Keyboard::Num5:\n case sf::Keyboard::Num6:\n case sf::Keyboard::Num7:\n case sf::Keyboard::Num8:\n case sf::Keyboard::Num9:\n {\n m_shapes[event.key.code - sf::Keyboard::Num0].\n setFillColor(sf::Color::Green);\n return true;\n }\n\n default: break;\n }\n break;\n }\n\n default: break;\n }\n\n return false;\n }\n\n void draw(sf::RenderTarget &target, sf::RenderStates states) const\n {\n target.clear(sf::Color(0x6688aa));\n\n for (const sf::Shape &shape : m_shapes)\n {\n target.draw(shape, states);\n }\n }\n\nprivate:\n std::vector < sf::ConvexShape > m_shapes;\n};\n\nclass MyApp : public App\n{\npublic:\n MyApp()\n {\n setTargetFPS(120.f);\n setWindowStyle(sf::Style::Titlebar | sf::Style::Close);\n }\n\nprotected:\n void onStart()\n {\n createWindow();\n pushState(m_myState);\n }\n\n bool onEvent(const sf::Event &event)\n {\n switch (event.type)\n {\n case sf::Event::KeyPressed:\n {\n if (event.key.code == sf::Keyboard::Escape)\n {\n if (getState() != &m_pauseState)\n {\n pushState(m_pauseState);\n return true;\n }\n }\n break;\n }\n default: break;\n }\n\n return false;\n }\n\nprivate:\n PauseState m_pauseState;\n MyState m_myState;\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nextern \"C\"\nint main (int argc, char **argv)\n{\n PhysicsFS physfs(argv[0]);\n\n try\n {\n LuaState lua;\n\n try\n {\n lua.doFile(\"config.lua\");\n }\n catch (LuaState::Error &exc)\n {\n sf::err() << \"Config script error: \" << exc.what() << \"\\n\";\n }\n\n lua.loadSafeLibs();\n\n try\n {\n lua.doFile(\"init.lua\");\n }\n catch (LuaState::Error &exc)\n {\n sf::err() << \"Init script error: \" << exc.what() << \"\\n\";\n throw;\n }\n\n MyApp app;\n app.run();\n }\n catch (std::exception &exc)\n {\n sf::err() << \"Unhandled exception: \" << exc.what() << \"\\n\";\n }\n\n return(0);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ EOF\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Qumulus UML editor\n * Author: Randy Thiemann\n *\n *\/\n\n#include \"ToolBar.h\"\n#include <Gui\/Widgets\/MainWindow.h>\n\nQUML_BEGIN_NAMESPACE_GW\n\n#ifdef Q_OS_MAC\nToolBar::ToolBar() : mToolBar(new QMacUnifiedToolBar()) {}\n#else\nToolBar::ToolBar() : mToolBar(new QToolBar()) {}\n#endif\n\nvoid ToolBar::showInWindow(MainWindow* w) {\n mWindow = w;\n#ifdef Q_OS_MAC\n mToolBar->showInWindowForWidget(w);\n#else\n w->addToolBar(mToolBar);\n#endif\n}\n\nQuGW::MainWindow* ToolBar::window() {\n return mWindow;\n}\n\nQAction* ToolBar::addAction(const QIcon& icon, const QString& text) {\n return mToolBar->addAction(icon, text);\n}\n\nvoid ToolBar::addSeparator() {\n mToolBar->addSeparator();\n}\n\n#ifdef Q_OS_MAC\nvoid ToolBar::addFlexibleSpace() {\n mToolBar->addStandardItem(QMacToolButton::FlexibleSpace);\n}\n#endif\n\nQUML_END_NAMESPACE_GW\n\n<commit_msg>Fix windows bug.<commit_after>\/*\n * Qumulus UML editor\n * Author: Randy Thiemann\n *\n *\/\n\n#include \"ToolBar.h\"\n#include <Gui\/Widgets\/MainWindow.h>\n\nQUML_BEGIN_NAMESPACE_GW\n\n#ifdef Q_OS_MAC\nToolBar::ToolBar() : mToolBar(new QMacUnifiedToolBar()) {}\n#else\nToolBar::ToolBar() : mToolBar(new QToolBar()) {}\n#endif\n\nvoid ToolBar::showInWindow(MainWindow* w) {\n mWindow = w;\n#ifdef Q_OS_MAC\n mToolBar->showInWindowForWidget(w);\n#else\n w->addToolBar(mToolBar.get());\n#endif\n}\n\nQuGW::MainWindow* ToolBar::window() {\n return mWindow;\n}\n\nQAction* ToolBar::addAction(const QIcon& icon, const QString& text) {\n return mToolBar->addAction(icon, text);\n}\n\nvoid ToolBar::addSeparator() {\n mToolBar->addSeparator();\n}\n\n#ifdef Q_OS_MAC\nvoid ToolBar::addFlexibleSpace() {\n mToolBar->addStandardItem(QMacToolButton::FlexibleSpace);\n}\n#endif\n\nQUML_END_NAMESPACE_GW\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Color.hh for Fluxbox Window Manager \n\/\/ Copyright (c) 2002 Henrik Kinnunen (fluxbox@linuxmail.org)\n\/\/\n\/\/ from Image.hh for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Color.hh,v 1.1 2002\/07\/23 16:23:15 fluxgen Exp $\n\n#ifndef FBTK_COLOR_HH\n#define FBTK_COLOR_HH\n\nnamespace FbTk {\n\/**\n\tHolds rgb color and pixel value\n*\/\nclass Color {\npublic:\n\tColor(unsigned char red = 0, unsigned char green = 0, unsigned char blue = 0):\n\tm_red(red),\tm_green(green), m_blue(blue), m_pixel(0), m_allocated(false) { }\n\n\tinline void setAllocated(bool a) { m_allocated = a; }\n\tinline void setRGB(char red, char green, char blue) { m_red = red; m_green = green; m_blue = blue; }\n\tinline void setPixel(unsigned long pixel) { m_pixel = pixel; }\n\n\tinline bool isAllocated() const { return m_allocated; }\n\n\tinline unsigned char red() const { return m_red; }\n\tinline unsigned char green() const { return m_green; }\n\tinline unsigned char blue() const { return m_blue; }\n\n\tinline unsigned long pixel() const { return m_pixel; }\n\nprivate:\n\tunsigned char m_red, m_green, m_blue;\n\tunsigned long m_pixel;\n\tbool m_allocated;\n};\n\n}; \/\/ end namespace FbTk\n\n#endif \/\/ FBTK_COLOR_HH\n<commit_msg>minor fixes<commit_after>\/\/ Color.hh for Fluxbox Window Manager \n\/\/ Copyright (c) 2002 Henrik Kinnunen (fluxgen@users.sourceforge.net)\n\/\/\n\/\/ from Image.hh for Blackbox - an X11 Window manager\n\/\/ Copyright (c) 1997 - 2000 Brad Hughes (bhughes@tcac.net)\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n\/\/ DEALINGS IN THE SOFTWARE.\n\n\/\/ $Id: Color.hh,v 1.2 2002\/09\/14 13:49:09 fluxgen Exp $\n\n#ifndef FBTK_COLOR_HH\n#define FBTK_COLOR_HH\n\n#include \"NotCopyable.hh\"\n\nnamespace FbTk {\n\/**\n\tHolds rgb color and pixel value\n*\/\nclass Color {\npublic:\n\tColor();\n\texplicit Color(unsigned long pixel);\n\tColor(const Color &col_copy);\n\tColor(unsigned char red, unsigned char green, unsigned char blue, int screen);\n\tColor(const char *color_string, int screen);\n\t~Color();\n\n\tbool setFromString(const char *color_string, int screen);\n\t\/\/\/ TODO don't like this\n\tvoid setPixel(unsigned long pixel) { m_pixel = pixel; }\n\t\n\tColor &operator = (const Color &col_copy);\n\t\n\tbool isAllocated() const { return m_allocated; }\n\tunsigned char red() const { return m_red; }\n\tunsigned char green() const { return m_green; }\n\tunsigned char blue() const { return m_blue; }\n\tunsigned long pixel() const { return m_pixel; }\n\t\nprivate:\n\tvoid free();\n\tvoid copy(const Color &col);\n\tvoid allocate(unsigned char red, unsigned char green, unsigned char blue, int screen);\n\tinline void setAllocated(bool a) { m_allocated = a; }\n\tvoid setRGB(unsigned char red, unsigned char green, unsigned char blue);\n\n\n\tunsigned char m_red, m_green, m_blue;\n\tunsigned long m_pixel;\n\tbool m_allocated;\n\tint m_screen;\n};\n\n}; \/\/ end namespace FbTk\n\n#endif \/\/ FBTK_COLOR_HH\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"Scene.hpp\"\n#include <SFML\/Graphics.hpp>\n#include <string>\n#include <vector>\n#include <map>\n\nclass Menu: public Scene\n{\npublic:\n\t\/\/ Command enum defines the relative order of elements\n\tenum Command {LEVEL, EDITOR, OPTIONS, CREDITS, EXIT};\n\tconst std::map<Command, std::string> cmdMap;\n\tstruct Entry\n\t{\n\t\tEntry(std::string name, sf::Font& font, sf::Color color, unsigned int charSize, sf::Vector2f center, float angle, float radius, Command cmd):\n\t\t\tcenter(center),\n\t\t\trotAngle(0),\n\t\t\tangle(angle),\n\t\t\tradius(radius),\n\t\t\tcmd(cmd)\n\t\t{\n\t\t\ttext.setFont(font);\n\t\t\ttext.setCharacterSize(charSize);\n\t\t\ttext.setColor(color);\n\t\t\ttext.setString(name);\n\t\t}\n\t\tvoid rotate(float angle)\n\t\t{\n\t\t\trotAngle += angle;\n\t\t}\n\t\tvoid update(float percentage)\n\t\t{\n\t\t\tif (fabs(rotAngle) < 0.005f)\n\t\t\t{\n\t\t\t\tangle += rotAngle;\n\t\t\t\trotAngle = 0.0f;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tangle += percentage * rotAngle;\n\t\t\t\trotAngle = (1.0f - percentage) * rotAngle;\n\t\t\t}\n\t\t\t\n\t\t\tsf::Vector2f textSize(text.getLocalBounds().width, text.getLocalBounds().height);\n\t\t\tsf::Vector2f dir(sin(angle), cos(angle));\n\t\t\tsf::Vector2f pos = center + dir * radius - textSize \/ 2.0f;\n\t\t\ttext.setPosition(pos);\n\t\t}\n\t\tsf::Text text;\n\t\tconst sf::Vector2f center;\n\t\tfloat rotAngle;\n\t\tfloat angle;\n\t\tconst float radius;\n\t\tCommand cmd;\n\t};\n\t\n\tMenu(Command initialCmd = LEVEL);\n\tScene* processEvent(sf::Event event, sf::RenderWindow& window) override final;\n\tvoid update(sf::Time deltaT, sf::RenderWindow& window) override final;\n\tvoid draw(sf::RenderTarget& target) override final;\nprivate:\n\tunsigned int nextPos(unsigned int pos, unsigned int size, bool clockWise);\n\tvoid rotate(bool clockWise);\n\tsf::Font _font;\n\tstd::vector<Entry> _entries;\n\tunsigned int _currentEntry;\n\tstd::vector<unsigned int> _levels;\n\tunsigned int _currentLevel;\n};\n<commit_msg>added comment<commit_after>#pragma once\n\n#include \"Scene.hpp\"\n#include <SFML\/Graphics.hpp>\n#include <string>\n#include <vector>\n#include <map>\n\nclass Menu: public Scene\n{\npublic:\n\t\/\/ Command enum defines the relative order of elements\n\tenum Command {LEVEL, EDITOR, OPTIONS, CREDITS, EXIT};\t\t\/\/ TODO move this to global?\n\tconst std::map<Command, std::string> cmdMap;\n\tstruct Entry\n\t{\n\t\tEntry(std::string name, sf::Font& font, sf::Color color, unsigned int charSize, sf::Vector2f center, float angle, float radius, Command cmd):\n\t\t\tcenter(center),\n\t\t\trotAngle(0),\n\t\t\tangle(angle),\n\t\t\tradius(radius),\n\t\t\tcmd(cmd)\n\t\t{\n\t\t\ttext.setFont(font);\n\t\t\ttext.setCharacterSize(charSize);\n\t\t\ttext.setColor(color);\n\t\t\ttext.setString(name);\n\t\t}\n\t\tvoid rotate(float angle)\n\t\t{\n\t\t\trotAngle += angle;\n\t\t}\n\t\tvoid update(float percentage)\n\t\t{\n\t\t\tif (fabs(rotAngle) < 0.005f)\n\t\t\t{\n\t\t\t\tangle += rotAngle;\n\t\t\t\trotAngle = 0.0f;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tangle += percentage * rotAngle;\n\t\t\t\trotAngle = (1.0f - percentage) * rotAngle;\n\t\t\t}\n\t\t\t\n\t\t\tsf::Vector2f textSize(text.getLocalBounds().width, text.getLocalBounds().height);\n\t\t\tsf::Vector2f dir(sin(angle), cos(angle));\n\t\t\tsf::Vector2f pos = center + dir * radius - textSize \/ 2.0f;\n\t\t\ttext.setPosition(pos);\n\t\t}\n\t\tsf::Text text;\n\t\tconst sf::Vector2f center;\n\t\tfloat rotAngle;\n\t\tfloat angle;\n\t\tconst float radius;\n\t\tCommand cmd;\n\t};\n\t\n\tMenu(Command initialCmd = LEVEL);\n\tScene* processEvent(sf::Event event, sf::RenderWindow& window) override final;\n\tvoid update(sf::Time deltaT, sf::RenderWindow& window) override final;\n\tvoid draw(sf::RenderTarget& target) override final;\nprivate:\n\tunsigned int nextPos(unsigned int pos, unsigned int size, bool clockWise);\n\tvoid rotate(bool clockWise);\n\tsf::Font _font;\n\tstd::vector<Entry> _entries;\n\tunsigned int _currentEntry;\n\tstd::vector<unsigned int> _levels;\n\tunsigned int _currentLevel;\n};\n<|endoftext|>"} {"text":"<commit_before>\/* -------------------------------------------------------------------------------------\n** This software is implemented as part of the course\n** Algorithms in Bioinformatics - Trees and Structures Q2\/2015\n** at Aarhus Univerity Denmark.\n**\n** Days.cpp\n** Implementation of the algorithm developed by Day as described in lecture 1 slide 23-27\n**\n** Author: Martin Storgaard, Konstantinos Mampentzidis and Henrik McQuoid Jespersen\n** -----------------------------------------------------------------------------------*\/\n#include \"Days.h\"\n\n\/**\n * Reads the given input file and constructs the graph given as parameter. The file have to be on the following format:\n * n\n * 1 parent\n * 1 parent\n * 1 parent\n * ...\n * |adj| adj\n * |adj| adj\n * ...\n *\n * for example\n * 5\n * 1 2 4\n * 1 2 \/ \\\n * 1 4 2 3\n * 3 0 1 4 \/ \\\n * 2 2 3 0 1\n *\/\nvoid Days::readFile(const char* file, vector<vector<size_t>> &graph) {\n ifstream fin;\n size_t size, i, j;\n bool expectInternalNode = false;\n\n fin.open(file,ios_base::in);\n if(!fin.is_open()) {\n cerr << \"Could not open file \" << file << endl;\n exit(EXIT_FAILURE);\n }\n fin>>size;\n graph.resize(size);\n\n for(i = 0; i < size; i++) {\n size_t tmpSize;\n fin >> tmpSize;\n if(tmpSize == 1 && expectInternalNode) {\n cerr << \"All leaf nodes have to be first in the input file!\" << endl;\n exit(EXIT_FAILURE);\n } else if(tmpSize == 1){\n numberOfLeaves++;\n } else {\n expectInternalNode = true;\n }\n for(j = 0; j < tmpSize; j++) {\n size_t tmpId;\n fin>>tmpId;\n graph[i].push_back(tmpId);\n }\n }\n fin.close();\n \/*\n for(i=0;i<size;i++){\n \n for(j=0;j<graph[i].size();j++){\n cout<<graph[i][j]<<\" \";\n }\n cout<<endl;\n \n }*\/\n\n}\n\n\/**\n * Sets the internal states corresponding to the two trees given as arguments\n *\/\nvoid Days::initialize(const char *filename1, const char *filename2) {\n \n numberOfLeaves = 0;\n readFile(filename1, graph1);\n graph1NodeInfo.resize(graph1.size());\n readFile(filename2, graph2);\n graph2NodeInfo.resize(graph2.size());\n numberOfLeaves \/= 2;\n dfsLabels.resize(numberOfLeaves, 0);\n\n}\n\n\/**\n * Process the first tree (T1) according to Step 2 and Step 4 given in the slides in the first lecture, i.e. defines\n * the DF-numbering and calculating the intervals in all nodes.\n *\/\nDays::node Days::step2(size_t curNode) {\n graph1NodeInfo[curNode].size = 0;\n graph1NodeInfo[curNode].minLabel = inf;\n graph1NodeInfo[curNode].maxLabel = 0; \/\/< Note that labeling starts at 1, thus no label can ever be 0\n\n if(curNode!=root && graph1[curNode].size() == 1) {\n \/\/ Set the DF-numbering\/labeling at the given leaf\n dfsLabels[curNode] = step2Counter;\n \/\/ All leafs have size 1 and their label as minimum and maximum labels\n graph1NodeInfo[curNode].size = 1;\n graph1NodeInfo[curNode].minLabel = step2Counter;\n graph1NodeInfo[curNode].maxLabel = step2Counter;\n \/\/ Prepare for next leaf\n step2Counter++;\n return graph1NodeInfo[curNode];\n }\n visited[curNode] = true;\n\n\n for(size_t neighbour : graph1[curNode]){\n if(!visited[neighbour]){\n node info = step2(neighbour);\n \/\/ Update the current information\n graph1NodeInfo[curNode].minLabel = min(graph1NodeInfo[curNode].minLabel, info.minLabel);\n graph1NodeInfo[curNode].maxLabel = max(graph1NodeInfo[curNode].maxLabel, info.maxLabel);\n graph1NodeInfo[curNode].size += info.size;\n }\n }\n \/\/ The current node have now all information added\n return graph1NodeInfo[curNode];\n \n}\n\n\/**\n * Almost the same as Days::step2, but this only processes the second tree (T2). Instead of using new labels, we\n * label all leafs to be the same as in the first tree.\n *\/\nDays::node Days::step4(size_t curNode) {\n \n graph2NodeInfo[curNode].size = 0;\n graph2NodeInfo[curNode].minLabel = inf;\n graph2NodeInfo[curNode].maxLabel = 0;\n \n if(curNode!=root && graph2[curNode].size() == 1){\n graph2NodeInfo[curNode].size = 1;\n graph2NodeInfo[curNode].minLabel = dfsLabels[curNode];\n graph2NodeInfo[curNode].maxLabel = dfsLabels[curNode];\n return graph2NodeInfo[curNode];\n }\n \n visited[curNode] = true;\n \n for(size_t neighbour : graph2[curNode]){\n if(!visited[neighbour]){\n node info = step4(neighbour);\n graph2NodeInfo[curNode].minLabel = min(graph2NodeInfo[curNode].minLabel, info.minLabel);\n graph2NodeInfo[curNode].maxLabel = max(graph2NodeInfo[curNode].maxLabel, info.maxLabel);\n graph2NodeInfo[curNode].size += info.size;\n }\n }\n \/\/ The current node have now all information added\n return graph2NodeInfo[curNode];\n\n}\n\nsize_t Days::run() {\n \/\/ Step 1, pick a common root\n \/\/ The input files are required to have all leafs first in the file, sorted such that they have the same order,\n \/\/ thus graph1[0] == graph2[0] holds\n root = 0;\n \/\/ Step 2, label all leafs in T1 a DF manner\n \/\/ Step 3, label all corresponding leaf nodes in T2 as for T1 (no-ops)\n \/\/ Step 4 (part 1), set all splits in T1\n step2Counter = 1;\n visited.resize(graph1.size(), false);\n step2(root);\n \/\/ Step 4 (part 2), find all splits in T2\n visited.assign(graph2.size(), false);\n step4(root);\n\n \/\/ Step 4 (part 3), find all shared splits between T1 and T2\n \/\/TODO: use radix sort\n sort(graph1NodeInfo.begin(), graph1NodeInfo.end(), Days::comp());\n sort(graph2NodeInfo.begin(), graph2NodeInfo.end(), Days::comp());\n \n\/\/ size_t i;\n\/\/ for(i=0;i<graph1NodeInfo.size();i++){\n\/\/ cout<<\"[\"<<graph1NodeInfo[i].minLabel<<\",\"<<graph1NodeInfo[i].maxLabel<<\",\"<<graph1NodeInfo[i].size<<\"] \";\n\/\/ }\n\/\/ cout<<endl;\n\/\/ for(i=0;i<graph2NodeInfo.size();i++){\n\/\/ cout<<\"[\"<<graph2NodeInfo[i].minLabel<<\",\"<<graph2NodeInfo[i].maxLabel<<\",\"<<graph2NodeInfo[i].size<<\"] \";\n\/\/ }\n\/\/ cout<<endl;\n \n size_t t1, t2,sharedSplits = 0;\n const size_t size1 = graph1NodeInfo.size();\n const size_t size2 = graph2NodeInfo.size();\n\n t1=t2=0;\n while(t1 < size1 && t2 < size2){\n \n const node node1 = graph1NodeInfo[t1];\n const node node2 = graph2NodeInfo[t2];\n \n if(node1 == node2){\n if(node1.size == node2.size) {\n \/\/ node1 is always filled with consequently filled intervals, thus that size of node1 always indicates\n \/\/ a legal split\n sharedSplits++;\n }\n t1++;\n t2++;\n } else if(node1 < node2){\n t1++;\n } else{\n t2++;\n }\n \n }\n \/\/ The RF-distance is then \"number of splits not found in both trees\", which is equal to the number of splits\n \/\/ in both trees, minus all the shared splits between T1 and T2 minus all the shared splits in T2 and T1\n return size1 + size2 - 2*sharedSplits;\n}\n<commit_msg>Using fill to clear in visited vector, which uses mmx registers to dump in 16 bytes at a time<commit_after>\/* -------------------------------------------------------------------------------------\n** This software is implemented as part of the course\n** Algorithms in Bioinformatics - Trees and Structures Q2\/2015\n** at Aarhus Univerity Denmark.\n**\n** Days.cpp\n** Implementation of the algorithm developed by Day as described in lecture 1 slide 23-27\n**\n** Author: Martin Storgaard, Konstantinos Mampentzidis and Henrik McQuoid Jespersen\n** -----------------------------------------------------------------------------------*\/\n#include \"Days.h\"\n\n\/**\n * Reads the given input file and constructs the graph given as parameter. The file have to be on the following format:\n * n\n * 1 parent\n * 1 parent\n * 1 parent\n * ...\n * |adj| adj\n * |adj| adj\n * ...\n *\n * for example\n * 5\n * 1 2 4\n * 1 2 \/ \\\n * 1 4 2 3\n * 3 0 1 4 \/ \\\n * 2 2 3 0 1\n *\/\nvoid Days::readFile(const char* file, vector<vector<size_t>> &graph) {\n ifstream fin;\n size_t size, i, j;\n bool expectInternalNode = false;\n\n fin.open(file,ios_base::in);\n if(!fin.is_open()) {\n cerr << \"Could not open file \" << file << endl;\n exit(EXIT_FAILURE);\n }\n fin>>size;\n graph.resize(size);\n\n for(i = 0; i < size; i++) {\n size_t tmpSize;\n fin >> tmpSize;\n if(tmpSize == 1 && expectInternalNode) {\n cerr << \"All leaf nodes have to be first in the input file!\" << endl;\n exit(EXIT_FAILURE);\n } else if(tmpSize == 1){\n numberOfLeaves++;\n } else {\n expectInternalNode = true;\n }\n for(j = 0; j < tmpSize; j++) {\n size_t tmpId;\n fin>>tmpId;\n graph[i].push_back(tmpId);\n }\n }\n fin.close();\n \/*\n for(i=0;i<size;i++){\n \n for(j=0;j<graph[i].size();j++){\n cout<<graph[i][j]<<\" \";\n }\n cout<<endl;\n \n }*\/\n\n}\n\n\/**\n * Sets the internal states corresponding to the two trees given as arguments\n *\/\nvoid Days::initialize(const char *filename1, const char *filename2) {\n \n numberOfLeaves = 0;\n readFile(filename1, graph1);\n graph1NodeInfo.resize(graph1.size());\n readFile(filename2, graph2);\n graph2NodeInfo.resize(graph2.size());\n numberOfLeaves \/= 2;\n dfsLabels.resize(numberOfLeaves, 0);\n\n}\n\n\/**\n * Process the first tree (T1) according to Step 2 and Step 4 given in the slides in the first lecture, i.e. defines\n * the DF-numbering and calculating the intervals in all nodes.\n *\/\nDays::node Days::step2(size_t curNode) {\n graph1NodeInfo[curNode].size = 0;\n graph1NodeInfo[curNode].minLabel = inf;\n graph1NodeInfo[curNode].maxLabel = 0; \/\/< Note that labeling starts at 1, thus no label can ever be 0\n\n if(curNode!=root && graph1[curNode].size() == 1) {\n \/\/ Set the DF-numbering\/labeling at the given leaf\n dfsLabels[curNode] = step2Counter;\n \/\/ All leafs have size 1 and their label as minimum and maximum labels\n graph1NodeInfo[curNode].size = 1;\n graph1NodeInfo[curNode].minLabel = step2Counter;\n graph1NodeInfo[curNode].maxLabel = step2Counter;\n \/\/ Prepare for next leaf\n step2Counter++;\n return graph1NodeInfo[curNode];\n }\n visited[curNode] = true;\n\n\n for(size_t neighbour : graph1[curNode]){\n if(!visited[neighbour]){\n node info = step2(neighbour);\n \/\/ Update the current information\n graph1NodeInfo[curNode].minLabel = min(graph1NodeInfo[curNode].minLabel, info.minLabel);\n graph1NodeInfo[curNode].maxLabel = max(graph1NodeInfo[curNode].maxLabel, info.maxLabel);\n graph1NodeInfo[curNode].size += info.size;\n }\n }\n \/\/ The current node have now all information added\n return graph1NodeInfo[curNode];\n \n}\n\n\/**\n * Almost the same as Days::step2, but this only processes the second tree (T2). Instead of using new labels, we\n * label all leafs to be the same as in the first tree.\n *\/\nDays::node Days::step4(size_t curNode) {\n \n graph2NodeInfo[curNode].size = 0;\n graph2NodeInfo[curNode].minLabel = inf;\n graph2NodeInfo[curNode].maxLabel = 0;\n \n if(curNode!=root && graph2[curNode].size() == 1){\n graph2NodeInfo[curNode].size = 1;\n graph2NodeInfo[curNode].minLabel = dfsLabels[curNode];\n graph2NodeInfo[curNode].maxLabel = dfsLabels[curNode];\n return graph2NodeInfo[curNode];\n }\n \n visited[curNode] = true;\n \n for(size_t neighbour : graph2[curNode]){\n if(!visited[neighbour]){\n node info = step4(neighbour);\n graph2NodeInfo[curNode].minLabel = min(graph2NodeInfo[curNode].minLabel, info.minLabel);\n graph2NodeInfo[curNode].maxLabel = max(graph2NodeInfo[curNode].maxLabel, info.maxLabel);\n graph2NodeInfo[curNode].size += info.size;\n }\n }\n \/\/ The current node have now all information added\n return graph2NodeInfo[curNode];\n\n}\n\nsize_t Days::run() {\n \/\/ Step 1, pick a common root\n \/\/ The input files are required to have all leafs first in the file, sorted such that they have the same order,\n \/\/ thus graph1[0] == graph2[0] holds\n root = 0;\n \/\/ Step 2, label all leafs in T1 a DF manner\n \/\/ Step 3, label all corresponding leaf nodes in T2 as for T1 (no-ops)\n \/\/ Step 4 (part 1), set all splits in T1\n step2Counter = 1;\n visited.resize(graph1.size(), false);\n step2(root);\n \/\/ Step 4 (part 2), find all splits in T2\n fill(visited.begin(), visited.begin()+graph2.size(), false);\n\/\/ visited.assign(graph2.size(), false);\n step4(root);\n\n \/\/ Step 4 (part 3), find all shared splits between T1 and T2\n \/\/TODO: use radix sort\n sort(graph1NodeInfo.begin(), graph1NodeInfo.end(), Days::comp());\n sort(graph2NodeInfo.begin(), graph2NodeInfo.end(), Days::comp());\n \n\/\/ size_t i;\n\/\/ for(i=0;i<graph1NodeInfo.size();i++){\n\/\/ cout<<\"[\"<<graph1NodeInfo[i].minLabel<<\",\"<<graph1NodeInfo[i].maxLabel<<\",\"<<graph1NodeInfo[i].size<<\"] \";\n\/\/ }\n\/\/ cout<<endl;\n\/\/ for(i=0;i<graph2NodeInfo.size();i++){\n\/\/ cout<<\"[\"<<graph2NodeInfo[i].minLabel<<\",\"<<graph2NodeInfo[i].maxLabel<<\",\"<<graph2NodeInfo[i].size<<\"] \";\n\/\/ }\n\/\/ cout<<endl;\n \n size_t t1, t2,sharedSplits = 0;\n const size_t size1 = graph1NodeInfo.size();\n const size_t size2 = graph2NodeInfo.size();\n\n t1=t2=0;\n while(t1 < size1 && t2 < size2){\n \n const node node1 = graph1NodeInfo[t1];\n const node node2 = graph2NodeInfo[t2];\n \n if(node1 == node2){\n if(node1.size == node2.size) {\n \/\/ node1 is always filled with consequently filled intervals, thus that size of node1 always indicates\n \/\/ a legal split\n sharedSplits++;\n }\n t1++;\n t2++;\n } else if(node1 < node2){\n t1++;\n } else{\n t2++;\n }\n \n }\n \/\/ The RF-distance is then \"number of splits not found in both trees\", which is equal to the number of splits\n \/\/ in both trees, minus all the shared splits between T1 and T2 minus all the shared splits in T2 and T1\n return size1 + size2 - 2*sharedSplits;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================\n\/\/File Name: Shooter.cpp\n\/\/Description: Provides an interface to the dual-motored shooter and its\n\/\/ encoder; it also has an interface for a PID loop\n\/\/Author: FRC Team 3512, Spartatroniks\n\/\/=============================================================================\n\n#include \"Shooter.hpp\"\n#include <cmath>\n#include <cfloat>\n\nconst float Shooter::maxSpeed = 5000.f;\n\nShooter::Shooter( UINT32 motor1 , UINT32 motor2 ,\n UINT32 encChannel , UINT32 encTeeth , float encGearRatio ) :\n m_shooterMotor1( motor1 ) ,\n m_shooterMotor2( motor2 ) ,\n m_shooterEncoder( encChannel , encTeeth , encGearRatio ) ,\n m_shooterPID( 0.f , 0.f , 0.f , 1.f \/ maxSpeed , this , this , 0.5f ) ,\n m_setpoint( 0.f ) ,\n m_isShooting( false ) ,\n m_controlMode( Manual ) ,\n m_negativeOutputAllowed( true ) ,\n m_P( m_shooterPID.GetP() ) ,\n m_I( m_shooterPID.GetI() ) ,\n m_D( m_shooterPID.GetD() ) ,\n m_F( m_shooterPID.GetF() ) {\n m_shooterPID.SetOutputRange( -1.f , 1.f );\n m_shooterPID.SetTolerance( 0.f );\n\n m_shooterPID.SetSetpoint( m_setpoint );\n\n m_shooterEncoder.start();\n m_shooterPID.Enable();\n start();\n}\n\nShooter::~Shooter() {\n\n}\n\nvoid Shooter::start() {\n m_shooterPID.Enable();\n m_shooterPID.SetSetpoint( m_setpoint );\n\n m_isShooting = true;\n}\n\nvoid Shooter::stop() {\n m_shooterPID.Reset();\n\n m_isShooting = false;\n}\n\nbool Shooter::isShooting() {\n return m_isShooting;\n}\n\nbool Shooter::isReady() {\n return std::fabs(getRPM() - m_setpoint) < 100 && m_isShooting;\n}\n\nvoid Shooter::setRPM( float wheelSpeed ) {\n if ( m_isShooting ) {\n m_setpoint = wheelSpeed;\n m_shooterPID.SetSetpoint( m_setpoint );\n }\n}\n\nvoid Shooter::setScale( float scaleFactor ) {\n if ( m_isShooting ) {\n \/\/ Limit 'scaleFactor' to a value between 0 and 1 inclusive\n if ( scaleFactor < 0.f ) {\n scaleFactor = 0.f;\n }\n if ( scaleFactor > 1.f ) {\n scaleFactor = 1.f;\n }\n\n m_setpoint = scaleFactor * maxSpeed;\n m_shooterPID.SetSetpoint( m_setpoint );\n }\n}\n\nfloat Shooter::getRPM() {\n return m_shooterEncoder.getRPM();\n}\n\nfloat Shooter::getTargetRPM() {\n return m_setpoint;\n}\n\nbool Shooter::negativeOutputAllowed() {\n return m_negativeOutputAllowed;\n}\n\nvoid Shooter::setControlMode( ControlMode mode ) {\n m_controlMode = mode;\n\n if ( mode == Manual ) {\n m_shooterPID.SetPID( 0.f , 0.f , 0.f , m_F );\n }\n else {\n m_shooterPID.SetPID( m_P , m_I , m_D , 0.f );\n }\n}\n\nShooter::ControlMode Shooter::getControlMode() {\n return m_controlMode;\n}\n\nvoid Shooter::setPID( float p , float i , float d ) {\n m_P = p;\n m_I = i;\n m_D = d;\n\n \/\/ Updates PID constants for PIDController object internally\n setControlMode( getControlMode() );\n}\n\ndouble Shooter::PIDGet() {\n if ( m_shooterEncoder.getRPM() < 100.f && m_negativeOutputAllowed ) {\n m_shooterPID.SetOutputRange( 0.f , 1.f );\n m_negativeOutputAllowed = false;\n }\n else if ( m_shooterEncoder.getRPM() >= 500.f && !m_negativeOutputAllowed ) {\n m_shooterPID.SetOutputRange( -1.f , 1.f );\n m_negativeOutputAllowed = true;\n }\n\n return m_shooterEncoder.getRPM();\n}\n\nvoid Shooter::PIDWrite( float output ) {\n \/* Ouputs are negated because the motor controllers require a negative\n * number to make the shooter wheel spin in the correct direction\n *\/\n switch ( m_controlMode ) {\n case PID: {\n m_shooterMotor1.Set( -output );\n m_shooterMotor2.Set( -output );\n\n break;\n }\n\n case BangBang: {\n if ( m_shooterEncoder.getRPM() >= m_setpoint ) {\n m_shooterMotor1.Set( 0.f );\n m_shooterMotor2.Set( 0.f );\n }\n else {\n m_shooterMotor1.Set( -1.f );\n m_shooterMotor2.Set( -1.f );\n }\n\n break;\n }\n\n \/* The only non-zero term in \"Manual\" is F, which turns off error\n * correction and responds only to the input given by the user.\n *\/\n case Manual: {\n m_shooterMotor1.Set( -output );\n m_shooterMotor2.Set( -output );\n\n break;\n }\n }\n}\n<commit_msg>Commit before 2013 bag-up<commit_after>\/\/=============================================================================\n\/\/File Name: Shooter.cpp\n\/\/Description: Provides an interface to the dual-motored shooter and its\n\/\/ encoder; it also has an interface for a PID loop\n\/\/Author: FRC Team 3512, Spartatroniks\n\/\/=============================================================================\n\n#include \"Shooter.hpp\"\n#include <cmath>\n#include <cfloat>\n\nconst float Shooter::maxSpeed = 5000.f;\n\nShooter::Shooter( UINT32 motor1 , UINT32 motor2 ,\n UINT32 encChannel , UINT32 encTeeth , float encGearRatio ) :\n m_shooterMotor1( motor1 ) ,\n m_shooterMotor2( motor2 ) ,\n m_shooterEncoder( encChannel , encTeeth , encGearRatio ) ,\n m_shooterPID( 0.f , 0.f , 0.f , 1.f \/ maxSpeed , this , this , 0.5f ) ,\n m_setpoint( 0.f ) ,\n m_isShooting( false ) ,\n m_controlMode( Manual ) ,\n m_negativeOutputAllowed( true ) ,\n m_P( m_shooterPID.GetP() ) ,\n m_I( m_shooterPID.GetI() ) ,\n m_D( m_shooterPID.GetD() ) ,\n m_F( m_shooterPID.GetF() ) {\n m_shooterPID.SetOutputRange( -1.f , 1.f );\n m_shooterPID.SetTolerance( 0.f );\n\n m_shooterPID.SetSetpoint( m_setpoint );\n\n m_shooterEncoder.start();\n m_shooterPID.Enable();\n start();\n}\n\nShooter::~Shooter() {\n\n}\n\nvoid Shooter::start() {\n m_shooterPID.Enable();\n m_shooterPID.SetSetpoint( m_setpoint );\n\n m_isShooting = true;\n}\n\nvoid Shooter::stop() {\n m_shooterPID.Reset();\n\n m_isShooting = false;\n}\n\nbool Shooter::isShooting() {\n return m_isShooting;\n}\n\nbool Shooter::isReady() {\n return std::fabs(getRPM() - m_setpoint) < 100 && m_isShooting;\n}\n\nvoid Shooter::setRPM( float wheelSpeed ) {\n if ( m_isShooting ) {\n m_setpoint = wheelSpeed;\n m_shooterPID.SetSetpoint( m_setpoint );\n }\n}\n\nvoid Shooter::setScale( float scaleFactor ) {\n if ( m_isShooting ) {\n \/\/ Limit 'scaleFactor' to a value between 0 and 1 inclusive\n if ( scaleFactor < 0.f ) {\n scaleFactor = 0.f;\n }\n if ( scaleFactor > 1.f ) {\n scaleFactor = 1.f;\n }\n\n m_setpoint = scaleFactor * maxSpeed;\n m_shooterPID.SetSetpoint( m_setpoint );\n }\n}\n\nfloat Shooter::getRPM() {\n return m_shooterEncoder.getRPM();\n}\n\n<<<<<<< HEAD\nfloat Shooter::getTargetRPM() {\n return m_setpoint;\n}\n\nbool Shooter::negativeOutputAllowed() {\n return m_negativeOutputAllowed;\n=======\nvoid Shooter::enableControl() {\n \/\/if ( getControlMode() == PID ) {\n m_shooterPID.Enable();\n \/\/}\n}\n\nvoid Shooter::disableControl() {\n \/\/if ( getControlMode() == PID ) {\n m_shooterPID.Disable();\n \/\/}\n>>>>>>> Commit before 2013 bag-up\n}\n\nvoid Shooter::setControlMode( ControlMode mode ) {\n m_controlMode = mode;\n\n if ( mode == Manual ) {\n m_shooterPID.SetPID( 0.f , 0.f , 0.f , m_F );\n }\n else {\n m_shooterPID.SetPID( m_P , m_I , m_D , 0.f );\n }\n}\n\nShooter::ControlMode Shooter::getControlMode() {\n return m_controlMode;\n}\n\nvoid Shooter::setPID( float p , float i , float d ) {\n m_P = p;\n m_I = i;\n m_D = d;\n\n \/\/ Updates PID constants for PIDController object internally\n setControlMode( getControlMode() );\n}\n\ndouble Shooter::PIDGet() {\n if ( m_shooterEncoder.getRPM() < 100.f && m_negativeOutputAllowed ) {\n m_shooterPID.SetOutputRange( 0.f , 1.f );\n m_negativeOutputAllowed = false;\n }\n else if ( m_shooterEncoder.getRPM() >= 500.f && !m_negativeOutputAllowed ) {\n m_shooterPID.SetOutputRange( -1.f , 1.f );\n m_negativeOutputAllowed = true;\n }\n\n return m_shooterEncoder.getRPM();\n}\n\nvoid Shooter::PIDWrite( float output ) {\n \/* Ouputs are negated because the motor controllers require a negative\n * number to make the shooter wheel spin in the correct direction\n *\/\n switch ( m_controlMode ) {\n case PID: {\n m_shooterMotor1.Set( -output );\n m_shooterMotor2.Set( -output );\n\n break;\n }\n\n case BangBang: {\n if ( m_shooterEncoder.getRPM() >= m_setpoint ) {\n m_shooterMotor1.Set( 0.f );\n m_shooterMotor2.Set( 0.f );\n }\n else {\n m_shooterMotor1.Set( -1.f );\n m_shooterMotor2.Set( -1.f );\n }\n\n break;\n<<<<<<< HEAD\n }\n\n \/* The only non-zero term in \"Manual\" is F, which turns off error\n * correction and responds only to the input given by the user.\n *\/\n case Manual: {\n m_shooterMotor1.Set( -output );\n m_shooterMotor2.Set( -output );\n\n break;\n=======\n>>>>>>> Commit before 2013 bag-up\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Game.h>\n\nGame& Game::getGame(const std::string& _name) {\n static Game* instance = new Game(_name);\n INFO(\"Getting Game instance\");\n return *instance;\n}\n\nGame::Game(const std::string& _name) {\n INFO(\"Initializing new Game: %s\", _name.c_str());\n config.name = _name;\n\n std::string iniFilename = config.name;\n iniFilename.append(\".ini\");\n\n INIReader reader(iniFilename);\n INFO(\"Reading config from '%s'\", iniFilename.c_str());\n if (reader.ParseError() < 0) {\n ERR(\"Can't load '%s', using defaults\", iniFilename.c_str());\n } else {\n \/\/ 1200x675 is a 16:9 window that fits inside a 1366x768 screen on most systems\n config.width = (unsigned int) std::abs(reader.GetInteger(\"game\", \"width\", (long) config.width));\n config.height = (unsigned int) std::abs(reader.GetInteger(\"game\", \"height\", (long) config.height));\n config.fullscreen = reader.GetBoolean(\"game\", \"fullscreen\", config.fullscreen);\n config.useDesktopSize = reader.GetBoolean(\"game\", \"useDesktopSize\", config.useDesktopSize);\n config.deadZone = static_cast<float>(reader.GetReal(\"game\", \"deadZone\", config.deadZone));\n config.keySpeed = static_cast<float>(reader.GetReal(\"game\", \"keySpeed\", config.keySpeed));\n }\n INFO(\"--Config--\");\n INFO(\"width = %d\", config.width);\n INFO(\"height = %d\", config.height);\n INFO(\"fullscreen = %s\", (config.fullscreen ? \"true\" : \"false\"));\n INFO(\"useDesktopSize = %s\", (config.useDesktopSize ? \"true\" : \"false\"));\n INFO(\"deadZone = %f\", config.deadZone);\n INFO(\"keySpeed = %f\", config.keySpeed);\n INFO(\"--End config--\");\n\n INFO(\"Creating %dx%d render target\", renderWidth, renderHeight);\n screen.create(renderWidth, renderHeight);\n\n createWindow(config.fullscreen);\n\n spritesMutex.lock();\n player = new GamePlayer;\n player->setPosition(renderWidth * 1 \/ 2, renderHeight * 3 \/ 4);\n sprites.push_back(player);\n spritesMutex.unlock();\n INFO(\"Loaded player\");\n\n isReady = true;\n INFO(\"Initialized\");\n}\n\nbool Game::ready() {\n return isReady;\n}\n\nvoid Game::createWindow(bool shouldFullscreen) {\n unsigned int flags = 0;\n sf::VideoMode mode;\n config.fullscreen = shouldFullscreen;\n if (config.fullscreen) {\n INFO(\"Going fullscreen\");\n window.setMouseCursorVisible(false);\n if (config.useDesktopSize) {\n INFO(\"Setting fullscreen mode (using desktop size): %dx%d\",\n sf::VideoMode::getDesktopMode().width,\n sf::VideoMode::getDesktopMode().height);\n mode = sf::VideoMode::getDesktopMode();\n } else {\n INFO(\"Setting fullscreen mode: %dx%d\", config.width, config.height);\n mode = sf::VideoMode(config.width, config.height);\n }\n flags = sf::Style::Fullscreen;\n } else {\n INFO(\"Setting windowed mode: %dx%d\", config.width, config.height);\n window.setMouseCursorVisible(true);\n mode = sf::VideoMode(config.width, config.height);\n flags = sf::Style::Titlebar | sf::Style::Close | sf::Style::Resize;\n }\n windowMutex.lock();\n window.create(mode, config.name, flags);\n if (!window.isOpen()) {\n ERR(\"Could not create main window\");\n exit(EXIT_FAILURE);\n }\n sf::ContextSettings settings = window.getSettings();\n INFO(\"Using OpenGL %d.%d\", settings.majorVersion, settings.minorVersion);\n\n \/\/ initialize the view\n view = window.getDefaultView();\n view.setSize(renderWidth, renderHeight);\n view.setCenter(renderWidth \/ 2, renderHeight \/ 2);\n window.setView(view);\n INFO(\"Enabling V-sync\");\n window.setVerticalSyncEnabled(true);\n \/\/ scale the viewport to maintain good aspect\n adjustAspect(window.getSize());\n windowMutex.unlock();\n}\n\nvoid Game::adjustAspect(sf::Event::SizeEvent newSize) {\n \/\/ save the new window size since this came from a resize event\n \/\/ not from initialization or a fullscreen toggle\n config.width = newSize.width;\n config.height = newSize.height;\n \/\/ do the calculation\n adjustAspect(sf::Vector2u(newSize.width, newSize.height));\n}\n\nvoid Game::adjustAspect(sf::Vector2u newSize) {\n \/\/ compute the current aspect\n float currentRatio = (float) newSize.x \/ (float) newSize.y;\n \/\/ used to offset and scale the viewport to maintain 16:9 aspect\n float widthScale = 1.0f;\n float widthOffset = 0.0f;\n float heightScale = 1.0f;\n float heightOffset = 0.0f;\n \/\/ used to compare and compute aspect ratios\n \/\/ for logging\n std::string isSixteenNine = \"16:9\";\n if (currentRatio > 16.0f \/ 9.0f) {\n \/\/ we are wider\n isSixteenNine = \"wide\";\n widthScale = newSize.y * (16.0f \/ 9.0f) \/ newSize.x;\n widthOffset = (1.0f - widthScale) \/ 2.0f;\n } else if (currentRatio < 16.0f \/ 9.0f) {\n \/\/ we are narrower\n isSixteenNine = \"narrow\";\n heightScale = newSize.x * (9.0f \/ 16.0f) \/ newSize.y;\n heightOffset = (1.0f - heightScale) \/ 2.0f;\n }\n INFO(\"Adjusting aspect for window size \", newSize.x, newSize.y);\n INFO(\"Setting %s viewport (wo:%f, ho:%f; ws:%f, hs: %f\", isSixteenNine.c_str(),\n widthOffset, heightOffset, widthScale, heightScale);\n view.setViewport(sf::FloatRect(widthOffset, heightOffset, widthScale, heightScale));\n windowMutex.lock();\n window.setView(view);\n windowMutex.unlock();\n\n}\n\n\nvoid Game::processEvents() {\n static sf::Event event;\n\n while (window.pollEvent(event)) {\n switch (event.type) {\n case sf::Event::Closed:\n INFO(\"Window closed\");\n window.close();\n break;\n case sf::Event::Resized:\n adjustAspect(event.size);\n break;\n case sf::Event::KeyPressed:\n handleKeyPress(event);\n break;\n case sf::Event::KeyReleased:\n handleKeyRelease(event);\n break;\n default:\n break;\n }\n }\n}\n\nvoid Game::handleKeyPress(const sf::Event& event) {\n switch (event.key.code) {\n case sf::Keyboard::Escape:\n INFO(\"GamePlayer exited\");\n window.close();\n break;\n case sf::Keyboard::Return:\n if (event.key.alt) {\n createWindow(!config.fullscreen);\n }\n break;\n default:\n break;\n }\n}\n\nvoid Game::handleKeyRelease(const sf::Event& event) const {\n switch (event.key.code) {\n default:\n break;\n }\n}\n\nvoid Game::updateControls() {\n float x, y = 0;\n\n float joy0_X = sf::Joystick::getAxisPosition(0, sf::Joystick::X);\n float joy0_y = sf::Joystick::getAxisPosition(0, sf::Joystick::Y);\n x = fabs(joy0_X) < config.deadZone ? 0 : joy0_X;\n y = fabs(joy0_y) < config.deadZone ? 0 : joy0_y;\n\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Up)) {\n y += -config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Right)) {\n x += config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Down)) {\n y += config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Left)) {\n x += -config.keySpeed;\n }\n spritesMutex.lock();\n player->moveBy(x, y);\n spritesMutex.unlock();\n\n}\n\nvoid Game::updateWorld(sf::Time elapsed) {\n spritesMutex.lock();\n const int millis = elapsed.asMilliseconds();\n for (auto sprite : sprites) {\n sprite->update(millis);\n }\n spritesMutex.unlock();\n}\n\n\nvoid Game::run(void) {\n window.setActive(false);\n sf::Thread renderThread(&Game::renderLoop, this);\n renderThread.launch();\n\n sf::Clock gameClock;\n sf::Time elapsedTime;\n\/\/ sf::Int32 updateTime;\n INFO(\"Starting %s\", config.name.c_str());\n while (window.isOpen()) {\n elapsedTime = gameClock.restart();\n processEvents();\n updateControls();\n updateWorld(elapsedTime);\n sf::sleep(sf::milliseconds(16));\n\/\/ updateTime = elapsedTime.asMilliseconds();\n\/\/ DBUG(\"Update time: %d ms\", updateTime);\n }\n INFO(\"Stopped\");\n}\n\nvoid Game::renderLoop(void) {\n sf::Int32 frameTime;\n sf::Clock renderClock;\n window.setActive(true);\n renderClock.restart();\n while (window.isOpen()) {\n \/\/ blank the render target to black\n screen.clear(sf::Color::Black);\n \/\/ render all the normal sprites\n spritesMutex.lock();\n for (const auto sprite : sprites) {\n screen.draw(*sprite);\n }\n spritesMutex.unlock();\n \/\/ update the target\n screen.display();\n windowMutex.lock();\n \/\/ blank the window to gray\n window.clear(sf::Color(128, 128, 128));\n \/\/ copy render target to window\n window.draw(sf::Sprite(screen.getTexture()));\n \/\/ update thw window\n window.display();\n windowMutex.unlock();\n frameTime = renderClock.restart().asMilliseconds();\n DBUG(\"Frame time: %d ms\", frameTime);\n }\n}<commit_msg>Keep track of average update and frame times.<commit_after>#include <Game.h>\n\nGame& Game::getGame(const std::string& _name) {\n static Game* instance = new Game(_name);\n INFO(\"Getting Game instance\");\n return *instance;\n}\n\nGame::Game(const std::string& _name) {\n INFO(\"Initializing new Game: %s\", _name.c_str());\n config.name = _name;\n\n std::string iniFilename = config.name;\n iniFilename.append(\".ini\");\n\n INIReader reader(iniFilename);\n INFO(\"Reading config from '%s'\", iniFilename.c_str());\n if (reader.ParseError() < 0) {\n ERR(\"Can't load '%s', using defaults\", iniFilename.c_str());\n } else {\n \/\/ 1200x675 is a 16:9 window that fits inside a 1366x768 screen on most systems\n config.width = (unsigned int) std::abs(reader.GetInteger(\"game\", \"width\", (long) config.width));\n config.height = (unsigned int) std::abs(reader.GetInteger(\"game\", \"height\", (long) config.height));\n config.fullscreen = reader.GetBoolean(\"game\", \"fullscreen\", config.fullscreen);\n config.useDesktopSize = reader.GetBoolean(\"game\", \"useDesktopSize\", config.useDesktopSize);\n config.deadZone = static_cast<float>(reader.GetReal(\"game\", \"deadZone\", config.deadZone));\n config.keySpeed = static_cast<float>(reader.GetReal(\"game\", \"keySpeed\", config.keySpeed));\n }\n INFO(\"--Config--\");\n INFO(\"width = %d\", config.width);\n INFO(\"height = %d\", config.height);\n INFO(\"fullscreen = %s\", (config.fullscreen ? \"true\" : \"false\"));\n INFO(\"useDesktopSize = %s\", (config.useDesktopSize ? \"true\" : \"false\"));\n INFO(\"deadZone = %f\", config.deadZone);\n INFO(\"keySpeed = %f\", config.keySpeed);\n INFO(\"--End config--\");\n\n INFO(\"Creating %dx%d render target\", renderWidth, renderHeight);\n screen.create(renderWidth, renderHeight);\n\n createWindow(config.fullscreen);\n\n spritesMutex.lock();\n player = new GamePlayer;\n player->setPosition(renderWidth * 1 \/ 2, renderHeight * 3 \/ 4);\n sprites.push_back(player);\n spritesMutex.unlock();\n INFO(\"Loaded player\");\n\n isReady = true;\n INFO(\"Initialized\");\n}\n\nbool Game::ready() {\n return isReady;\n}\n\nvoid Game::createWindow(bool shouldFullscreen) {\n unsigned int flags = 0;\n sf::VideoMode mode;\n config.fullscreen = shouldFullscreen;\n if (config.fullscreen) {\n INFO(\"Going fullscreen\");\n window.setMouseCursorVisible(false);\n if (config.useDesktopSize) {\n INFO(\"Setting fullscreen mode (using desktop size): %dx%d\",\n sf::VideoMode::getDesktopMode().width,\n sf::VideoMode::getDesktopMode().height);\n mode = sf::VideoMode::getDesktopMode();\n } else {\n INFO(\"Setting fullscreen mode: %dx%d\", config.width, config.height);\n mode = sf::VideoMode(config.width, config.height);\n }\n flags = sf::Style::Fullscreen;\n } else {\n INFO(\"Setting windowed mode: %dx%d\", config.width, config.height);\n window.setMouseCursorVisible(true);\n mode = sf::VideoMode(config.width, config.height);\n flags = sf::Style::Titlebar | sf::Style::Close | sf::Style::Resize;\n }\n windowMutex.lock();\n window.create(mode, config.name, flags);\n if (!window.isOpen()) {\n ERR(\"Could not create main window\");\n exit(EXIT_FAILURE);\n }\n sf::ContextSettings settings = window.getSettings();\n INFO(\"Using OpenGL %d.%d\", settings.majorVersion, settings.minorVersion);\n\n \/\/ initialize the view\n view = window.getDefaultView();\n view.setSize(renderWidth, renderHeight);\n view.setCenter(renderWidth \/ 2, renderHeight \/ 2);\n window.setView(view);\n INFO(\"Enabling V-sync\");\n window.setVerticalSyncEnabled(true);\n \/\/ scale the viewport to maintain good aspect\n adjustAspect(window.getSize());\n windowMutex.unlock();\n}\n\nvoid Game::adjustAspect(sf::Event::SizeEvent newSize) {\n \/\/ save the new window size since this came from a resize event\n \/\/ not from initialization or a fullscreen toggle\n config.width = newSize.width;\n config.height = newSize.height;\n \/\/ do the calculation\n adjustAspect(sf::Vector2u(newSize.width, newSize.height));\n}\n\nvoid Game::adjustAspect(sf::Vector2u newSize) {\n \/\/ compute the current aspect\n float currentRatio = (float) newSize.x \/ (float) newSize.y;\n \/\/ used to offset and scale the viewport to maintain 16:9 aspect\n float widthScale = 1.0f;\n float widthOffset = 0.0f;\n float heightScale = 1.0f;\n float heightOffset = 0.0f;\n \/\/ used to compare and compute aspect ratios\n \/\/ for logging\n std::string isSixteenNine = \"16:9\";\n if (currentRatio > 16.0f \/ 9.0f) {\n \/\/ we are wider\n isSixteenNine = \"wide\";\n widthScale = newSize.y * (16.0f \/ 9.0f) \/ newSize.x;\n widthOffset = (1.0f - widthScale) \/ 2.0f;\n } else if (currentRatio < 16.0f \/ 9.0f) {\n \/\/ we are narrower\n isSixteenNine = \"narrow\";\n heightScale = newSize.x * (9.0f \/ 16.0f) \/ newSize.y;\n heightOffset = (1.0f - heightScale) \/ 2.0f;\n }\n INFO(\"Adjusting aspect for window size \", newSize.x, newSize.y);\n INFO(\"Setting %s viewport (wo:%f, ho:%f; ws:%f, hs: %f\", isSixteenNine.c_str(),\n widthOffset, heightOffset, widthScale, heightScale);\n view.setViewport(sf::FloatRect(widthOffset, heightOffset, widthScale, heightScale));\n windowMutex.lock();\n window.setView(view);\n windowMutex.unlock();\n\n}\n\n\nvoid Game::processEvents() {\n static sf::Event event;\n\n while (window.pollEvent(event)) {\n switch (event.type) {\n case sf::Event::Closed:\n INFO(\"Window closed\");\n window.close();\n break;\n case sf::Event::Resized:\n adjustAspect(event.size);\n break;\n case sf::Event::KeyPressed:\n handleKeyPress(event);\n break;\n case sf::Event::KeyReleased:\n handleKeyRelease(event);\n break;\n default:\n break;\n }\n }\n}\n\nvoid Game::handleKeyPress(const sf::Event& event) {\n switch (event.key.code) {\n case sf::Keyboard::Escape:\n INFO(\"GamePlayer exited\");\n window.close();\n break;\n case sf::Keyboard::Return:\n if (event.key.alt) {\n createWindow(!config.fullscreen);\n }\n break;\n default:\n break;\n }\n}\n\nvoid Game::handleKeyRelease(const sf::Event& event) const {\n switch (event.key.code) {\n default:\n break;\n }\n}\n\nvoid Game::updateControls() {\n float x, y = 0;\n\n float joy0_X = sf::Joystick::getAxisPosition(0, sf::Joystick::X);\n float joy0_y = sf::Joystick::getAxisPosition(0, sf::Joystick::Y);\n x = fabs(joy0_X) < config.deadZone ? 0 : joy0_X;\n y = fabs(joy0_y) < config.deadZone ? 0 : joy0_y;\n\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Up)) {\n y += -config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Right)) {\n x += config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Down)) {\n y += config.keySpeed;\n }\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Left)) {\n x += -config.keySpeed;\n }\n spritesMutex.lock();\n player->moveBy(x, y);\n spritesMutex.unlock();\n\n}\n\nvoid Game::updateWorld(sf::Time elapsed) {\n spritesMutex.lock();\n const int millis = elapsed.asMilliseconds();\n for (auto sprite : sprites) {\n sprite->update(millis);\n }\n spritesMutex.unlock();\n}\n\n\nvoid Game::run(void) {\n window.setActive(false);\n sf::Thread renderThread(&Game::renderLoop, this);\n renderThread.launch();\n\n INFO(\"Initializing eventLoop\");\n sf::Clock gameClock;\n sf::Time elapsedTime;\n sf::Int32 lastUpdateTime;\n sf::Int32 totalUpdateTime = 0;\n sf::Int32 averageUpdateTime;\n sf::Int32 updateCount = 0;\n INFO(\"Starting eventLoop\");\n while (window.isOpen()) {\n elapsedTime = gameClock.restart();\n processEvents();\n updateControls();\n updateWorld(elapsedTime);\n lastUpdateTime = gameClock.getElapsedTime().asMilliseconds();\n totalUpdateTime += lastUpdateTime;\n averageUpdateTime = totalUpdateTime \/ ++updateCount;\n if (updateCount % 100 == 0) {\n DBUG(\"Average update time: %d ms\", averageUpdateTime);\n }\n sf::sleep(sf::milliseconds(16));\n }\n INFO(\"Stopped eventLoop\");\n}\n\nvoid Game::renderLoop(void) {\n INFO(\"Initializing renderLoop\");\n sf::Clock frameClock;\n sf::Int32 lastFrameTime;\n sf::Int32 averageFrameTime;\n sf::Int32 totalFrameTime = 0;\n sf::Int32 frameCount = 0;\n window.setActive(true);\n INFO(\"Starting renderLoop\");\n while (window.isOpen()) {\n frameClock.restart();\n \/\/ blank the render target to black\n screen.clear(sf::Color::Black);\n \/\/ render all the normal sprites\n spritesMutex.lock();\n for (const auto sprite : sprites) {\n screen.draw(*sprite);\n }\n spritesMutex.unlock();\n \/\/ update the target\n screen.display();\n windowMutex.lock();\n \/\/ blank the window to gray\n window.clear(sf::Color(128, 128, 128));\n \/\/ copy render target to window\n window.draw(sf::Sprite(screen.getTexture()));\n \/\/ update thw window\n window.display();\n windowMutex.unlock();\n lastFrameTime = frameClock.getElapsedTime().asMilliseconds();\n totalFrameTime += lastFrameTime;\n averageFrameTime = totalFrameTime \/ ++frameCount;\n if (frameCount % 100 == 0) {\n DBUG(\"Average frame time: %d ms\", averageFrameTime);\n }\n }\n INFO(\"Stopped renderLoop\");\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <cmath>\n#include <cstring>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\nusing std::setprecision;\nusing std::ofstream;\nusing std::ceil;\nusing std::pow;\n\n#include <ArgumentList.hpp>\n#include <InitializeOpenCL.hpp>\n#include <CLData.hpp>\n#include <Exceptions.hpp>\n#include <Read.hpp>\n#include <utils.hpp>\nusing isa::utils::ArgumentList;\nusing isa::OpenCL::initializeOpenCL;\nusing isa::OpenCL::CLData;\nusing isa::Exceptions::OpenCLError;\nusing isa::Benchmarks::Read;\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int minThreads = 0;\n\tunsigned int maxThreads = 0;\n\tunsigned int nrLoops = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 11 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -min <min_threads> -max <max_threads> -loops <nr_loops>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tminThreads = commandLine.getSwitchArgument< unsigned int >(\"-min\");\n\t\tmaxThreads = commandLine.getSwitchArgument< unsigned int >(\"-max\");\n\t\tnrLoops = commandLine.getSwitchArgument< unsigned int >(\"-loops\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\tarrayDim = (oclDevices->at(oclDevice)).getInfo< CL_DEVICE_MAX_MEM_ALLOC_SIZE >();\n\tarrayDim \/= sizeof(float);\n\n\tCLData< float > * B = new CLData< float >(\"B\", true);\n\tCLData< float > * C = new CLData< float >(\"C\", true);\n\n\tB->setCLContext(oclContext);\n\tB->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tB->allocateHostData(arrayDim);\n\tC->setCLContext(oclContext);\n\tC->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tC->allocateHostData(arrayDim);\n\ttry {\n\t\tB->setDeviceReadOnly();\n\t\tB->allocateDeviceData();\n\t\tC->setDeviceWriteOnly();\n\t\tC->allocateDeviceData();\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << fixed;\n\tfor (unsigned int threads0 = minThreads; threads0 <= maxThreads; threads0 *= 2 ) {\n\t\tfor (unsigned int threads1 = 1; threads1 <= 32; threads1++ ) {\n\t\t\tif ( (arrayDim % (threads0 * threads1) != 0) || ((threads0 * threads1) > maxThreads) ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tRead< float > read = Read< float >(\"float\");\n\t\t\ttry {\n\t\t\t\tread.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\t\t\tread.setNrThreads(arrayDim);\n\t\t\t\tread.setNrThreadsPerBlock(threads0);\n\t\t\t\tread.setNrRows(threads1);\n\t\t\t\tread.setNrIterations(nrLoops);\n\t\t\t\tread.generateCode();\n\n\t\t\t\tB->copyHostToDevice(true);\n\t\t\t\tread(B);\n\t\t\t\t(read.getTimer()).reset();\n\t\t\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\t\t\tread(B, C);\n\t\t\t\t}\n\t\t\t} catch ( OpenCLError &err ) {\n\t\t\t\tcerr << err.what() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tcout << threads0 << \" \" << threads1 << \" \" << setprecision(3) << read.getGBs() << \" \" << setprecision(6) << read.getTimer().getAverageTime() << endl;\n\t\t}\n\t}\n\tcout << endl;\n\n\treturn 0;\n}\n<commit_msg>Damn my forgetful mind.<commit_after>\/*\n * Copyright (C) 2013\n * Alessio Sclocco <a.sclocco@vu.nl>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\/\n\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <cmath>\n#include <cstring>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\nusing std::setprecision;\nusing std::ofstream;\nusing std::ceil;\nusing std::pow;\n\n#include <ArgumentList.hpp>\n#include <InitializeOpenCL.hpp>\n#include <CLData.hpp>\n#include <Exceptions.hpp>\n#include <Read.hpp>\n#include <utils.hpp>\nusing isa::utils::ArgumentList;\nusing isa::OpenCL::initializeOpenCL;\nusing isa::OpenCL::CLData;\nusing isa::Exceptions::OpenCLError;\nusing isa::Benchmarks::Read;\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int minThreads = 0;\n\tunsigned int maxThreads = 0;\n\tunsigned int nrLoops = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 11 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -min <min_threads> -max <max_threads> -loops <nr_loops>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tminThreads = commandLine.getSwitchArgument< unsigned int >(\"-min\");\n\t\tmaxThreads = commandLine.getSwitchArgument< unsigned int >(\"-max\");\n\t\tnrLoops = commandLine.getSwitchArgument< unsigned int >(\"-loops\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\tarrayDim = (oclDevices->at(oclDevice)).getInfo< CL_DEVICE_MAX_MEM_ALLOC_SIZE >();\n\tarrayDim \/= sizeof(float);\n\n\tCLData< float > * B = new CLData< float >(\"B\", true);\n\tCLData< float > * C = new CLData< float >(\"C\", true);\n\n\tB->setCLContext(oclContext);\n\tB->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tB->allocateHostData(arrayDim);\n\tC->setCLContext(oclContext);\n\tC->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tC->allocateHostData(arrayDim);\n\ttry {\n\t\tB->setDeviceReadOnly();\n\t\tB->allocateDeviceData();\n\t\tC->setDeviceWriteOnly();\n\t\tC->allocateDeviceData();\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << fixed;\n\tfor (unsigned int threads0 = minThreads; threads0 <= maxThreads; threads0 *= 2 ) {\n\t\tfor (unsigned int threads1 = 1; threads1 <= 32; threads1++ ) {\n\t\t\tif ( (arrayDim % (threads0 * threads1) != 0) || ((threads0 * threads1) > maxThreads) ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tRead< float > read = Read< float >(\"float\");\n\t\t\ttry {\n\t\t\t\tread.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\t\t\tread.setNrThreads(arrayDim);\n\t\t\t\tread.setNrThreadsPerBlock(threads0);\n\t\t\t\tread.setNrRows(threads1);\n\t\t\t\tread.setNrIterations(nrLoops);\n\t\t\t\tread.generateCode();\n\n\t\t\t\tB->copyHostToDevice(true);\n\t\t\t\tread(B, C);\n\t\t\t\t(read.getTimer()).reset();\n\t\t\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\t\t\tread(B, C);\n\t\t\t\t}\n\t\t\t} catch ( OpenCLError &err ) {\n\t\t\t\tcerr << err.what() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tcout << threads0 << \" \" << threads1 << \" \" << setprecision(3) << read.getGBs() << \" \" << setprecision(6) << read.getTimer().getAverageTime() << endl;\n\t\t}\n\t}\n\tcout << endl;\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include \"Graph.h\"\n#include \"Postgres.h\"\n\nusing namespace std;\n\n\/**\n * A simple in-memory stored Graph, with the word indexer and the edge\n * matrix.\n *\/\nclass InMemoryGraph : public Graph {\n private:\n char** index2gloss;\n edge** edges;\n uint32_t* edgesSizes;\n uint64_t size;\n \n public:\n InMemoryGraph(char** index2gloss, edge** edges, uint32_t* edgesSizes, uint64_t size)\n : index2gloss(index2gloss), edges(edges), edgesSizes(edgesSizes), size(size) { }\n\n ~InMemoryGraph() {\n for (int i = 0; i < size; ++i) { \n free(index2gloss[i]);\n free(edges[i]);\n }\n free(index2gloss);\n free(edges);\n free(edgesSizes);\n }\n\n virtual const edge* outgoingEdgesFast(word source, uint32_t* size) {\n *size = edgesSizes[source];\n return edges[source];\n }\n\n virtual const char* gloss(word word) {\n return index2gloss[word];\n }\n \n virtual const vector<word> keys() {\n vector<word> keys(size);\n for (int i = 0; i < size; ++i) {\n keys[i] = i;\n }\n return keys;\n }\n};\n\n\n\nGraph* ReadGraph() {\n printf(\"Reading graph...\\n\");\n const uint32_t numWords\n = atoi(PGIterator(\"SELECT COUNT(*) FROM word_indexer;\").next()[0]);\n\n \/\/ Read words\n char** index2gloss = (char**) malloc( numWords * sizeof(char*) );\n \/\/ (query)\n char wordQuery[127];\n snprintf(wordQuery, 127, \"SELECT * FROM %s;\", PG_TABLE_WORD.c_str());\n PGIterator words = PGIterator(wordQuery);\n uint64_t wordI = 0;\n while (words.hasNext()) {\n PGRow row = words.next();\n size_t len = strlen(row[1]);\n char* gloss = (char*) malloc( len * sizeof(char) );\n strncpy(gloss, row[1], len);\n index2gloss[atoi(row[0])] = gloss;\n wordI += 1;\n if (wordI % 1000000 == 0) {\n printf(\"loaded %luM words\\n\", wordI \/ 1000000);\n }\n }\n \n \/\/ Read edges\n struct edge** edges = (struct edge**) malloc((numWords+1) * sizeof(struct edge*));\n uint32_t* edgesSizes = (uint32_t*) malloc((numWords+1) * sizeof(uint32_t));\n uint32_t* edgeCapacities = (uint32_t*) malloc((numWords+1) * sizeof(uint32_t));\n for (uint32_t i = 0; i < numWords + 1; ++i) {\n edgesSizes[i] = 0;\n edges[i] = (struct edge*) malloc(4 * sizeof(struct edge));\n edgeCapacities[i] = 4;\n }\n \/\/ (query)\n char edgeQuery[127];\n snprintf(edgeQuery, 127, \"SELECT * FROM %s;\", PG_TABLE_EDGE.c_str());\n PGIterator edgeIter = PGIterator(edgeQuery);\n uint64_t edgeI = 0;\n while (edgeIter.hasNext()) {\n PGRow row = edgeIter.next();\n edge edge;\n edge.source = atol(row[0]);\n edge.sink = atoi(row[1]);\n edge.type = atoi(row[2]);\n edge.cost = atof(row[3]);\n if (edgesSizes[edge.source] >= edgeCapacities[edge.source] - 1) {\n struct edge* newEdges = (struct edge*) malloc(edgeCapacities[edge.source] * 2 * sizeof(struct edge));\n memcpy(newEdges, edges[edge.source], edgeCapacities[edge.source] * sizeof(struct edge));\n free(edges[edge.source]);\n edges[edge.source] = newEdges;\n }\n edges[edge.source][edgesSizes[edge.source]] = edge;\n edgesSizes[edge.source] += 1;\n edgeI += 1;\n if (edgeI % 1000000 == 0) {\n printf(\"loaded %luM edges\\n\", edgeI \/ 1000000);\n }\n }\n free(edgeCapacities);\n \n \n \/\/ Finish\n printf(\"%s\\n\", \"Done reading the graph.\");\n return new InMemoryGraph(index2gloss, edges, edgesSizes, numWords);\n}\n\n\nclass MockGraph : public Graph {\n public:\n MockGraph() {\n noEdges = new vector<edge>();\n \/\/ Edges out of Lemur\n lemurEdges = new vector<edge>();\n edge lemurToTimone;\n lemurToTimone.source = 2479928;\n lemurToTimone.sink = 16442985;\n lemurToTimone.type = 1;\n lemurToTimone.cost = 0.01;\n lemurEdges->push_back(lemurToTimone);\n edge lemurToAnimal;\n lemurToAnimal.source = 2479928;\n lemurToAnimal.sink = 3701;\n lemurToAnimal.type = 0;\n lemurToAnimal.cost = 0.42;\n lemurEdges->push_back(lemurToAnimal);\n \/\/ Edges out of Animal\n animalEdges = new vector<edge>();\n edge animalToCat;\n animalToCat.source = 3701;\n animalToCat.sink = 27970;\n animalToCat.type = 1;\n animalToCat.cost = 42.00;\n animalEdges->push_back(animalToCat);\n \/\/ Other edges\n timoneEdges = new vector<edge>();\n catEdges = new vector<edge>();\n haveEdges = new vector<edge>();\n tailEdges = new vector<edge>();\n }\n ~MockGraph() {\n delete noEdges, lemurEdges, animalEdges, timoneEdges,\n catEdges, haveEdges, tailEdges;\n }\n \n virtual const edge* outgoingEdgesFast(word source, uint32_t* outputLength) {\n vector<edge> edges = outgoingEdges(source);\n *outputLength = edges.size();\n edge* rtn = (struct edge*) malloc( edges.size() * sizeof(edge) ); \/\/ WARNING: memory leak\n for (int i = 0; i < edges.size(); ++i) { \n rtn[i] = edges[i];\n }\n return rtn;\n }\n\n virtual const vector<edge> outgoingEdges(word source) {\n switch (source) {\n case 2479928: \/\/ lemur\n return *lemurEdges;\n case 3701: \/\/ animal\n return *animalEdges;\n case 16442985: \/\/ timone\n return *timoneEdges;\n case 27970: \/\/ cat\n return *catEdges;\n case 3844: \/\/ have\n return *haveEdges;\n case 14221: \/\/ tail\n return *tailEdges;\n default:\n return *noEdges;\n }\n }\n\n virtual const char* gloss(word word) {\n switch (word) {\n case 2479928: \/\/ lemur\n return \"lemur\";\n case 3701: \/\/ animal\n return \"animal\";\n case 16442985: \/\/ timone\n return \"Timone\";\n case 27970: \/\/ cat\n return \"cat\";\n case 3844: \/\/ have\n return \"have\";\n case 14221: \/\/ tail\n return \"tail\";\n default:\n return \"<<unk>>\";\n }\n }\n \n virtual const vector<word> keys() {\n vector<word> keys(6);\n keys[0] = 2479928;\n keys[1] = 3701;\n keys[2] = 16442985;\n keys[3] = 27970;\n keys[4] = 3844;\n keys[5] = 14221;\n return keys;\n }\n\n private:\n vector<edge>* noEdges;\n vector<edge>* lemurEdges;\n vector<edge>* animalEdges;\n vector<edge>* timoneEdges;\n vector<edge>* catEdges;\n vector<edge>* haveEdges;\n vector<edge>* tailEdges;\n};\n\nGraph* ReadMockGraph() {\n return new MockGraph();\n}\n<commit_msg>Oops; update capacities as well<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n\n#include \"Graph.h\"\n#include \"Postgres.h\"\n\nusing namespace std;\n\n\/**\n * A simple in-memory stored Graph, with the word indexer and the edge\n * matrix.\n *\/\nclass InMemoryGraph : public Graph {\n private:\n char** index2gloss;\n edge** edges;\n uint32_t* edgesSizes;\n uint64_t size;\n \n public:\n InMemoryGraph(char** index2gloss, edge** edges, uint32_t* edgesSizes, uint64_t size)\n : index2gloss(index2gloss), edges(edges), edgesSizes(edgesSizes), size(size) { }\n\n ~InMemoryGraph() {\n for (int i = 0; i < size; ++i) { \n free(index2gloss[i]);\n free(edges[i]);\n }\n free(index2gloss);\n free(edges);\n free(edgesSizes);\n }\n\n virtual const edge* outgoingEdgesFast(word source, uint32_t* size) {\n *size = edgesSizes[source];\n return edges[source];\n }\n\n virtual const char* gloss(word word) {\n return index2gloss[word];\n }\n \n virtual const vector<word> keys() {\n vector<word> keys(size);\n for (int i = 0; i < size; ++i) {\n keys[i] = i;\n }\n return keys;\n }\n};\n\n\n\nGraph* ReadGraph() {\n printf(\"Reading graph...\\n\");\n const uint32_t numWords\n = atoi(PGIterator(\"SELECT COUNT(*) FROM word_indexer;\").next()[0]);\n\n \/\/ Read words\n char** index2gloss = (char**) malloc( numWords * sizeof(char*) );\n \/\/ (query)\n char wordQuery[127];\n snprintf(wordQuery, 127, \"SELECT * FROM %s;\", PG_TABLE_WORD.c_str());\n PGIterator words = PGIterator(wordQuery);\n uint64_t wordI = 0;\n while (words.hasNext()) {\n PGRow row = words.next();\n size_t len = strlen(row[1]);\n char* gloss = (char*) malloc( len * sizeof(char) );\n strncpy(gloss, row[1], len);\n index2gloss[atoi(row[0])] = gloss;\n wordI += 1;\n if (wordI % 1000000 == 0) {\n printf(\"loaded %luM words\\n\", wordI \/ 1000000);\n }\n }\n \n \/\/ Read edges\n struct edge** edges = (struct edge**) malloc((numWords+1) * sizeof(struct edge*));\n uint32_t* edgesSizes = (uint32_t*) malloc((numWords+1) * sizeof(uint32_t));\n uint32_t* edgeCapacities = (uint32_t*) malloc((numWords+1) * sizeof(uint32_t));\n for (uint32_t i = 0; i < numWords + 1; ++i) {\n edgesSizes[i] = 0;\n edges[i] = (struct edge*) malloc(4 * sizeof(struct edge));\n edgeCapacities[i] = 4;\n }\n \/\/ (query)\n char edgeQuery[127];\n snprintf(edgeQuery, 127, \"SELECT * FROM %s;\", PG_TABLE_EDGE.c_str());\n PGIterator edgeIter = PGIterator(edgeQuery);\n uint64_t edgeI = 0;\n while (edgeIter.hasNext()) {\n PGRow row = edgeIter.next();\n edge e;\n e.source = atol(row[0]);\n e.sink = atoi(row[1]);\n e.type = atoi(row[2]);\n e.cost = atof(row[3]);\n if (edgesSizes[e.source] >= edgeCapacities[e.source] - 1) {\n struct edge* newEdges = (struct edge*) malloc(edgeCapacities[e.source] * 2 * sizeof(struct edge));\n memcpy(newEdges, edges[e.source], edgeCapacities[e.source] * sizeof(struct edge));\n edgeCapacities[e.source] = 2 * edgeCapacities[e.source];\n free(edges[e.source]);\n edges[e.source] = newEdges;\n }\n edges[e.source][edgesSizes[e.source]] = e;\n edgesSizes[e.source] += 1;\n edgeI += 1;\n if (edgeI % 1000000 == 0) {\n printf(\"loaded %luM edges\\n\", edgeI \/ 1000000);\n }\n }\n free(edgeCapacities);\n \n \n \/\/ Finish\n printf(\"%s\\n\", \"Done reading the graph.\");\n return new InMemoryGraph(index2gloss, edges, edgesSizes, numWords);\n}\n\n\nclass MockGraph : public Graph {\n public:\n MockGraph() {\n noEdges = new vector<edge>();\n \/\/ Edges out of Lemur\n lemurEdges = new vector<edge>();\n edge lemurToTimone;\n lemurToTimone.source = 2479928;\n lemurToTimone.sink = 16442985;\n lemurToTimone.type = 1;\n lemurToTimone.cost = 0.01;\n lemurEdges->push_back(lemurToTimone);\n edge lemurToAnimal;\n lemurToAnimal.source = 2479928;\n lemurToAnimal.sink = 3701;\n lemurToAnimal.type = 0;\n lemurToAnimal.cost = 0.42;\n lemurEdges->push_back(lemurToAnimal);\n \/\/ Edges out of Animal\n animalEdges = new vector<edge>();\n edge animalToCat;\n animalToCat.source = 3701;\n animalToCat.sink = 27970;\n animalToCat.type = 1;\n animalToCat.cost = 42.00;\n animalEdges->push_back(animalToCat);\n \/\/ Other edges\n timoneEdges = new vector<edge>();\n catEdges = new vector<edge>();\n haveEdges = new vector<edge>();\n tailEdges = new vector<edge>();\n }\n ~MockGraph() {\n delete noEdges, lemurEdges, animalEdges, timoneEdges,\n catEdges, haveEdges, tailEdges;\n }\n \n virtual const edge* outgoingEdgesFast(word source, uint32_t* outputLength) {\n vector<edge> edges = outgoingEdges(source);\n *outputLength = edges.size();\n edge* rtn = (struct edge*) malloc( edges.size() * sizeof(edge) ); \/\/ WARNING: memory leak\n for (int i = 0; i < edges.size(); ++i) { \n rtn[i] = edges[i];\n }\n return rtn;\n }\n\n virtual const vector<edge> outgoingEdges(word source) {\n switch (source) {\n case 2479928: \/\/ lemur\n return *lemurEdges;\n case 3701: \/\/ animal\n return *animalEdges;\n case 16442985: \/\/ timone\n return *timoneEdges;\n case 27970: \/\/ cat\n return *catEdges;\n case 3844: \/\/ have\n return *haveEdges;\n case 14221: \/\/ tail\n return *tailEdges;\n default:\n return *noEdges;\n }\n }\n\n virtual const char* gloss(word word) {\n switch (word) {\n case 2479928: \/\/ lemur\n return \"lemur\";\n case 3701: \/\/ animal\n return \"animal\";\n case 16442985: \/\/ timone\n return \"Timone\";\n case 27970: \/\/ cat\n return \"cat\";\n case 3844: \/\/ have\n return \"have\";\n case 14221: \/\/ tail\n return \"tail\";\n default:\n return \"<<unk>>\";\n }\n }\n \n virtual const vector<word> keys() {\n vector<word> keys(6);\n keys[0] = 2479928;\n keys[1] = 3701;\n keys[2] = 16442985;\n keys[3] = 27970;\n keys[4] = 3844;\n keys[5] = 14221;\n return keys;\n }\n\n private:\n vector<edge>* noEdges;\n vector<edge>* lemurEdges;\n vector<edge>* animalEdges;\n vector<edge>* timoneEdges;\n vector<edge>* catEdges;\n vector<edge>* haveEdges;\n vector<edge>* tailEdges;\n};\n\nGraph* ReadMockGraph() {\n return new MockGraph();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012-2013 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"rpcserver.h\"\n#include \"rpcclient.h\"\n\n#include \"base58.h\"\n#include \"netbase.h\"\n\n#include \"test\/test_bitcoin.h\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include \"univalue\/univalue.h\"\n\nusing namespace std;\n\nUniValue\ncreateArgs(int nRequired, const char* address1=NULL, const char* address2=NULL)\n{\n UniValue result(UniValue::VARR);\n result.push_back(nRequired);\n UniValue addresses(UniValue::VARR);\n if (address1) addresses.push_back(address1);\n if (address2) addresses.push_back(address2);\n result.push_back(addresses);\n return result;\n}\n\nUniValue CallRPC(string args)\n{\n vector<string> vArgs;\n boost::split(vArgs, args, boost::is_any_of(\" \\t\"));\n string strMethod = vArgs[0];\n vArgs.erase(vArgs.begin());\n UniValue params = RPCConvertValues(strMethod, vArgs);\n\n rpcfn_type method = tableRPC[strMethod]->actor;\n try {\n UniValue result = (*method)(params, false);\n return result;\n }\n catch (const UniValue& objError) {\n throw runtime_error(find_value(objError, \"message\").get_str());\n }\n}\n\n\nBOOST_FIXTURE_TEST_SUITE(rpc_tests, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(rpc_rawparams)\n{\n \/\/ Test raw transaction API argument handling\n UniValue r;\n\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction not_hex\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed not_int\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction null null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction not_array\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] []\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction {} {}\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [] {}\"));\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] {} extra\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction DEADBEEF\"), runtime_error);\n string rawtx = \"0100000001a15d57094aa7a21a28cb20b59aab8fc7d1149a3bdbcddba9c622e4f5f6a99ece010000006c493046022100f93bb0e7d8db7bd46e40132d1f8242026e045f03a0efe71bbb8e3f475e970d790221009337cd7f1f929f00cc6ff01f03729b069a7c21b59b1736ddfee5db5946c5da8c0121033b9b137ee87d5a812d6f506efdd37f0affa7ffc310711c06c7f3e097c9447c52ffffffff0100e1f505000000001976a9140389035a9225b3839e2bbf32d826a1e222031fd888ac00000000\";\n BOOST_CHECK_NO_THROW(r = CallRPC(string(\"decoderawtransaction \")+rawtx));\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"version\").get_int(), 1);\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"locktime\").get_int(), 0);\n BOOST_CHECK_THROW(r = CallRPC(string(\"decoderawtransaction \")+rawtx+\" extra\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction ff00\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx));\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" null null NONE|ANYONECANPAY\"));\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" [] [] NONE|ANYONECANPAY\"));\n BOOST_CHECK_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" null null badenum\"), runtime_error);\n\n \/\/ Only check failure cases for sendrawtransaction, there's no network to send to...\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction DEADBEEF\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(string(\"sendrawtransaction \")+rawtx+\" extra\"), runtime_error);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_rawsign)\n{\n UniValue r;\n \/\/ input is a 1-of-2 multisig (so is output):\n string prevout =\n \"[{\\\"txid\\\":\\\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\\\",\"\n \"\\\"vout\\\":1,\\\"scriptPubKey\\\":\\\"a914b10c9df5f7edf436c697f02f1efdba4cf399615187\\\",\"\n \"\\\"redeemScript\\\":\\\"512103debedc17b3df2badbcdd86d5feb4562b86fe182e5998abd8bcd4f122c6155b1b21027e940bb73ab8732bfdf7f9216ecefca5b94d6df834e77e108f68e66f126044c052ae\\\"}]\";\n r = CallRPC(string(\"createrawtransaction \")+prevout+\" \"+\n \"{\\\"3HqAe9LtNBjnsfM4CyYaWTnvCaUYT7v4oZ\\\":11}\");\n string notsigned = r.get_str();\n string privkey1 = \"\\\"KzsXybp9jX64P5ekX1KUxRQ79Jht9uzW7LorgwE65i5rWACL6LQe\\\"\";\n string privkey2 = \"\\\"Kyhdf5LuKTRx4ge69ybABsiUAWjVRK4XGxAKk2FQLp2HjGMy87Z4\\\"\";\n r = CallRPC(string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == false);\n r = CallRPC(string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[\"+privkey1+\",\"+privkey2+\"]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == true);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_format_monetary_values)\n{\n BOOST_CHECK(ValueFromAmount(0LL).write() == \"0.00000000\");\n BOOST_CHECK(ValueFromAmount(1LL).write() == \"0.00000001\");\n BOOST_CHECK(ValueFromAmount(17622195LL).write() == \"0.17622195\");\n BOOST_CHECK(ValueFromAmount(50000000LL).write() == \"0.50000000\");\n BOOST_CHECK(ValueFromAmount(89898989LL).write() == \"0.89898989\");\n BOOST_CHECK(ValueFromAmount(100000000LL).write() == \"1.00000000\");\n BOOST_CHECK(ValueFromAmount(2099999999999990LL).write() == \"20999999.99999990\");\n BOOST_CHECK(ValueFromAmount(2099999999999999LL).write() == \"20999999.99999999\");\n}\n\nstatic UniValue ValueFromString(const std::string &str)\n{\n UniValue value;\n BOOST_CHECK(value.setNumStr(str));\n return value;\n}\n\nBOOST_AUTO_TEST_CASE(rpc_parse_monetary_values)\n{\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.00000001\")), 1LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.17622195\")), 17622195LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.5\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.50000000\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.89898989\")), 89898989LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"1.00000000\")), 100000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.9999999\")), 2099999999999990LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.99999999\")), 2099999999999999LL);\n}\n\nBOOST_AUTO_TEST_CASE(json_parse_errors)\n{\n Value value;\n \/\/ Valid\n BOOST_CHECK_EQUAL(read_string(std::string(\"1.0\"), value), true);\n \/\/ Valid, with trailing whitespace\n BOOST_CHECK_EQUAL(read_string(std::string(\"1.0 \"), value), true);\n \/\/ Invalid, initial garbage\n BOOST_CHECK_EQUAL(read_string(std::string(\"[1.0\"), value), false);\n BOOST_CHECK_EQUAL(read_string(std::string(\"a1.0\"), value), false);\n \/\/ Invalid, trailing garbage\n BOOST_CHECK_EQUAL(read_string(std::string(\"1.0sds\"), value), false);\n BOOST_CHECK_EQUAL(read_string(std::string(\"1.0]\"), value), false);\n \/\/ BTC addresses should fail parsing\n BOOST_CHECK_EQUAL(read_string(std::string(\"175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W\"), value), false);\n BOOST_CHECK_EQUAL(read_string(std::string(\"3J98t1WpEZ73CNmQviecrnyiWrnqRhWNL\"), value), false);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_boostasiotocnetaddr)\n{\n \/\/ Check IPv4 addresses\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"1.2.3.4\")).ToString(), \"1.2.3.4\");\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"127.0.0.1\")).ToString(), \"127.0.0.1\");\n \/\/ Check IPv6 addresses\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::1\")).ToString(), \"::1\");\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"123:4567:89ab:cdef:123:4567:89ab:cdef\")).ToString(),\n \"123:4567:89ab:cdef:123:4567:89ab:cdef\");\n \/\/ v4 compatible must be interpreted as IPv4\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::0:127.0.0.1\")).ToString(), \"127.0.0.1\");\n \/\/ v4 mapped must be interpreted as IPv4\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::ffff:127.0.0.1\")).ToString(), \"127.0.0.1\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>fix univalue json parse tests<commit_after>\/\/ Copyright (c) 2012-2013 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"rpcserver.h\"\n#include \"rpcclient.h\"\n\n#include \"base58.h\"\n#include \"netbase.h\"\n\n#include \"test\/test_bitcoin.h\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/test\/unit_test.hpp>\n\n#include \"univalue\/univalue.h\"\n\nusing namespace std;\n\nUniValue\ncreateArgs(int nRequired, const char* address1=NULL, const char* address2=NULL)\n{\n UniValue result(UniValue::VARR);\n result.push_back(nRequired);\n UniValue addresses(UniValue::VARR);\n if (address1) addresses.push_back(address1);\n if (address2) addresses.push_back(address2);\n result.push_back(addresses);\n return result;\n}\n\nUniValue CallRPC(string args)\n{\n vector<string> vArgs;\n boost::split(vArgs, args, boost::is_any_of(\" \\t\"));\n string strMethod = vArgs[0];\n vArgs.erase(vArgs.begin());\n UniValue params = RPCConvertValues(strMethod, vArgs);\n\n rpcfn_type method = tableRPC[strMethod]->actor;\n try {\n UniValue result = (*method)(params, false);\n return result;\n }\n catch (const UniValue& objError) {\n throw runtime_error(find_value(objError, \"message\").get_str());\n }\n}\n\n\nBOOST_FIXTURE_TEST_SUITE(rpc_tests, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(rpc_rawparams)\n{\n \/\/ Test raw transaction API argument handling\n UniValue r;\n\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction not_hex\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed not_int\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction null null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction not_array\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] []\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction {} {}\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [] {}\"));\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] {} extra\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction DEADBEEF\"), runtime_error);\n string rawtx = \"0100000001a15d57094aa7a21a28cb20b59aab8fc7d1149a3bdbcddba9c622e4f5f6a99ece010000006c493046022100f93bb0e7d8db7bd46e40132d1f8242026e045f03a0efe71bbb8e3f475e970d790221009337cd7f1f929f00cc6ff01f03729b069a7c21b59b1736ddfee5db5946c5da8c0121033b9b137ee87d5a812d6f506efdd37f0affa7ffc310711c06c7f3e097c9447c52ffffffff0100e1f505000000001976a9140389035a9225b3839e2bbf32d826a1e222031fd888ac00000000\";\n BOOST_CHECK_NO_THROW(r = CallRPC(string(\"decoderawtransaction \")+rawtx));\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"version\").get_int(), 1);\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"locktime\").get_int(), 0);\n BOOST_CHECK_THROW(r = CallRPC(string(\"decoderawtransaction \")+rawtx+\" extra\"), runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction ff00\"), runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx));\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" null null NONE|ANYONECANPAY\"));\n BOOST_CHECK_NO_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" [] [] NONE|ANYONECANPAY\"));\n BOOST_CHECK_THROW(CallRPC(string(\"signrawtransaction \")+rawtx+\" null null badenum\"), runtime_error);\n\n \/\/ Only check failure cases for sendrawtransaction, there's no network to send to...\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction null\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction DEADBEEF\"), runtime_error);\n BOOST_CHECK_THROW(CallRPC(string(\"sendrawtransaction \")+rawtx+\" extra\"), runtime_error);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_rawsign)\n{\n UniValue r;\n \/\/ input is a 1-of-2 multisig (so is output):\n string prevout =\n \"[{\\\"txid\\\":\\\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\\\",\"\n \"\\\"vout\\\":1,\\\"scriptPubKey\\\":\\\"a914b10c9df5f7edf436c697f02f1efdba4cf399615187\\\",\"\n \"\\\"redeemScript\\\":\\\"512103debedc17b3df2badbcdd86d5feb4562b86fe182e5998abd8bcd4f122c6155b1b21027e940bb73ab8732bfdf7f9216ecefca5b94d6df834e77e108f68e66f126044c052ae\\\"}]\";\n r = CallRPC(string(\"createrawtransaction \")+prevout+\" \"+\n \"{\\\"3HqAe9LtNBjnsfM4CyYaWTnvCaUYT7v4oZ\\\":11}\");\n string notsigned = r.get_str();\n string privkey1 = \"\\\"KzsXybp9jX64P5ekX1KUxRQ79Jht9uzW7LorgwE65i5rWACL6LQe\\\"\";\n string privkey2 = \"\\\"Kyhdf5LuKTRx4ge69ybABsiUAWjVRK4XGxAKk2FQLp2HjGMy87Z4\\\"\";\n r = CallRPC(string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == false);\n r = CallRPC(string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[\"+privkey1+\",\"+privkey2+\"]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == true);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_format_monetary_values)\n{\n BOOST_CHECK(ValueFromAmount(0LL).write() == \"0.00000000\");\n BOOST_CHECK(ValueFromAmount(1LL).write() == \"0.00000001\");\n BOOST_CHECK(ValueFromAmount(17622195LL).write() == \"0.17622195\");\n BOOST_CHECK(ValueFromAmount(50000000LL).write() == \"0.50000000\");\n BOOST_CHECK(ValueFromAmount(89898989LL).write() == \"0.89898989\");\n BOOST_CHECK(ValueFromAmount(100000000LL).write() == \"1.00000000\");\n BOOST_CHECK(ValueFromAmount(2099999999999990LL).write() == \"20999999.99999990\");\n BOOST_CHECK(ValueFromAmount(2099999999999999LL).write() == \"20999999.99999999\");\n}\n\nstatic UniValue ValueFromString(const std::string &str)\n{\n UniValue value;\n BOOST_CHECK(value.setNumStr(str));\n return value;\n}\n\nBOOST_AUTO_TEST_CASE(rpc_parse_monetary_values)\n{\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.00000001\")), 1LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.17622195\")), 17622195LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.5\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.50000000\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.89898989\")), 89898989LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"1.00000000\")), 100000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.9999999\")), 2099999999999990LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.99999999\")), 2099999999999999LL);\n}\n\nBOOST_AUTO_TEST_CASE(json_parse_errors)\n{\n UniValue value;\n \/\/ Valid\n BOOST_CHECK_EQUAL(value.read(std::string(\"1.0\")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"[1.0]\")), true);\n \/\/ Valid, with trailing whitespace\n BOOST_CHECK_EQUAL(value.read(std::string(\"1.0 \")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"[1.0 ] \")), true);\n \/\/ Invalid, initial garbage\n BOOST_CHECK_EQUAL(value.read(std::string(\"[1.0\")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"[a1.0]\")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"[\\\"a1.0\\\"]\")), true);\n \/\/ Invalid, trailing garbage\n BOOST_CHECK_EQUAL(value.read(std::string(\"1.0sds\")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"1.0]\")), false);\n \/\/ BTC addresses should fail parsing\n BOOST_CHECK_EQUAL(value.read(std::string(\"175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W\")), false);\n BOOST_CHECK_EQUAL(value.read(std::string(\"3J98t1WpEZ73CNmQviecrnyiWrnqRhWNL\")), false);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_boostasiotocnetaddr)\n{\n \/\/ Check IPv4 addresses\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"1.2.3.4\")).ToString(), \"1.2.3.4\");\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"127.0.0.1\")).ToString(), \"127.0.0.1\");\n \/\/ Check IPv6 addresses\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::1\")).ToString(), \"::1\");\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"123:4567:89ab:cdef:123:4567:89ab:cdef\")).ToString(),\n \"123:4567:89ab:cdef:123:4567:89ab:cdef\");\n \/\/ v4 compatible must be interpreted as IPv4\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::0:127.0.0.1\")).ToString(), \"127.0.0.1\");\n \/\/ v4 mapped must be interpreted as IPv4\n BOOST_CHECK_EQUAL(BoostAsioToCNetAddr(boost::asio::ip::address::from_string(\"::ffff:127.0.0.1\")).ToString(), \"127.0.0.1\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include \"HLSLParser.h\"\n#include \"GLSLGenerator.h\"\n#include \"HLSLGenerator.h\"\n\n#include <fstream>\n#include <sstream>\n#include <iostream>\n\nenum Target\n{\n Target_VertexShader,\n Target_FragmentShader,\n};\n\nenum Language\n{\n\tLanguage_GLSL,\n\tLanguage_HLSL,\n\tLanguage_LegacyHLSL,\n};\n\nstd::string ReadFile( const char* fileName )\n{\n\tstd::ifstream ifs( fileName );\n\tstd::stringstream buffer;\n\tbuffer << ifs.rdbuf();\n\treturn buffer.str();\n}\n\nvoid PrintUsage()\n{\n\tstd::cerr << \"usage: hlslparser [-h] [-fs | -vs] FILENAME ENTRYNAME\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"Translate HLSL shader to GLSL shader.\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"positional arguments:\\n\"\n\t\t<< \" FILENAME input file name\\n\"\n\t\t<< \" ENTRYNAME entry point of the shader\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"optional arguments:\\n\"\n\t\t<< \" -h, --help show this help message and exit\\n\"\n\t\t<< \" -fs generate fragment shader (default)\\n\"\n\t\t<< \" -vs generate vertex shader\\n\"\n\t\t<< \" -glsl generate GLSL (default)\\n\"\n\t\t<< \" -hlsl generate HLSL\\n\"\n\t\t<< \" -legacyhlsl generate legacy HLSL\\n\";\n}\n\nint main( int argc, char* argv[] )\n{\n\tusing namespace M4;\n\n\t\/\/ Parse arguments\n\tconst char* fileName = NULL;\n\tconst char* entryName = NULL;\n\n\tTarget target = Target_FragmentShader;\n\tLanguage language = Language_GLSL;\n\n\tfor( int argn = 1; argn < argc; ++argn )\n\t{\n\t\tconst char* const arg = argv[ argn ];\n\n\t\tif( String_Equal( arg, \"-h\" ) || String_Equal( arg, \"--help\" ) )\n\t\t{\n\t\t\tPrintUsage();\n\t\t\treturn 0;\n\t\t}\n\t\telse if( String_Equal( arg, \"-fs\" ) )\n\t\t{\n\t\t\ttarget = Target_FragmentShader;\n\t\t}\n\t\telse if( String_Equal( arg, \"-vs\" ) )\n\t\t{\n\t\t\ttarget = Target_VertexShader;\n\t\t}\n\t\telse if( String_Equal( arg, \"-glsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_GLSL;\n\t\t}\n\t\telse if( String_Equal( arg, \"-hlsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_HLSL;\n\t\t}\n\t\telse if( String_Equal( arg, \"-legacyhlsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_LegacyHLSL;\n\t\t}\n\t\telse if( fileName == NULL )\n\t\t{\n\t\t\tfileName = arg;\n\t\t}\n\t\telse if( entryName == NULL )\n\t\t{\n\t\t\tentryName = arg;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLog_Error( \"Too many arguments\\n\" );\n\t\t\tPrintUsage();\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif( fileName == NULL || entryName == NULL )\n\t{\n\t\tLog_Error( \"Missing arguments\\n\" );\n\t\tPrintUsage();\n\t\treturn 1;\n\t}\n\n\t\/\/ Read input file\n\tconst std::string source = ReadFile( fileName );\n\n\t\/\/ Parse input file\n\tAllocator allocator;\n\tHLSLParser parser( &allocator, fileName, source.data(), source.size() );\n\tHLSLTree tree( &allocator );\n\tif( !parser.Parse( &tree ) )\n\t{\n\t\tLog_Error( \"Parsing failed, aborting\\n\" );\n\t\treturn 1;\n\t}\n\n\t\/\/ Generate output\n\tif (language == Language_GLSL)\n\t{\n\t\tGLSLGenerator generator( &allocator );\n\t\tif (!generator.Generate( &tree, GLSLGenerator::Target(target), GLSLGenerator::Version_140, entryName ))\n\t\t{\n\t\t\tLog_Error( \"Translation failed, aborting\\n\" );\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << generator.GetResult();\n\t}\n\telse\n\t{\n\t\tHLSLGenerator generator( &allocator );\n\t\tif (!generator.Generate( &tree, HLSLGenerator::Target(target), entryName, language == Language_LegacyHLSL ))\n\t\t{\n\t\t\tLog_Error( \"Translation failed, aborting\\n\" );\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << generator.GetResult();\n\t}\n\n\treturn 0;\n}\n<commit_msg>Add Metal support to the command-line compiler<commit_after>#include \"HLSLParser.h\"\n\n#include \"GLSLGenerator.h\"\n#include \"HLSLGenerator.h\"\n#include \"MSLGenerator.h\"\n\n#include <fstream>\n#include <sstream>\n#include <iostream>\n\nenum Target\n{\n Target_VertexShader,\n Target_FragmentShader,\n};\n\nenum Language\n{\n\tLanguage_GLSL,\n\tLanguage_HLSL,\n\tLanguage_LegacyHLSL,\n\tLanguage_Metal,\n};\n\nstd::string ReadFile( const char* fileName )\n{\n\tstd::ifstream ifs( fileName );\n\tstd::stringstream buffer;\n\tbuffer << ifs.rdbuf();\n\treturn buffer.str();\n}\n\nvoid PrintUsage()\n{\n\tstd::cerr << \"usage: hlslparser [-h] [-fs | -vs] FILENAME ENTRYNAME\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"Translate HLSL shader to GLSL shader.\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"positional arguments:\\n\"\n\t\t<< \" FILENAME input file name\\n\"\n\t\t<< \" ENTRYNAME entry point of the shader\\n\"\n\t\t<< \"\\n\"\n\t\t<< \"optional arguments:\\n\"\n\t\t<< \" -h, --help show this help message and exit\\n\"\n\t\t<< \" -fs generate fragment shader (default)\\n\"\n\t\t<< \" -vs generate vertex shader\\n\"\n\t\t<< \" -glsl generate GLSL (default)\\n\"\n\t\t<< \" -hlsl generate HLSL\\n\"\n\t\t<< \" -legacyhlsl generate legacy HLSL\\n\"\n\t\t<< \" -metal generate MSL\\n\";\n}\n\nint main( int argc, char* argv[] )\n{\n\tusing namespace M4;\n\n\t\/\/ Parse arguments\n\tconst char* fileName = NULL;\n\tconst char* entryName = NULL;\n\n\tTarget target = Target_FragmentShader;\n\tLanguage language = Language_GLSL;\n\n\tfor( int argn = 1; argn < argc; ++argn )\n\t{\n\t\tconst char* const arg = argv[ argn ];\n\n\t\tif( String_Equal( arg, \"-h\" ) || String_Equal( arg, \"--help\" ) )\n\t\t{\n\t\t\tPrintUsage();\n\t\t\treturn 0;\n\t\t}\n\t\telse if( String_Equal( arg, \"-fs\" ) )\n\t\t{\n\t\t\ttarget = Target_FragmentShader;\n\t\t}\n\t\telse if( String_Equal( arg, \"-vs\" ) )\n\t\t{\n\t\t\ttarget = Target_VertexShader;\n\t\t}\n\t\telse if( String_Equal( arg, \"-glsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_GLSL;\n\t\t}\n\t\telse if( String_Equal( arg, \"-hlsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_HLSL;\n\t\t}\n\t\telse if( String_Equal( arg, \"-legacyhlsl\" ) )\n\t\t{\n\t\t\tlanguage = Language_LegacyHLSL;\n\t\t}\n\t\telse if( String_Equal( arg, \"-metal\" ) )\n\t\t{\n\t\t\tlanguage = Language_Metal;\n\t\t}\n\t\telse if( fileName == NULL )\n\t\t{\n\t\t\tfileName = arg;\n\t\t}\n\t\telse if( entryName == NULL )\n\t\t{\n\t\t\tentryName = arg;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tLog_Error( \"Too many arguments\\n\" );\n\t\t\tPrintUsage();\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif( fileName == NULL || entryName == NULL )\n\t{\n\t\tLog_Error( \"Missing arguments\\n\" );\n\t\tPrintUsage();\n\t\treturn 1;\n\t}\n\n\t\/\/ Read input file\n\tconst std::string source = ReadFile( fileName );\n\n\t\/\/ Parse input file\n\tAllocator allocator;\n\tHLSLParser parser( &allocator, fileName, source.data(), source.size() );\n\tHLSLTree tree( &allocator );\n\tif( !parser.Parse( &tree ) )\n\t{\n\t\tLog_Error( \"Parsing failed, aborting\\n\" );\n\t\treturn 1;\n\t}\n\n\t\/\/ Generate output\n\tif (language == Language_GLSL)\n\t{\n\t\tGLSLGenerator generator( &allocator );\n\t\tif (!generator.Generate( &tree, GLSLGenerator::Target(target), GLSLGenerator::Version_140, entryName ))\n\t\t{\n\t\t\tLog_Error( \"Translation failed, aborting\\n\" );\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << generator.GetResult();\n\t}\n\telse if (language == Language_HLSL)\n\t{\n\t\tHLSLGenerator generator( &allocator );\n\t\tif (!generator.Generate( &tree, HLSLGenerator::Target(target), entryName, language == Language_LegacyHLSL ))\n\t\t{\n\t\t\tLog_Error( \"Translation failed, aborting\\n\" );\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << generator.GetResult();\n\t}\n\telse if (language == Language_Metal)\n\t{\n\t\tMSLGenerator generator;\n\t\tif (!generator.Generate( &tree, MSLGenerator::Target(target), entryName ))\n\t\t{\n\t\t\tLog_Error( \"Translation failed, aborting\\n\" );\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << generator.GetResult();\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/include\/Main.h\"\n\n\/\/using Poco::StringTokenizer;\n\nint main(int argc, char** argv) {\n if (argc == 4) {\n Transaction* session = new Transaction(argv[1], argv[2], argv[3]);\n\n string input, username, type, event, seller;\n double balance, price;\n int ticketNum;\n bool success = false;\n\n while (getline(cin, input)) {\n \/\/cout << \"Enter your command.\" << endl;\n input = rtrim(input);\n \/\/ TODO Trim right side of the input\n if (!session->isLoggedIn()) {\n if (input.compare(\"login\") == 0) {\n \/\/ Log in stuff.\n cout << \"enter username\" << endl;\n getline(cin, input);\n\n if (session->login(input)) {\n cout << \"login successful\" << endl;\n }\n }\n else if (input.compare(\"quit\") == 0) {\n \tsession->quit();\n break;\n }\n else {\n cout << \"error: invalid command\" << endl;\n }\n }\n else {\n if (input.compare(\"logout\") == 0) {\n session->logout();\n cout << \"logout successful\" << endl;\n }\n else if (input.compare(\"create\") == 0) {\n cout << \"enter username to create\" << endl;\n getline(cin, username);\n\n \/\/ TODO: Catch create1 testcase\n \/\/ username must be maximum 15 characters\n\n cout << \"enter account type\" << endl;\n getline(cin, type);\n\n cout << \"enter user account balance\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n if (session->create(username, type, balance)) {\n cout << \"create successful\" << endl;\n }\n }\n else if (input.compare(\"delete\") == 0) {\n cout << \"enter username\" << endl;\n getline(cin, username);\n\n if (session->removeUser(username)) {\n cout << \"delete successful\" << endl;\n }\n }\n else if (input.compare(\"addcredit\") == 0) {\n if (session->isAdmin()) {\n cout << \"enter username\" << endl;\n getline(cin, username);\n }\n\n cout << \"enter credit amount\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n success = false;\n\n success = validBalance(balance);\n\n if (session->isAdmin()) {\n success = session->addcredit(balance);\n }\n else {\n success = session->addcredit(username, balance);\n }\n\n if (success) {\n cout << \"credit added\" << endl;\n }\n }\n else if (input.compare(\"sell\") == 0) {\n cout << \"enter event title\" << endl;\n getline(cin, event);\n\n cout << \"enter sale price\" << endl;\n \/\/getline(cin, price);\n cin >> price;\n\n cout << \"enter number of tickets\" << endl;\n \/\/getline(cin, ticketNum);\n cin >> ticketNum;\n\n if (session->sell(event, price, ticketNum)) {\n cout << \"tickets added\" << endl;\n }\n }\n else if (input.compare(\"buy\") == 0) {\n cout << \"enter event title\" << endl;\n getline(cin, event);\n\n cout << \"enter number of tickets\" << endl;\n \/\/getline(cin, ticketNum);\n cin >> ticketNum;\n\n \/\/ Skip to next line\n while (cin.get() != '\\n');\n\n cout << \"enter username of seller\" << endl;\n getline(cin, seller);\n\n if (session->buy(event, ticketNum, seller)) {\n cout << \"purchase successful\" << endl;\n }\n }\n else if (input.compare(\"refund\") == 0) {\n cout << \"enter buyer's username\" << endl;\n getline(cin, username);\n\n cout << \"enter seller's username\" << endl;\n getline(cin, seller);\n\n cout << \"enter amount to transfer\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n if (session->refund(username, seller, balance)) {\n cout << \"refund successful\" << endl;\n }\n }\n else {\n cout << \"error: invalid command\" << endl;\n }\n }\n \/\/cout << endl;\n }\n }\n\n cout << endl;\n\n return 0;\n}\n<commit_msg>FIXED: buy11<commit_after>#include \"..\/include\/Main.h\"\n\n\/\/using Poco::StringTokenizer;\n\nint main(int argc, char** argv) {\n if (argc == 4) {\n Transaction* session = new Transaction(argv[1], argv[2], argv[3]);\n\n string input, username, type, event, seller;\n double balance, price;\n int ticketNum;\n bool success = false;\n\n while (getline(cin, input)) {\n \/\/cout << \"Enter your command.\" << endl;\n input = rtrim(input);\n \/\/ TODO Trim right side of the input\n if (!session->isLoggedIn()) {\n if (input.compare(\"login\") == 0) {\n \/\/ Log in stuff.\n cout << \"enter username\" << endl;\n getline(cin, input);\n\n if (session->login(input)) {\n cout << \"login successful\" << endl;\n }\n }\n else if (input.compare(\"quit\") == 0) {\n session->quit();\n break;\n }\n else {\n cout << \"error: invalid command\" << endl;\n }\n }\n else {\n if (input.compare(\"logout\") == 0) {\n session->logout();\n cout << \"logout successful\" << endl;\n }\n else if (input.compare(\"create\") == 0) {\n cout << \"enter username to create\" << endl;\n getline(cin, username);\n\n \/\/ TODO: Catch create1 testcase\n \/\/ username must be maximum 15 characters\n\n cout << \"enter account type\" << endl;\n getline(cin, type);\n\n cout << \"enter user account balance\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n if (session->create(username, type, balance)) {\n cout << \"create successful\" << endl;\n }\n }\n else if (input.compare(\"delete\") == 0) {\n cout << \"enter username\" << endl;\n getline(cin, username);\n\n if (session->removeUser(username)) {\n cout << \"delete successful\" << endl;\n }\n }\n else if (input.compare(\"addcredit\") == 0) {\n if (session->isAdmin()) {\n cout << \"enter username\" << endl;\n getline(cin, username);\n }\n\n cout << \"enter credit amount\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n success = false;\n\n success = validBalance(balance);\n\n if (session->isAdmin()) {\n success = session->addcredit(balance);\n }\n else {\n success = session->addcredit(username, balance);\n }\n\n if (success) {\n cout << \"credit added\" << endl;\n }\n }\n else if (input.compare(\"sell\") == 0) {\n cout << \"enter event title\" << endl;\n getline(cin, event);\n\n cout << \"enter sale price\" << endl;\n \/\/getline(cin, price);\n cin >> price;\n\n cout << \"enter number of tickets\" << endl;\n \/\/getline(cin, ticketNum);\n cin >> ticketNum;\n\n if (session->sell(event, price, ticketNum)) {\n cout << \"tickets added\" << endl;\n }\n }\n else if (input.compare(\"buy\") == 0) {\n cout << \"enter event title\" << endl;\n getline(cin, event);\n\n cout << \"enter number of tickets\" << endl;\n \/\/getline(cin, ticketNum);\n\n cin >> ticketNum;\n bool fail = cin.fail();\n\n \/\/ Skip to next line\n string dummy;\n getline(cin, dummy);\n\n if (!fail || ticketNum < 1) {\n cout << \"error: invalid ticket number\" << endl;\n } else {\n cout << \"enter username of seller\" << endl;\n getline(cin, seller);\n\n if (session->buy(event, ticketNum, seller)) {\n cout << \"purchase successful\" << endl;\n }\n }\n }\n else if (input.compare(\"refund\") == 0) {\n cout << \"enter buyer's username\" << endl;\n getline(cin, username);\n\n cout << \"enter seller's username\" << endl;\n getline(cin, seller);\n\n cout << \"enter amount to transfer\" << endl;\n \/\/getline(cin, balance);\n cin >> balance;\n\n if (session->refund(username, seller, balance)) {\n cout << \"refund successful\" << endl;\n }\n }\n else {\n cout << \"error: invalid command\" << endl;\n }\n }\n \/\/cout << endl;\n }\n }\n\n cout << endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, development version *\n* (c) 2006-2017 INRIA, USTL, UJF, CNRS, MGH *\n* *\n* This program is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU General Public License as published by the Free *\n* Software Foundation; either version 2 of the License, or (at your option) *\n* any later version. *\n* *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n* more details. *\n* *\n* You should have received a copy of the GNU General Public License along *\n* with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>. *\n*******************************************************************************\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include <sstream>\nusing std::ostringstream ;\n#include <fstream>\n\n#include <string>\nusing std::string;\n\n#include <vector>\nusing std::vector;\n\n\n#include <sofa\/helper\/ArgumentParser.h>\n#include <SofaSimulationCommon\/common.h>\n#include <sofa\/simulation\/Node.h>\n#include <sofa\/helper\/system\/PluginManager.h>\n#include <sofa\/simulation\/config.h> \/\/ #defines SOFA_HAVE_DAG (or not)\n#include <SofaSimulationCommon\/init.h>\n#ifdef SOFA_HAVE_DAG\n#include <SofaSimulationGraph\/init.h>\n#include <SofaSimulationGraph\/DAGSimulation.h>\n#endif\n#include <SofaSimulationTree\/init.h>\n#include <SofaSimulationTree\/TreeSimulation.h>\nusing sofa::simulation::Node;\n\n#include <SofaComponentCommon\/initComponentCommon.h>\n#include <SofaComponentBase\/initComponentBase.h>\n#include <SofaComponentGeneral\/initComponentGeneral.h>\n#include <SofaComponentAdvanced\/initComponentAdvanced.h>\n#include <SofaComponentMisc\/initComponentMisc.h>\n\n#include <SofaGeneralLoader\/ReadState.h>\n#include <SofaValidation\/CompareState.h>\n#include <sofa\/helper\/Factory.h>\n#include <sofa\/helper\/cast.h>\n#include <sofa\/helper\/BackTrace.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/helper\/system\/SetDirectory.h>\n#include <sofa\/helper\/Utils.h>\n#include <sofa\/gui\/GUIManager.h>\nusing sofa::gui::GUIManager;\n\n#include <sofa\/gui\/Main.h>\n#include <sofa\/gui\/BatchGUI.h> \/\/ For the default number of iterations\n#include <sofa\/helper\/system\/gl.h>\n#include <sofa\/helper\/system\/atomic.h>\n\nusing sofa::core::ExecParams ;\n\n#include <sofa\/helper\/system\/console.h>\nusing sofa::helper::Utils;\nusing sofa::helper::Console;\n\nusing sofa::component::misc::CompareStateCreator;\nusing sofa::component::misc::ReadStateActivator;\nusing sofa::simulation::tree::TreeSimulation;\nusing sofa::simulation::graph::DAGSimulation;\nusing sofa::helper::system::SetDirectory;\nusing sofa::core::objectmodel::BaseNode ;\nusing sofa::gui::BatchGUI;\nusing sofa::gui::BaseGUI;\n\n#include <sofa\/helper\/logging\/Messaging.h>\n\n#include <sofa\/helper\/logging\/ConsoleMessageHandler.h>\nusing sofa::helper::logging::ConsoleMessageHandler ;\n\n#include <sofa\/core\/logging\/RichConsoleStyleMessageFormatter.h>\nusing sofa::helper::logging::RichConsoleStyleMessageFormatter ;\n\n#include <sofa\/core\/logging\/PerComponentLoggingMessageHandler.h>\nusing sofa::helper::logging::MainPerComponentLoggingMessageHandler ;\n\n#ifdef SOFA_HAVE_GLUT_GUI\n#include <sofa\/helper\/system\/glut.h>\n#endif \/\/ SOFA_HAVE_GLUT_GUI\n\n#ifdef WIN32\n#include <windows.h>\n#endif\n\nusing sofa::helper::system::DataRepository;\nusing sofa::helper::system::PluginRepository;\nusing sofa::helper::system::PluginManager;\n\n#include <sofa\/helper\/logging\/MessageDispatcher.h>\nusing sofa::helper::logging::MessageDispatcher ;\n\n#include <sofa\/helper\/logging\/ClangMessageHandler.h>\nusing sofa::helper::logging::ClangMessageHandler ;\n\n#include <sofa\/helper\/logging\/ExceptionMessageHandler.h>\nusing sofa::helper::logging::ExceptionMessageHandler;\n\n#define STRINGIFY(x) #x\n#define TOSTRING(x) STRINGIFY(x)\n\n\nvoid loadVerificationData(string& directory, string& filename, Node* node)\n{\n msg_info(\"\") << \"loadVerificationData from \" << directory << \" and file \" << filename ;\n\n string refFile;\n\n refFile += directory;\n refFile += '\/';\n refFile += SetDirectory::GetFileName(filename.c_str());\n\n msg_info(\"\") << \"loadVerificationData \" << refFile ;\n\n CompareStateCreator compareVisitor(ExecParams::defaultInstance());\n compareVisitor.setCreateInMapping(true);\n compareVisitor.setSceneName(refFile);\n compareVisitor.execute(node);\n\n ReadStateActivator v_read(ExecParams::defaultInstance(), true);\n v_read.execute(node);\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n sofa::helper::BackTrace::autodump();\n\n ExecParams::defaultInstance()->setAspectID(0);\n\n#ifdef WIN32\n {\n HANDLE hStdout = GetStdHandle(STD_OUTPUT_HANDLE);\n COORD s;\n s.X = 160; s.Y = 10000;\n SetConsoleScreenBufferSize(hStdout, s);\n CONSOLE_SCREEN_BUFFER_INFO csbi;\n if (GetConsoleScreenBufferInfo(hStdout, &csbi))\n {\n SMALL_RECT winfo;\n winfo = csbi.srWindow;\n \/\/winfo.Top = 0;\n winfo.Left = 0;\n \/\/winfo.Bottom = csbi.dwSize.Y-1;\n winfo.Right = csbi.dwMaximumWindowSize.X-1;\n SetConsoleWindowInfo(hStdout, TRUE, &winfo);\n }\n\n }\n#endif\n\n sofa::gui::initMain();\n\n string fileName ;\n bool startAnim = false;\n bool printFactory = false;\n bool loadRecent = false;\n bool temporaryFile = false;\n bool testMode = false;\n bool noAutoloadPlugins = false;\n int nbIterations = BatchGUI::DEFAULT_NUMBER_OF_ITERATIONS;\n unsigned int nbMSSASamples = 1;\n unsigned computationTimeSampling=0; \/\/\/< Frequency of display of the computation time statistics, in number of animation steps. 0 means never.\n\n string gui = \"\";\n string verif = \"\";\n\n#if defined(SOFA_HAVE_DAG)\n string simulationType = \"dag\";\n#else\n string simulationType = \"tree\";\n#endif\n\n vector<string> plugins;\n vector<string> files;\n string colorsStatus = \"auto\";\n string messageHandler = \"auto\";\n bool enableInteraction = false ;\n\n string gui_help = \"choose the UI (\";\n gui_help += GUIManager::ListSupportedGUI('|');\n gui_help += \")\";\n\n sofa::helper::parse(&files, \"This is a SOFA application. Here are the command line arguments\")\n \/\/ alphabetical order on short name\n .option(&startAnim,'a',\"start\",\"start the animation loop\")\n .option(&computationTimeSampling,'c',\"computationTimeSampling\",\"Frequency of display of the computation time statistics, in number of animation steps. 0 means never.\")\n .option(&gui,'g',\"gui\",gui_help.c_str())\n .option(&plugins,'l',\"load\",\"load given plugins\")\n .option(&noAutoloadPlugins, '0', \"noautoload\", \"disable plugins autoloading\")\n .option(&nbMSSASamples, 'm', \"msaa\", \"number of samples for MSAA (Multi Sampling Anti Aliasing ; value < 2 means disabled\")\n .option(&nbIterations,'n',\"nb_iterations\",\"(only batch) Number of iterations of the simulation\")\n .option(&printFactory,'p',\"factory\",\"print factory logs\")\n .option(&loadRecent,'r',\"recent\",\"load most recently opened file\")\n .option(&simulationType,'s',\"simu\",\"select the type of simulation (bgl, dag, tree)\")\n .option(&temporaryFile,'t',\"temporary\",\"the loaded scene won't appear in history of opened files\")\n .option(&testMode,'x',\"test\",\"select test mode with xml output after N iteration\")\n .option(&verif,'v',\"verification\",\"load verification data for the scene\")\n .option(&colorsStatus,'z',\"colors\",\"use colors on stdout and stderr (yes, no, auto)\")\n .option(&messageHandler,'f',\"formatting\",\"select the message formatting to use (auto, clang, sofa, rich, test)\")\n .option(&enableInteraction, 'i', \"interactive\", \"enable interactive mode for the GUI which includes idle and mouse events (EXPERIMENTAL)\")\n (argc,argv);\n\n \/\/ Note that initializations must be done after ArgumentParser that can exit the application (without cleanup)\n \/\/ even if everything is ok e.g. asking for help\n sofa::simulation::tree::init();\n#ifdef SOFA_HAVE_DAG\n sofa::simulation::graph::init();\n#endif\n sofa::component::initComponentBase();\n sofa::component::initComponentCommon();\n sofa::component::initComponentGeneral();\n sofa::component::initComponentAdvanced();\n sofa::component::initComponentMisc();\n\n#ifndef SOFA_NO_OPENGL\n#ifdef SOFA_HAVE_GLUT_GUI\n if(gui!=\"batch\") glutInit(&argc,argv);\n#endif \/\/ SOFA_HAVE_GLUT_GUI\n#endif \/\/ SOFA_NO_OPENGL\n\n#ifdef SOFA_HAVE_DAG\n if (simulationType == \"tree\")\n sofa::simulation::setSimulation(new TreeSimulation());\n else\n sofa::simulation::setSimulation(new DAGSimulation());\n#else \/\/SOFA_HAVE_DAG\n sofa::simulation::setSimulation(new TreeSimulation());\n#endif\n\n if (colorsStatus == \"auto\")\n Console::setColorsStatus(Console::ColorsAuto);\n else if (colorsStatus == \"yes\")\n Console::setColorsStatus(Console::ColorsEnabled);\n else if (colorsStatus == \"no\")\n Console::setColorsStatus(Console::ColorsDisabled);\n\n \/\/TODO(dmarchal): Use smart pointer there to avoid memory leaks !!\n if (messageHandler == \"auto\" )\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler() ) ;\n }\n else if (messageHandler == \"clang\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ClangMessageHandler() ) ;\n }\n else if (messageHandler == \"sofa\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler() ) ;\n }\n else if (messageHandler == \"rich\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler(new RichConsoleStyleMessageFormatter()) ) ;\n }\n else if (messageHandler == \"test\"){\n MessageDispatcher::addHandler( new ExceptionMessageHandler() ) ;\n }\n else{\n msg_warning(\"\") << \"Invalid argument '\" << messageHandler << \"' for '--formatting'\";\n }\n MessageDispatcher::addHandler(&MainPerComponentLoggingMessageHandler::getInstance()) ;\n\n \/\/ Initialise paths\n BaseGUI::setConfigDirectoryPath(Utils::getSofaPathPrefix() + \"\/config\", true);\n BaseGUI::setScreenshotDirectoryPath(Utils::getSofaPathPrefix() + \"\/screenshots\", true);\n\n if (!files.empty())\n fileName = files[0];\n\n for (unsigned int i=0; i<plugins.size(); i++)\n PluginManager::getInstance().loadPlugin(plugins[i]);\n\n std::string configPluginPath = PluginRepository.getFirstPath() + \"\/\" + TOSTRING(CONFIG_PLUGIN_FILENAME);\n std::string defaultConfigPluginPath = PluginRepository.getFirstPath() + \"\/\" + TOSTRING(DEFAULT_CONFIG_PLUGIN_FILENAME);\n\n if (!noAutoloadPlugins)\n {\n if (DataRepository.findFile(configPluginPath))\n {\n msg_info(\"runSofa\") << \"Loading automatically plugin list in \" << configPluginPath;\n PluginManager::getInstance().readFromIniFile(configPluginPath);\n }\n else if (DataRepository.findFile(defaultConfigPluginPath))\n {\n msg_info(\"runSofa\") << \"Loading automatically plugin list in \" << defaultConfigPluginPath;\n PluginManager::getInstance().readFromIniFile(defaultConfigPluginPath);\n }\n else\n msg_info(\"runSofa\") << \"No plugin list found. No plugin will be automatically loaded.\";\n }\n else\n msg_info(\"runSofa\") << \"Automatic plugin loading disabled.\";\n\n PluginManager::getInstance().init();\n\n if(gui.compare(\"batch\") == 0 && nbIterations >= 0)\n {\n ostringstream oss ;\n oss << \"nbIterations=\";\n oss << nbIterations;\n GUIManager::AddGUIOption(oss.str().c_str());\n }\n\n if(enableInteraction){\n msg_warning(\"Main\") << \"you activated the interactive mode. This is currently an experimental feature \"\n \"that may change or be removed in the future. \" ;\n GUIManager::AddGUIOption(\"enableInteraction\");\n }\n\n if(nbMSSASamples > 1)\n {\n ostringstream oss ;\n oss << \"msaa=\";\n oss << nbMSSASamples;\n GUIManager::AddGUIOption(oss.str().c_str());\n }\n\n if (int err = GUIManager::Init(argv[0],gui.c_str()))\n return err;\n\n if (fileName.empty())\n {\n if (loadRecent) \/\/ try to reload the latest scene\n {\n string scenes = BaseGUI::getConfigDirectoryPath() + \"\/runSofa.ini\";\n std::ifstream mrulist(scenes.c_str());\n std::getline(mrulist,fileName);\n mrulist.close();\n }\n else\n fileName = \"Demos\/caduceus.scn\";\n\n fileName = DataRepository.getFile(fileName);\n }\n\n\n if (int err=GUIManager::createGUI(NULL))\n return err;\n\n \/\/To set a specific resolution for the viewer, use the component ViewerSetting in you scene graph\n GUIManager::SetDimension(800,600);\n\n Node::SPtr groot = sofa::simulation::getSimulation()->load(fileName.c_str());\n if( !groot )\n groot = sofa::simulation::getSimulation()->createNewGraph(\"\");\n\n if (!verif.empty())\n {\n loadVerificationData(verif, fileName, groot.get());\n }\n\n sofa::simulation::getSimulation()->init(groot.get());\n GUIManager::SetScene(groot,fileName.c_str(), temporaryFile);\n\n\n \/\/=======================================\n \/\/Apply Options\n\n if (startAnim)\n groot->setAnimate(true);\n if (printFactory)\n {\n msg_info(\"\") << \"\/\/\/\/\/\/\/\/\/\/ FACTORY \/\/\/\/\/\/\/\/\/\/\" ;\n sofa::helper::printFactoryLog();\n msg_info(\"\") << \"\/\/\/\/\/\/\/\/ END FACTORY \/\/\/\/\/\/\/\/\" ;\n }\n\n if( computationTimeSampling>0 )\n {\n sofa::helper::AdvancedTimer::setEnabled(\"Animate\", true);\n sofa::helper::AdvancedTimer::setInterval(\"Animate\", computationTimeSampling);\n }\n\n \/\/=======================================\n \/\/ Run the main loop\n if (int err = GUIManager::MainLoop(groot,fileName.c_str()))\n return err;\n groot = dynamic_cast<Node*>( GUIManager::CurrentSimulation() );\n\n if (testMode)\n {\n string xmlname = fileName.substr(0,fileName.length()-4)+\"-scene.scn\";\n msg_info(\"\") << \"Exporting to XML \" << xmlname ;\n sofa::simulation::getSimulation()->exportXML(groot.get(), xmlname.c_str());\n }\n\n if (groot!=NULL)\n sofa::simulation::getSimulation()->unload(groot);\n\n\n GUIManager::closeGUI();\n\n sofa::simulation::common::cleanup();\n sofa::simulation::tree::cleanup();\n#ifdef SOFA_HAVE_DAG\n sofa::simulation::graph::cleanup();\n#endif\n return 0;\n}\n<commit_msg>[runSofa] FIX PluginRepository initialization<commit_after>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, development version *\n* (c) 2006-2017 INRIA, USTL, UJF, CNRS, MGH *\n* *\n* This program is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU General Public License as published by the Free *\n* Software Foundation; either version 2 of the License, or (at your option) *\n* any later version. *\n* *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n* more details. *\n* *\n* You should have received a copy of the GNU General Public License along *\n* with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>. *\n*******************************************************************************\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include <sstream>\nusing std::ostringstream ;\n#include <fstream>\n\n#include <string>\nusing std::string;\n\n#include <vector>\nusing std::vector;\n\n\n#include <sofa\/helper\/ArgumentParser.h>\n#include <SofaSimulationCommon\/common.h>\n#include <sofa\/simulation\/Node.h>\n#include <sofa\/helper\/system\/PluginManager.h>\n#include <sofa\/simulation\/config.h> \/\/ #defines SOFA_HAVE_DAG (or not)\n#include <SofaSimulationCommon\/init.h>\n#ifdef SOFA_HAVE_DAG\n#include <SofaSimulationGraph\/init.h>\n#include <SofaSimulationGraph\/DAGSimulation.h>\n#endif\n#include <SofaSimulationTree\/init.h>\n#include <SofaSimulationTree\/TreeSimulation.h>\nusing sofa::simulation::Node;\n\n#include <SofaComponentCommon\/initComponentCommon.h>\n#include <SofaComponentBase\/initComponentBase.h>\n#include <SofaComponentGeneral\/initComponentGeneral.h>\n#include <SofaComponentAdvanced\/initComponentAdvanced.h>\n#include <SofaComponentMisc\/initComponentMisc.h>\n\n#include <SofaGeneralLoader\/ReadState.h>\n#include <SofaValidation\/CompareState.h>\n#include <sofa\/helper\/Factory.h>\n#include <sofa\/helper\/cast.h>\n#include <sofa\/helper\/BackTrace.h>\n#include <sofa\/helper\/system\/FileRepository.h>\n#include <sofa\/helper\/system\/SetDirectory.h>\n#include <sofa\/helper\/Utils.h>\n#include <sofa\/gui\/GUIManager.h>\nusing sofa::gui::GUIManager;\n\n#include <sofa\/gui\/Main.h>\n#include <sofa\/gui\/BatchGUI.h> \/\/ For the default number of iterations\n#include <sofa\/helper\/system\/gl.h>\n#include <sofa\/helper\/system\/atomic.h>\n\nusing sofa::core::ExecParams ;\n\n#include <sofa\/helper\/system\/console.h>\nusing sofa::helper::Utils;\nusing sofa::helper::Console;\n\nusing sofa::component::misc::CompareStateCreator;\nusing sofa::component::misc::ReadStateActivator;\nusing sofa::simulation::tree::TreeSimulation;\nusing sofa::simulation::graph::DAGSimulation;\nusing sofa::helper::system::SetDirectory;\nusing sofa::core::objectmodel::BaseNode ;\nusing sofa::gui::BatchGUI;\nusing sofa::gui::BaseGUI;\n\n#include <sofa\/helper\/logging\/Messaging.h>\n\n#include <sofa\/helper\/logging\/ConsoleMessageHandler.h>\nusing sofa::helper::logging::ConsoleMessageHandler ;\n\n#include <sofa\/core\/logging\/RichConsoleStyleMessageFormatter.h>\nusing sofa::helper::logging::RichConsoleStyleMessageFormatter ;\n\n#include <sofa\/core\/logging\/PerComponentLoggingMessageHandler.h>\nusing sofa::helper::logging::MainPerComponentLoggingMessageHandler ;\n\n#ifdef SOFA_HAVE_GLUT_GUI\n#include <sofa\/helper\/system\/glut.h>\n#endif \/\/ SOFA_HAVE_GLUT_GUI\n\n#ifdef WIN32\n#include <windows.h>\n#endif\n\nusing sofa::helper::system::DataRepository;\nusing sofa::helper::system::PluginRepository;\nusing sofa::helper::system::PluginManager;\n\n#include <sofa\/helper\/logging\/MessageDispatcher.h>\nusing sofa::helper::logging::MessageDispatcher ;\n\n#include <sofa\/helper\/logging\/ClangMessageHandler.h>\nusing sofa::helper::logging::ClangMessageHandler ;\n\n#include <sofa\/helper\/logging\/ExceptionMessageHandler.h>\nusing sofa::helper::logging::ExceptionMessageHandler;\n\n#define STRINGIFY(x) #x\n#define TOSTRING(x) STRINGIFY(x)\n\n\nvoid loadVerificationData(string& directory, string& filename, Node* node)\n{\n msg_info(\"\") << \"loadVerificationData from \" << directory << \" and file \" << filename ;\n\n string refFile;\n\n refFile += directory;\n refFile += '\/';\n refFile += SetDirectory::GetFileName(filename.c_str());\n\n msg_info(\"\") << \"loadVerificationData \" << refFile ;\n\n CompareStateCreator compareVisitor(ExecParams::defaultInstance());\n compareVisitor.setCreateInMapping(true);\n compareVisitor.setSceneName(refFile);\n compareVisitor.execute(node);\n\n ReadStateActivator v_read(ExecParams::defaultInstance(), true);\n v_read.execute(node);\n}\n\n\/\/ ---------------------------------------------------------------------\n\/\/ ---\n\/\/ ---------------------------------------------------------------------\nint main(int argc, char** argv)\n{\n sofa::helper::BackTrace::autodump();\n\n ExecParams::defaultInstance()->setAspectID(0);\n\n#ifdef WIN32\n {\n HANDLE hStdout = GetStdHandle(STD_OUTPUT_HANDLE);\n COORD s;\n s.X = 160; s.Y = 10000;\n SetConsoleScreenBufferSize(hStdout, s);\n CONSOLE_SCREEN_BUFFER_INFO csbi;\n if (GetConsoleScreenBufferInfo(hStdout, &csbi))\n {\n SMALL_RECT winfo;\n winfo = csbi.srWindow;\n \/\/winfo.Top = 0;\n winfo.Left = 0;\n \/\/winfo.Bottom = csbi.dwSize.Y-1;\n winfo.Right = csbi.dwMaximumWindowSize.X-1;\n SetConsoleWindowInfo(hStdout, TRUE, &winfo);\n }\n\n }\n#endif\n\n sofa::gui::initMain();\n\n string fileName ;\n bool startAnim = false;\n bool printFactory = false;\n bool loadRecent = false;\n bool temporaryFile = false;\n bool testMode = false;\n bool noAutoloadPlugins = false;\n int nbIterations = BatchGUI::DEFAULT_NUMBER_OF_ITERATIONS;\n unsigned int nbMSSASamples = 1;\n unsigned computationTimeSampling=0; \/\/\/< Frequency of display of the computation time statistics, in number of animation steps. 0 means never.\n\n string gui = \"\";\n string verif = \"\";\n\n#if defined(SOFA_HAVE_DAG)\n string simulationType = \"dag\";\n#else\n string simulationType = \"tree\";\n#endif\n\n vector<string> plugins;\n vector<string> files;\n string colorsStatus = \"auto\";\n string messageHandler = \"auto\";\n bool enableInteraction = false ;\n\n string gui_help = \"choose the UI (\";\n gui_help += GUIManager::ListSupportedGUI('|');\n gui_help += \")\";\n\n sofa::helper::parse(&files, \"This is a SOFA application. Here are the command line arguments\")\n \/\/ alphabetical order on short name\n .option(&startAnim,'a',\"start\",\"start the animation loop\")\n .option(&computationTimeSampling,'c',\"computationTimeSampling\",\"Frequency of display of the computation time statistics, in number of animation steps. 0 means never.\")\n .option(&gui,'g',\"gui\",gui_help.c_str())\n .option(&plugins,'l',\"load\",\"load given plugins\")\n .option(&noAutoloadPlugins, '0', \"noautoload\", \"disable plugins autoloading\")\n .option(&nbMSSASamples, 'm', \"msaa\", \"number of samples for MSAA (Multi Sampling Anti Aliasing ; value < 2 means disabled\")\n .option(&nbIterations,'n',\"nb_iterations\",\"(only batch) Number of iterations of the simulation\")\n .option(&printFactory,'p',\"factory\",\"print factory logs\")\n .option(&loadRecent,'r',\"recent\",\"load most recently opened file\")\n .option(&simulationType,'s',\"simu\",\"select the type of simulation (bgl, dag, tree)\")\n .option(&temporaryFile,'t',\"temporary\",\"the loaded scene won't appear in history of opened files\")\n .option(&testMode,'x',\"test\",\"select test mode with xml output after N iteration\")\n .option(&verif,'v',\"verification\",\"load verification data for the scene\")\n .option(&colorsStatus,'z',\"colors\",\"use colors on stdout and stderr (yes, no, auto)\")\n .option(&messageHandler,'f',\"formatting\",\"select the message formatting to use (auto, clang, sofa, rich, test)\")\n .option(&enableInteraction, 'i', \"interactive\", \"enable interactive mode for the GUI which includes idle and mouse events (EXPERIMENTAL)\")\n (argc,argv);\n\n \/\/ Note that initializations must be done after ArgumentParser that can exit the application (without cleanup)\n \/\/ even if everything is ok e.g. asking for help\n sofa::simulation::tree::init();\n#ifdef SOFA_HAVE_DAG\n sofa::simulation::graph::init();\n#endif\n sofa::component::initComponentBase();\n sofa::component::initComponentCommon();\n sofa::component::initComponentGeneral();\n sofa::component::initComponentAdvanced();\n sofa::component::initComponentMisc();\n\n#ifndef SOFA_NO_OPENGL\n#ifdef SOFA_HAVE_GLUT_GUI\n if(gui!=\"batch\") glutInit(&argc,argv);\n#endif \/\/ SOFA_HAVE_GLUT_GUI\n#endif \/\/ SOFA_NO_OPENGL\n\n#ifdef SOFA_HAVE_DAG\n if (simulationType == \"tree\")\n sofa::simulation::setSimulation(new TreeSimulation());\n else\n sofa::simulation::setSimulation(new DAGSimulation());\n#else \/\/SOFA_HAVE_DAG\n sofa::simulation::setSimulation(new TreeSimulation());\n#endif\n\n if (colorsStatus == \"auto\")\n Console::setColorsStatus(Console::ColorsAuto);\n else if (colorsStatus == \"yes\")\n Console::setColorsStatus(Console::ColorsEnabled);\n else if (colorsStatus == \"no\")\n Console::setColorsStatus(Console::ColorsDisabled);\n\n \/\/TODO(dmarchal): Use smart pointer there to avoid memory leaks !!\n if (messageHandler == \"auto\" )\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler() ) ;\n }\n else if (messageHandler == \"clang\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ClangMessageHandler() ) ;\n }\n else if (messageHandler == \"sofa\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler() ) ;\n }\n else if (messageHandler == \"rich\")\n {\n MessageDispatcher::clearHandlers() ;\n MessageDispatcher::addHandler( new ConsoleMessageHandler(new RichConsoleStyleMessageFormatter()) ) ;\n }\n else if (messageHandler == \"test\"){\n MessageDispatcher::addHandler( new ExceptionMessageHandler() ) ;\n }\n else{\n msg_warning(\"\") << \"Invalid argument '\" << messageHandler << \"' for '--formatting'\";\n }\n MessageDispatcher::addHandler(&MainPerComponentLoggingMessageHandler::getInstance()) ;\n\n \/\/ Initialise paths\n BaseGUI::setConfigDirectoryPath(Utils::getSofaPathPrefix() + \"\/config\", true);\n BaseGUI::setScreenshotDirectoryPath(Utils::getSofaPathPrefix() + \"\/screenshots\", true);\n PluginRepository.addFirstPath( Utils::getPluginDirectory() );\n\n if (!files.empty())\n fileName = files[0];\n\n for (unsigned int i=0; i<plugins.size(); i++)\n PluginManager::getInstance().loadPlugin(plugins[i]);\n\n std::string configPluginPath = PluginRepository.getFirstPath() + \"\/\" + TOSTRING(CONFIG_PLUGIN_FILENAME);\n std::string defaultConfigPluginPath = PluginRepository.getFirstPath() + \"\/\" + TOSTRING(DEFAULT_CONFIG_PLUGIN_FILENAME);\n\n if (!noAutoloadPlugins)\n {\n if (DataRepository.findFile(configPluginPath))\n {\n msg_info(\"runSofa\") << \"Loading automatically custom plugin list from \" << configPluginPath;\n PluginManager::getInstance().readFromIniFile(configPluginPath);\n }\n else if (DataRepository.findFile(defaultConfigPluginPath))\n {\n msg_info(\"runSofa\") << \"Loading automatically default plugin list from \" << defaultConfigPluginPath;\n PluginManager::getInstance().readFromIniFile(defaultConfigPluginPath);\n }\n else\n msg_info(\"runSofa\") << \"No plugin will be automatically loaded\" << msgendl\n << \"- No custom list found at \" << configPluginPath << msgendl\n << \"- No default list found at \" << defaultConfigPluginPath;\n }\n else\n msg_info(\"runSofa\") << \"Automatic plugin loading disabled.\";\n\n PluginManager::getInstance().init();\n\n if(gui.compare(\"batch\") == 0 && nbIterations >= 0)\n {\n ostringstream oss ;\n oss << \"nbIterations=\";\n oss << nbIterations;\n GUIManager::AddGUIOption(oss.str().c_str());\n }\n\n if(enableInteraction){\n msg_warning(\"Main\") << \"you activated the interactive mode. This is currently an experimental feature \"\n \"that may change or be removed in the future. \" ;\n GUIManager::AddGUIOption(\"enableInteraction\");\n }\n\n if(nbMSSASamples > 1)\n {\n ostringstream oss ;\n oss << \"msaa=\";\n oss << nbMSSASamples;\n GUIManager::AddGUIOption(oss.str().c_str());\n }\n\n if (int err = GUIManager::Init(argv[0],gui.c_str()))\n return err;\n\n if (fileName.empty())\n {\n if (loadRecent) \/\/ try to reload the latest scene\n {\n string scenes = BaseGUI::getConfigDirectoryPath() + \"\/runSofa.ini\";\n std::ifstream mrulist(scenes.c_str());\n std::getline(mrulist,fileName);\n mrulist.close();\n }\n else\n fileName = \"Demos\/caduceus.scn\";\n\n fileName = DataRepository.getFile(fileName);\n }\n\n\n if (int err=GUIManager::createGUI(NULL))\n return err;\n\n \/\/To set a specific resolution for the viewer, use the component ViewerSetting in you scene graph\n GUIManager::SetDimension(800,600);\n\n Node::SPtr groot = sofa::simulation::getSimulation()->load(fileName.c_str());\n if( !groot )\n groot = sofa::simulation::getSimulation()->createNewGraph(\"\");\n\n if (!verif.empty())\n {\n loadVerificationData(verif, fileName, groot.get());\n }\n\n sofa::simulation::getSimulation()->init(groot.get());\n GUIManager::SetScene(groot,fileName.c_str(), temporaryFile);\n\n\n \/\/=======================================\n \/\/Apply Options\n\n if (startAnim)\n groot->setAnimate(true);\n if (printFactory)\n {\n msg_info(\"\") << \"\/\/\/\/\/\/\/\/\/\/ FACTORY \/\/\/\/\/\/\/\/\/\/\" ;\n sofa::helper::printFactoryLog();\n msg_info(\"\") << \"\/\/\/\/\/\/\/\/ END FACTORY \/\/\/\/\/\/\/\/\" ;\n }\n\n if( computationTimeSampling>0 )\n {\n sofa::helper::AdvancedTimer::setEnabled(\"Animate\", true);\n sofa::helper::AdvancedTimer::setInterval(\"Animate\", computationTimeSampling);\n }\n\n \/\/=======================================\n \/\/ Run the main loop\n if (int err = GUIManager::MainLoop(groot,fileName.c_str()))\n return err;\n groot = dynamic_cast<Node*>( GUIManager::CurrentSimulation() );\n\n if (testMode)\n {\n string xmlname = fileName.substr(0,fileName.length()-4)+\"-scene.scn\";\n msg_info(\"\") << \"Exporting to XML \" << xmlname ;\n sofa::simulation::getSimulation()->exportXML(groot.get(), xmlname.c_str());\n }\n\n if (groot!=NULL)\n sofa::simulation::getSimulation()->unload(groot);\n\n\n GUIManager::closeGUI();\n\n sofa::simulation::common::cleanup();\n sofa::simulation::tree::cleanup();\n#ifdef SOFA_HAVE_DAG\n sofa::simulation::graph::cleanup();\n#endif\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2019-2020 The Ion Core developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"tokens\/tokendb.h\"\n#include \"tokens\/tokengroupmanager.h\"\n#include \"ui_interface.h\"\n#include \"validation.h\"\n\n#include <boost\/thread.hpp>\n\nCTokenDB::CTokenDB(size_t nCacheSize, bool fMemory, bool fWipe) : CDBWrapper(GetDataDir() \/ \"tokens\", nCacheSize, fMemory, fWipe) {}\n\nbool CTokenDB::WriteTokenGroupsBatch(const std::vector<CTokenGroupCreation>& tokenGroups) {\n CDBBatch batch(*this);\n for (std::vector<CTokenGroupCreation>::const_iterator it = tokenGroups.begin(); it != tokenGroups.end(); it++){\n batch.Write(std::make_pair('c', it->tokenGroupInfo.associatedGroup), *it);\n }\n return WriteBatch(batch);\n}\n\nbool CTokenDB::WriteTokenGroup(const CTokenGroupID& tokenGroupID, const CTokenGroupCreation& tokenGroupCreation) {\n return Write(std::make_pair('c', tokenGroupID), tokenGroupCreation);\n}\n\nbool CTokenDB::ReadTokenGroup(const CTokenGroupID& tokenGroupID, CTokenGroupCreation& tokenGroupCreation) {\n return Read(std::make_pair('c', tokenGroupID), tokenGroupCreation);\n}\n\nbool CTokenDB::EraseTokenGroupBatch(const std::vector<CTokenGroupID>& newTokenGroupIDs) {\n CDBBatch batch(*this);\n for (std::vector<CTokenGroupID>::const_iterator it = newTokenGroupIDs.begin(); it != newTokenGroupIDs.end(); it++){\n batch.Erase(std::make_pair('c', *it));\n }\n return WriteBatch(batch);\n\n}\n\nbool CTokenDB::EraseTokenGroup(const CTokenGroupID& tokenGroupID) {\n return Erase(std::make_pair('c', tokenGroupID));\n}\n\nbool CTokenDB::DropTokenGroups(std::string& strError) {\n std::vector<CTokenGroupCreation> vTokenGroups;\n std::vector<CTokenGroupID> vTokenGroupIDs;\n FindTokenGroups(vTokenGroups, strError);\n\n for (auto tokenGroup : vTokenGroups) {\n vTokenGroupIDs.emplace_back(tokenGroup.tokenGroupInfo.associatedGroup);\n EraseTokenGroupBatch(vTokenGroupIDs);\n }\n\n return true;\n}\n\nbool CTokenDB::FindTokenGroups(std::vector<CTokenGroupCreation>& vTokenGroups, std::string& strError) {\n boost::scoped_ptr<CDBIterator> pcursor(NewIterator());\n pcursor->SeekToFirst();\n\n while (pcursor->Valid()) {\n boost::this_thread::interruption_point();\n std::pair<char, CTokenGroupID> key;\n if (pcursor->GetKey(key) && key.first == 'c') {\n CTokenGroupCreation tokenGroupCreation;\n if (pcursor->GetValue(tokenGroupCreation)) {\n vTokenGroups.push_back(tokenGroupCreation);\n } else {\n strError = \"Failed to read token data from database\";\n return error(strError.c_str());\n }\n }\n pcursor->Next();\n }\n return true;\n}\n\nbool CTokenDB::LoadTokensFromDB(std::string& strError) {\n tokenGroupManager->ResetTokenGroups();\n\n std::vector<CTokenGroupCreation> vTokenGroups;\n FindTokenGroups(vTokenGroups, strError);\n\n tokenGroupManager->AddTokenGroups(vTokenGroups);\n return true;\n}\n\nbool VerifyTokenDB(std::string &strError) {\n std::vector<CTokenGroupCreation> vTokenGroups;\n if (!pTokenDB->FindTokenGroups(vTokenGroups, strError)) {\n return error(strError.c_str());\n }\n for (auto tgCreation : vTokenGroups) {\n uint256 hash_block;\n CTransactionRef tx;\n uint256 txHash = tgCreation.creationTransaction->GetHash();\n\n LOCK(cs_main);\n auto pindex = mapBlockIndex.at(tgCreation.creationBlockHash);\n CBlock block;\n if (!ReadBlockFromDisk(block, pindex, Params().GetConsensus())) {\n strError = \"Cannot locate token creation transaction's block\";\n return error(strError.c_str());\n }\n for (auto& tx : block.vtx) {\n if (tx->GetHash() != txHash) {\n continue;\n }\n \/\/ Found creation transaction\n CTokenGroupCreation tgCreation2;\n if (!CreateTokenGroup(tx, block.GetHash(), tgCreation2)) {\n strError = \"Cannot recreate token configuration transaction\";\n return error(strError.c_str());\n }\n if (!(tgCreation == tgCreation2)) {\n strError = \"Cannot verify token configuration transaction\";\n return error(strError.c_str());\n }\n }\n }\n return true;\n}\n\nbool ReindexTokenDB(std::string &strError) {\n if (!pTokenDB->DropTokenGroups(strError)) {\n strError = \"Failed to reset token database\";\n return false;\n }\n tokenGroupManager->ResetTokenGroups();\n\n uiInterface.ShowProgress(_(\"Reindexing token database...\"), 0);\n\n CBlockIndex* pindex = chainActive[Params().GetConsensus().ATPStartHeight];\n std::vector<CTokenGroupCreation> vTokenGroups;\n while (pindex) {\n uiInterface.ShowProgress(_(\"Reindexing token database...\"), std::max(1, std::min(99, (int)((double)(pindex->nHeight - Params().GetConsensus().ATPStartHeight) \/ (double)(chainActive.Height() - Params().GetConsensus().ATPStartHeight) * 100))));\n\n if (pindex->nHeight % 10000 == 0)\n LogPrintf(\"Reindexing token database: block %d...\\n\", pindex->nHeight);\n\n CBlock block;\n if (!ReadBlockFromDisk(block, pindex, Params().GetConsensus())) {\n strError = \"Reindexing token database failed\";\n return false;\n }\n\n for (const CTransactionRef& ptx : block.vtx) {\n if (!ptx->IsCoinBase() && !ptx->HasZerocoinSpendInputs() && IsAnyOutputGroupedCreation(*ptx)) {\n CTokenGroupCreation tokenGroupCreation;\n if (CreateTokenGroup(ptx, block.GetHash(), tokenGroupCreation)) {\n vTokenGroups.push_back(tokenGroupCreation);\n }\n }\n }\n\n if (!vTokenGroups.empty() && !pTokenDB->WriteTokenGroupsBatch(vTokenGroups)) {\n strError = \"Error writing token database to disk\";\n return false;\n }\n tokenGroupManager->AddTokenGroups(vTokenGroups);\n vTokenGroups.clear();\n\n pindex = chainActive.Next(pindex);\n }\n\n uiInterface.ShowProgress(\"\", 100);\n\n return true;\n}\n<commit_msg>Limiting token database verification when blocks have been pruned<commit_after>\/\/ Copyright (c) 2019-2020 The Ion Core developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"tokens\/tokendb.h\"\n#include \"tokens\/tokengroupmanager.h\"\n#include \"ui_interface.h\"\n#include \"validation.h\"\n\n#include <boost\/thread.hpp>\n\nCTokenDB::CTokenDB(size_t nCacheSize, bool fMemory, bool fWipe) : CDBWrapper(GetDataDir() \/ \"tokens\", nCacheSize, fMemory, fWipe) {}\n\nbool CTokenDB::WriteTokenGroupsBatch(const std::vector<CTokenGroupCreation>& tokenGroups) {\n CDBBatch batch(*this);\n for (std::vector<CTokenGroupCreation>::const_iterator it = tokenGroups.begin(); it != tokenGroups.end(); it++){\n batch.Write(std::make_pair('c', it->tokenGroupInfo.associatedGroup), *it);\n }\n return WriteBatch(batch);\n}\n\nbool CTokenDB::WriteTokenGroup(const CTokenGroupID& tokenGroupID, const CTokenGroupCreation& tokenGroupCreation) {\n return Write(std::make_pair('c', tokenGroupID), tokenGroupCreation);\n}\n\nbool CTokenDB::ReadTokenGroup(const CTokenGroupID& tokenGroupID, CTokenGroupCreation& tokenGroupCreation) {\n return Read(std::make_pair('c', tokenGroupID), tokenGroupCreation);\n}\n\nbool CTokenDB::EraseTokenGroupBatch(const std::vector<CTokenGroupID>& newTokenGroupIDs) {\n CDBBatch batch(*this);\n for (std::vector<CTokenGroupID>::const_iterator it = newTokenGroupIDs.begin(); it != newTokenGroupIDs.end(); it++){\n batch.Erase(std::make_pair('c', *it));\n }\n return WriteBatch(batch);\n\n}\n\nbool CTokenDB::EraseTokenGroup(const CTokenGroupID& tokenGroupID) {\n return Erase(std::make_pair('c', tokenGroupID));\n}\n\nbool CTokenDB::DropTokenGroups(std::string& strError) {\n std::vector<CTokenGroupCreation> vTokenGroups;\n std::vector<CTokenGroupID> vTokenGroupIDs;\n FindTokenGroups(vTokenGroups, strError);\n\n for (auto tokenGroup : vTokenGroups) {\n vTokenGroupIDs.emplace_back(tokenGroup.tokenGroupInfo.associatedGroup);\n EraseTokenGroupBatch(vTokenGroupIDs);\n }\n\n return true;\n}\n\nbool CTokenDB::FindTokenGroups(std::vector<CTokenGroupCreation>& vTokenGroups, std::string& strError) {\n boost::scoped_ptr<CDBIterator> pcursor(NewIterator());\n pcursor->SeekToFirst();\n\n while (pcursor->Valid()) {\n boost::this_thread::interruption_point();\n std::pair<char, CTokenGroupID> key;\n if (pcursor->GetKey(key) && key.first == 'c') {\n CTokenGroupCreation tokenGroupCreation;\n if (pcursor->GetValue(tokenGroupCreation)) {\n vTokenGroups.push_back(tokenGroupCreation);\n } else {\n strError = \"Failed to read token data from database\";\n return error(strError.c_str());\n }\n }\n pcursor->Next();\n }\n return true;\n}\n\nbool CTokenDB::LoadTokensFromDB(std::string& strError) {\n tokenGroupManager->ResetTokenGroups();\n\n std::vector<CTokenGroupCreation> vTokenGroups;\n FindTokenGroups(vTokenGroups, strError);\n\n tokenGroupManager->AddTokenGroups(vTokenGroups);\n return true;\n}\n\nbool VerifyTokenDB(std::string &strError) {\n std::vector<CTokenGroupCreation> vTokenGroups;\n if (!pTokenDB->FindTokenGroups(vTokenGroups, strError)) {\n return error(strError.c_str());\n }\n if (fHavePruned) {\n LogPrintf(\"The block database has been pruned: lowering token database validation level\\n\");\n }\n for (auto tgCreation : vTokenGroups) {\n uint256 hash_block;\n CTransactionRef tx;\n uint256 txHash = tgCreation.creationTransaction->GetHash();\n\n LOCK(cs_main);\n auto pindex = mapBlockIndex.find(tgCreation.creationBlockHash);\n if (pindex == mapBlockIndex.end()) {\n strError = \"Cannot find token creation transaction's block\";\n return error(strError.c_str());\n }\n if (!chainActive.Contains(pindex->second)) {\n strError = \"Token creation not found in the current chain\";\n return error(strError.c_str());\n }\n if (fHavePruned && !(pindex->second->nStatus & BLOCK_HAVE_DATA) && pindex->second->nTx > 0) {\n \/\/ Block is in the index, but it's data has been pruned\n continue;\n }\n CBlock block;\n if (!ReadBlockFromDisk(block, pindex->second, Params().GetConsensus())) {\n strError = \"Cannot locate token creation transaction's block\";\n return error(strError.c_str());\n }\n for (auto& tx : block.vtx) {\n if (tx->GetHash() != txHash) {\n continue;\n }\n \/\/ Found creation transaction\n CTokenGroupCreation tgCreation2;\n if (!CreateTokenGroup(tx, block.GetHash(), tgCreation2)) {\n strError = \"Cannot recreate token configuration transaction\";\n return error(strError.c_str());\n }\n if (!(tgCreation == tgCreation2)) {\n strError = \"Cannot verify token configuration transaction\";\n return error(strError.c_str());\n }\n }\n }\n return true;\n}\n\nbool ReindexTokenDB(std::string &strError) {\n if (!pTokenDB->DropTokenGroups(strError)) {\n strError = \"Failed to reset token database\";\n return false;\n }\n tokenGroupManager->ResetTokenGroups();\n\n uiInterface.ShowProgress(_(\"Reindexing token database...\"), 0);\n\n CBlockIndex* pindex = chainActive[Params().GetConsensus().ATPStartHeight];\n std::vector<CTokenGroupCreation> vTokenGroups;\n while (pindex) {\n uiInterface.ShowProgress(_(\"Reindexing token database...\"), std::max(1, std::min(99, (int)((double)(pindex->nHeight - Params().GetConsensus().ATPStartHeight) \/ (double)(chainActive.Height() - Params().GetConsensus().ATPStartHeight) * 100))));\n\n if (pindex->nHeight % 10000 == 0)\n LogPrintf(\"Reindexing token database: block %d...\\n\", pindex->nHeight);\n\n CBlock block;\n if (!ReadBlockFromDisk(block, pindex, Params().GetConsensus())) {\n strError = \"Reindexing token database failed\";\n return false;\n }\n\n for (const CTransactionRef& ptx : block.vtx) {\n if (!ptx->IsCoinBase() && !ptx->HasZerocoinSpendInputs() && IsAnyOutputGroupedCreation(*ptx)) {\n CTokenGroupCreation tokenGroupCreation;\n if (CreateTokenGroup(ptx, block.GetHash(), tokenGroupCreation)) {\n vTokenGroups.push_back(tokenGroupCreation);\n }\n }\n }\n\n if (!vTokenGroups.empty() && !pTokenDB->WriteTokenGroupsBatch(vTokenGroups)) {\n strError = \"Error writing token database to disk\";\n return false;\n }\n tokenGroupManager->AddTokenGroups(vTokenGroups);\n vTokenGroups.clear();\n\n pindex = chainActive.Next(pindex);\n }\n\n uiInterface.ShowProgress(\"\", 100);\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the tools applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QFile>\n#include <QSysInfo>\n#include <QProcess>\n#include <QLibraryInfo>\n#include <qt_windows.h>\n#include <io.h>\n\nQT_BEGIN_NAMESPACE\n\nstatic QString quotePath(const QString &s)\n{\n if (!s.startsWith(QLatin1Char('\\\"')) && s.contains(QLatin1Char(' ')))\n return QLatin1Char('\\\"') + s + QLatin1Char('\\\"');\n return s;\n}\n\n\nstatic bool runWithQtInEnvironment(const QString &cmd)\n{\n QProcess proc;\n \n \/\/ prepend the qt binary directory to the path\n QStringList env = QProcess::systemEnvironment();\n for (int i=0; i<env.count(); ++i) {\n QString var = env.at(i);\n int setidx = var.indexOf(QLatin1Char('='));\n if (setidx != -1) {\n QString varname = var.left(setidx).trimmed().toUpper();\n if (varname == QLatin1String(\"PATH\")) {\n var = var.mid(setidx + 1);\n var = QLatin1String(\"PATH=\") + \n QLibraryInfo::location(QLibraryInfo::BinariesPath) +\n QLatin1Char(';') + var;\n env[i] = var;\n break;\n }\n }\n }\n\n proc.setEnvironment(env);\n proc.start(cmd);\n proc.waitForFinished(-1);\n \n return (proc.exitCode() == 0);\n}\n\nstatic bool attachTypeLibrary(const QString &applicationName, int resource, const QByteArray &data, QString *errorMessage)\n{\n HANDLE hExe = 0;\n QT_WA({\n TCHAR *resourceName = MAKEINTRESOURCEW(resource);\n hExe = BeginUpdateResourceW((TCHAR*)applicationName.utf16(), false);\n if (hExe == 0) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not open file.\").arg(applicationName);\n return false;\n }\n if (!UpdateResourceW(hExe,L\"TYPELIB\",resourceName,0,(void*)data.data(),data.count())) {\n EndUpdateResource(hExe, true);\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not update file.\").arg(applicationName);\n return false;\n }\n }, {\n char *resourceName = MAKEINTRESOURCEA(resource);\n hExe = BeginUpdateResourceA(applicationName.toLocal8Bit(), false);\n if (hExe == 0) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not open file.\").arg(applicationName);\n return false;\n }\n if (!UpdateResourceA(hExe,\"TYPELIB\",resourceName,0,(void*)data.data(),data.count())) {\n EndUpdateResource(hExe, true);\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not update file.\").arg(applicationName);\n return false;\n }\n });\n \n if (!EndUpdateResource(hExe,false)) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not write file.\").arg(applicationName);\n return false;\n }\n \n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Type library attached to %1.\").arg(applicationName);\n return true;\n}\n\nstatic bool registerServer(const QString &input)\n{\n bool ok = false; \n if (input.endsWith(QLatin1String(\".exe\"))) {\n ok = runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -regserver\"));\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n typedef HRESULT(__stdcall* RegServerProc)();\n RegServerProc DllRegisterServer = (RegServerProc)GetProcAddress(hdll, \"DllRegisterServer\");\n if (!DllRegisterServer) {\n fprintf(stderr, \"Library file %s doesn't appear to be a COM library\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n ok = DllRegisterServer() == S_OK;\n }\n return ok;\n}\n\nstatic bool unregisterServer(const QString &input)\n{\n bool ok = false;\n if (input.endsWith(QLatin1String(\".exe\"))) { \n ok = runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -unregserver\"));\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n typedef HRESULT(__stdcall* RegServerProc)();\n RegServerProc DllUnregisterServer = (RegServerProc)GetProcAddress(hdll, \"DllUnregisterServer\");\n if (!DllUnregisterServer) {\n fprintf(stderr, \"Library file %s doesn't appear to be a COM library\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n ok = DllUnregisterServer() == S_OK;\n }\n return ok;\n}\n\nstatic HRESULT dumpIdl(const QString &input, const QString &idlfile, const QString &version)\n{\n HRESULT res = E_FAIL;\n \n if (input.endsWith(QLatin1String(\".exe\"))) {\n if (runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -dumpidl \") + idlfile + QLatin1String(\" -version \") + version))\n res = S_OK;\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return 3;\n }\n typedef HRESULT(__stdcall* DumpIDLProc)(const QString&, const QString&);\n DumpIDLProc DumpIDL = (DumpIDLProc)GetProcAddress(hdll, \"DumpIDL\");\n if (!DumpIDL) {\n fprintf(stderr, \"Couldn't resolve 'DumpIDL' symbol in %s\\n\", (const char*)input.toLocal8Bit().data());\n return 3;\n }\n res = DumpIDL(idlfile, version);\n FreeLibrary(hdll);\n }\n \n return res;\n}\n\nstatic void slashify(QString &s)\n{\n if (!s.contains(QLatin1Char('\/')))\n return;\n \n int i = 0;\n while (i < (int)s.length()) {\n if (s[i] == QLatin1Char('\/'))\n s[i] = QLatin1Char('\\\\');\n ++i;\n }\n}\n\nint runIdc(int argc, char **argv)\n{\n QString error;\n QString tlbfile;\n QString idlfile;\n QString input;\n QString version = QLatin1String(\"1.0\");\n \n int i = 1;\n while (i < argc) {\n QString p = QString::fromLocal8Bit(argv[i]).toLower();\n \n if (p == QLatin1String(\"\/idl\") || p == QLatin1String(\"-idl\")) {\n ++i;\n if (i > argc) {\n error = QLatin1String(\"Missing name for interface definition file!\");\n break;\n }\n idlfile = QLatin1String(argv[i]);\n idlfile = idlfile.trimmed().toLower(); \n } else if (p == QLatin1String(\"\/version\") || p == QLatin1String(\"-version\")) {\n ++i;\n if (i > argc)\n version = QLatin1String(\"1.0\");\n else\n version = QLatin1String(argv[i]);\n } else if (p == QLatin1String(\"\/tlb\") || p == QLatin1String(\"-tlb\")) {\n if (QSysInfo::WindowsVersion & QSysInfo::WV_DOS_based)\n fprintf(stderr, \"IDC requires Windows NT\/2000\/XP!\\n\");\n \n ++i;\n if (i > argc) {\n error = QLatin1String(\"Missing name for type library file!\");\n break;\n }\n tlbfile = QLatin1String(argv[i]);\n tlbfile = tlbfile.trimmed().toLower(); \n } else if (p == QLatin1String(\"\/v\") || p == QLatin1String(\"-v\")) {\n fprintf(stdout, \"Qt Interface Definition Compiler version 1.0\\n\");\n return 0;\n } else if (p == QLatin1String(\"\/regserver\") || p == QLatin1String(\"-regserver\")) {\n if (!registerServer(input)) {\n fprintf(stderr, \"Failed to register server!\\n\");\n return 1;\n }\n fprintf(stderr, \"Server registered successfully!\\n\");\n return 0;\n } else if (p == QLatin1String(\"\/unregserver\") || p == QLatin1String(\"-unregserver\")) {\n if (!unregisterServer(input)) {\n fprintf(stderr, \"Failed to unregister server!\\n\");\n return 1;\n }\n fprintf(stderr, \"Server unregistered successfully!\\n\");\n return 0;\n } else if (p[0] == QLatin1Char('\/') || p[0] == QLatin1Char('-')) {\n error = QLatin1String(\"Unknown option \\\"\") + p + QLatin1Char('\\\"');\n break;\n } else {\n input = QLatin1String(argv[i]);\n input = input.trimmed().toLower(); \n }\n i++;\n }\n if (!error.isEmpty()) {\n fprintf(stderr, \"%s\", error.toLatin1().data());\n fprintf(stderr, \"\\n\");\n return 5;\n }\n if (input.isEmpty()) {\n fprintf(stderr, \"No input file specified!\\n\");\n return 1;\n }\n if (input.endsWith(QLatin1String(\".exe\")) && tlbfile.isEmpty() && idlfile.isEmpty()) {\n fprintf(stderr, \"No type output file specified!\\n\");\n return 2;\n }\n if (input.endsWith(QLatin1String(\".dll\")) && idlfile.isEmpty() && tlbfile.isEmpty()) {\n fprintf(stderr, \"No interface definition file and no type library file specified!\\n\");\n return 3;\n }\n slashify(input);\n if (!tlbfile.isEmpty()) {\n slashify(tlbfile);\n QFile file(tlbfile);\n if (!file.open(QIODevice::ReadOnly)) {\n fprintf(stderr, \"Couldn't open %s for read\\n\", (const char*)tlbfile.toLocal8Bit().data());\n return 4;\n }\n QByteArray data = file.readAll();\n QString error;\n bool ok = attachTypeLibrary(input, 1, data, &error);\n fprintf(stderr, \"%s\", error.toLatin1().data());\n fprintf(stderr, \"\\n\");\n return ok ? 0 : 4;\n } else if (!idlfile.isEmpty()) {\n slashify(idlfile);\n idlfile = quotePath(idlfile);\n fprintf(stderr, \"\\n\\n%s\\n\\n\", (const char*)idlfile.toLocal8Bit().data());\n quotePath(input);\n HRESULT res = dumpIdl(input, idlfile, version);\n \n switch(res) {\n case S_OK:\n break;\n case -1:\n fprintf(stderr, \"Couldn't open %s for writing!\\n\", (const char*)idlfile.toLocal8Bit().data());\n return res;\n case 1:\n fprintf(stderr, \"Malformed appID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 2:\n fprintf(stderr, \"Malformed typeLibID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 3:\n fprintf(stderr, \"Class has no metaobject information (error in %s)!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 4:\n fprintf(stderr, \"Malformed classID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 5:\n fprintf(stderr, \"Malformed interfaceID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 6:\n fprintf(stderr, \"Malformed eventsID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n \n default:\n fprintf(stderr, \"Unknown error writing IDL from %s\\n\", (const char*)input.toLocal8Bit().data());\n return 7;\n }\n }\n return 0;\n}\n\nQT_END_NAMESPACE\n\nint main(int argc, char **argv)\n{\n return QT_PREPEND_NAMESPACE(runIdc)(argc, argv);\n}\n<commit_msg>Add detailed warning when idc fails.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the tools applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QFile>\n#include <QSysInfo>\n#include <QProcess>\n#include <QLibraryInfo>\n#include <qt_windows.h>\n#include <io.h>\n\nQT_BEGIN_NAMESPACE\n\nstatic QString quotePath(const QString &s)\n{\n if (!s.startsWith(QLatin1Char('\\\"')) && s.contains(QLatin1Char(' ')))\n return QLatin1Char('\\\"') + s + QLatin1Char('\\\"');\n return s;\n}\n\n\nstatic bool runWithQtInEnvironment(const QString &cmd)\n{\n QProcess proc;\n \n \/\/ prepend the qt binary directory to the path\n QStringList env = QProcess::systemEnvironment();\n for (int i=0; i<env.count(); ++i) {\n QString var = env.at(i);\n int setidx = var.indexOf(QLatin1Char('='));\n if (setidx != -1) {\n QString varname = var.left(setidx).trimmed().toUpper();\n if (varname == QLatin1String(\"PATH\")) {\n var = var.mid(setidx + 1);\n var = QLatin1String(\"PATH=\") + \n QLibraryInfo::location(QLibraryInfo::BinariesPath) +\n QLatin1Char(';') + var;\n env[i] = var;\n break;\n }\n }\n }\n\n proc.setEnvironment(env);\n proc.start(cmd);\n proc.waitForFinished(-1);\n \n return (proc.exitCode() == 0);\n}\n\nstatic bool attachTypeLibrary(const QString &applicationName, int resource, const QByteArray &data, QString *errorMessage)\n{\n HANDLE hExe = 0;\n QT_WA({\n TCHAR *resourceName = MAKEINTRESOURCEW(resource);\n hExe = BeginUpdateResourceW((TCHAR*)applicationName.utf16(), false);\n if (hExe == 0) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not open file.\").arg(applicationName);\n return false;\n }\n if (!UpdateResourceW(hExe,L\"TYPELIB\",resourceName,0,(void*)data.data(),data.count())) {\n EndUpdateResource(hExe, true);\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not update file.\").arg(applicationName);\n return false;\n }\n }, {\n char *resourceName = MAKEINTRESOURCEA(resource);\n hExe = BeginUpdateResourceA(applicationName.toLocal8Bit(), false);\n if (hExe == 0) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not open file.\").arg(applicationName);\n return false;\n }\n if (!UpdateResourceA(hExe,\"TYPELIB\",resourceName,0,(void*)data.data(),data.count())) {\n EndUpdateResource(hExe, true);\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not update file.\").arg(applicationName);\n return false;\n }\n });\n \n if (!EndUpdateResource(hExe,false)) {\n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Failed to attach type library to binary %1 - could not write file.\").arg(applicationName);\n return false;\n }\n \n if (errorMessage)\n *errorMessage = QString::fromLatin1(\"Type library attached to %1.\").arg(applicationName);\n return true;\n}\n\nstatic bool registerServer(const QString &input)\n{\n bool ok = false; \n if (input.endsWith(QLatin1String(\".exe\"))) {\n ok = runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -regserver\"));\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n typedef HRESULT(__stdcall* RegServerProc)();\n RegServerProc DllRegisterServer = (RegServerProc)GetProcAddress(hdll, \"DllRegisterServer\");\n if (!DllRegisterServer) {\n fprintf(stderr, \"Library file %s doesn't appear to be a COM library\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n ok = DllRegisterServer() == S_OK;\n }\n return ok;\n}\n\nstatic bool unregisterServer(const QString &input)\n{\n bool ok = false;\n if (input.endsWith(QLatin1String(\".exe\"))) { \n ok = runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -unregserver\"));\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n typedef HRESULT(__stdcall* RegServerProc)();\n RegServerProc DllUnregisterServer = (RegServerProc)GetProcAddress(hdll, \"DllUnregisterServer\");\n if (!DllUnregisterServer) {\n fprintf(stderr, \"Library file %s doesn't appear to be a COM library\\n\", (const char*)input.toLocal8Bit().data());\n return false;\n }\n ok = DllUnregisterServer() == S_OK;\n }\n return ok;\n}\n\nstatic HRESULT dumpIdl(const QString &input, const QString &idlfile, const QString &version)\n{\n HRESULT res = E_FAIL;\n \n if (input.endsWith(QLatin1String(\".exe\"))) {\n if (runWithQtInEnvironment(quotePath(input) + QLatin1String(\" -dumpidl \") + idlfile + QLatin1String(\" -version \") + version))\n res = S_OK;\n } else {\n HMODULE hdll = 0;\n QT_WA({\n hdll = LoadLibraryW((TCHAR*)input.utf16());\n }, {\n hdll = LoadLibraryA(input.toLocal8Bit());\n });\n if (!hdll) {\n fprintf(stderr, \"Couldn't load library file %s\\n\", (const char*)input.toLocal8Bit().data());\n return 3;\n }\n typedef HRESULT(__stdcall* DumpIDLProc)(const QString&, const QString&);\n DumpIDLProc DumpIDL = (DumpIDLProc)GetProcAddress(hdll, \"DumpIDL\");\n if (!DumpIDL) {\n fprintf(stderr, \"Couldn't resolve 'DumpIDL' symbol in %s\\n\", (const char*)input.toLocal8Bit().data());\n return 3;\n }\n res = DumpIDL(idlfile, version);\n FreeLibrary(hdll);\n }\n \n return res;\n}\n\nstatic void slashify(QString &s)\n{\n if (!s.contains(QLatin1Char('\/')))\n return;\n \n int i = 0;\n while (i < (int)s.length()) {\n if (s[i] == QLatin1Char('\/'))\n s[i] = QLatin1Char('\\\\');\n ++i;\n }\n}\n\nint runIdc(int argc, char **argv)\n{\n QString error;\n QString tlbfile;\n QString idlfile;\n QString input;\n QString version = QLatin1String(\"1.0\");\n \n int i = 1;\n while (i < argc) {\n QString p = QString::fromLocal8Bit(argv[i]).toLower();\n \n if (p == QLatin1String(\"\/idl\") || p == QLatin1String(\"-idl\")) {\n ++i;\n if (i > argc) {\n error = QLatin1String(\"Missing name for interface definition file!\");\n break;\n }\n idlfile = QLatin1String(argv[i]);\n idlfile = idlfile.trimmed().toLower(); \n } else if (p == QLatin1String(\"\/version\") || p == QLatin1String(\"-version\")) {\n ++i;\n if (i > argc)\n version = QLatin1String(\"1.0\");\n else\n version = QLatin1String(argv[i]);\n } else if (p == QLatin1String(\"\/tlb\") || p == QLatin1String(\"-tlb\")) {\n if (QSysInfo::WindowsVersion & QSysInfo::WV_DOS_based)\n fprintf(stderr, \"IDC requires Windows NT\/2000\/XP!\\n\");\n \n ++i;\n if (i > argc) {\n error = QLatin1String(\"Missing name for type library file!\");\n break;\n }\n tlbfile = QLatin1String(argv[i]);\n tlbfile = tlbfile.trimmed().toLower(); \n } else if (p == QLatin1String(\"\/v\") || p == QLatin1String(\"-v\")) {\n fprintf(stdout, \"Qt Interface Definition Compiler version 1.0\\n\");\n return 0;\n } else if (p == QLatin1String(\"\/regserver\") || p == QLatin1String(\"-regserver\")) {\n if (!registerServer(input)) {\n fprintf(stderr, \"Failed to register server!\\n\");\n return 1;\n }\n fprintf(stderr, \"Server registered successfully!\\n\");\n return 0;\n } else if (p == QLatin1String(\"\/unregserver\") || p == QLatin1String(\"-unregserver\")) {\n if (!unregisterServer(input)) {\n fprintf(stderr, \"Failed to unregister server!\\n\");\n return 1;\n }\n fprintf(stderr, \"Server unregistered successfully!\\n\");\n return 0;\n } else if (p[0] == QLatin1Char('\/') || p[0] == QLatin1Char('-')) {\n error = QLatin1String(\"Unknown option \\\"\") + p + QLatin1Char('\\\"');\n break;\n } else {\n input = QLatin1String(argv[i]);\n input = input.trimmed().toLower(); \n }\n i++;\n }\n if (!error.isEmpty()) {\n fprintf(stderr, \"%s\", error.toLatin1().data());\n fprintf(stderr, \"\\n\");\n return 5;\n }\n if (input.isEmpty()) {\n fprintf(stderr, \"No input file specified!\\n\");\n return 1;\n }\n if (input.endsWith(QLatin1String(\".exe\")) && tlbfile.isEmpty() && idlfile.isEmpty()) {\n fprintf(stderr, \"No type output file specified!\\n\");\n return 2;\n }\n if (input.endsWith(QLatin1String(\".dll\")) && idlfile.isEmpty() && tlbfile.isEmpty()) {\n fprintf(stderr, \"No interface definition file and no type library file specified!\\n\");\n return 3;\n }\n slashify(input);\n if (!tlbfile.isEmpty()) {\n slashify(tlbfile);\n QFile file(tlbfile);\n if (!file.open(QIODevice::ReadOnly)) {\n fprintf(stderr, \"Couldn't open %s for read\\n\", (const char*)tlbfile.toLocal8Bit().data());\n return 4;\n }\n QByteArray data = file.readAll();\n QString error;\n bool ok = attachTypeLibrary(input, 1, data, &error);\n fprintf(stderr, \"%s\", error.toLatin1().data());\n fprintf(stderr, \"\\n\");\n return ok ? 0 : 4;\n } else if (!idlfile.isEmpty()) {\n slashify(idlfile);\n idlfile = quotePath(idlfile);\n fprintf(stderr, \"\\n\\n%s\\n\\n\", (const char*)idlfile.toLocal8Bit().data());\n quotePath(input);\n HRESULT res = dumpIdl(input, idlfile, version);\n \n switch(res) {\n case S_OK:\n break;\n case E_FAIL:\n fprintf(stderr, \"IDL generation failed trying to run program %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case -1:\n fprintf(stderr, \"Couldn't open %s for writing!\\n\", (const char*)idlfile.toLocal8Bit().data());\n return res;\n case 1:\n fprintf(stderr, \"Malformed appID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 2:\n fprintf(stderr, \"Malformed typeLibID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 3:\n fprintf(stderr, \"Class has no metaobject information (error in %s)!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 4:\n fprintf(stderr, \"Malformed classID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 5:\n fprintf(stderr, \"Malformed interfaceID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n case 6:\n fprintf(stderr, \"Malformed eventsID value in %s!\\n\", (const char*)input.toLocal8Bit().data());\n return res;\n \n default:\n fprintf(stderr, \"Unknown error writing IDL from %s\\n\", (const char*)input.toLocal8Bit().data());\n return 7;\n }\n }\n return 0;\n}\n\nQT_END_NAMESPACE\n\nint main(int argc, char **argv)\n{\n return QT_PREPEND_NAMESPACE(runIdc)(argc, argv);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n#define NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n\n#include <v8.h>\n#include <node.h>\n\n#include <libtorrent\/torrent_handle.hpp>\n\n\nnamespace nodelt {\n class TorrentHandleWrap: public node::ObjectWrap {\n public:\n static void Initialize(v8::Handle<v8::Object> target);\n static v8::Local<v8::Object> New(const libtorrent::torrent_handle& th);\n static libtorrent::torrent_handle* Unwrap(const v8::Local<v8::Object>& obj) {\n return node::ObjectWrap::Unwrap<TorrentHandleWrap>(obj)->obj_;\n };\n\n private:\n libtorrent::torrent_handle* obj_;\n TorrentHandleWrap();\n ~TorrentHandleWrap();\n static v8::Persistent<v8::Function> constructor;\n static v8::Handle<v8::Value> NewInstance(const v8::Arguments& args);\n\n static v8::Handle<v8::Value> get_peer_info(const v8::Arguments& args);\n static v8::Handle<v8::Value> status(const v8::Arguments& args);\n static v8::Handle<v8::Value> get_download_queue(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_progress(const v8::Arguments& args);\n static v8::Handle<v8::Value> trackers(const v8::Arguments& args);\n static v8::Handle<v8::Value> replace_trackers(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_tracker(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_url_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> remove_url_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> url_seeds(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_http_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> remove_http_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> http_seeds(const v8::Arguments& args);\n static v8::Handle<v8::Value> get_torrent_info(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_metadata(const v8::Arguments& args);\n static v8::Handle<v8::Value> is_valid(const v8::Arguments& args);\n static v8::Handle<v8::Value> pause(const v8::Arguments& args);\n static v8::Handle<v8::Value> resume(const v8::Arguments& args);\n static v8::Handle<v8::Value> clear_error(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> super_seeding(const v8::Arguments& args);\n\n static v8::Handle<v8::Value> auto_managed(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_up(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_down(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_top(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_bottom(const v8::Arguments& args);\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n static v8::Handle<v8::Value> resolve_countries(const v8::Arguments& args);\n#endif\n\n static v8::Handle<v8::Value> add_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> read_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> have_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_piece_deadline(const v8::Arguments& args);\n static v8::Handle<v8::Value> reset_piece_deadline(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_availability(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> prioritize_pieces(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_priorities(const v8::Arguments& args);\n static v8::Handle<v8::Value> prioritize_files(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_priorities(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> use_interface(const v8::Arguments& args);\n static v8::Handle<v8::Value> save_resume_data(const v8::Arguments& args);\n static v8::Handle<v8::Value> need_save_resume_data(const v8::Arguments& args);\n static v8::Handle<v8::Value> force_reannounce(const v8::Arguments& args);\n#ifndef TORRENT_DISABLE_DHT\n static v8::Handle<v8::Value> force_dht_announce(const v8::Arguments& args);\n#endif\n static v8::Handle<v8::Value> scrape_tracker(const v8::Arguments& args);\n static v8::Handle<v8::Value> name(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_upload_mode(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_share_mode(const v8::Arguments& args);\n static v8::Handle<v8::Value> flush_cache(const v8::Arguments& args);\n static v8::Handle<v8::Value> apply_ip_filter(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_upload_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> upload_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_download_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> download_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_sequential_download(const v8::Arguments& args);\n static v8::Handle<v8::Value> connect_peer(const v8::Arguments& args);\n static v8::Handle<v8::Value> save_path(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_max_uploads(const v8::Arguments& args);\n static v8::Handle<v8::Value> max_uploads(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_max_connections(const v8::Arguments& args);\n static v8::Handle<v8::Value> max_connections(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_tracker_login(const v8::Arguments& args);\n static v8::Handle<v8::Value> move_storage(const v8::Arguments& args);\n static v8::Handle<v8::Value> info_hash(const v8::Arguments& args);\n static v8::Handle<v8::Value> force_recheck(const v8::Arguments& args);\n static v8::Handle<v8::Value> rename_file(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_ssl_certificate(const v8::Arguments& args);\n };\n};\n\n#endif \/\/ NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n<commit_msg>added has_metadata function<commit_after>#ifndef NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n#define NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n\n#include <v8.h>\n#include <node.h>\n\n#include <libtorrent\/torrent_handle.hpp>\n\n\nnamespace nodelt {\n class TorrentHandleWrap: public node::ObjectWrap {\n public:\n static void Initialize(v8::Handle<v8::Object> target);\n static v8::Local<v8::Object> New(const libtorrent::torrent_handle& th);\n static libtorrent::torrent_handle* Unwrap(const v8::Local<v8::Object>& obj) {\n return node::ObjectWrap::Unwrap<TorrentHandleWrap>(obj)->obj_;\n };\n\n private:\n libtorrent::torrent_handle* obj_;\n TorrentHandleWrap();\n ~TorrentHandleWrap();\n static v8::Persistent<v8::Function> constructor;\n static v8::Handle<v8::Value> NewInstance(const v8::Arguments& args);\n\n static v8::Handle<v8::Value> get_peer_info(const v8::Arguments& args);\n static v8::Handle<v8::Value> status(const v8::Arguments& args);\n static v8::Handle<v8::Value> get_download_queue(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_progress(const v8::Arguments& args);\n static v8::Handle<v8::Value> trackers(const v8::Arguments& args);\n static v8::Handle<v8::Value> replace_trackers(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_tracker(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_url_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> remove_url_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> url_seeds(const v8::Arguments& args);\n static v8::Handle<v8::Value> add_http_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> remove_http_seed(const v8::Arguments& args);\n static v8::Handle<v8::Value> http_seeds(const v8::Arguments& args);\n static v8::Handle<v8::Value> get_torrent_info(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_metadata(const v8::Arguments& args);\n static v8::Handle<v8::Value> is_valid(const v8::Arguments& args);\n static v8::Handle<v8::Value> has_metadata(const v8::Arguments& args);\n static v8::Handle<v8::Value> pause(const v8::Arguments& args);\n static v8::Handle<v8::Value> resume(const v8::Arguments& args);\n static v8::Handle<v8::Value> clear_error(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> super_seeding(const v8::Arguments& args);\n\n static v8::Handle<v8::Value> auto_managed(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_up(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_down(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_top(const v8::Arguments& args);\n static v8::Handle<v8::Value> queue_position_bottom(const v8::Arguments& args);\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n static v8::Handle<v8::Value> resolve_countries(const v8::Arguments& args);\n#endif\n\n static v8::Handle<v8::Value> add_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> read_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> have_piece(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_piece_deadline(const v8::Arguments& args);\n static v8::Handle<v8::Value> reset_piece_deadline(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_availability(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> prioritize_pieces(const v8::Arguments& args);\n static v8::Handle<v8::Value> piece_priorities(const v8::Arguments& args);\n static v8::Handle<v8::Value> prioritize_files(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_priorities(const v8::Arguments& args);\n static v8::Handle<v8::Value> file_priority(const v8::Arguments& args);\n static v8::Handle<v8::Value> use_interface(const v8::Arguments& args);\n static v8::Handle<v8::Value> save_resume_data(const v8::Arguments& args);\n static v8::Handle<v8::Value> need_save_resume_data(const v8::Arguments& args);\n static v8::Handle<v8::Value> force_reannounce(const v8::Arguments& args);\n#ifndef TORRENT_DISABLE_DHT\n static v8::Handle<v8::Value> force_dht_announce(const v8::Arguments& args);\n#endif\n static v8::Handle<v8::Value> scrape_tracker(const v8::Arguments& args);\n static v8::Handle<v8::Value> name(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_upload_mode(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_share_mode(const v8::Arguments& args);\n static v8::Handle<v8::Value> flush_cache(const v8::Arguments& args);\n static v8::Handle<v8::Value> apply_ip_filter(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_upload_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> upload_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_download_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> download_limit(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_sequential_download(const v8::Arguments& args);\n static v8::Handle<v8::Value> connect_peer(const v8::Arguments& args);\n static v8::Handle<v8::Value> save_path(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_max_uploads(const v8::Arguments& args);\n static v8::Handle<v8::Value> max_uploads(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_max_connections(const v8::Arguments& args);\n static v8::Handle<v8::Value> max_connections(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_tracker_login(const v8::Arguments& args);\n static v8::Handle<v8::Value> move_storage(const v8::Arguments& args);\n static v8::Handle<v8::Value> info_hash(const v8::Arguments& args);\n static v8::Handle<v8::Value> force_recheck(const v8::Arguments& args);\n static v8::Handle<v8::Value> rename_file(const v8::Arguments& args);\n static v8::Handle<v8::Value> set_ssl_certificate(const v8::Arguments& args);\n };\n};\n\n#endif \/\/ NODE_LIBTORRENT_TORRENT_HANDLE_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"CSingleton.hpp\"\n#include \"types.hpp\"\n\n#include <string>\n#include <atomic>\n\n#include <json.hpp>\n\n\nusing json = nlohmann::json;\n\n\nclass Role\n{\npublic:\n\tRole(RoleId_t pawn_id, json &data);\n\t~Role() = default;\n\nprivate:\n\tconst RoleId_t m_PawnId;\n\n\tSnowflake_t m_Id;\n\n\tstd::string m_Name;\n\tint m_Color;\n\tbool m_Hoist;\n\tunsigned long long int m_Permissions;\n\tbool m_Mentionable;\n\n\tbool _valid = false;\n\npublic:\n\tinline RoleId_t GetPawnId() const\n\t{\n\t\treturn m_PawnId;\n\t}\n\tinline Snowflake_t const &GetId() const\n\t{\n\t\treturn m_Id;\n\t}\n\tinline std::string const &GetName() const\n\t{\n\t\treturn m_Name;\n\t}\n\tinline int GetColor() const\n\t{\n\t\treturn m_Color;\n\t}\n\tinline bool IsHoist() const\n\t{\n\t\treturn m_Hoist;\n\t}\n\tinline decltype(m_Permissions) GetPermissions() const\n\t{\n\t\treturn m_Permissions;\n\t}\n\tinline bool IsMentionable() const\n\t{\n\t\treturn m_Mentionable;\n\t}\n\n\tinline bool IsValid() const\n\t{\n\t\treturn _valid;\n\t}\n\tinline operator bool() const\n\t{\n\t\treturn IsValid();\n\t}\n\n\tvoid Update(json &data);\n};\n\n\nclass RoleManager : public CSingleton<RoleManager>\n{\n\tfriend class CSingleton<RoleManager>;\nprivate:\n\tRoleManager() = default;\n\t~RoleManager() = default;\n\nprivate:\n\tconst unsigned int m_InitValue = 1;\n\tstd::atomic<unsigned int> m_Initialized{ 0 };\n\n\tstd::map<RoleId_t, Role_t> m_Roles; \/\/PAWN role-id to actual channel map\n\npublic:\n\tRoleId_t AddRole(json &data);\n\tvoid RemoveRole(Role_t const &role);\n\n\tRole_t const &FindRole(RoleId_t id);\n\tRole_t const &FindRoleById(Snowflake_t const &sfid);\n};\n<commit_msg>fix color datatype<commit_after>#pragma once\n\n#include \"CSingleton.hpp\"\n#include \"types.hpp\"\n\n#include <string>\n#include <atomic>\n\n#include <json.hpp>\n\n\nusing json = nlohmann::json;\n\n\nclass Role\n{\npublic:\n\tRole(RoleId_t pawn_id, json &data);\n\t~Role() = default;\n\nprivate:\n\tconst RoleId_t m_PawnId;\n\n\tSnowflake_t m_Id;\n\n\tstd::string m_Name;\n\tunsigned int m_Color;\n\tbool m_Hoist;\n\tunsigned long long int m_Permissions;\n\tbool m_Mentionable;\n\n\tbool _valid = false;\n\npublic:\n\tinline RoleId_t GetPawnId() const\n\t{\n\t\treturn m_PawnId;\n\t}\n\tinline Snowflake_t const &GetId() const\n\t{\n\t\treturn m_Id;\n\t}\n\tinline std::string const &GetName() const\n\t{\n\t\treturn m_Name;\n\t}\n\tinline unsigned int GetColor() const\n\t{\n\t\treturn m_Color;\n\t}\n\tinline bool IsHoist() const\n\t{\n\t\treturn m_Hoist;\n\t}\n\tinline decltype(m_Permissions) GetPermissions() const\n\t{\n\t\treturn m_Permissions;\n\t}\n\tinline bool IsMentionable() const\n\t{\n\t\treturn m_Mentionable;\n\t}\n\n\tinline bool IsValid() const\n\t{\n\t\treturn _valid;\n\t}\n\tinline operator bool() const\n\t{\n\t\treturn IsValid();\n\t}\n\n\tvoid Update(json &data);\n};\n\n\nclass RoleManager : public CSingleton<RoleManager>\n{\n\tfriend class CSingleton<RoleManager>;\nprivate:\n\tRoleManager() = default;\n\t~RoleManager() = default;\n\nprivate:\n\tconst unsigned int m_InitValue = 1;\n\tstd::atomic<unsigned int> m_Initialized{ 0 };\n\n\tstd::map<RoleId_t, Role_t> m_Roles; \/\/PAWN role-id to actual channel map\n\npublic:\n\tRoleId_t AddRole(json &data);\n\tvoid RemoveRole(Role_t const &role);\n\n\tRole_t const &FindRole(RoleId_t id);\n\tRole_t const &FindRoleById(Snowflake_t const &sfid);\n};\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/ipmi\/ipmifru.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2014,2018 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n#ifndef __IPMI_IPMIFRU_H\n#define __IPMI_IMPIFRU_H\n\n\/**\n * @file ipmifru.H\n * @brief IPMI FRU inventory declariation\n *\/\n\n#include <stdint.h>\n#include <ipmi\/ipmiif.H>\n#include \"ipmibt.H\"\n#include <console\/consoleif.H>\n\n\n\/**\n *\n *\n *\/\nnamespace IPMIFRU\n{\n void writeData(uint8_t i_deviceId, uint8_t *i_data,\n uint32_t i_dataSize, uint32_t i_offset = 0);\n\n \/*\n * @brief Read the IPMI FRU Record\n * @param[in] deviceId - The device ID to be read\n * @param[in\/out] data - The buffer pointing to the data read\n *\/\n void readData(uint8_t i_deviceId, uint8_t *io_data);\n\n enum msg_type\n {\n MSG_WRITE_FRU_DATA, \/\/ async message - no reply\n MSG_READ_FRU_DATA, \/\/ sync message - has reply\n \/\/ Used to check range. Leave as last.\n MSG_LAST_TYPE = MSG_READ_FRU_DATA,\n };\n enum record_info\n {\n MAX_RECORD_SIZE = 256,\n };\n}\n\n\nclass IpmiFRU\n{\n public:\n\n \/**\n * Thread start routine for the resource provider\n * @param[in] void*, unused\n *\/\n static void* start(void* unused);\n\n \/**\n * Default constructor\n *\/\n IpmiFRU(void);\n\n \/**\n * Destructor\n *\/\n ~IpmiFRU(void);\n\n \/**\n * @brief Get the message queue associated with this FRU\n * @param[in] void\n * @return, a msg_q_t which is the message queue\n *\/\n inline msg_q_t msgQueue(void) const\n { return iv_msgQ; }\n\n private:\n\n \/**\n * Entry point for the fru ipmi thread\n *\/\n void execute(void);\n\n \/**\n * @brief Handle a message with fru inventory data; msg is async\n * @param[in] i_msg\n *\/\n void sendWriteFruData(msg_t *i_msg);\n\n \/**\n * @brief Handle a message with fru inventory data; msg is sync\n * #param[in] i_msg\n *\/\n void sendReadFruData(msg_t *i_msg);\n\n\n \/**\n * ipmi fru msg queue\n *\/\n msg_q_t iv_msgQ;\n\n \/\/ Disallow copying this class.\n IpmiFRU& operator=(const IpmiFRU&);\n IpmiFRU(const IpmiFRU&);\n};\n\n#endif\n<commit_msg>ipmi: Drop unnecessary ipmibt dependency from ipmifru<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/ipmi\/ipmifru.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2014,2018 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n#ifndef __IPMI_IPMIFRU_H\n#define __IPMI_IMPIFRU_H\n\n\/**\n * @file ipmifru.H\n * @brief IPMI FRU inventory declariation\n *\/\n\n#include <stdint.h>\n#include <ipmi\/ipmiif.H>\n#include <console\/consoleif.H>\n\n\n\/**\n *\n *\n *\/\nnamespace IPMIFRU\n{\n void writeData(uint8_t i_deviceId, uint8_t *i_data,\n uint32_t i_dataSize, uint32_t i_offset = 0);\n\n \/*\n * @brief Read the IPMI FRU Record\n * @param[in] deviceId - The device ID to be read\n * @param[in\/out] data - The buffer pointing to the data read\n *\/\n void readData(uint8_t i_deviceId, uint8_t *io_data);\n\n enum msg_type\n {\n MSG_WRITE_FRU_DATA, \/\/ async message - no reply\n MSG_READ_FRU_DATA, \/\/ sync message - has reply\n \/\/ Used to check range. Leave as last.\n MSG_LAST_TYPE = MSG_READ_FRU_DATA,\n };\n enum record_info\n {\n MAX_RECORD_SIZE = 256,\n };\n}\n\n\nclass IpmiFRU\n{\n public:\n\n \/**\n * Thread start routine for the resource provider\n * @param[in] void*, unused\n *\/\n static void* start(void* unused);\n\n \/**\n * Default constructor\n *\/\n IpmiFRU(void);\n\n \/**\n * Destructor\n *\/\n ~IpmiFRU(void);\n\n \/**\n * @brief Get the message queue associated with this FRU\n * @param[in] void\n * @return, a msg_q_t which is the message queue\n *\/\n inline msg_q_t msgQueue(void) const\n { return iv_msgQ; }\n\n private:\n\n \/**\n * Entry point for the fru ipmi thread\n *\/\n void execute(void);\n\n \/**\n * @brief Handle a message with fru inventory data; msg is async\n * @param[in] i_msg\n *\/\n void sendWriteFruData(msg_t *i_msg);\n\n \/**\n * @brief Handle a message with fru inventory data; msg is sync\n * #param[in] i_msg\n *\/\n void sendReadFruData(msg_t *i_msg);\n\n\n \/**\n * ipmi fru msg queue\n *\/\n msg_q_t iv_msgQ;\n\n \/\/ Disallow copying this class.\n IpmiFRU& operator=(const IpmiFRU&);\n IpmiFRU(const IpmiFRU&);\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef WARPED_UTILITY_MEMORY_HPP\n#define WARPED_UTILITY_MEMORY_HPP\n\n#include <memory>\n#include <utility>\n\nnamespace warped {\n\n\/\/ This is a back-port of C++14's std::make_unique<> to C++11 taken from from\n\/\/ http:\/\/herbsutter.com\/gotw\/_102\/. Once C++14 becomes standard, remove this\n\/\/ function and replace any usage of it with the std version.\n\ntemplate<typename T, typename ...Args>\ntypename std::enable_if <!std::is_array<T>::value, std::unique_ptr<T>>::type\nmake_unique(Args&& ...args) {\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\n}\n\ntemplate <typename T>\ntypename std::enable_if <std::is_array<T>::value, std::unique_ptr<T>>::type\nmake_unique(std::size_t n) {\n typedef typename std::remove_extent<T>::type RT;\n return std::unique_ptr<T>(new RT[n]);\n}\n\ntemplate <class T_SRC, class T_DEST>\nstd::unique_ptr<T_DEST> unique_cast(std::unique_ptr<T_SRC> &&src)\n{\n if (!src) return std::unique_ptr<T_DEST>();\n\n \/\/ Throws a std::bad_cast() if this doesn't work out\n T_DEST *dest_ptr = &dynamic_cast<T_DEST &>(*src.get());\n\n src.release();\n std::unique_ptr<T_DEST> ret(dest_ptr);\n return ret;\n}\n\n} \/\/ namespace warped\n\n#endif\n<commit_msg>added a compiler flag to resolve conflicts for make_unique, which comes as a standard in C++14<commit_after>#ifndef WARPED_UTILITY_MEMORY_HPP\n#define WARPED_UTILITY_MEMORY_HPP\n\n#include <memory>\n#include <utility>\n\nnamespace warped {\n\n\/\/ This is a back-port of C++14's std::make_unique<> to C++11 taken from from\n\/\/ http:\/\/herbsutter.com\/gotw\/_102\/. Once C++14 becomes standard, remove this\n\/\/ function and replace any usage of it with the std version.\n\n#ifdef __cpp_lib_make_unique\nusing std::make_unique;\n#else\ntemplate<typename T, typename ...Args>\ntypename std::enable_if <!std::is_array<T>::value, std::unique_ptr<T>>::type\nmake_unique(Args&& ...args) {\n return std::unique_ptr<T>(new T(std::forward<Args>(args)...));\n}\n#endif\n\ntemplate <typename T>\ntypename std::enable_if <std::is_array<T>::value, std::unique_ptr<T>>::type\nmake_unique(std::size_t n) {\n typedef typename std::remove_extent<T>::type RT;\n return std::unique_ptr<T>(new RT[n]);\n}\n\ntemplate <class T_SRC, class T_DEST>\nstd::unique_ptr<T_DEST> unique_cast(std::unique_ptr<T_SRC> &&src)\n{\n if (!src) return std::unique_ptr<T_DEST>();\n\n \/\/ Throws a std::bad_cast() if this doesn't work out\n T_DEST *dest_ptr = &dynamic_cast<T_DEST &>(*src.get());\n\n src.release();\n std::unique_ptr<T_DEST> ret(dest_ptr);\n return ret;\n}\n\n} \/\/ namespace warped\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <string>\n#include <exception>\n\n#include \"config.hpp\"\n\nnamespace utki{\n\n\/**\n * @brief Basic exception class\n *\/\nclass exception : public std::exception{\n\tstd::string message;\npublic:\n\t\/**\n\t * @brief Constructor.\n\t * @param message - human friendly error description.\n\t *\/\n\texception(const std::string& message = std::string()) :\n\t\t\tmessage(message)\n\t{}\n\n\tvirtual ~exception()noexcept{}\n\n\t\/**\n\t * @brief Returns a pointer to exception message.\n\t * @return a pointer to objects internal memory buffer holding\n\t * the exception message null-terminated string.\n\t * Note, that after the exception object is destroyed\n\t * the pointer returned by this method become invalid.\n\t *\/\n\tconst char *what()const noexcept override{\n\t\treturn this->message.c_str();\n\t}\n};\n\n\/**\n * @brief Basic exception class for \"object not found\" errors.\n *\/\nclass not_found : public exception{\npublic:\n\tnot_found(const std::string& message) :\n\t\t\texception(message)\n\t{}\n};\n\n\/**\n * @brief Basic exception class for \"invalid state\" errors.\n *\/\nclass invalid_state : public exception{\npublic:\n\tinvalid_state(const std::string& message) :\n\t\t\texception(message)\n\t{}\n};\n\n\/\/ TODO: deprecated, remove.\ntypedef invalid_state illegal_state;\n\n}\n<commit_msg>use std::logic_error and std::runtime_error as base classes for exceptions<commit_after>#pragma once\n\n#include <string>\n#include <exception>\n#include <stdexcept>\n\n#include \"config.hpp\"\n\nnamespace utki{\n\n\/**\n * @brief Basic exception class\n *\/\nclass exception : public std::exception{\n\tstd::string message;\npublic:\n\t\/**\n\t * @brief Constructor.\n\t * @param message - human friendly error description.\n\t *\/\n\texception(const std::string& message = std::string()) :\n\t\t\tmessage(message)\n\t{}\n\n\tvirtual ~exception()noexcept{}\n\n\t\/**\n\t * @brief Returns a pointer to exception message.\n\t * @return a pointer to objects internal memory buffer holding\n\t * the exception message null-terminated string.\n\t * Note, that after the exception object is destroyed\n\t * the pointer returned by this method become invalid.\n\t *\/\n\tconst char *what()const noexcept override{\n\t\treturn this->message.c_str();\n\t}\n};\n\n\/**\n * @brief Basic exception class for \"object not found\" errors.\n *\/\nclass not_found : public std::runtime_error{\npublic:\n\tnot_found(const std::string& message) :\n\t\t\tstd::runtime_error(message)\n\t{}\n};\n\n\/**\n * @brief Basic exception class for \"invalid state\" errors.\n *\/\nclass invalid_state : public std::logic_error{\npublic:\n\tinvalid_state(const std::string& message) :\n\t\t\tstd::logic_error(message)\n\t{}\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <hypno_eye.h>\n\n\nHypnoEye::HypnoEye(uint8_t pin, uint8_t b) {\n\tstrip = Adafruit_NeoPixel(19, pin, NEO_GRB + NEO_KHZ800);\n\trotation = 0;\n\tbrightness = b;\n\tfor(uint8_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = strip.Color(0,0,0);\n\t}\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = strip.Color(0,0,0);\n\t}\n\tcenterLed = HypnoEye::strip.Color(0,0,0);\n\tstrip.begin();\n}\n\nHypnoEye::~HypnoEye() {\n\t\n}\n\nvoid HypnoEye::setOuterLeds(uint32_t *leds) {\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = leds[i];\n\t}\n}\n\nvoid HypnoEye::setInnerLeds(uint32_t *leds) {\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = leds[i];\n\t}\n}\n\nvoid HypnoEye::setCenterLed(uint32_t led) {\n\tcenterLed = led;\n}\n\nvoid HypnoEye::show() {\n\tstrip.setBrightness(brightness);\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\tstrip.setPixelColor(i, outerLeds[(i + 11 + rotation) % OUTER_LEDS]); \n\t}\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tstrip.setPixelColor((i+OUTER_LEDS+1), innerLeds[(i + 1 + (rotation\/2)) % INNER_LEDS]);\n\t}\n\tstrip.setPixelColor(OUTER_LEDS, centerLed);\n\tstrip.show();\n}\n\nvoid HypnoEye::rotateCW() {\n\trotation = (rotation + 1) % OUTER_LEDS;\n}\n\nvoid HypnoEye::rotateCW(uint8_t steps) {\n\trotation = (rotation + steps) % OUTER_LEDS;\n}\n\nvoid HypnoEye::rotateCCW() {\n\tif (rotation == 0) {\n\t\trotation = OUTER_LEDS - 1;\n\t} else {\n\t\trotation -= 1;\n\t}\n}\n\nvoid HypnoEye::rotateCCW(uint8_t steps) {\n\tif (rotation < steps) {\n\t\tsteps -= rotation;\n\t\trotation = OUTER_LEDS - (steps % OUTER_LEDS);\n\t} else {\n\t\trotation -= steps;\n\t}\n}\n\nvoid HypnoEye::clear() {\n\tuint32_t off = 0;\n\tthis->setAll(off);\n}\n\nvoid HypnoEye::setAll(uint32_t color) {\n\tcenterLed = color;\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = color;\n\t}\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = color;\n\t}\n}\n<commit_msg>Turn off the leds in destructor.<commit_after>#include <hypno_eye.h>\n\n\nHypnoEye::HypnoEye(uint8_t pin, uint8_t b) {\n\tstrip = Adafruit_NeoPixel(19, pin, NEO_GRB + NEO_KHZ800);\n\trotation = 0;\n\tbrightness = b;\n\tfor(uint8_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = strip.Color(0,0,0);\n\t}\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = strip.Color(0,0,0);\n\t}\n\tcenterLed = HypnoEye::strip.Color(0,0,0);\n\tstrip.begin();\n}\n\nHypnoEye::~HypnoEye() {\n\tstrip.clear();\n\tstrip.show();\n}\n\nvoid HypnoEye::setOuterLeds(uint32_t *leds) {\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = leds[i];\n\t}\n}\n\nvoid HypnoEye::setInnerLeds(uint32_t *leds) {\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = leds[i];\n\t}\n}\n\nvoid HypnoEye::setCenterLed(uint32_t led) {\n\tcenterLed = led;\n}\n\nvoid HypnoEye::show() {\n\tstrip.setBrightness(brightness);\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\tstrip.setPixelColor(i, outerLeds[(i + 11 + rotation) % OUTER_LEDS]); \n\t}\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tstrip.setPixelColor((i+OUTER_LEDS+1), innerLeds[(i + 1 + (rotation\/2)) % INNER_LEDS]);\n\t}\n\tstrip.setPixelColor(OUTER_LEDS, centerLed);\n\tstrip.show();\n}\n\nvoid HypnoEye::rotateCW() {\n\trotation = (rotation + 1) % OUTER_LEDS;\n}\n\nvoid HypnoEye::rotateCW(uint8_t steps) {\n\trotation = (rotation + steps) % OUTER_LEDS;\n}\n\nvoid HypnoEye::rotateCCW() {\n\tif (rotation == 0) {\n\t\trotation = OUTER_LEDS - 1;\n\t} else {\n\t\trotation -= 1;\n\t}\n}\n\nvoid HypnoEye::rotateCCW(uint8_t steps) {\n\tif (rotation < steps) {\n\t\tsteps -= rotation;\n\t\trotation = OUTER_LEDS - (steps % OUTER_LEDS);\n\t} else {\n\t\trotation -= steps;\n\t}\n}\n\nvoid HypnoEye::clear() {\n\tuint32_t off = 0;\n\tthis->setAll(off);\n}\n\nvoid HypnoEye::setAll(uint32_t color) {\n\tcenterLed = color;\n\tfor(size_t i = 0; i < INNER_LEDS; ++i)\n\t{\n\t\tinnerLeds[i] = color;\n\t}\n\tfor(size_t i = 0; i < OUTER_LEDS; ++i)\n\t{\n\t\touterLeds[i] = color;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <ctime>\n#ifdef _WIN32\n#define NOMINMAX\n#include <Windows.h>\n#endif\n\n#include <nstd\/Time.h>\n#ifdef _WIN32\n#include <nstd\/Debug.h>\n#endif\n\nclass Time::Private\n{\n#ifdef _WIN32\npublic:\n static int64_t perfFreq;\n static class Framework\n {\n public:\n Framework()\n {\n LARGE_INTEGER li;\n VERIFY(QueryPerformanceFrequency(&li));\n perfFreq = li.QuadPart \/ 1000000LL;\n }\n } framework;\n#endif\n};\n\n#ifdef _WIN32\n#ifdef _MSC_VER\n#pragma warning(disable: 4073) \n#pragma init_seg(lib)\nTime::Private::Framework Time::Private::framework;\n#else\nTime::Private::Framework Time::Private::framework __attribute__ ((init_priority (101)));\n#endif\nint64_t Time::Private::perfFreq;\n#endif\n\nTime::Time(bool_t utc) : utc(utc)\n{\n time_t now;\n ::time(&now);\n tm* tm = utc ? ::gmtime(&now) : ::localtime(&now);\n sec = tm->tm_sec;\n min = tm->tm_min;\n hour = tm->tm_hour;\n day = tm->tm_mday;\n month = tm->tm_mon + 1;\n year = tm->tm_year + 1900;\n wday = tm->tm_wday;\n yday = tm->tm_yday;\n dst = !!tm->tm_isdst;\n}\n\nTime::Time(int64_t time, bool_t utc) : utc(utc)\n{\n time_t now = (time_t)(time \/ 1000LL);\n tm* tm = utc ? ::gmtime(&now) : ::localtime(&now);\n sec = tm->tm_sec;\n min = tm->tm_min;\n hour = tm->tm_hour;\n day = tm->tm_mday;\n month = tm->tm_mon + 1;\n year = tm->tm_year + 1900;\n wday = tm->tm_wday;\n yday = tm->tm_yday;\n dst = !!tm->tm_isdst;\n}\n\nTime::Time(const Time& other) :\n sec(other.sec),\n min(other.min),\n hour(other.hour),\n day(other.day),\n month(other.month),\n year(other.year),\n wday(other.wday),\n yday(other.yday),\n dst(other.dst),\n utc(other.utc) {}\n\nint64_t Time::toTimestamp()\n{\n tm tm;\n tm.tm_sec = sec;\n tm.tm_min = min;\n tm.tm_hour = hour;\n tm.tm_mday = day;\n tm.tm_mon = month - 1;\n tm.tm_year = year - 1900;\n tm.tm_wday = wday;\n tm.tm_yday = yday;\n tm.tm_isdst = dst;\n if(utc)\n#ifdef _MSC_VER\n return _mkgmtime(&tm) * 1000LL;\n#else\n return timegm(&tm) * 1000LL;\n#endif\n else\n return mktime(&tm) * 1000LL;\n}\n\nTime& Time::toUtc()\n{\n if(!utc)\n {\n int64_t timestamp = toTimestamp();\n *this = Time(timestamp, true);\n }\n return *this;\n}\n\nTime& Time::toLocal()\n{\n if(utc)\n {\n int64_t timestamp = toTimestamp();\n *this = Time(timestamp, false);\n }\n return *this;\n}\n\nbool_t Time::operator==(const Time& other) const\n{\n return sec == other.sec &&\n min == other.min &&\n hour == other.hour &&\n day == other.day &&\n month == other.month &&\n year == other.year &&\n wday == other.wday &&\n yday == other.yday &&\n dst == other.dst &&\n utc == other.utc;\n}\n\nbool_t Time::operator!=(const Time& other) const\n{\n return sec != other.sec ||\n min != other.min ||\n hour != other.hour ||\n day != other.day ||\n month != other.month ||\n year != other.year ||\n wday != other.wday ||\n yday != other.yday ||\n dst != other.dst ||\n utc != other.utc;\n}\n\nint64_t Time::time()\n{\n return ::time(0) * 1000LL;\n}\n\nint64_t Time::ticks()\n{\n#ifdef _WIN32\n return GetTickCount();\n#else\n struct timespec ts;\n clock_gettime(CLOCK_MONOTONIC, &ts);\n return (int64_t)ts.tv_sec * 1000 + ts.tv_nsec \/ 1000000;\n#endif\n}\n\nint64_t Time::microTicks()\n{\n#ifdef _WIN32\n LARGE_INTEGER li;\n VERIFY(QueryPerformanceCounter(&li));\n return li.QuadPart \/ Private::perfFreq;\n#else\n struct timespec ts;\n clock_gettime(CLOCK_MONOTONIC, &ts);\n return (int64_t)ts.tv_sec * 1000000 + ts.tv_nsec \/ 1000;\n#endif\n}\n\nString Time::toString(const tchar_t* format)\n{\n if(!*format)\n return String();\n tm tm;\n tm.tm_sec = sec;\n tm.tm_min = min;\n tm.tm_hour = hour;\n tm.tm_mday = day;\n tm.tm_mon = month - 1;\n tm.tm_year = year - 1900;\n tm.tm_wday = wday;\n tm.tm_yday = yday;\n tm.tm_isdst = dst;\n\n String result(256);\n tchar_t* buffer;\n size_t len;\n for(;;)\n {\n buffer = result;\n#ifdef _UNICODE\n len = wcsftime(buffer, result.capacity(), format, &tm);\n#else\n len = strftime(buffer, result.capacity(), format, &tm);\n#endif\n if(len > 0)\n break;\n result.reserve(result.capacity() * 2);\n }\n result.resize(len);\n return result;\n}\n\nString Time::toString(int64_t time, const tchar_t* format, bool_t utc)\n{\n if(!*format)\n return String();\n time_t timet = (time_t)(time \/ 1000);\n const tm* tms = utc ? ::gmtime(&timet) : ::localtime(&timet);\n String result(256);\n if(!tms)\n return result;\n tchar_t* buffer;\n size_t len;\n for(;;)\n {\n buffer = result;\n#ifdef _UNICODE\n len = wcsftime(buffer, result.capacity(), format, tms);\n#else\n len = strftime(buffer, result.capacity(), format, tms);\n#endif\n if(len > 0)\n break;\n result.reserve(result.capacity() * 2);\n }\n result.resize(len);\n return result;\n}\n<commit_msg>Time: Thread-safe use of localtime and gmtime<commit_after>\n#include <ctime>\n#ifdef _WIN32\n#define NOMINMAX\n#include <Windows.h>\n#endif\n\n#include <nstd\/Time.h>\n#ifdef _WIN32\n#include <nstd\/Debug.h>\n#endif\n\nclass Time::Private\n{\n#ifdef _WIN32\npublic:\n static int64_t perfFreq;\n static class Framework\n {\n public:\n Framework()\n {\n LARGE_INTEGER li;\n VERIFY(QueryPerformanceFrequency(&li));\n perfFreq = li.QuadPart \/ 1000000LL;\n }\n } framework;\n#endif\n};\n\n#ifdef _WIN32\n#ifdef _MSC_VER\n#pragma warning(disable: 4073) \n#pragma init_seg(lib)\nTime::Private::Framework Time::Private::framework;\n#else\nTime::Private::Framework Time::Private::framework __attribute__ ((init_priority (101)));\n#endif\nint64_t Time::Private::perfFreq;\n#endif\n\nTime::Time(bool_t utc) : utc(utc)\n{\n time_t now;\n ::time(&now);\n#ifdef _WIN32\n tm* tm = utc ? ::gmtime(&now) : ::localtime(&now); \/\/ win32 gmtime and localtime are thread save\n#else\n struct tm tmBuf;\n tm* tm = utc ? ::gmtime_r(&now, &tmBuf) : ::localtime_r(&now, &tmBuf);\n#endif\n sec = tm->tm_sec;\n min = tm->tm_min;\n hour = tm->tm_hour;\n day = tm->tm_mday;\n month = tm->tm_mon + 1;\n year = tm->tm_year + 1900;\n wday = tm->tm_wday;\n yday = tm->tm_yday;\n dst = !!tm->tm_isdst;\n}\n\nTime::Time(int64_t time, bool_t utc) : utc(utc)\n{\n time_t now = (time_t)(time \/ 1000LL);\n#ifdef _WIN32\n tm* tm = utc ? ::gmtime(&now) : ::localtime(&now); \/\/ win32 gmtime and localtime are thread save\n#else\n struct tm tmBuf;\n tm* tm = utc ? ::gmtime_r(&now, &tmBuf) : ::localtime_r(&now, &tmBuf);\n#endif\n sec = tm->tm_sec;\n min = tm->tm_min;\n hour = tm->tm_hour;\n day = tm->tm_mday;\n month = tm->tm_mon + 1;\n year = tm->tm_year + 1900;\n wday = tm->tm_wday;\n yday = tm->tm_yday;\n dst = !!tm->tm_isdst;\n}\n\nTime::Time(const Time& other) :\n sec(other.sec),\n min(other.min),\n hour(other.hour),\n day(other.day),\n month(other.month),\n year(other.year),\n wday(other.wday),\n yday(other.yday),\n dst(other.dst),\n utc(other.utc) {}\n\nint64_t Time::toTimestamp()\n{\n tm tm;\n tm.tm_sec = sec;\n tm.tm_min = min;\n tm.tm_hour = hour;\n tm.tm_mday = day;\n tm.tm_mon = month - 1;\n tm.tm_year = year - 1900;\n tm.tm_wday = wday;\n tm.tm_yday = yday;\n tm.tm_isdst = dst;\n if(utc)\n#ifdef _MSC_VER\n return _mkgmtime(&tm) * 1000LL;\n#else\n return timegm(&tm) * 1000LL;\n#endif\n else\n return mktime(&tm) * 1000LL;\n}\n\nTime& Time::toUtc()\n{\n if(!utc)\n {\n int64_t timestamp = toTimestamp();\n *this = Time(timestamp, true);\n }\n return *this;\n}\n\nTime& Time::toLocal()\n{\n if(utc)\n {\n int64_t timestamp = toTimestamp();\n *this = Time(timestamp, false);\n }\n return *this;\n}\n\nbool_t Time::operator==(const Time& other) const\n{\n return sec == other.sec &&\n min == other.min &&\n hour == other.hour &&\n day == other.day &&\n month == other.month &&\n year == other.year &&\n wday == other.wday &&\n yday == other.yday &&\n dst == other.dst &&\n utc == other.utc;\n}\n\nbool_t Time::operator!=(const Time& other) const\n{\n return sec != other.sec ||\n min != other.min ||\n hour != other.hour ||\n day != other.day ||\n month != other.month ||\n year != other.year ||\n wday != other.wday ||\n yday != other.yday ||\n dst != other.dst ||\n utc != other.utc;\n}\n\nint64_t Time::time()\n{\n return ::time(0) * 1000LL;\n}\n\nint64_t Time::ticks()\n{\n#ifdef _WIN32\n return GetTickCount();\n#else\n struct timespec ts;\n clock_gettime(CLOCK_MONOTONIC, &ts);\n return (int64_t)ts.tv_sec * 1000 + ts.tv_nsec \/ 1000000;\n#endif\n}\n\nint64_t Time::microTicks()\n{\n#ifdef _WIN32\n LARGE_INTEGER li;\n VERIFY(QueryPerformanceCounter(&li));\n return li.QuadPart \/ Private::perfFreq;\n#else\n struct timespec ts;\n clock_gettime(CLOCK_MONOTONIC, &ts);\n return (int64_t)ts.tv_sec * 1000000 + ts.tv_nsec \/ 1000;\n#endif\n}\n\nString Time::toString(const tchar_t* format)\n{\n if(!*format)\n return String();\n tm tm;\n tm.tm_sec = sec;\n tm.tm_min = min;\n tm.tm_hour = hour;\n tm.tm_mday = day;\n tm.tm_mon = month - 1;\n tm.tm_year = year - 1900;\n tm.tm_wday = wday;\n tm.tm_yday = yday;\n tm.tm_isdst = dst;\n\n String result(256);\n tchar_t* buffer;\n size_t len;\n for(;;)\n {\n buffer = result;\n#ifdef _UNICODE\n len = wcsftime(buffer, result.capacity(), format, &tm);\n#else\n len = strftime(buffer, result.capacity(), format, &tm);\n#endif\n if(len > 0)\n break;\n result.reserve(result.capacity() * 2);\n }\n result.resize(len);\n return result;\n}\n\nString Time::toString(int64_t time, const tchar_t* format, bool_t utc)\n{\n if(!*format)\n return String();\n time_t timet = (time_t)(time \/ 1000);\n const tm* tms = utc ? ::gmtime(&timet) : ::localtime(&timet);\n String result(256);\n if(!tms)\n return result;\n tchar_t* buffer;\n size_t len;\n for(;;)\n {\n buffer = result;\n#ifdef _UNICODE\n len = wcsftime(buffer, result.capacity(), format, tms);\n#else\n len = strftime(buffer, result.capacity(), format, tms);\n#endif\n if(len > 0)\n break;\n result.reserve(result.capacity() * 2);\n }\n result.resize(len);\n return result;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* CsaReader.cpp\n *\n * Kubo Ryosuke\n *\/\n\n#include \"CsaReader.h\"\n#include \"logger\/Logger.h\"\n#include <fstream>\n\n#define LINE_BUFFER_SIZE\t\t\t\t\t\t\t1024\n\nnamespace sunfish {\n\n\tbool CsaReader::read(const char* filename, Record& record) {\n\n\t\tstd::ifstream file(filename);\n\t\tif (!file) {\n\t\t\treturn false;\n\t\t}\n\n\t\tbool ok = read(file, record);\n\n\t\tfile.close();\n\t\treturn ok;\n\n\t}\n\n\tbool CsaReader::read(std::istream& is, Record& record) {\n\t\tBoard board;\n\n\t\t\/\/ 局面の読み込み\n\t\tif (!readBoard(is, board)) {\n\t\t\treturn false;\n\t\t}\n\n\t\trecord.init(board);\n\n\t\t\/\/ 指し手の読み込み\n\t\tif (!readMoves(is, record)) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::readBoard(std::istream& is, Board& board) {\n\t\tbool ok = _readBoard(is, board);\n\t\tboard.refreshHash();\n\t\treturn ok;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::readBoard(const char* line, Board& board) {\n\t\tbool ok = _readBoard(line, board);\n\t\tboard.refreshHash();\n\t\treturn ok;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::_readBoard(std::istream& is, Board& board) {\n\t\tchar line[LINE_BUFFER_SIZE];\n\n\t\tboard.init();\n\n\t\twhile (true) {\n\t\t\tis.getline(line, sizeof(line));\n\t\t\tif (is.eof()) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (is.fail()) {\n\t\t\t\tLoggers::warning << \"file io error. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (!_readBoard(line, board)) {\n\t\t\t\tLoggers::warning << \"invalid board format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (line[0] == '+' || line[0] == '-') {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::_readBoard(const char* line, Board& board) {\n\t\tswitch (line[0]) {\n\t\tcase 'P':\n\t\t\tif (line[1] >= '1' && line[1] <= '9') {\n\t\t\t\treturn _readBoardPieces(line, board);\n\t\t\t} else if (line[1] == '+') {\n\t\t\t\treturn _readHand(line, board, true);\n\t\t\t} else if (line[1] == '-') {\n\t\t\t\treturn _readHand(line, board, false);\n\t\t\t}\n\t\t\tLoggers::warning << __THIS__ << \": unknown command\";\n\t\t\tLoggers::warning << line;\n\t\t\treturn false;\n\t\tcase '+':\n\t\t\tboard.setBlack();\n\t\t\treturn true;\n\t\tcase '-':\n\t\t\tboard.setWhite();\n\t\t\treturn true;\n\t\tcase 'V': case 'N': case '$': case '\\'': case '\\0':\n\t\t\treturn true;\n\t\tdefault:\n\t\t\tLoggers::warning << __THIS__ << \": unknown command\";\n\t\t\tLoggers::warning << line;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/**\n\t * 盤面の読み込み\n\t *\/\n\tbool CsaReader::_readBoardPieces(const char* line, Board& board) {\n\t\tif (strlen(line) < 2 + 3 * Position::FileN) {\n\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\treturn false;\n\t\t}\n\t\tint rank = line[1] - '0';\n\t\tfor (int file = 1; file <= Position::FileN; file++) {\n\t\t\tPiece piece = Piece::parseCsa(line + 2 + 3 * (9 - file));\n\t\t\tboard.setBoardPiece(Position(file, rank), piece);\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 持ち駒の読み込み\n\t *\/\n\tbool CsaReader::_readHand(const char* line, Board& board, bool black) {\n\t\tunsigned length = strlen(line);\n\t\tfor (unsigned i = 2; i + 4 <= length; i += 4) {\n\t\t\tunsigned file = line[i+0] - '0';\n\t\t\tunsigned rank = line[i+1] - '0';\n\t\t\tPiece piece = Piece::parseCsa(&line[i+2]);\n\t\t\tif (piece != Piece::Empty) {\n\t\t\t\tif (Position::isValidFile(file) && Position::isValidRank(rank)) {\n\t\t\t\t\tboard.setBoardPiece(Position(file, rank), black ? piece.black() : piece.white());\n\t\t\t\t} else if (file == 0 && rank == 0 && piece.isUnpromoted() && piece != Piece::King) {\n\t\t\t\t\tif (black) {\n\t\t\t\t\t\tboard.incBlackHand(piece);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tboard.incWhiteHand(piece);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 手順の読み込み\n\t *\/\n\tbool CsaReader::readMoves(std::istream& is, Record& record) {\n\t\tchar line[LINE_BUFFER_SIZE];\n\t\tMove move;\n\n\t\twhile (true) {\n\t\t\tis.getline(line, sizeof(line));\n\t\t\tif (is.eof()) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (is.fail()) {\n\t\t\t\tLoggers::warning << \"file io error. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (!readMove(line, record.getBoard(), move)) {\n\t\t\t\tLoggers::warning << \"invalid move format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\tLoggers::warning << \"> \" << line;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\trecord.makeMove(move);\n\t\t}\n\t}\n\n\t\/**\n\t * 指し手の読み込み\n\t *\/\n\tbool CsaReader::readMove(const char* line, const Board& board, Move& move) {\n\t\tif (line[0] == '\\0' || line[0] == 'T' || line[0] == '\\'') {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (strlen(line) < 7) {\n\t\t\treturn false;\n\t\t}\n\n\t\tbool black;\n\t\tif (line[0] == '+') {\n\t\t\tblack = true;\n\t\t} else if (line[0] == '-') {\n\t\t\tblack = false;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (black != board.isBlack()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tPosition to = Position::parse(&line[3]);\n\t\tPiece piece = Piece::parseCsa(&line[5]);\n\t\tif (line[1] == '0' && line[2] == '0') {\n\t\t\tmove = Move(piece, to);\n\t\t} else {\n\t\t\tPosition from = Position::parse(&line[1]);\n\t\t\tPiece pieceOrg = board.getBoardPiece(from).kindOnly();\n\t\t\tbool promote;\n\t\t\tif (piece == pieceOrg) {\n\t\t\t\tpromote = false;\n\t\t\t} else if (piece == pieceOrg.promote()) {\n\t\t\t\tpromote = true;\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tmove = Move(pieceOrg, from, to, promote);\n\t\t}\n\n\t\treturn true;\n\t}\n}\n<commit_msg>Fix for clang's warning<commit_after>\/* CsaReader.cpp\n *\n * Kubo Ryosuke\n *\/\n\n#include \"CsaReader.h\"\n#include \"logger\/Logger.h\"\n#include <fstream>\n\n#define LINE_BUFFER_SIZE\t\t\t\t\t\t\t1024\n\nnamespace sunfish {\n\n\tbool CsaReader::read(const char* filename, Record& record) {\n\n\t\tstd::ifstream file(filename);\n\t\tif (!file) {\n\t\t\treturn false;\n\t\t}\n\n\t\tbool ok = read(file, record);\n\n\t\tfile.close();\n\t\treturn ok;\n\n\t}\n\n\tbool CsaReader::read(std::istream& is, Record& record) {\n\t\tBoard board;\n\n\t\t\/\/ 局面の読み込み\n\t\tif (!readBoard(is, board)) {\n\t\t\treturn false;\n\t\t}\n\n\t\trecord.init(board);\n\n\t\t\/\/ 指し手の読み込み\n\t\tif (!readMoves(is, record)) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::readBoard(std::istream& is, Board& board) {\n\t\tbool ok = _readBoard(is, board);\n\t\tboard.refreshHash();\n\t\treturn ok;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::readBoard(const char* line, Board& board) {\n\t\tbool ok = _readBoard(line, board);\n\t\tboard.refreshHash();\n\t\treturn ok;\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::_readBoard(std::istream& is, Board& board) {\n\t\tchar line[LINE_BUFFER_SIZE];\n\n\t\tboard.init();\n\n\t\twhile (true) {\n\t\t\tis.getline(line, sizeof(line));\n\t\t\tif (is.eof()) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (is.fail()) {\n\t\t\t\tLoggers::warning << \"file io error. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (!_readBoard(line, board)) {\n\t\t\t\tLoggers::warning << \"invalid board format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (line[0] == '+' || line[0] == '-') {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/**\n\t * 局面の読み込み\n\t *\/\n\tbool CsaReader::_readBoard(const char* line, Board& board) {\n\t\tswitch (line[0]) {\n\t\tcase 'P':\n\t\t\tif (line[1] >= '1' && line[1] <= '9') {\n\t\t\t\treturn _readBoardPieces(line, board);\n\t\t\t} else if (line[1] == '+') {\n\t\t\t\treturn _readHand(line, board, true);\n\t\t\t} else if (line[1] == '-') {\n\t\t\t\treturn _readHand(line, board, false);\n\t\t\t}\n\t\t\tLoggers::warning << __THIS__ << \": unknown command\";\n\t\t\tLoggers::warning << line;\n\t\t\treturn false;\n\t\tcase '+':\n\t\t\tboard.setBlack();\n\t\t\treturn true;\n\t\tcase '-':\n\t\t\tboard.setWhite();\n\t\t\treturn true;\n\t\tcase 'V': case 'N': case '$': case '\\'': case '\\0':\n\t\t\treturn true;\n\t\tdefault:\n\t\t\tLoggers::warning << __THIS__ << \": unknown command\";\n\t\t\tLoggers::warning << line;\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t\/**\n\t * 盤面の読み込み\n\t *\/\n\tbool CsaReader::_readBoardPieces(const char* line, Board& board) {\n\t\tif (strlen(line) < 2 + 3 * Position::FileN) {\n\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\treturn false;\n\t\t}\n\t\tint rank = line[1] - '0';\n\t\tfor (int file = 1; file <= Position::FileN; file++) {\n\t\t\tPiece piece = Piece::parseCsa(line + 2 + 3 * (9 - file));\n\t\t\tboard.setBoardPiece(Position(file, rank), piece);\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 持ち駒の読み込み\n\t *\/\n\tbool CsaReader::_readHand(const char* line, Board& board, bool black) {\n\t\tunsigned length = (unsigned)strlen(line);\n\t\tfor (unsigned i = 2; i + 4 <= length; i += 4) {\n\t\t\tunsigned file = line[i+0] - '0';\n\t\t\tunsigned rank = line[i+1] - '0';\n\t\t\tPiece piece = Piece::parseCsa(&line[i+2]);\n\t\t\tif (piece != Piece::Empty) {\n\t\t\t\tif (Position::isValidFile(file) && Position::isValidRank(rank)) {\n\t\t\t\t\tboard.setBoardPiece(Position(file, rank), black ? piece.black() : piece.white());\n\t\t\t\t} else if (file == 0 && rank == 0 && piece.isUnpromoted() && piece != Piece::King) {\n\t\t\t\t\tif (black) {\n\t\t\t\t\t\tboard.incBlackHand(piece);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tboard.incWhiteHand(piece);\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tLoggers::warning << \"invalid format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/**\n\t * 手順の読み込み\n\t *\/\n\tbool CsaReader::readMoves(std::istream& is, Record& record) {\n\t\tchar line[LINE_BUFFER_SIZE];\n\t\tMove move;\n\n\t\twhile (true) {\n\t\t\tis.getline(line, sizeof(line));\n\t\t\tif (is.eof()) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tif (is.fail()) {\n\t\t\t\tLoggers::warning << \"file io error. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (!readMove(line, record.getBoard(), move)) {\n\t\t\t\tLoggers::warning << \"invalid move format. \" << __FILE__ << \"(\" << __LINE__ << \")\";\n\t\t\t\tLoggers::warning << \"> \" << line;\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\trecord.makeMove(move);\n\t\t}\n\t}\n\n\t\/**\n\t * 指し手の読み込み\n\t *\/\n\tbool CsaReader::readMove(const char* line, const Board& board, Move& move) {\n\t\tif (line[0] == '\\0' || line[0] == 'T' || line[0] == '\\'') {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (strlen(line) < 7) {\n\t\t\treturn false;\n\t\t}\n\n\t\tbool black;\n\t\tif (line[0] == '+') {\n\t\t\tblack = true;\n\t\t} else if (line[0] == '-') {\n\t\t\tblack = false;\n\t\t} else {\n\t\t\treturn false;\n\t\t}\n\n\t\tif (black != board.isBlack()) {\n\t\t\treturn false;\n\t\t}\n\n\t\tPosition to = Position::parse(&line[3]);\n\t\tPiece piece = Piece::parseCsa(&line[5]);\n\t\tif (line[1] == '0' && line[2] == '0') {\n\t\t\tmove = Move(piece, to);\n\t\t} else {\n\t\t\tPosition from = Position::parse(&line[1]);\n\t\t\tPiece pieceOrg = board.getBoardPiece(from).kindOnly();\n\t\t\tbool promote;\n\t\t\tif (piece == pieceOrg) {\n\t\t\t\tpromote = false;\n\t\t\t} else if (piece == pieceOrg.promote()) {\n\t\t\t\tpromote = true;\n\t\t\t} else {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tmove = Move(pieceOrg, from, to, promote);\n\t\t}\n\n\t\treturn true;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n\n#include \"ActivationFunction.h\"\n\n#include <algorithm>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <thread>\n#include <type_traits>\n#include \"paddle\/parameter\/Argument.h\"\n#include \"paddle\/utils\/ClassRegistrar.h\"\n\n#include \"paddle\/utils\/Logging.h\"\n\nnamespace paddle {\n\nstatic ClassRegistrar<ActivationFunction> gActivationRegistrar;\n\/**\n * @def ACTIVATION_CLASS_NAME\n * @brief Macro for getting derived activation class name\n * @note ACTIVATION_CLASS_NAME(softmax) softmax_;\n * means softmaxActivation softmax_;\n *\/\n#define ACTIVATION_CLASS_NAME(ACTIVATION_NAME) ACTIVATION_NAME##Activation\n\/**\n * @def BEGIN_DEFINE_ACTIVATION\n * @brief Macro for defining a devried activation class\n *\/\n#define BEGIN_DEFINE_ACTIVATION(ACTIVATION_NAME) \\\n class ACTIVATION_CLASS_NAME(ACTIVATION_NAME) : public ActivationFunction { \\\n private: \\\n static const std::string name; \\\n \\\n public: \\\n const std::string& getName() const { return name; }\n\/**\n * @def END_DEFINE_ACTIVATION\n * @brief Macro for registering a derived activation class\n *\/\n#define END_DEFINE_ACTIVATION(ACTIVATION_NAME) \\\n } \\\n ; \\\n const std::string ACTIVATION_CLASS_NAME(ACTIVATION_NAME)::name = \\\n #ACTIVATION_NAME; \\\n static InitFunction __reg_activation__##ACTIVATION_NAME([] { \\\n gActivationRegistrar \\\n .registerClass<ACTIVATION_CLASS_NAME(ACTIVATION_NAME)>( \\\n #ACTIVATION_NAME); \\\n });\n\n\/**\n * @brief The IdentityActivation class\n *\n * Do nothing when forward\/backward.\n *\/\nclass IdentityActivation : public ActivationFunction {\npublic:\n static const std::string name;\n Error __must_check forward(Argument& act) {\n (void)act;\n return Error();\n }\n Error __must_check backward(Argument& act) {\n (void)act;\n return Error();\n }\n const std::string& getName() const { return name; }\n};\nconst std::string IdentityActivation::name = \"\";\nstatic InitFunction __reg_activation__identity([] {\n gActivationRegistrar.registerClass<IdentityActivation>(\"\");\n gActivationRegistrar.registerClass<IdentityActivation>(\"linear\");\n});\n\n\/**\n * @brief Sigmoid Activation\n * \\f[\n * f(z) = \\frac{1}{1+exp(-z)}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(sigmoid)\nError __must_check forward(Argument& act) {\n act.value->sigmoid(*act.value);\n return Error();\n}\nError __must_check backward(Argument& act) {\n act.grad->sigmoidDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(sigmoid)\n\n\/**\n * @brief Softmax Activation\n * \\f[\n * P(y=j|x) = \\frac{e^{x^Tw_j}}{\\sum^K_{k=1}e^{x^Tw_k}}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(softmax)\nprivate:\nMatrixPtr sftMaxSum_;\nMatrixPtr sftMaxDot_;\nMatrixPtr one_;\n\npublic:\nError __must_check forward(Argument& act) {\n act.value->softmax(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n MatrixPtr outputV = act.value;\n MatrixPtr outputG = act.grad;\n\n if (outputG->useGpu()) {\n outputG->softmaxBackward(*outputV);\n } else {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(sftMaxDot_,\n outputG->getHeight(),\n outputG->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n Matrix::resizeOrCreate(sftMaxSum_,\n outputG->getHeight(),\n 1,\n \/* trans *\/ false,\n useGpu(act.deviceId));\n if (!one_ || one_->getWidth() != outputG->getWidth()) {\n Matrix::resizeOrCreate(one_,\n 1,\n outputG->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n one_->one();\n }\n\n sftMaxDot_->dotMul(*outputG, *outputV);\n sftMaxSum_->colMerge(*sftMaxDot_);\n\n act.grad->softmaxDerivative(*act.value, *sftMaxSum_);\n }\n return Error();\n}\nEND_DEFINE_ACTIVATION(softmax)\n\n\/**\n * @brief Sequence_softmax Activation\n * @note Softmax on all frames of one sequence.\n * Width of frame must be one.\n *\/\nBEGIN_DEFINE_ACTIVATION(sequence_softmax)\nprivate:\nACTIVATION_CLASS_NAME(softmax) softmax_;\nArgument argument_;\n\npublic:\nError __must_check forward(Argument& act) {\n if (act.value->getWidth() != 1UL) {\n return Error(\n \"Input width for each timestep of sequence softmax should be 1\");\n }\n\n if (!argument_.value) {\n argument_.value = Matrix::create(nullptr,\n \/* height= *\/ 1,\n 1,\n \/* trans= *\/ false,\n useGpu(act.deviceId));\n argument_.grad = Matrix::create(nullptr,\n \/* height= *\/ 1,\n 1,\n \/* trans= *\/ false,\n useGpu(act.deviceId));\n }\n\n auto starts =\n act.hasSubseq()\n ? act.subSequenceStartPositions->getVector(useGpu(act.deviceId))\n : act.sequenceStartPositions->getVector(useGpu(act.deviceId));\n act.value->sequenceSoftmax(*act.value, *starts);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n if (act.value->getWidth() != 1UL) {\n return Error(\n \"Input width for each timestep of sequence softmax should be 1\");\n }\n\n size_t numSequences =\n act.hasSubseq() ? act.getNumSubSequences() : act.getNumSequences();\n const int* starts = act.getCpuStartPositions();\n\n for (size_t i = 0; i < numSequences; ++i) {\n \/\/ TODO(Dangqingqing) optimization for GPU\n size_t offset = starts[i];\n size_t size = starts[i + 1] - starts[i];\n argument_.value->setData(act.value->getData() + offset, 1UL, size);\n argument_.grad->setData(act.grad->getData() + offset, 1UL, size);\n\n Error err = softmax_.backward(argument_);\n if (!err.isOK()) return err;\n }\n return Error();\n}\nEND_DEFINE_ACTIVATION(sequence_softmax)\n\n\/**\n * @brief Relu Activation.\n * forward. y = max(0, z)\n *\n * derivative of relu is:\n *\n * 1 if z > 0\n *\n * 0 otherwise.\n *\/\nBEGIN_DEFINE_ACTIVATION(relu)\nError __must_check forward(Argument& act) {\n act.value->relu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->reluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(relu)\n\n\/**\n * @brief BRelu Activation.\n *\n * forward. y = min(24, max(0, z))\n *\n * derivative of brelu is:\n *\n * 1 if 0 < z < 24\n *\n * 0 otherwise.\n *\n * TODO(yuyang18): Remove magic number 24 or make it configuable.\n *\/\nBEGIN_DEFINE_ACTIVATION(brelu)\nError __must_check forward(Argument& act) {\n act.value->brelu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->breluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(brelu)\n\n\/**\n * @brief Tanh Activation.\n * \\f[\n * f(z) = tanh(z)=\\frac{e^z-e^{-z}}{e^z+e^{-z}}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(tanh)\nError __must_check forward(Argument& act) {\n act.value->tanh(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->tanhDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(tanh)\n\n\/**\n * @brief Scaled Tanh Activation\n * \\f[\n * f(z) = 1.7159 * tanh(2\/3*z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(stanh)\nprivate:\nreal a, b;\n\npublic:\nACTIVATION_CLASS_NAME(stanh)() : a(1.7159), b(2. \/ 3.) {}\nError __must_check forward(Argument& act) {\n act.value->scaledTanh(*act.value, a, b);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->scaledTanhDerivative(*act.value, a, b);\n return Error();\n}\nEND_DEFINE_ACTIVATION(stanh)\n\n\/**\n * @brief Soft Relu Activation.\n * \\f[\n * f(z) = ln(1+e^z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(softrelu)\nError __must_check forward(Argument& act) {\n act.value->softrelu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->softreluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(softrelu)\n\n\/**\n * @brief Abs Activation.\n * Forward: f(z) = abs(z)\n *\n * Derivative:\n *\n * 1 if z>0\n *\n * -1 if z<0\n *\n * 0 if z=0\n *\/\nBEGIN_DEFINE_ACTIVATION(abs)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->abs2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->absDerivative(*act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(abs)\n\n\/**\n * @brief Square Activation.\n * \\f[\n * f(z) = z^2.\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(square)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->square2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->squareDerivative(*act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(square)\n\n\/**\n * @brief Exponential Activation.\n * \\f[\n * f(z) = e^z\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(exponential)\nError __must_check forward(Argument& act) {\n act.value->exp2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->expDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(exponential)\n\n\/**\n * @brief Reciprocal Activation.\n * \\f[\n * f(z) = 1\/z\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(reciprocal)\nError __must_check forward(Argument& act) {\n act.value->reciprocal2();\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotMulSquare(*act.value);\n act.grad->neg();\n return Error();\n}\nEND_DEFINE_ACTIVATION(reciprocal)\n\n\/**\n * @brief Square Root Activation.\n * \\f[\n * f(z) = sqrt(z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(sqrt)\nError __must_check forward(Argument& act) {\n act.value->sqrt2();\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotDiv(*act.grad, *act.value);\n act.grad->mulScalar(0.5);\n return Error();\n}\nEND_DEFINE_ACTIVATION(sqrt)\n\n\/**\n * @brief Logarithm Activation.\n * \\f[\n * f(z) = log(z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(log)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->log2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotDiv(*act.grad, *act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(log)\n\nActivationFunction* ActivationFunction::create(const std::string& type) {\n return gActivationRegistrar.createByType(type);\n}\n\nstd::vector<std::string> ActivationFunction::getAllRegisteredTypes() {\n std::vector<std::string> types;\n gActivationRegistrar.forEachType(\n [&](const std::string& type) { types.push_back(type); });\n return types;\n}\n\n} \/\/ namespace paddle\n<commit_msg>delete useless codes in softmax backward.<commit_after>\/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserve.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License. *\/\n\n#include \"ActivationFunction.h\"\n\n#include <algorithm>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <thread>\n#include <type_traits>\n#include \"paddle\/parameter\/Argument.h\"\n#include \"paddle\/utils\/ClassRegistrar.h\"\n\n#include \"paddle\/utils\/Logging.h\"\n\nnamespace paddle {\n\nstatic ClassRegistrar<ActivationFunction> gActivationRegistrar;\n\/**\n * @def ACTIVATION_CLASS_NAME\n * @brief Macro for getting derived activation class name\n * @note ACTIVATION_CLASS_NAME(softmax) softmax_;\n * means softmaxActivation softmax_;\n *\/\n#define ACTIVATION_CLASS_NAME(ACTIVATION_NAME) ACTIVATION_NAME##Activation\n\/**\n * @def BEGIN_DEFINE_ACTIVATION\n * @brief Macro for defining a devried activation class\n *\/\n#define BEGIN_DEFINE_ACTIVATION(ACTIVATION_NAME) \\\n class ACTIVATION_CLASS_NAME(ACTIVATION_NAME) : public ActivationFunction { \\\n private: \\\n static const std::string name; \\\n \\\n public: \\\n const std::string& getName() const { return name; }\n\/**\n * @def END_DEFINE_ACTIVATION\n * @brief Macro for registering a derived activation class\n *\/\n#define END_DEFINE_ACTIVATION(ACTIVATION_NAME) \\\n } \\\n ; \\\n const std::string ACTIVATION_CLASS_NAME(ACTIVATION_NAME)::name = \\\n #ACTIVATION_NAME; \\\n static InitFunction __reg_activation__##ACTIVATION_NAME([] { \\\n gActivationRegistrar \\\n .registerClass<ACTIVATION_CLASS_NAME(ACTIVATION_NAME)>( \\\n #ACTIVATION_NAME); \\\n });\n\n\/**\n * @brief The IdentityActivation class\n *\n * Do nothing when forward\/backward.\n *\/\nclass IdentityActivation : public ActivationFunction {\npublic:\n static const std::string name;\n Error __must_check forward(Argument& act) {\n (void)act;\n return Error();\n }\n Error __must_check backward(Argument& act) {\n (void)act;\n return Error();\n }\n const std::string& getName() const { return name; }\n};\nconst std::string IdentityActivation::name = \"\";\nstatic InitFunction __reg_activation__identity([] {\n gActivationRegistrar.registerClass<IdentityActivation>(\"\");\n gActivationRegistrar.registerClass<IdentityActivation>(\"linear\");\n});\n\n\/**\n * @brief Sigmoid Activation\n * \\f[\n * f(z) = \\frac{1}{1+exp(-z)}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(sigmoid)\nError __must_check forward(Argument& act) {\n act.value->sigmoid(*act.value);\n return Error();\n}\nError __must_check backward(Argument& act) {\n act.grad->sigmoidDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(sigmoid)\n\n\/**\n * @brief Softmax Activation\n * \\f[\n * P(y=j|x) = \\frac{e^{x^Tw_j}}{\\sum^K_{k=1}e^{x^Tw_k}}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(softmax)\nprivate:\nMatrixPtr sftMaxSum_;\nMatrixPtr sftMaxDot_;\n\npublic:\nError __must_check forward(Argument& act) {\n act.value->softmax(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n MatrixPtr outputV = act.value;\n MatrixPtr outputG = act.grad;\n\n if (outputG->useGpu()) {\n outputG->softmaxBackward(*outputV);\n } else {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(sftMaxDot_,\n outputG->getHeight(),\n outputG->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n Matrix::resizeOrCreate(sftMaxSum_,\n outputG->getHeight(),\n 1,\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n sftMaxDot_->dotMul(*outputG, *outputV);\n sftMaxSum_->colMerge(*sftMaxDot_);\n\n act.grad->softmaxDerivative(*act.value, *sftMaxSum_);\n }\n return Error();\n}\nEND_DEFINE_ACTIVATION(softmax)\n\n\/**\n * @brief Sequence_softmax Activation\n * @note Softmax on all frames of one sequence.\n * Width of frame must be one.\n *\/\nBEGIN_DEFINE_ACTIVATION(sequence_softmax)\nprivate:\nACTIVATION_CLASS_NAME(softmax) softmax_;\nArgument argument_;\n\npublic:\nError __must_check forward(Argument& act) {\n if (act.value->getWidth() != 1UL) {\n return Error(\n \"Input width for each timestep of sequence softmax should be 1\");\n }\n\n if (!argument_.value) {\n argument_.value = Matrix::create(nullptr,\n \/* height= *\/ 1,\n 1,\n \/* trans= *\/ false,\n useGpu(act.deviceId));\n argument_.grad = Matrix::create(nullptr,\n \/* height= *\/ 1,\n 1,\n \/* trans= *\/ false,\n useGpu(act.deviceId));\n }\n\n auto starts =\n act.hasSubseq()\n ? act.subSequenceStartPositions->getVector(useGpu(act.deviceId))\n : act.sequenceStartPositions->getVector(useGpu(act.deviceId));\n act.value->sequenceSoftmax(*act.value, *starts);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n if (act.value->getWidth() != 1UL) {\n return Error(\n \"Input width for each timestep of sequence softmax should be 1\");\n }\n\n size_t numSequences =\n act.hasSubseq() ? act.getNumSubSequences() : act.getNumSequences();\n const int* starts = act.getCpuStartPositions();\n\n for (size_t i = 0; i < numSequences; ++i) {\n \/\/ TODO(Dangqingqing) optimization for GPU\n size_t offset = starts[i];\n size_t size = starts[i + 1] - starts[i];\n argument_.value->setData(act.value->getData() + offset, 1UL, size);\n argument_.grad->setData(act.grad->getData() + offset, 1UL, size);\n\n Error err = softmax_.backward(argument_);\n if (!err.isOK()) return err;\n }\n return Error();\n}\nEND_DEFINE_ACTIVATION(sequence_softmax)\n\n\/**\n * @brief Relu Activation.\n * forward. y = max(0, z)\n *\n * derivative of relu is:\n *\n * 1 if z > 0\n *\n * 0 otherwise.\n *\/\nBEGIN_DEFINE_ACTIVATION(relu)\nError __must_check forward(Argument& act) {\n act.value->relu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->reluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(relu)\n\n\/**\n * @brief BRelu Activation.\n *\n * forward. y = min(24, max(0, z))\n *\n * derivative of brelu is:\n *\n * 1 if 0 < z < 24\n *\n * 0 otherwise.\n *\n * TODO(yuyang18): Remove magic number 24 or make it configuable.\n *\/\nBEGIN_DEFINE_ACTIVATION(brelu)\nError __must_check forward(Argument& act) {\n act.value->brelu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->breluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(brelu)\n\n\/**\n * @brief Tanh Activation.\n * \\f[\n * f(z) = tanh(z)=\\frac{e^z-e^{-z}}{e^z+e^{-z}}\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(tanh)\nError __must_check forward(Argument& act) {\n act.value->tanh(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->tanhDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(tanh)\n\n\/**\n * @brief Scaled Tanh Activation\n * \\f[\n * f(z) = 1.7159 * tanh(2\/3*z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(stanh)\nprivate:\nreal a, b;\n\npublic:\nACTIVATION_CLASS_NAME(stanh)() : a(1.7159), b(2. \/ 3.) {}\nError __must_check forward(Argument& act) {\n act.value->scaledTanh(*act.value, a, b);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->scaledTanhDerivative(*act.value, a, b);\n return Error();\n}\nEND_DEFINE_ACTIVATION(stanh)\n\n\/**\n * @brief Soft Relu Activation.\n * \\f[\n * f(z) = ln(1+e^z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(softrelu)\nError __must_check forward(Argument& act) {\n act.value->softrelu(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->softreluDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(softrelu)\n\n\/**\n * @brief Abs Activation.\n * Forward: f(z) = abs(z)\n *\n * Derivative:\n *\n * 1 if z>0\n *\n * -1 if z<0\n *\n * 0 if z=0\n *\/\nBEGIN_DEFINE_ACTIVATION(abs)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->abs2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->absDerivative(*act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(abs)\n\n\/**\n * @brief Square Activation.\n * \\f[\n * f(z) = z^2.\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(square)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->square2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->squareDerivative(*act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(square)\n\n\/**\n * @brief Exponential Activation.\n * \\f[\n * f(z) = e^z\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(exponential)\nError __must_check forward(Argument& act) {\n act.value->exp2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->expDerivative(*act.value);\n return Error();\n}\nEND_DEFINE_ACTIVATION(exponential)\n\n\/**\n * @brief Reciprocal Activation.\n * \\f[\n * f(z) = 1\/z\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(reciprocal)\nError __must_check forward(Argument& act) {\n act.value->reciprocal2();\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotMulSquare(*act.value);\n act.grad->neg();\n return Error();\n}\nEND_DEFINE_ACTIVATION(reciprocal)\n\n\/**\n * @brief Square Root Activation.\n * \\f[\n * f(z) = sqrt(z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(sqrt)\nError __must_check forward(Argument& act) {\n act.value->sqrt2();\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotDiv(*act.grad, *act.value);\n act.grad->mulScalar(0.5);\n return Error();\n}\nEND_DEFINE_ACTIVATION(sqrt)\n\n\/**\n * @brief Logarithm Activation.\n * \\f[\n * f(z) = log(z)\n * \\f]\n *\/\nBEGIN_DEFINE_ACTIVATION(log)\nError __must_check forward(Argument& act) {\n SetDevice device(act.deviceId);\n Matrix::resizeOrCreate(act.in,\n act.value->getHeight(),\n act.value->getWidth(),\n \/* trans *\/ false,\n useGpu(act.deviceId));\n\n act.in->copyFrom(*act.value);\n act.value->log2(*act.value);\n return Error();\n}\n\nError __must_check backward(Argument& act) {\n act.grad->dotDiv(*act.grad, *act.in);\n return Error();\n}\nEND_DEFINE_ACTIVATION(log)\n\nActivationFunction* ActivationFunction::create(const std::string& type) {\n return gActivationRegistrar.createByType(type);\n}\n\nstd::vector<std::string> ActivationFunction::getAllRegisteredTypes() {\n std::vector<std::string> types;\n gActivationRegistrar.forEachType(\n [&](const std::string& type) { types.push_back(type); });\n return types;\n}\n\n} \/\/ namespace paddle\n<|endoftext|>"} {"text":"<commit_before>#include \"tlang.h\"\n#include \"structural_node.h\"\n#include <tuple>\n\nTLANG_NAMESPACE_BEGIN\n\nint Expr::index_counter = 0;\n\nExpr &Expr::operator=(const Expr &o) {\n \/\/ TC_ASSERT(allow_store);\n if (!allow_store || !node || node->type != NodeType::pointer) {\n \/\/ Expr assignment\n node = o.node;\n } else {\n \/\/ store to pointed addr\n TC_ASSERT(node->type == NodeType::pointer);\n auto &prog = get_current_program();\n \/\/ TC_ASSERT(&prog != nullptr);\n \/\/ TC_ASSERT(node->get_address().initialized());\n prog.store(*this, load_if_pointer(o));\n }\n return *this;\n}\n\nExpr Expr::operator[](const Expr &i) {\n TC_ASSERT(i);\n TC_ASSERT(node->type == NodeType::addr);\n TC_ASSERT(i->type == NodeType::index || i->data_type == DataType::i32);\n return create(NodeType::pointer, *this, i);\n}\n\nExpr Expr::operator[](const ExprGroup &is) {\n TC_ASSERT(is.size() > 0 && is.size() <= 2);\n TC_ASSERT(node->type == NodeType::addr);\n for (auto &i : is.exprs) {\n TC_ASSERT(i);\n TC_ASSERT(i->type == NodeType::index || i->data_type == DataType::i32);\n }\n if (is.size() == 1) {\n auto n = create(NodeType::pointer, *this, is.exprs[0]);\n n->data_type = (*this)->data_type;\n return n;\n } else {\n auto n = create(NodeType::pointer, *this, is.exprs[0], is.exprs[1]);\n n->data_type = (*this)->data_type;\n return n;\n }\n}\n\nvoid *Expr::evaluate_addr(int i, int j, int k, int l) {\n TC_ASSERT(node->lanes == 1);\n return node->new_addresses(0)->evaluate(get_current_program().data_structure,\n i, j, k, l);\n}\n\nbool Expr::allow_store = false;\n\/\/ assignment should not be used outside function definition; use \"Expr::set\"\n\/\/ instead\n\ntemplate <typename... Indices>\nvoid *Expr::val_tmp(Indices... indices) {\n TC_ASSERT(node->type == NodeType::addr);\n SNode *snode = node->new_addresses(0);\n TC_ASSERT(sizeof...(indices) == snode->num_active_indices);\n int ind[max_num_indices];\n std::memset(ind, 0, sizeof(ind));\n auto tup = std::make_tuple(indices...);\n#define LOAD_IND(i) ind[snode->index_order[i]] = ((int *)&tup)[i];\n LOAD_IND(0);\n LOAD_IND(1);\n LOAD_IND(2);\n LOAD_IND(3);\n#undef LOAD_IND\n TC_ASSERT(max_num_indices == 4);\n return evaluate_addr(ind[0], ind[1], ind[2], ind[3]);\n}\n\ntemplate void *Expr::val_tmp<int>(int);\ntemplate void *Expr::val_tmp<int, int>(int, int);\ntemplate void *Expr::val_tmp<int, int, int>(int, int, int);\ntemplate void *Expr::val_tmp<int, int, int, int>(int, int, int, int);\n\nTLANG_NAMESPACE_END\n\n<commit_msg>damn C++...<commit_after>#include \"tlang.h\"\n#include \"structural_node.h\"\n#include <tuple>\n\nTLANG_NAMESPACE_BEGIN\n\nint Expr::index_counter = 0;\n\nExpr &Expr::operator=(const Expr &o) {\n \/\/ TC_ASSERT(allow_store);\n if (!allow_store || !node || node->type != NodeType::pointer) {\n \/\/ Expr assignment\n node = o.node;\n } else {\n \/\/ store to pointed addr\n TC_ASSERT(node->type == NodeType::pointer);\n auto &prog = get_current_program();\n \/\/ TC_ASSERT(&prog != nullptr);\n \/\/ TC_ASSERT(node->get_address().initialized());\n prog.store(*this, load_if_pointer(o));\n }\n return *this;\n}\n\nExpr Expr::operator[](const Expr &i) {\n TC_ASSERT(i);\n TC_ASSERT(node->type == NodeType::addr);\n TC_ASSERT(i->type == NodeType::index || i->data_type == DataType::i32);\n return create(NodeType::pointer, *this, i);\n}\n\nExpr Expr::operator[](const ExprGroup &is) {\n TC_ASSERT(is.size() > 0 && is.size() <= 2);\n TC_ASSERT(node->type == NodeType::addr);\n for (auto &i : is.exprs) {\n TC_ASSERT(i);\n TC_ASSERT(i->type == NodeType::index || i->data_type == DataType::i32);\n }\n if (is.size() == 1) {\n auto n = create(NodeType::pointer, *this, is.exprs[0]);\n n->data_type = (*this)->data_type;\n return n;\n } else {\n auto n = create(NodeType::pointer, *this, is.exprs[0], is.exprs[1]);\n n->data_type = (*this)->data_type;\n return n;\n }\n}\n\nvoid *Expr::evaluate_addr(int i, int j, int k, int l) {\n TC_ASSERT(node->lanes == 1);\n return node->new_addresses(0)->evaluate(get_current_program().data_structure,\n i, j, k, l);\n}\n\nbool Expr::allow_store = false;\n\/\/ assignment should not be used outside function definition; use \"Expr::set\"\n\/\/ instead\n\ntemplate <int i, typename... Indices>\nstd::enable_if_t<(i < sizeof...(Indices)), int> get_if_exists(\n std::tuple<Indices...> tup) {\n return std::get<i>(tup);\n}\n\ntemplate <int i, typename... Indices>\nstd::enable_if_t<!(i < sizeof...(Indices)), int> get_if_exists(\n std::tuple<Indices...> tup) {\n return 0;\n}\n\ntemplate <typename... Indices>\nvoid *Expr::val_tmp(Indices... indices) {\n TC_ASSERT(node->type == NodeType::addr);\n SNode *snode = node->new_addresses(0);\n TC_ASSERT(sizeof...(indices) == snode->num_active_indices);\n int ind[max_num_indices];\n std::memset(ind, 0, sizeof(ind));\n auto tup = std::make_tuple(indices...);\n#define LOAD_IND(i) ind[snode->index_order[i]] = get_if_exists<i>(tup);\n LOAD_IND(0);\n LOAD_IND(1);\n LOAD_IND(2);\n LOAD_IND(3);\n#undef LOAD_IND\n TC_ASSERT(max_num_indices == 4);\n \/*\n TC_P(snode->index_order[0]);\n TC_P(snode->index_order[1]);\n TC_P(snode->index_order[2]);\n TC_P(snode->index_order[3]);\n TC_P(ind[0]);\n TC_P(ind[1]);\n TC_P(ind[2]);\n TC_P(ind[3]);\n TC_P(((int *)&tup)[0]);\n TC_P(((int *)&tup)[1]);\n TC_P(((int *)&tup)[2]);\n TC_P(((int *)&tup)[3]);\n *\/\n return evaluate_addr(ind[0], ind[1], ind[2], ind[3]);\n}\n\ntemplate void *Expr::val_tmp<int>(int);\ntemplate void *Expr::val_tmp<int, int>(int, int);\ntemplate void *Expr::val_tmp<int, int, int>(int, int, int);\ntemplate void *Expr::val_tmp<int, int, int, int>(int, int, int, int);\n\nTLANG_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>#include \"Util.h\"\n#include \"Introspection.h\"\n#include \"Debug.h\"\n#include \"Error.h\"\n#include <sstream>\n#include <map>\n#include <atomic>\n#include <mutex>\n#include <string>\n#include <iomanip>\n\n#ifdef _MSC_VER\n#include <io.h>\n#else\n#include <unistd.h>\n#include <stdlib.h>\n#endif\n#include <sys\/types.h>\n#include <sys\/stat.h>\n\n#ifdef __linux__\n#include <linux\/limits.h> \/\/ For PATH_MAX\n#endif\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\nusing std::vector;\nusing std::ostringstream;\nusing std::map;\n\nstd::string get_env_variable(char const *env_var_name, size_t &read) {\n if (!env_var_name) {\n return \"\";\n }\n read = 0;\n\n #ifdef _MSC_VER\n char lvl[32];\n getenv_s(&read, lvl, env_var_name);\n #else\n char *lvl = getenv(env_var_name);\n read = (lvl)?1:0;\n #endif\n\n if (read) {\n return std::string(lvl);\n }\n else {\n return \"\";\n }\n}\n\nstring running_program_name() {\n \/\/ linux specific currently.\n #ifndef __linux__\n return \"\";\n #else\n string program_name;\n char path[PATH_MAX];\n ssize_t len = ::readlink(\"\/proc\/self\/exe\", path, sizeof(path)-1);\n if (len != -1) {\n path[len] = '\\0';\n string tmp = std::string(path);\n program_name = tmp.substr(tmp.find_last_of(\"\/\")+1);\n }\n else {\n return \"\";\n }\n return program_name;\n #endif\n}\n\nnamespace {\n\/\/ We use 64K of memory to store unique counters for the purpose of\n\/\/ making names unique. Using less memory increases the likelihood of\n\/\/ hash collisions. This wouldn't break anything, but makes stmts\n\/\/ slightly confusing to read because names that are actually unique\n\/\/ will get suffixes that falsely hint that they are not.\n\nconst int num_unique_name_counters = (1 << 14);\nstd::atomic<int> unique_name_counters[num_unique_name_counters];\n\nint unique_count(size_t h) {\n h = h & (num_unique_name_counters - 1);\n return unique_name_counters[h]++;\n}\n}\n\n\/\/ There are three possible families of names returned by the methods below:\n\/\/ 1) char pattern: (char that isn't '$') + number (e.g. v234)\n\/\/ 2) string pattern: (string without '$') + '$' + number (e.g. fr#nk82$42)\n\/\/ 3) a string that does not match the patterns above\n\/\/ There are no collisions within each family, due to the unique_count\n\/\/ done above, and there can be no collisions across families by\n\/\/ construction.\n\nstring unique_name(char prefix) {\n if (prefix == '$') prefix = '_';\n return prefix + std::to_string(unique_count((size_t)(prefix)));\n}\n\nstring unique_name(const std::string &prefix) {\n string sanitized = prefix;\n\n \/\/ Does the input string look like something returned from unique_name(char)?\n bool matches_char_pattern = true;\n\n \/\/ Does the input string look like something returned from unique_name(string)?\n bool matches_string_pattern = true;\n\n \/\/ Rewrite '$' to '_'. This is a many-to-one mapping, but that's\n \/\/ OK, we're about to hash anyway. It just means that some names\n \/\/ will share the same counter.\n int num_dollars = 0;\n for (size_t i = 0; i < sanitized.size(); i++) {\n if (sanitized[i] == '$') {\n num_dollars++;\n sanitized[i] = '_';\n }\n if (i > 0 && !isdigit(sanitized[i])) {\n \/\/ Found a non-digit after the first char\n matches_char_pattern = false;\n if (num_dollars) {\n \/\/ Found a non-digit after a '$'\n matches_string_pattern = false;\n }\n }\n }\n matches_string_pattern &= num_dollars == 1;\n matches_char_pattern &= prefix.size() > 1;\n\n \/\/ Then add a suffix that's globally unique relative to the hash\n \/\/ of the sanitized name.\n int count = unique_count(std::hash<std::string>()(sanitized));\n if (count == 0) {\n \/\/ We can return the name as-is if there's no risk of it\n \/\/ looking like something unique_name has ever returned in the\n \/\/ past or will ever return in the future.\n if (!matches_char_pattern && !matches_string_pattern) {\n return prefix;\n }\n }\n\n return sanitized + \"$\" + std::to_string(count);\n}\n\n\n\nbool starts_with(const string &str, const string &prefix) {\n if (str.size() < prefix.size()) return false;\n for (size_t i = 0; i < prefix.size(); i++) {\n if (str[i] != prefix[i]) return false;\n }\n return true;\n}\n\nbool ends_with(const string &str, const string &suffix) {\n if (str.size() < suffix.size()) return false;\n size_t off = str.size() - suffix.size();\n for (size_t i = 0; i < suffix.size(); i++) {\n if (str[off+i] != suffix[i]) return false;\n }\n return true;\n}\n\nstring replace_all(const string &str, const string &find, const string &replace) {\n size_t pos = 0;\n string result = str;\n while ((pos = result.find(find, pos)) != string::npos) {\n result.replace(pos, find.length(), replace);\n pos += replace.length();\n }\n return result;\n}\n\nstring make_entity_name(void *stack_ptr, const string &type, char prefix) {\n string name = Introspection::get_variable_name(stack_ptr, type);\n\n if (name.empty()) {\n return unique_name(prefix);\n } else {\n \/\/ Halide names may not contain '.'\n for (size_t i = 0; i < name.size(); i++) {\n if (name[i] == '.') {\n name[i] = ':';\n }\n }\n return unique_name(name);\n }\n}\n\nstd::vector<std::string> split_string(const std::string &source, const std::string &delim) {\n std::vector<std::string> elements;\n size_t start = 0;\n size_t found = 0;\n while ((found = source.find(delim, start)) != std::string::npos) {\n elements.push_back(source.substr(start, found - start));\n start = found + delim.size();\n }\n\n \/\/ If start is exactly source.size(), the last thing in source is a\n \/\/ delimiter, in which case we want to add an empty string to elements.\n if (start <= source.size()) {\n elements.push_back(source.substr(start, std::string::npos));\n }\n return elements;\n}\n\nstd::string extract_namespaces(const std::string &name, std::vector<std::string> &namespaces) {\n namespaces = split_string(name, \"::\");\n std::string result = namespaces.back();\n namespaces.pop_back();\n return result;\n}\n\nbool file_exists(const std::string &name) {\n #ifdef _MSC_VER\n return _access(name.c_str(), 0) == 0;\n #else\n return ::access(name.c_str(), F_OK) == 0;\n #endif\n}\n\nvoid file_unlink(const std::string &name) {\n #ifdef _MSC_VER\n _unlink(name.c_str());\n #else\n ::unlink(name.c_str());\n #endif\n}\n\nvoid dir_rmdir(const std::string &name) {\n #ifdef _MSC_VER\n BOOL r = RemoveDirectoryA(name.c_str());\n internal_assert(r != 0) << \"Unable to remove dir: \" << name << \":\" << GetLastError() << \"\\n\";\n #else\n int r = ::rmdir(name.c_str());\n internal_assert(r == 0) << \"Unable to remove dir: \" << name << \"\\n\";\n #endif\n}\n\nFileStat file_stat(const std::string &name) {\n #ifdef _MSC_VER\n struct _stat a;\n if (_stat(name.c_str(), &a) != 0) {\n user_error << \"Could not stat \" << name << \"\\n\";\n }\n #else\n struct stat a;\n if (::stat(name.c_str(), &a) != 0) {\n user_error << \"Could not stat \" << name << \"\\n\";\n }\n #endif\n return {static_cast<uint64_t>(a.st_size),\n static_cast<uint32_t>(a.st_mtime),\n static_cast<uint32_t>(a.st_uid),\n static_cast<uint32_t>(a.st_gid),\n static_cast<uint32_t>(a.st_mode)};\n}\n\nstd::string file_make_temp(const std::string &prefix, const std::string &suffix) {\n internal_assert(prefix.find(\"\/\") == string::npos &&\n prefix.find(\"\\\\\") == string::npos &&\n suffix.find(\"\/\") == string::npos &&\n suffix.find(\"\\\\\") == string::npos);\n #ifdef _WIN32\n \/\/ Windows implementations of mkstemp() try to create the file in the root\n \/\/ directory, which is... problematic.\n char tmp_path[MAX_PATH], tmp_file[MAX_PATH];\n DWORD ret = GetTempPathA(MAX_PATH, tmp_path);\n internal_assert(ret != 0);\n \/\/ Note that GetTempFileNameA() actually creates the file.\n ret = GetTempFileNameA(tmp_path, prefix.c_str(), 0, tmp_file);\n internal_assert(ret != 0);\n return std::string(tmp_file);\n #else\n std::string templ = \"\/tmp\/\" + prefix + \"XXXXXX\" + suffix;\n \/\/ Copy into a temporary buffer, since mkstemp modifies the buffer in place.\n std::vector<char> buf(templ.size() + 1);\n strcpy(&buf[0], templ.c_str());\n int fd = mkstemps(&buf[0], suffix.size());\n internal_assert(fd != -1) << \"Unable to create temp file for (\" << &buf[0] << \")\\n\";\n close(fd);\n return std::string(&buf[0]);\n #endif\n}\n\nstd::string dir_make_temp() {\n #ifdef _WIN32\n char tmp_path[MAX_PATH];\n DWORD ret = GetTempPathA(MAX_PATH, tmp_path);\n internal_assert(ret != 0);\n \/\/ There's no direct API to do this in Windows;\n \/\/ our clunky-but-adequate approach here is to use \n \/\/ CoCreateGuid() to create a probably-unique name.\n \/\/ Add a limit on the number of tries just in case.\n for (int tries = 0; tries < 100; ++tries) {\n GUID guid;\n HRESULT hr = CoCreateGuid(&guid);\n internal_assert(hr == S_OK);\n std::ostringstream name;\n name << std::hex\n << std::setw(8)\n << guid.Data1\n << std::setw(4)\n << guid.Data2\n << guid.Data3\n << std::setw(2);\n for (int i = 0; i < 8; i++) {\n name << guid.Data4[i];\n } \n std::string dir = std::string(tmp_path) + std::string(name.str());\n BOOL result = CreateDirectoryA(dir.c_str(), nullptr);\n if (result) {\n debug(1) << \"temp dir is: \" << dir << \"\\n\";\n return dir;\n }\n \/\/ If name already existed, just loop and try again.\n \/\/ Any other error, break from loop and fail.\n if (GetLastError() != ERROR_ALREADY_EXISTS) {\n break;\n }\n }\n internal_assert(false) << \"Unable to create temp directory.\\n\";\n return \"\";\n #else\n std::string templ = \"\/tmp\/XXXXXX\";\n \/\/ Copy into a temporary buffer, since mkdtemp modifies the buffer in place.\n std::vector<char> buf(templ.size() + 1);\n strcpy(&buf[0], templ.c_str());\n char* result = mkdtemp(&buf[0]);\n internal_assert(result != nullptr) << \"Unable to create temp directory.\\n\";\n return std::string(result);\n #endif\n}\n\nbool add_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n return\n ((b > 0 && a > max_val - b) || \/\/ (a + b) > max_val, rewritten to avoid overflow\n (b < 0 && a < min_val - b)); \/\/ (a + b) < min_val, rewritten to avoid overflow\n}\n\nbool sub_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n return\n ((b < 0 && a > max_val + b) || \/\/ (a - b) > max_val, rewritten to avoid overflow\n (b > 0 && a < min_val + b)); \/\/ (a - b) < min_val, rewritten to avoid overflow\n}\n\nbool mul_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n if (a == 0) {\n return false;\n } else if (a == -1) {\n return b == min_val;\n } else {\n \/\/ Do the multiplication as a uint64, for which overflow is\n \/\/ well defined, then cast the bits back to int64 to get\n \/\/ multiplication modulo 2^64.\n int64_t ab = (int64_t)((uint64_t)a)*((uint64_t)b);\n \/\/ The first two clauses catch overflow mod 2^bits, assuming\n \/\/ no 64-bit overflow occurs, and the third clause catches\n \/\/ 64-bit overflow.\n return ab < min_val || ab > max_val || (ab \/ a != b);\n }\n}\n\n}\n}\n<commit_msg>Actual mingw fix<commit_after>#include \"Util.h\"\n#include \"Introspection.h\"\n#include \"Debug.h\"\n#include \"Error.h\"\n#include <sstream>\n#include <map>\n#include <atomic>\n#include <mutex>\n#include <string>\n#include <iomanip>\n\n#ifdef _MSC_VER\n#include <io.h>\n#else\n#include <unistd.h>\n#include <stdlib.h>\n#endif\n#include <sys\/types.h>\n#include <sys\/stat.h>\n\n#ifdef __linux__\n#include <linux\/limits.h> \/\/ For PATH_MAX\n#endif\n#ifdef _WIN32\n#include <windows.h>\n#endif\n\nnamespace Halide {\nnamespace Internal {\n\nusing std::string;\nusing std::vector;\nusing std::ostringstream;\nusing std::map;\n\nstd::string get_env_variable(char const *env_var_name, size_t &read) {\n if (!env_var_name) {\n return \"\";\n }\n read = 0;\n\n #ifdef _MSC_VER\n char lvl[32];\n getenv_s(&read, lvl, env_var_name);\n #else\n char *lvl = getenv(env_var_name);\n read = (lvl)?1:0;\n #endif\n\n if (read) {\n return std::string(lvl);\n }\n else {\n return \"\";\n }\n}\n\nstring running_program_name() {\n \/\/ linux specific currently.\n #ifndef __linux__\n return \"\";\n #else\n string program_name;\n char path[PATH_MAX];\n ssize_t len = ::readlink(\"\/proc\/self\/exe\", path, sizeof(path)-1);\n if (len != -1) {\n path[len] = '\\0';\n string tmp = std::string(path);\n program_name = tmp.substr(tmp.find_last_of(\"\/\")+1);\n }\n else {\n return \"\";\n }\n return program_name;\n #endif\n}\n\nnamespace {\n\/\/ We use 64K of memory to store unique counters for the purpose of\n\/\/ making names unique. Using less memory increases the likelihood of\n\/\/ hash collisions. This wouldn't break anything, but makes stmts\n\/\/ slightly confusing to read because names that are actually unique\n\/\/ will get suffixes that falsely hint that they are not.\n\nconst int num_unique_name_counters = (1 << 14);\nstd::atomic<int> unique_name_counters[num_unique_name_counters];\n\nint unique_count(size_t h) {\n h = h & (num_unique_name_counters - 1);\n return unique_name_counters[h]++;\n}\n}\n\n\/\/ There are three possible families of names returned by the methods below:\n\/\/ 1) char pattern: (char that isn't '$') + number (e.g. v234)\n\/\/ 2) string pattern: (string without '$') + '$' + number (e.g. fr#nk82$42)\n\/\/ 3) a string that does not match the patterns above\n\/\/ There are no collisions within each family, due to the unique_count\n\/\/ done above, and there can be no collisions across families by\n\/\/ construction.\n\nstring unique_name(char prefix) {\n if (prefix == '$') prefix = '_';\n return prefix + std::to_string(unique_count((size_t)(prefix)));\n}\n\nstring unique_name(const std::string &prefix) {\n string sanitized = prefix;\n\n \/\/ Does the input string look like something returned from unique_name(char)?\n bool matches_char_pattern = true;\n\n \/\/ Does the input string look like something returned from unique_name(string)?\n bool matches_string_pattern = true;\n\n \/\/ Rewrite '$' to '_'. This is a many-to-one mapping, but that's\n \/\/ OK, we're about to hash anyway. It just means that some names\n \/\/ will share the same counter.\n int num_dollars = 0;\n for (size_t i = 0; i < sanitized.size(); i++) {\n if (sanitized[i] == '$') {\n num_dollars++;\n sanitized[i] = '_';\n }\n if (i > 0 && !isdigit(sanitized[i])) {\n \/\/ Found a non-digit after the first char\n matches_char_pattern = false;\n if (num_dollars) {\n \/\/ Found a non-digit after a '$'\n matches_string_pattern = false;\n }\n }\n }\n matches_string_pattern &= num_dollars == 1;\n matches_char_pattern &= prefix.size() > 1;\n\n \/\/ Then add a suffix that's globally unique relative to the hash\n \/\/ of the sanitized name.\n int count = unique_count(std::hash<std::string>()(sanitized));\n if (count == 0) {\n \/\/ We can return the name as-is if there's no risk of it\n \/\/ looking like something unique_name has ever returned in the\n \/\/ past or will ever return in the future.\n if (!matches_char_pattern && !matches_string_pattern) {\n return prefix;\n }\n }\n\n return sanitized + \"$\" + std::to_string(count);\n}\n\n\n\nbool starts_with(const string &str, const string &prefix) {\n if (str.size() < prefix.size()) return false;\n for (size_t i = 0; i < prefix.size(); i++) {\n if (str[i] != prefix[i]) return false;\n }\n return true;\n}\n\nbool ends_with(const string &str, const string &suffix) {\n if (str.size() < suffix.size()) return false;\n size_t off = str.size() - suffix.size();\n for (size_t i = 0; i < suffix.size(); i++) {\n if (str[off+i] != suffix[i]) return false;\n }\n return true;\n}\n\nstring replace_all(const string &str, const string &find, const string &replace) {\n size_t pos = 0;\n string result = str;\n while ((pos = result.find(find, pos)) != string::npos) {\n result.replace(pos, find.length(), replace);\n pos += replace.length();\n }\n return result;\n}\n\nstring make_entity_name(void *stack_ptr, const string &type, char prefix) {\n string name = Introspection::get_variable_name(stack_ptr, type);\n\n if (name.empty()) {\n return unique_name(prefix);\n } else {\n \/\/ Halide names may not contain '.'\n for (size_t i = 0; i < name.size(); i++) {\n if (name[i] == '.') {\n name[i] = ':';\n }\n }\n return unique_name(name);\n }\n}\n\nstd::vector<std::string> split_string(const std::string &source, const std::string &delim) {\n std::vector<std::string> elements;\n size_t start = 0;\n size_t found = 0;\n while ((found = source.find(delim, start)) != std::string::npos) {\n elements.push_back(source.substr(start, found - start));\n start = found + delim.size();\n }\n\n \/\/ If start is exactly source.size(), the last thing in source is a\n \/\/ delimiter, in which case we want to add an empty string to elements.\n if (start <= source.size()) {\n elements.push_back(source.substr(start, std::string::npos));\n }\n return elements;\n}\n\nstd::string extract_namespaces(const std::string &name, std::vector<std::string> &namespaces) {\n namespaces = split_string(name, \"::\");\n std::string result = namespaces.back();\n namespaces.pop_back();\n return result;\n}\n\nbool file_exists(const std::string &name) {\n #ifdef _MSC_VER\n return _access(name.c_str(), 0) == 0;\n #else\n return ::access(name.c_str(), F_OK) == 0;\n #endif\n}\n\nvoid file_unlink(const std::string &name) {\n #ifdef _MSC_VER\n _unlink(name.c_str());\n #else\n ::unlink(name.c_str());\n #endif\n}\n\nvoid dir_rmdir(const std::string &name) {\n #ifdef _MSC_VER\n BOOL r = RemoveDirectoryA(name.c_str());\n internal_assert(r != 0) << \"Unable to remove dir: \" << name << \":\" << GetLastError() << \"\\n\";\n #else\n int r = ::rmdir(name.c_str());\n internal_assert(r == 0) << \"Unable to remove dir: \" << name << \"\\n\";\n #endif\n}\n\nFileStat file_stat(const std::string &name) {\n #ifdef _MSC_VER\n struct _stat a;\n if (_stat(name.c_str(), &a) != 0) {\n user_error << \"Could not stat \" << name << \"\\n\";\n }\n #else\n struct stat a;\n if (::stat(name.c_str(), &a) != 0) {\n user_error << \"Could not stat \" << name << \"\\n\";\n }\n #endif\n return {static_cast<uint64_t>(a.st_size),\n static_cast<uint32_t>(a.st_mtime),\n static_cast<uint32_t>(a.st_uid),\n static_cast<uint32_t>(a.st_gid),\n static_cast<uint32_t>(a.st_mode)};\n}\n\nstd::string file_make_temp(const std::string &prefix, const std::string &suffix) {\n internal_assert(prefix.find(\"\/\") == string::npos &&\n prefix.find(\"\\\\\") == string::npos &&\n suffix.find(\"\/\") == string::npos &&\n suffix.find(\"\\\\\") == string::npos);\n #ifdef _WIN32\n \/\/ Windows implementations of mkstemp() try to create the file in the root\n \/\/ directory, which is... problematic.\n char tmp_path[MAX_PATH], tmp_file[MAX_PATH];\n DWORD ret = GetTempPathA(MAX_PATH, tmp_path);\n internal_assert(ret != 0);\n \/\/ Note that GetTempFileNameA() actually creates the file.\n ret = GetTempFileNameA(tmp_path, prefix.c_str(), 0, tmp_file);\n internal_assert(ret != 0);\n return std::string(tmp_file);\n #else\n std::string templ = \"\/tmp\/\" + prefix + \"XXXXXX\" + suffix;\n \/\/ Copy into a temporary buffer, since mkstemp modifies the buffer in place.\n std::vector<char> buf(templ.size() + 1);\n strcpy(&buf[0], templ.c_str());\n int fd = mkstemps(&buf[0], suffix.size());\n internal_assert(fd != -1) << \"Unable to create temp file for (\" << &buf[0] << \")\\n\";\n close(fd);\n return std::string(&buf[0]);\n #endif\n}\n\nstd::string dir_make_temp() {\n #ifdef _WIN32\n char tmp_path[MAX_PATH];\n DWORD ret = GetTempPathA(MAX_PATH, tmp_path);\n internal_assert(ret != 0);\n \/\/ There's no direct API to do this in Windows;\n \/\/ our clunky-but-adequate approach here is to use \n \/\/ CoCreateGuid() to create a probably-unique name.\n \/\/ Add a limit on the number of tries just in case.\n for (int tries = 0; tries < 100; ++tries) {\n GUID guid;\n HRESULT hr = CoCreateGuid(&guid);\n internal_assert(hr == S_OK);\n std::ostringstream name;\n name << std::hex\n\t << std::setfill('0')\n << std::setw(8)\n << guid.Data1\n << std::setw(4)\n << guid.Data2\n << guid.Data3\n << std::setw(2);\n for (int i = 0; i < 8; i++) {\n name << (int)guid.Data4[i];\n } \n std::string dir = std::string(tmp_path) + std::string(name.str());\n BOOL result = CreateDirectoryA(dir.c_str(), nullptr);\n if (result) {\n debug(1) << \"temp dir is: \" << dir << \"\\n\";\n return dir;\n }\n \/\/ If name already existed, just loop and try again.\n \/\/ Any other error, break from loop and fail.\n if (GetLastError() != ERROR_ALREADY_EXISTS) {\n break;\n }\n }\n internal_assert(false) << \"Unable to create temp directory.\\n\";\n return \"\";\n #else\n std::string templ = \"\/tmp\/XXXXXX\";\n \/\/ Copy into a temporary buffer, since mkdtemp modifies the buffer in place.\n std::vector<char> buf(templ.size() + 1);\n strcpy(&buf[0], templ.c_str());\n char* result = mkdtemp(&buf[0]);\n internal_assert(result != nullptr) << \"Unable to create temp directory.\\n\";\n return std::string(result);\n #endif\n}\n\nbool add_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n return\n ((b > 0 && a > max_val - b) || \/\/ (a + b) > max_val, rewritten to avoid overflow\n (b < 0 && a < min_val - b)); \/\/ (a + b) < min_val, rewritten to avoid overflow\n}\n\nbool sub_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n return\n ((b < 0 && a > max_val + b) || \/\/ (a - b) > max_val, rewritten to avoid overflow\n (b > 0 && a < min_val + b)); \/\/ (a - b) < min_val, rewritten to avoid overflow\n}\n\nbool mul_would_overflow(int bits, int64_t a, int64_t b) {\n int64_t max_val = 0x7fffffffffffffffLL >> (64 - bits);\n int64_t min_val = -max_val - 1;\n if (a == 0) {\n return false;\n } else if (a == -1) {\n return b == min_val;\n } else {\n \/\/ Do the multiplication as a uint64, for which overflow is\n \/\/ well defined, then cast the bits back to int64 to get\n \/\/ multiplication modulo 2^64.\n int64_t ab = (int64_t)((uint64_t)a)*((uint64_t)b);\n \/\/ The first two clauses catch overflow mod 2^bits, assuming\n \/\/ no 64-bit overflow occurs, and the third clause catches\n \/\/ 64-bit overflow.\n return ab < min_val || ab > max_val || (ab \/ a != b);\n }\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\n *\/\n\n#include \"webrtc\/modules\/bitrate_controller\/bitrate_controller_impl.h\"\n\n#include <algorithm>\n#include <map>\n#include <utility>\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/base\/logging.h\"\n#include \"webrtc\/modules\/remote_bitrate_estimator\/test\/bwe_test_logging.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/include\/rtp_rtcp_defines.h\"\n\nnamespace webrtc {\n\nclass BitrateControllerImpl::RtcpBandwidthObserverImpl\n : public RtcpBandwidthObserver {\n public:\n explicit RtcpBandwidthObserverImpl(BitrateControllerImpl* owner)\n : owner_(owner) {\n }\n virtual ~RtcpBandwidthObserverImpl() {\n }\n \/\/ Received RTCP REMB or TMMBR.\n void OnReceivedEstimatedBitrate(uint32_t bitrate) override {\n owner_->OnReceiverEstimatedBitrate(bitrate);\n }\n \/\/ Received RTCP receiver block.\n void OnReceivedRtcpReceiverReport(const ReportBlockList& report_blocks,\n int64_t rtt,\n int64_t now_ms) override {\n int fraction_lost_aggregate = 0;\n int total_number_of_packets = 0;\n\n \/\/ Compute the a weighted average of the fraction loss from all report\n \/\/ blocks.\n for (const RTCPReportBlock& report_block : report_blocks) {\n std::map<uint32_t, uint32_t>::iterator seq_num_it =\n ssrc_to_last_received_extended_high_seq_num_.find(\n report_block.sourceSSRC);\n\n int number_of_packets = 0;\n if (seq_num_it != ssrc_to_last_received_extended_high_seq_num_.end()) {\n number_of_packets =\n report_block.extendedHighSeqNum - seq_num_it->second;\n }\n\n fraction_lost_aggregate += number_of_packets * report_block.fractionLost;\n total_number_of_packets += number_of_packets;\n\n \/\/ Update last received for this SSRC.\n ssrc_to_last_received_extended_high_seq_num_[report_block.sourceSSRC] =\n report_block.extendedHighSeqNum;\n }\n if (total_number_of_packets < 0) {\n LOG(LS_WARNING) << \"Received report block where extended high sequence \"\n \"number goes backwards, ignoring.\";\n return;\n }\n if (total_number_of_packets == 0)\n fraction_lost_aggregate = 0;\n else\n fraction_lost_aggregate = (fraction_lost_aggregate +\n total_number_of_packets \/ 2) \/ total_number_of_packets;\n if (fraction_lost_aggregate > 255)\n return;\n\n RTC_DCHECK_GE(total_number_of_packets, 0);\n\n owner_->OnReceivedRtcpReceiverReport(fraction_lost_aggregate, rtt,\n total_number_of_packets, now_ms);\n }\n\n private:\n std::map<uint32_t, uint32_t> ssrc_to_last_received_extended_high_seq_num_;\n BitrateControllerImpl* owner_;\n};\n\nBitrateController* BitrateController::CreateBitrateController(\n Clock* clock,\n BitrateObserver* observer,\n RtcEventLog* event_log) {\n return new BitrateControllerImpl(clock, observer, event_log);\n}\n\nBitrateController* BitrateController::CreateBitrateController(\n Clock* clock,\n RtcEventLog* event_log) {\n return CreateBitrateController(clock, nullptr, event_log);\n}\n\nBitrateControllerImpl::BitrateControllerImpl(Clock* clock,\n BitrateObserver* observer,\n RtcEventLog* event_log)\n : clock_(clock),\n observer_(observer),\n last_bitrate_update_ms_(clock_->TimeInMilliseconds()),\n event_log_(event_log),\n bandwidth_estimation_(event_log),\n reserved_bitrate_bps_(0),\n last_bitrate_bps_(0),\n last_fraction_loss_(0),\n last_rtt_ms_(0),\n last_reserved_bitrate_bps_(0) {\n \/\/ This calls the observer_ if set, which means that the observer provided by\n \/\/ the user must be ready to accept a bitrate update when it constructs the\n \/\/ controller. We do this to avoid having to keep synchronized initial values\n \/\/ in both the controller and the allocator.\n MaybeTriggerOnNetworkChanged();\n}\n\nRtcpBandwidthObserver* BitrateControllerImpl::CreateRtcpBandwidthObserver() {\n return new RtcpBandwidthObserverImpl(this);\n}\n\nvoid BitrateControllerImpl::SetStartBitrate(int start_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetSendBitrate(start_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetMinMaxBitrate(int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetMinMaxBitrate(min_bitrate_bps, max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetBitrates(int start_bitrate_bps,\n int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetBitrates(start_bitrate_bps,\n min_bitrate_bps,\n max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::ResetBitrates(int bitrate_bps,\n int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_ = SendSideBandwidthEstimation(event_log_);\n bandwidth_estimation_.SetBitrates(bitrate_bps, min_bitrate_bps,\n max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetReservedBitrate(uint32_t reserved_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n reserved_bitrate_bps_ = reserved_bitrate_bps;\n }\n MaybeTriggerOnNetworkChanged();\n}\n\n\/\/ This is called upon reception of REMB or TMMBR.\nvoid BitrateControllerImpl::OnReceiverEstimatedBitrate(uint32_t bitrate) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateReceiverEstimate(clock_->TimeInMilliseconds(),\n bitrate);\n BWE_TEST_LOGGING_PLOT(1, \"REMB_kbps\", clock_->TimeInMilliseconds(),\n bitrate \/ 1000);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::OnDelayBasedBweResult(\n const DelayBasedBwe::Result& result) {\n if (!result.updated)\n return;\n {\n rtc::CritScope cs(&critsect_);\n if (result.probe) {\n bandwidth_estimation_.SetSendBitrate(result.target_bitrate_bps);\n } else {\n bandwidth_estimation_.UpdateDelayBasedEstimate(\n clock_->TimeInMilliseconds(), result.target_bitrate_bps);\n }\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nint64_t BitrateControllerImpl::TimeUntilNextProcess() {\n const int64_t kBitrateControllerUpdateIntervalMs = 25;\n rtc::CritScope cs(&critsect_);\n int64_t time_since_update_ms =\n clock_->TimeInMilliseconds() - last_bitrate_update_ms_;\n return std::max<int64_t>(\n kBitrateControllerUpdateIntervalMs - time_since_update_ms, 0);\n}\n\nvoid BitrateControllerImpl::Process() {\n if (TimeUntilNextProcess() > 0)\n return;\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateEstimate(clock_->TimeInMilliseconds());\n }\n MaybeTriggerOnNetworkChanged();\n last_bitrate_update_ms_ = clock_->TimeInMilliseconds();\n}\n\nvoid BitrateControllerImpl::OnReceivedRtcpReceiverReport(\n uint8_t fraction_loss,\n int64_t rtt,\n int number_of_packets,\n int64_t now_ms) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateReceiverBlock(fraction_loss, rtt,\n number_of_packets, now_ms);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::MaybeTriggerOnNetworkChanged() {\n if (!observer_)\n return;\n\n uint32_t bitrate_bps;\n uint8_t fraction_loss;\n int64_t rtt;\n\n if (GetNetworkParameters(&bitrate_bps, &fraction_loss, &rtt))\n observer_->OnNetworkChanged(bitrate_bps, fraction_loss, rtt);\n}\n\nbool BitrateControllerImpl::GetNetworkParameters(uint32_t* bitrate,\n uint8_t* fraction_loss,\n int64_t* rtt) {\n rtc::CritScope cs(&critsect_);\n int current_bitrate;\n bandwidth_estimation_.CurrentEstimate(¤t_bitrate, fraction_loss, rtt);\n *bitrate = current_bitrate;\n *bitrate -= std::min(*bitrate, reserved_bitrate_bps_);\n *bitrate =\n std::max<uint32_t>(*bitrate, bandwidth_estimation_.GetMinBitrate());\n\n bool new_bitrate = false;\n if (*bitrate != last_bitrate_bps_ || *fraction_loss != last_fraction_loss_ ||\n *rtt != last_rtt_ms_ ||\n last_reserved_bitrate_bps_ != reserved_bitrate_bps_) {\n last_bitrate_bps_ = *bitrate;\n last_fraction_loss_ = *fraction_loss;\n last_rtt_ms_ = *rtt;\n last_reserved_bitrate_bps_ = reserved_bitrate_bps_;\n new_bitrate = true;\n }\n\n BWE_TEST_LOGGING_PLOT(1, \"fraction_loss_%\", clock_->TimeInMilliseconds(),\n (last_fraction_loss_ * 100) \/ 256);\n BWE_TEST_LOGGING_PLOT(1, \"rtt_ms\", clock_->TimeInMilliseconds(),\n last_rtt_ms_);\n BWE_TEST_LOGGING_PLOT(1, \"Target_bitrate_kbps\", clock_->TimeInMilliseconds(),\n last_bitrate_bps_ \/ 1000);\n\n return new_bitrate;\n}\n\nbool BitrateControllerImpl::AvailableBandwidth(uint32_t* bandwidth) const {\n rtc::CritScope cs(&critsect_);\n int bitrate;\n uint8_t fraction_loss;\n int64_t rtt;\n bandwidth_estimation_.CurrentEstimate(&bitrate, &fraction_loss, &rtt);\n if (bitrate > 0) {\n bitrate = bitrate - std::min<int>(bitrate, reserved_bitrate_bps_);\n bitrate = std::max(bitrate, bandwidth_estimation_.GetMinBitrate());\n *bandwidth = bitrate;\n return true;\n }\n return false;\n}\n} \/\/ namespace webrtc\n<commit_msg>Fix BitrateControllerImpl not to ignore BW probe results mid-call.<commit_after>\/*\n * Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\n *\/\n\n#include \"webrtc\/modules\/bitrate_controller\/bitrate_controller_impl.h\"\n\n#include <algorithm>\n#include <map>\n#include <utility>\n\n#include \"webrtc\/base\/checks.h\"\n#include \"webrtc\/base\/logging.h\"\n#include \"webrtc\/modules\/remote_bitrate_estimator\/test\/bwe_test_logging.h\"\n#include \"webrtc\/modules\/rtp_rtcp\/include\/rtp_rtcp_defines.h\"\n\nnamespace webrtc {\n\nclass BitrateControllerImpl::RtcpBandwidthObserverImpl\n : public RtcpBandwidthObserver {\n public:\n explicit RtcpBandwidthObserverImpl(BitrateControllerImpl* owner)\n : owner_(owner) {\n }\n virtual ~RtcpBandwidthObserverImpl() {\n }\n \/\/ Received RTCP REMB or TMMBR.\n void OnReceivedEstimatedBitrate(uint32_t bitrate) override {\n owner_->OnReceiverEstimatedBitrate(bitrate);\n }\n \/\/ Received RTCP receiver block.\n void OnReceivedRtcpReceiverReport(const ReportBlockList& report_blocks,\n int64_t rtt,\n int64_t now_ms) override {\n int fraction_lost_aggregate = 0;\n int total_number_of_packets = 0;\n\n \/\/ Compute the a weighted average of the fraction loss from all report\n \/\/ blocks.\n for (const RTCPReportBlock& report_block : report_blocks) {\n std::map<uint32_t, uint32_t>::iterator seq_num_it =\n ssrc_to_last_received_extended_high_seq_num_.find(\n report_block.sourceSSRC);\n\n int number_of_packets = 0;\n if (seq_num_it != ssrc_to_last_received_extended_high_seq_num_.end()) {\n number_of_packets =\n report_block.extendedHighSeqNum - seq_num_it->second;\n }\n\n fraction_lost_aggregate += number_of_packets * report_block.fractionLost;\n total_number_of_packets += number_of_packets;\n\n \/\/ Update last received for this SSRC.\n ssrc_to_last_received_extended_high_seq_num_[report_block.sourceSSRC] =\n report_block.extendedHighSeqNum;\n }\n if (total_number_of_packets < 0) {\n LOG(LS_WARNING) << \"Received report block where extended high sequence \"\n \"number goes backwards, ignoring.\";\n return;\n }\n if (total_number_of_packets == 0)\n fraction_lost_aggregate = 0;\n else\n fraction_lost_aggregate = (fraction_lost_aggregate +\n total_number_of_packets \/ 2) \/ total_number_of_packets;\n if (fraction_lost_aggregate > 255)\n return;\n\n RTC_DCHECK_GE(total_number_of_packets, 0);\n\n owner_->OnReceivedRtcpReceiverReport(fraction_lost_aggregate, rtt,\n total_number_of_packets, now_ms);\n }\n\n private:\n std::map<uint32_t, uint32_t> ssrc_to_last_received_extended_high_seq_num_;\n BitrateControllerImpl* owner_;\n};\n\nBitrateController* BitrateController::CreateBitrateController(\n Clock* clock,\n BitrateObserver* observer,\n RtcEventLog* event_log) {\n return new BitrateControllerImpl(clock, observer, event_log);\n}\n\nBitrateController* BitrateController::CreateBitrateController(\n Clock* clock,\n RtcEventLog* event_log) {\n return CreateBitrateController(clock, nullptr, event_log);\n}\n\nBitrateControllerImpl::BitrateControllerImpl(Clock* clock,\n BitrateObserver* observer,\n RtcEventLog* event_log)\n : clock_(clock),\n observer_(observer),\n last_bitrate_update_ms_(clock_->TimeInMilliseconds()),\n event_log_(event_log),\n bandwidth_estimation_(event_log),\n reserved_bitrate_bps_(0),\n last_bitrate_bps_(0),\n last_fraction_loss_(0),\n last_rtt_ms_(0),\n last_reserved_bitrate_bps_(0) {\n \/\/ This calls the observer_ if set, which means that the observer provided by\n \/\/ the user must be ready to accept a bitrate update when it constructs the\n \/\/ controller. We do this to avoid having to keep synchronized initial values\n \/\/ in both the controller and the allocator.\n MaybeTriggerOnNetworkChanged();\n}\n\nRtcpBandwidthObserver* BitrateControllerImpl::CreateRtcpBandwidthObserver() {\n return new RtcpBandwidthObserverImpl(this);\n}\n\nvoid BitrateControllerImpl::SetStartBitrate(int start_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetSendBitrate(start_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetMinMaxBitrate(int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetMinMaxBitrate(min_bitrate_bps, max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetBitrates(int start_bitrate_bps,\n int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.SetBitrates(start_bitrate_bps,\n min_bitrate_bps,\n max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::ResetBitrates(int bitrate_bps,\n int min_bitrate_bps,\n int max_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_ = SendSideBandwidthEstimation(event_log_);\n bandwidth_estimation_.SetBitrates(bitrate_bps, min_bitrate_bps,\n max_bitrate_bps);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::SetReservedBitrate(uint32_t reserved_bitrate_bps) {\n {\n rtc::CritScope cs(&critsect_);\n reserved_bitrate_bps_ = reserved_bitrate_bps;\n }\n MaybeTriggerOnNetworkChanged();\n}\n\n\/\/ This is called upon reception of REMB or TMMBR.\nvoid BitrateControllerImpl::OnReceiverEstimatedBitrate(uint32_t bitrate) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateReceiverEstimate(clock_->TimeInMilliseconds(),\n bitrate);\n BWE_TEST_LOGGING_PLOT(1, \"REMB_kbps\", clock_->TimeInMilliseconds(),\n bitrate \/ 1000);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::OnDelayBasedBweResult(\n const DelayBasedBwe::Result& result) {\n if (!result.updated)\n return;\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateDelayBasedEstimate(clock_->TimeInMilliseconds(),\n result.target_bitrate_bps);\n if (result.probe) {\n bandwidth_estimation_.SetSendBitrate(result.target_bitrate_bps);\n }\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nint64_t BitrateControllerImpl::TimeUntilNextProcess() {\n const int64_t kBitrateControllerUpdateIntervalMs = 25;\n rtc::CritScope cs(&critsect_);\n int64_t time_since_update_ms =\n clock_->TimeInMilliseconds() - last_bitrate_update_ms_;\n return std::max<int64_t>(\n kBitrateControllerUpdateIntervalMs - time_since_update_ms, 0);\n}\n\nvoid BitrateControllerImpl::Process() {\n if (TimeUntilNextProcess() > 0)\n return;\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateEstimate(clock_->TimeInMilliseconds());\n }\n MaybeTriggerOnNetworkChanged();\n last_bitrate_update_ms_ = clock_->TimeInMilliseconds();\n}\n\nvoid BitrateControllerImpl::OnReceivedRtcpReceiverReport(\n uint8_t fraction_loss,\n int64_t rtt,\n int number_of_packets,\n int64_t now_ms) {\n {\n rtc::CritScope cs(&critsect_);\n bandwidth_estimation_.UpdateReceiverBlock(fraction_loss, rtt,\n number_of_packets, now_ms);\n }\n MaybeTriggerOnNetworkChanged();\n}\n\nvoid BitrateControllerImpl::MaybeTriggerOnNetworkChanged() {\n if (!observer_)\n return;\n\n uint32_t bitrate_bps;\n uint8_t fraction_loss;\n int64_t rtt;\n\n if (GetNetworkParameters(&bitrate_bps, &fraction_loss, &rtt))\n observer_->OnNetworkChanged(bitrate_bps, fraction_loss, rtt);\n}\n\nbool BitrateControllerImpl::GetNetworkParameters(uint32_t* bitrate,\n uint8_t* fraction_loss,\n int64_t* rtt) {\n rtc::CritScope cs(&critsect_);\n int current_bitrate;\n bandwidth_estimation_.CurrentEstimate(¤t_bitrate, fraction_loss, rtt);\n *bitrate = current_bitrate;\n *bitrate -= std::min(*bitrate, reserved_bitrate_bps_);\n *bitrate =\n std::max<uint32_t>(*bitrate, bandwidth_estimation_.GetMinBitrate());\n\n bool new_bitrate = false;\n if (*bitrate != last_bitrate_bps_ || *fraction_loss != last_fraction_loss_ ||\n *rtt != last_rtt_ms_ ||\n last_reserved_bitrate_bps_ != reserved_bitrate_bps_) {\n last_bitrate_bps_ = *bitrate;\n last_fraction_loss_ = *fraction_loss;\n last_rtt_ms_ = *rtt;\n last_reserved_bitrate_bps_ = reserved_bitrate_bps_;\n new_bitrate = true;\n }\n\n BWE_TEST_LOGGING_PLOT(1, \"fraction_loss_%\", clock_->TimeInMilliseconds(),\n (last_fraction_loss_ * 100) \/ 256);\n BWE_TEST_LOGGING_PLOT(1, \"rtt_ms\", clock_->TimeInMilliseconds(),\n last_rtt_ms_);\n BWE_TEST_LOGGING_PLOT(1, \"Target_bitrate_kbps\", clock_->TimeInMilliseconds(),\n last_bitrate_bps_ \/ 1000);\n\n return new_bitrate;\n}\n\nbool BitrateControllerImpl::AvailableBandwidth(uint32_t* bandwidth) const {\n rtc::CritScope cs(&critsect_);\n int bitrate;\n uint8_t fraction_loss;\n int64_t rtt;\n bandwidth_estimation_.CurrentEstimate(&bitrate, &fraction_loss, &rtt);\n if (bitrate > 0) {\n bitrate = bitrate - std::min<int>(bitrate, reserved_bitrate_bps_);\n bitrate = std::max(bitrate, bandwidth_estimation_.GetMinBitrate());\n *bandwidth = bitrate;\n return true;\n }\n return false;\n}\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/*\n * copyright: (c) RDO-Team, 2010\n * filename : rdortp.cpp\n * author : , \n * date : \n * bref : \n * indent : 4T\n *\/\n\n\/\/ ====================================================================== PCH\n#include \"rdo_lib\/rdo_parser\/pch.h\"\n\/\/ ====================================================================== INCLUDES\n\/\/ ====================================================================== SYNOPSIS\n#include \"rdo_lib\/rdo_parser\/rdortp.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser_lexer.h\"\n#include \"rdo_lib\/rdo_runtime\/rdocalc.h\"\n\/\/ ===============================================================================\n\nOPEN_RDO_PARSER_NAMESPACE\n\nint rtplex(PTR(YYSTYPE) lpval, PTR(YYLTYPE) llocp, PTR(void) lexer)\n{\n\tLEXER->m_lpval = lpval;\n\tLEXER->m_lploc = llocp;\n\treturn LEXER->yylex();\n}\n\nvoid rtperror(PTR(char) mes)\n{}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPResType\n\/\/ ----------------------------------------------------------------------------\nRDORTPResType::RDORTPResType(CREF(LPRDOParser) pParser, CREF(RDOParserSrcInfo) src_info, rbool permanent)\n\t: RDOParserSrcInfo(src_info )\n\t, m_number (pParser->getRTP_id())\n\t, m_permanent (permanent )\n{\n\tpParser->insertRTPResType(LPRDORTPResType(this));\n}\n\nRDORTPResType::~RDORTPResType()\n{}\n\nvoid RDORTPResType::addParam(CREF(LPRDORTPParam) param)\n{\n\tif (findRTPParam(param->name()))\n\t{\n\t\tRDOParser::s_parser()->error().error(param->src_info(), rdo::format(\" : %s\", param->name().c_str()));\n\t}\n\tm_params.push_back(param);\n}\n\nvoid RDORTPResType::addParam(CREF(tstring) param_name, rdoRuntime::RDOType::TypeID param_typeID)\n{\n}\n\nLPRDORTPParam RDORTPResType::findRTPParam(CREF(tstring) paramName) const\n{\n\tParamList::const_iterator it = std::find_if(m_params.begin(), m_params.end(), compareName<RDORTPParam>(paramName));\n\treturn it != m_params.end() ? *it : LPRDORTPParam();\n}\n\nruint RDORTPResType::getRTPParamNumber(CREF(tstring) paramName) const\n{\n\tParamList::const_iterator it = std::find_if(m_params.begin(), m_params.end(), compareName<RDORTPParam>(paramName));\n\treturn it != m_params.end() ? it - m_params.begin() : UNDEFINED_PARAM;\n}\n\nvoid RDORTPResType::writeModelStructure(REF(std::ostream) stream) const\n{\n\tstream << getNumber() << \" \" << name() << \" \" << getParams().size() << std::endl;\n\tfor (ruint i = 0; i < getParams().size(); i++)\n\t{\n\t\tstream << \" \" << (i+1) << \" \";\n\t\tgetParams().at(i)->writeModelStructure(stream);\n\t}\n}\n\n\/*\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPFuzzyMembershiftFun - - \n\/\/ ----------------------------------------------------------------------------\nRDORTPFuzzyMembershiftFun::RDORTPFuzzyMembershiftFun(CREF(LPRDOParser) pParser):\n\tRDOParserObject(pParser)\n{\n\/*\tfor (ruint i = 0; i < m_points.size(); i++)\n\t{\n\/\/\t\tdouble x = m_points[i]->getX();\n\t}\n\n\tItems::iterator it = m_points.begin();\n\twhile (it != m_points.end())\n\t{\n\t\tdouble x = (*it)->getX();\n\t\tit++;\n\t}\n}\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPFuzzyTerm - \n\/\/ ----------------------------------------------------------------------------\nRDORTPFuzzyTerm::RDORTPFuzzyTerm(CREF(LPRDOParser) pParser, CREF(RDOParserSrcInfo) src_info, PTR(RDORTPFuzzyMembershiftFun) pMembersfift_fun):\n\tRDOParserObject(pParser)\n{\n\n}*\/\n\nCLOSE_RDO_PARSER_NAMESPACE\n<commit_msg> - удалён лишний инклюд<commit_after>\/*\n * copyright: (c) RDO-Team, 2010\n * filename : rdortp.cpp\n * author : , \n * date : \n * bref : \n * indent : 4T\n *\/\n\n\/\/ ====================================================================== PCH\n#include \"rdo_lib\/rdo_parser\/pch.h\"\n\/\/ ====================================================================== INCLUDES\n\/\/ ====================================================================== SYNOPSIS\n#include \"rdo_lib\/rdo_parser\/rdortp.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser.h\"\n#include \"rdo_lib\/rdo_parser\/rdoparser_lexer.h\"\n#include \"rdo_lib\/rdo_runtime\/rdocalc.h\"\n\/\/ ===============================================================================\n\nOPEN_RDO_PARSER_NAMESPACE\n\nint rtplex(PTR(YYSTYPE) lpval, PTR(YYLTYPE) llocp, PTR(void) lexer)\n{\n\tLEXER->m_lpval = lpval;\n\tLEXER->m_lploc = llocp;\n\treturn LEXER->yylex();\n}\n\nvoid rtperror(PTR(char) mes)\n{}\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPResType\n\/\/ ----------------------------------------------------------------------------\nRDORTPResType::RDORTPResType(CREF(LPRDOParser) pParser, CREF(RDOParserSrcInfo) src_info, rbool permanent)\n\t: RDOParserSrcInfo(src_info )\n\t, m_number (pParser->getRTP_id())\n\t, m_permanent (permanent )\n{\n\tpParser->insertRTPResType(LPRDORTPResType(this));\n}\n\nRDORTPResType::~RDORTPResType()\n{}\n\nvoid RDORTPResType::addParam(CREF(LPRDORTPParam) param)\n{\n\tif (findRTPParam(param->name()))\n\t{\n\t\tRDOParser::s_parser()->error().error(param->src_info(), rdo::format(\" : %s\", param->name().c_str()));\n\t}\n\tm_params.push_back(param);\n}\n\nvoid RDORTPResType::addParam(CREF(tstring) param_name, rdoRuntime::RDOType::TypeID param_typeID)\n{\n}\n\nLPRDORTPParam RDORTPResType::findRTPParam(CREF(tstring) paramName) const\n{\n\tParamList::const_iterator it = std::find_if(m_params.begin(), m_params.end(), compareName<RDORTPParam>(paramName));\n\treturn it != m_params.end() ? *it : LPRDORTPParam();\n}\n\nruint RDORTPResType::getRTPParamNumber(CREF(tstring) paramName) const\n{\n\tParamList::const_iterator it = std::find_if(m_params.begin(), m_params.end(), compareName<RDORTPParam>(paramName));\n\treturn it != m_params.end() ? it - m_params.begin() : UNDEFINED_PARAM;\n}\n\nvoid RDORTPResType::writeModelStructure(REF(std::ostream) stream) const\n{\n\tstream << getNumber() << \" \" << name() << \" \" << getParams().size() << std::endl;\n\tfor (ruint i = 0; i < getParams().size(); i++)\n\t{\n\t\tstream << \" \" << (i+1) << \" \";\n\t\tgetParams().at(i)->writeModelStructure(stream);\n\t}\n}\n\n\/*\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPFuzzyMembershiftFun - - \n\/\/ ----------------------------------------------------------------------------\nRDORTPFuzzyMembershiftFun::RDORTPFuzzyMembershiftFun(CREF(LPRDOParser) pParser):\n\tRDOParserObject(pParser)\n{\n\/*\tfor (ruint i = 0; i < m_points.size(); i++)\n\t{\n\/\/\t\tdouble x = m_points[i]->getX();\n\t}\n\n\tItems::iterator it = m_points.begin();\n\twhile (it != m_points.end())\n\t{\n\t\tdouble x = (*it)->getX();\n\t\tit++;\n\t}\n}\n\/\/ ----------------------------------------------------------------------------\n\/\/ ---------- RDORTPFuzzyTerm - \n\/\/ ----------------------------------------------------------------------------\nRDORTPFuzzyTerm::RDORTPFuzzyTerm(CREF(LPRDOParser) pParser, CREF(RDOParserSrcInfo) src_info, PTR(RDORTPFuzzyMembershiftFun) pMembersfift_fun):\n\tRDOParserObject(pParser)\n{\n\n}*\/\n\nCLOSE_RDO_PARSER_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <nan.h>\n\nextern \"C\" {\n #include \"libkeccak\/KeccakSponge.h\"\n}\n\nclass KeccakWrapper : public Nan::ObjectWrap {\n public:\n static v8::Local<v8::Function> GetConstructor () {\n v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n tpl->SetClassName(Nan::New(\"KeccakWrapper\").ToLocalChecked());\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n Nan::SetPrototypeMethod(tpl, \"initialize\", Initialize);\n Nan::SetPrototypeMethod(tpl, \"absorb\", Absorb);\n Nan::SetPrototypeMethod(tpl, \"absorbLastFewBits\", AbsorbLastFewBits);\n Nan::SetPrototypeMethod(tpl, \"squeeze\", Squeeze);\n Nan::SetPrototypeMethod(tpl, \"copy\", Copy);\n\n return Nan::GetFunction(tpl).ToLocalChecked();\n }\n\n private:\n KeccakWidth1600_SpongeInstance sponge;\n\n static NAN_METHOD(New) {\n KeccakWrapper* obj = new KeccakWrapper();\n obj->Wrap(info.This());\n info.GetReturnValue().Set(info.This());\n }\n\n static NAN_METHOD(Initialize) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n unsigned int rate = info[0]->IntegerValue();\n unsigned int capacity = info[1]->IntegerValue();\n\n int result = KeccakWidth1600_SpongeInitialize(&obj->sponge, rate, capacity);\n if (result != 0) return Nan::ThrowError(\"Invalid parameters\");\n }\n\n static NAN_METHOD(Absorb) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n v8::Local<v8::Object> buffer = info[0].As<v8::Object>();\n const unsigned char* data = (const unsigned char*) node::Buffer::Data(buffer);\n size_t length = node::Buffer::Length(buffer);\n\n int result = KeccakWidth1600_SpongeAbsorb(&obj->sponge, data, length);\n if (result != 0) return Nan::ThrowError(\"Too late for additional input\");\n }\n\n static NAN_METHOD(AbsorbLastFewBits) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n unsigned char bits = info[0]->IntegerValue();\n\n int result = KeccakWidth1600_SpongeAbsorbLastFewBits(&obj->sponge, bits);\n if (result != 0) return Nan::ThrowError(\"Too late for additional input\");\n }\n\n static NAN_METHOD(Squeeze) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n size_t length = info[0]->IntegerValue();\n\n v8::Local<v8::Object> buffer = Nan::NewBuffer(length).ToLocalChecked();\n unsigned char* data = (unsigned char*) node::Buffer::Data(buffer);\n\n KeccakWidth1600_SpongeSqueeze(&obj->sponge, data, length);\n info.GetReturnValue().Set(buffer);\n }\n\n static NAN_METHOD(Copy) {\n KeccakWrapper* from = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n KeccakWrapper* to = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info[0].As<v8::Object>());\n\n memcpy(&to->sponge, &from->sponge, sizeof(KeccakWidth1600_SpongeInstance));\n }\n};\n\nNAN_MODULE_INIT(Init) {\n \/\/ I wish to use pure functions, but we need wrapper around state\n v8::Local<v8::Function> KeccakConstructor = KeccakWrapper::GetConstructor();\n Nan::Set(target, Nan::New(\"Keccak\").ToLocalChecked(), KeccakConstructor);\n}\n\nNODE_MODULE(keccak, Init)\n<commit_msg>Ignore return code in bindings<commit_after>#include <node.h>\n#include <nan.h>\n\nextern \"C\" {\n #include \"libkeccak\/KeccakSponge.h\"\n}\n\nclass KeccakWrapper : public Nan::ObjectWrap {\n public:\n static v8::Local<v8::Function> GetConstructor () {\n v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);\n tpl->SetClassName(Nan::New(\"KeccakWrapper\").ToLocalChecked());\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n Nan::SetPrototypeMethod(tpl, \"initialize\", Initialize);\n Nan::SetPrototypeMethod(tpl, \"absorb\", Absorb);\n Nan::SetPrototypeMethod(tpl, \"absorbLastFewBits\", AbsorbLastFewBits);\n Nan::SetPrototypeMethod(tpl, \"squeeze\", Squeeze);\n Nan::SetPrototypeMethod(tpl, \"copy\", Copy);\n\n return Nan::GetFunction(tpl).ToLocalChecked();\n }\n\n private:\n KeccakWidth1600_SpongeInstance sponge;\n\n static NAN_METHOD(New) {\n KeccakWrapper* obj = new KeccakWrapper();\n obj->Wrap(info.This());\n info.GetReturnValue().Set(info.This());\n }\n\n static NAN_METHOD(Initialize) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n unsigned int rate = info[0]->IntegerValue();\n unsigned int capacity = info[1]->IntegerValue();\n\n \/\/ ignore return code, rate & capacity always will right because internal object\n KeccakWidth1600_SpongeInitialize(&obj->sponge, rate, capacity);\n }\n\n static NAN_METHOD(Absorb) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n v8::Local<v8::Object> buffer = info[0].As<v8::Object>();\n const unsigned char* data = (const unsigned char*) node::Buffer::Data(buffer);\n size_t length = node::Buffer::Length(buffer);\n\n \/\/ ignore return code, bcause internal object\n KeccakWidth1600_SpongeAbsorb(&obj->sponge, data, length);\n }\n\n static NAN_METHOD(AbsorbLastFewBits) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n unsigned char bits = info[0]->IntegerValue();\n\n \/\/ ignore return code, bcause internal object\n KeccakWidth1600_SpongeAbsorbLastFewBits(&obj->sponge, bits);\n }\n\n static NAN_METHOD(Squeeze) {\n KeccakWrapper* obj = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n size_t length = info[0]->IntegerValue();\n\n v8::Local<v8::Object> buffer = Nan::NewBuffer(length).ToLocalChecked();\n unsigned char* data = (unsigned char*) node::Buffer::Data(buffer);\n\n KeccakWidth1600_SpongeSqueeze(&obj->sponge, data, length);\n info.GetReturnValue().Set(buffer);\n }\n\n static NAN_METHOD(Copy) {\n KeccakWrapper* from = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info.Holder());\n KeccakWrapper* to = Nan::ObjectWrap::Unwrap<KeccakWrapper>(info[0].As<v8::Object>());\n\n memcpy(&to->sponge, &from->sponge, sizeof(KeccakWidth1600_SpongeInstance));\n }\n};\n\nNAN_MODULE_INIT(Init) {\n \/\/ I wish to use pure functions, but we need wrapper around state\n v8::Local<v8::Function> KeccakConstructor = KeccakWrapper::GetConstructor();\n Nan::Set(target, Nan::New(\"Keccak\").ToLocalChecked(), KeccakConstructor);\n}\n\nNODE_MODULE(keccak, Init)\n<|endoftext|>"} {"text":"<commit_before>\/**\n@file genericarray.cpp\n@author Tim Howard\n\n@section LICENSE\nCopyright (c) 2010 Tim Howard\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <duct\/debug.hpp>\n#include <duct\/genericarray.hpp>\n\nnamespace duct {\n\n\/\/ class GArray implementation\n\/*\ntemplate <class T>\nGArray<T>::GArray() : _size(0), _data(NULL), _releasecontainer(true) {\n}\n\ntemplate <class T>\nGArray<T>::GArray(T element) : _size(1), _data(new T[1]), _releasecontainer(true) {\n\t_data[0]=element;\n}\n\ntemplate <class T>\nGArray<T>::GArray(T* data, int size, bool isstatic) : _size(0), _data(NULL), _releasecontainer(true) {\n\tset(data, size, isstatic!=true);\n}\n\ntemplate <class T>\nGArray<T>::GArray(size_t num, ...) : _size(0), _data(NULL), _releasecontainer(true) {\n\tva_list ap;\n\tva_start(ap, num);\n\tsetVL(num, ap);\n\tva_end(ap);\n}\n\ntemplate <class T>\nGArray<T>::~GArray() {\n\trelease();\n}\n\ntemplate <class T>\nsize_t GArray<T>::size() const {\n\treturn _size;\n}\n\ntemplate <class T>\nT* GArray<T>::data() {\n\treturn _data;\n}\n\ntemplate <class T>\nconst T* GArray<T>::data() const {\n\treturn _data;\n}\n\ntemplate <class T>\nvoid GArray<T>::set(T element) {\n\trelease();\n\t_data=new T[_size=1];\n\t_data[0]=element;\n\t_releasecontainer=true;\n}\n\ntemplate <class T>\nvoid GArray<T>::set(T* data, int size) {\n\trelease();\n\tif (size<0) {\n\t\tint i=0;\n\t\twhile (data[i]!=NULL) {\n\t\t\t++i;\n\t\t}\n\t\tsize=i;\n\t}\n\t_size=size;\n\t_data=data;\n\t_releasecontainer=true;\n}\n\ntemplate <class T>\nvoid GArray<T>::setStatic(T* data, int size) {\n\trelease();\n\tif (size<0) {\n\t\tint i=0;\n\t\twhile (data[i]!=NULL) {\n\t\t\t++i;\n\t\t}\n\t\tsize=i;\n\t}\n\t_size=size;\n\t_data=data;\n\t_releasecontainer=false;\n}\n\ntemplate <class T>\nvoid GArray<T>::setVL(size_t num, va_list ap) {\n\trelease();\n\t_size=num;\n\t_data=new T[_size];\n\tfor (unsigned int i=0; i<num; ++i) {\n\t\t_data[i]=va_arg(ap, T);\n\t}\n\t_releasecontainer=true;\n}\n\ntemplate <class T>\nvoid GArray<T>::setV(size_t num, ...) {\n\tva_list ap;\n\tva_start(ap, num);\n\tsetVL(num, ap);\n\tva_end(ap);\n}\n\ntemplate <class T>\nvoid GArray<T>::release() {\n\tif (_data) {\n\t\tfor (unsigned int i=0; i<_size; ++i) {\n\t\t\tif (_data[i]) {\n\t\t\t\tdelete _data[i];\n\t\t\t\t_data[i]=NULL;\n\t\t\t}\n\t\t}\n\t\tif (_releasecontainer)\n\t\t\tdelete[] _data;\n\t\t_data=NULL;\n\t}\n\t_size=0;\n}\n*\/\n\n} \/\/ namespace duct\n\n<commit_msg>Removed src\/duct\/genericarray.cpp (implementation is in header).<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include <set>\n\n#include \"webrtc\/modules\/video_coding\/sequence_number_util.h\"\n#include \"webrtc\/test\/gtest.h\"\n\nnamespace webrtc {\nclass TestSeqNumUtil : public ::testing::Test {\n protected:\n \/\/ Can't use std::numeric_limits<unsigned long>::max() since\n \/\/ MSVC doesn't support constexpr.\n static const unsigned long ulmax = ~0ul; \/\/ NOLINT\n};\n\nTEST_F(TestSeqNumUtil, AheadOrAt) {\n uint8_t x = 0;\n uint8_t y = 0;\n ASSERT_TRUE(AheadOrAt(x, y));\n ++x;\n ASSERT_TRUE(AheadOrAt(x, y));\n ASSERT_FALSE(AheadOrAt(y, x));\n for (int i = 0; i < 256; ++i) {\n ASSERT_TRUE(AheadOrAt(x, y));\n ++x;\n ++y;\n }\n\n x = 128;\n y = 0;\n ASSERT_TRUE(AheadOrAt(x, y));\n ASSERT_FALSE(AheadOrAt(y, x));\n\n x = 129;\n ASSERT_FALSE(AheadOrAt(x, y));\n ASSERT_TRUE(AheadOrAt(y, x));\n ASSERT_TRUE(AheadOrAt<uint16_t>(x, y));\n ASSERT_FALSE(AheadOrAt<uint16_t>(y, x));\n}\n\nTEST_F(TestSeqNumUtil, AheadOrAtWithDivisor) {\n ASSERT_TRUE((AheadOrAt<uint8_t, 11>(5, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 11>(6, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 11>(0, 5)));\n ASSERT_TRUE((AheadOrAt<uint8_t, 11>(0, 6)));\n\n ASSERT_TRUE((AheadOrAt<uint8_t, 10>(5, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 10>(6, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 10>(0, 5)));\n ASSERT_TRUE((AheadOrAt<uint8_t, 10>(0, 6)));\n\n const uint8_t D = 211;\n uint8_t x = 0;\n for (int i = 0; i < D; ++i) {\n uint8_t next_x = Add<D>(x, 1);\n ASSERT_TRUE((AheadOrAt<uint8_t, D>(i, i)));\n ASSERT_TRUE((AheadOrAt<uint8_t, D>(next_x, i)));\n ASSERT_FALSE((AheadOrAt<uint8_t, D>(i, next_x)));\n x = next_x;\n }\n}\n\nTEST_F(TestSeqNumUtil, AheadOf) {\n uint8_t x = 0;\n uint8_t y = 0;\n ASSERT_FALSE(AheadOf(x, y));\n ++x;\n ASSERT_TRUE(AheadOf(x, y));\n ASSERT_FALSE(AheadOf(y, x));\n for (int i = 0; i < 256; ++i) {\n ASSERT_TRUE(AheadOf(x, y));\n ++x;\n ++y;\n }\n\n x = 128;\n y = 0;\n for (int i = 0; i < 128; ++i) {\n ASSERT_TRUE(AheadOf(x, y));\n ASSERT_FALSE(AheadOf(y, x));\n x++;\n y++;\n }\n\n for (int i = 0; i < 128; ++i) {\n ASSERT_FALSE(AheadOf(x, y));\n ASSERT_TRUE(AheadOf(y, x));\n x++;\n y++;\n }\n\n x = 129;\n y = 0;\n ASSERT_FALSE(AheadOf(x, y));\n ASSERT_TRUE(AheadOf(y, x));\n ASSERT_TRUE(AheadOf<uint16_t>(x, y));\n ASSERT_FALSE(AheadOf<uint16_t>(y, x));\n}\n\nTEST_F(TestSeqNumUtil, AheadOfWithDivisor) {\n ASSERT_TRUE((AheadOf<uint8_t, 11>(5, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 11>(6, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 11>(0, 5)));\n ASSERT_TRUE((AheadOf<uint8_t, 11>(0, 6)));\n\n ASSERT_TRUE((AheadOf<uint8_t, 10>(5, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 10>(6, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 10>(0, 5)));\n ASSERT_TRUE((AheadOf<uint8_t, 10>(0, 6)));\n\n const uint8_t D = 211;\n uint8_t x = 0;\n for (int i = 0; i < D; ++i) {\n uint8_t next_x = Add<D>(x, 1);\n ASSERT_FALSE((AheadOf<uint8_t, D>(i, i)));\n ASSERT_TRUE((AheadOf<uint8_t, D>(next_x, i)));\n ASSERT_FALSE((AheadOf<uint8_t, D>(i, next_x)));\n x = next_x;\n }\n}\n\nTEST_F(TestSeqNumUtil, ForwardDiffWithDivisor) {\n const uint8_t kDivisor = 211;\n\n for (uint8_t i = 0; i < kDivisor - 1; ++i) {\n ASSERT_EQ(0, (ForwardDiff<uint8_t, kDivisor>(i, i)));\n ASSERT_EQ(1, (ForwardDiff<uint8_t, kDivisor>(i, i + 1)));\n ASSERT_EQ(kDivisor - 1, (ForwardDiff<uint8_t, kDivisor>(i + 1, i)));\n }\n\n for (uint8_t i = 1; i < kDivisor; ++i) {\n ASSERT_EQ(i, (ForwardDiff<uint8_t, kDivisor>(0, i)));\n ASSERT_EQ(kDivisor - i, (ForwardDiff<uint8_t, kDivisor>(i, 0)));\n }\n}\n\nTEST_F(TestSeqNumUtil, ReverseDiffWithDivisor) {\n const uint8_t kDivisor = 241;\n\n for (uint8_t i = 0; i < kDivisor - 1; ++i) {\n ASSERT_EQ(0, (ReverseDiff<uint8_t, kDivisor>(i, i)));\n ASSERT_EQ(kDivisor - 1, (ReverseDiff<uint8_t, kDivisor>(i, i + 1)));\n ASSERT_EQ(1, (ReverseDiff<uint8_t, kDivisor>(i + 1, i)));\n }\n\n for (uint8_t i = 1; i < kDivisor; ++i) {\n ASSERT_EQ(kDivisor - i, (ReverseDiff<uint8_t, kDivisor>(0, i)));\n ASSERT_EQ(i, (ReverseDiff<uint8_t, kDivisor>(i, 0)));\n }\n}\n\nTEST_F(TestSeqNumUtil, SeqNumComparator) {\n std::set<uint8_t, AscendingSeqNumComp<uint8_t>> seq_nums_asc;\n std::set<uint8_t, DescendingSeqNumComp<uint8_t>> seq_nums_desc;\n\n uint8_t x = 0;\n for (int i = 0; i < 128; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n ++x;\n }\n\n seq_nums_asc.clear();\n seq_nums_desc.clear();\n x = 199;\n for (int i = 0; i < 128; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n ++x;\n }\n}\n\nTEST_F(TestSeqNumUtil, SeqNumComparatorWithDivisor) {\n const uint8_t D = 223;\n\n std::set<uint8_t, AscendingSeqNumComp<uint8_t, D>> seq_nums_asc;\n std::set<uint8_t, DescendingSeqNumComp<uint8_t, D>> seq_nums_desc;\n\n uint8_t x = 0;\n for (int i = 0; i < D \/ 2; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n x = Add<D>(x, 1);\n }\n\n seq_nums_asc.clear();\n seq_nums_desc.clear();\n x = 200;\n for (int i = 0; i < D \/ 2; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n x = Add<D>(x, 1);\n }\n}\n\nTEST(SeqNumUnwrapper, NoBackWardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n\n \/\/ The unwrapped sequence is not allowed to wrap, if that happens the\n \/\/ SeqNumUnwrapper should have been constructed with a higher start value.\n ASSERT_DEATH_IF_SUPPORTED(unwrapper.Unwrap(255), \"\");\n}\n\nTEST(SeqNumUnwrapper, NoForwardWrap) {\n SeqNumUnwrapper<uint32_t> unwrapper(std::numeric_limits<uint64_t>::max());\n EXPECT_EQ(std::numeric_limits<uint64_t>::max(), unwrapper.Unwrap(0));\n\n \/\/ The unwrapped sequence is not allowed to wrap, if that happens the\n \/\/ SeqNumUnwrapper should have been constructed with a lower start value.\n ASSERT_DEATH_IF_SUPPORTED(unwrapper.Unwrap(1), \"\");\n}\n\nTEST(SeqNumUnwrapper, ForwardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(255));\n EXPECT_EQ(1U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, ForwardWrapWithDivisor) {\n SeqNumUnwrapper<uint8_t, 33> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(30));\n EXPECT_EQ(6U, unwrapper.Unwrap(3));\n}\n\nTEST(SeqNumUnwrapper, BackWardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper(10);\n EXPECT_EQ(10U, unwrapper.Unwrap(0));\n EXPECT_EQ(8U, unwrapper.Unwrap(254));\n}\n\nTEST(SeqNumUnwrapper, BackWardWrapWithDivisor) {\n SeqNumUnwrapper<uint8_t, 33> unwrapper(10);\n EXPECT_EQ(10U, unwrapper.Unwrap(0));\n EXPECT_EQ(8U, unwrapper.Unwrap(31));\n}\n\nTEST(SeqNumUnwrapper, Unwrap) {\n SeqNumUnwrapper<uint16_t> unwrapper;\n const uint16_t kMax = std::numeric_limits<uint16_t>::max();\n const uint16_t kMaxDist = kMax \/ 2 + 1;\n\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(kMax, unwrapper.Unwrap(kMax));\n EXPECT_EQ(kMax + 1U, unwrapper.Unwrap(0));\n EXPECT_EQ(kMax, unwrapper.Unwrap(kMax));\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, UnwrapOddDivisor) {\n SeqNumUnwrapper<uint8_t, 11> unwrapper(10);\n\n EXPECT_EQ(10U, unwrapper.Unwrap(10));\n EXPECT_EQ(11U, unwrapper.Unwrap(0));\n EXPECT_EQ(16U, unwrapper.Unwrap(5));\n EXPECT_EQ(21U, unwrapper.Unwrap(10));\n EXPECT_EQ(22U, unwrapper.Unwrap(0));\n EXPECT_EQ(17U, unwrapper.Unwrap(6));\n EXPECT_EQ(12U, unwrapper.Unwrap(1));\n EXPECT_EQ(7U, unwrapper.Unwrap(7));\n EXPECT_EQ(2U, unwrapper.Unwrap(2));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, ManyForwardWraps) {\n const int kLargeNumber = 4711;\n const int kMaxStep = kLargeNumber \/ 2;\n const int kNumWraps = 100;\n SeqNumUnwrapper<uint16_t, kLargeNumber> unwrapper;\n\n uint16_t next_unwrap = 0;\n uint64_t expected = 0;\n for (int i = 0; i < kNumWraps * 2 + 1; ++i) {\n EXPECT_EQ(expected, unwrapper.Unwrap(next_unwrap));\n expected += kMaxStep;\n next_unwrap = (next_unwrap + kMaxStep) % kLargeNumber;\n }\n}\n\nTEST(SeqNumUnwrapper, ManyBackwardWraps) {\n const int kLargeNumber = 4711;\n const int kMaxStep = kLargeNumber \/ 2;\n const int kNumWraps = 100;\n SeqNumUnwrapper<uint16_t, kLargeNumber> unwrapper(kLargeNumber * kNumWraps);\n\n uint16_t next_unwrap = 0;\n uint64_t expected = kLargeNumber * kNumWraps;\n for (uint16_t i = 0; i < kNumWraps * 2 + 1; ++i) {\n EXPECT_EQ(expected, unwrapper.Unwrap(next_unwrap));\n expected -= kMaxStep;\n next_unwrap = (next_unwrap + kMaxStep + 1) % kLargeNumber;\n }\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Disable SeqNumUnwrapper death tests to avoid breaking downstream builds.<commit_after>\/*\n * Copyright (c) 2016 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include <set>\n\n#include \"webrtc\/modules\/video_coding\/sequence_number_util.h\"\n#include \"webrtc\/test\/gtest.h\"\n\nnamespace webrtc {\nclass TestSeqNumUtil : public ::testing::Test {\n protected:\n \/\/ Can't use std::numeric_limits<unsigned long>::max() since\n \/\/ MSVC doesn't support constexpr.\n static const unsigned long ulmax = ~0ul; \/\/ NOLINT\n};\n\nTEST_F(TestSeqNumUtil, AheadOrAt) {\n uint8_t x = 0;\n uint8_t y = 0;\n ASSERT_TRUE(AheadOrAt(x, y));\n ++x;\n ASSERT_TRUE(AheadOrAt(x, y));\n ASSERT_FALSE(AheadOrAt(y, x));\n for (int i = 0; i < 256; ++i) {\n ASSERT_TRUE(AheadOrAt(x, y));\n ++x;\n ++y;\n }\n\n x = 128;\n y = 0;\n ASSERT_TRUE(AheadOrAt(x, y));\n ASSERT_FALSE(AheadOrAt(y, x));\n\n x = 129;\n ASSERT_FALSE(AheadOrAt(x, y));\n ASSERT_TRUE(AheadOrAt(y, x));\n ASSERT_TRUE(AheadOrAt<uint16_t>(x, y));\n ASSERT_FALSE(AheadOrAt<uint16_t>(y, x));\n}\n\nTEST_F(TestSeqNumUtil, AheadOrAtWithDivisor) {\n ASSERT_TRUE((AheadOrAt<uint8_t, 11>(5, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 11>(6, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 11>(0, 5)));\n ASSERT_TRUE((AheadOrAt<uint8_t, 11>(0, 6)));\n\n ASSERT_TRUE((AheadOrAt<uint8_t, 10>(5, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 10>(6, 0)));\n ASSERT_FALSE((AheadOrAt<uint8_t, 10>(0, 5)));\n ASSERT_TRUE((AheadOrAt<uint8_t, 10>(0, 6)));\n\n const uint8_t D = 211;\n uint8_t x = 0;\n for (int i = 0; i < D; ++i) {\n uint8_t next_x = Add<D>(x, 1);\n ASSERT_TRUE((AheadOrAt<uint8_t, D>(i, i)));\n ASSERT_TRUE((AheadOrAt<uint8_t, D>(next_x, i)));\n ASSERT_FALSE((AheadOrAt<uint8_t, D>(i, next_x)));\n x = next_x;\n }\n}\n\nTEST_F(TestSeqNumUtil, AheadOf) {\n uint8_t x = 0;\n uint8_t y = 0;\n ASSERT_FALSE(AheadOf(x, y));\n ++x;\n ASSERT_TRUE(AheadOf(x, y));\n ASSERT_FALSE(AheadOf(y, x));\n for (int i = 0; i < 256; ++i) {\n ASSERT_TRUE(AheadOf(x, y));\n ++x;\n ++y;\n }\n\n x = 128;\n y = 0;\n for (int i = 0; i < 128; ++i) {\n ASSERT_TRUE(AheadOf(x, y));\n ASSERT_FALSE(AheadOf(y, x));\n x++;\n y++;\n }\n\n for (int i = 0; i < 128; ++i) {\n ASSERT_FALSE(AheadOf(x, y));\n ASSERT_TRUE(AheadOf(y, x));\n x++;\n y++;\n }\n\n x = 129;\n y = 0;\n ASSERT_FALSE(AheadOf(x, y));\n ASSERT_TRUE(AheadOf(y, x));\n ASSERT_TRUE(AheadOf<uint16_t>(x, y));\n ASSERT_FALSE(AheadOf<uint16_t>(y, x));\n}\n\nTEST_F(TestSeqNumUtil, AheadOfWithDivisor) {\n ASSERT_TRUE((AheadOf<uint8_t, 11>(5, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 11>(6, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 11>(0, 5)));\n ASSERT_TRUE((AheadOf<uint8_t, 11>(0, 6)));\n\n ASSERT_TRUE((AheadOf<uint8_t, 10>(5, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 10>(6, 0)));\n ASSERT_FALSE((AheadOf<uint8_t, 10>(0, 5)));\n ASSERT_TRUE((AheadOf<uint8_t, 10>(0, 6)));\n\n const uint8_t D = 211;\n uint8_t x = 0;\n for (int i = 0; i < D; ++i) {\n uint8_t next_x = Add<D>(x, 1);\n ASSERT_FALSE((AheadOf<uint8_t, D>(i, i)));\n ASSERT_TRUE((AheadOf<uint8_t, D>(next_x, i)));\n ASSERT_FALSE((AheadOf<uint8_t, D>(i, next_x)));\n x = next_x;\n }\n}\n\nTEST_F(TestSeqNumUtil, ForwardDiffWithDivisor) {\n const uint8_t kDivisor = 211;\n\n for (uint8_t i = 0; i < kDivisor - 1; ++i) {\n ASSERT_EQ(0, (ForwardDiff<uint8_t, kDivisor>(i, i)));\n ASSERT_EQ(1, (ForwardDiff<uint8_t, kDivisor>(i, i + 1)));\n ASSERT_EQ(kDivisor - 1, (ForwardDiff<uint8_t, kDivisor>(i + 1, i)));\n }\n\n for (uint8_t i = 1; i < kDivisor; ++i) {\n ASSERT_EQ(i, (ForwardDiff<uint8_t, kDivisor>(0, i)));\n ASSERT_EQ(kDivisor - i, (ForwardDiff<uint8_t, kDivisor>(i, 0)));\n }\n}\n\nTEST_F(TestSeqNumUtil, ReverseDiffWithDivisor) {\n const uint8_t kDivisor = 241;\n\n for (uint8_t i = 0; i < kDivisor - 1; ++i) {\n ASSERT_EQ(0, (ReverseDiff<uint8_t, kDivisor>(i, i)));\n ASSERT_EQ(kDivisor - 1, (ReverseDiff<uint8_t, kDivisor>(i, i + 1)));\n ASSERT_EQ(1, (ReverseDiff<uint8_t, kDivisor>(i + 1, i)));\n }\n\n for (uint8_t i = 1; i < kDivisor; ++i) {\n ASSERT_EQ(kDivisor - i, (ReverseDiff<uint8_t, kDivisor>(0, i)));\n ASSERT_EQ(i, (ReverseDiff<uint8_t, kDivisor>(i, 0)));\n }\n}\n\nTEST_F(TestSeqNumUtil, SeqNumComparator) {\n std::set<uint8_t, AscendingSeqNumComp<uint8_t>> seq_nums_asc;\n std::set<uint8_t, DescendingSeqNumComp<uint8_t>> seq_nums_desc;\n\n uint8_t x = 0;\n for (int i = 0; i < 128; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n ++x;\n }\n\n seq_nums_asc.clear();\n seq_nums_desc.clear();\n x = 199;\n for (int i = 0; i < 128; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n ++x;\n }\n}\n\nTEST_F(TestSeqNumUtil, SeqNumComparatorWithDivisor) {\n const uint8_t D = 223;\n\n std::set<uint8_t, AscendingSeqNumComp<uint8_t, D>> seq_nums_asc;\n std::set<uint8_t, DescendingSeqNumComp<uint8_t, D>> seq_nums_desc;\n\n uint8_t x = 0;\n for (int i = 0; i < D \/ 2; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n x = Add<D>(x, 1);\n }\n\n seq_nums_asc.clear();\n seq_nums_desc.clear();\n x = 200;\n for (int i = 0; i < D \/ 2; ++i) {\n seq_nums_asc.insert(x);\n seq_nums_desc.insert(x);\n ASSERT_EQ(x, *seq_nums_asc.begin());\n ASSERT_EQ(x, *seq_nums_desc.rbegin());\n x = Add<D>(x, 1);\n }\n}\n\n\/\/ TODO(philipel): Enable when downstream project can hande these death tests.\n\nTEST(SeqNumUnwrapper, DISABLED_NoBackWardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n\n \/\/ The unwrapped sequence is not allowed to wrap, if that happens the\n \/\/ SeqNumUnwrapper should have been constructed with a higher start value.\n ASSERT_DEATH_IF_SUPPORTED(unwrapper.Unwrap(255), \"\");\n}\n\nTEST(SeqNumUnwrapper, DISABLED_NoForwardWrap) {\n SeqNumUnwrapper<uint32_t> unwrapper(std::numeric_limits<uint64_t>::max());\n EXPECT_EQ(std::numeric_limits<uint64_t>::max(), unwrapper.Unwrap(0));\n\n \/\/ The unwrapped sequence is not allowed to wrap, if that happens the\n \/\/ SeqNumUnwrapper should have been constructed with a lower start value.\n ASSERT_DEATH_IF_SUPPORTED(unwrapper.Unwrap(1), \"\");\n}\n\nTEST(SeqNumUnwrapper, ForwardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(255));\n EXPECT_EQ(1U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, ForwardWrapWithDivisor) {\n SeqNumUnwrapper<uint8_t, 33> unwrapper;\n EXPECT_EQ(0U, unwrapper.Unwrap(30));\n EXPECT_EQ(6U, unwrapper.Unwrap(3));\n}\n\nTEST(SeqNumUnwrapper, BackWardWrap) {\n SeqNumUnwrapper<uint8_t> unwrapper(10);\n EXPECT_EQ(10U, unwrapper.Unwrap(0));\n EXPECT_EQ(8U, unwrapper.Unwrap(254));\n}\n\nTEST(SeqNumUnwrapper, BackWardWrapWithDivisor) {\n SeqNumUnwrapper<uint8_t, 33> unwrapper(10);\n EXPECT_EQ(10U, unwrapper.Unwrap(0));\n EXPECT_EQ(8U, unwrapper.Unwrap(31));\n}\n\nTEST(SeqNumUnwrapper, Unwrap) {\n SeqNumUnwrapper<uint16_t> unwrapper;\n const uint16_t kMax = std::numeric_limits<uint16_t>::max();\n const uint16_t kMaxDist = kMax \/ 2 + 1;\n\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(kMax, unwrapper.Unwrap(kMax));\n EXPECT_EQ(kMax + 1U, unwrapper.Unwrap(0));\n EXPECT_EQ(kMax, unwrapper.Unwrap(kMax));\n EXPECT_EQ(kMaxDist, unwrapper.Unwrap(kMaxDist));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, UnwrapOddDivisor) {\n SeqNumUnwrapper<uint8_t, 11> unwrapper(10);\n\n EXPECT_EQ(10U, unwrapper.Unwrap(10));\n EXPECT_EQ(11U, unwrapper.Unwrap(0));\n EXPECT_EQ(16U, unwrapper.Unwrap(5));\n EXPECT_EQ(21U, unwrapper.Unwrap(10));\n EXPECT_EQ(22U, unwrapper.Unwrap(0));\n EXPECT_EQ(17U, unwrapper.Unwrap(6));\n EXPECT_EQ(12U, unwrapper.Unwrap(1));\n EXPECT_EQ(7U, unwrapper.Unwrap(7));\n EXPECT_EQ(2U, unwrapper.Unwrap(2));\n EXPECT_EQ(0U, unwrapper.Unwrap(0));\n}\n\nTEST(SeqNumUnwrapper, ManyForwardWraps) {\n const int kLargeNumber = 4711;\n const int kMaxStep = kLargeNumber \/ 2;\n const int kNumWraps = 100;\n SeqNumUnwrapper<uint16_t, kLargeNumber> unwrapper;\n\n uint16_t next_unwrap = 0;\n uint64_t expected = 0;\n for (int i = 0; i < kNumWraps * 2 + 1; ++i) {\n EXPECT_EQ(expected, unwrapper.Unwrap(next_unwrap));\n expected += kMaxStep;\n next_unwrap = (next_unwrap + kMaxStep) % kLargeNumber;\n }\n}\n\nTEST(SeqNumUnwrapper, ManyBackwardWraps) {\n const int kLargeNumber = 4711;\n const int kMaxStep = kLargeNumber \/ 2;\n const int kNumWraps = 100;\n SeqNumUnwrapper<uint16_t, kLargeNumber> unwrapper(kLargeNumber * kNumWraps);\n\n uint16_t next_unwrap = 0;\n uint64_t expected = kLargeNumber * kNumWraps;\n for (uint16_t i = 0; i < kNumWraps * 2 + 1; ++i) {\n EXPECT_EQ(expected, unwrapper.Unwrap(next_unwrap));\n expected -= kMaxStep;\n next_unwrap = (next_unwrap + kMaxStep + 1) % kLargeNumber;\n }\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"cefclient\/download_handler.h\"\n#include <stdio.h>\n#include <sstream>\n#include <vector>\n#include \"include\/cef_download_handler.h\"\n#include \"include\/cef_runnable.h\"\n#include \"cefclient\/util.h\"\n\n#if defined(OS_WIN)\n#include <windows.h> \/\/ NOLINT(build\/include_order)\n#include <shlobj.h> \/\/ NOLINT(build\/include_order)\n#include <shlwapi.h> \/\/ NOLINT(build\/include_order)\n#endif \/\/ OS_WIN\n\n\/\/ Implementation of the CefDownloadHandler interface.\nclass ClientDownloadHandler : public CefDownloadHandler {\n public:\n ClientDownloadHandler(CefRefPtr<DownloadListener> listener,\n const CefString& fileName)\n : listener_(listener), filename_(fileName), file_(NULL) {\n }\n\n ~ClientDownloadHandler() {\n ASSERT(pending_data_.empty());\n ASSERT(file_ == NULL);\n\n if (!pending_data_.empty()) {\n \/\/ Delete remaining pending data.\n std::vector<std::vector<char>*>::iterator it = pending_data_.begin();\n for (; it != pending_data_.end(); ++it)\n delete (*it);\n }\n\n if (file_) {\n \/\/ Close the dangling file pointer on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableFunction(&ClientDownloadHandler::CloseDanglingFile,\n file_));\n\n \/\/ Notify the listener that the download failed.\n listener_->NotifyDownloadError(filename_);\n }\n }\n\n \/\/ --------------------------------------------------\n \/\/ The following methods are called on the UI thread.\n \/\/ --------------------------------------------------\n\n void Initialize() {\n \/\/ Open the file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnOpen));\n }\n\n \/\/ A portion of the file contents have been received. This method will be\n \/\/ called multiple times until the download is complete. Return |true| to\n \/\/ continue receiving data and |false| to cancel.\n virtual bool ReceivedData(void* data, int data_size) {\n REQUIRE_UI_THREAD();\n\n if (data_size == 0)\n return true;\n\n \/\/ Create a new vector for the data.\n std::vector<char>* buffer = new std::vector<char>(data_size);\n memcpy(&(*buffer)[0], data, data_size);\n\n \/\/ Add the new data vector to the pending data queue.\n {\n AutoLock lock_scope(this);\n pending_data_.push_back(buffer);\n }\n\n \/\/ Write data to file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnReceivedData));\n return true;\n }\n\n \/\/ The download is complete.\n virtual void Complete() {\n REQUIRE_UI_THREAD();\n\n \/\/ Flush and close the file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnComplete));\n }\n\n \/\/ ----------------------------------------------------\n \/\/ The following methods are called on the FILE thread.\n \/\/ ----------------------------------------------------\n\n void OnOpen() {\n REQUIRE_FILE_THREAD();\n\n if (file_)\n return;\n\n#if defined(OS_WIN)\n TCHAR szFolderPath[MAX_PATH];\n\n \/\/ Save the file in the user's \"My Documents\" folder.\n if (SUCCEEDED(SHGetFolderPath(NULL, CSIDL_PERSONAL|CSIDL_FLAG_CREATE,\n NULL, 0, szFolderPath))) {\n std::wstring fileNameStr = filename_;\n LPWSTR name = PathFindFileName(fileNameStr.c_str());\n LPWSTR ext = PathFindExtension(fileNameStr.c_str());\n int ct = 0;\n std::wstringstream ss;\n\n if (ext) {\n name[ext-name] = 0;\n ext++;\n }\n\n \/\/ Make sure the file name is unique.\n do {\n if (ct > 0)\n ss.str(L\"\");\n ss << szFolderPath << L\"\\\\\" << name;\n if (ct > 0)\n ss << L\" (\" << ct << L\")\";\n if (ext)\n ss << L\".\" << ext;\n ct++;\n } while (PathFileExists(ss.str().c_str()));\n\n {\n AutoLock lock_scope(this);\n filename_ = ss.str();\n }\n\n file_ = _wfopen(ss.str().c_str(), L\"wb\");\n ASSERT(file_ != NULL);\n }\n#else\n \/\/ TODO(port): Implement this.\n ASSERT(false); \/\/ Not implemented\n#endif\n }\n\n void OnComplete() {\n REQUIRE_FILE_THREAD();\n\n if (!file_)\n return;\n\n \/\/ Make sure any pending data is written.\n OnReceivedData();\n\n fclose(file_);\n file_ = NULL;\n\n \/\/ Notify the listener that the download completed.\n listener_->NotifyDownloadComplete(filename_);\n }\n\n void OnReceivedData() {\n REQUIRE_FILE_THREAD();\n\n std::vector<std::vector<char>*> data;\n\n \/\/ Remove all data from the pending data queue.\n {\n AutoLock lock_scope(this);\n if (!pending_data_.empty()) {\n data = pending_data_;\n pending_data_.clear();\n }\n }\n\n if (data.empty())\n return;\n\n \/\/ Write all pending data to file.\n std::vector<std::vector<char>*>::iterator it = data.begin();\n for (; it != data.end(); ++it) {\n std::vector<char>* buffer = *it;\n if (file_)\n fwrite(&(*buffer)[0], buffer->size(), 1, file_);\n delete buffer;\n }\n data.clear();\n }\n\n static void CloseDanglingFile(FILE *file) {\n fclose(file);\n }\n\n private:\n CefRefPtr<DownloadListener> listener_;\n CefString filename_;\n FILE* file_;\n std::vector<std::vector<char>*> pending_data_;\n\n IMPLEMENT_REFCOUNTING(ClientDownloadHandler);\n IMPLEMENT_LOCKING(ClientDownloadHandler);\n};\n\nCefRefPtr<CefDownloadHandler> CreateDownloadHandler(\n CefRefPtr<DownloadListener> listener, const CefString& fileName) {\n CefRefPtr<ClientDownloadHandler> handler =\n new ClientDownloadHandler(listener, fileName);\n handler->Initialize();\n return handler.get();\n}\n<commit_msg>Linux: Fix compiler warning about fwrite() return value being ignored.<commit_after>\/\/ Copyright (c) 2010 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"cefclient\/download_handler.h\"\n#include <stdio.h>\n#include <sstream>\n#include <vector>\n#include \"include\/cef_download_handler.h\"\n#include \"include\/cef_runnable.h\"\n#include \"cefclient\/util.h\"\n\n#if defined(OS_WIN)\n#include <windows.h> \/\/ NOLINT(build\/include_order)\n#include <shlobj.h> \/\/ NOLINT(build\/include_order)\n#include <shlwapi.h> \/\/ NOLINT(build\/include_order)\n#endif \/\/ OS_WIN\n\n\/\/ Implementation of the CefDownloadHandler interface.\nclass ClientDownloadHandler : public CefDownloadHandler {\n public:\n ClientDownloadHandler(CefRefPtr<DownloadListener> listener,\n const CefString& fileName)\n : listener_(listener), filename_(fileName), file_(NULL) {\n }\n\n ~ClientDownloadHandler() {\n ASSERT(pending_data_.empty());\n ASSERT(file_ == NULL);\n\n if (!pending_data_.empty()) {\n \/\/ Delete remaining pending data.\n std::vector<std::vector<char>*>::iterator it = pending_data_.begin();\n for (; it != pending_data_.end(); ++it)\n delete (*it);\n }\n\n if (file_) {\n \/\/ Close the dangling file pointer on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableFunction(&ClientDownloadHandler::CloseDanglingFile,\n file_));\n\n \/\/ Notify the listener that the download failed.\n listener_->NotifyDownloadError(filename_);\n }\n }\n\n \/\/ --------------------------------------------------\n \/\/ The following methods are called on the UI thread.\n \/\/ --------------------------------------------------\n\n void Initialize() {\n \/\/ Open the file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnOpen));\n }\n\n \/\/ A portion of the file contents have been received. This method will be\n \/\/ called multiple times until the download is complete. Return |true| to\n \/\/ continue receiving data and |false| to cancel.\n virtual bool ReceivedData(void* data, int data_size) {\n REQUIRE_UI_THREAD();\n\n if (data_size == 0)\n return true;\n\n \/\/ Create a new vector for the data.\n std::vector<char>* buffer = new std::vector<char>(data_size);\n memcpy(&(*buffer)[0], data, data_size);\n\n \/\/ Add the new data vector to the pending data queue.\n {\n AutoLock lock_scope(this);\n pending_data_.push_back(buffer);\n }\n\n \/\/ Write data to file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnReceivedData));\n return true;\n }\n\n \/\/ The download is complete.\n virtual void Complete() {\n REQUIRE_UI_THREAD();\n\n \/\/ Flush and close the file on the FILE thread.\n CefPostTask(TID_FILE,\n NewCefRunnableMethod(this, &ClientDownloadHandler::OnComplete));\n }\n\n \/\/ ----------------------------------------------------\n \/\/ The following methods are called on the FILE thread.\n \/\/ ----------------------------------------------------\n\n void OnOpen() {\n REQUIRE_FILE_THREAD();\n\n if (file_)\n return;\n\n#if defined(OS_WIN)\n TCHAR szFolderPath[MAX_PATH];\n\n \/\/ Save the file in the user's \"My Documents\" folder.\n if (SUCCEEDED(SHGetFolderPath(NULL, CSIDL_PERSONAL|CSIDL_FLAG_CREATE,\n NULL, 0, szFolderPath))) {\n std::wstring fileNameStr = filename_;\n LPWSTR name = PathFindFileName(fileNameStr.c_str());\n LPWSTR ext = PathFindExtension(fileNameStr.c_str());\n int ct = 0;\n std::wstringstream ss;\n\n if (ext) {\n name[ext-name] = 0;\n ext++;\n }\n\n \/\/ Make sure the file name is unique.\n do {\n if (ct > 0)\n ss.str(L\"\");\n ss << szFolderPath << L\"\\\\\" << name;\n if (ct > 0)\n ss << L\" (\" << ct << L\")\";\n if (ext)\n ss << L\".\" << ext;\n ct++;\n } while (PathFileExists(ss.str().c_str()));\n\n {\n AutoLock lock_scope(this);\n filename_ = ss.str();\n }\n\n file_ = _wfopen(ss.str().c_str(), L\"wb\");\n ASSERT(file_ != NULL);\n }\n#else\n \/\/ TODO(port): Implement this.\n ASSERT(false); \/\/ Not implemented\n#endif\n }\n\n void OnComplete() {\n REQUIRE_FILE_THREAD();\n\n if (!file_)\n return;\n\n \/\/ Make sure any pending data is written.\n OnReceivedData();\n\n fclose(file_);\n file_ = NULL;\n\n \/\/ Notify the listener that the download completed.\n listener_->NotifyDownloadComplete(filename_);\n }\n\n void OnReceivedData() {\n REQUIRE_FILE_THREAD();\n\n std::vector<std::vector<char>*> data;\n\n \/\/ Remove all data from the pending data queue.\n {\n AutoLock lock_scope(this);\n if (!pending_data_.empty()) {\n data = pending_data_;\n pending_data_.clear();\n }\n }\n\n if (data.empty())\n return;\n\n \/\/ Write all pending data to file.\n std::vector<std::vector<char>*>::iterator it = data.begin();\n for (; it != data.end(); ++it) {\n std::vector<char>* buffer = *it;\n if (file_) {\n size_t total = 0;\n do {\n size_t write =\n fwrite(&(*buffer)[total], 1, buffer->size() - total, file_);\n if (write == 0)\n break;\n total += write;\n } while (total < buffer->size());\n }\n delete buffer;\n }\n data.clear();\n }\n\n static void CloseDanglingFile(FILE *file) {\n fclose(file);\n }\n\n private:\n CefRefPtr<DownloadListener> listener_;\n CefString filename_;\n FILE* file_;\n std::vector<std::vector<char>*> pending_data_;\n\n IMPLEMENT_REFCOUNTING(ClientDownloadHandler);\n IMPLEMENT_LOCKING(ClientDownloadHandler);\n};\n\nCefRefPtr<CefDownloadHandler> CreateDownloadHandler(\n CefRefPtr<DownloadListener> listener, const CefString& fileName) {\n CefRefPtr<ClientDownloadHandler> handler =\n new ClientDownloadHandler(listener, fileName);\n handler->Initialize();\n return handler.get();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\r\n#include \"application.h\"\r\n#include \"log.h\"\r\n#include \"perfcounter.h\"\r\n#include \"sysutil.h\"\r\n#include \"window.h\"\r\n#include \"devicemanager.h\"\r\n#include \"keyboarddevice.h\"\r\n#include \"settings.h\"\r\n\r\nnamespace dukat\r\n{\r\n\tApplication::Application(Settings& settings)\r\n\t\t: settings(settings), title(settings.get_string(\"window.title\")), paused(false), done(false)\r\n\t{\r\n\t\tsdl_check_result(SDL_Init(SDL_INIT_EVERYTHING), \"Initialize SDL\");\r\n\t\twindow = std::make_unique<Window>(settings.get_int(\"window.width\", 640), settings.get_int(\"window.height\", 480), \r\n\t\t\tsettings.get_bool(\"window.fullscreen\"), settings.get_bool(\"window.msaa\"));\r\n\t\twindow->set_title(title);\r\n\t\tdevice_manager = std::make_unique<DeviceManager>();\r\n\t\tdevice_manager->add_keyboard(window.get());\r\n\t\tdevice_manager->joystick_support = settings.get_bool(\"input.joystick.support\", true);\r\n\t\tgl_check_error();\r\n\t}\r\n\r\n\tApplication::~Application(void)\r\n\t{\r\n\t\tSDL_Quit();\r\n\t}\r\n\r\n\tint Application::run(void)\r\n\t{\r\n\t\tlogger << \"Initializing application.\" << std::endl;\r\n\t\tinit();\r\n\r\n\t\tlogger << \"Entering application loop.\" << std::endl;\t\t\r\n\t\tUint32 ticks, last_update = 0, last_frame = 0;\r\n\t\tSDL_Event e;\r\n\t\twhile (!done)\r\n\t\t{\r\n\t\t\tticks = SDL_GetTicks();\r\n\r\n\t\t\tdevice_manager->update();\r\n\t\t\tif (!paused)\r\n\t\t\t{\r\n\t\t\t\tupdate(((float)(ticks - last_update)) \/ 1000.0f);\r\n\t\t\t}\r\n\t\t\tlast_update = SDL_GetTicks();\r\n\r\n\t\t\t\/\/ update FPS counter\r\n\t\t\tif (ticks - last_frame >= 1000)\r\n\t\t\t{\r\n\t\t\t\tlast_fps = perfc.sum(PerformanceCounter::FRAMES);\r\n\t\t\t\tlast_frame = ticks;\r\n\t\t\t\tperfc.collect_stats();\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ process events\r\n\t\t\twhile (SDL_PollEvent(&e))\r\n\t\t\t{\r\n\t\t\t\thandle_event(e);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\/\/ render to screen\r\n\t\t\trender();\r\n\t\t\tperfc.inc(PerformanceCounter::FRAMES);\r\n\t\t\tperfc.reset();\r\n\t\t}\r\n\r\n\t\trelease();\r\n\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tvoid Application::handle_event(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.type)\r\n\t\t{\r\n\t\tcase SDL_QUIT:\r\n\t\t\tdone = true;\r\n\t\t\tbreak;\r\n\t\tcase SDL_KEYDOWN:\r\n\t\t\thandle_keyboard(e);\r\n\t\t\tbreak;\r\n\t\tcase SDL_WINDOWEVENT:\r\n\t\t\thandle_window_event(e);\r\n\t\t\tbreak;\r\n\t\tcase SDL_JOYDEVICEADDED:\r\n\t\t\tdevice_manager->add_joystick(window.get(), e.jdevice.which);\r\n\t\t\tbreak;\r\n\t\tcase SDL_JOYDEVICEREMOVED:\r\n\t\t\tdevice_manager->remove_joystick(e.jdevice.which);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Application::handle_keyboard(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.key.keysym.sym)\r\n\t\t{\r\n\t\tcase SDLK_ESCAPE:\r\n\t\t\tdone = true;\r\n\t\t\tbreak;\r\n\t\tcase SDLK_RETURN:\r\n\t\t\tif (e.key.keysym.mod & KMOD_ALT)\r\n\t\t\t{\r\n\t\t\t\twindow->toggle_fullscreen();\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase SDLK_F12:\r\n\t\t\tsave_screenshot(\"screenshot.png\");\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Application::handle_window_event(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.window.event)\r\n\t\t{\r\n\t\tcase SDL_WINDOWEVENT_FOCUS_GAINED:\r\n\t\t\tif (settings.get_bool(\"input.mouse.lock\", true))\r\n\t\t\t{\r\n\t\t\t\tsdl_check_result(SDL_SetRelativeMouseMode(SDL_TRUE), \"Set mouse mode\");\r\n\t\t\t}\r\n\t break;\r\n case SDL_WINDOWEVENT_FOCUS_LOST:\r\n \t\tif (settings.get_bool(\"input.mouse.lock\", true))\r\n\t\t\t{\r\n\t\t\t\tsdl_check_result(SDL_SetRelativeMouseMode(SDL_FALSE), \"Set mouse mode\");\r\n\t\t\t}\r\n\t break;\r\n\t\t}\r\n\t}\r\n}<commit_msg>Fixed application timer<commit_after>#include \"stdafx.h\"\r\n#include \"application.h\"\r\n#include \"log.h\"\r\n#include \"perfcounter.h\"\r\n#include \"sysutil.h\"\r\n#include \"window.h\"\r\n#include \"devicemanager.h\"\r\n#include \"keyboarddevice.h\"\r\n#include \"settings.h\"\r\n\r\nnamespace dukat\r\n{\r\n\tApplication::Application(Settings& settings)\r\n\t\t: settings(settings), title(settings.get_string(\"window.title\")), paused(false), done(false)\r\n\t{\r\n\t\tsdl_check_result(SDL_Init(SDL_INIT_EVERYTHING), \"Initialize SDL\");\r\n\t\twindow = std::make_unique<Window>(settings.get_int(\"window.width\", 640), settings.get_int(\"window.height\", 480), \r\n\t\t\tsettings.get_bool(\"window.fullscreen\"), settings.get_bool(\"window.msaa\"));\r\n\t\twindow->set_title(title);\r\n\t\tdevice_manager = std::make_unique<DeviceManager>();\r\n\t\tdevice_manager->add_keyboard(window.get());\r\n\t\tdevice_manager->joystick_support = settings.get_bool(\"input.joystick.support\", true);\r\n\t\tgl_check_error();\r\n\t}\r\n\r\n\tApplication::~Application(void)\r\n\t{\r\n\t\tSDL_Quit();\r\n\t}\r\n\r\n\tint Application::run(void)\r\n\t{\r\n\t\tlogger << \"Initializing application.\" << std::endl;\r\n\t\tinit();\r\n\r\n\t\tlogger << \"Entering application loop.\" << std::endl;\t\t\r\n\t\tUint32 ticks, last_update = 0, last_frame = 0;\r\n\t\tSDL_Event e;\r\n\t\twhile (!done)\r\n\t\t{\r\n\t\t\tticks = SDL_GetTicks();\r\n\r\n\t\t\tdevice_manager->update();\r\n\t\t\tif (!paused)\r\n\t\t\t{\r\n\t\t\t\tupdate(((float)(ticks - last_update)) \/ 1000.0f);\r\n\t\t\t}\r\n\t\t\tlast_update = ticks;\r\n\r\n\t\t\t\/\/ update FPS counter\r\n\t\t\tif (ticks - last_frame >= 1000)\r\n\t\t\t{\r\n\t\t\t\tlast_fps = perfc.sum(PerformanceCounter::FRAMES);\r\n\t\t\t\tlast_frame = ticks;\r\n\t\t\t\tperfc.collect_stats();\r\n\t\t\t}\r\n\r\n\t\t\t\/\/ process events\r\n\t\t\twhile (SDL_PollEvent(&e))\r\n\t\t\t{\r\n\t\t\t\thandle_event(e);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\/\/ render to screen\r\n\t\t\trender();\r\n\t\t\tperfc.inc(PerformanceCounter::FRAMES);\r\n\t\t\tperfc.reset();\r\n\t\t}\r\n\r\n\t\trelease();\r\n\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tvoid Application::handle_event(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.type)\r\n\t\t{\r\n\t\tcase SDL_QUIT:\r\n\t\t\tdone = true;\r\n\t\t\tbreak;\r\n\t\tcase SDL_KEYDOWN:\r\n\t\t\thandle_keyboard(e);\r\n\t\t\tbreak;\r\n\t\tcase SDL_WINDOWEVENT:\r\n\t\t\thandle_window_event(e);\r\n\t\t\tbreak;\r\n\t\tcase SDL_JOYDEVICEADDED:\r\n\t\t\tdevice_manager->add_joystick(window.get(), e.jdevice.which);\r\n\t\t\tbreak;\r\n\t\tcase SDL_JOYDEVICEREMOVED:\r\n\t\t\tdevice_manager->remove_joystick(e.jdevice.which);\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Application::handle_keyboard(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.key.keysym.sym)\r\n\t\t{\r\n\t\tcase SDLK_ESCAPE:\r\n\t\t\tdone = true;\r\n\t\t\tbreak;\r\n\t\tcase SDLK_RETURN:\r\n\t\t\tif (e.key.keysym.mod & KMOD_ALT)\r\n\t\t\t{\r\n\t\t\t\twindow->toggle_fullscreen();\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t\tcase SDLK_PAUSE:\r\n\t\t\ttoggle_pause();\r\n\t\t\tbreak;\r\n\t\tcase SDLK_F12:\r\n\t\t\tsave_screenshot(\"screenshot.png\");\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Application::handle_window_event(const SDL_Event& e)\r\n\t{\r\n\t\tswitch (e.window.event)\r\n\t\t{\r\n\t\tcase SDL_WINDOWEVENT_FOCUS_GAINED:\r\n\t\t\tif (settings.get_bool(\"input.mouse.lock\", true))\r\n\t\t\t{\r\n\t\t\t\tsdl_check_result(SDL_SetRelativeMouseMode(SDL_TRUE), \"Set mouse mode\");\r\n\t\t\t}\r\n\t break;\r\n case SDL_WINDOWEVENT_FOCUS_LOST:\r\n \t\tif (settings.get_bool(\"input.mouse.lock\", true))\r\n\t\t\t{\r\n\t\t\t\tsdl_check_result(SDL_SetRelativeMouseMode(SDL_FALSE), \"Set mouse mode\");\r\n\t\t\t}\r\n\t break;\r\n\t\t}\r\n\t}\r\n}<|endoftext|>"} {"text":"<commit_before>\/************************************\n * file enc : ASCII\n * author : wuyanyi09@gmail.com\n ************************************\/\n#ifndef CPPJIEBA_TRIE_H\n#define CPPJIEBA_TRIE_H\n\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <cstring>\n#include <stdint.h>\n#include <cmath>\n#include <limits>\n#include \"Limonp\/str_functs.hpp\"\n#include \"Limonp\/logger.hpp\"\n#include \"TransCode.hpp\"\n\n\n\nnamespace CppJieba\n{\n using namespace Limonp;\n const double MIN_DOUBLE = -3.14e+100;\n const double MAX_DOUBLE = 3.14e+100;\n typedef unordered_map<uint16_t, struct TrieNode*> TrieNodeMap;\n struct TrieNode\n {\n TrieNodeMap hmap;\n bool isLeaf;\n uint nodeInfoVecPos;\n TrieNode()\n {\n isLeaf = false;\n nodeInfoVecPos = 0;\n }\n };\n\n struct TrieNodeInfo\n {\n Unicode word;\n size_t freq;\n string tag;\n double logFreq; \/\/logFreq = log(freq\/sum(freq));\n TrieNodeInfo():freq(0),logFreq(0.0)\n {\n }\n TrieNodeInfo(const TrieNodeInfo& nodeInfo):word(nodeInfo.word), freq(nodeInfo.freq), tag(nodeInfo.tag), logFreq(nodeInfo.logFreq)\n {\n }\n TrieNodeInfo(const Unicode& _word):word(_word),freq(0),logFreq(MIN_DOUBLE)\n {\n }\n bool operator == (const TrieNodeInfo & rhs) const\n {\n return word == rhs.word && freq == rhs.freq && tag == rhs.tag && abs(logFreq - rhs.logFreq) < 0.001;\n }\n };\n\n inline ostream& operator << (ostream& os, const TrieNodeInfo & nodeInfo)\n {\n return os << nodeInfo.word << \":\" << nodeInfo.freq << \":\" << nodeInfo.tag << \":\" << nodeInfo.logFreq ;\n }\n\n typedef unordered_map<uint, const TrieNodeInfo*> DagType;\n\n class Trie\n {\n\n private:\n TrieNode* _root;\n vector<TrieNodeInfo> _nodeInfoVec;\n\n bool _initFlag;\n int64_t _freqSum;\n double _minLogFreq;\n\n public:\n Trie()\n {\n _root = NULL;\n _freqSum = 0;\n _minLogFreq = MAX_DOUBLE;\n _initFlag = false;\n }\n ~Trie()\n {\n dispose();\n }\n bool init()\n {\n if(_getInitFlag())\n {\n LogError(\"already initted!\");\n return false;\n }\n\n try\n {\n _root = new TrieNode;\n }\n catch(const bad_alloc& e)\n {\n return false;\n }\n if(NULL == _root)\n {\n return false;\n }\n _setInitFlag(true);\n return true;\n }\n bool dispose()\n {\n if(!_getInitFlag())\n {\n return false;\n }\n bool ret = _deleteNode(_root);\n if(!ret)\n {\n LogFatal(\"_deleteNode failed!\");\n return false;\n }\n _root = NULL;\n _nodeInfoVec.clear();\n\n _setInitFlag(false);\n return ret;\n }\n bool loadDict(const char * const filePath)\n {\n assert(_getInitFlag());\n if(!_trieInsert(filePath))\n {\n LogError(\"_trieInsert failed.\");\n return false;\n }\n if(!_countWeight())\n {\n LogError(\"_countWeight failed.\");\n return false;\n }\n return true;\n }\n\n private:\n void _setInitFlag(bool on){_initFlag = on;};\n bool _getInitFlag()const{return _initFlag;};\n\n public:\n const TrieNodeInfo* find(Unicode::const_iterator begin, Unicode::const_iterator end)const\n {\n\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return NULL;\n }\n if(begin >= end)\n {\n return NULL;\n }\n TrieNode* p = _root;\n for(Unicode::const_iterator it = begin; it != end; it++)\n {\n uint16_t chUni = *it;\n if(p->hmap.find(chUni) == p-> hmap.end())\n {\n return NULL;\n }\n else\n {\n p = p->hmap[chUni];\n }\n }\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n return &(_nodeInfoVec[pos]);\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return NULL;\n }\n }\n return NULL;\n }\n\n bool find(Unicode::const_iterator begin, Unicode::const_iterator end, vector<pair<uint, const TrieNodeInfo*> >& res) const\n {\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return false;\n }\n if (begin >= end) \n {\n LogFatal(\"begin >= end\");\n return false;\n }\n TrieNode* p = _root;\n for (Unicode::const_iterator itr = begin; itr != end; itr++)\n {\n if(p->hmap.find(*itr) == p-> hmap.end())\n {\n break;\n }\n p = p->hmap[*itr];\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n res.push_back(make_pair(itr-begin, &_nodeInfoVec[pos]));\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return false;\n }\n }\n }\n return !res.empty();\n }\n\n bool find(Unicode::const_iterator begin, Unicode::const_iterator end, uint offset, unordered_map<uint, const TrieNodeInfo* > & res) const\n {\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return false;\n }\n if (begin >= end) \n {\n LogFatal(\"begin >= end\");\n return false;\n }\n TrieNode* p = _root;\n for (Unicode::const_iterator itr = begin; itr != end; itr++)\n {\n if(p->hmap.find(*itr) == p-> hmap.end())\n {\n break;\n }\n p = p->hmap[*itr];\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n \/\/res.push_back(make_pair(itr-begin, &_nodeInfoVec[pos]));\n res[itr-begin + offset] = &_nodeInfoVec[pos];\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return false;\n }\n }\n }\n return !res.empty();\n }\n\n public:\n double getMinLogFreq()const{return _minLogFreq;};\n\n private:\n bool _insert(const TrieNodeInfo& nodeInfo)\n {\n if(!_getInitFlag())\n {\n LogFatal(\"not initted!\");\n return false;\n }\n\n\n const Unicode& uintVec = nodeInfo.word;\n TrieNode* p = _root;\n for(uint i = 0; i < uintVec.size(); i++)\n {\n uint16_t cu = uintVec[i];\n if(NULL == p)\n {\n return false;\n }\n if(p->hmap.end() == p->hmap.find(cu))\n {\n TrieNode * next = NULL;\n try\n {\n next = new TrieNode;\n }\n catch(const bad_alloc& e)\n {\n return false;\n }\n p->hmap[cu] = next;\n p = next;\n }\n else\n {\n p = p->hmap[cu];\n }\n }\n if(NULL == p)\n {\n return false;\n }\n if(p->isLeaf)\n {\n LogError(\"this node already _inserted\");\n return false;\n }\n\n p->isLeaf = true;\n _nodeInfoVec.push_back(nodeInfo);\n p->nodeInfoVecPos = _nodeInfoVec.size() - 1;\n\n return true;\n }\n\n private:\n bool _trieInsert(const char * const filePath)\n {\n ifstream ifs(filePath);\n if(!ifs)\n {\n LogError(\"open %s failed.\", filePath);\n return false;\n }\n string line;\n vector<string> vecBuf;\n\n TrieNodeInfo nodeInfo;\n while(getline(ifs, line))\n {\n vecBuf.clear();\n split(line, vecBuf, \" \");\n if(3 < vecBuf.size())\n {\n LogError(\"line[%s] illegal.\", line.c_str());\n return false;\n }\n if(!TransCode::decode(vecBuf[0], nodeInfo.word))\n {\n return false;\n }\n nodeInfo.freq = atoi(vecBuf[1].c_str());\n if(3 == vecBuf.size())\n {\n nodeInfo.tag = vecBuf[2];\n }\n\n \/\/_insert node\n if(!_insert(nodeInfo))\n {\n LogError(\"_insert node failed!\");\n }\n }\n return true;\n }\n bool _countWeight()\n {\n if(_nodeInfoVec.empty() || 0 != _freqSum)\n {\n LogError(\"_nodeInfoVec is empty or _freqSum has been counted already.\");\n return false;\n }\n\n \/\/freq total freq\n for(size_t i = 0; i < _nodeInfoVec.size(); i++)\n {\n _freqSum += _nodeInfoVec[i].freq;\n }\n\n if(0 == _freqSum)\n {\n LogError(\"_freqSum == 0 .\");\n return false;\n }\n\n \/\/normalize\n for(uint i = 0; i < _nodeInfoVec.size(); i++)\n {\n TrieNodeInfo& nodeInfo = _nodeInfoVec[i];\n if(0 == nodeInfo.freq)\n {\n LogFatal(\"nodeInfo.freq == 0!\");\n return false;\n }\n nodeInfo.logFreq = log(double(nodeInfo.freq)\/double(_freqSum));\n if(_minLogFreq > nodeInfo.logFreq)\n {\n _minLogFreq = nodeInfo.logFreq;\n }\n }\n\n return true;\n }\n\n bool _deleteNode(TrieNode* node)\n {\n for(TrieNodeMap::iterator it = node->hmap.begin(); it != node->hmap.end(); it++)\n {\n TrieNode* next = it->second;\n _deleteNode(next);\n }\n\n delete node;\n return true;\n }\n\n };\n}\n\n#endif\n<commit_msg>add logerror<commit_after>\/************************************\n * file enc : ASCII\n * author : wuyanyi09@gmail.com\n ************************************\/\n#ifndef CPPJIEBA_TRIE_H\n#define CPPJIEBA_TRIE_H\n\n#include <iostream>\n#include <fstream>\n#include <map>\n#include <cstring>\n#include <stdint.h>\n#include <cmath>\n#include <limits>\n#include \"Limonp\/str_functs.hpp\"\n#include \"Limonp\/logger.hpp\"\n#include \"TransCode.hpp\"\n\n\n\nnamespace CppJieba\n{\n using namespace Limonp;\n const double MIN_DOUBLE = -3.14e+100;\n const double MAX_DOUBLE = 3.14e+100;\n typedef unordered_map<uint16_t, struct TrieNode*> TrieNodeMap;\n struct TrieNode\n {\n TrieNodeMap hmap;\n bool isLeaf;\n uint nodeInfoVecPos;\n TrieNode()\n {\n isLeaf = false;\n nodeInfoVecPos = 0;\n }\n };\n\n struct TrieNodeInfo\n {\n Unicode word;\n size_t freq;\n string tag;\n double logFreq; \/\/logFreq = log(freq\/sum(freq));\n TrieNodeInfo():freq(0),logFreq(0.0)\n {\n }\n TrieNodeInfo(const TrieNodeInfo& nodeInfo):word(nodeInfo.word), freq(nodeInfo.freq), tag(nodeInfo.tag), logFreq(nodeInfo.logFreq)\n {\n }\n TrieNodeInfo(const Unicode& _word):word(_word),freq(0),logFreq(MIN_DOUBLE)\n {\n }\n bool operator == (const TrieNodeInfo & rhs) const\n {\n return word == rhs.word && freq == rhs.freq && tag == rhs.tag && abs(logFreq - rhs.logFreq) < 0.001;\n }\n };\n\n inline ostream& operator << (ostream& os, const TrieNodeInfo & nodeInfo)\n {\n return os << nodeInfo.word << \":\" << nodeInfo.freq << \":\" << nodeInfo.tag << \":\" << nodeInfo.logFreq ;\n }\n\n typedef unordered_map<uint, const TrieNodeInfo*> DagType;\n\n class Trie\n {\n\n private:\n TrieNode* _root;\n vector<TrieNodeInfo> _nodeInfoVec;\n\n bool _initFlag;\n int64_t _freqSum;\n double _minLogFreq;\n\n public:\n Trie()\n {\n _root = NULL;\n _freqSum = 0;\n _minLogFreq = MAX_DOUBLE;\n _initFlag = false;\n }\n ~Trie()\n {\n dispose();\n }\n bool init()\n {\n if(_getInitFlag())\n {\n LogError(\"already initted!\");\n return false;\n }\n\n try\n {\n _root = new TrieNode;\n }\n catch(const bad_alloc& e)\n {\n return false;\n }\n if(NULL == _root)\n {\n return false;\n }\n _setInitFlag(true);\n return true;\n }\n bool dispose()\n {\n if(!_getInitFlag())\n {\n return false;\n }\n bool ret = _deleteNode(_root);\n if(!ret)\n {\n LogFatal(\"_deleteNode failed!\");\n return false;\n }\n _root = NULL;\n _nodeInfoVec.clear();\n\n _setInitFlag(false);\n return ret;\n }\n bool loadDict(const char * const filePath)\n {\n assert(_getInitFlag());\n if(!_trieInsert(filePath))\n {\n LogError(\"_trieInsert failed.\");\n return false;\n }\n if(!_countWeight())\n {\n LogError(\"_countWeight failed.\");\n return false;\n }\n return true;\n }\n\n private:\n void _setInitFlag(bool on){_initFlag = on;};\n bool _getInitFlag()const{return _initFlag;};\n\n public:\n const TrieNodeInfo* find(Unicode::const_iterator begin, Unicode::const_iterator end)const\n {\n\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return NULL;\n }\n if(begin >= end)\n {\n return NULL;\n }\n TrieNode* p = _root;\n for(Unicode::const_iterator it = begin; it != end; it++)\n {\n uint16_t chUni = *it;\n if(p->hmap.find(chUni) == p-> hmap.end())\n {\n return NULL;\n }\n else\n {\n p = p->hmap[chUni];\n }\n }\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n return &(_nodeInfoVec[pos]);\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return NULL;\n }\n }\n return NULL;\n }\n\n bool find(Unicode::const_iterator begin, Unicode::const_iterator end, vector<pair<uint, const TrieNodeInfo*> >& res) const\n {\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return false;\n }\n if (begin >= end) \n {\n LogFatal(\"begin >= end\");\n return false;\n }\n TrieNode* p = _root;\n for (Unicode::const_iterator itr = begin; itr != end; itr++)\n {\n if(p->hmap.find(*itr) == p-> hmap.end())\n {\n break;\n }\n p = p->hmap[*itr];\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n res.push_back(make_pair(itr-begin, &_nodeInfoVec[pos]));\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return false;\n }\n }\n }\n return !res.empty();\n }\n\n bool find(Unicode::const_iterator begin, Unicode::const_iterator end, uint offset, unordered_map<uint, const TrieNodeInfo* > & res) const\n {\n if(!_getInitFlag())\n {\n LogFatal(\"trie not initted!\");\n return false;\n }\n if (begin >= end) \n {\n LogFatal(\"begin >= end\");\n return false;\n }\n TrieNode* p = _root;\n for (Unicode::const_iterator itr = begin; itr != end; itr++)\n {\n if(p->hmap.find(*itr) == p-> hmap.end())\n {\n break;\n }\n p = p->hmap[*itr];\n if(p->isLeaf)\n {\n uint pos = p->nodeInfoVecPos;\n if(pos < _nodeInfoVec.size())\n {\n \/\/res.push_back(make_pair(itr-begin, &_nodeInfoVec[pos]));\n res[itr-begin + offset] = &_nodeInfoVec[pos];\n }\n else\n {\n LogFatal(\"node's nodeInfoVecPos is out of _nodeInfoVec's range\");\n return false;\n }\n }\n }\n return !res.empty();\n }\n\n public:\n double getMinLogFreq()const{return _minLogFreq;};\n\n private:\n bool _insert(const TrieNodeInfo& nodeInfo)\n {\n if(!_getInitFlag())\n {\n LogFatal(\"not initted!\");\n return false;\n }\n\n\n const Unicode& uintVec = nodeInfo.word;\n TrieNode* p = _root;\n for(uint i = 0; i < uintVec.size(); i++)\n {\n uint16_t cu = uintVec[i];\n if(NULL == p)\n {\n return false;\n }\n if(p->hmap.end() == p->hmap.find(cu))\n {\n TrieNode * next = NULL;\n try\n {\n next = new TrieNode;\n }\n catch(const bad_alloc& e)\n {\n return false;\n }\n p->hmap[cu] = next;\n p = next;\n }\n else\n {\n p = p->hmap[cu];\n }\n }\n if(NULL == p)\n {\n return false;\n }\n if(p->isLeaf)\n {\n LogError(\"this node already _inserted\");\n return false;\n }\n\n p->isLeaf = true;\n _nodeInfoVec.push_back(nodeInfo);\n p->nodeInfoVecPos = _nodeInfoVec.size() - 1;\n\n return true;\n }\n\n private:\n bool _trieInsert(const char * const filePath)\n {\n ifstream ifs(filePath);\n if(!ifs)\n {\n LogError(\"open %s failed.\", filePath);\n return false;\n }\n string line;\n vector<string> vecBuf;\n\n TrieNodeInfo nodeInfo;\n size_t lineno = 0;\n while(getline(ifs, line))\n {\n vecBuf.clear();\n lineno ++;\n split(line, vecBuf, \" \");\n if(3 < vecBuf.size())\n {\n LogError(\"line[%u:%s] illegal.\", lineno, line.c_str());\n return false;\n }\n if(!TransCode::decode(vecBuf[0], nodeInfo.word))\n {\n LogError(\"line[%u:%s] illegal.\", lineno, line.c_str());\n return false;\n }\n nodeInfo.freq = atoi(vecBuf[1].c_str());\n if(3 == vecBuf.size())\n {\n nodeInfo.tag = vecBuf[2];\n }\n\n \/\/_insert node\n if(!_insert(nodeInfo))\n {\n LogError(\"_insert node failed!\");\n }\n }\n return true;\n }\n bool _countWeight()\n {\n if(_nodeInfoVec.empty() || 0 != _freqSum)\n {\n LogError(\"_nodeInfoVec is empty or _freqSum has been counted already.\");\n return false;\n }\n\n \/\/freq total freq\n for(size_t i = 0; i < _nodeInfoVec.size(); i++)\n {\n _freqSum += _nodeInfoVec[i].freq;\n }\n\n if(0 == _freqSum)\n {\n LogError(\"_freqSum == 0 .\");\n return false;\n }\n\n \/\/normalize\n for(uint i = 0; i < _nodeInfoVec.size(); i++)\n {\n TrieNodeInfo& nodeInfo = _nodeInfoVec[i];\n if(0 == nodeInfo.freq)\n {\n LogFatal(\"nodeInfo.freq == 0!\");\n return false;\n }\n nodeInfo.logFreq = log(double(nodeInfo.freq)\/double(_freqSum));\n if(_minLogFreq > nodeInfo.logFreq)\n {\n _minLogFreq = nodeInfo.logFreq;\n }\n }\n\n return true;\n }\n\n bool _deleteNode(TrieNode* node)\n {\n for(TrieNodeMap::iterator it = node->hmap.begin(); it != node->hmap.end(); it++)\n {\n TrieNode* next = it->second;\n _deleteNode(next);\n }\n\n delete node;\n return true;\n }\n\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#define ENDL \"\\n\"\r\n\r\n\/*\r\n\tstruct gl_LightSourceParameters {\r\n\t\tvec4 ambient; \r\n\t\tvec4 diffuse; \r\n\t\tvec4 specular; \r\n\t\tvec4 position; \r\n\t\tvec4 halfVector; \r\n\t\tvec3 spotDirection; \r\n\t\tfloat spotExponent; \r\n\t\tfloat spotCutoff; \/\/ (range: [0.0,90.0], 180.0)\r\n\t\tfloat spotCosCutoff; \/\/ (range: [1.0,0.0],-1.0)\r\n\t\tfloat constantAttenuation; \r\n\t\tfloat linearAttenuation; \r\n\t\tfloat quadraticAttenuation;\t\r\n\t};\r\n\r\n\tuniform gl_LightSourceParameters gl_LightSource[gl_MaxLights];\r\n\r\n\tstruct gl_LightModelParameters {\r\n\t\tvec4 ambient; \r\n\t};\r\n\r\n\tuniform gl_LightModelParameters gl_LightModel;\r\n\r\n\tstruct gl_MaterialParameters {\r\n\t\tvec4 emission; \r\n\t\tvec4 ambient; \r\n\t\tvec4 diffuse; \r\n\t\tvec4 specular; \r\n\t\tfloat shininess; \r\n\t};\r\n\r\n\tuniform gl_MaterialParameters gl_FrontMaterial;\r\n\tuniform gl_MaterialParameters gl_BackMaterial;\r\n*\/\r\n\r\nconst char* GetVSModelShader()\r\n{\r\n\treturn\r\n\t\t\"varying vec3 vecVertexNormal;\"\r\n\t\t\"varying vec3 vecLightDir;\"\r\n\t\t\"varying vec3 vecLightHalf;\"\r\n\t\t\"varying vec3 vecViewDir;\"\r\n\r\n\t\t\"varying vec4 vecAmbientLight;\"\r\n\t\t\"varying vec4 vecDiffuseLight;\"\r\n\t\t\"varying vec4 vecSpecularLight;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tgl_Position = gl_ModelViewProjectionMatrix * gl_Vertex;\"\r\n\r\n\t\t\"\tvecVertexNormal = normalize(gl_NormalMatrix * gl_Normal);\"\r\n\t\t\"\tvecLightDir = normalize(gl_LightSource[0].position.xyz);\"\r\n\t\t\"\tvecLightHalf = gl_LightSource[0].halfVector.xyz;\"\r\n\t\t\"\tvecViewDir = normalize(-vec3(gl_ModelViewMatrix * gl_Vertex));\"\r\n\r\n\t\t\"\tvecAmbientLight = gl_FrontMaterial.emission + gl_FrontMaterial.ambient * gl_LightModel.ambient + gl_LightSource[0].ambient * gl_FrontMaterial.ambient;\"\r\n\t\t\"\tvecDiffuseLight = gl_LightSource[0].diffuse * gl_FrontMaterial.diffuse;\"\r\n\t\t\"\tvecSpecularLight = gl_LightSource[0].specular * gl_FrontMaterial.specular;\"\r\n\r\n\t\t\"\tgl_TexCoord[0] = gl_MultiTexCoord0;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSModelShader()\r\n{\r\n\treturn\r\n\t\t\"varying vec3 vecVertexNormal;\"\r\n\t\t\"varying vec3 vecLightDir;\"\r\n\t\t\"varying vec3 vecLightHalf;\"\r\n\t\t\"varying vec3 vecViewDir;\"\r\n\r\n\t\t\"varying vec4 vecAmbientLight;\"\r\n\t\t\"varying vec4 vecDiffuseLight;\"\r\n\t\t\"varying vec4 vecSpecularLight;\"\r\n\r\n\t\t\"uniform sampler2D iDiffuseTexture;\"\r\n\t\t\"uniform sampler2D iNormalMap;\"\r\n\t\t\"uniform sampler2D iAOMap;\"\r\n\t\t\"uniform sampler2D iCAOMap;\"\r\n\r\n\t\t\"uniform bool bLighting;\"\r\n\t\t\"uniform bool bDiffuseTexture;\"\r\n\t\t\"uniform bool bNormalMap;\"\r\n\t\t\"uniform bool bAOMap;\"\r\n\t\t\"uniform bool bCAOMap;\"\r\n\r\n\t\t\"mat3 ComputeTangentFrame(vec3 vecNormal, vec3 vecPosition, vec2 vecTexCoord)\"\r\n\t\t\"{\"\r\n\t\t\"\tvec3 dpx = dFdx(vecPosition);\"\r\n\t\t\"\tvec3 dpy = dFdy(vecPosition);\"\r\n\t\t\"\tvec2 dtx = dFdx(vecTexCoord);\"\r\n\t\t\"\tvec2 dty = dFdy(vecTexCoord);\"\r\n\r\n\t\t\"\tvec3 vecTangent = normalize(dpx * dty.t - dpy * dtx.t);\"\r\n\t\t\"\tvec3 vecBitangent = cross(vecTangent, vecNormal);\"\r\n\r\n\t\t\"\treturn mat3(vecTangent, vecBitangent, vecNormal);\"\r\n\t\t\"}\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvec4 clrDiffuseColor = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec3 vecTangentNormal;\"\r\n\t\t\"\tvec4 clrAO = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec4 clrCAO = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec4 clrLight;\"\r\n\r\n\t\t\"\tif (bDiffuseTexture)\"\r\n\t\t\"\t\tclrDiffuseColor = texture2D(iDiffuseTexture, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bNormalMap)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tvecTangentNormal = normalize(texture2D(iNormalMap, gl_TexCoord[0].xy).xyz * 2.0 - 1.0);\"\r\n\t\t\"\t\tvecTangentNormal.x = -vecTangentNormal.x;\"\r\n\t\t\"\t}\"\r\n\r\n\t\t\"\tif (bAOMap)\"\r\n\t\t\"\t\tclrAO = texture2D(iAOMap, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bCAOMap)\"\r\n\t\t\"\t\tclrCAO = texture2D(iCAOMap, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bLighting)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tvec3 vecTranslatedNormal = vecTangentNormal;\"\r\n\r\n\t\t\"\t\tif (bNormalMap)\"\r\n\t\t\"\t\t{\"\r\n\t\t\"\t\t\tmat3 mTBN = ComputeTangentFrame(normalize(vecVertexNormal), normalize(vecViewDir), gl_TexCoord[0].st);\"\r\n\t\t\"\t\t\tvecTranslatedNormal = mTBN * vecTangentNormal;\"\r\n\t\t\"\t\t}\"\r\n\t\t\"\t\telse\"\r\n\t\t\"\t\t\tvecTranslatedNormal = normalize(vecVertexNormal);\"\r\n\r\n\t\t\"\t\tfloat flLightStrength = dot(vecTranslatedNormal, vecLightDir);\"\r\n\t\t\"\t\tif (flLightStrength < 0.0) flLightStrength = 0.0;\"\r\n\t\t\"\t\tif (flLightStrength > 1.0) flLightStrength = 1.0;\"\r\n\r\n\t\t\"\t\tfloat flNormalDotHalfVector = min(0.0, dot(vecTranslatedNormal, normalize(vecLightHalf)));\"\r\n\r\n\t\t\"\t\tfloat flPowerFactor = 0.0;\"\r\n\t\t\"\t\tif (flLightStrength > 0.0)\"\r\n\t\t\"\t\t\tflPowerFactor = pow(flNormalDotHalfVector, gl_FrontMaterial.shininess);\"\r\n\r\n\t\t\"\t\tclrLight = vecAmbientLight +\"\r\n\t\t\"\t\t\tvecDiffuseLight * flLightStrength +\"\r\n\t\t\"\t\t\tvecSpecularLight * flPowerFactor;\"\r\n\t\t\"\t}\"\r\n\t\t\"\telse\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tfloat flDot = dot(normalize(vecVertexNormal), vec3(0, 1, 0));\"\r\n\t\t\"\t\tclrLight = vec4(1, 1, 1, 1) * (flDot * 0.5) + vec4(0.45, 0.45, 0.45, 0.45);\"\r\n\t\t\"\t\tclrLight = clrLight * gl_FrontMaterial.diffuse;\"\r\n\t\t\"\t}\"\r\n\r\n\t\t\"\tgl_FragColor = clrLight * clrDiffuseColor * clrAO * clrCAO;\"\r\n\r\n\t\t\"\tgl_FragColor.a = clrDiffuseColor.a;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetVSFlattenedShadowMap()\r\n{\r\n\treturn\r\n\t\t\"varying vec4 vecShadowCoord;\"\r\n\t\t\"varying vec3 vecSurfaceNormal;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvecShadowCoord = gl_TextureMatrix[7] * gl_Vertex;\"\r\n\t\t\"\tvecSurfaceNormal = gl_Normal;\"\r\n\t\t\"\tgl_Position = gl_MultiTexCoord0;\"\r\n\t\t\"\tgl_FrontColor = gl_Color;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSFlattenedShadowMap()\r\n{\r\n\treturn\r\n\t\t\"uniform sampler2D iShadowMap;\"\r\n\t\t\"uniform vec3 vecLightNormal;\"\r\n\t\t\"uniform bool bOccludeAll;\"\r\n\t\t\"varying vec4 vecShadowCoord;\"\r\n\t\t\"varying vec3 vecSurfaceNormal;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tfloat flLightDot = dot(vecLightNormal, normalize(vecSurfaceNormal));\"\r\n\r\n\t\t\t\/\/ If the face is facing away from the light source, don't include it in the sample.\r\n\t\t\"\tif (flLightDot > 0.0)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tgl_FragColor = vec4(0.0, 0.0, 0.0, 0.0);\"\r\n\t\t\"\t}\"\r\n\t\t\"\telse\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tfloat flShadow = 1.0;\"\r\n\t\t\"\t\tif (bOccludeAll)\"\r\n\t\t\"\t\t\tflShadow = 0.0;\"\r\n\t\t\"\t\telse if (vecShadowCoord.w > 0.0)\"\r\n\t\t\"\t\t{\"\r\n\t\t\"\t\t\tvec4 vecShadowCoordinateWdivide = vecShadowCoord \/ vecShadowCoord.w;\"\r\n\t\t\"\t\t\tfloat flDistanceFromLight = texture2D(iShadowMap, vecShadowCoordinateWdivide.st).z;\"\r\n\r\n\t\t\t\t\t\/\/ Reduce moire and self-shadowing\r\n\t\t\"\t\t\tvecShadowCoordinateWdivide.z -= 0.003 + 0.004*(1.0-flLightDot);\"\t\/\/ Use flLightDot to get further away from surfaces at high angles.\r\n\r\n\t\t\t\t\t\/\/ It's .99 because sometimes if every sample on a point is perfectly white it suffers integer overflow down the line and becomes black.\r\n\t\t\"\t\t\tflShadow = flDistanceFromLight < vecShadowCoordinateWdivide.z?0.0:0.99;\"\r\n\t\t\"\t\t}\"\r\n\r\n\t\t\"\t\tgl_FragColor = vec4(flShadow, flShadow, flShadow, 1.0);\"\r\n\t\t\"\t}\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetVSAOMap()\r\n{\r\n\treturn\r\n\t\t\"varying vec2 vecUV;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tgl_Position = ftransform();\"\r\n\t\t\"\tgl_FrontColor = gl_Color;\"\r\n\t\t\"\tvecUV = gl_MultiTexCoord0.st;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSAOMap()\r\n{\r\n\treturn\r\n\t\t\"uniform sampler2D iAOMap;\"\r\n\t\t\"varying vec2 vecUV;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvec4 vecColor = texture2D(iAOMap, vecUV);\"\r\n\t\t\"\tif (vecColor.a == 0.0)\"\t\/\/ No samples\r\n\t\t\"\t\tgl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\"\r\n\t\t\"\telse\"\r\n\t\t\"\t\tgl_FragColor = vec4(vecColor.x\/vecColor.a, vecColor.y\/vecColor.a, vecColor.z\/vecColor.a, 1.0);\"\r\n\t\t\"}\";\r\n}\r\n<commit_msg>Fixed specular not showing up and sometimes causing artifacts.<commit_after>#define ENDL \"\\n\"\r\n\r\n\/*\r\n\tstruct gl_LightSourceParameters {\r\n\t\tvec4 ambient; \r\n\t\tvec4 diffuse; \r\n\t\tvec4 specular; \r\n\t\tvec4 position; \r\n\t\tvec4 halfVector; \r\n\t\tvec3 spotDirection; \r\n\t\tfloat spotExponent; \r\n\t\tfloat spotCutoff; \/\/ (range: [0.0,90.0], 180.0)\r\n\t\tfloat spotCosCutoff; \/\/ (range: [1.0,0.0],-1.0)\r\n\t\tfloat constantAttenuation; \r\n\t\tfloat linearAttenuation; \r\n\t\tfloat quadraticAttenuation;\t\r\n\t};\r\n\r\n\tuniform gl_LightSourceParameters gl_LightSource[gl_MaxLights];\r\n\r\n\tstruct gl_LightModelParameters {\r\n\t\tvec4 ambient; \r\n\t};\r\n\r\n\tuniform gl_LightModelParameters gl_LightModel;\r\n\r\n\tstruct gl_MaterialParameters {\r\n\t\tvec4 emission; \r\n\t\tvec4 ambient; \r\n\t\tvec4 diffuse; \r\n\t\tvec4 specular; \r\n\t\tfloat shininess; \r\n\t};\r\n\r\n\tuniform gl_MaterialParameters gl_FrontMaterial;\r\n\tuniform gl_MaterialParameters gl_BackMaterial;\r\n*\/\r\n\r\nconst char* GetVSModelShader()\r\n{\r\n\treturn\r\n\t\t\"varying vec3 vecVertexNormal;\"\r\n\t\t\"varying vec3 vecLightDir;\"\r\n\t\t\"varying vec3 vecLightHalf;\"\r\n\t\t\"varying vec3 vecViewDir;\"\r\n\r\n\t\t\"varying vec4 vecAmbientLight;\"\r\n\t\t\"varying vec4 vecDiffuseLight;\"\r\n\t\t\"varying vec4 vecSpecularLight;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tgl_Position = gl_ModelViewProjectionMatrix * gl_Vertex;\"\r\n\r\n\t\t\"\tvecVertexNormal = normalize(gl_NormalMatrix * gl_Normal);\"\r\n\t\t\"\tvecLightDir = normalize(gl_LightSource[0].position.xyz);\"\r\n\t\t\"\tvecLightHalf = gl_LightSource[0].halfVector.xyz;\"\r\n\t\t\"\tvecViewDir = normalize(-vec3(gl_ModelViewMatrix * gl_Vertex));\"\r\n\r\n\t\t\"\tvecAmbientLight = gl_FrontMaterial.emission + gl_FrontMaterial.ambient * gl_LightModel.ambient + gl_LightSource[0].ambient * gl_FrontMaterial.ambient;\"\r\n\t\t\"\tvecDiffuseLight = gl_LightSource[0].diffuse * gl_FrontMaterial.diffuse;\"\r\n\t\t\"\tvecSpecularLight = gl_LightSource[0].specular * gl_FrontMaterial.specular;\"\r\n\r\n\t\t\"\tgl_TexCoord[0] = gl_MultiTexCoord0;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSModelShader()\r\n{\r\n\treturn\r\n\t\t\"varying vec3 vecVertexNormal;\"\r\n\t\t\"varying vec3 vecLightDir;\"\r\n\t\t\"varying vec3 vecLightHalf;\"\r\n\t\t\"varying vec3 vecViewDir;\"\r\n\r\n\t\t\"varying vec4 vecAmbientLight;\"\r\n\t\t\"varying vec4 vecDiffuseLight;\"\r\n\t\t\"varying vec4 vecSpecularLight;\"\r\n\r\n\t\t\"uniform sampler2D iDiffuseTexture;\"\r\n\t\t\"uniform sampler2D iNormalMap;\"\r\n\t\t\"uniform sampler2D iAOMap;\"\r\n\t\t\"uniform sampler2D iCAOMap;\"\r\n\r\n\t\t\"uniform bool bLighting;\"\r\n\t\t\"uniform bool bDiffuseTexture;\"\r\n\t\t\"uniform bool bNormalMap;\"\r\n\t\t\"uniform bool bAOMap;\"\r\n\t\t\"uniform bool bCAOMap;\"\r\n\r\n\t\t\"mat3 ComputeTangentFrame(vec3 vecNormal, vec3 vecPosition, vec2 vecTexCoord)\"\r\n\t\t\"{\"\r\n\t\t\"\tvec3 dpx = dFdx(vecPosition);\"\r\n\t\t\"\tvec3 dpy = dFdy(vecPosition);\"\r\n\t\t\"\tvec2 dtx = dFdx(vecTexCoord);\"\r\n\t\t\"\tvec2 dty = dFdy(vecTexCoord);\"\r\n\r\n\t\t\"\tvec3 vecTangent = normalize(dpx * dty.t - dpy * dtx.t);\"\r\n\t\t\"\tvec3 vecBitangent = cross(vecTangent, vecNormal);\"\r\n\r\n\t\t\"\treturn mat3(vecTangent, vecBitangent, vecNormal);\"\r\n\t\t\"}\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvec4 clrDiffuseColor = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec3 vecTangentNormal;\"\r\n\t\t\"\tvec4 clrAO = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec4 clrCAO = vec4(1.0, 1.0, 1.0, 1.0);\"\r\n\t\t\"\tvec4 clrLight;\"\r\n\r\n\t\t\"\tif (bDiffuseTexture)\"\r\n\t\t\"\t\tclrDiffuseColor = texture2D(iDiffuseTexture, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bNormalMap)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tvecTangentNormal = normalize(texture2D(iNormalMap, gl_TexCoord[0].xy).xyz * 2.0 - 1.0);\"\r\n\t\t\"\t\tvecTangentNormal.x = -vecTangentNormal.x;\"\r\n\t\t\"\t}\"\r\n\r\n\t\t\"\tif (bAOMap)\"\r\n\t\t\"\t\tclrAO = texture2D(iAOMap, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bCAOMap)\"\r\n\t\t\"\t\tclrCAO = texture2D(iCAOMap, gl_TexCoord[0].xy);\"\r\n\r\n\t\t\"\tif (bLighting)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tvec3 vecTranslatedNormal = vecTangentNormal;\"\r\n\r\n\t\t\"\t\tif (bNormalMap)\"\r\n\t\t\"\t\t{\"\r\n\t\t\"\t\t\tmat3 mTBN = ComputeTangentFrame(normalize(vecVertexNormal), normalize(vecViewDir), gl_TexCoord[0].st);\"\r\n\t\t\"\t\t\tvecTranslatedNormal = mTBN * vecTangentNormal;\"\r\n\t\t\"\t\t}\"\r\n\t\t\"\t\telse\"\r\n\t\t\"\t\t\tvecTranslatedNormal = normalize(vecVertexNormal);\"\r\n\r\n\t\t\"\t\tfloat flLightStrength = dot(vecTranslatedNormal, vecLightDir);\"\r\n\t\t\"\t\tif (flLightStrength < 0.0) flLightStrength = 0.0;\"\r\n\t\t\"\t\tif (flLightStrength > 1.0) flLightStrength = 1.0;\"\r\n\r\n\t\t\"\t\tfloat flNormalDotHalfVector = max(0.0, dot(vecTranslatedNormal, normalize(vecLightHalf)));\"\r\n\r\n\t\t\"\t\tfloat flPowerFactor = 0.0;\"\r\n\t\t\"\t\tif (flLightStrength > 0.0)\"\r\n\t\t\"\t\t\tflPowerFactor = pow(flNormalDotHalfVector, gl_FrontMaterial.shininess);\"\r\n\r\n\t\t\"\t\tclrLight = vecAmbientLight +\"\r\n\t\t\"\t\t\tvecDiffuseLight * flLightStrength +\"\r\n\t\t\"\t\t\tvecSpecularLight * flPowerFactor;\"\r\n\t\t\"\t}\"\r\n\t\t\"\telse\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tfloat flDot = dot(normalize(vecVertexNormal), vec3(0, 1, 0));\"\r\n\t\t\"\t\tclrLight = vec4(1, 1, 1, 1) * (flDot * 0.5) + vec4(0.45, 0.45, 0.45, 0.45);\"\r\n\t\t\"\t\tclrLight = clrLight * gl_FrontMaterial.diffuse;\"\r\n\t\t\"\t}\"\r\n\r\n\t\t\"\tgl_FragColor = clrLight * clrDiffuseColor * clrAO * clrCAO;\"\r\n\r\n\t\t\"\tgl_FragColor.a = clrDiffuseColor.a;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetVSFlattenedShadowMap()\r\n{\r\n\treturn\r\n\t\t\"varying vec4 vecShadowCoord;\"\r\n\t\t\"varying vec3 vecSurfaceNormal;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvecShadowCoord = gl_TextureMatrix[7] * gl_Vertex;\"\r\n\t\t\"\tvecSurfaceNormal = gl_Normal;\"\r\n\t\t\"\tgl_Position = gl_MultiTexCoord0;\"\r\n\t\t\"\tgl_FrontColor = gl_Color;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSFlattenedShadowMap()\r\n{\r\n\treturn\r\n\t\t\"uniform sampler2D iShadowMap;\"\r\n\t\t\"uniform vec3 vecLightNormal;\"\r\n\t\t\"uniform bool bOccludeAll;\"\r\n\t\t\"varying vec4 vecShadowCoord;\"\r\n\t\t\"varying vec3 vecSurfaceNormal;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tfloat flLightDot = dot(vecLightNormal, normalize(vecSurfaceNormal));\"\r\n\r\n\t\t\t\/\/ If the face is facing away from the light source, don't include it in the sample.\r\n\t\t\"\tif (flLightDot > 0.0)\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tgl_FragColor = vec4(0.0, 0.0, 0.0, 0.0);\"\r\n\t\t\"\t}\"\r\n\t\t\"\telse\"\r\n\t\t\"\t{\"\r\n\t\t\"\t\tfloat flShadow = 1.0;\"\r\n\t\t\"\t\tif (bOccludeAll)\"\r\n\t\t\"\t\t\tflShadow = 0.0;\"\r\n\t\t\"\t\telse if (vecShadowCoord.w > 0.0)\"\r\n\t\t\"\t\t{\"\r\n\t\t\"\t\t\tvec4 vecShadowCoordinateWdivide = vecShadowCoord \/ vecShadowCoord.w;\"\r\n\t\t\"\t\t\tfloat flDistanceFromLight = texture2D(iShadowMap, vecShadowCoordinateWdivide.st).z;\"\r\n\r\n\t\t\t\t\t\/\/ Reduce moire and self-shadowing\r\n\t\t\"\t\t\tvecShadowCoordinateWdivide.z -= 0.003 + 0.004*(1.0-flLightDot);\"\t\/\/ Use flLightDot to get further away from surfaces at high angles.\r\n\r\n\t\t\t\t\t\/\/ It's .99 because sometimes if every sample on a point is perfectly white it suffers integer overflow down the line and becomes black.\r\n\t\t\"\t\t\tflShadow = flDistanceFromLight < vecShadowCoordinateWdivide.z?0.0:0.99;\"\r\n\t\t\"\t\t}\"\r\n\r\n\t\t\"\t\tgl_FragColor = vec4(flShadow, flShadow, flShadow, 1.0);\"\r\n\t\t\"\t}\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetVSAOMap()\r\n{\r\n\treturn\r\n\t\t\"varying vec2 vecUV;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tgl_Position = ftransform();\"\r\n\t\t\"\tgl_FrontColor = gl_Color;\"\r\n\t\t\"\tvecUV = gl_MultiTexCoord0.st;\"\r\n\t\t\"}\";\r\n}\r\n\r\nconst char* GetFSAOMap()\r\n{\r\n\treturn\r\n\t\t\"uniform sampler2D iAOMap;\"\r\n\t\t\"varying vec2 vecUV;\"\r\n\r\n\t\t\"void main()\"\r\n\t\t\"{\"\r\n\t\t\"\tvec4 vecColor = texture2D(iAOMap, vecUV);\"\r\n\t\t\"\tif (vecColor.a == 0.0)\"\t\/\/ No samples\r\n\t\t\"\t\tgl_FragColor = vec4(0.0, 0.0, 0.0, 1.0);\"\r\n\t\t\"\telse\"\r\n\t\t\"\t\tgl_FragColor = vec4(vecColor.x\/vecColor.a, vecColor.y\/vecColor.a, vecColor.z\/vecColor.a, 1.0);\"\r\n\t\t\"}\";\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"Util.h\"\n\nstd::string strToUpper(const char* from)\n{\n\tstd::string str(from);\n\tfor(unsigned int i = 0; i < str.size(); i++)\n\t\tstr[i] = toupper(from[i]);\n\treturn str;\n}\n\nstd::string& strToUpper(std::string& str)\n{\n\tfor(unsigned int i = 0; i < str.size(); i++)\n\t\tstr[i] = toupper(str[i]);\n\n\treturn str;\n}\n\nstd::string strToUpper(const std::string& str)\n{\n\treturn strToUpper(str.c_str());\n}\n\nfloat round(float num)\n{\n\treturn (float)((int)(num + 0.5f));\n}\n\nEigen::Affine3f& roundMatrix(Eigen::Affine3f& mat)\n{\n\tmat.translation()[0] = round(mat.translation()[0]);\n\tmat.translation()[1] = round(mat.translation()[1]);\n\treturn mat;\n}\n\nEigen::Affine3f roundMatrix(const Eigen::Affine3f& mat)\n{\n\tEigen::Affine3f ret = mat;\n\troundMatrix(ret);\n\treturn ret;\n}\n\nEigen::Vector3f roundVector(const Eigen::Vector3f& vec)\n{\n\tEigen::Vector3f ret = vec;\n\tret[0] = round(ret[0]);\n\tret[1] = round(ret[1]);\n\tret[2] = round(ret[2]);\n\treturn ret;\n}\n\nEigen::Vector2f roundVector(const Eigen::Vector2f& vec)\n{\n\tEigen::Vector2f ret = vec;\n\tret[0] = round(ret[0]);\n\tret[1] = round(ret[1]);\n\treturn ret;\n}\n<commit_msg>Fix for building with VS2013.<commit_after>#include \"Util.h\"\n\nstd::string strToUpper(const char* from)\n{\n\tstd::string str(from);\n\tfor(unsigned int i = 0; i < str.size(); i++)\n\t\tstr[i] = toupper(from[i]);\n\treturn str;\n}\n\nstd::string& strToUpper(std::string& str)\n{\n\tfor(unsigned int i = 0; i < str.size(); i++)\n\t\tstr[i] = toupper(str[i]);\n\n\treturn str;\n}\n\nstd::string strToUpper(const std::string& str)\n{\n\treturn strToUpper(str.c_str());\n}\n\n\n#if _MSC_VER < 1800\nfloat round(float num)\n{\n\treturn (float)((int)(num + 0.5f));\n}\n#endif\n\nEigen::Affine3f& roundMatrix(Eigen::Affine3f& mat)\n{\n\tmat.translation()[0] = round(mat.translation()[0]);\n\tmat.translation()[1] = round(mat.translation()[1]);\n\treturn mat;\n}\n\nEigen::Affine3f roundMatrix(const Eigen::Affine3f& mat)\n{\n\tEigen::Affine3f ret = mat;\n\troundMatrix(ret);\n\treturn ret;\n}\n\nEigen::Vector3f roundVector(const Eigen::Vector3f& vec)\n{\n\tEigen::Vector3f ret = vec;\n\tret[0] = round(ret[0]);\n\tret[1] = round(ret[1]);\n\tret[2] = round(ret[2]);\n\treturn ret;\n}\n\nEigen::Vector2f roundVector(const Eigen::Vector2f& vec)\n{\n\tEigen::Vector2f ret = vec;\n\tret[0] = round(ret[0]);\n\tret[1] = round(ret[1]);\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#ifndef ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n#define ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n\n#include <type_traits>\n\n#include \"..\/..\/config.hpp\"\n#include \"..\/..\/detail\/various.hpp\"\n\n#include \"..\/..\/intrinsics.hpp\"\n#include \"..\/..\/functional.hpp\"\n\n#include \"..\/..\/warp\/warp_sort.hpp\"\n\nBEGIN_ROCPRIM_NAMESPACE\n\nnamespace detail\n{\n\ntemplate<\n class Key,\n unsigned int BlockSize,\n class Value\n>\nclass block_sort_bitonic\n{\n template<class KeyType, class ValueType>\n struct storage_type_\n {\n KeyType key[BlockSize];\n ValueType value[BlockSize];\n };\n\n template<class KeyType>\n struct storage_type_<KeyType, empty_type>\n {\n KeyType key[BlockSize];\n };\n\npublic:\n using storage_type = detail::raw_storage<storage_type_<Key, Value>>;\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n this->sort_impl<BlockSize>(\n ::rocprim::flat_block_thread_id(),\n storage, compare_function,\n thread_key\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n BinaryFunction compare_function)\n {\n ROCPRIM_SHARED_MEMORY storage_type storage;\n this->sort(thread_key, storage, compare_function);\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n this->sort_impl<BlockSize>(\n ::rocprim::flat_block_thread_id(),\n storage, compare_function,\n thread_key, thread_value\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n BinaryFunction compare_function)\n {\n ROCPRIM_SHARED_MEMORY storage_type storage;\n this->sort(thread_key, thread_value, storage, compare_function);\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n storage_type& storage,\n const unsigned int size,\n BinaryFunction compare_function)\n {\n this->sort_impl(\n ::rocprim::flat_block_thread_id(), size,\n storage, compare_function,\n thread_key\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n storage_type& storage,\n const unsigned int size,\n BinaryFunction compare_function)\n {\n this->sort_impl(\n ::rocprim::flat_block_thread_id(), size,\n storage, compare_function,\n thread_key, thread_value\n );\n }\n\nprivate:\n ROCPRIM_DEVICE inline\n void copy_to_shared(Key& k, const unsigned int flat_tid, storage_type& storage)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n storage_.key[flat_tid] = k;\n ::rocprim::syncthreads();\n }\n\n ROCPRIM_DEVICE inline\n void copy_to_shared(Key& k, Value& v, const unsigned int flat_tid, storage_type& storage)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n storage_.key[flat_tid] = k;\n storage_.value[flat_tid] = v;\n ::rocprim::syncthreads();\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void swap(Key& key,\n const unsigned int flat_tid,\n const unsigned int next_id,\n const bool dir,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n Key next_key = storage_.key[next_id];\n bool compare = compare_function(next_key, key);\n bool swap = compare ^ (next_id < flat_tid) ^ dir;\n if(swap)\n {\n key = next_key;\n }\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void swap(Key& key,\n Value& value,\n const unsigned int flat_tid,\n const unsigned int next_id,\n const bool dir,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n Key next_key = storage_.key[next_id];\n Value next_value = storage_.value[next_id];\n bool compare = compare_function(next_key, key);\n bool swap = compare ^ (next_id < flat_tid) ^ dir;\n if(swap)\n {\n key = next_key;\n value = next_value;\n }\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<(Size <= ::rocprim::warp_size())>::type\n sort_power_two(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n (void) flat_tid;\n (void) storage;\n\n ::rocprim::warp_sort<Key, Size, Value> wsort;\n wsort.sort(kv..., compare_function);\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<(Size > ::rocprim::warp_size())>::type\n sort_power_two(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n const auto warp_id_is_even = ((flat_tid \/ ::rocprim::warp_size()) % 2) == 0;\n ::rocprim::warp_sort<Key, ::rocprim::warp_size(), Value> wsort;\n auto compare_function2 =\n [compare_function, warp_id_is_even](const Key& a, const Key& b) -> bool\n {\n auto r = compare_function(a, b);\n if(warp_id_is_even)\n return r;\n return !r;\n };\n wsort.sort(kv..., compare_function2);\n \n #pragma unroll\n for(unsigned int length = ::rocprim::warp_size(); length < Size; length *= 2)\n {\n bool dir = (flat_tid & (length * 2)) != 0;\n for(unsigned int k = length; k > 0; k \/= 2)\n {\n copy_to_shared(kv..., flat_tid, storage);\n swap(kv..., flat_tid, flat_tid ^ k, dir, storage, compare_function);\n ::rocprim::syncthreads();\n }\n }\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<detail::is_power_of_two(Size)>::type\n sort_impl(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n sort_power_two<Size, BinaryFunction>(flat_tid, storage, compare_function, kv...);\n }\n\n \/\/ In case BlockSize is not a power-of-two, the slower odd-even mergesort function is used\n \/\/ instead of the bitonic sort function\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<!detail::is_power_of_two(Size)>::type\n sort_impl(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n copy_to_shared(kv..., flat_tid, storage);\n\n bool is_even = (flat_tid % 2) == 0;\n unsigned int odd_id = (is_even) ? std::max(flat_tid, (unsigned int) 1) - 1 : std::min(flat_tid + 1, Size - 1);\n unsigned int even_id = (is_even) ? std::min(flat_tid + 1, Size - 1) : std::max(flat_tid, (unsigned int) 1) - 1;\n\n #pragma unroll\n for(unsigned int length = 0; length < Size; length++)\n {\n unsigned int next_id = (length % 2) == 0 ? even_id : odd_id;\n swap(kv..., flat_tid, next_id, 0, storage, compare_function);\n ::rocprim::syncthreads();\n copy_to_shared(kv..., flat_tid, storage);\n }\n }\n\n template<\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n void sort_impl(const unsigned int flat_tid,\n const unsigned int size,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n if(size > BlockSize)\n {\n return;\n }\n\n copy_to_shared(kv..., flat_tid, storage);\n\n bool is_even = (flat_tid % 2 == 0);\n unsigned int odd_id = (is_even) ? std::max(flat_tid, (unsigned int) 1) - 1 : std::min(flat_tid + 1, size - 1);\n unsigned int even_id = (is_even) ? std::min(flat_tid + 1, size - 1) : std::max(flat_tid, (unsigned int) 1) - 1;\n\n for(unsigned int length = 0; length < size; length++)\n {\n unsigned int next_id = (length % 2 == 0) ? even_id : odd_id;\n swap(kv..., flat_tid, next_id, 0, storage, compare_function);\n ::rocprim::syncthreads();\n copy_to_shared(kv..., flat_tid, storage);\n }\n }\n};\n\n} \/\/ end namespace detail\n\nEND_ROCPRIM_NAMESPACE\n\n#endif \/\/ ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n<commit_msg>Fix block sort with size specified for comparisons with lookup tables<commit_after>\/\/ Copyright (c) 2017 Advanced Micro Devices, Inc. All rights reserved.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\n#ifndef ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n#define ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n\n#include <type_traits>\n\n#include \"..\/..\/config.hpp\"\n#include \"..\/..\/detail\/various.hpp\"\n\n#include \"..\/..\/intrinsics.hpp\"\n#include \"..\/..\/functional.hpp\"\n\n#include \"..\/..\/warp\/warp_sort.hpp\"\n\nBEGIN_ROCPRIM_NAMESPACE\n\nnamespace detail\n{\n\ntemplate<\n class Key,\n unsigned int BlockSize,\n class Value\n>\nclass block_sort_bitonic\n{\n template<class KeyType, class ValueType>\n struct storage_type_\n {\n KeyType key[BlockSize];\n ValueType value[BlockSize];\n };\n\n template<class KeyType>\n struct storage_type_<KeyType, empty_type>\n {\n KeyType key[BlockSize];\n };\n\npublic:\n using storage_type = detail::raw_storage<storage_type_<Key, Value>>;\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n this->sort_impl<BlockSize>(\n ::rocprim::flat_block_thread_id(),\n storage, compare_function,\n thread_key\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n BinaryFunction compare_function)\n {\n ROCPRIM_SHARED_MEMORY storage_type storage;\n this->sort(thread_key, storage, compare_function);\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n this->sort_impl<BlockSize>(\n ::rocprim::flat_block_thread_id(),\n storage, compare_function,\n thread_key, thread_value\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n BinaryFunction compare_function)\n {\n ROCPRIM_SHARED_MEMORY storage_type storage;\n this->sort(thread_key, thread_value, storage, compare_function);\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n storage_type& storage,\n const unsigned int size,\n BinaryFunction compare_function)\n {\n this->sort_impl(\n ::rocprim::flat_block_thread_id(), size,\n storage, compare_function,\n thread_key\n );\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void sort(Key& thread_key,\n Value& thread_value,\n storage_type& storage,\n const unsigned int size,\n BinaryFunction compare_function)\n {\n this->sort_impl(\n ::rocprim::flat_block_thread_id(), size,\n storage, compare_function,\n thread_key, thread_value\n );\n }\n\nprivate:\n ROCPRIM_DEVICE inline\n void copy_to_shared(Key& k, const unsigned int flat_tid, storage_type& storage)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n storage_.key[flat_tid] = k;\n ::rocprim::syncthreads();\n }\n\n ROCPRIM_DEVICE inline\n void copy_to_shared(Key& k, Value& v, const unsigned int flat_tid, storage_type& storage)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n storage_.key[flat_tid] = k;\n storage_.value[flat_tid] = v;\n ::rocprim::syncthreads();\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void swap(Key& key,\n const unsigned int flat_tid,\n const unsigned int next_id,\n const bool dir,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n Key next_key = storage_.key[next_id];\n bool compare = compare_function(next_key, key);\n bool swap = compare ^ (next_id < flat_tid) ^ dir;\n if(swap)\n {\n key = next_key;\n }\n }\n\n template<class BinaryFunction>\n ROCPRIM_DEVICE inline\n void swap(Key& key,\n Value& value,\n const unsigned int flat_tid,\n const unsigned int next_id,\n const bool dir,\n storage_type& storage,\n BinaryFunction compare_function)\n {\n storage_type_<Key, Value>& storage_ = storage.get();\n Key next_key = storage_.key[next_id];\n Value next_value = storage_.value[next_id];\n bool compare = compare_function(next_key, key);\n bool swap = compare ^ (next_id < flat_tid) ^ dir;\n if(swap)\n {\n key = next_key;\n value = next_value;\n }\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<(Size <= ::rocprim::warp_size())>::type\n sort_power_two(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n (void) flat_tid;\n (void) storage;\n\n ::rocprim::warp_sort<Key, Size, Value> wsort;\n wsort.sort(kv..., compare_function);\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<(Size > ::rocprim::warp_size())>::type\n sort_power_two(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n const auto warp_id_is_even = ((flat_tid \/ ::rocprim::warp_size()) % 2) == 0;\n ::rocprim::warp_sort<Key, ::rocprim::warp_size(), Value> wsort;\n auto compare_function2 =\n [compare_function, warp_id_is_even](const Key& a, const Key& b) -> bool\n {\n auto r = compare_function(a, b);\n if(warp_id_is_even)\n return r;\n return !r;\n };\n wsort.sort(kv..., compare_function2);\n \n #pragma unroll\n for(unsigned int length = ::rocprim::warp_size(); length < Size; length *= 2)\n {\n bool dir = (flat_tid & (length * 2)) != 0;\n for(unsigned int k = length; k > 0; k \/= 2)\n {\n copy_to_shared(kv..., flat_tid, storage);\n swap(kv..., flat_tid, flat_tid ^ k, dir, storage, compare_function);\n ::rocprim::syncthreads();\n }\n }\n }\n\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<detail::is_power_of_two(Size)>::type\n sort_impl(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n sort_power_two<Size, BinaryFunction>(flat_tid, storage, compare_function, kv...);\n }\n\n \/\/ In case BlockSize is not a power-of-two, the slower odd-even mergesort function is used\n \/\/ instead of the bitonic sort function\n template<\n unsigned int Size,\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n typename std::enable_if<!detail::is_power_of_two(Size)>::type\n sort_impl(const unsigned int flat_tid,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n copy_to_shared(kv..., flat_tid, storage);\n\n bool is_even = (flat_tid % 2) == 0;\n unsigned int odd_id = (is_even) ? ::rocprim::max(flat_tid, 1u) - 1 : ::rocprim::min(flat_tid + 1, Size - 1);\n unsigned int even_id = (is_even) ? ::rocprim::min(flat_tid + 1, Size - 1) : ::rocprim::max(flat_tid, 1u) - 1;\n\n #pragma unroll\n for(unsigned int length = 0; length < Size; length++)\n {\n unsigned int next_id = (length % 2) == 0 ? even_id : odd_id;\n swap(kv..., flat_tid, next_id, 0, storage, compare_function);\n ::rocprim::syncthreads();\n copy_to_shared(kv..., flat_tid, storage);\n }\n }\n\n template<\n class BinaryFunction,\n class... KeyValue\n >\n ROCPRIM_DEVICE inline\n void sort_impl(const unsigned int flat_tid,\n const unsigned int size,\n storage_type& storage,\n BinaryFunction compare_function,\n KeyValue&... kv)\n {\n static constexpr unsigned int PairSize = sizeof...(KeyValue);\n static_assert(\n PairSize < 3,\n \"KeyValue parameter pack can 1 or 2 elements (key, or key and value)\"\n );\n\n if(size > BlockSize)\n {\n return;\n }\n\n copy_to_shared(kv..., flat_tid, storage);\n\n bool is_even = (flat_tid % 2 == 0);\n unsigned int odd_id = (is_even) ? ::rocprim::max(flat_tid, 1u) - 1 : ::rocprim::min(flat_tid + 1, size - 1);\n unsigned int even_id = (is_even) ? ::rocprim::min(flat_tid + 1, size - 1) : ::rocprim::max(flat_tid, 1u) - 1;\n\n for(unsigned int length = 0; length < size; length++)\n {\n unsigned int next_id = (length % 2 == 0) ? even_id : odd_id;\n \/\/ Use only \"valid\" keys to ensure that compare_function will not use garbage keys\n \/\/ for example, as indices of an array (a lookup table)\n if(flat_tid < size)\n {\n swap(kv..., flat_tid, next_id, 0, storage, compare_function);\n }\n ::rocprim::syncthreads();\n copy_to_shared(kv..., flat_tid, storage);\n }\n }\n};\n\n} \/\/ end namespace detail\n\nEND_ROCPRIM_NAMESPACE\n\n#endif \/\/ ROCPRIM_BLOCK_DETAIL_BLOCK_SORT_SHARED_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Navigates the browser to server and client redirect pages and makes sure\n\/\/ that the correct redirects are reflected in the history database. Errors\n\/\/ here might indicate that WebKit changed the calls our glue layer gets in\n\/\/ the case of redirects. It may also mean problems with the history system.\n\n#include \"base\/file_util.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/string16.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/window_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/test\/test_server.h\"\n#include \"views\/event.h\"\n\nnamespace {\n\nclass RedirectTest : public UITest {\n public:\n RedirectTest()\n : test_server_(net::TestServer::TYPE_HTTP,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\"))) {\n }\n\n protected:\n net::TestServer test_server_;\n};\n\n\/\/ Tests a single server redirect\nTEST_F(RedirectTest, Server) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL first_url = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec());\n\n NavigateToURL(first_url);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n}\n\n\/\/ Tests a single client redirect.\n\/\/ Flaky: see crbug.com\/55380\nTEST_F(RedirectTest, FLAKY_Client) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + final_url.spec());\n\n \/\/ The client redirect appears as two page visits in the browser.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n\n \/\/ The address bar should display the final URL.\n GURL tab_url;\n EXPECT_TRUE(tab_proxy->GetCurrentURL(&tab_url));\n EXPECT_TRUE(final_url == tab_url);\n\n \/\/ Navigate one more time.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n \/\/ The address bar should still display the final URL.\n EXPECT_TRUE(tab_proxy->GetCurrentURL(&tab_url));\n EXPECT_TRUE(final_url == tab_url);\n}\n\nTEST_F(RedirectTest, ClientEmptyReferer) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"file_client_redirect.html\");\n GURL first_url = net::FilePathToFileURL(test_file);\n\n \/\/ The client redirect appears as two page visits in the browser.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n std::vector<GURL> redirects;\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n}\n\n\/\/ Tests to make sure a location change when a pending redirect exists isn't\n\/\/ flagged as a redirect.\n#if defined(OS_MACOSX)\n\/\/ SimulateOSClick is broken on the Mac: http:\/\/crbug.com\/45162\n#define MAYBE_ClientCancelled DISABLED_ClientCancelled\n#elif defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/53091\n#define MAYBE_ClientCancelled FAILS_ClientCancelled\n#else\n#define MAYBE_ClientCancelled ClientCancelled\n#endif\n\nTEST_F(RedirectTest, MAYBE_ClientCancelled) {\n FilePath first_path(test_data_directory_);\n first_path = first_path.AppendASCII(\"cancelled_redirect_test.html\");\n ASSERT_TRUE(file_util::AbsolutePath(&first_path));\n GURL first_url = net::FilePathToFileURL(first_path);\n\n NavigateToURLBlockUntilNavigationsComplete(first_url, 1);\n\n scoped_refptr<BrowserProxy> browser = automation()->GetBrowserWindow(0);\n ASSERT_TRUE(browser.get());\n scoped_refptr<WindowProxy> window = browser->GetWindow();\n ASSERT_TRUE(window.get());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n int64 last_nav_time = 0;\n EXPECT_TRUE(tab_proxy->GetLastNavigationTime(&last_nav_time));\n \/\/ Simulate a click to force to make a user-initiated location change;\n \/\/ otherwise, a non user-initiated in-page location change will be treated\n \/\/ as client redirect and the redirect will be recoreded, which can cause\n \/\/ this test failed.\n gfx::Rect tab_view_bounds;\n ASSERT_TRUE(browser->BringToFront());\n ASSERT_TRUE(window->GetViewBounds(VIEW_ID_TAB_CONTAINER, &tab_view_bounds,\n true));\n ASSERT_TRUE(\n window->SimulateOSClick(tab_view_bounds.CenterPoint(),\n views::Event::EF_LEFT_BUTTON_DOWN));\n EXPECT_TRUE(tab_proxy->WaitForNavigation(last_nav_time));\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n \/\/ There should be no redirects from first_url, because the anchor location\n \/\/ change that occurs should not be flagged as a redirect and the meta-refresh\n \/\/ won't have fired yet.\n ASSERT_EQ(0U, redirects.size());\n GURL current_url;\n ASSERT_TRUE(tab_proxy->GetCurrentURL(¤t_url));\n\n \/\/ Need to test final path and ref separately since constructing a file url\n \/\/ containing an anchor using FilePathToFileURL will escape the anchor as\n \/\/ %23, but in current_url the anchor will be '#'.\n std::string final_ref = \"myanchor\";\n FilePath current_path;\n ASSERT_TRUE(net::FileURLToFilePath(current_url, ¤t_path));\n ASSERT_TRUE(file_util::AbsolutePath(¤t_path));\n \/\/ Path should remain unchanged.\n EXPECT_EQ(StringToLowerASCII(first_path.value()),\n StringToLowerASCII(current_path.value()));\n EXPECT_EQ(final_ref, current_url.ref());\n}\n\n\/\/ Tests a client->server->server redirect\nTEST_F(RedirectTest, ClientServerServer) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL next_to_last = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec());\n GURL second_url = test_server_.GetURL(\n \"server-redirect?\" + next_to_last.spec());\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + second_url.spec());\n std::vector<GURL> redirects;\n\n \/\/ We need the sleep for the client redirects, because it appears as two\n \/\/ page visits in the browser.\n NavigateToURL(first_url);\n\n for (int i = 0; i < 10; ++i) {\n PlatformThread::Sleep(sleep_timeout_ms());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n if (!redirects.empty())\n break;\n }\n\n ASSERT_EQ(3U, redirects.size());\n EXPECT_EQ(second_url.spec(), redirects[0].spec());\n EXPECT_EQ(next_to_last.spec(), redirects[1].spec());\n EXPECT_EQ(final_url.spec(), redirects[2].spec());\n}\n\n\/\/ Tests that the \"#reference\" gets preserved across server redirects.\nTEST_F(RedirectTest, ServerReference) {\n ASSERT_TRUE(test_server_.Start());\n\n const std::string ref(\"reference\");\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL initial_url = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec() + \"#\" + ref);\n\n NavigateToURL(initial_url);\n\n GURL url = GetActiveTabURL();\n EXPECT_EQ(ref, url.ref());\n}\n\n\/\/ Test that redirect from http:\/\/ to file:\/\/ :\n\/\/ A) does not crash the browser or confuse the redirect chain, see bug 1080873\n\/\/ B) does not take place.\nTEST_F(RedirectTest, NoHttpToFile) {\n ASSERT_TRUE(test_server_.Start());\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"http_to_file.html\");\n GURL file_url = net::FilePathToFileURL(test_file);\n\n GURL initial_url = test_server_.GetURL(\n \"client-redirect?\" + file_url.spec());\n\n NavigateToURL(initial_url);\n \/\/ UITest will check for crashes. We make sure the title doesn't match the\n \/\/ title from the file, because the nav should not have taken place.\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n std::wstring actual_title;\n ASSERT_TRUE(tab_proxy->GetTabTitle(&actual_title));\n EXPECT_NE(\"File!\", WideToUTF8(actual_title));\n}\n\n\/\/ Ensures that non-user initiated location changes (within page) are\n\/\/ flagged as client redirects. See bug 1139823.\nTEST_F(RedirectTest, ClientFragments) {\n ASSERT_TRUE(test_server_.Start());\n\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"ref_redirect.html\");\n GURL first_url = net::FilePathToFileURL(test_file);\n std::vector<GURL> redirects;\n\n NavigateToURL(first_url);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n EXPECT_EQ(1U, redirects.size());\n EXPECT_EQ(first_url.spec() + \"#myanchor\", redirects[0].spec());\n}\n\n\/\/ TODO(timsteele): This is disabled because our current testserver can't\n\/\/ handle multiple requests in parallel, making it hang on the first request\n\/\/ to \/slow?60. It's unable to serve our second request for files\/title2.html\n\/\/ until \/slow? completes, which doesn't give the desired behavior. We could\n\/\/ alternatively load the second page from disk, but we would need to start\n\/\/ the browser for this testcase with --process-per-tab, and I don't think\n\/\/ we can do this at test-case-level granularity at the moment.\n\/\/ http:\/\/crbug.com\/45056\nTEST_F(RedirectTest,\n DISABLED_ClientCancelledByNewNavigationAfterProvisionalLoad) {\n \/\/ We want to initiate a second navigation after the provisional load for\n \/\/ the client redirect destination has started, but before this load is\n \/\/ committed. To achieve this, we tell the browser to load a slow page,\n \/\/ which causes it to start a provisional load, and while it is waiting\n \/\/ for the response (which means it hasn't committed the load for the client\n \/\/ redirect destination page yet), we issue a new navigation request.\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(\"files\/title2.html\");\n GURL slow = test_server_.GetURL(\"slow?60\");\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + slow.spec());\n std::vector<GURL> redirects;\n\n NavigateToURL(first_url);\n \/\/ We don't sleep here - the first navigation won't have been committed yet\n \/\/ because we told the server to wait a minute. This means the browser has\n \/\/ started it's provisional load for the client redirect destination page but\n \/\/ hasn't completed. Our time is now!\n NavigateToURL(final_url);\n\n std::wstring tab_title;\n std::wstring final_url_title = UTF8ToWide(\"Title Of Awesomeness\");\n \/\/ Wait till the final page has been loaded.\n for (int i = 0; i < 10; ++i) {\n PlatformThread::Sleep(sleep_timeout_ms());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetTabTitle(&tab_title));\n if (tab_title == final_url_title) {\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n break;\n }\n }\n\n \/\/ Check to make sure the navigation did in fact take place and we are\n \/\/ at the expected page.\n EXPECT_EQ(final_url_title, tab_title);\n\n bool final_navigation_not_redirect = true;\n \/\/ Check to make sure our request for files\/title2.html doesn't get flagged\n \/\/ as a client redirect from the first (\/client-redirect?) page.\n for (std::vector<GURL>::iterator it = redirects.begin();\n it != redirects.end(); ++it) {\n if (final_url.spec() == it->spec()) {\n final_navigation_not_redirect = false;\n break;\n }\n }\n EXPECT_TRUE(final_navigation_not_redirect);\n}\n\n} \/\/ namespace\n<commit_msg>Revert 59851 since we now avoid the problem with the testing webserver.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/ Navigates the browser to server and client redirect pages and makes sure\n\/\/ that the correct redirects are reflected in the history database. Errors\n\/\/ here might indicate that WebKit changed the calls our glue layer gets in\n\/\/ the case of redirects. It may also mean problems with the history system.\n\n#include \"base\/file_util.h\"\n#include \"base\/platform_thread.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_util.h\"\n#include \"base\/string16.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/view_ids.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/window_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/test\/test_server.h\"\n#include \"views\/event.h\"\n\nnamespace {\n\nclass RedirectTest : public UITest {\n public:\n RedirectTest()\n : test_server_(net::TestServer::TYPE_HTTP,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\"))) {\n }\n\n protected:\n net::TestServer test_server_;\n};\n\n\/\/ Tests a single server redirect\nTEST_F(RedirectTest, Server) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL first_url = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec());\n\n NavigateToURL(first_url);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n}\n\n\/\/ Tests a single client redirect.\nTEST_F(RedirectTest, Client) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + final_url.spec());\n\n \/\/ The client redirect appears as two page visits in the browser.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n\n \/\/ The address bar should display the final URL.\n GURL tab_url;\n EXPECT_TRUE(tab_proxy->GetCurrentURL(&tab_url));\n EXPECT_TRUE(final_url == tab_url);\n\n \/\/ Navigate one more time.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n \/\/ The address bar should still display the final URL.\n EXPECT_TRUE(tab_proxy->GetCurrentURL(&tab_url));\n EXPECT_TRUE(final_url == tab_url);\n}\n\nTEST_F(RedirectTest, ClientEmptyReferer) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"file_client_redirect.html\");\n GURL first_url = net::FilePathToFileURL(test_file);\n\n \/\/ The client redirect appears as two page visits in the browser.\n NavigateToURLBlockUntilNavigationsComplete(first_url, 2);\n\n std::vector<GURL> redirects;\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n ASSERT_EQ(1U, redirects.size());\n EXPECT_EQ(final_url.spec(), redirects[0].spec());\n}\n\n\/\/ Tests to make sure a location change when a pending redirect exists isn't\n\/\/ flagged as a redirect.\n#if defined(OS_MACOSX)\n\/\/ SimulateOSClick is broken on the Mac: http:\/\/crbug.com\/45162\n#define MAYBE_ClientCancelled DISABLED_ClientCancelled\n#elif defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/53091\n#define MAYBE_ClientCancelled FAILS_ClientCancelled\n#else\n#define MAYBE_ClientCancelled ClientCancelled\n#endif\n\nTEST_F(RedirectTest, MAYBE_ClientCancelled) {\n FilePath first_path(test_data_directory_);\n first_path = first_path.AppendASCII(\"cancelled_redirect_test.html\");\n ASSERT_TRUE(file_util::AbsolutePath(&first_path));\n GURL first_url = net::FilePathToFileURL(first_path);\n\n NavigateToURLBlockUntilNavigationsComplete(first_url, 1);\n\n scoped_refptr<BrowserProxy> browser = automation()->GetBrowserWindow(0);\n ASSERT_TRUE(browser.get());\n scoped_refptr<WindowProxy> window = browser->GetWindow();\n ASSERT_TRUE(window.get());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n int64 last_nav_time = 0;\n EXPECT_TRUE(tab_proxy->GetLastNavigationTime(&last_nav_time));\n \/\/ Simulate a click to force to make a user-initiated location change;\n \/\/ otherwise, a non user-initiated in-page location change will be treated\n \/\/ as client redirect and the redirect will be recoreded, which can cause\n \/\/ this test failed.\n gfx::Rect tab_view_bounds;\n ASSERT_TRUE(browser->BringToFront());\n ASSERT_TRUE(window->GetViewBounds(VIEW_ID_TAB_CONTAINER, &tab_view_bounds,\n true));\n ASSERT_TRUE(\n window->SimulateOSClick(tab_view_bounds.CenterPoint(),\n views::Event::EF_LEFT_BUTTON_DOWN));\n EXPECT_TRUE(tab_proxy->WaitForNavigation(last_nav_time));\n\n std::vector<GURL> redirects;\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n\n \/\/ There should be no redirects from first_url, because the anchor location\n \/\/ change that occurs should not be flagged as a redirect and the meta-refresh\n \/\/ won't have fired yet.\n ASSERT_EQ(0U, redirects.size());\n GURL current_url;\n ASSERT_TRUE(tab_proxy->GetCurrentURL(¤t_url));\n\n \/\/ Need to test final path and ref separately since constructing a file url\n \/\/ containing an anchor using FilePathToFileURL will escape the anchor as\n \/\/ %23, but in current_url the anchor will be '#'.\n std::string final_ref = \"myanchor\";\n FilePath current_path;\n ASSERT_TRUE(net::FileURLToFilePath(current_url, ¤t_path));\n ASSERT_TRUE(file_util::AbsolutePath(¤t_path));\n \/\/ Path should remain unchanged.\n EXPECT_EQ(StringToLowerASCII(first_path.value()),\n StringToLowerASCII(current_path.value()));\n EXPECT_EQ(final_ref, current_url.ref());\n}\n\n\/\/ Tests a client->server->server redirect\nTEST_F(RedirectTest, ClientServerServer) {\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL next_to_last = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec());\n GURL second_url = test_server_.GetURL(\n \"server-redirect?\" + next_to_last.spec());\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + second_url.spec());\n std::vector<GURL> redirects;\n\n \/\/ We need the sleep for the client redirects, because it appears as two\n \/\/ page visits in the browser.\n NavigateToURL(first_url);\n\n for (int i = 0; i < 10; ++i) {\n PlatformThread::Sleep(sleep_timeout_ms());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n if (!redirects.empty())\n break;\n }\n\n ASSERT_EQ(3U, redirects.size());\n EXPECT_EQ(second_url.spec(), redirects[0].spec());\n EXPECT_EQ(next_to_last.spec(), redirects[1].spec());\n EXPECT_EQ(final_url.spec(), redirects[2].spec());\n}\n\n\/\/ Tests that the \"#reference\" gets preserved across server redirects.\nTEST_F(RedirectTest, ServerReference) {\n ASSERT_TRUE(test_server_.Start());\n\n const std::string ref(\"reference\");\n\n GURL final_url = test_server_.GetURL(std::string());\n GURL initial_url = test_server_.GetURL(\n \"server-redirect?\" + final_url.spec() + \"#\" + ref);\n\n NavigateToURL(initial_url);\n\n GURL url = GetActiveTabURL();\n EXPECT_EQ(ref, url.ref());\n}\n\n\/\/ Test that redirect from http:\/\/ to file:\/\/ :\n\/\/ A) does not crash the browser or confuse the redirect chain, see bug 1080873\n\/\/ B) does not take place.\nTEST_F(RedirectTest, NoHttpToFile) {\n ASSERT_TRUE(test_server_.Start());\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"http_to_file.html\");\n GURL file_url = net::FilePathToFileURL(test_file);\n\n GURL initial_url = test_server_.GetURL(\n \"client-redirect?\" + file_url.spec());\n\n NavigateToURL(initial_url);\n \/\/ UITest will check for crashes. We make sure the title doesn't match the\n \/\/ title from the file, because the nav should not have taken place.\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n std::wstring actual_title;\n ASSERT_TRUE(tab_proxy->GetTabTitle(&actual_title));\n EXPECT_NE(\"File!\", WideToUTF8(actual_title));\n}\n\n\/\/ Ensures that non-user initiated location changes (within page) are\n\/\/ flagged as client redirects. See bug 1139823.\nTEST_F(RedirectTest, ClientFragments) {\n ASSERT_TRUE(test_server_.Start());\n\n FilePath test_file(test_data_directory_);\n test_file = test_file.AppendASCII(\"ref_redirect.html\");\n GURL first_url = net::FilePathToFileURL(test_file);\n std::vector<GURL> redirects;\n\n NavigateToURL(first_url);\n\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n EXPECT_EQ(1U, redirects.size());\n EXPECT_EQ(first_url.spec() + \"#myanchor\", redirects[0].spec());\n}\n\n\/\/ TODO(timsteele): This is disabled because our current testserver can't\n\/\/ handle multiple requests in parallel, making it hang on the first request\n\/\/ to \/slow?60. It's unable to serve our second request for files\/title2.html\n\/\/ until \/slow? completes, which doesn't give the desired behavior. We could\n\/\/ alternatively load the second page from disk, but we would need to start\n\/\/ the browser for this testcase with --process-per-tab, and I don't think\n\/\/ we can do this at test-case-level granularity at the moment.\n\/\/ http:\/\/crbug.com\/45056\nTEST_F(RedirectTest,\n DISABLED_ClientCancelledByNewNavigationAfterProvisionalLoad) {\n \/\/ We want to initiate a second navigation after the provisional load for\n \/\/ the client redirect destination has started, but before this load is\n \/\/ committed. To achieve this, we tell the browser to load a slow page,\n \/\/ which causes it to start a provisional load, and while it is waiting\n \/\/ for the response (which means it hasn't committed the load for the client\n \/\/ redirect destination page yet), we issue a new navigation request.\n ASSERT_TRUE(test_server_.Start());\n\n GURL final_url = test_server_.GetURL(\"files\/title2.html\");\n GURL slow = test_server_.GetURL(\"slow?60\");\n GURL first_url = test_server_.GetURL(\n \"client-redirect?\" + slow.spec());\n std::vector<GURL> redirects;\n\n NavigateToURL(first_url);\n \/\/ We don't sleep here - the first navigation won't have been committed yet\n \/\/ because we told the server to wait a minute. This means the browser has\n \/\/ started it's provisional load for the client redirect destination page but\n \/\/ hasn't completed. Our time is now!\n NavigateToURL(final_url);\n\n std::wstring tab_title;\n std::wstring final_url_title = UTF8ToWide(\"Title Of Awesomeness\");\n \/\/ Wait till the final page has been loaded.\n for (int i = 0; i < 10; ++i) {\n PlatformThread::Sleep(sleep_timeout_ms());\n scoped_refptr<TabProxy> tab_proxy(GetActiveTab());\n ASSERT_TRUE(tab_proxy.get());\n ASSERT_TRUE(tab_proxy->GetTabTitle(&tab_title));\n if (tab_title == final_url_title) {\n ASSERT_TRUE(tab_proxy->GetRedirectsFrom(first_url, &redirects));\n break;\n }\n }\n\n \/\/ Check to make sure the navigation did in fact take place and we are\n \/\/ at the expected page.\n EXPECT_EQ(final_url_title, tab_title);\n\n bool final_navigation_not_redirect = true;\n \/\/ Check to make sure our request for files\/title2.html doesn't get flagged\n \/\/ as a client redirect from the first (\/client-redirect?) page.\n for (std::vector<GURL>::iterator it = redirects.begin();\n it != redirects.end(); ++it) {\n if (final_url.spec() == it->spec()) {\n final_navigation_not_redirect = false;\n break;\n }\n }\n EXPECT_TRUE(final_navigation_not_redirect);\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/touch\/tabs\/touch_tab.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/themes\/theme_service.h\"\n#include \"grit\/app_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"grit\/theme_resources_standard.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/gfx\/canvas_skia.h\"\n#include \"ui\/gfx\/favicon_size.h\"\n#include \"ui\/gfx\/path.h\"\n#include \"ui\/gfx\/skbitmap_operations.h\"\n\nstatic const int kLeftPadding = 16;\nstatic const int kRightPadding = 15;\nstatic const int kDropShadowHeight = 2;\n\n\/\/ The size of the favicon touch area. This generally would be the same as\n\/\/ kFaviconSize in ui\/gfx\/favicon_size.h\nstatic const int kTouchTabIconSize = 32;\n\nTouchTab::TouchTabImage TouchTab::tab_alpha = {0};\nTouchTab::TouchTabImage TouchTab::tab_active = {0};\nTouchTab::TouchTabImage TouchTab::tab_inactive = {0};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, public:\n\nTouchTab::TouchTab(TabController* controller)\n : BaseTab(controller) {\n InitTabResources();\n}\n\nTouchTab::~TouchTab() {\n}\n\n\/\/ static\ngfx::Size TouchTab::GetMinimumUnselectedSize() {\n InitTabResources();\n\n gfx::Size minimum_size;\n minimum_size.set_width(kLeftPadding + kRightPadding);\n minimum_size.set_height(32);\n return minimum_size;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, protected:\nconst gfx::Rect& TouchTab::GetTitleBounds() const {\n return title_bounds_;\n}\n\nconst gfx::Rect& TouchTab::GetIconBounds() const {\n return favicon_bounds_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, views::View overrides:\n\n\/\/ We'll get selected via the mouse interactions with the TouchTabStrip. There\n\/\/ is no need to directly handle the mouse movements in the TouchTab.\n\nbool TouchTab::OnMousePressed(const views::MouseEvent& event) {\n return false;\n}\n\nbool TouchTab::OnMouseDragged(const views::MouseEvent& event) {\n return false;\n}\n\nvoid TouchTab::OnMouseReleased(const views::MouseEvent& event) {\n}\n\nvoid TouchTab::OnPaint(gfx::Canvas* canvas) {\n \/\/ Don't paint if we're narrower than we can render correctly. (This should\n \/\/ only happen during animations).\n if (width() < GetMinimumUnselectedSize().width() && !data().mini)\n return;\n\n PaintTabBackground(canvas);\n\n SkColor title_color = GetThemeProvider()->\n GetColor(IsSelected() ?\n ThemeService::COLOR_TAB_TEXT :\n ThemeService::COLOR_BACKGROUND_TAB_TEXT);\n\n PaintTitle(canvas, title_color);\n PaintIcon(canvas);\n}\n\nvoid TouchTab::Layout() {\n gfx::Rect local_bounds = GetContentsBounds();\n TouchTabImage* tab_image = &tab_active;\n TouchTabImage* alpha = &tab_alpha;\n int image_height = alpha->image_l->height();\n int x_base = tab_image->image_l->width();\n int y_base = height() - image_height;\n int center_width = width() - tab_image->l_width - tab_image->r_width;\n if (center_width < 0)\n center_width = 0;\n title_bounds_ = gfx::Rect(x_base, y_base, center_width, image_height);\n favicon_bounds_ = local_bounds;\n}\n\nbool TouchTab::HasHitTestMask() const {\n return true;\n}\n\nvoid TouchTab::GetHitTestMask(gfx::Path* path) const {\n DCHECK(path);\n\n SkScalar h = SkIntToScalar(height());\n SkScalar w = SkIntToScalar(width());\n\n path->moveTo(0, h);\n path->lineTo(0, 0);\n path->lineTo(w, 0);\n path->lineTo(w, h);\n path->lineTo(0, h);\n path->close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, private:\n\nvoid TouchTab::PaintTabBackground(gfx::Canvas* canvas) {\n if (IsSelected()) {\n PaintActiveTabBackground(canvas);\n }\n}\n\nvoid TouchTab::PaintActiveTabBackground(gfx::Canvas* canvas) {\n int offset = GetMirroredX() + background_offset_.x();\n ThemeProvider* tp = GetThemeProvider();\n if (!tp)\n NOTREACHED() << \"Unable to get theme provider\";\n\n SkBitmap* tab_bg = GetThemeProvider()->GetBitmapNamed(IDR_THEME_TOOLBAR);\n\n TouchTabImage* tab_image = &tab_active;\n TouchTabImage* alpha = &tab_alpha;\n\n \/\/ Draw left edge.\n int image_height = alpha->image_l->height();\n int y_base = height() - image_height;\n SkBitmap tab_l = SkBitmapOperations::CreateTiledBitmap(\n *tab_bg, offset, 0, tab_image->l_width, image_height);\n SkBitmap theme_l =\n SkBitmapOperations::CreateMaskedBitmap(tab_l, *alpha->image_l);\n canvas->DrawBitmapInt(theme_l, 0, y_base);\n\n \/\/ Draw right edge.\n SkBitmap tab_r = SkBitmapOperations::CreateTiledBitmap(*tab_bg,\n offset + width() - tab_image->r_width, 0,\n tab_image->r_width, image_height);\n SkBitmap theme_r =\n SkBitmapOperations::CreateMaskedBitmap(tab_r, *alpha->image_r);\n canvas->DrawBitmapInt(theme_r, width() - tab_image->r_width, y_base);\n\n \/\/ Draw center. Instead of masking out the top portion we simply skip over it\n \/\/ by incrementing by kDropShadowHeight, since it's a simple rectangle.\n canvas->TileImageInt(*tab_bg,\n offset + tab_image->l_width,\n kDropShadowHeight + tab_image->y_offset,\n tab_image->l_width,\n y_base + kDropShadowHeight + tab_image->y_offset,\n width() - tab_image->l_width - tab_image->r_width,\n height() - kDropShadowHeight - tab_image->y_offset);\n\n \/\/ Now draw the highlights\/shadows around the tab edge.\n canvas->DrawBitmapInt(*tab_image->image_l, 0, y_base);\n canvas->TileImageInt(*tab_image->image_c, tab_image->l_width, y_base,\n width() - tab_image->l_width - tab_image->r_width, image_height);\n canvas->DrawBitmapInt(*tab_image->image_r, width() - tab_image->r_width,\n y_base);\n}\n\nvoid TouchTab::PaintIcon(gfx::Canvas* canvas) {\n \/\/ TODO(wyck): use thumbnailer to get better page images\n int x = favicon_bounds_.x();\n int y = favicon_bounds_.y();\n\n TouchTabImage* tab_image = &tab_active;\n int x_base = tab_image->image_l->width();\n\n x += x_base;\n\n if (base::i18n::IsRTL()) {\n x = width() - x -\n (data().favicon.isNull() ? kFaviconSize : data().favicon.width());\n }\n\n int favicon_x = x;\n if (!data().favicon.isNull() && data().favicon.width() != kFaviconSize)\n favicon_x += (data().favicon.width() - kFaviconSize) \/ 2;\n\n if (data().network_state != TabRendererData::NETWORK_STATE_NONE) {\n ThemeProvider* tp = GetThemeProvider();\n SkBitmap frames(*tp->GetBitmapNamed(\n (data().network_state == TabRendererData::NETWORK_STATE_WAITING) ?\n IDR_THROBBER_WAITING : IDR_THROBBER));\n int image_size = frames.height();\n int image_offset = loading_animation_frame() * image_size;\n canvas->DrawBitmapInt(frames, image_offset, 0, image_size, image_size, x, y,\n kTouchTabIconSize, kTouchTabIconSize, false);\n } else {\n canvas->Save();\n canvas->ClipRectInt(0, 0, width(), height());\n if (should_display_crashed_favicon()) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n SkBitmap crashed_favicon(*rb.GetBitmapNamed(IDR_SAD_FAVICON));\n canvas->DrawBitmapInt(crashed_favicon, 0, 0, crashed_favicon.width(),\n crashed_favicon.height(), x, y + favicon_hiding_offset(),\n kTouchTabIconSize, kTouchTabIconSize, true);\n } else {\n if (!data().favicon.isNull()) {\n\n if ((data().favicon.width() == kTouchTabIconSize) &&\n (data().favicon.height() == kTouchTabIconSize)) {\n canvas->DrawBitmapInt(data().favicon, 0, 0,\n data().favicon.width(), data().favicon.height(),\n x, y + favicon_hiding_offset(),\n kTouchTabIconSize, kTouchTabIconSize, true);\n } else {\n \/\/ Draw a background around target touch area in case the favicon\n \/\/ is smaller than touch area (e.g www.google.com is 16x16 now)\n canvas->DrawRectInt(\n GetThemeProvider()->GetColor(\n ThemeService::COLOR_BUTTON_BACKGROUND),\n x, y, kTouchTabIconSize, kTouchTabIconSize);\n\n \/\/ We center the image\n \/\/ TODO(saintlou): later request larger image from HistoryService\n canvas->DrawBitmapInt(data().favicon, 0, 0, data().favicon.width(),\n data().favicon.height(),\n x + ((kTouchTabIconSize - data().favicon.width()) \/ 2),\n y + ((kTouchTabIconSize - data().favicon.height()) \/ 2) +\n favicon_hiding_offset(),\n data().favicon.width(), data().favicon.height(), true);\n }\n }\n }\n canvas->Restore();\n }\n}\n\n\/\/ static\nvoid TouchTab::InitTabResources() {\n static bool initialized = false;\n if (initialized)\n return;\n\n initialized = true;\n\n \/\/ Load the tab images once now, and maybe again later if the theme changes.\n LoadTabImages();\n}\n\n\n\/\/ static\nvoid TouchTab::LoadTabImages() {\n \/\/ We're not letting people override tab images just yet.\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n\n tab_alpha.image_l = rb.GetBitmapNamed(IDR_TAB_ALPHA_LEFT);\n tab_alpha.image_r = rb.GetBitmapNamed(IDR_TAB_ALPHA_RIGHT);\n\n tab_active.image_l = rb.GetBitmapNamed(IDR_TAB_ACTIVE_LEFT);\n tab_active.image_c = rb.GetBitmapNamed(IDR_TAB_ACTIVE_CENTER);\n tab_active.image_r = rb.GetBitmapNamed(IDR_TAB_ACTIVE_RIGHT);\n tab_active.l_width = tab_active.image_l->width();\n tab_active.r_width = tab_active.image_r->width();\n\n tab_inactive.image_l = rb.GetBitmapNamed(IDR_TAB_INACTIVE_LEFT);\n tab_inactive.image_c = rb.GetBitmapNamed(IDR_TAB_INACTIVE_CENTER);\n tab_inactive.image_r = rb.GetBitmapNamed(IDR_TAB_INACTIVE_RIGHT);\n tab_inactive.l_width = tab_inactive.image_l->width();\n tab_inactive.r_width = tab_inactive.image_r->width();\n}\n<commit_msg>Fix touch compile after r86955.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/touch\/tabs\/touch_tab.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/themes\/theme_service.h\"\n#include \"grit\/app_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"grit\/theme_resources_standard.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/gfx\/canvas_skia.h\"\n#include \"ui\/gfx\/favicon_size.h\"\n#include \"ui\/gfx\/path.h\"\n#include \"ui\/gfx\/skbitmap_operations.h\"\n\nstatic const int kLeftPadding = 16;\nstatic const int kRightPadding = 15;\nstatic const int kDropShadowHeight = 2;\n\n\/\/ The size of the favicon touch area. This generally would be the same as\n\/\/ kFaviconSize in ui\/gfx\/favicon_size.h\nstatic const int kTouchTabIconSize = 32;\n\nTouchTab::TouchTabImage TouchTab::tab_alpha = {0};\nTouchTab::TouchTabImage TouchTab::tab_active = {0};\nTouchTab::TouchTabImage TouchTab::tab_inactive = {0};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, public:\n\nTouchTab::TouchTab(TabController* controller)\n : BaseTab(controller) {\n InitTabResources();\n}\n\nTouchTab::~TouchTab() {\n}\n\n\/\/ static\ngfx::Size TouchTab::GetMinimumUnselectedSize() {\n InitTabResources();\n\n gfx::Size minimum_size;\n minimum_size.set_width(kLeftPadding + kRightPadding);\n minimum_size.set_height(32);\n return minimum_size;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, protected:\nconst gfx::Rect& TouchTab::GetTitleBounds() const {\n return title_bounds_;\n}\n\nconst gfx::Rect& TouchTab::GetIconBounds() const {\n return favicon_bounds_;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, views::View overrides:\n\n\/\/ We'll get selected via the mouse interactions with the TouchTabStrip. There\n\/\/ is no need to directly handle the mouse movements in the TouchTab.\n\nbool TouchTab::OnMousePressed(const views::MouseEvent& event) {\n return false;\n}\n\nbool TouchTab::OnMouseDragged(const views::MouseEvent& event) {\n return false;\n}\n\nvoid TouchTab::OnMouseReleased(const views::MouseEvent& event) {\n}\n\nvoid TouchTab::OnPaint(gfx::Canvas* canvas) {\n \/\/ Don't paint if we're narrower than we can render correctly. (This should\n \/\/ only happen during animations).\n if (width() < GetMinimumUnselectedSize().width() && !data().mini)\n return;\n\n PaintTabBackground(canvas);\n\n SkColor title_color = GetThemeProvider()->\n GetColor(IsSelected() ?\n ThemeService::COLOR_TAB_TEXT :\n ThemeService::COLOR_BACKGROUND_TAB_TEXT);\n\n PaintTitle(canvas, title_color);\n PaintIcon(canvas);\n}\n\nvoid TouchTab::Layout() {\n gfx::Rect local_bounds = GetContentsBounds();\n TouchTabImage* tab_image = &tab_active;\n TouchTabImage* alpha = &tab_alpha;\n int image_height = alpha->image_l->height();\n int x_base = tab_image->image_l->width();\n int y_base = height() - image_height;\n int center_width = width() - tab_image->l_width - tab_image->r_width;\n if (center_width < 0)\n center_width = 0;\n title_bounds_ = gfx::Rect(x_base, y_base, center_width, image_height);\n favicon_bounds_ = local_bounds;\n}\n\nbool TouchTab::HasHitTestMask() const {\n return true;\n}\n\nvoid TouchTab::GetHitTestMask(gfx::Path* path) const {\n DCHECK(path);\n\n SkScalar h = SkIntToScalar(height());\n SkScalar w = SkIntToScalar(width());\n\n path->moveTo(0, h);\n path->lineTo(0, 0);\n path->lineTo(w, 0);\n path->lineTo(w, h);\n path->lineTo(0, h);\n path->close();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ TouchTab, private:\n\nvoid TouchTab::PaintTabBackground(gfx::Canvas* canvas) {\n if (IsSelected()) {\n PaintActiveTabBackground(canvas);\n }\n}\n\nvoid TouchTab::PaintActiveTabBackground(gfx::Canvas* canvas) {\n int offset = GetMirroredX() + background_offset_.x();\n ui::ThemeProvider* tp = GetThemeProvider();\n if (!tp)\n NOTREACHED() << \"Unable to get theme provider\";\n\n SkBitmap* tab_bg = GetThemeProvider()->GetBitmapNamed(IDR_THEME_TOOLBAR);\n\n TouchTabImage* tab_image = &tab_active;\n TouchTabImage* alpha = &tab_alpha;\n\n \/\/ Draw left edge.\n int image_height = alpha->image_l->height();\n int y_base = height() - image_height;\n SkBitmap tab_l = SkBitmapOperations::CreateTiledBitmap(\n *tab_bg, offset, 0, tab_image->l_width, image_height);\n SkBitmap theme_l =\n SkBitmapOperations::CreateMaskedBitmap(tab_l, *alpha->image_l);\n canvas->DrawBitmapInt(theme_l, 0, y_base);\n\n \/\/ Draw right edge.\n SkBitmap tab_r = SkBitmapOperations::CreateTiledBitmap(*tab_bg,\n offset + width() - tab_image->r_width, 0,\n tab_image->r_width, image_height);\n SkBitmap theme_r =\n SkBitmapOperations::CreateMaskedBitmap(tab_r, *alpha->image_r);\n canvas->DrawBitmapInt(theme_r, width() - tab_image->r_width, y_base);\n\n \/\/ Draw center. Instead of masking out the top portion we simply skip over it\n \/\/ by incrementing by kDropShadowHeight, since it's a simple rectangle.\n canvas->TileImageInt(*tab_bg,\n offset + tab_image->l_width,\n kDropShadowHeight + tab_image->y_offset,\n tab_image->l_width,\n y_base + kDropShadowHeight + tab_image->y_offset,\n width() - tab_image->l_width - tab_image->r_width,\n height() - kDropShadowHeight - tab_image->y_offset);\n\n \/\/ Now draw the highlights\/shadows around the tab edge.\n canvas->DrawBitmapInt(*tab_image->image_l, 0, y_base);\n canvas->TileImageInt(*tab_image->image_c, tab_image->l_width, y_base,\n width() - tab_image->l_width - tab_image->r_width, image_height);\n canvas->DrawBitmapInt(*tab_image->image_r, width() - tab_image->r_width,\n y_base);\n}\n\nvoid TouchTab::PaintIcon(gfx::Canvas* canvas) {\n \/\/ TODO(wyck): use thumbnailer to get better page images\n int x = favicon_bounds_.x();\n int y = favicon_bounds_.y();\n\n TouchTabImage* tab_image = &tab_active;\n int x_base = tab_image->image_l->width();\n\n x += x_base;\n\n if (base::i18n::IsRTL()) {\n x = width() - x -\n (data().favicon.isNull() ? kFaviconSize : data().favicon.width());\n }\n\n int favicon_x = x;\n if (!data().favicon.isNull() && data().favicon.width() != kFaviconSize)\n favicon_x += (data().favicon.width() - kFaviconSize) \/ 2;\n\n if (data().network_state != TabRendererData::NETWORK_STATE_NONE) {\n ui::ThemeProvider* tp = GetThemeProvider();\n SkBitmap frames(*tp->GetBitmapNamed(\n (data().network_state == TabRendererData::NETWORK_STATE_WAITING) ?\n IDR_THROBBER_WAITING : IDR_THROBBER));\n int image_size = frames.height();\n int image_offset = loading_animation_frame() * image_size;\n canvas->DrawBitmapInt(frames, image_offset, 0, image_size, image_size, x, y,\n kTouchTabIconSize, kTouchTabIconSize, false);\n } else {\n canvas->Save();\n canvas->ClipRectInt(0, 0, width(), height());\n if (should_display_crashed_favicon()) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n SkBitmap crashed_favicon(*rb.GetBitmapNamed(IDR_SAD_FAVICON));\n canvas->DrawBitmapInt(crashed_favicon, 0, 0, crashed_favicon.width(),\n crashed_favicon.height(), x, y + favicon_hiding_offset(),\n kTouchTabIconSize, kTouchTabIconSize, true);\n } else {\n if (!data().favicon.isNull()) {\n\n if ((data().favicon.width() == kTouchTabIconSize) &&\n (data().favicon.height() == kTouchTabIconSize)) {\n canvas->DrawBitmapInt(data().favicon, 0, 0,\n data().favicon.width(), data().favicon.height(),\n x, y + favicon_hiding_offset(),\n kTouchTabIconSize, kTouchTabIconSize, true);\n } else {\n \/\/ Draw a background around target touch area in case the favicon\n \/\/ is smaller than touch area (e.g www.google.com is 16x16 now)\n canvas->DrawRectInt(\n GetThemeProvider()->GetColor(\n ThemeService::COLOR_BUTTON_BACKGROUND),\n x, y, kTouchTabIconSize, kTouchTabIconSize);\n\n \/\/ We center the image\n \/\/ TODO(saintlou): later request larger image from HistoryService\n canvas->DrawBitmapInt(data().favicon, 0, 0, data().favicon.width(),\n data().favicon.height(),\n x + ((kTouchTabIconSize - data().favicon.width()) \/ 2),\n y + ((kTouchTabIconSize - data().favicon.height()) \/ 2) +\n favicon_hiding_offset(),\n data().favicon.width(), data().favicon.height(), true);\n }\n }\n }\n canvas->Restore();\n }\n}\n\n\/\/ static\nvoid TouchTab::InitTabResources() {\n static bool initialized = false;\n if (initialized)\n return;\n\n initialized = true;\n\n \/\/ Load the tab images once now, and maybe again later if the theme changes.\n LoadTabImages();\n}\n\n\n\/\/ static\nvoid TouchTab::LoadTabImages() {\n \/\/ We're not letting people override tab images just yet.\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n\n tab_alpha.image_l = rb.GetBitmapNamed(IDR_TAB_ALPHA_LEFT);\n tab_alpha.image_r = rb.GetBitmapNamed(IDR_TAB_ALPHA_RIGHT);\n\n tab_active.image_l = rb.GetBitmapNamed(IDR_TAB_ACTIVE_LEFT);\n tab_active.image_c = rb.GetBitmapNamed(IDR_TAB_ACTIVE_CENTER);\n tab_active.image_r = rb.GetBitmapNamed(IDR_TAB_ACTIVE_RIGHT);\n tab_active.l_width = tab_active.image_l->width();\n tab_active.r_width = tab_active.image_r->width();\n\n tab_inactive.image_l = rb.GetBitmapNamed(IDR_TAB_INACTIVE_LEFT);\n tab_inactive.image_c = rb.GetBitmapNamed(IDR_TAB_INACTIVE_CENTER);\n tab_inactive.image_r = rb.GetBitmapNamed(IDR_TAB_INACTIVE_RIGHT);\n tab_inactive.l_width = tab_inactive.image_l->width();\n tab_inactive.r_width = tab_inactive.image_r->width();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/views\/uninstall_view.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/process_util.h\"\n#include \"base\/run_loop.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/ui\/uninstall_browser_prompt.h\"\n#include \"chrome\/common\/chrome_result_codes.h\"\n#include \"chrome\/installer\/util\/browser_distribution.h\"\n#include \"chrome\/installer\/util\/shell_util.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/views\/controls\/button\/checkbox.h\"\n#include \"ui\/views\/controls\/combobox\/combobox.h\"\n#include \"ui\/views\/controls\/label.h\"\n#include \"ui\/views\/focus\/accelerator_handler.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n#include \"ui\/views\/layout\/layout_constants.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nUninstallView::UninstallView(int* user_selection,\n const base::Closure& quit_closure)\n : confirm_label_(NULL),\n delete_profile_(NULL),\n change_default_browser_(NULL),\n browsers_combo_(NULL),\n user_selection_(*user_selection),\n quit_closure_(quit_closure) {\n SetupControls();\n}\n\nUninstallView::~UninstallView() {\n \/\/ Exit the message loop we were started with so that uninstall can continue.\n quit_closure_.Run();\n}\n\nvoid UninstallView::SetupControls() {\n using views::ColumnSet;\n using views::GridLayout;\n\n GridLayout* layout = GridLayout::CreatePanel(this);\n SetLayoutManager(layout);\n\n \/\/ Message to confirm uninstallation.\n int column_set_id = 0;\n ColumnSet* column_set = layout->AddColumnSet(column_set_id);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n confirm_label_ = new views::Label(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_VERIFY));\n confirm_label_->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n layout->AddView(confirm_label_);\n\n layout->AddPaddingRow(0, views::kUnrelatedControlVerticalSpacing);\n\n \/\/ The \"delete profile\" check box.\n ++column_set_id;\n column_set = layout->AddColumnSet(column_set_id);\n column_set->AddPaddingColumn(0, views::kPanelHorizIndentation);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n delete_profile_ = new views::Checkbox(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_DELETE_PROFILE));\n layout->AddView(delete_profile_);\n\n \/\/ Set default browser combo box. If the default should not or cannot be\n \/\/ changed, widgets are not shown. We assume here that if Chrome cannot\n \/\/ be set programatically as default, neither can any other browser (for\n \/\/ instance because the OS doesn't permit that).\n BrowserDistribution* dist = BrowserDistribution::GetDistribution();\n if (dist->CanSetAsDefault() &&\n ShellIntegration::IsDefaultBrowser() &&\n (ShellIntegration::CanSetAsDefaultBrowser() !=\n ShellIntegration::SET_DEFAULT_INTERACTIVE)) {\n browsers_.reset(new BrowsersMap());\n ShellUtil::GetRegisteredBrowsers(dist, browsers_.get());\n if (!browsers_->empty()) {\n layout->AddPaddingRow(0, views::kRelatedControlVerticalSpacing);\n\n ++column_set_id;\n column_set = layout->AddColumnSet(column_set_id);\n column_set->AddPaddingColumn(0, views::kRelatedControlHorizontalSpacing);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, views::kRelatedControlHorizontalSpacing);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n change_default_browser_ = new views::Checkbox(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_SET_DEFAULT_BROWSER));\n change_default_browser_->set_listener(this);\n layout->AddView(change_default_browser_);\n browsers_combo_ = new views::Combobox(this);\n layout->AddView(browsers_combo_);\n browsers_combo_->SetEnabled(false);\n }\n }\n\n layout->AddPaddingRow(0, views::kRelatedControlSmallVerticalSpacing);\n}\n\nbool UninstallView::Accept() {\n user_selection_ = content::RESULT_CODE_NORMAL_EXIT;\n if (delete_profile_->checked())\n user_selection_ = chrome::RESULT_CODE_UNINSTALL_DELETE_PROFILE;\n if (change_default_browser_ && change_default_browser_->checked()) {\n BrowsersMap::const_iterator i = browsers_->begin();\n std::advance(i, browsers_combo_->selected_index());\n base::LaunchOptions options;\n options.start_hidden = true;\n base::LaunchProcess(i->second, options, NULL);\n }\n return true;\n}\n\nbool UninstallView::Cancel() {\n user_selection_ = chrome::RESULT_CODE_UNINSTALL_USER_CANCEL;\n return true;\n}\n\nstring16 UninstallView::GetDialogButtonLabel(ui::DialogButton button) const {\n \/\/ We only want to give custom name to OK button - 'Uninstall'. Cancel\n \/\/ button remains same.\n if (button == ui::DIALOG_BUTTON_OK)\n return l10n_util::GetStringUTF16(IDS_UNINSTALL_BUTTON_TEXT);\n return string16();\n}\n\nvoid UninstallView::ButtonPressed(views::Button* sender,\n const ui::Event& event) {\n if (change_default_browser_ == sender) {\n \/\/ Disable the browsers combobox if the user unchecks the checkbox.\n DCHECK(browsers_combo_);\n browsers_combo_->SetEnabled(change_default_browser_->checked());\n }\n}\n\nstring16 UninstallView::GetWindowTitle() const {\n return l10n_util::GetStringUTF16(IDS_UNINSTALL_CHROME);\n}\n\nviews::View* UninstallView::GetContentsView() {\n return this;\n}\n\nint UninstallView::GetItemCount() const {\n DCHECK(!browsers_->empty());\n return browsers_->size();\n}\n\nstring16 UninstallView::GetItemAt(int index) {\n DCHECK_LT(index, static_cast<int>(browsers_->size()));\n BrowsersMap::const_iterator i = browsers_->begin();\n std::advance(i, index);\n return i->first;\n}\n\nnamespace chrome {\n\nint ShowUninstallBrowserPrompt() {\n DCHECK_EQ(MessageLoop::TYPE_UI, MessageLoop::current()->type());\n int result = content::RESULT_CODE_NORMAL_EXIT;\n views::AcceleratorHandler accelerator_handler;\n base::RunLoop run_loop(&accelerator_handler);\n UninstallView* view = new UninstallView(&result, run_loop.QuitClosure());\n views::Widget::CreateWindow(view)->Show();\n run_loop.Run();\n return result;\n}\n\n} \/\/ namespace chrome\n<commit_msg>[win] fix checkbox padding in uninstall dialog<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/views\/uninstall_view.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/process_util.h\"\n#include \"base\/run_loop.h\"\n#include \"chrome\/browser\/shell_integration.h\"\n#include \"chrome\/browser\/ui\/uninstall_browser_prompt.h\"\n#include \"chrome\/common\/chrome_result_codes.h\"\n#include \"chrome\/installer\/util\/browser_distribution.h\"\n#include \"chrome\/installer\/util\/shell_util.h\"\n#include \"grit\/chromium_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/views\/controls\/button\/checkbox.h\"\n#include \"ui\/views\/controls\/combobox\/combobox.h\"\n#include \"ui\/views\/controls\/label.h\"\n#include \"ui\/views\/focus\/accelerator_handler.h\"\n#include \"ui\/views\/layout\/grid_layout.h\"\n#include \"ui\/views\/layout\/layout_constants.h\"\n#include \"ui\/views\/widget\/widget.h\"\n\nUninstallView::UninstallView(int* user_selection,\n const base::Closure& quit_closure)\n : confirm_label_(NULL),\n delete_profile_(NULL),\n change_default_browser_(NULL),\n browsers_combo_(NULL),\n user_selection_(*user_selection),\n quit_closure_(quit_closure) {\n SetupControls();\n}\n\nUninstallView::~UninstallView() {\n \/\/ Exit the message loop we were started with so that uninstall can continue.\n quit_closure_.Run();\n}\n\nvoid UninstallView::SetupControls() {\n using views::ColumnSet;\n using views::GridLayout;\n\n GridLayout* layout = GridLayout::CreatePanel(this);\n SetLayoutManager(layout);\n\n \/\/ Message to confirm uninstallation.\n int column_set_id = 0;\n ColumnSet* column_set = layout->AddColumnSet(column_set_id);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n confirm_label_ = new views::Label(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_VERIFY));\n confirm_label_->SetHorizontalAlignment(gfx::ALIGN_LEFT);\n layout->AddView(confirm_label_);\n\n layout->AddPaddingRow(0, views::kUnrelatedControlVerticalSpacing);\n\n \/\/ The \"delete profile\" check box.\n ++column_set_id;\n column_set = layout->AddColumnSet(column_set_id);\n column_set->AddPaddingColumn(0, views::kPanelHorizIndentation);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n delete_profile_ = new views::Checkbox(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_DELETE_PROFILE));\n layout->AddView(delete_profile_);\n\n \/\/ Set default browser combo box. If the default should not or cannot be\n \/\/ changed, widgets are not shown. We assume here that if Chrome cannot\n \/\/ be set programatically as default, neither can any other browser (for\n \/\/ instance because the OS doesn't permit that).\n BrowserDistribution* dist = BrowserDistribution::GetDistribution();\n if (dist->CanSetAsDefault() &&\n ShellIntegration::IsDefaultBrowser() &&\n (ShellIntegration::CanSetAsDefaultBrowser() !=\n ShellIntegration::SET_DEFAULT_INTERACTIVE)) {\n browsers_.reset(new BrowsersMap());\n ShellUtil::GetRegisteredBrowsers(dist, browsers_.get());\n if (!browsers_->empty()) {\n layout->AddPaddingRow(0, views::kRelatedControlVerticalSpacing);\n\n ++column_set_id;\n column_set = layout->AddColumnSet(column_set_id);\n column_set->AddPaddingColumn(0, views::kPanelHorizIndentation);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n column_set->AddPaddingColumn(0, views::kRelatedControlHorizontalSpacing);\n column_set->AddColumn(GridLayout::LEADING, GridLayout::CENTER, 0,\n GridLayout::USE_PREF, 0, 0);\n layout->StartRow(0, column_set_id);\n change_default_browser_ = new views::Checkbox(\n l10n_util::GetStringUTF16(IDS_UNINSTALL_SET_DEFAULT_BROWSER));\n change_default_browser_->set_listener(this);\n layout->AddView(change_default_browser_);\n browsers_combo_ = new views::Combobox(this);\n layout->AddView(browsers_combo_);\n browsers_combo_->SetEnabled(false);\n }\n }\n\n layout->AddPaddingRow(0, views::kRelatedControlSmallVerticalSpacing);\n}\n\nbool UninstallView::Accept() {\n user_selection_ = content::RESULT_CODE_NORMAL_EXIT;\n if (delete_profile_->checked())\n user_selection_ = chrome::RESULT_CODE_UNINSTALL_DELETE_PROFILE;\n if (change_default_browser_ && change_default_browser_->checked()) {\n BrowsersMap::const_iterator i = browsers_->begin();\n std::advance(i, browsers_combo_->selected_index());\n base::LaunchOptions options;\n options.start_hidden = true;\n base::LaunchProcess(i->second, options, NULL);\n }\n return true;\n}\n\nbool UninstallView::Cancel() {\n user_selection_ = chrome::RESULT_CODE_UNINSTALL_USER_CANCEL;\n return true;\n}\n\nstring16 UninstallView::GetDialogButtonLabel(ui::DialogButton button) const {\n \/\/ We only want to give custom name to OK button - 'Uninstall'. Cancel\n \/\/ button remains same.\n if (button == ui::DIALOG_BUTTON_OK)\n return l10n_util::GetStringUTF16(IDS_UNINSTALL_BUTTON_TEXT);\n return string16();\n}\n\nvoid UninstallView::ButtonPressed(views::Button* sender,\n const ui::Event& event) {\n if (change_default_browser_ == sender) {\n \/\/ Disable the browsers combobox if the user unchecks the checkbox.\n DCHECK(browsers_combo_);\n browsers_combo_->SetEnabled(change_default_browser_->checked());\n }\n}\n\nstring16 UninstallView::GetWindowTitle() const {\n return l10n_util::GetStringUTF16(IDS_UNINSTALL_CHROME);\n}\n\nviews::View* UninstallView::GetContentsView() {\n return this;\n}\n\nint UninstallView::GetItemCount() const {\n DCHECK(!browsers_->empty());\n return browsers_->size();\n}\n\nstring16 UninstallView::GetItemAt(int index) {\n DCHECK_LT(index, static_cast<int>(browsers_->size()));\n BrowsersMap::const_iterator i = browsers_->begin();\n std::advance(i, index);\n return i->first;\n}\n\nnamespace chrome {\n\nint ShowUninstallBrowserPrompt() {\n DCHECK_EQ(MessageLoop::TYPE_UI, MessageLoop::current()->type());\n int result = content::RESULT_CODE_NORMAL_EXIT;\n views::AcceleratorHandler accelerator_handler;\n base::RunLoop run_loop(&accelerator_handler);\n UninstallView* view = new UninstallView(&result, run_loop.QuitClosure());\n views::Widget::CreateWindow(view)->Show();\n run_loop.Run();\n return result;\n}\n\n} \/\/ namespace chrome\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/platform_thread.h\"\n#include \"base\/multiprocess_test.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nclass ProcessWatcherTest : public MultiProcessTest {\n};\n\nMULTIPROCESS_TEST_MAIN(Sleep1ChildProcess) {\n PlatformThread::Sleep(1000);\n exit(0);\n return 0;\n}\n\nMULTIPROCESS_TEST_MAIN(Sleep3ChildProcess) {\n PlatformThread::Sleep(3000);\n exit(0);\n return 0;\n}\n\nTEST_F(ProcessWatcherTest, DiesBeforeTermination) {\n base::ProcessHandle handle = this->SpawnChild(L\"Sleep1ChildProcess\");\n ASSERT_NE(static_cast<base::ProcessHandle>(NULL), handle);\n\n ProcessWatcher::EnsureProcessTerminated(handle);\n\n PlatformThread::Sleep(2500);\n \/\/ Normally we don't touch |handle| after calling EnsureProcessTerminated,\n \/\/ but we know the EnsureProcessTerminated process finishes in 2000 ms, so\n \/\/ it's safe to do so now. Same for Terminated test case below.\n EXPECT_FALSE(base::CrashAwareSleep(handle, 0));\n}\n\nTEST_F(ProcessWatcherTest, Terminated) {\n base::ProcessHandle handle = this->SpawnChild(L\"Sleep3ChildProcess\");\n ASSERT_NE(static_cast<base::ProcessHandle>(NULL), handle);\n\n ProcessWatcher::EnsureProcessTerminated(handle);\n\n PlatformThread::Sleep(2500);\n EXPECT_FALSE(base::CrashAwareSleep(handle, 0));\n}\n\nTEST_F(ProcessWatcherTest, NotTerminated) {\n base::ProcessHandle handle = this->SpawnChild(L\"Sleep3ChildProcess\");\n ASSERT_NE(static_cast<base::ProcessHandle>(NULL), handle);\n\n EXPECT_TRUE(base::CrashAwareSleep(handle, 2500));\n EXPECT_FALSE(base::CrashAwareSleep(handle, 1000));\n}\n\n} \/\/ namespace\n<commit_msg>Revert 21259 because it broke the unit tests on windows.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright (C) 2015 ScyllaDB\n *\n * Modified by ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"gc_clock.hh\"\n#include \"timestamp.hh\"\n#include \"schema.hh\"\n#include \"atomic_cell.hh\"\n#include \"tombstone.hh\"\n#include \"exceptions\/exceptions.hh\"\n#include \"cql3\/query_options.hh\"\n\n#include <unordered_map>\n\nnamespace cql3 {\n\n\/**\n * A simple container that simplify passing parameters for collections methods.\n *\/\nclass update_parameters final {\npublic:\n \/\/ Holder for data needed by CQL list updates which depend on current state of the list.\n struct prefetch_data {\n using key = std::pair<partition_key, clustering_key>;\n using key_view = std::pair<partition_key_view, clustering_key_view>;\n struct key_hashing {\n partition_key::hashing pk_hash;\n clustering_key::hashing ck_hash;\n\n key_hashing(const schema& s)\n : pk_hash(s)\n , ck_hash(s)\n { }\n\n size_t operator()(const key& k) const {\n return pk_hash(k.first) ^ ck_hash(k.second);\n }\n\n size_t operator()(const key_view& k) const {\n return pk_hash(k.first) ^ ck_hash(k.second);\n }\n };\n struct key_equality {\n partition_key::equality pk_eq;\n clustering_key::equality ck_eq;\n\n key_equality(const schema& s)\n : pk_eq(s)\n , ck_eq(s)\n { }\n\n bool operator()(const key& k1, const key& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n bool operator()(const key_view& k1, const key& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n bool operator()(const key& k1, const key_view& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n };\n struct cell {\n bytes key;\n bytes value;\n };\n using cell_list = std::vector<cell>;\n using row = std::unordered_map<column_id, cell_list>;\n public:\n std::unordered_map<key, row, key_hashing, key_equality> rows;\n schema_ptr schema;\n public:\n prefetch_data(schema_ptr schema);\n };\n \/\/ Note: value (mutation) only required to contain the rows we are interested in\nprivate:\n const gc_clock::duration _ttl;\n const prefetch_data _prefetched; \/\/ For operation that require a read-before-write\npublic:\n const api::timestamp_type _timestamp;\n const gc_clock::time_point _local_deletion_time;\n const schema_ptr _schema;\n const query_options& _options;\n\n update_parameters(const schema_ptr schema_, const query_options& options,\n api::timestamp_type timestamp, gc_clock::duration ttl, prefetch_data prefetched)\n : _ttl(ttl)\n , _prefetched(std::move(prefetched))\n , _timestamp(timestamp)\n , _local_deletion_time(gc_clock::now())\n , _schema(std::move(schema_))\n , _options(options)\n {\n \/\/ We use MIN_VALUE internally to mean the absence of of timestamp (in Selection, in sstable stats, ...), so exclude\n \/\/ it to avoid potential confusion.\n if (timestamp < api::min_timestamp || timestamp > api::max_timestamp) {\n throw exceptions::invalid_request_exception(format(\"Out of bound timestamp, must be in [{:d}, {:d}]\",\n api::min_timestamp, api::max_timestamp));\n }\n }\n\n atomic_cell make_dead_cell() const {\n return atomic_cell::make_dead(_timestamp, _local_deletion_time);\n }\n\n atomic_cell make_cell(const abstract_type& type, const fragmented_temporary_buffer::view& value, atomic_cell::collection_member cm = atomic_cell::collection_member::no) const {\n auto ttl = _ttl;\n\n if (ttl.count() <= 0) {\n ttl = _schema->default_time_to_live();\n }\n\n if (ttl.count() > 0) {\n return atomic_cell::make_live(type, _timestamp, value, _local_deletion_time + ttl, ttl, cm);\n } else {\n return atomic_cell::make_live(type, _timestamp, value, cm);\n }\n };\n\n atomic_cell make_cell(const abstract_type& type, bytes_view value, atomic_cell::collection_member cm = atomic_cell::collection_member::no) const {\n return make_cell(type, fragmented_temporary_buffer::view(value), cm);\n }\n\n atomic_cell make_counter_update_cell(int64_t delta) const {\n return atomic_cell::make_live_counter_update(_timestamp, delta);\n }\n\n tombstone make_tombstone() const {\n return {_timestamp, _local_deletion_time};\n }\n\n tombstone make_tombstone_just_before() const {\n return {_timestamp - 1, _local_deletion_time};\n }\n\n#if 0\n public RangeTombstone makeRangeTombstone(ColumnSlice slice) throws InvalidRequestException\n {\n QueryProcessor.validateComposite(slice.start, metadata.comparator);\n QueryProcessor.validateComposite(slice.finish, metadata.comparator);\n return new RangeTombstone(slice.start, slice.finish, timestamp, localDeletionTime);\n }\n\n public RangeTombstone makeTombstoneForOverwrite(ColumnSlice slice) throws InvalidRequestException\n {\n QueryProcessor.validateComposite(slice.start, metadata.comparator);\n QueryProcessor.validateComposite(slice.finish, metadata.comparator);\n return new RangeTombstone(slice.start, slice.finish, timestamp - 1, localDeletionTime);\n }\n#endif\n\n gc_clock::duration ttl() const {\n return _ttl.count() > 0 ? _ttl : _schema->default_time_to_live();\n }\n\n gc_clock::time_point expiry() const {\n return ttl() + _local_deletion_time;\n }\n\n api::timestamp_type timestamp() const {\n return _timestamp;\n }\n\n const prefetch_data::cell_list*\n get_prefetched_list(\n partition_key_view pkey,\n clustering_key_view ckey,\n const column_definition& column) const;\n\n static prefetch_data build_prefetch_data(schema_ptr schema, const query::result& query_result,\n const query::partition_slice& slice);\n};\n\n}\n<commit_msg>lwt: remove dead code in cql3\/update_parameters.hh<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright (C) 2015 ScyllaDB\n *\n * Modified by ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"gc_clock.hh\"\n#include \"timestamp.hh\"\n#include \"schema.hh\"\n#include \"atomic_cell.hh\"\n#include \"tombstone.hh\"\n#include \"exceptions\/exceptions.hh\"\n#include \"cql3\/query_options.hh\"\n\n#include <unordered_map>\n\nnamespace cql3 {\n\n\/**\n * A simple container that simplify passing parameters for collections methods.\n *\/\nclass update_parameters final {\npublic:\n \/\/ Holder for data needed by CQL list updates which depend on current state of the list.\n struct prefetch_data {\n using key = std::pair<partition_key, clustering_key>;\n using key_view = std::pair<partition_key_view, clustering_key_view>;\n struct key_hashing {\n partition_key::hashing pk_hash;\n clustering_key::hashing ck_hash;\n\n key_hashing(const schema& s)\n : pk_hash(s)\n , ck_hash(s)\n { }\n\n size_t operator()(const key& k) const {\n return pk_hash(k.first) ^ ck_hash(k.second);\n }\n\n size_t operator()(const key_view& k) const {\n return pk_hash(k.first) ^ ck_hash(k.second);\n }\n };\n struct key_equality {\n partition_key::equality pk_eq;\n clustering_key::equality ck_eq;\n\n key_equality(const schema& s)\n : pk_eq(s)\n , ck_eq(s)\n { }\n\n bool operator()(const key& k1, const key& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n bool operator()(const key_view& k1, const key& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n bool operator()(const key& k1, const key_view& k2) const {\n return pk_eq(k1.first, k2.first) && ck_eq(k1.second, k2.second);\n }\n };\n struct cell {\n bytes key;\n bytes value;\n };\n using cell_list = std::vector<cell>;\n using row = std::unordered_map<column_id, cell_list>;\n public:\n std::unordered_map<key, row, key_hashing, key_equality> rows;\n schema_ptr schema;\n public:\n prefetch_data(schema_ptr schema);\n };\n \/\/ Note: value (mutation) only required to contain the rows we are interested in\nprivate:\n const gc_clock::duration _ttl;\n const prefetch_data _prefetched; \/\/ For operation that require a read-before-write\npublic:\n const api::timestamp_type _timestamp;\n const gc_clock::time_point _local_deletion_time;\n const schema_ptr _schema;\n const query_options& _options;\n\n update_parameters(const schema_ptr schema_, const query_options& options,\n api::timestamp_type timestamp, gc_clock::duration ttl, prefetch_data prefetched)\n : _ttl(ttl)\n , _prefetched(std::move(prefetched))\n , _timestamp(timestamp)\n , _local_deletion_time(gc_clock::now())\n , _schema(std::move(schema_))\n , _options(options)\n {\n \/\/ We use MIN_VALUE internally to mean the absence of of timestamp (in Selection, in sstable stats, ...), so exclude\n \/\/ it to avoid potential confusion.\n if (timestamp < api::min_timestamp || timestamp > api::max_timestamp) {\n throw exceptions::invalid_request_exception(format(\"Out of bound timestamp, must be in [{:d}, {:d}]\",\n api::min_timestamp, api::max_timestamp));\n }\n }\n\n atomic_cell make_dead_cell() const {\n return atomic_cell::make_dead(_timestamp, _local_deletion_time);\n }\n\n atomic_cell make_cell(const abstract_type& type, const fragmented_temporary_buffer::view& value, atomic_cell::collection_member cm = atomic_cell::collection_member::no) const {\n auto ttl = _ttl;\n\n if (ttl.count() <= 0) {\n ttl = _schema->default_time_to_live();\n }\n\n if (ttl.count() > 0) {\n return atomic_cell::make_live(type, _timestamp, value, _local_deletion_time + ttl, ttl, cm);\n } else {\n return atomic_cell::make_live(type, _timestamp, value, cm);\n }\n };\n\n atomic_cell make_cell(const abstract_type& type, bytes_view value, atomic_cell::collection_member cm = atomic_cell::collection_member::no) const {\n return make_cell(type, fragmented_temporary_buffer::view(value), cm);\n }\n\n atomic_cell make_counter_update_cell(int64_t delta) const {\n return atomic_cell::make_live_counter_update(_timestamp, delta);\n }\n\n tombstone make_tombstone() const {\n return {_timestamp, _local_deletion_time};\n }\n\n tombstone make_tombstone_just_before() const {\n return {_timestamp - 1, _local_deletion_time};\n }\n\n gc_clock::duration ttl() const {\n return _ttl.count() > 0 ? _ttl : _schema->default_time_to_live();\n }\n\n gc_clock::time_point expiry() const {\n return ttl() + _local_deletion_time;\n }\n\n api::timestamp_type timestamp() const {\n return _timestamp;\n }\n\n const prefetch_data::cell_list*\n get_prefetched_list(\n partition_key_view pkey,\n clustering_key_view ckey,\n const column_definition& column) const;\n\n static prefetch_data build_prefetch_data(schema_ptr schema, const query::result& query_result,\n const query::partition_slice& slice);\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"image.h\"\n\n#include <QDebug>\n#include <QUndoStack>\n\nImage::Image() :\n m_data()\n{\n}\n\nImage::Image(const QSize &size, Image::Format format) :\n m_data(size, static_cast<QImage::Format>(format))\n{\n undoStack = new QUndoStack(this);\n}\n\nImage::Image(const QString &fileName, const char *format) :\n m_data(fileName, format)\n{\n}\n\nImage::Image(const QImage &image) :\n m_data(image)\n{\n\n}\n\nImage::~Image()\n{\n delete undoStack;\n}\n\nQImage &Image::data()\n{\n return m_data;\n}\n\nImage::Format Image::format() const\n{\n switch (m_data.format()) {\n case QImage::Format_Indexed8:\n return Indexed;\n case QImage::Format_ARGB32:\n return RGBA;\n default:\n return Invalid;\n }\n}\n\nvoid drawPixel(QImage &image, const QPoint &position, const uint index_or_rgb)\n{\n if (image.rect().contains(position)) {\n image.setPixel(position, index_or_rgb);\n }\n}\n\ninline int sign(const int val)\n{\n return (val > 0) ? 1 : ((val < 0) ? -1 : 0);\n}\n\nvoid doSpan(QImage &image, const QPoint &position, const uint x1, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n const int end = x1 + (inclusive ? 1 : 0);\n for (int x = position.x(); x < end; x++) {\n callback(image, QPoint(x, position.y()), index_or_rgb);\n }\n}\n\nvoid drawSpan(QImage &image, const QPoint &position, const uint x1, const uint index_or_rgb, const bool inclusive = true)\n{\n doSpan(image, position, x1, index_or_rgb, drawPixel, inclusive);\n}\n\nvoid doLine(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n QPoint delta = b - a;\n const int stepX = sign(delta.x()), stepY = sign(delta.y());\n if (stepX == 0 && stepY == 0) {\n return;\n }\n const int sumStepX = abs(delta.y()), sumStepY = abs(delta.x());\n\/\/ if (!inclusive || sumStepX > 1 || sumStepY > 1) {\n if (sumStepX > 0 || sumStepY > 0) {\n const int limit = sumStepX * sumStepY;\n int sumX = sumStepX, sumY = sumStepY;\n int x = a.x(), y = a.y();\n qDebug() << sumStepX << \",\" << sumStepY << \" | \" << limit;\n do {\n qDebug() << sumX << \",\" << sumY;\n callback(image, QPoint(x, floor(y)), index_or_rgb);\n if (sumX >= sumY) {\n y += stepY;\n sumY += sumStepY;\n }\n if (sumX <= sumY) {\n x += stepX;\n sumX += sumStepX;\n }\n } while (sumX <= limit && sumY <= limit);\n }\n\/\/ if (inclusive) {\n\/\/ callback(image, QPoint(x, floor(y)), index_or_rgb);\n\/\/ }\n\n}\n\nvoid drawLine(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb)\n{\n doLine(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid doRectangle(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n int x0, x1;\n if (a.x() < b.x()) {\n x0 = a.x();\n x1 = b.x();\n }\n else {\n x0 = b.x();\n x1 = a.x();\n }\n int y0, y1;\n if (a.y() < b.y()) {\n y0 = a.y();\n y1 = b.y();\n }\n else {\n y0 = b.y();\n y1 = a.y();\n }\n if (!inclusive) {\n x1--;\n y1--;\n }\n int deltaX = x1 - x0;\n int deltaY = y1 - y0;\n doSpan(image, QPoint(x0, y0), x1, index_or_rgb, callback, true);\n if (deltaY > 0) {\n if (deltaY > 1) {\n for (int y = y0; y <= y1; y++) {\n callback(image, QPoint(x0, y), index_or_rgb);\n if (deltaX > 0) {\n callback(image, QPoint(x1, y), index_or_rgb);\n }\n }\n }\n doSpan(image, QPoint(x0, y1), x1, index_or_rgb, callback, true);\n }\n}\n\nvoid drawRectangle(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb) {\n doRectangle(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid doRectangleFilled(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n int x0, x1;\n if (a.x() < b.x()) {\n x0 = a.x();\n x1 = b.x();\n }\n else {\n x0 = b.x();\n x1 = a.x();\n }\n int y0, y1;\n if (a.y() < b.y()) {\n y0 = a.y();\n y1 = b.y();\n }\n else {\n y0 = b.y();\n y1 = a.y();\n }\n if (!inclusive) {\n x1--;\n y1--;\n }\n for (int y = y0; y <= y1; y++) {\n doSpan(image, QPoint(x0, y), x1, index_or_rgb, callback, true);\n }\n}\n\nvoid drawRectangleFilled(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb) {\n doRectangleFilled(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid drawEllipse(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb)\n{\n}\n\ntypedef void (*PointCallback)(QImage &image, const QPoint &position, const uint index_or_rgb);\ntypedef void (*SegmentCallback)(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*pointCallback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive);\n\nvoid Image::stroke(const QPoint &a, const QPoint &b)\n{\n PointCallback pointCallback = drawPixel;\n SegmentCallback segmentCallback = doRectangleFilled;\n uint colour;\n if (format() == Indexed) {\n colour = 1;\n }\n else if (format() == RGBA) {\n colour = qRgb(255, 0, 0);\n }\n segmentCallback(m_data, a, b, colour, pointCallback, false);\n\/\/ undoStack->push(new StrokeCommand(*m_image, a, b));\n emit changed();\n}\n<commit_msg>Fixed line function.<commit_after>#include \"image.h\"\n\n#include <QDebug>\n#include <QUndoStack>\n\nImage::Image() :\n m_data()\n{\n}\n\nImage::Image(const QSize &size, Image::Format format) :\n m_data(size, static_cast<QImage::Format>(format))\n{\n undoStack = new QUndoStack(this);\n}\n\nImage::Image(const QString &fileName, const char *format) :\n m_data(fileName, format)\n{\n}\n\nImage::Image(const QImage &image) :\n m_data(image)\n{\n\n}\n\nImage::~Image()\n{\n delete undoStack;\n}\n\nQImage &Image::data()\n{\n return m_data;\n}\n\nImage::Format Image::format() const\n{\n switch (m_data.format()) {\n case QImage::Format_Indexed8:\n return Indexed;\n case QImage::Format_ARGB32:\n return RGBA;\n default:\n return Invalid;\n }\n}\n\nvoid drawPixel(QImage &image, const QPoint &position, const uint index_or_rgb)\n{\n if (image.rect().contains(position)) {\n image.setPixel(position, index_or_rgb);\n }\n}\n\ninline int sign(const int val)\n{\n return (val > 0) ? 1 : ((val < 0) ? -1 : 0);\n}\n\nvoid doSpan(QImage &image, const QPoint &position, const uint x1, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n const int end = x1 + (inclusive ? 1 : 0);\n for (int x = position.x(); x < end; x++) {\n callback(image, QPoint(x, position.y()), index_or_rgb);\n }\n}\n\nvoid drawSpan(QImage &image, const QPoint &position, const uint x1, const uint index_or_rgb, const bool inclusive = true)\n{\n doSpan(image, position, x1, index_or_rgb, drawPixel, inclusive);\n}\n\nvoid doLine(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n QPoint delta = b - a;\n const int stepX = sign(delta.x()), stepY = sign(delta.y());\n int sumStepX = abs(delta.y()), sumStepY = abs(delta.x());\n int x = a.x(), y = a.y();\n if (sumStepX > 0 || sumStepY > 0) {\n if (sumStepX == 0) {\n sumStepX = sumStepY;\n }\n if (sumStepY == 0) {\n sumStepY = sumStepX;\n }\n const int limit = sumStepX * sumStepY;\n int sumX = sumStepX, sumY = sumStepY;\n\/\/ qDebug() << sumStepX << \",\" << sumStepY << \" | \" << limit;\n do {\n\/\/ qDebug() << sumX << \",\" << sumY;\n callback(image, QPoint(x, y), index_or_rgb);\n if (sumX >= sumY) {\n y += stepY;\n sumY += sumStepY;\n }\n if (sumX <= sumY) {\n x += stepX;\n sumX += sumStepX;\n }\n } while (sumX <= limit && sumY <= limit);\n }\n if (inclusive) {\n callback(image, QPoint(x, y), index_or_rgb);\n }\n}\n\nvoid drawLine(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb)\n{\n doLine(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid doRectangle(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n int x0, x1;\n if (a.x() < b.x()) {\n x0 = a.x();\n x1 = b.x();\n }\n else {\n x0 = b.x();\n x1 = a.x();\n }\n int y0, y1;\n if (a.y() < b.y()) {\n y0 = a.y();\n y1 = b.y();\n }\n else {\n y0 = b.y();\n y1 = a.y();\n }\n if (!inclusive) {\n x1--;\n y1--;\n }\n int deltaX = x1 - x0;\n int deltaY = y1 - y0;\n doSpan(image, QPoint(x0, y0), x1, index_or_rgb, callback, true);\n if (deltaY > 0) {\n if (deltaY > 1) {\n for (int y = y0; y <= y1; y++) {\n callback(image, QPoint(x0, y), index_or_rgb);\n if (deltaX > 0) {\n callback(image, QPoint(x1, y), index_or_rgb);\n }\n }\n }\n doSpan(image, QPoint(x0, y1), x1, index_or_rgb, callback, true);\n }\n}\n\nvoid drawRectangle(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb) {\n doRectangle(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid doRectangleFilled(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*callback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive = true)\n{\n int x0, x1;\n if (a.x() < b.x()) {\n x0 = a.x();\n x1 = b.x();\n }\n else {\n x0 = b.x();\n x1 = a.x();\n }\n int y0, y1;\n if (a.y() < b.y()) {\n y0 = a.y();\n y1 = b.y();\n }\n else {\n y0 = b.y();\n y1 = a.y();\n }\n if (!inclusive) {\n x1--;\n y1--;\n }\n for (int y = y0; y <= y1; y++) {\n doSpan(image, QPoint(x0, y), x1, index_or_rgb, callback, true);\n }\n}\n\nvoid drawRectangleFilled(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb) {\n doRectangleFilled(image, a, b, index_or_rgb, drawPixel);\n}\n\nvoid drawEllipse(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb)\n{\n}\n\ntypedef void (*PointCallback)(QImage &image, const QPoint &position, const uint index_or_rgb);\ntypedef void (*SegmentCallback)(QImage &image, const QPoint &a, const QPoint &b, const uint index_or_rgb, void (*pointCallback)(QImage &image, const QPoint &position, const uint index_or_rgb), const bool inclusive);\n\nvoid Image::stroke(const QPoint &a, const QPoint &b)\n{\n PointCallback pointCallback = drawPixel;\n SegmentCallback segmentCallback = doLine;\n uint colour;\n if (format() == Indexed) {\n colour = 1;\n }\n else if (format() == RGBA) {\n colour = qRgb(255, 0, 0);\n }\n segmentCallback(m_data, a, b, colour, pointCallback, true);\n\/\/ undoStack->push(new StrokeCommand(*m_image, a, b));\n emit changed();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/test\/chrome_process_util.h\"\n\n#include \"chrome\/test\/ui\/ui_test.h\"\n\nclass ChromeProcessUtilTest : public UITest {\n};\n\nTEST_F(ChromeProcessUtilTest, SanityTest) {\n EXPECT_TRUE(IsBrowserRunning());\n ChromeProcessList processes = GetRunningChromeProcesses(browser_process_id());\n EXPECT_FALSE(processes.empty());\n QuitBrowser();\n EXPECT_FALSE(IsBrowserRunning());\n EXPECT_EQ(-1, browser_process_id());\n processes = GetRunningChromeProcesses(browser_process_id());\n EXPECT_TRUE(processes.empty());\n}\n<commit_msg>Mark ChromeProcessUtilTest.SanityTest as flaky.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/test\/chrome_process_util.h\"\n\n#include \"chrome\/test\/ui\/ui_test.h\"\n\nclass ChromeProcessUtilTest : public UITest {\n};\n\n\/\/ Flaky on Mac only. See http:\/\/crbug.com\/79175\nTEST_F(ChromeProcessUtilTest, FLAKY_SanityTest) {\n EXPECT_TRUE(IsBrowserRunning());\n ChromeProcessList processes = GetRunningChromeProcesses(browser_process_id());\n EXPECT_FALSE(processes.empty());\n QuitBrowser();\n EXPECT_FALSE(IsBrowserRunning());\n EXPECT_EQ(-1, browser_process_id());\n processes = GetRunningChromeProcesses(browser_process_id());\n EXPECT_TRUE(processes.empty());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"imageview.h\"\n#include \"experimentcontext.h\"\n#include \"resultspanel.h\"\n#include \"..\/ori\/OriWidgets.h\"\n#include \"appconfig.h\"\n\n#include <QBoxLayout>\n#include <QLabel>\n#include <QVariant>\n#include <QDebug>\n#include <QDateTime>\n#include <QPushButton>\n\n#define WORST_PREDICTED_IMAGE_W 160\n#define WORST_PREDICTED_IMAGE_H 120\n\nResultsPanel::ResultsPanel(ExperimentContext *context, QWidget *parent)\n : QFrame(parent), _updateIntervalMs(AppConfig::fpsUpdateIntervalMs())\n{\n setObjectName(\"resultsPanel\");\n\n _context = context;\n connect(_context, &ExperimentContext::experimentStarted, this, &ResultsPanel::experimentStarted);\n connect(_context, &ExperimentContext::newImageResult, this, &ResultsPanel::newImageResult);\n connect(_context, &ExperimentContext::currentResultChanged, this, &ResultsPanel::currentResultChanged);\n connect(_context, &ExperimentContext::modeChanged, this, &ResultsPanel::updateOnModeChanged);\n connect(_context, &ExperimentContext::zoomChanged, this, &ResultsPanel::updateOnEffectiveZoomChanged);\n connect(_context, &ExperimentContext::effectiveZoomChanged, this, &ResultsPanel::updateOnEffectiveZoomChanged);\n\n _infoImagesPerSec = makeInfoLabel();\n _infoPrecision = makeInfoLabel();\n _infoMetricTop1 = makeInfoLabel();\n _infoMetricTop5 = makeInfoLabel();\n\n _worstPredictedImage = new ImageView(WORST_PREDICTED_IMAGE_W, WORST_PREDICTED_IMAGE_H);\n\n auto panelCounters = makePanel({ Ori::Gui::makeTitle(\"IMAGES PER SECOND\"), _infoImagesPerSec });\n _panelPrecision = makePanel({ Ori::Gui::makeTitle(\"AVERAGE PRECISION\"), _infoPrecision });\n auto panelMetricTop1 = makePanel({ Ori::Gui::makeTitle(\"TOP-1\"), _infoMetricTop1 });\n auto panelMetricTop5 = makePanel({ Ori::Gui::makeTitle(\"TOP-5\"), _infoMetricTop5 });\n _panelMetrics = new QFrame;\n _panelMetrics->setLayout(Ori::Gui::layoutH(0, 0, { panelMetricTop1, panelMetricTop5 }));\n _panelWorstPrediction = makePanel({\n Ori::Gui::makeTitle(\"WORST PREDICTION\"),\n Ori::Gui::layoutH(0, 0, { 0, _worstPredictedImage, 0}),\n });\n\n auto buttonZoomIn = new QPushButton;\n buttonZoomIn->setObjectName(\"buttonZoomIn\");\n buttonZoomIn->setToolTip(tr(\"Zoom in\"));\n buttonZoomIn->setIcon(QIcon(\":\/tools\/zoom-in\"));\n connect(buttonZoomIn, SIGNAL(clicked(bool)), _context, SLOT(zoomIn()));\n\n auto buttonZoomOut = new QPushButton;\n buttonZoomOut->setObjectName(\"buttonZoomOut\");\n buttonZoomOut->setToolTip(tr(\"Zoom out\"));\n buttonZoomOut->setIcon(QIcon(\":\/tools\/zoom-out\"));\n connect(buttonZoomOut, SIGNAL(clicked(bool)), _context, SLOT(zoomOut()));\n\n auto buttonZoomActual = new QPushButton;\n buttonZoomActual->setObjectName(\"buttonZoomActual\");\n buttonZoomActual->setToolTip(tr(\"Actual size\"));\n buttonZoomActual->setIcon(QIcon(\":\/tools\/zoom-to-actual-size\"));\n connect(buttonZoomActual, SIGNAL(clicked(bool)), _context, SLOT(zoomActual()));\n\n auto buttonZoomToFit = new QPushButton;\n buttonZoomToFit->setObjectName(\"buttonZoomToFit\");\n buttonZoomToFit->setToolTip(tr(\"Zoom to fit\"));\n buttonZoomToFit->setIcon(QIcon(\":\/tools\/zoom-to-fit\"));\n connect(buttonZoomToFit, SIGNAL(clicked(bool)), _context, SLOT(zoomToFit()));\n\n _infoZoom = new QLabel;\n _infoZoom->setAlignment(Qt::AlignTop | Qt::AlignRight);\n _infoZoom->setProperty(\"qss-role\", \"link\");\n\n auto zoomLayout = Ori::Gui::layoutH({buttonZoomActual, 0, buttonZoomOut, 0, buttonZoomIn, 0, buttonZoomToFit});\n _panelZoom = makePanel({\n Ori::Gui::layoutH({ Ori::Gui::makeTitle(\"ZOOM\"), 0, _infoZoom }),\n zoomLayout\n });\n\n auto buttonFirst = new QPushButton;\n buttonFirst->setObjectName(\"buttonFirst\");\n buttonFirst->setToolTip(tr(\"First image\"));\n buttonFirst->setIcon(QIcon(\":\/tools\/first-img\"));\n connect(buttonFirst, SIGNAL(clicked(bool)), _context, SLOT(gotoFirstResult()));\n\n auto buttonPrev = new QPushButton;\n buttonPrev->setObjectName(\"buttonPrev\");\n buttonPrev->setToolTip(tr(\"Previous image\"));\n buttonPrev->setIcon(QIcon(\":\/tools\/prev-img\"));\n connect(buttonPrev, SIGNAL(clicked(bool)), _context, SLOT(gotoPrevResult()));\n\n auto buttonNext = new QPushButton;\n buttonNext->setObjectName(\"buttonNext\");\n buttonNext->setToolTip(tr(\"Next image\"));\n buttonNext->setIcon(QIcon(\":\/tools\/next-img\"));\n connect(buttonNext, SIGNAL(clicked(bool)), _context, SLOT(gotoNextResult()));\n\n auto buttonLast = new QPushButton;\n buttonLast->setObjectName(\"buttonLast\");\n buttonLast->setToolTip(tr(\"Last image\"));\n buttonLast->setIcon(QIcon(\":\/tools\/last-img\"));\n connect(buttonLast, SIGNAL(clicked(bool)), _context, SLOT(gotoLastResult()));\n\n _infoNav = new QLabel;\n _infoNav->setAlignment(Qt::AlignTop | Qt::AlignRight);\n _infoNav->setProperty(\"qss-role\", \"link\");\n\n auto navLayout = Ori::Gui::layoutH({buttonFirst, 0, buttonPrev, 0, buttonNext, 0, buttonLast});\n _panelNav = makePanel({\n Ori::Gui::layoutH({ Ori::Gui::makeTitle(\"NAVIGATION\"), 0, _infoNav }),\n navLayout\n });\n\n setLayout(Ori::Gui::layoutV(0, 0,\n { panelCounters, _panelPrecision, _panelZoom, _panelNav, _panelMetrics, _panelWorstPrediction, 0 }));\n\n resetInfo();\n updateOnModeChanged(AppConfig::currentMode().value<Mode>());\n updateOnEffectiveZoomChanged(AppConfig::zoom());\n}\n\nQLabel* ResultsPanel::makeInfoLabel(const QString &role) {\n auto label = new QLabel;\n label->setProperty(\"qss-role\", role.isEmpty() ? QString(\"info-label\") : role);\n return label;\n}\n\nQFrame* ResultsPanel::makePanel(const std::initializer_list<QObject *> &items, const QString &objectName) {\n auto panel = new QFrame;\n panel->setProperty(\"qss-role\", \"results-panel\");\n panel->setObjectName(objectName);\n panel->setLayout(Ori::Gui::layoutV(0, 0, items));\n return panel;\n}\n\nvoid ResultsPanel::experimentStarted(bool resume) {\n if (!resume) {\n resetInfo();\n }\n}\n\nvoid ResultsPanel::currentResultChanged(int currentResult, int resultCount) {\n _infoNav->setText(QString(\"<span style='color:#969C9E'>%1 \/ %2<\/span>\").arg(currentResult + 1).arg(resultCount));\n}\n\nvoid ResultsPanel::newImageResult(ImageResult ir) {\n qint64 curTimeMs = QDateTime::currentMSecsSinceEpoch();\n if (curTimeMs - _lastUpdateMs > _updateIntervalMs) {\n _infoImagesPerSec->setText(QString(QStringLiteral(\"%1\")).arg(ir.imagesPerSecond(), 0, 'f', 2));\n _infoPrecision->setText(QString(QStringLiteral(\"%1\")).arg(_context->precision().avg, 0, 'f', 2));\n _infoMetricTop1->setText(QString::number(_context->top1().avg, 'f', 2));\n _infoMetricTop5->setText(QString::number(_context->top5().avg, 'f', 2));\n\n double accuracyDelta = ir.accuracyDelta();\n if (accuracyDelta > _worstAccuracyDelta) {\n _worstAccuracyDelta = accuracyDelta;\n _worstPredictedImage->loadImage(ir.imageFile);\n _worstPredictedImage->setToolTip(QString(QStringLiteral(\"%1\\nTop1: %2\\nCorrect: %3\"))\n .arg(ir.imageFile)\n .arg(ir.predictions[0].str())\n .arg(ir.findCorrect()->str()));\n }\n _lastUpdateMs = curTimeMs;\n }\n}\n\nvoid ResultsPanel::resetInfo() {\n _infoImagesPerSec->setText(\"N\/A\");\n _infoPrecision->setText(\"N\/A\");\n _infoMetricTop1->setText(\"N\/A\");\n _infoMetricTop5->setText(\"N\/A\");\n _worstAccuracyDelta = 0;\n _worstPredictedImage->clearImage();\n _worstPredictedImage->setToolTip(\"\");\n _lastUpdateMs = 0;\n _infoNav->setText(\"\");\n}\n\nvoid ResultsPanel::updateOnModeChanged(Mode mode) {\n bool v = mode.type == Mode::Type::CLASSIFICATION;\n _panelMetrics->setVisible(v);\n _panelWorstPrediction->setVisible(v);\n _panelPrecision->setVisible(!v);\n _panelZoom->setVisible(!v);\n _panelNav->setVisible(!v);\n}\n\nvoid ResultsPanel::updateOnEffectiveZoomChanged(double z) {\n int p = z * 100;\n _infoZoom->setText(QString(\"<span style='color:#969C9E'>%1%<\/span>\").arg(p));\n}\n<commit_msg>Stick zoom and navigation controls to the bottom<commit_after>#include \"imageview.h\"\n#include \"experimentcontext.h\"\n#include \"resultspanel.h\"\n#include \"..\/ori\/OriWidgets.h\"\n#include \"appconfig.h\"\n\n#include <QBoxLayout>\n#include <QLabel>\n#include <QVariant>\n#include <QDebug>\n#include <QDateTime>\n#include <QPushButton>\n\n#define WORST_PREDICTED_IMAGE_W 160\n#define WORST_PREDICTED_IMAGE_H 120\n\nResultsPanel::ResultsPanel(ExperimentContext *context, QWidget *parent)\n : QFrame(parent), _updateIntervalMs(AppConfig::fpsUpdateIntervalMs())\n{\n setObjectName(\"resultsPanel\");\n\n _context = context;\n connect(_context, &ExperimentContext::experimentStarted, this, &ResultsPanel::experimentStarted);\n connect(_context, &ExperimentContext::newImageResult, this, &ResultsPanel::newImageResult);\n connect(_context, &ExperimentContext::currentResultChanged, this, &ResultsPanel::currentResultChanged);\n connect(_context, &ExperimentContext::modeChanged, this, &ResultsPanel::updateOnModeChanged);\n connect(_context, &ExperimentContext::zoomChanged, this, &ResultsPanel::updateOnEffectiveZoomChanged);\n connect(_context, &ExperimentContext::effectiveZoomChanged, this, &ResultsPanel::updateOnEffectiveZoomChanged);\n\n _infoImagesPerSec = makeInfoLabel();\n _infoPrecision = makeInfoLabel();\n _infoMetricTop1 = makeInfoLabel();\n _infoMetricTop5 = makeInfoLabel();\n\n _worstPredictedImage = new ImageView(WORST_PREDICTED_IMAGE_W, WORST_PREDICTED_IMAGE_H);\n\n auto panelCounters = makePanel({ Ori::Gui::makeTitle(\"IMAGES PER SECOND\"), _infoImagesPerSec });\n _panelPrecision = makePanel({ Ori::Gui::makeTitle(\"AVERAGE PRECISION\"), _infoPrecision });\n auto panelMetricTop1 = makePanel({ Ori::Gui::makeTitle(\"TOP-1\"), _infoMetricTop1 });\n auto panelMetricTop5 = makePanel({ Ori::Gui::makeTitle(\"TOP-5\"), _infoMetricTop5 });\n _panelMetrics = new QFrame;\n _panelMetrics->setLayout(Ori::Gui::layoutH(0, 0, { panelMetricTop1, panelMetricTop5 }));\n _panelWorstPrediction = makePanel({\n Ori::Gui::makeTitle(\"WORST PREDICTION\"),\n Ori::Gui::layoutH(0, 0, { 0, _worstPredictedImage, 0}),\n });\n\n auto buttonZoomIn = new QPushButton;\n buttonZoomIn->setObjectName(\"buttonZoomIn\");\n buttonZoomIn->setToolTip(tr(\"Zoom in\"));\n buttonZoomIn->setIcon(QIcon(\":\/tools\/zoom-in\"));\n connect(buttonZoomIn, SIGNAL(clicked(bool)), _context, SLOT(zoomIn()));\n\n auto buttonZoomOut = new QPushButton;\n buttonZoomOut->setObjectName(\"buttonZoomOut\");\n buttonZoomOut->setToolTip(tr(\"Zoom out\"));\n buttonZoomOut->setIcon(QIcon(\":\/tools\/zoom-out\"));\n connect(buttonZoomOut, SIGNAL(clicked(bool)), _context, SLOT(zoomOut()));\n\n auto buttonZoomActual = new QPushButton;\n buttonZoomActual->setObjectName(\"buttonZoomActual\");\n buttonZoomActual->setToolTip(tr(\"Actual size\"));\n buttonZoomActual->setIcon(QIcon(\":\/tools\/zoom-to-actual-size\"));\n connect(buttonZoomActual, SIGNAL(clicked(bool)), _context, SLOT(zoomActual()));\n\n auto buttonZoomToFit = new QPushButton;\n buttonZoomToFit->setObjectName(\"buttonZoomToFit\");\n buttonZoomToFit->setToolTip(tr(\"Zoom to fit\"));\n buttonZoomToFit->setIcon(QIcon(\":\/tools\/zoom-to-fit\"));\n connect(buttonZoomToFit, SIGNAL(clicked(bool)), _context, SLOT(zoomToFit()));\n\n _infoZoom = new QLabel;\n _infoZoom->setAlignment(Qt::AlignTop | Qt::AlignRight);\n _infoZoom->setProperty(\"qss-role\", \"link\");\n\n auto zoomLayout = Ori::Gui::layoutH({buttonZoomActual, 0, buttonZoomOut, 0, buttonZoomIn, 0, buttonZoomToFit});\n _panelZoom = makePanel({\n Ori::Gui::layoutH({ Ori::Gui::makeTitle(\"ZOOM\"), 0, _infoZoom }),\n zoomLayout\n });\n\n auto buttonFirst = new QPushButton;\n buttonFirst->setObjectName(\"buttonFirst\");\n buttonFirst->setToolTip(tr(\"First image\"));\n buttonFirst->setIcon(QIcon(\":\/tools\/first-img\"));\n connect(buttonFirst, SIGNAL(clicked(bool)), _context, SLOT(gotoFirstResult()));\n\n auto buttonPrev = new QPushButton;\n buttonPrev->setObjectName(\"buttonPrev\");\n buttonPrev->setToolTip(tr(\"Previous image\"));\n buttonPrev->setIcon(QIcon(\":\/tools\/prev-img\"));\n connect(buttonPrev, SIGNAL(clicked(bool)), _context, SLOT(gotoPrevResult()));\n\n auto buttonNext = new QPushButton;\n buttonNext->setObjectName(\"buttonNext\");\n buttonNext->setToolTip(tr(\"Next image\"));\n buttonNext->setIcon(QIcon(\":\/tools\/next-img\"));\n connect(buttonNext, SIGNAL(clicked(bool)), _context, SLOT(gotoNextResult()));\n\n auto buttonLast = new QPushButton;\n buttonLast->setObjectName(\"buttonLast\");\n buttonLast->setToolTip(tr(\"Last image\"));\n buttonLast->setIcon(QIcon(\":\/tools\/last-img\"));\n connect(buttonLast, SIGNAL(clicked(bool)), _context, SLOT(gotoLastResult()));\n\n _infoNav = new QLabel;\n _infoNav->setAlignment(Qt::AlignTop | Qt::AlignRight);\n _infoNav->setProperty(\"qss-role\", \"link\");\n\n auto navLayout = Ori::Gui::layoutH({buttonFirst, 0, buttonPrev, 0, buttonNext, 0, buttonLast});\n _panelNav = makePanel({\n Ori::Gui::layoutH({ Ori::Gui::makeTitle(\"NAVIGATION\"), 0, _infoNav }),\n navLayout\n });\n\n setLayout(Ori::Gui::layoutV(0, 0,\n { panelCounters, _panelPrecision, _panelMetrics, _panelWorstPrediction, 0, _panelZoom, _panelNav }));\n\n resetInfo();\n updateOnModeChanged(AppConfig::currentMode().value<Mode>());\n updateOnEffectiveZoomChanged(AppConfig::zoom());\n}\n\nQLabel* ResultsPanel::makeInfoLabel(const QString &role) {\n auto label = new QLabel;\n label->setProperty(\"qss-role\", role.isEmpty() ? QString(\"info-label\") : role);\n return label;\n}\n\nQFrame* ResultsPanel::makePanel(const std::initializer_list<QObject *> &items, const QString &objectName) {\n auto panel = new QFrame;\n panel->setProperty(\"qss-role\", \"results-panel\");\n panel->setObjectName(objectName);\n panel->setLayout(Ori::Gui::layoutV(0, 0, items));\n return panel;\n}\n\nvoid ResultsPanel::experimentStarted(bool resume) {\n if (!resume) {\n resetInfo();\n }\n}\n\nvoid ResultsPanel::currentResultChanged(int currentResult, int resultCount) {\n _infoNav->setText(QString(\"<span style='color:#969C9E'>%1 \/ %2<\/span>\").arg(currentResult + 1).arg(resultCount));\n}\n\nvoid ResultsPanel::newImageResult(ImageResult ir) {\n qint64 curTimeMs = QDateTime::currentMSecsSinceEpoch();\n if (curTimeMs - _lastUpdateMs > _updateIntervalMs) {\n _infoImagesPerSec->setText(QString(QStringLiteral(\"%1\")).arg(ir.imagesPerSecond(), 0, 'f', 2));\n _infoPrecision->setText(QString(QStringLiteral(\"%1\")).arg(_context->precision().avg, 0, 'f', 2));\n _infoMetricTop1->setText(QString::number(_context->top1().avg, 'f', 2));\n _infoMetricTop5->setText(QString::number(_context->top5().avg, 'f', 2));\n\n double accuracyDelta = ir.accuracyDelta();\n if (accuracyDelta > _worstAccuracyDelta) {\n _worstAccuracyDelta = accuracyDelta;\n _worstPredictedImage->loadImage(ir.imageFile);\n _worstPredictedImage->setToolTip(QString(QStringLiteral(\"%1\\nTop1: %2\\nCorrect: %3\"))\n .arg(ir.imageFile)\n .arg(ir.predictions[0].str())\n .arg(ir.findCorrect()->str()));\n }\n _lastUpdateMs = curTimeMs;\n }\n}\n\nvoid ResultsPanel::resetInfo() {\n _infoImagesPerSec->setText(\"N\/A\");\n _infoPrecision->setText(\"N\/A\");\n _infoMetricTop1->setText(\"N\/A\");\n _infoMetricTop5->setText(\"N\/A\");\n _worstAccuracyDelta = 0;\n _worstPredictedImage->clearImage();\n _worstPredictedImage->setToolTip(\"\");\n _lastUpdateMs = 0;\n _infoNav->setText(\"\");\n}\n\nvoid ResultsPanel::updateOnModeChanged(Mode mode) {\n bool v = mode.type == Mode::Type::CLASSIFICATION;\n _panelMetrics->setVisible(v);\n _panelWorstPrediction->setVisible(v);\n _panelPrecision->setVisible(!v);\n _panelZoom->setVisible(!v);\n _panelNav->setVisible(!v);\n}\n\nvoid ResultsPanel::updateOnEffectiveZoomChanged(double z) {\n int p = z * 100;\n _infoZoom->setText(QString(\"<span style='color:#969C9E'>%1%<\/span>\").arg(p));\n}\n<|endoftext|>"} {"text":"<commit_before>\/* errors.c - error reporting *\/\n\n\/*\n * This file is part of Playslave-C++.\n * Playslave-C++ is licenced under MIT License. See LICENSE.txt for more details.\n *\/\n\n#ifndef CUPPA_ERRORS_H\n#define CUPPA_ERRORS_H\n\n#include <string>\n#include <iostream>\n\n\/* Categories of error.\n *\/\nenum class ErrorCode {\n\tOK,\t\/\/ No error\n\tNO_FILE, \/\/ Tried to read nonexistent file\n\tBAD_STATE, \/\/ State transition not allowed\n\tBAD_COMMAND, \/\/ Command was malformed\n\tCOMMAND_REJECTED, \/\/ Command was valid but refused\n\tCOMMAND_IGNORED, \/\/ Command was silently ignored\n\tBAD_FILE, \/\/ Tried to read corrupt file\n\tBAD_CONFIG, \/\/ Program improperly configured\n\tAUDIO_INIT_FAIL, \/\/ Couldn't open audio backend\n\tINTERNAL_ERROR,\t\/\/ General system error, usually fatal\n\tNO_MEM,\t\/\/ Allocation of memory failed\n\tEND_OF_FILE, \/\/ Reached end of file while reading\n\tINCOMPLETE,\t\/\/ Incomplete computation, try again\n\tUNKNOWN, \/\/ Unknown error\n};\n\nclass Error {\npublic:\n\tError(ErrorCode error_code, std::string message);\n\n\tvoid ToResponse();\n\tErrorCode Code();\n\tconst std::string &Message();\nprivate:\n\tErrorCode error_code;\n\tstd::string message;\n};\n\ninline void DebugArgs()\n{\n}\n\ntemplate<typename T1, typename... Ts>\ninline void DebugArgs(T1 &t1, Ts &...ts)\n{\n\tstd::cerr << \" \" << t1;\n\tDebugArgs(ts...);\n}\n\ntemplate<typename... Ts>\ninline void Debug(Ts &...ts)\n{\n\tstd::cerr << \"DEBUG:\";\n\tDebugArgs(ts...);\n\tstd::cerr << std::endl;\n}\n\n#endif\t\t\t\t\/* !CUPPA_ERRORS_H *\/\n<commit_msg>Re-format errors.hpp.<commit_after>\/* errors.c - error reporting *\/\n\n\/*\n * This file is part of Playslave-C++.\n * Playslave-C++ is licenced under MIT License. See LICENSE.txt for more\n * details.\n *\/\n\n#ifndef CUPPA_ERRORS_H\n#define CUPPA_ERRORS_H\n\n#include <string>\n#include <iostream>\n\n\/* Categories of error.\n *\/\nenum class ErrorCode {\n\tOK, \/\/ No error\n\tNO_FILE, \/\/ Tried to read nonexistent file\n\tBAD_STATE, \/\/ State transition not allowed\n\tBAD_COMMAND, \/\/ Command was malformed\n\tCOMMAND_REJECTED, \/\/ Command was valid but refused\n\tCOMMAND_IGNORED, \/\/ Command was silently ignored\n\tBAD_FILE, \/\/ Tried to read corrupt file\n\tBAD_CONFIG, \/\/ Program improperly configured\n\tAUDIO_INIT_FAIL, \/\/ Couldn't open audio backend\n\tINTERNAL_ERROR, \/\/ General system error, usually fatal\n\tNO_MEM, \/\/ Allocation of memory failed\n\tEND_OF_FILE, \/\/ Reached end of file while reading\n\tINCOMPLETE, \/\/ Incomplete computation, try again\n\tUNKNOWN, \/\/ Unknown error\n};\n\nclass Error {\npublic:\n\tError(ErrorCode error_code, std::string message);\n\n\tvoid ToResponse();\n\tErrorCode Code();\n\tconst std::string &Message();\n\nprivate:\n\tErrorCode error_code;\n\tstd::string message;\n};\n\ninline void DebugArgs()\n{\n}\n\ntemplate <typename T1, typename... Ts>\ninline void DebugArgs(T1 &t1, Ts &... ts)\n{\n\tstd::cerr << \" \" << t1;\n\tDebugArgs(ts...);\n}\n\ntemplate <typename... Ts>\ninline void Debug(Ts &... ts)\n{\n\tstd::cerr << \"DEBUG:\";\n\tDebugArgs(ts...);\n\tstd::cerr << std::endl;\n}\n\n#endif \/* !CUPPA_ERRORS_H *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/ Main authors: Matevz Tadel & Alja Mrak-Tadel: 2006, 2007\n\n\/**************************************************************************\n * Copyright(c) 1998-2008, ALICE Experiment at CERN, all rights reserved. *\n * See http:\/\/aliceinfo.cern.ch\/Offline\/AliRoot\/License.html for *\n * full copyright notice. *\n **************************************************************************\/\n\/\/ ---------------------------------------------------------------------- \/\/\nvoid pmd_raw(Int_t mode = 0)\n{\n gStyle->SetPalette(1, 0);\n\n\n TObjArray *pmdddlcont = new TObjArray();\n\n TString spl;\n\n TString sddl;\n TString bsddl=\"DDL\";\n\n Int_t ievt = 0;\n AliRawReaderRoot reader(\"raw.root\",ievt);\n AliPMDRawStream stream(&reader);\n\n gEve->DisableRedraw();\n\n TEveElementList* l = new TEveElementList(\"PMD\");\n \/\/ l->SetTitle(\"PMD\");\n \/\/ l->SetMainColor((Color_t)3);\n gEve->AddElement(l);\n\n Int_t NSM = 0;\n Int_t istartDDL = 0;\n Int_t iendDDL = 0;\n Int_t modnumber = 0;\n Int_t istartPlane = 0;\n Int_t iendPlane = 0;\n Float_t zpos = 0;\n\n switch(mode)\n {\n case 0:\n istartPlane = 0;\n iendPlane = 1;\n printf(\"--- Visualization is set for PREshower Plane ---\\n\");\n break;\n\n case 1:\n istartPlane = 1;\n iendPlane = 2;\n printf(\"--- Visualization is set for CPV Plane ---\\n\");\n break;\n\n case 2:\n istartPlane = 0;\n iendPlane = 2;\n printf(\"--- Visualization is set for both the Plane ---\\n\");\n break;\n\n default:\n printf(\"--- Not set for any Plane ---\\n\");\n }\n\n for (Int_t ipl = istartPlane; ipl < iendPlane; ipl++)\n {\n\n if (ipl == 0)\n\t{\n\t spl = \"PRE\";\n\t istartDDL = 0;\n\t iendDDL = 4;\n\t zpos = 365.;\n\t}\n if (ipl == 1)\n\t{\n\t spl = \"CPV\";\n\t istartDDL = 4;\n\t iendDDL = 6;\n\t zpos = 360.;\n\t}\n\n TEveElementList* lplane = new TEveElementList(spl.Data());\n \/\/ l->SetMainColor((Color_t)3);\n gEve->AddElement(lplane, l);\n\n for (Int_t iddl = istartDDL; iddl < iendDDL; iddl++)\n \/\/for (Int_t iddl = 0; iddl < 1; iddl++)\n\t{\n\t sddl = bsddl;\n\t sddl += iddl;\n\t TEveElementList* lddl = new TEveElementList(sddl.Data());\n\t \/\/ l->SetMainColor((Color_t)3);\n\t gEve->AddElement(ddl, lplane);\n\n\t modnumber = iddl*6;\n\n\t if (iddl < 4)\n\t {\n\t NSM = 6;\n\t }\n\t else if (iddl >=4 && iddl < 6)\n\t {\n\t NSM = 12;\n\t }\n\n\t reader.Select(\"PMD\", iddl, iddl);\n\t Bool_t junk = stream.DdlData(iddl,pmdddlcont);\n\n\t for (Int_t ism = 0; ism < NSM; ism++)\n\t {\n\t AliEvePMDModule *lmodule = new AliEvePMDModule();\n\t lmodule->SetPosition(0.,0.,zpos);\n\t lmodule->DisplayRawData(modnumber,pmdddlcont);\n\t gEve->AddElement(lmodule, lddl);\n\t modnumber++;\n\t if (iddl == 4 && modnumber == 30) modnumber = 42;\n\t }\n\n\t pmdddlcont->Clear();\n\t}\n }\n\n gEve->EnableRedraw();\n}\n\n\/\/ ---------------------------------------------------------------------- \/\/\n<commit_msg>From Basanta: I have modified the AliPMDRawStream file which needs little modification<commit_after>\/\/ $Id$\n\/\/ Main authors: Matevz Tadel & Alja Mrak-Tadel: 2006, 2007\n\n\/**************************************************************************\n * Copyright(c) 1998-2008, ALICE Experiment at CERN, all rights reserved. *\n * See http:\/\/aliceinfo.cern.ch\/Offline\/AliRoot\/License.html for *\n * full copyright notice. *\n **************************************************************************\/\n\/\/ ---------------------------------------------------------------------- \/\/\nvoid pmd_raw(Int_t mode = 0)\n{\n gStyle->SetPalette(1, 0);\n\n\n TObjArray *pmdddlcont = new TObjArray();\n\n TString spl;\n\n TString sddl;\n TString bsddl=\"DDL\";\n\n Int_t ievt = 0;\n AliRawReaderRoot reader(\"raw.root\",ievt);\n AliPMDRawStream stream(&reader);\n\n gEve->DisableRedraw();\n\n TEveElementList* l = new TEveElementList(\"PMD\");\n \/\/ l->SetTitle(\"PMD\");\n \/\/ l->SetMainColor((Color_t)3);\n gEve->AddElement(l);\n\n Int_t NSM = 0;\n Int_t istartDDL = 0;\n Int_t iendDDL = 0;\n Int_t modnumber = 0;\n Int_t istartPlane = 0;\n Int_t iendPlane = 0;\n Float_t zpos = 0;\n\n switch(mode)\n {\n case 0:\n istartPlane = 0;\n iendPlane = 1;\n printf(\"--- Visualization is set for PREshower Plane ---\\n\");\n break;\n\n case 1:\n istartPlane = 1;\n iendPlane = 2;\n printf(\"--- Visualization is set for CPV Plane ---\\n\");\n break;\n\n case 2:\n istartPlane = 0;\n iendPlane = 2;\n printf(\"--- Visualization is set for both the Plane ---\\n\");\n break;\n\n default:\n printf(\"--- Not set for any Plane ---\\n\");\n }\n\n for (Int_t ipl = istartPlane; ipl < iendPlane; ipl++)\n {\n\n if (ipl == 0)\n\t{\n\t spl = \"PRE\";\n\t istartDDL = 0;\n\t iendDDL = 4;\n\t zpos = 365.;\n\t}\n if (ipl == 1)\n\t{\n\t spl = \"CPV\";\n\t istartDDL = 4;\n\t iendDDL = 6;\n\t zpos = 360.;\n\t}\n\n TEveElementList* lplane = new TEveElementList(spl.Data());\n \/\/ l->SetMainColor((Color_t)3);\n gEve->AddElement(lplane, l);\n\n Int_t iddl = -1;\n\n while ((iddl = rawStream.DdlData(&pmdddlcont)) >=0) {\n\t if (iddl >= istartDDL && iddl < iendDDL){\n\t sddl = bsddl;\n\t sddl += iddl;\n\t TEveElementList* lddl = new TEveElementList(sddl.Data());\n\t \/\/ l->SetMainColor((Color_t)3);\n\t gEve->AddElement(ddl, lplane);\n\t \n\t modnumber = iddl*6;\n\t \n\t if (iddl < 4)\n\t {\n\t\t NSM = 6;\n\t }\n\t else if (iddl >=4 && iddl < 6)\n\t {\n\t\t NSM = 12;\n\t }\n\n\t for (Int_t ism = 0; ism < NSM; ism++)\n\t {\n\t\t AliEvePMDModule *lmodule = new AliEvePMDModule();\n\t\t lmodule->SetPosition(0.,0.,zpos);\n\t\t lmodule->DisplayRawData(modnumber,pmdddlcont);\n\t\t gEve->AddElement(lmodule, lddl);\n\t\t modnumber++;\n\t\t if (iddl == 4 && modnumber == 30) modnumber = 42;\n\t }\n\t \n\t pmdddlcont->Clear();\n\t }\n }\n \n gEve->EnableRedraw();\n }\n \n}\n\/\/ ---------------------------------------------------------------------- \/\/\n \n<|endoftext|>"} {"text":"<commit_before>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXQt - a lightweight, Qt based, desktop toolset\n * https:\/\/lxqt.org\n *\n * Copyright: 2011 Razor team\n * Authors:\n * Maciej Płaza <plaza.maciej@gmail.com>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"lxqtcpuloadconfiguration.h\"\n#include \"ui_lxqtcpuloadconfiguration.h\"\n\n#define BAR_ORIENT_BOTTOMUP \"bottomUp\"\n#define BAR_ORIENT_TOPDOWN \"topDown\"\n#define BAR_ORIENT_LEFTRIGHT \"leftRight\"\n#define BAR_ORIENT_RIGHTLEFT \"rightLeft\"\n\nLXQtCpuLoadConfiguration::LXQtCpuLoadConfiguration(PluginSettings *settings, QWidget *parent) :\n LXQtPanelPluginConfigDialog(settings, parent),\n ui(new Ui::LXQtCpuLoadConfiguration)\n{\n setAttribute(Qt::WA_DeleteOnClose);\n setObjectName(QStringLiteral(\"CpuLoadConfigurationWindow\"));\n ui->setupUi(this);\n\n fillBarOrientations();\n\n connect(ui->buttons, SIGNAL(clicked(QAbstractButton*)),\n this, SLOT(dialogButtonsAction(QAbstractButton*)));\n\n loadSettings();\n\n connect(ui->showTextCB, SIGNAL(toggled(bool)),\n this, SLOT(showTextChanged(bool)));\n connect(ui->barWidthSB, SIGNAL(valueChanged(int)),\n this, SLOT(barWidthChanged(int)));\n connect(ui->updateIntervalSpinBox, SIGNAL(valueChanged(double)),\n this, SLOT(updateIntervalChanged(double)));\n connect(ui->barOrientationCOB, SIGNAL(currentIndexChanged(int)),\n this, SLOT(barOrientationChanged(int)));\n}\n\nLXQtCpuLoadConfiguration::~LXQtCpuLoadConfiguration()\n{\n delete ui;\n}\n\nvoid LXQtCpuLoadConfiguration::fillBarOrientations()\n{\n ui->barOrientationCOB->addItem(trUtf8(\"Bottom up\"), QStringLiteral(BAR_ORIENT_BOTTOMUP));\n ui->barOrientationCOB->addItem(trUtf8(\"Top down\"), QStringLiteral(BAR_ORIENT_TOPDOWN));\n ui->barOrientationCOB->addItem(trUtf8(\"Left to right\"), QStringLiteral(BAR_ORIENT_LEFTRIGHT));\n ui->barOrientationCOB->addItem(trUtf8(\"Right to left\"), QStringLiteral(BAR_ORIENT_RIGHTLEFT));\n}\n\nvoid LXQtCpuLoadConfiguration::loadSettings()\n{\n ui->showTextCB->setChecked(settings().value(QStringLiteral(\"showText\"), false).toBool());\n ui->barWidthSB->setValue(settings().value(QStringLiteral(\"barWidth\"), 20).toInt());\n ui->updateIntervalSpinBox->setValue(settings().value(QStringLiteral(\"updateInterval\"), 1000).toInt() \/ 1000.0);\n\n int boIndex = ui->barOrientationCOB->findData(\n settings().value(QStringLiteral(\"barOrientation\"), QStringLiteral(BAR_ORIENT_BOTTOMUP)));\n boIndex = (boIndex < 0) ? 1 : boIndex;\n ui->barOrientationCOB->setCurrentIndex(boIndex);\n\n\/\/\tQString menuFile = settings().value(\"menu_file\", \"\").toString();\n\/\/\tif (menuFile.isEmpty())\n\/\/\t{\n\/\/\t\tmenuFile = XdgMenu::getMenuFileName();\n\/\/\t}\n\/\/\tui->menuFilePathLE->setText(menuFile);\n\/\/\tui->shortcutEd->setKeySequence(settings().value(\"shortcut\", \"Alt+F1\").toString());\n}\n\nvoid LXQtCpuLoadConfiguration::showTextChanged(bool value)\n{\n settings().setValue(QStringLiteral(\"showText\"), value);\n}\n\nvoid LXQtCpuLoadConfiguration::barWidthChanged(int value)\n{\n settings().setValue(QStringLiteral(\"barWidth\"), value);\n}\n\nvoid LXQtCpuLoadConfiguration::updateIntervalChanged(double value)\n{\n settings().setValue(QStringLiteral(\"updateInterval\"), value*1000);\n}\n\nvoid LXQtCpuLoadConfiguration::barOrientationChanged(int index)\n{\n settings().setValue(QStringLiteral(\"barOrientation\"), ui->barOrientationCOB->itemData(index).toString());\n}\n<commit_msg>Remove deprecated trUtf8()<commit_after>\/* BEGIN_COMMON_COPYRIGHT_HEADER\n * (c)LGPL2+\n *\n * LXQt - a lightweight, Qt based, desktop toolset\n * https:\/\/lxqt.org\n *\n * Copyright: 2011 Razor team\n * Authors:\n * Maciej Płaza <plaza.maciej@gmail.com>\n *\n * This program or library is free software; you can redistribute it\n * and\/or modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n\n * You should have received a copy of the GNU Lesser General\n * Public License along with this library; if not, write to the\n * Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301 USA\n *\n * END_COMMON_COPYRIGHT_HEADER *\/\n\n#include \"lxqtcpuloadconfiguration.h\"\n#include \"ui_lxqtcpuloadconfiguration.h\"\n\n#define BAR_ORIENT_BOTTOMUP \"bottomUp\"\n#define BAR_ORIENT_TOPDOWN \"topDown\"\n#define BAR_ORIENT_LEFTRIGHT \"leftRight\"\n#define BAR_ORIENT_RIGHTLEFT \"rightLeft\"\n\nLXQtCpuLoadConfiguration::LXQtCpuLoadConfiguration(PluginSettings *settings, QWidget *parent) :\n LXQtPanelPluginConfigDialog(settings, parent),\n ui(new Ui::LXQtCpuLoadConfiguration)\n{\n setAttribute(Qt::WA_DeleteOnClose);\n setObjectName(QStringLiteral(\"CpuLoadConfigurationWindow\"));\n ui->setupUi(this);\n\n fillBarOrientations();\n\n connect(ui->buttons, SIGNAL(clicked(QAbstractButton*)),\n this, SLOT(dialogButtonsAction(QAbstractButton*)));\n\n loadSettings();\n\n connect(ui->showTextCB, SIGNAL(toggled(bool)),\n this, SLOT(showTextChanged(bool)));\n connect(ui->barWidthSB, SIGNAL(valueChanged(int)),\n this, SLOT(barWidthChanged(int)));\n connect(ui->updateIntervalSpinBox, SIGNAL(valueChanged(double)),\n this, SLOT(updateIntervalChanged(double)));\n connect(ui->barOrientationCOB, SIGNAL(currentIndexChanged(int)),\n this, SLOT(barOrientationChanged(int)));\n}\n\nLXQtCpuLoadConfiguration::~LXQtCpuLoadConfiguration()\n{\n delete ui;\n}\n\nvoid LXQtCpuLoadConfiguration::fillBarOrientations()\n{\n ui->barOrientationCOB->addItem(tr(\"Bottom up\"), QStringLiteral(BAR_ORIENT_BOTTOMUP));\n ui->barOrientationCOB->addItem(tr(\"Top down\"), QStringLiteral(BAR_ORIENT_TOPDOWN));\n ui->barOrientationCOB->addItem(tr(\"Left to right\"), QStringLiteral(BAR_ORIENT_LEFTRIGHT));\n ui->barOrientationCOB->addItem(tr(\"Right to left\"), QStringLiteral(BAR_ORIENT_RIGHTLEFT));\n}\n\nvoid LXQtCpuLoadConfiguration::loadSettings()\n{\n ui->showTextCB->setChecked(settings().value(QStringLiteral(\"showText\"), false).toBool());\n ui->barWidthSB->setValue(settings().value(QStringLiteral(\"barWidth\"), 20).toInt());\n ui->updateIntervalSpinBox->setValue(settings().value(QStringLiteral(\"updateInterval\"), 1000).toInt() \/ 1000.0);\n\n int boIndex = ui->barOrientationCOB->findData(\n settings().value(QStringLiteral(\"barOrientation\"), QStringLiteral(BAR_ORIENT_BOTTOMUP)));\n boIndex = (boIndex < 0) ? 1 : boIndex;\n ui->barOrientationCOB->setCurrentIndex(boIndex);\n\n\/\/\tQString menuFile = settings().value(\"menu_file\", \"\").toString();\n\/\/\tif (menuFile.isEmpty())\n\/\/\t{\n\/\/\t\tmenuFile = XdgMenu::getMenuFileName();\n\/\/\t}\n\/\/\tui->menuFilePathLE->setText(menuFile);\n\/\/\tui->shortcutEd->setKeySequence(settings().value(\"shortcut\", \"Alt+F1\").toString());\n}\n\nvoid LXQtCpuLoadConfiguration::showTextChanged(bool value)\n{\n settings().setValue(QStringLiteral(\"showText\"), value);\n}\n\nvoid LXQtCpuLoadConfiguration::barWidthChanged(int value)\n{\n settings().setValue(QStringLiteral(\"barWidth\"), value);\n}\n\nvoid LXQtCpuLoadConfiguration::updateIntervalChanged(double value)\n{\n settings().setValue(QStringLiteral(\"updateInterval\"), value*1000);\n}\n\nvoid LXQtCpuLoadConfiguration::barOrientationChanged(int index)\n{\n settings().setValue(QStringLiteral(\"barOrientation\"), ui->barOrientationCOB->itemData(index).toString());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"chip8.hh\"\n\nstatic uint8_t default_char[80] =\n{\n 0xF0 ,0x90, 0x90, 0x90, 0xF0, \/\/0\n 0x20, 0x60, 0x20, 0x20, 0x70, \/\/1\n 0xF0, 0x10, 0xF0, 0x80, 0xF0, \/\/2\n 0xF0, 0x10, 0xF0, 0x10, 0xF0, \/\/3\n 0x90, 0x90, 0xF0, 0x10, 0x10, \/\/4\n 0xF0, 0x80, 0xF0, 0x10, 0xF0, \/\/5\n 0xF0, 0x80, 0xF0, 0x90, 0xF0, \/\/6\n 0xF0, 0x10, 0x20, 0x40, 0x40, \/\/7\n 0xF0, 0x90, 0xF0, 0x90, 0xF0, \/\/8\n 0xF0, 0x90, 0xF0, 0x10, 0xF0, \/\/9\n 0xF0, 0x90, 0xF0, 0x90, 0x90, \/\/A\n 0xE0, 0x90, 0xE0, 0x90, 0xE0, \/\/B\n 0xF0, 0x80, 0x80, 0x80, 0xF0, \/\/C\n 0xE0, 0x90, 0x90, 0x90, 0xE0, \/\/D\n 0xF0, 0x80, 0xF0, 0x80, 0xF0, \/\/E\n 0xF0, 0x80, 0xF0, 0x80, 0x80 \/\/F\n};\n\nChip8::Chip8()\n : error_(0)\n , pc_(0x200)\n , sp_(0)\n , I_(0)\n , dt_(0)\n , st_(0)\n{}\n\nChip8::~Chip8()\n{\n SDL_FreeSurface(pixel_);\n SDL_Quit();\n}\n\nvoid Chip8::init()\n{\n if (SDL_Init(SDL_INIT_VIDEO) == -1)\n {\n std::cerr << \"Error cannot initialize SDL\" << std::endl;\n error_ = 2;\n }\n\n \/\/ Initialise memory to 0\n memset(&ram_, 0, 4096);\n memset(&V_, 0, 16);\n memset(&stack_, 0, 16 * 2);\n memset(&vga_mem_, 0, 64 * 32);\n\n for (size_t i = 0; i < 80; ++i)\n ram_[i] = default_char[i];\n\n pixel_ = SDL_CreateRGBSurface(0, 10, 10, 32, 0, 0, 0, 0);\n\n SDL_FillRect(pixel_, NULL, SDL_MapRGB(pixel_->format, 255, 255, 255));\n}\n\nvoid Chip8::load_bin(const std::string& path)\n{\n std::ifstream file;\n size_t file_size;\n\n file.open(path, std::ios::in | std::ios::binary);\n\n if (file.is_open())\n {\n file.seekg(0, std::ios::end);\n file_size = file.tellg();\n\n \/\/ Test if the ROM will feet in RAM\n if (file_size > 0xFFF - 0x200)\n {\n std::cerr << \"Error ROM cannot feet in RAM\" << std::endl;\n error_ = 4;\n }\n else \/\/ OK\n {\n char* data_rom = (char* )(&(ram_[0x200]));\n\n file.seekg(0, std::ios::beg);\n file.read(data_rom, file_size);\n }\n\n file.close();\n }\n else\n {\n std::cerr << \"Error while opening the ROM\" << std::endl;\n error_ = 3;\n }\n}\n\nvoid Chip8::render(SDL_Surface* screen)\n{\n SDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 0, 0, 0));\n\n SDL_Rect pixel_pos;\n\n for (size_t x = 0; x < 64; ++x)\n {\n for (size_t y = 0; y < 32; ++y)\n {\n if (vga_mem_[y * 64 + x] == 1)\n {\n pixel_pos.x = x * 10;\n pixel_pos.y = y * 10;\n\n SDL_BlitSurface(pixel_, NULL, screen, &pixel_pos);\n }\n }\n }\n\n SDL_Flip(screen);\n}\n\nvoid Chip8::execute()\n{\n int loop = 1;\n SDL_Event event;\n\n SDL_Surface* screen = SDL_SetVideoMode(640, 320, 32, SDL_HWSURFACE);\n SDL_WM_SetCaption(\"Chip8 Emulator\", NULL);\n\n while (!error_ && loop)\n {\n SDL_PollEvent(&event);\n\n switch (event.type)\n {\n case SDL_QUIT:\n loop = 0;\n }\n\n \/\/ Execute next instruction\n execute_next();\n\n render(screen);\n }\n}\n\nvoid Chip8::execute_next()\n{\n \/\/ Fetch opcode\n uint16_t op = (ram_[pc_] << 0x8) | ram_[pc_ + 1];\n\n switch (op & 0xF000)\n {\n case 0x0000:\n switch (op & 0x00FF)\n {\n case 0x00E0: \/\/ CLS\n memset(&vga_mem_, 0, 64 * 32);\n pc_ += 2;\n break;\n case 0x00EE: \/\/ RET\n fault(op);\n break;\n default: \/\/ JP ADDR\n \/\/ -1 to avoid +1 at the end of the switch\n pc_ = op & 0x0FFF;\n break;\n }\n break;\n case 0x2000: \/\/ Call addr\n {\n uint16_t addr = op & 0x0FFF;\n\n stack_[sp_++] = pc_;\n\n pc_ = addr;\n }\n break;\n case 0x4000: \/\/ NE Vx, byte\n {\n uint16_t x = op & 0x0F00;\n uint16_t byte = op & 0x00FF;\n\n if (V_[x] != byte)\n pc_ += 2;\n\n pc_ += 2;\n }\n break;\n case 0x6000: \/\/ LD Vx, byte\n {\n uint16_t x = op & 0x0F00;\n uint16_t byte = op & 0x00FF;\n\n x = x >> 0x8;\n\n V_[x] = byte;\n\n pc_ += 2;\n break;\n }\n break;\n case 0x8000:\n {\n uint16_t x = (op & 0x0F00) >> 0x8;\n uint16_t y = (op & 0x00F0) >> 0x4;\n\n switch (op & 0x000F)\n {\n case 0x0007: \/\/SUBN Vx, Vy\n\n if (V_[y] > V_[x])\n V_[0xF] = 0x1;\n else\n V_[0xF] = 0x0;\n\n V_[x] = V_[y] - V_[x];\n\n pc_ += 2;\n break;\n default:\n fault(op);\n break;\n }\n }\n break;\n case 0xA000: \/\/ LD I, addr\n {\n I_ = (op & 0x0FFF);\n\n pc_ += 2;\n }\n break;\n case 0xD000: \/\/ DRW Vx, Vy, nibble\n {\n uint16_t x = V_[(op & 0x0F00) >> 0x8];\n uint16_t y = V_[(op & 0x00F0) >> 0x4];\n uint16_t nibble = (op & 0x000F);\n uint16_t pixel;\n\n V_[0xF] = 0;\n\n for (size_t i = 0; i < nibble; ++i)\n {\n pixel = ram_[I_ + i];\n\n for (size_t j = 0; j < 8; ++j)\n {\n if ((pixel & (0x80 >> j)) != 0)\n {\n if (vga_mem_[x + j + ((y + i) * 64)] != 0)\n V_[0xF] = 1;\n\n vga_mem_[x + j + ((y + i) * 64)] ^= 1;\n }\n }\n\n }\n\n pc_ += 2;\n }\n break;\n case 0xF000:\n switch (op & 0x00FF)\n {\n case 0x0033: \/\/LD B, Vx\n {\n uint16_t x = (op & 0x0F00) >> 0x8;\n uint8_t tmp = V_[x] % 100;\n\n ram_[I_] = V_[x] \/ 100;\n ram_[I_ + 1] = tmp \/ 10;\n ram_[I_ + 2] = tmp % 10;\n\n pc_ += 2;\n }\n break;\n default:\n fault(op);\n break;\n }\n break;\n default:\n fault(op);\n break;\n }\n\n if (dt_ > 0)\n --dt_;\n\n if (st_ > 0)\n --st_;\n}\n\nvoid Chip8::fault(uint16_t op)\n{\n std::cerr << \"CPU Fault\" << std::endl;\n std::cerr << \"Error unknown instruction \"\n << std::hex << std::setfill('0') << std::setw(4)\n << std::uppercase << op << std::endl;\n dump();\n error_ = 5;\n}\n\nvoid Chip8::dump()\n{\n std::cerr << \"Dumping RAM\" << std::endl;\n\n for (size_t i = 0; i < 2048; ++i)\n {\n if (i % 16 == 0)\n std::cerr << std::endl << \"0x\" << std::setfill('0') << std::setw(3)\n << std::uppercase << std::hex << i << \" | \";\n\n std::cerr << std::hex << std::setfill('0') << std::setw(2)\n << std::uppercase << int(ram_[i])\n << std::uppercase << std::setfill('0') << std::setw(2)\n << int(ram_[i + 1]) << \" \";\n }\n\n std::cerr << std::endl;\n\n std::cerr << std::endl << \"Dumping Register\" << std::endl;\n\n std::cerr << std::endl << \"PC: 0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(pc_) << std::endl;\n\n std::cerr << \"I: 0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(I_) << std::endl;\n\n std::cerr << \"SP: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(sp_) << std::endl;\n\n std::cerr << \"DT: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(dt_) << std::endl;\n\n std::cerr << \"ST: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(st_) << std::endl;\n\n for (size_t i = 0; i < 16; ++i)\n {\n std::cerr << \"V\" << i << \": 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(V_[i]) << std::endl;\n }\n\n std::cerr << std::endl << \"Dumping Stack\" << std::endl;\n\n std::cerr << std::endl;\n\n for (size_t i = 0; i < 16; ++i)\n {\n std::cerr << \"0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(stack_[i]) << std::endl;\n }\n}\n\nint Chip8::get_error()\n{\n return error_;\n}\n<commit_msg>Add Fx65 instruction (LD [I], Vx)<commit_after>#include \"chip8.hh\"\n\nstatic uint8_t default_char[80] =\n{\n 0xF0 ,0x90, 0x90, 0x90, 0xF0, \/\/0\n 0x20, 0x60, 0x20, 0x20, 0x70, \/\/1\n 0xF0, 0x10, 0xF0, 0x80, 0xF0, \/\/2\n 0xF0, 0x10, 0xF0, 0x10, 0xF0, \/\/3\n 0x90, 0x90, 0xF0, 0x10, 0x10, \/\/4\n 0xF0, 0x80, 0xF0, 0x10, 0xF0, \/\/5\n 0xF0, 0x80, 0xF0, 0x90, 0xF0, \/\/6\n 0xF0, 0x10, 0x20, 0x40, 0x40, \/\/7\n 0xF0, 0x90, 0xF0, 0x90, 0xF0, \/\/8\n 0xF0, 0x90, 0xF0, 0x10, 0xF0, \/\/9\n 0xF0, 0x90, 0xF0, 0x90, 0x90, \/\/A\n 0xE0, 0x90, 0xE0, 0x90, 0xE0, \/\/B\n 0xF0, 0x80, 0x80, 0x80, 0xF0, \/\/C\n 0xE0, 0x90, 0x90, 0x90, 0xE0, \/\/D\n 0xF0, 0x80, 0xF0, 0x80, 0xF0, \/\/E\n 0xF0, 0x80, 0xF0, 0x80, 0x80 \/\/F\n};\n\nChip8::Chip8()\n : error_(0)\n , pc_(0x200)\n , sp_(0)\n , I_(0)\n , dt_(0)\n , st_(0)\n{}\n\nChip8::~Chip8()\n{\n SDL_FreeSurface(pixel_);\n SDL_Quit();\n}\n\nvoid Chip8::init()\n{\n if (SDL_Init(SDL_INIT_VIDEO) == -1)\n {\n std::cerr << \"Error cannot initialize SDL\" << std::endl;\n error_ = 2;\n }\n\n \/\/ Initialise memory to 0\n memset(&ram_, 0, 4096);\n memset(&V_, 0, 16);\n memset(&stack_, 0, 16 * 2);\n memset(&vga_mem_, 0, 64 * 32);\n\n for (size_t i = 0; i < 80; ++i)\n ram_[i] = default_char[i];\n\n pixel_ = SDL_CreateRGBSurface(0, 10, 10, 32, 0, 0, 0, 0);\n\n SDL_FillRect(pixel_, NULL, SDL_MapRGB(pixel_->format, 255, 255, 255));\n}\n\nvoid Chip8::load_bin(const std::string& path)\n{\n std::ifstream file;\n size_t file_size;\n\n file.open(path, std::ios::in | std::ios::binary);\n\n if (file.is_open())\n {\n file.seekg(0, std::ios::end);\n file_size = file.tellg();\n\n \/\/ Test if the ROM will feet in RAM\n if (file_size > 0xFFF - 0x200)\n {\n std::cerr << \"Error ROM cannot feet in RAM\" << std::endl;\n error_ = 4;\n }\n else \/\/ OK\n {\n char* data_rom = (char* )(&(ram_[0x200]));\n\n file.seekg(0, std::ios::beg);\n file.read(data_rom, file_size);\n }\n\n file.close();\n }\n else\n {\n std::cerr << \"Error while opening the ROM\" << std::endl;\n error_ = 3;\n }\n}\n\nvoid Chip8::render(SDL_Surface* screen)\n{\n SDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 0, 0, 0));\n\n SDL_Rect pixel_pos;\n\n for (size_t x = 0; x < 64; ++x)\n {\n for (size_t y = 0; y < 32; ++y)\n {\n if (vga_mem_[y * 64 + x] == 1)\n {\n pixel_pos.x = x * 10;\n pixel_pos.y = y * 10;\n\n SDL_BlitSurface(pixel_, NULL, screen, &pixel_pos);\n }\n }\n }\n\n SDL_Flip(screen);\n}\n\nvoid Chip8::execute()\n{\n int loop = 1;\n SDL_Event event;\n\n SDL_Surface* screen = SDL_SetVideoMode(640, 320, 32, SDL_HWSURFACE);\n SDL_WM_SetCaption(\"Chip8 Emulator\", NULL);\n\n while (!error_ && loop)\n {\n SDL_PollEvent(&event);\n\n switch (event.type)\n {\n case SDL_QUIT:\n loop = 0;\n }\n\n \/\/ Execute next instruction\n execute_next();\n\n render(screen);\n }\n}\n\nvoid Chip8::execute_next()\n{\n \/\/ Fetch opcode\n uint16_t op = (ram_[pc_] << 0x8) | ram_[pc_ + 1];\n\n switch (op & 0xF000)\n {\n case 0x0000:\n switch (op & 0x00FF)\n {\n case 0x00E0: \/\/ CLS\n memset(&vga_mem_, 0, 64 * 32);\n pc_ += 2;\n break;\n case 0x00EE: \/\/ RET\n fault(op);\n break;\n default: \/\/ JP ADDR\n \/\/ -1 to avoid +1 at the end of the switch\n pc_ = op & 0x0FFF;\n break;\n }\n break;\n case 0x2000: \/\/ Call addr\n {\n uint16_t addr = op & 0x0FFF;\n\n stack_[sp_++] = pc_;\n\n pc_ = addr;\n }\n break;\n case 0x4000: \/\/ NE Vx, byte\n {\n uint16_t x = op & 0x0F00;\n uint16_t byte = op & 0x00FF;\n\n if (V_[x] != byte)\n pc_ += 2;\n\n pc_ += 2;\n }\n break;\n case 0x6000: \/\/ LD Vx, byte\n {\n uint16_t x = op & 0x0F00;\n uint16_t byte = op & 0x00FF;\n\n x = x >> 0x8;\n\n V_[x] = byte;\n\n pc_ += 2;\n break;\n }\n break;\n case 0x8000:\n {\n uint16_t x = (op & 0x0F00) >> 0x8;\n uint16_t y = (op & 0x00F0) >> 0x4;\n\n switch (op & 0x000F)\n {\n case 0x0007: \/\/SUBN Vx, Vy\n\n if (V_[y] > V_[x])\n V_[0xF] = 0x1;\n else\n V_[0xF] = 0x0;\n\n V_[x] = V_[y] - V_[x];\n\n pc_ += 2;\n break;\n default:\n fault(op);\n break;\n }\n }\n break;\n case 0xA000: \/\/ LD I, addr\n {\n I_ = (op & 0x0FFF);\n\n pc_ += 2;\n }\n break;\n case 0xD000: \/\/ DRW Vx, Vy, nibble\n {\n uint16_t x = V_[(op & 0x0F00) >> 0x8];\n uint16_t y = V_[(op & 0x00F0) >> 0x4];\n uint16_t nibble = (op & 0x000F);\n uint16_t pixel;\n\n V_[0xF] = 0;\n\n for (size_t i = 0; i < nibble; ++i)\n {\n pixel = ram_[I_ + i];\n\n for (size_t j = 0; j < 8; ++j)\n {\n if ((pixel & (0x80 >> j)) != 0)\n {\n if (vga_mem_[x + j + ((y + i) * 64)] != 0)\n V_[0xF] = 1;\n\n vga_mem_[x + j + ((y + i) * 64)] ^= 1;\n }\n }\n\n }\n\n pc_ += 2;\n }\n break;\n case 0xF000:\n switch (op & 0x00FF)\n {\n case 0x0033: \/\/ LD B, Vx\n {\n uint16_t x = (op & 0x0F00) >> 0x8;\n uint8_t tmp = V_[x] % 100;\n\n ram_[I_] = V_[x] \/ 100;\n ram_[I_ + 1] = tmp \/ 10;\n ram_[I_ + 2] = tmp % 10;\n\n pc_ += 2;\n }\n break;\n case 0x0065: \/\/ LD [I], Vx\n {\n uint16_t x = (op & 0x0F00) >> 0x8;\n\n for (size_t i = 0; i <= x; ++i)\n ram_[I_ + i] = V_[i];\n\n pc_ += 2;\n }\n break;\n default:\n fault(op);\n break;\n }\n break;\n default:\n fault(op);\n break;\n }\n\n if (dt_ > 0)\n --dt_;\n\n if (st_ > 0)\n --st_;\n}\n\nvoid Chip8::fault(uint16_t op)\n{\n std::cerr << \"CPU Fault\" << std::endl;\n std::cerr << \"Error unknown instruction \"\n << std::hex << std::setfill('0') << std::setw(4)\n << std::uppercase << op << std::endl;\n dump();\n error_ = 5;\n}\n\nvoid Chip8::dump()\n{\n std::cerr << \"Dumping RAM\" << std::endl;\n\n for (size_t i = 0; i < 2048; ++i)\n {\n if (i % 16 == 0)\n std::cerr << std::endl << \"0x\" << std::setfill('0') << std::setw(3)\n << std::uppercase << std::hex << i << \" | \";\n\n std::cerr << std::hex << std::setfill('0') << std::setw(2)\n << std::uppercase << int(ram_[i])\n << std::uppercase << std::setfill('0') << std::setw(2)\n << int(ram_[i + 1]) << \" \";\n }\n\n std::cerr << std::endl;\n\n std::cerr << std::endl << \"Dumping Register\" << std::endl;\n\n std::cerr << std::endl << \"PC: 0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(pc_) << std::endl;\n\n std::cerr << \"I: 0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(I_) << std::endl;\n\n std::cerr << \"SP: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(sp_) << std::endl;\n\n std::cerr << \"DT: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(dt_) << std::endl;\n\n std::cerr << \"ST: 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(st_) << std::endl;\n\n for (size_t i = 0; i < 16; ++i)\n {\n std::cerr << \"V\" << i << \": 0x\" << std::hex << std::setfill('0')\n << std::setw(2) << int(V_[i]) << std::endl;\n }\n\n std::cerr << std::endl << \"Dumping Stack\" << std::endl;\n\n std::cerr << std::endl;\n\n for (size_t i = 0; i < 16; ++i)\n {\n std::cerr << \"0x\" << std::hex << std::setfill('0')\n << std::setw(4) << int(stack_[i]) << std::endl;\n }\n}\n\nint Chip8::get_error()\n{\n return error_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n ** \\file scheduler\/scheduler.cc\n ** \\brief Implementation of scheduler::Scheduler.\n *\/\n\n\/\/#define ENABLE_DEBUG_TRACES\n\n#include <cassert>\n\n#include <libport\/compiler.hh>\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n\n#include \"kernel\/userver.hh\"\n\n#include \"object\/urbi-exception.hh\"\n\n#include \"scheduler\/scheduler.hh\"\n#include \"scheduler\/job.hh\"\n\nnamespace scheduler\n{\n\n \/\/ This function is required to start a new job using the libcoroutine.\n \/\/ Its only purpose is to create the context and start the execution\n \/\/ of the new job.\n static void\n run_job (void* job)\n {\n static_cast<Job*>(job)->run();\n }\n\n void\n Scheduler::add_job (Job* job)\n {\n assert (job);\n assert (!libport::has (jobs_, job));\n assert (!libport::has (jobs_to_start_, job));\n jobs_to_start_.push_back (job);\n }\n\n libport::utime_t\n Scheduler::work ()\n {\n#ifdef ENABLE_DEBUG_TRACES\n static int cycle = 0;\n#endif\n ECHO (\"======================================================== cycle \"\n\t << ++cycle);\n\n \/\/ Start new jobs\n to_start_.clear ();\n std::swap (to_start_, jobs_to_start_);\n foreach (Job* job, to_start_)\n {\n assert (job);\n ECHO (\"will start job \" << *job);\n \/\/ Job will start for a very short time and do a yield_front() to\n \/\/ be restarted below in the course of the regular cycle.\n assert (!current_job_);\n current_job_ = job;\n Coro_startCoro_ (self_, job->coro_get(), job, run_job);\n \/\/ We have to assume that a new job may have had side-effects.\n possible_side_effect_ = true;\n }\n\n \/\/ Start deferred jobs\n for (libport::utime_t current_time = ::urbiserver->getTime ();\n\t !deferred_jobs_.empty();\n\t deferred_jobs_.pop ())\n {\n deferred_job j = deferred_jobs_.top ();\n if (current_time < j.get<0>())\n\tbreak;\n jobs_.push_back (j.get<1> ());\n }\n\n \/\/ If something is going to happen, or if we have just started a\n \/\/ new job, add the list of jobs waiting for something to happen\n \/\/ on the pending jobs queue.\n if (!if_change_jobs_.empty() && (possible_side_effect_ || !jobs_.empty()))\n {\n foreach (Job* job, if_change_jobs_)\n\tjobs_.push_back (job);\n if_change_jobs_.clear ();\n }\n\n \/\/ Run all the jobs in the run queue once. If any job declares upon entry or\n \/\/ return that it is not side-effect free, we remember that for the next\n \/\/ cycle.\n possible_side_effect_ = false;\n pending_.clear ();\n std::swap (pending_, jobs_);\n\n ECHO (pending_.size() << \" jobs in the queue for this cycle\");\n foreach (Job* job, pending_)\n {\n assert (job);\n assert (!job->terminated ());\n ECHO (\"will resume job \" << *job);\n possible_side_effect_ |= !job->side_effect_free_get ();\n Coro_switchTo_ (self_, job->coro_get ());\n possible_side_effect_ |= !job->side_effect_free_get ();\n ECHO (\"back from job \" << *job);\n }\n\n \/\/ Do we have some work to do now?\n if (!jobs_.empty () || !jobs_to_start_.empty())\n {\n ECHO (\"scheduler: asking to be recalled ASAP, \" << jobs_.size() << \" jobs ready and \" << jobs_to_start_.size()\n\t << \" to start\");\n return 0;\n }\n\n \/\/ Do we have deferred jobs?\n if (!deferred_jobs_.empty ())\n {\n ECHO (\"scheduler: asking to be recalled later\");\n return deferred_jobs_.top ().get<0> ();\n }\n\n \/\/ Ok, let's say, we'll be called again in one hour.\n ECHO (\"scheduler: asking to be recalled in a long time\");\n return ::urbiserver->getTime() + 3600000000LL;\n }\n\n void\n Scheduler::switch_back (Job* job)\n {\n \/\/ Switch back to the scheduler.\n assert (current_job_ == job);\n current_job_ = 0;\n Coro_switchTo_ (job->coro_get (), self_);\n \/\/ We regained control, we are again in the context of the job.\n assert (!current_job_);\n current_job_ = job;\n ECHO (\"job \" << *job << \" resumed\");\n \/\/ Check that we are not near exhausting the stack space.\n if (Coro_stackSpaceAlmostGone (job->coro_get ()))\n throw object::StackExhaustedError (\"stack space exhausted\");\n \/\/ Execute a deferred exception if any\n job->check_for_pending_exception ();\n }\n\n void\n Scheduler::resume_scheduler (Job* job)\n {\n \/\/ If the job has not terminated, put it at the back of the run queue\n \/\/ so that the run queue order is preserved between work cycles.\n if (!job->terminated ())\n jobs_.push_back (job);\n ECHO (*job << \" has \" << (job->terminated () ? \"\" : \"not \") << \"terminated\");\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_front (Job* job)\n {\n \/\/ Put the job in front of the queue. If the job asks to be requeued,\n \/\/ it is not terminated.\n assert (!job->terminated ());\n jobs_.push_front (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_until (Job* job, libport::utime_t deadline)\n {\n \/\/ Put the job in the deferred queue. If the job asks to be requeued,\n \/\/ it is not terminated.\n assert (!job->terminated ());\n deferred_jobs_.push (boost::make_tuple (deadline, job));\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_suspend (Job* job)\n {\n suspended_jobs_.push_back (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_things_changed (Job* job)\n {\n if_change_jobs_.push_back (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_job (Job* job)\n {\n \/\/ Suspended job may have been killed externally, in which case it\n \/\/ will not appear in the list of suspended jobs.\n\n if (libport::has (suspended_jobs_, job))\n {\n jobs_.push_back (job);\n suspended_jobs_.remove (job);\n }\n }\n\n void\n Scheduler::killall_jobs ()\n {\n ECHO (\"killing all jobs!\");\n\n \/\/ This implementation is quite inefficient because it will call\n \/\/ kill_job() for each job. But who cares? We are killing everyone\n \/\/ anyway.\n\n while (!jobs_to_start_.empty ())\n jobs_to_start_.pop_front ();\n\n while (!suspended_jobs_.empty ())\n kill_job (suspended_jobs_.front ());\n\n while (!if_change_jobs_.empty ())\n kill_job (if_change_jobs_.front ());\n\n while (!jobs_.empty ())\n kill_job (jobs_.front ());\n\n while (!deferred_jobs_.empty ())\n kill_job (deferred_jobs_.top ().get<1>());\n }\n\n void\n Scheduler::unschedule_job (Job* job)\n {\n assert (job);\n assert (job != current_job_);\n\n ECHO (\"unscheduling job \" << *job);\n\n \/\/ First of all, tell the job it has been terminated unless it has\n \/\/ been registered with us but not yet started.\n if (!libport::has (jobs_to_start_, job))\n job->terminate_now ();\n\n \/\/ Remove the job from the queues where it could be stored.\n jobs_to_start_.remove (job);\n jobs_.remove (job);\n suspended_jobs_.remove (job);\n if_change_jobs_.remove (job);\n\n \/\/ Remove it from live queues as well if the job is destroyed.\n to_start_.remove (job);\n pending_.remove (job);\n\n \/\/ We have no remove() on a priority queue, regenerate a queue without\n \/\/ this job.\n {\n deferred_jobs old_deferred;\n std::swap (old_deferred, deferred_jobs_);\n while (!old_deferred.empty ())\n {\n\tdeferred_job j = old_deferred.top ();\n\told_deferred.pop ();\n\tif (j.get<1>() != job)\n\t deferred_jobs_.push (j);\n }\n }\n }\n\n void\n Scheduler::kill_job (Job* job)\n {\n assert (job != current_job_);\n\n ECHO (\"deleting job \" << *job);\n delete job;\n }\n\n bool operator> (const deferred_job& left, const deferred_job& right)\n {\n return left.get<0>() > right.get<0>();\n }\n\n} \/\/ namespace scheduler\n<commit_msg>Print an error if a job attempts to unschedule itself<commit_after>\/**\n ** \\file scheduler\/scheduler.cc\n ** \\brief Implementation of scheduler::Scheduler.\n *\/\n\n\/\/#define ENABLE_DEBUG_TRACES\n\n#include <cassert>\n\n#include <libport\/compiler.hh>\n#include <libport\/containers.hh>\n#include <libport\/foreach.hh>\n\n#include \"kernel\/userver.hh\"\n\n#include \"object\/urbi-exception.hh\"\n\n#include \"scheduler\/scheduler.hh\"\n#include \"scheduler\/job.hh\"\n\nnamespace scheduler\n{\n\n \/\/ This function is required to start a new job using the libcoroutine.\n \/\/ Its only purpose is to create the context and start the execution\n \/\/ of the new job.\n static void\n run_job (void* job)\n {\n static_cast<Job*>(job)->run();\n }\n\n void\n Scheduler::add_job (Job* job)\n {\n assert (job);\n assert (!libport::has (jobs_, job));\n assert (!libport::has (jobs_to_start_, job));\n jobs_to_start_.push_back (job);\n }\n\n libport::utime_t\n Scheduler::work ()\n {\n#ifdef ENABLE_DEBUG_TRACES\n static int cycle = 0;\n#endif\n ECHO (\"======================================================== cycle \"\n\t << ++cycle);\n\n \/\/ Start new jobs\n to_start_.clear ();\n std::swap (to_start_, jobs_to_start_);\n foreach (Job* job, to_start_)\n {\n assert (job);\n ECHO (\"will start job \" << *job);\n \/\/ Job will start for a very short time and do a yield_front() to\n \/\/ be restarted below in the course of the regular cycle.\n assert (!current_job_);\n current_job_ = job;\n Coro_startCoro_ (self_, job->coro_get(), job, run_job);\n \/\/ We have to assume that a new job may have had side-effects.\n possible_side_effect_ = true;\n }\n\n \/\/ Start deferred jobs\n for (libport::utime_t current_time = ::urbiserver->getTime ();\n\t !deferred_jobs_.empty();\n\t deferred_jobs_.pop ())\n {\n deferred_job j = deferred_jobs_.top ();\n if (current_time < j.get<0>())\n\tbreak;\n jobs_.push_back (j.get<1> ());\n }\n\n \/\/ If something is going to happen, or if we have just started a\n \/\/ new job, add the list of jobs waiting for something to happen\n \/\/ on the pending jobs queue.\n if (!if_change_jobs_.empty() && (possible_side_effect_ || !jobs_.empty()))\n {\n foreach (Job* job, if_change_jobs_)\n\tjobs_.push_back (job);\n if_change_jobs_.clear ();\n }\n\n \/\/ Run all the jobs in the run queue once. If any job declares upon entry or\n \/\/ return that it is not side-effect free, we remember that for the next\n \/\/ cycle.\n possible_side_effect_ = false;\n pending_.clear ();\n std::swap (pending_, jobs_);\n\n ECHO (pending_.size() << \" jobs in the queue for this cycle\");\n foreach (Job* job, pending_)\n {\n assert (job);\n assert (!job->terminated ());\n ECHO (\"will resume job \" << *job);\n possible_side_effect_ |= !job->side_effect_free_get ();\n Coro_switchTo_ (self_, job->coro_get ());\n possible_side_effect_ |= !job->side_effect_free_get ();\n ECHO (\"back from job \" << *job);\n }\n\n \/\/ Do we have some work to do now?\n if (!jobs_.empty () || !jobs_to_start_.empty())\n {\n ECHO (\"scheduler: asking to be recalled ASAP, \" << jobs_.size() << \" jobs ready and \" << jobs_to_start_.size()\n\t << \" to start\");\n return 0;\n }\n\n \/\/ Do we have deferred jobs?\n if (!deferred_jobs_.empty ())\n {\n ECHO (\"scheduler: asking to be recalled later\");\n return deferred_jobs_.top ().get<0> ();\n }\n\n \/\/ Ok, let's say, we'll be called again in one hour.\n ECHO (\"scheduler: asking to be recalled in a long time\");\n return ::urbiserver->getTime() + 3600000000LL;\n }\n\n void\n Scheduler::switch_back (Job* job)\n {\n \/\/ Switch back to the scheduler.\n assert (current_job_ == job);\n current_job_ = 0;\n Coro_switchTo_ (job->coro_get (), self_);\n \/\/ We regained control, we are again in the context of the job.\n assert (!current_job_);\n current_job_ = job;\n ECHO (\"job \" << *job << \" resumed\");\n \/\/ Check that we are not near exhausting the stack space.\n if (Coro_stackSpaceAlmostGone (job->coro_get ()))\n throw object::StackExhaustedError (\"stack space exhausted\");\n \/\/ Execute a deferred exception if any\n job->check_for_pending_exception ();\n }\n\n void\n Scheduler::resume_scheduler (Job* job)\n {\n \/\/ If the job has not terminated, put it at the back of the run queue\n \/\/ so that the run queue order is preserved between work cycles.\n if (!job->terminated ())\n jobs_.push_back (job);\n ECHO (*job << \" has \" << (job->terminated () ? \"\" : \"not \") << \"terminated\");\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_front (Job* job)\n {\n \/\/ Put the job in front of the queue. If the job asks to be requeued,\n \/\/ it is not terminated.\n assert (!job->terminated ());\n jobs_.push_front (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_until (Job* job, libport::utime_t deadline)\n {\n \/\/ Put the job in the deferred queue. If the job asks to be requeued,\n \/\/ it is not terminated.\n assert (!job->terminated ());\n deferred_jobs_.push (boost::make_tuple (deadline, job));\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_suspend (Job* job)\n {\n suspended_jobs_.push_back (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_scheduler_things_changed (Job* job)\n {\n if_change_jobs_.push_back (job);\n switch_back (job);\n }\n\n void\n Scheduler::resume_job (Job* job)\n {\n \/\/ Suspended job may have been killed externally, in which case it\n \/\/ will not appear in the list of suspended jobs.\n\n if (libport::has (suspended_jobs_, job))\n {\n jobs_.push_back (job);\n suspended_jobs_.remove (job);\n }\n }\n\n void\n Scheduler::killall_jobs ()\n {\n ECHO (\"killing all jobs!\");\n\n \/\/ This implementation is quite inefficient because it will call\n \/\/ kill_job() for each job. But who cares? We are killing everyone\n \/\/ anyway.\n\n while (!jobs_to_start_.empty ())\n jobs_to_start_.pop_front ();\n\n while (!suspended_jobs_.empty ())\n kill_job (suspended_jobs_.front ());\n\n while (!if_change_jobs_.empty ())\n kill_job (if_change_jobs_.front ());\n\n while (!jobs_.empty ())\n kill_job (jobs_.front ());\n\n while (!deferred_jobs_.empty ())\n kill_job (deferred_jobs_.top ().get<1>());\n }\n\n void\n Scheduler::unschedule_job (Job* job)\n {\n assert (job);\n if (job == current_job_)\n {\n std::cerr << *job << \" asked to unschedule itself\\n\";\n }\n assert (job != current_job_);\n\n ECHO (\"unscheduling job \" << *job);\n\n \/\/ First of all, tell the job it has been terminated unless it has\n \/\/ been registered with us but not yet started.\n if (!libport::has (jobs_to_start_, job))\n job->terminate_now ();\n\n \/\/ Remove the job from the queues where it could be stored.\n jobs_to_start_.remove (job);\n jobs_.remove (job);\n suspended_jobs_.remove (job);\n if_change_jobs_.remove (job);\n\n \/\/ Remove it from live queues as well if the job is destroyed.\n to_start_.remove (job);\n pending_.remove (job);\n\n \/\/ We have no remove() on a priority queue, regenerate a queue without\n \/\/ this job.\n {\n deferred_jobs old_deferred;\n std::swap (old_deferred, deferred_jobs_);\n while (!old_deferred.empty ())\n {\n\tdeferred_job j = old_deferred.top ();\n\told_deferred.pop ();\n\tif (j.get<1>() != job)\n\t deferred_jobs_.push (j);\n }\n }\n }\n\n void\n Scheduler::kill_job (Job* job)\n {\n assert (job != current_job_);\n\n ECHO (\"deleting job \" << *job);\n delete job;\n }\n\n bool operator> (const deferred_job& left, const deferred_job& right)\n {\n return left.get<0>() > right.get<0>();\n }\n\n} \/\/ namespace scheduler\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ base.hpp\n\/\/ ~~~~~~~~\n\/\/\n\/\/ Copyright (c) 2014 Rick Yang (rick68 at gmail dot com)\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\/\/\n\n#ifndef EIGENJS_BASIC_HPP\n#define EIGENJS_BASIC_HPP\n\n#include <v8.h>\n#include <node.h>\n#include <nan.h>\n\n#include <boost\/mpl\/and.hpp>\n#include <boost\/mpl\/or.hpp>\n\n#include <eigen3\/Eigen\/Dense>\n\n#include <complex>\n#include <memory>\n#include <type_traits>\n\n#include \"Complex_fwd.hpp\"\n#include \"Matrix_fwd.hpp\"\n#include \"CMatrix_fwd.hpp\"\n#include \"Vector_fwd.hpp\"\n#include \"CVector_fwd.hpp\"\n#include \"RowVector_fwd.hpp\"\n#include \"CRowVector_fwd.hpp\"\n#include \"MatrixBlock_fwd.hpp\"\n#include \"CMatrixBlock_fwd.hpp\"\n#include \"VectorBlock_fwd.hpp\"\n#include \"CVectorBlock_fwd.hpp\"\n#include \"RowVectorBlock_fwd.hpp\"\n#include \"CRowVectorBlock_fwd.hpp\"\n\n#include \"detail\/unwrap_eigen_block.hpp\"\n#include \"detail\/is_eigen_block.hpp\"\n#include \"detail\/is_eigen_matrix.hpp\"\n\nnamespace EigenJS {\n\nnamespace detail {\n template <typename ScalarType>\n struct std_complex_dummy_ptr {\n typedef ScalarType scalar_type;\n typedef std::complex<scalar_type> value_type;\n\n NAN_INLINE value_type& operator*() { return value_; }\n NAN_INLINE const value_type& operator*() const { return value_; }\n NAN_INLINE value_type* operator->() { return &value_; }\n NAN_INLINE const value_type* operator->() const { return &value_; }\n\n private:\n value_type value_;\n };\n\n} \/\/ namespace detail\n\ntemplate <\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nstruct base : node::ObjectWrap {\n typedef Derived<ScalarType, ValueType, ClassName> derived_type;\n\n typedef ScalarType scalar_type;\n typedef typename detail::unwrap_eigen_block<ValueType>::type value_type;\n\n typedef typename std::conditional<\n std::is_same<\n value_type\n , typename detail::std_complex_dummy_ptr<scalar_type>::value_type\n >::value\n , detail::std_complex_dummy_ptr<scalar_type>\n , std::shared_ptr<value_type>\n >::type pointer_type;\n\n static NAN_INLINE bool is_scalar(const v8::Handle<v8::Value>& arg) {\n return arg->IsNumber() ? true : false;\n }\n\n static NAN_INLINE bool is_complex(const v8::Handle<v8::Value>& arg) {\n return Complex<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool\n is_complex_or_saclar(const v8::Handle<v8::Value>& arg) {\n return\n Complex<scalar_type>::base_type::has_instance(arg) || arg->IsNumber()\n ? true : false;\n }\n\n static NAN_INLINE bool is_matrix(const v8::Handle<v8::Value>& arg) {\n return Matrix<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cmatrix(const v8::Handle<v8::Value>& arg) {\n return CMatrix<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_vector(const v8::Handle<v8::Value>& arg) {\n return Vector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cvector(const v8::Handle<v8::Value>& arg) {\n return CVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_rowvector(const v8::Handle<v8::Value>& arg) {\n return RowVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_crowvector(const v8::Handle<v8::Value>& arg) {\n return CRowVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_matrixblock(const v8::Handle<v8::Value>& arg) {\n return MatrixBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cmatrixblock(const v8::Handle<v8::Value>& arg) {\n return CMatrixBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_vectorblock(const v8::Handle<v8::Value>& arg) {\n return VectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cvectorblock(const v8::Handle<v8::Value>& arg) {\n return CVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_rowvectorblock(const v8::Handle<v8::Value>& arg) {\n return RowVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_crowvectorblock(const v8::Handle<v8::Value>& arg) {\n return CRowVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool has_instance(const v8::Handle<v8::Value>& value) {\n NanScope();\n v8::Local<v8::FunctionTemplate> tpl = NanNew(function_template);\n return tpl->HasInstance(value);\n }\n\n template <typename T>\n static NAN_INLINE v8::Local<v8::Object>\n new_instance(const T& args, int argc, v8::Handle<v8::Value> argv[]) {\n v8::Local<v8::Function> ctor = NanNew(constructor);\n v8::Local<v8::Object> instance = ctor->NewInstance(argc, argv);\n return instance;\n }\n\n template <typename T, int Rows, int Cols>\n static NAN_INLINE bool is_out_of_range(\n const Eigen::Matrix<T, Rows, Cols>& eigen_matrix\n , const typename Eigen::Matrix<T, Rows, Cols>::Index& row\n , const typename Eigen::Matrix<T, Rows, Cols>::Index& col) {\n return row < 0 || row >= eigen_matrix.rows() ||\n col < 0 || col >= eigen_matrix.cols()\n ? NanThrowError(\"Row or column numbers are out of range\"), true\n : false;\n }\n\n template <\n typename XprType\n , int BlockRows\n , int BlockCols\n , bool InnerPanel\n >\n static NAN_INLINE bool is_out_of_range(\n const Eigen::Block<\n XprType\n , BlockRows\n , BlockCols\n , InnerPanel\n >& eigen_block\n , const typename XprType::Index& row\n , const typename XprType::Index& col) {\n return row < 0 || row >= eigen_block.rows() ||\n col < 0 || col >= eigen_block.cols()\n ? NanThrowError(\"Row or column numbers are out of range\"), true\n : false;\n }\n\n template <typename T, typename U>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::and_<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >\n , boost::mpl::or_<\n detail::is_eigen_block<typename U::value_type>\n , detail::is_eigen_matrix<typename U::value_type>\n >\n >::value\n , bool\n >::type\n is_nonconformate_arguments(\n const T* const& op1\n , const U* const& op2) {\n return (*op1)->rows() != (*op2)->rows() ||\n (*op1)->cols() != (*op2)->cols()\n ? NanThrowError(\"Nonconformant arguments\"), true\n : false;\n }\n\n template <typename T, typename U>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::and_<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >\n , boost::mpl::or_<\n detail::is_eigen_block<typename U::value_type>\n , detail::is_eigen_matrix<typename U::value_type>\n >\n >::value\n , bool\n >::type\n is_invalid_matrix_product(\n const T* const& op1\n , const U* const& op2) {\n return (*op1)->cols() != (*op2)->rows()\n ? NanThrowError(\"Invalid matrix product\"), true\n : false;\n }\n\n template <typename T>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >::value\n , bool\n >::type\n is_square_matrix(const T* const& op1) {\n return (*op1)->cols() == (*op1)->rows()\n ? true\n : (NanThrowError(\"The matrix must be square\"), false);\n }\n\n public:\n NAN_INLINE value_type& operator*() { return *value_ptr_; }\n NAN_INLINE const value_type& operator*() const { return *value_ptr_; }\n NAN_INLINE value_type* operator->() { return value_ptr_.get(); }\n NAN_INLINE const value_type* operator->() const { return value_ptr_.get(); }\n\n NAN_INLINE operator const pointer_type&() const {\n return value_ptr_;\n }\n\n protected:\n base() : value_ptr_(new value_type()) {}\n\n explicit base(const Complex<scalar_type>&) : value_ptr_() {}\n\n explicit base(const pointer_type& value_ptr)\n : value_ptr_(value_ptr)\n {}\n\n ~base() {}\n\n static v8::Persistent<v8::FunctionTemplate> function_template;\n static v8::Persistent<v8::Function> constructor;\n\n private:\n friend derived_type;\n pointer_type value_ptr_;\n};\n\ntemplate<\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nv8::Persistent<v8::FunctionTemplate>\n base<Derived, ScalarType, ValueType, ClassName>::function_template;\n\ntemplate<\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nv8::Persistent<v8::Function>\n base<Derived, ScalarType, ValueType, ClassName>::constructor;\n\n} \/\/ namespace EigenJS\n\n#endif \/\/ EIGENJS_BASIC_HPP\n<commit_msg>src: fix a mistake about English sentence.<commit_after>\/\/\n\/\/ base.hpp\n\/\/ ~~~~~~~~\n\/\/\n\/\/ Copyright (c) 2014 Rick Yang (rick68 at gmail dot com)\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\/\/\n\n#ifndef EIGENJS_BASIC_HPP\n#define EIGENJS_BASIC_HPP\n\n#include <v8.h>\n#include <node.h>\n#include <nan.h>\n\n#include <boost\/mpl\/and.hpp>\n#include <boost\/mpl\/or.hpp>\n\n#include <eigen3\/Eigen\/Dense>\n\n#include <complex>\n#include <memory>\n#include <type_traits>\n\n#include \"Complex_fwd.hpp\"\n#include \"Matrix_fwd.hpp\"\n#include \"CMatrix_fwd.hpp\"\n#include \"Vector_fwd.hpp\"\n#include \"CVector_fwd.hpp\"\n#include \"RowVector_fwd.hpp\"\n#include \"CRowVector_fwd.hpp\"\n#include \"MatrixBlock_fwd.hpp\"\n#include \"CMatrixBlock_fwd.hpp\"\n#include \"VectorBlock_fwd.hpp\"\n#include \"CVectorBlock_fwd.hpp\"\n#include \"RowVectorBlock_fwd.hpp\"\n#include \"CRowVectorBlock_fwd.hpp\"\n\n#include \"detail\/unwrap_eigen_block.hpp\"\n#include \"detail\/is_eigen_block.hpp\"\n#include \"detail\/is_eigen_matrix.hpp\"\n\nnamespace EigenJS {\n\nnamespace detail {\n template <typename ScalarType>\n struct std_complex_dummy_ptr {\n typedef ScalarType scalar_type;\n typedef std::complex<scalar_type> value_type;\n\n NAN_INLINE value_type& operator*() { return value_; }\n NAN_INLINE const value_type& operator*() const { return value_; }\n NAN_INLINE value_type* operator->() { return &value_; }\n NAN_INLINE const value_type* operator->() const { return &value_; }\n\n private:\n value_type value_;\n };\n\n} \/\/ namespace detail\n\ntemplate <\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nstruct base : node::ObjectWrap {\n typedef Derived<ScalarType, ValueType, ClassName> derived_type;\n\n typedef ScalarType scalar_type;\n typedef typename detail::unwrap_eigen_block<ValueType>::type value_type;\n\n typedef typename std::conditional<\n std::is_same<\n value_type\n , typename detail::std_complex_dummy_ptr<scalar_type>::value_type\n >::value\n , detail::std_complex_dummy_ptr<scalar_type>\n , std::shared_ptr<value_type>\n >::type pointer_type;\n\n static NAN_INLINE bool is_scalar(const v8::Handle<v8::Value>& arg) {\n return arg->IsNumber() ? true : false;\n }\n\n static NAN_INLINE bool is_complex(const v8::Handle<v8::Value>& arg) {\n return Complex<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool\n is_complex_or_saclar(const v8::Handle<v8::Value>& arg) {\n return\n Complex<scalar_type>::base_type::has_instance(arg) || arg->IsNumber()\n ? true : false;\n }\n\n static NAN_INLINE bool is_matrix(const v8::Handle<v8::Value>& arg) {\n return Matrix<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cmatrix(const v8::Handle<v8::Value>& arg) {\n return CMatrix<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_vector(const v8::Handle<v8::Value>& arg) {\n return Vector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cvector(const v8::Handle<v8::Value>& arg) {\n return CVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_rowvector(const v8::Handle<v8::Value>& arg) {\n return RowVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_crowvector(const v8::Handle<v8::Value>& arg) {\n return CRowVector<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_matrixblock(const v8::Handle<v8::Value>& arg) {\n return MatrixBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cmatrixblock(const v8::Handle<v8::Value>& arg) {\n return CMatrixBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_vectorblock(const v8::Handle<v8::Value>& arg) {\n return VectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_cvectorblock(const v8::Handle<v8::Value>& arg) {\n return CVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_rowvectorblock(const v8::Handle<v8::Value>& arg) {\n return RowVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool is_crowvectorblock(const v8::Handle<v8::Value>& arg) {\n return CRowVectorBlock<scalar_type>::base_type::has_instance(arg);\n }\n\n static NAN_INLINE bool has_instance(const v8::Handle<v8::Value>& value) {\n NanScope();\n v8::Local<v8::FunctionTemplate> tpl = NanNew(function_template);\n return tpl->HasInstance(value);\n }\n\n template <typename T>\n static NAN_INLINE v8::Local<v8::Object>\n new_instance(const T& args, int argc, v8::Handle<v8::Value> argv[]) {\n v8::Local<v8::Function> ctor = NanNew(constructor);\n v8::Local<v8::Object> instance = ctor->NewInstance(argc, argv);\n return instance;\n }\n\n template <typename T, int Rows, int Cols>\n static NAN_INLINE bool is_out_of_range(\n const Eigen::Matrix<T, Rows, Cols>& eigen_matrix\n , const typename Eigen::Matrix<T, Rows, Cols>::Index& row\n , const typename Eigen::Matrix<T, Rows, Cols>::Index& col) {\n return row < 0 || row >= eigen_matrix.rows() ||\n col < 0 || col >= eigen_matrix.cols()\n ? NanThrowError(\"The row or column number is out of range\"), true\n : false;\n }\n\n template <\n typename XprType\n , int BlockRows\n , int BlockCols\n , bool InnerPanel\n >\n static NAN_INLINE bool is_out_of_range(\n const Eigen::Block<\n XprType\n , BlockRows\n , BlockCols\n , InnerPanel\n >& eigen_block\n , const typename XprType::Index& row\n , const typename XprType::Index& col) {\n return row < 0 || row >= eigen_block.rows() ||\n col < 0 || col >= eigen_block.cols()\n ? NanThrowError(\"The row or column number is out of range\"), true\n : false;\n }\n\n template <typename T, typename U>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::and_<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >\n , boost::mpl::or_<\n detail::is_eigen_block<typename U::value_type>\n , detail::is_eigen_matrix<typename U::value_type>\n >\n >::value\n , bool\n >::type\n is_nonconformate_arguments(\n const T* const& op1\n , const U* const& op2) {\n return (*op1)->rows() != (*op2)->rows() ||\n (*op1)->cols() != (*op2)->cols()\n ? NanThrowError(\"Nonconformant arguments\"), true\n : false;\n }\n\n template <typename T, typename U>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::and_<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >\n , boost::mpl::or_<\n detail::is_eigen_block<typename U::value_type>\n , detail::is_eigen_matrix<typename U::value_type>\n >\n >::value\n , bool\n >::type\n is_invalid_matrix_product(\n const T* const& op1\n , const U* const& op2) {\n return (*op1)->cols() != (*op2)->rows()\n ? NanThrowError(\"Invalid matrix product\"), true\n : false;\n }\n\n template <typename T>\n static NAN_INLINE\n typename std::enable_if<\n boost::mpl::or_<\n detail::is_eigen_block<typename T::value_type>\n , detail::is_eigen_matrix<typename T::value_type>\n >::value\n , bool\n >::type\n is_square_matrix(const T* const& op1) {\n return (*op1)->cols() == (*op1)->rows()\n ? true\n : (NanThrowError(\"The matrix must be square\"), false);\n }\n\n public:\n NAN_INLINE value_type& operator*() { return *value_ptr_; }\n NAN_INLINE const value_type& operator*() const { return *value_ptr_; }\n NAN_INLINE value_type* operator->() { return value_ptr_.get(); }\n NAN_INLINE const value_type* operator->() const { return value_ptr_.get(); }\n\n NAN_INLINE operator const pointer_type&() const {\n return value_ptr_;\n }\n\n protected:\n base() : value_ptr_(new value_type()) {}\n\n explicit base(const Complex<scalar_type>&) : value_ptr_() {}\n\n explicit base(const pointer_type& value_ptr)\n : value_ptr_(value_ptr)\n {}\n\n ~base() {}\n\n static v8::Persistent<v8::FunctionTemplate> function_template;\n static v8::Persistent<v8::Function> constructor;\n\n private:\n friend derived_type;\n pointer_type value_ptr_;\n};\n\ntemplate<\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nv8::Persistent<v8::FunctionTemplate>\n base<Derived, ScalarType, ValueType, ClassName>::function_template;\n\ntemplate<\n template <typename, typename, const char*> class Derived\n, typename ScalarType\n, typename ValueType\n, const char* ClassName\n>\nv8::Persistent<v8::Function>\n base<Derived, ScalarType, ValueType, ClassName>::constructor;\n\n} \/\/ namespace EigenJS\n\n#endif \/\/ EIGENJS_BASIC_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n * yafdb - Yet Another Face Detection and Bluring\n *\n * Copyright (c) 2014 FOXEL SA - http:\/\/foxel.ch\n * Please read <http:\/\/foxel.ch\/license> for more information.\n *\n *\n * Author(s):\n *\n * Antony Ducommun <nitro@tmsrv.org>\n * Kevin Velickovic <k.velickovic@foxel.ch>\n *\n *\n * This file is part of the FOXEL project <http:\/\/foxel.ch>.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\n * Additional Terms:\n *\n * You are required to preserve legal notices and author attributions in\n * that material or in the Appropriate Legal Notices displayed by works\n * containing it.\n *\n * You are required to attribute the work as explained in the \"Usage and\n * Attribution\" section of <http:\/\/foxel.ch\/license>.\n *\/\n\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#include <errno.h>\n#include <getopt.h>\n#include <math.h>\n\n#include \"detectors\/detector.hpp\"\n\n\n\/*\n * List of supported algorithms.\n *\n *\/\n\n#define ALGORITHM_NONE 0\n#define ALGORITHM_GAUSSIAN 1\n#define ALGORITHM_PROGRESSIVE 2\n\n\n\/*\n * Program arguments.\n *\n *\/\n\n#define OPTION_ALGORITHM 0\n#define OPTION_MERGE_MIN_OVERLAP 1\n#define OPTION_GAUSSIAN_KERNEL 2\n#define OPTION_GAUSSIAN_STEPS 3\n#define OPTION_RESIZE_WIDTH 4\n#define OPTION_RESIZE_HEIGHT 5\n\nstatic int resize_width = 0;\nstatic int resize_height = 0;\nstatic int algorithm = ALGORITHM_GAUSSIAN;\nstatic int merge_min_overlap = 1;\nstatic double gaussian_kernel_size = 65;\nstatic double gaussian_steps = 1;\nstatic const char *source_file = NULL;\nstatic const char *objects_file = NULL;\nstatic const char *target_file = NULL;\n\n\nstatic struct option options[] = {\n {\"algorithm\", required_argument, 0, 'a'},\n {\"merge-min-overlap\", required_argument, 0, 0 },\n {\"gaussian-kernel\", required_argument, 0, 0 },\n {\"gaussian-steps\", required_argument, 0, 0 },\n {\"resize-width\", required_argument, 0, 0 },\n {\"resize-height\", required_argument, 0, 0 },\n {0, 0, 0, 0}\n};\n\n\/\/! Progressive rectangular blurring\n\n\/\/! Apply a progresive blur on the desired rectangle.\n\/\/!\n\/\/! @param pbBitmap Bitmap array pointer to result image\n\/\/! @param pbSource Bitmap array pointer to source image\n\/\/! @param pbWidth Bitmap width, in pixels\n\/\/! @param pbHeight Bitmap height, in pixels\n\/\/! @param pbChannel Layer on which blur apply\n\/\/! @param pbRx1 Rectangle upper left corner x coordinates\n\/\/! @param pbRy1 Rectangle upper left corner y coordinates\n\/\/! @param pbRx2 Rectangle lower right corner x coordinates\n\/\/! @param pbRy2 Rectangle lower right corner y coordinates\n\nvoid progblur ( unsigned char * pbBitmap, int pbWidth, int pbHeight, int pbChannel, int pbRx1, int pbRy1, int pbRx2, int pbRy2 ) {\n\n \/* Parsing variables *\/\n int pbX = 0;\n int pbY = 0;\n int pbI = 0;\n int pbJ = 0;\n\n \/* Function parameters *\/\n float pbU = 0.0;\n float pbV = 0.0;\n\n \/* Area boudaries *\/\n int pbAX1 = 0;\n int pbAY1 = 0;\n int pbAX2 = 0;\n int pbAY2 = 0;\n\n \/* Compute rectangle size *\/\n int pbrWidth = ( pbRx2 - pbRx1 );\n int pbrHeight = ( pbRy2 - pbRy1 );\n\n \/* Compute rectangle center *\/\n float pbCX = ( float ) pbrWidth \/ 2.0 + pbRx1;\n float pbCY = ( float ) pbrHeight \/ 2.0 + pbRy1;\n\n \/* Compute automatic factor *\/\n float pbFactor = pbrWidth < pbrHeight ? pbrWidth : pbrHeight;\n\n \/* Chromaitc accumulator *\/\n float pbAccumR = 0.0;\n float pbAccumG = 0.0;\n float pbAccumB = 0.0;\n int pbForce = 0;\n int pbCount = 0;\n\n \/* Optimization for bitmap offset *\/\n unsigned char * pbOffset = NULL;\n\n \/* Optimization for bitmap sub-offset *\/\n int pbYOffset = 0;\n int pbJOffset = 0;\n\n \/* Increase rectangle size *\/\n pbRx1 = pbCX - pbFactor;\n pbRx2 = pbCX + pbFactor;\n pbRy1 = pbCY - pbFactor;\n pbRy2 = pbCY + pbFactor;\n\n \/* Recompute adapted width and height *\/\n pbrWidth = ( pbRx2 - pbRx1 );\n pbrHeight = ( pbRy2 - pbRy1 );\n\n \/* Optimization operation *\/\n pbFactor *= 0.2;\n\n \/* Blurring y-component loop *\/\n for ( pbY = pbRy1; pbY <= pbRy2; pbY ++ ) {\n\n \/* Compute optimization sub-offset *\/\n pbYOffset = pbChannel * pbWidth * pbY;\n\n \/* Compute coordinates v-parameters *\/\n pbV = ( ( float ) ( pbY - pbRy1 ) \/ pbrHeight ) * 2.0 - 1.0;\n\n \/* Blurring x-component loop *\/\n for ( pbX = pbRx1; pbX <= pbRx2; pbX ++ ) {\n\n \/* Reset chromatic accumulator *\/\n pbAccumR = 0.0;\n pbAccumG = 0.0;\n pbAccumB = 0.0; \n\n \/* Compute coordinates u-parameters *\/\n pbU = ( ( float ) ( pbX - pbRx1 ) \/ pbrWidth ) * 2.0 - 1.0;\n\n \/* Compute recursive condition value *\/\n pbForce = int( exp( - pbU * pbU * 3.5 ) * exp( - pbV * pbV * 3.5 ) * pbFactor );\n\n pbForce = ( pbForce > 32 ) ? 32 : pbForce;\n\n \/* Create area boundaries *\/\n pbAX1 = pbX - pbForce; pbAX1 = ( pbAX1 < 0 ) ? 0 : pbAX1;\n pbAX2 = pbX + pbForce; pbAX2 = ( pbAX2 >= pbWidth ) ? pbWidth - 1 : pbAX2;\n pbAY1 = pbY - pbForce; pbAY1 = ( pbAY1 < 0 ) ? 0 : pbAY1;\n pbAY2 = pbY + pbForce; pbAY2 = ( pbAY2 >= pbHeight ) ? pbHeight - 1 : pbAY2;\n\n \/* Accumulates y-components *\/\n for ( pbJ = pbAY1; pbJ <= pbAY2; pbJ ++ ) {\n\n \/* Compute optimization sub-offset *\/\n pbJOffset = pbChannel * pbWidth * pbJ;\n\n \/* Accumulates x-components *\/\n for ( pbI = pbAX1; pbI <= pbAX2; pbI ++ ) {\n\n \/* Compute optimiztion offset *\/\n pbOffset = pbBitmap + pbJOffset + pbChannel * pbI;\n\n \/* Accumulate chromatic value *\/\n pbAccumR += * ( pbOffset ++ );\n pbAccumG += * ( pbOffset ++ );\n pbAccumB += * ( pbOffset );\n\n }\n\n }\n\n \/* Compute number of considered pixels *\/\n pbCount = ( pbAX2 - pbAX1 + 1 ) * ( pbAY2 - pbAY1 + 1 );\n\n \/* Compute optimization offset *\/\n pbOffset = pbBitmap + pbYOffset + pbChannel * pbX;\n\n \/* Assign mean value *\/\n * ( pbOffset ++ ) = pbAccumR \/ pbCount;\n * ( pbOffset ++ ) = pbAccumG \/ pbCount;\n * ( pbOffset ) = pbAccumB \/ pbCount;\n\n }\n\n }\n\n}\n\n\n\/**\n * Display program usage.\n *\n *\/\nvoid usage() {\n printf(\"yafdb-blur --algorithm algo input-image.tiff input-objects.yaml output-image.tiff\\n\\n\");\n\n printf(\"Blurs detected objects and write modified image as output.\\n\\n\");\n\n printf(\"General options:\\n\\n\");\n printf(\"--algorithm algo : algorithm to use for blurring ('gaussian', 'progressive')\\n\");\n printf(\"--merge-min-overlap 1 : minimum occurrence of overlap to keep detected objects\\n\");\n printf(\"\\n\");\n\n printf(\"Gaussian options:\\n\\n\");\n printf(\"--gaussian-kernel 65 : gaussian kernel size\\n\");\n printf(\"--gaussian-steps 1 : gaussian blurring steps\\n\");\n printf(\"\\n\");\n\n printf(\"Resizing options:\\n\\n\");\n printf(\"--resize-width 800: Resizing width\\n\");\n printf(\"--resize-height 600: Resizing height\\n\");\n printf(\"\\n\");\n}\n\n\n\/**\n * Program entry-point.\n *\n *\/\nint main(int argc, char **argv) {\n \/\/ parse arguments\n while (true) {\n int index = -1;\n\n getopt_long(argc, argv, \"\", options, &index);\n if (index == -1) {\n if (argc != optind + 3) {\n usage();\n return 1;\n }\n\n source_file = argv[optind++];\n if (access(source_file, R_OK)) {\n fprintf(stderr, \"Error: source file not readable: %s\\n\", source_file);\n return 2;\n }\n\n objects_file = argv[optind++];\n if (access(objects_file, R_OK)) {\n fprintf(stderr, \"Error: detected objects file not readable: %s\\n\", objects_file);\n return 2;\n }\n\n target_file = argv[optind++];\n if (access(target_file, W_OK) && errno == EACCES) {\n fprintf(stderr, \"Error: target file not writable: %s\\n\", target_file);\n return 2;\n }\n break;\n }\n\n switch (index) {\n case OPTION_ALGORITHM:\n if (strcmp(optarg, \"none\") == 0) {\n algorithm = ALGORITHM_NONE;\n } else if (strcmp(optarg, \"gaussian\") == 0) {\n algorithm = ALGORITHM_GAUSSIAN;\n } else if (strcmp(optarg, \"progressive\") == 0) {\n algorithm = ALGORITHM_PROGRESSIVE;\n } else {\n fprintf(stderr, \"Error: unsupported algorithm: %s\\n\", optarg);\n }\n break;\n\n case OPTION_MERGE_MIN_OVERLAP:\n merge_min_overlap = atoi(optarg);\n break;\n\n case OPTION_GAUSSIAN_KERNEL:\n gaussian_kernel_size = atof(optarg);\n break;\n case OPTION_GAUSSIAN_STEPS:\n gaussian_steps = atof(optarg);\n break;\n case OPTION_RESIZE_WIDTH:\n resize_width = atoi(optarg);\n break;\n case OPTION_RESIZE_HEIGHT:\n resize_height = atoi(optarg);\n break;\n\n default:\n usage();\n return 1;\n }\n }\n\n \/\/ read source file\n cv::Mat source = cv::imread(source_file);\n\n if (source.rows <= 0 || source.cols <= 0) {\n fprintf(stderr, \"Error: cannot read image in source file: %s\\n\", source_file);\n return 2;\n }\n\n \/\/ read detected objects\n std::list<DetectedObject> objects;\n\n if (!ObjectDetector::load(objects_file, objects)) {\n fprintf(stderr, \"Error: cannot read objects in file: %s\\n\", objects_file);\n return 2;\n }\n\n \/\/ merge detected objects\n ObjectDetector::merge(objects, merge_min_overlap);\n\n \/\/ apply blur operation\n for (int i = 0; i < gaussian_steps; ++i)\n {\n std::for_each(objects.begin(), objects.end(), [&] (const DetectedObject &object) {\n auto rects = object.area.rects(source.cols, source.rows);\n\n std::for_each(rects.begin(), rects.end(), [&] (const cv::Rect &rect) {\n cv::Mat region(source, rect);\n\n switch (algorithm) {\n case ALGORITHM_NONE:\n break;\n\n case ALGORITHM_GAUSSIAN:\n {\n GaussianBlur(\n region,\n region,\n cv::Size(gaussian_kernel_size, gaussian_kernel_size),\n 0,\n 0\n );\n }\n break;\n\n case ALGORITHM_PROGRESSIVE:\n {\n progblur ( \n source.data, \n source.cols, \n source.rows,\n source.channels(), \n rect.x,\n rect.y,\n rect.x + rect.width,\n rect.y + rect.height\n );\n }\n break;\n\n default:\n fprintf(stderr, \"Error: unsupported blur algorithm!\\n\");\n break;\n }\n });\n });\n }\n\n \/\/ Configure the quality level for jpeg images\n std::vector<int> compression_params;\n compression_params.push_back(CV_IMWRITE_JPEG_QUALITY);\n compression_params.push_back(100);\n\n \/\/ Resize the image if specified\n if(resize_width > 0 && resize_height > 0)\n {\n \/\/ Create the resized image\n cv::Size size(resize_width, resize_height);\n cv::Mat resized_image;\n cv::resize(source, resized_image, size);\n\n \/\/ save target file\n cv::imwrite(target_file, resized_image, compression_params);\n } else {\n \/\/ save target file\n cv::imwrite(target_file, source, compression_params);\n }\n\n return 0;\n}\n<commit_msg>Fixed yafdb-blurr blurring invalidated objects.<commit_after>\/*\n * yafdb - Yet Another Face Detection and Bluring\n *\n * Copyright (c) 2014 FOXEL SA - http:\/\/foxel.ch\n * Please read <http:\/\/foxel.ch\/license> for more information.\n *\n *\n * Author(s):\n *\n * Antony Ducommun <nitro@tmsrv.org>\n * Kevin Velickovic <k.velickovic@foxel.ch>\n *\n *\n * This file is part of the FOXEL project <http:\/\/foxel.ch>.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\n *\n * Additional Terms:\n *\n * You are required to preserve legal notices and author attributions in\n * that material or in the Appropriate Legal Notices displayed by works\n * containing it.\n *\n * You are required to attribute the work as explained in the \"Usage and\n * Attribution\" section of <http:\/\/foxel.ch\/license>.\n *\/\n\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#include <errno.h>\n#include <getopt.h>\n#include <math.h>\n\n#include \"detectors\/detector.hpp\"\n\n\n\/*\n * List of supported algorithms.\n *\n *\/\n\n#define ALGORITHM_NONE 0\n#define ALGORITHM_GAUSSIAN 1\n#define ALGORITHM_PROGRESSIVE 2\n\n\n\/*\n * Program arguments.\n *\n *\/\n\n#define OPTION_ALGORITHM 0\n#define OPTION_MERGE_MIN_OVERLAP 1\n#define OPTION_GAUSSIAN_KERNEL 2\n#define OPTION_GAUSSIAN_STEPS 3\n#define OPTION_RESIZE_WIDTH 4\n#define OPTION_RESIZE_HEIGHT 5\n\nstatic int resize_width = 0;\nstatic int resize_height = 0;\nstatic int algorithm = ALGORITHM_GAUSSIAN;\nstatic int merge_min_overlap = 1;\nstatic double gaussian_kernel_size = 65;\nstatic double gaussian_steps = 1;\nstatic const char *source_file = NULL;\nstatic const char *objects_file = NULL;\nstatic const char *target_file = NULL;\n\n\nstatic struct option options[] = {\n {\"algorithm\", required_argument, 0, 'a'},\n {\"merge-min-overlap\", required_argument, 0, 0 },\n {\"gaussian-kernel\", required_argument, 0, 0 },\n {\"gaussian-steps\", required_argument, 0, 0 },\n {\"resize-width\", required_argument, 0, 0 },\n {\"resize-height\", required_argument, 0, 0 },\n {0, 0, 0, 0}\n};\n\n\/\/! Progressive rectangular blurring\n\n\/\/! Apply a progresive blur on the desired rectangle.\n\/\/!\n\/\/! @param pbBitmap Bitmap array pointer to result image\n\/\/! @param pbSource Bitmap array pointer to source image\n\/\/! @param pbWidth Bitmap width, in pixels\n\/\/! @param pbHeight Bitmap height, in pixels\n\/\/! @param pbChannel Layer on which blur apply\n\/\/! @param pbRx1 Rectangle upper left corner x coordinates\n\/\/! @param pbRy1 Rectangle upper left corner y coordinates\n\/\/! @param pbRx2 Rectangle lower right corner x coordinates\n\/\/! @param pbRy2 Rectangle lower right corner y coordinates\n\nvoid progblur ( unsigned char * pbBitmap, int pbWidth, int pbHeight, int pbChannel, int pbRx1, int pbRy1, int pbRx2, int pbRy2 ) {\n\n \/* Parsing variables *\/\n int pbX = 0;\n int pbY = 0;\n int pbI = 0;\n int pbJ = 0;\n\n \/* Function parameters *\/\n float pbU = 0.0;\n float pbV = 0.0;\n\n \/* Area boudaries *\/\n int pbAX1 = 0;\n int pbAY1 = 0;\n int pbAX2 = 0;\n int pbAY2 = 0;\n\n \/* Compute rectangle size *\/\n int pbrWidth = ( pbRx2 - pbRx1 );\n int pbrHeight = ( pbRy2 - pbRy1 );\n\n \/* Compute rectangle center *\/\n float pbCX = ( float ) pbrWidth \/ 2.0 + pbRx1;\n float pbCY = ( float ) pbrHeight \/ 2.0 + pbRy1;\n\n \/* Compute automatic factor *\/\n float pbFactor = pbrWidth < pbrHeight ? pbrWidth : pbrHeight;\n\n \/* Chromaitc accumulator *\/\n float pbAccumR = 0.0;\n float pbAccumG = 0.0;\n float pbAccumB = 0.0;\n int pbForce = 0;\n int pbCount = 0;\n\n \/* Optimization for bitmap offset *\/\n unsigned char * pbOffset = NULL;\n\n \/* Optimization for bitmap sub-offset *\/\n int pbYOffset = 0;\n int pbJOffset = 0;\n\n \/* Increase rectangle size *\/\n pbRx1 = pbCX - pbFactor;\n pbRx2 = pbCX + pbFactor;\n pbRy1 = pbCY - pbFactor;\n pbRy2 = pbCY + pbFactor;\n\n \/* Recompute adapted width and height *\/\n pbrWidth = ( pbRx2 - pbRx1 );\n pbrHeight = ( pbRy2 - pbRy1 );\n\n \/* Optimization operation *\/\n pbFactor *= 0.2;\n\n \/* Blurring y-component loop *\/\n for ( pbY = pbRy1; pbY <= pbRy2; pbY ++ ) {\n\n \/* Compute optimization sub-offset *\/\n pbYOffset = pbChannel * pbWidth * pbY;\n\n \/* Compute coordinates v-parameters *\/\n pbV = ( ( float ) ( pbY - pbRy1 ) \/ pbrHeight ) * 2.0 - 1.0;\n\n \/* Blurring x-component loop *\/\n for ( pbX = pbRx1; pbX <= pbRx2; pbX ++ ) {\n\n \/* Reset chromatic accumulator *\/\n pbAccumR = 0.0;\n pbAccumG = 0.0;\n pbAccumB = 0.0; \n\n \/* Compute coordinates u-parameters *\/\n pbU = ( ( float ) ( pbX - pbRx1 ) \/ pbrWidth ) * 2.0 - 1.0;\n\n \/* Compute recursive condition value *\/\n pbForce = int( exp( - pbU * pbU * 3.5 ) * exp( - pbV * pbV * 3.5 ) * pbFactor );\n\n pbForce = ( pbForce > 32 ) ? 32 : pbForce;\n\n \/* Create area boundaries *\/\n pbAX1 = pbX - pbForce; pbAX1 = ( pbAX1 < 0 ) ? 0 : pbAX1;\n pbAX2 = pbX + pbForce; pbAX2 = ( pbAX2 >= pbWidth ) ? pbWidth - 1 : pbAX2;\n pbAY1 = pbY - pbForce; pbAY1 = ( pbAY1 < 0 ) ? 0 : pbAY1;\n pbAY2 = pbY + pbForce; pbAY2 = ( pbAY2 >= pbHeight ) ? pbHeight - 1 : pbAY2;\n\n \/* Accumulates y-components *\/\n for ( pbJ = pbAY1; pbJ <= pbAY2; pbJ ++ ) {\n\n \/* Compute optimization sub-offset *\/\n pbJOffset = pbChannel * pbWidth * pbJ;\n\n \/* Accumulates x-components *\/\n for ( pbI = pbAX1; pbI <= pbAX2; pbI ++ ) {\n\n \/* Compute optimiztion offset *\/\n pbOffset = pbBitmap + pbJOffset + pbChannel * pbI;\n\n \/* Accumulate chromatic value *\/\n pbAccumR += * ( pbOffset ++ );\n pbAccumG += * ( pbOffset ++ );\n pbAccumB += * ( pbOffset );\n\n }\n\n }\n\n \/* Compute number of considered pixels *\/\n pbCount = ( pbAX2 - pbAX1 + 1 ) * ( pbAY2 - pbAY1 + 1 );\n\n \/* Compute optimization offset *\/\n pbOffset = pbBitmap + pbYOffset + pbChannel * pbX;\n\n \/* Assign mean value *\/\n * ( pbOffset ++ ) = pbAccumR \/ pbCount;\n * ( pbOffset ++ ) = pbAccumG \/ pbCount;\n * ( pbOffset ) = pbAccumB \/ pbCount;\n\n }\n\n }\n\n}\n\n\n\/**\n * Display program usage.\n *\n *\/\nvoid usage() {\n printf(\"yafdb-blur --algorithm algo input-image.tiff input-objects.yaml output-image.tiff\\n\\n\");\n\n printf(\"Blurs detected objects and write modified image as output.\\n\\n\");\n\n printf(\"General options:\\n\\n\");\n printf(\"--algorithm algo : algorithm to use for blurring ('gaussian', 'progressive')\\n\");\n printf(\"--merge-min-overlap 1 : minimum occurrence of overlap to keep detected objects\\n\");\n printf(\"\\n\");\n\n printf(\"Gaussian options:\\n\\n\");\n printf(\"--gaussian-kernel 65 : gaussian kernel size\\n\");\n printf(\"--gaussian-steps 1 : gaussian blurring steps\\n\");\n printf(\"\\n\");\n\n printf(\"Resizing options:\\n\\n\");\n printf(\"--resize-width 800: Resizing width\\n\");\n printf(\"--resize-height 600: Resizing height\\n\");\n printf(\"\\n\");\n}\n\n\n\/**\n * Program entry-point.\n *\n *\/\nint main(int argc, char **argv) {\n \/\/ parse arguments\n while (true) {\n int index = -1;\n\n getopt_long(argc, argv, \"\", options, &index);\n if (index == -1) {\n if (argc != optind + 3) {\n usage();\n return 1;\n }\n\n source_file = argv[optind++];\n if (access(source_file, R_OK)) {\n fprintf(stderr, \"Error: source file not readable: %s\\n\", source_file);\n return 2;\n }\n\n objects_file = argv[optind++];\n if (access(objects_file, R_OK)) {\n fprintf(stderr, \"Error: detected objects file not readable: %s\\n\", objects_file);\n return 2;\n }\n\n target_file = argv[optind++];\n if (access(target_file, W_OK) && errno == EACCES) {\n fprintf(stderr, \"Error: target file not writable: %s\\n\", target_file);\n return 2;\n }\n break;\n }\n\n switch (index) {\n case OPTION_ALGORITHM:\n if (strcmp(optarg, \"none\") == 0) {\n algorithm = ALGORITHM_NONE;\n } else if (strcmp(optarg, \"gaussian\") == 0) {\n algorithm = ALGORITHM_GAUSSIAN;\n } else if (strcmp(optarg, \"progressive\") == 0) {\n algorithm = ALGORITHM_PROGRESSIVE;\n } else {\n fprintf(stderr, \"Error: unsupported algorithm: %s\\n\", optarg);\n }\n break;\n\n case OPTION_MERGE_MIN_OVERLAP:\n merge_min_overlap = atoi(optarg);\n break;\n\n case OPTION_GAUSSIAN_KERNEL:\n gaussian_kernel_size = atof(optarg);\n break;\n case OPTION_GAUSSIAN_STEPS:\n gaussian_steps = atof(optarg);\n break;\n case OPTION_RESIZE_WIDTH:\n resize_width = atoi(optarg);\n break;\n case OPTION_RESIZE_HEIGHT:\n resize_height = atoi(optarg);\n break;\n\n default:\n usage();\n return 1;\n }\n }\n\n \/\/ read source file\n cv::Mat source = cv::imread(source_file);\n\n if (source.rows <= 0 || source.cols <= 0) {\n fprintf(stderr, \"Error: cannot read image in source file: %s\\n\", source_file);\n return 2;\n }\n\n \/\/ read detected objects\n std::list<DetectedObject> objects;\n\n if (!ObjectDetector::load(objects_file, objects)) {\n fprintf(stderr, \"Error: cannot read objects in file: %s\\n\", objects_file);\n return 2;\n }\n\n \/\/ merge detected objects\n ObjectDetector::merge(objects, merge_min_overlap);\n\n \/\/ apply blur operation\n for (int i = 0; i < gaussian_steps; ++i)\n {\n std::for_each(objects.begin(), objects.end(), [&] (const DetectedObject &object) {\n if(object.falsePositive != \"Yes\")\n {\n auto rects = object.area.rects(source.cols, source.rows);\n\n std::for_each(rects.begin(), rects.end(), [&] (const cv::Rect &rect) {\n cv::Mat region(source, rect);\n\n switch (algorithm) {\n case ALGORITHM_NONE:\n break;\n\n case ALGORITHM_GAUSSIAN:\n {\n GaussianBlur(\n region,\n region,\n cv::Size(gaussian_kernel_size, gaussian_kernel_size),\n 0,\n 0\n );\n }\n break;\n\n case ALGORITHM_PROGRESSIVE:\n {\n progblur ( \n source.data, \n source.cols, \n source.rows,\n source.channels(), \n rect.x,\n rect.y,\n rect.x + rect.width,\n rect.y + rect.height\n );\n }\n break;\n\n default:\n fprintf(stderr, \"Error: unsupported blur algorithm!\\n\");\n break;\n }\n });\n }\n });\n }\n\n \/\/ Configure the quality level for jpeg images\n std::vector<int> compression_params;\n compression_params.push_back(CV_IMWRITE_JPEG_QUALITY);\n compression_params.push_back(100);\n\n \/\/ Resize the image if specified\n if(resize_width > 0 && resize_height > 0)\n {\n \/\/ Create the resized image\n cv::Size size(resize_width, resize_height);\n cv::Mat resized_image;\n cv::resize(source, resized_image, size);\n\n \/\/ save target file\n cv::imwrite(target_file, resized_image, compression_params);\n } else {\n \/\/ save target file\n cv::imwrite(target_file, source, compression_params);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <girepository.h>\n#include <glib.h>\n\n#include \"boxed.h\"\n#include \"debug.h\"\n#include \"function.h\"\n#include \"gi.h\"\n#include \"gobject.h\"\n#include \"type.h\"\n#include \"util.h\"\n#include \"value.h\"\n\nusing v8::Array;\nusing v8::External;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Isolate;\nusing v8::Local;\nusing v8::Number;\nusing v8::Object;\nusing v8::String;\nusing v8::Persistent;\nusing Nan::New;\nusing Nan::WeakCallbackType;\n\nnamespace GNodeJS {\n\n\n\n\nsize_t Boxed::GetSize (GIBaseInfo *boxed_info) {\n GIInfoType i_type = g_base_info_get_type(boxed_info);\n if (i_type == GI_INFO_TYPE_STRUCT) {\n return g_struct_info_get_size((GIStructInfo*)boxed_info);\n } else if (i_type == GI_INFO_TYPE_UNION) {\n return g_union_info_get_size((GIUnionInfo*)boxed_info);\n } else {\n g_assert_not_reached();\n }\n}\n\nstatic bool IsNoArgsConstructor(GIFunctionInfo *info) {\n auto flags = g_function_info_get_flags (info);\n return ((flags & GI_FUNCTION_IS_CONSTRUCTOR) != 0\n && g_callable_info_get_n_args (info) == 0);\n}\n\nstatic GIFunctionInfo* FindBoxedConstructor(GIBaseInfo* info) {\n if (GI_IS_STRUCT_INFO (info)) {\n int n_methods = g_struct_info_get_n_methods (info);\n for (int i = 0; i < n_methods; i++) {\n GIFunctionInfo* fn_info = g_struct_info_get_method (info, i);\n if (IsNoArgsConstructor (fn_info))\n return fn_info;\n g_base_info_unref(fn_info);\n }\n }\n else {\n int n_methods = g_union_info_get_n_methods (info);\n for (int i = 0; i < n_methods; i++) {\n GIFunctionInfo* fn_info = g_union_info_get_method (info, i);\n if (IsNoArgsConstructor (fn_info))\n return fn_info;\n g_base_info_unref(fn_info);\n }\n }\n return NULL;\n}\n\nstatic void BoxedDestroyed(const Nan::WeakCallbackInfo<Boxed> &info);\n\nstatic void BoxedConstructor(const Nan::FunctionCallbackInfo<Value> &info) {\n \/* See gobject.cc for how this works *\/\n if (!info.IsConstructCall ()) {\n Nan::ThrowTypeError(\"Not a construct call\");\n return;\n }\n\n void *boxed = NULL;\n unsigned long size = 0;\n\n Local<Object> self = info.This ();\n GIBaseInfo *gi_info = (GIBaseInfo *) External::Cast (*info.Data ())->Value ();\n GType gtype = g_registered_type_info_get_g_type (gi_info);\n\n if (info[0]->IsExternal ()) {\n \/* The External case. This is how WrapperFromBoxed is called. *\/\n\n boxed = External::Cast(*info[0])->Value();\n\n } else {\n \/* User code calling `new Pango.AttrList()` *\/\n\n size = Boxed::GetSize(gi_info);\n\n if (size != 0) {\n boxed = g_slice_alloc0(size);\n }\n \/* TODO(find what to do in these cases)\n else {\n GIFunctionInfo* fn_info = FindBoxedConstructor(gi_info);\n\n if (fn_info != NULL) {\n GError *error = NULL;\n GIArgument return_value;\n g_function_info_invoke (fn_info,\n NULL, 0, NULL, 0, &return_value, &error);\n g_base_info_unref(fn_info);\n\n if (error != NULL) {\n Util::ThrowGError(\"Boxed allocation failed\", error);\n return;\n }\n\n boxed = return_value.v_pointer;\n }\n } *\/\n\n if (!boxed) {\n Nan::ThrowError(\"Boxed allocation failed\");\n return;\n }\n }\n\n self->SetAlignedPointerInInternalField (0, boxed);\n\n Nan::DefineOwnProperty(self,\n UTF8(\"__gtype__\"),\n Nan::New<Number>(gtype),\n (v8::PropertyAttribute)(v8::PropertyAttribute::ReadOnly | v8::PropertyAttribute::DontEnum)\n );\n\n auto* box = new Boxed();\n box->data = boxed;\n box->size = size;\n box->g_type = gtype;\n box->persistent = new Nan::Persistent<Object>(self);\n box->persistent->SetWeak(box, BoxedDestroyed, Nan::WeakCallbackType::kParameter);\n}\n\nstatic void BoxedDestroyed(const Nan::WeakCallbackInfo<Boxed> &info) {\n Boxed *box = info.GetParameter();\n\n if (G_TYPE_IS_BOXED(box->g_type)) {\n g_boxed_free(box->g_type, box->data);\n }\n else if (box->size != 0) {\n \/\/ Allocated in .\/function.cc @ AllocateArgument\n g_slice_free1(box->size, box->data);\n }\n else if (box->data != NULL) {\n \/*\n * TODO(find informations on what to do here. Only seems to be reached for GI.Typelib)\n *\/\n log(\"boxed possibly not freed\");\n }\n\n delete box->persistent;\n delete box;\n}\n\n\nLocal<FunctionTemplate> GetBoxedTemplate(GIBaseInfo *info, GType gtype) {\n void *data = NULL;\n\n if (gtype != G_TYPE_NONE) {\n data = g_type_get_qdata(gtype, GNodeJS::template_quark());\n }\n\n \/*\n * Template already created\n *\/\n\n if (data) {\n Persistent<FunctionTemplate> *persistent = (Persistent<FunctionTemplate> *) data;\n Local<FunctionTemplate> tpl = Nan::New<FunctionTemplate> (*persistent);\n return tpl;\n }\n\n \/*\n * Template not created yet\n *\/\n\n auto tpl = New<FunctionTemplate>(BoxedConstructor, New<External>(info));\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n if (gtype != G_TYPE_NONE) {\n const char *class_name = g_type_name(gtype);\n tpl->SetClassName (UTF8(class_name));\n } else {\n const char *class_name = g_base_info_get_name (info);\n tpl->SetClassName (UTF8(class_name));\n }\n\n if (gtype == G_TYPE_NONE)\n return tpl;\n\n Isolate *isolate = Isolate::GetCurrent();\n auto *persistent = new v8::Persistent<FunctionTemplate>(isolate, tpl);\n persistent->SetWeak(\n g_base_info_ref(info),\n GNodeJS::ClassDestroyed,\n WeakCallbackType::kParameter);\n\n g_type_set_qdata(gtype, GNodeJS::template_quark(), persistent);\n\n return tpl;\n}\n\nLocal<Function> MakeBoxedClass(GIBaseInfo *info) {\n GType gtype = g_registered_type_info_get_g_type ((GIRegisteredTypeInfo *) info);\n\n if (gtype == G_TYPE_NONE) {\n auto moduleCache = GNodeJS::GetModuleCache();\n auto ns = UTF8 (g_base_info_get_namespace (info));\n auto name = UTF8 (g_base_info_get_name (info));\n\n if (Nan::HasOwnProperty(moduleCache, ns).FromMaybe(false)) {\n auto module = Nan::Get(moduleCache, ns).ToLocalChecked()->ToObject();\n\n if (Nan::HasOwnProperty(module, name).FromMaybe(false)) {\n auto constructor = Nan::Get(module, name).ToLocalChecked()->ToObject();\n return Local<Function>::Cast (constructor);\n }\n }\n }\n\n Local<FunctionTemplate> tpl = GetBoxedTemplate (info, gtype);\n return tpl->GetFunction ();\n}\n\nLocal<Value> WrapperFromBoxed(GIBaseInfo *info, void *data) {\n if (data == NULL)\n return Nan::Null();\n\n Local<Function> constructor = MakeBoxedClass (info);\n\n Local<Value> boxed_external = Nan::New<External> (data);\n Local<Value> args[] = { boxed_external };\n \/\/ FIXME(we're not handling failure here)\n MaybeLocal<Object> instance = Nan::NewInstance(constructor, 1, args);\n return instance.ToLocalChecked();\n}\n\nvoid* BoxedFromWrapper(Local<Value> value) {\n Local<Object> object = value->ToObject ();\n g_assert(object->InternalFieldCount() > 0);\n void *boxed = object->GetAlignedPointerFromInternalField(0);\n return boxed;\n}\n\n};\n<commit_msg>boxed: use \"new\" method as constructor if available<commit_after>\n#include <girepository.h>\n#include <glib.h>\n\n#include \"boxed.h\"\n#include \"debug.h\"\n#include \"function.h\"\n#include \"gi.h\"\n#include \"gobject.h\"\n#include \"type.h\"\n#include \"util.h\"\n#include \"value.h\"\n\nusing v8::Array;\nusing v8::External;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Isolate;\nusing v8::Local;\nusing v8::Number;\nusing v8::Object;\nusing v8::String;\nusing v8::Persistent;\nusing Nan::New;\nusing Nan::WeakCallbackType;\n\nnamespace GNodeJS {\n\n\n\n\nsize_t Boxed::GetSize (GIBaseInfo *boxed_info) {\n GIInfoType i_type = g_base_info_get_type(boxed_info);\n if (i_type == GI_INFO_TYPE_STRUCT) {\n return g_struct_info_get_size((GIStructInfo*)boxed_info);\n } else if (i_type == GI_INFO_TYPE_UNION) {\n return g_union_info_get_size((GIUnionInfo*)boxed_info);\n } else {\n g_assert_not_reached();\n }\n}\n\nstatic bool IsNoArgsConstructor(GIFunctionInfo *info) {\n auto flags = g_function_info_get_flags (info);\n return ((flags & GI_FUNCTION_IS_CONSTRUCTOR) != 0\n && g_callable_info_get_n_args (info) == 0);\n}\n\nstatic GIFunctionInfo* FindBoxedConstructor(GIBaseInfo* info) {\n if (GI_IS_STRUCT_INFO (info)) {\n int n_methods = g_struct_info_get_n_methods (info);\n for (int i = 0; i < n_methods; i++) {\n GIFunctionInfo* fn_info = g_struct_info_get_method (info, i);\n if (IsNoArgsConstructor (fn_info))\n return fn_info;\n g_base_info_unref(fn_info);\n }\n\n return g_struct_info_find_method(info, \"new\");\n }\n else {\n int n_methods = g_union_info_get_n_methods (info);\n for (int i = 0; i < n_methods; i++) {\n GIFunctionInfo* fn_info = g_union_info_get_method (info, i);\n if (IsNoArgsConstructor (fn_info))\n return fn_info;\n g_base_info_unref(fn_info);\n }\n\n return g_union_info_find_method(info, \"new\");\n }\n}\n\nstatic void BoxedDestroyed(const Nan::WeakCallbackInfo<Boxed> &info);\n\nstatic void BoxedConstructor(const Nan::FunctionCallbackInfo<Value> &info) {\n \/* See gobject.cc for how this works *\/\n if (!info.IsConstructCall ()) {\n Nan::ThrowTypeError(\"Not a construct call\");\n return;\n }\n\n void *boxed = NULL;\n unsigned long size = 0;\n\n Local<Object> self = info.This ();\n GIBaseInfo *gi_info = (GIBaseInfo *) External::Cast (*info.Data ())->Value ();\n GType gtype = g_registered_type_info_get_g_type (gi_info);\n\n if (info[0]->IsExternal ()) {\n \/* The External case. This is how WrapperFromBoxed is called. *\/\n\n boxed = External::Cast(*info[0])->Value();\n\n } else {\n \/* User code calling `new Pango.AttrList()` *\/\n\n size = Boxed::GetSize(gi_info);\n\n if (size != 0) {\n boxed = g_slice_alloc0(size);\n }\n \/\/ TODO(find what to do in these cases)\n \/* else {\n GIFunctionInfo* fn_info = FindBoxedConstructor(gi_info);\n\n if (fn_info != NULL) {\n\n auto value = CallFunctionInfo (fn_info, info);\n\n if (value.IsEmpty())\n return; \/\/ did throw\n\n GIArgument arg;\n\n if (V8ToGIArgument(gi_info, &arg, value))\n boxed = arg.v_pointer;\n else\n return; \/\/ did throw\n\n } else {\n log(\"constructor not found\");\n }\n } *\/\n\n if (!boxed) {\n Nan::ThrowError(\"Boxed allocation failed\");\n return;\n }\n }\n\n self->SetAlignedPointerInInternalField (0, boxed);\n\n Nan::DefineOwnProperty(self,\n UTF8(\"__gtype__\"),\n Nan::New<Number>(gtype),\n (v8::PropertyAttribute)(v8::PropertyAttribute::ReadOnly | v8::PropertyAttribute::DontEnum)\n );\n\n auto* box = new Boxed();\n box->data = boxed;\n box->size = size;\n box->g_type = gtype;\n box->persistent = new Nan::Persistent<Object>(self);\n box->persistent->SetWeak(box, BoxedDestroyed, Nan::WeakCallbackType::kParameter);\n}\n\nstatic void BoxedDestroyed(const Nan::WeakCallbackInfo<Boxed> &info) {\n Boxed *box = info.GetParameter();\n\n if (G_TYPE_IS_BOXED(box->g_type)) {\n g_boxed_free(box->g_type, box->data);\n }\n else if (box->size != 0) {\n \/\/ Allocated in .\/function.cc @ AllocateArgument\n g_slice_free1(box->size, box->data);\n }\n else if (box->data != NULL) {\n \/*\n * TODO(find informations on what to do here. Only seems to be reached for GI.Typelib)\n *\/\n log(\"boxed possibly not freed\");\n }\n\n delete box->persistent;\n delete box;\n}\n\n\nLocal<FunctionTemplate> GetBoxedTemplate(GIBaseInfo *info, GType gtype) {\n void *data = NULL;\n\n if (gtype != G_TYPE_NONE) {\n data = g_type_get_qdata(gtype, GNodeJS::template_quark());\n }\n\n \/*\n * Template already created\n *\/\n\n if (data) {\n Persistent<FunctionTemplate> *persistent = (Persistent<FunctionTemplate> *) data;\n Local<FunctionTemplate> tpl = Nan::New<FunctionTemplate> (*persistent);\n return tpl;\n }\n\n \/*\n * Template not created yet\n *\/\n\n auto tpl = New<FunctionTemplate>(BoxedConstructor, New<External>(info));\n tpl->InstanceTemplate()->SetInternalFieldCount(1);\n\n if (gtype != G_TYPE_NONE) {\n const char *class_name = g_type_name(gtype);\n tpl->SetClassName (UTF8(class_name));\n } else {\n const char *class_name = g_base_info_get_name (info);\n tpl->SetClassName (UTF8(class_name));\n }\n\n if (gtype == G_TYPE_NONE)\n return tpl;\n\n Isolate *isolate = Isolate::GetCurrent();\n auto *persistent = new v8::Persistent<FunctionTemplate>(isolate, tpl);\n persistent->SetWeak(\n g_base_info_ref(info),\n GNodeJS::ClassDestroyed,\n WeakCallbackType::kParameter);\n\n g_type_set_qdata(gtype, GNodeJS::template_quark(), persistent);\n\n return tpl;\n}\n\nLocal<Function> MakeBoxedClass(GIBaseInfo *info) {\n GType gtype = g_registered_type_info_get_g_type ((GIRegisteredTypeInfo *) info);\n\n if (gtype == G_TYPE_NONE) {\n auto moduleCache = GNodeJS::GetModuleCache();\n auto ns = UTF8 (g_base_info_get_namespace (info));\n auto name = UTF8 (g_base_info_get_name (info));\n\n if (Nan::HasOwnProperty(moduleCache, ns).FromMaybe(false)) {\n auto module = Nan::Get(moduleCache, ns).ToLocalChecked()->ToObject();\n\n if (Nan::HasOwnProperty(module, name).FromMaybe(false)) {\n auto constructor = Nan::Get(module, name).ToLocalChecked()->ToObject();\n return Local<Function>::Cast (constructor);\n }\n }\n }\n\n Local<FunctionTemplate> tpl = GetBoxedTemplate (info, gtype);\n return tpl->GetFunction ();\n}\n\nLocal<Value> WrapperFromBoxed(GIBaseInfo *info, void *data) {\n if (data == NULL)\n return Nan::Null();\n\n Local<Function> constructor = MakeBoxedClass (info);\n\n Local<Value> boxed_external = Nan::New<External> (data);\n Local<Value> args[] = { boxed_external };\n \/\/ FIXME(we're not handling failure here)\n MaybeLocal<Object> instance = Nan::NewInstance(constructor, 1, args);\n return instance.ToLocalChecked();\n}\n\nvoid* BoxedFromWrapper(Local<Value> value) {\n Local<Object> object = value->ToObject ();\n g_assert(object->InternalFieldCount() > 0);\n void *boxed = object->GetAlignedPointerFromInternalField(0);\n return boxed;\n}\n\n};\n<|endoftext|>"} {"text":"<commit_before>#include \"game.hpp\"\r\n\r\nbool Game::uciHandler(std::string str) {\r\n\tstd::vector<std::string> cmd = getStringArray(str);\r\n\t\tif(cmd[0] == \"isready\") {\r\n\t\t\tstd::cout << \"readyok\" << std::endl;\r\n\t\t} else if(cmd[0] == \"position\") {\r\n\t\t\tgameHash.clear();\r\n\t\t\tgameHash.resize(0);\r\n\t\t\thash_decrement = 0;\r\n\t\t\tif(cmd[1] == \"startpos\") {\r\n\t\t\t\tgame_board.setFen(game_board.startpos_fen);\r\n\t\t\t\thash_decrement = 0;\r\n\t\t\t\thashAge = 0;\r\n\t\t\t\tif(cmd.size() > 3) {\r\n\t\t\t\t\tif(cmd[2] == \"moves\") {\r\n\t\t\t\t\t\tfor(unsigned int i = 3; i < cmd.size(); ++i) {\r\n\t\t\t\t\t\t\tmove(cmd[i]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} else if(cmd[1] == \"fen\") {\r\n\t\t\t\tstd::string fen;\r\n\t\t\t\tunsigned int pos = 2;\r\n\r\n\t\t\t\tfor(unsigned int i = 2; i < 8; ++i) {\r\n\t\t\t\t\tfen += cmd[i];\r\n\t\t\t\t\tif(i != cmd.size() - 1) {\r\n\t\t\t\t\t\tfen.push_back(' ');\r\n\t\t\t\t\t}\r\n\t\t\t\t\t++pos;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tgame_board.setFen(fen);\r\n\t\t\t\tif(cmd.size() > pos) {\r\n\t\t\t\t\tif(cmd[pos] == \"moves\") {\r\n\t\t\t\t\t\tfor(unsigned int i = pos + 1; i < cmd.size(); ++i) {\r\n\t\t\t\t\t\t\tmove(cmd[i]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"go\") {\r\n\t\t\tif(cmd[1] == \"depth\") {\r\n\t\t\t\tmax_depth = std::stoi(cmd[2]);\r\n\t\t\t goFixedDepth();\r\n\t\t\t} else if(cmd[1] == \"movetime\") {\r\n\t\t\t\tgoFixedTime(std::stoll(cmd[2]), false);\r\n\t\t\t} else if(cmd[1] == \"infinite\") {\r\n\t\t\t\tmax_depth = 99;\r\n\t\t\t\tgoFixedDepth();\r\n\t\t\t} else {\r\n\t\t\t\twtime = 0, btime = 0;\r\n\t\t\t\twinc = 0, binc = 0, movestogo = 0, movestogoEnable = false;\r\n\t\t\t\tfor(unsigned int i = 1; i < cmd.size(); ++i) {\r\n\t\t\t\t\tif(cmd[i] == \"wtime\") {\r\n\t\t\t\t\t\twtime = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"btime\") {\r\n\t\t\t\t\t\tbtime = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"winc\") {\r\n\t\t\t\t\t\twinc = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"binc\") {\r\n\t\t\t\t\t\tbinc = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"movestogo\") {\r\n\t\t\t\t\t\tmovestogoEnable = true;\r\n\t\t\t\t\t\tmovestogo = std::stoi(cmd[i+1]);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tgoTournament();\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"posmoves\") {\r\n\t\t\tMoveArray moves;\r\n\t\t\tgame_board.bitBoardMoveGenerator(moves, stress);\r\n\r\n\t\t\tfor(unsigned int i = 0; i < moves.count; ++i) {\r\n\t\t\t\tstd::cout << moves.moveArray[i].getMoveString();\r\n\t\t\t\tstd::cout << std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tstd::cout << game_board.getEvaluate() \/ PAWN_EV.mg * 100 << std::endl;\r\n\t\t\tstd::cout << game_board.getFen() << std::endl;\r\n\r\n\t\t\tstd::cout << \"inCheck (WHITE) : \" << game_board.inCheck(WHITE) << std::endl;\r\n\t\t\tstd::cout << \"inCheck (BLACK) : \" << game_board.inCheck(BLACK) << std::endl;\r\n\t\t\tstd::cout << \"color_hash: \" << game_board.getColorHash() << std::endl;\r\n\t\t} else if(cmd[0] == \"move\") {\r\n\t\t\tmove(cmd[1]);\r\n\t\t} else if(cmd[0] == \"quit\") {\r\n\t\t\treturn false;\r\n\t\t} else if(cmd[0] == \"uci\") {\r\n\t\t\tidPrint();\r\n\t\t\toption.print();\r\n\t\t\tstd::cout << \"uciok\" << std::endl;\r\n\t\t} else if(cmd[0] == \"bench\") {\r\n\t\t\tstd::cout << \"Benchmarking (15 sec)...\" << std::endl;\r\n\t\t\tgame_board.stress = 0;\r\n\t\t\tdouble st = clock();\r\n\t\t\twhile((clock() - st) \/ CLOCKS_PER_SEC < 15) {\r\n\t\t\t\tfor(unsigned int i = 0; i < 10000000; ++i) {\r\n\t\t\t\t\tgame_board.bitBoardMoveGenerator(moveArray[0], game_board.stress);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tstd::cout << (int64_t)(game_board.stress \/ ((clock() - st) \/ CLOCKS_PER_SEC)) \/ 10000 << \" scores\" << std::endl;\r\n\t\t} else if(cmd[0] == \"goback\") {\r\n\t\t\tgame_board.goBack();\r\n\t\t\t--hash_decrement;\r\n\t\t} else if(cmd[0] == \"perft\") {\r\n\t\t\tint k;\r\n\t\t\tk = std::stoi(cmd[1]);\r\n\t\t\tfor(int i = 1; i <= k; ++i) {\r\n\t\t\t\tcombinations = 0;\r\n\t\t\t\tdouble st = clock();\r\n\t\t\t\tuint64_t count = perft(i);\r\n\t\t\t\tstd::cout << \"Depth: \" << i << \"; count: \" << combinations;\r\n\t\t\t\tstd::cout << \"; speed: \" << (int64_t)((double)count \/ (((double)clock() - (double)st) \/ (double)CLOCKS_PER_SEC)) << std::endl;\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"setoption\" && cmd[1] == \"name\") {\r\n\t\t\tif(cmd[2] == \"Clear\" && cmd[3] == \"Hash\") {\r\n\t\t\t\tclearCash();\r\n\t\t\t\tstd::cout << \"info hashfull 0\" << std::endl;\r\n\t\t\t} else if(cmd[2] == \"Hash\" && cmd[3] == \"value\") {\r\n\t\t\t\tint hash_size = std::stoi(cmd[4]);\r\n\r\n\t\t\t\thash_size = std::min(hash_size, option.max_hash_size);\r\n\t\t\t\thash_size = std::max(hash_size, option.min_hash_size);\r\n\r\n\t\t\t\tsetHashSize(hash_size);\r\n\t\t\t} else if(cmd[2] == \"Move\" && cmd[3] == \"Overhead\" && cmd[4] == \"value\") {\r\n\t\t\t\toption.moveOverhead = std::stoi(cmd[5]);\r\n\t\t\t\toption.moveOverhead = std::min(option.moveOverhead, option.maxMoveOverhead);\r\n\t\t\t\toption.moveOverhead = std::max(option.moveOverhead, option.minMoveOverhead);\r\n\t\t\t} else if(cmd[2] == \"UCI_AnalyseMode\" && cmd[3] == \"value\") {\r\n\t\t\t\tif(cmd[4] == \"true\") {\r\n\t\t\t\t\toption.UCI_AnalyseMode = true;\r\n\t\t\t\t} else if(cmd[4] == \"false\") {\r\n\t\t\t\t\toption.UCI_AnalyseMode = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn true;\r\n}\r\n\r\nvoid Game::idPrint() {\r\n\tstd::cout << \"id name Zevra v1.8.2 r612\" << std::endl;\r\n\tstd::cout << \"id author Oleg Smirnov @sovaz1997\" << std::endl;\r\n}<commit_msg>32.44 +\/- 13.98 elo 10+0.1 (while not in infinite mode)<commit_after>#include \"game.hpp\"\r\n\r\nbool Game::uciHandler(std::string str) {\r\n\tstd::vector<std::string> cmd = getStringArray(str);\r\n\t\tif(cmd[0] == \"isready\") {\r\n\t\t\tstd::cout << \"readyok\" << std::endl;\r\n\t\t} else if(cmd[0] == \"position\") {\r\n\t\t\tgameHash.clear();\r\n\t\t\tgameHash.resize(0);\r\n\t\t\thash_decrement = 0;\r\n\t\t\tif(cmd[1] == \"startpos\") {\r\n\t\t\t\tgame_board.setFen(game_board.startpos_fen);\r\n\t\t\t\thash_decrement = 0;\r\n\t\t\t\thashAge = 0;\r\n\t\t\t\tif(cmd.size() > 3) {\r\n\t\t\t\t\tif(cmd[2] == \"moves\") {\r\n\t\t\t\t\t\tfor(unsigned int i = 3; i < cmd.size(); ++i) {\r\n\t\t\t\t\t\t\tmove(cmd[i]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t} else if(cmd[1] == \"fen\") {\r\n\t\t\t\tstd::string fen;\r\n\t\t\t\tunsigned int pos = 2;\r\n\r\n\t\t\t\tfor(unsigned int i = 2; i < 8; ++i) {\r\n\t\t\t\t\tfen += cmd[i];\r\n\t\t\t\t\tif(i != cmd.size() - 1) {\r\n\t\t\t\t\t\tfen.push_back(' ');\r\n\t\t\t\t\t}\r\n\t\t\t\t\t++pos;\r\n\t\t\t\t}\r\n\r\n\t\t\t\tgame_board.setFen(fen);\r\n\t\t\t\tif(cmd.size() > pos) {\r\n\t\t\t\t\tif(cmd[pos] == \"moves\") {\r\n\t\t\t\t\t\tfor(unsigned int i = pos + 1; i < cmd.size(); ++i) {\r\n\t\t\t\t\t\t\tmove(cmd[i]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"go\") {\r\n\t\t\tif(cmd[1] == \"depth\") {\r\n\t\t\t\tmax_depth = std::stoi(cmd[2]);\r\n\t\t\t goFixedDepth();\r\n\t\t\t} else if(cmd[1] == \"movetime\") {\r\n\t\t\t\tgoFixedTime(std::stoll(cmd[2]), false);\r\n\t\t\t} else if(cmd[1] == \"infinite\") {\r\n\t\t\t\tmax_depth = 99;\r\n\t\t\t\tgoFixedDepth();\r\n\t\t\t} else {\r\n\t\t\t\twtime = 0, btime = 0;\r\n\t\t\t\twinc = 0, binc = 0, movestogo = 0, movestogoEnable = false;\r\n\t\t\t\tfor(unsigned int i = 1; i < cmd.size(); ++i) {\r\n\t\t\t\t\tif(cmd[i] == \"wtime\") {\r\n\t\t\t\t\t\twtime = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"btime\") {\r\n\t\t\t\t\t\tbtime = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"winc\") {\r\n\t\t\t\t\t\twinc = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"binc\") {\r\n\t\t\t\t\t\tbinc = std::stoll(cmd[i + 1]);\r\n\t\t\t\t\t} else if(cmd[i] == \"movestogo\") {\r\n\t\t\t\t\t\tmovestogoEnable = true;\r\n\t\t\t\t\t\tmovestogo = std::stoi(cmd[i+1]);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tgoTournament();\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"posmoves\") {\r\n\t\t\tMoveArray moves;\r\n\t\t\tgame_board.bitBoardMoveGenerator(moves, stress);\r\n\r\n\t\t\tfor(unsigned int i = 0; i < moves.count; ++i) {\r\n\t\t\t\tstd::cout << moves.moveArray[i].getMoveString();\r\n\t\t\t\tstd::cout << std::endl;\r\n\t\t\t}\r\n\r\n\t\t\tstd::cout << game_board.getEvaluate() \/ PAWN_EV.mg * 100 << std::endl;\r\n\t\t\tstd::cout << game_board.getFen() << std::endl;\r\n\r\n\t\t\tstd::cout << \"inCheck (WHITE) : \" << game_board.inCheck(WHITE) << std::endl;\r\n\t\t\tstd::cout << \"inCheck (BLACK) : \" << game_board.inCheck(BLACK) << std::endl;\r\n\t\t\tstd::cout << \"color_hash: \" << game_board.getColorHash() << std::endl;\r\n\t\t} else if(cmd[0] == \"move\") {\r\n\t\t\tmove(cmd[1]);\r\n\t\t} else if(cmd[0] == \"quit\") {\r\n\t\t\treturn false;\r\n\t\t} else if(cmd[0] == \"uci\") {\r\n\t\t\tidPrint();\r\n\t\t\toption.print();\r\n\t\t\tstd::cout << \"uciok\" << std::endl;\r\n\t\t} else if(cmd[0] == \"bench\") {\r\n\t\t\tstd::cout << \"Benchmarking (15 sec)...\" << std::endl;\r\n\t\t\tgame_board.stress = 0;\r\n\t\t\tdouble st = clock();\r\n\t\t\twhile((clock() - st) \/ CLOCKS_PER_SEC < 15) {\r\n\t\t\t\tfor(unsigned int i = 0; i < 10000000; ++i) {\r\n\t\t\t\t\tgame_board.bitBoardMoveGenerator(moveArray[0], game_board.stress);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tstd::cout << (int64_t)(game_board.stress \/ ((clock() - st) \/ CLOCKS_PER_SEC)) \/ 10000 << \" scores\" << std::endl;\r\n\t\t} else if(cmd[0] == \"goback\") {\r\n\t\t\tgame_board.goBack();\r\n\t\t\t--hash_decrement;\r\n\t\t} else if(cmd[0] == \"perft\") {\r\n\t\t\tint k;\r\n\t\t\tk = std::stoi(cmd[1]);\r\n\t\t\tfor(int i = 1; i <= k; ++i) {\r\n\t\t\t\tcombinations = 0;\r\n\t\t\t\tdouble st = clock();\r\n\t\t\t\tuint64_t count = perft(i);\r\n\t\t\t\tstd::cout << \"Depth: \" << i << \"; count: \" << combinations;\r\n\t\t\t\tstd::cout << \"; speed: \" << (int64_t)((double)count \/ (((double)clock() - (double)st) \/ (double)CLOCKS_PER_SEC)) << std::endl;\r\n\t\t\t}\r\n\t\t} else if(cmd[0] == \"setoption\" && cmd[1] == \"name\") {\r\n\t\t\tif(cmd[2] == \"Clear\" && cmd[3] == \"Hash\") {\r\n\t\t\t\tclearCash();\r\n\t\t\t\tstd::cout << \"info hashfull 0\" << std::endl;\r\n\t\t\t} else if(cmd[2] == \"Hash\" && cmd[3] == \"value\") {\r\n\t\t\t\tint hash_size = std::stoi(cmd[4]);\r\n\r\n\t\t\t\thash_size = std::min(hash_size, option.max_hash_size);\r\n\t\t\t\thash_size = std::max(hash_size, option.min_hash_size);\r\n\r\n\t\t\t\tsetHashSize(hash_size);\r\n\t\t\t} else if(cmd[2] == \"Move\" && cmd[3] == \"Overhead\" && cmd[4] == \"value\") {\r\n\t\t\t\toption.moveOverhead = std::stoi(cmd[5]);\r\n\t\t\t\toption.moveOverhead = std::min(option.moveOverhead, option.maxMoveOverhead);\r\n\t\t\t\toption.moveOverhead = std::max(option.moveOverhead, option.minMoveOverhead);\r\n\t\t\t} else if(cmd[2] == \"UCI_AnalyseMode\" && cmd[3] == \"value\") {\r\n\t\t\t\tif(cmd[4] == \"true\") {\r\n\t\t\t\t\toption.UCI_AnalyseMode = true;\r\n\t\t\t\t} else if(cmd[4] == \"false\") {\r\n\t\t\t\t\toption.UCI_AnalyseMode = false;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn true;\r\n}\r\n\r\nvoid Game::idPrint() {\r\n\tstd::cout << \"id name Zevra 180306\" << std::endl;\r\n\tstd::cout << \"id author Oleg Smirnov @sovaz1997\" << std::endl;\r\n}<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: C; c-basic-offset: 4; indent-tabs-mode: nil; -*- *\/\n\/*\n * Copyright (c) 2008 litl, LLC\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include <config.h>\n\n#include \"ns.h\"\n#include \"repo.h\"\n#include \"param.h\"\n#include <gwkjs\/gwkjs-module.h>\n#include <gwkjs\/compat.h>\n\n#include <util\/log.h>\n#include <girepository.h>\n\n#include <string.h>\n\ntypedef struct {\n char *gi_namespace;\n GHashTable *modules;\n} Ns;\n\nextern JSClassDefinition gwkjs_ns_class;\nstatic JSClassRef gwkjs_ns_class_ref = NULL;\n\n\nGWKJS_DEFINE_PRIV_FROM_JS(Ns, gwkjs_ns_class)\n\nstatic JSValueRef\nns_get_property(JSContextRef context,\n JSObjectRef obj,\n JSStringRef property_name,\n JSValueRef* exception)\n{\n Ns *priv = NULL;\n char *name = NULL;\n GIRepository *repo = NULL;\n GIBaseInfo *info;\n JSValueRef ret = NULL;\n gboolean defined;\n\n name = gwkjs_jsstring_to_cstring(property_name);\n\n \/* let Object.prototype resolve these *\/\n if (strcmp(name, \"valueOf\") == 0 ||\n strcmp(name, \"toString\") == 0) {\n goto out;\n }\n\n priv = priv_from_js(obj);\n gwkjs_debug_jsprop(GWKJS_DEBUG_GNAMESPACE,\n \"Resolve prop '%s' hook obj %p priv %p\",\n name, (void *)obj, priv);\n\n if (priv == NULL) {\n goto out;\n }\n\n \/\/ If the module was already included, the default proto system\n \/\/ should return the property, not this method.\n if (g_hash_table_contains(priv->modules, name))\n goto out;\n\n repo = g_irepository_get_default();\n\n info = g_irepository_find_by_name(repo, priv->gi_namespace, name);\n if (info == NULL) {\n \/* No property defined, but no error either, so return TRUE *\/\n goto out;\n }\n\n gwkjs_debug(GWKJS_DEBUG_GNAMESPACE,\n \"Found info type %s for '%s' in namespace '%s'\",\n gwkjs_info_type_name(g_base_info_get_type(info)),\n g_base_info_get_name(info),\n g_base_info_get_namespace(info));\n\n\n g_hash_table_replace(priv->modules, g_strdup(name), NULL);\n if ((ret = gwkjs_define_info(context, obj, info, &defined))) {\n\/\/ g_base_info_unref(info);\n\/\/XXX: Does it return THIS?!\n\/\/ if (defined)\n\/\/ objp.set(obj); \/* we defined the property in this object *\/\n } else {\n g_hash_table_remove(priv->modules, name);\n gwkjs_debug(GWKJS_DEBUG_GNAMESPACE,\n \"Failed to define info '%s'\",\n g_base_info_get_name(info));\n\n g_base_info_unref(info);\n }\n\n out:\n g_free(name);\n return ret;\n}\n\nstatic JSValueRef\nget_name (JSContextRef context,\n JSObjectRef obj,\n JSStringRef propertyName,\n JSValueRef* exception)\n{\n Ns *priv;\n JSValueRef retval = NULL;\n\n priv = priv_from_js(obj);\n\n if (priv == NULL)\n goto out;\n\n retval = gwkjs_cstring_to_jsvalue(context, priv->gi_namespace);\n\n out:\n return retval;\n}\n\nGWKJS_NATIVE_CONSTRUCTOR_DEFINE_ABSTRACT(ns)\n\nstatic void\nns_finalize(JSObjectRef obj)\n{\n Ns *priv;\n\n priv = priv_from_js(obj);\n gwkjs_debug_lifecycle(GWKJS_DEBUG_GNAMESPACE,\n \"finalize, obj %p priv %p\", obj, priv);\n if (priv == NULL)\n return; \/* we are the prototype, not a real instance *\/\n\n if (priv->gi_namespace)\n g_free(priv->gi_namespace);\n\n GWKJS_DEC_COUNTER(ns);\n g_slice_free(Ns, priv);\n}\n\nJSStaticValue gwkjs_ns_proto_props[] = {\n { \"__name__\", get_name, NULL, kJSPropertyAttributeReadOnly | kJSPropertyAttributeDontDelete },\n { 0, 0, 0, 0 }\n};\n\nJSClassDefinition gwkjs_ns_class = {\n 0, \/\/ Version\n kJSPropertyAttributeNone, \/\/ JSClassAttributes\n \"GIRepositoryNamespace\", \/\/ const char* className;\n NULL, \/\/ JSClassRef parentClass;\n gwkjs_ns_proto_props, \/\/ const JSStaticValue* staticValues;\n NULL, \/\/ const JSStaticFunction* staticFunctions;\n NULL, \/\/ JSObjectInitializeCallback initialize;\n ns_finalize, \/\/ JSObjectFinalizeCallback finalize;\n NULL, \/\/ JSObjectHasPropertyCallback hasProperty;\n\n ns_get_property, \/\/ JSObjectGetPropertyCallback getProperty;\n\n NULL, \/\/ JSObjectSetPropertyCallback setProperty;\n NULL, \/\/ JSObjectDeletePropertyCallback deleteProperty;\n NULL, \/\/ JSObjectGetPropertyNamesCallback getPropertyNames;\n NULL, \/\/ JSObjectCallAsFunctionCallback callAsFunction;\n gwkjs_ns_constructor, \/\/ JSObjectCallAsConstructorCallback callAsConstructor;\n NULL, \/\/ JSObjectHasInstanceCallback hasInstance;\n NULL, \/\/ JSObjectConvertToTypeCallback convertToType;\n};\n\n\n\nstatic JSObjectRef\nns_new(JSContextRef context,\n const char *ns_name)\n{\n Ns *priv = NULL;\n JSObjectRef ret = NULL;\n JSObjectRef global = NULL;\n gboolean found = FALSE;\n JSObjectRef proto = NULL;\n JSValueRef exception = NULL;\n\n \/\/ XXX: NOT THREAD SAFE?\n if (!gwkjs_ns_class_ref) {\n gwkjs_ns_class_ref = JSClassCreate(&gwkjs_ns_class);\n }\n\n global = gwkjs_get_import_global(context);\n if (!(found = gwkjs_object_has_property(context,\n global,\n gwkjs_ns_class.className))) {\n proto = JSObjectMake(context,\n gwkjs_ns_class_ref,\n NULL);\n\n gwkjs_object_set_property(context, global,\n gwkjs_ns_class.className,\n proto,\n GWKJS_PROTO_PROP_FLAGS,\n &exception);\n\n if (exception)\n g_error(\"Can't init class %s\", gwkjs_ns_class.className);\n\n gwkjs_debug(GWKJS_DEBUG_IMPORTER, \"Initialized class %s prototype %p\",\n gwkjs_ns_class.className, proto);\n } else {\n JSValueRef proto_val = gwkjs_object_get_property(context,\n global,\n gwkjs_ns_class.className,\n &exception);\n\n if (exception || proto_val == NULL || !JSValueIsObject(context, proto_val))\n g_error(\"Can't get protoType for class %s\", gwkjs_ns_class.className);\n\n proto = JSValueToObject(context, proto_val, NULL);\n }\n g_assert(proto != NULL);\n\n ret = JSObjectMake(context, gwkjs_ns_class_ref, NULL);\n\n if (ret == NULL)\n return ret;\n\n JSObjectSetPrototype(context, ret, proto);\n\n priv = g_slice_new0(Ns);\n GWKJS_INC_COUNTER(ns);\n \n g_assert(priv_from_js(ret) == NULL);\n JSObjectSetPrivate(ret, priv);\n\n gwkjs_debug_lifecycle(GWKJS_DEBUG_GNAMESPACE, \"ns constructor, obj %p priv %p\", ret, priv);\n\n priv = priv_from_js(ret);\n priv->modules = g_hash_table_new_full(g_str_hash, g_str_equal, g_free, NULL);\n\n priv->gi_namespace = g_strdup(ns_name);\n return ret;\n}\n\n\n\nJSObjectRef\ngwkjs_create_ns(JSContextRef context,\n const char *ns_name)\n{\n return ns_new(context, ns_name);\n}\n<commit_msg>Some small fixes for NS<commit_after>\/* -*- mode: C; c-basic-offset: 4; indent-tabs-mode: nil; -*- *\/\n\/*\n * Copyright (c) 2008 litl, LLC\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include <config.h>\n\n#include \"ns.h\"\n#include \"repo.h\"\n#include \"param.h\"\n#include <gwkjs\/gwkjs-module.h>\n#include <gwkjs\/compat.h>\n\n#include <util\/log.h>\n#include <girepository.h>\n\n#include <string.h>\n\ntypedef struct {\n char *gi_namespace;\n GHashTable *modules;\n} Ns;\n\nextern JSClassDefinition gwkjs_ns_class;\nstatic JSClassRef gwkjs_ns_class_ref = NULL;\n\n\nGWKJS_DEFINE_PRIV_FROM_JS(Ns, gwkjs_ns_class)\n\nstatic JSValueRef\nns_get_property(JSContextRef context,\n JSObjectRef obj,\n JSStringRef property_name,\n JSValueRef* exception)\n{\n Ns *priv = NULL;\n char *name = NULL;\n GIRepository *repo = NULL;\n GIBaseInfo *info;\n JSValueRef ret = NULL;\n gboolean defined;\n\n name = gwkjs_jsstring_to_cstring(property_name);\n\n \/* let Object.prototype resolve these *\/\n if (strcmp(name, \"valueOf\") == 0 ||\n strcmp(name, \"toString\") == 0) {\n goto out;\n }\n\n priv = priv_from_js(obj);\n gwkjs_debug_jsprop(GWKJS_DEBUG_GNAMESPACE,\n \"Resolve prop '%s' hook obj %p priv %p\",\n name, (void *)obj, priv);\n\n if (priv == NULL) {\n goto out;\n }\n\n \/\/ If the module was already included, the default proto system\n \/\/ should return the property, not this method.\n if (g_hash_table_contains(priv->modules, name))\n goto out;\n\n repo = g_irepository_get_default();\n\n info = g_irepository_find_by_name(repo, priv->gi_namespace, name);\n if (info == NULL) {\n \/* No property defined, but no error either, so return TRUE *\/\n goto out;\n }\n\n gwkjs_debug(GWKJS_DEBUG_GNAMESPACE,\n \"Found info type %s for '%s' in namespace '%s'\",\n gwkjs_info_type_name(g_base_info_get_type(info)),\n g_base_info_get_name(info),\n g_base_info_get_namespace(info));\n\n\n g_hash_table_replace(priv->modules, g_strdup(name), NULL);\n if ((ret = gwkjs_define_info(context, obj, info, &defined))) {\n g_base_info_unref(info);\n\/\/XXX: Does it return THIS?!\n\/\/ if (defined)\n\/\/ objp.set(obj); \/* we defined the property in this object *\/\n } else {\n g_hash_table_remove(priv->modules, name);\n gwkjs_debug(GWKJS_DEBUG_GNAMESPACE,\n \"Failed to define info '%s'\",\n g_base_info_get_name(info));\n\n g_base_info_unref(info);\n }\n\n out:\n g_free(name);\n return ret;\n}\n\nstatic JSValueRef\nget_name (JSContextRef context,\n JSObjectRef obj,\n JSStringRef propertyName,\n JSValueRef* exception)\n{\n Ns *priv;\n JSValueRef retval = NULL;\n\n priv = priv_from_js(obj);\n\n if (priv == NULL)\n goto out;\n\n retval = gwkjs_cstring_to_jsvalue(context, priv->gi_namespace);\n\n out:\n return retval;\n}\n\nGWKJS_NATIVE_CONSTRUCTOR_DEFINE_ABSTRACT(ns)\n\nstatic void\nns_finalize(JSObjectRef obj)\n{\n Ns *priv;\n\n priv = priv_from_js(obj);\n gwkjs_debug_lifecycle(GWKJS_DEBUG_GNAMESPACE,\n \"finalize, obj %p priv %p\", obj, priv);\n if (priv == NULL)\n return; \/* we are the prototype, not a real instance *\/\n\n if (priv->gi_namespace)\n g_free(priv->gi_namespace);\n\n GWKJS_DEC_COUNTER(ns);\n g_slice_free(Ns, priv);\n}\n\nJSStaticValue gwkjs_ns_proto_props[] = {\n { \"__name__\", get_name, NULL, kJSPropertyAttributeReadOnly | kJSPropertyAttributeDontDelete },\n { 0, 0, 0, 0 }\n};\n\nJSClassDefinition gwkjs_ns_class = {\n 0, \/\/ Version\n kJSPropertyAttributeNone, \/\/ JSClassAttributes\n \"GIRepositoryNamespace\", \/\/ const char* className;\n NULL, \/\/ JSClassRef parentClass;\n gwkjs_ns_proto_props, \/\/ const JSStaticValue* staticValues;\n NULL, \/\/ const JSStaticFunction* staticFunctions;\n NULL, \/\/ JSObjectInitializeCallback initialize;\n ns_finalize, \/\/ JSObjectFinalizeCallback finalize;\n NULL, \/\/ JSObjectHasPropertyCallback hasProperty;\n\n ns_get_property, \/\/ JSObjectGetPropertyCallback getProperty;\n\n NULL, \/\/ JSObjectSetPropertyCallback setProperty;\n NULL, \/\/ JSObjectDeletePropertyCallback deleteProperty;\n NULL, \/\/ JSObjectGetPropertyNamesCallback getPropertyNames;\n NULL, \/\/ JSObjectCallAsFunctionCallback callAsFunction;\n gwkjs_ns_constructor, \/\/ JSObjectCallAsConstructorCallback callAsConstructor;\n NULL, \/\/ JSObjectHasInstanceCallback hasInstance;\n NULL, \/\/ JSObjectConvertToTypeCallback convertToType;\n};\n\n\n\nstatic JSObjectRef\nns_new(JSContextRef context,\n const char *ns_name)\n{\n Ns *priv = NULL;\n JSObjectRef ret = NULL;\n JSObjectRef global = NULL;\n gboolean found = FALSE;\n JSObjectRef proto = NULL;\n JSValueRef exception = NULL;\n\n \/\/ XXX: NOT THREAD SAFE?\n if (!gwkjs_ns_class_ref) {\n gwkjs_ns_class_ref = JSClassCreate(&gwkjs_ns_class);\n JSClassRetain(gwkjs_ns_class_ref);\n }\n\n global = gwkjs_get_import_global(context);\n if (!(found = gwkjs_object_has_property(context,\n global,\n gwkjs_ns_class.className))) {\n proto = JSObjectMake(context,\n gwkjs_ns_class_ref,\n NULL);\n\n gwkjs_object_set_property(context, global,\n gwkjs_ns_class.className,\n proto,\n GWKJS_PROTO_PROP_FLAGS,\n &exception);\n\n if (exception)\n g_error(\"Can't init class %s\", gwkjs_ns_class.className);\n\n gwkjs_debug(GWKJS_DEBUG_IMPORTER, \"Initialized class %s prototype %p\",\n gwkjs_ns_class.className, proto);\n } else {\n JSValueRef proto_val = gwkjs_object_get_property(context,\n global,\n gwkjs_ns_class.className,\n &exception);\n\n if (exception || proto_val == NULL || !JSValueIsObject(context, proto_val))\n g_error(\"Can't get protoType for class %s\", gwkjs_ns_class.className);\n\n proto = JSValueToObject(context, proto_val, NULL);\n }\n g_assert(proto != NULL);\n\n ret = JSObjectMake(context, gwkjs_ns_class_ref, NULL);\n\n if (ret == NULL)\n return ret;\n\n JSObjectSetPrototype(context, ret, proto);\n\n priv = g_slice_new0(Ns);\n GWKJS_INC_COUNTER(ns);\n \n g_assert(priv_from_js(ret) == NULL);\n JSObjectSetPrivate(ret, priv);\n\n gwkjs_debug_lifecycle(GWKJS_DEBUG_GNAMESPACE, \"ns constructor, obj %p priv %p\", ret, priv);\n\n priv = priv_from_js(ret);\n priv->modules = g_hash_table_new_full(g_str_hash, g_str_equal, g_free, NULL);\n\n priv->gi_namespace = g_strdup(ns_name);\n return ret;\n}\n\n\n\nJSObjectRef\ngwkjs_create_ns(JSContextRef context,\n const char *ns_name)\n{\n return ns_new(context, ns_name);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"cmake.h\"\n#include \"filesystem.h\"\n#include \"dialogs.h\"\n#include \"config.h\"\n#include \"terminal.h\"\n\n\/\/Temporary fix for current Arch Linux boost linking problem\n#ifdef __GNUC_PREREQ\n#if __GNUC_PREREQ(5,1)\n#include <regex>\n#define REGEX_NS std\n#endif\n#endif\n#ifndef REGEX_NS\n#include <boost\/regex.hpp>\n#define REGEX_NS boost\n#endif\n\nCMake::CMake(const boost::filesystem::path &path) {\n const auto find_cmake_project=[this](const boost::filesystem::path &cmake_path) {\n for(auto &line: filesystem::read_lines(cmake_path)) {\n const static REGEX_NS::regex project_regex(\"^ *project *\\\\(.*$\", REGEX_NS::regex::icase);\n REGEX_NS::smatch sm;\n if(REGEX_NS::regex_match(line, sm, project_regex))\n return true;\n }\n return false;\n };\n \n auto search_path=boost::filesystem::is_directory(path)?path:path.parent_path();\n while(true) {\n auto search_cmake_path=search_path\/\"CMakeLists.txt\";\n if(boost::filesystem::exists(search_cmake_path)) {\n paths.emplace(paths.begin(), search_cmake_path);\n if(find_cmake_project(search_cmake_path)) {\n project_path=search_path;\n break;\n }\n }\n if(search_path==search_path.root_directory())\n break;\n search_path=search_path.parent_path();\n }\n}\n\nbool CMake::update_default_build(const boost::filesystem::path &default_build_path, bool force) {\n if(project_path.empty())\n return false;\n \n if(!boost::filesystem::exists(project_path\/\"CMakeLists.txt\"))\n return false;\n \n if(default_build_path.empty())\n return false;\n if(!boost::filesystem::exists(default_build_path)) {\n boost::system::error_code ec;\n boost::filesystem::create_directories(default_build_path, ec);\n if(ec) {\n Terminal::get().print(\"Error: could not create \"+default_build_path.string()+\": \"+ec.message()+\"\\n\", true);\n return false;\n }\n }\n \n if(!force && boost::filesystem::exists(default_build_path\/\"compile_commands.json\"))\n return true;\n \n auto compile_commands_path=default_build_path\/\"compile_commands.json\";\n Dialog::Message message(\"Creating\/updating default build\");\n auto exit_status=Terminal::get().process(Config::get().project.cmake_command+\" \"+\n filesystem::escape_argument(project_path)+\" -DCMAKE_EXPORT_COMPILE_COMMANDS=ON\", default_build_path);\n message.hide();\n if(exit_status==EXIT_SUCCESS) {\n#ifdef _WIN32 \/\/Temporary fix to MSYS2's libclang\n auto compile_commands_file=filesystem::read(compile_commands_path);\n size_t pos=0;\n while((pos=compile_commands_file.find(\"-I\/\", pos))!=std::string::npos) {\n if(pos+3<compile_commands_file.size()) {\n std::string drive;\n drive+=compile_commands_file[pos+3];\n compile_commands_file.replace(pos, 4, \"-I\"+drive+\":\");\n }\n else\n break;\n }\n filesystem::write(compile_commands_path, compile_commands_file);\n#endif\n return true;\n }\n return false;\n}\n\nbool CMake::update_debug_build(const boost::filesystem::path &debug_build_path, bool force) {\n if(project_path.empty())\n return false;\n \n if(!boost::filesystem::exists(project_path\/\"CMakeLists.txt\"))\n return false;\n \n if(debug_build_path.empty())\n return false;\n if(!boost::filesystem::exists(debug_build_path)) {\n boost::system::error_code ec;\n boost::filesystem::create_directories(debug_build_path, ec);\n if(ec) {\n Terminal::get().print(\"Error: could not create \"+debug_build_path.string()+\": \"+ec.message()+\"\\n\", true);\n return false;\n }\n }\n \n if(!force && boost::filesystem::exists(debug_build_path\/\"CMakeCache.txt\"))\n return true;\n \n std::unique_ptr<Dialog::Message> message;\n message=std::unique_ptr<Dialog::Message>(new Dialog::Message(\"Creating\/updating debug build\"));\n auto exit_status=Terminal::get().process(Config::get().project.cmake_command+\" \"+\n filesystem::escape_argument(project_path)+\" -DCMAKE_BUILD_TYPE=Debug\", debug_build_path);\n if(message)\n message->hide();\n if(exit_status==EXIT_SUCCESS)\n return true;\n return false;\n}\n\nboost::filesystem::path CMake::get_executable(const boost::filesystem::path &file_path) {\n auto executables = get_functions_parameters(\"add_executable\");\n \n \/\/Attempt to find executable based add_executable files and opened tab\n boost::filesystem::path executable_path;\n if(!file_path.empty()) {\n for(auto &executable: executables) {\n if(executable.second.size()>1) {\n for(size_t c=1;c<executable.second.size();c++) {\n if(executable.second[c]==file_path.filename()) {\n executable_path=executable.first.parent_path()\/executable.second[0];\n break;\n }\n }\n }\n if(!executable_path.empty())\n break;\n }\n }\n if(executable_path.empty() && executables.size()>0 && executables[0].second.size()>0)\n executable_path=executables[0].first.parent_path()\/executables[0].second[0];\n \n return executable_path;\n}\n\nvoid CMake::read_files() {\n for(auto &path: paths)\n files.emplace_back(filesystem::read(path));\n}\n\nvoid CMake::remove_tabs() {\n for(auto &file: files) {\n for(auto &chr: file) {\n if(chr=='\\t')\n chr=' ';\n }\n }\n}\n\nvoid CMake::remove_comments() {\n for(auto &file: files) {\n size_t pos=0;\n size_t comment_start;\n bool inside_comment=false;\n while(pos<file.size()) {\n if(!inside_comment && file[pos]=='#') {\n comment_start=pos;\n inside_comment=true;\n }\n if(inside_comment && file[pos]=='\\n') {\n file.erase(comment_start, pos-comment_start);\n pos-=pos-comment_start;\n inside_comment=false;\n }\n pos++;\n }\n if(inside_comment)\n file.erase(comment_start);\n }\n}\n\nvoid CMake::remove_newlines_inside_parentheses() {\n for(auto &file: files) {\n size_t pos=0;\n bool inside_para=false;\n bool inside_quote=false;\n char last_char=0;\n while(pos<file.size()) {\n if(!inside_quote && file[pos]=='\"' && last_char!='\\\\')\n inside_quote=true;\n else if(inside_quote && file[pos]=='\"' && last_char!='\\\\')\n inside_quote=false;\n\n else if(!inside_quote && file[pos]=='(')\n inside_para=true;\n else if(!inside_quote && file[pos]==')')\n inside_para=false;\n\n else if(inside_para && file[pos]=='\\n')\n file.replace(pos, 1, 1, ' ');\n last_char=file[pos];\n pos++;\n }\n }\n}\n\nvoid CMake::find_variables() {\n for(auto &file: files) {\n size_t pos=0;\n while(pos<file.size()) {\n auto start_line=pos;\n auto end_line=file.find('\\n', start_line);\n if(end_line==std::string::npos)\n end_line=file.size();\n if(end_line>start_line) {\n auto line=file.substr(start_line, end_line-start_line);\n REGEX_NS::smatch sm;\n const static REGEX_NS::regex set_regex(\"^ *set *\\\\( *([A-Za-z_][A-Za-z_0-9]*) +(.*)\\\\) *$\", REGEX_NS::regex::icase);\n if(REGEX_NS::regex_match(line, sm, set_regex)) {\n auto data=sm[2].str();\n while(data.size()>0 && data.back()==' ')\n data.pop_back();\n parse_variable_parameters(data);\n variables[sm[1].str()]=data;\n }\n else {\n const static REGEX_NS::regex project_regex(\"^ *project *\\\\( *([^ ]+).*\\\\) *$\", REGEX_NS::regex::icase);\n if(REGEX_NS::regex_match(line, sm, project_regex)) {\n auto data=sm[1].str();\n parse_variable_parameters(data);\n variables[\"CMAKE_PROJECT_NAME\"]=data; \/\/TODO: is this variable deprecated\/non-standard?\n variables[\"PROJECT_NAME\"]=data;\n }\n }\n }\n pos=end_line+1;\n }\n }\n}\n\nvoid CMake::parse_variable_parameters(std::string &data) {\n size_t pos=0;\n bool inside_quote=false;\n char last_char=0;\n while(pos<data.size()) {\n if(!inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=true;\n data.erase(pos, 1); \/\/TODO: instead remove quote-mark if pasted into a quote, for instance: \"test${test}test\"<-remove quotes from ${test}\n pos--;\n }\n else if(inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=false;\n data.erase(pos, 1); \/\/TODO: instead remove quote-mark if pasted into a quote, for instance: \"test${test}test\"<-remove quotes from ${test}\n pos--;\n }\n else if(!inside_quote && data[pos]==' ' && pos+1<data.size() && data[pos+1]==' ') {\n data.erase(pos, 1);\n pos--;\n }\n \n if(pos!=static_cast<size_t>(-1))\n last_char=data[pos];\n pos++;\n }\n for(auto &var: variables) {\n auto pos=data.find(\"${\"+var.first+'}');\n while(pos!=std::string::npos) {\n data.replace(pos, var.first.size()+3, var.second);\n pos=data.find(\"${\"+var.first+'}');\n }\n }\n \n \/\/Remove variables we do not know:\n pos=data.find(\"${\");\n auto pos_end=data.find(\"}\", pos+2);\n while(pos!=std::string::npos && pos_end!=std::string::npos) {\n data.erase(pos, pos_end-pos+1);\n pos=data.find(\"${\");\n pos_end=data.find(\"}\", pos+2);\n }\n}\n\nvoid CMake::parse() {\n read_files();\n remove_tabs();\n remove_comments();\n remove_newlines_inside_parentheses();\n find_variables();\n parsed=true;\n}\n\nstd::vector<std::string> CMake::get_function_parameters(std::string &data) {\n std::vector<std::string> parameters;\n size_t pos=0;\n size_t parameter_pos=0;\n bool inside_quote=false;\n char last_char=0;\n while(pos<data.size()) {\n if(!inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=true;\n data.erase(pos, 1);\n pos--;\n }\n else if(inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=false;\n data.erase(pos, 1);\n pos--;\n }\n else if(!inside_quote && pos+1<data.size() && data[pos]==' ' && data[pos+1]==' ') {\n data.erase(pos, 1);\n pos--;\n }\n else if(!inside_quote && data[pos]==' ') {\n parameters.emplace_back(data.substr(parameter_pos, pos-parameter_pos));\n if(pos+1<data.size())\n parameter_pos=pos+1;\n }\n \n if(pos!=static_cast<size_t>(-1))\n last_char=data[pos];\n pos++;\n }\n parameters.emplace_back(data.substr(parameter_pos));\n for(auto &var: variables) {\n for(auto ¶meter: parameters) {\n auto pos=parameter.find(\"${\"+var.first+'}');\n while(pos!=std::string::npos) {\n parameter.replace(pos, var.first.size()+3, var.second);\n pos=parameter.find(\"${\"+var.first+'}');\n }\n }\n }\n return parameters;\n}\n\nstd::vector<std::pair<boost::filesystem::path, std::vector<std::string> > > CMake::get_functions_parameters(const std::string &name) {\n const REGEX_NS::regex function_regex(\"^ *\"+name+\" *\\\\( *(.*)\\\\) *$\", REGEX_NS::regex::icase);\n if(!parsed)\n parse();\n std::vector<std::pair<boost::filesystem::path, std::vector<std::string> > > functions;\n size_t file_c=0;\n for(auto &file: files) {\n size_t pos=0;\n while(pos<file.size()) {\n auto start_line=pos;\n auto end_line=file.find('\\n', start_line);\n if(end_line==std::string::npos)\n end_line=file.size();\n if(end_line>start_line) {\n auto line=file.substr(start_line, end_line-start_line);\n REGEX_NS::smatch sm;\n if(REGEX_NS::regex_match(line, sm, function_regex)) {\n auto data=sm[1].str();\n while(data.size()>0 && data.back()==' ')\n data.pop_back();\n auto parameters=get_function_parameters(data);\n functions.emplace(functions.begin(), paths[file_c], parameters);\n }\n }\n pos=end_line+1;\n }\n file_c++;\n }\n return functions;\n}\n<commit_msg>extended fix to MSYS2's libclang to '-isystem'<commit_after>#include \"cmake.h\"\n#include \"filesystem.h\"\n#include \"dialogs.h\"\n#include \"config.h\"\n#include \"terminal.h\"\n\n\/\/Temporary fix for current Arch Linux boost linking problem\n#ifdef __GNUC_PREREQ\n#if __GNUC_PREREQ(5,1)\n#include <regex>\n#define REGEX_NS std\n#endif\n#endif\n#ifndef REGEX_NS\n#include <boost\/regex.hpp>\n#define REGEX_NS boost\n#endif\n\nCMake::CMake(const boost::filesystem::path &path) {\n const auto find_cmake_project=[this](const boost::filesystem::path &cmake_path) {\n for(auto &line: filesystem::read_lines(cmake_path)) {\n const static REGEX_NS::regex project_regex(\"^ *project *\\\\(.*$\", REGEX_NS::regex::icase);\n REGEX_NS::smatch sm;\n if(REGEX_NS::regex_match(line, sm, project_regex))\n return true;\n }\n return false;\n };\n \n auto search_path=boost::filesystem::is_directory(path)?path:path.parent_path();\n while(true) {\n auto search_cmake_path=search_path\/\"CMakeLists.txt\";\n if(boost::filesystem::exists(search_cmake_path)) {\n paths.emplace(paths.begin(), search_cmake_path);\n if(find_cmake_project(search_cmake_path)) {\n project_path=search_path;\n break;\n }\n }\n if(search_path==search_path.root_directory())\n break;\n search_path=search_path.parent_path();\n }\n}\n\nbool CMake::update_default_build(const boost::filesystem::path &default_build_path, bool force) {\n if(project_path.empty())\n return false;\n \n if(!boost::filesystem::exists(project_path\/\"CMakeLists.txt\"))\n return false;\n \n if(default_build_path.empty())\n return false;\n if(!boost::filesystem::exists(default_build_path)) {\n boost::system::error_code ec;\n boost::filesystem::create_directories(default_build_path, ec);\n if(ec) {\n Terminal::get().print(\"Error: could not create \"+default_build_path.string()+\": \"+ec.message()+\"\\n\", true);\n return false;\n }\n }\n \n if(!force && boost::filesystem::exists(default_build_path\/\"compile_commands.json\"))\n return true;\n \n auto compile_commands_path=default_build_path\/\"compile_commands.json\";\n Dialog::Message message(\"Creating\/updating default build\");\n auto exit_status=Terminal::get().process(Config::get().project.cmake_command+\" \"+\n filesystem::escape_argument(project_path)+\" -DCMAKE_EXPORT_COMPILE_COMMANDS=ON\", default_build_path);\n message.hide();\n if(exit_status==EXIT_SUCCESS) {\n#ifdef _WIN32 \/\/Temporary fix to MSYS2's libclang\n auto compile_commands_file=filesystem::read(compile_commands_path);\n auto replace_drive = [&compile_commands_file](const std::string& param) {\n size_t pos=0;\n auto param_size = param.length();\n while((pos=compile_commands_file.find(param+\"\/\", pos))!=std::string::npos) {\n if(pos+param_size+1<compile_commands_file.size())\n compile_commands_file.replace(pos, param_size+2, param+compile_commands_file[pos+param_size+1]+\":\");\n else\n break;\n }\n };\n replace_drive(\"-I\");\n replace_drive(\"-isystem \");\n filesystem::write(compile_commands_path, compile_commands_file);\n#endif\n return true;\n }\n return false;\n}\n\nbool CMake::update_debug_build(const boost::filesystem::path &debug_build_path, bool force) {\n if(project_path.empty())\n return false;\n \n if(!boost::filesystem::exists(project_path\/\"CMakeLists.txt\"))\n return false;\n \n if(debug_build_path.empty())\n return false;\n if(!boost::filesystem::exists(debug_build_path)) {\n boost::system::error_code ec;\n boost::filesystem::create_directories(debug_build_path, ec);\n if(ec) {\n Terminal::get().print(\"Error: could not create \"+debug_build_path.string()+\": \"+ec.message()+\"\\n\", true);\n return false;\n }\n }\n \n if(!force && boost::filesystem::exists(debug_build_path\/\"CMakeCache.txt\"))\n return true;\n \n std::unique_ptr<Dialog::Message> message;\n message=std::unique_ptr<Dialog::Message>(new Dialog::Message(\"Creating\/updating debug build\"));\n auto exit_status=Terminal::get().process(Config::get().project.cmake_command+\" \"+\n filesystem::escape_argument(project_path)+\" -DCMAKE_BUILD_TYPE=Debug\", debug_build_path);\n if(message)\n message->hide();\n if(exit_status==EXIT_SUCCESS)\n return true;\n return false;\n}\n\nboost::filesystem::path CMake::get_executable(const boost::filesystem::path &file_path) {\n auto executables = get_functions_parameters(\"add_executable\");\n \n \/\/Attempt to find executable based add_executable files and opened tab\n boost::filesystem::path executable_path;\n if(!file_path.empty()) {\n for(auto &executable: executables) {\n if(executable.second.size()>1) {\n for(size_t c=1;c<executable.second.size();c++) {\n if(executable.second[c]==file_path.filename()) {\n executable_path=executable.first.parent_path()\/executable.second[0];\n break;\n }\n }\n }\n if(!executable_path.empty())\n break;\n }\n }\n if(executable_path.empty() && executables.size()>0 && executables[0].second.size()>0)\n executable_path=executables[0].first.parent_path()\/executables[0].second[0];\n \n return executable_path;\n}\n\nvoid CMake::read_files() {\n for(auto &path: paths)\n files.emplace_back(filesystem::read(path));\n}\n\nvoid CMake::remove_tabs() {\n for(auto &file: files) {\n for(auto &chr: file) {\n if(chr=='\\t')\n chr=' ';\n }\n }\n}\n\nvoid CMake::remove_comments() {\n for(auto &file: files) {\n size_t pos=0;\n size_t comment_start;\n bool inside_comment=false;\n while(pos<file.size()) {\n if(!inside_comment && file[pos]=='#') {\n comment_start=pos;\n inside_comment=true;\n }\n if(inside_comment && file[pos]=='\\n') {\n file.erase(comment_start, pos-comment_start);\n pos-=pos-comment_start;\n inside_comment=false;\n }\n pos++;\n }\n if(inside_comment)\n file.erase(comment_start);\n }\n}\n\nvoid CMake::remove_newlines_inside_parentheses() {\n for(auto &file: files) {\n size_t pos=0;\n bool inside_para=false;\n bool inside_quote=false;\n char last_char=0;\n while(pos<file.size()) {\n if(!inside_quote && file[pos]=='\"' && last_char!='\\\\')\n inside_quote=true;\n else if(inside_quote && file[pos]=='\"' && last_char!='\\\\')\n inside_quote=false;\n\n else if(!inside_quote && file[pos]=='(')\n inside_para=true;\n else if(!inside_quote && file[pos]==')')\n inside_para=false;\n\n else if(inside_para && file[pos]=='\\n')\n file.replace(pos, 1, 1, ' ');\n last_char=file[pos];\n pos++;\n }\n }\n}\n\nvoid CMake::find_variables() {\n for(auto &file: files) {\n size_t pos=0;\n while(pos<file.size()) {\n auto start_line=pos;\n auto end_line=file.find('\\n', start_line);\n if(end_line==std::string::npos)\n end_line=file.size();\n if(end_line>start_line) {\n auto line=file.substr(start_line, end_line-start_line);\n REGEX_NS::smatch sm;\n const static REGEX_NS::regex set_regex(\"^ *set *\\\\( *([A-Za-z_][A-Za-z_0-9]*) +(.*)\\\\) *$\", REGEX_NS::regex::icase);\n if(REGEX_NS::regex_match(line, sm, set_regex)) {\n auto data=sm[2].str();\n while(data.size()>0 && data.back()==' ')\n data.pop_back();\n parse_variable_parameters(data);\n variables[sm[1].str()]=data;\n }\n else {\n const static REGEX_NS::regex project_regex(\"^ *project *\\\\( *([^ ]+).*\\\\) *$\", REGEX_NS::regex::icase);\n if(REGEX_NS::regex_match(line, sm, project_regex)) {\n auto data=sm[1].str();\n parse_variable_parameters(data);\n variables[\"CMAKE_PROJECT_NAME\"]=data; \/\/TODO: is this variable deprecated\/non-standard?\n variables[\"PROJECT_NAME\"]=data;\n }\n }\n }\n pos=end_line+1;\n }\n }\n}\n\nvoid CMake::parse_variable_parameters(std::string &data) {\n size_t pos=0;\n bool inside_quote=false;\n char last_char=0;\n while(pos<data.size()) {\n if(!inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=true;\n data.erase(pos, 1); \/\/TODO: instead remove quote-mark if pasted into a quote, for instance: \"test${test}test\"<-remove quotes from ${test}\n pos--;\n }\n else if(inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=false;\n data.erase(pos, 1); \/\/TODO: instead remove quote-mark if pasted into a quote, for instance: \"test${test}test\"<-remove quotes from ${test}\n pos--;\n }\n else if(!inside_quote && data[pos]==' ' && pos+1<data.size() && data[pos+1]==' ') {\n data.erase(pos, 1);\n pos--;\n }\n \n if(pos!=static_cast<size_t>(-1))\n last_char=data[pos];\n pos++;\n }\n for(auto &var: variables) {\n auto pos=data.find(\"${\"+var.first+'}');\n while(pos!=std::string::npos) {\n data.replace(pos, var.first.size()+3, var.second);\n pos=data.find(\"${\"+var.first+'}');\n }\n }\n \n \/\/Remove variables we do not know:\n pos=data.find(\"${\");\n auto pos_end=data.find(\"}\", pos+2);\n while(pos!=std::string::npos && pos_end!=std::string::npos) {\n data.erase(pos, pos_end-pos+1);\n pos=data.find(\"${\");\n pos_end=data.find(\"}\", pos+2);\n }\n}\n\nvoid CMake::parse() {\n read_files();\n remove_tabs();\n remove_comments();\n remove_newlines_inside_parentheses();\n find_variables();\n parsed=true;\n}\n\nstd::vector<std::string> CMake::get_function_parameters(std::string &data) {\n std::vector<std::string> parameters;\n size_t pos=0;\n size_t parameter_pos=0;\n bool inside_quote=false;\n char last_char=0;\n while(pos<data.size()) {\n if(!inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=true;\n data.erase(pos, 1);\n pos--;\n }\n else if(inside_quote && data[pos]=='\"' && last_char!='\\\\') {\n inside_quote=false;\n data.erase(pos, 1);\n pos--;\n }\n else if(!inside_quote && pos+1<data.size() && data[pos]==' ' && data[pos+1]==' ') {\n data.erase(pos, 1);\n pos--;\n }\n else if(!inside_quote && data[pos]==' ') {\n parameters.emplace_back(data.substr(parameter_pos, pos-parameter_pos));\n if(pos+1<data.size())\n parameter_pos=pos+1;\n }\n \n if(pos!=static_cast<size_t>(-1))\n last_char=data[pos];\n pos++;\n }\n parameters.emplace_back(data.substr(parameter_pos));\n for(auto &var: variables) {\n for(auto ¶meter: parameters) {\n auto pos=parameter.find(\"${\"+var.first+'}');\n while(pos!=std::string::npos) {\n parameter.replace(pos, var.first.size()+3, var.second);\n pos=parameter.find(\"${\"+var.first+'}');\n }\n }\n }\n return parameters;\n}\n\nstd::vector<std::pair<boost::filesystem::path, std::vector<std::string> > > CMake::get_functions_parameters(const std::string &name) {\n const REGEX_NS::regex function_regex(\"^ *\"+name+\" *\\\\( *(.*)\\\\) *$\", REGEX_NS::regex::icase);\n if(!parsed)\n parse();\n std::vector<std::pair<boost::filesystem::path, std::vector<std::string> > > functions;\n size_t file_c=0;\n for(auto &file: files) {\n size_t pos=0;\n while(pos<file.size()) {\n auto start_line=pos;\n auto end_line=file.find('\\n', start_line);\n if(end_line==std::string::npos)\n end_line=file.size();\n if(end_line>start_line) {\n auto line=file.substr(start_line, end_line-start_line);\n REGEX_NS::smatch sm;\n if(REGEX_NS::regex_match(line, sm, function_regex)) {\n auto data=sm[1].str();\n while(data.size()>0 && data.back()==' ')\n data.pop_back();\n auto parameters=get_function_parameters(data);\n functions.emplace(functions.begin(), paths[file_c], parameters);\n }\n }\n pos=end_line+1;\n }\n file_c++;\n }\n return functions;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tvoid set_size(size_type s)\n\t\t{\n\t\t\tsize_type pos = tell();\n\t\t\tseek(s - 1);\n\t\t\tchar dummy = 0;\n\t\t\tread(&dummy, 1);\n\t\t\tseek(s - 1);\n\t\t\twrite(&dummy, 1);\n\t\t\tseek(pos);\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tvoid file::set_size(size_type s)\n\t{\n\t\tm_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<commit_msg>fixed issue where file::set_size would update the file modification date even when the size was not changed (fixes #105)<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tvoid set_size(size_type s)\n\t\t{\n\t\t\tsize_type pos = tell();\n\t\t\t\/\/ Only set size if current file size not equals s.\n\t\t\t\/\/ 2 as \"m\" argument is to be sure seek() sets SEEK_END on\n\t\t\t\/\/ all compilers.\n\t\t\tif(s != seek(0, 2))\n\t\t\t{\n\t\t\t\tseek(s - 1);\n\t\t\t\tchar dummy = 0;\n\t\t\t\tread(&dummy, 1);\n\t\t\t\tseek(s - 1);\n\t\t\t\twrite(&dummy, 1);\n\t\t\t}\n\t\t\tseek(pos);\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tvoid file::set_size(size_type s)\n\t{\n\t\tm_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tvoid set_size(size_type s)\n\t\t{\n\t\t\tsize_type pos = tell();\n\t\t\tseek(s - 1);\n\t\t\tchar dummy = 0;\n\t\t\tread(&dummy, 1);\n\t\t\tseek(s - 1);\n\t\t\twrite(&dummy, 1);\n\t\t\tseek(pos);\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tvoid file::set_size(size_type s)\n\t{\n\t\tm_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<commit_msg>fixed issue where file::set_size would update the file modification date even when the size was not changed (fixes #105)<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tvoid set_size(size_type s)\n\t\t{\n\t\t\tsize_type pos = tell();\n\t\t\t\/\/ Only set size if current file size not equals s.\n\t\t\t\/\/ 2 as \"m\" argument is to be sure seek() sets SEEK_END on\n\t\t\t\/\/ all compilers.\n\t\t\tif(s != seek(0, 2))\n\t\t\t{\n\t\t\t\tseek(s - 1);\n\t\t\t\tchar dummy = 0;\n\t\t\t\tread(&dummy, 1);\n\t\t\t\tseek(s - 1);\n\t\t\t\twrite(&dummy, 1);\n\t\t\t}\n\t\t\tseek(pos);\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tvoid file::set_size(size_type s)\n\t{\n\t\tm_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MANIFOLDS_ZERO_FUNCTION_HH\n#define MANIFOLDS_ZERO_FUNCTION_HH\n\n#include \"full_function_defs.hh\"\n#include <ostream>\n\nnamespace manifolds {\n struct ZeroImpl : MultiFunction\n{\n static const bool stateless = true;\n\n template <class ... Args>\n auto operator()(Args...) const\n {\n return 0;\n }\n};\n\n DEF_FULL_FUNCTION(Zero)\n\n static const Zero zero;\n\n inline std::ostream & operator<<(std::ostream & s, Zero z)\n {\n return s << \"Zero\";\n }\n}\n\n#include \"simplify.hh\"\n#include \"addition.hh\"\n#include \"multiplication.hh\"\n\nnamespace manifolds {\n template <class T>\n struct Simplification<Addition<T,Zero>>\n {\n typedef T type;\n\n static type Combine(Addition<T,Zero> t)\n {\n return std::get<0>(t.GetFunctions());\n }\n };\n\n template <class T>\n struct Simplification<\n Addition<Zero,T>,\n typename std::enable_if<\n !std::is_same<Zero,T>::value>::type>\n {\n typedef T type;\n\n static type Combine(Addition<Zero,T> t)\n {\n return std::get<1>(t.GetFunctions());\n }\n };\n\n template <class T>\n struct Simplification<Multiplication<T,Zero>>\n {\n typedef Zero type;\n static type Combine(Multiplication<T,Zero>)\n {\n return zero;\n }\n };\n\n template <class T>\n struct Simplification<Multiplication<Zero,T>,\n\t\t typename std::enable_if<\n\t\t !std::is_same<T,Zero>::value>::type>\n {\n typedef Zero type;\n\n static type Combine(Multiplication<Zero,T> )\n {\n return zero;\n }\n };\n}\n\n#endif\n<commit_msg>fixing error that gcc didn't report<commit_after>#ifndef MANIFOLDS_ZERO_FUNCTION_HH\n#define MANIFOLDS_ZERO_FUNCTION_HH\n\n#include \"full_function_defs.hh\"\n#include <ostream>\n\nnamespace manifolds {\n struct ZeroImpl : MultiFunction\n{\n static const bool stateless = true;\n\n template <class ... Args>\n auto operator()(Args...) const\n {\n return 0;\n }\n};\n\n DEF_FULL_FUNCTION(Zero)\n\n static const Zero zero = Zero();\n\n inline std::ostream & operator<<(std::ostream & s, Zero z)\n {\n return s << \"Zero\";\n }\n}\n\n#include \"simplify.hh\"\n#include \"addition.hh\"\n#include \"multiplication.hh\"\n\nnamespace manifolds {\n template <class T>\n struct Simplification<Addition<T,Zero>>\n {\n typedef T type;\n\n static type Combine(Addition<T,Zero> t)\n {\n return std::get<0>(t.GetFunctions());\n }\n };\n\n template <class T>\n struct Simplification<\n Addition<Zero,T>,\n typename std::enable_if<\n !std::is_same<Zero,T>::value>::type>\n {\n typedef T type;\n\n static type Combine(Addition<Zero,T> t)\n {\n return std::get<1>(t.GetFunctions());\n }\n };\n\n template <class T>\n struct Simplification<Multiplication<T,Zero>>\n {\n typedef Zero type;\n static type Combine(Multiplication<T,Zero>)\n {\n return zero;\n }\n };\n\n template <class T>\n struct Simplification<Multiplication<Zero,T>,\n\t\t typename std::enable_if<\n\t\t !std::is_same<T,Zero>::value>::type>\n {\n typedef Zero type;\n\n static type Combine(Multiplication<Zero,T> )\n {\n return zero;\n }\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2009-2011 250bpm s.r.o.\n Copyright (c) 2011 Botond Ballo\n Copyright (c) 2007-2009 iMatix Corporation\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to\n deal in the Software without restriction, including without limitation the\n rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n sell copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n IN THE SOFTWARE.\n*\/\n\n#ifndef __ZMQ_HPP_INCLUDED__\n#define __ZMQ_HPP_INCLUDED__\n\n#include <zmq.h>\n\n#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <exception>\n\n\/\/ Detect whether the compiler supports C++11 rvalue references.\n#if (defined(__GNUC__) && (__GNUC__ > 4 || \\\n (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && \\\n defined(__GXX_EXPERIMENTAL_CXX0X__))\n #define ZMQ_HAS_RVALUE_REFS\n #define ZMQ_DELETED_FUNCTION = delete\n#elif defined(__clang__)\n #if __has_feature(cxx_rvalue_references)\n #define ZMQ_HAS_RVALUE_REFS\n #endif\n\n #if __has_feature(cxx_deleted_functions)\n #define ZMQ_DELETED_FUNCTION = delete\n #else\n #define ZMQ_DELETED_FUNCTION\n #endif\n#elif defined(_MSC_VER) && (_MSC_VER >= 1600)\n #define ZMQ_HAS_RVALUE_REFS\n #define ZMQ_DELETED_FUNCTION\n#else\n #define ZMQ_DELETED_FUNCTION\n#endif\n\n\/\/ In order to prevent unused variable warnings when building in non-debug\n\/\/ mode use this macro to make assertions.\n#ifndef NDEBUG\n# define ZMQ_ASSERT(expression) assert(expression)\n#else\n# define ZMQ_ASSERT(expression) (void)(expression)\n#endif\n\nnamespace zmq\n{\n\n typedef zmq_free_fn free_fn;\n typedef zmq_pollitem_t pollitem_t;\n\n class error_t : public std::exception\n {\n public:\n\n error_t () : errnum (zmq_errno ()) {}\n\n virtual const char *what () const throw ()\n {\n return zmq_strerror (errnum);\n }\n\n int num () const\n {\n return errnum;\n }\n\n private:\n\n int errnum;\n };\n\n inline int poll (zmq_pollitem_t *items_, int nitems_, long timeout_ = -1)\n {\n int rc = zmq_poll (items_, nitems_, timeout_);\n if (rc < 0)\n throw error_t ();\n return rc;\n }\n\n inline void proxy (void *frontend, void *backend, void *capture)\n {\n int rc = zmq_proxy (frontend, backend, capture);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void version (int *major_, int *minor_, int *patch_)\n {\n zmq_version (major_, minor_, patch_);\n }\n\n class message_t\n {\n friend class socket_t;\n\n public:\n\n inline message_t ()\n {\n int rc = zmq_msg_init (&msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline explicit message_t (size_t size_)\n {\n int rc = zmq_msg_init_size (&msg, size_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline message_t (void *data_, size_t size_, free_fn *ffn_,\n void *hint_ = NULL)\n {\n int rc = zmq_msg_init_data (&msg, data_, size_, ffn_, hint_);\n if (rc != 0)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline message_t (message_t &&rhs) : msg (rhs.msg)\n {\n int rc = zmq_msg_init (&rhs.msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline message_t &operator = (message_t &&rhs)\n {\n std::swap (msg, rhs.msg);\n return *this;\n }\n#endif\n\n inline ~message_t ()\n {\n int rc = zmq_msg_close (&msg);\n ZMQ_ASSERT (rc == 0);\n }\n\n inline void rebuild ()\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init (&msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void rebuild (size_t size_)\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init_size (&msg, size_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void rebuild (void *data_, size_t size_, free_fn *ffn_,\n void *hint_ = NULL)\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init_data (&msg, data_, size_, ffn_, hint_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void move (message_t *msg_)\n {\n int rc = zmq_msg_move (&msg, &(msg_->msg));\n if (rc != 0)\n throw error_t ();\n }\n\n inline void copy (message_t *msg_)\n {\n int rc = zmq_msg_copy (&msg, &(msg_->msg));\n if (rc != 0)\n throw error_t ();\n }\n\n inline void *data ()\n {\n return zmq_msg_data (&msg);\n }\n\n inline const void* data () const\n {\n return zmq_msg_data (const_cast<zmq_msg_t*>(&msg));\n }\n\n inline size_t size () const\n {\n return zmq_msg_size (const_cast<zmq_msg_t*>(&msg));\n }\n\n private:\n\n \/\/ The underlying message\n zmq_msg_t msg;\n\n \/\/ Disable implicit message copying, so that users won't use shared\n \/\/ messages (less efficient) without being aware of the fact.\n message_t (const message_t&);\n void operator = (const message_t&);\n };\n\n class context_t\n {\n friend class socket_t;\n\n public:\n\n inline explicit context_t (int io_threads_)\n {\n ptr = zmq_init (io_threads_);\n if (ptr == NULL)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline context_t (context_t &&rhs) : ptr (rhs.ptr)\n {\n rhs.ptr = NULL;\n }\n inline context_t &operator = (context_t &&rhs)\n {\n std::swap (ptr, rhs.ptr);\n return *this;\n }\n#endif\n\n inline ~context_t ()\n {\n close();\n }\n\n inline void close()\n {\n if (ptr == NULL)\n return;\n int rc = zmq_term (ptr);\n ZMQ_ASSERT (rc == 0);\n ptr = NULL;\n }\n\n \/\/ Be careful with this, it's probably only useful for\n \/\/ using the C api together with an existing C++ api.\n \/\/ Normally you should never need to use this.\n inline operator void* ()\n {\n return ptr;\n }\n\n private:\n\n void *ptr;\n\n context_t (const context_t&);\n void operator = (const context_t&);\n };\n\n class socket_t\n {\n\t\tfriend class monitor_t;\n public:\n\n inline socket_t (context_t &context_, int type_)\n {\n ctxptr = context_.ptr;\n ptr = zmq_socket (context_.ptr, type_);\n if (ptr == NULL)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline socket_t(socket_t&& rhs) : ptr(rhs.ptr)\n {\n rhs.ptr = NULL;\n }\n inline socket_t& operator=(socket_t&& rhs)\n {\n std::swap(ptr, rhs.ptr);\n return *this;\n }\n#endif\n\n inline ~socket_t ()\n {\n close();\n }\n\n inline operator void* ()\n {\n return ptr;\n }\n\n inline void close()\n {\n if(ptr == NULL)\n \/\/ already closed\n return ;\n int rc = zmq_close (ptr);\n ZMQ_ASSERT (rc == 0);\n ptr = 0 ;\n }\n\n inline void setsockopt (int option_, const void *optval_,\n size_t optvallen_)\n {\n int rc = zmq_setsockopt (ptr, option_, optval_, optvallen_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void getsockopt (int option_, void *optval_,\n size_t *optvallen_)\n {\n int rc = zmq_getsockopt (ptr, option_, optval_, optvallen_);\n if (rc != 0)\n throw error_t ();\n }\n \n inline void bind (const char *addr_)\n {\n int rc = zmq_bind (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void unbind (const char *addr_)\n {\n int rc = zmq_unbind (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void connect (const char *addr_)\n {\n int rc = zmq_connect (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void disconnect (const char *addr_)\n {\n int rc = zmq_disconnect (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline bool connected()\n {\n return(ptr != NULL);\n }\n\t\t\n inline size_t send (const void *buf_, size_t len_, int flags_ = 0)\n {\n int nbytes = zmq_send (ptr, buf_, len_, flags_);\n if (nbytes >= 0)\n return (size_t) nbytes;\n if (zmq_errno () == EAGAIN)\n return 0;\n throw error_t ();\n }\n\n inline bool send (message_t &msg_, int flags_ = 0)\n {\n int nbytes = zmq_msg_send (&(msg_.msg), ptr, flags_);\n if (nbytes >= 0)\n return true;\n if (zmq_errno () == EAGAIN)\n return false;\n throw error_t ();\n }\n\n inline size_t recv (void *buf_, size_t len_, int flags_ = 0)\n {\n int nbytes = zmq_recv (ptr, buf_, len_, flags_);\n if (nbytes >= 0)\n return (size_t) nbytes;\n if (zmq_errno () == EAGAIN)\n return 0;\n throw error_t ();\n }\n\n inline bool recv (message_t *msg_, int flags_ = 0)\n {\n int nbytes = zmq_msg_recv (&(msg_->msg), ptr, flags_);\n if (nbytes >= 0)\n return true;\n if (zmq_errno () == EAGAIN)\n return false;\n throw error_t ();\n }\n \n private:\n void *ptr;\n void *ctxptr;\n\n socket_t (const socket_t&) ZMQ_DELETED_FUNCTION;\n void operator = (const socket_t&) ZMQ_DELETED_FUNCTION;\n };\n\n\tclass monitor_t\n\t{\n\tpublic:\n\t\tvirtual ~monitor_t() {}\n\n\t\tvoid monitor(socket_t& socket, const char *addr_, int events = ZMQ_EVENT_ALL)\n\t\t{\n\t\t\tint rc = zmq_socket_monitor(socket.ptr, addr_, events);\n\t\t\tif (rc != 0)\n\t\t\t\tthrow error_t ();\n\n\t\t\tvoid *s = zmq_socket (socket.ctxptr, ZMQ_PAIR);\n\t\t\tassert (s);\n\n\t\t\trc = zmq_connect (s, addr_);\n\t\t\tassert (rc == 0);\n\t\t\twhile (true) {\n\t\t\t\tzmq_msg_t msg;\n\t\t\t\tzmq_msg_init (&msg);\n\t\t\t\trc = zmq_recvmsg (s, &msg, 0);\n\t\t\t\tif (rc == -1 && zmq_errno() == ETERM)\n\t\t\t\t\tbreak;\n\t\t\t\tassert (rc != -1);\n\t\t\t\t\n\t\t\t\tzmq_event_t* event = static_cast<zmq_event_t*>(zmq_msg_data (&msg));\n\n\t\t\t\tswitch (event->event) {\n\t\t\t\tcase ZMQ_EVENT_CONNECTED:\n\t\t\t\t\ton_event_connected(event->data.connected.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CONNECT_DELAYED:\n\t\t\t\t\ton_event_connect_delayed(event->data.connect_delayed.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CONNECT_RETRIED:\n\t\t\t\t\ton_event_connect_retried(event->data.connect_retried.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_LISTENING:\n\t\t\t\t\ton_event_listening(event->data.listening.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_BIND_FAILED:\n\t\t\t\t\ton_event_bind_failed(event->data.bind_failed.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_ACCEPTED:\n\t\t\t\t\ton_event_accepted(event->data.accepted.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_ACCEPT_FAILED:\n\t\t\t\t\ton_event_accept_failed(event->data.accept_failed.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CLOSED:\n\t\t\t\t\ton_event_closed(event->data.closed.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CLOSE_FAILED:\n\t\t\t\t\ton_event_close_failed(event->data.close_failed.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_DISCONNECTED:\n\t\t\t\t\ton_event_disconnected(event->data.disconnected.addr);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\ton_event_unknown(event->event);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tzmq_msg_close (&msg);\n\t\t\t}\n\t\t\tzmq_close (s);\n\t\t}\n\n\t\tvirtual void on_event_connected(const char *addr_) {}\n\t\tvirtual void on_event_connect_delayed(const char *addr_) {}\n\t\tvirtual void on_event_connect_retried(const char *addr_) {}\n\t\tvirtual void on_event_listening(const char *addr_) {}\n\t\tvirtual void on_event_bind_failed(const char *addr_) {}\n\t\tvirtual void on_event_accepted(const char *addr_) {}\n\t\tvirtual void on_event_accept_failed(const char *addr_) {}\n\t\tvirtual void on_event_closed(const char *addr_) {}\n\t\tvirtual void on_event_close_failed(const char *addr_) {}\n\t\tvirtual void on_event_disconnected(const char *addr_) {}\n\t\tvirtual void on_event_unknown(int event) {}\n\t};\n}\n\n#endif\n<commit_msg>Parse event structure as data for event handlers.<commit_after>\/*\n Copyright (c) 2009-2011 250bpm s.r.o.\n Copyright (c) 2011 Botond Ballo\n Copyright (c) 2007-2009 iMatix Corporation\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to\n deal in the Software without restriction, including without limitation the\n rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n sell copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n IN THE SOFTWARE.\n*\/\n\n#ifndef __ZMQ_HPP_INCLUDED__\n#define __ZMQ_HPP_INCLUDED__\n\n#include <zmq.h>\n\n#include <algorithm>\n#include <cassert>\n#include <cstring>\n#include <exception>\n\n\/\/ Detect whether the compiler supports C++11 rvalue references.\n#if (defined(__GNUC__) && (__GNUC__ > 4 || \\\n (__GNUC__ == 4 && __GNUC_MINOR__ > 2)) && \\\n defined(__GXX_EXPERIMENTAL_CXX0X__))\n #define ZMQ_HAS_RVALUE_REFS\n #define ZMQ_DELETED_FUNCTION = delete\n#elif defined(__clang__)\n #if __has_feature(cxx_rvalue_references)\n #define ZMQ_HAS_RVALUE_REFS\n #endif\n\n #if __has_feature(cxx_deleted_functions)\n #define ZMQ_DELETED_FUNCTION = delete\n #else\n #define ZMQ_DELETED_FUNCTION\n #endif\n#elif defined(_MSC_VER) && (_MSC_VER >= 1600)\n #define ZMQ_HAS_RVALUE_REFS\n #define ZMQ_DELETED_FUNCTION\n#else\n #define ZMQ_DELETED_FUNCTION\n#endif\n\n\/\/ In order to prevent unused variable warnings when building in non-debug\n\/\/ mode use this macro to make assertions.\n#ifndef NDEBUG\n# define ZMQ_ASSERT(expression) assert(expression)\n#else\n# define ZMQ_ASSERT(expression) (void)(expression)\n#endif\n\nnamespace zmq\n{\n\n typedef zmq_free_fn free_fn;\n typedef zmq_pollitem_t pollitem_t;\n\n class error_t : public std::exception\n {\n public:\n\n error_t () : errnum (zmq_errno ()) {}\n\n virtual const char *what () const throw ()\n {\n return zmq_strerror (errnum);\n }\n\n int num () const\n {\n return errnum;\n }\n\n private:\n\n int errnum;\n };\n\n inline int poll (zmq_pollitem_t *items_, int nitems_, long timeout_ = -1)\n {\n int rc = zmq_poll (items_, nitems_, timeout_);\n if (rc < 0)\n throw error_t ();\n return rc;\n }\n\n inline void proxy (void *frontend, void *backend, void *capture)\n {\n int rc = zmq_proxy (frontend, backend, capture);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void version (int *major_, int *minor_, int *patch_)\n {\n zmq_version (major_, minor_, patch_);\n }\n\n class message_t\n {\n friend class socket_t;\n\n public:\n\n inline message_t ()\n {\n int rc = zmq_msg_init (&msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline explicit message_t (size_t size_)\n {\n int rc = zmq_msg_init_size (&msg, size_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline message_t (void *data_, size_t size_, free_fn *ffn_,\n void *hint_ = NULL)\n {\n int rc = zmq_msg_init_data (&msg, data_, size_, ffn_, hint_);\n if (rc != 0)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline message_t (message_t &&rhs) : msg (rhs.msg)\n {\n int rc = zmq_msg_init (&rhs.msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline message_t &operator = (message_t &&rhs)\n {\n std::swap (msg, rhs.msg);\n return *this;\n }\n#endif\n\n inline ~message_t ()\n {\n int rc = zmq_msg_close (&msg);\n ZMQ_ASSERT (rc == 0);\n }\n\n inline void rebuild ()\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init (&msg);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void rebuild (size_t size_)\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init_size (&msg, size_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void rebuild (void *data_, size_t size_, free_fn *ffn_,\n void *hint_ = NULL)\n {\n int rc = zmq_msg_close (&msg);\n if (rc != 0)\n throw error_t ();\n rc = zmq_msg_init_data (&msg, data_, size_, ffn_, hint_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void move (message_t *msg_)\n {\n int rc = zmq_msg_move (&msg, &(msg_->msg));\n if (rc != 0)\n throw error_t ();\n }\n\n inline void copy (message_t *msg_)\n {\n int rc = zmq_msg_copy (&msg, &(msg_->msg));\n if (rc != 0)\n throw error_t ();\n }\n\n inline void *data ()\n {\n return zmq_msg_data (&msg);\n }\n\n inline const void* data () const\n {\n return zmq_msg_data (const_cast<zmq_msg_t*>(&msg));\n }\n\n inline size_t size () const\n {\n return zmq_msg_size (const_cast<zmq_msg_t*>(&msg));\n }\n\n private:\n\n \/\/ The underlying message\n zmq_msg_t msg;\n\n \/\/ Disable implicit message copying, so that users won't use shared\n \/\/ messages (less efficient) without being aware of the fact.\n message_t (const message_t&);\n void operator = (const message_t&);\n };\n\n class context_t\n {\n friend class socket_t;\n\n public:\n\n inline explicit context_t (int io_threads_)\n {\n ptr = zmq_init (io_threads_);\n if (ptr == NULL)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline context_t (context_t &&rhs) : ptr (rhs.ptr)\n {\n rhs.ptr = NULL;\n }\n inline context_t &operator = (context_t &&rhs)\n {\n std::swap (ptr, rhs.ptr);\n return *this;\n }\n#endif\n\n inline ~context_t ()\n {\n close();\n }\n\n inline void close()\n {\n if (ptr == NULL)\n return;\n int rc = zmq_term (ptr);\n ZMQ_ASSERT (rc == 0);\n ptr = NULL;\n }\n\n \/\/ Be careful with this, it's probably only useful for\n \/\/ using the C api together with an existing C++ api.\n \/\/ Normally you should never need to use this.\n inline operator void* ()\n {\n return ptr;\n }\n\n private:\n\n void *ptr;\n\n context_t (const context_t&);\n void operator = (const context_t&);\n };\n\n class socket_t\n {\n\t\tfriend class monitor_t;\n public:\n\n inline socket_t (context_t &context_, int type_)\n {\n ctxptr = context_.ptr;\n ptr = zmq_socket (context_.ptr, type_);\n if (ptr == NULL)\n throw error_t ();\n }\n\n#ifdef ZMQ_HAS_RVALUE_REFS\n inline socket_t(socket_t&& rhs) : ptr(rhs.ptr)\n {\n rhs.ptr = NULL;\n }\n inline socket_t& operator=(socket_t&& rhs)\n {\n std::swap(ptr, rhs.ptr);\n return *this;\n }\n#endif\n\n inline ~socket_t ()\n {\n close();\n }\n\n inline operator void* ()\n {\n return ptr;\n }\n\n inline void close()\n {\n if(ptr == NULL)\n \/\/ already closed\n return ;\n int rc = zmq_close (ptr);\n ZMQ_ASSERT (rc == 0);\n ptr = 0 ;\n }\n\n inline void setsockopt (int option_, const void *optval_,\n size_t optvallen_)\n {\n int rc = zmq_setsockopt (ptr, option_, optval_, optvallen_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void getsockopt (int option_, void *optval_,\n size_t *optvallen_)\n {\n int rc = zmq_getsockopt (ptr, option_, optval_, optvallen_);\n if (rc != 0)\n throw error_t ();\n }\n \n inline void bind (const char *addr_)\n {\n int rc = zmq_bind (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void unbind (const char *addr_)\n {\n int rc = zmq_unbind (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void connect (const char *addr_)\n {\n int rc = zmq_connect (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline void disconnect (const char *addr_)\n {\n int rc = zmq_disconnect (ptr, addr_);\n if (rc != 0)\n throw error_t ();\n }\n\n inline bool connected()\n {\n return(ptr != NULL);\n }\n\t\t\n inline size_t send (const void *buf_, size_t len_, int flags_ = 0)\n {\n int nbytes = zmq_send (ptr, buf_, len_, flags_);\n if (nbytes >= 0)\n return (size_t) nbytes;\n if (zmq_errno () == EAGAIN)\n return 0;\n throw error_t ();\n }\n\n inline bool send (message_t &msg_, int flags_ = 0)\n {\n int nbytes = zmq_msg_send (&(msg_.msg), ptr, flags_);\n if (nbytes >= 0)\n return true;\n if (zmq_errno () == EAGAIN)\n return false;\n throw error_t ();\n }\n\n inline size_t recv (void *buf_, size_t len_, int flags_ = 0)\n {\n int nbytes = zmq_recv (ptr, buf_, len_, flags_);\n if (nbytes >= 0)\n return (size_t) nbytes;\n if (zmq_errno () == EAGAIN)\n return 0;\n throw error_t ();\n }\n\n inline bool recv (message_t *msg_, int flags_ = 0)\n {\n int nbytes = zmq_msg_recv (&(msg_->msg), ptr, flags_);\n if (nbytes >= 0)\n return true;\n if (zmq_errno () == EAGAIN)\n return false;\n throw error_t ();\n }\n \n private:\n void *ptr;\n void *ctxptr;\n\n socket_t (const socket_t&) ZMQ_DELETED_FUNCTION;\n void operator = (const socket_t&) ZMQ_DELETED_FUNCTION;\n };\n\n\tclass monitor_t\n\t{\n\tpublic:\n\t\tvirtual ~monitor_t() {}\n\n\t\tvoid monitor(socket_t &socket, const char *addr_, int events = ZMQ_EVENT_ALL)\n\t\t{\n\t\t\tint rc = zmq_socket_monitor(socket.ptr, addr_, events);\n\t\t\tif (rc != 0)\n\t\t\t\tthrow error_t ();\n\n\t\t\tvoid *s = zmq_socket (socket.ctxptr, ZMQ_PAIR);\n\t\t\tassert (s);\n\n\t\t\trc = zmq_connect (s, addr_);\n\t\t\tassert (rc == 0);\n\t\t\twhile (true) {\n\t\t\t\tzmq_msg_t msg;\n\t\t\t\tzmq_msg_init (&msg);\n\t\t\t\trc = zmq_recvmsg (s, &msg, 0);\n\t\t\t\tif (rc == -1 && zmq_errno() == ETERM)\n\t\t\t\t\tbreak;\n\t\t\t\tassert (rc != -1);\n\t\t\t\t\n\t\t\t\tzmq_event_t* event = static_cast<zmq_event_t*>(zmq_msg_data (&msg));\n\n\t\t\t\tswitch (event->event) {\n\t\t\t\tcase ZMQ_EVENT_CONNECTED:\n\t\t\t\t\ton_event_connected(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CONNECT_DELAYED:\n\t\t\t\t\ton_event_connect_delayed(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CONNECT_RETRIED:\n\t\t\t\t\ton_event_connect_retried(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_LISTENING:\n\t\t\t\t\ton_event_listening(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_BIND_FAILED:\n\t\t\t\t\ton_event_bind_failed(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_ACCEPTED:\n\t\t\t\t\ton_event_accepted(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_ACCEPT_FAILED:\n\t\t\t\t\ton_event_accept_failed(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CLOSED:\n\t\t\t\t\ton_event_closed(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_CLOSE_FAILED:\n\t\t\t\t\ton_event_close_failed(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tcase ZMQ_EVENT_DISCONNECTED:\n\t\t\t\t\ton_event_disconnected(*event);\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\ton_event_unknown(*event);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tzmq_msg_close (&msg);\n\t\t\t}\n\t\t\tzmq_close (s);\n\t\t}\n\n\t\tvirtual void on_event_connected(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_connect_delayed(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_connect_retried(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_listening(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_bind_failed(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_accepted(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_accept_failed(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_closed(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_close_failed(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_disconnected(const zmq_event_t &event_) {}\n\t\tvirtual void on_event_unknown(const zmq_event_t &event_) {}\n\t};\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015, Galaxy Authors. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com, sunjunyi01@baidu.com\n\n#include <string>\n#include <stdint.h>\n#include <gflags\/gflags.h>\n\nDEFINE_string(master_port, \"8101\", \"master rpc-server listen on this port\");\nDEFINE_string(agent_port, \"8102\", \"agent rpc-server listen on this port\");\nDEFINE_int32(agent_http_port, 8089, \"agent http-server listen on this port\");\nDEFINE_int32(agent_http_server_threads, 10, \"agent http-server thread pool size\");\n\nDEFINE_string(master_addr, \"localhost:\" + FLAGS_master_port, \"master rpc-server endpoint\");\nDEFINE_int32(task_retry_times, 3, \"retry times of task \");\nDEFINE_int32(task_deploy_timeout, 20, \"task package deploy timeout\");\nDEFINE_int32(agent_keepalive_timeout, 20, \"keepalive timeout of agent\");\n\nDEFINE_string(agent_work_dir, \"\/tmp\", \"agent work directory\");\nDEFINE_string(container, \"cmd\", \"container type : cmd or cgroup\");\n\nDEFINE_string(cgroup_root, \"\/cgroups\", \"cgroup mount point\");\nDEFINE_int32(agent_curl_recv_buffer_size, 1024 * 10, \"agent downloader recv buffer size\");\n\nDEFINE_double(cpu_num, 4, \"cpu number\");\n\nDEFINE_int32(resource_collector_engine_interval, 1000, \"rc collect engine interval\");\n\nDEFINE_int64(mem_gbytes, 32, \"mem in giga bytes\");\nDEFINE_int64(mem_bytes, FLAGS_mem_gbytes * 1024 * 1024 * 1024, \"mem in bytes\");\n\/\/ 5 hour\nDEFINE_int32(agent_gc_timeout, 1000 * 60 * 60 * 5, \"garbage collection timeout\");\n\nDEFINE_string(task_acct, \"galaxy\", \"task user\/role of system\");\n\nDEFINE_string(master_checkpoint_path, \".\/data\/\", \"directory of master checkpoint data\");\nDEFINE_int32(master_max_len_sched_task_list, 30, \"max length of scheduled tasks of a job\");\nDEFINE_int32(master_safe_mode_last, 30, \"how many seconds the safe-mode goes on\");\nDEFINE_int32(agent_cgroup_clear_retry_times, 20, \"how many times for retry destroy cgroup\");\nDEFINE_int32(agent_app_stop_wait_retry_times, 10, \"how many times for stop wait\");\nDEFINE_string(monitor_conf_path, \"\", \"path of monitor conf\");\n\nDEFINE_int32(agent_cgroup_clear_retry_times, 50, \"how many times for retry destroy cgroup\");\nDEFINE_string(pam_pwd_dir, \"\/tmp\/\", \"directory that stores galaxy-ssh passwords on agent node\");\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<commit_msg>fix merge-conflict<commit_after>\/\/ Copyright (c) 2015, Galaxy Authors. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com, sunjunyi01@baidu.com\n\n#include <string>\n#include <stdint.h>\n#include <gflags\/gflags.h>\n\nDEFINE_string(master_port, \"8101\", \"master rpc-server listen on this port\");\nDEFINE_string(agent_port, \"8102\", \"agent rpc-server listen on this port\");\nDEFINE_int32(agent_http_port, 8089, \"agent http-server listen on this port\");\nDEFINE_int32(agent_http_server_threads, 10, \"agent http-server thread pool size\");\n\nDEFINE_string(master_addr, \"localhost:\" + FLAGS_master_port, \"master rpc-server endpoint\");\nDEFINE_int32(task_retry_times, 3, \"retry times of task \");\nDEFINE_int32(task_deploy_timeout, 20, \"task package deploy timeout\");\nDEFINE_int32(agent_keepalive_timeout, 20, \"keepalive timeout of agent\");\n\nDEFINE_string(agent_work_dir, \"\/tmp\", \"agent work directory\");\nDEFINE_string(container, \"cmd\", \"container type : cmd or cgroup\");\n\nDEFINE_string(cgroup_root, \"\/cgroups\", \"cgroup mount point\");\nDEFINE_int32(agent_curl_recv_buffer_size, 1024 * 10, \"agent downloader recv buffer size\");\n\nDEFINE_double(cpu_num, 4, \"cpu number\");\n\nDEFINE_int32(resource_collector_engine_interval, 1000, \"rc collect engine interval\");\n\nDEFINE_int64(mem_gbytes, 32, \"mem in giga bytes\");\nDEFINE_int64(mem_bytes, FLAGS_mem_gbytes * 1024 * 1024 * 1024, \"mem in bytes\");\n\/\/ 5 hour\nDEFINE_int32(agent_gc_timeout, 1000 * 60 * 60 * 5, \"garbage collection timeout\");\n\nDEFINE_string(task_acct, \"galaxy\", \"task user\/role of system\");\n\nDEFINE_string(master_checkpoint_path, \".\/data\/\", \"directory of master checkpoint data\");\nDEFINE_int32(master_max_len_sched_task_list, 30, \"max length of scheduled tasks of a job\");\nDEFINE_int32(master_safe_mode_last, 30, \"how many seconds the safe-mode goes on\");\nDEFINE_int32(agent_cgroup_clear_retry_times, 20, \"how many times for retry destroy cgroup\");\nDEFINE_int32(agent_app_stop_wait_retry_times, 10, \"how many times for stop wait\");\nDEFINE_string(monitor_conf_path, \"\", \"path of monitor conf\");\n\nDEFINE_string(pam_pwd_dir, \"\/tmp\/\", \"directory that stores galaxy-ssh passwords on agent node\");\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<|endoftext|>"} {"text":"<commit_before>\n#include <form.h>\n#include <taghelper.h>\n\nForm::Form(Stanza stanza): type() {\n\ttag = stanza->find(\"command\/x\");\n\tif(tag == 0) {\n\t\ttag = new ATXmlTag(\"x\");\n\t\ttag->setDefaultNameSpaceAttribute(\"jabber:x:data\");\n\t\ttag->setAttribute(\"type\", \"submit\"); \/\/ Считаем, что создаём форму на основе субмита от юзера\n\t\treturn;\n\t}\n\ttype = tag->getAttribute(\"type\", \"\");\n}\n\nForm::Form(ATXmlTag *from): type() {\n\ttag = from;\n\ttype = from->getAttribute(\"type\", \"\");\n}\n\nForm::Form(std::string x_type): type() {\n\ttag = new ATXmlTag(\"x\");\n\ttag->setDefaultNameSpaceAttribute(\"jabber:x:data\");\n\ttag->setAttribute(\"type\", x_type);\n\ttype = x_type;\n}\n\nForm::~Form() {\n\t\/\/ Удалять ли tag, и если да, то при каких условиях?\n\t\/\/ TODO: разобраться после реализации ad-hoc\n}\n\nATXmlTag *Form::asTag() {\n\treturn tag;\n}\n\nvoid Form::setTitle(std::string form_title) {\n\tATXmlTag *title = new ATXmlTag(\"title\");\n\ttitle->insertCharacterData(form_title);\n\ttag->insertChildElement(title);\n}\n\nvoid Form::setInstructions(std::string form_instructions) {\n\tATXmlTag *instructions = new ATXmlTag(\"instructions\");\n\tinstructions->insertCharacterData(form_instructions);\n\ttag->insertChildElement(instructions);\n}\n\nvoid Form::insertLineEdit(std::string var, std::string label, std::string value, bool required) {\n\tATXmlTag *field = new ATXmlTag(\"field\");\n\tfield->setAttribute(\"type\", \"text-single\");\n\tfield->setAttribute(\"var\", var);\n\tfield->setAttribute(\"label\", label);\n\t\n\tATXmlTag *value_tag = new ATXmlTag(\"value\");\n\tvalue_tag->insertCharacterData(value);\n\tfield->insertChildElement(value_tag);\n\t\n\tif(required) {\n\t\tfield->insertChildElement(new ATXmlTag(\"required\"));\n\t}\n\t\n\ttag->insertChildElement(field);\n}\n\nvoid Form::insertTextEdit(std::string var, std::string label, std::string value, bool required) {\n\tATXmlTag *field = new ATXmlTag(\"field\");\n\tfield->setAttribute(\"type\", \"text-multi\");\n\tfield->setAttribute(\"var\", var);\n\tfield->setAttribute(\"label\", label);\n\t\n\tATXmlTag *value_tag = new ATXmlTag(\"value\");\n\tvalue_tag->insertCharacterData(value);\n\tfield->insertChildElement(value_tag);\n\t\n\tif(required) {\n\t\tfield->insertChildElement(new ATXmlTag(\"required\"));\n\t}\n\t\n\ttag->insertChildElement(field);\n}\n\nstd::string Form::getFieldValue(std::string field_name, std::string default_value) {\n\t\/\/ TODO\n\tATXmlTag *field = tag->getChildByAttribute(\"field\", \"var\", field_name);\n\tif(!field) {\n\t\treturn std::string(\"\");\n\t}\n\tif(!field->hasChild(\"value\")) {\n\t\treturn std::string(\"\");\n\t}\n\tATXmlTag *value = field->getChild(\"value\");\n\treturn value->getCharacterData();\n}\n\n\/\/ TODO: другие типы виджетов\n\n<commit_msg>По мелочи: реализовал одну фишку, но забыл убрать TODO<commit_after>\n#include <form.h>\n#include <taghelper.h>\n\nForm::Form(Stanza stanza): type() {\n\ttag = stanza->find(\"command\/x\");\n\tif(tag == 0) {\n\t\ttag = new ATXmlTag(\"x\");\n\t\ttag->setDefaultNameSpaceAttribute(\"jabber:x:data\");\n\t\ttag->setAttribute(\"type\", \"submit\"); \/\/ Считаем, что создаём форму на основе субмита от юзера\n\t\treturn;\n\t}\n\ttype = tag->getAttribute(\"type\", \"\");\n}\n\nForm::Form(ATXmlTag *from): type() {\n\ttag = from;\n\ttype = from->getAttribute(\"type\", \"\");\n}\n\nForm::Form(std::string x_type): type() {\n\ttag = new ATXmlTag(\"x\");\n\ttag->setDefaultNameSpaceAttribute(\"jabber:x:data\");\n\ttag->setAttribute(\"type\", x_type);\n\ttype = x_type;\n}\n\nForm::~Form() {\n\t\/\/ Удалять ли tag, и если да, то при каких условиях?\n\t\/\/ TODO: разобраться после реализации ad-hoc\n}\n\nATXmlTag *Form::asTag() {\n\treturn tag;\n}\n\nvoid Form::setTitle(std::string form_title) {\n\tATXmlTag *title = new ATXmlTag(\"title\");\n\ttitle->insertCharacterData(form_title);\n\ttag->insertChildElement(title);\n}\n\nvoid Form::setInstructions(std::string form_instructions) {\n\tATXmlTag *instructions = new ATXmlTag(\"instructions\");\n\tinstructions->insertCharacterData(form_instructions);\n\ttag->insertChildElement(instructions);\n}\n\nvoid Form::insertLineEdit(std::string var, std::string label, std::string value, bool required) {\n\tATXmlTag *field = new ATXmlTag(\"field\");\n\tfield->setAttribute(\"type\", \"text-single\");\n\tfield->setAttribute(\"var\", var);\n\tfield->setAttribute(\"label\", label);\n\t\n\tATXmlTag *value_tag = new ATXmlTag(\"value\");\n\tvalue_tag->insertCharacterData(value);\n\tfield->insertChildElement(value_tag);\n\t\n\tif(required) {\n\t\tfield->insertChildElement(new ATXmlTag(\"required\"));\n\t}\n\t\n\ttag->insertChildElement(field);\n}\n\nvoid Form::insertTextEdit(std::string var, std::string label, std::string value, bool required) {\n\tATXmlTag *field = new ATXmlTag(\"field\");\n\tfield->setAttribute(\"type\", \"text-multi\");\n\tfield->setAttribute(\"var\", var);\n\tfield->setAttribute(\"label\", label);\n\t\n\tATXmlTag *value_tag = new ATXmlTag(\"value\");\n\tvalue_tag->insertCharacterData(value);\n\tfield->insertChildElement(value_tag);\n\t\n\tif(required) {\n\t\tfield->insertChildElement(new ATXmlTag(\"required\"));\n\t}\n\t\n\ttag->insertChildElement(field);\n}\n\nstd::string Form::getFieldValue(std::string field_name, std::string default_value) {\n\tATXmlTag *field = tag->getChildByAttribute(\"field\", \"var\", field_name);\n\tif(!field) {\n\t\treturn std::string(\"\");\n\t}\n\tif(!field->hasChild(\"value\")) {\n\t\treturn std::string(\"\");\n\t}\n\tATXmlTag *value = field->getChild(\"value\");\n\treturn value->getCharacterData();\n}\n\n\/\/ TODO: другие типы виджетов\n\n<|endoftext|>"} {"text":"<commit_before>#include <ncurses.h>\n\n#include <string>\n#include <random>\n\n#include \"game.h\"\n#include \"InfoPanel.h\"\n\nusing namespace std;\n\nvoid menuShow(WINDOW *wnd, string title);\nvoid startGame();\n\nWINDOW *wmenu, *wmain;\n\nInfoPanel *infoPanel = new InfoPanel();\n\nstruct {\n vec2i pos;\n rect bounds;\n char disp_char;\n} player;\n\nrect game_area;\n\nint init() {\n\n initscr();\n\n \/*\n * init main window\n *\/\n\n wmain = newwin(40, 80, 1, 1);\n box(wmain, 0, 0);\n\n \/*\n * init menu window\n *\/\n\n wmenu = newwin(10, 12, 10, 10);\n wborder(wmenu,\n ACS_BULLET, ACS_BULLET, ACS_BULLET, ACS_BULLET, \/* ls, rs, ts, bs *\/\n '+', '+', '+', '+'); \/* tl, tr, bl, br *\/\n\n noecho();\n keypad(wmenu, true);\n curs_set(0);\n\n return 0;\n}\n\nvoid run() {\n char menuItems[2][10] = {\n \"start\",\n \"quit\"\n };\n char menuItem[7];\n int ch, i = 0, width = 7;\n\n\n \/*\n * init title, menu\n *\/\n\n for (i = 0; i < 2; i++) {\n if (i == 0) wattron(wmenu, A_STANDOUT);\n else wattroff(wmenu, A_STANDOUT);\n\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n }\n\n wrefresh(wmain);\n wrefresh(wmenu);\n infoPanel->update();\n menuShow(wmain, \"TERMINAL QUEST\");\n i = 0;\n\n string infoPos, infoKey, infoMsg;\n bool exitRequested = false, gameRequested = false;\n while (( ch = wgetch(wmenu)) != 'q') {\n infoMsg = \"\";\n infoPos = to_string(ch);\n infoKey = to_string(i);\n\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n\n switch (ch) {\n case KEY_UP:\n case 'k':\n i--;\n i = (i < 0) ? 1 : i;\n infoMsg = \"up\";\n break;\n case KEY_DOWN:\n case 'j':\n i++;\n i = (i > 1) ? 0: i;\n infoMsg = \"down\";\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n if (i == 1) exitRequested = true;\n else if (i == 0) gameRequested = true;\n break;\n\n }\n\n infoPanel->push((infoPos + ' ' + infoKey + ' ' + infoMsg));\n\n wattron(wmenu, A_STANDOUT);\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n wattroff(wmenu, A_STANDOUT);\n\n if (exitRequested == true) {\n break;\n } else if (gameRequested) {\n delwin(wmenu);\n delwin(wmain);\n\n startGame();\n break;\n }\n }\n\n \/*\n * exit\n *\/\n\n endwin();\n\n}\n\nvoid close() {\n endwin();\n}\n\nvoid menuShow(WINDOW *wnd, string title) {\n\n wmove(wnd, 5, 5);\n\n for (size_t i = 0; i < title.size(); i++) {\n waddch(wnd, title[i]);\n waddch(wnd, ' ');\n }\n\n wrefresh(wnd);\n}\n\nvoid startGame() {\n\n game_area = {\n {0, 0},\n {80, 40}\n };\n\n WINDOW *wgame = newwin(40, 80, 1, 1);\n box(wgame, 0, 0);\n keypad(wgame, true);\n\n \/*\n * Randomly place player anywhere in game area\n *\/\n random_device rd;\n uniform_int_distribution<int> distx(game_area.left(), game_area.right());\n uniform_int_distribution<int> disty(game_area.top(), game_area.bot());\n int randx = distx(rd) + 1;\n int randy = disty(rd) + 1;\n player.pos = {\n randx, randy\n };\n player.disp_char = '@';\n\n wmove(wgame, player.pos.y, player.pos.x);\n waddch(wgame, player.disp_char);\n\n int ch, i;\n string infoKey, infoMsg;\n vec2i infoPos;\n while (( ch = wgetch(wgame)) != 'q') {\n\n infoMsg = \"\";\n infoKey = to_string(ch);\n\n werase(wgame);\n box(wgame, 0, 0);\n\n switch (ch) {\n case KEY_UP:\n case 'k':\n if (player.pos.y > game_area.top() + 1) player.pos.y--;\n break;\n case KEY_DOWN:\n case 'j':\n if (player.pos.y < game_area.bot() - 2) player.pos.y++;\n break;\n case KEY_LEFT:\n case 'h':\n if (player.pos.x > game_area.left() + 1) player.pos.x--;\n break;\n case KEY_RIGHT:\n case 'l':\n if (player.pos.x < game_area.right() - 2) player.pos.x++;\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n break;\n\n }\n\n wmove(wgame, player.pos.y, player.pos.x);\n waddch(wgame, player.disp_char);\n\n infoPanel->push('{'\n + std::to_string(player.pos.x) + ','\n + std::to_string(player.pos.y) + '}'\n + \" - right & left: {\"\n + std::to_string(game_area.right()) + ','\n + std::to_string(game_area.left()) + '}'\n + \" top & bot: {\"\n + std::to_string(game_area.top()) + ','\n + std::to_string(game_area.bot()) + '}'\n );\n\n wrefresh(wgame);\n\n }\n\n delwin(wgame);\n}\n\n<commit_msg>Add todo note re splitting up game<commit_after>#include <ncurses.h>\n\n#include <string>\n#include <random>\n\n#include \"game.h\"\n#include \"InfoPanel.h\"\n\nusing namespace std;\n\nvoid menuShow(WINDOW *wnd, string title);\nvoid startGame();\n\nWINDOW *wmenu, *wmain;\n\nInfoPanel *infoPanel = new InfoPanel();\n\nstruct {\n vec2i pos;\n rect bounds;\n char disp_char;\n} player;\n\nrect game_area;\n\nint init() {\n\n initscr();\n\n \/*\n * init main window\n *\/\n\n wmain = newwin(40, 80, 1, 1);\n box(wmain, 0, 0);\n\n \/*\n * init menu window\n *\/\n\n wmenu = newwin(10, 12, 10, 10);\n wborder(wmenu,\n ACS_BULLET, ACS_BULLET, ACS_BULLET, ACS_BULLET, \/* ls, rs, ts, bs *\/\n '+', '+', '+', '+'); \/* tl, tr, bl, br *\/\n\n noecho();\n keypad(wmenu, true);\n curs_set(0);\n\n return 0;\n}\n\nvoid run() {\n char menuItems[2][10] = {\n \"start\",\n \"quit\"\n };\n char menuItem[7];\n int ch, i = 0, width = 7;\n\n\n \/*\n * init title, menu\n *\/\n\n for (i = 0; i < 2; i++) {\n if (i == 0) wattron(wmenu, A_STANDOUT);\n else wattroff(wmenu, A_STANDOUT);\n\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n }\n\n wrefresh(wmain);\n wrefresh(wmenu);\n infoPanel->update();\n menuShow(wmain, \"TERMINAL QUEST\");\n i = 0;\n\n string infoPos, infoKey, infoMsg;\n bool exitRequested = false, gameRequested = false;\n while (( ch = wgetch(wmenu)) != 'q') {\n infoMsg = \"\";\n infoPos = to_string(ch);\n infoKey = to_string(i);\n\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n\n switch (ch) {\n case KEY_UP:\n case 'k':\n i--;\n i = (i < 0) ? 1 : i;\n infoMsg = \"up\";\n break;\n case KEY_DOWN:\n case 'j':\n i++;\n i = (i > 1) ? 0: i;\n infoMsg = \"down\";\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n if (i == 1) exitRequested = true;\n else if (i == 0) gameRequested = true;\n break;\n\n }\n\n infoPanel->push((infoPos + ' ' + infoKey + ' ' + infoMsg));\n\n wattron(wmenu, A_STANDOUT);\n sprintf(menuItem, \"%-7s\", menuItems[i]);\n mvwprintw(wmenu, i + 1, 2, \"%s\", menuItem);\n wattroff(wmenu, A_STANDOUT);\n\n if (exitRequested == true) {\n break;\n } else if (gameRequested) {\n delwin(wmenu);\n delwin(wmain);\n\n startGame();\n break;\n }\n }\n\n \/*\n * exit\n *\/\n\n endwin();\n\n}\n\nvoid close() {\n endwin();\n}\n\nvoid menuShow(WINDOW *wnd, string title) {\n\n wmove(wnd, 5, 5);\n\n for (size_t i = 0; i < title.size(); i++) {\n waddch(wnd, title[i]);\n waddch(wnd, ' ');\n }\n\n wrefresh(wnd);\n}\n\n\/*\n * TODO\n * Split off into own source file\n *\/\nvoid startGame() {\n\n game_area = {\n {0, 0},\n {80, 40}\n };\n\n WINDOW *wgame = newwin(40, 80, 1, 1);\n box(wgame, 0, 0);\n keypad(wgame, true);\n\n \/*\n * Randomly place player anywhere in game area\n *\/\n random_device rd;\n uniform_int_distribution<int> distx(game_area.left(), game_area.right());\n uniform_int_distribution<int> disty(game_area.top(), game_area.bot());\n int randx = distx(rd) + 1;\n int randy = disty(rd) + 1;\n player.pos = {\n randx, randy\n };\n player.disp_char = '@';\n\n wmove(wgame, player.pos.y, player.pos.x);\n waddch(wgame, player.disp_char);\n\n int ch, i;\n string infoKey, infoMsg;\n vec2i infoPos;\n while (( ch = wgetch(wgame)) != 'q') {\n\n infoMsg = \"\";\n infoKey = to_string(ch);\n\n werase(wgame);\n box(wgame, 0, 0);\n\n switch (ch) {\n case KEY_UP:\n case 'k':\n if (player.pos.y > game_area.top() + 1) player.pos.y--;\n break;\n case KEY_DOWN:\n case 'j':\n if (player.pos.y < game_area.bot() - 2) player.pos.y++;\n break;\n case KEY_LEFT:\n case 'h':\n if (player.pos.x > game_area.left() + 1) player.pos.x--;\n break;\n case KEY_RIGHT:\n case 'l':\n if (player.pos.x < game_area.right() - 2) player.pos.x++;\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n break;\n\n }\n\n wmove(wgame, player.pos.y, player.pos.x);\n waddch(wgame, player.disp_char);\n\n infoPanel->push('{'\n + std::to_string(player.pos.x) + ','\n + std::to_string(player.pos.y) + '}'\n + \" - right & left: {\"\n + std::to_string(game_area.right()) + ','\n + std::to_string(game_area.left()) + '}'\n + \" top & bot: {\"\n + std::to_string(game_area.top()) + ','\n + std::to_string(game_area.bot()) + '}'\n );\n\n wrefresh(wgame);\n\n }\n\n delwin(wgame);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef QUORIDOR_GAME_HPP_\n#define QUORIDOR_GAME_HPP_\n\n#include <map>\n#include <memory>\n#include <set>\n#include <vector>\n\n#include <boost\/multi_index_container.hpp>\n#include <boost\/multi_index\/ordered_index.hpp>\n#include <boost\/multi_index\/member.hpp>\n\n#include \"board_graph.hpp\"\n#include \"node.hpp\"\n#include \"pawn.hpp\"\n#include \"walk_move.hpp\"\n#include \"wall_grid.hpp\"\n#include \"wall_move.hpp\"\n\nnamespace Quoridor {\n\nstruct pawn_data_t {\n int idx;\n std::shared_ptr<Pawn> pawn;\n Node node;\n std::set<Node> goal_nodes;\n};\n\ntypedef boost::multi_index_container<\n pawn_data_t,\n boost::multi_index::indexed_by<\n boost::multi_index::ordered_unique<boost::multi_index::member<pawn_data_t, int, &pawn_data_t::idx> >\n >\n> pawn_data_list_t;\n\nclass Game {\npublic:\n explicit Game(int board_size);\n virtual ~Game();\n\n void set_pawns(std::vector<std::shared_ptr<Pawn>> &pawn_list);\n void switch_pawn();\n const pawn_data_t &cur_pawn_data() const;\n\n int move_pawn(const Node &node);\n int add_wall(const Wall &wall);\n\n bool is_finished() const;\n\nprivate:\n int try_add_wall(const Wall &wall,\n std::vector<std::pair<Node, Node>> *edges);\n\nprivate:\n int board_size_;\n pawn_data_list_t pawn_data_list_;\n int cur_pawn_idx_;\n BoardGraph bg_;\n WallGrid wg_;\n};\n\n} \/\/ namespace Quoridor\n\n#endif \/\/ QUORIDOR_GAME_HPP_\n<commit_msg>Add index by_pawn to pawn list<commit_after>#ifndef QUORIDOR_GAME_HPP_\n#define QUORIDOR_GAME_HPP_\n\n#include <map>\n#include <memory>\n#include <set>\n#include <vector>\n\n#include <boost\/multi_index_container.hpp>\n#include <boost\/multi_index\/ordered_index.hpp>\n#include <boost\/multi_index\/member.hpp>\n#include <boost\/multi_index\/tag.hpp>\n\n#include \"board_graph.hpp\"\n#include \"node.hpp\"\n#include \"pawn.hpp\"\n#include \"walk_move.hpp\"\n#include \"wall_grid.hpp\"\n#include \"wall_move.hpp\"\n\nnamespace Quoridor {\n\nstruct pawn_data_t {\n int idx;\n std::shared_ptr<Pawn> pawn;\n Node node;\n std::set<Node> goal_nodes;\n};\n\nstruct by_pawn {};\n\ntypedef boost::multi_index_container<\n pawn_data_t,\n boost::multi_index::indexed_by<\n boost::multi_index::ordered_unique<boost::multi_index::member<\n pawn_data_t, int, &pawn_data_t::idx>>,\n boost::multi_index::ordered_unique<\n boost::multi_index::tag<by_pawn>,\n boost::multi_index::member<\n pawn_data_t, std::shared_ptr<Pawn>, &pawn_data_t::pawn>>\n >\n> pawn_data_list_t;\n\nclass Game {\npublic:\n explicit Game(int board_size);\n virtual ~Game();\n\n void set_pawns(std::vector<std::shared_ptr<Pawn>> &pawn_list);\n void switch_pawn();\n const pawn_data_t &cur_pawn_data() const;\n\n int move_pawn(const Node &node);\n int add_wall(const Wall &wall);\n\n bool is_finished() const;\n\nprivate:\n int try_add_wall(const Wall &wall,\n std::vector<std::pair<Node, Node>> *edges);\n\nprivate:\n int board_size_;\n pawn_data_list_t pawn_data_list_;\n int cur_pawn_idx_;\n BoardGraph bg_;\n WallGrid wg_;\n};\n\n} \/\/ namespace Quoridor\n\n#endif \/\/ QUORIDOR_GAME_HPP_\n<|endoftext|>"} {"text":"<commit_before>#ifndef __HELP_HPP__\n#define __HELP_HPP__\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n\n\/\/TODO make sure this doesn't get messed up if we run on a machine that doesn't\n\/\/have less installed\n#define HELP_VIEWER \"less\"\n\n\/* !< \\brief Class to create pageable help messages instead of print them to\n * stderr\n *\/\n\nclass Help_Pager {\nprivate:\n FILE *help_fp;\n Help_Pager() {\n help_fp = popen(HELP_VIEWER, \"w\");\n }\n ~Help_Pager() {\n fclose(help_fp);\n }\n\npublic:\n static Help_Pager* instance() {\n static Help_Pager help;\n return &help;\n }\n int pagef(const char *format, ...) {\n va_list arg;\n va_start(arg, format);\n\n int res = vfprintf(help_fp, format, arg);\n va_end(arg);\n return res;\n }\n};\n\n#endif \/\/ __HELP_HPP__\n<commit_msg>Improve help message interface.<commit_after>#ifndef __HELP_HPP__\n#define __HELP_HPP__\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <sys\/ioctl.h>\n#include <unistd.h>\n#include \"errors.hpp\"\n\n\/\/TODO make sure this doesn't get messed up if we run on a machine that doesn't\n\/\/have less installed\n#define HELP_VIEWER \"less\"\n\n\/* !< \\brief Class to create pageable help messages instead of print them to\n * stderr\n *\/\n\n#define MAX_HELP_MSG_LEN (1024*1024)\n\nclass Help_Pager {\nprivate:\n char msg[MAX_HELP_MSG_LEN];\n char *msg_hd;\n\n \/* !< \\brief the number of lines in the terminal\n *\/\n int term_lines() {\n#ifdef TIOCGSIZE\n struct ttysize ts;\n ioctl(STDIN_FILENO, TIOCGSIZE, &ts);\n return ts.ts_lines;\n#elif defined(TIOCGWINSZ)\n struct winsize ts;\n ioctl(STDIN_FILENO, TIOCGWINSZ, &ts);\n return ts.ws_row;\n#endif \/* TIOCGSIZE *\/\n }\n\n \/* !< \\brief The number of lines in the message\n *\/\n int msg_lines() {\n char *c = msg; \n int nlines = 0;\n\n while (c != msg_hd)\n if (*c++ == '\\n') nlines++;\n\n return nlines;\n }\n\n Help_Pager() {\n msg[0] = '\\0'; \/\/in case someone tries to print an empty message\n msg_hd = msg;\n }\n\n ~Help_Pager() {\n FILE *print_to;\n if (msg_lines() > term_lines()) {\n print_to = popen(HELP_VIEWER, \"w\");\n } else {\n print_to = stderr;\n }\n\n msg_hd = '\\0'; \/\/Null terminate it;\n fprintf(print_to, \"%s\", msg);\n\n if (print_to != stderr)\n fclose(print_to);\n }\n\npublic:\n static Help_Pager* instance() {\n static Help_Pager help;\n return &help;\n }\n int pagef(const char *format, ...) {\n int res;\n va_list arg;\n va_start(arg, format);\n\n if (msg_hd < msg + MAX_HELP_MSG_LEN - 1)\n res = vsnprintf(msg_hd, (msg + MAX_HELP_MSG_LEN - 1) - msg_hd, format, arg);\n else\n unreachable(\"Help message is too big, increase MAX_HELP_MSG_LEN\");\n\n msg_hd += res;\n va_end(arg);\n return res;\n }\n};\n\n#endif \/\/ __HELP_HPP__\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file is part of the wikidata_cpp project:\n * https:\/\/github.com\/radupopescu\/wikidata_cpp\n *\/\n\n#include \"data.h\"\n\n#include <rapidjson\/Document.h>\n\n#include <iostream>\n\nnamespace rj = rapidjson;\n\nnamespace data {\n\nbool parseItem(const Languages& languages, const std::string& line, WikidataElement& elem)\n{\n rj::Document j;\n j.Parse(line.substr(0, line.size() - 1).c_str());\n if (! j.HasParseError()) {\n if (j.HasMember(\"id\")) {\n elem.id = j[\"id\"].GetString();\n if (j.HasMember(\"sitelinks\")) {\n const auto& s = j[\"sitelinks\"].GetObject();\n for (const auto& l : languages) {\n const auto sitelink = l + \"wiki\";\n if (s.HasMember(sitelink.c_str())) {\n if (s[sitelink.c_str()].HasMember(\"title\")) {\n elem.sites[l] = s[sitelink.c_str()][\"title\"].GetString();\n }\n }\n }\n return elem.sites.size() == languages.size();\n }\n }\n }\n\n return false;\n}\n\n}\n<commit_msg>Fix typo in include due to case insensitivity<commit_after>\/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file is part of the wikidata_cpp project:\n * https:\/\/github.com\/radupopescu\/wikidata_cpp\n *\/\n\n#include \"data.h\"\n\n#include <rapidjson\/document.h>\n\n#include <iostream>\n\nnamespace rj = rapidjson;\n\nnamespace data {\n\nbool parseItem(const Languages& languages, const std::string& line, WikidataElement& elem)\n{\n rj::Document j;\n j.Parse(line.substr(0, line.size() - 1).c_str());\n if (! j.HasParseError()) {\n if (j.HasMember(\"id\")) {\n elem.id = j[\"id\"].GetString();\n if (j.HasMember(\"sitelinks\")) {\n const auto& s = j[\"sitelinks\"].GetObject();\n for (const auto& l : languages) {\n const auto sitelink = l + \"wiki\";\n if (s.HasMember(sitelink.c_str())) {\n if (s[sitelink.c_str()].HasMember(\"title\")) {\n elem.sites[l] = s[sitelink.c_str()][\"title\"].GetString();\n }\n }\n }\n return elem.sites.size() == languages.size();\n }\n }\n }\n\n return false;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"yaml-cpp\/node\/emit.h\"\n#include \"yaml-cpp\/emitfromevents.h\"\n#include \"yaml-cpp\/emitter.h\"\n#include \"nodeevents.h\"\n\nnamespace YAML\n{\n\tEmitter& operator << (Emitter& out, const Node& node)\n\t{\n\t\tEmitFromEvents emitFromEvents(out);\n\t\tNodeEvents events(node);\n\t\tevents.Emit(emitFromEvents);\n\t\treturn out;\n\t}\n\t\n\tstd::ostream& operator << (std::ostream& out, const Node& node)\n\t{\n\t\tEmitter emitter;\n\t\temitter << node;\n\t\tout << emitter.c_str();\n\t\treturn out;\n\t}\n\n\tstd::string Dump(const Node& node)\n\t{\n\t\tEmitter emitter;\n\t\temitter << node;\n\t\treturn emitter.c_str();\n\t}\n}\n<commit_msg>Updated the ostream emitting overload to user the new ostream-handling emitters<commit_after>#include \"yaml-cpp\/node\/emit.h\"\n#include \"yaml-cpp\/emitfromevents.h\"\n#include \"yaml-cpp\/emitter.h\"\n#include \"nodeevents.h\"\n\nnamespace YAML\n{\n\tEmitter& operator << (Emitter& out, const Node& node)\n\t{\n\t\tEmitFromEvents emitFromEvents(out);\n\t\tNodeEvents events(node);\n\t\tevents.Emit(emitFromEvents);\n\t\treturn out;\n\t}\n\t\n\tstd::ostream& operator << (std::ostream& out, const Node& node)\n\t{\n\t\tEmitter emitter(out);\n\t\temitter << node;\n\t\treturn out;\n\t}\n\n\tstd::string Dump(const Node& node)\n\t{\n\t\tEmitter emitter;\n\t\temitter << node;\n\t\treturn emitter.c_str();\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"draw.hpp\"\n\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#include \"args.hpp\"\n#include \"config.hpp\"\n#include \"task.hpp\"\n#include \"todolist.hpp\"\n#include \"typer.hpp\"\n#include \"win.hpp\"\n\nusing std::string;\nusing std::stringstream;\n\n\/\/ ===================|\n\/\/ internal functions |\n\/\/ ===================|\nstd::string buildTitle(TodoList *list);\n\nvoid drawTitle(TodoList* list);\nvoid drawControls();\nvoid drawTasks(TodoList* list, unsigned selected);\nvoid drawDivider(string div, int ypos);\n\n\/\/ ===================|\n\/\/ internal variables |\n\/\/ ===================|\nWin *titleWin;\nWin *taskWin;\nWin *controlWin;\nWin* inputWin;\n\nint startX;\nint startY;\nint width;\nint height;\n\nunsigned xpos;\nunsigned ypos;\nunsigned startTask = 0;\nunsigned endTask = 0;\nunsigned int listOff = 0;\n\nbool colors = false;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ start curses mode and create windows\nvoid Draw::init()\n{\n std::cout << \"\\033]0;\" << \"todo\" << \"\\7\" << std::flush; \n initscr();\n raw();\n \n use_default_colors();\n if (useColors() && has_colors()){\n start_color();\n init_pair(TITLE_COLOR_PAIR, TITLE_FOREGROUND, TITLE_BACKGROUND);\n init_pair(GUTTER_COLOR_PAIR, GUTTER_FOREGROUND, GUTTER_BACKGROUND);\n init_pair(SELECT_COLOR_PAIR, SELECT_FOREGROUND, SELECT_BACKGROUND);\n init_pair(BORDER_COLOR_PAIR, BORDER_FOREGROUND, BORDER_BACKGROUND);\n init_pair(MARK_COLOR_PAIR, MARK_FOREGROUND, MARK_BACKGROUND);\n init_pair(MARK_COLOR_PAIR_DONE, MARK_FOREGROUND_DONE, \n MARK_BACKGROUND_DONE);\n colors = true;\n }\n Win::setColors(colors);\n \n mouseinterval(0); \n keypad(stdscr, true);\n noecho();\n\n clear();\n refresh();\n\n curs_set(0);\n\n startX = listStartX;\n startY = listStartY;\n width = COLS - startX - 2;\n height = LINES * listHeight;\n\n int inHeight = inputHeight * LINES;\n inHeight = std::max(inHeight, 4);\n\n titleWin = new Win(0, 0, COLS, titleHeight, \"title\", false);\n taskWin = new Win(startX, startY, width, height, \"tasks\");\n controlWin = new Win(inputStartX, inputStartY, COLS - inputStartX - 2, \n inHeight, \"controls\");\n inputWin = new Win(inputStartX, inputStartY, COLS - inputStartX - 2, \n inHeight, \"new task\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ main draw function\nvoid Draw::draw(TodoList *list, unsigned selected)\n{\n drawTitle(list);\n drawControls();\n drawTasks(list, selected);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ act on mouse events\nvoid Draw::mouse(MEVENT event, TodoList *list,\n unsigned &selected, bool button)\n{\n int x = event.x;\n int y = event.y;\n if (taskWin->mouse(x, y)){\n unsigned pos = listOff + y - 1;\n if (pos < list->size()){\n list->adjustPos(pos, listOff);\n if (!button){\n selected = pos;\n } else{\n list->at(pos).toggleComplete();\n }\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ get an input string for a new task\nstring Draw::getInput(string str)\n{\n return type(inputWin, 128, str);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ draw the title\nvoid drawTitle(TodoList* list)\n{\n titleWin->clear();\n titleWin->inverse();\n titleWin->color(TITLE_COLOR_PAIR);\n titleWin->print(buildTitle(list), 0, 0);\n titleWin->colorOff(TITLE_COLOR_PAIR);\n titleWin->inverseOff();\n titleWin->color(BORDER_COLOR_PAIR, true);\n titleWin->draw();\n}\n\n\/\/ draw the control panel\nvoid drawControls()\n{\n controlWin->clear();\n stringstream line;\n \n controlWin->move(0, 0);\n line << \"[\" << ((char) EXIT_KEY) << \"] quit \";\n line << \"[Space] new task \";\n line << \"[\" << ((char) MOVE_UP_KEY) << \"] move task up \";\n controlWin->print(line.str());\n line.str(\"\");\n\n controlWin->move(0, 1);\n line << \"[\" << ((char) REMOVE_KEY) << \"] delete task \";\n line << \"[Return] mark task done \";\n line << \"[\" << ((char) MOVE_DOWN_KEY) << \"] move task down \";\n controlWin->print(line.str());\n line.str(\"\");\n\n controlWin->color(BORDER_COLOR_PAIR, true);\n controlWin->draw();\n}\n\nvoid drawTasks(TodoList* list, unsigned selected)\n{\n auto tasks = list->tasks();\n \n taskWin->clear(); \n\n if (tasks && tasks->size()){\n xpos = 1;\n ypos = 1;\n\n unsigned numTasks = height - 2;\n endTask = tasks->size();\n if (endTask > numTasks)\n endTask = numTasks;\n\n for (unsigned i = startTask + listOff; i < endTask + listOff &&\n i < tasks->size(); i++){\n if (tasks->at(i).div())\n endTask--;\n }\n\n if (numTasks <= tasks->size()){\n while (selected > endTask + listOff - 2 && selected != 0)\n listOff++;\n while (selected < startTask + listOff && \n selected != list->size() - 1)\n listOff--;\n } else{\n listOff = 0;\n }\n\n unsigned count = startTask + listOff;\n\n for (unsigned i = startTask + listOff; i < endTask + listOff &&\n i < tasks->size() ; i++){\n Task t = tasks->at(i);\n \n if (showNumbers){\n taskWin->inverse();\n taskWin->color(GUTTER_COLOR_PAIR);\n \n std::string number = std::to_string(count);\n if (!zeroIndexNumbers)\n number = std::to_string(count + 1);\n while (number.size() < 2)\n number = \"0\"+number;\n \n taskWin->print(number + \")\", xpos, ypos);\n taskWin->colorOff(GUTTER_COLOR_PAIR);\n taskWin->inverseOff();\n xpos += 5;\n }\n \n if (i == selected){\n std::string tmp = tasks->at(i).task();\n if (tasks->at(i).div()){\n taskWin->inverse();\n taskWin->color(SELECT_COLOR_PAIR);\n drawDivider(tmp.substr(5, tmp.size() - 5), ypos);\n taskWin->colorOff(SELECT_COLOR_PAIR);\n taskWin->inverseOff();\n ypos+=2;\n if (showNumbers){\n xpos -= 5;\n }\n continue;\n }\n std::string line = tmp;\n if (highlightWholeLine){\n for (int k = tmp.size() + xpos; k < width - 2; k++){\n line += \" \";\n }\n }\n \n std::string mark = line.substr(0, STRING_COMPLETE.size());\n line = line.substr(mark.size());\n \n taskWin->inverse();\n\n taskWin->color(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE); \n taskWin->print(mark, xpos, ypos);\n taskWin->colorOff(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE);\n\n taskWin->color(SELECT_COLOR_PAIR);\n taskWin->print(line, xpos + mark.size(), ypos);\n taskWin->colorOff(SELECT_COLOR_PAIR);\n \n taskWin->inverseOff();\n } else{\n std::string tmp = tasks->at(i).task();\n if (tasks->at(i).div()){\n drawDivider(tmp.substr(5, tmp.size() - 5), ypos);\n ypos+= 2;\n if (showNumbers){\n xpos -= 5;\n }\n continue;\n }\n \n std::string text = tmp;\n std::string mark = text.substr(0, STRING_COMPLETE.size());\n text = text.substr(mark.size());\n\n taskWin->color(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE); \n taskWin->print(mark, xpos, ypos);\n taskWin->colorOff(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE);\n\n taskWin->print(text, xpos + mark.size(), ypos);\n }\n ypos++;\n if (ypos > numTasks || i >= tasks->size() - 1){\n break;\n }\n if (showNumbers){\n xpos -= 5;\n count++;\n }\n }\n }\n \n taskWin->color(BORDER_COLOR_PAIR, true);\n taskWin->draw();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ stop curses and delete windows\nvoid Draw::stop()\n{\n delete titleWin;\n delete taskWin;\n delete controlWin;\n delete inputWin;\n\n endwin();\n\n curs_set(1);\n}\n\n\/\/ create the title string\nstd::string buildTitle(TodoList *list)\n{\n std::string title = \"[todo version \"+vn+\"]\";\n\n unsigned cent = (COLS - list->name.size() - 2) \/ 2;\n\n for (unsigned i = title.size(); i < cent; i++){\n title += division;\n }\n\n title += \"[\";\n title += list->name;\n title += \"]\";\n\n std::string stats = \"[\" + list->completedStr() + \"]\";\n\n for (unsigned i = title.size() + stats.size(); i < (unsigned)COLS; i++){\n title += division;\n }\n\n title += stats;\n return title;\n}\n \nvoid drawDivider(string div, int ypos)\n{\n while ((int) div.size() < width - 3){\n div += division;\n }\n taskWin->print(div, 1, ypos);\n}\n\n<commit_msg>tried to fix scrolling with dividers<commit_after>#include \"draw.hpp\"\n\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#include \"args.hpp\"\n#include \"config.hpp\"\n#include \"task.hpp\"\n#include \"todolist.hpp\"\n#include \"typer.hpp\"\n#include \"win.hpp\"\n\nusing std::string;\nusing std::stringstream;\n\n\/\/ ===================|\n\/\/ internal functions |\n\/\/ ===================|\nstd::string buildTitle(TodoList *list);\n\nvoid drawTitle(TodoList* list);\nvoid drawControls();\nvoid drawTasks(TodoList* list, unsigned selected);\nvoid drawDivider(string div, int ypos);\n\n\/\/ ===================|\n\/\/ internal variables |\n\/\/ ===================|\nWin *titleWin;\nWin *taskWin;\nWin *controlWin;\nWin* inputWin;\n\nint startX;\nint startY;\nint width;\nint height;\n\nunsigned xpos;\nunsigned ypos;\nunsigned startTask = 0;\nunsigned endTask = 0;\nunsigned int listOff = 0;\n\nbool colors = false;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ start curses mode and create windows\nvoid Draw::init()\n{\n std::cout << \"\\033]0;\" << \"todo\" << \"\\7\" << std::flush; \n initscr();\n raw();\n \n use_default_colors();\n if (useColors() && has_colors()){\n start_color();\n init_pair(TITLE_COLOR_PAIR, TITLE_FOREGROUND, TITLE_BACKGROUND);\n init_pair(GUTTER_COLOR_PAIR, GUTTER_FOREGROUND, GUTTER_BACKGROUND);\n init_pair(SELECT_COLOR_PAIR, SELECT_FOREGROUND, SELECT_BACKGROUND);\n init_pair(BORDER_COLOR_PAIR, BORDER_FOREGROUND, BORDER_BACKGROUND);\n init_pair(MARK_COLOR_PAIR, MARK_FOREGROUND, MARK_BACKGROUND);\n init_pair(MARK_COLOR_PAIR_DONE, MARK_FOREGROUND_DONE, \n MARK_BACKGROUND_DONE);\n colors = true;\n }\n Win::setColors(colors);\n \n mouseinterval(0); \n keypad(stdscr, true);\n noecho();\n\n clear();\n refresh();\n\n curs_set(0);\n\n startX = listStartX;\n startY = listStartY;\n width = COLS - startX - 2;\n height = LINES * listHeight;\n\n int inHeight = inputHeight * LINES;\n inHeight = std::max(inHeight, 4);\n\n titleWin = new Win(0, 0, COLS, titleHeight, \"title\", false);\n taskWin = new Win(startX, startY, width, height, \"tasks\");\n controlWin = new Win(inputStartX, inputStartY, COLS - inputStartX - 2, \n inHeight, \"controls\");\n inputWin = new Win(inputStartX, inputStartY, COLS - inputStartX - 2, \n inHeight, \"new task\");\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ main draw function\nvoid Draw::draw(TodoList *list, unsigned selected)\n{\n drawTitle(list);\n drawControls();\n drawTasks(list, selected);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ act on mouse events\nvoid Draw::mouse(MEVENT event, TodoList *list,\n unsigned &selected, bool button)\n{\n int x = event.x;\n int y = event.y;\n if (taskWin->mouse(x, y)){\n unsigned pos = listOff + y - 1;\n if (pos < list->size()){\n list->adjustPos(pos, listOff);\n if (!button){\n selected = pos;\n } else{\n list->at(pos).toggleComplete();\n }\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ get an input string for a new task\nstring Draw::getInput(string str)\n{\n return type(inputWin, 128, str);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ draw the title\nvoid drawTitle(TodoList* list)\n{\n titleWin->clear();\n titleWin->inverse();\n titleWin->color(TITLE_COLOR_PAIR);\n titleWin->print(buildTitle(list), 0, 0);\n titleWin->colorOff(TITLE_COLOR_PAIR);\n titleWin->inverseOff();\n titleWin->color(BORDER_COLOR_PAIR, true);\n titleWin->draw();\n}\n\n\/\/ draw the control panel\nvoid drawControls()\n{\n controlWin->clear();\n stringstream line;\n \n controlWin->move(0, 0);\n line << \"[\" << ((char) EXIT_KEY) << \"] quit \";\n line << \"[Space] new task \";\n line << \"[\" << ((char) MOVE_UP_KEY) << \"] move task up \";\n controlWin->print(line.str());\n line.str(\"\");\n\n controlWin->move(0, 1);\n line << \"[\" << ((char) REMOVE_KEY) << \"] delete task \";\n line << \"[Return] mark task done \";\n line << \"[\" << ((char) MOVE_DOWN_KEY) << \"] move task down \";\n controlWin->print(line.str());\n line.str(\"\");\n\n controlWin->color(BORDER_COLOR_PAIR, true);\n controlWin->draw();\n}\n\nvoid drawTasks(TodoList* list, unsigned selected)\n{\n auto tasks = list->tasks();\n \n taskWin->clear(); \n\n if (tasks && tasks->size()){\n xpos = 1;\n ypos = 1;\n\n unsigned numTasks = height - 2;\n endTask = tasks->size();\n if (endTask > numTasks)\n endTask = numTasks;\n\n for (unsigned i = startTask + listOff; i < endTask + listOff &&\n i < tasks->size(); i++){\n if (tasks->at(i).div())\n endTask--;\n }\n\n if (numTasks <= tasks->size()){\n while (selected > endTask + listOff - 2 && selected != 0)\n listOff++;\n while (selected < startTask + listOff && \n selected != list->size() - 1)\n listOff--;\n } else{\n listOff = 0;\n }\n\n unsigned count = startTask + listOff;\n\n if (startTask + listOff != 0){\n if (tasks->at(startTask + listOff - 1).div()){\n ypos++;\n endTask++;\n }\n }\n\n for (unsigned i = startTask + listOff; i < endTask + listOff &&\n i < tasks->size() ; i++){\n Task t = tasks->at(i);\n \n if (showNumbers){\n taskWin->inverse();\n taskWin->color(GUTTER_COLOR_PAIR);\n \n std::string number = std::to_string(count);\n if (!zeroIndexNumbers)\n number = std::to_string(count + 1);\n while (number.size() < 2)\n number = \"0\"+number;\n \n taskWin->print(number + \")\", xpos, ypos);\n taskWin->colorOff(GUTTER_COLOR_PAIR);\n taskWin->inverseOff();\n xpos += 5;\n }\n \n if (i == selected){\n std::string tmp = tasks->at(i).task();\n if (tasks->at(i).div()){\n taskWin->inverse();\n taskWin->color(SELECT_COLOR_PAIR);\n drawDivider(tmp.substr(5, tmp.size() - 5), ypos);\n taskWin->colorOff(SELECT_COLOR_PAIR);\n taskWin->inverseOff();\n ypos+=2;\n if (showNumbers){\n xpos -= 5;\n }\n continue;\n }\n std::string line = tmp;\n if (highlightWholeLine){\n for (int k = tmp.size() + xpos; k < width - 2; k++){\n line += \" \";\n }\n }\n \n std::string mark = line.substr(0, STRING_COMPLETE.size());\n line = line.substr(mark.size());\n \n taskWin->inverse();\n\n taskWin->color(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE); \n taskWin->print(mark, xpos, ypos);\n taskWin->colorOff(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE);\n\n taskWin->color(SELECT_COLOR_PAIR);\n taskWin->print(line, xpos + mark.size(), ypos);\n taskWin->colorOff(SELECT_COLOR_PAIR);\n \n taskWin->inverseOff();\n } else{\n std::string tmp = tasks->at(i).task();\n if (tasks->at(i).div()){\n drawDivider(tmp.substr(5, tmp.size() - 5), ypos);\n ypos+= 2;\n if (showNumbers){\n xpos -= 5;\n }\n continue;\n }\n \n std::string text = tmp;\n std::string mark = text.substr(0, STRING_COMPLETE.size());\n text = text.substr(mark.size());\n\n taskWin->color(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE); \n taskWin->print(mark, xpos, ypos);\n taskWin->colorOff(!t.completed() ? MARK_COLOR_PAIR\n : MARK_COLOR_PAIR_DONE);\n\n taskWin->print(text, xpos + mark.size(), ypos);\n }\n ypos++;\n if (ypos > numTasks || i >= tasks->size() - 1){\n break;\n }\n if (showNumbers){\n xpos -= 5;\n count++;\n }\n }\n }\n \n taskWin->color(BORDER_COLOR_PAIR, true);\n taskWin->draw();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ stop curses and delete windows\nvoid Draw::stop()\n{\n delete titleWin;\n delete taskWin;\n delete controlWin;\n delete inputWin;\n\n endwin();\n\n curs_set(1);\n}\n\n\/\/ create the title string\nstd::string buildTitle(TodoList *list)\n{\n std::string title = \"[todo version \"+vn+\"]\";\n\n unsigned cent = (COLS - list->name.size() - 2) \/ 2;\n\n for (unsigned i = title.size(); i < cent; i++){\n title += division;\n }\n\n title += \"[\";\n title += list->name;\n title += \"]\";\n\n std::string stats = \"[\" + list->completedStr() + \"]\";\n\n for (unsigned i = title.size() + stats.size(); i < (unsigned)COLS; i++){\n title += division;\n }\n\n title += stats;\n return title;\n}\n \nvoid drawDivider(string div, int ypos)\n{\n while ((int) div.size() < width - 3){\n div += division;\n }\n taskWin->print(div, 1, ypos);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"file.hpp\"\n#include \"internal.hpp\"\n#include \"macros.hpp\"\n#include \"message.hpp\"\n\nextern \"C\" {\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <stdlib.h>\n};\n\nnamespace CaDiCaL {\n\n\/*------------------------------------------------------------------------*\/\n\nFile::File (Internal *i, bool w, int c, FILE * f, const char * n) :\n internal (i), writing (w),\n close_file (c), file (f),\n _name (n), _lineno (1), _bytes (0)\n{\n assert (f), assert (n);\n}\n\n\/*------------------------------------------------------------------------*\/\n\nbool File::exists (const char * path) {\n struct stat buf;\n return !stat (path, &buf);\n}\n\nsize_t File::size (const char * path) {\n struct stat buf;\n if (stat (path, &buf)) return 0;\n return (size_t) buf.st_size;\n}\n\nchar * File::find (const char * prg) {\n size_t prglen = strlen (prg);\n const char * c = getenv (\"PATH\");\n if (!c) return 0;;\n size_t len = strlen (c);\n char * e = new char[len + 1];\n strcpy (e, c);\n char * res = 0;\n for (char * p = e, * q; !res && p < e + len; p = q) {\n for (q = p; *q && *q != ':'; q++)\n ;\n *q++ = 0;\n size_t pathlen = (q - p) + prglen;\n char * path = new char [pathlen + 1];\n sprintf (path, \"%s\/%s\", p, prg);\n assert (strlen (path) == pathlen);\n if (exists (path)) res = path;\n else delete [] path;\n }\n delete [] e;\n return res;\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFILE * File::open_file (Internal * internal,\n const char * path,\n const char * mode) {\n return fopen (path, mode);\n}\n\nFILE * File::read_file (Internal * internal, const char * path) {\n MSG (\"opening file to read '%s'\", path);\n return open_file (internal, path, \"r\");\n}\n\nFILE * File::write_file (Internal * internal, const char * path) {\n MSG (\"opening file to write '%s'\", path);\n return open_file (internal, path, \"w\");\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFILE * File::open_pipe (Internal * internal,\n const char * fmt, const char * path,\n const char * mode) {\n size_t prglen = 0;\n while (fmt[prglen] && fmt[prglen] != ' ') prglen++;\n char * prg = new char [prglen + 1];\n strncpy (prg, fmt, prglen);\n prg[prglen] = 0;\n char * found = find (prg);\n delete [] prg;\n if (!found) return 0;\n MSG (\"using '%s'\", found);\n delete [] found;\n char * cmd = new char [strlen (fmt) + strlen (path)];\n sprintf (cmd, fmt, path);\n FILE * res = popen (cmd, mode);\n delete [] cmd;\n return res;\n}\n\nFILE * File::read_pipe (Internal * internal,\n const char * fmt, const char * path) {\n if (!File::exists (path)) return 0;\n MSG (\"opening pipe to read '%s'\", path);\n return open_pipe (internal, fmt, path, \"r\");\n}\n\nFILE * File::write_pipe (Internal * internal,\n const char * fmt, const char * path) {\n MSG (\"opening pipe to write '%s'\", path);\n return open_pipe (internal, fmt, path, \"w\");\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFile * File::read (Internal * internal, FILE * f, const char * n) {\n return new File (internal, false, 0, f, n);\n}\n\nFile * File::write (Internal * internal, FILE * f, const char * n) {\n return new File (internal, true, 0, f, n);\n}\n\nFile * File::read (Internal * internal, const char * path) {\n FILE * file;\n int close_input = 2;\n if (has_suffix (path, \".xz\"))\n file = read_pipe (internal, \"xz -c -d %s\", path);\n else if (has_suffix (path, \".bz2\"))\n file = read_pipe (internal, \"bzip2 -c -d %s\", path);\n else if (has_suffix (path, \".gz\"))\n file = read_pipe (internal, \"gzip -c -d %s\", path);\n else if (has_suffix (path, \".7z\"))\n file = read_pipe (internal, \"7z x -so %s 2>\/dev\/null\", path);\n else\n file = read_file (internal, path), close_input = 1;\n return file ? new File (internal, false, close_input, file, path) : 0;\n}\n\nFile * File::write (Internal * internal, const char * path) {\n FILE * file;\n int close_input = 2;\n if (has_suffix (path, \".xz\"))\n file = write_pipe (internal, \"xz -c -e > %s\", path);\n else if (has_suffix (path, \".bz2\"))\n file = write_pipe (internal, \"bzip2 -c > %s\", path);\n else if (has_suffix (path, \".gz\"))\n file = write_pipe (internal, \"gzip -c > %s\", path);\n else if (has_suffix (path, \".7z\"))\n file = write_pipe (internal,\n \"7z a -an -txz -si -so > %s 2>\/dev\/null\", path);\n else\n file = write_file (internal, path), close_input = 1;\n return file ? new File (internal, true, close_input, file, path) : 0;\n}\n\nFile::~File () {\n if (close_file == 1) {\n MSG (\"closing file '%s'\", name ());\n fclose (file);\n }\n if (close_file == 2) {\n MSG (\"closing pipe command on '%s'\", name ());\n pclose (file);\n }\n double mb = bytes () \/ (double) (1 << 20);\n if (writing) MSG (\"after writing %ld bytes %.1f MB\", bytes (), mb);\n else MSG (\"after reading %ld bytes %.1f MB\", bytes (), mb);\n if (close_file == 2) {\n long s = size (name ());\n double mb = s \/ (double) (1<<20);\n if (writing)\n MSG (\"deflated to %ld bytes %.1f MB by factor %.2f or %.2f%%\",\n s, mb, relative (bytes (), s), percent (bytes () - s, bytes ()));\n else\n MSG (\"inflated from %ld bytes %.1f MB by factor %.2f or %.2f%%\",\n s, mb, relative (bytes (), s), percent (bytes () - s, bytes ()));\n }\n}\n\n};\n<commit_msg>compression message<commit_after>#include \"file.hpp\"\n#include \"internal.hpp\"\n#include \"macros.hpp\"\n#include \"message.hpp\"\n\nextern \"C\" {\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <stdlib.h>\n};\n\nnamespace CaDiCaL {\n\n\/*------------------------------------------------------------------------*\/\n\nFile::File (Internal *i, bool w, int c, FILE * f, const char * n) :\n internal (i), writing (w),\n close_file (c), file (f),\n _name (n), _lineno (1), _bytes (0)\n{\n assert (f), assert (n);\n}\n\n\/*------------------------------------------------------------------------*\/\n\nbool File::exists (const char * path) {\n struct stat buf;\n return !stat (path, &buf);\n}\n\nsize_t File::size (const char * path) {\n struct stat buf;\n if (stat (path, &buf)) return 0;\n return (size_t) buf.st_size;\n}\n\nchar * File::find (const char * prg) {\n size_t prglen = strlen (prg);\n const char * c = getenv (\"PATH\");\n if (!c) return 0;;\n size_t len = strlen (c);\n char * e = new char[len + 1];\n strcpy (e, c);\n char * res = 0;\n for (char * p = e, * q; !res && p < e + len; p = q) {\n for (q = p; *q && *q != ':'; q++)\n ;\n *q++ = 0;\n size_t pathlen = (q - p) + prglen;\n char * path = new char [pathlen + 1];\n sprintf (path, \"%s\/%s\", p, prg);\n assert (strlen (path) == pathlen);\n if (exists (path)) res = path;\n else delete [] path;\n }\n delete [] e;\n return res;\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFILE * File::open_file (Internal * internal,\n const char * path,\n const char * mode) {\n return fopen (path, mode);\n}\n\nFILE * File::read_file (Internal * internal, const char * path) {\n MSG (\"opening file to read '%s'\", path);\n return open_file (internal, path, \"r\");\n}\n\nFILE * File::write_file (Internal * internal, const char * path) {\n MSG (\"opening file to write '%s'\", path);\n return open_file (internal, path, \"w\");\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFILE * File::open_pipe (Internal * internal,\n const char * fmt, const char * path,\n const char * mode) {\n size_t prglen = 0;\n while (fmt[prglen] && fmt[prglen] != ' ') prglen++;\n char * prg = new char [prglen + 1];\n strncpy (prg, fmt, prglen);\n prg[prglen] = 0;\n char * found = find (prg);\n if (found) MSG (\"found '%s' in path for '%s'\", found, prg);\n delete [] prg;\n if (!found) return 0;\n delete [] found;\n char * cmd = new char [strlen (fmt) + strlen (path)];\n sprintf (cmd, fmt, path);\n FILE * res = popen (cmd, mode);\n delete [] cmd;\n return res;\n}\n\nFILE * File::read_pipe (Internal * internal,\n const char * fmt, const char * path) {\n if (!File::exists (path)) return 0;\n MSG (\"opening pipe to read '%s'\", path);\n return open_pipe (internal, fmt, path, \"r\");\n}\n\nFILE * File::write_pipe (Internal * internal,\n const char * fmt, const char * path) {\n MSG (\"opening pipe to write '%s'\", path);\n return open_pipe (internal, fmt, path, \"w\");\n}\n\n\/*------------------------------------------------------------------------*\/\n\nFile * File::read (Internal * internal, FILE * f, const char * n) {\n return new File (internal, false, 0, f, n);\n}\n\nFile * File::write (Internal * internal, FILE * f, const char * n) {\n return new File (internal, true, 0, f, n);\n}\n\nFile * File::read (Internal * internal, const char * path) {\n FILE * file;\n int close_input = 2;\n if (has_suffix (path, \".xz\"))\n file = read_pipe (internal, \"xz -c -d %s\", path);\n else if (has_suffix (path, \".bz2\"))\n file = read_pipe (internal, \"bzip2 -c -d %s\", path);\n else if (has_suffix (path, \".gz\"))\n file = read_pipe (internal, \"gzip -c -d %s\", path);\n else if (has_suffix (path, \".7z\"))\n file = read_pipe (internal, \"7z x -so %s 2>\/dev\/null\", path);\n else\n file = read_file (internal, path), close_input = 1;\n return file ? new File (internal, false, close_input, file, path) : 0;\n}\n\nFile * File::write (Internal * internal, const char * path) {\n FILE * file;\n int close_input = 2;\n if (has_suffix (path, \".xz\"))\n file = write_pipe (internal, \"xz -c -e > %s\", path);\n else if (has_suffix (path, \".bz2\"))\n file = write_pipe (internal, \"bzip2 -c > %s\", path);\n else if (has_suffix (path, \".gz\"))\n file = write_pipe (internal, \"gzip -c > %s\", path);\n else if (has_suffix (path, \".7z\"))\n file = write_pipe (internal,\n \"7z a -an -txz -si -so > %s 2>\/dev\/null\", path);\n else\n file = write_file (internal, path), close_input = 1;\n return file ? new File (internal, true, close_input, file, path) : 0;\n}\n\nFile::~File () {\n if (close_file == 1) {\n MSG (\"closing file '%s'\", name ());\n fclose (file);\n }\n if (close_file == 2) {\n MSG (\"closing pipe command on '%s'\", name ());\n pclose (file);\n }\n double mb = bytes () \/ (double) (1 << 20);\n if (writing) MSG (\"after writing %ld bytes %.1f MB\", bytes (), mb);\n else MSG (\"after reading %ld bytes %.1f MB\", bytes (), mb);\n if (close_file == 2) {\n long s = size (name ());\n double mb = s \/ (double) (1<<20);\n if (writing)\n MSG (\"deflated to %ld bytes %.1f MB by factor %.2f or %.2f%%\",\n s, mb, relative (bytes (), s), percent (bytes () - s, bytes ()));\n else\n MSG (\"inflated from %ld bytes %.1f MB by factor %.2f or %.2f%%\",\n s, mb, relative (bytes (), s), percent (bytes () - s, bytes ()));\n }\n}\n\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include <boost\/scoped_ptr.hpp>\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n#include <cstring>\n#include <vector>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#include \"libtorrent\/assert.hpp\"\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tTORRENT_ASSERT(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tbool open(fs::path const& path, int mode)\n\t\t{\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t\treturn true;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode & mode_in);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode & mode_out);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tbool set_size(size_type s)\n\t\t{\n#ifdef _WIN32\n#error file.cpp is for posix systems only. use file_win.cpp on windows\n#else\n\t\t\tif (ftruncate(m_fd, s) < 0)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"ftruncate failed: '\" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n#endif\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << std::strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tstd::string const& error() const\n\t\t{\n\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\treturn *m_error;\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t\tmutable boost::scoped_ptr<std::string> m_error;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tbool file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\treturn m_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tbool file::set_size(size_type s)\n\t{\n\t\treturn m_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n\tstd::string const& file::error() const\n\t{\n\t\treturn m_impl->error();\n\t}\n\n}\n<commit_msg>removed hard coded file permission bits<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#include <boost\/scoped_ptr.hpp>\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n#include <cstring>\n#include <vector>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#include \"libtorrent\/assert.hpp\"\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tTORRENT_ASSERT(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\tnamespace fs = boost::filesystem;\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tbool open(fs::path const& path, int mode)\n\t\t{\n\t\t\tclose();\n#if defined _WIN32 && defined UNICODE\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode));\n#elif defined _WIN32\n\t\t\tm_fd = ::_open(\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode));\n#else\n\t\t\tm_fd = ::open(\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode));\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t\treturn true;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode & mode_in);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode & mode_out);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tbool set_size(size_type s)\n\t\t{\n#ifdef _WIN32\n#error file.cpp is for posix systems only. use file_win.cpp on windows\n#else\n\t\t\tif (ftruncate(m_fd, s) < 0)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"ftruncate failed: '\" << std::strerror(errno);\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n#endif\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m = 1)\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << std::strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\t\t*m_error = msg.str();\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tTORRENT_ASSERT(m_open_mode);\n\t\t\tTORRENT_ASSERT(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tstd::string const& error() const\n\t\t{\n\t\t\tif (!m_error) m_error.reset(new std::string);\n\t\t\treturn *m_error;\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t\tmutable boost::scoped_ptr<std::string> m_error;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(fs::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tbool file::open(fs::path const& p, file::open_mode m)\n\t{\n\t\treturn m_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tbool file::set_size(size_type s)\n\t{\n\t\treturn m_impl->set_size(s);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n\tstd::string const& file::error() const\n\t{\n\t\treturn m_impl->error();\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef flags_hh_INCLUDED\n#define flags_hh_INCLUDED\n\n#include <type_traits>\n\nnamespace Kakoune\n{\n\ntemplate<typename Flags>\nstruct WithBitOps : std::false_type {};\n\ntemplate<typename Flags>\nusing EnumStorageType = typename std::underlying_type<Flags>::type;\n\ntemplate<typename Flags>\nusing EnableIfWithBitOps = typename std::enable_if<WithBitOps<Flags>::value>::type;\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr Flags operator|(Flags lhs, Flags rhs)\n{\n return (Flags)((EnumStorageType<Flags>) lhs | (EnumStorageType<Flags>) rhs);\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nFlags& operator|=(Flags& lhs, Flags rhs)\n{\n (EnumStorageType<Flags>&) lhs |= (EnumStorageType<Flags>) rhs;\n return lhs;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr bool operator&(Flags lhs, Flags rhs)\n{\n return ((EnumStorageType<Flags>) lhs & (EnumStorageType<Flags>) rhs) != 0;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nFlags& operator&=(Flags& lhs, Flags rhs)\n{\n (EnumStorageType<Flags>&) lhs &= (EnumStorageType<Flags>) rhs;\n return lhs;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr Flags operator~(Flags lhs)\n{\n return (Flags)(~(EnumStorageType<Flags>)lhs);\n}\n\n}\n\n#endif \/\/ flags_hh_INCLUDED\n<commit_msg>Tweak flags implementation<commit_after>#ifndef flags_hh_INCLUDED\n#define flags_hh_INCLUDED\n\n#include <type_traits>\n\nnamespace Kakoune\n{\n\ntemplate<typename Flags>\nstruct WithBitOps : std::false_type {};\n\ntemplate<typename Flags>\nusing UnderlyingType = typename std::underlying_type<Flags>::type;\n\ntemplate<typename Flags>\nusing EnableIfWithBitOps = typename std::enable_if<WithBitOps<Flags>::value>::type;\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr Flags operator|(Flags lhs, Flags rhs)\n{\n return (Flags)((UnderlyingType<Flags>) lhs | (UnderlyingType<Flags>) rhs);\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nFlags& operator|=(Flags& lhs, Flags rhs)\n{\n (UnderlyingType<Flags>&) lhs |= (UnderlyingType<Flags>) rhs;\n return lhs;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr bool operator&(Flags lhs, Flags rhs)\n{\n return ((UnderlyingType<Flags>) lhs & (UnderlyingType<Flags>) rhs) == (UnderlyingType<Flags>)rhs;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nFlags& operator&=(Flags& lhs, Flags rhs)\n{\n (UnderlyingType<Flags>&) lhs &= (UnderlyingType<Flags>) rhs;\n return lhs;\n}\n\ntemplate<typename Flags, typename = EnableIfWithBitOps<Flags>>\nconstexpr Flags operator~(Flags lhs)\n{\n return (Flags)(~(UnderlyingType<Flags>)lhs);\n}\n\n}\n\n#endif \/\/ flags_hh_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>#include <reactive\/buffer.hpp>\n#include <reactive\/generate.hpp>\n#include <reactive\/consume.hpp>\n#include <reactive\/tuple.hpp>\n#include <reactive\/ptr_observable.hpp>\n#include <reactive\/transform.hpp>\n#include <reactive\/bridge.hpp>\n#include <reactive\/take.hpp>\n#include <reactive\/enumerate.hpp>\n#include <reactive\/cache.hpp>\n#include <reactive\/connector.hpp>\n#include <reactive\/receiver.hpp>\n#include <reactive\/deref_optional.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nnamespace Si\n{\n\tBOOST_AUTO_TEST_CASE(reactive_take)\n\t{\n\t\tauto zeros = rx::generate([]{ return 0; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(zeros, ones);\n\t\tstd::vector<std::tuple<int, int>> const expected(4, std::make_tuple(0, 1));\n\t\tstd::vector<std::tuple<int, int>> const generated = rx::take(both, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_transform)\n\t{\n\t\tauto twos = rx::generate([]{ return 2; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(twos, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> const expected(4, 3);\n\t\tstd::vector<int> const generated = rx::take(added, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_bridge)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first(bridge);\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(first, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tadded.async_get_one(consumer);\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbridge->got_element(2);\n\t\tstd::vector<int> const expected(1, 3);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_make_buffer)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first{bridge};\n\t\tauto buf = rx::make_buffer(first, 2);\n\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tfor (size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tBOOST_REQUIRE(bridge->is_waiting());\n\t\t\tbridge->got_element(7);\n\t\t}\n\t\tBOOST_CHECK(!bridge->is_waiting());\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbuf.async_get_one(consumer);\n\t\tstd::vector<int> expected(1, 7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\texpected.emplace_back(7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n}\n<commit_msg>begin a coroutine observable<commit_after>#include <reactive\/buffer.hpp>\n#include <reactive\/generate.hpp>\n#include <reactive\/consume.hpp>\n#include <reactive\/tuple.hpp>\n#include <reactive\/ptr_observable.hpp>\n#include <reactive\/transform.hpp>\n#include <reactive\/bridge.hpp>\n#include <reactive\/take.hpp>\n#include <reactive\/enumerate.hpp>\n#include <reactive\/cache.hpp>\n#include <reactive\/connector.hpp>\n#include <reactive\/receiver.hpp>\n#include <reactive\/deref_optional.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/coroutine\/all.hpp>\n\nnamespace Si\n{\n\tBOOST_AUTO_TEST_CASE(reactive_take)\n\t{\n\t\tauto zeros = rx::generate([]{ return 0; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(zeros, ones);\n\t\tstd::vector<std::tuple<int, int>> const expected(4, std::make_tuple(0, 1));\n\t\tstd::vector<std::tuple<int, int>> const generated = rx::take(both, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_transform)\n\t{\n\t\tauto twos = rx::generate([]{ return 2; });\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(twos, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> const expected(4, 3);\n\t\tstd::vector<int> const generated = rx::take(added, expected.size());\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_bridge)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first(bridge);\n\t\tauto ones = rx::generate([]{ return 1; });\n\t\tauto both = rx::make_tuple(first, ones);\n\t\tauto added = rx::transform(both, [](std::tuple<int, int> const &element)\n\t\t{\n\t\t\treturn std::get<0>(element) + std::get<1>(element);\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tadded.async_get_one(consumer);\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbridge->got_element(2);\n\t\tstd::vector<int> const expected(1, 3);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_make_buffer)\n\t{\n\t\tauto bridge = std::make_shared<rx::bridge<int>>();\n\t\trx::ptr_observable<int, std::shared_ptr<rx::observable<int>>> first{bridge};\n\t\tauto buf = rx::make_buffer(first, 2);\n\n\t\tstd::vector<int> generated;\n\t\tauto consumer = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tfor (size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tBOOST_REQUIRE(bridge->is_waiting());\n\t\t\tbridge->got_element(7);\n\t\t}\n\t\tBOOST_CHECK(!bridge->is_waiting());\n\t\tBOOST_CHECK(generated.empty());\n\n\t\tbuf.async_get_one(consumer);\n\t\tstd::vector<int> expected(1, 7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\texpected.emplace_back(7);\n\t\tBOOST_CHECK(expected == generated);\n\n\t\tbuf.async_get_one(consumer);\n\t\tBOOST_CHECK(expected == generated);\n\t}\n\n\tnamespace detail\n\t{\n\t\ttemplate <class Element>\n\t\tstruct result\n\t\t{\n\t\t\tElement value;\n\t\t};\n\n\t\tstruct nothing\n\t\t{\n\t\t};\n\n\t\tstruct yield\n\t\t{\n\t\t\trx::observable<nothing> *target;\n\t\t};\n\n\t\ttemplate <class Element>\n\t\tstruct make_command\n\t\t{\n\t\t\ttypedef boost::variant<result<Element>, yield> type;\n\t\t};\n\t}\n\n\ttemplate <class Element>\n\tstruct coroutine_observable\n\t\t\t: public rx::observable<Element>\n\t\t\t, private rx::observer<detail::nothing>\n\t\t\t, public boost::static_visitor<> \/\/TODO make private\n\t{\n\t\ttypedef Element element_type;\n\n\t\ttemplate <class Action>\n\t\texplicit coroutine_observable(Action &&action)\n\t\t\t: coro(std::forward<Action>(action))\n\t\t{\n\t\t}\n\n\t\tvirtual void async_get_one(rx::observer<element_type> &receiver) SILICIUM_OVERRIDE\n\t\t{\n\t\t\treceiver_ = &receiver;\n\t\t\tnext();\n\t\t}\n\n\t\tvirtual void cancel() SILICIUM_OVERRIDE\n\t\t{\n\t\t\tthrow std::logic_error(\"not implemented\");\n\t\t}\n\n\t\t\/\/TODO make private\n\t\tvoid operator()(detail::result<element_type> command)\n\t\t{\n\t\t\treturn rx::exchange(receiver_, nullptr)->got_element(std::move(command.value));\n\t\t}\n\n\t\t\/\/TODO make private\n\t\tvoid operator()(detail::yield command)\n\t\t{\n\t\t\tcommand.target->async_get_one(*this);\n\t\t}\n\n\tprivate:\n\n\t\ttypedef typename detail::make_command<element_type>::type command_type;\n\n\t\ttypename boost::coroutines::coroutine<command_type>::pull_type coro;\n\t\trx::observer<Element> *receiver_ = nullptr;\n\t\tbool first = true;\n\n\t\tvirtual void got_element(detail::nothing) SILICIUM_OVERRIDE\n\t\t{\n\t\t\tnext();\n\t\t}\n\n\t\tvirtual void ended() SILICIUM_OVERRIDE\n\t\t{\n\t\t\texchange(receiver_, nullptr)->ended();\n\t\t}\n\n\t\tvoid next()\n\t\t{\n\t\t\tif (!rx::exchange(first, false))\n\t\t\t{\n\t\t\t\tcoro();\n\t\t\t}\n\t\t\tif (coro)\n\t\t\t{\n\t\t\t\tcommand_type command = coro.get();\n\t\t\t\treturn boost::apply_visitor(*this, command);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\trx::exchange(receiver_, nullptr)->ended();\n\t\t\t}\n\t\t}\n\t};\n\n\ttemplate <class Element, class Action>\n\tauto make_coroutine(Action &&action)\n\t{\n\t\treturn coroutine_observable<Element>(std::forward<Action>(action));\n\t}\n\n\tBOOST_AUTO_TEST_CASE(reactive_coroutine)\n\t{\n\t\tauto co = make_coroutine<int>([](boost::coroutines::coroutine<detail::make_command<int>::type>::push_type &yield) -> void\n\t\t{\n\t\t\tyield(detail::result<int>{1});\n\t\t\tyield(detail::result<int>{2});\n\t\t});\n\t\tstd::vector<int> generated;\n\t\tauto collector = rx::consume<int>([&generated](int element)\n\t\t{\n\t\t\tgenerated.emplace_back(element);\n\t\t});\n\t\tfor (;;)\n\t\t{\n\t\t\tauto old_size = generated.size();\n\t\t\tco.async_get_one(collector);\n\t\t\tif (generated.size() == old_size)\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tBOOST_REQUIRE(generated.size() == old_size + 1);\n\t\t}\n\t\tstd::vector<int> const expected{1, 2};\n\t\tBOOST_CHECK(expected == generated);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2007, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/assert.hpp\"\n\n#include \"zlib.h\"\n\n#include <vector>\n#include <string>\n\nnamespace\n{\n\tenum\n\t{\n\t\tFTEXT = 0x01,\n\t\tFHCRC = 0x02,\n\t\tFEXTRA = 0x04,\n\t\tFNAME = 0x08,\n\t\tFCOMMENT = 0x10,\n\t\tFRESERVED = 0xe0,\n\n\t\tGZIP_MAGIC0 = 0x1f,\n\t\tGZIP_MAGIC1 = 0x8b\n\t};\n\n}\n\nnamespace libtorrent\n{\n\t\/\/ returns -1 if gzip header is invalid or the header size in bytes\n\tint gzip_header(const char* buf, int size)\n\t{\n\t\tTORRENT_ASSERT(buf != 0);\n\t\tTORRENT_ASSERT(size > 0);\n\n\t\tconst unsigned char* buffer = reinterpret_cast<const unsigned char*>(buf);\n\t\tconst int total_size = size;\n\n\t\t\/\/ The zip header cannot be shorter than 10 bytes\n\t\tif (size < 10) return -1;\n\n\t\t\/\/ check the magic header of gzip\n\t\tif ((buffer[0] != GZIP_MAGIC0) || (buffer[1] != GZIP_MAGIC1)) return -1;\n\n\t\tint method = buffer[2];\n\t\tint flags = buffer[3];\n\n\t\t\/\/ check for reserved flag and make sure it's compressed with the correct metod\n\t\tif (method != Z_DEFLATED || (flags & FRESERVED) != 0) return -1;\n\n\t\t\/\/ skip time, xflags, OS code\n\t\tsize -= 10;\n\t\tbuffer += 10;\n\n\t\tif (flags & FEXTRA)\n\t\t{\n\t\t\tint extra_len;\n\n\t\t\tif (size < 2) return -1;\n\n\t\t\textra_len = (buffer[1] << 8) | buffer[0];\n\n\t\t\tif (size < (extra_len+2)) return -1;\n\t\t\tsize -= (extra_len + 2);\n\t\t\tbuffer += (extra_len + 2);\n\t\t}\n\n\t\tif (flags & FNAME)\n\t\t{\n\t\t\twhile (size && *buffer)\n\t\t\t{\n\t\t\t\t--size;\n\t\t\t\t++buffer;\n\t\t\t}\n\t\t\tif (!size || *buffer) return -1;\n\n\t\t\t--size;\n\t\t\t++buffer;\n\t\t}\n\n\t\tif (flags & FCOMMENT)\n\t\t{\n\t\t\twhile (size && *buffer)\n\t\t\t{\n\t\t\t\t--size;\n\t\t\t\t++buffer;\n\t\t\t}\n\t\t\tif (!size || *buffer) return -1;\n\n\t\t\t--size;\n\t\t\t++buffer;\n\t\t}\n\n\t\tif (flags & FHCRC)\n\t\t{\n\t\t\tif (size < 2) return -1;\n\n\t\t\tsize -= 2;\n\t\t\tbuffer += 2;\n\t\t}\n\n\t\treturn total_size - size;\n\t}\n\n\tbool inflate_gzip(\n\t\tchar const* in\n\t\t, int size\n\t\t, std::vector<char>& buffer\n\t\t, int maximum_size\n\t\t, std::string& error)\n\t{\n\t\tTORRENT_ASSERT(maximum_size > 0);\n\n\t\tint header_len = gzip_header(in, size);\n\t\tif (header_len < 0)\n\t\t{\n\t\t\terror = \"invalid gzip header in tracker response\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ start off with one kilobyte and grow\n\t\t\/\/ if needed\n\t\tbuffer.resize(1024);\n\n\t\t\/\/ initialize the zlib-stream\n\t\tz_stream str;\n\n\t\t\/\/ subtract 8 from the end of the buffer since that's CRC32 and input size\n\t\t\/\/ and those belong to the gzip file\n\t\tstr.avail_in = (int)size - header_len - 8;\n\t\tstr.next_in = reinterpret_cast<Bytef*>(const_cast<char*>(in + header_len));\n\t\tstr.next_out = reinterpret_cast<Bytef*>(&buffer[0]);\n\t\tstr.avail_out = (int)buffer.size();\n\t\tstr.zalloc = Z_NULL;\n\t\tstr.zfree = Z_NULL;\n\t\tstr.opaque = 0;\n\t\t\/\/ -15 is really important. It will make inflate() not look for a zlib header\n\t\t\/\/ and just deflate the buffer\n\t\tif (inflateInit2(&str, -15) != Z_OK)\n\t\t{\n\t\t\terror = \"gzip out of memory\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ inflate and grow inflate_buffer as needed\n\t\tint ret = inflate(&str, Z_SYNC_FLUSH);\n\t\twhile (ret == Z_OK)\n\t\t{\n\t\t\tif (str.avail_out == 0)\n\t\t\t{\n\t\t\t\tif (buffer.size() >= (unsigned)maximum_size)\n\t\t\t\t{\n\t\t\t\t\tinflateEnd(&str);\n\t\t\t\t\terror = \"response too large\";\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tint new_size = (int)buffer.size() * 2;\n\t\t\t\tif (new_size > maximum_size)\n\t\t\t\t\tnew_size = maximum_size;\n\t\t\t\tint old_size = (int)buffer.size();\n\n\t\t\t\tbuffer.resize(new_size);\n\t\t\t\tstr.next_out = reinterpret_cast<Bytef*>(&buffer[old_size]);\n\t\t\t\tstr.avail_out = new_size - old_size;\n\t\t\t}\n\n\t\t\tret = inflate(&str, Z_SYNC_FLUSH);\n\t\t}\n\n\t\tbuffer.resize(buffer.size() - str.avail_out);\n\t\tinflateEnd(&str);\n\n\t\tif (ret != Z_STREAM_END)\n\t\t{\n\t\t\terror = \"gzip error\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ commit the resulting buffer\n\t\treturn false;\n\t}\n\n}\n\n<commit_msg>removed invalid assert<commit_after>\/*\n\nCopyright (c) 2007, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/assert.hpp\"\n\n#include \"zlib.h\"\n\n#include <vector>\n#include <string>\n\nnamespace\n{\n\tenum\n\t{\n\t\tFTEXT = 0x01,\n\t\tFHCRC = 0x02,\n\t\tFEXTRA = 0x04,\n\t\tFNAME = 0x08,\n\t\tFCOMMENT = 0x10,\n\t\tFRESERVED = 0xe0,\n\n\t\tGZIP_MAGIC0 = 0x1f,\n\t\tGZIP_MAGIC1 = 0x8b\n\t};\n\n}\n\nnamespace libtorrent\n{\n\t\/\/ returns -1 if gzip header is invalid or the header size in bytes\n\tint gzip_header(const char* buf, int size)\n\t{\n\t\tTORRENT_ASSERT(buf != 0);\n\n\t\tconst unsigned char* buffer = reinterpret_cast<const unsigned char*>(buf);\n\t\tconst int total_size = size;\n\n\t\t\/\/ The zip header cannot be shorter than 10 bytes\n\t\tif (size < 10) return -1;\n\n\t\t\/\/ check the magic header of gzip\n\t\tif ((buffer[0] != GZIP_MAGIC0) || (buffer[1] != GZIP_MAGIC1)) return -1;\n\n\t\tint method = buffer[2];\n\t\tint flags = buffer[3];\n\n\t\t\/\/ check for reserved flag and make sure it's compressed with the correct metod\n\t\tif (method != Z_DEFLATED || (flags & FRESERVED) != 0) return -1;\n\n\t\t\/\/ skip time, xflags, OS code\n\t\tsize -= 10;\n\t\tbuffer += 10;\n\n\t\tif (flags & FEXTRA)\n\t\t{\n\t\t\tint extra_len;\n\n\t\t\tif (size < 2) return -1;\n\n\t\t\textra_len = (buffer[1] << 8) | buffer[0];\n\n\t\t\tif (size < (extra_len+2)) return -1;\n\t\t\tsize -= (extra_len + 2);\n\t\t\tbuffer += (extra_len + 2);\n\t\t}\n\n\t\tif (flags & FNAME)\n\t\t{\n\t\t\twhile (size && *buffer)\n\t\t\t{\n\t\t\t\t--size;\n\t\t\t\t++buffer;\n\t\t\t}\n\t\t\tif (!size || *buffer) return -1;\n\n\t\t\t--size;\n\t\t\t++buffer;\n\t\t}\n\n\t\tif (flags & FCOMMENT)\n\t\t{\n\t\t\twhile (size && *buffer)\n\t\t\t{\n\t\t\t\t--size;\n\t\t\t\t++buffer;\n\t\t\t}\n\t\t\tif (!size || *buffer) return -1;\n\n\t\t\t--size;\n\t\t\t++buffer;\n\t\t}\n\n\t\tif (flags & FHCRC)\n\t\t{\n\t\t\tif (size < 2) return -1;\n\n\t\t\tsize -= 2;\n\t\t\tbuffer += 2;\n\t\t}\n\n\t\treturn total_size - size;\n\t}\n\n\tbool inflate_gzip(\n\t\tchar const* in\n\t\t, int size\n\t\t, std::vector<char>& buffer\n\t\t, int maximum_size\n\t\t, std::string& error)\n\t{\n\t\tTORRENT_ASSERT(maximum_size > 0);\n\n\t\tint header_len = gzip_header(in, size);\n\t\tif (header_len < 0)\n\t\t{\n\t\t\terror = \"invalid gzip header in tracker response\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ start off with one kilobyte and grow\n\t\t\/\/ if needed\n\t\tbuffer.resize(1024);\n\n\t\t\/\/ initialize the zlib-stream\n\t\tz_stream str;\n\n\t\t\/\/ subtract 8 from the end of the buffer since that's CRC32 and input size\n\t\t\/\/ and those belong to the gzip file\n\t\tstr.avail_in = (int)size - header_len - 8;\n\t\tstr.next_in = reinterpret_cast<Bytef*>(const_cast<char*>(in + header_len));\n\t\tstr.next_out = reinterpret_cast<Bytef*>(&buffer[0]);\n\t\tstr.avail_out = (int)buffer.size();\n\t\tstr.zalloc = Z_NULL;\n\t\tstr.zfree = Z_NULL;\n\t\tstr.opaque = 0;\n\t\t\/\/ -15 is really important. It will make inflate() not look for a zlib header\n\t\t\/\/ and just deflate the buffer\n\t\tif (inflateInit2(&str, -15) != Z_OK)\n\t\t{\n\t\t\terror = \"gzip out of memory\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ inflate and grow inflate_buffer as needed\n\t\tint ret = inflate(&str, Z_SYNC_FLUSH);\n\t\twhile (ret == Z_OK)\n\t\t{\n\t\t\tif (str.avail_out == 0)\n\t\t\t{\n\t\t\t\tif (buffer.size() >= (unsigned)maximum_size)\n\t\t\t\t{\n\t\t\t\t\tinflateEnd(&str);\n\t\t\t\t\terror = \"response too large\";\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tint new_size = (int)buffer.size() * 2;\n\t\t\t\tif (new_size > maximum_size)\n\t\t\t\t\tnew_size = maximum_size;\n\t\t\t\tint old_size = (int)buffer.size();\n\n\t\t\t\tbuffer.resize(new_size);\n\t\t\t\tstr.next_out = reinterpret_cast<Bytef*>(&buffer[old_size]);\n\t\t\t\tstr.avail_out = new_size - old_size;\n\t\t\t}\n\n\t\t\tret = inflate(&str, Z_SYNC_FLUSH);\n\t\t}\n\n\t\tbuffer.resize(buffer.size() - str.avail_out);\n\t\tinflateEnd(&str);\n\n\t\tif (ret != Z_STREAM_END)\n\t\t{\n\t\t\terror = \"gzip error\";\n\t\t\treturn true;\n\t\t}\n\n\t\t\/\/ commit the resulting buffer\n\t\treturn false;\n\t}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"TextureEditor.h\"\n\nnamespace ofx {\nnamespace piMapper {\nTextureEditor::TextureEditor() {\n clear();\n enable();\n}\n\nTextureEditor::~TextureEditor() {\n clear();\n disable();\n}\n\nvoid TextureEditor::registerAppEvents() {\n ofAddListener(ofEvents().update, this, &TextureEditor::update);\n}\n\nvoid TextureEditor::unregisterAppEvents() {\n ofRemoveListener(ofEvents().update, this, &TextureEditor::update);\n}\n\nvoid TextureEditor::registerKeyEvents() {\n ofAddListener(ofEvents().keyPressed, this, &TextureEditor::keyPressed);\n ofAddListener(ofEvents().keyReleased, this, &TextureEditor::keyReleased);\n}\n\nvoid TextureEditor::unregisterKeyEvents() {\n ofRemoveListener(ofEvents().keyPressed, this, &TextureEditor::keyPressed);\n ofRemoveListener(ofEvents().keyReleased, this, &TextureEditor::keyReleased);\n}\n\nvoid TextureEditor::enable() {\n registerAppEvents();\n registerKeyEvents();\n bShiftKeyDown = false;\n}\n\nvoid TextureEditor::disable() {\n unregisterAppEvents();\n unregisterKeyEvents();\n}\n\nvoid TextureEditor::update(ofEventArgs& args) {\n if (surface == NULL) return;\n\n \/\/ update surface if one of the joints is being dragged\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n \n \/\/ Get selected joint index\n int selectedJointIndex = 0;\n bool bJointSelected = false;\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->isDragged() || joints[i]->isSelected()) {\n selectedJointIndex = i;\n bJointSelected = true;\n break;\n }\n } \/\/ for\n \n \/\/ Constrain quad texture selection\n if (joints.size() == 4) {\n if (bJointSelected) {\n constrainJointsToQuad(selectedJointIndex);\n \n for (int i = 0; i < joints.size(); i++) {\n surface->setTexCoord(i, joints[i]->position \/ textureSize);\n }\n } \/\/ if\n } else {\n if (bJointSelected) {\n surface->setTexCoord(selectedJointIndex, joints[selectedJointIndex]->position \/ textureSize);\n }\n } \/\/ else\n}\n\nvoid TextureEditor::keyPressed(ofKeyEventArgs& args) {\n int key = args.key;\n float moveStep;\n\n if (bShiftKeyDown)\n moveStep = 10.0f;\n else\n moveStep = 0.5f;\n\n switch (key) {\n case OF_KEY_LEFT:\n moveSelection(ofVec2f(-moveStep, 0.0f));\n break;\n case OF_KEY_RIGHT:\n moveSelection(ofVec2f(moveStep, 0.0f));\n break;\n case OF_KEY_UP:\n moveSelection(ofVec2f(0.0f, -moveStep));\n break;\n case OF_KEY_DOWN:\n moveSelection(ofVec2f(0.0f, moveStep));\n break;\n case OF_KEY_SHIFT:\n bShiftKeyDown = true;\n break;\n }\n}\n\nvoid TextureEditor::keyReleased(ofKeyEventArgs& args) {\n int key = args.key;\n switch (key) {\n case OF_KEY_SHIFT:\n bShiftKeyDown = false;\n break;\n }\n}\n\nvoid TextureEditor::draw() {\n if (surface == NULL) return;\n\n drawJoints();\n}\n\nvoid TextureEditor::drawJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->draw();\n }\n}\n\nvoid TextureEditor::setSurface(BaseSurface* newSurface) {\n surface = newSurface;\n createJoints();\n}\n\nvoid TextureEditor::clear() {\n surface = NULL;\n clearJoints();\n}\n\nvoid TextureEditor::createJoints() {\n if (surface == NULL) return;\n clearJoints();\n vector<ofVec2f>& texCoords = surface->getTexCoords();\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n\n for (int i = 0; i < texCoords.size(); i++) {\n joints.push_back(new CircleJoint());\n joints.back()->position = texCoords[i] * textureSize;\n }\n}\n\nvoid TextureEditor::clearJoints() {\n while (joints.size()) {\n delete joints.back();\n joints.pop_back();\n }\n}\n\nvoid TextureEditor::unselectAllJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->unselect();\n }\n}\n\nvoid TextureEditor::moveTexCoords(ofVec2f by) {\n if (surface == NULL) return;\n vector<ofVec2f>& texCoords = surface->getTexCoords();\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n for (int i = 0; i < texCoords.size(); i++) {\n joints[i]->position += by;\n texCoords[i] = joints[i]->position \/ textureSize;\n }\n}\n\nvoid TextureEditor::stopDragJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->stopDrag();\n }\n}\n\nvoid TextureEditor::moveSelection(ofVec2f by) {\n \/\/ check if joints selected\n bool bJointSelected = false;\n BaseJoint* selectedJoint;\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->isSelected()) {\n bJointSelected = true;\n selectedJoint = joints[i];\n break;\n }\n }\n\n if (bJointSelected) {\n selectedJoint->position += by;\n } else {\n moveTexCoords(by);\n }\n}\n \nvoid TextureEditor::constrainJointsToQuad(int selectedJointIndex)\n{\n switch (selectedJointIndex) {\n case 0:\n joints[1]->position = ofVec2f(joints[1]->position.x, joints[0]->position.y);\n joints[2]->position = ofVec2f(joints[1]->position.x, joints[3]->position.y);\n joints[3]->position = ofVec2f(joints[0]->position.x, joints[3]->position.y);\n break;\n case 1:\n joints[0]->position = ofVec2f(joints[0]->position.x, joints[1]->position.y);\n joints[2]->position = ofVec2f(joints[1]->position.x, joints[2]->position.y);\n joints[3]->position = ofVec2f(joints[0]->position.x, joints[2]->position.y);\n break;\n case 2:\n joints[1]->position = ofVec2f(joints[2]->position.x, joints[1]->position.y);\n joints[3]->position = ofVec2f(joints[3]->position.x, joints[2]->position.y);\n joints[0]->position = ofVec2f(joints[3]->position.x, joints[1]->position.y);\n break;\n case 3:\n joints[0]->position = ofVec2f(joints[3]->position.x, joints[0]->position.y);\n joints[2]->position = ofVec2f(joints[2]->position.x, joints[3]->position.y);\n joints[1]->position = ofVec2f(joints[2]->position.x, joints[0]->position.y);\n break;\n } \/\/ switch\n}\n\nCircleJoint* TextureEditor::hitTestJoints(ofVec2f pos) {\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->hitTest(pos)) {\n return joints[i];\n }\n }\n return NULL;\n}\n}\n}<commit_msg>Fix texture coord update for quad surface [issue 15]<commit_after>#include \"TextureEditor.h\"\n\nnamespace ofx {\nnamespace piMapper {\nTextureEditor::TextureEditor() {\n clear();\n enable();\n}\n\nTextureEditor::~TextureEditor() {\n clear();\n disable();\n}\n\nvoid TextureEditor::registerAppEvents() {\n ofAddListener(ofEvents().update, this, &TextureEditor::update);\n}\n\nvoid TextureEditor::unregisterAppEvents() {\n ofRemoveListener(ofEvents().update, this, &TextureEditor::update);\n}\n\nvoid TextureEditor::registerKeyEvents() {\n ofAddListener(ofEvents().keyPressed, this, &TextureEditor::keyPressed);\n ofAddListener(ofEvents().keyReleased, this, &TextureEditor::keyReleased);\n}\n\nvoid TextureEditor::unregisterKeyEvents() {\n ofRemoveListener(ofEvents().keyPressed, this, &TextureEditor::keyPressed);\n ofRemoveListener(ofEvents().keyReleased, this, &TextureEditor::keyReleased);\n}\n\nvoid TextureEditor::enable() {\n registerAppEvents();\n registerKeyEvents();\n bShiftKeyDown = false;\n}\n\nvoid TextureEditor::disable() {\n unregisterAppEvents();\n unregisterKeyEvents();\n}\n\nvoid TextureEditor::update(ofEventArgs& args) {\n if (surface == NULL) return;\n\n \/\/ update surface if one of the joints is being dragged\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n \n \/\/ Get selected joint index\n int selectedJointIndex = 0;\n bool bJointSelected = false;\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->isDragged() || joints[i]->isSelected()) {\n selectedJointIndex = i;\n bJointSelected = true;\n break;\n }\n } \/\/ for\n \n \/\/ Constrain quad texture selection\n if (joints.size() == 4) {\n if (bJointSelected) {\n constrainJointsToQuad(selectedJointIndex);\n \n for (int i = 0; i < joints.size(); i++) {\n surface->setTexCoord(i, joints[i]->position \/ textureSize);\n }\n } \/\/ if\n } else {\n if (bJointSelected) {\n surface->setTexCoord(selectedJointIndex, joints[selectedJointIndex]->position \/ textureSize);\n }\n } \/\/ else\n}\n\nvoid TextureEditor::keyPressed(ofKeyEventArgs& args) {\n int key = args.key;\n float moveStep;\n\n if (bShiftKeyDown)\n moveStep = 10.0f;\n else\n moveStep = 0.5f;\n\n switch (key) {\n case OF_KEY_LEFT:\n moveSelection(ofVec2f(-moveStep, 0.0f));\n break;\n case OF_KEY_RIGHT:\n moveSelection(ofVec2f(moveStep, 0.0f));\n break;\n case OF_KEY_UP:\n moveSelection(ofVec2f(0.0f, -moveStep));\n break;\n case OF_KEY_DOWN:\n moveSelection(ofVec2f(0.0f, moveStep));\n break;\n case OF_KEY_SHIFT:\n bShiftKeyDown = true;\n break;\n }\n}\n\nvoid TextureEditor::keyReleased(ofKeyEventArgs& args) {\n int key = args.key;\n switch (key) {\n case OF_KEY_SHIFT:\n bShiftKeyDown = false;\n break;\n }\n}\n\nvoid TextureEditor::draw() {\n if (surface == NULL) return;\n\n drawJoints();\n}\n\nvoid TextureEditor::drawJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->draw();\n }\n}\n\nvoid TextureEditor::setSurface(BaseSurface* newSurface) {\n surface = newSurface;\n createJoints();\n}\n\nvoid TextureEditor::clear() {\n surface = NULL;\n clearJoints();\n}\n\nvoid TextureEditor::createJoints() {\n if (surface == NULL) return;\n clearJoints();\n vector<ofVec2f>& texCoords = surface->getTexCoords();\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n\n for (int i = 0; i < texCoords.size(); i++) {\n joints.push_back(new CircleJoint());\n joints.back()->position = texCoords[i] * textureSize;\n }\n}\n\nvoid TextureEditor::clearJoints() {\n while (joints.size()) {\n delete joints.back();\n joints.pop_back();\n }\n}\n\nvoid TextureEditor::unselectAllJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->unselect();\n }\n}\n\nvoid TextureEditor::moveTexCoords(ofVec2f by) {\n if (surface == NULL) return;\n vector<ofVec2f>& texCoords = surface->getTexCoords();\n ofVec2f textureSize = ofVec2f(surface->getSource()->getTexture()->getWidth(),\n surface->getSource()->getTexture()->getHeight());\n for (int i = 0; i < texCoords.size(); i++) {\n joints[i]->position += by;\n surface->setTexCoord(i, joints[i]->position \/ textureSize);\n }\n}\n\nvoid TextureEditor::stopDragJoints() {\n for (int i = 0; i < joints.size(); i++) {\n joints[i]->stopDrag();\n }\n}\n\nvoid TextureEditor::moveSelection(ofVec2f by) {\n \/\/ check if joints selected\n bool bJointSelected = false;\n BaseJoint* selectedJoint;\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->isSelected()) {\n bJointSelected = true;\n selectedJoint = joints[i];\n break;\n }\n }\n\n if (bJointSelected) {\n selectedJoint->position += by;\n } else {\n moveTexCoords(by);\n }\n}\n \nvoid TextureEditor::constrainJointsToQuad(int selectedJointIndex)\n{\n switch (selectedJointIndex) {\n case 0:\n joints[1]->position = ofVec2f(joints[1]->position.x, joints[0]->position.y);\n joints[2]->position = ofVec2f(joints[1]->position.x, joints[3]->position.y);\n joints[3]->position = ofVec2f(joints[0]->position.x, joints[3]->position.y);\n break;\n case 1:\n joints[0]->position = ofVec2f(joints[0]->position.x, joints[1]->position.y);\n joints[2]->position = ofVec2f(joints[1]->position.x, joints[2]->position.y);\n joints[3]->position = ofVec2f(joints[0]->position.x, joints[2]->position.y);\n break;\n case 2:\n joints[1]->position = ofVec2f(joints[2]->position.x, joints[1]->position.y);\n joints[3]->position = ofVec2f(joints[3]->position.x, joints[2]->position.y);\n joints[0]->position = ofVec2f(joints[3]->position.x, joints[1]->position.y);\n break;\n case 3:\n joints[0]->position = ofVec2f(joints[3]->position.x, joints[0]->position.y);\n joints[2]->position = ofVec2f(joints[2]->position.x, joints[3]->position.y);\n joints[1]->position = ofVec2f(joints[2]->position.x, joints[0]->position.y);\n break;\n } \/\/ switch\n}\n\nCircleJoint* TextureEditor::hitTestJoints(ofVec2f pos) {\n for (int i = 0; i < joints.size(); i++) {\n if (joints[i]->hitTest(pos)) {\n return joints[i];\n }\n }\n return NULL;\n}\n}\n}<|endoftext|>"} {"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2013, Balazs Racz\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file IfImpl.hxx\n *\n * Implementation details for the asynchronous NMRAnet interfaces. This file\n * should only be needed in hardware interface implementations.\n *\n * @author Balazs Racz\n * @date 4 Dec 2013\n *\/\n\n#ifndef _NMRANET_IFIMPL_HXX_\n#define _NMRANET_IFIMPL_HXX_\n\n#include \"nmranet\/If.hxx\"\n\nnamespace nmranet\n{\n\n\/** Implementation of the hardware-independent parts of the write flows. *\/\nclass WriteFlowBase : public StateFlow<Buffer<NMRAnetMessage>, QList<4>>\n{\npublic:\n WriteFlowBase(If *async_if)\n : StateFlow<Buffer<NMRAnetMessage>, QList<4>>(async_if)\n {\n }\n\nprotected:\n \/** This function will be called (on the main executor) to initiate sending\n * this message to the hardware. The flow will then execute the returned\n * action.\n *\n * NOTE: it is possible that this functon will never be called for a given\n * flow. *\/\n virtual Action send_to_hardware() = 0;\n\n \/** Virtual method called after the send is completed, i.e., all the frames\n * are generated and sent to the hardware. Various flows might need to take\n * additional steps afterwards. *\/\n virtual Action send_finished()\n {\n return release_and_exit();\n }\n\n \/\/\/ @returns the interface that this flow is assigned to.\n If *async_if()\n {\n return static_cast<If *>(service());\n }\n\n \/** Implementations shall call this function when they are done with\n * sending the packet.\n *\/\n \/\/ void cleanup();\n\n \/\/\/ Returns the NMRAnet message we are trying to send.\n NMRAnetMessage *nmsg()\n {\n return message()->data();\n }\n\nprotected:\n \/* \/\/\/ Entry point for external callers.\n virtual void WriteAddressedMessage(Defs::MTI mti, NodeID src, NodeHandle\n dst,\n Buffer* data, Notifiable* done)\n {\n HASSERT(IsNotStarted());\n Restart(done);\n mti_ = mti;\n src_ = src;\n dst_ = dst;\n dstNode_ = nullptr;\n data_ = data;\n StartFlowAt(STATE(maybe_send_to_local_node));\n }\n\n \/\/\/ Entry point for external callers.\n virtual void WriteGlobalMessage(Defs::MTI mti, NodeID src, Buffer* data,\n Notifiable* done)\n {\n HASSERT(IsNotStarted());\n Restart(done);\n mti_ = mti;\n src_ = src;\n dst_.id = 0;\n dst_.alias = 0;\n dstNode_ = nullptr;\n data_ = data;\n StartFlowAt(STATE(send_to_local_nodes));\n }\n *\/\n\n \/** Addressed write flows should call this state BEFORE sending to the\n * hardware. They may get back control at the send_to_hardware state if\n * needed.\n * NOTE: datagram write flow cannot use this because it won't get back. *\/\n Action addressed_entry();\n \/** Global write flows should return to this state AFTER sending the\n * message to the hardware. They should ensure the message is still\n * intact. They will not get back control. *\/\n Action global_entry();\n};\n\n\/** This handler handles VerifyNodeId messages (both addressed and global) on\n * the interface level. Each interface implementation will want to create one\n * of these. *\/\nclass VerifyNodeIdHandler : public IncomingMessageStateFlow\n{\npublic:\n VerifyNodeIdHandler(If *service) : IncomingMessageStateFlow(service)\n {\n interface()->dispatcher()->register_handler(\n this,\n Defs::MTI_VERIFY_NODE_ID_GLOBAL & Defs::MTI_VERIFY_NODE_ID_ADDRESSED,\n 0xffff & ~(Defs::MTI_VERIFY_NODE_ID_GLOBAL ^\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED));\n }\n\n ~VerifyNodeIdHandler()\n {\n interface()->dispatcher()->unregister_handler(\n this,\n Defs::MTI_VERIFY_NODE_ID_GLOBAL & Defs::MTI_VERIFY_NODE_ID_ADDRESSED,\n 0xffff & ~(Defs::MTI_VERIFY_NODE_ID_GLOBAL ^\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED));\n }\n\n \/\/\/ Handler callback for incoming messages.\n virtual Action entry()\n {\n NMRAnetMessage *m = message()->data();\n if (m->dst.id)\n {\n \/\/ Addressed message.\n srcNode_ = m->dstNode;\n }\n else if (!m->payload.empty() && m->payload.size() == 6)\n {\n \/\/ Global message with a node id included\n NodeID id = buffer_to_node_id(m->payload);\n srcNode_ = interface()->lookup_local_node(id);\n }\n else\n {\n\/\/ Global message. Everyone should respond.\n#ifdef SIMPLE_NODE_ONLY\n \/\/ We assume there can be only one local node.\n If::VNodeMap::Iterator it = interface()->localNodes_.begin();\n if (it == interface()->localNodes_.end())\n {\n \/\/ No local nodes.\n return release_and_exit();\n }\n srcNode_ = it->second;\n ++it;\n HASSERT(it == interface()->localNodes_.end());\n#else\n \/\/ We need to do an iteration over all local nodes.\n it_ = interface()->localNodes_.begin();\n if (it_ == interface()->localNodes_.end())\n {\n \/\/ No local nodes.\n return release_and_exit();\n }\n srcNode_ = it_->second;\n ++it_;\n#endif \/\/ not simple node.\n }\n if (srcNode_)\n {\n release();\n return allocate_and_call(interface()->global_message_write_flow(),\n STATE(send_response));\n }\n LOG(WARNING, \"node pointer not found.\");\n return release_and_exit();\n }\n\n#ifdef SIMPLE_NODE_ONLY\n Action send_response()\n {\n auto *b =\n get_allocation_result(interface()->global_message_write_flow());\n NMRAnetMessage *m = b->data();\n NodeID id = srcNode_->node_id();\n m->reset(Defs::MTI_VERIFIED_NODE_ID_NUMBER, id, node_id_to_buffer(id));\n interface()->global_message_write_flow()->send(b);\n return exit();\n }\n#else\n Action send_response()\n {\n auto *b =\n get_allocation_result(interface()->global_message_write_flow());\n NMRAnetMessage *m = b->data();\n \/\/ This is called on the main executor of the interface, this we are\n \/\/ allowed to access the local nodes cache.\n NodeID id = srcNode_->node_id();\n LOG(VERBOSE, \"Sending verified reply from node %012llx\", id);\n m->reset(Defs::MTI_VERIFIED_NODE_ID_NUMBER, id, node_id_to_buffer(id));\n interface()->global_message_write_flow()->send(b);\n\n \/** Continues the iteration over the nodes.\n *\n * @TODO(balazs.racz): we should probably wait for the outgoing message\n * to be sent. *\/\n if (it_ != interface()->localNodes_.end())\n {\n srcNode_ = it_->second;\n ++it_;\n return allocate_and_call(interface()->global_message_write_flow(),\n STATE(send_response));\n }\n else\n {\n return exit();\n }\n }\n#endif \/\/ not simple node\n\nprivate:\n Node *srcNode_;\n\n#ifndef SIMPLE_NODE_ONLY\n If::VNodeMap::Iterator it_;\n#endif\n};\n} \/\/ namespace nmranet\n\n#endif \/\/ _NMRANET_IFIMPL_HXX_\n<commit_msg>Makes verify nodeid handler not complain when it receives a global unaddressed verify node id with a payload that is not for the current interface. This is regular traffic between nodes unrelated to us.<commit_after>\/** \\copyright\n * Copyright (c) 2013, Balazs Racz\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file IfImpl.hxx\n *\n * Implementation details for the asynchronous NMRAnet interfaces. This file\n * should only be needed in hardware interface implementations.\n *\n * @author Balazs Racz\n * @date 4 Dec 2013\n *\/\n\n#ifndef _NMRANET_IFIMPL_HXX_\n#define _NMRANET_IFIMPL_HXX_\n\n#include \"nmranet\/If.hxx\"\n\nnamespace nmranet\n{\n\n\/** Implementation of the hardware-independent parts of the write flows. *\/\nclass WriteFlowBase : public StateFlow<Buffer<NMRAnetMessage>, QList<4>>\n{\npublic:\n WriteFlowBase(If *async_if)\n : StateFlow<Buffer<NMRAnetMessage>, QList<4>>(async_if)\n {\n }\n\nprotected:\n \/** This function will be called (on the main executor) to initiate sending\n * this message to the hardware. The flow will then execute the returned\n * action.\n *\n * NOTE: it is possible that this functon will never be called for a given\n * flow. *\/\n virtual Action send_to_hardware() = 0;\n\n \/** Virtual method called after the send is completed, i.e., all the frames\n * are generated and sent to the hardware. Various flows might need to take\n * additional steps afterwards. *\/\n virtual Action send_finished()\n {\n return release_and_exit();\n }\n\n \/\/\/ @returns the interface that this flow is assigned to.\n If *async_if()\n {\n return static_cast<If *>(service());\n }\n\n \/** Implementations shall call this function when they are done with\n * sending the packet.\n *\/\n \/\/ void cleanup();\n\n \/\/\/ Returns the NMRAnet message we are trying to send.\n NMRAnetMessage *nmsg()\n {\n return message()->data();\n }\n\nprotected:\n \/* \/\/\/ Entry point for external callers.\n virtual void WriteAddressedMessage(Defs::MTI mti, NodeID src, NodeHandle\n dst,\n Buffer* data, Notifiable* done)\n {\n HASSERT(IsNotStarted());\n Restart(done);\n mti_ = mti;\n src_ = src;\n dst_ = dst;\n dstNode_ = nullptr;\n data_ = data;\n StartFlowAt(STATE(maybe_send_to_local_node));\n }\n\n \/\/\/ Entry point for external callers.\n virtual void WriteGlobalMessage(Defs::MTI mti, NodeID src, Buffer* data,\n Notifiable* done)\n {\n HASSERT(IsNotStarted());\n Restart(done);\n mti_ = mti;\n src_ = src;\n dst_.id = 0;\n dst_.alias = 0;\n dstNode_ = nullptr;\n data_ = data;\n StartFlowAt(STATE(send_to_local_nodes));\n }\n *\/\n\n \/** Addressed write flows should call this state BEFORE sending to the\n * hardware. They may get back control at the send_to_hardware state if\n * needed.\n * NOTE: datagram write flow cannot use this because it won't get back. *\/\n Action addressed_entry();\n \/** Global write flows should return to this state AFTER sending the\n * message to the hardware. They should ensure the message is still\n * intact. They will not get back control. *\/\n Action global_entry();\n};\n\n\/** This handler handles VerifyNodeId messages (both addressed and global) on\n * the interface level. Each interface implementation will want to create one\n * of these. *\/\nclass VerifyNodeIdHandler : public IncomingMessageStateFlow\n{\npublic:\n VerifyNodeIdHandler(If *service) : IncomingMessageStateFlow(service)\n {\n interface()->dispatcher()->register_handler(\n this, Defs::MTI_VERIFY_NODE_ID_GLOBAL &\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED,\n 0xffff & ~(Defs::MTI_VERIFY_NODE_ID_GLOBAL ^\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED));\n }\n\n ~VerifyNodeIdHandler()\n {\n interface()->dispatcher()->unregister_handler(\n this, Defs::MTI_VERIFY_NODE_ID_GLOBAL &\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED,\n 0xffff & ~(Defs::MTI_VERIFY_NODE_ID_GLOBAL ^\n Defs::MTI_VERIFY_NODE_ID_ADDRESSED));\n }\n\n \/\/\/ Handler callback for incoming messages.\n virtual Action entry()\n {\n NMRAnetMessage *m = message()->data();\n if (m->dst.id)\n {\n \/\/ Addressed message.\n srcNode_ = m->dstNode;\n }\n else if (!m->payload.empty() && m->payload.size() == 6)\n {\n \/\/ Global message with a node id included\n NodeID id = buffer_to_node_id(m->payload);\n srcNode_ = interface()->lookup_local_node(id);\n if (!srcNode_)\n {\n \/\/ Someone looking for a node that's not on this interface.\n return release_and_exit();\n }\n }\n else\n {\n\/\/ Global message. Everyone should respond.\n#ifdef SIMPLE_NODE_ONLY\n \/\/ We assume there can be only one local node.\n If::VNodeMap::Iterator it = interface()->localNodes_.begin();\n if (it == interface()->localNodes_.end())\n {\n \/\/ No local nodes.\n return release_and_exit();\n }\n srcNode_ = it->second;\n ++it;\n HASSERT(it == interface()->localNodes_.end());\n#else\n \/\/ We need to do an iteration over all local nodes.\n it_ = interface()->localNodes_.begin();\n if (it_ == interface()->localNodes_.end())\n {\n \/\/ No local nodes.\n return release_and_exit();\n }\n srcNode_ = it_->second;\n ++it_;\n#endif \/\/ not simple node.\n }\n if (srcNode_)\n {\n release();\n return allocate_and_call(interface()->global_message_write_flow(),\n STATE(send_response));\n }\n LOG(WARNING, \"node pointer not found.\");\n return release_and_exit();\n }\n\n#ifdef SIMPLE_NODE_ONLY\n Action send_response()\n {\n auto *b =\n get_allocation_result(interface()->global_message_write_flow());\n NMRAnetMessage *m = b->data();\n NodeID id = srcNode_->node_id();\n m->reset(Defs::MTI_VERIFIED_NODE_ID_NUMBER, id, node_id_to_buffer(id));\n interface()->global_message_write_flow()->send(b);\n return exit();\n }\n#else\n Action send_response()\n {\n auto *b =\n get_allocation_result(interface()->global_message_write_flow());\n NMRAnetMessage *m = b->data();\n \/\/ This is called on the main executor of the interface, this we are\n \/\/ allowed to access the local nodes cache.\n NodeID id = srcNode_->node_id();\n LOG(VERBOSE, \"Sending verified reply from node %012llx\", id);\n m->reset(Defs::MTI_VERIFIED_NODE_ID_NUMBER, id, node_id_to_buffer(id));\n interface()->global_message_write_flow()->send(b);\n\n \/** Continues the iteration over the nodes.\n *\n * @TODO(balazs.racz): we should probably wait for the outgoing message\n * to be sent. *\/\n if (it_ != interface()->localNodes_.end())\n {\n srcNode_ = it_->second;\n ++it_;\n return allocate_and_call(interface()->global_message_write_flow(),\n STATE(send_response));\n }\n else\n {\n return exit();\n }\n }\n#endif \/\/ not simple node\n\nprivate:\n Node *srcNode_;\n\n#ifndef SIMPLE_NODE_ONLY\n If::VNodeMap::Iterator it_;\n#endif\n};\n} \/\/ namespace nmranet\n\n#endif \/\/ _NMRANET_IFIMPL_HXX_\n<|endoftext|>"} {"text":"<commit_before>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\n * Copyright (c) Olivier Devillers <Olivier.Devillers@sophia.inria.fr>\n * Copyright (C) 2006 Refractions Research Inc.\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n *\n * This is free software; you can redistribute and\/or modify it under\n * the terms of the GNU Lesser General Public Licence as published\n * by the Free Software Foundation. \n * See the COPYING file for more information.\n *\n **********************************************************************\n *\n * Last port: algorithm\/RobustDeterminant.java 1.15 (JTS-1.10)\n *\n **********************************************************************\/\n\n#include <geos\/algorithm\/RobustDeterminant.h>\n#include <geos\/util\/IllegalArgumentException.h>\n\n#include <cmath>\n\n#include <geos\/platform.h> \/\/ for ISNAN, FINITE\n\n#ifdef _MSC_VER\n#pragma warning(disable : 4127)\n#endif\n\nusing namespace std; \/\/ for isfinite..\n\nnamespace geos {\nnamespace algorithm { \/\/ geos.algorithm\n\n\nint RobustDeterminant::signOfDet2x2(double x1,double y1,double x2,double y2) {\n\t\/\/ returns -1 if the determinant is negative,\n\t\/\/ returns 1 if the determinant is positive,\n\t\/\/ retunrs 0 if the determinant is null.\n\tint sign=1;\n\tdouble swap;\n\tdouble k;\n\tlong count=0;\n\n \/\/ Protect against non-finite numbers\n if ( ISNAN(x1) || ISNAN(y1) || ISNAN(x2) || ISNAN(y2) ||\n !FINITE(x1) || !FINITE(y1) || !FINITE(x2) || !FINITE(y2) )\n {\n throw util::IllegalArgumentException(\"RobustDeterminant encountered non-finite numbers \");\n }\n\n\t\/*\n\t* testing null entries\n\t*\/\n\tif ((x1==0.0) || (y2==0.0)) {\n\t\tif ((y1==0.0) || (x2==0.0)) {\n\t\t\treturn 0;\n\t\t} else if (y1>0) {\n\t\t\tif (x2>0) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (x2>0) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t}\n\tif ((y1==0.0) || (x2==0.0)) {\n\t\tif (y2>0) {\n\t\t\tif (x1>0) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (x1>0) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* making y coordinates positive and permuting the entries\n\t* so that y2 is the biggest one\n\t*\/\n\tif (0.0<y1) {\n\t\tif (0.0<y2) {\n\t\t\tif (y1<=y2) {\n\t\t\t\t;\n\t\t\t} else {\n\t\t\t\tsign=-sign;\n\t\t\t\tswap=x1;\n\t\t\t\tx1=x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=y1;\n\t\t\t\ty1=y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1<=-y2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx2=-x2;\n\t\t\t\ty2=-y2;\n\t\t\t} else {\n\t\t\t\tswap=x1;\n\t\t\t\tx1=-x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=y1;\n\t\t\t\ty1=-y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tif (0.0<y2) {\n\t\t\tif (-y1<=y2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx1=-x1;\n\t\t\t\ty1=-y1;\n\t\t\t} else {\n\t\t\t\tswap=-x1;\n\t\t\t\tx1=x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=-y1;\n\t\t\t\ty1=y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1>=y2) {\n\t\t\t\tx1=-x1;\n\t\t\t\ty1=-y1;\n\t\t\t\tx2=-x2;\n\t\t\t\ty2=-y2;\n\t\t\t} else {\n\t\t\t\tsign=-sign;\n\t\t\t\tswap=-x1;\n\t\t\t\tx1=-x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=-y1;\n\t\t\t\ty1=-y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* making x coordinates positive\n\t*\/\n\t\/*\n\t* if |x2|<|x1| one can conclude\n\t*\/\n\tif (0.0<x1) {\n\t\tif (0.0<x2) {\n\t\t\tif (x1 <= x2) {\n\t\t\t\t;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\treturn sign;\n\t\t}\n\t} else {\n\t\tif (0.0<x2) {\n\t\t\treturn -sign;\n\t\t} else {\n\t\t\tif (x1 >= x2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx1=-x1;\n\t\t\t\tx2=-x2;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* all entries strictly positive x1 <= x2 and y1 <= y2\n\t*\/\n\twhile (true) {\n\t\tcount=count+1;\n\t\tk=std::floor(x2\/x1);\n\t\tx2=x2-k*x1;\n\t\ty2=y2-k*y1;\n\n\t\t\/*\n\t\t* testing if R (new U2) is in U1 rectangle\n\t\t*\/\n\t\tif (y2<0.0) {\n\t\t\treturn -sign;\n\t\t}\n\t\tif (y2>y1) {\n\t\t\treturn sign;\n\t\t}\n\n\t\t\/*\n\t\t* finding R'\n\t\t*\/\n\t\tif (x1>x2+x2) {\n\t\t\tif (y1<y2+y2) {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1>y2+y2) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\tx2=x1-x2;\n\t\t\t\ty2=y1-y2;\n\t\t\t\tsign=-sign;\n\t\t\t}\n\t\t}\n\t\tif (y2==0.0) {\n\t\t\tif (x2==0.0) {\n\t\t\t\treturn 0;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t\tif (x2==0.0) {\n\t\t\treturn sign;\n\t\t}\n\n\t\t\/*\n\t\t* exchange 1 and 2 role.\n\t\t*\/\n\t\tk=std::floor(x1\/x2);\n\t\tx1=x1-k*x2;\n\t\ty1=y1-k*y2;\n\t\t\n\t\t\/*\n\t\t* testing if R (new U1) is in U2 rectangle\n\t\t*\/\n\t\tif (y1<0.0) {\n\t\t\treturn sign;\n\t\t}\n\t\tif (y1>y2) {\n\t\t\treturn -sign;\n\t\t}\n\n\t\t\/*\n\t\t* finding R'\n\t\t*\/\n\t\tif (x2>x1+x1) {\n\t\t\tif (y2<y1+y1) {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y2>y1+y1) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\tx1=x2-x1;\n\t\t\t\ty1=y2-y1;\n\t\t\t\tsign=-sign;\n\t\t\t}\n\t\t}\n\t\tif (y1==0.0) {\n\t\t\tif (x1==0.0) {\n\t\t\t\treturn 0;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t}\n\t\tif (x1==0.0) {\n\t\t\treturn -sign;\n\t\t}\n\t}\n}\n} \/\/ namespace geos.algorithm\n} \/\/ namespace geos\n\n\/**********************************************************************\n * $Log$\n * Revision 1.10 2006\/03\/21 11:12:23 strk\n * Cleanups: headers inclusion and Log section\n *\n * Revision 1.9 2006\/03\/21 10:46:03 strk\n * streamlined header inclusion, put original copyright on top\n *\n * Revision 1.8 2006\/02\/19 19:46:49 strk\n * Packages <-> namespaces mapping for most GEOS internal code (uncomplete, but working). Dir-level libs for index\/ subdirs.\n *\n **********************************************************************\/\n\n<commit_msg>Drop unused variable<commit_after>\/**********************************************************************\n * $Id$\n *\n * GEOS - Geometry Engine Open Source\n * http:\/\/geos.refractions.net\n *\n * Copyright (c) Olivier Devillers <Olivier.Devillers@sophia.inria.fr>\n * Copyright (C) 2006 Refractions Research Inc.\n * Copyright (C) 2001-2002 Vivid Solutions Inc.\n *\n * This is free software; you can redistribute and\/or modify it under\n * the terms of the GNU Lesser General Public Licence as published\n * by the Free Software Foundation. \n * See the COPYING file for more information.\n *\n **********************************************************************\n *\n * Last port: algorithm\/RobustDeterminant.java 1.15 (JTS-1.10)\n *\n **********************************************************************\/\n\n#include <geos\/algorithm\/RobustDeterminant.h>\n#include <geos\/util\/IllegalArgumentException.h>\n\n#include <cmath>\n\n#include <geos\/platform.h> \/\/ for ISNAN, FINITE\n\n#ifdef _MSC_VER\n#pragma warning(disable : 4127)\n#endif\n\nusing namespace std; \/\/ for isfinite..\n\nnamespace geos {\nnamespace algorithm { \/\/ geos.algorithm\n\n\nint RobustDeterminant::signOfDet2x2(double x1,double y1,double x2,double y2) {\n\t\/\/ returns -1 if the determinant is negative,\n\t\/\/ returns 1 if the determinant is positive,\n\t\/\/ retunrs 0 if the determinant is null.\n\tint sign=1;\n\tdouble swap;\n\tdouble k;\n\n \/\/ Protect against non-finite numbers\n if ( ISNAN(x1) || ISNAN(y1) || ISNAN(x2) || ISNAN(y2) ||\n !FINITE(x1) || !FINITE(y1) || !FINITE(x2) || !FINITE(y2) )\n {\n throw util::IllegalArgumentException(\"RobustDeterminant encountered non-finite numbers \");\n }\n\n\t\/*\n\t* testing null entries\n\t*\/\n\tif ((x1==0.0) || (y2==0.0)) {\n\t\tif ((y1==0.0) || (x2==0.0)) {\n\t\t\treturn 0;\n\t\t} else if (y1>0) {\n\t\t\tif (x2>0) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (x2>0) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t}\n\tif ((y1==0.0) || (x2==0.0)) {\n\t\tif (y2>0) {\n\t\t\tif (x1>0) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (x1>0) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* making y coordinates positive and permuting the entries\n\t* so that y2 is the biggest one\n\t*\/\n\tif (0.0<y1) {\n\t\tif (0.0<y2) {\n\t\t\tif (y1<=y2) {\n\t\t\t\t;\n\t\t\t} else {\n\t\t\t\tsign=-sign;\n\t\t\t\tswap=x1;\n\t\t\t\tx1=x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=y1;\n\t\t\t\ty1=y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1<=-y2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx2=-x2;\n\t\t\t\ty2=-y2;\n\t\t\t} else {\n\t\t\t\tswap=x1;\n\t\t\t\tx1=-x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=y1;\n\t\t\t\ty1=-y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tif (0.0<y2) {\n\t\t\tif (-y1<=y2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx1=-x1;\n\t\t\t\ty1=-y1;\n\t\t\t} else {\n\t\t\t\tswap=-x1;\n\t\t\t\tx1=x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=-y1;\n\t\t\t\ty1=y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1>=y2) {\n\t\t\t\tx1=-x1;\n\t\t\t\ty1=-y1;\n\t\t\t\tx2=-x2;\n\t\t\t\ty2=-y2;\n\t\t\t} else {\n\t\t\t\tsign=-sign;\n\t\t\t\tswap=-x1;\n\t\t\t\tx1=-x2;\n\t\t\t\tx2=swap;\n\t\t\t\tswap=-y1;\n\t\t\t\ty1=-y2;\n\t\t\t\ty2=swap;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* making x coordinates positive\n\t*\/\n\t\/*\n\t* if |x2|<|x1| one can conclude\n\t*\/\n\tif (0.0<x1) {\n\t\tif (0.0<x2) {\n\t\t\tif (x1 <= x2) {\n\t\t\t\t;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\treturn sign;\n\t\t}\n\t} else {\n\t\tif (0.0<x2) {\n\t\t\treturn -sign;\n\t\t} else {\n\t\t\tif (x1 >= x2) {\n\t\t\t\tsign=-sign;\n\t\t\t\tx1=-x1;\n\t\t\t\tx2=-x2;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/*\n\t* all entries strictly positive x1 <= x2 and y1 <= y2\n\t*\/\n\twhile (true) {\n\t\tk=std::floor(x2\/x1);\n\t\tx2=x2-k*x1;\n\t\ty2=y2-k*y1;\n\n\t\t\/*\n\t\t* testing if R (new U2) is in U1 rectangle\n\t\t*\/\n\t\tif (y2<0.0) {\n\t\t\treturn -sign;\n\t\t}\n\t\tif (y2>y1) {\n\t\t\treturn sign;\n\t\t}\n\n\t\t\/*\n\t\t* finding R'\n\t\t*\/\n\t\tif (x1>x2+x2) {\n\t\t\tif (y1<y2+y2) {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y1>y2+y2) {\n\t\t\t\treturn -sign;\n\t\t\t} else {\n\t\t\t\tx2=x1-x2;\n\t\t\t\ty2=y1-y2;\n\t\t\t\tsign=-sign;\n\t\t\t}\n\t\t}\n\t\tif (y2==0.0) {\n\t\t\tif (x2==0.0) {\n\t\t\t\treturn 0;\n\t\t\t} else {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t}\n\t\tif (x2==0.0) {\n\t\t\treturn sign;\n\t\t}\n\n\t\t\/*\n\t\t* exchange 1 and 2 role.\n\t\t*\/\n\t\tk=std::floor(x1\/x2);\n\t\tx1=x1-k*x2;\n\t\ty1=y1-k*y2;\n\t\t\n\t\t\/*\n\t\t* testing if R (new U1) is in U2 rectangle\n\t\t*\/\n\t\tif (y1<0.0) {\n\t\t\treturn sign;\n\t\t}\n\t\tif (y1>y2) {\n\t\t\treturn -sign;\n\t\t}\n\n\t\t\/*\n\t\t* finding R'\n\t\t*\/\n\t\tif (x2>x1+x1) {\n\t\t\tif (y2<y1+y1) {\n\t\t\t\treturn -sign;\n\t\t\t}\n\t\t} else {\n\t\t\tif (y2>y1+y1) {\n\t\t\t\treturn sign;\n\t\t\t} else {\n\t\t\t\tx1=x2-x1;\n\t\t\t\ty1=y2-y1;\n\t\t\t\tsign=-sign;\n\t\t\t}\n\t\t}\n\t\tif (y1==0.0) {\n\t\t\tif (x1==0.0) {\n\t\t\t\treturn 0;\n\t\t\t} else {\n\t\t\t\treturn sign;\n\t\t\t}\n\t\t}\n\t\tif (x1==0.0) {\n\t\t\treturn -sign;\n\t\t}\n\t}\n}\n} \/\/ namespace geos.algorithm\n} \/\/ namespace geos\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Basic Allocators\n* (C) 1999-2007 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/internal\/defalloc.h>\n#include <botan\/internal\/mlock.h>\n#include <botan\/libstate.h>\n#include <cstdlib>\n#include <cstring>\n\nnamespace Botan {\n\nnamespace {\n\n\/*\n* Perform Memory Allocation\n*\/\nvoid* do_malloc(u32bit n, bool do_lock)\n {\n void* ptr = std::malloc(n);\n\n if(!ptr)\n return 0;\n\n if(do_lock)\n lock_mem(ptr, n);\n\n std::memset(ptr, 0, n);\n return ptr;\n }\n\n\/*\n* Perform Memory Deallocation\n*\/\nvoid do_free(void* ptr, u32bit n, bool do_lock)\n {\n if(!ptr)\n return;\n\n std::memset(ptr, 0, n);\n if(do_lock)\n unlock_mem(ptr, n);\n\n std::free(ptr);\n }\n\n}\n\n\/*\n* Malloc_Allocator's Allocation\n*\/\nvoid* Malloc_Allocator::allocate(u32bit n)\n {\n return do_malloc(n, false);\n }\n\n\/*\n* Malloc_Allocator's Deallocation\n*\/\nvoid Malloc_Allocator::deallocate(void* ptr, u32bit n)\n {\n do_free(ptr, n, false);\n }\n\n\/*\n* Locking_Allocator's Allocation\n*\/\nvoid* Locking_Allocator::alloc_block(u32bit n)\n {\n return do_malloc(n, true);\n }\n\n\/*\n* Locking_Allocator's Deallocation\n*\/\nvoid Locking_Allocator::dealloc_block(void* ptr, u32bit n)\n {\n do_free(ptr, n, true);\n }\n\n\/*\n* Get an allocator\n*\/\nAllocator* Allocator::get(bool locking)\n {\n std::string type = \"\";\n if(!locking)\n type = \"malloc\";\n\n Allocator* alloc = global_state().get_allocator(type);\n if(alloc)\n return alloc;\n\n throw Internal_Error(\"Couldn't find an allocator to use in get_allocator\");\n }\n\n}\n<commit_msg>Malloc_Allocator isn't a pool, so it needs to fail directly if malloc fails, not just return 0 since callers expect that the allocator will either succeed or throw.<commit_after>\/*\n* Basic Allocators\n* (C) 1999-2007 Jack Lloyd\n*\n* Distributed under the terms of the Botan license\n*\/\n\n#include <botan\/internal\/defalloc.h>\n#include <botan\/internal\/mlock.h>\n#include <botan\/libstate.h>\n#include <cstdlib>\n#include <cstring>\n\nnamespace Botan {\n\nnamespace {\n\n\/*\n* Perform Memory Allocation\n*\/\nvoid* do_malloc(u32bit n, bool do_lock)\n {\n void* ptr = std::malloc(n);\n\n if(!ptr)\n return 0;\n\n if(do_lock)\n lock_mem(ptr, n);\n\n std::memset(ptr, 0, n);\n return ptr;\n }\n\n\/*\n* Perform Memory Deallocation\n*\/\nvoid do_free(void* ptr, u32bit n, bool do_lock)\n {\n if(!ptr)\n return;\n\n std::memset(ptr, 0, n);\n if(do_lock)\n unlock_mem(ptr, n);\n\n std::free(ptr);\n }\n\n}\n\n\/*\n* Malloc_Allocator's Allocation\n*\/\nvoid* Malloc_Allocator::allocate(u32bit n)\n {\n void* ptr = do_malloc(n, false);\n if(!ptr)\n throw Memory_Exhaustion();\n }\n\n\/*\n* Malloc_Allocator's Deallocation\n*\/\nvoid Malloc_Allocator::deallocate(void* ptr, u32bit n)\n {\n do_free(ptr, n, false);\n }\n\n\/*\n* Locking_Allocator's Allocation\n*\/\nvoid* Locking_Allocator::alloc_block(u32bit n)\n {\n return do_malloc(n, true);\n }\n\n\/*\n* Locking_Allocator's Deallocation\n*\/\nvoid Locking_Allocator::dealloc_block(void* ptr, u32bit n)\n {\n do_free(ptr, n, true);\n }\n\n\/*\n* Get an allocator\n*\/\nAllocator* Allocator::get(bool locking)\n {\n std::string type = \"\";\n if(!locking)\n type = \"malloc\";\n\n Allocator* alloc = global_state().get_allocator(type);\n if(alloc)\n return alloc;\n\n throw Internal_Error(\"Couldn't find an allocator to use in get_allocator\");\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <assert.h>\n#include <bfs.h>\n\nint main() {\n bfs::FS *fs = NULL;\n if (!bfs::FS::OpenFileSystem(\"127.0.0.1:8028\", &fs)) {\n printf(\"Open fs fail\\n\");\n return 1;\n }\n\n bfs::File *file = NULL;\n bool ret = fs->OpenFile(\"\/synctest\", O_WRONLY, &file);\n assert(ret);\n const char* hw = \"Hello world~\\n\";\n file->Write(hw, strlen(hw));\n file->Sync();\n\n ret = fs->OpenFile(\"\/synctest\", O_RDONLY, &file);\n assert(ret);\n char buff[64] = {};\n int64_t len = file->Read(buff, 1024);\n printf(\"Read return %ld, buff: %s\\n\", len, buff);\n return 0;\n}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<commit_msg>Delete blanks lines<commit_after>\/\/ Copyright (c) 2014, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com\n\n#include <unistd.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <assert.h>\n#include <bfs.h>\n\nint main() {\n bfs::FS *fs = NULL;\n if (!bfs::FS::OpenFileSystem(\"127.0.0.1:8028\", &fs)) {\n printf(\"Open fs fail\\n\");\n return 1;\n }\n\n bfs::File *file = NULL;\n bool ret = fs->OpenFile(\"\/synctest\", O_WRONLY, &file);\n assert(ret);\n const char* hw = \"Hello world~\\n\";\n file->Write(hw, strlen(hw));\n file->Sync();\n\n ret = fs->OpenFile(\"\/synctest\", O_RDONLY, &file);\n assert(ret);\n char buff[64] = {};\n int64_t len = file->Read(buff, 1024);\n printf(\"Read return %ld, buff: %s\\n\", len, buff);\n return 0;\n}\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"rubber.hxx\"\n#include \"util\/Compiler.h\"\n\n#include <gtest\/gtest.h>\n\n#include <assert.h>\n#include <stdint.h>\n#include <stdlib.h>\n\nstatic void\nFill(void *_p, size_t length, unsigned seed)\n{\n for (uint8_t *p = (uint8_t *)_p, *end = p + length; p != end; ++p)\n *p = (uint8_t)seed++;\n}\n\ngcc_pure\nstatic bool\nCheck(const void *_p, size_t length, unsigned seed)\n{\n for (const uint8_t *p = (const uint8_t *)_p, *end = p + length;\n p != end; ++p)\n if (*p != (uint8_t)seed++)\n return false;\n\n return true;\n}\n\nstatic void\nFillRubber(Rubber *r, unsigned id, size_t length)\n{\n Fill(rubber_write(r, id), length, id);\n}\n\nstatic unsigned\nAddFillRubber(Rubber *r, size_t length)\n{\n unsigned id = rubber_add(r, length);\n if (id != 0)\n FillRubber(r, id, length);\n\n return id;\n}\n\ngcc_pure\nstatic bool\nCheckRubber(Rubber *r, unsigned id, size_t length)\n{\n return Check(rubber_read(r, id), length, id);\n}\n\nTEST(RubberTest, Basic)\n{\n size_t total = 4 * 1024 * 1024;\n\n Rubber *r = rubber_new(total);\n ASSERT_NE(r, nullptr);\n\n total = rubber_get_max_size(r);\n\n \/* fill the whole \"rubber\" object with four quarters *\/\n\n unsigned a = AddFillRubber(r, total \/ 4);\n ASSERT_GT(a, 0);\n ASSERT_EQ(rubber_size_of(r, a), total \/ 4);\n\n unsigned b = AddFillRubber(r, total \/ 4);\n ASSERT_GT(b, 0);\n ASSERT_EQ(rubber_size_of(r, b), total \/ 4);\n\n ASSERT_EQ(rubber_get_netto_size(r), total \/ 2);\n ASSERT_EQ(rubber_get_brutto_size(r), total \/ 2);\n\n unsigned c = AddFillRubber(r, total \/ 4);\n ASSERT_GT(c, 0);\n ASSERT_EQ(rubber_size_of(r, c), total \/ 4);\n\n unsigned d = AddFillRubber(r, total \/ 4);\n ASSERT_GT(d, 0);\n ASSERT_EQ(rubber_size_of(r, d), total \/ 4);\n\n ASSERT_EQ(rubber_get_netto_size(r), total);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n \/* another allocation must fail *\/\n\n ASSERT_EQ(AddFillRubber(r, 1), 0u);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, d, total \/ 4));\n\n \/* remove two non-adjacent allocations; the following\n rubber_add() call must automatically compress the \"rubber\"\n object, and the allocation succeeds *\/\n\n rubber_remove(r, b);\n rubber_remove(r, d);\n\n ASSERT_EQ(rubber_get_netto_size(r), total \/ 2);\n ASSERT_EQ(rubber_get_brutto_size(r), total * 3 \/ 4);\n\n unsigned e = AddFillRubber(r, total \/ 2);\n ASSERT_GT(e, 0);\n\n ASSERT_EQ(rubber_get_netto_size(r), total);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n \/* remove one after another, and see if rubber results are\n correct *\/\n\n rubber_remove(r, a);\n\n ASSERT_EQ(rubber_get_netto_size(r), total * 3 \/ 4);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n rubber_compress(r);\n\n ASSERT_EQ(rubber_get_netto_size(r), total * 3 \/ 4);\n ASSERT_EQ(rubber_get_brutto_size(r), total * 3 \/ 4);\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n rubber_remove(r, c);\n\n ASSERT_EQ(rubber_get_netto_size(r), total \/ 2);\n ASSERT_EQ(rubber_get_brutto_size(r), total * 3 \/ 4);\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n rubber_compress(r);\n\n ASSERT_EQ(rubber_get_netto_size(r), total \/ 2);\n ASSERT_EQ(rubber_get_brutto_size(r), total \/ 2);\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n rubber_remove(r, e);\n\n ASSERT_EQ(rubber_get_netto_size(r), size_t(0u));\n ASSERT_EQ(rubber_get_brutto_size(r), size_t(0u));\n\n rubber_compress(r);\n\n ASSERT_EQ(rubber_get_netto_size(r), size_t(0u));\n ASSERT_EQ(rubber_get_brutto_size(r), size_t(0u));\n\n rubber_free(r);\n}\n\nTEST(RubberTest, Shrink)\n{\n size_t total = 4 * 1024 * 1024;\n\n Rubber *r = rubber_new(total);\n ASSERT_NE(r, nullptr);\n\n total = rubber_get_max_size(r);\n\n \/* fill the whole \"rubber\" object *\/\n\n unsigned a = AddFillRubber(r, total * 3 \/ 4);\n ASSERT_GT(a, 0);\n ASSERT_EQ(rubber_size_of(r, a), total * 3 \/ 4);\n\n unsigned b = AddFillRubber(r, total \/ 4);\n ASSERT_GT(b, 0);\n\n ASSERT_EQ(rubber_get_netto_size(r), total);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n \/* another allocation must fail *\/\n\n ASSERT_EQ(AddFillRubber(r, 1), 0u);\n\n ASSERT_TRUE(CheckRubber(r, a, total * 3 \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n\n \/* shrink the first allocation, try again *\/\n\n rubber_shrink(r, a, total \/ 4);\n ASSERT_EQ(rubber_size_of(r, a), total \/ 4);\n\n ASSERT_EQ(rubber_get_netto_size(r), total \/ 2);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n unsigned c = AddFillRubber(r, total \/ 2);\n ASSERT_GT(c, 0);\n\n ASSERT_EQ(rubber_get_netto_size(r), total);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 2));\n\n \/* shrink the third allocation, verify rubber_compress() *\/\n\n rubber_shrink(r, c, total \/ 4);\n\n ASSERT_EQ(rubber_get_netto_size(r), total * 3 \/ 4);\n ASSERT_EQ(rubber_get_brutto_size(r), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n\n rubber_compress(r);\n\n ASSERT_EQ(rubber_get_netto_size(r), total * 3 \/ 4);\n ASSERT_EQ(rubber_get_brutto_size(r), total * 3 \/ 4);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n\n \/* clean up *\/\n\n rubber_remove(r, a);\n rubber_remove(r, b);\n rubber_remove(r, c);\n rubber_free(r);\n}\n\n\/**\n * Fill the allocation table, see if the allocator fails\n * eventually even though there's memory available.\n *\/\nTEST(RubberTest, FullTable)\n{\n size_t total = 64 * 1024 * 1024;\n\n Rubber *r = rubber_new(total);\n ASSERT_NE(r, nullptr);\n\n total = rubber_get_max_size(r);\n\n static const size_t max = 300000;\n static unsigned ids[max], n = 0;\n while (n < max) {\n unsigned id = rubber_add(r, 1);\n if (id == 0)\n break;\n\n ASSERT_EQ((size_t)rubber_read(r, id) % 0x10, size_t(0));\n\n ids[n++] = id;\n }\n\n ASSERT_GT(n, 0);\n ASSERT_LT(n, max);\n\n \/* just to be sure: try again, must still fail *\/\n\n ASSERT_EQ(rubber_add(r, 1024 * 1024), 0u);\n\n \/* remove one item; now a large allocation must succeed *\/\n\n rubber_remove(r, ids[n \/ 2]);\n\n unsigned id = rubber_add(r, 1024 * 1024);\n ASSERT_GT(id, 0);\n ASSERT_EQ(id, ids[n \/ 2]);\n\n \/* cleanup *\/\n\n for (unsigned i = 0; i < n; ++i)\n rubber_remove(r, ids[i]);\n\n rubber_free(r);\n}\n<commit_msg>test\/t_rubber: call Rubber methods directly<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"rubber.hxx\"\n#include \"util\/Compiler.h\"\n\n#include <gtest\/gtest.h>\n\n#include <assert.h>\n#include <stdint.h>\n#include <stdlib.h>\n\nstatic void\nFill(void *_p, size_t length, unsigned seed)\n{\n for (uint8_t *p = (uint8_t *)_p, *end = p + length; p != end; ++p)\n *p = (uint8_t)seed++;\n}\n\ngcc_pure\nstatic bool\nCheck(const void *_p, size_t length, unsigned seed)\n{\n for (const uint8_t *p = (const uint8_t *)_p, *end = p + length;\n p != end; ++p)\n if (*p != (uint8_t)seed++)\n return false;\n\n return true;\n}\n\nstatic void\nFillRubber(Rubber &r, unsigned id, size_t length)\n{\n Fill(r.Write(id), length, id);\n}\n\nstatic unsigned\nAddFillRubber(Rubber &r, size_t length)\n{\n unsigned id = r.Add(length);\n if (id != 0)\n FillRubber(r, id, length);\n\n return id;\n}\n\ngcc_pure\nstatic bool\nCheckRubber(Rubber &r, unsigned id, size_t length)\n{\n return Check(r.Read(id), length, id);\n}\n\nTEST(RubberTest, Basic)\n{\n size_t total = 4 * 1024 * 1024;\n\n Rubber r(total);\n\n total = r.GetMaxSize();\n\n \/* fill the whole \"rubber\" object with four quarters *\/\n\n unsigned a = AddFillRubber(r, total \/ 4);\n ASSERT_GT(a, 0);\n ASSERT_EQ(r.GetSizeOf(a), total \/ 4);\n\n unsigned b = AddFillRubber(r, total \/ 4);\n ASSERT_GT(b, 0);\n ASSERT_EQ(r.GetSizeOf(b), total \/ 4);\n\n ASSERT_EQ(r.GetNettoSize(), total \/ 2);\n ASSERT_EQ(r.GetBruttoSize(), total \/ 2);\n\n unsigned c = AddFillRubber(r, total \/ 4);\n ASSERT_GT(c, 0);\n ASSERT_EQ(r.GetSizeOf(c), total \/ 4);\n\n unsigned d = AddFillRubber(r, total \/ 4);\n ASSERT_GT(d, 0);\n ASSERT_EQ(r.GetSizeOf(d), total \/ 4);\n\n ASSERT_EQ(r.GetNettoSize(), total);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n \/* another allocation must fail *\/\n\n ASSERT_EQ(AddFillRubber(r, 1), 0u);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, d, total \/ 4));\n\n \/* remove two non-adjacent allocations; the following\n rubber_add() call must automatically compress the \"rubber\"\n object, and the allocation succeeds *\/\n\n r.Remove(b);\n r.Remove(d);\n\n ASSERT_EQ(r.GetNettoSize(), total \/ 2);\n ASSERT_EQ(r.GetBruttoSize(), total * 3 \/ 4);\n\n unsigned e = AddFillRubber(r, total \/ 2);\n ASSERT_GT(e, 0);\n\n ASSERT_EQ(r.GetNettoSize(), total);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n \/* remove one after another, and see if rubber results are\n correct *\/\n\n r.Remove(a);\n\n ASSERT_EQ(r.GetNettoSize(), total * 3 \/ 4);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n r.Compress();\n\n ASSERT_EQ(r.GetNettoSize(), total * 3 \/ 4);\n ASSERT_EQ(r.GetBruttoSize(), total * 3 \/ 4);\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n r.Remove(c);\n\n ASSERT_EQ(r.GetNettoSize(), total \/ 2);\n ASSERT_EQ(r.GetBruttoSize(), total * 3 \/ 4);\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n r.Compress();\n\n ASSERT_EQ(r.GetNettoSize(), total \/ 2);\n ASSERT_EQ(r.GetBruttoSize(), total \/ 2);\n ASSERT_TRUE(CheckRubber(r, e, total \/ 2));\n\n r.Remove(e);\n\n ASSERT_EQ(r.GetNettoSize(), size_t(0u));\n ASSERT_EQ(r.GetBruttoSize(), size_t(0u));\n\n r.Compress();\n\n ASSERT_EQ(r.GetNettoSize(), size_t(0u));\n ASSERT_EQ(r.GetBruttoSize(), size_t(0u));\n}\n\nTEST(RubberTest, Shrink)\n{\n size_t total = 4 * 1024 * 1024;\n\n Rubber r(total);\n\n total = r.GetMaxSize();\n\n \/* fill the whole \"rubber\" object *\/\n\n unsigned a = AddFillRubber(r, total * 3 \/ 4);\n ASSERT_GT(a, 0);\n ASSERT_EQ(r.GetSizeOf(a), total * 3 \/ 4);\n\n unsigned b = AddFillRubber(r, total \/ 4);\n ASSERT_GT(b, 0);\n\n ASSERT_EQ(r.GetNettoSize(), total);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n \/* another allocation must fail *\/\n\n ASSERT_EQ(AddFillRubber(r, 1), 0u);\n\n ASSERT_TRUE(CheckRubber(r, a, total * 3 \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n\n \/* shrink the first allocation, try again *\/\n\n r.Shrink(a, total \/ 4);\n ASSERT_EQ(r.GetSizeOf(a), total \/ 4);\n\n ASSERT_EQ(r.GetNettoSize(), total \/ 2);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n unsigned c = AddFillRubber(r, total \/ 2);\n ASSERT_GT(c, 0);\n\n ASSERT_EQ(r.GetNettoSize(), total);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 2));\n\n \/* shrink the third allocation, verify rubber_compress() *\/\n\n r.Shrink(c, total \/ 4);\n\n ASSERT_EQ(r.GetNettoSize(), total * 3 \/ 4);\n ASSERT_EQ(r.GetBruttoSize(), total);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n\n r.Compress();\n\n ASSERT_EQ(r.GetNettoSize(), total * 3 \/ 4);\n ASSERT_EQ(r.GetBruttoSize(), total * 3 \/ 4);\n\n ASSERT_TRUE(CheckRubber(r, a, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, b, total \/ 4));\n ASSERT_TRUE(CheckRubber(r, c, total \/ 4));\n\n \/* clean up *\/\n\n r.Remove(a);\n r.Remove(b);\n r.Remove(c);\n}\n\n\/**\n * Fill the allocation table, see if the allocator fails\n * eventually even though there's memory available.\n *\/\nTEST(RubberTest, FullTable)\n{\n size_t total = 64 * 1024 * 1024;\n\n Rubber r(total);\n\n total = r.GetMaxSize();\n\n static const size_t max = 300000;\n static unsigned ids[max], n = 0;\n while (n < max) {\n unsigned id = r.Add(1);\n if (id == 0)\n break;\n\n ASSERT_EQ((size_t)r.Read(id) % 0x10, size_t(0));\n\n ids[n++] = id;\n }\n\n ASSERT_GT(n, 0);\n ASSERT_LT(n, max);\n\n \/* just to be sure: try again, must still fail *\/\n\n ASSERT_EQ(r.Add(1024 * 1024), 0u);\n\n \/* remove one item; now a large allocation must succeed *\/\n\n r.Remove(ids[n \/ 2]);\n\n unsigned id = r.Add(1024 * 1024);\n ASSERT_GT(id, 0);\n ASSERT_EQ(id, ids[n \/ 2]);\n\n \/* cleanup *\/\n\n for (unsigned i = 0; i < n; ++i)\n r.Remove(ids[i]);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"inline_widget.hxx\"\n#include \"uri\/uri_parser.hxx\"\n#include \"widget.hxx\"\n#include \"widget_http.hxx\"\n#include \"widget_resolver.hxx\"\n#include \"processor.hxx\"\n#include \"penv.hxx\"\n#include \"async.hxx\"\n#include \"http_response.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/istream_iconv.hxx\"\n#include \"pool.hxx\"\n#include \"RootPool.hxx\"\n#include \"session.hxx\"\n#include \"event\/Loop.hxx\"\n\n#include <glib.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n\nconst char *\nWidget::GetLogName() const\n{\n return \"dummy\";\n}\n\nIstream *\nistream_iconv_new(gcc_unused struct pool *pool, Istream &input,\n gcc_unused const char *tocode,\n gcc_unused const char *fromcode)\n{\n return &input;\n}\n\nvoid\nWidget::Cancel()\n{\n}\n\nbool\nWidget::CheckHost(const char *, const char *) const\n{\n return true;\n}\n\nRealmSessionLease\nprocessor_env::GetRealmSession() const\n{\n return nullptr;\n}\n\nvoid\nsession_put(Session *session gcc_unused)\n{\n}\n\nvoid\nWidget::LoadFromSession(gcc_unused RealmSession &session)\n{\n}\n\nvoid\nwidget_http_request(gcc_unused struct pool &pool,\n gcc_unused Widget &widget,\n gcc_unused struct processor_env &env,\n HttpResponseHandler &handler,\n gcc_unused struct async_operation_ref &async_ref)\n{\n GError *error = g_error_new_literal(g_quark_from_static_string(\"test\"), 0,\n \"Test\");\n handler.InvokeError(error);\n}\n\nstruct TestOperation {\n struct async_operation operation;\n struct pool *pool;\n};\n\nstatic void\ntest_abort(struct async_operation *ao gcc_unused)\n{\n auto *to = (TestOperation *)ao;\n\n pool_unref(to->pool);\n}\n\nstatic const struct async_operation_class test_operation = {\n .abort = test_abort,\n};\n\nvoid\nResolveWidget(struct pool &pool,\n gcc_unused Widget &widget,\n gcc_unused struct tcache &translate_cache,\n gcc_unused WidgetResolverCallback callback,\n struct async_operation_ref &async_ref)\n{\n auto to = NewFromPool<TestOperation>(pool);\n\n to->pool = &pool;\n\n to->operation.Init(test_operation);\n async_ref.Set(to->operation);\n pool_ref(&pool);\n}\n\nstatic void\ntest_abort_resolver(struct pool *pool)\n{\n const char *uri;\n bool ret;\n struct parsed_uri parsed_uri;\n EventLoop event_loop;\n struct processor_env env;\n env.event_loop = &event_loop;\n Istream *istream;\n\n pool = pool_new_linear(pool, \"test\", 4096);\n\n uri = \"\/beng.html\";\n ret = parsed_uri.Parse(uri);\n if (!ret) {\n fprintf(stderr, \"uri_parse() failed\\n\");\n exit(2);\n }\n\n Widget widget(*pool, nullptr);\n\n istream = embed_inline_widget(*pool, env, false, widget);\n pool_unref(pool);\n\n istream->CloseUnused();\n}\n\nint main(int argc, char **argv) {\n (void)argc;\n (void)argv;\n\n test_abort_resolver(RootPool());\n}\n<commit_msg>test\/t_wembed: use async_operation::Init2()<commit_after>#include \"inline_widget.hxx\"\n#include \"uri\/uri_parser.hxx\"\n#include \"widget.hxx\"\n#include \"widget_http.hxx\"\n#include \"widget_resolver.hxx\"\n#include \"processor.hxx\"\n#include \"penv.hxx\"\n#include \"async.hxx\"\n#include \"http_response.hxx\"\n#include \"istream\/istream.hxx\"\n#include \"istream\/istream_iconv.hxx\"\n#include \"pool.hxx\"\n#include \"RootPool.hxx\"\n#include \"session.hxx\"\n#include \"event\/Loop.hxx\"\n\n#include <glib.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n\nconst char *\nWidget::GetLogName() const\n{\n return \"dummy\";\n}\n\nIstream *\nistream_iconv_new(gcc_unused struct pool *pool, Istream &input,\n gcc_unused const char *tocode,\n gcc_unused const char *fromcode)\n{\n return &input;\n}\n\nvoid\nWidget::Cancel()\n{\n}\n\nbool\nWidget::CheckHost(const char *, const char *) const\n{\n return true;\n}\n\nRealmSessionLease\nprocessor_env::GetRealmSession() const\n{\n return nullptr;\n}\n\nvoid\nsession_put(Session *session gcc_unused)\n{\n}\n\nvoid\nWidget::LoadFromSession(gcc_unused RealmSession &session)\n{\n}\n\nvoid\nwidget_http_request(gcc_unused struct pool &pool,\n gcc_unused Widget &widget,\n gcc_unused struct processor_env &env,\n HttpResponseHandler &handler,\n gcc_unused struct async_operation_ref &async_ref)\n{\n GError *error = g_error_new_literal(g_quark_from_static_string(\"test\"), 0,\n \"Test\");\n handler.InvokeError(error);\n}\n\nstruct TestOperation {\n struct async_operation operation;\n struct pool *pool;\n\n TestOperation(struct pool &_pool):pool(&_pool) {\n operation.Init2<TestOperation>();\n }\n\n void Abort() {\n pool_unref(pool);\n }\n};\n\nvoid\nResolveWidget(struct pool &pool,\n gcc_unused Widget &widget,\n gcc_unused struct tcache &translate_cache,\n gcc_unused WidgetResolverCallback callback,\n struct async_operation_ref &async_ref)\n{\n auto to = NewFromPool<TestOperation>(pool, pool);\n async_ref.Set(to->operation);\n pool_ref(&pool);\n}\n\nstatic void\ntest_abort_resolver(struct pool *pool)\n{\n const char *uri;\n bool ret;\n struct parsed_uri parsed_uri;\n EventLoop event_loop;\n struct processor_env env;\n env.event_loop = &event_loop;\n Istream *istream;\n\n pool = pool_new_linear(pool, \"test\", 4096);\n\n uri = \"\/beng.html\";\n ret = parsed_uri.Parse(uri);\n if (!ret) {\n fprintf(stderr, \"uri_parse() failed\\n\");\n exit(2);\n }\n\n Widget widget(*pool, nullptr);\n\n istream = embed_inline_widget(*pool, env, false, widget);\n pool_unref(pool);\n\n istream->CloseUnused();\n}\n\nint main(int argc, char **argv) {\n (void)argc;\n (void)argv;\n\n test_abort_resolver(RootPool());\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <cstdarg>\n#include <cstdio>\n#include <cstring>\n#include <exception>\n\n#include \"cuda.h\"\n\n#include \"objective_cuda.h\"\n\nnamespace CuError {\n const char *strerror(CUresult result) { \n switch(result) { \n case CUDA_SUCCESS: return \"No errors\"; \n case CUDA_ERROR_INVALID_VALUE: return \"Invalid value\"; \n case CUDA_ERROR_OUT_OF_MEMORY: return \"Out of memory\"; \n case CUDA_ERROR_NOT_INITIALIZED: return \"Driver not initialized\"; \n case CUDA_ERROR_DEINITIALIZED: return \"Driver deinitialized\"; \n\n case CUDA_ERROR_NO_DEVICE: return \"No CUDA-capable device available\"; \n case CUDA_ERROR_INVALID_DEVICE: return \"Invalid device\"; \n\n case CUDA_ERROR_INVALID_IMAGE: return \"Invalid kernel image\"; \n case CUDA_ERROR_INVALID_CONTEXT: return \"Invalid context\"; \n case CUDA_ERROR_CONTEXT_ALREADY_CURRENT: return \"Context already current\"; \n case CUDA_ERROR_MAP_FAILED: return \"Map failed\"; \n case CUDA_ERROR_UNMAP_FAILED: return \"Unmap failed\"; \n case CUDA_ERROR_ARRAY_IS_MAPPED: return \"Array is mapped\"; \n case CUDA_ERROR_ALREADY_MAPPED: return \"Already mapped\"; \n case CUDA_ERROR_NO_BINARY_FOR_GPU: return \"No binary for GPU\"; \n case CUDA_ERROR_ALREADY_ACQUIRED: return \"Already acquired\"; \n case CUDA_ERROR_NOT_MAPPED: return \"Not mapped\"; \n case CUDA_ERROR_NOT_MAPPED_AS_ARRAY: return \"Mapped resource not available for access as an array\"; \n case CUDA_ERROR_NOT_MAPPED_AS_POINTER: return \"Mapped resource not available for access as a pointer\"; \n case CUDA_ERROR_ECC_UNCORRECTABLE: return \"Uncorrectable ECC error detected\"; \n case CUDA_ERROR_UNSUPPORTED_LIMIT: return \"CUlimit not supported by device\"; \n\n case CUDA_ERROR_INVALID_SOURCE: return \"Invalid source\"; \n case CUDA_ERROR_FILE_NOT_FOUND: return \"File not found\"; \n case CUDA_ERROR_SHARED_OBJECT_SYMBOL_NOT_FOUND: return \"Link to a shared object failed to resolve\"; \n case CUDA_ERROR_SHARED_OBJECT_INIT_FAILED: return \"Shared object initialization failed\"; \n\n case CUDA_ERROR_INVALID_HANDLE: return \"Invalid handle\"; \n\n case CUDA_ERROR_NOT_FOUND: return \"Not found\"; \n\n case CUDA_ERROR_NOT_READY: return \"CUDA not ready\"; \n\n case CUDA_ERROR_LAUNCH_FAILED: return \"Launch failed\"; \n case CUDA_ERROR_LAUNCH_OUT_OF_RESOURCES: return \"Launch exceeded resources\"; \n case CUDA_ERROR_LAUNCH_TIMEOUT: return \"Launch exceeded timeout\"; \n case CUDA_ERROR_LAUNCH_INCOMPATIBLE_TEXTURING: return \"Launch with incompatible texturing\"; \n\n case CUDA_ERROR_UNKNOWN: return \"Unknown error\"; \n\n default: return \"Unknown CUDA error value\"; \n } \n }\n\n void cu_assert(CUresult result, const char *message) {\n if (result != CUDA_SUCCESS) {\n throw CuException(\"%s : %s : %d\", message, strerror(result), result);\n }\n }\n}\n\nCuda::Cuda(int device_id, int init_flags) {\n \/\/ Init driver\n cuInit(init_flags);\n\n \/\/ Get device handler\n CUresult res = cuDeviceGet(&cuDevice, device_id);\n if (res != CUDA_SUCCESS) {\n throw CuError::DeviceNotExist(\"Device id: %d\\n%s\", device_id, CuError::strerror(res));\n }\n\n \/\/ Create context\n res = cuCtxCreate(&cuContext, 0, cuDevice);\n if (res != CUDA_SUCCESS) {\n throw CuError::ContextCreateError(\"%s\", CuError::strerror(res));\n }\n}\n\nCuda::~Cuda() {\n cuCtxDestroy(cuContext);\n}\n\nCUmodule Cuda::set_default_module(CUmodule module) {\n \/\/ Set default module from existing module\n default_module = module;\n return module;\n}\n\nCUmodule Cuda::set_default_module(const char *module_name) {\n \/\/ Set default module from path\n return set_default_module(create_module(module_name));\n}\n\nCUmodule Cuda::create_module(const char *module_name) {\n \/\/ Create module from .ptx\n CUmodule cuModule = (CUmodule)0;\n CUresult res = cuModuleLoad(&cuModule, module_name);\n if (res != CUDA_SUCCESS) {\n throw CuError::ModuleLoadError(\"Module id: %d\\n%s\", res, CuError::strerror(res));\n }\n return cuModule;\n}\n\nCUfunction Cuda::get_kernel(const char *kernel_name) {\n if (default_module) {\n return get_kernel(kernel_name, default_module);\n } else {\n throw CuError::DefaultModuleNotExist();\n }\n}\n\nCUfunction Cuda::get_kernel(const char *kernel_name, CUmodule cuModule) {\n \/\/ Get kernel handler from module\n CUfunction kernel;\n CUresult res = cuModuleGetFunction(&kernel, cuModule, kernel_name);\n if (res != CUDA_SUCCESS) {\n throw CuError::KernelGetError(\"Kernel name: %s\\n%s\", kernel_name, CuError::strerror(res));\n }\n return kernel;\n}\n\nvoid Cuda::launch_kernel_3d(CUfunction kernel,\n uint grid_dim_x, uint grid_dim_y, uint grid_dim_z,\n uint block_dim_x, uint block_dim_y, uint block_dim_z,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n\n assert(grid_dim_x > 0);\n assert(grid_dim_y > 0);\n assert(grid_dim_z > 0);\n assert(block_dim_x > 0);\n assert(block_dim_y > 0);\n assert(block_dim_z > 0);\n\n if (args == NULL) {\n args = new void *[0];\n }\n\n CUresult res = cuLaunchKernel(kernel,\n grid_dim_x, grid_dim_y, grid_dim_z,\n block_dim_x, block_dim_y, block_dim_z,\n shared_mem_bytes,\n h_stream,\n args,\n extra);\n if (res != CUDA_SUCCESS){\n throw CuError::KernelLaunchError(\"%s\", CuError::strerror(res));\n }\n}\nvoid Cuda::launch_kernel(CUfunction kernel,\n uint grid_dim_x,\n uint block_dim_x,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n launch_kernel_3d(kernel,\n grid_dim_x, 1, 1,\n block_dim_x, 1, 1,\n args,\n shared_mem_bytes,\n h_stream,\n extra);\n}\nvoid Cuda::launch_kernel_2d(CUfunction kernel,\n uint grid_dim_x, uint grid_dim_y,\n uint block_dim_x, uint block_dim_y,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n launch_kernel_3d(kernel,\n grid_dim_x, grid_dim_y, 1,\n block_dim_x, block_dim_y, 1,\n args,\n shared_mem_bytes,\n h_stream,\n extra);\n}\n\nvoid Cuda::ctx_synchronize() {\n CUresult res = cuCtxSynchronize();\n if (res != CUDA_SUCCESS) {\n throw CuError::ContextSynchronizeError(\"%s\", CuError::strerror(res));\n }\n}\n<commit_msg>CuError::strerror: added new codes<commit_after>#include <cassert>\n#include <cstdarg>\n#include <cstdio>\n#include <cstring>\n#include <exception>\n\n#include \"cuda.h\"\n\n#include \"objective_cuda.h\"\n\nnamespace CuError {\n const char *strerror(CUresult result) { \n switch(result) { \n case CUDA_SUCCESS: return \"No errors\"; \n case CUDA_ERROR_INVALID_VALUE: return \"Invalid value\"; \n case CUDA_ERROR_OUT_OF_MEMORY: return \"Out of memory\"; \n case CUDA_ERROR_NOT_INITIALIZED: return \"Driver not initialized\"; \n case CUDA_ERROR_DEINITIALIZED: return \"Driver deinitialized\"; \n\n case CUDA_ERROR_NO_DEVICE: return \"No CUDA-capable device available\"; \n case CUDA_ERROR_INVALID_DEVICE: return \"Invalid device\"; \n\n case CUDA_ERROR_INVALID_IMAGE: return \"Invalid kernel image\"; \n case CUDA_ERROR_INVALID_CONTEXT: return \"Invalid context\"; \n case CUDA_ERROR_CONTEXT_ALREADY_CURRENT: return \"Context already current\"; \n case CUDA_ERROR_MAP_FAILED: return \"Map failed\"; \n case CUDA_ERROR_UNMAP_FAILED: return \"Unmap failed\"; \n case CUDA_ERROR_ARRAY_IS_MAPPED: return \"Array is mapped\"; \n case CUDA_ERROR_ALREADY_MAPPED: return \"Already mapped\"; \n case CUDA_ERROR_NO_BINARY_FOR_GPU: return \"No binary for GPU\"; \n case CUDA_ERROR_ALREADY_ACQUIRED: return \"Already acquired\"; \n case CUDA_ERROR_NOT_MAPPED: return \"Not mapped\"; \n case CUDA_ERROR_NOT_MAPPED_AS_ARRAY: return \"Mapped resource not available for access as an array\"; \n case CUDA_ERROR_NOT_MAPPED_AS_POINTER: return \"Mapped resource not available for access as a pointer\"; \n case CUDA_ERROR_ECC_UNCORRECTABLE: return \"Uncorrectable ECC error detected\"; \n case CUDA_ERROR_UNSUPPORTED_LIMIT: return \"CUlimit not supported by device\"; \n\n case CUDA_ERROR_INVALID_SOURCE: return \"Invalid source\"; \n case CUDA_ERROR_FILE_NOT_FOUND: return \"File not found\"; \n case CUDA_ERROR_SHARED_OBJECT_SYMBOL_NOT_FOUND: return \"Link to a shared object failed to resolve\"; \n case CUDA_ERROR_SHARED_OBJECT_INIT_FAILED: return \"Shared object initialization failed\"; \n\n case CUDA_ERROR_INVALID_HANDLE: return \"Invalid handle\"; \n\n case CUDA_ERROR_NOT_FOUND: return \"Not found\"; \n\n case CUDA_ERROR_NOT_READY: return \"CUDA not ready\"; \n\n case CUDA_ERROR_LAUNCH_FAILED: return \"Launch failed\"; \n case CUDA_ERROR_LAUNCH_OUT_OF_RESOURCES: return \"Launch exceeded resources\"; \n case CUDA_ERROR_LAUNCH_TIMEOUT: return \"Launch exceeded timeout\"; \n case CUDA_ERROR_LAUNCH_INCOMPATIBLE_TEXTURING: return \"Launch with incompatible texturing\"; \n\n case CUDA_ERROR_HOST_MEMORY_NOT_REGISTERED: return \"Host memory not registered\";\n case CUDA_ERROR_NOT_PERMITTED: return \"Not permitted\";\n case CUDA_ERROR_NOT_SUPPORTED: return \"Not supported\";\n\n case CUDA_ERROR_UNKNOWN: return \"Unknown error\"; \n\n default: return \"Unknown CUDA error value\"; \n } \n }\n\n void cu_assert(CUresult result, const char *message) {\n if (result != CUDA_SUCCESS) {\n throw CuException(\"%s : %s : %d\", message, strerror(result), result);\n }\n }\n}\n\nCuda::Cuda(int device_id, int init_flags) {\n \/\/ Init driver\n cuInit(init_flags);\n\n \/\/ Get device handler\n CUresult res = cuDeviceGet(&cuDevice, device_id);\n if (res != CUDA_SUCCESS) {\n throw CuError::DeviceNotExist(\"Device id: %d\\n%s\", device_id, CuError::strerror(res));\n }\n\n \/\/ Create context\n res = cuCtxCreate(&cuContext, 0, cuDevice);\n if (res != CUDA_SUCCESS) {\n throw CuError::ContextCreateError(\"%s\", CuError::strerror(res));\n }\n}\n\nCuda::~Cuda() {\n cuCtxDestroy(cuContext);\n}\n\nCUmodule Cuda::set_default_module(CUmodule module) {\n \/\/ Set default module from existing module\n default_module = module;\n return module;\n}\n\nCUmodule Cuda::set_default_module(const char *module_name) {\n \/\/ Set default module from path\n return set_default_module(create_module(module_name));\n}\n\nCUmodule Cuda::create_module(const char *module_name) {\n \/\/ Create module from .ptx\n CUmodule cuModule = (CUmodule)0;\n CUresult res = cuModuleLoad(&cuModule, module_name);\n if (res != CUDA_SUCCESS) {\n throw CuError::ModuleLoadError(\"Module id: %d\\n%s\", res, CuError::strerror(res));\n }\n return cuModule;\n}\n\nCUfunction Cuda::get_kernel(const char *kernel_name) {\n if (default_module) {\n return get_kernel(kernel_name, default_module);\n } else {\n throw CuError::DefaultModuleNotExist();\n }\n}\n\nCUfunction Cuda::get_kernel(const char *kernel_name, CUmodule cuModule) {\n \/\/ Get kernel handler from module\n CUfunction kernel;\n CUresult res = cuModuleGetFunction(&kernel, cuModule, kernel_name);\n if (res != CUDA_SUCCESS) {\n throw CuError::KernelGetError(\"Kernel name: %s\\n%s\", kernel_name, CuError::strerror(res));\n }\n return kernel;\n}\n\nvoid Cuda::launch_kernel_3d(CUfunction kernel,\n uint grid_dim_x, uint grid_dim_y, uint grid_dim_z,\n uint block_dim_x, uint block_dim_y, uint block_dim_z,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n\n assert(grid_dim_x > 0);\n assert(grid_dim_y > 0);\n assert(grid_dim_z > 0);\n assert(block_dim_x > 0);\n assert(block_dim_y > 0);\n assert(block_dim_z > 0);\n\n if (args == NULL) {\n args = new void *[0];\n }\n\n CUresult res = cuLaunchKernel(kernel,\n grid_dim_x, grid_dim_y, grid_dim_z,\n block_dim_x, block_dim_y, block_dim_z,\n shared_mem_bytes,\n h_stream,\n args,\n extra);\n if (res != CUDA_SUCCESS){\n throw CuError::KernelLaunchError(\"%s\", CuError::strerror(res));\n }\n}\nvoid Cuda::launch_kernel(CUfunction kernel,\n uint grid_dim_x,\n uint block_dim_x,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n launch_kernel_3d(kernel,\n grid_dim_x, 1, 1,\n block_dim_x, 1, 1,\n args,\n shared_mem_bytes,\n h_stream,\n extra);\n}\nvoid Cuda::launch_kernel_2d(CUfunction kernel,\n uint grid_dim_x, uint grid_dim_y,\n uint block_dim_x, uint block_dim_y,\n void ** args,\n uint shared_mem_bytes,\n CUstream h_stream,\n void ** extra) {\n launch_kernel_3d(kernel,\n grid_dim_x, grid_dim_y, 1,\n block_dim_x, block_dim_y, 1,\n args,\n shared_mem_bytes,\n h_stream,\n extra);\n}\n\nvoid Cuda::ctx_synchronize() {\n CUresult res = cuCtxSynchronize();\n if (res != CUDA_SUCCESS) {\n throw CuError::ContextSynchronizeError(\"%s\", CuError::strerror(res));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#define png_infopp_NULL (png_infopp)NULL\n#define int_p_NULL (int*)NULL\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include \"cctag\/fileDebug.hpp\"\n#include \"cctag\/visualDebug.hpp\"\n#include \"cctag\/progBase\/exceptions.hpp\"\n#include \"cctag\/detection.hpp\"\n#include \"cctag\/view.hpp\"\n#include \"cctag\/image.hpp\"\n#include \"cctag\/cmdline.hpp\"\n\n#ifdef WITH_CUDA\n#include \"cuda\/device_prop.hpp\"\n#include \"cuda\/debug_macros.hpp\"\n#endif \/\/ WITH_CUDA\n\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/exception\/all.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n\n#include <terry\/sampler\/all.hpp>\n#include <terry\/sampler\/resample_subimage.hpp>\n\n#include <opencv\/cv.h>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/core\/core.hpp>\n#include \"opencv2\/opencv.hpp\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <exception>\n\nusing namespace cctag;\nusing boost::timer;\n\nusing namespace boost::gil;\nnamespace bfs = boost::filesystem;\n\n\/\/ static const std::string kUsageString = \"Usage: detection image_file.png\\n\";\n\nvoid detection(std::size_t frameId, const cv::Mat & src, const cctag::Parameters & params, const cctag::CCTagMarkersBank & bank, std::ofstream & output, std::string debugFileName = \"\")\n{\n POP_ENTER;\n \n if (debugFileName == \"\") {\n debugFileName = \"00000\";\n }\n \n \/\/ Process markers detection\n boost::timer t;\n boost::ptr_list<CCTag> markers;\n \n CCTagVisualDebug::instance().initBackgroundImage(src);\n CCTagVisualDebug::instance().setImageFileName(debugFileName);\n CCTagFileDebug::instance().setPath(CCTagVisualDebug::instance().getPath());\n\n cctagDetection(markers, frameId , src, params, bank, true); \n\n CCTagFileDebug::instance().outPutAllSessions();\n CCTagFileDebug::instance().clearSessions();\n CCTagVisualDebug::instance().outPutAllSessions();\n CCTagVisualDebug::instance().clearSessions();\n\n CCTAG_COUT( markers.size() << \" markers.\");\n CCTAG_COUT(\"Total time: \" << t.elapsed());\n CCTAG_COUT_NOENDL(\"Id : \");\n\n int i = 0;\n output << \"#frame \" << frameId << '\\n';\n output << markers.size() << '\\n';\n BOOST_FOREACH(const cctag::CCTag & marker, markers) {\n output << marker.x() << \" \" << marker.y() << \" \" << marker.id() << \" \" << marker.getStatus() << '\\n';\n if (i == 0) {\n CCTAG_COUT_NOENDL(marker.id() + 1);\n } else {\n CCTAG_COUT_NOENDL(\", \" << marker.id() + 1);\n }\n ++i;\n }\n CCTAG_COUT(\"\");\n POP_LEAVE;\n}\n\n\/*************************************************************\/\n\/* Main entry *\/\n\/*************************************************************\/\nint main(int argc, char** argv)\n{\n if( cmdline.parse( argc, argv ) == false ) {\n cmdline.usage( argv[0] );\n return EXIT_FAILURE;\n }\n\n cmdline.print( argv[0] );\n\n \/\/ Check input path\n if( cmdline._filename.compare(\"\") != 0){\n if (!boost::filesystem::exists( cmdline._filename )) {\n std::cerr << std::endl\n << \"The input file \\\"\"<< cmdline._filename << \"\\\" is missing\" << std::endl;\n return EXIT_FAILURE;\n }\n }else{\n std::cerr << std::endl\n << \"An input file is required\" << std::endl;\n cmdline.usage( argv[0] );\n return EXIT_FAILURE;\n }\n\n#ifdef WITH_CUDA\n popart::pop_cuda_only_sync_calls( cmdline._switchSync );\n#endif\n\n \/\/ Check the (optional) parameters path\n std::size_t nCrowns = std::atoi(cmdline._nCrowns.c_str());\n cctag::Parameters params(nCrowns);\n \n if( cmdline._paramsFilename != \"\" ) {\n if (!boost::filesystem::exists( cmdline._paramsFilename )) {\n std::cerr << std::endl\n << \"The input file \\\"\"<< cmdline._paramsFilename << \"\\\" is missing\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/ Read the parameter file provided by the user\n std::ifstream ifs( cmdline._paramsFilename.c_str() );\n boost::archive::xml_iarchive ia(ifs);\n ia >> boost::serialization::make_nvp(\"CCTagsParams\", params);\n CCTAG_COUT(params._nCrowns);\n CCTAG_COUT(nCrowns);\n assert( nCrowns == params._nCrowns );\n } else {\n \/\/ Use the default parameters and save them in defaultParameters.xml\n cmdline._paramsFilename = \"defaultParameters.xml\";\n std::ofstream ofs( cmdline._paramsFilename.c_str() );\n boost::archive::xml_oarchive oa(ofs);\n oa << boost::serialization::make_nvp(\"CCTagsParams\", params);\n CCTAG_COUT(\"Parameter file not provided. Default parameters are used.\");\n }\n \n CCTagMarkersBank bank(params._nCrowns);\n if ( !cmdline._cctagBankFilename.empty())\n {\n bank = CCTagMarkersBank(cmdline._cctagBankFilename);\n }\n\n#ifdef WITH_CUDA\n if( cmdline._useCuda ) {\n params.setUseCuda( true );\n }\n\n if( cmdline._debugDir != \"\" ) {\n params.setDebugDir( cmdline._debugDir );\n }\n\n popart::device_prop_t deviceInfo;\n deviceInfo.print( );\n#endif \/\/ WITH_CUDA\n\n bfs::path myPath( cmdline._filename );\n std::string ext(myPath.extension().string());\n\n const bfs::path subFilenamePath(myPath.filename());\n const bfs::path parentPath( myPath.parent_path() == \"\" ? \".\" : myPath.parent_path());\n std::string outputFileName;\n if (!bfs::is_directory(myPath))\n {\n CCTagVisualDebug::instance().initializeFolders( parentPath , cmdline._outputFolderName , params._nCrowns );\n outputFileName = parentPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n }else\n {\n CCTagVisualDebug::instance().initializeFolders( myPath , cmdline._outputFolderName , params._nCrowns );\n outputFileName = myPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n }\n std::ofstream outputFile;\n outputFile.open( outputFileName );\n \n if ( (ext == \".png\") || (ext == \".jpg\") ) {\n POP_INFO(\"looking at image \" << myPath.string());\n \n \/\/ Gray scale convertion\n cv::Mat src = cv::imread(cmdline._filename);\n cv::Mat graySrc;\n cv::cvtColor( src, graySrc, CV_BGR2GRAY );\n\n \/\/ Upscale original image\n \/*{\n rgb8_image_t simage;\n simage.recreate( 2 * image.width(), 2 * image.height() );\n rgb8_view_t osvw( view( simage ) );\n terry::resize_view( svw, osvw, terry::sampler::bicubic_sampler() );\n }*\/\n\n \/\/ Call the CCTag detection\n detection(0, graySrc, params, bank, outputFile, myPath.stem().string());\n \/\/detection(0, my_view, params, bank, outputFile, myPath.stem().string());\n} else if (ext == \".avi\" )\n {\n CCTAG_COUT(\"*** Video mode ***\");\n POP_INFO( \"looking at video \" << myPath.string() );\n\n \/\/ open video and check\n cv::VideoCapture video( cmdline._filename.c_str() );\n if(!video.isOpened())\n {\n CCTAG_COUT(\"Unable to open the video : \" << cmdline._filename); return -1;\n }\n\n \/\/ play loop\n int lastFrame = video.get(CV_CAP_PROP_FRAME_COUNT);\n std::size_t frameId = 0;\n while( video.get(CV_CAP_PROP_POS_FRAMES) < lastFrame )\n {\n cv::Mat frame;\n video >> frame;\n cv::Mat imgGray;\n cv::cvtColor( frame, imgGray, CV_BGR2GRAY );\n\n \/\/ Set the output folder\n std::stringstream outFileName;\n outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n \/\/ Call the CCTag detection\n detection(frameId, imgGray, params, bank, outputFile, outFileName.str());\n ++frameId; \n }\n } else if (bfs::is_directory(myPath)) {\n CCTAG_COUT(\"*** Image sequence mode ***\");\n\n std::vector<bfs::path> vFileInFolder;\n\n std::copy(bfs::directory_iterator(myPath), bfs::directory_iterator(), std::back_inserter(vFileInFolder)); \/\/ is directory_entry, which is\n std::sort(vFileInFolder.begin(), vFileInFolder.end());\n\n std::size_t frameId = 0;\n\n for(const auto & fileInFolder : vFileInFolder) {\n const std::string subExt(bfs::extension(fileInFolder));\n \n if ( (subExt == \".png\") || (subExt == \".jpg\") ) {\n CCTAG_COUT( \"Processing image \" << fileInFolder.string() );\n\n\t\tcv::Mat src;\n \tsrc = cv::imread(fileInFolder.string());\n\n cv::Mat imgGray;\n cv::cvtColor( src, imgGray, CV_BGR2GRAY );\n \n \/\/ Call the CCTag detection\n detection(frameId, imgGray, params, bank, outputFile, fileInFolder.stem().string());\n++frameId;\n }\n }\n }else\n {\n throw std::logic_error(\"Unrecognized input.\");\n }\n outputFile.close();\n return 0;\n}\n\n<commit_msg>Allows to invert the input frame for projected cctag scenario.<commit_after>#define png_infopp_NULL (png_infopp)NULL\n#define int_p_NULL (int*)NULL\n#include <boost\/gil\/extension\/io\/png_io.hpp>\n\n#include \"cctag\/fileDebug.hpp\"\n#include \"cctag\/visualDebug.hpp\"\n#include \"cctag\/progBase\/exceptions.hpp\"\n#include \"cctag\/detection.hpp\"\n#include \"cctag\/view.hpp\"\n#include \"cctag\/image.hpp\"\n#include \"cctag\/cmdline.hpp\"\n\n#ifdef WITH_CUDA\n#include \"cuda\/device_prop.hpp\"\n#include \"cuda\/debug_macros.hpp\"\n#endif \/\/ WITH_CUDA\n\n#include <boost\/filesystem\/convenience.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/progress.hpp>\n#include <boost\/exception\/all.hpp>\n#include <boost\/ptr_container\/ptr_list.hpp>\n#include <boost\/archive\/xml_oarchive.hpp>\n#include <boost\/archive\/xml_iarchive.hpp>\n\n#include <terry\/sampler\/all.hpp>\n#include <terry\/sampler\/resample_subimage.hpp>\n\n#include <opencv\/cv.h>\n#include <opencv2\/videoio.hpp>\n#include <opencv2\/core\/core.hpp>\n#include \"opencv2\/opencv.hpp\"\n\n#include <sstream>\n#include <iostream>\n#include <string>\n#include <fstream>\n#include <exception>\n\nusing namespace cctag;\nusing boost::timer;\n\nusing namespace boost::gil;\nnamespace bfs = boost::filesystem;\n\n\/\/ static const std::string kUsageString = \"Usage: detection image_file.png\\n\";\n\nvoid detection(std::size_t frameId, const cv::Mat & src, const cctag::Parameters & params, const cctag::CCTagMarkersBank & bank, std::ofstream & output, std::string debugFileName = \"\")\n{\n POP_ENTER;\n \n if (debugFileName == \"\") {\n debugFileName = \"00000\";\n }\n \n \/\/ Process markers detection\n boost::timer t;\n boost::ptr_list<CCTag> markers;\n \n CCTagVisualDebug::instance().initBackgroundImage(src);\n CCTagVisualDebug::instance().setImageFileName(debugFileName);\n CCTagFileDebug::instance().setPath(CCTagVisualDebug::instance().getPath());\n\n cctagDetection(markers, frameId , src, params, bank, true); \n\n CCTagFileDebug::instance().outPutAllSessions();\n CCTagFileDebug::instance().clearSessions();\n CCTagVisualDebug::instance().outPutAllSessions();\n CCTagVisualDebug::instance().clearSessions();\n\n CCTAG_COUT( markers.size() << \" markers.\");\n CCTAG_COUT(\"Total time: \" << t.elapsed());\n CCTAG_COUT_NOENDL(\"Id : \");\n\n int i = 0;\n output << \"#frame \" << frameId << '\\n';\n output << markers.size() << '\\n';\n BOOST_FOREACH(const cctag::CCTag & marker, markers) {\n output << marker.x() << \" \" << marker.y() << \" \" << marker.id() << \" \" << marker.getStatus() << '\\n';\n if (i == 0) {\n CCTAG_COUT_NOENDL(marker.id() + 1);\n } else {\n CCTAG_COUT_NOENDL(\", \" << marker.id() + 1);\n }\n ++i;\n }\n CCTAG_COUT(\"\");\n POP_LEAVE;\n}\n\n\/*************************************************************\/\n\/* Main entry *\/\n\/*************************************************************\/\nint main(int argc, char** argv)\n{\n if( cmdline.parse( argc, argv ) == false ) {\n cmdline.usage( argv[0] );\n return EXIT_FAILURE;\n }\n\n cmdline.print( argv[0] );\n\n \/\/ Check input path\n if( cmdline._filename.compare(\"\") != 0){\n if (!boost::filesystem::exists( cmdline._filename )) {\n std::cerr << std::endl\n << \"The input file \\\"\"<< cmdline._filename << \"\\\" is missing\" << std::endl;\n return EXIT_FAILURE;\n }\n }else{\n std::cerr << std::endl\n << \"An input file is required\" << std::endl;\n cmdline.usage( argv[0] );\n return EXIT_FAILURE;\n }\n\n#ifdef WITH_CUDA\n popart::pop_cuda_only_sync_calls( cmdline._switchSync );\n#endif\n\n \/\/ Check the (optional) parameters path\n std::size_t nCrowns = std::atoi(cmdline._nCrowns.c_str());\n cctag::Parameters params(nCrowns);\n \n if( cmdline._paramsFilename != \"\" ) {\n if (!boost::filesystem::exists( cmdline._paramsFilename )) {\n std::cerr << std::endl\n << \"The input file \\\"\"<< cmdline._paramsFilename << \"\\\" is missing\" << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/ Read the parameter file provided by the user\n std::ifstream ifs( cmdline._paramsFilename.c_str() );\n boost::archive::xml_iarchive ia(ifs);\n ia >> boost::serialization::make_nvp(\"CCTagsParams\", params);\n CCTAG_COUT(params._nCrowns);\n CCTAG_COUT(nCrowns);\n assert( nCrowns == params._nCrowns );\n } else {\n \/\/ Use the default parameters and save them in defaultParameters.xml\n cmdline._paramsFilename = \"defaultParameters.xml\";\n std::ofstream ofs( cmdline._paramsFilename.c_str() );\n boost::archive::xml_oarchive oa(ofs);\n oa << boost::serialization::make_nvp(\"CCTagsParams\", params);\n CCTAG_COUT(\"Parameter file not provided. Default parameters are used.\");\n }\n \n CCTagMarkersBank bank(params._nCrowns);\n if ( !cmdline._cctagBankFilename.empty())\n {\n bank = CCTagMarkersBank(cmdline._cctagBankFilename);\n }\n\n#ifdef WITH_CUDA\n if( cmdline._useCuda ) {\n params.setUseCuda( true );\n }\n\n if( cmdline._debugDir != \"\" ) {\n params.setDebugDir( cmdline._debugDir );\n }\n\n popart::device_prop_t deviceInfo;\n deviceInfo.print( );\n#endif \/\/ WITH_CUDA\n\n bfs::path myPath( cmdline._filename );\n std::string ext(myPath.extension().string());\n\n const bfs::path subFilenamePath(myPath.filename());\n const bfs::path parentPath( myPath.parent_path() == \"\" ? \".\" : myPath.parent_path());\n std::string outputFileName;\n if (!bfs::is_directory(myPath))\n {\n CCTagVisualDebug::instance().initializeFolders( parentPath , cmdline._outputFolderName , params._nCrowns );\n outputFileName = parentPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n }else\n {\n CCTagVisualDebug::instance().initializeFolders( myPath , cmdline._outputFolderName , params._nCrowns );\n outputFileName = myPath.string() + \"\/\" + cmdline._outputFolderName + \"\/cctag\" + std::to_string(nCrowns) + \"CC.out\";\n }\n std::ofstream outputFile;\n outputFile.open( outputFileName );\n \n if ( (ext == \".png\") || (ext == \".jpg\") ) {\n POP_INFO(\"looking at image \" << myPath.string());\n \n \/\/ Gray scale convertion\n cv::Mat src = cv::imread(cmdline._filename);\n cv::Mat graySrc;\n cv::cvtColor( src, graySrc, CV_BGR2GRAY );\n\n \/\/ Upscale original image\n \/*{\n rgb8_image_t simage;\n simage.recreate( 2 * image.width(), 2 * image.height() );\n rgb8_view_t osvw( view( simage ) );\n terry::resize_view( svw, osvw, terry::sampler::bicubic_sampler() );\n }*\/\n\n \/\/ Call the CCTag detection\n detection(0, graySrc, params, bank, outputFile, myPath.stem().string());\n \/\/detection(0, my_view, params, bank, outputFile, myPath.stem().string());\n} else if (ext == \".avi\" )\n {\n CCTAG_COUT(\"*** Video mode ***\");\n POP_INFO( \"looking at video \" << myPath.string() );\n\n \/\/ open video and check\n cv::VideoCapture video( cmdline._filename.c_str() );\n if(!video.isOpened())\n {\n CCTAG_COUT(\"Unable to open the video : \" << cmdline._filename); return -1;\n }\n\n \/\/ play loop\n int lastFrame = video.get(CV_CAP_PROP_FRAME_COUNT);\n std::size_t frameId = 0;\n while( video.get(CV_CAP_PROP_POS_FRAMES) < lastFrame )\n {\n cv::Mat frame;\n video >> frame;\n cv::Mat imgGray;\n cv::cvtColor( frame, imgGray, CV_BGR2GRAY );\n\n \/\/ Set the output folder\n std::stringstream outFileName;\n outFileName << std::setfill('0') << std::setw(5) << frameId;\n\n \/\/ Invert the image for the projection scenario\n \/\/cv::Mat imgGrayInverted;\n \/\/bitwise_not ( imgGray, imgGrayInverted );\n \n \/\/ Call the CCTag detection\n detection(frameId, imgGray, params, bank, outputFile, outFileName.str());\n ++frameId; \n }\n } else if (bfs::is_directory(myPath)) {\n CCTAG_COUT(\"*** Image sequence mode ***\");\n\n std::vector<bfs::path> vFileInFolder;\n\n std::copy(bfs::directory_iterator(myPath), bfs::directory_iterator(), std::back_inserter(vFileInFolder)); \/\/ is directory_entry, which is\n std::sort(vFileInFolder.begin(), vFileInFolder.end());\n\n std::size_t frameId = 0;\n\n for(const auto & fileInFolder : vFileInFolder) {\n const std::string subExt(bfs::extension(fileInFolder));\n \n if ( (subExt == \".png\") || (subExt == \".jpg\") ) {\n CCTAG_COUT( \"Processing image \" << fileInFolder.string() );\n\n\t\tcv::Mat src;\n \tsrc = cv::imread(fileInFolder.string());\n\n cv::Mat imgGray;\n cv::cvtColor( src, imgGray, CV_BGR2GRAY );\n \n \/\/ Call the CCTag detection\n detection(frameId, imgGray, params, bank, outputFile, fileInFolder.stem().string());\n++frameId;\n }\n }\n }else\n {\n throw std::logic_error(\"Unrecognized input.\");\n }\n outputFile.close();\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix hang in OSX build.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"DiskInterface.h\"\n#include \"anyware_serial.h\"\n\n\/*!\n DISK-INIT\n\n Initialize disk game. This just allows the Arduino to listen to DISK commands.\n *\/\nvoid disk_init_action()\n{\n if (global_userid < 0) {\n printError(\"protocol error\", \"DISK-INIT received without IDENTITY\");\n return;\n }\n\n if (global_debug) {\n Serial.println(\"DEBUG DISK-INIT received\");\n }\n\n do_disk_init();\n}\n\n\/*!\n DISK-EXIT\n\n Exit disk game. Stop any currently running animation or process.\n No longer listen to DISK commands.\n*\/\nvoid disk_exit_action()\n{\n if (global_debug) {\n Serial.println(\"DEBUG DISK-EXIT received\");\n }\n\n do_disk_exit();\n}\n\n\/*!\n DISK-RESET\n\n Resets the game, home the disks and afterwards to into \"ready\" mode.\n*\/\nvoid disk_reset_action()\n{\n if (global_state == STATE_IDLE) return;\n\n if (global_debug) {\n Serial.println(\"DEBUG DISK-RESET received\");\n }\n\n do_disk_reset();\n}\n\n\n\/*!\n DISK <diskid> POS <deg> DIR <dir> USER <userid>\n*\/\nvoid disk_action()\n{\n if (global_state == STATE_IDLE) return;\n\n char *arg = sCmd.next();\n uint8_t diskid = atoi(arg);\n if (diskid > 2) {\n printError(F(\"protocol error\"), F(\"Illegal diskid argument\"));\n return;\n }\n Direction dir = DIR_OFF;\n int pos = -1, userid = -1;\n while (arg = sCmd.next()) {\n if (!strcmp(arg, \"POS\")) {\n arg = sCmd.next();\n if (arg) {\n pos = atoi(arg);\n }\n }\n if (!strcmp(arg, \"DIR\")) {\n arg = sCmd.next();\n if (arg) {\n int dirarg = atoi(arg);\n switch (dirarg) {\n case DIR_CW:\n case DIR_OFF:\n case DIR_CCW:\n dir = (Direction)dirarg;\n break;\n default:\n printError(\"protocol error\", \"Illegal DIR argument\");\n break;\n }\n }\n }\n if (!strcmp(arg, \"USER\")) {\n arg = sCmd.next();\n if (arg) {\n userid = atoi(arg);\n if (userid < 0 || userid > 2) {\n printError(\"protocol error\", \"Illegal USER argument\");\n userid = 0;\n }\n }\n }\n }\n if (global_debug) {\n Serial.print(F(\"DEBUG DISK received: \"));\n Serial.print(diskid);\n Serial.print(F(\" POS \"));\n Serial.print(pos);\n Serial.print(F(\" DIR \"));\n Serial.print(dir);\n Serial.println();\n }\n do_disk(diskid, userid, pos, dir);\n}\n\n\/*!\n PANEL-SET <strip> <panel> <intensity> <color> <easing>\n\n Only listens for strip 3 and 4\n*\/\nvoid panel_set_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *panelarg = sCmd.next();\n if (!panelarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t panel = atoi(panelarg);\n if (strip == 3 && panel >= 3 ||\n strip == 4 && panel >= 6) {\n printError(F(\"protocol error\"), F(\"Illegal panel argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n char *colorarg = sCmd.next();\n uint32_t color;\n if (colorarg && strcmp(colorarg, \"-\")) {\n if (!getColor(colorarg, color)) {\n printError(F(\"protocol error\"), F(\"Illegal color argument\"));\n return;\n }\n }\n\n char *easingarg = sCmd.next();\n AnywareEasing::EasingType easing = AnywareEasing::BINARY;\n if (easingarg && strcmp(easingarg, \"-\")) {\n if (!AnywareEasing::getEasing(easingarg, easing)) {\n printError(F(\"protocol error\"), F(\"Illegal easing argument\"));\n return;\n }\n }\n\n if (global_debug) {\n Serial.print(F(\"DEBUG PANEL-SET received: \"));\n Serial.print(easing);\n \/\/ FIXME: output\n Serial.println();\n }\n do_panel_set(strip, panel, intensity, color, easing);\n}\n\n\/*!\n PANEL-SENSORS <userid> <sensors>\n*\/\nvoid panel_pulse_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *panelarg = sCmd.next();\n if (!panelarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t panel = atoi(panelarg);\n if (strip == 3 && panel >= 3 ||\n strip == 4 && panel >= 6) {\n printError(F(\"protocol error\"), F(\"Illegal panel argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n char *colorarg = sCmd.next();\n uint32_t color;\n if (colorarg && strcmp(colorarg, \"-\")) {\n if (!getColor(colorarg, color)) {\n printError(F(\"protocol error\"), F(\"Illegal color argument\"));\n return;\n }\n }\n\n char *easingarg = sCmd.next();\n AnywareEasing::EasingType easing = AnywareEasing::BINARY;\n if (easingarg && strcmp(easingarg, \"-\")) {\n if (!AnywareEasing::getEasing(easingarg, easing)) {\n printError(F(\"protocol error\"), F(\"Illegal easing argument\"));\n return;\n }\n }\n\n if (global_debug) {\n Serial.print(F(\"DEBUG PANEL-PULSE received: \"));\n \/\/ FIXME: output\n Serial.println();\n }\n do_panel_pulse(strip, panel, intensity, color, easing);\n}\n\n\/*!\n PANEL-INTENSITY <strip> <intensity>\n*\/\nvoid panel_intensity_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n do_panel_intensity(strip, intensity);\n}\n\nvoid setupCommands()\n{ \n setupCommonCommands();\n\n Serial.println(F(\"SUPPORTED\"));\n addCommand(\"DISK-INIT\", disk_init_action);\n addCommand(\"DISK-RESET\", disk_reset_action);\n addCommand(\"DISK\", disk_action);\n addCommand(\"DISK-EXIT\", disk_exit_action);\n\n addCommand(\"PANEL-SET\", panel_set_action, \" [34]\");\n addCommand(\"PANEL-PULSE\", panel_pulse_action, \" [34]\");\n addCommand(\"PANEL-INTENSITY\", panel_intensity_action, \" [34]\");\n Serial.println(F(\"ENDSUPPORTED\"));\n}\n<commit_msg>Better debug output<commit_after>#include \"DiskInterface.h\"\n#include \"anyware_serial.h\"\n\n\/*!\n DISK-INIT\n\n Initialize disk game. This just allows the Arduino to listen to DISK commands.\n *\/\nvoid disk_init_action()\n{\n if (global_userid < 0) {\n printError(\"protocol error\", \"DISK-INIT received without IDENTITY\");\n return;\n }\n\n if (global_debug) {\n Serial.println(\"DEBUG DISK-INIT received\");\n }\n\n do_disk_init();\n}\n\n\/*!\n DISK-EXIT\n\n Exit disk game. Stop any currently running animation or process.\n No longer listen to DISK commands.\n*\/\nvoid disk_exit_action()\n{\n if (global_debug) {\n Serial.println(\"DEBUG DISK-EXIT received\");\n }\n\n do_disk_exit();\n}\n\n\/*!\n DISK-RESET\n\n Resets the game, home the disks and afterwards to into \"ready\" mode.\n*\/\nvoid disk_reset_action()\n{\n if (global_state == STATE_IDLE) return;\n\n if (global_debug) {\n Serial.println(\"DEBUG DISK-RESET received\");\n }\n\n do_disk_reset();\n}\n\n\n\/*!\n DISK <diskid> POS <deg> DIR <dir> USER <userid>\n*\/\nvoid disk_action()\n{\n if (global_state == STATE_IDLE) return;\n\n char *arg = sCmd.next();\n uint8_t diskid = atoi(arg);\n if (diskid > 2) {\n printError(F(\"protocol error\"), F(\"Illegal diskid argument\"));\n return;\n }\n Direction dir = DIR_OFF;\n int pos = -1, userid = -1;\n while (arg = sCmd.next()) {\n if (!strcmp(arg, \"POS\")) {\n arg = sCmd.next();\n if (arg) {\n pos = atoi(arg);\n }\n }\n if (!strcmp(arg, \"DIR\")) {\n arg = sCmd.next();\n if (arg) {\n int dirarg = atoi(arg);\n switch (dirarg) {\n case DIR_CW:\n case DIR_OFF:\n case DIR_CCW:\n dir = (Direction)dirarg;\n break;\n default:\n printError(\"protocol error\", \"Illegal DIR argument\");\n break;\n }\n }\n }\n if (!strcmp(arg, \"USER\")) {\n arg = sCmd.next();\n if (arg) {\n userid = atoi(arg);\n if (userid < 0 || userid > 2) {\n printError(\"protocol error\", \"Illegal USER argument\");\n userid = 0;\n }\n }\n }\n }\n if (global_debug) {\n Serial.print(F(\"DEBUG DISK received: \"));\n Serial.print(diskid);\n Serial.print(F(\" POS \"));\n Serial.print(pos);\n Serial.print(F(\" DIR \"));\n Serial.print(dir);\n Serial.println();\n }\n do_disk(diskid, userid, pos, dir);\n}\n\n\/*!\n PANEL-SET <strip> <panel> <intensity> <color> <easing>\n\n Only listens for strip 3 and 4\n*\/\nvoid panel_set_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *panelarg = sCmd.next();\n if (!panelarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t panel = atoi(panelarg);\n if (strip == 3 && panel >= 3 ||\n strip == 4 && panel >= 6) {\n printError(F(\"protocol error\"), F(\"Illegal panel argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-SET\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n char *colorarg = sCmd.next();\n uint32_t color;\n if (colorarg && strcmp(colorarg, \"-\")) {\n if (!getColor(colorarg, color)) {\n printError(F(\"protocol error\"), F(\"Illegal color argument\"));\n return;\n }\n }\n\n char *easingarg = sCmd.next();\n AnywareEasing::EasingType easing = AnywareEasing::BINARY;\n if (easingarg && strcmp(easingarg, \"-\")) {\n if (!AnywareEasing::getEasing(easingarg, easing)) {\n printError(F(\"protocol error\"), F(\"Illegal easing argument\"));\n return;\n }\n }\n\n if (global_debug) {\n Serial.print(F(\"DEBUG PANEL-SET received: \"));\n Serial.print(strip);\n Serial.print(\" \");\n Serial.print(panel);\n Serial.print(\" \");\n Serial.print(intensity);\n Serial.print(\" \");\n Serial.print(color, HEX);\n Serial.print(\" \");\n Serial.print(easing);\n Serial.println();\n }\n do_panel_set(strip, panel, intensity, color, easing);\n}\n\n\/*!\n PANEL-SENSORS <userid> <sensors>\n*\/\nvoid panel_pulse_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *panelarg = sCmd.next();\n if (!panelarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t panel = atoi(panelarg);\n if (strip == 3 && panel >= 3 ||\n strip == 4 && panel >= 6) {\n printError(F(\"protocol error\"), F(\"Illegal panel argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n char *colorarg = sCmd.next();\n uint32_t color;\n if (colorarg && strcmp(colorarg, \"-\")) {\n if (!getColor(colorarg, color)) {\n printError(F(\"protocol error\"), F(\"Illegal color argument\"));\n return;\n }\n }\n\n char *easingarg = sCmd.next();\n AnywareEasing::EasingType easing = AnywareEasing::BINARY;\n if (easingarg && strcmp(easingarg, \"-\")) {\n if (!AnywareEasing::getEasing(easingarg, easing)) {\n printError(F(\"protocol error\"), F(\"Illegal easing argument\"));\n return;\n }\n }\n\n if (global_debug) {\n Serial.print(F(\"DEBUG PANEL-PULSE received: \"));\n Serial.print(strip);\n Serial.print(\" \");\n Serial.print(panel);\n Serial.print(\" \");\n Serial.print(intensity);\n Serial.print(\" \");\n Serial.print(color, HEX);\n Serial.print(\" \");\n Serial.print(easing);\n Serial.println();\n }\n do_panel_pulse(strip, panel, intensity, color, easing);\n}\n\n\/*!\n PANEL-INTENSITY <strip> <intensity>\n*\/\nvoid panel_intensity_action()\n{\n char *striparg = sCmd.next();\n if (!striparg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t strip = atoi(striparg);\n if (strip < 3 || strip > 4) {\n printError(F(\"protocol error\"), F(\"Illegal strip argument\"));\n return;\n }\n\n char *intensityarg = sCmd.next();\n if (!intensityarg) {\n printError(F(\"protocol error\"), F(\"wrong # of parameters to PANEL-PULSE\"));\n return;\n }\n uint8_t intensity = atoi(intensityarg);\n if (intensity > 100) {\n printError(F(\"protocol error\"), F(\"Illegal intensity argument\"));\n return;\n }\n\n do_panel_intensity(strip, intensity);\n}\n\nvoid setupCommands()\n{ \n setupCommonCommands();\n\n Serial.println(F(\"SUPPORTED\"));\n addCommand(\"DISK-INIT\", disk_init_action);\n addCommand(\"DISK-RESET\", disk_reset_action);\n addCommand(\"DISK\", disk_action);\n addCommand(\"DISK-EXIT\", disk_exit_action);\n\n addCommand(\"PANEL-SET\", panel_set_action, \" [34]\");\n addCommand(\"PANEL-PULSE\", panel_pulse_action, \" [34]\");\n addCommand(\"PANEL-INTENSITY\", panel_intensity_action, \" [34]\");\n Serial.println(F(\"ENDSUPPORTED\"));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: PageListWatcher.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 18:13:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"PageListWatcher.hxx\"\n\n#include \"sdpage.hxx\"\n#include <tools\/debug.hxx>\n#include <svx\/svdmodel.hxx>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ #109538#\n\nvoid ImpPageListWatcher::ImpRecreateSortedPageListOnDemand()\n{\n \/\/ clear vectors\n maPageVectorStandard.clear();\n maPageVectorNotes.clear();\n mpHandoutPage = 0L;\n\n \/\/ build up vectors again\n const sal_uInt32 nPageCount(ImpGetPageCount());\n\n for(sal_uInt32 a(0L); a < nPageCount; a++)\n {\n SdPage* pCandidate = ImpGetPage(a);\n DBG_ASSERT(pCandidate, \"ImpPageListWatcher::ImpRecreateSortedPageListOnDemand: Invalid PageList in Model (!)\");\n\n switch(pCandidate->GetPageKind())\n {\n case PK_STANDARD:\n {\n maPageVectorStandard.push_back(pCandidate);\n break;\n }\n case PK_NOTES:\n {\n maPageVectorNotes.push_back(pCandidate);\n break;\n }\n case PK_HANDOUT:\n {\n DBG_ASSERT(!mpHandoutPage, \"ImpPageListWatcher::ImpRecreateSortedPageListOnDemand: Two Handout pages in PageList of Model (!)\");\n mpHandoutPage = pCandidate;\n break;\n }\n }\n }\n\n \/\/ set to valid\n mbPageListValid = sal_True;\n}\n\nImpPageListWatcher::ImpPageListWatcher(const SdrModel& rModel)\n: mrModel(rModel),\n mpHandoutPage(0L),\n mbPageListValid(sal_False)\n{\n}\n\nImpPageListWatcher::~ImpPageListWatcher()\n{\n}\n\nSdPage* ImpPageListWatcher::GetSdPage(PageKind ePgKind, sal_uInt32 nPgNum)\n{\n SdPage* pRetval(0L);\n\n if(!mbPageListValid)\n {\n ImpRecreateSortedPageListOnDemand();\n }\n\n switch(ePgKind)\n {\n case PK_STANDARD:\n {\n if (nPgNum>=0 && nPgNum<maPageVectorStandard.size())\n pRetval = maPageVectorStandard[nPgNum];\n else\n {\n DBG_ASSERT(nPgNum <= maPageVectorStandard.size(),\n \"ImpPageListWatcher::GetSdPage(PK_STANDARD): access out of range\");\n DBG_WARNING2 (\" %d > %d\",\n nPgNum, nPgNum<maPageVectorStandard.size());\n }\n break;\n }\n case PK_NOTES:\n {\n if (nPgNum>=0 && nPgNum<maPageVectorNotes.size())\n pRetval = maPageVectorNotes[nPgNum];\n else\n {\n DBG_ASSERT(nPgNum <= maPageVectorNotes.size(),\n \"ImpPageListWatcher::GetSdPage(PK_NOTES): access out of range\");\n DBG_WARNING2(\" %d > %d\",\n nPgNum, nPgNum<maPageVectorNotes.size());\n }\n break;\n }\n case PK_HANDOUT:\n {\n\/\/ #11420# for models used to transfer drawing shapes via clipboard its\n\/\/ ok to not have a handout page\n\/\/ DBG_ASSERT(mpHandoutPage, \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n DBG_ASSERT(nPgNum == 0L, \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n if (nPgNum == 0)\n pRetval = mpHandoutPage;\n else\n {\n DBG_ASSERT(nPgNum == 0L,\n \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n }\n break;\n }\n }\n\n return pRetval;\n}\n\nsal_uInt32 ImpPageListWatcher::GetSdPageCount(PageKind ePgKind)\n{\n sal_uInt32 nRetval(0L);\n\n if(!mbPageListValid)\n {\n ImpRecreateSortedPageListOnDemand();\n }\n\n switch(ePgKind)\n {\n case PK_STANDARD:\n {\n nRetval = maPageVectorStandard.size();\n break;\n }\n case PK_NOTES:\n {\n nRetval = maPageVectorNotes.size();\n break;\n }\n case PK_HANDOUT:\n {\n if(mpHandoutPage)\n {\n nRetval = 1L;\n }\n\n break;\n }\n }\n\n return nRetval;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_uInt32 ImpDrawPageListWatcher::ImpGetPageCount() const\n{\n return (sal_uInt32)mrModel.GetPageCount();\n}\n\nSdPage* ImpDrawPageListWatcher::ImpGetPage(sal_uInt32 nIndex) const\n{\n return (SdPage*)mrModel.GetPage((sal_uInt16)nIndex);\n}\n\nImpDrawPageListWatcher::ImpDrawPageListWatcher(const SdrModel& rModel)\n: ImpPageListWatcher(rModel)\n{\n}\n\nImpDrawPageListWatcher::~ImpDrawPageListWatcher()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_uInt32 ImpMasterPageListWatcher::ImpGetPageCount() const\n{\n return (sal_uInt32)mrModel.GetMasterPageCount();\n}\n\nSdPage* ImpMasterPageListWatcher::ImpGetPage(sal_uInt32 nIndex) const\n{\n return (SdPage*)mrModel.GetMasterPage((sal_uInt16)nIndex);\n}\n\nImpMasterPageListWatcher::ImpMasterPageListWatcher(const SdrModel& rModel)\n: ImpPageListWatcher(rModel)\n{\n}\n\nImpMasterPageListWatcher::~ImpMasterPageListWatcher()\n{\n}\n<commit_msg>INTEGRATION: CWS sdwarningsbegone (1.6.38); FILE MERGED 2006\/11\/22 12:41:31 cl 1.6.38.1: #i69285# warning free code changes for unxlngi6.pro<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: PageListWatcher.cxx,v $\n *\n * $Revision: 1.7 $\n *\n * last change: $Author: kz $ $Date: 2006-12-12 16:30:15 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sd.hxx\"\n\n#include \"PageListWatcher.hxx\"\n\n#include \"sdpage.hxx\"\n#include <tools\/debug.hxx>\n#include <svx\/svdmodel.hxx>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ #109538#\n\nvoid ImpPageListWatcher::ImpRecreateSortedPageListOnDemand()\n{\n \/\/ clear vectors\n maPageVectorStandard.clear();\n maPageVectorNotes.clear();\n mpHandoutPage = 0L;\n\n \/\/ build up vectors again\n const sal_uInt32 nPageCount(ImpGetPageCount());\n\n for(sal_uInt32 a(0L); a < nPageCount; a++)\n {\n SdPage* pCandidate = ImpGetPage(a);\n DBG_ASSERT(pCandidate, \"ImpPageListWatcher::ImpRecreateSortedPageListOnDemand: Invalid PageList in Model (!)\");\n\n switch(pCandidate->GetPageKind())\n {\n case PK_STANDARD:\n {\n maPageVectorStandard.push_back(pCandidate);\n break;\n }\n case PK_NOTES:\n {\n maPageVectorNotes.push_back(pCandidate);\n break;\n }\n case PK_HANDOUT:\n {\n DBG_ASSERT(!mpHandoutPage, \"ImpPageListWatcher::ImpRecreateSortedPageListOnDemand: Two Handout pages in PageList of Model (!)\");\n mpHandoutPage = pCandidate;\n break;\n }\n }\n }\n\n \/\/ set to valid\n mbPageListValid = sal_True;\n}\n\nImpPageListWatcher::ImpPageListWatcher(const SdrModel& rModel)\n: mrModel(rModel),\n mpHandoutPage(0L),\n mbPageListValid(sal_False)\n{\n}\n\nImpPageListWatcher::~ImpPageListWatcher()\n{\n}\n\nSdPage* ImpPageListWatcher::GetSdPage(PageKind ePgKind, sal_uInt32 nPgNum)\n{\n SdPage* pRetval(0L);\n\n if(!mbPageListValid)\n {\n ImpRecreateSortedPageListOnDemand();\n }\n\n switch(ePgKind)\n {\n case PK_STANDARD:\n {\n if( nPgNum < (sal_uInt32)maPageVectorStandard.size() )\n pRetval = maPageVectorStandard[nPgNum];\n else\n {\n DBG_ASSERT(nPgNum <= maPageVectorStandard.size(),\n \"ImpPageListWatcher::GetSdPage(PK_STANDARD): access out of range\");\n DBG_WARNING2 (\" %d > %d\",\n nPgNum, nPgNum<maPageVectorStandard.size());\n }\n break;\n }\n case PK_NOTES:\n {\n if( nPgNum < (sal_uInt32)maPageVectorNotes.size() )\n pRetval = maPageVectorNotes[nPgNum];\n else\n {\n DBG_ASSERT(nPgNum <= maPageVectorNotes.size(),\n \"ImpPageListWatcher::GetSdPage(PK_NOTES): access out of range\");\n DBG_WARNING2(\" %d > %d\",\n nPgNum, nPgNum<maPageVectorNotes.size());\n }\n break;\n }\n case PK_HANDOUT:\n {\n\/\/ #11420# for models used to transfer drawing shapes via clipboard its\n\/\/ ok to not have a handout page\n\/\/ DBG_ASSERT(mpHandoutPage, \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n DBG_ASSERT(nPgNum == 0L, \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n if (nPgNum == 0)\n pRetval = mpHandoutPage;\n else\n {\n DBG_ASSERT(nPgNum == 0L,\n \"ImpPageListWatcher::GetSdPage: access to non existing handout page (!)\");\n }\n break;\n }\n }\n\n return pRetval;\n}\n\nsal_uInt32 ImpPageListWatcher::GetSdPageCount(PageKind ePgKind)\n{\n sal_uInt32 nRetval(0L);\n\n if(!mbPageListValid)\n {\n ImpRecreateSortedPageListOnDemand();\n }\n\n switch(ePgKind)\n {\n case PK_STANDARD:\n {\n nRetval = maPageVectorStandard.size();\n break;\n }\n case PK_NOTES:\n {\n nRetval = maPageVectorNotes.size();\n break;\n }\n case PK_HANDOUT:\n {\n if(mpHandoutPage)\n {\n nRetval = 1L;\n }\n\n break;\n }\n }\n\n return nRetval;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_uInt32 ImpDrawPageListWatcher::ImpGetPageCount() const\n{\n return (sal_uInt32)mrModel.GetPageCount();\n}\n\nSdPage* ImpDrawPageListWatcher::ImpGetPage(sal_uInt32 nIndex) const\n{\n return (SdPage*)mrModel.GetPage((sal_uInt16)nIndex);\n}\n\nImpDrawPageListWatcher::ImpDrawPageListWatcher(const SdrModel& rModel)\n: ImpPageListWatcher(rModel)\n{\n}\n\nImpDrawPageListWatcher::~ImpDrawPageListWatcher()\n{\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsal_uInt32 ImpMasterPageListWatcher::ImpGetPageCount() const\n{\n return (sal_uInt32)mrModel.GetMasterPageCount();\n}\n\nSdPage* ImpMasterPageListWatcher::ImpGetPage(sal_uInt32 nIndex) const\n{\n return (SdPage*)mrModel.GetMasterPage((sal_uInt16)nIndex);\n}\n\nImpMasterPageListWatcher::ImpMasterPageListWatcher(const SdrModel& rModel)\n: ImpPageListWatcher(rModel)\n{\n}\n\nImpMasterPageListWatcher::~ImpMasterPageListWatcher()\n{\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TextObjectBar.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 05:17:40 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_TEXT_OBJECT_BAR_HXX\n#define SD_TEXT_OBJECT_BAR_HXX\n\n\n#ifndef _SFXMODULE_HXX \/\/autogen\n#include <sfx2\/module.hxx>\n#endif\n#ifndef _SFX_SHELL_HXX \/\/autogen\n#include <sfx2\/shell.hxx>\n#endif\n\n#ifndef _SD_GLOB_HXX\n#include \"glob.hxx\"\n#endif\n\nclass CommandEvent;\n\nnamespace sd {\n\nclass View;\nclass ViewShell;\nclass Window;\n\nclass TextObjectBar\n : public SfxShell\n{\npublic:\n TYPEINFO();\n SFX_DECL_INTERFACE(SD_IF_SDDRAWTEXTOBJECTBAR);\n\n TextObjectBar (\n ViewShell* pSdViewShell,\n SfxItemPool& rItemPool,\n ::sd::View* pSdView);\n virtual ~TextObjectBar (void);\n\n void GetAttrState( SfxItemSet& rSet );\n void Execute( SfxRequest &rReq );\n\n virtual void Command( const CommandEvent& rCEvt );\n virtual BOOL HasUIFeature( ULONG nFeature );\n\nprivate:\n SfxItemPool& rPool;\n ViewShell* pViewShell;\n ::sd::View* pView;\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<commit_msg>INTEGRATION: CWS viewswitch (1.3.72); FILE MERGED 2005\/11\/17 13:57:58 af 1.3.72.1: #i57551# Remove HasUIFeature() method.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TextObjectBar.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-03-21 17:27:56 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_TEXT_OBJECT_BAR_HXX\n#define SD_TEXT_OBJECT_BAR_HXX\n\n\n#ifndef _SFXMODULE_HXX \/\/autogen\n#include <sfx2\/module.hxx>\n#endif\n#ifndef _SFX_SHELL_HXX \/\/autogen\n#include <sfx2\/shell.hxx>\n#endif\n\n#ifndef _SD_GLOB_HXX\n#include \"glob.hxx\"\n#endif\n\nclass CommandEvent;\n\nnamespace sd {\n\nclass View;\nclass ViewShell;\nclass Window;\n\nclass TextObjectBar\n : public SfxShell\n{\npublic:\n TYPEINFO();\n SFX_DECL_INTERFACE(SD_IF_SDDRAWTEXTOBJECTBAR);\n\n TextObjectBar (\n ViewShell* pSdViewShell,\n SfxItemPool& rItemPool,\n ::sd::View* pSdView);\n virtual ~TextObjectBar (void);\n\n void GetAttrState( SfxItemSet& rSet );\n void Execute( SfxRequest &rReq );\n\n virtual void Command( const CommandEvent& rCEvt );\n\nprivate:\n SfxItemPool& rPool;\n ViewShell* pViewShell;\n ::sd::View* pView;\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n#define _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n\n#include <cstdint> \/\/ uint16_t, uint32_t\n#include <string>\n\n#include \"sdd\/values\/bitset.hh\"\n#include \"sdd\/values\/flat_set.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief The default base configuration.\n\/\/\/\n\/\/\/ It doesn't include the configuration of identifier and values type. These informations\n\/\/\/ should be given by derived configurations.\nstruct default_configuration\n{\n \/\/\/ @brief The type of an SDD variable.\n using variable_type = unsigned int;\n\n \/\/\/ @brief The type to store the number of elements in an alpha successor function.\n using alpha_size_type = std::uint16_t;\n\n \/\/\/ @brief The type to store the number of elements in an operation.\n using operands_size_type = std::uint32_t;\n\n \/\/\/ @brief The initial size of the hash table that stores SDD.\n std::size_t sdd_unique_table_size;\n\n \/\/\/ @brief The size of the cache of SDD difference operations.\n std::size_t sdd_difference_cache_size;\n\n \/\/\/ @brief The size of the cache of SDD intersection operations.\n std::size_t sdd_intersection_cache_size;\n\n \/\/\/ @brief The size of the cache of SDD sum (union) operations.\n std::size_t sdd_sum_cache_size;\n\n \/\/\/ @brief The size, in bytes, of the buffer for temporary containers allocation.\n std::size_t sdd_arena_size;\n\n \/\/\/ @brief The initial size of the hash table that stores homomorphisms.\n std::size_t hom_unique_table_size;\n\n \/\/\/ @brief The size of the cache of homomorphism applications.\n std::size_t hom_cache_size;\n\n \/\/\/ @brief Tell if FPU registers shoud be preserved when using Expressions.\n static constexpr bool expression_preserve_fpu_registers = false;\n\n \/\/\/ @brief Tell if the library should clean all memory when the manager is destroyed.\n \/\/\/\n \/\/\/ Useful if you have only one instance of the library and that you don't want to wait for its\n \/\/\/ cleanup at your program's exit.\n bool final_cleanup;\n\n \/\/\/ @brief Default constructor.\n \/\/\/\n \/\/\/ Initialize all parameters to their default values.\n default_configuration()\n : sdd_unique_table_size(10000000)\n , sdd_difference_cache_size(500000)\n , sdd_intersection_cache_size(500000)\n , sdd_sum_cache_size(1000000)\n , sdd_arena_size(1024*1024*8)\n , hom_unique_table_size(1000000)\n , hom_cache_size(1000000)\n , final_cleanup(true)\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct flat_set_default_configuration\n : public default_configuration\n{\n \/\/\/ @brief The size of the hash table that stores flat_set<>.\n std::size_t flat_set_unique_table_size;\n\n flat_set_default_configuration()\n : default_configuration()\n , flat_set_unique_table_size(5000)\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf0\n : public default_configuration\n{\n using Identifier = std::string;\n using Values = values::bitset<64>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf1\n : public flat_set_default_configuration\n{\n using Identifier = std::string;\n using Values = values::flat_set<unsigned int>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf2\n : public flat_set_default_configuration\n{\n using Identifier = unsigned int;\n using Values = values::flat_set<unsigned int>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\n#endif \/\/ _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n<commit_msg>Increase default arena size.<commit_after>#ifndef _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n#define _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n\n#include <cstdint> \/\/ uint16_t, uint32_t\n#include <string>\n\n#include \"sdd\/values\/bitset.hh\"\n#include \"sdd\/values\/flat_set.hh\"\n\nnamespace sdd {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\/\/\/ @brief The default base configuration.\n\/\/\/\n\/\/\/ It doesn't include the configuration of identifier and values type. These informations\n\/\/\/ should be given by derived configurations.\nstruct default_configuration\n{\n \/\/\/ @brief The type of an SDD variable.\n using variable_type = unsigned int;\n\n \/\/\/ @brief The type to store the number of elements in an alpha successor function.\n using alpha_size_type = std::uint16_t;\n\n \/\/\/ @brief The type to store the number of elements in an operation.\n using operands_size_type = std::uint32_t;\n\n \/\/\/ @brief The initial size of the hash table that stores SDD.\n std::size_t sdd_unique_table_size;\n\n \/\/\/ @brief The size of the cache of SDD difference operations.\n std::size_t sdd_difference_cache_size;\n\n \/\/\/ @brief The size of the cache of SDD intersection operations.\n std::size_t sdd_intersection_cache_size;\n\n \/\/\/ @brief The size of the cache of SDD sum (union) operations.\n std::size_t sdd_sum_cache_size;\n\n \/\/\/ @brief The size, in bytes, of the buffer for temporary containers allocation.\n std::size_t sdd_arena_size;\n\n \/\/\/ @brief The initial size of the hash table that stores homomorphisms.\n std::size_t hom_unique_table_size;\n\n \/\/\/ @brief The size of the cache of homomorphism applications.\n std::size_t hom_cache_size;\n\n \/\/\/ @brief Tell if FPU registers shoud be preserved when using Expressions.\n static constexpr bool expression_preserve_fpu_registers = false;\n\n \/\/\/ @brief Tell if the library should clean all memory when the manager is destroyed.\n \/\/\/\n \/\/\/ Useful if you have only one instance of the library and that you don't want to wait for its\n \/\/\/ cleanup at your program's exit.\n bool final_cleanup;\n\n \/\/\/ @brief Default constructor.\n \/\/\/\n \/\/\/ Initialize all parameters to their default values.\n default_configuration()\n : sdd_unique_table_size(10000000)\n , sdd_difference_cache_size(500000)\n , sdd_intersection_cache_size(500000)\n , sdd_sum_cache_size(1000000)\n , sdd_arena_size(1024*1024*16)\n , hom_unique_table_size(1000000)\n , hom_cache_size(1000000)\n , final_cleanup(true)\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct flat_set_default_configuration\n : public default_configuration\n{\n \/\/\/ @brief The size of the hash table that stores flat_set<>.\n std::size_t flat_set_unique_table_size;\n\n flat_set_default_configuration()\n : default_configuration()\n , flat_set_unique_table_size(5000)\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf0\n : public default_configuration\n{\n using Identifier = std::string;\n using Values = values::bitset<64>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf1\n : public flat_set_default_configuration\n{\n using Identifier = std::string;\n using Values = values::flat_set<unsigned int>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct conf2\n : public flat_set_default_configuration\n{\n using Identifier = unsigned int;\n using Values = values::flat_set<unsigned int>;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace sdd\n\n#endif \/\/ _SDD_CONF_DEFAULT_CONFIGURATIONS_HH_\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h>\n#include <sensor_msgs\/Imu.h>\n\nint main(int argc, char **argv) {\n \/\/ Initialize ROS\n ros::init(argc, argv, \"test_imu\");\n ros::NodeHandle nh;\n\n \/\/ Create a publisher object\n ros::Publisher imuPub = nh.advertise<sensor_msgs::Imu>(\"imu\/data\",1);\n \/\/ Create an Imu message object\n sensor_msgs::Imu imuMsg;\n imuMsg.header.frame_id = \"base_imu\";\n \/\/ Create variables for yaw rate\n double yawRate = 0;\n imuMsg.header.stamp = ros::Time::now();\n imuMsg.angular_velocity.z = yawRate;\n imuPub.publish(imuMsg);\n\n ros::Rate loop_rate(30);\n while (ros::ok())\n {\n yawRate = 0;\n imuMsg.header.stamp = ros::Time::now();\n imuMsg.angular_velocity.z = yawRate;\n imuPub.publish(imuMsg);\n loop_rate.sleep();\n }\n return 0;\n}\n<commit_msg>Use paramter to set yaw rate.<commit_after>#include <ros\/ros.h>\n#include <sensor_msgs\/Imu.h>\n\nint main(int argc, char **argv) {\n \/\/ Initialize ROS\n ros::init(argc, argv, \"test_imu\");\n ros::NodeHandle nh;\n\n ros::NodeHandle private_nh(\"~\");\n \/\/ Create variables for yaw rate\n double yawRate;\n if(!private_nh.getParam(\"rate\", yawRate)) {\n yawRate = 0;\n ROS_WARN_STREAM(\"No rate was recieved. Using 0.0\");\n }\n else {\n ROS_WARN_STREAM(\"Rate is \" << yawRate);\n }\n\n \/\/ Create a publisher object\n ros::Publisher imuPub = nh.advertise<sensor_msgs::Imu>(\"imu\/data\",1);\n \/\/ Create an Imu message object\n sensor_msgs::Imu imuMsg;\n imuMsg.header.frame_id = \"base_imu\";\n imuMsg.header.stamp = ros::Time::now();\n imuMsg.angular_velocity.z = yawRate;\n imuPub.publish(imuMsg);\n\n ros::Rate loop_rate(30);\n while (ros::ok())\n {\n imuMsg.header.stamp = ros::Time::now();\n imuMsg.angular_velocity.z = yawRate;\n imuPub.publish(imuMsg);\n loop_rate.sleep();\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdint.h>\n#include <pthread.h>\n\nstatic int32_t *low_32_bits(int64_t *ptr)\n{\n\tint32_t *low= (int32_t*)ptr;\n\t\/\/ Test if the machine is big endian - constant propagation at compile time\n\t\/\/ should eliminate this completely.\n\tint one = 1;\n\tif (*(char*)&one != 1)\n\t{\n\t\tlow++;\n\t}\n\treturn low;\n}\n\nextern \"C\" int __cxa_guard_acquire(int64_t *guard_object)\n{\n\tchar first_byte = (*guard_object) >> 56;\n\tif (1 == first_byte) { return 0; }\n\tint32_t *lock = low_32_bits(guard_object);\n\twhile (!__sync_bool_compare_and_swap_4(lock, 0, 1))\n\t{\n\t\t\/\/ TODO: Use some of the remaining 24 bits to define a mutex to sleep\n\t\t\/\/ on. Whether this is actually worth bothering with depends on\n\t\t\/\/ whether there is likely to be any contention.\n\t\tsched_yield();\n\t}\n\treturn 1;\n}\n\nextern \"C\" void __cxa_guard_abort(int64_t *guard_object)\n{\n\tint32_t *lock = low_32_bits(guard_object);\n\t*lock = 0;\n}\nextern \"C\" void __cxa_guard_release(int64_t *guard_object)\n{\n\t\/\/ Set the first byte to 1\n\t*guard_object |= ((int64_t)1) << 57;\n\t__cxa_guard_abort(guard_object);\n}\n\n\n<commit_msg>Fix in __cxa_guard_release<commit_after>#include <stdint.h>\n#include <pthread.h>\n\nstatic int32_t *low_32_bits(int64_t *ptr)\n{\n\tint32_t *low= (int32_t*)ptr;\n\t\/\/ Test if the machine is big endian - constant propagation at compile time\n\t\/\/ should eliminate this completely.\n\tint one = 1;\n\tif (*(char*)&one != 1)\n\t{\n\t\tlow++;\n\t}\n\treturn low;\n}\n\nextern \"C\" int __cxa_guard_acquire(int64_t *guard_object)\n{\n\tchar first_byte = (*guard_object) >> 56;\n\tif (1 == first_byte) { return 0; }\n\tint32_t *lock = low_32_bits(guard_object);\n\twhile (!__sync_bool_compare_and_swap_4(lock, 0, 1))\n\t{\n\t\t\/\/ TODO: Use some of the remaining 24 bits to define a mutex to sleep\n\t\t\/\/ on. Whether this is actually worth bothering with depends on\n\t\t\/\/ whether there is likely to be any contention.\n\t\tsched_yield();\n\t}\n\treturn 1;\n}\n\nextern \"C\" void __cxa_guard_abort(int64_t *guard_object)\n{\n\tint32_t *lock = low_32_bits(guard_object);\n\t*lock = 0;\n}\nextern \"C\" void __cxa_guard_release(int64_t *guard_object)\n{\n\t\/\/ Set the first byte to 1\n\t*guard_object |= ((int64_t)1) << 56;\n\t__cxa_guard_abort(guard_object);\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/extensions\/ut_pex.hpp\"\n#include <boost\/thread.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/filesystem\/operations.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing boost::filesystem::remove_all;\n\nvoid test_pex()\n{\n\tusing namespace libtorrent;\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48200, 49000));\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49200, 50000));\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50200, 51000));\n\n\t\/\/ this is to avoid everything finish from a single peer\n\t\/\/ immediately. To make the swarm actually connect all\n\t\/\/ three peers before finishing.\n\tfloat rate_limit = 500000;\n\tses1.set_upload_rate_limit(int(rate_limit));\n\tses2.set_download_rate_limit(int(rate_limit));\n\tses3.set_download_rate_limit(int(rate_limit));\n\t\/\/ make the peer connecting the two worthless to transfer\n\t\/\/ data, to force peer 3 to connect directly to peer 1 through pex\n\tses2.set_upload_rate_limit(200);\n\tses3.set_upload_rate_limit(int(rate_limit \/ 2));\n\n\tses1.add_extension(&create_ut_pex_plugin);\n\tses2.add_extension(&create_ut_pex_plugin);\n\n\tsession_settings settings;\n\tsettings.allow_multiple_connections_per_ip = true;\n\tsettings.ignore_limits_on_local_network = false;\n\tses1.set_settings(settings);\n\tses2.set_settings(settings);\n\tses3.set_settings(settings);\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\tpe_settings pes;\n\tpes.out_enc_policy = pe_settings::forced;\n\tpes.in_enc_policy = pe_settings::forced;\n\tses1.set_pe_settings(pes);\n\tses2.set_pe_settings(pes);\n\tses3.set_pe_settings(pes);\n#endif\n\n\ttorrent_handle tor1;\n\ttorrent_handle tor2;\n\ttorrent_handle tor3;\n\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true, false, false, \"_pex\");\n\n\ttest_sleep(1000);\n\n\ttor2.connect_peer(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\ttor2.connect_peer(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses3.listen_port()));\n\n\tfor (int i = 0; i < 40; ++i)\n\t{\n\t\tprint_alerts(ses1, \"ses1\");\n\t\tprint_alerts(ses2, \"ses2\");\n\t\tprint_alerts(ses3, \"ses3\");\n\n\t\ttorrent_status st1 = tor1.status();\n\t\ttorrent_status st2 = tor2.status();\n\t\ttorrent_status st3 = tor3.status();\n\n\t\tstd::cerr\n\t\t\t<< \"\\033[33m\" << int(st1.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< st1.num_peers << \": \"\n\t\t\t<< \"\\033[32m\" << int(st2.download_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[31m\" << int(st2.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[0m\" << int(st2.progress * 100) << \"% \"\n\t\t\t<< st2.num_peers << \" - \"\n\t\t\t<< \"\\033[32m\" << int(st3.download_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[31m\" << int(st3.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[0m\" << int(st3.progress * 100) << \"% \"\n\t\t\t<< st3.num_peers\n\t\t\t<< std::endl;\n\n\t\ttest_sleep(1000);\n\t}\n\n\tTEST_CHECK(tor2.is_seed());\n\tTEST_CHECK(tor3.is_seed());\n\n\tif (!tor2.is_seed() && tor3.is_seed()) std::cerr << \"done\\n\";\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\t\/\/ in case the previous run was terminated\n\ttry { remove_all(\".\/tmp1_pex\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp2_pex\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp3_pex\"); } catch (std::exception&) {}\n\n\ttest_pex();\n\t\n\tremove_all(\".\/tmp1_pex\");\n\tremove_all(\".\/tmp2_pex\");\n\tremove_all(\".\/tmp3_pex\");\n\n\treturn 0;\n}\n\n<commit_msg>fixed pex test<commit_after>#include \"libtorrent\/session.hpp\"\n#include \"libtorrent\/session_settings.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/extensions\/ut_pex.hpp\"\n#include <boost\/thread.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/filesystem\/operations.hpp>\n\n#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n\nusing boost::filesystem::remove_all;\n\nvoid test_pex()\n{\n\tusing namespace libtorrent;\n\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48200, 49000));\n\tsession ses2(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(49200, 50000));\n\tsession ses3(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(50200, 51000));\n\n\t\/\/ this is to avoid everything finish from a single peer\n\t\/\/ immediately. To make the swarm actually connect all\n\t\/\/ three peers before finishing.\n\tfloat rate_limit = 500000;\n\tses1.set_upload_rate_limit(int(rate_limit));\n\tses2.set_download_rate_limit(int(rate_limit));\n\tses3.set_download_rate_limit(int(rate_limit));\n\t\/\/ make the peer connecting the two worthless to transfer\n\t\/\/ data, to force peer 3 to connect directly to peer 1 through pex\n\tses2.set_upload_rate_limit(200);\n\tses3.set_upload_rate_limit(int(rate_limit \/ 2));\n\n\tses1.add_extension(&create_ut_pex_plugin);\n\tses2.add_extension(&create_ut_pex_plugin);\n\n\tsession_settings settings;\n\tsettings.allow_multiple_connections_per_ip = true;\n\tsettings.ignore_limits_on_local_network = false;\n\tses1.set_settings(settings);\n\tses2.set_settings(settings);\n\tses3.set_settings(settings);\n\n#ifndef TORRENT_DISABLE_ENCRYPTION\n\tpe_settings pes;\n\tpes.out_enc_policy = pe_settings::forced;\n\tpes.in_enc_policy = pe_settings::forced;\n\tses1.set_pe_settings(pes);\n\tses2.set_pe_settings(pes);\n\tses3.set_pe_settings(pes);\n#endif\n\n\ttorrent_handle tor1;\n\ttorrent_handle tor2;\n\ttorrent_handle tor3;\n\n\tboost::tie(tor1, tor2, tor3) = setup_transfer(&ses1, &ses2, &ses3, true, false, false, \"_pex\");\n\n\ttest_sleep(1000);\n\n\ttor2.connect_peer(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\ttor2.connect_peer(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses3.listen_port()));\n\n\tfor (int i = 0; i < 40; ++i)\n\t{\n\t\tprint_alerts(ses1, \"ses1\");\n\t\tprint_alerts(ses2, \"ses2\");\n\t\tprint_alerts(ses3, \"ses3\");\n\n\t\ttorrent_status st1 = tor1.status();\n\t\ttorrent_status st2 = tor2.status();\n\t\ttorrent_status st3 = tor3.status();\n\n\t\tstd::cerr\n\t\t\t<< \"\\033[33m\" << int(st1.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< st1.num_peers << \": \"\n\t\t\t<< \"\\033[32m\" << int(st2.download_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[31m\" << int(st2.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[0m\" << int(st2.progress * 100) << \"% \"\n\t\t\t<< st2.num_peers << \" - \"\n\t\t\t<< \"\\033[32m\" << int(st3.download_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[31m\" << int(st3.upload_payload_rate \/ 1000.f) << \"kB\/s \"\n\t\t\t<< \"\\033[0m\" << int(st3.progress * 100) << \"% \"\n\t\t\t<< st3.num_peers\n\t\t\t<< std::endl;\n\n\t\tif (st3.state == torrent_status::seeding) break;\n\t\ttest_sleep(1000);\n\t}\n\n\tTEST_CHECK(tor3.is_seed());\n\n\tif (!tor2.is_seed() && tor3.is_seed()) std::cerr << \"done\\n\";\n}\n\nint test_main()\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\t\/\/ in case the previous run was terminated\n\ttry { remove_all(\".\/tmp1_pex\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp2_pex\"); } catch (std::exception&) {}\n\ttry { remove_all(\".\/tmp3_pex\"); } catch (std::exception&) {}\n\n\ttest_pex();\n\t\n\tremove_all(\".\/tmp1_pex\");\n\tremove_all(\".\/tmp2_pex\");\n\tremove_all(\".\/tmp3_pex\");\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include \"evpp\/exp.h\"\n#include \".\/test_common.h\"\n#include \"evpp\/duration.h\"\n#include \"evpp\/timestamp.h\"\n\nTEST_UNIT(testDuration) {\n evpp::Duration d0(0);\n evpp::Duration d1(1);\n evpp::Duration d2(2);\n evpp::Duration d3(2);\n H_TEST_ASSERT(d0 < d1);\n H_TEST_ASSERT(d1 < d2);\n H_TEST_ASSERT(d2 == d3);\n H_TEST_ASSERT(d0.IsZero());\n H_TEST_ASSERT(d0 <= d1);\n H_TEST_ASSERT(d1 <= d2);\n H_TEST_ASSERT(d2 <= d3);\n H_TEST_ASSERT(d2 >= d3);\n H_TEST_ASSERT(d1 > d0);\n H_TEST_ASSERT(d2 > d1);\n H_TEST_ASSERT(d1 >= d0);\n H_TEST_ASSERT(d2 >= d1);\n}\n\nTEST_UNIT(testTimestamp) {\n}\n\n<commit_msg>Add Timestamp test code<commit_after>\n#include \"evpp\/exp.h\"\n#include \".\/test_common.h\"\n#include \"evpp\/duration.h\"\n#include \"evpp\/timestamp.h\"\n\nTEST_UNIT(testDuration) {\n evpp::Duration d0(0);\n evpp::Duration d1(1);\n evpp::Duration d2(2);\n evpp::Duration d3(2);\n H_TEST_ASSERT(d0 < d1);\n H_TEST_ASSERT(d1 < d2);\n H_TEST_ASSERT(d2 == d3);\n H_TEST_ASSERT(d0.IsZero());\n H_TEST_ASSERT(d0 <= d1);\n H_TEST_ASSERT(d1 <= d2);\n H_TEST_ASSERT(d2 <= d3);\n H_TEST_ASSERT(d2 >= d3);\n H_TEST_ASSERT(d1 > d0);\n H_TEST_ASSERT(d2 > d1);\n H_TEST_ASSERT(d1 >= d0);\n H_TEST_ASSERT(d2 >= d1);\n}\n\nTEST_UNIT(testTimestamp) {\n int64_t c_s = time(NULL);\n int64_t c_us = evpp::utcmicrosecond();\n int64_t ts_ns = evpp::Timestamp::Now().UnixNano();\n int64_t c11_us = std::chrono::duration_cast<std::chrono::microseconds>(std::chrono::system_clock::now().time_since_epoch()).count();\n H_TEST_ASSERT(c_us\/1000000 == c11_us\/1000000);\n H_TEST_ASSERT(c_s == c11_us\/1000000);\n H_TEST_ASSERT(c_s == ts_ns\/evpp::Duration::kSecond);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: animationsetnode.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 20:42:11 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SLIDESHOW_ANIMATIONSETNODE_HXX\n#define _SLIDESHOW_ANIMATIONSETNODE_HXX\n\n#include <activityanimationbasenode.hxx>\n\nnamespace presentation\n{\n namespace internal\n {\n class AnimationSetNode : public ActivityAnimationBaseNode\n {\n public:\n AnimationSetNode( const ::com::sun::star::uno::Reference<\n ::com::sun::star::animations::XAnimationNode >& xNode,\n const BaseContainerNodeSharedPtr& rParent,\n const NodeContext& rContext );\n\n virtual bool init();\n\n#if defined(VERBOSE) && defined(DBG_UTIL)\n virtual const char* getDescription() const;\n#endif\n\n private:\n void implScheduleDeactivationEvent() const;\n AnimationActivitySharedPtr createSetActivity();\n };\n\n typedef ::boost::shared_ptr< AnimationSetNode > AnimationSetNodeSharedPtr;\n }\n}\n\n#endif \/* _SLIDESHOW_ANIMATIONSETNODE_HXX *\/\n<commit_msg>INTEGRATION: CWS presfixes10 (1.4.8); FILE MERGED 2005\/11\/07 15:26:50 dbo 1.4.8.1: #i45197# revised code Issue number: Submitted by: Reviewed by:<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: animationsetnode.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2006-07-26 07:32:46 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef INCLUDED_SLIDESHOW_ANIMATIONSETNODE_HXX\n#define INCLUDED_SLIDESHOW_ANIMATIONSETNODE_HXX\n\n#include \"animationbasenode.hxx\"\n\nnamespace presentation {\nnamespace internal {\n\nclass AnimationSetNode : public AnimationBaseNode\n{\npublic:\n AnimationSetNode(\n ::com::sun::star::uno::Reference<\n ::com::sun::star::animations::XAnimationNode> const& xNode,\n ::boost::shared_ptr<BaseContainerNode> const& pParent,\n NodeContext const& rContext )\n : AnimationBaseNode( xNode, pParent, rContext ) {}\n\n#if defined(VERBOSE) && defined(DBG_UTIL)\n virtual const char* getDescription() const { return \"AnimationSetNode\"; }\n#endif\n\nprivate:\n virtual AnimationActivitySharedPtr createActivity() const;\n void implScheduleDeactivationEvent();\n};\n\n} \/\/ namespace internal\n} \/\/ namespace presentation\n\n#endif \/* INCLUDED_SLIDESHOW_ANIMATIONSETNODE_HXX *\/\n\n<|endoftext|>"} {"text":"<commit_before>\n\n#include \"miopen.hpp\"\n#include \"tensor.hpp\"\n#include \"utils.hpp\"\n#include \"layers.hpp\"\n#include \"multi_layers.hpp\"\n\n\nvoid benchmark_convlayers() {\n \/\/ batch_size, w, h, channels_in, channels_out, kernel_size, padding, stride\n \/\/ Layerwise benchmark L1-L5: https:\/\/github.com\/soumith\/convnet-benchmarks\n std::vector<ConvLayerDesc> runs = {{128, 13, 13, 384, 384, 3, 0, 1},\n {128, 16, 16, 128, 128, 7, 0, 1},\n {128, 32, 32, 128, 128, 9, 0, 1},\n {128, 64, 64, 64, 128, 9, 0, 1},\n {128, 128, 128, 3, 96, 11, 0, 1}};\n\n\n \/*\n std::vector<ConvLayerDesc> runs = {{128, 64, 64, 64, 128, 3, 1, 1}};\n {128, 64, 64, 64, 128, 3, 0, 1},\n {128, 28, 28, 64, 64, 5, 1, 2}};\n *\/\n\n\n int layer = 5;\n int reps = 50;\n BenchmarkLogger::new_session(\"conv_layers\");\n for (ConvLayerDesc& l : runs) {\n std::stringstream ss;\n ss << \"Layer L\" << layer;\n TensorDesc input_dim(l.batch_size, l.channels_in, l.height, l.width);\n Model m(input_dim, ss.str());\n m.emplace<ConvLayer>(l.channels_out, l.kernel_size, l.padding, l.stride);\n\n BenchmarkLogger::benchmark(m, reps);\n\n --layer;\n }\n}\n\nint main(int argc, char *argv[])\n{\n device_init();\n CHECK_MIO(miopenEnableProfiling(mio::handle(), true));\n\n benchmark_convlayers();\n}\n<commit_msg>randomly init layerwise benchmark<commit_after>\n\n#include \"miopen.hpp\"\n#include \"tensor.hpp\"\n#include \"utils.hpp\"\n#include \"layers.hpp\"\n#include \"multi_layers.hpp\"\n\n\nvoid benchmark_convlayers() {\n \/\/ batch_size, w, h, channels_in, channels_out, kernel_size, padding, stride\n \/\/ Layerwise benchmark L1-L5: https:\/\/github.com\/soumith\/convnet-benchmarks\n std::vector<ConvLayerDesc> runs = {{128, 13, 13, 384, 384, 3, 0, 1},\n {128, 16, 16, 128, 128, 7, 0, 1},\n {128, 32, 32, 128, 128, 9, 0, 1},\n {128, 64, 64, 64, 128, 9, 0, 1},\n {128, 128, 128, 3, 96, 11, 0, 1}};\n\n\n \/*\n std::vector<ConvLayerDesc> runs = {{128, 64, 64, 64, 128, 3, 1, 1}};\n {128, 64, 64, 64, 128, 3, 0, 1},\n {128, 28, 28, 64, 64, 5, 1, 2}};\n *\/\n\n\n int layer = 5;\n int reps = 50;\n BenchmarkLogger::new_session(\"conv_layers\");\n for (ConvLayerDesc& l : runs) {\n std::stringstream ss;\n ss << \"Layer L\" << layer;\n TensorDesc input_dim(l.batch_size, l.channels_in, l.height, l.width);\n Model m(input_dim, ss.str());\n m.emplace<ConvLayer>(l.channels_out, l.kernel_size, l.padding, l.stride);\n\n m.input.uniform(); \/\/ randomly initialize input\n BenchmarkLogger::benchmark(m, reps);\n\n --layer;\n }\n}\n\nint main(int argc, char *argv[])\n{\n device_init();\n CHECK_MIO(miopenEnableProfiling(mio::handle(), true));\n\n benchmark_convlayers();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * SpawnAreaMap.cpp\r\n *\r\n * Created on: 12\/08\/2011\r\n * Author: TheAnswer\r\n *\/\r\n\r\n#include \"SpawnAreaMap.h\"\r\n#include \"server\/zone\/Zone.h\"\r\n#include \"server\/zone\/managers\/creature\/CreatureManager.h\"\r\n#include \"server\/zone\/objects\/creature\/AiAgent.h\"\r\n#include \"server\/conf\/ConfigManager.h\"\r\n#include \"server\/zone\/objects\/area\/areashapes\/CircularAreaShape.h\"\r\n\r\nvoid SpawnAreaMap::loadMap(Zone* z) {\r\n\tzone = z;\r\n\tString planetName = zone->getZoneName();\r\n\r\n\tsetLoggingName(\"SpawnAreaMap \" + planetName);\r\n\r\n\tlua->init();\r\n\r\n\ttry {\r\n\t\tlua->runFile(\"scripts\/managers\/spawn_manager\/\" + planetName + \".lua\");\r\n\r\n\t\tLuaObject obj = lua->getGlobalObject(planetName + \"_regions\");\r\n\r\n\t\tif (obj.isValidTable()) {\r\n\t\t\tlua_State* s = obj.getLuaState();\r\n\r\n\t\t\tfor (int i = 1; i <= obj.getTableSize(); ++i) {\r\n\t\t\t\tlua_rawgeti(s, -1, i);\r\n\t\t\t\tLuaObject areaObj(s);\r\n\r\n\t\t\t\tif (areaObj.isValidTable()) {\r\n\t\t\t\t\treadAreaObject(areaObj);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tareaObj.pop();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tobj.pop();\r\n\r\n\t\tfor (int i = 0; i < size(); ++i) {\r\n\t\t\tSpawnArea* area = get(i);\r\n\r\n\t\t\tfor (int j = 0; j < noSpawnAreas.size(); ++j) {\r\n\t\t\t\tSpawnArea* notHere = noSpawnAreas.get(j);\r\n\r\n\t\t\t\tif (area->intersectsWith(notHere)) {\r\n\t\t\t\t\tarea->addNoSpawnArea(notHere);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tloadStaticSpawns();\r\n\t} catch (Exception& e) {\r\n\t\terror(e.getMessage());\r\n\t}\r\n\r\n\tlua->deinit();\r\n\r\n\tdelete lua;\r\n\tlua = NULL;\r\n}\r\n\r\nvoid SpawnAreaMap::loadStaticSpawns() {\r\n\tString planetName = zone->getZoneName();\r\n\r\n\tLuaObject obj = lua->getGlobalObject(planetName + \"_static_spawns\");\r\n\r\n\tif (!obj.isValidTable()) {\r\n\t\tobj.pop();\r\n\t\treturn;\r\n\t}\r\n\r\n\tint count = 0;\r\n\tint max = obj.getTableSize();\r\n\r\n\tfor (int i = 1; i <= obj.getTableSize(); ++i) {\r\n\t\tlua_rawgeti(obj.getLuaState(), -1, i);\r\n\t\tLuaObject spawn(obj.getLuaState());\r\n\r\n\t\tif (spawn.isValidTable()) {\r\n\t\t\tCreatureManager* creatureManager = zone->getCreatureManager();\r\n\r\n\t\t\tString name = obj.getStringAt(1);\r\n\t\t\tuint32 respawn = obj.getIntAt(2);\r\n\t\t\tfloat x = obj.getFloatAt(3);\r\n\t\t\tfloat z = obj.getFloatAt(4);\r\n\t\t\tfloat y = obj.getFloatAt(5);\r\n\t\t\tfloat heading = obj.getFloatAt(6);\r\n\t\t\tuint64 parentID = obj.getLongAt(7);\r\n\t\t\tString moodString;\r\n\t\t\tUnicodeString customName;\r\n\r\n\t\t\tif (obj.getTableSize() > 7)\r\n\t\t\t\tmoodString = obj.getStringAt(8);\r\n\r\n\t\t\tif (obj.getTableSize() > 8)\r\n\t\t\t\tcustomName = obj.getStringAt(9);\r\n\r\n\t\t\tif (parentID == 0)\r\n\t\t\t\tz = zone->getHeight(x, y);\r\n\r\n\t\t\tManagedReference<CreatureObject*> creatureObject = creatureManager->spawnCreature(name.hashCode(), 0, x, z, y, parentID);\r\n\r\n\t\t\tif (creatureObject != NULL) {\r\n\t\t\t\tcreatureObject->setDirection(Math::deg2rad(heading));\r\n\r\n\t\t\t\tif (!moodString.isEmpty()) {\r\n\t\t\t\t\tcreatureObject->setMoodString(moodString);\r\n\r\n\t\t\t\t\t\/\/TODO: remove after fixing commoners\r\n\t\t\t\t\tif (moodString == \"conversation\" || moodString == \"calm\") {\r\n\t\t\t\t\t\tcreatureObject->setPvpStatusBitmask(0);\r\n\t\t\t\t\t\tcreatureObject->setCloseObjects(NULL);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (!customName.isEmpty())\r\n\t\t\t\t\tcreatureObject->setCustomObjectName(customName, true);\r\n\r\n\t\t\t\tif (creatureObject->isAiAgent()) {\r\n\t\t\t\t\tAiAgent* ai = cast<AiAgent*>( creatureObject.get());\r\n\t\t\t\t\tai->setRespawnTimer(respawn);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (name.contains(\"trainer_\")) {\r\n\t\t\t\t\tVector3 coords(creatureObject.get()->getWorldPositionX(), creatureObject.get()->getWorldPositionY(), 0);\r\n\t\t\t\t\ttrainerObjects.add(coords);\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tStringBuffer msg;\r\n\t\t\t\tmsg << \"could not spawn mobile: \" + name;\r\n\t\t\t\terror(msg.toString());\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tspawn.pop();\r\n\r\n\t\tif (ConfigManager::instance()->isProgressMonitorActivated())\r\n\t\t\tprintf(\"\\r\\tLoading static spawns: [%d] \/ [%d]\\t\", ++count, max);\r\n\t}\r\n\r\n\tobj.pop();\r\n\r\n\r\n\t\/\/--{\"mobile\", x, z, y, degrees heading, parentID}\r\n\r\n\r\n\r\n\t\/\/spawnCreature(uint32 templateCRC, uint32 objectCRC, float x, float z, float y, uint64 parentID)\r\n}\r\n\r\nvoid SpawnAreaMap::readAreaObject(LuaObject& areaObj) {\r\n\tString name = areaObj.getStringAt(1);\r\n\tfloat x = areaObj.getFloatAt(2);\r\n\tfloat y = areaObj.getFloatAt(3);\r\n\tfloat radius = areaObj.getFloatAt(4);\r\n\tint tier = areaObj.getIntAt(5);\r\n\tint constant = areaObj.getIntAt(6);\r\n\r\n\tif (radius == 0)\r\n\t\treturn;\r\n\r\n\tuint32 crc = 0;\r\n\tswitch (tier) {\r\n\tcase 0:\r\n\tcase 1:\r\n\t\tcrc = String(\"object\/static_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tcrc = String(\"object\/dynamic_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tcase 3:\r\n\tcase 4:\r\n\tcase 5:\r\n\tcase 6:\r\n\t\tcrc = String(\"object\/lair_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tdefault:\r\n\t\terror(\"unknown tier \" + String::valueOf(tier));\r\n\t\tcrc = String(\"object\/dynamic_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\t}\r\n\r\n\tManagedReference<SpawnArea*> area = dynamic_cast<SpawnArea*>(ObjectManager::instance()->createObject(crc, 0, \"spawnareas\"));\r\n\tif (area == NULL)\r\n\t\treturn;\r\n\r\n\tStringId nameID(zone->getZoneName() + \"_region_names\", name);\r\n\r\n\tarea->setObjectName(nameID);\r\n\r\n\tManagedReference<CircularAreaShape*> circularAreaShape = new CircularAreaShape();\r\n\tcircularAreaShape->setAreaCenter(x, y);\r\n\tcircularAreaShape->setRadius(radius);\r\n\tarea->setAreaShape(circularAreaShape);\r\n\r\n\tarea->setTier(tier);\r\n\r\n\tarea->setSpawnConstant(constant);\r\n\r\n\tfor (int j = 7; j <= areaObj.getTableSize(); ++j)\r\n\t\tarea->addTemplate(areaObj.getStringAt(j).hashCode());\r\n\r\n\tif (radius != -1)\r\n\t\tzone->transferObject(area, -1, true);\r\n\telse {\r\n\t\tcircularAreaShape->setRadius(zone->getBoundingRadius());\r\n\r\n\t\tswitch (tier) {\r\n\t\tcase 4:\r\n\t\t\tfactionalNeutralMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tcase 5:\r\n\t\t\tfactionalRebelMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tcase 6:\r\n\t\t\tfactionalImperialMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tworldSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\r\n\t\tarea->setZone(zone);\r\n\t}\r\n\r\n\tarea->updateToDatabase();\r\n\r\n\tput(nameID.getStringID().hashCode(), area);\r\n\r\n\tif (area->isStaticArea()) {\r\n\t\tnoSpawnAreas.add(area);\r\n\t\tif (tier == 1) {\r\n\t\t\tStaticSpawnArea* staticArea = cast<StaticSpawnArea*>(area.get());\r\n\t\t\tstaticArea->spawnCreatures();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nVector3 SpawnAreaMap::getRandomJediTrainer() {\r\n\tuint32 size = trainerObjects.size();\r\n\treturn trainerObjects.get(System::random(size - 1));\r\n}\r\n<commit_msg>(unstable) [updated] Spawn area map to support reading in both circular and rectangular area shapes from lua files.<commit_after>\/*\r\n * SpawnAreaMap.cpp\r\n *\r\n * Created on: 12\/08\/2011\r\n * Author: TheAnswer\r\n *\/\r\n\r\n#include \"SpawnAreaMap.h\"\r\n#include \"server\/zone\/Zone.h\"\r\n#include \"server\/zone\/managers\/creature\/CreatureManager.h\"\r\n#include \"server\/zone\/objects\/creature\/AiAgent.h\"\r\n#include \"server\/conf\/ConfigManager.h\"\r\n#include \"server\/zone\/objects\/area\/areashapes\/CircularAreaShape.h\"\r\n#include \"server\/zone\/objects\/area\/areashapes\/RectangularAreaShape.h\"\r\n\r\nvoid SpawnAreaMap::loadMap(Zone* z) {\r\n\tzone = z;\r\n\tString planetName = zone->getZoneName();\r\n\r\n\tsetLoggingName(\"SpawnAreaMap \" + planetName);\r\n\r\n\tlua->init();\r\n\r\n\ttry {\r\n\t\tlua->runFile(\"scripts\/managers\/spawn_manager\/\" + planetName + \".lua\");\r\n\r\n\t\tLuaObject obj = lua->getGlobalObject(planetName + \"_regions\");\r\n\r\n\t\tif (obj.isValidTable()) {\r\n\t\t\tlua_State* s = obj.getLuaState();\r\n\r\n\t\t\tfor (int i = 1; i <= obj.getTableSize(); ++i) {\r\n\t\t\t\tlua_rawgeti(s, -1, i);\r\n\t\t\t\tLuaObject areaObj(s);\r\n\r\n\t\t\t\tif (areaObj.isValidTable()) {\r\n\t\t\t\t\treadAreaObject(areaObj);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tareaObj.pop();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tobj.pop();\r\n\r\n\t\tfor (int i = 0; i < size(); ++i) {\r\n\t\t\tSpawnArea* area = get(i);\r\n\r\n\t\t\tfor (int j = 0; j < noSpawnAreas.size(); ++j) {\r\n\t\t\t\tSpawnArea* notHere = noSpawnAreas.get(j);\r\n\r\n\t\t\t\tif (area->intersectsWith(notHere)) {\r\n\t\t\t\t\tarea->addNoSpawnArea(notHere);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tloadStaticSpawns();\r\n\t} catch (Exception& e) {\r\n\t\terror(e.getMessage());\r\n\t}\r\n\r\n\tlua->deinit();\r\n\r\n\tdelete lua;\r\n\tlua = NULL;\r\n}\r\n\r\nvoid SpawnAreaMap::loadStaticSpawns() {\r\n\tString planetName = zone->getZoneName();\r\n\r\n\tLuaObject obj = lua->getGlobalObject(planetName + \"_static_spawns\");\r\n\r\n\tif (!obj.isValidTable()) {\r\n\t\tobj.pop();\r\n\t\treturn;\r\n\t}\r\n\r\n\tint count = 0;\r\n\tint max = obj.getTableSize();\r\n\r\n\tfor (int i = 1; i <= obj.getTableSize(); ++i) {\r\n\t\tlua_rawgeti(obj.getLuaState(), -1, i);\r\n\t\tLuaObject spawn(obj.getLuaState());\r\n\r\n\t\tif (spawn.isValidTable()) {\r\n\t\t\tCreatureManager* creatureManager = zone->getCreatureManager();\r\n\r\n\t\t\tString name = obj.getStringAt(1);\r\n\t\t\tuint32 respawn = obj.getIntAt(2);\r\n\t\t\tfloat x = obj.getFloatAt(3);\r\n\t\t\tfloat z = obj.getFloatAt(4);\r\n\t\t\tfloat y = obj.getFloatAt(5);\r\n\t\t\tfloat heading = obj.getFloatAt(6);\r\n\t\t\tuint64 parentID = obj.getLongAt(7);\r\n\t\t\tString moodString;\r\n\t\t\tUnicodeString customName;\r\n\r\n\t\t\tif (obj.getTableSize() > 7)\r\n\t\t\t\tmoodString = obj.getStringAt(8);\r\n\r\n\t\t\tif (obj.getTableSize() > 8)\r\n\t\t\t\tcustomName = obj.getStringAt(9);\r\n\r\n\t\t\tif (parentID == 0)\r\n\t\t\t\tz = zone->getHeight(x, y);\r\n\r\n\t\t\tManagedReference<CreatureObject*> creatureObject = creatureManager->spawnCreature(name.hashCode(), 0, x, z, y, parentID);\r\n\r\n\t\t\tif (creatureObject != NULL) {\r\n\t\t\t\tcreatureObject->setDirection(Math::deg2rad(heading));\r\n\r\n\t\t\t\tif (!moodString.isEmpty()) {\r\n\t\t\t\t\tcreatureObject->setMoodString(moodString);\r\n\r\n\t\t\t\t\t\/\/TODO: remove after fixing commoners\r\n\t\t\t\t\tif (moodString == \"conversation\" || moodString == \"calm\") {\r\n\t\t\t\t\t\tcreatureObject->setPvpStatusBitmask(0);\r\n\t\t\t\t\t\tcreatureObject->setCloseObjects(NULL);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (!customName.isEmpty())\r\n\t\t\t\t\tcreatureObject->setCustomObjectName(customName, true);\r\n\r\n\t\t\t\tif (creatureObject->isAiAgent()) {\r\n\t\t\t\t\tAiAgent* ai = cast<AiAgent*>( creatureObject.get());\r\n\t\t\t\t\tai->setRespawnTimer(respawn);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (name.contains(\"trainer_\")) {\r\n\t\t\t\t\tVector3 coords(creatureObject.get()->getWorldPositionX(), creatureObject.get()->getWorldPositionY(), 0);\r\n\t\t\t\t\ttrainerObjects.add(coords);\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tStringBuffer msg;\r\n\t\t\t\tmsg << \"could not spawn mobile: \" + name;\r\n\t\t\t\terror(msg.toString());\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tspawn.pop();\r\n\r\n\t\tif (ConfigManager::instance()->isProgressMonitorActivated())\r\n\t\t\tprintf(\"\\r\\tLoading static spawns: [%d] \/ [%d]\\t\", ++count, max);\r\n\t}\r\n\r\n\tobj.pop();\r\n\r\n\r\n\t\/\/--{\"mobile\", x, z, y, degrees heading, parentID}\r\n\r\n\r\n\r\n\t\/\/spawnCreature(uint32 templateCRC, uint32 objectCRC, float x, float z, float y, uint64 parentID)\r\n}\r\n\r\nvoid SpawnAreaMap::readAreaObject(LuaObject& areaObj) {\r\n\tString name = areaObj.getStringAt(1);\r\n\tfloat x = areaObj.getFloatAt(2);\r\n\tfloat y = areaObj.getFloatAt(3);\r\n\tint tier = areaObj.getIntAt(5);\r\n\tint constant = areaObj.getIntAt(6);\r\n\r\n\tfloat radius = 0;\r\n\tfloat width = 0;\r\n\tfloat height = 0;\r\n\r\n LuaObject areaShapeObject = areaObj.getObjectAt(4);\r\n if (areaShapeObject.isValidTable()) {\r\n if (areaShapeObject.getIntAt(1) == 1) {\r\n radius = areaShapeObject.getFloatAt(2);\r\n } else if (areaShapeObject.getIntAt(1) == 2) {\r\n width = areaShapeObject.getFloatAt(2);\r\n height = areaShapeObject.getFloatAt(3);\r\n }\r\n areaShapeObject.pop();\r\n } else {\r\n \tareaShapeObject.pop();\r\n radius = areaObj.getFloatAt(4);\r\n width = 0;\r\n height = 0;\r\n }\r\n\r\n\tif (radius == 0 && width == 0 && height == 0)\r\n\t\treturn;\r\n\r\n\tuint32 crc = 0;\r\n\tswitch (tier) {\r\n\tcase 0:\r\n\tcase 1:\r\n\t\tcrc = String(\"object\/static_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tcrc = String(\"object\/dynamic_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tcase 3:\r\n\tcase 4:\r\n\tcase 5:\r\n\tcase 6:\r\n\t\tcrc = String(\"object\/lair_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\tdefault:\r\n\t\terror(\"unknown tier \" + String::valueOf(tier));\r\n\t\tcrc = String(\"object\/dynamic_spawn_area.iff\").hashCode();\r\n\t\tbreak;\r\n\t}\r\n\r\n\tManagedReference<SpawnArea*> area = dynamic_cast<SpawnArea*>(ObjectManager::instance()->createObject(crc, 0, \"spawnareas\"));\r\n\tif (area == NULL)\r\n\t\treturn;\r\n\r\n\tStringId nameID(zone->getZoneName() + \"_region_names\", name);\r\n\r\n\tarea->setObjectName(nameID);\r\n\r\n\tif (height > 0 && width > 0) {\r\n\t\tManagedReference<RectangularAreaShape*> rectangularAreaShape = new RectangularAreaShape();\r\n\t\trectangularAreaShape->setAreaCenter(x, y);\r\n\t\trectangularAreaShape->setDimensions(height, width);\r\n\t\tarea->setAreaShape(rectangularAreaShape);\r\n\t} else if (radius > 0) {\r\n\t\tManagedReference<CircularAreaShape*> circularAreaShape = new CircularAreaShape();\r\n\t\tcircularAreaShape->setAreaCenter(x, y);\r\n\t\tcircularAreaShape->setRadius(radius);\r\n\t\tarea->setAreaShape(circularAreaShape);\r\n\t} else {\r\n\t\treturn;\r\n\t}\r\n\r\n\tarea->setTier(tier);\r\n\r\n\tarea->setSpawnConstant(constant);\r\n\r\n\tfor (int j = 7; j <= areaObj.getTableSize(); ++j)\r\n\t\tarea->addTemplate(areaObj.getStringAt(j).hashCode());\r\n\r\n\tif (radius != -1)\r\n\t\tzone->transferObject(area, -1, true);\r\n\telse {\r\n\t\tswitch (tier) {\r\n\t\tcase 4:\r\n\t\t\tfactionalNeutralMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tcase 5:\r\n\t\t\tfactionalRebelMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tcase 6:\r\n\t\t\tfactionalImperialMissionSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tworldSpawnAreas.add(area);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\r\n\t\tarea->setZone(zone);\r\n\t}\r\n\r\n\tarea->updateToDatabase();\r\n\r\n\tput(nameID.getStringID().hashCode(), area);\r\n\r\n\tif (area->isStaticArea()) {\r\n\t\tnoSpawnAreas.add(area);\r\n\t\tif (tier == 1) {\r\n\t\t\tStaticSpawnArea* staticArea = cast<StaticSpawnArea*>(area.get());\r\n\t\t\tstaticArea->spawnCreatures();\r\n\t\t}\r\n\t}\r\n}\r\n\r\nVector3 SpawnAreaMap::getRandomJediTrainer() {\r\n\tuint32 size = trainerObjects.size();\r\n\treturn trainerObjects.get(System::random(size - 1));\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <allegro.h>\n#ifdef WINDOWS\n#include <winalleg.h>\n#endif\n\n#include \"init.h\"\n#include <pthread.h>\n\n#include <iostream>\n#include <dumb.h>\n#include <aldumb.h>\n#include <loadpng.h>\n#include \"util\/bitmap.h\"\n\nusing namespace std;\n\nvolatile double Global::speed_counter = 0;\nvolatile int Global::second_counter = 0;\n\nstatic const int TICS_PER_SECOND = 90;\n\npthread_mutex_t Global::loading_screen_mutex;\nbool Global::done_loading = false;\n\nconst int Global::WINDOWED = GFX_AUTODETECT_WINDOWED;\nconst int Global::FULLSCREEN = GFX_AUTODETECT_FULLSCREEN;\n\n\/\/ DATAFILE * Global::all_fonts;\n\nvoid inc_speed_counter() {\n\tGlobal::speed_counter += 1.0;\n}\nEND_OF_FUNCTION( inc_speed_counter );\n\nvoid inc_second_counter() {\n\tGlobal::second_counter++;\n}\nEND_OF_FUNCTION( inc_second_counter );\n\nbool init( int gfx ){\n\n\tcout << \"Allegro version: \" << ALLEGRO_VERSION_STR << endl;\n\tcout<<\"Allegro init: \"<<allegro_init()<<endl;\n\tcout<<\"Loadpng init: \"<<loadpng_init()<<endl;\n\tcout<<\"Install timer: \"<<install_timer()<<endl;\n\t\n\tset_volume_per_voice( 0 );\n\tcout<<\"Install sound: \"<<install_sound( DIGI_AUTODETECT, MIDI_NONE, \"\" )<<endl;\n\n\tcout<<\"Install keyboard: \"<<install_keyboard()<<endl;\n\tcout<<\"Install mouse: \"<<install_mouse()<<endl;\n\tloadpng_init();\n\tset_color_depth( 16 );\n\tcout<<\"Set gfx mode: \"<<set_gfx_mode( gfx, GFX_X, GFX_Y, 0, 0 )<<endl;\n\n\tLOCK_VARIABLE( speed_counter );\n\tLOCK_VARIABLE( second_counter );\n\tLOCK_FUNCTION( (void *)inc_speed_counter );\n\tLOCK_FUNCTION( (void *)inc_second_counter );\n\tcout<<\"Install game timer: \"<<install_int_ex( inc_speed_counter, BPS_TO_TIMER( TICS_PER_SECOND ) )<<endl;\n\tcout<<\"Install second timer: \"<<install_int_ex( inc_second_counter, BPS_TO_TIMER( 1 ) )<<endl;\n\tsrand( time( NULL ) );\n\t\/\/ Global::all_fonts = load_datafile( \"data\/fonts.dat\" );\n\t\/*\n\tif ( ! Global::all_fonts ){\n\t\tif ( ! exists( \"data\/fonts.dat\" ) ){\n\t\t\tcout << \"data\/fonts.dat is missing!\" << endl;\n\t\t} else {\n\t\t\tcout << \"data\/fonts.dat is corrupted!\" << endl;\n\t\t}\n\t\treturn false;\n\t}\n\tcout<<\"Loaded fonts \" << endl;\n\t*\/\n\n\tatexit( &dumb_exit );\n\tdumb_register_packfiles();\n\n\tcout<<\"-- END init --\"<<endl;\n\n\tBitmap::Screen = new Bitmap( screen );\n\tif ( ! Bitmap::Screen ){\n\t\treturn false;\n\t}\n\treturn true;\n}\n<commit_msg>set the display mode to background<commit_after>#include <allegro.h>\n#ifdef WINDOWS\n#include <winalleg.h>\n#endif\n\n#include \"init.h\"\n#include <pthread.h>\n\n#include <iostream>\n#include <dumb.h>\n#include <aldumb.h>\n#include <loadpng.h>\n#include \"util\/bitmap.h\"\n\nusing namespace std;\n\nvolatile double Global::speed_counter = 0;\nvolatile int Global::second_counter = 0;\n\nstatic const int TICS_PER_SECOND = 90;\n\npthread_mutex_t Global::loading_screen_mutex;\nbool Global::done_loading = false;\n\nconst int Global::WINDOWED = GFX_AUTODETECT_WINDOWED;\nconst int Global::FULLSCREEN = GFX_AUTODETECT_FULLSCREEN;\n\n\/\/ DATAFILE * Global::all_fonts;\n\nvoid inc_speed_counter() {\n\tGlobal::speed_counter += 1.0;\n}\nEND_OF_FUNCTION( inc_speed_counter );\n\nvoid inc_second_counter() {\n\tGlobal::second_counter++;\n}\nEND_OF_FUNCTION( inc_second_counter );\n\nbool init( int gfx ){\n\n\tcout << \"Allegro version: \" << ALLEGRO_VERSION_STR << endl;\n\tcout<<\"Allegro init: \"<<allegro_init()<<endl;\n\tcout<<\"Loadpng init: \"<<loadpng_init()<<endl;\n\tcout<<\"Install timer: \"<<install_timer()<<endl;\n\t\n\tset_volume_per_voice( 0 );\n\tcout<<\"Install sound: \"<<install_sound( DIGI_AUTODETECT, MIDI_NONE, \"\" )<<endl;\n\n\tcout<<\"Install keyboard: \"<<install_keyboard()<<endl;\n\tcout<<\"Install mouse: \"<<install_mouse()<<endl;\n\tloadpng_init();\n\tset_color_depth( 16 );\n\tcout<<\"Set gfx mode: \"<<set_gfx_mode( gfx, GFX_X, GFX_Y, 0, 0 )<<endl;\n\n\tLOCK_VARIABLE( speed_counter );\n\tLOCK_VARIABLE( second_counter );\n\tLOCK_FUNCTION( (void *)inc_speed_counter );\n\tLOCK_FUNCTION( (void *)inc_second_counter );\n\tcout<<\"Install game timer: \"<<install_int_ex( inc_speed_counter, BPS_TO_TIMER( TICS_PER_SECOND ) )<<endl;\n\tcout<<\"Install second timer: \"<<install_int_ex( inc_second_counter, BPS_TO_TIMER( 1 ) )<<endl;\n\tsrand( time( NULL ) );\n\tset_display_switch_mode( SWITCH_BACKGROUND );\n\t\/\/ Global::all_fonts = load_datafile( \"data\/fonts.dat\" );\n\t\/*\n\tif ( ! Global::all_fonts ){\n\t\tif ( ! exists( \"data\/fonts.dat\" ) ){\n\t\t\tcout << \"data\/fonts.dat is missing!\" << endl;\n\t\t} else {\n\t\t\tcout << \"data\/fonts.dat is corrupted!\" << endl;\n\t\t}\n\t\treturn false;\n\t}\n\tcout<<\"Loaded fonts \" << endl;\n\t*\/\n\n\tatexit( &dumb_exit );\n\tdumb_register_packfiles();\n\n\tcout<<\"-- END init --\"<<endl;\n\n\tBitmap::Screen = new Bitmap( screen );\n\tif ( ! Bitmap::Screen ){\n\t\treturn false;\n\t}\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* interface header *\/\n#include \"ClientAuthentication.h\"\n\n\/* system implementation headers *\/\n#include <string>\n#include <assert.h>\n#ifdef HAVE_KRB5\n#include <com_err.h>\n#define err(x,y,z) if (debugLevel >= 1) com_err(x,y,z)\n#endif\n\n#include \"DirectoryNames.h\"\n\n#ifdef HAVE_KRB5\nkrb5_context ClientAuthentication::context = NULL;\nkrb5_ccache ClientAuthentication::cc = NULL;\nkrb5_auth_context ClientAuthentication::auth_context = NULL;\nkrb5_data ClientAuthentication::packet;\nkrb5_data ClientAuthentication::inbuf;\nkrb5_creds ClientAuthentication::creds;\nkrb5_creds *ClientAuthentication::new_creds;\nkrb5_principal ClientAuthentication::client;\nkrb5_principal ClientAuthentication::server;\nchar ClientAuthentication::principalName[128];\n#endif\nbool ClientAuthentication::authentication = false;\n\n#ifdef HAVE_KRB5\nvoid ClientAuthentication::init(const char *username, const char *password)\n#else\nvoid ClientAuthentication::init(const char *username, const char *)\n#endif \/\/ HAVE_KRB5\n{\n strncpy(principalName, username, 128);\n principalName[127] = 0;\n\n#ifdef HAVE_KRB5\n assert(context == NULL);\n assert(cc == NULL);\n\n krb5_error_code retval;\n krb5_creds my_creds;\n\n \/\/ Initializing kerberos library\n if ((retval = krb5_init_context(&context)))\n err(\"bzflag:\", retval, \"while initializing krb5\");\n \/\/ Getting a default cache specifically for bzflag\n std::string ccfile = \"FILE:\" + getConfigDirName() + \"krb5_cc\";\n if (context && (retval\n\t\t = krb5_cc_set_default_name(context, ccfile.c_str())))\n err(\"bzflag\", retval, \"setting default cache\");\n \/\/ Getting credential cache \n if (!retval && (retval = krb5_cc_default(context, &cc)))\n err(\"bzflag:\", retval, \"getting credentials cache\");\n\n char clientName[139];\n snprintf(clientName, 139, \"%s@BZFLAG.ORG\", username);\n if (cc && (retval = krb5_parse_name(context, clientName, &client)))\n err(\"bzflag\", retval, \"parsing principal name\");\n\n \/\/ Initing credential cache\n if (!retval && (retval = krb5_cc_initialize(context, cc, client)))\n err(\"bzflag\", retval, \"initializing credential cache\");\n\n char intPassword[128];\n strncpy(intPassword, password, 128);\n intPassword[127] = 0;\n \/\/ Get credentials for server\n if (!retval && (retval = krb5_get_init_creds_password(context, &my_creds,\n \t\t\t\t\t\t\tclient, intPassword,\n \t\t\t\t\t\t\tkrb5_prompter_posix,\n \t\t\t\t\t\t\tNULL, 0, NULL, NULL)))\n err(\"bzflag\", retval, \"getting credential\");\n\n \/\/ Store credentials in cache\n if (!retval && (retval = krb5_cc_store_cred(context, cc, &my_creds)))\n err(\"bzflag\", retval, \"storing credential in cache\");\n\n if (!retval && (retval = krb5_parse_name(context,\n\t\t\t\t\t \"krbtgt\/BZFLAG.ORG@BZFLAG.ORG\",\n\t\t\t\t\t &server)))\n err(\"bzflag:\", retval, \"setting up tgt server name\");\n authentication = (retval == 0);\n#endif\n}\n\n#ifdef HAVE_KRB5\nvoid ClientAuthentication::sendCredential(ServerLink &serverLink)\n#else\nvoid ClientAuthentication::sendCredential(ServerLink&)\n#endif \/\/ HAVE_KRB5\n{\n if (!authentication)\n return;\n#ifdef HAVE_KRB5\n assert(context != NULL);\n assert(cc != NULL);\n\n krb5_error_code retval;\n \/* Get credentials for server *\/\n memset((char*)&creds, 0, sizeof(creds));\n memcpy(&creds.client, &client, sizeof(client)); \n memcpy(&creds.server, &server, sizeof(server)); \n \/* Get credentials for server *\/\n if ((retval = krb5_get_credentials(context, KRB5_GC_CACHED, cc, &creds,\n\t\t\t\t &new_creds)))\n err(\"bzflag:\", retval, \"getting TGT\");\n if (!retval) {\n serverLink.sendKerberosTicket(principalName, &new_creds->ticket);\n }\n#endif\n}\n\n\/\/ Local Variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<commit_msg>make it compile without kerberos<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named LICENSE that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* interface header *\/\n#include \"ClientAuthentication.h\"\n\n\/* system implementation headers *\/\n#include <string>\n#include <assert.h>\n#ifdef HAVE_KRB5\n#include <com_err.h>\n#define err(x,y,z) if (debugLevel >= 1) com_err(x,y,z)\n#endif\n\n#include \"DirectoryNames.h\"\n\n#ifdef HAVE_KRB5\nkrb5_context ClientAuthentication::context = NULL;\nkrb5_ccache ClientAuthentication::cc = NULL;\nkrb5_auth_context ClientAuthentication::auth_context = NULL;\nkrb5_data ClientAuthentication::packet;\nkrb5_data ClientAuthentication::inbuf;\nkrb5_creds ClientAuthentication::creds;\nkrb5_creds *ClientAuthentication::new_creds;\nkrb5_principal ClientAuthentication::client;\nkrb5_principal ClientAuthentication::server;\n#endif\nchar ClientAuthentication::principalName[128];\nbool ClientAuthentication::authentication = false;\n\n#ifdef HAVE_KRB5\nvoid ClientAuthentication::init(const char *username, const char *password)\n#else\nvoid ClientAuthentication::init(const char *username, const char *)\n#endif \/\/ HAVE_KRB5\n{\n strncpy(principalName, username, 128);\n principalName[127] = 0;\n\n#ifdef HAVE_KRB5\n assert(context == NULL);\n assert(cc == NULL);\n\n krb5_error_code retval;\n krb5_creds my_creds;\n\n \/\/ Initializing kerberos library\n if ((retval = krb5_init_context(&context)))\n err(\"bzflag:\", retval, \"while initializing krb5\");\n \/\/ Getting a default cache specifically for bzflag\n std::string ccfile = \"FILE:\" + getConfigDirName() + \"krb5_cc\";\n if (context && (retval\n\t\t = krb5_cc_set_default_name(context, ccfile.c_str())))\n err(\"bzflag\", retval, \"setting default cache\");\n \/\/ Getting credential cache \n if (!retval && (retval = krb5_cc_default(context, &cc)))\n err(\"bzflag:\", retval, \"getting credentials cache\");\n\n char clientName[139];\n snprintf(clientName, 139, \"%s@BZFLAG.ORG\", username);\n if (cc && (retval = krb5_parse_name(context, clientName, &client)))\n err(\"bzflag\", retval, \"parsing principal name\");\n\n \/\/ Initing credential cache\n if (!retval && (retval = krb5_cc_initialize(context, cc, client)))\n err(\"bzflag\", retval, \"initializing credential cache\");\n\n char intPassword[128];\n strncpy(intPassword, password, 128);\n intPassword[127] = 0;\n \/\/ Get credentials for server\n if (!retval && (retval = krb5_get_init_creds_password(context, &my_creds,\n \t\t\t\t\t\t\tclient, intPassword,\n \t\t\t\t\t\t\tkrb5_prompter_posix,\n \t\t\t\t\t\t\tNULL, 0, NULL, NULL)))\n err(\"bzflag\", retval, \"getting credential\");\n\n \/\/ Store credentials in cache\n if (!retval && (retval = krb5_cc_store_cred(context, cc, &my_creds)))\n err(\"bzflag\", retval, \"storing credential in cache\");\n\n if (!retval && (retval = krb5_parse_name(context,\n\t\t\t\t\t \"krbtgt\/BZFLAG.ORG@BZFLAG.ORG\",\n\t\t\t\t\t &server)))\n err(\"bzflag:\", retval, \"setting up tgt server name\");\n authentication = (retval == 0);\n#endif\n}\n\n#ifdef HAVE_KRB5\nvoid ClientAuthentication::sendCredential(ServerLink &serverLink)\n#else\nvoid ClientAuthentication::sendCredential(ServerLink&)\n#endif \/\/ HAVE_KRB5\n{\n if (!authentication)\n return;\n#ifdef HAVE_KRB5\n assert(context != NULL);\n assert(cc != NULL);\n\n krb5_error_code retval;\n \/* Get credentials for server *\/\n memset((char*)&creds, 0, sizeof(creds));\n memcpy(&creds.client, &client, sizeof(client)); \n memcpy(&creds.server, &server, sizeof(server)); \n \/* Get credentials for server *\/\n if ((retval = krb5_get_credentials(context, KRB5_GC_CACHED, cc, &creds,\n\t\t\t\t &new_creds)))\n err(\"bzflag:\", retval, \"getting TGT\");\n if (!retval) {\n serverLink.sendKerberosTicket(principalName, &new_creds->ticket);\n }\n#endif\n}\n\n\/\/ Local Variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<|endoftext|>"} {"text":"<commit_before>#include <Ab\/Config.hpp>\n#include <Ab\/Context.hpp>\n#include <Ab\/Wasm\/Loader.hpp>\n#include <Pith\/Assert.hpp>\n#include <istream>\n\nnamespace Ab {\nnamespace Wasm {\n\nauto Loader::operator()(ActiveContext& cx, std::istream& in)\n\t-> Pith::Result<Om::Ref<Module>, LoaderError> {\n\tPITH_ASSERT_UNREACHABLE();\n\treturn Pith::err(LoaderError{});\n}\n\n} \/\/ namespace Wasm\n} \/\/ namespace Ab\n<commit_msg>Note temporarily unused args<commit_after>#include <Ab\/Config.hpp>\n#include <Ab\/Context.hpp>\n#include <Ab\/Wasm\/Loader.hpp>\n#include <Pith\/Assert.hpp>\n#include <istream>\n\nnamespace Ab {\nnamespace Wasm {\n\nauto Loader::operator()([[maybe_unused]] ActiveContext& cx, [[maybe_unused]] std::istream& in)\n\t-> Pith::Result<Om::Ref<Module>, LoaderError> {\n\tPITH_ASSERT_UNREACHABLE();\n\treturn Pith::err(LoaderError{});\n}\n\n} \/\/ namespace Wasm\n} \/\/ namespace Ab\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd All Rights Reserved\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/**\n * @file src\/service\/plugin\/PluginManager.cpp\n * @author Zofia Abramowska <z.abramowska@samsung.com>\n * @version 1.0\n * @brief Definition of PluginManager class\n *\/\n\n#define _BSD_SOURCE_\n\n#include <cinttypes>\n#include <cstdlib>\n#include <dirent.h>\n#include <dlfcn.h>\n#include <functional>\n\n#include <log\/log.h>\n\n#include \"PluginManager.h\"\n\n\nnamespace {\n int pluginFilter(const struct dirent *ent) {\n#ifdef _DIRENT_HAVE_D_TYPE\n if (ent->d_type != DT_REG) {\n return 0;\n }\n#endif\n if (ent->d_name[0] == '.') {\n return 0;\n }\n return 1;\n }\n}\n\nnamespace Cynara {\n\nPluginManager::PluginManager(const std::string &pluginDir) : m_dir(pluginDir) {\n loadPlugins();\n}\n\nPluginManager::~PluginManager(void) {\n \/\/ We have to be sure, that external objects will be destroyed\n \/\/ before handles to libraries are closed.\n for (auto &plugin : m_plugins) {\n plugin.second.reset();\n }\n}\n\nExternalPluginPtr PluginManager::getPlugin(PolicyType pType) {\n return m_plugins[pType];\n}\n\nstd::vector<PolicyDescription> PluginManager::getPolicyDescriptions(void) const {\n std::vector<PolicyDescription> descriptions;\n descriptions.reserve(m_plugins.size());\n for (auto &plugin : m_plugins) {\n descriptions.push_back(plugin.first);\n }\n return descriptions;\n}\n\nvoid PluginManager::invalidateAll(void) {\n for (auto &plugin : m_plugins) {\n plugin.second->invalidate();\n }\n}\n\nvoid PluginManager::loadPlugins(void) {\n struct dirent **nameList = NULL;\n int fileAmount = scandir(m_dir.c_str(), &nameList, pluginFilter, alphasort);\n\n if (fileAmount < 0) {\n auto error = strerror(errno);\n LOGE(\"Couldn't scan for plugins in <%s> : <%s>\", m_dir.c_str(), error);\n return;\n }\n\n std::unique_ptr<dirent*, std::function<void(dirent**)>> direntPtr(nameList,\n [fileAmount](dirent** dirs) {\n for (int i = 0; i < fileAmount; i++) {\n free(dirs[i]);\n }\n free(dirs);\n });\n for (int i = 0; i < fileAmount; i++) {\n openPlugin(m_dir + nameList[i]->d_name);\n }\n}\n\nvoid PluginManager::openPlugin(const std::string &path) {\n void *handle = dlopen(path.c_str(), RTLD_LAZY);\n\n if (!handle) {\n LOGW(\"File could not be dlopened <%s> : <%s>\", path.c_str(), dlerror());\n return;\n }\n PluginLibPtr handlePtr(handle, std::ptr_fun(dlclose));\n\n \/\/Flush any previous errors\n dlerror();\n create_t creator = reinterpret_cast<create_t>(dlsym(handle, \"create\"));\n\n char *error;\n if ((error = dlerror()) != NULL) {\n LOGE(\"Couldn't resolve symbol <create> from lib <%s> : <%s>\", path.c_str(), error);\n return;\n }\n\n destroy_t destroyer = reinterpret_cast<destroy_t>(dlsym(handle, \"destroy\"));\n if ((error = dlerror()) != NULL) {\n LOGE(\"Couldn't resolve symbol <destroy> from lib <%s> : <%s>\", path.c_str(), error);\n return;\n }\n\n ExternalPluginPtr pluginPtr(creator(), destroyer);\n\n if (!pluginPtr) {\n LOGE(\"Couldn't create plugin for <%s>\", path.c_str());\n return;\n }\n\n auto policies = pluginPtr->getSupportedPolicyDescr();\n if (policies.empty()) {\n LOGE(\"Plugin <%s> does not support any type!\", path.c_str());\n return;\n }\n for (auto &desc : policies) {\n if (!m_plugins.insert(std::make_pair(desc, pluginPtr)).second) {\n LOGW(\"policy type: [%\" PRIu16 \"] name: <%s> was already supported.\",\n desc.type, desc.name.c_str());\n }\n }\n\n m_pluginLibs.push_back(std::move(handlePtr));\n}\n\n} \/\/ namespace Cynara\n\n<commit_msg>Add debug info in plugins loading mechanism<commit_after>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd All Rights Reserved\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\/**\n * @file src\/service\/plugin\/PluginManager.cpp\n * @author Zofia Abramowska <z.abramowska@samsung.com>\n * @version 1.0\n * @brief Definition of PluginManager class\n *\/\n\n#define _BSD_SOURCE_\n\n#include <cinttypes>\n#include <cstdlib>\n#include <dirent.h>\n#include <dlfcn.h>\n#include <functional>\n\n#include <log\/log.h>\n\n#include \"PluginManager.h\"\n\n\nnamespace {\n int pluginFilter(const struct dirent *ent) {\n#ifdef _DIRENT_HAVE_D_TYPE\n if (ent->d_type != DT_REG) {\n return 0;\n }\n#endif\n if (ent->d_name[0] == '.') {\n return 0;\n }\n return 1;\n }\n}\n\nnamespace Cynara {\n\nPluginManager::PluginManager(const std::string &pluginDir) : m_dir(pluginDir) {\n loadPlugins();\n}\n\nPluginManager::~PluginManager(void) {\n \/\/ We have to be sure, that external objects will be destroyed\n \/\/ before handles to libraries are closed.\n for (auto &plugin : m_plugins) {\n plugin.second.reset();\n }\n}\n\nExternalPluginPtr PluginManager::getPlugin(PolicyType pType) {\n return m_plugins[pType];\n}\n\nstd::vector<PolicyDescription> PluginManager::getPolicyDescriptions(void) const {\n std::vector<PolicyDescription> descriptions;\n descriptions.reserve(m_plugins.size());\n for (auto &plugin : m_plugins) {\n descriptions.push_back(plugin.first);\n }\n return descriptions;\n}\n\nvoid PluginManager::invalidateAll(void) {\n for (auto &plugin : m_plugins) {\n plugin.second->invalidate();\n }\n}\n\nvoid PluginManager::loadPlugins(void) {\n struct dirent **nameList = NULL;\n int fileAmount = scandir(m_dir.c_str(), &nameList, pluginFilter, alphasort);\n\n if (fileAmount < 0) {\n auto error = strerror(errno);\n LOGE(\"Couldn't scan for plugins in <%s> : <%s>\", m_dir.c_str(), error);\n return;\n }\n\n std::unique_ptr<dirent*, std::function<void(dirent**)>> direntPtr(nameList,\n [fileAmount](dirent** dirs) {\n for (int i = 0; i < fileAmount; i++) {\n free(dirs[i]);\n }\n free(dirs);\n });\n for (int i = 0; i < fileAmount; i++) {\n openPlugin(m_dir + nameList[i]->d_name);\n }\n}\n\nvoid PluginManager::openPlugin(const std::string &path) {\n LOGD(\"Loading plugin: <%s>\", path.c_str());\n\n void *handle = dlopen(path.c_str(), RTLD_LAZY);\n\n if (!handle) {\n LOGW(\"File could not be dlopened <%s> : <%s>\", path.c_str(), dlerror());\n return;\n }\n PluginLibPtr handlePtr(handle, std::ptr_fun(dlclose));\n\n \/\/Flush any previous errors\n dlerror();\n create_t creator = reinterpret_cast<create_t>(dlsym(handle, \"create\"));\n\n char *error;\n if ((error = dlerror()) != NULL) {\n LOGE(\"Couldn't resolve symbol <create> from lib <%s> : <%s>\", path.c_str(), error);\n return;\n }\n\n destroy_t destroyer = reinterpret_cast<destroy_t>(dlsym(handle, \"destroy\"));\n if ((error = dlerror()) != NULL) {\n LOGE(\"Couldn't resolve symbol <destroy> from lib <%s> : <%s>\", path.c_str(), error);\n return;\n }\n\n ExternalPluginPtr pluginPtr(creator(), destroyer);\n\n if (!pluginPtr) {\n LOGE(\"Couldn't create plugin for <%s>\", path.c_str());\n return;\n }\n\n auto policies = pluginPtr->getSupportedPolicyDescr();\n if (policies.empty()) {\n LOGE(\"Plugin <%s> does not support any type!\", path.c_str());\n return;\n }\n for (auto &desc : policies) {\n if (!m_plugins.insert(std::make_pair(desc, pluginPtr)).second) {\n LOGW(\"Policy: type [%\" PRIu16 \"] name <%s> was already supported.\",\n desc.type, desc.name.c_str());\n } else {\n LOGD(\"Supported policy: type [%\" PRIu16 \"] name <%s>\", desc.type, desc.name.c_str());\n }\n }\n\n m_pluginLibs.push_back(std::move(handlePtr));\n}\n\n} \/\/ namespace Cynara\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file binop.cpp\n * @brief Binary operations are handled in this file, along with the appropriate coercions.\n *\n *\/\n\n#include \"angort.h\"\n#include \"hash.h\"\n#include \"opcodes.h\"\n\nnamespace angort {\n\n\/\/\/ append to a list. If the element to add is itself a list,\n\/\/\/ split it apart and and the items individually.\n\nstatic void addListOrValueToList(ArrayList<Value> *list,Value *a){\n if(a->getType() == Types::tList){\n ArrayListIterator<Value> iter(Types::tList->get(a));\n \n for(iter.first();!iter.isDone();iter.next()){\n list->append()->copy(iter.current());\n }\n } else \n list->append()->copy(a);\n} \n\nstatic void addHashToHash(Hash *h,Hash *h2){\n HashKeyIterator iter(h2);\n for(iter.first();!iter.isDone();iter.next()){\n Value *k = iter.current();\n Value *v;\n if(h2->find(k))\n v = h2->getval();\n else\n throw WTF;\n \n h->set(k,v);\n }\n}\n\n\/**\n * Take a pair of values a,b and perform the binary operation given.\n * The result should be pushed onto the stack. The instruction pointer\n * is incremented by the caller.\n *\/\n\nvoid Angort::binop(Value *a,Value *b,int opcode){\n \n const Type *at = a->getType();\n const Type *bt = b->getType();\n \n \/\/ first look to see if it's a registered binop. If\n \/\/ so, run it. Otherwise fall through to a set of if\n \/\/ statements.\n \n if(at->binop(this,opcode,a,b))\n return;\n \n \n if(at == Types::tNone || bt == Types::tNone){\n \/**\n * \n * One of the values is NONE\n *\n *\/\n switch(opcode){\n case OP_EQUALS: \/\/ none is equal to nothing\n pushInt(0);break;\n case OP_NEQUALS:\/\/ and not equal to everything\n pushInt(1);break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a 'none' operand\");\n }\n }else if(at == Types::tList || bt == Types::tList) {\n \/\/ collection equality checks look for identity\n ListObject *lo;\n switch(opcode){\n case OP_EQUALS: \n pushInt(a->v.list == b->v.list);break;\n case OP_NEQUALS:\n pushInt(a->v.list != b->v.list);break;\n case OP_ADD:\n lo = new ListObject();\n addListOrValueToList(&lo->list,a);\n addListOrValueToList(&lo->list,b);\n Types::tList->set(pushval(),lo);\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a list operand\");\n }\n }else if(at == Types::tHash || bt == Types::tHash) {\n HashObject *ho;\n switch(opcode){\n case OP_EQUALS: \n pushInt(a->v.hash == b->v.hash);break;\n case OP_NEQUALS:\n pushInt(a->v.hash != b->v.hash);break;\n case OP_ADD:\n ho = new HashObject();\n addHashToHash(ho->hash,a->v.hash->hash);\n addHashToHash(ho->hash,b->v.hash->hash);\n Types::tHash->set(pushval(),ho);\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a list operand\");\n }\n } else if((at == Types::tString || at == Types::tSymbol) &&\n bt == Types::tInteger &&\n opcode == OP_MUL){\n \/**\n * Special case for multiplying a string\/symbol by a number\n *\/\n const StringBuffer& p = a->toString();\n \n int reps = b->toInt();\n int len = strlen(p.get());\n Value t; \/\/ temp value\n \/\/ allocate a new result\n char *q = Types::tString->allocate(&t,len*reps+1,Types::tString);\n for(int i=0;i<reps;i++){\n memcpy(q+i*len,p.get(),len);\n }\n q[len*reps]=0;\n stack.pushptr()->copy(&t);\n } else if(at == Types::tString || bt == Types::tString){\n \/**\n * \n * One of the value is a string; coerce the other to a string and then\n * perform a string operation.\n *\n *\/\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n switch(opcode){\n case OP_ADD:{\n Value t; \/\/ we use a temp, otherwise allocate() will clear the type\n int len = strlen(p.get())+strlen(q.get());\n char *r = Types::tString->allocate(&t,len+1,Types::tString);\n strcpy(r,p.get());\n strcat(r,q.get());\n stack.pushptr()->copy(&t);\n break;\n }\n case OP_EQUALS:\n pushInt(!strcmp(p.get(),q.get()));\n break;\n case OP_NEQUALS:\n pushInt(strcmp(p.get(),q.get()));\n break;\n case OP_GT:\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n case OP_LT:\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n case OP_GE:\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n case OP_LE:\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n case OP_CMP:\n pushInt(strcmp(p.get(),q.get()));\n break;\n default:throw RUNT(EX_TYPE,\"bad operation for strings\");\n }\n }else if(at == Types::tDouble || bt == Types::tDouble){\n \/**\n * One of the values is a doublet; coerce the other to a double and perform\n * a float operation\n *\/\n double r;\n double p = a->toDouble();\n double q = b->toDouble();\n bool cmp=false;\n switch(opcode){\n case OP_ADD:\n r = p+q;break;\n case OP_SUB:\n r = p-q;break;\n case OP_DIV:\n if(q==0.0f)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n r = p*q;break;\n \/\/ \"comparisons\" go down here - things which\n \/\/ produce integer results even though one operand\n \/\/ is float.\n case OP_EQUALS:\n cmp=true;\n pushInt(p==q);break;\n case OP_NEQUALS:\n cmp=true;\n pushInt(p!=q);break;\n case OP_AND:\n cmp=true;\n pushInt(p&&q);break;\n case OP_OR:\n cmp=true;\n pushInt(p&&q);break;\n case OP_GT:\n cmp=true;\n pushInt(p>q);break;\n case OP_LT:\n cmp=true;\n pushInt(p<q);break;\n case OP_GE:\n cmp=true;\n pushInt(p>=q);break;\n case OP_LE:\n cmp=true;\n pushInt(p<=q);break;\n case OP_CMP:\n cmp=true;\n pushInt(((p-q)>0)?1:(((p-q)<0)?-1:0));\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operator for floats\");\n }\n if(!cmp)\n pushDouble(r);\n }else if(at == Types::tFloat || bt == Types::tFloat){\n \/**\n * One of the values is a float; coerce the other to a float and perform\n * a float operation\n *\/\n float r;\n float p = a->toFloat();\n float q = b->toFloat();\n bool cmp=false;\n switch(opcode){\n case OP_ADD:\n r = p+q;break;\n case OP_SUB:\n r = p-q;break;\n case OP_DIV:\n if(q==0.0f)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n r = p*q;break;\n \/\/ \"comparisons\" go down here - things which\n \/\/ produce integer results even though one operand\n \/\/ is float.\n case OP_EQUALS:\n cmp=true;\n pushInt(p==q);break;\n case OP_NEQUALS:\n cmp=true;\n pushInt(p!=q);break;\n case OP_AND:\n cmp=true;\n pushInt(p&&q);break;\n case OP_OR:\n cmp=true;\n pushInt(p&&q);break;\n case OP_GT:\n cmp=true;\n pushInt(p>q);break;\n case OP_LT:\n cmp=true;\n pushInt(p<q);break;\n case OP_GE:\n cmp=true;\n pushInt(p>=q);break;\n case OP_LE:\n cmp=true;\n pushInt(p<=q);break;\n case OP_CMP:\n cmp=true;\n pushInt(((p-q)>0)?1:(((p-q)<0)?-1:0));\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operator for floats\");\n }\n if(!cmp)\n pushFloat(r);\n }else if(at == Types::tSymbol && bt == Types::tSymbol){\n \/*\n * Both are symbols\n *\/\n switch(opcode){\n case OP_EQUALS:\n pushInt((a->v.i == b->v.i)?1:0);break;\n case OP_NEQUALS:\n pushInt((a->v.i != b->v.i)?1:0);break;\n case OP_GT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n }\n case OP_LT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n }\n case OP_GE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n }\n case OP_LE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n }\n case OP_CMP:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get()));\n break;\n }\n default:\n throw RUNT(EX_TYPE,\"bad operation for symbols\");\n }\n }else if(at == Types::tSymbol || bt == Types::tSymbol){\n \/*\n * One of the values is a symbol; tests are done as with\n * strings\n *\/\n switch(opcode){\n case OP_EQUALS:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())==0);\n break;}\n case OP_NEQUALS:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())!=0);\n break;}\n case OP_GT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n }\n case OP_LT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n }\n case OP_GE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n }\n case OP_LE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n }\n case OP_CMP:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get()));\n break;\n }\n default:\n throw RUNT(EX_TYPE,\"bad operation for symbols\");\n }\n }else if(at == Types::tLong || bt == Types::tLong){\n \/**\n * One is a long, these are similar to int ops\n *\/\n \n long p,q,r;\n switch(opcode){\n case OP_MOD:\n p = a->toLong();\n q = b->toLong();\n r = p%q;break;\n case OP_ADD:\n p = a->toLong();\n q = b->toLong();\n r = p+q;break;\n case OP_SUB:\n p = a->toLong();\n q = b->toLong();\n r = p-q;break;\n case OP_DIV:\n p = a->toLong();\n q = b->toLong();\n if(!q)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n p = a->toLong();\n q = b->toLong();\n r = p*q;break;\n case OP_AND:\n p = a->toLong();\n q = b->toLong();\n r = (p&&q);break;\n case OP_OR:\n p = a->toLong();\n q = b->toLong();\n r = (p||q);break;\n case OP_GT:\n p = a->toLong();\n q = b->toLong();\n r = (p>q);break;\n case OP_LT:\n p = a->toLong();\n q = b->toLong();\n r = (p<q);break;\n case OP_GE:\n p = a->toLong();\n q = b->toLong();\n r = (p>=q);break;\n case OP_LE:\n p = a->toLong();\n q = b->toLong();\n r = (p<=q);break;\n case OP_CMP:\n p = a->toLong();\n q = b->toLong();\n r = ((p-q)>0)?1:(((p-q)<0)?-1:0);\n break;\n case OP_EQUALS:\n r = a->toLong() == b->toLong();\n break;\n case OP_NEQUALS:\n r = a->toLong() != b->toLong();\n break;\n default:\n throw WTF;\n \n }\n Types::tLong->set(pushval(),r);\n } else {\n \/**\n * Otherwise assume we're dealing with ints\n *\/\n int p,q,r;\n switch(opcode){\n case OP_MOD:\n p = a->toInt();\n q = b->toInt();\n r = p%q;break;\n case OP_ADD:\n p = a->toInt();\n q = b->toInt();\n r = p+q;break;\n case OP_SUB:\n p = a->toInt();\n q = b->toInt();\n r = p-q;break;\n case OP_DIV:\n p = a->toInt();\n q = b->toInt();\n if(!q)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n p = a->toInt();\n q = b->toInt();\n r = p*q;break;\n case OP_AND:\n p = a->toInt();\n q = b->toInt();\n r = (p&&q);break;\n case OP_OR:\n p = a->toInt();\n q = b->toInt();\n r = (p||q);break;\n case OP_GT:\n p = a->toInt();\n q = b->toInt();\n r = (p>q);break;\n case OP_LT:\n p = a->toInt();\n q = b->toInt();\n r = (p<q);break;\n case OP_GE:\n p = a->toInt();\n q = b->toInt();\n r = (p>=q);break;\n case OP_LE:\n p = a->toInt();\n q = b->toInt();\n r = (p<=q);break;\n case OP_CMP:\n p = a->toInt();\n q = b->toInt();\n r = ((p-q)>0)?1:(((p-q)<0)?-1:0);\n break;\n case OP_EQUALS:\n if(at == Types::tInteger || bt == Types::tInteger)\n r = a->toInt() == b->toInt();\n else\n r = (a->v.s == b->v.s);\n break;\n case OP_NEQUALS:\n if(at == Types::tInteger || bt == Types::tInteger)\n r = a->toInt() != b->toInt();\n else\n r = (a->v.s != b->v.s);\n break;\n default:\n throw WTF;\n \n }\n pushInt(r);\n }\n \n}\n}\n<commit_msg>bug: [%] [] + would crash.<commit_after>\/**\n * @file binop.cpp\n * @brief Binary operations are handled in this file, along with the appropriate coercions.\n *\n *\/\n\n#include \"angort.h\"\n#include \"hash.h\"\n#include \"opcodes.h\"\n\nnamespace angort {\n\n\/\/\/ append to a list. If the element to add is itself a list,\n\/\/\/ split it apart and and the items individually.\n\nstatic void addListOrValueToList(ArrayList<Value> *list,Value *a){\n if(a->getType() == Types::tList){\n ArrayListIterator<Value> iter(Types::tList->get(a));\n \n for(iter.first();!iter.isDone();iter.next()){\n list->append()->copy(iter.current());\n }\n } else \n list->append()->copy(a);\n} \n\nstatic void addHashToHash(Hash *h,Hash *h2){\n HashKeyIterator iter(h2);\n for(iter.first();!iter.isDone();iter.next()){\n Value *k = iter.current();\n Value *v;\n if(h2->find(k))\n v = h2->getval();\n else\n throw WTF;\n \n h->set(k,v);\n }\n}\n\n\/**\n * Take a pair of values a,b and perform the binary operation given.\n * The result should be pushed onto the stack. The instruction pointer\n * is incremented by the caller.\n *\/\n\nvoid Angort::binop(Value *a,Value *b,int opcode){\n \n const Type *at = a->getType();\n const Type *bt = b->getType();\n \n \/\/ first look to see if it's a registered binop. If\n \/\/ so, run it. Otherwise fall through to a set of if\n \/\/ statements.\n \n if(at->binop(this,opcode,a,b))\n return;\n \n \n if(at == Types::tNone || bt == Types::tNone){\n \/**\n * \n * One of the values is NONE\n *\n *\/\n switch(opcode){\n case OP_EQUALS: \/\/ none is equal to nothing\n pushInt(0);break;\n case OP_NEQUALS:\/\/ and not equal to everything\n pushInt(1);break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a 'none' operand\");\n }\n }else if(at == Types::tList && bt == Types::tList) {\n \/\/ collection equality checks look for identity\n ListObject *lo;\n switch(opcode){\n case OP_EQUALS: \n pushInt(a->v.list == b->v.list);break;\n case OP_NEQUALS:\n pushInt(a->v.list != b->v.list);break;\n case OP_ADD:\n lo = new ListObject();\n addListOrValueToList(&lo->list,a);\n addListOrValueToList(&lo->list,b);\n Types::tList->set(pushval(),lo);\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a list operand\");\n }\n }else if(at == Types::tHash && bt == Types::tHash) {\n HashObject *ho;\n switch(opcode){\n case OP_EQUALS: \n pushInt(a->v.hash == b->v.hash);break;\n case OP_NEQUALS:\n pushInt(a->v.hash != b->v.hash);break;\n case OP_ADD:\n ho = new HashObject();\n addHashToHash(ho->hash,a->v.hash->hash);\n addHashToHash(ho->hash,b->v.hash->hash);\n Types::tHash->set(pushval(),ho);\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operation with a list operand\");\n }\n } else if((at == Types::tString || at == Types::tSymbol) &&\n bt == Types::tInteger &&\n opcode == OP_MUL){\n \/**\n * Special case for multiplying a string\/symbol by a number\n *\/\n const StringBuffer& p = a->toString();\n \n int reps = b->toInt();\n int len = strlen(p.get());\n Value t; \/\/ temp value\n \/\/ allocate a new result\n char *q = Types::tString->allocate(&t,len*reps+1,Types::tString);\n for(int i=0;i<reps;i++){\n memcpy(q+i*len,p.get(),len);\n }\n q[len*reps]=0;\n stack.pushptr()->copy(&t);\n } else if(at == Types::tString || bt == Types::tString){\n \/**\n * \n * One of the value is a string; coerce the other to a string and then\n * perform a string operation.\n *\n *\/\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n switch(opcode){\n case OP_ADD:{\n Value t; \/\/ we use a temp, otherwise allocate() will clear the type\n int len = strlen(p.get())+strlen(q.get());\n char *r = Types::tString->allocate(&t,len+1,Types::tString);\n strcpy(r,p.get());\n strcat(r,q.get());\n stack.pushptr()->copy(&t);\n break;\n }\n case OP_EQUALS:\n pushInt(!strcmp(p.get(),q.get()));\n break;\n case OP_NEQUALS:\n pushInt(strcmp(p.get(),q.get()));\n break;\n case OP_GT:\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n case OP_LT:\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n case OP_GE:\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n case OP_LE:\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n case OP_CMP:\n pushInt(strcmp(p.get(),q.get()));\n break;\n default:throw RUNT(EX_TYPE,\"bad operation for strings\");\n }\n }else if(at == Types::tDouble || bt == Types::tDouble){\n \/**\n * One of the values is a doublet; coerce the other to a double and perform\n * a float operation\n *\/\n double r;\n double p = a->toDouble();\n double q = b->toDouble();\n bool cmp=false;\n switch(opcode){\n case OP_ADD:\n r = p+q;break;\n case OP_SUB:\n r = p-q;break;\n case OP_DIV:\n if(q==0.0f)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n r = p*q;break;\n \/\/ \"comparisons\" go down here - things which\n \/\/ produce integer results even though one operand\n \/\/ is float.\n case OP_EQUALS:\n cmp=true;\n pushInt(p==q);break;\n case OP_NEQUALS:\n cmp=true;\n pushInt(p!=q);break;\n case OP_AND:\n cmp=true;\n pushInt(p&&q);break;\n case OP_OR:\n cmp=true;\n pushInt(p&&q);break;\n case OP_GT:\n cmp=true;\n pushInt(p>q);break;\n case OP_LT:\n cmp=true;\n pushInt(p<q);break;\n case OP_GE:\n cmp=true;\n pushInt(p>=q);break;\n case OP_LE:\n cmp=true;\n pushInt(p<=q);break;\n case OP_CMP:\n cmp=true;\n pushInt(((p-q)>0)?1:(((p-q)<0)?-1:0));\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operator for floats\");\n }\n if(!cmp)\n pushDouble(r);\n }else if(at == Types::tFloat || bt == Types::tFloat){\n \/**\n * One of the values is a float; coerce the other to a float and perform\n * a float operation\n *\/\n float r;\n float p = a->toFloat();\n float q = b->toFloat();\n bool cmp=false;\n switch(opcode){\n case OP_ADD:\n r = p+q;break;\n case OP_SUB:\n r = p-q;break;\n case OP_DIV:\n if(q==0.0f)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n r = p*q;break;\n \/\/ \"comparisons\" go down here - things which\n \/\/ produce integer results even though one operand\n \/\/ is float.\n case OP_EQUALS:\n cmp=true;\n pushInt(p==q);break;\n case OP_NEQUALS:\n cmp=true;\n pushInt(p!=q);break;\n case OP_AND:\n cmp=true;\n pushInt(p&&q);break;\n case OP_OR:\n cmp=true;\n pushInt(p&&q);break;\n case OP_GT:\n cmp=true;\n pushInt(p>q);break;\n case OP_LT:\n cmp=true;\n pushInt(p<q);break;\n case OP_GE:\n cmp=true;\n pushInt(p>=q);break;\n case OP_LE:\n cmp=true;\n pushInt(p<=q);break;\n case OP_CMP:\n cmp=true;\n pushInt(((p-q)>0)?1:(((p-q)<0)?-1:0));\n break;\n default:\n throw RUNT(EX_TYPE,\"invalid operator for floats\");\n }\n if(!cmp)\n pushFloat(r);\n }else if(at == Types::tSymbol && bt == Types::tSymbol){\n \/*\n * Both are symbols\n *\/\n switch(opcode){\n case OP_EQUALS:\n pushInt((a->v.i == b->v.i)?1:0);break;\n case OP_NEQUALS:\n pushInt((a->v.i != b->v.i)?1:0);break;\n case OP_GT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n }\n case OP_LT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n }\n case OP_GE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n }\n case OP_LE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n }\n case OP_CMP:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get()));\n break;\n }\n default:\n throw RUNT(EX_TYPE,\"bad operation for symbols\");\n }\n }else if(at == Types::tSymbol || bt == Types::tSymbol){\n \/*\n * One of the values is a symbol; tests are done as with\n * strings\n *\/\n switch(opcode){\n case OP_EQUALS:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())==0);\n break;}\n case OP_NEQUALS:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())!=0);\n break;}\n case OP_GT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>0);\n break;\n }\n case OP_LT:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<0);\n break;\n }\n case OP_GE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())>=0);\n break;\n }\n case OP_LE:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get())<=0);\n break;\n }\n case OP_CMP:{\n const StringBuffer& p = a->toString();\n const StringBuffer& q = b->toString();\n pushInt(strcmp(p.get(),q.get()));\n break;\n }\n default:\n throw RUNT(EX_TYPE,\"bad operation for symbols\");\n }\n }else if(at == Types::tLong || bt == Types::tLong){\n \/**\n * One is a long, these are similar to int ops\n *\/\n \n long p,q,r;\n switch(opcode){\n case OP_MOD:\n p = a->toLong();\n q = b->toLong();\n r = p%q;break;\n case OP_ADD:\n p = a->toLong();\n q = b->toLong();\n r = p+q;break;\n case OP_SUB:\n p = a->toLong();\n q = b->toLong();\n r = p-q;break;\n case OP_DIV:\n p = a->toLong();\n q = b->toLong();\n if(!q)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n p = a->toLong();\n q = b->toLong();\n r = p*q;break;\n case OP_AND:\n p = a->toLong();\n q = b->toLong();\n r = (p&&q);break;\n case OP_OR:\n p = a->toLong();\n q = b->toLong();\n r = (p||q);break;\n case OP_GT:\n p = a->toLong();\n q = b->toLong();\n r = (p>q);break;\n case OP_LT:\n p = a->toLong();\n q = b->toLong();\n r = (p<q);break;\n case OP_GE:\n p = a->toLong();\n q = b->toLong();\n r = (p>=q);break;\n case OP_LE:\n p = a->toLong();\n q = b->toLong();\n r = (p<=q);break;\n case OP_CMP:\n p = a->toLong();\n q = b->toLong();\n r = ((p-q)>0)?1:(((p-q)<0)?-1:0);\n break;\n case OP_EQUALS:\n r = a->toLong() == b->toLong();\n break;\n case OP_NEQUALS:\n r = a->toLong() != b->toLong();\n break;\n default:\n throw WTF;\n \n }\n Types::tLong->set(pushval(),r);\n } else {\n \/**\n * Otherwise assume we're dealing with ints\n *\/\n int p,q,r;\n switch(opcode){\n case OP_MOD:\n p = a->toInt();\n q = b->toInt();\n r = p%q;break;\n case OP_ADD:\n p = a->toInt();\n q = b->toInt();\n r = p+q;break;\n case OP_SUB:\n p = a->toInt();\n q = b->toInt();\n r = p-q;break;\n case OP_DIV:\n p = a->toInt();\n q = b->toInt();\n if(!q)throw DivZeroException();\n r = p\/q;break;\n case OP_MUL:\n p = a->toInt();\n q = b->toInt();\n r = p*q;break;\n case OP_AND:\n p = a->toInt();\n q = b->toInt();\n r = (p&&q);break;\n case OP_OR:\n p = a->toInt();\n q = b->toInt();\n r = (p||q);break;\n case OP_GT:\n p = a->toInt();\n q = b->toInt();\n r = (p>q);break;\n case OP_LT:\n p = a->toInt();\n q = b->toInt();\n r = (p<q);break;\n case OP_GE:\n p = a->toInt();\n q = b->toInt();\n r = (p>=q);break;\n case OP_LE:\n p = a->toInt();\n q = b->toInt();\n r = (p<=q);break;\n case OP_CMP:\n p = a->toInt();\n q = b->toInt();\n r = ((p-q)>0)?1:(((p-q)<0)?-1:0);\n break;\n case OP_EQUALS:\n if(at == Types::tInteger || bt == Types::tInteger)\n r = a->toInt() == b->toInt();\n else\n r = (a->v.s == b->v.s);\n break;\n case OP_NEQUALS:\n if(at == Types::tInteger || bt == Types::tInteger)\n r = a->toInt() != b->toInt();\n else\n r = (a->v.s != b->v.s);\n break;\n default:\n throw WTF;\n \n }\n pushInt(r);\n }\n \n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * nt loader\n *\n * Copyright 2006-2008 Mike McCormack\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\n#include \"config.h\"\n\n#include <unistd.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n#include <sys\/time.h>\n#include <assert.h>\n\n#include <sys\/wait.h>\n#include <sched.h>\n\n#include <sys\/ptrace.h>\n#ifdef HAVE_ASM_PTRACE_H\n#include <asm\/ptrace.h>\n#endif\n\n#include \"windef.h\"\n#include \"winnt.h\"\n#include \"mem.h\"\n#include \"thread.h\"\n\n#include \"ptrace_if.h\"\n#include \"debug.h\"\n#include \"platform.h\"\n\n#include \"client.h\"\n#include \"ptrace_base.h\"\n\nconst char stub_name[] = \"ring3k-client\";\nchar stub_path[MAX_PATH];\n\nclass tt_address_space_impl: public PTRACE_ADRESS_SPACE_IMPL\n{\n\tlong stub_regs[FRAME_SIZE];\n\tpid_t child_pid;\nprotected:\n\tint userside_req( int type );\npublic:\n\ttt_address_space_impl();\n\tvirtual pid_t GetChildPid();\n\tvirtual ~tt_address_space_impl();\n\tvirtual int Mmap( BYTE *address, size_t length, int prot, int flags, int file, off_t offset );\n\tvirtual int Munmap( BYTE *address, size_t length );\n\tvirtual unsigned short GetUserspaceFs();\n};\n\npid_t tt_address_space_impl::GetChildPid()\n{\n\treturn child_pid;\n}\n\ntt_address_space_impl::tt_address_space_impl()\n{\n\tint r;\n\tpid_t pid;\n\n\tpid = fork();\n\tif (pid == -1)\n\t\tDie(\"fork() failed %d\\n\", errno);\n\n\tif (pid == 0)\n\t{\n\t\t::ptrace( PTRACE_TRACEME, 0, 0, 0 );\n\t\tr = ::execl( stub_path, stub_name, NULL );\n\t\t\/\/ the next line should not be reached\n\t\tDie(\"exec failed (%d) - %s missing?\\n\", r, stub_path);\n\t}\n\n\t\/\/ trace through exec after traceme\n\tWaitForSignal( pid, SIGTRAP );\n\tr = ::ptrace( PTRACE_CONT, pid, 0, 0 );\n\tif (r < 0)\n\t\tDie(\"PTRACE_CONT failed (%d)\\n\", errno);\n\n\t\/\/ client should hit a breakpoint\n\tWaitForSignal( pid, SIGTRAP );\n\tr = PtraceGetRegs( pid, stub_regs );\n\tif (r < 0)\n\t\tDie(\"constructor: ptrace_get_regs failed (%d)\\n\", errno);\n\n\tchild_pid = pid;\n}\n\ntt_address_space_impl::~tt_address_space_impl()\n{\n\tassert( SigTarget == 0 );\n\t\/\/trace(stderr,\"~tt_address_space_impl()\\n\");\n\tDestroy();\n\tptrace( PTRACE_KILL, child_pid, 0, 0 );\n\tassert( child_pid != -1 );\n\tkill( child_pid, SIGTERM );\n\tchild_pid = -1;\n}\n\nADDRESS_SPACE_IMPL* create_tt_address_space()\n{\n\t\/\/trace(\"create_tt_address_space\\n\");\n\t\/\/ Set up the signal handler and unmask it first.\n\t\/\/ The child's signal handler will be unmasked too.\n\treturn new tt_address_space_impl();\n}\n\nint tt_address_space_impl::userside_req( int type )\n{\n\tstruct tt_req *ureq = (struct tt_req *) stub_regs[EBX];\n\tint r;\n\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->type, type );\n\n\tr = PtraceSetRegs( child_pid, stub_regs );\n\tif (r < 0)\n\t\tDie(\"ptrace_set_regs failed\\n\");\n\tr = ::ptrace( PTRACE_CONT, child_pid, 0, 0 );\n\tif (r < 0)\n\t\tDie(\"ptrace( PTRACE_CONT ) failed\\n\");\n\n\tWaitForSignal( child_pid, SIGTRAP );\n\tr = PtraceGetRegs( child_pid, stub_regs );\n\tif (r < 0)\n\t\tDie(\"ptrace_get_regs failed (%d)\\n\", errno);\n\n\treturn stub_regs[EAX];\n}\n\nint tt_address_space_impl::Mmap( BYTE *address, size_t length, int prot, int flags, int file, off_t offset )\n{\n\t\/\/trace(\"tt_address_space_impl::mmap()\\n\");\n\n\t\/\/ send our pid to the stub\n\tstruct tt_req *ureq = (struct tt_req *) stub_regs[EBX];\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.pid, getpid() );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.fd, file );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.addr, (int) address );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.len, length );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.ofs, offset );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.prot, prot );\n\treturn userside_req( tt_req_map );\n}\n\nint tt_address_space_impl::Munmap( BYTE *address, size_t length )\n{\n\t\/\/trace(\"tt_address_space_impl::munmap()\\n\");\n\tstruct tt_req *ureq = (struct tt_req *) stub_regs[EBX];\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.addr, (int) address );\n\tptrace( PTRACE_POKEDATA, child_pid, &ureq->u.map.len, length );\n\treturn userside_req( tt_req_umap );\n}\n\nunsigned short tt_address_space_impl::GetUserspaceFs()\n{\n\treturn stub_regs[FS];\n}\n\nvoid get_stub_path( const char *kernel_path )\n{\n\t\/\/ FIXME: handle loader in path too\n\tconst char *p = strrchr( kernel_path, '\/' );\n\tint len;\n\tif (p)\n\t{\n\t\tlen = p - kernel_path + 1;\n\t}\n\telse\n\t{\n\t\tstatic const char current_dir[] = \".\/\";\n\t\tp = current_dir;\n\t\tlen = sizeof current_dir - 1;\n\t}\n\n\tmemcpy( stub_path, kernel_path, len );\n\tstub_path[len] = 0;\n\tif ((len + sizeof stub_name) > sizeof stub_path)\n\t\tDie(\"path too long\\n\");\n\tstrcat( stub_path, stub_name );\n}\n\n\/\/ quick check that \/proc is mounted\nvoid check_proc()\n{\n\tint fd = open(\"\/proc\/self\/fd\/0\", O_RDONLY);\n\tif (fd < 0)\n\t\tDie(\"\/proc not mounted\\n\");\n\tclose( fd );\n}\n\nbool InitTt( const char *kernel_path )\n{\n\tget_stub_path( kernel_path );\n\tcheck_proc();\n\ttrace(\"using thread tracing, kernel %s, client %s\\n\", kernel_path, stub_path );\n\tPTRACE_ADRESS_SPACE_IMPL::SetSignals();\n\tpCreateAddressSpace = &create_tt_address_space;\n\treturn true;\n}\n<commit_msg>Code refactoring: tt<commit_after>\/*\n * nt loader\n *\n * Copyright 2006-2008 Mike McCormack\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\n#include \"config.h\"\n\n#include <unistd.h>\n#include <fcntl.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n#include <sys\/time.h>\n#include <assert.h>\n\n#include <sys\/wait.h>\n#include <sched.h>\n\n#include <sys\/ptrace.h>\n#ifdef HAVE_ASM_PTRACE_H\n#include <asm\/ptrace.h>\n#endif\n\n#include \"windef.h\"\n#include \"winnt.h\"\n#include \"mem.h\"\n#include \"thread.h\"\n\n#include \"ptrace_if.h\"\n#include \"debug.h\"\n#include \"platform.h\"\n\n#include \"client.h\"\n#include \"ptrace_base.h\"\n\nconst char StubName[] = \"ring3k-client\";\nchar StubPath[MAX_PATH];\n\nclass TT_ADDRESS_SPACE_IMPL: public PTRACE_ADRESS_SPACE_IMPL\n{\n\tlong StubRegs[FRAME_SIZE];\n\tpid_t ChildPid;\nprotected:\n\tint UsersideReq( int type );\npublic:\n\tTT_ADDRESS_SPACE_IMPL();\n\tvirtual pid_t GetChildPid();\n\tvirtual ~TT_ADDRESS_SPACE_IMPL();\n\tvirtual int Mmap( BYTE *address, size_t length, int prot, int flags, int file, off_t offset );\n\tvirtual int Munmap( BYTE *address, size_t length );\n\tvirtual unsigned short GetUserspaceFs();\n};\n\npid_t TT_ADDRESS_SPACE_IMPL::GetChildPid()\n{\n\treturn ChildPid;\n}\n\nTT_ADDRESS_SPACE_IMPL::TT_ADDRESS_SPACE_IMPL()\n{\n\tint r;\n\tpid_t pid;\n\n\tpid = fork();\n\tif (pid == -1)\n\t\tDie(\"fork() failed %d\\n\", errno);\n\n\tif (pid == 0)\n\t{\n\t\t::ptrace( PTRACE_TRACEME, 0, 0, 0 );\n\t\tr = ::execl( StubPath, StubName, NULL );\n\t\t\/\/ the next line should not be reached\n\t\tDie(\"exec failed (%d) - %s missing?\\n\", r, StubPath);\n\t}\n\n\t\/\/ trace through exec after traceme\n\tWaitForSignal( pid, SIGTRAP );\n\tr = ::ptrace( PTRACE_CONT, pid, 0, 0 );\n\tif (r < 0)\n\t\tDie(\"PTRACE_CONT failed (%d)\\n\", errno);\n\n\t\/\/ client should hit a breakpoint\n\tWaitForSignal( pid, SIGTRAP );\n\tr = PtraceGetRegs( pid, StubRegs );\n\tif (r < 0)\n\t\tDie(\"constructor: ptrace_get_regs failed (%d)\\n\", errno);\n\n\tChildPid = pid;\n}\n\nTT_ADDRESS_SPACE_IMPL::~TT_ADDRESS_SPACE_IMPL()\n{\n\tassert( SigTarget == 0 );\n\t\/\/trace(stderr,\"~tt_address_space_impl()\\n\");\n\tDestroy();\n\tptrace( PTRACE_KILL, ChildPid, 0, 0 );\n\tassert( ChildPid != -1 );\n\tkill( ChildPid, SIGTERM );\n\tChildPid = -1;\n}\n\nADDRESS_SPACE_IMPL* CreateTTAddressSpace()\n{\n\t\/\/trace(\"create_tt_address_space\\n\");\n\t\/\/ Set up the signal handler and unmask it first.\n\t\/\/ The child's signal handler will be unmasked too.\n\treturn new TT_ADDRESS_SPACE_IMPL();\n}\n\nint TT_ADDRESS_SPACE_IMPL::UsersideReq( int type )\n{\n\tstruct tt_req *ureq = (struct tt_req *) StubRegs[EBX];\n\tint r;\n\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->type, type );\n\n\tr = PtraceSetRegs( ChildPid, StubRegs );\n\tif (r < 0)\n\t\tDie(\"ptrace_set_regs failed\\n\");\n\tr = ::ptrace( PTRACE_CONT, ChildPid, 0, 0 );\n\tif (r < 0)\n\t\tDie(\"ptrace( PTRACE_CONT ) failed\\n\");\n\n\tWaitForSignal( ChildPid, SIGTRAP );\n\tr = PtraceGetRegs( ChildPid, StubRegs );\n\tif (r < 0)\n\t\tDie(\"ptrace_get_regs failed (%d)\\n\", errno);\n\n\treturn StubRegs[EAX];\n}\n\nint TT_ADDRESS_SPACE_IMPL::Mmap( BYTE *address, size_t length, int prot, int flags, int file, off_t offset )\n{\n\t\/\/trace(\"tt_address_space_impl::mmap()\\n\");\n\n\t\/\/ send our pid to the stub\n\tstruct tt_req *ureq = (struct tt_req *) StubRegs[EBX];\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.pid, getpid() );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.fd, file );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.addr, (int) address );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.len, length );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.ofs, offset );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.prot, prot );\n\treturn UsersideReq( tt_req_map );\n}\n\nint TT_ADDRESS_SPACE_IMPL::Munmap( BYTE *address, size_t length )\n{\n\t\/\/trace(\"tt_address_space_impl::munmap()\\n\");\n\tstruct tt_req *ureq = (struct tt_req *) StubRegs[EBX];\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.addr, (int) address );\n\tptrace( PTRACE_POKEDATA, ChildPid, &ureq->u.map.len, length );\n\treturn UsersideReq( tt_req_umap );\n}\n\nunsigned short TT_ADDRESS_SPACE_IMPL::GetUserspaceFs()\n{\n\treturn StubRegs[FS];\n}\n\nvoid GetStubPath( const char *kernel_path )\n{\n\t\/\/ FIXME: handle loader in path too\n\tconst char *p = strrchr( kernel_path, '\/' );\n\tint len;\n\tif (p)\n\t{\n\t\tlen = p - kernel_path + 1;\n\t}\n\telse\n\t{\n\t\tstatic const char current_dir[] = \".\/\";\n\t\tp = current_dir;\n\t\tlen = sizeof current_dir - 1;\n\t}\n\n\tmemcpy( StubPath, kernel_path, len );\n\tStubPath[len] = 0;\n\tif ((len + sizeof StubName) > sizeof StubPath)\n\t\tDie(\"path too long\\n\");\n\tstrcat( StubPath, StubName );\n}\n\n\/\/ quick check that \/proc is mounted\nvoid CheckProc()\n{\n\tint fd = open(\"\/proc\/self\/fd\/0\", O_RDONLY);\n\tif (fd < 0)\n\t\tDie(\"\/proc not mounted\\n\");\n\tclose( fd );\n}\n\nbool InitTt( const char *kernel_path )\n{\n\tGetStubPath( kernel_path );\n\tCheckProc();\n\ttrace(\"using thread tracing, kernel %s, client %s\\n\", kernel_path, StubPath );\n\tPTRACE_ADRESS_SPACE_IMPL::SetSignals();\n\tpCreateAddressSpace = &CreateTTAddressSpace;\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/**\n * TO DO\n * x. TRY X11 HEADLESS SETUP \n * x. BLIT THE MULTI SAMPLE BUFFER TO A REFULAR ONE AND READ FROM THERE\n * x. Anti aliasing for RGB images\n * . Depth image -> more precise from 255\n * x. Compress the mask images\n * . save the results to a new folder under .\/build --> experiments\/build\/results\n * . skip the folders already existed \n *\/\n#include <string>\n#include <iostream>\n#include <fstream>\n\n#include <opencv2\/opencv.hpp>\n\n\n#include \"GL_include.h\"\n#include <EGL\/egl.h>\n#include \"WindowManager.h\"\n\n#include \"Shaper.h\"\n#include \"Program.h\"\n#include \"WindowManager.h\"\n#include \"WindowManager_headless.h\"\n#include \"PhysicalWorld.h\"\n#include \"Instance.h\"\n#include \"Config.h\"\n#include \"Utility.h\"\n#include \"InputParser.h\"\nConfig progConfig;\nPatronus::Shaper * shaper = nullptr;\nLumos::Program * gProgram = nullptr;\nWindowManager_base * winMan = nullptr;\nPatronus::PhysicalWorld * world = nullptr;\nLumos::Instance * selectedInstance = nullptr;\nstd::string SCENE_FILE_DIR = \".\/scene_file\/\";\nstd::string TEXTURE_DIR = \".\/scene_file\/texture\/ut\/\";\nstd::string CAMERA_DIR = \".\/cameras\/\";\nstd::string OUTPUT_DIR = \".\/output\/\";\nstd::string RENDER_LIST = \".\/obj_list.txt\";\n\nsize_t WINDOW_HEIGHT = 600, WINDOW_WIDTH = 800;\n\nvoid displayHelp(){\n std::ifstream ifs(\".\/help.txt\");\n if (ifs.is_open())\n {\n std::string line;\n while ( std::getline (ifs,line) )\n {\n std::cout << line << std::endl;\n }\n ifs.close();\n }\n}\n\ntemplate <typename T>\nvoid set(T & arg, T setTo, const std::string & var_name){\n std::cout << \"Setting \" << var_name << \" to \" << setTo << std::endl;\n arg = setTo;\n}\n\nint main(int argc, char *argv[])\n{\n InputParser parser(argc, argv);\n std::vector<std::string> vargs;\n\n if (parser.has(Flag::HELP)){\n displayHelp();\n return EXIT_SUCCESS;\n }\n\n if (parser.has(Flag::WINDOW_DIMENTSION)){\n vargs = parser.get(Flag::WINDOW_DIMENTSION).getArgs();\n if (vargs.size() != 2){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(WINDOW_WIDTH, (size_t)std::stoi(vargs[0].c_str()), \"WINDOW_WIDTH\");\n set(WINDOW_HEIGHT, (size_t)std::stoi(vargs[1].c_str()), \"WINDOW_HEIGHT\");\n }\n else \n std::cout << \"Default WINDOW_HEIGHT is \" << WINDOW_HEIGHT << std::endl\n << \"Default WINDOW_HEIGHT is \" << WINDOW_WIDTH << std::endl;\n \n\n if (parser.has(Flag::SCENE_DIRECTORY)){\n vargs = parser.get(Flag::SCENE_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(SCENE_FILE_DIR, vargs[0], \"SCENE_DIRECTORY\");\n }\n else {\n std::cout << \"Default SCENE_DIRECTORY is \" << SCENE_FILE_DIR << std::endl;\n }\n\n if (parser.has(Flag::TEXTURE_DIRECTORY)){\n vargs = parser.get(Flag::TEXTURE_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(TEXTURE_DIR, vargs[0], \"TEXTURE_DIRECTORY\");\n }\n else {\n std::cout << \"Default TEXTURE_DIRECTORY is \" << TEXTURE_DIR << std::endl;\n }\n \n if (parser.has(Flag::CAMERA_DIRECTORY)){\n vargs = parser.get(Flag::CAMERA_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(CAMERA_DIR, vargs[0], \"CAMERA_DIRECTORY\");\n }\n else {\n std::cout << \"Default CAMERA_DIRECTORY is \" << CAMERA_DIR << std::endl;\n }\n\n if (parser.has(Flag::OUTPUT_DIRECTORY)){\n vargs = parser.get(Flag::OUTPUT_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(OUTPUT_DIR, vargs[0], \"OUTPUT_DIRECTORY\");\n }\n else {\n std::cout << \"Default OUTPUT_DIRECTORY is \" << OUTPUT_DIR << std::endl;\n }\n\n if (parser.has(Flag::RENDER_LIST)){\n vargs = parser.get(Flag::RENDER_LIST).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n return EXIT_FAILURE;\n }\n set(RENDER_LIST, vargs[0], \"RENDER_LIST\");\n }\n else {\n std::cout << \"Default RENDER_LIST is \" << RENDER_LIST << std::endl;\n }\n\n\n\n\n\n if (parser.has(Flag::HEADLEASS))\n winMan = new WindowManager_headless{WINDOW_WIDTH, WINDOW_HEIGHT};\n else\n winMan = new WindowManager{WINDOW_WIDTH, WINDOW_HEIGHT};\n\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n world = new Patronus::PhysicalWorld();\n gProgram = new Lumos::Program( );\n shaper = new Patronus::Shaper( );\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n gProgram->loadShaders( \".\/GLSL\" );\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n gProgram->preDrawSetUp();\n\n winMan->show();\n \n return winMan->loop();\n}<commit_msg>isolate main()<commit_after>\n\/**\n * TO DO\n * x. TRY X11 HEADLESS SETUP \n * x. BLIT THE MULTI SAMPLE BUFFER TO A REFULAR ONE AND READ FROM THERE\n * x. Anti aliasing for RGB images\n * . Depth image -> more precise from 255\n * x. Compress the mask images\n * . save the results to a new folder under .\/build --> experiments\/build\/results\n * . skip the folders already existed \n *\/\n#include <string>\n#include <iostream>\n#include <fstream>\n\n\n#include <opencv2\/opencv.hpp>\n\n\n#include \"GL_include.h\"\n#include <EGL\/egl.h>\n#include \"WindowManager.h\"\n\n#include \"Shaper.h\"\n#include \"Program.h\"\n#include \"WindowManager.h\"\n#include \"WindowManager_headless.h\"\n#include \"PhysicalWorld.h\"\n#include \"Instance.h\"\n#include \"Config.h\"\n#include \"Utility.h\"\n#include \"InputParser.h\"\nConfig progConfig;\nPatronus::Shaper * shaper = nullptr;\nLumos::Program * gProgram = nullptr;\nWindowManager_base * winMan = nullptr;\nPatronus::PhysicalWorld * world = nullptr;\nLumos::Instance * selectedInstance = nullptr;\nstd::string SCENE_FILE_DIR = \".\/scene_file\/\";\nstd::string TEXTURE_DIR = \".\/scene_file\/texture\/\";\nstd::string CAMERA_DIR = \".\/cameras\/\";\nstd::string OUTPUT_DIR = \".\/output\/\";\nstd::string RENDER_LIST = \".\/obj_list.txt\";\n\nsize_t WINDOW_HEIGHT = 600, WINDOW_WIDTH = 800;\n\nvoid displayHelp(){\n std::ifstream ifs(\".\/help.txt\");\n if (ifs.is_open())\n {\n std::string line;\n while ( std::getline (ifs,line) )\n {\n std::cout << line << std::endl;\n }\n ifs.close();\n }\n}\n\ntemplate <typename T>\nvoid set(T & arg, T setTo, const std::string & var_name){\n std::cout << \"Setting \" << var_name << \" to \" << setTo << std::endl;\n arg = setTo;\n}\n\nvoid parseCmdLn(int argc, char *argv[]){\n InputParser parser(argc, argv);\n std::vector<std::string> vargs;\n\n if (parser.has(Flag::HELP)){\n displayHelp();\n exit( EXIT_SUCCESS );\n }\n\n if (parser.has(Flag::WINDOW_DIMENTSION)){\n vargs = parser.get(Flag::WINDOW_DIMENTSION).getArgs();\n if (vargs.size() != 2){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(WINDOW_WIDTH, (size_t)std::stoi(vargs[0].c_str()), \"WINDOW_WIDTH\");\n set(WINDOW_HEIGHT, (size_t)std::stoi(vargs[1].c_str()), \"WINDOW_HEIGHT\");\n }\n else \n std::cout << \"Default WINDOW_HEIGHT is \" << WINDOW_HEIGHT << std::endl\n << \"Default WINDOW_HEIGHT is \" << WINDOW_WIDTH << std::endl;\n \n\n if (parser.has(Flag::SCENE_DIRECTORY)){\n vargs = parser.get(Flag::SCENE_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(SCENE_FILE_DIR, vargs[0], \"SCENE_DIRECTORY\");\n }\n else {\n std::cout << \"Default SCENE_DIRECTORY is \" << SCENE_FILE_DIR << std::endl;\n }\n\n if (parser.has(Flag::TEXTURE_DIRECTORY)){\n vargs = parser.get(Flag::TEXTURE_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(TEXTURE_DIR, vargs[0], \"TEXTURE_DIRECTORY\");\n }\n else {\n std::cout << \"Default TEXTURE_DIRECTORY is \" << TEXTURE_DIR << std::endl;\n }\n \n if (parser.has(Flag::CAMERA_DIRECTORY)){\n vargs = parser.get(Flag::CAMERA_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(CAMERA_DIR, vargs[0], \"CAMERA_DIRECTORY\");\n }\n else {\n std::cout << \"Default CAMERA_DIRECTORY is \" << CAMERA_DIR << std::endl;\n }\n\n if (parser.has(Flag::OUTPUT_DIRECTORY)){\n vargs = parser.get(Flag::OUTPUT_DIRECTORY).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(OUTPUT_DIR, vargs[0], \"OUTPUT_DIRECTORY\");\n }\n else {\n std::cout << \"Default OUTPUT_DIRECTORY is \" << OUTPUT_DIR << std::endl;\n }\n\n if (parser.has(Flag::RENDER_LIST)){\n vargs = parser.get(Flag::RENDER_LIST).getArgs();\n if (vargs.size() != 1){\n displayHelp();\n exit( EXIT_FAILURE );\n }\n set(RENDER_LIST, vargs[0], \"RENDER_LIST\");\n }\n else {\n std::cout << \"Default RENDER_LIST is \" << RENDER_LIST << std::endl;\n }\n\n if (parser.has(Flag::HEADLEASS))\n winMan = new WindowManager_headless{WINDOW_WIDTH, WINDOW_HEIGHT};\n else\n winMan = new WindowManager{WINDOW_WIDTH, WINDOW_HEIGHT};\n}\n\nint main(int argc, char *argv[])\n{\n parseCmdLn(argc, argv);\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n world = new Patronus::PhysicalWorld();\n gProgram = new Lumos::Program( );\n shaper = new Patronus::Shaper( );\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n gProgram->loadShaders( \".\/GLSL\" );\n GLError( __PRETTY_FUNCTION__ , __LINE__ );\n\n gProgram->preDrawSetUp();\n\n winMan->show();\n \n return winMan->loop();\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2011-2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"fnord\/http\/cookies.h\"\n#include \"fnord\/inspect.h\"\n\nnamespace fnord {\nnamespace http {\n\nbool Cookies::getCookie(\n const CookieList& cookies,\n const std::string& key,\n std::string* dst) {\n for (const auto& cookie : cookies) {\n if (cookie.first == key) {\n *dst = cookie.second;\n return true;\n }\n }\n\n return false;\n}\n\nCookies::CookieList Cookies::parseCookieHeader(const std::string& header_str) {\n std::vector<std::pair<std::string, std::string>> cookies;\n\n auto begin = header_str.c_str();\n auto end = begin + header_str.length();\n auto cur = begin;\n while (begin < end) {\n for (; begin < end && *begin == ' '; ++begin);\n for (; cur < end && *cur != '='; ++cur);\n auto split = ++cur;\n for (; cur < end && *cur != ';'; ++cur);\n cookies.emplace_back(\n std::make_pair(\n URI::urlDecode(std::string(begin, split - 1)),\n URI::urlEncode(std::string(split, cur))));\n begin = ++cur;\n }\n\n return cookies;\n}\n\nstd::string Cookies::mkCookie(\n const std::string& key,\n const std::string& value,\n const UnixTime& expire \/* = UnixTime::epoch() *\/,\n const std::string& path \/* = \"\" *\/,\n const std::string& domain \/* = \"\" *\/,\n bool secure \/* = false *\/,\n bool httponly \/* = false *\/) {\n auto cookie_str = StringUtil::format(\n \"$0=$1\",\n URI::urlEncode(key),\n URI::urlEncode(value));\n\n if (path.length() > 0) {\n cookie_str.append(StringUtil::format(\"; Path=$0\", path));\n }\n\n if (domain.length() > 0) {\n cookie_str.append(StringUtil::format(\"; Domain=$0\", domain));\n }\n\n if (static_cast<uint64_t>(expire) > 0) {\n cookie_str.append(StringUtil::format(\"; Expires=$0\",\n expire.toString(\"%a, %d-%b-%Y %H:%M:%S UTC\")));\n }\n\n if (httponly) {\n cookie_str.append(\"; HttpOnly\");\n }\n\n if (secure) {\n cookie_str.append(\"; Secure\");\n }\n\n return cookie_str;\n}\n\n} \/\/ namespace http\n} \/\/ namespace fnord\n<commit_msg>fix stupid bug<commit_after>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2011-2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"fnord\/http\/cookies.h\"\n#include \"fnord\/inspect.h\"\n\nnamespace fnord {\nnamespace http {\n\nbool Cookies::getCookie(\n const CookieList& cookies,\n const std::string& key,\n std::string* dst) {\n for (const auto& cookie : cookies) {\n if (cookie.first == key) {\n *dst = cookie.second;\n return true;\n }\n }\n\n return false;\n}\n\nCookies::CookieList Cookies::parseCookieHeader(const std::string& header_str) {\n std::vector<std::pair<std::string, std::string>> cookies;\n\n auto begin = header_str.c_str();\n auto end = begin + header_str.length();\n auto cur = begin;\n while (begin < end) {\n for (; begin < end && *begin == ' '; ++begin);\n for (; cur < end && *cur != '='; ++cur);\n auto split = ++cur;\n for (; cur < end && *cur != ';'; ++cur);\n cookies.emplace_back(\n std::make_pair(\n URI::urlDecode(std::string(begin, split - 1)),\n URI::urlDecode(std::string(split, cur))));\n begin = ++cur;\n }\n\n return cookies;\n}\n\nstd::string Cookies::mkCookie(\n const std::string& key,\n const std::string& value,\n const UnixTime& expire \/* = UnixTime::epoch() *\/,\n const std::string& path \/* = \"\" *\/,\n const std::string& domain \/* = \"\" *\/,\n bool secure \/* = false *\/,\n bool httponly \/* = false *\/) {\n auto cookie_str = StringUtil::format(\n \"$0=$1\",\n URI::urlEncode(key),\n URI::urlEncode(value));\n\n if (path.length() > 0) {\n cookie_str.append(StringUtil::format(\"; Path=$0\", path));\n }\n\n if (domain.length() > 0) {\n cookie_str.append(StringUtil::format(\"; Domain=$0\", domain));\n }\n\n if (static_cast<uint64_t>(expire) > 0) {\n cookie_str.append(StringUtil::format(\"; Expires=$0\",\n expire.toString(\"%a, %d-%b-%Y %H:%M:%S UTC\")));\n }\n\n if (httponly) {\n cookie_str.append(\"; HttpOnly\");\n }\n\n if (secure) {\n cookie_str.append(\"; Secure\");\n }\n\n return cookie_str;\n}\n\n} \/\/ namespace http\n} \/\/ namespace fnord\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ \\file main.cpp\n\n#include \"HelloTriangleApplication.hpp\"\n#include \"VDeleter.hpp\"\n\n\/\/ waf-generated header\n#include \"config.hpp\"\n\n#define DOCTEST_CONFIG_IMPLEMENT\n#include \"doctest.h\"\n\n#define GLFW_INCLUDE_VULKAN\n#include <GLFW\/glfw3.h>\n\n#include <iostream>\n#include <string>\n\nint main(int argc, char* argv[])\n{\n int res{0};\n#ifndef DOCTEST_CONFIG_DISABLE\n doctest::Context context;\n\n context.setOption(\"no-run\", true);\n\n context.applyCommandLine(argc, argv);\n\n using namespace std::literals::string_literals;\n auto begin_argv = argv + 1;\n auto end_argv = argv + argc;\n if (end_argv != std::find(begin_argv, end_argv, \"--test\"s)) {\n context.setOption(\"no-run\", false);\n context.setOption(\"exit\", true);\n }\n\n res = context.run();\n if (context.shouldExit()) return res;\n#endif\n HelloTriangleApplication app;\n\n try {\n app.run();\n }\n catch (const std::runtime_error& e) {\n std::cerr << e.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS + res;\n}\n\n\/\/ vim:set et ts=2 sw=2 sts=2:\n\n<commit_msg>Rename 'res' variable to 'test_result'<commit_after>\/\/\/ \\file main.cpp\n\n#include \"HelloTriangleApplication.hpp\"\n#include \"VDeleter.hpp\"\n\n\/\/ waf-generated header\n#include \"config.hpp\"\n\n#define DOCTEST_CONFIG_IMPLEMENT\n#include \"doctest.h\"\n\n#define GLFW_INCLUDE_VULKAN\n#include <GLFW\/glfw3.h>\n\n#include <iostream>\n#include <string>\n\nint main(int argc, char* argv[])\n{\n int test_result{0};\n#ifndef DOCTEST_CONFIG_DISABLE\n doctest::Context context;\n\n context.setOption(\"no-run\", true);\n\n context.applyCommandLine(argc, argv);\n\n using namespace std::literals::string_literals;\n auto begin_argv = argv + 1;\n auto end_argv = argv + argc;\n if (end_argv != std::find(begin_argv, end_argv, \"--test\"s)) {\n context.setOption(\"no-run\", false);\n context.setOption(\"exit\", true);\n }\n\n test_result = context.run();\n if (context.shouldExit()) return test_result;\n#endif\n HelloTriangleApplication app;\n\n try {\n app.run();\n }\n catch (const std::runtime_error& e) {\n std::cerr << e.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS + test_result;\n}\n\n\/\/ vim:set et ts=2 sw=2 sts=2:\n\n<|endoftext|>"} {"text":"<commit_before>\n#include \"main.hpp\"\n#include <algorithm>\n#include <string>\n#include <iostream>\n#include <limits>\n\n\nconst std::size_t SEQUENCE_COUNT = 8;\nconst std::size_t SEQUENCE_LENGTH = 16;\n\n\nint main(int argc, char** argv)\n{\n std::vector<Node*> nodes;\n for (std::size_t j = 0; j < SEQUENCE_COUNT; j++)\n nodes.push_back(new Node(getSequence(), NULL, NULL));\n\n while (nodes.size() > 1)\n {\n std::vector<Node*> newList;\n\n while (!nodes.empty())\n {\n if (nodes.size() == 1)\n {\n newList.push_back(new Node(nodes[0]->sequence_, nodes[0], NULL));\n nodes.erase(nodes.begin());\n }\n else\n {\n uint8_t* blank;\n std::pair<uint8_t*, int> best = std::make_pair(blank,\n std::numeric_limits<int>::max());\n std::size_t bestIndex = 0;\n for (std::size_t j = 1; j < nodes.size(); j++)\n {\n auto result = score(nodes[0], nodes[j]);\n if (result.second < best.second)\n {\n best = result;\n bestIndex = j;\n }\n }\n\n newList.push_back(new Node(best.first, nodes[0], nodes[bestIndex]));\n nodes.erase(nodes.begin() + (const long)bestIndex);\n nodes.erase(nodes.begin());\n }\n }\n\n nodes = newList;\n }\n\n std::cout << \"Comparison of first two children: \" <<\n score(nodes[0]->left_, nodes[0]->right_).second <<\n std::endl;\n\n std::cout << \"Comparison of first two children: \" <<\n scoreSSE(nodes[0]->left_, nodes[0]->right_).second <<\n std::endl;\n\n std::cout << \"In-order traversal of tree:\" << std::endl;\n \/\/printTree(nodes[0], 0);\n std::cout << \"End of in-order traversal of tree.\" << std::endl;\n\n return EXIT_SUCCESS;\n}\n\n\n\nstd::pair<uint8_t*, int> score(const Node* nodeA, const Node* nodeB)\n{\n uint8_t* result = new uint8_t[SEQUENCE_LENGTH];\n int score = 0;\n\n for (std::size_t j = 0; j < SEQUENCE_LENGTH; j++)\n {\n auto a = nodeA->sequence_[j], b = nodeB->sequence_[j];\n auto aAndb = a & b;\n if (aAndb == 0)\n {\n result[j] = a | b;\n score++;\n }\n else\n result[j] = aAndb;\n }\n\n return std::make_pair(result, score);\n}\n\n\n\nstd::pair<__m128i*, int> scoreSSE(const Node* nodeA, const Node* nodeB)\n{\n static __m128i zero = _mm_set1_ps(0.f), comp, tempOr, a, b, r;\n static uint8_t* aUnit = reinterpret_cast<uint8_t*>(&a);\n static uint8_t* bUnit = reinterpret_cast<uint8_t*>(&b);\n static uint8_t* rUnit = reinterpret_cast<uint8_t*>(&r);\n\n int score = 0;\n __m128i* result = new __m128i[SEQUENCE_LENGTH \/ 16];\n for (int j = 0; j < SEQUENCE_LENGTH - 15; j += 16)\n {\n for (int k = 0; k < 16; k++)\n {\n aUnit[k] = nodeA->sequence_[j + k];\n bUnit[k] = nodeB->sequence_[j + k];\n }\n\n r = _mm_and_si128(a, b);\n for (int k = 0; k < 16; k++)\n score += !(int)rUnit[k];\n\n tempOr = _mm_or_si128(a, b);\n comp = _mm_cmpeq_epi8(zero, r);\n comp = _mm_and_si128(comp, tempOr);\n result[j \/ 16] = _mm_or_si128(comp, r);\n }\n\n return std::make_pair(result, score);\n}\n\n\n\nuint8_t* getSequence()\n{\n auto mersenneTwister = getMersenneTwister();\n std::uniform_int_distribution<int> randomInt(1, 4);\n\n uint8_t* sequence = new uint8_t[SEQUENCE_LENGTH];\n for (std::size_t j = 0; j < SEQUENCE_LENGTH; j++)\n {\n switch (randomInt(mersenneTwister))\n {\n case 1:\n sequence[j] = 0x1;\n break;\n case 2:\n sequence[j] = 0x2;\n break;\n case 3:\n sequence[j] = 0x4;\n break;\n case 4:\n sequence[j] = 0x8;\n break;\n }\n }\n\n return sequence;\n}\n\n\n\nvoid printTree(const Node* node, int depth)\n{\n if (node == NULL)\n return;\n\n printTree(node->left_, depth + 1);\n\n for (int j = 0; j < depth - 1; j++)\n std::cout << \" \";\n std::cout << \"|--\";\n\n if (node->right_ != NULL && node->right_ != NULL)\n std::cout << score(node->left_, node->right_).second;\n else\n {\n for (std::size_t j = 0; j < std::min(100, (int)SEQUENCE_LENGTH); j++)\n {\n switch(node->sequence_[j])\n {\n case 1:\n std::cout << \"A\";\n break;\n case 2:\n std::cout << \"T\";\n break;\n case 4:\n std::cout << \"C\";\n break;\n case 8:\n std::cout << \"G\";\n break;\n }\n }\n }\n\n std::cout << std::endl;\n\n printTree(node->right_, depth + 1);\n}\n\n\n\nstd::mt19937 getMersenneTwister()\n{\n std::array<int, std::mt19937::state_size> seed_data;\n std::random_device r;\n std::generate_n(seed_data.data(), seed_data.size(), std::ref(r));\n std::seed_seq seq(std::begin(seed_data), std::end(seed_data));\n std::mt19937 mersenneTwister(seq);\n return mersenneTwister;\n}\n<commit_msg>slight optimizations<commit_after>\n#include \"main.hpp\"\n#include <algorithm>\n#include <string>\n#include <iostream>\n#include <limits>\n#include <memory.h>\n\n\nconst std::size_t SEQUENCE_COUNT = 8;\nconst std::size_t SEQUENCE_LENGTH = 16;\nconst int UNITS_PER_SSE = 16;\n\n\nint main(int argc, char** argv)\n{\n std::vector<Node*> nodes;\n for (std::size_t j = 0; j < SEQUENCE_COUNT; j++)\n nodes.push_back(new Node(getSequence(), NULL, NULL));\n\n while (nodes.size() > 1)\n {\n std::vector<Node*> newList;\n\n while (!nodes.empty())\n {\n if (nodes.size() == 1)\n {\n newList.push_back(new Node(nodes[0]->sequence_, nodes[0], NULL));\n nodes.erase(nodes.begin());\n }\n else\n {\n uint8_t* blank;\n std::pair<uint8_t*, int> best = std::make_pair(blank,\n std::numeric_limits<int>::max());\n std::size_t bestIndex = 0;\n for (std::size_t j = 1; j < nodes.size(); j++)\n {\n auto result = score(nodes[0], nodes[j]);\n if (result.second < best.second)\n {\n best = result;\n bestIndex = j;\n }\n }\n\n newList.push_back(new Node(best.first, nodes[0], nodes[bestIndex]));\n nodes.erase(nodes.begin() + (const long)bestIndex);\n nodes.erase(nodes.begin());\n }\n }\n\n nodes = newList;\n }\n\n std::cout << \"Comparison of first two children: \" <<\n score(nodes[0]->left_, nodes[0]->right_).second <<\n std::endl;\n\n std::cout << \"Comparison of first two children: \" <<\n scoreSSE(nodes[0]->left_, nodes[0]->right_).second <<\n std::endl;\n\n std::cout << \"In-order traversal of tree:\" << std::endl;\n \/\/printTree(nodes[0], 0);\n std::cout << \"End of in-order traversal of tree.\" << std::endl;\n\n return EXIT_SUCCESS;\n}\n\n\n\nstd::pair<uint8_t*, int> score(const Node* nodeA, const Node* nodeB)\n{\n uint8_t* result = new uint8_t[SEQUENCE_LENGTH];\n int score = 0;\n\n for (std::size_t j = 0; j < SEQUENCE_LENGTH; j++)\n {\n auto a = nodeA->sequence_[j], b = nodeB->sequence_[j];\n auto aAndb = a & b;\n if (aAndb == 0)\n {\n result[j] = a | b;\n score++;\n }\n else\n result[j] = aAndb;\n }\n\n return std::make_pair(result, score);\n}\n\n\n\nstd::pair<__m128i*, int> scoreSSE(const Node* nodeA, const Node* nodeB)\n{\n static __m128i zero = _mm_set1_ps(0.f), comp, aOrB, a, b, r;\n static uint8_t* rUnit = reinterpret_cast<uint8_t*>(&r);\n\n int score = 0;\n __m128i* result = new __m128i[SEQUENCE_LENGTH \/ UNITS_PER_SSE];\n for (int j = 0; j <= SEQUENCE_LENGTH - UNITS_PER_SSE; j += UNITS_PER_SSE)\n {\n memcpy(&a, nodeA->sequence_, sizeof(__m128i));\n memcpy(&b, nodeB->sequence_, sizeof(__m128i));\n\n r = _mm_and_si128(a, b);\n for (int k = 0; k < UNITS_PER_SSE; k++)\n score += !(int)rUnit[k];\n\n aOrB = _mm_or_si128(a, b);\n comp = _mm_cmpeq_epi8(zero, r);\n comp = _mm_and_si128(comp, aOrB);\n result[j \/ UNITS_PER_SSE] = _mm_or_si128(comp, r);\n }\n\n return std::make_pair(result, score);\n}\n\n\n\nuint8_t* getSequence()\n{\n auto mersenneTwister = getMersenneTwister();\n std::uniform_int_distribution<int> randomInt(1, 4);\n\n uint8_t* sequence = new uint8_t[SEQUENCE_LENGTH];\n for (std::size_t j = 0; j < SEQUENCE_LENGTH; j++)\n {\n switch (randomInt(mersenneTwister))\n {\n case 1:\n sequence[j] = 0x1;\n break;\n case 2:\n sequence[j] = 0x2;\n break;\n case 3:\n sequence[j] = 0x4;\n break;\n case 4:\n sequence[j] = 0x8;\n break;\n }\n }\n\n return sequence;\n}\n\n\n\nvoid printTree(const Node* node, int depth)\n{\n if (node == NULL)\n return;\n\n printTree(node->left_, depth + 1);\n\n for (int j = 0; j < depth - 1; j++)\n std::cout << \" \";\n std::cout << \"|--\";\n\n if (node->right_ != NULL && node->right_ != NULL)\n std::cout << score(node->left_, node->right_).second;\n else\n {\n for (std::size_t j = 0; j < std::min(100, (int)SEQUENCE_LENGTH); j++)\n {\n switch(node->sequence_[j])\n {\n case 1:\n std::cout << \"A\";\n break;\n case 2:\n std::cout << \"T\";\n break;\n case 4:\n std::cout << \"C\";\n break;\n case 8:\n std::cout << \"G\";\n break;\n }\n }\n }\n\n std::cout << std::endl;\n\n printTree(node->right_, depth + 1);\n}\n\n\n\nstd::mt19937 getMersenneTwister()\n{\n std::array<int, std::mt19937::state_size> seed_data;\n std::random_device r;\n std::generate_n(seed_data.data(), seed_data.size(), std::ref(r));\n std::seed_seq seq(std::begin(seed_data), std::end(seed_data));\n std::mt19937 mersenneTwister(seq);\n return mersenneTwister;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n Inotify notify;\n\n InotifyWatch watch(file, IN_ALL_EVENTS);\n notify.Add(watch);\n\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while(count-- > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if(got_event && !(*fragHasChanged)){ \n std::string mask_str;\n event.DumpTypes(mask_str);\n *fragHasChanged = true;\n std::cout << \"Child: Something have change \" << mask_str << std::endl;\n }\n }\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n }\n break;\n\n default: \n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<commit_msg>debug<commit_after>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n Inotify notify;\n\n InotifyWatch watch(file, IN_ALL_EVENTS);\n notify.Add(watch);\n\n try {\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while(count-- > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if(got_event && !(*fragHasChanged)){ \n std::string mask_str;\n event.DumpTypes(mask_str);\n *fragHasChanged = true;\n std::cout << \"Child: Something have change \" << mask_str << std::endl;\n }\n }\n }\n } catch (InotifyException &e) {\n cerr << \"Inotify exception occured: \" << e.GetMessage() << endl;\n } catch (exception &e) {\n cerr << \"STL exception occured: \" << e.what() << endl;\n } catch (...) {\n cerr << \"unknown exception occured\" << endl;\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n }\n break;\n\n default: \n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\nconst std::string update_check(\"\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n \/\/for (auto s : elems)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n \/\/std::cout << \"the path: \" << path << std::endl;\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n \/\/std::cout << \"opened path \" << path << std::endl;\n }\n }\n if (fs.good())\n {\n fs.close();\n \/\/const std::string calcsum(file_checksum(name()));\n \/*\n std::cout << \"calced sum for \" << name()\n << \" : \" << calcsum << \", expected \" << checksum() << std::endl;\n *\/\n \/\/if (calcsum == checksum())\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n const std::string calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::shared_ptr<CURL *> phandle =\n std::make_shared<CURL *>(curl_easy_init());\n std::string url(patch_dir + name());\n curl_easy_setopt(*phandle, CURLOPT_URL, url.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &s);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n std::ofstream ofs(name());\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#define md_md5\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n else\n {\n \/\/std::cout << \"opened file \" << path << std::endl;\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n \/\/std::cout << calcsum.str() << std::endl;\n return calcsum.str();\n}\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n std::string fetch;\n std::shared_ptr<CURL *> phandle = std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, listing.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n \/\/std::cout << fetch << std::endl;\n std::vector<std::string> lines(split(fetch, '\\n'));\n \/\/split(fetch, '\\n', lines);\n \/\/std::cout << lines[1] << std::endl;\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t << std::endl;\n \/\/t.fetch();\n }\n \/\/std::cout << new_targets[4] << std::endl;\n new_targets[0].fetch();\n \/\/new_targets[4].fetch();\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n \/*\n const std::string path = \"bin\/override\/spells.2da\";\n const std::string checksum(\"38eaad974c15e5f3119469f17e8e97a9\");\n std::cout << \"file checksum test: \"\n << path << \" = \" << checksum\n << \" : \" << (file_checksum(path) == checksum)\n << std::endl;\n *\/\n std::cout << std::endl;\n return 0;\n}\n<commit_msg>Use auto for declaration.<commit_after>#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\nconst std::string update_check(\"\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n \/\/for (auto s : elems)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n \/\/std::cout << \"the path: \" << path << std::endl;\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n \/\/std::cout << \"opened path \" << path << std::endl;\n }\n }\n if (fs.good())\n {\n fs.close();\n \/\/const std::string calcsum(file_checksum(name()));\n \/*\n std::cout << \"calced sum for \" << name()\n << \" : \" << calcsum << \", expected \" << checksum() << std::endl;\n *\/\n \/\/if (calcsum == checksum())\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n auto calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::shared_ptr<CURL *> phandle =\n std::make_shared<CURL *>(curl_easy_init());\n std::string url(patch_dir + name());\n curl_easy_setopt(*phandle, CURLOPT_URL, url.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &s);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n std::ofstream ofs(name());\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#define md_md5\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n else\n {\n \/\/std::cout << \"opened file \" << path << std::endl;\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n \/\/std::cout << calcsum.str() << std::endl;\n return calcsum.str();\n}\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n std::string fetch;\n std::shared_ptr<CURL *> phandle = std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, listing.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n \/\/std::cout << fetch << std::endl;\n std::vector<std::string> lines(split(fetch, '\\n'));\n \/\/split(fetch, '\\n', lines);\n \/\/std::cout << lines[1] << std::endl;\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t << std::endl;\n \/\/t.fetch();\n }\n \/\/std::cout << new_targets[4] << std::endl;\n new_targets[0].fetch();\n \/\/new_targets[4].fetch();\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n \/*\n const std::string path = \"bin\/override\/spells.2da\";\n const std::string checksum(\"38eaad974c15e5f3119469f17e8e97a9\");\n std::cout << \"file checksum test: \"\n << path << \" = \" << checksum\n << \" : \" << (file_checksum(path) == checksum)\n << std::endl;\n *\/\n std::cout << std::endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Bounce2.h>\n#include <FastLED.h>\n\/\/ #include <EEPROM.h>\n\n#define DEBUG\n\n#ifdef DEBUG\n #define DEBUG_PRINT(msg) (Serial.println(msg))\n#else\n #define DEBUG_PRINT(msg) ()\n#endif\n\n\/\/ Digital PINs\n#define LED_PIN_CH1 4\n#define LED_PIN_CH2 2\n#define MODE_BUTTON_PIN 6\n#define DROP_BUTTON_PIN 7\n#define BRIGHTNESS_BUTTON_PIN 8\n#define BEAT_BUTTON_PIN 10\n\n\/\/ Analog PINs\n#define ACCELX_PIN A0\n#define ACCELY_PIN A2\n#define ACCELZ_PIN A4\n\n\/\/ Other constants\n#define BAUD_RATE 9600\n#define NUM_LEDS_CH0 120\n#define NUM_LEDS_CH1 29\n#define FRAME_LENGTH 33 \/\/ 30 fps\n#define NUM_STATES 2\n#define MAX_MILLIAMPS 500 \/\/ should run for ~8h on 2x2000maH 18650\n\n#include <Pattern.h>\n#include <PatternList.h>\n#include <PatternState.h>\n#include <PaletteList.h>\n\n#include <Plasma.h>\n#include <Juggle.h>\n#include <Sinelon.h>\n#include <Confetti.h>\n#include <Heartbeat.h>\n#include <Bpm.h>\n\n#include <BrightnessControl.h>\n#include <ModeControl.h>\n#include <BeatControl.h>\n#include <DropControl.h>\n#include <AccellerationControl.h>\n\nCRGB ledsCh0[NUM_LEDS_CH0];\nPatternState stateCh0(NUM_LEDS_CH0, ledsCh0);\n\nCRGB ledsCh1[NUM_LEDS_CH1];\nPatternState stateCh1(NUM_LEDS_CH1, ledsCh1);\n\nHeartbeat *heartbeat = new Heartbeat();\nPattern *patternItems[] = {\n new Bpm(),\n heartbeat,\n new Plasma(),\n new Juggle(),\n new Sinelon(),\n new Confetti()\n};\nPatternList patternList(6, patternItems);\n\nCRGBPalette16 *paletteItems[] = {\n new CRGBPalette16(\n CRGB::Blue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::Blue,\n CRGB::DarkBlue,\n CRGB::SkyBlue,\n CRGB::SkyBlue,\n CRGB::LightBlue,\n CRGB::White,\n CRGB::LightBlue,\n CRGB::SkyBlue\n ),\n \/\/ Lava\n new CRGBPalette16(\n CRGB::Black,\n CRGB::Maroon,\n CRGB::Black,\n CRGB::Maroon,\n CRGB::DarkRed,\n CRGB::Maroon,\n CRGB::DarkRed,\n CRGB::DarkRed,\n CRGB::DarkRed,\n CRGB::Red,\n CRGB::Orange,\n CRGB::White,\n CRGB::Orange,\n CRGB::Red,\n CRGB::DarkRed,\n CRGB::Black\n ),\n \/\/ Rainbow\n new CRGBPalette16(\n 0xFF0000, 0xD52A00, 0xAB5500, 0xAB7F00,\n 0xABAB00, 0x56D500, 0x00FF00, 0x00D52A,\n 0x00AB55, 0x0056AA, 0x0000FF, 0x2A00D5,\n 0x5500AB, 0x7F0081, 0xAB0055, 0xD5002B\n )\n};\nPaletteList paletteList(3, paletteItems);\n\n\nBrightnessControl brightnessControl(BRIGHTNESS_BUTTON_PIN);\nModeControl modeControl(MODE_BUTTON_PIN);\nBeatControl beatControl(BEAT_BUTTON_PIN);\nDropControl dropControl(DROP_BUTTON_PIN);\nAccellerationControl accellerationControl(ACCELX_PIN, ACCELY_PIN, ACCELZ_PIN);\n\n\/\/ See https:\/\/learn.adafruit.com\/multi-tasking-the-arduino-part-1\/using-millis-for-timing\nlong previousMillis = 0;\n\n\/\/ \/\/ Cycle mode in persistent memory on every on switch.\n\/\/ \/\/ More resilient against hardware failures than a button.\n\/\/ void updateModeFromEEPROM() {\n\/\/ mode = EEPROM.read(0);\n\/\/ if(!mode) {\n\/\/ mode = 1;\n\/\/ }\n\/\/ mode = (mode % modeCount) + 1;\n\/\/\n\/\/ EEPROM.write(0, mode);\n\/\/ }\n\nvoid setup() {\n FastLED.addLeds<NEOPIXEL, LED_PIN_CH1>(ledsCh0, NUM_LEDS_CH0);\n FastLED.addLeds<NEOPIXEL, LED_PIN_CH2>(ledsCh1, NUM_LEDS_CH1);\n\n Serial.begin(BAUD_RATE);\n\n \/\/ https:\/\/github.com\/FastLED\/FastLED\/wiki\/Power-notes#managing-power-in-fastled\n FastLED.setMaxPowerInVoltsAndMilliamps(5,MAX_MILLIAMPS);\n\n brightnessControl.setup();\n FastLED.setBrightness(brightnessControl.getBrightness());\n\n modeControl.setup();\n\n beatControl.setup();\n\n dropControl.setup();\n\n stateCh0.palette = paletteList.curr();\n patternList.setState(0, &stateCh0);\n\n stateCh1.palette = paletteList.curr();\n patternList.setState(1, &stateCh1);\n\n \/\/ updateModeFromEEPROM();\n}\n\nvoid loop() {\n \/\/ Timing\n unsigned long currentMillis = millis();\n\n \/\/ Mode and Palette\n modeControl.update();\n if(modeControl.rose()) {\n if(modeControl.wasLongPress()) {\n CRGBPalette16 *palette = paletteList.next();\n stateCh0.palette = palette;\n stateCh1.palette = palette;\n } else {\n patternList.next();\n }\n }\n Pattern *currPattern = patternList.curr();\n\n \/\/ Beat\n beatControl.update();\n currPattern->setBpm(beatControl.getBpm());\n currPattern->setOnBeat(beatControl.onBeat());\n currPattern->setBeatProgress(beatControl.beatProgress());\n\n \/\/ Drop\n dropControl.update();\n currPattern->setIsDropping((dropControl.read() == LOW));\n\n \/\/ Accelleration\n int magnitude;\n EVERY_N_MILLISECONDS(100) {\n \/\/ Expensive calc, perform sparingly\n accellerationControl.update();\n magnitude = accellerationControl.getAdjustedMagnitude();\n heartbeat->setMagnitude(magnitude);\n }\n\n \/\/ Patterns\n int frameLength = currPattern->getFrameLength();\n \/\/ Should use EVERY_N_MILLISECONDS, but the C++ macro\n \/\/ can't seem to change values dynamically\n if(currentMillis - previousMillis > frameLength) {\n previousMillis = currentMillis;\n patternList.loop(0);\n\n \/\/ Brightness\n brightnessControl.update();\n FastLED.setBrightness(brightnessControl.getBrightness());\n\n FastLED.show();\n }\n\n}\n<commit_msg>Sanity delay on boot<commit_after>#include <Bounce2.h>\n#include <FastLED.h>\n\/\/ #include <EEPROM.h>\n\n#define DEBUG\n\n#ifdef DEBUG\n #define DEBUG_PRINT(msg) (Serial.println(msg))\n#else\n #define DEBUG_PRINT(msg) ()\n#endif\n\n\/\/ Digital PINs\n#define LED_PIN_CH1 4\n#define LED_PIN_CH2 2\n#define MODE_BUTTON_PIN 6\n#define DROP_BUTTON_PIN 7\n#define BRIGHTNESS_BUTTON_PIN 8\n#define BEAT_BUTTON_PIN 10\n\n\/\/ Analog PINs\n#define ACCELX_PIN A0\n#define ACCELY_PIN A2\n#define ACCELZ_PIN A4\n\n\/\/ Other constants\n#define BAUD_RATE 9600\n#define NUM_LEDS_CH0 120\n#define NUM_LEDS_CH1 29\n#define FRAME_LENGTH 33 \/\/ 30 fps\n#define NUM_STATES 2\n#define MAX_MILLIAMPS 500 \/\/ should run for ~8h on 2x2000maH 18650\n\n#include <Pattern.h>\n#include <PatternList.h>\n#include <PatternState.h>\n#include <PaletteList.h>\n\n#include <Plasma.h>\n#include <Juggle.h>\n#include <Sinelon.h>\n#include <Confetti.h>\n#include <Heartbeat.h>\n#include <Bpm.h>\n\n#include <BrightnessControl.h>\n#include <ModeControl.h>\n#include <BeatControl.h>\n#include <DropControl.h>\n#include <AccellerationControl.h>\n\nCRGB ledsCh0[NUM_LEDS_CH0];\nPatternState stateCh0(NUM_LEDS_CH0, ledsCh0);\n\nCRGB ledsCh1[NUM_LEDS_CH1];\nPatternState stateCh1(NUM_LEDS_CH1, ledsCh1);\n\nHeartbeat *heartbeat = new Heartbeat();\nPattern *patternItems[] = {\n new Bpm(),\n heartbeat,\n new Plasma(),\n new Juggle(),\n new Sinelon(),\n new Confetti()\n};\nPatternList patternList(6, patternItems);\n\nCRGBPalette16 *paletteItems[] = {\n new CRGBPalette16(\n CRGB::Blue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::DarkBlue,\n CRGB::Blue,\n CRGB::DarkBlue,\n CRGB::SkyBlue,\n CRGB::SkyBlue,\n CRGB::LightBlue,\n CRGB::White,\n CRGB::LightBlue,\n CRGB::SkyBlue\n ),\n \/\/ Lava\n new CRGBPalette16(\n CRGB::Black,\n CRGB::Maroon,\n CRGB::Black,\n CRGB::Maroon,\n CRGB::DarkRed,\n CRGB::Maroon,\n CRGB::DarkRed,\n CRGB::DarkRed,\n CRGB::DarkRed,\n CRGB::Red,\n CRGB::Orange,\n CRGB::White,\n CRGB::Orange,\n CRGB::Red,\n CRGB::DarkRed,\n CRGB::Black\n ),\n \/\/ Rainbow\n new CRGBPalette16(\n 0xFF0000, 0xD52A00, 0xAB5500, 0xAB7F00,\n 0xABAB00, 0x56D500, 0x00FF00, 0x00D52A,\n 0x00AB55, 0x0056AA, 0x0000FF, 0x2A00D5,\n 0x5500AB, 0x7F0081, 0xAB0055, 0xD5002B\n )\n};\nPaletteList paletteList(3, paletteItems);\n\n\nBrightnessControl brightnessControl(BRIGHTNESS_BUTTON_PIN);\nModeControl modeControl(MODE_BUTTON_PIN);\nBeatControl beatControl(BEAT_BUTTON_PIN);\nDropControl dropControl(DROP_BUTTON_PIN);\nAccellerationControl accellerationControl(ACCELX_PIN, ACCELY_PIN, ACCELZ_PIN);\n\n\/\/ See https:\/\/learn.adafruit.com\/multi-tasking-the-arduino-part-1\/using-millis-for-timing\nlong previousMillis = 0;\n\n\/\/ \/\/ Cycle mode in persistent memory on every on switch.\n\/\/ \/\/ More resilient against hardware failures than a button.\n\/\/ void updateModeFromEEPROM() {\n\/\/ mode = EEPROM.read(0);\n\/\/ if(!mode) {\n\/\/ mode = 1;\n\/\/ }\n\/\/ mode = (mode % modeCount) + 1;\n\/\/\n\/\/ EEPROM.write(0, mode);\n\/\/ }\n\nvoid setup() {\n \/\/ Sanity delay\n delay(500);\n\n FastLED.addLeds<NEOPIXEL, LED_PIN_CH1>(ledsCh0, NUM_LEDS_CH0);\n FastLED.addLeds<NEOPIXEL, LED_PIN_CH2>(ledsCh1, NUM_LEDS_CH1);\n\n Serial.begin(BAUD_RATE);\n\n \/\/ https:\/\/github.com\/FastLED\/FastLED\/wiki\/Power-notes#managing-power-in-fastled\n FastLED.setMaxPowerInVoltsAndMilliamps(5,MAX_MILLIAMPS);\n\n brightnessControl.setup();\n FastLED.setBrightness(brightnessControl.getBrightness());\n\n modeControl.setup();\n\n beatControl.setup();\n\n dropControl.setup();\n\n stateCh0.palette = paletteList.curr();\n patternList.setState(0, &stateCh0);\n\n stateCh1.palette = paletteList.curr();\n patternList.setState(1, &stateCh1);\n\n \/\/ updateModeFromEEPROM();\n}\n\nvoid loop() {\n \/\/ Timing\n unsigned long currentMillis = millis();\n\n \/\/ Mode and Palette\n modeControl.update();\n if(modeControl.rose()) {\n if(modeControl.wasLongPress()) {\n CRGBPalette16 *palette = paletteList.next();\n stateCh0.palette = palette;\n stateCh1.palette = palette;\n } else {\n patternList.next();\n }\n }\n Pattern *currPattern = patternList.curr();\n\n \/\/ Beat\n beatControl.update();\n currPattern->setBpm(beatControl.getBpm());\n currPattern->setOnBeat(beatControl.onBeat());\n currPattern->setBeatProgress(beatControl.beatProgress());\n\n \/\/ Drop\n dropControl.update();\n currPattern->setIsDropping((dropControl.read() == LOW));\n\n \/\/ Accelleration\n int magnitude;\n EVERY_N_MILLISECONDS(100) {\n \/\/ Expensive calc, perform sparingly\n accellerationControl.update();\n magnitude = accellerationControl.getAdjustedMagnitude();\n heartbeat->setMagnitude(magnitude);\n }\n\n \/\/ Patterns\n int frameLength = currPattern->getFrameLength();\n \/\/ Should use EVERY_N_MILLISECONDS, but the C++ macro\n \/\/ can't seem to change values dynamically\n if(currentMillis - previousMillis > frameLength) {\n previousMillis = currentMillis;\n patternList.loop(0);\n\n \/\/ Brightness\n brightnessControl.update();\n FastLED.setBrightness(brightnessControl.getBrightness());\n\n FastLED.show();\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <SFML\/Graphics.hpp>\n\n#include <Windows.h>\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nShowCmd)\n{\n sf::RenderWindow window(sf::VideoMode(1280, 960), \"WarZone!\");\n\n \/\/ map params\n int width = 40;\n int height = 27;\n int scale = 2;\n int tileSize = 16;\n int menuRows = 3;\n int yOffset = tileSize * menuRows;\n int tileScaled = tileSize * scale;\n int yOffsetScaled = yOffset * scale;\n\n \/\/ grass tile\n sf::Texture grassTex;\n grassTex.loadFromFile(\"assets\/textures\/grass.png\");\n sf::Image grassImg = grassTex.copyToImage();\n\n \/\/ selection graphic\n sf::Texture selectionTex;\n selectionTex.loadFromFile(\"assets\/textures\/selection.png\");\n sf::Sprite selection(selectionTex);\n selection.scale(scale, scale);\n\n \/\/ map graphic\n sf::Texture mapTex;\n mapTex.create(width * tileSize, height * tileSize + yOffset);\n \n for (int y = 0; y < height; ++y)\n for (int x = 0; x < width; ++x)\n mapTex.update(grassImg, x * tileSize, y * tileSize + yOffset);\n\n sf::Sprite map(mapTex);\n map.scale(scale, scale);\n \n \/\/ mouse details\n sf::Vector2i mouse(sf::Mouse::getPosition());\n int gridX = 0; \/\/ mouse coords on map tile grid\n int gridY = 0;\n\n \/\/ main loop\n while (window.isOpen())\n {\n \/\/ event handling\n {\n sf::Event event;\n window.pollEvent(event); \/\/ may drop events, need proper handling\n\n if (event.type == sf::Event::Closed)\n window.close();\n\n if (event.type == sf::Event::KeyPressed)\n {\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Escape))\n window.close();\n }\n\n if (event.type == sf::Event::MouseMoved)\n mouse = sf::Mouse::getPosition(window);\n }\n\n \/\/ update func\n {\n mouse = sf::Mouse::getPosition(window);\n gridX = (mouse.x \/ tileScaled) * tileScaled;\n gridY = (mouse.y \/ tileScaled) * tileScaled;\n \n selection.setPosition(gridX, gridY);\n }\n \n \/\/ render func\n {\n window.clear();\n window.draw(map);\n\n if (gridY >= yOffsetScaled)\n window.draw(selection);\n \n window.display();\n }\n }\n\n return 0;\n}<commit_msg>(Seemingly) fixed event handling<commit_after>#include <SFML\/Graphics.hpp>\n\n#include <Windows.h>\n\nint WINAPI WinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nShowCmd)\n{\n sf::RenderWindow window(sf::VideoMode(1280, 960), \"WarZone!\");\n\n \/\/ map params\n int width = 40;\n int height = 27;\n int scale = 2;\n int tileSize = 16;\n int menuRows = 3;\n int yOffset = tileSize * menuRows;\n int tileScaled = tileSize * scale;\n int yOffsetScaled = yOffset * scale;\n\n \/\/ grass tile\n sf::Texture grassTex;\n grassTex.loadFromFile(\"assets\/textures\/grass.png\");\n sf::Image grassImg = grassTex.copyToImage();\n\n \/\/ selection graphic\n sf::Texture selectionTex;\n selectionTex.loadFromFile(\"assets\/textures\/selection.png\");\n sf::Sprite selection(selectionTex);\n selection.scale(scale, scale);\n\n \/\/ map graphic\n sf::Texture mapTex;\n mapTex.create(width * tileSize, height * tileSize + yOffset);\n \n for (int y = 0; y < height; ++y)\n for (int x = 0; x < width; ++x)\n mapTex.update(grassImg, x * tileSize, y * tileSize + yOffset);\n\n sf::Sprite map(mapTex);\n map.scale(scale, scale);\n \n \/\/ mouse details\n sf::Vector2i mouse(sf::Mouse::getPosition());\n int gridX = 0; \/\/ mouse coords on map tile grid\n int gridY = 0;\n\n \/\/ main loop\n while (window.isOpen())\n {\n \/\/ event handling \n sf::Event event;\n while (window.pollEvent(event))\n {\n if (event.type == sf::Event::Closed)\n window.close();\n\n if (event.type == sf::Event::KeyPressed)\n {\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Escape))\n window.close();\n }\n }\n\n \/\/ update func\n {\n mouse = sf::Mouse::getPosition(window);\n gridX = (mouse.x \/ tileScaled) * tileScaled;\n gridY = (mouse.y \/ tileScaled) * tileScaled;\n \n selection.setPosition(gridX, gridY);\n }\n \n \/\/ render func\n {\n window.clear();\n window.draw(map);\n\n if (gridY >= yOffsetScaled)\n window.draw(selection);\n \n window.display();\n }\n }\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/* The MIT License (MIT)\n *\n * Copyright (c) 2013-2016 Hironori Ishibashi\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n\/**\n * @file main.cpp\n * @author Hironori Ishibashi\n * @brief メイン関数。\n *\/\n\n#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <memory>\n#include <fstream>\n\n#include \"init.h\"\n#include \"chess_engine.h\"\n#include \"uci_shell.h\"\n#include \"params.h\"\n#include \"sayulisp.h\"\n\n\/\/ デバッグスイッチ。\n\/\/ #define SAYURI_DEBUG_dd1bb50e_83bf_4b24_af8b_7c7bf60bc063\n\n\/**\n * UCI出力を標準出力に出力するコールバック関数。\n * @param message UCIShellからのメッセージ。\n *\/\nvoid Print(const std::string& message) {\n std::cout << message << std::endl;\n}\n\n\/**\n * 実行ループ。\n * @param shell 実行するUCIShell。\n *\/\nvoid Run(Sayuri::UCIShell& shell) {\n while (true) {\n std::string input;\n std::getline(std::cin, input);\n\n if (input == \"quit\") {\n break;\n } else {\n shell.InputCommand(input);\n }\n }\n}\n\n\/**\n * メイン関数。\n * @param argc コマンドの引数の数。\n * @param argv コマンドの引数。\n * @return 終了コード。\n *\/\nint main(int argc, char* argv[]) {\n#if defined(SAYURI_DEBUG_dd1bb50e_83bf_4b24_af8b_7c7bf60bc063)\n \/\/ デバッグ用。\n return Sayuri::DebugMain(argc, argv);\n\n#else\n if ((argc >= 2)\n && (std::strcmp(argv[1], \"--help\") == 0)) {\n \/\/ ヘルプの表示。\n std::string usage_str =\nR\"...(Usage:\n $ sayuri [option]\n\n[option]:\n --version\n Shows version.\n\n --license\n Shows license terms.\n\n --help\n Shows help.\n\n --sayulisp <file name>\n Runs Sayuri as Sayulisp Interpreter.\n <file name> is Sayulisp script.\n If <file name> is '-', Sayuri reads script from standard input.)...\";\n std::cout << usage_str << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--version\") == 0)) {\n \/\/ バージョン番号の表示。\n std::cout << Sayuri::ID_NAME << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--license\") == 0)) {\n \/\/ ライセンス分の表示。\n std::cout << Sayuri::LICENSE << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--sayulisp\") == 0)) {\n \/\/ Sayulispモード。\n \/\/ 引数がもう一つ必要。\n if (argc < 3) {\n std::cerr << \"Insufficient arguments. '--sayulisp' needs <file name>.\"\n << std::endl;\n return 1;\n }\n\n \/\/ エンジン初期化。\n Sayuri::Init();\n\n \/\/ Sayurlispを作成。\n std::unique_ptr<Sayuri::Sayulisp>\n sayulisp_ptr(new Sayuri::Sayulisp());\n\n \/\/ 入力ストリームを得る。\n std::istream* stream_ptr = nullptr;\n std::ifstream file;\n if (std::strcmp(argv[2], \"-\") == 0) {\n stream_ptr = &(std::cin);\n } else {\n file.open(argv[2]);\n if (!file) {\n std::cerr << \"Couldn't open '\" << argv[2] << \"'.\" << std::endl;\n return 1;\n }\n stream_ptr = &file;\n }\n\n \/\/ 実行。\n int status = 0;\n try {\n status = sayulisp_ptr->Run(stream_ptr);\n } catch (Sayuri::LispObjectPtr error) {\n return 1;\n }\n\n \/\/ 終了。\n if (file) file.close();\n return status;\n } else {\n \/\/ プログラムの起動。\n \/\/ 初期化。\n Sayuri::Init();\n\n \/\/ エンジン準備。\n std::unique_ptr<Sayuri::SearchParams>\n search_params_ptr(new Sayuri::SearchParams());\n\n std::unique_ptr<Sayuri::EvalParams>\n eval_params_ptr(new Sayuri::EvalParams());\n\n std::unique_ptr<Sayuri::TranspositionTable>\n table_ptr(new Sayuri::TranspositionTable(Sayuri::UCI_DEFAULT_TABLE_SIZE));\n\n std::unique_ptr<Sayuri::ChessEngine>\n engine_ptr(new Sayuri::ChessEngine(*search_params_ptr, *eval_params_ptr,\n *table_ptr));\n\n std::unique_ptr<Sayuri::UCIShell>\n shell_ptr(new Sayuri::UCIShell(*engine_ptr));\n\n shell_ptr->AddOutputListener(Print);\n\n \/\/ エンジン起動。\n Run(*shell_ptr);\n\n \/\/ 後処理。\n Sayuri::Postprocess();\n }\n\n return EXIT_SUCCESS;\n#endif\n}\n<commit_msg>Sayulispでコマンドライン引数が使えるようにした<commit_after>\/* The MIT License (MIT)\n *\n * Copyright (c) 2013-2016 Hironori Ishibashi\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n\/**\n * @file main.cpp\n * @author Hironori Ishibashi\n * @brief メイン関数。\n *\/\n\n#include <iostream>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <memory>\n#include <fstream>\n\n#include \"init.h\"\n#include \"chess_engine.h\"\n#include \"uci_shell.h\"\n#include \"params.h\"\n#include \"sayulisp.h\"\n\n\/\/ デバッグスイッチ。\n\/\/ #define SAYURI_DEBUG_dd1bb50e_83bf_4b24_af8b_7c7bf60bc063\n\n\/**\n * UCI出力を標準出力に出力するコールバック関数。\n * @param message UCIShellからのメッセージ。\n *\/\nvoid Print(const std::string& message) {\n std::cout << message << std::endl;\n}\n\n\/**\n * 実行ループ。\n * @param shell 実行するUCIShell。\n *\/\nvoid Run(Sayuri::UCIShell& shell) {\n while (true) {\n std::string input;\n std::getline(std::cin, input);\n\n if (input == \"quit\") {\n break;\n } else {\n shell.InputCommand(input);\n }\n }\n}\n\n\/**\n * メイン関数。\n * @param argc コマンドの引数の数。\n * @param argv コマンドの引数。\n * @return 終了コード。\n *\/\nint main(int argc, char* argv[]) {\n#if defined(SAYURI_DEBUG_dd1bb50e_83bf_4b24_af8b_7c7bf60bc063)\n \/\/ デバッグ用。\n return Sayuri::DebugMain(argc, argv);\n\n#else\n if ((argc >= 2)\n && (std::strcmp(argv[1], \"--help\") == 0)) {\n \/\/ ヘルプの表示。\n std::string usage_str =\nR\"...(Usage:\n $ sayuri [option]\n\n[option]:\n --version\n Shows version.\n\n --license\n Shows license terms.\n\n --help\n Shows help.\n\n --sayulisp <file name> [<argv>...]\n Runs Sayuri as Sayulisp Interpreter.\n <file name> is Sayulisp script.\n If <file name> is '-', Sayuri reads script from standard input.\n <argv> is bound to Symbol 'argv'.)...\";\n std::cout << usage_str << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--version\") == 0)) {\n \/\/ バージョン番号の表示。\n std::cout << Sayuri::ID_NAME << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--license\") == 0)) {\n \/\/ ライセンス分の表示。\n std::cout << Sayuri::LICENSE << std::endl;\n } else if ((argc >= 2)\n && (std::strcmp(argv[1], \"--sayulisp\") == 0)) {\n \/\/ Sayulispモード。\n \/\/ 引数がもう一つ必要。\n if (argc < 3) {\n std::cerr << \"Insufficient arguments. '--sayulisp' needs <file name>.\"\n << std::endl;\n return 1;\n }\n\n \/\/ エンジン初期化。\n Sayuri::Init();\n\n \/\/ Sayurlispを作成。\n std::unique_ptr<Sayuri::Sayulisp>\n sayulisp_ptr(new Sayuri::Sayulisp());\n\n \/\/ 入力ストリームを得る。\n std::istream* stream_ptr = nullptr;\n std::ifstream file;\n if (std::strcmp(argv[2], \"-\") == 0) {\n stream_ptr = &(std::cin);\n } else {\n file.open(argv[2]);\n if (!file) {\n std::cerr << \"Couldn't open '\" << argv[2] << \"'.\" << std::endl;\n return 1;\n }\n stream_ptr = &file;\n }\n\n \/\/ 引数の作成。\n Sayuri::LispObjectPtr argv_list = Sayuri::Lisp::NewList(argc - 2);\n Sayuri::LispIterator<true> itr {argv_list.get()};\n for (int i = 2; i < argc; ++i, ++itr) {\n itr.current_->car(Sayuri::Lisp::NewString(argv[i]));\n }\n sayulisp_ptr->BindSymbol(\"argv\", argv_list); \/\/ 登録。\n\n \/\/ 実行。\n int status = 0;\n try {\n status = sayulisp_ptr->Run(stream_ptr);\n } catch (Sayuri::LispObjectPtr error) {\n return 1;\n }\n\n \/\/ 終了。\n if (file) file.close();\n return status;\n } else {\n \/\/ プログラムの起動。\n \/\/ 初期化。\n Sayuri::Init();\n\n \/\/ エンジン準備。\n std::unique_ptr<Sayuri::SearchParams>\n search_params_ptr(new Sayuri::SearchParams());\n\n std::unique_ptr<Sayuri::EvalParams>\n eval_params_ptr(new Sayuri::EvalParams());\n\n std::unique_ptr<Sayuri::TranspositionTable>\n table_ptr(new Sayuri::TranspositionTable(Sayuri::UCI_DEFAULT_TABLE_SIZE));\n\n std::unique_ptr<Sayuri::ChessEngine>\n engine_ptr(new Sayuri::ChessEngine(*search_params_ptr, *eval_params_ptr,\n *table_ptr));\n\n std::unique_ptr<Sayuri::UCIShell>\n shell_ptr(new Sayuri::UCIShell(*engine_ptr));\n\n shell_ptr->AddOutputListener(Print);\n\n \/\/ エンジン起動。\n Run(*shell_ptr);\n\n \/\/ 後処理。\n Sayuri::Postprocess();\n }\n\n return EXIT_SUCCESS;\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QUrl>\n#include <QDebug>\n#include <QTimer>\n#include <QCoreApplication>\n#include <QCommandLineParser>\n\n#include \"Util.h\"\n#include \"Version.h\"\n#include \"Downloader.h\"\n\nint main(int argc, char **argv) {\n QCoreApplication app(argc, argv);\n QCoreApplication::setApplicationName(\"efdl\");\n QCoreApplication::setApplicationVersion(versionString(false));\n\n QCommandLineParser parser;\n parser.setApplicationDescription(QObject::tr(\"Efficient downloading application.\"));\n parser.addHelpOption();\n parser.addVersionOption();\n parser.addPositionalArgument(\"URL\", QObject::tr(\"URL to download.\"));\n\n QCommandLineOption connsOpt(QStringList{\"c\", \"conns\"},\n QObject::tr(\"Number of simultaneous connections to\"\n \" use. (defaults to 1)\"),\n QObject::tr(\"num\"));\n parser.addOption(connsOpt);\n\n QCommandLineOption confirmOpt(QStringList{\"confirm\"},\n QObject::tr(\"Confirm to download on redirections.\"));\n parser.addOption(confirmOpt);\n\n QCommandLineOption verboseOpt(QStringList{\"verbose\"},\n QObject::tr(\"Verbose mode.\"));\n parser.addOption(verboseOpt);\n\n QCommandLineOption chunksOpt(QStringList{\"chunks\"},\n QObject::tr(\"Number of chunks to split the download\"\n \"up into. Cannot be used with --chunk-size.\"),\n QObject::tr(\"num\"));\n parser.addOption(chunksOpt);\n\n QCommandLineOption chunkSizeOpt(QStringList{\"chunk-size\"},\n QObject::tr(\"Size of each chunk which dictates \"\n \"how many to use. Cannot be used with --chunks.\"),\n QObject::tr(\"bytes\"));\n parser.addOption(chunkSizeOpt);\n\n \/\/ Process CLI arguments.\n parser.process(app);\n const QStringList args = parser.positionalArguments();\n if (args.size() != 1) {\n parser.showHelp(-1);\n }\n\n int conns = 1, chunks = -1, chunkSize = -1;\n bool confirm = parser.isSet(confirmOpt),\n verbose = parser.isSet(verboseOpt);\n\n bool ok;\n if (parser.isSet(connsOpt)) {\n conns = parser.value(connsOpt).toInt(&ok);\n if (!ok || conns <= 0) {\n qCritical() << \"ERROR Number of connections must be a positive number!\";\n return -1;\n }\n }\n\n if (parser.isSet(chunksOpt)) {\n chunks = parser.value(chunksOpt).toInt(&ok);\n if (!ok || chunks <= 0) {\n qCritical() << \"ERROR Number of chunks must be a positive number!\";\n return -1;\n }\n }\n\n if (parser.isSet(chunkSizeOpt)) {\n chunkSize = parser.value(chunkSizeOpt).toInt(&ok);\n if (!ok || chunkSize <= 0) {\n qCritical() << \"ERROR Chunk size must be a positive number!\";\n return -1;\n }\n }\n\n if (chunks != -1 && chunkSize != -1) {\n qCritical() << \"ERROR --chunks and --chunk-size cannot be used at the same time!\";\n return -1;\n }\n\n QUrl url{args[0], QUrl::StrictMode};\n if (!url.isValid()) {\n qCritical() << \"ERROR Invalid URL!\";\n return -1;\n }\n\n const QStringList schemes{\"http\", \"https\"};\n if (!schemes.contains(url.scheme().toLower())) {\n qCritical() << \"ERROR Invalid scheme! Valid ones are:\" <<\n qPrintable(schemes.join(\" \"));\n return -1;\n }\n\n Util::registerCustomTypes();\n\n \/\/ Begin transfer in event loop.\n Downloader dl{url, conns, chunks, chunkSize, confirm, verbose};\n QObject::connect(&dl, &Downloader::finished, &app, &QCoreApplication::quit);\n QTimer::singleShot(0, &dl, SLOT(start()));\n\n return app.exec();\n}\n<commit_msg>Reordering of command line arguments in usage print.<commit_after>#include <QUrl>\n#include <QDebug>\n#include <QTimer>\n#include <QCoreApplication>\n#include <QCommandLineParser>\n\n#include \"Util.h\"\n#include \"Version.h\"\n#include \"Downloader.h\"\n\nint main(int argc, char **argv) {\n QCoreApplication app(argc, argv);\n QCoreApplication::setApplicationName(\"efdl\");\n QCoreApplication::setApplicationVersion(versionString(false));\n\n QCommandLineParser parser;\n parser.setApplicationDescription(QObject::tr(\"Efficient downloading application.\"));\n parser.addHelpOption();\n parser.addVersionOption();\n parser.addPositionalArgument(\"URL\", QObject::tr(\"URL to download.\"));\n\n QCommandLineOption verboseOpt(QStringList{\"verbose\"},\n QObject::tr(\"Verbose mode.\"));\n parser.addOption(verboseOpt);\n\n QCommandLineOption confirmOpt(QStringList{\"confirm\"},\n QObject::tr(\"Confirm to download on redirections.\"));\n parser.addOption(confirmOpt);\n\n QCommandLineOption connsOpt(QStringList{\"c\", \"conns\"},\n QObject::tr(\"Number of simultaneous connections to\"\n \" use. (defaults to 1)\"),\n QObject::tr(\"num\"));\n parser.addOption(connsOpt);\n\n QCommandLineOption chunksOpt(QStringList{\"chunks\"},\n QObject::tr(\"Number of chunks to split the download\"\n \"up into. Cannot be used with --chunk-size.\"),\n QObject::tr(\"num\"));\n parser.addOption(chunksOpt);\n\n QCommandLineOption chunkSizeOpt(QStringList{\"chunk-size\"},\n QObject::tr(\"Size of each chunk which dictates \"\n \"how many to use. Cannot be used with --chunks.\"),\n QObject::tr(\"bytes\"));\n parser.addOption(chunkSizeOpt);\n\n \/\/ Process CLI arguments.\n parser.process(app);\n const QStringList args = parser.positionalArguments();\n if (args.size() != 1) {\n parser.showHelp(-1);\n }\n\n int conns = 1, chunks = -1, chunkSize = -1;\n bool confirm = parser.isSet(confirmOpt),\n verbose = parser.isSet(verboseOpt);\n\n bool ok;\n if (parser.isSet(connsOpt)) {\n conns = parser.value(connsOpt).toInt(&ok);\n if (!ok || conns <= 0) {\n qCritical() << \"ERROR Number of connections must be a positive number!\";\n return -1;\n }\n }\n\n if (parser.isSet(chunksOpt)) {\n chunks = parser.value(chunksOpt).toInt(&ok);\n if (!ok || chunks <= 0) {\n qCritical() << \"ERROR Number of chunks must be a positive number!\";\n return -1;\n }\n }\n\n if (parser.isSet(chunkSizeOpt)) {\n chunkSize = parser.value(chunkSizeOpt).toInt(&ok);\n if (!ok || chunkSize <= 0) {\n qCritical() << \"ERROR Chunk size must be a positive number!\";\n return -1;\n }\n }\n\n if (chunks != -1 && chunkSize != -1) {\n qCritical() << \"ERROR --chunks and --chunk-size cannot be used at the same time!\";\n return -1;\n }\n\n QUrl url{args[0], QUrl::StrictMode};\n if (!url.isValid()) {\n qCritical() << \"ERROR Invalid URL!\";\n return -1;\n }\n\n const QStringList schemes{\"http\", \"https\"};\n if (!schemes.contains(url.scheme().toLower())) {\n qCritical() << \"ERROR Invalid scheme! Valid ones are:\" <<\n qPrintable(schemes.join(\" \"));\n return -1;\n }\n\n Util::registerCustomTypes();\n\n \/\/ Begin transfer in event loop.\n Downloader dl{url, conns, chunks, chunkSize, confirm, verbose};\n QObject::connect(&dl, &Downloader::finished, &app, &QCoreApplication::quit);\n QTimer::singleShot(0, &dl, SLOT(start()));\n\n return app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"libtg.hpp\"\n\nusing namespace std;\n\n\/\/ argv[0]\nstring exe;\n\nvoid usage() {\n cerr << \"Usage mode: \" << exe << \" [options...] \\n\";\n cerr << endl;\n cerr << \"I\/O options:\\n\";\n cerr << \"\\t-i\\t<file path>\\tRead formula from file.\\n\";\n cerr << \"\\t-oinfo\\t<file path>\\tAppend formula information to file.\\n\";\n cerr << \"\\t-ocnf\\t<file path>\\tWrite CNF to file.\\n\";\n cerr << \"\\t-oproof\\t<file path>\\tWrite proof formula to file.\\n\";\n cerr << endl;\n cerr << \"Pipeline options:\\n\";\n cerr << \"\\t-f\\tFlat ((p|(q|r)|s) ---> (p|q|r|s)). Before DAG.\\n\";\n cerr << \"\\t-m\\tMinimize DAG edges ((p&q)|(p&r&q) ---> (p&q)|((p&q)&r)).\\n\";\n cerr << \"\\t-a\\t<algorithm number>\\tSelect renaming algorithm.\\n\";\n cerr << \"\\t-s\\tSimplify CNF. (see note 1)\\n\";\n cerr << \"\\t-ionly\\tOnly compute formula information.\\n\";\n cerr << endl;\n cerr << \"Additional options:\\n\";\n cerr << \"\\t-h\\tDisplay usage mode.\\n\";\n cerr << \"\\t-syntax\\tDisplay formula syntax.\\n\";\n cerr << endl;\n cerr << \"Renaming algorithms (see note 2):\\n\";\n cerr << \"\\t1\\tKnapsack 0-1 based algorithm.\\n\";\n cerr << \"\\t2\\tBoy de la Tour's algorithm.\\n\";\n cerr << endl;\n cerr << \"Notes:\\n\";\n cerr << \"\\t1) CNF simplification removes tautologies, repeated literals\\n\";\n cerr << \"\\tand repeated clauses.\\n\";\n cerr << \"\\t2) If option -a is not set or an invalid algorithm is passed,\\n\";\n cerr << \"\\tthen no renaming will happen at all.\\n\";\n cerr << \"\\t3) Formula information format:\\n\";\n cerr << \"\\t<file path>,<size>,<number of clauses>,<number of symbols>,\\n\";\n cerr << endl;\n exit(-1);\n}\n\nvoid syntax() {\n cerr << exe << \": Formula syntax.\\n\";\n cerr << endl;\n cerr << \"Propositional symbols are strings of one or more of the following\\n\";\n cerr << \"ASCII characters:\\n\";\n cerr << \"\\t_\\t(underscore)\\n\";\n cerr << \"\\t0 to 9\\t(decimal digits)\\n\";\n cerr << \"\\ta to z\\t(lowercase letters)\\n\";\n cerr << \"\\tA to Z\\t(uppercase letters)\\n\";\n cerr << endl;\n cerr << \"Logic connectives are the following strings of ASCII characters:\\n\";\n cerr << \"\\t~\\t(tilde)\\t\\t\\t\\t\\t\\tNegation.\\n\";\n cerr << \"\\t&\\t(ampersand)\\t\\t\\t\\t\\tConjunction.\\n\";\n cerr << \"\\t|\\t(pipe)\\t\\t\\t\\t\\t\\tDisjunction.\\n\";\n cerr << \"\\t=>\\t(equals and greater than signs)\\t\\t\\tImplication.\\n\";\n cerr << \"\\t<=>\\t(less than, equals and greater than signs)\\tEquivalence.\\n\";\n cerr << endl;\n cerr << \"Notes:\\n\";\n cerr << \"\\t1) Only one line is read by the parser.\\n\";\n cerr << \"\\t2) Whitespaces and multiple parentheses are completely ignored.\\n\";\n cerr << \"\\tExample:\\n\";\n cerr << \"\\t\\t(((p => q)))\\tis the same as\\t\\tp=>q\\n\";\n cerr << endl;\n exit(-1);\n}\n\nclass Args {\n private:\n int argc;\n char** argv;\n unordered_map<string,int> idx;\n public:\n void init(int argc, char** argv) {\n this->argc = argc;\n this->argv = argv;\n for (int i = argc-1; 1 <= i; i--) idx[argv[i]] = i;\n }\n bool find(const string& str) const {\n return idx.find(str) != idx.end();\n }\n template <typename T>\n T opt(const string& name) const {\n auto it = idx.find(name);\n if (it == idx.end()) usage();\n int i = it->second+1;\n if (argc <= i) usage();\n stringstream ss;\n ss << argv[i];\n T ret;\n ss >> ret;\n if (ss.fail()) usage();\n return ret;\n }\n void checkflag(const string& name) const {\n if (!find(name)) usage();\n }\n template <typename T>\n void checkopt(const string& name, bool required = false) const {\n if (find(name)) opt<T>(name);\n else if (required) usage();\n }\n} args;\n\n\/\/ files\nunordered_map<string,fstream*> files;\nostream& get_output_stream(const string& name, bool append = false) {\n if (!args.find(\"-o\"+name)) return cout;\n string fn = args.opt<string>(\"-o\"+name);\n auto it = files.find(fn);\n if (it != files.end()) return (ostream&)*it->second;\n fstream::openmode md = fstream::out;\n if (append) md = md | fstream::app;\n fstream* file = new fstream(fn,md);\n if (!file->is_open()) {\n cerr << exe << \": \";\n cerr << \"error opening `\" << fn << \"' for \" << name << \" output.\\n\";\n exit(-1);\n }\n files[fn] = file;\n return (ostream&)*file;\n}\nvoid close_files() {\n for (auto& kv : files) {\n kv.second->close();\n delete kv.second;\n }\n}\n\nint main(int argc, char** argv) {\n \/\/ init args\n exe = argv[0];\n args.init(argc,argv);\n \n \/\/ display help\n if (args.find(\"-h\")) usage();\n if (args.find(\"-syntax\")) syntax();\n \n \/\/ init input stream\n string in_fn = \"stdin\";\n if (args.find(\"-i\")) {\n in_fn = args.opt<string>(\"-i\");\n if (!freopen(in_fn.c_str(),\"r\",stdin)) {\n cerr << exe << \": `\" << in_fn << \"' not found.\\n\";\n return -1;\n }\n reverse(in_fn.begin(),in_fn.end());\n auto pos = in_fn.find(\"\/\");\n if (pos != string::npos) in_fn = in_fn.substr(0,pos);\n reverse(in_fn.begin(),in_fn.end());\n }\n \n \/\/ init output streams\n ostream& info_stream = get_output_stream(\"info\", true);\n ostream& cnf_stream = get_output_stream(\"cnf\");\n ostream& proof_stream = get_output_stream(\"proof\");\n \n \/\/ additional argument checks\n args.checkopt<int>(\"-a\");\n \n \/\/ input\n getline(cin,raw);\n parse();\n stringstream ss;\n ss << T;\n string original = ss.str();\n \n \/\/ info only\n if (args.find(\"-ionly\")) {\n info_stream << in_fn << \",\";\n info_stream << size(T) << \",\";\n info_stream << clauses(T) << \",\";\n info_stream << symbols(T) << \",\\n\";\n cnf_stream << original << endl;\n close_files();\n return 0;\n }\n \n \/\/ pipeline\n nnf();\n if (args.find(\"-f\")) flat();\n dag();\n if (args.find(\"-m\")) mindag();\n if (args.find(\"-a\")) switch (args.opt<int>(\"-a\")) {\n case 1: knapsack(); break;\n case 2: boydelatour(); break;\n }\n rename();\n if (args.find(\"-s\")) simplecnf();\n else cnf();\n \n \/\/ output\n info_stream << in_fn << \",\";\n info_stream << CNF.size() << \",\";\n info_stream << CNF.clauses() << \",\";\n info_stream << CNF.symbols() << \",\\n\";\n cnf_stream << CNF << endl;\n proof_stream << \"-((\" << original << \") <-> (\" << CNF << \"))\\n\";\n \n close_files();\n \n return 0;\n}\n<commit_msg>Adapting output<commit_after>#include \"libtg.hpp\"\n\nusing namespace std;\n\n\/\/ argv[0]\nstring exe;\n\nvoid usage() {\n cerr << \"Usage mode: \" << exe << \" [options...] \\n\";\n cerr << endl;\n cerr << \"I\/O options:\\n\";\n cerr << \"\\t-i\\t<file path>\\tRead formula from file.\\n\";\n cerr << \"\\t-oinfo\\t<file path>\\tAppend formula information to file.\\n\";\n cerr << \"\\t-ocnf\\t<file path>\\tWrite CNF to file.\\n\";\n cerr << \"\\t-oproof\\t<file path>\\tWrite proof formula to file.\\n\";\n cerr << endl;\n cerr << \"Pipeline options:\\n\";\n cerr << \"\\t-f\\tFlat ((p|(q|r)|s) ---> (p|q|r|s)). Before DAG.\\n\";\n cerr << \"\\t-m\\tMinimize DAG edges ((p&q)|(p&r&q) ---> (p&q)|((p&q)&r)).\\n\";\n cerr << \"\\t-a\\t<algorithm number>\\tSelect renaming algorithm.\\n\";\n cerr << \"\\t-s\\tSimplify CNF. (see note 1)\\n\";\n cerr << \"\\t-ionly\\tOnly compute formula information.\\n\";\n cerr << endl;\n cerr << \"Additional options:\\n\";\n cerr << \"\\t-h\\tDisplay usage mode.\\n\";\n cerr << \"\\t-syntax\\tDisplay formula syntax.\\n\";\n cerr << endl;\n cerr << \"Renaming algorithms (see note 2):\\n\";\n cerr << \"\\t1\\tKnapsack 0-1 based algorithm.\\n\";\n cerr << \"\\t2\\tBoy de la Tour's algorithm.\\n\";\n cerr << endl;\n cerr << \"Notes:\\n\";\n cerr << \"\\t1) CNF simplification removes tautologies, repeated literals\\n\";\n cerr << \"\\tand repeated clauses.\\n\";\n cerr << \"\\t2) If option -a is not set or an invalid algorithm is passed,\\n\";\n cerr << \"\\tthen no renaming will happen at all.\\n\";\n cerr << \"\\t3) Formula information format:\\n\";\n cerr << \"\\t<file path>,<size>,<number of clauses>,<number of symbols>,\\n\";\n cerr << endl;\n exit(-1);\n}\n\nvoid syntax() {\n cerr << exe << \": Formula syntax.\\n\";\n cerr << endl;\n cerr << \"Propositional symbols are strings of one or more of the following\\n\";\n cerr << \"ASCII characters:\\n\";\n cerr << \"\\t_\\t(underscore)\\n\";\n cerr << \"\\t0 to 9\\t(decimal digits)\\n\";\n cerr << \"\\ta to z\\t(lowercase letters)\\n\";\n cerr << \"\\tA to Z\\t(uppercase letters)\\n\";\n cerr << endl;\n cerr << \"Logic connectives are the following strings of ASCII characters:\\n\";\n cerr << \"\\t~\\t(tilde)\\t\\t\\t\\t\\t\\tNegation.\\n\";\n cerr << \"\\t&\\t(ampersand)\\t\\t\\t\\t\\tConjunction.\\n\";\n cerr << \"\\t|\\t(pipe)\\t\\t\\t\\t\\t\\tDisjunction.\\n\";\n cerr << \"\\t=>\\t(equals and greater than signs)\\t\\t\\tImplication.\\n\";\n cerr << \"\\t<=>\\t(less than, equals and greater than signs)\\tEquivalence.\\n\";\n cerr << endl;\n cerr << \"Notes:\\n\";\n cerr << \"\\t1) Only one line is read by the parser.\\n\";\n cerr << \"\\t2) Whitespaces and multiple parentheses are completely ignored.\\n\";\n cerr << \"\\tExample:\\n\";\n cerr << \"\\t\\t(((p => q)))\\tis the same as\\t\\tp=>q\\n\";\n cerr << endl;\n exit(-1);\n}\n\nclass Args {\n private:\n int argc;\n char** argv;\n unordered_map<string,int> idx;\n public:\n void init(int argc, char** argv) {\n this->argc = argc;\n this->argv = argv;\n for (int i = argc-1; 1 <= i; i--) idx[argv[i]] = i;\n }\n bool find(const string& str) const {\n return idx.find(str) != idx.end();\n }\n template <typename T>\n T opt(const string& name) const {\n auto it = idx.find(name);\n if (it == idx.end()) usage();\n int i = it->second+1;\n if (argc <= i) usage();\n stringstream ss;\n ss << argv[i];\n T ret;\n ss >> ret;\n if (ss.fail()) usage();\n return ret;\n }\n void checkflag(const string& name) const {\n if (!find(name)) usage();\n }\n template <typename T>\n void checkopt(const string& name, bool required = false) const {\n if (find(name)) opt<T>(name);\n else if (required) usage();\n }\n} args;\n\n\/\/ files\nunordered_map<string,fstream*> files;\nostream& get_output_stream(const string& name, bool append = false) {\n if (!args.find(\"-o\"+name)) return cout;\n string fn = args.opt<string>(\"-o\"+name);\n auto it = files.find(fn);\n if (it != files.end()) return (ostream&)*it->second;\n fstream::openmode md = fstream::out;\n if (append) md = md | fstream::app;\n fstream* file = new fstream(fn,md);\n if (!file->is_open()) {\n cerr << exe << \": \";\n cerr << \"error opening `\" << fn << \"' for \" << name << \" output.\\n\";\n exit(-1);\n }\n files[fn] = file;\n return (ostream&)*file;\n}\nvoid close_files() {\n for (auto& kv : files) {\n kv.second->close();\n delete kv.second;\n }\n}\n\nint main(int argc, char** argv) {\n \/\/ init args\n exe = argv[0];\n args.init(argc,argv);\n \n \/\/ display help\n if (args.find(\"-h\")) usage();\n if (args.find(\"-syntax\")) syntax();\n \n \/\/ init input stream\n string in_fn = \"stdin\";\n if (args.find(\"-i\")) {\n in_fn = args.opt<string>(\"-i\");\n if (!freopen(in_fn.c_str(),\"r\",stdin)) {\n cerr << exe << \": `\" << in_fn << \"' not found.\\n\";\n return -1;\n }\n reverse(in_fn.begin(),in_fn.end());\n auto pos = in_fn.find(\"\/\");\n if (pos != string::npos) in_fn = in_fn.substr(0,pos);\n reverse(in_fn.begin(),in_fn.end());\n }\n \n \/\/ init output streams\n ostream& info_stream = get_output_stream(\"info\", true);\n ostream& cnf_stream = get_output_stream(\"cnf\");\n ostream& proof_stream = get_output_stream(\"proof\");\n \n \/\/ additional argument checks\n args.checkopt<int>(\"-a\");\n \n \/\/ input\n getline(cin,raw);\n parse();\n stringstream ss;\n ss << T;\n string original = ss.str();\n \n \/\/ info only\n if (args.find(\"-ionly\")) {\n info_stream << in_fn << \",\";\n info_stream << size(T) << \",\";\n info_stream << clauses(T) << \",\";\n info_stream << symbols(T) << \",\\n\";\n cnf_stream << original << endl;\n close_files();\n return 0;\n }\n \n \/\/ pipeline\n nnf();\n if (args.find(\"-f\")) flat();\n dag();\n if (args.find(\"-m\")) mindag();\n if (args.find(\"-a\")) switch (args.opt<int>(\"-a\")) {\n case 1: knapsack(); break;\n case 2: boydelatour(); break;\n }\n rename();\n if (args.find(\"-s\")) simplecnf();\n else cnf();\n \n \/\/ output\n info_stream << in_fn << \",\";\n info_stream << CNF.size() << \",\";\n info_stream << CNF.clauses() << \",\";\n info_stream << CNF.symbols() << \",\\n\";\n cnf_stream << CNF << endl;\n proof_stream << \"formulas(sos).\\n\";\n proof_stream << \" -((\" << original << \") <-> (\" << CNF << \"))\\n\";\n proof_stream << \"end_of_list.\\n\";\n \n close_files();\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2014, Patricio Gonzalez Vivo\nAll rights reserved.\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the copyright holder nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <sys\/shm.h>\n#include <sys\/stat.h> \n#include <unistd.h>\n#include <signal.h>\n#include <map>\n\n#include \"app.h\"\n#include \"utils.h\"\n#include \"gl\/shader.h\"\n#include \"gl\/vbo.h\"\n#include \"gl\/texture.h\"\n#include \"3d\/camera.h\"\n#include \"types\/shapes.h\"\n\n#include \"ui\/cursor.h\"\n\n\/\/ GLOBAL VARIABLES\n\/\/============================================================================\n\/\/\nstatic bool bPlay = true;\n\n\/\/ List of FILES to watch and the variable to communicate that between process\nstruct WatchFile {\n std::string type;\n std::string path;\n int lastChange;\n};\nstd::vector<WatchFile> files;\nint* iHasChanged;\n\n\/\/ SHADER\nShader shader;\nint iFrag = -1;\nstd::string fragSource = \"\";\nint iVert = -1;\nstd::string vertSource = \"\";\n\n\/\/ CAMERA\nCamera cam;\nfloat lat = 180.0;\nfloat lon = 0.0;\n\n\/\/ ASSETS\nVbo* vbo;\nint iGeom = -1;\nglm::mat4 model_matrix = glm::mat4(1.);\n\nstd::map<std::string,Texture*> textures;\nstd::string outputFile = \"\";\n\n\/\/ CURSOR\nCursor cursor;\nbool bCursor = false;\n\n\/\/ Time limit\nfloat timeLimit = 0.0f;\n\n\/\/================================================================= Functions\nvoid watchThread();\nvoid onFileChange();\n\nvoid renderThread(int argc, char **argv);\nvoid setup();\nvoid draw();\nvoid onExit();\n\n\/\/ Main program\n\/\/============================================================================\nint main(int argc, char **argv){\n\n \/\/ Load files to watch\n struct stat st;\n for (uint i = 1; i < argc ; i++){\n std::string argument = std::string(argv[i]);\n\n if ( iFrag == -1 && ( haveExt(argument,\"frag\") || haveExt(argument,\"fs\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argv[i] << std::endl;\n } else {\n WatchFile file;\n file.type = \"fragment\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iFrag = files.size()-1;\n }\n } else if ( iVert == -1 && ( haveExt(argument,\"vert\") || haveExt(argument,\"vs\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"vertex\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iVert = files.size()-1;\n }\n } else if ( iGeom == -1 && \n ( haveExt(argument,\"ply\") || haveExt(argument,\"PLY\") ||\n haveExt(argument,\"obj\") || haveExt(argument,\"OBJ\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"geometry\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iGeom = files.size()-1;\n }\n } else if ( haveExt(argument,\"png\") || haveExt(argument,\"PNG\") ||\n haveExt(argument,\"jpg\") || haveExt(argument,\"JPG\") || \n haveExt(argument,\"jpeg\") || haveExt(argument,\"JPEG\") ){\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n \/\/ std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"image\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n }\n }\n }\n\n \/\/ If no shader\n if( iFrag == -1 && iVert == -1 && iGeom == -1) {\n std::cerr << \"Usage: \" << argv[0] << \" shader.frag [shader.vert] [mesh.(obj\/.ply)] [texture.(png\/jpg)] [-textureNameA texture.(png\/jpg)] [-u] [-x x] [-y y] [-w width] [-h height] [-l\/--livecoding] [--square] [-s seconds] [-o screenshot.png]\\n\";\n return EXIT_FAILURE;\n }\n\n \/\/ Fork process with a shared variable\n \/\/\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n pid_t pid = fork();\n iHasChanged = (int *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *iHasChanged = -1;\n watchThread();\n }\n break;\n\n default: \n {\n \/\/ Initialize openGL context\n initGL(argc,argv);\n\n \/\/ OpenGL Render Loop\n renderThread(argc,argv);\n \n \/\/ Kill the iNotify watcher once you finish\n kill(pid, SIGKILL);\n onExit();\n }\n break;\n }\n \n shmctl(shmId, IPC_RMID, NULL);\n return 0;\n}\n\n\/\/ Watching Thread\n\/\/============================================================================\nvoid watchThread() {\n struct stat st;\n while(1){\n for(uint i = 0; i < files.size(); i++){\n if( *iHasChanged == -1 ){\n stat(files[i].path.c_str(), &st);\n int date = st.st_mtime;\n if (date != files[i].lastChange ){\n *iHasChanged = i;\n files[i].lastChange = date;\n }\n usleep(500000);\n }\n }\n }\n}\n\nvoid renderThread(int argc, char **argv) {\n \/\/ Prepare viewport\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n glClear(GL_COLOR_BUFFER_BIT );\n \n \/\/ Setup\n setup();\n\n \/\/ Turn on Alpha blending\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);\n\n \/\/ Clear the background\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n int textureCounter = 0;\n\n \/\/Load the the resources (textures)\n for (uint i = 1; i < argc ; i++){\n std::string argument = std::string(argv[i]);\n\n if (argument == \"-x\" || argument == \"-y\" || \n argument == \"-w\" || argument == \"--width\" || \n argument == \"-h\" || argument == \"--height\" ) {\n i++;\n } else if ( argument == \"--square\" ||\n argument == \"-l\" || \n argument == \"--life-coding\" ) {\n\n } else if ( argument == \"-m\" ) {\n bCursor = true;\n cursor.init();\n } else if ( argument == \"-s\" || argument == \"--sec\") {\n i++;\n argument = std::string(argv[i]);\n timeLimit = getFloat(argument);\n std::cout << \"Will exit in \" << timeLimit << \" seconds.\" << std::endl;\n } else if ( argument == \"-o\" ){\n i++;\n argument = std::string(argv[i]);\n if( haveExt(argument,\"png\") ){\n outputFile = argument;\n std::cout << \"Will save screenshot to \" << outputFile << \" on exit.\" << std::endl; \n } else {\n std::cout << \"At the moment screenshots only support PNG formats\" << std::endl;\n }\n\n } else if (argument.find(\"-\") == 0) {\n std::string parameterPair = argument.substr(argument.find_last_of('-')+1);\n\n i++;\n argument = std::string(argv[i]);\n Texture* tex = new Texture();\n if( tex->load(argument) ){\n textures[parameterPair] = tex;\n std::cout << \"Loading \" << argument << \" as the following uniform: \" << std::endl;\n std::cout << \" uniform sampler2D u_\" << parameterPair << \"; \/\/ loaded\"<< std::endl;\n std::cout << \" uniform vec2 u_\" << parameterPair << \"Resolution;\"<< std::endl;\n }\n\n } else if ( haveExt(argument,\"png\") || haveExt(argument,\"PNG\") ||\n haveExt(argument,\"jpg\") || haveExt(argument,\"JPG\") || \n haveExt(argument,\"jpeg\") || haveExt(argument,\"JPEG\") ) {\n\n Texture* tex = new Texture();\n if( tex->load(argument) ){\n std::string name = \"u_tex\"+getString(textureCounter);\n textures[name] = tex;\n std::cout << \"Loading \" << argument << \" as the following uniform: \" << std::endl;\n std::cout << \" uniform sampler2D \" << name << \"; \/\/ loaded\"<< std::endl;\n std::cout << \" uniform vec2 \" << name << \"Resolution;\"<< std::endl;\n textureCounter++;\n }\n }\n }\n\n \/\/ Render Loop\n while (isGL() && bPlay) {\n \/\/ Update\n updateGL();\n \n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ Draw\n draw();\n \n \/\/ Swap the buffers\n renderGL();\n\n if ( timeLimit > 0.0 && getTime() > timeLimit ) {\n onKeyPress('s');\n bPlay = false;\n }\n }\n}\n\nvoid setup() {\n glEnable(GL_DEPTH_TEST);\n glFrontFace(GL_CCW);\n \n \/\/ Load Geometry\n \/\/\n if ( iGeom == -1 ){\n vbo = rect(0.0,0.0,1.0,1.0).getVbo();\n } else {\n Mesh model;\n model.load(files[iGeom].path);\n vbo = model.getVbo();\n glm::vec3 toCentroid = getCentroid(model.getVertices());\n \/\/ model_matrix = glm::scale(glm::vec3(0.001));\n model_matrix = glm::translate(-toCentroid);\n }\n\n \/\/ Build shader;\n \/\/\n if ( iFrag != -1 ) {\n fragSource = \"\";\n if(!loadFromPath(files[iFrag].path, &fragSource)) {\n return;\n }\n } else {\n fragSource = vbo->getVertexLayout()->getDefaultFragShader();\n }\n\n if ( iVert != -1 ) {\n vertSource = \"\";\n loadFromPath(files[iVert].path, &vertSource);\n } else {\n vertSource = vbo->getVertexLayout()->getDefaultVertShader();\n } \n shader.load(fragSource,vertSource);\n \n cam.setViewport(getWindowWidth(),getWindowHeight());\n cam.setPosition(glm::vec3(0.0,0.0,-3.));\n}\n\nvoid draw(){\n\n \/\/ Something change??\n if(*iHasChanged != -1) {\n onFileChange();\n *iHasChanged = -1;\n }\n\n shader.use();\n shader.setUniform(\"u_time\", getTime());\n shader.setUniform(\"u_mouse\", getMouseX(), getMouseY());\n shader.setUniform(\"u_resolution\",getWindowWidth(), getWindowHeight());\n\n glm::mat4 mvp = glm::mat4(1.);\n if (iGeom != -1) {\n shader.setUniform(\"u_eye\", -cam.getPosition());\n shader.setUniform(\"u_normalMatrix\", cam.getNormalMatrix());\n\n shader.setUniform(\"u_modelMatrix\", model_matrix);\n shader.setUniform(\"u_viewMatrix\", cam.getViewMatrix());\n shader.setUniform(\"u_projectionMatrix\", cam.getProjectionMatrix());\n \n mvp = cam.getProjectionViewMatrix() * model_matrix;\n }\n shader.setUniform(\"u_modelViewProjectionMatrix\", mvp);\n\n unsigned int index = 0;\n for (std::map<std::string,Texture*>::iterator it = textures.begin(); it!=textures.end(); ++it) {\n shader.setUniform(it->first,it->second,index);\n shader.setUniform(it->first+\"Resolution\",it->second->getWidth(),it->second->getHeight());\n index++;\n }\n\n vbo->draw(&shader);\n\n if(bCursor){\n cursor.draw();\n }\n}\n\n\/\/ Rendering Thread\n\/\/============================================================================\nvoid onFileChange(){\n std::string type = files[*iHasChanged].type;\n std::string path = files[*iHasChanged].path;\n\n if ( type == \"fragment\" ){\n fragSource = \"\";\n if(loadFromPath(path, &fragSource)){\n shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n shader.load(fragSource,vertSource);\n }\n } else if ( type == \"vertex\" ){\n vertSource = \"\";\n if(loadFromPath(path, &vertSource)){\n shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n shader.load(fragSource,vertSource);\n }\n } else if ( type == \"geometry\" ){\n \/\/ TODO\n } else if ( type == \"image\" ){\n for (std::map<std::string,Texture*>::iterator it = textures.begin(); it!=textures.end(); ++it) {\n if ( path == it->second->getFilePath() ){\n it->second->load(path);\n break;\n }\n }\n } \n}\n\nvoid onKeyPress(int _key) {\n if( _key == 'q' || _key == 'Q' || _key == 's' || _key == 'S' ){\n if (outputFile != \"\") {\n unsigned char* pixels = new unsigned char[getWindowWidth()*getWindowHeight()*4];\n glReadPixels(0, 0, getWindowWidth(), getWindowHeight(), GL_RGBA, GL_UNSIGNED_BYTE, pixels);\n Texture::savePixels(outputFile, pixels, getWindowWidth(), getWindowHeight());\n }\n }\n\n if ( _key == 'q' || _key == 'Q'){\n bPlay = false;\n }\n}\n\nvoid onMouseMove(float _x, float _y) {\n\n}\n\nvoid onMouseClick(float _x, float _y, int _button) {\n\n}\n\nvoid onMouseDrag(float _x, float _y, int _button) {\n if (_button == 1){\n float dist = glm::length(cam.getPosition());\n lat -= getMouseVelX();\n lon -= getMouseVelY()*0.5;\n cam.orbit(lat,lon,dist);\n cam.lookAt(glm::vec3(0.0));\n } else {\n float dist = glm::length(cam.getPosition());\n dist += (-.008f * getMouseVelY());\n if(dist > 0.0f){\n cam.setPosition( -dist * cam.getZAxis() );\n cam.lookAt(glm::vec3(0.0));\n }\n }\n}\n\nvoid onViewportResize(int _newWidth, int _newHeight) {\n cam.setViewport(_newWidth,_newHeight);\n}\n\nvoid onExit() {\n \/\/ clear screen\n glClear( GL_COLOR_BUFFER_BIT );\n\n \/\/ close openGL instance\n closeGL();\n\n \/\/ DELETE RESOURCES\n for (std::map<std::string,Texture*>::iterator i = textures.begin(); i != textures.end(); ++i) {\n delete i->second;\n i->second = NULL;\n }\n textures.clear();\n delete vbo;\n}<commit_msg>fixing console out<commit_after>\/*\nCopyright (c) 2014, Patricio Gonzalez Vivo\nAll rights reserved.\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in the\n documentation and\/or other materials provided with the distribution.\n * Neither the name of the copyright holder nor the\n names of its contributors may be used to endorse or promote products\n derived from this software without specific prior written permission.\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include <sys\/shm.h>\n#include <sys\/stat.h> \n#include <unistd.h>\n#include <signal.h>\n#include <map>\n\n#include \"app.h\"\n#include \"utils.h\"\n#include \"gl\/shader.h\"\n#include \"gl\/vbo.h\"\n#include \"gl\/texture.h\"\n#include \"3d\/camera.h\"\n#include \"types\/shapes.h\"\n\n#include \"ui\/cursor.h\"\n\n\/\/ GLOBAL VARIABLES\n\/\/============================================================================\n\/\/\nstatic bool bPlay = true;\n\n\/\/ List of FILES to watch and the variable to communicate that between process\nstruct WatchFile {\n std::string type;\n std::string path;\n int lastChange;\n};\nstd::vector<WatchFile> files;\nint* iHasChanged;\n\n\/\/ SHADER\nShader shader;\nint iFrag = -1;\nstd::string fragSource = \"\";\nint iVert = -1;\nstd::string vertSource = \"\";\n\n\/\/ CAMERA\nCamera cam;\nfloat lat = 180.0;\nfloat lon = 0.0;\n\n\/\/ ASSETS\nVbo* vbo;\nint iGeom = -1;\nglm::mat4 model_matrix = glm::mat4(1.);\n\nstd::map<std::string,Texture*> textures;\nstd::string outputFile = \"\";\n\n\/\/ CURSOR\nCursor cursor;\nbool bCursor = false;\n\n\/\/ Time limit\nfloat timeLimit = 0.0f;\n\n\/\/================================================================= Functions\nvoid watchThread();\nvoid onFileChange();\n\nvoid renderThread(int argc, char **argv);\nvoid setup();\nvoid draw();\nvoid onExit();\n\n\/\/ Main program\n\/\/============================================================================\nint main(int argc, char **argv){\n\n \/\/ Load files to watch\n struct stat st;\n for (uint i = 1; i < argc ; i++){\n std::string argument = std::string(argv[i]);\n\n if ( iFrag == -1 && ( haveExt(argument,\"frag\") || haveExt(argument,\"fs\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argv[i] << std::endl;\n } else {\n WatchFile file;\n file.type = \"fragment\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iFrag = files.size()-1;\n }\n } else if ( iVert == -1 && ( haveExt(argument,\"vert\") || haveExt(argument,\"vs\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"vertex\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iVert = files.size()-1;\n }\n } else if ( iGeom == -1 && \n ( haveExt(argument,\"ply\") || haveExt(argument,\"PLY\") ||\n haveExt(argument,\"obj\") || haveExt(argument,\"OBJ\") ) ) {\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"geometry\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n iGeom = files.size()-1;\n }\n } else if ( haveExt(argument,\"png\") || haveExt(argument,\"PNG\") ||\n haveExt(argument,\"jpg\") || haveExt(argument,\"JPG\") || \n haveExt(argument,\"jpeg\") || haveExt(argument,\"JPEG\") ){\n int ierr = stat(argument.c_str(), &st);\n if (ierr != 0) {\n \/\/ std::cerr << \"Error watching file \" << argument << std::endl;\n } else {\n WatchFile file;\n file.type = \"image\";\n file.path = argument;\n file.lastChange = st.st_mtime;\n files.push_back(file);\n }\n }\n }\n\n \/\/ If no shader\n if( iFrag == -1 && iVert == -1 && iGeom == -1) {\n std::cerr << \"Usage: \" << argv[0] << \" shader.frag [shader.vert] [mesh.(obj\/.ply)] [texture.(png\/jpg)] [-textureNameA texture.(png\/jpg)] [-u] [-x x] [-y y] [-w width] [-h height] [-l\/--livecoding] [--square] [-s seconds] [-o screenshot.png]\\n\";\n return EXIT_FAILURE;\n }\n\n \/\/ Fork process with a shared variable\n \/\/\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n pid_t pid = fork();\n iHasChanged = (int *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *iHasChanged = -1;\n watchThread();\n }\n break;\n\n default: \n {\n \/\/ Initialize openGL context\n initGL(argc,argv);\n\n \/\/ OpenGL Render Loop\n renderThread(argc,argv);\n \n \/\/ Kill the iNotify watcher once you finish\n kill(pid, SIGKILL);\n onExit();\n }\n break;\n }\n \n shmctl(shmId, IPC_RMID, NULL);\n return 0;\n}\n\n\/\/ Watching Thread\n\/\/============================================================================\nvoid watchThread() {\n struct stat st;\n while(1){\n for(uint i = 0; i < files.size(); i++){\n if( *iHasChanged == -1 ){\n stat(files[i].path.c_str(), &st);\n int date = st.st_mtime;\n if (date != files[i].lastChange ){\n *iHasChanged = i;\n files[i].lastChange = date;\n }\n usleep(500000);\n }\n }\n }\n}\n\nvoid renderThread(int argc, char **argv) {\n \/\/ Prepare viewport\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n glClear(GL_COLOR_BUFFER_BIT );\n \n \/\/ Setup\n setup();\n\n \/\/ Turn on Alpha blending\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA,GL_ONE_MINUS_SRC_ALPHA);\n\n \/\/ Clear the background\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n int textureCounter = 0;\n\n \/\/Load the the resources (textures)\n for (uint i = 1; i < argc ; i++){\n std::string argument = std::string(argv[i]);\n\n if (argument == \"-x\" || argument == \"-y\" || \n argument == \"-w\" || argument == \"--width\" || \n argument == \"-h\" || argument == \"--height\" ) {\n i++;\n } else if ( argument == \"--square\" ||\n argument == \"-l\" || \n argument == \"--life-coding\" ) {\n\n } else if ( argument == \"-m\" ) {\n bCursor = true;\n cursor.init();\n } else if ( argument == \"-s\" || argument == \"--sec\") {\n i++;\n argument = std::string(argv[i]);\n timeLimit = getFloat(argument);\n std::cout << \"Will exit in \" << timeLimit << \" seconds.\" << std::endl;\n } else if ( argument == \"-o\" ){\n i++;\n argument = std::string(argv[i]);\n if( haveExt(argument,\"png\") ){\n outputFile = argument;\n std::cout << \"Will save screenshot to \" << outputFile << \" on exit.\" << std::endl; \n } else {\n std::cout << \"At the moment screenshots only support PNG formats\" << std::endl;\n }\n\n } else if (argument.find(\"-\") == 0) {\n std::string parameterPair = argument.substr(argument.find_last_of('-')+1);\n\n i++;\n argument = std::string(argv[i]);\n Texture* tex = new Texture();\n if( tex->load(argument) ){\n textures[parameterPair] = tex;\n std::cout << \"Loading \" << argument << \" as the following uniform: \" << std::endl;\n std::cout << \" uniform sampler2D \" << parameterPair << \"; \/\/ loaded\"<< std::endl;\n std::cout << \" uniform vec2 \" << parameterPair << \"Resolution;\"<< std::endl;\n }\n\n } else if ( haveExt(argument,\"png\") || haveExt(argument,\"PNG\") ||\n haveExt(argument,\"jpg\") || haveExt(argument,\"JPG\") || \n haveExt(argument,\"jpeg\") || haveExt(argument,\"JPEG\") ) {\n\n Texture* tex = new Texture();\n if( tex->load(argument) ){\n std::string name = \"u_tex\"+getString(textureCounter);\n textures[name] = tex;\n std::cout << \"Loading \" << argument << \" as the following uniform: \" << std::endl;\n std::cout << \" uniform sampler2D \" << name << \"; \/\/ loaded\"<< std::endl;\n std::cout << \" uniform vec2 \" << name << \"Resolution;\"<< std::endl;\n textureCounter++;\n }\n }\n }\n\n \/\/ Render Loop\n while (isGL() && bPlay) {\n \/\/ Update\n updateGL();\n \n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ Draw\n draw();\n \n \/\/ Swap the buffers\n renderGL();\n\n if ( timeLimit > 0.0 && getTime() > timeLimit ) {\n onKeyPress('s');\n bPlay = false;\n }\n }\n}\n\nvoid setup() {\n glEnable(GL_DEPTH_TEST);\n glFrontFace(GL_CCW);\n \n \/\/ Load Geometry\n \/\/\n if ( iGeom == -1 ){\n vbo = rect(0.0,0.0,1.0,1.0).getVbo();\n } else {\n Mesh model;\n model.load(files[iGeom].path);\n vbo = model.getVbo();\n glm::vec3 toCentroid = getCentroid(model.getVertices());\n \/\/ model_matrix = glm::scale(glm::vec3(0.001));\n model_matrix = glm::translate(-toCentroid);\n }\n\n \/\/ Build shader;\n \/\/\n if ( iFrag != -1 ) {\n fragSource = \"\";\n if(!loadFromPath(files[iFrag].path, &fragSource)) {\n return;\n }\n } else {\n fragSource = vbo->getVertexLayout()->getDefaultFragShader();\n }\n\n if ( iVert != -1 ) {\n vertSource = \"\";\n loadFromPath(files[iVert].path, &vertSource);\n } else {\n vertSource = vbo->getVertexLayout()->getDefaultVertShader();\n } \n shader.load(fragSource,vertSource);\n \n cam.setViewport(getWindowWidth(),getWindowHeight());\n cam.setPosition(glm::vec3(0.0,0.0,-3.));\n}\n\nvoid draw(){\n\n \/\/ Something change??\n if(*iHasChanged != -1) {\n onFileChange();\n *iHasChanged = -1;\n }\n\n shader.use();\n shader.setUniform(\"u_time\", getTime());\n shader.setUniform(\"u_mouse\", getMouseX(), getMouseY());\n shader.setUniform(\"u_resolution\",getWindowWidth(), getWindowHeight());\n\n glm::mat4 mvp = glm::mat4(1.);\n if (iGeom != -1) {\n shader.setUniform(\"u_eye\", -cam.getPosition());\n shader.setUniform(\"u_normalMatrix\", cam.getNormalMatrix());\n\n shader.setUniform(\"u_modelMatrix\", model_matrix);\n shader.setUniform(\"u_viewMatrix\", cam.getViewMatrix());\n shader.setUniform(\"u_projectionMatrix\", cam.getProjectionMatrix());\n \n mvp = cam.getProjectionViewMatrix() * model_matrix;\n }\n shader.setUniform(\"u_modelViewProjectionMatrix\", mvp);\n\n unsigned int index = 0;\n for (std::map<std::string,Texture*>::iterator it = textures.begin(); it!=textures.end(); ++it) {\n shader.setUniform(it->first,it->second,index);\n shader.setUniform(it->first+\"Resolution\",it->second->getWidth(),it->second->getHeight());\n index++;\n }\n\n vbo->draw(&shader);\n\n if(bCursor){\n cursor.draw();\n }\n}\n\n\/\/ Rendering Thread\n\/\/============================================================================\nvoid onFileChange(){\n std::string type = files[*iHasChanged].type;\n std::string path = files[*iHasChanged].path;\n\n if ( type == \"fragment\" ){\n fragSource = \"\";\n if(loadFromPath(path, &fragSource)){\n shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n shader.load(fragSource,vertSource);\n }\n } else if ( type == \"vertex\" ){\n vertSource = \"\";\n if(loadFromPath(path, &vertSource)){\n shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n shader.load(fragSource,vertSource);\n }\n } else if ( type == \"geometry\" ){\n \/\/ TODO\n } else if ( type == \"image\" ){\n for (std::map<std::string,Texture*>::iterator it = textures.begin(); it!=textures.end(); ++it) {\n if ( path == it->second->getFilePath() ){\n it->second->load(path);\n break;\n }\n }\n } \n}\n\nvoid onKeyPress(int _key) {\n if( _key == 'q' || _key == 'Q' || _key == 's' || _key == 'S' ){\n if (outputFile != \"\") {\n unsigned char* pixels = new unsigned char[getWindowWidth()*getWindowHeight()*4];\n glReadPixels(0, 0, getWindowWidth(), getWindowHeight(), GL_RGBA, GL_UNSIGNED_BYTE, pixels);\n Texture::savePixels(outputFile, pixels, getWindowWidth(), getWindowHeight());\n }\n }\n\n if ( _key == 'q' || _key == 'Q'){\n bPlay = false;\n }\n}\n\nvoid onMouseMove(float _x, float _y) {\n\n}\n\nvoid onMouseClick(float _x, float _y, int _button) {\n\n}\n\nvoid onMouseDrag(float _x, float _y, int _button) {\n if (_button == 1){\n float dist = glm::length(cam.getPosition());\n lat -= getMouseVelX();\n lon -= getMouseVelY()*0.5;\n cam.orbit(lat,lon,dist);\n cam.lookAt(glm::vec3(0.0));\n } else {\n float dist = glm::length(cam.getPosition());\n dist += (-.008f * getMouseVelY());\n if(dist > 0.0f){\n cam.setPosition( -dist * cam.getZAxis() );\n cam.lookAt(glm::vec3(0.0));\n }\n }\n}\n\nvoid onViewportResize(int _newWidth, int _newHeight) {\n cam.setViewport(_newWidth,_newHeight);\n}\n\nvoid onExit() {\n \/\/ clear screen\n glClear( GL_COLOR_BUFFER_BIT );\n\n \/\/ close openGL instance\n closeGL();\n\n \/\/ DELETE RESOURCES\n for (std::map<std::string,Texture*>::iterator i = textures.begin(); i != textures.end(); ++i) {\n delete i->second;\n i->second = NULL;\n }\n textures.clear();\n delete vbo;\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: testtoolloader.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2006-06-19 13:54:11 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include \"testtoolloader.hxx\"\n\n#ifndef _OSL_MODULE_H_\n#include <osl\/module.h>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _RTL_LOGFILE_HXX_\n#include <rtl\/logfile.hxx>\n#endif\n#ifndef _VOS_PROCESS_HXX_\n#include <vos\/process.hxx>\n#endif\n#ifndef _SOLAR_H\n#include \"solar.h\"\n#endif\n#ifndef _STRING_HXX\n#include \"string.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include \"debug.hxx\"\n#endif\n\nusing namespace rtl;\n\nnamespace tools\n{\n typedef void ( *pfunc_CreateRemoteControl)();\n typedef void ( *pfunc_DestroyRemoteControl)();\n\nstatic oslModule aTestToolModule = 0;\n\n\nsal_uInt32 GetCommandLineParamCount()\n{\n NAMESPACE_VOS( OStartupInfo ) aStartInfo;\n return aStartInfo.getCommandArgCount();\n}\n\nString GetCommandLineParam( sal_uInt32 nParam )\n{\n NAMESPACE_VOS( OStartupInfo ) aStartInfo;\n ::rtl::OUString aParam;\n NAMESPACE_VOS( OStartupInfo )::TStartupError eError = aStartInfo.getCommandArg( nParam, aParam );\n if ( eError == NAMESPACE_VOS( OStartupInfo )::E_None )\n return String( aParam );\n else\n {\n DBG_ERROR( \"Unable to get CommandLineParam\" );\n return String();\n }\n}\n\n\nvoid InitTestToolLib()\n{\n RTL_LOGFILE_CONTEXT( aLog, \"desktop (cd100003) ::InitTestToolLib\" );\n\n sal_uInt32 i;\n \/\/ are we to be automated at all?\n bool bAutomate = false;\n\n for ( i = 0 ; i < GetCommandLineParamCount() ; i++ )\n {\n if ( GetCommandLineParam( i ).EqualsIgnoreCaseAscii(\"\/enableautomation\")\n || GetCommandLineParam( i ).EqualsIgnoreCaseAscii(\"-enableautomation\"))\n {\n bAutomate = true;\n break;\n }\n }\n\n if ( !bAutomate )\n return;\n\n\n OUString aFuncName( RTL_CONSTASCII_USTRINGPARAM( \"CreateRemoteControl\" ));\n OUString aModulePath;\n\n ::vos::OStartupInfo().getExecutableFile( aModulePath );\n sal_uInt32 lastIndex = aModulePath.lastIndexOf('\/');\n if ( lastIndex > 0 )\n aModulePath = aModulePath.copy( 0, lastIndex+1 );\n\n aModulePath += OUString::createFromAscii( SVLIBRARY( \"sts\" ) );\n\n \/\/ Shortcut for Performance: We expect that the test tool library is not installed\n \/\/ (only for testing purpose). It should be located beside our executable.\n \/\/ We don't want to pay for searching through LD_LIBRARY_PATH so we check for\n \/\/ existence only in our executable path!!\n osl::DirectoryItem aItem;\n osl::FileBase::RC nResult = osl::DirectoryItem::get( aModulePath, aItem );\n\n if ( nResult == osl::FileBase::E_None )\n {\n aTestToolModule = osl_loadModule( aModulePath.pData, SAL_LOADMODULE_DEFAULT );\n if ( aTestToolModule )\n {\n oslGenericFunction pInitFunc = osl_getFunctionSymbol(\n aTestToolModule, aFuncName.pData );\n if ( pInitFunc )\n (reinterpret_cast< pfunc_CreateRemoteControl >(pInitFunc))();\n else\n {\n DBG_ERROR1( \"Unable to get Symbol 'CreateRemoteControl' from library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n }\n else\n {\n DBG_ERROR1( \"Error loading library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n }\n else\n {\n DBG_ERROR1( \"Unable to access library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n}\n\nvoid DeInitTestToolLib()\n{\n if ( aTestToolModule )\n {\n OUString aFuncName( RTL_CONSTASCII_USTRINGPARAM( \"DestroyRemoteControl\" ));\n\n oslGenericFunction pDeInitFunc = osl_getFunctionSymbol(\n aTestToolModule, aFuncName.pData );\n if ( pDeInitFunc )\n (reinterpret_cast< pfunc_DestroyRemoteControl >(pDeInitFunc))();\n\n osl_unloadModule( aTestToolModule );\n }\n}\n\n} \/\/ namespace tools\n<commit_msg>INTEGRATION: CWS pchfix02 (1.5.42); FILE MERGED 2006\/09\/01 17:54:59 kaib 1.5.42.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: testtoolloader.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 01:05:15 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_tools.hxx\"\n\n#include \"testtoolloader.hxx\"\n\n#ifndef _OSL_MODULE_H_\n#include <osl\/module.h>\n#endif\n#ifndef _OSL_FILE_HXX_\n#include <osl\/file.hxx>\n#endif\n#ifndef _RTL_LOGFILE_HXX_\n#include <rtl\/logfile.hxx>\n#endif\n#ifndef _VOS_PROCESS_HXX_\n#include <vos\/process.hxx>\n#endif\n#ifndef _SOLAR_H\n#include \"solar.h\"\n#endif\n#ifndef _STRING_HXX\n#include \"string.hxx\"\n#endif\n#ifndef _TOOLS_DEBUG_HXX\n#include \"debug.hxx\"\n#endif\n\nusing namespace rtl;\n\nnamespace tools\n{\n typedef void ( *pfunc_CreateRemoteControl)();\n typedef void ( *pfunc_DestroyRemoteControl)();\n\nstatic oslModule aTestToolModule = 0;\n\n\nsal_uInt32 GetCommandLineParamCount()\n{\n NAMESPACE_VOS( OStartupInfo ) aStartInfo;\n return aStartInfo.getCommandArgCount();\n}\n\nString GetCommandLineParam( sal_uInt32 nParam )\n{\n NAMESPACE_VOS( OStartupInfo ) aStartInfo;\n ::rtl::OUString aParam;\n NAMESPACE_VOS( OStartupInfo )::TStartupError eError = aStartInfo.getCommandArg( nParam, aParam );\n if ( eError == NAMESPACE_VOS( OStartupInfo )::E_None )\n return String( aParam );\n else\n {\n DBG_ERROR( \"Unable to get CommandLineParam\" );\n return String();\n }\n}\n\n\nvoid InitTestToolLib()\n{\n RTL_LOGFILE_CONTEXT( aLog, \"desktop (cd100003) ::InitTestToolLib\" );\n\n sal_uInt32 i;\n \/\/ are we to be automated at all?\n bool bAutomate = false;\n\n for ( i = 0 ; i < GetCommandLineParamCount() ; i++ )\n {\n if ( GetCommandLineParam( i ).EqualsIgnoreCaseAscii(\"\/enableautomation\")\n || GetCommandLineParam( i ).EqualsIgnoreCaseAscii(\"-enableautomation\"))\n {\n bAutomate = true;\n break;\n }\n }\n\n if ( !bAutomate )\n return;\n\n\n OUString aFuncName( RTL_CONSTASCII_USTRINGPARAM( \"CreateRemoteControl\" ));\n OUString aModulePath;\n\n ::vos::OStartupInfo().getExecutableFile( aModulePath );\n sal_uInt32 lastIndex = aModulePath.lastIndexOf('\/');\n if ( lastIndex > 0 )\n aModulePath = aModulePath.copy( 0, lastIndex+1 );\n\n aModulePath += OUString::createFromAscii( SVLIBRARY( \"sts\" ) );\n\n \/\/ Shortcut for Performance: We expect that the test tool library is not installed\n \/\/ (only for testing purpose). It should be located beside our executable.\n \/\/ We don't want to pay for searching through LD_LIBRARY_PATH so we check for\n \/\/ existence only in our executable path!!\n osl::DirectoryItem aItem;\n osl::FileBase::RC nResult = osl::DirectoryItem::get( aModulePath, aItem );\n\n if ( nResult == osl::FileBase::E_None )\n {\n aTestToolModule = osl_loadModule( aModulePath.pData, SAL_LOADMODULE_DEFAULT );\n if ( aTestToolModule )\n {\n oslGenericFunction pInitFunc = osl_getFunctionSymbol(\n aTestToolModule, aFuncName.pData );\n if ( pInitFunc )\n (reinterpret_cast< pfunc_CreateRemoteControl >(pInitFunc))();\n else\n {\n DBG_ERROR1( \"Unable to get Symbol 'CreateRemoteControl' from library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n }\n else\n {\n DBG_ERROR1( \"Error loading library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n }\n else\n {\n DBG_ERROR1( \"Unable to access library %s while loading testtool support.\", SVLIBRARY( \"sts\" ) );\n }\n}\n\nvoid DeInitTestToolLib()\n{\n if ( aTestToolModule )\n {\n OUString aFuncName( RTL_CONSTASCII_USTRINGPARAM( \"DestroyRemoteControl\" ));\n\n oslGenericFunction pDeInitFunc = osl_getFunctionSymbol(\n aTestToolModule, aFuncName.pData );\n if ( pDeInitFunc )\n (reinterpret_cast< pfunc_DestroyRemoteControl >(pDeInitFunc))();\n\n osl_unloadModule( aTestToolModule );\n }\n}\n\n} \/\/ namespace tools\n<|endoftext|>"} {"text":"<commit_before>#include <GL\/glew.h>\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <iostream>\n#include \"draw.hpp\"\n#include \"math.hpp\"\n#include \"vectors.hpp\"\n#include \"window.hpp\"\n#include \"shader.hpp\"\n#include \"font.hpp\"\n\nvec3s camera = {5,M_PI\/4,0}; \/\/ положение камеры в сферических координатах\nvec3s sun_pos = {3, M_PI\/2,M_PI\/2};\nfloat dtheta = 0.01;\nfloat dphi = 0.01;\nGLuint program;\ngSphere sphere( 1.0f, 30, 60 );\ngSphere sun( 0.2f, 30, 60 );\ngFont font;\n\n\/\/float light_position[4] = {2.0, 2.0, 2.0, 1.0};\n\nint rows = 30;\nint cols = 60;\nGLubyte* cells;\nfield* f;\n\nWindowManager window( \"Game Of Life On fieldace\" );\n\nvoid golos_init( void ) {\n \/\/ init OpenGL params\n glClearColor( 0.0f, 0.0f, 0.0f, 0.0f );\n glClearDepth( 1.0 );\n glDepthFunc( GL_LESS );\n glEnable( GL_DEPTH_TEST );\n glShadeModel( GL_SMOOTH );\n glMatrixMode( GL_PROJECTION );\n glLoadIdentity();\n gluPerspective( 60.0f, (float) window.GetWidth() \/ (float) window.GetHeight(), 0.1f, 100.0f );\n glMatrixMode( GL_MODELVIEW );\n glewInit();\n\n\n glEnable(GL_COLOR_MATERIAL);\n glEnable(GL_LIGHTING);\n glEnable(GL_LIGHT0);\n\n program = glCreateProgram();\n auto shader = compileShader( \".\/shaders\/fragment.glsl\", GL_FRAGMENT_SHADER );\n glAttachShader( program, shader );\n shader = compileShader( \".\/shaders\/vertex.glsl\", GL_VERTEX_SHADER );\n glAttachShader( program, shader );\n glLinkProgram( program );\n printInfoLog( program );\n\n f = new field( rows, cols );\n \/\/ рандомная инициализация\n for ( int i = 0; i < rows; ++i )\n for ( int j = 0; j < cols; ++j )\n (*f)[i][j] = rand() % 2;\n cells = new GLubyte[rows * cols];\n\n font.load( \".\/data\/OpenSansLight.ttf\", 16 );\n}\n\nvoid golos_event( SDL_Event * event ) {\n SDL_PollEvent( event );\n switch ( event->type ) {\n case SDL_QUIT:\n window.KillWindow();\n break;\n case SDL_KEYDOWN:\n switch ( event->key.keysym.sym ) {\n case SDLK_SPACE:\n f->nextGeneration();\n break;\n case SDLK_ESCAPE:\n case SDLK_q:\n window.KillWindow();\n break;\n case SDLK_DOWN:\n camera.rotate(dtheta, 0);\n break;\n case SDLK_UP:\n camera.rotate(-dtheta, 0);\n break;\n case SDLK_RIGHT:\n camera.rotate(0, dphi);\n break;\n case SDLK_LEFT:\n camera.rotate(0, -dphi);\n break;\n default:\n break;\n }\n break;\n default:\n break;\n }\n}\n\nvoid golos_render( void ) {\n vec3d rect_camera = vec3d(camera); \/\/ положение камеры в прямоугольных координатах\n vec3d rect_sun = vec3d(sun_pos);\n sun_pos.rotate(0, dphi\/3);\n\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n glLoadIdentity();\n\n float up = (camera.theta < 0) ? -1.0 : 1.0; \/\/ фикс для gluLookAt\n gluLookAt( rect_camera.x, rect_camera.y, rect_camera.z, 0, 0, 0, 0, 0, up );\n\n \/\/ рисуем солнышко (потом добавлю шейдер)\n glPushMatrix();\n glTranslatef(rect_sun.x, rect_sun.y, rect_sun.z);\n glColor3f(1.0, 1.0, 0.0);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n sun.draw();\n float light_position[4] = {0, 0, 0, 1};\n glLightfv(GL_LIGHT0, GL_POSITION, light_position);\n glPopMatrix();\n\n \/\/ врубаем шейдеры\n glUseProgram( program );\n\n \/\/ формируем текстуру\n\n for ( int i = 0; i < rows; ++i )\n for ( int j = 0; j < cols; ++j )\n cells[i * cols + j] = ( (*f)[i][j] ) ? 0xff : 0x00;\n\n \/\/ отдаём текстуру\n glBindTexture( GL_TEXTURE_2D, 1 );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n glTexImage2D( GL_TEXTURE_2D, 0, GL_RGB, cols, rows, 0, GL_RED , GL_UNSIGNED_BYTE, cells );\n glEnable( GL_TEXTURE_2D );\n glTexEnvi( GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL );\n\n \/\/ рисуем сферу\n sphere.draw();\n\n glUseProgram( 0 );\n\n \/\/ для нормального отображения текста\n glTexEnvi( GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE );\n glPushMatrix();\n glLoadIdentity();\n glColor3f( 1.0f, 1.0f, 1.0f );\n font.draw( 10, 10, \"FPS: %.2f\", window.GetFPS() );\n glPopMatrix();\n\n glFlush();\n}\n\nvoid golos_destroy( void ) {\n delete[] cells;\n}\n\nint main( int argc, char ** argv ) {\n window.SetInitFunc( golos_init );\n window.SetRenderFunc( golos_render );\n window.SetEventFunc( golos_event );\n window.MainLoop();\n golos_destroy();\n return EXIT_SUCCESS;\n}\n<commit_msg>[add] move camera by mouse<commit_after>#include <GL\/glew.h>\n#include <GL\/gl.h>\n#include <GL\/glu.h>\n#include <iostream>\n#include \"draw.hpp\"\n#include \"math.hpp\"\n#include \"vectors.hpp\"\n#include \"window.hpp\"\n#include \"shader.hpp\"\n#include \"font.hpp\"\n\nvec3s camera = {5,M_PI\/4,0}; \/\/ положение камеры в сферических координатах\nvec3s sun_pos = {3, M_PI\/2,M_PI\/2};\nfloat dtheta = 0.01;\nfloat dphi = 0.01;\nGLuint program;\ngSphere sphere( 1.0f, 30, 60 );\ngSphere sun( 0.2f, 30, 60 );\ngFont font;\n\n\/\/float light_position[4] = {2.0, 2.0, 2.0, 1.0};\n\nint rows = 30;\nint cols = 60;\nGLubyte* cells;\nfield* f;\n\nWindowManager window( \"Game Of Life On fieldace\" );\n\nvoid golos_init( void ) {\n \/\/ init OpenGL params\n glClearColor( 0.0f, 0.0f, 0.0f, 0.0f );\n glClearDepth( 1.0 );\n glDepthFunc( GL_LESS );\n glEnable( GL_DEPTH_TEST );\n glShadeModel( GL_SMOOTH );\n glMatrixMode( GL_PROJECTION );\n glLoadIdentity();\n gluPerspective( 60.0f, (float) window.GetWidth() \/ (float) window.GetHeight(), 0.1f, 100.0f );\n glMatrixMode( GL_MODELVIEW );\n glewInit();\n\n\n glEnable(GL_COLOR_MATERIAL);\n glEnable(GL_LIGHTING);\n glEnable(GL_LIGHT0);\n\n program = glCreateProgram();\n auto shader = compileShader( \".\/shaders\/fragment.glsl\", GL_FRAGMENT_SHADER );\n glAttachShader( program, shader );\n shader = compileShader( \".\/shaders\/vertex.glsl\", GL_VERTEX_SHADER );\n glAttachShader( program, shader );\n glLinkProgram( program );\n printInfoLog( program );\n\n f = new field( rows, cols );\n \/\/ рандомная инициализация\n for ( int i = 0; i < rows; ++i )\n for ( int j = 0; j < cols; ++j )\n (*f)[i][j] = rand() % 2;\n cells = new GLubyte[rows * cols];\n\n font.load( \".\/data\/OpenSansLight.ttf\", 16 );\n}\n\nvoid golos_event( SDL_Event * event ) {\n static uint8_t button_left_set = false;\n static uint8_t button_right_set = false;\n static uint16_t mouse_x = 0, mouse_y = 0;\n SDL_PollEvent( event );\n switch ( event->type ) {\n case SDL_QUIT:\n window.KillWindow();\n break;\n case SDL_KEYDOWN:\n switch ( event->key.keysym.sym ) {\n case SDLK_SPACE:\n f->nextGeneration();\n break;\n case SDLK_ESCAPE:\n case SDLK_q:\n window.KillWindow();\n break;\n case SDLK_DOWN:\n camera.rotate(dtheta, 0);\n break;\n case SDLK_UP:\n camera.rotate(-dtheta, 0);\n break;\n case SDLK_RIGHT:\n camera.rotate(0, dphi);\n break;\n case SDLK_LEFT:\n camera.rotate(0, -dphi);\n break;\n default:\n break;\n }\n break;\n case SDL_MOUSEMOTION:\n if ( button_left_set ) {\n camera.rotate( -( event->button.y - mouse_y ) \/ 100.0f,\n -( event->button.x - mouse_x ) \/ 100.0f );\n mouse_x = event->button.x;\n mouse_y = event->button.y;\n }\n break;\n case SDL_MOUSEBUTTONDOWN:\n switch ( event->button.button ) {\n case SDL_BUTTON_LEFT:\n if ( !button_left_set ) {\n mouse_x = event->button.x;\n mouse_y = event->button.y;\n }\n button_left_set = true;\n break;\n case SDL_BUTTON_RIGHT:\n button_right_set = true;\n break;\n default:\n break;\n }\n break;\n case SDL_MOUSEBUTTONUP:\n button_left_set = button_right_set = false;\n break;\n default:\n break;\n }\n}\n\nvoid golos_render( void ) {\n vec3d rect_camera = vec3d(camera); \/\/ положение камеры в прямоугольных координатах\n vec3d rect_sun = vec3d(sun_pos);\n sun_pos.rotate(0, dphi\/3);\n\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT );\n glLoadIdentity();\n\n float up = (camera.theta < 0) ? -1.0 : 1.0; \/\/ фикс для gluLookAt\n gluLookAt( rect_camera.x, rect_camera.y, rect_camera.z, 0, 0, 0, 0, 0, up );\n\n \/\/ рисуем солнышко (потом добавлю шейдер)\n glPushMatrix();\n glTranslatef(rect_sun.x, rect_sun.y, rect_sun.z);\n glColor3f(1.0, 1.0, 0.0);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n sun.draw();\n float light_position[4] = {0, 0, 0, 1};\n glLightfv(GL_LIGHT0, GL_POSITION, light_position);\n glPopMatrix();\n\n \/\/ врубаем шейдеры\n glUseProgram( program );\n\n \/\/ формируем текстуру\n\n for ( int i = 0; i < rows; ++i )\n for ( int j = 0; j < cols; ++j )\n cells[i * cols + j] = ( (*f)[i][j] ) ? 0xff : 0x00;\n\n \/\/ отдаём текстуру\n glBindTexture( GL_TEXTURE_2D, 1 );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n glTexImage2D( GL_TEXTURE_2D, 0, GL_RGB, cols, rows, 0, GL_RED , GL_UNSIGNED_BYTE, cells );\n glEnable( GL_TEXTURE_2D );\n glTexEnvi( GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_DECAL );\n\n \/\/ рисуем сферу\n sphere.draw();\n\n glUseProgram( 0 );\n\n \/\/ для нормального отображения текста\n glTexEnvi( GL_TEXTURE_ENV, GL_TEXTURE_ENV_MODE, GL_REPLACE );\n glPushMatrix();\n glLoadIdentity();\n glColor3f( 1.0f, 1.0f, 1.0f );\n font.draw( 10, 10, \"FPS: %.2f\", window.GetFPS() );\n glPopMatrix();\n\n glFlush();\n}\n\nvoid golos_destroy( void ) {\n delete[] cells;\n}\n\nint main( int argc, char ** argv ) {\n window.SetInitFunc( golos_init );\n window.SetRenderFunc( golos_render );\n window.SetEventFunc( golos_event );\n window.MainLoop();\n golos_destroy();\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n#include <string.h>\n\n\n#define STATIC_STRING_VARIABLE_NAME \"__serenity_templater_str\"\n#define RESULT_VARIABLE_NAME \"__serenity_templater_res\"\n\n\nstatic void writeText(std::ostream & out, const std::string & text) {\n\tout << \"{static const char \" STATIC_STRING_VARIABLE_NAME \"[]={\";\n\tout << std::to_string(text[0]);\n\tfor (auto it = ++text.begin(); it != text.end(); it++) { out << ',' << std::to_string(*it); }\n\tout << \",0\";\n\tout << \"};\" RESULT_VARIABLE_NAME \"<<\" STATIC_STRING_VARIABLE_NAME \";}\";\n}\n\nstatic void writeCommand(std::ostream & out, const std::string & command, const std::string & parameters) {\n\tif ((command == \"\") && (parameters == \"\")) return; \/\/ так надо\n\n\t\/\/ simple expression\n\tif (command == \"\") out << RESULT_VARIABLE_NAME \"<<\" << parameters << \";\"; else \/\/ $(var)\n\t\/\/ commands without parameters\n\tif (command == \"else\") out << \"}else{\"; else \/\/ $else\n\tif (command == \"end\") out << '}'; else \/\/ $end\n\t\/\/ commands with parameters\n\tif (parameters == \"\") out << RESULT_VARIABLE_NAME \"<<\" << command << \";\"; else \/\/ $var\n\t\/\/if (command == \"import\") return preprocess::file(parameters); else \/\/ $import(file.htmlt)\n\t\/\/if (command == \"include\") return include(parameters); else \/\/ $include(file.css)\n\tif (command == \"for\") out << \"for(\" << parameters << \"){\"; else \/\/ $for (int i=0; else i<n; else i++)\n\tif (command == \"foreach\") out << \"for(const auto&\" << parameters << \"){\"; else \/\/ $foreach(item : collection)\n\tif (command == \"if\") out << \"if(\" << parameters << \"){\"; else \/\/ $if (cond)\n\n\tthrow std::runtime_error(\"unknown command: $'\" + command + \"'('\" + parameters + \"')\");\n}\n\nstatic void preprocess(std::istream & in, std::ostream & out, const std::string & templateName) {\n\tout << \"#define __SERENITY_TEMPLATER_TEMPLATE_\" << templateName << \" [&](){std::stringstream \" RESULT_VARIABLE_NAME \";\";\n\n\tenum class State {\n\t\tTEXT, \/\/ skipping to $\n\t\tDOLLAR_COMMAND_NAME, \/\/ skipping to ( or non-alphanumeric\n\t\tDOLLAR_COMMAND_PARAMETERS \/\/ skipping to matching )\n\t};\n\n\tState state = State::TEXT;\n\tstd::string text;\n\tstd::string command;\n\tstd::string parameters;\n\tint bracketsDepth = 0;\n\n\tfor (int c_int = in.get(); (c_int != std::char_traits<char>::eof()) && (in.good()); c_int = in.get()) {\n\t\tchar c = (char)c_int;\n\t\tState newState = state;\n\n\t\tif (state == State::TEXT) {\n\t\t\tif (c == '$') { newState = State::DOLLAR_COMMAND_NAME; } else { text += c; }\n\t\t} else if (state == State::DOLLAR_COMMAND_NAME) {\n\t\t\tif (isalnum(c) || (c == '_')) {\n\t\t\t\tcommand += c;\n\t\t\t} else if (c == '(') {\n\t\t\t\tnewState = State::DOLLAR_COMMAND_PARAMETERS;\n\t\t\t\tbracketsDepth = 1;\n\t\t\t} else {\n\t\t\t\tnewState = State::TEXT;\n\t\t\t\tif ((c == '$') && command.empty()) { text += c; } else { in.putback(c); }\n\t\t\t}\n\t\t} else if (state == State::DOLLAR_COMMAND_PARAMETERS) {\n\t\t\tif (c == '(') { bracketsDepth++; }\n\t\t\tif (c == ')') { bracketsDepth--; }\n\t\t\tif (bracketsDepth > 0) { parameters += c; } else { newState = State::TEXT; }\n\t\t}\n\n\t\tif (newState != state) {\n\t\t\tif (newState == State::TEXT) {\n\t\t\t\tif (!text.empty()) writeText(out, text);\n\t\t\t\tif (!command.empty() || !parameters.empty()) writeCommand(out, command, parameters);\n\n\t\t\t\ttext.clear();\n\t\t\t\tcommand.clear();\n\t\t\t\tparameters.clear();\n\t\t\t}\n\n\t\t\tstate = newState;\n\t\t}\n\t}\n\n\tif (!text.empty()) writeText(out, text);\n\tif (!command.empty() || !parameters.empty()) writeCommand(out, command, parameters);\n\n\tout << \"return \" RESULT_VARIABLE_NAME \".str();}\\n\";\n}\n\nstatic std::string fileNameToTemplateName(const std::string & fileName) {\n\tauto begin = fileName.find_last_of('\/');\n\tif (begin == std::string::npos) begin = 0;\n\tauto end = fileName.find('.', begin);\n\tif (end == std::string::npos) end = fileName.size()-1;\n\treturn fileName.substr(begin+1, end-begin-1);\n}\n\n\nint main(int argc, char ** argv) {\n\tif ((argc < 2) || (strcmp(argv[1], \"-h\") == 0) || (strcmp(argv[1], \"--help\") == 0)) {\n\t\tprintf(\"Usage:\\n %s output-file.htmltc input-file1.htmlt ... input-fileN.htmlt\", argv[0]);\n\t\treturn 1;\n\t}\n\n\tstd::ofstream out(argv[1]);\n\tout << \"#include <serenity\/templater.hpp>\\n\";\n\tfor (int i=2; i<argc; i++) {\n \tstd::ifstream in(argv[i], std::ios::in | std::ios::binary);\n\t\tpreprocess(in, out, fileNameToTemplateName(argv[i]));\n\t}\n\treturn 0;\n}\n<commit_msg>use std::stringstream::write<commit_after>#include <string>\n#include <iostream>\n#include <fstream>\n#include <stdexcept>\n#include <string.h>\n\n\n#define STATIC_STRING_VARIABLE_NAME \"__serenity_templater_str\"\n#define RESULT_VARIABLE_NAME \"__serenity_templater_res\"\n\n\nstatic void writeText(std::ostream & out, const std::string & text) {\n\tout << \"{static const char \" STATIC_STRING_VARIABLE_NAME \"[]={\";\n\tout << std::to_string(text[0]);\n\tfor (auto it = ++text.begin(); it != text.end(); it++) { out << ',' << std::to_string(*it); }\n\tout << \"};\" RESULT_VARIABLE_NAME \".write(\" STATIC_STRING_VARIABLE_NAME \",sizeof(\" STATIC_STRING_VARIABLE_NAME \"));}\";\n}\n\nstatic void writeCommand(std::ostream & out, const std::string & command, const std::string & parameters) {\n\tif ((command == \"\") && (parameters == \"\")) return; \/\/ так надо\n\n\t\/\/ simple expression\n\tif (command == \"\") out << RESULT_VARIABLE_NAME \"<<\" << parameters << \";\"; else \/\/ $(var)\n\t\/\/ commands without parameters\n\tif (command == \"else\") out << \"}else{\"; else \/\/ $else\n\tif (command == \"end\") out << '}'; else \/\/ $end\n\t\/\/ commands with parameters\n\tif (parameters == \"\") out << RESULT_VARIABLE_NAME \"<<\" << command << \";\"; else \/\/ $var\n\t\/\/if (command == \"import\") return preprocess::file(parameters); else \/\/ $import(file.htmlt)\n\t\/\/if (command == \"include\") return include(parameters); else \/\/ $include(file.css)\n\tif (command == \"for\") out << \"for(\" << parameters << \"){\"; else \/\/ $for (int i=0; else i<n; else i++)\n\tif (command == \"foreach\") out << \"for(const auto&\" << parameters << \"){\"; else \/\/ $foreach(item : collection)\n\tif (command == \"if\") out << \"if(\" << parameters << \"){\"; else \/\/ $if (cond)\n\n\tthrow std::runtime_error(\"unknown command: $'\" + command + \"'('\" + parameters + \"')\");\n}\n\nstatic void preprocess(std::istream & in, std::ostream & out, const std::string & templateName) {\n\tout << \"#define __SERENITY_TEMPLATER_TEMPLATE_\" << templateName << \" [&](){std::stringstream \" RESULT_VARIABLE_NAME \";\";\n\n\tenum class State {\n\t\tTEXT, \/\/ skipping to $\n\t\tDOLLAR_COMMAND_NAME, \/\/ skipping to ( or non-alphanumeric\n\t\tDOLLAR_COMMAND_PARAMETERS \/\/ skipping to matching )\n\t};\n\n\tState state = State::TEXT;\n\tstd::string text;\n\tstd::string command;\n\tstd::string parameters;\n\tint bracketsDepth = 0;\n\n\tfor (int c_int = in.get(); (c_int != std::char_traits<char>::eof()) && (in.good()); c_int = in.get()) {\n\t\tchar c = (char)c_int;\n\t\tState newState = state;\n\n\t\tif (state == State::TEXT) {\n\t\t\tif (c == '$') { newState = State::DOLLAR_COMMAND_NAME; } else { text += c; }\n\t\t} else if (state == State::DOLLAR_COMMAND_NAME) {\n\t\t\tif (isalnum(c) || (c == '_')) {\n\t\t\t\tcommand += c;\n\t\t\t} else if (c == '(') {\n\t\t\t\tnewState = State::DOLLAR_COMMAND_PARAMETERS;\n\t\t\t\tbracketsDepth = 1;\n\t\t\t} else {\n\t\t\t\tnewState = State::TEXT;\n\t\t\t\tif ((c == '$') && command.empty()) { text += c; } else { in.putback(c); }\n\t\t\t}\n\t\t} else if (state == State::DOLLAR_COMMAND_PARAMETERS) {\n\t\t\tif (c == '(') { bracketsDepth++; }\n\t\t\tif (c == ')') { bracketsDepth--; }\n\t\t\tif (bracketsDepth > 0) { parameters += c; } else { newState = State::TEXT; }\n\t\t}\n\n\t\tif (newState != state) {\n\t\t\tif (newState == State::TEXT) {\n\t\t\t\tif (!text.empty()) writeText(out, text);\n\t\t\t\tif (!command.empty() || !parameters.empty()) writeCommand(out, command, parameters);\n\n\t\t\t\ttext.clear();\n\t\t\t\tcommand.clear();\n\t\t\t\tparameters.clear();\n\t\t\t}\n\n\t\t\tstate = newState;\n\t\t}\n\t}\n\n\tif (!text.empty()) writeText(out, text);\n\tif (!command.empty() || !parameters.empty()) writeCommand(out, command, parameters);\n\n\tout << \"return \" RESULT_VARIABLE_NAME \".str();}\\n\";\n}\n\nstatic std::string fileNameToTemplateName(const std::string & fileName) {\n\tauto begin = fileName.find_last_of('\/');\n\tif (begin == std::string::npos) begin = 0;\n\tauto end = fileName.find('.', begin);\n\tif (end == std::string::npos) end = fileName.size()-1;\n\treturn fileName.substr(begin+1, end-begin-1);\n}\n\n\nint main(int argc, char ** argv) {\n\tif ((argc < 2) || (strcmp(argv[1], \"-h\") == 0) || (strcmp(argv[1], \"--help\") == 0)) {\n\t\tprintf(\"Usage:\\n %s output-file.htmltc input-file1.htmlt ... input-fileN.htmlt\", argv[0]);\n\t\treturn 1;\n\t}\n\n\tstd::ofstream out(argv[1]);\n\tout << \"#include <serenity\/templater.hpp>\\n\";\n\tfor (int i=2; i<argc; i++) {\n \tstd::ifstream in(argv[i], std::ios::in | std::ios::binary);\n\t\tpreprocess(in, out, fileNameToTemplateName(argv[i]));\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* BSD 3-Clause License:\n * Copyright (c) 2018, bitsofcotton.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation or other materials provided with the distribution.\n * Neither the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n *\n * 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 HOLDER 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.\n *\/\n\n#if !defined(_2D3D_PSEUDO_)\n\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n#include <Eigen\/Core>\n#include <Eigen\/Dense>\n\nusing std::complex;\nusing std::abs;\nusing std::vector;\nusing std::sort;\nusing std::max;\nusing std::min;\nusing std::sqrt;\nusing std::exp;\nusing std::pow;\nusing std::isfinite;\nusing std::cerr;\nusing std::flush;\nusing std::vector;\n\ntemplate <typename T> class PseudoBump {\npublic:\n typedef complex<T> U;\n typedef Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> Mat;\n typedef Eigen::Matrix<T, Eigen::Dynamic, 1> Vec;\n typedef Eigen::Matrix<U, Eigen::Dynamic, Eigen::Dynamic> MatU;\n typedef Eigen::Matrix<T, 3, 1> Vec3;\n typedef Eigen::Matrix<int, 3, 1> Veci3;\n \n PseudoBump();\n ~PseudoBump();\n void initialize(const int& stp);\n void getPseudoVec(const Mat& in, vector<Vec3>& geoms, vector<Veci3>& delaunay, const int& vbox = 3, const T& rz = T(1) \/ T(8));\n Mat getPseudoBump(const Mat& in);\n \nprivate:\n Vec getPseudoBumpSub(const Vec& work, const Mat& cf);\n const T& getImgPt(const Vec& img, const T& y);\n Mat prepareLineAxis(const T& rstp);\n \n Mat Dops;\n};\n\ntemplate <typename T> PseudoBump<T>::PseudoBump() {\n initialize(21);\n}\n\ntemplate <typename T> PseudoBump<T>::~PseudoBump() {\n ;\n}\n\ntemplate <typename T> void PseudoBump<T>::initialize(const int& stp) {\n assert(4 < stp);\n const T Pi(T(4) * atan2(T(1), T(1)));\n MatU DFT(stp \/ 2, stp \/ 2), IDFT(stp \/ 2, stp \/ 2);\n for(int i = 0; i < DFT.rows(); i ++)\n for(int j = 0; j < DFT.cols(); j ++) {\n DFT( i, j) = exp(U(- 2.) * Pi * sqrt(U(- 1)) * U(i * j \/ T(DFT.rows())));\n IDFT(i, j) = exp(U( 2.) * Pi * sqrt(U(- 1)) * U(i * j \/ T(DFT.rows()))) \/ T(DFT.rows());\n }\n for(int i = 0; i < DFT.rows(); i ++)\n DFT.row(i) *= - U(2.) * Pi * sqrt(U(- 1)) * T(i) \/ T(DFT.rows());\n const auto DopL((IDFT.row(IDFT.rows() - 1) * DFT).real().template cast<T>());\n const auto DopM((IDFT.row(IDFT.rows() \/ 2) * DFT).real().template cast<T>());\n const auto DopR((IDFT.row(0) * DFT).real().template cast<T>());\n Dops = Mat(3, stp);\n for(int i = 0; i < Dops.cols(); i ++)\n Dops(0, i) = Dops(1, i) = Dops(2, i) = T(0);\n for(int i = 0; i < DopL.size(); i ++) {\n Dops(0, i) = DopL[i];\n Dops(1, i - DopM.size() \/ 2 + Dops.cols() \/ 2) = DopM[i];\n Dops(2, i - DopR.size() + Dops.cols() ) = DopR[i];\n }\n return;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, 1> PseudoBump<T>::getPseudoBumpSub(const Vec& work, const Mat& cf) {\n cerr << \".\" << flush;\n Vec result(work.size());\n for(int s = 0; s < work.size(); s ++) {\n T sum(0);\n result[s] = T(0);\n for(int z = 0; z < cf.rows(); z ++) {\n \/\/ d\/dt (local color) \/ ||local color||:\n Vec c(cf.cols());\n for(int u = 0; u < c.size(); u ++)\n c[u] = getImgPt(work, cf(z, u) + s);\n const auto buf(Dops * c);\n \/\/ N.B. <tangents, const distances> \/ <tangents, 1> is the result,\n \/\/ this is quite pseudo because this similar to\n \/\/ |tan(theta)| * d \/ |tan(theta)| \/ 1..\n const auto score(sqrt(buf.dot(buf) \/ c.dot(c)));\n if(isfinite(score)) {\n result[s] += score * pow(z \/ T(cf.rows()), T(2));\n sum += score;\n }\n }\n result[s] \/= sum;\n }\n return result;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> PseudoBump<T>::getPseudoBump(const Mat& in) {\n const auto cf(prepareLineAxis(sqrt(T(in.rows() * in.cols()))));\n Mat result(in.rows(), in.cols());\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int i = 0; i < in.cols(); i ++)\n result.col(i) = getPseudoBumpSub(in.col(i), cf);\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int i = 0; i < in.rows(); i ++)\n result.row(i) += getPseudoBumpSub(in.row(i), cf);\n return result;\n}\n\n\/\/ get bump with multiple scale and vectorized result.\ntemplate <typename T> void PseudoBump<T>::getPseudoVec(const Mat& in, vector<Vec3>& geoms, vector<Veci3>& delaunay, const int& vbox, const T& rz) {\n assert(0 < vbox && T(0) < rz);\n \/\/ get vectorize.\n geoms = vector<Vec3>();\n T aavg(0);\n for(int i = 0; i < in.rows(); i ++)\n for(int j = 0; j < in.cols(); j ++)\n aavg += in(i, j);\n aavg \/= in.rows() * in.cols();\n for(int i = 0; i < in.rows() \/ vbox + 1; i ++)\n for(int j = 0; j < in.cols() \/ vbox + 1; j ++) {\n if(in.rows() < (i + 1) * vbox ||\n in.cols() < (j + 1) * vbox) {\n if(geoms.size() >= 1) {\n Vec3 gbuf;\n gbuf[0] = i * vbox;\n gbuf[1] = j * vbox;\n gbuf[2] = geoms[geoms.size() - 1][2];\n geoms.push_back(gbuf);\n }\n continue;\n }\n T avg(0);\n for(int ii = i * vbox; ii < (i + 1) * vbox; ii ++)\n for(int jj = j * vbox; jj < (j + 1) * vbox; jj ++)\n avg += in(ii, jj);\n Vec3 work;\n work[0] = i * vbox;\n work[1] = j * vbox;\n const T intens(avg \/ vbox \/ vbox - aavg);\n work[2] = - intens * sqrt(T(in.rows() * in.cols())) * rz;\n geoms.push_back(work);\n }\n Vec3 avg;\n avg[0] = avg[1] = avg[2] = T(0);\n for(int i = 0; i < geoms.size(); i ++)\n avg += geoms[i];\n avg \/= geoms.size();\n for(int i = 0; i < geoms.size(); i ++)\n geoms[i][2] -= avg[2];\n delaunay = vector<Veci3>();\n for(int i = 1; i < in.rows() \/ vbox + 1; i ++)\n for(int j = 0; j < in.cols() \/ vbox; j ++) {\n Veci3 work, work2;\n work[0] = (i - 1) * (in.cols() \/ vbox + 1) + j;\n work[1] = i * (in.cols() \/ vbox + 1) + j;\n work[2] = i * (in.cols() \/ vbox + 1) + j + 1;\n work2[0] = (i - 1) * (in.cols() \/ vbox + 1) + j;\n work2[2] = (i - 1) * (in.cols() \/ vbox + 1) + j + 1;\n work2[1] = i * (in.cols() \/ vbox + 1) + j + 1;\n delaunay.push_back(work);\n delaunay.push_back(work2);\n }\n return;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> PseudoBump<T>::prepareLineAxis(const T& rstp) {\n Vec camera(2);\n camera[0] = T(0);\n camera[1] = - T(1);\n \n Mat result(int(rstp), Dops.cols());\n T absmax(0);\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int zi = 0; zi < result.rows(); zi ++)\n for(int s = 0; s < result.cols(); s ++) {\n Vec cpoint(2);\n cpoint[0] = s \/ T(result.cols() - 1) - 1 \/ T(2);\n \/\/ [1, rstp] works well and scaling works rapidly better.\n cpoint[1] = (T(1) - pow(zi \/ T(result.rows()), T(2))) * rstp * T(2);\n \/\/ x-z plane projection of point p with camera geometry c to z=0.\n \/\/ c := camera, p := cpoint.\n \/\/ <c + (p - c) * t, [0, 1]> = 0\n const T t(- camera[1] \/ (cpoint[1] - camera[1]));\n result(zi, s) = (camera + (cpoint - camera) * t)[0];\n#if defined(_OPENMP)\n#pragma omp atomic\n#endif\n absmax = max(abs(result(zi, s)), absmax);\n }\n return result * rstp \/ absmax;\n}\n\ntemplate <typename T> const T& PseudoBump<T>::getImgPt(const Vec& img, const T& y) {\n const int& h(img.size());\n const int yy(abs((int(y + .5) + 3 * h) % (2 * h) - h) % h);\n return img[yy];\n}\n\n#define _2D3D_PSEUDO_\n#endif\n\n<commit_msg>revert.<commit_after>\/* BSD 3-Clause License:\n * Copyright (c) 2018, bitsofcotton.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation or other materials provided with the distribution.\n * Neither the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n *\n * 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 HOLDER 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.\n *\/\n\n#if !defined(_2D3D_PSEUDO_)\n\n#include <cstdio>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n#include <Eigen\/Core>\n#include <Eigen\/Dense>\n\nusing std::complex;\nusing std::abs;\nusing std::vector;\nusing std::sort;\nusing std::max;\nusing std::min;\nusing std::sqrt;\nusing std::exp;\nusing std::pow;\nusing std::isfinite;\nusing std::cerr;\nusing std::flush;\nusing std::vector;\n\ntemplate <typename T> class PseudoBump {\npublic:\n typedef complex<T> U;\n typedef Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> Mat;\n typedef Eigen::Matrix<T, Eigen::Dynamic, 1> Vec;\n typedef Eigen::Matrix<U, Eigen::Dynamic, Eigen::Dynamic> MatU;\n typedef Eigen::Matrix<T, 3, 1> Vec3;\n typedef Eigen::Matrix<int, 3, 1> Veci3;\n \n PseudoBump();\n ~PseudoBump();\n void initialize(const int& stp);\n void getPseudoVec(const Mat& in, vector<Vec3>& geoms, vector<Veci3>& delaunay, const int& vbox = 3, const T& rz = T(1) \/ T(8));\n Mat getPseudoBump(const Mat& in);\n \nprivate:\n Vec getPseudoBumpSub(const Vec& work, const Mat& cf);\n const T& getImgPt(const Vec& img, const T& y);\n Mat prepareLineAxis(const T& rstp);\n \n Mat Dops;\n};\n\ntemplate <typename T> PseudoBump<T>::PseudoBump() {\n initialize(21);\n}\n\ntemplate <typename T> PseudoBump<T>::~PseudoBump() {\n ;\n}\n\ntemplate <typename T> void PseudoBump<T>::initialize(const int& stp) {\n assert(4 < stp);\n const T Pi(T(4) * atan2(T(1), T(1)));\n MatU DFT(stp \/ 2, stp \/ 2), IDFT(stp \/ 2, stp \/ 2);\n for(int i = 0; i < DFT.rows(); i ++)\n for(int j = 0; j < DFT.cols(); j ++) {\n DFT( i, j) = exp(U(- 2.) * Pi * sqrt(U(- 1)) * U(i * j \/ T(DFT.rows())));\n IDFT(i, j) = exp(U( 2.) * Pi * sqrt(U(- 1)) * U(i * j \/ T(DFT.rows()))) \/ T(DFT.rows());\n }\n for(int i = 0; i < DFT.rows(); i ++)\n DFT.row(i) *= - U(2.) * Pi * sqrt(U(- 1)) * T(i) \/ T(DFT.rows());\n const auto DopL((IDFT.row(IDFT.rows() - 1) * DFT).real().template cast<T>());\n const auto DopM((IDFT.row(IDFT.rows() \/ 2) * DFT).real().template cast<T>());\n const auto DopR((IDFT.row(0) * DFT).real().template cast<T>());\n Dops = Mat(3, stp);\n for(int i = 0; i < Dops.cols(); i ++)\n Dops(0, i) = Dops(1, i) = Dops(2, i) = T(0);\n for(int i = 0; i < DopL.size(); i ++) {\n Dops(0, i) = DopL[i];\n Dops(1, i - DopM.size() \/ 2 + Dops.cols() \/ 2) = DopM[i];\n Dops(2, i - DopR.size() + Dops.cols() ) = DopR[i];\n }\n return;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, 1> PseudoBump<T>::getPseudoBumpSub(const Vec& work, const Mat& cf) {\n cerr << \".\" << flush;\n Vec result(work.size());\n for(int s = 0; s < work.size(); s ++) {\n T sum(0);\n result[s] = T(0);\n for(int z = 0; z < cf.rows(); z ++) {\n \/\/ d\/dt (local color) \/ ||local color||:\n Vec c(cf.cols());\n for(int u = 0; u < c.size(); u ++)\n c[u] = getImgPt(work, cf(z, u) + s);\n const auto buf(Dops * c);\n \/\/ N.B. <tangents, const distances> \/ <tangents, 1> is the result,\n \/\/ this is quite pseudo because this similar to\n \/\/ |tan(theta)| * d \/ |tan(theta)| \/ 1..\n const auto score(sqrt(buf.dot(buf) \/ c.dot(c)));\n if(isfinite(score)) {\n result[s] += score * pow(z \/ T(cf.rows()), T(2));\n sum += score;\n }\n }\n result[s] \/= sum;\n }\n return result;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> PseudoBump<T>::getPseudoBump(const Mat& in) {\n const auto cf(prepareLineAxis(sqrt(T(in.rows() * in.cols()))));\n Mat result(in.rows(), in.cols());\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int i = 0; i < in.cols(); i ++)\n result.col(i) = getPseudoBumpSub(in.col(i), cf);\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int i = 0; i < in.rows(); i ++)\n result.row(i) += getPseudoBumpSub(in.row(i), cf);\n return result;\n}\n\n\/\/ get bump with multiple scale and vectorized result.\ntemplate <typename T> void PseudoBump<T>::getPseudoVec(const Mat& in, vector<Vec3>& geoms, vector<Veci3>& delaunay, const int& vbox, const T& rz) {\n assert(0 < vbox && T(0) < rz);\n \/\/ get vectorize.\n geoms = vector<Vec3>();\n T aavg(0);\n for(int i = 0; i < in.rows(); i ++)\n for(int j = 0; j < in.cols(); j ++)\n aavg += in(i, j);\n aavg \/= in.rows() * in.cols();\n for(int i = 0; i < in.rows() \/ vbox + 1; i ++)\n for(int j = 0; j < in.cols() \/ vbox + 1; j ++) {\n if(in.rows() < (i + 1) * vbox ||\n in.cols() < (j + 1) * vbox) {\n if(geoms.size() >= 1) {\n Vec3 gbuf;\n gbuf[0] = i * vbox;\n gbuf[1] = j * vbox;\n gbuf[2] = geoms[geoms.size() - 1][2];\n geoms.push_back(gbuf);\n }\n continue;\n }\n T avg(0);\n for(int ii = i * vbox; ii < (i + 1) * vbox; ii ++)\n for(int jj = j * vbox; jj < (j + 1) * vbox; jj ++)\n avg += in(ii, jj);\n Vec3 work;\n work[0] = i * vbox;\n work[1] = j * vbox;\n const T intens(avg \/ vbox \/ vbox - aavg);\n work[2] = - intens * sqrt(T(in.rows() * in.cols())) * rz;\n geoms.push_back(work);\n }\n Vec3 avg;\n avg[0] = avg[1] = avg[2] = T(0);\n for(int i = 0; i < geoms.size(); i ++)\n avg += geoms[i];\n avg \/= geoms.size();\n for(int i = 0; i < geoms.size(); i ++)\n geoms[i][2] -= avg[2];\n delaunay = vector<Veci3>();\n for(int i = 1; i < in.rows() \/ vbox + 1; i ++)\n for(int j = 0; j < in.cols() \/ vbox; j ++) {\n Veci3 work, work2;\n work[0] = (i - 1) * (in.cols() \/ vbox + 1) + j;\n work[1] = i * (in.cols() \/ vbox + 1) + j;\n work[2] = i * (in.cols() \/ vbox + 1) + j + 1;\n work2[0] = (i - 1) * (in.cols() \/ vbox + 1) + j;\n work2[2] = (i - 1) * (in.cols() \/ vbox + 1) + j + 1;\n work2[1] = i * (in.cols() \/ vbox + 1) + j + 1;\n delaunay.push_back(work);\n delaunay.push_back(work2);\n }\n return;\n}\n\ntemplate <typename T> Eigen::Matrix<T, Eigen::Dynamic, Eigen::Dynamic> PseudoBump<T>::prepareLineAxis(const T& rstp) {\n Vec camera(2);\n camera[0] = T(0);\n camera[1] = - T(1);\n \n Mat result(int(sqrt(rstp) * T(4)), Dops.cols());\n T absmax(0);\n#if defined(_OPENMP)\n#pragma omp parallel for schedule(static, 1)\n#endif\n for(int zi = 0; zi < result.rows(); zi ++)\n for(int s = 0; s < result.cols(); s ++) {\n Vec cpoint(2);\n cpoint[0] = s \/ T(result.cols() - 1) - 1 \/ T(2);\n \/\/ [1, rstp] works well and scaling works rapidly better.\n cpoint[1] = (T(1) - pow(zi \/ T(result.rows()), T(2))) * rstp * T(2);\n \/\/ x-z plane projection of point p with camera geometry c to z=0.\n \/\/ c := camera, p := cpoint.\n \/\/ <c + (p - c) * t, [0, 1]> = 0\n const T t(- camera[1] \/ (cpoint[1] - camera[1]));\n result(zi, s) = (camera + (cpoint - camera) * t)[0];\n#if defined(_OPENMP)\n#pragma omp atomic\n#endif\n absmax = max(abs(result(zi, s)), absmax);\n }\n return result * rstp \/ absmax;\n}\n\ntemplate <typename T> const T& PseudoBump<T>::getImgPt(const Vec& img, const T& y) {\n const int& h(img.size());\n const int yy(abs((int(y + .5) + 3 * h) % (2 * h) - h) % h);\n return img[yy];\n}\n\n#define _2D3D_PSEUDO_\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of SpeakEasy.\n * Copyright (C) 2011-2013 Lambert Clara <lambert.clara@yahoo.fr>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * @mainpage SpeakEasy documentation\n * @file main.cpp\n * @brief SpeakEasy main\n *\n * @author Lambert Clara <lambert.clara@yahoo.fr>\n * @date Created : 2011-08-19\n *\/\n\n\/\/ activate debug console output on WIN32 and debug target\n#if defined(WIN32) && ! defined(NDEBUG)\n# pragma comment(linker, \"\/SUBSYSTEM:CONSOLE\")\n#endif \/\/ WIN32 && !NDEBUG\n\n#include <csignal>\n#include <cstdlib>\n#include <thread>\n\n#include \"SE_CGUIManager.h\"\n#include \"SE_CLogManager.h\"\n#include \"SE_CMemoryManager.h\"\n#include \"SE_CRenderManager.h\"\n\n#include \"SE_CClock.h\"\n\nconst U32 g_IdealFPS = 60;\nconst F32 g_IdealFrameTime = 1000.f\/g_IdealFPS;\n\nbool gs_EngineRunning = true;\n\nstatic SE_CLogManager gs_LogManager;\nstatic SE_CMemoryManager gs_MemoryManager;\nstatic SE_CGUIManager gs_GUIManager;\nstatic SE_CRenderManager gs_RenderManager;\n\nstatic SE_CClock gs_MainClock;\n\n\/\/ AudioManager\n\/\/ InputManager\n\/\/ ErrorManager\n\/\/ ResourceManager\n\/\/ PhysicsManager\n\/\/ SceneManager\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid handleCommandLineArguments(I32 const inArgc,\n const char * const * const inpArgv)\n{\n for(I32 i = 0; i < inArgc; ++i)\n {\n seLogDebug(\"inpArgv[\", i, \"] = \", inpArgv[i]);\n }\n}\n\n\n#if !defined(WIN32)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid signalHandler(const I32 inSignalCode)\n{\n seLogDebug(\"Caught signal \", inSignalCode);\n gs_EngineRunning = false;\n}\n#endif \/\/ !defined(WIN32)\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nI32 main(I32 const inArgc,\n char const * const * const inpArgv)\n{\n#ifdef WIN32\n \/\/ get the arguments usually set by WinMain\n HINSTANCE const hInstance = GetModuleHandle(nullptr);\n int const nCmdShow = SW_SHOWDEFAULT;\n (void)hInstance;\n (void)nCmdShow;\n#else \/\/ WIN32\n \/\/ Setup signal catching\n struct sigaction currentAction;\n currentAction.sa_handler = signalHandler;\n sigaction(SIGINT, ¤tAction, NULL);\n#endif \/\/ WIN32\n\n \/\/ Start up engine systems in the correct order, starting with log manager\n bool startUpSuccess = gs_LogManager.startUp(ELogLevel::kDebug);\n seLogDebug(\"SE_DEBUG defined\");\n\n \/\/ handle the command line arguments\n handleCommandLineArguments(inArgc, inpArgv);\n\n startUpSuccess = startUpSuccess && gs_MemoryManager.startUp();\n startUpSuccess = startUpSuccess && gs_GUIManager.startUp();\n startUpSuccess = startUpSuccess && gs_RenderManager.startUp();\n\n if(startUpSuccess)\n {\n \/\/ Start the main clock\n gs_MainClock.start();\n\n seLogDebug(\"SpeakEasy subsystems successfully started\");\n\n U32 framesCount = 0;\n F32 timeSeconds = 0.f;\n while(gs_EngineRunning) \/\/ main game loop\n {\n F32 const deltaSeconds = gs_MainClock.update();\n {\n gs_RenderManager.render();\n ++framesCount;\n gs_EngineRunning &= gs_GUIManager.doWork();\n }\n\n \/\/ Output FPS to command line\n timeSeconds += deltaSeconds;\n if(timeSeconds > 1000.0f)\n {\n seLogDebug(\"FPS:\", (1000*framesCount)\/timeSeconds);\n timeSeconds = 0.f;\n framesCount = 0;\n }\n }\n }\n else\n {\n seLogDebug(\"SpeakEasy subsystems failed to start\");\n }\n\n seLogDebug(\"Exiting...\");\n\n \/\/ Shut everything down, in reverse order\n bool shutDownSuccess = gs_RenderManager.shutDown();\n shutDownSuccess &= gs_GUIManager.shutDown();\n shutDownSuccess &= gs_MemoryManager.shutDown();\n shutDownSuccess &= gs_LogManager.shutDown();\n\n return shutDownSuccess ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<commit_msg>Add a message when subsystems correctly shut downed<commit_after>\/*\n * This file is part of SpeakEasy.\n * Copyright (C) 2011-2013 Lambert Clara <lambert.clara@yahoo.fr>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n\/**\n * @mainpage SpeakEasy documentation\n * @file main.cpp\n * @brief SpeakEasy main\n *\n * @author Lambert Clara <lambert.clara@yahoo.fr>\n * @date Created : 2011-08-19\n *\/\n\n\/\/ activate debug console output on WIN32 and debug target\n#if defined(WIN32) && ! defined(NDEBUG)\n# pragma comment(linker, \"\/SUBSYSTEM:CONSOLE\")\n#endif \/\/ WIN32 && !NDEBUG\n\n#include <csignal>\n#include <cstdlib>\n#include <thread>\n\n#include \"SE_CGUIManager.h\"\n#include \"SE_CLogManager.h\"\n#include \"SE_CMemoryManager.h\"\n#include \"SE_CRenderManager.h\"\n\n#include \"SE_CClock.h\"\n\nconst U32 g_IdealFPS = 60;\nconst F32 g_IdealFrameTime = 1000.f\/g_IdealFPS;\n\nbool gs_EngineRunning = true;\n\nstatic SE_CLogManager gs_LogManager;\nstatic SE_CMemoryManager gs_MemoryManager;\nstatic SE_CGUIManager gs_GUIManager;\nstatic SE_CRenderManager gs_RenderManager;\n\nstatic SE_CClock gs_MainClock;\n\n\/\/ AudioManager\n\/\/ InputManager\n\/\/ ErrorManager\n\/\/ ResourceManager\n\/\/ PhysicsManager\n\/\/ SceneManager\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid handleCommandLineArguments(I32 const inArgc,\n const char * const * const inpArgv)\n{\n for(I32 i = 0; i < inArgc; ++i)\n {\n seLogDebug(\"inpArgv[\", i, \"] = \", inpArgv[i]);\n }\n}\n\n\n#if !defined(WIN32)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid signalHandler(const I32 inSignalCode)\n{\n seLogDebug(\"Caught signal \", inSignalCode);\n gs_EngineRunning = false;\n}\n#endif \/\/ !defined(WIN32)\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nI32 main(I32 const inArgc,\n char const * const * const inpArgv)\n{\n#ifdef WIN32\n \/\/ get the arguments usually set by WinMain\n HINSTANCE const hInstance = GetModuleHandle(nullptr);\n int const nCmdShow = SW_SHOWDEFAULT;\n (void)hInstance;\n (void)nCmdShow;\n#else \/\/ WIN32\n \/\/ Setup signal catching\n struct sigaction currentAction;\n currentAction.sa_handler = signalHandler;\n sigaction(SIGINT, ¤tAction, NULL);\n#endif \/\/ WIN32\n\n \/\/ Start up engine systems in the correct order, starting with log manager\n bool startUpSuccess = gs_LogManager.startUp(ELogLevel::kDebug);\n seLogDebug(\"SE_DEBUG defined\");\n\n \/\/ handle the command line arguments\n handleCommandLineArguments(inArgc, inpArgv);\n\n startUpSuccess = startUpSuccess && gs_MemoryManager.startUp();\n startUpSuccess = startUpSuccess && gs_GUIManager.startUp();\n startUpSuccess = startUpSuccess && gs_RenderManager.startUp();\n\n if(startUpSuccess)\n {\n \/\/ Start the main clock\n gs_MainClock.start();\n\n seLogDebug(\"SpeakEasy subsystems successfully started\");\n\n U32 framesCount = 0;\n F32 timeSeconds = 0.f;\n while(gs_EngineRunning) \/\/ main game loop\n {\n F32 const deltaSeconds = gs_MainClock.update();\n {\n gs_RenderManager.render();\n ++framesCount;\n gs_EngineRunning &= gs_GUIManager.doWork();\n }\n\n \/\/ Output FPS to command line\n timeSeconds += deltaSeconds;\n if(timeSeconds > 1000.0f)\n {\n seLogDebug(\"FPS:\", (1000*framesCount)\/timeSeconds);\n timeSeconds = 0.f;\n framesCount = 0;\n }\n }\n }\n else\n {\n seLogDebug(\"SpeakEasy subsystems failed to start\");\n }\n\n seLogDebug(\"Exiting...\");\n\n \/\/ Shut everything down, in reverse order\n bool shutDownSuccess = gs_RenderManager.shutDown();\n shutDownSuccess &= gs_GUIManager.shutDown();\n shutDownSuccess &= gs_MemoryManager.shutDown();\n shutDownSuccess &= gs_LogManager.shutDown();\n\n if(shutDownSuccess)\n {\n seLogDebug(\"SpeakEasy subsystems successfully shut downed\");\n }\n\n return shutDownSuccess ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdio.h>\n#include <errno.h>\n#include <stdlib.h>\n\nusing namespace std;\n\nvoid connectors(string userinput, vector<int> &x, vector<int> &y, bool &first) {\n\tfor(unsigned int i = 0; i < userinput.size() - 1; i++) {\n\t\tif((userinput.at(i) == '|') && (userinput.at(i + 1) == '|')) {\n\t\t\tx.push_back(0);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == '&') && (userinput.at(i + 1) == '&')) {\n\t\t\tx.push_back(1);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == ';')) {\n\t\t\tx.push_back(2);\n\t\t\ty.push_back(i);\n\t\t}\n\t}\n\tif(userinput.at(0) == '&' || userinput.at(0) == '|' || userinput.at(0) == ';')\n\t\tfirst = true;\n\tx.push_back(-1);\n}\n\nint main() {\n\tstring userinput; \n\tstring login;\n\tif(!getlogin())\n\t\tperror(\"getlogin\"); \n\telse \n\t\tlogin = getlogin(); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\tchar limits[6] = \";&| \\t\";\n\tbool ext = false;\n\twhile(!ext) {\n\t\tcout << getlogin() << \"@\" << hostname << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tgetline(cin, userinput);\n\t\tif(userinput.size() == 0)\n\t\t\tuserinput+=\"#\";\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tuserinput.size();\n\t\tconnectors(userinput, c_pat, c_pos, first);\n\t\tint x = 0;\n\t\tunsigned int b = 0;\n\t\tint y = 0;\n\t\tchar *arg[100000];\n\t\twhile(userinput.substr(x, c_pos.at(y) -x)) {\n\t\t\tif(first) {\n\t\t\t\tcout << \"Error: file does not exist\" << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(c_pat.size() == 1)\n\t\t\t\tstrcpy(command, userinput.c_str());\n\t\t\telse\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\tcommand_a = strtok(command,limits);\n\t\t\twhile(command_a != NULL) {\n\t\t\t\tif(command_a[0] == '#') \n\t\t\t\t\tbreak;\n\t\t\t\targ[b] = command_a;\n\t\t\t\tcommand_a = strtok(NULL, limits);\n\t\t\t\tb++;\n\t\t\t}\n\t\t\tint i = fork();\n\t\t\tif(i == -1)\n\t\t\t\tperror(\"fork\");\n\t\t\tif(i == 0) {\n\t\t\t\tif(execvp(arg[0], arg) == -1)\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tint status;\n\t\t\twait(&status);\n\t\t\tx = c_pos.at(y);\n\t\t\tunsigned int help = c_pat.at(y);\n\t\t\tfor(unsigned int i = 0; i < b; i++)\n\t\t\t\targ[i] = NULL;\n\t\t\tif(help == 0 && status != -1 && userinput.find(\"&&\", y) != string::npos && userinput.find(\";\", y) != string::npos) \n\t\t\t\ty++;\n\t\t\telse if(help == 0 && status != -1) {\n\t\t\t\ty++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(help == 1 && status == -1 && userinput.find(\"||\", y) != string::npos && userinput.find(\";\", y) != string::npos) \n\t\t\t\ty++; \n\t\t\telse if(help == 1 && status == -1) {\n\t\t\t\ty++;\n\t\t\t\tbreak;\n\t\t\t}\t\n\t\t\telse \n\t\t\t\ty++;\n\t\t\tb = 0;\t\t\t\n\t\t}\n\t\t\n\t}\t\n\treturn 0;\n}\n<commit_msg>found algorithm solution?<commit_after>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdio.h>\n#include <errno.h>\n#include <stdlib.h>\n\nusing namespace std;\n\nvoid connectors(string userinput, vector<int> &x, vector<int> &y, bool &first) {\n\tfor(unsigned int i = 0; i < userinput.size() - 1; i++) {\n\t\tif((userinput.at(i) == '|') && (userinput.at(i + 1) == '|')) {\n\t\t\tx.push_back(0);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == '&') && (userinput.at(i + 1) == '&')) {\n\t\t\tx.push_back(1);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == ';')) {\n\t\t\tx.push_back(2);\n\t\t\ty.push_back(i);\n\t\t}\n\t}\n\tif(userinput.at(0) == '&' || userinput.at(0) == '|' || userinput.at(0) == ';')\n\t\tfirst = true;\n\tx.push_back(userinput.size() - 1);\n\ty.push_back(userinput.size() - 1);\n}\n\nint main() {\n\tstring userinput; \n\tstring login;\n\tif(!getlogin())\n\t\tperror(\"getlogin\"); \n\telse \n\t\tlogin = getlogin(); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\tchar limits[6] = \";&| \\t\";\n\tbool ext = false;\n\twhile(!ext) {\n\t\tcout << getlogin() << \"@\" << hostname << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tgetline(cin, userinput);\n\t\tif(userinput.size() == 0)\n\t\t\tuserinput+=\"#\";\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tuserinput.size();\n\t\tconnectors(userinput, c_pat, c_pos, first);\n\t\tint x = 0;\n\t\tunsigned int b = 0;\n\t\tint y = 0;\n\t\tchar *arg[100000];\n\t\twhile(userinput.substr(x + 1, 1) != \"\"){\n\t\t\tif(first) {\n\t\t\t\tcout << \"Error: file does not exist\" << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(c_pat.size() == 1)\n\t\t\t\tstrcpy(command, userinput.c_str());\n\t\t\telse\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\tcommand_a = strtok(command,limits);\n\t\t\twhile(command_a != NULL) {\n\t\t\t\tif(command_a[0] == '#') \n\t\t\t\t\tbreak;\n\t\t\t\targ[b] = command_a;\n\t\t\t\tcommand_a = strtok(NULL, limits);\n\t\t\t\tb++;\n\t\t\t}\n\t\t\tint i = fork();\n\t\t\tif(i == -1)\n\t\t\t\tperror(\"fork\");\n\t\t\tif(i == 0) {\n\t\t\t\tif(execvp(arg[0], arg) == -1)\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tint status;\n\t\t\twait(&status);\n\t\t\tx = c_pos.at(y);\n\t\t\tunsigned int help = c_pat.at(y);\n\t\t\tfor(unsigned int i = 0; i < b; i++)\n\t\t\t\targ[i] = NULL;\n\t\t\tif(help == 0 && status != -1 && userinput.find(\"&&\", y) != string::npos && userinput.find(\";\", y) != string::npos) \n\t\t\t\ty++;\n\t\t\telse if(help == 0 && status != -1) {\n\t\t\t\ty++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(help == 1 && status == -1 && userinput.find(\"||\", y) != string::npos && userinput.find(\";\", y) != string::npos) \n\t\t\t\ty++; \n\t\t\telse if(help == 1 && status == -1) {\n\t\t\t\ty++;\n\t\t\t\tbreak;\n\t\t\t}\t\n\t\t\telse \n\t\t\t\ty++;\n\t\t\tb = 0;\t\t\t\n\t\t}\n\t\t\n\t}\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix compilation of LONG unit tests<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright © 2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * \\file ir_algebraic.cpp\n *\n * Takes advantage of association, commutivity, and other algebraic\n * properties to simplify expressions.\n *\/\n\n#include \"ir.h\"\n#include \"ir_visitor.h\"\n#include \"ir_optimization.h\"\n#include \"glsl_types.h\"\n\n\/**\n * Visitor class for replacing expressions with ir_constant values.\n *\/\n\nclass ir_algebraic_visitor : public ir_hierarchical_visitor {\npublic:\n ir_algebraic_visitor()\n {\n this->progress = false;\n }\n\n virtual ~ir_algebraic_visitor()\n {\n }\n\n virtual ir_visitor_status visit_leave(ir_assignment *);\n virtual ir_visitor_status visit_leave(ir_call *);\n virtual ir_visitor_status visit_leave(ir_dereference_array *);\n virtual ir_visitor_status visit_leave(ir_expression *);\n virtual ir_visitor_status visit_leave(ir_if *);\n virtual ir_visitor_status visit_leave(ir_return *);\n virtual ir_visitor_status visit_leave(ir_swizzle *);\n virtual ir_visitor_status visit_leave(ir_texture *);\n\n ir_rvalue *handle_expression(ir_rvalue *in_ir);\n\n bool progress;\n};\n\nstatic bool\nis_vec_zero(ir_constant *ir)\n{\n int c;\n\n if (!ir)\n return false;\n if (!ir->type->is_scalar() &&\n !ir->type->is_vector())\n return false;\n\n for (c = 0; c < ir->type->vector_elements; c++) {\n switch (ir->type->base_type) {\n case GLSL_TYPE_FLOAT:\n\t if (ir->value.f[c] != 0.0)\n\t return false;\n\t break;\n case GLSL_TYPE_INT:\n\t if (ir->value.i[c] != 0)\n\t return false;\n\t break;\n case GLSL_TYPE_UINT:\n\t if (ir->value.u[c] != 0)\n\t return false;\n\t break;\n case GLSL_TYPE_BOOL:\n\t if (ir->value.b[c] != false)\n\t return false;\n\t break;\n default:\n\t assert(!\"bad base type\");\n\t return false;\n }\n }\n\n return true;\n}\n\nstatic bool\nis_vec_one(ir_constant *ir)\n{\n int c;\n\n if (!ir)\n return false;\n if (!ir->type->is_scalar() &&\n !ir->type->is_vector())\n return false;\n\n for (c = 0; c < ir->type->vector_elements; c++) {\n switch (ir->type->base_type) {\n case GLSL_TYPE_FLOAT:\n\t if (ir->value.f[c] != 1.0)\n\t return false;\n\t break;\n case GLSL_TYPE_INT:\n\t if (ir->value.i[c] != 1)\n\t return false;\n\t break;\n case GLSL_TYPE_UINT:\n\t if (ir->value.u[c] != 1)\n\t return false;\n\t break;\n case GLSL_TYPE_BOOL:\n\t if (ir->value.b[c] != true)\n\t return false;\n\t break;\n default:\n\t assert(!\"bad base type\");\n\t return false;\n }\n }\n\n return true;\n}\n\nir_rvalue *\nir_algebraic_visitor::handle_expression(ir_rvalue *in_ir)\n{\n ir_expression *ir = (ir_expression *)in_ir;\n ir_constant *op_const[2] = {NULL, NULL};\n ir_expression *op_expr[2] = {NULL, NULL};\n unsigned int i;\n\n if (!in_ir)\n return NULL;\n\n if (in_ir->ir_type != ir_type_expression)\n return in_ir;\n\n for (i = 0; i < ir->get_num_operands(); i++) {\n if (ir->operands[i]->type->is_matrix())\n\t return in_ir;\n\n op_const[i] = ir->operands[i]->constant_expression_value();\n op_expr[i] = ir->operands[i]->as_expression();\n }\n\n switch (ir->operation) {\n case ir_unop_logic_not: {\n enum ir_expression_operation new_op = ir_unop_logic_not;\n\n if (op_expr[0] == NULL)\n\t break;\n\n switch (op_expr[0]->operation) {\n case ir_binop_equal: new_op = ir_binop_nequal; break;\n case ir_binop_nequal: new_op = ir_binop_equal; break;\n\n default:\n\t \/* The default case handler is here to silence a warning from GCC.\n\t *\/\n\t break;\n }\n\n if (new_op != ir_unop_logic_not) {\n\t this->progress = true;\n\t return new(ir) ir_expression(new_op,\n\t\t\t\t ir->type,\n\t\t\t\t op_expr[0]->operands[0],\n\t\t\t\t op_expr[0]->operands[1]);\n }\n\n break;\n }\n\n case ir_binop_add:\n if (is_vec_zero(op_const[0])) {\n\t this->progress = true;\n\t return ir->operands[1];\n }\n if (is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_binop_sub:\n if (is_vec_zero(op_const[0])) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_neg,\n\t\t\t\t ir->type,\n\t\t\t\t ir->operands[1],\n\t\t\t\t NULL);\n }\n if (is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_binop_mul:\n if (is_vec_one(op_const[0])) {\n\t this->progress = true;\n\t return ir->operands[1];\n }\n if (is_vec_one(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n\n if (is_vec_zero(op_const[0]) || is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir_constant::zero(ir, ir->type);\n }\n break;\n\n case ir_binop_div:\n if (is_vec_one(op_const[0]) && ir->type->base_type == GLSL_TYPE_FLOAT) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_rcp,\n\t\t\t\t ir->type,\n\t\t\t\t ir->operands[1],\n\t\t\t\t NULL);\n }\n if (is_vec_one(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_unop_rcp:\n if (op_expr[0] && op_expr[0]->operation == ir_unop_rcp) {\n\t this->progress = true;\n\t return op_expr[0]->operands[0];\n }\n\n \/* FINISHME: We should do rcp(rsq(x)) -> sqrt(x) for some\n * backends, except that some backends will have done sqrt ->\n * rcp(rsq(x)) and we don't want to undo it for them.\n *\/\n\n \/* As far as we know, all backends are OK with rsq. *\/\n if (op_expr[0] && op_expr[0]->operation == ir_unop_sqrt) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_rsq,\n\t\t\t\t ir->type,\n\t\t\t\t op_expr[0]->operands[0],\n\t\t\t\t NULL);\n }\n\n break;\n\n default:\n break;\n }\n\n return in_ir;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_expression *ir)\n{\n unsigned int operand;\n\n for (operand = 0; operand < ir->get_num_operands(); operand++) {\n ir->operands[operand] = handle_expression(ir->operands[operand]);\n }\n\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_texture *ir)\n{\n ir->coordinate = handle_expression(ir->coordinate);\n ir->projector = handle_expression(ir->projector);\n ir->shadow_comparitor = handle_expression(ir->shadow_comparitor);\n\n switch (ir->op) {\n case ir_tex:\n break;\n case ir_txb:\n ir->lod_info.bias = handle_expression(ir->lod_info.bias);\n break;\n case ir_txf:\n case ir_txl:\n ir->lod_info.lod = handle_expression(ir->lod_info.lod);\n break;\n case ir_txd:\n ir->lod_info.grad.dPdx = handle_expression(ir->lod_info.grad.dPdx);\n ir->lod_info.grad.dPdy = handle_expression(ir->lod_info.grad.dPdy);\n break;\n }\n\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_swizzle *ir)\n{\n ir->val = handle_expression(ir->val);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_dereference_array *ir)\n{\n ir->array_index = handle_expression(ir->array_index);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_assignment *ir)\n{\n ir->rhs = handle_expression(ir->rhs);\n ir->condition = handle_expression(ir->condition);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_call *ir)\n{\n foreach_iter(exec_list_iterator, iter, *ir) {\n ir_rvalue *param = (ir_rvalue *)iter.get();\n ir_rvalue *new_param = handle_expression(param);\n\n if (new_param != param) {\n\t param->replace_with(new_param);\n }\n }\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_return *ir)\n{\n ir->value = handle_expression(ir->value);;\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_if *ir)\n{\n ir->condition = handle_expression(ir->condition);\n return visit_continue;\n}\n\n\nbool\ndo_algebraic(exec_list *instructions)\n{\n ir_algebraic_visitor v;\n\n visit_list_elements(&v, instructions);\n\n return v.progress;\n}\n<commit_msg>ir_algebraic: Support other comparisons in ir_unop_logic_not<commit_after>\/*\n * Copyright © 2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *\/\n\n\/**\n * \\file ir_algebraic.cpp\n *\n * Takes advantage of association, commutivity, and other algebraic\n * properties to simplify expressions.\n *\/\n\n#include \"ir.h\"\n#include \"ir_visitor.h\"\n#include \"ir_optimization.h\"\n#include \"glsl_types.h\"\n\n\/**\n * Visitor class for replacing expressions with ir_constant values.\n *\/\n\nclass ir_algebraic_visitor : public ir_hierarchical_visitor {\npublic:\n ir_algebraic_visitor()\n {\n this->progress = false;\n }\n\n virtual ~ir_algebraic_visitor()\n {\n }\n\n virtual ir_visitor_status visit_leave(ir_assignment *);\n virtual ir_visitor_status visit_leave(ir_call *);\n virtual ir_visitor_status visit_leave(ir_dereference_array *);\n virtual ir_visitor_status visit_leave(ir_expression *);\n virtual ir_visitor_status visit_leave(ir_if *);\n virtual ir_visitor_status visit_leave(ir_return *);\n virtual ir_visitor_status visit_leave(ir_swizzle *);\n virtual ir_visitor_status visit_leave(ir_texture *);\n\n ir_rvalue *handle_expression(ir_rvalue *in_ir);\n\n bool progress;\n};\n\nstatic bool\nis_vec_zero(ir_constant *ir)\n{\n int c;\n\n if (!ir)\n return false;\n if (!ir->type->is_scalar() &&\n !ir->type->is_vector())\n return false;\n\n for (c = 0; c < ir->type->vector_elements; c++) {\n switch (ir->type->base_type) {\n case GLSL_TYPE_FLOAT:\n\t if (ir->value.f[c] != 0.0)\n\t return false;\n\t break;\n case GLSL_TYPE_INT:\n\t if (ir->value.i[c] != 0)\n\t return false;\n\t break;\n case GLSL_TYPE_UINT:\n\t if (ir->value.u[c] != 0)\n\t return false;\n\t break;\n case GLSL_TYPE_BOOL:\n\t if (ir->value.b[c] != false)\n\t return false;\n\t break;\n default:\n\t assert(!\"bad base type\");\n\t return false;\n }\n }\n\n return true;\n}\n\nstatic bool\nis_vec_one(ir_constant *ir)\n{\n int c;\n\n if (!ir)\n return false;\n if (!ir->type->is_scalar() &&\n !ir->type->is_vector())\n return false;\n\n for (c = 0; c < ir->type->vector_elements; c++) {\n switch (ir->type->base_type) {\n case GLSL_TYPE_FLOAT:\n\t if (ir->value.f[c] != 1.0)\n\t return false;\n\t break;\n case GLSL_TYPE_INT:\n\t if (ir->value.i[c] != 1)\n\t return false;\n\t break;\n case GLSL_TYPE_UINT:\n\t if (ir->value.u[c] != 1)\n\t return false;\n\t break;\n case GLSL_TYPE_BOOL:\n\t if (ir->value.b[c] != true)\n\t return false;\n\t break;\n default:\n\t assert(!\"bad base type\");\n\t return false;\n }\n }\n\n return true;\n}\n\nir_rvalue *\nir_algebraic_visitor::handle_expression(ir_rvalue *in_ir)\n{\n ir_expression *ir = (ir_expression *)in_ir;\n ir_constant *op_const[2] = {NULL, NULL};\n ir_expression *op_expr[2] = {NULL, NULL};\n unsigned int i;\n\n if (!in_ir)\n return NULL;\n\n if (in_ir->ir_type != ir_type_expression)\n return in_ir;\n\n for (i = 0; i < ir->get_num_operands(); i++) {\n if (ir->operands[i]->type->is_matrix())\n\t return in_ir;\n\n op_const[i] = ir->operands[i]->constant_expression_value();\n op_expr[i] = ir->operands[i]->as_expression();\n }\n\n switch (ir->operation) {\n case ir_unop_logic_not: {\n enum ir_expression_operation new_op = ir_unop_logic_not;\n\n if (op_expr[0] == NULL)\n\t break;\n\n switch (op_expr[0]->operation) {\n case ir_binop_less: new_op = ir_binop_gequal; break;\n case ir_binop_greater: new_op = ir_binop_lequal; break;\n case ir_binop_lequal: new_op = ir_binop_greater; break;\n case ir_binop_gequal: new_op = ir_binop_less; break;\n case ir_binop_equal: new_op = ir_binop_nequal; break;\n case ir_binop_nequal: new_op = ir_binop_equal; break;\n\n default:\n\t \/* The default case handler is here to silence a warning from GCC.\n\t *\/\n\t break;\n }\n\n if (new_op != ir_unop_logic_not) {\n\t this->progress = true;\n\t return new(ir) ir_expression(new_op,\n\t\t\t\t ir->type,\n\t\t\t\t op_expr[0]->operands[0],\n\t\t\t\t op_expr[0]->operands[1]);\n }\n\n break;\n }\n\n case ir_binop_add:\n if (is_vec_zero(op_const[0])) {\n\t this->progress = true;\n\t return ir->operands[1];\n }\n if (is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_binop_sub:\n if (is_vec_zero(op_const[0])) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_neg,\n\t\t\t\t ir->type,\n\t\t\t\t ir->operands[1],\n\t\t\t\t NULL);\n }\n if (is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_binop_mul:\n if (is_vec_one(op_const[0])) {\n\t this->progress = true;\n\t return ir->operands[1];\n }\n if (is_vec_one(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n\n if (is_vec_zero(op_const[0]) || is_vec_zero(op_const[1])) {\n\t this->progress = true;\n\t return ir_constant::zero(ir, ir->type);\n }\n break;\n\n case ir_binop_div:\n if (is_vec_one(op_const[0]) && ir->type->base_type == GLSL_TYPE_FLOAT) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_rcp,\n\t\t\t\t ir->type,\n\t\t\t\t ir->operands[1],\n\t\t\t\t NULL);\n }\n if (is_vec_one(op_const[1])) {\n\t this->progress = true;\n\t return ir->operands[0];\n }\n break;\n\n case ir_unop_rcp:\n if (op_expr[0] && op_expr[0]->operation == ir_unop_rcp) {\n\t this->progress = true;\n\t return op_expr[0]->operands[0];\n }\n\n \/* FINISHME: We should do rcp(rsq(x)) -> sqrt(x) for some\n * backends, except that some backends will have done sqrt ->\n * rcp(rsq(x)) and we don't want to undo it for them.\n *\/\n\n \/* As far as we know, all backends are OK with rsq. *\/\n if (op_expr[0] && op_expr[0]->operation == ir_unop_sqrt) {\n\t this->progress = true;\n\t return new(ir) ir_expression(ir_unop_rsq,\n\t\t\t\t ir->type,\n\t\t\t\t op_expr[0]->operands[0],\n\t\t\t\t NULL);\n }\n\n break;\n\n default:\n break;\n }\n\n return in_ir;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_expression *ir)\n{\n unsigned int operand;\n\n for (operand = 0; operand < ir->get_num_operands(); operand++) {\n ir->operands[operand] = handle_expression(ir->operands[operand]);\n }\n\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_texture *ir)\n{\n ir->coordinate = handle_expression(ir->coordinate);\n ir->projector = handle_expression(ir->projector);\n ir->shadow_comparitor = handle_expression(ir->shadow_comparitor);\n\n switch (ir->op) {\n case ir_tex:\n break;\n case ir_txb:\n ir->lod_info.bias = handle_expression(ir->lod_info.bias);\n break;\n case ir_txf:\n case ir_txl:\n ir->lod_info.lod = handle_expression(ir->lod_info.lod);\n break;\n case ir_txd:\n ir->lod_info.grad.dPdx = handle_expression(ir->lod_info.grad.dPdx);\n ir->lod_info.grad.dPdy = handle_expression(ir->lod_info.grad.dPdy);\n break;\n }\n\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_swizzle *ir)\n{\n ir->val = handle_expression(ir->val);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_dereference_array *ir)\n{\n ir->array_index = handle_expression(ir->array_index);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_assignment *ir)\n{\n ir->rhs = handle_expression(ir->rhs);\n ir->condition = handle_expression(ir->condition);\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_call *ir)\n{\n foreach_iter(exec_list_iterator, iter, *ir) {\n ir_rvalue *param = (ir_rvalue *)iter.get();\n ir_rvalue *new_param = handle_expression(param);\n\n if (new_param != param) {\n\t param->replace_with(new_param);\n }\n }\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_return *ir)\n{\n ir->value = handle_expression(ir->value);;\n return visit_continue;\n}\n\nir_visitor_status\nir_algebraic_visitor::visit_leave(ir_if *ir)\n{\n ir->condition = handle_expression(ir->condition);\n return visit_continue;\n}\n\n\nbool\ndo_algebraic(exec_list *instructions)\n{\n ir_algebraic_visitor v;\n\n visit_list_elements(&v, instructions);\n\n return v.progress;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Adding missing file from previous commit.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\r\n * shrenderer.cpp\r\n *\r\n * Created on: 03.07.2012\r\n * @author Ralph Schurade\r\n *\/\r\n#include \"shrenderer.h\"\r\n#include \"shrendererthread.h\"\r\n#include \"glfunctions.h\"\r\n\r\n#include \"..\/..\/data\/datasets\/datasetsh.h\"\r\n#include \"..\/..\/data\/enums.h\"\r\n#include \"..\/..\/data\/models.h\"\r\n#include \"..\/..\/data\/vptr.h\"\r\n#include \"..\/..\/algos\/fmath.h\"\r\n#include \"..\/..\/algos\/qball.h\"\r\n\r\n#include \"..\/..\/data\/mesh\/tesselation.h\"\r\n#include \"..\/..\/data\/mesh\/trianglemesh2.h\"\r\n\r\n#include \"..\/..\/thirdparty\/newmat10\/newmat.h\"\r\n\r\n#include <QGLShaderProgram>\r\n#include <QDebug>\r\n\r\n#include <limits>\r\n\r\nSHRenderer::SHRenderer( std::vector<ColumnVector>* data ) :\r\n ObjectRenderer(),\r\n m_tris( 0 ),\r\n vboIds( new GLuint[ 4 ] ),\r\n m_data( data ),\r\n m_scaling( 1.0 ),\r\n m_orient( 0 ),\r\n m_offset( 0 ),\r\n m_lod( 0 ),\r\n m_minMaxScaling( false ),\r\n m_order( 4 ),\r\n m_oldLoD( -1 ),\r\n m_pickId( GLFunctions::getPickIndex() ),\r\n m_updateThread( 0 ),\r\n m_glyphsUpdated( false ),\r\n m_updateRunning( false )\r\n{\r\n}\r\n\r\nSHRenderer::~SHRenderer()\r\n{\r\n glDeleteBuffers(1, &( vboIds[ 0 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 1 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 2 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 3 ] ) );\r\n}\r\n\r\nvoid SHRenderer::init()\r\n{\r\n initializeOpenGLFunctions();\r\n glGenBuffers( 4, vboIds );\r\n}\r\n\r\nvoid SHRenderer::draw( QMatrix4x4 p_matrix, QMatrix4x4 mv_matrix, int width, int height, int renderMode, PropertyGroup& props )\r\n{\r\n float alpha = 1.0; \/\/props.get( Fn::Property::D_ALPHA ).toFloat();\r\n m_renderMode = renderMode;\r\n\r\n m_pMatrix = p_matrix;\r\n m_mvMatrix = mv_matrix;\r\n\r\n switch ( renderMode )\r\n {\r\n case 0:\r\n break;\r\n case 1:\r\n {\r\n if ( alpha < 1.0 ) \/\/ obviously not opaque\r\n {\r\n return;\r\n }\r\n break;\r\n }\r\n default:\r\n {\r\n if ( alpha == 1.0 ) \/\/ not transparent\r\n {\r\n return;\r\n }\r\n break;\r\n }\r\n }\r\n\r\n setRenderParams( props );\r\n\r\n if ( m_orient == 0 )\r\n {\r\n return;\r\n }\r\n\r\n QGLShaderProgram* program = GLFunctions::getShader( \"mesh\" );\r\n\r\n program->bind();\r\n\r\n GLFunctions::setupTextures();\r\n GLFunctions::setTextureUniforms( GLFunctions::getShader( \"mesh\" ), \"maingl\" );\r\n \/\/ Set modelview-projection matrix\r\n program->setUniformValue( \"mvp_matrix\", p_matrix * mv_matrix );\r\n program->setUniformValue( \"mv_matrixInvert\", mv_matrix.inverted() );\r\n\r\n QMatrix4x4 mat;\r\n program->setUniformValue( \"userTransformMatrix\", mat );\r\n\r\n program->setUniformValue( \"u_colorMode\", 2 );\r\n program->setUniformValue( \"u_colormap\", m_colormap );\r\n program->setUniformValue( \"u_color\", m_color.redF(), m_color.greenF(), m_color.blueF(), 1.0 );\r\n program->setUniformValue( \"u_selectedMin\", m_selectedMin );\r\n program->setUniformValue( \"u_selectedMax\", m_selectedMax );\r\n program->setUniformValue( \"u_lowerThreshold\", m_lowerThreshold );\r\n program->setUniformValue( \"u_upperThreshold\", m_upperThreshold );\r\n\r\n float nx = props.get( Fn::Property::D_NX ).toFloat();\r\n float ny = props.get( Fn::Property::D_NY ).toFloat();\r\n float nz = props.get( Fn::Property::D_NZ ).toFloat();\r\n float sx = props.get( Fn::Property::G_SAGITTAL ).toFloat();\r\n float sy = props.get( Fn::Property::G_CORONAL ).toFloat();\r\n float sz = props.get( Fn::Property::G_AXIAL ).toFloat();\r\n float dx = props.get( Fn::Property::D_DX ).toFloat();\r\n float dy = props.get( Fn::Property::D_DY ).toFloat();\r\n float dz = props.get( Fn::Property::D_DZ ).toFloat();\r\n\r\n program->setUniformValue( \"u_x\", sx * dx + dx \/ 2.0f );\r\n program->setUniformValue( \"u_y\", sy * dy + dy \/ 2.0f );\r\n program->setUniformValue( \"u_z\", sz * dz + dz \/ 2.0f );\r\n program->setUniformValue( \"u_cutLowerX\", false );\r\n program->setUniformValue( \"u_cutLowerY\", false );\r\n program->setUniformValue( \"u_cutLowerZ\", false );\r\n program->setUniformValue( \"u_cutHigherX\", false );\r\n program->setUniformValue( \"u_cutHigherY\", false );\r\n program->setUniformValue( \"u_cutHigherZ\", false );\r\n\r\n program->setUniformValue( \"u_adjustX\", 0.0f );\r\n program->setUniformValue( \"u_adjustY\", 0.0f );\r\n program->setUniformValue( \"u_adjustZ\", 0.0f );\r\n\r\n program->setUniformValue( \"u_alpha\", alpha );\r\n program->setUniformValue( \"u_renderMode\", renderMode );\r\n program->setUniformValue( \"u_canvasSize\", width, height );\r\n program->setUniformValue( \"D0\", 9 );\r\n program->setUniformValue( \"D1\", 10 );\r\n program->setUniformValue( \"D2\", 11 );\r\n program->setUniformValue( \"P0\", 12 );\r\n\r\n program->setUniformValue( \"u_lighting\", props.get( Fn::Property::D_LIGHT_SWITCH ).toBool() );\r\n program->setUniformValue( \"u_lightAmbient\", props.get( Fn::Property::D_LIGHT_AMBIENT ).toFloat() );\r\n program->setUniformValue( \"u_lightDiffuse\", props.get( Fn::Property::D_LIGHT_DIFFUSE ).toFloat() );\r\n program->setUniformValue( \"u_materialAmbient\", props.get( Fn::Property::D_MATERIAL_AMBIENT ).toFloat() );\r\n program->setUniformValue( \"u_materialDiffuse\", props.get( Fn::Property::D_MATERIAL_DIFFUSE ).toFloat() );\r\n program->setUniformValue( \"u_materialSpecular\", props.get( Fn::Property::D_MATERIAL_SPECULAR ).toFloat() );\r\n program->setUniformValue( \"u_materialShininess\", props.get( Fn::Property::D_MATERIAL_SHININESS ).toFloat() );\r\n\r\n\r\n float pAlpha = 1.0;\r\n float blue = (float) ( ( m_pickId ) & 0xFF ) \/ 255.f;\r\n float green = (float) ( ( m_pickId >> 8 ) & 0xFF ) \/ 255.f;\r\n float red = (float) ( ( m_pickId >> 16 ) & 0xFF ) \/ 255.f;\r\n program->setUniformValue( \"u_pickColor\", red, green , blue, pAlpha );\r\n\r\n program->setUniformValue( \"u_dims\", nx * dx, ny * dy, nz * dz );\r\n\r\n if ( !m_updateRunning )\r\n {\r\n initGeometry( props );\r\n }\r\n\r\n if ( m_glyphsUpdated )\r\n {\r\n updateGlyphs();\r\n }\r\n\r\n if ( m_tris == 0 )\r\n {\r\n return;\r\n }\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, vboIds[ 0 ] );\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n setShaderVars( props );\r\n\r\n glEnable(GL_CULL_FACE);\r\n glCullFace( GL_BACK );\r\n glFrontFace( GL_CW );\r\n\r\n glDrawElements( GL_TRIANGLES, m_tris, GL_UNSIGNED_INT, 0 );\r\n\r\n glDisable(GL_CULL_FACE);\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n}\r\n\r\nvoid SHRenderer::setShaderVars( PropertyGroup& props )\r\n{\r\n QGLShaderProgram* program = GLFunctions::getShader( \"mesh\" );\r\n\r\n program->bind();\r\n\r\n intptr_t offset = 0;\r\n \/\/ Tell OpenGL programmable pipeline how to locate vertex position data\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n int vertexLocation = program->attributeLocation( \"a_position\" );\r\n program->enableAttributeArray( vertexLocation );\r\n glVertexAttribPointer( vertexLocation, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 3, (const void *) offset );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 3 ] );\r\n int normalLocation = program->attributeLocation( \"a_normal\" );\r\n program->enableAttributeArray( normalLocation );\r\n glVertexAttribPointer( normalLocation, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 3, (const void *) offset );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 2 ] );\r\n int colorLocation = program->attributeLocation( \"a_color\" );\r\n program->enableAttributeArray( colorLocation );\r\n glVertexAttribPointer( colorLocation, 4, GL_FLOAT, GL_FALSE, sizeof(float) * 4, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n}\r\n\r\nvoid SHRenderer::setRenderParams( PropertyGroup& props )\r\n{\r\n m_scaling = props.get( Fn::Property::D_SCALING ).toFloat();\r\n m_offset = props.get( Fn::Property::D_OFFSET ).toInt();\r\n m_lod = props.get( Fn::Property::D_LOD ).toInt();\r\n m_minMaxScaling = props.get( Fn::Property::D_MINMAX_SCALING ).toBool();\r\n m_hideNegativeLobes = props.get( Fn::Property::D_HIDE_NEGATIVE_LOBES ).toBool();\r\n m_order = props.get( Fn::Property::D_ORDER ).toInt();\r\n\r\n m_orient = 0;\r\n if ( props.get( Fn::Property::D_RENDER_AXIAL ).toBool() )\r\n {\r\n m_orient = 1;\r\n }\r\n if ( props.get( Fn::Property::D_RENDER_CORONAL ).toBool() )\r\n {\r\n m_orient += 2;\r\n }\r\n if ( props.get( Fn::Property::D_RENDER_SAGITTAL ).toBool() )\r\n {\r\n m_orient += 4;\r\n }\r\n\r\n m_colorMode = props.get( Fn::Property::D_COLORMODE ).toInt();\r\n m_colormap = props.get( Fn::Property::D_COLORMAP ).toInt();\r\n m_selectedMin = props.get( Fn::Property::D_SELECTED_MIN ).toFloat();\r\n m_selectedMax = props.get( Fn::Property::D_SELECTED_MAX ).toFloat();\r\n m_lowerThreshold = props.get( Fn::Property::D_LOWER_THRESHOLD ).toFloat();\r\n m_upperThreshold = props.get( Fn::Property::D_UPPER_THRESHOLD ).toFloat();\r\n m_color = props.get( Fn::Property::D_COLOR ).value<QColor>();\r\n}\r\n\r\n\r\nTriangleMesh2* SHRenderer::getMesh()\r\n{\r\n \/\/return m_mesh;\r\n}\r\n\r\n\r\nvoid SHRenderer::initGeometry( PropertyGroup& props )\r\n{\r\n float x = Models::getGlobal( Fn::Property::G_SAGITTAL ).toFloat();\r\n float y = Models::getGlobal( Fn::Property::G_CORONAL ).toFloat();\r\n float z = Models::getGlobal( Fn::Property::G_AXIAL ).toFloat();\r\n\r\n float zoom = Models::getGlobal( Fn::Property::G_ZOOM ).toFloat();\r\n float moveX = Models::getGlobal( Fn::Property::G_MOVEX ).toFloat();\r\n float moveY = Models::getGlobal( Fn::Property::G_MOVEY ).toFloat();\r\n\r\n QString s = createSettingsString( { x, y, z, m_orient, zoom, m_minMaxScaling, m_scaling, m_hideNegativeLobes, moveX, moveY, m_lod, m_offset } );\r\n if ( ( s == m_previousSettings ) || ( m_orient == 0 ) )\r\n {\r\n return;\r\n }\r\n m_previousSettings = s;\r\n\r\n m_updateRunning = true;\r\n m_glyphsUpdated = false;\r\n\r\n if ( m_updateThread )\r\n {\r\n delete m_updateThread;\r\n }\r\n m_updateThread = new SHRendererThread( m_data, m_pMatrix, m_mvMatrix, props );\r\n connect( m_updateThread, SIGNAL( finished( bool ) ), this, SLOT( updateThreadFinished( bool ) ) );\r\n m_updateThread->start();\r\n}\r\n\r\nvoid SHRenderer::updateThreadFinished( bool success )\r\n{\r\n if ( success )\r\n {\r\n m_glyphsUpdated = true;\r\n }\r\n m_updateRunning = false;\r\n Models::g()->submit();\r\n}\r\n\r\nvoid SHRenderer::updateGlyphs()\r\n{\r\n glDeleteBuffers( 4, vboIds );\r\n glGenBuffers( 4, vboIds );\r\n\r\n m_tris = m_updateThread->getIndices()->size();\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, vboIds[ 0 ] );\r\n glBufferData( GL_ELEMENT_ARRAY_BUFFER, m_tris * sizeof(GLuint), m_updateThread->getIndices()->data(), GL_STATIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getVerts()->size() * sizeof(GLfloat), m_updateThread->getVerts()->data(), GL_STATIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 2 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getColors()->size() * sizeof(GLfloat), m_updateThread->getColors()->data(), GL_DYNAMIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 3 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getNormals()->size() * sizeof(GLfloat), m_updateThread->getNormals()->data(), GL_STATIC_DRAW );\r\n\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n delete m_updateThread;\r\n m_updateThread = 0;\r\n m_glyphsUpdated = false;\r\n}\r\n<commit_msg>fixed crash with csd renderer when displaying a slice with no csd glyphs visible<commit_after>\/*\r\n * shrenderer.cpp\r\n *\r\n * Created on: 03.07.2012\r\n * @author Ralph Schurade\r\n *\/\r\n#include \"shrenderer.h\"\r\n#include \"shrendererthread.h\"\r\n#include \"glfunctions.h\"\r\n\r\n#include \"..\/..\/data\/datasets\/datasetsh.h\"\r\n#include \"..\/..\/data\/enums.h\"\r\n#include \"..\/..\/data\/models.h\"\r\n#include \"..\/..\/data\/vptr.h\"\r\n#include \"..\/..\/algos\/fmath.h\"\r\n#include \"..\/..\/algos\/qball.h\"\r\n\r\n#include \"..\/..\/data\/mesh\/tesselation.h\"\r\n#include \"..\/..\/data\/mesh\/trianglemesh2.h\"\r\n\r\n#include \"..\/..\/thirdparty\/newmat10\/newmat.h\"\r\n\r\n#include <QGLShaderProgram>\r\n#include <QDebug>\r\n\r\n#include <limits>\r\n\r\nSHRenderer::SHRenderer( std::vector<ColumnVector>* data ) :\r\n ObjectRenderer(),\r\n m_tris( 0 ),\r\n vboIds( new GLuint[ 4 ] ),\r\n m_data( data ),\r\n m_scaling( 1.0 ),\r\n m_orient( 0 ),\r\n m_offset( 0 ),\r\n m_lod( 0 ),\r\n m_minMaxScaling( false ),\r\n m_order( 4 ),\r\n m_oldLoD( -1 ),\r\n m_pickId( GLFunctions::getPickIndex() ),\r\n m_updateThread( 0 ),\r\n m_glyphsUpdated( false ),\r\n m_updateRunning( false )\r\n{\r\n}\r\n\r\nSHRenderer::~SHRenderer()\r\n{\r\n glDeleteBuffers(1, &( vboIds[ 0 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 1 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 2 ] ) );\r\n glDeleteBuffers(1, &( vboIds[ 3 ] ) );\r\n}\r\n\r\nvoid SHRenderer::init()\r\n{\r\n initializeOpenGLFunctions();\r\n glGenBuffers( 4, vboIds );\r\n}\r\n\r\nvoid SHRenderer::draw( QMatrix4x4 p_matrix, QMatrix4x4 mv_matrix, int width, int height, int renderMode, PropertyGroup& props )\r\n{\r\n float alpha = 1.0; \/\/props.get( Fn::Property::D_ALPHA ).toFloat();\r\n m_renderMode = renderMode;\r\n\r\n m_pMatrix = p_matrix;\r\n m_mvMatrix = mv_matrix;\r\n\r\n switch ( renderMode )\r\n {\r\n case 0:\r\n break;\r\n case 1:\r\n {\r\n if ( alpha < 1.0 ) \/\/ obviously not opaque\r\n {\r\n return;\r\n }\r\n break;\r\n }\r\n default:\r\n {\r\n if ( alpha == 1.0 ) \/\/ not transparent\r\n {\r\n return;\r\n }\r\n break;\r\n }\r\n }\r\n\r\n setRenderParams( props );\r\n\r\n if ( m_orient == 0 )\r\n {\r\n return;\r\n }\r\n\r\n QGLShaderProgram* program = GLFunctions::getShader( \"mesh\" );\r\n\r\n program->bind();\r\n\r\n GLFunctions::setupTextures();\r\n GLFunctions::setTextureUniforms( GLFunctions::getShader( \"mesh\" ), \"maingl\" );\r\n \/\/ Set modelview-projection matrix\r\n program->setUniformValue( \"mvp_matrix\", p_matrix * mv_matrix );\r\n program->setUniformValue( \"mv_matrixInvert\", mv_matrix.inverted() );\r\n\r\n QMatrix4x4 mat;\r\n program->setUniformValue( \"userTransformMatrix\", mat );\r\n\r\n program->setUniformValue( \"u_colorMode\", 2 );\r\n program->setUniformValue( \"u_colormap\", m_colormap );\r\n program->setUniformValue( \"u_color\", m_color.redF(), m_color.greenF(), m_color.blueF(), 1.0 );\r\n program->setUniformValue( \"u_selectedMin\", m_selectedMin );\r\n program->setUniformValue( \"u_selectedMax\", m_selectedMax );\r\n program->setUniformValue( \"u_lowerThreshold\", m_lowerThreshold );\r\n program->setUniformValue( \"u_upperThreshold\", m_upperThreshold );\r\n\r\n float nx = props.get( Fn::Property::D_NX ).toFloat();\r\n float ny = props.get( Fn::Property::D_NY ).toFloat();\r\n float nz = props.get( Fn::Property::D_NZ ).toFloat();\r\n float sx = props.get( Fn::Property::G_SAGITTAL ).toFloat();\r\n float sy = props.get( Fn::Property::G_CORONAL ).toFloat();\r\n float sz = props.get( Fn::Property::G_AXIAL ).toFloat();\r\n float dx = props.get( Fn::Property::D_DX ).toFloat();\r\n float dy = props.get( Fn::Property::D_DY ).toFloat();\r\n float dz = props.get( Fn::Property::D_DZ ).toFloat();\r\n\r\n program->setUniformValue( \"u_x\", sx * dx + dx \/ 2.0f );\r\n program->setUniformValue( \"u_y\", sy * dy + dy \/ 2.0f );\r\n program->setUniformValue( \"u_z\", sz * dz + dz \/ 2.0f );\r\n program->setUniformValue( \"u_cutLowerX\", false );\r\n program->setUniformValue( \"u_cutLowerY\", false );\r\n program->setUniformValue( \"u_cutLowerZ\", false );\r\n program->setUniformValue( \"u_cutHigherX\", false );\r\n program->setUniformValue( \"u_cutHigherY\", false );\r\n program->setUniformValue( \"u_cutHigherZ\", false );\r\n\r\n program->setUniformValue( \"u_adjustX\", 0.0f );\r\n program->setUniformValue( \"u_adjustY\", 0.0f );\r\n program->setUniformValue( \"u_adjustZ\", 0.0f );\r\n\r\n program->setUniformValue( \"u_alpha\", alpha );\r\n program->setUniformValue( \"u_renderMode\", renderMode );\r\n program->setUniformValue( \"u_canvasSize\", width, height );\r\n program->setUniformValue( \"D0\", 9 );\r\n program->setUniformValue( \"D1\", 10 );\r\n program->setUniformValue( \"D2\", 11 );\r\n program->setUniformValue( \"P0\", 12 );\r\n\r\n program->setUniformValue( \"u_lighting\", props.get( Fn::Property::D_LIGHT_SWITCH ).toBool() );\r\n program->setUniformValue( \"u_lightAmbient\", props.get( Fn::Property::D_LIGHT_AMBIENT ).toFloat() );\r\n program->setUniformValue( \"u_lightDiffuse\", props.get( Fn::Property::D_LIGHT_DIFFUSE ).toFloat() );\r\n program->setUniformValue( \"u_materialAmbient\", props.get( Fn::Property::D_MATERIAL_AMBIENT ).toFloat() );\r\n program->setUniformValue( \"u_materialDiffuse\", props.get( Fn::Property::D_MATERIAL_DIFFUSE ).toFloat() );\r\n program->setUniformValue( \"u_materialSpecular\", props.get( Fn::Property::D_MATERIAL_SPECULAR ).toFloat() );\r\n program->setUniformValue( \"u_materialShininess\", props.get( Fn::Property::D_MATERIAL_SHININESS ).toFloat() );\r\n\r\n\r\n float pAlpha = 1.0;\r\n float blue = (float) ( ( m_pickId ) & 0xFF ) \/ 255.f;\r\n float green = (float) ( ( m_pickId >> 8 ) & 0xFF ) \/ 255.f;\r\n float red = (float) ( ( m_pickId >> 16 ) & 0xFF ) \/ 255.f;\r\n program->setUniformValue( \"u_pickColor\", red, green , blue, pAlpha );\r\n\r\n program->setUniformValue( \"u_dims\", nx * dx, ny * dy, nz * dz );\r\n\r\n if ( !m_updateRunning )\r\n {\r\n initGeometry( props );\r\n }\r\n\r\n if ( m_glyphsUpdated )\r\n {\r\n updateGlyphs();\r\n }\r\n\r\n if ( m_tris == 0 )\r\n {\r\n return;\r\n }\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, vboIds[ 0 ] );\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n setShaderVars( props );\r\n\r\n glEnable(GL_CULL_FACE);\r\n glCullFace( GL_BACK );\r\n glFrontFace( GL_CW );\r\n\r\n glDrawElements( GL_TRIANGLES, m_tris, GL_UNSIGNED_INT, 0 );\r\n\r\n glDisable(GL_CULL_FACE);\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n}\r\n\r\nvoid SHRenderer::setShaderVars( PropertyGroup& props )\r\n{\r\n QGLShaderProgram* program = GLFunctions::getShader( \"mesh\" );\r\n\r\n program->bind();\r\n\r\n intptr_t offset = 0;\r\n \/\/ Tell OpenGL programmable pipeline how to locate vertex position data\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n int vertexLocation = program->attributeLocation( \"a_position\" );\r\n program->enableAttributeArray( vertexLocation );\r\n glVertexAttribPointer( vertexLocation, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 3, (const void *) offset );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 3 ] );\r\n int normalLocation = program->attributeLocation( \"a_normal\" );\r\n program->enableAttributeArray( normalLocation );\r\n glVertexAttribPointer( normalLocation, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 3, (const void *) offset );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 2 ] );\r\n int colorLocation = program->attributeLocation( \"a_color\" );\r\n program->enableAttributeArray( colorLocation );\r\n glVertexAttribPointer( colorLocation, 4, GL_FLOAT, GL_FALSE, sizeof(float) * 4, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n}\r\n\r\nvoid SHRenderer::setRenderParams( PropertyGroup& props )\r\n{\r\n m_scaling = props.get( Fn::Property::D_SCALING ).toFloat();\r\n m_offset = props.get( Fn::Property::D_OFFSET ).toInt();\r\n m_lod = props.get( Fn::Property::D_LOD ).toInt();\r\n m_minMaxScaling = props.get( Fn::Property::D_MINMAX_SCALING ).toBool();\r\n m_hideNegativeLobes = props.get( Fn::Property::D_HIDE_NEGATIVE_LOBES ).toBool();\r\n m_order = props.get( Fn::Property::D_ORDER ).toInt();\r\n\r\n m_orient = 0;\r\n if ( props.get( Fn::Property::D_RENDER_AXIAL ).toBool() )\r\n {\r\n m_orient = 1;\r\n }\r\n if ( props.get( Fn::Property::D_RENDER_CORONAL ).toBool() )\r\n {\r\n m_orient += 2;\r\n }\r\n if ( props.get( Fn::Property::D_RENDER_SAGITTAL ).toBool() )\r\n {\r\n m_orient += 4;\r\n }\r\n\r\n m_colorMode = props.get( Fn::Property::D_COLORMODE ).toInt();\r\n m_colormap = props.get( Fn::Property::D_COLORMAP ).toInt();\r\n m_selectedMin = props.get( Fn::Property::D_SELECTED_MIN ).toFloat();\r\n m_selectedMax = props.get( Fn::Property::D_SELECTED_MAX ).toFloat();\r\n m_lowerThreshold = props.get( Fn::Property::D_LOWER_THRESHOLD ).toFloat();\r\n m_upperThreshold = props.get( Fn::Property::D_UPPER_THRESHOLD ).toFloat();\r\n m_color = props.get( Fn::Property::D_COLOR ).value<QColor>();\r\n}\r\n\r\n\r\nTriangleMesh2* SHRenderer::getMesh()\r\n{\r\n \/\/return m_mesh;\r\n}\r\n\r\n\r\nvoid SHRenderer::initGeometry( PropertyGroup& props )\r\n{\r\n float x = Models::getGlobal( Fn::Property::G_SAGITTAL ).toFloat();\r\n float y = Models::getGlobal( Fn::Property::G_CORONAL ).toFloat();\r\n float z = Models::getGlobal( Fn::Property::G_AXIAL ).toFloat();\r\n\r\n float zoom = Models::getGlobal( Fn::Property::G_ZOOM ).toFloat();\r\n float moveX = Models::getGlobal( Fn::Property::G_MOVEX ).toFloat();\r\n float moveY = Models::getGlobal( Fn::Property::G_MOVEY ).toFloat();\r\n\r\n QString s = createSettingsString( { x, y, z, m_orient, zoom, m_minMaxScaling, m_scaling, m_hideNegativeLobes, moveX, moveY, m_lod, m_offset } );\r\n if ( ( s == m_previousSettings ) || ( m_orient == 0 ) )\r\n {\r\n return;\r\n }\r\n m_previousSettings = s;\r\n\r\n m_updateRunning = true;\r\n m_glyphsUpdated = false;\r\n\r\n if ( m_updateThread )\r\n {\r\n delete m_updateThread;\r\n }\r\n m_updateThread = new SHRendererThread( m_data, m_pMatrix, m_mvMatrix, props );\r\n connect( m_updateThread, SIGNAL( finished( bool ) ), this, SLOT( updateThreadFinished( bool ) ) );\r\n m_updateThread->start();\r\n}\r\n\r\nvoid SHRenderer::updateThreadFinished( bool success )\r\n{\r\n if ( success )\r\n {\r\n m_glyphsUpdated = true;\r\n }\r\n m_updateRunning = false;\r\n Models::g()->submit();\r\n}\r\n\r\nvoid SHRenderer::updateGlyphs()\r\n{\r\n m_tris = m_updateThread->getIndices()->size();\r\n\r\n if ( m_tris == 0 )\r\n {\r\n return;\r\n }\r\n\r\n glDeleteBuffers( 4, vboIds );\r\n glGenBuffers( 4, vboIds );\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, vboIds[ 0 ] );\r\n glBufferData( GL_ELEMENT_ARRAY_BUFFER, m_tris * sizeof(GLuint), m_updateThread->getIndices()->data(), GL_STATIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 1 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getVerts()->size() * sizeof(GLfloat), m_updateThread->getVerts()->data(), GL_STATIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 2 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getColors()->size() * sizeof(GLfloat), m_updateThread->getColors()->data(), GL_DYNAMIC_DRAW );\r\n\r\n glBindBuffer( GL_ARRAY_BUFFER, vboIds[ 3 ] );\r\n glBufferData( GL_ARRAY_BUFFER, m_updateThread->getNormals()->size() * sizeof(GLfloat), m_updateThread->getNormals()->data(), GL_STATIC_DRAW );\r\n\r\n\r\n glBindBuffer( GL_ELEMENT_ARRAY_BUFFER, 0 );\r\n glBindBuffer( GL_ARRAY_BUFFER, 0 );\r\n\r\n delete m_updateThread;\r\n m_updateThread = 0;\r\n m_glyphsUpdated = false;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed bug in edge-mapping parallelisation<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 - 2015, GS Group, https:\/\/github.com\/GSGroup\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any purpose with or without fee is hereby granted,\n\/\/ provided that the above copyright notice and this permission notice appear in all copies.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.\n\/\/ IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n\/\/ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n#include <stingraykit\/Random.h>\n\n#include <ctime>\n\n\nnamespace stingray\n{\n\n\tRandom::Random()\n\t\t: _seed(std::time(0) & 0x7fffffffU)\n\t{ }\n\n\n\tRandom::Random(u32 seed)\n\t\t: _seed(seed & 0x7fffffffU)\n\t{ }\n\n\tu32 Random::Next(u32 maxValue)\n\t{\n\t\tstatic const u32 maxRand = 0x8000u;\n\t\tu32 next = Next();\n\t\tif (maxValue <= maxRand)\n\t\t\tnext >>= 16;\n\t\treturn next % maxValue;\n\t}\n\n\tu32 Random::Next()\n\t{\n\t\t_seed = (_seed * 1103515245U + 12345U) & 0x7fffffffU;\n\t\treturn _seed;\n\t}\n\n}\n<commit_msg>replaced LCG with mathematically correct parameters from \"Numeric Recipes\", both low\/high bits are passing tests now<commit_after>\/\/ Copyright (c) 2011 - 2015, GS Group, https:\/\/github.com\/GSGroup\n\/\/ Permission to use, copy, modify, and\/or distribute this software for any purpose with or without fee is hereby granted,\n\/\/ provided that the above copyright notice and this permission notice appear in all copies.\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.\n\/\/ IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,\n\/\/ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n\n#include <stingraykit\/Random.h>\n\n#include <ctime>\n\n\nnamespace stingray\n{\n\n\tRandom::Random()\n\t\t: _seed(std::time(0))\n\t{ }\n\n\n\tRandom::Random(u32 seed)\n\t\t: _seed(seed)\n\t{ }\n\n\tu32 Random::Next(u32 maxValue)\n\t{ return Next() % maxValue; }\n\n\tu32 Random::Next()\n\t{\n\t\t_seed = _seed * 1664525U + 1013904223U;\n\t\treturn _seed;\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Added stubs for bmp width and height<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cctype>\n#include <cstring>\n#include <map>\n#include <utility>\n#include <unistd.h>\n#include <sys\/wait.h>\n#include <sys\/types.h>\n#include <vector>\n#include <string>\n#include <iostream>\n\n#include \"functions.h\"\n\n\nint main(int argc, char** argv) {\n std::string prompt;\n getPrompt(prompt);\n\n\n bool quit = false;\n\n \/\/ print welcome message and prompt\n printf(\"Welcome to rshell!\\n\");\n\n while (!quit) {\n \/\/ holds a single command and its arguments\n Command_t cmd;\n \/\/ holds multiple commands\n std::vector<Command_t> cmds;\n \/\/ hold a raw line of input\n std::string line;\n\n \/\/ print prompt and get a line of text (done in condition)\n printf(\"%s\", prompt.c_str());\n preProcessLine(line);\n\n\n int mode = GETWORD;\n unsigned begin = 0;\n\n \/\/ prepare cmd\n cmd.connector = NONE;\n\n \/\/ syntax error flag\n bool se = false;\n\n \/\/ starts with a connector? I don't think so\n if (line.size() > 0 && isConn(line[0]) && line[0] != ';') {\n se = true;\n } else if (line.size() > 0 && (isRedir(line[0]) || isdigit(line[0]))) {\n mode = GETREDIR;\n }\n\n \/\/ handle the input\n for(unsigned i = 0; i < line.size() && !se; ++i) {\n bool con = isConn(line[i]);\n \/\/ bool dig = isdigit(line[i]);\n bool redir = isRedir(line[i]);\n bool space = isspace(line[i]);\n\n\n \/\/ if we're getting a word and there's a whitespace or connector here\n if (mode == GETWORD && (space || con || redir)) {\n \/\/ only happens for blank lines:\n if (i == 0 && con) break;\n if (redir) {\n mode = GETREDIR;\n continue;\n }\n \/\/ chunk the last term and throw it into the vector\n addArg(cmd, line, begin, i);\n\n if (space) {\n mode = TRIMSPACE;\n } else if (con) {\n handleCon(cmds, cmd, line, mode, begin, i, se);\n }\n } else if (mode == TRIMSPACE && !space) {\n if (con && cmd.args.empty() && line[i] != ';') {\n se = true;\n } else if (con) {\n handleCon(cmds, cmd, line, mode, begin, i, se);\n } else if (redir) {\n begin = i;\n mode = GETREDIR;\n } else {\n begin = i;\n mode = GETWORD;\n }\n } else if (mode == HANDLESEMI && line[i] != ';') {\n if (isConn(line[i])) {\n se = true;\n } else if (isspace(line[i])) {\n mode = TRIMSPACE;\n } else { \/\/ it's a word\n begin = i;\n mode = GETWORD;\n }\n } else if (mode == GETREDIR && line[i] == '\"') {\n mode = GETSTRING;\n } else if (mode == GETREDIR && space) {\n handleRedir(cmds, cmd, line, mode, begin, i, se);\n mode = TRIMSPACE;\n } else if (mode == GETSTRING && line[i] == '\"') {\n mode = ENDQUOTE;\n } else if (mode == ENDQUOTE) {\n if (space) {\n handleRedir(cmds, cmd, line, mode, begin, i, se);\n mode = TRIMSPACE;\n } else {\n se = true;\n continue;\n }\n }\n }\n\n \/\/ if the last command has a continuation connector, syntax error\n if (cmds.size() > 0 && (cmds[cmds.size()-1].connector == AND\n || cmds[cmds.size()-1].connector == OR\n || cmds[cmds.size()-1].connector == PIPE)) {\n se = true;\n }\n\n if (mode == GETSTRING) se = true;\n\n \/\/ if there was a syntax error\n if (se) {\n printf(\"Syntax error\\n\");\n continue;\n }\n\n\n \/* code for debugging\n for(unsigned i = 0; i < cmds.size(); ++i) {\n for(unsigned j = 0; j < cmds[i].args.size(); ++j) {\n printf(\"cmd %d arg %d: \\\"%s\\\"\\n\", i, j, cmds[i].args[j]);\n }\n if (cmds[i].connector == NONE) printf(\"connector: NONE\\n\");\n else if (cmds[i].connector == AND) printf(\"connector: AND\\n\");\n else if (cmds[i].connector == OR) printf(\"connector: OR\\n\");\n else if (cmds[i].connector == SEMI) printf(\"connector: SEMI\\n\");\n else if (cmds[i].connector == PIPE) printf(\"connector: PIPE\\n\");\n printf(\"file descriptor modifications:\\n\");\n for(unsigned j = 0; j < cmds[i].fdChanges.size(); ++j) {\n if (cmds[i].fdChanges[j].type == INPUT) {\n printf(\"change fd %d to \",\n (cmds[i].fdChanges[j].orig == DEFAULT) ? 0 :\n cmds[i].fdChanges[j].orig);\n\n if (cmds[i].fdChanges[j].moveTo == UNDEFINED)\n printf(\"UNDEFINED\\n\");\n else if (cmds[i].fdChanges[j].moveTo == FROMSTR)\n printf(\"FROMSTR (\\\"%s\\\")\\n\", cmds[i].fdChanges[j].s.c_str());\n else\n printf(\"Some other fd (%d)\\n\", cmds[i].fdChanges[j].moveTo);\n }\n\n if (cmds[i].fdChanges[j].type == OUTPUT) {\n printf(\"change fd %d to \",\n (cmds[i].fdChanges[j].orig == DEFAULT) ? 1 :\n cmds[i].fdChanges[j].orig);\n\n if (cmds[i].fdChanges[j].moveTo == UNDEFINED)\n printf(\"UNDEFINED\\n\");\n else\n printf(\"Some other fd (%d)\\n\", cmds[i].fdChanges[j].moveTo);\n }\n }\n }\n \/\/ *\/\n\n \/\/ now to execute all the commands\n \/\/ pipe\n int pa[2];\n std::vector<char*> paths;\n \/\/ getPaths\n fillPaths(paths);\n\n \/\/ prepare argv so I can delete them later\n std::vector<char**> argvs;\n for(unsigned i = 0; i < cmds.size(); ++i) {\n argvs.push_back(new char*[cmds[i].args.size()+1]);\n }\n\n for(unsigned cmdi = 0; cmdi < cmds.size(); ++cmdi) {\n size_t argsSize = cmds[cmdi].args.size();\n int exitStatus = 0;\n\n char* arg = cmds[cmdi].args[0];\n if (strcmp(arg, \"exit\") == 0) {\n quit = true;\n break;\n }\n char** subargv = argvs[cmdi];\n for(unsigned j = 0; j < argsSize; ++j) {\n subargv[j] = cmds[cmdi].args[j];\n }\n subargv[argsSize] = 0;\n\n if (cmds[cmdi].connector == PIPE) {\n \/\/ 1. make pipe\n if (-1 == pipe(pa)) {\n perror(\"pipe\");\n exit(1);\n }\n \/\/ 2. this program gets output and next program gets input\n \/\/ this program:\n fdChange_t outfdC(1, pa[1], OUTPUT);\n fdChange_t infdC(0, pa[0], INPUT);\n\n cmds[cmdi].fdChanges.push_back(outfdC);\n cmds[cmdi].closefd.push_back(pa[1]);\n \/\/ next program:\n cmds[cmdi+1].fdChanges.push_back(infdC);\n cmds[cmdi+1].closefd.push_back(pa[0]);\n\n }\n\n std::map<int, fdData_t> fds;\n for(unsigned j = 0; j < cmds[cmdi].fdChanges.size(); ++j) {\n int o = cmds[cmdi].fdChanges[j].orig;\n int mt = cmds[cmdi].fdChanges[j].moveTo;\n int t = cmds[cmdi].fdChanges[j].type;\n std::string str = cmds[cmdi].fdChanges[j].s;\n\n if (t == INPUT) {\n if (mt == FILEIN) {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(-1, DT_FIN, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in input mode\\n\", o, str.c_str());\n } else if (mt == FROMSTR) {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(-1, DT_STR, str)));\n \/\/ printf(\"Adding %d pointing to the string %s in input mode\\n\", o, str.c_str());\n } else {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(mt, DT_FDIN, str)));\n \/\/ printf(\"Adding %d pointing to the fd %d in input mode\\n\", mt, o);\n }\n } else if (t == OUTPUT) {\n if (mt == FILEOUT) {\n fds.insert(std::pair<int, fdData_t>(-1, fdData_t(o, DT_FOW, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in output write mode\\n\", o, str.c_str());\n } else if (mt == FILEAPP) {\n \/\/ if (fds\n fds.insert(std::pair<int, fdData_t>(-1, fdData_t(o, DT_FOA, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in output append mode\\n\", o, str.c_str());\n } else {\n fds.insert(std::pair<int, fdData_t>(mt, fdData_t(o, DT_FDO, str)));\n \/\/ printf(\"Adding %d pointing to the fd %d in output mode\\n\", o, mt);\n }\n }\n }\n debugMap(fds);\n\n\n\n\n \/\/ arg and argv are now prepared\n pid_t pid = fork();\n if (-1 == pid) {\n perror(\"fork\");\n exit(1); \/\/ fatal error\n } else if (0 == pid) { \/\/ child process\n deltaFD(fds);\n for(unsigned i = 0; i < paths.size(); ++i) {\n char* executable = new char[strlen(paths[i]) + strlen(arg) + 2];\n strcpy(executable, paths[i]);\n strcat(executable, \"\/\");\n strcat(executable, arg);\n struct stat statRes;\n if (-1 != stat(executable, &statRes)) {\n if (-1 == execv(executable, subargv)) {\n \/\/ if there's a return value (-1), there was a problem\n debug(\"executing\");\n perror(executable);\n delete[] subargv;\n delete[] executable;\n exit(1);\n }\n }\n errno = 0;\n delete[] executable;\n }\n fprintf(stderr, \"%s: command not found\\n\", arg);\n delete[] subargv;\n exit(1);\n } else { \/\/ parent process\n \/\/ close current fd's\n \/*\n for(unsigned j = 0; j < cmds[cmdi].closefd.size(); ++j) {\n if (-1 == close(cmds[cmdi].closefd[j])) {\n perror(\"closing in parent\");\n exit(1);\n }\n } *\/\n \/\/ only wait for non-pipes\n if (cmds[cmdi].connector != PIPE && -1 == waitpid(pid, &exitStatus, 0)) {\n perror(\"waitpid\");\n exit(1);\n }\n }\n if (!exitStatus) { \/\/ all is good (0)\n while (cmdi < cmds.size() && cmds[cmdi].connector == OR) {\n ++cmdi;\n }\n } else { \/\/ last command failed\n while (cmdi < cmds.size() && cmds[cmdi].connector == AND) {\n ++cmdi;\n }\n }\n }\n\n \/\/ deallocate allocated memory\n for(unsigned i = 0; i < cmds.size(); ++i) {\n for(unsigned j = 0; j < cmds[i].args.size(); ++j) {\n delete[] cmds[i].args[j];\n }\n }\n for(unsigned i = 0; i < paths.size(); ++i) {\n delete[] paths[i];\n }\n for(unsigned i = 0; i < argvs.size(); ++i) {\n delete[] argvs[i];\n }\n }\n printf(\"Goodbye!\\n\");\n return 0;\n}\n\n\n\n<commit_msg>implemented cd and changed prompt to show current path<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cctype>\n#include <cstring>\n#include <map>\n#include <utility>\n#include <unistd.h>\n#include <sys\/wait.h>\n#include <sys\/types.h>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <limits.h>\n\n#include \"functions.h\"\n\n\nint main(int argc, char** argv) {\n std::string prompt;\n getPrompt(prompt);\n\n\n bool quit = false;\n\n \/\/ print welcome message and prompt\n printf(\"Welcome to rshell!\\n\");\n\n while (!quit) {\n \/\/ holds a single command and its arguments\n Command_t cmd;\n \/\/ holds multiple commands\n std::vector<Command_t> cmds;\n \/\/ hold a raw line of input\n std::string line;\n\n char cwd[4 * PATH_MAX];\n if (NULL == getcwd(cwd + 1, 4 * PATH_MAX)) {\n perror(\"getcwd\");\n }\n cwd[0] = '[';\n\n \/\/ print prompt and get a line of text (done in condition)\n printf(\"%s\", (cwd + (\"] \" + prompt)).c_str());\n preProcessLine(line);\n\n\n int mode = GETWORD;\n unsigned begin = 0;\n\n \/\/ prepare cmd\n cmd.connector = NONE;\n\n \/\/ syntax error flag\n bool se = false;\n\n \/\/ starts with a connector? I don't think so\n if (line.size() > 0 && isConn(line[0]) && line[0] != ';') {\n se = true;\n } else if (line.size() > 0 && (isRedir(line[0]) || isdigit(line[0]))) {\n mode = GETREDIR;\n }\n\n \/\/ handle the input\n for(unsigned i = 0; i < line.size() && !se; ++i) {\n bool con = isConn(line[i]);\n \/\/ bool dig = isdigit(line[i]);\n bool redir = isRedir(line[i]);\n bool space = isspace(line[i]);\n\n\n \/\/ if we're getting a word and there's a whitespace or connector here\n if (mode == GETWORD && (space || con || redir)) {\n \/\/ only happens for blank lines:\n if (i == 0 && con) break;\n if (redir) {\n mode = GETREDIR;\n continue;\n }\n \/\/ chunk the last term and throw it into the vector\n addArg(cmd, line, begin, i);\n\n if (space) {\n mode = TRIMSPACE;\n } else if (con) {\n handleCon(cmds, cmd, line, mode, begin, i, se);\n }\n } else if (mode == TRIMSPACE && !space) {\n if (con && cmd.args.empty() && line[i] != ';') {\n se = true;\n } else if (con) {\n handleCon(cmds, cmd, line, mode, begin, i, se);\n } else if (redir) {\n begin = i;\n mode = GETREDIR;\n } else {\n begin = i;\n mode = GETWORD;\n }\n } else if (mode == HANDLESEMI && line[i] != ';') {\n if (isConn(line[i])) {\n se = true;\n } else if (isspace(line[i])) {\n mode = TRIMSPACE;\n } else { \/\/ it's a word\n begin = i;\n mode = GETWORD;\n }\n } else if (mode == GETREDIR && line[i] == '\"') {\n mode = GETSTRING;\n } else if (mode == GETREDIR && space) {\n handleRedir(cmds, cmd, line, mode, begin, i, se);\n mode = TRIMSPACE;\n } else if (mode == GETSTRING && line[i] == '\"') {\n mode = ENDQUOTE;\n } else if (mode == ENDQUOTE) {\n if (space) {\n handleRedir(cmds, cmd, line, mode, begin, i, se);\n mode = TRIMSPACE;\n } else {\n se = true;\n continue;\n }\n }\n }\n\n \/\/ if the last command has a continuation connector, syntax error\n if (cmds.size() > 0 && (cmds[cmds.size()-1].connector == AND\n || cmds[cmds.size()-1].connector == OR\n || cmds[cmds.size()-1].connector == PIPE)) {\n se = true;\n }\n\n if (mode == GETSTRING) se = true;\n\n \/\/ if there was a syntax error\n if (se) {\n printf(\"Syntax error\\n\");\n continue;\n }\n\n\n \/* code for debugging\n for(unsigned i = 0; i < cmds.size(); ++i) {\n for(unsigned j = 0; j < cmds[i].args.size(); ++j) {\n printf(\"cmd %d arg %d: \\\"%s\\\"\\n\", i, j, cmds[i].args[j]);\n }\n if (cmds[i].connector == NONE) printf(\"connector: NONE\\n\");\n else if (cmds[i].connector == AND) printf(\"connector: AND\\n\");\n else if (cmds[i].connector == OR) printf(\"connector: OR\\n\");\n else if (cmds[i].connector == SEMI) printf(\"connector: SEMI\\n\");\n else if (cmds[i].connector == PIPE) printf(\"connector: PIPE\\n\");\n printf(\"file descriptor modifications:\\n\");\n for(unsigned j = 0; j < cmds[i].fdChanges.size(); ++j) {\n if (cmds[i].fdChanges[j].type == INPUT) {\n printf(\"change fd %d to \",\n (cmds[i].fdChanges[j].orig == DEFAULT) ? 0 :\n cmds[i].fdChanges[j].orig);\n\n if (cmds[i].fdChanges[j].moveTo == UNDEFINED)\n printf(\"UNDEFINED\\n\");\n else if (cmds[i].fdChanges[j].moveTo == FROMSTR)\n printf(\"FROMSTR (\\\"%s\\\")\\n\", cmds[i].fdChanges[j].s.c_str());\n else\n printf(\"Some other fd (%d)\\n\", cmds[i].fdChanges[j].moveTo);\n }\n\n if (cmds[i].fdChanges[j].type == OUTPUT) {\n printf(\"change fd %d to \",\n (cmds[i].fdChanges[j].orig == DEFAULT) ? 1 :\n cmds[i].fdChanges[j].orig);\n\n if (cmds[i].fdChanges[j].moveTo == UNDEFINED)\n printf(\"UNDEFINED\\n\");\n else\n printf(\"Some other fd (%d)\\n\", cmds[i].fdChanges[j].moveTo);\n }\n }\n }\n \/\/ *\/\n\n \/\/ now to execute all the commands\n \/\/ pipe\n int pa[2];\n std::vector<char*> paths;\n \/\/ getPaths\n fillPaths(paths);\n\n \/\/ prepare argv so I can delete them later\n std::vector<char**> argvs;\n for(unsigned i = 0; i < cmds.size(); ++i) {\n argvs.push_back(new char*[cmds[i].args.size()+1]);\n }\n\n for(unsigned cmdi = 0; cmdi < cmds.size(); ++cmdi) {\n size_t argsSize = cmds[cmdi].args.size();\n int exitStatus = 0;\n\n char* arg = cmds[cmdi].args[0];\n char** argv = argvs[cmdi];\n for(unsigned j = 0; j < argsSize; ++j) {\n argv[j] = cmds[cmdi].args[j];\n }\n argv[argsSize] = NULL;\n\n if (strcmp(arg, \"exit\") == 0) {\n quit = true;\n break;\n } else if (strcmp(arg, \"cd\") == 0) {\n if (argv[1] == NULL) {\n if (-1 == chdir(getenv(\"HOME\"))) {\n perror(\"cd\");\n }\n } else {\n if (-1 == chdir(argv[1])) {\n perror(\"cd\");\n }\n }\n continue;\n }\n\n if (cmds[cmdi].connector == PIPE) {\n \/\/ 1. make pipe\n if (-1 == pipe(pa)) {\n perror(\"pipe\");\n exit(1);\n }\n \/\/ 2. this program gets output and next program gets input\n \/\/ this program:\n fdChange_t outfdC(1, pa[1], OUTPUT);\n fdChange_t infdC(0, pa[0], INPUT);\n\n cmds[cmdi].fdChanges.push_back(outfdC);\n cmds[cmdi].closefd.push_back(pa[1]);\n \/\/ next program:\n cmds[cmdi+1].fdChanges.push_back(infdC);\n cmds[cmdi+1].closefd.push_back(pa[0]);\n\n }\n\n std::map<int, fdData_t> fds;\n for(unsigned j = 0; j < cmds[cmdi].fdChanges.size(); ++j) {\n int o = cmds[cmdi].fdChanges[j].orig;\n int mt = cmds[cmdi].fdChanges[j].moveTo;\n int t = cmds[cmdi].fdChanges[j].type;\n std::string str = cmds[cmdi].fdChanges[j].s;\n\n if (t == INPUT) {\n if (mt == FILEIN) {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(-1, DT_FIN, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in input mode\\n\", o, str.c_str());\n } else if (mt == FROMSTR) {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(-1, DT_STR, str)));\n \/\/ printf(\"Adding %d pointing to the string %s in input mode\\n\", o, str.c_str());\n } else {\n fds.insert(std::pair<int, fdData_t>(o, fdData_t(mt, DT_FDIN, str)));\n \/\/ printf(\"Adding %d pointing to the fd %d in input mode\\n\", mt, o);\n }\n } else if (t == OUTPUT) {\n if (mt == FILEOUT) {\n fds.insert(std::pair<int, fdData_t>(-1, fdData_t(o, DT_FOW, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in output write mode\\n\", o, str.c_str());\n } else if (mt == FILEAPP) {\n \/\/ if (fds\n fds.insert(std::pair<int, fdData_t>(-1, fdData_t(o, DT_FOA, str)));\n \/\/ printf(\"Adding %d pointing to the file %s in output append mode\\n\", o, str.c_str());\n } else {\n fds.insert(std::pair<int, fdData_t>(mt, fdData_t(o, DT_FDO, str)));\n \/\/ printf(\"Adding %d pointing to the fd %d in output mode\\n\", o, mt);\n }\n }\n }\n debugMap(fds);\n\n\n\n\n \/\/ arg and argv are now prepared\n pid_t pid = fork();\n if (-1 == pid) {\n perror(\"fork\");\n exit(1); \/\/ fatal error\n } else if (0 == pid) { \/\/ child process\n deltaFD(fds);\n for(unsigned i = 0; i < paths.size(); ++i) {\n char* executable = new char[strlen(paths[i]) + strlen(arg) + 2];\n strcpy(executable, paths[i]);\n strcat(executable, \"\/\");\n strcat(executable, arg);\n struct stat statRes;\n if (-1 != stat(executable, &statRes)) {\n if (-1 == execv(executable, argv)) {\n \/\/ if there's a return value (-1), there was a problem\n debug(\"executing\");\n perror(executable);\n delete[] argv;\n delete[] executable;\n exit(1);\n }\n }\n if (false) {\n perror(\"stat\");\n }\n errno = 0;\n delete[] executable;\n }\n fprintf(stderr, \"%s: command not found\\n\", arg);\n delete[] argv;\n exit(1);\n } else { \/\/ parent process\n \/\/ close current fd's\n \/*\n for(unsigned j = 0; j < cmds[cmdi].closefd.size(); ++j) {\n if (-1 == close(cmds[cmdi].closefd[j])) {\n perror(\"closing in parent\");\n exit(1);\n }\n } *\/\n \/\/ only wait for non-pipes\n if (cmds[cmdi].connector != PIPE && -1 == waitpid(pid, &exitStatus, 0)) {\n perror(\"waitpid\");\n exit(1);\n }\n }\n if (!exitStatus) { \/\/ all is good (0)\n while (cmdi < cmds.size() && cmds[cmdi].connector == OR) {\n ++cmdi;\n }\n } else { \/\/ last command failed\n while (cmdi < cmds.size() && cmds[cmdi].connector == AND) {\n ++cmdi;\n }\n }\n }\n\n \/\/ deallocate allocated memory\n for(unsigned i = 0; i < cmds.size(); ++i) {\n for(unsigned j = 0; j < cmds[i].args.size(); ++j) {\n delete[] cmds[i].args[j];\n }\n }\n for(unsigned i = 0; i < paths.size(); ++i) {\n delete[] paths[i];\n }\n for(unsigned i = 0; i < argvs.size(); ++i) {\n delete[] argvs[i];\n }\n }\n printf(\"Goodbye!\\n\");\n return 0;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <node.h>\n#include <vector>\n#include <map>\n#include <iostream>\n\n\n#include \"Pump.h\"\n#include \"calculator\/PumpEfficiency.h\"\n#include \"calculator\/OptimalPumpEfficiency.h\"\n#include \"calculator\/MotorRatedPower.h\"\n#include \"calculator\/OptimalMotorRatedPower.h\"\n#include \"calculator\/MotorShaftPower.h\"\n#include \"calculator\/OptimalMotorShaftPower.h\"\n#include \"calculator\/PumpShaftPower.h\"\n#include \"calculator\/OptimalPumpShaftPower.h\"\n#include \"calculator\/MotorEfficiency.h\"\n#include \"calculator\/OptimalMotorEfficiency.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalMotorPowerFactor.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/OptimalMotorCurrent.h\"\n#include \"calculator\/MotorPower.h\"\n#include \"calculator\/OptimalMotorPower.h\"\n#include \"AnnualEnergy.h\"\n#include \"AnnualCost.h\"\n#include \"AnnualSavingsPotential.h\"\n#include \"OptimizationRating.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\ndouble Get(const char *nm) {\n return inp->ToObject()->Get(String::NewFromUtf8(iso,nm))->NumberValue();\n}\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n \n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n\n auto loadMeth = FieldData::LoadEstimationMethod::POWER;\n double mp = Get(\"motor_field_power\");\n double mc = Get(\"motor_field_current\");\n if (mc>0) {\n loadMeth = FieldData::LoadEstimationMethod::CURRENT;\n mp = (new MotorPower(Get(\"motor_rated_voltage\"),mc,0))->calculate();\/\/power factor\n } else {\n mc = (new MotorCurrent(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),effCls,0))->calculate();\/\/loadf\n }\n \n auto msp = (new MotorShaftPower(Get(\"motor_rated_power\"),mp,Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_voltage\")));\n \n map<const char *,vector<double>> out = { \n {\"Motor Shaft Power\",{msp->calculate(),0}},\n {\"Motor Current\",{msp->calculateCurrent(),0}},\n {\"Motor Efficiency\",{msp->calculateEfficiency(),0}},\n {\"Motor Power Factor\",{msp->calculateElectricPower(),0}},\n {\"Motor Power\", {msp->calculateElectricPower(),0}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n \/\/ SetR({\n \/\/ 0,\/\/(new PumpEfficiency(Get(\"specific_gravity\"),Get(\"flow\"),Get(\"head\"),0))->calculate(),\/\/pumpShaftPower\n \/\/ 0,\/\/(new OptimalPumpEfficiency(static_cast<Pump::Style>(Get(\"style\")),\n \/\/ \/\/Get(\"pump_rated_speed\"),Get(\"viscosity\"),Get(\"stages\"),Get(\"flow\"),Get(\"head\"),static_cast<Pump::Speed>(!Get(\"speed\"))))->calculate(),\n \/\/ 0,\/\/mp,\n \/\/ 0,\/\/(new OptimalMotorRatedPower(0,Get(\"margin\")))->calculate(),\/\/motorshaftpower\n \/\/ (new MotorShaftPower(Get(\"motor_rated_power\"),mp,Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_voltage\")))->calculate(),\n \/\/ 0,\/\/(new OptimalMotorShaftPower(0,drive))->calculate(),\/\/pumpshaftpower\n \/\/ 0,\/\/(new PumpShaftPower(0,drive))->calculate(),\/\/motorshaftpower\n \/\/ 0,\/\/(new OptimalPumpShaftPower(Get(\"flow\"),Get(\"head\"),Get(\"specific_gravity\"),0))->calculate(),\/\/pumpeff\n \/\/ 0,\/\/(new MotorEfficiency(Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_power\"),mp,0))->calculate(),\/\/loadF\n \/\/ 0,\/\/(new OptimalMotorEfficiency(Get(\"motor_rated_power\"),0))->calculate(),\/\/motor shaft power\n \/\/ 0,\/\/(new MotorPowerFactor(Get(\"motor_rated_power\"),0,mc,0,Get(\"motor_rated_voltage\")))->calculate(),\/\/loadFactor??, motor eff\n \/\/ 0,\/\/(new OptimalMotorPowerFactor(Get(\"motor_rated_power\"),0))->calculate(),\/\/opt motor power?\n \/\/ 0,\/\/mc,\n \/\/ 0,\/\/(new OptimalMotorCurrent(0,Get(\"field_voltage\")))->calculate(),\/\/opt motor power\n \/\/ 0,\/\/mp,\n \/\/ 0,\/\/(new OptimalMotorPower(0,0))->calculate(),\/\/motorshaftpower, motor eff\n \/\/ 0,\/\/(new AnnualEnergy(mp,Get(\"fraction\")))->calculate(),\/\/motorpower\n \/\/ 0,\/\/(new AnnualEnergy(0,Get(\"fraction\")))->calculate(),\/\/opt motorpower\n \/\/ 0,\/\/(new AnnualCost(0,Get(\"cost\")))->calculate(),\/\/ex ann energy\n \/\/ 0,\/\/(new AnnualCost(0,Get(\"cost\")))->calculate(),\/\/opt ann energy\n \/\/ -1,\n \/\/ 0,\/\/(new AnnualSavingsPotential(0,0))->calculate(),\/\/ex an cost, opt an cost\n \/\/ -1,\n \/\/ 0,\/\/(new OptimizationRating(0,0))->calculate()\/\/ex an cost, opt an cost\n \/\/ });\n args.GetReturnValue().Set(r);\n}\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n args[0]->NumberValue();\/\/hp\n args[1]->NumberValue();\/\/speed\n args[2]->NumberValue();\/\/v\n args[3]->NumberValue();\/\/cls\n args[4]->NumberValue();\/\/cus cls\n args.GetReturnValue().Set(args[4]);\n}\nvoid Check(double exp, double act, const char* nm=\"\") {\n if (abs(exp-act)>.01*exp) {\n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n }\n}\nvoid TestSame() {\n auto msp = (new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460));\n for (int i=1; i<=10000; i=i+2) {\n Check(msp->calculate(),msp->calculate(),\"SAME\");\n }\n}\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n \/\/TestSame();\n Check(101.255,(new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460))->calculate());\n Check(143.4,(new MotorShaftPower(200,111.855,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460))->calculate()); \n}\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", Test); \n}\n\nNODE_MODULE(bridge, Init)\n\n<commit_msg>no message<commit_after>#include <node.h>\n#include <vector>\n#include <map>\n#include <iostream>\n\n\n#include \"Pump.h\"\n#include \"calculator\/PumpEfficiency.h\"\n#include \"calculator\/OptimalPumpEfficiency.h\"\n#include \"calculator\/MotorRatedPower.h\"\n#include \"calculator\/OptimalMotorRatedPower.h\"\n#include \"calculator\/MotorShaftPower.h\"\n#include \"calculator\/OptimalMotorShaftPower.h\"\n#include \"calculator\/PumpShaftPower.h\"\n#include \"calculator\/OptimalPumpShaftPower.h\"\n#include \"calculator\/MotorEfficiency.h\"\n#include \"calculator\/OptimalMotorEfficiency.h\"\n#include \"calculator\/MotorPowerFactor.h\"\n#include \"calculator\/OptimalMotorPowerFactor.h\"\n#include \"calculator\/MotorCurrent.h\"\n#include \"calculator\/OptimalMotorCurrent.h\"\n#include \"calculator\/MotorPower.h\"\n#include \"calculator\/OptimalMotorPower.h\"\n#include \"AnnualEnergy.h\"\n#include \"AnnualCost.h\"\n#include \"AnnualSavingsPotential.h\"\n#include \"OptimizationRating.h\"\n\nusing namespace v8;\nusing namespace std;\n\nIsolate* iso;\nLocal<Object> inp;\n\ndouble Get(const char *nm) {\n return inp->ToObject()->Get(String::NewFromUtf8(iso,nm))->NumberValue();\n}\nvoid Results(const FunctionCallbackInfo<Value>& args) {\n iso = args.GetIsolate();\n inp = args[0]->ToObject();\n auto r = Object::New(iso);\n \n auto drive = (Pump::Drive)(int)Get(\"drive\");\n auto effCls = (Motor::EfficiencyClass)(int)Get(\"efficiency_class\");\n\n auto loadMeth = FieldData::LoadEstimationMethod::POWER;\n double mp = Get(\"motor_field_power\");\n double mc = Get(\"motor_field_current\");\n if (mc>0) {\n loadMeth = FieldData::LoadEstimationMethod::CURRENT;\n mp = (new MotorPower(Get(\"motor_rated_voltage\"),mc,0))->calculate();\/\/power factor\n } else {\n mc = (new MotorCurrent(Get(\"motor_rated_power\"),Get(\"motor_rated_speed\"),effCls,0))->calculate();\/\/loadf\n }\n \n auto msp = (new MotorShaftPower(Get(\"motor_rated_power\"),mp,Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_voltage\")));\n \n map<const char *,vector<double>> out = { \n {\"Motor Shaft Power\",{msp->calculate(),0}},\n {\"Motor Efficiency\",{msp->calculateEfficiency(),0}},\n {\"Motor Current\",{msp->calculateCurrent(),0}},\n {\"Motor Power Factor\",{msp->calculatePowerFactor(),0}},\n {\"Motor Power\", {msp->calculateElectricPower(),0}}\n };\n for(auto p: out) { \n auto a = Array::New(iso);\n a->Set(0,Number::New(iso,p.second[0]));\n a->Set(1,Number::New(iso,p.second[1])); \n r->Set(String::NewFromUtf8(iso,p.first),a);\n }\n \/\/ SetR({\n \/\/ 0,\/\/(new PumpEfficiency(Get(\"specific_gravity\"),Get(\"flow\"),Get(\"head\"),0))->calculate(),\/\/pumpShaftPower\n \/\/ 0,\/\/(new OptimalPumpEfficiency(static_cast<Pump::Style>(Get(\"style\")),\n \/\/ \/\/Get(\"pump_rated_speed\"),Get(\"viscosity\"),Get(\"stages\"),Get(\"flow\"),Get(\"head\"),static_cast<Pump::Speed>(!Get(\"speed\"))))->calculate(),\n \/\/ 0,\/\/mp,\n \/\/ 0,\/\/(new OptimalMotorRatedPower(0,Get(\"margin\")))->calculate(),\/\/motorshaftpower\n \/\/ (new MotorShaftPower(Get(\"motor_rated_power\"),mp,Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_voltage\")))->calculate(),\n \/\/ 0,\/\/(new OptimalMotorShaftPower(0,drive))->calculate(),\/\/pumpshaftpower\n \/\/ 0,\/\/(new PumpShaftPower(0,drive))->calculate(),\/\/motorshaftpower\n \/\/ 0,\/\/(new OptimalPumpShaftPower(Get(\"flow\"),Get(\"head\"),Get(\"specific_gravity\"),0))->calculate(),\/\/pumpeff\n \/\/ 0,\/\/(new MotorEfficiency(Get(\"motor_rated_speed\"),effCls,Get(\"motor_rated_power\"),mp,0))->calculate(),\/\/loadF\n \/\/ 0,\/\/(new OptimalMotorEfficiency(Get(\"motor_rated_power\"),0))->calculate(),\/\/motor shaft power\n \/\/ 0,\/\/(new MotorPowerFactor(Get(\"motor_rated_power\"),0,mc,0,Get(\"motor_rated_voltage\")))->calculate(),\/\/loadFactor??, motor eff\n \/\/ 0,\/\/(new OptimalMotorPowerFactor(Get(\"motor_rated_power\"),0))->calculate(),\/\/opt motor power?\n \/\/ 0,\/\/mc,\n \/\/ 0,\/\/(new OptimalMotorCurrent(0,Get(\"field_voltage\")))->calculate(),\/\/opt motor power\n \/\/ 0,\/\/mp,\n \/\/ 0,\/\/(new OptimalMotorPower(0,0))->calculate(),\/\/motorshaftpower, motor eff\n \/\/ 0,\/\/(new AnnualEnergy(mp,Get(\"fraction\")))->calculate(),\/\/motorpower\n \/\/ 0,\/\/(new AnnualEnergy(0,Get(\"fraction\")))->calculate(),\/\/opt motorpower\n \/\/ 0,\/\/(new AnnualCost(0,Get(\"cost\")))->calculate(),\/\/ex ann energy\n \/\/ 0,\/\/(new AnnualCost(0,Get(\"cost\")))->calculate(),\/\/opt ann energy\n \/\/ -1,\n \/\/ 0,\/\/(new AnnualSavingsPotential(0,0))->calculate(),\/\/ex an cost, opt an cost\n \/\/ -1,\n \/\/ 0,\/\/(new OptimizationRating(0,0))->calculate()\/\/ex an cost, opt an cost\n \/\/ });\n args.GetReturnValue().Set(r);\n}\nvoid EstFLA(const FunctionCallbackInfo<Value>& args) {\n args[0]->NumberValue();\/\/hp\n args[1]->NumberValue();\/\/speed\n args[2]->NumberValue();\/\/v\n args[3]->NumberValue();\/\/cls\n args[4]->NumberValue();\/\/cus cls\n args.GetReturnValue().Set(args[4]);\n}\nvoid Check(double exp, double act, const char* nm=\"\") {\n if (abs(exp-act)>.01*exp) {\n printf(\"\\\"%s\\\" TEST FAILED: %f %f\\n\",nm,exp,act);\n assert(!\"equal\");\n }\n}\nvoid TestSame() {\n auto msp = (new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460));\n for (int i=1; i<=10000; i=i+2) {\n Check(msp->calculate(),msp->calculate(),\"SAME\");\n }\n}\nvoid Test(const FunctionCallbackInfo<Value>& args) {\n \/\/TestSame();\n auto msp = new MotorShaftPower(200,80,1786,Motor::EfficiencyClass::ENERGY_EFFICIENT,460);\n Check(101.3,msp->calculate());\n Check(94.4,msp->calculateEfficiency());\n Check(79.5,msp->calculateCurrent());\n Check(145.2,msp->calculatePowerFactor());\n Check(80,msp->calculateElectricPower());\n\n Check(143.4,(new MotorShaftPower(200,111.855,1780,Motor::EfficiencyClass::ENERGY_EFFICIENT,460))->calculate()); \n}\nvoid Init(Local<Object> exports) {\n NODE_SET_METHOD(exports, \"results\", Results);\n NODE_SET_METHOD(exports, \"estFLA\", EstFLA); \n NODE_SET_METHOD(exports, \"test\", Test); \n}\n\nNODE_MODULE(bridge, Init)\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fix typo in ASTStructuralEquivalence.cpp for UnaryTransform types.<commit_after><|endoftext|>"} {"text":"<commit_before>#include <QtQuick>\n\n#include <sailfishapp.h>\n#include <QScopedPointer>\n#include <QQuickView>\n#include <QQmlEngine>\n#include <QGuiApplication>\n\n#include \"factor.h\"\n\nint main(int argc, char *argv[])\n{\n \/\/ For this example, wizard-generates single line code would be good enough,\n \/\/ but very soon it won't be enough for you anyway, so use this more detailed example from start\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n QScopedPointer<QQuickView> view(SailfishApp::createView());\n\n Factorizer fact;\n\n#ifdef QT_QML_DEBUG\n runUnitTests();\n#endif\n\n\/\/ Here's how you will add QML components whenever you start using them\n\/\/ Check https:\/\/github.com\/amarchen\/Wikipedia for a more full example\n\/\/ view->engine()->addImportPath(SailfishApp::pathTo(\"qml\/components\").toString());\n view->engine()->rootContext()->setContextProperty(\"fact\", &fact);\n view->setSource(SailfishApp::pathTo(\"qml\/main.qml\"));\n\n view->setTitle(\"Sailfactor\");\n\n app->setApplicationName(\"harbour-sailfactor\");\n app->setApplicationDisplayName(\"Sailfactor\");\n\n view->show();\n\n return app->exec();\n}\n<commit_msg>Remove comments originating from Helloworld Pro...<commit_after>#include <QtQuick>\n\n#include <sailfishapp.h>\n#include <QScopedPointer>\n#include <QQuickView>\n#include <QQmlEngine>\n#include <QGuiApplication>\n\n#include \"factor.h\"\n\nint main(int argc, char *argv[])\n{\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n QScopedPointer<QQuickView> view(SailfishApp::createView());\n\n Factorizer fact;\n\n#ifdef QT_QML_DEBUG\n runUnitTests();\n#endif\n\n view->engine()->rootContext()->setContextProperty(\"fact\", &fact);\n view->setSource(SailfishApp::pathTo(\"qml\/main.qml\"));\n\n view->setTitle(\"Sailfactor\");\n\n app->setApplicationName(\"harbour-sailfactor\");\n app->setApplicationDisplayName(\"Sailfactor\");\n\n view->show();\n\n return app->exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Hunspell, based on MySpell.\n *\n * The Initial Developers of the Original Code are\n * Kevin Hendricks (MySpell) and Németh László (Hunspell).\n * Portions created by the Initial Developers are Copyright (C) 2002-2005\n * the Initial Developers. All Rights Reserved.\n *\n * Contributor(s): David Einstein, Davide Prina, Giuseppe Modugno,\n * Gianluca Turconi, Simon Brouwer, Noll János, Bíró Árpád,\n * Goldman Eleonóra, Sarlós Tamás, Bencsáth Boldizsár, Halácsy Péter,\n * Dvornik László, Gefferth András, Nagy Viktor, Varga Dániel, Chris Halls,\n * Rene Engelhard, Bram Moolenaar, Dafydd Jones, Harri Pitkänen\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\/*\n * Copyright 2002 Kevin B. Hendricks, Stratford, Ontario, Canada\n * And Contributors. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * 3. All modifications to the source code must be clearly marked as\n * such. Binary redistributions based on modified source code\n * must be clearly marked as modified versions in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY KEVIN B. HENDRICKS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * KEVIN B. HENDRICKS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\/\n#ifndef MYSPELLMGR_HXX_\n#define MYSPELLMGR_HXX_\n\n#include \"hunvisapi.h\"\n#include \"w_char.hxx\"\n#include \"atypes.hxx\"\n#include <string>\n#include <vector>\n\n#define SPELL_XML \"<?xml?>\"\n\n#define MAXSUGGESTION 15\n#define MAXSHARPS 5\n#define MAXWORDLEN 176\n\n#if defined __GNUC__ && (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1))\n# define H_DEPRECATED __attribute__((__deprecated__))\n#elif defined(_MSC_VER) && (_MSC_VER >= 1300)\n# define H_DEPRECATED __declspec(deprecated)\n#else\n# define H_DEPRECATED\n#endif\n\nclass HunspellImpl;\n\nclass LIBHUNSPELL_DLL_EXPORTED Hunspell {\n private:\n Hunspell(const Hunspell&);\n Hunspell& operator=(const Hunspell&);\n\n private:\n HunspellImpl* m_Impl;\n\n public:\n \/* Hunspell(aff, dic) - constructor of Hunspell class\n * input: path of affix file and dictionary file\n *\n * In WIN32 environment, use UTF-8 encoded paths started with the long path\n * prefix \\\\\\\\?\\\\ to handle system-independent character encoding and very\n * long path names (without the long path prefix Hunspell will use fopen()\n * with system-dependent character encoding instead of _wfopen()).\n *\/\n Hunspell(const char* affpath, const char* dpath, const char* key = NULL);\n ~Hunspell();\n\n \/* load extra dictionaries (only dic files) *\/\n int add_dic(const char* dpath, const char* key = NULL);\n\n \/* spell(word) - spellcheck word\n * output: false = bad word, true = good word\n *\n * plus output:\n * info: information bit array, fields:\n * SPELL_COMPOUND = a compound word\n * SPELL_FORBIDDEN = an explicit forbidden word\n * root: root (stem), when input is a word with affix(es)\n *\/\n bool spell(const std::string& word, int* info = NULL, std::string* root = NULL);\n H_DEPRECATED int spell(const char* word, int* info = NULL, char** root = NULL);\n\n \/* suggest(suggestions, word) - search suggestions\n * input: pointer to an array of strings pointer and the (bad) word\n * array of strings pointer (here *slst) may not be initialized\n * output: number of suggestions in string array, and suggestions in\n * a newly allocated array of strings (*slts will be NULL when number\n * of suggestion equals 0.)\n *\/\n std::vector<std::string> suggest(const std::string& word);\n H_DEPRECATED int suggest(char*** slst, const char* word);\n\n \/* Suggest words from suffix rules\n * suffix_suggest(suggestions, root_word)\n * input: pointer to an array of strings pointer and the word\n * array of strings pointer (here *slst) may not be initialized\n * output: number of suggestions in string array, and suggestions in\n * a newly allocated array of strings (*slts will be NULL when number\n * of suggestion equals 0.)\n *\/\n std::vector<std::string> suffix_suggest(const std::string& root_word);\n H_DEPRECATED int suffix_suggest(char*** slst, const char* root_word);\n\n \/* deallocate suggestion lists *\/\n H_DEPRECATED void free_list(char*** slst, int n);\n\n const std::string& get_dict_encoding() const;\n char* get_dic_encoding();\n\n \/* morphological functions *\/\n\n \/* analyze(result, word) - morphological analysis of the word *\/\n std::vector<std::string> analyze(const std::string& word);\n H_DEPRECATED int analyze(char*** slst, const char* word);\n\n \/* stem(word) - stemmer function *\/\n std::vector<std::string> stem(const std::string& word);\n H_DEPRECATED int stem(char*** slst, const char* word);\n\n \/* stem(analysis, n) - get stems from a morph. analysis\n * example:\n * char ** result, result2;\n * int n1 = analyze(&result, \"words\");\n * int n2 = stem(&result2, result, n1);\n *\/\n std::vector<std::string> stem(const std::vector<std::string>& morph);\n H_DEPRECATED int stem(char*** slst, char** morph, int n);\n\n \/* generate(result, word, word2) - morphological generation by example(s) *\/\n std::vector<std::string> generate(const std::string& word, const std::string& word2);\n H_DEPRECATED int generate(char*** slst, const char* word, const char* word2);\n\n \/* generate(result, word, desc, n) - generation by morph. description(s)\n * example:\n * char ** result;\n * char * affix = \"is:plural\"; \/\/ description depends from dictionaries, too\n * int n = generate(&result, \"word\", &affix, 1);\n * for (int i = 0; i < n; i++) printf(\"%s\\n\", result[i]);\n *\/\n std::vector<std::string> generate(const std::string& word, const std::vector<std::string>& pl);\n H_DEPRECATED int generate(char*** slst, const char* word, char** desc, int n);\n\n \/* functions for run-time modification of the dictionary *\/\n\n \/* add word to the run-time dictionary *\/\n\n int add(const std::string& word);\n\n \/* add word to the run-time dictionary with affix flags of\n * the example (a dictionary word): Hunspell will recognize\n * affixed forms of the new word, too.\n *\/\n\n int add_with_affix(const std::string& word, const std::string& example);\n\n \/* remove word from the run-time dictionary *\/\n\n int remove(const std::string& word);\n\n \/* other *\/\n\n \/* get extra word characters definied in affix file for tokenization *\/\n const char* get_wordchars() const;\n const std::string& get_wordchars_cpp() const;\n const std::vector<w_char>& get_wordchars_utf16() const;\n\n struct cs_info* get_csconv();\n \n const char* get_version() const;\n const std::string& get_version_cpp() const;\n\n int get_langnum() const;\n\n \/* need for putdic *\/\n bool input_conv(const std::string& word, std::string& dest);\n H_DEPRECATED int input_conv(const char* word, char* dest, size_t destsize);\n};\n\n#endif\n<commit_msg>Lower MAXWORDLEN to 100 for performance reasons. Issue #445. Optionally the preprocesor value can be customized at build time using -D switch.<commit_after>\/* ***** BEGIN LICENSE BLOCK *****\n * Version: MPL 1.1\/GPL 2.0\/LGPL 2.1\n *\n * The contents of this file are subject to the Mozilla Public License Version\n * 1.1 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n * http:\/\/www.mozilla.org\/MPL\/\n *\n * Software distributed under the License is distributed on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License\n * for the specific language governing rights and limitations under the\n * License.\n *\n * The Original Code is Hunspell, based on MySpell.\n *\n * The Initial Developers of the Original Code are\n * Kevin Hendricks (MySpell) and Németh László (Hunspell).\n * Portions created by the Initial Developers are Copyright (C) 2002-2005\n * the Initial Developers. All Rights Reserved.\n *\n * Contributor(s): David Einstein, Davide Prina, Giuseppe Modugno,\n * Gianluca Turconi, Simon Brouwer, Noll János, Bíró Árpád,\n * Goldman Eleonóra, Sarlós Tamás, Bencsáth Boldizsár, Halácsy Péter,\n * Dvornik László, Gefferth András, Nagy Viktor, Varga Dániel, Chris Halls,\n * Rene Engelhard, Bram Moolenaar, Dafydd Jones, Harri Pitkänen\n *\n * Alternatively, the contents of this file may be used under the terms of\n * either the GNU General Public License Version 2 or later (the \"GPL\"), or\n * the GNU Lesser General Public License Version 2.1 or later (the \"LGPL\"),\n * in which case the provisions of the GPL or the LGPL are applicable instead\n * of those above. If you wish to allow use of your version of this file only\n * under the terms of either the GPL or the LGPL, and not to allow others to\n * use your version of this file under the terms of the MPL, indicate your\n * decision by deleting the provisions above and replace them with the notice\n * and other provisions required by the GPL or the LGPL. If you do not delete\n * the provisions above, a recipient may use your version of this file under\n * the terms of any one of the MPL, the GPL or the LGPL.\n *\n * ***** END LICENSE BLOCK ***** *\/\n\/*\n * Copyright 2002 Kevin B. Hendricks, Stratford, Ontario, Canada\n * And Contributors. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * 3. All modifications to the source code must be clearly marked as\n * such. Binary redistributions based on modified source code\n * must be clearly marked as modified versions in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY KEVIN B. HENDRICKS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n * KEVIN B. HENDRICKS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n *\/\n#ifndef MYSPELLMGR_HXX_\n#define MYSPELLMGR_HXX_\n\n#include \"hunvisapi.h\"\n#include \"w_char.hxx\"\n#include \"atypes.hxx\"\n#include <string>\n#include <vector>\n\n#define SPELL_XML \"<?xml?>\"\n\n#define MAXSUGGESTION 15\n#define MAXSHARPS 5\n\n#ifndef MAXWORDLEN\n#define MAXWORDLEN 100\n#endif\n\n#if defined __GNUC__ && (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 1))\n# define H_DEPRECATED __attribute__((__deprecated__))\n#elif defined(_MSC_VER) && (_MSC_VER >= 1300)\n# define H_DEPRECATED __declspec(deprecated)\n#else\n# define H_DEPRECATED\n#endif\n\nclass HunspellImpl;\n\nclass LIBHUNSPELL_DLL_EXPORTED Hunspell {\n private:\n Hunspell(const Hunspell&);\n Hunspell& operator=(const Hunspell&);\n\n private:\n HunspellImpl* m_Impl;\n\n public:\n \/* Hunspell(aff, dic) - constructor of Hunspell class\n * input: path of affix file and dictionary file\n *\n * In WIN32 environment, use UTF-8 encoded paths started with the long path\n * prefix \\\\\\\\?\\\\ to handle system-independent character encoding and very\n * long path names (without the long path prefix Hunspell will use fopen()\n * with system-dependent character encoding instead of _wfopen()).\n *\/\n Hunspell(const char* affpath, const char* dpath, const char* key = NULL);\n ~Hunspell();\n\n \/* load extra dictionaries (only dic files) *\/\n int add_dic(const char* dpath, const char* key = NULL);\n\n \/* spell(word) - spellcheck word\n * output: false = bad word, true = good word\n *\n * plus output:\n * info: information bit array, fields:\n * SPELL_COMPOUND = a compound word\n * SPELL_FORBIDDEN = an explicit forbidden word\n * root: root (stem), when input is a word with affix(es)\n *\/\n bool spell(const std::string& word, int* info = NULL, std::string* root = NULL);\n H_DEPRECATED int spell(const char* word, int* info = NULL, char** root = NULL);\n\n \/* suggest(suggestions, word) - search suggestions\n * input: pointer to an array of strings pointer and the (bad) word\n * array of strings pointer (here *slst) may not be initialized\n * output: number of suggestions in string array, and suggestions in\n * a newly allocated array of strings (*slts will be NULL when number\n * of suggestion equals 0.)\n *\/\n std::vector<std::string> suggest(const std::string& word);\n H_DEPRECATED int suggest(char*** slst, const char* word);\n\n \/* Suggest words from suffix rules\n * suffix_suggest(suggestions, root_word)\n * input: pointer to an array of strings pointer and the word\n * array of strings pointer (here *slst) may not be initialized\n * output: number of suggestions in string array, and suggestions in\n * a newly allocated array of strings (*slts will be NULL when number\n * of suggestion equals 0.)\n *\/\n std::vector<std::string> suffix_suggest(const std::string& root_word);\n H_DEPRECATED int suffix_suggest(char*** slst, const char* root_word);\n\n \/* deallocate suggestion lists *\/\n H_DEPRECATED void free_list(char*** slst, int n);\n\n const std::string& get_dict_encoding() const;\n char* get_dic_encoding();\n\n \/* morphological functions *\/\n\n \/* analyze(result, word) - morphological analysis of the word *\/\n std::vector<std::string> analyze(const std::string& word);\n H_DEPRECATED int analyze(char*** slst, const char* word);\n\n \/* stem(word) - stemmer function *\/\n std::vector<std::string> stem(const std::string& word);\n H_DEPRECATED int stem(char*** slst, const char* word);\n\n \/* stem(analysis, n) - get stems from a morph. analysis\n * example:\n * char ** result, result2;\n * int n1 = analyze(&result, \"words\");\n * int n2 = stem(&result2, result, n1);\n *\/\n std::vector<std::string> stem(const std::vector<std::string>& morph);\n H_DEPRECATED int stem(char*** slst, char** morph, int n);\n\n \/* generate(result, word, word2) - morphological generation by example(s) *\/\n std::vector<std::string> generate(const std::string& word, const std::string& word2);\n H_DEPRECATED int generate(char*** slst, const char* word, const char* word2);\n\n \/* generate(result, word, desc, n) - generation by morph. description(s)\n * example:\n * char ** result;\n * char * affix = \"is:plural\"; \/\/ description depends from dictionaries, too\n * int n = generate(&result, \"word\", &affix, 1);\n * for (int i = 0; i < n; i++) printf(\"%s\\n\", result[i]);\n *\/\n std::vector<std::string> generate(const std::string& word, const std::vector<std::string>& pl);\n H_DEPRECATED int generate(char*** slst, const char* word, char** desc, int n);\n\n \/* functions for run-time modification of the dictionary *\/\n\n \/* add word to the run-time dictionary *\/\n\n int add(const std::string& word);\n\n \/* add word to the run-time dictionary with affix flags of\n * the example (a dictionary word): Hunspell will recognize\n * affixed forms of the new word, too.\n *\/\n\n int add_with_affix(const std::string& word, const std::string& example);\n\n \/* remove word from the run-time dictionary *\/\n\n int remove(const std::string& word);\n\n \/* other *\/\n\n \/* get extra word characters definied in affix file for tokenization *\/\n const char* get_wordchars() const;\n const std::string& get_wordchars_cpp() const;\n const std::vector<w_char>& get_wordchars_utf16() const;\n\n struct cs_info* get_csconv();\n \n const char* get_version() const;\n const std::string& get_version_cpp() const;\n\n int get_langnum() const;\n\n \/* need for putdic *\/\n bool input_conv(const std::string& word, std::string& dest);\n H_DEPRECATED int input_conv(const char* word, char* dest, size_t destsize);\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <time.h>\n#include <stdio.h>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\nusing namespace cv;\nusing namespace std;\n\nstatic void printHelp() {\n cout << \"required arguments:\" << endl;\n cout << \"- square size in meters\" << endl;\n cout << endl;\n cout << \"optional arguments:\" << endl;\n cout << \"- device\" << endl;\n}\n\nint main(int argc, char *argv[]) {\n cout << argc << endl;\n\n if (argc < 1) {\n printHelp();\n \n return 1;\n }\n \n \n\n return 0;\n}<commit_msg>argument handling<commit_after>#include <iostream>\n#include <sstream>\n#include <time.h>\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <opencv2\/calib3d\/calib3d.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\nusing namespace cv;\nusing namespace std;\n\n#define DEVICE_STRLEN 255\n\nstatic float square_size = 0.0f;\nstatic char device[DEVICE_STRLEN];\nstatic bool all_devices = true;\n\nstatic void printHelp() {\n cout << \"required arguments:\" << endl;\n cout << \"- square size in meters\" << endl;\n cout << endl;\n cout << \"optional arguments:\" << endl;\n cout << \"- device\" << endl;\n}\n\nint main(int argc, char *argv[]) {\n if (argc < 2) {\n printHelp();\n \n return 1;\n }\n \n square_size = (float)strtod(argv[1], NULL);\n \n if (square_size <= 0.0f) {\n cout << \"unable to parse first argument as square size\" << endl;\n printHelp();\n \n return 2;\n }\n \n if (argc >= 3) {\n strncpy(device, argv[2], DEVICE_STRLEN);\n all_devices = false;\n }\n \n cout << \"using square size of \" << square_size << \" meters\" << endl;\n cout << \"generating camera intrinsics for \";\n if (all_devices)\n cout << \"all devices\" << endl;\n else\n cout << \"device '\" << device << \"'\" << endl;\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"lutil.h\"\n#include <GL\/freeglut.h>\n\n\/\/ Camera position\nGLfloat gCameraX = 0.0f, gCameraY = 0.0f;\n\n\/\/ Solar System\nsolarsystem ss(1, 3);\n\n\/\/ Fot font rendering\nunsigned char image[SCREEN_WIDTH][SCREEN_HEIGHT];\n\nbool initGL()\n{\n\/*\tNOTES\n\t *\n\t * The projection and model view matrices are both matrices\n\t * that geometry data is multiplied against before rendering.\n\t *\n\t * By setting them both to the identity matrix,\n\t * what every geometry is sent through is what is \n\t * rendered since the identity matrix simply returns\n\t * the same vector back when you multiply against it.\n\t *\n\t * *\/\n\n\t\/\/ Set the view port\n\tglViewport(0.0f, 0.0f, SCREEN_WIDTH, SCREEN_HEIGHT);\n\n\t\/\/ Initialize projection matrix\n\tglMatrixMode(GL_PROJECTION);\n\n\t\/\/ Loads identity matrix into current matrix\n\tglLoadIdentity();\n\n\t\/\/ Multiplies the current matrix against an ortho perspectice matrix\n\t\/\/ with the left, right, bottom, top, near, and far values in the arguments.\n\tglOrtho(0.0f, SCREEN_WIDTH, SCREEN_HEIGHT, 0.0f, 1.0f, -1.0f);\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\t\/\/ Save the default modelview matrix\n\tglPushMatrix();\n\n\t\/\/ Set color when 'glClear()' is called (Uses RGBA format, currently black)\n\tglClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n\n\t\/\/ Check for any OpenGL errors that may occur during initialization\n\tGLenum error = glGetError();\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tprintf(\"Error initializing OpenGL! %s\\n\", gluErrorString(error));\n\t\treturn false;\n\t}\n\n\t\n\n\treturn true;\n}\n\n\/\/ Return true if successful, false otherwise\nbool loadMedia()\n{\n\treturn true;\n}\n\nvoid update()\n{\n\tss.rotatePlanets();\n}\n\nvoid render()\n{\n\t\/\/ Clear the color buffer (pixels on the screen)\n\tglClear(GL_COLOR_BUFFER_BIT);\n\tglLoadIdentity();\n\n\t\/\/ Pop default matrix onto current matrix\n\tglMatrixMode(GL_MODELVIEW);\n\tglPopMatrix();\n\n\t\/\/ Save default matrix again\n\tglPushMatrix();\n\n\t\/\/ Move projection view to center of screen\n\tglTranslatef(SCREEN_WIDTH \/ 2.0f, SCREEN_HEIGHT \/ 2.0f, 0.0f);\n\n\t\/\/ Text\n\trenderText(-300, -200, \"Basic Solar System Simulation\");\n\trenderText(-300, -180, \"Press Spacebar to randomize parameters\");\n\t\n\t\/*\n\t * NOTES\n\t *\n\t * VERTEX ORDER MATTERS\n\t * You can either go in a clockwise or counterclock wise direction.\n\t * For this, I go counterclockwise.\n\t *\n\t * This is because each vertex correlates with a face of the quad.\n\t * The first and second points are one side, second and third another,\n\t * third and fourth another, and fourth and first another, making\n\t * 4 sides.\n\t * *\/\n\n\n\t\/\/ Render solar system\n\tss.renderSolarSystem();\n\n\t\/*\n\t * NOTES\n\t * \n\t * This program uses a double buffered window. \n\t *\n\t * There are two buffers: front buffer and back buffer\n\t * The front buffer is what the user sees and the back\n\t * buffer is in memory.\n\t *\n\t * For a double buffered window:\n\t * When we make render calls, all of that is rendered in the back buffer.\n\t * After we're done rendering what we want to show the user, we \n\t * swap the front and back buffer. \n\t * \n\t * When there is a single window buffer,\n\t * the user will see geometry as it's being rendered. \n\t * This may cause unfinished rendering and tearing.\n\t *\n\t * Holy fuck, I had no clue!\n\t * *\/\n\n\t\/\/ Render text\n\t\/\/glColor3f(0, 0.5f, 0.5f);\n\t\/\/glutStrokeCharacter(GLUT_STROKE_ROMAN, 'H');\n\n\t\/\/ Update GLUT buffer (our second buffer)\n\tglutSwapBuffers();\n\n}\n\nvoid renderText(int xPos, int yPos, std::string inputText)\n{\n\t\/\/ Position text (0, 0) = Center of screen\n\tglRasterPos2i(xPos, yPos);\n\n\tconst unsigned char *c;\n\tfor (int i = 0; i < inputText.size(); ++i)\n\t{\n\t\tglutBitmapCharacter(GLUT_BITMAP_9_BY_15, inputText[i]);\n\t}\n}\n\nvoid handleKeys(unsigned char key, int x, int y)\n{\n\tif (key == ' ')\n\t{\n\t\tss.shuffle();\n\t}\n}\n\n\n\n\n\n\n\n\n<commit_msg>Updated comments<commit_after>#include \"lutil.h\"\n#include <GL\/freeglut.h>\n\n\/\/ Camera position\nGLfloat gCameraX = 0.0f, gCameraY = 0.0f;\n\n\/\/ Solar System\nsolarsystem ss(1, 3);\n\n\/\/ Fot font rendering\nunsigned char image[SCREEN_WIDTH][SCREEN_HEIGHT];\n\nbool initGL()\n{\n\/*\tNOTES\n\t *\n\t * The projection and model view matrices are both matrices\n\t * that geometry data is multiplied against before rendering.\n\t *\n\t * By setting them both to the identity matrix,\n\t * what every geometry is sent through is what is \n\t * rendered since the identity matrix simply returns\n\t * the same vector back when you multiply against it.\n\t *\n\t * *\/\n\n\t\/\/ Set the view port\n\tglViewport(0.0f, 0.0f, SCREEN_WIDTH, SCREEN_HEIGHT);\n\n\t\/\/ Initialize projection matrix\n\tglMatrixMode(GL_PROJECTION);\n\n\t\/\/ Loads identity matrix into current matrix\n\tglLoadIdentity();\n\n\t\/\/ Multiplies the current matrix against an ortho perspectice matrix\n\t\/\/ with the left, right, bottom, top, near, and far values in the arguments.\n\tglOrtho(0.0f, SCREEN_WIDTH, SCREEN_HEIGHT, 0.0f, 1.0f, -1.0f);\n\n\tglMatrixMode(GL_MODELVIEW);\n\tglLoadIdentity();\n\n\t\/\/ Save the default modelview matrix\n\tglPushMatrix();\n\n\t\/\/ Set color when 'glClear()' is called (Uses RGBA format, currently black)\n\tglClearColor(0.0f, 0.0f, 0.0f, 1.0f);\n\n\t\/\/ Check for any OpenGL errors that may occur during initialization\n\tGLenum error = glGetError();\n\tif (error != GL_NO_ERROR)\n\t{\n\t\tprintf(\"Error initializing OpenGL! %s\\n\", gluErrorString(error));\n\t\treturn false;\n\t}\n\n\t\n\n\treturn true;\n}\n\n\/\/ Return true if successful, false otherwise\nbool loadMedia()\n{\n\treturn true;\n}\n\nvoid update()\n{\n\tss.rotatePlanets();\n}\n\nvoid render()\n{\n\t\/\/ Clear the color buffer (pixels on the screen)\n\tglClear(GL_COLOR_BUFFER_BIT);\n\tglLoadIdentity();\n\n\t\/\/ Pop default matrix onto current matrix\n\tglMatrixMode(GL_MODELVIEW);\n\tglPopMatrix();\n\n\t\/\/ Save default matrix again\n\tglPushMatrix();\n\n\t\/\/ Move projection view to center of screen\n\tglTranslatef(SCREEN_WIDTH \/ 2.0f, SCREEN_HEIGHT \/ 2.0f, 0.0f);\n\n\t\/\/ Text\n\trenderText(-300, -200, \"Basic Solar System Simulation\");\n\trenderText(-300, -180, \"Press Spacebar to randomize parameters\");\n\t\n\t\/*\n\t * NOTES\n\t *\n\t * VERTEX ORDER MATTERS\n\t * You can either go in a clockwise or counterclock wise direction.\n\t * For this, I go counterclockwise.\n\t *\n\t * This is because each vertex correlates with a face of the quad.\n\t * The first and second points are one side, second and third another,\n\t * third and fourth another, and fourth and first another, making\n\t * 4 sides.\n\t * *\/\n\n\n\t\/\/ Render solar system\n\tss.renderSolarSystem();\n\n\t\/*\n\t * NOTES\n\t * \n\t * This program uses a double buffered window. \n\t *\n\t * There are two buffers: front buffer and back buffer\n\t * The front buffer is what the user sees and the back\n\t * buffer is in memory.\n\t *\n\t * For a double buffered window:\n\t * When we make render calls, all of that is rendered in the back buffer.\n\t * After we're done rendering what we want to show the user, we \n\t * swap the front and back buffer. \n\t * \n\t * When there is a single window buffer,\n\t * the user will see geometry as it's being rendered. \n\t * This may cause unfinished rendering and tearing.\n\t *\n\t * \n\t * *\/\n\n\t\/\/ Render text\n\t\/\/glColor3f(0, 0.5f, 0.5f);\n\t\/\/glutStrokeCharacter(GLUT_STROKE_ROMAN, 'H');\n\n\t\/\/ Update GLUT buffer (our second buffer)\n\tglutSwapBuffers();\n\n}\n\nvoid renderText(int xPos, int yPos, std::string inputText)\n{\n\t\/\/ Position text (0, 0) = Center of screen\n\tglRasterPos2i(xPos, yPos);\n\n\tconst unsigned char *c;\n\tfor (int i = 0; i < inputText.size(); ++i)\n\t{\n\t\tglutBitmapCharacter(GLUT_BITMAP_9_BY_15, inputText[i]);\n\t}\n}\n\nvoid handleKeys(unsigned char key, int x, int y)\n{\n\tif (key == ' ')\n\t{\n\t\tss.shuffle();\n\t}\n}\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Arduino.h\"\n#include \"ESP8266WiFi.h\"\n#include \"ESP8266HTTPClient.h\"\n#include \"PubSubClient.h\"\n#include \"Adafruit_Sensor.h\"\n#include \"DHT.h\"\n#include \"TSL2561.h\"\n\n\/\/ include the user configuration file\n#include \"config.h\"\n\nextern \"C\" {\n#include \"user_interface.h\"\n\nextern struct rst_info resetInfo;\n}\n\nstruct {\n float ir;\n float full;\n float lux;\n float h;\n float t;\n uint16_t vdd;\n uint8_t count;\n} rtc_mem;\n\n\/\/ enable reading the Vcc voltage with the ADC\nADC_MODE(ADC_VCC);\n\n\/\/ WiFi network and password\nWiFiClient espClient;\nvoid connectWifi();\n\n\/\/ MQTT server & channel\nPubSubClient mqttClient(espClient);\nvoid reconnectMqtt();\nvoid callback(char* topic, byte* payload, unsigned int length);\n\n\/\/ DHT22 sensor pin & type declaration\nDHT dht(DHTPIN, DHTTYPE);\n\n\/\/ TSL2561 sensor pin declaration\nTSL2561 tsl(TSL2561_ADDR_FLOAT, SDAPIN, SCLPIN);\n\nunsigned long lastMsg = 0;\nuint8_t measurements = 0;\nvoid update();\nvoid doMeasurements();\nvoid resetRTC();\n\nvoid setup(void) {\n Serial.begin(9600);\n\n dht.begin();\n\n if (tsl.begin()) {\n Serial.println(\"Found sensor\");\n } else {\n Serial.println(\"No sensor?\");\n }\n\n tsl.setGain(TSL2561_GAIN_0X);\n tsl.setTiming(TSL2561_INTEGRATIONTIME_13MS);\n\n mqttClient.setServer(MQTTSERVER, 1883);\n mqttClient.setCallback(callback);\n\n \/\/ when NOT waking from deep sleep, reset RTC memory to 0 and wait for sensors to initialise\n Serial.println(ESP.getResetReason());\n if (resetInfo.reason != REASON_DEEP_SLEEP_AWAKE){\n resetRTC();\n delay(500);\n }\n}\n\nvoid loop() {\n #ifdef SLEEP\n doMeasurements();\n if(rtc_mem.count >= NUMMEASUREMENTS){\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (!mqttClient.connected()) {\n reconnectMqtt();\n }\n mqttClient.loop();\n\n update();\n }\n\n WiFi.disconnect(true);\n delay(50);\n\n if(rtc_mem.count >= NUMMEASUREMENTS-1){\n ESP.deepSleep(MEASUREMENTINTERVAL*1000000, WAKE_RF_DEFAULT);\n }\n else{\n ESP.deepSleep(MEASUREMENTINTERVAL*1000000, WAKE_RF_DISABLED);\n }\n #else\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (!mqttClient.connected()) {\n reconnectMqtt();\n }\n mqttClient.loop();\n\n unsigned long now = millis();\n if (now - lastMsg > MEASUREMENTINTERVAL*1000) {\n doMeasurements();\n lastMsg = millis();\n if(rtc_mem.count >= NUMMEASUREMENTS){\n update();\n }\n }\n #endif\n\n delay(50);\n}\n\nvoid doMeasurements(){\n tsl.enable();\n float h = dht.readHumidity();\n \/\/ Read temperature as Celsius (the default)\n float t = dht.readTemperature();\n\n \/\/ Check if any reads failed\n if (isnan(h) || isnan(t)) {\n Serial.println(\"Failed to read from DHT sensor!\");\n h=0;\n t=0;\n }\n\n Serial.print(\"Humidity: \");\n Serial.print(h);\n Serial.print(\" %\\t\");\n Serial.print(\"Temperature: \");\n Serial.print(t);\n Serial.println(\" *C \");\n\n \/\/ Read 32 bits with top 16 bits IR, bottom 16 bits full spectrum\n uint32_t lum = tsl.getFullLuminosity();\n uint16_t ir, full;\n ir = lum >> 16;\n full = lum & 0xFFFF;\n uint32_t lux = tsl.calculateLux(full, ir);\n\n \/\/disable sensor\n tsl.disable();\n\n Serial.print(\"IR: \"); Serial.print(ir); Serial.print(\"\\t\\t\");\n Serial.print(\"Full: \"); Serial.print(full); Serial.print(\"\\t\");\n Serial.print(\"Visible: \"); Serial.print(full - ir); Serial.print(\"\\t\");\n Serial.print(\"Lux: \"); Serial.println(lux);\n\n \/\/ read Vdd voltage\n uint16_t vdd = ESP.getVcc();\n\n \/\/ get avg of previous measurements from RTC memory\n ESP.rtcUserMemoryRead(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n\n \/\/ re-calculate average\n rtc_mem.t = rtc_mem.t+(t\/NUMMEASUREMENTS);\n rtc_mem.h = rtc_mem.h+(h\/NUMMEASUREMENTS);\n rtc_mem.ir = rtc_mem.ir+((float)ir\/NUMMEASUREMENTS);\n rtc_mem.full = rtc_mem.full+((float)full\/NUMMEASUREMENTS);\n rtc_mem.lux = rtc_mem.lux+((float)lux\/NUMMEASUREMENTS);\n rtc_mem.vdd = vdd;\n rtc_mem.count = rtc_mem.count + 1;\n\n \/\/ write to RTC mem\n ESP.rtcUserMemoryWrite(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n}\n\nvoid update(){\n \/\/ TODO: get free heap memory\n\n String data = String(\"field1=\" + String(rtc_mem.t, 1) + \"&field2=\" + String(rtc_mem.h, 1) + \"&field3=\" + String(rtc_mem.ir, 1)+ \"&field4=\" + String(rtc_mem.full, 1)+ \"&field5=\" + String(rtc_mem.lux, 1)+ \"&field6=\" + String(rtc_mem.vdd, DEC));\n int length = data.length();\n char msgBuffer[length];\n data.toCharArray(msgBuffer,length+1);\n\n String channel = String(\"channels\/\" + String(CHANNELID) +\"\/publish\/\"+String(APIKEY));\n length = channel.length();\n char chnlBuffer[length];\n\n channel.toCharArray(chnlBuffer, length+1);\n mqttClient.publish(chnlBuffer,msgBuffer);\n\n Serial.print(data);\n\n \/\/ give network some time to send data before proceding\n delay(1000);\n\n \/\/ set rtc to 0 for all fields and write to memory\n resetRTC();\n}\n\nvoid callback(char* topic, byte* payload, unsigned int length) {\n Serial.print(\"Message arrived [\");\n Serial.print(topic);\n Serial.print(\"] \");\n for (int i = 0; i < length; i++) {\n Serial.print((char)payload[i]);\n }\n Serial.println();\n}\n\nvoid resetRTC(){\n rtc_mem.t = 0.0;\n rtc_mem.h = 0.0;\n rtc_mem.ir = 0;\n rtc_mem.full = 0;\n rtc_mem.lux = 0;\n rtc_mem.vdd = 0;\n rtc_mem.count = 0;\n ESP.rtcUserMemoryWrite(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n}\n\nvoid connectWifi() {\n WiFi.disconnect(true);\n\n WiFi.begin(SSID, PASSWORD);\n while (WiFi.status() != WL_CONNECTED)\n {\n delay(500);\n Serial.print(\".\");\n }\n Serial.print(\"Connected, IP address: \");\n Serial.println(WiFi.localIP());\n}\n\nvoid reconnectMqtt(){\n uint8_t attempts = 0;\n while (!mqttClient.connected()) {\n if(attempts > 10){\n Serial.print(\"Could not connect to MQTT server. Restarting node.\");\n delay(50);\n ESP.reset();\n break;\n }\n Serial.printf(\"(%d) Attempting MQTT connection...\", attempts);\n \/\/ Create a random client ID\n String clientId = \"ESP8266Client-\";\n clientId += String(random(0xffff), HEX);\n \/\/ Attempt to connect\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (mqttClient.connect(clientId.c_str())) {\n Serial.println(\"connected\");\n } else {\n Serial.print(\"failed, rc=\");\n Serial.print(mqttClient.state());\n Serial.println(\" try again in 5 seconds\");\n \/\/ Wait 5 seconds before retrying\n delay(5000);\n }\n attempts++;\n }\n\n}\n<commit_msg>Print total time awake to serial when running deepsleep<commit_after>#include \"Arduino.h\"\n#include \"ESP8266WiFi.h\"\n#include \"ESP8266HTTPClient.h\"\n#include \"PubSubClient.h\"\n#include \"Adafruit_Sensor.h\"\n#include \"DHT.h\"\n#include \"TSL2561.h\"\n\n\/\/ include the user configuration file\n#include \"config.h\"\n\nextern \"C\" {\n#include \"user_interface.h\"\n\nextern struct rst_info resetInfo;\n}\n\nstruct {\n float ir;\n float full;\n float lux;\n float h;\n float t;\n uint16_t vdd;\n uint8_t count;\n} rtc_mem;\n\n\/\/ enable reading the Vcc voltage with the ADC\nADC_MODE(ADC_VCC);\n\n\/\/ WiFi network and password\nWiFiClient espClient;\nvoid connectWifi();\n\n\/\/ MQTT server & channel\nPubSubClient mqttClient(espClient);\nvoid reconnectMqtt();\nvoid callback(char* topic, byte* payload, unsigned int length);\n\n\/\/ DHT22 sensor pin & type declaration\nDHT dht(DHTPIN, DHTTYPE);\n\n\/\/ TSL2561 sensor pin declaration\nTSL2561 tsl(TSL2561_ADDR_FLOAT, SDAPIN, SCLPIN);\n\nunsigned long lastMsg = 0;\nuint8_t measurements = 0;\nvoid update();\nvoid doMeasurements();\nvoid resetRTC();\n\nunsigned long timet = 0;\n\nvoid setup(void) {\n timet = millis();\n Serial.begin(9600);\n\n dht.begin();\n tsl.begin();\n\n tsl.setGain(TSL2561_GAIN_0X);\n tsl.setTiming(TSL2561_INTEGRATIONTIME_13MS);\n\n mqttClient.setServer(MQTTSERVER, 1883);\n mqttClient.setCallback(callback);\n\n \/\/ when NOT waking from deep sleep, reset RTC memory to 0 and wait for sensors to initialise\n Serial.println(ESP.getResetReason());\n if (resetInfo.reason != REASON_DEEP_SLEEP_AWAKE){\n resetRTC();\n delay(500);\n }\n}\n\nvoid loop() {\n #ifdef SLEEP\n doMeasurements();\n if(rtc_mem.count >= NUMMEASUREMENTS){\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (!mqttClient.connected()) {\n reconnectMqtt();\n }\n mqttClient.loop();\n\n update();\n }\n\n WiFi.disconnect(true);\n\n Serial.print(\"Done. Took a total of \");\n Serial.print(millis()-timet);\n Serial.println(\" milliseconds\");\n\n if(rtc_mem.count >= NUMMEASUREMENTS-1){\n ESP.deepSleep(MEASUREMENTINTERVAL*1000000, WAKE_RF_DEFAULT);\n }\n else{\n ESP.deepSleep(MEASUREMENTINTERVAL*1000000, WAKE_RF_DISABLED);\n }\n #else\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (!mqttClient.connected()) {\n reconnectMqtt();\n }\n mqttClient.loop();\n\n unsigned long now = millis();\n if (now - lastMsg > MEASUREMENTINTERVAL*1000) {\n doMeasurements();\n lastMsg = millis();\n if(rtc_mem.count >= NUMMEASUREMENTS){\n update();\n }\n }\n #endif\n\n delay(50);\n}\n\nvoid doMeasurements(){\n tsl.enable();\n float h = dht.readHumidity();\n \/\/ Read temperature as Celsius (the default)\n float t = dht.readTemperature();\n\n \/\/ Check if any reads failed\n if (isnan(h) || isnan(t)) {\n Serial.println(\"Failed to read from DHT sensor!\");\n h=0;\n t=0;\n }\n\n Serial.print(\"Humidity: \");\n Serial.print(h);\n Serial.print(\" %\\t\");\n Serial.print(\"Temperature: \");\n Serial.print(t);\n Serial.println(\" *C \");\n\n \/\/ Read 32 bits with top 16 bits IR, bottom 16 bits full spectrum\n uint32_t lum = tsl.getFullLuminosity();\n uint16_t ir, full;\n ir = lum >> 16;\n full = lum & 0xFFFF;\n uint32_t lux = tsl.calculateLux(full, ir);\n\n \/\/disable sensor\n tsl.disable();\n\n Serial.print(\"IR: \"); Serial.print(ir); Serial.print(\"\\t\\t\");\n Serial.print(\"Full: \"); Serial.print(full); Serial.print(\"\\t\");\n Serial.print(\"Visible: \"); Serial.print(full - ir); Serial.print(\"\\t\");\n Serial.print(\"Lux: \"); Serial.println(lux);\n\n \/\/ read Vdd voltage\n uint16_t vdd = ESP.getVcc();\n\n \/\/ get avg of previous measurements from RTC memory\n ESP.rtcUserMemoryRead(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n\n \/\/ re-calculate average\n rtc_mem.t = rtc_mem.t+(t\/NUMMEASUREMENTS);\n rtc_mem.h = rtc_mem.h+(h\/NUMMEASUREMENTS);\n rtc_mem.ir = rtc_mem.ir+((float)ir\/NUMMEASUREMENTS);\n rtc_mem.full = rtc_mem.full+((float)full\/NUMMEASUREMENTS);\n rtc_mem.lux = rtc_mem.lux+((float)lux\/NUMMEASUREMENTS);\n rtc_mem.vdd = vdd;\n rtc_mem.count = rtc_mem.count + 1;\n\n \/\/ write to RTC mem\n ESP.rtcUserMemoryWrite(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n}\n\nvoid update(){\n \/\/ TODO: get free heap memory\n\n String data = String(\"field1=\" + String(rtc_mem.t, 1) + \"&field2=\" + String(rtc_mem.h, 1) + \"&field3=\" + String(rtc_mem.ir, 1)+ \"&field4=\" + String(rtc_mem.full, 1)+ \"&field5=\" + String(rtc_mem.lux, 1)+ \"&field6=\" + String(rtc_mem.vdd, DEC));\n int length = data.length();\n char msgBuffer[length];\n data.toCharArray(msgBuffer,length+1);\n\n String channel = String(\"channels\/\" + String(CHANNELID) +\"\/publish\/\"+String(APIKEY));\n length = channel.length();\n char chnlBuffer[length];\n\n channel.toCharArray(chnlBuffer, length+1);\n mqttClient.publish(chnlBuffer,msgBuffer);\n\n Serial.print(data);\n\n \/\/ give network some time to send data before proceding\n delay(1000);\n\n \/\/ set rtc to 0 for all fields and write to memory\n resetRTC();\n}\n\nvoid callback(char* topic, byte* payload, unsigned int length) {\n Serial.print(\"Message arrived [\");\n Serial.print(topic);\n Serial.print(\"] \");\n for (int i = 0; i < length; i++) {\n Serial.print((char)payload[i]);\n }\n Serial.println();\n}\n\nvoid resetRTC(){\n rtc_mem.t = 0.0;\n rtc_mem.h = 0.0;\n rtc_mem.ir = 0;\n rtc_mem.full = 0;\n rtc_mem.lux = 0;\n rtc_mem.vdd = 0;\n rtc_mem.count = 0;\n ESP.rtcUserMemoryWrite(0, (uint32_t*) &rtc_mem, sizeof(rtc_mem));\n}\n\nvoid connectWifi() {\n WiFi.disconnect(true);\n\n WiFi.begin(SSID, PASSWORD);\n while (WiFi.status() != WL_CONNECTED)\n {\n delay(500);\n Serial.print(\".\");\n }\n Serial.print(\"Connected, IP address: \");\n Serial.println(WiFi.localIP());\n}\n\nvoid reconnectMqtt(){\n uint8_t attempts = 0;\n while (!mqttClient.connected()) {\n if(attempts > 10){\n Serial.print(\"Could not connect to MQTT server. Restarting node.\");\n delay(50);\n ESP.reset();\n break;\n }\n Serial.printf(\"(%d) Attempting MQTT connection...\", attempts);\n \/\/ Create a random client ID\n String clientId = \"ESP8266Client-\";\n clientId += String(random(0xffff), HEX);\n \/\/ Attempt to connect\n if ((WiFi.status() != WL_CONNECTED)){\n connectWifi();\n }\n if (mqttClient.connect(clientId.c_str())) {\n Serial.println(\"connected\");\n } else {\n Serial.print(\"failed, rc=\");\n Serial.print(mqttClient.state());\n Serial.println(\" try again in 5 seconds\");\n \/\/ Wait 5 seconds before retrying\n delay(5000);\n }\n attempts++;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * JeezyAI is a rap bot that emulates Young Jeezy.\n *\n * Given a bar, JeezyAI will return a rhyme on beat. The AI is trained on a\n * bank of Jeezy lyrics, so it spits like Jeezy.\n *\n * Cameron Matson, Clayton Gentry\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n\n#include \"battle.h\"\n#include \"denouncer.h\"\n#include \"model.h\"\n#include \"nouncer.h\"\n#include \"utils.h\"\n#include \"word.h\"\n#include \"wordList.h\"\n\n#define LYRICS_FILE \"lyrics\/lyrics.txt\"\n#define TEST_FILE \"lyrics\/test.txt\"\n\nvoid rap(std::string bar, Model* model, Nouncer* nouncer, Denouncer* denouncer);\nvoid parseFile(std::string filename, Model* model, Nouncer* nouncer, Denouncer* denouncer);\nvoid parseLine(std::string in, Model* model, Nouncer* nouncer, Denouncer* denouncer);\n\nint main(int argc, char *argv[]) {\n Model* model = new Model();\n Nouncer* nouncer = new Nouncer();\n Denouncer* denouncer = new Denouncer();\n\n parseFile(TEST_FILE, model, nouncer, denouncer);\n\n model->print(\"data\/model.txt\");\n denouncer->print(\"data\/denounce.txt\");\n\n std::string bar;\n std::cout << \"Gimme a bar\" << std::endl;\n std::getline(std::cin, bar);\n\n rap(bar, model, nouncer, denouncer);\n\n delete model;\n delete nouncer;\n delete denouncer;\n}\n\n\/*\n * Defines the recursive functionality to consume a given bar and respond.\n *\/\nvoid rap(std::string bar, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n if (bar == \"exit\") {\n delete model;\n delete nouncer;\n delete denouncer;\n\n return;\n }\n else {\n Battle* battle = new Battle(bar, model, nouncer, denouncer);\n battle->spit();\n delete battle;\n\n std::getline(std::cin, bar);\n rap(bar, model, nouncer, denouncer);\n\n delete battle;\n }\n}\n\n\/*\n * Parses a text file of lyrics\n *\n * Iterates through each line of the file, passing references to\n * the data structures to be constructed during analysis.\n *\/\nvoid parseFile(std::string filename, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n std::string line;\n std::ifstream file(filename);\n\n \/\/add place holder: every word will be a \"leader\" of _NULL_\n Word* _NULL_ = new Word(\"_NULL_\");\n model->addOrUpdate(_NULL_);\n delete _NULL_;\n\n if (file) {\n while(getline(file, line)) {\n parseLine(line, model, nouncer, denouncer);\n }\n\n file.close();\n }\n else {\n std::cerr << \"Could not load lyrics file\" << std::endl;\n }\n std::cout << \"Model ready!\" << std::endl;\n}\n\n\/*\n * Parses a line\n *\n * Each new unique word is appended to the adjacency list\n * as a base word, and its preceding word is instantiated\n * as a node in its leaders vector. If the leader has already\n * been instantiated, its frequency is updated.\n *\n * Lines are processed individually to ensure the model\n * doesn't assume false positive adjacency between the\n * last word of a preceding line and the first word of\n * its successor.\n *\/\nvoid parseLine(std::string in, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n std::istringstream ss(Utils::flip(in));\n std::string temp;\n std::string nounce;\n std::string encoded;\n\n \/\/ Word* current = nullptr;\n \/\/ Word* leader = nullptr;\n\n Word current;\n Word leader;\n\n Word* _NULL_ = new Word(\"_NULL_\");\n\n while (ss >> temp) {\n \/\/preprocess temp\n temp = Utils::removePunc(temp);\n temp = Utils::noCaps(temp);\n\n \/\/get pronunciation\n nounce = *(nouncer->lookUp(temp));\n\n \/\/add pronunciation:word pair to denouncer\n denouncer->addNounce(nounce, temp);\n\n \/\/pick off the word\n \/\/ current = new Word(temp);\n current = Word(temp);\n\n \/\/add word to _NULL_\n WordList* list_ptr = model -> find(_NULL_);\n \/\/ (*list_ptr).add_leader(*current);\n (*list_ptr).add_leader(current);\n\n\n \/\/add current to the model\n \/\/ model->addOrUpdate(current);\n model->addOrUpdate(¤t);\n\n \/\/ if first word on (reversed) line => last word on a line => current not a leader\n \/\/ if (leader == nullptr) {\n if (leader.getVal() == \"\") {\n leader = current;\n }\n\n \/\/other wise add current to leader's list\n else {\n \/\/ list_ptr = model -> find(leader);\n list_ptr = model -> find(&leader);\n\n\n \/\/if leader is not in the model\n if (list_ptr != nullptr) {\n \/\/ (*list_ptr).add_leader(*current);\n (*list_ptr).add_leader(current);\n leader = current;\n }\n else {\n std::cerr << \"Could not get leader.\" << std::endl;\n }\n }\n \/\/ delete current;\n \/\/ current = nullptr;\n }\n delete _NULL_;\n}\n<commit_msg>don't delete stuff twice<commit_after>\/*\n * JeezyAI is a rap bot that emulates Young Jeezy.\n *\n * Given a bar, JeezyAI will return a rhyme on beat. The AI is trained on a\n * bank of Jeezy lyrics, so it spits like Jeezy.\n *\n * Cameron Matson, Clayton Gentry\n *\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n\n#include \"battle.h\"\n#include \"denouncer.h\"\n#include \"model.h\"\n#include \"nouncer.h\"\n#include \"utils.h\"\n#include \"word.h\"\n#include \"wordList.h\"\n\n#define LYRICS_FILE \"lyrics\/lyrics.txt\"\n#define TEST_FILE \"lyrics\/test.txt\"\n\nvoid rap(std::string bar, Model* model, Nouncer* nouncer, Denouncer* denouncer);\nvoid parseFile(std::string filename, Model* model, Nouncer* nouncer, Denouncer* denouncer);\nvoid parseLine(std::string in, Model* model, Nouncer* nouncer, Denouncer* denouncer);\n\nint main(int argc, char *argv[]) {\n Model* model = new Model();\n Nouncer* nouncer = new Nouncer();\n Denouncer* denouncer = new Denouncer();\n\n parseFile(TEST_FILE, model, nouncer, denouncer);\n\n model->print(\"data\/model.txt\");\n denouncer->print(\"data\/denounce.txt\");\n\n std::string bar;\n std::cout << \"Gimme a bar\" << std::endl;\n std::getline(std::cin, bar);\n\n rap(bar, model, nouncer, denouncer);\n\n delete model;\n delete nouncer;\n delete denouncer;\n}\n\n\/*\n * Defines the recursive functionality to consume a given bar and respond.\n *\/\nvoid rap(std::string bar, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n if (bar == \"exit\") {\n return;\n }\n else {\n Battle* battle = new Battle(bar, model, nouncer, denouncer);\n battle->spit();\n\n std::getline(std::cin, bar);\n rap(bar, model, nouncer, denouncer);\n\n delete battle;\n }\n}\n\n\/*\n * Parses a text file of lyrics\n *\n * Iterates through each line of the file, passing references to\n * the data structures to be constructed during analysis.\n *\/\nvoid parseFile(std::string filename, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n std::string line;\n std::ifstream file(filename);\n\n \/\/add place holder: every word will be a \"leader\" of _NULL_\n Word* _NULL_ = new Word(\"_NULL_\");\n model->addOrUpdate(_NULL_);\n delete _NULL_;\n\n if (file) {\n while(getline(file, line)) {\n parseLine(line, model, nouncer, denouncer);\n }\n\n file.close();\n }\n else {\n std::cerr << \"Could not load lyrics file\" << std::endl;\n }\n std::cout << \"Model ready!\" << std::endl;\n}\n\n\/*\n * Parses a line\n *\n * Each new unique word is appended to the adjacency list\n * as a base word, and its preceding word is instantiated\n * as a node in its leaders vector. If the leader has already\n * been instantiated, its frequency is updated.\n *\n * Lines are processed individually to ensure the model\n * doesn't assume false positive adjacency between the\n * last word of a preceding line and the first word of\n * its successor.\n *\/\nvoid parseLine(std::string in, Model* model, Nouncer* nouncer, Denouncer* denouncer) {\n std::istringstream ss(Utils::flip(in));\n std::string temp;\n std::string nounce;\n std::string encoded;\n\n \/\/ Word* current = nullptr;\n \/\/ Word* leader = nullptr;\n\n Word current;\n Word leader;\n\n Word* _NULL_ = new Word(\"_NULL_\");\n\n while (ss >> temp) {\n \/\/preprocess temp\n temp = Utils::removePunc(temp);\n temp = Utils::noCaps(temp);\n\n \/\/get pronunciation\n nounce = *(nouncer->lookUp(temp));\n\n \/\/add pronunciation:word pair to denouncer\n denouncer->addNounce(nounce, temp);\n\n \/\/pick off the word\n \/\/ current = new Word(temp);\n current = Word(temp);\n\n \/\/add word to _NULL_\n WordList* list_ptr = model -> find(_NULL_);\n \/\/ (*list_ptr).add_leader(*current);\n (*list_ptr).add_leader(current);\n\n\n \/\/add current to the model\n \/\/ model->addOrUpdate(current);\n model->addOrUpdate(¤t);\n\n \/\/ if first word on (reversed) line => last word on a line => current not a leader\n \/\/ if (leader == nullptr) {\n if (leader.getVal() == \"\") {\n leader = current;\n }\n\n \/\/other wise add current to leader's list\n else {\n \/\/ list_ptr = model -> find(leader);\n list_ptr = model -> find(&leader);\n\n\n \/\/if leader is not in the model\n if (list_ptr != nullptr) {\n \/\/ (*list_ptr).add_leader(*current);\n (*list_ptr).add_leader(current);\n leader = current;\n }\n else {\n std::cerr << \"Could not get leader.\" << std::endl;\n }\n }\n \/\/ delete current;\n \/\/ current = nullptr;\n }\n delete _NULL_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by kanairen on 2016\/06\/15.\n\/\/\n\n#include \"config.h\"\n#include \"MNIST.h\"\n#include \"Layer.h\"\n#include \"ConvLayer.h\"\n#include \"Model.h\"\n#include \"optimizer.h\"\n#include \"activation.h\"\n\n#ifdef CONV_NET_CPP_DEBUG\n\n\n\/\/ コマンドライン引数にmnistへのパスを渡す\nint main(int argc, char *argv[]) {\n\n float learning_rate = 0.01f;\n unsigned int batch_size = 50;\n unsigned int input_size = 28 * 28;\n unsigned int n_iter = 1000;\n unsigned int n_class = 10;\n\n \/\/ mnist\n MNIST mnist(argv[1], argv[2], argv[3], argv[4]);\n\n AbstractLayer *layer_1 = new ConvLayer2d(batch_size, 28, 28, 1, 16, 2, 2, 1,\n iden, g_iden);\n AbstractLayer *layer_2 = new Layer(batch_size, layer_1->get_n_out(),\n n_class, iden, g_iden);\n vector<AbstractLayer *> v{layer_1, layer_2};\n\/\/ AbstractLayer* layer_1 = new Layer(batch_size, mnist.xv_size(), 10, iden, g_iden);\n\/\/ AbstractLayer* layer_2 = new Layer(batch_size, 10, n_class, iden, g_iden);\n\/\/ vector<AbstractLayer*> v{layer_1,layer_2};\n\n \/\/ optimize\n optimize(mnist, v, learning_rate, batch_size, n_iter, n_class);\n\n \/\/ release\n delete (layer_1);\n\n}\n\n#endif<commit_msg>modify main<commit_after>\/\/\n\/\/ Created by kanairen on 2016\/06\/15.\n\/\/\n\n#include \"config.h\"\n#include \"MNIST.h\"\n#include \"Layer.h\"\n#include \"ConvLayer.h\"\n#include \"Model.h\"\n#include \"optimizer.h\"\n#include \"activation.h\"\n\n#ifdef CONV_NET_CPP_DEBUG\n\nvoid mnist_full_connelct(char *argv[],\n unsigned int batch_size,\n unsigned int input_size,\n unsigned int n_class,\n unsigned int n_iter,\n float learning_rate) {\n \/\/ mnist\n MNIST mnist(argv[1], argv[2], argv[3], argv[4]);\n\n AbstractLayer *layer_1 = new Layer(batch_size, input_size, n_class, iden,\n g_iden);\n vector<AbstractLayer *> v{layer_1};\n\n \/\/ optimize\n optimize(mnist, v, learning_rate, batch_size, n_iter, n_class);\n\n \/\/ release\n delete (layer_1);\n}\n\nvoid mnist_conv(char *argv[], unsigned int batch_size,\n unsigned int input_width, unsigned int input_height,\n unsigned int c_in, unsigned int c_out,\n unsigned int kw, unsigned int kh, unsigned int stride,\n unsigned int n_class, unsigned int n_iter,\n float learning_rate) {\n \/\/ mnist\n MNIST mnist(argv[1], argv[2], argv[3], argv[4]);\n\n AbstractLayer *layer_1 = new ConvLayer2d(batch_size,\n input_width, input_height,\n c_in, c_out, kw, kh, stride,\n iden, g_iden);\n\n AbstractLayer *layer_2 = new Layer(batch_size, layer_1->get_n_out(),\n n_class, iden, g_iden);\n\n vector<AbstractLayer *> v{layer_1, layer_2};\n\n \/\/ optimize\n optimize(mnist, v, learning_rate, batch_size, n_iter, n_class);\n\n \/\/ release\n delete (layer_1);\n delete (layer_2);\n\n}\n\n\n\/\/ コマンドライン引数にmnistへのパスを渡す\nint main(int argc, char *argv[]) {\n\n const float LEARNING_RATE = 0.01f;\n\n const unsigned int BATCH_SIZE = 50;\n\n const unsigned int WIDTH = 28;\n const unsigned int HEIGHT = 28;\n const unsigned int INPUT_SIZE = WIDTH * HEIGHT;\n\n const unsigned int C_IN = 1;\n const unsigned int C_OUT = 16;\n\n const unsigned int KERNEL_WIDTH = 2;\n const unsigned int KERNEL_HEIGHT = 2;\n\n const unsigned int STRIDE = 1;\n\n const unsigned int N_ITERATION = 1000;\n const unsigned int N_CLASS = 10;\n\n mnist_conv(argv, BATCH_SIZE, WIDTH, HEIGHT, C_IN, C_OUT, KERNEL_WIDTH,\n KERNEL_HEIGHT, STRIDE, N_CLASS, N_ITERATION, LEARNING_RATE);\n\n\n}\n\n#endif<|endoftext|>"} {"text":"<commit_before>#include \"headers\/ph.hpp\"\n\n#include \"headers\/application.hpp\"\n\n#include \"headers\/code_generating_visitor.hpp\"\n#include \"headers\/code_generator.hpp\"\n#include \"headers\/semantic_analysis_visitor.hpp\"\n#include \"headers\/symbols_controller_factory.hpp\"\n#include \"headers\/type_data.hpp\"\n\n#include <boost\/program_options.hpp>\n\n#include <fstream>\n\nnamespace Framework\n{\n\nApplication::Application()\n{\n}\n\t\nint\nApplication::execute( int argc, char* argv[] )\n{\n\tSemantics::FunctionsController & functionsController\n\t\t= Semantics::SymbolsControllerFactory::createFunctionsController();\n\t\t\n\tSemantics::StringsController & stringsController\n\t\t= Semantics::SymbolsControllerFactory::createStringsController();\n\t\t\n\tSemantics::TypesController & typesController\n\t\t= Semantics::SymbolsControllerFactory::createTypesController();\n\t\n\tSemantics::TypesController::Handler const voidHandler\n\t\t= typesController.insert( Semantics::TypeData( Semantics::BuildInType::create( \"void\" ) ) );\n\t\t\n\tSemantics::TypesController::Handler const stringHandler\n\t\t= typesController.insert( Semantics::TypeData( Semantics::BuildInType::create( \"int\" ) ) );\n\t\t\n\tSemantics::VariablesController & variablesController\n\t\t= Semantics::SymbolsControllerFactory::createVariablesController();\n\n\tm_parser.reset( new Syntax::Parser( new std::ifstream( argv[ 1 ] ), &std::cout ) );\n\tif( m_parser->yyparse() )\n\t{\n\t\tstd::cerr << \"Syntax error.\" << std::endl;\n\t}\n\t\n\tSemantics::SemanticAnalysisVisitor semanticAnalysisVisitor(\n\t\tfunctionsController,\n\t\tstringsController,\n\t\ttypesController,\n\t\tvariablesController );\n\t\n\tm_parser->getProgram()->Accept( semanticAnalysisVisitor );\n\t\t\n\tint const errorCount = semanticAnalysisVisitor.getErrorsCount();\n\n\tif ( ! errorCount )\n\t{\n\t\tCodeGenerating::CodeGeneratingVisitor codeGeneratingVisitor(\n\t\t\tfunctionsController,\n\t\t\tstringsController,\n\t\t\ttypesController,\n\t\t\tvariablesController );\n\t\t\n\t\tm_parser->getProgram()->Accept( codeGeneratingVisitor );\n\t}\n\t\n\/\/ \tstd::cerr\n\/\/ \t\t<< \"Compilation finished with... [\"\n\/\/ \t\t<< semanticAnalysisVisitor.getWarningsCount()\n\/\/ \t\t<< \"] warning(s), [\"\n\/\/ \t\t<< errorCount\n\/\/ \t\t<< \"] error(s).\"\n\/\/ \t\t<< std::endl;\n\t\n\treturn errorCount ? 1 : 0;\n}\n\n}\n<commit_msg>Print help message if no input file specified<commit_after>#include \"headers\/ph.hpp\"\n\n#include \"headers\/application.hpp\"\n\n#include \"headers\/code_generating_visitor.hpp\"\n#include \"headers\/code_generator.hpp\"\n#include \"headers\/semantic_analysis_visitor.hpp\"\n#include \"headers\/symbols_controller_factory.hpp\"\n#include \"headers\/type_data.hpp\"\n\n#include <boost\/program_options.hpp>\n\n#include <fstream>\n\nnamespace Framework\n{\n\nApplication::Application()\n{\n}\n\t\nint\nApplication::execute( int argc, char* argv[] )\n{\n if( argc != 2 )\n {\n std::cerr << \"Usage: \" << argv[0] << \" file\" << std::endl;\n return 1;\n }\n\n\tSemantics::FunctionsController & functionsController\n\t\t= Semantics::SymbolsControllerFactory::createFunctionsController();\n\t\t\n\tSemantics::StringsController & stringsController\n\t\t= Semantics::SymbolsControllerFactory::createStringsController();\n\t\t\n\tSemantics::TypesController & typesController\n\t\t= Semantics::SymbolsControllerFactory::createTypesController();\n\t\n\tSemantics::TypesController::Handler const voidHandler\n\t\t= typesController.insert( Semantics::TypeData( Semantics::BuildInType::create( \"void\" ) ) );\n\t\t\n\tSemantics::TypesController::Handler const stringHandler\n\t\t= typesController.insert( Semantics::TypeData( Semantics::BuildInType::create( \"int\" ) ) );\n\t\t\n\tSemantics::VariablesController & variablesController\n\t\t= Semantics::SymbolsControllerFactory::createVariablesController();\n\n\tm_parser.reset( new Syntax::Parser( new std::ifstream( argv[ 1 ] ), &std::cout ) );\n\tif( m_parser->yyparse() )\n\t{\n\t\tstd::cerr << \"Syntax error.\" << std::endl;\n\t}\n\t\n\tSemantics::SemanticAnalysisVisitor semanticAnalysisVisitor(\n\t\tfunctionsController,\n\t\tstringsController,\n\t\ttypesController,\n\t\tvariablesController );\n\t\n\tm_parser->getProgram()->Accept( semanticAnalysisVisitor );\n\t\t\n\tint const errorCount = semanticAnalysisVisitor.getErrorsCount();\n\n\tif ( ! errorCount )\n\t{\n\t\tCodeGenerating::CodeGeneratingVisitor codeGeneratingVisitor(\n\t\t\tfunctionsController,\n\t\t\tstringsController,\n\t\t\ttypesController,\n\t\t\tvariablesController );\n\t\t\n\t\tm_parser->getProgram()->Accept( codeGeneratingVisitor );\n\t}\n\t\n\/\/ \tstd::cerr\n\/\/ \t\t<< \"Compilation finished with... [\"\n\/\/ \t\t<< semanticAnalysisVisitor.getWarningsCount()\n\/\/ \t\t<< \"] warning(s), [\"\n\/\/ \t\t<< errorCount\n\/\/ \t\t<< \"] error(s).\"\n\/\/ \t\t<< std::endl;\n\t\n\treturn errorCount ? 1 : 0;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gc\/gc_cpp.h>\n#include \"primops.hpp\"\n\nstatic void addPrimOp(nix::EvalState& state, nix::Value& v, const nix::Symbol & name, unsigned int arity, nix::PrimOpFun primOp) {\n nix::Value* vAttr = state.allocAttr(v, name);\n vAttr->type = nix::tPrimOp;\n vAttr->primOp = new (UseGC) nix::PrimOp(primOp, arity, name);\n}\n\n[[gnu::visibility (\"default\")]]\n extern \"C\" void initialize(nix::EvalState& state, nix::Value& v) {\n state.mkAttrs(v, 1);\n addPrimOp(state, v, state.symbols.create(\"readdir\"), 1, prim_readdir);\n}\n<commit_msg>Attribute goes after linkage<commit_after>#include <gc\/gc_cpp.h>\n#include \"primops.hpp\"\n\nstatic void addPrimOp(nix::EvalState& state, nix::Value& v, const nix::Symbol & name, unsigned int arity, nix::PrimOpFun primOp) {\n nix::Value* vAttr = state.allocAttr(v, name);\n vAttr->type = nix::tPrimOp;\n vAttr->primOp = new (UseGC) nix::PrimOp(primOp, arity, name);\n}\n\nextern \"C\" [[gnu::visibility (\"default\")]]\n void initialize(nix::EvalState& state, nix::Value& v) {\n state.mkAttrs(v, 1);\n addPrimOp(state, v, state.symbols.create(\"readdir\"), 1, prim_readdir);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <stack>\n#include <vector>\n#include <iostream>\n#include <string>\n\n#include \"include\/parser.h\"\n#include \"include\/error.h\"\n#include \"include\/env.h\"\n#include \"include\/token.h\"\n#include \"include\/object.h\"\n\nint main(int argc, const char * argv[]) {\n \/* TODO: use an external library to parse command lines *\/\n if (argc == 1) {\n \/* initialize the base global environment *\/\n SpEnv base_scope(NULL); \n\n \/* initialize the object value stack *\/\n std::stack<SpObject *> ob_s;\n\n \/* initialize native functions *\/\n\n \/* start the REPL *\/\n std::string input;\n\n while (1) {\n \/* print the prompt and ask for input *\/\n printf(\"=> \");\n getline(std::cin, input);\n\n \/* evaluate this line *\/\n char first = input[0];\n SpParser parser(input.substr(1));\n SpError *err = NULL;\n\n \/* check if an error was raised by parsing *\/\n if (first == '(')\n err = parser.parse_expr();\n else if(first == '[')\n err = parser.parse_function();\n else\n err = PARSE_ERROR(\"Expected '(' or '['\");\n\n if (err) {\n printf(\"Parse Error: %s\", err->message().c_str());\n delete err;\n continue;\n } else {\n printf(\"Successfully parsed %d tokens: \", (int)parser.num_tokens());\n for (auto it = parser.cbegin_token(); it != parser.cend_token(); ++it) {\n printf(\"%s \", (*it)->value().c_str());\n }\n printf(\"\\n\");\n }\n\n \/* evaluate the bytecode \n err = eval_bytecode(ob_s, base_scope, opcodes);\n if (ob_s.size() == 1) {\n TObject *result = ob_s.top(); ob_s.pop();\n result->print_self();\n } else {\n err = RUNTIME_ERROR(\"Left-over objects in stacks\");\n }*\/\n\n \/* check if there was any errors caused by the evaluation *\/\n \/*if (err) {\n printf(\"Runtime Error: %s\\n\", err->message);\n continue;\n }*\/\n }\n }\n\n return 0;\n}\n<commit_msg>Incorporate VM to REPL<commit_after>#include \"include\/parser.h\"\n#include \"include\/error.h\"\n#include \"include\/env.h\"\n#include \"include\/token.h\"\n#include \"include\/object.h\"\n#include \"include\/vm.h\"\n\n#include <cstdio>\n#include <stack>\n#include <vector>\n#include <iostream>\n#include <string>\n\nint main(int argc, const char * argv[]) {\n \/* TODO: use an external library to parse command lines *\/\n if (argc == 1) {\n \/* initialize the parser and VM *\/\n SpParser parser;\n SpVM vm(&parser);\n\n \/* initialize native functions *\/\n\n \/* start the REPL *\/\n std::string input;\n\n while (1) {\n \/* print the prompt and ask for input *\/\n printf(\"=> \");\n getline(std::cin, input);\n\n \/* evaluate this line *\/\n char first = input[0];\n parser.load(input.substr(1));\n SpError *err = NULL;\n\n \/* check if an error was raised by parsing *\/\n if (first == '(')\n err = parser.parse_expr();\n else if(first == '[')\n err = parser.parse_function();\n else\n err = PARSE_ERROR(\"Expected '(' or '['\");\n\n if (err) {\n printf(\"Parse Error: %s\\n\", err->message().c_str());\n delete err;\n continue;\n } else {\n printf(\"Successfully parsed %d tokens: \", (int)parser.num_tokens());\n for (auto it = parser.cbegin_token(); it != parser.cend_token(); ++it) {\n printf(\"%s \", (*it)->value().c_str());\n }\n printf(\"\\n\");\n }\n\n \/* evaluate the bytecode *\/\n err = vm.eval(parser.cbegin_token(), parser.cend_token());\n\n \/* check if there was any errors caused by the evaluation *\/\n if (err) {\n printf(\"Runtime Error: %s\\n\", err->message().c_str());\n continue;\n }\n\n if (vm.top_object()) {\n SpObject *result = vm.top_object();\n result->print_self();\n vm.clear_objects();\n } else printf(\"NULL RETURN VALUE\\n\");\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ =================================================================== \/\/\n\/\/ Copyright (C) 2014-2015 Kimura Ryo \/\/\n\/\/ \/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public \/\/\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this \/\/\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. \/\/\n\/\/ =================================================================== \/\/\n\n#include <QtCore\/QLocale>\n#include <QtWidgets\/QApplication>\n\n#include \"MainWindow.h\"\n\nint main(int argc, char** argv)\n{\n QLocale::setDefault(QLocale::system());\n\n QApplication app(argc, argv);\n MainWindow* mainWindow = new MainWindow(0);\n mainWindow->show();\n\n const QStringList arguments = app.arguments();\n\n if (arguments.size() > 1 && QFile::exists(arguments.last())) {\n mainWindow->openFile(arguments.last());\n }\n\n return app.exec();\n}\n<commit_msg>Enabled high DPI scaling in Qt<commit_after>\/\/ =================================================================== \/\/\n\/\/ Copyright (C) 2014-2015 Kimura Ryo \/\/\n\/\/ \/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public \/\/\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this \/\/\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/. \/\/\n\/\/ =================================================================== \/\/\n\n#include <QtCore\/QLocale>\n#include <QtWidgets\/QApplication>\n\n#include \"MainWindow.h\"\n\nint main(int argc, char** argv)\n{\n QLocale::setDefault(QLocale::system());\n QApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\n\n QApplication app(argc, argv);\n MainWindow* mainWindow = new MainWindow(0);\n mainWindow->show();\n\n const QStringList arguments = app.arguments();\n\n if (arguments.size() > 1 && QFile::exists(arguments.last())) {\n mainWindow->openFile(arguments.last());\n }\n\n return app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n#define RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n\n#include <memory>\n#include <stdexcept>\n\n#include \"rcl\/types.h\"\n\n#include \"rclcpp\/allocator\/allocator_common.hpp\"\n#include \"rclcpp\/exceptions.hpp\"\n#include \"rclcpp\/macros.hpp\"\n#include \"rclcpp\/visibility_control.hpp\"\n\n#include \"rcutils\/logging_macros.h\"\n\n#include \"rmw\/serialized_message.h\"\n\nnamespace rclcpp\n{\nnamespace message_memory_strategy\n{\n\n\/\/\/ Default allocation strategy for messages received by subscriptions.\n\/** A message memory strategy must be templated on the type of the subscription it belongs to. *\/\ntemplate<typename MessageT, typename Alloc = std::allocator<void>>\nclass MessageMemoryStrategy\n{\npublic:\n RCLCPP_SMART_PTR_DEFINITIONS(MessageMemoryStrategy)\n\n using MessageAllocTraits = allocator::AllocRebind<MessageT, Alloc>;\n using MessageAlloc = typename MessageAllocTraits::allocator_type;\n using MessageDeleter = allocator::Deleter<MessageAlloc, MessageT>;\n\n using SerializedMessageAllocTraits = allocator::AllocRebind<rclcpp::SerializedMessage, Alloc>;\n using SerializedMessageAlloc = typename SerializedMessageAllocTraits::allocator_type;\n using SerializedMessageDeleter =\n allocator::Deleter<SerializedMessageAlloc, rclcpp::SerializedMessage>;\n\n using BufferAllocTraits = allocator::AllocRebind<char, Alloc>;\n using BufferAlloc = typename BufferAllocTraits::allocator_type;\n using BufferDeleter = allocator::Deleter<BufferAlloc, char>;\n\n MessageMemoryStrategy()\n {\n message_allocator_ = std::make_shared<MessageAlloc>();\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>();\n buffer_allocator_ = std::make_shared<BufferAlloc>();\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n explicit MessageMemoryStrategy(std::shared_ptr<Alloc> allocator)\n {\n message_allocator_ = std::make_shared<MessageAlloc>(*allocator.get());\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>(*allocator.get());\n buffer_allocator_ = std::make_shared<BufferAlloc>(*allocator.get());\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n virtual ~MessageMemoryStrategy() = default;\n\n \/\/\/ Default factory method\n static SharedPtr create_default()\n {\n return std::make_shared<MessageMemoryStrategy<MessageT, Alloc>>(std::make_shared<Alloc>());\n }\n\n \/\/\/ By default, dynamically allocate a new message.\n \/** \\return Shared pointer to the new message. *\/\n virtual std::shared_ptr<MessageT> borrow_message()\n {\n return std::allocate_shared<MessageT, MessageAlloc>(*message_allocator_.get());\n }\n\n virtual std::shared_ptr<rclcpp::SerializedMessage> borrow_serialized_message(size_t capacity)\n {\n return std::make_shared<rclcpp::SerializedMessage>(capacity);\n }\n\n virtual std::shared_ptr<rclcpp::SerializedMessage> borrow_serialized_message()\n {\n return borrow_serialized_message(default_buffer_capacity_);\n }\n\n virtual void set_default_buffer_capacity(size_t capacity)\n {\n default_buffer_capacity_ = capacity;\n }\n\n \/\/\/ Release ownership of the message, which will deallocate it if it has no more owners.\n \/** \\param[in] msg Shared pointer to the message we are returning. *\/\n virtual void return_message(std::shared_ptr<MessageT> & msg)\n {\n msg.reset();\n }\n\n virtual void return_serialized_message(\n std::shared_ptr<rclcpp::SerializedMessage> & serialized_msg)\n {\n serialized_msg.reset();\n }\n\n std::shared_ptr<MessageAlloc> message_allocator_;\n MessageDeleter message_deleter_;\n\n std::shared_ptr<SerializedMessageAlloc> serialized_message_allocator_;\n SerializedMessageDeleter serialized_message_deleter_;\n\n std::shared_ptr<BufferAlloc> buffer_allocator_;\n BufferDeleter buffer_deleter_;\n size_t default_buffer_capacity_ = 0;\n\n rcutils_allocator_t rcutils_allocator_;\n};\n\n} \/\/ namespace message_memory_strategy\n} \/\/ namespace rclcpp\n\n#endif \/\/ RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n<commit_msg>Add serialized_message.hpp header (#1095)<commit_after>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n#define RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n\n#include <memory>\n#include <stdexcept>\n\n#include \"rcl\/types.h\"\n\n#include \"rclcpp\/allocator\/allocator_common.hpp\"\n#include \"rclcpp\/exceptions.hpp\"\n#include \"rclcpp\/macros.hpp\"\n#include \"rclcpp\/serialized_message.hpp\"\n#include \"rclcpp\/visibility_control.hpp\"\n\n#include \"rcutils\/logging_macros.h\"\n\n#include \"rmw\/serialized_message.h\"\n\nnamespace rclcpp\n{\nnamespace message_memory_strategy\n{\n\n\/\/\/ Default allocation strategy for messages received by subscriptions.\n\/** A message memory strategy must be templated on the type of the subscription it belongs to. *\/\ntemplate<typename MessageT, typename Alloc = std::allocator<void>>\nclass MessageMemoryStrategy\n{\npublic:\n RCLCPP_SMART_PTR_DEFINITIONS(MessageMemoryStrategy)\n\n using MessageAllocTraits = allocator::AllocRebind<MessageT, Alloc>;\n using MessageAlloc = typename MessageAllocTraits::allocator_type;\n using MessageDeleter = allocator::Deleter<MessageAlloc, MessageT>;\n\n using SerializedMessageAllocTraits = allocator::AllocRebind<rclcpp::SerializedMessage, Alloc>;\n using SerializedMessageAlloc = typename SerializedMessageAllocTraits::allocator_type;\n using SerializedMessageDeleter =\n allocator::Deleter<SerializedMessageAlloc, rclcpp::SerializedMessage>;\n\n using BufferAllocTraits = allocator::AllocRebind<char, Alloc>;\n using BufferAlloc = typename BufferAllocTraits::allocator_type;\n using BufferDeleter = allocator::Deleter<BufferAlloc, char>;\n\n MessageMemoryStrategy()\n {\n message_allocator_ = std::make_shared<MessageAlloc>();\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>();\n buffer_allocator_ = std::make_shared<BufferAlloc>();\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n explicit MessageMemoryStrategy(std::shared_ptr<Alloc> allocator)\n {\n message_allocator_ = std::make_shared<MessageAlloc>(*allocator.get());\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>(*allocator.get());\n buffer_allocator_ = std::make_shared<BufferAlloc>(*allocator.get());\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n virtual ~MessageMemoryStrategy() = default;\n\n \/\/\/ Default factory method\n static SharedPtr create_default()\n {\n return std::make_shared<MessageMemoryStrategy<MessageT, Alloc>>(std::make_shared<Alloc>());\n }\n\n \/\/\/ By default, dynamically allocate a new message.\n \/** \\return Shared pointer to the new message. *\/\n virtual std::shared_ptr<MessageT> borrow_message()\n {\n return std::allocate_shared<MessageT, MessageAlloc>(*message_allocator_.get());\n }\n\n virtual std::shared_ptr<rclcpp::SerializedMessage> borrow_serialized_message(size_t capacity)\n {\n return std::make_shared<rclcpp::SerializedMessage>(capacity);\n }\n\n virtual std::shared_ptr<rclcpp::SerializedMessage> borrow_serialized_message()\n {\n return borrow_serialized_message(default_buffer_capacity_);\n }\n\n virtual void set_default_buffer_capacity(size_t capacity)\n {\n default_buffer_capacity_ = capacity;\n }\n\n \/\/\/ Release ownership of the message, which will deallocate it if it has no more owners.\n \/** \\param[in] msg Shared pointer to the message we are returning. *\/\n virtual void return_message(std::shared_ptr<MessageT> & msg)\n {\n msg.reset();\n }\n\n virtual void return_serialized_message(\n std::shared_ptr<rclcpp::SerializedMessage> & serialized_msg)\n {\n serialized_msg.reset();\n }\n\n std::shared_ptr<MessageAlloc> message_allocator_;\n MessageDeleter message_deleter_;\n\n std::shared_ptr<SerializedMessageAlloc> serialized_message_allocator_;\n SerializedMessageDeleter serialized_message_deleter_;\n\n std::shared_ptr<BufferAlloc> buffer_allocator_;\n BufferDeleter buffer_deleter_;\n size_t default_buffer_capacity_ = 0;\n\n rcutils_allocator_t rcutils_allocator_;\n};\n\n} \/\/ namespace message_memory_strategy\n} \/\/ namespace rclcpp\n\n#endif \/\/ RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n<|endoftext|>"} {"text":"<commit_before>\n#include \"tests.hpp\"\n\nstruct BufSizePlug : lvtk::Plugin<BufSizePlug, lvtk::BufSize> {\n BufSizePlug (const lvtk::Args& args) : Plugin (args) {}\n};\n\nclass BufSize : public TestFixutre\n{\n CPPUNIT_TEST_SUITE (BufSize);\n CPPUNIT_TEST (buffer_details);\n CPPUNIT_TEST_SUITE_END();\n\npublic:\n void setUp() {\n details.min = 64;\n details.max = 4096;\n details.nominal = 128;\n details.sequence_size = 1024 * 8;\n\n subject = urid.map (\"http:\/\/dummy.subject.org\");\n type = urid.map (\"http:\/\/www.w3.org\/2001\/XMLSchema#nonNegativeInteger\");\n options.add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__minBlockLength),\n sizeof(uint32_t), type,\n &details.min\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__maxBlockLength),\n sizeof(uint32_t), type,\n &details.max\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__nominalBlockLength),\n sizeof(uint32_t), type,\n &details.nominal\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__sequenceSize),\n sizeof(uint32_t), type,\n &details.sequence_size\n );\n\n args.sample_rate = 44100.0;\n args.bundle = \"\/fake\/bundle.lv2\";\n options_feature.URI = LV2_OPTIONS__options;\n options_feature.data = const_cast<lvtk::Option*> (options.c_obj());\n args.features.push_back (options_feature);\n args.features.push_back (*urid.get_map_feature());\n if (details.bounded)\n args.features.push_back (bounded_feature);\n }\n\nprotected:\n void buffer_details() {\n auto plugin = std::unique_ptr<BufSizePlug> (new BufSizePlug (args));\n const auto& pdetails = plugin->buffer_details();\n CPPUNIT_ASSERT_EQUAL (details.min, pdetails.min);\n CPPUNIT_ASSERT_EQUAL (details.max, pdetails.max);\n CPPUNIT_ASSERT_EQUAL (details.nominal, pdetails.nominal);\n CPPUNIT_ASSERT_EQUAL (details.fixed, pdetails.fixed);\n CPPUNIT_ASSERT_EQUAL (details.bounded, pdetails.bounded);\n CPPUNIT_ASSERT_EQUAL (details.power_of_two, pdetails.power_of_two);\n CPPUNIT_ASSERT_EQUAL (details.sequence_size, pdetails.sequence_size);\n }\n\nprivate:\n lvtk::Args args;\n LV2_Feature bounded_feature = { LV2_BUF_SIZE__boundedBlockLength, nullptr };\n LV2_Feature options_feature = { LV2_OPTIONS__options, nullptr };\n lvtk::BufferDetails details;\n lvtk::OptionArray options;\n lvtk::URIDirectory urid;\n uint32_t subject;\n uint32_t type;\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(BufSize);\n<commit_msg>Bounded check<commit_after>\n#include \"tests.hpp\"\n\nstruct BufSizePlug : lvtk::Plugin<BufSizePlug, lvtk::BufSize> {\n BufSizePlug (const lvtk::Args& args) : Plugin (args) {}\n};\n\nclass BufSize : public TestFixutre\n{\n CPPUNIT_TEST_SUITE (BufSize);\n CPPUNIT_TEST (buffer_details);\n CPPUNIT_TEST_SUITE_END();\n\npublic:\n void setUp() {\n details.bounded = true;\n details.min = 64;\n details.max = 4096;\n details.nominal = 128;\n details.sequence_size = 1024 * 8;\n\n subject = urid.map (\"http:\/\/dummy.subject.org\");\n type = urid.map (\"http:\/\/www.w3.org\/2001\/XMLSchema#nonNegativeInteger\");\n options.add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__minBlockLength),\n sizeof(uint32_t), type,\n &details.min\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__maxBlockLength),\n sizeof(uint32_t), type,\n &details.max\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__nominalBlockLength),\n sizeof(uint32_t), type,\n &details.nominal\n ).add (\n LV2_OPTIONS_BLANK, subject,\n urid.map (LV2_BUF_SIZE__sequenceSize),\n sizeof(uint32_t), type,\n &details.sequence_size\n );\n\n args.sample_rate = 44100.0;\n args.bundle = \"\/fake\/bundle.lv2\";\n options_feature.URI = LV2_OPTIONS__options;\n options_feature.data = const_cast<lvtk::Option*> (options.c_obj());\n args.features.push_back (options_feature);\n args.features.push_back (*urid.get_map_feature());\n if (details.bounded)\n args.features.push_back (bounded_feature);\n }\n\nprotected:\n void buffer_details() {\n auto plugin = std::unique_ptr<BufSizePlug> (new BufSizePlug (args));\n const auto& pdetails = plugin->buffer_details();\n CPPUNIT_ASSERT_EQUAL (details.min, pdetails.min);\n CPPUNIT_ASSERT_EQUAL (details.max, pdetails.max);\n CPPUNIT_ASSERT_EQUAL (details.nominal, pdetails.nominal);\n CPPUNIT_ASSERT_EQUAL (details.fixed, pdetails.fixed);\n CPPUNIT_ASSERT_EQUAL (details.bounded, pdetails.bounded);\n CPPUNIT_ASSERT_EQUAL (details.power_of_two, pdetails.power_of_two);\n CPPUNIT_ASSERT_EQUAL (details.sequence_size, pdetails.sequence_size);\n }\n\nprivate:\n lvtk::Args args;\n LV2_Feature bounded_feature = { LV2_BUF_SIZE__boundedBlockLength, nullptr };\n LV2_Feature options_feature = { LV2_OPTIONS__options, nullptr };\n lvtk::BufferDetails details;\n lvtk::OptionArray options;\n lvtk::URIDirectory urid;\n uint32_t subject;\n uint32_t type;\n};\n\nCPPUNIT_TEST_SUITE_REGISTRATION(BufSize);\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2006 - 2007 Volker Krause <vkrause@kde.org>\n Copyright (c) 2010 Michael Jansen <kde@michael-jansen>\n\n This library is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This library is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to the\n Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n 02110-1301, USA.\n*\/\n\n#include \"notificationmanager.h\"\n#include <akdebug.h>\n#include \"notificationmanageradaptor.h\"\n#include \"notificationsource.h\"\n#include \"tracer.h\"\n#include \"storage\/datastore.h\"\n#include \"clientcapabilityaggregator.h\"\n\n#include <akstandarddirs.h>\n#include <libs\/xdgbasedirs_p.h>\n\n#include <QtCore\/QDebug>\n#include <QDBusConnection>\n#include <QSettings>\n\n\nusing namespace Akonadi;\n\nNotificationManager* NotificationManager::mSelf = 0;\n\nNotificationManager::NotificationManager()\n : QObject( 0 )\n{\n NotificationMessage::registerDBusTypes();\n NotificationMessageV2::registerDBusTypes();\n\n new NotificationManagerAdaptor( this );\n QDBusConnection::sessionBus().registerObject( QLatin1String(\"\/notifications\"),\n this, QDBusConnection::ExportAdaptors );\n QDBusConnection::sessionBus().registerObject( QLatin1String(\"\/notifications\/debug\"),\n this, QDBusConnection::ExportScriptableSlots );\n\n const QString serverConfigFile = AkStandardDirs::serverConfigFile( XdgBaseDirs::ReadWrite );\n QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n mTimer.setInterval( settings.value( QLatin1String(\"NotificationManager\/Interval\"), 50 ).toInt() );\n mTimer.setSingleShot( true );\n connect( &mTimer, SIGNAL(timeout()), SLOT(emitPendingNotifications()) );\n}\n\nNotificationManager::~NotificationManager()\n{\n}\n\nNotificationManager* NotificationManager::self()\n{\n if ( !mSelf )\n mSelf = new NotificationManager();\n\n return mSelf;\n}\n\nvoid NotificationManager::connectNotificationCollector(NotificationCollector* collector)\n{\n connect( collector, SIGNAL(notify(Akonadi::NotificationMessageV2::List)),\n SLOT(slotNotify(Akonadi::NotificationMessageV2::List)) );\n}\n\nvoid NotificationManager::slotNotify(const Akonadi::NotificationMessageV2::List &msgs)\n{\n \/\/akDebug() << Q_FUNC_INFO << \"Appending\" << msgs.count() << \"notifications to current list of \" << mNotifications.count() << \"notifications\";\n Q_FOREACH ( const NotificationMessageV2 &msg, msgs )\n NotificationMessageV2::appendAndCompress( mNotifications, msg );\n \/\/akDebug() << Q_FUNC_INFO << \"We have\" << mNotifications.count() << \"notifications queued in total after appendAndCompress()\";\n\n if ( !mTimer.isActive() )\n mTimer.start();\n}\n\nQSet< NotificationSource* > NotificationManager::findInterestedSources( const NotificationMessageV2 &msg )\n{\n QSet<NotificationSource*> sources;\n\n if ( msg.entities().count() == 0 ) {\n return sources;\n }\n\n if ( msg.type() == NotificationMessageV2::InvalidType ) {\n akDebug() << \"Received invalid change notification\";\n return sources;\n }\n\n sources.unite( mAllMonitored );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n sources.unite( mMonitoredResources.values( msg.destinationResource() ).toSet() );\n }\n\n switch ( msg.type() ) {\n case NotificationMessageV2::InvalidType:\n return sources;\n\n case NotificationMessageV2::Items: {\n const QList<NotificationMessageV2::Entity> entities = msg.entities().values();\n if ( !mMonitoredResources.isEmpty() || !mMonitoredMimeTypes.isEmpty() ) {\n QSet<NotificationSource*> srcs;\n srcs.unite( mMonitoredResources.values( msg.resource() ).toSet() );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n srcs.unite( mMonitoredResources.values( msg.destinationResource() ) .toSet() );\n }\n\n if ( !mMonitoredMimeTypes.isEmpty() ) {\n Q_FOREACH ( const NotificationMessageV2::Entity &entity, entities ) {\n srcs.unite( mMonitoredMimeTypes.values( entity.mimeType ).toSet() );\n }\n }\n\n if ( srcs.isEmpty() ) {\n return sources;\n }\n\n sources.unite( srcs );\n\n }\n if ( !mMonitoredItems.isEmpty() ) {\n Q_FOREACH ( const NotificationMessageV2::Entity &entity, entities ) {\n sources.unite( mMonitoredMimeTypes.values( entity.mimeType ).toSet() );\n }\n }\n\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentDestCollection() ) ).toSet() );\n \/\/ If the resource is watching root collection, then it wants to be notified\n \/\/ about all changes in it's subcollections\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( 0 ) ).toSet() );\n\n } break;\n\n case NotificationMessageV2::Collections: {\n const QList<NotificationMessageV2::Id> ids = msg.entities().uniqueKeys();\n if ( !mMonitoredResources.isEmpty() ) {\n sources.unite( mMonitoredResources.values( msg.resource() ).toSet() );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n sources.unite( mMonitoredResources.values( msg.destinationResource() ).toSet() );\n }\n }\n\n if ( !mMonitoredMimeTypes.isEmpty() && !mMonitoredCollections.isEmpty() ) {\n Q_FOREACH ( NotificationMessageV2::Id id, ids ) {\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( id ) ).toSet() );\n }\n\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentDestCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( 0 ) ).toSet() );\n }\n\n } break;\n }\n\n return sources;\n}\n\nvoid NotificationManager::emitPendingNotifications()\n{\n if ( mNotifications.isEmpty() )\n return;\n\n NotificationMessage::List legacyNotifications;\n Q_FOREACH ( const NotificationMessageV2 ¬ification, mNotifications ) {\n Tracer::self()->signal( \"NotificationManager::notify\", notification.toString() );\n\n if ( ClientCapabilityAggregator::minimumNotificationMessageVersion() < 2 ) {\n const NotificationMessage::List tmp = notification.toNotificationV1().toList();\n Q_FOREACH ( const NotificationMessage &legacyNotification, tmp ) {\n bool appended = false;\n NotificationMessage::appendAndCompress( legacyNotifications, legacyNotification, &appended );\n if ( !appended ) {\n legacyNotifications << legacyNotification;\n }\n }\n }\n }\n\n if ( !legacyNotifications.isEmpty() ) {\n Q_FOREACH ( NotificationSource *src, mNotificationSources ) {\n src->emitNotification( legacyNotifications );\n }\n }\n\n\n if ( ClientCapabilityAggregator::maximumNotificationMessageVersion() > 1 ) {\n Q_FOREACH ( NotificationSource *source, mClientSideMonitoredSources ) {\n source->emitNotification( mNotifications );\n }\n\n Q_FOREACH ( const NotificationMessageV2 ¬ification, mNotifications ) {\n\n QSet<NotificationSource*> sources = findInterestedSources( notification );\n\n QList<NotificationSource*> ignoredSources = mIgnoredSessions.values( notification.sessionId() );\n Q_FOREACH ( NotificationSource *source, sources ) {\n if ( !ignoredSources.contains( source ) ) {\n source->emitNotification( NotificationMessageV2::List() << notification );\n }\n }\n }\n }\n\n \/\/ backward compatibility with the old non-subcription interface\n \/\/ FIXME: Can we drop this already?\n if ( !legacyNotifications.isEmpty() )\n Q_EMIT notify( legacyNotifications );\n\n mNotifications.clear();\n}\n\n\n\nQDBusObjectPath NotificationManager::subscribeV2( const QString &identifier, bool serverSideMonitor )\n{\n akDebug() << Q_FUNC_INFO << this << identifier << serverSideMonitor;\n\n NotificationSource *source = mNotificationSources.value( identifier );\n if ( source ) {\n akDebug() << \"Known subscriber\" << identifier << \"subscribes again\";\n source->addClientServiceName( message().service() );\n } else {\n source = new NotificationSource( identifier, message().service(), this );\n }\n\n registerSource( source, serverSideMonitor );\n\n Q_EMIT subscribed( identifier );\n\n return source->dbusPath();\n}\n\nvoid NotificationManager::registerSource( NotificationSource* source,\n bool serverSideMonitor )\n{\n mNotificationSources.insert( source->identifier(), source );\n if ( !serverSideMonitor && !mClientSideMonitoredSources.contains( source ) ) {\n mClientSideMonitoredSources.insert( source );\n }\n}\n\n\nQDBusObjectPath NotificationManager::subscribe( const QString &identifier )\n{\n akDebug() << Q_FUNC_INFO << this << identifier;\n return subscribeV2( identifier, false );\n}\n\nvoid NotificationManager::unsubscribe( const QString &identifier )\n{\n NotificationSource *source = mNotificationSources.value( identifier );\n if ( source ) {\n unregisterSource( source );\n source->deleteLater();\n Q_EMIT unsubscribed( identifier );\n } else {\n akDebug() << \"Attempt to unsubscribe unknown subscriber\" << identifier;\n }\n}\n\nvoid NotificationManager::unregisterSource( NotificationSource *source )\n{\n mNotificationSources.remove( source->identifier() );\n mClientSideMonitoredSources.remove( source );\n mAllMonitored.remove( source );\n Q_FOREACH ( const QByteArray &key, mIgnoredSessions.keys( source ) ) {\n mIgnoredSessions.remove( key, source );\n }\n Q_FOREACH ( const QByteArray &resource, mMonitoredResources.keys( source ) ) {\n mMonitoredResources.remove( resource, source );\n }\n Q_FOREACH ( const QString &mimeType, mMonitoredMimeTypes.keys( source ) ) {\n mMonitoredMimeTypes.remove( mimeType, source );\n }\n Q_FOREACH ( Entity::Id id, mMonitoredItems.keys( source ) ) {\n mMonitoredItems.remove( id, source );\n }\n Q_FOREACH ( Entity::Id id, mMonitoredCollections.keys( source ) ) {\n mMonitoredCollections.remove( id, source );\n }\n}\n\n\nQStringList NotificationManager::subscribers() const\n{\n QStringList identifiers;\n Q_FOREACH ( NotificationSource *source, mNotificationSources ) {\n identifiers << source->identifier();\n }\n\n return identifiers;\n}\n\n\n<commit_msg>Fix a bug in Collection notifications filtering<commit_after>\/*\n Copyright (c) 2006 - 2007 Volker Krause <vkrause@kde.org>\n Copyright (c) 2010 Michael Jansen <kde@michael-jansen>\n\n This library is free software; you can redistribute it and\/or modify it\n under the terms of the GNU Library General Public License as published by\n the Free Software Foundation; either version 2 of the License, or (at your\n option) any later version.\n\n This library is distributed in the hope that it will be useful, but WITHOUT\n ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public\n License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to the\n Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\n 02110-1301, USA.\n*\/\n\n#include \"notificationmanager.h\"\n#include <akdebug.h>\n#include \"notificationmanageradaptor.h\"\n#include \"notificationsource.h\"\n#include \"tracer.h\"\n#include \"storage\/datastore.h\"\n#include \"clientcapabilityaggregator.h\"\n\n#include <akstandarddirs.h>\n#include <libs\/xdgbasedirs_p.h>\n\n#include <QtCore\/QDebug>\n#include <QDBusConnection>\n#include <QSettings>\n\n\nusing namespace Akonadi;\n\nNotificationManager* NotificationManager::mSelf = 0;\n\nNotificationManager::NotificationManager()\n : QObject( 0 )\n{\n NotificationMessage::registerDBusTypes();\n NotificationMessageV2::registerDBusTypes();\n\n new NotificationManagerAdaptor( this );\n QDBusConnection::sessionBus().registerObject( QLatin1String(\"\/notifications\"),\n this, QDBusConnection::ExportAdaptors );\n QDBusConnection::sessionBus().registerObject( QLatin1String(\"\/notifications\/debug\"),\n this, QDBusConnection::ExportScriptableSlots );\n\n const QString serverConfigFile = AkStandardDirs::serverConfigFile( XdgBaseDirs::ReadWrite );\n QSettings settings( serverConfigFile, QSettings::IniFormat );\n\n mTimer.setInterval( settings.value( QLatin1String(\"NotificationManager\/Interval\"), 50 ).toInt() );\n mTimer.setSingleShot( true );\n connect( &mTimer, SIGNAL(timeout()), SLOT(emitPendingNotifications()) );\n}\n\nNotificationManager::~NotificationManager()\n{\n}\n\nNotificationManager* NotificationManager::self()\n{\n if ( !mSelf )\n mSelf = new NotificationManager();\n\n return mSelf;\n}\n\nvoid NotificationManager::connectNotificationCollector(NotificationCollector* collector)\n{\n connect( collector, SIGNAL(notify(Akonadi::NotificationMessageV2::List)),\n SLOT(slotNotify(Akonadi::NotificationMessageV2::List)) );\n}\n\nvoid NotificationManager::slotNotify(const Akonadi::NotificationMessageV2::List &msgs)\n{\n \/\/akDebug() << Q_FUNC_INFO << \"Appending\" << msgs.count() << \"notifications to current list of \" << mNotifications.count() << \"notifications\";\n Q_FOREACH ( const NotificationMessageV2 &msg, msgs )\n NotificationMessageV2::appendAndCompress( mNotifications, msg );\n \/\/akDebug() << Q_FUNC_INFO << \"We have\" << mNotifications.count() << \"notifications queued in total after appendAndCompress()\";\n\n if ( !mTimer.isActive() )\n mTimer.start();\n}\n\nQSet< NotificationSource* > NotificationManager::findInterestedSources( const NotificationMessageV2 &msg )\n{\n QSet<NotificationSource*> sources;\n\n if ( msg.entities().count() == 0 ) {\n return sources;\n }\n\n if ( msg.type() == NotificationMessageV2::InvalidType ) {\n akDebug() << \"Received invalid change notification\";\n return sources;\n }\n\n sources.unite( mAllMonitored );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n sources.unite( mMonitoredResources.values( msg.destinationResource() ).toSet() );\n }\n\n switch ( msg.type() ) {\n case NotificationMessageV2::InvalidType:\n return sources;\n\n case NotificationMessageV2::Items: {\n const QList<NotificationMessageV2::Entity> entities = msg.entities().values();\n if ( !mMonitoredResources.isEmpty() || !mMonitoredMimeTypes.isEmpty() ) {\n QSet<NotificationSource*> srcs;\n srcs.unite( mMonitoredResources.values( msg.resource() ).toSet() );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n srcs.unite( mMonitoredResources.values( msg.destinationResource() ) .toSet() );\n }\n\n if ( !mMonitoredMimeTypes.isEmpty() ) {\n Q_FOREACH ( const NotificationMessageV2::Entity &entity, entities ) {\n srcs.unite( mMonitoredMimeTypes.values( entity.mimeType ).toSet() );\n }\n }\n\n if ( srcs.isEmpty() ) {\n return sources;\n }\n\n sources.unite( srcs );\n\n }\n if ( !mMonitoredItems.isEmpty() ) {\n Q_FOREACH ( const NotificationMessageV2::Entity &entity, entities ) {\n sources.unite( mMonitoredMimeTypes.values( entity.mimeType ).toSet() );\n }\n }\n\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentDestCollection() ) ).toSet() );\n \/\/ If the resource is watching root collection, then it wants to be notified\n \/\/ about all changes in it's subcollections\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( 0 ) ).toSet() );\n\n } break;\n\n case NotificationMessageV2::Collections: {\n const QList<NotificationMessageV2::Id> ids = msg.entities().uniqueKeys();\n if ( !mMonitoredResources.isEmpty() ) {\n sources.unite( mMonitoredResources.values( msg.resource() ).toSet() );\n if ( msg.operation() == NotificationMessageV2::Move ) {\n sources.unite( mMonitoredResources.values( msg.destinationResource() ).toSet() );\n }\n }\n\n if ( !mMonitoredCollections.isEmpty() ) {\n Q_FOREACH ( NotificationMessageV2::Id id, ids ) {\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( id ) ).toSet() );\n }\n\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( msg.parentDestCollection() ) ).toSet() );\n sources.unite( mMonitoredCollections.values( static_cast<Entity::Id>( 0 ) ).toSet() );\n }\n\n } break;\n }\n\n return sources;\n}\n\nvoid NotificationManager::emitPendingNotifications()\n{\n if ( mNotifications.isEmpty() )\n return;\n\n NotificationMessage::List legacyNotifications;\n Q_FOREACH ( const NotificationMessageV2 ¬ification, mNotifications ) {\n Tracer::self()->signal( \"NotificationManager::notify\", notification.toString() );\n\n if ( ClientCapabilityAggregator::minimumNotificationMessageVersion() < 2 ) {\n const NotificationMessage::List tmp = notification.toNotificationV1().toList();\n Q_FOREACH ( const NotificationMessage &legacyNotification, tmp ) {\n bool appended = false;\n NotificationMessage::appendAndCompress( legacyNotifications, legacyNotification, &appended );\n if ( !appended ) {\n legacyNotifications << legacyNotification;\n }\n }\n }\n }\n\n if ( !legacyNotifications.isEmpty() ) {\n Q_FOREACH ( NotificationSource *src, mNotificationSources ) {\n src->emitNotification( legacyNotifications );\n }\n }\n\n\n if ( ClientCapabilityAggregator::maximumNotificationMessageVersion() > 1 ) {\n Q_FOREACH ( NotificationSource *source, mClientSideMonitoredSources ) {\n source->emitNotification( mNotifications );\n }\n\n Q_FOREACH ( const NotificationMessageV2 ¬ification, mNotifications ) {\n\n QSet<NotificationSource*> sources = findInterestedSources( notification );\n\n QList<NotificationSource*> ignoredSources = mIgnoredSessions.values( notification.sessionId() );\n Q_FOREACH ( NotificationSource *source, sources ) {\n if ( !ignoredSources.contains( source ) ) {\n source->emitNotification( NotificationMessageV2::List() << notification );\n }\n }\n }\n }\n\n \/\/ backward compatibility with the old non-subcription interface\n \/\/ FIXME: Can we drop this already?\n if ( !legacyNotifications.isEmpty() )\n Q_EMIT notify( legacyNotifications );\n\n mNotifications.clear();\n}\n\n\n\nQDBusObjectPath NotificationManager::subscribeV2( const QString &identifier, bool serverSideMonitor )\n{\n akDebug() << Q_FUNC_INFO << this << identifier << serverSideMonitor;\n\n NotificationSource *source = mNotificationSources.value( identifier );\n if ( source ) {\n akDebug() << \"Known subscriber\" << identifier << \"subscribes again\";\n source->addClientServiceName( message().service() );\n } else {\n source = new NotificationSource( identifier, message().service(), this );\n }\n\n registerSource( source, serverSideMonitor );\n\n Q_EMIT subscribed( identifier );\n\n return source->dbusPath();\n}\n\nvoid NotificationManager::registerSource( NotificationSource* source,\n bool serverSideMonitor )\n{\n mNotificationSources.insert( source->identifier(), source );\n if ( !serverSideMonitor && !mClientSideMonitoredSources.contains( source ) ) {\n mClientSideMonitoredSources.insert( source );\n }\n}\n\n\nQDBusObjectPath NotificationManager::subscribe( const QString &identifier )\n{\n akDebug() << Q_FUNC_INFO << this << identifier;\n return subscribeV2( identifier, false );\n}\n\nvoid NotificationManager::unsubscribe( const QString &identifier )\n{\n NotificationSource *source = mNotificationSources.value( identifier );\n if ( source ) {\n unregisterSource( source );\n source->deleteLater();\n Q_EMIT unsubscribed( identifier );\n } else {\n akDebug() << \"Attempt to unsubscribe unknown subscriber\" << identifier;\n }\n}\n\nvoid NotificationManager::unregisterSource( NotificationSource *source )\n{\n mNotificationSources.remove( source->identifier() );\n mClientSideMonitoredSources.remove( source );\n mAllMonitored.remove( source );\n Q_FOREACH ( const QByteArray &key, mIgnoredSessions.keys( source ) ) {\n mIgnoredSessions.remove( key, source );\n }\n Q_FOREACH ( const QByteArray &resource, mMonitoredResources.keys( source ) ) {\n mMonitoredResources.remove( resource, source );\n }\n Q_FOREACH ( const QString &mimeType, mMonitoredMimeTypes.keys( source ) ) {\n mMonitoredMimeTypes.remove( mimeType, source );\n }\n Q_FOREACH ( Entity::Id id, mMonitoredItems.keys( source ) ) {\n mMonitoredItems.remove( id, source );\n }\n Q_FOREACH ( Entity::Id id, mMonitoredCollections.keys( source ) ) {\n mMonitoredCollections.remove( id, source );\n }\n}\n\n\nQStringList NotificationManager::subscribers() const\n{\n QStringList identifiers;\n Q_FOREACH ( NotificationSource *source, mNotificationSources ) {\n identifiers << source->identifier();\n }\n\n return identifiers;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"util\/common.hpp\"\n#include \"engine.hpp\"\n#include \"window.hpp\"\n#include \"app.hpp\"\n#include \"plugin.hpp\"\n#include \"settings.hpp\"\n#include \"asset.hpp\"\n#include \"bridge.hpp\"\n#include \"midi.hpp\"\n#include \"rtmidi.hpp\"\n#include \"keyboard.hpp\"\n#include \"gamepad.hpp\"\n#include \"util\/color.hpp\"\n\n#include \"osdialog.h\"\n#include <unistd.h>\n\n\nusing namespace rack;\n\n\nint main(int argc, char* argv[]) {\n\tbool devMode = false;\n\tstd::string patchFile;\n\n\t\/\/ Parse command line arguments\n\tint c;\n\topterr = 0;\n\twhile ((c = getopt(argc, argv, \"dg:l:\")) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'd': {\n\t\t\t\tdevMode = true;\n\t\t\t} break;\n\t\t\tcase 'g': {\n\t\t\t\tassetGlobalDir = optarg;\n\t\t\t} break;\n\t\t\tcase 'l': {\n\t\t\t\tassetLocalDir = optarg;\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n\tif (optind < argc) {\n\t\tpatchFile = argv[optind];\n\t}\n\n\t\/\/ Initialize environment\n\trandomInit();\n\tassetInit(devMode);\n\tloggerInit(devMode);\n\n\t\/\/ Log environment\n\tinfo(\"%s %s\", gApplicationName.c_str(), gApplicationVersion.c_str());\n\tif (devMode)\n\t\tinfo(\"Development mode\");\n\tinfo(\"Global directory: %s\", assetGlobal(\"\").c_str());\n\tinfo(\"Local directory: %s\", assetLocal(\"\").c_str());\n\n\t\/\/ Initialize app\n\tpluginInit(devMode);\n\tengineInit();\n\trtmidiInit();\n\tbridgeInit();\n\tkeyboardInit();\n\tgamepadInit();\n\twindowInit();\n\tappInit(devMode);\n\tsettingsLoad(assetLocal(\"settings.json\"));\n\n\tif (patchFile.empty()) {\n\t\t\/\/ To prevent launch crashes, if Rack crashes between now and 15 seconds from now, the \"skipAutosaveOnLaunch\" property will remain in settings.json, so that in the next launch, the broken autosave will not be loaded.\n\t\tbool oldSkipAutosaveOnLaunch = gSkipAutosaveOnLaunch;\n\t\tgSkipAutosaveOnLaunch = true;\n\t\tsettingsSave(assetLocal(\"settings.json\"));\n\t\tgSkipAutosaveOnLaunch = false;\n\t\tif (oldSkipAutosaveOnLaunch && osdialog_message(OSDIALOG_INFO, OSDIALOG_YES_NO, \"Rack has recovered from a crash, possibly caused by a faulty module in your patch. Clear your patch and start over?\")) {\n\t\t\tgRackWidget->lastPath = \"\";\n\t\t}\n\t\telse {\n\t\t\t\/\/ Load autosave\n\t\t\tstd::string oldLastPath = gRackWidget->lastPath;\n\t\t\tgRackWidget->load(assetLocal(\"autosave.vcv\"));\n\t\t\tgRackWidget->lastPath = oldLastPath;\n\t\t}\n\t}\n\telse {\n\t\t\/\/ Load patch\n\t\tgRackWidget->load(patchFile);\n\t}\n\n\tengineStart();\n\twindowRun();\n\tengineStop();\n\n\t\/\/ Destroy namespaces\n\tgRackWidget->save(assetLocal(\"autosave.vcv\"));\n\tsettingsSave(assetLocal(\"settings.json\"));\n\tappDestroy();\n\twindowDestroy();\n\tbridgeDestroy();\n\tengineDestroy();\n\tmidiDestroy();\n\tpluginDestroy();\n\tloggerDestroy();\n\n\treturn 0;\n}\n<commit_msg>Prevent multiple Rack instances on Windows<commit_after>#include \"util\/common.hpp\"\n#include \"engine.hpp\"\n#include \"window.hpp\"\n#include \"app.hpp\"\n#include \"plugin.hpp\"\n#include \"settings.hpp\"\n#include \"asset.hpp\"\n#include \"bridge.hpp\"\n#include \"midi.hpp\"\n#include \"rtmidi.hpp\"\n#include \"keyboard.hpp\"\n#include \"gamepad.hpp\"\n#include \"util\/color.hpp\"\n\n#include \"osdialog.h\"\n#include <unistd.h>\n\n#ifdef ARCH_WIN\n\t#include <Windows.h>\n#endif\n\nusing namespace rack;\n\n\nint main(int argc, char* argv[]) {\n\tbool devMode = false;\n\tstd::string patchFile;\n\n\t\/\/ Parse command line arguments\n\tint c;\n\topterr = 0;\n\twhile ((c = getopt(argc, argv, \"dg:l:\")) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'd': {\n\t\t\t\tdevMode = true;\n\t\t\t} break;\n\t\t\tcase 'g': {\n\t\t\t\tassetGlobalDir = optarg;\n\t\t\t} break;\n\t\t\tcase 'l': {\n\t\t\t\tassetLocalDir = optarg;\n\t\t\t} break;\n\t\t\tdefault: break;\n\t\t}\n\t}\n\tif (optind < argc) {\n\t\tpatchFile = argv[optind];\n\t}\n\n#ifdef ARCH_WIN\n\t\/\/ Windows global mutex to prevent multiple instances\n\t\/\/ Handle will be closed by Windows when the process ends\n\tHANDLE instanceMutex = CreateMutex(NULL, true, gApplicationName.c_str());\n\tif (GetLastError() == ERROR_ALREADY_EXISTS) {\n\t\tosdialog_message(OSDIALOG_ERROR, OSDIALOG_OK, \"Rack is already running. Multiple Rack instances are not supported.\");\n\t\texit(1);\n\t}\n\t(void) instanceMutex;\n#endif\n\n\t\/\/ Initialize environment\n\trandomInit();\n\tassetInit(devMode);\n\tloggerInit(devMode);\n\n\t\/\/ Log environment\n\tinfo(\"%s %s\", gApplicationName.c_str(), gApplicationVersion.c_str());\n\tif (devMode)\n\t\tinfo(\"Development mode\");\n\tinfo(\"Global directory: %s\", assetGlobal(\"\").c_str());\n\tinfo(\"Local directory: %s\", assetLocal(\"\").c_str());\n\n\t\/\/ Initialize app\n\tpluginInit(devMode);\n\tengineInit();\n\trtmidiInit();\n\tbridgeInit();\n\tkeyboardInit();\n\tgamepadInit();\n\twindowInit();\n\tappInit(devMode);\n\tsettingsLoad(assetLocal(\"settings.json\"));\n\n\tif (patchFile.empty()) {\n\t\t\/\/ To prevent launch crashes, if Rack crashes between now and 15 seconds from now, the \"skipAutosaveOnLaunch\" property will remain in settings.json, so that in the next launch, the broken autosave will not be loaded.\n\t\tbool oldSkipAutosaveOnLaunch = gSkipAutosaveOnLaunch;\n\t\tgSkipAutosaveOnLaunch = true;\n\t\tsettingsSave(assetLocal(\"settings.json\"));\n\t\tgSkipAutosaveOnLaunch = false;\n\t\tif (oldSkipAutosaveOnLaunch && osdialog_message(OSDIALOG_INFO, OSDIALOG_YES_NO, \"Rack has recovered from a crash, possibly caused by a faulty module in your patch. Clear your patch and start over?\")) {\n\t\t\tgRackWidget->lastPath = \"\";\n\t\t}\n\t\telse {\n\t\t\t\/\/ Load autosave\n\t\t\tstd::string oldLastPath = gRackWidget->lastPath;\n\t\t\tgRackWidget->load(assetLocal(\"autosave.vcv\"));\n\t\t\tgRackWidget->lastPath = oldLastPath;\n\t\t}\n\t}\n\telse {\n\t\t\/\/ Load patch\n\t\tgRackWidget->load(patchFile);\n\t}\n\n\tengineStart();\n\twindowRun();\n\tengineStop();\n\n\t\/\/ Destroy namespaces\n\tgRackWidget->save(assetLocal(\"autosave.vcv\"));\n\tsettingsSave(assetLocal(\"settings.json\"));\n\tappDestroy();\n\twindowDestroy();\n\tbridgeDestroy();\n\tengineDestroy();\n\tmidiDestroy();\n\tpluginDestroy();\n\tloggerDestroy();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <signal.h>\n#include <sys\/resource.h>\n\n#include \"bpforc.h\"\n#include \"bpftrace.h\"\n#include \"clang_parser.h\"\n#include \"codegen_llvm.h\"\n#include \"driver.h\"\n#include \"list.h\"\n#include \"printer.h\"\n#include \"semantic_analyser.h\"\n#include \"tracepoint_format_parser.h\"\n\nusing namespace bpftrace;\n\nvoid usage()\n{\n std::cerr << \"USAGE:\" << std::endl;\n std::cerr << \" bpftrace [options] filename\" << std::endl;\n std::cerr << \" bpftrace [options] -e 'program'\" << std::endl << std::endl;\n std::cerr << \"OPTIONS:\" << std::endl;\n std::cerr << \" -d debug info dry run\" << std::endl;\n std::cerr << \" -dd verbose debug info dry run\" << std::endl;\n std::cerr << \" -e 'program' execute this program\" << std::endl;\n std::cerr << \" -h show this help message\" << std::endl;\n std::cerr << \" -l [search] list probes\" << std::endl;\n std::cerr << \" -p PID PID for enabling USDT probes\" << std::endl;\n std::cerr << \" -v verbose messages\" << std::endl << std::endl;\n std::cerr << \"EXAMPLES:\" << std::endl;\n std::cerr << \"bpftrace -l '*sleep*'\" << std::endl;\n std::cerr << \" list probes containing \\\"sleep\\\"\" << std::endl;\n std::cerr << \"bpftrace -e 'kprobe:do_nanosleep { printf(\\\"PID %d sleeping...\\\\n\\\", pid); }'\" << std::endl;\n std::cerr << \" trace processes calling sleep\" << std::endl;\n std::cerr << \"bpftrace -e 'tracepoint:raw_syscalls:sys_enter { @[comm] = count(); }'\" << std::endl;\n std::cerr << \" count syscalls by process name\" << std::endl;\n}\n\nstatic void enforce_infinite_rlimit() {\n struct rlimit rl = {};\n if (getrlimit(RLIMIT_MEMLOCK, &rl) != 0) {\n std::cerr << \"Warning: couldn't set RLIMIT for bpftrace. \" <<\n \"If your program is not loading, you can try \" <<\n \"\\\"ulimit -l 8192\\\" to fix the problem\" << std::endl;\n return;\n }\n rl.rlim_max = RLIM_INFINITY;\n rl.rlim_cur = rl.rlim_max;\n if (setrlimit(RLIMIT_MEMLOCK, &rl) != 0)\n std::cerr << \"Warning: couldn't set RLIMIT for bpftrace. \" <<\n \"If your program is not loading, you can try \" <<\n \"\\\"ulimit -l 8192\\\" to fix the problem\" << std::endl;\n}\n\nint main(int argc, char *argv[])\n{\n int err;\n Driver driver;\n char *pid_str = NULL;\n bool listing = false;\n\n std::string script, search;\n int c;\n while ((c = getopt(argc, argv, \"de:hlp:v\")) != -1)\n {\n switch (c)\n {\n case 'd':\n bt_debug++;\n if (bt_debug == DebugLevel::kNone) {\n usage();\n return 1;\n }\n break;\n case 'v':\n bt_verbose = true;\n break;\n case 'e':\n script = optarg;\n break;\n case 'p':\n pid_str = optarg;\n break;\n case 'l':\n listing = true;\n break;\n default:\n usage();\n return 1;\n }\n }\n\n if (bt_verbose && (bt_debug != DebugLevel::kNone))\n {\n \/\/ TODO: allow both\n std::cerr << \"USAGE: Use either -v or -d.\" << std::endl;\n return 1;\n }\n\n \/\/ Listing probes\n if (listing)\n {\n if (optind == argc-1)\n list_probes(argv[optind]);\n else if (optind == argc)\n list_probes();\n else\n {\n usage();\n }\n return 0;\n }\n\n if (script.empty())\n {\n \/\/ There should only be 1 non-option argument (the script file)\n if (optind != argc-1)\n {\n usage();\n return 1;\n }\n char *file_name = argv[optind];\n err = driver.parse_file(file_name);\n }\n else\n {\n \/\/ Script is provided as a command line argument\n if (optind != argc)\n {\n usage();\n return 1;\n }\n err = driver.parse_str(script);\n }\n\n if (err)\n return err;\n\n \/\/ FIXME (mmarchini): maybe we don't want to always enforce an infinite\n \/\/ rlimit?\n enforce_infinite_rlimit();\n\n BPFtrace bpftrace;\n\n \/\/ defaults\n bpftrace.join_argnum_ = 16;\n bpftrace.join_argsize_ = 1024;\n\n \/\/ PID is currently only used for USDT probes that need enabling. Future work:\n \/\/ - make PID a filter for all probe types: pass to perf_event_open(), etc.\n \/\/ - provide PID in USDT probe specification as a way to override -p.\n bpftrace.pid_ = 0;\n if (pid_str)\n bpftrace.pid_ = atoi(pid_str);\n\n TracepointFormatParser::parse(driver.root_);\n\n if (bt_debug != DebugLevel::kNone)\n {\n ast::Printer p(std::cout);\n driver.root_->accept(p);\n std::cout << std::endl;\n }\n\n ClangParser clang;\n clang.parse(driver.root_, bpftrace.structs_);\n\n ast::SemanticAnalyser semantics(driver.root_, bpftrace);\n err = semantics.analyse();\n if (err)\n return err;\n\n err = semantics.create_maps(bt_debug != DebugLevel::kNone);\n if (err)\n return err;\n\n ast::CodegenLLVM llvm(driver.root_, bpftrace);\n auto bpforc = llvm.compile(bt_debug);\n\n if (bt_debug != DebugLevel::kNone)\n return 0;\n\n \/\/ Empty signal handler for cleanly terminating the program\n struct sigaction act = {};\n act.sa_handler = [](int) { };\n sigaction(SIGINT, &act, NULL);\n\n int num_probes = bpftrace.num_probes();\n if (num_probes == 0)\n {\n std::cout << \"No probes to attach\" << std::endl;\n return 1;\n }\n else if (num_probes == 1)\n std::cout << \"Attaching \" << bpftrace.num_probes() << \" probe...\" << std::endl;\n else\n std::cout << \"Attaching \" << bpftrace.num_probes() << \" probes...\" << std::endl;\n\n err = bpftrace.run(move(bpforc));\n if (err)\n return err;\n\n std::cout << \"\\n\\n\";\n\n err = bpftrace.print_maps();\n if (err)\n return err;\n\n return 0;\n}\n<commit_msg>fixes: https:\/\/github.com\/iovisor\/bpftrace\/issues\/293<commit_after>#include <iostream>\n#include <signal.h>\n#include <sys\/resource.h>\n#include <unistd.h>\n\n#include \"bpforc.h\"\n#include \"bpftrace.h\"\n#include \"clang_parser.h\"\n#include \"codegen_llvm.h\"\n#include \"driver.h\"\n#include \"list.h\"\n#include \"printer.h\"\n#include \"semantic_analyser.h\"\n#include \"tracepoint_format_parser.h\"\n\nusing namespace bpftrace;\n\nvoid usage()\n{\n std::cerr << \"USAGE:\" << std::endl;\n std::cerr << \" bpftrace [options] filename\" << std::endl;\n std::cerr << \" bpftrace [options] -e 'program'\" << std::endl << std::endl;\n std::cerr << \"OPTIONS:\" << std::endl;\n std::cerr << \" -d debug info dry run\" << std::endl;\n std::cerr << \" -dd verbose debug info dry run\" << std::endl;\n std::cerr << \" -e 'program' execute this program\" << std::endl;\n std::cerr << \" -h show this help message\" << std::endl;\n std::cerr << \" -l [search] list probes\" << std::endl;\n std::cerr << \" -p PID PID for enabling USDT probes\" << std::endl;\n std::cerr << \" -v verbose messages\" << std::endl << std::endl;\n std::cerr << \"EXAMPLES:\" << std::endl;\n std::cerr << \"bpftrace -l '*sleep*'\" << std::endl;\n std::cerr << \" list probes containing \\\"sleep\\\"\" << std::endl;\n std::cerr << \"bpftrace -e 'kprobe:do_nanosleep { printf(\\\"PID %d sleeping...\\\\n\\\", pid); }'\" << std::endl;\n std::cerr << \" trace processes calling sleep\" << std::endl;\n std::cerr << \"bpftrace -e 'tracepoint:raw_syscalls:sys_enter { @[comm] = count(); }'\" << std::endl;\n std::cerr << \" count syscalls by process name\" << std::endl;\n}\n\nstatic void enforce_infinite_rlimit() {\n struct rlimit rl = {};\n if (getrlimit(RLIMIT_MEMLOCK, &rl) != 0) {\n std::cerr << \"Warning: couldn't set RLIMIT for bpftrace. \" <<\n \"If your program is not loading, you can try \" <<\n \"\\\"ulimit -l 8192\\\" to fix the problem\" << std::endl;\n return;\n }\n rl.rlim_max = RLIM_INFINITY;\n rl.rlim_cur = rl.rlim_max;\n if (setrlimit(RLIMIT_MEMLOCK, &rl) != 0)\n std::cerr << \"Warning: couldn't set RLIMIT for bpftrace. \" <<\n \"If your program is not loading, you can try \" <<\n \"\\\"ulimit -l 8192\\\" to fix the problem\" << std::endl;\n}\n\nint main(int argc, char *argv[])\n{\n if (geteuid() != 0)\n {\n std::cerr << \"ERROR: bpftrace currently only supports running as the root user.\" << std::endl;\n exit(0);\n }\n\n int err;\n Driver driver;\n char *pid_str = NULL;\n bool listing = false;\n\n std::string script, search;\n int c;\n while ((c = getopt(argc, argv, \"de:hlp:v\")) != -1)\n {\n switch (c)\n {\n case 'd':\n bt_debug++;\n if (bt_debug == DebugLevel::kNone) {\n usage();\n return 1;\n }\n break;\n case 'v':\n bt_verbose = true;\n break;\n case 'e':\n script = optarg;\n break;\n case 'p':\n pid_str = optarg;\n break;\n case 'l':\n listing = true;\n break;\n default:\n usage();\n return 1;\n }\n }\n\n if (bt_verbose && (bt_debug != DebugLevel::kNone))\n {\n \/\/ TODO: allow both\n std::cerr << \"USAGE: Use either -v or -d.\" << std::endl;\n return 1;\n }\n\n \/\/ Listing probes\n if (listing)\n {\n if (optind == argc-1)\n list_probes(argv[optind]);\n else if (optind == argc)\n list_probes();\n else\n {\n usage();\n }\n return 0;\n }\n\n if (script.empty())\n {\n \/\/ There should only be 1 non-option argument (the script file)\n if (optind != argc-1)\n {\n usage();\n return 1;\n }\n char *file_name = argv[optind];\n err = driver.parse_file(file_name);\n }\n else\n {\n \/\/ Script is provided as a command line argument\n if (optind != argc)\n {\n usage();\n return 1;\n }\n err = driver.parse_str(script);\n }\n\n if (err)\n return err;\n\n \/\/ FIXME (mmarchini): maybe we don't want to always enforce an infinite\n \/\/ rlimit?\n enforce_infinite_rlimit();\n\n BPFtrace bpftrace;\n\n \/\/ defaults\n bpftrace.join_argnum_ = 16;\n bpftrace.join_argsize_ = 1024;\n\n \/\/ PID is currently only used for USDT probes that need enabling. Future work:\n \/\/ - make PID a filter for all probe types: pass to perf_event_open(), etc.\n \/\/ - provide PID in USDT probe specification as a way to override -p.\n bpftrace.pid_ = 0;\n if (pid_str)\n bpftrace.pid_ = atoi(pid_str);\n\n TracepointFormatParser::parse(driver.root_);\n\n if (bt_debug != DebugLevel::kNone)\n {\n ast::Printer p(std::cout);\n driver.root_->accept(p);\n std::cout << std::endl;\n }\n\n ClangParser clang;\n clang.parse(driver.root_, bpftrace.structs_);\n\n ast::SemanticAnalyser semantics(driver.root_, bpftrace);\n err = semantics.analyse();\n if (err)\n return err;\n\n err = semantics.create_maps(bt_debug != DebugLevel::kNone);\n if (err)\n return err;\n\n ast::CodegenLLVM llvm(driver.root_, bpftrace);\n auto bpforc = llvm.compile(bt_debug);\n\n if (bt_debug != DebugLevel::kNone)\n return 0;\n\n \/\/ Empty signal handler for cleanly terminating the program\n struct sigaction act = {};\n act.sa_handler = [](int) { };\n sigaction(SIGINT, &act, NULL);\n\n int num_probes = bpftrace.num_probes();\n if (num_probes == 0)\n {\n std::cout << \"No probes to attach\" << std::endl;\n return 1;\n }\n else if (num_probes == 1)\n std::cout << \"Attaching \" << bpftrace.num_probes() << \" probe...\" << std::endl;\n else\n std::cout << \"Attaching \" << bpftrace.num_probes() << \" probes...\" << std::endl;\n\n err = bpftrace.run(move(bpforc));\n if (err)\n return err;\n\n std::cout << \"\\n\\n\";\n\n err = bpftrace.print_maps();\n if (err)\n return err;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: commitlistener.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2004-11-09 15:37:24 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"commitlistener.hxx\"\n\nusing namespace ::com::sun::star;\n\nOChildCommitListen_Impl::OChildCommitListen_Impl( SfxBaseModel& aModel )\n: m_pModel( &aModel )\n{}\n\nOChildCommitListen_Impl::~OChildCommitListen_Impl()\n{}\n\nvoid OChildCommitListen_Impl::OwnerIsDisposed()\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n m_pModel = NULL;\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::preCommit( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::Exception, ::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::commited( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::RuntimeException)\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n \/\/ StorageIsModified_Impl must not contain any locking!\n if ( m_pModel )\n m_pModel->StorageIsModified_Impl();\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::preRevert( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::Exception, ::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::reverted( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\n\nvoid SAL_CALL OChildCommitListen_Impl::disposing( const lang::EventObject& Source )\n throw ( uno::RuntimeException )\n{\n \/\/ not interesting\n}\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.352); FILE MERGED 2005\/09\/05 15:23:03 rt 1.3.352.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: commitlistener.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 18:36:50 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include \"commitlistener.hxx\"\n\nusing namespace ::com::sun::star;\n\nOChildCommitListen_Impl::OChildCommitListen_Impl( SfxBaseModel& aModel )\n: m_pModel( &aModel )\n{}\n\nOChildCommitListen_Impl::~OChildCommitListen_Impl()\n{}\n\nvoid OChildCommitListen_Impl::OwnerIsDisposed()\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n m_pModel = NULL;\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::preCommit( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::Exception, ::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::commited( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::RuntimeException)\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n \/\/ StorageIsModified_Impl must not contain any locking!\n if ( m_pModel )\n m_pModel->StorageIsModified_Impl();\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::preRevert( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::Exception, ::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\nvoid SAL_CALL OChildCommitListen_Impl::reverted( const ::com::sun::star::lang::EventObject& aEvent )\n throw (::com::sun::star::uno::RuntimeException)\n{\n \/\/ not interesting\n}\n\n\nvoid SAL_CALL OChildCommitListen_Impl::disposing( const lang::EventObject& Source )\n throw ( uno::RuntimeException )\n{\n \/\/ not interesting\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n\treturn 0;\n}\n<commit_msg>Add copyright notice.<commit_after>\/\/ Copyright 2014 Matthew Harvey\n\n#include <iostream>\n\nusing std::cout;\nusing std::endl;\n\nint main()\n{\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This material contains unpublished, proprietary software of \n * Entropic Research Laboratory, Inc. Any reproduction, distribution, \n * or publication of this work must be authorized in writing by Entropic \n * Research Laboratory, Inc., and must bear the notice: \n *\n * \"Copyright (c) 1990-1996 Entropic Research Laboratory, Inc. \n * All rights reserved\"\n *\n * The copyright notice above does not evidence any actual or intended \n * publication of this source code. \n *\n * Written by: Derek Lin\n * Checked by:\n * Revised by: David Talkin\n *\n * Brief description: Estimates F0 using normalized cross correlation and\n * dynamic programming.\n *\n *\/\n\n#include <math.h>\n#include <stdlib.h>\n#include <string.h>\n#include <malloc.h>\n#include <limits.h>\n#include <stdexcept>\n#include <sstream>\n#include <vector>\n\n#include \"f0.h\"\n\nint\t debug_level = 0;\n\n\/\/ ----------------------------------------\n\/\/ Externs\nextern \"C\" {\nint init_dp_f0(double freq, F0_params *par, long *buffsize, long *sdstep);\nint dp_f0(float *fdata, int buff_size, int sdstep, double freq, F0_params *par,\n float **f0p_pt, float **vuvp_pt, float **rms_speech_pt,\n float **acpkp_pt, int *vecsize, int last_time);\n}\n\n\f\n\nstruct f0_params;\n\n\f\nnamespace GetF0 {\n\f\n\n\/\/ EXCEPTIONS\n\n#define CREATE_ERROR(_Name, _Base) \\\n class _Name : public _Base { \\\n public: \\\n explicit _Name(const std::string &what_arg) : _Base(what_arg) {} \\\n };\n\nCREATE_ERROR(RuntimeError, std::runtime_error);\nCREATE_ERROR(LogicError, std::logic_error);\nCREATE_ERROR(ParameterError, RuntimeError);\nCREATE_ERROR(ProcessingError, RuntimeError);\nCREATE_ERROR(AssertionError, LogicError);\n\n#undef CREATE_ERROR\n\n\n#define THROW_ERROR(condition, exception, s) \\\n do { \\\n if (condition) { \\\n std::stringstream ss; \\\n ss << s; \\\n throw exception(ss.str()); \\\n } \\\n } while (0);\n\n\f\n\nclass GetF0 {\npublic:\n GetF0();\n\n void resetParameters();\n\n int derp();\n\nprotected:\n\n \/\/\/ @brief Provide a `buffer` we can read `num_records` samples\n \/\/\/ from, returning how many samples we can read. Returning less\n \/\/\/ than requested samples is a termination condition.\n \/\/\/\n \/\/\/ `buffer` is not guaranteed to not be written to. (TODO: check to\n \/\/\/ see if buffer can be written to.)\n virtual long read_samples(float **buffer, long num_records) { return 0; }\n\n \/\/\/ @brief Like `read_samples`, but read `step` samples from\n \/\/\/ previous buffer.\n virtual long read_samples_overlap(float **buffer, long num_records, long step)\n {\n return 0;\n }\n\n virtual void writeOutput(float *f0p, float *vuvp, float *rms_speech,\n float *acpkp, int vecsize)\n {\n }\n\nprivate:\n\n F0_params m_par;\n\n static void check_f0_params(F0_params *par, double sample_freq);\n\n};\n\nGetF0::GetF0()\n{\n resetParameters();\n}\n\nvoid GetF0::resetParameters()\n{\n m_par.cand_thresh = 0.3;\n m_par.lag_weight = 0.3;\n m_par.freq_weight = 0.02;\n m_par.trans_cost = 0.005;\n m_par.trans_amp = 0.5;\n m_par.trans_spec = 0.5;\n m_par.voice_bias = 0.0;\n m_par.double_cost = 0.35;\n m_par.min_f0 = 50;\n m_par.max_f0 = 550;\n m_par.frame_step = 0.01;\n m_par.wind_dur = 0.0075;\n m_par.n_cands = 20;\n m_par.mean_f0 = 200; \/* unused *\/\n m_par.mean_f0_weight = 0.0; \/* unused *\/\n m_par.conditioning = 0; \/*unused *\/\n}\n\nint GetF0::derp()\n{\n int done;\n long buff_size, actsize;\n double sf, output_starts, frame_rate;\n float *f0p, *vuvp, *rms_speech, *acpkp;\n int i, vecsize;\n long sdstep = 0;\n\n\n#define SW_CUSTOMIZABLE(x) \/\/TODO(sw)\n SW_CUSTOMIZABLE(debug_level);\n\n SW_CUSTOMIZABLE(m_par.frame_step);\n SW_CUSTOMIZABLE(m_par.cand_thresh);\n SW_CUSTOMIZABLE(m_par.lag_weight);\n SW_CUSTOMIZABLE(m_par.freq_weight);\n SW_CUSTOMIZABLE(m_par.trans_cost);\n SW_CUSTOMIZABLE(m_par.trans_amp);\n SW_CUSTOMIZABLE(m_par.trans_spec);\n SW_CUSTOMIZABLE(m_par.voice_bias);\n SW_CUSTOMIZABLE(m_par.double_cost);\n SW_CUSTOMIZABLE(m_par.min_f0);\n SW_CUSTOMIZABLE(m_par.max_f0);\n SW_CUSTOMIZABLE(m_par.wind_dur);\n SW_CUSTOMIZABLE(m_par.n_cands);\n#undef SW_CUSTOMIZABLE\n\n#define SW_FILE_PARAMS(x, y) \/\/TODO (sw)\n SW_FILE_PARAMS(sf, \"sampling frequency\");\n#undef SW_FILE_PARAMS\n\n check_f0_params(&m_par, sf);\n\n \/*SW: Removed range restricter, but this may be interesting:\n if (total_samps < ((par->frame_step * 2.0) + par->wind_dur) * sf), then\n input range too small*\/\n\n output_starts = m_par.wind_dur\/2.0;\n \/* Average delay due to loc. of ref. window center. *\/\n frame_rate = 1.0 \/ m_par.frame_step;\n\n\n \/* Initialize variables in get_f0.c; allocate data structures;\n * determine length and overlap of input frames to read.\n *\n * sw: Looks like init_dp_f0 never returns errors via rcode, but put\n * under assertion.\n *\/\n THROW_ERROR(init_dp_f0(sf, &m_par, &buff_size, &sdstep) ||\n buff_size > INT_MAX || sdstep > INT_MAX,\n AssertionError, \"problem in init_dp_f0().\");\n\n \/*SW: pass sdstep to caller so it knows how much we have to buffer. *\/\n\n if (debug_level)\n Fprintf(stderr, \"init_dp_f0 returned buff_size %ld, sdstep %ld.\\n\",\n\t buff_size, sdstep);\n\n float* fdata = nullptr;\n actsize = read_samples(&fdata, buff_size);\n\n while (1) {\n\n done = (actsize < buff_size);\n\n THROW_ERROR(dp_f0(fdata, (int)actsize, (int)sdstep, sf, &m_par, &f0p, &vuvp,\n &rms_speech, &acpkp, &vecsize, done),\n ProcessingError, \"problem in dp_f0().\");\n\n writeOutput(f0p, vuvp, rms_speech, acpkp, vecsize);\n\n if (done)\n break;\n\n actsize = read_samples_overlap(&fdata, buff_size, sdstep);\n\n }\n\n exit(0);\n}\n\n\/*\n * Some consistency checks on parameter values.\n *\/\nvoid GetF0::check_f0_params(F0_params *par, double sample_freq)\n{\n std::vector<std::string> errors;\n\n if ((par->cand_thresh < 0.01) || (par->cand_thresh > 0.99)) {\n errors.push_back(\"cand_thresh parameter must be between [0.01, 0.99].\");\n }\n if ((par->wind_dur > .1) || (par->wind_dur < .0001)) {\n errors.push_back(\"wind_dur parameter must be between [0.0001, 0.1].\");\n }\n if ((par->n_cands > 100) || (par->n_cands < 3)) {\n errors.push_back(\"n_cands parameter must be between [3,100].\");\n }\n if ((par->max_f0 <= par->min_f0) || (par->max_f0 >= (sample_freq \/ 2.0)) ||\n (par->min_f0 < (sample_freq \/ 10000.0))) {\n errors.push_back(\n \"min(max)_f0 parameter inconsistent with sampling frequency.\");\n }\n double dstep =\n ((double)((int)(0.5 + (sample_freq * par->frame_step)))) \/ sample_freq;\n if (dstep != par->frame_step) {\n if (debug_level)\n Fprintf(stderr,\n \"Frame step set to %f to exactly match signal sample rate.\\n\",\n dstep);\n par->frame_step = dstep;\n }\n if ((par->frame_step > 0.1) || (par->frame_step < (1.0 \/ sample_freq))) {\n errors.push_back(\n \"frame_step parameter must be between [1\/sampling rate, \"\n \"0.1].\");\n }\n\n if (!errors.empty()) {\n std::stringstream ss;\n bool first = true;\n for (auto &error : errors) {\n if (!first) ss << \" \";\n ss << error;\n }\n\n THROW_ERROR(true, ParameterError, ss.str());\n }\n}\n\n} \/\/ namespace GetF0\n<commit_msg>checkParameters<commit_after>\/*\n * This material contains unpublished, proprietary software of \n * Entropic Research Laboratory, Inc. Any reproduction, distribution, \n * or publication of this work must be authorized in writing by Entropic \n * Research Laboratory, Inc., and must bear the notice: \n *\n * \"Copyright (c) 1990-1996 Entropic Research Laboratory, Inc. \n * All rights reserved\"\n *\n * The copyright notice above does not evidence any actual or intended \n * publication of this source code. \n *\n * Written by: Derek Lin\n * Checked by:\n * Revised by: David Talkin\n *\n * Brief description: Estimates F0 using normalized cross correlation and\n * dynamic programming.\n *\n *\/\n\n#include <math.h>\n#include <stdlib.h>\n#include <string.h>\n#include <malloc.h>\n#include <limits.h>\n#include <stdexcept>\n#include <sstream>\n#include <vector>\n\n#include \"f0.h\"\n\nint\t debug_level = 0;\n\n\/\/ ----------------------------------------\n\/\/ Externs\nextern \"C\" {\nint init_dp_f0(double freq, F0_params *par, long *buffsize, long *sdstep);\nint dp_f0(float *fdata, int buff_size, int sdstep, double freq, F0_params *par,\n float **f0p_pt, float **vuvp_pt, float **rms_speech_pt,\n float **acpkp_pt, int *vecsize, int last_time);\n}\n\n\f\n\nstruct f0_params;\n\n\f\nnamespace GetF0 {\n\f\n\n\/\/ EXCEPTIONS\n\n#define CREATE_ERROR(_Name, _Base) \\\n class _Name : public _Base { \\\n public: \\\n explicit _Name(const std::string &what_arg) : _Base(what_arg) {} \\\n };\n\nCREATE_ERROR(RuntimeError, std::runtime_error);\nCREATE_ERROR(LogicError, std::logic_error);\nCREATE_ERROR(ParameterError, RuntimeError);\nCREATE_ERROR(ProcessingError, RuntimeError);\nCREATE_ERROR(AssertionError, LogicError);\n\n#undef CREATE_ERROR\n\n\n#define THROW_ERROR(condition, exception, s) \\\n do { \\\n if (condition) { \\\n std::stringstream ss; \\\n ss << s; \\\n throw exception(ss.str()); \\\n } \\\n } while (0);\n\n\f\n\nclass GetF0 {\npublic:\n GetF0();\n\n void resetParameters();\n\n \/\/\/ @brief Some consistency checks on parameter values. Throws\n \/\/\/ ParameterError if there's something wrong.\n void checkParameters(double sample_freq);\n\n int derp();\n\nprotected:\n\n \/\/\/ @brief Provide a `buffer` we can read `num_records` samples\n \/\/\/ from, returning how many samples we can read. Returning less\n \/\/\/ than requested samples is a termination condition.\n \/\/\/\n \/\/\/ `buffer` is not guaranteed to not be written to. (TODO: check to\n \/\/\/ see if buffer can be written to.)\n virtual long read_samples(float **buffer, long num_records) { return 0; }\n\n \/\/\/ @brief Like `read_samples`, but read `step` samples from\n \/\/\/ previous buffer.\n virtual long read_samples_overlap(float **buffer, long num_records, long step)\n {\n return 0;\n }\n\n virtual void writeOutput(float *f0p, float *vuvp, float *rms_speech,\n float *acpkp, int vecsize)\n {\n }\n\nprivate:\n\n f0_params m_par;\n\n};\n\nGetF0::GetF0()\n{\n resetParameters();\n}\n\nvoid GetF0::resetParameters()\n{\n m_par.cand_thresh = 0.3;\n m_par.lag_weight = 0.3;\n m_par.freq_weight = 0.02;\n m_par.trans_cost = 0.005;\n m_par.trans_amp = 0.5;\n m_par.trans_spec = 0.5;\n m_par.voice_bias = 0.0;\n m_par.double_cost = 0.35;\n m_par.min_f0 = 50;\n m_par.max_f0 = 550;\n m_par.frame_step = 0.01;\n m_par.wind_dur = 0.0075;\n m_par.n_cands = 20;\n m_par.mean_f0 = 200; \/* unused *\/\n m_par.mean_f0_weight = 0.0; \/* unused *\/\n m_par.conditioning = 0; \/*unused *\/\n}\n\nint GetF0::derp()\n{\n int done;\n long buff_size, actsize;\n double sf, output_starts, frame_rate;\n float *f0p, *vuvp, *rms_speech, *acpkp;\n int i, vecsize;\n long sdstep = 0;\n\n\n#define SW_CUSTOMIZABLE(x) \/\/TODO(sw)\n SW_CUSTOMIZABLE(debug_level);\n\n SW_CUSTOMIZABLE(m_par.frame_step);\n SW_CUSTOMIZABLE(m_par.cand_thresh);\n SW_CUSTOMIZABLE(m_par.lag_weight);\n SW_CUSTOMIZABLE(m_par.freq_weight);\n SW_CUSTOMIZABLE(m_par.trans_cost);\n SW_CUSTOMIZABLE(m_par.trans_amp);\n SW_CUSTOMIZABLE(m_par.trans_spec);\n SW_CUSTOMIZABLE(m_par.voice_bias);\n SW_CUSTOMIZABLE(m_par.double_cost);\n SW_CUSTOMIZABLE(m_par.min_f0);\n SW_CUSTOMIZABLE(m_par.max_f0);\n SW_CUSTOMIZABLE(m_par.wind_dur);\n SW_CUSTOMIZABLE(m_par.n_cands);\n#undef SW_CUSTOMIZABLE\n\n#define SW_FILE_PARAMS(x, y) \/\/TODO (sw)\n SW_FILE_PARAMS(sf, \"sampling frequency\");\n#undef SW_FILE_PARAMS\n\n checkParameters(sf);\n\n \/*SW: Removed range restricter, but this may be interesting:\n if (total_samps < ((par->frame_step * 2.0) + par->wind_dur) * sf), then\n input range too small*\/\n\n output_starts = m_par.wind_dur\/2.0;\n \/* Average delay due to loc. of ref. window center. *\/\n frame_rate = 1.0 \/ m_par.frame_step;\n\n\n \/* Initialize variables in get_f0.c; allocate data structures;\n * determine length and overlap of input frames to read.\n *\n * sw: Looks like init_dp_f0 never returns errors via rcode, but put\n * under assertion.\n *\/\n THROW_ERROR(init_dp_f0(sf, &m_par, &buff_size, &sdstep) ||\n buff_size > INT_MAX || sdstep > INT_MAX,\n AssertionError, \"problem in init_dp_f0().\");\n\n \/*SW: pass sdstep to caller so it knows how much we have to buffer. *\/\n\n if (debug_level)\n Fprintf(stderr, \"init_dp_f0 returned buff_size %ld, sdstep %ld.\\n\",\n\t buff_size, sdstep);\n\n float* fdata = nullptr;\n actsize = read_samples(&fdata, buff_size);\n\n while (1) {\n\n done = (actsize < buff_size);\n\n THROW_ERROR(dp_f0(fdata, (int)actsize, (int)sdstep, sf, &m_par, &f0p, &vuvp,\n &rms_speech, &acpkp, &vecsize, done),\n ProcessingError, \"problem in dp_f0().\");\n\n writeOutput(f0p, vuvp, rms_speech, acpkp, vecsize);\n\n if (done)\n break;\n\n actsize = read_samples_overlap(&fdata, buff_size, sdstep);\n\n }\n\n exit(0);\n}\n\nvoid GetF0::checkParameters(double sample_freq)\n{\n std::vector<std::string> errors;\n\n if ((m_par.cand_thresh < 0.01) || (m_par.cand_thresh > 0.99)) {\n errors.push_back(\"cand_thresh parameter must be between [0.01, 0.99].\");\n }\n if ((m_par.wind_dur > .1) || (m_par.wind_dur < .0001)) {\n errors.push_back(\"wind_dur parameter must be between [0.0001, 0.1].\");\n }\n if ((m_par.n_cands > 100) || (m_par.n_cands < 3)) {\n errors.push_back(\"n_cands parameter must be between [3,100].\");\n }\n if ((m_par.max_f0 <= m_par.min_f0) || (m_par.max_f0 >= (sample_freq \/ 2.0)) ||\n (m_par.min_f0 < (sample_freq \/ 10000.0))) {\n errors.push_back(\n \"min(max)_f0 parameter inconsistent with sampling frequency.\");\n }\n double dstep =\n ((double)((int)(0.5 + (sample_freq * m_par.frame_step)))) \/ sample_freq;\n if (dstep != m_par.frame_step) {\n if (debug_level)\n Fprintf(stderr,\n \"Frame step set to %f to exactly match signal sample rate.\\n\",\n dstep);\n m_par.frame_step = dstep;\n }\n if ((m_par.frame_step > 0.1) || (m_par.frame_step < (1.0 \/ sample_freq))) {\n errors.push_back(\n \"frame_step parameter must be between [1\/sampling rate, \"\n \"0.1].\");\n }\n\n if (!errors.empty()) {\n std::stringstream ss;\n bool first = true;\n for (auto &error : errors) {\n if (!first) ss << \" \";\n ss << error;\n }\n\n THROW_ERROR(true, ParameterError, ss.str());\n }\n}\n\n} \/\/ namespace GetF0\n<|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n#include <ESP8266WebServer.h>\n\n#include <Logger.h>\n#include <Network.h>\n#include \"HTTPServer.h\"\n#include \"HTMLProvider.h\"\n#include \"GPIO.h\"\n#include \"MQTT.h\"\n#include \"Settings.h\"\n#include \"UPnP.h\"\n\n\/\/#define SERIAL_OUTPUT\n\/\/#define DEBUG\n\/\/#define FULLDEBUG\n\nESP8266WebServer server(80);\n\nStorage _storage;\nSettings _settings(&_storage);\nLogger _logger(&_settings);\nNetwork _network(&_settings);\nHTMLProvider _htmlProvider(&_settings);\nMQTT _mqtt(&_settings);\nGPIO _gpio(&_settings, &_logger, &_mqtt);\nCommands _commands(&_settings, &_gpio);\nHTTPServer _http(&server, &_settings, &_logger, &_htmlProvider, &_commands, &_storage);\nUPnP _upnp(&_logger, &_http, &_settings, &_htmlProvider, &_commands, &_gpio);\n\nvoid setup()\n{\n using namespace std::placeholders; \/\/ for `_1`\n\n#ifdef SERIAL_OUTPUT\n Serial.begin(74880);\n#endif\n\n pinMode(PIN_A0, INPUT);\n\n _gpio.setup();\n Serial.println(\"starting initialization ...\");\n _gpio.led(true);\n _settings.load();\n _network.setup();\n _logger.setup(_settings.hostName);\n _logger.writeLog(LOG_NOTICE, \"starting up\");\n _upnp.setup();\n _http.setup();\n _mqtt.setup(std::bind(&Commands::execute, _commands, _1, _2));\n _gpio.led(false);\n _gpio.restoreLastState();\n Serial.println(\"initialization finished.\");\n _logger.writeLog(LOG_INFO, \"started successfully\");\n}\n\nvoid loop()\n{\n _gpio.loop();\n _network.loop();\n _http.loop();\n _upnp.loop();\n _mqtt.loop();\n}\n<commit_msg>removed left-over poc code<commit_after>#include <Arduino.h>\n#include <ESP8266WebServer.h>\n\n#include <Logger.h>\n#include <Network.h>\n#include \"HTTPServer.h\"\n#include \"HTMLProvider.h\"\n#include \"GPIO.h\"\n#include \"MQTT.h\"\n#include \"Settings.h\"\n#include \"UPnP.h\"\n\n\/\/#define SERIAL_OUTPUT\n\/\/#define DEBUG\n\/\/#define FULLDEBUG\n\nESP8266WebServer server(80);\n\nStorage _storage;\nSettings _settings(&_storage);\nLogger _logger(&_settings);\nNetwork _network(&_settings);\nHTMLProvider _htmlProvider(&_settings);\nMQTT _mqtt(&_settings);\nGPIO _gpio(&_settings, &_logger, &_mqtt);\nCommands _commands(&_settings, &_gpio);\nHTTPServer _http(&server, &_settings, &_logger, &_htmlProvider, &_commands, &_storage);\nUPnP _upnp(&_logger, &_http, &_settings, &_htmlProvider, &_commands, &_gpio);\n\nvoid setup()\n{\n using namespace std::placeholders; \/\/ for `_1`\n\n#ifdef SERIAL_OUTPUT\n Serial.begin(74880);\n#endif\n\n _gpio.setup();\n Serial.println(\"starting initialization ...\");\n _gpio.led(true);\n _settings.load();\n _network.setup();\n _logger.setup(_settings.hostName);\n _logger.writeLog(LOG_NOTICE, \"starting up\");\n _upnp.setup();\n _http.setup();\n _mqtt.setup(std::bind(&Commands::execute, _commands, _1, _2));\n _gpio.led(false);\n _gpio.restoreLastState();\n Serial.println(\"initialization finished.\");\n _logger.writeLog(LOG_INFO, \"started successfully\");\n}\n\nvoid loop()\n{\n _gpio.loop();\n _network.loop();\n _http.loop();\n _upnp.loop();\n _mqtt.loop();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"http.h\"\n#include <fcntl.h>\n#include <fstream>\n\n#ifdef _WIN32\n# include <io.h>\n#endif\n\nnamespace enji {\n\nint cb_http_message_begin(http_parser* parser) {\n return 0;\n}\n\nint cb_http_url(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_url(at, len);\n}\n\nint cb_http_status(http_parser* parser, const char* at, size_t len) {\n std::cerr << \"Got unhandled status: \" << String(at, len) << std::endl;\n return 0;\n}\n\nint cb_http_header_field(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_header_field(at, len);\n}\n\nint cb_http_header_value(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_header_value(at, len);\n}\n\nint cb_http_headers_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_headers_complete();\n}\n\nint cb_http_body(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_body(at, len);\n}\n\nint cb_http_message_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_message_complete();\n}\n\nhttp_parser_settings& get_http_settings() {\n static http_parser_settings http_settings = {};\n http_settings.on_message_begin = cb_http_message_begin;\n http_settings.on_url = cb_http_url;\n http_settings.on_status = cb_http_status;\n http_settings.on_header_field = cb_http_header_field;\n http_settings.on_header_value = cb_http_header_value;\n http_settings.on_headers_complete = cb_http_headers_complete;\n http_settings.on_body = cb_http_body;\n http_settings.on_message_complete = cb_http_message_complete;\n return http_settings;\n}\n\nHttpConnection::HttpConnection(HttpServer* parent, size_t id)\n: Connection(parent, id),\n parent_(parent) {\n parser_.reset(new http_parser{});\n http_parser_init(parser_.get(), HTTP_REQUEST);\n parser_.get()->data = this;\n\n request_.reset(new HttpRequest{});\n}\n\nconst HttpRequest& HttpConnection::request() const {\n return *request_.get();\n}\n\nint HttpConnection::on_http_url(const char* at, size_t len) {\n request_->url_ += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_field(const char* at, size_t len) {\n check_header_finished();\n read_header_.first += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_value(const char* at, size_t len) {\n read_header_.second += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_headers_complete() {\n check_header_finished();\n return 0;\n}\n\nint HttpConnection::on_http_body(const char* at, size_t len) {\n request_->body_ += String{at, len};\n return 0;\n}\n\nconst String MULTIPART_FORM_DATA = \"multipart\/form-data; boundary=\";\n\nint HttpConnection::on_message_complete() {\n message_completed_ = true;\n\n auto expect_iter = request_->headers_.find(\"Expect\");\n\n if (expect_iter != request_->headers_.end()) {\n if (expect_iter->second == \"100-continue\") {\n message_completed_ = false;\n std::ostringstream buf;\n buf << \"HTTP\/1.1 100 Continue\\r\\n\";\n write_chunk(buf);\n }\n }\n\n auto content_type_iter = request_->headers_.find(\"Content-Type\");\n if (content_type_iter != request_->headers_.end()) {\n String boundary;\n auto multipart = content_type_iter->second.find(MULTIPART_FORM_DATA);\n if (multipart != String::npos) {\n auto boundary_start = multipart + MULTIPART_FORM_DATA.size();\n boundary = content_type_iter->second.substr(boundary_start);\n }\n\n std::vector<size_t> occurrences;\n size_t start = 0;\n\n boundary = \"--\" + boundary;\n\n while ((start = request_->body_.find(boundary, start)) != String::npos) {\n occurrences.push_back(start);\n start += boundary.length();\n }\n\n const char* body = &request_->body_.front();\n for (size_t occurence = 1; occurence < occurrences.size(); ++occurence) {\n auto file_content = String{\n body + occurrences[occurence - 1] + boundary.length() + 2, \/\/ Skip boundary + \"\\r\\n\"\n body + occurrences[occurence]\n };\n\n auto headers_finished = file_content.find(\"\\r\\n\\r\\n\");\n auto headers = file_content.substr(0, headers_finished);\n\n std::regex regex(\"Content-Disposition: form-data; name=\\\"(.+)\\\"; filename=\\\"(.+)\\\"\");\n std::smatch match_groups;\n std::regex_search(headers, match_groups, regex);\n\n File file;\n \n if (!match_groups.empty()) {\n file.name_ = match_groups[1].str();\n file.filename_ = match_groups[2].str();\n }\n\n if (file.name_.empty() && file.filename_.empty()) {\n continue;\n }\n \n auto file_body = file_content.substr(headers_finished + 4);\n\n file.body_ = std::move(file_body);\n\n request_->files_.emplace_back(std::move(file));\n }\n }\n \n\n return 0;\n}\n\nvoid HttpConnection::handle_input(StringView data) {\n http_parser_execute(parser_.get(), &get_http_settings(), data.data, data.size);\n \n if (message_completed_) {\n request_->method_ = http_method_str(static_cast<http_method>(parser_.get()->method));\n parent_->call_handler(*request_.get(), this);\n }\n}\n\nvoid HttpConnection::check_header_finished() {\n if (!read_header_.first.empty() && !read_header_.second.empty()) {\n request_->headers_.insert(Header{std::move(read_header_)});\n }\n}\n\nHttpResponse::HttpResponse(HttpConnection* conn)\n: conn_{conn},\n response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n headers_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n body_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n full_response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary} {\n}\n\nHttpResponse::~HttpResponse() {\n close();\n}\n\nHttpResponse& HttpResponse::response(int code) {\n code_ = code;\n response_ << \"HTTP\/1.1 \" << code << \"\\r\\n\";\n return *this;\n}\n\nHttpResponse& HttpResponse::add_headers(std::vector<std::pair<String, String>> headers) {\n for (auto&& h : headers) {\n add_header(h.first, h.second);\n }\n return *this;\n}\n\nHttpResponse& HttpResponse::add_header(const String& name, const String& value) {\n if (headers_sent_) {\n throw std::runtime_error(\"Can't add headers to response. Headers already sent\");\n }\n headers_ << name << \": \" << value << \"\\r\\n\";\n return *this;\n}\n\nbool stream2stream(std::stringstream& output, std::stringstream& input) {\n const size_t alloc_block = 32 * 1024;\n char tmp[alloc_block];\n bool written_smth = false;\n while (input) {\n input.read(tmp, sizeof(tmp));\n size_t size = input.gcount();\n output.write(tmp, size);\n if (size) {\n written_smth = true;\n }\n }\n return written_smth;\n}\n\nvoid stream2conn(Connection* conn, std::stringstream& buf) {\n while (buf) {\n size_t alloc_block = 32 * 1024;\n char* data = new char[alloc_block];\n buf.read(data, alloc_block);\n const size_t size = buf.gcount();\n TransferBlock block = {data, size};\n conn->write_chunk(block);\n }\n}\n\nHttpResponse& HttpResponse::body(const String& value) {\n body_ << value;\n return *this;\n}\n\nHttpResponse& HttpResponse::body(std::stringstream& buf) {\n stream2stream(body_, buf);\n return *this;\n}\n\nHttpResponse& HttpResponse::body(const void* data, size_t length) {\n body_.write(static_cast<const char*>(data), length);\n return *this;\n}\n\nvoid HttpResponse::flush() {\n if (!headers_sent_) {\n if (!stream2stream(full_response_, response_)) {\n full_response_ << \"HTTP\/1.1 200\\r\\n\";\n }\n\n body_.seekp(0, std::ios::end);\n auto body_size = body_.tellp();\n\n std::ostringstream body_size_stream;\n body_size_stream << body_size;\n add_header(\"Content-length\", body_size_stream.str());\n\n stream2stream(full_response_, headers_);\n headers_sent_ = true;\n\n full_response_ << \"\\r\\n\";\n }\n\n stream2stream(full_response_, body_);\n stream2conn(conn_, full_response_);\n}\n\nvoid HttpResponse::close() {\n flush();\n conn_->close();\n}\n\nHttpRoute::HttpRoute(const char* path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(const char* path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nstd::smatch HttpRoute::match(const String& url) const {\n std::smatch match_groups;\n std::regex_search(url, match_groups, path_match_);\n return match_groups;\n}\n\nvoid HttpRoute::call_handler(const HttpRequest& req, HttpResponse& out) {\n handler_(req, out);\n}\n\nHttpServer::HttpServer(ServerOptions&& options)\n: Server{std::move(options)} {\n create_connection([this]() {\n return std::make_shared<HttpConnection>(this, counter_++); });\n}\n\nvoid HttpServer::routes(std::vector<HttpRoute>&& routes) {\n routes_ = std::move(routes);\n}\n\nvoid HttpServer::add_route(HttpRoute&& route) {\n routes_.emplace_back(route);\n}\n\nvoid HttpServer::call_handler(HttpRequest& request, HttpConnection* bind) {\n bool matched = false;\n HttpResponse out{bind};\n\n for (auto&& route : routes_) {\n auto matches = route.match(request.url());\n if (!matches.empty()) {\n request.set_match(matches);\n route.call_handler(request, out);\n matched = true;\n }\n }\n\n if (!matched) {\n out.response(404);\n }\n\n std::cout << request.method() << \" \" << request.url() << \" \" << out.code() << std::endl;\n}\n\nString match1_filename(const HttpRequest& req) {\n return req.match()[1].str();\n}\n\nHttpRoute::Handler serve_static(std::function<String(const HttpRequest& req)> request2file, const Config& config) {\n \/\/auto request_func = std::function<String(const HttpRequest& req)>{std::move(request2file)};\n return HttpRoute::Handler{\n [&] (const HttpRequest& req, HttpResponse& out)\n {\n static_file(request2file(req), out, config);\n }};\n}\n\nHttpRoute::Handler serve_static(const String& root_dir, std::function<String(const HttpRequest& req)> request2file) {\n String dir = root_dir;\n auto request_func = std::function<String(const HttpRequest& req)>{std::move(request2file)};\n return HttpRoute::Handler{\n [&request_func, &dir]\n (const HttpRequest& req, HttpResponse& out)->void\n {\n String result = request_func(req);\n response_file(path_join(dir, result), out);\n }};\n}\n\nvoid static_file(const String& filename, HttpResponse& out, const Config& config) {\n response_file(path_join(config[\"STATIC_ROOT_DIR\"].str(), filename), out);\n}\n\nvoid response_file(const String& filename, HttpResponse& out) {\n uv_fs_t open_req;\n uv_fs_open(nullptr, &open_req, filename.c_str(), O_RDONLY, S_IRUSR, nullptr);\n auto open_req_exit = Defer{[&open_req] { uv_fs_req_cleanup(&open_req); }};\n const auto fd = static_cast<uv_file>(open_req.result);\n\n if (fd < 0) {\n out.response(404);\n return;\n }\n\n uv_fs_t read_req;\n const size_t alloc_block = 64 * 1024;\n size_t offset = 0;\n char mem[alloc_block];\n while (true) {\n uv_buf_t buf[] = {uv_buf_init(mem, sizeof(mem))};\n int read = uv_fs_read(nullptr, &read_req, fd, buf, 1, offset, nullptr);\n auto read_req_exit = Defer{[&read_req] { uv_fs_req_cleanup(&read_req); }};\n out.body(buf[0].base, read);\n offset += read;\n if (static_cast<unsigned int>(read) < buf[0].len) {\n break;\n }\n }\n\n uv_fs_t close_req;\n uv_fs_close(nullptr, &close_req, fd, nullptr);\n auto close_req_exit = Defer{[&close_req] { uv_fs_req_cleanup(&close_req); }};\n}\n\nvoid temporary_redirect(const String& redirect_to, HttpResponse& out) {\n out.response(307);\n out.add_header(\"Location\", redirect_to);\n out.close();\n}\n\n} \/\/ namespace enji<commit_msg>Win32 build<commit_after>#include \"http.h\"\n#include <fcntl.h>\n#include <fstream>\n\n#ifdef _WIN32\n# include <io.h>\n#endif\n\nnamespace enji {\n\nint cb_http_message_begin(http_parser* parser) {\n return 0;\n}\n\nint cb_http_url(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_url(at, len);\n}\n\nint cb_http_status(http_parser* parser, const char* at, size_t len) {\n std::cerr << \"Got unhandled status: \" << String(at, len) << std::endl;\n return 0;\n}\n\nint cb_http_header_field(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_header_field(at, len);\n}\n\nint cb_http_header_value(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_header_value(at, len);\n}\n\nint cb_http_headers_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_headers_complete();\n}\n\nint cb_http_body(http_parser* parser, const char* at, size_t len) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_http_body(at, len);\n}\n\nint cb_http_message_complete(http_parser* parser) {\n HttpConnection& handler = *reinterpret_cast<HttpConnection*>(parser->data);\n return handler.on_message_complete();\n}\n\nhttp_parser_settings& get_http_settings() {\n static http_parser_settings http_settings = {};\n http_settings.on_message_begin = cb_http_message_begin;\n http_settings.on_url = cb_http_url;\n http_settings.on_status = cb_http_status;\n http_settings.on_header_field = cb_http_header_field;\n http_settings.on_header_value = cb_http_header_value;\n http_settings.on_headers_complete = cb_http_headers_complete;\n http_settings.on_body = cb_http_body;\n http_settings.on_message_complete = cb_http_message_complete;\n return http_settings;\n}\n\nHttpConnection::HttpConnection(HttpServer* parent, size_t id)\n: Connection(parent, id),\n parent_(parent) {\n parser_.reset(new http_parser{});\n http_parser_init(parser_.get(), HTTP_REQUEST);\n parser_.get()->data = this;\n\n request_.reset(new HttpRequest{});\n}\n\nconst HttpRequest& HttpConnection::request() const {\n return *request_.get();\n}\n\nint HttpConnection::on_http_url(const char* at, size_t len) {\n request_->url_ += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_field(const char* at, size_t len) {\n check_header_finished();\n read_header_.first += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_header_value(const char* at, size_t len) {\n read_header_.second += String{at, len};\n return 0;\n}\n\nint HttpConnection::on_http_headers_complete() {\n check_header_finished();\n return 0;\n}\n\nint HttpConnection::on_http_body(const char* at, size_t len) {\n request_->body_ += String{at, len};\n return 0;\n}\n\nconst String MULTIPART_FORM_DATA = \"multipart\/form-data; boundary=\";\n\nint HttpConnection::on_message_complete() {\n message_completed_ = true;\n\n auto expect_iter = request_->headers_.find(\"Expect\");\n\n if (expect_iter != request_->headers_.end()) {\n if (expect_iter->second == \"100-continue\") {\n message_completed_ = false;\n std::ostringstream buf;\n buf << \"HTTP\/1.1 100 Continue\\r\\n\";\n write_chunk(buf);\n }\n }\n\n auto content_type_iter = request_->headers_.find(\"Content-Type\");\n if (content_type_iter != request_->headers_.end()) {\n String boundary;\n auto multipart = content_type_iter->second.find(MULTIPART_FORM_DATA);\n if (multipart != String::npos) {\n auto boundary_start = multipart + MULTIPART_FORM_DATA.size();\n boundary = content_type_iter->second.substr(boundary_start);\n }\n\n std::vector<size_t> occurrences;\n size_t start = 0;\n\n boundary = \"--\" + boundary;\n\n while ((start = request_->body_.find(boundary, start)) != String::npos) {\n occurrences.push_back(start);\n start += boundary.length();\n }\n\n const char* body = &request_->body_.front();\n for (size_t occurence = 1; occurence < occurrences.size(); ++occurence) {\n auto file_content = String{\n body + occurrences[occurence - 1] + boundary.length() + 2, \/\/ Skip boundary + \"\\r\\n\"\n body + occurrences[occurence]\n };\n\n auto headers_finished = file_content.find(\"\\r\\n\\r\\n\");\n auto headers = file_content.substr(0, headers_finished);\n\n std::regex regex(\"Content-Disposition: form-data; name=\\\"(.+)\\\"; filename=\\\"(.+)\\\"\");\n std::smatch match_groups;\n std::regex_search(headers, match_groups, regex);\n\n File file;\n \n if (!match_groups.empty()) {\n file.name_ = match_groups[1].str();\n file.filename_ = match_groups[2].str();\n }\n\n if (file.name_.empty() && file.filename_.empty()) {\n continue;\n }\n \n auto file_body = file_content.substr(headers_finished + 4);\n\n file.body_ = std::move(file_body);\n\n request_->files_.emplace_back(std::move(file));\n }\n }\n \n\n return 0;\n}\n\nvoid HttpConnection::handle_input(StringView data) {\n http_parser_execute(parser_.get(), &get_http_settings(), data.data, data.size);\n \n if (message_completed_) {\n request_->method_ = http_method_str(static_cast<http_method>(parser_.get()->method));\n parent_->call_handler(*request_.get(), this);\n }\n}\n\nvoid HttpConnection::check_header_finished() {\n if (!read_header_.first.empty() && !read_header_.second.empty()) {\n request_->headers_.insert(Header{std::move(read_header_)});\n }\n}\n\nHttpResponse::HttpResponse(HttpConnection* conn)\n: conn_{conn},\n response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n headers_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n body_{std::stringstream::in | std::stringstream::out | std::stringstream::binary},\n full_response_{std::stringstream::in | std::stringstream::out | std::stringstream::binary} {\n}\n\nHttpResponse::~HttpResponse() {\n close();\n}\n\nHttpResponse& HttpResponse::response(int code) {\n code_ = code;\n response_ << \"HTTP\/1.1 \" << code << \"\\r\\n\";\n return *this;\n}\n\nHttpResponse& HttpResponse::add_headers(std::vector<std::pair<String, String>> headers) {\n for (auto&& h : headers) {\n add_header(h.first, h.second);\n }\n return *this;\n}\n\nHttpResponse& HttpResponse::add_header(const String& name, const String& value) {\n if (headers_sent_) {\n throw std::runtime_error(\"Can't add headers to response. Headers already sent\");\n }\n headers_ << name << \": \" << value << \"\\r\\n\";\n return *this;\n}\n\nbool stream2stream(std::stringstream& output, std::stringstream& input) {\n const size_t alloc_block = 32 * 1024;\n char tmp[alloc_block];\n bool written_smth = false;\n while (input) {\n input.read(tmp, sizeof(tmp));\n size_t size = input.gcount();\n output.write(tmp, size);\n if (size) {\n written_smth = true;\n }\n }\n return written_smth;\n}\n\nvoid stream2conn(Connection* conn, std::stringstream& buf) {\n while (buf) {\n size_t alloc_block = 32 * 1024;\n char* data = new char[alloc_block];\n buf.read(data, alloc_block);\n const size_t size = buf.gcount();\n TransferBlock block = {data, size};\n conn->write_chunk(block);\n }\n}\n\nHttpResponse& HttpResponse::body(const String& value) {\n body_ << value;\n return *this;\n}\n\nHttpResponse& HttpResponse::body(std::stringstream& buf) {\n stream2stream(body_, buf);\n return *this;\n}\n\nHttpResponse& HttpResponse::body(const void* data, size_t length) {\n body_.write(static_cast<const char*>(data), length);\n return *this;\n}\n\nvoid HttpResponse::flush() {\n if (!headers_sent_) {\n if (!stream2stream(full_response_, response_)) {\n full_response_ << \"HTTP\/1.1 200\\r\\n\";\n }\n\n body_.seekp(0, std::ios::end);\n auto body_size = body_.tellp();\n\n std::ostringstream body_size_stream;\n body_size_stream << body_size;\n add_header(\"Content-length\", body_size_stream.str());\n\n stream2stream(full_response_, headers_);\n headers_sent_ = true;\n\n full_response_ << \"\\r\\n\";\n }\n\n stream2stream(full_response_, body_);\n stream2conn(conn_, full_response_);\n}\n\nvoid HttpResponse::close() {\n flush();\n conn_->close();\n}\n\nHttpRoute::HttpRoute(const char* path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, Handler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(const char* path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nHttpRoute::HttpRoute(String&& path, FuncHandler handler)\n: path_{path},\n handler_{handler},\n path_match_(path) {\n}\n\nstd::smatch HttpRoute::match(const String& url) const {\n std::smatch match_groups;\n std::regex_search(url, match_groups, path_match_);\n return match_groups;\n}\n\nvoid HttpRoute::call_handler(const HttpRequest& req, HttpResponse& out) {\n handler_(req, out);\n}\n\nHttpServer::HttpServer(ServerOptions&& options)\n: Server{std::move(options)} {\n create_connection([this]() {\n return std::make_shared<HttpConnection>(this, counter_++); });\n}\n\nvoid HttpServer::routes(std::vector<HttpRoute>&& routes) {\n routes_ = std::move(routes);\n}\n\nvoid HttpServer::add_route(HttpRoute&& route) {\n routes_.emplace_back(route);\n}\n\nvoid HttpServer::call_handler(HttpRequest& request, HttpConnection* bind) {\n bool matched = false;\n HttpResponse out{bind};\n\n for (auto&& route : routes_) {\n auto matches = route.match(request.url());\n if (!matches.empty()) {\n request.set_match(matches);\n route.call_handler(request, out);\n matched = true;\n }\n }\n\n if (!matched) {\n out.response(404);\n }\n\n std::cout << request.method() << \" \" << request.url() << \" \" << out.code() << std::endl;\n}\n\nString match1_filename(const HttpRequest& req) {\n return req.match()[1].str();\n}\n\nHttpRoute::Handler serve_static(std::function<String(const HttpRequest& req)> request2file, const Config& config) {\n \/\/auto request_func = std::function<String(const HttpRequest& req)>{std::move(request2file)};\n return HttpRoute::Handler{\n [&] (const HttpRequest& req, HttpResponse& out)\n {\n static_file(request2file(req), out, config);\n }};\n}\n\nHttpRoute::Handler serve_static(const String& root_dir, std::function<String(const HttpRequest& req)> request2file) {\n String dir = root_dir;\n auto request_func = std::function<String(const HttpRequest& req)>{std::move(request2file)};\n return HttpRoute::Handler{\n [&request_func, &dir]\n (const HttpRequest& req, HttpResponse& out)->void\n {\n String result = request_func(req);\n response_file(path_join(dir, result), out);\n }};\n}\n\nvoid static_file(const String& filename, HttpResponse& out, const Config& config) {\n response_file(path_join(config[\"STATIC_ROOT_DIR\"].str(), filename), out);\n}\n\nvoid response_file(const String& filename, HttpResponse& out) {\n uv_fs_t open_req;\n\n#ifdef _WIN32\n int open_mode = _S_IREAD;\n#else\n int open_mode = S_IRUSR;\n#endif\n \n uv_fs_open(nullptr, &open_req, filename.c_str(), O_RDONLY, open_mode, nullptr);\n auto open_req_exit = Defer{[&open_req] { uv_fs_req_cleanup(&open_req); }};\n const auto fd = static_cast<uv_file>(open_req.result);\n\n if (fd < 0) {\n out.response(404);\n return;\n }\n\n uv_fs_t read_req;\n const size_t alloc_block = 64 * 1024;\n size_t offset = 0;\n char mem[alloc_block];\n while (true) {\n uv_buf_t buf[] = {uv_buf_init(mem, sizeof(mem))};\n int read = uv_fs_read(nullptr, &read_req, fd, buf, 1, offset, nullptr);\n auto read_req_exit = Defer{[&read_req] { uv_fs_req_cleanup(&read_req); }};\n out.body(buf[0].base, read);\n offset += read;\n if (static_cast<unsigned int>(read) < buf[0].len) {\n break;\n }\n }\n\n uv_fs_t close_req;\n uv_fs_close(nullptr, &close_req, fd, nullptr);\n auto close_req_exit = Defer{[&close_req] { uv_fs_req_cleanup(&close_req); }};\n}\n\nvoid temporary_redirect(const String& redirect_to, HttpResponse& out) {\n out.response(307);\n out.add_header(\"Location\", redirect_to);\n out.close();\n}\n\n} \/\/ namespace enji<|endoftext|>"} {"text":"<commit_before>\/*! \\file main.cpp\n * \\brief Program to run the grid code. *\/\n\n#ifdef MPI_CHOLLA\n#include <mpi.h>\n#include \"mpi_routines.h\"\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include \"global.h\"\n#include \"grid3D.h\"\n#include \"io.h\"\n#include \"error_handling.h\"\n\n#define OUTPUT\n\/\/#define CPU_TIME\n\nint main(int argc, char *argv[])\n{\n \/\/ timing variables\n double start_total, stop_total, start_step, stop_step;\n #ifdef CPU_TIME\n double stop_init, init_min, init_max, init_avg;\n double start_bound, stop_bound, bound_min, bound_max, bound_avg;\n double start_hydro, stop_hydro, hydro_min, hydro_max, hydro_avg;\n double init, bound, hydro;\n init = bound = hydro = 0;\n #endif \/\/CPU_TIME\n\n \/\/ start the total time\n start_total = get_time();\n\n \/* Initialize MPI communication *\/\n #ifdef MPI_CHOLLA\n InitializeChollaMPI(&argc, &argv);\n #endif \/*MPI_CHOLLA*\/\n\n Real dti = 0; \/\/ inverse time step, 1.0 \/ dt\n\n \/\/ input parameter variables\n char *param_file;\n struct parameters P;\n int nfile = 0; \/\/ number of output files\n Real outtime = 0; \/\/ current output time\n\n\n \/\/ read in command line arguments\n if (argc != 2)\n {\n chprintf(\"usage: %s <parameter_file>\\n\", argv[0]);\n chexit(-1);\n } else {\n param_file = argv[1];\n }\n\n \/\/ create the grid\n Grid3D G;\n\n \/\/ read in the parameters\n parse_params (param_file, &P);\n \/\/ and output to screen\n chprintf (\"Parameter values: nx = %d, ny = %d, nz = %d, tout = %f, init = %s, boundaries = %d %d %d %d %d %d\\n\", \n P.nx, P.ny, P.nz, P.tout, P.init, P.xl_bcnd, P.xu_bcnd, P.yl_bcnd, P.yu_bcnd, P.zl_bcnd, P.zu_bcnd);\n chprintf (\"Output directory: %s\\n\", P.outdir);\n\n\n \/\/ initialize the grid\n G.Initialize(&P);\n chprintf(\"Local number of grid cells: %d %d %d %d\\n\", G.H.nx_real, G.H.ny_real, G.H.nz_real, G.H.n_cells);\n\n\n \/\/ Set initial conditions and calculate first dt\n chprintf(\"Setting initial conditions...\\n\");\n G.Set_Initial_Conditions(P);\n chprintf(\"Initial conditions set.\\n\");\n \/\/ set main variables for Read_Grid inital conditions\n if (strcmp(P.init, \"Read_Grid\") == 0) {\n dti = C_cfl \/ G.H.dt;\n outtime += G.H.t;\n nfile = P.nfile*P.nfull;\n }\n \n #ifdef CPU_TIME\n G.Timer.Initialize();\n #endif\n \n #ifdef GRAVITY\n G.Initialize_Gravity(&P);\n #endif\n \n #ifdef PARTICLES\n G.Initialize_Particles(&P);\n #endif\n\n #ifdef GRAVITY\n G.Compute_Gravitational_Potential( &P);\n #endif\n\n \/\/ set boundary conditions (assign appropriate values to ghost cells)\n chprintf(\"Setting boundary conditions...\\n\");\n G.Set_Boundary_Conditions_All(P);\n chprintf(\"Boundary conditions set.\\n\"); \n \n #ifdef PARTICLES\n G.Get_Particles_Accelration();\n #endif\n\n chprintf(\"Dimensions of each cell: dx = %f dy = %f dz = %f\\n\", G.H.dx, G.H.dy, G.H.dz);\n chprintf(\"Ratio of specific heats gamma = %f\\n\",gama);\n chprintf(\"Nstep = %d Timestep = %f Simulation time = %f\\n\", G.H.n_step, G.H.dt, G.H.t);\n\n\n #ifdef OUTPUT\n if (strcmp(P.init, \"Read_Grid\") != 0) {\n \/\/ write the initial conditions to file\n chprintf(\"Writing initial conditions to file...\\n\");\n WriteData(G, P, nfile);\n }\n \/\/ add one to the output file count\n nfile++;\n #endif \/\/OUTPUT\n \/\/ increment the next output time\n outtime += P.outstep;\n\n #ifdef CPU_TIME\n stop_init = get_time();\n init = stop_init - start_total;\n #ifdef MPI_CHOLLA\n init_min = ReduceRealMin(init);\n init_max = ReduceRealMax(init);\n init_avg = ReduceRealAvg(init);\n chprintf(\"Init min: %9.4f max: %9.4f avg: %9.4f\\n\", init_min, init_max, init_avg);\n #else\n printf(\"Init %9.4f\\n\", init);\n #endif \/\/MPI_CHOLLA\n #endif \/\/CPU_TIME\n\n \/\/ Evolve the grid, one timestep at a time\n chprintf(\"Starting calculations.\\n\");\n while (G.H.t < P.tout)\n \/\/while (G.H.n_step < 1)\n {\n chprintf(\"n_step: %d \\n\", G.H.n_step + 1 );\n \/\/ get the start time\n start_step = get_time();\n \n \/\/ calculate the timestep\n G.set_dt(dti);\n \n #ifdef GRAVITY\n G.set_dt_Gravity();\n #endif\n\n if (G.H.t + G.H.dt > outtime) \n {\n G.H.dt = outtime - G.H.t;\n }\n\n #ifdef MPI_CHOLLA\n G.H.dt = ReduceRealMin(G.H.dt);\n #endif\n \n \n #ifdef PARTICLES\n \/\/Advance the particles KDK( first step )\n G.Advance_Particles( 1 );\n #endif\n \n \/\/ Advance the grid by one timestep\n dti = G.Update_Hydro_Grid();\n \n \/\/ update the simulation time ( t += dt )\n G.Update_Time();\n \n \n #ifdef GRAVITY\n \/\/Compute Gravitational potential for next step\n G.Compute_Gravitational_Potential( &P);\n #endif\n\n \/\/ add one to the timestep count\n G.H.n_step++;\n\n \/\/ set boundary conditions for next time step \n G.Set_Boundary_Conditions_All(P);\n \n #ifdef PARTICLES\n \/\/Advance the particles KDK( second step )\n G.Advance_Particles( 2 );\n #endif\n\n \n #ifdef CPU_TIME\n G.Timer.Print_Times();\n #endif\n\n\n \/\/ get the time to compute the total timestep\n stop_step = get_time();\n stop_total = get_time();\n G.H.t_wall = stop_total-start_total;\n #ifdef MPI_CHOLLA\n G.H.t_wall = ReduceRealMax(G.H.t_wall);\n #endif \n chprintf(\"n_step: %d sim time: %10.7f sim timestep: %7.4e timestep time = %9.3f ms total time = %9.4f s\\n\\n\", \n G.H.n_step, G.H.t, G.H.dt, (stop_step-start_step)*1000, G.H.t_wall);\n\n if (G.H.t == outtime)\n {\n #ifdef OUTPUT\n \/*output the grid data*\/\n WriteData(G, P, nfile);\n \/\/ add one to the output file count\n nfile++;\n #endif \/\/OUTPUT\n \/\/ update to the next output time\n outtime += P.outstep; \n }\n\/*\n \/\/ check for failures\n for (int i=G.H.n_ghost; i<G.H.nx-G.H.n_ghost; i++) {\n for (int j=G.H.n_ghost; j<G.H.ny-G.H.n_ghost; j++) {\n for (int k=G.H.n_ghost; k<G.H.nz-G.H.n_ghost; k++) {\n int id = i + j*G.H.nx + k*G.H.nx*G.H.ny;\n if (G.C.density[id] < 0.0 || G.C.density[id] != G.C.density[id]) {\n printf(\"Failure in cell %d %d %d. Density %e\\n\", i, j, k, G.C.density[id]);\n #ifdef MPI_CHOLLA\n MPI_Finalize();\n chexit(-1);\n #endif\n exit(0);\n }\n }\n }\n }\n*\/ \n\n } \/*end loop over timesteps*\/\n\n \/\/ free the grid\n G.Reset();\n\n #ifdef MPI_CHOLLA\n MPI_Finalize();\n #endif \/*MPI_CHOLLA*\/\n\n return 0;\n\n}\n<commit_msg>commented unnecessary min_dt<commit_after>\/*! \\file main.cpp\n * \\brief Program to run the grid code. *\/\n\n#ifdef MPI_CHOLLA\n#include <mpi.h>\n#include \"mpi_routines.h\"\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string.h>\n#include \"global.h\"\n#include \"grid3D.h\"\n#include \"io.h\"\n#include \"error_handling.h\"\n\n#define OUTPUT\n\/\/#define CPU_TIME\n\nint main(int argc, char *argv[])\n{\n \/\/ timing variables\n double start_total, stop_total, start_step, stop_step;\n #ifdef CPU_TIME\n double stop_init, init_min, init_max, init_avg;\n double start_bound, stop_bound, bound_min, bound_max, bound_avg;\n double start_hydro, stop_hydro, hydro_min, hydro_max, hydro_avg;\n double init, bound, hydro;\n init = bound = hydro = 0;\n #endif \/\/CPU_TIME\n\n \/\/ start the total time\n start_total = get_time();\n\n \/* Initialize MPI communication *\/\n #ifdef MPI_CHOLLA\n InitializeChollaMPI(&argc, &argv);\n #endif \/*MPI_CHOLLA*\/\n\n Real dti = 0; \/\/ inverse time step, 1.0 \/ dt\n\n \/\/ input parameter variables\n char *param_file;\n struct parameters P;\n int nfile = 0; \/\/ number of output files\n Real outtime = 0; \/\/ current output time\n\n\n \/\/ read in command line arguments\n if (argc != 2)\n {\n chprintf(\"usage: %s <parameter_file>\\n\", argv[0]);\n chexit(-1);\n } else {\n param_file = argv[1];\n }\n\n \/\/ create the grid\n Grid3D G;\n\n \/\/ read in the parameters\n parse_params (param_file, &P);\n \/\/ and output to screen\n chprintf (\"Parameter values: nx = %d, ny = %d, nz = %d, tout = %f, init = %s, boundaries = %d %d %d %d %d %d\\n\", \n P.nx, P.ny, P.nz, P.tout, P.init, P.xl_bcnd, P.xu_bcnd, P.yl_bcnd, P.yu_bcnd, P.zl_bcnd, P.zu_bcnd);\n chprintf (\"Output directory: %s\\n\", P.outdir);\n\n\n \/\/ initialize the grid\n G.Initialize(&P);\n chprintf(\"Local number of grid cells: %d %d %d %d\\n\", G.H.nx_real, G.H.ny_real, G.H.nz_real, G.H.n_cells);\n\n\n \/\/ Set initial conditions and calculate first dt\n chprintf(\"Setting initial conditions...\\n\");\n G.Set_Initial_Conditions(P);\n chprintf(\"Initial conditions set.\\n\");\n \/\/ set main variables for Read_Grid inital conditions\n if (strcmp(P.init, \"Read_Grid\") == 0) {\n dti = C_cfl \/ G.H.dt;\n outtime += G.H.t;\n nfile = P.nfile*P.nfull;\n }\n \n #ifdef CPU_TIME\n G.Timer.Initialize();\n #endif\n \n #ifdef GRAVITY\n G.Initialize_Gravity(&P);\n #endif\n \n #ifdef PARTICLES\n G.Initialize_Particles(&P);\n #endif\n\n #ifdef GRAVITY\n G.Compute_Gravitational_Potential( &P);\n #endif\n\n \/\/ set boundary conditions (assign appropriate values to ghost cells)\n chprintf(\"Setting boundary conditions...\\n\");\n G.Set_Boundary_Conditions_All(P);\n chprintf(\"Boundary conditions set.\\n\"); \n \n #ifdef PARTICLES\n G.Get_Particles_Accelration();\n #endif\n\n chprintf(\"Dimensions of each cell: dx = %f dy = %f dz = %f\\n\", G.H.dx, G.H.dy, G.H.dz);\n chprintf(\"Ratio of specific heats gamma = %f\\n\",gama);\n chprintf(\"Nstep = %d Timestep = %f Simulation time = %f\\n\", G.H.n_step, G.H.dt, G.H.t);\n\n\n #ifdef OUTPUT\n if (strcmp(P.init, \"Read_Grid\") != 0) {\n \/\/ write the initial conditions to file\n chprintf(\"Writing initial conditions to file...\\n\");\n WriteData(G, P, nfile);\n }\n \/\/ add one to the output file count\n nfile++;\n #endif \/\/OUTPUT\n \/\/ increment the next output time\n outtime += P.outstep;\n\n #ifdef CPU_TIME\n stop_init = get_time();\n init = stop_init - start_total;\n #ifdef MPI_CHOLLA\n init_min = ReduceRealMin(init);\n init_max = ReduceRealMax(init);\n init_avg = ReduceRealAvg(init);\n chprintf(\"Init min: %9.4f max: %9.4f avg: %9.4f\\n\", init_min, init_max, init_avg);\n #else\n printf(\"Init %9.4f\\n\", init);\n #endif \/\/MPI_CHOLLA\n #endif \/\/CPU_TIME\n\n \/\/ Evolve the grid, one timestep at a time\n chprintf(\"Starting calculations.\\n\");\n while (G.H.t < P.tout)\n \/\/while (G.H.n_step < 1)\n {\n chprintf(\"n_step: %d \\n\", G.H.n_step + 1 );\n \/\/ get the start time\n start_step = get_time();\n \n \/\/ calculate the timestep\n G.set_dt(dti);\n #ifdef GRAVITY\n G.set_dt_Gravity();\n #endif\n\n if (G.H.t + G.H.dt > outtime) \n {\n G.H.dt = outtime - G.H.t;\n }\n\n \/\/ This is not necessary, G.set_dt finds the global max_dti, dt is the same in all processes by now\n \/\/ #ifdef MPI_CHOLLA\n \/\/ G.H.dt = ReduceRealMin(G.H.dt);\n \/\/ #endif\n \n \n #ifdef PARTICLES\n \/\/Advance the particles KDK( first step )\n G.Advance_Particles( 1 );\n #endif\n \n \/\/ Advance the grid by one timestep\n dti = G.Update_Hydro_Grid();\n \n \/\/ update the simulation time ( t += dt )\n G.Update_Time();\n \n \n #ifdef GRAVITY\n \/\/Compute Gravitational potential for next step\n G.Compute_Gravitational_Potential( &P);\n #endif\n\n \/\/ add one to the timestep count\n G.H.n_step++;\n\n \/\/ set boundary conditions for next time step \n G.Set_Boundary_Conditions_All(P);\n \n #ifdef PARTICLES\n \/\/Advance the particles KDK( second step )\n G.Advance_Particles( 2 );\n #endif\n\n \n #ifdef CPU_TIME\n G.Timer.Print_Times();\n #endif\n\n\n \/\/ get the time to compute the total timestep\n stop_step = get_time();\n stop_total = get_time();\n G.H.t_wall = stop_total-start_total;\n #ifdef MPI_CHOLLA\n G.H.t_wall = ReduceRealMax(G.H.t_wall);\n #endif \n chprintf(\"n_step: %d sim time: %10.7f sim timestep: %7.4e timestep time = %9.3f ms total time = %9.4f s\\n\\n\", \n G.H.n_step, G.H.t, G.H.dt, (stop_step-start_step)*1000, G.H.t_wall);\n\n if (G.H.t == outtime)\n {\n #ifdef OUTPUT\n \/*output the grid data*\/\n WriteData(G, P, nfile);\n \/\/ add one to the output file count\n nfile++;\n #endif \/\/OUTPUT\n \/\/ update to the next output time\n outtime += P.outstep; \n }\n\/*\n \/\/ check for failures\n for (int i=G.H.n_ghost; i<G.H.nx-G.H.n_ghost; i++) {\n for (int j=G.H.n_ghost; j<G.H.ny-G.H.n_ghost; j++) {\n for (int k=G.H.n_ghost; k<G.H.nz-G.H.n_ghost; k++) {\n int id = i + j*G.H.nx + k*G.H.nx*G.H.ny;\n if (G.C.density[id] < 0.0 || G.C.density[id] != G.C.density[id]) {\n printf(\"Failure in cell %d %d %d. Density %e\\n\", i, j, k, G.C.density[id]);\n #ifdef MPI_CHOLLA\n MPI_Finalize();\n chexit(-1);\n #endif\n exit(0);\n }\n }\n }\n }\n*\/ \n\n } \/*end loop over timesteps*\/\n\n \/\/ free the grid\n G.Reset();\n\n #ifdef MPI_CHOLLA\n MPI_Finalize();\n #endif \/*MPI_CHOLLA*\/\n\n return 0;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright (C) 2012, 2013 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#include <boost\/thread.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/make_shared.hpp>\n\n#include <qi\/preproc.hpp>\n#include <qi\/log.hpp>\n#include <qi\/application.hpp>\n#include <qi\/threadpool.hpp>\n\n#include <qi\/eventloop.hpp>\n\n#include \"eventloop_p.hpp\"\n\nqiLogCategory(\"qi.eventloop\");\n\nnamespace qi {\n\n EventLoopAsio::EventLoopAsio()\n : _destroyMe(false)\n , _running(false)\n , _threaded(false)\n {\n }\n\n\n void EventLoopAsio::start()\n {\n if (_running || _threaded)\n return;\n _threaded = true;\n _thd = boost::thread(&EventLoopPrivate::run, this);\n while (!_running)\n qi::os::msleep(0);\n }\n\n EventLoopAsio::~EventLoopAsio()\n {\n if (_running && boost::this_thread::get_id() != _id)\n qiLogError() << \"Destroying EventLoopPrivate from itself while running\";\n stop();\n join();\n }\n\n void EventLoopAsio::destroy()\n {\n if (isInEventLoopThread())\n boost::thread(&EventLoopAsio::destroy, this);\n else\n {\n delete this;\n }\n }\n\n void EventLoopAsio::run()\n {\n qiLogDebug() << this << \"run starting\";\n qi::os::setCurrentThreadName(\"eventloop\");\n _running = true;\n _id = boost::this_thread::get_id();\n _work = new boost::asio::io_service::work(_io);\n _io.run();\n bool destroyMe;\n {\n boost::recursive_mutex::scoped_lock sl(_mutex);\n _running = false;\n destroyMe = _destroyMe;\n }\n if (destroyMe)\n delete this;\n }\n\n bool EventLoopAsio::isInEventLoopThread()\n {\n return boost::this_thread::get_id() == _id;\n }\n\n void EventLoopAsio::stop()\n {\n qiLogDebug() << \"stopping eventloopasio: \" << this;\n boost::recursive_mutex::scoped_lock sl(_mutex);\n if (_work)\n {\n delete _work;\n _work = 0;\n }\n }\n\n void EventLoopAsio::join()\n {\n if (boost::this_thread::get_id() == _id)\n {\n qiLogError() << \"Cannot join from within event loop thread\";\n return;\n }\n if (_threaded)\n try {\n _thd.join();\n }\n catch(const boost::thread_resource_error& e)\n {\n qiLogWarning() << \"Join an already joined thread: \" << e.what();\n }\n else\n while (_running)\n qi::os::msleep(0);\n }\n\n void EventLoopAsio::post(uint64_t usDelay, const boost::function<void ()>& cb)\n {\n if (!usDelay)\n _io.post(cb);\n else\n asyncCall(usDelay, cb);\n }\n\n static void invoke_maybe(boost::function<void()> f, qi::Promise<void> p, const boost::system::error_code& erc)\n {\n if (!erc)\n {\n f();\n p.setValue(0);\n }\n else\n p.setError(\"Operation canceled\");\n }\n\n qi::Future<void> EventLoopAsio::asyncCall(uint64_t usDelay, boost::function<void ()> cb)\n {\n boost::shared_ptr<boost::asio::deadline_timer> timer = boost::make_shared<boost::asio::deadline_timer>(boost::ref(_io));\n timer->expires_from_now(boost::posix_time::microseconds(usDelay));\n qi::Promise<void> prom(boost::bind(&boost::asio::deadline_timer::cancel, timer));\n timer->async_wait(boost::bind(&invoke_maybe, cb, prom, _1));\n return prom.future();\n }\n\n\n void* EventLoopAsio::nativeHandle()\n {\n return static_cast<void*>(&_io);\n }\n\n EventLoopThreadPool::EventLoopThreadPool(int minWorkers, int maxWorkers, int minIdleWorkers, int maxIdleWorkers)\n {\n _stopping = false;\n _pool = new ThreadPool(minWorkers, maxWorkers, minIdleWorkers, maxIdleWorkers);\n }\n\n bool EventLoopThreadPool::isInEventLoopThread()\n {\n \/\/ The point is to know if a call will be synchronous. It never is\n \/\/ with thread pool\n return false;\n }\n\n void EventLoopThreadPool::start()\n {\n }\n\n void EventLoopThreadPool::run()\n {\n }\n\n void EventLoopThreadPool::join()\n {\n _pool->waitForAll();\n }\n\n void EventLoopThreadPool::stop()\n {\n _stopping = true;\n }\n\n void* EventLoopThreadPool::nativeHandle()\n {\n return 0;\n }\n\n void EventLoopThreadPool::destroy()\n {\n _stopping = true;\n \/\/ Ensure delete is not called from one of the threads of the event loop\n boost::thread(&EventLoopThreadPool::_destroy, this);\n }\n void EventLoopThreadPool::_destroy()\n {\n delete this;\n }\n\n EventLoopThreadPool::~EventLoopThreadPool()\n {\n delete _pool;\n }\n\n static void delay_call(uint64_t usDelay, boost::function<void()>* callback)\n {\n if (usDelay)\n qi::os::msleep(static_cast<unsigned int>(usDelay\/1000));\n try\n {\n (*callback)();\n }\n catch(const std::exception& e)\n {\n qiLogError() << \"Exception caught in async call: \" << e.what();\n }\n catch(...)\n {\n qiLogError() << \"Unknown exception caught in async call\";\n }\n delete callback;\n }\n\n static void delay_call_notify(uint64_t usDelay, boost::function<void()> callback,\n qi::Promise<void> promise)\n {\n if (usDelay)\n qi::os::msleep(static_cast<unsigned int>(usDelay\/1000));\n try\n {\n callback();\n promise.setValue(0);\n }\n catch(const std::exception& e)\n {\n promise.setError(std::string(\"Exception caught in async call: \") + e.what());\n }\n catch(...)\n {\n promise.setError(\"Unknown exception caught in async call\");\n }\n }\n\n void EventLoopThreadPool::post(uint64_t usDelay,\n const boost::function<void ()>& callback)\n {\n _pool->schedule(boost::bind(&delay_call, usDelay, new boost::function<void ()>(callback)));\n }\n\n qi::Future<void> EventLoopThreadPool::asyncCall(uint64_t usDelay,\n boost::function<void ()> callback)\n {\n if (_stopping)\n return qi::makeFutureError<void>(\"Schedule attempt on destroyed thread pool\");\n qi::Promise<void> promise;\n _pool->schedule(boost::bind(&delay_call_notify, usDelay, callback, promise));\n return promise.future();\n }\n\n \/\/ Basic pimpl bouncers.\n EventLoop::AsyncCallHandle::AsyncCallHandle()\n {\n _p = boost::make_shared<AsyncCallHandlePrivate>();\n }\n\n EventLoop::AsyncCallHandle::~AsyncCallHandle()\n {\n }\n\n void EventLoop::AsyncCallHandle::cancel()\n {\n _p->cancel();\n }\n\n EventLoop::EventLoop()\n : _p(0)\n {\n }\n\n EventLoop::~EventLoop()\n {\n if (_p)\n _p->destroy();\n _p = 0;\n }\n\n #define CHECK_STARTED \\\n do { \\\n if (!_p) \\\n throw std::runtime_error(\"EventLoop \" __HERE \" : EventLoop not started\"); \\\n } while(0)\n\n\n bool EventLoop::isInEventLoopThread()\n {\n CHECK_STARTED;\n return _p->isInEventLoopThread();\n }\n\n void EventLoop::join()\n {\n CHECK_STARTED;\n _p->join();\n }\n\n void EventLoop::start()\n {\n if (_p)\n return;\n _p = new EventLoopAsio();\n _p->start();\n }\n\n void EventLoop::startThreadPool(int minWorkers, int maxWorkers, int minIdleWorkers, int maxIdleWorkers)\n {\n #define OR(name, val) (name==-1?val:name)\n if (_p)\n return;\n _p = new EventLoopThreadPool(OR(minWorkers, 2), OR(maxWorkers, 8), OR(minIdleWorkers,1), OR(maxIdleWorkers, 4));\n #undef OR\n }\n\n\n void EventLoop::stop()\n {\n CHECK_STARTED;\n _p->stop();\n }\n\n void EventLoop::run()\n {\n if (_p)\n return;\n _p = new EventLoopAsio();\n _p->run();\n }\n\n void *EventLoop::nativeHandle() {\n CHECK_STARTED;\n return _p->nativeHandle();\n }\n\n void EventLoop::post(const boost::function<void ()>& callback,uint64_t usDelay)\n {\n CHECK_STARTED;\n _p->post(usDelay, callback);\n }\n\n qi::Future<void>\n EventLoop::async(\n boost::function<void ()> callback,\n uint64_t usDelay)\n {\n CHECK_STARTED;\n return _p->asyncCall(usDelay, callback);\n }\n\n struct MonitorContext\n {\n EventLoop* target;\n EventLoop* helper;\n Future<void> mon;\n bool isFired; \/\/ true: pinging, false: waiting for next ping.\n bool ending;\n uint64_t maxDelay;\n Promise<void> promise;\n int64_t startTime;\n };\n\n static void monitor_pingtimeout(boost::shared_ptr<MonitorContext> ctx)\n {\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON timeout \" << ctx->isFired\n \/\/ << ' ' << (os::ustime() - ctx->startTime);\n if (!ctx->isFired)\n return; \/\/ Got the pong in the meantime, abort\n ctx->promise.setError(\"Event loop monitor timeout\");\n \/* Ping system is still on, but promise is set.\n * So future invocations of cancel() will be ignored, which makes the\n * monitoring unstopable.\n * So reset the value.\n *\/\n ctx->promise.reset();\n }\n\n static void monitor_cancel(qi::Promise<void>, boost::shared_ptr<MonitorContext> ctx)\n {\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON cancel \" << ctx->isFired;\n ctx->ending = true;\n try {\n ctx->mon.cancel();\n }\n catch (...)\n {}\n }\n\n static void monitor_ping(boost::shared_ptr<MonitorContext> ctx)\n {\n if (ctx->ending)\n return;\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON ping \" << ctx->isFired;\n if (ctx->isFired)\n { \/\/ This is a pong\n ctx->isFired = false;\n \/\/ Cancel monitoring async call\n try {\n ctx->mon.cancel();\n }\n catch (const std::exception& \/*e*\/) {\n \/\/qiLogDebug(\"qi.EventLoop\") << \"MON \" << e.what();\n }\n uint64_t pingDelay = os::ustime() - ctx->startTime;\n if (pingDelay > ctx->maxDelay \/ 2)\n qiLogDebug() << \"Long ping \" << pingDelay;\n \/\/ Wait a bit before pinging againg\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON delay \" << ctx->maxDelay;\n ctx->helper->async(boost::bind(&monitor_ping, ctx), ctx->maxDelay*5);\n }\n else\n { \/\/ Delay between pings reached, ping again\n ctx->startTime = os::ustime();\n ctx->isFired = true;\n \/\/ Start monitor async first, or the ping async can trigger before the\n \/\/ monitor async is setup\n ctx->mon = ctx->helper->async(boost::bind(&monitor_pingtimeout, ctx), ctx->maxDelay);\n ctx->target->post(boost::bind(&monitor_ping, ctx));\n assert(ctx->mon.isCanceleable());\n }\n }\n\n qi::Future<void> EventLoop::monitorEventLoop(EventLoop* helper, uint64_t maxDelay)\n {\n \/\/ Context data is a Future*[2]\n boost::shared_ptr<MonitorContext> ctx = boost::make_shared<MonitorContext>();\n ctx->target = this;\n ctx->helper = helper;\n ctx->maxDelay = maxDelay;\n ctx->promise = Promise<void>(boost::bind<void>(&monitor_cancel, _1, ctx));\n ctx->isFired = false;\n ctx->ending = false;\n monitor_ping(ctx);\n return ctx->promise.future();\n }\n\n static void eventloop_stop(EventLoop* ctx)\n {\n ctx->stop();\n delete ctx;\n }\n\n static EventLoop* _netEventLoop = 0;\n static EventLoop* _objEventLoop = 0;\n static EventLoop* _poolEventLoop = 0;\n static double _monitorInterval = 0;\n\n static void monitor_notify(const char* which)\n {\n qiLogError() << which << \" event loop stuck?\";\n }\n static EventLoop* _get(EventLoop* &ctx, bool isPool)\n {\n if (!ctx)\n {\n if (! qi::Application::initialized())\n {\n qiLogInfo() << \"Creating event loop while no qi::Application() is running\";\n }\n ctx = new EventLoop();\n if (isPool)\n ctx->startThreadPool();\n else\n ctx->start();\n Application::atExit(boost::bind(&eventloop_stop, ctx));\n if (!isPool && _netEventLoop && _objEventLoop && _monitorInterval)\n {\n int64_t d = static_cast<qi::int64_t>(_monitorInterval * 1e6);\n _netEventLoop->monitorEventLoop(_objEventLoop, d)\n .connect(boost::bind(&monitor_notify, \"network\"));\n _objEventLoop->monitorEventLoop(_netEventLoop, d)\n .connect(boost::bind(&monitor_notify, \"object\"));\n }\n }\n return ctx;\n }\n\n\n\n EventLoop* getDefaultNetworkEventLoop()\n {\n return _get(_netEventLoop, false);\n }\n\n EventLoop* getDefaultObjectEventLoop()\n {\n return _get(_objEventLoop, false);\n }\n\n EventLoop* getDefaultThreadPoolEventLoop()\n {\n return _get(_poolEventLoop, true);\n }\n static void setMonitorInterval(double v)\n {\n _monitorInterval = v;\n }\n namespace {\n _QI_COMMAND_LINE_OPTIONS(\n \"EventLoop monitoring\",\n (\"loop-monitor-latency\", value<double>()->notifier(&setMonitorInterval), \"Warn if event loop is stuck more than given duration in seconds\")\n )\n }\n}\n<commit_msg>eventloop: force the network eventloop to always run on the same cpu core<commit_after>\/*\n** Copyright (C) 2012, 2013 Aldebaran Robotics\n** See COPYING for the license\n*\/\n\n#include <boost\/thread.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/make_shared.hpp>\n\n#include <qi\/preproc.hpp>\n#include <qi\/log.hpp>\n#include <qi\/application.hpp>\n#include <qi\/threadpool.hpp>\n\n#include <qi\/eventloop.hpp>\n\n#include \"eventloop_p.hpp\"\n\nqiLogCategory(\"qi.eventloop\");\n\nnamespace qi {\n\n EventLoopAsio::EventLoopAsio()\n : _destroyMe(false)\n , _running(false)\n , _threaded(false)\n {\n }\n\n\n void EventLoopAsio::start()\n {\n if (_running || _threaded)\n return;\n _threaded = true;\n _thd = boost::thread(&EventLoopPrivate::run, this);\n while (!_running)\n qi::os::msleep(0);\n }\n\n EventLoopAsio::~EventLoopAsio()\n {\n if (_running && boost::this_thread::get_id() != _id)\n qiLogError() << \"Destroying EventLoopPrivate from itself while running\";\n stop();\n join();\n }\n\n void EventLoopAsio::destroy()\n {\n if (isInEventLoopThread())\n boost::thread(&EventLoopAsio::destroy, this);\n else\n {\n delete this;\n }\n }\n\n void EventLoopAsio::run()\n {\n qiLogDebug() << this << \"run starting\";\n std::string dontusecpuaffinity = qi::os::getenv(\"QI_EVENTLOOP_NO_CPU_AFFINITY\");\n if (dontusecpuaffinity.empty()) {\n std::vector<int> cpus;\n cpus.push_back(0);\n bool ret = qi::os::setCurrentThreadCPUAffinity(cpus);\n qiLogVerbose() << \"AsioEventLoop: Set cpu thread affinity to \" << 1 << \" (\" << ret <<\")\";\n } else {\n qiLogVerbose() << \"AsioEventLoop: Cpu thread affinity not set because QI_EVENTLOOP_NO_CPU_AFFINITY is set.\";\n }\n qi::os::setCurrentThreadName(\"asioeventloop\");\n _running = true;\n _id = boost::this_thread::get_id();\n _work = new boost::asio::io_service::work(_io);\n _io.run();\n bool destroyMe;\n {\n boost::recursive_mutex::scoped_lock sl(_mutex);\n _running = false;\n destroyMe = _destroyMe;\n }\n if (destroyMe)\n delete this;\n }\n\n bool EventLoopAsio::isInEventLoopThread()\n {\n return boost::this_thread::get_id() == _id;\n }\n\n void EventLoopAsio::stop()\n {\n qiLogDebug() << \"stopping eventloopasio: \" << this;\n boost::recursive_mutex::scoped_lock sl(_mutex);\n if (_work)\n {\n delete _work;\n _work = 0;\n }\n }\n\n void EventLoopAsio::join()\n {\n if (boost::this_thread::get_id() == _id)\n {\n qiLogError() << \"Cannot join from within event loop thread\";\n return;\n }\n if (_threaded)\n try {\n _thd.join();\n }\n catch(const boost::thread_resource_error& e)\n {\n qiLogWarning() << \"Join an already joined thread: \" << e.what();\n }\n else\n while (_running)\n qi::os::msleep(0);\n }\n\n void EventLoopAsio::post(uint64_t usDelay, const boost::function<void ()>& cb)\n {\n if (!usDelay)\n _io.post(cb);\n else\n asyncCall(usDelay, cb);\n }\n\n static void invoke_maybe(boost::function<void()> f, qi::Promise<void> p, const boost::system::error_code& erc)\n {\n if (!erc)\n {\n f();\n p.setValue(0);\n }\n else\n p.setError(\"Operation canceled\");\n }\n\n qi::Future<void> EventLoopAsio::asyncCall(uint64_t usDelay, boost::function<void ()> cb)\n {\n boost::shared_ptr<boost::asio::deadline_timer> timer = boost::make_shared<boost::asio::deadline_timer>(boost::ref(_io));\n timer->expires_from_now(boost::posix_time::microseconds(usDelay));\n qi::Promise<void> prom(boost::bind(&boost::asio::deadline_timer::cancel, timer));\n timer->async_wait(boost::bind(&invoke_maybe, cb, prom, _1));\n return prom.future();\n }\n\n\n void* EventLoopAsio::nativeHandle()\n {\n return static_cast<void*>(&_io);\n }\n\n EventLoopThreadPool::EventLoopThreadPool(int minWorkers, int maxWorkers, int minIdleWorkers, int maxIdleWorkers)\n {\n _stopping = false;\n _pool = new ThreadPool(minWorkers, maxWorkers, minIdleWorkers, maxIdleWorkers);\n }\n\n bool EventLoopThreadPool::isInEventLoopThread()\n {\n \/\/ The point is to know if a call will be synchronous. It never is\n \/\/ with thread pool\n return false;\n }\n\n void EventLoopThreadPool::start()\n {\n }\n\n void EventLoopThreadPool::run()\n {\n }\n\n void EventLoopThreadPool::join()\n {\n _pool->waitForAll();\n }\n\n void EventLoopThreadPool::stop()\n {\n _stopping = true;\n }\n\n void* EventLoopThreadPool::nativeHandle()\n {\n return 0;\n }\n\n void EventLoopThreadPool::destroy()\n {\n _stopping = true;\n \/\/ Ensure delete is not called from one of the threads of the event loop\n boost::thread(&EventLoopThreadPool::_destroy, this);\n }\n void EventLoopThreadPool::_destroy()\n {\n delete this;\n }\n\n EventLoopThreadPool::~EventLoopThreadPool()\n {\n delete _pool;\n }\n\n static void delay_call(uint64_t usDelay, boost::function<void()>* callback)\n {\n if (usDelay)\n qi::os::msleep(static_cast<unsigned int>(usDelay\/1000));\n try\n {\n (*callback)();\n }\n catch(const std::exception& e)\n {\n qiLogError() << \"Exception caught in async call: \" << e.what();\n }\n catch(...)\n {\n qiLogError() << \"Unknown exception caught in async call\";\n }\n delete callback;\n }\n\n static void delay_call_notify(uint64_t usDelay, boost::function<void()> callback,\n qi::Promise<void> promise)\n {\n if (usDelay)\n qi::os::msleep(static_cast<unsigned int>(usDelay\/1000));\n try\n {\n callback();\n promise.setValue(0);\n }\n catch(const std::exception& e)\n {\n promise.setError(std::string(\"Exception caught in async call: \") + e.what());\n }\n catch(...)\n {\n promise.setError(\"Unknown exception caught in async call\");\n }\n }\n\n void EventLoopThreadPool::post(uint64_t usDelay,\n const boost::function<void ()>& callback)\n {\n _pool->schedule(boost::bind(&delay_call, usDelay, new boost::function<void ()>(callback)));\n }\n\n qi::Future<void> EventLoopThreadPool::asyncCall(uint64_t usDelay,\n boost::function<void ()> callback)\n {\n if (_stopping)\n return qi::makeFutureError<void>(\"Schedule attempt on destroyed thread pool\");\n qi::Promise<void> promise;\n _pool->schedule(boost::bind(&delay_call_notify, usDelay, callback, promise));\n return promise.future();\n }\n\n \/\/ Basic pimpl bouncers.\n EventLoop::AsyncCallHandle::AsyncCallHandle()\n {\n _p = boost::make_shared<AsyncCallHandlePrivate>();\n }\n\n EventLoop::AsyncCallHandle::~AsyncCallHandle()\n {\n }\n\n void EventLoop::AsyncCallHandle::cancel()\n {\n _p->cancel();\n }\n\n EventLoop::EventLoop()\n : _p(0)\n {\n }\n\n EventLoop::~EventLoop()\n {\n if (_p)\n _p->destroy();\n _p = 0;\n }\n\n #define CHECK_STARTED \\\n do { \\\n if (!_p) \\\n throw std::runtime_error(\"EventLoop \" __HERE \" : EventLoop not started\"); \\\n } while(0)\n\n\n bool EventLoop::isInEventLoopThread()\n {\n CHECK_STARTED;\n return _p->isInEventLoopThread();\n }\n\n void EventLoop::join()\n {\n CHECK_STARTED;\n _p->join();\n }\n\n void EventLoop::start()\n {\n if (_p)\n return;\n _p = new EventLoopAsio();\n _p->start();\n }\n\n void EventLoop::startThreadPool(int minWorkers, int maxWorkers, int minIdleWorkers, int maxIdleWorkers)\n {\n #define OR(name, val) (name==-1?val:name)\n if (_p)\n return;\n _p = new EventLoopThreadPool(OR(minWorkers, 2), OR(maxWorkers, 8), OR(minIdleWorkers,1), OR(maxIdleWorkers, 4));\n #undef OR\n }\n\n\n void EventLoop::stop()\n {\n CHECK_STARTED;\n _p->stop();\n }\n\n void EventLoop::run()\n {\n if (_p)\n return;\n _p = new EventLoopAsio();\n _p->run();\n }\n\n void *EventLoop::nativeHandle() {\n CHECK_STARTED;\n return _p->nativeHandle();\n }\n\n void EventLoop::post(const boost::function<void ()>& callback,uint64_t usDelay)\n {\n CHECK_STARTED;\n _p->post(usDelay, callback);\n }\n\n qi::Future<void>\n EventLoop::async(\n boost::function<void ()> callback,\n uint64_t usDelay)\n {\n CHECK_STARTED;\n return _p->asyncCall(usDelay, callback);\n }\n\n struct MonitorContext\n {\n EventLoop* target;\n EventLoop* helper;\n Future<void> mon;\n bool isFired; \/\/ true: pinging, false: waiting for next ping.\n bool ending;\n uint64_t maxDelay;\n Promise<void> promise;\n int64_t startTime;\n };\n\n static void monitor_pingtimeout(boost::shared_ptr<MonitorContext> ctx)\n {\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON timeout \" << ctx->isFired\n \/\/ << ' ' << (os::ustime() - ctx->startTime);\n if (!ctx->isFired)\n return; \/\/ Got the pong in the meantime, abort\n ctx->promise.setError(\"Event loop monitor timeout\");\n \/* Ping system is still on, but promise is set.\n * So future invocations of cancel() will be ignored, which makes the\n * monitoring unstopable.\n * So reset the value.\n *\/\n ctx->promise.reset();\n }\n\n static void monitor_cancel(qi::Promise<void>, boost::shared_ptr<MonitorContext> ctx)\n {\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON cancel \" << ctx->isFired;\n ctx->ending = true;\n try {\n ctx->mon.cancel();\n }\n catch (...)\n {}\n }\n\n static void monitor_ping(boost::shared_ptr<MonitorContext> ctx)\n {\n if (ctx->ending)\n return;\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON ping \" << ctx->isFired;\n if (ctx->isFired)\n { \/\/ This is a pong\n ctx->isFired = false;\n \/\/ Cancel monitoring async call\n try {\n ctx->mon.cancel();\n }\n catch (const std::exception& \/*e*\/) {\n \/\/qiLogDebug(\"qi.EventLoop\") << \"MON \" << e.what();\n }\n uint64_t pingDelay = os::ustime() - ctx->startTime;\n if (pingDelay > ctx->maxDelay \/ 2)\n qiLogDebug() << \"Long ping \" << pingDelay;\n \/\/ Wait a bit before pinging againg\n \/\/qiLogDebug(\"qi.EventLoop\") << os::ustime() << \" MON delay \" << ctx->maxDelay;\n ctx->helper->async(boost::bind(&monitor_ping, ctx), ctx->maxDelay*5);\n }\n else\n { \/\/ Delay between pings reached, ping again\n ctx->startTime = os::ustime();\n ctx->isFired = true;\n \/\/ Start monitor async first, or the ping async can trigger before the\n \/\/ monitor async is setup\n ctx->mon = ctx->helper->async(boost::bind(&monitor_pingtimeout, ctx), ctx->maxDelay);\n ctx->target->post(boost::bind(&monitor_ping, ctx));\n assert(ctx->mon.isCanceleable());\n }\n }\n\n qi::Future<void> EventLoop::monitorEventLoop(EventLoop* helper, uint64_t maxDelay)\n {\n \/\/ Context data is a Future*[2]\n boost::shared_ptr<MonitorContext> ctx = boost::make_shared<MonitorContext>();\n ctx->target = this;\n ctx->helper = helper;\n ctx->maxDelay = maxDelay;\n ctx->promise = Promise<void>(boost::bind<void>(&monitor_cancel, _1, ctx));\n ctx->isFired = false;\n ctx->ending = false;\n monitor_ping(ctx);\n return ctx->promise.future();\n }\n\n static void eventloop_stop(EventLoop* ctx)\n {\n ctx->stop();\n delete ctx;\n }\n\n static EventLoop* _netEventLoop = 0;\n static EventLoop* _objEventLoop = 0;\n static EventLoop* _poolEventLoop = 0;\n static double _monitorInterval = 0;\n\n static void monitor_notify(const char* which)\n {\n qiLogError() << which << \" event loop stuck?\";\n }\n static EventLoop* _get(EventLoop* &ctx, bool isPool)\n {\n if (!ctx)\n {\n if (! qi::Application::initialized())\n {\n qiLogInfo() << \"Creating event loop while no qi::Application() is running\";\n }\n ctx = new EventLoop();\n if (isPool)\n ctx->startThreadPool();\n else\n ctx->start();\n Application::atExit(boost::bind(&eventloop_stop, ctx));\n if (!isPool && _netEventLoop && _objEventLoop && _monitorInterval)\n {\n int64_t d = static_cast<qi::int64_t>(_monitorInterval * 1e6);\n _netEventLoop->monitorEventLoop(_objEventLoop, d)\n .connect(boost::bind(&monitor_notify, \"network\"));\n _objEventLoop->monitorEventLoop(_netEventLoop, d)\n .connect(boost::bind(&monitor_notify, \"object\"));\n }\n }\n return ctx;\n }\n\n\n\n EventLoop* getDefaultNetworkEventLoop()\n {\n return _get(_netEventLoop, false);\n }\n\n EventLoop* getDefaultObjectEventLoop()\n {\n return _get(_objEventLoop, false);\n }\n\n EventLoop* getDefaultThreadPoolEventLoop()\n {\n return _get(_poolEventLoop, true);\n }\n static void setMonitorInterval(double v)\n {\n _monitorInterval = v;\n }\n namespace {\n _QI_COMMAND_LINE_OPTIONS(\n \"EventLoop monitoring\",\n (\"loop-monitor-latency\", value<double>()->notifier(&setMonitorInterval), \"Warn if event loop is stuck more than given duration in seconds\")\n )\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <terminal.h>\n#include <x86.h>\n#include <stdio.h>\n#include <version.h>\nextern \"C\" void kernel_init()\n{\n\tterminal_init();\n\tprintf(\"Beryllium %s v. %s (%s) \\n\",BERYLLIUM_RELEASE,BERYLLIUM_VERSION,BERYLLIUM_SOURCE);\n\tinit_x86();\n\tasm(\"hlt\");\n}\n<commit_msg>Added cli to fix QEMU OSX Specific Problem<commit_after>#include <terminal.h>\n#include <x86.h>\n#include <stdio.h>\n#include <version.h>\nextern \"C\" void kernel_init()\n{\n\tasm(\"cli\");\n\tterminal_init();\n\tprintf(\"Beryllium %s v. %s (%s) \\n\",BERYLLIUM_RELEASE,BERYLLIUM_VERSION,BERYLLIUM_SOURCE);\n\tinit_x86();\n\tasm(\"hlt\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ RosterDesNurses\n\/\/\n\/\/ Created by J��r��my Omer on 16\/11\/2014.\n\/\/ Copyright (c) 2014 J��r��my Omer. All rights reserved.\n\/\/\n\n#include \"main_test.h\"\n#include \"MyTools.h\"\n#include \"ReadWrite.h\"\n#include \"Solver.h\"\n#include \"Greedy.h\"\n#include <exception>\n#include \"Modeler.h\"\n#include \"MasterProblem.h\"\n\n\/\/initialize the counter of object\nunsigned int MyObject::s_count = 0;\nunsigned int Rotation::s_count = 0;\n\nvoid main_test()\n{\n\ttestFunction_Antoine();\n\t\/\/testFunction_Jeremy();\n\t\/\/testFunction_Samuel();\n}\n\nint main(int argc, char** argv)\n{\n\tstd::cout << \"Number of arguments= \" << argc << std::endl;\n\n\t\/\/ Detect errors in the number of arguments\n\t\/\/\n\tif (argc%2 != 1) {\n\t\tTools::throwError(\"main: There should be an even number of arguments!\");\n\t}\n\telse if (argc > 1 && (argc < 9 || argc > 15)) {\n\t\tTools::throwError(\"main: There is either too many or not enough arguments!\");\n\t}\n\n\t\/\/ During tests, only run some test methods\n\t\/\/\n\tif (argc == 1) {\n\t\tstd::cout << \"Running the test methods...\"<< std::endl;\n\t\t\/\/ Tests functions to check the functions one by one\n\t\tmain_test();\n\t}\n\t\/\/ Nominal behavior of the executable, as required by INRCII\n\t\/\/\n\telse {\n\t\t\/\/ Retrieve the file names in arguments\n\t\t\/\/\n\t\tint narg = 1;\n\t\tstring scenarioFile=\"\", initialHistoryFile=\"\", weekDataFile=\"\", solutionFile=\"\";\n\t\tstring customInputFile=\"\", customOutputFile=\"\", randSeed=\"\";\n\n\t\twhile (narg < argc) {\n\t\t\tstd::cout << \"arg = \" << argv[narg] << \" \" << argv[narg+1] << std::endl;\n\t\t\t\/\/ Attention usine �� gaz: problem with the java simulator that add quote\n\t\t\t\/\/ marks in the arguments, which fucks up the open file methods\n\t\t\t\/\/ the code below is here to remove these quote marks\n\t\t\t\/\/\n\t\t\tstring str(argv[narg+1]);\n\t\t\tstd::size_t found = str.find(\"\\\"\");\n\t\t\twhile (found!=std::string::npos) {\n\t\t\t\tstr.erase(found,1);\n\t\t\t\tfound = str.find(\"\\\"\");\n\t\t\t}\n\n\t\t\tif (!strcmp(argv[narg],\"--sce\")) {\n\t\t\t\tscenarioFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--his\")) {\n\t\t\t\tinitialHistoryFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--week\")) {\n\t\t\t\tweekDataFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--sol\")) {\n\t\t\t\tsolutionFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--cusIn\")) {\n\t\t\t\tcustomInputFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--cusOut\")) {\n\t\t\t\tcustomOutputFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--rand\")) {\n\t\t\t\trandSeed = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tTools::throwError(\"main: the argument does not match the expected list!\");\n\t\t\t}\n\t\t}\n\t\t\/\/ Throw an error if a necessary input file is missing\n\t\tif ( scenarioFile.empty() || initialHistoryFile.empty()\n\t\t\t\t|| weekDataFile.empty() || solutionFile.empty() ) {\n\t\t\tthrow Tools::myException(\"A necessary file name is missing!\",__LINE__);\n\t\t}\n\n\t\t\/\/ Read the input files\n\t\t\/\/\n\t\tScenario* pScen(0);\n\t\tpScen = initializeScenario(scenarioFile,weekDataFile,initialHistoryFile);\n\t\tstd::cout << \"Scenario file is read\\n\";\n\t\tif (!customInputFile.empty()) {\n\t\t\tvector<Demand*> demandHistory;\n\t\t\tdemandHistory.push_back(pScen->pWeekDemand());\n\t\t\tint coWeek = ReadWrite::readCustom(customInputFile, pScen, demandHistory);\n\t\t}\n\n\t\t\/\/ Instantiate the solver class as a test\n\t\t\/\/\n\t\tGreedy* pSolverTest =\n\t\tnew Greedy(pScen, pScen->pWeekDemand(),\tpScen->pWeekPreferences(), pScen->pInitialState());\n\t\tpSolverTest->constructiveGreedy();\n\n\t\t\/\/ Write the solution in the required output format\n\t\t\/\/\n\t\tTools::LogOutput outStream(solutionFile);\n\t\toutStream << pSolverTest->solutionToString();\n\t\tif (!customOutputFile.empty()) {\n\t\t\tReadWrite::writeCustom(customOutputFile,weekDataFile,customInputFile);\n\t\t}\n\t\t\/\/ Todo: the method that writes the history file corresponding to the\n\t\t\/\/ solution\n\t\tstring outputHistoryFile(\"history-week\");\n\t\toutputHistoryFile += std::to_string(pScen->thisWeek()) + \".txt\";\n\t\tstd::cout << \"Output history file: \" << outputHistoryFile << std::endl;\n\n\t\t\/\/ Todo: delete the demand history (careful of not deleting current demand twice)\n\t}\n\n}\n<commit_msg>SR: main<commit_after>\/\/\n\/\/ main.cpp\n\/\/ RosterDesNurses\n\/\/\n\/\/ Created by J��r��my Omer on 16\/11\/2014.\n\/\/ Copyright (c) 2014 J��r��my Omer. All rights reserved.\n\/\/\n\n#include \"main_test.h\"\n#include \"MyTools.h\"\n#include \"ReadWrite.h\"\n#include \"Solver.h\"\n#include \"Greedy.h\"\n#include <exception>\n#include \"Modeler.h\"\n#include \"MasterProblem.h\"\n\n\/\/initialize the counter of object\nunsigned int MyObject::s_count = 0;\nunsigned int Rotation::s_count = 0;\n\nvoid main_test()\n{\n\t\/\/testFunction_Antoine();\n\t\/\/testFunction_Jeremy();\n\ttestFunction_Samuel();\n}\n\nint main(int argc, char** argv)\n{\n\tstd::cout << \"Number of arguments= \" << argc << std::endl;\n\n\t\/\/ Detect errors in the number of arguments\n\t\/\/\n\tif (argc%2 != 1) {\n\t\tTools::throwError(\"main: There should be an even number of arguments!\");\n\t}\n\telse if (argc > 1 && (argc < 9 || argc > 15)) {\n\t\tTools::throwError(\"main: There is either too many or not enough arguments!\");\n\t}\n\n\t\/\/ During tests, only run some test methods\n\t\/\/\n\tif (argc == 1) {\n\t\tstd::cout << \"Running the test methods...\"<< std::endl;\n\t\t\/\/ Tests functions to check the functions one by one\n\t\tmain_test();\n\t}\n\t\/\/ Nominal behavior of the executable, as required by INRCII\n\t\/\/\n\telse {\n\t\t\/\/ Retrieve the file names in arguments\n\t\t\/\/\n\t\tint narg = 1;\n\t\tstring scenarioFile=\"\", initialHistoryFile=\"\", weekDataFile=\"\", solutionFile=\"\";\n\t\tstring customInputFile=\"\", customOutputFile=\"\", randSeed=\"\";\n\n\t\twhile (narg < argc) {\n\t\t\tstd::cout << \"arg = \" << argv[narg] << \" \" << argv[narg+1] << std::endl;\n\t\t\t\/\/ Attention usine �� gaz: problem with the java simulator that add quote\n\t\t\t\/\/ marks in the arguments, which fucks up the open file methods\n\t\t\t\/\/ the code below is here to remove these quote marks\n\t\t\t\/\/\n\t\t\tstring str(argv[narg+1]);\n\t\t\tstd::size_t found = str.find(\"\\\"\");\n\t\t\twhile (found!=std::string::npos) {\n\t\t\t\tstr.erase(found,1);\n\t\t\t\tfound = str.find(\"\\\"\");\n\t\t\t}\n\n\t\t\tif (!strcmp(argv[narg],\"--sce\")) {\n\t\t\t\tscenarioFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--his\")) {\n\t\t\t\tinitialHistoryFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--week\")) {\n\t\t\t\tweekDataFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--sol\")) {\n\t\t\t\tsolutionFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--cusIn\")) {\n\t\t\t\tcustomInputFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--cusOut\")) {\n\t\t\t\tcustomOutputFile = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse if (!strcmp(argv[narg],\"--rand\")) {\n\t\t\t\trandSeed = str;\n\t\t\t\tnarg += 2;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tTools::throwError(\"main: the argument does not match the expected list!\");\n\t\t\t}\n\t\t}\n\t\t\/\/ Throw an error if a necessary input file is missing\n\t\tif ( scenarioFile.empty() || initialHistoryFile.empty()\n\t\t\t\t|| weekDataFile.empty() || solutionFile.empty() ) {\n\t\t\tthrow Tools::myException(\"A necessary file name is missing!\",__LINE__);\n\t\t}\n\n\t\t\/\/ Read the input files\n\t\t\/\/\n\t\tScenario* pScen(0);\n\t\tpScen = initializeScenario(scenarioFile,weekDataFile,initialHistoryFile);\n\t\tstd::cout << \"Scenario file is read\\n\";\n\t\tif (!customInputFile.empty()) {\n\t\t\tvector<Demand*> demandHistory;\n\t\t\tdemandHistory.push_back(pScen->pWeekDemand());\n\t\t\tint coWeek = ReadWrite::readCustom(customInputFile, pScen, demandHistory);\n\t\t}\n\n\t\t\/\/ Instantiate the solver class as a test\n\t\t\/\/\n\t\tGreedy* pSolverTest =\n\t\tnew Greedy(pScen, pScen->pWeekDemand(),\tpScen->pWeekPreferences(), pScen->pInitialState());\n\t\tpSolverTest->constructiveGreedy();\n\n\t\t\/\/ Write the solution in the required output format\n\t\t\/\/\n\t\tTools::LogOutput outStream(solutionFile);\n\t\toutStream << pSolverTest->solutionToString();\n\t\tif (!customOutputFile.empty()) {\n\t\t\tReadWrite::writeCustom(customOutputFile,weekDataFile,customInputFile);\n\t\t}\n\t\t\/\/ Todo: the method that writes the history file corresponding to the\n\t\t\/\/ solution\n\t\tstring outputHistoryFile(\"history-week\");\n\t\toutputHistoryFile += std::to_string(pScen->thisWeek()) + \".txt\";\n\t\tstd::cout << \"Output history file: \" << outputHistoryFile << std::endl;\n\n\t\t\/\/ Todo: delete the demand history (careful of not deleting current demand twice)\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2007 Marc Boris Duerner\n * Copyright (C) 2007 Laurentiu-Gheorghe Crisan\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * As a special exception, you may use this file as part of a free\n * software library without restriction. Specifically, if other files\n * instantiate templates or use macros or inline functions from this\n * file, or you compile this file and link it with other files to\n * produce an executable, this file does not by itself cause the\n * resulting executable to be covered by the GNU General Public\n * License. This exception does not however invalidate any other\n * reasons why the executable file might be covered by the GNU Library\n * General Public License.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n#include \"selectorimpl.h\"\n#include \"cxxtools\/eventloop.h\"\n#include \"cxxtools\/mutex.h\"\n#include \"cxxtools\/log.h\"\n#include <deque>\n\nlog_define(\"cxxtools.eventloop\")\n\nnamespace cxxtools\n{\nnamespace\n{\n struct EvPtr\n {\n Event* ev;\n explicit EvPtr(Event* ev_)\n : ev(ev_)\n { }\n\n ~EvPtr()\n { if (ev) ev->destroy(); }\n\n };\n}\n\nclass EventLoop::Impl\n{\npublic:\n Impl()\n : _exitLoop(false),\n _selector(new SelectorImpl()),\n _eventsPerLoop(16)\n { }\n ~Impl();\n\n bool eventQueueEmpty()\n { return _eventQueue.empty() && _priorityEventQueue.empty() && _activeEventQueue.empty(); }\n\n Event* front()\n {\n if (_priorityEventQueue.empty())\n return _eventQueue.front();\n else\n return _priorityEventQueue.front();\n }\n\n void pop_front()\n {\n if (_priorityEventQueue.empty())\n _eventQueue.pop_front();\n else\n _priorityEventQueue.pop_front();\n }\n\n bool _exitLoop;\n SelectorImpl* _selector;\n std::deque<Event*> _eventQueue;\n std::deque<Event*> _priorityEventQueue;\n std::deque<Event*> _activeEventQueue;\n bool _activeEventQueueIsPriority;\n Mutex _queueMutex;\n unsigned _eventsPerLoop;\n};\n\nEventLoop::Impl::~Impl()\n{\n try\n {\n while ( ! _eventQueue.empty() )\n {\n Event* ev = _eventQueue.front();\n _eventQueue.pop_front();\n ev->destroy();\n }\n\n while ( ! _priorityEventQueue.empty() )\n {\n Event* ev = _priorityEventQueue.front();\n _priorityEventQueue.pop_front();\n ev->destroy();\n }\n\n while ( ! _activeEventQueue.empty() )\n {\n Event* ev = _activeEventQueue.front();\n _activeEventQueue.pop_front();\n if (ev)\n ev->destroy();\n }\n\n }\n catch(...)\n {}\n\n delete _selector;\n}\n\nEventLoop::EventLoop()\n: _impl(new Impl())\n{\n}\n\n\nEventLoop::~EventLoop()\n{\n delete _impl;\n}\n\nunsigned EventLoop::eventsPerLoop()\n{\n return _impl->_eventsPerLoop;\n}\n\nvoid EventLoop::eventsPerLoop(unsigned n)\n{\n _impl->_eventsPerLoop = n;\n}\n\n\nvoid EventLoop::onAdd( Selectable& s )\n{\n return _impl->_selector->add( s );\n}\n\n\nvoid EventLoop::onRemove( Selectable& s )\n{\n _impl->_selector->remove( s );\n}\n\n\nvoid EventLoop::onReinit(Selectable& \/*s*\/)\n{\n}\n\n\nvoid EventLoop::onChanged(Selectable& s)\n{\n _impl->_selector->changed(s);\n}\n\n\nvoid EventLoop::onRun()\n{\n started();\n\n while (true)\n {\n MutexLock lock(_impl->_queueMutex);\n\n if (_impl->_exitLoop)\n {\n _impl->_exitLoop = false;\n break;\n }\n\n bool eventQueueEmpty = _impl->eventQueueEmpty();\n if (!eventQueueEmpty)\n {\n lock.unlock();\n processEvents(_impl->_eventsPerLoop);\n eventQueueEmpty = _impl->eventQueueEmpty();\n }\n\n lock.unlock();\n\n if (eventQueueEmpty)\n {\n idle();\n\n bool active = wait(idleTimeout());\n if (!active)\n timeout.send();\n }\n else\n {\n \/\/ process I\/O events\n wait(0);\n }\n }\n\n exited();\n}\n\n\nbool EventLoop::onWaitUntil(Timespan timeout)\n{\n if (_impl->_selector->waitUntil(timeout))\n {\n MutexLock lock(_impl->_queueMutex);\n\n if (!_impl->eventQueueEmpty())\n {\n lock.unlock();\n processEvents(_impl->_eventsPerLoop);\n }\n\n return true;\n }\n\n return false;\n}\n\n\nvoid EventLoop::onWake()\n{\n _impl->_selector->wake();\n}\n\n\nvoid EventLoop::onExit()\n{\n log_debug(\"exit loop\");\n\n {\n MutexLock lock(_impl->_queueMutex);\n _impl->_exitLoop = true;\n }\n\n wake();\n}\n\nvoid EventLoop::onQueueEvent(const Event& ev, bool priority)\n{\n log_debug(\"queue event\");\n\n MutexLock lock( _impl->_queueMutex );\n\n EvPtr cloned(ev.clone());\n\n if (priority)\n _impl->_priorityEventQueue.push_back(cloned.ev);\n else\n _impl->_eventQueue.push_back(cloned.ev);\n\n cloned.ev = 0;\n}\n\n\nvoid EventLoop::onCommitEvent(const Event& ev, bool priority)\n{\n onQueueEvent(ev, priority);\n _impl->_selector->wake();\n}\n\n\nvoid EventLoop::onProcessEvents(unsigned max)\n{\n unsigned count = 0;\n\n auto& exitLoop = _impl->_exitLoop;\n auto& eventQueue = _impl->_eventQueue;\n auto& priorityEventQueue = _impl->_priorityEventQueue;\n auto& activeEventQueue = _impl->_activeEventQueue;\n auto& activeEventQueueIsPriority = _impl->_activeEventQueueIsPriority;\n auto& queueMutex = _impl->_queueMutex;\n\n log_debug(\"processEvents(max:\" << max << \") normal\/priority\/active(priority): \" << eventQueue.size() << '\/' << priorityEventQueue.size() << '\/' << activeEventQueue.size() << '(' << activeEventQueueIsPriority << ')');\n\n if (!activeEventQueue.empty() && !activeEventQueueIsPriority)\n {\n MutexLock lock(queueMutex);\n if (!priorityEventQueue.empty())\n {\n log_debug(\"priority events bypass active events\");\n\n if (eventQueue.empty())\n {\n eventQueue.swap(activeEventQueue);\n }\n else\n {\n eventQueue.insert(eventQueue.begin(), activeEventQueue.begin(), activeEventQueue.end()); \n activeEventQueue.clear();\n }\n\n priorityEventQueue.swap(activeEventQueue);\n activeEventQueueIsPriority = true;\n }\n }\n\n while (!exitLoop)\n {\n if (activeEventQueue.empty())\n {\n MutexLock lock(queueMutex);\n if (!priorityEventQueue.empty())\n {\n log_debug(\"move \" << priorityEventQueue.size() << \" priority events to active event queue\");\n activeEventQueueIsPriority = true;\n activeEventQueue.swap(priorityEventQueue);\n }\n else if (!eventQueue.empty())\n {\n log_debug(\"move \" << eventQueue.size() << \" events to active event queue\");\n activeEventQueueIsPriority = false;\n activeEventQueue.swap(eventQueue);\n }\n }\n\n if (exitLoop || activeEventQueue.empty())\n {\n log_debug_if(activeEventQueue.empty(), \"no events to process\");\n break;\n }\n\n EvPtr ev(activeEventQueue.front());\n activeEventQueue.pop_front();\n\n ++count;\n\n log_debug(\"send event \" << count);\n event.send(*ev.ev);\n\n if (max != 0 && count >= max)\n {\n log_debug(\"maximum number of events per loop \" << max << \" reached\");\n break;\n }\n }\n}\n\n} \/\/ namespace cxxtools\n<commit_msg>make cxxtools compatible with C++03 again<commit_after>\/*\n * Copyright (C) 2007 Marc Boris Duerner\n * Copyright (C) 2007 Laurentiu-Gheorghe Crisan\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * As a special exception, you may use this file as part of a free\n * software library without restriction. Specifically, if other files\n * instantiate templates or use macros or inline functions from this\n * file, or you compile this file and link it with other files to\n * produce an executable, this file does not by itself cause the\n * resulting executable to be covered by the GNU General Public\n * License. This exception does not however invalidate any other\n * reasons why the executable file might be covered by the GNU Library\n * General Public License.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n#include \"selectorimpl.h\"\n#include \"cxxtools\/eventloop.h\"\n#include \"cxxtools\/mutex.h\"\n#include \"cxxtools\/log.h\"\n#include <deque>\n\nlog_define(\"cxxtools.eventloop\")\n\nnamespace cxxtools\n{\nnamespace\n{\n struct EvPtr\n {\n Event* ev;\n explicit EvPtr(Event* ev_)\n : ev(ev_)\n { }\n\n ~EvPtr()\n { if (ev) ev->destroy(); }\n\n };\n}\n\nclass EventLoop::Impl\n{\npublic:\n Impl()\n : _exitLoop(false),\n _selector(new SelectorImpl()),\n _eventsPerLoop(16)\n { }\n ~Impl();\n\n bool eventQueueEmpty()\n { return _eventQueue.empty() && _priorityEventQueue.empty() && _activeEventQueue.empty(); }\n\n Event* front()\n {\n if (_priorityEventQueue.empty())\n return _eventQueue.front();\n else\n return _priorityEventQueue.front();\n }\n\n void pop_front()\n {\n if (_priorityEventQueue.empty())\n _eventQueue.pop_front();\n else\n _priorityEventQueue.pop_front();\n }\n\n bool _exitLoop;\n SelectorImpl* _selector;\n std::deque<Event*> _eventQueue;\n std::deque<Event*> _priorityEventQueue;\n std::deque<Event*> _activeEventQueue;\n bool _activeEventQueueIsPriority;\n Mutex _queueMutex;\n unsigned _eventsPerLoop;\n};\n\nEventLoop::Impl::~Impl()\n{\n try\n {\n while ( ! _eventQueue.empty() )\n {\n Event* ev = _eventQueue.front();\n _eventQueue.pop_front();\n ev->destroy();\n }\n\n while ( ! _priorityEventQueue.empty() )\n {\n Event* ev = _priorityEventQueue.front();\n _priorityEventQueue.pop_front();\n ev->destroy();\n }\n\n while ( ! _activeEventQueue.empty() )\n {\n Event* ev = _activeEventQueue.front();\n _activeEventQueue.pop_front();\n if (ev)\n ev->destroy();\n }\n\n }\n catch(...)\n {}\n\n delete _selector;\n}\n\nEventLoop::EventLoop()\n: _impl(new Impl())\n{\n}\n\n\nEventLoop::~EventLoop()\n{\n delete _impl;\n}\n\nunsigned EventLoop::eventsPerLoop()\n{\n return _impl->_eventsPerLoop;\n}\n\nvoid EventLoop::eventsPerLoop(unsigned n)\n{\n _impl->_eventsPerLoop = n;\n}\n\n\nvoid EventLoop::onAdd( Selectable& s )\n{\n return _impl->_selector->add( s );\n}\n\n\nvoid EventLoop::onRemove( Selectable& s )\n{\n _impl->_selector->remove( s );\n}\n\n\nvoid EventLoop::onReinit(Selectable& \/*s*\/)\n{\n}\n\n\nvoid EventLoop::onChanged(Selectable& s)\n{\n _impl->_selector->changed(s);\n}\n\n\nvoid EventLoop::onRun()\n{\n started();\n\n while (true)\n {\n MutexLock lock(_impl->_queueMutex);\n\n if (_impl->_exitLoop)\n {\n _impl->_exitLoop = false;\n break;\n }\n\n bool eventQueueEmpty = _impl->eventQueueEmpty();\n if (!eventQueueEmpty)\n {\n lock.unlock();\n processEvents(_impl->_eventsPerLoop);\n eventQueueEmpty = _impl->eventQueueEmpty();\n }\n\n lock.unlock();\n\n if (eventQueueEmpty)\n {\n idle();\n\n bool active = wait(idleTimeout());\n if (!active)\n timeout.send();\n }\n else\n {\n \/\/ process I\/O events\n wait(0);\n }\n }\n\n exited();\n}\n\n\nbool EventLoop::onWaitUntil(Timespan timeout)\n{\n if (_impl->_selector->waitUntil(timeout))\n {\n MutexLock lock(_impl->_queueMutex);\n\n if (!_impl->eventQueueEmpty())\n {\n lock.unlock();\n processEvents(_impl->_eventsPerLoop);\n }\n\n return true;\n }\n\n return false;\n}\n\n\nvoid EventLoop::onWake()\n{\n _impl->_selector->wake();\n}\n\n\nvoid EventLoop::onExit()\n{\n log_debug(\"exit loop\");\n\n {\n MutexLock lock(_impl->_queueMutex);\n _impl->_exitLoop = true;\n }\n\n wake();\n}\n\nvoid EventLoop::onQueueEvent(const Event& ev, bool priority)\n{\n log_debug(\"queue event\");\n\n MutexLock lock( _impl->_queueMutex );\n\n EvPtr cloned(ev.clone());\n\n if (priority)\n _impl->_priorityEventQueue.push_back(cloned.ev);\n else\n _impl->_eventQueue.push_back(cloned.ev);\n\n cloned.ev = 0;\n}\n\n\nvoid EventLoop::onCommitEvent(const Event& ev, bool priority)\n{\n onQueueEvent(ev, priority);\n _impl->_selector->wake();\n}\n\n\nvoid EventLoop::onProcessEvents(unsigned max)\n{\n unsigned count = 0;\n\n bool& exitLoop = _impl->_exitLoop;\n std::deque<Event*>& eventQueue = _impl->_eventQueue;\n std::deque<Event*>& priorityEventQueue = _impl->_priorityEventQueue;\n std::deque<Event*>& activeEventQueue = _impl->_activeEventQueue;\n bool& activeEventQueueIsPriority = _impl->_activeEventQueueIsPriority;\n Mutex& queueMutex = _impl->_queueMutex;\n\n log_debug(\"processEvents(max:\" << max << \") normal\/priority\/active(priority): \" << eventQueue.size() << '\/' << priorityEventQueue.size() << '\/' << activeEventQueue.size() << '(' << activeEventQueueIsPriority << ')');\n\n if (!activeEventQueue.empty() && !activeEventQueueIsPriority)\n {\n MutexLock lock(queueMutex);\n if (!priorityEventQueue.empty())\n {\n log_debug(\"priority events bypass active events\");\n\n if (eventQueue.empty())\n {\n eventQueue.swap(activeEventQueue);\n }\n else\n {\n eventQueue.insert(eventQueue.begin(), activeEventQueue.begin(), activeEventQueue.end()); \n activeEventQueue.clear();\n }\n\n priorityEventQueue.swap(activeEventQueue);\n activeEventQueueIsPriority = true;\n }\n }\n\n while (!exitLoop)\n {\n if (activeEventQueue.empty())\n {\n MutexLock lock(queueMutex);\n if (!priorityEventQueue.empty())\n {\n log_debug(\"move \" << priorityEventQueue.size() << \" priority events to active event queue\");\n activeEventQueueIsPriority = true;\n activeEventQueue.swap(priorityEventQueue);\n }\n else if (!eventQueue.empty())\n {\n log_debug(\"move \" << eventQueue.size() << \" events to active event queue\");\n activeEventQueueIsPriority = false;\n activeEventQueue.swap(eventQueue);\n }\n }\n\n if (exitLoop || activeEventQueue.empty())\n {\n log_debug_if(activeEventQueue.empty(), \"no events to process\");\n break;\n }\n\n EvPtr ev(activeEventQueue.front());\n activeEventQueue.pop_front();\n\n ++count;\n\n log_debug(\"send event \" << count);\n event.send(*ev.ev);\n\n if (max != 0 && count >= max)\n {\n log_debug(\"maximum number of events per loop \" << max << \" reached\");\n break;\n }\n }\n}\n\n} \/\/ namespace cxxtools\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) Oona Räisänen\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n#include \"src\/input.h\"\n\n#include <cassert>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n\n#include \"src\/groups.h\"\n#include \"src\/util.h\"\n\nnamespace redsea {\n\n\/*\n * An MPXReader deals with reading an FM multiplex signal from an audio file or\n * raw PCM via stdin, separating it into channels and converting to chunks of\n * floating-point samples.\n *\n *\/\nMPXReader::MPXReader(const Options& options) :\n input_type_(options.input_type),\n feed_thru_(options.feed_thru),\n sfinfo_({0, 0, 0, 0, 0, 0}) {\n is_eof_ = false;\n\n if (options.input_type == INPUT_MPX_STDIN ||\n options.input_type == INPUT_MPX_SNDFILE) {\n\n if (options.input_type == INPUT_MPX_STDIN) {\n sfinfo_.channels = 1;\n sfinfo_.format = SF_FORMAT_RAW | SF_FORMAT_PCM_16;\n sfinfo_.samplerate = options.samplerate;\n sfinfo_.frames = 0;\n file_ = sf_open_fd(fileno(stdin), SFM_READ, &sfinfo_, SF_TRUE);\n\n outfile_ = sf_open_fd(fileno(stdout), SFM_WRITE, &sfinfo_, SF_TRUE);\n } else if (options.input_type == INPUT_MPX_SNDFILE) {\n file_ = sf_open(options.sndfilename.c_str(), SFM_READ, &sfinfo_);\n }\n\n if (file_ == nullptr) {\n int err = sf_error (file_) ;\n std::cerr << \"error: failed to open file: \" << sf_error_number(err);\n is_eof_ = true;\n } else if (sfinfo_.samplerate < 128000.f) {\n std::cerr << \"error: sample rate must be 128000 Hz or higher\" << '\\n';\n is_eof_ = true;\n } else {\n assert(sfinfo_.channels < static_cast<int>(buffer_.size()));\n used_buffer_size_ =\n (buffer_.size() \/ sfinfo_.channels) * sfinfo_.channels;\n }\n }\n}\n\nMPXReader::~MPXReader() {\n sf_close(file_);\n}\n\nbool MPXReader::eof() const {\n return is_eof_;\n}\n\nstd::vector<float> MPXReader::ReadChunk() {\n std::vector<float> chunk;\n if (is_eof_)\n return chunk;\n\n sf_count_t num_read =\n sf_read_float(file_, buffer_.data(), used_buffer_size_);\n if (num_read < static_cast<long long>(used_buffer_size_))\n is_eof_ = true;\n\n if (sfinfo_.channels == 1) {\n chunk = std::vector<float>(buffer_.begin(), buffer_.end());\n } else {\n chunk = std::vector<float>(num_read \/ sfinfo_.channels);\n for (size_t i = 0; i < chunk.size(); i++)\n chunk[i] = buffer_[i * sfinfo_.channels];\n }\n return chunk;\n}\n\nfloat MPXReader::samplerate() const {\n return sfinfo_.samplerate;\n}\n\nAsciiBitReader::AsciiBitReader(const Options& options) :\n is_eof_(false), feed_thru_(options.feed_thru) {\n}\n\nAsciiBitReader::~AsciiBitReader() {\n}\n\nbool AsciiBitReader::ReadNextBit() {\n int chr = 0;\n while (chr != '0' && chr != '1' && chr != EOF) {\n chr = getchar();\n if (feed_thru_)\n putchar(chr);\n }\n\n if (chr == EOF)\n is_eof_ = true;\n\n return (chr == '1');\n}\n\nbool AsciiBitReader::eof() const {\n return is_eof_;\n}\n\n\/*\n * Read a single line containing an RDS group in the RDS Spy hex format.\n *\n *\/\nGroup ReadNextHexGroup(const Options& options) {\n Group group;\n group.disable_offsets();\n\n bool finished = false;\n\n while (!(finished || std::cin.eof())) {\n std::string line;\n std::getline(std::cin, line);\n if (options.feed_thru)\n std::cout << line << '\\n';\n\n if (line.length() < 16)\n continue;\n\n for (eBlockNumber block_num : {BLOCK1, BLOCK2, BLOCK3, BLOCK4}) {\n uint16_t block_data = 0;\n bool block_still_valid = true;\n\n int nyb = 0;\n while (nyb < 4) {\n if (line.length() < 1) {\n finished = true;\n break;\n }\n\n std::string single = line.substr(0, 1);\n\n if (single != \" \") {\n try {\n int nval = std::stoi(std::string(single), nullptr, 16);\n block_data = (block_data << 4) + nval;\n } catch (std::invalid_argument) {\n block_still_valid = false;\n }\n nyb++;\n }\n line = line.substr(1);\n }\n\n if (block_still_valid)\n group.set(block_num, block_data);\n\n if (block_num == BLOCK4)\n finished = true;\n }\n }\n\n if (options.timestamp)\n group.set_time(std::chrono::system_clock::now());\n\n return group;\n}\n\n} \/\/ namespace redsea\n<commit_msg>feed-thru for audio files<commit_after>\/*\n * Copyright (c) Oona Räisänen\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n#include \"src\/input.h\"\n\n#include <cassert>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n\n#include \"src\/groups.h\"\n#include \"src\/util.h\"\n\nnamespace redsea {\n\n\/*\n * An MPXReader deals with reading an FM multiplex signal from an audio file or\n * raw PCM via stdin, separating it into channels and converting to chunks of\n * floating-point samples.\n *\n *\/\nMPXReader::MPXReader(const Options& options) :\n input_type_(options.input_type),\n feed_thru_(options.feed_thru),\n sfinfo_({0, 0, 0, 0, 0, 0}) {\n is_eof_ = false;\n\n if (options.input_type == INPUT_MPX_STDIN ||\n options.input_type == INPUT_MPX_SNDFILE) {\n\n if (options.input_type == INPUT_MPX_STDIN) {\n sfinfo_.channels = 1;\n sfinfo_.format = SF_FORMAT_RAW | SF_FORMAT_PCM_16;\n sfinfo_.samplerate = options.samplerate;\n sfinfo_.frames = 0;\n file_ = sf_open_fd(fileno(stdin), SFM_READ, &sfinfo_, SF_TRUE);\n } else if (options.input_type == INPUT_MPX_SNDFILE) {\n file_ = sf_open(options.sndfilename.c_str(), SFM_READ, &sfinfo_);\n }\n\n if (file_ == nullptr) {\n int err = sf_error (file_) ;\n std::cerr << \"error: failed to open file: \" << sf_error_number(err);\n is_eof_ = true;\n } else if (sfinfo_.samplerate < 128000.f) {\n std::cerr << \"error: sample rate must be 128000 Hz or higher\" << '\\n';\n is_eof_ = true;\n } else {\n assert(sfinfo_.channels < static_cast<int>(buffer_.size()));\n used_buffer_size_ =\n (buffer_.size() \/ sfinfo_.channels) * sfinfo_.channels;\n\n outfile_ = sf_open_fd(fileno(stdout), SFM_WRITE, &sfinfo_, SF_TRUE);\n }\n }\n}\n\nMPXReader::~MPXReader() {\n sf_close(file_);\n}\n\nbool MPXReader::eof() const {\n return is_eof_;\n}\n\nstd::vector<float> MPXReader::ReadChunk() {\n std::vector<float> chunk;\n if (is_eof_)\n return chunk;\n\n sf_count_t num_read =\n sf_read_float(file_, buffer_.data(), used_buffer_size_);\n if (num_read < static_cast<long long>(used_buffer_size_))\n is_eof_ = true;\n\n if (sfinfo_.channels == 1) {\n chunk = std::vector<float>(buffer_.begin(), buffer_.end());\n } else {\n chunk = std::vector<float>(num_read \/ sfinfo_.channels);\n for (size_t i = 0; i < chunk.size(); i++)\n chunk[i] = buffer_[i * sfinfo_.channels];\n }\n return chunk;\n}\n\nfloat MPXReader::samplerate() const {\n return sfinfo_.samplerate;\n}\n\nAsciiBitReader::AsciiBitReader(const Options& options) :\n is_eof_(false), feed_thru_(options.feed_thru) {\n}\n\nAsciiBitReader::~AsciiBitReader() {\n}\n\nbool AsciiBitReader::ReadNextBit() {\n int chr = 0;\n while (chr != '0' && chr != '1' && chr != EOF) {\n chr = getchar();\n if (feed_thru_)\n putchar(chr);\n }\n\n if (chr == EOF)\n is_eof_ = true;\n\n return (chr == '1');\n}\n\nbool AsciiBitReader::eof() const {\n return is_eof_;\n}\n\n\/*\n * Read a single line containing an RDS group in the RDS Spy hex format.\n *\n *\/\nGroup ReadNextHexGroup(const Options& options) {\n Group group;\n group.disable_offsets();\n\n bool finished = false;\n\n while (!(finished || std::cin.eof())) {\n std::string line;\n std::getline(std::cin, line);\n if (options.feed_thru)\n std::cout << line << '\\n';\n\n if (line.length() < 16)\n continue;\n\n for (eBlockNumber block_num : {BLOCK1, BLOCK2, BLOCK3, BLOCK4}) {\n uint16_t block_data = 0;\n bool block_still_valid = true;\n\n int nyb = 0;\n while (nyb < 4) {\n if (line.length() < 1) {\n finished = true;\n break;\n }\n\n std::string single = line.substr(0, 1);\n\n if (single != \" \") {\n try {\n int nval = std::stoi(std::string(single), nullptr, 16);\n block_data = (block_data << 4) + nval;\n } catch (std::invalid_argument) {\n block_still_valid = false;\n }\n nyb++;\n }\n line = line.substr(1);\n }\n\n if (block_still_valid)\n group.set(block_num, block_data);\n\n if (block_num == BLOCK4)\n finished = true;\n }\n }\n\n if (options.timestamp)\n group.set_time(std::chrono::system_clock::now());\n\n return group;\n}\n\n} \/\/ namespace redsea\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) Burator 2014-2015\n#include <QDir>\n#include <QFile>\n#include <QImage>\n#include <QDebug>\n#include <QString>\n#include <QDateTime>\n#include <QFileInfo>\n#include <QByteArray>\n#include <QStringList>\n#include <QCoreApplication>\n#include <QCommandLineParser>\n\n#include <cmath>\n\n#include \"Util.h\"\n#include \"Types.h\"\n#include \"Global.h\"\n#include \"Version.h\"\n#include \"FaceDetector.h\"\n\nB_USE_NAMESPACE\n\n\/\/ Show console output.\nstatic const bool showOutput = true;\n\n\/\/ Show debug\/info output.\nstatic const bool showDebug = true;\n\nvoid msgHandler(QtMsgType type, const QMessageLogContext &ctx,\n const QString &msg);\n\nint main(int argc, char **argv) {\n\tQCoreApplication app(argc, argv);\n\tQCoreApplication::setApplicationName(\"Blurator\");\n\tQCoreApplication::setApplicationVersion(versionString());\n\n qInstallMessageHandler(msgHandler);\n\n QCommandLineParser parser;\n parser.setApplicationDescription(\"Blur license plates and faces.\");\n parser.addHelpOption();\n parser.addVersionOption();\n parser.addPositionalArgument(\"paths\", \"Paths to images.\", \"paths..\");\n\n \/\/ Face detection option\n QCommandLineOption detectFaces(QStringList() << \"f\" << \"faces\",\n \"Detect faces.\");\n parser.addOption(detectFaces);\n\n \/\/ License plate detection option\n QCommandLineOption detectPlates(QStringList() << \"p\" << \"plates\",\n \"Detect license plates.\");\n parser.addOption(detectPlates);\n\n \/\/ Reply \"yes\" to everything option\n QCommandLineOption replyYes(QStringList() << \"y\" << \"yes\",\n \"Automatically reply \\\"yes\\\" to all questions.\");\n parser.addOption(replyYes);\n\n \/\/ Reply \"no\" to everything option\n QCommandLineOption replyNo(QStringList() << \"n\" << \"no\",\n \"Automatically reply \\\"no\\\" to all questions.\");\n parser.addOption(replyNo);\n \n \/\/ No-backup file option\n QCommandLineOption noBackupFile(QStringList() << \"no-backup\",\n \"Don't store a backup of the original image.\");\n parser.addOption(noBackupFile);\n\n parser.process(app);\n const QStringList args = parser.positionalArguments();\n\n \/\/ Check optional command line options\n bool dFaces = parser.isSet(detectFaces);\n bool dPlates = parser.isSet(detectPlates);\n bool rYes = parser.isSet(replyYes);\n bool rNo = parser.isSet(replyNo);\n bool noBackup = parser.isSet(noBackupFile);\n\n \/\/ Ensure the arguments are passed.\n if (args.isEmpty()) {\n \tqCritical() << \"Must provide paths to images!\";\n \treturn -1;\n }\n\n if (!dPlates && !dFaces) {\n qCritical() << \"Must choose to detect plates and\/or faces!\";\n return -1;\n }\n\n if (rYes && rNo) {\n qCritical() << \"Can't both say yes and no to everything!\";\n return -1;\n }\n\n \/\/ If non-null then the boolean value means reply \"yes\" for true and\n \/\/ \"no\" for false.\n BoolPtr autoReplyYes(nullptr);\n if (rYes || rNo) {\n autoReplyYes.reset(new bool);\n *autoReplyYes = rYes;\n }\n\n \/\/ Find all images from the arguments.\n QStringList images;\n foreach (const QString &path, args) {\n QFileInfo fi(path);\n if (!fi.exists()) {\n qWarning() << \"Ignoring nonexistent file:\" << path;\n continue;\n }\n\n if (fi.isFile() && Util::isSupportedImage(path)) {\n images << path;\n }\n else if (fi.isDir()) {\n qWarning() << \"Ignoring folder:\" << path;\n }\n }\n\n if (images.isEmpty()) {\n qCritical() << \"Found no supported images to process!\";\n return -1;\n }\n\n if (noBackup) {\n qWarning() << \"Warning no backup files will be created!\";\n }\n\n QDateTime startDate = QDateTime::currentDateTime();\n\n const int size = images.size();\n const int fwidth = ceil(log10(size));\n qint64 faceCnt = 0;\n for (int i = 0; i < size; i++) {\n const QString &path = images[i];\n QString msg = QString(\"%1%2\")\n .arg(size > 1 ? QString(\"[%1\/%2] \").arg(i+1, fwidth).arg(size) : \"\")\n .arg(\"Processing\");\n qDebug() << qPrintable(msg) << path;\n\n if (dFaces) {\n QFile f(path);\n if (!f.open(QIODevice::ReadOnly)) {\n qCritical() << \"Could not read from image file!\";\n return -1;\n }\n QByteArray imageData = f.readAll();\n f.close();\n\n MatPtr image = Util::imageToMat(imageData);\n if (image == nullptr) {\n qCritical() << \"Invalid image!\";\n return -1;\n }\n\n FaceDetector detector;\n if (!detector.isValid()) {\n qCritical() << \"Could not setup facial detector.\";\n return -1;\n }\n\n QList<FacePtr> faces = detector.detect(image);\n if (faces.isEmpty()) {\n continue;\n }\n\n faceCnt += faces.size();\n qDebug() << \"Found\" << faces.size() << \"face(s).\";\n qDebug() << faces;\n\n \/\/ Render face overlays to an image file to visualize the result.\n if (!faces.isEmpty()) {\n QImage overlay = QImage::fromData(imageData);\n Util::drawFaces(overlay, faces);\n\n \/\/ Save original to backup file.\n if (!noBackup) {\n QString bpath = Util::getBackupPath(path);\n if (QFile::copy(path, bpath)) {\n qDebug() << \"Saved backup:\" << bpath;\n }\n else {\n qWarning() << \"Could not save backup:\" << bpath;\n if (!Util::askProceed(\"Do you want to proceed?\", autoReplyYes.get())) {\n qWarning() << \"Aborting..\";\n return -1;\n }\n }\n }\n\n if (overlay.save(path)) {\n qDebug() << \"Saved face overlays:\" << path;\n }\n else {\n qCritical() << \"Could not save overlays\";\n }\n }\n }\n\n \/\/ TODO: Plate detection\n if (dPlates) {\n qCritical() << \"Plate detection not implemented yet!\";\n return -1;\n }\n }\n\n qint64 elapsed = startDate.msecsTo(QDateTime::currentDateTime());\n\n qDebug() << endl << \"Time elapsed:\" << qPrintable(Util::formatTime(elapsed));\n if (size > 1) {\n qDebug() << \"Time per image:\" << qPrintable(Util::formatTime(elapsed \/ size));\n }\n qDebug() << \"Faces found:\" << faceCnt;\n if (size > 1) {\n qDebug() << \"Faces per image:\" << double(faceCnt) \/ double(size);\n }\n\n return 0;\n}\n\nvoid msgHandler(QtMsgType type, const QMessageLogContext &ctx,\n const QString &msg) {\n if (!showOutput) return;\n\n QTextStream stream(stdout);\n\n switch (type) {\n case QtDebugMsg:\n if (showDebug) {\n if (QString(msg) == \"\") {\n stream << endl;\n return;\n }\n stream << msg << endl;\n }\n break;\n\n case QtWarningMsg:\n stream << \"(W) \" << msg << endl;\n break;\n\n case QtCriticalMsg:\n stream << \"(E) \" << msg << endl;\n break;\n\n case QtFatalMsg:\n stream << \"(F) \" << msg << endl;\n abort();\n }\n}\n<commit_msg>Implemeneted new output that updates the same line for progress smartly.<commit_after>\/\/ Copyright (c) Burator 2014-2015\n#include <QDir>\n#include <QFile>\n#include <QImage>\n#include <QDebug>\n#include <QString>\n#include <QDateTime>\n#include <QFileInfo>\n#include <QByteArray>\n#include <QStringList>\n#include <QCoreApplication>\n#include <QCommandLineParser>\n\n#include <cmath>\n#include <iostream>\n\n#include \"Util.h\"\n#include \"Types.h\"\n#include \"Global.h\"\n#include \"Version.h\"\n#include \"FaceDetector.h\"\n\nB_USE_NAMESPACE\n\n\/\/ Show console output.\nstatic const bool showOutput = true;\n\n\/\/ Show debug\/info output.\nstatic const bool showDebug = true;\n\nvoid msgHandler(QtMsgType type, const QMessageLogContext &ctx,\n const QString &msg);\n\nint main(int argc, char **argv) {\n\tQCoreApplication app(argc, argv);\n\tQCoreApplication::setApplicationName(\"Blurator\");\n\tQCoreApplication::setApplicationVersion(versionString());\n\n qInstallMessageHandler(msgHandler);\n\n QCommandLineParser parser;\n parser.setApplicationDescription(\"Blur license plates and faces.\");\n parser.addHelpOption();\n parser.addVersionOption();\n parser.addPositionalArgument(\"paths\", \"Paths to images.\", \"paths..\");\n\n \/\/ Face detection option\n QCommandLineOption detectFaces(QStringList() << \"f\" << \"faces\",\n \"Detect faces.\");\n parser.addOption(detectFaces);\n\n \/\/ License plate detection option\n QCommandLineOption detectPlates(QStringList() << \"p\" << \"plates\",\n \"Detect license plates.\");\n parser.addOption(detectPlates);\n\n \/\/ Reply \"yes\" to everything option\n QCommandLineOption replyYes(QStringList() << \"y\" << \"yes\",\n \"Automatically reply \\\"yes\\\" to all questions.\");\n parser.addOption(replyYes);\n\n \/\/ Reply \"no\" to everything option\n QCommandLineOption replyNo(QStringList() << \"n\" << \"no\",\n \"Automatically reply \\\"no\\\" to all questions.\");\n parser.addOption(replyNo);\n \n \/\/ No-backup file option\n QCommandLineOption noBackupFile(QStringList() << \"no-backup\",\n \"Don't store a backup of the original image.\");\n parser.addOption(noBackupFile);\n\n parser.process(app);\n const QStringList args = parser.positionalArguments();\n\n \/\/ Check optional command line options\n bool dFaces = parser.isSet(detectFaces);\n bool dPlates = parser.isSet(detectPlates);\n bool rYes = parser.isSet(replyYes);\n bool rNo = parser.isSet(replyNo);\n bool noBackup = parser.isSet(noBackupFile);\n\n \/\/ Ensure the arguments are passed.\n if (args.isEmpty()) {\n \tqCritical() << \"Must provide paths to images!\";\n \treturn -1;\n }\n\n if (!dPlates && !dFaces) {\n qCritical() << \"Must choose to detect plates and\/or faces!\";\n return -1;\n }\n\n if (rYes && rNo) {\n qCritical() << \"Can't both say yes and no to everything!\";\n return -1;\n }\n\n \/\/ If non-null then the boolean value means reply \"yes\" for true and\n \/\/ \"no\" for false.\n BoolPtr autoReplyYes(nullptr);\n if (rYes || rNo) {\n autoReplyYes.reset(new bool);\n *autoReplyYes = rYes;\n }\n\n \/\/ Find all images from the arguments.\n QStringList images;\n foreach (const QString &path, args) {\n QFileInfo fi(path);\n if (!fi.exists()) {\n qWarning() << \"Ignoring nonexistent file:\" << path;\n continue;\n }\n\n if (fi.isFile() && Util::isSupportedImage(path)) {\n images << path;\n }\n else if (fi.isDir()) {\n qWarning() << \"Ignoring folder:\" << path;\n }\n }\n\n if (images.isEmpty()) {\n qCritical() << \"Found no supported images to process!\";\n return -1;\n }\n\n if (noBackup) {\n qWarning() << \"Warning no backup files will be created!\";\n }\n\n QDateTime startDate = QDateTime::currentDateTime();\n\n const int size = images.size();\n const int fwidth = ceil(log10(size));\n qint64 faceCnt = 0, faceTot = 0;\n for (int i = 0; i < size; i++) {\n const QString &path = images[i];\n\n if (dFaces) {\n QFile f(path);\n if (!f.open(QIODevice::ReadOnly)) {\n qCritical() << \"Could not read from image file!\";\n return -1;\n }\n QByteArray imageData = f.readAll();\n f.close();\n\n MatPtr image = Util::imageToMat(imageData);\n if (image == nullptr) {\n qCritical() << \"Invalid image!\";\n return -1;\n }\n\n FaceDetector detector;\n if (!detector.isValid()) {\n qCritical() << \"Could not setup facial detector.\";\n return -1;\n }\n\n QList<FacePtr> faces = detector.detect(image);\n faceCnt = faces.size();\n\n if (faces.isEmpty()) {\n goto updateProgress;\n }\n\n faceTot += faceCnt;\n\n \/\/ Render face overlays to an image file to visualize the result.\n if (!faces.isEmpty()) {\n QImage overlay = QImage::fromData(imageData);\n Util::drawFaces(overlay, faces);\n\n \/\/ Save original to backup file.\n if (!noBackup) {\n QString bpath = Util::getBackupPath(path);\n if (!QFile::copy(path, bpath)) {\n qWarning() << \"Could not save backup:\" << bpath;\n if (!Util::askProceed(\"Do you want to proceed?\", autoReplyYes.get())) {\n qWarning() << \"Aborting..\";\n return -1;\n }\n }\n }\n\n if (!overlay.save(path)) {\n qCritical() << \"Could not save overlays\";\n }\n }\n }\n\n \/\/ TODO: Plate detection\n if (dPlates) {\n qCritical() << \"Plate detection not implemented yet!\";\n return -1;\n }\n\n updateProgress:\n static int lastLen = 0;\n\n float progress = float(i+1) \/ float(size) * 100.0;\n\n QDateTime now = QDateTime::currentDateTime();\n qint64 elapsed = startDate.msecsTo(now);\n qint64 left = ((100.0 \/ progress) * elapsed) - elapsed;\n\n bool last = (i+1 == size);\n\n QString line1 = QString(\"Processed %1: %2 faces\")\n .arg(path).arg(faceCnt);\n\n QString line2 = QString(\"[ %3\/%4 (%5%) | %6 faces | %7 %8 ]\")\n .arg(i+1).arg(size).arg(progress, 0, 'f', 1).arg(faceTot)\n .arg(!last ? Util::formatTime(left) : Util::formatTime(elapsed))\n .arg(!last ? \"left\" : \"elapsed\");\n\n QString msg = QString(\"%1\\n%2\").arg(line1).arg(line2);\n\n \/\/ Rewind to beginning and output message. If at second line or\n \/\/ latter then overwrite everything with empty spaces to \"blank\"\n \/\/ out so no traces are left if the new lines are longer than\n \/\/ the last ones.\n {\n using namespace std;\n cout << '\\r';\n if (i > 0) {\n cout << QString(lastLen, ' ').toStdString() << '\\r';\n }\n cout << msg.toStdString();\n cout.flush();\n }\n\n lastLen = msg.size();\n }\n\n return 0;\n}\n\nvoid msgHandler(QtMsgType type, const QMessageLogContext &ctx,\n const QString &msg) {\n if (!showOutput) return;\n\n QTextStream stream(stdout);\n\n switch (type) {\n case QtDebugMsg:\n if (showDebug) {\n if (QString(msg) == \"\") {\n stream << endl;\n return;\n }\n stream << msg << endl;\n }\n break;\n\n case QtWarningMsg:\n stream << \"(W) \" << msg << endl;\n break;\n\n case QtCriticalMsg:\n stream << \"(E) \" << msg << endl;\n break;\n\n case QtFatalMsg:\n stream << \"(F) \" << msg << endl;\n abort();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"filetransfer.hh\"\n#include \"cache.hh\"\n#include \"fetchers.hh\"\n#include \"globals.hh\"\n#include \"store-api.hh\"\n#include \"types.hh\"\n#include \"url-parts.hh\"\n\n#include <nlohmann\/json.hpp>\n\nnamespace nix::fetchers {\n\nstruct DownloadUrl\n{\n std::string url;\n std::optional<std::pair<std::string, std::string>> access_token_header;\n\n DownloadUrl(const std::string & url)\n : url(url) { }\n\n DownloadUrl(const std::string & url, const std::pair<std::string, std::string> & access_token_header)\n : url(url), access_token_header(access_token_header) { }\n};\n\n\/\/ A github or gitlab host\nconst static std::string hostRegexS = \"[a-zA-Z0-9.]*\"; \/\/ FIXME: check\nstd::regex hostRegex(hostRegexS, std::regex::ECMAScript);\n\nstruct GitArchiveInputScheme : InputScheme\n{\n virtual std::string type() = 0;\n\n virtual std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const = 0;\n\n std::optional<Input> inputFromURL(const ParsedURL & url) override\n {\n if (url.scheme != type()) return {};\n\n auto path = tokenizeString<std::vector<std::string>>(url.path, \"\/\");\n\n std::optional<Hash> rev;\n std::optional<std::string> ref;\n std::optional<std::string> host_url;\n\n if (path.size() == 2) {\n } else if (path.size() == 3) {\n if (std::regex_match(path[2], revRegex))\n rev = Hash::parseAny(path[2], htSHA1);\n else if (std::regex_match(path[2], refRegex))\n ref = path[2];\n else\n throw BadURL(\"in URL '%s', '%s' is not a commit hash or branch\/tag name\", url.url, path[2]);\n } else\n throw BadURL(\"URL '%s' is invalid\", url.url);\n\n for (auto &[name, value] : url.query) {\n if (name == \"rev\") {\n if (rev)\n throw BadURL(\"URL '%s' contains multiple commit hashes\", url.url);\n rev = Hash::parseAny(value, htSHA1);\n }\n else if (name == \"ref\") {\n if (!std::regex_match(value, refRegex))\n throw BadURL(\"URL '%s' contains an invalid branch\/tag name\", url.url);\n if (ref)\n throw BadURL(\"URL '%s' contains multiple branch\/tag names\", url.url);\n ref = value;\n }\n else if (name == \"host\") {\n if (!std::regex_match(value, hostRegex))\n throw BadURL(\"URL '%s' contains an invalid instance host\", url.url);\n host_url = value;\n }\n \/\/ FIXME: barf on unsupported attributes\n }\n\n if (ref && rev)\n throw BadURL(\"URL '%s' contains both a commit hash and a branch\/tag name %s %s\", url.url, *ref, rev->gitRev());\n\n Input input;\n input.attrs.insert_or_assign(\"type\", type());\n input.attrs.insert_or_assign(\"owner\", path[0]);\n input.attrs.insert_or_assign(\"repo\", path[1]);\n if (rev) input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n if (ref) input.attrs.insert_or_assign(\"ref\", *ref);\n if (host_url) input.attrs.insert_or_assign(\"host\", *host_url);\n\n return input;\n }\n\n std::optional<Input> inputFromAttrs(const Attrs & attrs) override\n {\n if (maybeGetStrAttr(attrs, \"type\") != type()) return {};\n\n for (auto & [name, value] : attrs)\n if (name != \"type\" && name != \"owner\" && name != \"repo\" && name != \"ref\" && name != \"rev\" && name != \"narHash\" && name != \"lastModified\" && name != \"host\")\n throw Error(\"unsupported input attribute '%s'\", name);\n\n getStrAttr(attrs, \"owner\");\n getStrAttr(attrs, \"repo\");\n\n Input input;\n input.attrs = attrs;\n return input;\n }\n\n ParsedURL toURL(const Input & input) override\n {\n auto owner = getStrAttr(input.attrs, \"owner\");\n auto repo = getStrAttr(input.attrs, \"repo\");\n auto ref = input.getRef();\n auto rev = input.getRev();\n auto path = owner + \"\/\" + repo;\n assert(!(ref && rev));\n if (ref) path += \"\/\" + *ref;\n if (rev) path += \"\/\" + rev->to_string(Base16, false);\n return ParsedURL {\n .scheme = type(),\n .path = path,\n };\n }\n\n bool hasAllInfo(const Input & input) override\n {\n return input.getRev() && maybeGetIntAttr(input.attrs, \"lastModified\");\n }\n\n Input applyOverrides(\n const Input & _input,\n std::optional<std::string> ref,\n std::optional<Hash> rev) override\n {\n auto input(_input);\n if (rev && ref)\n throw BadURL(\"cannot apply both a commit hash (%s) and a branch\/tag name ('%s') to input '%s'\",\n rev->gitRev(), *ref, input.to_string());\n if (rev) {\n input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n input.attrs.erase(\"ref\");\n }\n if (ref) {\n input.attrs.insert_or_assign(\"ref\", *ref);\n input.attrs.erase(\"rev\");\n }\n return input;\n }\n\n virtual Hash getRevFromRef(nix::ref<Store> store, const Input & input) const = 0;\n\n virtual DownloadUrl getDownloadUrl(const Input & input) const = 0;\n\n std::pair<Tree, Input> fetch(ref<Store> store, const Input & _input) override\n {\n Input input(_input);\n\n if (!maybeGetStrAttr(input.attrs, \"ref\")) input.attrs.insert_or_assign(\"ref\", \"HEAD\");\n\n auto rev = input.getRev();\n if (!rev) rev = getRevFromRef(store, input);\n\n input.attrs.erase(\"ref\");\n input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n\n Attrs immutableAttrs({\n {\"type\", \"git-tarball\"},\n {\"rev\", rev->gitRev()},\n });\n\n if (auto res = getCache()->lookup(store, immutableAttrs)) {\n input.attrs.insert_or_assign(\"lastModified\", getIntAttr(res->first, \"lastModified\"));\n return {\n Tree(store->toRealPath(res->second), std::move(res->second)),\n input\n };\n }\n\n auto url = getDownloadUrl(input);\n\n Headers headers;\n if (url.access_token_header) {\n headers.push_back(*url.access_token_header);\n }\n\n auto [tree, lastModified] = downloadTarball(store, url.url, headers, \"source\", true);\n\n input.attrs.insert_or_assign(\"lastModified\", lastModified);\n\n getCache()->add(\n store,\n immutableAttrs,\n {\n {\"rev\", rev->gitRev()},\n {\"lastModified\", lastModified}\n },\n tree.storePath,\n true);\n\n return {std::move(tree), input};\n }\n};\n\nstruct GitHubInputScheme : GitArchiveInputScheme\n{\n std::string type() override { return \"github\"; }\n\n std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const {\n return std::pair<std::string, std::string>(\"Authorization\", fmt(\"token %s\", token));\n }\n\n Hash getRevFromRef(nix::ref<Store> store, const Input & input) const override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"github.com\");\n auto url = fmt(\"https:\/\/api.%s\/repos\/%s\/%s\/commits\/%s\", \/\/ FIXME: check\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"), *input.getRef());\n\n Headers headers;\n std::string accessToken = settings.githubAccessToken.get();\n if (accessToken != \"\")\n headers.push_back(accessHeaderFromToken(accessToken));\n\n auto json = nlohmann::json::parse(\n readFile(\n store->toRealPath(\n downloadFile(store, url, headers, \"source\", false).storePath)));\n auto rev = Hash::parseAny(std::string { json[\"sha\"] }, htSHA1);\n debug(\"HEAD revision for '%s' is %s\", url, rev.gitRev());\n return rev;\n }\n\n DownloadUrl getDownloadUrl(const Input & input) const override\n {\n \/\/ FIXME: use regular \/archive URLs instead? api.github.com\n \/\/ might have stricter rate limits.\n auto host_url = maybeGetStrAttr(input.attrs, \"host\").value_or(\"github.com\");\n auto url = fmt(\"https:\/\/api.%s\/repos\/%s\/%s\/tarball\/%s\", \/\/ FIXME: check if this is correct for self hosted instances\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"),\n input.getRev()->to_string(Base16, false));\n\n std::string accessToken = settings.githubAccessToken.get();\n if (accessToken != \"\") {\n auto auth_header = accessHeaderFromToken(accessToken);\n return DownloadUrl(url, auth_header);\n } else {\n return DownloadUrl(url);\n }\n }\n\n void clone(const Input & input, const Path & destDir) override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"github.com\");\n Input::fromURL(fmt(\"git+ssh:\/\/git@%s\/%s\/%s.git\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\")))\n .applyOverrides(input.getRef().value_or(\"HEAD\"), input.getRev())\n .clone(destDir);\n }\n};\n\nstruct GitLabInputScheme : GitArchiveInputScheme\n{\n std::string type() override { return \"gitlab\"; }\n\n std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const {\n return std::pair<std::string, std::string>(\"Authorization\", fmt(\"Bearer %s\", token));\n }\n\n Hash getRevFromRef(nix::ref<Store> store, const Input & input) const override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"host\").value_or(\"gitlab.com\");\n auto url = fmt(\"https:\/\/%s\/api\/v4\/projects\/%s%%2F%s\/repository\/commits?ref_name=%s\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"), *input.getRef());\n\n Headers headers;\n std::string accessToken = settings.gitlabAccessToken.get();\n if (accessToken != \"\")\n headers.push_back(accessHeaderFromToken(accessToken));\n\n auto json = nlohmann::json::parse(\n readFile(\n store->toRealPath(\n downloadFile(store, url, headers, \"source\", false).storePath)));\n auto rev = Hash::parseAny(std::string(json[0][\"id\"]), htSHA1);\n debug(\"HEAD revision for '%s' is %s\", url, rev.gitRev());\n return rev;\n }\n\n DownloadUrl getDownloadUrl(const Input & input) const override\n {\n \/\/ FIXME: This endpoint has a rate limit threshold of 5 requests per minute\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"gitlab.com\");\n auto url = fmt(\"https:\/\/%s\/api\/v4\/projects\/%s%%2F%s\/repository\/archive.tar.gz?sha=%s\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"),\n input.getRev()->to_string(Base16, false));\n\n std::string accessToken = settings.gitlabAccessToken.get();\n if (accessToken != \"\") {\n auto auth_header = accessHeaderFromToken(accessToken);\n return DownloadUrl(url, auth_header);\n } else {\n return DownloadUrl(url);\n }\n\n }\n\n void clone(const Input & input, const Path & destDir) override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"gitlab.com\");\n \/\/ FIXME: get username somewhere\n Input::fromURL(fmt(\"git+ssh:\/\/git@%s\/%s\/%s.git\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\")))\n .applyOverrides(input.getRef().value_or(\"HEAD\"), input.getRev())\n .clone(destDir);\n }\n};\n\nstatic auto r1 = OnStartup([] { registerInputScheme(std::make_unique<GitHubInputScheme>()); });\nstatic auto r2 = OnStartup([] { registerInputScheme(std::make_unique<GitLabInputScheme>()); });\n\n}\n<commit_msg>Cleanup<commit_after>#include \"filetransfer.hh\"\n#include \"cache.hh\"\n#include \"fetchers.hh\"\n#include \"globals.hh\"\n#include \"store-api.hh\"\n#include \"types.hh\"\n#include \"url-parts.hh\"\n\n#include <nlohmann\/json.hpp>\n\nnamespace nix::fetchers {\n\nstruct DownloadUrl\n{\n std::string url;\n std::optional<std::pair<std::string, std::string>> access_token_header;\n};\n\n\/\/ A github or gitlab host\nconst static std::string hostRegexS = \"[a-zA-Z0-9.]*\"; \/\/ FIXME: check\nstd::regex hostRegex(hostRegexS, std::regex::ECMAScript);\n\nstruct GitArchiveInputScheme : InputScheme\n{\n virtual std::string type() = 0;\n\n virtual std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const = 0;\n\n std::optional<Input> inputFromURL(const ParsedURL & url) override\n {\n if (url.scheme != type()) return {};\n\n auto path = tokenizeString<std::vector<std::string>>(url.path, \"\/\");\n\n std::optional<Hash> rev;\n std::optional<std::string> ref;\n std::optional<std::string> host_url;\n\n if (path.size() == 2) {\n } else if (path.size() == 3) {\n if (std::regex_match(path[2], revRegex))\n rev = Hash::parseAny(path[2], htSHA1);\n else if (std::regex_match(path[2], refRegex))\n ref = path[2];\n else\n throw BadURL(\"in URL '%s', '%s' is not a commit hash or branch\/tag name\", url.url, path[2]);\n } else\n throw BadURL(\"URL '%s' is invalid\", url.url);\n\n for (auto &[name, value] : url.query) {\n if (name == \"rev\") {\n if (rev)\n throw BadURL(\"URL '%s' contains multiple commit hashes\", url.url);\n rev = Hash::parseAny(value, htSHA1);\n }\n else if (name == \"ref\") {\n if (!std::regex_match(value, refRegex))\n throw BadURL(\"URL '%s' contains an invalid branch\/tag name\", url.url);\n if (ref)\n throw BadURL(\"URL '%s' contains multiple branch\/tag names\", url.url);\n ref = value;\n }\n else if (name == \"host\") {\n if (!std::regex_match(value, hostRegex))\n throw BadURL(\"URL '%s' contains an invalid instance host\", url.url);\n host_url = value;\n }\n \/\/ FIXME: barf on unsupported attributes\n }\n\n if (ref && rev)\n throw BadURL(\"URL '%s' contains both a commit hash and a branch\/tag name %s %s\", url.url, *ref, rev->gitRev());\n\n Input input;\n input.attrs.insert_or_assign(\"type\", type());\n input.attrs.insert_or_assign(\"owner\", path[0]);\n input.attrs.insert_or_assign(\"repo\", path[1]);\n if (rev) input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n if (ref) input.attrs.insert_or_assign(\"ref\", *ref);\n if (host_url) input.attrs.insert_or_assign(\"host\", *host_url);\n\n return input;\n }\n\n std::optional<Input> inputFromAttrs(const Attrs & attrs) override\n {\n if (maybeGetStrAttr(attrs, \"type\") != type()) return {};\n\n for (auto & [name, value] : attrs)\n if (name != \"type\" && name != \"owner\" && name != \"repo\" && name != \"ref\" && name != \"rev\" && name != \"narHash\" && name != \"lastModified\" && name != \"host\")\n throw Error(\"unsupported input attribute '%s'\", name);\n\n getStrAttr(attrs, \"owner\");\n getStrAttr(attrs, \"repo\");\n\n Input input;\n input.attrs = attrs;\n return input;\n }\n\n ParsedURL toURL(const Input & input) override\n {\n auto owner = getStrAttr(input.attrs, \"owner\");\n auto repo = getStrAttr(input.attrs, \"repo\");\n auto ref = input.getRef();\n auto rev = input.getRev();\n auto path = owner + \"\/\" + repo;\n assert(!(ref && rev));\n if (ref) path += \"\/\" + *ref;\n if (rev) path += \"\/\" + rev->to_string(Base16, false);\n return ParsedURL {\n .scheme = type(),\n .path = path,\n };\n }\n\n bool hasAllInfo(const Input & input) override\n {\n return input.getRev() && maybeGetIntAttr(input.attrs, \"lastModified\");\n }\n\n Input applyOverrides(\n const Input & _input,\n std::optional<std::string> ref,\n std::optional<Hash> rev) override\n {\n auto input(_input);\n if (rev && ref)\n throw BadURL(\"cannot apply both a commit hash (%s) and a branch\/tag name ('%s') to input '%s'\",\n rev->gitRev(), *ref, input.to_string());\n if (rev) {\n input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n input.attrs.erase(\"ref\");\n }\n if (ref) {\n input.attrs.insert_or_assign(\"ref\", *ref);\n input.attrs.erase(\"rev\");\n }\n return input;\n }\n\n virtual Hash getRevFromRef(nix::ref<Store> store, const Input & input) const = 0;\n\n virtual DownloadUrl getDownloadUrl(const Input & input) const = 0;\n\n std::pair<Tree, Input> fetch(ref<Store> store, const Input & _input) override\n {\n Input input(_input);\n\n if (!maybeGetStrAttr(input.attrs, \"ref\")) input.attrs.insert_or_assign(\"ref\", \"HEAD\");\n\n auto rev = input.getRev();\n if (!rev) rev = getRevFromRef(store, input);\n\n input.attrs.erase(\"ref\");\n input.attrs.insert_or_assign(\"rev\", rev->gitRev());\n\n Attrs immutableAttrs({\n {\"type\", \"git-tarball\"},\n {\"rev\", rev->gitRev()},\n });\n\n if (auto res = getCache()->lookup(store, immutableAttrs)) {\n input.attrs.insert_or_assign(\"lastModified\", getIntAttr(res->first, \"lastModified\"));\n return {\n Tree(store->toRealPath(res->second), std::move(res->second)),\n input\n };\n }\n\n auto url = getDownloadUrl(input);\n\n Headers headers;\n if (url.access_token_header) {\n headers.push_back(*url.access_token_header);\n }\n\n auto [tree, lastModified] = downloadTarball(store, url.url, headers, \"source\", true);\n\n input.attrs.insert_or_assign(\"lastModified\", lastModified);\n\n getCache()->add(\n store,\n immutableAttrs,\n {\n {\"rev\", rev->gitRev()},\n {\"lastModified\", lastModified}\n },\n tree.storePath,\n true);\n\n return {std::move(tree), input};\n }\n};\n\nstruct GitHubInputScheme : GitArchiveInputScheme\n{\n std::string type() override { return \"github\"; }\n\n std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const {\n return std::pair<std::string, std::string>(\"Authorization\", fmt(\"token %s\", token));\n }\n\n Hash getRevFromRef(nix::ref<Store> store, const Input & input) const override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"github.com\");\n auto url = fmt(\"https:\/\/api.%s\/repos\/%s\/%s\/commits\/%s\", \/\/ FIXME: check\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"), *input.getRef());\n\n Headers headers;\n std::string accessToken = settings.githubAccessToken.get();\n if (accessToken != \"\")\n headers.push_back(accessHeaderFromToken(accessToken));\n\n auto json = nlohmann::json::parse(\n readFile(\n store->toRealPath(\n downloadFile(store, url, headers, \"source\", false).storePath)));\n auto rev = Hash::parseAny(std::string { json[\"sha\"] }, htSHA1);\n debug(\"HEAD revision for '%s' is %s\", url, rev.gitRev());\n return rev;\n }\n\n DownloadUrl getDownloadUrl(const Input & input) const override\n {\n \/\/ FIXME: use regular \/archive URLs instead? api.github.com\n \/\/ might have stricter rate limits.\n auto host_url = maybeGetStrAttr(input.attrs, \"host\").value_or(\"github.com\");\n auto url = fmt(\"https:\/\/api.%s\/repos\/%s\/%s\/tarball\/%s\", \/\/ FIXME: check if this is correct for self hosted instances\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"),\n input.getRev()->to_string(Base16, false));\n\n std::string accessToken = settings.githubAccessToken.get();\n if (accessToken != \"\") {\n auto auth_header = accessHeaderFromToken(accessToken);\n return DownloadUrl { url, auth_header };\n } else {\n return DownloadUrl { url };\n }\n }\n\n void clone(const Input & input, const Path & destDir) override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"github.com\");\n Input::fromURL(fmt(\"git+ssh:\/\/git@%s\/%s\/%s.git\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\")))\n .applyOverrides(input.getRef().value_or(\"HEAD\"), input.getRev())\n .clone(destDir);\n }\n};\n\nstruct GitLabInputScheme : GitArchiveInputScheme\n{\n std::string type() override { return \"gitlab\"; }\n\n std::pair<std::string, std::string> accessHeaderFromToken(const std::string & token) const {\n return std::pair<std::string, std::string>(\"Authorization\", fmt(\"Bearer %s\", token));\n }\n\n Hash getRevFromRef(nix::ref<Store> store, const Input & input) const override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"host\").value_or(\"gitlab.com\");\n auto url = fmt(\"https:\/\/%s\/api\/v4\/projects\/%s%%2F%s\/repository\/commits?ref_name=%s\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"), *input.getRef());\n\n Headers headers;\n std::string accessToken = settings.gitlabAccessToken.get();\n if (accessToken != \"\")\n headers.push_back(accessHeaderFromToken(accessToken));\n\n auto json = nlohmann::json::parse(\n readFile(\n store->toRealPath(\n downloadFile(store, url, headers, \"source\", false).storePath)));\n auto rev = Hash::parseAny(std::string(json[0][\"id\"]), htSHA1);\n debug(\"HEAD revision for '%s' is %s\", url, rev.gitRev());\n return rev;\n }\n\n DownloadUrl getDownloadUrl(const Input & input) const override\n {\n \/\/ FIXME: This endpoint has a rate limit threshold of 5 requests per minute\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"gitlab.com\");\n auto url = fmt(\"https:\/\/%s\/api\/v4\/projects\/%s%%2F%s\/repository\/archive.tar.gz?sha=%s\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\"),\n input.getRev()->to_string(Base16, false));\n\n std::string accessToken = settings.gitlabAccessToken.get();\n if (accessToken != \"\") {\n auto auth_header = accessHeaderFromToken(accessToken);\n return DownloadUrl { url, auth_header };\n } else {\n return DownloadUrl { url };\n }\n\n }\n\n void clone(const Input & input, const Path & destDir) override\n {\n auto host_url = maybeGetStrAttr(input.attrs, \"url\").value_or(\"gitlab.com\");\n \/\/ FIXME: get username somewhere\n Input::fromURL(fmt(\"git+ssh:\/\/git@%s\/%s\/%s.git\",\n host_url, getStrAttr(input.attrs, \"owner\"), getStrAttr(input.attrs, \"repo\")))\n .applyOverrides(input.getRef().value_or(\"HEAD\"), input.getRev())\n .clone(destDir);\n }\n};\n\nstatic auto r1 = OnStartup([] { registerInputScheme(std::make_unique<GitHubInputScheme>()); });\nstatic auto r2 = OnStartup([] { registerInputScheme(std::make_unique<GitLabInputScheme>()); });\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"xmldoc.h\"\n\n#include <vector>\n\n#include \"libcellml\/component.h\"\n#include \"libcellml\/generator.h\"\n#include \"libcellml\/model.h\"\n#include \"libcellml\/validator.h\"\n\nnamespace libcellml{\n\nstruct GeneratorVariable\n{\n};\n\ntypedef std::shared_ptr<GeneratorVariable> GeneratorVariablePtr;\n\nstruct Generator::GeneratorImpl\n{\n bool mWithNames;\n\n std::vector<GeneratorVariablePtr> mStates;\n std::vector<GeneratorVariablePtr> mVariables;\n\n size_t mathmlChildCount(const XmlNodePtr &node) const;\n XmlNodePtr mathmlChildNode(const XmlNodePtr &node, int index) const;\n\n void processNode(const XmlNodePtr &node);\n};\n\nsize_t Generator::GeneratorImpl::mathmlChildCount(const XmlNodePtr &node) const\n{\n \/\/ Return the number of child elements, in the MathML namespace, for the\n \/\/ given node\n\n size_t res = 0;\n XmlNodePtr childNode = node->getFirstChild();\n\n while (childNode != nullptr) {\n if (childNode->isMathmlElement()) {\n ++res;\n }\n\n childNode = childNode->getNext();\n }\n\n return res;\n}\n\nXmlNodePtr Generator::GeneratorImpl::mathmlChildNode(const XmlNodePtr &node, int index) const\n{\n \/\/ Return the nth child element of the given node, skipping anything that is\n \/\/ not int he MathML namespace\n\n \/\/ Retrieve the first MathML node, if it exists\n\n XmlNodePtr res = node->getFirstChild();\n\n while (res && !res->isMathmlElement()) {\n res = res->getNext();\n }\n\n \/\/ Retrieve the nth MathML element, if it exists\n\n int nodeIndex = 0;\n\n while (res && (nodeIndex != index)) {\n while (res && !res->isMathmlElement()) {\n res = res->getNext();\n }\n\n ++nodeIndex;\n }\n\n return res;\n}\n\nvoid Generator::GeneratorImpl::processNode(const XmlNodePtr &node)\n{\n(void) node;\n\n\/\/TODO\n}\n\nGenerator::Generator()\n : mPimpl(new GeneratorImpl())\n{\n}\n\nGenerator::~Generator()\n{\n delete mPimpl;\n}\n\nGenerator::Generator(const Generator &rhs)\n : Logger(rhs)\n , mPimpl(new GeneratorImpl())\n{\n mPimpl->mStates = rhs.mPimpl->mStates;\n mPimpl->mVariables = rhs.mPimpl->mVariables;\n}\n\nGenerator::Generator(Generator &&rhs)\n : Logger(std::move(rhs))\n , mPimpl(rhs.mPimpl)\n{\n rhs.mPimpl = nullptr;\n}\n\nGenerator& Generator::operator=(Generator rhs)\n{\n Logger::operator =(rhs);\n rhs.swap(*this);\n return *this;\n}\n\nvoid Generator::swap(Generator &rhs)\n{\n std::swap(this->mPimpl, rhs.mPimpl);\n}\n\nvoid Generator::processModel(const ModelPtr &model)\n{\n \/\/ Make sure that the model is valid before processing it\n\/*TODO: reenable the validation once it is known to work fine...\n libcellml::Validator validator;\n\n validator.validateModel(model);\n\n if (validator.errorCount() > 0) {\n \/\/ The model is not valid, so retrieve the validation errors and keep a\n \/\/ copy of them\n\n for (size_t i = 0; i < validator.errorCount(); ++i)\n addError(validator.getError(i));\n\n return;\n }\n*\/\n \/\/ Determine the order in which equations should be executed by processing\n \/\/ each of the components in the given model\n\n for (size_t i = 0; i < model->componentCount(); ++i) {\n \/\/ Retrieve the math string associated with the given component and\n \/\/ process it, one equation at a time\n \/\/ Note: at this stage, we know the model is valid, so no point in\n \/\/ revalidating the math string...\n\n ComponentPtr component = model->getComponent(i);\n XmlDocPtr xmlDoc = std::make_shared<XmlDoc>();\n std::string math = component->getMath();\n\n xmlDoc->parse(math);\n\n XmlNodePtr mathNode = xmlDoc->getRootNode();\n\n for (XmlNodePtr node = mathNode->getFirstChild();\n node != nullptr; node = node->getNext()) {\n mPimpl->processNode(node);\n }\n }\n}\n\nvoid Generator::setWithNames(bool withNames)\n{\n mPimpl->mWithNames = withNames;\n}\n\nsize_t Generator::stateCount() const\n{\n return mPimpl->mStates.size();\n}\n\nsize_t Generator::rateCount() const\n{\n return stateCount();\n}\n\nsize_t Generator::variableCount() const\n{\n return mPimpl->mVariables.size();\n}\n\nstd::string Generator::initializeVariables() const\n{\n return \"\";\n}\n\nstd::string Generator::computeConstantEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeRateEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeAlgebraicEquations() const\n{\n return \"\";\n}\n\n}\n<commit_msg>Generator: skeleton of the GeneratorEquation and GeneratorEquationBinTree classes.<commit_after>\/*\nCopyright libCellML Contributors\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*\/\n\n#include \"xmldoc.h\"\n\n#include <vector>\n\n#include \"libcellml\/component.h\"\n#include \"libcellml\/generator.h\"\n#include \"libcellml\/model.h\"\n#include \"libcellml\/validator.h\"\n\nnamespace libcellml{\n\nclass GeneratorEquationBinTree;\ntypedef std::shared_ptr<GeneratorEquationBinTree> GeneratorEquationBinTreePtr;\n\nclass GeneratorEquationBinTree\n{\npublic:\n explicit GeneratorEquationBinTree();\n\n GeneratorEquationBinTreePtr &left();\n GeneratorEquationBinTreePtr &right();\n\nprivate:\n GeneratorEquationBinTreePtr mLeft;\n GeneratorEquationBinTreePtr mRight;\n};\n\nGeneratorEquationBinTree::GeneratorEquationBinTree()\n : mLeft(nullptr)\n , mRight(nullptr)\n{\n}\n\nGeneratorEquationBinTreePtr &GeneratorEquationBinTree::left()\n{\n return mLeft;\n}\n\nGeneratorEquationBinTreePtr &GeneratorEquationBinTree::right()\n{\n return mRight;\n}\n\nclass GeneratorEquation;\ntypedef std::shared_ptr<GeneratorEquation> GeneratorEquationPtr;\n\nclass GeneratorEquation\n{\npublic:\n explicit GeneratorEquation();\n\n const GeneratorEquationBinTreePtr &binTree() const;\n\nprivate:\n GeneratorEquationBinTreePtr mBinTree;\n};\n\nGeneratorEquation::GeneratorEquation()\n : mBinTree(std::make_shared<GeneratorEquationBinTree>())\n{\n}\n\nconst GeneratorEquationBinTreePtr &GeneratorEquation::binTree() const\n{\n return mBinTree;\n}\n\nstruct GeneratorVariable\n{\n};\n\ntypedef std::shared_ptr<GeneratorVariable> GeneratorVariablePtr;\n\nstruct Generator::GeneratorImpl\n{\n bool mWithNames;\n\n std::vector<GeneratorVariablePtr> mStates;\n std::vector<GeneratorVariablePtr> mVariables;\n\n size_t mathmlChildCount(const XmlNodePtr &node) const;\n XmlNodePtr mathmlChildNode(const XmlNodePtr &node, int index) const;\n\n void processNode(const XmlNodePtr &node);\n};\n\nsize_t Generator::GeneratorImpl::mathmlChildCount(const XmlNodePtr &node) const\n{\n \/\/ Return the number of child elements, in the MathML namespace, for the\n \/\/ given node\n\n size_t res = 0;\n XmlNodePtr childNode = node->getFirstChild();\n\n while (childNode != nullptr) {\n if (childNode->isMathmlElement()) {\n ++res;\n }\n\n childNode = childNode->getNext();\n }\n\n return res;\n}\n\nXmlNodePtr Generator::GeneratorImpl::mathmlChildNode(const XmlNodePtr &node, int index) const\n{\n \/\/ Return the nth child element of the given node, skipping anything that is\n \/\/ not int he MathML namespace\n\n \/\/ Retrieve the first MathML node, if it exists\n\n XmlNodePtr res = node->getFirstChild();\n\n while (res && !res->isMathmlElement()) {\n res = res->getNext();\n }\n\n \/\/ Retrieve the nth MathML element, if it exists\n\n int nodeIndex = 0;\n\n while (res && (nodeIndex != index)) {\n while (res && !res->isMathmlElement()) {\n res = res->getNext();\n }\n\n ++nodeIndex;\n }\n\n return res;\n}\n\nvoid Generator::GeneratorImpl::processNode(const XmlNodePtr &node)\n{\n(void) node;\n\n\/\/TODO\n}\n\nGenerator::Generator()\n : mPimpl(new GeneratorImpl())\n{\n}\n\nGenerator::~Generator()\n{\n delete mPimpl;\n}\n\nGenerator::Generator(const Generator &rhs)\n : Logger(rhs)\n , mPimpl(new GeneratorImpl())\n{\n mPimpl->mStates = rhs.mPimpl->mStates;\n mPimpl->mVariables = rhs.mPimpl->mVariables;\n}\n\nGenerator::Generator(Generator &&rhs)\n : Logger(std::move(rhs))\n , mPimpl(rhs.mPimpl)\n{\n rhs.mPimpl = nullptr;\n}\n\nGenerator& Generator::operator=(Generator rhs)\n{\n Logger::operator =(rhs);\n rhs.swap(*this);\n return *this;\n}\n\nvoid Generator::swap(Generator &rhs)\n{\n std::swap(this->mPimpl, rhs.mPimpl);\n}\n\nvoid Generator::processModel(const ModelPtr &model)\n{\n \/\/ Make sure that the model is valid before processing it\n\/*TODO: reenable the validation once it is known to work fine...\n libcellml::Validator validator;\n\n validator.validateModel(model);\n\n if (validator.errorCount() > 0) {\n \/\/ The model is not valid, so retrieve the validation errors and keep a\n \/\/ copy of them\n\n for (size_t i = 0; i < validator.errorCount(); ++i)\n addError(validator.getError(i));\n\n return;\n }\n*\/\n \/\/ Determine the order in which equations should be executed by processing\n \/\/ each of the components in the given model\n\n for (size_t i = 0; i < model->componentCount(); ++i) {\n \/\/ Retrieve the math string associated with the given component and\n \/\/ process it, one equation at a time\n \/\/ Note: at this stage, we know the model is valid, so no point in\n \/\/ revalidating the math string...\n\n ComponentPtr component = model->getComponent(i);\n XmlDocPtr xmlDoc = std::make_shared<XmlDoc>();\n std::string math = component->getMath();\n\n xmlDoc->parse(math);\n\n XmlNodePtr mathNode = xmlDoc->getRootNode();\n\n for (XmlNodePtr node = mathNode->getFirstChild();\n node != nullptr; node = node->getNext()) {\n mPimpl->processNode(node);\n }\n }\n}\n\nvoid Generator::setWithNames(bool withNames)\n{\n mPimpl->mWithNames = withNames;\n}\n\nsize_t Generator::stateCount() const\n{\n return mPimpl->mStates.size();\n}\n\nsize_t Generator::rateCount() const\n{\n return stateCount();\n}\n\nsize_t Generator::variableCount() const\n{\n return mPimpl->mVariables.size();\n}\n\nstd::string Generator::initializeVariables() const\n{\n return \"\";\n}\n\nstd::string Generator::computeConstantEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeRateEquations() const\n{\n return \"\";\n}\n\nstd::string Generator::computeAlgebraicEquations() const\n{\n return \"\";\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <memory>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <functional>\n#include <utility>\n#include <unordered_map>\n#include <vector>\n#include <nan.h>\n#include <v8.h>\n#include <uv.h>\n\n#include \"log.h\"\n#include \"queue.h\"\n#include \"status.h\"\n#include \"result.h\"\n#include \"worker\/worker_thread.h\"\n\nusing v8::Local;\nusing v8::Value;\nusing v8::Object;\nusing v8::String;\nusing v8::Number;\nusing v8::Uint32;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Array;\nusing std::shared_ptr;\nusing std::unique_ptr;\nusing std::string;\nusing std::ostringstream;\nusing std::endl;\nusing std::unordered_map;\nusing std::vector;\nusing std::move;\nusing std::make_pair;\n\nstatic void handle_events_helper(uv_async_t *handle);\n\nclass Main {\npublic:\n Main() : worker_thread{&event_handler}\n {\n int err;\n\n next_command_id = 0;\n next_channel_id = NULL_CHANNEL_ID + 1;\n\n err = uv_async_init(uv_default_loop(), &event_handler, handle_events_helper);\n if (err) return;\n\n worker_thread.run();\n }\n\n Result<> send_worker_command(\n const CommandAction action,\n const std::string &&root,\n unique_ptr<Nan::Callback> callback,\n ChannelID channel_id = NULL_CHANNEL_ID\n )\n {\n CommandID command_id = next_command_id;\n\n CommandPayload command_payload(next_command_id, action, move(root), channel_id);\n Message command_message(move(command_payload));\n\n pending_callbacks.emplace(command_id, move(callback));\n\n next_command_id++;\n\n LOGGER << \"Sending command \" << command_message << \" to worker thread.\" << endl;\n return worker_thread.send(move(command_message));\n }\n\n void use_main_log_file(string &&main_log_file)\n {\n Logger::to_file(main_log_file.c_str());\n }\n\n void disable_main_log()\n {\n Logger::disable();\n }\n\n Result<> use_worker_log_file(string &&worker_log_file, unique_ptr<Nan::Callback> callback)\n {\n return send_worker_command(COMMAND_LOG_FILE, move(worker_log_file), move(callback));\n }\n\n Result<> disable_worker_log(unique_ptr<Nan::Callback> callback)\n {\n return send_worker_command(COMMAND_LOG_DISABLE, \"\", move(callback));\n }\n\n Result<> watch(string &&root, unique_ptr<Nan::Callback> ack_callback, unique_ptr<Nan::Callback> event_callback)\n {\n ChannelID channel_id = next_channel_id;\n next_channel_id++;\n\n channel_callbacks.emplace(channel_id, move(event_callback));\n\n return send_worker_command(COMMAND_ADD, move(root), move(ack_callback), channel_id);\n }\n\n Result<> unwatch(ChannelID channel_id, unique_ptr<Nan::Callback> ack_callback)\n {\n string root;\n Result<> r = send_worker_command(COMMAND_REMOVE, move(root), move(ack_callback), channel_id);\n\n auto maybe_event_callback = channel_callbacks.find(channel_id);\n if (maybe_event_callback == channel_callbacks.end()) {\n LOGGER << \"Channel \" << channel_id << \" already has no event callback.\" << endl;\n return ok_result();\n }\n channel_callbacks.erase(maybe_event_callback);\n return r;\n }\n\n void handle_events()\n {\n Nan::HandleScope scope;\n\n Result< unique_ptr<vector<Message>> > rr = worker_thread.receive_all();\n if (rr.is_error()) {\n LOGGER << \"Unable to receive messages from the worker thread: \" << rr << \".\" << endl;\n return;\n }\n\n unique_ptr<vector<Message>> &accepted = rr.get_value();\n if (!accepted) {\n \/\/ No events to process.\n return;\n }\n\n unordered_map<ChannelID, vector<Local<Object>>> to_deliver;\n\n for (auto it = accepted->begin(); it != accepted->end(); ++it) {\n const AckPayload *ack_message = it->as_ack();\n if (ack_message) {\n LOGGER << \"Received ack message \" << *it << \".\" << endl;\n\n auto maybe_callback = pending_callbacks.find(ack_message->get_key());\n if (maybe_callback == pending_callbacks.end()) {\n LOGGER << \"Ignoring unexpected ack \" << *it << \".\" << endl;\n continue;\n }\n\n unique_ptr<Nan::Callback> callback = move(maybe_callback->second);\n pending_callbacks.erase(maybe_callback);\n\n ChannelID channel_id = ack_message->get_channel_id();\n if (channel_id != NULL_CHANNEL_ID) {\n if (ack_message->was_successful()) {\n Local<Value> argv[] = {Nan::Null(), Nan::New<Number>(channel_id)};\n callback->Call(2, argv);\n } else {\n Local<Value> err = Nan::Error(ack_message->get_message().c_str());\n Local<Value> argv[] = {err, Nan::Null()};\n callback->Call(2, argv);\n }\n } else {\n callback->Call(0, nullptr);\n }\n\n continue;\n }\n\n const FileSystemPayload *filesystem_message = it->as_filesystem();\n if (filesystem_message) {\n LOGGER << \"Received filesystem event message \" << *it << \".\" << endl;\n\n ChannelID channel_id = filesystem_message->get_channel_id();\n\n Local<Object> js_event = Nan::New<Object>();\n js_event->Set(\n Nan::New<String>(\"actionType\").ToLocalChecked(),\n Nan::New<Number>(static_cast<int>(filesystem_message->get_filesystem_action()))\n );\n js_event->Set(\n Nan::New<String>(\"entryKind\").ToLocalChecked(),\n Nan::New<Number>(static_cast<int>(filesystem_message->get_entry_kind()))\n );\n js_event->Set(\n Nan::New<String>(\"oldPath\").ToLocalChecked(),\n Nan::New<String>(filesystem_message->get_old_path()).ToLocalChecked()\n );\n js_event->Set(\n Nan::New<String>(\"newPath\").ToLocalChecked(),\n Nan::New<String>(filesystem_message->get_new_path()).ToLocalChecked()\n );\n\n to_deliver[channel_id].push_back(js_event);\n continue;\n }\n\n LOGGER << \"Received unexpected message \" << *it << \".\" << endl;\n }\n\n for (auto it = to_deliver.begin(); it != to_deliver.end(); ++it) {\n ChannelID channel_id = it->first;\n vector<Local<Object>> js_events = it->second;\n\n auto maybe_callback = channel_callbacks.find(channel_id);\n if (maybe_callback == channel_callbacks.end()) {\n LOGGER << \"Ignoring unexpected filesystem event channel \" << channel_id << \".\" << endl;\n continue;\n }\n shared_ptr<Nan::Callback> callback = maybe_callback->second;\n\n LOGGER << \"Dispatching \" << js_events.size()\n << \" event(s) on channel \" << channel_id << \" to node callbacks.\" << endl;\n\n Local<Array> js_array = Nan::New<Array>(js_events.size());\n\n int index = 0;\n for (auto et = js_events.begin(); et != js_events.end(); ++et) {\n js_array->Set(index, *et);\n index++;\n }\n\n Local<Value> argv[] = {\n Nan::Null(),\n js_array\n };\n callback->Call(2, argv);\n }\n }\n\n void collect_status(Status &status)\n {\n status.pending_callback_count = pending_callbacks.size();\n status.channel_callback_count = channel_callbacks.size();\n\n worker_thread.collect_status(status);\n }\n\nprivate:\n uv_async_t event_handler;\n\n WorkerThread worker_thread;\n\n CommandID next_command_id;\n ChannelID next_channel_id;\n\n unordered_map<CommandID, unique_ptr<Nan::Callback>> pending_callbacks;\n unordered_map<ChannelID, shared_ptr<Nan::Callback>> channel_callbacks;\n};\n\nstatic Main instance;\n\nstatic void handle_events_helper(uv_async_t *handle)\n{\n instance.handle_events();\n}\n\nstatic bool get_string_option(Local<Object>& options, const char *key_name, string &out)\n{\n Nan::HandleScope scope;\n const Local<String> key = Nan::New<String>(key_name).ToLocalChecked();\n\n Nan::MaybeLocal<Value> as_maybe_value = Nan::Get(options, key);\n if (as_maybe_value.IsEmpty()) {\n return true;\n }\n Local<Value> as_value = as_maybe_value.ToLocalChecked();\n if (as_value->IsUndefined()) {\n return true;\n }\n\n if (!as_value->IsString()) {\n ostringstream message;\n message << \"configure() option \" << key_name << \" must be a String\";\n Nan::ThrowError(message.str().c_str());\n return false;\n }\n\n Nan::Utf8String as_string(as_value);\n\n if (*as_string == nullptr) {\n ostringstream message;\n message << \"configure() option \" << key_name << \" must be a valid UTF-8 String\";\n Nan::ThrowError(message.str().c_str());\n return false;\n }\n\n out.assign(*as_string, as_string.length());\n return true;\n}\n\nvoid configure(const Nan::FunctionCallbackInfo<Value> &info)\n{\n string main_log_file;\n string worker_log_file;\n bool async = false;\n\n Nan::MaybeLocal<Object> maybe_options = Nan::To<Object>(info[0]);\n if (maybe_options.IsEmpty()) {\n Nan::ThrowError(\"configure() requires an option object\");\n return;\n }\n\n Local<Object> options = maybe_options.ToLocalChecked();\n if (!get_string_option(options, \"mainLogFile\", main_log_file)) return;\n if (!get_string_option(options, \"workerLogFile\", worker_log_file)) return;\n\n unique_ptr<Nan::Callback> callback(new Nan::Callback(info[1].As<Function>()));\n\n if (!main_log_file.empty()) {\n instance.use_main_log_file(move(main_log_file));\n }\n\n if (!worker_log_file.empty()) {\n Result<> r = instance.use_worker_log_file(move(worker_log_file), move(callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n return;\n }\n async = true;\n }\n\n if (!async) {\n callback->Call(0, 0);\n }\n}\n\nvoid watch(const Nan::FunctionCallbackInfo<Value> &info)\n{\n if (info.Length() != 3) {\n return Nan::ThrowError(\"watch() requires three arguments\");\n }\n\n Nan::MaybeLocal<String> maybe_root = Nan::To<String>(info[0]);\n if (maybe_root.IsEmpty()) {\n Nan::ThrowError(\"watch() requires a string as argument one\");\n return;\n }\n Local<String> root_v8_string = maybe_root.ToLocalChecked();\n Nan::Utf8String root_utf8(root_v8_string);\n if (*root_utf8 == nullptr) {\n Nan::ThrowError(\"watch() argument one must be a valid UTF-8 string\");\n return;\n }\n string root_str(*root_utf8, root_utf8.length());\n\n unique_ptr<Nan::Callback> ack_callback(new Nan::Callback(info[1].As<Function>()));\n unique_ptr<Nan::Callback> event_callback(new Nan::Callback(info[2].As<Function>()));\n\n Result<> r = instance.watch(move(root_str), move(ack_callback), move(event_callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n }\n}\n\nvoid unwatch(const Nan::FunctionCallbackInfo<Value> &info)\n{\n if (info.Length() != 2) {\n Nan::ThrowError(\"watch() requires two arguments\");\n return;\n }\n\n Nan::Maybe<uint32_t> maybe_channel_id = Nan::To<uint32_t>(info[0]);\n if (maybe_channel_id.IsNothing()) {\n Nan::ThrowError(\"unwatch() requires a channel ID as its first argument\");\n return;\n }\n ChannelID channel_id = static_cast<ChannelID>(maybe_channel_id.FromJust());\n\n unique_ptr<Nan::Callback> ack_callback(new Nan::Callback(info[1].As<Function>()));\n\n Result<> r = instance.unwatch(channel_id, move(ack_callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n }\n}\n\nvoid status(const Nan::FunctionCallbackInfo<Value> &info)\n{\n Status status;\n instance.collect_status(status);\n\n Local<Object> status_object = Nan::New<Object>();\n Nan::Set(\n status_object,\n Nan::New<String>(\"pendingCallbackCount\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.pending_callback_count))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"channelCallbackCount\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.channel_callback_count))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerThreadOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_thread_ok).ToLocalChecked()\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerInSize\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.worker_in_size))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerInOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_in_ok).ToLocalChecked()\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerOutSize\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.worker_out_size))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerOutOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_out_ok).ToLocalChecked()\n );\n info.GetReturnValue().Set(status_object);\n}\n\nvoid initialize(Local<Object> exports)\n{\n Nan::Set(\n exports,\n Nan::New<String>(\"configure\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(configure)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"watch\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(watch)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"unwatch\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(unwatch)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"status\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(status)).ToLocalChecked()\n );\n}\n\nNODE_MODULE(watcher, initialize);\n<commit_msg>Permit null in string options<commit_after>#include <memory>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <functional>\n#include <utility>\n#include <unordered_map>\n#include <vector>\n#include <nan.h>\n#include <v8.h>\n#include <uv.h>\n\n#include \"log.h\"\n#include \"queue.h\"\n#include \"status.h\"\n#include \"result.h\"\n#include \"worker\/worker_thread.h\"\n\nusing v8::Local;\nusing v8::Value;\nusing v8::Object;\nusing v8::String;\nusing v8::Number;\nusing v8::Uint32;\nusing v8::Function;\nusing v8::FunctionTemplate;\nusing v8::Array;\nusing std::shared_ptr;\nusing std::unique_ptr;\nusing std::string;\nusing std::ostringstream;\nusing std::endl;\nusing std::unordered_map;\nusing std::vector;\nusing std::move;\nusing std::make_pair;\n\nstatic void handle_events_helper(uv_async_t *handle);\n\nclass Main {\npublic:\n Main() : worker_thread{&event_handler}\n {\n int err;\n\n next_command_id = 0;\n next_channel_id = NULL_CHANNEL_ID + 1;\n\n err = uv_async_init(uv_default_loop(), &event_handler, handle_events_helper);\n if (err) return;\n\n worker_thread.run();\n }\n\n Result<> send_worker_command(\n const CommandAction action,\n const std::string &&root,\n unique_ptr<Nan::Callback> callback,\n ChannelID channel_id = NULL_CHANNEL_ID\n )\n {\n CommandID command_id = next_command_id;\n\n CommandPayload command_payload(next_command_id, action, move(root), channel_id);\n Message command_message(move(command_payload));\n\n pending_callbacks.emplace(command_id, move(callback));\n\n next_command_id++;\n\n LOGGER << \"Sending command \" << command_message << \" to worker thread.\" << endl;\n return worker_thread.send(move(command_message));\n }\n\n void use_main_log_file(string &&main_log_file)\n {\n Logger::to_file(main_log_file.c_str());\n }\n\n void disable_main_log()\n {\n Logger::disable();\n }\n\n Result<> use_worker_log_file(string &&worker_log_file, unique_ptr<Nan::Callback> callback)\n {\n return send_worker_command(COMMAND_LOG_FILE, move(worker_log_file), move(callback));\n }\n\n Result<> disable_worker_log(unique_ptr<Nan::Callback> callback)\n {\n return send_worker_command(COMMAND_LOG_DISABLE, \"\", move(callback));\n }\n\n Result<> watch(string &&root, unique_ptr<Nan::Callback> ack_callback, unique_ptr<Nan::Callback> event_callback)\n {\n ChannelID channel_id = next_channel_id;\n next_channel_id++;\n\n channel_callbacks.emplace(channel_id, move(event_callback));\n\n return send_worker_command(COMMAND_ADD, move(root), move(ack_callback), channel_id);\n }\n\n Result<> unwatch(ChannelID channel_id, unique_ptr<Nan::Callback> ack_callback)\n {\n string root;\n Result<> r = send_worker_command(COMMAND_REMOVE, move(root), move(ack_callback), channel_id);\n\n auto maybe_event_callback = channel_callbacks.find(channel_id);\n if (maybe_event_callback == channel_callbacks.end()) {\n LOGGER << \"Channel \" << channel_id << \" already has no event callback.\" << endl;\n return ok_result();\n }\n channel_callbacks.erase(maybe_event_callback);\n return r;\n }\n\n void handle_events()\n {\n Nan::HandleScope scope;\n\n Result< unique_ptr<vector<Message>> > rr = worker_thread.receive_all();\n if (rr.is_error()) {\n LOGGER << \"Unable to receive messages from the worker thread: \" << rr << \".\" << endl;\n return;\n }\n\n unique_ptr<vector<Message>> &accepted = rr.get_value();\n if (!accepted) {\n \/\/ No events to process.\n return;\n }\n\n unordered_map<ChannelID, vector<Local<Object>>> to_deliver;\n\n for (auto it = accepted->begin(); it != accepted->end(); ++it) {\n const AckPayload *ack_message = it->as_ack();\n if (ack_message) {\n LOGGER << \"Received ack message \" << *it << \".\" << endl;\n\n auto maybe_callback = pending_callbacks.find(ack_message->get_key());\n if (maybe_callback == pending_callbacks.end()) {\n LOGGER << \"Ignoring unexpected ack \" << *it << \".\" << endl;\n continue;\n }\n\n unique_ptr<Nan::Callback> callback = move(maybe_callback->second);\n pending_callbacks.erase(maybe_callback);\n\n ChannelID channel_id = ack_message->get_channel_id();\n if (channel_id != NULL_CHANNEL_ID) {\n if (ack_message->was_successful()) {\n Local<Value> argv[] = {Nan::Null(), Nan::New<Number>(channel_id)};\n callback->Call(2, argv);\n } else {\n Local<Value> err = Nan::Error(ack_message->get_message().c_str());\n Local<Value> argv[] = {err, Nan::Null()};\n callback->Call(2, argv);\n }\n } else {\n callback->Call(0, nullptr);\n }\n\n continue;\n }\n\n const FileSystemPayload *filesystem_message = it->as_filesystem();\n if (filesystem_message) {\n LOGGER << \"Received filesystem event message \" << *it << \".\" << endl;\n\n ChannelID channel_id = filesystem_message->get_channel_id();\n\n Local<Object> js_event = Nan::New<Object>();\n js_event->Set(\n Nan::New<String>(\"actionType\").ToLocalChecked(),\n Nan::New<Number>(static_cast<int>(filesystem_message->get_filesystem_action()))\n );\n js_event->Set(\n Nan::New<String>(\"entryKind\").ToLocalChecked(),\n Nan::New<Number>(static_cast<int>(filesystem_message->get_entry_kind()))\n );\n js_event->Set(\n Nan::New<String>(\"oldPath\").ToLocalChecked(),\n Nan::New<String>(filesystem_message->get_old_path()).ToLocalChecked()\n );\n js_event->Set(\n Nan::New<String>(\"newPath\").ToLocalChecked(),\n Nan::New<String>(filesystem_message->get_new_path()).ToLocalChecked()\n );\n\n to_deliver[channel_id].push_back(js_event);\n continue;\n }\n\n LOGGER << \"Received unexpected message \" << *it << \".\" << endl;\n }\n\n for (auto it = to_deliver.begin(); it != to_deliver.end(); ++it) {\n ChannelID channel_id = it->first;\n vector<Local<Object>> js_events = it->second;\n\n auto maybe_callback = channel_callbacks.find(channel_id);\n if (maybe_callback == channel_callbacks.end()) {\n LOGGER << \"Ignoring unexpected filesystem event channel \" << channel_id << \".\" << endl;\n continue;\n }\n shared_ptr<Nan::Callback> callback = maybe_callback->second;\n\n LOGGER << \"Dispatching \" << js_events.size()\n << \" event(s) on channel \" << channel_id << \" to node callbacks.\" << endl;\n\n Local<Array> js_array = Nan::New<Array>(js_events.size());\n\n int index = 0;\n for (auto et = js_events.begin(); et != js_events.end(); ++et) {\n js_array->Set(index, *et);\n index++;\n }\n\n Local<Value> argv[] = {\n Nan::Null(),\n js_array\n };\n callback->Call(2, argv);\n }\n }\n\n void collect_status(Status &status)\n {\n status.pending_callback_count = pending_callbacks.size();\n status.channel_callback_count = channel_callbacks.size();\n\n worker_thread.collect_status(status);\n }\n\nprivate:\n uv_async_t event_handler;\n\n WorkerThread worker_thread;\n\n CommandID next_command_id;\n ChannelID next_channel_id;\n\n unordered_map<CommandID, unique_ptr<Nan::Callback>> pending_callbacks;\n unordered_map<ChannelID, shared_ptr<Nan::Callback>> channel_callbacks;\n};\n\nstatic Main instance;\n\nstatic void handle_events_helper(uv_async_t *handle)\n{\n instance.handle_events();\n}\n\nstatic bool get_string_option(Local<Object>& options, const char *key_name, bool &null, string &out)\n{\n Nan::HandleScope scope;\n null = false;\n const Local<String> key = Nan::New<String>(key_name).ToLocalChecked();\n\n Nan::MaybeLocal<Value> as_maybe_value = Nan::Get(options, key);\n if (as_maybe_value.IsEmpty()) {\n return true;\n }\n Local<Value> as_value = as_maybe_value.ToLocalChecked();\n if (as_value->IsUndefined()) {\n return true;\n }\n\n if (as_value->IsNull()) {\n null = true;\n return true;\n }\n\n if (!as_value->IsString()) {\n ostringstream message;\n message << \"configure() option \" << key_name << \" must be a String\";\n Nan::ThrowError(message.str().c_str());\n return false;\n }\n\n Nan::Utf8String as_string(as_value);\n\n if (*as_string == nullptr) {\n ostringstream message;\n message << \"configure() option \" << key_name << \" must be a valid UTF-8 String\";\n Nan::ThrowError(message.str().c_str());\n return false;\n }\n\n out.assign(*as_string, as_string.length());\n return true;\n}\n\nvoid configure(const Nan::FunctionCallbackInfo<Value> &info)\n{\n bool main_log_file_null = false;\n string main_log_file;\n\n bool worker_log_file_null = false;\n string worker_log_file;\n\n bool async = false;\n\n Nan::MaybeLocal<Object> maybe_options = Nan::To<Object>(info[0]);\n if (maybe_options.IsEmpty()) {\n Nan::ThrowError(\"configure() requires an option object\");\n return;\n }\n\n Local<Object> options = maybe_options.ToLocalChecked();\n if (!get_string_option(options, \"mainLogFile\", main_log_file_null, main_log_file)) return;\n if (!get_string_option(options, \"workerLogFile\", worker_log_file_null, worker_log_file)) return;\n\n unique_ptr<Nan::Callback> callback(new Nan::Callback(info[1].As<Function>()));\n\n if (!main_log_file.empty()) {\n instance.use_main_log_file(move(main_log_file));\n }\n\n if (!worker_log_file.empty()) {\n Result<> r = instance.use_worker_log_file(move(worker_log_file), move(callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n return;\n }\n async = true;\n }\n\n if (!async) {\n callback->Call(0, 0);\n }\n}\n\nvoid watch(const Nan::FunctionCallbackInfo<Value> &info)\n{\n if (info.Length() != 3) {\n return Nan::ThrowError(\"watch() requires three arguments\");\n }\n\n Nan::MaybeLocal<String> maybe_root = Nan::To<String>(info[0]);\n if (maybe_root.IsEmpty()) {\n Nan::ThrowError(\"watch() requires a string as argument one\");\n return;\n }\n Local<String> root_v8_string = maybe_root.ToLocalChecked();\n Nan::Utf8String root_utf8(root_v8_string);\n if (*root_utf8 == nullptr) {\n Nan::ThrowError(\"watch() argument one must be a valid UTF-8 string\");\n return;\n }\n string root_str(*root_utf8, root_utf8.length());\n\n unique_ptr<Nan::Callback> ack_callback(new Nan::Callback(info[1].As<Function>()));\n unique_ptr<Nan::Callback> event_callback(new Nan::Callback(info[2].As<Function>()));\n\n Result<> r = instance.watch(move(root_str), move(ack_callback), move(event_callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n }\n}\n\nvoid unwatch(const Nan::FunctionCallbackInfo<Value> &info)\n{\n if (info.Length() != 2) {\n Nan::ThrowError(\"watch() requires two arguments\");\n return;\n }\n\n Nan::Maybe<uint32_t> maybe_channel_id = Nan::To<uint32_t>(info[0]);\n if (maybe_channel_id.IsNothing()) {\n Nan::ThrowError(\"unwatch() requires a channel ID as its first argument\");\n return;\n }\n ChannelID channel_id = static_cast<ChannelID>(maybe_channel_id.FromJust());\n\n unique_ptr<Nan::Callback> ack_callback(new Nan::Callback(info[1].As<Function>()));\n\n Result<> r = instance.unwatch(channel_id, move(ack_callback));\n if (r.is_error()) {\n Nan::ThrowError(r.get_error().c_str());\n }\n}\n\nvoid status(const Nan::FunctionCallbackInfo<Value> &info)\n{\n Status status;\n instance.collect_status(status);\n\n Local<Object> status_object = Nan::New<Object>();\n Nan::Set(\n status_object,\n Nan::New<String>(\"pendingCallbackCount\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.pending_callback_count))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"channelCallbackCount\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.channel_callback_count))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerThreadOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_thread_ok).ToLocalChecked()\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerInSize\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.worker_in_size))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerInOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_in_ok).ToLocalChecked()\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerOutSize\").ToLocalChecked(),\n Nan::New<Uint32>(static_cast<uint32_t>(status.worker_out_size))\n );\n Nan::Set(\n status_object,\n Nan::New<String>(\"workerOutOk\").ToLocalChecked(),\n Nan::New<String>(status.worker_out_ok).ToLocalChecked()\n );\n info.GetReturnValue().Set(status_object);\n}\n\nvoid initialize(Local<Object> exports)\n{\n Nan::Set(\n exports,\n Nan::New<String>(\"configure\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(configure)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"watch\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(watch)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"unwatch\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(unwatch)).ToLocalChecked()\n );\n Nan::Set(\n exports,\n Nan::New<String>(\"status\").ToLocalChecked(),\n Nan::GetFunction(Nan::New<FunctionTemplate>(status)).ToLocalChecked()\n );\n}\n\nNODE_MODULE(watcher, initialize);\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009-2017 The VOTCA Development Team\n * (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Overload of uBLAS prod function with MKL\/GSL implementations\n#include <votca\/tools\/linalg.h>\n#include <votca\/xtp\/aomatrix.h>\n#include <votca\/xtp\/dftcoupling.h>\n\n#include <boost\/numeric\/ublas\/operation.hpp>\n#include <boost\/numeric\/ublas\/banded.hpp>\n#include <boost\/numeric\/ublas\/matrix_proxy.hpp>\n#include <boost\/numeric\/ublas\/vector_proxy.hpp>\n#include <boost\/numeric\/ublas\/symmetric.hpp>\n#include <votca\/tools\/constants.h>\n#include <boost\/format.hpp>\n#include <boost\/progress.hpp>\n\n\nnamespace votca {\n namespace xtp {\n\n namespace ub = boost::numeric::ublas;\n\n\n using boost::format;\n\n double DFTcoupling::getCouplingElement(int levelA, int levelB, Orbitals* _orbitalsA,\n Orbitals* _orbitalsB, ub::matrix<double>* _JAB, double _energy_difference) {\n\n\n int _levelsA = _orbitalsA->getNumberOfLevels();\n\n if (_energy_difference != 0) {\n std::vector<int> list_levelsA = *_orbitalsA->getDegeneracy(levelA, _energy_difference);\n std::vector<int> list_levelsB = *_orbitalsA->getDegeneracy(levelB, _energy_difference);\n\n double _JAB_sq = 0;\n double _JAB_one_level;\n\n for (std::vector<int>::iterator iA = list_levelsA.begin()++; iA != list_levelsA.end(); iA++) {\n for (std::vector<int>::iterator iB = list_levelsB.begin()++; iB != list_levelsB.end(); iB++) {\n \/\/cout << *iA << ':' << *iB << endl;\n _JAB_one_level = _JAB->at_element(*iA - 1, *iB - 1 + _levelsA);\n _JAB_sq += _JAB_one_level*_JAB_one_level;\n }\n }\n\n return sqrt(_JAB_sq \/ (list_levelsA.size() * list_levelsB.size())) * tools::conv::hrt2ev;\n\n } else {\n\n return _JAB->at_element(levelA - 1, levelB - 1 + _levelsA) * tools::conv::hrt2ev;\n\n }\n \/\/ the matrix should be symmetric, could also return this element\n \/\/ _JAB.at_element( _levelsA + levelB - 1 , levelA - 1 );\n }\n\n \/**\n * \\brief evaluates electronic couplings \n * \n * This is a fast version with a rather large block matrix AxB\n * \n * @param _orbitalsA molecular orbitals of molecule A\n * @param _orbitalsB molecular orbitals of molecule B\n * @param _orbitalsAB molecular orbitals of the dimer AB\n * @param _JAB matrix with electronic couplings\n * @return false if failed\n *\/\n bool DFTcoupling::CalculateIntegrals(Orbitals* _orbitalsA, Orbitals* _orbitalsB,\n Orbitals* _orbitalsAB, ub::matrix<double>* _JAB) {\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating electronic couplings\" << flush;\n\n const std::vector<QMAtom*> atomsA = _orbitalsA->QMAtoms();\n const std::vector<QMAtom*> atomsB = _orbitalsB->QMAtoms();\n const std::vector<QMAtom*> atomsAll = _orbitalsAB->QMAtoms();\n\n for (unsigned i = 0; i < atomsAll.size(); i++) {\n QMAtom* dimer = atomsAll[i];\n QMAtom* monomer = NULL;\n \n if (i < atomsA.size()) {\n monomer = atomsA[i];\n if(!monomer->getPos().isClose(dimer->getPos(), 0.001) ) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n continue;\n }\n } else if (i < atomsB.size() + atomsA.size()) {\n monomer = atomsB[i - atomsA.size()];\n if(monomer->getPos().isClose(dimer->getPos(), 0.001)){\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n continue;\n }\n } else {\n \/\/ Linker\n CTP_LOG(ctp::logDEBUG, *_pLog) << (format(\"Neither Monomer A nor Monomer B contains atom %s on line %u. Hence, this atom is part of a linker. \\n\") %dimer->getType() %(i+1) ).str()<<flush;\n continue;\n }\n \n if (monomer->getType() != dimer->getType()) {\n throw runtime_error(\"\\nERROR: Atom types do not agree in dimer and monomers\\n\");\n }\n if (tools::abs(monomer->getPos() - dimer->getPos()) > 0.001) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n break;\n }\n }\n\n \/\/ constructing the direct product orbA x orbB\n int _basisA = _orbitalsA->getBasisSetSize();\n int _basisB = _orbitalsB->getBasisSetSize();\n\n if ((_basisA == 0) || (_basisB == 0)) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"Basis set size is not stored in monomers\" << flush;\n return false;\n }\n\n int _levelsA = _orbitalsA->getNumberOfLevels();\n int _levelsB = _orbitalsB->getNumberOfLevels();\n\n \/\/boost::timer t; \/\/ start timing\n \/\/double _st = t.elapsed();\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Levels:Basis A[\" << _levelsA << \":\" << _basisA << \"]\"\n << \" B[\" << _levelsB << \":\" << _basisB << \"]\" << flush;\n\n if ((_levelsA == 0) || (_levelsB == 0)) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"No information about number of occupied\/unoccupied levels is stored\" << flush;\n return false;\n }\n\n \/\/ | Orbitals_A 0 | | Overlap_A | \n \/\/ | 0 Orbitals_B | X | Overlap_B | X Transpose( Orbitals_AB )\n \n ub::matrix<double>_psi_AxB= ub::zero_matrix<double>(_levelsA + _levelsB ,_orbitalsAB->getBasisSetSize());\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Constructing direct product AxB [\"\n << _psi_AxB.size1() << \"x\"\n << _psi_AxB.size2() << \"]\" << flush;\n\n ub::project(_psi_AxB, ub::range(0, _levelsA), ub::range(0, _basisA)) = _orbitalsA->MOCoefficients();\n ub::project(_psi_AxB, ub::range(_levelsA, _levelsA + _levelsB), ub::range(_basisA, _basisA + _basisB)) = _orbitalsB->MOCoefficients();\n\n \n \n \/\/ psi_AxB * S_AB * psi_AB\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Projecting dimer onto monomer orbitals\" << flush;\n ub::matrix<double> overlap;\n if (_orbitalsAB->hasAOOverlap()) {\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Reading overlap matrix from orbitals\" << flush;\n overlap = _orbitalsAB->AOOverlap();\n } else {\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating overlap matrix for basisset: \" << _orbitalsAB->getDFTbasis() << flush;\n BasisSet _dftbasisset;\n AOBasis _dftbasis;\n _dftbasisset.LoadBasisSet(_orbitalsAB->getDFTbasis());\n\n _dftbasis.AOBasisFill(&_dftbasisset, _orbitalsAB->QMAtoms());\n AOOverlap _dftAOoverlap;\n _dftAOoverlap.Fill(_dftbasis);\n overlap = _dftAOoverlap.Matrix();\n }\n\n ub::matrix<double> _psi_AB = ub::prod(overlap, ub::trans(_orbitalsAB->MOCoefficients()));\n ub::matrix<double> _psi_AxB_dimer_basis = ub::prod(_psi_AxB, _psi_AB);\n _psi_AB.clear();\n\n \/\/check to see if projection quality is sufficient\n for (unsigned i = 0; i < _psi_AxB_dimer_basis.size1(); i++) {\n double mag = 0.0;\n for (unsigned j = 0; j < _psi_AxB_dimer_basis.size2(); j++) {\n mag += _psi_AxB_dimer_basis(i, j) * _psi_AxB_dimer_basis(i, j);\n\n }\n if (mag < 0.95) {\n throw runtime_error(\"\\nERROR: Projection of monomer orbitals on dimer is insufficient, maybe the orbital order is screwed up, otherwise increase dimer basis.\\n\");\n }\n }\n\n \/\/ J = psi_AxB_dimer_basis * HAB * psi_AxB_dimer_basis^T\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Projecting the Fock matrix onto the dimer basis\" << flush;\n ub::diagonal_matrix<double> _hamiltonian_AB(_orbitalsAB->getNumberOfLevels(), _orbitalsAB->MOEnergies().data());\n ub::matrix<double> _temp = ub::prod(_hamiltonian_AB, ub::trans(_psi_AxB_dimer_basis));\n ub::matrix<double> JAB_dimer = ub::prod(_psi_AxB_dimer_basis, _temp);\n\n \/\/ S = psi_AxB_dimer_basis * psi_AxB_dimer_basis^T\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Constructing Overlap matrix\" << flush;\n ub::matrix<double> _S_AxB = ub::prod(_psi_AxB_dimer_basis, ub::trans(_psi_AxB_dimer_basis));\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating the effective overlap JAB [\"\n << JAB_dimer.size1() << \"x\"\n << JAB_dimer.size2() << \"]\" << flush;\n double smalleig = linalg_loewdin(JAB_dimer, _S_AxB);\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Smallest eigenvalue of overlap matrix is \" << smalleig << flush;\n (*_JAB) = JAB_dimer;\n\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Done with electronic couplings\" << flush;\n\n return true;\n\n }\n\n\n\n }\n}\n<commit_msg>Removed blank lines<commit_after>\/*\n * Copyright 2009-2017 The VOTCA Development Team\n * (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\")\n *\n * You may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ Overload of uBLAS prod function with MKL\/GSL implementations\n#include <votca\/tools\/linalg.h>\n#include <votca\/xtp\/aomatrix.h>\n#include <votca\/xtp\/dftcoupling.h>\n\n#include <boost\/numeric\/ublas\/operation.hpp>\n#include <boost\/numeric\/ublas\/banded.hpp>\n#include <boost\/numeric\/ublas\/matrix_proxy.hpp>\n#include <boost\/numeric\/ublas\/vector_proxy.hpp>\n#include <boost\/numeric\/ublas\/symmetric.hpp>\n#include <votca\/tools\/constants.h>\n#include <boost\/format.hpp>\n#include <boost\/progress.hpp>\n\n\nnamespace votca {\n namespace xtp {\n\n namespace ub = boost::numeric::ublas;\n\n\n using boost::format;\n\n double DFTcoupling::getCouplingElement(int levelA, int levelB, Orbitals* _orbitalsA,\n Orbitals* _orbitalsB, ub::matrix<double>* _JAB, double _energy_difference) {\n \n int _levelsA = _orbitalsA->getNumberOfLevels();\n\n if (_energy_difference != 0) {\n std::vector<int> list_levelsA = *_orbitalsA->getDegeneracy(levelA, _energy_difference);\n std::vector<int> list_levelsB = *_orbitalsA->getDegeneracy(levelB, _energy_difference);\n\n double _JAB_sq = 0;\n double _JAB_one_level;\n\n for (std::vector<int>::iterator iA = list_levelsA.begin()++; iA != list_levelsA.end(); iA++) {\n for (std::vector<int>::iterator iB = list_levelsB.begin()++; iB != list_levelsB.end(); iB++) {\n \/\/cout << *iA << ':' << *iB << endl;\n _JAB_one_level = _JAB->at_element(*iA - 1, *iB - 1 + _levelsA);\n _JAB_sq += _JAB_one_level*_JAB_one_level;\n }\n }\n\n return sqrt(_JAB_sq \/ (list_levelsA.size() * list_levelsB.size())) * tools::conv::hrt2ev;\n\n } else {\n\n return _JAB->at_element(levelA - 1, levelB - 1 + _levelsA) * tools::conv::hrt2ev;\n\n }\n \/\/ the matrix should be symmetric, could also return this element\n \/\/ _JAB.at_element( _levelsA + levelB - 1 , levelA - 1 );\n }\n\n \/**\n * \\brief evaluates electronic couplings \n * \n * This is a fast version with a rather large block matrix AxB\n * \n * @param _orbitalsA molecular orbitals of molecule A\n * @param _orbitalsB molecular orbitals of molecule B\n * @param _orbitalsAB molecular orbitals of the dimer AB\n * @param _JAB matrix with electronic couplings\n * @return false if failed\n *\/\n bool DFTcoupling::CalculateIntegrals(Orbitals* _orbitalsA, Orbitals* _orbitalsB,\n Orbitals* _orbitalsAB, ub::matrix<double>* _JAB) {\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating electronic couplings\" << flush;\n\n const std::vector<QMAtom*> atomsA = _orbitalsA->QMAtoms();\n const std::vector<QMAtom*> atomsB = _orbitalsB->QMAtoms();\n const std::vector<QMAtom*> atomsAll = _orbitalsAB->QMAtoms();\n\n for (unsigned i = 0; i < atomsAll.size(); i++) {\n QMAtom* dimer = atomsAll[i];\n QMAtom* monomer = NULL;\n \n if (i < atomsA.size()) {\n monomer = atomsA[i];\n if(!monomer->getPos().isClose(dimer->getPos(), 0.001) ) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n continue;\n }\n } else if (i < atomsB.size() + atomsA.size()) {\n monomer = atomsB[i - atomsA.size()];\n if(monomer->getPos().isClose(dimer->getPos(), 0.001)){\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n continue;\n }\n } else {\n \/\/ Linker\n CTP_LOG(ctp::logDEBUG, *_pLog) << (format(\"Neither Monomer A nor Monomer B contains atom %s on line %u. Hence, this atom is part of a linker. \\n\") %dimer->getType() %(i+1) ).str()<<flush;\n continue;\n }\n \n if (monomer->getType() != dimer->getType()) {\n throw runtime_error(\"\\nERROR: Atom types do not agree in dimer and monomers\\n\");\n }\n if (tools::abs(monomer->getPos() - dimer->getPos()) > 0.001) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"======WARNING=======\\n Coordinates of monomers and dimer atoms do not agree, do you know what you are doing?\\n \" << flush;\n break;\n }\n }\n\n \/\/ constructing the direct product orbA x orbB\n int _basisA = _orbitalsA->getBasisSetSize();\n int _basisB = _orbitalsB->getBasisSetSize();\n\n if ((_basisA == 0) || (_basisB == 0)) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"Basis set size is not stored in monomers\" << flush;\n return false;\n }\n\n int _levelsA = _orbitalsA->getNumberOfLevels();\n int _levelsB = _orbitalsB->getNumberOfLevels();\n\n \/\/boost::timer t; \/\/ start timing\n \/\/double _st = t.elapsed();\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Levels:Basis A[\" << _levelsA << \":\" << _basisA << \"]\"\n << \" B[\" << _levelsB << \":\" << _basisB << \"]\" << flush;\n\n if ((_levelsA == 0) || (_levelsB == 0)) {\n CTP_LOG(ctp::logERROR, *_pLog) << \"No information about number of occupied\/unoccupied levels is stored\" << flush;\n return false;\n }\n\n \/\/ | Orbitals_A 0 | | Overlap_A | \n \/\/ | 0 Orbitals_B | X | Overlap_B | X Transpose( Orbitals_AB )\n \n ub::matrix<double>_psi_AxB= ub::zero_matrix<double>(_levelsA + _levelsB ,_orbitalsAB->getBasisSetSize());\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Constructing direct product AxB [\"\n << _psi_AxB.size1() << \"x\"\n << _psi_AxB.size2() << \"]\" << flush;\n\n ub::project(_psi_AxB, ub::range(0, _levelsA), ub::range(0, _basisA)) = _orbitalsA->MOCoefficients();\n ub::project(_psi_AxB, ub::range(_levelsA, _levelsA + _levelsB), ub::range(_basisA, _basisA + _basisB)) = _orbitalsB->MOCoefficients();\n \n \/\/ psi_AxB * S_AB * psi_AB\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Projecting dimer onto monomer orbitals\" << flush;\n ub::matrix<double> overlap;\n if (_orbitalsAB->hasAOOverlap()) {\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Reading overlap matrix from orbitals\" << flush;\n overlap = _orbitalsAB->AOOverlap();\n } else {\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating overlap matrix for basisset: \" << _orbitalsAB->getDFTbasis() << flush;\n BasisSet _dftbasisset;\n AOBasis _dftbasis;\n _dftbasisset.LoadBasisSet(_orbitalsAB->getDFTbasis());\n\n _dftbasis.AOBasisFill(&_dftbasisset, _orbitalsAB->QMAtoms());\n AOOverlap _dftAOoverlap;\n _dftAOoverlap.Fill(_dftbasis);\n overlap = _dftAOoverlap.Matrix();\n }\n\n ub::matrix<double> _psi_AB = ub::prod(overlap, ub::trans(_orbitalsAB->MOCoefficients()));\n ub::matrix<double> _psi_AxB_dimer_basis = ub::prod(_psi_AxB, _psi_AB);\n _psi_AB.clear();\n\n \/\/check to see if projection quality is sufficient\n for (unsigned i = 0; i < _psi_AxB_dimer_basis.size1(); i++) {\n double mag = 0.0;\n for (unsigned j = 0; j < _psi_AxB_dimer_basis.size2(); j++) {\n mag += _psi_AxB_dimer_basis(i, j) * _psi_AxB_dimer_basis(i, j);\n\n }\n if (mag < 0.95) {\n throw runtime_error(\"\\nERROR: Projection of monomer orbitals on dimer is insufficient, maybe the orbital order is screwed up, otherwise increase dimer basis.\\n\");\n }\n }\n\n \/\/ J = psi_AxB_dimer_basis * HAB * psi_AxB_dimer_basis^T\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Projecting the Fock matrix onto the dimer basis\" << flush;\n ub::diagonal_matrix<double> _hamiltonian_AB(_orbitalsAB->getNumberOfLevels(), _orbitalsAB->MOEnergies().data());\n ub::matrix<double> _temp = ub::prod(_hamiltonian_AB, ub::trans(_psi_AxB_dimer_basis));\n ub::matrix<double> JAB_dimer = ub::prod(_psi_AxB_dimer_basis, _temp);\n\n \/\/ S = psi_AxB_dimer_basis * psi_AxB_dimer_basis^T\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Constructing Overlap matrix\" << flush;\n ub::matrix<double> _S_AxB = ub::prod(_psi_AxB_dimer_basis, ub::trans(_psi_AxB_dimer_basis));\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Calculating the effective overlap JAB [\"\n << JAB_dimer.size1() << \"x\"\n << JAB_dimer.size2() << \"]\" << flush;\n double smalleig = linalg_loewdin(JAB_dimer, _S_AxB);\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Smallest eigenvalue of overlap matrix is \" << smalleig << flush;\n (*_JAB) = JAB_dimer;\n\n CTP_LOG(ctp::logDEBUG, *_pLog) << \"Done with electronic couplings\" << flush;\n\n return true;\n\n }\n\n\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <list>\n#include <stdlib.h>\n#include <queue>\n#include <votca\/xtp\/huffmantree.h>\n#include <votca\/xtp\/glink.h>\nusing namespace std;\n\n\n\nnamespace votca {namespace xtp {\n\n\nvoid huffmanTree::setEvents(vector<GLink> * v){\n this->events=v;\n}\n\n\/\/https:\/\/en.wikipedia.org\/wiki\/Huffman_coding\nvoid huffmanTree::makeTree(){\n if (!events) throw runtime_error(\"Error in Huffmantree::makeTree : Pointer to Events not set!\");\n\n \/\/queue of the nodes, sorted by probability\n auto compare = [](huffmanNode * n1, huffmanNode * n2)\n { return n1->probability>n2->probability;};\n\n \/\/priority queues, because the algorithm always needs the element with the smallest probability. Also, it keep adding nodes to it, so it would we very inefficient to sort it in every iteration.\n priority_queue<huffmanNode *,vector<huffmanNode *>, decltype(compare)> queue(compare);\n\n htree=vector<huffmanNode>(events->size()%2?events->size():events->size()-1);\n\n auto comp2 = [](GLink * e1, GLink * e2){\n return e1->rate>e2->rate;\n };\n priority_queue<GLink *, vector<GLink *>, decltype(comp2)> eventQueue(comp2);\n escape_rate=0.0;\n\n int firstEmptyFieldIndex=0;\n for (GLink &e:*events){\n eventQueue.push(&e);\n escape_rate+=e.rate;\n }\n while (eventQueue.size()>1){\n htree[firstEmptyFieldIndex].isOnLastLevel=true;\n htree[firstEmptyFieldIndex].leftLeaf=eventQueue.top();\n eventQueue.pop();\n htree[firstEmptyFieldIndex].rightLeaf=eventQueue.top();\n eventQueue.pop();\n htree[firstEmptyFieldIndex].probability=(htree[firstEmptyFieldIndex].leftLeaf->rate+htree[firstEmptyFieldIndex].rightLeaf->rate)\/escape_rate;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n if (!eventQueue.empty()){\n htree[firstEmptyFieldIndex].isOnLastLevel=true;\n htree[firstEmptyFieldIndex].rightLeaf=eventQueue.top();\n htree[firstEmptyFieldIndex].leftLeaf=eventQueue.top();\n htree[firstEmptyFieldIndex].probability=2*htree[firstEmptyFieldIndex].leftLeaf->rate\/escape_rate;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n\n \/\/now connect the hnodes, making a new one for every connection:\n \/\/always take the two nodes with the smallest probability and \"combine\" them, repeat, until just one node (the root) is left.\n huffmanNode * h1;\n huffmanNode * h2;\n while (queue.size()>1){\n h1=queue.top();\n queue.pop();\n h2=queue.top();\n queue.pop();\n htree[firstEmptyFieldIndex].probability=h1->probability+h2->probability;\n htree[firstEmptyFieldIndex].leftChild=h1;\n htree[firstEmptyFieldIndex].rightChild=h2;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n \/\/reorganize the probabilities: in every node, add the probability of one subtree (\"small\")\n \/\/to all nodes of the other subtree.\n addProbabilityFromRightSubtreeToLeftSubtree(&htree[htree.size()-1],0);\n moveProbabilitiesFromRightSubtreesOneLevelUp(&htree[htree.size()-1]);\n treeIsMade=true;\n}\n\n\n\nvoid huffmanTree::addProbabilityFromRightSubtreeToLeftSubtree(huffmanNode * n,double add){\n \/\/for each node, adds the probability of the right childnode to the left childnode and every node under it. \n \/\/if the Tree would look like this (with the Numbers representing the probability of every node) before calling this function\n\n \/\/ 1.0\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ 0.4 0.6\n \/\/ \/ \\ \/ \\\n \/\/ \/ \\ \/ \\\n \/\/ 0.25 0.15 0.35 0.25\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ 0.1 0.05\n \/\/then it would look like this after calling it\n \/\/ 1.0\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ 1.0 0.6\n \/\/ \/ \\ \/ \\\n \/\/ \/ \\ \/ \\\n \/\/ 1.0 0.75 0.6 0.25\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ 0.75 0.65\n \/\/now the tree could be traversed with \"while (!n.isLeaf()) n=p>n.right.p?n.left:n.right\"\n \/\/so in the function moveProbabilitiesFromRightSubtreesOneLevelUp the numbers are moved one level up to call n.p instead of n.right.p\n\n\n \/\/adds \"add\" to the probability, then calls itself recursively.\n \/\/this calculates the probabilities needed to traverse the tree quickly\n n->probability+=add;\n \/\/if leftId=-1 (=> node is leaf), returns\n if (n->isOnLastLevel){\n return;\n }\n\n addProbabilityFromRightSubtreeToLeftSubtree(n->leftChild,add+n->rightChild->probability);\n addProbabilityFromRightSubtreeToLeftSubtree(n->rightChild,add);\n}\n\n\n\nvoid huffmanTree::moveProbabilitiesFromRightSubtreesOneLevelUp(huffmanNode * n){\n \/\/moves the Probabilities on the right subtrees one level up.\n \/\/if the Tree would look like this (with the Numbers representing the probability of every node) before calling this function\n \/\/ 1.0\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ 1.0 0.6\n \/\/ \/ \\ \/ \\\n \/\/ \/ \\ \/ \\\n \/\/ 1.0 0.75 0.6 0.25\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ 0.75 0.65\n \/\/then it would look like this after calling it\n \/\/ 0.6\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ \/ \\\n \/\/ 0.75 0.25\n \/\/ \/ \\ \/ \\\n \/\/ \/ \\ \/ \\\n \/\/ 1.0 0.65 0.6 0.25\n \/\/ \/\\\n \/\/ \/ \\\n \/\/ 0.75 0.65\n \/\/note, that now the probabilities on the leaf level are not needed anymore to traverse the tree; the algorithm now is \"while (!n.isLeaf()) n=p>n.p?n.left:n.right\"\n if (n->isOnLastLevel){\n n->probability-=n->leftLeaf->rate\/escape_rate;\n }\n else{\n n->probability=n->rightChild->probability;\n moveProbabilitiesFromRightSubtreesOneLevelUp(n->rightChild);\n moveProbabilitiesFromRightSubtreesOneLevelUp(n->leftChild);\n }\n}\n\n\n\nGLink * huffmanTree::findHoppingDestination(double p){\n if (!treeIsMade) throw runtime_error(\"Tried to find Hopping Destination without initializing the Huffmantree first!\");\n huffmanNode * node=&htree.back();\n while (!node->isOnLastLevel){\n if (p>node->probability) node=node->leftChild;\n else node=node->rightChild;\n }\n return (p>node->probability?node->leftLeaf:node->rightLeaf);\n}\n\n}}\n<commit_msg>Fixed issue with commentaries with backslashes<commit_after>#include <vector>\n#include <list>\n#include <stdlib.h>\n#include <queue>\n#include <votca\/xtp\/huffmantree.h>\n#include <votca\/xtp\/glink.h>\nusing namespace std;\n\n\n\nnamespace votca {namespace xtp {\n\n\nvoid huffmanTree::setEvents(vector<GLink> * v){\n this->events=v;\n}\n\n\/\/https:\/\/en.wikipedia.org\/wiki\/Huffman_coding\nvoid huffmanTree::makeTree(){\n if (!events) throw runtime_error(\"Error in Huffmantree::makeTree : Pointer to Events not set!\");\n\n \/\/queue of the nodes, sorted by probability\n auto compare = [](huffmanNode * n1, huffmanNode * n2)\n { return n1->probability>n2->probability;};\n\n \/\/priority queues, because the algorithm always needs the element with the smallest probability. Also, it keep adding nodes to it, so it would we very inefficient to sort it in every iteration.\n priority_queue<huffmanNode *,vector<huffmanNode *>, decltype(compare)> queue(compare);\n\n htree=vector<huffmanNode>(events->size()%2?events->size():events->size()-1);\n\n auto comp2 = [](GLink * e1, GLink * e2){\n return e1->rate>e2->rate;\n };\n priority_queue<GLink *, vector<GLink *>, decltype(comp2)> eventQueue(comp2);\n escape_rate=0.0;\n\n int firstEmptyFieldIndex=0;\n for (GLink &e:*events){\n eventQueue.push(&e);\n escape_rate+=e.rate;\n } \n while (eventQueue.size()>1){\n htree[firstEmptyFieldIndex].isOnLastLevel=true;\n htree[firstEmptyFieldIndex].leftLeaf=eventQueue.top();\n eventQueue.pop();\n htree[firstEmptyFieldIndex].rightLeaf=eventQueue.top();\n eventQueue.pop();\n htree[firstEmptyFieldIndex].probability=(htree[firstEmptyFieldIndex].leftLeaf->rate+htree[firstEmptyFieldIndex].rightLeaf->rate)\/escape_rate;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n if (!eventQueue.empty()){\n htree[firstEmptyFieldIndex].isOnLastLevel=true;\n htree[firstEmptyFieldIndex].rightLeaf=eventQueue.top();\n htree[firstEmptyFieldIndex].leftLeaf=eventQueue.top();\n htree[firstEmptyFieldIndex].probability=htree[firstEmptyFieldIndex].leftLeaf->rate\/escape_rate;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n\n \/\/now connect the hnodes, making a new one for every connection:\n \/\/always take the two nodes with the smallest probability and \"combine\" them, repeat, until just one node (the root) is left.\n huffmanNode * h1;\n huffmanNode * h2;\n while (queue.size()>1){\n h1=queue.top();\n queue.pop();\n h2=queue.top();\n queue.pop();\n htree[firstEmptyFieldIndex].probability=h1->probability+h2->probability;\n htree[firstEmptyFieldIndex].leftChild=h1;\n htree[firstEmptyFieldIndex].rightChild=h2;\n queue.push(&(htree[firstEmptyFieldIndex]));\n firstEmptyFieldIndex++;\n }\n \/\/reorganize the probabilities: in every node, add the probability of one subtree (\"small\")\n \/\/to all nodes of the other subtree.\n addProbabilityFromRightSubtreeToLeftSubtree(&htree[htree.size()-1],0);\n moveProbabilitiesFromRightSubtreesOneLevelUp(&htree[htree.size()-1]);\n treeIsMade=true;\n\n}\n\n\n\nvoid huffmanTree::addProbabilityFromRightSubtreeToLeftSubtree(huffmanNode * n,double add){\n \/\/for each node, adds the probability of the right childnode to the left childnode and every node under it. \n \/\/if the Tree would look like this (with the Numbers representing the probability of every node) before calling this function\n\n \/\/ 1.0\n \/\/ ____||____\n \/\/ | |\n \/\/ 0.4 0.6\n \/\/ _||_ _||_ \n \/\/ | | | |\n \/\/ 0.25 0.15 0.35 0.25\n \/\/ _||_\n \/\/ | |\n \/\/ 0.1 0.05\n \/\/then it would look like this after calling it\n \/\/ 1.0\n \/\/ ____||____\n \/\/ | |\n \/\/ 1.0 0.6\n \/\/ _||_ _||_ \n \/\/ | | | |\n \/\/ 1.0 0.75 0.6 0.25\n \/\/ _||_\n \/\/ | |\n \/\/ 0.75 0.65\n \/\/now the tree could be traversed with \"while (!n.isLeaf()) n=p>n.right.p?n.left:n.right\"\n \/\/so in the function moveProbabilitiesFromRightSubtreesOneLevelUp the numbers are moved one level up to call n.p instead of n.right.p\n\n\n \/\/adds \"add\" to the probability, then calls itself recursively.\n \/\/this calculates the probabilities needed to traverse the tree quickly\n n->probability+=add;\n \/\/if leftId=-1 (=> node is leaf), returns\n if (n->isOnLastLevel){\n return;\n }\n\n addProbabilityFromRightSubtreeToLeftSubtree(n->leftChild,add+n->rightChild->probability);\n addProbabilityFromRightSubtreeToLeftSubtree(n->rightChild,add);\n}\n\n\n\nvoid huffmanTree::moveProbabilitiesFromRightSubtreesOneLevelUp(huffmanNode * n){\n \/\/moves the Probabilities on the right subtrees one level up.\n \/\/if the Tree would look like this (with the Numbers representing the probability of every node) before calling this function\n \/\/ 1.0\n \/\/ ____||____\n \/\/ | |\n \/\/ 1.0 0.6\n \/\/ _||_ _||_ \n \/\/ | | | |\n \/\/ 1.0 0.75 0.6 0.25\n \/\/ _||_\n \/\/ | |\n \/\/ 0.75 0.65 \n \/\/then it would look like this after calling it\n \/\/ 0.\n \/\/ ____||____\n \/\/ | |\n \/\/ 0.75 0.25\n \/\/ _||_ _||_ \n \/\/ | | | |\n \/\/ 1.0 0.65 0.6 0.25\n \/\/ _||_\n \/\/ | |\n \/\/ 0.75 0.65\n \/\/note, that now the probabilities on the leaf level are not needed anymore to traverse the tree; the algorithm now is \"while (!n.isLeaf()) n=p>n.p?n.left:n.right\"\n if (n->isOnLastLevel){\n n->probability-=n->leftLeaf->rate\/escape_rate;\n }\n else{\n n->probability=n->rightChild->probability;\n moveProbabilitiesFromRightSubtreesOneLevelUp(n->rightChild);\n moveProbabilitiesFromRightSubtreesOneLevelUp(n->leftChild);\n }\n}\n\n\n\nGLink * huffmanTree::findHoppingDestination(double p){\n if (!treeIsMade) throw runtime_error(\"Tried to find Hopping Destination without initializing the Huffmantree first!\");\n huffmanNode * node=&htree.back();\n while (!node->isOnLastLevel){\n if (p>node->probability) node=node->leftChild;\n else node=node->rightChild;\n }\n return (p>node->probability?node->leftLeaf:node->rightLeaf);\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>#include \"CImg.h\"\n#include <time.h>\nusing namespace cimg_library;\ntypedef unsigned char uchar;\n\nint main(){\n\tCImg<uchar> image(\".\/donuts.bmp\");\n\tCImg<uchar> rot(image);\n\tuchar * ptr;\n\n\t\n\n\tCImgDisplay main_disp(image, \"Original\"), draw_disp(rot, \"Negatif\");\n\n\twhile (!main_disp.is_closed() && !draw_disp.is_closed()) {\n\t\tcimg_for(rot, ptr, uchar){ *ptr = (*ptr + 1) % 256; }\n\t\tdraw_disp.display(rot);\n\t\tsleep(20);\n\t}\n\treturn 0;\n}<commit_msg>Macros<commit_after>#include \"CImg.h\"\n#include <time.h>\n#include <iostream>\n\nusing namespace std;\n\nusing namespace cimg_library;\ntypedef unsigned char uchar;\n\n#define ANTOINE\n\n#ifdef ANTOINE\n#define FOLDER \"\/Users\/antoineprouvost\/GitHub\/sparse_coding\/images\/\"\n#endif\n\n#ifdef PAUL\n#define FOLDER \"..\/images\/\"\n#endif\n\n#define FILE \"donuts.bmp\"\n\n\nint main(){\n\n\tCImg<uchar> image(FOLDER FILE);\n\tCImg<uchar> rot(image);\n\tuchar * ptr;\n\n\t\n\n\tCImgDisplay main_disp(image, \"Original\"), draw_disp(rot, \"Negatif\");\n\n\twhile (!main_disp.is_closed() && !draw_disp.is_closed()) {\n\t\tcimg_for(rot, ptr, uchar){ *ptr = (*ptr + 1) % 256; }\n\t\tdraw_disp.display(rot);\n\/\/\t\tsleep(20);\n\t}\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\r\n\/\/ main.cpp\r\n\/\/\r\n\/\/ main for pathed\r\n\/\/\r\n\/\/ Copyright (C) 2011 Neil Butterworth\r\n\/\/----------------------------------------------------------------------------\r\n\r\n#include <iostream>\r\n#include <set>\r\n#include \"cmdline.h\"\r\n#include \"error.h\"\r\n#include \"registry.h\"\r\n#include \"util.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Flags controling behaviour in various ways.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const ADD_FLAG = \"-a\";\t\t\t\/\/ add to path\r\nconst char * const REM_FLAG = \"-r\";\t\t\t\/\/ remove from path\r\nconst char * const SYS_FLAG = \"-s\";\t\t\t\/\/ use system instead of user path\r\nconst char * const EXIST_FLAG = \"-f\";\t\t\/\/ check path exists on disk\r\nconst char * const LIST_FLAG = \"-l\";\t\t\/\/ list current path\r\nconst char * const QUERY_FLAG = \"-q\";\t\t\/\/ list current path\r\nconst char * const VERIFY_FLAG = \"-v\";\t\t\/\/ verify path\r\nconst char * const EXPAND_FLAG = \"-x\";\t\t\/\/ expand path\r\nconst char * const PRUNE_FLAG = \"-p\";\t\t\/\/ prune path\r\n\r\nstatic bool Remove = false,\r\n\t\t\tAdd = false,\r\n\t\t\tUseSys = false,\r\n\t\t\tList = false,\r\n\t\t\tCheckExist = true,\r\n\t\t\tQueryPath = false,\r\n\t\t\tVerify = false,\r\n\t\t\tExpand = false,\r\n\t\t\tPrune = false;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Set flags from the command line, shifting them off as they are set.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid SetFlags( CmdLine & cl ) {\r\n\twhile( cl.Argc() > 1 ) {\r\n\t\tstring s = cl.Argv(1);\r\n\t\tif ( s.size() && s[0] == '-' ) {\r\n\t\t\tif ( s == REM_FLAG ) {\r\n\t\t\t\tRemove = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == PRUNE_FLAG ){\r\n\t\t\t\tPrune = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == ADD_FLAG ) {\r\n\t\t\t\tAdd = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == SYS_FLAG ) {\r\n\t\t\t\tUseSys = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXPAND_FLAG ) {\r\n\t\t\t\tExpand = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXIST_FLAG ) {\r\n\t\t\t\tCheckExist = false;\r\n\t\t\t}\r\n\t\t\telse if ( s == LIST_FLAG ) {\r\n\t\t\t\tList = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == QUERY_FLAG ) {\r\n\t\t\t\tQueryPath = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == VERIFY_FLAG ) {\r\n\t\t\t\tVerify = true;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tthrow Error( \"Invalid flag: \" + s );\r\n\t\t\t}\r\n\t\t\tcl.Shift(1);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ List PATH to stdout, one directory per line\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid ListPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tcout << ( Expand ? ExpandPath( path.At(i) ) : path.At(i) ) << \"\\n\";\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Add an entry to the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid AddPath( CmdLine & cl ) {\r\n\tif ( CheckExist ) {\r\n\t\tDWORD attr = GetFileAttributes( cl.Argv(1).c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES || ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tthrow Error( \"No such directory: \" + cl.Argv(1));\r\n\t\t}\r\n\t}\r\n\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( path.Find( cl.Argv(1), RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is already on the path\" );\r\n\t}\r\n\tpath.Add( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Remove entry from the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid RemovePath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( ! path.Find( cl.Argv(1) , RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is not on the path\" );\r\n\t}\r\n\tpath.Remove( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Prune duplicates and non-existent dirs from path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid PrunePath( CmdLine & ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\r\n\ttypedef std::set <string> DirSet;\r\n\tDirSet uniq;\r\n\tstd::vector <string> ordered;\r\n\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring dir = path.At( i );\r\n\t\tstd::pair<DirSet::iterator, bool> ok = uniq.insert( dir );\r\n\t\tif ( ok.second ) {\r\n\t\t\tordered.push_back( dir );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Pruned: \" << dir << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tstring entry;\r\n\r\n\tfor ( unsigned int i = 0; i < ordered.size(); i++ ) {\r\n\t\tstring dir = ExpandPath( ordered[i] );\r\n\t\tDWORD attr = GetFileAttributes( dir.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ||\r\n\t\t\t\t\t\t! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Pruned: \" << ordered[i] << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tif ( entry != \"\" ) {\r\n\t\t\t\tentry += \";\";\r\n\t\t\t}\r\n\t\t\tentry += ordered[i];\r\n\t\t}\r\n\r\n\t}\r\n\tpath.ReplaceAll( entry );\r\n\tstd::cout << entry << std::endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ See if directory is on the path, if so return success code (not boolean!)\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint FindPath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\treturn path.Find( cl.Argv(1), Expand ? RegPath::Expand : RegPath::NoExpand ) ? 0 : 1;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Verify directories on path exist.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint VerifyPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tint bad = 0;\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring epath = ExpandPath( path.At(i) );\r\n\t\tDWORD attr = GetFileAttributes( epath.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ) {\r\n\t\t\tcout << \"No such directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t\telse if ( ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Not a directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t}\r\n\treturn bad == 0 ? 0 : 1;\r\n}\r\n\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Display help\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Help() {\r\n\r\n\tcout <<\r\n\r\n\t\"pathed is a command-line tool for changing the Windows path in the registry\\n\"\r\n\t\"Version 0.3\\n\"\r\n\t\"Copyright (C) 2011 Neil Butterworth\\n\\n\"\r\n\t\"usage: pathed [-a | -r | -l | -q | -v] [-s] [-f] [-x] [dir]\\n\\n\"\r\n\t\"pathed -a dir adds dir to the path in the registry\\n\"\r\n\t\"pathed -r dir removes dir from the path in the registry\\n\"\r\n\t\"pathed -l lists the entries on the current path\\n\"\r\n\t\"pathed -q dir queries registry, returns 0 if dir is on path, 1 otherwise\\n\"\r\n\t\"pathed -v verifies that all directories on the path exist\\n\"\r\n\t\"pathed -p prunes the path by removing duplicates and non-existent directories\\n\\n\"\r\n\t\"By default, pathed works on the path in HKEY_CURRENT_USER. You can make it use\\n\"\r\n\t\"the system path in HKEY_LOCAL_MACHINE by using the -s flag.\\n\\n\"\r\n\t\"Normally, pathed will check a directory exists on disk before adding it to the\\n\"\r\n\t\"path. To prevent this, use the -f flag.\\n\\n\"\r\n\t\"Paths containing environment variables such as %systemroot% will not normally have\\n\"\r\n\t\"the variables expanded to their values. To expand them, use the -x flag\\n\\n\"\r\n\t\"AS WITH ALL COMMANDS THAT CHANGE THE REGISTRY, PATHED CAN CAUSE DAMAGE IF YOU\\n\"\r\n\t\"DO NOT KNOW WHAT YOU ARE DOING. IF IN DOUBT, DO NOT USE IT!\\n\"\r\n\r\n\t<< endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Main for pathed\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n\ttry {\r\n\t\tCmdLine cl( argc, argv );\r\n\r\n\t\tSetFlags( cl );\r\n\r\n\t\tif ( cl.Argc() == 1 && ! ( List || Verify || Prune ) ) {\r\n\t\t\tHelp();\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\telse if ( ! (List || Add || QueryPath || Remove || Verify || Prune ) ) {\r\n\t\t\tthrow Error( \"Need one of -a, -r, -l, -q, -p or -v\" );\r\n\t\t}\r\n\r\n\t\tif ( List ) {\r\n\t\t\tListPath();\r\n\t\t}\r\n\t\telse if ( Verify ) {\r\n\t\t\treturn VerifyPath();\r\n\t\t}\r\n\t\telse if ( QueryPath ) {\r\n\t\t\treturn FindPath( cl );\r\n\t\t}\r\n\t\telse if ( Remove ) {\r\n\t\t\tRemovePath( cl );\r\n\t\t}\r\n\t\telse if ( Prune ) {\r\n\t\t\tPrunePath( cl );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAddPath( cl );\r\n\t\t}\r\n\r\n\t\treturn 0;\r\n\t}\r\n\tcatch( const Error & e ) {\r\n\t\tcerr << e.what() << endl;\r\n\t\treturn 1;\r\n\t}\r\n\tcatch( ... ) {\r\n\t\tcerr << \"Unexpected exception\" << endl;\r\n\t\treturn 1;\r\n\t}\r\n}\r\n<commit_msg>bumped version<commit_after>\/\/----------------------------------------------------------------------------\r\n\/\/ main.cpp\r\n\/\/\r\n\/\/ main for pathed\r\n\/\/\r\n\/\/ Copyright (C) 2011 Neil Butterworth\r\n\/\/----------------------------------------------------------------------------\r\n\r\n#include <iostream>\r\n#include <set>\r\n#include \"cmdline.h\"\r\n#include \"error.h\"\r\n#include \"registry.h\"\r\n#include \"util.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Flags controling behaviour in various ways.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const ADD_FLAG = \"-a\";\t\t\t\/\/ add to path\r\nconst char * const REM_FLAG = \"-r\";\t\t\t\/\/ remove from path\r\nconst char * const SYS_FLAG = \"-s\";\t\t\t\/\/ use system instead of user path\r\nconst char * const EXIST_FLAG = \"-f\";\t\t\/\/ check path exists on disk\r\nconst char * const LIST_FLAG = \"-l\";\t\t\/\/ list current path\r\nconst char * const QUERY_FLAG = \"-q\";\t\t\/\/ list current path\r\nconst char * const VERIFY_FLAG = \"-v\";\t\t\/\/ verify path\r\nconst char * const EXPAND_FLAG = \"-x\";\t\t\/\/ expand path\r\nconst char * const PRUNE_FLAG = \"-p\";\t\t\/\/ prune path\r\n\r\nstatic bool Remove = false,\r\n\t\t\tAdd = false,\r\n\t\t\tUseSys = false,\r\n\t\t\tList = false,\r\n\t\t\tCheckExist = true,\r\n\t\t\tQueryPath = false,\r\n\t\t\tVerify = false,\r\n\t\t\tExpand = false,\r\n\t\t\tPrune = false;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Set flags from the command line, shifting them off as they are set.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid SetFlags( CmdLine & cl ) {\r\n\twhile( cl.Argc() > 1 ) {\r\n\t\tstring s = cl.Argv(1);\r\n\t\tif ( s.size() && s[0] == '-' ) {\r\n\t\t\tif ( s == REM_FLAG ) {\r\n\t\t\t\tRemove = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == PRUNE_FLAG ){\r\n\t\t\t\tPrune = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == ADD_FLAG ) {\r\n\t\t\t\tAdd = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == SYS_FLAG ) {\r\n\t\t\t\tUseSys = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXPAND_FLAG ) {\r\n\t\t\t\tExpand = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXIST_FLAG ) {\r\n\t\t\t\tCheckExist = false;\r\n\t\t\t}\r\n\t\t\telse if ( s == LIST_FLAG ) {\r\n\t\t\t\tList = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == QUERY_FLAG ) {\r\n\t\t\t\tQueryPath = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == VERIFY_FLAG ) {\r\n\t\t\t\tVerify = true;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tthrow Error( \"Invalid flag: \" + s );\r\n\t\t\t}\r\n\t\t\tcl.Shift(1);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ List PATH to stdout, one directory per line\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid ListPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tcout << ( Expand ? ExpandPath( path.At(i) ) : path.At(i) ) << \"\\n\";\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Add an entry to the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid AddPath( CmdLine & cl ) {\r\n\tif ( CheckExist ) {\r\n\t\tDWORD attr = GetFileAttributes( cl.Argv(1).c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES || ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tthrow Error( \"No such directory: \" + cl.Argv(1));\r\n\t\t}\r\n\t}\r\n\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( path.Find( cl.Argv(1), RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is already on the path\" );\r\n\t}\r\n\tpath.Add( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Remove entry from the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid RemovePath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( ! path.Find( cl.Argv(1) , RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is not on the path\" );\r\n\t}\r\n\tpath.Remove( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Prune duplicates and non-existent dirs from path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid PrunePath( CmdLine & ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\r\n\ttypedef std::set <string> DirSet;\r\n\tDirSet uniq;\r\n\tstd::vector <string> ordered;\r\n\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring dir = path.At( i );\r\n\t\tstd::pair<DirSet::iterator, bool> ok = uniq.insert( dir );\r\n\t\tif ( ok.second ) {\r\n\t\t\tordered.push_back( dir );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Pruned: \" << dir << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tstring entry;\r\n\r\n\tfor ( unsigned int i = 0; i < ordered.size(); i++ ) {\r\n\t\tstring dir = ExpandPath( ordered[i] );\r\n\t\tDWORD attr = GetFileAttributes( dir.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ||\r\n\t\t\t\t\t\t! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Pruned: \" << ordered[i] << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tif ( entry != \"\" ) {\r\n\t\t\t\tentry += \";\";\r\n\t\t\t}\r\n\t\t\tentry += ordered[i];\r\n\t\t}\r\n\r\n\t}\r\n\tpath.ReplaceAll( entry );\r\n\tstd::cout << entry << std::endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ See if directory is on the path, if so return success code (not boolean!)\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint FindPath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\treturn path.Find( cl.Argv(1), Expand ? RegPath::Expand : RegPath::NoExpand ) ? 0 : 1;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Verify directories on path exist.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint VerifyPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tint bad = 0;\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring epath = ExpandPath( path.At(i) );\r\n\t\tDWORD attr = GetFileAttributes( epath.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ) {\r\n\t\t\tcout << \"No such directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t\telse if ( ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Not a directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t}\r\n\treturn bad == 0 ? 0 : 1;\r\n}\r\n\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Display help\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Help() {\r\n\r\n\tcout <<\r\n\r\n\t\"pathed is a command-line tool for changing the Windows path in the registry\\n\"\r\n\t\"Version 0.4\\n\"\r\n\t\"Copyright (C) 2011 Neil Butterworth\\n\\n\"\r\n\t\"usage: pathed [-a | -r | -l | -q | -v] [-s] [-f] [-x] [dir]\\n\\n\"\r\n\t\"pathed -a dir adds dir to the path in the registry\\n\"\r\n\t\"pathed -r dir removes dir from the path in the registry\\n\"\r\n\t\"pathed -l lists the entries on the current path\\n\"\r\n\t\"pathed -q dir queries registry, returns 0 if dir is on path, 1 otherwise\\n\"\r\n\t\"pathed -v verifies that all directories on the path exist\\n\"\r\n\t\"pathed -p prunes the path by removing duplicates and non-existent directories\\n\\n\"\r\n\t\"By default, pathed works on the path in HKEY_CURRENT_USER. You can make it use\\n\"\r\n\t\"the system path in HKEY_LOCAL_MACHINE by using the -s flag.\\n\\n\"\r\n\t\"Normally, pathed will check a directory exists on disk before adding it to the\\n\"\r\n\t\"path. To prevent this, use the -f flag.\\n\\n\"\r\n\t\"Paths containing environment variables such as %systemroot% will not normally have\\n\"\r\n\t\"the variables expanded to their values. To expand them, use the -x flag\\n\\n\"\r\n\t\"AS WITH ALL COMMANDS THAT CHANGE THE REGISTRY, PATHED CAN CAUSE DAMAGE IF YOU\\n\"\r\n\t\"DO NOT KNOW WHAT YOU ARE DOING. IF IN DOUBT, DO NOT USE IT!\\n\"\r\n\r\n\t<< endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Main for pathed\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n\ttry {\r\n\t\tCmdLine cl( argc, argv );\r\n\r\n\t\tSetFlags( cl );\r\n\r\n\t\tif ( cl.Argc() == 1 && ! ( List || Verify || Prune ) ) {\r\n\t\t\tHelp();\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\telse if ( ! (List || Add || QueryPath || Remove || Verify || Prune ) ) {\r\n\t\t\tthrow Error( \"Need one of -a, -r, -l, -q, -p or -v\" );\r\n\t\t}\r\n\r\n\t\tif ( List ) {\r\n\t\t\tListPath();\r\n\t\t}\r\n\t\telse if ( Verify ) {\r\n\t\t\treturn VerifyPath();\r\n\t\t}\r\n\t\telse if ( QueryPath ) {\r\n\t\t\treturn FindPath( cl );\r\n\t\t}\r\n\t\telse if ( Remove ) {\r\n\t\t\tRemovePath( cl );\r\n\t\t}\r\n\t\telse if ( Prune ) {\r\n\t\t\tPrunePath( cl );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAddPath( cl );\r\n\t\t}\r\n\r\n\t\treturn 0;\r\n\t}\r\n\tcatch( const Error & e ) {\r\n\t\tcerr << e.what() << endl;\r\n\t\treturn 1;\r\n\t}\r\n\tcatch( ... ) {\r\n\t\tcerr << \"Unexpected exception\" << endl;\r\n\t\treturn 1;\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\nThe MIT License\n\nCopyright (c) 2010-2017 Google, Inc. http:\/\/angularjs.org\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in-\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <v8.h>\n#include <node.h>\n#include \"heap_metrics.h\"\n\nextern \"C\" {\n \nvoid init (v8::Handle <v8::Object> exports, v8::Handle<v8::Object> module)\n{\n \/\/ Instantiate the Singleton Heap Stats Object\n heap_metrics::InitHeapStats();\n\n \/\/ Map the client API's\n NODE_SET_METHOD(exports, \"DumpHeapStats\", heap_metrics::DumpHeapStats);\n NODE_SET_METHOD(exports, \"ForceGC\", heap_metrics::ForceGC);\n}\n\n\/\/ Associate the init() function (above) as the entry point to the Node module. \n\/\/ The function will be invoked on execution of the JavaScript require():\n\/\/\n\/\/ const heapstats = require( 'heapstats.node' );\n\nNODE_MODULE(heap_metrics, init);\n\n}; \/\/ \n<commit_msg>Missed adding init.cpp to previous commit<commit_after>\/*\nThe MIT License\n\nCopyright (c) 2010-2017 Google, Inc. http:\/\/angularjs.org\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in-\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <v8.h>\n#include <node.h>\n#include \"heap_metrics.h\"\n\nextern \"C\" {\n \nvoid init (v8::Handle <v8::Object> exports, v8::Handle<v8::Object> module)\n{\n \/\/ Instantiate the Singleton Heap Metrics Object\n heap_metrics::InitHeapMetrics();\n\n \/\/ Map the client API's\n NODE_SET_METHOD(exports, \"DumpHeapMetrics\", heap_metrics::DumpHeapMetrics);\n NODE_SET_METHOD(exports, \"ForceGC\", heap_metrics::ForceGC);\n}\n\n\/\/ Associate the init() function (above) as the entry point to the Node module. \n\/\/ The function will be invoked on execution of the JavaScript require():\n\/\/\n\/\/ const heap_metrics = require( 'metrics.node' );\n\nNODE_MODULE(heap_metrics, init);\n\n}; \/\/ \n<|endoftext|>"} {"text":"<commit_before>#include <mapbox\/geojsonvt\/geojsonvt.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_clip.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_convert.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_util.hpp>\n\n#include <queue>\n\nnamespace mapbox {\nnamespace util {\nnamespace geojsonvt {\n\nstd::unordered_map<std::string, clock_t> Time::activities;\n\n#pragma mark - GeoJSONVT\n\nstd::vector<ProjectedFeature> GeoJSONVT::convertFeatures(const std::string& data,\n uint8_t baseZoom,\n double tolerance,\n bool debug) {\n\n if (debug) {\n Time::time(\"preprocess data\");\n }\n\n uint32_t z2 = 1 << baseZoom;\n\n JSDocument deserializedData;\n deserializedData.Parse<0>(data.c_str());\n\n if (deserializedData.HasParseError()) {\n printf(\"invalid GeoJSON\\n\");\n return std::vector<ProjectedFeature>();\n }\n\n const uint16_t extent = 4096;\n\n std::vector<ProjectedFeature> features =\n Convert::convert(deserializedData, tolerance \/ (z2 * extent));\n\n if (debug) {\n Time::timeEnd(\"preprocess data\");\n }\n\n return features;\n}\n\nGeoJSONVT::GeoJSONVT(const std::vector<ProjectedFeature>& features_,\n uint8_t baseZoom_,\n uint8_t maxZoom_,\n uint32_t maxPoints_,\n double tolerance_,\n bool debug_)\n : baseZoom(baseZoom_),\n maxZoom(maxZoom_),\n maxPoints(maxPoints_),\n tolerance(tolerance_),\n debug(debug_) {\n\n if (this->debug) {\n Time::time(\"generate tiles up to z\" + std::to_string(maxZoom));\n }\n\n splitTile(features_, 0, 0, 0);\n\n if (this->debug) {\n printf(\"features: %i, points: %i\\n\", this->tiles[0].numFeatures, this->tiles[0].numPoints);\n Time::timeEnd(\"generate tiles up to z\" + std::to_string(maxZoom));\n printf(\"tiles generated: %i {\\n\", this->total);\n for (const auto& pair : this->stats) {\n printf(\" z%i: %i\\n\", pair.first, pair.second);\n }\n printf(\"}\\n\");\n }\n}\n\nvoid GeoJSONVT::splitTile(std::vector<ProjectedFeature> features_,\n uint8_t z_,\n uint32_t x_,\n uint32_t y_,\n int8_t cz,\n int32_t cx,\n int32_t cy) {\n\n std::queue<FeatureStackItem> stack;\n stack.emplace(features_, z_, x_, y_);\n\n while (stack.size()) {\n FeatureStackItem set = stack.front();\n stack.pop();\n std::vector<ProjectedFeature> features = std::move(set.features);\n uint8_t z = set.z;\n uint32_t x = set.x;\n uint32_t y = set.y;\n\n uint32_t z2 = 1 << z;\n const uint64_t id = toID(z, x, y);\n Tile* tile;\n double tileTolerance = (z == this->baseZoom ? 0 : this->tolerance \/ (z2 * this->extent));\n\n if (this->tiles.count(id)) {\n tile = &this->tiles[id];\n } else {\n if (this->debug) {\n Time::time(\"creation\");\n }\n\n this->tiles[id] = std::move(\n Tile::createTile(features, z2, x, y, tileTolerance, extent, (z == this->baseZoom)));\n tile = &this->tiles[id];\n\n if (this->debug) {\n printf(\"tile z%i-%i-%i (features: %i, points: %i, simplified: %i\\n\", z, x, y,\n tile->numFeatures, tile->numPoints, tile->numSimplified);\n Time::timeEnd(\"creation\");\n\n uint8_t key = z;\n this->stats[key] = (this->stats.count(key) ? this->stats[key] + 1 : 1);\n this->total++;\n }\n }\n\n if ((cz < 0 && (z == this->maxZoom || this->tiles[id].numPoints <= this->maxPoints ||\n isClippedSquare(tile->features, this->extent, this->buffer))) ||\n z == this->baseZoom || z == cz) {\n tile->source = std::vector<ProjectedFeature>(features);\n continue;\n }\n\n if (cz >= 0) {\n tile->source = std::vector<ProjectedFeature>(features);\n } else {\n tile->source = {};\n }\n\n if (this->debug) {\n Time::time(\"clipping\");\n }\n\n double k1 = 0.5 * this->buffer \/ this->extent;\n double k2 = 0.5 - k1;\n double k3 = 0.5 + k1;\n double k4 = 1 + k1;\n\n std::vector<ProjectedFeature> tl;\n std::vector<ProjectedFeature> bl;\n std::vector<ProjectedFeature> tr;\n std::vector<ProjectedFeature> br;\n std::vector<ProjectedFeature> left;\n std::vector<ProjectedFeature> right;\n uint32_t m = 0;\n bool goLeft = false;\n bool goTop = false;\n\n if (cz >= 0) {\n m = 1 << (cz - z);\n goLeft = double(cx) \/ double(m) - double(x) < 0.5;\n goTop = double(cy) \/ double(m) - double(y) < 0.5;\n }\n\n if (cz < 0 || goLeft) {\n left = Clip::clip(features, z2, x - k1, x + k3, 0, intersectX);\n }\n\n if (cz < 0 || !goLeft) {\n right = Clip::clip(features, z2, x + k2, x + k4, 0, intersectX);\n }\n\n if (left.size()) {\n if (cz < 0 || goTop) {\n tl = Clip::clip(left, z2, y - k1, y + k3, 1, intersectY);\n }\n\n if (cz < 0 || !goTop) {\n bl = Clip::clip(left, z2, y + k2, y + k4, 1, intersectY);\n }\n }\n\n if (right.size()) {\n if (cz < 0 || goTop) {\n tr = Clip::clip(right, z2, y - k1, y + k3, 1, intersectY);\n }\n\n if (cz < 0 || !goTop) {\n br = Clip::clip(right, z2, y + k2, y + k4, 1, intersectY);\n }\n }\n\n if (this->debug) {\n Time::timeEnd(\"clipping\");\n }\n\n if (tl.size())\n stack.emplace(std::move(tl), z + 1, x * 2, y * 2);\n if (bl.size())\n stack.emplace(std::move(bl), z + 1, x * 2, y * 2 + 1);\n if (tr.size())\n stack.emplace(std::move(tr), z + 1, x * 2 + 1, y * 2);\n if (br.size())\n stack.emplace(std::move(br), z + 1, x * 2 + 1, y * 2 + 1);\n }\n}\n\nTile& GeoJSONVT::getTile(uint8_t z, uint32_t x, uint32_t y) {\n\n std::lock_guard<std::mutex> lock(mtx);\n\n const uint64_t id = toID(z, x, y);\n if (this->tiles.count(id)) {\n return this->tiles[id];\n }\n\n if (this->debug) {\n printf(\"drilling down to z%i-%i-%i\\n\", z, x, y);\n }\n\n uint8_t z0 = z;\n uint32_t x0 = x;\n uint32_t y0 = y;\n Tile* parent = nullptr;\n\n while (!parent && z0) {\n z0--;\n x0 = x0 \/ 2;\n y0 = y0 \/ 2;\n const uint64_t checkID = toID(z0, x0, y0);\n if (this->tiles.count(checkID)) {\n parent = &this->tiles[checkID];\n }\n }\n\n if (this->debug) {\n printf(\"found parent tile z%i-%i-%i\\n\", z0, x0, y0);\n }\n\n if (parent->source.size()) {\n if (isClippedSquare(parent->features, this->extent, this->buffer)) {\n return *parent;\n }\n\n if (this->debug) {\n Time::time(\"drilling down\");\n }\n\n splitTile(parent->source, z0, x0, y0, z, x, y);\n\n if (this->debug) {\n Time::timeEnd(\"drilling down\");\n }\n }\n\n return this->tiles[id];\n}\n\nbool GeoJSONVT::isClippedSquare(const std::vector<TileFeature>& features,\n uint16_t extent_,\n uint8_t buffer_) const {\n\n if (features.size() != 1) {\n return false;\n }\n\n const TileFeature feature = features.front();\n\n if (feature.type != TileFeatureType::Polygon || feature.geometry.size() > 1) {\n return false;\n }\n\n const TileRing* ring = &(feature.geometry.front().get<TileRing>());\n\n for (size_t i = 0; i < ring->points.size(); ++i) {\n const TilePoint* p = &ring->points[i];\n if ((p->x != -buffer_ && p->x != extent_ + buffer_) ||\n (p->y != -buffer_ && p->y != extent_ + buffer_)) {\n return false;\n }\n }\n\n return true;\n}\n\nuint64_t GeoJSONVT::toID(uint8_t z, uint32_t x, uint32_t y) {\n\n return (((1 << z) * y + x) * 32) + z;\n}\n\nProjectedPoint GeoJSONVT::intersectX(const ProjectedPoint& a, const ProjectedPoint& b, double x) {\n\n double r1 = x;\n double r2 = (x - a.x) * (b.y - a.y) \/ (b.x - a.x) + a.y;\n double r3 = 1;\n\n return ProjectedPoint(r1, r2, r3);\n}\n\nProjectedPoint GeoJSONVT::intersectY(const ProjectedPoint& a, const ProjectedPoint& b, double y) {\n\n double r1 = (y - a.y) * (b.x - a.x) \/ (b.y - a.y) + a.x;\n double r2 = y;\n double r3 = 1;\n\n return ProjectedPoint(r1, r2, r3);\n}\n\n} \/\/ namespace geojsonvt\n} \/\/ namespace util\n} \/\/ namespace mapbox\n<commit_msg>better tile drill-down strategy<commit_after>#include <mapbox\/geojsonvt\/geojsonvt.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_clip.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_convert.hpp>\n#include <mapbox\/geojsonvt\/geojsonvt_util.hpp>\n\n#include <queue>\n\nnamespace mapbox {\nnamespace util {\nnamespace geojsonvt {\n\nstd::unordered_map<std::string, clock_t> Time::activities;\n\n#pragma mark - GeoJSONVT\n\nstd::vector<ProjectedFeature> GeoJSONVT::convertFeatures(const std::string& data,\n uint8_t baseZoom,\n double tolerance,\n bool debug) {\n\n if (debug) {\n Time::time(\"preprocess data\");\n }\n\n uint32_t z2 = 1 << baseZoom;\n\n JSDocument deserializedData;\n deserializedData.Parse<0>(data.c_str());\n\n if (deserializedData.HasParseError()) {\n printf(\"invalid GeoJSON\\n\");\n return std::vector<ProjectedFeature>();\n }\n\n const uint16_t extent = 4096;\n\n std::vector<ProjectedFeature> features =\n Convert::convert(deserializedData, tolerance \/ (z2 * extent));\n\n if (debug) {\n Time::timeEnd(\"preprocess data\");\n }\n\n return features;\n}\n\nGeoJSONVT::GeoJSONVT(const std::vector<ProjectedFeature>& features_,\n uint8_t baseZoom_,\n uint8_t maxZoom_,\n uint32_t maxPoints_,\n double tolerance_,\n bool debug_)\n : baseZoom(baseZoom_),\n maxZoom(maxZoom_),\n maxPoints(maxPoints_),\n tolerance(tolerance_),\n debug(debug_) {\n\n if (this->debug) {\n Time::time(\"generate tiles up to z\" + std::to_string(maxZoom));\n }\n\n splitTile(features_, 0, 0, 0);\n\n if (this->debug) {\n printf(\"features: %i, points: %i\\n\", this->tiles[0].numFeatures, this->tiles[0].numPoints);\n Time::timeEnd(\"generate tiles up to z\" + std::to_string(maxZoom));\n printf(\"tiles generated: %i {\\n\", this->total);\n for (const auto& pair : this->stats) {\n printf(\" z%i: %i\\n\", pair.first, pair.second);\n }\n printf(\"}\\n\");\n }\n}\n\nvoid GeoJSONVT::splitTile(std::vector<ProjectedFeature> features_,\n uint8_t z_,\n uint32_t x_,\n uint32_t y_,\n int8_t cz,\n int32_t cx,\n int32_t cy) {\n\n std::queue<FeatureStackItem> stack;\n stack.emplace(features_, z_, x_, y_);\n\n while (stack.size()) {\n FeatureStackItem set = stack.front();\n stack.pop();\n std::vector<ProjectedFeature> features = std::move(set.features);\n uint8_t z = set.z;\n uint32_t x = set.x;\n uint32_t y = set.y;\n\n uint32_t z2 = 1 << z;\n const uint64_t id = toID(z, x, y);\n Tile* tile;\n double tileTolerance = (z == this->baseZoom ? 0 : this->tolerance \/ (z2 * this->extent));\n\n if (this->tiles.count(id)) {\n tile = &this->tiles[id];\n } else {\n if (this->debug) {\n Time::time(\"creation\");\n }\n\n this->tiles[id] = std::move(\n Tile::createTile(features, z2, x, y, tileTolerance, extent, (z == this->baseZoom)));\n tile = &this->tiles[id];\n\n if (this->debug) {\n printf(\"tile z%i-%i-%i (features: %i, points: %i, simplified: %i\\n\", z, x, y,\n tile->numFeatures, tile->numPoints, tile->numSimplified);\n Time::timeEnd(\"creation\");\n\n uint8_t key = z;\n this->stats[key] = (this->stats.count(key) ? this->stats[key] + 1 : 1);\n this->total++;\n }\n }\n\n \/\/ save reference to original geometry in tile so that we can drill down later if we stop now\n tile->source = std::vector<ProjectedFeature>(features);\n\n \/\/ stop tiling if the tile is degenerate\n if (isClippedSquare(tile->features, extent, buffer)) continue;\n\n \/\/ if it's the first-pass tiling\n if (!cz) {\n \/\/ stop tiling if we reached max zoom, or if the tile is too simple\n if (z == maxZoom || tile->numPoints <= maxPoints) continue;\n\n \/\/ if a drilldown to a specific tile\n } else {\n \/\/ stop tiling if we reached base zoom or our target tile zoom\n if (z == baseZoom || z == cz) continue;\n\n \/\/ stop tiling if it's not an ancestor of the target tile\n const auto m = 1 << (cz - z);\n if (x != std::floor(cx \/ m) && y != std::floor(cy \/ m)) continue;\n }\n\n \/\/ if we slice further down, no need to keep source geometry\n tile->source = {};\n\n if (this->debug) {\n Time::time(\"clipping\");\n }\n\n double k1 = 0.5 * this->buffer \/ this->extent;\n double k2 = 0.5 - k1;\n double k3 = 0.5 + k1;\n double k4 = 1 + k1;\n\n std::vector<ProjectedFeature> tl;\n std::vector<ProjectedFeature> bl;\n std::vector<ProjectedFeature> tr;\n std::vector<ProjectedFeature> br;\n std::vector<ProjectedFeature> left;\n std::vector<ProjectedFeature> right;\n\n left = Clip::clip(features, z2, x - k1, x + k3, 0, intersectX);\n right = Clip::clip(features, z2, x + k2, x + k4, 0, intersectX);\n\n if (left.size()) {\n tl = Clip::clip(left, z2, y - k1, y + k3, 1, intersectY);\n bl = Clip::clip(left, z2, y + k2, y + k4, 1, intersectY);\n }\n\n if (right.size()) {\n tr = Clip::clip(right, z2, y - k1, y + k3, 1, intersectY);\n br = Clip::clip(right, z2, y + k2, y + k4, 1, intersectY);\n }\n\n if (this->debug) {\n Time::timeEnd(\"clipping\");\n }\n\n if (tl.size())\n stack.emplace(std::move(tl), z + 1, x * 2, y * 2);\n if (bl.size())\n stack.emplace(std::move(bl), z + 1, x * 2, y * 2 + 1);\n if (tr.size())\n stack.emplace(std::move(tr), z + 1, x * 2 + 1, y * 2);\n if (br.size())\n stack.emplace(std::move(br), z + 1, x * 2 + 1, y * 2 + 1);\n }\n}\n\nTile& GeoJSONVT::getTile(uint8_t z, uint32_t x, uint32_t y) {\n\n std::lock_guard<std::mutex> lock(mtx);\n\n const uint64_t id = toID(z, x, y);\n if (this->tiles.count(id)) {\n return this->tiles[id];\n }\n\n if (this->debug) {\n printf(\"drilling down to z%i-%i-%i\\n\", z, x, y);\n }\n\n uint8_t z0 = z;\n uint32_t x0 = x;\n uint32_t y0 = y;\n Tile* parent = nullptr;\n\n while (!parent && z0) {\n z0--;\n x0 = x0 \/ 2;\n y0 = y0 \/ 2;\n const uint64_t checkID = toID(z0, x0, y0);\n if (this->tiles.count(checkID)) {\n parent = &this->tiles[checkID];\n }\n }\n\n if (this->debug) {\n printf(\"found parent tile z%i-%i-%i\\n\", z0, x0, y0);\n }\n\n if (parent->source.size()) {\n if (isClippedSquare(parent->features, this->extent, this->buffer)) {\n return *parent;\n }\n\n if (this->debug) {\n Time::time(\"drilling down\");\n }\n\n splitTile(parent->source, z0, x0, y0, z, x, y);\n\n if (this->debug) {\n Time::timeEnd(\"drilling down\");\n }\n }\n\n return this->tiles[id];\n}\n\nbool GeoJSONVT::isClippedSquare(const std::vector<TileFeature>& features,\n uint16_t extent_,\n uint8_t buffer_) const {\n\n if (features.size() != 1) {\n return false;\n }\n\n const TileFeature feature = features.front();\n\n if (feature.type != TileFeatureType::Polygon || feature.geometry.size() > 1) {\n return false;\n }\n\n const TileRing* ring = &(feature.geometry.front().get<TileRing>());\n\n for (size_t i = 0; i < ring->points.size(); ++i) {\n const TilePoint* p = &ring->points[i];\n if ((p->x != -buffer_ && p->x != extent_ + buffer_) ||\n (p->y != -buffer_ && p->y != extent_ + buffer_)) {\n return false;\n }\n }\n\n return true;\n}\n\nuint64_t GeoJSONVT::toID(uint8_t z, uint32_t x, uint32_t y) {\n\n return (((1 << z) * y + x) * 32) + z;\n}\n\nProjectedPoint GeoJSONVT::intersectX(const ProjectedPoint& a, const ProjectedPoint& b, double x) {\n\n double r1 = x;\n double r2 = (x - a.x) * (b.y - a.y) \/ (b.x - a.x) + a.y;\n double r3 = 1;\n\n return ProjectedPoint(r1, r2, r3);\n}\n\nProjectedPoint GeoJSONVT::intersectY(const ProjectedPoint& a, const ProjectedPoint& b, double y) {\n\n double r1 = (y - a.y) * (b.x - a.x) \/ (b.y - a.y) + a.x;\n double r2 = y;\n double r3 = 1;\n\n return ProjectedPoint(r1, r2, r3);\n}\n\n} \/\/ namespace geojsonvt\n} \/\/ namespace util\n} \/\/ namespace mapbox\n<|endoftext|>"} {"text":"<commit_before>#include \"gl_core_4_5.h\"\n#include \"GLFW\/glfw3.h\"\n#include \"assimp\/Importer.hpp\"\n#include \"assimp\/postprocess.h\"\n#include \"assimp\/scene.h\"\n#include \"Camera.hpp\"\n#include \"glm\/gtx\/transform.hpp\"\n#include \"Material.hpp\"\n#include \"MeshManager.hpp\"\n#include \"Model.hpp\"\n#include \"RenderManager.hpp\"\n#include \"SceneGraph.hpp\"\n#include \"Shader.hpp\"\n#include \"ShaderManager.hpp\"\n#include \"ShadingProgram.hpp\"\n#include \"Texture.hpp\"\n#include \"TextureManager.hpp\"\n#include \"Mesh.hpp\"\n#include <chrono>\n#include <cstdlib>\n#include <exception>\n#include <iostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nusing namespace GlProj::Graphics;\n\ninline void APIENTRY GLDbgCallback(GLenum source, GLenum type, GLuint id,\n\tGLenum severity, GLsizei length, const GLchar* message,\n\tconst void*)\n{\n\tthread_local static std::string output;\n\toutput.clear();\n\toutput += \"GL error:\\nSource: \";\n\n\tswitch (source)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_SOURCE_OTHER\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_API:\n\t\toutput += \"GL_DEBUG_SOURCE_API\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_WINDOW_SYSTEM:\n\t\toutput += \"GL_DEBUG_SOURCE_WINDOW_SYSTEM\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_SHADER_COMPILER:\n\t\toutput += \"GL_DEBUG_SOURCE_SHADER_COMPILER\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_THIRD_PARTY:\n\t\toutput += \"GL_DEBUG_SOURCE_THIRD_PARTY\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_APPLICATION:\n\t\toutput += \"GL_DEBUG_SOURCE_APPLICATION\";\n\t\tbreak;\n\t}\n\toutput += \"\\nType: \";\n\n\tswitch (type)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_TYPE_OTHER\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_ERROR:\n\t\toutput += \"GL_DEBUG_TYPE_ERROR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR:\n\t\toutput += \"GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR:\n\t\toutput += \"GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PORTABILITY:\n\t\toutput += \"GL_DEBUG_TYPE_PORTABILITY\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PERFORMANCE:\n\t\toutput += \"GL_DEBUG_TYPE_PERFORMANCE\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_MARKER:\n\t\toutput += \"GL_DEBUG_TYPE_MARKER\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PUSH_GROUP:\n\t\toutput += \"GL_DEBUG_TYPE_PUSH_GROUP\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_POP_GROUP:\n\t\toutput += \"GL_DEBUG_TYPE_POP_GROUP\";\n\t\tbreak;\n\t}\n\toutput += \"\\nID: \";\n\toutput += std::to_string(id);\n\toutput += \"\\nSeverity: \";\n\n\tswitch (severity)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_SEVERITY_NOTIFICATION\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_HIGH:\n\t\toutput += \"GL_DEBUG_SEVERITY_HIGH\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_MEDIUM:\n\t\toutput += \"GL_DEBUG_SEVERITY_MEDIUM\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_LOW:\n\t\toutput += \"GL_DEBUG_SEVERITY_LOW\";\n\t\tbreak;\n\t}\n\toutput += \"\\nMessage:\\n\";\n\toutput += message;\n\n\tstd::cout << output << \"\\n\\n\";\n}\n\ninline glm::mat4 aiToGlm(const aiMatrix4x4& o)\n{\n\treturn{o.a1, o.a2, o.a3, o.a4,\n\t\t o.b1, o.b2, o.b3, o.b4,\n\t\t o.c1, o.c2, o.c3, o.c4,\n\t\t o.d1, o.d2, o.d3, o.d4};\n}\n\ninline glm::mat4 ApplyHierarchy(const GlProj::Utilities::SceneNode<ModelData>& n)\n{\n\tauto node = &n;\n\n\tauto t = glm::mat4(1);\n\twhile (node != nullptr)\n\t{\n\t\tt *= node->data.transform;\n\t\tnode = node->parent;\n\t}\n\n\treturn t;\n}\n\nvoid PopulateGraph(SceneGraph<ModelData>& graph, \n\t\t\t\t\tGlProj::Utilities::SceneNode<ModelData>* parent, \n\t\t\t\t\taiNode* node)\n{\n\tparent = graph.emplace(parent, aiToGlm(node->mTransformation),\n\t\t\t\t\t\t\tstd::vector<unsigned int>(node->mMeshes, node->mMeshes + node->mNumMeshes),\n\t\t\t\t\t\t\tnode->mName.C_Str());\n\n\tauto children = node->mChildren;\n\tauto childCount = int(node->mNumChildren);\n\n\tfor(int i = 0; i < childCount; ++i)\n\t{\n\t\tPopulateGraph(graph, parent, children[i]);\n\t}\n}\n\nvoid glfwExecErrorCallback(int, const char* msg)\n{\n\tstd::cerr << \"glfw error: \" << msg << std::endl;\n}\n\nLocalSharedPtr<Material> GetDefaultMaterial()\n{\n\tstatic bool firstRun = true;\n\tstatic auto prog = GenerateProgram();\n\tstatic auto mat = GlProj::Utilities::make_localshared<Material>();\n\tif (!firstRun) return mat;\n\n\tauto vs = LoadShader(GetShaderManager(), GL_VERTEX_SHADER, \".\/data\/shaders\/BasicShader.vs\");\n\tauto fs = LoadShader(GetShaderManager(), GL_FRAGMENT_SHADER, \".\/data\/shaders\/BasicShader.fs\");\n\t\n\tAttachShader(prog.get(), vs.get());\n\tAttachShader(prog.get(), fs.get());\n\tLinkProgram(prog.get());\n\tprog->FetchProgramInfo();\n\n\t*mat = prog;\n\tfirstRun = false;\n\n\treturn mat; \n}\n\nvoid PrepareAndRunGame(GLFWwindow* window)\n{\n\tAssimp::Importer importer{};\n\tauto bunny = importer.ReadFile(\".\/data\/models\/bunny.obj\", aiProcess_Triangulate | aiProcess_CalcTangentSpace | aiProcess_SortByPType | aiProcess_GenUVCoords | aiProcess_OptimizeGraph | aiProcess_OptimizeMeshes | aiProcess_GenSmoothNormals); \n\tif (bunny == nullptr)\n\t{\n\t\tstd::string err;\n\t\terr += importer.GetErrorString();\n\t\tthrow std::runtime_error(err);\n\t}\n\n\tauto& initText = \"System Init\";\n\n\tglPushDebugGroup(GL_DEBUG_SOURCE_APPLICATION, 0, sizeof(initText), initText);\n\tstd::vector<Renderable> submeshes; \n\tsubmeshes.reserve(bunny->mNumMeshes);\n\tauto material = GetDefaultMaterial();\n\n\tfor (int i = 0; i < int(bunny->mNumMeshes); ++i)\n\t{\n\t\tsubmeshes.push_back({ RegisterMesh(GetMeshManager(), bunny->mMeshes[i], bunny->mMeshes[i]->mName.C_Str()), \n\t\t\t\t\t\t\t nullptr });\n\t}\n\n\tSceneGraph<ModelData> bunnyGraph;\n\tPopulateGraph(bunnyGraph, nullptr, bunny->mRootNode);\n\n\tModel bunnyModel{ submeshes, std::move(bunnyGraph) };\n\n\tGlProj::Utilities::TestSceneGraph();\n\n\tglClearColor(0.4f, 0.4f, 0.4f, 1.0f);\n\tauto renderer = GetRenderManager();\n\tauto batch = GenerateRenderBatch(renderer);\n\n\tstd::vector<local_shared_ptr<RenderableHandle>> handles;\n\tfor (int i = 0; i < int(submeshes.size()); ++i)\n\t{\n\t\thandles.push_back(SubmitRenderable(batch.get(), *(submeshes[i].mesh), submeshes[i].material.get()));\n\t}\n\tauto& hierarchy = bunnyModel.GetHierarchy();\n\tfor (auto pos = hierarchy.begin(); pos != hierarchy.end(); ++pos)\n\t{\n\t\tif (pos->meshes.empty()) continue;\n\n\t\tauto transform = ApplyHierarchy(*pos.current);\n\t\tauto& dat = *pos;\n\t\tfor (const auto& i : dat.meshes)\n\t\t{\n\t\t\tSetTransform(handles[i].get(), transform);\n\t\t}\n\t}\n\tSetOverrideMaterial(batch.get(), material.get());\n\tauto cam = Camera{ Camera::Orthographic{glm::vec2{8.0f, 4.5f}}, -5.0f, 5.0f};\n\tcam.transform = Transform{ {0.0f, -1.0f, 0.0f}, glm::quat(), {1.0f, 1.0f, 1.0f} };\n\tUpdateBatchCamera(batch.get(), cam);\n\n\tglPopDebugGroup();\n\n\tauto& renderingGroup = \"Render loop\";\n\n\tglPushDebugGroup(GL_DEBUG_SOURCE_APPLICATION, 1, sizeof(renderingGroup), renderingGroup);\n\n\tfloat angle = 0.0f;\n\tconst float rotationSpeed = 0.2f;\n\tauto prevTime = glfwGetTime();\n\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT |\n\t\t\t\tGL_STENCIL_BUFFER_BIT);\n\n\t\tauto newTime = glfwGetTime();\n\t\tauto delta = newTime - prevTime;\n\t\tprevTime = newTime;\n\t\tangle += float(delta) * rotationSpeed;\n\n\t\thierarchy.begin()->transform = glm::rotate(angle, glm::vec3{0.0f, 1.0f, 0.0f});\n\n\t\tfor (auto pos = hierarchy.begin(); pos != hierarchy.end(); ++pos)\n\t\t{\n\t\t\tif (pos->meshes.empty()) continue;\n\n\t\t\tauto transform = ApplyHierarchy(*pos.current);\n\t\t\tauto& dat = *pos;\n\t\t\tfor (const auto& i : dat.meshes)\n\t\t\t{\n\t\t\t\tSetTransform(handles[i].get(), transform);\n\t\t\t}\n\t\t}\n\n\n\t\tDraw(renderer);\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglPopDebugGroup();\n}\n\nint main()\ntry\n{\n\tstd::ios_base::sync_with_stdio(false);\n\n\tglfwSetErrorCallback(glfwExecErrorCallback);\n\tif (glfwInit() == GLFW_FALSE)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tglfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 4);\n\tglfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 5);\n#ifdef _DEBUG\n\tglfwWindowHint(GLFW_OPENGL_DEBUG_CONTEXT, GLFW_TRUE);\n#endif\n\n\tauto win = glfwCreateWindow(1280, 720, \"Bad Window\", nullptr, nullptr);\n\t\n\tif (win == nullptr)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tint contextMajorVersion = glfwGetWindowAttrib(win, GLFW_CONTEXT_VERSION_MAJOR);\n\tint contextMinorVersion = glfwGetWindowAttrib(win, GLFW_CONTEXT_VERSION_MINOR);\n\t\n\tstd::cout << \"Major version is \" << contextMajorVersion << '\\n';\n\tstd::cout << \"Minor version is \" << contextMinorVersion << std::endl;\n\n\tglfwMakeContextCurrent(win);\n\n\tif (ogl_LoadFunctions() != ogl_LOAD_SUCCEEDED)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tglEnable(GL_DEPTH_TEST);\n\tglEnable(GL_DEBUG_OUTPUT);\n\n\tglDebugMessageCallback(GLDbgCallback, nullptr);\n\n\tglDebugMessageControl(GL_DEBUG_SOURCE_API, GL_DONT_CARE, GL_DEBUG_SEVERITY_NOTIFICATION, 0, nullptr, GL_FALSE);\n\n\tPrepareAndRunGame(win);\n\n\tglfwDestroyWindow(win);\n\tglfwTerminate();\n}\ncatch(std::exception& e)\n{\n\tstd::cerr << e.what() << std::endl;\n\tthrow;\n}\n<commit_msg>Added an algorithm for converting meshes with the same name into unique names. Working on post processing. UVs aren't being generated.<commit_after>#include \"gl_core_4_5.h\"\n#include \"GLFW\/glfw3.h\"\n#include \"assimp\\DefaultLogger.hpp\"\n#include \"assimp\/Importer.hpp\"\n#include \"assimp\/postprocess.h\"\n#include \"assimp\/scene.h\"\n#include \"Camera.hpp\"\n#include \"glm\/gtx\/transform.hpp\"\n#include \"Material.hpp\"\n#include \"MeshManager.hpp\"\n#include \"Model.hpp\"\n#include \"RenderManager.hpp\"\n#include \"SceneGraph.hpp\"\n#include \"Shader.hpp\"\n#include \"ShaderManager.hpp\"\n#include \"ShadingProgram.hpp\"\n#include \"Texture.hpp\"\n#include \"TextureManager.hpp\"\n#include \"Mesh.hpp\"\n#include <algorithm>\n#include <chrono>\n#include <cstdlib>\n#include <exception>\n#include <iostream>\n#include <iterator>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\nusing namespace GlProj::Graphics;\n\ninline void APIENTRY GLDbgCallback(GLenum source, GLenum type, GLuint id,\n\tGLenum severity, GLsizei length, const GLchar* message,\n\tconst void*)\n{\n\tthread_local static std::string output;\n\toutput.clear();\n\toutput += \"GL error:\\nSource: \";\n\n\tswitch (source)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_SOURCE_OTHER\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_API:\n\t\toutput += \"GL_DEBUG_SOURCE_API\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_WINDOW_SYSTEM:\n\t\toutput += \"GL_DEBUG_SOURCE_WINDOW_SYSTEM\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_SHADER_COMPILER:\n\t\toutput += \"GL_DEBUG_SOURCE_SHADER_COMPILER\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_THIRD_PARTY:\n\t\toutput += \"GL_DEBUG_SOURCE_THIRD_PARTY\";\n\t\tbreak;\n\tcase GL_DEBUG_SOURCE_APPLICATION:\n\t\toutput += \"GL_DEBUG_SOURCE_APPLICATION\";\n\t\tbreak;\n\t}\n\toutput += \"\\nType: \";\n\n\tswitch (type)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_TYPE_OTHER\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_ERROR:\n\t\toutput += \"GL_DEBUG_TYPE_ERROR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR:\n\t\toutput += \"GL_DEBUG_TYPE_DEPRECATED_BEHAVIOR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR:\n\t\toutput += \"GL_DEBUG_TYPE_UNDEFINED_BEHAVIOR\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PORTABILITY:\n\t\toutput += \"GL_DEBUG_TYPE_PORTABILITY\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PERFORMANCE:\n\t\toutput += \"GL_DEBUG_TYPE_PERFORMANCE\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_MARKER:\n\t\toutput += \"GL_DEBUG_TYPE_MARKER\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_PUSH_GROUP:\n\t\toutput += \"GL_DEBUG_TYPE_PUSH_GROUP\";\n\t\tbreak;\n\tcase GL_DEBUG_TYPE_POP_GROUP:\n\t\toutput += \"GL_DEBUG_TYPE_POP_GROUP\";\n\t\tbreak;\n\t}\n\toutput += \"\\nID: \";\n\toutput += std::to_string(id);\n\toutput += \"\\nSeverity: \";\n\n\tswitch (severity)\n\t{\n\tdefault:\n\t\toutput += \"GL_DEBUG_SEVERITY_NOTIFICATION\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_HIGH:\n\t\toutput += \"GL_DEBUG_SEVERITY_HIGH\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_MEDIUM:\n\t\toutput += \"GL_DEBUG_SEVERITY_MEDIUM\";\n\t\tbreak;\n\tcase GL_DEBUG_SEVERITY_LOW:\n\t\toutput += \"GL_DEBUG_SEVERITY_LOW\";\n\t\tbreak;\n\t}\n\toutput += \"\\nMessage:\\n\";\n\toutput += message;\n\n\tstd::cout << output << \"\\n\\n\";\n}\n\ninline glm::mat4 aiToGlm(const aiMatrix4x4& o)\n{\n\treturn{o.a1, o.a2, o.a3, o.a4,\n\t\t o.b1, o.b2, o.b3, o.b4,\n\t\t o.c1, o.c2, o.c3, o.c4,\n\t\t o.d1, o.d2, o.d3, o.d4};\n}\n\ntemplate<typename I>\n\/\/requires value_type of iterator is std::string\ninline void MakeNamesUnique(I first, I last)\n{\n\tauto firstMesh = first;\n\twhile (firstMesh != last)\n\t{\n\t\tauto pairStart = std::adjacent_find(firstMesh, last);\n\t\tif (pairStart == last)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tint i = 0;\n\n\t\tstd::string prev = *pairStart;\n\t\tauto first = pairStart;\n\t\t\/\/First duplicate will have a 0-suffix\n\t\t*first += std::to_string(i);\n\t\t++i;\n\t\t++pairStart;\n\t\t\/\/Second duplicate will have a 1-suffix\n\t\t*pairStart += std::to_string(i);\n\t\t++pairStart;\n\t\t++i;\n\t\t\/\/Subsequent duplicates will have\n\t\twhile (pairStart != last && *pairStart == prev)\n\t\t{\n\t\t\t*pairStart += std::to_string(i);\n\t\t\t++pairStart;\n\t\t\t++i;\n\t\t}\n\t\tfirstMesh = pairStart;\n\t}\n}\n\ninline glm::mat4 ApplyHierarchy(const GlProj::Utilities::SceneNode<ModelData>& n)\n{\n\tauto node = &n;\n\n\tauto t = glm::mat4(1);\n\twhile (node != nullptr)\n\t{\n\t\tt *= node->data.transform;\n\t\tnode = node->parent;\n\t}\n\n\treturn t;\n}\n\nvoid PopulateGraph(SceneGraph<ModelData>& graph, \n\t\t\t\t\tGlProj::Utilities::SceneNode<ModelData>* parent, \n\t\t\t\t\taiNode* node)\n{\n\tparent = graph.emplace(parent, aiToGlm(node->mTransformation),\n\t\t\t\t\t\t\tstd::vector<unsigned int>(node->mMeshes, node->mMeshes + node->mNumMeshes),\n\t\t\t\t\t\t\tnode->mName.C_Str());\n\n\tauto children = node->mChildren;\n\tauto childCount = int(node->mNumChildren);\n\n\tfor(int i = 0; i < childCount; ++i)\n\t{\n\t\tPopulateGraph(graph, parent, children[i]);\n\t}\n}\n\nvoid glfwExecErrorCallback(int, const char* msg)\n{\n\tstd::cerr << \"glfw error: \" << msg << std::endl;\n}\n\nLocalSharedPtr<Material> GetDefaultMaterial()\n{\n\tstatic bool firstRun = true;\n\tstatic auto prog = GenerateProgram();\n\tstatic auto mat = GlProj::Utilities::make_localshared<Material>();\n\tif (!firstRun) return mat;\n\n\tauto vs = LoadShader(GetShaderManager(), GL_VERTEX_SHADER, \".\/data\/shaders\/BasicShader.vs\");\n\tauto fs = LoadShader(GetShaderManager(), GL_FRAGMENT_SHADER, \".\/data\/shaders\/BasicShader.fs\");\n\t\n\tAttachShader(prog.get(), vs.get());\n\tAttachShader(prog.get(), fs.get());\n\tLinkProgram(prog.get());\n\tprog->FetchProgramInfo();\n\n\t*mat = prog;\n\tfirstRun = false;\n\n\treturn mat; \n}\n\nvoid PrepareAndRunGame(GLFWwindow* window)\n{\n\tAssimp::Importer importer{};\n\tauto newLogger = Assimp::DefaultLogger::create(\"AssimpLog.txt\", Assimp::Logger::NORMAL, aiDefaultLogStream_STDOUT);\n\tauto bunny = importer.ReadFile(\".\/data\/models\/bunny.obj\", aiProcess_Triangulate | aiProcess_SortByPType \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| aiProcess_GenUVCoords | aiProcess_OptimizeGraph \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t| aiProcess_OptimizeMeshes | aiProcess_GenSmoothNormals); \n\n\timporter.SetPropertyInteger(AI_CONFIG_PP_SLM_TRIANGLE_LIMIT, 32767);\n\tbunny = importer.ApplyPostProcessing(aiProcess_SplitLargeMeshes | aiProcess_CalcTangentSpace | aiProcess_ValidateDataStructure);\n\n\tif (bunny == nullptr)\n\t{\n\t\tstd::string err;\n\t\terr += importer.GetErrorString();\n\t\tthrow std::runtime_error(err);\n\t}\n\n\tAssimp::DefaultLogger::kill();\n\n\tauto& initText = \"System Init\";\n\n\tglPushDebugGroup(GL_DEBUG_SOURCE_APPLICATION, 0, sizeof(initText), initText);\n\tstd::vector<Renderable> submeshes; \n\tsubmeshes.reserve(bunny->mNumMeshes);\n\tauto material = GetDefaultMaterial();\n\n\tstd::vector<std::string> meshNames;\n\tmeshNames.reserve(bunny->mNumMeshes);\n\tstd::transform(bunny->mMeshes, bunny->mMeshes + bunny->mNumMeshes, std::back_inserter(meshNames), \n\t\t[](const auto& x)\n\t{\n\t\treturn x->mName.C_Str();\n\t});\n\n\tMakeNamesUnique(meshNames.begin(), meshNames.end());\n\n\tfor (int i = 0; i < int(bunny->mNumMeshes); ++i)\n\t{\n\t\tsubmeshes.push_back({ RegisterMesh(GetMeshManager(), bunny->mMeshes[i], meshNames[i]),\n\t\t\t\t\t\t\t nullptr });\n\t}\n\n\tSceneGraph<ModelData> bunnyGraph;\n\tPopulateGraph(bunnyGraph, nullptr, bunny->mRootNode);\n\n\tModel bunnyModel{ submeshes, std::move(bunnyGraph) };\n\n\tGlProj::Utilities::TestSceneGraph();\n\n\tglClearColor(0.4f, 0.4f, 0.4f, 1.0f);\n\tauto renderer = GetRenderManager();\n\tauto batch = GenerateRenderBatch(renderer);\n\n\tstd::vector<local_shared_ptr<RenderableHandle>> handles;\n\tfor (int i = 0; i < int(submeshes.size()); ++i)\n\t{\n\t\thandles.push_back(SubmitRenderable(batch.get(), *(submeshes[i].mesh), submeshes[i].material.get()));\n\t}\n\tauto& hierarchy = bunnyModel.GetHierarchy();\n\tfor (auto pos = hierarchy.begin(); pos != hierarchy.end(); ++pos)\n\t{\n\t\tif (pos->meshes.empty()) continue;\n\n\t\tauto transform = ApplyHierarchy(*pos.current);\n\t\tauto& dat = *pos;\n\t\tfor (const auto& i : dat.meshes)\n\t\t{\n\t\t\tSetTransform(handles[i].get(), transform);\n\t\t}\n\t}\n\tSetOverrideMaterial(batch.get(), material.get());\n\tauto cam = Camera{ Camera::Orthographic{glm::vec2{8.0f, 4.5f}}, -5.0f, 5.0f};\n\tcam.transform = Transform{ {0.0f, -1.0f, 0.0f}, glm::quat(), {1.0f, 1.0f, 1.0f} };\n\tUpdateBatchCamera(batch.get(), cam);\n\n\tglPopDebugGroup();\n\n\tauto& renderingGroup = \"Render loop\";\n\n\tglPushDebugGroup(GL_DEBUG_SOURCE_APPLICATION, 1, sizeof(renderingGroup), renderingGroup);\n\n\tfloat angle = 0.0f;\n\tconst float rotationSpeed = 0.2f;\n\tauto prevTime = glfwGetTime();\n\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT |\n\t\t\t\tGL_STENCIL_BUFFER_BIT);\n\n\t\tauto newTime = glfwGetTime();\n\t\tauto delta = newTime - prevTime;\n\t\tprevTime = newTime;\n\t\tangle += float(delta) * rotationSpeed;\n\n\t\thierarchy.begin()->transform = glm::rotate(angle, glm::vec3{0.0f, 1.0f, 0.0f});\n\n\t\tfor (auto pos = hierarchy.begin(); pos != hierarchy.end(); ++pos)\n\t\t{\n\t\t\tif (pos->meshes.empty()) continue;\n\n\t\t\tauto transform = ApplyHierarchy(*pos.current);\n\t\t\tauto& dat = *pos;\n\t\t\tfor (const auto& i : dat.meshes)\n\t\t\t{\n\t\t\t\tSetTransform(handles[i].get(), transform);\n\t\t\t}\n\t\t}\n\n\n\t\tDraw(renderer);\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglPopDebugGroup();\n}\n\nint main()\ntry\n{\n\tstd::ios_base::sync_with_stdio(false);\n\n\tglfwSetErrorCallback(glfwExecErrorCallback);\n\tif (glfwInit() == GLFW_FALSE)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tglfwWindowHint(GLFW_CONTEXT_VERSION_MAJOR, 4);\n\tglfwWindowHint(GLFW_CONTEXT_VERSION_MINOR, 5);\n#ifdef _DEBUG\n\tglfwWindowHint(GLFW_OPENGL_DEBUG_CONTEXT, GLFW_TRUE);\n#endif\n\n\tauto win = glfwCreateWindow(1280, 720, \"Bad Window\", nullptr, nullptr);\n\t\n\tif (win == nullptr)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tint contextMajorVersion = glfwGetWindowAttrib(win, GLFW_CONTEXT_VERSION_MAJOR);\n\tint contextMinorVersion = glfwGetWindowAttrib(win, GLFW_CONTEXT_VERSION_MINOR);\n\t\n\tstd::cout << \"Major version is \" << contextMajorVersion << '\\n';\n\tstd::cout << \"Minor version is \" << contextMinorVersion << std::endl;\n\n\tglfwMakeContextCurrent(win);\n\n\tif (ogl_LoadFunctions() != ogl_LOAD_SUCCEEDED)\n\t{\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tglEnable(GL_DEPTH_TEST);\n\tglEnable(GL_DEBUG_OUTPUT);\n\n\tglDebugMessageCallback(GLDbgCallback, nullptr);\n\n\t\/\/glDebugMessageControl(GL_DEBUG_SOURCE_API, GL_DONT_CARE, GL_DEBUG_SEVERITY_NOTIFICATION, 0, nullptr, GL_FALSE);\n\n\tPrepareAndRunGame(win);\n\n\tglfwDestroyWindow(win);\n\tglfwTerminate();\n}\ncatch(std::exception& e)\n{\n\tstd::cerr << e.what() << std::endl;\n\tthrow;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ PointPairFeatures\n\/\/\n\/\/ Created by Adrian Haarbach on 27.06.14.\n\/\/ Copyright (c) 2014 Adrian Haarbach. All rights reserved.\n\/\/\n#include \"Visualize.h\"\n#include \"LoadingSaving.h\"\n#include \"PointPairFeatures.h\"\n#include \"PointCloudManipulation.h\"\n\n\n\n\nint main(int argc, char * argv[])\n{\n \n \n \/\/MatrixXd m = MatrixXd::Random(200,6);\n \n MatrixXd m=LoadingSaving::loadXYZ(\"bunny\/model.xyz\");\/\/.block(0, 0, 1000, 6);\n \n \n MatrixXd mSmall=PointCloudManipulation::downSample(m,false);\n \n \/\/double diamM=PointCloudManipulation::getPointCloudDiameter(mSmall);\n\n \n \/\/LoadingSaving::saveXYZ(\"bunny\/model_downSampled.xyz\", mSmall);\n \/\/MatrixXd mSmallVoxelCenter=PointPairFeatures::downSample(m,true);\n \n \/\/Visualize::getInstance()->ms.push_back({m,RowVector3f(1,0,0)});\n \/\/Visualize::getInstance()->ms.push_back({mSmall,RowVector3f(1,0.5,0)});\n \/\/Visualize::getInstance()->ms.push_back({mSmallVoxelCenter,RowVector3f(1,0.9,0)});\n\n \n MatrixXd s=LoadingSaving::loadXYZ(\"bunny\/scene.xyz\");\n MatrixXd sSmall=PointCloudManipulation::downSample(s,false);\n \/\/LoadingSaving::saveXYZ(\"bunny\/scene_downSampled.xyz\", sSmall);\n \n Projective3d P= Translation3d(0.1, 0, 0)*AngleAxisd(0.2, Vector3d(1,0,0));\/\/ * Scaling(s);\n sSmall=PointCloudManipulation::projectPointsAndNormals(P, sSmall);\n \n PointPairFeatures* ppfs=new PointPairFeatures();\n\n\n \n \/\/Visualize::getInstance()->ms.push_back({sSmall,RowVector3f(0.5,1,0)});\n \n GlobalModelDescription map = ppfs->buildGlobalModelDescription(mSmall);\n \n Matches matches = ppfs->matchSceneAgainstModel(sSmall, map);\n \n vector<MatrixXi> accVec=ppfs->voting(matches);\n \n \/\/cout<<accVec[0]<<endl;\n \n Poses Pests = ppfs->computePoses(accVec, mSmall, sSmall);\n \n Projective3d Pest=ppfs->clusterPoses(Pests);\n\n cout<<\"groundtruth:\"<<endl;\n cout<<P.matrix()<<endl;\n \n \n \/\/MatrixXd modelPoseEst=PointCloudManipulation::projectPointsAndNormals(Pest, m);\n\n\n \/\/printMap(map);\n \/\/KeyBucketPairList best10=PointPairFeatures::print10(map);\n \n \/\/Visualize::getInstance()->b=best10;\n \n Visualize* inst=Visualize::getInstance();\n inst->model=mSmall;\n inst->scene=sSmall;\n \/\/inst->modelT=modelPoseEst;\n inst->matches=matches;\n Visualize::visualize();\n\n\n}<commit_msg>commented out clusterPoses to get nicer output for testing<commit_after>\/\/\n\/\/ main.cpp\n\/\/ PointPairFeatures\n\/\/\n\/\/ Created by Adrian Haarbach on 27.06.14.\n\/\/ Copyright (c) 2014 Adrian Haarbach. All rights reserved.\n\/\/\n#include \"Visualize.h\"\n#include \"LoadingSaving.h\"\n#include \"PointPairFeatures.h\"\n#include \"PointCloudManipulation.h\"\n\n\n\n\nint main(int argc, char * argv[])\n{\n \n \n \/\/MatrixXd m = MatrixXd::Random(200,6);\n \n MatrixXd m=LoadingSaving::loadXYZ(\"bunny\/model.xyz\");\/\/.block(0, 0, 1000, 6);\n \n \n MatrixXd mSmall=PointCloudManipulation::downSample(m,false);\n \n \/\/double diamM=PointCloudManipulation::getPointCloudDiameter(mSmall);\n\n \n \/\/LoadingSaving::saveXYZ(\"bunny\/model_downSampled.xyz\", mSmall);\n \/\/MatrixXd mSmallVoxelCenter=PointPairFeatures::downSample(m,true);\n \n \/\/Visualize::getInstance()->ms.push_back({m,RowVector3f(1,0,0)});\n \/\/Visualize::getInstance()->ms.push_back({mSmall,RowVector3f(1,0.5,0)});\n \/\/Visualize::getInstance()->ms.push_back({mSmallVoxelCenter,RowVector3f(1,0.9,0)});\n\n \n MatrixXd s=LoadingSaving::loadXYZ(\"bunny\/scene.xyz\");\n MatrixXd sSmall=PointCloudManipulation::downSample(s,false);\n \/\/LoadingSaving::saveXYZ(\"bunny\/scene_downSampled.xyz\", sSmall);\n \n Projective3d P= Translation3d(0.1, 0, 0)*AngleAxisd(0.2, Vector3d(1,0,0));\/\/ * Scaling(s);\n sSmall=PointCloudManipulation::projectPointsAndNormals(P, sSmall);\n \n PointPairFeatures* ppfs=new PointPairFeatures();\n\n\n \n \/\/Visualize::getInstance()->ms.push_back({sSmall,RowVector3f(0.5,1,0)});\n \n GlobalModelDescription map = ppfs->buildGlobalModelDescription(mSmall);\n \n Matches matches = ppfs->matchSceneAgainstModel(sSmall, map);\n \n vector<MatrixXi> accVec=ppfs->voting(matches);\n \n \/\/cout<<accVec[0]<<endl;\n \n Poses Pests = ppfs->computePoses(accVec, mSmall, sSmall);\n \n \/\/Projective3d Pest=ppfs->clusterPoses(Pests);\n\n cout<<\"groundtruth:\"<<endl;\n cout<<P.matrix()<<endl;\n \n \n \/\/MatrixXd modelPoseEst=PointCloudManipulation::projectPointsAndNormals(Pest, m);\n\n\n \/\/printMap(map);\n \/\/KeyBucketPairList best10=PointPairFeatures::print10(map);\n \n \/\/Visualize::getInstance()->b=best10;\n \n Visualize* inst=Visualize::getInstance();\n inst->model=mSmall;\n inst->scene=sSmall;\n \/\/inst->modelT=modelPoseEst;\n inst->matches=matches;\n Visualize::visualize();\n\n\n}<|endoftext|>"} {"text":"<commit_before>#include \"resplunk\/event\/CancellableEvent.hpp\"\n#include \"resplunk\/event\/CloneableEvent.hpp\"\n\n#include <iostream>\n\ntemplate<typename... Args>\nusing EventImplementor = resplunk::event::EventImplementor<Args...>;\nusing CancellableEvent = resplunk::event::CancellableEvent;\ntemplate<typename... Args>\nusing EventProcessor = resplunk::event::EventProcessor<Args...>;\ntemplate<typename... Args>\nusing EventReactor = resplunk::event::EventReactor<Args...>;\ntemplate<template<typename, typename...> typename Arg = std::unique_ptr, typename... Args>\nusing CloneableEvent = resplunk::event::CloneableEvent<Arg, Args...>;\ntemplate<typename... Args>\nusing LambdaEventProcessor = resplunk::event::LambdaEventProcessor<Args...>;\nusing Event = resplunk::event::Event;\nusing ListenerPriority = resplunk::event::ListenerPriority;\n\nstruct TestEvent\n: EventImplementor<TestEvent, CancellableEvent>\n{\n\tint x;\n\tTestEvent(int x) noexcept\n\t: x(x)\n\t{\n\t}\n};\n\nstruct TestListener\n: EventProcessor<TestEvent>\n, EventReactor<TestEvent>\n{\n\tTestListener() noexcept\n\t{\n\t}\n\n\tvirtual void onEvent(TestEvent &e) const noexcept override\n\t{\n\t\tstd::cout << \"P x = \" << e.x << std::endl;\n\t\tif(e.x > 10)\n\t\t{\n\t\t\te.x = 10;\n\t\t}\n\t\telse if(e.x < 0)\n\t\t{\n\t\t\te.cancelled(true);\n\t\t}\n\t}\n\tvirtual void onEvent(TestEvent const &e) noexcept override\n\t{\n\t\tstd::cout << \"R x = \" << e.x << std::endl;\n\t}\n};\n\nstruct TestEventA\n: EventImplementor<TestEventA, TestEvent>\n{\n\tTestEventA() noexcept\n\t: TestEvent(1)\n\t{\n\t}\n};\nstruct TestEventB\n: EventImplementor<TestEventB, TestEvent>\n{\n\tTestEventB() noexcept\n\t: TestEvent(2)\n\t{\n\t}\n};\n\nstruct DerivedTestEvent\n: EventImplementor<DerivedTestEvent, TestEventA, TestEventB>\n{\n\tDerivedTestEvent() noexcept\n\t: TestEvent(4)\n\t{\n\t}\n};\n\nstruct CloneableTestEvent\n: EventImplementor<CloneableTestEvent, TestEvent, CloneableEvent<>>\n{\n\tCloneableTestEvent(int x) noexcept\n\t: TestEvent(x)\n\t{\n\t}\n\nprivate:\n\tvirtual CloneableTestEvent *clone() const noexcept override\n\t{\n\t\treturn new CloneableTestEvent(x);\n\t}\n};\n\nint main(int nargs, char **args) noexcept\n{\n\tLambdaEventProcessor<Event> lep\n\t{\n\t\t[](Event &e)\n\t\t{\n\t\t\tstd::cout << std::endl << \"E @ \" << &e\n\t\t\t<< \" is \\\"\" << typeid(e).name() << '\"' << std::endl;\n\t\t},\n\t\tListenerPriority::FIRST\n\t};\n\tTestListener l;\n\tTestEvent{7}.call();\n\tTestEvent{-1}.call();\n\tTestEvent{14}.call();\n\tDerivedTestEvent{}.call();\n\tCloneableTestEvent::Clone(CloneableTestEvent{9})->call();\n}\n<commit_msg>Small tweak to test code<commit_after>#include \"resplunk\/event\/CancellableEvent.hpp\"\n#include \"resplunk\/event\/CloneableEvent.hpp\"\n\n#include <iostream>\n\ntemplate<typename... Args>\nusing EventImplementor = resplunk::event::EventImplementor<Args...>;\nusing CancellableEvent = resplunk::event::CancellableEvent;\ntemplate<typename... Args>\nusing EventProcessor = resplunk::event::EventProcessor<Args...>;\ntemplate<typename... Args>\nusing EventReactor = resplunk::event::EventReactor<Args...>;\ntemplate<template<typename, typename...> typename Arg = std::unique_ptr, typename... Args>\nusing CloneableEvent = resplunk::event::CloneableEvent<Arg, Args...>;\ntemplate<typename... Args>\nusing LambdaEventProcessor = resplunk::event::LambdaEventProcessor<Args...>;\nusing Event = resplunk::event::Event;\nusing ListenerPriority = resplunk::event::ListenerPriority;\n\nstruct TestEvent\n: EventImplementor<TestEvent, CancellableEvent>\n{\n\tint x;\n\tTestEvent(int x) noexcept\n\t: x(x)\n\t{\n\t}\n};\n\nstruct TestListener\n: EventProcessor<TestEvent>\n, EventReactor<TestEvent>\n{\n\tTestListener() noexcept\n\t{\n\t}\n\n\tvirtual void onEvent(TestEvent &e) const noexcept override\n\t{\n\t\tstd::cout << \"P x = \" << e.x << std::endl;\n\t\tif(e.x > 10)\n\t\t{\n\t\t\te.x = 10;\n\t\t}\n\t\telse if(e.x < 0)\n\t\t{\n\t\t\te.cancelled(true);\n\t\t}\n\t}\n\tvirtual void onEvent(TestEvent const &e) noexcept override\n\t{\n\t\tstd::cout << \"R x = \" << e.x << std::endl;\n\t}\n};\n\nstruct TestEventA\n: EventImplementor<TestEventA, TestEvent>\n{\n\tTestEventA() noexcept\n\t: TestEvent(1)\n\t{\n\t}\n};\nstruct TestEventB\n: EventImplementor<TestEventB, TestEvent>\n{\n\tTestEventB() noexcept\n\t: TestEvent(2)\n\t{\n\t}\n};\n\nstruct DerivedTestEvent\n: EventImplementor<DerivedTestEvent, TestEventA, TestEventB>\n{\n\tDerivedTestEvent(int x) noexcept\n\t: TestEvent(x)\n\t{\n\t}\n};\n\nstruct CloneableTestEvent\n: EventImplementor<CloneableTestEvent, TestEvent, CloneableEvent<>>\n{\n\tCloneableTestEvent(int x) noexcept\n\t: TestEvent(x)\n\t{\n\t}\n\nprivate:\n\tvirtual CloneableTestEvent *clone() const noexcept override\n\t{\n\t\treturn new CloneableTestEvent(x);\n\t}\n};\n\nint main(int nargs, char **args) noexcept\n{\n\tLambdaEventProcessor<Event> lep\n\t{\n\t\t[](Event &e)\n\t\t{\n\t\t\tstd::cout << std::endl << \"E @ \" << &e\n\t\t\t<< \" is \\\"\" << typeid(e).name() << '\"' << std::endl;\n\t\t},\n\t\tListenerPriority::FIRST\n\t};\n\tTestListener l;\n\tTestEvent{7}.call();\n\tTestEvent{-1}.call();\n\tTestEvent{14}.call();\n\tDerivedTestEvent{4}.call();\n\tCloneableTestEvent::Clone(CloneableTestEvent{9})->call();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/stl list\n\/\/载入头文件\n#include <iostream>\n#include <list>\n\nusing namespace std;\n\n\ntypedef struct {\n\tchar name[21];\n\tint id;\n} note ;\n\n\nint main(int argc, char const *argv[])\n{\n\t\/\/建立\n\tlist<int> L0; \/\/ 空链表\n\tlist<int> L1(9); \/\/ 建一个含一个元素的链表\n\tlist<int> L2(5,1); \/\/ 建一个多个个元素的链表\n\tlist<int> L3(L2); \/\/ 复制L2的元素，重新建立一个链表\n\tlist<int> L4(L0.begin(), L0.end());\/\/建一个含L0一个区域的链表\n\n\t\/\/其他元素类型的链表\n\n\tlist<double> Ld;\n\tlist<int [3]>Larray;\n\tlist<note> Lu;\n\n\n\t\/\/链表操作\n\tlist<int> l;\n\tl.push_front(1);\n\tl.push(2);\n\n\n\treturn 0;\n}<commit_msg>update list<commit_after>\/\/stl list\n\/\/载入头文件\n#include <iostream>\n#include <list>\n\nusing namespace std;\n\n\ntypedef struct {\n\tchar name[21];\n\tint id;\n} note ;\n\n\nint main(int argc, char const *argv[])\n{\n\t\/\/建立\n\tlist<int> L0; \/\/ 空链表\n\tlist<int> L1(9); \/\/ 建一个含一个元素的链表\n\tlist<int> L2(5,1); \/\/ 建一个多个个元素的链表\n\tlist<int> L3(L2); \/\/ 复制L2的元素，重新建立一个链表\n\tlist<int> L4(L0.begin(), L0.end());\/\/建一个含L0一个区域的链表\n\n\t\/\/其他元素类型的链表\n\n\tlist<double> Ld;\n\tlist<int [3]>Larray;\n\tlist<note> Lu;\n\n\n\t\/\/链表操作\n\t\/\/一个链表\n\tlist<int> l;\n\t\/\/在链表头部插入元素\n\tl.push_front(1);\n\t\/\/尾部\n\tl.push_back(2);\n\n\t\n\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include <gspan.h>\n#include <graph.h>\n#include <common.h>\n#include <sstream>\n\nnamespace gspan {\n\nvoid GSpan::find_frequent_nodes(const vector<Graph> &graphs) {\n unordered_map<size_t, size_t> vertex_labels;\n unordered_map<size_t, size_t> edge_labels;\n\n for (size_t i = 0; i < graphs.size(); ++i) {\n unordered_set<size_t> vertex_set;\n unordered_set<size_t> edge_set;\n for (size_t j = 0; j < graphs[i].size(); ++j) {\n const struct vertex_t *vertex = graphs[i].get_p_vertex(j);\n vertex_set.insert(vertex->label);\n for (size_t k = 0; k < (vertex->edges).size(); ++k) {\n edge_set.insert(vertex->edges[k].label);\n }\n }\n for (unordered_set<size_t>::iterator it = vertex_set.begin(); it != vertex_set.end(); ++it) {\n ++vertex_labels[*it];\n }\n for (unordered_set<size_t>::iterator it = edge_set.begin(); it != edge_set.end(); ++it) {\n ++edge_labels[*it];\n }\n }\n for (unordered_map<size_t, size_t>::iterator it = vertex_labels.begin();\n it != vertex_labels.end(); ++it) {\n if (it->second >= nsupport_) {\n frequent_vertex_labels_.insert(std::make_pair(it->first, it->second));\n }\n }\n for (unordered_map<size_t, size_t>::iterator it = edge_labels.begin();\n it != edge_labels.end(); ++it) {\n if (it->second >= nsupport_) {\n frequent_edge_labels_.insert(std::make_pair(it->first, it->second));\n }\n }\n}\n\nvoid GSpan::report(const DfsCodes &dfs_codes, const Projection &projection, size_t nsupport, int prev_id) {\n std::stringstream ss;\n Graph graph;\n build_graph(dfs_codes, graph);\n\n for (size_t i = 0; i < graph.size(); ++i) {\n const struct vertex_t *vertex = graph.get_p_vertex(i);\n ss << \"v \" << vertex->id << \" \" << vertex->label << std::endl;\n }\n for (size_t i = 0; i < dfs_codes.size(); ++i) {\n ss << \"e \" << dfs_codes[i].from << \" \" << dfs_codes[i].to\n << \" \" << dfs_codes[i].edge_label << std::endl;\n }\n ss << \"x: \";\n size_t prev = 0;\n for (size_t i = 0; i < projection.size(); ++i) {\n if (i == 0 || projection[i].id != prev) {\n prev = projection[i].id;\n ss << prev << \" \";\n }\n }\n ss << std::endl;\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n output->push_back(ss.str(), nsupport, output->size(), prev_id);\n}\n\nvoid GSpan::save(bool output_parent, bool output_pattern) {\n #pragma omp parallel\n {\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n output->save(output_parent, output_pattern);\n }\n}\n\nvoid GSpan::mine_subgraph(\n const vector<Graph> &graphs,\n const DfsCodes &dfs_codes,\n const Projection &projection,\n size_t prev_nsupport,\n int prev_id) {\n if (!is_min(dfs_codes)) {\n return;\n }\n report(dfs_codes, projection, prev_nsupport, prev_id);\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n prev_id = output->size() - 1;\n\n \/\/ Find right most path\n vector<size_t> right_most_path;\n build_right_most_path(dfs_codes, right_most_path);\n size_t min_label = dfs_codes[0].from_label;\n\n \/\/ Enumerate backward paths and forward paths by different rules\n ProjectionMapBackward projection_map_backward;\n ProjectionMapForward projection_map_forward;\n enumerate(graphs, dfs_codes, projection, right_most_path, min_label,\n projection_map_backward, projection_map_forward);\n \/\/ Recursive mining: first backward, last backward, and then last forward to the first forward\n for (ProjectionMapBackward::iterator it = projection_map_backward.begin();\n it != projection_map_backward.end(); ++it) {\n Projection &projection = it->second;\n size_t nsupport = count_support(projection);\n if (nsupport < nsupport_) {\n continue;\n }\n size_t from = (it->first).from;\n size_t to = (it->first).to;\n size_t from_label = (it->first).from_label;\n size_t edge_label = (it->first).edge_label;\n size_t to_label = (it->first).to_label;\n #pragma omp task shared(graphs, dfs_codes, projection, prev_id) firstprivate(nsupport)\n {\n DfsCodes dfs_codes_copy(dfs_codes);\n dfs_codes_copy.push_back(dfs_code_t(from, to, from_label, edge_label, to_label));\n mine_subgraph(graphs, dfs_codes_copy, projection, nsupport, prev_id);\n }\n }\n for (ProjectionMapForward::iterator it = projection_map_forward.begin();\n it != projection_map_forward.end(); ++it) {\n Projection &projection = it->second;\n size_t nsupport = count_support(projection);\n if (nsupport < nsupport_) {\n continue;\n }\n size_t from = (it->first).from;\n size_t to = (it->first).to;\n size_t from_label = (it->first).from_label;\n size_t edge_label = (it->first).edge_label;\n size_t to_label = (it->first).to_label;\n #pragma omp task shared(graphs, dfs_codes, projection, prev_id) firstprivate(nsupport)\n {\n DfsCodes dfs_codes_copy(dfs_codes);\n dfs_codes_copy.push_back(dfs_code_t(from, to, from_label, edge_label, to_label));\n mine_subgraph(graphs, dfs_codes_copy, projection, nsupport, prev_id);\n }\n }\n #pragma omp taskwait\n}\n\n} \/\/ namespace gspan\n<commit_msg>Change to reverse iterator<commit_after>#include <gspan.h>\n#include <graph.h>\n#include <common.h>\n#include <sstream>\n\nnamespace gspan {\n\nvoid GSpan::find_frequent_nodes(const vector<Graph> &graphs) {\n unordered_map<size_t, size_t> vertex_labels;\n unordered_map<size_t, size_t> edge_labels;\n\n for (size_t i = 0; i < graphs.size(); ++i) {\n unordered_set<size_t> vertex_set;\n unordered_set<size_t> edge_set;\n for (size_t j = 0; j < graphs[i].size(); ++j) {\n const struct vertex_t *vertex = graphs[i].get_p_vertex(j);\n vertex_set.insert(vertex->label);\n for (size_t k = 0; k < (vertex->edges).size(); ++k) {\n edge_set.insert(vertex->edges[k].label);\n }\n }\n for (unordered_set<size_t>::iterator it = vertex_set.begin(); it != vertex_set.end(); ++it) {\n ++vertex_labels[*it];\n }\n for (unordered_set<size_t>::iterator it = edge_set.begin(); it != edge_set.end(); ++it) {\n ++edge_labels[*it];\n }\n }\n for (unordered_map<size_t, size_t>::iterator it = vertex_labels.begin();\n it != vertex_labels.end(); ++it) {\n if (it->second >= nsupport_) {\n frequent_vertex_labels_.insert(std::make_pair(it->first, it->second));\n }\n }\n for (unordered_map<size_t, size_t>::iterator it = edge_labels.begin();\n it != edge_labels.end(); ++it) {\n if (it->second >= nsupport_) {\n frequent_edge_labels_.insert(std::make_pair(it->first, it->second));\n }\n }\n}\n\nvoid GSpan::report(const DfsCodes &dfs_codes, const Projection &projection, size_t nsupport, int prev_id) {\n std::stringstream ss;\n Graph graph;\n build_graph(dfs_codes, graph);\n\n for (size_t i = 0; i < graph.size(); ++i) {\n const struct vertex_t *vertex = graph.get_p_vertex(i);\n ss << \"v \" << vertex->id << \" \" << vertex->label << std::endl;\n }\n for (size_t i = 0; i < dfs_codes.size(); ++i) {\n ss << \"e \" << dfs_codes[i].from << \" \" << dfs_codes[i].to\n << \" \" << dfs_codes[i].edge_label << std::endl;\n }\n ss << \"x: \";\n size_t prev = 0;\n for (size_t i = 0; i < projection.size(); ++i) {\n if (i == 0 || projection[i].id != prev) {\n prev = projection[i].id;\n ss << prev << \" \";\n }\n }\n ss << std::endl;\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n output->push_back(ss.str(), nsupport, output->size(), prev_id);\n}\n\nvoid GSpan::save(bool output_parent, bool output_pattern) {\n #pragma omp parallel\n {\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n output->save(output_parent, output_pattern);\n }\n}\n\nvoid GSpan::mine_subgraph(\n const vector<Graph> &graphs,\n const DfsCodes &dfs_codes,\n const Projection &projection,\n size_t prev_nsupport,\n int prev_id) {\n if (!is_min(dfs_codes)) {\n return;\n }\n report(dfs_codes, projection, prev_nsupport, prev_id);\n gspan_instance_t *instance = gspan_instances_ + omp_get_thread_num();\n Output *output = instance->output;\n prev_id = output->size() - 1;\n\n \/\/ Find right most path\n vector<size_t> right_most_path;\n build_right_most_path(dfs_codes, right_most_path);\n size_t min_label = dfs_codes[0].from_label;\n\n \/\/ Enumerate backward paths and forward paths by different rules\n ProjectionMapBackward projection_map_backward;\n ProjectionMapForward projection_map_forward;\n enumerate(graphs, dfs_codes, projection, right_most_path, min_label,\n projection_map_backward, projection_map_forward);\n \/\/ Recursive mining: first backward, last backward, and then last forward to the first forward\n for (ProjectionMapBackward::iterator it = projection_map_backward.begin();\n it != projection_map_backward.end(); ++it) {\n Projection &projection = it->second;\n size_t nsupport = count_support(projection);\n if (nsupport < nsupport_) {\n continue;\n }\n size_t from = (it->first).from;\n size_t to = (it->first).to;\n size_t from_label = (it->first).from_label;\n size_t edge_label = (it->first).edge_label;\n size_t to_label = (it->first).to_label;\n #pragma omp task shared(graphs, dfs_codes, projection, prev_id) firstprivate(nsupport)\n {\n DfsCodes dfs_codes_copy(dfs_codes);\n dfs_codes_copy.push_back(dfs_code_t(from, to, from_label, edge_label, to_label));\n mine_subgraph(graphs, dfs_codes_copy, projection, nsupport, prev_id);\n }\n }\n for (ProjectionMapForward::reverse_iterator it = projection_map_forward.rbegin();\n it != projection_map_forward.rend(); ++it) {\n Projection &projection = it->second;\n size_t nsupport = count_support(projection);\n if (nsupport < nsupport_) {\n continue;\n }\n size_t from = (it->first).from;\n size_t to = (it->first).to;\n size_t from_label = (it->first).from_label;\n size_t edge_label = (it->first).edge_label;\n size_t to_label = (it->first).to_label;\n #pragma omp task shared(graphs, dfs_codes, projection, prev_id) firstprivate(nsupport)\n {\n DfsCodes dfs_codes_copy(dfs_codes);\n dfs_codes_copy.push_back(dfs_code_t(from, to, from_label, edge_label, to_label));\n mine_subgraph(graphs, dfs_codes_copy, projection, nsupport, prev_id);\n }\n }\n #pragma omp taskwait\n}\n\n} \/\/ namespace gspan\n<|endoftext|>"} {"text":"<commit_before>#ifndef NODE_MDNS_INCLUDED\n#define NODE_MDNS_INCLUDED\n\n#include \"mdns_settings.hpp\"\n\n#ifdef WIN32\n# pragma warning( push )\n# pragma warning( disable: 4251 )\n#endif\n\n\/\/ Hack attempt to fix \"node.h missing ';' before identifier\" build error\n#if defined(_MSC_VER)\n#include <BaseTsd.h>\ntypedef SSIZE_T ssize_t;\n#define _SSIZE_T_\n#endif\n\n#include <node.h>\n#include \"nan.h\"\n\n#ifdef WIN32\n# pragma warning( pop )\n#endif\n\n#ifndef NODE_VERSION_AT_LEAST\n# include <node_version.h>\n#endif\n\n\/\/ XXX It would be better to test UV_VERSION_MAJOR and UV_VERSION_MINOR.\n\/\/ However, libuv didn't bump the version when uv_poll_t was introduced.\n#if NODE_VERSION_AT_LEAST(0, 7, 9)\n# define NODE_MDNS_USE_SOCKET_WATCHER\n\/\/# warning Using SocketWatcher\n#else\n\/\/# warning Using IOWatcher\n#endif\n\n\n#include <dns_sd.h>\n\n#endif \/\/ NODE_MDNS_INCLUDED\n<commit_msg>update SSIZE_T hack with version from latest node.h<commit_after>#ifndef NODE_MDNS_INCLUDED\n#define NODE_MDNS_INCLUDED\n\n#include \"mdns_settings.hpp\"\n\n#ifdef WIN32\n# pragma warning( push )\n# pragma warning( disable: 4251 )\n#endif\n\n\/\/ HACK: fix \"node.h missing ';' before identifier\" build error\n#ifdef _WIN32\n# include <BaseTsd.h>\ntypedef SSIZE_T ssize_t;\ntypedef SIZE_T size_t;\n#else \/\/ !_WIN32\n# include <sys\/types.h> \/\/ size_t, ssize_t\n#endif \/\/ _WIN32\n\n#include <node.h>\n#include \"nan.h\"\n\n#ifdef WIN32\n# pragma warning( pop )\n#endif\n\n#ifndef NODE_VERSION_AT_LEAST\n# include <node_version.h>\n#endif\n\n\/\/ XXX It would be better to test UV_VERSION_MAJOR and UV_VERSION_MINOR.\n\/\/ However, libuv didn't bump the version when uv_poll_t was introduced.\n#if NODE_VERSION_AT_LEAST(0, 7, 9)\n# define NODE_MDNS_USE_SOCKET_WATCHER\n\/\/# warning Using SocketWatcher\n#else\n\/\/# warning Using IOWatcher\n#endif\n\n\n#include <dns_sd.h>\n\n#endif \/\/ NODE_MDNS_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>#include <taichi\/visual\/gui.h>\n#include <taichi\/common\/task.h>\n#include <taichi\/common\/bit.h>\n\n#if defined(TC_GUI_COCOA)\n\n\/\/ https:\/\/stackoverflow.com\/questions\/4356441\/mac-os-cocoa-draw-a-simple-pixel-on-a-canvas\n\/\/ http:\/\/cocoadevcentral.com\/d\/intro_to_quartz\/\n\/\/ Modified based on\n\/\/ https:\/\/github.com\/CodaFi\/C-Macs\n\n\/\/ Obj-c runtime doc:\n\/\/ https:\/\/developer.apple.com\/documentation\/objectivec\/objective-c_runtime?language=objc\n\n#include <objc\/objc.h>\n#include <objc\/message.h>\n#include <objc\/runtime.h>\n#include <objc\/runtime.h>\n#include <objc\/message.h>\n#include <objc\/NSObjCRuntime.h>\n#include <CoreGraphics\/CGBase.h>\n#include <CoreGraphics\/CGGeometry.h>\n#include <ApplicationServices\/ApplicationServices.h>\n\ntemplate <typename C = id, typename... Args>\nC call(id i, const char *select, Args... args) {\n using func = C(id, SEL, Args...);\n return ((func *)(objc_msgSend))(i, sel_getUid(select), args...);\n}\n\ntemplate <typename C = id, typename... Args>\nC call(const char *class_name, const char *select, Args... args) {\n using func = C(id, SEL, Args...);\n return ((func *)(objc_msgSend))((id)objc_getClass(class_name),\n sel_getUid(select), args...);\n}\n\nextern id NSApp;\nextern id const NSDefaultRunLoopMode;\n\ntypedef struct AppDel {\n Class isa;\n id window;\n} AppDelegate;\n\nclass IdComparator {\n public:\n bool operator()(id a, id b) const {\n TC_STATIC_ASSERT(sizeof(a) == sizeof(taichi::int64));\n return taichi::bit::reinterpret_bits<taichi::int64>(a) <\n taichi::bit::reinterpret_bits<taichi::int64>(b);\n }\n};\n\nstd::map<id, taichi::GUI *, IdComparator> gui_from_id;\n\nenum {\n NSBorderlessWindowMask = 0,\n NSTitledWindowMask = 1 << 0,\n NSClosableWindowMask = 1 << 1,\n NSMiniaturizableWindowMask = 1 << 2,\n NSResizableWindowMask = 1 << 3,\n};\n\nClass ViewClass;\n\nvoid redraw(id self, SEL _, CGRect __) {\n using namespace taichi;\n auto *gui = gui_from_id[self];\n auto width = gui->width, height = gui->height;\n auto &img = gui->canvas->img;\n auto &data = gui->img_data;\n for (int j = 0; j < height; j++) {\n for (int i = 0; i < width; i++) {\n int index = 4 * (i + j * width);\n auto pixel = img[i][height - j - 1];\n data[index++] = uint8(clamp(int(pixel[0] * 255.0_f), 0, 255));\n data[index++] = uint8(clamp(int(pixel[1] * 255.0_f), 0, 255));\n data[index++] = uint8(clamp(int(pixel[2] * 255.0_f), 0, 255));\n data[index++] = 255; \/\/ alpha\n }\n }\n\n CGDataProviderRef provider = CGDataProviderCreateWithData(\n nullptr, data.data(), gui->img_data_length, nullptr);\n CGColorSpaceRef colorspace = CGColorSpaceCreateDeviceRGB();\n CGImageRef image =\n CGImageCreate(width, height, 8, 32, width * 4, colorspace,\n kCGBitmapByteOrder32Big | kCGImageAlphaPremultipliedLast,\n provider, nullptr, true, kCGRenderingIntentDefault);\n CGContextRef context = call<CGContextRef>(\n call((id)objc_getClass(\"NSGraphicsContext\"), \"currentContext\"),\n \"graphicsPort\");\n\n CGRect rect{{0, 0}, {CGFloat(width), CGFloat(height)}};\n CGContextDrawImage(context, rect, image);\n\n CGImageRelease(image);\n CGDataProviderRelease(provider);\n CGColorSpaceRelease(colorspace);\n}\n\nClass AppDelClass;\n__attribute__((constructor)) static void initView() {\n ViewClass = objc_allocateClassPair((Class)objc_getClass(\"NSView\"), \"View\", 0);\n \/\/ and again, we tell the runtime to add a function called -drawRect:\n \/\/ to our custom view. Note that there is an error in the type-specification\n \/\/ of this method, as I do not know the @encode sequence of 'CGRect' off\n \/\/ of the top of my head. As a result, there is a chance that the rect\n \/\/ parameter of the method may not get passed properly.\n class_addMethod(ViewClass, sel_getUid(\"drawRect:\"), (IMP)redraw, \"v@:\");\n objc_registerClassPair(ViewClass);\n\n AppDelClass = objc_allocateClassPair((Class)objc_getClass(\"NSObject\"),\n \"AppDelegate\", 0);\n objc_registerClassPair(AppDelClass);\n}\n\nTC_NAMESPACE_BEGIN\n\nvoid GUI::create_window() {\n call(\"NSApplication\", \"sharedApplication\");\n if (NSApp == nullptr) {\n fprintf(stderr, \"Failed to initialized NSApplication.\\nterminating.\\n\");\n return;\n }\n auto appDelObj = call(\"AppDelegate\", \"alloc\");\n appDelObj = call(appDelObj, \"init\");\n call(NSApp, \"setDelegate:\", appDelObj);\n window = call(\"NSWindow\", \"alloc\");\n auto rect = (CGRect){{0, 0}, {CGFloat(width), CGFloat(height)}};\n call(window, \"initWithContentRect:styleMask:backing:defer:\", rect,\n (NSTitledWindowMask | NSClosableWindowMask | NSResizableWindowMask |\n NSMiniaturizableWindowMask),\n 0, false);\n view = call(call(\"View\", \"alloc\"), \"initWithFrame:\", rect);\n gui_from_id[view] = this;\n call(window, \"setContentView:\", view);\n call(window, \"becomeFirstResponder\");\n call(window, \"makeKeyAndOrderFront:\", window);\n img_data_length = width * height * 4;\n img_data.resize(img_data_length);\n}\n\nvoid GUI::process_event() {\n call(call(\"NSRunLoop\", \"currentRunLoop\"),\n \"runMode:beforeDate:\", NSDefaultRunLoopMode,\n call(\"NSDate\", \"distantPast\"));\n while (1) {\n auto event = call(\n NSApp, \"nextEventMatchingMask:untilDate:inMode:dequeue:\", NSUIntegerMax,\n call(\"NSDate\", \"distantPast\"), NSDefaultRunLoopMode, YES);\n if (event != nullptr) {\n auto event_type = call<NSInteger>(event, \"type\");\n call(NSApp, \"sendEvent:\", event);\n call(NSApp, \"updateWindows\");\n switch (event_type) {\n case 1: \/\/ NSLeftMouseDown\n mouse_event(MouseEvent{MouseEvent::Type::press, cursor_pos});\n break;\n case 2: \/\/ NSLeftMouseUp\n mouse_event(MouseEvent{MouseEvent::Type::release, cursor_pos});\n break;\n case 5: \/\/ NSMouseMoved\n case 6: \/\/ NSLeftMouseDragged\n case 7: \/\/ NSRightMouseDragged\n case 27: \/\/ NSNSOtherMouseDragged\n auto p = call<CGPoint>(event, \"locationInWindow\");\n set_mouse_pos(p.x, p.y);\n mouse_event(MouseEvent{MouseEvent::Type::move, Vector2i(p.x, p.y)});\n break;\n }\n } else {\n break;\n }\n }\n}\n\nvoid GUI::set_title(std::string title) {\n auto str = call(\"NSString\", \"stringWithUTF8String:\", title.c_str());\n call(window, \"setTitle:\", str);\n call(str, \"release\");\n}\n\nvoid GUI::redraw() {\n call(view, \"setNeedsDisplay:\", YES);\n}\n\nGUI::~GUI() {\n}\n\nTC_NAMESPACE_END\n\n#endif<commit_msg>Improved OS X amalgated GUI<commit_after>#include <taichi\/visual\/gui.h>\n#include <taichi\/common\/task.h>\n#include <taichi\/common\/bit.h>\n\n#if defined(TC_GUI_COCOA)\n\n\/\/ https:\/\/stackoverflow.com\/questions\/4356441\/mac-os-cocoa-draw-a-simple-pixel-on-a-canvas\n\/\/ http:\/\/cocoadevcentral.com\/d\/intro_to_quartz\/\n\/\/ Modified based on\n\/\/ https:\/\/github.com\/CodaFi\/C-Macs\n\n\/\/ Obj-c runtime doc:\n\/\/ https:\/\/developer.apple.com\/documentation\/objectivec\/objective-c_runtime?language=objc\n\n#include <objc\/objc.h>\n#include <objc\/message.h>\n#include <objc\/runtime.h>\n#include <objc\/runtime.h>\n#include <objc\/message.h>\n#include <objc\/NSObjCRuntime.h>\n#include <CoreGraphics\/CGBase.h>\n#include <CoreGraphics\/CGGeometry.h>\n#include <ApplicationServices\/ApplicationServices.h>\n\ntemplate <typename C = id, typename... Args>\nC call(id i, const char *select, Args... args) {\n using func = C(id, SEL, Args...);\n return ((func *)(objc_msgSend))(i, sel_getUid(select), args...);\n}\n\ntemplate <typename C = id, typename... Args>\nC call(const char *class_name, const char *select, Args... args) {\n using func = C(id, SEL, Args...);\n return ((func *)(objc_msgSend))((id)objc_getClass(class_name),\n sel_getUid(select), args...);\n}\n\nextern id NSApp;\nextern id const NSDefaultRunLoopMode;\n\ntypedef struct AppDel {\n Class isa;\n id window;\n} AppDelegate;\n\nclass IdComparator {\n public:\n bool operator()(id a, id b) const {\n TC_STATIC_ASSERT(sizeof(a) == sizeof(taichi::int64));\n return taichi::bit::reinterpret_bits<taichi::int64>(a) <\n taichi::bit::reinterpret_bits<taichi::int64>(b);\n }\n};\n\nstd::map<id, taichi::GUI *, IdComparator> gui_from_id;\n\nenum {\n NSBorderlessWindowMask = 0,\n NSTitledWindowMask = 1 << 0,\n NSClosableWindowMask = 1 << 1,\n NSMiniaturizableWindowMask = 1 << 2,\n NSResizableWindowMask = 1 << 3,\n};\n\nClass ViewClass;\n\nvoid redraw(id self, SEL _, CGRect __) {\n using namespace taichi;\n auto *gui = gui_from_id[self];\n auto width = gui->width, height = gui->height;\n auto &img = gui->canvas->img;\n auto &data = gui->img_data;\n for (int j = 0; j < height; j++) {\n for (int i = 0; i < width; i++) {\n int index = 4 * (i + j * width);\n auto pixel = img[i][height - j - 1];\n data[index++] = uint8(clamp(int(pixel[0] * 255.0_f), 0, 255));\n data[index++] = uint8(clamp(int(pixel[1] * 255.0_f), 0, 255));\n data[index++] = uint8(clamp(int(pixel[2] * 255.0_f), 0, 255));\n data[index++] = 255; \/\/ alpha\n }\n }\n\n CGDataProviderRef provider = CGDataProviderCreateWithData(\n nullptr, data.data(), gui->img_data_length, nullptr);\n CGColorSpaceRef colorspace = CGColorSpaceCreateDeviceRGB();\n CGImageRef image =\n CGImageCreate(width, height, 8, 32, width * 4, colorspace,\n kCGBitmapByteOrder32Big | kCGImageAlphaPremultipliedLast,\n provider, nullptr, true, kCGRenderingIntentDefault);\n CGContextRef context = call<CGContextRef>(\n call((id)objc_getClass(\"NSGraphicsContext\"), \"currentContext\"),\n \"graphicsPort\");\n\n CGRect rect{{0, 0}, {CGFloat(width), CGFloat(height)}};\n CGContextDrawImage(context, rect, image);\n\n CGImageRelease(image);\n CGDataProviderRelease(provider);\n CGColorSpaceRelease(colorspace);\n}\n\nClass AppDelClass;\n__attribute__((constructor)) static void initView() {\n ViewClass = objc_allocateClassPair((Class)objc_getClass(\"NSView\"), \"View\", 0);\n \/\/ and again, we tell the runtime to add a function called -drawRect:\n \/\/ to our custom view. Note that there is an error in the type-specification\n \/\/ of this method, as I do not know the @encode sequence of 'CGRect' off\n \/\/ of the top of my head. As a result, there is a chance that the rect\n \/\/ parameter of the method may not get passed properly.\n class_addMethod(ViewClass, sel_getUid(\"drawRect:\"), (IMP)redraw, \"v@:\");\n objc_registerClassPair(ViewClass);\n\n AppDelClass = objc_allocateClassPair((Class)objc_getClass(\"NSObject\"),\n \"AppDelegate\", 0);\n objc_registerClassPair(AppDelClass);\n}\n\nTC_NAMESPACE_BEGIN\n\nvoid GUI::create_window() {\n call(\"NSApplication\", \"sharedApplication\");\n if (NSApp == nullptr) {\n fprintf(stderr, \"Failed to initialized NSApplication.\\nterminating.\\n\");\n return;\n }\n auto appDelObj = call(\"AppDelegate\", \"alloc\");\n appDelObj = call(appDelObj, \"init\");\n call(NSApp, \"setDelegate:\", appDelObj);\n window = call(\"NSWindow\", \"alloc\");\n auto rect = (CGRect){{0, 0}, {CGFloat(width), CGFloat(height)}};\n call(window, \"initWithContentRect:styleMask:backing:defer:\", rect,\n (NSTitledWindowMask | NSClosableWindowMask | NSResizableWindowMask |\n NSMiniaturizableWindowMask),\n 0, false);\n view = call(call(\"View\", \"alloc\"), \"initWithFrame:\", rect);\n gui_from_id[view] = this;\n call(window, \"setContentView:\", view);\n call(window, \"becomeFirstResponder\");\n call(window, \"makeKeyAndOrderFront:\", window);\n call(window, \"setAcceptsMouseMovedEvents:\", YES);\n img_data_length = width * height * 4;\n img_data.resize(img_data_length);\n}\n\nvoid GUI::process_event() {\n call(call(\"NSRunLoop\", \"currentRunLoop\"),\n \"runMode:beforeDate:\", NSDefaultRunLoopMode,\n call(\"NSDate\", \"distantPast\"));\n while (1) {\n auto event = call(\n NSApp, \"nextEventMatchingMask:untilDate:inMode:dequeue:\", NSUIntegerMax,\n call(\"NSDate\", \"distantPast\"), NSDefaultRunLoopMode, YES);\n if (event != nullptr) {\n auto event_type = call<NSInteger>(event, \"type\");\n call(NSApp, \"sendEvent:\", event);\n call(NSApp, \"updateWindows\");\n auto p = call<CGPoint>(event, \"locationInWindow\");\n switch (event_type) {\n case 1: \/\/ NSLeftMouseDown\n set_mouse_pos(p.x, p.y);\n mouse_event(MouseEvent{MouseEvent::Type::press, cursor_pos});\n break;\n case 2: \/\/ NSLeftMouseUp\n set_mouse_pos(p.x, p.y);\n mouse_event(MouseEvent{MouseEvent::Type::release, cursor_pos});\n break;\n case 5: \/\/ NSMouseMoved\n case 6: \/\/ NSLeftMouseDragged\n case 7: \/\/ NSRightMouseDragged\n case 27: \/\/ NSNSOtherMouseDragged\n set_mouse_pos(p.x, p.y);\n mouse_event(MouseEvent{MouseEvent::Type::move, Vector2i(p.x, p.y)});\n break;\n }\n } else {\n break;\n }\n }\n}\n\nvoid GUI::set_title(std::string title) {\n auto str = call(\"NSString\", \"stringWithUTF8String:\", title.c_str());\n call(window, \"setTitle:\", str);\n call(str, \"release\");\n}\n\nvoid GUI::redraw() {\n call(view, \"setNeedsDisplay:\", YES);\n}\n\nGUI::~GUI() {\n}\n\nTC_NAMESPACE_END\n\n#endif<|endoftext|>"} {"text":"<commit_before>\/**\n * mesh.cpp\n *\n * by Mohammad Elmi\n * Created on 24 Oct 2013\n *\/\n\n#include \"mesh.h\"\n\nnamespace aban2\n{\n\nsize_t mesh::idx(size_t i, size_t j, size_t k, size_t ii, size_t jj, size_t kk)\n{\n static size_t ijk[3];\n ijk[ii] = i;\n ijk[jj] = j;\n ijk[kk] = k;\n return idx(ijk[0], ijk[1], ijk[2]);\n}\n\nvoid mesh::get_dirs(size_t dir, size_t &ii, size_t &jj, size_t &kk)\n{\n ii = dir;\n jj = (dir + 1) % 3;\n kk = (dir + 2) % 3;\n}\n\nbool mesh::exists(size_t i, size_t j, size_t k)\n{\n size_t x = idx(i, j, k);\n return codes[x] == INSIDE;\n}\n\nbool mesh::exists(size_t i, size_t j, size_t k, size_t &no)\n{\n size_t ix = idx(i, j, k);\n if (codes[ix] != INSIDE)return false;\n no = cellnos[ix];\n return true;\n}\n\nbool mesh::exists_and_inside(size_t i, size_t j, size_t k, size_t &no)\n{\n if (i < 0 || i > ndir[0] || j < 0 || j > ndir[1] || k < 0 || k > ndir[2]) return false;\n size_t ix = idx(i, j, k);\n if (codes[ix] != INSIDE)return false;\n no = cellnos[ix];\n return true;\n}\n\nvoid mesh::generate_rows(size_t dir)\n{\n bool inside = false;\n mesh_row row;\n std::vector<mesh_row> v;\n size_t ii , jj, kk;\n get_dirs(dir, ii, jj, kk);\n\n for (size_t k = 0; k < ndir[kk]; ++k)\n for (size_t j = 0; j < ndir[jj]; ++j)\n for (size_t i = 0; i < ndir[ii]; ++i)\n {\n size_t x = idx(i, j, k, ii, jj, kk);\n if (!inside)\n {\n if (codes[x] != INSIDE) continue;\n inside = true;\n row.dir = dir;\n row.start[ii] = i;\n row.start[jj] = j;\n row.start[kk] = k;\n row.start_code = codes[idx(i - 1, j, k, ii, jj, kk)];\n }\n else\n {\n if (codes[x] == INSIDE) continue;\n inside = false;\n row.end[ii] = i - 1;\n row.end[jj] = j;\n row.end[kk] = k;\n row.n = row.end[ii] - row.start[ii] + 1;\n row.end_code = codes[x];\n v.push_back(row);\n }\n }\n\n nrows[dir] = v.size();\n rows[dir] = new mesh_row[nrows[dir]];\n for (int i = 0; i < nrows[dir]; ++i)\n rows[dir][i] = v[i];\n}\n\nvoid mesh::set_cell_nos()\n{\n size_t ii = 0;\n cellnos = new size_t[ndir[0] * ndir[1] * ndir[2]];\n for (int i = 0; i < ndir[0]; ++i)\n for (int j = 0; j < ndir[1]; ++j)\n for (int k = 0; k < ndir[2]; ++k)\n {\n size_t x = idx(i, j, k);\n if (codes[x] == INSIDE)\n cellnos[x] = ii++;\n }\n n = ii;\n}\n\nvoid mesh::init()\n{\n nrows[0] = nrows[1] = nrows[2] = 0;\n\n for (int dir = 0; dir < NDIRS; ++dir)\n generate_rows(dir);\n\n set_cell_nos();\n}\n\nmesh::mesh(Json::Value *root)\n{\n delta = root->get(\"delta\", \"1\").asDouble();\n\n ndir[0] = root->get(\"ni\", \"1\").asInt();\n ndir[1] = root->get(\"nj\", \"1\").asInt();\n ndir[2] = root->get(\"nk\", \"1\").asInt();\n\n std::string str;\n Json::Value codes_val = (*root)[\"codes\"];\n for (size_t k = 0; k < ndir[2]; ++k)\n {\n Json::Value codesk = codes_val[ndir[2] - k - 1];\n for (size_t j = 0; j < ndir[1]; ++j)\n str += codesk[ndir[1] - j - 1].asString();\n }\n\n codes = new char[str.length() + 1];\n strcpy(codes, str.c_str());\n\n init();\n}\n\n}\n<commit_msg>bug fix<commit_after>\/**\n * mesh.cpp\n *\n * by Mohammad Elmi\n * Created on 24 Oct 2013\n *\/\n\n#include \"mesh.h\"\n\nnamespace aban2\n{\n\nsize_t mesh::idx(size_t i, size_t j, size_t k, size_t ii, size_t jj, size_t kk)\n{\n static size_t ijk[3];\n ijk[ii] = i;\n ijk[jj] = j;\n ijk[kk] = k;\n return idx(ijk[0], ijk[1], ijk[2]);\n}\n\nvoid mesh::get_dirs(size_t dir, size_t &ii, size_t &jj, size_t &kk)\n{\n ii = dir;\n jj = (dir + 1) % 3;\n kk = (dir + 2) % 3;\n}\n\nbool mesh::exists(size_t i, size_t j, size_t k)\n{\n size_t x = idx(i, j, k);\n return codes[x] == INSIDE;\n}\n\nbool mesh::exists(size_t i, size_t j, size_t k, size_t &no)\n{\n size_t ix = idx(i, j, k);\n if (codes[ix] != INSIDE)return false;\n no = cellnos[ix];\n return true;\n}\n\nbool mesh::exists_and_inside(size_t i, size_t j, size_t k, size_t &no)\n{\n if (i < 0 || i >= ndir[0] || j < 0 || j >= ndir[1] || k < 0 || k >= ndir[2]) return false;\n size_t ix = idx(i, j, k);\n if (codes[ix] != INSIDE)return false;\n no = cellnos[ix];\n return true;\n}\n\nvoid mesh::generate_rows(size_t dir)\n{\n bool inside = false;\n mesh_row row;\n std::vector<mesh_row> v;\n size_t ii , jj, kk;\n get_dirs(dir, ii, jj, kk);\n\n for (size_t k = 0; k < ndir[kk]; ++k)\n for (size_t j = 0; j < ndir[jj]; ++j)\n for (size_t i = 0; i < ndir[ii]; ++i)\n {\n size_t x = idx(i, j, k, ii, jj, kk);\n if (!inside)\n {\n if (codes[x] != INSIDE) continue;\n inside = true;\n row.dir = dir;\n row.start[ii] = i;\n row.start[jj] = j;\n row.start[kk] = k;\n row.start_code = codes[idx(i - 1, j, k, ii, jj, kk)];\n }\n else\n {\n if (codes[x] == INSIDE) continue;\n inside = false;\n row.end[ii] = i - 1;\n row.end[jj] = j;\n row.end[kk] = k;\n row.n = row.end[ii] - row.start[ii] + 1;\n row.end_code = codes[x];\n v.push_back(row);\n }\n }\n\n nrows[dir] = v.size();\n rows[dir] = new mesh_row[nrows[dir]];\n for (int i = 0; i < nrows[dir]; ++i)\n rows[dir][i] = v[i];\n}\n\nvoid mesh::set_cell_nos()\n{\n size_t ii = 0;\n cellnos = new size_t[ndir[0] * ndir[1] * ndir[2]];\n for (int i = 0; i < ndir[0]; ++i)\n for (int j = 0; j < ndir[1]; ++j)\n for (int k = 0; k < ndir[2]; ++k)\n {\n size_t x = idx(i, j, k);\n if (codes[x] == INSIDE)\n cellnos[x] = ii++;\n }\n n = ii;\n}\n\nvoid mesh::init()\n{\n nrows[0] = nrows[1] = nrows[2] = 0;\n\n for (int dir = 0; dir < NDIRS; ++dir)\n generate_rows(dir);\n\n set_cell_nos();\n}\n\nmesh::mesh(Json::Value *root)\n{\n delta = root->get(\"delta\", \"1\").asDouble();\n\n ndir[0] = root->get(\"ni\", \"1\").asInt();\n ndir[1] = root->get(\"nj\", \"1\").asInt();\n ndir[2] = root->get(\"nk\", \"1\").asInt();\n\n std::string str;\n Json::Value codes_val = (*root)[\"codes\"];\n for (size_t k = 0; k < ndir[2]; ++k)\n {\n Json::Value codesk = codes_val[ndir[2] - k - 1];\n for (size_t j = 0; j < ndir[1]; ++j)\n str += codesk[ndir[1] - j - 1].asString();\n }\n\n codes = new char[str.length() + 1];\n strcpy(codes, str.c_str());\n\n init();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2015 Realm Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef REALM_LIST_HPP\n#define REALM_LIST_HPP\n\n#include <realm\/link_view.hpp>\n\n#include <memory>\n\nnamespace realm {\nclass ObjectSchema;\nclass Realm;\n\nclass List {\npublic:\n List(std::shared_ptr<Realm> r, const ObjectSchema& s, LinkViewRef l) noexcept;\n ~List();\n\n const ObjectSchema& get_object_schema() const { return *m_object_schema; }\n const std::shared_ptr<Realm>& realm() const { return m_realm; }\n\n size_t size() const;\n Row get(size_t row_ndx) const;\n void set(size_t row_ndx, size_t target_row_ndx);\n\n void add(size_t target_row_ndx);\n void remove(size_t list_ndx);\n void insert(size_t list_ndx, size_t target_row_ndx);\n\n Query get_query() const;\n void verify_in_tranaction() const;\n\n \/\/ These are implemented in object_accessor.hpp\n template <typename ValueType, typename ContextType>\n void add(ContextType ctx, ValueType value);\n\n template <typename ValueType, typename ContextType>\n void insert(ContextType ctx, ValueType value, size_t list_ndx);\n\n template <typename ValueType, typename ContextType>\n void set(ContextType ctx, ValueType value, size_t list_ndx);\n\nprivate:\n std::shared_ptr<Realm> m_realm;\n const ObjectSchema* m_object_schema;\n LinkViewRef m_link_view;\n\n void verify_valid_row(size_t row_ndx, bool insertion = false) const;\n void verify_attached() const;\n};\n}\n\n#endif \/* REALM_LIST_HPP *\/\n<commit_msg>Change List::realm() to List::get_realm() for consistency<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright 2015 Realm Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef REALM_LIST_HPP\n#define REALM_LIST_HPP\n\n#include <realm\/link_view.hpp>\n\n#include <memory>\n\nnamespace realm {\nclass ObjectSchema;\nclass Realm;\n\nclass List {\npublic:\n List(std::shared_ptr<Realm> r, const ObjectSchema& s, LinkViewRef l) noexcept;\n ~List();\n\n const ObjectSchema& get_object_schema() const { return *m_object_schema; }\n const std::shared_ptr<Realm>& get_realm() const { return m_realm; }\n Query get_query() const;\n\n size_t size() const;\n Row get(size_t row_ndx) const;\n void set(size_t row_ndx, size_t target_row_ndx);\n\n void add(size_t target_row_ndx);\n void remove(size_t list_ndx);\n void insert(size_t list_ndx, size_t target_row_ndx);\n\n void verify_in_tranaction() const;\n\n \/\/ These are implemented in object_accessor.hpp\n template <typename ValueType, typename ContextType>\n void add(ContextType ctx, ValueType value);\n\n template <typename ValueType, typename ContextType>\n void insert(ContextType ctx, ValueType value, size_t list_ndx);\n\n template <typename ValueType, typename ContextType>\n void set(ContextType ctx, ValueType value, size_t list_ndx);\n\nprivate:\n std::shared_ptr<Realm> m_realm;\n const ObjectSchema* m_object_schema;\n LinkViewRef m_link_view;\n\n void verify_valid_row(size_t row_ndx, bool insertion = false) const;\n void verify_attached() const;\n};\n}\n\n#endif \/* REALM_LIST_HPP *\/\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n\n try {\n Inotify notify;\n\n InotifyWatch watch(file, IN_ALL_EVENTS);\n notify.Add(watch);\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while (count > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if (got_event) {\n std::string mask_str;\n event.DumpTypes(mask_str);\n\n std::string filename = event.GetName();\n std::cout << \"event mask: \\\"\" << mask_str << \"\\\", \";\n std::cout << \"filename: \\\"\" << filename << \"\\\"\" << std::endl;\n }\n\n count--;\n }\n }\n } catch (InotifyException &e) {\n std::cerr << \"Inotify exception occured: \" << e.GetMessage() << std::endl;\n } catch (std::exception &e) {\n std::cerr << \"STL exception occured: \" << e.what() << std::endl;\n } catch (...) {\n std::cerr << \"unknown exception occured\" << std::endl;\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n std::cout << \"Watch thread shutdown\" << std::endl;\n }\n break;\n\n default: \/\/ parent\n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<commit_msg>debug<commit_after>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n\n try {\n Inotify notify;\n\n InotifyWatch watch(file, IN_ALL_EVENTS);\n notify.Add(watch);\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while (count > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if (got_event) {\n std::string mask_str;\n event.DumpTypes(mask_str);\n\n std::string filename = event.GetName();\n std::cout << \"event mask: \\\"\" << mask_str << \"\\\", \";\n std::cout << \"filename: \\\"\" << filename << \"\\\"\" << std::endl;\n *fragHasChanged = true;\n }\n\n count--;\n }\n }\n } catch (InotifyException &e) {\n std::cerr << \"Inotify exception occured: \" << e.GetMessage() << std::endl;\n } catch (std::exception &e) {\n std::cerr << \"STL exception occured: \" << e.what() << std::endl;\n } catch (...) {\n std::cerr << \"unknown exception occured\" << std::endl;\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n std::cout << \"Watch thread shutdown\" << std::endl;\n }\n break;\n\n default: \/\/ parent\n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Adapted from here:\n http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/queues\/bounded-mpmc-queue\n\n*\/\n\n#include <assert.h>\n#include <iostream>\n#include <thread>\n\n#define ERROR_NO_ERROR 0\n#define ERROR_BAD_PARAMS -1\n#define ERROR_FULL -2\n#define ERROR_EMPTY -3\n\n\ntemplate<typename T>\nclass ring_buffer_t\n{\npublic:\n\n ring_buffer_t(\n size_t size) :\n _size(size + 1), \/\/ need one extra element for a guard\n _mask(size),\n _buffer(reinterpret_cast<buffer_elem_t*>(new buffer_elem_aligned_t[_size])),\n _head(0),\n _tail(0)\n {\n assert(size >= 2);\n memset(_buffer, 0, sizeof(buffer_elem_t) * _size);\n }\n\n ~ring_buffer_t()\n {\n delete[] _buffer;\n }\n\n int\n enqueue(\n const T& input)\n {\n buffer_elem_t* elem;\n size_t insert_pos = _head.load(std::memory_order_relaxed);\n\n for (;;) {\n \/\/ grab the element at index _head\n elem = &_buffer[insert_pos & _mask];\n\n \/\/ grab the sequence of the element at head\n size_t seq = elem->sequence.load(std::memory_order_acquire);\n\n int diff = seq - insert_pos;\n \/\/ if sequence and insert position are the same then we know no other thread is attempting to mutate that element\n if (diff == 0) {\n\n \/\/ if _head hasn't been modified since we last checked, increment it so that we have it to ourselves\n if (_head.compare_exchange_weak(insert_pos, insert_pos + 1, std::memory_order_relaxed)) {\n break;\n }\n \/\/ someone else wrote to _head and beat us to the punch. spin\n }\n else if (diff < 0) {\n \/\/ queue is full\n return ERROR_FULL;\n }\n else {\n \/\/ someone was in the process of reading from _head. spin\n insert_pos = _head.load(std::memory_order_relaxed);\n }\n\n \/\/ yield so that another thread can use the CPU core\n \/\/ this is a noop if no other thread is waiting\n std::this_thread::yield();\n }\n\n \/\/ the element is all ours, set the data and close the transaction by setting sequence.\n elem->data = input;\n elem->sequence.store(insert_pos + 1, std::memory_order_release);\n return ERROR_NO_ERROR;\n }\n\n\n bool\n dequeue(\n T& output)\n {\n buffer_elem_t* elem;\n size_t read_pos = _head.load(std::memory_order_relaxed);\n for (;;) {\n elem = &_buffer[read_pos & _mask];\n size_t sequence = entry->sequence.load(std::memory_order_acquire);\n int diff = seq - read_pos + 1;\n\n if (dif == 0) {\n if (_tail.compare_exchange_weak(read_pos, read_pos + 1, std::memory_order_relaxed)) {\n break;\n }\n }\n else if (dif < 0) {\n \/\/ queue is empty\n return ERROR_EMPTY;\n }\n else {\n \/\/ someone was in the process writing to _tail. spin\n read_pos = _tail.load(std::memory_order_relaxed);\n }\n\n \/\/ yield so that another thread can use the CPU core\n \/\/ this is a noop if no other thread is waiting\n std::this_thread::yield();\n }\n\n output = cell->data;\n entry->sequence.store(read_pos + _mask + 1, std::memory_order_release);\n return true;\n }\n\n\nprivate:\n\n struct buffer_elem_t\n {\n std::atomic<size_t> sequence;\n T data;\n };\n\n typedef typename std::aligned_storage<sizeof(buffer_elem_t), std::alignment_of<buffer_elem_t>::value>::type buffer_elem_aligned_t;\n\n const size_t _size;\n const size_t _mask;\n buffer_elem_t* _buffer;\n\n std::atomic<size_t> _head;\n std::atomic<size_t> _tail;\n\n ring_buffer_t(const ring_buffer_t&) {}\n void operator=(const ring_buffer_t&) {}\n};\n\n\nint\nmain()\n{\n ring_buffer_t<int> buffer(2);\n std::cout << \"value 0: \" << buffer.enqueue(0) << std::endl;\n std::cout << \"value 1: \" << buffer.enqueue(1) << std::endl;\n std::cout << \"value 2: \" << buffer.enqueue(2) << std::endl;\n}\n<commit_msg>replace ring buffer with SPSC queue<commit_after>\/*\n\n SPSC queue adapted from here:\n http:\/\/cbloomrants.blogspot.com\/2009\/02\/02-26-09-low-level-threading-part-51.html\n\n*\/\n\n#include <assert.h>\n#include <iostream>\n#include <thread>\n\ntemplate<typename T>\nclass spsc_queue_t\n{\npublic:\n\n spsc_queue_t() :\n _head(reinterpret_cast<buffer_node_t*>(new buffer_node_aligned_t)),\n _tail(_head.load(std::memory_order_relaxed))\n {}\n\n ~spsc_queue_t()\n {\n T output;\n while (this->dequeue(output)) {}\n buffer_node_t* front = _head.load(std::memory_order_relaxed);\n delete front;\n }\n\n void\n enqueue(\n const T& input)\n {\n buffer_node_t* node = reinterpret_cast<buffer_node_t*>(new buffer_node_aligned_t);\n node->data = input;\n node->next.store(NULL, std::memory_order_relaxed);\n\n buffer_node_t* back = _tail.load(std::memory_order_relaxed);\n back->next.store(node, std::memory_order_release);\n _tail.store(node, std::memory_order_relaxed);\n }\n\n bool\n dequeue(\n T& output)\n {\n buffer_node_t* front = _head.load(std::memory_order_relaxed);\n buffer_node_t* next = front->next.load(std::memory_order_acquire);\n if (next == NULL) {\n \/\/ buffer is empty\n return false;\n }\n output = next->data;\n _head.store(next, std::memory_order_release);\n delete front;\n return true;\n }\n\n\nprivate:\n\n struct buffer_node_t\n {\n buffer_node_t() :\n next(NULL)\n {}\n\n std::atomic<buffer_node_t*> next;\n T data;\n };\n\n typedef typename std::aligned_storage<sizeof(buffer_node_t), std::alignment_of<buffer_node_t>::value>::type buffer_node_aligned_t;\n\n\n std::atomic<buffer_node_t*> _head;\n std::atomic<buffer_node_t*> _tail;\n\n spsc_queue_t(const spsc_queue_t&) {}\n void operator=(const spsc_queue_t&) {}\n};\n\n\nint\nmain()\n{\n spsc_queue_t<int>* buffer = new spsc_queue_t<int>();\n buffer->enqueue(0);\n buffer->enqueue(1);\n buffer->enqueue(2);\n buffer->enqueue(3);\n\n int output = -1;\n std::cout << \"value 0: \" << buffer->dequeue(output) << \" \" << output << std::endl;\n std::cout << \"value 1: \" << buffer->dequeue(output) << \" \" << output << std::endl;\n std::cout << \"value 2: \" << buffer->dequeue(output) << \" \" << output << std::endl;\n delete buffer;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2014 Marianne Gagnon\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n *\/\n\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cstdio>\n#include <vector>\n#include \"Settings.h\"\n\n#include \"Utils.h\"\n#include \"DylibBundler.h\"\n\n\/*\n TODO\n - what happens if a library is not remembered by full path but only name? (support improved, still not perfect)\n - could get mixed up if symlink and original are not in the same location (won't happen for UNIX prefixes like \/usr\/, but in random directories?)\n \n FIXME: why does it copy plugins i try to fix to the libs directory?\n \n *\/\n\nconst std::string VERSION = \"0.4.1\";\n\n\n\/\/ FIXME - no memory management is done at all (anyway the program closes immediately so who cares?)\n\nstd::string installPath = \"\";\n\n\nvoid showHelp()\n{\n std::cout << \"dylibbundler \" << VERSION << std::endl;\n std::cout << \"dylibbundler is a utility that helps bundle dynamic libraries inside mac OS X app bundles.\\n\" << std::endl;\n \n std::cout << \"-x, --fix-file <file to fix (executable or app plug-in)>\" << std::endl;\n std::cout << \"-b, --bundle-deps\" << std::endl;\n std::cout << \"-d, --dest-dir <directory to send bundled libraries (relative to cwd)>\" << std::endl;\n std::cout << \"-p, --install-path <'inner' path of bundled libraries (usually relative to executable, by default '@executable_path\/..\/libs\/')>\" << std::endl;\n std::cout << \"-of, --overwrite-files (allow overwriting files in output directory)\" << std::endl;\n std::cout << \"-od, --overwrite-dir (totally overwrite output directory if it already exists. implies --create-dir)\" << std::endl;\n std::cout << \"-cd, --create-dir (creates output directory if necessary)\" << std::endl;\n std::cout << \"-i, --ignore <location to ignore> (will ignore libraries in this directory)\" << std::endl;\n std::cout << \"-h, --help\" << std::endl;\n}\n\nint main (int argc, char * const argv[])\n{\n \n \/\/ parse arguments \n for(int i=0; i<argc; i++)\n {\n if(strcmp(argv[i],\"-x\")==0 or strcmp(argv[i],\"--fix-file\")==0)\n {\n i++;\n Settings::addFileToFix(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-b\")==0 or strcmp(argv[i],\"--bundle-deps\")==0)\n {\n Settings::bundleLibs(true);\n continue; \n }\n else if(strcmp(argv[i],\"-p\")==0 or strcmp(argv[i],\"--install-path\")==0)\n {\n i++;\n Settings::inside_lib_path(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-i\")==0 or strcmp(argv[i],\"--ignore\")==0)\n {\n i++;\n Settings::ignore_prefix(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-d\")==0 or strcmp(argv[i],\"--dest-dir\")==0)\n {\n i++;\n Settings::destFolder(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-of\")==0 or strcmp(argv[i],\"--overwrite-files\")==0)\n {\n Settings::canOverwriteFiles(true);\n continue; \n }\n else if(strcmp(argv[i],\"-od\")==0 or strcmp(argv[i],\"--overwrite-dir\")==0)\n {\n Settings::canOverwriteDir(true);\n Settings::canCreateDir(true);\n continue; \n }\n else if(strcmp(argv[i],\"-cd\")==0 or strcmp(argv[i],\"--create-dir\")==0)\n {\n Settings::canCreateDir(true);\n continue; \n }\n else if(strcmp(argv[i],\"-h\")==0 or strcmp(argv[i],\"--help\")==0)\n {\n showHelp();\n exit(0); \n }\n else if(i>0)\n {\n \/\/ if we meet an unknown flag, abort\n \/\/ ignore first one cause it's usually the path to the executable\n std::cerr << \"Unknown flag \" << argv[i] << std::endl << std::endl;\n showHelp();\n exit(1);\n }\n }\n \n if(not Settings::bundleLibs() and Settings::fileToFixAmount()<1)\n {\n showHelp();\n exit(0);\n }\n \n std::cout << \"* Collecting dependencies\"; fflush(stdout);\n \n const int amount = Settings::fileToFixAmount();\n for(int n=0; n<amount; n++)\n collectDependencies(Settings::fileToFix(n));\n \n collectSubDependencies();\n doneWithDeps_go();\n \n return 0;\n}\n<commit_msg>Set version to git<commit_after>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2014 Marianne Gagnon\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n *\/\n\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cstdio>\n#include <vector>\n#include \"Settings.h\"\n\n#include \"Utils.h\"\n#include \"DylibBundler.h\"\n\n\/*\n TODO\n - what happens if a library is not remembered by full path but only name? (support improved, still not perfect)\n - could get mixed up if symlink and original are not in the same location (won't happen for UNIX prefixes like \/usr\/, but in random directories?)\n \n FIXME: why does it copy plugins i try to fix to the libs directory?\n \n *\/\n\nconst std::string VERSION = \"git\";\n\n\n\/\/ FIXME - no memory management is done at all (anyway the program closes immediately so who cares?)\n\nstd::string installPath = \"\";\n\n\nvoid showHelp()\n{\n std::cout << \"dylibbundler \" << VERSION << std::endl;\n std::cout << \"dylibbundler is a utility that helps bundle dynamic libraries inside mac OS X app bundles.\\n\" << std::endl;\n \n std::cout << \"-x, --fix-file <file to fix (executable or app plug-in)>\" << std::endl;\n std::cout << \"-b, --bundle-deps\" << std::endl;\n std::cout << \"-d, --dest-dir <directory to send bundled libraries (relative to cwd)>\" << std::endl;\n std::cout << \"-p, --install-path <'inner' path of bundled libraries (usually relative to executable, by default '@executable_path\/..\/libs\/')>\" << std::endl;\n std::cout << \"-of, --overwrite-files (allow overwriting files in output directory)\" << std::endl;\n std::cout << \"-od, --overwrite-dir (totally overwrite output directory if it already exists. implies --create-dir)\" << std::endl;\n std::cout << \"-cd, --create-dir (creates output directory if necessary)\" << std::endl;\n std::cout << \"-i, --ignore <location to ignore> (will ignore libraries in this directory)\" << std::endl;\n std::cout << \"-h, --help\" << std::endl;\n}\n\nint main (int argc, char * const argv[])\n{\n \n \/\/ parse arguments \n for(int i=0; i<argc; i++)\n {\n if(strcmp(argv[i],\"-x\")==0 or strcmp(argv[i],\"--fix-file\")==0)\n {\n i++;\n Settings::addFileToFix(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-b\")==0 or strcmp(argv[i],\"--bundle-deps\")==0)\n {\n Settings::bundleLibs(true);\n continue; \n }\n else if(strcmp(argv[i],\"-p\")==0 or strcmp(argv[i],\"--install-path\")==0)\n {\n i++;\n Settings::inside_lib_path(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-i\")==0 or strcmp(argv[i],\"--ignore\")==0)\n {\n i++;\n Settings::ignore_prefix(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-d\")==0 or strcmp(argv[i],\"--dest-dir\")==0)\n {\n i++;\n Settings::destFolder(argv[i]);\n continue;\n }\n else if(strcmp(argv[i],\"-of\")==0 or strcmp(argv[i],\"--overwrite-files\")==0)\n {\n Settings::canOverwriteFiles(true);\n continue; \n }\n else if(strcmp(argv[i],\"-od\")==0 or strcmp(argv[i],\"--overwrite-dir\")==0)\n {\n Settings::canOverwriteDir(true);\n Settings::canCreateDir(true);\n continue; \n }\n else if(strcmp(argv[i],\"-cd\")==0 or strcmp(argv[i],\"--create-dir\")==0)\n {\n Settings::canCreateDir(true);\n continue; \n }\n else if(strcmp(argv[i],\"-h\")==0 or strcmp(argv[i],\"--help\")==0)\n {\n showHelp();\n exit(0); \n }\n else if(i>0)\n {\n \/\/ if we meet an unknown flag, abort\n \/\/ ignore first one cause it's usually the path to the executable\n std::cerr << \"Unknown flag \" << argv[i] << std::endl << std::endl;\n showHelp();\n exit(1);\n }\n }\n \n if(not Settings::bundleLibs() and Settings::fileToFixAmount()<1)\n {\n showHelp();\n exit(0);\n }\n \n std::cout << \"* Collecting dependencies\"; fflush(stdout);\n \n const int amount = Settings::fileToFixAmount();\n for(int n=0; n<amount; n++)\n collectDependencies(Settings::fileToFix(n));\n \n collectSubDependencies();\n doneWithDeps_go();\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <limits>\n#include <iostream>\n#include <fstream>\n#include <vector>\n\n#include <algorithm>\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#ifndef EFU_WINERRORSTRING_H\n#include \"win_error_string.h\"\n#endif\n\n#endif\n\n#ifndef EFU_TARGET_H\n#include \"target.h\"\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\n\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n bool arg_errors = false;\n\n#ifdef _WIN32\n const std::string nwn_bin(\"nwmain.exe\");\n#else\n const std::string nwn_bin(\"nwmain\");\n#endif\n std::string nwn_root_dir(\".\/\");\n\n std::string cmd_line(\" +connect nwn.efupw.com:5121\");\n \n const std::vector<std::string> args(argv + 1, argv + argc);\n\n std::cout << \"Processing command line arguments.\" << std::endl;\n\n#ifdef CPP11_FOR_EACH\n for (const auto arg : args)\n#else\n std::for_each(args.cbegin(), args.cend(),\n [&cmd_line, &nwn_root_dir, &arg_errors](const std::string &arg)\n#endif\n {\n if (arg.find(\"-dmpass\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n cmd_line.append(\" -dmc +password \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-dmpass specified but no value given. Use\\n\"\\\n \"-dmpass=mypassword\" <<std::endl;\n arg_errors = true;\n }\n }\n else if (arg.find(\"-nwn\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n nwn_root_dir = cmd.at(1);\n }\n else\n {\n std::cout << \"-nwn specified but no value given. Use\\n\"\\\n \"-nwn=\\\"path\\\\to\\\\NWN\\\\directory\\\\\\\"\" <<std::endl;\n arg_errors = true;\n }\n }\n else\n {\n std::cout << \"Ignoring unrecognized argument: \" << arg\n << std::endl;\n arg_errors = true;\n }\n }\n#ifndef CPP11_FOR_EACH\n );\n#endif\n \n if (arg_errors)\n {\n std::cout << \"Argument errors. Press a key to continue.\" << std::endl;\n std::cin.get();\n }\n\n#ifdef _WIN32\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n \n if (!nwn && nwn_root_dir != \".\/\")\n {\n std::cout << nwn_root_dir << \" not detected as NWN root directory.\"\\\n \"\\nTrying current launcher directory...\\n\";\n nwn_root_dir = \".\/\";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n }\n\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n \n if (nwn)\n {\n std::cout << nwn_root_dir + nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n nwn_root_dir = \".\/\";\n }\n#endif\n\n EfuLauncher l(nwn_root_dir,\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available. Please\"\\\n \" download it at https:\/\/github.com\/commonquail\/efulauncher\/\"\\\n \"releases. Press any key to exit.\" << std::endl;\n std::cin.get();\n return 0;\n \/*\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n *\/\n }\n\n try\n {\n l.stat_targets();\n std::cout << \"Done.\" << std::endl;\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n#ifdef _WIN32\n if (nwn)\n {\n std::cout << \"Launching \" << nwn_root_dir + nwn_bin << \"...\" << std::endl;\n\n STARTUPINFO si;\n PROCESS_INFORMATION pi;\n ::ZeroMemory(&pi, sizeof(pi));\n ::ZeroMemory(&si, sizeof(si));\n si.cb = sizeof(si);\n \n auto nwn_path(nwn_root_dir + nwn_bin);\n cmd_line = nwn_path + cmd_line;\n\n BOOL success = ::CreateProcess(\n const_cast<char *>(nwn_path.c_str()),\n const_cast<char *>(cmd_line.c_str()),\n NULL, \/\/ Process handle not inheritable\n NULL, \/\/ Thread handle not inheritable\n FALSE, \/\/ Set handle inheritance to FALSE\n 0, \/\/ No creation flags\n NULL, \/\/ Use parent's environment block\n const_cast<char *>(nwn_root_dir.c_str()), \/\/ Starting directory \n &si, &pi);\n if (success)\n {\n ::CloseHandle(pi.hProcess);\n ::CloseHandle(pi.hThread);\n }\n else\n {\n WinErrorString we;\n std::cout << we.str() << std::endl;\n }\n }\n#endif\n\n return 0;\n}\n<commit_msg>Fix whitespace.<commit_after>#include <limits>\n#include <iostream>\n#include <fstream>\n#include <vector>\n\n#include <algorithm>\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#ifndef EFU_WINERRORSTRING_H\n#include \"win_error_string.h\"\n#endif\n\n#endif\n\n#ifndef EFU_TARGET_H\n#include \"target.h\"\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n bool arg_errors = false;\n\n#ifdef _WIN32\n const std::string nwn_bin(\"nwmain.exe\");\n#else\n const std::string nwn_bin(\"nwmain\");\n#endif\n std::string nwn_root_dir(\".\/\");\n\n std::string cmd_line(\" +connect nwn.efupw.com:5121\");\n \n const std::vector<std::string> args(argv + 1, argv + argc);\n\n std::cout << \"Processing command line arguments.\" << std::endl;\n\n#ifdef CPP11_FOR_EACH\n for (const auto arg : args)\n#else\n std::for_each(args.cbegin(), args.cend(),\n [&cmd_line, &nwn_root_dir, &arg_errors]\n (const std::string &arg)\n#endif\n {\n if (arg.find(\"-dmpass\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n cmd_line.append(\" -dmc +password \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-dmpass specified but no value given. Use\\n\"\\\n \"-dmpass=mypassword\" <<std::endl;\n arg_errors = true;\n }\n }\n else if (arg.find(\"-nwn\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n nwn_root_dir = cmd.at(1);\n }\n else\n {\n std::cout << \"-nwn specified but no value given. Use\\n\"\\\n \"-nwn=\\\"path\\\\to\\\\NWN\\\\directory\\\\\\\"\" <<std::endl;\n arg_errors = true;\n }\n }\n else\n {\n std::cout << \"Ignoring unrecognized argument: \" << arg\n << std::endl;\n arg_errors = true;\n }\n }\n#ifndef CPP11_FOR_EACH\n );\n#endif\n \n if (arg_errors)\n {\n std::cout << \"Argument errors. Press a key to continue.\" << std::endl;\n std::cin.get();\n }\n\n#ifdef _WIN32\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n \n if (!nwn && nwn_root_dir != \".\/\")\n {\n std::cout << nwn_root_dir << \" not detected as NWN root directory.\"\\\n \"\\nTrying current launcher directory...\\n\";\n nwn_root_dir = \".\/\";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n }\n\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n \n if (nwn)\n {\n std::cout << nwn_root_dir + nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n nwn_root_dir = \".\/\";\n }\n#endif\n\n EfuLauncher l(nwn_root_dir,\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available. Please\"\\\n \" download it at https:\/\/github.com\/commonquail\/efulauncher\/\"\\\n \"releases. Press any key to exit.\" << std::endl;\n std::cin.get();\n return 0;\n \/*\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n *\/\n }\n\n try\n {\n l.stat_targets();\n std::cout << \"Done.\" << std::endl;\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n#ifdef _WIN32\n if (nwn)\n {\n std::cout << \"Launching \" << nwn_root_dir + nwn_bin << \"...\" << std::endl;\n\n STARTUPINFO si;\n PROCESS_INFORMATION pi;\n ::ZeroMemory(&pi, sizeof(pi));\n ::ZeroMemory(&si, sizeof(si));\n si.cb = sizeof(si);\n \n auto nwn_path(nwn_root_dir + nwn_bin);\n cmd_line = nwn_path + cmd_line;\n\n BOOL success = ::CreateProcess(\n const_cast<char *>(nwn_path.c_str()),\n const_cast<char *>(cmd_line.c_str()),\n NULL, \/\/ Process handle not inheritable\n NULL, \/\/ Thread handle not inheritable\n FALSE, \/\/ Set handle inheritance to FALSE\n 0, \/\/ No creation flags\n NULL, \/\/ Use parent's environment block\n const_cast<char *>(nwn_root_dir.c_str()), \/\/ Starting directory \n &si, &pi);\n if (success)\n {\n ::CloseHandle(pi.hProcess);\n ::CloseHandle(pi.hThread);\n }\n else\n {\n WinErrorString we;\n std::cout << we.str() << std::endl;\n }\n }\n#endif\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Blink\n Turns on an LED on for one second, then off for one second, repeatedly.\n Example uses a static library to show off generate_arduino_library().\n \n This example code is in the public domain.\n *\/\n#if ARDUINO >= 100\n #include \"Arduino.h\"\n#else\n #include \"WProgram.h\"\n#endif\n\n\n#include \"dimmer.h\"\n\nbyte ledPin = 13;\nbyte zcPin = 2;\nbyte zcOutPin = 8;\n\nvoid pciSetup(byte pin)\n{\n \/\/*digitalPinToPCMSK(pin) |= bit (digitalPinToPCMSKbit(pin)); \/\/ enable pin\n \/\/PCIFR |= bit (digitalPinToPCICRbit(pin)); \/\/ clear any outstanding interrupt\n \/\/PCICR |= bit (digitalPinToPCICRbit(pin)); \/\/ enable interrupt for the group\n}\n\n\n#include <stdarg.h>\nvoid _printf(char *fmt, ... ){\n char buf[128]; \/\/ resulting string limited to 128 chars\n va_list args;\n va_start (args, fmt );\n vsnprintf(buf, 128, fmt, args);\n va_end (args);\n Serial.print(buf);\n}\n\n\n\/\/ we need fundamental FILE definitions and printf declarations\n#include <stdio.h>\n\n\/\/ create a FILE structure to reference our UART output function\nstatic FILE uartout = {0} ;\n\n\/\/ create a output function\n\/\/ This works because Serial.write, although of\n\/\/ type virtual, already exists.\nstatic int uart_putchar (char c, FILE *stream)\n{\n Serial.write(c) ;\n return 0 ;\n}\n\n\/** SSR library **\/\n\n\n\nvoid setup() { \n\n \/\/ Start the UART\n Serial.begin(115200) ;\n Serial.setTimeout(-1);\n\n \/\/ fill in the UART file descriptor with pointer to writer.\n fdev_setup_stream (&uartout, uart_putchar, NULL,\n _FDEV_SETUP_WRITE);\n\n \/\/ The uart is the standard output device STDOUT.\n stdout = &uartout ;\n\n printf(\"setup\\n\\r\");\n \/\/blink_setup(); \/\/ Setup for blinking\n pinMode(ledPin, OUTPUT);\n pinMode(zcPin, INPUT_PULLUP);\n \/\/pinMode(zcOutPin, OUTPUT);\n \/\/pciSetup(zcPin);\n\n dimmer_init();\n\n dimmer_set(PHASE_LEADING_EDGE, CHANNEL1, 144);\n dimmer_set(PHASE_LEADING_EDGE, CHANNEL2, 200);\n dimmer_set(FULL_WAVE_BURST, CHANNEL3, 128);\n dimmer_set(HALF_WAVE_BURST, CHANNEL4, 64);\n}\n\nchar uart_getchar(void) {\n loop_until_bit_is_set(UCSR0A, RXC0); \/* Wait until data exists. *\/\n return UDR0;\n}\n\nvoid _read_line(char *buffer, uint8_t len) {\n do {\n *buffer = uart_getchar();\n if (*buffer == 13) {\n printf(\"this is it\\n\\r\");\n *buffer = '\\0';\n return;\n }\n buffer++;\n } while (--len > 0);\n return;\n}\n\n\/\/ LINE: [CHANNEL_NR] [ON\/OFF] [VALUE]\n\/\/ 1 1 3\n\n#define LINE_LENGTH 8\n\nvoid loop() {\n char buffer[8];\n printf(\"start\\n\\r\");\n\n Serial.readBytes(buffer, 7);\n buffer[7] = '\\0';\n\n \/\/_read_line(buffer, LINE_LENGTH);\n\n printf(\"read: %s\\n\\r\", buffer);\n\n t_channel_nr channel_nr = buffer[0] - '0';\n t_action action = buffer[2] - '0';\n uint8_t value = atoi(&buffer[4]);\n\n printf(\"channel: %u action: %u value: %u\\n\\r\", channel_nr, action, value);\n}\n<commit_msg>add comments for driver.<commit_after>\/*\n Blink\n Turns on an LED on for one second, then off for one second, repeatedly.\n Example uses a static library to show off generate_arduino_library().\n \n This example code is in the public domain.\n *\/\n#if ARDUINO >= 100\n #include \"Arduino.h\"\n#else\n #include \"WProgram.h\"\n#endif\n\n\n#include \"dimmer.h\"\n\nbyte ledPin = 13;\nbyte zcPin = 2;\nbyte zcOutPin = 8;\n\nvoid pciSetup(byte pin)\n{\n \/\/*digitalPinToPCMSK(pin) |= bit (digitalPinToPCMSKbit(pin)); \/\/ enable pin\n \/\/PCIFR |= bit (digitalPinToPCICRbit(pin)); \/\/ clear any outstanding interrupt\n \/\/PCICR |= bit (digitalPinToPCICRbit(pin)); \/\/ enable interrupt for the group\n}\n\n\n#include <stdarg.h>\nvoid _printf(char *fmt, ... ){\n char buf[128]; \/\/ resulting string limited to 128 chars\n va_list args;\n va_start (args, fmt );\n vsnprintf(buf, 128, fmt, args);\n va_end (args);\n Serial.print(buf);\n}\n\n\n\/\/ we need fundamental FILE definitions and printf declarations\n#include <stdio.h>\n\n\/\/ create a FILE structure to reference our UART output function\nstatic FILE uartout = {0} ;\n\n\/\/ create a output function\n\/\/ This works because Serial.write, although of\n\/\/ type virtual, already exists.\nstatic int uart_putchar (char c, FILE *stream)\n{\n Serial.write(c) ;\n return 0 ;\n}\n\n\/** SSR library **\/\n\n\n\nvoid setup() { \n\n \/\/ Start the UART\n Serial.begin(115200) ;\n Serial.setTimeout(-1);\n\n \/\/ fill in the UART file descriptor with pointer to writer.\n fdev_setup_stream (&uartout, uart_putchar, NULL,\n _FDEV_SETUP_WRITE);\n\n \/\/ The uart is the standard output device STDOUT.\n stdout = &uartout ;\n\n printf(\"setup\\n\\r\");\n \/\/blink_setup(); \/\/ Setup for blinking\n pinMode(ledPin, OUTPUT);\n pinMode(zcPin, INPUT_PULLUP);\n \/\/pinMode(zcOutPin, OUTPUT);\n \/\/pciSetup(zcPin);\n\n \/\/ thats it!\n \/\/ FROM HERE\n dimmer_init();\n dimmer_set(PHASE_TRAILING_EDGE, CHANNEL1, 1);\n \/\/ TO HERE\n\n\n dimmer_set(PHASE_LEADING_EDGE, CHANNEL2, 200);\n dimmer_set(FULL_WAVE_BURST, CHANNEL3, 128);\n dimmer_set(HALF_WAVE_BURST, CHANNEL4, 64);\n}\n\nchar uart_getchar(void) {\n loop_until_bit_is_set(UCSR0A, RXC0); \/* Wait until data exists. *\/\n return UDR0;\n}\n\nvoid _read_line(char *buffer, uint8_t len) {\n do {\n *buffer = uart_getchar();\n if (*buffer == 13) {\n printf(\"this is it\\n\\r\");\n *buffer = '\\0';\n return;\n }\n buffer++;\n } while (--len > 0);\n return;\n}\n\n\/\/ LINE: [CHANNEL_NR] [ON\/OFF] [VALUE]\n\/\/ 1 1 3\n\n#define LINE_LENGTH 8\n\nvoid loop() {\n char buffer[8];\n printf(\"start\\n\\r\");\n\n Serial.readBytes(buffer, 7);\n buffer[7] = '\\0';\n\n \/\/_read_line(buffer, LINE_LENGTH);\n\n printf(\"read: %s\\n\\r\", buffer);\n\n t_channel_nr channel_nr = buffer[0] - '0';\n t_action action = buffer[2] - '0';\n uint8_t value = atoi(&buffer[4]);\n\n printf(\"channel: %u action: %u value: %u\\n\\r\", channel_nr, action, value);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/string_cast.hpp>\n#include <lua\/lua.hpp>\n\n#include \"terrian_config.hpp\"\n#include \"matrixstacksingleton.hpp\"\n#include \"polygon.hpp\"\n#include \"logiccontext.hpp\"\n#include \"visualcontext.hpp\"\n#include \"heightmap.hpp\"\n#include \"line.hpp\"\n#include \"triangle.hpp\"\n#include \"luae\/script.hpp\"\n#include \"luae\/scriptmanager.hpp\"\n#include \"luae\/scriptheightmap.hpp\"\n#include \"luae\/scriptriangle.hpp\"\n\n\/\/For stringifying preprocessor values\n#define xstr(s) str(s)\n #define str(s) #s\n#define concat(first, second) first second\n\nstatic struct LogicContext logicContext;\nstatic glm::vec3 ray_world;\n\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mods) {\n\tglm::vec3 up = glm::vec3(glm::vec4(0.0, 1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 down = glm::vec3(glm::vec4(0.0, -1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 left = glm::vec3(glm::vec4(-1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 right = glm::vec3(glm::vec4(1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\t}\n\tif (key == GLFW_KEY_SPACE && action == GLFW_PRESS){\n\t\tprintf(\"Triangle 1 Model Matrix: %s\\n\", glm::to_string(logicContext.modelview).c_str());\n\t}\n\tif(key == GLFW_KEY_R && action == GLFW_RELEASE){\n\t\tlogicContext.modelview = glm::mat4();\n\n\t}\n\tif(key == GLFW_KEY_LEFT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, up);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, down);\n\t}\n\telse if(key == GLFW_KEY_LEFT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, left * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, right * 0.1f);\n\t}\n\tif(key == GLFW_KEY_UP && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, up * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, down * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_UP && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, left);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, right);\n\n\t}\n}\nstatic void calcWorldPickRay(GLFWwindow *window){\n\t\/\/Build ray from mouse\n\tdouble mouseX;\n\tdouble mouseY;\n\n\tglfwGetCursorPos(window, &mouseX, &mouseY);\n\n\tglm::vec4 ray_clip = glm::vec4((2.0f * mouseX) \/ VisualContext::width - 1.0f, 1.0f - (2.0f * mouseY) \/ VisualContext::height, -1.0f, 1.0f);\n\n\tglm::vec4 ray_eye = glm::inverse(VisualContext::projection_matrix) * ray_clip;\n\tray_eye.z = -1.0f;\n\tray_eye.w = 1.0f;\n\n\tray_world = glm::vec3(glm::inverse(logicContext.modelview) * ray_eye);\n\t\/\/\t\tray_world = glm::normalize(ray_world);\n\n}\n\nint main(void) {\n\n\tGLFWwindow *window = VisualContext::CreateGLFWWindow(key_callback);\n\tGLuint shader_program = VisualContext::make_shader_program(concat(xstr(SHADERS_DIR), \"\/shader.vert\"), concat(xstr(SHADERS_DIR), \"\/shader.frag\"));\n\tglUseProgram(shader_program);\n\tGLuint vertShaderLocation = glGetAttribLocation(shader_program, \"vert\");\n\tGLuint uloc_project = glGetUniformLocation(shader_program, \"project\");\n\tGLuint uloc_modelview = glGetUniformLocation(shader_program, \"modelview\");\n\n\t\/* Compute the projection matrix *\/\n\tVisualContext::projection_matrix = glm::perspective(VisualContext::view_angle, VisualContext::aspect_ratio, VisualContext::z_near, VisualContext::z_far);\n\tlogicContext.uloc_modelview = uloc_modelview;\n\n\t\/* Set the camera position *\/\n\tlogicContext.modelview = glm::translate(logicContext.modelview, glm::vec3(0.0f, 0.0f, -20.0f));\n\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.0f, glm::vec3(-1.0f, 0.0f, 0.0f));\n\n\t\/*\n\tHeightmapSettings heightmapSettings;\n\n\theightmapSettings.widthDensity = 10;\n\theightmapSettings.origin = glm::vec3(0.0f, 0.0f, 0.0f);\n\n\tHeightmap heightmap(heightmapSettings);\n\theightmap.build(heightmapSettings);\n\theightmap.setShaderLocations(vertShaderLocation);\n\theightmap.rotate(glm::vec3(1,0,0), -1.57f);\n\t*\/\n\n\tglViewport(0,0,VisualContext::width, VisualContext::height);\n\tglClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\n\tLine worldLine;\n\tworldLine.buildStatic();\n\tworldLine.setShaderLocations(vertShaderLocation);\n\n\tlua_State* l = Luae::ScriptManager::instance()->getState();\n\tLuae::ScriptTriangle::AddToLib();\n\tLuae::Script* script = Luae::Script::Load(\"triangle_drawing.lua\");\n\tscript->call(\"init\");\n\tlua_getglobal(l, \"triangle\");\n\tTriangle* triangle = *(Triangle**)lua_touserdata(l,-1);\n\n\tglEnable(GL_MULTISAMPLE);\n\n\twhile (!glfwWindowShouldClose(window)) {\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglPolygonMode(GL_FRONT, GL_FILL);\n\t\tglUniformMatrix4fv(uloc_project, 1, GL_FALSE, glm::value_ptr(VisualContext::projection_matrix));\n\n\n\t\tcalcWorldPickRay(window);\n\t\tglm::vec3 rayWordEndPoint = glm::vec3(glm::vec4(0.0f, 0.0f, -100.0f, 1.0f) * logicContext.modelview);\n\n\t\tworldLine.setStartEnd(ray_world, rayWordEndPoint);\n\t\tworldLine.update(&logicContext);\n\t\tworldLine.draw(&logicContext);\n\n\t\ttriangle->update(&logicContext);\n\t\ttriangle->draw(&logicContext);\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglfwDestroyWindow(window);\n\n\tglfwTerminate();\n\treturn 0;\n}\n<commit_msg>Now using rendering queue based on IPolygon interface<commit_after>#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/gtx\/string_cast.hpp>\n#include <lua\/lua.hpp>\n#include <vector>\n#include <fmt\/format.h>\n\n#include \"terrian_config.hpp\"\n#include \"matrixstacksingleton.hpp\"\n#include \"IPolygon.hpp\"\n#include \"polygon.hpp\"\n#include \"logiccontext.hpp\"\n#include \"visualcontext.hpp\"\n#include \"heightmap.hpp\"\n#include \"line.hpp\"\n#include \"triangle.hpp\"\n#include \"addtodrawqueue.hpp\"\n#include \"luae\/script.hpp\"\n#include \"luae\/scriptmanager.hpp\"\n#include \"luae\/scriptheightmap.hpp\"\n#include \"luae\/scriptriangle.hpp\"\n\n\/\/For stringifying preprocessor values\n#define xstr(s) str(s)\n #define str(s) #s\n#define concat(first, second) first second\n\nstatic struct LogicContext logicContext;\nstatic glm::vec3 ray_world;\n\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mods) {\n\tglm::vec3 up = glm::vec3(glm::vec4(0.0, 1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 down = glm::vec3(glm::vec4(0.0, -1.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 left = glm::vec3(glm::vec4(-1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tglm::vec3 right = glm::vec3(glm::vec4(1.0, 0.0, 0.0, 1.0) * logicContext.modelview);\n\tif (key == GLFW_KEY_ESCAPE && action == GLFW_PRESS){\n\t\tglfwSetWindowShouldClose(window, GL_TRUE);\n\t}\n\tif (key == GLFW_KEY_SPACE && action == GLFW_PRESS){\n\t\tprintf(\"Triangle 1 Model Matrix: %s\\n\", glm::to_string(logicContext.modelview).c_str());\n\t}\n\tif(key == GLFW_KEY_R && action == GLFW_RELEASE){\n\t\tlogicContext.modelview = glm::mat4();\n\n\t}\n\tif(key == GLFW_KEY_LEFT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, up);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, down);\n\t}\n\telse if(key == GLFW_KEY_LEFT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, left * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_RIGHT && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, right * 0.1f);\n\t}\n\tif(key == GLFW_KEY_UP && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, up * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == 0){\n\t\tlogicContext.modelview = glm::translate(logicContext.modelview, down * 0.1f);\n\t}\n\telse if(key == GLFW_KEY_UP && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, left);\n\t}\n\telse if(key == GLFW_KEY_DOWN && mods == GLFW_MOD_SHIFT){\n\t\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.1f, right);\n\n\t}\n}\nstatic void calcWorldPickRay(GLFWwindow *window){\n\t\/\/Build ray from mouse\n\tdouble mouseX;\n\tdouble mouseY;\n\n\tglfwGetCursorPos(window, &mouseX, &mouseY);\n\n\tglm::vec4 ray_clip = glm::vec4((2.0f * mouseX) \/ VisualContext::width - 1.0f, 1.0f - (2.0f * mouseY) \/ VisualContext::height, -1.0f, 1.0f);\n\n\tglm::vec4 ray_eye = glm::inverse(VisualContext::projection_matrix) * ray_clip;\n\tray_eye.z = -1.0f;\n\tray_eye.w = 1.0f;\n\n\tray_world = glm::vec3(glm::inverse(logicContext.modelview) * ray_eye);\n\t\/\/\t\tray_world = glm::normalize(ray_world);\n\n}\n\nint main(void) {\n\n\tGLFWwindow *window = VisualContext::CreateGLFWWindow(key_callback);\n\tGLuint shader_program = VisualContext::make_shader_program(concat(xstr(SHADERS_DIR), \"\/shader.vert\"), concat(xstr(SHADERS_DIR), \"\/shader.frag\"));\n\tglUseProgram(shader_program);\n\tGLuint vertShaderLocation = glGetAttribLocation(shader_program, \"vert\");\n\tGLuint uloc_project = glGetUniformLocation(shader_program, \"project\");\n\tGLuint uloc_modelview = glGetUniformLocation(shader_program, \"modelview\");\n\tstd::vector<IPolygon*> drawQueue;\n\tAddToDrawQueueCommand::SetQueue(&drawQueue);\n\n\t\/* Compute the projection matrix *\/\n\tVisualContext::projection_matrix = glm::perspective(VisualContext::view_angle, VisualContext::aspect_ratio, VisualContext::z_near, VisualContext::z_far);\n\tlogicContext.uloc_modelview = uloc_modelview;\n\n\t\/* Set the camera position *\/\n\tlogicContext.modelview = glm::translate(logicContext.modelview, glm::vec3(0.0f, 0.0f, -20.0f));\n\tlogicContext.modelview = glm::rotate(logicContext.modelview, 0.0f, glm::vec3(-1.0f, 0.0f, 0.0f));\n\n\t\/*\n\tHeightmapSettings heightmapSettings;\n\n\theightmapSettings.widthDensity = 10;\n\theightmapSettings.origin = glm::vec3(0.0f, 0.0f, 0.0f);\n\n\tHeightmap heightmap(heightmapSettings);\n\theightmap.build(heightmapSettings);\n\theightmap.setShaderLocations(vertShaderLocation);\n\theightmap.rotate(glm::vec3(1,0,0), -1.57f);\n\t*\/\n\n\tglViewport(0,0,VisualContext::width, VisualContext::height);\n\tglClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n\n\tLine worldLine;\n\tworldLine.buildStatic();\n\tworldLine.setShaderLocations(vertShaderLocation);\n\n\tlua_State* l = Luae::ScriptManager::instance()->getState();\n\tLuae::ScriptTriangle::AddToLib();\n\tLuae::Script* script = Luae::Script::Load(\"triangle_drawing.lua\");\n\tscript->call(\"init\");\n\t\/\/lua_getglobal(l, \"triangle\");\n\t\/\/Triangle* triangle = *(Triangle**)lua_touserdata(l,-1);\n\t\/\/drawQueue.push_back(triangle);\n\/\/\tAddToDrawQueueCommand addTriangle(triangle);\n\/\/\taddTriangle.execute();\n\n\tglEnable(GL_MULTISAMPLE);\n\n\twhile (!glfwWindowShouldClose(window)) {\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglPolygonMode(GL_FRONT, GL_FILL);\n\t\tglUniformMatrix4fv(uloc_project, 1, GL_FALSE, glm::value_ptr(VisualContext::projection_matrix));\n\n\n\t\tcalcWorldPickRay(window);\n\t\tglm::vec3 rayWordEndPoint = glm::vec3(glm::vec4(0.0f, 0.0f, -100.0f, 1.0f) * logicContext.modelview);\n\n\t\tworldLine.setStartEnd(ray_world, rayWordEndPoint);\n\t\tworldLine.update(&logicContext);\n\t\tworldLine.draw(&logicContext);\n\n\t\t\/\/triangle->update(&logicContext);\n\t\t\/\/triangle->draw(&logicContext);\n\n\t\tint i = 0;\n\t\tfor(std::vector<IPolygon*>::iterator drawHost = drawQueue.begin();\n\t\t\t\tdrawHost != drawQueue.end();\n\t\t\t\tdrawHost++){\n\t\t\t(*drawHost)->update(&logicContext);\n\t\t\t(*drawHost)->draw(&logicContext);\n\t\t\ti++;\n\t\t\/\/\tfmt::printf(\"Draw call #: %d\\n\", i);\n\t\t}\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglfwDestroyWindow(window);\n\n\tglfwTerminate();\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/--------------------------------------------------------------------------------------------------\r\n\/\/ \r\n\/\/\/ @PROJECT\t\tgtest-gui\r\n\/\/\/ @BRIEF\t\tmain file for gtest-gui\r\n\/\/\/ @DETAILS\t\r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/\r\n\/\/ The MIT License (MIT)\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software \r\n\/\/ and associated documentation files (the \"Software\"), to deal in the Software without \r\n\/\/ restriction, including without limitation the rights to use, copy, modify, merge, publish, \r\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the \r\n\/\/ Software is furnished to do so, subject to the following conditions:\r\n\/\/ \r\n\/\/ The above copyright notice and this permission notice shall be included in all copies or \r\n\/\/ substantial portions of the Software.\r\n\/\/ \r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING \r\n\/\/ BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND \r\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, \r\n\/\/ DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \r\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/\r\n\/\/ ATTRIBUTION:\r\n\/\/ Parts of this work have been adapted from: \r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/ \r\n\/\/ Copyright (c) 2016 Nic Holthaus\r\n\/\/ \r\n\/\/--------------------------------------------------------------------------------------------------\r\n\r\n\r\n\/\/------------------------------\r\n\/\/\tINCLUDE\r\n\/\/------------------------------\r\n\r\n\/\/ Qt\r\n#include <QApplication>\r\n#include <QtGlobal>\r\n\r\n\/\/ gtest-gui\r\n#include \"appinfo.h\"\r\n#include \"mainwindow.h\"\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n\tQ_INIT_RESOURCE(resources);\r\n\r\n\/\/ Enable high-DPI scaling with Qt 5.6+\r\n#if QT_VERSION >= 050600\r\n\tQApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\r\n#endif\r\n\t\r\n\tQApplication app(argc, argv);\t\r\n\tapp.setOrganizationName(APPINFO::organization);\r\n\tapp.setOrganizationDomain(APPINFO::oranizationDomain);\r\n\tapp.setApplicationName(APPINFO::name);\r\n\tapp.setApplicationVersion(APPINFO::version);\r\n\tMainWindow mainWin;\r\n\tmainWin.show();\r\n\treturn app.exec();\r\n}<commit_msg>another attempt at QT version check.<commit_after>\/\/--------------------------------------------------------------------------------------------------\r\n\/\/ \r\n\/\/\/ @PROJECT\t\tgtest-gui\r\n\/\/\/ @BRIEF\t\tmain file for gtest-gui\r\n\/\/\/ @DETAILS\t\r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/\r\n\/\/ The MIT License (MIT)\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of this software \r\n\/\/ and associated documentation files (the \"Software\"), to deal in the Software without \r\n\/\/ restriction, including without limitation the rights to use, copy, modify, merge, publish, \r\n\/\/ distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the \r\n\/\/ Software is furnished to do so, subject to the following conditions:\r\n\/\/ \r\n\/\/ The above copyright notice and this permission notice shall be included in all copies or \r\n\/\/ substantial portions of the Software.\r\n\/\/ \r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING \r\n\/\/ BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND \r\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, \r\n\/\/ DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \r\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/\r\n\/\/ ATTRIBUTION:\r\n\/\/ Parts of this work have been adapted from: \r\n\/\/\r\n\/\/--------------------------------------------------------------------------------------------------\r\n\/\/ \r\n\/\/ Copyright (c) 2016 Nic Holthaus\r\n\/\/ \r\n\/\/--------------------------------------------------------------------------------------------------\r\n\r\n\r\n\/\/------------------------------\r\n\/\/\tINCLUDE\r\n\/\/------------------------------\r\n\r\n\/\/ Qt\r\n#include <QApplication>\r\n#include <QDebug>\r\n#include <QtGlobal>\r\n\r\n\/\/ gtest-gui\r\n#include \"appinfo.h\"\r\n#include \"mainwindow.h\"\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n\tQ_INIT_RESOURCE(resources);\r\n\r\n\/\/ Enable high-DPI scaling with Qt 5.6+\r\n#if (QT_VERSION >= QT_VERSION_CHECK(5,6,0))\r\n\tQApplication::setAttribute(Qt::AA_EnableHighDpiScaling);\r\n#endif\r\n\t\r\n\tQApplication app(argc, argv);\t\r\n\tapp.setOrganizationName(APPINFO::organization);\r\n\tapp.setOrganizationDomain(APPINFO::oranizationDomain);\r\n\tapp.setApplicationName(APPINFO::name);\r\n\tapp.setApplicationVersion(APPINFO::version);\r\n\tMainWindow mainWin;\r\n\tmainWin.show();\r\n\treturn app.exec();\r\n}<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n\n try {\n Inotify notify;\n\n InotifyWatch watch(file, IN_ALL_EVENTS);\n notify.Add(watch);\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while (count > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if (got_event) {\n std::string mask_str;\n event.DumpTypes(mask_str);\n\n std::string filename = event.GetName();\n std::cout << \"event mask: \\\"\" << mask_str << \"\\\", \";\n std::cout << \"filename: \\\"\" << filename << \"\\\"\" << std::endl;\n *fragHasChanged = true;\n }\n\n count--;\n }\n }\n } catch (InotifyException &e) {\n std::cerr << \"Inotify exception occured: \" << e.GetMessage() << std::endl;\n } catch (std::exception &e) {\n std::cerr << \"STL exception occured: \" << e.what() << std::endl;\n } catch (...) {\n std::cerr << \"unknown exception occured\" << std::endl;\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n std::cout << \"Watch thread shutdown\" << std::endl;\n }\n break;\n\n default: \/\/ parent\n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<commit_msg>debug<commit_after>#include <stdio.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <assert.h>\n#include <unistd.h>\n#include <fstream>\n#include <iostream>\n#include <time.h>\n#include <unistd.h>\n#include <sys\/shm.h>\n\n#include \"bcm_host.h\"\n\n#include \"GLES2\/gl2.h\"\n#include \"EGL\/egl.h\"\n#include \"EGL\/eglext.h\"\n\n#include \"shader.h\"\n#include \"inotify-cxx.h\"\n\ntypedef struct {\n uint32_t screen_width;\n uint32_t screen_height;\n \/\/ OpenGL|ES objects\n EGLDisplay display;\n EGLSurface surface;\n EGLContext context;\n\n GLuint buf;\n\n Shader shader;\n\n} CUBE_STATE_T;\n\nbool* fragHasChanged;\nstd::string fragFile;\nstd::string vertSource =\n\"attribute vec4 a_position;\"\n\"varying vec2 v_texcoord;\"\n\"void main(void) {\"\n\" gl_Position = a_position;\"\n\" v_texcoord = a_position.xy*0.5+0.5;\"\n\"}\";\n\nstatic CUBE_STATE_T _state, *state=&_state;\n\nstatic void init_ogl(CUBE_STATE_T *state){\n int32_t success = 0;\n EGLBoolean result;\n EGLint num_config;\n \n static EGL_DISPMANX_WINDOW_T nativewindow;\n \n DISPMANX_ELEMENT_HANDLE_T dispman_element;\n DISPMANX_DISPLAY_HANDLE_T dispman_display;\n DISPMANX_UPDATE_HANDLE_T dispman_update;\n VC_RECT_T dst_rect;\n VC_RECT_T src_rect;\n \n static const EGLint attribute_list[] = {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_ALPHA_SIZE, 8,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n \n static const EGLint context_attributes[] = {\n EGL_CONTEXT_CLIENT_VERSION, 2,\n EGL_NONE\n };\n EGLConfig config;\n \n \/\/ get an EGL display connection\n state->display = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n assert(state->display!=EGL_NO_DISPLAY);\n \n \n \/\/ initialize the EGL display connection\n result = eglInitialize(state->display, NULL, NULL);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglChooseConfig(state->display, attribute_list, &config, 1, &num_config);\n assert(EGL_FALSE != result);\n \n \n \/\/ get an appropriate EGL frame buffer configuration\n result = eglBindAPI(EGL_OPENGL_ES_API);\n assert(EGL_FALSE != result);\n \n \n \/\/ create an EGL rendering context\n state->context = eglCreateContext(state->display, config, EGL_NO_CONTEXT, context_attributes);\n assert(state->context!=EGL_NO_CONTEXT);\n \n \n \/\/ create an EGL window surface\n success = graphics_get_display_size(0 \/* LCD *\/, &state->screen_width, &state->screen_height);\n assert( success >= 0 );\n \n dst_rect.x = 0;\n dst_rect.y = 0;\n dst_rect.width = state->screen_width;\n dst_rect.height = state->screen_height;\n \n src_rect.x = 0;\n src_rect.y = 0;\n src_rect.width = state->screen_width << 16;\n src_rect.height = state->screen_height << 16;\n \n dispman_display = vc_dispmanx_display_open( 0 \/* LCD *\/);\n dispman_update = vc_dispmanx_update_start( 0 );\n dispman_element = vc_dispmanx_element_add ( dispman_update, dispman_display,\n 0\/*layer*\/, &dst_rect, 0\/*src*\/,\n &src_rect, DISPMANX_PROTECTION_NONE, 0 \/*alpha*\/, 0\/*clamp*\/, 0\/*transform*\/);\n \n nativewindow.element = dispman_element;\n nativewindow.width = state->screen_width;\n nativewindow.height = state->screen_height;\n vc_dispmanx_update_submit_sync( dispman_update );\n \n \n state->surface = eglCreateWindowSurface( state->display, config, &nativewindow, NULL );\n assert(state->surface != EGL_NO_SURFACE);\n \n \n \/\/ connect the context to the surface\n result = eglMakeCurrent(state->display, state->surface, state->surface, state->context);\n assert(EGL_FALSE != result);\n \n \n \/\/ Set background color and clear buffers\n glClearColor(0.15f, 0.25f, 0.35f, 1.0f);\n glClear( GL_COLOR_BUFFER_BIT );\n \n \n}\n\nstatic bool loadFromPath(const std::string& path, std::string* into) {\n std::ifstream file;\n std::string buffer;\n \n file.open(path.c_str());\n if(!file.is_open()) return false;\n while(!file.eof()) {\n getline(file, buffer);\n (*into) += buffer + \"\\n\";\n }\n \n file.close();\n return true;\n}\n\nstatic void draw(CUBE_STATE_T *state, GLfloat cx, GLfloat cy){\n\n if(*fragHasChanged) {\n std::string fragSource;\n if(loadFromPath(fragFile, &fragSource)){\n state->shader.detach(GL_FRAGMENT_SHADER | GL_VERTEX_SHADER);\n state->shader.build(fragSource,vertSource);\n *fragHasChanged = false;\n std::cout << \"Parent: reloading shader\" << std::endl;\n }\n }\n\n \/\/ Now render to the main frame buffer\n glBindFramebuffer(GL_FRAMEBUFFER,0);\n \/\/ Clear the background (not really necessary I suppose)\n glClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n \n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n state->shader.use();\n \n state->shader.sendUniform(\"u_time\",((float)clock())\/CLOCKS_PER_SEC);\n state->shader.sendUniform(\"u_mouse\",cx, cy);\n state->shader.sendUniform(\"u_resolution\",state->screen_width, state->screen_height);\n \n glDrawArrays(GL_TRIANGLE_FAN, 0, 4);\n \n glBindBuffer(GL_ARRAY_BUFFER, 0);\n \n glFlush();\n glFinish();\n \n eglSwapBuffers(state->display, state->surface); \n}\n\nstatic int get_mouse(CUBE_STATE_T *state, int *outx, int *outy){\n static int fd = -1;\n const int width=state->screen_width, height=state->screen_height;\n static int x=800, y=400;\n const int XSIGN = 1<<4, YSIGN = 1<<5;\n if (fd<0) {\n fd = open(\"\/dev\/input\/mouse0\",O_RDONLY|O_NONBLOCK);\n }\n if (fd>=0) {\n struct {char buttons, dx, dy; } m;\n while (1) {\n int bytes = read(fd, &m, sizeof m);\n if (bytes < (int)sizeof m) goto _exit;\n if (m.buttons&8) {\n break; \/\/ This bit should always be set\n }\n read(fd, &m, 1); \/\/ Try to sync up again\n }\n if (m.buttons&3)\n return m.buttons&3;\n x+=m.dx;\n y+=m.dy;\n if (m.buttons&XSIGN)\n x-=256;\n if (m.buttons&YSIGN)\n y-=256;\n if (x<0) x=0;\n if (y<0) y=0;\n if (x>width) x=width;\n if (y>height) y=height;\n }\n_exit:\n if (outx) *outx = x;\n if (outy) *outy = y;\n return 0;\n} \n\nvoid drawThread() {\n while (1) {\n int x, y, b;\n b = get_mouse(state, &x, &y);\n if (b) break;\n draw(state, x, y);\n }\n} \n\nvoid watchThread(const std::string& file) {\n\n try {\n Inotify notify;\n\n InotifyWatch watch(file, IN_MODIFY);\n notify.Add(watch);\n for (;;) {\n std::cout << \"Child: Watching again\" << std::endl;\n notify.WaitForEvents();\n\n size_t count = notify.GetEventCount();\n while (count > 0) {\n InotifyEvent event;\n bool got_event = notify.GetEvent(&event);\n\n if (got_event) {\n std::string mask_str;\n event.DumpTypes(mask_str);\n\n std::string filename = event.GetName();\n std::cout << \"event mask: \\\"\" << mask_str << \"\\\", \";\n std::cout << \"filename: \\\"\" << filename << \"\\\"\" << std::endl;\n *fragHasChanged = true;\n }\n\n count--;\n }\n }\n } catch (InotifyException &e) {\n std::cerr << \"Inotify exception occured: \" << e.GetMessage() << std::endl;\n } catch (std::exception &e) {\n std::cerr << \"STL exception occured: \" << e.what() << std::endl;\n } catch (...) {\n std::cerr << \"unknown exception occured\" << std::endl;\n }\n}\n\nvoid init(const std::string& fragFile) {\n GLfloat cx, cy;\n bcm_host_init();\n\n \/\/ Clear application state\n memset( state, 0, sizeof( *state ) );\n \n \/\/ Start OGLES\n init_ogl(state);\n\n \/\/ Build shader;\n \/\/\n std::string fragSource;\n if(!loadFromPath(fragFile, &fragSource)) {\n return;\n }\n state->shader.build(fragSource,vertSource);\n\n \/\/ Make Quad\n \/\/\n static const GLfloat vertex_data[] = {\n -1.0,-1.0,1.0,1.0,\n 1.0,-1.0,1.0,1.0,\n 1.0,1.0,1.0,1.0,\n -1.0,1.0,1.0,1.0\n };\n GLint posAttribut = state->shader.getAttribLocation(\"a_position\");\n \n glClearColor ( 0.0, 1.0, 1.0, 1.0 );\n \n glGenBuffers(1, &state->buf);\n \n \n \/\/ Prepare viewport\n glViewport ( 0, 0, state->screen_width, state->screen_height );\n \n \n \/\/ Upload vertex data to a buffer\n glBindBuffer(GL_ARRAY_BUFFER, state->buf);\n glBufferData(GL_ARRAY_BUFFER, sizeof(vertex_data),\n vertex_data, GL_STATIC_DRAW);\n glVertexAttribPointer(posAttribut, 4, GL_FLOAT, 0, 16, 0);\n glEnableVertexAttribArray(posAttribut);\n \n}\n \n\/\/==============================================================================\n\nint main(int argc, char **argv){\n \n fragFile = std::string(argv[1]);\n\n int shmId = shmget(IPC_PRIVATE, sizeof(bool), 0666);\n\n pid_t pid = fork();\n\n fragHasChanged = (bool *) shmat(shmId, NULL, 0);\n\n switch(pid) {\n case -1: \/\/error\n break;\n\n case 0: \/\/ child\n {\n *fragHasChanged = false;\n watchThread(fragFile);\n std::cout << \"Watch thread shutdown\" << std::endl;\n }\n break;\n\n default: \/\/ parent\n {\n init(fragFile);\n drawThread();\n\n kill(pid, SIGKILL);\n }\n break;\n }\n\n shmctl(shmId, IPC_RMID, NULL);\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/atomicops.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\ntemplate <class AtomicType>\nstatic void TestAtomicIncrement() {\n \/\/ For now, we just test single threaded execution\n\n \/\/ use a guard value to make sure the NoBarrier_AtomicIncrement doesn't go\n \/\/ outside the expected address bounds. This is in particular to\n \/\/ test that some future change to the asm code doesn't cause the\n \/\/ 32-bit NoBarrier_AtomicIncrement doesn't do the wrong thing on 64-bit\n \/\/ machines.\n struct {\n AtomicType prev_word;\n AtomicType count;\n AtomicType next_word;\n } s;\n\n AtomicType prev_word_value, next_word_value;\n memset(&prev_word_value, 0xFF, sizeof(AtomicType));\n memset(&next_word_value, 0xEE, sizeof(AtomicType));\n\n s.prev_word = prev_word_value;\n s.count = 0;\n s.next_word = next_word_value;\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 1), 1);\n EXPECT_EQ(s.count, 1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 2), 3);\n EXPECT_EQ(s.count, 3);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 3), 6);\n EXPECT_EQ(s.count, 6);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -3), 3);\n EXPECT_EQ(s.count, 3);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -2), 1);\n EXPECT_EQ(s.count, 1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -1), 0);\n EXPECT_EQ(s.count, 0);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -1), -1);\n EXPECT_EQ(s.count, -1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -4), -5);\n EXPECT_EQ(s.count, -5);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 5), 0);\n EXPECT_EQ(s.count, 0);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n}\n\n\n#define NUM_BITS(T) (sizeof(T) * 8)\n\n\ntemplate <class AtomicType>\nstatic void TestCompareAndSwap() {\n AtomicType value = 0;\n AtomicType prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 1);\n EXPECT_EQ(1, value);\n EXPECT_EQ(0, prev);\n\n \/\/ Use test value that has non-zero bits in both halves, more for testing\n \/\/ 64-bit implementation on 32-bit platforms.\n const AtomicType k_test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 2)) + 11;\n value = k_test_val;\n prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 5);\n EXPECT_EQ(k_test_val, value);\n EXPECT_EQ(k_test_val, prev);\n\n value = k_test_val;\n prev = base::subtle::NoBarrier_CompareAndSwap(&value, k_test_val, 5);\n EXPECT_EQ(5, value);\n EXPECT_EQ(k_test_val, prev);\n}\n\n\ntemplate <class AtomicType>\nstatic void TestAtomicExchange() {\n AtomicType value = 0;\n AtomicType new_value = base::subtle::NoBarrier_AtomicExchange(&value, 1);\n EXPECT_EQ(1, value);\n EXPECT_EQ(0, new_value);\n\n \/\/ Use test value that has non-zero bits in both halves, more for testing\n \/\/ 64-bit implementation on 32-bit platforms.\n const AtomicType k_test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 2)) + 11;\n value = k_test_val;\n new_value = base::subtle::NoBarrier_AtomicExchange(&value, k_test_val);\n EXPECT_EQ(k_test_val, value);\n EXPECT_EQ(k_test_val, new_value);\n\n value = k_test_val;\n new_value = base::subtle::NoBarrier_AtomicExchange(&value, 5);\n EXPECT_EQ(5, value);\n EXPECT_EQ(k_test_val, new_value);\n}\n\n\ntemplate <class AtomicType>\nstatic void TestAtomicIncrementBounds() {\n \/\/ Test at rollover boundary between int_max and int_min\n AtomicType test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 1));\n AtomicType value = -1 ^ test_val;\n AtomicType new_value = base::subtle::NoBarrier_AtomicIncrement(&value, 1);\n EXPECT_EQ(test_val, value);\n EXPECT_EQ(value, new_value);\n\n base::subtle::NoBarrier_AtomicIncrement(&value, -1);\n EXPECT_EQ(-1 ^ test_val, value);\n\n \/\/ Test at 32-bit boundary for 64-bit atomic type.\n test_val = GG_ULONGLONG(1) << (NUM_BITS(AtomicType) \/ 2);\n value = test_val - 1;\n new_value = base::subtle::NoBarrier_AtomicIncrement(&value, 1);\n EXPECT_EQ(test_val, value);\n EXPECT_EQ(value, new_value);\n\n base::subtle::NoBarrier_AtomicIncrement(&value, -1);\n EXPECT_EQ(test_val - 1, value);\n}\n\n\/\/ This is a simple sanity check that values are correct. Not testing\n\/\/ atomicity\ntemplate <class AtomicType>\nstatic void TestStore() {\n const AtomicType kVal1 = static_cast<AtomicType>(0xa5a5a5a5a5a5a5a5LL);\n const AtomicType kVal2 = static_cast<AtomicType>(-1);\n\n AtomicType value;\n\n base::subtle::NoBarrier_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::NoBarrier_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n\n base::subtle::Acquire_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::Acquire_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n\n base::subtle::Release_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::Release_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n}\n\n\/\/ This is a simple sanity check that values are correct. Not testing\n\/\/ atomicity\ntemplate <class AtomicType>\nstatic void TestLoad() {\n const AtomicType kVal1 = static_cast<AtomicType>(0xa5a5a5a5a5a5a5a5LL);\n const AtomicType kVal2 = static_cast<AtomicType>(-1);\n\n AtomicType value;\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::NoBarrier_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::NoBarrier_Load(&value));\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::Acquire_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::Acquire_Load(&value));\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::Release_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::Release_Load(&value));\n}\n\nTEST(AtomicOpsTest, Inc) {\n TestAtomicIncrement<base::subtle::Atomic32>();\n TestAtomicIncrement<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, CompareAndSwap) {\n TestCompareAndSwap<base::subtle::Atomic32>();\n TestCompareAndSwap<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Exchange) {\n TestAtomicExchange<base::subtle::Atomic32>();\n TestAtomicExchange<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, IncrementBounds) {\n TestAtomicIncrementBounds<base::subtle::Atomic32>();\n TestAtomicIncrementBounds<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Store) {\n TestStore<base::subtle::Atomic32>();\n TestStore<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Load) {\n TestLoad<base::subtle::Atomic32>();\n TestLoad<base::subtle::AtomicWord>();\n}\n<commit_msg>Fix a test to avoid a MSVC warning as error about constant truncation.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/atomicops.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\ntemplate <class AtomicType>\nstatic void TestAtomicIncrement() {\n \/\/ For now, we just test single threaded execution\n\n \/\/ use a guard value to make sure the NoBarrier_AtomicIncrement doesn't go\n \/\/ outside the expected address bounds. This is in particular to\n \/\/ test that some future change to the asm code doesn't cause the\n \/\/ 32-bit NoBarrier_AtomicIncrement doesn't do the wrong thing on 64-bit\n \/\/ machines.\n struct {\n AtomicType prev_word;\n AtomicType count;\n AtomicType next_word;\n } s;\n\n AtomicType prev_word_value, next_word_value;\n memset(&prev_word_value, 0xFF, sizeof(AtomicType));\n memset(&next_word_value, 0xEE, sizeof(AtomicType));\n\n s.prev_word = prev_word_value;\n s.count = 0;\n s.next_word = next_word_value;\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 1), 1);\n EXPECT_EQ(s.count, 1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 2), 3);\n EXPECT_EQ(s.count, 3);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 3), 6);\n EXPECT_EQ(s.count, 6);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -3), 3);\n EXPECT_EQ(s.count, 3);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -2), 1);\n EXPECT_EQ(s.count, 1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -1), 0);\n EXPECT_EQ(s.count, 0);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -1), -1);\n EXPECT_EQ(s.count, -1);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, -4), -5);\n EXPECT_EQ(s.count, -5);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n\n EXPECT_EQ(base::subtle::NoBarrier_AtomicIncrement(&s.count, 5), 0);\n EXPECT_EQ(s.count, 0);\n EXPECT_EQ(s.prev_word, prev_word_value);\n EXPECT_EQ(s.next_word, next_word_value);\n}\n\n\n#define NUM_BITS(T) (sizeof(T) * 8)\n\n\ntemplate <class AtomicType>\nstatic void TestCompareAndSwap() {\n AtomicType value = 0;\n AtomicType prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 1);\n EXPECT_EQ(1, value);\n EXPECT_EQ(0, prev);\n\n \/\/ Use test value that has non-zero bits in both halves, more for testing\n \/\/ 64-bit implementation on 32-bit platforms.\n const AtomicType k_test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 2)) + 11;\n value = k_test_val;\n prev = base::subtle::NoBarrier_CompareAndSwap(&value, 0, 5);\n EXPECT_EQ(k_test_val, value);\n EXPECT_EQ(k_test_val, prev);\n\n value = k_test_val;\n prev = base::subtle::NoBarrier_CompareAndSwap(&value, k_test_val, 5);\n EXPECT_EQ(5, value);\n EXPECT_EQ(k_test_val, prev);\n}\n\n\ntemplate <class AtomicType>\nstatic void TestAtomicExchange() {\n AtomicType value = 0;\n AtomicType new_value = base::subtle::NoBarrier_AtomicExchange(&value, 1);\n EXPECT_EQ(1, value);\n EXPECT_EQ(0, new_value);\n\n \/\/ Use test value that has non-zero bits in both halves, more for testing\n \/\/ 64-bit implementation on 32-bit platforms.\n const AtomicType k_test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 2)) + 11;\n value = k_test_val;\n new_value = base::subtle::NoBarrier_AtomicExchange(&value, k_test_val);\n EXPECT_EQ(k_test_val, value);\n EXPECT_EQ(k_test_val, new_value);\n\n value = k_test_val;\n new_value = base::subtle::NoBarrier_AtomicExchange(&value, 5);\n EXPECT_EQ(5, value);\n EXPECT_EQ(k_test_val, new_value);\n}\n\n\ntemplate <class AtomicType>\nstatic void TestAtomicIncrementBounds() {\n \/\/ Test at rollover boundary between int_max and int_min\n AtomicType test_val = (GG_ULONGLONG(1) <<\n (NUM_BITS(AtomicType) - 1));\n AtomicType value = -1 ^ test_val;\n AtomicType new_value = base::subtle::NoBarrier_AtomicIncrement(&value, 1);\n EXPECT_EQ(test_val, value);\n EXPECT_EQ(value, new_value);\n\n base::subtle::NoBarrier_AtomicIncrement(&value, -1);\n EXPECT_EQ(-1 ^ test_val, value);\n\n \/\/ Test at 32-bit boundary for 64-bit atomic type.\n test_val = GG_ULONGLONG(1) << (NUM_BITS(AtomicType) \/ 2);\n value = test_val - 1;\n new_value = base::subtle::NoBarrier_AtomicIncrement(&value, 1);\n EXPECT_EQ(test_val, value);\n EXPECT_EQ(value, new_value);\n\n base::subtle::NoBarrier_AtomicIncrement(&value, -1);\n EXPECT_EQ(test_val - 1, value);\n}\n\n\/\/ Return an AtomicType with the value 0xa5a5a5..\ntemplate <class AtomicType>\nstatic AtomicType TestFillValue() {\n AtomicType val = 0;\n memset(&val, 0xa5, sizeof(AtomicType));\n return val;\n}\n\n\/\/ This is a simple sanity check that values are correct. Not testing\n\/\/ atomicity\ntemplate <class AtomicType>\nstatic void TestStore() {\n const AtomicType kVal1 = TestFillValue<AtomicType>();\n const AtomicType kVal2 = static_cast<AtomicType>(-1);\n\n AtomicType value;\n\n base::subtle::NoBarrier_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::NoBarrier_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n\n base::subtle::Acquire_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::Acquire_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n\n base::subtle::Release_Store(&value, kVal1);\n EXPECT_EQ(kVal1, value);\n base::subtle::Release_Store(&value, kVal2);\n EXPECT_EQ(kVal2, value);\n}\n\n\/\/ This is a simple sanity check that values are correct. Not testing\n\/\/ atomicity\ntemplate <class AtomicType>\nstatic void TestLoad() {\n const AtomicType kVal1 = TestFillValue<AtomicType>();\n const AtomicType kVal2 = static_cast<AtomicType>(-1);\n\n AtomicType value;\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::NoBarrier_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::NoBarrier_Load(&value));\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::Acquire_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::Acquire_Load(&value));\n\n value = kVal1;\n EXPECT_EQ(kVal1, base::subtle::Release_Load(&value));\n value = kVal2;\n EXPECT_EQ(kVal2, base::subtle::Release_Load(&value));\n}\n\nTEST(AtomicOpsTest, Inc) {\n TestAtomicIncrement<base::subtle::Atomic32>();\n TestAtomicIncrement<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, CompareAndSwap) {\n TestCompareAndSwap<base::subtle::Atomic32>();\n TestCompareAndSwap<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Exchange) {\n TestAtomicExchange<base::subtle::Atomic32>();\n TestAtomicExchange<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, IncrementBounds) {\n TestAtomicIncrementBounds<base::subtle::Atomic32>();\n TestAtomicIncrementBounds<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Store) {\n TestStore<base::subtle::Atomic32>();\n TestStore<base::subtle::AtomicWord>();\n}\n\nTEST(AtomicOpsTest, Load) {\n TestLoad<base::subtle::Atomic32>();\n TestLoad<base::subtle::AtomicWord>();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\n#include <string>\n#include <ncurses.h>\n\n#include \"feCharacter.h\"\n#include \"feClass.h\"\n#include \"feUtils.h\"\n\nstd::string get_file_contents(const char *);\n\nint main() {\n \/\/ initialize\n initscr();\n\tint row, col, dispr, dispc;\n\tstd::string logopath = \"dat\/logo_jp.txt\";\n\n\t\/\/ get row, column, and displacements\n\tgetmaxyx(stdscr,row,col);\n\tdispr = 20;\n\tdispc = 100;\n\trow = (row - dispr) \/ 2;\n\tcol = (col - dispc) \/ 2;\n\trow -= 8; \/\/ move it up 8 rows to make room for menu\n\n \/\/ get splash & print to center of screen\n\tstd::ifstream inf(logopath, std::ios::in | std::ios::binary);\n\tfor(std::string line; getline(inf, line); ) {\n\t\tmvprintw(row++, col, \"%s\", line.c_str());\n\t}\n\trefresh();\n\n\t\/\/ get char to keep window open, and exit\n getch();\n endwin();\n return 0;\n}\n\nstd::string get_file_contents(const char *filename) {\n std::ifstream in(filename, std::ios::in | std::ios::binary);\n if (in)\n {\n std::string contents;\n in.seekg(0, std::ios::end);\n contents.resize(in.tellg());\n in.seekg(0, std::ios::beg);\n in.read(&contents[0], contents.size());\n in.close();\n return(contents);\n }\n throw(errno);\n\t\/* std::ifstream ifs(filename); *\/\n\t\/* std::string content( (std::istreambuf_iterator<char>(ifs) ), *\/\n \/* (std::istreambuf_iterator<char>() ) ); *\/\n\t\/* return content; *\/\n}\n<commit_msg>add menu<commit_after>#include <cstdlib>\n#include <fstream>\n#include <string>\n#include <ncurses.h>\n#include <menu.h>\n\n#include \"feCharacter.h\"\n#include \"feClass.h\"\n#include \"feUtils.h\"\n\n\/\/ lazy af\n#define ARRAY_SIZE(array) (sizeof((array))\/sizeof((array[0])))\n\nstd::string get_file_contents(const char *);\n\nint main() {\n \/\/ initialize\n initscr();\n\tcbreak();\n\tnoecho();\n\tkeypad(stdscr, true);\n\n\tint row, col, dispr, dispc;\n\tstd::string logopath = \"dat\/logo_jp.txt\";\n\n\tconst char *menu[] = {\n\t\t\"Start\",\n\t\t\"Rosters\",\n\t\t\"Options\",\n\t\t\"Exit\"\n\t};\n\tITEM **items;\n\tITEM *cur_item;\n\tMENU *game_menu;\n\n\t\/\/ get row, column, and displacements\n\tgetmaxyx(stdscr,row,col);\n\tdispr = 20;\n\tdispc = 100;\n\trow = (row - dispr) \/ 2;\n\tcol = (col - dispc) \/ 2;\n\trow -= 8; \/\/ move it up 8 rows to make room for menu\n\n \/\/ get splash & print to center of screen\n\tstd::ifstream inf(logopath, std::ios::in | std::ios::binary);\n\tfor(std::string line; getline(inf, line); ) {\n\t\tmvprintw(row++, col, \"%s\", line.c_str());\n\t}\n\trefresh();\n\n\t\/\/ build menu (looks more c than c++ to me...)\n\tint c, n_choices;\n\tn_choices = ARRAY_SIZE(menu);\n\titems = (ITEM **) calloc(n_choices + 1, sizeof(ITEM *));\n\tfor(int i = 0; i < n_choices; ++i) items[i] = new_item(menu[i], menu[i]);\n\titems[n_choices] = (ITEM *) NULL;\n\tgame_menu = new_menu((ITEM **) items);\n\tpost_menu(game_menu);\n\n\t\/\/ exit handler\n\twhile((c = getch()) != 10){\n\t\tswitch(c) {\n\t\t\tcase KEY_DOWN:\n\t\t menu_driver(game_menu, REQ_DOWN_ITEM);\n\t\t\t\tbreak;\n\t\t\tcase KEY_UP:\n\t\t\t\tmenu_driver(game_menu, REQ_UP_ITEM);\n\t\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ free stuff up and exit\n\tfree_item(items[0]);\n\tfree_item(items[1]);\n\tfree_menu(game_menu);\n endwin();\n return 0;\n}\n\n\/**\n * store file contents into a string\n *\/\nstd::string get_file_contents(const char *filename) {\n std::ifstream in(filename, std::ios::in | std::ios::binary);\n if (in)\n {\n std::string contents;\n in.seekg(0, std::ios::end);\n contents.resize(in.tellg());\n in.seekg(0, std::ios::beg);\n in.read(&contents[0], contents.size());\n in.close();\n return(contents);\n }\n throw(errno);\n\t\/* std::ifstream ifs(filename); *\/\n\t\/* std::string content( (std::istreambuf_iterator<char>(ifs) ), *\/\n \/* (std::istreambuf_iterator<char>() ) ); *\/\n\t\/* return content; *\/\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * File: main.cpp\n * Author: vlad\n * \n * Created on December 12, 2013, 10:38 PM\n *\/\n\n#include <iostream>\n\n#include \"qpp.h\"\n#include \"internal.h\"\n\/\/#include \"matlab.h\" \/\/ support for MATLAB\n\n#include \"exception.h\"\n\n\/\/ TODO: expandout function\n\/\/ TODO: dyad function\n\/\/ TODO: proj (dya) function\n\/\/ TODO: ip (inner product function) function, make it general to return matrices\n\/\/ TODO: use .data() raw pointer instead of looping\n\/\/ TODO: optimize syspermute: ?Eigen::Map?\n\/\/ TODO: IMPORTANT Rewrite partial trace without syspermute\n\/\/ TODO: further parallelization\n\nusing namespace std;\n\nusing namespace qpp;\nusing namespace qpp::types;\n\n\/\/int main(int argc, char **argv)\nint main()\n{\n\tcout << \"Starting qpp...\" << endl;\n\t_init();\n\n\t\/\/ Display formatting\n\tcout << std::fixed; \/\/ use fixed format for nice formatting\n\/\/\tcout << std::scientific;\n\tcout << std::setprecision(4); \/\/ only for fixed or scientific modes\n\n\t\/\/ statistics tests\n\tcout << endl << \"Statistics tests.\" << endl;\n\tstd::vector<cplx> ampl = { 1. + ct::ii, 1. - ct::ii };\n\tcmat va(1, 4);\n\tva << 0.1, 1, 1. + ct::ii, 1. + 2. * ct::ii;\n\tstat::DiscreteDistributionFromComplex dc(va);\n\tcout << \"The probabilities are: [\";\n\tinternal::_disp_container(dc.probabilities());\n\tcout << \"]\" << endl;\n\n\t\/\/ other tests\n\tsize_t n = 12; \/\/ number of qubits\n\tsize_t N = std::pow(2, n);\n\tvector<size_t> dims; \/\/ local dimensions\n\tfor (size_t i = 0; i < n; i++)\n\t\tdims.push_back(2);\n\tcout << \"n = \" << n << \" qubits, matrix size \" << N << \" x \" << N << \".\"\n\t\t\t<< endl;\n\n\t\/\/ TIMING\n\tTimer t, total; \/\/ start the timer, automatic tic() in the constructor\n\n\t\/\/ Matrix initialization\n\tcout << endl << \"Matrix initialization timing.\" << endl;\n\tcmat randcmat = cmat::Random(N, N);\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ Lazy matrix product\n\tcout << endl << \"Lazy matrix product timing.\" << endl;\n\tauto b = randcmat * randcmat;\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ Matrix product\n\tcout << endl << \"Matrix product timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\tcmat prodmat;\n\tprodmat = randcmat * randcmat; \/\/ need this (otherwise lazy evaluation)\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptrace2 timing\n\tcout << endl << \"ptrace2 timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\t\/\/ trace away half of the qubits\n\tptrace2(randcmat, { (size_t) std::sqrt(N), (size_t) std::sqrt(N) });\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptrace SLOW SLOW SLOW (because of syspermute, do it without)\n\tcout << endl << \"ptrace timing.\" << endl;\n\tvector<size_t> subsys_ptrace = { 0 }; \/\/ trace away the first qubit\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(subsys_ptrace);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tptrace(randcmat, subsys_ptrace, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptranspose\n\tcout << endl << \"ptranspose timing.\" << endl;\n\tvector<size_t> subsys_ptranspose; \/\/ partially transpose all subsystems\n\tfor (size_t i = 0; i < n; i++)\n\t\tsubsys_ptranspose.push_back(i);\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(subsys_ptranspose);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tptranspose(randcmat, subsys_ptranspose, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ syspermute SLOW SLOW SLOW\n\tcout << endl << \"syspermute timing.\" << endl;\n\tvector<size_t> perm; \/\/ left-shift all subsystems by 1\n\tfor (size_t i = 0; i < n; i++)\n\t\tperm.push_back((i + 1) % n);\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(perm);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tsyspermute(randcmat, perm, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\ttotal.toc(); \/\/ read the total running time\n\tcout << endl << \"Total time: \" << total.seconds() << \" seconds.\" << endl;\n\t\/\/ END TIMING\n\n\tcout << \"Exiting qpp...\" << endl;\n}\n<commit_msg>commit<commit_after>\/*\n * File: main.cpp\n * Author: vlad\n * \n * Created on December 12, 2013, 10:38 PM\n *\/\n\n#include <iostream>\n\n#include \"qpp.h\"\n#include \"internal.h\"\n\/\/#include \"matlab.h\" \/\/ support for MATLAB\n\n#include \"exception.h\"\n\n\/\/ TODO: expandout function\n\/\/ TODO: dya\/dyad function\n\/\/ TODO: proj (dya) function\n\/\/ TODO: ip (inner product function) function, make it general to return matrices\n\/\/ TODO: use .data() raw pointer instead of looping\n\/\/ TODO: optimize syspermute: ?Eigen::Map?\n\/\/ TODO: IMPORTANT Rewrite partial trace without syspermute\n\/\/ TODO: further parallelization\n\nusing namespace std;\n\nusing namespace qpp;\nusing namespace qpp::types;\n\n\/\/int main(int argc, char **argv)\nint main()\n{\n\tcout << \"Starting qpp...\" << endl;\n\t_init();\n\n\t\/\/ Display formatting\n\tcout << std::fixed; \/\/ use fixed format for nice formatting\n\/\/\tcout << std::scientific;\n\tcout << std::setprecision(4); \/\/ only for fixed or scientific modes\n\n\t\/\/ statistics tests\n\tcout << endl << \"Statistics tests.\" << endl;\n\tstd::vector<cplx> ampl = { 1. + ct::ii, 1. - ct::ii };\n\tcmat va(1, 4);\n\tva << 0.1, 1, 1. + ct::ii, 1. + 2. * ct::ii;\n\tstat::DiscreteDistributionFromComplex dc(va);\n\tcout << \"The probabilities are: [\";\n\tinternal::_disp_container(dc.probabilities());\n\tcout << \"]\" << endl;\n\n\t\/\/ other tests\n\tsize_t n = 12; \/\/ number of qubits\n\tsize_t N = std::pow(2, n);\n\tvector<size_t> dims; \/\/ local dimensions\n\tfor (size_t i = 0; i < n; i++)\n\t\tdims.push_back(2);\n\tcout << \"n = \" << n << \" qubits, matrix size \" << N << \" x \" << N << \".\"\n\t\t\t<< endl;\n\n\t\/\/ TIMING\n\tTimer t, total; \/\/ start the timer, automatic tic() in the constructor\n\n\t\/\/ Matrix initialization\n\tcout << endl << \"Matrix initialization timing.\" << endl;\n\tcmat randcmat = cmat::Random(N, N);\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ Lazy matrix product\n\tcout << endl << \"Lazy matrix product timing.\" << endl;\n\tauto b = randcmat * randcmat;\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ Matrix product\n\tcout << endl << \"Matrix product timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\tcmat prodmat;\n\tprodmat = randcmat * randcmat; \/\/ need this (otherwise lazy evaluation)\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptrace2 timing\n\tcout << endl << \"ptrace2 timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\t\/\/ trace away half of the qubits\n\tptrace2(randcmat, { (size_t) std::sqrt(N), (size_t) std::sqrt(N) });\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptrace SLOW SLOW SLOW (because of syspermute, do it without)\n\tcout << endl << \"ptrace timing.\" << endl;\n\tvector<size_t> subsys_ptrace = { 0 }; \/\/ trace away the first qubit\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(subsys_ptrace);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tptrace(randcmat, subsys_ptrace, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ ptranspose\n\tcout << endl << \"ptranspose timing.\" << endl;\n\tvector<size_t> subsys_ptranspose; \/\/ partially transpose all subsystems\n\tfor (size_t i = 0; i < n; i++)\n\t\tsubsys_ptranspose.push_back(i);\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(subsys_ptranspose);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tptranspose(randcmat, subsys_ptranspose, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\t\/\/ syspermute SLOW SLOW SLOW\n\tcout << endl << \"syspermute timing.\" << endl;\n\tvector<size_t> perm; \/\/ left-shift all subsystems by 1\n\tfor (size_t i = 0; i < n; i++)\n\t\tperm.push_back((i + 1) % n);\n\tcout << \"Subsytem(s): [\";\n\tinternal::_disp_container(perm);\n\tcout << \"]\" << endl;\n\tt.tic();\n\tsyspermute(randcmat, perm, dims);\n\tt.toc();\n\tcout << \"Took \" << t << \" seconds.\" << endl;\n\n\ttotal.toc(); \/\/ read the total running time\n\tcout << endl << \"Total time: \" << total.seconds() << \" seconds.\" << endl;\n\t\/\/ END TIMING\n\n\tcout << \"Exiting qpp...\" << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"test_suite.h\"\n\n\nint main(int argc, char **argv) {\n bool run_benchmark_all = false;\n bool run_test = false;\n bool run_benchmark_bwtree = false;\n bool run_benchmark_bwtree_full = false;\n bool run_stress = false;\n bool run_epoch_test = false;\n bool run_infinite_insert_test = false;\n bool run_email_test = false;\n bool run_mixed_test = false;\n\n int opt_index = 1;\n while(opt_index < argc) {\n char *opt_p = argv[opt_index];\n\n if(strcmp(opt_p, \"--benchmark-all\") == 0) {\n run_benchmark_all = true;\n } else if(strcmp(opt_p, \"--test\") == 0) {\n run_test = true;\n } else if(strcmp(opt_p, \"--benchmark-bwtree\") == 0) {\n run_benchmark_bwtree = true;\n } else if(strcmp(opt_p, \"--benchmark-bwtree-full\") == 0) {\n run_benchmark_bwtree_full = true;\n } else if(strcmp(opt_p, \"--stress-test\") == 0) {\n run_stress = true;\n } else if(strcmp(opt_p, \"--epoch-test\") == 0) {\n run_epoch_test = true;\n } else if(strcmp(opt_p, \"--infinite-insert-test\") == 0) {\n run_infinite_insert_test = true;\n } else if(strcmp(opt_p, \"--email-test\") == 0) {\n run_email_test = true;\n } else if(strcmp(opt_p, \"--mixed-test\") == 0) {\n run_mixed_test = true;\n } else {\n printf(\"ERROR: Unknown option: %s\\n\", opt_p);\n\n return 0;\n }\n\n opt_index++;\n }\n\n bwt_printf(\"RUN_BENCHMARK_ALL = %d\\n\", run_benchmark_all);\n bwt_printf(\"RUN_BENCHMARK_BWTREE = %d\\n\", run_benchmark_bwtree);\n bwt_printf(\"RUN_BENCHMARK_BWTREE_FULL = %d\\n\", run_benchmark_bwtree_full);\n bwt_printf(\"RUN_TEST = %d\\n\", run_test);\n bwt_printf(\"RUN_STRESS = %d\\n\", run_stress);\n bwt_printf(\"RUN_EPOCH_TEST = %d\\n\", run_epoch_test);\n bwt_printf(\"RUN_INFINITE_INSERT_TEST = %d\\n\", run_infinite_insert_test);\n bwt_printf(\"RUN_EMAIL_TEST = %d\\n\", run_email_test);\n bwt_printf(\"RUN_MIXED_TEST = %d\\n\", run_mixed_test);\n bwt_printf(\"======================================\\n\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Next start running test cases\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n TreeType *t1 = nullptr;\n \n if(run_mixed_test == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n print_flag = false;\n\n printf(\"Starting mixed testing...\\n\");\n LaunchParallelTestID(mixed_thread_num, MixedTest1, t1);\n printf(\"Finished mixed testing\\n\");\n\n PrintStat(t1);\n\n MixedGetValueTest(t1);\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n \n if(run_email_test == true) {\n print_flag = true;\n auto t2 = new BwTree<std::string, long int>{};\n print_flag = false;\n \n TestBwTreeEmailInsertPerformance(t2, \"emails_dump.txt\");\n \n \/\/ t2 has already been deleted for memory reason\n }\n \n if(run_infinite_insert_test == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n print_flag = false;\n\n InfiniteRandomInsertTest(t1);\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n if(run_epoch_test == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n print_flag = false;\n\n TestEpochManager(t1);\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n if(run_benchmark_bwtree == true ||\n run_benchmark_bwtree_full == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n\n int key_num = 3 * 1024 * 1024;\n\n if(run_benchmark_bwtree_full == true) {\n key_num *= 10;\n }\n\n bwt_printf(\"Using key size = %d (%f million)\\n\",\n key_num,\n key_num \/ (1024.0 * 1024.0));\n\n print_flag = false;\n\n if(run_benchmark_bwtree_full == true) {\n \/\/ First we rely on this test to fill bwtree with 30 million keys\n TestBwTreeMultiThreadInsertPerformance(t1, key_num);\n\n \/\/ And then do a multithreaded read\n TestBwTreeMultiThreadReadPerformance(t1, key_num);\n } else {\n \/\/ This function will delete all keys at the end, so the tree\n \/\/ is empty after it returns\n TestBwTreeInsertReadDeletePerformance(t1, key_num);\n \n delete t1;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n \n \/\/ Tests random insert using one thread\n RandomInsertSpeedTest(t1, key_num);\n \n delete t1;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n \n \/\/ Test random insert seq read\n RandomInsertSeqReadSpeedTest(t1, key_num);\n \n delete t1;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n \n \/\/ Test seq insert random read\n SeqInsertRandomReadSpeedTest(t1, key_num);\n \n \/\/ Use stree_multimap as a reference\n RandomBtreeMultimapInsertSpeedTest(key_num);\n \n \/\/ Use cuckoohash_map\n RandomCuckooHashMapInsertSpeedTest(key_num);\n }\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n if(run_benchmark_all == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n\n int key_num = 1024 * 1024 * 3;\n bwt_printf(\"Using key size = %d (%f million)\\n\",\n key_num,\n key_num \/ (1024.0 * 1024.0));\n\n print_flag = false;\n\n TestStdMapInsertReadPerformance(key_num);\n TestStdUnorderedMapInsertReadPerformance(key_num);\n TestBTreeInsertReadPerformance(key_num);\n TestBTreeMultimapInsertReadPerformance(key_num);\n TestCuckooHashTableInsertReadPerformance(key_num);\n TestBwTreeInsertReadPerformance(t1, key_num);\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n if(run_test == true) {\n print_flag = true;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n print_flag = false;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test iterator\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n printf(\"Testing iterator...\\n\");\n\n IteratorTest(t1);\n PrintStat(t1);\n\n printf(\"Finised testing iterator\\n\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test random insert\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n printf(\"Testing random insert...\\n\");\n\n \/\/ Do not print here otherwise we could not see result\n delete t1;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n\n LaunchParallelTestID(8, RandomInsertTest, t1);\n RandomInsertVerify(t1);\n \n printf(\"Finished random insert testing. Delete the tree.\\n\");\n \n delete t1;\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test mixed insert\/delete\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n LaunchParallelTestID(basic_test_thread_num, MixedTest1, t1);\n printf(\"Finished mixed testing\\n\");\n\n PrintStat(t1);\n\n MixedGetValueTest(t1);\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest2, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest1, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest1, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest2, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest1, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest1, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest2, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest2, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n if(run_stress == true) {\n print_flag = true;\n \n \/\/ NOTE: For stress test we must start the GC thread in order\n \/\/ to let the tree run indefinitely\n t1 = new TreeType{true,\n KeyComparator{1},\n KeyEqualityChecker{1}};\n print_flag = false;\n\n LaunchParallelTestID(8, StressTest, t1);\n\n print_flag = true;\n delete t1;\n print_flag = false;\n }\n\n return 0;\n}\n\n<commit_msg>Use common routines to create and destroy trees<commit_after>\n#include \"test_suite.h\"\n\n\nint main(int argc, char **argv) {\n bool run_benchmark_all = false;\n bool run_test = false;\n bool run_benchmark_bwtree = false;\n bool run_benchmark_bwtree_full = false;\n bool run_stress = false;\n bool run_epoch_test = false;\n bool run_infinite_insert_test = false;\n bool run_email_test = false;\n bool run_mixed_test = false;\n\n int opt_index = 1;\n while(opt_index < argc) {\n char *opt_p = argv[opt_index];\n\n if(strcmp(opt_p, \"--benchmark-all\") == 0) {\n run_benchmark_all = true;\n } else if(strcmp(opt_p, \"--test\") == 0) {\n run_test = true;\n } else if(strcmp(opt_p, \"--benchmark-bwtree\") == 0) {\n run_benchmark_bwtree = true;\n } else if(strcmp(opt_p, \"--benchmark-bwtree-full\") == 0) {\n run_benchmark_bwtree_full = true;\n } else if(strcmp(opt_p, \"--stress-test\") == 0) {\n run_stress = true;\n } else if(strcmp(opt_p, \"--epoch-test\") == 0) {\n run_epoch_test = true;\n } else if(strcmp(opt_p, \"--infinite-insert-test\") == 0) {\n run_infinite_insert_test = true;\n } else if(strcmp(opt_p, \"--email-test\") == 0) {\n run_email_test = true;\n } else if(strcmp(opt_p, \"--mixed-test\") == 0) {\n run_mixed_test = true;\n } else {\n printf(\"ERROR: Unknown option: %s\\n\", opt_p);\n\n return 0;\n }\n\n opt_index++;\n }\n\n bwt_printf(\"RUN_BENCHMARK_ALL = %d\\n\", run_benchmark_all);\n bwt_printf(\"RUN_BENCHMARK_BWTREE = %d\\n\", run_benchmark_bwtree);\n bwt_printf(\"RUN_BENCHMARK_BWTREE_FULL = %d\\n\", run_benchmark_bwtree_full);\n bwt_printf(\"RUN_TEST = %d\\n\", run_test);\n bwt_printf(\"RUN_STRESS = %d\\n\", run_stress);\n bwt_printf(\"RUN_EPOCH_TEST = %d\\n\", run_epoch_test);\n bwt_printf(\"RUN_INFINITE_INSERT_TEST = %d\\n\", run_infinite_insert_test);\n bwt_printf(\"RUN_EMAIL_TEST = %d\\n\", run_email_test);\n bwt_printf(\"RUN_MIXED_TEST = %d\\n\", run_mixed_test);\n bwt_printf(\"======================================\\n\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Next start running test cases\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n TreeType *t1 = nullptr;\n \n if(run_mixed_test == true) {\n t1 = GetEmptyTree();\n\n printf(\"Starting mixed testing...\\n\");\n LaunchParallelTestID(mixed_thread_num, MixedTest1, t1);\n printf(\"Finished mixed testing\\n\");\n\n PrintStat(t1);\n\n MixedGetValueTest(t1);\n\n DestroyTree(t1);\n }\n \n if(run_email_test == true) {\n auto t2 = new BwTree<std::string, long int>{true};\n \n TestBwTreeEmailInsertPerformance(t2, \"emails_dump.txt\");\n \n \/\/ t2 has already been deleted for memory reason\n }\n\n if(run_epoch_test == true) {\n t1 = GetEmptyTree();\n\n TestEpochManager(t1);\n\n DestroyTree(t1);\n }\n\n if(run_benchmark_bwtree == true ||\n run_benchmark_bwtree_full == true) {\n t1 = GetEmptyTree();\n\n int key_num = 3 * 1024 * 1024;\n\n if(run_benchmark_bwtree_full == true) {\n key_num *= 10;\n }\n\n printf(\"Using key size = %d (%f million)\\n\",\n key_num,\n key_num \/ (1024.0 * 1024.0));\n\n if(run_benchmark_bwtree_full == true) {\n \/\/ First we rely on this test to fill bwtree with 30 million keys\n TestBwTreeMultiThreadInsertPerformance(t1, key_num);\n\n \/\/ And then do a multithreaded read\n TestBwTreeMultiThreadReadPerformance(t1, key_num);\n } else {\n \/\/ This function will delete all keys at the end, so the tree\n \/\/ is empty after it returns\n TestBwTreeInsertReadDeletePerformance(t1, key_num);\n \n DestroyTree(t1, true);\n t1 = GetEmptyTree(true);\n \n \/\/ Tests random insert using one thread\n RandomInsertSpeedTest(t1, key_num);\n \n DestroyTree(t1, true);\n t1 = GetEmptyTree(true);\n \n \/\/ Test random insert seq read\n RandomInsertSeqReadSpeedTest(t1, key_num);\n \n DestroyTree(t1, true);\n t1 = GetEmptyTree(true);\n \n \/\/ Test seq insert random read\n SeqInsertRandomReadSpeedTest(t1, key_num);\n \n \/\/ Use stree_multimap as a reference\n RandomBtreeMultimapInsertSpeedTest(key_num);\n \n \/\/ Use cuckoohash_map\n RandomCuckooHashMapInsertSpeedTest(key_num);\n }\n\n DestroyTree(t1);\n }\n\n if(run_benchmark_all == true) {\n t1 = GetEmptyTree();\n\n int key_num = 1024 * 1024 * 3;\n printf(\"Using key size = %d (%f million)\\n\",\n key_num,\n key_num \/ (1024.0 * 1024.0));\n\n TestStdMapInsertReadPerformance(key_num);\n TestStdUnorderedMapInsertReadPerformance(key_num);\n TestBTreeInsertReadPerformance(key_num);\n TestBTreeMultimapInsertReadPerformance(key_num);\n TestCuckooHashTableInsertReadPerformance(key_num);\n TestBwTreeInsertReadPerformance(t1, key_num);\n\n DestroyTree(t1);\n }\n\n if(run_test == true) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test iterator\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \/\/ This could print\n t1 = GetEmptyTree();\n\n printf(\"Testing iterator...\\n\");\n\n IteratorTest(t1);\n PrintStat(t1);\n\n printf(\"Finised testing iterator\\n\");\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test random insert\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n printf(\"Testing random insert...\\n\");\n\n \/\/ Do not print here otherwise we could not see result\n t1 = GetEmptyTree(true);\n\n LaunchParallelTestID(8, RandomInsertTest, t1);\n RandomInsertVerify(t1);\n \n printf(\"Finished random insert testing. Delete the tree.\\n\");\n \n \/\/ no print\n DestroyTree(t1, true);\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test mixed insert\/delete\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \n \/\/ no print\n t1 = GetEmptyTree(true);\n\n LaunchParallelTestID(basic_test_thread_num, MixedTest1, t1);\n printf(\"Finished mixed testing\\n\");\n\n PrintStat(t1);\n\n MixedGetValueTest(t1);\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Test Basic Insert\/Delete\/GetValue\n \/\/ with different patterns and multi thread\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest2, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest1, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest1, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest2, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest1, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest1, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, InsertTest2, t1);\n printf(\"Finished inserting all keys\\n\");\n\n PrintStat(t1);\n\n InsertGetValueTest(t1);\n printf(\"Finished verifying all inserted values\\n\");\n\n LaunchParallelTestID(basic_test_thread_num, DeleteTest2, t1);\n printf(\"Finished deleting all keys\\n\");\n\n PrintStat(t1);\n\n DeleteGetValueTest(t1);\n printf(\"Finished verifying all deleted values\\n\");\n\n DestroyTree(t1);\n }\n \n if(run_infinite_insert_test == true) {\n t1 = GetEmptyTree();\n\n InfiniteRandomInsertTest(t1);\n\n DestroyTree(t1);\n }\n\n if(run_stress == true) {\n t1 = GetEmptyTree();\n\n LaunchParallelTestID(8, StressTest, t1);\n\n DestroyTree(t1);\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <docopt.h>\n\n#include <cstddef>\n#include <iostream>\n\n#ifdef _MSC_VER\n#include <direct.h>\n#define getcwd _getcwd\n#else\n#include <unistd.h>\n#endif \/\/ _MSC_VER\n\n#include <cstdlib>\n#include <ctgmath>\n#include <dirent.h>\n\n#include <omp.h>\n\n#include \"SRTM.h\"\n#include \"Mesh.h\"\n#include \"Parsing.h\"\n#include \"Utilities.h\"\n\nstatic const char USAGE[] =\nR\"(\nCreate meshes from SRTM files.\n\nUsage:\n srtm2ply [options] <p1> <p2> [<INPUT_DIRECTORY> [<OUTPUT_DIRECTORY>]]\n\nOptions:\n -h --help Print this page.\n -v --version Display the application's version number.\n -o --origin=<origin> Define the origin of the generated tiles (in WGS84 coordinates).\n -s --tile-size=wxh Set the maximum size of tiles (in sampling points).\n -a --ascii-ply Generate ASCII-PLY meshes.\n -j <n> Generate N meshes in parallel. [default: #CPUs]\n --srtm3 The input directory contains SRTM data using a 90m resolution.\n\np1 and p2 denote two diagonally located corners of the bounding box of the desired mesh (using the WGS84\ncoordinate system), and have to be specified as WGS84 coordinates (as well as the desired origin).\n\nThe generated PLY-File will contain a mesh consisting only out of triangles. The data type for the vertex\nindices in the PLY-File will be chosen according to the maximum amount of possible points in the mesh.\nThus, the -s option should be chosen accordingly to generate indices of a certain size (i.e. a tile size\nof 256x256 sampling points will result in 16 bit indices).\n\nWGS84 coordinates have to be specified using the following format (using degrees as the unit of angle):\n<latitude>[N|S] [-]<longitude>[E|W] [<altitude>m], e.g. \"51.48125N 0.008069W\" for Greenwich.\n\nTile sizes should be specified as <width>x<height> in integer numbers, with 1 representing the distance between\ntwo sampling points in the SRTM dataset (i.e. an arc second for the newest data).\n)\";\n\nvoid printArguments(const std::map<std::string, docopt::value> &args)\n{\n std::cout << \"Arguments:\\n\\n\";\n for (auto &entry: args)\n {\n const std::string &name = entry.first;\n const docopt::value &value = entry.second;\n\n std::cout << name << \": \\n\";\n\n if (value.isString())\n std::cout << \" (string) \" << value.asString() << \"\\n\\n\";\n else if (value.isLong())\n std::cout << \" (long) \" << value.asLong() << \"\\n\\n\";\n else if (value.isBool())\n std::cout << \" (bool) \" << value.asBool() << \"\\n\\n\";\n else if (value.isStringList())\n {\n const auto &list = value.asStringList();\n std::cout << \" (str_list) [\\n\";\n\n for (auto &str: list)\n std::cout << \" \" << str << \",\\n\";\n std::cout << \" ]\\n\\n\";\n }\n else if (!value) std::cout << \" (empty)\\n\\n\";\n else std::cout << \" (unknown)\\n\\n\";\n\n }\n std::cout << std::endl;\n}\n\ntemplate<class T>\nMesh meshFromSrtmTile(const T &tile, const LCS &coordinateSystem)\n{\n Mesh mesh;\n\n auto &coordinates = tile.coordinates();\n mesh.vertexPositions.resize(tile.numValues());\n std::transform(coordinates.begin(), coordinates.end(), mesh.vertexPositions.begin(),\n [&](WGS84::Point coord) -> Eigen::Vector3f {\n return coordinateSystem.fromECEF(coord).cast<float>();\n });\n\n auto size = tile.size();\n mesh.faces.clear();\n mesh.faces.reserve(2*(size[0]-1)*(size[1]-1));\n for (int x = 0; x < size[0]-1; ++x)\n {\n for (int y = 0; y < size[1]-1; ++y)\n {\n auto idx1 = tile.indexAtPosition({x ,y });\n auto idx2 = tile.indexAtPosition({x+1,y });\n auto idx3 = tile.indexAtPosition({x ,y+1});\n auto idx4 = tile.indexAtPosition({x+1,y+1});\n\n mesh.faces.push_back({idx1,idx2,idx3});\n mesh.faces.push_back({idx2,idx4,idx3});\n }\n }\n\n return mesh;\n}\n\ntemplate<class T>\nvoid generateMeshes(std::map<std::string, docopt::value> &args)\n{\n typedef T Tile;\n typedef typename Tile::Size Size;\n typedef typename Tile::Bounds Bounds;\n typedef typename Tile::Cache Cache;\n\n const std::string cwd(getcwd(nullptr,0));\n\n std::string inputDir = args[\"<INPUT_DIRECTORY>\" ].isString() ? args[\"<INPUT_DIRECTORY>\" ].asString() : cwd;\n std::string outputDir = args[\"<OUTPUT_DIRECTORY>\"].isString() ? args[\"<OUTPUT_DIRECTORY>\"].asString() : cwd;\n\n inputDir = absolutePath(inputDir.c_str());\n outputDir = absolutePath(outputDir.c_str());\n\n WGS84::Point from, to, origin;\n from = parseWGS84(args[\"<p1>\"].asString());\n to = parseWGS84(args[\"<p2>\"].asString());\n\n if (args[\"<origin>\"].isString())\n origin = parseWGS84(args[\"<origin>\"].asString());\n else\n origin = WGS84::Point(Eigen::Vector3d((from+to)\/2.0));\n\n auto mapBoundaries = Tile::bounds(from,to);\n Eigen::Vector2i mapSize = mapBoundaries.diagonal() + Eigen::Vector2i(1,1);\n\n Eigen::Vector2i tileSize;\n if (args[\"--tile-size\"].isString())\n tileSize = parseSize(args[\"--tile-size\"].asString());\n else\n tileSize = mapSize;\n\n omp_set_nested(0);\n {\n int num_threads = parseNumberOfThreads(args[\"-j\"].asString());\n omp_set_num_threads(num_threads);\n }\n\n static const auto ceil = [](double a){ return std::ceil(a); };\n Eigen::Vector2i numTiles = Eigen::Vector2d( \/\/Element-wise division -> ceiling\n (mapSize.cast<double>().array()\/tileSize.cast<double>().array()\n ).unaryExpr(ceil)).cast<int>();\n\n std::cout << \"Input directory: \" << inputDir << \"\\n\";\n std::cout << \"Output directory: \" << outputDir << \"\\n\\n\";\n\n std::cout << \"From: \" << std::setw(5) << from[0] << \" \/ \" << std::setw(5) << from[1] << \" \/ \" << std::setw(5) << from[2] << \"\\n\";\n std::cout << \"To: \" << std::setw(5) << to[0] << \" \/ \" << std::setw(5) << to[1] << \" \/ \" << std::setw(5) << to[2] << \"\\n\";\n std::cout << \"Origin: \" << std::setw(5) << origin[0] << \" \/ \" << std::setw(5) << origin[1] << \" \/ \" << std::setw(5) << origin[2] << \"\\n\\n\";\n\n std::cout << \"Tile Size: \" << std::setw(5) << tileSize[0] << \" \/ \" << std::setw(5) << tileSize[1] << \"\\n\";\n std::cout << \"#Tiles: \" << std::setw(5) << numTiles[0] << \" \/ \" << std::setw(5) << numTiles[1] << \"\\n\\n\";\n\n Tensor<Bounds, 2> tileDefinitions(numTiles);\n for (int y = 0; y < numTiles[1]; ++y)\n {\n for (int x = 0; x < numTiles[0]; ++x)\n {\n Eigen::Vector2i position = (tileSize.array() -1) * Eigen::Array2i(x,y);\n Size size = tileSize.array().min(Eigen::Array2i(mapSize - position));\n tileDefinitions[{x,y}] = Tile::bounds(mapBoundaries.min()+position, size);\n }\n }\n\n LCS lcs(origin);\n Cache cache(inputDir);\n\n #pragma omp parallel for default(shared)\n for (int i = 0; i < tileDefinitions.numValues(); ++i)\n {\n try\n {\n std::stringstream ss;\n ss << outputDir << \"\/\" << i << \".ply\";\n\n auto filename = ss.str();\n \/\/ScopedTimer timer(filename);\n\n auto &bounds = tileDefinitions[i];\n auto tile = Tile::stitch(bounds,cache);\n auto mesh = meshFromSrtmTile(tile, lcs);\n\n std::ofstream file(filename);\n\n if (!args[\"--ascii-ply\"])\n mesh.toBinaryPly(file);\n else\n mesh.toAsciiPly(file);\n }\n catch(std::exception &e)\n { \/\/Exceptions break the omp loop and lead to a terminate(). Handle them here.\n std::cerr << \"An unexpected error occurred: \\n\"\n << e.what() << std::endl;\n exit(-1);\n }\n catch(...)\n {\n std::cerr << \"An unexpected error occurred (unknown type).\" << std::endl;\n exit(-1);\n }\n }\n\n}\n\n\nint main(int argc, const char** argv)\n{\n try\n {\n\n auto args = docopt::docopt(USAGE,\n { argv + 1, argv + argc },\n true, \/\/ show help if requested\n \"SRTM2PLY 0.1\" \/\/ version string\n );\n\n printArguments(args);\n\n if (args[\"--srtm3\"] && args[\"--srtm3\"].asBool())\n generateMeshes<SRTM3::Tile>(args);\n else\n generateMeshes<SRTM1::Tile>(args);\n\n } catch(std::exception &e)\n {\n std::cerr << \"An unexpected error occurred: \\n\"\n << e.what() << std::endl;\n exit(-1);\n }\n}\n<commit_msg>Commented out argument debugging code<commit_after>\n#include <docopt.h>\n\n#include <cstddef>\n#include <iostream>\n\n#ifdef _MSC_VER\n#include <direct.h>\n#define getcwd _getcwd\n#else\n#include <unistd.h>\n#endif \/\/ _MSC_VER\n\n#include <cstdlib>\n#include <ctgmath>\n#include <dirent.h>\n\n#include <omp.h>\n\n#include \"SRTM.h\"\n#include \"Mesh.h\"\n#include \"Parsing.h\"\n#include \"Utilities.h\"\n\nstatic const char USAGE[] =\nR\"(\nCreate meshes from SRTM files.\n\nUsage:\n srtm2ply [options] <p1> <p2> [<INPUT_DIRECTORY> [<OUTPUT_DIRECTORY>]]\n\nOptions:\n -h --help Print this page.\n -v --version Display the application's version number.\n -o --origin=<origin> Define the origin of the generated tiles (in WGS84 coordinates).\n -s --tile-size=wxh Set the maximum size of tiles (in sampling points).\n -a --ascii-ply Generate ASCII-PLY meshes.\n -j <n> Generate N meshes in parallel. [default: #CPUs]\n --srtm3 The input directory contains SRTM data using a 90m resolution.\n\np1 and p2 denote two diagonally located corners of the bounding box of the desired mesh (using the WGS84\ncoordinate system), and have to be specified as WGS84 coordinates (as well as the desired origin).\n\nThe generated PLY-File will contain a mesh consisting only out of triangles. The data type for the vertex\nindices in the PLY-File will be chosen according to the maximum amount of possible points in the mesh.\nThus, the -s option should be chosen accordingly to generate indices of a certain size (i.e. a tile size\nof 256x256 sampling points will result in 16 bit indices).\n\nWGS84 coordinates have to be specified using the following format (using degrees as the unit of angle):\n<latitude>[N|S] [-]<longitude>[E|W] [<altitude>m], e.g. \"51.48125N 0.008069W\" for Greenwich.\n\nTile sizes should be specified as <width>x<height> in integer numbers, with 1 representing the distance between\ntwo sampling points in the SRTM dataset (i.e. an arc second for the newest data).\n)\";\n\nvoid printArguments(const std::map<std::string, docopt::value> &args)\n{\n std::cout << \"Arguments:\\n\\n\";\n for (auto &entry: args)\n {\n const std::string &name = entry.first;\n const docopt::value &value = entry.second;\n\n std::cout << name << \": \\n\";\n\n if (value.isString())\n std::cout << \" (string) \" << value.asString() << \"\\n\\n\";\n else if (value.isLong())\n std::cout << \" (long) \" << value.asLong() << \"\\n\\n\";\n else if (value.isBool())\n std::cout << \" (bool) \" << value.asBool() << \"\\n\\n\";\n else if (value.isStringList())\n {\n const auto &list = value.asStringList();\n std::cout << \" (str_list) [\\n\";\n\n for (auto &str: list)\n std::cout << \" \" << str << \",\\n\";\n std::cout << \" ]\\n\\n\";\n }\n else if (!value) std::cout << \" (empty)\\n\\n\";\n else std::cout << \" (unknown)\\n\\n\";\n\n }\n std::cout << std::endl;\n}\n\ntemplate<class T>\nMesh meshFromSrtmTile(const T &tile, const LCS &coordinateSystem)\n{\n Mesh mesh;\n\n auto &coordinates = tile.coordinates();\n mesh.vertexPositions.resize(tile.numValues());\n std::transform(coordinates.begin(), coordinates.end(), mesh.vertexPositions.begin(),\n [&](WGS84::Point coord) -> Eigen::Vector3f {\n return coordinateSystem.fromECEF(coord).cast<float>();\n });\n\n auto size = tile.size();\n mesh.faces.clear();\n mesh.faces.reserve(2*(size[0]-1)*(size[1]-1));\n for (int x = 0; x < size[0]-1; ++x)\n {\n for (int y = 0; y < size[1]-1; ++y)\n {\n auto idx1 = tile.indexAtPosition({x ,y });\n auto idx2 = tile.indexAtPosition({x+1,y });\n auto idx3 = tile.indexAtPosition({x ,y+1});\n auto idx4 = tile.indexAtPosition({x+1,y+1});\n\n mesh.faces.push_back({idx1,idx2,idx3});\n mesh.faces.push_back({idx2,idx4,idx3});\n }\n }\n\n return mesh;\n}\n\ntemplate<class T>\nvoid generateMeshes(std::map<std::string, docopt::value> &args)\n{\n typedef T Tile;\n typedef typename Tile::Size Size;\n typedef typename Tile::Bounds Bounds;\n typedef typename Tile::Cache Cache;\n\n const std::string cwd(getcwd(nullptr,0));\n\n std::string inputDir = args[\"<INPUT_DIRECTORY>\" ].isString() ? args[\"<INPUT_DIRECTORY>\" ].asString() : cwd;\n std::string outputDir = args[\"<OUTPUT_DIRECTORY>\"].isString() ? args[\"<OUTPUT_DIRECTORY>\"].asString() : cwd;\n\n inputDir = absolutePath(inputDir.c_str());\n outputDir = absolutePath(outputDir.c_str());\n\n WGS84::Point from, to, origin;\n from = parseWGS84(args[\"<p1>\"].asString());\n to = parseWGS84(args[\"<p2>\"].asString());\n\n if (args[\"<origin>\"].isString())\n origin = parseWGS84(args[\"<origin>\"].asString());\n else\n origin = WGS84::Point(Eigen::Vector3d((from+to)\/2.0));\n\n auto mapBoundaries = Tile::bounds(from,to);\n Eigen::Vector2i mapSize = mapBoundaries.diagonal() + Eigen::Vector2i(1,1);\n\n Eigen::Vector2i tileSize;\n if (args[\"--tile-size\"].isString())\n tileSize = parseSize(args[\"--tile-size\"].asString());\n else\n tileSize = mapSize;\n\n omp_set_nested(0);\n {\n int num_threads = parseNumberOfThreads(args[\"-j\"].asString());\n omp_set_num_threads(num_threads);\n }\n\n static const auto ceil = [](double a){ return std::ceil(a); };\n Eigen::Vector2i numTiles = Eigen::Vector2d( \/\/Element-wise division -> ceiling\n (mapSize.cast<double>().array()\/tileSize.cast<double>().array()\n ).unaryExpr(ceil)).cast<int>();\n\n std::cout << \"Input directory: \" << inputDir << \"\\n\";\n std::cout << \"Output directory: \" << outputDir << \"\\n\\n\";\n\n std::cout << \"From: \" << std::setw(5) << from[0] << \" \/ \" << std::setw(5) << from[1] << \" \/ \" << std::setw(5) << from[2] << \"\\n\";\n std::cout << \"To: \" << std::setw(5) << to[0] << \" \/ \" << std::setw(5) << to[1] << \" \/ \" << std::setw(5) << to[2] << \"\\n\";\n std::cout << \"Origin: \" << std::setw(5) << origin[0] << \" \/ \" << std::setw(5) << origin[1] << \" \/ \" << std::setw(5) << origin[2] << \"\\n\\n\";\n\n std::cout << \"Tile Size: \" << std::setw(5) << tileSize[0] << \" \/ \" << std::setw(5) << tileSize[1] << \"\\n\";\n std::cout << \"#Tiles: \" << std::setw(5) << numTiles[0] << \" \/ \" << std::setw(5) << numTiles[1] << \"\\n\\n\";\n\n Tensor<Bounds, 2> tileDefinitions(numTiles);\n for (int y = 0; y < numTiles[1]; ++y)\n {\n for (int x = 0; x < numTiles[0]; ++x)\n {\n Eigen::Vector2i position = (tileSize.array() -1) * Eigen::Array2i(x,y);\n Size size = tileSize.array().min(Eigen::Array2i(mapSize - position));\n tileDefinitions[{x,y}] = Tile::bounds(mapBoundaries.min()+position, size);\n }\n }\n\n LCS lcs(origin);\n Cache cache(inputDir);\n\n #pragma omp parallel for default(shared)\n for (int i = 0; i < tileDefinitions.numValues(); ++i)\n {\n try\n {\n std::stringstream ss;\n ss << outputDir << \"\/\" << i << \".ply\";\n\n auto filename = ss.str();\n \/\/ScopedTimer timer(filename);\n\n auto &bounds = tileDefinitions[i];\n auto tile = Tile::stitch(bounds,cache);\n auto mesh = meshFromSrtmTile(tile, lcs);\n\n std::ofstream file(filename);\n\n if (!args[\"--ascii-ply\"])\n mesh.toBinaryPly(file);\n else\n mesh.toAsciiPly(file);\n }\n catch(std::exception &e)\n { \/\/Exceptions break the omp loop and lead to a terminate(). Handle them here.\n std::cerr << \"An unexpected error occurred: \\n\"\n << e.what() << std::endl;\n exit(-1);\n }\n catch(...)\n {\n std::cerr << \"An unexpected error occurred (unknown type).\" << std::endl;\n exit(-1);\n }\n }\n\n}\n\n\nint main(int argc, const char** argv)\n{\n try\n {\n\n auto args = docopt::docopt(USAGE,\n { argv + 1, argv + argc },\n true, \/\/ show help if requested\n \"SRTM2PLY 0.1\" \/\/ version string\n );\n\n \/\/printArguments(args);\n\n if (args[\"--srtm3\"] && args[\"--srtm3\"].asBool())\n generateMeshes<SRTM3::Tile>(args);\n else\n generateMeshes<SRTM1::Tile>(args);\n\n } catch(std::exception &e)\n {\n std::cerr << \"An unexpected error occurred: \\n\"\n << e.what() << std::endl;\n exit(-1);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"obd2.h\"\n#include \"can\/canutil.h\"\n#include \"util\/timer.h\"\n#include \"util\/log.h\"\n#include \"shared_handlers.h\"\n#include \"config.h\"\n#include <limits.h>\n\nnamespace time = openxc::util::time;\n\nusing openxc::diagnostics::DiagnosticsManager;\nusing openxc::diagnostics::obd2::Obd2Pid;\nusing openxc::util::log::debug;\nusing openxc::diagnostics::ActiveDiagnosticRequest;\nusing openxc::config::getConfiguration;\nusing openxc::config::PowerManagement;\n\n#define ENGINE_SPEED_PID 0xc\n#define VEHICLE_SPEED_PID 0xd\n\nstatic bool ENGINE_STARTED = false;\nstatic bool VEHICLE_IN_MOTION = false;\n\nstatic openxc::util::time::FrequencyClock IGNITION_STATUS_TIMER = {0.2};\n\nconst Obd2Pid OBD2_PIDS[] = {\n { pid: ENGINE_SPEED_PID, name: \"engine_speed\", frequency: 5 },\n { pid: VEHICLE_SPEED_PID, name: \"vehicle_speed\", frequency: 5 },\n { pid: 0x4, name: \"engine_load\", frequency: 5 },\n { pid: 0x33, name: \"barometric_pressure\", frequency: 1 },\n { pid: 0x4c, name: \"commanded_throttle_position\", frequency: 1 },\n { pid: 0x5, name: \"engine_coolant_temperature\", frequency: 1 },\n { pid: 0x27, name: \"fuel_level\", frequency: 1 },\n { pid: 0xf, name: \"intake_air_temperature\", frequency: 1 },\n { pid: 0xb, name: \"intake_manifold_pressure\", frequency: 1 },\n { pid: 0x1f, name: \"running_time\", frequency: 1 },\n { pid: 0x11, name: \"throttle_position\", frequency: 5 },\n { pid: 0xa, name: \"fuel_pressure\", frequency: 1 },\n { pid: 0x66, name: \"mass_airflow\", frequency: 5 },\n { pid: 0x5a, name: \"accelerator_pedal_position\", frequency: 5 },\n { pid: 0x52, name: \"ethanol_fuel_percentage\", frequency: 1 },\n { pid: 0x5c, name: \"engine_oil_temperature\", frequency: 1 },\n { pid: 0x63, name: \"engine_torque\", frequency: 1 },\n};\n\nstatic void checkIgnitionStatus(DiagnosticsManager* manager,\n const ActiveDiagnosticRequest* request,\n const DiagnosticResponse* response,\n float parsedPayload) {\n bool match = false;\n if(response->pid == ENGINE_SPEED_PID) {\n match = ENGINE_STARTED = parsedPayload != 0;\n } else if(response->pid == VEHICLE_SPEED_PID) {\n match = VEHICLE_IN_MOTION = parsedPayload != 0;\n }\n\n if(match) {\n time::tick(&IGNITION_STATUS_TIMER);\n }\n}\n\nstatic void requestIgnitionStatus(DiagnosticsManager* manager) {\n if(manager->obd2Bus != NULL && (getConfiguration()->powerManagement ==\n PowerManagement::OBD2_IGNITION_CHECK ||\n getConfiguration()->recurringObd2Requests)) {\n DiagnosticRequest request = {arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1, has_pid: true, pid: ENGINE_SPEED_PID};\n addRequest(manager, manager->obd2Bus, &request, \"engine_speed\",\n false, false, 1, 0, NULL, checkIgnitionStatus);\n\n request.pid = VEHICLE_SPEED_PID;\n addRequest(manager, manager->obd2Bus, &request, \"vehicle_speed\",\n false, false, 1, 0, NULL, checkIgnitionStatus);\n time::tick(&IGNITION_STATUS_TIMER);\n }\n}\n\nstatic void checkSupportedPids(DiagnosticsManager* manager,\n const ActiveDiagnosticRequest* request,\n const DiagnosticResponse* response,\n float parsedPayload) {\n if(manager->obd2Bus == NULL || !getConfiguration()->recurringObd2Requests) {\n return;\n }\n\n for(int i = 0; i < response->payload_length; i++) {\n for(int j = CHAR_BIT - 1; j >= 0; j--) {\n if(response->payload[i] >> j & 0x1) {\n uint16_t pid = response->pid + (i * CHAR_BIT) + j + 1;\n DiagnosticRequest request = {\n arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1, has_pid: true, pid: pid};\n for(size_t i = 0; i < sizeof(OBD2_PIDS) \/ sizeof(Obd2Pid); i++) {\n if(OBD2_PIDS[i].pid == pid) {\n debug(\"Vehicle supports PID %d\", pid);\n addRecurringRequest(manager, manager->obd2Bus, &request,\n OBD2_PIDS[i].name, false, false, 1, 0,\n openxc::signals::handlers::handleObd2Pid,\n checkIgnitionStatus,\n OBD2_PIDS[i].frequency);\n break;\n }\n }\n }\n }\n }\n}\n\nvoid openxc::diagnostics::obd2::initialize(DiagnosticsManager* manager) {\n requestIgnitionStatus(manager);\n}\n\n\/\/ * CAN traffic will eventualy stop, and we will suspend.\n\/\/ * When do we wake up?\n\/\/ * If normal CAN is open, bus activity will wake us up and we will resume.\n\/\/ * If normal CAN is blocked, we rely on a watchdog to wake us up every 15\n\/\/ seconds to start this process over again.\nvoid openxc::diagnostics::obd2::loop(DiagnosticsManager* manager, CanBus* bus) {\n static bool ignitionWasOn = false;\n static bool pidSupportQueried = false;\n static bool sentFinalIgnitionCheck = false;\n\n if(!manager->initialized) {\n return;\n }\n\n if(time::elapsed(&IGNITION_STATUS_TIMER, false)) {\n if(sentFinalIgnitionCheck) {\n \/\/ remove all open diagnostic requests, which shuld cause the bus to go\n \/\/ silent if the car is off, and thus the VI to suspend. TODO kick off\n \/\/ watchdog! TODO when it wakes keep in a minimum run level (i.e. don't\n \/\/ turn on bluetooth) until we decide the vehicle is actually on.\n if(manager->initialized && getConfiguration()->powerManagement ==\n PowerManagement::OBD2_IGNITION_CHECK) {\n debug(\"Ceasing diagnostic requests as ignition went off\");\n diagnostics::reset(manager);\n manager->initialized = false;\n }\n ignitionWasOn = false;\n pidSupportQueried = false;\n } else {\n \/\/ We haven't received an ignition in 5 seconds. Either the user didn't\n \/\/ have either OBD-II request configured as a recurring request (which\n \/\/ is fine) or they did, but the car stopped responding. Kick off\n \/\/ another request to see which is true. It will take 5+5 seconds after\n \/\/ ignition off to decide we should shut down.\n requestIgnitionStatus(manager);\n sentFinalIgnitionCheck = true;\n }\n } else if(!ignitionWasOn && (ENGINE_STARTED || VEHICLE_IN_MOTION)) {\n ignitionWasOn = true;\n sentFinalIgnitionCheck = false;\n if(getConfiguration()->recurringObd2Requests && !pidSupportQueried) {\n debug(\"Ignition is on - querying for supported OBD-II PIDs\");\n pidSupportQueried = true;\n DiagnosticRequest request = {\n arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1,\n has_pid: true,\n pid: 0x0};\n for(int i = 0x0; i <= 0x80; i += 0x20) {\n request.pid = i;\n addRequest(manager, bus, &request, NULL, false, false, 1, 0,\n NULL, checkSupportedPids);\n }\n }\n }\n}\n<commit_msg>When engine starts after a stop, reset number of chances to recover.<commit_after>#include \"obd2.h\"\n#include \"can\/canutil.h\"\n#include \"util\/timer.h\"\n#include \"util\/log.h\"\n#include \"shared_handlers.h\"\n#include \"config.h\"\n#include <limits.h>\n\nnamespace time = openxc::util::time;\n\nusing openxc::diagnostics::DiagnosticsManager;\nusing openxc::diagnostics::obd2::Obd2Pid;\nusing openxc::util::log::debug;\nusing openxc::diagnostics::ActiveDiagnosticRequest;\nusing openxc::config::getConfiguration;\nusing openxc::config::PowerManagement;\n\n#define ENGINE_SPEED_PID 0xc\n#define VEHICLE_SPEED_PID 0xd\n\nstatic bool ENGINE_STARTED = false;\nstatic bool VEHICLE_IN_MOTION = false;\n\nstatic openxc::util::time::FrequencyClock IGNITION_STATUS_TIMER = {0.2};\n\nconst Obd2Pid OBD2_PIDS[] = {\n { pid: ENGINE_SPEED_PID, name: \"engine_speed\", frequency: 5 },\n { pid: VEHICLE_SPEED_PID, name: \"vehicle_speed\", frequency: 5 },\n { pid: 0x4, name: \"engine_load\", frequency: 5 },\n { pid: 0x33, name: \"barometric_pressure\", frequency: 1 },\n { pid: 0x4c, name: \"commanded_throttle_position\", frequency: 1 },\n { pid: 0x5, name: \"engine_coolant_temperature\", frequency: 1 },\n { pid: 0x27, name: \"fuel_level\", frequency: 1 },\n { pid: 0xf, name: \"intake_air_temperature\", frequency: 1 },\n { pid: 0xb, name: \"intake_manifold_pressure\", frequency: 1 },\n { pid: 0x1f, name: \"running_time\", frequency: 1 },\n { pid: 0x11, name: \"throttle_position\", frequency: 5 },\n { pid: 0xa, name: \"fuel_pressure\", frequency: 1 },\n { pid: 0x66, name: \"mass_airflow\", frequency: 5 },\n { pid: 0x5a, name: \"accelerator_pedal_position\", frequency: 5 },\n { pid: 0x52, name: \"ethanol_fuel_percentage\", frequency: 1 },\n { pid: 0x5c, name: \"engine_oil_temperature\", frequency: 1 },\n { pid: 0x63, name: \"engine_torque\", frequency: 1 },\n};\n\nstatic void checkIgnitionStatus(DiagnosticsManager* manager,\n const ActiveDiagnosticRequest* request,\n const DiagnosticResponse* response,\n float parsedPayload) {\n bool match = false;\n if(response->pid == ENGINE_SPEED_PID) {\n match = ENGINE_STARTED = parsedPayload != 0;\n } else if(response->pid == VEHICLE_SPEED_PID) {\n match = VEHICLE_IN_MOTION = parsedPayload != 0;\n }\n\n if(match) {\n time::tick(&IGNITION_STATUS_TIMER);\n }\n}\n\nstatic void requestIgnitionStatus(DiagnosticsManager* manager) {\n if(manager->obd2Bus != NULL && (getConfiguration()->powerManagement ==\n PowerManagement::OBD2_IGNITION_CHECK ||\n getConfiguration()->recurringObd2Requests)) {\n debug(\"Sending requests to check ignition status\");\n DiagnosticRequest request = {arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1, has_pid: true, pid: ENGINE_SPEED_PID};\n addRequest(manager, manager->obd2Bus, &request, \"engine_speed\",\n false, false, 1, 0, NULL, checkIgnitionStatus);\n\n request.pid = VEHICLE_SPEED_PID;\n addRequest(manager, manager->obd2Bus, &request, \"vehicle_speed\",\n false, false, 1, 0, NULL, checkIgnitionStatus);\n time::tick(&IGNITION_STATUS_TIMER);\n }\n}\n\nstatic void checkSupportedPids(DiagnosticsManager* manager,\n const ActiveDiagnosticRequest* request,\n const DiagnosticResponse* response,\n float parsedPayload) {\n if(manager->obd2Bus == NULL || !getConfiguration()->recurringObd2Requests) {\n return;\n }\n\n for(int i = 0; i < response->payload_length; i++) {\n for(int j = CHAR_BIT - 1; j >= 0; j--) {\n if(response->payload[i] >> j & 0x1) {\n uint16_t pid = response->pid + (i * CHAR_BIT) + j + 1;\n DiagnosticRequest request = {\n arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1, has_pid: true, pid: pid};\n for(size_t i = 0; i < sizeof(OBD2_PIDS) \/ sizeof(Obd2Pid); i++) {\n if(OBD2_PIDS[i].pid == pid) {\n debug(\"Vehicle supports PID %d\", pid);\n addRecurringRequest(manager, manager->obd2Bus, &request,\n OBD2_PIDS[i].name, false, false, 1, 0,\n openxc::signals::handlers::handleObd2Pid,\n checkIgnitionStatus,\n OBD2_PIDS[i].frequency);\n break;\n }\n }\n }\n }\n }\n}\n\nvoid openxc::diagnostics::obd2::initialize(DiagnosticsManager* manager) {\n requestIgnitionStatus(manager);\n}\n\n\/\/ * CAN traffic will eventualy stop, and we will suspend.\n\/\/ * When do we wake up?\n\/\/ * If normal CAN is open, bus activity will wake us up and we will resume.\n\/\/ * If normal CAN is blocked, we rely on a watchdog to wake us up every 15\n\/\/ seconds to start this process over again.\nvoid openxc::diagnostics::obd2::loop(DiagnosticsManager* manager, CanBus* bus) {\n static bool ignitionWasOn = false;\n static bool pidSupportQueried = false;\n static bool sentFinalIgnitionCheck = false;\n\n if(!manager->initialized) {\n return;\n }\n\n if(time::elapsed(&IGNITION_STATUS_TIMER, false)) {\n if(sentFinalIgnitionCheck) {\n \/\/ remove all open diagnostic requests, which shuld cause the bus to go\n \/\/ silent if the car is off, and thus the VI to suspend. TODO kick off\n \/\/ watchdog! TODO when it wakes keep in a minimum run level (i.e. don't\n \/\/ turn on bluetooth) until we decide the vehicle is actually on.\n if(manager->initialized && getConfiguration()->powerManagement ==\n PowerManagement::OBD2_IGNITION_CHECK) {\n debug(\"Ceasing diagnostic requests as ignition went off\");\n diagnostics::reset(manager);\n manager->initialized = false;\n }\n ignitionWasOn = false;\n pidSupportQueried = false;\n } else {\n \/\/ We haven't received an ignition in 5 seconds. Either the user didn't\n \/\/ have either OBD-II request configured as a recurring request (which\n \/\/ is fine) or they did, but the car stopped responding. Kick off\n \/\/ another request to see which is true. It will take 5+5 seconds after\n \/\/ ignition off to decide we should shut down.\n requestIgnitionStatus(manager);\n sentFinalIgnitionCheck = true;\n }\n } else if(ENGINE_STARTED || VEHICLE_IN_MOTION) {\n ignitionWasOn = true;\n sentFinalIgnitionCheck = false;\n if(getConfiguration()->recurringObd2Requests && !pidSupportQueried) {\n debug(\"Ignition is on - querying for supported OBD-II PIDs\");\n pidSupportQueried = true;\n DiagnosticRequest request = {\n arbitration_id: OBD2_FUNCTIONAL_BROADCAST_ID,\n mode: 0x1,\n has_pid: true,\n pid: 0x0};\n for(int i = 0x0; i <= 0x80; i += 0x20) {\n request.pid = i;\n addRequest(manager, bus, &request, NULL, false, false, 1, 0,\n NULL, checkSupportedPids);\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/#include <windows.h>\r\n#include <iostream>\r\n\r\n#include \"global.h\"\r\n#include \"Map.h\"\r\n#include \"Character.h\"\r\n\r\nusing namespace std;\r\n\r\nvoid menu();\r\nvoid game();\r\nint text(void *);\r\nvoid options();\r\nvoid about();\r\nvoid gamePaused();\r\nvoid loadImages();\r\nvoid releaseImages();\r\n\r\nint callcontrol(void *);\r\nint callAction(void *);\r\nint callAction2(void *);\r\nint callAction3(void *);\r\n\r\nvoid SDL_startup();\r\nint menuoption=0;\r\nbool close= false;\r\nlist<int> pressing;\r\nint first = 128;\r\nint enabledsound=1;\r\n\r\n#if defined(_WIN32) || defined(_WIN64)\r\nint WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int) {\r\n#endif\r\n#ifdef __unix__\r\nint main (int argc, char *argv[]){\r\n#endif\r\n SDL_startup();\r\n loadImages();\r\n\r\n while(!close){\r\n while(SDL_PollEvent(&event)) {\r\n menu();\r\n if(!close){\r\n switch(menuoption){\r\n case 0:\r\n if(enabledsound)\r\n playSound(\"data\/jingle_bells.wav\", true, SDL_MIX_MAXVOLUME);\r\n game();\r\n break;\r\n case 1:\r\n options();\r\n break;\r\n case 2:\r\n about();\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n releaseImages();\r\n SDL_CloseAudio();\r\n TTF_Quit();\r\n SDL_Quit(); \/\/it finishes SDL initialisations\r\n return 0;\r\n}\r\n\r\nvoid menu(){\r\n menuoption=0;\r\n int sx,sy;\r\n sx=80;\r\n sy=115;\r\n color = {0, 0, 0};\r\n bool choose = false;\r\n while(!choose){\r\n if(!close){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(menuImage,0,0);\r\n drawText(\"Aperte B para selecionar\", screen, 80, 390,color);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_UP:\r\n if(menuoption>0)\r\n menuoption=(menuoption-1)%3;\r\n break;\r\n case SDLK_DOWN:\r\n menuoption=(menuoption+1)%3;\r\n break;\r\n case SDLK_b:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n choose=true;\r\n }\r\n\r\n int colorkey = SDL_MapRGB(screen->format, 255, 0, 255);\r\n switch(menuoption){\r\n case 0:\r\n sy=190;\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n break;\r\n case 1:\r\n sy=255;\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n break;\r\n case 2:\r\n sy=320;\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n break;\r\n }\r\n SDL_Flip(screen);\r\n }\r\n }\r\n}\r\n\r\nvoid game(){\r\n map.loadMap(\"src\/map.txt\");\r\n player = new Player(0, 0, 0, PLAYER_SPRITE_SIZE, PLAYER_SPRITE_SIZE);\r\n enemy = new Enemy(9, 0, 1, 0, 0, ENEMY_SPRITE_SIZE);\r\n enemy2 = new Enemy(7, 6, 2, 0, ENEMY_SPRITE_SIZE, ENEMY_SPRITE_SIZE);\r\n enemy3 = new Enemy(5, 10, 3, 0, ENEMY_SPRITE_SIZE*2, ENEMY_SPRITE_SIZE);\r\n\r\n while(!close) {\r\n while(SDL_PollEvent(&event)) {\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n if(event.key.keysym.sym == SDLK_ESCAPE) {\r\n gamePaused();\r\n }\r\n else {\r\n pressing.push_back(event.key.keysym.sym);\r\n }\r\n \/\/inserir na lista event.key.keysym.sym\r\n break;\r\n case SDL_KEYUP:\r\n pressing.remove(event.key.keysym.sym);\r\n \/\/remover da lista event.key.keysym.sym\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n }\r\n }\r\n player->handleControl(pressing);\r\n enemy->action();\r\n enemy2->action();\r\n enemy3->action();\r\n \/\/threadplayer = SDL_CreateThread(callcontrol, NULL);\r\n \/\/threadenemy1 = SDL_CreateThread(callAction, NULL);\r\n \/\/threadenemy2 = SDL_CreateThread(callAction2, NULL);\r\n \/\/threadenemy3 = SDL_CreateThread(callAction3, NULL);\r\n enemy->killPlayer();\r\n enemy2->killPlayer();\r\n enemy3->killPlayer();\r\n map.action();\r\n map.paint(player->life);\r\n map.moveAnimation();\r\n enemy->moveAnimation();\r\n enemy2->moveAnimation();\r\n enemy3->moveAnimation();\r\n player->moveAnimation();\r\n threadtext = SDL_CreateThread(text, NULL);\r\n SDL_Flip(screen);\r\n SDL_Delay(delay);\r\n }\r\n}\r\n\r\nint callcontrol(void * unused){\r\n player->handleControl(pressing);\r\n \/\/cout<<\"Player executou\"<<endl;\r\n}\r\n\r\nint callAction(void * unused){\r\n enemy->action();\r\n \/\/cout<<\"Enemy 1 executou\"<<endl;\r\n}\r\n\r\nint callAction2(void * unused){\r\n enemy2->action();\r\n \/\/cout<<\"Enemy 2 executou\"<<endl;\r\n}\r\n\r\nint callAction3(void * unused){\r\n enemy3->action();\r\n \/\/cout<<\"Enemy 3 executou\"<<endl;\r\n}\r\n\r\n\r\nint text(void * unused){\r\n color ={255,255,255};\r\n if(first){\r\n if(first>96)\r\n drawText(\"Direcionais movimentam o Bomberman...\", screen, 120, 20,color);\r\n else if(first>64)\r\n drawText(\"aperte B para soltar Bomba...\", screen, 120, 20,color);\r\n else if(first>32)\r\n drawText(\"ESC pausa o jogo.\",screen, 120, 20,color);\r\n else\r\n drawText(\"Encontre a Chave!\",screen, 200, 20,color);\r\n first--;\r\n }\r\n if(player->state==WIN){\r\n drawText(\"YOU WIN!\", screen, 350, 15,color);\r\n }\r\n else if(player->state==LOSE){\r\n drawText(\"YOU LOSE!\", screen, 350, 15,color);\r\n }\r\n else if(player->imuneTime && player->state!=DEAD){\r\n drawText(\"Imune por\", screen, 350, 15,color);\r\n char * imuneTimestr = new char [32];\r\n drawText(to_string(player->imuneTime), screen, 430, 15,color);\r\n }\r\n}\r\n\r\nvoid options(){\r\n int sx,sy;\r\n sx=180;\r\n sy=190;\r\n color = {255, 255, 255};\r\n int colorkey = SDL_MapRGB(screen->format, 255, 0, 255);\r\n bool choose = false;\r\n SDL_Surface *optionsImage = IMG_Load(\"data\/options.png\");\r\n while(!choose){\r\n if(!close){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(optionsImage,0,0);\r\n drawText(\"Aperte B para selecionar\", screen, 180, 390,color);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_UP:\r\n enabledsound = 1;\r\n sy=190;\r\n break;\r\n case SDLK_DOWN:\r\n enabledsound = 0;\r\n sy=255;\r\n break;\r\n case SDLK_b:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n choose=true;\r\n }\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n SDL_Flip(screen);\r\n }\r\n }\r\n SDL_FreeSurface(optionsImage);\r\n}\r\n\r\nvoid about(){\r\n bool done=false;\r\n color = {255, 255, 255};\r\n SDL_Surface *aboutImage = IMG_Load(\"data\/about.png\");\r\n while(!done){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(aboutImage,0,0);\r\n drawText(\"Aperte B para voltar ao menu\", screen, 180, 390,color);\r\n SDL_Flip(screen);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_b:\r\n done=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n done=true;\r\n close=true;\r\n }\r\n }\r\n }\r\n SDL_FreeSurface(aboutImage);\r\n}\r\n\r\nvoid gamePaused(){\r\n color={255,255,255};\r\n bool choose=false;\r\n drawText(\"GAME PAUSED\", screen, 200, 10,color);\r\n while(!choose){\r\n if(!close){\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_ESCAPE:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n choose=true;\r\n close=true;\r\n }\r\n }\r\n SDL_Flip(screen);\r\n }\r\n }\r\n\r\n}\r\n\r\nvoid SDL_startup()\r\n{\r\n if( SDL_Init(SDL_INIT_VIDEO) != 0) {\r\n printf(\"Unable to initialise SDL: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n\r\n \/\/it's used to guarantee that the SDL_Quit function is called when the application exits;\r\n atexit(SDL_Quit);\r\n\r\n screen = SDL_SetVideoMode(515, 442, 16, SDL_SWSURFACE); \/\/width, height, bitdepth\r\n\r\n if(screen==NULL){\r\n printf(\"Unable to set video mode: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n SDL_WM_SetCaption(\"Bomberman\", \"Bomberman\"); \/\/topTitle, iconTitle\r\n SDL_Surface* icon = IMG_Load(\"data\/icon.png\");\r\n SDL_WM_SetIcon(icon, NULL);\r\n if(TTF_Init() == -1) {\r\n printf(\"Unable to set font : %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n font = TTF_OpenFont(\"data\/manaspc.ttf\", 12);\r\n \/* ajusta para áudio em 16-bit stereo com 22Khz *\/\r\n \/\/audioFmt.freq = 22050;\r\n audioFmt.freq = SOUND_FREQUENCY;\r\n audioFmt.format = AUDIO_S16;\r\n audioFmt.channels = 1;\/\/2\r\n audioFmt.samples = 1024;\/\/512; \/* um bom valor para jogos *\/\r\n audioFmt.callback = mixaudio;\r\n audioFmt.userdata = NULL;\r\n if ( SDL_OpenAudio(&audioFmt, NULL) < 0 ) {\r\n fprintf(stderr, \"Unable to open the audio: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n SDL_PauseAudio(0);\r\n\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\/\/parado\r\n}\r\n\r\n\r\nvoid loadImages()\r\n{\r\n SDL_Surface * temp;\r\n\r\n menuImage =IMG_Load(\"data\/bgmenu.png\");\r\n mapImage = IMG_Load(\"data\/bg.png\");\r\n\r\n temp = SDL_LoadBMP(\"data\/enemies_sprite.bmp\");\r\n enemy_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/item_sprite.bmp\");\r\n item_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/player_sprite.bmp\");\r\n player_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/fire_sprite.bmp\");\r\n fire_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n}\r\n\r\nvoid releaseImages()\r\n{\r\n SDL_FreeSurface(enemy_sprite);\r\n SDL_FreeSurface(item_sprite);\r\n SDL_FreeSurface(player_sprite);\r\n SDL_FreeSurface(fire_sprite);\r\n\r\n SDL_FreeSurface(menuImage);\r\n SDL_FreeSurface(mapImage);\r\n\r\n}\r\n<commit_msg>Minor changes<commit_after>\/\/#include <windows.h>\r\n#include <iostream>\r\n\r\n#include \"global.h\"\r\n#include \"Map.h\"\r\n#include \"Character.h\"\r\n\r\nusing namespace std;\r\n\r\nvoid menu();\r\nvoid game();\r\nint text(void *);\r\nvoid options();\r\nvoid about();\r\nvoid gamePaused();\r\nvoid loadImages();\r\nvoid releaseImages();\r\n\r\nint callcontrol(void *);\r\nint callAction(void *);\r\nint callAction2(void *);\r\nint callAction3(void *);\r\n\r\nvoid SDL_startup();\r\nint menuoption=0;\r\nbool close= false;\r\nlist<int> pressing;\r\nint first = 128;\r\nint enabledsound=1;\r\n\r\n#if defined(_WIN32) || defined(_WIN64)\r\nint WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int) {\r\n#endif\r\n#ifdef __unix__\r\nint main (int argc, char *argv[]){\r\n#endif\r\n SDL_startup();\r\n loadImages();\r\n\r\n while(!close){\r\n while(SDL_PollEvent(&event)) {\r\n menu();\r\n if(!close){\r\n switch(menuoption){\r\n case 0:\r\n if(enabledsound)\r\n playSound(\"data\/jingle_bells.wav\", true, SDL_MIX_MAXVOLUME);\r\n game();\r\n break;\r\n case 1:\r\n options();\r\n break;\r\n case 2:\r\n about();\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n releaseImages();\r\n SDL_CloseAudio();\r\n TTF_Quit();\r\n SDL_Quit(); \/\/it finishes SDL initialisations\r\n return 0;\r\n}\r\n\r\nvoid menu(){\r\n menuoption=0;\r\n int sx,sy;\r\n sx=80;\r\n sy=115;\r\n color = {0, 0, 0};\r\n bool choose = false;\r\n while(!choose){\r\n if(!close){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(menuImage,0,0);\r\n drawText(\"Aperte B para selecionar\", screen, 80, 390,color);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_UP:\r\n if(menuoption>0)\r\n menuoption=(menuoption-1)%3;\r\n break;\r\n case SDLK_DOWN:\r\n menuoption=(menuoption+1)%3;\r\n break;\r\n case SDLK_b:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n choose=true;\r\n }\r\n\r\n int colorkey = SDL_MapRGB(screen->format, 255, 0, 255);\r\n switch(menuoption){\r\n case 0:\r\n sy=190;\r\n break;\r\n case 1:\r\n sy=255;\r\n break;\r\n case 2:\r\n sy=320;\r\n break;\r\n }\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n SDL_Flip(screen);\r\n }\r\n }\r\n}\r\n\r\nvoid game(){\r\n map.loadMap(\"src\/map.txt\");\r\n player = new Player(0, 0, 0, PLAYER_SPRITE_SIZE, PLAYER_SPRITE_SIZE);\r\n enemy = new Enemy(9, 0, 1, 0, 0, ENEMY_SPRITE_SIZE);\r\n enemy2 = new Enemy(7, 6, 2, 0, ENEMY_SPRITE_SIZE, ENEMY_SPRITE_SIZE);\r\n enemy3 = new Enemy(5, 10, 3, 0, ENEMY_SPRITE_SIZE*2, ENEMY_SPRITE_SIZE);\r\n\r\n while(!close) {\r\n while(SDL_PollEvent(&event)) {\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n if(event.key.keysym.sym == SDLK_ESCAPE) {\r\n gamePaused();\r\n }\r\n else {\r\n pressing.push_back(event.key.keysym.sym);\r\n }\r\n \/\/inserir na lista event.key.keysym.sym\r\n break;\r\n case SDL_KEYUP:\r\n pressing.remove(event.key.keysym.sym);\r\n \/\/remover da lista event.key.keysym.sym\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n }\r\n }\r\n player->handleControl(pressing);\r\n enemy->action();\r\n enemy2->action();\r\n enemy3->action();\r\n \/\/threadplayer = SDL_CreateThread(callcontrol, NULL);\r\n \/\/threadenemy1 = SDL_CreateThread(callAction, NULL);\r\n \/\/threadenemy2 = SDL_CreateThread(callAction2, NULL);\r\n \/\/threadenemy3 = SDL_CreateThread(callAction3, NULL);\r\n enemy->killPlayer();\r\n enemy2->killPlayer();\r\n enemy3->killPlayer();\r\n map.action();\r\n map.paint(player->life);\r\n map.moveAnimation();\r\n enemy->moveAnimation();\r\n enemy2->moveAnimation();\r\n enemy3->moveAnimation();\r\n player->moveAnimation();\r\n threadtext = SDL_CreateThread(text, NULL);\r\n SDL_Flip(screen);\r\n SDL_Delay(delay);\r\n }\r\n}\r\n\r\nint callcontrol(void * unused){\r\n player->handleControl(pressing);\r\n \/\/cout<<\"Player executou\"<<endl;\r\n}\r\n\r\nint callAction(void * unused){\r\n enemy->action();\r\n \/\/cout<<\"Enemy 1 executou\"<<endl;\r\n}\r\n\r\nint callAction2(void * unused){\r\n enemy2->action();\r\n \/\/cout<<\"Enemy 2 executou\"<<endl;\r\n}\r\n\r\nint callAction3(void * unused){\r\n enemy3->action();\r\n \/\/cout<<\"Enemy 3 executou\"<<endl;\r\n}\r\n\r\n\r\nint text(void * unused){\r\n color ={255,255,255};\r\n if(first){\r\n if(first>96)\r\n drawText(\"Direcionais movimentam o Bomberman...\", screen, 120, 20,color);\r\n else if(first>64)\r\n drawText(\"aperte B para soltar Bomba...\", screen, 120, 20,color);\r\n else if(first>32)\r\n drawText(\"ESC pausa o jogo.\",screen, 120, 20,color);\r\n else\r\n drawText(\"Encontre a Chave!\",screen, 200, 20,color);\r\n first--;\r\n }\r\n if(player->state==WIN){\r\n drawText(\"YOU WIN!\", screen, 350, 15,color);\r\n }\r\n else if(player->state==LOSE){\r\n drawText(\"YOU LOSE!\", screen, 350, 15,color);\r\n }\r\n else if(player->imuneTime && player->state!=DEAD){\r\n drawText(\"Imune por\", screen, 350, 15,color);\r\n char * imuneTimestr = new char [32];\r\n drawText(to_string(player->imuneTime), screen, 430, 15,color);\r\n }\r\n}\r\n\r\nvoid options(){\r\n int sx,sy;\r\n sx=180;\r\n sy=190;\r\n color = {255, 255, 255};\r\n int colorkey = SDL_MapRGB(screen->format, 255, 0, 255);\r\n bool choose = false;\r\n SDL_Surface *optionsImage = IMG_Load(\"data\/options.png\");\r\n while(!choose){\r\n if(!close){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(optionsImage,0,0);\r\n drawText(\"Aperte B para selecionar\", screen, 180, 390,color);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_UP:\r\n enabledsound = 1;\r\n sy=190;\r\n break;\r\n case SDLK_DOWN:\r\n enabledsound = 0;\r\n sy=255;\r\n break;\r\n case SDLK_b:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n }\r\n if (event.type == SDL_QUIT) {\r\n close=true;\r\n choose=true;\r\n }\r\n displaySpriteImage(item_sprite, sx,sy, GRID_SIZE, 3*GRID_SIZE, GRID_SIZE, colorkey);\r\n SDL_Flip(screen);\r\n }\r\n }\r\n SDL_FreeSurface(optionsImage);\r\n}\r\n\r\nvoid about(){\r\n bool done=false;\r\n color = {255, 255, 255};\r\n SDL_Surface *aboutImage = IMG_Load(\"data\/about.png\");\r\n while(!done){\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\r\n displayImage(aboutImage,0,0);\r\n drawText(\"Aperte B para voltar ao menu\", screen, 180, 390,color);\r\n SDL_Flip(screen);\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_b:\r\n done=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n done=true;\r\n close=true;\r\n }\r\n }\r\n }\r\n SDL_FreeSurface(aboutImage);\r\n}\r\n\r\nvoid gamePaused(){\r\n color={255,255,255};\r\n bool choose=false;\r\n drawText(\"GAME PAUSED\", screen, 200, 10,color);\r\n while(!choose){\r\n if(!close){\r\n while(SDL_PollEvent(&event)){\r\n switch(event.type){\r\n case SDL_KEYDOWN:\r\n switch(event.key.keysym.sym){\r\n case SDLK_ESCAPE:\r\n choose=true;\r\n break;\r\n default:\r\n break;\r\n }\r\n break;\r\n }\r\n if (event.type == SDL_QUIT) {\r\n choose=true;\r\n close=true;\r\n }\r\n }\r\n SDL_Flip(screen);\r\n }\r\n }\r\n\r\n}\r\n\r\nvoid SDL_startup()\r\n{\r\n if( SDL_Init(SDL_INIT_VIDEO) != 0) {\r\n printf(\"Unable to initialise SDL: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n\r\n \/\/it's used to guarantee that the SDL_Quit function is called when the application exits;\r\n atexit(SDL_Quit);\r\n\r\n screen = SDL_SetVideoMode(515, 442, 16, SDL_SWSURFACE); \/\/width, height, bitdepth\r\n\r\n if(screen==NULL){\r\n printf(\"Unable to set video mode: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n SDL_WM_SetCaption(\"Bomberman\", \"Bomberman\"); \/\/topTitle, iconTitle\r\n SDL_Surface* icon = IMG_Load(\"data\/icon.png\");\r\n SDL_WM_SetIcon(icon, NULL);\r\n if(TTF_Init() == -1) {\r\n printf(\"Unable to set font : %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n font = TTF_OpenFont(\"data\/manaspc.ttf\", 12);\r\n \/* ajusta para áudio em 16-bit stereo com 22Khz *\/\r\n \/\/audioFmt.freq = 22050;\r\n audioFmt.freq = SOUND_FREQUENCY;\r\n audioFmt.format = AUDIO_S16;\r\n audioFmt.channels = 1;\/\/2\r\n audioFmt.samples = 1024;\/\/512; \/* um bom valor para jogos *\/\r\n audioFmt.callback = mixaudio;\r\n audioFmt.userdata = NULL;\r\n if ( SDL_OpenAudio(&audioFmt, NULL) < 0 ) {\r\n fprintf(stderr, \"Unable to open the audio: %s\\n\", SDL_GetError());\r\n exit(1);\r\n }\r\n SDL_PauseAudio(0);\r\n\r\n SDL_FillRect( SDL_GetVideoSurface(), NULL, 0 );\/\/parado\r\n}\r\n\r\n\r\nvoid loadImages()\r\n{\r\n SDL_Surface * temp;\r\n\r\n menuImage =IMG_Load(\"data\/bgmenu.png\");\r\n mapImage = IMG_Load(\"data\/bg.png\");\r\n\r\n temp = SDL_LoadBMP(\"data\/enemies_sprite.bmp\");\r\n enemy_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/item_sprite.bmp\");\r\n item_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/player_sprite.bmp\");\r\n player_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n\r\n temp = SDL_LoadBMP(\"data\/fire_sprite.bmp\");\r\n fire_sprite = SDL_DisplayFormat(temp);\r\n SDL_FreeSurface(temp);\r\n}\r\n\r\nvoid releaseImages()\r\n{\r\n SDL_FreeSurface(enemy_sprite);\r\n SDL_FreeSurface(item_sprite);\r\n SDL_FreeSurface(player_sprite);\r\n SDL_FreeSurface(fire_sprite);\r\n\r\n SDL_FreeSurface(menuImage);\r\n SDL_FreeSurface(mapImage);\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ thermaleraser\n\/\/\n\/\/ Created by Mark Larus on 9\/8\/12.\n\/\/ Copyright (c) 2012 Kenyon College. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <algorithm>\n#include <math.h>\n#include <gsl\/gsl_randist.h>\n#include <gsl\/gsl_sf.h>\n#include <boost\/program_options.hpp>\n#include <boost\/timer\/timer.hpp>\n\n\/*! Fix a namespace issue with boost library.\n This lets us use both cpu_timer and progress\n*\/\n#define timer timer_class\n#include <boost\/progress.hpp>\n#undef timer\n\n#include \"clangomp.h\"\n#include \"Stochastic.h\"\n#include \"System.h\"\n#include \"Utilities.h\"\n\n#define print(x) std::cout<<#x <<\": \" <<x<<std::endl;\n\nnamespace opt = boost::program_options;\n\nenum OutputType {\n CommaSeparated,\n PrettyPrint,\n Mathematica,\n NoOutput\n};\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type, bool verbose = false);\n\nint main(int argc, char * argv[]) {\n \/*! Initialize options list.\n *\/\n \n bool verbose = false;\n const int default_iterations = 1<<21;\n \n opt::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"iterations,n\",opt::value<int>(), \"Number of iterations\")\n (\"help\",\"Show help message\")\n (\"verbose,v\", \"Show extensive debugging info\")\n (\"output,o\", opt::value<int>(), \"Output style.\")\n (\"benchmark\", \"Test evaluation speed\")\n ;\n \n opt::variables_map vmap;\n opt::store(opt::parse_command_line(argc,argv,desc),vmap);\n opt::notify(vmap);\n \n if (vmap.count(\"help\")) {\n std::cout << desc << \"\\n\";\n return 1;\n }\n \n verbose = vmap.count(\"verbose\");\n \n int iterations = vmap.count(\"iterations\") ? vmap[\"iterations\"].as<int>() : default_iterations;\n \n if (verbose) {\n print(iterations);\n #pragma omp parallel\n #pragma omp single\n print(omp_get_num_threads());\n }\n \n OutputType output_style = vmap.count(\"output\") ? (OutputType)vmap[\"output\"].as<int>() : CommaSeparated;\n \n \/*! This call sets up our state machine for the wheel. Each state (i.e. \"A0\", \"C1\") is\n represented by an object with pointers to the next states and the bit-flip states. *\/\n setupStates();\n \n Constants constants;\n \n \/*! The delta used here is NOT, at this point, the delta used in the paper. This is the\n ratio of ones to zeroes in the bit stream. Probably worth changing the name, but\n calculating this at runtime is just an invitation for bugs. *\/\n constants.delta = .5;\n constants.epsilon = .7;\n constants.tau = 1;\n int dimension = 50;\n\n if(vmap.count(\"benchmark\")) {\n std::cout<<\"Benchmarking speed.\\n\";\n int benchmark_size = 1000;\n boost::timer::cpu_timer timer;\n boost::progress_display display(benchmark_size);\n timer.start();\n int tickmarks;\n #pragma omp parallel for private(constants)\n for (int k=0; k<benchmark_size; k++) {\n\tsimulate_and_print(constants,iterations,NoOutput,false);\n\t++display;\n }\n timer.stop();\n double speed_factor;\n double time_elapsed = timer.elapsed().wall;\n print(benchmark_size);\n print(timer.format(3,\"%ws\"));\n print(benchmark_size\/time_elapsed);\n exit(0);\n }\n\n #pragma omp parallel for private(constants)\n for (int k=dimension*dimension; k>=0; k--) {\n constants.epsilon = (k % dimension)\/(double)(dimension);\n constants.delta = .5 + .5*(k \/ dimension)\/(double)(dimension);\n simulate_and_print(constants, iterations, output_style,verbose);\n }\n \n}\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type, bool verbose) {\n \n \/*! Use this to change the length of the tape. *\/\n const int BIT_STREAM_LENGTH = 8;\n \n int first_pass_iterations = iterations;\n \n int *histogram = new int[1<<BIT_STREAM_LENGTH];\n std::fill_n(histogram, 1<<BIT_STREAM_LENGTH, 0);\n \n long double *p = new long double[1<<BIT_STREAM_LENGTH];\n long double *p_prime = new long double[1<<BIT_STREAM_LENGTH];\n long double sum = 0;\n \n const long double beta = log((1+constants.epsilon)\/(1-constants.epsilon));\n long double max_surprise = 0;\n long double min_surprise = LONG_MAX;\n \n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n for (int k=0; k<first_pass_iterations; ++k) {\n System *currentSystem = new System();\n StochasticReservoir *reservoir = new StochasticReservoir(localRNG);\n \n currentSystem->constants = constants;\n reservoir->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystemWithReservoir(currentSystem, reservoir, localRNG);\n \n histogram[currentSystem->endingBitString]++;\n delete currentSystem;\n delete reservoir;\n }\n \n for(int k=0; k<1<<BIT_STREAM_LENGTH; k++) {\n int setBits = bitCount(k,BIT_STREAM_LENGTH);\n p[k] = gsl_ran_binomial_pdf(setBits, constants.delta, BIT_STREAM_LENGTH)\/gsl_sf_choose(BIT_STREAM_LENGTH,setBits);\n p_prime[k]=static_cast<long double>(histogram[k])\/(first_pass_iterations);\n }\n \n \n delete [] histogram;\n \n for(int k=0; k<iterations; k++) {\n System *currentSystem = new System();\n StochasticReservoir *reservoir = new StochasticReservoir(localRNG);\n \n reservoir->constants = constants;\n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystemWithReservoir(currentSystem,reservoir,localRNG);\n \n long double surprise = exp(beta*currentSystem->mass)*p_prime[currentSystem->endingBitString]\/p[currentSystem->startingBitString];\n max_surprise = surprise > max_surprise ? surprise : max_surprise;\n min_surprise = surprise && surprise < min_surprise ? surprise : min_surprise;\n sum = sum + surprise;\n delete currentSystem;\n delete reservoir;\n }\n \n delete [] p_prime;\n delete [] p;\n \n #pragma omp critical\n {\n if(type==CommaSeparated) {\n static int once = 0;\n if (!once) {\n std::cout<<\"delta,epsilon,avg,max_surprise\\n\";\n once=1;\n }\n std::cout<< constants.delta << \",\" << constants.epsilon << \",\" << sum\/iterations << \",\" << max_surprise << std::endl;\n }\n if(type==PrettyPrint) {\n print(beta);\n print(constants.delta);\n print(constants.epsilon);\n print(sum\/iterations);\n print(max_surprise);\n print(sum);\n std::cout<<std::endl;\n }\n \n if (type==Mathematica) {\n\t exit(1);\n }\n }\n \n gsl_rng_free(localRNG);\n}\n<commit_msg>Fix whitespace in main.<commit_after>\/\/\n\/\/ main.cpp\n\/\/ thermaleraser\n\/\/\n\/\/ Created by Mark Larus on 9\/8\/12.\n\/\/ Copyright (c) 2012 Kenyon College. All rights reserved.\n\/\/\n\n#include <iostream>\n#include <algorithm>\n#include <math.h>\n#include <gsl\/gsl_randist.h>\n#include <gsl\/gsl_sf.h>\n#include <boost\/program_options.hpp>\n#include <boost\/timer\/timer.hpp>\n\n\/*! Fix a namespace issue with boost library.\n This lets us use both cpu_timer and progress\n*\/\n#define timer timer_class\n#include <boost\/progress.hpp>\n#undef timer\n\n#include \"clangomp.h\"\n#include \"Stochastic.h\"\n#include \"System.h\"\n#include \"Utilities.h\"\n\n#define print(x) std::cout<<#x <<\": \" <<x<<std::endl;\n\nnamespace opt = boost::program_options;\n\nenum OutputType {\n CommaSeparated,\n PrettyPrint,\n Mathematica,\n NoOutput\n};\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type, bool verbose = false);\n\nint main(int argc, char * argv[]) {\n \/*! Initialize options list.\n *\/\n \n bool verbose = false;\n const int default_iterations = 1<<16;\n \n opt::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"iterations,n\",opt::value<int>(), \"Number of iterations\")\n (\"help\",\"Show help message\")\n (\"verbose,v\", \"Show extensive debugging info\")\n (\"output,o\", opt::value<int>(), \"Output style.\")\n (\"benchmark\", \"Test evaluation speed\")\n ;\n \n opt::variables_map vmap;\n opt::store(opt::parse_command_line(argc,argv,desc),vmap);\n opt::notify(vmap);\n \n if (vmap.count(\"help\")) {\n std::cout << desc << \"\\n\";\n return 1;\n }\n \n verbose = vmap.count(\"verbose\");\n \n int iterations = vmap.count(\"iterations\") ? vmap[\"iterations\"].as<int>() : default_iterations;\n \n if (verbose) {\n print(iterations);\n #pragma omp parallel\n #pragma omp single\n print(omp_get_num_threads());\n }\n \n OutputType output_style = vmap.count(\"output\") ? (OutputType)vmap[\"output\"].as<int>() : CommaSeparated;\n \n \/*! This call sets up our state machine for the wheel. Each state (i.e. \"A0\", \"C1\") is\n represented by an object with pointers to the next states and the bit-flip states. *\/\n setupStates();\n \n Constants constants;\n \n \/*! The delta used here is NOT, at this point, the delta used in the paper. This is the\n ratio of ones to zeroes in the bit stream. Probably worth changing the name, but\n calculating this at runtime is just an invitation for bugs. *\/\n constants.delta = .5;\n constants.epsilon = .7;\n constants.tau = 1;\n int dimension = 50;\n\n if(vmap.count(\"benchmark\")) {\n std::cout<<\"Benchmarking speed.\\n\";\n int benchmark_size = 1000;\n boost::timer::cpu_timer timer;\n boost::progress_display display(benchmark_size);\n timer.start();\n int tickmarks;\n #pragma omp parallel for private(constants)\n for (int k=0; k<benchmark_size; k++) {\n simulate_and_print(constants,iterations,NoOutput,false);\n ++display;\n }\n timer.stop();\n double speed_factor;\n double time_elapsed = timer.elapsed().wall;\n print(benchmark_size);\n print(timer.format(3,\"%ws\"));\n print(benchmark_size\/time_elapsed);\n exit(0);\n }\n\n #pragma omp parallel for private(constants)\n for (int k=dimension*dimension; k>=0; k--) {\n constants.epsilon = (k % dimension)\/(double)(dimension);\n constants.delta = .5 + .5*(k \/ dimension)\/(double)(dimension);\n simulate_and_print(constants, iterations, output_style,verbose);\n }\n \n}\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type, bool verbose) {\n \n \/*! Use this to change the length of the tape. *\/\n const int BIT_STREAM_LENGTH = 8;\n \n int first_pass_iterations = iterations;\n \n int *histogram = new int[1<<BIT_STREAM_LENGTH];\n std::fill_n(histogram, 1<<BIT_STREAM_LENGTH, 0);\n \n long double *p = new long double[1<<BIT_STREAM_LENGTH];\n long double *p_prime = new long double[1<<BIT_STREAM_LENGTH];\n long double sum = 0;\n \n const long double beta = log((1+constants.epsilon)\/(1-constants.epsilon));\n long double max_surprise = 0;\n long double min_surprise = LONG_MAX;\n \n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n for (int k=0; k<first_pass_iterations; ++k) {\n System *currentSystem = new System();\n StochasticReservoir *reservoir = new StochasticReservoir(localRNG);\n \n currentSystem->constants = constants;\n reservoir->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystemWithReservoir(currentSystem, reservoir, localRNG);\n \n histogram[currentSystem->endingBitString]++;\n delete currentSystem;\n delete reservoir;\n }\n \n for(int k=0; k<1<<BIT_STREAM_LENGTH; k++) {\n int setBits = bitCount(k,BIT_STREAM_LENGTH);\n p[k] = gsl_ran_binomial_pdf(setBits, constants.delta, BIT_STREAM_LENGTH)\/gsl_sf_choose(BIT_STREAM_LENGTH,setBits);\n p_prime[k]=static_cast<long double>(histogram[k])\/(first_pass_iterations);\n }\n \n \n delete [] histogram;\n \n for(int k=0; k<iterations; k++) {\n System *currentSystem = new System();\n StochasticReservoir *reservoir = new StochasticReservoir(localRNG);\n \n reservoir->constants = constants;\n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystemWithReservoir(currentSystem,reservoir,localRNG);\n \n long double surprise = exp(beta*currentSystem->mass)*p_prime[currentSystem->endingBitString]\/p[currentSystem->startingBitString];\n max_surprise = surprise > max_surprise ? surprise : max_surprise;\n min_surprise = surprise && surprise < min_surprise ? surprise : min_surprise;\n sum = sum + surprise;\n delete currentSystem;\n delete reservoir;\n }\n \n delete [] p_prime;\n delete [] p;\n \n #pragma omp critical\n {\n if(type==CommaSeparated) {\n static int once = 0;\n if (!once) {\n std::cout<<\"delta,epsilon,avg,max_surprise\\n\";\n once=1;\n }\n std::cout<< constants.delta << \",\" << constants.epsilon << \",\" << sum\/iterations << \",\" << max_surprise << std::endl;\n }\n if(type==PrettyPrint) {\n print(beta);\n print(constants.delta);\n print(constants.epsilon);\n print(sum\/iterations);\n print(max_surprise);\n print(sum);\n std::cout<<std::endl;\n }\n \n if (type==Mathematica) {\n exit(1);\n }\n }\n \n gsl_rng_free(localRNG);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2016 Oleg Linkin <maledictusdemagog@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <QGuiApplication>\n#include <QScopedPointer>\n#include <QTimer>\n\n#include <sailfishapp.h>\n\n#include <QtDebug>\n\n#include \"src\/application.h\"\n#include \"src\/debugmessagehandler.h\"\n\n\nint main(int argc, char *argv[])\n{\n qInstallMessageHandler(DebugHandler::Write);\n\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n app->setApplicationDisplayName(\"Mnemosy\");\n app->setApplicationName(\"harbour-mnemosy\");\n app->setOrganizationName(\"Maledictus\");\n app->setApplicationVersion(QString(APP_VERSION));\n\n qDebug() << \"====Application starting====\" << app->applicationVersion();\n\n QScopedPointer<Mnemosy::Application> application(new Mnemosy::Application());\n QTimer::singleShot(1, application.data(), SLOT(start()));\n\n QObject::connect(app.data(),\n &QGuiApplication::aboutToQuit,\n application.data(),\n &Mnemosy::Application::handleAboutToQuit);\n\n const int retVal = app->exec();\n\n qDebug() << \"====Application closing====\";\n\n return retVal;\n}\n\n<commit_msg>Remove organization name<commit_after>\/*\nThe MIT License (MIT)\n\nCopyright (c) 2016 Oleg Linkin <maledictusdemagog@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#include <QGuiApplication>\n#include <QScopedPointer>\n#include <QTimer>\n\n#include <sailfishapp.h>\n\n#include <QtDebug>\n\n#include \"src\/application.h\"\n#include \"src\/debugmessagehandler.h\"\n\n\nint main(int argc, char *argv[])\n{\n qInstallMessageHandler(DebugHandler::Write);\n\n QScopedPointer<QGuiApplication> app(SailfishApp::application(argc, argv));\n app->setApplicationDisplayName(\"Mnemosy\");\n app->setApplicationName(\"harbour-mnemosy\");\n app->setApplicationVersion(QString(APP_VERSION));\n\n qDebug() << \"====Application starting====\" << app->applicationVersion();\n\n QScopedPointer<Mnemosy::Application> application(new Mnemosy::Application());\n QTimer::singleShot(1, application.data(), SLOT(start()));\n\n QObject::connect(app.data(),\n &QGuiApplication::aboutToQuit,\n application.data(),\n &Mnemosy::Application::handleAboutToQuit);\n\n const int retVal = app->exec();\n\n qDebug() << \"====Application closing====\";\n\n return retVal;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n * Copyright (C) 2011-2012 by Paul-Louis Ageneau *\n * paul-louis (at) ageneau (dot) org *\n * *\n * This file is part of TeapotNet. *\n * *\n * TeapotNet is free software: you can redistribute it and\/or modify *\n * it under the terms of the GNU Affero General Public License as *\n * published by the Free Software Foundation, either version 3 of *\n * the License, or (at your option) any later version. *\n * *\n * TeapotNet is distributed in the hope that it will be useful, but *\n * WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU Affero General Public License for more details. *\n * *\n * You should have received a copy of the GNU Affero General Public *\n * License along with TeapotNet. *\n * If not, see <http:\/\/www.gnu.org\/licenses\/>. *\n *************************************************************************\/\n\n#include \"main.h\"\n#include \"map.h\"\n#include \"sha512.h\"\n#include \"time.h\"\n#include \"store.h\"\n#include \"tracker.h\"\n#include \"http.h\"\n#include \"config.h\"\n#include \"core.h\"\n#include \"user.h\"\n#include \"directory.h\"\n#include \"portmapping.h\"\n\n#include <signal.h>\n\nusing namespace tpot;\n\nMutex tpot::LogMutex;\n\n\n#ifdef WINDOWS\n\n#include <shellapi.h>\n\n#define SHARED __attribute__((section(\".shared\"), shared))\nint InterfacePort SHARED = 0;\n\nvoid openUserInterface(void)\n{\n\tif(!InterfacePort) return;\n\n\tString url;\n\turl << \"http:\/\/localhost:\" << InterfacePort << \"\/\";\n\tShellExecute(NULL, \"open\", url, NULL, NULL, SW_SHOW);\n}\n\n#endif\n\nint main(int argc, char** argv)\n{\n\tsrand(time(NULL));\n \n#ifdef WINDOWS\n\tWSADATA WSAData;\n\tWSAStartup(MAKEWORD(2,2), &WSAData);\n#else\n\tsignal(SIGPIPE, SIG_IGN);\n#endif\n\t\n#ifdef PTW32_STATIC_LIB\n\tpthread_win32_process_attach_np();\n#endif\n\n\ttry {\n\t \n\/*\t\n\tAssert(Address(\"127.0.0.1:80\").isLocal());\n\tAssert(Address(\"::1:80\").isLocal());\n\tAssert(Address(\"::FFFF:127.0.0.1:80\").isLocal());\n\tAssert(Address(\"192.168.0.1:80\").isPrivate());\n\tAssert(Address(\"::FFFF:192.168.0.1:80\").isPrivate());\n*\/\n\n\tunsigned appVersion = String(APPVERSION).dottedToInt();\n\tAssert(appVersion != 0);\n\tAssert(argc >= 1);\n\t\n#ifndef WINDOWS\n\t\t\/\/ Main config file name\n\t\t\/\/ Should tell us where the static dir is located\n\t\tconst String mainConfigFileName = \"\/etc\/teapotnet\/config.conf\";\n\t\tif(File::Exist(mainConfigFileName)) Config::Load(mainConfigFileName);\n#endif\n\n\t\tconst String configFileName = \"config.txt\";\n\t\tif(File::Exist(configFileName)) Config::Load(configFileName);\n\n\t\tConfig::Default(\"tracker\", \"teapotnet.org\");\n\t\tConfig::Default(\"port\", \"8480\");\n\t\tConfig::Default(\"tracker_port\", \"8488\");\n\t\tConfig::Default(\"interface_port\", \"8080\");\n\t\tConfig::Default(\"profiles_dir\", \"profiles\");\n\t\tConfig::Default(\"static_dir\", \"static\");\n\t\tConfig::Default(\"shared_dir\", \"shared\");\n\t\tConfig::Default(\"temp_dir\", \"temp\");\n\t\tConfig::Default(\"external_address\", \"auto\");\n\t\tConfig::Default(\"http_timeout\", \"10000\");\n\t\tConfig::Default(\"request_timeout\", \"10000\");\n\t\tConfig::Default(\"meeting_timeout\", \"15000\");\n\t\tConfig::Default(\"tpot_timeout\", \"15000\");\n\t\tConfig::Default(\"tpot_read_timeout\", \"60000\");\n\t\tConfig::Default(\"user_global_shares\", \"true\");\n\t\t\n\t\tif(Config::Get(\"request_timeout\").toInt() < 10000)\n\t\t\tConfig::Put(\"request_timeout\", \"10000\");\t\n\t\t\n\t\tif(Config::Get(\"tpot_timeout\").toInt() < 15000)\n\t\t\tConfig::Put(\"tpot_timeout\", \"15000\");\n\t\t\n\t\tStringMap args;\n\t\tString last;\n\t\tString commandLine;\n\t\tfor(int i=1; i<argc; ++i)\n\t\t{\n\t\t\tString str(argv[i]);\n\t\t\tif(str.empty()) continue;\n\t\t\t\n\t\t\tif(!commandLine.empty()) commandLine+= ' ';\n\t\t\tcommandLine+= str;\n\n\t\t\tif(str[0] == '-')\n\t\t\t{\n\t\t\t\tif(!last.empty()) args[last] = \"\";\n\t\t\t \n\t\t\t\tif(str[0] == '-') str.ignore();\n\t\t\t\tif(!str.empty() && str[0] == '-') str.ignore();\n\t\t\t\tif(str.empty())\n\t\t\t\t{\n\t\t\t\t\tstd::cerr<<\"Invalid option: \"<<argv[i]<<std::endl;\n\t\t\t\t\tstd::cerr<<\"Try \\\"\"<<argv[0]<<\" --help\\\" for help\"<<std::endl;\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tlast = str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(last.empty()) args[str] = \"\";\n\t\t\t\telse {\n\t\t\t\t\targs[last] = str;\n\t\t\t\t\tlast.clear();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!last.empty()) args[last] = \"\";\n\t\t\n\t\tif(args.contains(\"help\") || args.contains(\"h\"))\n\t\t{\n\t\t\tstd::cout<<APPNAME<<\" \"<<APPVERSION<<std::endl;\n\t\t\tstd::cout<<APPAUTHOR<<std::endl;\n\t\t\tstd::cout<<\"For information, please visit \"<<APPLINK<<std::endl;\n\t\t\tstd::cout<<\"Usage: \";\n\t\t\tif(argc) std::cout<<argv[0];\n\t\t\telse std::cout<<\"teapotnet\";\n\t\t\tstd::cout<<\" [options]\"<<std::endl;\n\t\t\tstd::cout<<std::endl;\n\t\t\tstd::cout<<\"Available options include:\"<<std::endl;\n\t\t\tstd::cout<<\" --port port\\t\\tSet the TPOT port\"<<std::endl;\n\t\t\tstd::cout<<\" --ifport port\\t\\tSet the HTTP interface port\"<<std::endl;\n\t\t\tstd::cout<<\" --tracker [port]\\tEnable the local tracker\"<<std::endl;\n#ifdef WINDOWS\n\t\t\tstd::cout<<\" --nointerface\\t\\tPrevent lauching the web browser\"<<std::endl;\n\t\t\tstd::cout<<\" --noupdate\\t\\tPrevent trying to update the program\"<<std::endl;\n\t\t\tstd::cout<<\" --debug\\t\\tKeep the console window on screen\"<<std::endl;\n#endif\n\t\t\treturn 0;\n\t\t}\n\t\t\n#ifdef WINDOWS\n\t\tif(InterfacePort)\n\t\t{\n\t\t\tif(!args.contains(\"nointerface\"))\n\t\t\t\topenUserInterface();\n\t\t\treturn 0;\n\t\t}\n\n\t\ttry {\n\t\t\tConfig::Save(configFileName);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tLog(\"main\", \"Unable to save the configuration file, trying to restart as administrator...\"); \n\t\t\tSleep(100);\n\t\t\tif(int(ShellExecute(NULL, \"runas\", argv[0], commandLine.c_str(), NULL, SW_SHOW)) > 32)\n\t\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tif(!args.contains(\"noupdate\"))\n\t\t{\n\t\t\tunsigned currentDay = Time::Now().toDays();\n\t\t\tunsigned updateDay = 0;\n\t\t\tif(!Config::Get(\"last_update_day\").empty())\n\t\t\t\tConfig::Get(\"last_update_day\").extract(updateDay);\n\t\t\t\n\t\t\tif(updateDay != currentDay)\n\t\t\t{\n\t\t\t\tLog(\"main\", \"Looking for updates...\");\n\n\t\t\t\tString url = String(DOWNLOADURL) + \"?version&release=win32\" + \"¤t=\" + APPVERSION;\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tString content;\n\t\t\t\t\tif(Http::Get(url, &content) == 200)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontent.trim();\n\n\t\t\t\t\t\tunsigned lastVersion = content.dottedToInt();\n\t\t\t\t\t\tif(lastVersion && appVersion <= lastVersion)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tConfig::Put(\"last_update_day\", String::number(currentDay));\n\t\t\t\t\t\t\tif(int(ShellExecute(NULL, NULL, \"winupdater.exe\", commandLine.c_str(), NULL, SW_SHOW)) > 32)\n\t\t\t\t\t\t\t\treturn 0;\n\t\t\t\t\t\t\telse Log(\"main\", \"Warning: Unable to run the updater, skipping program update.\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse Log(\"main\", \"Warning: Failed to query the last available version\");\n\t\t\t\t}\n\t\t\t\tcatch(const Exception &e)\n\t\t\t\t{\n\t\t\t\t\tLog(\"main\", String(\"Warning: Unable to look for updates: \") + e.what());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n#endif\n\t\t\n\t\tLog(\"main\", \"Starting...\");\n\t\tFile::CleanTemp();\n\t\t\n\t\tTracker *tracker = NULL;\n\t\tif(args.contains(\"tracker\"))\n\t\t{\n\t\t\tif(args[\"tracker\"].empty()) \n\t\t\t\targs[\"tracker\"] = Config::Get(\"tracker_port\");\n\t\t\tint port;\n\t\t\targs[\"tracker\"] >> port;\n\t\t\t\n\t\t\tLog(\"main\", \"Launching the tracker\");\n\t\t\ttracker = new Tracker(port);\n\t\t\ttracker->start();\n\t\t}\n\t\t\n\t\tString sport = Config::Get(\"port\");\n\t\tif(args.contains(\"port\")) sport = args[\"port\"];\n\t\tint port;\n\t\tsport >> port;\n\t\t\n\t\tString sifport = Config::Get(\"interface_port\");\n\t\tif(args.contains(\"ifport\")) sifport = args[\"ifport\"];\n\t\tint ifport;\n\t\tsifport >> ifport;\n\n\t\t\/\/ Creating global store\n\t\tStore::GlobalInstance = new Store(NULL);\n\t\t\n\t\t\/\/ Starting interface\n\t\tInterface::Instance = new Interface(ifport);\n\t\tInterface::Instance->start();\n\t\t\n\t\t\/\/ Starting core\n\t\tCore::Instance = new Core(port);\n\t\tCore::Instance->start();\n\t\t\n\t\t\/\/ Starting port mapping\n\t\tPortMapping::Instance = new PortMapping;\n\t\tif(Config::Get(\"external_address\").empty()\n\t\t\t|| Config::Get(\"external_address\") == \"auto\")\n\t\t{\n\t\t\tLog(\"main\", \"NAT port mapping is enabled\");\n\t\t\tPortMapping::Instance->init();\n\t\t\tPortMapping::Instance->addTcp(port, port);\n\t\t\tPortMapping::Instance->start();\n\t\t}\n\t\telse Log(\"main\", \"NAT port mapping is disabled\");\n\t\t\n\t\tif(!Directory::Exist(Config::Get(\"profiles_dir\")))\n\t\t\tDirectory::Create(Config::Get(\"profiles_dir\"));\n\t\t\n\t\tDirectory profilesDir(Config::Get(\"profiles_dir\"));\n\t\twhile(profilesDir.nextFile())\n\t\t{\n\t\t\tif(profilesDir.fileIsDir())\n\t\t\t{\n\t\t\t\tString name = profilesDir.fileName();\n\t\t\t\tUser *user;\n\t\t\t\t\n\t\t\t\tLog(\"main\", String(\"Loading user \") + name + \"...\");\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tuser = new User(name);\t\n\t\t\t\t}\n\t\t\t\tcatch(const std::exception &e)\n\t\t\t\t{\n\t\t\t\t\tLog(\"main\", \"ERROR: Unable to load user \\\"\" + name + \"\\\": \" + e.what());\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tuser->start();\n\t\t\t\tmsleep(100);\n\t\t\t}\n\t\t}\n\t\t\n\t\tString usersFileName = \"users.txt\";\n\t\tFile usersFile;\n\t\t\n\t\tif(File::Exist(usersFileName))\n\t\t{\n\t\t\tusersFile.open(usersFileName, File::Read);\n\t\t\tString line;\n\t\t\twhile(usersFile.readLine(line))\n\t\t\t{\n\t\t\t\tString &name = line;\n\t\t\t\tname.trim();\n\t\t\t\tString password = name.cut(' ');\n\t\t\t\tpassword.trim();\n\t\t\t\tif(name.empty()) continue;\n\t\t\t\tLog(\"main\", String(\"Creating user \") + name + \"...\");\n\t\t\t\tUser *user = new User(name, password);\n\t\t\t\tuser->start();\n\t\t\t\tmsleep(100);\n\t\t\t\tline.clear();\n\t\t\t}\n\t\t\tusersFile.close();\n\t\t}\n\t\tusersFile.open(usersFileName, File::Truncate);\n\t\tusersFile.close();\n\n#ifdef WINDOWS\n\t\tInterfacePort = ifport;\n\t\tif(!args.contains(\"nointerface\"))\n\t\t\topenUserInterface();\n\t\t\n\t\tif(!args.contains(\"debug\") && Config::Get(\"debug\") != \"on\")\n\t\t{\n\t\t\tHWND hWnd = GetConsoleWindow();\n\t\t\tShowWindow(hWnd, SW_HIDE);\n\t\t}\n#endif\n\t\t\n\t\tLog(\"main\", String(\"Ready. You can access the interface on http:\/\/localhost:\") + String::number(ifport) + \"\/\");\t\t\n\t\tCore::Instance->join();\n\t\tLog(\"main\", \"Finished\");\n\t}\n\tcatch(const std::exception &e)\n\t{\n\t\tLog(\"main\", String(\"ERROR: \") + e.what());\n#ifdef WINDOWS\n\t\tHWND hWnd = GetConsoleWindow();\n ShowWindow(hWnd, SW_SHOW);\n\t\tstd::cin.get();\n#endif\n\t\treturn 1;\t \n\t}\n\t\n#ifdef PTW32_STATIC_LIB\n\tpthread_win32_process_detach_np();\n#endif\n\t\n#ifdef WINDOWS\n\tWSACleanup();\n#endif\n\t\n\texit(0);\n}\n\n<commit_msg>Save port and ifport to config file<commit_after>\/*************************************************************************\n * Copyright (C) 2011-2012 by Paul-Louis Ageneau *\n * paul-louis (at) ageneau (dot) org *\n * *\n * This file is part of TeapotNet. *\n * *\n * TeapotNet is free software: you can redistribute it and\/or modify *\n * it under the terms of the GNU Affero General Public License as *\n * published by the Free Software Foundation, either version 3 of *\n * the License, or (at your option) any later version. *\n * *\n * TeapotNet is distributed in the hope that it will be useful, but *\n * WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU Affero General Public License for more details. *\n * *\n * You should have received a copy of the GNU Affero General Public *\n * License along with TeapotNet. *\n * If not, see <http:\/\/www.gnu.org\/licenses\/>. *\n *************************************************************************\/\n\n#include \"main.h\"\n#include \"map.h\"\n#include \"sha512.h\"\n#include \"time.h\"\n#include \"store.h\"\n#include \"tracker.h\"\n#include \"http.h\"\n#include \"config.h\"\n#include \"core.h\"\n#include \"user.h\"\n#include \"directory.h\"\n#include \"portmapping.h\"\n\n#include <signal.h>\n\nusing namespace tpot;\n\nMutex tpot::LogMutex;\n\n\n#ifdef WINDOWS\n\n#include <shellapi.h>\n\n#define SHARED __attribute__((section(\".shared\"), shared))\nint InterfacePort SHARED = 0;\n\nvoid openUserInterface(void)\n{\n\tif(!InterfacePort) return;\n\n\tString url;\n\turl << \"http:\/\/localhost:\" << InterfacePort << \"\/\";\n\tShellExecute(NULL, \"open\", url, NULL, NULL, SW_SHOW);\n}\n\n#endif\n\nint main(int argc, char** argv)\n{\n\tsrand(time(NULL));\n \n#ifdef WINDOWS\n\tWSADATA WSAData;\n\tWSAStartup(MAKEWORD(2,2), &WSAData);\n#else\n\tsignal(SIGPIPE, SIG_IGN);\n#endif\n\t\n#ifdef PTW32_STATIC_LIB\n\tpthread_win32_process_attach_np();\n#endif\n\n\ttry {\n\t \n\/*\t\n\tAssert(Address(\"127.0.0.1:80\").isLocal());\n\tAssert(Address(\"::1:80\").isLocal());\n\tAssert(Address(\"::FFFF:127.0.0.1:80\").isLocal());\n\tAssert(Address(\"192.168.0.1:80\").isPrivate());\n\tAssert(Address(\"::FFFF:192.168.0.1:80\").isPrivate());\n*\/\n\n\tunsigned appVersion = String(APPVERSION).dottedToInt();\n\tAssert(appVersion != 0);\n\tAssert(argc >= 1);\n\t\n#ifndef WINDOWS\n\t\t\/\/ Main config file name\n\t\t\/\/ Should tell us where the static dir is located\n\t\tconst String mainConfigFileName = \"\/etc\/teapotnet\/config.conf\";\n\t\tif(File::Exist(mainConfigFileName)) Config::Load(mainConfigFileName);\n#endif\n\n\t\tconst String configFileName = \"config.txt\";\n\t\tif(File::Exist(configFileName)) Config::Load(configFileName);\n\n\t\tConfig::Default(\"tracker\", \"teapotnet.org\");\n\t\tConfig::Default(\"port\", \"8480\");\n\t\tConfig::Default(\"tracker_port\", \"8488\");\n\t\tConfig::Default(\"interface_port\", \"8080\");\n\t\tConfig::Default(\"profiles_dir\", \"profiles\");\n\t\tConfig::Default(\"static_dir\", \"static\");\n\t\tConfig::Default(\"shared_dir\", \"shared\");\n\t\tConfig::Default(\"temp_dir\", \"temp\");\n\t\tConfig::Default(\"external_address\", \"auto\");\n\t\tConfig::Default(\"http_timeout\", \"10000\");\n\t\tConfig::Default(\"request_timeout\", \"10000\");\n\t\tConfig::Default(\"meeting_timeout\", \"15000\");\n\t\tConfig::Default(\"tpot_timeout\", \"15000\");\n\t\tConfig::Default(\"tpot_read_timeout\", \"60000\");\n\t\tConfig::Default(\"user_global_shares\", \"true\");\n\t\t\n\t\tif(Config::Get(\"request_timeout\").toInt() < 10000)\n\t\t\tConfig::Put(\"request_timeout\", \"10000\");\t\n\t\t\n\t\tif(Config::Get(\"tpot_timeout\").toInt() < 15000)\n\t\t\tConfig::Put(\"tpot_timeout\", \"15000\");\n\t\t\n\t\tStringMap args;\n\t\tString last;\n\t\tString commandLine;\n\t\tfor(int i=1; i<argc; ++i)\n\t\t{\n\t\t\tString str(argv[i]);\n\t\t\tif(str.empty()) continue;\n\t\t\t\n\t\t\tif(!commandLine.empty()) commandLine+= ' ';\n\t\t\tcommandLine+= str;\n\n\t\t\tif(str[0] == '-')\n\t\t\t{\n\t\t\t\tif(!last.empty()) args[last] = \"\";\n\t\t\t \n\t\t\t\tif(str[0] == '-') str.ignore();\n\t\t\t\tif(!str.empty() && str[0] == '-') str.ignore();\n\t\t\t\tif(str.empty())\n\t\t\t\t{\n\t\t\t\t\tstd::cerr<<\"Invalid option: \"<<argv[i]<<std::endl;\n\t\t\t\t\tstd::cerr<<\"Try \\\"\"<<argv[0]<<\" --help\\\" for help\"<<std::endl;\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\tlast = str;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(last.empty()) args[str] = \"\";\n\t\t\t\telse {\n\t\t\t\t\targs[last] = str;\n\t\t\t\t\tlast.clear();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!last.empty()) args[last] = \"\";\n\t\t\n\t\tif(args.contains(\"help\") || args.contains(\"h\"))\n\t\t{\n\t\t\tstd::cout<<APPNAME<<\" \"<<APPVERSION<<std::endl;\n\t\t\tstd::cout<<APPAUTHOR<<std::endl;\n\t\t\tstd::cout<<\"For information, please visit \"<<APPLINK<<std::endl;\n\t\t\tstd::cout<<\"Usage: \";\n\t\t\tif(argc) std::cout<<argv[0];\n\t\t\telse std::cout<<\"teapotnet\";\n\t\t\tstd::cout<<\" [options]\"<<std::endl;\n\t\t\tstd::cout<<std::endl;\n\t\t\tstd::cout<<\"Available options include:\"<<std::endl;\n\t\t\tstd::cout<<\" --port port\\t\\tSet the TPOT port\"<<std::endl;\n\t\t\tstd::cout<<\" --ifport port\\t\\tSet the HTTP interface port\"<<std::endl;\n\t\t\tstd::cout<<\" --tracker [port]\\tEnable the local tracker\"<<std::endl;\n#ifdef WINDOWS\n\t\t\tstd::cout<<\" --nointerface\\t\\tPrevent lauching the web browser\"<<std::endl;\n\t\t\tstd::cout<<\" --noupdate\\t\\tPrevent trying to update the program\"<<std::endl;\n\t\t\tstd::cout<<\" --debug\\t\\tKeep the console window on screen\"<<std::endl;\n#endif\n\t\t\treturn 0;\n\t\t}\n\t\t\n#ifdef WINDOWS\n\t\tif(InterfacePort)\n\t\t{\n\t\t\tif(!args.contains(\"nointerface\"))\n\t\t\t\topenUserInterface();\n\t\t\treturn 0;\n\t\t}\n\n\t\ttry {\n\t\t\tConfig::Save(configFileName);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tLog(\"main\", \"Unable to save the configuration file, trying to restart as administrator...\"); \n\t\t\tSleep(100);\n\t\t\tif(int(ShellExecute(NULL, \"runas\", argv[0], commandLine.c_str(), NULL, SW_SHOW)) > 32)\n\t\t\t\treturn 0;\n\t\t}\n\t\t\n\t\tif(!args.contains(\"noupdate\"))\n\t\t{\n\t\t\tunsigned currentDay = Time::Now().toDays();\n\t\t\tunsigned updateDay = 0;\n\t\t\tif(!Config::Get(\"last_update_day\").empty())\n\t\t\t\tConfig::Get(\"last_update_day\").extract(updateDay);\n\t\t\t\n\t\t\tif(updateDay != currentDay)\n\t\t\t{\n\t\t\t\tLog(\"main\", \"Looking for updates...\");\n\n\t\t\t\tString url = String(DOWNLOADURL) + \"?version&release=win32\" + \"¤t=\" + APPVERSION;\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tString content;\n\t\t\t\t\tif(Http::Get(url, &content) == 200)\n\t\t\t\t\t{\n\t\t\t\t\t\tcontent.trim();\n\n\t\t\t\t\t\tunsigned lastVersion = content.dottedToInt();\n\t\t\t\t\t\tif(lastVersion && appVersion <= lastVersion)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tConfig::Put(\"last_update_day\", String::number(currentDay));\n\t\t\t\t\t\t\tif(int(ShellExecute(NULL, NULL, \"winupdater.exe\", commandLine.c_str(), NULL, SW_SHOW)) > 32)\n\t\t\t\t\t\t\t\treturn 0;\n\t\t\t\t\t\t\telse Log(\"main\", \"Warning: Unable to run the updater, skipping program update.\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse Log(\"main\", \"Warning: Failed to query the last available version\");\n\t\t\t\t}\n\t\t\t\tcatch(const Exception &e)\n\t\t\t\t{\n\t\t\t\t\tLog(\"main\", String(\"Warning: Unable to look for updates: \") + e.what());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n#endif\n\t\t\n\t\tLog(\"main\", \"Starting...\");\n\t\tFile::CleanTemp();\n\t\t\n\t\tTracker *tracker = NULL;\n\t\tif(args.contains(\"tracker\"))\n\t\t{\n\t\t\tif(args[\"tracker\"].empty()) \n\t\t\t\targs[\"tracker\"] = Config::Get(\"tracker_port\");\n\t\t\tint port;\n\t\t\targs[\"tracker\"] >> port;\n\t\t\t\n\t\t\tLog(\"main\", \"Launching the tracker\");\n\t\t\ttracker = new Tracker(port);\n\t\t\ttracker->start();\n\t\t}\n\t\t\n\t\tString sport = Config::Get(\"port\");\n\t\tif(args.contains(\"port\")) sport = args[\"port\"];\n\t\tint port;\n\t\tsport >> port;\n\t\t\n\t\tString sifport = Config::Get(\"interface_port\");\n\t\tif(args.contains(\"ifport\")) sifport = args[\"ifport\"];\n\t\tint ifport;\n\t\tsifport >> ifport;\n\n\t\t\/\/ Creating global store\n\t\tStore::GlobalInstance = new Store(NULL);\n\t\t\n\t\t\/\/ Starting interface and core\n\t\tInterface::Instance = new Interface(ifport);\n\t\tInterface::Instance->start();\n\t\t\n\t\t\/\/ Starting core\n\t\tCore::Instance = new Core(port);\n\t\tCore::Instance->start();\n\t\t\n\t\tif(args.contains(\"port\") || args.contains(\"ifport\"))\n\t\t{\n\t\t\tConfig::Put(\"port\", String::number(port));\n\t\t\tConfig::Put(\"interface_port\", String::number(ifport));\n\t\t\tConfig::Save(configFileName);\n\t\t}\n\t\t\n\t\t\/\/ Starting port mapping\n\t\tPortMapping::Instance = new PortMapping;\n\t\tif(Config::Get(\"external_address\").empty()\n\t\t\t|| Config::Get(\"external_address\") == \"auto\")\n\t\t{\n\t\t\tLog(\"main\", \"NAT port mapping is enabled\");\n\t\t\tPortMapping::Instance->init();\n\t\t\tPortMapping::Instance->addTcp(port, port);\n\t\t\tPortMapping::Instance->start();\n\t\t}\n\t\telse Log(\"main\", \"NAT port mapping is disabled\");\n\t\t\n\t\tif(!Directory::Exist(Config::Get(\"profiles_dir\")))\n\t\t\tDirectory::Create(Config::Get(\"profiles_dir\"));\n\t\t\n\t\tDirectory profilesDir(Config::Get(\"profiles_dir\"));\n\t\twhile(profilesDir.nextFile())\n\t\t{\n\t\t\tif(profilesDir.fileIsDir())\n\t\t\t{\n\t\t\t\tString name = profilesDir.fileName();\n\t\t\t\tUser *user;\n\t\t\t\t\n\t\t\t\tLog(\"main\", String(\"Loading user \") + name + \"...\");\n\t\t\t\t\n\t\t\t\ttry {\n\t\t\t\t\tuser = new User(name);\t\n\t\t\t\t}\n\t\t\t\tcatch(const std::exception &e)\n\t\t\t\t{\n\t\t\t\t\tLog(\"main\", \"ERROR: Unable to load user \\\"\" + name + \"\\\": \" + e.what());\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tuser->start();\n\t\t\t\tmsleep(100);\n\t\t\t}\n\t\t}\n\t\t\n\t\tString usersFileName = \"users.txt\";\n\t\tFile usersFile;\n\t\t\n\t\tif(File::Exist(usersFileName))\n\t\t{\n\t\t\tusersFile.open(usersFileName, File::Read);\n\t\t\tString line;\n\t\t\twhile(usersFile.readLine(line))\n\t\t\t{\n\t\t\t\tString &name = line;\n\t\t\t\tname.trim();\n\t\t\t\tString password = name.cut(' ');\n\t\t\t\tpassword.trim();\n\t\t\t\tif(name.empty()) continue;\n\t\t\t\tLog(\"main\", String(\"Creating user \") + name + \"...\");\n\t\t\t\tUser *user = new User(name, password);\n\t\t\t\tuser->start();\n\t\t\t\tmsleep(100);\n\t\t\t\tline.clear();\n\t\t\t}\n\t\t\tusersFile.close();\n\t\t}\n\t\tusersFile.open(usersFileName, File::Truncate);\n\t\tusersFile.close();\n\n#ifdef WINDOWS\n\t\tInterfacePort = ifport;\n\t\tif(!args.contains(\"nointerface\"))\n\t\t\topenUserInterface();\n\t\t\n\t\tif(!args.contains(\"debug\") && Config::Get(\"debug\") != \"on\")\n\t\t{\n\t\t\tHWND hWnd = GetConsoleWindow();\n\t\t\tShowWindow(hWnd, SW_HIDE);\n\t\t}\n#endif\n\t\t\n\t\tLog(\"main\", String(\"Ready. You can access the interface on http:\/\/localhost:\") + String::number(ifport) + \"\/\");\t\t\n\t\tCore::Instance->join();\n\t\tLog(\"main\", \"Finished\");\n\t}\n\tcatch(const std::exception &e)\n\t{\n\t\tLog(\"main\", String(\"ERROR: \") + e.what());\n#ifdef WINDOWS\n\t\tHWND hWnd = GetConsoleWindow();\n ShowWindow(hWnd, SW_SHOW);\n\t\tstd::cin.get();\n#endif\n\t\treturn 1;\t \n\t}\n\t\n#ifdef PTW32_STATIC_LIB\n\tpthread_win32_process_detach_np();\n#endif\n\t\n#ifdef WINDOWS\n\tWSACleanup();\n#endif\n\t\n\texit(0);\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Update preprocessor.hpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nLanguage: C++\nDate: $Date: 2009-03-09 20:43:00 +0100 (Mo, 09 Mrz 2009) $\nVersion: $Revision: 16522 $\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"mitkNavigationDataToMessageFilter.h\"\n#include \"mitkNavigationData.h\"\n\n#include \"mitkTestingMacros.h\"\n#include \"mitkVector.h\"\n#include <iostream>\n\n\n\/\/ Receiver class remembers Messages received.\n\/\/ Will tell about received Messages when asked.\nclass MessageReceiverClass\n{\n public:\n\n MessageReceiverClass()\n {\n m_ReceivedData = mitk::NavigationData::New();\n m_MessagesReceived = 0;\n }\n\n void OnPositionChanged(mitk::NavigationData::PositionType v)\n {\n m_ReceivedData->SetPosition(v);\n ++m_MessagesReceived;\n }\n \n void OnOrientationChanged(mitk::NavigationData::OrientationType v)\n {\n m_ReceivedData->SetOrientation(v);\n ++m_MessagesReceived;\n }\n\n void OnErrorChanged(mitk::NavigationData::CovarianceMatrixType v)\n {\n m_ReceivedData->SetCovErrorMatrix(v);\n ++m_MessagesReceived;\n }\n \n void OnTimeStampChanged(mitk::NavigationData::TimeStampType v)\n {\n m_ReceivedData->SetTimeStamp(v);\n ++m_MessagesReceived;\n }\n\n void OnDataValidChanged(bool v)\n {\n m_ReceivedData->SetDataValid(v);\n ++m_MessagesReceived;\n }\n\n mitk::NavigationData::Pointer m_ReceivedData;\n int m_MessagesReceived;\n};\n\n\/**Documentation\n * test for the class \"NavigationDataToMessageFilter\".\n *\/\nint mitkNavigationDataToMessageFilterTest(int \/* argc *\/, char* \/*argv*\/[])\n{\n MITK_TEST_BEGIN(\"NavigationDataToMessageFilter\");\n\n \/\/ let's create an object of our class \n mitk::NavigationDataToMessageFilter::Pointer myFilter = mitk::NavigationDataToMessageFilter::New();\n \n \/\/ first test: did this work?\n \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\n \/\/ it makes no sense to continue without an object.\n MITK_TEST_CONDITION_REQUIRED(myFilter.IsNotNull(),\"Testing instantiation\");\n\n \/* create helper objects: navigation data with position as origin, zero quaternion, zero error and data valid *\/\n mitk::NavigationData::PositionType initialPos;\n mitk::FillVector3D(initialPos, 1.0, 2.0, 3.0);\n mitk::NavigationData::OrientationType initialOri(1.0, 2.0, 3.0, 4.0);\n \n mitk::NavigationData::Pointer nd1 = mitk::NavigationData::New();\n nd1->SetPosition(initialPos);\n nd1->SetOrientation(initialOri);\n nd1->SetPositionAccuracy(11.111);\n nd1->SetTimeStamp(64.46);\n nd1->SetDataValid(true);\n\n myFilter->SetInput(nd1);\n MITK_TEST_CONDITION(myFilter->GetInput() == nd1, \"testing Set-\/GetInput()\");\n \n mitk::NavigationData* output = myFilter->GetOutput();\n MITK_TEST_CONDITION_REQUIRED(output != NULL, \"Testing GetOutput()\");\n\n\n \/* register message receiver *\/\n MessageReceiverClass answers;\n myFilter->AddPositionChangedListener(mitk::MessageDelegate1<MessageReceiverClass, mitk::NavigationData::PositionType>(&answers, &MessageReceiverClass::OnPositionChanged));\n myFilter->AddOrientationChangedListener(mitk::MessageDelegate1<MessageReceiverClass, mitk::NavigationData::OrientationType>(&answers, &MessageReceiverClass::OnOrientationChanged));\n myFilter->AddErrorChangedListener(mitk::MessageDelegate1<MessageReceiverClass, mitk::NavigationData::CovarianceMatrixType>(&answers, &MessageReceiverClass::OnErrorChanged));\n myFilter->AddTimeStampChangedListener(mitk::MessageDelegate1<MessageReceiverClass, mitk::NavigationData::TimeStampType>(&answers, &MessageReceiverClass::OnTimeStampChanged));\n myFilter->AddDataValidChangedListener(mitk::MessageDelegate1<MessageReceiverClass, bool>(&answers, &MessageReceiverClass::OnDataValidChanged));\n\n\n output->Update(); \/\/ execute filter\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData->GetPosition(), nd1->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData->GetOrientation(), nd1->GetOrientation()), \"Testing OrientationChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData->GetCovErrorMatrix() == nd1->GetCovErrorMatrix(), \"Testing ErrorChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData->IsDataValid() == nd1->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 5, \"Correct number of messages send?\");\n \n \/* change one input parameter *\/\n nd1->SetDataValid(false);\n output->Update(); \/\/ re-execute filter\n MITK_TEST_CONDITION( answers.m_ReceivedData->IsDataValid() == nd1->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 6, \"only necessary messages send?\"); \/\/ only datavalid message re-send\n\n \/* changing two input parameters *\/ \n mitk::FillVector3D(initialPos, 11.0, 21.0, 31.0);\n nd1->SetPosition(initialPos); \/\/ change only one parameter\n nd1->SetTimeStamp(55.55); \/\/ change only one parameter\n output->Update(); \/\/ re-execute filter\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData->GetPosition(), nd1->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 8, \"only necessary messages send?\"); \/\/ only 2 new messages send\n\n \/* try to add a second input *\/\n MITK_TEST_OUTPUT_NO_ENDL( << \"Exception on adding second input? --> \");\n mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n MITK_TEST_FOR_EXCEPTION(std::invalid_argument, myFilter->SetInput(1, nd2));\n\n \/\/ always end with this!\n MITK_TEST_END();\n}\n<commit_msg>ENH (#2085): adapted test to changes in NavigationDataToMessageFilter. This test could not be compiled or executed yet, due to the build system reworking.<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nLanguage: C++\nDate: $Date: 2009-03-09 20:43:00 +0100 (Mo, 09 Mrz 2009) $\nVersion: $Revision: 16522 $\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"mitkNavigationDataToMessageFilter.h\"\n#include \"mitkNavigationData.h\"\n\n#include \"mitkTestingMacros.h\"\n#include \"mitkVector.h\"\n#include <iostream>\n\n\n\/\/ Receiver class remembers Messages received.\n\/\/ Will tell about received Messages when asked.\nclass MessageReceiverClass\n{\n public:\n\n MessageReceiverClass(unsigned int numberOfNavigationDatas)\n {\n for (unsigned int i = 0; i < numberOfNavigationDatas, ++i)\n m_ReceivedData[i] = mitk::NavigationData::New();\n \n m_MessagesReceived = 0;\n }\n\n void OnPositionChanged(mitk::NavigationData::PositionType v, unsigned int index)\n {\n m_ReceivedData[index]->SetPosition(v);\n ++m_MessagesReceived;\n }\n \n void OnOrientationChanged(mitk::NavigationData::OrientationType v, unsigned int index)\n {\n m_ReceivedData[index]->SetOrientation(v);\n ++m_MessagesReceived;\n }\n\n void OnErrorChanged(mitk::NavigationData::CovarianceMatrixType v, unsigned int index)\n {\n m_ReceivedData[index]->SetCovErrorMatrix(v);\n ++m_MessagesReceived;\n }\n \n void OnTimeStampChanged(mitk::NavigationData::TimeStampType v, unsigned int index)\n {\n m_ReceivedData[index]->SetTimeStamp(v);\n ++m_MessagesReceived;\n }\n\n void OnDataValidChanged(bool v, unsigned int index)\n {\n m_ReceivedData[index]->SetDataValid(v);\n ++m_MessagesReceived;\n }\n\n std::vector<mitk::NavigationData::Pointer> m_ReceivedData;\n int m_MessagesReceived;\n};\n\n\/**Documentation\n * test for the class \"NavigationDataToMessageFilter\".\n *\/\nint mitkNavigationDataToMessageFilterTest(int \/* argc *\/, char* \/*argv*\/[])\n{\n MITK_TEST_BEGIN(\"NavigationDataToMessageFilter\");\n \/* first tests with one input *\/\n { \n \/\/ let's create an object of our class \n mitk::NavigationDataToMessageFilter::Pointer myFilter = mitk::NavigationDataToMessageFilter::New();\n\n \/\/ first test: did this work?\n \/\/ using MITK_TEST_CONDITION_REQUIRED makes the test stop after failure, since\n \/\/ it makes no sense to continue without an object.\n MITK_TEST_CONDITION_REQUIRED(myFilter.IsNotNull(),\"Testing instantiation\");\n\n \/* create helper objects: navigation data with position as origin, zero quaternion, zero error and data valid *\/\n mitk::NavigationData::PositionType initialPos;\n mitk::FillVector3D(initialPos, 1.0, 2.0, 3.0);\n mitk::NavigationData::OrientationType initialOri(1.0, 2.0, 3.0, 4.0);\n\n mitk::NavigationData::Pointer nd1 = mitk::NavigationData::New();\n nd1->SetPosition(initialPos);\n nd1->SetOrientation(initialOri);\n nd1->SetPositionAccuracy(11.111);\n nd1->SetTimeStamp(64.46);\n nd1->SetDataValid(true);\n\n myFilter->SetInput(nd1);\n MITK_TEST_CONDITION(myFilter->GetInput() == nd1, \"testing Set-\/GetInput()\");\n\n mitk::NavigationData* output = myFilter->GetOutput();\n MITK_TEST_CONDITION_REQUIRED(output != NULL, \"Testing GetOutput()\");\n\n\n \/* register message receiver *\/\n MessageReceiverClass answers(1);\n myFilter->AddPositionChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::PositionType, unsigned int>(&answers, &MessageReceiverClass::OnPositionChanged));\n myFilter->AddOrientationChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::OrientationType, unsigned int>(&answers, &MessageReceiverClass::OnOrientationChanged));\n myFilter->AddErrorChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::CovarianceMatrixType, unsigned int>(&answers, &MessageReceiverClass::OnErrorChanged));\n myFilter->AddTimeStampChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::TimeStampType, unsigned int>(&answers, &MessageReceiverClass::OnTimeStampChanged));\n myFilter->AddDataValidChangedListener(mitk::MessageDelegate2<MessageReceiverClass, bool, unsigned int>(&answers, &MessageReceiverClass::OnDataValidChanged));\n\n\n output->Update(); \/\/ execute filter\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetPosition(), nd1->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetOrientation(), nd1->GetOrientation()), \"Testing OrientationChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->GetCovErrorMatrix() == nd1->GetCovErrorMatrix(), \"Testing ErrorChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->IsDataValid() == nd1->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 5, \"Correct number of messages send?\");\n\n \/* change one input parameter *\/\n nd1->SetDataValid(false);\n output->Update(); \/\/ re-execute filter\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->IsDataValid() == nd1->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 6, \"only necessary messages send?\"); \/\/ only datavalid message re-send\n\n \/* changing two input parameters *\/ \n mitk::FillVector3D(initialPos, 11.0, 21.0, 31.0);\n nd1->SetPosition(initialPos); \/\/ change only one parameter\n nd1->SetTimeStamp(55.55); \/\/ change only one parameter\n output->Update(); \/\/ re-execute filter\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetPosition(), nd1->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 8, \"only necessary messages send?\"); \/\/ only 2 new messages send\n\n \/* try to add a second input *\/\n \/\/MITK_TEST_OUTPUT_NO_ENDL( << \"Exception on adding second input? --> \");\n \/\/mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n \/\/MITK_TEST_FOR_EXCEPTION(std::invalid_argument, myFilter->SetInput(1, nd2));\n\n }\n \/* now test with multiple inputs *\/\n {\n MITK_TEST_OUTPUT( << \"Now, perform tests with multiple inputs\");\n\n mitk::NavigationDataToMessageFilter::Pointer myFilter = mitk::NavigationDataToMessageFilter::New();\n\n \/* create helper objects: navigation data with position as origin, zero quaternion, zero error and data valid *\/\n mitk::NavigationData::PositionType initialPos;\n mitk::FillVector3D(initialPos, 1.0, 1.0, 1.0);\n mitk::NavigationData::OrientationType initialOri(1.0, 1.0, 1.0, 1.0);\n\n mitk::NavigationData::Pointer nd0 = mitk::NavigationData::New();\n nd0->SetPosition(initialPos);\n nd0->SetOrientation(initialOri);\n nd0->SetPositionAccuracy(11.111);\n nd0->SetTimeStamp(64.46);\n nd0->SetDataValid(true);\n\n mitk::FillVector3D(initialPos, 2.0, 2.0, 2.0);\n mitk::NavigationData::OrientationType initialOri2(1.0, 1.0, 1.0, 1.0)\n mitk::NavigationData::Pointer nd1 = mitk::NavigationData::New();\n nd1->SetPosition(initialPos);\n nd1->SetOrientation(initialOri2);\n nd1->SetPositionAccuracy(22.222);\n nd1->SetTimeStamp(222.2);\n nd1->SetDataValid(false);\n \n myFilter->SetInput(0, nd0);\n myFilter->SetInput(1, nd1);\n MITK_TEST_CONDITION(myFilter->GetInput(0) == nd0, \"testing Set-\/GetInput(0)\");\n MITK_TEST_CONDITION(myFilter->GetInput(1) == nd1, \"testing Set-\/GetInput(1)\");\n\n mitk::NavigationData* output0 = myFilter->GetOutput(0);\n mitk::NavigationData* output1 = myFilter->GetOutput(1);\n MITK_TEST_CONDITION_REQUIRED(output != NULL, \"Testing GetOutput(0)\");\n MITK_TEST_CONDITION_REQUIRED(output != NULL, \"Testing GetOutput(1)\");\n\n \/* register message receiver *\/\n MessageReceiverClass answers(2);\n myFilter->AddPositionChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::PositionType, unsigned int>(&answers, &MessageReceiverClass::OnPositionChanged));\n myFilter->AddOrientationChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::OrientationType, unsigned int>(&answers, &MessageReceiverClass::OnOrientationChanged));\n myFilter->AddErrorChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::CovarianceMatrixType, unsigned int>(&answers, &MessageReceiverClass::OnErrorChanged));\n myFilter->AddTimeStampChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::TimeStampType, unsigned int>(&answers, &MessageReceiverClass::OnTimeStampChanged));\n myFilter->AddDataValidChangedListener(mitk::MessageDelegate2<MessageReceiverClass, bool, unsigned int>(&answers, &MessageReceiverClass::OnDataValidChanged));\n\n output0->Update(); \/\/ execute filter. This should send messages for both inputs\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetPosition(), nd0->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetOrientation(), nd0->GetOrientation()), \"Testing OrientationChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->GetCovErrorMatrix() == nd0->GetCovErrorMatrix(), \"Testing ErrorChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[0]->GetTimeStamp(), nd0->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->IsDataValid() == nd0->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[1]->GetPosition(), nd1->GetPosition()), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[1]->GetOrientation(), nd1->GetOrientation()), \"Testing OrientationChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[1]->GetCovErrorMatrix() == nd1->GetCovErrorMatrix(), \"Testing ErrorChanged message\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[1]->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing TimeStampChanged message\");\n MITK_TEST_CONDITION( answers.m_ReceivedData[1]->IsDataValid() == nd1->IsDataValid(), \"Testing PositionChanged message\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 10, \"Correct number of messages send?\");\n\n \/* change one input parameter *\/\n nd0->SetDataValid(false);\n output0->Update(); \/\/ re-execute filter\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->IsDataValid() == nd0->IsDataValid(), \"Testing PositionChanged message for input 0\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 11, \"only necessary messages send?\"); \/\/ only datavalid message for input 0 re-send\n\n \/* remove one listener and check that message is not send *\/\n myFilter->RemoveTimeStampChangedListener(mitk::MessageDelegate2<MessageReceiverClass, mitk::NavigationData::TimeStampType, unsigned int>(&answers, &MessageReceiverClass::OnTimeStampChanged));\n mitk::NavigationData::TimeStampType oldValue = nd1->GetTimeStamp();\n nd1->SetTimeStamp(999.9);\n myFilter->Update();\n MITK_TEST_CONDITION( ! mitk::Equal(answers.m_ReceivedData[1]->GetTimeStamp(), nd1->GetTimeStamp()), \"Testing if TimeStamp message is _not_ send after RemoveListener (!= new value)\");\n MITK_TEST_CONDITION( mitk::Equal(answers.m_ReceivedData[1]->GetTimeStamp(), oldValue), \"Testing if TimeStamp message is _not_ send after RemoveListener (== old value)\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 11, \"no new messages send?\"); \/\/ no new message send?\n \/* other messages are still send? *\/\n nd1->SetDataValid(true);\n myFilter->Update();\n MITK_TEST_CONDITION( answers.m_ReceivedData[1]->IsDataValid() == nd1->IsDataValid(), \"Other messages still send? ->Testing PositionChanged message for input 1 again\");\n MITK_TEST_CONDITION( answers.m_MessagesReceived == 12, \"only necessary messages send?\"); \/\/ only DataValid message for input 1 re-send\n \/* check if other output still has its old value *\/\n MITK_TEST_CONDITION( answers.m_ReceivedData[0]->IsDataValid() == nd0->IsDataValid(), \"Testing PositionChanged message for input 0\");\n }\n \/\/ The end\n MITK_TEST_END();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n \n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Modules\/Legacy\/Fields\/CalculateSignedDistanceToField.h>\n#include <Core\/Datatypes\/Field.h>\n\n#include <Core\/Algorithms\/Legacy\/Fields\/DistanceField\/CalculateSignedDistanceField.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Fields;\n\nCalculateSignedDistanceToField::CalculateSignedDistanceToField()\n : Module(ModuleLookupInfo(\"CalculateSignedDistanceToField\", \"ChangeFieldData\", \"SCIRun\"))\n{\n}\n\nvoid CalculateSignedDistanceToField::execute()\n{\n FieldHandle input, output, value;\n FieldHandle object;\n \n get_input_handle(\"Field\",input,true);\n get_input_handle(\"ObjectField\",object,true);\n \n bool value_connected = oport_connected(\"ValueField\");\n \n if (inputs_changed_ || !oport_cached(\"SignedDistanceField\") ||\n (!oport_cached(\"ValueField\") && value_connected))\n {\n update_state(Executing);\n \n if (value_connected)\n {\n if(!(algo_.run(input,object,output,value))) return;\n \n send_output_handle(\"SignedDistanceField\", output); \n send_output_handle(\"ValueField\", value); \n }\n else\n {\n if(!(algo_.run(input,object,output))) return;\n \n send_output_handle(\"SignedDistanceField\", output); \n }\n }\n}\n\n\n<commit_msg>Include path<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n \n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Modules\/Legacy\/Fields\/CalculateSignedDistanceToField.h>\n#include <Core\/Datatypes\/Legacy\/Field\/Field.h>\n\n#include <Core\/Algorithms\/Legacy\/Fields\/DistanceField\/CalculateSignedDistanceField.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Fields;\n\nCalculateSignedDistanceToField::CalculateSignedDistanceToField()\n : Module(ModuleLookupInfo(\"CalculateSignedDistanceToField\", \"ChangeFieldData\", \"SCIRun\"))\n{\n}\n\nvoid CalculateSignedDistanceToField::execute()\n{\n FieldHandle input, output, value;\n FieldHandle object;\n \n get_input_handle(\"Field\",input,true);\n get_input_handle(\"ObjectField\",object,true);\n \n bool value_connected = oport_connected(\"ValueField\");\n \n if (inputs_changed_ || !oport_cached(\"SignedDistanceField\") ||\n (!oport_cached(\"ValueField\") && value_connected))\n {\n update_state(Executing);\n \n if (value_connected)\n {\n if(!(algo_.run(input,object,output,value))) return;\n \n send_output_handle(\"SignedDistanceField\", output); \n send_output_handle(\"ValueField\", value); \n }\n else\n {\n if(!(algo_.run(input,object,output))) return;\n \n send_output_handle(\"SignedDistanceField\", output); \n }\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Arduino.h\"\n#include <Servo.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"Systems\/Comm.h\"\n#include \"Systems\/Controller.h\"\n\n#include \"Core.h\"\n\nextern const int armConfig[CONTROLLER_ARM_COUNT][6] = {\n { 9, 8, 770 , 2000, 950 , 2400},\n {10, 11, 800 , 2000, 2000, 850},\n {13, 12, 1110, 2000, 2000, 850},\n {19, 20, 750 , 2000, 950 , 2400}\n};\n\nvoid Core::init() \n{\n\tcomm.init();\n\tcontrol.init(&comm);\n\n\tfor (int i = 0; i < CONTROLLER_ARM_COUNT; i++) \n\t{\n\t\tcontrol.defineArm(i, armConfig[i]);\n\t\tcontrol.setVPosition(i, CONTROLLER_ARMX_DOWN);\n\t}\n}\n\nvoid Core::loop()\n{\n\tCommand* command = comm.recvCommand();\n\tif (command != NULL) \n\t{\n\t\tparseControlCommand(command);\t\n\t}\n}\n\nvoid Core::parseControlCommand(Command* cmd) \n{\n\tif (strcmp(cmd->key, \"Controller@setVPosition\") == 0)\n\t{\n\t\tunsigned int armdId;\n\t\tunsigned int position;\n\t\tif (sscanf(cmd->val, \"%u %u\", &armdId, &position))\n\t\t{\n\t\t\tcontrol.setVPosition(armdId, position);\n\t\t}\n\t}\n\telse if (strcmp(cmd->key, \"Controller@setHPosition\") == 0)\n\t{\n\t\tunsigned int armdId;\n\t\tunsigned int position;\n\t\tif (sscanf(cmd->val, \"%u %u\", &armdId, &position))\n\t\t{\n\t\t\tcontrol.setHPosition(armdId, position);\n\t\t}\n\t}\n}\n<commit_msg>Changed servos pins<commit_after>#include \"Arduino.h\"\n#include <Servo.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"Systems\/Comm.h\"\n#include \"Systems\/Controller.h\"\n\n#include \"Core.h\"\n\nextern const int armConfig[CONTROLLER_ARM_COUNT][6] = {\n { 3, 2, 770 , 2000, 950 , 2400},\n { 4, 5, 800 , 2000, 2000, 850},\n { 7, 6, 1110, 2000, 2000, 850},\n {19, 20, 750 , 2000, 950 , 2400}\n};\n\nvoid Core::init() \n{\n\tcomm.init();\n\tcontrol.init(&comm);\n\n\tfor (int i = 0; i < CONTROLLER_ARM_COUNT; i++) \n\t{\n\t\tcontrol.defineArm(i, armConfig[i]);\n\t\tcontrol.setVPosition(i, CONTROLLER_ARMX_DOWN);\n\t}\n}\n\nvoid Core::loop()\n{\n\tCommand* command = comm.recvCommand();\n\tif (command != NULL) \n\t{\n\t\tparseControlCommand(command);\t\n\t}\n}\n\nvoid Core::parseControlCommand(Command* cmd) \n{\n\tif (strcmp(cmd->key, \"Controller@setVPosition\") == 0)\n\t{\n\t\tunsigned int armdId;\n\t\tunsigned int position;\n\t\tif (sscanf(cmd->val, \"%u %u\", &armdId, &position))\n\t\t{\n\t\t\tcontrol.setVPosition(armdId, position);\n\t\t}\n\t}\n\telse if (strcmp(cmd->key, \"Controller@setHPosition\") == 0)\n\t{\n\t\tunsigned int armdId;\n\t\tunsigned int position;\n\t\tif (sscanf(cmd->val, \"%u %u\", &armdId, &position))\n\t\t{\n\t\t\tcontrol.setHPosition(armdId, position);\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n* @file ObstacleModel.cpp\n*\n* @author <a href=\"mailto:schlottb@informatik.hu-berlin.de\">Schlotter, Benjamin<\/a>\n* Implementation of class ObstacleModel\n*\n*\/\n\n#include \"ObstacleModel.h\"\n#include <limits>\n\nObstacle::Obstacle()\n : center(0),\n shape_points(Math::Polygon<double>())\n{\n}\n\n\nvoid ObstacleModel::print(std::ostream& stream) const\n{\n stream << \"== Obstacles ==\" << std::endl;\n stream<<\"leftDistance = \"<< leftDistance << std::endl;\n stream<<\"rightDistance = \"<< rightDistance << std::endl;\n stream<<\"frontDistance = \"<< frontDistance << std::endl;\n stream<<\"blockedTime = \"<< blockedTime << std::endl;\n}\n\nObstacleModel::ObstacleModel()\n : leftDistance(std::numeric_limits<double>::max()),\n rightDistance(std::numeric_limits<double>::max()),\n frontDistance(std::numeric_limits<double>::max()),\n blockedTime(-1)\n{\n}\n\n\n<commit_msg>fix compile bug in obstaclemodel<commit_after>\/**\n* @file ObstacleModel.cpp\n*\n* @author <a href=\"mailto:schlottb@informatik.hu-berlin.de\">Schlotter, Benjamin<\/a>\n* Implementation of class ObstacleModel\n*\n*\/\n\n#include \"ObstacleModel.h\"\n#include <limits>\n\nObstacle::Obstacle()\n : center(Vector2d()),\n shape_points(Math::Polygon<double>())\n{\n}\n\n\nvoid ObstacleModel::print(std::ostream& stream) const\n{\n stream << \"== Obstacles ==\" << std::endl;\n stream<<\"leftDistance = \"<< leftDistance << std::endl;\n stream<<\"rightDistance = \"<< rightDistance << std::endl;\n stream<<\"frontDistance = \"<< frontDistance << std::endl;\n stream<<\"blockedTime = \"<< blockedTime << std::endl;\n}\n\nObstacleModel::ObstacleModel()\n : leftDistance(std::numeric_limits<double>::max()),\n rightDistance(std::numeric_limits<double>::max()),\n frontDistance(std::numeric_limits<double>::max()),\n blockedTime(-1)\n{\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n\n#include \"World.h\"\n#include \"Renderer.h\"\n#include \"Rasterizer.h\"\n#include \"Camera.h\"\n#include \"Light.h\"\n#include \"OrthographicCamera.h\"\n\nconst Point3D CAMERA_POS = Point3D(.0f, .0f, -10.0f);\nconst Vector3D CAMERA_FWD = Vector3D(.0f, .0f, 1.0f); \/\/ Points into the screen\nconst Vector3D CAMERA_UP = Vector3D(.0f, 1.0f, .0f);\n\nconst int IMAGE_WIDTH = 640;\nconst int IMAGE_HEIGHT = 480;\nconst std::string IMAGE_NAME = \"output.bmp\";\n\nconst std::vector<GeometryObject*> OBJECTS {\n\n};\n\nconst std::vector<Light*> LIGHTS {\n\n};\n\nint main (){\n Camera * camera = new OrthographicCamera(CAMERA_POS, CAMERA_FWD, CAMERA_UP);\n World * world = new World(OBJECTS, LIGHTS, camera);\n Renderer * renderer = new Rasterizer(world, IMAGE_WIDTH, IMAGE_HEIGHT);\n renderer->render(IMAGE_NAME);\n \n return 0;\n}<commit_msg>Added default geometry object for testing<commit_after>#include <iostream>\n#include <vector>\n\n#include \"World.h\"\n#include \"Renderer.h\"\n#include \"Rasterizer.h\"\n#include \"Camera.h\"\n#include \"Light.h\"\n#include \"OrthographicCamera.h\"\n\nconst Point3D CAMERA_POS = Point3D(.0f, .0f, -10.0f);\nconst Vector3D CAMERA_FWD = Vector3D(.0f, .0f, 1.0f); \/\/ Points into the screen\nconst Vector3D CAMERA_UP = Vector3D(.0f, 1.0f, .0f);\n\nconst int IMAGE_WIDTH = 640;\nconst int IMAGE_HEIGHT = 480;\nconst std::string IMAGE_NAME = \"output.bmp\";\n\nconst std::vector<GeometryObject*> OBJECTS {\n new GeometryObject()\n};\n\nconst std::vector<Light*> LIGHTS {\n\n};\n\nint main (){\n Camera * camera = new OrthographicCamera(CAMERA_POS, CAMERA_FWD, CAMERA_UP);\n World * world = new World(OBJECTS, LIGHTS, camera);\n Renderer * renderer = new Rasterizer(world, IMAGE_WIDTH, IMAGE_HEIGHT);\n renderer->render(IMAGE_NAME);\n \n return 0;\n}<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include \"omp.h\"\n\n\/\/ Contains the various options the user can pass ptgz.\nstruct Settings {\n\tSettings(): extract(),\n\t\t\t\tcompress(),\n \t\t\t\tverbose(),\n\t\t\t\tkeep(),\n\t\t\t\toutput() {}\n\tbool extract;\n\tbool compress;\n\tbool verbose;\n\tbool keep;\n\tbool output;\n\tstd::string name;\n};\n\n\/\/ Checks if the user asks for help.\n\/\/ Provides usage information to the user.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\nvoid helpCheck(int argc, char *argv[]) {\n\tif (argc == 1) {\n\t\tstd::cout << \"ERROR: ptgz was passed no parameters. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t}\n\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptgz - Parallel Tar GZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\tstd::cout << \" ptgz is a custom multi-threaded C++ file archiving utility to quickly bundle millions of files in \\n\";\n\t\tstd::cout << \" terrabyte sized directories into a single file. ptgz was developed at the National Center for \\n\";\n\t\tstd::cout << \" Supercomputing Applications.\\n\" << std::endl;\n\t\tstd::cout << \" Usage:\\n\";\n\t\tstd::cout << \" If you are compressing, your current working directory should be parent directory of all directories you\\n\";\n\t\tstd::cout << \" want to archive. If you are extracting, your current working directory should be the same as your archive.\\n\" << std::endl;\n\t\tstd::cout << \" ptgz [-c|-k|-v|-x] <archive>\\n\" << std::endl;\n\t\tstd::cout << \" Modes:\\n\";\n\t\tstd::cout << \" -c Compression ptgz will perform file compression. The current directory and all of it's\\n\";\n\t\tstd::cout << \" children will be archived and added to a single tarball. <archive> will be \\n\";\n\t\tstd::cout << \" prefix of the ptgz archive created.\\n\" << std::endl;\n\t\tstd::cout << \" -k Keep Archive ptgz will not delete the ptgz archive it has been passed to extract. \\\"-x\\\" \\n\";\n\t\tstd::cout << \" must also be used to use this option.\\n\" << std::endl;\n\t\tstd::cout << \" -v Enable Verbose ptgz will print the commands as they are called to STDOUT\\n\" << std::endl;\n\t\tstd::cout << \" -x Extraction ptgz will perform file extraction from an archive. The passed ptgz archive\\n\";\n\t\tstd::cout << \" will be unpacked and split into its component files. <archive> should be the\\n\";\n\t\tstd::cout << \" the name of the archive to extract.\" << std::endl;\n\t\texit(0);\n\t}\n}\n\n\/\/ Gets the parameters passed by the user and stores them.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\n\/\/ \t\t\t instance (Settings *) user argument storage.\nvoid getSettings(int argc, char *argv[], Settings *instance) {\n\t\/\/ Get all passed arguments\n\tstd::queue<std::string> settings;\n\tfor (int i = 1; i < argc; ++i) {\n\t\tsettings.push(argv[i]);\n\t}\n\t\n\t\/\/ Continue to check until there are no more passed arguments.\n\twhile (!settings.empty()) {\n\t\tstd::string arg = settings.front();\n\n\t\tif (arg == \"-x\") {\n\t\t\tif ((*instance).compress) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).extract = true;\n\t\t} else if (arg == \"-c\") {\n\t\t\tif ((*instance).extract) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).compress = true;\n\t\t} else if (arg == \"-v\"){\n\t\t\t(*instance).verbose = true;\n\t\t} else if (arg == \"-o\") {\n\t\t\t(*instance).output = true;\n\t\t} else if (arg == \"-k\") {\n\t\t\t(*instance).keep = true;\n\t\t} else {\n\t\t\tif (settings.size() > 1) {\n\t\t\t\tstd::cout << \"ERROR: ptgz was called incorrectly. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).output = true;\n\t\t\t(*instance).name = arg;\n\t\t}\n\n\t\tsettings.pop();\n\t}\n\n\tif (!(*instance).output) {\n\t\tstd::cout << \"ERROR: No output file name given. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t} else if ((*instance).keep && !(*instance).extract) {\n\t\tstd::cout << \"ERROR: Can't use keep option without extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t}\n}\n\n\/\/ Finds the number of files in the space to store.\n\/\/ Parameters: numFiles (int *) number of files.\n\/\/ \t\t\t cwd (const char *) current working directory.\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Gets the paths for all files in the space to store.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t cwd (const char *) current working directory.\n\/\/ \t\t\t rootPath (std::string) path from the root of the directory to be stored.\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Divides files into blocks.\n\/\/ Compresses each block into a single file.\n\/\/ Combines all compressed blocks into a single file.\n\/\/ Removes temporary blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) user given name for storage file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\nvoid compression(std::vector<std::string> *filePaths, std::string name, bool verbose) {\n\tstd::random_shuffle(filePaths->begin(), filePaths->end());\n\tunsigned long long int filePathSize = filePaths->size();\n\tunsigned long long int blockSize = (filePathSize \/ (omp_get_max_threads() * 10)) + 1;\n\tstd::vector<std::string> *tarNames = new std::vector<std::string>(filePathSize \/ blockSize + 1);\n\t\n\t\/\/ Gzips the blocks of files into a single compressed file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < omp_get_max_threads() * 10; ++i) {\n\t\tunsigned long long int start = blockSize * i;\n\t\tif (start < filePathSize) {\n\t\t\t\/\/ Store the name of each file for a block owned by each thread.\n\t\t\t\/\/ Each thread will use the file to tar and gzip compress their block.\n\t\t\tstd::ofstream tmp;\n\t\t\ttmp.open(std::to_string(i) + \".\" + name + \".ptgz.tmp\", std::ios_base::app);\n\t\t\tstd::string gzCommand = \"GZIP=-1 tar -cz -T \" + std::to_string(i) + \".\" + name + \".ptgz.tmp -f \" + std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t\tfor (unsigned long long int j = start; j < std::min(start + blockSize, filePathSize); ++j) {\n\t\t\t\ttmp << filePaths->at(j) + \"\\n\";\n\t\t\t}\n\t\n\t\t\tif (verbose) {\n\t\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t\t}\n\n\t\t\ttmp.close();\n\t\t\tsystem(gzCommand.c_str());\n\t\t\ttarNames->at(i) = std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t}\n\t}\n\n\t\/\/ Combines gzipped blocks together into a single tarball.\n\t\/\/ Write tarball names into an idx file for extraction.\n\tstd::ofstream idx, tmp;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::app);\n\tstd::string tarCommand = \"tar -c -T \" + name + \".ptgz.idx -f \" + name + \".ptgz.tar\";\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tidx << tarNames->at(i) + \"\\n\";\n\t}\n\tidx << name + \".ptgz.idx\" + \"\\n\";\n\tidx.close();\n\t\n\tif (verbose) {\n\t\tstd::cout << tarCommand + \"\\n\";\n\t}\n\t\n\tsystem(tarCommand.c_str());\n\n\t\/\/ Removes all temporary blocks and idx file.\n\t#pragma omp parallel for schedule(static)\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tstd::string rmCommand = tarNames->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(rmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t}\n\t\t\n\n\t\trmCommand = std::to_string(i) + \".\" + name + \".ptgz.tmp\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(rmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t}\n\t}\n\n\tstd::string rmCommand;\n\tif (verbose) {\n\t\tstd::cout << \"remove(\" + name + \".ptgz.idx)\\n\";\n\t}\n\trmCommand = name + \".ptgz.idx\";\n\tif (remove(rmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t}\n\n\ttarNames->clear();\n\tdelete(tarNames);\n}\n\n\/\/ Unpacks the archive.\n\/\/ Reads in all the files from the index file.\n\/\/ Unpacks each file.\n\/\/ Deletes all temporary file blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) name of ptgz archive file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\n\/\/ \t\t\t keep (bool) user option for keeping ptgz archive.\nvoid extraction(std::vector<std::string> *filePaths, std::string name, bool verbose, bool keep) {\n\t\/\/ Unpack the 1st layer tarball\n\tstd::string exCommand = \"tar xf \" + name;\n\tif (verbose) {\n\t\tstd::cout << exCommand + \"\\n\";\n\t}\n\tsystem(exCommand.c_str());\n\n\t\/\/ Get the name from the name of the 1st layer tarball\n\tfor (int i = 0; i < 9; ++i) {\n\t\tname.pop_back();\n\t}\n\n\t\/\/ Read in all tar.gz files form the ptgz.idx file\n\t\/\/ Delete the ptgz.idx file\n\tstd::ifstream idx;\n\tstd::string line;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::in);\n\twhile (std::getline(idx, line)) {\n\t\tfilePaths->push_back(line);\n\t}\n\tidx.close();\n\tstd::string idxRmCommand = filePaths->back();\n\tremove(idxRmCommand.c_str());\n\tfilePaths->pop_back();\n\n\t\/\/ Unpack each tar.gz file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzCommand = \"tar xzf \" + filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t}\n\t\tsystem(gzCommand.c_str());\n\t}\n\n\t\/\/ Delete each tar.gz file\n\t#pragma omp parallel for schedule(static)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzRmCommand = filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + gzRmCommand + \")\\n\";\n\t\t}\n\t\tremove(gzRmCommand.c_str());\n\t}\n\t\n\t\/\/ Decided whether or not to keep the ptgz.tar archive\n\tif (!keep) {\n\t\tstd::string tarRmCommand = name + \".ptgz.tar\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + tarRmCommand + \")\\n\";\n\t\t}\n\t\tremove(tarRmCommand.c_str());\n\t}\n}\n\nchar cwd [PATH_MAX];\n\n\/\/ Checks to see if the user asks for help.\n\/\/ Gathers the user provided settings for ptgz.\n\/\/ Finds the number of files that need to be stored.\n\/\/ Gathers the file paths of all files to be stored.\n\/\/ Either compresses the files or extracts the ptgz.tar archive.\nint main(int argc, char *argv[]) {\n\tSettings *instance = new Settings;\n\tint *numFiles = new int(0);\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\t\n\thelpCheck(argc, argv);\n\tgetSettings(argc, argv, instance);\n\tgetcwd(cwd, PATH_MAX);\n\n\tif ((*instance).compress) {\n\t\tfindAll(numFiles, cwd);\n\t\tgetPaths(filePaths, cwd, \"\");\n\t\tcompression(filePaths, (*instance).name, (*instance).verbose);\n\t} else {\n\t\textraction(filePaths, (*instance).name, (*instance).verbose, (*instance).keep);\n\t}\n\n\tdelete(instance);\n\tdelete(numFiles);\n\tfilePaths->clear();\n\tdelete(filePaths);\n\treturn 0;\n}\n<commit_msg>bug hunting in tmp files<commit_after>#include <stdlib.h>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include \"omp.h\"\n\n\/\/ Contains the various options the user can pass ptgz.\nstruct Settings {\n\tSettings(): extract(),\n\t\t\t\tcompress(),\n \t\t\t\tverbose(),\n\t\t\t\tkeep(),\n\t\t\t\toutput() {}\n\tbool extract;\n\tbool compress;\n\tbool verbose;\n\tbool keep;\n\tbool output;\n\tstd::string name;\n};\n\n\/\/ Checks if the user asks for help.\n\/\/ Provides usage information to the user.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\nvoid helpCheck(int argc, char *argv[]) {\n\tif (argc == 1) {\n\t\tstd::cout << \"ERROR: ptgz was passed no parameters. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t}\n\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptgz - Parallel Tar GZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\tstd::cout << \" ptgz is a custom multi-threaded C++ file archiving utility to quickly bundle millions of files in \\n\";\n\t\tstd::cout << \" terrabyte sized directories into a single file. ptgz was developed at the National Center for \\n\";\n\t\tstd::cout << \" Supercomputing Applications.\\n\" << std::endl;\n\t\tstd::cout << \" Usage:\\n\";\n\t\tstd::cout << \" If you are compressing, your current working directory should be parent directory of all directories you\\n\";\n\t\tstd::cout << \" want to archive. If you are extracting, your current working directory should be the same as your archive.\\n\" << std::endl;\n\t\tstd::cout << \" ptgz [-c|-k|-v|-x] <archive>\\n\" << std::endl;\n\t\tstd::cout << \" Modes:\\n\";\n\t\tstd::cout << \" -c Compression ptgz will perform file compression. The current directory and all of it's\\n\";\n\t\tstd::cout << \" children will be archived and added to a single tarball. <archive> will be \\n\";\n\t\tstd::cout << \" prefix of the ptgz archive created.\\n\" << std::endl;\n\t\tstd::cout << \" -k Keep Archive ptgz will not delete the ptgz archive it has been passed to extract. \\\"-x\\\" \\n\";\n\t\tstd::cout << \" must also be used to use this option.\\n\" << std::endl;\n\t\tstd::cout << \" -v Enable Verbose ptgz will print the commands as they are called to STDOUT\\n\" << std::endl;\n\t\tstd::cout << \" -x Extraction ptgz will perform file extraction from an archive. The passed ptgz archive\\n\";\n\t\tstd::cout << \" will be unpacked and split into its component files. <archive> should be the\\n\";\n\t\tstd::cout << \" the name of the archive to extract.\" << std::endl;\n\t\texit(0);\n\t}\n}\n\n\/\/ Gets the parameters passed by the user and stores them.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\n\/\/ \t\t\t instance (Settings *) user argument storage.\nvoid getSettings(int argc, char *argv[], Settings *instance) {\n\t\/\/ Get all passed arguments\n\tstd::queue<std::string> settings;\n\tfor (int i = 1; i < argc; ++i) {\n\t\tsettings.push(argv[i]);\n\t}\n\t\n\t\/\/ Continue to check until there are no more passed arguments.\n\twhile (!settings.empty()) {\n\t\tstd::string arg = settings.front();\n\n\t\tif (arg == \"-x\") {\n\t\t\tif ((*instance).compress) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).extract = true;\n\t\t} else if (arg == \"-c\") {\n\t\t\tif ((*instance).extract) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).compress = true;\n\t\t} else if (arg == \"-v\"){\n\t\t\t(*instance).verbose = true;\n\t\t} else if (arg == \"-o\") {\n\t\t\t(*instance).output = true;\n\t\t} else if (arg == \"-k\") {\n\t\t\t(*instance).keep = true;\n\t\t} else {\n\t\t\tif (settings.size() > 1) {\n\t\t\t\tstd::cout << \"ERROR: ptgz was called incorrectly. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).output = true;\n\t\t\t(*instance).name = arg;\n\t\t}\n\n\t\tsettings.pop();\n\t}\n\n\tif (!(*instance).output) {\n\t\tstd::cout << \"ERROR: No output file name given. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t} else if ((*instance).keep && !(*instance).extract) {\n\t\tstd::cout << \"ERROR: Can't use keep option without extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t}\n}\n\n\/\/ Finds the number of files in the space to store.\n\/\/ Parameters: numFiles (int *) number of files.\n\/\/ \t\t\t cwd (const char *) current working directory.\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Gets the paths for all files in the space to store.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t cwd (const char *) current working directory.\n\/\/ \t\t\t rootPath (std::string) path from the root of the directory to be stored.\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Divides files into blocks.\n\/\/ Compresses each block into a single file.\n\/\/ Combines all compressed blocks into a single file.\n\/\/ Removes temporary blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) user given name for storage file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\nvoid compression(std::vector<std::string> *filePaths, std::string name, bool verbose) {\n\tstd::random_shuffle(filePaths->begin(), filePaths->end());\n\tunsigned long long int filePathSize = filePaths->size();\n\tunsigned long long int blockSize = (filePathSize \/ (omp_get_max_threads() * 10)) + 1;\n\tstd::vector<std::string> *tarNames = new std::vector<std::string>(filePathSize \/ blockSize + 1);\n\t\n\t\/\/ Gzips the blocks of files into a single compressed file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < omp_get_max_threads() * 10; ++i) {\n\t\tunsigned long long int start = blockSize * i;\n\t\tif (start < filePathSize) {\n\t\t\t\/\/ Store the name of each file for a block owned by each thread.\n\t\t\t\/\/ Each thread will use the file to tar and gzip compress their block.\n\t\t\tstd::ofstream tmp;\n\t\t\ttmp.open(std::to_string(i) + \".\" + name + \".ptgz.tmp\", std::ios_base::app);\n\t\t\tstd::string gzCommand = \"GZIP=-1 tar -cz -T \" + std::to_string(i) + \".\" + name + \".ptgz.tmp -f \" + std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t\tfor (unsigned long long int j = start; j < std::min(start + blockSize, filePathSize); ++j) {\n\t\t\t\ttmp << filePaths->at(j) + \"\\n\";\n\t\t\t}\n\t\n\t\t\tif (verbose) {\n\t\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t\t}\n\n\t\t\ttmp.close();\n\t\t\tsystem(gzCommand.c_str());\n\t\t\ttarNames->at(i) = std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t}\n\t}\n\n\t\/\/ Combines gzipped blocks together into a single tarball.\n\t\/\/ Write tarball names into an idx file for extraction.\n\tstd::ofstream idx, tmp;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::app);\n\tstd::string tarCommand = \"tar -c -T \" + name + \".ptgz.idx -f \" + name + \".ptgz.tar\";\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tidx << tarNames->at(i) + \"\\n\";\n\t}\n\tidx << name + \".ptgz.idx\" + \"\\n\";\n\tidx.close();\n\t\n\tif (verbose) {\n\t\tstd::cout << tarCommand + \"\\n\";\n\t}\n\t\n\tsystem(tarCommand.c_str());\n\n\t\/\/ Removes all temporary blocks and idx file.\n\t#pragma omp parallel for schedule(static)\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tstd::string rmCommand = tarNames->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(rmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t}\n\t\t\n\n\t\trmCommand = std::to_string(i) + \".\" + name + \".ptgz.tmp\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\t\/\/ if (remove(rmCommand.c_str())) {\n\t\t\t\/\/ std::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t\/\/ }\n\t}\n\n\tstd::string rmCommand;\n\tif (verbose) {\n\t\tstd::cout << \"remove(\" + name + \".ptgz.idx)\\n\";\n\t}\n\trmCommand = name + \".ptgz.idx\";\n\tif (remove(rmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t}\n\n\ttarNames->clear();\n\tdelete(tarNames);\n}\n\n\/\/ Unpacks the archive.\n\/\/ Reads in all the files from the index file.\n\/\/ Unpacks each file.\n\/\/ Deletes all temporary file blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) name of ptgz archive file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\n\/\/ \t\t\t keep (bool) user option for keeping ptgz archive.\nvoid extraction(std::vector<std::string> *filePaths, std::string name, bool verbose, bool keep) {\n\t\/\/ Unpack the 1st layer tarball\n\tstd::string exCommand = \"tar xf \" + name;\n\tif (verbose) {\n\t\tstd::cout << exCommand + \"\\n\";\n\t}\n\tsystem(exCommand.c_str());\n\n\t\/\/ Get the name from the name of the 1st layer tarball\n\tfor (int i = 0; i < 9; ++i) {\n\t\tname.pop_back();\n\t}\n\n\t\/\/ Read in all tar.gz files form the ptgz.idx file\n\t\/\/ Delete the ptgz.idx file\n\tstd::ifstream idx;\n\tstd::string line;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::in);\n\twhile (std::getline(idx, line)) {\n\t\tfilePaths->push_back(line);\n\t}\n\tidx.close();\n\tstd::string idxRmCommand = filePaths->back();\n\tremove(idxRmCommand.c_str());\n\tfilePaths->pop_back();\n\n\t\/\/ Unpack each tar.gz file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzCommand = \"tar xzf \" + filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t}\n\t\tsystem(gzCommand.c_str());\n\t}\n\n\t\/\/ Delete each tar.gz file\n\t#pragma omp parallel for schedule(static)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzRmCommand = filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + gzRmCommand + \")\\n\";\n\t\t}\n\t\tremove(gzRmCommand.c_str());\n\t}\n\t\n\t\/\/ Decided whether or not to keep the ptgz.tar archive\n\tif (!keep) {\n\t\tstd::string tarRmCommand = name + \".ptgz.tar\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + tarRmCommand + \")\\n\";\n\t\t}\n\t\tremove(tarRmCommand.c_str());\n\t}\n}\n\nchar cwd [PATH_MAX];\n\n\/\/ Checks to see if the user asks for help.\n\/\/ Gathers the user provided settings for ptgz.\n\/\/ Finds the number of files that need to be stored.\n\/\/ Gathers the file paths of all files to be stored.\n\/\/ Either compresses the files or extracts the ptgz.tar archive.\nint main(int argc, char *argv[]) {\n\tSettings *instance = new Settings;\n\tint *numFiles = new int(0);\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\t\n\thelpCheck(argc, argv);\n\tgetSettings(argc, argv, instance);\n\tgetcwd(cwd, PATH_MAX);\n\n\tif ((*instance).compress) {\n\t\tfindAll(numFiles, cwd);\n\t\tgetPaths(filePaths, cwd, \"\");\n\t\tcompression(filePaths, (*instance).name, (*instance).verbose);\n\t} else {\n\t\textraction(filePaths, (*instance).name, (*instance).verbose, (*instance).keep);\n\t}\n\n\tdelete(instance);\n\tdelete(numFiles);\n\tfilePaths->clear();\n\tdelete(filePaths);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ OpenThread library, Copyright (C) 2002 - 2003 The Open Thread Group\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/\n\/\/ Win32Barrier.c++ - C++ Barrier class built on top of POSIX threads.\n\/\/ ~~~~~~~~~~~~~~~~~~\n\/\/\n\n#include <OpenThreads\/Barrier>\n#include <OpenThreads\/Thread>\n#include <OpenThreads\/ScopedLock>\n#include \"Win32BarrierPrivateData.h\"\nusing namespace OpenThreads;\n\n\/\/ so compiler can place it somewhere\nWin32BarrierPrivateData::~Win32BarrierPrivateData()\n{\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Constructor\n\/\/\n\/\/ Use: public.\n\/\/\nBarrier::Barrier(int numThreads) {\n Win32BarrierPrivateData *pd = new Win32BarrierPrivateData();\n pd->cnt = 0;\n pd->phase = 0;\n pd->maxcnt = numThreads;\n _valid = true;\n _prvData = static_cast<void *>(pd);\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Destructor\n\/\/\n\/\/ Use: public.\n\/\/\nBarrier::~Barrier() {\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n delete pd;\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Reset the barrier to its original state\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::reset() {\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n pd->cnt = 0;\n pd->phase = 0;\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Block until numThreads threads have entered the barrier.\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::block(unsigned int numThreads) {\n\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n if(numThreads != 0) pd->maxcnt = numThreads;\n int my_phase;\n\n ScopedLock<Mutex> lock(pd->lock);\n if( _valid )\n {\n my_phase = pd->phase;\n ++pd->cnt;\n\n if (pd->cnt == pd->maxcnt) { \/\/ I am the last one\n\t\t pd->cnt = 0; \/\/ reset for next use\n\t\t pd->phase = 1 - my_phase; \/\/ toggle phase\n\t\t pd->cond.broadcast();\n }else{ \n\t\t while (pd->phase == my_phase ) {\n\t\t\t pd->cond.wait(&pd->lock);\n\t\t }\n\t }\n }\n}\n\nvoid Barrier::invalidate()\n{\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n\tpd->lock.lock();\n\t_valid = false;\n\tpd->lock.unlock();\n\trelease();\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Description: Release the barrier, now.\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::release() {\n\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n int my_phase;\n\n ScopedLock<Mutex> lock(pd->lock);\n my_phase = pd->phase;\n \n pd->cnt = 0; \/\/ reset for next use\n pd->phase = 1 - my_phase; \/\/ toggle phase\n pd->cond.broadcast();\n \n\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Description: Return the number of threads currently blocked in the barrier\n\/\/\n\/\/ Use: public\n\/\/\nint Barrier::numThreadsCurrentlyBlocked() {\n \n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n int numBlocked = -1;\n ScopedLock<Mutex> lock(pd->lock);\n numBlocked = pd->cnt;\n ScopedLock<Mutex> unlock(pd->lock);\n return numBlocked;\n\n}\n<commit_msg>removed extra ScopedLock<commit_after>\/\/\n\/\/ OpenThread library, Copyright (C) 2002 - 2003 The Open Thread Group\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 2.1 of the License, or (at your option) any later version.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/ \n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/\n\/\/ Win32Barrier.c++ - C++ Barrier class built on top of POSIX threads.\n\/\/ ~~~~~~~~~~~~~~~~~~\n\/\/\n\n#include <OpenThreads\/Barrier>\n#include <OpenThreads\/Thread>\n#include <OpenThreads\/ScopedLock>\n#include \"Win32BarrierPrivateData.h\"\nusing namespace OpenThreads;\n\n\/\/ so compiler can place it somewhere\nWin32BarrierPrivateData::~Win32BarrierPrivateData()\n{\n};\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Constructor\n\/\/\n\/\/ Use: public.\n\/\/\nBarrier::Barrier(int numThreads) {\n Win32BarrierPrivateData *pd = new Win32BarrierPrivateData();\n pd->cnt = 0;\n pd->phase = 0;\n pd->maxcnt = numThreads;\n _valid = true;\n _prvData = static_cast<void *>(pd);\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Destructor\n\/\/\n\/\/ Use: public.\n\/\/\nBarrier::~Barrier() {\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n delete pd;\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Reset the barrier to its original state\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::reset() {\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n pd->cnt = 0;\n pd->phase = 0;\n}\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Decription: Block until numThreads threads have entered the barrier.\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::block(unsigned int numThreads) {\n\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n if(numThreads != 0) pd->maxcnt = numThreads;\n int my_phase;\n\n ScopedLock<Mutex> lock(pd->lock);\n if( _valid )\n {\n my_phase = pd->phase;\n ++pd->cnt;\n\n if (pd->cnt == pd->maxcnt) { \/\/ I am the last one\n\t\t pd->cnt = 0; \/\/ reset for next use\n\t\t pd->phase = 1 - my_phase; \/\/ toggle phase\n\t\t pd->cond.broadcast();\n }else{ \n\t\t while (pd->phase == my_phase ) {\n\t\t\t pd->cond.wait(&pd->lock);\n\t\t }\n\t }\n }\n}\n\nvoid Barrier::invalidate()\n{\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n\tpd->lock.lock();\n\t_valid = false;\n\tpd->lock.unlock();\n\trelease();\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Description: Release the barrier, now.\n\/\/\n\/\/ Use: public.\n\/\/\nvoid Barrier::release() {\n\n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n int my_phase;\n\n ScopedLock<Mutex> lock(pd->lock);\n my_phase = pd->phase;\n \n pd->cnt = 0; \/\/ reset for next use\n pd->phase = 1 - my_phase; \/\/ toggle phase\n pd->cond.broadcast();\n \n}\n\n\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ Description: Return the number of threads currently blocked in the barrier\n\/\/\n\/\/ Use: public\n\/\/\nint Barrier::numThreadsCurrentlyBlocked() {\n \n Win32BarrierPrivateData *pd =\n static_cast<Win32BarrierPrivateData*>(_prvData);\n\n int numBlocked = -1;\n ScopedLock<Mutex> lock(pd->lock);\n numBlocked = pd->cnt;\n return numBlocked;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n\n#include \"AliVZEROTrigger.h\"\n\n\/\/______________________________________________________________________\nClassImp(AliVZEROTrigger)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Version 1\n\/\/\n\/\/ AliVZEROTrigger: \n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/______________________________________________________________________\nAliVZEROTrigger::AliVZEROTrigger()\n :AliTriggerDetector(),\n fAdcThresHold(0.0),\n fTimeWindowWidth(50.0)\n \n{\n SetName(\"VZERO\");\n CreateInputs();\n\n SetAdcThreshold();\n SetTimeWindowWidth();\n}\n\n\/\/______________________________________________________________________\nvoid AliVZEROTrigger::CreateInputs()\n{\n \/\/ inputs\n\n \/\/ Do not create inputs again!!\n if( fInputs.GetEntriesFast() > 0 ) return;\n\n fInputs.AddLast( new AliTriggerInput( \"VZERO_LEFT\", \"At least one hit in the left VZERO\", 0x01 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_RIGHT\",\"At least one hit in the right VZERO\", 0x02 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_AND\", \"At least one hit in the each (left and right) VZERO\", 0x04 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_OR\", \"At least one hit in the one (left one right) VZERO\", 0x08 ) );\n\n fInputs.AddLast( new AliTriggerInput( \"VZERO_BEAMGAS\", \"Beam gas VZERO trigger \", 0x010 ) );\n}\n\n\/\/______________________________________________________________________\nvoid AliVZEROTrigger::Trigger()\n{\n \n \/\/ ********** Get run loader for the current event **********\n AliRunLoader* runLoader = gAlice->GetRunLoader();\n\n AliVZEROLoader* loader = (AliVZEROLoader* )runLoader->GetLoader( \"VZEROLoader\" );\n\n loader->LoadDigits(\"READ\");\n TTree* vzeroDigitsTree = loader->TreeD();\n if (!vzeroDigitsTree) return;\n\n TClonesArray* vzeroDigits = new TClonesArray(\"AliVZEROdigit\",1000);\n TBranch* digitBranch = vzeroDigitsTree->GetBranch(\"VZERODigit\");\n digitBranch->SetAddress(&vzeroDigits);\n\n \/\/ number of hits in left\/right\n Int_t nLeftDig = 0;\n Int_t nRightDig = 0;\n \n \/\/ first time \n Float_t firstTimeLeft = 9999.0;\n Float_t firstTimeRight = 9999.0;\n Float_t TimeHalfWidth = fTimeWindowWidth\/2.0;\n \n printf(\" Window V0C = %f %f \\n\", 30.0-TimeHalfWidth, 30.0+TimeHalfWidth );\n printf(\" Window V0A = %f %f \\n\", 114.0-TimeHalfWidth, 114.0+TimeHalfWidth);\n \n \/\/ loop over vzero entries\n Int_t nEntries = (Int_t)vzeroDigitsTree->GetEntries();\n for (Int_t e=0; e<nEntries; e++) {\n vzeroDigitsTree->GetEvent(e);\n\n Int_t nDigits = vzeroDigits->GetEntriesFast();\n \n for (Int_t d=0; d<nDigits; d++) {\n \/\/ vzeroDigitsTree->GetEvent(d);\n AliVZEROdigit* digit = (AliVZEROdigit*)vzeroDigits->At(d);\n \n Int_t PMNumber = digit->PMNumber();\n Float_t adc = digit->ADC();\n Float_t tdc = digit->Time(); \/\/ in 100 of picoseconds\n \n if (PMNumber<=31 && adc>fAdcThresHold) {\n printf(\" Time V0C = %f \\n\", tdc );\n\tif (tdc>(30.0-TimeHalfWidth) && tdc<(30.0+TimeHalfWidth)) nRightDig++;\n\/\/ nRightDig++;\n\tif (tdc<firstTimeRight) firstTimeRight = tdc;\n } \n if (PMNumber>=32 && adc>fAdcThresHold) {\n printf(\" Time V0A = %f \\n\", tdc );\n\tif (tdc>(114.0-TimeHalfWidth) && tdc<(114.0+TimeHalfWidth)) nLeftDig++;\n\/\/ nLeftDig++;\n\tif (tdc<firstTimeLeft) firstTimeLeft = tdc;\n }\t\n \n } \/\/ end of loop over digits\n } \/\/ end of loop over events in digits tree\n \n \/\/ Beam gas trigger set from the time difference. The time it takes\n \/\/ to travel between the two counters is ~14.3 ns = 143 * 100 ps.\n \/\/ NB: this should be defined\n \/\/ from time windows relative to the time of the bunch crossing!\n \/\/ beam gas comming from the left ...\n\n if (TMath::Abs(TMath::Abs(firstTimeLeft - firstTimeRight)-143) < 20) \/\/ time window of 2 ns\n SetInput( \"VZERO_BEAMGAS\" );\n\n if (nLeftDig > 0)\n SetInput( \"VZERO_LEFT\" );\n\n if (nRightDig > 0)\n SetInput( \"VZERO_RIGHT\" );\n \n if (nLeftDig>0 || nRightDig>0) {\n SetInput( \"VZERO_OR\" );\n\n if (nLeftDig>0 && nRightDig>0) {\n SetInput( \"VZERO_AND\" ); \n }\n }\n \n\/\/ AliDebug(1,Form(\"VZERO PMs fired: %d (left) %d (right)\", nLeftDig, nRightDig));\n printf(\"%d %d \\n\", nLeftDig, nRightDig);\n\n return;\n}\n\n\n<commit_msg>Working prints removed<commit_after>#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n\n#include \"AliVZEROTrigger.h\"\n\n\/\/______________________________________________________________________\nClassImp(AliVZEROTrigger)\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Version 1\n\/\/\n\/\/ AliVZEROTrigger: \n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/______________________________________________________________________\nAliVZEROTrigger::AliVZEROTrigger()\n :AliTriggerDetector(),\n fAdcThresHold(0.0),\n fTimeWindowWidth(50.0)\n \n{\n SetName(\"VZERO\");\n CreateInputs();\n\n SetAdcThreshold();\n SetTimeWindowWidth();\n}\n\n\/\/______________________________________________________________________\nvoid AliVZEROTrigger::CreateInputs()\n{\n \/\/ inputs\n\n \/\/ Do not create inputs again!!\n if( fInputs.GetEntriesFast() > 0 ) return;\n\n fInputs.AddLast( new AliTriggerInput( \"VZERO_LEFT\", \"At least one hit in the left VZERO\", 0x01 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_RIGHT\",\"At least one hit in the right VZERO\", 0x02 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_AND\", \"At least one hit in the each (left and right) VZERO\", 0x04 ) );\n fInputs.AddLast( new AliTriggerInput( \"VZERO_OR\", \"At least one hit in the one (left one right) VZERO\", 0x08 ) );\n\n fInputs.AddLast( new AliTriggerInput( \"VZERO_BEAMGAS\", \"Beam gas VZERO trigger \", 0x010 ) );\n}\n\n\/\/______________________________________________________________________\nvoid AliVZEROTrigger::Trigger()\n{\n \n \/\/ ********** Get run loader for the current event **********\n AliRunLoader* runLoader = gAlice->GetRunLoader();\n\n AliVZEROLoader* loader = (AliVZEROLoader* )runLoader->GetLoader( \"VZEROLoader\" );\n\n loader->LoadDigits(\"READ\");\n TTree* vzeroDigitsTree = loader->TreeD();\n if (!vzeroDigitsTree) return;\n\n TClonesArray* vzeroDigits = new TClonesArray(\"AliVZEROdigit\",1000);\n TBranch* digitBranch = vzeroDigitsTree->GetBranch(\"VZERODigit\");\n digitBranch->SetAddress(&vzeroDigits);\n\n \/\/ number of hits in left\/right\n Int_t nLeftDig = 0;\n Int_t nRightDig = 0;\n \n \/\/ first time \n Float_t firstTimeLeft = 9999.0;\n Float_t firstTimeRight = 9999.0;\n Float_t TimeHalfWidth = fTimeWindowWidth\/2.0;\n \n \/\/ loop over vzero entries\n Int_t nEntries = (Int_t)vzeroDigitsTree->GetEntries();\n for (Int_t e=0; e<nEntries; e++) {\n vzeroDigitsTree->GetEvent(e);\n\n Int_t nDigits = vzeroDigits->GetEntriesFast();\n \n for (Int_t d=0; d<nDigits; d++) {\n \/\/ vzeroDigitsTree->GetEvent(d);\n AliVZEROdigit* digit = (AliVZEROdigit*)vzeroDigits->At(d);\n \n Int_t PMNumber = digit->PMNumber();\n Float_t adc = digit->ADC();\n Float_t tdc = digit->Time(); \/\/ in 100 of picoseconds\n \n if (PMNumber<=31 && adc>fAdcThresHold) {\n\tif (tdc>(30.0-TimeHalfWidth) && tdc<(30.0+TimeHalfWidth)) nRightDig++;\n\tif (tdc<firstTimeRight) firstTimeRight = tdc;\n } \n if (PMNumber>=32 && adc>fAdcThresHold) {\n \tif (tdc>(114.0-TimeHalfWidth) && tdc<(114.0+TimeHalfWidth)) nLeftDig++;\n\tif (tdc<firstTimeLeft) firstTimeLeft = tdc;\n }\t\n \n } \/\/ end of loop over digits\n } \/\/ end of loop over events in digits tree\n \n \/\/ Beam gas trigger set from the time difference. The time it takes\n \/\/ to travel between the two counters is ~14.3 ns = 143 * 100 ps.\n \/\/ NB: this should be defined\n \/\/ from time windows relative to the time of the bunch crossing!\n \/\/ beam gas comming from the left ...\n\n if (TMath::Abs(TMath::Abs(firstTimeLeft - firstTimeRight)-143) < 20) \/\/ time window of 2 ns\n SetInput( \"VZERO_BEAMGAS\" );\n\n if (nLeftDig > 0)\n SetInput( \"VZERO_LEFT\" );\n\n if (nRightDig > 0)\n SetInput( \"VZERO_RIGHT\" );\n \n if (nLeftDig>0 || nRightDig>0) {\n SetInput( \"VZERO_OR\" );\n\n if (nLeftDig>0 && nRightDig>0) {\n SetInput( \"VZERO_AND\" ); \n }\n }\n \n AliDebug(1,Form(\"VZERO PMs fired: %d (left) %d (right)\", nLeftDig, nRightDig));\n \n return;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/ocmb\/common\/spd_access\/gpio_adc_i2c_addr_get.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2019,2020 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/\/\n\/\/\/ @file gpio_adc_i2c_addr_get.H\n\/\/\/ @brief Function to get GPIO\/ADC i2c addresses given target REL_POS\n\/\/\/\n\/\/ *HWP HWP Owner: Mark Pizzutillo <mark.pizzutillo@ibm.com>\n\/\/ *HWP HWP Owner: Dan Crowell <dcrowell@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef __GPIO_ADC_I2C_ADDR_GET__\n#define __GPIO_ADC_I2C_ADDR_GET__\n\n#include <vector>\n\n\/\/ Mapping from REL_POS ID to GPIO\/ADC address\nstatic const std::vector<uint8_t> GPIO_ADC_I2C_ADDR_VECTOR =\n{\n 0x20, \/\/ 0 = ADC1\n 0x2E, \/\/ 1 = ADC2\n 0x70, \/\/ 2 = GPIO1\n 0x7E, \/\/ 3 = GPIO2\n};\n\n\/\/\/\n\/\/\/ @brief Get the GPIO\/ADC i2c address for the given REL_POS\n\/\/\/\n\/\/\/ @param[in] i_rel_pos REL_POS of GENERICI2CSLAVE target (0-3)\n\/\/\/ @return uint8_t I2C address of the device for the given rel pos\n\/\/\/\ninline uint8_t get_gpio_adc_i2c_addr(const uint8_t i_rel_pos)\n{\n \/\/ Out of range, just return 0. Failsafe so we don't segfault\n \/\/ The caller is responsible for calling this with a valid ID\n if (i_rel_pos >= GPIO_ADC_I2C_ADDR_VECTOR.size())\n {\n return 0;\n }\n\n return GPIO_ADC_I2C_ADDR_VECTOR[i_rel_pos];\n}\n\n#endif\n<commit_msg>Add gpio function that can take SPD blob and detect DIMM type<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/ocmb\/common\/spd_access\/gpio_adc_i2c_addr_get.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2019,2022 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/\/\n\/\/\/ @file gpio_adc_i2c_addr_get.H\n\/\/\/ @brief Function to get GPIO\/ADC i2c addresses given target REL_POS\n\/\/\/\n\/\/ *HWP HWP Owner: Mark Pizzutillo <mark.pizzutillo@ibm.com>\n\/\/ *HWP HWP Owner: Dan Crowell <dcrowell@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef __GPIO_ADC_I2C_ADDR_GET__\n#define __GPIO_ADC_I2C_ADDR_GET__\n\n#include <vector>\n\n\/\/ Mapping from REL_POS ID to GPIO\/ADC address\nstatic const std::vector<uint8_t> GPIO_ADC_I2C_ADDR_VECTOR =\n{\n 0x20, \/\/ 0 = ADC1\n 0x2E, \/\/ 1 = ADC2\n 0x70, \/\/ 2 = GPIO1\n 0x7E, \/\/ 3 = GPIO2\n};\n\n\/\/ 4U DDIMM bytes\nconstexpr uint8_t MEM_DDR4 = 0xC;\nconstexpr uint8_t MEM_DDIMM = 0xA;\nconstexpr uint8_t MEM_4U = 0x80;\n\/\/ SPD bytes to check the various details of the DIMM\nconstexpr uint16_t SPD_DDR_BYTE = 2;\nconstexpr uint16_t SPD_DIMM_TYPE_BYTE = 3;\nconstexpr uint16_t SPD_DIMM_SIZE_BYTE = 193;\n\n\/\/\/\n\/\/\/ @brief Get the GPIO\/ADC i2c address for the given REL_POS\n\/\/\/\n\/\/\/ @param[in] i_rel_pos REL_POS of GENERICI2CSLAVE target (0-3)\n\/\/\/ @return uint8_t I2C address of the device for the given rel pos\n\/\/\/\ninline uint8_t get_gpio_adc_i2c_addr(const uint8_t i_rel_pos)\n{\n \/\/ Out of range, just return 0. Failsafe so we don't segfault\n \/\/ The caller is responsible for calling this with a valid ID\n if (i_rel_pos >= GPIO_ADC_I2C_ADDR_VECTOR.size())\n {\n return 0;\n }\n\n return GPIO_ADC_I2C_ADDR_VECTOR[i_rel_pos];\n}\n\n\/\/\/\n\/\/\/ @brief Get the GPIO\/ADC i2c address for the given REL_POS\n\/\/\/\n\/\/\/ @param[in] i_spd SPD binary\n\/\/\/ @param[in] i_rel_pos REL_POS of GENERICI2CSLAVE target (0-3)\n\/\/\/ @return uint8_t I2C address of the device for the given rel pos\n\/\/\/\ninline uint8_t get_gpio_adc_i2c_addr(uint8_t const* const i_spd, const uint8_t i_rel_pos)\n{\n \/\/ Out of range, just return 0. Failsafe so we don't segfault\n \/\/ The caller is responsible for calling this with a valid ID\n if (i_rel_pos >= GPIO_ADC_I2C_ADDR_VECTOR.size())\n {\n return 0;\n }\n\n \/\/ Check the SPD to see which type of DIMM this is. GPIO devices only exist for 4U DDIMMs.\n if ( !((i_spd[SPD_DDR_BYTE] == MEM_DDR4)\n && (i_spd[SPD_DIMM_TYPE_BYTE] == MEM_DDIMM)\n && (i_spd[SPD_DIMM_SIZE_BYTE] == MEM_4U)))\n {\n \/\/ This is not a DDR4 4U DDIMM which means there isn't a GPIO device. Return 0 and let caller handle.\n return 0;\n }\n\n return GPIO_ADC_I2C_ADDR_VECTOR[i_rel_pos];\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- FormatManager.cpp -------------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Core\/FormatManager.h\"\n\n\/\/ C Includes\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n\/\/ Project includes\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\nstruct FormatInfo\n{\n Format format;\n const char format_char; \/\/ One or more format characters that can be used for this format.\n const char *format_name; \/\/ Long format name that can be used to specify the current format\n};\n\nstatic FormatInfo \ng_format_infos[] = \n{\n { eFormatDefault , '\\0' , \"default\" },\n { eFormatBoolean , 'B' , \"boolean\" },\n { eFormatBinary , 'b' , \"binary\" },\n { eFormatBytes , 'y' , \"bytes\" },\n { eFormatBytesWithASCII , 'Y' , \"bytes with ASCII\" },\n { eFormatChar , 'c' , \"character\" },\n { eFormatCharPrintable , 'C' , \"printable character\" },\n { eFormatComplexFloat , 'F' , \"complex float\" },\n { eFormatCString , 's' , \"c-string\" },\n { eFormatDecimal , 'i' , \"signed decimal\" },\n { eFormatEnum , 'E' , \"enumeration\" },\n { eFormatHex , 'x' , \"hex\" },\n { eFormatFloat , 'f' , \"float\" },\n { eFormatOctal , 'o' , \"octal\" },\n { eFormatOSType , 'O' , \"OSType\" },\n { eFormatUnicode16 , 'U' , \"unicode16\" },\n { eFormatUnicode32 , '\\0' , \"unicode32\" },\n { eFormatUnsigned , 'u' , \"unsigned decimal\" },\n { eFormatPointer , 'p' , \"pointer\" },\n { eFormatVectorOfChar , '\\0' , \"char[]\" },\n { eFormatVectorOfSInt8 , '\\0' , \"int8_t[]\" },\n { eFormatVectorOfUInt8 , '\\0' , \"uint8_t[]\" },\n { eFormatVectorOfSInt16 , '\\0' , \"int16_t[]\" },\n { eFormatVectorOfUInt16 , '\\0' , \"uint16_t[]\" },\n { eFormatVectorOfSInt32 , '\\0' , \"int16_t[]\" },\n { eFormatVectorOfUInt32 , '\\0' , \"uint16_t[]\" },\n { eFormatVectorOfSInt64 , '\\0' , \"int16_t[]\" },\n { eFormatVectorOfUInt64 , '\\0' , \"uint16_t[]\" },\n { eFormatVectorOfFloat32, '\\0' , \"float32[]\" },\n { eFormatVectorOfFloat64, '\\0' , \"float64[]\" },\n { eFormatVectorOfUInt128, '\\0' , \"uint128_t[]\" },\n { eFormatComplexInteger , 'I' , \"complex integer\" },\n { eFormatCharArray , 'a' , \"character array\" }\n};\n\nstatic uint32_t \ng_num_format_infos = sizeof(g_format_infos)\/sizeof(FormatInfo);\n\nstatic bool\nGetFormatFromFormatChar (char format_char, Format &format)\n{\n for (uint32_t i=0; i<g_num_format_infos; ++i)\n {\n if (g_format_infos[i].format_char == format_char)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n format = eFormatInvalid;\n return false;\n}\n\nstatic bool\nGetFormatFromFormatName (const char *format_name, bool partial_match_ok, Format &format)\n{\n uint32_t i;\n for (i=0; i<g_num_format_infos; ++i)\n {\n if (strcasecmp (g_format_infos[i].format_name, format_name) == 0)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n \n if (partial_match_ok)\n {\n for (i=0; i<g_num_format_infos; ++i)\n {\n if (strcasestr (g_format_infos[i].format_name, format_name) == g_format_infos[i].format_name)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n }\n format = eFormatInvalid;\n return false;\n}\n\nbool\nFormatManager::GetFormatFromCString (const char *format_cstr,\n bool partial_match_ok,\n lldb::Format &format)\n{\n bool success = false;\n if (format_cstr && format_cstr[0])\n {\n if (format_cstr[1] == '\\0')\n {\n success = GetFormatFromFormatChar (format_cstr[0], format);\n if (success)\n return true;\n }\n \n success = GetFormatFromFormatName (format_cstr, partial_match_ok, format);\n }\n if (!success)\n format = eFormatInvalid;\n return success;\n}\n\nchar\nFormatManager::GetFormatAsFormatChar (lldb::Format format)\n{\n for (uint32_t i=0; i<g_num_format_infos; ++i)\n {\n if (g_format_infos[i].format == format)\n return g_format_infos[i].format_char;\n }\n return '\\0';\n}\n \n\n\nconst char *\nFormatManager::GetFormatAsCString (Format format)\n{\n if (format >= eFormatDefault && format < kNumFormats)\n return g_format_infos[format].format_name;\n return NULL;\n}\n\ntemplate<>\nbool\nFormatNavigator<std::map<lldb::RegularExpressionSP, SummaryFormat::SharedPointer>, SummaryFormat::RegexSummaryCallback>::Get(const char* key,\n SummaryFormat::SharedPointer& value)\n{\n Mutex::Locker(m_map_mutex);\n MapIterator pos, end = m_map.end();\n for (pos = m_map.begin(); pos != end; pos++)\n {\n lldb::RegularExpressionSP regex = pos->first;\n if (regex->Execute(key))\n {\n value = pos->second;\n return true;\n }\n }\n return false;\n}\n\ntemplate<>\nbool\nFormatNavigator<std::map<lldb::RegularExpressionSP, SummaryFormat::SharedPointer>, SummaryFormat::RegexSummaryCallback>::Delete(const char* type)\n{\n Mutex::Locker(m_map_mutex);\n MapIterator pos, end = m_map.end();\n for (pos = m_map.begin(); pos != end; pos++)\n {\n lldb::RegularExpressionSP regex = pos->first;\n if ( ::strcmp(type,regex->GetText()) == 0)\n {\n m_map.erase(pos);\n return true;\n }\n }\n return false;\n}\n<commit_msg>Fixed some format names<commit_after>\/\/===-- FormatManager.cpp -------------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Core\/FormatManager.h\"\n\n\/\/ C Includes\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n\/\/ Project includes\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\nstruct FormatInfo\n{\n Format format;\n const char format_char; \/\/ One or more format characters that can be used for this format.\n const char *format_name; \/\/ Long format name that can be used to specify the current format\n};\n\nstatic FormatInfo \ng_format_infos[] = \n{\n { eFormatDefault , '\\0' , \"default\" },\n { eFormatBoolean , 'B' , \"boolean\" },\n { eFormatBinary , 'b' , \"binary\" },\n { eFormatBytes , 'y' , \"bytes\" },\n { eFormatBytesWithASCII , 'Y' , \"bytes with ASCII\" },\n { eFormatChar , 'c' , \"character\" },\n { eFormatCharPrintable , 'C' , \"printable character\" },\n { eFormatComplexFloat , 'F' , \"complex float\" },\n { eFormatCString , 's' , \"c-string\" },\n { eFormatDecimal , 'i' , \"signed decimal\" },\n { eFormatEnum , 'E' , \"enumeration\" },\n { eFormatHex , 'x' , \"hex\" },\n { eFormatFloat , 'f' , \"float\" },\n { eFormatOctal , 'o' , \"octal\" },\n { eFormatOSType , 'O' , \"OSType\" },\n { eFormatUnicode16 , 'U' , \"unicode16\" },\n { eFormatUnicode32 , '\\0' , \"unicode32\" },\n { eFormatUnsigned , 'u' , \"unsigned decimal\" },\n { eFormatPointer , 'p' , \"pointer\" },\n { eFormatVectorOfChar , '\\0' , \"char[]\" },\n { eFormatVectorOfSInt8 , '\\0' , \"int8_t[]\" },\n { eFormatVectorOfUInt8 , '\\0' , \"uint8_t[]\" },\n { eFormatVectorOfSInt16 , '\\0' , \"int16_t[]\" },\n { eFormatVectorOfUInt16 , '\\0' , \"uint16_t[]\" },\n { eFormatVectorOfSInt32 , '\\0' , \"int32_t[]\" },\n { eFormatVectorOfUInt32 , '\\0' , \"uint32_t[]\" },\n { eFormatVectorOfSInt64 , '\\0' , \"int64_t[]\" },\n { eFormatVectorOfUInt64 , '\\0' , \"uint64_t[]\" },\n { eFormatVectorOfFloat32, '\\0' , \"float32[]\" },\n { eFormatVectorOfFloat64, '\\0' , \"float64[]\" },\n { eFormatVectorOfUInt128, '\\0' , \"uint128_t[]\" },\n { eFormatComplexInteger , 'I' , \"complex integer\" },\n { eFormatCharArray , 'a' , \"character array\" }\n};\n\nstatic uint32_t \ng_num_format_infos = sizeof(g_format_infos)\/sizeof(FormatInfo);\n\nstatic bool\nGetFormatFromFormatChar (char format_char, Format &format)\n{\n for (uint32_t i=0; i<g_num_format_infos; ++i)\n {\n if (g_format_infos[i].format_char == format_char)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n format = eFormatInvalid;\n return false;\n}\n\nstatic bool\nGetFormatFromFormatName (const char *format_name, bool partial_match_ok, Format &format)\n{\n uint32_t i;\n for (i=0; i<g_num_format_infos; ++i)\n {\n if (strcasecmp (g_format_infos[i].format_name, format_name) == 0)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n \n if (partial_match_ok)\n {\n for (i=0; i<g_num_format_infos; ++i)\n {\n if (strcasestr (g_format_infos[i].format_name, format_name) == g_format_infos[i].format_name)\n {\n format = g_format_infos[i].format;\n return true;\n }\n }\n }\n format = eFormatInvalid;\n return false;\n}\n\nbool\nFormatManager::GetFormatFromCString (const char *format_cstr,\n bool partial_match_ok,\n lldb::Format &format)\n{\n bool success = false;\n if (format_cstr && format_cstr[0])\n {\n if (format_cstr[1] == '\\0')\n {\n success = GetFormatFromFormatChar (format_cstr[0], format);\n if (success)\n return true;\n }\n \n success = GetFormatFromFormatName (format_cstr, partial_match_ok, format);\n }\n if (!success)\n format = eFormatInvalid;\n return success;\n}\n\nchar\nFormatManager::GetFormatAsFormatChar (lldb::Format format)\n{\n for (uint32_t i=0; i<g_num_format_infos; ++i)\n {\n if (g_format_infos[i].format == format)\n return g_format_infos[i].format_char;\n }\n return '\\0';\n}\n \n\n\nconst char *\nFormatManager::GetFormatAsCString (Format format)\n{\n if (format >= eFormatDefault && format < kNumFormats)\n return g_format_infos[format].format_name;\n return NULL;\n}\n\ntemplate<>\nbool\nFormatNavigator<std::map<lldb::RegularExpressionSP, SummaryFormat::SharedPointer>, SummaryFormat::RegexSummaryCallback>::Get(const char* key,\n SummaryFormat::SharedPointer& value)\n{\n Mutex::Locker(m_map_mutex);\n MapIterator pos, end = m_map.end();\n for (pos = m_map.begin(); pos != end; pos++)\n {\n lldb::RegularExpressionSP regex = pos->first;\n if (regex->Execute(key))\n {\n value = pos->second;\n return true;\n }\n }\n return false;\n}\n\ntemplate<>\nbool\nFormatNavigator<std::map<lldb::RegularExpressionSP, SummaryFormat::SharedPointer>, SummaryFormat::RegexSummaryCallback>::Delete(const char* type)\n{\n Mutex::Locker(m_map_mutex);\n MapIterator pos, end = m_map.end();\n for (pos = m_map.begin(); pos != end; pos++)\n {\n lldb::RegularExpressionSP regex = pos->first;\n if ( ::strcmp(type,regex->GetText()) == 0)\n {\n m_map.erase(pos);\n return true;\n }\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include \"cmdline.hpp\"\n#include \"cmd.hpp\"\n#include \"semicolon.hpp\"\n#include \"pound.hpp\"\n#include \"or.hpp\"\n#include \"and.hpp\"\n#include <vector>\n#include <string>\n#include <cstring>\n#include <boost\/tokenizer.hpp>\n#include <locale>\n#include <unistd.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <stdio.h>\nusing namespace boost;\n\n\n\/\/ALL COMMENTED CODE WAS USED FOR DEBUGGING PURPOSES, WITH THE EXCEPTION OF THE CODE OUTSIDE IF MAIN, WHICH IS SCRAPPED PREVIOUS ATTEMPTS.\n\n\nint main()\n{\nchar uname[100]; \nstring uInput = \"\";\nchar* ulgn = getlogin();\ngethostname(uname, 100);\nputs(uname);\n\ncout << \"Begginning Terminal\" << endl;\ncout << ulgn << \"@\" << uname << \"$ \";\nwhile (getline(cin, uInput))\n{\n\n\tif (!uInput.empty() && uInput.at(0) != '#')\n\t{\n\t\tvector<char> substr;\t\t\t\/\/ USED TO HOLD PARSERS\n\t\ttokenizer<> tok(uInput);\t\t\/\/ USED TO HOLD COMMANDS\n\t\tbool isValid = true;\t\t\t\/\/ USED IN && AND || TO DETERMINE IF PREVIOUS COMMAND WAS VALID\n\n\t\tstring otemp;\t\t\t\t\/\/TEMP STRING IN ORDER TO CORRECTLY ADDED THE \"||\" SYMBOL TO SUBSTR\n\t\tstring atemp;\t\t\t\t\/\/TEMP STRING IN ORDER TO CORRECTLY ADDED THE \"&&\" SYMBOL TO SUBSTR\n\n\t\tfor (string::iterator i = uInput.begin(); i != uInput.end(); i++) \/\/ ITERATES THROUGH USER INPUT IN ORDER TO FIND PARSERS\n\t\t{\n\t\t\tif ((*i) == ';')\n\t\t\t{\n\t\t\t\tsubstr.push_back((*i)); \/\/ IF SYMBOL == ';' ADDED TO SUBSTR\n\t\t\t}\n\t\t\telse if ((*i) == '|')\n\t\t\t{\n\t\t\t\totemp.push_back('|'); \/\/ PUSH BACK THE CHAR '|' TO ATEMP\n\t\t\t\tif (otemp == \"||\")\n\t\t\t\t{\n\t\t\t\t\tsubstr.push_back((*i)); \/\/IF OTEMP = \"||\" THEN ADD A OR SYMBOL TO SUBSTR, USED TO MAKE SURE USER INPUT \"||' AND NOT \"|'\n\t\t\t\t\totemp.clear(); \/\/ CLEAR OTEMP FOR NEXT RUN\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((*i) == '&')\n\t\t\t{\n\t\t\t\tatemp.push_back('&'); \/\/ PUSH BACK THE CHAR '&' TO ATEMP\n\t\t\t\tif (atemp == \"&&\")\n\t\t\t\t{\n\t\t\t\t\tsubstr.push_back((*i)); \/\/IF OTEMP = \"&\" THEN ADD A OR SYMBOL TO SUBSTR, USED TO MAKE SURE USER INPUT \"&&' AND NOT \"&'\n\t\t\t\t\tatemp.clear(); \/\/ CLEAR ATEMP FOR NEXT RUN\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((*i) == '#')\n\t\t\t{\t\n\t\t\t\tsubstr.push_back((*i));\n\t\t\t\tbreak; \/\/ STOPS PARSING ALL TOGETHER IF '#' IS DETECTED\n\t\t\t}\n\t\t}\n\t\/\/DEBUGGING TOOLS\n\t\/*\tif (substr.size() != 1)\n\t\t{\n\t\t\tfor (unsigned i = 0; i < substr.size(); i++)\n\t\t\t{\n\t\t\t\tif (substr.at(i) == substr.at(i+1))\n\t\t\t\t{\n\t\t\t\t\tsubstr.erase(substr.begin() + (i+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << \"substr: \" << endl;\n\t\tfor (unsigned i = 0; i < substr.size(); i++)\n\t\t{\n\t\t\tcout << substr.at(i) << \" \";\n\t\t}\n\t\tcout << endl;\n\n\t\/\/\tcout << \"TOKENIZER\" << endl;\n\n\t\tfor (tokenizer<>::iterator k = tok.begin(); k != tok.end(); k++)\n\t\t{\n\t\t\/\/\tcout << \"K \" << (*k) << endl;\n\t\t\tif ((*k) == \"quit\")\n\t\t\t{\n\t\t\t\treturn 0;\t\t\n\t\t\t}\n\t\t}\n\t*\/\t\n\t\/\/ END DEBUGGING TOOLS\n\t\ttokenizer<>::iterator i = tok.begin(); \/\/ STARTING TO PARSE COMMANDS\n\t\tif ((*i) == \"quit\")\n\t\t{\n\t\t\treturn 0; \/\/IF FIRST COMMAND IS QUIT EXIT IMMEDIATLY\n\t\t}\t\n\t\tCmd* first = new Cmd((*i)); \/\/ BECAUSE FIRST COMMAND DOES NOT HAVE A PARSER IN FRONT OF IT WE HARDCODED IT\n\t\t\n\t\tisValid = first->execute((*i)); \/\/ SET ISVALID TO WHETHER OR NOT THE COMMAND WAS VALID OR NOT FOR POSSIBLE NEXT COMMAND}\n\t\ti++; \/\/ INCREMENTED TOKENIZER ITERATOR\n\n\t\tif (i != tok.end()) \/\/ IF ONLY ONE COMMAND THEN WILL NOT RUN\n\t\t{\t\n\t\t\tfor (unsigned j = 0; j < substr.size(); j++)\t\/\/ITERATING THROUGH THE PARSER VECTOR\n\t\t\t{\n\t\t\t\tCmd* uCmd = new Cmd((*i));\t\t\/\/ CREATE NEW COMMANDS FOR EACH PARSER\n\t\t\t\tswitch(substr.at(j))\t\t\t\/\/ CASE USED TO DETERMINE WHICH PARSER WAS PASSED IN BY USER\n\t\t\t\t{\n\t\t\t\t\tcase ';':\n\t\t\t\t\t{\n\t\t\/\/\t\t\t\tcout << \"HIT CASE SEMICOLON\" << endl;\n\t\t\t\t\t\tSemicolon* sHolder = new Semicolon(isValid, uCmd);\t\/\/ CREATE SEMICOLON OBJECT WHEN SEMICOLON IS DETECTED;\n\t\t\t\t\t\tisValid = sHolder->execute((*i));\t\t\t\/\/ EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\/\/\tdelete sHolder;\t\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase '|':\n\t\t\t\t\t{\n\t\t\/\/\t\t\t\tcout << \"HIT CASE OR\" << endl;\n\t\t\t\t\t\tOr* oHolder = new Or(isValid, uCmd); \t\/\/CREATE OR OBJECT WHEN \"|\" SYMBOL IS DETECTED\n\t\t\t\t\t\tisValid = oHolder->execute(*i);\t\t\/\/EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\t\/\/delete oHolder;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tcase '&':\n\t\t\t\t\t{\n\t\t\/\/\t\t\t\tcout << \"HIT CASE AND\" << endl;\t\n\t\t\t\t\t\tAnd* aHolder = new And(isValid, uCmd);\t\/\/CREATE AND OBJECT WHEN \"&\" SYMBOL IS DETECTED\n\t\t\t\t\t\tisValid = aHolder->execute((*i));\t\/\/ EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\t\/\/delete aHolder;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tdefault:\n\t\t\t\t\t{\n\t\t\t\t\t\tj = substr.size();\t\/\/ IF HASH DETECTED BREAK OUT OF THE LOOP\n\t\t\t\t\t\tbreak;\t\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ti++;\t\/\/INCREMENT TOKENIZER CLASS TO NEXT COMMAND TO MATCH NEXT PARSER\n\t\t\t}\n\t}\n\tuInput.clear(); \/\/CLEARED FOR NEXT USER INPUT\n\tsubstr.clear();\t\/\/CLEARED FOR NEXT USER INPUT\n\tcout << ulgn << \"@\" << uname << \"$ \"; \n\t}\n\t\n}\n\n\treturn 0;\n}\n\n\n\n\n\/\/ OLD CODE KEPT JUST IN CASE\n\/*for (int i = 0; i < uInput.size(); i++)\n{\n\tif (uInput.at(i) != ' ')\n\t{\n\t\tnewInput.push_back(uInput.at(i));\n\t\t\n\t}\n\tif (uInput[i] == ';' || uInput[i] == '#')\n \t{\n\t\tnewInput.erase(newInput.end()-1);\n\t\tchar* temp = new char[newInput.length()+1];\n\t\ttemp = strcpy(temp, newInput.c_str());\n\t\tsubstr.push_back(temp);\n\t\tnewInput.clear();\n\t\tnewInput.push_back(uInput.at(i));\t\n\t}\n\telse if ((uInput[i] == '|' && uInput[i+1] == '|') ||(uInput[i] == '&' && uInput[i+1] == '&'))\n\t{\n\t\tnewInput.erase(newInput.end()-1);\n\t\/\/\tnewInput.erase(newInput.end()-1);\n\t\tnewInput.push_back(uInput.at(i+1));\n\t\tchar* temp = new char[newInput.length()+1];\n\t\ttemp = strcpy(temp, newInput.c_str());\n\t\tsubstr.push_back(temp);\n\t\tnewInput.clear();\n\t\tnewInput.push_back(uInput.at(i));\n\t\tnewInput.push_back(uInput.at(i+1));\n\/\/\t\tnewInput.erase(newInput.end()-1);\n\t\ti++;\n\t}\n}\n\nchar* temp = new char[newInput.length()+1];\ntemp = strcpy(temp, newInput.c_str());\nsubstr.push_back(temp);\nnewInput.clear();\t\t\n\t\nsubstr.push_back(NULL);\n*\/\n\n\/*\n\tCmd* A = new Cmd(\"ls\");\n\tCmd* B = new Cmd(\"asdf\");\n\tSemicolon* C = new Semicolon(false,A);\n\tPound* D = new Pound(false, B);\n\tOr* E = new Or(false, A);\n\tif (E->isValid)\n\t{\n\t\tcout << \"GOOD \" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"ERROR\" << endl;\n\t}\n*\/\n<commit_msg>updated README.md and cmd.cpp<commit_after>#include <iostream>\n#include \"cmdline.hpp\"\n#include \"cmd.hpp\"\n#include \"semicolon.hpp\"\n#include \"pound.hpp\"\n#include \"or.hpp\"\n#include \"and.hpp\"\n#include <vector>\n#include <string>\n#include <cstring>\n#include <boost\/tokenizer.hpp>\n#include <locale>\n#include <unistd.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <stdio.h>\nusing namespace boost;\n\n\n\/\/ALL COMMENTED CODE WAS USED FOR DEBUGGING PURPOSES, WITH THE EXCEPTION OF THE CODE OUTSIDE IF MAIN, WHICH IS SCRAPPED PREVIOUS ATTEMPTS.\n\n\nint main()\n{\n char uname[100]; \n string uInput = \"\";\n char* ulgn = getlogin();\n gethostname(uname, 100);\n puts(uname);\n\n cout << \"Beginning Terminal\" << endl;\n cout << ulgn << \"@\" << uname << \"$ \";\n while (getline(cin, uInput))\n {\n\t\tif (!uInput.empty() && uInput.at(0) != '#')\n\t {\n\t\t vector<char> substr;\t\t\t\/\/ USED TO HOLD PARSERS\n\t\t tokenizer<> tok(uInput);\t\t\/\/ USED TO HOLD COMMANDS\n\t\t bool isValid = true;\t\t\t\/\/ USED IN && AND || TO DETERMINE IF PREVIOUS COMMAND WAS VALID\n\n\t\t string otemp;\t\t\t\t\/\/TEMP STRING IN ORDER TO CORRECTLY ADDED THE \"||\" SYMBOL TO SUBSTR\n\t\t string atemp;\t\t\t\t\/\/TEMP STRING IN ORDER TO CORRECTLY ADDED THE \"&&\" SYMBOL TO SUBSTR\n\n\t\t for (string::iterator i = uInput.begin(); i != uInput.end(); i++) \/\/ ITERATES THROUGH USER INPUT IN ORDER TO FIND PARSERS\n\t\t {\n\t\t\t if ((*i) == ';')\n\t\t\t {\n\t\t\t\t substr.push_back((*i)); \/\/ IF SYMBOL == ';' ADDED TO SUBSTR\n\t\t\t }\n\t\t\t else if ((*i) == '|')\n\t\t\t {\n\t\t\t\t otemp.push_back('|'); \/\/ PUSH BACK THE CHAR '|' TO ATEMP\n\t\t\t\t if (otemp == \"||\")\n\t\t\t\t {\n\t\t\t\t\t substr.push_back((*i)); \/\/IF OTEMP = \"||\" THEN ADD A OR SYMBOL TO SUBSTR, USED TO MAKE SURE USER INPUT \"||' AND NOT \"|'\n\t\t\t\t\t otemp.clear(); \/\/ CLEAR OTEMP FOR NEXT RUN\n\t\t\t\t }\n\t\t\t }\n\t\t\t else if ((*i) == '&')\n\t\t\t {\n\t\t\t\t atemp.push_back('&'); \/\/ PUSH BACK THE CHAR '&' TO ATEMP\n\t\t\t\t if (atemp == \"&&\")\n\t\t\t\t {\n\t\t\t\t\t substr.push_back((*i)); \/\/IF OTEMP = \"&\" THEN ADD A OR SYMBOL TO SUBSTR, USED TO MAKE SURE USER INPUT \"&&' AND NOT \"&'\n\t\t\t\t\t atemp.clear(); \/\/ CLEAR ATEMP FOR NEXT RUN\n\t\t\t\t }\n\t\t\t }\n\t\t\t else if ((*i) == '#')\n\t\t\t {\t\n\t\t\t\t substr.push_back((*i));\n\t\t\t\t break; \/\/ STOPS PARSING ALL TOGETHER IF '#' IS DETECTED\n\t\t\t }\n\t\t }\n\t\/\/DEBUGGING TOOLS\n\t\/*\tif (substr.size() != 1)\n\t\t{\n\t\t\tfor (unsigned i = 0; i < substr.size(); i++)\n\t\t\t{\n\t\t\t\tif (substr.at(i) == substr.at(i+1))\n\t\t\t\t{\n\t\t\t\t\tsubstr.erase(substr.begin() + (i+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tcout << \"substr: \" << endl;\n\t\tfor (unsigned i = 0; i < substr.size(); i++)\n\t\t{\n\t\t\tcout << substr.at(i) << \" \";\n\t\t}\n\t\tcout << endl;\n\n\t\/\/\tcout << \"TOKENIZER\" << endl;\n\n\t\tfor (tokenizer<>::iterator k = tok.begin(); k != tok.end(); k++)\n\t\t{\n\t\t\/\/\tcout << \"K \" << (*k) << endl;\n\t\t\tif ((*k) == \"quit\")\n\t\t\t{\n\t\t\t\treturn 0;\t\t\n\t\t\t}\n\t\t}\n\t*\/\t\n\t\/\/ END DEBUGGING TOOLS\n\t\t tokenizer<>::iterator i = tok.begin(); \/\/ STARTING TO PARSE COMMANDS\n\t\t if ((*i) == \"quit\")\n\t\t {\n\t\t\t return 0; \/\/IF FIRST COMMAND IS QUIT EXIT IMMEDIATLY\n\t\t }\t\n\t\t Cmd* first = new Cmd((*i)); \/\/ BECAUSE FIRST COMMAND DOES NOT HAVE A PARSER IN FRONT OF IT WE HARDCODED IT\n\t\t isValid = first->execute((*i)); \/\/ SET ISVALID TO WHETHER OR NOT THE COMMAND WAS VALID OR NOT FOR POSSIBLE NEXT COMMAND}\n\t\t i++; \/\/ INCREMENTED TOKENIZER ITERATOR\n\n\t\t if (i != tok.end()) \/\/ IF ONLY ONE COMMAND THEN WILL NOT RUN\n\t\t {\t\n\t\t\t for (unsigned j = 0; j < substr.size(); j++)\t\/\/ITERATING THROUGH THE PARSER VECTOR\n\t\t\t {\n\t\t\t\t Cmd* uCmd = new Cmd((*i));\t\t\/\/ CREATE NEW COMMANDS FOR EACH PARSER\n\t\t\t\t switch(substr.at(j))\t\t\t\/\/ CASE USED TO DETERMINE WHICH PARSER WAS PASSED IN BY USER\n\t\t\t\t {\n\t\t\t\t\t case ';':\n\t\t\t\t\t {\n\t\t\/\/\t\t\t\tcout << \"HIT CASE SEMICOLON\" << endl;\n\t\t\t\t\t\t Semicolon* sHolder = new Semicolon(isValid, uCmd);\t\/\/ CREATE SEMICOLON OBJECT WHEN SEMICOLON IS DETECTED;\n\t\t\t\t\t\t isValid = sHolder->execute((*i));\t\t\t\/\/ EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\/\/\tdelete sHolder;\t\n\t\t\t\t\t\t break;\n\t\t\t\t\t}\n\t\t\t\t\t case '|':\n\t\t\t\t\t {\n\t\t\/\/\t\t\t\t cout << \"HIT CASE OR\" << endl;\n\t\t\t\t\t\t Or* oHolder = new Or(isValid, uCmd); \t\/\/CREATE OR OBJECT WHEN \"|\" SYMBOL IS DETECTED\n\t\t\t\t\t\t isValid = oHolder->execute(*i);\t\t\/\/EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\t \/\/delete oHolder;\n\t\t\t\t\t\t break;\n\t\t\t\t\t }\n\t\t\t\t\t case '&':\n\t\t\t\t\t {\n\t\t\/\/\t\t\t\t cout << \"HIT CASE AND\" << endl;\t\n\t\t\t\t\t\t And* aHolder = new And(isValid, uCmd);\t\/\/CREATE AND OBJECT WHEN \"&\" SYMBOL IS DETECTED\n\t\t\t\t\t\t isValid = aHolder->execute((*i));\t\/\/ EXECUTES COMMAND AND CHECKS\/SETS VALIDITY\n\t\t\t\t\t\t \/\/delete aHolder;\n\t\t\t\t\t\t break;\n\t\t\t\t\t }\n\t\t\t\t\t default:\n\t\t\t\t\t {\n\t\t\t\t\t\t j = substr.size();\t\/\/ IF HASH DETECTED BREAK OUT OF THE LOOP\n\t\t\t\t\t\t break;\t\t\n\t\t\t\t\t }\n\t\t\t\t }\n\t\t\t\t i++;\t\/\/INCREMENT TOKENIZER CLASS TO NEXT COMMAND TO MATCH NEXT PARSER\n\t\t\t }\n\t }\n\t uInput.clear(); \/\/CLEARED FOR NEXT USER INPUT\n\t substr.clear();\t\/\/CLEARED FOR NEXT USER INPUT\n\t cout << ulgn << \"@\" << uname << \"$ \"; \n\t }\n\t\n }\n\n\t return 0;\n}\n\n\n\n\n\/\/ OLD CODE KEPT JUST IN CASE\n\/*for (int i = 0; i < uInput.size(); i++)\n{\n\tif (uInput.at(i) != ' ')\n\t{\n\t\tnewInput.push_back(uInput.at(i));\n\t\t\n\t}\n\tif (uInput[i] == ';' || uInput[i] == '#')\n \t{\n\t\tnewInput.erase(newInput.end()-1);\n\t\tchar* temp = new char[newInput.length()+1];\n\t\ttemp = strcpy(temp, newInput.c_str());\n\t\tsubstr.push_back(temp);\n\t\tnewInput.clear();\n\t\tnewInput.push_back(uInput.at(i));\t\n\t}\n\telse if ((uInput[i] == '|' && uInput[i+1] == '|') ||(uInput[i] == '&' && uInput[i+1] == '&'))\n\t{\n\t\tnewInput.erase(newInput.end()-1);\n\t\/\/\tnewInput.erase(newInput.end()-1);\n\t\tnewInput.push_back(uInput.at(i+1));\n\t\tchar* temp = new char[newInput.length()+1];\n\t\ttemp = strcpy(temp, newInput.c_str());\n\t\tsubstr.push_back(temp);\n\t\tnewInput.clear();\n\t\tnewInput.push_back(uInput.at(i));\n\t\tnewInput.push_back(uInput.at(i+1));\n\/\/\t\tnewInput.erase(newInput.end()-1);\n\t\ti++;\n\t}\n}\n\nchar* temp = new char[newInput.length()+1];\ntemp = strcpy(temp, newInput.c_str());\nsubstr.push_back(temp);\nnewInput.clear();\t\t\n\t\nsubstr.push_back(NULL);\n*\/\n\n\/*\n\tCmd* A = new Cmd(\"ls\");\n\tCmd* B = new Cmd(\"asdf\");\n\tSemicolon* C = new Semicolon(false,A);\n\tPound* D = new Pound(false, B);\n\tOr* E = new Or(false, A);\n\tif (E->isValid)\n\t{\n\t\tcout << \"GOOD \" << endl;\n\t}\n\telse\n\t{\n\t\tcout << \"ERROR\" << endl;\n\t}\n*\/\n<|endoftext|>"} {"text":"<commit_before>#define MS_CLASS \"RTC::NackGenerator\"\n\/\/ #define MS_LOG_DEV\n\n#include \"RTC\/NackGenerator.hpp\"\n#include \"DepLibUV.hpp\"\n#include \"Logger.hpp\"\n\nnamespace RTC\n{\n\t\/* Static. *\/\n\n\tconstexpr uint32_t MaxPacketAge{ 2500 };\n\tconstexpr size_t MaxNackPackets{ 300 };\n\tconstexpr uint32_t DefaultRtt{ 100 };\n\tconstexpr uint8_t MaxNackRetries{ 3 };\n\tconstexpr uint64_t TimerInterval{ 50 };\n\n\t\/* Instance methods. *\/\n\n\tNackGenerator::NackGenerator(Listener* listener) : listener(listener), rtt(DefaultRtt)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Set the timer.\n\t\tthis->timer = new Timer(this);\n\t}\n\n\tNackGenerator::~NackGenerator()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Close the timer.\n\t\tthis->timer->Destroy();\n\t}\n\n\tvoid NackGenerator::ReceivePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tuint32_t seq32 = packet->GetExtendedSequenceNumber();\n\n\t\tif (!this->started)\n\t\t{\n\t\t\tthis->lastSeq32 = seq32;\n\t\t\tthis->started = true;\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Obviously never nacked, so ignore.\n\t\tif (seq32 == this->lastSeq32)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tif (seq32 == this->lastSeq32 + 1)\n\t\t{\n\t\t\tthis->lastSeq32++;\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ May be an out of order packet or a retransmitted packet (without RTX).\n\t\tif (seq32 < this->lastSeq32)\n\t\t{\n\t\t\tauto it = this->nackList.find(seq32);\n\n\t\t\t\/\/ It was a nacked packet.\n\t\t\tif (it != this->nackList.end())\n\t\t\t{\n\t\t\t\tMS_DEBUG_TAG(\n\t\t\t\t rtx,\n\t\t\t\t \"NACKed packet received [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \"]\",\n\t\t\t\t packet->GetSsrc(),\n\t\t\t\t packet->GetSequenceNumber());\n\n\t\t\t\tthis->nackList.erase(it);\n\t\t\t}\n\t\t\t\/\/ Out of order packet.\n\t\t\telse\n\t\t\t{\n\t\t\t\tMS_DEBUG_TAG(\n\t\t\t\t rtx,\n\t\t\t\t \"out of order RTX packet received [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \"]\",\n\t\t\t\t packet->GetSsrc(),\n\t\t\t\t packet->GetSequenceNumber());\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Otherwise we may have lost some packets.\n\t\tAddPacketsToNackList(this->lastSeq32 + 1, seq32);\n\t\tthis->lastSeq32 = seq32;\n\n\t\t\/\/ Check if there are any nacks that are waiting for this seq number.\n\t\tstd::vector<uint16_t> nackBatch = GetNackBatch(NackFilter::SEQ);\n\n\t\tif (!nackBatch.empty())\n\t\t\tthis->listener->OnNackGeneratorNackRequired(nackBatch);\n\n\t\tMayRunTimer();\n\t}\n\n\tvoid NackGenerator::AddPacketsToNackList(uint32_t seq32Start, uint32_t seq32End)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Remove old packets.\n\t\tauto it = this->nackList.lower_bound(seq32End - MaxPacketAge);\n\n\t\tthis->nackList.erase(this->nackList.begin(), it);\n\n\t\t\/\/ If the nack list is too large, clear it and request a full frame.\n\t\tuint32_t numNewNacks = seq32End - seq32Start;\n\n\t\tif (this->nackList.size() + numNewNacks > MaxNackPackets)\n\t\t{\n\t\t\tMS_DEBUG_TAG(rtx, \"NACK list too large, clearing it and requesting a full frame\");\n\n\t\t\tthis->nackList.clear();\n\t\t\tthis->listener->OnNackGeneratorFullFrameRequired();\n\n\t\t\treturn;\n\t\t}\n\n\t\tfor (uint32_t seq32 = seq32Start; seq32 != seq32End; ++seq32)\n\t\t{\n\t\t\t\/\/ NOTE: Let the packet become out of order for a while without requesting\n\t\t\t\/\/ it into a NACK.\n\t\t\t\/\/ TODO: To be done.\n\t\t\tuint32_t sendAtSeqNum = seq32 + 0;\n\n\t\t\tNackInfo nackInfo(seq32, sendAtSeqNum);\n\n\t\t\tMS_ASSERT(\n\t\t\t this->nackList.find(seq32) == this->nackList.end(), \"packet already in the NACK list\");\n\n\t\t\tthis->nackList[seq32] = nackInfo;\n\t\t}\n\t}\n\n\tstd::vector<uint16_t> NackGenerator::GetNackBatch(NackFilter filter)\n\t{\n\t\tuint64_t now = DepLibUV::GetTime();\n\t\tstd::vector<uint16_t> nackBatch;\n\t\tauto it = this->nackList.begin();\n\n\t\twhile (it != this->nackList.end())\n\t\t{\n\t\t\tNackInfo& nackInfo = it->second;\n\t\t\tuint16_t seq = nackInfo.seq32 % (1 << 16);\n\n\t\t\tif (filter == NackFilter::SEQ && nackInfo.sentAtTime == 0 && this->lastSeq32 >= nackInfo.sendAtSeqNum)\n\t\t\t{\n\t\t\t\tnackInfo.retries++;\n\t\t\t\tnackInfo.sentAtTime = now;\n\n\t\t\t\tif (nackInfo.retries >= MaxNackRetries)\n\t\t\t\t{\n\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t rtx,\n\t\t\t\t\t \"sequence number removed from the NACK list due to max retries [seq:%\" PRIu16 \"]\",\n\t\t\t\t\t seq);\n\n\t\t\t\t\tit = this->nackList.erase(it);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnackBatch.emplace_back(seq);\n\t\t\t\t\t++it;\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (filter == NackFilter::TIME && nackInfo.sentAtTime + this->rtt < now)\n\t\t\t{\n\t\t\t\tnackInfo.retries++;\n\t\t\t\tnackInfo.sentAtTime = now;\n\n\t\t\t\tif (nackInfo.retries >= MaxNackRetries)\n\t\t\t\t{\n\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t rtx,\n\t\t\t\t\t \"sequence number removed from the NACK list due to max retries [seq:%\" PRIu16 \"]\",\n\t\t\t\t\t seq);\n\n\t\t\t\t\tit = this->nackList.erase(it);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnackBatch.emplace_back(seq);\n\t\t\t\t\t++it;\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t++it;\n\t\t}\n\n\t\treturn nackBatch;\n\t}\n\n\tinline void NackGenerator::MayRunTimer() const\n\t{\n\t\tif (!this->nackList.empty())\n\t\t\tthis->timer->Start(TimerInterval);\n\t}\n\n\tinline void NackGenerator::OnTimer(Timer* \/*timer*\/)\n\t{\n\t\tMS_TRACE();\n\n\t\tstd::vector<uint16_t> nackBatch = GetNackBatch(NackFilter::TIME);\n\n\t\tif (!nackBatch.empty())\n\t\t\tthis->listener->OnNackGeneratorNackRequired(nackBatch);\n\n\t\tMayRunTimer();\n\t}\n} \/\/ namespace RTC\n<commit_msg>NackGenerator: improve debug<commit_after>#define MS_CLASS \"RTC::NackGenerator\"\n\/\/ #define MS_LOG_DEV\n\n#include \"RTC\/NackGenerator.hpp\"\n#include \"DepLibUV.hpp\"\n#include \"Logger.hpp\"\n\nnamespace RTC\n{\n\t\/* Static. *\/\n\n\tconstexpr uint32_t MaxPacketAge{ 2500 };\n\tconstexpr size_t MaxNackPackets{ 300 };\n\tconstexpr uint32_t DefaultRtt{ 100 };\n\tconstexpr uint8_t MaxNackRetries{ 3 };\n\tconstexpr uint64_t TimerInterval{ 50 };\n\n\t\/* Instance methods. *\/\n\n\tNackGenerator::NackGenerator(Listener* listener) : listener(listener), rtt(DefaultRtt)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Set the timer.\n\t\tthis->timer = new Timer(this);\n\t}\n\n\tNackGenerator::~NackGenerator()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Close the timer.\n\t\tthis->timer->Destroy();\n\t}\n\n\tvoid NackGenerator::ReceivePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tuint32_t seq32 = packet->GetExtendedSequenceNumber();\n\n\t\tif (!this->started)\n\t\t{\n\t\t\tthis->lastSeq32 = seq32;\n\t\t\tthis->started = true;\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Obviously never nacked, so ignore.\n\t\tif (seq32 == this->lastSeq32)\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\tif (seq32 == this->lastSeq32 + 1)\n\t\t{\n\t\t\tthis->lastSeq32++;\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ May be an out of order packet, or already handled retransmitted packet,\n\t\t\/\/ or a retransmitted packet.\n\t\tif (seq32 < this->lastSeq32)\n\t\t{\n\t\t\tauto it = this->nackList.find(seq32);\n\n\t\t\t\/\/ It was a nacked packet.\n\t\t\tif (it != this->nackList.end())\n\t\t\t{\n\t\t\t\tMS_DEBUG_TAG(\n\t\t\t\t rtx,\n\t\t\t\t \"NACKed packet received [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \"]\",\n\t\t\t\t packet->GetSsrc(),\n\t\t\t\t packet->GetSequenceNumber());\n\n\t\t\t\tthis->nackList.erase(it);\n\t\t\t}\n\t\t\t\/\/ Out of order packet or already handled NACKed packet.\n\t\t\telse\n\t\t\t{\n\t\t\t\tMS_DEBUG_TAG(\n\t\t\t\t rtx,\n\t\t\t\t \"ignoring out of order packet or already handled NACKed packet [ssrc:%\" PRIu32\n\t\t\t\t \", seq:%\" PRIu16 \"]\",\n\t\t\t\t packet->GetSsrc(),\n\t\t\t\t packet->GetSequenceNumber());\n\t\t\t}\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Otherwise we may have lost some packets.\n\t\tAddPacketsToNackList(this->lastSeq32 + 1, seq32);\n\t\tthis->lastSeq32 = seq32;\n\n\t\t\/\/ Check if there are any nacks that are waiting for this seq number.\n\t\tstd::vector<uint16_t> nackBatch = GetNackBatch(NackFilter::SEQ);\n\n\t\tif (!nackBatch.empty())\n\t\t\tthis->listener->OnNackGeneratorNackRequired(nackBatch);\n\n\t\tMayRunTimer();\n\t}\n\n\tvoid NackGenerator::AddPacketsToNackList(uint32_t seq32Start, uint32_t seq32End)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Remove old packets.\n\t\tauto it = this->nackList.lower_bound(seq32End - MaxPacketAge);\n\n\t\tthis->nackList.erase(this->nackList.begin(), it);\n\n\t\t\/\/ If the nack list is too large, clear it and request a full frame.\n\t\tuint32_t numNewNacks = seq32End - seq32Start;\n\n\t\tif (this->nackList.size() + numNewNacks > MaxNackPackets)\n\t\t{\n\t\t\tMS_DEBUG_TAG(rtx, \"NACK list too large, clearing it and requesting a full frame\");\n\n\t\t\tthis->nackList.clear();\n\t\t\tthis->listener->OnNackGeneratorFullFrameRequired();\n\n\t\t\treturn;\n\t\t}\n\n\t\tfor (uint32_t seq32 = seq32Start; seq32 != seq32End; ++seq32)\n\t\t{\n\t\t\t\/\/ NOTE: Let the packet become out of order for a while without requesting\n\t\t\t\/\/ it into a NACK.\n\t\t\t\/\/ TODO: To be done.\n\t\t\tuint32_t sendAtSeqNum = seq32 + 0;\n\n\t\t\tNackInfo nackInfo(seq32, sendAtSeqNum);\n\n\t\t\tMS_ASSERT(\n\t\t\t this->nackList.find(seq32) == this->nackList.end(), \"packet already in the NACK list\");\n\n\t\t\tthis->nackList[seq32] = nackInfo;\n\t\t}\n\t}\n\n\tstd::vector<uint16_t> NackGenerator::GetNackBatch(NackFilter filter)\n\t{\n\t\tuint64_t now = DepLibUV::GetTime();\n\t\tstd::vector<uint16_t> nackBatch;\n\t\tauto it = this->nackList.begin();\n\n\t\twhile (it != this->nackList.end())\n\t\t{\n\t\t\tNackInfo& nackInfo = it->second;\n\t\t\tuint16_t seq = nackInfo.seq32 % (1 << 16);\n\n\t\t\tif (filter == NackFilter::SEQ && nackInfo.sentAtTime == 0 && this->lastSeq32 >= nackInfo.sendAtSeqNum)\n\t\t\t{\n\t\t\t\tnackInfo.retries++;\n\t\t\t\tnackInfo.sentAtTime = now;\n\n\t\t\t\tif (nackInfo.retries >= MaxNackRetries)\n\t\t\t\t{\n\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t rtx,\n\t\t\t\t\t \"sequence number removed from the NACK list due to max retries [seq:%\" PRIu16 \"]\",\n\t\t\t\t\t seq);\n\n\t\t\t\t\tit = this->nackList.erase(it);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnackBatch.emplace_back(seq);\n\t\t\t\t\t++it;\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (filter == NackFilter::TIME && nackInfo.sentAtTime + this->rtt < now)\n\t\t\t{\n\t\t\t\tnackInfo.retries++;\n\t\t\t\tnackInfo.sentAtTime = now;\n\n\t\t\t\tif (nackInfo.retries >= MaxNackRetries)\n\t\t\t\t{\n\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t rtx,\n\t\t\t\t\t \"sequence number removed from the NACK list due to max retries [seq:%\" PRIu16 \"]\",\n\t\t\t\t\t seq);\n\n\t\t\t\t\tit = this->nackList.erase(it);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnackBatch.emplace_back(seq);\n\t\t\t\t\t++it;\n\t\t\t\t}\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t++it;\n\t\t}\n\n\t\treturn nackBatch;\n\t}\n\n\tinline void NackGenerator::MayRunTimer() const\n\t{\n\t\tif (!this->nackList.empty())\n\t\t\tthis->timer->Start(TimerInterval);\n\t}\n\n\tinline void NackGenerator::OnTimer(Timer* \/*timer*\/)\n\t{\n\t\tMS_TRACE();\n\n\t\tstd::vector<uint16_t> nackBatch = GetNackBatch(NackFilter::TIME);\n\n\t\tif (!nackBatch.empty())\n\t\t\tthis->listener->OnNackGeneratorNackRequired(nackBatch);\n\n\t\tMayRunTimer();\n\t}\n} \/\/ namespace RTC\n<|endoftext|>"} {"text":"<commit_before>#define MS_CLASS \"RTC::RtpStreamSend\"\n\/\/ #define MS_LOG_DEV\n\n#include \"RTC\/RtpStreamSend.hpp\"\n#include \"DepLibUV.hpp\"\n#include \"Logger.hpp\"\n#include \"Utils.hpp\"\n\nnamespace RTC\n{\n\t\/* Static. *\/\n\n\tstatic constexpr uint32_t RtpSeqMod{ 1 << 16 };\n\t\/\/ Don't retransmit packets older than this (ms).\n\t\/\/ TODO: This must be tunned.\n\tstatic constexpr uint32_t MaxRetransmissionDelay{ 4000 };\n\tstatic constexpr uint32_t DefaultRtt{ 100 };\n\n\t\/* Instance methods. *\/\n\n\tRtpStreamSend::RtpStreamSend(RTC::RtpStream::Params& params, size_t bufferSize)\n\t : RtpStream::RtpStream(params), storage(bufferSize)\n\t{\n\t\tMS_TRACE();\n\t}\n\n\tRtpStreamSend::~RtpStreamSend()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Clear the RTP buffer.\n\t\tClearRetransmissionBuffer();\n\t}\n\n\tbool RtpStreamSend::ReceivePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Call the parent method.\n\t\tif (!RtpStream::ReceivePacket(packet))\n\t\t\treturn false;\n\n\t\t\/\/ If bufferSize was given, store the packet into the buffer.\n\t\tif (!this->storage.empty())\n\t\t\tStorePacket(packet);\n\n\t\treturn true;\n\t}\n\n\tvoid RtpStreamSend::ReceiveRtcpReceiverReport(RTC::RTCP::ReceiverReport* report)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/* Calculate RTT. *\/\n\n\t\t\/\/ Get the compact NTP representation of the current timestamp.\n\t\tUtils::Time::Ntp nowNtp{};\n\t\tUtils::Time::CurrentTimeNtp(nowNtp);\n\t\tuint32_t nowCompactNtp = (nowNtp.seconds & 0x0000FFFF) << 16;\n\n\t\tnowCompactNtp |= (nowNtp.fractions & 0xFFFF0000) >> 16;\n\n\t\tuint32_t lastSr = report->GetLastSenderReport();\n\t\tuint32_t dlsr = report->GetDelaySinceLastSenderReport();\n\t\t\/\/ RTT in 1\/2^16 seconds.\n\t\tuint32_t rtt = nowCompactNtp - dlsr - lastSr;\n\n\t\t\/\/ RTT in milliseconds.\n\t\tthis->rtt = ((rtt >> 16) * 1000);\n\t\tthis->rtt += (static_cast<float>(rtt & 0x0000FFFF) \/ 65536) * 1000;\n\n\t\tthis->totalLost = report->GetTotalLost();\n\t\tthis->fractionLost = report->GetFractionLost();\n\t\tthis->jitter = report->GetJitter();\n\t}\n\n\t\/\/ This method looks for the requested RTP packets and inserts them into the\n\t\/\/ given container (and set to null the next container position).\n\tvoid RtpStreamSend::RequestRtpRetransmission(\n\t uint16_t seq, uint16_t bitmask, std::vector<RTC::RtpPacket*>& container)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ 17: 16 bit mask + the initial sequence number.\n\t\tstatic constexpr size_t MaxRequestedPackets{ 17 };\n\n\t\t\/\/ Ensure the container's first element is 0.\n\t\tcontainer[0] = nullptr;\n\n\t\t\/\/ If NACK is not supported, exit.\n\t\tif (!this->params.useNack)\n\t\t{\n\t\t\tMS_WARN_TAG(rtx, \"NACK not negotiated\");\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ If the buffer is empty just return.\n\t\tif (this->buffer.empty())\n\t\t\treturn;\n\n\t\t\/\/ Convert the given sequence numbers to 32 bits.\n\t\tuint32_t firstSeq32 = uint32_t{ seq } + this->cycles;\n\t\tuint32_t lastSeq32 = firstSeq32 + MaxRequestedPackets - 1;\n\n\t\t\/\/ Number of requested packets cannot be greater than the container size - 1.\n\t\tMS_ASSERT(container.size() - 1 >= MaxRequestedPackets, \"RtpPacket container is too small\");\n\n\t\tauto bufferIt = this->buffer.begin();\n\t\tauto bufferItReverse = this->buffer.rbegin();\n\t\tuint32_t bufferFirstSeq32 = (*bufferIt).seq32;\n\t\tuint32_t bufferLastSeq32 = (*bufferItReverse).seq32;\n\t\tbool inRange = true;\n\n\t\t\/\/ Requested packet range not found.\n\t\tif (firstSeq32 > bufferLastSeq32 || lastSeq32 < bufferFirstSeq32)\n\t\t{\n\t\t\t\/\/ Let's try with sequence numbers in the previous 16 cycle.\n\t\t\tif (this->cycles > 0)\n\t\t\t{\n\t\t\t\tfirstSeq32 -= RtpSeqMod;\n\t\t\t\tlastSeq32 -= RtpSeqMod;\n\n\t\t\t\t\/\/ Try again.\n\t\t\t\tif (firstSeq32 > bufferLastSeq32 || lastSeq32 < bufferFirstSeq32)\n\t\t\t\t{\n\t\t\t\t\tfirstSeq32 += RtpSeqMod;\n\t\t\t\t\tlastSeq32 += RtpSeqMod;\n\t\t\t\t\tinRange = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ Otherwise just return.\n\t\t\telse\n\t\t\t{\n\t\t\t\tinRange = false;\n\t\t\t}\n\t\t}\n\n\t\tif (!inRange)\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtx,\n\t\t\t \"requested packet range not in the buffer [seq:%\" PRIu16 \", seq32:%\" PRIu32\n\t\t\t \", bufferFirstSeq32:%\" PRIu32 \", bufferLastSeq32:%\" PRIu32 \"]\",\n\t\t\t seq,\n\t\t\t firstSeq32,\n\t\t\t bufferFirstSeq32,\n\t\t\t bufferLastSeq32);\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Look for each requested packet.\n\t\tuint64_t now = DepLibUV::GetTime();\n\t\tuint32_t rtt = (this->rtt != 0u ? this->rtt : DefaultRtt);\n\t\tuint32_t seq32 = firstSeq32;\n\t\tbool requested{ true };\n\t\tsize_t containerIdx{ 0 };\n\n\t\t\/\/ Some variables for debugging.\n\t\tuint16_t origBitmask = bitmask;\n\t\tuint16_t sentBitmask{ 0b0000000000000000 };\n\t\tbool isFirstPacket{ true };\n\t\tbool firstPacketSent{ false };\n\t\tuint8_t bitmaskCounter{ 0 };\n\t\tbool tooOldPacketFound{ false };\n\n\t\twhile (requested || bitmask != 0)\n\t\t{\n\t\t\tbool sent = false;\n\n\t\t\tif (requested)\n\t\t\t{\n\t\t\t\tfor (; bufferIt != this->buffer.end(); ++bufferIt)\n\t\t\t\t{\n\t\t\t\t\tauto currentSeq32 = (*bufferIt).seq32;\n\n\t\t\t\t\t\/\/ Found.\n\t\t\t\t\tif (currentSeq32 == seq32)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto currentPacket = (*bufferIt).packet;\n\t\t\t\t\t\t\/\/ Calculate how the elapsed time between the max timestampt seen and\n\t\t\t\t\t\t\/\/ the requested packet's timestampt (in ms).\n\t\t\t\t\t\tuint32_t diffTs = this->maxPacketTs - currentPacket->GetTimestamp();\n\t\t\t\t\t\tuint32_t diffMs = diffTs * 1000 \/ this->params.clockRate;\n\n\t\t\t\t\t\t\/\/ Just provide the packet if no older than MaxRetransmissionDelay ms.\n\t\t\t\t\t\tif (diffMs > MaxRetransmissionDelay)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (!tooOldPacketFound)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ TODO: May we ask for a key frame in this case?\n\n\t\t\t\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t\t\t\t rtx,\n\t\t\t\t\t\t\t\t \"ignoring retransmission for too old packet \"\n\t\t\t\t\t\t\t\t \"[seq:%\" PRIu16 \", max age:%\" PRIu32 \"ms, packet age:%\" PRIu32 \"ms]\",\n\t\t\t\t\t\t\t\t currentPacket->GetSequenceNumber(),\n\t\t\t\t\t\t\t\t MaxRetransmissionDelay,\n\t\t\t\t\t\t\t\t diffMs);\n\n\t\t\t\t\t\t\t\ttooOldPacketFound = true;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Don't resent the packet if it was resent in the last RTT ms.\n\t\t\t\t\t\tuint32_t resentAtTime = (*bufferIt).resentAtTime;\n\n\t\t\t\t\t\tif ((resentAtTime != 0u) && now - resentAtTime < static_cast<uint64_t>(rtt))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t\t\t rtx,\n\t\t\t\t\t\t\t \"ignoring retransmission for a packet already resent in the last RTT ms \"\n\t\t\t\t\t\t\t \"[seq:%\" PRIu16 \", rtt:%\" PRIu32 \"]\",\n\t\t\t\t\t\t\t currentPacket->GetSequenceNumber(),\n\t\t\t\t\t\t\t rtt);\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Store the packet in the container and then increment its index.\n\t\t\t\t\t\tcontainer[containerIdx++] = currentPacket;\n\n\t\t\t\t\t\t\/\/ Save when this packet was resent.\n\t\t\t\t\t\t(*bufferIt).resentAtTime = now;\n\n\t\t\t\t\t\tsent = true;\n\t\t\t\t\t\tif (isFirstPacket)\n\t\t\t\t\t\t\tfirstPacketSent = true;\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ It can not be after this packet.\n\t\t\t\t\tif (currentSeq32 > seq32)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\trequested = (bitmask & 1) != 0;\n\t\t\tbitmask >>= 1;\n\t\t\t++seq32;\n\n\t\t\tif (!isFirstPacket)\n\t\t\t{\n\t\t\t\tsentBitmask |= (sent ? 1 : 0) << bitmaskCounter;\n\t\t\t\t++bitmaskCounter;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tisFirstPacket = false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ If not all the requested packets was sent, log it.\n\t\tif (!firstPacketSent || origBitmask != sentBitmask)\n\t\t{\n\t\t\tMS_DEBUG_TAG(\n\t\t\t rtx,\n\t\t\t \"could not resend all packets [seq:%\" PRIu16\n\t\t\t \", first:%s, \"\n\t\t\t \"bitmask:\" MS_UINT16_TO_BINARY_PATTERN \", sent bitmask:\" MS_UINT16_TO_BINARY_PATTERN \"]\",\n\t\t\t seq,\n\t\t\t firstPacketSent ? \"yes\" : \"no\",\n\t\t\t MS_UINT16_TO_BINARY(origBitmask),\n\t\t\t MS_UINT16_TO_BINARY(sentBitmask));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tMS_DEBUG_TAG(\n\t\t\t rtx,\n\t\t\t \"all packets resent [seq:%\" PRIu16 \", bitmask:\" MS_UINT16_TO_BINARY_PATTERN \"]\",\n\t\t\t seq,\n\t\t\t MS_UINT16_TO_BINARY(origBitmask));\n\t\t}\n\n\t\t\/\/ Set the next container element to null.\n\t\tcontainer[containerIdx] = nullptr;\n\t}\n\n\tRTC::RTCP::SenderReport* RtpStreamSend::GetRtcpSenderReport(uint64_t now)\n\t{\n\t\tMS_TRACE();\n\n\t\tif (this->counter.GetPacketCount() == 0u)\n\t\t\treturn nullptr;\n\n\t\tauto report = new RTC::RTCP::SenderReport();\n\n\t\treport->SetPacketCount(this->counter.GetPacketCount());\n\t\treport->SetOctetCount(this->counter.GetBytes());\n\n\t\tUtils::Time::Ntp ntp{};\n\t\tUtils::Time::CurrentTimeNtp(ntp);\n\n\t\treport->SetNtpSec(ntp.seconds);\n\t\treport->SetNtpFrac(ntp.fractions);\n\n\t\t\/\/ Calculate RTP timestamp diff between now and last received RTP packet.\n\t\tauto diffMs = static_cast<uint32_t>(now - this->maxPacketMs);\n\t\tuint32_t diffTs = diffMs * this->params.clockRate \/ 1000;\n\n\t\treport->SetRtpTs(this->maxPacketTs + diffTs);\n\n\t\treturn report;\n\t}\n\n\tvoid RtpStreamSend::ClearRetransmissionBuffer()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Delete cloned packets.\n\t\tfor (auto& bufferItem : this->buffer)\n\t\t{\n\t\t\tdelete bufferItem.packet;\n\t\t}\n\n\t\t\/\/ Clear list.\n\t\tthis->buffer.clear();\n\t}\n\n\tinline void RtpStreamSend::StorePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tif (packet->GetSize() > RTC::MtuSize)\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtp,\n\t\t\t \"packet too big [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \", size:%zu]\",\n\t\t\t packet->GetSsrc(),\n\t\t\t packet->GetSequenceNumber(),\n\t\t\t packet->GetSize());\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Sum the packet seq number and the number of 16 bits cycles.\n\t\tuint32_t packetSeq32 = packet->GetExtendedSequenceNumber();\n\t\tBufferItem bufferItem;\n\n\t\tbufferItem.seq32 = packetSeq32;\n\n\t\t\/\/ If empty do it easy.\n\t\tif (this->buffer.empty())\n\t\t{\n\t\t\tauto store = this->storage[0].store;\n\n\t\t\tbufferItem.packet = packet->Clone(store);\n\t\t\tthis->buffer.push_back(bufferItem);\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Otherwise, do the stuff.\n\n\t\tBuffer::iterator newBufferIt;\n\t\tuint8_t* store{ nullptr };\n\n\t\t\/\/ Iterate the buffer in reverse order and find the proper place to store the\n\t\t\/\/ packet.\n\t\tauto bufferItReverse = this->buffer.rbegin();\n\t\tfor (; bufferItReverse != this->buffer.rend(); ++bufferItReverse)\n\t\t{\n\t\t\tauto currentSeq32 = (*bufferItReverse).seq32;\n\n\t\t\tif (packetSeq32 > currentSeq32)\n\t\t\t{\n\t\t\t\t\/\/ Get a forward iterator pointing to the same element.\n\t\t\t\tauto it = bufferItReverse.base();\n\n\t\t\t\tnewBufferIt = this->buffer.insert(it, bufferItem);\n\n\t\t\t\t\/\/ Exit the loop.\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\/\/ If the packet was older than anything in the buffer, just ignore it.\n\t\t\/\/ NOTE: This should never happen.\n\t\tif (bufferItReverse == this->buffer.rend())\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtp,\n\t\t\t \"ignoring packet older than anything in the buffer [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \"]\",\n\t\t\t packet->GetSsrc(),\n\t\t\t packet->GetSequenceNumber());\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ If the buffer is not full use the next free storage item.\n\t\tif (this->buffer.size() - 1 < this->storage.size())\n\t\t{\n\t\t\tstore = this->storage[this->buffer.size() - 1].store;\n\t\t}\n\t\t\/\/ Otherwise remove the first packet of the buffer and replace its storage area.\n\t\telse\n\t\t{\n\t\t\tauto& firstBufferItem = *(this->buffer.begin());\n\t\t\tauto firstPacket = firstBufferItem.packet;\n\n\t\t\t\/\/ Store points to the store used by the first packet.\n\t\t\tstore = const_cast<uint8_t*>(firstPacket->GetData());\n\t\t\t\/\/ Free the first packet.\n\t\t\tdelete firstPacket;\n\t\t\t\/\/ Remove the first element in the list.\n\t\t\tthis->buffer.pop_front();\n\t\t}\n\n\t\t\/\/ Update the new buffer item so it points to the cloned packed.\n\t\t(*newBufferIt).packet = packet->Clone(store);\n\t}\n\n\tvoid RtpStreamSend::CheckHealth()\n\t{\n\t\tMS_TRACE();\n\t}\n\n\tvoid RtpStreamSend::SetRtx(uint8_t payloadType, uint32_t ssrc)\n\t{\n\t\tMS_TRACE();\n\n\t\tthis->hasRtx = true;\n\t\tthis->rtxPayloadType = payloadType;\n\t\tthis->rtxSsrc = ssrc;\n\t\tthis->rtxSeq = Utils::Crypto::GetRandomUInt(0u, 0xFFFF);\n\t}\n\n\tvoid RtpStreamSend::RtxEncode(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tMS_ASSERT(this->hasRtx, \"RTX not enabled on this stream\");\n\n\t\tpacket->RtxEncode(this->rtxPayloadType, this->rtxSsrc, ++this->rtxSeq);\n\t}\n\n} \/\/ namespace RTC\n<commit_msg>Fix uint32_t casting that was causing a wrong calculation<commit_after>#define MS_CLASS \"RTC::RtpStreamSend\"\n\/\/ #define MS_LOG_DEV\n\n#include \"RTC\/RtpStreamSend.hpp\"\n#include \"DepLibUV.hpp\"\n#include \"Logger.hpp\"\n#include \"Utils.hpp\"\n\nnamespace RTC\n{\n\t\/* Static. *\/\n\n\tstatic constexpr uint32_t RtpSeqMod{ 1 << 16 };\n\t\/\/ Don't retransmit packets older than this (ms).\n\t\/\/ TODO: This must be tunned.\n\tstatic constexpr uint32_t MaxRetransmissionDelay{ 4000 };\n\tstatic constexpr uint32_t DefaultRtt{ 100 };\n\n\t\/* Instance methods. *\/\n\n\tRtpStreamSend::RtpStreamSend(RTC::RtpStream::Params& params, size_t bufferSize)\n\t : RtpStream::RtpStream(params), storage(bufferSize)\n\t{\n\t\tMS_TRACE();\n\t}\n\n\tRtpStreamSend::~RtpStreamSend()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Clear the RTP buffer.\n\t\tClearRetransmissionBuffer();\n\t}\n\n\tbool RtpStreamSend::ReceivePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Call the parent method.\n\t\tif (!RtpStream::ReceivePacket(packet))\n\t\t\treturn false;\n\n\t\t\/\/ If bufferSize was given, store the packet into the buffer.\n\t\tif (!this->storage.empty())\n\t\t\tStorePacket(packet);\n\n\t\treturn true;\n\t}\n\n\tvoid RtpStreamSend::ReceiveRtcpReceiverReport(RTC::RTCP::ReceiverReport* report)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/* Calculate RTT. *\/\n\n\t\t\/\/ Get the compact NTP representation of the current timestamp.\n\t\tUtils::Time::Ntp nowNtp{};\n\t\tUtils::Time::CurrentTimeNtp(nowNtp);\n\t\tuint32_t nowCompactNtp = (nowNtp.seconds & 0x0000FFFF) << 16;\n\n\t\tnowCompactNtp |= (nowNtp.fractions & 0xFFFF0000) >> 16;\n\n\t\tuint32_t lastSr = report->GetLastSenderReport();\n\t\tuint32_t dlsr = report->GetDelaySinceLastSenderReport();\n\t\t\/\/ RTT in 1\/2^16 seconds.\n\t\tuint32_t rtt = nowCompactNtp - dlsr - lastSr;\n\n\t\t\/\/ RTT in milliseconds.\n\t\tthis->rtt = ((rtt >> 16) * 1000);\n\t\tthis->rtt += (static_cast<float>(rtt & 0x0000FFFF) \/ 65536) * 1000;\n\n\t\tthis->totalLost = report->GetTotalLost();\n\t\tthis->fractionLost = report->GetFractionLost();\n\t\tthis->jitter = report->GetJitter();\n\t}\n\n\t\/\/ This method looks for the requested RTP packets and inserts them into the\n\t\/\/ given container (and set to null the next container position).\n\tvoid RtpStreamSend::RequestRtpRetransmission(\n\t uint16_t seq, uint16_t bitmask, std::vector<RTC::RtpPacket*>& container)\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ 17: 16 bit mask + the initial sequence number.\n\t\tstatic constexpr size_t MaxRequestedPackets{ 17 };\n\n\t\t\/\/ Ensure the container's first element is 0.\n\t\tcontainer[0] = nullptr;\n\n\t\t\/\/ If NACK is not supported, exit.\n\t\tif (!this->params.useNack)\n\t\t{\n\t\t\tMS_WARN_TAG(rtx, \"NACK not negotiated\");\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ If the buffer is empty just return.\n\t\tif (this->buffer.empty())\n\t\t\treturn;\n\n\t\t\/\/ Convert the given sequence numbers to 32 bits.\n\t\tuint32_t firstSeq32 = uint32_t{ seq } + this->cycles;\n\t\tuint32_t lastSeq32 = firstSeq32 + MaxRequestedPackets - 1;\n\n\t\t\/\/ Number of requested packets cannot be greater than the container size - 1.\n\t\tMS_ASSERT(container.size() - 1 >= MaxRequestedPackets, \"RtpPacket container is too small\");\n\n\t\tauto bufferIt = this->buffer.begin();\n\t\tauto bufferItReverse = this->buffer.rbegin();\n\t\tuint32_t bufferFirstSeq32 = (*bufferIt).seq32;\n\t\tuint32_t bufferLastSeq32 = (*bufferItReverse).seq32;\n\t\tbool inRange = true;\n\n\t\t\/\/ Requested packet range not found.\n\t\tif (firstSeq32 > bufferLastSeq32 || lastSeq32 < bufferFirstSeq32)\n\t\t{\n\t\t\t\/\/ Let's try with sequence numbers in the previous 16 cycle.\n\t\t\tif (this->cycles > 0)\n\t\t\t{\n\t\t\t\tfirstSeq32 -= RtpSeqMod;\n\t\t\t\tlastSeq32 -= RtpSeqMod;\n\n\t\t\t\t\/\/ Try again.\n\t\t\t\tif (firstSeq32 > bufferLastSeq32 || lastSeq32 < bufferFirstSeq32)\n\t\t\t\t{\n\t\t\t\t\tfirstSeq32 += RtpSeqMod;\n\t\t\t\t\tlastSeq32 += RtpSeqMod;\n\t\t\t\t\tinRange = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ Otherwise just return.\n\t\t\telse\n\t\t\t{\n\t\t\t\tinRange = false;\n\t\t\t}\n\t\t}\n\n\t\tif (!inRange)\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtx,\n\t\t\t \"requested packet range not in the buffer [seq:%\" PRIu16 \", seq32:%\" PRIu32\n\t\t\t \", bufferFirstSeq32:%\" PRIu32 \", bufferLastSeq32:%\" PRIu32 \"]\",\n\t\t\t seq,\n\t\t\t firstSeq32,\n\t\t\t bufferFirstSeq32,\n\t\t\t bufferLastSeq32);\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Look for each requested packet.\n\t\tuint64_t now = DepLibUV::GetTime();\n\t\tuint32_t rtt = (this->rtt != 0u ? this->rtt : DefaultRtt);\n\t\tuint32_t seq32 = firstSeq32;\n\t\tbool requested{ true };\n\t\tsize_t containerIdx{ 0 };\n\n\t\t\/\/ Some variables for debugging.\n\t\tuint16_t origBitmask = bitmask;\n\t\tuint16_t sentBitmask{ 0b0000000000000000 };\n\t\tbool isFirstPacket{ true };\n\t\tbool firstPacketSent{ false };\n\t\tuint8_t bitmaskCounter{ 0 };\n\t\tbool tooOldPacketFound{ false };\n\n\t\twhile (requested || bitmask != 0)\n\t\t{\n\t\t\tbool sent = false;\n\n\t\t\tif (requested)\n\t\t\t{\n\t\t\t\tfor (; bufferIt != this->buffer.end(); ++bufferIt)\n\t\t\t\t{\n\t\t\t\t\tauto currentSeq32 = (*bufferIt).seq32;\n\n\t\t\t\t\t\/\/ Found.\n\t\t\t\t\tif (currentSeq32 == seq32)\n\t\t\t\t\t{\n\t\t\t\t\t\tauto currentPacket = (*bufferIt).packet;\n\t\t\t\t\t\t\/\/ Calculate how the elapsed time between the max timestampt seen and\n\t\t\t\t\t\t\/\/ the requested packet's timestampt (in ms).\n\t\t\t\t\t\tuint32_t diffTs = this->maxPacketTs - currentPacket->GetTimestamp();\n\t\t\t\t\t\tuint32_t diffMs = diffTs * 1000 \/ this->params.clockRate;\n\n\t\t\t\t\t\t\/\/ Just provide the packet if no older than MaxRetransmissionDelay ms.\n\t\t\t\t\t\tif (diffMs > MaxRetransmissionDelay)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (!tooOldPacketFound)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\/\/ TODO: May we ask for a key frame in this case?\n\n\t\t\t\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t\t\t\t rtx,\n\t\t\t\t\t\t\t\t \"ignoring retransmission for too old packet \"\n\t\t\t\t\t\t\t\t \"[seq:%\" PRIu16 \", max age:%\" PRIu32 \"ms, packet age:%\" PRIu32 \"ms]\",\n\t\t\t\t\t\t\t\t currentPacket->GetSequenceNumber(),\n\t\t\t\t\t\t\t\t MaxRetransmissionDelay,\n\t\t\t\t\t\t\t\t diffMs);\n\n\t\t\t\t\t\t\t\ttooOldPacketFound = true;\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Don't resent the packet if it was resent in the last RTT ms.\n\t\t\t\t\t\tauto resentAtTime = (*bufferIt).resentAtTime;\n\n\t\t\t\t\t\tif ((resentAtTime != 0u) && now - resentAtTime < static_cast<uint64_t>(rtt))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tMS_WARN_TAG(\n\t\t\t\t\t\t\t rtx,\n\t\t\t\t\t\t\t \"ignoring retransmission for a packet already resent in the last RTT ms \"\n\t\t\t\t\t\t\t \"[seq:%\" PRIu16 \", rtt:%\" PRIu32 \"]\",\n\t\t\t\t\t\t\t currentPacket->GetSequenceNumber(),\n\t\t\t\t\t\t\t rtt);\n\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\/\/ Store the packet in the container and then increment its index.\n\t\t\t\t\t\tcontainer[containerIdx++] = currentPacket;\n\n\t\t\t\t\t\t\/\/ Save when this packet was resent.\n\t\t\t\t\t\t(*bufferIt).resentAtTime = now;\n\n\t\t\t\t\t\tsent = true;\n\t\t\t\t\t\tif (isFirstPacket)\n\t\t\t\t\t\t\tfirstPacketSent = true;\n\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\t\/\/ It can not be after this packet.\n\t\t\t\t\tif (currentSeq32 > seq32)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\trequested = (bitmask & 1) != 0;\n\t\t\tbitmask >>= 1;\n\t\t\t++seq32;\n\n\t\t\tif (!isFirstPacket)\n\t\t\t{\n\t\t\t\tsentBitmask |= (sent ? 1 : 0) << bitmaskCounter;\n\t\t\t\t++bitmaskCounter;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tisFirstPacket = false;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ If not all the requested packets was sent, log it.\n\t\tif (!firstPacketSent || origBitmask != sentBitmask)\n\t\t{\n\t\t\tMS_DEBUG_TAG(\n\t\t\t rtx,\n\t\t\t \"could not resend all packets [seq:%\" PRIu16\n\t\t\t \", first:%s, \"\n\t\t\t \"bitmask:\" MS_UINT16_TO_BINARY_PATTERN \", sent bitmask:\" MS_UINT16_TO_BINARY_PATTERN \"]\",\n\t\t\t seq,\n\t\t\t firstPacketSent ? \"yes\" : \"no\",\n\t\t\t MS_UINT16_TO_BINARY(origBitmask),\n\t\t\t MS_UINT16_TO_BINARY(sentBitmask));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tMS_DEBUG_TAG(\n\t\t\t rtx,\n\t\t\t \"all packets resent [seq:%\" PRIu16 \", bitmask:\" MS_UINT16_TO_BINARY_PATTERN \"]\",\n\t\t\t seq,\n\t\t\t MS_UINT16_TO_BINARY(origBitmask));\n\t\t}\n\n\t\t\/\/ Set the next container element to null.\n\t\tcontainer[containerIdx] = nullptr;\n\t}\n\n\tRTC::RTCP::SenderReport* RtpStreamSend::GetRtcpSenderReport(uint64_t now)\n\t{\n\t\tMS_TRACE();\n\n\t\tif (this->counter.GetPacketCount() == 0u)\n\t\t\treturn nullptr;\n\n\t\tauto report = new RTC::RTCP::SenderReport();\n\n\t\treport->SetPacketCount(this->counter.GetPacketCount());\n\t\treport->SetOctetCount(this->counter.GetBytes());\n\n\t\tUtils::Time::Ntp ntp{};\n\t\tUtils::Time::CurrentTimeNtp(ntp);\n\n\t\treport->SetNtpSec(ntp.seconds);\n\t\treport->SetNtpFrac(ntp.fractions);\n\n\t\t\/\/ Calculate RTP timestamp diff between now and last received RTP packet.\n\t\tauto diffMs = static_cast<uint32_t>(now - this->maxPacketMs);\n\t\tuint32_t diffTs = diffMs * this->params.clockRate \/ 1000;\n\n\t\treport->SetRtpTs(this->maxPacketTs + diffTs);\n\n\t\treturn report;\n\t}\n\n\tvoid RtpStreamSend::ClearRetransmissionBuffer()\n\t{\n\t\tMS_TRACE();\n\n\t\t\/\/ Delete cloned packets.\n\t\tfor (auto& bufferItem : this->buffer)\n\t\t{\n\t\t\tdelete bufferItem.packet;\n\t\t}\n\n\t\t\/\/ Clear list.\n\t\tthis->buffer.clear();\n\t}\n\n\tinline void RtpStreamSend::StorePacket(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tif (packet->GetSize() > RTC::MtuSize)\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtp,\n\t\t\t \"packet too big [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \", size:%zu]\",\n\t\t\t packet->GetSsrc(),\n\t\t\t packet->GetSequenceNumber(),\n\t\t\t packet->GetSize());\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Sum the packet seq number and the number of 16 bits cycles.\n\t\tuint32_t packetSeq32 = packet->GetExtendedSequenceNumber();\n\t\tBufferItem bufferItem;\n\n\t\tbufferItem.seq32 = packetSeq32;\n\n\t\t\/\/ If empty do it easy.\n\t\tif (this->buffer.empty())\n\t\t{\n\t\t\tauto store = this->storage[0].store;\n\n\t\t\tbufferItem.packet = packet->Clone(store);\n\t\t\tthis->buffer.push_back(bufferItem);\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ Otherwise, do the stuff.\n\n\t\tBuffer::iterator newBufferIt;\n\t\tuint8_t* store{ nullptr };\n\n\t\t\/\/ Iterate the buffer in reverse order and find the proper place to store the\n\t\t\/\/ packet.\n\t\tauto bufferItReverse = this->buffer.rbegin();\n\t\tfor (; bufferItReverse != this->buffer.rend(); ++bufferItReverse)\n\t\t{\n\t\t\tauto currentSeq32 = (*bufferItReverse).seq32;\n\n\t\t\tif (packetSeq32 > currentSeq32)\n\t\t\t{\n\t\t\t\t\/\/ Get a forward iterator pointing to the same element.\n\t\t\t\tauto it = bufferItReverse.base();\n\n\t\t\t\tnewBufferIt = this->buffer.insert(it, bufferItem);\n\n\t\t\t\t\/\/ Exit the loop.\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\/\/ If the packet was older than anything in the buffer, just ignore it.\n\t\t\/\/ NOTE: This should never happen.\n\t\tif (bufferItReverse == this->buffer.rend())\n\t\t{\n\t\t\tMS_WARN_TAG(\n\t\t\t rtp,\n\t\t\t \"ignoring packet older than anything in the buffer [ssrc:%\" PRIu32 \", seq:%\" PRIu16 \"]\",\n\t\t\t packet->GetSsrc(),\n\t\t\t packet->GetSequenceNumber());\n\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ If the buffer is not full use the next free storage item.\n\t\tif (this->buffer.size() - 1 < this->storage.size())\n\t\t{\n\t\t\tstore = this->storage[this->buffer.size() - 1].store;\n\t\t}\n\t\t\/\/ Otherwise remove the first packet of the buffer and replace its storage area.\n\t\telse\n\t\t{\n\t\t\tauto& firstBufferItem = *(this->buffer.begin());\n\t\t\tauto firstPacket = firstBufferItem.packet;\n\n\t\t\t\/\/ Store points to the store used by the first packet.\n\t\t\tstore = const_cast<uint8_t*>(firstPacket->GetData());\n\t\t\t\/\/ Free the first packet.\n\t\t\tdelete firstPacket;\n\t\t\t\/\/ Remove the first element in the list.\n\t\t\tthis->buffer.pop_front();\n\t\t}\n\n\t\t\/\/ Update the new buffer item so it points to the cloned packed.\n\t\t(*newBufferIt).packet = packet->Clone(store);\n\t}\n\n\tvoid RtpStreamSend::CheckHealth()\n\t{\n\t\tMS_TRACE();\n\t}\n\n\tvoid RtpStreamSend::SetRtx(uint8_t payloadType, uint32_t ssrc)\n\t{\n\t\tMS_TRACE();\n\n\t\tthis->hasRtx = true;\n\t\tthis->rtxPayloadType = payloadType;\n\t\tthis->rtxSsrc = ssrc;\n\t\tthis->rtxSeq = Utils::Crypto::GetRandomUInt(0u, 0xFFFF);\n\t}\n\n\tvoid RtpStreamSend::RtxEncode(RTC::RtpPacket* packet)\n\t{\n\t\tMS_TRACE();\n\n\t\tMS_ASSERT(this->hasRtx, \"RTX not enabled on this stream\");\n\n\t\tpacket->RtxEncode(this->rtxPayloadType, this->rtxSsrc, ++this->rtxSeq);\n\t}\n\n} \/\/ namespace RTC\n<|endoftext|>"} {"text":"<commit_before>#include \"keymanager.h\"\n\n#include <stdexcept>\n\n#include <boost\/move\/make_unique.hpp>\n#include <boost\/scoped_array.hpp>\n\nKeyManager::KeyManager(const boost::shared_ptr<INvStorage> &backend, const Config &config)\n : backend_(backend),\n config_(config)\n#ifdef BUILD_P11\n ,\n p11_(config.p11)\n#endif\n{\n}\n\nvoid KeyManager::loadKeys() {\n if (config_.tls.pkey_source == kFile) {\n std::string pkey;\n backend_->loadTlsPkey(&pkey);\n if (!pkey.empty()) {\n if (tmp_pkey_file == nullptr) {\n tmp_pkey_file = boost::movelib::make_unique<TemporaryFile>(\"tls-pkey\");\n }\n tmp_pkey_file->PutContents(pkey);\n }\n }\n if (config_.tls.cert_source == kFile) {\n std::string cert;\n backend_->loadTlsCert(&cert);\n if (!cert.empty()) {\n if (tmp_cert_file == nullptr) {\n tmp_cert_file = boost::movelib::make_unique<TemporaryFile>(\"tls-cert\");\n }\n tmp_cert_file->PutContents(cert);\n }\n }\n if (config_.tls.ca_source == kFile) {\n std::string ca;\n backend_->loadTlsCa(&ca);\n if (!ca.empty()) {\n if (tmp_ca_file == nullptr) {\n tmp_ca_file = boost::movelib::make_unique<TemporaryFile>(\"tls-ca\");\n }\n tmp_ca_file->PutContents(ca);\n }\n }\n}\n\nstd::string KeyManager::getPkeyFile() const {\n std::string pkey_file;\n#ifdef BUILD_P11\n if (config_.tls.pkey_source == kPkcs11) {\n pkey_file = p11_->getTlsPkeyId();\n }\n#endif\n if (config_.tls.pkey_source == kFile) {\n if (tmp_pkey_file && !boost::filesystem::is_empty(tmp_pkey_file->PathString())) {\n pkey_file = tmp_pkey_file->PathString();\n }\n }\n return pkey_file;\n}\n\nstd::string KeyManager::getCertFile() const {\n std::string cert_file;\n#ifdef BUILD_P11\n if (config_.tls.cert_source == kPkcs11) {\n cert_file = p11_->getTlsCertId();\n }\n#endif\n if (config_.tls.cert_source == kFile) {\n if (tmp_cert_file && !boost::filesystem::is_empty(tmp_cert_file->PathString())) {\n cert_file = tmp_cert_file->PathString();\n }\n }\n return cert_file;\n}\n\nstd::string KeyManager::getCaFile() const {\n std::string ca_file;\n#ifdef BUILD_P11\n if (config_.tls.ca_source == kPkcs11) {\n ca_file = p11_->getTlsCacertId();\n }\n#endif\n if (config_.tls.ca_source == kFile) {\n if (tmp_ca_file && !boost::filesystem::is_empty(tmp_ca_file->PathString())) {\n ca_file = tmp_ca_file->PathString();\n }\n }\n return ca_file;\n}\n\nstd::string KeyManager::getPkey() const {\n std::string pkey;\n#ifdef BUILD_P11\n if (config_.tls.pkey_source == kPkcs11) {\n pkey = p11_->getTlsPkeyId();\n }\n#endif\n if (config_.tls.pkey_source == kFile) {\n backend_->loadTlsPkey(&pkey);\n }\n return pkey;\n}\n\nstd::string KeyManager::getCert() const {\n std::string cert;\n#ifdef BUILD_P11\n if (config_.tls.cert_source == kPkcs11) {\n cert = p11_->getTlsCertId();\n }\n#endif\n if (config_.tls.cert_source == kFile) {\n backend_->loadTlsCert(&cert);\n }\n return cert;\n}\n\nstd::string KeyManager::getCa() const {\n std::string ca;\n#ifdef BUILD_P11\n if (config_.tls.ca_source == kPkcs11) {\n ca = p11_->getTlsCacertId();\n }\n#endif\n if (config_.tls.ca_source == kFile) {\n backend_->loadTlsCa(&ca);\n }\n return ca;\n}\n\nstd::string KeyManager::getCN() const {\n std::string not_found_cert_message = \"Certificate is not found, can't extract device_id\";\n std::string cert;\n if (config_.tls.cert_source == kFile) {\n if (!backend_->loadTlsCert(&cert)) {\n throw std::runtime_error(not_found_cert_message);\n }\n } else { \/\/ kPkcs11\n#ifdef BUILD_P11\n if (!p11_->readTlsCert(&cert)) {\n throw std::runtime_error(not_found_cert_message);\n }\n#else\n throw std::runtime_error(\"Aktualizr was built without PKCS#11 support, can't extract device_id\");\n#endif\n }\n\n BIO *bio = BIO_new_mem_buf(const_cast<char *>(cert.c_str()), (int)cert.size());\n X509 *x = PEM_read_bio_X509(bio, NULL, 0, NULL);\n BIO_free_all(bio);\n if (!x) throw std::runtime_error(\"Could not parse certificate\");\n\n int len = X509_NAME_get_text_by_NID(X509_get_subject_name(x), NID_commonName, NULL, 0);\n if (len < 0) {\n X509_free(x);\n throw std::runtime_error(\"Could not get CN from certificate\");\n }\n boost::scoped_array<char> buf(new char[len + 1]);\n X509_NAME_get_text_by_NID(X509_get_subject_name(x), NID_commonName, buf.get(), len + 1);\n std::string cn(buf.get());\n X509_free(x);\n return cn;\n}\n\nvoid KeyManager::copyCertsToCurl(HttpInterface *http) {\n std::string pkey = getPkey();\n std::string cert = getCert();\n std::string ca = getCa();\n\n if (pkey.size() && cert.size() && ca.size()) {\n http->setCerts(ca, config_.tls.ca_source, cert, config_.tls.cert_source, pkey, config_.tls.pkey_source);\n }\n}\n\nJson::Value KeyManager::signTuf(const Json::Value &in_data) {\n ENGINE *crypto_engine = NULL;\n std::string private_key;\n#ifdef BUILD_P11\n if (config_.uptane.key_source == kPkcs11) crypto_engine = p11_->getEngine();\n#endif\n if (config_.uptane.key_source == kFile) {\n backend_->loadPrimaryPrivate(&private_key);\n }\n std::string b64sig =\n Utils::toBase64(Crypto::RSAPSSSign(crypto_engine, private_key, Json::FastWriter().write(in_data)));\n Json::Value signature;\n signature[\"method\"] = \"rsassa-pss\";\n signature[\"sig\"] = b64sig;\n\n Json::Value out_data;\n signature[\"keyid\"] = Crypto::getKeyId(getUptanePublicKey());\n out_data[\"signed\"] = in_data;\n out_data[\"signatures\"] = Json::Value(Json::arrayValue);\n out_data[\"signatures\"].append(signature);\n return out_data;\n}\n\nstd::string KeyManager::getUptanePublicKey() {\n std::string primary_public;\n if (config_.uptane.key_source == kFile) {\n if (!backend_->loadPrimaryPublic(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane public key!\");\n }\n } else {\n#ifdef BUILD_P11\n \/\/ dummy read to check if the key is present\n if (!p11_->readUptanePublicKey(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane public key!\");\n }\n#else\n throw std::runtime_error(\"Aktualizr was built without pkcs11 support!\");\n#endif\n }\n return primary_public;\n}\n\nstd::string KeyManager::generateUptaneKeyPair() {\n std::string primary_public;\n\n if (config_.uptane.key_source == kFile) {\n std::string primary_private;\n if (!backend_->loadPrimaryKeys(&primary_public, &primary_private)) {\n if (Crypto::generateRSAKeyPair(&primary_public, &primary_private)) {\n backend_->storePrimaryKeys(primary_public, primary_private);\n }\n }\n if (primary_public.empty() && primary_private.empty()) {\n throw std::runtime_error(\"Could not get uptane keys\");\n }\n } else {\n#ifdef BUILD_P11\n \/\/ dummy read to check if the key is present\n if (!p11_->readUptanePublicKey(&primary_public)) {\n p11_->generateUptaneKeyPair();\n }\n \/\/ really read the key\n if (primary_public.empty() && !p11_->readUptanePublicKey(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane keys\");\n }\n return primary_public;\n#else\n throw std::runtime_error(\"Aktualizr was built without pkcs11 support!\");\n#endif\n }\n return primary_public;\n}\n<commit_msg>Pass p11 key id to RSAPSSSign<commit_after>#include \"keymanager.h\"\n\n#include <stdexcept>\n\n#include <boost\/move\/make_unique.hpp>\n#include <boost\/scoped_array.hpp>\n\nKeyManager::KeyManager(const boost::shared_ptr<INvStorage> &backend, const Config &config)\n : backend_(backend),\n config_(config)\n#ifdef BUILD_P11\n ,\n p11_(config.p11)\n#endif\n{\n}\n\nvoid KeyManager::loadKeys() {\n if (config_.tls.pkey_source == kFile) {\n std::string pkey;\n backend_->loadTlsPkey(&pkey);\n if (!pkey.empty()) {\n if (tmp_pkey_file == nullptr) {\n tmp_pkey_file = boost::movelib::make_unique<TemporaryFile>(\"tls-pkey\");\n }\n tmp_pkey_file->PutContents(pkey);\n }\n }\n if (config_.tls.cert_source == kFile) {\n std::string cert;\n backend_->loadTlsCert(&cert);\n if (!cert.empty()) {\n if (tmp_cert_file == nullptr) {\n tmp_cert_file = boost::movelib::make_unique<TemporaryFile>(\"tls-cert\");\n }\n tmp_cert_file->PutContents(cert);\n }\n }\n if (config_.tls.ca_source == kFile) {\n std::string ca;\n backend_->loadTlsCa(&ca);\n if (!ca.empty()) {\n if (tmp_ca_file == nullptr) {\n tmp_ca_file = boost::movelib::make_unique<TemporaryFile>(\"tls-ca\");\n }\n tmp_ca_file->PutContents(ca);\n }\n }\n}\n\nstd::string KeyManager::getPkeyFile() const {\n std::string pkey_file;\n#ifdef BUILD_P11\n if (config_.tls.pkey_source == kPkcs11) {\n pkey_file = p11_->getTlsPkeyId();\n }\n#endif\n if (config_.tls.pkey_source == kFile) {\n if (tmp_pkey_file && !boost::filesystem::is_empty(tmp_pkey_file->PathString())) {\n pkey_file = tmp_pkey_file->PathString();\n }\n }\n return pkey_file;\n}\n\nstd::string KeyManager::getCertFile() const {\n std::string cert_file;\n#ifdef BUILD_P11\n if (config_.tls.cert_source == kPkcs11) {\n cert_file = p11_->getTlsCertId();\n }\n#endif\n if (config_.tls.cert_source == kFile) {\n if (tmp_cert_file && !boost::filesystem::is_empty(tmp_cert_file->PathString())) {\n cert_file = tmp_cert_file->PathString();\n }\n }\n return cert_file;\n}\n\nstd::string KeyManager::getCaFile() const {\n std::string ca_file;\n#ifdef BUILD_P11\n if (config_.tls.ca_source == kPkcs11) {\n ca_file = p11_->getTlsCacertId();\n }\n#endif\n if (config_.tls.ca_source == kFile) {\n if (tmp_ca_file && !boost::filesystem::is_empty(tmp_ca_file->PathString())) {\n ca_file = tmp_ca_file->PathString();\n }\n }\n return ca_file;\n}\n\nstd::string KeyManager::getPkey() const {\n std::string pkey;\n#ifdef BUILD_P11\n if (config_.tls.pkey_source == kPkcs11) {\n pkey = p11_->getTlsPkeyId();\n }\n#endif\n if (config_.tls.pkey_source == kFile) {\n backend_->loadTlsPkey(&pkey);\n }\n return pkey;\n}\n\nstd::string KeyManager::getCert() const {\n std::string cert;\n#ifdef BUILD_P11\n if (config_.tls.cert_source == kPkcs11) {\n cert = p11_->getTlsCertId();\n }\n#endif\n if (config_.tls.cert_source == kFile) {\n backend_->loadTlsCert(&cert);\n }\n return cert;\n}\n\nstd::string KeyManager::getCa() const {\n std::string ca;\n#ifdef BUILD_P11\n if (config_.tls.ca_source == kPkcs11) {\n ca = p11_->getTlsCacertId();\n }\n#endif\n if (config_.tls.ca_source == kFile) {\n backend_->loadTlsCa(&ca);\n }\n return ca;\n}\n\nstd::string KeyManager::getCN() const {\n std::string not_found_cert_message = \"Certificate is not found, can't extract device_id\";\n std::string cert;\n if (config_.tls.cert_source == kFile) {\n if (!backend_->loadTlsCert(&cert)) {\n throw std::runtime_error(not_found_cert_message);\n }\n } else { \/\/ kPkcs11\n#ifdef BUILD_P11\n if (!p11_->readTlsCert(&cert)) {\n throw std::runtime_error(not_found_cert_message);\n }\n#else\n throw std::runtime_error(\"Aktualizr was built without PKCS#11 support, can't extract device_id\");\n#endif\n }\n\n BIO *bio = BIO_new_mem_buf(const_cast<char *>(cert.c_str()), (int)cert.size());\n X509 *x = PEM_read_bio_X509(bio, NULL, 0, NULL);\n BIO_free_all(bio);\n if (!x) throw std::runtime_error(\"Could not parse certificate\");\n\n int len = X509_NAME_get_text_by_NID(X509_get_subject_name(x), NID_commonName, NULL, 0);\n if (len < 0) {\n X509_free(x);\n throw std::runtime_error(\"Could not get CN from certificate\");\n }\n boost::scoped_array<char> buf(new char[len + 1]);\n X509_NAME_get_text_by_NID(X509_get_subject_name(x), NID_commonName, buf.get(), len + 1);\n std::string cn(buf.get());\n X509_free(x);\n return cn;\n}\n\nvoid KeyManager::copyCertsToCurl(HttpInterface *http) {\n std::string pkey = getPkey();\n std::string cert = getCert();\n std::string ca = getCa();\n\n if (pkey.size() && cert.size() && ca.size()) {\n http->setCerts(ca, config_.tls.ca_source, cert, config_.tls.cert_source, pkey, config_.tls.pkey_source);\n }\n}\n\nJson::Value KeyManager::signTuf(const Json::Value &in_data) {\n ENGINE *crypto_engine = NULL;\n std::string private_key;\n#ifdef BUILD_P11\n if (config_.uptane.key_source == kPkcs11) {\n crypto_engine = p11_->getEngine();\n private_key = config_.p11.uptane_key_id;\n }\n#endif\n if (config_.uptane.key_source == kFile) {\n backend_->loadPrimaryPrivate(&private_key);\n }\n std::string b64sig =\n Utils::toBase64(Crypto::RSAPSSSign(crypto_engine, private_key, Json::FastWriter().write(in_data)));\n Json::Value signature;\n signature[\"method\"] = \"rsassa-pss\";\n signature[\"sig\"] = b64sig;\n\n Json::Value out_data;\n signature[\"keyid\"] = Crypto::getKeyId(getUptanePublicKey());\n out_data[\"signed\"] = in_data;\n out_data[\"signatures\"] = Json::Value(Json::arrayValue);\n out_data[\"signatures\"].append(signature);\n return out_data;\n}\n\nstd::string KeyManager::getUptanePublicKey() {\n std::string primary_public;\n if (config_.uptane.key_source == kFile) {\n if (!backend_->loadPrimaryPublic(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane public key!\");\n }\n } else {\n#ifdef BUILD_P11\n \/\/ dummy read to check if the key is present\n if (!p11_->readUptanePublicKey(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane public key!\");\n }\n#else\n throw std::runtime_error(\"Aktualizr was built without pkcs11 support!\");\n#endif\n }\n return primary_public;\n}\n\nstd::string KeyManager::generateUptaneKeyPair() {\n std::string primary_public;\n\n if (config_.uptane.key_source == kFile) {\n std::string primary_private;\n if (!backend_->loadPrimaryKeys(&primary_public, &primary_private)) {\n if (Crypto::generateRSAKeyPair(&primary_public, &primary_private)) {\n backend_->storePrimaryKeys(primary_public, primary_private);\n }\n }\n if (primary_public.empty() && primary_private.empty()) {\n throw std::runtime_error(\"Could not get uptane keys\");\n }\n } else {\n#ifdef BUILD_P11\n \/\/ dummy read to check if the key is present\n if (!p11_->readUptanePublicKey(&primary_public)) {\n p11_->generateUptaneKeyPair();\n }\n \/\/ really read the key\n if (primary_public.empty() && !p11_->readUptanePublicKey(&primary_public)) {\n throw std::runtime_error(\"Could not get uptane keys\");\n }\n return primary_public;\n#else\n throw std::runtime_error(\"Aktualizr was built without pkcs11 support!\");\n#endif\n }\n return primary_public;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/! Brief description.\n\n\/\/! Detailed description \n\/\/! starts here.\n#include <iostream>\n#include <thread>\n#include <tclap\/CmdLine.h>\n#include <string>\n#include \"config.hpp\"\n#include \"AWS\/AWSTools.h\"\n\nint main(int argc, const char *const *argv) {\n\n\/\/ CGOpt::OptimizationJob job;\n\/\/ job.optimization = std::make_shared<UserDefinedOptimization>();\n\n\n try {\n TCLAP::CmdLine cmd(\"CSAOpt\", ' ', \"0.1\");\n\n TCLAP::ValueArg<std::string> configArg(\"c\", \"config\", \"Config file (JSON)\",\n true, \"config.json\", \"string\");\n cmd.add(configArg);\n TCLAP::SwitchArg verboseSwitch(\"v\", \"verbose\", \"Print verbose output\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n TCLAP::SwitchArg interactiveSwitch(\"i\", \"interactive\", \"Interactive mode\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n \/\/ Parse the argv array.\n cmd.parse(argc, argv);\n\n \/\/ Get the value parsed by each arg.\n std::string configPath = configArg.getValue();\n bool verboseOutput = verboseSwitch.getValue();\n bool interactiveMode = interactiveSwitch.getValue();\n\n if (interactiveMode) {\n std::cout << \"Startup in interactive mode\" << std::endl;\n } else {\n std::cout << \"Startup in non-interactive line mode\" << std::endl;\n }\n\n std::cout << \"Bye!\" << std::endl;\n\n } catch (TCLAP::ArgException &e) {\n std::cerr << \"error: \" << e.error() << \" for arg \" << e.argId()\n << std::endl;\n return (1);\n }\n return (0);\n}\n<commit_msg>Added my own freaking shell handler, unfinished as of yet<commit_after>\/\/! Brief description.\n\n\/\/! Detailed description \n\/\/! starts here.\n#include <iostream>\n#include <thread>\n#include <tclap\/CmdLine.h>\n#include <string>\n#include \"Config.h\"\n#include \"AWS\/AWSTools.h\"\n#include \"CSAOptManager.h\"\n#include \"helpers.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <signal.h>\n#include <termios.h>\n#include <unistd.h>\n\nvolatile sig_atomic_t interrupted = 0;\nstatic struct termios oldt, newt;\nstatic int oldf;\n\nvoid handleSigInt(int sig) { \/\/ can be called asynchronously\n interrupted = 1; \/\/ set flag\n std::cout << \"Caught \" << strsignal(sig) << \", Exiting.\" << std::endl;\n\n exit(0);\n}\n\nstatic bool debug = false;\n\nvoid makeRaw() {\n\/\/ systemetem (\"\/bin\/stty raw\");\n \/*tcgetattr gets the parameters of the current terminal\n STDIN_FILENO will tell tcgetattr that it should write the settings\n of stdin to oldt*\/\n tcgetattr(STDIN_FILENO, &oldt);\n \/*now the settings will be copied*\/\n newt = oldt;\n\n \/*ICANON normally takes care that one line at a time will be processed\n that means it will return if it sees a \"\\n\" or an EOF or an EOL*\/\n newt.c_lflag &= ~(ICANON | ECHO);\n\n \/*Those new settings will be set to STDIN\n TCSANOW tells tcsetattr to change attributes immediately. *\/\n tcsetattr(STDIN_FILENO, TCSANOW, &newt);\n\n\/\/ tcgetattr(STDIN_FILENO, &oldt);\n\/\/ newt = oldt;\n\/\/ newt.c_lflag &= ~(ICANON | ECHO);\n\/\/ tcsetattr(STDIN_FILENO, TCSANOW, &newt);\n oldf = fcntl(STDIN_FILENO, F_GETFL, 0);\n fcntl(STDIN_FILENO, F_SETFL, oldf | O_NONBLOCK);\n}\n\nvoid unmakeRaw() {\n\/\/ tcsetattr(STDIN_FILENO, TCSANOW, &oldt);\n fcntl(STDIN_FILENO, F_SETFL, oldf);\n tcsetattr(STDIN_FILENO, TCSANOW, &oldt);\n\/\/ fflush(stdout);\n\/\/ system(\"stty sane; tput rs1;\");\n}\n\nvoid atExitHandler() {\n\/\/ tcsetattr( STDOUT_FILENO, TCSANOW, &oldtout);\n unmakeRaw();\n}\n\nvoid replaceLine(std::string newline) {\n std::cout << \"\\33[2K\\r\" << newline;\n}\n\nvoid enterInteractiveLoop(CSAOpt::CSAOptManager &manager) {\n auto logger = spdlog::get(CSAOpt::Config::loggerName());\n std::string promptmessage = \">> \";\n std::cout << promptmessage;\n size_t historyPos = 0;\n std::vector<std::string> history;\n\n size_t curStringPos = 0;\n std::string inputString{\"\"};\n\n const int ctrlC = 3;\n const int ctrlD = 4;\n const int up = 0x26;\n const int down = 0x28;\n const int left = 0x25;\n const int right = 0x27;\n const int back = 127;\n const int enter = 10;\n\n\/\/ std::cout << \"\\033[?25h\";\n\n\n makeRaw();\n while (interrupted == 0) {\n\/\/ std::cout << \"\\033[10;20H\";\n int c = std::getchar();\n\n if (c == -1) {\n continue;\n }\n\n\/\/ std::cout << \"Got character \" << c << std::endl;\n if (c == enter) {\n if (inputString.size() < 1) {\n std::cout << std::endl;\n replaceLine(promptmessage);\n continue;\n }\n std::cout << \"Handling return\" << std::endl;\n std::vector<std::string> args;\n\n std::string token;\n std::istringstream ss(inputString);\n\n std::cout << \"Tokenizing\" << std::endl;\n while (std::getline(ss, token, ' ')) {\n args.push_back(trim(token));\n }\n\n std::cout << \"Tokeinzed to \" << args.size() << \" tokens.\" << std::endl;\n try {\n inputString.clear();\n curStringPos = 0;\n\n std::cout << std::endl;\n manager.handleInteractiveCommand(trim(args[0]), args);\n } catch (const std::exception &e) {\n std::cerr << \"An error occured: \" << e.what() << \". Exiting.\" << std::endl;\n break;\n }\n replaceLine(\"\\r\\n\" + promptmessage);\n history.push_back(inputString);\n historyPos = history.size() - 1;\n } else if (c == '\\033') { \/\/ if the first value is esc\n std::cout << \"Got \\\\033\" << std::endl;\n getchar();\n c = getchar();\n switch (c) { \/\/ the real value\n case 'A':\n std::cout << \"Got UP\" << std::endl;\n \/\/ code for arrow up\n if (historyPos - 1 > -1) {\n inputString = history.at(historyPos);\n curStringPos = inputString.size() - 1;\n replaceLine(promptmessage + inputString);\n --historyPos;\n }\n break;\n case 'B':\n std::cout << \"Got DOWN\" << std::endl;\n if (historyPos - 1 < history.size()) {\n inputString = history.at(historyPos);\n curStringPos = inputString.size() - 1;\n replaceLine(promptmessage + inputString);\n ++historyPos;\n }\n \/\/ code for arrow down\n break;\n case 'D':\n \/\/std::cout << \"Got LEFT\" << std::endl;\n if (curStringPos > 0) {\n std::cout << \"Moving LEFT\" << std::endl;\n std::cout << \"\\033[1D\";\n --curStringPos;\n }\n\n \/\/ code for arrow right\n break;\n case 'C':\n \/\/std::cout << \"Got RIGHT\" << std::endl;\n if (curStringPos < (inputString.size() - 1)) {\n std::cout << \"Moving RIGHT\" << std::endl;\n std::cout << \"\\033[1C\";\n ++curStringPos;\n }\n \/\/ code for arrow left\n break;\n }\n } else if (c == back) {\n\/\/ std::cout << \"Got BCKSPC\" << std::endl;\n if (curStringPos > 0) {\n\/\/ std::cout << \"deleting char \" << curStringPos << std::endl;\n inputString.erase(curStringPos - 1, 1);\n\/\/ std::cout << \"input is now \" << inputString << std::endl;\n --curStringPos;\n replaceLine(promptmessage + inputString);\n }\n } else if (c == ctrlC) {\n std::cout << \"SIGINT\" << std::endl;\n raise(SIGINT);\n } else if (c == ctrlD) {\n std::cout << \"EOF\" << std::endl;\n break;\n } else {\n inputString.insert(curStringPos, std::string{static_cast<wchar_t>(c)});\n ++curStringPos;\n replaceLine(promptmessage + inputString);\n }\n }\n unmakeRaw();\n}\n\n\nint main(int argc, const char *const *argv) {\n using namespace CSAOpt;\n signal(SIGINT, handleSigInt);\n const int registeringFailed = std::atexit(atExitHandler);\n\n if (registeringFailed) {\n std::cerr << \"Failed to register at_exit handler. Exiting\";\n exit(1);\n }\n\n try {\n TCLAP::CmdLine cmd(\"CSAOpt\", ' ', \"0.0.1\");\n\n TCLAP::ValueArg<std::string> configArg(\"c\", \"config\", \"Config file (JSON)\",\n true, \"config.json\", \"string\");\n cmd.add(configArg);\n TCLAP::SwitchArg verboseSwitch(\"v\", \"verbose\", \"Print verbose output\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n TCLAP::SwitchArg qietSwitch(\"q\", \"qiet\", \"No console output\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n TCLAP::SwitchArg interactiveSwitch(\"i\", \"interactive\", \"Interactive mode\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n TCLAP::SwitchArg debugSwitch(\"d\", \"debug\", \"Extra debug statements\",\n cmd, false); \/\/no need to add to cmd, as it is done internally.\n\n \/\/ Parse the argv array.\n cmd.parse(argc, argv);\n\n \/\/ Get the value parsed by each arg.\n std::string configPath = configArg.getValue();\n bool verboseOutput = verboseSwitch.getValue();\n bool interactiveMode = interactiveSwitch.getValue();\n debug = debugSwitch.getValue();\n\n Config::parse(configArg.getValue());\n\n std::string loggerName{Config::loggerName()};\n std::vector<spdlog::sink_ptr> sinks;\n if (!qietSwitch.getValue()) {\n auto console = std::make_shared<spdlog::sinks::stdout_sink_mt>();\n sinks.push_back(std::make_shared<spdlog::sinks::ansicolor_sink>(console));\n }\n if (Config::fileLogging()) {\n sinks.push_back(\n std::make_shared<spdlog::sinks::rotating_file_sink_mt>(\"csaopt\", \"log\", 1024 * 1024 * 5, 10));\n }\n auto logger = std::make_shared<spdlog::logger>(loggerName, begin(sinks), end(sinks));\n spdlog::register_logger(logger);\n\n if (CSAOpt::Config::verboseLogging() || verboseSwitch.getValue()) {\n logger->set_level(spdlog::level::trace);\n }\n\n CSAOptManager &manager = CSAOptManager::getInstance();\n\n if (interactiveMode) {\n enterInteractiveLoop(manager);\n } else {\n std::cout << \"Startup in non-interactive line mode\" << std::endl;\n }\n\n std::cout << \"Bye!\" << std::endl;\n\n } catch (TCLAP::ArgException &e) {\n std::cerr << \"error: \" << e.error() << \" for arg \" << e.argId()\n << std::endl;\n return (1);\n }\n return (0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) .NET Foundation and contributors. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include \"pal.h\"\n#include \"trace.h\"\n#include \"utils.h\"\n\n#include <cassert>\n#include <locale>\n#include <codecvt>\n#include <ShlObj.h>\n\npal::string_t pal::to_lower(const pal::string_t& in)\n{\n pal::string_t ret = in;\n std::transform(ret.begin(), ret.end(), ret.begin(), ::towlower);\n return ret;\n}\n\npal::string_t pal::to_string(int value)\n{\n return std::to_wstring(value);\n}\n\nbool pal::touch_file(const pal::string_t& path)\n{\n HANDLE hnd = ::CreateFileW(path.c_str(), 0, 0, NULL, CREATE_NEW, FILE_ATTRIBUTE_NORMAL, NULL);\n if (hnd == INVALID_HANDLE_VALUE)\n {\n trace::verbose(_X(\"Failed to leave breadcrumb, HRESULT: 0x%X\"), HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n ::CloseHandle(hnd);\n return true;\n}\n\nvoid pal::setup_api_sets(const std::unordered_set<pal::string_t>& api_sets)\n{\n if (api_sets.empty())\n {\n return;\n }\n\n pal::string_t path;\n\n (void) getenv(_X(\"PATH\"), &path);\n\n \/\/ We need this ugly hack, as the PInvoked DLL's static dependencies can come from\n \/\/ some other NATIVE_DLL_SEARCH_DIRECTORIES and not necessarily side by side. However,\n \/\/ CoreCLR.dll loads PInvoke DLLs with LOAD_WITH_ALTERED_SEARCH_PATH. Note that this\n \/\/ option cannot be combined with LOAD_LIBRARY_SEARCH_USER_DIRS, so the AddDllDirectory\n \/\/ doesn't help much in telling CoreCLR where to load the PInvoke DLLs from.\n \/\/ So we resort to modifying the PATH variable on our own hoping Windows loader will do the right thing.\n for (const auto& as : api_sets)\n {\n \/\/ AddDllDirectory is still needed for Standalone App's CoreCLR load.\n ::AddDllDirectory(as.c_str());\n\n \/\/ Path patch is needed for static dependencies of a PInvoked DLL load out of the nuget cache.\n path.push_back(PATH_SEPARATOR);\n path.append(as);\n }\n\n trace::verbose(_X(\"Setting PATH=%s\"), path.c_str());\n\n ::SetEnvironmentVariableW(_X(\"PATH\"), path.c_str());\n}\n\nbool pal::getcwd(pal::string_t* recv)\n{\n recv->clear();\n\n pal::char_t buf[MAX_PATH];\n DWORD result = GetCurrentDirectoryW(MAX_PATH, buf);\n if (result < MAX_PATH)\n {\n recv->assign(buf);\n return true;\n }\n else if (result != 0)\n {\n std::vector<pal::char_t> str;\n str.resize(result);\n result = GetCurrentDirectoryW(str.size(), str.data());\n assert(result <= str.size());\n if (result != 0)\n {\n recv->assign(str.data());\n return true;\n }\n }\n assert(result == 0);\n trace::error(_X(\"Failed to obtain working directory, HRESULT: 0x%X\"), HRESULT_FROM_WIN32(GetLastError()));\n return false;\n}\n\nbool pal::load_library(const char_t* path, dll_t* dll)\n{\n \/\/ LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR:\n \/\/ In portable apps, coreclr would come from another directory than the host,\n \/\/ so make sure coreclr dependencies can be resolved from coreclr.dll load dir.\n *dll = ::LoadLibraryExW(path, NULL, LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR | LOAD_LIBRARY_SEARCH_DEFAULT_DIRS);\n if (*dll == nullptr)\n {\n trace::error(_X(\"Failed to load the dll from [%s], HRESULT: 0x%X\"), path, HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n\n \/\/ Pin the module\n HMODULE dummy_module;\n if (!::GetModuleHandleExW(GET_MODULE_HANDLE_EX_FLAG_PIN, path, &dummy_module))\n {\n trace::error(_X(\"Failed to pin library [%s] in [%s]\"), path, _STRINGIFY(__FUNCTION__));\n return false;\n }\n\n if (trace::is_enabled())\n {\n pal::char_t buf[PATH_MAX];\n ::GetModuleFileNameW(*dll, buf, PATH_MAX);\n trace::info(_X(\"Loaded library from %s\"), buf);\n }\n\n return true;\n}\n\npal::proc_t pal::get_symbol(dll_t library, const char* name)\n{\n return ::GetProcAddress(library, name);\n}\n\nvoid pal::unload_library(dll_t library)\n{\n \/\/ No-op. On windows, we pin the library, so it can't be unloaded.\n}\n\nbool pal::get_default_breadcrumb_store(string_t* recv)\n{\n recv->clear();\n\n pal::char_t* prog_dat;\n HRESULT hr = ::SHGetKnownFolderPath(FOLDERID_ProgramData, 0, NULL, &prog_dat);\n if (hr != S_OK)\n {\n trace::verbose(_X(\"Failed to read default breadcrumb store 0x%X\"), hr);\n return false;\n }\n recv->assign(prog_dat);\n append_path(recv, _X(\"Microsoft\"));\n append_path(recv, _X(\"NetFramework\"));\n append_path(recv, _X(\"BreadcrumbStore\"));\n return true;\n}\n\nstatic\nbool get_program_files_by_id(KNOWNFOLDERID kfid, pal::string_t* recv)\n{\n recv->clear();\n pal::char_t* prog_files;\n HRESULT hr = ::SHGetKnownFolderPath(kfid, 0, NULL, &prog_files);\n if (hr != S_OK)\n {\n trace::verbose(_X(\"Failed to obtain Program Files directory, HRESULT: 0x%X\"), hr);\n return false;\n }\n recv->assign(prog_files);\n return true;\n}\n\nstatic\nbool get_wow_mode_program_files(pal::string_t* recv)\n{\n#if defined(_TARGET_AMD64_)\n KNOWNFOLDERID kfid = FOLDERID_ProgramFilesX86;\n#else\n KNOWNFOLDERID kfid = FOLDERID_ProgramFiles;\n#endif\n return get_program_files_by_id(kfid, recv);\n}\n\nbool pal::get_default_servicing_directory(string_t* recv)\n{\n if (!get_wow_mode_program_files(recv))\n {\n return false;\n }\n append_path(recv, _X(\"coreservicing\"));\n return true;\n}\n\nbool pal::get_global_dotnet_dir(pal::string_t* dir)\n{\n if (!get_program_files_by_id(FOLDERID_ProgramFiles, dir))\n {\n return false;\n }\n\n append_path(dir, _X(\"dotnet\"));\n return true;\n}\n\nbool pal::get_local_dotnet_dir(pal::string_t* dir)\n{\n pal::char_t* profile;\n HRESULT hr = ::SHGetKnownFolderPath(FOLDERID_Profile, 0, NULL, &profile);\n if (hr != S_OK)\n {\n trace::verbose(_X(\"Failed to obtain user profile directory, HRESULT: 0x%X\"), hr);\n return false;\n }\n\n dir->assign(profile);\n append_path(dir, _X(\".dotnet\"));\n append_path(dir, get_arch());\n return true;\n}\n\n\/\/ To determine the OS version, we are going to use RtlGetVersion API\n\/\/ since GetVersion call can be shimmed on Win8.1+.\ntypedef NTSTATUS (WINAPI *pFuncRtlGetVersion)(RTL_OSVERSIONINFOW *);\n\npal::string_t pal::get_current_os_rid_platform()\n{\n pal::string_t ridOS;\n \n RTL_OSVERSIONINFOW osinfo;\n\n \/\/ Init the buffer\n ZeroMemory(&osinfo, sizeof(osinfo));\n osinfo.dwOSVersionInfoSize = sizeof(osinfo);\n HMODULE hmodNtdll = LoadLibrary(\"ntdll.dll\");\n if (hmodNtdll != NULL)\n {\n pFuncRtlGetVersion pRtlGetVersion = (pFuncRtlGetVersion)GetProcAddress(hmodNtdll, \"RtlGetVersion\");\n if (pRtlGetVersion)\n {\n if ((*pRtlGetVersion)(&osinfo) == 0)\n {\n \/\/ Win7 RID is the minimum supported version.\n int majorVer = 6;\n int minorVer = 1;\n\n if (osinfo.dwMajorVersion > majorVer)\n {\n majorVer = osinfo.dwMajorVersion;\n \n \/\/ Reset the minor version since we picked a different major version.\n minorVer = 0;\n }\n\n if (osinfo.dwMinorVersion > minorVer)\n {\n minorVer = osinfo.dwMinorVersion;\n }\n\n if (majorVer == 6)\n {\n switch(minorVer)\n {\n case 1:\n ridOS.append(_X(\"win7\"));\n break;\n case 2:\n ridOS.append(_X(\"win8\"));\n break;\n case 3:\n default: \n \/\/ For unknown version, we will support the highest RID that we know for this major version.\n ridOS.append(_X(\"win81\"));\n break;\n }\n }\n else if (majorVer >= 10)\n {\n \/\/ Return the major version for use in RID computation without applying any cap.\n ridOS.append(_X(\"win\"));\n ridOS.append(pal::to_string(majorVer));\n }\n }\n }\n }\n \n return ridOS;\n}\n\nbool pal::is_path_rooted(const string_t& path)\n{\n return path.length() >= 2 && path[1] == L':';\n}\n\n\/\/ Returns true only if an env variable can be read successfully to be non-empty.\nbool pal::getenv(const char_t* name, string_t* recv)\n{\n recv->clear();\n\n auto length = ::GetEnvironmentVariableW(name, nullptr, 0);\n if (length == 0)\n {\n auto err = GetLastError();\n if (err != ERROR_ENVVAR_NOT_FOUND)\n {\n trace::error(_X(\"Failed to read environment variable [%s], HRESULT: 0x%X\"), name, HRESULT_FROM_WIN32(GetLastError()));\n }\n return false;\n }\n auto buf = new char_t[length];\n if (::GetEnvironmentVariableW(name, buf, length) == 0)\n {\n trace::error(_X(\"Failed to read environment variable [%s], HRESULT: 0x%X\"), name, HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n\n recv->assign(buf);\n delete[] buf;\n\n return true;\n}\n\nint pal::xtoi(const char_t* input)\n{\n return ::_wtoi(input);\n}\n\nbool pal::get_own_executable_path(string_t* recv)\n{\n char_t program_path[MAX_PATH];\n DWORD dwModuleFileName = ::GetModuleFileNameW(NULL, program_path, MAX_PATH);\n if (dwModuleFileName == 0 || dwModuleFileName >= MAX_PATH) {\n return false;\n }\n recv->assign(program_path);\n return true;\n}\n\nstatic bool wchar_convert_helper(DWORD code_page, const char* cstr, int len, pal::string_t* out)\n{\n out->clear();\n\n \/\/ No need of explicit null termination, so pass in the actual length.\n size_t size = ::MultiByteToWideChar(code_page, 0, cstr, len, nullptr, 0);\n if (size == 0)\n {\n return false;\n }\n out->resize(size, '\\0');\n return ::MultiByteToWideChar(code_page, 0, cstr, len, &(*out)[0], out->size()) != 0;\n}\n\nbool pal::utf8_palstring(const std::string& str, pal::string_t* out)\n{\n return wchar_convert_helper(CP_UTF8, &str[0], str.size(), out);\n}\n\nbool pal::pal_utf8string(const pal::string_t& str, std::vector<char>* out)\n{\n out->clear();\n\n \/\/ Pass -1 as we want explicit null termination in the char buffer.\n size_t size = ::WideCharToMultiByte(CP_UTF8, 0, str.c_str(), -1, nullptr, 0, nullptr, nullptr);\n if (size == 0)\n {\n return false;\n }\n out->resize(size, '\\0');\n return ::WideCharToMultiByte(CP_UTF8, 0, str.c_str(), -1, out->data(), out->size(), nullptr, nullptr) != 0;\n}\n\nbool pal::pal_clrstring(const pal::string_t& str, std::vector<char>* out)\n{\n return pal_utf8string(str, out);\n}\n\nbool pal::clr_palstring(const char* cstr, pal::string_t* out)\n{\n return wchar_convert_helper(CP_UTF8, cstr, ::strlen(cstr), out);\n}\n\nbool pal::realpath(string_t* path)\n{\n char_t buf[MAX_PATH];\n auto res = ::GetFullPathNameW(path->c_str(), MAX_PATH, buf, nullptr);\n if (res == 0 || res > MAX_PATH)\n {\n trace::error(_X(\"Error resolving full path [%s]\"), path->c_str());\n return false;\n }\n path->assign(buf);\n return true;\n}\n\nbool pal::file_exists(const string_t& path)\n{\n if (path.empty())\n {\n return false;\n }\n\n\n \/\/ We will attempt to fetch attributes for the file or folder in question that are\n \/\/ returned only if they exist.\n WIN32_FILE_ATTRIBUTE_DATA data;\n if (GetFileAttributesExW(path.c_str(), GetFileExInfoStandard, &data) != 0) {\n return true;\n }\n \n return false;\n}\n\nvoid pal::readdir(const string_t& path, const string_t& pattern, std::vector<pal::string_t>* list)\n{\n assert(list != nullptr);\n\n std::vector<string_t>& files = *list;\n\n string_t search_string(path);\n append_path(&search_string, pattern.c_str());\n\n WIN32_FIND_DATAW data = { 0 };\n auto handle = ::FindFirstFileExW(search_string.c_str(), FindExInfoStandard, &data, FindExSearchNameMatch, NULL, 0);\n if (handle == INVALID_HANDLE_VALUE)\n {\n return;\n }\n do\n {\n string_t filepath(data.cFileName);\n files.push_back(filepath);\n } while (::FindNextFileW(handle, &data));\n ::FindClose(handle);\n}\n\nvoid pal::readdir(const string_t& path, std::vector<pal::string_t>* list)\n{\n pal::readdir(path, _X(\"*\"), list);\n}\n\n<commit_msg>remove SHGetKnownFolderPath<commit_after>\/\/ Copyright (c) .NET Foundation and contributors. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include \"pal.h\"\n#include \"trace.h\"\n#include \"utils.h\"\n\n#include <cassert>\n#include <locale>\n#include <codecvt>\n#include <ShlObj.h>\n\npal::string_t pal::to_lower(const pal::string_t& in)\n{\n pal::string_t ret = in;\n std::transform(ret.begin(), ret.end(), ret.begin(), ::towlower);\n return ret;\n}\n\npal::string_t pal::to_string(int value)\n{\n return std::to_wstring(value);\n}\n\nbool pal::touch_file(const pal::string_t& path)\n{\n HANDLE hnd = ::CreateFileW(path.c_str(), 0, 0, NULL, CREATE_NEW, FILE_ATTRIBUTE_NORMAL, NULL);\n if (hnd == INVALID_HANDLE_VALUE)\n {\n trace::verbose(_X(\"Failed to leave breadcrumb, HRESULT: 0x%X\"), HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n ::CloseHandle(hnd);\n return true;\n}\n\nvoid pal::setup_api_sets(const std::unordered_set<pal::string_t>& api_sets)\n{\n if (api_sets.empty())\n {\n return;\n }\n\n pal::string_t path;\n\n (void) getenv(_X(\"PATH\"), &path);\n\n \/\/ We need this ugly hack, as the PInvoked DLL's static dependencies can come from\n \/\/ some other NATIVE_DLL_SEARCH_DIRECTORIES and not necessarily side by side. However,\n \/\/ CoreCLR.dll loads PInvoke DLLs with LOAD_WITH_ALTERED_SEARCH_PATH. Note that this\n \/\/ option cannot be combined with LOAD_LIBRARY_SEARCH_USER_DIRS, so the AddDllDirectory\n \/\/ doesn't help much in telling CoreCLR where to load the PInvoke DLLs from.\n \/\/ So we resort to modifying the PATH variable on our own hoping Windows loader will do the right thing.\n for (const auto& as : api_sets)\n {\n \/\/ AddDllDirectory is still needed for Standalone App's CoreCLR load.\n ::AddDllDirectory(as.c_str());\n\n \/\/ Path patch is needed for static dependencies of a PInvoked DLL load out of the nuget cache.\n path.push_back(PATH_SEPARATOR);\n path.append(as);\n }\n\n trace::verbose(_X(\"Setting PATH=%s\"), path.c_str());\n\n ::SetEnvironmentVariableW(_X(\"PATH\"), path.c_str());\n}\n\nbool pal::getcwd(pal::string_t* recv)\n{\n recv->clear();\n\n pal::char_t buf[MAX_PATH];\n DWORD result = GetCurrentDirectoryW(MAX_PATH, buf);\n if (result < MAX_PATH)\n {\n recv->assign(buf);\n return true;\n }\n else if (result != 0)\n {\n std::vector<pal::char_t> str;\n str.resize(result);\n result = GetCurrentDirectoryW(str.size(), str.data());\n assert(result <= str.size());\n if (result != 0)\n {\n recv->assign(str.data());\n return true;\n }\n }\n assert(result == 0);\n trace::error(_X(\"Failed to obtain working directory, HRESULT: 0x%X\"), HRESULT_FROM_WIN32(GetLastError()));\n return false;\n}\n\nbool pal::load_library(const char_t* path, dll_t* dll)\n{\n \/\/ LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR:\n \/\/ In portable apps, coreclr would come from another directory than the host,\n \/\/ so make sure coreclr dependencies can be resolved from coreclr.dll load dir.\n *dll = ::LoadLibraryExW(path, NULL, LOAD_LIBRARY_SEARCH_DLL_LOAD_DIR | LOAD_LIBRARY_SEARCH_DEFAULT_DIRS);\n if (*dll == nullptr)\n {\n trace::error(_X(\"Failed to load the dll from [%s], HRESULT: 0x%X\"), path, HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n\n \/\/ Pin the module\n HMODULE dummy_module;\n if (!::GetModuleHandleExW(GET_MODULE_HANDLE_EX_FLAG_PIN, path, &dummy_module))\n {\n trace::error(_X(\"Failed to pin library [%s] in [%s]\"), path, _STRINGIFY(__FUNCTION__));\n return false;\n }\n\n if (trace::is_enabled())\n {\n pal::char_t buf[PATH_MAX];\n ::GetModuleFileNameW(*dll, buf, PATH_MAX);\n trace::info(_X(\"Loaded library from %s\"), buf);\n }\n\n return true;\n}\n\npal::proc_t pal::get_symbol(dll_t library, const char* name)\n{\n return ::GetProcAddress(library, name);\n}\n\nvoid pal::unload_library(dll_t library)\n{\n \/\/ No-op. On windows, we pin the library, so it can't be unloaded.\n}\n\nstatic\nbool get_file_path_from_env(const pal::char_t* env_key, pal::string_t* recv)\n{\n recv->clear();\n pal::string_t file_path;\n if (!(pal::getenv(env_key, &file_path) && pal::realpath(&file_path)))\n {\n \/\/ We should have the path in file_path.\n trace::verbose(_X(\"Failed to obtain [%s] directory,[%s]\"),env_key, file_path.c_str());\n return false;\n }\n\n recv->assign(file_path);\n return true;\n}\n\nstatic\nbool get_wow_mode_program_files(pal::string_t* recv)\n{\n#if defined(_TARGET_AMD64_)\n pal::char_t* env_key = _X(\"ProgramFiles(x86)\");\n#else\n pal::char_t* env_key = _X(\"ProgramFiles\");\n#endif\n\n return get_file_path_from_env(env_key,recv);\n}\n\nbool pal::get_default_breadcrumb_store(string_t* recv)\n{\n recv->clear();\n\n pal::string_t prog_dat;\n if (!get_file_path_from_env(_X(\"ProgramData\"), &prog_dat))\n {\n \/\/ We should have the path in prog_dat.\n trace::verbose(_X(\"Failed to read default breadcrumb store [%s]\"), prog_dat.c_str());\n return false;\n }\n recv->assign(prog_dat);\n append_path(recv, _X(\"Microsoft\"));\n append_path(recv, _X(\"NetFramework\"));\n append_path(recv, _X(\"BreadcrumbStore\"));\n return true;\n}\n\nbool pal::get_default_servicing_directory(string_t* recv)\n{\n if (!get_wow_mode_program_files(recv))\n {\n return false;\n }\n append_path(recv, _X(\"coreservicing\"));\n return true;\n}\n\nbool pal::get_global_dotnet_dir(pal::string_t* dir)\n{\n if (!get_file_path_from_env(_X(\"ProgramFiles\"), dir))\n {\n return false;\n }\n\n append_path(dir, _X(\"dotnet\"));\n return true;\n}\n\nbool pal::get_local_dotnet_dir(pal::string_t* dir)\n{\n pal::string_t profile;\n if (!get_file_path_from_env(_X(\"USERPROFILE\"), &profile))\n {\n \/\/ We should have the path in profile.\n trace::verbose(_X(\"Failed to obtain user profile directory,[%s]\"), profile.c_str());\n return false;\n }\n\n dir->assign(profile);\n append_path(dir, _X(\".dotnet\"));\n append_path(dir, get_arch());\n return true;\n}\n\n\/\/ To determine the OS version, we are going to use RtlGetVersion API\n\/\/ since GetVersion call can be shimmed on Win8.1+.\ntypedef NTSTATUS (WINAPI *pFuncRtlGetVersion)(RTL_OSVERSIONINFOW *);\n\npal::string_t pal::get_current_os_rid_platform()\n{\n pal::string_t ridOS;\n \n RTL_OSVERSIONINFOW osinfo;\n\n \/\/ Init the buffer\n ZeroMemory(&osinfo, sizeof(osinfo));\n osinfo.dwOSVersionInfoSize = sizeof(osinfo);\n HMODULE hmodNtdll = LoadLibrary(\"ntdll.dll\");\n if (hmodNtdll != NULL)\n {\n pFuncRtlGetVersion pRtlGetVersion = (pFuncRtlGetVersion)GetProcAddress(hmodNtdll, \"RtlGetVersion\");\n if (pRtlGetVersion)\n {\n if ((*pRtlGetVersion)(&osinfo) == 0)\n {\n \/\/ Win7 RID is the minimum supported version.\n int majorVer = 6;\n int minorVer = 1;\n\n if (osinfo.dwMajorVersion > majorVer)\n {\n majorVer = osinfo.dwMajorVersion;\n \n \/\/ Reset the minor version since we picked a different major version.\n minorVer = 0;\n }\n\n if (osinfo.dwMinorVersion > minorVer)\n {\n minorVer = osinfo.dwMinorVersion;\n }\n\n if (majorVer == 6)\n {\n switch(minorVer)\n {\n case 1:\n ridOS.append(_X(\"win7\"));\n break;\n case 2:\n ridOS.append(_X(\"win8\"));\n break;\n case 3:\n default: \n \/\/ For unknown version, we will support the highest RID that we know for this major version.\n ridOS.append(_X(\"win81\"));\n break;\n }\n }\n else if (majorVer >= 10)\n {\n \/\/ Return the major version for use in RID computation without applying any cap.\n ridOS.append(_X(\"win\"));\n ridOS.append(pal::to_string(majorVer));\n }\n }\n }\n }\n \n return ridOS;\n}\n\nbool pal::is_path_rooted(const string_t& path)\n{\n return path.length() >= 2 && path[1] == L':';\n}\n\n\/\/ Returns true only if an env variable can be read successfully to be non-empty.\nbool pal::getenv(const char_t* name, string_t* recv)\n{\n recv->clear();\n\n auto length = ::GetEnvironmentVariableW(name, nullptr, 0);\n if (length == 0)\n {\n auto err = GetLastError();\n if (err != ERROR_ENVVAR_NOT_FOUND)\n {\n trace::error(_X(\"Failed to read environment variable [%s], HRESULT: 0x%X\"), name, HRESULT_FROM_WIN32(GetLastError()));\n }\n return false;\n }\n auto buf = new char_t[length];\n if (::GetEnvironmentVariableW(name, buf, length) == 0)\n {\n trace::error(_X(\"Failed to read environment variable [%s], HRESULT: 0x%X\"), name, HRESULT_FROM_WIN32(GetLastError()));\n return false;\n }\n\n recv->assign(buf);\n delete[] buf;\n\n return true;\n}\n\nint pal::xtoi(const char_t* input)\n{\n return ::_wtoi(input);\n}\n\nbool pal::get_own_executable_path(string_t* recv)\n{\n char_t program_path[MAX_PATH];\n DWORD dwModuleFileName = ::GetModuleFileNameW(NULL, program_path, MAX_PATH);\n if (dwModuleFileName == 0 || dwModuleFileName >= MAX_PATH) {\n return false;\n }\n recv->assign(program_path);\n return true;\n}\n\nstatic bool wchar_convert_helper(DWORD code_page, const char* cstr, int len, pal::string_t* out)\n{\n out->clear();\n\n \/\/ No need of explicit null termination, so pass in the actual length.\n size_t size = ::MultiByteToWideChar(code_page, 0, cstr, len, nullptr, 0);\n if (size == 0)\n {\n return false;\n }\n out->resize(size, '\\0');\n return ::MultiByteToWideChar(code_page, 0, cstr, len, &(*out)[0], out->size()) != 0;\n}\n\nbool pal::utf8_palstring(const std::string& str, pal::string_t* out)\n{\n return wchar_convert_helper(CP_UTF8, &str[0], str.size(), out);\n}\n\nbool pal::pal_utf8string(const pal::string_t& str, std::vector<char>* out)\n{\n out->clear();\n\n \/\/ Pass -1 as we want explicit null termination in the char buffer.\n size_t size = ::WideCharToMultiByte(CP_UTF8, 0, str.c_str(), -1, nullptr, 0, nullptr, nullptr);\n if (size == 0)\n {\n return false;\n }\n out->resize(size, '\\0');\n return ::WideCharToMultiByte(CP_UTF8, 0, str.c_str(), -1, out->data(), out->size(), nullptr, nullptr) != 0;\n}\n\nbool pal::pal_clrstring(const pal::string_t& str, std::vector<char>* out)\n{\n return pal_utf8string(str, out);\n}\n\nbool pal::clr_palstring(const char* cstr, pal::string_t* out)\n{\n return wchar_convert_helper(CP_UTF8, cstr, ::strlen(cstr), out);\n}\n\nbool pal::realpath(string_t* path)\n{\n char_t buf[MAX_PATH];\n auto res = ::GetFullPathNameW(path->c_str(), MAX_PATH, buf, nullptr);\n if (res == 0 || res > MAX_PATH)\n {\n trace::error(_X(\"Error resolving full path [%s]\"), path->c_str());\n return false;\n }\n path->assign(buf);\n return true;\n}\n\nbool pal::file_exists(const string_t& path)\n{\n if (path.empty())\n {\n return false;\n }\n\n\n \/\/ We will attempt to fetch attributes for the file or folder in question that are\n \/\/ returned only if they exist.\n WIN32_FILE_ATTRIBUTE_DATA data;\n if (GetFileAttributesExW(path.c_str(), GetFileExInfoStandard, &data) != 0) {\n return true;\n }\n \n return false;\n}\n\nvoid pal::readdir(const string_t& path, const string_t& pattern, std::vector<pal::string_t>* list)\n{\n assert(list != nullptr);\n\n std::vector<string_t>& files = *list;\n\n string_t search_string(path);\n append_path(&search_string, pattern.c_str());\n\n WIN32_FIND_DATAW data = { 0 };\n auto handle = ::FindFirstFileExW(search_string.c_str(), FindExInfoStandard, &data, FindExSearchNameMatch, NULL, 0);\n if (handle == INVALID_HANDLE_VALUE)\n {\n return;\n }\n do\n {\n string_t filepath(data.cFileName);\n files.push_back(filepath);\n } while (::FindNextFileW(handle, &data));\n ::FindClose(handle);\n}\n\nvoid pal::readdir(const string_t& path, std::vector<pal::string_t>* list)\n{\n pal::readdir(path, _X(\"*\"), list);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n \/\/ make MTL\n MTL M=make_MTL(G,F);\n printf(\"Read fiber center positions and compute related things\\n\");\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n printf(\"spectrometer has to be identified from 0 to F.Npetal-1\\n\");\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n printf(\"get neighbors of each fiber;\\n\");\n \/\/for each spectrometer, get list of fibers\n\n\t\/\/ Read plates in order they are to be observed\n \n\tPlates P_original = read_plate_centers(F);\n F.Nplate=P_original.size();\n \/\/This takes the place of Opsim or NextFieldSelector; will be replaced by appropriate code\n Plates P;\n List permut = random_permut(F.Nplate);\n for (int jj=0; jj<F.Nplate; jj++){\n P[jj]=P_original[permut[jj]];\n }\n\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\"before assignment\\n\");\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n simple_assign(M,P,pp,F,A);\n \n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n \n\treturn(0);\n}\n<commit_msg>more diagnostics<commit_after>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n \/\/ make MTL\n MTL M=make_MTL(G,F);\n printf(\"Read fiber center positions and compute related things\\n\");\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n printf(\"spectrometer has to be identified from 0 to F.Npetal-1\\n\");\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n printf(\"get neighbors of each fiber;\\n\");\n \/\/for each spectrometer, get list of fibers\n\n printf(\"Read plates in order they are to be observed\\n \");\n \n\tPlates P_original = read_plate_centers(F);\n F.Nplate=P_original.size();\n peintf(\"This takes the place of Opsim or NextFieldSelector; will be replaced by appropriate code\\n\");\n Plates P;\n List permut = random_permut(F.Nplate);\n for (int jj=0; jj<F.Nplate; jj++){\n P[jj]=P_original[permut[jj]];\n }\n\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\"before assignment\\n\");\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n simple_assign(M,P,pp,F,A);\n \n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n \n\treturn(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Author: Jeffrey Leung\n * Last edited: 2015-12-27\n *\n * This C++ file contains the implementation of the Labyrinth class, which uses\n * the Room class to create a 2-d mapping for a game.\n *\n *\/\n\n#include <cmath>\n#include <iostream>\n#include <stdexcept>\n\n#include \"..\/include\/room_properties.hpp\"\n#include \"..\/include\/room.hpp\"\n#include \"..\/include\/coordinate.hpp\"\n#include \"..\/include\/labyrinth.hpp\"\n\n\/\/ CONSTRUCTOR\/DESTRUCTOR:\n\n\/\/ Parameterized constructor\n\/\/ An exception is thrown if:\n\/\/ A size of 0 is given (invalid_argument)\nLabyrinth::Labyrinth( unsigned int x_size, unsigned int y_size )\n{\n if( x_size == 0 )\n {\n if( y_size == 0 )\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given empty x and \"\\\n \"y sizes.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given an empty \"\\\n \"x size.\\n\" );\n }\n }\n else if( y_size == 0 )\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given an empty \"\\\n \"y size.\\n\" );\n }\n\n rooms_ = new Room*[ y_size ];\n for( unsigned int i = 0; i < y_size; ++i )\n {\n rooms_[i] = new Room[ x_size ];\n }\n\n x_size_ = x_size;\n y_size_ = y_size;\n}\n\n\/\/ Destructor\nLabyrinth::~Labyrinth()\n{\n for( unsigned int i = 0; i < y_size_; ++i )\n {\n delete [] rooms_[i];\n }\n delete [] rooms_;\n}\n\n\/\/ SETUP:\n\n\/\/ This method connects two Rooms by breaking their walls.\n\/\/ An exception is thrown if:\n\/\/ The Rooms are already connected (logic_error)\n\/\/ The Rooms are the same (logic_error)\n\/\/ The Rooms are not adjacent (logic_error)\n\/\/ One or both Rooms are outside the Labyrinth (invalid_argument)\nvoid Labyrinth::ConnectRooms( Coordinate rm_1, Coordinate rm_2 )\n{\n if( rm_1 == rm_2 )\n {\n throw std::logic_error( \"Error: ConnectRooms() was given the same \"\\\n \"coordinate for the two Rooms.\\n\" );\n }\n\n else if( !WithinBounds(rm_1) || !WithinBounds(rm_2) )\n {\n if( !WithinBounds(rm_1) )\n {\n if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given invalid \"\\\n \"coordinates for both rm_1 and rm_2.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given \"\\\n \"an invalid coordinate for rm_1.\\n\" );\n }\n }\n\n else\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given an \"\\\n \"invalid coordinate for rm_2.\\n\" );\n }\n }\n\n else if( !IsAdjacent(rm_1, rm_2) )\n {\n throw std::logic_error( \"Error: ConnectRooms() was given two coordinates \"\\\n \"which are not adjacent, and therefore cannot be connected.\\n\" );\n }\n\n unsigned int x_distance = rm_2.x - rm_1.x;\n unsigned int y_distance = rm_2.y - rm_1.y;\n\n Direction break_wall_1;\n Direction break_wall_2;\n\n if( x_distance == 0 )\n {\n if( y_distance > 0 ) \/\/ rm_1 is north of rm_2\n {\n break_wall_1 = Direction::kSouth;\n break_wall_2 = Direction::kNorth;\n }\n else \/\/ rm_1 is south of rm_2\n {\n break_wall_1 = Direction::kNorth;\n break_wall_2 = Direction::kSouth;\n }\n }\n\n else if( y_distance == 0 )\n {\n if( x_distance > 0 ) \/\/ rm_1 is west of rm_2\n {\n break_wall_1 = Direction::kEast;\n break_wall_2 = Direction::kWest;\n }\n else \/\/ rm_1 is east of rm_2\n {\n break_wall_1 = Direction::kWest;\n break_wall_2 = Direction::kEast;\n }\n }\n\n else\n {\n throw std::logic_error( \"Error: ConnectRooms() called IsAdjacent(), \"\\\n \"which should have evaluated to false, but did not.\\n\" );\n }\n\n RoomAt(rm_1).BreakWall(break_wall_1);\n RoomAt(rm_2).BreakWall(break_wall_2);\n return;\n}\n\n\/\/ PLAY:\n\n\/\/ This method returns the type of RoomBorder in the given direction.\n\/\/ An exception is thrown if:\n\/\/ The Room is outside the Labyrinth (invalid_argument)\n\/\/ Direction d is kNone (invalid_argument)\nRoomBorder Labyrinth::DirectionCheck( Coordinate rm, Direction d ) const\n{\n if( !WithinBounds(rm) )\n {\n throw std::invalid_argument( \"Error: DirectionCheck() was given a \"\\\n \"Coordinate outside of the Labyrinth.\\n\" );\n }\n else if( d == Direction::kNone )\n {\n throw std::invalid_argument( \"Error: DirectionCheck() was given an \"\\\n \"invalid direction (kNone).\\n\" );\n }\n\n return RoomAt(rm).DirectionCheck(d);\n}\n\n\/\/ PRIVATE METHODS:\n\n\/\/ This private method returns a reference to the Room at the given\n\/\/ coordinate.\n\/\/ An exception is thrown if:\n\/\/ The Room is outside the Labyrinth (invalid_argument)\nRoom& Labyrinth::RoomAt( Coordinate rm ) const\n{\n if( !WithinBounds(rm) )\n {\n throw std::invalid_argument( \"Error: RoomAt() was given an invalid \"\\\n \"coordinate for rm.\\n\" );\n }\n return rooms_[rm.y][rm.x];\n}\n\n\/\/ This private method returns true if the Room is within the bounds of\n\/\/ the Labyrinth, and false otherwise.\nbool Labyrinth::WithinBounds( Coordinate rm ) const\n{\n return( rm.x < x_size_ && rm.y < y_size_ );\n}\n\n\/\/ This private method returns true if the two Rooms are adjacent, and\n\/\/ false otherwise.\n\/\/ An exception is thrown if:\n\/\/ One or both Rooms are outside the Labyrinth (invalid_argument)\n\/\/ The same Room is given twice (logic_error)\nbool Labyrinth::IsAdjacent( Coordinate rm_1, Coordinate rm_2 ) const\n{\n if( !WithinBounds(rm_1) )\n {\n if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given invalid \"\\\n \"coordinates for both rm_1 and rm_2.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given an invalid \"\\\n \"coordinate for rm_1.\\n\" );\n }\n }\n else if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given an invalid \"\\\n \"coordinate for rm_2.\\n\" );\n }\n\n if( rm_1 == rm_2 )\n {\n throw std::logic_error( \"Error: IsAdjacent() was given the same \"\\\n \"coordinate for the Rooms.\\n\" );\n }\n\n unsigned int x_distance;\n if( rm_1.x > rm_2.x )\n {\n x_distance = rm_1.x - rm_2.x;\n }\n else\n {\n x_distance = rm_2.x - rm_1.x;\n }\n\n unsigned int y_distance;\n if( rm_1.y > rm_2.y )\n {\n y_distance = rm_1.y - rm_2.y;\n }\n else\n {\n y_distance = rm_2.y - rm_1.y;\n }\n\n if( ( x_distance == 0 && y_distance == 1 ) ||\n ( x_distance == 1 && y_distance == 0 ) )\n {\n return true;\n }\n return false;\n}\n<commit_msg>Laby ConnectRooms(): Changing from unsigned int calculations to int.<commit_after>\/*\n *\n * Author: Jeffrey Leung\n * Last edited: 2015-12-27\n *\n * This C++ file contains the implementation of the Labyrinth class, which uses\n * the Room class to create a 2-d mapping for a game.\n *\n *\/\n\n#include <cmath>\n#include <iostream>\n#include <stdexcept>\n\n#include \"..\/include\/room_properties.hpp\"\n#include \"..\/include\/room.hpp\"\n#include \"..\/include\/coordinate.hpp\"\n#include \"..\/include\/labyrinth.hpp\"\n\n\/\/ CONSTRUCTOR\/DESTRUCTOR:\n\n\/\/ Parameterized constructor\n\/\/ An exception is thrown if:\n\/\/ A size of 0 is given (invalid_argument)\nLabyrinth::Labyrinth( unsigned int x_size, unsigned int y_size )\n{\n if( x_size == 0 )\n {\n if( y_size == 0 )\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given empty x and \"\\\n \"y sizes.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given an empty \"\\\n \"x size.\\n\" );\n }\n }\n else if( y_size == 0 )\n {\n throw std::invalid_argument( \"Error: Labyrinth() was given an empty \"\\\n \"y size.\\n\" );\n }\n\n rooms_ = new Room*[ y_size ];\n for( unsigned int i = 0; i < y_size; ++i )\n {\n rooms_[i] = new Room[ x_size ];\n }\n\n x_size_ = x_size;\n y_size_ = y_size;\n}\n\n\/\/ Destructor\nLabyrinth::~Labyrinth()\n{\n for( unsigned int i = 0; i < y_size_; ++i )\n {\n delete [] rooms_[i];\n }\n delete [] rooms_;\n}\n\n\/\/ SETUP:\n\n\/\/ This method connects two Rooms by breaking their walls.\n\/\/ An exception is thrown if:\n\/\/ The Rooms are already connected (logic_error)\n\/\/ The Rooms are the same (logic_error)\n\/\/ The Rooms are not adjacent (logic_error)\n\/\/ One or both Rooms are outside the Labyrinth (invalid_argument)\nvoid Labyrinth::ConnectRooms( Coordinate rm_1, Coordinate rm_2 )\n{\n if( rm_1 == rm_2 )\n {\n throw std::logic_error( \"Error: ConnectRooms() was given the same \"\\\n \"coordinate for the two Rooms.\\n\" );\n }\n\n else if( !WithinBounds(rm_1) || !WithinBounds(rm_2) )\n {\n if( !WithinBounds(rm_1) )\n {\n if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given invalid \"\\\n \"coordinates for both rm_1 and rm_2.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given \"\\\n \"an invalid coordinate for rm_1.\\n\" );\n }\n }\n\n else\n {\n throw std::invalid_argument( \"Error: ConnectRooms() was given an \"\\\n \"invalid coordinate for rm_2.\\n\" );\n }\n }\n\n else if( !IsAdjacent(rm_1, rm_2) )\n {\n throw std::logic_error( \"Error: ConnectRooms() was given two coordinates \"\\\n \"which are not adjacent, and therefore cannot be connected.\\n\" );\n }\n\n int x_distance = (int)(rm_2.x) - (int)(rm_1.x);\n int y_distance = (int)(rm_2.y) - (int)(rm_1.y);\n\n Direction break_wall_1;\n Direction break_wall_2;\n\n if( x_distance == 0 )\n {\n if( y_distance > 0 ) \/\/ rm_1 is north of rm_2\n {\n break_wall_1 = Direction::kSouth;\n break_wall_2 = Direction::kNorth;\n }\n else \/\/ rm_1 is south of rm_2\n {\n break_wall_1 = Direction::kNorth;\n break_wall_2 = Direction::kSouth;\n }\n }\n\n else if( y_distance == 0 )\n {\n if( x_distance > 0 ) \/\/ rm_1 is west of rm_2\n {\n break_wall_1 = Direction::kEast;\n break_wall_2 = Direction::kWest;\n }\n else \/\/ rm_1 is east of rm_2\n {\n break_wall_1 = Direction::kWest;\n break_wall_2 = Direction::kEast;\n }\n }\n\n else\n {\n throw std::logic_error( \"Error: ConnectRooms() called IsAdjacent(), \"\\\n \"which should have evaluated to false, but did not.\\n\" );\n }\n\n RoomAt(rm_1).BreakWall(break_wall_1);\n RoomAt(rm_2).BreakWall(break_wall_2);\n return;\n}\n\n\/\/ PLAY:\n\n\/\/ This method returns the type of RoomBorder in the given direction.\n\/\/ An exception is thrown if:\n\/\/ The Room is outside the Labyrinth (invalid_argument)\n\/\/ Direction d is kNone (invalid_argument)\nRoomBorder Labyrinth::DirectionCheck( Coordinate rm, Direction d ) const\n{\n if( !WithinBounds(rm) )\n {\n throw std::invalid_argument( \"Error: DirectionCheck() was given a \"\\\n \"Coordinate outside of the Labyrinth.\\n\" );\n }\n else if( d == Direction::kNone )\n {\n throw std::invalid_argument( \"Error: DirectionCheck() was given an \"\\\n \"invalid direction (kNone).\\n\" );\n }\n\n return RoomAt(rm).DirectionCheck(d);\n}\n\n\/\/ PRIVATE METHODS:\n\n\/\/ This private method returns a reference to the Room at the given\n\/\/ coordinate.\n\/\/ An exception is thrown if:\n\/\/ The Room is outside the Labyrinth (invalid_argument)\nRoom& Labyrinth::RoomAt( Coordinate rm ) const\n{\n if( !WithinBounds(rm) )\n {\n throw std::invalid_argument( \"Error: RoomAt() was given an invalid \"\\\n \"coordinate for rm.\\n\" );\n }\n return rooms_[rm.y][rm.x];\n}\n\n\/\/ This private method returns true if the Room is within the bounds of\n\/\/ the Labyrinth, and false otherwise.\nbool Labyrinth::WithinBounds( Coordinate rm ) const\n{\n return( rm.x < x_size_ && rm.y < y_size_ );\n}\n\n\/\/ This private method returns true if the two Rooms are adjacent, and\n\/\/ false otherwise.\n\/\/ An exception is thrown if:\n\/\/ One or both Rooms are outside the Labyrinth (invalid_argument)\n\/\/ The same Room is given twice (logic_error)\nbool Labyrinth::IsAdjacent( Coordinate rm_1, Coordinate rm_2 ) const\n{\n if( !WithinBounds(rm_1) )\n {\n if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given invalid \"\\\n \"coordinates for both rm_1 and rm_2.\\n\" );\n }\n else\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given an invalid \"\\\n \"coordinate for rm_1.\\n\" );\n }\n }\n else if( !WithinBounds(rm_2) )\n {\n throw std::invalid_argument( \"Error: IsAdjacent() was given an invalid \"\\\n \"coordinate for rm_2.\\n\" );\n }\n\n if( rm_1 == rm_2 )\n {\n throw std::logic_error( \"Error: IsAdjacent() was given the same \"\\\n \"coordinate for the Rooms.\\n\" );\n }\n\n unsigned int x_distance;\n if( rm_1.x > rm_2.x )\n {\n x_distance = rm_1.x - rm_2.x;\n }\n else\n {\n x_distance = rm_2.x - rm_1.x;\n }\n\n unsigned int y_distance;\n if( rm_1.y > rm_2.y )\n {\n y_distance = rm_1.y - rm_2.y;\n }\n else\n {\n y_distance = rm_2.y - rm_1.y;\n }\n\n if( ( x_distance == 0 && y_distance == 1 ) ||\n ( x_distance == 1 && y_distance == 0 ) )\n {\n return true;\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n std::vector<int> count;\n count=count_galaxies(G);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/ make MTL\n MTL Min=make_MTL(G,F);\n write_MTLfile(Min);\n MTL M=read_MTLfile(F);\n assign_priority_class(M);\n \/\/find available SS and SF galaxies on each petal\n\n std::vector <int> count_class(M.priority_list.size(),0);\n \n printf(\"Number in each priority class. The last two are SF and SS.\\n\");\n for(int i;i<M.size();++i){\n count_class[M[i].priority_class]+=1;\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d number %d\\n\",i,count_class[i]);\n }\n \n printf(\" number of MTL galaxies %d\\n\",M.size());\n \n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n\tPlates P = read_plate_centers(F);\n F.Nplate=P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n \n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n \n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n\n simple_assign(M,P,pp,F,A);\n diagnostic(M,G,F,A);\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\n\t\tif(j%1000==0)diagnostic(M,G,F,A);\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==1000 || j==3000) {\n printf ( \"Redistribute and improve at j = %d\\n\",j);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n \/\/diagnostic(M,G,F,A);\n\t\t}\n\n }\n\tprint_time(time,\"# ... took :\");\n \n \n \/\/diagnostic check on SS and SF\n for (int j=0;j<F.Nplate;++j){\n for (int p=0; p<F.Npetal; ++p){\n if(P[j].SS_in_petal[p]!=F.MaxSS){printf(\"SS j= %d p= %d number = %d\\n\",j,p,P[j].SS_in_petal[p]);}\n if(P[j].SF_in_petal[p]!=F.MaxSF){printf(\"SF j= %d p= %d number = %d\\n\",j,p,P[j].SF_in_petal[p]);}\n }\n }\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n\n\treturn(0);\n \n}\n<commit_msg>remove make_MTL from assigns main<commit_after>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n std::vector<int> count;\n count=count_galaxies(G);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/ make MTL\n \/\/MTL Min=make_MTL(G,F);\n \/\/write_MTLfile(Min);\n MTL M=read_MTLfile(F);\n assign_priority_class(M);\n \/\/find available SS and SF galaxies on each petal\n\n std::vector <int> count_class(M.priority_list.size(),0);\n \n printf(\"Number in each priority class. The last two are SF and SS.\\n\");\n for(int i;i<M.size();++i){\n count_class[M[i].priority_class]+=1;\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d number %d\\n\",i,count_class[i]);\n }\n \n printf(\" number of MTL galaxies %d\\n\",M.size());\n \n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n\tPlates P = read_plate_centers(F);\n F.Nplate=P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n \n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n \n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n\n simple_assign(M,P,pp,F,A);\n diagnostic(M,G,F,A);\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\n\t\tif(j%1000==0)diagnostic(M,G,F,A);\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==1000 || j==3000) {\n printf ( \"Redistribute and improve at j = %d\\n\",j);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n \/\/diagnostic(M,G,F,A);\n\t\t}\n\n }\n\tprint_time(time,\"# ... took :\");\n \n \n \/\/diagnostic check on SS and SF\n for (int j=0;j<F.Nplate;++j){\n for (int p=0; p<F.Npetal; ++p){\n if(P[j].SS_in_petal[p]!=F.MaxSS){printf(\"SS j= %d p= %d number = %d\\n\",j,p,P[j].SS_in_petal[p]);}\n if(P[j].SF_in_petal[p]!=F.MaxSF){printf(\"SF j= %d p= %d number = %d\\n\",j,p,P[j].SF_in_petal[p]);}\n }\n }\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n\n\treturn(0);\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Application.hpp\"\n\n#include <iostream>\n\n\/\/ Command line arguments format:\n\/\/ <execute command> <width> <height> <num cells> <output file>\nint main(int argc, char** argv)\n{\n Application application;\n\n int width = 500;\n int height = 500;\n int numCells = 10;\n std::string outputFile = \"GeneratedMaze.txt\";\n\n if (argc == 5)\n {\n width = std::atoi(argv[1]);\n height = std::atoi(argv[2]);\n numCells = std::atoi(argv[3]);\n outputFile = std::string(argv[4]);\n }\n\n std::printf(\"Width: %i\\nHeight: %i\\nNum Cells: %i\\nOutput file: %s\\n\", width, height, numCells, outputFile.c_str());\n\n application.setWidth(width);\n application.setHeight(height);\n application.setNumCells(numCells);\n application.setOutputFile(outputFile);\n\n application.run();\n\n return 0;\n}\n\n<commit_msg>Usage instructions are now printed if the wrong number of arguments are provided<commit_after>#include \"Application.hpp\"\n\n#include <iostream>\n\n\/\/ Command line arguments format:\n\/\/ .\/MazeGenerator <width> <height> <num cells> <output file>\nint main(int argc, char** argv)\n{\n Application application;\n\n int width = 500;\n int height = 500;\n int numCells = 10;\n std::string outputFile = \"GeneratedMaze.txt\";\n\n if (argc != 1)\n {\n if (argc == 5)\n {\n width = std::atoi(argv[1]);\n height = std::atoi(argv[2]);\n numCells = std::atoi(argv[3]);\n outputFile = std::string(argv[4]);\n }\n else\n {\n std::printf(\"==\\nIncorrect arguments. Using defaults\\n\");\n std::printf(\"Usage: .\/MazeGenerator <width> <height> <num cells> <output file>\\n==\\n\\n\");\n }\n }\n\n\n std::printf(\"Width: %i\\nHeight: %i\\nNum Cells: %i\\nOutput file: %s\\n\", width, height, numCells, outputFile.c_str());\n\n application.setWidth(width);\n application.setHeight(height);\n application.setNumCells(numCells);\n application.setOutputFile(outputFile);\n\n application.run();\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * FileLock.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/FileLock.hpp>\n\n\/\/ #define RSTUDIO_ENABLE_DEBUG_MACROS\n#include <core\/Macros.hpp>\n\n#include <core\/Settings.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/http\/SocketUtils.hpp>\n\n#include <boost\/algorithm\/string.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nnamespace file_lock {\nvoid initialize()\n{\n FileLock::initialize();\n}\n} \/\/ end namespace file_lock\n\nnamespace {\n\nconst char * const kLockTypeAdvisory = \"advisory\";\nconst char * const kLockTypeLinkBased = \"linkbased\";\n\nconst char * const kLocksConfPath = \"\/etc\/rstudio\/file-locks\";\nconst double kDefaultRefreshRate = 20.0;\nconst double kDefaultTimeoutInterval = 30.0;\n\nstd::string lockTypeToString(FileLock::LockType type)\n{\n switch (type)\n {\n case FileLock::LOCKTYPE_ADVISORY: return kLockTypeAdvisory;\n case FileLock::LOCKTYPE_LINKBASED: return kLockTypeLinkBased;\n }\n \n \/\/ not reached\n return std::string();\n}\n\nFileLock::LockType stringToLockType(const std::string& lockType)\n{\n using namespace boost::algorithm;\n \n if (boost::iequals(lockType, kLockTypeAdvisory))\n return FileLock::LOCKTYPE_ADVISORY;\n else if (boost::iequals(lockType, kLockTypeLinkBased))\n return FileLock::LOCKTYPE_LINKBASED;\n \n LOG_WARNING_MESSAGE(\"unrecognized lock type '\" + lockType + \"'\");\n return FileLock::LOCKTYPE_ADVISORY;\n}\n\ndouble getFieldPositive(const Settings& settings,\n const std::string& name,\n double defaultValue)\n{\n double value = settings.getDouble(name, defaultValue);\n if (value < 0)\n {\n LOG_WARNING_MESSAGE(\"invalid field '\" + name + \"': must be positive\");\n return defaultValue;\n }\n \n return value;\n}\n\n} \/\/ end anonymous namespace\n\nbool s_isInitialized = false;\n\nbool FileLock::ensureInitialized()\n{\n if (!s_isInitialized)\n {\n static bool s_warned = false;\n if (s_warned)\n return s_isInitialized;\n \n s_warned = true;\n LOG_WARNING_MESSAGE(\n \"FileLock classes not yet initialized; please call \"\n \"'FileLock::initialize()' and 'FileLock::cleanUp()' as appropriate\");\n }\n \n return s_isInitialized;\n}\n\nvoid FileLock::initialize(FilePath locksConfPath)\n{\n s_isInitialized = true;\n \n if (locksConfPath.empty())\n locksConfPath = FilePath(kLocksConfPath);\n \n if (!locksConfPath.exists())\n return;\n \n Settings settings;\n Error error = settings.initialize(locksConfPath);\n if (error)\n {\n LOG_ERROR(error);\n return;\n }\n \n FileLock::initialize(settings);\n}\n\nvoid FileLock::initialize(const Settings& settings)\n{\n s_isInitialized = true;\n \n \/\/ default lock type\n FileLock::s_defaultType = stringToLockType(settings.get(\"lock-type\", kLockTypeAdvisory));\n \n \/\/ timeout interval\n double timeoutInterval = getFieldPositive(settings, \"timeout-interval\", kDefaultTimeoutInterval);\n FileLock::s_timeoutInterval = boost::posix_time::seconds(timeoutInterval);\n \n \/\/ refresh rate\n double refreshRate = getFieldPositive(settings, \"refresh-rate\", kDefaultRefreshRate);\n FileLock::s_refreshRate = boost::posix_time::seconds(refreshRate);\n \n DEBUG_BLOCK(\"lock initialization\")\n {\n std::cerr << \"Type: \" << lockTypeToString(FileLock::s_defaultType) << std::endl;\n std::cerr << \"Timeout: \" << FileLock::s_timeoutInterval.total_seconds() << std::endl;\n std::cerr << \"Refresh: \" << FileLock::s_refreshRate.total_seconds() << std::endl;\n }\n}\n\n\/\/ default values for static members\nFileLock::LockType FileLock::s_defaultType(FileLock::LOCKTYPE_ADVISORY);\nboost::posix_time::seconds FileLock::s_timeoutInterval(kDefaultTimeoutInterval);\nboost::posix_time::seconds FileLock::s_refreshRate(kDefaultRefreshRate);\n\nboost::shared_ptr<FileLock> FileLock::create(LockType type)\n{\n ensureInitialized();\n \n switch (type)\n {\n case LOCKTYPE_ADVISORY: return boost::shared_ptr<FileLock>(new AdvisoryFileLock());\n case LOCKTYPE_LINKBASED: return boost::shared_ptr<FileLock>(new LinkBasedFileLock());\n }\n \n \/\/ shouldn't be reached\n return boost::shared_ptr<FileLock>(new AdvisoryFileLock());\n}\n\nboost::shared_ptr<FileLock> FileLock::createDefault()\n{\n ensureInitialized();\n return FileLock::create(s_defaultType);\n}\n\nvoid FileLock::refresh()\n{\n ensureInitialized();\n AdvisoryFileLock::refresh();\n LinkBasedFileLock::refresh();\n}\n\nvoid FileLock::cleanUp()\n{\n ensureInitialized();\n AdvisoryFileLock::cleanUp();\n LinkBasedFileLock::cleanUp();\n}\n\nnamespace {\n\nvoid schedulePeriodicExecution(\n const boost::system::error_code& ec,\n boost::asio::deadline_timer& timer,\n boost::posix_time::seconds interval,\n boost::function<void()> callback)\n{\n try\n {\n \/\/ bail on boost errors (these are very unexpected)\n if (ec)\n {\n if (!core::isShutdownError(ec))\n LOG_ERROR(core::Error(ec, ERROR_LOCATION));\n return;\n }\n \n \/\/ execute callback\n callback();\n\n \/\/ reschedule\n boost::system::error_code errc;\n timer.expires_at(timer.expires_at() + interval, errc);\n if (errc)\n {\n LOG_ERROR(Error(errc, ERROR_LOCATION));\n return;\n }\n \n timer.async_wait(boost::bind(\n schedulePeriodicExecution,\n boost::asio::placeholders::error,\n boost::ref(timer),\n interval,\n callback));\n }\n catch (...)\n {\n \/\/ swallow errors\n }\n}\n\n} \/\/ end anonymous namespace\n\nvoid FileLock::refreshPeriodically(boost::asio::io_service& service,\n boost::posix_time::seconds interval)\n{\n \/\/ protect against re-entrancy\n static bool s_isRefreshing = false;\n if (s_isRefreshing)\n return;\n s_isRefreshing = true;\n \n ensureInitialized();\n \n static boost::asio::deadline_timer timer(service, interval);\n timer.async_wait(boost::bind(\n schedulePeriodicExecution,\n boost::asio::placeholders::error,\n boost::ref(timer),\n interval,\n FileLock::refresh));\n}\n\n} \/\/ end namespace core\n} \/\/ end namespace rstudio\n<commit_msg>s_isInitialized move to anon ns<commit_after>\/*\n * FileLock.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * Unless you have received this program directly from RStudio pursuant\n * to the terms of a commercial license agreement with RStudio, then\n * this program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/FileLock.hpp>\n\n\/\/ #define RSTUDIO_ENABLE_DEBUG_MACROS\n#include <core\/Macros.hpp>\n\n#include <core\/Settings.hpp>\n#include <core\/Error.hpp>\n#include <core\/Log.hpp>\n#include <core\/FileSerializer.hpp>\n#include <core\/http\/SocketUtils.hpp>\n\n#include <boost\/algorithm\/string.hpp>\n\nnamespace rstudio {\nnamespace core {\n\nnamespace file_lock {\nvoid initialize()\n{\n FileLock::initialize();\n}\n} \/\/ end namespace file_lock\n\nnamespace {\n\nconst char * const kLockTypeAdvisory = \"advisory\";\nconst char * const kLockTypeLinkBased = \"linkbased\";\n\nconst char * const kLocksConfPath = \"\/etc\/rstudio\/file-locks\";\nconst double kDefaultRefreshRate = 20.0;\nconst double kDefaultTimeoutInterval = 30.0;\n\nstd::string lockTypeToString(FileLock::LockType type)\n{\n switch (type)\n {\n case FileLock::LOCKTYPE_ADVISORY: return kLockTypeAdvisory;\n case FileLock::LOCKTYPE_LINKBASED: return kLockTypeLinkBased;\n }\n \n \/\/ not reached\n return std::string();\n}\n\nFileLock::LockType stringToLockType(const std::string& lockType)\n{\n using namespace boost::algorithm;\n \n if (boost::iequals(lockType, kLockTypeAdvisory))\n return FileLock::LOCKTYPE_ADVISORY;\n else if (boost::iequals(lockType, kLockTypeLinkBased))\n return FileLock::LOCKTYPE_LINKBASED;\n \n LOG_WARNING_MESSAGE(\"unrecognized lock type '\" + lockType + \"'\");\n return FileLock::LOCKTYPE_ADVISORY;\n}\n\ndouble getFieldPositive(const Settings& settings,\n const std::string& name,\n double defaultValue)\n{\n double value = settings.getDouble(name, defaultValue);\n if (value < 0)\n {\n LOG_WARNING_MESSAGE(\"invalid field '\" + name + \"': must be positive\");\n return defaultValue;\n }\n \n return value;\n}\n\nbool s_isInitialized = false;\n\n} \/\/ end anonymous namespace\n\nbool FileLock::ensureInitialized()\n{\n if (!s_isInitialized)\n {\n static bool s_warned = false;\n if (s_warned)\n return s_isInitialized;\n \n s_warned = true;\n LOG_WARNING_MESSAGE(\n \"FileLock classes not yet initialized; please call \"\n \"'FileLock::initialize()' and 'FileLock::cleanUp()' as appropriate\");\n }\n \n return s_isInitialized;\n}\n\nvoid FileLock::initialize(FilePath locksConfPath)\n{\n s_isInitialized = true;\n \n if (locksConfPath.empty())\n locksConfPath = FilePath(kLocksConfPath);\n \n if (!locksConfPath.exists())\n return;\n \n Settings settings;\n Error error = settings.initialize(locksConfPath);\n if (error)\n {\n LOG_ERROR(error);\n return;\n }\n \n FileLock::initialize(settings);\n}\n\nvoid FileLock::initialize(const Settings& settings)\n{\n s_isInitialized = true;\n \n \/\/ default lock type\n FileLock::s_defaultType = stringToLockType(settings.get(\"lock-type\", kLockTypeAdvisory));\n \n \/\/ timeout interval\n double timeoutInterval = getFieldPositive(settings, \"timeout-interval\", kDefaultTimeoutInterval);\n FileLock::s_timeoutInterval = boost::posix_time::seconds(timeoutInterval);\n \n \/\/ refresh rate\n double refreshRate = getFieldPositive(settings, \"refresh-rate\", kDefaultRefreshRate);\n FileLock::s_refreshRate = boost::posix_time::seconds(refreshRate);\n \n DEBUG_BLOCK(\"lock initialization\")\n {\n std::cerr << \"Type: \" << lockTypeToString(FileLock::s_defaultType) << std::endl;\n std::cerr << \"Timeout: \" << FileLock::s_timeoutInterval.total_seconds() << std::endl;\n std::cerr << \"Refresh: \" << FileLock::s_refreshRate.total_seconds() << std::endl;\n }\n}\n\n\/\/ default values for static members\nFileLock::LockType FileLock::s_defaultType(FileLock::LOCKTYPE_ADVISORY);\nboost::posix_time::seconds FileLock::s_timeoutInterval(kDefaultTimeoutInterval);\nboost::posix_time::seconds FileLock::s_refreshRate(kDefaultRefreshRate);\n\nboost::shared_ptr<FileLock> FileLock::create(LockType type)\n{\n ensureInitialized();\n \n switch (type)\n {\n case LOCKTYPE_ADVISORY: return boost::shared_ptr<FileLock>(new AdvisoryFileLock());\n case LOCKTYPE_LINKBASED: return boost::shared_ptr<FileLock>(new LinkBasedFileLock());\n }\n \n \/\/ shouldn't be reached\n return boost::shared_ptr<FileLock>(new AdvisoryFileLock());\n}\n\nboost::shared_ptr<FileLock> FileLock::createDefault()\n{\n ensureInitialized();\n return FileLock::create(s_defaultType);\n}\n\nvoid FileLock::refresh()\n{\n ensureInitialized();\n AdvisoryFileLock::refresh();\n LinkBasedFileLock::refresh();\n}\n\nvoid FileLock::cleanUp()\n{\n ensureInitialized();\n AdvisoryFileLock::cleanUp();\n LinkBasedFileLock::cleanUp();\n}\n\nnamespace {\n\nvoid schedulePeriodicExecution(\n const boost::system::error_code& ec,\n boost::asio::deadline_timer& timer,\n boost::posix_time::seconds interval,\n boost::function<void()> callback)\n{\n try\n {\n \/\/ bail on boost errors (these are very unexpected)\n if (ec)\n {\n if (!core::isShutdownError(ec))\n LOG_ERROR(core::Error(ec, ERROR_LOCATION));\n return;\n }\n \n \/\/ execute callback\n callback();\n\n \/\/ reschedule\n boost::system::error_code errc;\n timer.expires_at(timer.expires_at() + interval, errc);\n if (errc)\n {\n LOG_ERROR(Error(errc, ERROR_LOCATION));\n return;\n }\n \n timer.async_wait(boost::bind(\n schedulePeriodicExecution,\n boost::asio::placeholders::error,\n boost::ref(timer),\n interval,\n callback));\n }\n catch (...)\n {\n \/\/ swallow errors\n }\n}\n\n} \/\/ end anonymous namespace\n\nvoid FileLock::refreshPeriodically(boost::asio::io_service& service,\n boost::posix_time::seconds interval)\n{\n \/\/ protect against re-entrancy\n static bool s_isRefreshing = false;\n if (s_isRefreshing)\n return;\n s_isRefreshing = true;\n \n ensureInitialized();\n \n static boost::asio::deadline_timer timer(service, interval);\n timer.async_wait(boost::bind(\n schedulePeriodicExecution,\n boost::asio::placeholders::error,\n boost::ref(timer),\n interval,\n FileLock::refresh));\n}\n\n} \/\/ end namespace core\n} \/\/ end namespace rstudio\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file main.cpp\n * @ingroup CppAlgorithms\n * @brief Experimenting with well known algorithms and data structures.\n *\n * Copyright (c) 2013 Sebastien Rombauts (sebastien.rombauts@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n\n#include <cstdio>\n\n#include \"algo\/hash.h\"\n\n\nint main() {\n printf(\"Hash::sdbm('test')=%lx\\n\", Hash::sdbm(\"test\"));\n\n return 0;\n}\n<commit_msg>Fixed a gcc warning<commit_after>\/**\n * @file main.cpp\n * @ingroup CppAlgorithms\n * @brief Experimenting with well known algorithms and data structures.\n *\n * Copyright (c) 2013 Sebastien Rombauts (sebastien.rombauts@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n\n#include <cstdio>\n\n#include \"algo\/hash.h\"\n\n\nint main() {\n printf(\"Hash::sdbm('test')=%x\\n\", Hash::sdbm(\"test\"));\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * V1.cpp\n *\n * Created on: Jul 30, 2008\n * Author: rasmussn\n *\/\n\n#include \"..\/include\/pv_common.h\"\n#include \"..\/include\/default_params.h\"\n#include \"..\/connections\/PVConnection.h\"\n#include \"HyPerLayer.hpp\"\n#include \"V1.hpp\"\n\n#include <assert.h>\n#include <float.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace PV\n{\n\nV1Params V1DefaultParams =\n{\n V_REST, V_EXC, V_INH, V_INHB, \/\/ V (mV)\n TAU_VMEM, TAU_EXC, TAU_INH, TAU_INHB,\n VTH_REST, TAU_VTH, DELTA_VTH,\t \/\/ tau (ms)\n 250, NOISE_AMP*( 1.0\/TAU_EXC ) * ( ( TAU_INH * (V_REST-V_INH) + TAU_INHB * (V_REST-V_INHB) ) \/ (V_EXC-V_REST) ),\n 250, NOISE_AMP*1.0,\n 250, NOISE_AMP*1.0 \/\/ noise (G)\n};\n\nV1::V1(const char* name, HyPerCol * hc)\n : HyPerLayer(name, hc)\n{\n initialize(TypeV1Simple);\n}\n\nV1::V1(const char* name, HyPerCol * hc, PVLayerType type)\n : HyPerLayer(name, hc)\n{\n initialize(type);\n}\n\nint V1::initialize(PVLayerType type)\n{\n float time = 0.0f;\n\n setParams(parent->parameters(), &V1DefaultParams);\n\n pvlayer_setFuncs(clayer, (INIT_FN) &LIF2_init, (UPDATE_FN) &LIF2_update_exact_linear);\n this->clayer->layerType = type;\n\n parent->addLayer(this);\n\n if (parent->parameters()->value(name, \"restart\", 0) != 0) {\n readState(name, &time);\n }\n\n return 0;\n}\n\nint V1::setParams(PVParams * params, V1Params * p)\n{\n float dt = .001 * parent->getDeltaTime(); \/\/ seconds\n\n clayer->params = (float *) malloc(sizeof(*p));\n assert(clayer->params != NULL);\n memcpy(clayer->params, p, sizeof(*p));\n\n clayer->numParams = sizeof(*p) \/ sizeof(float);\n assert(clayer->numParams == 17);\n\n V1Params * cp = (V1Params *) clayer->params;\n\n if (params->present(name, \"Vrest\")) cp->Vrest = params->value(name, \"Vrest\");\n if (params->present(name, \"Vexc\")) cp->Vexc = params->value(name, \"Vexc\");\n if (params->present(name, \"Vinh\")) cp->Vinh = params->value(name, \"Vinh\");\n if (params->present(name, \"VinhB\")) cp->VinhB = params->value(name, \"VinhB\");\n\n if (params->present(name, \"tau\")) cp->tau = params->value(name, \"tau\");\n if (params->present(name, \"tauE\")) cp->tauE = params->value(name, \"tauE\");\n if (params->present(name, \"tauI\")) cp->tauI = params->value(name, \"tauI\");\n if (params->present(name, \"tauIB\")) cp->tauIB = params->value(name, \"tauIB\");\n\n if (params->present(name, \"VthRest\")) cp->VthRest = params->value(name, \"VthRest\");\n if (params->present(name, \"tauVth\")) cp->tauVth = params->value(name, \"tauVth\");\n if (params->present(name, \"deltaVth\")) cp->deltaVth = params->value(name, \"deltaVth\");\n\n if (params->present(name, \"noiseAmpE\")) cp->noiseAmpE = params->value(name, \"noiseAmpE\");\n if (params->present(name, \"noiseAmpI\")) cp->noiseAmpI = params->value(name, \"noiseAmpI\");\n if (params->present(name, \"noiseAmpIB\")) cp->noiseAmpIB = params->value(name, \"noiseAmpIB\");\n\n if (params->present(name, \"noiseFreqE\")) {\n cp->noiseFreqE = params->value(name, \"noiseFreqE\");\n if (dt * cp->noiseFreqE > 1.0) cp->noiseFreqE = 1.0 \/ dt;\n }\n if (params->present(name, \"noiseFreqI\")) {\n cp->noiseFreqI = params->value(name, \"noiseFreqI\");\n if (dt * cp->noiseFreqI > 1.0) cp->noiseFreqI = 1.0 \/ dt;\n }\n if (params->present(name, \"noiseFreqIB\")) {\n cp->noiseFreqIB = params->value(name, \"noiseFreqIB\");\n if (dt * cp->noiseFreqIB > 1.0) cp->noiseFreqIB = 1.0 \/ dt;\n }\n\n return 0;\n}\n\nint V1::updateState(float time, float dt)\n{\n PVParams * params = parent->parameters();\n int spikingFlag = 1;\n\n pv_debug_info(\"[%d]: V1::updateState:\", clayer->columnId);\n\n if (params->present(name, \"spikingFlag\")) {\n spikingFlag = params->value(name, \"spikingFlag\");\n }\n\n if (spikingFlag != 0) {\n return LIF2_update_exact_linear(clayer, dt);\n }\n\n \/\/ just copy accumulation buffer to membrane potential\n \/\/ and activity buffer (nonspiking)\n\n const int nx = clayer->loc.nx;\n const int ny = clayer->loc.ny;\n const int nf = clayer->numFeatures;\n const int marginWidth = clayer->loc.nPad;\n\n pvdata_t * V = clayer->V;\n pvdata_t * phiExc = clayer->phi[PHI_EXC];\n pvdata_t * phiInh = clayer->phi[PHI_INH];\n pvdata_t * activity = clayer->activity->data;\n\n \/\/ make sure activity in border is zero\n \/\/\n for (int k = 0; k < clayer->numExtended; k++) {\n activity[k] = 0.0;\n }\n\n for (int k = 0; k < clayer->numNeurons; k++) {\n int kex = kIndexExtended(k, nx, ny, nf, marginWidth);\n V[k] = phiExc[k] - phiInh[k];\n activity[kex] = V[k];\n\n \/\/ reset accumulation buffers\n phiExc[k] = 0.0;\n phiInh[k] = 0.0;\n }\n\n return 0;\n}\n\nint V1::writeState(const char * path, float time)\n{\n HyPerLayer::writeState(path, time);\n\n#ifdef DEBUG_OUTPUT\n \/\/ print activity at center of image\n\n int sx = clayer->numFeatures;\n int sy = sx*clayer->loc.nx;\n pvdata_t * a = clayer->activity->data;\n\n int n = (int) (sy*(clayer->loc.ny\/2 - 1) + sx*(clayer->loc.nx\/2));\n for (int f = 0; f < clayer->numFeatures; f++) {\n printf(\"f = %d, a[%d] = %f\\n\", f, n, a[n]);\n n += 1;\n }\n printf(\"\\n\");\n\n n = (int) (sy*(clayer->loc.ny\/2 - 1) + sx*(clayer->loc.nx\/2));\n n -= 8;\n for (int f = 0; f < clayer->numFeatures; f++) {\n printf(\"f = %d, a[%d] = %f\\n\", f, n, a[n]);\n n += 1;\n }\n#endif\n\n return 0;\n}\n\nint V1::findPostSynaptic(int dim, int maxSize, int col,\n\/\/ input: which layer, which neuron\n\t\tHyPerLayer *lSource, float pos[],\n\n\t\t\/\/ output: how many of our neurons are connected.\n\t\t\/\/ an array with their indices.\n\t\t\/\/ an array with their feature vectors.\n\t\tint* nNeurons, int nConnectedNeurons[], float *vPos)\n{\n\treturn 0;\n}\n\n} \/\/ namespace PV\n<commit_msg>Casts (and the like, mostly to ints) to remove compiler warnings on Lobo.<commit_after>\/*\n * V1.cpp\n *\n * Created on: Jul 30, 2008\n * Author: rasmussn\n *\/\n\n#include \"..\/include\/pv_common.h\"\n#include \"..\/include\/default_params.h\"\n#include \"..\/connections\/PVConnection.h\"\n#include \"HyPerLayer.hpp\"\n#include \"V1.hpp\"\n\n#include <assert.h>\n#include <float.h>\n#include <math.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nnamespace PV\n{\n\nV1Params V1DefaultParams =\n{\n V_REST, V_EXC, V_INH, V_INHB, \/\/ V (mV)\n TAU_VMEM, TAU_EXC, TAU_INH, TAU_INHB,\n VTH_REST, TAU_VTH, DELTA_VTH,\t \/\/ tau (ms)\n 250, NOISE_AMP*( 1.0\/TAU_EXC ) * ( ( TAU_INH * (V_REST-V_INH) + TAU_INHB * (V_REST-V_INHB) ) \/ (V_EXC-V_REST) ),\n 250, NOISE_AMP*1.0,\n 250, NOISE_AMP*1.0 \/\/ noise (G)\n};\n\nV1::V1(const char* name, HyPerCol * hc)\n : HyPerLayer(name, hc)\n{\n initialize(TypeV1Simple);\n}\n\nV1::V1(const char* name, HyPerCol * hc, PVLayerType type)\n : HyPerLayer(name, hc)\n{\n initialize(type);\n}\n\nint V1::initialize(PVLayerType type)\n{\n float time = 0.0f;\n\n setParams(parent->parameters(), &V1DefaultParams);\n\n pvlayer_setFuncs(clayer, (INIT_FN) &LIF2_init, (UPDATE_FN) &LIF2_update_exact_linear);\n this->clayer->layerType = type;\n\n parent->addLayer(this);\n\n if (parent->parameters()->value(name, \"restart\", 0) != 0) {\n readState(name, &time);\n }\n\n return 0;\n}\n\nint V1::setParams(PVParams * params, V1Params * p)\n{\n float dt = .001 * parent->getDeltaTime(); \/\/ seconds\n\n clayer->params = (float *) malloc(sizeof(*p));\n assert(clayer->params != NULL);\n memcpy(clayer->params, p, sizeof(*p));\n\n clayer->numParams = sizeof(*p) \/ sizeof(float);\n assert(clayer->numParams == 17);\n\n V1Params * cp = (V1Params *) clayer->params;\n\n if (params->present(name, \"Vrest\")) cp->Vrest = params->value(name, \"Vrest\");\n if (params->present(name, \"Vexc\")) cp->Vexc = params->value(name, \"Vexc\");\n if (params->present(name, \"Vinh\")) cp->Vinh = params->value(name, \"Vinh\");\n if (params->present(name, \"VinhB\")) cp->VinhB = params->value(name, \"VinhB\");\n\n if (params->present(name, \"tau\")) cp->tau = params->value(name, \"tau\");\n if (params->present(name, \"tauE\")) cp->tauE = params->value(name, \"tauE\");\n if (params->present(name, \"tauI\")) cp->tauI = params->value(name, \"tauI\");\n if (params->present(name, \"tauIB\")) cp->tauIB = params->value(name, \"tauIB\");\n\n if (params->present(name, \"VthRest\")) cp->VthRest = params->value(name, \"VthRest\");\n if (params->present(name, \"tauVth\")) cp->tauVth = params->value(name, \"tauVth\");\n if (params->present(name, \"deltaVth\")) cp->deltaVth = params->value(name, \"deltaVth\");\n\n if (params->present(name, \"noiseAmpE\")) cp->noiseAmpE = params->value(name, \"noiseAmpE\");\n if (params->present(name, \"noiseAmpI\")) cp->noiseAmpI = params->value(name, \"noiseAmpI\");\n if (params->present(name, \"noiseAmpIB\")) cp->noiseAmpIB = params->value(name, \"noiseAmpIB\");\n\n if (params->present(name, \"noiseFreqE\")) {\n cp->noiseFreqE = params->value(name, \"noiseFreqE\");\n if (dt * cp->noiseFreqE > 1.0) cp->noiseFreqE = 1.0 \/ dt;\n }\n if (params->present(name, \"noiseFreqI\")) {\n cp->noiseFreqI = params->value(name, \"noiseFreqI\");\n if (dt * cp->noiseFreqI > 1.0) cp->noiseFreqI = 1.0 \/ dt;\n }\n if (params->present(name, \"noiseFreqIB\")) {\n cp->noiseFreqIB = params->value(name, \"noiseFreqIB\");\n if (dt * cp->noiseFreqIB > 1.0) cp->noiseFreqIB = 1.0 \/ dt;\n }\n\n return 0;\n}\n\nint V1::updateState(float time, float dt)\n{\n PVParams * params = parent->parameters();\n\n pv_debug_info(\"[%d]: V1::updateState:\", clayer->columnId);\n\n int spikingFlag = (int) params->value(name, \"spikingFlag\", 1);\n\n if (spikingFlag != 0) {\n return LIF2_update_exact_linear(clayer, dt);\n }\n\n \/\/ just copy accumulation buffer to membrane potential\n \/\/ and activity buffer (nonspiking)\n\n const int nx = clayer->loc.nx;\n const int ny = clayer->loc.ny;\n const int nf = clayer->numFeatures;\n const int marginWidth = clayer->loc.nPad;\n\n pvdata_t * V = clayer->V;\n pvdata_t * phiExc = clayer->phi[PHI_EXC];\n pvdata_t * phiInh = clayer->phi[PHI_INH];\n pvdata_t * activity = clayer->activity->data;\n\n \/\/ make sure activity in border is zero\n \/\/\n for (int k = 0; k < clayer->numExtended; k++) {\n activity[k] = 0.0;\n }\n\n for (int k = 0; k < clayer->numNeurons; k++) {\n int kex = kIndexExtended(k, nx, ny, nf, marginWidth);\n V[k] = phiExc[k] - phiInh[k];\n activity[kex] = V[k];\n\n \/\/ reset accumulation buffers\n phiExc[k] = 0.0;\n phiInh[k] = 0.0;\n }\n\n return 0;\n}\n\nint V1::writeState(const char * path, float time)\n{\n HyPerLayer::writeState(path, time);\n\n#ifdef DEBUG_OUTPUT\n \/\/ print activity at center of image\n\n int sx = clayer->numFeatures;\n int sy = sx*clayer->loc.nx;\n pvdata_t * a = clayer->activity->data;\n\n int n = (int) (sy*(clayer->loc.ny\/2 - 1) + sx*(clayer->loc.nx\/2));\n for (int f = 0; f < clayer->numFeatures; f++) {\n printf(\"f = %d, a[%d] = %f\\n\", f, n, a[n]);\n n += 1;\n }\n printf(\"\\n\");\n\n n = (int) (sy*(clayer->loc.ny\/2 - 1) + sx*(clayer->loc.nx\/2));\n n -= 8;\n for (int f = 0; f < clayer->numFeatures; f++) {\n printf(\"f = %d, a[%d] = %f\\n\", f, n, a[n]);\n n += 1;\n }\n#endif\n\n return 0;\n}\n\nint V1::findPostSynaptic(int dim, int maxSize, int col,\n\/\/ input: which layer, which neuron\n\t\tHyPerLayer *lSource, float pos[],\n\n\t\t\/\/ output: how many of our neurons are connected.\n\t\t\/\/ an array with their indices.\n\t\t\/\/ an array with their feature vectors.\n\t\tint* nNeurons, int nConnectedNeurons[], float *vPos)\n{\n\treturn 0;\n}\n\n} \/\/ namespace PV\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n\n#include \"schedule.h\"\n#include \"actions.h\"\n#include \"group_cache.h\"\n#include \"display\/line_display.h\"\n\nnamespace po = boost::program_options;\n\npo::variables_map GetSettings(int argc, char **argv) {\n \/\/ Visible options\n po::options_description visibleOptions(\"Command line options\");\n visibleOptions.add_options()\n (\"help,h\", \"display help\")\n (\"renew-cache,rc\", \"renew group cache\");;\n\n \/\/ Hidden option (to specify action)\n po::options_description HiddenOptions(\"Hidden options\");\n HiddenOptions.add_options()\n (\"action\", po::value<std::string>(), \"action\");\n\n \/\/ Common options (cli + config file)\n po::options_description commonOptions(\"Command line or config file options\");\n commonOptions.add_options()\n (\"output,o\", po::value<std::string>()->default_value(\"line\"), \"display help\")\n (\"group,g\", po::value<std::string>(), \"set the group used for the request\");\n\n \/\/ Create cli options from visible and hidden options\n po::options_description cliOptions;\n cliOptions.add(commonOptions).add(visibleOptions).add(HiddenOptions);\n\n\n \/\/ Set action as a positional argument\n po::positional_options_description op;\n op.add(\"action\", -1);\n\n \/\/ Create settings map\n po::variables_map settings;\n po::store(po::command_line_parser(argc, argv).\n options(cliOptions).positional(op).run(), settings);\n po::notify(settings);\n\n \/\/ Config file parsing\n po::options_description fileOptions;\n fileOptions.add(commonOptions);\n std::string configPath;\n configPath += getenv(\"HOME\");\n configPath += \"\/.chronosrc\";\n std::ifstream ifs(configPath.c_str());\n if (ifs) {\n store(po::parse_config_file(ifs, fileOptions), settings);\n notify(settings);\n }\n\n \/\/ Display help\n if (settings.count(\"help\") || argc == 1) {\n std::cout << commonOptions;\n std::cout << visibleOptions << std::endl;\n exit(1);\n }\n return settings;\n}\n\nint main(int argc, char *argv[]) {\n\n \/\/ Get settings\n po::variables_map settings;\n try {\n settings = GetSettings(argc, argv);\n }\n catch (int e) {\n std::cout << \"Error \" << e << \": config parsing error\" << std::endl;\n exit(1);\n }\n\n \/\/ Check for mandatory settings\n if (settings.count(\"action\") != 1) {\n std::cout << \"Error: you need to specify an action\";\n }\n if (settings.count(\"group\") != 1) {\n std::cout << \"Error: you need to specify a group in your config file or as an argument\";\n }\n\n \/\/ Check if need to renew cache\n if (settings.count(\"renew-cache\")) {\n GroupCache::RenewCache();\n }\n\n std::vector<Group> groupsList = GroupCache::GetGroupeCache();\n\n \/\/ Get action and call the correct function\n Actions::ScheduleActions action = Actions::GetAction(settings[\"action\"].as<std::string>());\n Group g = GroupCache::GetGroupeName(settings[\"group\"].as<std::string>(), groupsList);\n std::vector<Event> schedule;\n if (action == Actions::ScheduleActions::Today) {\n schedule = Schedule::GetToday(g);\n }\n else if (action == Actions::ScheduleActions::Week)\n {\n schedule = Schedule::GetCurrentWeek(g);\n }\n else if (action == Actions::ScheduleActions::Next)\n {\n schedule = Schedule::GetNext(g);\n }\n\n \/\/ Print according to the given printer\n Display::OutputSystems outputSystem = Display::GetOutput(settings[\"output\"].as<std::string>());\n if (outputSystem == Display::OutputSystems::Line)\n {\n LineDisplay::Print(schedule);\n }\n \/*else if (outputSystem == Display::OutputSystems::Ascii)\n {\n AsciiDisplay::Print(schedule);\n }*\/\n return 0;\n}<commit_msg>Better errors messages when catching config parsing errors<commit_after>#include <iostream>\n#include <fstream>\n#include <boost\/program_options.hpp>\n\n#include \"schedule.h\"\n#include \"actions.h\"\n#include \"group_cache.h\"\n#include \"display\/line_display.h\"\n\nnamespace po = boost::program_options;\n\npo::variables_map GetSettings(int argc, char **argv) {\n \/\/ Visible options\n po::options_description visibleOptions(\"Command line options\");\n visibleOptions.add_options()\n (\"help,h\", \"display help\")\n (\"renew-cache,rc\", \"renew group cache\");;\n\n \/\/ Hidden option (to specify action)\n po::options_description HiddenOptions(\"Hidden options\");\n HiddenOptions.add_options()\n (\"action\", po::value<std::string>(), \"action\");\n\n \/\/ Common options (cli + config file)\n po::options_description commonOptions(\"Command line or config file options\");\n commonOptions.add_options()\n (\"output,o\", po::value<std::string>()->default_value(\"line\"), \"display help\")\n (\"group,g\", po::value<std::string>(), \"set the group used for the request\");\n\n \/\/ Create cli options from visible and hidden options\n po::options_description cliOptions;\n cliOptions.add(commonOptions).add(visibleOptions).add(HiddenOptions);\n\n\n \/\/ Set action as a positional argument\n po::positional_options_description op;\n op.add(\"action\", -1);\n\n \/\/ Create settings map\n po::variables_map settings;\n po::store(po::command_line_parser(argc, argv).\n options(cliOptions).positional(op).run(), settings);\n po::notify(settings);\n\n \/\/ Config file parsing\n po::options_description fileOptions;\n fileOptions.add(commonOptions);\n std::string configPath;\n configPath += getenv(\"HOME\");\n configPath += \"\/.chronosrc\";\n std::ifstream ifs(configPath.c_str());\n if (ifs) {\n store(po::parse_config_file(ifs, fileOptions), settings);\n notify(settings);\n }\n\n \/\/ Display help\n if (settings.count(\"help\") || argc == 1) {\n std::cout << commonOptions;\n std::cout << visibleOptions << std::endl;\n exit(1);\n }\n return settings;\n}\n\nint main(int argc, char *argv[]) {\n\n \/\/ Get settings\n po::variables_map settings;\n try {\n settings = GetSettings(argc, argv);\n }\n catch (po::error& e) {\n std::cout << e.what() << std::endl;\n exit(1);\n }\n\n \/\/ Check for mandatory settings\n if (settings.count(\"action\") != 1) {\n std::cout << \"Error: you need to specify an action\";\n }\n if (settings.count(\"group\") != 1) {\n std::cout << \"Error: you need to specify a group in your config file or as an argument\";\n }\n\n \/\/ Check if need to renew cache\n if (settings.count(\"renew-cache\")) {\n GroupCache::RenewCache();\n }\n\n std::vector<Group> groupsList = GroupCache::GetGroupeCache();\n\n \/\/ Get action and call the correct function\n Actions::ScheduleActions action = Actions::GetAction(settings[\"action\"].as<std::string>());\n Group g = GroupCache::GetGroupeName(settings[\"group\"].as<std::string>(), groupsList);\n std::vector<Event> schedule;\n if (action == Actions::ScheduleActions::Today) {\n schedule = Schedule::GetToday(g);\n }\n else if (action == Actions::ScheduleActions::Week)\n {\n schedule = Schedule::GetCurrentWeek(g);\n }\n else if (action == Actions::ScheduleActions::Next)\n {\n schedule = Schedule::GetNext(g);\n }\n\n \/\/ Print according to the given printer\n Display::OutputSystems outputSystem = Display::GetOutput(settings[\"output\"].as<std::string>());\n if (outputSystem == Display::OutputSystems::Line)\n {\n LineDisplay::Print(schedule);\n }\n \/*else if (outputSystem == Display::OutputSystems::Ascii)\n {\n AsciiDisplay::Print(schedule);\n }*\/\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"ten\/task\/qutex.hh\"\n#include \"proc.hh\"\n\nnamespace ten {\n\nvoid qutex::lock() {\n task *t = this_proc()->ctask;\n DCHECK(t) << \"BUG: qutex::lock called outside of task\";\n {\n std::unique_lock<std::timed_mutex> lk{_m};\n DCHECK(_owner != t) << \"no recursive locking\";\n if (_owner == nullptr) {\n _owner = t;\n DVLOG(5) << \"LOCK qutex: \" << this << \" owner: \" << _owner;\n return;\n }\n DVLOG(5) << \"QUTEX[\" << this << \"] lock waiting add: \" << t << \" owner: \" << _owner;\n _waiting.push_back(t);\n }\n\n \/\/ loop to handle spurious wakeups from other threads\n for (;;) {\n DCHECK(t->cancel_points == 0) << \"BUG: cannot cancel a lock\";\n t->swap();\n std::unique_lock<std::timed_mutex> lk{_m};\n if (_owner == this_proc()->ctask) {\n break;\n }\n }\n}\n\nbool qutex::try_lock() {\n task *t = this_proc()->ctask;\n DCHECK(t) << \"BUG: qutex::try_lock called outside of task\";\n std::unique_lock<std::timed_mutex> lk{_m, std::try_to_lock};\n if (lk.owns_lock()) {\n if (_owner == nullptr) {\n _owner = t;\n return true;\n }\n }\n return false;\n}\n\nvoid qutex::unlock() {\n std::unique_lock<std::timed_mutex> lk{_m};\n task *t = this_proc()->ctask;\n DCHECK(lk.owns_lock()) << \"BUG: lock not owned \" << t;\n DVLOG(5) << \"QUTEX[\" << this << \"] unlock: \" << t;\n DCHECK(t == _owner) << \"BUG: lock not owned by this task\";\n if (!_waiting.empty()) {\n t = _owner = _waiting.front();\n _waiting.pop_front();\n } else {\n t = _owner = nullptr;\n }\n DVLOG(5) << \"UNLOCK qutex: \" << this\n << \" new owner: \" << _owner\n << \" waiting: \" << _waiting.size();\n lk.unlock();\n \/\/ must use t here, not owner because\n \/\/ lock has been released\n if (t) t->ready();\n}\n\n} \/\/ namespace\n<commit_msg>more debug checks<commit_after>#include \"ten\/task\/qutex.hh\"\n#include \"proc.hh\"\n\nnamespace ten {\n\nvoid qutex::lock() {\n task *t = this_proc()->ctask;\n DCHECK(t->cancel_points == 0) << \"BUG: cannot cancel a lock\";\n DCHECK(t) << \"BUG: qutex::lock called outside of task\";\n {\n std::unique_lock<std::timed_mutex> lk{_m};\n DCHECK(_owner != t) << \"no recursive locking\";\n if (_owner == nullptr) {\n _owner = t;\n DVLOG(5) << \"LOCK qutex: \" << this << \" owner: \" << _owner;\n return;\n }\n DVLOG(5) << \"QUTEX[\" << this << \"] lock waiting add: \" << t << \" owner: \" << _owner;\n _waiting.push_back(t);\n }\n\n \/\/ loop to handle spurious wakeups from other threads\n for (;;) {\n DCHECK(t->cancel_points == 0) << \"BUG: cannot cancel a lock\";\n t->swap();\n std::unique_lock<std::timed_mutex> lk{_m};\n if (_owner == this_proc()->ctask) {\n break;\n }\n }\n}\n\nbool qutex::try_lock() {\n task *t = this_proc()->ctask;\n DCHECK(t) << \"BUG: qutex::try_lock called outside of task\";\n std::unique_lock<std::timed_mutex> lk{_m, std::try_to_lock};\n if (lk.owns_lock()) {\n if (_owner == nullptr) {\n _owner = t;\n return true;\n }\n }\n return false;\n}\n\nvoid qutex::unlock() {\n std::unique_lock<std::timed_mutex> lk{_m};\n task *t = this_proc()->ctask;\n DCHECK(lk.owns_lock()) << \"BUG: lock not owned \" << t;\n DVLOG(5) << \"QUTEX[\" << this << \"] unlock: \" << t;\n DCHECK(t == _owner) << \"BUG: lock not owned by this task\";\n if (!_waiting.empty()) {\n t = _owner = _waiting.front();\n _waiting.pop_front();\n } else {\n t = _owner = nullptr;\n }\n DVLOG(5) << \"UNLOCK qutex: \" << this\n << \" new owner: \" << _owner\n << \" waiting: \" << _waiting.size();\n lk.unlock();\n \/\/ must use t here, not owner because\n \/\/ lock has been released\n if (t) t->ready();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/===--------------------- LLDBAssert.cpp ------------------------*- C++-*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Utility\/LLDBAssert.h\"\n\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace llvm;\nusing namespace lldb_private;\n\nvoid lldb_private::lldb_assert(bool expression, const char *expr_text,\n const char *func, const char *file,\n unsigned int line) {\n if (expression)\n ;\n else {\n errs() << format(\"Assertion failed: (%s), function %s, file %s, line %u\\n\",\n expr_text, func, file, line);\n errs() << \"backtrace leading to the failure:\\n\";\n llvm::sys::PrintStackTrace(errs());\n errs() << \"please file a bug report against lldb reporting this failure \"\n \"log, and as many details as possible\\n\";\n }\n}\n<commit_msg>Terminate debugger if an assert was hit<commit_after>\/\/===--------------------- LLDBAssert.cpp ------------------------*- C++-*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"lldb\/Utility\/LLDBAssert.h\"\n\n#include \"llvm\/Support\/Format.h\"\n#include \"llvm\/Support\/Signals.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\nusing namespace llvm;\nusing namespace lldb_private;\n\nvoid lldb_private::lldb_assert(bool expression, const char *expr_text,\n const char *func, const char *file,\n unsigned int line) {\n if (LLVM_LIKELY(expression))\n return;\n\n errs() << format(\"Assertion failed: (%s), function %s, file %s, line %u\\n\",\n expr_text, func, file, line);\n errs() << \"backtrace leading to the failure:\\n\";\n llvm::sys::PrintStackTrace(errs());\n errs() << \"please file a bug report against lldb reporting this failure \"\n \"log, and as many details as possible\\n\";\n abort();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*!\n \\file launcher.cpp\n \\brief Launcher base implementation\n \\author Ivan Shynkarenka\n \\date 07.07.2015\n \\copyright MIT License\n*\/\n\n#include \"benchmark\/launcher.h\"\n\n#include <algorithm>\n#include <regex>\n\nnamespace CppBenchmark {\n\nvoid Launcher::Launch(const std::string& pattern)\n{\n int current = 0;\n int total = 0;\n std::vector<std::shared_ptr<BenchmarkBase>> benchmarks;\n\n \/\/ Build pending benchmark\n for (auto& builder : _builders)\n AddBenchmark(builder());\n\n \/\/ Filter benchmarks\n std::regex matcher(pattern);\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Match benchmark name with the given pattern\n if (pattern.empty() || std::regex_match(benchmark->name(), matcher))\n {\n total += benchmark->CountLaunches();\n benchmarks.push_back(benchmark);\n }\n }\n\n \/\/ Launch filtered benchmarks\n for (auto& benchmark : benchmarks)\n benchmark->Launch(current, total, *this);\n}\n\nvoid Launcher::Report(Reporter& reporter) const\n{\n \/\/ Report header, system & environment\n reporter.ReportHeader();\n reporter.ReportSystem();\n reporter.ReportEnvironment();\n reporter.ReportBenchmarksHeader();\n\n \/\/ For all registered benchmarks...\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Filter performed benchmarks\n if (benchmark->_launched)\n {\n \/\/ Report benchmark results\n reporter.ReportBenchmarkHeader();\n reporter.ReportBenchmark(*benchmark, benchmark->settings());\n reporter.ReportPhasesHeader();\n for (auto& root_phase : benchmark->_phases)\n ReportPhase(reporter, *root_phase, root_phase->name());\n reporter.ReportPhasesFooter();\n reporter.ReportBenchmarkFooter();\n }\n }\n\n \/\/ Report footer\n reporter.ReportBenchmarksFooter();\n reporter.ReportFooter();\n}\n\nvoid Launcher::ReportPhase(Reporter& reporter, const PhaseCore& phase, const std::string& name) const\n{\n reporter.ReportPhaseHeader();\n reporter.ReportPhase(phase, phase.metrics());\n reporter.ReportPhaseFooter();\n for (auto& child : phase._child)\n {\n std::string child_name = name + \".\" + child->name();\n ReportPhase(reporter, *child, child_name);\n }\n}\n\nvoid Launcher::ReportHistograms(int32_t resolution) const\n{\n \/\/ For all registered benchmarks...\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Filter performed benchmarks\n if (benchmark->_launched)\n {\n \/\/ Report benchmark histograms\n for (auto& root_phase : benchmark->_phases)\n ReportPhaseHistograms(resolution, *root_phase, root_phase->name());\n }\n }\n}\n\nvoid Launcher::ReportPhaseHistograms(int32_t resolution, const PhaseCore& phase, const std::string& name) const\n{\n ReportPhaseHistogram(resolution, phase, name);\n for (auto& child : phase._child)\n {\n std::string child_name = name + \".\" + child->name();\n ReportPhaseHistograms(resolution, *child, child_name);\n }\n}\n\nvoid Launcher::ReportPhaseHistogram(int32_t resolution, const PhaseCore& phase, const std::string& name) const\n{\n if (phase.metrics().latency())\n {\n const char deprecated[] = \"\\\\\/?%*:|\\\"<>\";\n\n \/\/ Validate filename\n std::string filename(name + \".hdr\");\n for (auto& ch : filename)\n if ((ch != '\\\\') && (ch != '\/') && (std::find(deprecated, deprecated + sizeof(deprecated), ch) != (deprecated + sizeof(deprecated))))\n ch = '_';\n\n \/\/ Open histogram filename\n FILE* file = fopen(filename.c_str(), \"w\");\n if (file != nullptr)\n {\n \/\/ Print histogram\n phase.PrintLatencyHistogram(file, resolution);\n\n \/\/ Close file\n fclose(file);\n }\n }\n}\n\n} \/\/ namespace CppBenchmark\n<commit_msg>bugfixes<commit_after>\/*!\n \\file launcher.cpp\n \\brief Launcher base implementation\n \\author Ivan Shynkarenka\n \\date 07.07.2015\n \\copyright MIT License\n*\/\n\n#include \"benchmark\/launcher.h\"\n\n#include <algorithm>\n#include <regex>\n\nnamespace CppBenchmark {\n\nvoid Launcher::Launch(const std::string& pattern)\n{\n int current = 0;\n int total = 0;\n std::vector<std::shared_ptr<BenchmarkBase>> benchmarks;\n\n \/\/ Build pending benchmark\n for (auto& builder : _builders)\n if (builder)\n AddBenchmark(builder());\n\n \/\/ Filter benchmarks\n std::regex matcher(pattern);\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Match benchmark name with the given pattern\n if (pattern.empty() || std::regex_match(benchmark->name(), matcher))\n {\n total += benchmark->CountLaunches();\n benchmarks.push_back(benchmark);\n }\n }\n\n \/\/ Launch filtered benchmarks\n for (auto& benchmark : benchmarks)\n benchmark->Launch(current, total, *this);\n}\n\nvoid Launcher::Report(Reporter& reporter) const\n{\n \/\/ Report header, system & environment\n reporter.ReportHeader();\n reporter.ReportSystem();\n reporter.ReportEnvironment();\n reporter.ReportBenchmarksHeader();\n\n \/\/ For all registered benchmarks...\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Filter performed benchmarks\n if (benchmark->_launched)\n {\n \/\/ Report benchmark results\n reporter.ReportBenchmarkHeader();\n reporter.ReportBenchmark(*benchmark, benchmark->settings());\n reporter.ReportPhasesHeader();\n for (auto& root_phase : benchmark->_phases)\n ReportPhase(reporter, *root_phase, root_phase->name());\n reporter.ReportPhasesFooter();\n reporter.ReportBenchmarkFooter();\n }\n }\n\n \/\/ Report footer\n reporter.ReportBenchmarksFooter();\n reporter.ReportFooter();\n}\n\nvoid Launcher::ReportPhase(Reporter& reporter, const PhaseCore& phase, const std::string& name) const\n{\n reporter.ReportPhaseHeader();\n reporter.ReportPhase(phase, phase.metrics());\n reporter.ReportPhaseFooter();\n for (auto& child : phase._child)\n {\n std::string child_name = name + \".\" + child->name();\n ReportPhase(reporter, *child, child_name);\n }\n}\n\nvoid Launcher::ReportHistograms(int32_t resolution) const\n{\n \/\/ For all registered benchmarks...\n for (auto& benchmark : _benchmarks)\n {\n \/\/ Filter performed benchmarks\n if (benchmark->_launched)\n {\n \/\/ Report benchmark histograms\n for (auto& root_phase : benchmark->_phases)\n ReportPhaseHistograms(resolution, *root_phase, root_phase->name());\n }\n }\n}\n\nvoid Launcher::ReportPhaseHistograms(int32_t resolution, const PhaseCore& phase, const std::string& name) const\n{\n ReportPhaseHistogram(resolution, phase, name);\n for (auto& child : phase._child)\n {\n std::string child_name = name + \".\" + child->name();\n ReportPhaseHistograms(resolution, *child, child_name);\n }\n}\n\nvoid Launcher::ReportPhaseHistogram(int32_t resolution, const PhaseCore& phase, const std::string& name) const\n{\n if (phase.metrics().latency())\n {\n const char deprecated[] = \"\\\\\/?%*:|\\\"<>\";\n\n \/\/ Validate filename\n std::string filename(name + \".hdr\");\n for (auto& ch : filename)\n if ((ch != '\\\\') && (ch != '\/') && (std::find(deprecated, deprecated + sizeof(deprecated), ch) != (deprecated + sizeof(deprecated))))\n ch = '_';\n\n \/\/ Open histogram filename\n FILE* file = fopen(filename.c_str(), \"w\");\n if (file != nullptr)\n {\n \/\/ Print histogram\n phase.PrintLatencyHistogram(file, resolution);\n\n \/\/ Close file\n fclose(file);\n }\n }\n}\n\n} \/\/ namespace CppBenchmark\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include <windows.h>\n#include \"pwdPopUp.h\"\n\n_PWDHANDLES pwdHandles;\n_PWDAXIS pwdBtns[2];\n_PWDAXIS pwdEditInputField[1];\n_PWDCOORDINATES pwdCoordinates;\nTCHAR windowTitle[MAXCHAR] = L\"\";\nTCHAR drawTextMessage[MAXCHAR] = L\"\";\nTCHAR passwordValue[MAXCHAR] = L\"\";\nbool isExitPasswordNeedToBeDone = false;\nbool isEnteredPasswordCorrect = false;\nbool isWMDevice = false;\n\nBOOL IsDeviceInLandScape(){\n DEVMODE devmode;\n ZeroMemory(&devmode, sizeof(DEVMODE));\n devmode.dmSize = sizeof(DEVMODE);\n devmode.dmDisplayOrientation = DMDO_0;\n devmode.dmFields = DM_DISPLAYORIENTATION;\n ChangeDisplaySettingsEx(NULL, &devmode, NULL, CDS_TEST, NULL);\n\n return ((devmode.dmDisplayOrientation == DMDO_90) || (devmode.dmDisplayOrientation == DMDO_270));\n}\nBOOL IsDeviceInPortrait(){\n DEVMODE devmode;\n ZeroMemory(&devmode, sizeof(DEVMODE));\n devmode.dmSize = sizeof(DEVMODE);\n devmode.dmDisplayOrientation = DMDO_0;\n devmode.dmFields = DM_DISPLAYORIENTATION;\n ChangeDisplaySettingsEx(NULL, &devmode, NULL, CDS_TEST, NULL);\n\n return ((devmode.dmDisplayOrientation == DMDO_0) || (devmode.dmDisplayOrientation == DMDO_180));\n}\n\nATOM PwdMyRegisterClass(HINSTANCE hInstance){\n\tWNDCLASS wcx; \/\/ WINDOW class information\n\tif (!GetClassInfo(hInstance, L\"CheckPassword\", &wcx))\n\t{\n\t\t\/\/Initialize the struct to zero\n\t\tZeroMemory(&wcx,sizeof(WNDCLASS));\n\t\twcx.style = 0; \/\/CS_HREDRAW|CS_VREDRAW |CS_DBLCLKS ; \/\/ Class styles\n\t\twcx.lpfnWndProc = (WNDPROC)PwdMainWndProc; \/\/ Pointer to the callback procedure\n\t\twcx.cbClsExtra = 0; \/\/ Extra byte to allocate following the wndclassex structure\n\t\twcx.cbWndExtra = 0; \/\/ Extra byte to allocate following an instance of the structure\n\t\twcx.hInstance = hInstance; \/\/ Instance of the application\n\t\twcx.hIcon = NULL; \/\/ Class Icon\n\t\twcx.hCursor = 0; \/\/LoadCursor(NULL, IDC_ARROW); \/\/ Class Cursor\n\t\twcx.hbrBackground = (HBRUSH) GetStockObject(WHITE_BRUSH); \/\/ Background brush\n\t\twcx.lpszMenuName = NULL; \/\/ Menu resource\n\t\twcx.lpszClassName = L\"CheckPassword\"; \/\/ Name of this class\n\t\twcx.hIcon = NULL; \/\/ Small icon for this class\n\t\treturn RegisterClass(&wcx);\t\n\t}\n\treturn TRUE;\n}\n\nBOOL PwdInitInstance(HWND hWnd, HINSTANCE hInstance){\t\n\t\n\t\/\/ Create the window\n\tpwdHandles.parent = CreateWindow(L\"CheckPassword\", \/\/ Window class name\n\t\t\twindowTitle, \/\/ Window title\n\t\t\tWS_POPUP | WS_CAPTION, \/\/ Window style\n\t\t\t(pwdCoordinates.xCenter-pwdCoordinates.mainWndXpos\/2),(pwdCoordinates.yCenter-pwdCoordinates.mainWndYpos\/2),\/\/1200,730, \/\/ (x,y) pos of the window\n\t\t\tpwdCoordinates.mainWndXpos,pwdCoordinates.mainWndYpos + 30, \/\/ Width and height of the window\n\t\t\thWnd,\/\/HWND_DESKTOP, \/\/ HWND of the parent window (can be null also)\n\t\t\tNULL, \/\/ Handle to menu\n\t\t\tpwdHandles.hInstance, \/\/ Handle to application instance\n\t\t\tNULL); \/\/ Pointer to window creation data\n\n\t\/\/ Check if window creation was successful\n\tif (!pwdHandles.parent)\n\t\treturn 0;\n\n\t\/\/ Make the window visible\n\tShowWindow(pwdHandles.parent,SW_SHOW);\n\tUpdateWindow(pwdHandles.parent);\n\n\treturn TRUE;\n}\n\n\nVOID PwdCreateButtons(HWND hwnd){\n\tpwdHandles.parent = hwnd;\n\tHWND *buttons = &(pwdHandles.okButton);\n\tfor(int i = 0; i < 2; i++){\n\t\t*buttons = CreateWindowEx(WS_EX_CLIENTEDGE,\n\t\t\t\t\t\t\t\t L\"button\", pwdBtns[i].buttonName,\n\t\t\t\t\t\t\t\t WS_VISIBLE | WS_CHILD | WS_TABSTOP, \n\t\t\t\t\t\t\t\t pwdBtns[i].x, pwdBtns[i].y,\n\t\t\t\t\t\t\t\t pwdBtns[i].width,pwdBtns[i].height,\n\t\t\t\t\t\t\t\t hwnd, \n\t\t\t\t\t\t\t\t (HMENU) (PWD_INITIAL_BUTTON+i),\n\t\t\t\t\t\t\t\t pwdHandles.hInstance, NULL) ;\t\n\n\t\tbuttons++;\n\t}\n}\n\nVOID PwdCreateInputFieldWindow(HWND hwnd){\n\tpwdHandles.parent = hwnd;\n\tHWND *editInputFieldWindow = &(pwdHandles.inputField);\t\n\t*editInputFieldWindow = CreateWindowEx(WS_EX_CLIENTEDGE,\n\t\t\t\t\t\tL\"edit\", L\"\",\n\t\t\t\t\t\tWS_VISIBLE | WS_CHILD | WS_TABSTOP | ES_AUTOHSCROLL | ES_PASSWORD, \n\t\t\t\t\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].x, pwdEditInputField[PWD_AXIS_INPUTFIELD].y,\n\t\t\t\t\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].width,pwdEditInputField[PWD_AXIS_INPUTFIELD].height, \n\t\t\t\t\t\thwnd, \n\t\t\t\t\t\tNULL, \n\t\t\t\t\t\tpwdHandles.hInstance, NULL);\t\n}\n\nVOID PwdDrawTextOnSubTitleArea(HWND bgHandle, LPCWSTR message, int x, int y)\n{\n\tRECT rect;\n\tHDC wdc = GetWindowDC(bgHandle);\n\tGetClientRect (bgHandle, &rect) ;\n\tSetTextColor(wdc, 0x00000000);\n\tSetBkMode(wdc,TRANSPARENT);\n\trect.left = x;\n\trect.top = y;\n\tDrawText( wdc, message, -1, &rect, DT_NOCLIP | DT_WORDBREAK | DT_NOPREFIX ) ;\n\tDeleteDC(wdc);\t\n}\n\nLRESULT CALLBACK PwdMainWndProc(HWND hwnd,UINT msg,WPARAM wParam,LPARAM lParam)\n {\n\tswitch (msg)\n\t{\n\t\tcase WM_CREATE:\t\t\n\t\t\tPwdCreateButtons(hwnd);\t\n\t\t\tPwdCreateInputFieldWindow(hwnd);\n\t\t break;\n\t\t\n\t\tcase WM_ACTIVATE:\n\t\t\t\/\/ShowWindow(pwdHandles.mainParentWnd,SW_SHOW);\n\t\t\tbreak;\n\n\t\tcase WM_PAINT:\n\t\t\tPAINTSTRUCT ps;\n\t\t\tHDC hdc;\n\t\t\thdc = BeginPaint(hwnd, &ps);\t\n\t\t\tDeleteDC (hdc);\n\t\t\tEndPaint(hwnd, &ps);\n\t\t\tif(isWMDevice){\n\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, drawTextMessage, 20, 50);\n\t\t\t}else{\n\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, drawTextMessage, 20, 25);\n\t\t\t}\n\t\t\tbreak;\t\n\n\t\tcase WM_COMMAND:\t\t\n\t\t\tTCHAR enteredPassWord[MAXCHAR];\n\t\t\tswitch (LOWORD(wParam))\n\t\t\t{\n\t\t\t\tcase VK_RETURN:\n\t\t\t\tcase PWD_IDB_BTN_OK:\n\t\t\t\t\t{\n\t\t\t\t\t\tSendMessage(pwdHandles.inputField,WM_GETTEXT,MAXCHAR,(LPARAM)(enteredPassWord));\n\t\t\t\t\t\tif(isExitPasswordNeedToBeDone){\n\t\t\t\t\t\t\tif(_tcscmp(passwordValue,enteredPassWord) == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tisEnteredPasswordCorrect = true;\n\t\t\t\t\t\t\t\tDestroyWindow(pwdHandles.parent);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, L\"InValid Password\", 20, pwdCoordinates.mainWndYpos);\n\t\t\t\t\t\t\t\tSendMessage(pwdHandles.inputField,WM_SETTEXT,MAXCHAR,(LPARAM)L\"\");\n\t\t\t\t\t\t\t\tisEnteredPasswordCorrect = false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/Currently Do Nothing\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\t\t\n\t\t\t\tcase PWD_IDB_BTN_CANCEL:\n\t\t\t\t\t{\n\t\t\t\t\t\tisEnteredPasswordCorrect = false;\n\t\t\t\t\t\tPostMessage(pwdHandles.parent , WM_KEYDOWN, VK_ESCAPE, 0);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\t\t\t\n\n\t\tcase WM_DESTROY:\t\t\t\n\t\t\tEnableWindow(pwdHandles.mainParentWnd, TRUE);\n\t\t\tSetForegroundWindow(pwdHandles.mainParentWnd);\n\t\t\tDestroyWindow(hwnd);\n\t\t\tPostQuitMessage(0);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hwnd,msg,wParam,lParam);\/\/ Call the default window handler\n\t}\n\treturn 0;\n } \nVOID PwdInitialiseCoordinates()\n{\t\n\tbool isCheckCoordinatesDifferent = false;\n\tpwdCoordinates.width = GetSystemMetrics(SM_CXVIRTUALSCREEN);\n\tpwdCoordinates.height = GetSystemMetrics(SM_CYVIRTUALSCREEN);\n\tif(pwdCoordinates.width <480 && isWMDevice){\n\t\tisCheckCoordinatesDifferent = true;\n\t\tpwdCoordinates.width = 380;\n\t}\n\tif(pwdCoordinates.height <480 && isWMDevice){\n\t\tisCheckCoordinatesDifferent = true;\n\t\tpwdCoordinates.height = 440;\n\t}\n\tpwdCoordinates.xCenter = (pwdCoordinates.width\/2);\n\tif(pwdCoordinates.height <480 && isWMDevice)\n\t{\n\t\tpwdCoordinates.yCenter = (pwdCoordinates.height\/2) - 50;\n\t}\n\telse\n\t{\n\t\tpwdCoordinates.yCenter = (pwdCoordinates.height\/2);\n\t}\n\tif(IsDeviceInPortrait())\n\t{\n\t\tpwdCoordinates.mainWndXpos = (pwdCoordinates.width * 8)\/10;\n\t\tpwdCoordinates.mainWndYpos = (pwdCoordinates.height * 3)\/10;\t\n\t}\n\telse if(isCheckCoordinatesDifferent && isWMDevice)\n\t{\n\t\tpwdCoordinates.mainWndXpos = (pwdCoordinates.width * 8)\/10;\n\t\tpwdCoordinates.mainWndYpos = (pwdCoordinates.height * 3)\/10;\t\n\t}\n\telse\n\t{\n\t\tpwdCoordinates.mainWndXpos = ((pwdCoordinates.width * 8)\/10) - 80;\n\t\tpwdCoordinates.mainWndYpos = ((pwdCoordinates.height * 3)\/10) + 20;\n\t}\n\n\t\/\/Edit Input Field \n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].x = 20;\n\tif(isWMDevice){\n\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].y = 40;\n\t}\n\telse{\n\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].y = 20;\n\t}\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].width = (pwdCoordinates.mainWndXpos * 8)\/10;\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].buttonName = L\"\";\t\n\n\t\/\/Ok Button\n\tpwdBtns[PWD_AXIS_OK].x = 20;\n\tif(isWMDevice){\n\t\tpwdBtns[PWD_AXIS_OK].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 50;\n\t}\n\telse{\n\t\tpwdBtns[PWD_AXIS_OK].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 30;\n\t}\n\tpwdBtns[PWD_AXIS_OK].width = (pwdCoordinates.mainWndXpos * 3)\/10;\n\tpwdBtns[PWD_AXIS_OK].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdBtns[PWD_AXIS_OK].buttonName = L\"OK\";\n\n\t\/\/Cancel Button\n\tpwdBtns[PWD_AXIS_CANCEL].x = ((pwdCoordinates.mainWndXpos * 3)\/10) + 20 + 35;\n\tif(isWMDevice){\n\t\tpwdBtns[PWD_AXIS_CANCEL].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 50;\n\t}\n\telse{\n\t\tpwdBtns[PWD_AXIS_CANCEL].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 30;\n\t}\n\tpwdBtns[PWD_AXIS_CANCEL].width= (pwdCoordinates.mainWndXpos * 3)\/10;\n\tpwdBtns[PWD_AXIS_CANCEL].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdBtns[PWD_AXIS_CANCEL].buttonName = L\"CANCEL\";\n}\n\nbool ShowPasswordDialog(bool setDeviceType, bool isExiting, HWND hWnd, HINSTANCE hInstance, LPCTSTR szWindowTitle, LPCTSTR szDrawTextMessage, LPCTSTR szPasswordValue)\n{\n\tisExitPasswordNeedToBeDone = isExiting;\n\n\t\/\/Window Title\n\tmemset(windowTitle, 0,sizeof(windowTitle));\n\t_tcscpy(windowTitle,szWindowTitle);\n\n\t\/\/DrawTextMessage\n\tmemset(drawTextMessage, 0,sizeof(drawTextMessage));\n\t_tcscpy(drawTextMessage,szDrawTextMessage);\n\n\t\/\/Password Value\n\tmemset(passwordValue, 0,sizeof(passwordValue));\n\t_tcscpy(passwordValue,szPasswordValue);\n\n\tisWMDevice = setDeviceType;\n\tpwdHandles.mainParentWnd = hWnd;\n\tpwdHandles.hInstance = hInstance;\n\tPwdInitialiseCoordinates();\n\n\tMSG msg; \/\/ MSG structure to store messages\t\n\n\t\/\/ Register Window Class\n\tif (!PwdMyRegisterClass(hInstance))\n\t{\n\t\tisEnteredPasswordCorrect = false;\n\t\treturn isEnteredPasswordCorrect;\n\t}\n\n\t\/\/ Perform application initialization:\n\tif (!PwdInitInstance (hWnd,hInstance))\n\t{\n\t\tisEnteredPasswordCorrect = false;\n\t\treturn isEnteredPasswordCorrect;\n\t}\n\n\t\/\/ Main message loop: Process messages coming to this window\n\twhile (GetMessage(&msg,NULL,0,0))\n\t{\n\t\tif (msg.message == WM_KEYDOWN) \n\t\t{\n\t\t\t\/\/if pressed Enter button\n\t\t\tif (msg.wParam == VK_RETURN)\n {\n\t\t\t\tPostMessage(pwdHandles.parent , WM_COMMAND, VK_RETURN, 0);\n\t\t\t}\n\t\t\t\/\/if pressed Cancel button\n\t\t\tif (msg.wParam == VK_ESCAPE)\n {\n\t\t\t\tSendMessage(pwdHandles.parent , WM_DESTROY, 0, 0);\n isEnteredPasswordCorrect = false;\n }\n\t\t}\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n\treturn isEnteredPasswordCorrect;\n}\n<commit_msg>Update pwdPopUp.cpp<commit_after>#include \"stdafx.h\"\n#include <windows.h>\n#include \"pwdPopUp.h\"\n\n_PWDHANDLES pwdHandles;\n_PWDAXIS pwdBtns[2];\n_PWDAXIS pwdEditInputField[1];\n_PWDCOORDINATES pwdCoordinates;\nTCHAR windowTitle[MAXCHAR] = L\"\";\nTCHAR drawTextMessage[MAXCHAR] = L\"\";\nTCHAR passwordValue[MAXCHAR] = L\"\";\nbool isExitPasswordNeedToBeDone = false;\nbool isEnteredPasswordCorrect = false;\nbool isWMDevice = false;\n\nBOOL IsDeviceInLandScape(){\n DEVMODE devmode;\n ZeroMemory(&devmode, sizeof(DEVMODE));\n devmode.dmSize = sizeof(DEVMODE);\n devmode.dmDisplayOrientation = DMDO_0;\n devmode.dmFields = DM_DISPLAYORIENTATION;\n ChangeDisplaySettingsEx(NULL, &devmode, NULL, CDS_TEST, NULL);\n\n return ((devmode.dmDisplayOrientation == DMDO_90) || (devmode.dmDisplayOrientation == DMDO_270));\n}\nBOOL IsDeviceInPortrait(){\n DEVMODE devmode;\n ZeroMemory(&devmode, sizeof(DEVMODE));\n devmode.dmSize = sizeof(DEVMODE);\n devmode.dmDisplayOrientation = DMDO_0;\n devmode.dmFields = DM_DISPLAYORIENTATION;\n ChangeDisplaySettingsEx(NULL, &devmode, NULL, CDS_TEST, NULL);\n\n return ((devmode.dmDisplayOrientation == DMDO_0) || (devmode.dmDisplayOrientation == DMDO_180));\n}\n\nATOM PwdMyRegisterClass(HINSTANCE hInstance){\n\tWNDCLASS wcx; \/\/ WINDOW class information\n\tif (!GetClassInfo(hInstance, L\"CheckPassword\", &wcx))\n\t{\n\t\t\/\/Initialize the struct to zero\n\t\tZeroMemory(&wcx,sizeof(WNDCLASS));\n\t\twcx.style = 0; \/\/CS_HREDRAW|CS_VREDRAW |CS_DBLCLKS ; \/\/ Class styles\n\t\twcx.lpfnWndProc = (WNDPROC)PwdMainWndProc; \/\/ Pointer to the callback procedure\n\t\twcx.cbClsExtra = 0; \/\/ Extra byte to allocate following the wndclassex structure\n\t\twcx.cbWndExtra = 0; \/\/ Extra byte to allocate following an instance of the structure\n\t\twcx.hInstance = hInstance; \/\/ Instance of the application\n\t\twcx.hIcon = NULL; \/\/ Class Icon\n\t\twcx.hCursor = 0; \/\/LoadCursor(NULL, IDC_ARROW); \/\/ Class Cursor\n\t\twcx.hbrBackground = (HBRUSH) GetStockObject(WHITE_BRUSH); \/\/ Background brush\n\t\twcx.lpszMenuName = NULL; \/\/ Menu resource\n\t\twcx.lpszClassName = L\"CheckPassword\"; \/\/ Name of this class\n\t\twcx.hIcon = NULL; \/\/ Small icon for this class\n\t\treturn RegisterClass(&wcx);\t\n\t}\n\treturn TRUE;\n}\n\nBOOL PwdInitInstance(HWND hWnd, HINSTANCE hInstance){\t\n\t\n\t\/\/ Create the window\n\tpwdHandles.parent = CreateWindow(L\"CheckPassword\", \/\/ Window class name\n\t\t\twindowTitle, \/\/ Window title\n\t\t\tWS_POPUP | WS_CAPTION, \/\/ Window style\n\t\t\t(pwdCoordinates.xCenter-pwdCoordinates.mainWndXpos\/2),(pwdCoordinates.yCenter-pwdCoordinates.mainWndYpos\/2),\/\/1200,730, \/\/ (x,y) pos of the window\n\t\t\tpwdCoordinates.mainWndXpos,pwdCoordinates.mainWndYpos + 30, \/\/ Width and height of the window\n\t\t\thWnd,\/\/HWND_DESKTOP, \/\/ HWND of the parent window (can be null also)\n\t\t\tNULL, \/\/ Handle to menu\n\t\t\tpwdHandles.hInstance, \/\/ Handle to application instance\n\t\t\tNULL); \/\/ Pointer to window creation data\n\n\t\/\/ Check if window creation was successful\n\tif (!pwdHandles.parent)\n\t\treturn 0;\n\n\t\/\/ Make the window visible\n\tShowWindow(pwdHandles.parent,SW_SHOW);\n\tUpdateWindow(pwdHandles.parent);\n\n\treturn TRUE;\n}\n\n\nVOID PwdCreateButtons(HWND hwnd){\n\tpwdHandles.parent = hwnd;\n\tHWND *buttons = &(pwdHandles.okButton);\n\tfor(int i = 0; i < 2; i++){\n\t\t*buttons = CreateWindowEx(WS_EX_CLIENTEDGE,\n\t\t\t\t\t\t\t\t L\"button\", pwdBtns[i].buttonName,\n\t\t\t\t\t\t\t\t WS_VISIBLE | WS_CHILD | WS_TABSTOP, \n\t\t\t\t\t\t\t\t pwdBtns[i].x, pwdBtns[i].y,\n\t\t\t\t\t\t\t\t pwdBtns[i].width,pwdBtns[i].height,\n\t\t\t\t\t\t\t\t hwnd, \n\t\t\t\t\t\t\t\t (HMENU) (PWD_INITIAL_BUTTON+i),\n\t\t\t\t\t\t\t\t pwdHandles.hInstance, NULL) ;\t\n\n\t\tbuttons++;\n\t}\n}\n\nVOID PwdCreateInputFieldWindow(HWND hwnd){\n\tpwdHandles.parent = hwnd;\n\tHWND *editInputFieldWindow = &(pwdHandles.inputField);\t\n\t*editInputFieldWindow = CreateWindowEx(WS_EX_CLIENTEDGE,\n\t\t\t\t\t\tL\"edit\", L\"\",\n\t\t\t\t\t\tWS_VISIBLE | WS_CHILD | WS_TABSTOP | ES_AUTOHSCROLL | ES_PASSWORD, \n\t\t\t\t\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].x, pwdEditInputField[PWD_AXIS_INPUTFIELD].y,\n\t\t\t\t\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].width,pwdEditInputField[PWD_AXIS_INPUTFIELD].height, \n\t\t\t\t\t\thwnd, \n\t\t\t\t\t\tNULL, \n\t\t\t\t\t\tpwdHandles.hInstance, NULL);\t\n}\n\nVOID PwdDrawTextOnSubTitleArea(HWND bgHandle, LPCWSTR message, int x, int y)\n{\n\tRECT rect;\n\tHDC wdc = GetWindowDC(bgHandle);\n\tGetClientRect (bgHandle, &rect) ;\n\tSetTextColor(wdc, 0x00000000);\n\tSetBkMode(wdc,TRANSPARENT);\n\trect.left = x;\n\trect.top = y;\n\tDrawText( wdc, message, -1, &rect, DT_NOCLIP | DT_WORDBREAK | DT_NOPREFIX ) ;\n\tDeleteDC(wdc);\t\n}\n\nLRESULT CALLBACK PwdMainWndProc(HWND hwnd,UINT msg,WPARAM wParam,LPARAM lParam)\n {\n\tswitch (msg)\n\t{\n\t\tcase WM_CREATE:\t\t\n\t\t\tPwdCreateButtons(hwnd);\t\n\t\t\tPwdCreateInputFieldWindow(hwnd);\n\t\t\tSetFocus(pwdHandles.inputField);\n\t\t break;\n\t\t\n\t\tcase WM_ACTIVATE:\n\t\t\t\/\/ShowWindow(pwdHandles.mainParentWnd,SW_SHOW);\n\t\t\tbreak;\n\n\t\tcase WM_PAINT:\n\t\t\tPAINTSTRUCT ps;\n\t\t\tHDC hdc;\n\t\t\thdc = BeginPaint(hwnd, &ps);\t\n\t\t\tDeleteDC (hdc);\n\t\t\tEndPaint(hwnd, &ps);\n\t\t\tif(isWMDevice){\n\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, drawTextMessage, 20, 50);\n\t\t\t}else{\n\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, drawTextMessage, 20, 25);\n\t\t\t}\n\t\t\tbreak;\t\n\n\t\tcase WM_COMMAND:\t\t\n\t\t\tTCHAR enteredPassWord[MAXCHAR];\n\t\t\tswitch (LOWORD(wParam))\n\t\t\t{\n\t\t\t\tcase VK_RETURN:\n\t\t\t\tcase PWD_IDB_BTN_OK:\n\t\t\t\t\t{\n\t\t\t\t\t\tSendMessage(pwdHandles.inputField,WM_GETTEXT,MAXCHAR,(LPARAM)(enteredPassWord));\n\t\t\t\t\t\tif(isExitPasswordNeedToBeDone){\n\t\t\t\t\t\t\tif(_tcscmp(passwordValue,enteredPassWord) == 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tisEnteredPasswordCorrect = true;\n\t\t\t\t\t\t\t\tDestroyWindow(pwdHandles.parent);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tPwdDrawTextOnSubTitleArea(hwnd, L\"InValid Password\", 20, pwdCoordinates.mainWndYpos);\n\t\t\t\t\t\t\t\tSendMessage(pwdHandles.inputField,WM_SETTEXT,MAXCHAR,(LPARAM)L\"\");\n\t\t\t\t\t\t\t\tisEnteredPasswordCorrect = false;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/Currently Do Nothing\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\t\t\n\t\t\t\tcase PWD_IDB_BTN_CANCEL:\n\t\t\t\t\t{\n\t\t\t\t\t\tisEnteredPasswordCorrect = false;\n\t\t\t\t\t\tPostMessage(pwdHandles.parent , WM_KEYDOWN, VK_ESCAPE, 0);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\tbreak;\t\t\t\n\n\t\tcase WM_DESTROY:\t\t\t\n\t\t\tEnableWindow(pwdHandles.mainParentWnd, TRUE);\n\t\t\tSetForegroundWindow(pwdHandles.mainParentWnd);\n\t\t\tDestroyWindow(hwnd);\n\t\t\tPostQuitMessage(0);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\treturn DefWindowProc(hwnd,msg,wParam,lParam);\/\/ Call the default window handler\n\t}\n\treturn 0;\n } \nVOID PwdInitialiseCoordinates()\n{\t\n\tbool isCheckCoordinatesDifferent = false;\n\tpwdCoordinates.width = GetSystemMetrics(SM_CXVIRTUALSCREEN);\n\tpwdCoordinates.height = GetSystemMetrics(SM_CYVIRTUALSCREEN);\n\tif(pwdCoordinates.width <480 && isWMDevice){\n\t\tisCheckCoordinatesDifferent = true;\n\t\tpwdCoordinates.width = 380;\n\t}\n\tif(pwdCoordinates.height <480 && isWMDevice){\n\t\tisCheckCoordinatesDifferent = true;\n\t\tpwdCoordinates.height = 440;\n\t}\n\tpwdCoordinates.xCenter = (pwdCoordinates.width\/2);\n\tif(pwdCoordinates.height <480 && isWMDevice)\n\t{\n\t\tpwdCoordinates.yCenter = (pwdCoordinates.height\/2) - 50;\n\t}\n\telse\n\t{\n\t\tpwdCoordinates.yCenter = (pwdCoordinates.height\/2);\n\t}\n\tif(IsDeviceInPortrait())\n\t{\n\t\tpwdCoordinates.mainWndXpos = (pwdCoordinates.width * 8)\/10;\n\t\tpwdCoordinates.mainWndYpos = (pwdCoordinates.height * 3)\/10;\t\n\t}\n\telse if(isCheckCoordinatesDifferent && isWMDevice)\n\t{\n\t\tpwdCoordinates.mainWndXpos = (pwdCoordinates.width * 8)\/10;\n\t\tpwdCoordinates.mainWndYpos = (pwdCoordinates.height * 3)\/10;\t\n\t}\n\telse\n\t{\n\t\tpwdCoordinates.mainWndXpos = ((pwdCoordinates.width * 8)\/10) - 80;\n\t\tpwdCoordinates.mainWndYpos = ((pwdCoordinates.height * 3)\/10) + 20;\n\t}\n\n\t\/\/Edit Input Field \n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].x = 20;\n\tif(isWMDevice){\n\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].y = 40;\n\t}\n\telse{\n\t\tpwdEditInputField[PWD_AXIS_INPUTFIELD].y = 20;\n\t}\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].width = (pwdCoordinates.mainWndXpos * 8)\/10;\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdEditInputField[PWD_AXIS_INPUTFIELD].buttonName = L\"\";\t\n\n\t\/\/Ok Button\n\tpwdBtns[PWD_AXIS_OK].x = 20;\n\tif(isWMDevice){\n\t\tpwdBtns[PWD_AXIS_OK].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 50;\n\t}\n\telse{\n\t\tpwdBtns[PWD_AXIS_OK].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 30;\n\t}\n\tpwdBtns[PWD_AXIS_OK].width = (pwdCoordinates.mainWndXpos * 3)\/10;\n\tpwdBtns[PWD_AXIS_OK].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdBtns[PWD_AXIS_OK].buttonName = L\"OK\";\n\n\t\/\/Cancel Button\n\tpwdBtns[PWD_AXIS_CANCEL].x = ((pwdCoordinates.mainWndXpos * 3)\/10) + 20 + 35;\n\tif(isWMDevice){\n\t\tpwdBtns[PWD_AXIS_CANCEL].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 50;\n\t}\n\telse{\n\t\tpwdBtns[PWD_AXIS_CANCEL].y = ((pwdCoordinates.mainWndYpos * 2)\/10) + 30;\n\t}\n\tpwdBtns[PWD_AXIS_CANCEL].width= (pwdCoordinates.mainWndXpos * 3)\/10;\n\tpwdBtns[PWD_AXIS_CANCEL].height = (pwdCoordinates.mainWndYpos * 2)\/10;\n\tpwdBtns[PWD_AXIS_CANCEL].buttonName = L\"CANCEL\";\n}\n\nbool ShowPasswordDialog(bool setDeviceType, bool isExiting, HWND hWnd, HINSTANCE hInstance, LPCTSTR szWindowTitle, LPCTSTR szDrawTextMessage, LPCTSTR szPasswordValue)\n{\n\tisExitPasswordNeedToBeDone = isExiting;\n\n\t\/\/Window Title\n\tmemset(windowTitle, 0,sizeof(windowTitle));\n\t_tcscpy(windowTitle,szWindowTitle);\n\n\t\/\/DrawTextMessage\n\tmemset(drawTextMessage, 0,sizeof(drawTextMessage));\n\t_tcscpy(drawTextMessage,szDrawTextMessage);\n\n\t\/\/Password Value\n\tmemset(passwordValue, 0,sizeof(passwordValue));\n\t_tcscpy(passwordValue,szPasswordValue);\n\n\tisWMDevice = setDeviceType;\n\tpwdHandles.mainParentWnd = hWnd;\n\tpwdHandles.hInstance = hInstance;\n\tPwdInitialiseCoordinates();\n\n\tMSG msg; \/\/ MSG structure to store messages\t\n\n\t\/\/ Register Window Class\n\tif (!PwdMyRegisterClass(hInstance))\n\t{\n\t\tisEnteredPasswordCorrect = false;\n\t\treturn isEnteredPasswordCorrect;\n\t}\n\n\t\/\/ Perform application initialization:\n\tif (!PwdInitInstance (hWnd,hInstance))\n\t{\n\t\tisEnteredPasswordCorrect = false;\n\t\treturn isEnteredPasswordCorrect;\n\t}\n\n\t\/\/ Main message loop: Process messages coming to this window\n\twhile (GetMessage(&msg,NULL,0,0))\n\t{\n\t\tif (msg.message == WM_KEYDOWN) \n\t\t{\n\t\t\t\/\/if pressed Enter button\n\t\t\tif (msg.wParam == VK_RETURN)\n {\n\t\t\t\tPostMessage(pwdHandles.parent , WM_COMMAND, VK_RETURN, 0);\n\t\t\t}\n\t\t\t\/\/if pressed Cancel button\n\t\t\tif (msg.wParam == VK_ESCAPE)\n {\n\t\t\t\tSendMessage(pwdHandles.parent , WM_DESTROY, 0, 0);\n isEnteredPasswordCorrect = false;\n }\n\t\t}\n\t\tTranslateMessage(&msg);\n\t\tDispatchMessage(&msg);\n\t}\n\treturn isEnteredPasswordCorrect;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n\n#include \"util\/Sysout.h\"\n\n#include \"language\/Lexicographer.h\"\n#include \"command\/CmdLexicographer.h\"\n\n#include \"Fuzzy.h\"\n\n#include \"Asnd.h\"\n#include \"AsndDog.h\"\n\n#include <vector>\n\n\/\/ Initialization put in a handy auxiliary function!\nvoid init()\n{\n \/\/ Set the display width to 80 chars long\n Sysout::setDisplayWidth(80);\n\n \/\/ Legend\n Sysout::println(\"Fuzzy Computing Machine\");\n Sysout::println();\n\n \/\/ Add words\n Lexicographer::graph();\n\n \/\/ Add commands\n CmdLexicographer::graph();\n}\n\n\/\/ This is where the magic happens!\nint main()\n{\n bool (*func)();\n func = &Asnd::say;\n\n (*func)();\n\n\n \/\/ Initialize\n init();\n\n \/\/ I REALLY need a better name soon...\n Fuzzy::run();\n\n \/\/ Died quietly\n return 0;\n}\n<commit_msg>Function pointer typedef<commit_after>#include <string>\n\n#include \"util\/Sysout.h\"\n\n#include \"language\/Lexicographer.h\"\n#include \"command\/CmdLexicographer.h\"\n\n#include \"Fuzzy.h\"\n\n#include \"Asnd.h\"\n#include \"AsndDog.h\"\n\n#include <vector>\n\n\/\/ Initialization put in a handy auxiliary function!\nvoid init()\n{\n \/\/ Set the display width to 80 chars long\n Sysout::setDisplayWidth(80);\n\n \/\/ Legend\n Sysout::println(\"Fuzzy Computing Machine\");\n Sysout::println();\n\n \/\/ Add words\n Lexicographer::graph();\n\n \/\/ Add commands\n CmdLexicographer::graph();\n}\n\ntypedef bool (*Funk)();\n\n\/\/ This is where the magic happens!\nint main()\n{\n Funk potato;\n potato = &Asnd::say;\n\n \/\/std::vector<(*funk)()> funkies;\n\n \/\/funkies.push_back(funk);\n\n potato();\n\n\n \/\/ Initialize\n init();\n\n \/\/ I REALLY need a better name soon...\n Fuzzy::run();\n\n \/\/ Died quietly\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>`loaders::load_texture`: Preliminary support for `GL_MIRRORED_REPEAT`.<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n#include <GL\/glew.h>\n#include <SDL2\/SDL.h>\n#include <glm\/glm.hpp>\n#include <glm\/ext.hpp>\n#include \"util.h\"\n\nconst int WIN_WIDTH = 640;\nconst int WIN_HEIGHT = 480;\n\nint main(int argc, char **argv){\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tstd::cout << \"Failed to init: \" << SDL_GetError() << std::endl;\n\t\treturn 1;\n\t}\n\t\n\tSDL_Window *win = SDL_CreateWindow(\"Deferred Renderer\",\n\t\tSDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, WIN_WIDTH, WIN_HEIGHT,\n\t\tSDL_WINDOW_OPENGL);\n\n\tSDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 3);\n\t\n\tSDL_GLContext context = SDL_GL_CreateContext(win);\n\n\tutil::logGLError(\"Post SDL init\");\n\n\tglewExperimental = GL_TRUE;\n\tGLenum err = glewInit();\n\tif (err != GLEW_OK){\n\t\tstd::cout << \"GLEW init error: \" << err << std::endl;\n\t\treturn 1;\n\t}\n\t\/\/Note: If we see an invalid enumerant error that's a result of glewExperimental\n\t\/\/and it sounds like it can be safely ignored\n\tutil::logGLError(\"Post GLEW init\");\n\n\tglClearColor(0.5f, 0.5f, 0.5f, 1);\n\tglEnable(GL_DEPTH_TEST);\n\n\tstd::cout << \"OpenGL Version: \" << glGetString(GL_VERSION) << \"\\n\"\n\t\t<< \"OpenGL Vendor: \" << glGetString(GL_VENDOR) << \"\\n\"\n\t\t<< \"OpenGL Renderer: \" << glGetString(GL_RENDERER) << \"\\n\"\n\t\t<< \"GLSL Version: \" << glGetString(GL_SHADING_LANGUAGE_VERSION) << \"\\n\";\n\n\tGLint progStatus = util::loadProgram(\"res\/vshader.glsl\", \"res\/fshader.glsl\");\n\tif (progStatus == -1){\n\t\treturn 1;\n\t}\n\tGLuint program = progStatus;\n\tglUseProgram(program);\n\n\tGLint modelLoc = glGetUniformLocation(program, \"model\");\n\tGLint projLoc = glGetUniformLocation(program, \"proj\");\n\n\tglm::mat4 model = glm::translate<GLfloat>(0.f, 0.f, -2.f);\n\tglUniformMatrix4fv(modelLoc, 1, GL_FALSE, glm::value_ptr(model));\n\t\n\tglm::mat4 projection = glm::perspective(75.f, \n\t\tWIN_WIDTH \/ static_cast<float>(WIN_HEIGHT), 0.1f, 100.f);\n\tprojection = projection * glm::lookAt(glm::vec3(0.f, 0.f, -5.f), glm::vec3(0.f, 0.f, 0.f),\n\t\tglm::vec3(0.f, 1.f, 0.f));\n\tglUniformMatrix4fv(projLoc, 1, GL_FALSE, glm::value_ptr(projection));\n\t\n\tGLuint vao;\n\tglGenVertexArrays(1, &vao);\n\tglBindVertexArray(vao);\n\n\tGLuint obj[2];\n\tglGenBuffers(2, obj);\n\tsize_t nElems = 0;\n\t\/\/Note: Resource paths are relative to the top level directory as that's where it's expected\n\t\/\/you're running the program\n\tif (!util::loadOBJ(\"res\/polyhedron.obj\", obj[0], obj[1], nElems)){\n\t\tstd::cout << \"obj loading failed\" << std::endl;\n\t\treturn 1;\n\t}\n\t\/\/Position is 0, normals is 1, uv is 2\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GLfloat), 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(3 * sizeof(GL_FLOAT)));\n\t\n\tglEnableVertexAttribArray(2);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(6 * sizeof(GL_FLOAT)));\n\n\t\/\/Setup our render targets\n\tGLuint fbo;\n\tglGenFramebuffers(1, &fbo);\n\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\n\tutil::logGLError(\"Made fbo\");\n\n\t\/\/0: diffuse, 1: normals, 2: depth\n\tGLuint texBuffers[3];\n\tglGenTextures(3, texBuffers);\n\tfor (int i = 0; i < 2; ++i){\n\t\tglActiveTexture(GL_TEXTURE0 + i);\n\t\tglBindTexture(GL_TEXTURE_2D, texBuffers[i]);\n\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, WIN_WIDTH, WIN_HEIGHT, 0, GL_RGB,\n\t\t\tGL_UNSIGNED_BYTE, NULL);\n\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\t\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0 + i, GL_TEXTURE_2D,\n\t\t\ttexBuffers[i], 0);\n\t}\n\tglActiveTexture(GL_TEXTURE2);\n\tglBindTexture(GL_TEXTURE_2D, texBuffers[2]);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_DEPTH_COMPONENT24, WIN_WIDTH, WIN_HEIGHT,\n\t\t0, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE, NULL);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_TEXTURE_2D,\n\t\ttexBuffers[2], 0);\n\n\tutil::logGLError(\"made & attached render targets\");\n\n\tGLenum drawBuffers[2] = { GL_COLOR_ATTACHMENT0, GL_COLOR_ATTACHMENT1 };\n\tglDrawBuffers(2, drawBuffers);\n\n\t\/\/Need another shader program for the second pass, then load up the quad\n\t\/\/apply no transforms and set it to use texture units 0 (diffuse) & 1 (normals)\n\t\/\/and later 3 (depth)\n\t\/\/Quad VAO, VBO, EBO\n\tGLuint quad[3];\n\tglGenVertexArrays(1, quad);\n\tglGenBuffers(2, quad + 1);\n\tsize_t quadElems = 0;\n\tglBindVertexArray(quad[0]);\n\tif (!util::loadOBJ(\"res\/quad.obj\", quad[1], quad[2], quadElems)){\n\t\tstd::cout << \"Failed to load quad\\n\";\n\t\treturn 1;\n\t}\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GLfloat), 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(6 * sizeof(GL_FLOAT)));\n\n\tprogStatus = util::loadProgram(\"res\/vsecondpass.glsl\", \"res\/fsecondpass.glsl\");\n\tif (progStatus == -1){\n\t\treturn 1;\n\t}\n\tGLuint quadProg = progStatus;\n\tglUseProgram(quadProg);\n\tGLuint diffuseUnif = glGetUniformLocation(quadProg, \"diffuse\");\n\tGLuint normalUnif = glGetUniformLocation(quadProg, \"normal\");\n\tGLuint depthUnif = glGetUniformLocation(quadProg, \"depth\");\n\tglUniform1i(diffuseUnif, 0);\n\tglUniform1i(normalUnif, 1);\n\tglUniform1i(depthUnif, 2);\n\n\tif (util::logGLError(\"Pre-loop error check\")){\n\t\treturn 1;\n\t}\n\t\n\tSDL_Event e;\n\tbool quit = false;\n\twhile (!quit){\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT || (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)){\n\t\t\t\tquit = true;\n\t\t\t}\n\t\t}\n\t\t\/\/First pass\n\t\tglUseProgram(program);\n\t\tglBindVertexArray(vao);\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglDrawElements(GL_TRIANGLES, nElems, GL_UNSIGNED_SHORT, 0);\n\n\t\tutil::logGLError(\"post first pass\");\n\n\t\t\/\/Second pass\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglBindVertexArray(quad[0]);\n\t\tglUseProgram(quadProg);\n\t\tglDrawElements(GL_TRIANGLES, quadElems, GL_UNSIGNED_SHORT, 0);\n\n\t\tutil::logGLError(\"post second pass\");\n\n\t\tSDL_GL_SwapWindow(win);\n\t\t\/\/We're not doing anything interactive, just testing some rendering\n\t\t\/\/so don't use so much cpu\n\t\tSDL_Delay(15);\n\t}\n\tglDeleteFramebuffers(1, &fbo);\n\tglDeleteTextures(3, texBuffers);\n\n\tglDeleteBuffers(2, obj);\n\tglDeleteVertexArrays(1, &vao);\n\tglDeleteBuffers(2, quad + 1);\n\tglDeleteVertexArrays(1, quad);\n\t\n\tglDeleteProgram(program);\n\tglDeleteProgram(quadProg);\n\t\n\tSDL_GL_DeleteContext(context);\n\tSDL_DestroyWindow(win);\n\n\treturn 0;\n}\n\n<commit_msg>SDL defaults to doublebuffering on<commit_after>#include <iostream>\n#include <string>\n#include <GL\/glew.h>\n#include <SDL2\/SDL.h>\n#include <glm\/glm.hpp>\n#include <glm\/ext.hpp>\n#include \"util.h\"\n\nconst int WIN_WIDTH = 640;\nconst int WIN_HEIGHT = 480;\n\nint main(int argc, char **argv){\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tstd::cout << \"Failed to init: \" << SDL_GetError() << std::endl;\n\t\treturn 1;\n\t}\n\t\n\tSDL_Window *win = SDL_CreateWindow(\"Deferred Renderer\",\n\t\tSDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED, WIN_WIDTH, WIN_HEIGHT,\n\t\tSDL_WINDOW_OPENGL);\n\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 3);\n\t\n\tSDL_GLContext context = SDL_GL_CreateContext(win);\n\n\tutil::logGLError(\"Post SDL init\");\n\n\tglewExperimental = GL_TRUE;\n\tGLenum err = glewInit();\n\tif (err != GLEW_OK){\n\t\tstd::cout << \"GLEW init error: \" << err << std::endl;\n\t\treturn 1;\n\t}\n\t\/\/Note: If we see an invalid enumerant error that's a result of glewExperimental\n\t\/\/and it sounds like it can be safely ignored\n\tutil::logGLError(\"Post GLEW init\");\n\n\tglClearColor(0.5f, 0.5f, 0.5f, 1);\n\tglEnable(GL_DEPTH_TEST);\n\n\tstd::cout << \"OpenGL Version: \" << glGetString(GL_VERSION) << \"\\n\"\n\t\t<< \"OpenGL Vendor: \" << glGetString(GL_VENDOR) << \"\\n\"\n\t\t<< \"OpenGL Renderer: \" << glGetString(GL_RENDERER) << \"\\n\"\n\t\t<< \"GLSL Version: \" << glGetString(GL_SHADING_LANGUAGE_VERSION) << \"\\n\";\n\n\tGLint progStatus = util::loadProgram(\"res\/vshader.glsl\", \"res\/fshader.glsl\");\n\tif (progStatus == -1){\n\t\treturn 1;\n\t}\n\tGLuint program = progStatus;\n\tglUseProgram(program);\n\n\tGLint modelLoc = glGetUniformLocation(program, \"model\");\n\tGLint projLoc = glGetUniformLocation(program, \"proj\");\n\n\tglm::mat4 model = glm::translate<GLfloat>(0.f, 0.f, -2.f);\n\tglUniformMatrix4fv(modelLoc, 1, GL_FALSE, glm::value_ptr(model));\n\t\n\tglm::mat4 projection = glm::perspective(75.f, \n\t\tWIN_WIDTH \/ static_cast<float>(WIN_HEIGHT), 0.1f, 100.f);\n\tprojection = projection * glm::lookAt(glm::vec3(0.f, 0.f, -5.f), glm::vec3(0.f, 0.f, 0.f),\n\t\tglm::vec3(0.f, 1.f, 0.f));\n\tglUniformMatrix4fv(projLoc, 1, GL_FALSE, glm::value_ptr(projection));\n\t\n\tGLuint vao;\n\tglGenVertexArrays(1, &vao);\n\tglBindVertexArray(vao);\n\n\tGLuint obj[2];\n\tglGenBuffers(2, obj);\n\tsize_t nElems = 0;\n\t\/\/Note: Resource paths are relative to the top level directory as that's where it's expected\n\t\/\/you're running the program\n\tif (!util::loadOBJ(\"res\/polyhedron.obj\", obj[0], obj[1], nElems)){\n\t\tstd::cout << \"obj loading failed\" << std::endl;\n\t\treturn 1;\n\t}\n\t\/\/Position is 0, normals is 1, uv is 2\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GLfloat), 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(3 * sizeof(GL_FLOAT)));\n\t\n\tglEnableVertexAttribArray(2);\n\tglVertexAttribPointer(2, 2, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(6 * sizeof(GL_FLOAT)));\n\n\t\/\/Setup our render targets\n\tGLuint fbo;\n\tglGenFramebuffers(1, &fbo);\n\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\n\tutil::logGLError(\"Made fbo\");\n\n\t\/\/0: diffuse, 1: normals, 2: depth\n\tGLuint texBuffers[3];\n\tglGenTextures(3, texBuffers);\n\tfor (int i = 0; i < 2; ++i){\n\t\tglActiveTexture(GL_TEXTURE0 + i);\n\t\tglBindTexture(GL_TEXTURE_2D, texBuffers[i]);\n\t\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, WIN_WIDTH, WIN_HEIGHT, 0, GL_RGB,\n\t\t\tGL_UNSIGNED_BYTE, NULL);\n\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\t\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\t\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0 + i, GL_TEXTURE_2D,\n\t\t\ttexBuffers[i], 0);\n\t}\n\tglActiveTexture(GL_TEXTURE2);\n\tglBindTexture(GL_TEXTURE_2D, texBuffers[2]);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_DEPTH_COMPONENT24, WIN_WIDTH, WIN_HEIGHT,\n\t\t0, GL_DEPTH_COMPONENT, GL_UNSIGNED_BYTE, NULL);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_DEPTH_ATTACHMENT, GL_TEXTURE_2D,\n\t\ttexBuffers[2], 0);\n\n\tutil::logGLError(\"made & attached render targets\");\n\n\tGLenum drawBuffers[2] = { GL_COLOR_ATTACHMENT0, GL_COLOR_ATTACHMENT1 };\n\tglDrawBuffers(2, drawBuffers);\n\n\t\/\/Need another shader program for the second pass, then load up the quad\n\t\/\/apply no transforms and set it to use texture units 0 (diffuse) & 1 (normals)\n\t\/\/and later 3 (depth)\n\t\/\/Quad VAO, VBO, EBO\n\tGLuint quad[3];\n\tglGenVertexArrays(1, quad);\n\tglGenBuffers(2, quad + 1);\n\tsize_t quadElems = 0;\n\tglBindVertexArray(quad[0]);\n\tif (!util::loadOBJ(\"res\/quad.obj\", quad[1], quad[2], quadElems)){\n\t\tstd::cout << \"Failed to load quad\\n\";\n\t\treturn 1;\n\t}\n\tglEnableVertexAttribArray(0);\n\tglVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 9 * sizeof(GLfloat), 0);\n\n\tglEnableVertexAttribArray(1);\n\tglVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 9 * sizeof(GL_FLOAT),\n\t\t(void*)(6 * sizeof(GL_FLOAT)));\n\n\tprogStatus = util::loadProgram(\"res\/vsecondpass.glsl\", \"res\/fsecondpass.glsl\");\n\tif (progStatus == -1){\n\t\treturn 1;\n\t}\n\tGLuint quadProg = progStatus;\n\tglUseProgram(quadProg);\n\tGLuint diffuseUnif = glGetUniformLocation(quadProg, \"diffuse\");\n\tGLuint normalUnif = glGetUniformLocation(quadProg, \"normal\");\n\tGLuint depthUnif = glGetUniformLocation(quadProg, \"depth\");\n\tglUniform1i(diffuseUnif, 0);\n\tglUniform1i(normalUnif, 1);\n\tglUniform1i(depthUnif, 2);\n\n\tif (util::logGLError(\"Pre-loop error check\")){\n\t\treturn 1;\n\t}\n\t\n\tSDL_Event e;\n\tbool quit = false;\n\twhile (!quit){\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT || (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)){\n\t\t\t\tquit = true;\n\t\t\t}\n\t\t}\n\t\t\/\/First pass\n\t\tglUseProgram(program);\n\t\tglBindVertexArray(vao);\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglDrawElements(GL_TRIANGLES, nElems, GL_UNSIGNED_SHORT, 0);\n\n\t\tutil::logGLError(\"post first pass\");\n\n\t\t\/\/Second pass\n\t\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\t\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\t\tglBindVertexArray(quad[0]);\n\t\tglUseProgram(quadProg);\n\t\tglDrawElements(GL_TRIANGLES, quadElems, GL_UNSIGNED_SHORT, 0);\n\n\t\tutil::logGLError(\"post second pass\");\n\n\t\tSDL_GL_SwapWindow(win);\n\t\t\/\/We're not doing anything interactive, just testing some rendering\n\t\t\/\/so don't use so much cpu\n\t\tSDL_Delay(15);\n\t}\n\tglDeleteFramebuffers(1, &fbo);\n\tglDeleteTextures(3, texBuffers);\n\n\tglDeleteBuffers(2, obj);\n\tglDeleteVertexArrays(1, &vao);\n\tglDeleteBuffers(2, quad + 1);\n\tglDeleteVertexArrays(1, quad);\n\t\n\tglDeleteProgram(program);\n\tglDeleteProgram(quadProg);\n\t\n\tSDL_GL_DeleteContext(context);\n\tSDL_DestroyWindow(win);\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include <boost\/program_options.hpp>\n\n\/\/ Project\n#include \"Client.h\"\n#include \"ClientOptions.h\"\n\nusing namespace boost::program_options;\n\nboost::program_options::options_description client_options() {\n boost::program_options::options_description desc(\"Options\");\n\n desc.add_options()\n\t (\"ip,i\", value<std::string>()->default_value(\"localhost\"),\"Server address\")\n\t (\"port,p\", value<std::string>()->default_value(\"2061\"),\"Server port\")\n\t (\"player-name,n\", value<std::string>()->required())\n\t (\"player-team,t\", value<std::string>())\n\t (\"window-width,w\", value<int>())\n\t (\"window-height,h\", value<int>());\n\n return desc;\n}\n\nClientOptions parseClientOptions(int argc, char const *argv[]) noexcept {\n options_description desc = client_options();\n\n try {\n variables_map vm;\n\n store(command_line_parser(argc, argv).options(desc).run(), vm);\n notify(vm);\n\n \/\/ Looking forward to C++20 designated initializers\n ClientOptions opts{\n vm[\"ip\"].as<std::string>(),\n vm[\"port\"].as<std::string>(),\n vm[\"player-name\"].as<std::string>(),\n vm.count(\"player-team\") ? vm[\"player-team\"].as<std::string>() : \"\",\n vm.count(\"window-width\") ? vm[\"window-width\"].as<int>() : -1,\n vm.count(\"window-height\") ? vm[\"window-height\"].as<int>() : -1};\n\n return opts;\n } catch (std::exception const &e) {\n std::cerr << \"Cannot parse arguments:\\n\"\n << e.what() << std::endl\n << std::endl;\n std::cerr << desc << std::endl;\n std::exit(1);\n }\n}\n\nvoid runClientWithOptions(ClientOptions const &options) {\n try {\n Client client{options};\n client.run();\n } catch (std::exception &e) {\n std::cerr << \"Error: \\n\" << e.what() << std::endl << std::endl;\n\tstd::exit(1);\n }\n}\n\nint main(int argc, const char **argv) {\n std::cout << \"Toogashada Client\" << std::endl;\n ClientOptions options = parseClientOptions(argc, argv);\n runClientWithOptions(options);\n}\n<commit_msg>Reformat<commit_after>#include <iostream>\n\n#include <boost\/program_options.hpp>\n\n\/\/ Project\n#include \"Client.h\"\n#include \"ClientOptions.h\"\n\nusing namespace boost::program_options;\n\nboost::program_options::options_description client_options() {\n boost::program_options::options_description desc(\"Options\");\n\n desc.add_options()(\"ip,i\", value<std::string>()->default_value(\"localhost\"),\n \"Server address\");\n desc.add_options()(\"port,p\", value<std::string>()->default_value(\"2061\"),\n \"Server port\");\n desc.add_options()(\"player-name,n\", value<std::string>()->required());\n desc.add_options()(\"player-team,t\", value<std::string>());\n desc.add_options()(\"window-width,w\", value<int>());\n desc.add_options()(\"window-height,h\", value<int>());\n\n return desc;\n}\n\nClientOptions parseClientOptions(int argc, char const *argv[]) noexcept {\n options_description desc = client_options();\n\n try {\n variables_map vm;\n\n store(command_line_parser(argc, argv).options(desc).run(), vm);\n notify(vm);\n\n \/\/ Looking forward to C++20 designated initializers\n ClientOptions opts{\n vm[\"ip\"].as<std::string>(),\n vm[\"port\"].as<std::string>(),\n vm[\"player-name\"].as<std::string>(),\n vm.count(\"player-team\") ? vm[\"player-team\"].as<std::string>() : \"\",\n vm.count(\"window-width\") ? vm[\"window-width\"].as<int>() : -1,\n vm.count(\"window-height\") ? vm[\"window-height\"].as<int>() : -1};\n\n return opts;\n } catch (std::exception const &e) {\n std::cerr << \"Cannot parse arguments:\\n\"\n << e.what() << std::endl\n << std::endl;\n std::cerr << desc << std::endl;\n std::exit(1);\n }\n}\n\nvoid runClientWithOptions(ClientOptions const &options) {\n try {\n Client client{options};\n client.run();\n } catch (std::exception &e) {\n std::cerr << \"Error: \\n\" << e.what() << std::endl << std::endl;\n std::exit(1);\n }\n}\n\nint main(int argc, const char **argv) {\n std::cout << \"Toogashada Client\" << std::endl;\n ClientOptions options = parseClientOptions(argc, argv);\n runClientWithOptions(options);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"application.hpp\"\n#include \"singletons\/nativemessagingmanager.hpp\"\n#include \"singletons\/pathmanager.hpp\"\n#include \"util\/networkmanager.hpp\"\n\n#include <QAbstractNativeEventFilter>\n#include <QApplication>\n#include <QFile>\n#include <QLibrary>\n#include <QStringList>\n\n#ifdef USEWINSDK\n#include \"util\/nativeeventhelper.hpp\"\n#endif\n\n#include <fstream>\n#include <iostream>\n\n#ifdef Q_OS_WIN\n#include <fcntl.h>\n#include <io.h>\n#include <stdio.h>\n#endif\n\nbool isBigEndian()\n{\n int test = 1;\n char *p = (char *)&test;\n\n return p[0] == 0;\n}\n\nvoid runNativeMessagingHost();\nint runGui(int argc, char *argv[]);\n\nint main(int argc, char *argv[])\n{\n \/\/ read args\n QStringList args;\n\n for (int i = 1; i < argc; i++) {\n args << argv[i];\n }\n\n \/\/ TODO: can be any argument\n if (args.size() > 0 && args[0].startsWith(\"chrome-extension:\/\/\")) {\n runNativeMessagingHost();\n return 0;\n }\n\n \/\/ run gui\n return runGui(argc, argv);\n}\n\nint runGui(int argc, char *argv[])\n{\n QApplication::setAttribute(Qt::AA_Use96Dpi, true);\n#ifdef Q_OS_WIN32\n QApplication::setAttribute(Qt::AA_DisableHighDpiScaling, true);\n#endif\n \/\/ QApplication::setAttribute(Qt::AA_UseSoftwareOpenGL, true);\n QApplication a(argc, argv);\n\n\/\/ Install native event handler for hidpi on windows\n#ifdef USEWINSDK\n a.installNativeEventFilter(new chatterino::util::DpiNativeEventFilter);\n#endif\n\n \/\/ Initialize settings\n bool success = chatterino::singletons::PathManager::getInstance().init(argc, argv);\n if (!success) {\n printf(\"Error initializing paths\\n\");\n return 1;\n }\n\n \/\/ Initialize NetworkManager\n chatterino::util::NetworkManager::init();\n\n {\n \/\/ Initialize application\n chatterino::Application app;\n\n \/\/ Start the application\n app.run(a);\n\n \/\/ Application will go out of scope here and deinitialize itself\n }\n\n \/\/ Save settings\n pajlada::Settings::SettingManager::save();\n\n \/\/ Deinitialize NetworkManager (stop thread and wait for finish, should be instant)\n chatterino::util::NetworkManager::deinit();\n\n _exit(0);\n}\n\nvoid runNativeMessagingHost()\n{\n#ifdef Q_OS_WIN\n _setmode(_fileno(stdin), _O_BINARY);\n _setmode(_fileno(stdout), _O_BINARY);\n#endif\n\n auto &nmm = chatterino::singletons::NativeMessagingManager::getInstance();\n\n bool bigEndian = isBigEndian();\n\n while (true) {\n char size_c[4];\n std::cin.read(size_c, 4);\n\n if (std::cin.eof()) {\n break;\n }\n\n uint32_t size = 0;\n if (bigEndian) {\n size = size_c[3] | static_cast<uint32_t>(size_c[2]) << 8 |\n static_cast<uint32_t>(size_c[1]) << 16 | static_cast<uint32_t>(size_c[0]) << 24;\n } else {\n size = size_c[0] | static_cast<uint32_t>(size_c[1]) << 8 |\n static_cast<uint32_t>(size_c[2]) << 16 | static_cast<uint32_t>(size_c[3]) << 24;\n }\n\n char *b = (char *)malloc(size + 1);\n std::cin.read(b, size);\n *(b + size) = '\\0';\n\n nmm.sendToGuiProcess(QByteArray(b, size));\n\n free(b);\n }\n}\n<commit_msg>Disable the experimental code, oops KKona<commit_after>#include \"application.hpp\"\n#include \"singletons\/nativemessagingmanager.hpp\"\n#include \"singletons\/pathmanager.hpp\"\n#include \"util\/networkmanager.hpp\"\n\n#include <QAbstractNativeEventFilter>\n#include <QApplication>\n#include <QFile>\n#include <QLibrary>\n#include <QStringList>\n\n#ifdef USEWINSDK\n#include \"util\/nativeeventhelper.hpp\"\n#endif\n\n#include <fstream>\n#include <iostream>\n\n#ifdef Q_OS_WIN\n#include <fcntl.h>\n#include <io.h>\n#include <stdio.h>\n#endif\n\nbool isBigEndian()\n{\n int test = 1;\n char *p = (char *)&test;\n\n return p[0] == 0;\n}\n\nvoid runNativeMessagingHost();\nint runGui(int argc, char *argv[]);\n\nint main(int argc, char *argv[])\n{\n \/\/ read args\n QStringList args;\n\n for (int i = 1; i < argc; i++) {\n args << argv[i];\n }\n\n \/\/ TODO: can be any argument\n if (args.size() > 0 && args[0].startsWith(\"chrome-extension:\/\/\")) {\n runNativeMessagingHost();\n return 0;\n }\n\n \/\/ run gui\n return runGui(argc, argv);\n}\n\nint runGui(int argc, char *argv[])\n{\n QApplication::setAttribute(Qt::AA_Use96Dpi, true);\n#ifdef Q_OS_WIN32\n QApplication::setAttribute(Qt::AA_DisableHighDpiScaling, true);\n#endif\n \/\/ QApplication::setAttribute(Qt::AA_UseSoftwareOpenGL, true);\n QApplication a(argc, argv);\n\n\/\/ Install native event handler for hidpi on windows\n#ifdef USEWINSDK\n a.installNativeEventFilter(new chatterino::util::DpiNativeEventFilter);\n#endif\n\n \/\/ Initialize settings\n bool success = chatterino::singletons::PathManager::getInstance().init(argc, argv);\n if (!success) {\n printf(\"Error initializing paths\\n\");\n return 1;\n }\n\n \/\/ Initialize NetworkManager\n chatterino::util::NetworkManager::init();\n\n {\n \/\/ Initialize application\n chatterino::Application app;\n\n \/\/ Start the application\n app.run(a);\n\n \/\/ Application will go out of scope here and deinitialize itself\n }\n\n \/\/ Save settings\n pajlada::Settings::SettingManager::save();\n\n \/\/ Deinitialize NetworkManager (stop thread and wait for finish, should be instant)\n chatterino::util::NetworkManager::deinit();\n\n _exit(0);\n}\n\nvoid runNativeMessagingHost()\n{\n#ifdef Q_OS_WIN\n _setmode(_fileno(stdin), _O_BINARY);\n _setmode(_fileno(stdout), _O_BINARY);\n#endif\n\n auto &nmm = chatterino::singletons::NativeMessagingManager::getInstance();\n\n#if 0\n bool bigEndian = isBigEndian();\n#endif\n\n while (true) {\n char size_c[4];\n std::cin.read(size_c, 4);\n\n if (std::cin.eof()) {\n break;\n }\n\n uint32_t size = *reinterpret_cast<uint32_t *>(size_c);\n#if 0\n \/\/ To avoid breaking strict-aliasing rules and potentially inducing undefined behaviour, the following code can be run instead\n uint32_t size = 0;\n if (bigEndian) {\n size = size_c[3] | static_cast<uint32_t>(size_c[2]) << 8 |\n static_cast<uint32_t>(size_c[1]) << 16 | static_cast<uint32_t>(size_c[0]) << 24;\n } else {\n size = size_c[0] | static_cast<uint32_t>(size_c[1]) << 8 |\n static_cast<uint32_t>(size_c[2]) << 16 | static_cast<uint32_t>(size_c[3]) << 24;\n }\n#endif\n\n char *b = (char *)malloc(size + 1);\n std::cin.read(b, size);\n *(b + size) = '\\0';\n\n nmm.sendToGuiProcess(QByteArray(b, size));\n\n free(b);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string.h>\n#include <unistd.h> \n#include <stdio.h>\n#include <errno.h>\n#include <sys\/wait.h>\n#include <vector>\n#include <boost\/tokenizer.hpp>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\nusing namespace std;\nusing namespace boost;\n\n\nint status;\n\n\nint main(int argc, char **argv)\n{\n\tbool finish = false;\n\tstring login = getlogin();\n\tif(getlogin() == NULL)\n\t{\n\t\tlogin = \"\";\n\t\tperror(\"get login failed\");\n\t}\n\tchar hostarray[64];\n\tgethostname(hostarray, 64);\n\tif(gethostname(hostarray, 64) == -1)\n\t\tperror(\"get host name failed\");\n\t\n\t\/\/rshell loop\n\twhile(!finish)\n\t{\n\t\tbool syntaxerror = false;\n\t\tint semicolon= 0;\n\t\tint ampersand = 0;\n\t\tint pipe = 0;\n\t\tint right = 0;\n\t\tint left = 0;\n\t\tstring command = \"\";\n\t\tvector <string> commands;\n\n\t\t\/\/login name and host info prompt\n\t\tif(getlogin() != NULL)\n\t\t\tcout << login << \"@\" << hostarray;\n\t\t\n\t\t\/\/ready prompt\n\t\tcout << \"$ \";\n\n\t\t\/\/take in command from user\n\t\tgetline(cin, command);\n\t\/\/\tcout << command << endl;\n\n\t\t\/\/account for #\n\t\tif(command.find(\"#\") != string::npos)\n\t\t{\n\t\t\tcommand = command.substr(0, command.find(\"#\"));\n\t\t\/\/\tcout << command << endl;\n\t\t}\n\n\t\t\/\/account for empty command\n\t\tif(command == \"\")\n\t\t\tcontinue;\n\n\t\t\/\/tokenizer init\n\t\tchar_separator<char> delim(\" \",\";&|#<>\");\n\t\ttokenizer< char_separator<char> > mytok(command, delim);\t\n\t\t\n\t\t\/\/token check\n\t\t\/\/for(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t\/\/{\n\t\t\/\/\tcout << \"(\" << *it << \")\" << \" \";\n\t\t\/\/}\n\t\t\/\/cout << \"listed the arguements\" << endl;\n\t\t\n\n\t\tfor(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t{\n\t\t\tcout << \"(\" << *it << \")\" << \" \";\n\t\t}\n\t\tcout << \"listed the arguements\" << endl;\n\t\t\n\n\n\n\t\tstring temp;\n\t\t\/\/command list formatting\n\t\tfor(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t{\n\t\t\t\/\/cout << \"; = \" << semicolon << \", & = \" << ampersand << \", | =\" << pipe << endl;\n\t\t\t\/\/if(*it == \"\"); \/\/do nothing\n\t\t\t\n\t\t\tif(*it == \";\") \/\/semicolon handling\n\t\t\t{\n\t\t\t\tsemicolon++;\n\t\t\t\tif(semicolon > 1)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many ; characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(semicolon == 1)\n\t\t\t\t{\n\t\t\t\t\tif(ampersand == 0 && pipe == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\";\");\n\t\t\t\t\t\tsemicolon = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"&\") \/\/ampersand handling\n\t\t\t{\n\t\t\t\tampersand++;\n\t\t\t\tif(ampersand > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many & characters\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(ampersand == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && pipe == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"&&\");\n\t\t\t\t\t\tampersand = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"|\") \/\/pipe handling\n\t\t\t{\n\t\t\t\t\/\/cout << \"PIPE!!!!!!!!!!!\" << endl;\n\t\t\t\tpipe++;\n\t\t\t\tif(pipe > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many | characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(pipe == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"|\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(pipe == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\"|\");\n\t\t\t\t\t\tpipe = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\t\t\n\t\t\telse if(*it == \">\") \/\/> handling\n\t\t\t{\n\t\t\t\tright++;\n\t\t\t\tif(right > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many > characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(right == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\">\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(right == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\">\");\n\t\t\t\t\t\tright = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"<\") \/\/< handling\n\t\t\t{\n\t\t\t\tleft++;\n\t\t\t\tif(left > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many < characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(left == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"<\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(left == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\"<\");\n\t\t\t\t\t\tleft = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(semicolon != 0 || ampersand != 0)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\/\/cout << semicolon << \" \" << ampersand << \" \" << pipe << endl;\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(temp != \"\")\n\t\t\t\t{\n\t\t\t\t\ttemp += ' ';\n\t\t\t\t}\n\t\t\t\ttemp += *it;\n\t\t\t\tif(pipe == 1)\n\t\t\t\t\tpipe = 0;\n\t\t\t\tif(right == 1)\n\t\t\t\t\tright = 0;\n\t\t\t\tif(left == 1)\n\t\t\t\t\tleft = 0;\n\t\t\t}\n\t\t}\n\t\tcommands.push_back(temp.c_str());\n\t\ttemp = \"\";\n\t\t\t\n\t\t\/\/check commands\n\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t{\n\t\t\tcout << \"(\" << commands.at(i) << \") \";\n\t\t}\n\t\tcout << endl;\n\t\t\/\/combine two pipes, two >, and two < together\n\t\tbool prevpipe = false;\n\t\tbool prevright = false;\n\t\tbool prevleft = false;\n\t\tfor(unsigned int i = 1; i < commands.size(); i++)\n\t\t{\n\t\t\tif(commands.at(i - 1) == \"|\")\n\t\t\t\tprevpipe = true;\n\t\t\telse\n\t\t\t\tprevpipe = false;\n\t\t\t\n\t\t\tif(commands.at(i - 1) == \">\")\n\t\t\t\tprevright = true;\n\t\t\telse\n\t\t\t\tprevright = false;\n\t\t\t\n\t\t\tif(commands.at(i - 1) == \"<\")\n\t\t\t\tprevleft = true;\n\t\t\telse\n\t\t\t\tprevleft = false;\n\n\t\t\tif(prevpipe)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \"|\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \"||\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(prevright)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \">\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \">>\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(prevleft)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \"<\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \"<<\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/check commands\n\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t{\n\t\t\tcout << \"(\" << commands.at(i) << \") \";\n\t\t}\n\n\n\t\tcout << \"combined arguements into groups\" << endl;\n\t\tif(!syntaxerror)\n\t\t{\n\t\t\tchar *input[999];\n\t\t\t\/\/exec commands\n\t\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t\t{\n\t\t\t\tstring current = \"\";\n\t\t\t\tstring word = \"\";\n\t\t\t\tint k = 0;\n\t\t\t\tfor(unsigned int j = 0; j < commands.at(i).size(); j++) \/\/itterate through letters\n\t\t\t\t{\n\t\t\t\t\tcurrent = commands.at(i);\n\t\t\t\t\tif(current[j] == ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tinput[k] = new char[word.size() + 1];\n\t\t\t\t\t\tstrcpy(input[k], word.c_str());\n\t\t\t\t\t\tk++;\n\t\t\t\t\t\tword = \"\";\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tword += current[j]; \/\/add letter\t\t\n\t\t\t\t}\t\n\t\t\t\tinput[k] = new char[word.size() + 1];\n\t\t\t\tstrcpy(input[k], word.c_str());\n\t\t\t\tk++;\n\n\t\t\t\tinput[k] = new char[1]; \/\/add the NULL char *\n\t\t\t\tinput[k] = NULL;\n\t\t\n\t\t\t\tif(commands.at(i) == \"exit\") \/\/exit command\n\t\t\t\t{\n\t\t\t\t\tfinish = true;\n\t\t\t\t\tcout << \"ending session...\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse if(commands.at(i) == \";\") \/\/semicolon case\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\telse if(commands.at(i) == \"||\") \/\/double pipe case\n\t\t\t\t{\n\t\t\t\t\tif(status)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\telse if(commands.at(i) == \"&&\") \/\/ampersand case\n\t\t\t\t{\n\t\t\t\t\tif(status == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\t\/\/execute command. based off of in-lecture notes\n\t\t\t\tint pid = fork();\n\t\t\t\tif(pid == -1)\n\t\t\t\t{\n\t\t\t\t\tperror(\"There was an error with fork(). \");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(pid == 0) \/\/in child\n\t\t\t\t{\n\t\t\t\t\t\/\/cout << \"CHILD IS RUNNING :D\" << endl;\n\t\t\t\t\t\/\/cout << input << endl;\n\t\t\t\t\tint fd = 0;\n\t\t\t\t\t\/\/bool inputRedir = false;\n\t\t\t\t\tbool outputRedir = false;\n\t\t\t\t\tif(i + 1 < commands.size())\n\t\t\t\t\t{\n\t\t\t\t\t\tif(commands.at(i + 1) == \">\") \/\/HANDLE >\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\toutputRedir = true;\n\t\t\t\t\t\t\tif(i + 2 < commands.size())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tif(-1 == close(1))\n\t\t\t\t\t\t\t\t\tperror(\"close\");\n\t\t\t\t\t\t\t\tif((fd=open(commands.at(i + 2).c_str(),O_CREAT|O_WRONLY|O_TRUNC,0666))==-1)\n\t\t\t\t\t\t\t\t\tperror(\"open\");\n\t\t\t\t\t\t\t if((dup2(fd,1))==-1)\n\t\t\t\t\t\t\t perror(\"dup2\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tstatus = execvp(input[0], input);\n\t\t\t\t\tif(-1 == status) \n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"There was an error in execvp.\");\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif(outputRedir)\n\t\t\t\t\t\ti = i + 2;\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(pid > 0) \/\/in parent\n\t\t\t\t{\n\t\t\t\t\tif(-1 == waitpid(pid, &status, 0)) \/\/wait for child to finish\n\t\t\t\t\t\tperror(\"There was an error with wait().\");\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t\/\/shell termination\n\t\t\tif(finish)\n\t\t\t{\n\t\t\t\tcout << \"good-bye!\" << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n<commit_msg>Fixed exec bug<commit_after>#include <iostream>\n#include <string.h>\n#include <unistd.h> \n#include <stdio.h>\n#include <errno.h>\n#include <sys\/wait.h>\n#include <vector>\n#include <boost\/tokenizer.hpp>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\nusing namespace std;\nusing namespace boost;\n\n\nint status;\n\n\nint main(int argc, char **argv)\n{\n\tbool finish = false;\n\tstring login = getlogin();\n\tif(getlogin() == NULL)\n\t{\n\t\tlogin = \"\";\n\t\tperror(\"get login failed\");\n\t}\n\tchar hostarray[64];\n\tgethostname(hostarray, 64);\n\tif(gethostname(hostarray, 64) == -1)\n\t\tperror(\"get host name failed\");\n\t\n\t\/\/rshell loop\n\twhile(!finish)\n\t{\n\t\tbool syntaxerror = false;\n\t\tint semicolon= 0;\n\t\tint ampersand = 0;\n\t\tint pipe = 0;\n\t\tint right = 0;\n\t\tint left = 0;\n\t\tstring command = \"\";\n\t\tvector <string> commands;\n\n\t\t\/\/login name and host info prompt\n\t\tif(getlogin() != NULL)\n\t\t\tcout << login << \"@\" << hostarray;\n\t\t\n\t\t\/\/ready prompt\n\t\tcout << \"$ \";\n\n\t\t\/\/take in command from user\n\t\tgetline(cin, command);\n\t\/\/\tcout << command << endl;\n\n\t\t\/\/account for #\n\t\tif(command.find(\"#\") != string::npos)\n\t\t{\n\t\t\tcommand = command.substr(0, command.find(\"#\"));\n\t\t\/\/\tcout << command << endl;\n\t\t}\n\n\t\t\/\/account for empty command\n\t\tif(command == \"\")\n\t\t\tcontinue;\n\n\t\t\/\/tokenizer init\n\t\tchar_separator<char> delim(\" \",\";&|#<>\");\n\t\ttokenizer< char_separator<char> > mytok(command, delim);\t\n\t\t\n\t\t\/\/token check\n\t\t\/\/for(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t\/\/{\n\t\t\/\/\tcout << \"(\" << *it << \")\" << \" \";\n\t\t\/\/}\n\t\t\/\/cout << \"listed the arguements\" << endl;\n\t\t\n\n\t\tfor(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t{\n\t\t\tcout << \"(\" << *it << \")\" << \" \";\n\t\t}\n\t\tcout << \"listed the arguements\" << endl;\n\t\t\n\n\n\n\t\tstring temp;\n\t\t\/\/command list formatting\n\t\tfor(tokenizer<char_separator<char> >::iterator it = mytok.begin(); it != mytok.end(); it++)\n\t\t{\n\t\t\t\/\/cout << \"; = \" << semicolon << \", & = \" << ampersand << \", | =\" << pipe << endl;\n\t\t\t\/\/if(*it == \"\"); \/\/do nothing\n\t\t\t\n\t\t\tif(*it == \";\") \/\/semicolon handling\n\t\t\t{\n\t\t\t\tsemicolon++;\n\t\t\t\tif(semicolon > 1)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many ; characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(semicolon == 1)\n\t\t\t\t{\n\t\t\t\t\tif(ampersand == 0 && pipe == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\";\");\n\t\t\t\t\t\tsemicolon = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"&\") \/\/ampersand handling\n\t\t\t{\n\t\t\t\tampersand++;\n\t\t\t\tif(ampersand > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many & characters\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(ampersand == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && pipe == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"&&\");\n\t\t\t\t\t\tampersand = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"|\") \/\/pipe handling\n\t\t\t{\n\t\t\t\t\/\/cout << \"PIPE!!!!!!!!!!!\" << endl;\n\t\t\t\tpipe++;\n\t\t\t\tif(pipe > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many | characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(pipe == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"|\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(pipe == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\"|\");\n\t\t\t\t\t\tpipe = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\t\t\n\t\t\telse if(*it == \">\") \/\/> handling\n\t\t\t{\n\t\t\t\tright++;\n\t\t\t\tif(right > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many > characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(right == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\">\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(right == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\">\");\n\t\t\t\t\t\tright = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse if(*it == \"<\") \/\/< handling\n\t\t\t{\n\t\t\t\tleft++;\n\t\t\t\tif(left > 2)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Too many < characters.\");\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse if(left == 1)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(temp == \"\")\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"No arguments before connector\");\n\t\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcommands.push_back(temp);\n\t\t\t\t\t\ttemp = \"\";\n\t\t\t\t\t\tcommands.push_back(\"<\");\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse if(left == 2)\n\t\t\t\t{\n\t\t\t\t\tif(semicolon == 0 && ampersand == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tcommands.push_back(\"<\");\n\t\t\t\t\t\tleft = 0;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif(semicolon != 0 || ampersand != 0)\n\t\t\t\t{\n\t\t\t\t\tperror(\"Syntax error. Improper use of connectors.\");\n\t\t\t\t\t\/\/cout << semicolon << \" \" << ampersand << \" \" << pipe << endl;\n\t\t\t\t\tsyntaxerror = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(temp != \"\")\n\t\t\t\t{\n\t\t\t\t\ttemp += ' ';\n\t\t\t\t}\n\t\t\t\ttemp += *it;\n\t\t\t\tif(pipe == 1)\n\t\t\t\t\tpipe = 0;\n\t\t\t\tif(right == 1)\n\t\t\t\t\tright = 0;\n\t\t\t\tif(left == 1)\n\t\t\t\t\tleft = 0;\n\t\t\t}\n\t\t}\n\t\tcommands.push_back(temp.c_str());\n\t\ttemp = \"\";\n\t\t\t\n\t\t\/\/check commands\n\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t{\n\t\t\tcout << \"(\" << commands.at(i) << \") \";\n\t\t}\n\t\tcout << endl;\n\t\t\/\/combine two pipes, two >, and two < together\n\t\tbool prevpipe = false;\n\t\tbool prevright = false;\n\t\tbool prevleft = false;\n\t\tfor(unsigned int i = 1; i < commands.size(); i++)\n\t\t{\n\t\t\tif(commands.at(i - 1) == \"|\")\n\t\t\t\tprevpipe = true;\n\t\t\telse\n\t\t\t\tprevpipe = false;\n\t\t\t\n\t\t\tif(commands.at(i - 1) == \">\")\n\t\t\t\tprevright = true;\n\t\t\telse\n\t\t\t\tprevright = false;\n\t\t\t\n\t\t\tif(commands.at(i - 1) == \"<\")\n\t\t\t\tprevleft = true;\n\t\t\telse\n\t\t\t\tprevleft = false;\n\n\t\t\tif(prevpipe)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \"|\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \"||\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(prevright)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \">\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \">>\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(prevleft)\n\t\t\t{\n\t\t\t\tif(commands.at(i) == \"<\")\n\t\t\t\t{\n\t\t\t\t\tcommands.at(i - 1) = \"<<\";\n\t\t\t\t\tcommands.erase(commands.begin() + i);\n\t\t\t\t\ti--;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t\/\/check commands\n\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t{\n\t\t\tcout << \"(\" << commands.at(i) << \") \";\n\t\t}\n\n\n\t\tcout << \"combined arguements into groups\" << endl;\n\t\tif(!syntaxerror)\n\t\t{\n\t\t\tchar *input[999];\n\t\t\t\/\/exec commands\n\t\t\tfor(unsigned int i = 0; i < commands.size(); i++)\n\t\t\t{\n\t\t\t\tstring current = \"\";\n\t\t\t\tstring word = \"\";\n\t\t\t\tint k = 0;\n\t\t\t\tfor(unsigned int j = 0; j < commands.at(i).size(); j++) \/\/itterate through letters\n\t\t\t\t{\n\t\t\t\t\tcurrent = commands.at(i);\n\t\t\t\t\tif(current[j] == ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tinput[k] = new char[word.size() + 1];\n\t\t\t\t\t\tstrcpy(input[k], word.c_str());\n\t\t\t\t\t\tk++;\n\t\t\t\t\t\tword = \"\";\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tword += current[j]; \/\/add letter\t\t\n\t\t\t\t}\t\n\t\t\t\tinput[k] = new char[word.size() + 1];\n\t\t\t\tstrcpy(input[k], word.c_str());\n\t\t\t\tk++;\n\n\t\t\t\tinput[k] = new char[1]; \/\/add the NULL char *\n\t\t\t\tinput[k] = NULL;\n\t\t\n\t\t\t\tif(commands.at(i) == \"exit\") \/\/exit command\n\t\t\t\t{\n\t\t\t\t\tfinish = true;\n\t\t\t\t\tcout << \"ending session...\";\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse if(commands.at(i) == \";\") \/\/semicolon case\n\t\t\t\t{\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\telse if(commands.at(i) == \"||\") \/\/double pipe case\n\t\t\t\t{\n\t\t\t\t\tif(status)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\telse if(commands.at(i) == \"&&\") \/\/ampersand case\n\t\t\t\t{\n\t\t\t\t\tif(status == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\ti++;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tbool outputRedir = false;\n\t\t\t\tif(i + 1 < commands.size())\n\t\t\t\t{\n\t\t\t\t\tif(commands.at(i + 1) == \">\") \/\/HANDLE >\n\t\t\t\t\t{\n\t\t\t\t\t\toutputRedir = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\/\/execute command. based off of in-lecture notes\n\t\t\t\tint pid = fork();\n\t\t\t\tif(pid == -1)\n\t\t\t\t{\n\t\t\t\t\tperror(\"There was an error with fork(). \");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(pid == 0) \/\/in child\n\t\t\t\t{\n\t\t\t\t\t\/\/cout << \"CHILD IS RUNNING :D\" << endl;\n\t\t\t\t\t\/\/cout << input << endl;\n\t\t\t\t\tint fd = 0;\n\t\t\t\t\t\/\/bool inputRedir = false;\n\t\t\t\t\tif(outputRedir)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(i + 2 < commands.size())\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(-1 == close(1))\n\t\t\t\t\t\t\t\tperror(\"close\");\n\t\t\t\t\t\t\tif((fd=open(commands.at(i + 2).c_str(),O_CREAT|O_WRONLY|O_TRUNC,0666))==-1)\n\t\t\t\t\t\t\t\tperror(\"open\");\n\t\t\t\t\t\t\tif((dup2(fd,1))==-1)\n\t\t\t\t\t\t\t perror(\"dup2\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tstatus = execvp(input[0], input);\n\t\t\t\t\tif(-1 == status) \n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"There was an error in execvp.\");\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\telse if(pid > 0) \/\/in parent\n\t\t\t\t{\n\t\t\t\t\tif(-1 == waitpid(pid, &status, 0)) \/\/wait for child to finish\n\t\t\t\t\t\tperror(\"There was an error with wait().\");\n\t\t\t\t\tif(outputRedir)\n\t\t\t\t\t\ti = i + 2;\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t\/\/shell termination\n\t\t\tif(finish)\n\t\t\t{\n\t\t\t\tcout << \"good-bye!\" << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n *\n * Terminology (Matroid - Graph) for escalated version of algorithm:\n * Basis - Spanning forest\n * Independent set - Tree (i.e. subset of a basis)\n * Circuit - cycle\n * Cocircuit - minimal edge-cut\n * Hyperplane - maximal set not containing any basis (= complement of a min-cut)\n *\n * Spanning forest - union of spanning trees of each component of an unconnected graph\n *\n *\/\n\n#include <iostream>\n#include <stdexcept>\n#include <ogdf\/basic\/Queue.h>\n#include <ogdf\/basic\/Graph.h>\n#include <ogdf\/basic\/Stack.h>\n#include <ogdf\/basic\/simple_graph_alg.h>\n\n#include \"helpers.hpp\"\n#include \"graphcoloring.h\"\n\nusing namespace std;\nusing namespace ogdf;\n\nint cutSizeBound; \/\/ Global variables are evil but this never changes...\n\n\/**\n * Reads a csv file with lines \"<id>;<source>;<target>;...\" and transforms it into a graph\n *\/\nvoid csvToGraph(ifstream &fEdges, Graph &G) {\n vector<node> nodes;\n unsigned int id, u, v;\n\n for (string line; getline(fEdges, line);) {\n sscanf(line.c_str(), \"%u;%u;%u;\", &id, &u, &v);\n\n if (u > nodes.size() || v > nodes.size()) {\n nodes.resize(max(u, v) + 1); \/\/ TODO: How to make this smarter?\n }\n\n if(nodes.at(u) == nullptr)\n nodes[u] = G.newNode(u);\n\n if(nodes[v] == nullptr)\n nodes[v] = G.newNode(v);\n\n G.newEdge(nodes[u], nodes[v], id);\n }\n}\n\n\n\/**\n * Performs BFS to find the shortest path from s to t in graph G without using any edge from the forbidden edges.\n * Returns empty set if no such path exists.\n *\/\nList<edge> shortestPath(const Graph &G, const GraphColoring &coloring, node s, node t, const List<edge> &forbidden) {\n List<edge> path;\n node v, u;\n edge e;\n\n Queue<node> Q;\n\n NodeArray<bool> visited(G, false);\n NodeArray<node> predecessor(G);\n\n Q.append(s);\n visited[s] = true;\n\n while(!Q.empty()) {\n v = Q.pop();\n\n if (v == t) {\n \/\/ Traceback predecessors and reconstruct path\n for (node n = t; n != s; n = predecessor[n]) {\n e = G.searchEdge(n, predecessor[n]); \/\/ Takes O(min(deg(v), deg(w))) (that's fast on sparse graphs)\n if (coloring[e] != Color::RED)\n path.pushFront(e);\n }\n break;\n }\n\n forall_adj_edges(e, v) {\n if (forbidden.search(e).valid()) continue; \/\/ This is fast because m is a small constant\n\n u = e->opposite(v);\n if (!visited[u]) {\n predecessor[u] = v;\n visited[u] = true;\n Q.append(u);\n }\n }\n }\n\n return path;\n}\n\n\nvoid hideConnectedBlueSubgraph(Graph &G, const GraphColoring &coloring, node start) {\n Queue<node> Q; \/\/ TODO: Use DFS to reduce memory needs?\n Q.append(start);\n\n NodeArray<bool> visited(G, false);\n\n node u, v;\n edge e;\n while(!Q.empty()) {\n u = Q.pop();\n forall_adj_edges(e, u) {\n if (coloring[e] == Color::BLUE) {\n v = e->opposite(u);\n if (!visited[v]) {\n visited[v] = true;\n Q.append(v);\n }\n G.hideEdge(e);\n }\n }\n }\n}\n\nbool findPathToAnyBlueAndColorItBlue(const Graph &G, GraphColoring &coloring, node start) {\n Queue<node> Q;\n Q.append(start);\n\n NodeArray<bool> visited(G, false);\n NodeArray<edge> accessEdge(G);\n\n node u, n;\n edge e;\n while(!Q.empty()) {\n u = Q.pop();\n\n if (coloring[u] == Color::BLUE && u != start) {\n \/\/ reconstruct path and go on\n edge ae;\n node n1, n2;\n for (n1 = u; n1 != start;) {\n \/\/ TODO: Use search edge instead?\n ae = accessEdge[n1];\n n2 = ae->opposite(n1);\n\n coloring[n1] = Color::BLUE;\n coloring[n2] = Color::BLUE;\n coloring[ae] = Color::BLUE;\n n1 = n2;\n }\n return true;\n }\n\n forall_adj_edges(e, u) {\n n = e->opposite(u);\n if (!visited[n]) {\n visited[n] = true;\n accessEdge[n] = e;\n Q.append(n);\n }\n }\n }\n\n return false;\n}\n\n\n\/**\n * @return bool True for successful reconnection, false otherwise\n *\/\nbool reconnectBlueSubgraph(Graph &G, const List<edge> &X, GraphColoring &coloring, node u, node v, edge c) {\n \/\/ if u has blue adjacent edges (except of c) AND v has blue adjacent edges (exc. of c) then\n \/\/ enumerate one blue subgraph, call it G_b1\n \/\/ create graph G_rest = G \\ X \\ G_r \\ G_b1 and BFS in it until blue is found\n \/\/ (or BFS (avoid red and X) from u to first blue edge not in G_b1)\n \/\/ -> path found, color it blue and continue\n \/\/ -> path not found, fail here (return;)\n\n G.hideEdge(c); \/\/ Don't consider c\n\n bool uaIsEmpty = true, vaIsEmpty = true;\n edge e;\n\n forall_adj_edges(e, u) {\n if (coloring[e] == Color::BLUE) {\n uaIsEmpty = false;\n break;\n }\n }\n\n forall_adj_edges(e, v) {\n if (coloring[e] == Color::BLUE) {\n vaIsEmpty = false;\n break;\n }\n }\n\n if (!uaIsEmpty && !vaIsEmpty) {\n \/\/ G_b has been disconnected, hide X, G_r and one component of blue subgraph (TODO: Maintain G_rest through the whole algorithm and not recompute here every time?)\n for(List<edge>::const_iterator it = X.begin(); it != X.end(); it++) G.hideEdge(*it);\n forall_edges(e, G) { if(coloring[e] == Color::RED) G.hideEdge(e); }\n hideConnectedBlueSubgraph(G, coloring, u);\n\n \/\/ BFS in G from u to the first found blue edge\n \/\/ -> not found => fail here\n \/\/ -> path found => color it blue and continue\n\n if (!findPathToAnyBlueAndColorItBlue(G, coloring, u)) {\n G.restoreAllEdges();\n return false;\n }\n\n\n } \/\/ else c is just a branch with a single leaf, nothing happened G_b stays connected\n\n G.restoreAllEdges();\n return true;\n}\n\n\nvoid GenCocircuits(List<List<edge>> &Cocircuits, Graph &G, GraphColoring coloring, List<edge> X, node red, node blue) {\n if (X.size() > cutSizeBound) return;\n\n \/\/ Find set D = (a short circuit C in G, s. t. |C ∩ X| = 1) \\ X\n List<edge> D = shortestPath(G, coloring, red, blue, X);\n\n if (D.size() > 0) {\n\n \/\/ for each c ∈ D, recursively call GenCocircuits(X ∪ {c}).\n for(List<edge>::iterator iterator = D.begin(); iterator != D.end(); iterator++) {\n edge c = *iterator;\n\n List<edge> newX = X;\n newX.pushBack(c);\n\n \/\/ Coloring red-c path red, determining u and v, coloring the rest blue\n node n1 = red, n2 = blue, \/\/ after the first of the following for cycles these are the\n \/\/ nodes of the last red edge (one of them has to be incident with c)\n \/\/ initialized to red and blue since the first for can have 0 iterations\n u, v; \/\/ c = (u,v), say u is red (and so will be all vertices on the path from the first red to u)\n\n for(List<edge>::iterator j = D.begin(); j != iterator; j++) {\n edge e = *j;\n\n n1 = e->source();\n n2 = e->target();\n\n coloring[n1] = Color::RED;\n coloring[n2] = Color::RED;\n coloring[e] = Color::RED;\n }\n\n \/\/ Determine u, v, s.t. u is really red and v blue\n if (c->source() == n1 || c->target() == n1) { \/\/ if n1 is in c then n1 == u\n u = n1;\n } else { \/\/ n2 is in c so n2 == u\n u = n2;\n }\n\n v = c->opposite(u);\n\n \/\/ Color the rest of the path blue\n for(List<edge>::iterator j = iterator.succ(); j != D.end(); j++) {\n edge e = *j;\n\n coloring[e->source()] = Color::BLUE;\n coloring[e->target()] = Color::BLUE;\n coloring[e] = Color::BLUE;\n }\n\n\n \/\/ If c = (u, v) is blue, reconnect blue subgraph (find the shortest path from u to v using only nonred edges)\n if (coloring[c] == Color::BLUE) {\n reconnectBlueSubgraph(G, X, coloring, u, v, c);\n }\n\n GenCocircuits(Cocircuits, G, coloring, newX, u, v);\n }\n\n } else {\n \/\/ If there is no such circuit C above (line 4), then return ‘Cocircuit: X’.\n Cocircuits.pushBack(X);\n }\n}\n\n\n\/**\n * Returns edges spanning forest of (possibly disconnected) graph G\n * @param G\n *\/\nList<edge> spanningEdges(const Graph &G) {\n EdgeArray<bool> isBackedge(G, false);\n\n List<edge> backedges;\n isAcyclicUndirected(G, backedges);\n\n for(List<edge>::iterator i = backedges.begin(); i != backedges.end(); i++) {\n isBackedge[*i] = true;\n }\n\n List<edge> spanningEdges;\n edge e;\n forall_edges(e, G) {\n if (!isBackedge[e]) {\n spanningEdges.pushBack(e);\n }\n }\n\n return spanningEdges;\n}\n\nvoid CircuitCocircuit(Graph &G, List<List<edge>> &cocircuits) {\n List<edge> base = spanningEdges(G);\n\n edge e;\n for(List<edge>::iterator i = base.begin(); i != base.end(); i++) {\n e = *i;\n List<edge> X; \/\/ (Indexes might be sufficient? Check later)\n GraphColoring coloring(G);\n X.pushBack(e);\n coloring[e->source()] = Color::RED;\n coloring[e->target()] = Color::BLUE;\n\n GenCocircuits(cocircuits, G, coloring, X, e->source(), e->target());\n }\n}\n\nint main(int argc, char* argv[])\n{\n if (argc != 3 || strcmp(argv[1], \"-h\") == 0 || strcmp(argv[1], \"--help\") == 0) {\n cout << \"Usage: \" << argv[0] << \" <graph.csv> <cocircuit size bound>\" << endl;\n exit(2);\n }\n\n \/\/ TODO: Read from stdin\n ifstream fEdges(argv[1]);\n if (!fEdges.is_open()) {\n cerr << \"Edges file doesn't exist or could not be accessed. Terminating.\" << endl;\n exit(3);\n }\n\n cutSizeBound = stoi(argv[2]);\n if (cutSizeBound < 1) {\n cerr << \"Cocircuit size bound lower than 1. Terminating.\" << endl;\n exit(4);\n }\n\n try {\n Graph G;\n csvToGraph(fEdges, G);\n\n List<List<edge>> cocircuits;\n CircuitCocircuit(G, cocircuits);\n\n for(List<List<edge> >::iterator it = cocircuits.begin(); it != cocircuits.end(); ++it) {\n cout << *it << endl;\n }\n\n } catch (invalid_argument *e) {\n cerr << \"Error: \" << e->what() << endl;\n return 1;\n }\n\n return 0;\n}\n\n<commit_msg>reconnectBlueSubgraph return value considered<commit_after>\/**\n *\n * Terminology (Matroid - Graph) for escalated version of algorithm:\n * Basis - Spanning forest\n * Independent set - Tree (i.e. subset of a basis)\n * Circuit - cycle\n * Cocircuit - minimal edge-cut\n * Hyperplane - maximal set not containing any basis (= complement of a min-cut)\n *\n * Spanning forest - union of spanning trees of each component of an unconnected graph\n *\n *\/\n\n#include <iostream>\n#include <stdexcept>\n#include <ogdf\/basic\/Queue.h>\n#include <ogdf\/basic\/Graph.h>\n#include <ogdf\/basic\/Stack.h>\n#include <ogdf\/basic\/simple_graph_alg.h>\n\n#include \"helpers.hpp\"\n#include \"graphcoloring.h\"\n\nusing namespace std;\nusing namespace ogdf;\n\nint cutSizeBound; \/\/ Global variables are evil but this never changes...\n\n\/**\n * Reads a csv file with lines \"<id>;<source>;<target>;...\" and transforms it into a graph\n *\/\nvoid csvToGraph(ifstream &fEdges, Graph &G) {\n vector<node> nodes;\n unsigned int id, u, v;\n\n for (string line; getline(fEdges, line);) {\n sscanf(line.c_str(), \"%u;%u;%u;\", &id, &u, &v);\n\n if (u > nodes.size() || v > nodes.size()) {\n nodes.resize(max(u, v) + 1); \/\/ TODO: How to make this smarter?\n }\n\n if(nodes.at(u) == nullptr)\n nodes[u] = G.newNode(u);\n\n if(nodes[v] == nullptr)\n nodes[v] = G.newNode(v);\n\n G.newEdge(nodes[u], nodes[v], id);\n }\n}\n\n\n\/**\n * Performs BFS to find the shortest path from s to t in graph G without using any edge from the forbidden edges.\n * Returns empty set if no such path exists.\n *\/\nList<edge> shortestPath(const Graph &G, const GraphColoring &coloring, node s, node t, const List<edge> &forbidden) {\n List<edge> path;\n node v, u;\n edge e;\n\n Queue<node> Q;\n\n NodeArray<bool> visited(G, false);\n NodeArray<node> predecessor(G);\n\n Q.append(s);\n visited[s] = true;\n\n while(!Q.empty()) {\n v = Q.pop();\n\n if (v == t) {\n \/\/ Traceback predecessors and reconstruct path\n for (node n = t; n != s; n = predecessor[n]) {\n e = G.searchEdge(n, predecessor[n]); \/\/ Takes O(min(deg(v), deg(w))) (that's fast on sparse graphs)\n if (coloring[e] != Color::RED)\n path.pushFront(e);\n }\n break;\n }\n\n forall_adj_edges(e, v) {\n if (forbidden.search(e).valid()) continue; \/\/ This is fast because m is a small constant\n\n u = e->opposite(v);\n if (!visited[u]) {\n predecessor[u] = v;\n visited[u] = true;\n Q.append(u);\n }\n }\n }\n\n return path;\n}\n\n\nvoid hideConnectedBlueSubgraph(Graph &G, const GraphColoring &coloring, node start) {\n Queue<node> Q; \/\/ TODO: Use DFS to reduce memory needs?\n Q.append(start);\n\n NodeArray<bool> visited(G, false);\n\n node u, v;\n edge e;\n while(!Q.empty()) {\n u = Q.pop();\n forall_adj_edges(e, u) {\n if (coloring[e] == Color::BLUE) {\n v = e->opposite(u);\n if (!visited[v]) {\n visited[v] = true;\n Q.append(v);\n }\n G.hideEdge(e);\n }\n }\n }\n}\n\nbool findPathToAnyBlueAndColorItBlue(const Graph &G, GraphColoring &coloring, node start) {\n Queue<node> Q;\n Q.append(start);\n\n NodeArray<bool> visited(G, false);\n NodeArray<edge> accessEdge(G);\n\n node u, n;\n edge e;\n while(!Q.empty()) {\n u = Q.pop();\n\n if (coloring[u] == Color::BLUE && u != start) {\n \/\/ reconstruct path and go on\n edge ae;\n node n1, n2;\n for (n1 = u; n1 != start;) {\n \/\/ TODO: Use search edge instead?\n ae = accessEdge[n1];\n n2 = ae->opposite(n1);\n\n coloring[n1] = Color::BLUE;\n coloring[n2] = Color::BLUE;\n coloring[ae] = Color::BLUE;\n n1 = n2;\n }\n return true;\n }\n\n forall_adj_edges(e, u) {\n n = e->opposite(u);\n if (!visited[n]) {\n visited[n] = true;\n accessEdge[n] = e;\n Q.append(n);\n }\n }\n }\n\n return false;\n}\n\n\n\/**\n * @return bool True for successful reconnection, false otherwise\n *\/\nbool reconnectBlueSubgraph(Graph &G, const List<edge> &X, GraphColoring &coloring, node u, node v, edge c) {\n \/\/ if u has blue adjacent edges (except of c) AND v has blue adjacent edges (exc. of c) then\n \/\/ enumerate one blue subgraph, call it G_b1\n \/\/ create graph G_rest = G \\ X \\ G_r \\ G_b1 and BFS in it until blue is found\n \/\/ (or BFS (avoid red and X) from u to first blue edge not in G_b1)\n \/\/ -> path found, color it blue and continue\n \/\/ -> path not found, fail here (return;)\n\n G.hideEdge(c); \/\/ Don't consider c\n\n bool uaIsEmpty = true, vaIsEmpty = true;\n edge e;\n\n forall_adj_edges(e, u) {\n if (coloring[e] == Color::BLUE) {\n uaIsEmpty = false;\n break;\n }\n }\n\n forall_adj_edges(e, v) {\n if (coloring[e] == Color::BLUE) {\n vaIsEmpty = false;\n break;\n }\n }\n\n if (!uaIsEmpty && !vaIsEmpty) {\n \/\/ G_b has been disconnected, hide X, G_r and one component of blue subgraph (TODO: Maintain G_rest through the whole algorithm and not recompute here every time?)\n for(List<edge>::const_iterator it = X.begin(); it != X.end(); it++) G.hideEdge(*it);\n forall_edges(e, G) { if(coloring[e] == Color::RED) G.hideEdge(e); }\n hideConnectedBlueSubgraph(G, coloring, u);\n\n \/\/ BFS in G from u to the first found blue edge\n \/\/ -> not found => fail here\n \/\/ -> path found => color it blue and continue\n\n if (!findPathToAnyBlueAndColorItBlue(G, coloring, u)) {\n G.restoreAllEdges();\n return false;\n }\n\n\n } \/\/ else c is just a branch with a single leaf, nothing happened G_b stays connected\n\n G.restoreAllEdges();\n return true;\n}\n\n\nvoid GenCocircuits(List<List<edge>> &Cocircuits, Graph &G, GraphColoring coloring, List<edge> X, node red, node blue) {\n if (X.size() > cutSizeBound) return;\n\n \/\/ Find set D = (a short circuit C in G, s. t. |C ∩ X| = 1) \\ X\n List<edge> D = shortestPath(G, coloring, red, blue, X);\n\n if (D.size() > 0) {\n\n \/\/ for each c ∈ D, recursively call GenCocircuits(X ∪ {c}).\n for(List<edge>::iterator iterator = D.begin(); iterator != D.end(); iterator++) {\n edge c = *iterator;\n\n List<edge> newX = X;\n newX.pushBack(c);\n\n \/\/ Coloring red-c path red, determining u and v, coloring the rest blue\n node n1 = red, n2 = blue, \/\/ after the first of the following for cycles these are the\n \/\/ nodes of the last red edge (one of them has to be incident with c)\n \/\/ initialized to red and blue since the first for can have 0 iterations\n u, v; \/\/ c = (u,v), say u is red (and so will be all vertices on the path from the first red to u)\n\n for(List<edge>::iterator j = D.begin(); j != iterator; j++) {\n edge e = *j;\n\n n1 = e->source();\n n2 = e->target();\n\n coloring[n1] = Color::RED;\n coloring[n2] = Color::RED;\n coloring[e] = Color::RED;\n }\n\n \/\/ Determine u, v, s.t. u is really red and v blue\n if (c->source() == n1 || c->target() == n1) { \/\/ if n1 is in c then n1 == u\n u = n1;\n } else { \/\/ n2 is in c so n2 == u\n u = n2;\n }\n\n v = c->opposite(u);\n\n \/\/ Color the rest of the path blue\n for(List<edge>::iterator j = iterator.succ(); j != D.end(); j++) {\n edge e = *j;\n\n coloring[e->source()] = Color::BLUE;\n coloring[e->target()] = Color::BLUE;\n coloring[e] = Color::BLUE;\n }\n\n\n \/\/ If c = (u, v) is blue, reconnect blue subgraph (find the shortest path from u to v using only nonred edges)\n if (coloring[c] == Color::BLUE) {\n if(!reconnectBlueSubgraph(G, X, coloring, u, v, c)) { \/\/ can't reconnect: fail\n return;\n }\n }\n\n GenCocircuits(Cocircuits, G, coloring, newX, u, v);\n }\n\n } else {\n \/\/ If there is no such circuit C above (line 4), then return ‘Cocircuit: X’.\n Cocircuits.pushBack(X);\n }\n}\n\n\n\/**\n * Returns edges spanning forest of (possibly disconnected) graph G\n * @param G\n *\/\nList<edge> spanningEdges(const Graph &G) {\n EdgeArray<bool> isBackedge(G, false);\n\n List<edge> backedges;\n isAcyclicUndirected(G, backedges);\n\n for(List<edge>::iterator i = backedges.begin(); i != backedges.end(); i++) {\n isBackedge[*i] = true;\n }\n\n List<edge> spanningEdges;\n edge e;\n forall_edges(e, G) {\n if (!isBackedge[e]) {\n spanningEdges.pushBack(e);\n }\n }\n\n return spanningEdges;\n}\n\nvoid CircuitCocircuit(Graph &G, List<List<edge>> &cocircuits) {\n List<edge> base = spanningEdges(G);\n\n edge e;\n for(List<edge>::iterator i = base.begin(); i != base.end(); i++) {\n e = *i;\n List<edge> X; \/\/ (Indexes might be sufficient? Check later)\n GraphColoring coloring(G);\n X.pushBack(e);\n coloring[e->source()] = Color::RED;\n coloring[e->target()] = Color::BLUE;\n\n GenCocircuits(cocircuits, G, coloring, X, e->source(), e->target());\n }\n}\n\nint main(int argc, char* argv[])\n{\n if (argc != 3 || strcmp(argv[1], \"-h\") == 0 || strcmp(argv[1], \"--help\") == 0) {\n cout << \"Usage: \" << argv[0] << \" <graph.csv> <cocircuit size bound>\" << endl;\n exit(2);\n }\n\n \/\/ TODO: Read from stdin\n ifstream fEdges(argv[1]);\n if (!fEdges.is_open()) {\n cerr << \"Edges file doesn't exist or could not be accessed. Terminating.\" << endl;\n exit(3);\n }\n\n cutSizeBound = stoi(argv[2]);\n if (cutSizeBound < 1) {\n cerr << \"Cocircuit size bound lower than 1. Terminating.\" << endl;\n exit(4);\n }\n\n try {\n Graph G;\n csvToGraph(fEdges, G);\n\n List<List<edge>> cocircuits;\n CircuitCocircuit(G, cocircuits);\n\n for(List<List<edge> >::iterator it = cocircuits.begin(); it != cocircuits.end(); ++it) {\n cout << *it << endl;\n }\n\n } catch (invalid_argument *e) {\n cerr << \"Error: \" << e->what() << endl;\n return 1;\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <sstream>\n\n#include <sys\/select.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <netinet\/tcp.h>\n\n#include \"server.h\"\n\nusing namespace std;\n\nnamespace rpc {\n\nvoid ServerConnection::run_async(const std::function<void()>& f) {\n server_->threadpool_->run_async(f);\n}\n\nvoid ServerConnection::begin_reply(Request* req, i32 error_code \/* =... *\/) {\n out_l_.lock();\n\n bmark_ = this->out_.set_bookmark(sizeof(i32)); \/\/ will write reply size later\n\n *this << req->xid;\n *this << error_code;\n}\n\nvoid ServerConnection::end_reply() {\n \/\/ set reply size in packet\n if (bmark_ != NULL) {\n i32 reply_size = out_.get_and_reset_write_cnt();\n out_.write_bookmark(bmark_, &reply_size);\n out_.update_read_barrier();\n delete bmark_;\n bmark_ = NULL;\n }\n\n \/\/ always enable write events since the code above gauranteed there\n \/\/ will be some data to send\n server_->pollmgr_->update_mode(this, Pollable::READ | Pollable::WRITE);\n\n out_l_.unlock();\n}\n\nvoid ServerConnection::handle_read() {\n if (status_ == CLOSED) {\n return;\n }\n\n int bytes_read = in_.read_from_fd(socket_);\n if (bytes_read == 0) {\n return;\n }\n\n list<Request*> complete_requests;\n\n for (;;) {\n i32 packet_size;\n int n_peek = in_.peek(&packet_size, sizeof(i32));\n if (n_peek == sizeof(i32) && in_.content_size_gt(packet_size + sizeof(i32) - 1)) {\n \/\/ consume the packet size\n verify(in_.read(&packet_size, sizeof(i32)) == sizeof(i32));\n\n Request* req = new Request;\n verify(req->m.read_from_marshal(in_, packet_size) == (size_t) packet_size);\n\n if (packet_size < (int) sizeof(i64)) {\n Log::warn(\"rpc::ServerConnection: got an incomplete packet, xid not included\");\n\n \/\/ Since we don't have xid, we don't know how to notify client about the failure.\n \/\/ All we can do is simply cleanup resource.\n delete req;\n } else {\n req->m >> req->xid;\n complete_requests.push_back(req);\n }\n\n } else {\n \/\/ packet not complete or there's no more packet to process\n break;\n }\n }\n\n for (list<Request*>::iterator iter = complete_requests.begin(); iter != complete_requests.end(); ++iter) {\n Request* req = *iter;\n\n if (!req->m.content_size_gt(sizeof(i32) - 1)) {\n \/\/ rpc id not provided\n begin_reply(req, EINVAL);\n end_reply();\n delete req;\n continue;\n }\n\n i32 rpc_id;\n req->m >> rpc_id;\n\n unordered_map<i32, Server::Handler*>::iterator it = server_->handlers_.find(rpc_id);\n if (it != server_->handlers_.end()) {\n \/\/ the handler should delete req, and release server_connection refcopy.\n it->second->handle(req, (ServerConnection *) this->ref_copy());\n } else {\n Log::error(\"rpc::ServerConnection: no handler for rpc_id=%d\", rpc_id);\n begin_reply(req, ENOENT);\n end_reply();\n delete req;\n }\n }\n}\n\nvoid ServerConnection::handle_write(const io_ratelimit& rate) {\n if (status_ == CLOSED) {\n return;\n }\n\n out_l_.lock();\n Marshal::read_barrier barrier = out_.get_read_barrier();\n out_l_.unlock();\n\n out_.write_to_fd(socket_, barrier, rate);\n\n out_l_.lock();\n if (out_.empty()) {\n server_->pollmgr_->update_mode(this, Pollable::READ);\n }\n out_l_.unlock();\n}\n\nvoid ServerConnection::handle_error() {\n this->close();\n}\n\nvoid ServerConnection::close() {\n bool should_release = false;\n\n if (status_ == CONNECTED) {\n server_->sconns_l_.lock();\n unordered_set<ServerConnection*>::iterator it = server_->sconns_.find(this);\n if (it == server_->sconns_.end()) {\n \/\/ another thread has already calling close()\n server_->sconns_l_.unlock();\n return;\n }\n server_->sconns_.erase(it);\n\n \/\/ because we released this connection from server_->sconns_\n should_release = true;\n\n server_->pollmgr_->remove(this);\n server_->sconns_l_.unlock();\n\n Log::debug(\"rpc::ServerConnection: closed on fd=%d\", socket_);\n\n status_ = CLOSED;\n ::close(socket_);\n }\n\n \/\/ this call might actually DELETE this object, so we put it to the end of function\n if (should_release) {\n this->release();\n }\n}\n\nint ServerConnection::poll_mode() {\n int mode = Pollable::READ;\n out_l_.lock();\n if (!out_.empty()) {\n mode |= Pollable::WRITE;\n }\n out_l_.unlock();\n return mode;\n}\n\nServer::Server(PollMgr* pollmgr \/* =... *\/, ThreadPool* thrpool \/* =? *\/)\n : server_sock_(-1), status_(NEW) {\n\n \/\/ get rid of eclipse warning\n memset(&loop_th_, 0, sizeof(loop_th_));\n\n if (pollmgr == NULL) {\n poll_options opt;\n opt.n_threads = 8;\n pollmgr_ = new PollMgr(opt);\n } else {\n pollmgr_ = (PollMgr *) pollmgr->ref_copy();\n }\n\n if (thrpool == NULL) {\n threadpool_ = new ThreadPool;\n } else {\n threadpool_ = (ThreadPool *) thrpool->ref_copy();\n }\n}\n\nServer::~Server() {\n if (status_ == RUNNING) {\n status_ = STOPPING;\n \/\/ wait till accepting thread done\n Pthread_join(loop_th_, NULL);\n\n verify(server_sock_ == -1 && status_ == STOPPED);\n }\n\n sconns_l_.lock();\n vector<ServerConnection*> sconns(sconns_.begin(), sconns_.end());\n sconns_l_.unlock();\n\n for (vector<ServerConnection*>::iterator it = sconns.begin(); it != sconns.end(); ++it) {\n (*it)->close();\n }\n\n \/\/ always release ThreadPool before PollMgr, in case some running task want to access PollMgr\n threadpool_->release();\n pollmgr_->release();\n\n for (auto& it : handlers_) {\n delete it.second;\n }\n\n \/\/Log::debug(\"rpc::Server: destroyed\");\n}\n\nstruct start_server_loop_args_type {\n Server* server;\n struct addrinfo* gai_result;\n struct addrinfo* svr_addr;\n};\n\nvoid* Server::start_server_loop(void* arg) {\n start_server_loop_args_type* start_server_loop_args = (start_server_loop_args_type*) arg;\n\n start_server_loop_args->server->server_loop(start_server_loop_args->svr_addr);\n\n freeaddrinfo(start_server_loop_args->gai_result);\n delete start_server_loop_args;\n\n pthread_exit(NULL);\n return NULL;\n}\n\nvoid Server::server_loop(struct addrinfo* svr_addr) {\n fd_set fds;\n while (status_ == RUNNING) {\n FD_ZERO(&fds);\n FD_SET(server_sock_, &fds);\n\n \/\/ use select to avoid waiting on accept when closing server\n timeval tv;\n tv.tv_sec = 0;\n tv.tv_usec = 50 * 1000; \/\/ 0.05 sec\n int fdmax = server_sock_;\n\n int n_ready = select(fdmax + 1, &fds, NULL, NULL, &tv);\n if (n_ready == 0) {\n continue;\n }\n if (status_ != RUNNING) {\n break;\n }\n\n int clnt_socket = accept(server_sock_, svr_addr->ai_addr, &svr_addr->ai_addrlen);\n if (clnt_socket >= 0 && status_ == RUNNING) {\n Log::debug(\"rpc::Server: got new client, fd=%d\", clnt_socket);\n verify(set_nonblocking(clnt_socket, true) == 0);\n\n sconns_l_.lock();\n ServerConnection* sconn = new ServerConnection(this, clnt_socket);\n sconns_.insert(sconn);\n pollmgr_->add(sconn);\n sconns_l_.unlock();\n }\n }\n\n close(server_sock_);\n server_sock_ = -1;\n status_ = STOPPED;\n}\n\nint Server::start(const char* bind_addr) {\n string addr(bind_addr);\n size_t idx = addr.find(\":\");\n if (idx == string::npos) {\n Log::error(\"rpc::Server: bad bind address: %s\", bind_addr);\n errno = EINVAL;\n return -1;\n }\n string host = addr.substr(0, idx);\n string port = addr.substr(idx + 1);\n\n struct addrinfo hints, *result, *rp;\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_family = AF_INET; \/\/ ipv4\n hints.ai_socktype = SOCK_STREAM; \/\/ tcp\n hints.ai_flags = AI_PASSIVE; \/\/ server side\n\n int r = getaddrinfo((host == \"0.0.0.0\") ? NULL : host.c_str(), port.c_str(), &hints, &result);\n if (r != 0) {\n Log::error(\"rpc::Server: getaddrinfo(): %s\", gai_strerror(r));\n return -1;\n }\n\n for (rp = result; rp != NULL; rp = rp->ai_next) {\n server_sock_ = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);\n if (server_sock_ == -1) {\n continue;\n }\n\n const int yes = 1;\n verify(setsockopt(server_sock_, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes)) == 0);\n verify(setsockopt(server_sock_, IPPROTO_TCP, TCP_NODELAY, &yes, sizeof(yes)) == 0);\n\n if (::bind(server_sock_, rp->ai_addr, rp->ai_addrlen) == 0) {\n break;\n }\n close(server_sock_);\n server_sock_ = -1;\n }\n\n if (rp == NULL) {\n \/\/ failed to bind\n Log::error(\"rpc::Server: bind(): %s\", strerror(errno));\n freeaddrinfo(result);\n return -1;\n }\n\n \/\/ about backlog: http:\/\/www.linuxjournal.com\/files\/linuxjournal.com\/linuxjournal\/articles\/023\/2333\/2333s2.html\n const int backlog = SOMAXCONN;\n verify(listen(server_sock_, backlog) == 0);\n verify(set_nonblocking(server_sock_, true) == 0);\n\n status_ = RUNNING;\n Log::info(\"rpc::Server: started on %s\", bind_addr);\n\n start_server_loop_args_type* start_server_loop_args = new start_server_loop_args_type();\n start_server_loop_args->server = this;\n start_server_loop_args->gai_result = result;\n start_server_loop_args->svr_addr = rp;\n Pthread_create(&loop_th_, NULL, Server::start_server_loop, start_server_loop_args);\n\n return 0;\n}\n\nvoid Server::reg(i32 rpc_id, void (*svc_func)(Request*, ServerConnection*)) {\n \/\/ disallow duplicate rpc_id\n verify(handlers_.find(rpc_id) == handlers_.end());\n\n class H: public Handler {\n void (*svc_func_)(Request*, ServerConnection*);\n public:\n H(void (*svc_func)(Request*, ServerConnection*))\n : svc_func_(svc_func) {\n }\n void handle(Request* req, ServerConnection* sconn) {\n svc_func_(req, sconn);\n }\n };\n\n handlers_[rpc_id] = new H(svc_func);\n}\n\n}\n<commit_msg>hmm, dont have a good solution, use full locking now<commit_after>#include <string>\n#include <sstream>\n\n#include <sys\/select.h>\n#include <errno.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <netinet\/tcp.h>\n\n#include \"server.h\"\n\nusing namespace std;\n\nnamespace rpc {\n\nvoid ServerConnection::run_async(const std::function<void()>& f) {\n server_->threadpool_->run_async(f);\n}\n\nvoid ServerConnection::begin_reply(Request* req, i32 error_code \/* =... *\/) {\n out_l_.lock();\n\n bmark_ = this->out_.set_bookmark(sizeof(i32)); \/\/ will write reply size later\n\n *this << req->xid;\n *this << error_code;\n}\n\nvoid ServerConnection::end_reply() {\n \/\/ set reply size in packet\n if (bmark_ != NULL) {\n i32 reply_size = out_.get_and_reset_write_cnt();\n out_.write_bookmark(bmark_, &reply_size);\n out_.update_read_barrier();\n delete bmark_;\n bmark_ = NULL;\n }\n\n \/\/ always enable write events since the code above gauranteed there\n \/\/ will be some data to send\n server_->pollmgr_->update_mode(this, Pollable::READ | Pollable::WRITE);\n\n out_l_.unlock();\n}\n\nvoid ServerConnection::handle_read() {\n if (status_ == CLOSED) {\n return;\n }\n\n int bytes_read = in_.read_from_fd(socket_);\n if (bytes_read == 0) {\n return;\n }\n\n list<Request*> complete_requests;\n\n for (;;) {\n i32 packet_size;\n int n_peek = in_.peek(&packet_size, sizeof(i32));\n if (n_peek == sizeof(i32) && in_.content_size_gt(packet_size + sizeof(i32) - 1)) {\n \/\/ consume the packet size\n verify(in_.read(&packet_size, sizeof(i32)) == sizeof(i32));\n\n Request* req = new Request;\n verify(req->m.read_from_marshal(in_, packet_size) == (size_t) packet_size);\n\n if (packet_size < (int) sizeof(i64)) {\n Log::warn(\"rpc::ServerConnection: got an incomplete packet, xid not included\");\n\n \/\/ Since we don't have xid, we don't know how to notify client about the failure.\n \/\/ All we can do is simply cleanup resource.\n delete req;\n } else {\n req->m >> req->xid;\n complete_requests.push_back(req);\n }\n\n } else {\n \/\/ packet not complete or there's no more packet to process\n break;\n }\n }\n\n for (list<Request*>::iterator iter = complete_requests.begin(); iter != complete_requests.end(); ++iter) {\n Request* req = *iter;\n\n if (!req->m.content_size_gt(sizeof(i32) - 1)) {\n \/\/ rpc id not provided\n begin_reply(req, EINVAL);\n end_reply();\n delete req;\n continue;\n }\n\n i32 rpc_id;\n req->m >> rpc_id;\n\n unordered_map<i32, Server::Handler*>::iterator it = server_->handlers_.find(rpc_id);\n if (it != server_->handlers_.end()) {\n \/\/ the handler should delete req, and release server_connection refcopy.\n it->second->handle(req, (ServerConnection *) this->ref_copy());\n } else {\n Log::error(\"rpc::ServerConnection: no handler for rpc_id=%d\", rpc_id);\n begin_reply(req, ENOENT);\n end_reply();\n delete req;\n }\n }\n}\n\nvoid ServerConnection::handle_write(const io_ratelimit& rate) {\n if (status_ == CLOSED) {\n return;\n }\n\n out_l_.lock();\n Marshal::read_barrier barrier = out_.get_read_barrier();\n\/\/ out_l_.unlock();\n\n out_.write_to_fd(socket_, barrier, rate);\n\n\/\/ out_l_.lock();\n if (out_.empty()) {\n server_->pollmgr_->update_mode(this, Pollable::READ);\n }\n out_l_.unlock();\n}\n\nvoid ServerConnection::handle_error() {\n this->close();\n}\n\nvoid ServerConnection::close() {\n bool should_release = false;\n\n if (status_ == CONNECTED) {\n server_->sconns_l_.lock();\n unordered_set<ServerConnection*>::iterator it = server_->sconns_.find(this);\n if (it == server_->sconns_.end()) {\n \/\/ another thread has already calling close()\n server_->sconns_l_.unlock();\n return;\n }\n server_->sconns_.erase(it);\n\n \/\/ because we released this connection from server_->sconns_\n should_release = true;\n\n server_->pollmgr_->remove(this);\n server_->sconns_l_.unlock();\n\n Log::debug(\"rpc::ServerConnection: closed on fd=%d\", socket_);\n\n status_ = CLOSED;\n ::close(socket_);\n }\n\n \/\/ this call might actually DELETE this object, so we put it to the end of function\n if (should_release) {\n this->release();\n }\n}\n\nint ServerConnection::poll_mode() {\n int mode = Pollable::READ;\n out_l_.lock();\n if (!out_.empty()) {\n mode |= Pollable::WRITE;\n }\n out_l_.unlock();\n return mode;\n}\n\nServer::Server(PollMgr* pollmgr \/* =... *\/, ThreadPool* thrpool \/* =? *\/)\n : server_sock_(-1), status_(NEW) {\n\n \/\/ get rid of eclipse warning\n memset(&loop_th_, 0, sizeof(loop_th_));\n\n if (pollmgr == NULL) {\n poll_options opt;\n opt.n_threads = 8;\n pollmgr_ = new PollMgr(opt);\n } else {\n pollmgr_ = (PollMgr *) pollmgr->ref_copy();\n }\n\n if (thrpool == NULL) {\n threadpool_ = new ThreadPool;\n } else {\n threadpool_ = (ThreadPool *) thrpool->ref_copy();\n }\n}\n\nServer::~Server() {\n if (status_ == RUNNING) {\n status_ = STOPPING;\n \/\/ wait till accepting thread done\n Pthread_join(loop_th_, NULL);\n\n verify(server_sock_ == -1 && status_ == STOPPED);\n }\n\n sconns_l_.lock();\n vector<ServerConnection*> sconns(sconns_.begin(), sconns_.end());\n sconns_l_.unlock();\n\n for (vector<ServerConnection*>::iterator it = sconns.begin(); it != sconns.end(); ++it) {\n (*it)->close();\n }\n\n \/\/ always release ThreadPool before PollMgr, in case some running task want to access PollMgr\n threadpool_->release();\n pollmgr_->release();\n\n for (auto& it : handlers_) {\n delete it.second;\n }\n\n \/\/Log::debug(\"rpc::Server: destroyed\");\n}\n\nstruct start_server_loop_args_type {\n Server* server;\n struct addrinfo* gai_result;\n struct addrinfo* svr_addr;\n};\n\nvoid* Server::start_server_loop(void* arg) {\n start_server_loop_args_type* start_server_loop_args = (start_server_loop_args_type*) arg;\n\n start_server_loop_args->server->server_loop(start_server_loop_args->svr_addr);\n\n freeaddrinfo(start_server_loop_args->gai_result);\n delete start_server_loop_args;\n\n pthread_exit(NULL);\n return NULL;\n}\n\nvoid Server::server_loop(struct addrinfo* svr_addr) {\n fd_set fds;\n while (status_ == RUNNING) {\n FD_ZERO(&fds);\n FD_SET(server_sock_, &fds);\n\n \/\/ use select to avoid waiting on accept when closing server\n timeval tv;\n tv.tv_sec = 0;\n tv.tv_usec = 50 * 1000; \/\/ 0.05 sec\n int fdmax = server_sock_;\n\n int n_ready = select(fdmax + 1, &fds, NULL, NULL, &tv);\n if (n_ready == 0) {\n continue;\n }\n if (status_ != RUNNING) {\n break;\n }\n\n int clnt_socket = accept(server_sock_, svr_addr->ai_addr, &svr_addr->ai_addrlen);\n if (clnt_socket >= 0 && status_ == RUNNING) {\n Log::debug(\"rpc::Server: got new client, fd=%d\", clnt_socket);\n verify(set_nonblocking(clnt_socket, true) == 0);\n\n sconns_l_.lock();\n ServerConnection* sconn = new ServerConnection(this, clnt_socket);\n sconns_.insert(sconn);\n pollmgr_->add(sconn);\n sconns_l_.unlock();\n }\n }\n\n close(server_sock_);\n server_sock_ = -1;\n status_ = STOPPED;\n}\n\nint Server::start(const char* bind_addr) {\n string addr(bind_addr);\n size_t idx = addr.find(\":\");\n if (idx == string::npos) {\n Log::error(\"rpc::Server: bad bind address: %s\", bind_addr);\n errno = EINVAL;\n return -1;\n }\n string host = addr.substr(0, idx);\n string port = addr.substr(idx + 1);\n\n struct addrinfo hints, *result, *rp;\n memset(&hints, 0, sizeof(struct addrinfo));\n\n hints.ai_family = AF_INET; \/\/ ipv4\n hints.ai_socktype = SOCK_STREAM; \/\/ tcp\n hints.ai_flags = AI_PASSIVE; \/\/ server side\n\n int r = getaddrinfo((host == \"0.0.0.0\") ? NULL : host.c_str(), port.c_str(), &hints, &result);\n if (r != 0) {\n Log::error(\"rpc::Server: getaddrinfo(): %s\", gai_strerror(r));\n return -1;\n }\n\n for (rp = result; rp != NULL; rp = rp->ai_next) {\n server_sock_ = socket(rp->ai_family, rp->ai_socktype, rp->ai_protocol);\n if (server_sock_ == -1) {\n continue;\n }\n\n const int yes = 1;\n verify(setsockopt(server_sock_, SOL_SOCKET, SO_REUSEADDR, &yes, sizeof(yes)) == 0);\n verify(setsockopt(server_sock_, IPPROTO_TCP, TCP_NODELAY, &yes, sizeof(yes)) == 0);\n\n if (::bind(server_sock_, rp->ai_addr, rp->ai_addrlen) == 0) {\n break;\n }\n close(server_sock_);\n server_sock_ = -1;\n }\n\n if (rp == NULL) {\n \/\/ failed to bind\n Log::error(\"rpc::Server: bind(): %s\", strerror(errno));\n freeaddrinfo(result);\n return -1;\n }\n\n \/\/ about backlog: http:\/\/www.linuxjournal.com\/files\/linuxjournal.com\/linuxjournal\/articles\/023\/2333\/2333s2.html\n const int backlog = SOMAXCONN;\n verify(listen(server_sock_, backlog) == 0);\n verify(set_nonblocking(server_sock_, true) == 0);\n\n status_ = RUNNING;\n Log::info(\"rpc::Server: started on %s\", bind_addr);\n\n start_server_loop_args_type* start_server_loop_args = new start_server_loop_args_type();\n start_server_loop_args->server = this;\n start_server_loop_args->gai_result = result;\n start_server_loop_args->svr_addr = rp;\n Pthread_create(&loop_th_, NULL, Server::start_server_loop, start_server_loop_args);\n\n return 0;\n}\n\nvoid Server::reg(i32 rpc_id, void (*svc_func)(Request*, ServerConnection*)) {\n \/\/ disallow duplicate rpc_id\n verify(handlers_.find(rpc_id) == handlers_.end());\n\n class H: public Handler {\n void (*svc_func_)(Request*, ServerConnection*);\n public:\n H(void (*svc_func)(Request*, ServerConnection*))\n : svc_func_(svc_func) {\n }\n void handle(Request* req, ServerConnection* sconn) {\n svc_func_(req, sconn);\n }\n };\n\n handlers_[rpc_id] = new H(svc_func);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"host\/ui\/main_window.h\"\n\n#include \"base\/net\/address.h\"\n#include \"base\/peer\/host_id.h\"\n#include \"base\/strings\/unicode.h\"\n#include \"common\/ui\/about_dialog.h\"\n#include \"common\/ui\/language_action.h\"\n#include \"common\/ui\/status_dialog.h\"\n#include \"host\/user_session_agent.h\"\n#include \"host\/user_session_agent_proxy.h\"\n#include \"host\/user_session_window_proxy.h\"\n#include \"host\/ui\/application.h\"\n#include \"host\/ui\/config_dialog.h\"\n#include \"host\/ui\/notifier_window.h\"\n#include \"qt_base\/qt_logging.h\"\n\n#include <QCloseEvent>\n#include <QDesktopServices>\n#include <QMessageBox>\n#include <QUrl>\n\nnamespace host {\n\nMainWindow::MainWindow(QWidget* parent)\n : QMainWindow(parent),\n window_proxy_(std::make_shared<UserSessionWindowProxy>(\n qt_base::Application::uiTaskRunner(), this))\n{\n LOG(LS_INFO) << \"MainWindow Ctor\";\n\n ui.setupUi(this);\n setWindowFlag(Qt::WindowMaximizeButtonHint, false);\n\n ui.edit_id->setText(QStringLiteral(\"-\"));\n ui.edit_password->setText(QStringLiteral(\"-\"));\n\n tray_menu_.addAction(ui.action_settings);\n tray_menu_.addSeparator();\n tray_menu_.addAction(ui.action_show_hide);\n tray_menu_.addAction(ui.action_exit);\n\n tray_icon_.setIcon(QIcon(QStringLiteral(\":\/img\/main.png\")));\n tray_icon_.setToolTip(tr(\"Aspia Host\"));\n tray_icon_.setContextMenu(&tray_menu_);\n tray_icon_.show();\n\n createLanguageMenu(Application::instance()->settings().locale());\n\n connect(&tray_icon_, &QSystemTrayIcon::activated, this, [this](QSystemTrayIcon::ActivationReason reason)\n {\n if (reason == QSystemTrayIcon::Context)\n return;\n\n onShowHide();\n });\n\n connect(ui.menu_language, &QMenu::triggered, this, &MainWindow::onLanguageChanged);\n connect(ui.action_settings, &QAction::triggered, this, &MainWindow::onSettings);\n connect(ui.action_show_hide, &QAction::triggered, this, &MainWindow::onShowHide);\n connect(ui.action_exit, &QAction::triggered, this, &MainWindow::onExit);\n connect(ui.action_help, &QAction::triggered, this, &MainWindow::onHelp);\n connect(ui.action_about, &QAction::triggered, this, &MainWindow::onAbout);\n\n setFixedHeight(sizeHint().height());\n\n connect(ui.button_new_password, &QPushButton::clicked, this, [this]()\n {\n if (agent_proxy_)\n agent_proxy_->updateCredentials(proto::internal::CredentialsRequest::NEW_PASSWORD);\n });\n}\n\nMainWindow::~MainWindow()\n{\n LOG(LS_INFO) << \"MainWindow Dtor\";\n}\n\nvoid MainWindow::connectToService()\n{\n agent_proxy_ = std::make_unique<UserSessionAgentProxy>(\n qt_base::Application::ioTaskRunner(), std::make_unique<UserSessionAgent>(window_proxy_));\n\n LOG(LS_INFO) << \"Connecting to service\";\n agent_proxy_->start();\n}\n\nvoid MainWindow::activateHost()\n{\n LOG(LS_INFO) << \"Activating host\";\n show();\n activateWindow();\n connectToService();\n}\n\nvoid MainWindow::hideToTray()\n{\n ui.action_show_hide->setText(tr(\"Show\"));\n setVisible(false);\n}\n\nvoid MainWindow::closeEvent(QCloseEvent* event)\n{\n if (!should_be_quit_)\n {\n hideToTray();\n event->ignore();\n }\n else\n {\n window_proxy_->dettach();\n\n if (notifier_)\n notifier_->close();\n\n QApplication::quit();\n }\n}\n\nvoid MainWindow::onStatusChanged(UserSessionAgent::Status status)\n{\n if (status == UserSessionAgent::Status::CONNECTED_TO_SERVICE)\n {\n LOG(LS_INFO) << \"The connection to the service was successfully established.\";\n }\n else if (status == UserSessionAgent::Status::DISCONNECTED_FROM_SERVICE)\n {\n agent_proxy_.reset();\n\n LOG(LS_INFO) << \"The connection to the service is lost. The application will be closed.\";\n realClose();\n }\n else if (status == UserSessionAgent::Status::SERVICE_NOT_AVAILABLE)\n {\n agent_proxy_.reset();\n\n LOG(LS_INFO) << \"The connection to the service has not been established. \"\n << \"The application works offline.\";\n }\n else\n {\n LOG(LS_WARNING) << \"Unandled status code: \" << static_cast<int>(status);\n }\n}\n\nvoid MainWindow::onClientListChanged(const UserSessionAgent::ClientList& clients)\n{\n if (!notifier_)\n {\n LOG(LS_INFO) << \"Create NotifierWindow\";\n notifier_ = new NotifierWindow();\n\n connect(notifier_, &NotifierWindow::killSession, this, [this](uint32_t id)\n {\n if (agent_proxy_)\n agent_proxy_->killClient(id);\n });\n\n notifier_->setAttribute(Qt::WA_DeleteOnClose);\n notifier_->show();\n notifier_->activateWindow();\n }\n else\n {\n LOG(LS_INFO) << \"NotifierWindow already exists\";\n }\n\n notifier_->onClientListChanged(clients);\n}\n\nvoid MainWindow::onCredentialsChanged(const proto::internal::Credentials& credentials)\n{\n ui.button_new_password->setEnabled(true);\n\n bool has_id = credentials.host_id() != base::kInvalidHostId;\n\n ui.label_icon_id->setEnabled(has_id);\n ui.label_id->setEnabled(has_id);\n ui.edit_id->setEnabled(has_id);\n ui.edit_id->setText(has_id ? QString::number(credentials.host_id()) : tr(\"Not available\"));\n\n bool has_password = !credentials.password().empty();\n\n ui.label_icon_password->setEnabled(has_password);\n ui.label_password->setEnabled(has_password);\n ui.edit_password->setEnabled(has_password);\n ui.edit_password->setText(QString::fromStdString(credentials.password()));\n}\n\nvoid MainWindow::onRouterStateChanged(const proto::internal::RouterState& state)\n{\n last_state_ = state.state();\n\n QString router;\n\n if (state.state() != proto::internal::RouterState::DISABLED)\n {\n base::Address address(DEFAULT_ROUTER_TCP_PORT);\n address.setHost(base::utf16FromUtf8(state.host_name()));\n address.setPort(static_cast<uint16_t>(state.host_port()));\n\n router = QString::fromStdU16String(address.toString());\n }\n\n if (state.state() == proto::internal::RouterState::DISABLED)\n ui.button_status->setEnabled(false);\n else\n ui.button_status->setEnabled(true);\n\n if (state.state() != proto::internal::RouterState::CONNECTED)\n {\n ui.label_icon_id->setEnabled(false);\n ui.label_icon_password->setEnabled(false);\n ui.button_new_password->setEnabled(false);\n\n ui.edit_id->setText(\"-\");\n ui.edit_password->setText(\"-\");\n }\n else\n {\n ui.button_status->setEnabled(true);\n }\n\n QString status;\n\n switch (state.state())\n {\n case proto::internal::RouterState::DISABLED:\n status = tr(\"Router is disabled\");\n break;\n\n case proto::internal::RouterState::CONNECTING:\n status = tr(\"Connecting to a router %1...\").arg(router);\n break;\n\n case proto::internal::RouterState::CONNECTED:\n status = tr(\"Connected to a router %1\").arg(router);\n break;\n\n case proto::internal::RouterState::FAILED:\n status = tr(\"Failed to connect to router %1\").arg(router);\n break;\n\n default:\n NOTREACHED();\n return;\n }\n\n updateStatusBar();\n\n if (!status_dialog_)\n {\n status_dialog_ = new common::StatusDialog(this);\n\n connect(ui.button_status, &QPushButton::clicked,\n status_dialog_, &common::StatusDialog::show);\n }\n\n status_dialog_->addMessage(status);\n}\n\nvoid MainWindow::realClose()\n{\n should_be_quit_ = true;\n close();\n}\n\nvoid MainWindow::onLanguageChanged(QAction* action)\n{\n QString new_locale = static_cast<common::LanguageAction*>(action)->locale();\n Application* application = Application::instance();\n\n application->settings().setLocale(new_locale);\n application->setLocale(new_locale);\n\n ui.retranslateUi(this);\n\n if (status_dialog_)\n status_dialog_->retranslateUi();\n\n updateStatusBar();\n\n if (agent_proxy_)\n agent_proxy_->updateCredentials(proto::internal::CredentialsRequest::REFRESH);\n}\n\nvoid MainWindow::onSettings()\n{\n QApplication::setQuitOnLastWindowClosed(false);\n ConfigDialog(this).exec();\n QApplication::setQuitOnLastWindowClosed(true);\n}\n\nvoid MainWindow::onShowHide()\n{\n if (isVisible())\n {\n ui.action_show_hide->setText(tr(\"Show\"));\n setVisible(false);\n }\n else\n {\n ui.action_show_hide->setText(tr(\"Hide\"));\n setVisible(true);\n }\n}\n\nvoid MainWindow::onHelp()\n{\n QDesktopServices::openUrl(QUrl(QStringLiteral(\"https:\/\/aspia.org\/help\")));\n}\n\nvoid MainWindow::onAbout()\n{\n QApplication::setQuitOnLastWindowClosed(false);\n common::AboutDialog(this).exec();\n QApplication::setQuitOnLastWindowClosed(true);\n}\n\nvoid MainWindow::onExit()\n{\n \/\/ If the connection to the service is not established, then exit immediately.\n if (!agent_proxy_)\n {\n realClose();\n return;\n }\n\n QApplication::setQuitOnLastWindowClosed(false);\n\n int button = QMessageBox::question(\n this,\n tr(\"Confirmation\"),\n tr(\"If you exit from Aspia, it will not be possible to connect to this computer until \"\n \"you turn on the computer or Aspia again manually. Do you really want to exit the \"\n \"application?\"),\n QMessageBox::Yes,\n QMessageBox::No);\n\n QApplication::setQuitOnLastWindowClosed(true);\n\n if (button == QMessageBox::Yes)\n {\n if (!notifier_)\n {\n realClose();\n }\n else\n {\n connect(notifier_, &NotifierWindow::finished, this, &MainWindow::realClose);\n notifier_->disconnectAll();\n }\n }\n}\n\nvoid MainWindow::createLanguageMenu(const QString& current_locale)\n{\n QActionGroup* language_group = new QActionGroup(this);\n\n for (const auto& locale : qt_base::Application::instance()->localeList())\n {\n common::LanguageAction* action_language =\n new common::LanguageAction(locale.first, locale.second, this);\n\n action_language->setActionGroup(language_group);\n action_language->setCheckable(true);\n\n if (current_locale == locale.first)\n action_language->setChecked(true);\n\n ui.menu_language->addAction(action_language);\n }\n}\n\nvoid MainWindow::updateStatusBar()\n{\n QString message;\n QString icon;\n\n switch (last_state_)\n {\n case proto::internal::RouterState::DISABLED:\n message = tr(\"Router is disabled\");\n icon = QStringLiteral(\":\/img\/cross-script.png\");\n break;\n\n case proto::internal::RouterState::CONNECTING:\n message = tr(\"Connecting to a router...\");\n icon = QStringLiteral(\":\/img\/arrow-circle-double.png\");\n break;\n\n case proto::internal::RouterState::CONNECTED:\n message = tr(\"Connected to a router\");\n icon = QStringLiteral(\":\/img\/tick.png\");\n break;\n\n case proto::internal::RouterState::FAILED:\n message = tr(\"Connection error\");\n icon = QStringLiteral(\":\/img\/cross-script.png\");\n break;\n\n default:\n NOTREACHED();\n return;\n }\n\n ui.button_status->setText(message);\n ui.button_status->setIcon(QIcon(icon));\n}\n\n} \/\/ namespace host\n<commit_msg>Do not reconnect to the service if the connection is already established.<commit_after>\/\/\n\/\/ Aspia Project\n\/\/ Copyright (C) 2020 Dmitry Chapyshev <dmitry@aspia.ru>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <https:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include \"host\/ui\/main_window.h\"\n\n#include \"base\/net\/address.h\"\n#include \"base\/peer\/host_id.h\"\n#include \"base\/strings\/unicode.h\"\n#include \"common\/ui\/about_dialog.h\"\n#include \"common\/ui\/language_action.h\"\n#include \"common\/ui\/status_dialog.h\"\n#include \"host\/user_session_agent.h\"\n#include \"host\/user_session_agent_proxy.h\"\n#include \"host\/user_session_window_proxy.h\"\n#include \"host\/ui\/application.h\"\n#include \"host\/ui\/config_dialog.h\"\n#include \"host\/ui\/notifier_window.h\"\n#include \"qt_base\/qt_logging.h\"\n\n#include <QCloseEvent>\n#include <QDesktopServices>\n#include <QMessageBox>\n#include <QUrl>\n\nnamespace host {\n\nMainWindow::MainWindow(QWidget* parent)\n : QMainWindow(parent),\n window_proxy_(std::make_shared<UserSessionWindowProxy>(\n qt_base::Application::uiTaskRunner(), this))\n{\n LOG(LS_INFO) << \"MainWindow Ctor\";\n\n ui.setupUi(this);\n setWindowFlag(Qt::WindowMaximizeButtonHint, false);\n\n ui.edit_id->setText(QStringLiteral(\"-\"));\n ui.edit_password->setText(QStringLiteral(\"-\"));\n\n tray_menu_.addAction(ui.action_settings);\n tray_menu_.addSeparator();\n tray_menu_.addAction(ui.action_show_hide);\n tray_menu_.addAction(ui.action_exit);\n\n tray_icon_.setIcon(QIcon(QStringLiteral(\":\/img\/main.png\")));\n tray_icon_.setToolTip(tr(\"Aspia Host\"));\n tray_icon_.setContextMenu(&tray_menu_);\n tray_icon_.show();\n\n createLanguageMenu(Application::instance()->settings().locale());\n\n connect(&tray_icon_, &QSystemTrayIcon::activated, this, [this](QSystemTrayIcon::ActivationReason reason)\n {\n if (reason == QSystemTrayIcon::Context)\n return;\n\n onShowHide();\n });\n\n connect(ui.menu_language, &QMenu::triggered, this, &MainWindow::onLanguageChanged);\n connect(ui.action_settings, &QAction::triggered, this, &MainWindow::onSettings);\n connect(ui.action_show_hide, &QAction::triggered, this, &MainWindow::onShowHide);\n connect(ui.action_exit, &QAction::triggered, this, &MainWindow::onExit);\n connect(ui.action_help, &QAction::triggered, this, &MainWindow::onHelp);\n connect(ui.action_about, &QAction::triggered, this, &MainWindow::onAbout);\n\n setFixedHeight(sizeHint().height());\n\n connect(ui.button_new_password, &QPushButton::clicked, this, [this]()\n {\n if (agent_proxy_)\n agent_proxy_->updateCredentials(proto::internal::CredentialsRequest::NEW_PASSWORD);\n });\n}\n\nMainWindow::~MainWindow()\n{\n LOG(LS_INFO) << \"MainWindow Dtor\";\n}\n\nvoid MainWindow::connectToService()\n{\n if (agent_proxy_)\n {\n LOG(LS_INFO) << \"Already connected to service\";\n agent_proxy_->updateCredentials(proto::internal::CredentialsRequest::REFRESH);\n }\n else\n {\n agent_proxy_ = std::make_unique<UserSessionAgentProxy>(\n qt_base::Application::ioTaskRunner(), std::make_unique<UserSessionAgent>(window_proxy_));\n\n LOG(LS_INFO) << \"Connecting to service\";\n agent_proxy_->start();\n }\n}\n\nvoid MainWindow::activateHost()\n{\n LOG(LS_INFO) << \"Activating host\";\n\n show();\n activateWindow();\n connectToService();\n}\n\nvoid MainWindow::hideToTray()\n{\n LOG(LS_INFO) << \"Hide application to system tray\";\n\n ui.action_show_hide->setText(tr(\"Show\"));\n setVisible(false);\n}\n\nvoid MainWindow::closeEvent(QCloseEvent* event)\n{\n if (!should_be_quit_)\n {\n LOG(LS_INFO) << \"Ignored close event\";\n\n hideToTray();\n event->ignore();\n }\n else\n {\n window_proxy_->dettach();\n\n if (notifier_)\n {\n LOG(LS_INFO) << \"Close notifier window\";\n notifier_->close();\n }\n\n LOG(LS_INFO) << \"Application quit\";\n QApplication::quit();\n }\n}\n\nvoid MainWindow::onStatusChanged(UserSessionAgent::Status status)\n{\n if (status == UserSessionAgent::Status::CONNECTED_TO_SERVICE)\n {\n LOG(LS_INFO) << \"The connection to the service was successfully established.\";\n }\n else if (status == UserSessionAgent::Status::DISCONNECTED_FROM_SERVICE)\n {\n agent_proxy_.reset();\n\n LOG(LS_INFO) << \"The connection to the service is lost. The application will be closed.\";\n realClose();\n }\n else if (status == UserSessionAgent::Status::SERVICE_NOT_AVAILABLE)\n {\n agent_proxy_.reset();\n\n LOG(LS_INFO) << \"The connection to the service has not been established. \"\n << \"The application works offline.\";\n }\n else\n {\n LOG(LS_WARNING) << \"Unandled status code: \" << static_cast<int>(status);\n }\n}\n\nvoid MainWindow::onClientListChanged(const UserSessionAgent::ClientList& clients)\n{\n if (!notifier_)\n {\n LOG(LS_INFO) << \"Create NotifierWindow\";\n notifier_ = new NotifierWindow();\n\n connect(notifier_, &NotifierWindow::killSession, this, [this](uint32_t id)\n {\n if (agent_proxy_)\n {\n LOG(LS_INFO) << \"Killing session with ID: \" << id;\n agent_proxy_->killClient(id);\n }\n else\n {\n LOG(LS_WARNING) << \"No agent proxy\";\n }\n });\n\n notifier_->setAttribute(Qt::WA_DeleteOnClose);\n notifier_->show();\n notifier_->activateWindow();\n }\n else\n {\n LOG(LS_INFO) << \"NotifierWindow already exists\";\n }\n\n notifier_->onClientListChanged(clients);\n}\n\nvoid MainWindow::onCredentialsChanged(const proto::internal::Credentials& credentials)\n{\n ui.button_new_password->setEnabled(true);\n\n bool has_id = credentials.host_id() != base::kInvalidHostId;\n\n ui.label_icon_id->setEnabled(has_id);\n ui.label_id->setEnabled(has_id);\n ui.edit_id->setEnabled(has_id);\n ui.edit_id->setText(has_id ? QString::number(credentials.host_id()) : tr(\"Not available\"));\n\n bool has_password = !credentials.password().empty();\n\n ui.label_icon_password->setEnabled(has_password);\n ui.label_password->setEnabled(has_password);\n ui.edit_password->setEnabled(has_password);\n ui.edit_password->setText(QString::fromStdString(credentials.password()));\n}\n\nvoid MainWindow::onRouterStateChanged(const proto::internal::RouterState& state)\n{\n last_state_ = state.state();\n\n QString router;\n\n if (state.state() != proto::internal::RouterState::DISABLED)\n {\n base::Address address(DEFAULT_ROUTER_TCP_PORT);\n address.setHost(base::utf16FromUtf8(state.host_name()));\n address.setPort(static_cast<uint16_t>(state.host_port()));\n\n router = QString::fromStdU16String(address.toString());\n }\n\n if (state.state() == proto::internal::RouterState::DISABLED)\n ui.button_status->setEnabled(false);\n else\n ui.button_status->setEnabled(true);\n\n if (state.state() != proto::internal::RouterState::CONNECTED)\n {\n ui.label_icon_id->setEnabled(false);\n ui.label_icon_password->setEnabled(false);\n ui.button_new_password->setEnabled(false);\n\n ui.edit_id->setText(QStringLiteral(\"-\"));\n ui.edit_password->setText(QStringLiteral(\"-\"));\n }\n else\n {\n ui.button_status->setEnabled(true);\n }\n\n QString status;\n\n switch (state.state())\n {\n case proto::internal::RouterState::DISABLED:\n status = tr(\"Router is disabled\");\n break;\n\n case proto::internal::RouterState::CONNECTING:\n status = tr(\"Connecting to a router %1...\").arg(router);\n break;\n\n case proto::internal::RouterState::CONNECTED:\n status = tr(\"Connected to a router %1\").arg(router);\n break;\n\n case proto::internal::RouterState::FAILED:\n status = tr(\"Failed to connect to router %1\").arg(router);\n break;\n\n default:\n NOTREACHED();\n return;\n }\n\n updateStatusBar();\n\n if (!status_dialog_)\n {\n status_dialog_ = new common::StatusDialog(this);\n\n connect(ui.button_status, &QPushButton::clicked,\n status_dialog_, &common::StatusDialog::show);\n }\n\n status_dialog_->addMessage(status);\n}\n\nvoid MainWindow::realClose()\n{\n LOG(LS_INFO) << \"realClose called\";\n\n should_be_quit_ = true;\n close();\n}\n\nvoid MainWindow::onLanguageChanged(QAction* action)\n{\n QString new_locale = static_cast<common::LanguageAction*>(action)->locale();\n\n LOG(LS_INFO) << \"Language changed: \" << new_locale;\n\n Application* application = Application::instance();\n\n application->settings().setLocale(new_locale);\n application->setLocale(new_locale);\n\n ui.retranslateUi(this);\n\n if (status_dialog_)\n status_dialog_->retranslateUi();\n\n updateStatusBar();\n\n if (agent_proxy_)\n {\n agent_proxy_->updateCredentials(proto::internal::CredentialsRequest::REFRESH);\n }\n else\n {\n LOG(LS_WARNING) << \"No agent proxy\";\n }\n}\n\nvoid MainWindow::onSettings()\n{\n LOG(LS_INFO) << \"Settings dialog open\";\n\n QApplication::setQuitOnLastWindowClosed(false);\n ConfigDialog(this).exec();\n QApplication::setQuitOnLastWindowClosed(true);\n\n LOG(LS_INFO) << \"Settings dialog close\";\n}\n\nvoid MainWindow::onShowHide()\n{\n if (isVisible())\n {\n ui.action_show_hide->setText(tr(\"Show\"));\n setVisible(false);\n }\n else\n {\n ui.action_show_hide->setText(tr(\"Hide\"));\n setVisible(true);\n }\n}\n\nvoid MainWindow::onHelp()\n{\n QDesktopServices::openUrl(QUrl(QStringLiteral(\"https:\/\/aspia.org\/help\")));\n}\n\nvoid MainWindow::onAbout()\n{\n LOG(LS_INFO) << \"About dialog open\";\n\n QApplication::setQuitOnLastWindowClosed(false);\n common::AboutDialog(this).exec();\n QApplication::setQuitOnLastWindowClosed(true);\n\n LOG(LS_INFO) << \"About dialog close\";\n}\n\nvoid MainWindow::onExit()\n{\n \/\/ If the connection to the service is not established, then exit immediately.\n if (!agent_proxy_)\n {\n LOG(LS_INFO) << \"No agent proxy\";\n realClose();\n return;\n }\n\n QApplication::setQuitOnLastWindowClosed(false);\n\n int button = QMessageBox::question(\n this,\n tr(\"Confirmation\"),\n tr(\"If you exit from Aspia, it will not be possible to connect to this computer until \"\n \"you turn on the computer or Aspia again manually. Do you really want to exit the \"\n \"application?\"),\n QMessageBox::Yes,\n QMessageBox::No);\n\n QApplication::setQuitOnLastWindowClosed(true);\n\n if (button == QMessageBox::Yes)\n {\n if (!notifier_)\n {\n LOG(LS_INFO) << \"No notifier\";\n realClose();\n }\n else\n {\n LOG(LS_INFO) << \"Has notifier. Application will be terminated after disconnecting all clients\";\n connect(notifier_, &NotifierWindow::finished, this, &MainWindow::realClose);\n notifier_->disconnectAll();\n }\n }\n}\n\nvoid MainWindow::createLanguageMenu(const QString& current_locale)\n{\n QActionGroup* language_group = new QActionGroup(this);\n\n for (const auto& locale : qt_base::Application::instance()->localeList())\n {\n common::LanguageAction* action_language =\n new common::LanguageAction(locale.first, locale.second, this);\n\n action_language->setActionGroup(language_group);\n action_language->setCheckable(true);\n\n if (current_locale == locale.first)\n action_language->setChecked(true);\n\n ui.menu_language->addAction(action_language);\n }\n}\n\nvoid MainWindow::updateStatusBar()\n{\n QString message;\n QString icon;\n\n switch (last_state_)\n {\n case proto::internal::RouterState::DISABLED:\n message = tr(\"Router is disabled\");\n icon = QStringLiteral(\":\/img\/cross-script.png\");\n break;\n\n case proto::internal::RouterState::CONNECTING:\n message = tr(\"Connecting to a router...\");\n icon = QStringLiteral(\":\/img\/arrow-circle-double.png\");\n break;\n\n case proto::internal::RouterState::CONNECTED:\n message = tr(\"Connected to a router\");\n icon = QStringLiteral(\":\/img\/tick.png\");\n break;\n\n case proto::internal::RouterState::FAILED:\n message = tr(\"Connection error\");\n icon = QStringLiteral(\":\/img\/cross-script.png\");\n break;\n\n default:\n NOTREACHED();\n return;\n }\n\n ui.button_status->setText(message);\n ui.button_status->setIcon(QIcon(icon));\n}\n\n} \/\/ namespace host\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2015, STEREOLABS.\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/************************************************************************************\n ** This sample demonstrates how to use PCL (Point Cloud Library) with the ZED SDK **\n ************************************************************************************\/\n\n\n\/\/ standard includes\n#include <stdio.h>\n#include <string.h>\n#include <ctime>\n#include <chrono>\n#include <thread>\n#include <mutex>\n\n\/\/ OpenCV includes\n#include <opencv2\/opencv.hpp>\n\n\/\/ ZED includes\n#include <zed\/Camera.hpp>\n#include <zed\/utils\/GlobalDefine.hpp>\n\n\/\/ PCL includes\n#include <pcl\/common\/common_headers.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n\nusing namespace sl::zed;\nusing namespace std;\n\n\n\/\/ Exchange structure\n\ntypedef struct image_bufferStruct {\n float* data_cloud;\n std::mutex mutex_input;\n int width, height;\n} image_buffer;\n\n\nCamera* zed;\nimage_buffer* buffer;\nSENSING_MODE dm_type = RAW;\nbool stop_signal;\n\n\/\/ Grabbing function\n\nvoid grab_run() {\n float* p_cloud;\n\n while (!stop_signal) {\n zed->grab(dm_type);\n\n p_cloud = (float*) zed->retrieveMeasure(MEASURE::XYZRGBA).data; \/\/ Get the pointer\n\n \/\/ Fill the buffer\n buffer->mutex_input.lock(); \/\/ To prevent from data corruption\n memcpy(buffer->data_cloud, p_cloud, buffer->width * buffer->height * sizeof (float) * 4);\n buffer->mutex_input.unlock();\n\n std::this_thread::sleep_for(std::chrono::milliseconds(1));\n }\n}\n\nstd::shared_ptr<pcl::visualization::PCLVisualizer> rgbVis(pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr cloud) {\n \/\/ Open 3D viewer and add point cloud\n std::shared_ptr<pcl::visualization::PCLVisualizer> viewer(new pcl::visualization::PCLVisualizer(\"PCL ZED 3D Viewer\"));\n viewer->setBackgroundColor(0, 0, 0);\n pcl::visualization::PointCloudColorHandlerRGBField<pcl::PointXYZRGB> rgb(cloud);\n viewer->addPointCloud<pcl::PointXYZRGB> (cloud, rgb);\n viewer->setPointCloudRenderingProperties(pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 2);\n viewer->addCoordinateSystem(1.0);\n viewer->initCameraParameters();\n return (viewer);\n}\n\nint main(int argc, char** argv) {\n stop_signal = false;\n\n if (argc > 2) {\n std::cout << \"Only the path of a SVO can be passed in arg\" << std::endl;\n return -1;\n }\n\n if (argc == 1) \/\/ Use in Live Mode\n zed = new Camera(HD720);\n else \/\/ Use in SVO playback mode\n zed = new Camera(argv[1]);\n\n int width = zed->getImageSize().width;\n int height = zed->getImageSize().height;\n\n ERRCODE err = zed->init(MODE::PERFORMANCE, -1, true);\n cout << errcode2str(err) << endl;\n if (err != SUCCESS) {\n delete zed;\n return 1;\n }\n\n \/\/ allocate data\n buffer = new image_buffer();\n buffer->height = height;\n buffer->width = width;\n buffer->data_cloud = new float[buffer->height * buffer->width * 4];\n\n int size = height*width;\n\n pcl::PointCloud<pcl::PointXYZRGB>::Ptr point_cloud_ptr(new pcl::PointCloud<pcl::PointXYZRGB>);\n std::shared_ptr<pcl::visualization::PCLVisualizer> viewer = rgbVis(point_cloud_ptr);\n\n float* data_cloud;\n \/\/ Run thread\n std::thread grab_thread(grab_run);\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n\n float color;\n int index4 = 0;\n\n while (!viewer->wasStopped()) {\n\n point_cloud_ptr->points.clear();\n\n buffer->mutex_input.try_lock();\n data_cloud = buffer->data_cloud;\n index4 = 0;\n\n for (int i = 0; i < size; i++) {\n pcl::PointXYZRGB point;\n\n \/\/ Changing unit and coordinate for better visualization\n point.x = -data_cloud[index4++]*0.001;\n point.y = -data_cloud[index4++]*0.001;\n point.z = data_cloud[index4++]*0.001;\n\n color = data_cloud[index4++];\n \/\/ Converting color\n uint32_t color_uint = *(uint32_t*) & color;\n unsigned char* color_uchar = (unsigned char*) &color_uint;\n color_uint = ((uint32_t) color_uchar[0] << 16 | (uint32_t) color_uchar[1] << 8 | (uint32_t) color_uchar[2]);\n point.rgb = *reinterpret_cast<float*> (&color_uint);\n\n if (point.z > 0) \/\/ Checking if it's a valid point\n point_cloud_ptr->points.push_back(point);\n }\n\n buffer->mutex_input.unlock();\n\n viewer->updatePointCloud(point_cloud_ptr);\n viewer->spinOnce(20);\n\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n\n \/\/ Stop the grabbing thread\n stop_signal = true;\n grab_thread.join();\n\n delete[] buffer->data_cloud;\n delete buffer;\n delete zed;\n return 0;\n\n}\n<commit_msg>Remove pre-defined function in windows<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2015, STEREOLABS.\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n\/************************************************************************************\n ** This sample demonstrates how to use PCL (Point Cloud Library) with the ZED SDK **\n ************************************************************************************\/\n\n\n\/\/ standard includes\n#include <stdio.h>\n#include <string.h>\n#include <ctime>\n#include <chrono>\n#include <thread>\n#include <mutex>\n\n\/\/ OpenCV includes\n#include <opencv2\/opencv.hpp>\n\n\/\/ ZED includes\n#include <zed\/Camera.hpp>\n#include <zed\/utils\/GlobalDefine.hpp>\n\n#ifdef _WIN32\n#undef max\n#undef min\n#endif\n\n\/\/ PCL includes\n#include <pcl\/common\/common_headers.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n\nusing namespace sl::zed;\nusing namespace std;\n\n\n\/\/ Exchange structure\n\ntypedef struct image_bufferStruct {\n float* data_cloud;\n std::mutex mutex_input;\n int width, height;\n} image_buffer;\n\n\nCamera* zed;\nimage_buffer* buffer;\nSENSING_MODE dm_type = RAW;\nbool stop_signal;\n\n\/\/ Grabbing function\n\nvoid grab_run() {\n float* p_cloud;\n\n while (!stop_signal) {\n zed->grab(dm_type);\n\n p_cloud = (float*) zed->retrieveMeasure(MEASURE::XYZRGBA).data; \/\/ Get the pointer\n\n \/\/ Fill the buffer\n buffer->mutex_input.lock(); \/\/ To prevent from data corruption\n memcpy(buffer->data_cloud, p_cloud, buffer->width * buffer->height * sizeof (float) * 4);\n buffer->mutex_input.unlock();\n\n std::this_thread::sleep_for(std::chrono::milliseconds(1));\n }\n}\n\nstd::shared_ptr<pcl::visualization::PCLVisualizer> rgbVis(pcl::PointCloud<pcl::PointXYZRGB>::ConstPtr cloud) {\n \/\/ Open 3D viewer and add point cloud\n std::shared_ptr<pcl::visualization::PCLVisualizer> viewer(new pcl::visualization::PCLVisualizer(\"PCL ZED 3D Viewer\"));\n viewer->setBackgroundColor(0, 0, 0);\n pcl::visualization::PointCloudColorHandlerRGBField<pcl::PointXYZRGB> rgb(cloud);\n viewer->addPointCloud<pcl::PointXYZRGB> (cloud, rgb);\n viewer->setPointCloudRenderingProperties(pcl::visualization::PCL_VISUALIZER_POINT_SIZE, 2);\n viewer->addCoordinateSystem(1.0);\n viewer->initCameraParameters();\n return (viewer);\n}\n\nint main(int argc, char** argv) {\n stop_signal = false;\n\n if (argc > 2) {\n std::cout << \"Only the path of a SVO can be passed in arg\" << std::endl;\n return -1;\n }\n\n if (argc == 1) \/\/ Use in Live Mode\n zed = new Camera(HD720);\n else \/\/ Use in SVO playback mode\n zed = new Camera(argv[1]);\n\n int width = zed->getImageSize().width;\n int height = zed->getImageSize().height;\n\n ERRCODE err = zed->init(MODE::PERFORMANCE, -1, true);\n cout << errcode2str(err) << endl;\n if (err != SUCCESS) {\n delete zed;\n return 1;\n }\n\n \/\/ allocate data\n buffer = new image_buffer();\n buffer->height = height;\n buffer->width = width;\n buffer->data_cloud = new float[buffer->height * buffer->width * 4];\n\n int size = height*width;\n\n pcl::PointCloud<pcl::PointXYZRGB>::Ptr point_cloud_ptr(new pcl::PointCloud<pcl::PointXYZRGB>);\n std::shared_ptr<pcl::visualization::PCLVisualizer> viewer = rgbVis(point_cloud_ptr);\n\n float* data_cloud;\n \/\/ Run thread\n std::thread grab_thread(grab_run);\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n\n float color;\n int index4 = 0;\n\n while (!viewer->wasStopped()) {\n\n point_cloud_ptr->points.clear();\n\n buffer->mutex_input.try_lock();\n data_cloud = buffer->data_cloud;\n index4 = 0;\n\n for (int i = 0; i < size; i++) {\n pcl::PointXYZRGB point;\n\n \/\/ Changing unit and coordinate for better visualization\n point.x = -data_cloud[index4++]*0.001;\n point.y = -data_cloud[index4++]*0.001;\n point.z = data_cloud[index4++]*0.001;\n\n color = data_cloud[index4++];\n \/\/ Converting color\n uint32_t color_uint = *(uint32_t*) & color;\n unsigned char* color_uchar = (unsigned char*) &color_uint;\n color_uint = ((uint32_t) color_uchar[0] << 16 | (uint32_t) color_uchar[1] << 8 | (uint32_t) color_uchar[2]);\n point.rgb = *reinterpret_cast<float*> (&color_uint);\n\n if (point.z > 0) \/\/ Checking if it's a valid point\n point_cloud_ptr->points.push_back(point);\n }\n\n buffer->mutex_input.unlock();\n\n viewer->updatePointCloud(point_cloud_ptr);\n viewer->spinOnce(20);\n\n std::this_thread::sleep_for(std::chrono::milliseconds(20));\n }\n\n \/\/ Stop the grabbing thread\n stop_signal = true;\n grab_thread.join();\n\n delete[] buffer->data_cloud;\n delete buffer;\n delete zed;\n return 0;\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <thread>\n#include <atomic>\n#include <string>\n#include <iomanip>\n\n#include <boost\/asio.hpp>\n#include <boost\/bind.hpp>\n\nuint32_t BUFFER_SIZE = 65000;\n\nclass Port {\n\npublic:\n\tPort(boost::asio::io_service &io_service, const std::string & device) :\n\t\t\tserial_port_(io_service, device) {\n\n\t}\n\n\tvoid echo() {\n\t\tstd::vector<uint8_t> buffer(BUFFER_SIZE);\n\t\tserial_port_.async_read_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_echo_read, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\t}\n\n\tvoid send_test(const std::vector<uint8_t>& test_patern) {\n\n\t\tstd::vector<uint8_t> buffer = test_patern;\n\t\tserial_port_.async_write_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_send_test, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t}\n\nprivate:\n\n\tvoid handler_echo_read(std::vector<uint8_t> buffer, const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\n\t\tif (!ec) {\n\t\t\tserial_port_.async_write_some(boost::asio::buffer(buffer, bytes_transferd),\n\t\t\t\t\tboost::bind(&Port::handler_echo_write, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t\t}\n\t}\n\n\tvoid handler_echo_write(const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\n\t\tstd::vector<uint8_t> buffer(BUFFER_SIZE);\n\t\tserial_port_.async_read_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_echo_read, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t}\n\n\tvoid handler_send_test(std::vector<uint8_t> send_buffer, const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\t\tif (!ec) {\n\t\t\tstd::vector<uint8_t> receive_buffer(BUFFER_SIZE);\n\t\t\tserial_port_.async_read_some(boost::asio::buffer(receive_buffer, bytes_transferd),\n\t\t\t\t\tboost::bind(&Port::handler_receive_test, this, send_buffer, receive_buffer, boost::asio::placeholders::error,\n\t\t\t\t\t\t\tboost::asio::placeholders::bytes_transferred));\n\n\t\t}\n\t}\n\n\tvoid handler_receive_test(std::vector<uint8_t> send_buffer, std::vector<uint8_t> receive_buffer, const boost::system::error_code &ec,\n\t\t\tconst std::size_t bytes_transferd) {\n\t\tif (!ec) {\n\t\t\tstd::cout << std::endl;\n\t\t\tfor (auto i : send_buffer) {\n\t\t\t\tstd::cout << \" \" << std::hex << std::setfill('0') << std::setw(2) << (int) i;\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t\tfor (auto i : receive_buffer) {\n\t\t\t\tstd::cout << \" \" << std::hex << std::setfill('0') << std::setw(2) << (int) i;\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t\tstd::cout << std::endl;\n\t\t}\n\n\t}\n\n\tboost::asio::serial_port serial_port_;\n\n}\n;\n\nint main() {\n\n\tstd::string port_name_a(\"\/dev\/ttyUSB0\");\n\tstd::string port_name_b(\"\/dev\/ttyUSB1\");\n\n\/\/ 0xCAFEBABE\n\tstd::vector<uint8_t> test_pattern;\n\ttest_pattern.push_back(0xCA);\n\ttest_pattern.push_back(0xFE);\n\ttest_pattern.push_back(0xBA);\n\ttest_pattern.push_back(0xBE);\n\n\tboost::asio::io_service io_service;\n\tauto port_a = Port(io_service, port_name_a);\n\tauto port_b = Port(io_service, port_name_b);\n\n\tport_b.echo();\n\tport_a.send_test(test_pattern);\n\n\n\/\/xxx set options\n\n\treturn 0;\n}\n<commit_msg>FEATURE: added delay between checks<commit_after>#include <iostream>\n#include <thread>\n#include <chrono>\n#include <atomic>\n#include <string>\n#include <iomanip>\n\n#include <boost\/asio.hpp>\n#include <boost\/bind.hpp>\n\nuint32_t BUFFER_SIZE = 65000;\n\nclass Port {\n\npublic:\n\tPort(boost::asio::io_service &io_service, const std::string & device) :\n\t\t\tserial_port_(io_service, device) {\n\n\t}\n\n\tvoid echo() {\n\t\tstd::vector<uint8_t> buffer(BUFFER_SIZE);\n\t\tserial_port_.async_read_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_echo_read, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\t}\n\n\tvoid send_test(const std::vector<uint8_t>& test_patern) {\n\n\t\tstd::vector<uint8_t> buffer = test_patern;\n\t\tserial_port_.async_write_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_send_test, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t}\n\nprivate:\n\n\tvoid handler_echo_read(std::vector<uint8_t> buffer, const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\n\t\tif (!ec) {\n\t\t\tserial_port_.async_write_some(boost::asio::buffer(buffer, bytes_transferd),\n\t\t\t\t\tboost::bind(&Port::handler_echo_write, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t\t}\n\t}\n\n\tvoid handler_echo_write(const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\n\t\tstd::vector<uint8_t> buffer(BUFFER_SIZE);\n\t\tserial_port_.async_read_some(boost::asio::buffer(buffer),\n\t\t\t\tboost::bind(&Port::handler_echo_read, this, buffer, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred));\n\n\t}\n\n\tvoid handler_send_test(std::vector<uint8_t> send_buffer, const boost::system::error_code &ec, const std::size_t bytes_transferd) {\n\t\tif (!ec) {\n\t\t\tstd::vector<uint8_t> receive_buffer(BUFFER_SIZE);\n\t\t\tserial_port_.async_read_some(boost::asio::buffer(receive_buffer, bytes_transferd),\n\t\t\t\t\tboost::bind(&Port::handler_receive_test, this, send_buffer, receive_buffer, boost::asio::placeholders::error,\n\t\t\t\t\t\t\tboost::asio::placeholders::bytes_transferred));\n\n\t\t}\n\t}\n\n\tvoid handler_receive_test(std::vector<uint8_t> send_buffer, std::vector<uint8_t> receive_buffer, const boost::system::error_code &ec,\n\t\t\tconst std::size_t bytes_transferd) {\n\t\tif (!ec) {\n\t\t\tstd::cout << std::endl;\n\t\t\tfor (auto i : send_buffer) {\n\t\t\t\tstd::cout << \" \" << std::hex << std::setfill('0') << std::setw(2) << (int) i;\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t\tfor (auto i : receive_buffer) {\n\t\t\t\tstd::cout << \" \" << std::hex << std::setfill('0') << std::setw(2) << (int) i;\n\t\t\t}\n\t\t\tstd::cout << std::endl;\n\t\t\tstd::cout << std::endl;\n\t\t}\n\n\t}\n\n\tboost::asio::serial_port serial_port_;\n\n}\n;\n\nint main() {\n\n\tstd::string port_name_a(\"\/dev\/ttyUSB0\");\n\tstd::string port_name_b(\"\/dev\/ttyUSB1\");\n\n\/\/ 0xCAFEBABE\n\tstd::vector<uint8_t> test_pattern;\n\ttest_pattern.push_back(0xCA);\n\ttest_pattern.push_back(0xFE);\n\ttest_pattern.push_back(0xBA);\n\ttest_pattern.push_back(0xBE);\n\n\tstd::vector<uint8_t> p = test_pattern;\n\tfor (uint32_t i = 0; i < 30; i++) {\n\t\tp.insert(p.end(), test_pattern.begin(), test_pattern.end());\n\t}\n\n\tstd::cout << std::endl;\n\tfor (auto i : p) {\n\t\tstd::cout << \" \" << std::hex << std::setfill('0') << std::setw(2) << (int) i;\n\t}\n\tstd::cout << std::endl;\n\n\tboost::asio::io_service io_service;\n\n\tauto port_a = Port(io_service, port_name_a);\n\tauto port_b = Port(io_service, port_name_b);\n\n\tport_b.echo();\n\n\tfor (uint32_t i = 0; i < 1000; i++) {\n\t\tport_a.send_test(p);\n\n\t\tstd::chrono::milliseconds dura(1000);\n\t\tstd::this_thread::sleep_for(dura);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * File: main.cpp\n * Author: vlad\n * \n * Created on December 12, 2013, 10:38 PM\n *\/\n\n#include <iostream>\n\n#include \"qpp.h\"\n\/\/#include \"matlab.h\" \/\/ support for MATLAB\n\n\/\/ TODO: expandout function\n\/\/ TODO: dyad function\n\/\/ TODO: proj (dya) function\n\/\/ TODO: ip (inner product function) function, make it general to return matrices\n\/\/ TODO: Error class\n\/\/ TODO: change all for(s) to column major order\n\/\/ TODO: use .data() raw pointer instead of looping\n\nusing namespace std;\n\nusing namespace qpp;\nusing namespace qpp::types;\n\n\/\/int main(int argc, char **argv)\nint main()\n{\n\t_init();\n\n\t\/\/ Display formatting\n\tstd::cout << std::fixed; \/\/ use fixed format for nice formatting\n\/\/\tstd::cout << std::scientific;\n\tstd::cout << std::setprecision(4); \/\/ only for fixed or scientific modes\n\n\tcout << \"Starting qpp...\" << endl;\n\n\tsize_t n = 12; \/\/ 12 qubits\n\tsize_t N = std::pow(2, n);\n\tvector<size_t> dims; \/\/ local dimensions\n\tfor (size_t i = 0; i < n; i++)\n\t\tdims.push_back(2);\n\tstd::cout << \"n = \" << n << \" qubits, matrix size \" << N << \" x \" << N\n\t\t\t<< \".\" << endl;\n\n\t\/\/ TIMING\n\tTimer t, total; \/\/ start the timer, automatic tic() in the constructor\n\n\t\/\/ Matrix initialization\n\tcout << \"Matrix initialization timing.\" << endl;\n\tcmat randcmat = cmat::Random(N, N);\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ Matrix product\n\tcout << \"Matrix product timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\tcmat prodmat;\n\tprodmat = randcmat * randcmat; \/\/ need this (otherwise lazy evaluation)\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ ptrace SLOW SLOW SLOW\n\tcout << \"ptrace timing.\" << endl;\n\tvector<size_t> subsys_ptrace = { 0 };\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(subsys_ptrace);\n\tstd::cout << endl;\n\tt.tic();\n\tptrace(randcmat, subsys_ptrace, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ syspermute\n\tcout << \"syspermute timing.\" << endl;\n\tvector<size_t> perm; \/\/ left-shift all subsystems by 1\n\tfor (size_t i = 0; i < n; i++)\n\t\tperm.push_back((i + 1) % n);\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(perm);\n\tstd::cout << endl;\n\tt.tic();\n\tsyspermute(randcmat, perm, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ ptranspose\n\tcout << \"ptranspose timing.\" << endl;\n\tvector<size_t> subsys_ptranspose; \/\/ partially transpose all subsystems\n\tfor (size_t i = 0; i < n; i++)\n\t\tperm.push_back(i);\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(subsys_ptranspose);\n\tstd::cout << endl;\n\tt.tic();\n\tsyspermute(randcmat, perm, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\ttotal.toc(); \/\/ read the total running time\n\tcout << \"Total time: \" << total.seconds() << \" seconds.\" << endl;\n\t\/\/ END TIMING\n\n\tcout << endl << \"Exiting qpp...\" << endl;\n}\n<commit_msg>commit<commit_after>\/*\n * File: main.cpp\n * Author: vlad\n * \n * Created on December 12, 2013, 10:38 PM\n *\/\n\n#include <iostream>\n\n#include \"qpp.h\"\n\/\/#include \"matlab.h\" \/\/ support for MATLAB\n\n\/\/ TODO: expandout function\n\/\/ TODO: dyad function\n\/\/ TODO: proj (dya) function\n\/\/ TODO: ip (inner product function) function, make it general to return matrices\n\/\/ TODO: Error class\n\/\/ TODO: change all for(s) to column major order\n\/\/ TODO: use .data() raw pointer instead of looping\n\nusing namespace std;\n\nusing namespace qpp;\nusing namespace qpp::types;\n\n\/\/int main(int argc, char **argv)\nint main()\n{\n\t_init();\n\n\t\/\/ Display formatting\n\tstd::cout << std::fixed; \/\/ use fixed format for nice formatting\n\/\/\tstd::cout << std::scientific;\n\tstd::cout << std::setprecision(4); \/\/ only for fixed or scientific modes\n\n\tcout << \"Starting qpp...\" << endl;\n\n\tsize_t n = 12; \/\/ 12 qubits\n\tsize_t N = std::pow(2, n);\n\tvector<size_t> dims; \/\/ local dimensions\n\tfor (size_t i = 0; i < n; i++)\n\t\tdims.push_back(2);\n\tstd::cout << \"n = \" << n << \" qubits, matrix size \" << N << \" x \" << N\n\t\t\t<< \".\" << endl;\n\n\t\/\/ TIMING\n\tTimer t, total; \/\/ start the timer, automatic tic() in the constructor\n\n\t\/\/ Matrix initialization\n\tcout << \"Matrix initialization timing.\" << endl;\n\tcmat randcmat = cmat::Random(N, N);\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ Matrix product\n\tcout << \"Matrix product timing.\" << endl;\n\tt.tic(); \/\/ reset the chronometer\n\tcmat prodmat;\n\tprodmat = randcmat * randcmat; \/\/ need this (otherwise lazy evaluation)\n\tt.toc(); \/\/ read the time\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ ptrace SLOW SLOW SLOW\n\tcout << \"ptrace timing.\" << endl;\n\tvector<size_t> subsys_ptrace = { 0 };\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(subsys_ptrace);\n\tstd::cout << endl;\n\tt.tic();\n\tptrace(randcmat, subsys_ptrace, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ ptranspose\n\tcout << \"ptranspose timing.\" << endl;\n\tvector<size_t> subsys_ptranspose; \/\/ partially transpose all subsystems\n\tfor (size_t i = 0; i < n; i++)\n\t\tsubsys_ptranspose.push_back(i);\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(subsys_ptranspose);\n\tstd::cout << endl;\n\tt.tic();\n\tptranspose(randcmat, subsys_ptranspose, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\t\/\/ syspermute\n\tcout << \"syspermute timing.\" << endl;\n\tvector<size_t> perm; \/\/ left-shift all subsystems by 1\n\tfor (size_t i = 0; i < n; i++)\n\t\tperm.push_back((i + 1) % n);\n\tcout << \"Subsytem(s): \";\n\tinternal::_disp_container(perm);\n\tstd::cout << endl;\n\tt.tic();\n\tsyspermute(randcmat, perm, dims);\n\tt.toc();\n\tcout << \"Took \" << t.seconds() << \" seconds.\" << endl;\n\n\n\ttotal.toc(); \/\/ read the total running time\n\tcout << \"Total time: \" << total.seconds() << \" seconds.\" << endl;\n\t\/\/ END TIMING\n\n\tcout << endl << \"Exiting qpp...\" << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ardrone\/ardrone.h\"\r\n\r\n\/\/ --------------------------------------------------------------------------\r\n\/\/ main(Number of arguments, Argument values)\r\n\/\/ Description : This is the entry point of the program.\r\n\/\/ Return value : SUCCESS:0 ERROR:-1\r\n\/\/ --------------------------------------------------------------------------\r\nint main(int argc, char *argv[])\r\n{\r\n \/\/ AR.Drone class\r\n ARDrone ardrone;\r\n\r\n \/\/ Initialize\r\n if (!ardrone.open()) {\r\n std::cout << \"Failed to initialize.\" << std::endl;\r\n return -1;\r\n }\r\n\r\n \/\/ Thresholds\r\n int minH = 0, maxH = 255;\r\n int minS = 0, maxS = 255;\r\n int minV = 0, maxV = 255;\r\n\r\n \/\/ XML save data\r\n std::string filename(\"thresholds.xml\");\r\n cv::FileStorage fs(filename, cv::FileStorage::READ);\r\n\r\n \/\/ If there is a save file then read it\r\n if (fs.isOpened()) {\r\n maxH = fs[\"H_MAX\"];\r\n minH = fs[\"H_MIN\"];\r\n maxS = fs[\"S_MAX\"];\r\n minS = fs[\"S_MIN\"];\r\n maxV = fs[\"V_MAX\"];\r\n minV = fs[\"V_MIN\"];\r\n fs.release();\r\n }\r\n\r\n \/\/ Create a window\r\n cv::namedWindow(\"binalized\");\r\n cv::createTrackbar(\"H max\", \"binalized\", &maxH, 255);\r\n cv::createTrackbar(\"H min\", \"binalized\", &minH, 255);\r\n cv::createTrackbar(\"S max\", \"binalized\", &maxS, 255);\r\n cv::createTrackbar(\"S min\", \"binalized\", &minS, 255);\r\n cv::createTrackbar(\"V max\", \"binalized\", &maxV, 255);\r\n cv::createTrackbar(\"V min\", \"binalized\", &minV, 255);\r\n cv::resizeWindow(\"binalized\", 0, 0);\r\n\r\n \/\/ Kalman filter\r\n cv::KalmanFilter kalman(4, 2, 0);\r\n\r\n \/\/ Sampling time [s]\r\n const double dt = 1.0;\r\n\r\n \/\/ Transition matrix (x, y, vx, vy)\r\n cv::Mat1f A(4, 4);\r\n A << 1.0, 0.0, dt, 0.0,\r\n 0.0, 1.0, 0.0, dt,\r\n 0.0, 0.0, 1.0, 0.0,\r\n 0.0, 0.0, 0.0, 1.0;\r\n kalman.transitionMatrix = A;\r\n\r\n \/\/ Measurement matrix (x, y)\r\n cv::Mat1f H(2, 4);\r\n H << 1, 0, 0, 0,\r\n 0, 1, 0, 0;\r\n kalman.measurementMatrix = H;\r\n\r\n \/\/ Process noise covairance (x, y, vx, vy)\r\n cv::Mat1f Q(4, 4);\r\n Q << 1e-5, 0.0, 0.0, 0.0,\r\n 0.0, 1e-5, 0.0, 0.0,\r\n 0.0, 0.0, 1e-5, 0.0,\r\n 0.0, 0.0, 0.0, 1e-5;\r\n kalman.processNoiseCov = Q;\r\n\r\n \/\/ Measurement noise covariance (x, y)\r\n cv::Mat1f R(2, 2);\r\n R << 1e-1, 0.0,\r\n 0.0, 1e-1;\r\n kalman.measurementNoiseCov = R;\r\n\r\n \/\/ Main loop\r\n while (1) {\r\n \/\/ Key input\r\n int key = cv::waitKey(33);\r\n if (key == 0x1b) break;\r\n\r\n \/\/ Get an image\r\n cv::Mat image = ardrone.getImage();\r\n\r\n \/\/ HSV image\r\n cv::Mat hsv;\r\n cv::cvtColor(image, hsv, cv::COLOR_BGR2HSV_FULL);\r\n\r\n \/\/ Binalize\r\n cv::Mat binalized;\r\n cv::Scalar lower(minH, minS, minV);\r\n cv::Scalar upper(maxH, maxS, maxV);\r\n cv::inRange(hsv, lower, upper, binalized);\r\n\r\n \/\/ Show result\r\n cv::imshow(\"binalized\", binalized);\r\n\r\n \/\/ De-noising\r\n cv::Mat kernel = getStructuringElement(cv::MORPH_RECT, cv::Size(3, 3));\r\n cv::morphologyEx(binalized, binalized, cv::MORPH_CLOSE, kernel);\r\n \/\/cv::imshow(\"morphologyEx\", binalized);\r\n\r\n \/\/ Detect contours\r\n std::vector<std::vector<cv::Point>> contours;\r\n cv::findContours(binalized.clone(), contours, cv::RETR_CCOMP, cv::CHAIN_APPROX_SIMPLE);\r\n\r\n \/\/ Find largest contour\r\n int contour_index = -1;\r\n double max_area = 0.0;\r\n for (size_t i = 0; i < contours.size(); i++) {\r\n double area = fabs(cv::contourArea(contours[i]));\r\n if (area > max_area) {\r\n contour_index = i;\r\n max_area = area;\r\n }\r\n }\r\n\r\n \/\/ Object detected\r\n if (contour_index >= 0) {\r\n \/\/ Moments\r\n cv::Moments moments = cv::moments(contours[contour_index], true);\r\n double marker_y = (int)(moments.m01 \/ moments.m00);\r\n double marker_x = (int)(moments.m10 \/ moments.m00);\r\n\r\n \/\/ Measurements\r\n cv::Mat measurement = (cv::Mat1f(2, 1) << marker_x, marker_y);\r\n\r\n \/\/ Correction\r\n cv::Mat estimated = kalman.correct(measurement);\r\n\r\n \/\/ Show result\r\n cv::Rect rect = cv::boundingRect(contours[contour_index]);\r\n cv::rectangle(image, rect, cv::Scalar(0, 255, 0));\r\n }\r\n\r\n \/\/ Prediction\r\n cv::Mat1f prediction = kalman.predict();\r\n int radius = 1e+3 * kalman.errorCovPre.at<float>(0, 0);\r\n\r\n \/\/ Show predicted position\r\n cv::circle(image, cv::Point(prediction(0, 0), prediction(0, 1)), radius, cv::Scalar(0, 255, 0), 2);\r\n\r\n \/\/ Display the image\r\n cv::imshow(\"camera\", image);\r\n }\r\n\r\n \/\/ Save thresholds\r\n fs.open(filename, cv::FileStorage::WRITE);\r\n if (fs.isOpened()) {\r\n cv::write(fs, \"H_MAX\", maxH);\r\n cv::write(fs, \"H_MIN\", minH);\r\n cv::write(fs, \"S_MAX\", maxS);\r\n cv::write(fs, \"S_MIN\", minS);\r\n cv::write(fs, \"V_MAX\", maxV);\r\n cv::write(fs, \"V_MIN\", minV);\r\n fs.release();\r\n }\r\n\r\n \/\/ See you\r\n ardrone.close();\r\n\r\n return 0;\r\n}<commit_msg>Drone loiters, keeping the camera pointed at the tracked object.<commit_after>#include \"ardrone\/ardrone.h\"\r\n\r\n\/\/ --------------------------------------------------------------------------\r\n\/\/ main(Number of arguments, Argument values)\r\n\/\/ Description : This is the entry point of the program.\r\n\/\/ Return value : SUCCESS:0 ERROR:-1\r\n\/\/ --------------------------------------------------------------------------\r\nint main(int argc, char *argv[])\r\n{\r\n \/\/ AR.Drone class\r\n ARDrone ardrone;\r\n\r\n \/\/ Initialize\r\n if (!ardrone.open()) {\r\n std::cout << \"Failed to initialize.\" << std::endl;\r\n return -1;\r\n }\r\n\r\n \/\/ Thresholds\r\n int minH = 0, maxH = 255;\r\n int minS = 0, maxS = 255;\r\n int minV = 0, maxV = 255;\r\n\r\n \/\/ XML save data\r\n std::string filename(\"thresholds.xml\");\r\n cv::FileStorage fs(filename, cv::FileStorage::READ);\r\n\r\n \/\/ If there is a save file then read it\r\n if (fs.isOpened()) {\r\n maxH = fs[\"H_MAX\"];\r\n minH = fs[\"H_MIN\"];\r\n maxS = fs[\"S_MAX\"];\r\n minS = fs[\"S_MIN\"];\r\n maxV = fs[\"V_MAX\"];\r\n minV = fs[\"V_MIN\"];\r\n fs.release();\r\n }\r\n\r\n \/\/ Create a window\r\n cv::namedWindow(\"binalized\");\r\n cv::createTrackbar(\"H max\", \"binalized\", &maxH, 255);\r\n cv::createTrackbar(\"H min\", \"binalized\", &minH, 255);\r\n cv::createTrackbar(\"S max\", \"binalized\", &maxS, 255);\r\n cv::createTrackbar(\"S min\", \"binalized\", &minS, 255);\r\n cv::createTrackbar(\"V max\", \"binalized\", &maxV, 255);\r\n cv::createTrackbar(\"V min\", \"binalized\", &minV, 255);\r\n cv::resizeWindow(\"binalized\", 0, 0);\r\n\r\n \/\/ Kalman filter\r\n cv::KalmanFilter kalman(4, 2, 0);\r\n\r\n \/\/ Sampling time [s]\r\n const double dt = 1.0;\r\n\r\n \/\/ Transition matrix (x, y, vx, vy)\r\n cv::Mat1f A(4, 4);\r\n A << 1.0, 0.0, dt, 0.0,\r\n 0.0, 1.0, 0.0, dt,\r\n 0.0, 0.0, 1.0, 0.0,\r\n 0.0, 0.0, 0.0, 1.0;\r\n kalman.transitionMatrix = A;\r\n\r\n \/\/ Measurement matrix (x, y)\r\n cv::Mat1f H(2, 4);\r\n H << 1, 0, 0, 0,\r\n 0, 1, 0, 0;\r\n kalman.measurementMatrix = H;\r\n\r\n \/\/ Process noise covairance (x, y, vx, vy)\r\n cv::Mat1f Q(4, 4);\r\n Q << 1e-5, 0.0, 0.0, 0.0,\r\n 0.0, 1e-5, 0.0, 0.0,\r\n 0.0, 0.0, 1e-5, 0.0,\r\n 0.0, 0.0, 0.0, 1e-5;\r\n kalman.processNoiseCov = Q;\r\n\r\n \/\/ Measurement noise covariance (x, y)\r\n cv::Mat1f R(2, 2);\r\n R << 1e-1, 0.0,\r\n 0.0, 1e-1;\r\n kalman.measurementNoiseCov = R;\r\n\r\n \/\/ Main loop\r\n while (1) {\r\n \/\/ Key input\r\n int key = cv::waitKey(33);\r\n if (key == 0x1b) break;\r\n\r\n \/\/ Get an image\r\n cv::Mat image = ardrone.getImage();\r\n\r\n \/\/ HSV image\r\n cv::Mat hsv;\r\n cv::cvtColor(image, hsv, cv::COLOR_BGR2HSV_FULL);\r\n\r\n \/\/ Binalize\r\n cv::Mat binalized;\r\n cv::Scalar lower(minH, minS, minV);\r\n cv::Scalar upper(maxH, maxS, maxV);\r\n cv::inRange(hsv, lower, upper, binalized);\r\n\r\n \/\/ Show result\r\n cv::imshow(\"binalized\", binalized);\r\n\r\n \/\/ De-noising\r\n cv::Mat kernel = getStructuringElement(cv::MORPH_RECT, cv::Size(3, 3));\r\n cv::morphologyEx(binalized, binalized, cv::MORPH_CLOSE, kernel);\r\n \/\/cv::imshow(\"morphologyEx\", binalized);\r\n\r\n \/\/ Detect contours\r\n std::vector<std::vector<cv::Point>> contours;\r\n cv::findContours(binalized.clone(), contours, cv::RETR_CCOMP, cv::CHAIN_APPROX_SIMPLE);\r\n\r\n \/\/ Find largest contour\r\n int contour_index = -1;\r\n double max_area = 0.0;\r\n for (size_t i = 0; i < contours.size(); i++) {\r\n double area = fabs(cv::contourArea(contours[i]));\r\n if (area > max_area) {\r\n contour_index = i;\r\n max_area = area;\r\n }\r\n }\r\n\r\n \/\/ Object detected\r\n if (contour_index >= 0) {\r\n \/\/ Moments\r\n cv::Moments moments = cv::moments(contours[contour_index], true);\r\n double marker_y = (int)(moments.m01 \/ moments.m00);\r\n double marker_x = (int)(moments.m10 \/ moments.m00);\r\n\r\n \/\/ Measurements\r\n cv::Mat measurement = (cv::Mat1f(2, 1) << marker_x, marker_y);\r\n\r\n \/\/ Correction\r\n cv::Mat estimated = kalman.correct(measurement);\r\n\r\n \/\/ Show result\r\n cv::Rect rect = cv::boundingRect(contours[contour_index]);\r\n cv::rectangle(image, rect, cv::Scalar(0, 255, 0));\r\n }\r\n\r\n \/\/ Prediction\r\n cv::Mat1f prediction = kalman.predict();\r\n int radius = 1e+3 * kalman.errorCovPre.at<float>(0, 0);\r\n\r\n \/\/ Show predicted position\r\n cv::circle(image, cv::Point(prediction(0, 0), prediction(0, 1)), radius, cv::Scalar(0, 255, 0), 2);\r\n\r\n\t\t\/\/ Calculate object heading fraction\r\n\t\tfloat heading = ((image.cols\/2)-prediction(0, 0))\/(image.cols\/2);\r\n\t\tprintf(\"prediction->data.fl[0] = %3.2f\\n\", heading);\r\n\t\t\r\n\t\t\/\/ Control drone\r\n\t\tdouble vx = 0.0, vy = 0.0, vz = 0.0, vr = 0.0;\r\n if (key == 0x260000) vx = 1.0;\r\n if (key == 0x280000) vx = -1.0;\r\n if (key == 0x250000) vr = 1.0;\r\n if (key == 0x270000) vr = -1.0;\r\n if (key == 'q') vz = 1.0;\r\n if (key == 'a') vz = -1.0;\r\n\t\tif(key == -1)\r\n\t\t{\r\n\t\t\t\/\/vx=0.7;\r\n\t\t\tvr = heading*2;\r\n\t\t}\r\n ardrone.move3D(vx, vy, vz, vr);\r\n\r\n\t\t\/\/ Take off \/ Landing \r\n if (key == ' ') {\r\n if (ardrone.onGround()) \r\n\t\t\t{\r\n\t\t\t\tardrone.takeoff();\r\n\t\t\t}\r\n else\r\n\t\t\t{\r\n\t\t\t\tardrone.landing();\r\n\t\t\t}\r\n }\r\n\r\n\t\t\r\n \/\/ Display the image\r\n cv::imshow(\"camera\", image);\r\n\r\n\t\t\r\n\r\n\r\n }\r\n\r\n \/\/ Save thresholds\r\n fs.open(filename, cv::FileStorage::WRITE);\r\n if (fs.isOpened()) {\r\n cv::write(fs, \"H_MAX\", maxH);\r\n cv::write(fs, \"H_MIN\", minH);\r\n cv::write(fs, \"S_MAX\", maxS);\r\n cv::write(fs, \"S_MIN\", minS);\r\n cv::write(fs, \"V_MAX\", maxV);\r\n cv::write(fs, \"V_MIN\", minV);\r\n fs.release();\r\n }\r\n\r\n \/\/ See you\r\n ardrone.close();\r\n\r\n return 0;\r\n}<|endoftext|>"} {"text":"<commit_before>\/\/ must be the first include in all compile units\n#ifndef SASS_SASS_H\n#define SASS_SASS_H\n\n\/\/ undefine extensions macro to tell sys includes\n\/\/ that we do not want any macros to be exported\n\/\/ mainly fixes an issue on SmartOS (SEC macro)\n#undef __EXTENSIONS__\n\n#ifdef _MSC_VER\n#pragma warning(disable : 4005)\n#endif\n\n\/\/ aplies to MSVC and MinGW\n#ifdef _WIN32\n\/\/ we do not want the ERROR macro\n# define NOGDI\n\/\/ we do not want the min\/max macro\n# define NOMINMAX\n#endif\n\n\/\/ should we be case insensitive\n\/\/ when dealing with files or paths\n#ifndef FS_CASE_SENSITIVE\n# ifdef _WIN32\n# define FS_CASE_SENSITIVE 0\n# else\n# define FS_CASE_SENSITIVE 1\n# endif\n#endif\n\n\/\/ path separation char\n#ifndef PATH_SEP\n# ifdef _WIN32\n# define PATH_SEP ';'\n# else\n# define PATH_SEP ':'\n# endif\n#endif\n\n#endif\n<commit_msg>Prevent pseudo modifiers from being injected (unity build)<commit_after>\/\/ must be the first include in all compile units\n#ifndef SASS_SASS_H\n#define SASS_SASS_H\n\n\/\/ undefine extensions macro to tell sys includes\n\/\/ that we do not want any macros to be exported\n\/\/ mainly fixes an issue on SmartOS (SEC macro)\n#undef __EXTENSIONS__\n\n#ifdef _MSC_VER\n#pragma warning(disable : 4005)\n#endif\n\n\/\/ aplies to MSVC and MinGW\n#ifdef _WIN32\n\/\/ we do not want the ERROR macro\n# define NOGDI\n\/\/ we do not want the min\/max macro\n# define NOMINMAX\n\/\/ we do not want the IN\/OUT macro\n# define _NO_W32_PSEUDO_MODIFIERS\n#endif\n\n\n\/\/ should we be case insensitive\n\/\/ when dealing with files or paths\n#ifndef FS_CASE_SENSITIVE\n# ifdef _WIN32\n# define FS_CASE_SENSITIVE 0\n# else\n# define FS_CASE_SENSITIVE 1\n# endif\n#endif\n\n\/\/ path separation char\n#ifndef PATH_SEP\n# ifdef _WIN32\n# define PATH_SEP ';'\n# else\n# define PATH_SEP ':'\n# endif\n#endif\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file was developed by Thomas Müller <thomas94@gmx.net>.\n\/\/ It is published under the BSD 3-Clause License within the LICENSE file.\n\n#include <tev\/Image.h>\n#include <tev\/ImageViewer.h>\n#include <tev\/Ipc.h>\n#include <tev\/ThreadPool.h>\n\n#include <args.hxx>\n#include <ImfThreading.h>\n\n#include <utf8.h>\n\n#include <atomic>\n#include <chrono>\n#include <iostream>\n#include <thread>\n\nusing namespace args;\nusing namespace filesystem;\nusing namespace std;\n\nTEV_NAMESPACE_BEGIN\n\nint mainFunc(const vector<string>& arguments) {\n ArgumentParser parser{\n \"tev — The EXR Viewer\\n\"\n \"version \" TEV_VERSION \"\\n\"\n \"Inspection tool for images with high dynamic range\",\n \"tev was developed by Thomas Müller <thomas94@gmx.net>. \"\n \"Its source code is available under the BSD 3-Clause License at https:\/\/tom94.net\",\n };\n\n ValueFlag<float> exposureFlag{\n parser,\n \"EXPOSURE\",\n \"Scales the brightness of an image prior to tonemapping by 2^EXPOSURE. Default is 0.\",\n {'e', \"exposure\"},\n };\n\n ValueFlag<string> filterFlag{\n parser,\n \"FILTER\",\n \"Filter visible images and groups according to a supplied string. \"\n \"The string must have the format 'image:group'. \"\n \"Only images whose name contains 'image' and groups whose name contains 'group' will be visible.\",\n {'f', \"filter\"},\n };\n\n ValueFlag<float> gammaFlag{\n parser,\n \"GAMMA\",\n \"The exponent used when TONEMAP is 'Gamma'. Default is 2.2.\",\n {'g', \"gamma\"},\n };\n\n HelpFlag helpFlag{\n parser,\n \"HELP\",\n \"Display this help menu.\",\n {'h', \"help\"},\n };\n\n ValueFlag<string> hostnameFlag{\n parser,\n \"HOSTNAME\",\n \"The hostname to listen on for IPC communication. \"\n \"tev can have a distinct primary instance for each unique hostname in use. \"\n \"Default is 127.0.0.1:14158\",\n {\"host\", \"hostname\"},\n };\n\n ValueFlag<bool> maximizeFlag{\n parser,\n \"MAXIMIZE\",\n \"Maximize the window on startup. \"\n \"If no images were supplied via the command line, then the default is FALSE. \"\n \"Otherwise, the default is TRUE.\",\n {\"max\", \"maximize\"},\n };\n\n ValueFlag<string> metricFlag{\n parser,\n \"METRIC\",\n \"The metric to use when comparing two images. \"\n \"The available metrics are:\\n\"\n \"E - Error\\n\"\n \"AE - Absolute Error\\n\"\n \"SE - Squared Error\\n\"\n \"RAE - Relative Absolute Error\\n\"\n \"RSE - Relative Squared Error\\n\"\n \"Default is E.\",\n {'m', \"metric\"},\n };\n\n Flag newWindowFlag{\n parser,\n \"NEW WINDOW\",\n \"Open a new window of tev, even if one exists already.\",\n {'n', \"new\"},\n };\n\n ValueFlag<float> offsetFlag{\n parser,\n \"OFFSET\",\n \"Add an absolute offset to the image after EXPOSURE has been applied. Default is 0.\",\n {'o', \"offset\"},\n };\n\n ValueFlag<string> tonemapFlag{\n parser,\n \"TONEMAP\",\n \"The tonemapping algorithm to use. \"\n \"The available tonemaps are:\\n\"\n \"sRGB - sRGB\\n\"\n \"Gamma - Gamma curve\\n\"\n \"FC - False Color\\n\"\n \"PN - Positive=Green, Negative=Red\\n\"\n \"Default is sRGB.\",\n {'t', \"tonemap\"},\n };\n\n Flag versionFlag{\n parser,\n \"VERSION\",\n \"Display the version of tev.\",\n {'v', \"version\"},\n };\n\n PositionalList<string> imageFiles{\n parser,\n \"images\",\n \"The image files to be opened by tev. \"\n \"If an argument starting with a ':' is encountered, \"\n \"then this argument is not treated as an image file \"\n \"but as a comma-separated channel selector. Until the next channel \"\n \"selector is encountered only channels containing \"\n \"elements from the current selector will be loaded. This is \"\n \"especially useful for selectively loading a specific \"\n \"part of a multi-part EXR file.\",\n };\n\n \/\/ Parse command line arguments and react to parsing\n \/\/ errors using exceptions.\n try {\n TEV_ASSERT(arguments.size() > 0, \"Number of arguments must be bigger than 0.\");\n\n parser.Prog(arguments.front());\n parser.ParseArgs(begin(arguments) + 1, end(arguments));\n } catch (const Help&) {\n cout << parser;\n return 0;\n } catch (const ParseError& e) {\n cerr << e.what() << endl;\n cerr << parser;\n return -1;\n } catch (const ValidationError& e) {\n cerr << e.what() << endl;\n cerr << parser;\n return -2;\n }\n\n if (versionFlag) {\n tlog::none() << \"tev — The EXR Viewer\\nversion \" TEV_VERSION;\n return 0;\n }\n\n const string hostname = hostnameFlag ? get(hostnameFlag) : \"127.0.0.1:14158\";\n auto ipc = make_shared<Ipc>(hostname);\n\n \/\/ If we're not the primary instance and did not request to open a new window,\n \/\/ simply send the to-be-opened images to the primary instance.\n if (!ipc->isPrimaryInstance() && !newWindowFlag) {\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n try {\n IpcPacket packet;\n packet.setOpenImage(tfm::format(\"%s:%s\", path{imageFile}.make_absolute(), channelSelector), true);\n ipc->sendToPrimaryInstance(packet);\n } catch (runtime_error e) {\n tlog::error() << tfm::format(\"Invalid file '%s': %s\", imageFile, e.what());\n }\n }\n\n return 0;\n }\n\n Imf::setGlobalThreadCount(thread::hardware_concurrency());\n\n tlog::info() << \"Loading window...\";\n\n shared_ptr<BackgroundImagesLoader> imagesLoader = make_shared<BackgroundImagesLoader>();\n\n atomic<bool> shallShutdown{false};\n\n \/\/ Spawn a background thread that opens images passed via stdin.\n \/\/ To allow whitespace characters in filenames, we use the convention that\n \/\/ paths in stdin must be separated by newlines.\n thread stdinThread{[&]() {\n string channelSelector;\n while (!shallShutdown) {\n for (string line; getline(cin, line);) {\n string imageFile = tev::ensureUtf8(line);\n\n if (imageFile.empty()) {\n continue;\n }\n\n if (imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n imagesLoader->enqueue(imageFile, channelSelector, false);\n }\n\n this_thread::sleep_for(chrono::milliseconds{100});\n }\n }};\n\n \/\/ It is unfortunately not easily possible to poll\/timeout on cin in a portable manner,\n \/\/ so instead we resort to simply detaching this thread, causing it to be forcefully\n \/\/ terminated as the main thread terminates.\n stdinThread.detach();\n\n unique_ptr<ImageViewer> imageViewer;\n\n \/\/ Spawn another background thread, this one dealing with images passed to us\n \/\/ via inter-process communication (IPC). This happens when\n \/\/ a user starts another instance of tev while one is already running. Note, that this\n \/\/ behavior can be overridden by the -n flag, so not _all_ secondary instances send their\n \/\/ paths to the primary instance.\n thread ipcThread;\n if (ipc->isPrimaryInstance()) {\n ipcThread = thread{[&]() {\n while (!shallShutdown) {\n while (ipc->receiveFromSecondaryInstance([&](const IpcPacket& packet) {\n try {\n switch (packet.type()) {\n case IpcPacket::OpenImage: {\n auto info = packet.interpretAsOpenImage();\n string imageString = ensureUtf8(info.imagePath);\n size_t colonPos = min(imageString.length() - 1, imageString.find_last_of(\":\"));\n imagesLoader->enqueue(imageString.substr(0, colonPos), imageString.substr(colonPos + 1), info.grabFocus);\n break;\n }\n\n case IpcPacket::ReloadImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsReloadImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->reloadImage(imageString, info.grabFocus);\n });\n break;\n }\n\n case IpcPacket::CloseImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsCloseImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->removeImage(imageString);\n });\n break;\n }\n\n case IpcPacket::UpdateImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsUpdateImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->updateImage(imageString, info.grabFocus, info.channel, info.x, info.y, info.width, info.height, info.imageData);\n });\n break;\n }\n\n default: {\n throw runtime_error{tfm::format(\"Invalid IPC packet type %d\", (int)packet.type())};\n }\n }\n } catch (const runtime_error& e) {\n tlog::warning() << \"Malformed IPC packet: \" << e.what();\n }\n })) { }\n\n this_thread::sleep_for(chrono::milliseconds{100});\n }\n }};\n }\n\n \/\/ Load images passed via command line in the background prior to\n \/\/ creating our main application such that they are not stalled\n \/\/ by the potentially slow initialization of opengl \/ glfw.\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n imagesLoader->enqueue(imageFile, channelSelector, false);\n }\n\n \/\/ Init nanogui application\n nanogui::init();\n\n imageViewer.reset(new ImageViewer{imagesLoader, !imageFiles});\n imageViewer->drawAll();\n imageViewer->setVisible(true);\n\n \/\/ Do what the maximize flag tells us---if it exists---and\n \/\/ maximize if we have images otherwise.\n if (maximizeFlag ? get(maximizeFlag) : imageFiles) {\n imageViewer->maximize();\n }\n\n \/\/ Apply parameter flags\n if (exposureFlag) { imageViewer->setExposure(get(exposureFlag)); }\n if (filterFlag) { imageViewer->setFilter(get(filterFlag)); }\n if (gammaFlag) { imageViewer->setGamma(get(gammaFlag)); }\n if (metricFlag) { imageViewer->setMetric(toMetric(get(metricFlag))); }\n if (offsetFlag) { imageViewer->setOffset(get(offsetFlag)); }\n if (tonemapFlag) { imageViewer->setTonemap(toTonemap(get(tonemapFlag))); }\n\n \/\/ Refresh only every 250ms if there are no user interactions.\n \/\/ This makes an idling tev surprisingly energy-efficient. :)\n nanogui::mainloop(250);\n\n shallShutdown = true;\n\n \/\/ On some linux distributions glfwTerminate() (which is called by\n \/\/ nanogui::shutdown()) causes segfaults. Since we are done with our\n \/\/ program here anyways, let's let the OS clean up after us.\n \/\/nanogui::shutdown();\n\n if (ipcThread.joinable()) {\n ipcThread.join();\n }\n\n if (stdinThread.joinable()) {\n stdinThread.join();\n }\n\n imageViewer.reset();\n\n return 0;\n}\n\nTEV_NAMESPACE_END\n\n#ifdef _WIN32\nint wmain(int argc, wchar_t* argv[]) {\n#else\nint main(int argc, char* argv[]) {\n#endif\n try {\n vector<string> arguments;\n for (int i = 0; i < argc; ++i) {\n#ifdef _WIN32\n arguments.emplace_back(tev::utf16to8(argv[i]));\n#else\n string arg = argv[i];\n \/\/ OSX sometimes (seemingly sporadically) passes the\n \/\/ process serial number via a command line parameter.\n \/\/ We would like to ignore this.\n if (arg.find(\"-psn\") != 0) {\n arguments.emplace_back(tev::ensureUtf8(argv[i]));\n }\n#endif\n }\n\n tev::mainFunc(arguments);\n } catch (const exception& e) {\n tlog::error() << tfm::format(\"Uncaught exception: %s\", e.what());\n return 1;\n }\n}\n<commit_msg>Fix off by one error spotted by Matt<commit_after>\/\/ This file was developed by Thomas Müller <thomas94@gmx.net>.\n\/\/ It is published under the BSD 3-Clause License within the LICENSE file.\n\n#include <tev\/Image.h>\n#include <tev\/ImageViewer.h>\n#include <tev\/Ipc.h>\n#include <tev\/ThreadPool.h>\n\n#include <args.hxx>\n#include <ImfThreading.h>\n\n#include <utf8.h>\n\n#include <atomic>\n#include <chrono>\n#include <iostream>\n#include <thread>\n\nusing namespace args;\nusing namespace filesystem;\nusing namespace std;\n\nTEV_NAMESPACE_BEGIN\n\nint mainFunc(const vector<string>& arguments) {\n ArgumentParser parser{\n \"tev — The EXR Viewer\\n\"\n \"version \" TEV_VERSION \"\\n\"\n \"Inspection tool for images with high dynamic range\",\n \"tev was developed by Thomas Müller <thomas94@gmx.net>. \"\n \"Its source code is available under the BSD 3-Clause License at https:\/\/tom94.net\",\n };\n\n ValueFlag<float> exposureFlag{\n parser,\n \"EXPOSURE\",\n \"Scales the brightness of an image prior to tonemapping by 2^EXPOSURE. Default is 0.\",\n {'e', \"exposure\"},\n };\n\n ValueFlag<string> filterFlag{\n parser,\n \"FILTER\",\n \"Filter visible images and groups according to a supplied string. \"\n \"The string must have the format 'image:group'. \"\n \"Only images whose name contains 'image' and groups whose name contains 'group' will be visible.\",\n {'f', \"filter\"},\n };\n\n ValueFlag<float> gammaFlag{\n parser,\n \"GAMMA\",\n \"The exponent used when TONEMAP is 'Gamma'. Default is 2.2.\",\n {'g', \"gamma\"},\n };\n\n HelpFlag helpFlag{\n parser,\n \"HELP\",\n \"Display this help menu.\",\n {'h', \"help\"},\n };\n\n ValueFlag<string> hostnameFlag{\n parser,\n \"HOSTNAME\",\n \"The hostname to listen on for IPC communication. \"\n \"tev can have a distinct primary instance for each unique hostname in use. \"\n \"Default is 127.0.0.1:14158\",\n {\"host\", \"hostname\"},\n };\n\n ValueFlag<bool> maximizeFlag{\n parser,\n \"MAXIMIZE\",\n \"Maximize the window on startup. \"\n \"If no images were supplied via the command line, then the default is FALSE. \"\n \"Otherwise, the default is TRUE.\",\n {\"max\", \"maximize\"},\n };\n\n ValueFlag<string> metricFlag{\n parser,\n \"METRIC\",\n \"The metric to use when comparing two images. \"\n \"The available metrics are:\\n\"\n \"E - Error\\n\"\n \"AE - Absolute Error\\n\"\n \"SE - Squared Error\\n\"\n \"RAE - Relative Absolute Error\\n\"\n \"RSE - Relative Squared Error\\n\"\n \"Default is E.\",\n {'m', \"metric\"},\n };\n\n Flag newWindowFlag{\n parser,\n \"NEW WINDOW\",\n \"Open a new window of tev, even if one exists already.\",\n {'n', \"new\"},\n };\n\n ValueFlag<float> offsetFlag{\n parser,\n \"OFFSET\",\n \"Add an absolute offset to the image after EXPOSURE has been applied. Default is 0.\",\n {'o', \"offset\"},\n };\n\n ValueFlag<string> tonemapFlag{\n parser,\n \"TONEMAP\",\n \"The tonemapping algorithm to use. \"\n \"The available tonemaps are:\\n\"\n \"sRGB - sRGB\\n\"\n \"Gamma - Gamma curve\\n\"\n \"FC - False Color\\n\"\n \"PN - Positive=Green, Negative=Red\\n\"\n \"Default is sRGB.\",\n {'t', \"tonemap\"},\n };\n\n Flag versionFlag{\n parser,\n \"VERSION\",\n \"Display the version of tev.\",\n {'v', \"version\"},\n };\n\n PositionalList<string> imageFiles{\n parser,\n \"images\",\n \"The image files to be opened by tev. \"\n \"If an argument starting with a ':' is encountered, \"\n \"then this argument is not treated as an image file \"\n \"but as a comma-separated channel selector. Until the next channel \"\n \"selector is encountered only channels containing \"\n \"elements from the current selector will be loaded. This is \"\n \"especially useful for selectively loading a specific \"\n \"part of a multi-part EXR file.\",\n };\n\n \/\/ Parse command line arguments and react to parsing\n \/\/ errors using exceptions.\n try {\n TEV_ASSERT(arguments.size() > 0, \"Number of arguments must be bigger than 0.\");\n\n parser.Prog(arguments.front());\n parser.ParseArgs(begin(arguments) + 1, end(arguments));\n } catch (const Help&) {\n cout << parser;\n return 0;\n } catch (const ParseError& e) {\n cerr << e.what() << endl;\n cerr << parser;\n return -1;\n } catch (const ValidationError& e) {\n cerr << e.what() << endl;\n cerr << parser;\n return -2;\n }\n\n if (versionFlag) {\n tlog::none() << \"tev — The EXR Viewer\\nversion \" TEV_VERSION;\n return 0;\n }\n\n const string hostname = hostnameFlag ? get(hostnameFlag) : \"127.0.0.1:14158\";\n auto ipc = make_shared<Ipc>(hostname);\n\n \/\/ If we're not the primary instance and did not request to open a new window,\n \/\/ simply send the to-be-opened images to the primary instance.\n if (!ipc->isPrimaryInstance() && !newWindowFlag) {\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n try {\n IpcPacket packet;\n packet.setOpenImage(tfm::format(\"%s:%s\", path{imageFile}.make_absolute(), channelSelector), true);\n ipc->sendToPrimaryInstance(packet);\n } catch (runtime_error e) {\n tlog::error() << tfm::format(\"Invalid file '%s': %s\", imageFile, e.what());\n }\n }\n\n return 0;\n }\n\n Imf::setGlobalThreadCount(thread::hardware_concurrency());\n\n tlog::info() << \"Loading window...\";\n\n shared_ptr<BackgroundImagesLoader> imagesLoader = make_shared<BackgroundImagesLoader>();\n\n atomic<bool> shallShutdown{false};\n\n \/\/ Spawn a background thread that opens images passed via stdin.\n \/\/ To allow whitespace characters in filenames, we use the convention that\n \/\/ paths in stdin must be separated by newlines.\n thread stdinThread{[&]() {\n string channelSelector;\n while (!shallShutdown) {\n for (string line; getline(cin, line);) {\n string imageFile = tev::ensureUtf8(line);\n\n if (imageFile.empty()) {\n continue;\n }\n\n if (imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n imagesLoader->enqueue(imageFile, channelSelector, false);\n }\n\n this_thread::sleep_for(chrono::milliseconds{100});\n }\n }};\n\n \/\/ It is unfortunately not easily possible to poll\/timeout on cin in a portable manner,\n \/\/ so instead we resort to simply detaching this thread, causing it to be forcefully\n \/\/ terminated as the main thread terminates.\n stdinThread.detach();\n\n unique_ptr<ImageViewer> imageViewer;\n\n \/\/ Spawn another background thread, this one dealing with images passed to us\n \/\/ via inter-process communication (IPC). This happens when\n \/\/ a user starts another instance of tev while one is already running. Note, that this\n \/\/ behavior can be overridden by the -n flag, so not _all_ secondary instances send their\n \/\/ paths to the primary instance.\n thread ipcThread;\n if (ipc->isPrimaryInstance()) {\n ipcThread = thread{[&]() {\n while (!shallShutdown) {\n while (ipc->receiveFromSecondaryInstance([&](const IpcPacket& packet) {\n try {\n switch (packet.type()) {\n case IpcPacket::OpenImage: {\n auto info = packet.interpretAsOpenImage();\n string imageString = ensureUtf8(info.imagePath);\n size_t colonPos = min(imageString.length(), imageString.find_last_of(\":\"));\n imagesLoader->enqueue(imageString.substr(0, colonPos), imageString.substr(colonPos + 1), info.grabFocus);\n break;\n }\n\n case IpcPacket::ReloadImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsReloadImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->reloadImage(imageString, info.grabFocus);\n });\n break;\n }\n\n case IpcPacket::CloseImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsCloseImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->removeImage(imageString);\n });\n break;\n }\n\n case IpcPacket::UpdateImage: {\n while (!imageViewer) { }\n auto info = packet.interpretAsUpdateImage();\n imageViewer->scheduleToUiThread([&,info] {\n string imageString = ensureUtf8(info.imagePath);\n imageViewer->updateImage(imageString, info.grabFocus, info.channel, info.x, info.y, info.width, info.height, info.imageData);\n });\n break;\n }\n\n default: {\n throw runtime_error{tfm::format(\"Invalid IPC packet type %d\", (int)packet.type())};\n }\n }\n } catch (const runtime_error& e) {\n tlog::warning() << \"Malformed IPC packet: \" << e.what();\n }\n })) { }\n\n this_thread::sleep_for(chrono::milliseconds{100});\n }\n }};\n }\n\n \/\/ Load images passed via command line in the background prior to\n \/\/ creating our main application such that they are not stalled\n \/\/ by the potentially slow initialization of opengl \/ glfw.\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n imagesLoader->enqueue(imageFile, channelSelector, false);\n }\n\n \/\/ Init nanogui application\n nanogui::init();\n\n imageViewer.reset(new ImageViewer{imagesLoader, !imageFiles});\n imageViewer->drawAll();\n imageViewer->setVisible(true);\n\n \/\/ Do what the maximize flag tells us---if it exists---and\n \/\/ maximize if we have images otherwise.\n if (maximizeFlag ? get(maximizeFlag) : imageFiles) {\n imageViewer->maximize();\n }\n\n \/\/ Apply parameter flags\n if (exposureFlag) { imageViewer->setExposure(get(exposureFlag)); }\n if (filterFlag) { imageViewer->setFilter(get(filterFlag)); }\n if (gammaFlag) { imageViewer->setGamma(get(gammaFlag)); }\n if (metricFlag) { imageViewer->setMetric(toMetric(get(metricFlag))); }\n if (offsetFlag) { imageViewer->setOffset(get(offsetFlag)); }\n if (tonemapFlag) { imageViewer->setTonemap(toTonemap(get(tonemapFlag))); }\n\n \/\/ Refresh only every 250ms if there are no user interactions.\n \/\/ This makes an idling tev surprisingly energy-efficient. :)\n nanogui::mainloop(250);\n\n shallShutdown = true;\n\n \/\/ On some linux distributions glfwTerminate() (which is called by\n \/\/ nanogui::shutdown()) causes segfaults. Since we are done with our\n \/\/ program here anyways, let's let the OS clean up after us.\n \/\/nanogui::shutdown();\n\n if (ipcThread.joinable()) {\n ipcThread.join();\n }\n\n if (stdinThread.joinable()) {\n stdinThread.join();\n }\n\n imageViewer.reset();\n\n return 0;\n}\n\nTEV_NAMESPACE_END\n\n#ifdef _WIN32\nint wmain(int argc, wchar_t* argv[]) {\n#else\nint main(int argc, char* argv[]) {\n#endif\n try {\n vector<string> arguments;\n for (int i = 0; i < argc; ++i) {\n#ifdef _WIN32\n arguments.emplace_back(tev::utf16to8(argv[i]));\n#else\n string arg = argv[i];\n \/\/ OSX sometimes (seemingly sporadically) passes the\n \/\/ process serial number via a command line parameter.\n \/\/ We would like to ignore this.\n if (arg.find(\"-psn\") != 0) {\n arguments.emplace_back(tev::ensureUtf8(argv[i]));\n }\n#endif\n }\n\n tev::mainFunc(arguments);\n } catch (const exception& e) {\n tlog::error() << tfm::format(\"Uncaught exception: %s\", e.what());\n return 1;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/***\n * Copyright (c) 2013, Dan Hasting\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the organization nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ***\/\n\n#include \"logdialog.h\"\n\n\nLogDialog::LogDialog(QString lastOutput, QWidget *parent) : QDialog(parent)\n{\n setWindowTitle(tr(\"CEN64 Log\"));\n setMinimumSize(600, 400);\n\n logLayout = new QGridLayout(this);\n logLayout->setContentsMargins(5, 10, 5, 10);\n\n logArea = new QTextEdit(this);\n logArea->setWordWrapMode(QTextOption::NoWrap);\n\n QFont font;\n#ifdef OS_LINUX_OR_BSD\n font.setFamily(\"Monospace\");\n font.setPointSize(9);\n#else\n font.setFamily(\"Courier\");\n font.setPointSize(10);\n#endif\n font.setFixedPitch(true);\n logArea->setFont(font);\n\n logArea->setPlainText(lastOutput);\n\n logButtonBox = new QDialogButtonBox(Qt::Horizontal, this);\n logButtonBox->addButton(tr(\"Close\"), QDialogButtonBox::AcceptRole);\n\n logLayout->addWidget(logArea, 0, 0);\n logLayout->addWidget(logButtonBox, 1, 0);\n\n connect(logButtonBox, SIGNAL(accepted()), this, SLOT(close()));\n\n setLayout(logLayout);\n}\n<commit_msg>Fix monospaced font in log dialog<commit_after>\/***\n * Copyright (c) 2013, Dan Hasting\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the organization nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ***\/\n\n#include \"logdialog.h\"\n\n#if QT_VERSION >= 0x050200\n#include <QFontDatabase>\n#endif\n\n\nLogDialog::LogDialog(QString lastOutput, QWidget *parent) : QDialog(parent)\n{\n setWindowTitle(tr(\"CEN64 Log\"));\n setMinimumSize(600, 400);\n\n logLayout = new QGridLayout(this);\n logLayout->setContentsMargins(5, 10, 5, 10);\n\n logArea = new QTextEdit(this);\n logArea->setWordWrapMode(QTextOption::NoWrap);\n\n#if QT_VERSION >= 0x050200\n QFont font = QFontDatabase::systemFont(QFontDatabase::FixedFont);\n#else\n QFont font(\"Monospace\");\n font.setStyleHint(QFont::TypeWriter);\n#endif\n logArea->setFont(font);\n\n logArea->setPlainText(lastOutput);\n\n logButtonBox = new QDialogButtonBox(Qt::Horizontal, this);\n logButtonBox->addButton(tr(\"Close\"), QDialogButtonBox::AcceptRole);\n\n logLayout->addWidget(logArea, 0, 0);\n logLayout->addWidget(logButtonBox, 1, 0);\n\n connect(logButtonBox, SIGNAL(accepted()), this, SLOT(close()));\n\n setLayout(logLayout);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* openrtb_bid_request.cc\n Jeremy Barnes, 19 February 2013\n Copyright (c) 2013 Datacratic Inc. All rights reserved.\n\n Bid request parser for OpenRTB.\n*\/\n\n#include \"openrtb_bid_request.h\"\n#include \"jml\/utils\/json_parsing.h\"\n#include \"rtbkit\/openrtb\/openrtb.h\"\n#include \"rtbkit\/openrtb\/openrtb_parsing.h\"\n\nusing namespace std;\n\nnamespace RTBKIT {\n\n\n\/*****************************************************************************\/\n\/* OPENRTB BID REQUEST PARSER *\/\n\/*****************************************************************************\/\n\nBidRequest *\nfromOpenRtb(OpenRTB::BidRequest && req,\n const std::string & provider,\n const std::string & exchange)\n{\n std::unique_ptr<BidRequest> result(new BidRequest());\n\n result->auctionId = std::move(req.id);\n result->auctionType = AuctionType::SECOND_PRICE;\n result->timeAvailableMs = req.tmax.value();\n result->timestamp = Date::now();\n result->isTest = false;\n result->unparseable = std::move(req.unparseable);\n\n result->provider = provider;\n result->exchange = (exchange.empty() ? provider : exchange);\n\n auto onImpression = [&] (OpenRTB::Impression && imp)\n {\n AdSpot spot(std::move(imp));\n\n \/\/ Copy the ad formats in for the moment\n if (spot.banner) {\n for (unsigned i = 0; i < spot.banner->w.size(); ++i) {\n spot.formats.push_back(Format(spot.banner->w[i],\n spot.banner->h[i]));\n }\n spot.position = spot.banner->pos;\n } \n\n \/\/ Now create tags\n spot.id = std::move(imp.id);\n if (imp.banner) {\n auto & b = *imp.banner;\n \n if (b.w.size() != b.h.size())\n throw ML::Exception(\"widths and heights must match\");\n \n for (unsigned i = 0; i < b.w.size(); ++i) {\n int w = b.w[i];\n int h = b.h[i];\n\n Format format(w, h);\n spot.formats.push_back(format);\n }\n#if 0\n if (!b.expdir.empty()) {\n spot.tagFilter.mustInclude.add(\"expandableTargetingNotSupported\");\n }\n if (!b.api.empty()) {\n spot.tagFilter.mustInclude.add(\"apiFrameworksNotSupported\");\n }\n if (!b.btype.empty()) {\n spot.tagFilter.mustInclude.add(\"creativeTypeBlockingNotSupported\");\n }\n if (!b.battr.empty()) {\n spot.tagFilter.mustInclude.add(\"creativeTypeB\");\n \/\/ Blocked creative attributes\n }\n if (!b.mimes.empty()) {\n \/\/ We must have specified a MIME type and it must be\n \/\/ supported by the exchange.\n \n }\n#endif\n\n } else if (imp.video) {\n auto & v = *imp.video;\n\n if(!v.mimes.empty()) {\n \/\/ We need at least one MIME type supported by the exchange\n }\n\n if(v.linearity.value() < 0) {\n \n }\n \n if(v.minduration.value() < 0) {\n \n }\n\n if(v.maxduration.value() < 0) {\n \n }\n \n Format format(v.w.value(), v.h.value());\n spot.formats.push_back(format);\n }\n#if 0\n if (!imp.displaymanager.empty()) {\n tags.add(\"displayManager\", imp.displaymanager);\n }\n if (!imp.displaymanagerver.empty()) {\n tags.add(\"displayManagerVersion\", imp.displaymanagerver);\n }\n if (!imp.instl.unspecified()) {\n tags.add(\"interstitial\", imp.instl.value());\n }\n if (!imp.tagid.empty()) {\n tags.add(\"tagid\", imp.tagid.value());\n }\n if (imp.bidfloor.value() != 0.0) {\n if (!imp.bidfloorcur.empty())\n spot.reservePrice = Amount(imp.bidfloorcur,\n imp.bidfloor.value() * 0.001);\n else\n spot.reservePrice = USD_CPM(imp.bidfloor.value());\n }\n for (b: imp.iframebuster) {\n spot.tags.add(\"iframebuster\", b);\n }\n#endif \n result->imp.emplace_back(std::move(spot));\n };\n\n result->imp.reserve(req.imp.size());\n\n for (auto & i: req.imp)\n onImpression(std::move(i));\n\n if (req.site && req.app)\n throw ML::Exception(\"can't have site and app\");\n\n if (req.site) {\n result->site.reset(req.site.release());\n if (!result->site->page.empty())\n result->url = result->site->page;\n else if (result->site->id)\n result->url = Url(\"http:\/\/\" + result->site->id.toString() + \".siteid\/\");\n }\n else if (req.app) {\n result->app.reset(req.app.release());\n\n if (!result->app->bundle.empty())\n result->url = Url(result->app->bundle);\n else if (result->app->id)\n result->url = Url(\"http:\/\/\" + result->app->id.toString() + \".appid\/\");\n }\n\n if (req.device) {\n result->device.reset(req.device.release());\n result->language = result->device->language;\n result->userAgent = result->device->ua;\n if (!result->device->ip.empty())\n result->ipAddress = result->device->ip;\n else if (!result->device->ipv6.empty())\n result->ipAddress = result->device->ipv6;\n\n if (result->device->geo) {\n const auto & g = *result->device->geo;\n auto & l = result->location;\n l.countryCode = g.country;\n if (!g.region.empty())\n l.regionCode = g.region;\n else l.regionCode = g.regionfips104;\n l.cityName = g.city;\n l.postalCode = g.zip;\n if(!g.metro.empty())\n l.metro = boost::lexical_cast<int> (g.metro); \n\/\/ TODO DMA\n }\n }\n\n if (req.user) {\n result->user.reset(req.user.release());\n for (auto & d: result->user->data) {\n string key;\n if (d.id)\n key = d.id.toString();\n else key = d.name.extractAscii();\n\n vector<string> values;\n for (auto & v: d.segment) {\n if (v.id)\n values.push_back(v.id.toString());\n else if (!v.name.empty())\n values.push_back(v.name.extractAscii());\n }\n\n result->segments.addStrings(key, values);\n }\n\n if (result->user->tz.val != -1)\n result->location.timezoneOffsetMinutes = result->user->tz.val;\n\n if (result->user->id)\n result->userIds.add(result->user->id, ID_EXCHANGE);\n if (result->user->buyeruid)\n result->userIds.add(result->user->buyeruid, ID_PROVIDER);\n else if (result->user->id)\n result->userIds.add(result->user->id, ID_PROVIDER);\n else if(result->device && !result->device->ip.empty() && !result->device->ua.empty()) {\n const std::string &strToHash = (result->device->ip + result->device->ua.extractAscii());\n result->userAgentIPHash = Id(CityHash64(strToHash.c_str(), strToHash.length()));\n result->userIds.add(result->userAgentIPHash, ID_PROVIDER);\n }\n \n else\n result->userIds.add(Id(0), ID_PROVIDER);\n\n }\n else\n {\n \/\/ We don't receive a user object, we need at least to set provider_ID in order to identify\n \/\/ the user\n\n if(result->device && !result->device->ip.empty() && !result->device->ua.empty()) {\n const std::string &strToHash = (result->device->ip + result->device->ua.extractAscii());\n result->userAgentIPHash = Id(CityHash64(strToHash.c_str(), strToHash.length()));\n result->userIds.add(result->userAgentIPHash, ID_PROVIDER);\n }\n else {\n result->userIds.add(Id(0), ID_PROVIDER);\n }\n }\n\n if (!req.cur.empty()) {\n for (unsigned i = 0; i < req.cur.size(); ++i) {\n result->bidCurrency.push_back(parseCurrencyCode(req.cur[i]));\n }\n }\n else {\n result->bidCurrency.push_back(CurrencyCode::CC_USD);\n }\n\n result->blockedCategories = std::move(req.bcat);\n\n \/\/ blocked tld advertisers\n result->badv = std::move(req.badv);\n vector<string> badv ;\n for (auto s: req.badv)\n \tbadv.push_back (s.extractAscii());\n result->restrictions.addStrings(\"badv\", badv);\n\n\n result->ext = std::move(req.ext);\n\n result->segments.addStrings(\"openrtb-wseat\", req.wseat);\n \n return result.release();\n}\n\nOpenRTB::BidRequest toOpenRtb(const BidRequest &req)\n{\n OpenRTB::BidRequest result;\n\n result.id = req.auctionId; \n result.at = req.auctionType;\n result.tmax = req.timeAvailableMs;\n result.unparseable = req.unparseable;\n\n auto onAdSpot = [&](const AdSpot &spot) {\n OpenRTB::Impression imp(spot);\n\n result.imp.push_back(std::move(imp));\n };\n\n result.imp.reserve(req.imp.size());\n for (const auto &spot: req.imp) {\n onAdSpot(spot);\n }\n\n if (req.site && req.app)\n throw ML::Exception(\"can't have site and app\");\n\n if (req.site) {\n result.site.reset(new OpenRTB::Site(*req.site));\n }\n else if (req.app) {\n result.app.reset(new OpenRTB::App(*req.app));\n }\n\n if (req.user) {\n result.user.reset(new OpenRTB::User(*req.user));\n }\n\n if (req.device) {\n result.device.reset(new OpenRTB::Device(*req.device));\n }\n\n result.bcat = req.blockedCategories;\n result.cur.reserve(req.bidCurrency.size());\n\n for (const auto &cur: req.bidCurrency) {\n\n result.cur.push_back(toString(cur));\n }\n\n result.badv = req.badv;\n\n result.ext = req.ext;\n const auto &wseatSegments = req.segments.get(\"openrtb-wseat\");\n std::vector<std::string> wseat;\n wseatSegments.forEach([&](int, const std::string &str, float) {\n wseat.push_back(str);\n });\n\n result.wseat = std::move(wseat);\n\n return result;\n}\n\nnamespace {\n\nstatic DefaultDescription<OpenRTB::BidRequest> desc;\n\n} \/\/ file scope\n\n\nOpenRTB::BidRequest\nOpenRtbBidRequestParser::\nparseBidRequest(const std::string & jsonValue)\n{\n const char * strStart = jsonValue.c_str();\n StreamingJsonParsingContext jsonContext(jsonValue, strStart,\n strStart + jsonValue.size());\n\n OpenRTB::BidRequest req;\n desc.parseJson(&req, jsonContext);\n return std::move(req);\n}\n\n\nBidRequest *\nOpenRtbBidRequestParser::\nparseBidRequest(const std::string & jsonValue,\n const std::string & provider,\n const std::string & exchange)\n{\n return fromOpenRtb(parseBidRequest(jsonValue), provider, exchange);\n}\n\nOpenRTB::BidRequest\nOpenRtbBidRequestParser::\nparseBidRequest(ML::Parse_Context & context)\n{\n StreamingJsonParsingContext jsonContext(context);\n\n OpenRTB::BidRequest req;\n desc.parseJson(&req, jsonContext);\n return std::move(req);\n}\n\nBidRequest *\nOpenRtbBidRequestParser::\nparseBidRequest(ML::Parse_Context & context,\n const std::string & provider,\n const std::string & exchange)\n{\n return fromOpenRtb(parseBidRequest(context), provider, exchange);\n}\n\n} \/\/ namespace RTBKIT\n<commit_msg>fixed to use spot instead of imp that offered a reference to nothing (damn move)<commit_after>\/* openrtb_bid_request.cc\n Jeremy Barnes, 19 February 2013\n Copyright (c) 2013 Datacratic Inc. All rights reserved.\n\n Bid request parser for OpenRTB.\n*\/\n\n#include \"openrtb_bid_request.h\"\n#include \"jml\/utils\/json_parsing.h\"\n#include \"rtbkit\/openrtb\/openrtb.h\"\n#include \"rtbkit\/openrtb\/openrtb_parsing.h\"\n\nusing namespace std;\n\nnamespace RTBKIT {\n\n\n\/*****************************************************************************\/\n\/* OPENRTB BID REQUEST PARSER *\/\n\/*****************************************************************************\/\n\nBidRequest *\nfromOpenRtb(OpenRTB::BidRequest && req,\n const std::string & provider,\n const std::string & exchange)\n{\n std::unique_ptr<BidRequest> result(new BidRequest());\n\n result->auctionId = std::move(req.id);\n result->auctionType = AuctionType::SECOND_PRICE;\n result->timeAvailableMs = req.tmax.value();\n result->timestamp = Date::now();\n result->isTest = false;\n result->unparseable = std::move(req.unparseable);\n\n result->provider = provider;\n result->exchange = (exchange.empty() ? provider : exchange);\n\n auto onImpression = [&] (OpenRTB::Impression && imp)\n {\n AdSpot spot(std::move(imp));\n\n \/\/ Copy the ad formats in for the moment\n if (spot.banner) {\n \n for (unsigned i = 0; i < spot.banner->w.size(); ++i) {\n spot.formats.push_back(Format(spot.banner->w[i],\n spot.banner->h[i]));\n }\n spot.position = spot.banner->pos;\n \n } else if (spot.video) {\n \n \/\/ Unique ptr doesn't overload operators.. great.\n auto & v = *spot.video;\n\n if(!v.mimes.empty()) {\n \/\/ We need at least one MIME type supported by the exchange\n }\n\n if(v.linearity.value() < 0) {\n \n }\n \n if(v.minduration.value() < 0) {\n \n }\n\n if(v.maxduration.value() < 0) {\n \n }\n \n Format format(v.w.value(), v.h.value());\n spot.formats.push_back(format);\n }\n\n#if 0\n if (imp.banner) {\n auto & b = *imp.banner;\n \n if (b.w.size() != b.h.size())\n throw ML::Exception(\"widths and heights must match\");\n \n for (unsigned i = 0; i < b.w.size(); ++i) {\n int w = b.w[i];\n int h = b.h[i];\n\n Format format(w, h);\n spot.formats.push_back(format);\n }\n\n if (!b.expdir.empty()) {\n spot.tagFilter.mustInclude.add(\"expandableTargetingNotSupported\");\n }\n if (!b.api.empty()) {\n spot.tagFilter.mustInclude.add(\"apiFrameworksNotSupported\");\n }\n if (!b.btype.empty()) {\n spot.tagFilter.mustInclude.add(\"creativeTypeBlockingNotSupported\");\n }\n if (!b.battr.empty()) {\n spot.tagFilter.mustInclude.add(\"creativeTypeB\");\n \/\/ Blocked creative attributes\n }\n if (!b.mimes.empty()) {\n \/\/ We must have specified a MIME type and it must be\n \/\/ supported by the exchange.\n \n }\n \n if (!imp.displaymanager.empty()) {\n tags.add(\"displayManager\", imp.displaymanager);\n }\n if (!imp.displaymanagerver.empty()) {\n tags.add(\"displayManagerVersion\", imp.displaymanagerver);\n }\n if (!imp.instl.unspecified()) {\n tags.add(\"interstitial\", imp.instl.value());\n }\n if (!imp.tagid.empty()) {\n tags.add(\"tagid\", imp.tagid.value());\n }\n if (imp.bidfloor.value() != 0.0) {\n if (!imp.bidfloorcur.empty())\n spot.reservePrice = Amount(imp.bidfloorcur,\n imp.bidfloor.value() * 0.001);\n else\n spot.reservePrice = USD_CPM(imp.bidfloor.value());\n }\n for (b: imp.iframebuster) {\n spot.tags.add(\"iframebuster\", b);\n }\n#endif\n result->imp.emplace_back(std::move(spot));\n };\n\n result->imp.reserve(req.imp.size());\n\n for (auto & i: req.imp)\n onImpression(std::move(i));\n\n if (req.site && req.app)\n throw ML::Exception(\"can't have site and app\");\n\n if (req.site) {\n result->site.reset(req.site.release());\n if (!result->site->page.empty())\n result->url = result->site->page;\n else if (result->site->id)\n result->url = Url(\"http:\/\/\" + result->site->id.toString() + \".siteid\/\");\n }\n else if (req.app) {\n result->app.reset(req.app.release());\n\n if (!result->app->bundle.empty())\n result->url = Url(result->app->bundle);\n else if (result->app->id)\n result->url = Url(\"http:\/\/\" + result->app->id.toString() + \".appid\/\");\n }\n\n if (req.device) {\n result->device.reset(req.device.release());\n result->language = result->device->language;\n result->userAgent = result->device->ua;\n if (!result->device->ip.empty())\n result->ipAddress = result->device->ip;\n else if (!result->device->ipv6.empty())\n result->ipAddress = result->device->ipv6;\n\n if (result->device->geo) {\n const auto & g = *result->device->geo;\n auto & l = result->location;\n l.countryCode = g.country;\n if (!g.region.empty())\n l.regionCode = g.region;\n else l.regionCode = g.regionfips104;\n l.cityName = g.city;\n l.postalCode = g.zip;\n if(!g.metro.empty())\n l.metro = boost::lexical_cast<int> (g.metro); \n\/\/ TODO DMA\n }\n }\n\n if (req.user) {\n result->user.reset(req.user.release());\n for (auto & d: result->user->data) {\n string key;\n if (d.id)\n key = d.id.toString();\n else key = d.name.extractAscii();\n\n vector<string> values;\n for (auto & v: d.segment) {\n if (v.id)\n values.push_back(v.id.toString());\n else if (!v.name.empty())\n values.push_back(v.name.extractAscii());\n }\n\n result->segments.addStrings(key, values);\n }\n\n if (result->user->tz.val != -1)\n result->location.timezoneOffsetMinutes = result->user->tz.val;\n\n if (result->user->id)\n result->userIds.add(result->user->id, ID_EXCHANGE);\n if (result->user->buyeruid)\n result->userIds.add(result->user->buyeruid, ID_PROVIDER);\n else if (result->user->id)\n result->userIds.add(result->user->id, ID_PROVIDER);\n else if(result->device && !result->device->ip.empty() && !result->device->ua.empty()) {\n const std::string &strToHash = (result->device->ip + result->device->ua.extractAscii());\n result->userAgentIPHash = Id(CityHash64(strToHash.c_str(), strToHash.length()));\n result->userIds.add(result->userAgentIPHash, ID_PROVIDER);\n }\n \n else\n result->userIds.add(Id(0), ID_PROVIDER);\n\n }\n else\n {\n \/\/ We don't receive a user object, we need at least to set provider_ID in order to identify\n \/\/ the user\n\n if(result->device && !result->device->ip.empty() && !result->device->ua.empty()) {\n const std::string &strToHash = (result->device->ip + result->device->ua.extractAscii());\n result->userAgentIPHash = Id(CityHash64(strToHash.c_str(), strToHash.length()));\n result->userIds.add(result->userAgentIPHash, ID_PROVIDER);\n }\n else {\n result->userIds.add(Id(0), ID_PROVIDER);\n }\n }\n\n if (!req.cur.empty()) {\n for (unsigned i = 0; i < req.cur.size(); ++i) {\n result->bidCurrency.push_back(parseCurrencyCode(req.cur[i]));\n }\n }\n else {\n result->bidCurrency.push_back(CurrencyCode::CC_USD);\n }\n\n result->blockedCategories = std::move(req.bcat);\n\n \/\/ blocked tld advertisers\n result->badv = std::move(req.badv);\n vector<string> badv ;\n for (auto s: req.badv)\n \tbadv.push_back (s.extractAscii());\n result->restrictions.addStrings(\"badv\", badv);\n\n\n result->ext = std::move(req.ext);\n\n result->segments.addStrings(\"openrtb-wseat\", req.wseat);\n \n return result.release();\n}\n\nOpenRTB::BidRequest toOpenRtb(const BidRequest &req)\n{\n OpenRTB::BidRequest result;\n\n result.id = req.auctionId; \n result.at = req.auctionType;\n result.tmax = req.timeAvailableMs;\n result.unparseable = req.unparseable;\n\n auto onAdSpot = [&](const AdSpot &spot) {\n OpenRTB::Impression imp(spot);\n\n result.imp.push_back(std::move(imp));\n };\n\n result.imp.reserve(req.imp.size());\n for (const auto &spot: req.imp) {\n onAdSpot(spot);\n }\n\n if (req.site && req.app)\n throw ML::Exception(\"can't have site and app\");\n\n if (req.site) {\n result.site.reset(new OpenRTB::Site(*req.site));\n }\n else if (req.app) {\n result.app.reset(new OpenRTB::App(*req.app));\n }\n\n if (req.user) {\n result.user.reset(new OpenRTB::User(*req.user));\n }\n\n if (req.device) {\n result.device.reset(new OpenRTB::Device(*req.device));\n }\n\n result.bcat = req.blockedCategories;\n result.cur.reserve(req.bidCurrency.size());\n\n for (const auto &cur: req.bidCurrency) {\n\n result.cur.push_back(toString(cur));\n }\n\n result.badv = req.badv;\n\n result.ext = req.ext;\n const auto &wseatSegments = req.segments.get(\"openrtb-wseat\");\n std::vector<std::string> wseat;\n wseatSegments.forEach([&](int, const std::string &str, float) {\n wseat.push_back(str);\n });\n\n result.wseat = std::move(wseat);\n\n return result;\n}\n\nnamespace {\n\nstatic DefaultDescription<OpenRTB::BidRequest> desc;\n\n} \/\/ file scope\n\n\nOpenRTB::BidRequest\nOpenRtbBidRequestParser::\nparseBidRequest(const std::string & jsonValue)\n{\n const char * strStart = jsonValue.c_str();\n StreamingJsonParsingContext jsonContext(jsonValue, strStart,\n strStart + jsonValue.size());\n\n OpenRTB::BidRequest req;\n desc.parseJson(&req, jsonContext);\n return std::move(req);\n}\n\n\nBidRequest *\nOpenRtbBidRequestParser::\nparseBidRequest(const std::string & jsonValue,\n const std::string & provider,\n const std::string & exchange)\n{\n return fromOpenRtb(parseBidRequest(jsonValue), provider, exchange);\n}\n\nOpenRTB::BidRequest\nOpenRtbBidRequestParser::\nparseBidRequest(ML::Parse_Context & context)\n{\n StreamingJsonParsingContext jsonContext(context);\n\n OpenRTB::BidRequest req;\n desc.parseJson(&req, jsonContext);\n return std::move(req);\n}\n\nBidRequest *\nOpenRtbBidRequestParser::\nparseBidRequest(ML::Parse_Context & context,\n const std::string & provider,\n const std::string & exchange)\n{\n return fromOpenRtb(parseBidRequest(context), provider, exchange);\n}\n\n} \/\/ namespace RTBKIT\n<|endoftext|>"} {"text":"<commit_before>\/*\n * FlightVars\n * Copyright (c) 2014 Alvaro Polo\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#ifndef FLIGHTVARS_UTIL_OPTION_H\n#define FLIGHTVARS_UTIL_OPTION_H\n\n#include <memory>\n\n#include <flightvars\/util\/exception.hpp>\n\nnamespace flightvars { namespace util {\n\nFV_DECL_EXCEPTION(option_undefined);\n\ntemplate <class T>\nclass option {\npublic:\n\n static_assert(std::is_copy_constructible<T>::value,\n \"option cannot be instantiated with non-copy constructible types\");\n\n template <class T1> \n friend class option;\n\n option() : _data(nullptr) {}\n\n option(const T& data) : _data(new T(data)) {}\n\n option(T&& data) : _data(new T(std::move(data))) {}\n\n option(const option& other) : _data(other.is_defined() ? new T(other.get()) : nullptr) {}\n\n option(option&& other) : _data(std::move(other._data)) {}\n\n template <class T1>\n option(const option<T1>& other) : \n _data(other.is_defined() ? new T(other.get()) : nullptr) {}\n\n template <class T1>\n option(option<T1>&& other) : _data(std::move(other._data)) {}\n\n option& operator = (const option& other) {\n _data.reset(other.is_defined() ? new T(other.get()) : nullptr);\n return *this;\n }\n\n template <class T1>\n option& operator = (const option<T1>& other) {\n _data.reset(other.is_defined() ? new T(other.get()) : nullptr);\n return *this;\n }\n\n bool is_defined() const { return bool(_data); }\n\n T& get() const {\n if (is_defined()) {\n return *_data;\n } else {\n throw option_undefined(\"cannot get on not defined option\");\n }\n }\n\n const T& get_or_else(const T& other) const {\n return is_defined() ? get() : other;\n }\n\n void set(const T& data) {\n _data.reset(new T(data));\n }\n\n T extract() {\n if (is_defined()) {\n auto r = std::move(*_data);\n _data.reset(nullptr);\n return std::move(r);\n } else {\n throw option_undefined(\"cannot extract on not defined option\");\n }\n }\n\n template <class T1, class Func>\n option<T1> map(const Func& f) const {\n return is_defined() ? option<T1>(f(get())) : option<T1>();\n }\n\n template <class T1, class Func>\n option<T1> fmap(const Func& f) const {\n return is_defined() ? f(get()) : option<T1>();\n }\n\n template <class Func>\n void foreach(const Func& f) const {\n if (is_defined()) {\n f(get());\n }\n }\n\nprivate:\n\n std::unique_ptr<T> _data;\n};\n\ntemplate <>\nclass option<void> {\npublic:\n\n template <class T1> \n friend class option;\n\n option(bool is_defined = false) : _is_defined(is_defined) {}\n\n option(const option& other) : _is_defined(other._is_defined) {}\n\n option& operator = (const option& other) {\n _is_defined = other._is_defined;\n return *this;\n }\n\n bool is_defined() const { return _is_defined; }\n\n void get() const { \n if (!is_defined()) {\n throw option_undefined(\"cannot get on not defined option\");\n }\n }\n\n void set(bool is_defined = true) {\n _is_defined = is_defined;\n }\n\n void extract() {\n if (!is_defined()) {\n throw option_undefined(\"cannot extract on not defined option\");\n }\n _is_defined = false;\n }\n\nprivate:\n\n bool _is_defined;\n};\n\ntemplate <class T>\noption<T> make_some(const T& value) {\n return option<T>(value);\n}\n\ntemplate <class T>\noption<T> move_some(T&& value) {\n return option<T>(std::forward<T>(value));\n}\n\ninline option<void> make_some() {\n return option<void>();\n}\n\ntemplate <class T>\noption<T> make_none() {\n return option<T>();\n}\n\n}}\n\n#endif\n<commit_msg>Add `valid()` checker & remove unrequired constraints in `option` class<commit_after>\/*\n * FlightVars\n * Copyright (c) 2014 Alvaro Polo\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#ifndef FLIGHTVARS_UTIL_OPTION_H\n#define FLIGHTVARS_UTIL_OPTION_H\n\n#include <memory>\n\n#include <flightvars\/util\/exception.hpp>\n\nnamespace flightvars { namespace util {\n\nFV_DECL_EXCEPTION(option_undefined);\n\ntemplate <class T>\nclass option {\npublic: \n\n template <class T1> \n friend class option;\n\n option() : _data(nullptr) {}\n\n option(const T& data) : _data(new T(data)) {}\n\n option(T&& data) : _data(new T(std::move(data))) {}\n\n option(const option& other) : _data(other.is_defined() ? new T(other.get()) : nullptr) {}\n\n option(option&& other) : _data(std::move(other._data)) {}\n\n template <class T1>\n option(const option<T1>& other) : \n _data(other.is_defined() ? new T(other.get()) : nullptr) {}\n\n template <class T1>\n option(option<T1>&& other) : _data(std::move(other._data)) {}\n\n option& operator = (const option& other) {\n _data.reset(other.is_defined() ? new T(other.get()) : nullptr);\n return *this;\n }\n\n template <class T1>\n option& operator = (const option<T1>& other) {\n _data.reset(other.is_defined() ? new T(other.get()) : nullptr);\n return *this;\n }\n\n bool valid() const { return is_defined(); }\n\n bool is_defined() const { return bool(_data); }\n\n T& get() const {\n if (is_defined()) {\n return *_data;\n } else {\n throw option_undefined(\"cannot get on not defined option\");\n }\n }\n\n const T& get_or_else(const T& other) const {\n return is_defined() ? get() : other;\n }\n\n void set(const T& data) {\n _data.reset(new T(data));\n }\n\n T extract() {\n if (is_defined()) {\n auto r = std::move(*_data);\n _data.reset(nullptr);\n return std::move(r);\n } else {\n throw option_undefined(\"cannot extract on not defined option\");\n }\n }\n\n template <class T1, class Func>\n option<T1> map(const Func& f) const {\n return is_defined() ? option<T1>(f(get())) : option<T1>();\n }\n\n template <class T1, class Func>\n option<T1> fmap(const Func& f) const {\n return is_defined() ? f(get()) : option<T1>();\n }\n\n template <class Func>\n void foreach(const Func& f) const {\n if (is_defined()) {\n f(get());\n }\n }\n\nprivate:\n\n std::unique_ptr<T> _data;\n};\n\ntemplate <>\nclass option<void> {\npublic:\n\n template <class T1> \n friend class option;\n\n option(bool is_defined = false) : _is_defined(is_defined) {}\n\n option(const option& other) : _is_defined(other._is_defined) {}\n\n option& operator = (const option& other) {\n _is_defined = other._is_defined;\n return *this;\n }\n\n bool valid() const { return is_defined(); }\n\n bool is_defined() const { return _is_defined; }\n\n void get() const { \n if (!is_defined()) {\n throw option_undefined(\"cannot get on not defined option\");\n }\n }\n\n void set(bool is_defined = true) {\n _is_defined = is_defined;\n }\n\n void extract() {\n if (!is_defined()) {\n throw option_undefined(\"cannot extract on not defined option\");\n }\n _is_defined = false;\n }\n\nprivate:\n\n bool _is_defined;\n};\n\ntemplate <class T>\noption<T> make_some(const T& value) {\n return option<T>(value);\n}\n\ntemplate <class T>\noption<T> move_some(T&& value) {\n return option<T>(std::forward<T>(value));\n}\n\ninline option<void> make_some() {\n return option<void>();\n}\n\ntemplate <class T>\noption<T> make_none() {\n return option<T>();\n}\n\n}}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#pragma once\n\n\/\/ note: for an odd Qt-related issue, this python include has to come before\n\/\/ the Qt includes (because of the 'slots' macro)\n#include <boost\/python.hpp>\n\n#include <Geometry2d\/TransformMatrix.hpp>\n#include <Geometry2d\/Polygon.hpp>\n#include <Geometry2d\/Point.hpp>\n#include <Geometry2d\/CompositeShape.hpp>\n#include <Geometry2d\/ShapeSet.hpp>\n\n#include <set>\n#include <QMutex>\n#include <QString>\n\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\nclass OurRobot;\nclass SystemState;\n\n\/**\n * @brief Higher-level logic for soccer\n * @details The Gameplay namespace contains things like Plays, Behaviors,\n * Tactics\n * and the GameplayModule.\n *\/\nnamespace Gameplay {\n\n\/**\n * @brief Coordinator of high-level logic\n *\n * @details The gameplay module has an embedded python interpreter and serves as\n * the bridge between our python and c++ code.\n * The python side of things is responsible for high-level gameplay. At each\n * iteration of the main run loop, the GameplayModule\n * calls into python, which does all of the high-level planning, resulting in\n * updated motion targets, etc for the robots. The\n * GameplayModule then executes path planning for each OurRobot.\n *\/\nclass GameplayModule {\npublic:\n GameplayModule(SystemState* state);\n virtual ~GameplayModule();\n\n SystemState* state() const { return _state; }\n\n virtual void run();\n\n void setupUI();\n\n \/**\n * @brief Loads a playbook file to enable specified plays.\n * If isAbsolute is false, the path is treated as relative to the\n * playbooks directory. Otherwise, it is treated as an absolute path.\n *\/\n void loadPlaybook(const std::string& playbookFile, bool isAbsolute = false);\n\n \/**\n * @brief Saves the currently enabled plays to a playbook file\n * If isAbsolute is false, the path is treated as relative to the\n * playbooks directory. Otherwise, it is treated as an absolute path.\n *\/\n void savePlaybook(const std::string& playbookFile, bool isAbsolute = false);\n\n void goalieID(int value);\n int goalieID() { return _goalieID; }\n\n \/**\n * @defgroup matrices Coordinate Conversion Matrices\n * Each of these matrices converts coordinates from some other system\n * to team space.\n *\n * Example:\n * team = _gameplay->oppMatrix() * Geometry2d::Point(1, 0);\n *\/\n\n \/**\n * Centered on the ball\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix ballMatrix() const { return _ballMatrix; }\n\n \/**\n * Center of the field\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix centerMatrix() const { return _centerMatrix; }\n\n \/**\n * Opponent's coordinates\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix oppMatrix() const { return _oppMatrix; }\n\n \/\/\/ All robots on our team that are usable by plays\n const std::set<OurRobot*>& playRobots() const { return _playRobots; }\n\n void sendFieldDimensionsToPython();\n\n void calculateFieldObstacles();\n\n \/**\n * Returns the current set of global obstacles, including the field\n *\/\n Geometry2d::ShapeSet globalObstacles() const;\n\n \/\/\/ Returns a ShapeSet containing both goal zones\n Geometry2d::ShapeSet goalZoneObstacles() const;\n\nprotected:\n boost::python::object getRootPlay();\n\n \/\/\/ gets the instance of the main.py module that's loaded at GameplayModule\n boost::python::object getMainModule();\n\n boost::python::object getConstantsModule();\n\nprivate:\n \/\/\/ This protects all of Gameplay.\n \/\/\/ This is held while plays are running.\n QMutex _mutex;\n\n SystemState* _state;\n\n std::set<OurRobot*> _playRobots;\n\n Geometry2d::TransformMatrix _ballMatrix;\n Geometry2d::TransformMatrix _centerMatrix;\n Geometry2d::TransformMatrix _oppMatrix;\n\n \/\/\/ Obstacles to prevent using half the field\n std::shared_ptr<Geometry2d::Polygon> _ourHalf;\n std::shared_ptr<Geometry2d::Polygon> _opponentHalf;\n\n std::shared_ptr<Geometry2d::Shape> _sideObstacle;\n\n \/\/\/ outside of the floor boundaries\n std::shared_ptr<Geometry2d::Shape> _nonFloor[4];\n\n \/\/\/ goal areas\n std::shared_ptr<Geometry2d::CompositeShape> _ourGoalArea;\n std::shared_ptr<Geometry2d::CompositeShape> _theirGoalArea;\n\n std::shared_ptr<Geometry2d::Polygon> _ourGoal;\n std::shared_ptr<Geometry2d::Polygon> _theirGoal;\n\n \/\/\/ utility functions\n\n int _our_score_last_frame;\n\n \/\/ Shell ID of the robot to assign the goalie position\n int _goalieID;\n\n \/\/ python\n boost::python::object _mainPyNamespace;\n};\n}\n<commit_msg>removed getConstantsModule from hpp<commit_after>\n#pragma once\n\n\/\/ note: for an odd Qt-related issue, this python include has to come before\n\/\/ the Qt includes (because of the 'slots' macro)\n#include <boost\/python.hpp>\n\n#include <Geometry2d\/TransformMatrix.hpp>\n#include <Geometry2d\/Polygon.hpp>\n#include <Geometry2d\/Point.hpp>\n#include <Geometry2d\/CompositeShape.hpp>\n#include <Geometry2d\/ShapeSet.hpp>\n\n#include <set>\n#include <QMutex>\n#include <QString>\n\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\nclass OurRobot;\nclass SystemState;\n\n\/**\n * @brief Higher-level logic for soccer\n * @details The Gameplay namespace contains things like Plays, Behaviors,\n * Tactics\n * and the GameplayModule.\n *\/\nnamespace Gameplay {\n\n\/**\n * @brief Coordinator of high-level logic\n *\n * @details The gameplay module has an embedded python interpreter and serves as\n * the bridge between our python and c++ code.\n * The python side of things is responsible for high-level gameplay. At each\n * iteration of the main run loop, the GameplayModule\n * calls into python, which does all of the high-level planning, resulting in\n * updated motion targets, etc for the robots. The\n * GameplayModule then executes path planning for each OurRobot.\n *\/\nclass GameplayModule {\npublic:\n GameplayModule(SystemState* state);\n virtual ~GameplayModule();\n\n SystemState* state() const { return _state; }\n\n virtual void run();\n\n void setupUI();\n\n \/**\n * @brief Loads a playbook file to enable specified plays.\n * If isAbsolute is false, the path is treated as relative to the\n * playbooks directory. Otherwise, it is treated as an absolute path.\n *\/\n void loadPlaybook(const std::string& playbookFile, bool isAbsolute = false);\n\n \/**\n * @brief Saves the currently enabled plays to a playbook file\n * If isAbsolute is false, the path is treated as relative to the\n * playbooks directory. Otherwise, it is treated as an absolute path.\n *\/\n void savePlaybook(const std::string& playbookFile, bool isAbsolute = false);\n\n void goalieID(int value);\n int goalieID() { return _goalieID; }\n\n \/**\n * @defgroup matrices Coordinate Conversion Matrices\n * Each of these matrices converts coordinates from some other system\n * to team space.\n *\n * Example:\n * team = _gameplay->oppMatrix() * Geometry2d::Point(1, 0);\n *\/\n\n \/**\n * Centered on the ball\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix ballMatrix() const { return _ballMatrix; }\n\n \/**\n * Center of the field\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix centerMatrix() const { return _centerMatrix; }\n\n \/**\n * Opponent's coordinates\n * @ingroup matrices\n *\/\n Geometry2d::TransformMatrix oppMatrix() const { return _oppMatrix; }\n\n \/\/\/ All robots on our team that are usable by plays\n const std::set<OurRobot*>& playRobots() const { return _playRobots; }\n\n void sendFieldDimensionsToPython();\n\n void calculateFieldObstacles();\n\n \/**\n * Returns the current set of global obstacles, including the field\n *\/\n Geometry2d::ShapeSet globalObstacles() const;\n\n \/\/\/ Returns a ShapeSet containing both goal zones\n Geometry2d::ShapeSet goalZoneObstacles() const;\n\nprotected:\n boost::python::object getRootPlay();\n\n \/\/\/ gets the instance of the main.py module that's loaded at GameplayModule\n boost::python::object getMainModule();\n\nprivate:\n \/\/\/ This protects all of Gameplay.\n \/\/\/ This is held while plays are running.\n QMutex _mutex;\n\n SystemState* _state;\n\n std::set<OurRobot*> _playRobots;\n\n Geometry2d::TransformMatrix _ballMatrix;\n Geometry2d::TransformMatrix _centerMatrix;\n Geometry2d::TransformMatrix _oppMatrix;\n\n \/\/\/ Obstacles to prevent using half the field\n std::shared_ptr<Geometry2d::Polygon> _ourHalf;\n std::shared_ptr<Geometry2d::Polygon> _opponentHalf;\n\n std::shared_ptr<Geometry2d::Shape> _sideObstacle;\n\n \/\/\/ outside of the floor boundaries\n std::shared_ptr<Geometry2d::Shape> _nonFloor[4];\n\n \/\/\/ goal areas\n std::shared_ptr<Geometry2d::CompositeShape> _ourGoalArea;\n std::shared_ptr<Geometry2d::CompositeShape> _theirGoalArea;\n\n std::shared_ptr<Geometry2d::Polygon> _ourGoal;\n std::shared_ptr<Geometry2d::Polygon> _theirGoal;\n\n \/\/\/ utility functions\n\n int _our_score_last_frame;\n\n \/\/ Shell ID of the robot to assign the goalie position\n int _goalieID;\n\n \/\/ python\n boost::python::object _mainPyNamespace;\n};\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"mfile.h\"\n#include <iostream>\n#include <chrono>\n#include <random>\n\nusing namespace std;\nusing namespace std::chrono;\n\n\n\n#define START_TEST(MESSAGE)\\\nvoid test_##MESSAGE()\\\n{\\\n const char * message = \"\" #MESSAGE \"\";\\\n MemoryMapped file(\"data.dat\");\\\n auto start = high_resolution_clock::now();\\\n auto fileSize = file.size();\n\n#define END_TEST\\\n file.flush();\\\n auto end = high_resolution_clock::now();\\\n auto dur = duration_cast<milliseconds>(end - start).count();\\\n std::cout << message << \" time: \" << dur << \"ms\" << std::endl;\\\n}\n\n\n\nSTART_TEST(forward_read)\nuint8_t x;\nfor (uint64_t c = 0; c < fileSize; ++c) {\n x = file[c];\n}\nEND_TEST\n\nSTART_TEST(backward_read)\nuint8_t x;\nfor (uint64_t c = fileSize - 1; c > 0; --c) {\n x = file[c];\n}\nEND_TEST\n\nSTART_TEST(stride_forward_read)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = 0; c + r < fileSize; c += MemoryMapped::pageSize) {\n x = file[c + r];\n }\n}\nEND_TEST\n\n\nSTART_TEST(stride_backward_read)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = file.size() - 1; c - r > 0 && c - r < fileSize; c -= MemoryMapped::pageSize) {\n x = file[c - r];\n }\n}\nEND_TEST\n\n\n\n\nSTART_TEST(forward_write)\nfor (uint64_t c = 0; c < fileSize; ++c) {\n file[c] = c % 255;\n}\nEND_TEST\n\nSTART_TEST(backward_write)\nuint8_t x;\nfor (uint64_t c = fileSize - 1; c > 0; --c) {\n file[c] = c % 255;\n}\nEND_TEST\n\nSTART_TEST(stride_forward_write)\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = 0; c + r < fileSize; c += MemoryMapped::pageSize) {\n file[c + r] = c % 255;\n }\n}\nEND_TEST\n\n\nSTART_TEST(stride_backward_write)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = file.size() - 1; c - r > 0 && c - r < fileSize; c -= MemoryMapped::pageSize) {\n file[c - r] = c % 255;\n }\n}\nEND_TEST\n\n\nrandom_device dev;\nmt19937 rnd(dev());\n\nSTART_TEST(random_read_100000)\nuniform_int_distribution<uint64_t> dist(0, fileSize - 1);\nuint64_t x;\nfor (uint64_t c = 0; c < 100000; ++c) {\n x = file[dist(rnd)];\n}\nEND_TEST\n\nSTART_TEST(random_write_100000)\nuniform_int_distribution<uint64_t> dist(0, fileSize - 1);\nfor (uint64_t c = 0; c < 100000; ++c) {\n file[dist(rnd)] = c % 255;\n}\nEND_TEST\n\n\n\nint main() {\n try {\n test_forward_read();\n test_backward_read();\n\n test_stride_forward_read();\n test_stride_backward_read();\n \n test_forward_write();\n test_backward_write();\n\n test_stride_forward_write();\n test_stride_backward_write();\n\n test_random_read_100000();\n test_random_write_100000();\n\n } catch (std::exception & e) {\n std::cerr << e.what() << std::endl;\n }\n\n std::cout << \"done\";\n\n return 0;\n}\n<commit_msg>Add random part to writes so we avoid optimization<commit_after>#include \"mfile.h\"\n#include <iostream>\n#include <chrono>\n#include <random>\n\nusing namespace std;\nusing namespace std::chrono;\n\nrandom_device dev;\nmt19937 rnd(dev());\n\nchar writeSeed = dev() % 255;\n\n\n#define START_TEST(MESSAGE)\\\nvoid test_##MESSAGE()\\\n{\\\n const char * message = \"\" #MESSAGE \"\";\\\n MemoryMapped file(\"data.dat\");\\\n auto start = high_resolution_clock::now();\\\n auto fileSize = file.size();\n\n#define END_TEST\\\n file.flush();\\\n auto end = high_resolution_clock::now();\\\n auto dur = duration_cast<milliseconds>(end - start).count();\\\n std::cout << message << \" time: \" << dur << \"ms\" << std::endl;\\\n}\n\n\n\nSTART_TEST(forward_read)\nuint8_t x;\nfor (uint64_t c = 0; c < fileSize; ++c) {\n x = file[c];\n}\nEND_TEST\n\nSTART_TEST(backward_read)\nuint8_t x;\nfor (uint64_t c = fileSize - 1; c > 0; --c) {\n x = file[c];\n}\nEND_TEST\n\nSTART_TEST(stride_forward_read)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = 0; c + r < fileSize; c += MemoryMapped::pageSize) {\n x = file[c + r];\n }\n}\nEND_TEST\n\n\nSTART_TEST(stride_backward_read)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = file.size() - 1; c - r > 0 && c - r < fileSize; c -= MemoryMapped::pageSize) {\n x = file[c - r];\n }\n}\nEND_TEST\n\n\n\n\nSTART_TEST(forward_write)\nfor (uint64_t c = 0; c < fileSize; ++c) {\n file[c] = writeSeed + c;\n}\nEND_TEST\n\nSTART_TEST(backward_write)\nuint8_t x;\nfor (uint64_t c = fileSize - 1; c > 0; --c) {\n file[c] = writeSeed + c;\n}\nEND_TEST\n\nSTART_TEST(stride_forward_write)\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = 0; c + r < fileSize; c += MemoryMapped::pageSize) {\n file[c + r] = writeSeed + c;\n }\n}\nEND_TEST\n\n\nSTART_TEST(stride_backward_write)\nuint8_t x;\nfor (int r = 0; r < 10; ++r) {\n for (uint64_t c = file.size() - 1; c - r > 0 && c - r < fileSize; c -= MemoryMapped::pageSize) {\n file[c - r] = writeSeed + c;\n }\n}\nEND_TEST\n\n\n\nSTART_TEST(random_read_100000)\nuniform_int_distribution<uint64_t> dist(0, fileSize - 1);\nuint64_t x;\nfor (uint64_t c = 0; c < 100000; ++c) {\n x = file[dist(rnd)];\n}\nEND_TEST\n\nSTART_TEST(random_write_100000)\nuniform_int_distribution<uint64_t> dist(0, fileSize - 1);\nfor (uint64_t c = 0; c < 100000; ++c) {\n file[dist(rnd)] = writeSeed + c;\n}\nEND_TEST\n\n\n\nint main() {\n try {\n test_forward_read();\n test_backward_read();\n\n test_stride_forward_read();\n test_stride_backward_read();\n \n test_forward_write();\n test_backward_write();\n\n test_stride_forward_write();\n test_stride_backward_write();\n\n test_random_read_100000();\n test_random_write_100000();\n\n } catch (std::exception & e) {\n std::cerr << e.what() << std::endl;\n }\n\n std::cout << \"done\";\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"global.h\"\n\n\/*\nCreated by: Avery Reed on 2\/14\/17\nLast Edited by: Avery Reed 2\/14\/17\n*\/\n\nGlobal::Global() {\n setAnnotation(1);\n out(\"Global variables and functions initiated.\\n\");\n}\n\nGlobal::~Global() {\n out(\"Deconstructing global class.\\n\");\n}\n<commit_msg>Delete global.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2013-2015 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n \/**\n * @file HMC5883_I2C.cpp\n *\n * I2C interface for HMC5883 \/ HMC 5983\n *\/\n\n\/* XXX trim includes *\/\n#include <nuttx\/config.h>\n\n#include <sys\/types.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <string.h>\n#include <assert.h>\n#include <debug.h>\n#include <errno.h>\n#include <unistd.h>\n\n#include <arch\/board\/board.h>\n\n#include <drivers\/device\/i2c.h>\n#include <drivers\/drv_mag.h>\n#include <drivers\/drv_device.h>\n\n#include \"hmc5883.h\"\n\n#include \"board_config.h\"\n\n#ifdef PX4_I2C_OBDEV_HMC5883\n\n#define HMC5883L_ADDRESS\t\tPX4_I2C_OBDEV_HMC5883\n\ndevice::Device *HMC5883_I2C_interface(int bus);\n\nclass HMC5883_I2C : public device::I2C\n{\npublic:\n\tHMC5883_I2C(int bus);\n\tvirtual ~HMC5883_I2C();\n\n\tvirtual int\tinit();\n\tvirtual int\tread(unsigned address, void *data, unsigned count); \n\tvirtual int\twrite(unsigned address, void *data, unsigned count);\n\n\tvirtual int\tioctl(unsigned operation, unsigned &arg);\n\nprotected:\n\tvirtual int\tprobe();\n\n};\n\ndevice::Device *\nHMC5883_I2C_interface(int bus)\n{\n\treturn new HMC5883_I2C(bus);\n}\n\nHMC5883_I2C::HMC5883_I2C(int bus) :\n\tI2C(\"HMC5883_I2C\", nullptr, bus, HMC5883L_ADDRESS, 400000)\n{\n\t_device_id.devid_s.devtype = DRV_MAG_DEVTYPE_HMC5883;\n}\n\nHMC5883_I2C::~HMC5883_I2C()\n{\n}\n\nint\nHMC5883_I2C::init()\n{\n\t\/* this will call probe() *\/\n\treturn I2C::init();\n}\n\nint\nHMC5883_I2C::ioctl(unsigned operation, unsigned &arg)\n{\n\tint ret;\n\n\tswitch (operation) {\n\n\tcase MAGIOCGEXTERNAL:\n\t\tif (_bus == PX4_I2C_BUS_EXPANSION) {\n\t\t\treturn 1;\n\t\t} else {\n\t\t\treturn 0;\n\t\t}\n\n\tcase DEVIOCGDEVICEID:\n\t\treturn CDev::ioctl(nullptr, operation, arg);\n\n\tdefault:\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nint\nHMC5883_I2C::probe()\n{\n\tuint8_t data[3] = {0, 0, 0};\n\n\t_retries = 10;\n\n\tif (read(ADDR_ID_A, &data[0], 1) ||\n\t read(ADDR_ID_B, &data[1], 1) ||\n\t read(ADDR_ID_C, &data[2], 1)) {\n\t\tdebug(\"read_reg fail\");\n\t\treturn -EIO;\n\t}\n\n\t_retries = 2;\n\n\tif ((data[0] != ID_A_WHO_AM_I) ||\n\t (data[1] != ID_B_WHO_AM_I) ||\n\t (data[2] != ID_C_WHO_AM_I)) {\n\t\tdebug(\"ID byte mismatch (%02x,%02x,%02x)\", data[0], data[1], data[2]);\n\t\treturn -EIO;\n\t}\n\n\treturn OK;\n}\n\nint\nHMC5883_I2C::write(unsigned address, void *data, unsigned count)\n{\n\tuint8_t buf[32];\n\n\tif (sizeof(buf) < (count + 1)) {\n\t\treturn -EIO;\n\t}\n\n\tbuf[0] = address;\n\tmemcpy(&buf[1], data, count);\n\n\treturn transfer(&buf[0], count + 1, nullptr, 0);\n}\n\nint\nHMC5883_I2C::read(unsigned address, void *data, unsigned count)\n{\n\tuint8_t cmd = address;\n\treturn transfer(&cmd, 1, (uint8_t *)data, count);\n}\n\n#endif \/* PX4_I2C_OBDEV_HMC5883 *\/\n<commit_msg>hmc5883: Fix for Issue1858 detection of MAG on Int\/Ext I2C Bus.<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2013-2015 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n \/**\n * @file HMC5883_I2C.cpp\n *\n * I2C interface for HMC5883 \/ HMC 5983\n *\/\n\n\/* XXX trim includes *\/\n#include <nuttx\/config.h>\n\n#include <sys\/types.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <string.h>\n#include <assert.h>\n#include <debug.h>\n#include <errno.h>\n#include <unistd.h>\n\n#include <arch\/board\/board.h>\n\n#include <drivers\/device\/i2c.h>\n#include <drivers\/drv_mag.h>\n#include <drivers\/drv_device.h>\n\n#include \"hmc5883.h\"\n\n#include \"board_config.h\"\n\n#ifdef PX4_I2C_OBDEV_HMC5883\n\n#define HMC5883L_ADDRESS\t\tPX4_I2C_OBDEV_HMC5883\n\ndevice::Device *HMC5883_I2C_interface(int bus);\n\nclass HMC5883_I2C : public device::I2C\n{\npublic:\n\tHMC5883_I2C(int bus);\n\tvirtual ~HMC5883_I2C();\n\n\tvirtual int\tinit();\n\tvirtual int\tread(unsigned address, void *data, unsigned count); \n\tvirtual int\twrite(unsigned address, void *data, unsigned count);\n\n\tvirtual int\tioctl(unsigned operation, unsigned &arg);\n\nprotected:\n\tvirtual int\tprobe();\n\n};\n\ndevice::Device *\nHMC5883_I2C_interface(int bus)\n{\n\treturn new HMC5883_I2C(bus);\n}\n\nHMC5883_I2C::HMC5883_I2C(int bus) :\n\tI2C(\"HMC5883_I2C\", nullptr, bus, HMC5883L_ADDRESS, 400000)\n{\n\t_device_id.devid_s.devtype = DRV_MAG_DEVTYPE_HMC5883;\n}\n\nHMC5883_I2C::~HMC5883_I2C()\n{\n}\n\nint\nHMC5883_I2C::init()\n{\n\t\/* this will call probe() *\/\n\treturn I2C::init();\n}\n\nint\nHMC5883_I2C::ioctl(unsigned operation, unsigned &arg)\n{\n\tint ret;\n\n\tswitch (operation) {\n\n\tcase MAGIOCGEXTERNAL:\n\/\/ On PX4v1 the MAG can be on an internal I2C\n\/\/ On everything else its always external\n#ifdef CONFIG_ARCH_BOARD_PX4FMU_V1\n\t\tif (_bus == PX4_I2C_BUS_EXPANSION) {\n\t\t\treturn 1;\n\t\t} else {\n\t\t\treturn 0;\n\t\t}\n#else\n return 1;\n#endif\n\n\tcase DEVIOCGDEVICEID:\n\t\treturn CDev::ioctl(nullptr, operation, arg);\n\n\tdefault:\n\t\tret = -EINVAL;\n\t}\n\n\treturn ret;\n}\n\nint\nHMC5883_I2C::probe()\n{\n\tuint8_t data[3] = {0, 0, 0};\n\n\t_retries = 10;\n\n\tif (read(ADDR_ID_A, &data[0], 1) ||\n\t read(ADDR_ID_B, &data[1], 1) ||\n\t read(ADDR_ID_C, &data[2], 1)) {\n\t\tdebug(\"read_reg fail\");\n\t\treturn -EIO;\n\t}\n\n\t_retries = 2;\n\n\tif ((data[0] != ID_A_WHO_AM_I) ||\n\t (data[1] != ID_B_WHO_AM_I) ||\n\t (data[2] != ID_C_WHO_AM_I)) {\n\t\tdebug(\"ID byte mismatch (%02x,%02x,%02x)\", data[0], data[1], data[2]);\n\t\treturn -EIO;\n\t}\n\n\treturn OK;\n}\n\nint\nHMC5883_I2C::write(unsigned address, void *data, unsigned count)\n{\n\tuint8_t buf[32];\n\n\tif (sizeof(buf) < (count + 1)) {\n\t\treturn -EIO;\n\t}\n\n\tbuf[0] = address;\n\tmemcpy(&buf[1], data, count);\n\n\treturn transfer(&buf[0], count + 1, nullptr, 0);\n}\n\nint\nHMC5883_I2C::read(unsigned address, void *data, unsigned count)\n{\n\tuint8_t cmd = address;\n\treturn transfer(&cmd, 1, (uint8_t *)data, count);\n}\n\n#endif \/* PX4_I2C_OBDEV_HMC5883 *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts_tizen.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/files\/file_path.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"xwalk\/application\/browser\/application.h\"\n#include \"xwalk\/application\/browser\/application_service.h\"\n#include \"xwalk\/application\/browser\/application_system.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_runner.h\"\n#include \"xwalk\/runtime\/common\/xwalk_runtime_features.h\"\n#include \"xwalk\/sysapps\/raw_socket\/raw_socket_extension.h\"\n#include \"ui\/gl\/gl_switches.h\"\n#include \"ui\/gfx\/switches.h\"\n\n#include \"content\/browser\/device_orientation\/device_inertial_sensor_service.h\"\n#include \"xwalk\/application\/browser\/installer\/tizen\/package_installer.h\"\n#include \"xwalk\/runtime\/extension\/screen_orientation_extension.h\"\n#include \"xwalk\/sysapps\/device_capabilities\/device_capabilities_extension.h\"\n#include \"xwalk\/tizen\/mobile\/sensor\/tizen_data_fetcher_shared_memory.h\"\n\nnamespace xwalk {\n\nusing application::Application;\n\nXWalkBrowserMainPartsTizen::XWalkBrowserMainPartsTizen(\n const content::MainFunctionParams& parameters)\n : XWalkBrowserMainParts(parameters) {\n}\n\nvoid XWalkBrowserMainPartsTizen::PreMainMessageLoopStart() {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n command_line->AppendSwitch(switches::kIgnoreGpuBlacklist);\n\n const char* gl_name;\n if (base::PathExists(base::FilePath(\"\/usr\/lib\/xwalk\/libosmesa.so\")))\n gl_name = gfx::kGLImplementationOSMesaName;\n else if (base::PathExists(base::FilePath(\"\/usr\/lib\/libGL.so\")))\n gl_name = gfx::kGLImplementationDesktopName;\n else\n gl_name = gfx::kGLImplementationEGLName;\n command_line->AppendSwitchASCII(switches::kUseGL, gl_name);\n\n \/\/ Workaround to provide viewport meta tag proper behavior on Tizen.\n \/\/ FIXME: Must be removed when Chromium r235967 is in place.\n command_line->AppendSwitchASCII(switches::kForceDeviceScaleFactor, \"2.0\");\n\n XWalkBrowserMainParts::PreMainMessageLoopStart();\n}\n\nvoid XWalkBrowserMainPartsTizen::PreMainMessageLoopRun() {\n if (content::DeviceInertialSensorService* sensor_service =\n content::DeviceInertialSensorService::GetInstance()) {\n \/\/ As the data fetcher of sensors is implemented outside of Chromium, we\n \/\/ need to make it available to Chromium by \"abusing\" the test framework.\n \/\/ TODO(zliang7): Find a decent way to inject our sensor fetcher for Tizen.\n sensor_service->SetDataFetcherForTests(new TizenDataFetcherSharedMemory());\n }\n\n XWalkBrowserMainParts::PreMainMessageLoopRun();\n}\n\n\/\/ static.\nOrientationMask XWalkBrowserMainPartsTizen::GetAllowedUAOrientations() {\n char* env = getenv(\"TIZEN_ALLOWED_ORIENTATIONS\");\n int value = env ? atoi(env) : 0;\n if (value > 0 && value < (1 << 4))\n return static_cast<OrientationMask>(value);\n\n \/\/ Tizen mobile supports all orientations by default.\n return ANY;\n}\n\nvoid XWalkBrowserMainPartsTizen::CreateInternalExtensionsForUIThread(\n content::RenderProcessHost* host,\n extensions::XWalkExtensionVector* extensions) {\n XWalkBrowserMainParts::CreateInternalExtensionsForUIThread(\n host, extensions);\n \/\/ FIXME(Mikhail): move this code to a dedicated XWalkComponent.\n application::ApplicationSystem* app_system = xwalk_runner_->app_system();\n application::ApplicationService* app_service\n = app_system->application_service();\n Application* application =\n app_service->GetApplicationByRenderHostID(host->GetID());\n if (!application)\n return;\n extensions->push_back(new ScreenOrientationExtension(\n application, GetAllowedUAOrientations()));\n}\n\n} \/\/ namespace xwalk\n<commit_msg>Fix Tizen build after PR#1489<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts_tizen.h\"\n\n#include \"base\/file_util.h\"\n#include \"base\/files\/file_path.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/common\/content_switches.h\"\n#include \"xwalk\/application\/browser\/application.h\"\n#include \"xwalk\/application\/browser\/application_service.h\"\n#include \"xwalk\/application\/browser\/application_system.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_runner.h\"\n#include \"xwalk\/runtime\/common\/xwalk_runtime_features.h\"\n#include \"xwalk\/sysapps\/raw_socket\/raw_socket_extension.h\"\n#include \"ui\/gl\/gl_switches.h\"\n#include \"ui\/gfx\/switches.h\"\n\n#include \"content\/browser\/device_orientation\/device_inertial_sensor_service.h\"\n#include \"xwalk\/application\/browser\/installer\/tizen\/package_installer.h\"\n#include \"xwalk\/runtime\/extension\/screen_orientation_extension.h\"\n#include \"xwalk\/sysapps\/device_capabilities\/device_capabilities_extension.h\"\n#include \"xwalk\/tizen\/mobile\/sensor\/tizen_data_fetcher_shared_memory.h\"\n\nnamespace xwalk {\n\nusing application::Application;\n\nXWalkBrowserMainPartsTizen::XWalkBrowserMainPartsTizen(\n const content::MainFunctionParams& parameters)\n : XWalkBrowserMainParts(parameters) {\n}\n\nvoid XWalkBrowserMainPartsTizen::PreMainMessageLoopStart() {\n CommandLine* command_line = CommandLine::ForCurrentProcess();\n command_line->AppendSwitch(switches::kIgnoreGpuBlacklist);\n\n const char* gl_name;\n if (base::PathExists(base::FilePath(\"\/usr\/lib\/xwalk\/libosmesa.so\")))\n gl_name = gfx::kGLImplementationOSMesaName;\n else if (base::PathExists(base::FilePath(\"\/usr\/lib\/libGL.so\")))\n gl_name = gfx::kGLImplementationDesktopName;\n else\n gl_name = gfx::kGLImplementationEGLName;\n command_line->AppendSwitchASCII(switches::kUseGL, gl_name);\n\n \/\/ Workaround to provide viewport meta tag proper behavior on Tizen.\n \/\/ FIXME: Must be removed when Chromium r235967 is in place.\n command_line->AppendSwitchASCII(switches::kForceDeviceScaleFactor, \"2.0\");\n\n XWalkBrowserMainParts::PreMainMessageLoopStart();\n}\n\nvoid XWalkBrowserMainPartsTizen::PreMainMessageLoopRun() {\n if (content::DeviceInertialSensorService* sensor_service =\n content::DeviceInertialSensorService::GetInstance()) {\n \/\/ As the data fetcher of sensors is implemented outside of Chromium, we\n \/\/ need to make it available to Chromium by \"abusing\" the test framework.\n \/\/ TODO(zliang7): Find a decent way to inject our sensor fetcher for Tizen.\n sensor_service->SetDataFetcherForTests(new TizenDataFetcherSharedMemory());\n }\n\n XWalkBrowserMainParts::PreMainMessageLoopRun();\n}\n\n\/\/ static.\nOrientationMask XWalkBrowserMainPartsTizen::GetAllowedUAOrientations() {\n char* env = getenv(\"TIZEN_ALLOWED_ORIENTATIONS\");\n int value = env ? atoi(env) : 0;\n if (value > 0 && value < (1 << 4))\n return static_cast<OrientationMask>(value);\n\n \/\/ Tizen mobile supports all orientations by default.\n return ANY;\n}\n\nvoid XWalkBrowserMainPartsTizen::CreateInternalExtensionsForUIThread(\n content::RenderProcessHost* host,\n extensions::XWalkExtensionVector* extensions) {\n XWalkBrowserMainParts::CreateInternalExtensionsForUIThread(\n host, extensions);\n \/\/ FIXME(Mikhail): move this code to a dedicated XWalkComponent.\n application::ApplicationSystem* app_system = xwalk_runner_->app_system();\n application::ApplicationService* app_service\n = app_system->application_service();\n Application* application =\n app_service->GetApplicationByRenderHostID(host->GetID());\n if (!application)\n return;\n extensions->push_back(new ScreenOrientationExtension(\n application, GetAllowedUAOrientations()));\n}\n\n} \/\/ namespace xwalk\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdlib>\n#include <vector>\n#include <string>\n#include <queue>\n#include <sys\/stat.h>\n\n\/\/getlogin() and gethostname().\n#include <unistd.h>\n\n\/\/perror.\n#include <stdio.h>\n\n\/\/fork,wait and execvp.\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n\/\/boost!\n#include \"boost\/algorithm\/string.hpp\"\n#include \"boost\/tokenizer.hpp\"\n#include \"boost\/foreach.hpp\"\n\n\/\/that one class.\n#include \"Command.h\"\n\nusing namespace std;\nusing namespace boost;\n\n\/\/execute command.\nvoid execute(const vector<string> & s);\n\n\/\/replaces char in string.\nvoid replace_char(string &s, char o, char r);\n\n\/\/takes a string and returns vector of parsed string.\nvector<string> parseInput(string s);\n\n\/\/display vector.\ntemplate<typename unit>\nvoid display_vector(vector<unit> v);\n\n\/\/helper function that finds amount of character.\nint find_char_amount(const string s,char c);\n\n\/\/removes comment from input.\nvoid remove_comment(string &s);\n\n\/\/removes char in string.\nvoid remove_char(string &s, char c);\n\n\/\/checks if string passed in contains a flag\nbool isFlag(string f);\n\n\/\/creates command types from vector of strings.\nvector<Command> create_commands(const vector<string> &v);\n\nint main()\n{\n \/\/grab the login.\n char* login = getlogin();\n\n \/\/start a flag.\n bool login_check = true;\n\n if((!login) != 0)\n {\n \/\/check flag.\n login_check = false;\n \n \/\/output error.\n perror(\"Error: could not retrieve login name\");\n }\n\n \/\/hold c-string for host name.\n char host[150];\n\n \/\/start another flag.\n bool host_check = true;\n\n \/\/gets hostname while checking if it actually grabbed it.\n if(gethostname(host,sizeof(host)) != 0)\n {\n \/\/check flag.\n host_check = false;\n\n \/\/output error.\n perror(\"Error: could not rerieve host name.\");\n }\n\n \/\/warn user of upcoming trouble.\n if(login_check == false || host_check == false)\n cout << \"Unable to display login and\/or host information.\" << endl;\n \n \/\/string to hold user input.\n string input;\n\n while(true)\n {\n \/\/output login@hostname.\n if(login_check && host_check)\n cout << login << '@' << host << ' '; \n\n \/\/bash money.\n cout << \"$ \"; \n\n \/\/placeholder to tell its the program.\n cout << \" (program) \";\n\n \/\/geting input as a string.\n getline(cin,input);\n\n \/\/remove extra white space.\n trim(input);\n\n \/\/remove comments.\n remove_comment(input);\n \n \/\/trim again just in case.\n trim(input);\n\n \/\/testing parse.\n cout << \"Testing parse\" << endl;\n display_vector(parseInput(input));\n\n \/\/execute command.\n execute(parseInput(input));\n\n }\n\n cout << \"End of program\" << endl;\n \n return 0;\n}\n\nvoid execute(const vector<string> &s)\n{\n \/\/check to see if user wants to quit and its the only command.\n if(s.size() == 1)\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == \"exit\")\n exit(0);\n \n \/\/c-string to hold command.\n char* args[2048];\n \n \/\/place, remove comments and convert commands.\n for(unsigned int i = 0; i < s.size(); ++i)\n {\n string temp = s.at(i);\n remove_char(temp,'\\\"');\n args[i] = (char*)temp.c_str();\n }\n args[s.size()] = NULL;\n\n \/\/creates fork process.\n pid_t pid = fork();\n\n if(pid == -1)\n {\n \/\/fork didn't work.\n perror(\"fork\");\n }\n if(pid ==0)\n {\n if(execvp(args[0], args) == -1)\n {\n \/\/execute didn't work.\n perror(\"execvp\");\n \n \/\/break out of shadow realm.\n exit(1);\n }\n\n }\n if(pid > 0)\n {\n \/\/wait for child to die.\n if(wait(0) == -1)\n {\n \/\/didnt wait.\n perror(\"wait\");\n }\n }\n \n return;\n}\n\nvector<string> parseInput(string s)\n{\n\n \/\/replace spaces.\n replace_char(s,' ','*');\n\n \/\/make temp vector to hold parsed strings.\n vector<string> temp;\n\n \/\/create boost magic function.\n char_separator<char> sep(\" ;||&&(){}\", \";||&&()[]\",keep_empty_tokens);\n\n \/\/create boost magic holder thingy.\n tokenizer< char_separator<char> > cm(s,sep);\n\n \/\/for each loop to grab each peice and push it into a vector.\n for(tokenizer< char_separator<char> >::iterator it = cm.begin(); it != cm.end(); ++it)\n if(*it != \"\")\n {\n \/\/fix string.\n string temp_string = *it;\n replace_char(temp_string,'*',' ');\n temp.push_back(temp_string);\n }\n\n \/\/return that vector.\n return temp;\n}\n\nvoid replace_char(string &s, char o, char r)\n{\n \/\/different use for the function.\n if(o == '\\\"')\n {\n \/\/nothing to replace.\n if(s.find(o) == string::npos)\n return;\n \n \/\/replace.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == o)\n s.at(i) = r;\n\n return;\n\n }\n\n \/\/no quotes.\n if(s.find(\"\\\"\") == string::npos)\n return;\n else if(s.find(o) == string::npos)\n return;\n\n \/\/vector to hold quote positions.\n vector<int> pos;\n\n \/\/place positions of char into vector.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == '\\\"')\n pos.push_back(i); \n \n \/\/count position.\n unsigned int count = 0;\n \n \/\/replace.\n while(count < pos.size()) \n {\n for(int i = pos.at(count); i < pos.at(count+1); ++i)\n if(s.at(i) == o)\n s.at(i) = r;\n \n count++;\n count++;\n } \n\n return;\n}\n\ntemplate<typename unit>\nvoid display_vector(vector<unit> v)\n{\n for(unsigned int i = 0; i < v.size(); ++i)\n cout << i+1 << \": \" << v.at(i) << endl;\n return;\n}\n\nvoid remove_comment(string &s)\n{\n \/\/just add a \" to the end to avoid errors.\n if(find_char_amount(s,'\\\"') % 2 != 0)\n s += '\\\"';\n\n \/\/delete everything!\n if(s.find(\"#\") == 0)\n {\n s = \"\";\n return;\n }\n\n \/\/return if no comments.\n if(s.find(\"#\") == string::npos)\n {\n return;\n }\n\n \/\/if no comments then deletes everything from hash forward.\n if(s.find(\"\\\"\") == string::npos && s.find(\"#\") != string::npos)\n {\n s = s.substr(0,s.find(\"#\"));\n return;\n }\n\n \/\/if comment before quote then delete.\n if(s.find(\"\\\"\") > s.find(\"#\"))\n {\n s = s.substr(0,s.find(\"#\"));\n return;\n }\n\n \/\/advanced situations.\n \/\/get a vector to hold positions of quotes and hash.\n vector<int> quotePos;\n vector<int> hashPos;\n\n \/\/grab pos.\n for(unsigned int i = 0; i < s.size(); ++i)\n {\n if(s.at(i) == '\\\"')\n quotePos.push_back(i);\n else if(s.at(i) == '#')\n hashPos.push_back(i);\n }\n\n \/\/no comments or hash for some reason.\n if(hashPos.size() == 0 || quotePos.size() == 0)\n return;\n \n \/\/just in case.\n if(quotePos.size() % 2 != 0)\n quotePos.push_back(0);\n\n \/\/overall check;\n vector<bool> check;\n \n \/\/start it up.\n for(unsigned int i = 0; i < hashPos.size(); ++i)\n check.push_back(true);\n \n \/\/check if hash is in quotes.\n for(unsigned int i = 0; i < hashPos.size(); ++i )\n for(unsigned int j = 0; j < quotePos.size(); j+=2 )\n {\n if(hashPos.at(i) > quotePos.at(j) && hashPos.at(i) < quotePos.at(j+1))\n {\n check.at(i) = true;\n break;\n }\n else\n check.at(i) = false;\n }\n\n \/\/check bool vector to delete string.\n for(unsigned int i = 0; i < check.size(); ++i)\n if(!check.at(i))\n {\n s = s.substr(0,hashPos.at(i));\n return;\n }\n\n \/\/if comment at end then kill it.\n if(hashPos.at(hashPos.size()-1) > quotePos.at(quotePos.size()-1))\n s = s.substr(0,hashPos.at(hashPos.size()-1)); \n \n return;\n}\n\nint find_char_amount(const string s, char c)\n{\n if(s.find(c) == string::npos)\n return 0;\n\n int count = 0;\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == c)\n count++;\n return count;\n\n}\n\nvoid remove_char(string &s, char c)\n{\n \/\/if not there then just return.\n if(s.find(c) == string::npos)\n return;\n \n \/\/start empty.\n string temp = \"\";\n\n \/\/add everything thats not what we dont want.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) != c)\n temp += s.at(i);\n\n \/\/transfer to s.\n s = temp;\n\n return;\n}\n\nint is_connector(string s)\n{\n if(s == \";\")\n\t\treturn 1;\n\tif(s == \"&&\")\n\t\treturn 2;\n\tif(s == \"||\")\n\t\treturn 3;\n\t\t\t\t\t\t\t\t\t \n\treturn -1;\n}\n\nbool isFlag(string f)\n{\t\/\/default list of possible flags\n\tstring flags = \"-e -d -f\";\n\t\/\/see if string is one of the flags\n\tif (flags.find(f) != string::npos)\n\t\treturn true;\n\treturn false;\n}\n\n\/*\nbool test(vector<string> &commands, vector<char*> &command_v)\n{\t\n\t\/\/defaults to \"-e\"\n\tstring flag = \"-e\";\n\n\tstruct stat s_thing;\n\n\t\/\/put everything into a queue for ease of use\n\tqueue<string> coms;\n\tfor (unsigned int i = 0; i < commands.size(); i++)\n\t{\n\t\tcoms.push_back(commands.at(i));\n\t}\n\n\t\/\/was a bracket used for the test command?\n\tbool bracketUsed = false;\n\n\t\/\/set if a bracket was used\n\tif(coms.front() == \"[\";\n\t\tbracketUsed = true;\n\t\n\t\/\/remove the first part of the command regardless of whether it's \"test\" or \"[\"\n\tcoms.pop();\n\t\n\tif (isTestFlag(coms.front()))\n\t{\n\t\tflag = coms.front();\n\t\t\/\/now we have the flag for the test\n\t\tcoms.pop()\n\t}\n\t\n\t\/\/if there's another flag attempt then it's broken\n\tif (coms.front().at(0) == \"-\")\n\t{\n\t\tcout << \"ERROR: incorrect flags\" << endl;\n\t\t\n\t\t\/\/keep deleting from queue till the next command\n\t\twhile (!is_connector(coms.front()))\n\t\t{\n\t\t\tcoms.pop();\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/\/ if the first part of the path is a \"\/\" remove it (that way it can't mess up)\n\tif(coms.front().at(0) == \"\/\")\n\t\tcommands.front().substr(1, commands.front().size() - 1);\n\t\n\t\/\/make a new c_string to hold the file path\n\tchar *filePath = new char[coms.front.size()];\n\t\n\t\/\/copy it on over from the command vector\n\tstrcpy(filePath, coms.front().c_str());\n\tcommand_v.push_back(filePath);\n\n\t\/\/moving along\n\tcoms.pop();\n\t\n\t\/\/Did we use a bracket instead of \"test\"? If so get rid of the last bracket\n\tif(bracketUsed)\n\t{\n\t\tcoms.pop();\n\t}\n\t\n\t\/\/valuse for using the stat thingy\n\tint current_stat;\n\t\n\t\/\/get the status of the command\n\tcurrent_stat = stat(command_v.front(), &s_thing);\n\t\n\t\/\/Did it fail?\n\tif(current_stat < 0)\n\t{\t\n\t\t\/\/Yup it did\n\t\tperror(\"ERROR: Coudn't get the stat\");\n\t\treturn true;\n\t}\n\t\/\/No it didn't so lets try out with \"-e\"\n\tif (flag == \"-e\")\n\t{\n\t\treturn false;\n\t}\n\t\n\t\/\/Try it out with \"-f\"\n\tif(flag == \"-f\")\n\t{\n\t\tif(S_ISREG(s_thing.st_mode))\n\t\t{\n\t\t\treturn false\n\t\t} else\n\t\t{\n\t\t\treturn true\n\t\t}\n\t}\n\n\t\/\/Try it out with \"-d\"\n\tif (flag == \"-d\")\n\t{\n\t\tif (S_ISDIR(s_thing.st_mode))\n\t\t{\n\t\t\treturn false;\n\t\t} else\n\t\t{\n\t\t\treturn true\n\t\t}\n\t}\n\t\/\/Obviously something went wrong if you got here\n\treturn true\n}*\/\n\nvector<Command> create_commands(const vector<string> &v)\n{\n vector<Command> commandVector;\n Command temp; \n \n \n\n return commandVector;\n}\n\n<commit_msg>fixed part of the test function<commit_after>#include <iostream>\n#include <cstdlib>\n#include <vector>\n#include <string>\n#include <queue>\n#include <sys\/stat.h>\n\n\/\/getlogin() and gethostname().\n#include <unistd.h>\n\n\/\/perror.\n#include <stdio.h>\n\n\/\/fork,wait and execvp.\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n\/\/boost!\n#include \"boost\/algorithm\/string.hpp\"\n#include \"boost\/tokenizer.hpp\"\n#include \"boost\/foreach.hpp\"\n\n\/\/that one class.\n#include \"Command.h\"\n\nusing namespace std;\nusing namespace boost;\n\n\/\/execute command.\nvoid execute(const vector<string> & s);\n\n\/\/replaces char in string.\nvoid replace_char(string &s, char o, char r);\n\n\/\/takes a string and returns vector of parsed string.\nvector<string> parseInput(string s);\n\n\/\/display vector.\ntemplate<typename unit>\nvoid display_vector(vector<unit> v);\n\n\/\/helper function that finds amount of character.\nint find_char_amount(const string s,char c);\n\n\/\/removes comment from input.\nvoid remove_comment(string &s);\n\n\/\/removes char in string.\nvoid remove_char(string &s, char c);\n\n\/\/checks if string passed in contains a flag\nbool isFlag(string f);\n\n\/\/creates command types from vector of strings.\nvector<Command> create_commands(const vector<string> &v);\n\nint main()\n{\n \/\/grab the login.\n char* login = getlogin();\n\n \/\/start a flag.\n bool login_check = true;\n\n if((!login) != 0)\n {\n \/\/check flag.\n login_check = false;\n \n \/\/output error.\n perror(\"Error: could not retrieve login name\");\n }\n\n \/\/hold c-string for host name.\n char host[150];\n\n \/\/start another flag.\n bool host_check = true;\n\n \/\/gets hostname while checking if it actually grabbed it.\n if(gethostname(host,sizeof(host)) != 0)\n {\n \/\/check flag.\n host_check = false;\n\n \/\/output error.\n perror(\"Error: could not rerieve host name.\");\n }\n\n \/\/warn user of upcoming trouble.\n if(login_check == false || host_check == false)\n cout << \"Unable to display login and\/or host information.\" << endl;\n \n \/\/string to hold user input.\n string input;\n\n while(true)\n {\n \/\/output login@hostname.\n if(login_check && host_check)\n cout << login << '@' << host << ' '; \n\n \/\/bash money.\n cout << \"$ \"; \n\n \/\/placeholder to tell its the program.\n cout << \" (program) \";\n\n \/\/geting input as a string.\n getline(cin,input);\n\n \/\/remove extra white space.\n trim(input);\n\n \/\/remove comments.\n remove_comment(input);\n \n \/\/trim again just in case.\n trim(input);\n\n \/\/testing parse.\n cout << \"Testing parse\" << endl;\n display_vector(parseInput(input));\n\n \/\/execute command.\n execute(parseInput(input));\n\n }\n\n cout << \"End of program\" << endl;\n \n return 0;\n}\n\nvoid execute(const vector<string> &s)\n{\n \/\/check to see if user wants to quit and its the only command.\n if(s.size() == 1)\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == \"exit\")\n exit(0);\n \n \/\/c-string to hold command.\n char* args[2048];\n \n \/\/place, remove comments and convert commands.\n for(unsigned int i = 0; i < s.size(); ++i)\n {\n string temp = s.at(i);\n remove_char(temp,'\\\"');\n args[i] = (char*)temp.c_str();\n }\n args[s.size()] = NULL;\n\n \/\/creates fork process.\n pid_t pid = fork();\n\n if(pid == -1)\n {\n \/\/fork didn't work.\n perror(\"fork\");\n }\n if(pid ==0)\n {\n if(execvp(args[0], args) == -1)\n {\n \/\/execute didn't work.\n perror(\"execvp\");\n \n \/\/break out of shadow realm.\n exit(1);\n }\n\n }\n if(pid > 0)\n {\n \/\/wait for child to die.\n if(wait(0) == -1)\n {\n \/\/didnt wait.\n perror(\"wait\");\n }\n }\n \n return;\n}\n\nvector<string> parseInput(string s)\n{\n\n \/\/replace spaces.\n replace_char(s,' ','*');\n\n \/\/make temp vector to hold parsed strings.\n vector<string> temp;\n\n \/\/create boost magic function.\n char_separator<char> sep(\" ;||&&(){}\", \";||&&()[]\",keep_empty_tokens);\n\n \/\/create boost magic holder thingy.\n tokenizer< char_separator<char> > cm(s,sep);\n\n \/\/for each loop to grab each peice and push it into a vector.\n for(tokenizer< char_separator<char> >::iterator it = cm.begin(); it != cm.end(); ++it)\n if(*it != \"\")\n {\n \/\/fix string.\n string temp_string = *it;\n replace_char(temp_string,'*',' ');\n temp.push_back(temp_string);\n }\n\n \/\/return that vector.\n return temp;\n}\n\nvoid replace_char(string &s, char o, char r)\n{\n \/\/different use for the function.\n if(o == '\\\"')\n {\n \/\/nothing to replace.\n if(s.find(o) == string::npos)\n return;\n \n \/\/replace.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == o)\n s.at(i) = r;\n\n return;\n\n }\n\n \/\/no quotes.\n if(s.find(\"\\\"\") == string::npos)\n return;\n else if(s.find(o) == string::npos)\n return;\n\n \/\/vector to hold quote positions.\n vector<int> pos;\n\n \/\/place positions of char into vector.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == '\\\"')\n pos.push_back(i); \n \n \/\/count position.\n unsigned int count = 0;\n \n \/\/replace.\n while(count < pos.size()) \n {\n for(int i = pos.at(count); i < pos.at(count+1); ++i)\n if(s.at(i) == o)\n s.at(i) = r;\n \n count++;\n count++;\n } \n\n return;\n}\n\ntemplate<typename unit>\nvoid display_vector(vector<unit> v)\n{\n for(unsigned int i = 0; i < v.size(); ++i)\n cout << i+1 << \": \" << v.at(i) << endl;\n return;\n}\n\nvoid remove_comment(string &s)\n{\n \/\/just add a \" to the end to avoid errors.\n if(find_char_amount(s,'\\\"') % 2 != 0)\n s += '\\\"';\n\n \/\/delete everything!\n if(s.find(\"#\") == 0)\n {\n s = \"\";\n return;\n }\n\n \/\/return if no comments.\n if(s.find(\"#\") == string::npos)\n {\n return;\n }\n\n \/\/if no comments then deletes everything from hash forward.\n if(s.find(\"\\\"\") == string::npos && s.find(\"#\") != string::npos)\n {\n s = s.substr(0,s.find(\"#\"));\n return;\n }\n\n \/\/if comment before quote then delete.\n if(s.find(\"\\\"\") > s.find(\"#\"))\n {\n s = s.substr(0,s.find(\"#\"));\n return;\n }\n\n \/\/advanced situations.\n \/\/get a vector to hold positions of quotes and hash.\n vector<int> quotePos;\n vector<int> hashPos;\n\n \/\/grab pos.\n for(unsigned int i = 0; i < s.size(); ++i)\n {\n if(s.at(i) == '\\\"')\n quotePos.push_back(i);\n else if(s.at(i) == '#')\n hashPos.push_back(i);\n }\n\n \/\/no comments or hash for some reason.\n if(hashPos.size() == 0 || quotePos.size() == 0)\n return;\n \n \/\/just in case.\n if(quotePos.size() % 2 != 0)\n quotePos.push_back(0);\n\n \/\/overall check;\n vector<bool> check;\n \n \/\/start it up.\n for(unsigned int i = 0; i < hashPos.size(); ++i)\n check.push_back(true);\n \n \/\/check if hash is in quotes.\n for(unsigned int i = 0; i < hashPos.size(); ++i )\n for(unsigned int j = 0; j < quotePos.size(); j+=2 )\n {\n if(hashPos.at(i) > quotePos.at(j) && hashPos.at(i) < quotePos.at(j+1))\n {\n check.at(i) = true;\n break;\n }\n else\n check.at(i) = false;\n }\n\n \/\/check bool vector to delete string.\n for(unsigned int i = 0; i < check.size(); ++i)\n if(!check.at(i))\n {\n s = s.substr(0,hashPos.at(i));\n return;\n }\n\n \/\/if comment at end then kill it.\n if(hashPos.at(hashPos.size()-1) > quotePos.at(quotePos.size()-1))\n s = s.substr(0,hashPos.at(hashPos.size()-1)); \n \n return;\n}\n\nint find_char_amount(const string s, char c)\n{\n if(s.find(c) == string::npos)\n return 0;\n\n int count = 0;\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) == c)\n count++;\n return count;\n\n}\n\nvoid remove_char(string &s, char c)\n{\n \/\/if not there then just return.\n if(s.find(c) == string::npos)\n return;\n \n \/\/start empty.\n string temp = \"\";\n\n \/\/add everything thats not what we dont want.\n for(unsigned int i = 0; i < s.size(); ++i)\n if(s.at(i) != c)\n temp += s.at(i);\n\n \/\/transfer to s.\n s = temp;\n\n return;\n}\n\nint is_connector(string s)\n{\n if(s == \";\")\n\t\treturn 1;\n\tif(s == \"&&\")\n\t\treturn 2;\n\tif(s == \"||\")\n\t\treturn 3;\n\t\t\t\t\t\t\t\t\t \n\treturn -1;\n}\n\nbool isFlag(string f)\n{\t\/\/default list of possible flags\n\tstring flags = \"-e -d -f\";\n\t\/\/see if string is one of the flags\n\tif (flags.find(f) != string::npos)\n\t\treturn true;\n\treturn false;\n}\n\n\/*\nbool test(vector<string> &commands, vector<strings> &command_list)\n{\t\n\t\/\/defaults to \"-e\"\n\tstring flag = \"-e\";\n\n\tstruct stat s_thing;\n\n\t\/\/put everything into a queue for ease of use\n\tqueue<string> coms;\n\tfor (unsigned int i = 0; i < commands.size(); i++)\n\t{\n\t\tcoms.push_back(commands.at(i));\n\t}\n\n\t\/\/was a bracket used for the test command?\n\tbool bracketUsed = false;\n\n\t\/\/set if a bracket was used\n\tif(coms.front() == \"[\";\n\t\tbracketUsed = true;\n\t\n\t\/\/remove the first part of the command regardless of whether it's \"test\" or \"[\"\n\tcoms.pop();\n\t\n\tif (isTestFlag(coms.front()))\n\t{\n\t\tflag = coms.front();\n\t\t\/\/now we have the flag for the test\n\t\tcoms.pop()\n\t}\n\t\n\t\/\/if there's another flag attempt then it's broken\n\tif (coms.front().at(0) == \"-\")\n\t{\n\t\tcout << \"ERROR: incorrect flags\" << endl;\n\t\t\n\t\t\/\/keep deleting from queue till the next command\n\t\twhile (!is_connector(coms.front()))\n\t\t{\n\t\t\tcoms.pop();\n\t\t}\n\t\treturn true;\n\t}\n\n\t\/\/ if the first part of the path is a \"\/\" remove it (that way it can't mess up)\n\tif(coms.front().at(0) == \"\/\")\n\t\tcoms.front().substr(1, coms.front().size() - 1);\n\t\n\t\/\/make a new c_string to hold the file path\n\tchar *filePath = new char[coms.front.size()];\n\t\n\t\/\/copy it on over from the command vector\n\tstrcpy(filePath, coms.front().c_str());\n\tcommand_list.push_back(filePath);\n\n\t\/\/moving along\n\tcoms.pop();\n\t\n\t\/\/Did we use a bracket instead of \"test\"? If so get rid of the last bracket\n\tif(bracketUsed)\n\t{\n\t\tcoms.pop();\n\t}\n\t\n\t\/\/valuse for using the stat thingy\n\tint current_stat;\n\t\n\t\/\/get the status of the command\n\tcurrent_stat = stat(command_list.front(), &s_thing);\n\t\n\t\/\/Did it fail?\n\tif(current_stat < 0)\n\t{\t\n\t\t\/\/Yup it did\n\t\tperror(\"ERROR: Coudn't get the stat\");\n\t\treturn true;\n\t}\n\t\/\/No it didn't so lets try out with \"-e\"\n\tif (flag == \"-e\")\n\t{\n\t\treturn false;\n\t}\n\t\n\t\/\/Try it out with \"-f\"\n\tif(flag == \"-f\")\n\t{\n\t\tif(S_ISREG(s_thing.st_mode))\n\t\t{\n\t\t\treturn false\n\t\t} else\n\t\t{\n\t\t\treturn true\n\t\t}\n\t}\n\n\t\/\/Try it out with \"-d\"\n\tif (flag == \"-d\")\n\t{\n\t\tif (S_ISDIR(s_thing.st_mode))\n\t\t{\n\t\t\treturn false;\n\t\t} else\n\t\t{\n\t\t\treturn true\n\t\t}\n\t}\n\t\/\/Obviously something went wrong if you got here\n\treturn true\n}*\/\n\nvector<Command> create_commands(const vector<string> &v)\n{\n vector<Command> commandVector;\n Command temp; \n \n \n\n return commandVector;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ Spin Wave Fit\n\/\/\n\/\/ Created by Hahn, Steven E. on 1\/7\/13.\n\/\/ Copyright (c) 2013 Oak Ridge National Laboratory. All rights reserved.\n\/\/\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <fstream>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <vector>\n#include \"SpinWave.h\"\n#include \"Initializer.h\"\n#include \"Cell\/Neighbors.h\"\n#include \"PointsAlongLine.h\"\n#include \"Positions.h\"\n\nusing namespace boost;\nusing namespace std;\n\nint main(int argc, char * argv[])\n{\n \n \/\/Init four_sl;\n Init four_sl(\"\/Users\/svh\/Documents\/spin_wave_genie\/examples\/MnV2O4_cubic.xml\");\n SW_Builder builder = four_sl.get_builder();\n \n \/\/cout << check << endl;\n \n \/*Cell cell = four_sl.get_cell();\n \n string sl_r = \"Mn0\";\n string sl_s = \"Mn1\";\n double min = 0.0;\n double max = 7.0;\n \n Neighbors neighborList;\n neighborList.findNeighbors(cell,sl_r,sl_s,min,max);\n size_t z_rs = neighborList.getNumberNeighbors();\n \n cout << \"z_rs= \" << z_rs << endl;\n for(Neighbors::Iterator nbr=neighborList.begin();nbr!=neighborList.end();++nbr)\n {\n cout << (*nbr)[0] << \" \" << (*nbr)[1] << \" \" << (*nbr)[2] << endl;\n }*\/\n \n SpinWave test = builder.Create_Element();\n \n double SA = 2.3;\n double SB = 0.9;\n double theta = M_PI - 35.0*M_PI\/180.0;\n double DB = -6.62711;\n double JBB = -9.80542;\n double DBz = 0.073016;\n \n for(int dbi = 0; dbi != 1; dbi++)\n {\n double JBBP = 6.56457*(1.0+(double)dbi\/50.0);\n double JAB = SB*((6.0*JBB+6.0*JBBP+DB-3.0*DBz)*cos(theta)*sin(theta) -sqrt(2.0)*DB*(2.0*pow(cos(theta),2)-1.0))\/(-9.0*SA*sin(theta));\n cout << \"JBBP= \" << JBBP << \" \" << \" JAB= \" << JAB << endl;\n test.updateValue(\"Jbbp\",JBBP);\n test.updateValue(\"Jab\",JAB);\n\n std::cout << \"hello world\" << std::endl;\n \n\n PointsAlongLine Line;\n Line.setFirstPoint(1.0,1.0,0.0);\n Line.setFinalPoint(3.0,3.0,0.0);\n Line.setNumberPoints(11);\n Positions KPoints = Line.getPoints();\n \n for(Positions::Iterator it = KPoints.begin(); it != KPoints.end(); it++)\n {\n double x = it->get<0>();\n double y = it->get<1>();\n double z = it->get<2>();\n\n \/\/cout << \"Pos.\" << endl;\n cout << x << \" \" << y << \" \" << z << \" \";\/\/ << endl;\n test.createMatrix(x,y,z);\n test.Calc();\n vector<point> pts = test.getPoints();\n \/\/cout << \"Freq. Int.\" << endl;\n for(vector<point>::iterator it2 = pts.begin();it2!=pts.end();it2++)\n {\n cout << (*it2).frequency << \" \" << (*it2).intensity*10.0 << \" \" ;\/\/<< endl;\n }\n cout << endl;\n }\n }\n return 0;\n}\n<commit_msg>cleaned up dispersion code<commit_after>\/\/\n\/\/ main.cpp\n\/\/ Spin Wave Fit\n\/\/\n\/\/ Created by Hahn, Steven E. on 1\/7\/13.\n\/\/ Copyright (c) 2013 Oak Ridge National Laboratory. All rights reserved.\n\/\/\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <fstream>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <vector>\n#include \"SpinWave.h\"\n#include \"Initializer.h\"\n#include \"Cell\/Neighbors.h\"\n#include \"PointsAlongLine.h\"\n#include \"Positions.h\"\n\nusing namespace boost;\nusing namespace std;\n\nint main(int argc, char * argv[])\n{\n \n \/\/Init four_sl;\n Init four_sl(\"\/Users\/svh\/Documents\/spin_wave_genie\/examples\/MnV2O4_cubic.xml\");\n \n \/\/cout << check << endl;\n \n Cell cell = four_sl.get_cell();\n \n string sl_r = \"Mn0\";\n string sl_s = \"Mn1\";\n double min = 0.0;\n double max = 7.0;\n \n Neighbors neighborList;\n neighborList.findNeighbors(cell,sl_r,sl_s,min,max);\n size_t z_rs = neighborList.getNumberNeighbors();\n \n cout << \"z_rs= \" << z_rs << endl;\n for(Neighbors::Iterator nbr=neighborList.begin();nbr!=neighborList.end();++nbr)\n {\n cout << (*nbr)[0] << \" \" << (*nbr)[1] << \" \" << (*nbr)[2] << endl;\n }\n \n SW_Builder builder = four_sl.get_builder();\n SpinWave test = builder.Create_Element();\n \n PointsAlongLine Line;\n Line.setFirstPoint(1.0,1.0,0.0);\n Line.setFinalPoint(3.0,3.0,0.0);\n Line.setNumberPoints(11);\n Positions KPoints = Line.getPoints();\n \n for(Positions::Iterator it = KPoints.begin(); it != KPoints.end(); it++)\n {\n double x = it->get<0>();\n double y = it->get<1>();\n double z = it->get<2>();\n\n \/\/cout << \"Pos.\" << endl;\n cout << x << \" \" << y << \" \" << z << \" \";\/\/ << endl;\n test.createMatrix(x,y,z);\n test.Calc();\n vector<point> pts = test.getPoints();\n \/\/cout << \"Freq. Int.\" << endl;\n for(vector<point>::iterator it2 = pts.begin();it2!=pts.end();it2++)\n {\n cout << (*it2).frequency << \" \" << (*it2).intensity*10.0 << \" \" ;\/\/<< endl;\n }\n cout << endl;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2019-present ScyllaDB\n *\/\n\n\/*\n * SPDX-License-Identifier: AGPL-3.0-or-later\n *\/\n\n#include \"leveled_compaction_strategy.hh\"\n#include \"leveled_manifest.hh\"\n#include <algorithm>\n\n#include <boost\/range\/algorithm\/remove_if.hpp>\n\nnamespace sstables {\n\ncompaction_descriptor leveled_compaction_strategy::get_sstables_for_compaction(table_state& table_s, strategy_control& control, std::vector<sstables::shared_sstable> candidates) {\n \/\/ NOTE: leveled_manifest creation may be slightly expensive, so later on,\n \/\/ we may want to store it in the strategy itself. However, the sstable\n \/\/ lists managed by the manifest may become outdated. For example, one\n \/\/ sstable in it may be marked for deletion after compacted.\n \/\/ Currently, we create a new manifest whenever it's time for compaction.\n leveled_manifest manifest = leveled_manifest::create(table_s, candidates, _max_sstable_size_in_mb, _stcs_options);\n if (!_last_compacted_keys) {\n generate_last_compacted_keys(manifest);\n }\n auto candidate = manifest.get_compaction_candidates(*_last_compacted_keys, _compaction_counter);\n\n if (!candidate.sstables.empty()) {\n leveled_manifest::logger.debug(\"leveled: Compacting {} out of {} sstables\", candidate.sstables.size(), table_s.get_sstable_set().all()->size());\n return candidate;\n }\n\n \/\/ if there is no sstable to compact in standard way, try compacting based on droppable tombstone ratio\n \/\/ unlike stcs, lcs can look for sstable with highest droppable tombstone ratio, so as not to choose\n \/\/ a sstable which droppable data shadow data in older sstable, by starting from highest levels which\n \/\/ theoretically contain oldest non-overlapping data.\n auto compaction_time = gc_clock::now();\n for (auto level = int(manifest.get_level_count()); level >= 0; level--) {\n auto& sstables = manifest.get_level(level);\n \/\/ filter out sstables which droppable tombstone ratio isn't greater than the defined threshold.\n auto e = boost::range::remove_if(sstables, [this, compaction_time] (const sstables::shared_sstable& sst) -> bool {\n return !worth_dropping_tombstones(sst, compaction_time);\n });\n sstables.erase(e, sstables.end());\n if (sstables.empty()) {\n continue;\n }\n auto& sst = *std::max_element(sstables.begin(), sstables.end(), [&] (auto& i, auto& j) {\n auto gc_before1 = i->get_gc_before_for_drop_estimation(compaction_time);\n auto gc_before2 = j->get_gc_before_for_drop_estimation(compaction_time);\n return i->estimate_droppable_tombstone_ratio(gc_before1) < j->estimate_droppable_tombstone_ratio(gc_before2);\n });\n return sstables::compaction_descriptor({ sst }, service::get_local_compaction_priority(), sst->get_sstable_level());\n }\n return {};\n}\n\ncompaction_descriptor leveled_compaction_strategy::get_major_compaction_job(table_state& table_s, std::vector<sstables::shared_sstable> candidates) {\n if (candidates.empty()) {\n return compaction_descriptor();\n }\n\n auto& sst = *std::max_element(candidates.begin(), candidates.end(), [&] (sstables::shared_sstable& sst1, sstables::shared_sstable& sst2) {\n return sst1->get_sstable_level() < sst2->get_sstable_level();\n });\n return compaction_descriptor(std::move(candidates), service::get_local_compaction_priority(),\n sst->get_sstable_level(), _max_sstable_size_in_mb*1024*1024);\n}\n\nvoid leveled_compaction_strategy::notify_completion(const std::vector<shared_sstable>& removed, const std::vector<shared_sstable>& added) {\n if (removed.empty() || added.empty()) {\n return;\n }\n auto min_level = std::numeric_limits<uint32_t>::max();\n for (auto& sstable : removed) {\n min_level = std::min(min_level, sstable->get_sstable_level());\n }\n\n const sstables::sstable *last = nullptr;\n int target_level = 0;\n for (auto& candidate : added) {\n if (!last || last->compare_by_first_key(*candidate) < 0) {\n last = &*candidate;\n }\n target_level = std::max(target_level, int(candidate->get_sstable_level()));\n }\n _last_compacted_keys.value().at(min_level) = last->get_last_decorated_key();\n\n for (int i = leveled_manifest::MAX_LEVELS - 1; i > 0; i--) {\n _compaction_counter[i]++;\n }\n _compaction_counter[target_level] = 0;\n\n if (leveled_manifest::logger.level() == logging::log_level::debug) {\n for (auto j = 0U; j < _compaction_counter.size(); j++) {\n leveled_manifest::logger.debug(\"CompactionCounter: {}: {}\", j, _compaction_counter[j]);\n }\n }\n}\n\nvoid leveled_compaction_strategy::generate_last_compacted_keys(leveled_manifest& manifest) {\n std::vector<std::optional<dht::decorated_key>> last_compacted_keys(leveled_manifest::MAX_LEVELS);\n for (auto i = 0; i < leveled_manifest::MAX_LEVELS - 1; i++) {\n if (manifest.get_level(i + 1).empty()) {\n continue;\n }\n\n const sstables::sstable* sstable_with_last_compacted_key = nullptr;\n std::optional<db_clock::time_point> max_creation_time;\n for (auto& sst : manifest.get_level(i + 1)) {\n auto wtime = sst->data_file_write_time();\n if (!max_creation_time || wtime >= *max_creation_time) {\n sstable_with_last_compacted_key = &*sst;\n max_creation_time = wtime;\n }\n }\n last_compacted_keys[i] = sstable_with_last_compacted_key->get_last_decorated_key();\n }\n _last_compacted_keys = std::move(last_compacted_keys);\n}\n\nint64_t leveled_compaction_strategy::estimated_pending_compactions(table_state& table_s) const {\n std::vector<sstables::shared_sstable> sstables;\n auto all_sstables = table_s.get_sstable_set().all();\n sstables.reserve(all_sstables->size());\n for (auto& entry : *all_sstables) {\n sstables.push_back(entry);\n }\n return leveled_manifest::get_estimated_tasks(leveled_manifest::get_levels(sstables), _max_sstable_size_in_mb * 1024 * 1024);\n}\n\ncompaction_descriptor\nleveled_compaction_strategy::get_reshaping_job(std::vector<shared_sstable> input, schema_ptr schema, const ::io_priority_class& iop, reshape_mode mode) {\n std::array<std::vector<shared_sstable>, leveled_manifest::MAX_LEVELS> level_info;\n\n auto is_disjoint = [this, schema] (const std::vector<shared_sstable>& sstables, unsigned tolerance) -> std::tuple<bool, unsigned> {\n auto overlapping_sstables = sstable_set_overlapping_count(schema, sstables);\n return { overlapping_sstables <= tolerance, overlapping_sstables };\n };\n\n auto max_sstable_size_in_bytes = _max_sstable_size_in_mb * 1024 * 1024;\n\n for (auto& sst : input) {\n auto sst_level = sst->get_sstable_level();\n if (sst_level > leveled_manifest::MAX_LEVELS - 1) {\n leveled_manifest::logger.warn(\"Found SSTable with level {}, higher than the maximum {}. This is unexpected, but will fix\", sst_level, leveled_manifest::MAX_LEVELS - 1);\n\n \/\/ This is really unexpected, so we'll just compact it all to fix it\n compaction_descriptor desc(std::move(input), iop, leveled_manifest::MAX_LEVELS - 1, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n level_info[sst_level].push_back(sst);\n }\n\n \/\/ Can't use std::ranges::views::drop due to https:\/\/bugs.llvm.org\/show_bug.cgi?id=47509\n for (auto i = level_info.begin(); i != level_info.end(); ++i) {\n auto& level = *i;\n std::sort(level.begin(), level.end(), [&schema] (const shared_sstable& a, const shared_sstable& b) {\n return dht::ring_position(a->get_first_decorated_key()).less_compare(*schema, dht::ring_position(b->get_first_decorated_key()));\n });\n }\n\n unsigned max_filled_level = 0;\n\n size_t offstrategy_threshold = (mode == reshape_mode::strict) ? std::max(schema->min_compaction_threshold(), 4) : std::max(schema->max_compaction_threshold(), 32);\n size_t max_sstables = std::max(schema->max_compaction_threshold(), int(offstrategy_threshold));\n auto tolerance = [mode] (unsigned level) -> unsigned {\n if (mode == reshape_mode::strict) {\n return 0;\n }\n constexpr unsigned fan_out = leveled_manifest::leveled_fan_out;\n return std::max(double(fan_out), std::ceil(std::pow(fan_out, level) * 0.1));\n };\n\n \/\/ If there's only disjoint L0 sstables like on bootstrap, let's compact them all into a level L which has capacity to store the output.\n \/\/ The best possible level can be calculated with the formula: log (base fan_out) of (L0_total_bytes \/ max_sstable_size)\n auto [l0_disjoint, _] = is_disjoint(level_info[0], 0);\n if (mode == reshape_mode::strict && level_info[0].size() >= offstrategy_threshold && level_info[0].size() == input.size() && l0_disjoint) {\n auto log_fanout = [fanout = leveled_manifest::leveled_fan_out] (double x) {\n double inv_log_fanout = 1.0f \/ std::log(fanout);\n return log(x) * inv_log_fanout;\n };\n\n auto total_bytes = std::max(leveled_manifest::get_total_bytes(level_info[0]), uint64_t(max_sstable_size_in_bytes));\n unsigned ideal_level = std::ceil(log_fanout(total_bytes \/ max_sstable_size_in_bytes));\n\n leveled_manifest::logger.info(\"Reshaping {} disjoint sstables in level 0 into level {}\", level_info[0].size(), ideal_level);\n compaction_descriptor desc(std::move(input), iop, ideal_level, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n\n if (level_info[0].size() > offstrategy_threshold) {\n size_tiered_compaction_strategy stcs(_stcs_options);\n return stcs.get_reshaping_job(std::move(level_info[0]), schema, iop, mode);\n }\n\n for (unsigned level = leveled_manifest::MAX_LEVELS - 1; level > 0; --level) {\n if (level_info[level].empty()) {\n continue;\n }\n max_filled_level = std::max(max_filled_level, level);\n\n auto [disjoint, overlapping_sstables] = is_disjoint(level_info[level], tolerance(level));\n if (!disjoint) {\n leveled_manifest::logger.warn(\"Turns out that level {} is not disjoint, found {} overlapping SSTables, so compacting everything on behalf of {}.{}\", level, overlapping_sstables, schema->ks_name(), schema->cf_name());\n \/\/ Unfortunately no good limit to limit input size to max_sstables for LCS major\n compaction_descriptor desc(std::move(input), iop, max_filled_level, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n }\n\n return compaction_descriptor();\n}\n\nstd::vector<compaction_descriptor>\nleveled_compaction_strategy::get_cleanup_compaction_jobs(table_state& table_s, std::vector<shared_sstable> candidates) const {\n std::vector<compaction_descriptor> ret;\n\n auto levels = leveled_manifest::get_levels(candidates);\n\n ret = size_tiered_compaction_strategy(_stcs_options).get_cleanup_compaction_jobs(table_s, std::move(levels[0]));\n for (size_t level = 1; level < levels.size(); level++) {\n if (levels[level].empty()) {\n continue;\n }\n ret.push_back(compaction_descriptor(std::move(levels[level]), service::get_local_compaction_priority(), level, _max_sstable_size_in_mb * 1024 * 1024));\n }\n return ret;\n}\n\n}\n<commit_msg>compaction: LCS: Fix off-by-one in formula used to calculate ideal level<commit_after>\/*\n * Copyright (C) 2019-present ScyllaDB\n *\/\n\n\/*\n * SPDX-License-Identifier: AGPL-3.0-or-later\n *\/\n\n#include \"leveled_compaction_strategy.hh\"\n#include \"leveled_manifest.hh\"\n#include <algorithm>\n\n#include <boost\/range\/algorithm\/remove_if.hpp>\n\nnamespace sstables {\n\ncompaction_descriptor leveled_compaction_strategy::get_sstables_for_compaction(table_state& table_s, strategy_control& control, std::vector<sstables::shared_sstable> candidates) {\n \/\/ NOTE: leveled_manifest creation may be slightly expensive, so later on,\n \/\/ we may want to store it in the strategy itself. However, the sstable\n \/\/ lists managed by the manifest may become outdated. For example, one\n \/\/ sstable in it may be marked for deletion after compacted.\n \/\/ Currently, we create a new manifest whenever it's time for compaction.\n leveled_manifest manifest = leveled_manifest::create(table_s, candidates, _max_sstable_size_in_mb, _stcs_options);\n if (!_last_compacted_keys) {\n generate_last_compacted_keys(manifest);\n }\n auto candidate = manifest.get_compaction_candidates(*_last_compacted_keys, _compaction_counter);\n\n if (!candidate.sstables.empty()) {\n leveled_manifest::logger.debug(\"leveled: Compacting {} out of {} sstables\", candidate.sstables.size(), table_s.get_sstable_set().all()->size());\n return candidate;\n }\n\n \/\/ if there is no sstable to compact in standard way, try compacting based on droppable tombstone ratio\n \/\/ unlike stcs, lcs can look for sstable with highest droppable tombstone ratio, so as not to choose\n \/\/ a sstable which droppable data shadow data in older sstable, by starting from highest levels which\n \/\/ theoretically contain oldest non-overlapping data.\n auto compaction_time = gc_clock::now();\n for (auto level = int(manifest.get_level_count()); level >= 0; level--) {\n auto& sstables = manifest.get_level(level);\n \/\/ filter out sstables which droppable tombstone ratio isn't greater than the defined threshold.\n auto e = boost::range::remove_if(sstables, [this, compaction_time] (const sstables::shared_sstable& sst) -> bool {\n return !worth_dropping_tombstones(sst, compaction_time);\n });\n sstables.erase(e, sstables.end());\n if (sstables.empty()) {\n continue;\n }\n auto& sst = *std::max_element(sstables.begin(), sstables.end(), [&] (auto& i, auto& j) {\n auto gc_before1 = i->get_gc_before_for_drop_estimation(compaction_time);\n auto gc_before2 = j->get_gc_before_for_drop_estimation(compaction_time);\n return i->estimate_droppable_tombstone_ratio(gc_before1) < j->estimate_droppable_tombstone_ratio(gc_before2);\n });\n return sstables::compaction_descriptor({ sst }, service::get_local_compaction_priority(), sst->get_sstable_level());\n }\n return {};\n}\n\ncompaction_descriptor leveled_compaction_strategy::get_major_compaction_job(table_state& table_s, std::vector<sstables::shared_sstable> candidates) {\n if (candidates.empty()) {\n return compaction_descriptor();\n }\n\n auto& sst = *std::max_element(candidates.begin(), candidates.end(), [&] (sstables::shared_sstable& sst1, sstables::shared_sstable& sst2) {\n return sst1->get_sstable_level() < sst2->get_sstable_level();\n });\n return compaction_descriptor(std::move(candidates), service::get_local_compaction_priority(),\n sst->get_sstable_level(), _max_sstable_size_in_mb*1024*1024);\n}\n\nvoid leveled_compaction_strategy::notify_completion(const std::vector<shared_sstable>& removed, const std::vector<shared_sstable>& added) {\n if (removed.empty() || added.empty()) {\n return;\n }\n auto min_level = std::numeric_limits<uint32_t>::max();\n for (auto& sstable : removed) {\n min_level = std::min(min_level, sstable->get_sstable_level());\n }\n\n const sstables::sstable *last = nullptr;\n int target_level = 0;\n for (auto& candidate : added) {\n if (!last || last->compare_by_first_key(*candidate) < 0) {\n last = &*candidate;\n }\n target_level = std::max(target_level, int(candidate->get_sstable_level()));\n }\n _last_compacted_keys.value().at(min_level) = last->get_last_decorated_key();\n\n for (int i = leveled_manifest::MAX_LEVELS - 1; i > 0; i--) {\n _compaction_counter[i]++;\n }\n _compaction_counter[target_level] = 0;\n\n if (leveled_manifest::logger.level() == logging::log_level::debug) {\n for (auto j = 0U; j < _compaction_counter.size(); j++) {\n leveled_manifest::logger.debug(\"CompactionCounter: {}: {}\", j, _compaction_counter[j]);\n }\n }\n}\n\nvoid leveled_compaction_strategy::generate_last_compacted_keys(leveled_manifest& manifest) {\n std::vector<std::optional<dht::decorated_key>> last_compacted_keys(leveled_manifest::MAX_LEVELS);\n for (auto i = 0; i < leveled_manifest::MAX_LEVELS - 1; i++) {\n if (manifest.get_level(i + 1).empty()) {\n continue;\n }\n\n const sstables::sstable* sstable_with_last_compacted_key = nullptr;\n std::optional<db_clock::time_point> max_creation_time;\n for (auto& sst : manifest.get_level(i + 1)) {\n auto wtime = sst->data_file_write_time();\n if (!max_creation_time || wtime >= *max_creation_time) {\n sstable_with_last_compacted_key = &*sst;\n max_creation_time = wtime;\n }\n }\n last_compacted_keys[i] = sstable_with_last_compacted_key->get_last_decorated_key();\n }\n _last_compacted_keys = std::move(last_compacted_keys);\n}\n\nint64_t leveled_compaction_strategy::estimated_pending_compactions(table_state& table_s) const {\n std::vector<sstables::shared_sstable> sstables;\n auto all_sstables = table_s.get_sstable_set().all();\n sstables.reserve(all_sstables->size());\n for (auto& entry : *all_sstables) {\n sstables.push_back(entry);\n }\n return leveled_manifest::get_estimated_tasks(leveled_manifest::get_levels(sstables), _max_sstable_size_in_mb * 1024 * 1024);\n}\n\ncompaction_descriptor\nleveled_compaction_strategy::get_reshaping_job(std::vector<shared_sstable> input, schema_ptr schema, const ::io_priority_class& iop, reshape_mode mode) {\n std::array<std::vector<shared_sstable>, leveled_manifest::MAX_LEVELS> level_info;\n\n auto is_disjoint = [this, schema] (const std::vector<shared_sstable>& sstables, unsigned tolerance) -> std::tuple<bool, unsigned> {\n auto overlapping_sstables = sstable_set_overlapping_count(schema, sstables);\n return { overlapping_sstables <= tolerance, overlapping_sstables };\n };\n\n auto max_sstable_size_in_bytes = _max_sstable_size_in_mb * 1024 * 1024;\n\n for (auto& sst : input) {\n auto sst_level = sst->get_sstable_level();\n if (sst_level > leveled_manifest::MAX_LEVELS - 1) {\n leveled_manifest::logger.warn(\"Found SSTable with level {}, higher than the maximum {}. This is unexpected, but will fix\", sst_level, leveled_manifest::MAX_LEVELS - 1);\n\n \/\/ This is really unexpected, so we'll just compact it all to fix it\n compaction_descriptor desc(std::move(input), iop, leveled_manifest::MAX_LEVELS - 1, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n level_info[sst_level].push_back(sst);\n }\n\n \/\/ Can't use std::ranges::views::drop due to https:\/\/bugs.llvm.org\/show_bug.cgi?id=47509\n for (auto i = level_info.begin(); i != level_info.end(); ++i) {\n auto& level = *i;\n std::sort(level.begin(), level.end(), [&schema] (const shared_sstable& a, const shared_sstable& b) {\n return dht::ring_position(a->get_first_decorated_key()).less_compare(*schema, dht::ring_position(b->get_first_decorated_key()));\n });\n }\n\n unsigned max_filled_level = 0;\n\n size_t offstrategy_threshold = (mode == reshape_mode::strict) ? std::max(schema->min_compaction_threshold(), 4) : std::max(schema->max_compaction_threshold(), 32);\n size_t max_sstables = std::max(schema->max_compaction_threshold(), int(offstrategy_threshold));\n auto tolerance = [mode] (unsigned level) -> unsigned {\n if (mode == reshape_mode::strict) {\n return 0;\n }\n constexpr unsigned fan_out = leveled_manifest::leveled_fan_out;\n return std::max(double(fan_out), std::ceil(std::pow(fan_out, level) * 0.1));\n };\n\n \/\/ If there's only disjoint L0 sstables like on bootstrap, let's compact them all into a level L which has capacity to store the output.\n \/\/ The best possible level can be calculated with the formula: log (base fan_out) of (L0_total_bytes \/ max_sstable_size)\n auto [l0_disjoint, _] = is_disjoint(level_info[0], 0);\n if (mode == reshape_mode::strict && level_info[0].size() >= offstrategy_threshold && level_info[0].size() == input.size() && l0_disjoint) {\n auto log_fanout = [fanout = leveled_manifest::leveled_fan_out] (double x) {\n double inv_log_fanout = 1.0f \/ std::log(fanout);\n return log(x) * inv_log_fanout;\n };\n\n auto total_bytes = std::max(leveled_manifest::get_total_bytes(level_info[0]), uint64_t(max_sstable_size_in_bytes));\n unsigned ideal_level = std::ceil(log_fanout((total_bytes + max_sstable_size_in_bytes - 1) \/ max_sstable_size_in_bytes));\n\n leveled_manifest::logger.info(\"Reshaping {} disjoint sstables in level 0 into level {}\", level_info[0].size(), ideal_level);\n compaction_descriptor desc(std::move(input), iop, ideal_level, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n\n if (level_info[0].size() > offstrategy_threshold) {\n size_tiered_compaction_strategy stcs(_stcs_options);\n return stcs.get_reshaping_job(std::move(level_info[0]), schema, iop, mode);\n }\n\n for (unsigned level = leveled_manifest::MAX_LEVELS - 1; level > 0; --level) {\n if (level_info[level].empty()) {\n continue;\n }\n max_filled_level = std::max(max_filled_level, level);\n\n auto [disjoint, overlapping_sstables] = is_disjoint(level_info[level], tolerance(level));\n if (!disjoint) {\n leveled_manifest::logger.warn(\"Turns out that level {} is not disjoint, found {} overlapping SSTables, so compacting everything on behalf of {}.{}\", level, overlapping_sstables, schema->ks_name(), schema->cf_name());\n \/\/ Unfortunately no good limit to limit input size to max_sstables for LCS major\n compaction_descriptor desc(std::move(input), iop, max_filled_level, max_sstable_size_in_bytes);\n desc.options = compaction_type_options::make_reshape();\n return desc;\n }\n }\n\n return compaction_descriptor();\n}\n\nstd::vector<compaction_descriptor>\nleveled_compaction_strategy::get_cleanup_compaction_jobs(table_state& table_s, std::vector<shared_sstable> candidates) const {\n std::vector<compaction_descriptor> ret;\n\n auto levels = leveled_manifest::get_levels(candidates);\n\n ret = size_tiered_compaction_strategy(_stcs_options).get_cleanup_compaction_jobs(table_s, std::move(levels[0]));\n for (size_t level = 1; level < levels.size(); level++) {\n if (levels[level].empty()) {\n continue;\n }\n ret.push_back(compaction_descriptor(std::move(levels[level]), service::get_local_compaction_priority(), level, _max_sstable_size_in_mb * 1024 * 1024));\n }\n return ret;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ Copyright **********************************************************\n\/\/ \n\/\/ IBM Confidential \n\/\/ OCO Source Materials \n\/\/ 9400 Licensed Internal Code \n\/\/ (C) COPYRIGHT IBM CORP. 2003\n\/\/ \n\/\/ The source code for this program is not published or otherwise \n\/\/ divested of its trade secrets, irrespective of what has been \n\/\/ deposited with the U.S. Copyright Office. \n\/\/ \n\/\/ End Copyright ******************************************************\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <string.h>\n#include <stdio.h>\n#include <ctype.h>\n\n#include <ecmdClientCapi.H>\n#include <ecmdDataBuffer.H>\n#include <ecmdReturnCodes.H>\n#include <ecmdUtils.H>\n#include <ecmdClientPerlapi.H>\n#include <ecmdSharedUtils.H>\n\n\nstatic int myErrorCode = ECMD_SUCCESS;\n\nint ecmdPerlInterfaceErrorCheck (int errorCode) {\n\n if (errorCode == -1) {\n errorCode = myErrorCode;\n myErrorCode = ECMD_SUCCESS;\n\n if (errorCode != ECMD_SUCCESS) {\n ::ecmdOutputError( (::ecmdGetErrorMsg(errorCode) + \"\\n\").c_str());\n }\n\n return errorCode;\n }\n else if (errorCode != ECMD_SUCCESS) {\n myErrorCode = errorCode;\n }\n\n return ECMD_SUCCESS;\n}\n\necmdClientPerlapi::ecmdClientPerlapi () {\n perlFormat = \"b\";\n\n}\n\necmdClientPerlapi::~ecmdClientPerlapi () {\n\n this->cleanup();\n}\n\nvoid ecmdClientPerlapi::cleanup() {\n ecmdUnloadDll();\n}\n\n\nint ecmdClientPerlapi::initDll (const char * i_dllName, const char * i_options) {\n\n int rc = ECMD_SUCCESS;\n std::string dllName = \"\";\n if (i_dllName != NULL) {\n dllName = i_dllName;\n }\n\n rc = ecmdLoadDll(dllName);\n ecmdPerlInterfaceErrorCheck(rc);\n\n return rc;\n\n\n}\n\n\n\nint ecmdClientPerlapi::getScom (const char* i_target, int i_address, char** o_data) {\n\n ecmdChipTarget myTarget;\n std::string dataStr;\n\n int rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) {\n *o_data = NULL;\n return rc;\n }\n\n ecmdDataBuffer buffer;\n rc = ::getScom(myTarget, i_address, buffer);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) {\n o_data = NULL;\n return rc;\n }\n\n\n dataStr = buffer.genBinStr();\n\n char* tmp;\n tmp = new char[dataStr.length()+1];\n strcpy(tmp,dataStr.c_str());\n *o_data = tmp;\n\n return rc;\n}\n\n\n\nint ecmdClientPerlapi::putScom (const char * i_target, int i_address, const char * i_data) {\n\n ecmdChipTarget myTarget;\n\n int rc = setupTarget(i_target, myTarget);\n if (rc) return rc;\n\n ecmdDataBuffer buffer;\n\n buffer.setBitLength(strlen(i_data));\n rc = buffer.insertFromBin(i_data);\n\n rc = ::putScom(myTarget, i_address, buffer);\n\n ecmdPerlInterfaceErrorCheck(rc);\n return rc;\n}\n\n \n \nint ecmdClientPerlapi::getRing (const char * i_target, const char * i_ringName, char **o_data) {\n\n int rc = 0;\n ecmdDataBuffer buffer;\n ecmdChipTarget myTarget;\n std::string dataStr;\n\n rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n rc = ::getRing(myTarget, i_ringName, buffer);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n\n dataStr = buffer.genBinStr();\n\n char* tmp;\n tmp = new char[dataStr.length()+1];\n strcpy(tmp,dataStr.c_str());\n *o_data = tmp;\n\n return rc;\n}\n\n\nint ecmdClientPerlapi::putRing (const char * i_target, const char * i_ringName, const char * i_data) {\n\n ecmdChipTarget myTarget;\n\n int rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n ecmdDataBuffer buffer;\n\n buffer.setBitLength(strlen(i_data));\n rc = buffer.insertFromBin(i_data);\n\n rc = ::putRing(myTarget, i_ringName, buffer);\n\n ecmdPerlInterfaceErrorCheck(rc);\n return rc;\n}\n\n\n\n\n\/***\nvoid ecmdClientPerlapi::add(char *retval) {\n printf(\"Inside function: %c %c %c\\n\",retval[0],retval[1],retval[2]);\n\n retval[0] = 'L'; retval[1] = 'p';\n\n strcpy(retval,\"Looky here - I made it\");\n}\n\nvoid ecmdClientPerlapi::add2(char **retval) {\n printf(\"Inside function: %s\\n\",*retval);\n\n\n *retval = (char*)malloc(sizeof (char[100]));\n strcpy(*retval,\"Looky here - I made it\");\n}\n***\/\n\n\n\n\nint ecmdClientPerlapi::setupTarget (const char * i_targetStr, ecmdChipTarget & o_target) {\n\n int rc = ECMD_SUCCESS;\n std::string printed;\n if (i_targetStr == NULL) {\n ecmdOutputError(\"ecmdClientPerlapi::setupTarget - It appears the target string is null\\n\");\n return ECMD_INVALID_ARGS;\n }\n std::vector<std::string> tokens;\n\n ecmdParseTokens(i_targetStr, \" ,.\", tokens);\n\n \/* Set our initial states *\/\n o_target.cage = o_target.node = o_target.slot = o_target.pos = o_target.core = o_target.thread = 0;\n o_target.cageState = o_target.nodeState = o_target.slotState = o_target.posState = o_target.coreState = o_target.threadState = ECMD_TARGET_FIELD_VALID;\n o_target.chipTypeState = ECMD_TARGET_FIELD_UNUSED;\n\n for (std::vector<std::string>::iterator tokit = tokens.begin(); tokit != tokens.end(); tokit ++) {\n if ((*tokit)[0] == '-') {\n switch((*tokit)[1]) {\n case 'k': case 'K':\n o_target.cage = atoi(tokit->substr(2,20).c_str());\n break;\n case 'n': case 'N':\n o_target.node = atoi(tokit->substr(2,20).c_str());\n break;\n case 's': case 'S':\n o_target.slot = atoi(tokit->substr(2,20).c_str());\n break;\n case 'p': case 'P':\n o_target.pos = atoi(tokit->substr(2,20).c_str());\n break;\n case 'c': case 'C':\n o_target.core = atoi(tokit->substr(2,20).c_str());\n break;\n case 't': case 'T':\n o_target.thread = atoi(tokit->substr(2,20).c_str());\n break;\n default:\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained an invalid target parm : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n \n }\n } else {\n \/* If the first char is a digit then they must have specified a p1..3 or p1,4 and we tokenized it above, this is not good *\/\n if (isdigit((*tokit)[0])) {\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained a range or multiple positions : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n } else if (o_target.chipTypeState == ECMD_TARGET_FIELD_VALID) {\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained multiple chip names : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n }\n o_target.chipTypeState = ECMD_TARGET_FIELD_VALID;\n o_target.chipType = *tokit;\n }\n }\n\n return rc;\n}\n\n\nint ecmdClientPerlapi::ecmdCommandArgs(char** i_argv[]){\n\n return 0;\n}\n\n\/***\nint ecmdClientPerlapi::ecmdCommandArgs(int* i_argc, char** i_argv[]) {\n\n return 0;\n}\n\n***\/\nint ecmdClientPerlapi::sendCmd(const char* i_target, int i_instruction, int i_modifier, char** o_status) {\n\n return 0;\n}\n\n\nint ecmdClientPerlapi::getCfamRegister (const char* i_target, int i_address, char** o_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::putCfamRegister (const char* i_target, int i_address, const char* i_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getSpy (const char* i_target, const char * i_spyName, char** o_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getSpyEnum (const char* i_target, const char * i_spyName, char** o_enumValue){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getSpyEccGrouping (const char* i_target, const char * i_spyEccGroupName, char** o_groupData, char** o_eccData, char** o_eccErrorMask){\n\n return 0;\n}\n\n\nint ecmdClientPerlapi::putSpy (const char* i_target, const char * i_spyName, const char* i_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::putSpyEnum (const char* i_target, const char * i_spyName, const char* i_enumValue){\n\n return 0;\n}\n\nvoid ecmdClientPerlapi::ecmdEnableRingCache(){\n\n return ;\n}\n\nint ecmdClientPerlapi::ecmdDisableRingCache(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::ecmdFlushRingCache(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getArray (const char* i_target, const char * i_arrayName, const char* i_address, char** o_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::putArray (const char* i_target, const char * i_arrayName, const char* i_address, const char* i_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simaet(const char* i_function){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simcheckpoint(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simclock(int i_cycles){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simecho(const char* i_message){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simexit(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simEXPECTFAC(const char* i_facname, int i_bitlength, const char* i_expect, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simexpecttcfac(const char* i_tcfacname, int i_bitlength, const char* i_expect, int i_row){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simgetcurrentcycle(char** o_cyclecount){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simGETFAC(const char* i_facname, int i_bitlength, char** o_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simGETFACX(const char* i_facname, int i_bitlength, char** o_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simgettcfac(const char* i_tcfacname, char** o_data, int i_row, int i_startbit, int i_bitlength){\n\n return 0;\n}\n\nint ecmdClientPerlapi::siminit(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simPUTFAC(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simPUTFACX(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simputtcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simrestart(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simSTKFAC(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simstktcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simSUBCMD(const char* i_command){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simtckinterval(int i_tckinterval){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simUNSTICK(const char* i_facname, int i_bitlength, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simunsticktcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nchar* ecmdClientPerlapi::ecmdGetErrorMsg(int i_errorCode){\n\n return NULL;\n}\n\nvoid ecmdClientPerlapi::ecmdOutputError(const char* i_message){\n ::ecmdOutputError(i_message);\n return ;\n}\n\nvoid ecmdClientPerlapi::ecmdOutputWarning(const char* i_message){\n ::ecmdOutputWarning(i_message);\n return ;\n}\n\nvoid ecmdClientPerlapi::ecmdOutput(const char* i_message){\n ::ecmdOutput(i_message);\n return ;\n}\n\n\n\n<commit_msg>added getspy putspy.<commit_after>\n\/\/ Copyright **********************************************************\n\/\/ \n\/\/ IBM Confidential \n\/\/ OCO Source Materials \n\/\/ 9400 Licensed Internal Code \n\/\/ (C) COPYRIGHT IBM CORP. 2003\n\/\/ \n\/\/ The source code for this program is not published or otherwise \n\/\/ divested of its trade secrets, irrespective of what has been \n\/\/ deposited with the U.S. Copyright Office. \n\/\/ \n\/\/ End Copyright ******************************************************\n\n\/\/--------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------\n#include <string.h>\n#include <stdio.h>\n#include <ctype.h>\n\n#include <ecmdClientCapi.H>\n#include <ecmdDataBuffer.H>\n#include <ecmdReturnCodes.H>\n#include <ecmdUtils.H>\n#include <ecmdClientPerlapi.H>\n#include <ecmdSharedUtils.H>\n\n\nstatic int myErrorCode = ECMD_SUCCESS;\n\nint ecmdPerlInterfaceErrorCheck (int errorCode) {\n\n if (errorCode == -1) {\n errorCode = myErrorCode;\n myErrorCode = ECMD_SUCCESS;\n\n if (errorCode != ECMD_SUCCESS) {\n ::ecmdOutputError( (::ecmdGetErrorMsg(errorCode) + \"\\n\").c_str());\n }\n\n return errorCode;\n }\n else if (errorCode != ECMD_SUCCESS) {\n myErrorCode = errorCode;\n }\n\n return ECMD_SUCCESS;\n}\n\necmdClientPerlapi::ecmdClientPerlapi () {\n\n}\n\necmdClientPerlapi::~ecmdClientPerlapi () {\n\n this->cleanup();\n}\n\nvoid ecmdClientPerlapi::cleanup() {\n ecmdUnloadDll();\n}\n\n\nint ecmdClientPerlapi::initDll (const char * i_dllName, const char * i_options) {\n\n int rc = ECMD_SUCCESS;\n std::string dllName = \"\";\n if (i_dllName != NULL) {\n dllName = i_dllName;\n }\n\n rc = ecmdLoadDll(dllName);\n ecmdPerlInterfaceErrorCheck(rc);\n\n return rc;\n\n}\n\n\nint ecmdClientPerlapi::setupTarget (const char * i_targetStr, ecmdChipTarget & o_target) {\n\n int rc = ECMD_SUCCESS;\n std::string printed;\n if (i_targetStr == NULL) {\n ecmdOutputError(\"ecmdClientPerlapi::setupTarget - It appears the target string is null\\n\");\n return ECMD_INVALID_ARGS;\n }\n std::vector<std::string> tokens;\n\n ecmdParseTokens(i_targetStr, \" ,.\", tokens);\n\n \/* Set our initial states *\/\n o_target.cage = o_target.node = o_target.slot = o_target.pos = o_target.core = o_target.thread = 0;\n o_target.cageState = o_target.nodeState = o_target.slotState = o_target.posState = o_target.coreState = o_target.threadState = ECMD_TARGET_FIELD_VALID;\n o_target.chipTypeState = ECMD_TARGET_FIELD_UNUSED;\n\n for (std::vector<std::string>::iterator tokit = tokens.begin(); tokit != tokens.end(); tokit ++) {\n if ((*tokit)[0] == '-') {\n switch((*tokit)[1]) {\n case 'k': case 'K':\n o_target.cage = atoi(tokit->substr(2,20).c_str());\n break;\n case 'n': case 'N':\n o_target.node = atoi(tokit->substr(2,20).c_str());\n break;\n case 's': case 'S':\n o_target.slot = atoi(tokit->substr(2,20).c_str());\n break;\n case 'p': case 'P':\n o_target.pos = atoi(tokit->substr(2,20).c_str());\n break;\n case 'c': case 'C':\n o_target.core = atoi(tokit->substr(2,20).c_str());\n break;\n case 't': case 'T':\n o_target.thread = atoi(tokit->substr(2,20).c_str());\n break;\n default:\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained an invalid target parm : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n \n }\n } else {\n \/* If the first char is a digit then they must have specified a p1..3 or p1,4 and we tokenized it above, this is not good *\/\n if (isdigit((*tokit)[0])) {\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained a range or multiple positions : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n } else if (o_target.chipTypeState == ECMD_TARGET_FIELD_VALID) {\n ecmdOutputError((((printed = \"ecmdClientPerlapi::setupTarget - It appears the target string contained multiple chip names : \") + i_targetStr) + \"\\n\").c_str());\n return ECMD_INVALID_ARGS;\n }\n o_target.chipTypeState = ECMD_TARGET_FIELD_VALID;\n o_target.chipType = *tokit;\n }\n }\n\n return rc;\n}\n\n\n\nint ecmdClientPerlapi::getScom (const char* i_target, int i_address, char** o_data) {\n\n ecmdChipTarget myTarget;\n std::string dataStr;\n\n int rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) {\n *o_data = NULL;\n return rc;\n }\n\n ecmdDataBuffer buffer;\n rc = ::getScom(myTarget, i_address, buffer);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) {\n o_data = NULL;\n return rc;\n }\n\n\n dataStr = buffer.genBinStr();\n\n char* tmp;\n tmp = new char[dataStr.length()+1];\n strcpy(tmp,dataStr.c_str());\n *o_data = tmp;\n\n return rc;\n}\n\n\n\nint ecmdClientPerlapi::putScom (const char * i_target, int i_address, const char * i_data) {\n\n ecmdChipTarget myTarget;\n\n int rc = setupTarget(i_target, myTarget);\n if (rc) return rc;\n\n ecmdDataBuffer buffer;\n\n buffer.setBitLength(strlen(i_data));\n rc = buffer.insertFromBin(i_data);\n\n rc = ::putScom(myTarget, i_address, buffer);\n\n ecmdPerlInterfaceErrorCheck(rc);\n return rc;\n}\n\n \n \nint ecmdClientPerlapi::getRing (const char * i_target, const char * i_ringName, char **o_data) {\n\n int rc = 0;\n ecmdDataBuffer buffer;\n ecmdChipTarget myTarget;\n\n rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n rc = ::getRing(myTarget, i_ringName, buffer);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n char* tmp;\n tmp = new char[buffer.getBitLength()+1];\n strcpy(tmp,buffer.genBinStr().c_str());\n *o_data = tmp;\n\n return rc;\n}\n\n\nint ecmdClientPerlapi::putRing (const char * i_target, const char * i_ringName, const char * i_data) {\n\n ecmdChipTarget myTarget;\n\n int rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n ecmdDataBuffer buffer;\n\n buffer.setBitLength(strlen(i_data));\n rc = buffer.insertFromBin(i_data);\n\n rc = ::putRing(myTarget, i_ringName, buffer);\n\n ecmdPerlInterfaceErrorCheck(rc);\n return rc;\n}\n\n\nint ecmdClientPerlapi::getSpy (const char* i_target, const char * i_spyName, char** o_data){\n int rc = 0;\n ecmdDataBuffer buffer;\n ecmdChipTarget myTarget;\n\n rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n rc = ::getSpy(myTarget, i_spyName, buffer);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n char* tmp;\n tmp = new char[buffer.getBitLength()+1];\n strcpy(tmp,buffer.genBinStr().c_str());\n *o_data = tmp;\n\n return rc;\n}\n\nint ecmdClientPerlapi::putSpy (const char* i_target, const char * i_spyName, const char* i_data){\n\n ecmdChipTarget myTarget;\n\n int rc = setupTarget(i_target, myTarget);\n ecmdPerlInterfaceErrorCheck(rc);\n if (rc) return rc;\n\n ecmdDataBuffer buffer;\n\n buffer.setBitLength(strlen(i_data));\n rc = buffer.insertFromBin(i_data);\n\n rc = ::putSpy(myTarget, i_spyName, buffer);\n\n ecmdPerlInterfaceErrorCheck(rc);\n return rc;\n}\n\n\n\/***\nvoid ecmdClientPerlapi::add(char *retval) {\n printf(\"Inside function: %c %c %c\\n\",retval[0],retval[1],retval[2]);\n\n retval[0] = 'L'; retval[1] = 'p';\n\n strcpy(retval,\"Looky here - I made it\");\n}\n\nvoid ecmdClientPerlapi::add2(char **retval) {\n printf(\"Inside function: %s\\n\",*retval);\n\n\n *retval = (char*)malloc(sizeof (char[100]));\n strcpy(*retval,\"Looky here - I made it\");\n}\n***\/\n\n\n\n\nint ecmdClientPerlapi::ecmdCommandArgs(char** i_argv[]){\n\n return 0;\n}\n\n\/***\nint ecmdClientPerlapi::ecmdCommandArgs(int* i_argc, char** i_argv[]) {\n\n return 0;\n}\n\n***\/\nint ecmdClientPerlapi::sendCmd(const char* i_target, int i_instruction, int i_modifier, char** o_status) {\n\n return 0;\n}\n\n\nint ecmdClientPerlapi::getCfamRegister (const char* i_target, int i_address, char** o_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::putCfamRegister (const char* i_target, int i_address, const char* i_data){\n\n return 0;\n}\n\n\nint ecmdClientPerlapi::getSpyEnum (const char* i_target, const char * i_spyName, char** o_enumValue){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getSpyEccGrouping (const char* i_target, const char * i_spyEccGroupName, char** o_groupData, char** o_eccData, char** o_eccErrorMask){\n\n return 0;\n}\n\n\n\nint ecmdClientPerlapi::putSpyEnum (const char* i_target, const char * i_spyName, const char* i_enumValue){\n\n return 0;\n}\n\nvoid ecmdClientPerlapi::ecmdEnableRingCache(){\n\n return ;\n}\n\nint ecmdClientPerlapi::ecmdDisableRingCache(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::ecmdFlushRingCache(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::getArray (const char* i_target, const char * i_arrayName, const char* i_address, char** o_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::putArray (const char* i_target, const char * i_arrayName, const char* i_address, const char* i_data){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simaet(const char* i_function){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simcheckpoint(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simclock(int i_cycles){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simecho(const char* i_message){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simexit(){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simEXPECTFAC(const char* i_facname, int i_bitlength, const char* i_expect, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simexpecttcfac(const char* i_tcfacname, int i_bitlength, const char* i_expect, int i_row){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simgetcurrentcycle(char** o_cyclecount){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simGETFAC(const char* i_facname, int i_bitlength, char** o_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simGETFACX(const char* i_facname, int i_bitlength, char** o_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simgettcfac(const char* i_tcfacname, char** o_data, int i_row, int i_startbit, int i_bitlength){\n\n return 0;\n}\n\nint ecmdClientPerlapi::siminit(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simPUTFAC(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simPUTFACX(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simputtcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simrestart(const char* i_checkpoint){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simSTKFAC(const char* i_facname, int i_bitlength, const char* i_data, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simstktcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simSUBCMD(const char* i_command){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simtckinterval(int i_tckinterval){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simUNSTICK(const char* i_facname, int i_bitlength, int i_row, int i_offset){\n\n return 0;\n}\n\nint ecmdClientPerlapi::simunsticktcfac(const char* i_tcfacname, int i_bitlength, const char* i_data, int i_row, int i_numrows){\n\n return 0;\n}\n\nchar* ecmdClientPerlapi::ecmdGetErrorMsg(int i_errorCode){\n\n return NULL;\n}\n\nvoid ecmdClientPerlapi::ecmdOutputError(const char* i_message){\n ::ecmdOutputError(i_message);\n return ;\n}\n\nvoid ecmdClientPerlapi::ecmdOutputWarning(const char* i_message){\n ::ecmdOutputWarning(i_message);\n return ;\n}\n\nvoid ecmdClientPerlapi::ecmdOutput(const char* i_message){\n ::ecmdOutput(i_message);\n return ;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <string>\n#include <sstream>\n\n#include \"Tokenizer.h\"\n#include \"Parser.h\"\n#include \"IOException.h\"\n\nusing namespace std;\n\n\/**\n * \/main Interpreter\n * \n *\/\n\nvoid usage () {\n cout << \" cat infile.txt | Interpreter > output.txt\" << endl;\n}\n\n\/*\t\n\tpre: msg wijst naar een array can len chars\n\tpost: de tekst in msg wordt naar het bestand en het schem geschreven \n*\/\nvoid out(const char* msg, int len){\n cout.write(msg, len);\n}\n\n\n\nvoid processInput(istream* in){\n Tokenizer* tokenizer = new Tokenizer(in);\n Parser* parser = new Parser(tokenizer);\n \n string str;\n\t\n try{\n bool b = parser->parseStylesheet();\n \n } catch(ParseException* e) {\n ostringstream stream1(ostringstream::out);\n stream1 << \"Line \" << tokenizer->getLineNumber() << \", Collumn \" << \n tokenizer->getPosition() << \" Parse Error: \" << e->what() << endl; \n cout << stream1.str();\n }\n \n delete tokenizer;\n delete parser;\n}\n\nint main(int argc, char * argv[]){\n string helpstr(\"-h\");\n if (argc > 1 && helpstr.compare(argv[1]) == 0) {\n usage();\n return 0;\n }\n\n try {\n if(argc <= 1){\n cout << \"For help run 'Interpreter -h'\" << endl;\n processInput(&cin);\n } else {\n for (int i=1; i < argc; i++){\n ifstream* file = new ifstream(argv[i]);\n \n if (file->fail() || file->bad())\n throw new IOException(\"Error opening file\");\n\n processInput(file);\n file->close();\n delete file;\n }\n }\n } catch (IOException* e) {\n ostringstream stream1(ostringstream::out);\n string str;\n stream1 << \" Error: \" << e->what() << endl; \n str = stream1.str();\n out(str.c_str(), str.size());\n }\n\t\t\n return 0;\n}\n\n<commit_msg>Updated main to receive a stylesheet from the parser instead of a boolean.<commit_after>#include <iostream>\n#include <fstream>\n#include <string>\n#include <sstream>\n\n#include \"Tokenizer.h\"\n#include \"Parser.h\"\n#include \"Stylesheet.h\"\n#include \"IOException.h\"\n\nusing namespace std;\n\n\/**\n * \/main Interpreter\n * \n *\/\n\nvoid usage () {\n cout << \" cat infile.txt | Interpreter > output.txt\" << endl;\n}\n\n\/*\t\n\tpre: msg wijst naar een array can len chars\n\tpost: de tekst in msg wordt naar het bestand en het schem geschreven \n*\/\nvoid out(const char* msg, int len){\n cout.write(msg, len);\n}\n\n\n\nvoid processInput(istream* in){\n Tokenizer* tokenizer = new Tokenizer(in);\n Parser* parser = new Parser(tokenizer);\n \n string str;\n\t\n try{\n Stylesheet* s = parser->parseStylesheet();\n \n } catch(ParseException* e) {\n ostringstream stream1(ostringstream::out);\n stream1 << \"Line \" << tokenizer->getLineNumber() << \", Collumn \" << \n tokenizer->getPosition() << \" Parse Error: \" << e->what() << endl; \n cout << stream1.str();\n }\n \n delete tokenizer;\n delete parser;\n}\n\nint main(int argc, char * argv[]){\n string helpstr(\"-h\");\n if (argc > 1 && helpstr.compare(argv[1]) == 0) {\n usage();\n return 0;\n }\n\n try {\n if(argc <= 1){\n cout << \"For help run 'Interpreter -h'\" << endl;\n processInput(&cin);\n } else {\n for (int i=1; i < argc; i++){\n ifstream* file = new ifstream(argv[i]);\n \n if (file->fail() || file->bad())\n throw new IOException(\"Error opening file\");\n\n processInput(file);\n file->close();\n delete file;\n }\n }\n } catch (IOException* e) {\n ostringstream stream1(ostringstream::out);\n string str;\n stream1 << \" Error: \" << e->what() << endl; \n str = stream1.str();\n out(str.c_str(), str.size());\n }\n\t\t\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2017 Tmplt <tmplt@dragons.rocks>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <cstdint> \/\/ explicitly-sized integral types\n#include <cstdlib> \/\/ EXIT_SUCCESS, EXIT_FAILURE\n#include <exception> \/\/ std::exception\n\n#include <spdlog\/spdlog.h>\n\n#include \"item.hpp\"\n#include \"components\/command_line.hpp\"\n#include \"components\/logger.hpp\"\n#include \"config.hpp\"\n\nint main(int argc, char *argv[])\n{\n using valid_opts = std::initializer_list<string>;\n\n \/* Future work: make main, excl, exact, misc and groups constexpr. *\/\n const auto main = command_line::option_group(\"Main\", \"necessarily inclusive arguments; at least one required\")\n (\"-a\", \"--author\", \"Specify authors\", \"AUTHOR\")\n (\"-t\", \"--title\", \"Specify title\", \"TITLE\")\n (\"-s\", \"--serie\", \"Specify serie\", \"SERIE\")\n (\"-p\", \"--publisher\", \"Specify publisher\", \"PUBLISHER\");\n\n const auto excl = command_line::option_group(\"Exclusive\", \"cannot be combined with any other arguments\")\n (\"-d\", \"--ident\", \"Specify an item identification (such as DOI, URL, etc.)\", \"IDENT\");\n\n const auto exact = command_line::option_group(\"Exact\", \"matched fuzzily; all are optional\")\n (\"-y\", \"--year\", \"Specify year of release\", \"YEAR\")\n (\"-L\", \"--language\", \"Specify text language\", \"LANG\")\n (\"-e\", \"--edition\", \"Specify item edition\", \"EDITION\")\n (\"-E\", \"--extension\", \"Specify item extension\", \"EXT\",\n valid_opts{\"epub\", \"pdf\", \"djvu\"})\n (\"-i\", \"--isbn\", \"Specify item ISBN\", \"ISBN\");\n\n const auto misc = command_line::option_group(\"Misc\", \"miscellaneous arguments\")\n (\"-h\", \"--help\", \"Display this text and exit \")\n (\"-v\", \"--version\", \"Print version information\")\n (\"-l\", \"--log\", \"Set logging level to info\");\n\n const command_line::groups groups = {main, excl, exact, misc};\n uint8_t exit_code = EXIT_SUCCESS;\n\n const auto logger = logger::create(\"main\");\n logger->set_pattern(\"%l: %v\");\n logger->set_level(spdlog::level::err);\n\n try {\n \/* Parse command line arguments. *\/\n std::string progname = argv[0];\n std::vector<std::string> args(argv + 1, argv + argc);\n\n auto cli = cliparser::make(std::move(progname), std::move(groups));\n cli->process_arguments(args);\n\n if (cli->has(\"log\"))\n logger->set_level(spdlog::level::info);\n\n logger->info(\"the mighty eldwyrm has been summoned!\");\n\n if (cli->has(\"help\")) {\n cli->usage();\n return EXIT_SUCCESS;\n } else if (cli->has(\"version\")) {\n print_build_info();\n return EXIT_SUCCESS;\n } else if (args.empty()) {\n cli->usage();\n return EXIT_FAILURE;\n }\n\n cli->validate_arguments();\n\n } catch (const command_line::argument_error &err) {\n logger->error(err.what() + std::string(\"; see --help\"));\n exit_code = EXIT_FAILURE;\n } catch (const std::exception &err) {\n logger->error(err.what());\n exit_code = EXIT_FAILURE;\n }\n\n logger->info(\"dropping all loggers and returning exitval = {}\", exit_code);\n spdlog::drop_all();\n return exit_code;\n}\n<commit_msg>remove lie from the exact option_group<commit_after>\/*\n * Copyright (C) 2017 Tmplt <tmplt@dragons.rocks>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <cstdint> \/\/ explicitly-sized integral types\n#include <cstdlib> \/\/ EXIT_SUCCESS, EXIT_FAILURE\n#include <exception> \/\/ std::exception\n\n#include <spdlog\/spdlog.h>\n\n#include \"item.hpp\"\n#include \"components\/command_line.hpp\"\n#include \"components\/logger.hpp\"\n#include \"config.hpp\"\n\nint main(int argc, char *argv[])\n{\n using valid_opts = std::initializer_list<string>;\n\n \/* Future work: make main, excl, exact, misc and groups constexpr. *\/\n const auto main = command_line::option_group(\"Main\", \"necessarily inclusive arguments; at least one required\")\n (\"-a\", \"--author\", \"Specify authors\", \"AUTHOR\")\n (\"-t\", \"--title\", \"Specify title\", \"TITLE\")\n (\"-s\", \"--serie\", \"Specify serie\", \"SERIE\")\n (\"-p\", \"--publisher\", \"Specify publisher\", \"PUBLISHER\");\n\n const auto excl = command_line::option_group(\"Exclusive\", \"cannot be combined with any other arguments\")\n (\"-d\", \"--ident\", \"Specify an item identification (such as DOI, URL, etc.)\", \"IDENT\");\n\n const auto exact = command_line::option_group(\"Exact\", \"all are optional\")\n (\"-y\", \"--year\", \"Specify year of release\", \"YEAR\")\n (\"-L\", \"--language\", \"Specify text language\", \"LANG\")\n (\"-e\", \"--edition\", \"Specify item edition\", \"EDITION\")\n (\"-E\", \"--extension\", \"Specify item extension\", \"EXT\",\n valid_opts{\"epub\", \"pdf\", \"djvu\"})\n (\"-i\", \"--isbn\", \"Specify item ISBN\", \"ISBN\");\n\n const auto misc = command_line::option_group(\"Misc\", \"miscellaneous arguments\")\n (\"-h\", \"--help\", \"Display this text and exit \")\n (\"-v\", \"--version\", \"Print version information\")\n (\"-l\", \"--log\", \"Set logging level to info\");\n\n const command_line::groups groups = {main, excl, exact, misc};\n uint8_t exit_code = EXIT_SUCCESS;\n\n const auto logger = logger::create(\"main\");\n logger->set_pattern(\"%l: %v\");\n logger->set_level(spdlog::level::err);\n\n try {\n \/* Parse command line arguments. *\/\n std::string progname = argv[0];\n std::vector<std::string> args(argv + 1, argv + argc);\n\n auto cli = cliparser::make(std::move(progname), std::move(groups));\n cli->process_arguments(args);\n\n if (cli->has(\"log\"))\n logger->set_level(spdlog::level::info);\n\n logger->info(\"the mighty eldwyrm has been summoned!\");\n\n if (cli->has(\"help\")) {\n cli->usage();\n return EXIT_SUCCESS;\n } else if (cli->has(\"version\")) {\n print_build_info();\n return EXIT_SUCCESS;\n } else if (args.empty()) {\n cli->usage();\n return EXIT_FAILURE;\n }\n\n cli->validate_arguments();\n\n } catch (const command_line::argument_error &err) {\n logger->error(err.what() + std::string(\"; see --help\"));\n exit_code = EXIT_FAILURE;\n } catch (const std::exception &err) {\n logger->error(err.what());\n exit_code = EXIT_FAILURE;\n }\n\n logger->info(\"dropping all loggers and returning exitval = {}\", exit_code);\n spdlog::drop_all();\n return exit_code;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkPNMReader.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\n#include \"vtkPNMReader.h\"\n#include <stdio.h>\n\nchar vtkPNMReaderGetChar(FILE *fp)\n{\n char c;\n int result;\n\n if ((result = getc(fp)) == EOF )\n {\n return '\\0';\n }\n \n c = (char)result;\n if (c == '#')\n {\n do\n {\n if ((result = getc(fp)) == EOF )\n\t{\n\treturn '\\0';\n\t}\n c = (char)result;\n }\n while (c != '\\n');\n }\n \n return c;\n}\n\nint vtkPNMReaderGetInt(FILE *fp)\n{\n char c;\n int result = 0;\n \n do\n {\n c = vtkPNMReaderGetChar(fp);\n }\n while ((c < '1')||(c > '9'));\n do\n {\n result = result * 10 + (c - '0');\n c = vtkPNMReaderGetChar(fp);\n }\n while ((c >= '0')&&(c <= '9'));\n\n \/\/ put the CR\/LF or whitespace back.....\n ungetc(c, fp);\n return result;\n}\n \n\nvoid vtkPNMReader::UpdateImageInformation()\n{\n int xsize, ysize, comp;\n char magic[80];\n char c;\n FILE *fp;\n\n \/\/ if the user has not set the extent, but has set the VOI\n \/\/ set the zaxis extent to the VOI z axis\n if (this->DataExtent[4]==0 && this->DataExtent[5] == 0 &&\n (this->DataVOI[4] || this->DataVOI[5]))\n {\n this->DataExtent[4] = this->DataVOI[4];\n this->DataExtent[5] = this->DataVOI[5];\n }\n\n \/\/ Allocate the space for the filename\n this->ComputeInternalFileName(this->DataExtent[4]);\n \n \/\/ get the magic number by reading in a file\n fp = fopen(this->InternalFileName,\"rb\");\n if (!fp)\n {\n vtkErrorMacro(\"Unable to open file \" << this->InternalFileName);\n return;\n }\n\n do\n {\n c = vtkPNMReaderGetChar(fp);\n }\n while (c != 'P');\n magic[0] = c;\n magic[1] = vtkPNMReaderGetChar(fp);\n magic[2] = '\\0';\n\n \/\/ now get the dimensions\n xsize = vtkPNMReaderGetInt(fp);\n ysize = vtkPNMReaderGetInt(fp);\n\n \/\/ read max pixel value into comp for now\n comp = vtkPNMReaderGetInt(fp);\n do\n {\n c = getc(fp);\n }\n while (c != 0x0a);\n \n \n \/\/ Set the header size now that we have parsed it\n this->SetHeaderSize(ftell(fp));\n\n fclose(fp);\n\n \/\/ compare magic number to determine file type\n if ( ! strcmp(magic,\"P5\") ) \n {\n comp = 1;\n }\n else if ( ! strcmp(magic,\"P6\") ) \n {\n comp = 3;\n }\n else\n {\n vtkErrorMacro(<<\"Unknown file type! Not a binary PGM or PPM\");\n return;\n }\n\n \/\/ if the user has set the VOI, just make sure its valid\n if (this->DataVOI[0] || this->DataVOI[1] || \n this->DataVOI[2] || this->DataVOI[3] ||\n this->DataVOI[4] || this->DataVOI[5])\n { \n if ((this->DataVOI[0] < 0) ||\n\t(this->DataVOI[1] >= xsize) ||\n\t(this->DataVOI[2] < 0) ||\n\t(this->DataVOI[3] >= ysize))\n {\n vtkWarningMacro(\"The requested VOI is larger than the file's (\" << this->InternalFileName << \") extent \");\n this->DataVOI[0] = 0;\n this->DataVOI[1] = xsize - 1;\n this->DataVOI[2] = 0;\n this->DataVOI[3] = ysize - 1;\n }\n }\n\n this->DataExtent[0] = 0;\n this->DataExtent[1] = xsize - 1;\n this->DataExtent[2] = 0;\n this->DataExtent[3] = ysize - 1;\n \n this->SetDataScalarTypeToUnsignedChar();\n this->SetNumberOfScalarComponents(comp);\n \n vtkImageReader::UpdateImageInformation();\n}\n\n\n<commit_msg>FIX: refined end of header detection for binary files...<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkPNMReader.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\nCopyright (c) 1993-1998 Ken Martin, Will Schroeder, Bill Lorensen.\n\nThis software is copyrighted by Ken Martin, Will Schroeder and Bill Lorensen.\nThe following terms apply to all files associated with the software unless\nexplicitly disclaimed in individual files. This copyright specifically does\nnot apply to the related textbook \"The Visualization Toolkit\" ISBN\n013199837-4 published by Prentice Hall which is covered by its own copyright.\n\nThe authors hereby grant permission to use, copy, and distribute this\nsoftware and its documentation for any purpose, provided that existing\ncopyright notices are retained in all copies and that this notice is included\nverbatim in any distributions. Additionally, the authors grant permission to\nmodify this software and its documentation for any purpose, provided that\nsuch modifications are not distributed without the explicit consent of the\nauthors and that existing copyright notices are retained in all copies. Some\nof the algorithms implemented by this software are patented, observe all\napplicable patent law.\n\nIN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY FOR\nDIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT\nOF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY DERIVATIVES THEREOF,\nEVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nTHE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES, INCLUDING,\nBUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\nPARTICULAR PURPOSE, AND NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN\n\"AS IS\" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE\nMAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n\n\n=========================================================================*\/\n\n#include \"vtkPNMReader.h\"\n#include <stdio.h>\n\nchar vtkPNMReaderGetChar(FILE *fp)\n{\n char c;\n int result;\n\n if ((result = getc(fp)) == EOF )\n {\n return '\\0';\n }\n \n c = (char)result;\n if (c == '#')\n {\n do\n {\n if ((result = getc(fp)) == EOF )\n\t{\n\treturn '\\0';\n\t}\n c = (char)result;\n }\n while (c != '\\n');\n }\n \n return c;\n}\n\nint vtkPNMReaderGetInt(FILE *fp)\n{\n char c;\n int result = 0;\n \n do\n {\n c = vtkPNMReaderGetChar(fp);\n }\n while ((c < '1')||(c > '9'));\n do\n {\n result = result * 10 + (c - '0');\n c = vtkPNMReaderGetChar(fp);\n }\n while ((c >= '0')&&(c <= '9'));\n\n \/\/ put the CR\/LF or whitespace back.....\n ungetc(c, fp);\n return result;\n}\n \n\nvoid vtkPNMReader::UpdateImageInformation()\n{\n int xsize, ysize, comp;\n char magic[80];\n char c;\n FILE *fp;\n\n \/\/ if the user has not set the extent, but has set the VOI\n \/\/ set the zaxis extent to the VOI z axis\n if (this->DataExtent[4]==0 && this->DataExtent[5] == 0 &&\n (this->DataVOI[4] || this->DataVOI[5]))\n {\n this->DataExtent[4] = this->DataVOI[4];\n this->DataExtent[5] = this->DataVOI[5];\n }\n\n \/\/ Allocate the space for the filename\n this->ComputeInternalFileName(this->DataExtent[4]);\n \n \/\/ get the magic number by reading in a file\n fp = fopen(this->InternalFileName,\"rb\");\n if (!fp)\n {\n vtkErrorMacro(\"Unable to open file \" << this->InternalFileName);\n return;\n }\n\n do\n {\n c = vtkPNMReaderGetChar(fp);\n }\n while (c != 'P');\n magic[0] = c;\n magic[1] = vtkPNMReaderGetChar(fp);\n magic[2] = '\\0';\n\n \/\/ now get the dimensions\n xsize = vtkPNMReaderGetInt(fp);\n ysize = vtkPNMReaderGetInt(fp);\n\n \/\/ read max pixel value into comp for now\n comp = vtkPNMReaderGetInt(fp);\n\n \/\/ if file is ascii, any amount of whitespace may follow.\n \/\/ if file is binary, a single whitespace character will follow.\n \/\/ We only support binary ppm and pgm files right now. So the next\n \/\/ character IS always ignored.\n c = getc(fp);\n\n \/\/ if this file was \"written\" on the PC, then a CR will have been\n \/\/ written as a CR\/LF combination. So, if this single whitespace\n \/\/ character is a CR and it is followed by a LF, then swallow the\n \/\/ linefeed character as well. (Not part of the PPM standard, but a\n \/\/ a hard fact of life. \n if ( c == 0x0d )\n {\n c = getc(fp);\n if ( c != 0x0a )\n {\n\tungetc( c, fp );\n }\n }\n \n \n \/\/ Set the header size now that we have parsed it\n this->SetHeaderSize(ftell(fp));\n\n fclose(fp);\n\n \/\/ compare magic number to determine file type\n if ( ! strcmp(magic,\"P5\") ) \n {\n comp = 1;\n }\n else if ( ! strcmp(magic,\"P6\") ) \n {\n comp = 3;\n }\n else\n {\n vtkErrorMacro(<<\"Unknown file type! Not a binary PGM or PPM\");\n return;\n }\n\n \/\/ if the user has set the VOI, just make sure its valid\n if (this->DataVOI[0] || this->DataVOI[1] || \n this->DataVOI[2] || this->DataVOI[3] ||\n this->DataVOI[4] || this->DataVOI[5])\n { \n if ((this->DataVOI[0] < 0) ||\n\t(this->DataVOI[1] >= xsize) ||\n\t(this->DataVOI[2] < 0) ||\n\t(this->DataVOI[3] >= ysize))\n {\n vtkWarningMacro(\"The requested VOI is larger than the file's (\" << this->InternalFileName << \") extent \");\n this->DataVOI[0] = 0;\n this->DataVOI[1] = xsize - 1;\n this->DataVOI[2] = 0;\n this->DataVOI[3] = ysize - 1;\n }\n }\n\n this->DataExtent[0] = 0;\n this->DataExtent[1] = xsize - 1;\n this->DataExtent[2] = 0;\n this->DataExtent[3] = ysize - 1;\n \n this->SetDataScalarTypeToUnsignedChar();\n this->SetNumberOfScalarComponents(comp);\n \n vtkImageReader::UpdateImageInformation();\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AccessibleCellBase.cxx,v $\n *\n * $Revision: 1.21 $\n *\n * last change: $Author: obo $ $Date: 2007-03-05 14:44:09 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n#include \"AccessibleCellBase.hxx\"\n#ifndef SC_SCATTR_HXX\n#include \"attrib.hxx\"\n#endif\n#ifndef SC_ITEMS_HXX\n#include \"scitems.hxx\"\n#endif\n#ifndef SC_MISCUNO_HXX\n#include \"miscuno.hxx\"\n#endif\n#ifndef SC_DOCUMENT_HXX\n#include \"document.hxx\"\n#endif\n#ifndef SC_DOCFUNC_HXX\n#include \"docfunc.hxx\"\n#endif\n#ifndef SC_CELL_HXX\n#include \"cell.hxx\"\n#endif\n#ifndef SC_UNOGUARD_HXX\n#include \"unoguard.hxx\"\n#endif\n#ifndef SC_SCRESID_HXX\n#include \"scresid.hxx\"\n#endif\n#ifndef SC_SC_HRC\n#include \"sc.hrc\"\n#endif\n#ifndef SC_UNONAMES_HXX\n#include \"unonames.hxx\"\n#endif\n\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLEROLE_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleRole.hpp>\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLESTATETYPE_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleStateType.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_SHEET_XSPREADSHEETDOCUMENT_HPP_\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#endif\n#ifndef _COM_SUN_STAR_SHEET_XSPREADSHEET_HPP_\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n#ifndef _SVX_BRSHITEM_HXX\n#include <svx\/brshitem.hxx>\n#endif\n#ifndef _RTL_UUID_H_\n#include <rtl\/uuid.h>\n#endif\n#ifndef _COMPHELPER_SEQUENCE_HXX_\n#include <comphelper\/sequence.hxx>\n#endif\n#include <sfx2\/objsh.hxx>\n\n#include <float.h>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\n\n\/\/===== internal ============================================================\n\nScAccessibleCellBase::ScAccessibleCellBase(\n const uno::Reference<XAccessible>& rxParent,\n ScDocument* pDoc,\n const ScAddress& rCellAddress,\n sal_Int32 nIndex)\n :\n ScAccessibleContextBase(rxParent, AccessibleRole::TABLE_CELL),\n maCellAddress(rCellAddress),\n mpDoc(pDoc),\n mnIndex(nIndex)\n{\n}\n\nScAccessibleCellBase::~ScAccessibleCellBase()\n{\n}\n\n \/\/===== XAccessibleComponent ============================================\n\nsal_Bool SAL_CALL ScAccessibleCellBase::isVisible( )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n \/\/ test whether the cell is hidden (column\/row - hidden\/filtered)\n sal_Bool bVisible(sal_True);\n if (mpDoc)\n {\n BYTE nColFlags = mpDoc->GetColFlags(maCellAddress.Col(), maCellAddress.Tab());\n BYTE nRowFlags = mpDoc->GetRowFlags(maCellAddress.Row(), maCellAddress.Tab());\n if (((nColFlags & CR_HIDDEN) == CR_HIDDEN) || ((nColFlags & CR_FILTERED) == CR_FILTERED) ||\n ((nRowFlags & CR_HIDDEN) == CR_HIDDEN) || ((nRowFlags & CR_FILTERED) == CR_FILTERED))\n bVisible = sal_False;\n }\n return bVisible;\n}\n\nsal_Int32 SAL_CALL ScAccessibleCellBase::getForeground()\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n sal_Int32 nColor(0);\n if (mpDoc)\n {\n SfxObjectShell* pObjSh = mpDoc->GetDocumentShell();\n if ( pObjSh )\n {\n uno::Reference <sheet::XSpreadsheetDocument> xSpreadDoc( pObjSh->GetModel(), uno::UNO_QUERY );\n if ( xSpreadDoc.is() )\n {\n uno::Reference<sheet::XSpreadsheets> xSheets = xSpreadDoc->getSheets();\n uno::Reference<container::XIndexAccess> xIndex( xSheets, uno::UNO_QUERY );\n if ( xIndex.is() )\n {\n uno::Any aTable = xIndex->getByIndex(maCellAddress.Tab());\n uno::Reference<sheet::XSpreadsheet> xTable;\n if (aTable>>=xTable)\n {\n uno::Reference<table::XCell> xCell = xTable->getCellByPosition(maCellAddress.Col(), maCellAddress.Row());\n if (xCell.is())\n {\n uno::Reference<beans::XPropertySet> xCellProps(xCell, uno::UNO_QUERY);\n if (xCellProps.is())\n {\n uno::Any aAny = xCellProps->getPropertyValue(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CCOLOR)));\n aAny >>= nColor;\n }\n }\n }\n }\n }\n }\n }\n return nColor;\n}\n\nsal_Int32 SAL_CALL ScAccessibleCellBase::getBackground()\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n sal_Int32 nColor(0);\n\n if (mpDoc)\n {\n SfxObjectShell* pObjSh = mpDoc->GetDocumentShell();\n if ( pObjSh )\n {\n uno::Reference <sheet::XSpreadsheetDocument> xSpreadDoc( pObjSh->GetModel(), uno::UNO_QUERY );\n if ( xSpreadDoc.is() )\n {\n uno::Reference<sheet::XSpreadsheets> xSheets = xSpreadDoc->getSheets();\n uno::Reference<container::XIndexAccess> xIndex( xSheets, uno::UNO_QUERY );\n if ( xIndex.is() )\n {\n uno::Any aTable = xIndex->getByIndex(maCellAddress.Tab());\n uno::Reference<sheet::XSpreadsheet> xTable;\n if (aTable>>=xTable)\n {\n uno::Reference<table::XCell> xCell = xTable->getCellByPosition(maCellAddress.Col(), maCellAddress.Row());\n if (xCell.is())\n {\n uno::Reference<beans::XPropertySet> xCellProps(xCell, uno::UNO_QUERY);\n if (xCellProps.is())\n {\n uno::Any aAny = xCellProps->getPropertyValue(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CELLBACK)));\n aAny >>= nColor;\n }\n }\n }\n }\n }\n }\n }\n\n return nColor;\n}\n\n \/\/===== XInterface =====================================================\n\nuno::Any SAL_CALL ScAccessibleCellBase::queryInterface( uno::Type const & rType )\n throw (uno::RuntimeException)\n{\n uno::Any aAny (ScAccessibleCellBaseImpl::queryInterface(rType));\n return aAny.hasValue() ? aAny : ScAccessibleContextBase::queryInterface(rType);\n}\n\nvoid SAL_CALL ScAccessibleCellBase::acquire()\n throw ()\n{\n ScAccessibleContextBase::acquire();\n}\n\nvoid SAL_CALL ScAccessibleCellBase::release()\n throw ()\n{\n ScAccessibleContextBase::release();\n}\n\n \/\/===== XAccessibleContext ==============================================\n\nsal_Int32\n ScAccessibleCellBase::getAccessibleIndexInParent(void)\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n return mnIndex;\n}\n\n::rtl::OUString SAL_CALL\n ScAccessibleCellBase::createAccessibleDescription(void)\n throw (uno::RuntimeException)\n{\n rtl::OUString sDescription = String(ScResId(STR_ACC_CELL_DESCR));\n\n return sDescription;\n}\n\n::rtl::OUString SAL_CALL\n ScAccessibleCellBase::createAccessibleName(void)\n throw (uno::RuntimeException)\n{\n String sName( ScResId(STR_ACC_CELL_NAME) );\n String sAddress;\n \/\/ Document not needed, because only the cell address, but not the tablename is needed\n \/\/ always us OOO notation\n maCellAddress.Format( sAddress, SCA_VALID, NULL );\n sName.SearchAndReplaceAscii(\"%1\", sAddress);\n \/* #i65103# ZoomText merges cell address and contents, e.g. if value 2 is\n contained in cell A1, ZT reads \"cell A twelve\" instead of \"cell A1 - 2\".\n Simple solution: Append a space character to the cell address. *\/\n sName.Append( ' ' );\n return rtl::OUString(sName);\n}\n\n \/\/===== XAccessibleValue ================================================\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getCurrentValue( )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n uno::Any aAny;\n if (mpDoc)\n aAny <<= mpDoc->GetValue(maCellAddress);\n\n return aAny;\n}\n\nsal_Bool SAL_CALL\n ScAccessibleCellBase::setCurrentValue( const uno::Any& aNumber )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n double fValue = 0;\n sal_Bool bResult(sal_False);\n if((aNumber >>= fValue) && mpDoc && mpDoc->GetDocumentShell())\n {\n uno::Reference<XAccessibleStateSet> xParentStates;\n if (getAccessibleParent().is())\n {\n uno::Reference<XAccessibleContext> xParentContext = getAccessibleParent()->getAccessibleContext();\n xParentStates = xParentContext->getAccessibleStateSet();\n }\n if (IsEditable(xParentStates))\n {\n ScDocShell* pDocShell = (ScDocShell*) mpDoc->GetDocumentShell();\n ScDocFunc aFunc(*pDocShell);\n bResult = aFunc.PutCell( maCellAddress, new ScValueCell(fValue), TRUE );\n }\n }\n return bResult;\n}\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getMaximumValue( )\n throw (uno::RuntimeException)\n{\n uno::Any aAny;\n aAny <<= DBL_MAX;\n\n return aAny;\n}\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getMinimumValue( )\n throw (uno::RuntimeException)\n{\n uno::Any aAny;\n aAny <<= -DBL_MAX;\n\n return aAny;\n}\n\n \/\/===== XServiceInfo ====================================================\n\n::rtl::OUString SAL_CALL ScAccessibleCellBase::getImplementationName(void)\n throw (uno::RuntimeException)\n{\n return rtl::OUString(RTL_CONSTASCII_USTRINGPARAM (\"ScAccessibleCellBase\"));\n}\n\n \/\/===== XTypeProvider ===================================================\n\nuno::Sequence< uno::Type > SAL_CALL ScAccessibleCellBase::getTypes()\n throw (uno::RuntimeException)\n{\n return comphelper::concatSequences(ScAccessibleCellBaseImpl::getTypes(), ScAccessibleContextBase::getTypes());\n}\n\nuno::Sequence<sal_Int8> SAL_CALL\n ScAccessibleCellBase::getImplementationId(void)\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n static uno::Sequence<sal_Int8> aId;\n if (aId.getLength() == 0)\n {\n aId.realloc (16);\n rtl_createUuid (reinterpret_cast<sal_uInt8 *>(aId.getArray()), 0, sal_True);\n }\n return aId;\n}\n\nsal_Bool ScAccessibleCellBase::IsEditable(\n const uno::Reference<XAccessibleStateSet>& rxParentStates)\n{\n sal_Bool bEditable(sal_False);\n if (rxParentStates.is() && rxParentStates->contains(AccessibleStateType::EDITABLE))\n bEditable = sal_True;\n return bEditable;\n}\n<commit_msg>INTEGRATION: CWS changefileheader (1.21.320); FILE MERGED 2008\/04\/01 15:30:34 thb 1.21.320.3: #i85898# Stripping all external header guards 2008\/04\/01 12:36:36 thb 1.21.320.2: #i85898# Stripping all external header guards 2008\/03\/31 17:15:06 rt 1.21.320.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AccessibleCellBase.cxx,v $\n * $Revision: 1.22 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\n#include \"AccessibleCellBase.hxx\"\n#include \"attrib.hxx\"\n#include \"scitems.hxx\"\n#include \"miscuno.hxx\"\n#include \"document.hxx\"\n#include \"docfunc.hxx\"\n#include \"cell.hxx\"\n#include \"unoguard.hxx\"\n#include \"scresid.hxx\"\n#ifndef SC_SC_HRC\n#include \"sc.hrc\"\n#endif\n#include \"unonames.hxx\"\n\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLEROLE_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleRole.hpp>\n#endif\n#ifndef _COM_SUN_STAR_ACCESSIBILITY_XACCESSIBLESTATETYPE_HPP_\n#include <com\/sun\/star\/accessibility\/AccessibleStateType.hpp>\n#endif\n#include <com\/sun\/star\/sheet\/XSpreadsheetDocument.hpp>\n#include <com\/sun\/star\/sheet\/XSpreadsheet.hpp>\n#include <tools\/debug.hxx>\n#include <svx\/brshitem.hxx>\n#include <rtl\/uuid.h>\n#include <comphelper\/sequence.hxx>\n#include <sfx2\/objsh.hxx>\n\n#include <float.h>\n\nusing namespace ::com::sun::star;\nusing namespace ::com::sun::star::accessibility;\n\n\/\/===== internal ============================================================\n\nScAccessibleCellBase::ScAccessibleCellBase(\n const uno::Reference<XAccessible>& rxParent,\n ScDocument* pDoc,\n const ScAddress& rCellAddress,\n sal_Int32 nIndex)\n :\n ScAccessibleContextBase(rxParent, AccessibleRole::TABLE_CELL),\n maCellAddress(rCellAddress),\n mpDoc(pDoc),\n mnIndex(nIndex)\n{\n}\n\nScAccessibleCellBase::~ScAccessibleCellBase()\n{\n}\n\n \/\/===== XAccessibleComponent ============================================\n\nsal_Bool SAL_CALL ScAccessibleCellBase::isVisible( )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n \/\/ test whether the cell is hidden (column\/row - hidden\/filtered)\n sal_Bool bVisible(sal_True);\n if (mpDoc)\n {\n BYTE nColFlags = mpDoc->GetColFlags(maCellAddress.Col(), maCellAddress.Tab());\n BYTE nRowFlags = mpDoc->GetRowFlags(maCellAddress.Row(), maCellAddress.Tab());\n if (((nColFlags & CR_HIDDEN) == CR_HIDDEN) || ((nColFlags & CR_FILTERED) == CR_FILTERED) ||\n ((nRowFlags & CR_HIDDEN) == CR_HIDDEN) || ((nRowFlags & CR_FILTERED) == CR_FILTERED))\n bVisible = sal_False;\n }\n return bVisible;\n}\n\nsal_Int32 SAL_CALL ScAccessibleCellBase::getForeground()\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n sal_Int32 nColor(0);\n if (mpDoc)\n {\n SfxObjectShell* pObjSh = mpDoc->GetDocumentShell();\n if ( pObjSh )\n {\n uno::Reference <sheet::XSpreadsheetDocument> xSpreadDoc( pObjSh->GetModel(), uno::UNO_QUERY );\n if ( xSpreadDoc.is() )\n {\n uno::Reference<sheet::XSpreadsheets> xSheets = xSpreadDoc->getSheets();\n uno::Reference<container::XIndexAccess> xIndex( xSheets, uno::UNO_QUERY );\n if ( xIndex.is() )\n {\n uno::Any aTable = xIndex->getByIndex(maCellAddress.Tab());\n uno::Reference<sheet::XSpreadsheet> xTable;\n if (aTable>>=xTable)\n {\n uno::Reference<table::XCell> xCell = xTable->getCellByPosition(maCellAddress.Col(), maCellAddress.Row());\n if (xCell.is())\n {\n uno::Reference<beans::XPropertySet> xCellProps(xCell, uno::UNO_QUERY);\n if (xCellProps.is())\n {\n uno::Any aAny = xCellProps->getPropertyValue(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CCOLOR)));\n aAny >>= nColor;\n }\n }\n }\n }\n }\n }\n }\n return nColor;\n}\n\nsal_Int32 SAL_CALL ScAccessibleCellBase::getBackground()\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n sal_Int32 nColor(0);\n\n if (mpDoc)\n {\n SfxObjectShell* pObjSh = mpDoc->GetDocumentShell();\n if ( pObjSh )\n {\n uno::Reference <sheet::XSpreadsheetDocument> xSpreadDoc( pObjSh->GetModel(), uno::UNO_QUERY );\n if ( xSpreadDoc.is() )\n {\n uno::Reference<sheet::XSpreadsheets> xSheets = xSpreadDoc->getSheets();\n uno::Reference<container::XIndexAccess> xIndex( xSheets, uno::UNO_QUERY );\n if ( xIndex.is() )\n {\n uno::Any aTable = xIndex->getByIndex(maCellAddress.Tab());\n uno::Reference<sheet::XSpreadsheet> xTable;\n if (aTable>>=xTable)\n {\n uno::Reference<table::XCell> xCell = xTable->getCellByPosition(maCellAddress.Col(), maCellAddress.Row());\n if (xCell.is())\n {\n uno::Reference<beans::XPropertySet> xCellProps(xCell, uno::UNO_QUERY);\n if (xCellProps.is())\n {\n uno::Any aAny = xCellProps->getPropertyValue(rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(SC_UNONAME_CELLBACK)));\n aAny >>= nColor;\n }\n }\n }\n }\n }\n }\n }\n\n return nColor;\n}\n\n \/\/===== XInterface =====================================================\n\nuno::Any SAL_CALL ScAccessibleCellBase::queryInterface( uno::Type const & rType )\n throw (uno::RuntimeException)\n{\n uno::Any aAny (ScAccessibleCellBaseImpl::queryInterface(rType));\n return aAny.hasValue() ? aAny : ScAccessibleContextBase::queryInterface(rType);\n}\n\nvoid SAL_CALL ScAccessibleCellBase::acquire()\n throw ()\n{\n ScAccessibleContextBase::acquire();\n}\n\nvoid SAL_CALL ScAccessibleCellBase::release()\n throw ()\n{\n ScAccessibleContextBase::release();\n}\n\n \/\/===== XAccessibleContext ==============================================\n\nsal_Int32\n ScAccessibleCellBase::getAccessibleIndexInParent(void)\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n return mnIndex;\n}\n\n::rtl::OUString SAL_CALL\n ScAccessibleCellBase::createAccessibleDescription(void)\n throw (uno::RuntimeException)\n{\n rtl::OUString sDescription = String(ScResId(STR_ACC_CELL_DESCR));\n\n return sDescription;\n}\n\n::rtl::OUString SAL_CALL\n ScAccessibleCellBase::createAccessibleName(void)\n throw (uno::RuntimeException)\n{\n String sName( ScResId(STR_ACC_CELL_NAME) );\n String sAddress;\n \/\/ Document not needed, because only the cell address, but not the tablename is needed\n \/\/ always us OOO notation\n maCellAddress.Format( sAddress, SCA_VALID, NULL );\n sName.SearchAndReplaceAscii(\"%1\", sAddress);\n \/* #i65103# ZoomText merges cell address and contents, e.g. if value 2 is\n contained in cell A1, ZT reads \"cell A twelve\" instead of \"cell A1 - 2\".\n Simple solution: Append a space character to the cell address. *\/\n sName.Append( ' ' );\n return rtl::OUString(sName);\n}\n\n \/\/===== XAccessibleValue ================================================\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getCurrentValue( )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n uno::Any aAny;\n if (mpDoc)\n aAny <<= mpDoc->GetValue(maCellAddress);\n\n return aAny;\n}\n\nsal_Bool SAL_CALL\n ScAccessibleCellBase::setCurrentValue( const uno::Any& aNumber )\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n double fValue = 0;\n sal_Bool bResult(sal_False);\n if((aNumber >>= fValue) && mpDoc && mpDoc->GetDocumentShell())\n {\n uno::Reference<XAccessibleStateSet> xParentStates;\n if (getAccessibleParent().is())\n {\n uno::Reference<XAccessibleContext> xParentContext = getAccessibleParent()->getAccessibleContext();\n xParentStates = xParentContext->getAccessibleStateSet();\n }\n if (IsEditable(xParentStates))\n {\n ScDocShell* pDocShell = (ScDocShell*) mpDoc->GetDocumentShell();\n ScDocFunc aFunc(*pDocShell);\n bResult = aFunc.PutCell( maCellAddress, new ScValueCell(fValue), TRUE );\n }\n }\n return bResult;\n}\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getMaximumValue( )\n throw (uno::RuntimeException)\n{\n uno::Any aAny;\n aAny <<= DBL_MAX;\n\n return aAny;\n}\n\nuno::Any SAL_CALL\n ScAccessibleCellBase::getMinimumValue( )\n throw (uno::RuntimeException)\n{\n uno::Any aAny;\n aAny <<= -DBL_MAX;\n\n return aAny;\n}\n\n \/\/===== XServiceInfo ====================================================\n\n::rtl::OUString SAL_CALL ScAccessibleCellBase::getImplementationName(void)\n throw (uno::RuntimeException)\n{\n return rtl::OUString(RTL_CONSTASCII_USTRINGPARAM (\"ScAccessibleCellBase\"));\n}\n\n \/\/===== XTypeProvider ===================================================\n\nuno::Sequence< uno::Type > SAL_CALL ScAccessibleCellBase::getTypes()\n throw (uno::RuntimeException)\n{\n return comphelper::concatSequences(ScAccessibleCellBaseImpl::getTypes(), ScAccessibleContextBase::getTypes());\n}\n\nuno::Sequence<sal_Int8> SAL_CALL\n ScAccessibleCellBase::getImplementationId(void)\n throw (uno::RuntimeException)\n{\n ScUnoGuard aGuard;\n IsObjectValid();\n static uno::Sequence<sal_Int8> aId;\n if (aId.getLength() == 0)\n {\n aId.realloc (16);\n rtl_createUuid (reinterpret_cast<sal_uInt8 *>(aId.getArray()), 0, sal_True);\n }\n return aId;\n}\n\nsal_Bool ScAccessibleCellBase::IsEditable(\n const uno::Reference<XAccessibleStateSet>& rxParentStates)\n{\n sal_Bool bEditable(sal_False);\n if (rxParentStates.is() && rxParentStates->contains(AccessibleStateType::EDITABLE))\n bEditable = sal_True;\n return bEditable;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SpliceGraph.h\"\n#include \"sjAlignSplit.h\"\n\nvoid SpliceGraph::findSuperTr(const char *readSeq, const char *readSeqRevCompl, const uint32 readLen, const string &readName, Genome &mapGen)\n{\/\/find the candidate superTranscripts: seed-and-rank algorithm implemented\n\t\t\n\t\/\/hardcoded for now\n\tfloat seedCoverageThreshold = 0.1;\n\tfloat seedCoverageMinToMax = 0.1;\n\tuint32 seedMultMax = 200;\n\t\n\t\/\/readLen, readSeq\n uint32 seedLen=mapGen.pGe.gSAindexNbases; \/\/TODO: make user-definable\n memset(superTrSeedCount,0,sizeof(superTrSeedCount[0])*2*superTr.N);\n \n for (uint32 iseed=0; iseed<readLen\/seedLen; iseed++) {\/\/loop through seeds\n \/\/calculate index\n uint64 ind1=0;\n for (uint32 ii=iseed*seedLen; ii<(iseed+1)*seedLen; ii++) {\n uint b=(uint64) readSeq[ii];\n if (b>3) {\/\/N\n continue; \/\/no mapping for seeds with Ns\n } else {\n ind1 <<= 2;\n ind1 += b;\n };\n };\n \/\/find seed boundaries in SA\n uint64 iSA1=mapGen.SAi[mapGen.genomeSAindexStart[seedLen-1]+ind1]; \/\/ starting point for suffix array search.\n if ( (iSA1 & mapGen.SAiMarkAbsentMaskC) != 0) {\/\/prefix does not exist, skip this seed\n continue;\n };\n uint64 iSA2;\n if (mapGen.genomeSAindexStart[seedLen-1]+ind1+1 < mapGen.genomeSAindexStart[seedLen]) {\/\/we are not at the end of the SA\n iSA2=((mapGen.SAi[mapGen.genomeSAindexStart[seedLen-1]+ind1+1] & mapGen.SAiMarkNmask) & mapGen.SAiMarkAbsentMask) - 1;\n } else {\n iSA2=mapGen.nSA-1;\n };\n\n\t\tif (iSA2-iSA1>=seedMultMax) \/\/this seed map too many times\n\t\t\tcontinue;\n\t\t\n for (uint64 isa=iSA1;isa<=iSA2;isa++) {\/\/loop through seed SA boundaries\n uint64 a1 = mapGen.SA[isa];\n uint64 aStr = a1 >> mapGen.GstrandBit;\n a1 = a1 & mapGen.GstrandMask; \/\/remove strand bit\n if (aStr==1)\n a1 = mapGen.nGenome - (seedLen+a1);\n \n if (a1>=mapGen.sjGstart) {\/\/this is sj align. Probably do not need it...\n uint64 a1D, aLengthD, a1A, aLengthA, sj1;\n if ( sjAlignSplit(a1, seedLen, mapGen, a1D, aLengthD, a1A, aLengthA, sj1) ) {\/\/if align crosses the junction, replace a1 with a1D\n a1=a1D;\n } else {\n continue;\/\/this align does not cross the junction, no need to contine\n };\n };\n \n superTrSeedCount[aStr*superTr.N + mapGen.chrBin[a1 >> mapGen.pGe.gChrBinNbits]]++;\n };\/\/loop through seed SA boundaries\n };\/\/loop through seeds\n \n \/\/find max coverage\n typeSuperTrSeedCount countMax=0;\n\t\/\/float countOverSuperTrLenMax=0;\n for (uint32 ii=0; ii<2*superTr.N; ii++) {\n countMax=max(superTrSeedCount[ii], countMax);\n\t\t\/\/countOverSuperTrLenMax=max(superTrSeedCount[ii]\/float(superTr.length[ii%superTr.N]), countOverSuperTrLenMax);\n };\n \n if (countMax*seedLen<readLen*seedCoverageThreshold)\/\/no good candidates, hard-coded for now\n return;\n \n for (uint32 ii=0; ii<superTr.N; ii++) {\/\/selection cycle\n\t\t\t\t\n uint32 sutr1=ii%superTr.N;\n uint32 str1=ii\/superTr.N;\n\t\t\n if (superTrSeedCount[ii]<countMax*seedCoverageMinToMax)\n\t\t\/\/if (superTrSeedCount[ii]<countOverSuperTrLenMax*superTr.length[sutr1]*seedCoverageMinToMax)\n\t\t\tcontinue;\n\n\n\t\tif (superTr.length[sutr1]>=100000) \/\/temporary restriction: will lift after redoing the scoringMatrix\n\t\t\tcontinue;\t\t\n\t\t\n array<uint32,2> alignEnds, alignStarts;\n \n\t\tuint32 swScore = 0;\n \/\/swScore = swScoreSpliced((str1==0 ? readSeq : readSeqRevCompl), readLen, sutr1, alignEnds);\n \n \/\/swTraceBack(alignEnds, alignStarts);\n\t\t\/\/float(superTrSeedCount[ii])\/countMax\n\t\t\/\/float(superTrSeedCount[ii])\/superTr.length[sutr1]\/countOverSuperTrLenMax <<'\\t'<<\n\n\t\tcout << readName <<'\\t'<< sutr1 <<'\\t'<< str1 <<'\\t'<< superTr.length[sutr1] <<'\\t'<< readLen <<'\\t'<< float(superTrSeedCount[ii])\/readLen*seedLen <<'\\t'<< \n\t\t\t\tfloat(superTrSeedCount[ii])\/countMax <<'\\t'<<\n swScore <<'\\t'<< float(swScore)\/readLen <<'\\t'<< alignStarts[0] <<'\\t'<< alignEnds[0] <<'\\t'<< alignStarts[1] <<'\\t'<< alignEnds[1] << endl;\n\n };\n\n return;\n};\n\n<commit_msg>Multiple seed matches to the same superTr are counted only once. Minor improvement in performance.<commit_after>#include \"SpliceGraph.h\"\n#include \"sjAlignSplit.h\"\n\nvoid SpliceGraph::findSuperTr(const char *readSeq, const char *readSeqRevCompl, const uint32 readLen, const string &readName, Genome &mapGen)\n{\/\/find the candidate superTranscripts: seed-and-rank algorithm implemented\n\t\t\n\t\/\/hardcoded for now\n\tfloat seedCoverageThreshold = 0.1;\n\tfloat seedCoverageMinToMax = 0.1;\n\tuint32 seedMultMax = 200;\n\t\n\tvector<uint32> seedSuperTr;\n\tseedSuperTr.reserve(seedMultMax);\n\t\n\t\/\/readLen, readSeq\n uint32 seedLen=mapGen.pGe.gSAindexNbases; \/\/TODO: make user-definable\n memset(superTrSeedCount,0,sizeof(superTrSeedCount[0])*2*superTr.N);\n \n for (uint32 iseed=0; iseed<readLen\/seedLen; iseed++) {\/\/loop through seeds\n \/\/calculate index\n uint64 ind1=0;\n for (uint32 ii=iseed*seedLen; ii<(iseed+1)*seedLen; ii++) {\n uint b=(uint64) readSeq[ii];\n if (b>3) {\/\/N\n continue; \/\/no mapping for seeds with Ns\n } else {\n ind1 <<= 2;\n ind1 += b;\n };\n };\n \/\/find seed boundaries in SA\n uint64 iSA1=mapGen.SAi[mapGen.genomeSAindexStart[seedLen-1]+ind1]; \/\/ starting point for suffix array search.\n if ( (iSA1 & mapGen.SAiMarkAbsentMaskC) != 0) {\/\/prefix does not exist, skip this seed\n continue;\n };\n uint64 iSA2;\n if (mapGen.genomeSAindexStart[seedLen-1]+ind1+1 < mapGen.genomeSAindexStart[seedLen]) {\/\/we are not at the end of the SA\n iSA2=((mapGen.SAi[mapGen.genomeSAindexStart[seedLen-1]+ind1+1] & mapGen.SAiMarkNmask) & mapGen.SAiMarkAbsentMask) - 1;\n } else {\n iSA2=mapGen.nSA-1;\n };\n\n\t\tif (iSA2-iSA1>=seedMultMax) \/\/this seed map too many times\n\t\t\tcontinue;\n\t\t\n\t\tseedSuperTr.clear();\n\t\tseedSuperTr.resize(iSA2-iSA1+1);\n for (uint64 isa=iSA1;isa<=iSA2;isa++) {\/\/loop through seed SA boundaries\n uint64 a1 = mapGen.SA[isa];\n uint64 aStr = a1 >> mapGen.GstrandBit;\n a1 = a1 & mapGen.GstrandMask; \/\/remove strand bit\n if (aStr==1)\n a1 = mapGen.nGenome - (seedLen+a1);\n \n if (a1>=mapGen.sjGstart) {\/\/this is sj align. Probably do not need it...\n uint64 a1D, aLengthD, a1A, aLengthA, sj1;\n if ( sjAlignSplit(a1, seedLen, mapGen, a1D, aLengthD, a1A, aLengthA, sj1) ) {\/\/if align crosses the junction, replace a1 with a1D\n a1=a1D;\n } else {\n continue;\/\/this align does not cross the junction, no need to contine\n };\n };\n \n seedSuperTr[isa-iSA1]=(uint32)(aStr*superTr.N + mapGen.chrBin[a1 >> mapGen.pGe.gChrBinNbits]);\n };\/\/loop through seed SA boundaries\n\t\t\n\t\tsort(seedSuperTr.begin(),seedSuperTr.end());\n\t\tuint32 su1prev=(uint32)-1;\n\t\tfor (auto &su1 : seedSuperTr) {\/\/this will eliminate multiple matches of the same seed into the same suTr\n\t\t\tif (su1!=su1prev) {\n\t\t\t\tsuperTrSeedCount[su1]++;\n\t\t\t\tsu1prev=su1;\n\t\t\t};\n\t\t};\n\t\t\t\n };\/\/loop through seeds\n\t\n \/\/find max coverage\n typeSuperTrSeedCount countMax=0;\n\t\/\/float countOverSuperTrLenMax=0;\n for (uint32 ii=0; ii<2*superTr.N; ii++) {\n countMax=max(superTrSeedCount[ii], countMax);\n\t\t\/\/countOverSuperTrLenMax=max(superTrSeedCount[ii]\/float(superTr.length[ii%superTr.N]), countOverSuperTrLenMax);\n };\n \n if (countMax*seedLen<readLen*seedCoverageThreshold)\/\/no good candidates, hard-coded for now\n return;\n \n for (uint32 ii=0; ii<superTr.N; ii++) {\/\/selection cycle\n\t\t\t\t\n uint32 sutr1=ii%superTr.N;\n uint32 str1=ii\/superTr.N;\n\t\t\n if (superTrSeedCount[ii]<countMax*seedCoverageMinToMax)\n\t\t\/\/if (superTrSeedCount[ii]<countOverSuperTrLenMax*superTr.length[sutr1]*seedCoverageMinToMax)\n\t\t\tcontinue;\n\n\n\t\tif (superTr.length[sutr1]>=100000) \/\/temporary restriction: will lift after redoing the scoringMatrix\n\t\t\tcontinue;\t\t\n\t\t\n array<uint32,2> alignEnds, alignStarts;\n \n\t\tuint32 swScore = 0;\n \/\/swScore = swScoreSpliced((str1==0 ? readSeq : readSeqRevCompl), readLen, sutr1, alignEnds);\n \n \/\/swTraceBack(alignEnds, alignStarts);\n\t\t\/\/float(superTrSeedCount[ii])\/countMax\n\t\t\/\/float(superTrSeedCount[ii])\/superTr.length[sutr1]\/countOverSuperTrLenMax <<'\\t'<<\n\n\t\tcout << readName <<'\\t'<< sutr1 <<'\\t'<< str1 <<'\\t'<< superTr.length[sutr1] <<'\\t'<< readLen <<'\\t'<< float(superTrSeedCount[ii])\/readLen*seedLen <<'\\t'<< \n\t\t\t\tfloat(superTrSeedCount[ii])\/countMax <<'\\t'<<\n swScore <<'\\t'<< float(swScore)\/readLen <<'\\t'<< alignStarts[0] <<'\\t'<< alignEnds[0] <<'\\t'<< alignStarts[1] <<'\\t'<< alignEnds[1] << endl;\n\n };\n\n return;\n};\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\r\n#include <vector>\r\n#include <set>\r\n#include <algorithm>\r\n#include <queue>\r\n#include <boost\/asio.hpp>\r\n#include <boost\/thread.hpp>\r\n#include <google\/protobuf\/io\/coded_stream.h>\r\n#include \"message.pb.h\"\r\n\r\nusing namespace boost::asio;\r\nusing ru::spbau::chat::commons::protocol::Message;\r\nusing google::protobuf::io::CodedInputStream;\r\nusing google::protobuf::io::CodedOutputStream;\r\nusing google::protobuf::uint8;\r\nusing google::protobuf::uint32;\r\n\r\ntypedef std::pair<size_t, std::shared_ptr<uint8>> serialized_message;\r\n\r\n#ifdef DEBUG\r\nstatic size_t const INITIAL_BUFFER_SIZE = 1 << 2; \/\/ 4 b\r\n#else\r\nstatic size_t const INITIAL_BUFFER_SIZE = 1 << 12; \/\/ 4 Kb\r\n#endif\r\nstatic size_t const MESSAGES_IN_QUEUE_TO_FALLBACK = 1 << 8; \/\/ 256\r\nstatic size_t const MESSAGES_SUM_SIZE_TO_FALLBACK = 1 << 12; \/\/ 4 Kb\r\nstatic size_t const MAX_VARINT_BYTES = 10;\r\n\r\nclass chat_user\r\n{\r\npublic:\r\n virtual void accept_message_size() = 0;\r\n virtual bool deliver_message(serialized_message const &message) = 0;\r\n};\r\ntypedef std::shared_ptr<chat_user> user_ptr;\r\n\r\nserialized_message serialize_message(Message const &message)\r\n{\r\n size_t msg_size = message.ByteSize();\r\n size_t size = msg_size + MAX_VARINT_BYTES;\r\n std::shared_ptr<uint8> buffer(new uint8[size]);\r\n auto it = CodedOutputStream::WriteVarint32ToArray(msg_size, buffer.get());\r\n bool written = message.SerializeToArray(it, msg_size);\r\n assert(written);\r\n return serialized_message(msg_size + (it - buffer.get()), buffer);\r\n}\r\n\r\nclass chat_room\r\n{\r\npublic:\r\n chat_room()\r\n {\r\n }\r\n\r\n void add_new_user(user_ptr user)\r\n {\r\n rw_mutex.lock();\r\n users.push_back(user);\r\n rw_mutex.unlock();\r\n#ifdef DEBUG\r\n std::cout << \"User connected\" << std::endl;\r\n#endif\r\n user->accept_message_size();\r\n }\r\n\r\n void on_user_leave(user_ptr user)\r\n {\r\n rw_mutex.lock();\r\n auto pos = std::find_if(users.begin(), users.end(), [user](user_ptr &ptr)\r\n {\r\n return ptr.get() == user.get();\r\n });\r\n if (pos != users.end())\r\n {\r\n users.erase(pos);\r\n }\r\n rw_mutex.unlock();\r\n#ifdef DEBUG\r\n std::cout << \"User leaved\" << std::endl;\r\n#endif\r\n }\r\n\r\n size_t deliver_message_to_all(Message const &message, chat_user const *from_user)\r\n {\r\n serialized_message message_serialized(serialize_message(message));\r\n size_t overflow_queues = 0;\r\n rw_mutex.lock_shared();\r\n for(auto &user_p: users)\r\n {\r\n if (user_p.get() == from_user)\r\n {\r\n continue;\r\n }\r\n overflow_queues += user_p->deliver_message(message_serialized);\r\n }\r\n rw_mutex.unlock_shared();\r\n return overflow_queues;\r\n }\r\n\r\nprivate:\r\n std::vector<user_ptr> users;\r\n boost::shared_mutex rw_mutex;\r\n};\r\n\r\nclass user :\r\n public chat_user,\r\n public std::enable_shared_from_this<user>\r\n{\r\npublic:\r\n user(ip::tcp::socket sock, chat_room &chat, io_service &service)\r\n :\r\n socket(std::move(sock)),\r\n chat(chat),\r\n service(service),\r\n message_buffer(std::max(INITIAL_BUFFER_SIZE, MAX_VARINT_BYTES)),\r\n buffer_offset(0),\r\n buffer_red(0),\r\n write_buffer(std::max(INITIAL_BUFFER_SIZE, MAX_VARINT_BYTES)),\r\n messages_sum_size(0),\r\n write_in_progress(false)\r\n {\r\n }\r\n\r\n void accept_message_size()\r\n {\r\n check_enougth_space(MAX_VARINT_BYTES);\r\n\r\n if (buffer_red)\r\n {\r\n bool read_succ;\r\n size_t read_bytes_count;\r\n uint32 message_size;\r\n {\r\n CodedInputStream input(message_buffer.data() + buffer_offset, buffer_red);\r\n read_succ = input.ReadVarint32(&message_size);\r\n read_bytes_count = input.CurrentPosition();\r\n }\r\n if (read_succ)\r\n {\r\n buffer_offset += read_bytes_count;\r\n buffer_red -= read_bytes_count;\r\n accept_message(message_size);\r\n return;\r\n }\r\n if (buffer_red > MAX_VARINT_BYTES)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"invalid varint: \" << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n }\r\n }\r\n\r\n auto ancor(shared_from_this());\r\n async_read(socket, buffer(message_buffer.data() + buffer_offset + buffer_red,\r\n message_buffer.size() - buffer_offset - buffer_red),\r\n transfer_at_least(1),\r\n [this, ancor](boost::system::error_code ec, std::size_t bytes_red)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"Reading message size: bytes red \"\r\n << buffer_red + bytes_red << std::endl;\r\n#endif\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error on reading message_size: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n buffer_red += bytes_red;\r\n accept_message_size();\r\n }\r\n });\r\n }\r\n\r\n void accept_message(uint32 message_size)\r\n {\r\n check_enougth_space(message_size);\r\n\r\n if (buffer_red >= message_size)\r\n {\r\n Message message;\r\n try\r\n {\r\n message.ParseFromArray(message_buffer.data() + buffer_offset,\r\n message_size);\r\n } catch (std::exception &) {\r\n #ifdef DEBUG\r\n std::cout << \"Failed to parse protobuf message\" << std::endl;\r\n #endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n }\r\n buffer_offset += message_size;\r\n buffer_red -= message_size;\r\n\r\n#ifdef DEBUG\r\n std::cout << \"message red [\"\r\n << (message.has_type() ? message.type() : -1) << \", \"\r\n << (message.has_author() ? message.author() : \"no author\") << \", \"\r\n << (message.text_size() ? message.text(0) : \"no text\")\r\n << \"]\" << std::endl;\r\n#endif\r\n if (message.type() == Message::COMMAND)\r\n {\r\n std::cout << \"Command!!\" << std::endl;\r\n } else {\r\n size_t busy_factor = chat.deliver_message_to_all(message, this);\r\n for (size_t idx = 0; idx < busy_factor; ++idx)\r\n {\r\n if (!service.poll_one())\r\n {\r\n break;\r\n }\r\n }\r\n }\r\n accept_message_size();\r\n return;\r\n }\r\n\r\n\r\n auto ancor(shared_from_this());\r\n async_read(socket, buffer(message_buffer.data() + buffer_offset + buffer_red,\r\n message_buffer.size() - buffer_offset - buffer_red),\r\n transfer_at_least(message_size - buffer_red),\r\n [this, ancor, message_size](boost::system::error_code ec, std::size_t bytes_red)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"Reading message: bytes red \"\r\n << buffer_red + bytes_red << \" from \"\r\n << message_size << std::endl;\r\n#endif\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n buffer_red += bytes_red;\r\n accept_message(message_size);\r\n }\r\n });\r\n }\r\n\r\n bool deliver_message(serialized_message const &message)\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n messages_to_deliver.push(message);\r\n if (!write_in_progress)\r\n {\r\n write_in_progress = true;\r\n auto ancor(shared_from_this());\r\n service.post([this, ancor](){do_write();});\r\n }\r\n messages_sum_size += message.first;\r\n return messages_to_deliver.size() >= MESSAGES_IN_QUEUE_TO_FALLBACK ||\r\n messages_sum_size >= MESSAGES_SUM_SIZE_TO_FALLBACK;\r\n }\r\n\r\n ~user()\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"user destroyed\" << std::endl;\r\n#endif\r\n }\r\n\r\nprivate:\r\n void check_enougth_space(size_t space_needed)\r\n {\r\n assert(buffer_offset + buffer_red <= message_buffer.size());\r\n if (!buffer_red)\r\n {\r\n buffer_offset = 0;\r\n }\r\n if (buffer_offset + space_needed <= message_buffer.size())\r\n {\r\n return;\r\n }\r\n memmove(message_buffer.data(), message_buffer.data() + buffer_offset, buffer_red);\r\n buffer_offset = 0;\r\n if (space_needed > message_buffer.size())\r\n {\r\n message_buffer.resize(space_needed);\r\n }\r\n }\r\n\r\n void do_write()\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n size_t min_size = messages_to_deliver.front().first;\r\n if (write_buffer.size() < min_size)\r\n {\r\n write_buffer.resize(min_size);\r\n }\r\n size_t write_buffer_offset = 0;\r\n while (!messages_to_deliver.empty())\r\n {\r\n serialized_message const &message = messages_to_deliver.front();\r\n if (message.first > write_buffer.size() - write_buffer_offset)\r\n {\r\n break;\r\n }\r\n#ifdef DEBUG\r\n std::cout << \"message written\" << std::endl;\r\n#endif\r\n memcpy(write_buffer.data() + write_buffer_offset, message.second.get(), message.first);\r\n write_buffer_offset += message.first;\r\n messages_sum_size -= message.first;\r\n messages_to_deliver.pop();\r\n }\r\n\r\n\r\n auto ancor(shared_from_this());\r\n async_write(socket, buffer(write_buffer.data(), write_buffer_offset),\r\n [this, ancor](boost::system::error_code ec, std::size_t)\r\n {\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error writing: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n if (messages_to_deliver.empty())\r\n {\r\n write_in_progress = false;\r\n return;\r\n }\r\n }\r\n do_write();\r\n }\r\n });\r\n\r\n }\r\n\r\nprivate:\r\n ip::tcp::socket socket;\r\n chat_room &chat;\r\n io_service &service;\r\n std::vector<uint8> message_buffer;\r\n size_t buffer_offset;\r\n size_t buffer_red;\r\n std::vector<uint8> write_buffer;\r\n std::queue<serialized_message> messages_to_deliver;\r\n boost::mutex deliver_queue_mutex;\r\n size_t messages_sum_size;\r\n bool write_in_progress;\r\n};\r\n\r\nclass connection_handler\r\n{\r\npublic:\r\n connection_handler(io_service &service, int port, chat_room &chat)\r\n :\r\n sock(service),\r\n service(service),\r\n acc(service, ip::tcp::endpoint(ip::tcp::v4(), port)),\r\n chat(chat)\r\n {\r\n }\r\n\r\npublic:\r\n void accept_new_connection()\r\n {\r\n acc.async_accept(sock, [this](boost::system::error_code)\r\n {\r\n if (sock.is_open())\r\n {\r\n sock.set_option(ip::tcp::no_delay(true));\r\n chat.add_new_user(std::make_shared<user>(std::move(sock), chat, service));\r\n }\r\n accept_new_connection();\r\n });\r\n }\r\n\r\nprivate:\r\n ip::tcp::socket sock;\r\n io_service &service;\r\n ip::tcp::acceptor acc;\r\n chat_room &chat;\r\n};\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n if (argc < 3) {\r\n std::cout\r\n << \"Usage: .\/chat_server $PORT_NUMBER$ $CONCURRENCY_LEVEL$\"\r\n << std::endl\r\n << \"Where $CONCURRENCY_LEVEL$ - number of the worker threads\"\r\n << std::endl;\r\n return -1;\r\n }\r\n size_t port = std::atoi(argv[1]);\r\n size_t concurrency_level = std::atoi(argv[2]);\r\n\r\n try\r\n {\r\n std::cout << \"Starting chat server on port \"\r\n << port\r\n << \" with concurrency level \"\r\n << concurrency_level\r\n << \" ...\"\r\n << std::endl;\r\n\r\n io_service service(concurrency_level);\r\n chat_room chat;\r\n\r\n connection_handler handler(service, port, chat);\r\n handler.accept_new_connection();\r\n\r\n boost::thread_group workers;\r\n auto const worker =\r\n boost::bind(&io_service::run, &service);\r\n for (size_t idx = 0; idx < concurrency_level; ++idx)\r\n {\r\n workers.create_thread(worker);\r\n }\r\n\r\n std::cout << \"The server is started\" << std::endl;\r\n std::cout << \"Press 'enter' to stop the server\"\r\n << std::endl;\r\n std::cin.get();\r\n std::cout << \"Stopping the server...\" << std::endl;\r\n service.stop();\r\n workers.join_all();\r\n std::cout << \"The server is stopped\" << std::endl;\r\n } catch(std::exception &e) {\r\n std::cerr << \"An exception occured with \";\r\n if (e.what()) {\r\n std::cerr << \"message: \\\"\" << e.what() << '\"';\r\n } else {\r\n std::cerr << \"no message\";\r\n }\r\n std::cerr << std::endl;\r\n google::protobuf::ShutdownProtobufLibrary();\r\n return -1;\r\n }\r\n\r\n google::protobuf::ShutdownProtobufLibrary();\r\n return 0;\r\n}\r\n\r\n<commit_msg>Command execution implemented<commit_after>#include <iostream>\r\n#include <vector>\r\n#include <set>\r\n#include <algorithm>\r\n#include <queue>\r\n#include <boost\/thread\/executors\/basic_thread_pool.hpp>\r\n#include <boost\/asio.hpp>\r\n#include <boost\/thread.hpp>\r\n#include <google\/protobuf\/io\/coded_stream.h>\r\n#include \"message.pb.h\"\r\n\r\n\/*******************************************************************\r\n * Configuration****************************************************\r\n********************************************************************\/\r\nstatic std::string const CHAT_SERVER_AUTOR = \"Chat server\";\r\n#ifdef DEBUG\r\nstatic size_t const INITIAL_BUFFER_SIZE = 1 << 2; \/\/ 4 b\r\n#else\r\nstatic size_t const INITIAL_BUFFER_SIZE = 1 << 12; \/\/ 4 Kb\r\n#endif\r\nstatic size_t const MESSAGES_IN_QUEUE_TO_FALLBACK = 1 << 8; \/\/ 256\r\nstatic size_t const MESSAGES_SUM_SIZE_TO_FALLBACK = 1 << 12; \/\/ 4 Kb\r\nstatic size_t const MAX_VARINT_BYTES = 10;\r\n\/*******************************************************************\/\r\n\r\n\r\nusing namespace boost::asio;\r\nusing ru::spbau::chat::commons::protocol::Message;\r\nusing google::protobuf::io::CodedInputStream;\r\nusing google::protobuf::io::CodedOutputStream;\r\nusing google::protobuf::uint8;\r\nusing google::protobuf::uint32;\r\n\r\ntypedef std::pair<size_t, std::shared_ptr<uint8>> serialized_message;\r\n\r\nclass chat_user\r\n{\r\npublic:\r\n virtual void accept_message_size() = 0;\r\n virtual bool deliver_message(serialized_message const &message) = 0;\r\n};\r\ntypedef std::shared_ptr<chat_user> user_ptr;\r\n\r\nserialized_message serialize_message(Message const &message)\r\n{\r\n size_t msg_size = message.ByteSize();\r\n size_t size = msg_size + MAX_VARINT_BYTES;\r\n std::shared_ptr<uint8> buffer(new uint8[size]);\r\n auto it = CodedOutputStream::WriteVarint32ToArray(msg_size, buffer.get());\r\n bool written = message.SerializeToArray(it, msg_size);\r\n assert(written);\r\n return serialized_message(msg_size + (it - buffer.get()), buffer);\r\n}\r\n\r\nclass chat_room\r\n{\r\npublic:\r\n chat_room()\r\n :\r\n command_executor(1)\r\n {\r\n }\r\n\r\n void add_new_user(user_ptr user)\r\n {\r\n rw_mutex.lock();\r\n users.push_back(user);\r\n rw_mutex.unlock();\r\n#ifdef DEBUG\r\n std::cout << \"User connected\" << std::endl;\r\n#endif\r\n user->accept_message_size();\r\n }\r\n\r\n void on_user_leave(user_ptr user)\r\n {\r\n rw_mutex.lock();\r\n auto pos = std::find_if(users.begin(), users.end(), [user](user_ptr &ptr)\r\n {\r\n return ptr.get() == user.get();\r\n });\r\n if (pos != users.end())\r\n {\r\n users.erase(pos);\r\n }\r\n rw_mutex.unlock();\r\n#ifdef DEBUG\r\n std::cout << \"User leaved\" << std::endl;\r\n#endif\r\n }\r\n\r\n size_t deliver_message_to_all(Message const &message, chat_user const *from_user)\r\n {\r\n serialized_message message_serialized(serialize_message(message));\r\n size_t overflow_queues = 0;\r\n rw_mutex.lock_shared();\r\n for(auto &user_p: users)\r\n {\r\n if (user_p.get() == from_user)\r\n {\r\n continue;\r\n }\r\n overflow_queues += user_p->deliver_message(message_serialized);\r\n }\r\n rw_mutex.unlock_shared();\r\n return overflow_queues;\r\n }\r\n\r\n void execute_command(std::string cmd, user_ptr user_to_send_result)\r\n {\r\n command_executor.submit([user_to_send_result, cmd]()\r\n {\r\n Message result;\r\n result.set_type(Message::MESSAGE);\r\n result.set_author(CHAT_SERVER_AUTOR);\r\n\r\n std::shared_ptr<FILE> pipe(popen(cmd.c_str(), \"r\"), pclose);\r\n char buffer[128];\r\n std::string result_str;\r\n if (pipe)\r\n {\r\n while (!feof(pipe.get())) {\r\n if (fgets(buffer, 128, pipe.get()) == NULL)\r\n {\r\n break;\r\n }\r\n result_str += buffer;\r\n if (result_str.back() == '\\n')\r\n {\r\n result_str.pop_back();\r\n result.add_text(std::move(result_str));\r\n result_str.clear();\r\n }\r\n }\r\n if (result_str.size())\r\n {\r\n result.add_text(result_str);\r\n }\r\n } else {\r\n result.add_text(\"Command '\" + cmd + \"'' execution failed!\");\r\n }\r\n\r\n user_to_send_result->deliver_message(serialize_message(result));\r\n });\r\n }\r\n\r\nprivate:\r\n std::vector<user_ptr> users;\r\n boost::shared_mutex rw_mutex;\r\n boost::executors::basic_thread_pool command_executor;\r\n};\r\n\r\nclass user :\r\n public chat_user,\r\n public std::enable_shared_from_this<user>\r\n{\r\npublic:\r\n user(ip::tcp::socket sock, chat_room &chat, io_service &service)\r\n :\r\n socket(std::move(sock)),\r\n chat(chat),\r\n service(service),\r\n message_buffer(std::max(INITIAL_BUFFER_SIZE, MAX_VARINT_BYTES)),\r\n buffer_offset(0),\r\n buffer_red(0),\r\n write_buffer(std::max(INITIAL_BUFFER_SIZE, MAX_VARINT_BYTES)),\r\n messages_sum_size(0),\r\n write_in_progress(false)\r\n {\r\n }\r\n\r\n void accept_message_size()\r\n {\r\n check_enougth_space(MAX_VARINT_BYTES);\r\n\r\n if (buffer_red)\r\n {\r\n bool read_succ;\r\n size_t read_bytes_count;\r\n uint32 message_size;\r\n {\r\n CodedInputStream input(message_buffer.data() + buffer_offset, buffer_red);\r\n read_succ = input.ReadVarint32(&message_size);\r\n read_bytes_count = input.CurrentPosition();\r\n }\r\n if (read_succ)\r\n {\r\n buffer_offset += read_bytes_count;\r\n buffer_red -= read_bytes_count;\r\n accept_message(message_size);\r\n return;\r\n }\r\n if (buffer_red > MAX_VARINT_BYTES)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"invalid varint: \" << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n }\r\n }\r\n\r\n auto ancor(shared_from_this());\r\n async_read(socket, buffer(message_buffer.data() + buffer_offset + buffer_red,\r\n message_buffer.size() - buffer_offset - buffer_red),\r\n transfer_at_least(1),\r\n [this, ancor](boost::system::error_code ec, std::size_t bytes_red)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"Reading message size: bytes red \"\r\n << buffer_red + bytes_red << std::endl;\r\n#endif\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error on reading message_size: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n buffer_red += bytes_red;\r\n accept_message_size();\r\n }\r\n });\r\n }\r\n\r\n void accept_message(uint32 message_size)\r\n {\r\n check_enougth_space(message_size);\r\n\r\n if (buffer_red >= message_size)\r\n {\r\n Message message;\r\n try\r\n {\r\n message.ParseFromArray(message_buffer.data() + buffer_offset,\r\n message_size);\r\n } catch (std::exception &) {\r\n #ifdef DEBUG\r\n std::cout << \"Failed to parse protobuf message\" << std::endl;\r\n #endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n }\r\n buffer_offset += message_size;\r\n buffer_red -= message_size;\r\n\r\n#ifdef DEBUG\r\n std::cout << \"message red [\"\r\n << (message.has_type() ? message.type() : -1) << \", \"\r\n << (message.has_author() ? message.author() : \"no author\") << \", \"\r\n << (message.text_size() ? message.text(0) : \"no text\")\r\n << \"]\" << std::endl;\r\n#endif\r\n if (message.type() == Message::COMMAND)\r\n {\r\n chat.execute_command(message.text(0), shared_from_this());\r\n } else {\r\n size_t busy_factor = chat.deliver_message_to_all(message, this);\r\n for (size_t idx = 0; idx < busy_factor; ++idx)\r\n {\r\n if (!service.poll_one())\r\n {\r\n break;\r\n }\r\n }\r\n }\r\n accept_message_size();\r\n return;\r\n }\r\n\r\n\r\n auto ancor(shared_from_this());\r\n async_read(socket, buffer(message_buffer.data() + buffer_offset + buffer_red,\r\n message_buffer.size() - buffer_offset - buffer_red),\r\n transfer_at_least(message_size - buffer_red),\r\n [this, ancor, message_size](boost::system::error_code ec, std::size_t bytes_red)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"Reading message: bytes red \"\r\n << buffer_red + bytes_red << \" from \"\r\n << message_size << std::endl;\r\n#endif\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n buffer_red += bytes_red;\r\n accept_message(message_size);\r\n }\r\n });\r\n }\r\n\r\n bool deliver_message(serialized_message const &message)\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n messages_to_deliver.push(message);\r\n if (!write_in_progress)\r\n {\r\n write_in_progress = true;\r\n auto ancor(shared_from_this());\r\n service.post([this, ancor](){do_write();});\r\n }\r\n messages_sum_size += message.first;\r\n return messages_to_deliver.size() >= MESSAGES_IN_QUEUE_TO_FALLBACK ||\r\n messages_sum_size >= MESSAGES_SUM_SIZE_TO_FALLBACK;\r\n }\r\n\r\n ~user()\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"user destroyed\" << std::endl;\r\n#endif\r\n }\r\n\r\nprivate:\r\n void check_enougth_space(size_t space_needed)\r\n {\r\n assert(buffer_offset + buffer_red <= message_buffer.size());\r\n if (!buffer_red)\r\n {\r\n buffer_offset = 0;\r\n }\r\n if (buffer_offset + space_needed <= message_buffer.size())\r\n {\r\n return;\r\n }\r\n memmove(message_buffer.data(), message_buffer.data() + buffer_offset, buffer_red);\r\n buffer_offset = 0;\r\n if (space_needed > message_buffer.size())\r\n {\r\n message_buffer.resize(space_needed);\r\n }\r\n }\r\n\r\n void do_write()\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n size_t min_size = messages_to_deliver.front().first;\r\n if (write_buffer.size() < min_size)\r\n {\r\n write_buffer.resize(min_size);\r\n }\r\n size_t write_buffer_offset = 0;\r\n while (!messages_to_deliver.empty())\r\n {\r\n serialized_message const &message = messages_to_deliver.front();\r\n if (message.first > write_buffer.size() - write_buffer_offset)\r\n {\r\n break;\r\n }\r\n#ifdef DEBUG\r\n std::cout << \"message written\" << std::endl;\r\n#endif\r\n memcpy(write_buffer.data() + write_buffer_offset, message.second.get(), message.first);\r\n write_buffer_offset += message.first;\r\n messages_sum_size -= message.first;\r\n messages_to_deliver.pop();\r\n }\r\n\r\n\r\n auto ancor(shared_from_this());\r\n async_write(socket, buffer(write_buffer.data(), write_buffer_offset),\r\n [this, ancor](boost::system::error_code ec, std::size_t)\r\n {\r\n if (ec)\r\n {\r\n#ifdef DEBUG\r\n std::cout << \"error writing: \" << ec.message() << std::endl;\r\n#endif\r\n chat.on_user_leave(shared_from_this());\r\n return;\r\n } else {\r\n {\r\n boost::lock_guard<boost::mutex> guard(deliver_queue_mutex);\r\n if (messages_to_deliver.empty())\r\n {\r\n write_in_progress = false;\r\n return;\r\n }\r\n }\r\n do_write();\r\n }\r\n });\r\n\r\n }\r\n\r\nprivate:\r\n ip::tcp::socket socket;\r\n chat_room &chat;\r\n io_service &service;\r\n std::vector<uint8> message_buffer;\r\n size_t buffer_offset;\r\n size_t buffer_red;\r\n std::vector<uint8> write_buffer;\r\n std::queue<serialized_message> messages_to_deliver;\r\n boost::mutex deliver_queue_mutex;\r\n size_t messages_sum_size;\r\n bool write_in_progress;\r\n};\r\n\r\nclass connection_handler\r\n{\r\npublic:\r\n connection_handler(io_service &service, int port, chat_room &chat)\r\n :\r\n sock(service),\r\n service(service),\r\n acc(service, ip::tcp::endpoint(ip::tcp::v4(), port)),\r\n chat(chat)\r\n {\r\n }\r\n\r\npublic:\r\n void accept_new_connection()\r\n {\r\n acc.async_accept(sock, [this](boost::system::error_code)\r\n {\r\n if (sock.is_open())\r\n {\r\n sock.set_option(ip::tcp::no_delay(true));\r\n chat.add_new_user(std::make_shared<user>(std::move(sock), chat, service));\r\n }\r\n accept_new_connection();\r\n });\r\n }\r\n\r\nprivate:\r\n ip::tcp::socket sock;\r\n io_service &service;\r\n ip::tcp::acceptor acc;\r\n chat_room &chat;\r\n};\r\n\r\nint main(int argc, char *argv[])\r\n{\r\n if (argc < 3) {\r\n std::cout\r\n << \"Usage: .\/chat_server $PORT_NUMBER$ $CONCURRENCY_LEVEL$\"\r\n << std::endl\r\n << \"Where $CONCURRENCY_LEVEL$ - number of the worker threads\"\r\n << std::endl;\r\n return -1;\r\n }\r\n size_t port = std::atoi(argv[1]);\r\n size_t concurrency_level = std::atoi(argv[2]);\r\n\r\n try\r\n {\r\n std::cout << \"Starting chat server on port \"\r\n << port\r\n << \" with concurrency level \"\r\n << concurrency_level\r\n << \" ...\"\r\n << std::endl;\r\n\r\n io_service service(concurrency_level);\r\n chat_room chat;\r\n\r\n connection_handler handler(service, port, chat);\r\n handler.accept_new_connection();\r\n\r\n boost::thread_group workers;\r\n auto const worker =\r\n boost::bind(&io_service::run, &service);\r\n for (size_t idx = 0; idx < concurrency_level; ++idx)\r\n {\r\n workers.create_thread(worker);\r\n }\r\n\r\n std::cout << \"The server is started\" << std::endl;\r\n std::cout << \"Press 'enter' to stop the server\"\r\n << std::endl;\r\n std::cin.get();\r\n std::cout << \"Stopping the server...\" << std::endl;\r\n service.stop();\r\n workers.join_all();\r\n std::cout << \"The server is stopped\" << std::endl;\r\n } catch(std::exception &e) {\r\n std::cerr << \"An exception occured with \";\r\n if (e.what()) {\r\n std::cerr << \"message: \\\"\" << e.what() << '\"';\r\n } else {\r\n std::cerr << \"no message\";\r\n }\r\n std::cerr << std::endl;\r\n google::protobuf::ShutdownProtobufLibrary();\r\n return -1;\r\n }\r\n\r\n google::protobuf::ShutdownProtobufLibrary();\r\n return 0;\r\n}\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n std::vector<int> count;\n count=count_galaxies(G);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/ make MTL\n MTL M=make_MTL(G,F);\n \n assign_priority_class(M);\n \/\/find available SS and SF galaxies on each petal\n \n std::vector <int> count_class(M.priority_list.size(),0);\n \n printf(\"Number in each priority class. The last two are SF and SS.\\n\");\n for(int i;i<M.size();++i){\n count_class[M[i].priority_class]+=1;\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d number %d\\n\",i,count_class[i]);\n }\n \n printf(\" number of MTL galaxies %d\\n\",M.size());\n \n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n\tPlates P = read_plate_centers(F);\n F.Nplate=P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n \n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n \n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n\n simple_assign(M,P,pp,F,A);\n diagnostic(M,G,F,A);\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\n\t\tif(j%1000==0)diagnostic(M,G,F,A);\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==1000 || j==3000) {\n printf ( \"Redistribute and improve at j = %d\\n\",j);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n \/\/diagnostic(M,G,F,A);\n\t\t}\n\n }\n\tprint_time(time,\"# ... took :\");\n \n \n \/\/diagnostic check on SS and SF\n for (int j=0;j<F.Nplate;++j){\n for (int p=0; p<F.Npetal; ++p){\n if(P[j].SS_in_petal[p]!=F.MaxSS){printf(\"SS j= %d p= %d number = P[j].SS_in_petal[p]\\n\");}\n if(P[j].SF_in_petal[p]!=F.MaxSF){printf(\"SF j= %d p= %d number = P[j].SS_in_petal[p]\\n\");}\n }\n }\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n\n\treturn(0);\n \n}\n<commit_msg>check on SF, SS<commit_after>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n std::vector<int> count;\n count=count_galaxies(G);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/ make MTL\n MTL M=make_MTL(G,F);\n \n assign_priority_class(M);\n \/\/find available SS and SF galaxies on each petal\n \n std::vector <int> count_class(M.priority_list.size(),0);\n \n printf(\"Number in each priority class. The last two are SF and SS.\\n\");\n for(int i;i<M.size();++i){\n count_class[M[i].priority_class]+=1;\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d number %d\\n\",i,count_class[i]);\n }\n \n printf(\" number of MTL galaxies %d\\n\",M.size());\n \n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\n\tPlates P = read_plate_centers(F);\n F.Nplate=P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n \n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct target> T(M,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(M,T,P,pp,F);\n \n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(M,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n\tAssignment A(M,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n\n simple_assign(M,P,pp,F,A);\n diagnostic(M,G,F,A);\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t\tredistribute_tf(M,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\n\t\tif(j%1000==0)diagnostic(M,G,F,A);\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,M,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,M,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==1000 || j==3000) {\n printf ( \"Redistribute and improve at j = %d\\n\",j);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n\t\t\timprove(M,P,pp,F,A);\n\t\t\tredistribute_tf(M,P,pp,F,A);\n \/\/diagnostic(M,G,F,A);\n\t\t}\n\n }\n\tprint_time(time,\"# ... took :\");\n \n \n \/\/diagnostic check on SS and SF\n for (int j=0;j<F.Nplate;++j){\n for (int p=0; p<F.Npetal; ++p){\n if(P[j].SS_in_petal[p]!=F.MaxSS){printf(\"SS j= %d p= %d number = %d\\n\");j,p,P[j].SS_in_petal[p]}\n if(P[j].SF_in_petal[p]!=F.MaxSF){printf(\"SF j= %d p= %d number = %d\\n\");j,p,P[j].SF_in_petal[p]}\n }\n }\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,M,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,M,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n\n\treturn(0);\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * Comm.cpp\n *\/\n\n#include \"adiosComm.h\"\n#include \"adiosComm.tcc\"\n\n#include <algorithm>\n#include <ios> \/\/std::ios_base::failure\n#include <iterator>\n#include <utility>\n\n#include \"adios2\/common\/ADIOSMPI.h\"\n#include \"adios2\/helper\/adiosString.h\"\n\nnamespace adios2\n{\nnamespace helper\n{\n\nComm::Comm() = default;\n\nComm::Comm(MPI_Comm mpiComm) : m_MPIComm(mpiComm) {}\n\nComm::~Comm()\n{\n \/\/ Handle the case where MPI is finalized before the ADIOS destructor is\n \/\/ called, which happens, e.g., with global \/ static ADIOS objects\n int flag;\n MPI_Finalized(&flag);\n if (!flag)\n {\n if (m_MPIComm != MPI_COMM_NULL && m_MPIComm != MPI_COMM_WORLD &&\n m_MPIComm != MPI_COMM_SELF)\n {\n SMPI_Comm_free(&m_MPIComm);\n }\n }\n}\n\nComm::Comm(Comm &&comm) : m_MPIComm(comm.m_MPIComm)\n{\n comm.m_MPIComm = MPI_COMM_NULL;\n}\n\nComm &Comm::operator=(Comm &&comm)\n{\n Comm(std::move(comm)).swap(*this);\n return *this;\n}\n\nvoid Comm::swap(Comm &comm) { std::swap(this->m_MPIComm, comm.m_MPIComm); }\n\nComm Comm::Duplicate(MPI_Comm mpiComm)\n{\n MPI_Comm newComm;\n SMPI_Comm_dup(mpiComm, &newComm);\n return Comm(newComm);\n}\n\nvoid Comm::CheckMPIReturn(const int value, const std::string &hint)\n{\n if (value == MPI_SUCCESS)\n {\n return;\n }\n\n std::string error;\n switch (value)\n {\n case MPI_ERR_COMM:\n error = \"MPI_ERR_COMM\";\n break;\n case MPI_ERR_INTERN:\n error = \"MPI_ERR_INTERN\";\n break;\n default:\n error = \"MPI_ERR number: \" + std::to_string(value);\n }\n\n throw std::runtime_error(\"ERROR: ADIOS2 detected \" + error + \", \" + hint);\n}\n\nvoid Comm::Free(const std::string &hint)\n{\n if (m_MPIComm != MPI_COMM_NULL && m_MPIComm != MPI_COMM_WORLD &&\n m_MPIComm != MPI_COMM_SELF)\n {\n CheckMPIReturn(SMPI_Comm_free(&m_MPIComm), hint);\n }\n}\n\nComm Comm::Split(int color, int key, const std::string &hint) const\n{\n MPI_Comm newComm;\n CheckMPIReturn(MPI_Comm_split(m_MPIComm, color, key, &newComm), hint);\n return Comm(newComm);\n}\n\nint Comm::Rank() const\n{\n int rank;\n CheckMPIReturn(SMPI_Comm_rank(m_MPIComm, &rank), {});\n return rank;\n}\n\nint Comm::Size() const\n{\n int size;\n CheckMPIReturn(SMPI_Comm_size(m_MPIComm, &size), {});\n return size;\n}\n\nvoid Comm::Barrier(const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Barrier(m_MPIComm), hint);\n}\n\nstd::string Comm::BroadcastFile(const std::string &fileName,\n const std::string hint,\n const int rankSource) const\n{\n int rank;\n MPI_Comm_rank(m_MPIComm, &rank);\n std::string fileContents;\n\n \/\/ Read the file on rank 0 and broadcast it to everybody else\n if (rank == rankSource)\n {\n \/\/ load file contents\n fileContents = FileToString(fileName, hint);\n }\n fileContents = this->BroadcastValue(fileContents, rankSource);\n\n return fileContents;\n}\n\nvoid Comm::AllgatherImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, const std::string &hint) const\n{\n CheckMPIReturn(\n SMPI_Allgather(sendbuf, static_cast<int>(sendcount), sendtype, recvbuf,\n static_cast<int>(recvcount), recvtype, m_MPIComm),\n hint);\n}\n\nvoid Comm::AllreduceImpl(const void *sendbuf, void *recvbuf, size_t count,\n MPI_Datatype datatype, MPI_Op op,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Allreduce(sendbuf, recvbuf, static_cast<int>(count),\n datatype, op, m_MPIComm),\n hint);\n}\n\nvoid Comm::BcastImpl(void *buffer, size_t count, MPI_Datatype datatype,\n size_t datatypeSize, int root,\n const std::string &hint) const\n{\n size_t inputSize = count;\n const int MAXBCASTSIZE = 1073741824;\n size_t blockSize = (inputSize > MAXBCASTSIZE ? MAXBCASTSIZE : inputSize);\n unsigned char *blockBuf = static_cast<unsigned char *>(buffer);\n while (inputSize > 0)\n {\n CheckMPIReturn(SMPI_Bcast(blockBuf, static_cast<int>(blockSize),\n datatype, root, m_MPIComm),\n hint);\n blockBuf += blockSize * datatypeSize;\n inputSize -= blockSize;\n blockSize = (inputSize > MAXBCASTSIZE ? MAXBCASTSIZE : inputSize);\n }\n}\n\nvoid Comm::GatherImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Gather(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, static_cast<int>(recvcount), recvtype,\n root, m_MPIComm),\n hint);\n}\n\nvoid Comm::GathervImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf,\n const size_t *recvcounts, const size_t *displs,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n std::vector<int> countsInt;\n std::vector<int> displsInt;\n if (root == this->Rank())\n {\n auto cast = [](size_t sz) -> int { return int(sz); };\n const int size = this->Size();\n countsInt.reserve(size);\n std::transform(recvcounts, recvcounts + size,\n std::back_inserter(countsInt), cast);\n displsInt.reserve(size);\n std::transform(displs, displs + size, std::back_inserter(displsInt),\n cast);\n }\n CheckMPIReturn(SMPI_Gatherv(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, countsInt.data(), displsInt.data(),\n recvtype, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::ReduceImpl(const void *sendbuf, void *recvbuf, size_t count,\n MPI_Datatype datatype, MPI_Op op, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Reduce(sendbuf, recvbuf, static_cast<int>(count),\n datatype, op, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::ReduceInPlaceImpl(void *buf, size_t count, MPI_Datatype datatype,\n MPI_Op op, int root, const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Reduce(MPI_IN_PLACE, buf, static_cast<int>(count),\n datatype, op, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::SendImpl(const void *buf, size_t count, MPI_Datatype datatype,\n int dest, int tag, const std::string &hint) const\n{\n CheckMPIReturn(\n MPI_Send(buf, static_cast<int>(count), datatype, dest, tag, m_MPIComm),\n hint);\n}\n\nComm::Status Comm::RecvImpl(void *buf, size_t count, MPI_Datatype datatype,\n int source, int tag, const std::string &hint) const\n{\n MPI_Status mpiStatus;\n CheckMPIReturn(MPI_Recv(buf, static_cast<int>(count), datatype, source, tag,\n m_MPIComm, &mpiStatus),\n hint);\n\n Status status;\n#ifdef ADIOS2_HAVE_MPI\n status.Source = mpiStatus.MPI_SOURCE;\n status.Tag = mpiStatus.MPI_TAG;\n {\n int mpiCount = 0;\n CheckMPIReturn(MPI_Get_count(&mpiStatus, datatype, &mpiCount), hint);\n status.Count = mpiCount;\n }\n#endif\n return status;\n}\n\nvoid Comm::ScatterImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(MPI_Scatter(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, static_cast<int>(recvcount), recvtype,\n root, m_MPIComm),\n hint);\n}\n\nComm::Req Comm::IsendImpl(const void *buffer, size_t count,\n MPI_Datatype datatype, int dest, int tag,\n const std::string &hint) const\n{\n Comm::Req req(datatype);\n\n if (count > DefaultMaxFileBatchSize)\n {\n const size_t batches = count \/ DefaultMaxFileBatchSize;\n\n size_t position = 0;\n for (size_t b = 0; b < batches; ++b)\n {\n int batchSize = static_cast<int>(DefaultMaxFileBatchSize);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)) +\n position,\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \"in call to Isend batch \" + std::to_string(b) + \" \" + hint +\n \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n\n position += DefaultMaxFileBatchSize;\n }\n const size_t remainder = count % DefaultMaxFileBatchSize;\n if (remainder > 0)\n {\n int batchSize = static_cast<int>(remainder);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)) +\n position,\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \"in call to Isend remainder batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n }\n else\n {\n int batchSize = static_cast<int>(count);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)),\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \" in call to Isend with single batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n return req;\n}\n\nComm::Req Comm::IrecvImpl(void *buffer, size_t count, MPI_Datatype datatype,\n int source, int tag, const std::string &hint) const\n{\n Comm::Req req(datatype);\n\n if (count > DefaultMaxFileBatchSize)\n {\n const size_t batches = count \/ DefaultMaxFileBatchSize;\n size_t position = 0;\n for (size_t b = 0; b < batches; ++b)\n {\n int batchSize = static_cast<int>(DefaultMaxFileBatchSize);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(static_cast<char *>(buffer) + position,\n batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \"in call to Irecv batch \" + std::to_string(b) + \" \" +\n hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n\n position += DefaultMaxFileBatchSize;\n }\n\n const size_t remainder = count % DefaultMaxFileBatchSize;\n if (remainder > 0)\n {\n int batchSize = static_cast<int>(remainder);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(static_cast<char *>(buffer) + position,\n batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \"in call to Irecv remainder batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n }\n else\n {\n int batchSize = static_cast<int>(count);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(buffer, batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \" in call to Isend with single batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n\n return req;\n}\n\nComm::Req::Req() = default;\n\nComm::Req::Req(MPI_Datatype datatype) : m_MPIDatatype(datatype) {}\n\nComm::Req::~Req() {}\n\nComm::Req::Req(Req &&req)\n: m_MPIDatatype(req.m_MPIDatatype), m_MPIReqs(std::move(req.m_MPIReqs))\n{\n}\n\nComm::Req &Comm::Req::operator=(Req &&req)\n{\n Req(std::move(req)).swap(*this);\n return *this;\n}\n\nvoid Comm::Req::swap(Req &req)\n{\n std::swap(this->m_MPIDatatype, req.m_MPIDatatype);\n std::swap(this->m_MPIReqs, req.m_MPIReqs);\n}\n\nComm::Status Comm::Req::Wait(const std::string &hint)\n{\n Comm::Status status;\n if (m_MPIReqs.empty())\n {\n return status;\n }\n\n#ifdef ADIOS2_HAVE_MPI\n std::vector<MPI_Request> mpiRequests = std::move(m_MPIReqs);\n std::vector<MPI_Status> mpiStatuses(mpiRequests.size());\n\n if (mpiRequests.size() > 1)\n {\n int mpiReturn = MPI_Waitall(static_cast<int>(mpiRequests.size()),\n mpiRequests.data(), mpiStatuses.data());\n if (mpiReturn == MPI_ERR_IN_STATUS)\n {\n for (auto &mpiStatus : mpiStatuses)\n {\n if (mpiStatus.MPI_ERROR != MPI_SUCCESS)\n {\n mpiReturn = mpiStatus.MPI_ERROR;\n break;\n }\n }\n }\n CheckMPIReturn(mpiReturn, hint);\n }\n else\n {\n CheckMPIReturn(MPI_Wait(mpiRequests.data(), mpiStatuses.data()), hint);\n }\n\n \/\/ Our batched operation should be from only one source and have one tag.\n status.Source = mpiStatuses.front().MPI_SOURCE;\n status.Tag = mpiStatuses.front().MPI_TAG;\n\n \/\/ Accumulate the total count of our batched operation.\n for (auto &mpiStatus : mpiStatuses)\n {\n int mpiCount = 0;\n CheckMPIReturn(MPI_Get_count(&mpiStatus, m_MPIDatatype, &mpiCount),\n hint);\n status.Count += mpiCount;\n }\n\n \/\/ Our batched operation was cancelled if any member was cancelled.\n for (auto &mpiStatus : mpiStatuses)\n {\n int mpiCancelled = 0;\n MPI_Test_cancelled(&mpiStatus, &mpiCancelled);\n if (mpiCancelled)\n {\n status.Cancelled = true;\n break;\n }\n }\n#endif\n\n return status;\n}\n\n} \/\/ end namespace helper\n} \/\/ end namespace adios2\n<commit_msg>helper: Implement Comm::BroadcastFile in terms of our encapsulation<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * Comm.cpp\n *\/\n\n#include \"adiosComm.h\"\n#include \"adiosComm.tcc\"\n\n#include <algorithm>\n#include <ios> \/\/std::ios_base::failure\n#include <iterator>\n#include <utility>\n\n#include \"adios2\/common\/ADIOSMPI.h\"\n#include \"adios2\/helper\/adiosString.h\"\n\nnamespace adios2\n{\nnamespace helper\n{\n\nComm::Comm() = default;\n\nComm::Comm(MPI_Comm mpiComm) : m_MPIComm(mpiComm) {}\n\nComm::~Comm()\n{\n \/\/ Handle the case where MPI is finalized before the ADIOS destructor is\n \/\/ called, which happens, e.g., with global \/ static ADIOS objects\n int flag;\n MPI_Finalized(&flag);\n if (!flag)\n {\n if (m_MPIComm != MPI_COMM_NULL && m_MPIComm != MPI_COMM_WORLD &&\n m_MPIComm != MPI_COMM_SELF)\n {\n SMPI_Comm_free(&m_MPIComm);\n }\n }\n}\n\nComm::Comm(Comm &&comm) : m_MPIComm(comm.m_MPIComm)\n{\n comm.m_MPIComm = MPI_COMM_NULL;\n}\n\nComm &Comm::operator=(Comm &&comm)\n{\n Comm(std::move(comm)).swap(*this);\n return *this;\n}\n\nvoid Comm::swap(Comm &comm) { std::swap(this->m_MPIComm, comm.m_MPIComm); }\n\nComm Comm::Duplicate(MPI_Comm mpiComm)\n{\n MPI_Comm newComm;\n SMPI_Comm_dup(mpiComm, &newComm);\n return Comm(newComm);\n}\n\nvoid Comm::CheckMPIReturn(const int value, const std::string &hint)\n{\n if (value == MPI_SUCCESS)\n {\n return;\n }\n\n std::string error;\n switch (value)\n {\n case MPI_ERR_COMM:\n error = \"MPI_ERR_COMM\";\n break;\n case MPI_ERR_INTERN:\n error = \"MPI_ERR_INTERN\";\n break;\n default:\n error = \"MPI_ERR number: \" + std::to_string(value);\n }\n\n throw std::runtime_error(\"ERROR: ADIOS2 detected \" + error + \", \" + hint);\n}\n\nvoid Comm::Free(const std::string &hint)\n{\n if (m_MPIComm != MPI_COMM_NULL && m_MPIComm != MPI_COMM_WORLD &&\n m_MPIComm != MPI_COMM_SELF)\n {\n CheckMPIReturn(SMPI_Comm_free(&m_MPIComm), hint);\n }\n}\n\nComm Comm::Split(int color, int key, const std::string &hint) const\n{\n MPI_Comm newComm;\n CheckMPIReturn(MPI_Comm_split(m_MPIComm, color, key, &newComm), hint);\n return Comm(newComm);\n}\n\nint Comm::Rank() const\n{\n int rank;\n CheckMPIReturn(SMPI_Comm_rank(m_MPIComm, &rank), {});\n return rank;\n}\n\nint Comm::Size() const\n{\n int size;\n CheckMPIReturn(SMPI_Comm_size(m_MPIComm, &size), {});\n return size;\n}\n\nvoid Comm::Barrier(const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Barrier(m_MPIComm), hint);\n}\n\nstd::string Comm::BroadcastFile(const std::string &fileName,\n const std::string hint,\n const int rankSource) const\n{\n int rank = this->Rank();\n std::string fileContents;\n\n \/\/ Read the file on rank 0 and broadcast it to everybody else\n if (rank == rankSource)\n {\n \/\/ load file contents\n fileContents = FileToString(fileName, hint);\n }\n fileContents = this->BroadcastValue(fileContents, rankSource);\n\n return fileContents;\n}\n\nvoid Comm::AllgatherImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, const std::string &hint) const\n{\n CheckMPIReturn(\n SMPI_Allgather(sendbuf, static_cast<int>(sendcount), sendtype, recvbuf,\n static_cast<int>(recvcount), recvtype, m_MPIComm),\n hint);\n}\n\nvoid Comm::AllreduceImpl(const void *sendbuf, void *recvbuf, size_t count,\n MPI_Datatype datatype, MPI_Op op,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Allreduce(sendbuf, recvbuf, static_cast<int>(count),\n datatype, op, m_MPIComm),\n hint);\n}\n\nvoid Comm::BcastImpl(void *buffer, size_t count, MPI_Datatype datatype,\n size_t datatypeSize, int root,\n const std::string &hint) const\n{\n size_t inputSize = count;\n const int MAXBCASTSIZE = 1073741824;\n size_t blockSize = (inputSize > MAXBCASTSIZE ? MAXBCASTSIZE : inputSize);\n unsigned char *blockBuf = static_cast<unsigned char *>(buffer);\n while (inputSize > 0)\n {\n CheckMPIReturn(SMPI_Bcast(blockBuf, static_cast<int>(blockSize),\n datatype, root, m_MPIComm),\n hint);\n blockBuf += blockSize * datatypeSize;\n inputSize -= blockSize;\n blockSize = (inputSize > MAXBCASTSIZE ? MAXBCASTSIZE : inputSize);\n }\n}\n\nvoid Comm::GatherImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Gather(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, static_cast<int>(recvcount), recvtype,\n root, m_MPIComm),\n hint);\n}\n\nvoid Comm::GathervImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf,\n const size_t *recvcounts, const size_t *displs,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n std::vector<int> countsInt;\n std::vector<int> displsInt;\n if (root == this->Rank())\n {\n auto cast = [](size_t sz) -> int { return int(sz); };\n const int size = this->Size();\n countsInt.reserve(size);\n std::transform(recvcounts, recvcounts + size,\n std::back_inserter(countsInt), cast);\n displsInt.reserve(size);\n std::transform(displs, displs + size, std::back_inserter(displsInt),\n cast);\n }\n CheckMPIReturn(SMPI_Gatherv(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, countsInt.data(), displsInt.data(),\n recvtype, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::ReduceImpl(const void *sendbuf, void *recvbuf, size_t count,\n MPI_Datatype datatype, MPI_Op op, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Reduce(sendbuf, recvbuf, static_cast<int>(count),\n datatype, op, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::ReduceInPlaceImpl(void *buf, size_t count, MPI_Datatype datatype,\n MPI_Op op, int root, const std::string &hint) const\n{\n CheckMPIReturn(SMPI_Reduce(MPI_IN_PLACE, buf, static_cast<int>(count),\n datatype, op, root, m_MPIComm),\n hint);\n}\n\nvoid Comm::SendImpl(const void *buf, size_t count, MPI_Datatype datatype,\n int dest, int tag, const std::string &hint) const\n{\n CheckMPIReturn(\n MPI_Send(buf, static_cast<int>(count), datatype, dest, tag, m_MPIComm),\n hint);\n}\n\nComm::Status Comm::RecvImpl(void *buf, size_t count, MPI_Datatype datatype,\n int source, int tag, const std::string &hint) const\n{\n MPI_Status mpiStatus;\n CheckMPIReturn(MPI_Recv(buf, static_cast<int>(count), datatype, source, tag,\n m_MPIComm, &mpiStatus),\n hint);\n\n Status status;\n#ifdef ADIOS2_HAVE_MPI\n status.Source = mpiStatus.MPI_SOURCE;\n status.Tag = mpiStatus.MPI_TAG;\n {\n int mpiCount = 0;\n CheckMPIReturn(MPI_Get_count(&mpiStatus, datatype, &mpiCount), hint);\n status.Count = mpiCount;\n }\n#endif\n return status;\n}\n\nvoid Comm::ScatterImpl(const void *sendbuf, size_t sendcount,\n MPI_Datatype sendtype, void *recvbuf, size_t recvcount,\n MPI_Datatype recvtype, int root,\n const std::string &hint) const\n{\n CheckMPIReturn(MPI_Scatter(sendbuf, static_cast<int>(sendcount), sendtype,\n recvbuf, static_cast<int>(recvcount), recvtype,\n root, m_MPIComm),\n hint);\n}\n\nComm::Req Comm::IsendImpl(const void *buffer, size_t count,\n MPI_Datatype datatype, int dest, int tag,\n const std::string &hint) const\n{\n Comm::Req req(datatype);\n\n if (count > DefaultMaxFileBatchSize)\n {\n const size_t batches = count \/ DefaultMaxFileBatchSize;\n\n size_t position = 0;\n for (size_t b = 0; b < batches; ++b)\n {\n int batchSize = static_cast<int>(DefaultMaxFileBatchSize);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)) +\n position,\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \"in call to Isend batch \" + std::to_string(b) + \" \" + hint +\n \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n\n position += DefaultMaxFileBatchSize;\n }\n const size_t remainder = count % DefaultMaxFileBatchSize;\n if (remainder > 0)\n {\n int batchSize = static_cast<int>(remainder);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)) +\n position,\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \"in call to Isend remainder batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n }\n else\n {\n int batchSize = static_cast<int>(count);\n MPI_Request mpiReq;\n CheckMPIReturn(\n MPI_Isend(static_cast<char *>(const_cast<void *>(buffer)),\n batchSize, datatype, dest, tag, m_MPIComm, &mpiReq),\n \" in call to Isend with single batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n return req;\n}\n\nComm::Req Comm::IrecvImpl(void *buffer, size_t count, MPI_Datatype datatype,\n int source, int tag, const std::string &hint) const\n{\n Comm::Req req(datatype);\n\n if (count > DefaultMaxFileBatchSize)\n {\n const size_t batches = count \/ DefaultMaxFileBatchSize;\n size_t position = 0;\n for (size_t b = 0; b < batches; ++b)\n {\n int batchSize = static_cast<int>(DefaultMaxFileBatchSize);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(static_cast<char *>(buffer) + position,\n batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \"in call to Irecv batch \" + std::to_string(b) + \" \" +\n hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n\n position += DefaultMaxFileBatchSize;\n }\n\n const size_t remainder = count % DefaultMaxFileBatchSize;\n if (remainder > 0)\n {\n int batchSize = static_cast<int>(remainder);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(static_cast<char *>(buffer) + position,\n batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \"in call to Irecv remainder batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n }\n else\n {\n int batchSize = static_cast<int>(count);\n MPI_Request mpiReq;\n CheckMPIReturn(MPI_Irecv(buffer, batchSize, datatype, source, tag,\n m_MPIComm, &mpiReq),\n \" in call to Isend with single batch \" + hint + \"\\n\");\n req.m_MPIReqs.emplace_back(mpiReq);\n }\n\n return req;\n}\n\nComm::Req::Req() = default;\n\nComm::Req::Req(MPI_Datatype datatype) : m_MPIDatatype(datatype) {}\n\nComm::Req::~Req() {}\n\nComm::Req::Req(Req &&req)\n: m_MPIDatatype(req.m_MPIDatatype), m_MPIReqs(std::move(req.m_MPIReqs))\n{\n}\n\nComm::Req &Comm::Req::operator=(Req &&req)\n{\n Req(std::move(req)).swap(*this);\n return *this;\n}\n\nvoid Comm::Req::swap(Req &req)\n{\n std::swap(this->m_MPIDatatype, req.m_MPIDatatype);\n std::swap(this->m_MPIReqs, req.m_MPIReqs);\n}\n\nComm::Status Comm::Req::Wait(const std::string &hint)\n{\n Comm::Status status;\n if (m_MPIReqs.empty())\n {\n return status;\n }\n\n#ifdef ADIOS2_HAVE_MPI\n std::vector<MPI_Request> mpiRequests = std::move(m_MPIReqs);\n std::vector<MPI_Status> mpiStatuses(mpiRequests.size());\n\n if (mpiRequests.size() > 1)\n {\n int mpiReturn = MPI_Waitall(static_cast<int>(mpiRequests.size()),\n mpiRequests.data(), mpiStatuses.data());\n if (mpiReturn == MPI_ERR_IN_STATUS)\n {\n for (auto &mpiStatus : mpiStatuses)\n {\n if (mpiStatus.MPI_ERROR != MPI_SUCCESS)\n {\n mpiReturn = mpiStatus.MPI_ERROR;\n break;\n }\n }\n }\n CheckMPIReturn(mpiReturn, hint);\n }\n else\n {\n CheckMPIReturn(MPI_Wait(mpiRequests.data(), mpiStatuses.data()), hint);\n }\n\n \/\/ Our batched operation should be from only one source and have one tag.\n status.Source = mpiStatuses.front().MPI_SOURCE;\n status.Tag = mpiStatuses.front().MPI_TAG;\n\n \/\/ Accumulate the total count of our batched operation.\n for (auto &mpiStatus : mpiStatuses)\n {\n int mpiCount = 0;\n CheckMPIReturn(MPI_Get_count(&mpiStatus, m_MPIDatatype, &mpiCount),\n hint);\n status.Count += mpiCount;\n }\n\n \/\/ Our batched operation was cancelled if any member was cancelled.\n for (auto &mpiStatus : mpiStatuses)\n {\n int mpiCancelled = 0;\n MPI_Test_cancelled(&mpiStatus, &mpiCancelled);\n if (mpiCancelled)\n {\n status.Cancelled = true;\n break;\n }\n }\n#endif\n\n return status;\n}\n\n} \/\/ end namespace helper\n} \/\/ end namespace adios2\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include <boost\/thread.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <include\/ImageUtils.h>\n\n#include \"utils.h\"\n\nclass ResizeCallback: public ghog::lib::ImageCallback\n{\npublic:\n\tResizeCallback(int num_images)\n\t{\n\t\t_finished = 0;\n\t\t_total_images = num_images;\n\t}\n\tvoid image_processed(cv::Mat ret_mat)\n\t{\n\t\t_finished++;\n\t}\n\n\tbool is_finished()\n\t{\n\t\treturn (_finished == _total_images);\n\t}\n\nprivate:\n\tint _finished;\n\tint _total_images;\n};\n\nint main(int argc,\n\tchar** argv)\n{\n\tstd::vector< std::string > file_list = getImagesList(\"resources\/inputs\");\n\tcleanOutputDir(\"resources\/resized\");\n\tResizeCallback callback(file_list.size());\n\tghog::lib::ImageUtils utils(&callback);\n\tcv::Size new_size(24, 24);\n\n\tfor(int i = 0; i < file_list.size(); ++i)\n\t{\n\t\tcv::Mat input_img = cv::imread(file_list[i], CV_LOAD_IMAGE_GRAYSCALE);\n\t\tutils.resize(input_img, new_size);\n\t}\n\tstd::cout << \"Processing \" << file_list.size() << \" images...\" << std::endl;\n\twhile(!callback.is_finished())\n\t{\n\t\tstd::cout << \".\";\n\t\tstd::cout.flush();\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\tstd::cout << std::endl;\n\tstd::cout << \"Images processed.\" << std::endl;\n\treturn 0;\n}\n\n<commit_msg>Remove useless (at the moment) directory cleanup.<commit_after>#include <iostream>\n\n#include <boost\/thread.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <include\/ImageUtils.h>\n\n#include \"utils.h\"\n\nclass ResizeCallback: public ghog::lib::ImageCallback\n{\npublic:\n\tResizeCallback(int num_images)\n\t{\n\t\t_finished = 0;\n\t\t_total_images = num_images;\n\t}\n\tvoid image_processed(cv::Mat ret_mat)\n\t{\n\t\t_finished++;\n\t}\n\n\tbool is_finished()\n\t{\n\t\treturn (_finished == _total_images);\n\t}\n\nprivate:\n\tint _finished;\n\tint _total_images;\n};\n\nint main(int argc,\n\tchar** argv)\n{\n\tstd::vector< std::string > file_list = getImagesList(\"resources\/inputs\");\n\tResizeCallback callback(file_list.size());\n\tghog::lib::ImageUtils utils(&callback);\n\tcv::Size new_size(24, 24);\n\n\tfor(int i = 0; i < file_list.size(); ++i)\n\t{\n\t\tcv::Mat input_img = cv::imread(file_list[i], CV_LOAD_IMAGE_GRAYSCALE);\n\t\tutils.resize(input_img, new_size);\n\t}\n\tstd::cout << \"Processing \" << file_list.size() << \" images...\" << std::endl;\n\twhile(!callback.is_finished())\n\t{\n\t\tstd::cout << \".\";\n\t\tstd::cout.flush();\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\tstd::cout << std::endl;\n\tstd::cout << \"Images processed.\" << std::endl;\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n\n\t\/\/ Read fiber center positions and compute related things\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1; \/\/ spectrometer has to be identified from 0 to F.Npetal-1\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\/\/get neighbors of each fiber;\n \/\/for each spectrometer, get list of fibers\n\n\t\/\/ Read plates in order they are to be observed\n \n\tPlates P = read_plate_centers(F);\n\tF.Nplate = P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct galaxy> T(G,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(G,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(G,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\"before assignment\\n\");\n\tAssignment A(G,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n simple_assign(G,P,pp,F,A);\n diagnostic(G,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,G,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,G,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\timprove(G,P,pp,F,A);\n redistribute_tf(G,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\tinit_time_at(time,\"# Begin FITS writing\",t);\n\t\/\/ Results -------------------------------------------------------\n if (F.Output) for (int j=0; j<F.Nplate; j++){\n fa_write(j,F.outDir,G,P,pp,F,A); \/\/ Write output\n }\n\tdisplay_results(\"doc\/figs\/\",G,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,G,pp,F); \/\/ Verification that the assignment is sane\n\tprint_time(time,\"# ... took :\");\n\n\tprint_time(t,\"# Finished !... in\");\n \n\treturn(0);\n}\n<commit_msg>diagnostic<commit_after>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n\n\t\/\/ Read fiber center positions and compute related things\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1; \/\/ spectrometer has to be identified from 0 to F.Npetal-1\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\/\/get neighbors of each fiber;\n \/\/for each spectrometer, get list of fibers\n\n\t\/\/ Read plates in order they are to be observed\n \n\tPlates P = read_plate_centers(F);\n\tF.Nplate = P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct galaxy> T(G,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(G,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(G,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\"before assignment\\n\");\n\tAssignment A(G,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n simple_assign(G,P,pp,F,A);\n \/\/diagnostic 11\/7\/15\n int count_total=0;\n for(int j=0;j<F.Nplate;++j){\n \n int count_assigned=0;\n for (int k=0;k<F.Nfiber;++k){\n if(A.TF[j][k]!=-1)count_assigned++;\n }\n printf(\" %d %d \\n\",j, count_assigned);\n\tcount_total+=count_assigned;\n }\n printf(\" total = %d \\n\",count_total);\n\n diagnostic(G,F,A);\n \n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,G,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,G,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\timprove(G,P,pp,F,A);\n redistribute_tf(G,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\tinit_time_at(time,\"# Begin FITS writing\",t);\n\t\/\/ Results -------------------------------------------------------\n if (F.Output) for (int j=0; j<F.Nplate; j++){\n fa_write(j,F.outDir,G,P,pp,F,A); \/\/ Write output\n }\n\tdisplay_results(\"doc\/figs\/\",G,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,G,pp,F); \/\/ Verification that the assignment is sane\n\tprint_time(time,\"# ... took :\");\n\n\tprint_time(t,\"# Finished !... in\");\n \n\treturn(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*!\n \\file phase_metrics.cpp\n \\brief Benchmark phase metrics implementation\n \\author Ivan Shynkarenka\n \\date 03.07.2015\n \\copyright MIT License\n*\/\n\n#include \"benchmark\/phase_metrics.h\"\n\n#include \"benchmark\/system.h\"\n\nnamespace CppBenchmark {\n\nint64_t PhaseMetrics::avg_time() const noexcept\n{\n return (_total_iterations > 0) ? (_total_time \/ _total_iterations) : 0;\n}\n\nint64_t PhaseMetrics::min_time() const noexcept\n{\n return (_total_iterations > 0) ? (_min_time \/ _total_iterations) : _min_time;\n}\n\nint64_t PhaseMetrics::max_time() const noexcept\n{\n return (_total_iterations > 0) ? (_max_time \/ _total_iterations) : _max_time;\n}\n\nint64_t PhaseMetrics::iterations_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_iterations, 1000000000, _total_time);\n}\n\nint64_t PhaseMetrics::items_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_items, 1000000000, _total_time);\n}\n\nint64_t PhaseMetrics::bytes_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_bytes, 1000000000, _total_time);\n}\n\nvoid PhaseMetrics::StartCollecting() noexcept\n{\n _iterstamp = _total_iterations;\n _timestamp = System::Timestamp();\n}\n\nvoid PhaseMetrics::StopCollecting() noexcept\n{\n \/\/ Get iterations count & duration\n int64_t total_duration = System::Timestamp() - _timestamp;\n\n \/\/ Update time counters\n if (total_duration < _min_time)\n _min_time = total_duration;\n if (total_duration > _max_time)\n _max_time = total_duration;\n _total_time += total_duration;\n}\n\nvoid PhaseMetrics::MergeMetrics(const PhaseMetrics& metrics)\n{\n \/\/ Choose best min time\n if (metrics._min_time < _min_time)\n _min_time = metrics._min_time;\n\n \/\/ Choose best max time\n if (metrics._max_time > _max_time)\n _max_time = metrics._max_time;\n\n \/\/ Merge custom hash tables\n _custom_int.insert(metrics._custom_int.begin(), metrics._custom_int.end());\n _custom_uint.insert(metrics._custom_uint.begin(), metrics._custom_uint.end());\n _custom_int64.insert(metrics._custom_int64.begin(), metrics._custom_int64.end());\n _custom_uint64.insert(metrics._custom_uint64.begin(), metrics._custom_uint64.end());\n _custom_flt.insert(metrics._custom_flt.begin(), metrics._custom_flt.end());\n _custom_dbl.insert(metrics._custom_dbl.begin(), metrics._custom_dbl.end());\n _custom_str.insert(metrics._custom_str.begin(), metrics._custom_str.end());\n\n \/\/ Choose best total time with iterations, items and bytes\n if (metrics._total_time < _total_time)\n {\n _total_time = metrics._total_time;\n _total_iterations = metrics._total_iterations;\n _total_items = metrics._total_items;\n _total_bytes = metrics._total_bytes;\n \/\/ Overwrite metrics custom tables\n for (auto& it : metrics._custom_int)\n _custom_int[it.first] = it.second;\n for (auto& it : metrics._custom_uint)\n _custom_uint[it.first] = it.second;\n for (auto& it : metrics._custom_int64)\n _custom_int64[it.first] = it.second;\n for (auto& it : metrics._custom_uint64)\n _custom_uint64[it.first] = it.second;\n for (auto& it : metrics._custom_flt)\n _custom_flt[it.first] = it.second;\n for (auto& it : metrics._custom_dbl)\n _custom_dbl[it.first] = it.second;\n for (auto& it : metrics._custom_str)\n _custom_str[it.first] = it.second;\n }\n}\n\nuint64_t PhaseMetrics::MulDiv64(uint64_t operant, uint64_t multiplier, uint64_t divider)\n{\n#if defined(_MSC_VER)\n#if defined(_M_IX86)\n \/\/ Declare 128bit storage\n struct\n {\n unsigned long DW[4];\n } var128, quotient;\n\n \/\/ Change semantics for intermediate results for Full Div\n \/\/ by renaming the vars\n #define REMAINDER quotient\n #define QUOTIENT edi\n\n \/\/ Save combined sign on stack\n _asm\n {\n mov eax, dword ptr[operant+4]\n xor eax, dword ptr[multiplier+4]\n xor eax, dword ptr[divider+4]\n pushfd\n }\n\n _asm\n {\n \/\/ First check divider for 0\n mov eax, dword ptr[divider+4]\n or eax, dword ptr[divider]\n jnz dividerOK\n div eax\ndividerOK:\n lea edi,[var128] \/\/ edi = &var128\n \/\/ Check multiplier for 1 or 0\n xor eax, eax\n cmp eax, dword ptr[multiplier+4]\n jnz startMUL\n cmp eax, dword ptr[multiplier]\n jnz multiNotNUL\n xor edx, edx\n popfd \/\/ cleanup stack\n jmp done\nmultiNotNUL:\n \/\/ Set result HI part to 0\n xor eax,eax\n mov dword ptr[edi+12], eax\n mov dword ptr[edi+8], eax\n mov eax, 1\n cmp eax, dword ptr[multiplier]\n jnz smallMUL\n \/\/ Multiplier is 1 so just copy operant to result\n mov eax, dword ptr[operant+4]\n mov dword ptr[edi+4], eax\n mov eax, dword ptr[operant]\n mov dword ptr[edi], eax\n jmp startDIV\nsmallMUL:\n \/\/ Test for 32\/32 bit multiplication\n xor eax, eax\n mov ecx, dword ptr[operant+4]\n or ecx, eax ;test for both hiwords zero.\n jnz startMUL\n \/\/ Do 32\/32 bit multiplication\n mov ecx, dword ptr[multiplier]\n mov eax, dword ptr[operant]\n mul ecx\n mov dword ptr[edi+4], edx\n mov dword ptr[edi], eax\n jmp startDIV\nstartMUL:\n \/\/ Check signs\n \/\/ Multiply: var128 = operant * multiplier\n mov eax, dword ptr[multiplier] \/\/ eax = LO(multiplier)\n mul dword ptr[operant] \/\/ edx:eax = eax * LO(operant)\n mov dword ptr[edi], eax \/\/ var128.DW0 = eax\n mov ecx, edx \/\/ ecx = edx\n\n mov eax, dword ptr[multiplier] \/\/ eax = LO(multiplier)\n mul dword ptr[operant+4] \/\/ edx:eax = eax * HI(operant)\n add eax, ecx \/\/ eax = eax + ecx\n adc edx, 0 \/\/ edx = edx + 0 + carry\n mov ebx, eax\n mov ecx, edx\n\n mov eax, dword ptr[multiplier+4]\n mul dword ptr[operant]\n add eax, ebx\n mov dword ptr[edi+4], eax\n adc ecx, edx\n pushfd\n\n mov eax, dword ptr[multiplier+4]\n mul dword ptr[operant+4]\n popfd\n adc eax, ecx\n adc edx, 0\n mov dword ptr[edi+8], eax\n mov dword ptr[edi+12], edx\nstartDIV:\n \/\/ Divide: var128 = var128 \/ divider\n \/\/\n \/\/ Test divider = 32bit value\n mov eax, dword ptr[divider+4]\n cmp eax, 0\n jnz fullDIV\n mov ecx, dword ptr[divider]\n cmp ecx, 1\n jz applySign\n\n \/\/ Start 128\/32 bit division\n mov eax, dword ptr[edi+12]\n xor edx, edx\n div ecx\n mov dword ptr[quotient+12], eax\n\n mov eax, dword ptr[edi+8]\n div ecx\n mov dword ptr[quotient+8], eax\n\n mov eax, dword ptr[edi+4]\n div ecx\n mov dword ptr[quotient+4], eax\n\n mov eax, dword ptr[edi]\n div ecx\n mov dword ptr[quotient], eax\n\n \/\/ Copy the quotient to the result storage (var128)\n mov eax, dword ptr[quotient+12]\n mov dword ptr[edi+12], eax\n mov eax, dword ptr[quotient+8]\n mov dword ptr[edi+8], eax\n mov eax, dword ptr[quotient+4]\n mov dword ptr[edi+4], eax\n mov eax, dword ptr[quotient]\n mov dword ptr[edi], eax\n \/\/ To sign correction and return\n jmp applySign\n\nfullDIV:\n \/\/ Full 128\/64 bit division\n xor eax, eax\n mov dword ptr[REMAINDER+12], eax\n mov dword ptr[REMAINDER+8], eax\n mov dword ptr[REMAINDER+4], eax\n mov dword ptr[REMAINDER], eax\n\n mov ecx, 128\nloop1:\n \/\/ Compute REMAINDER:QUOTIENT = REMAINDER:QUOTIENT shl 1\n shl dword ptr[QUOTIENT], 1\n rcl dword ptr[QUOTIENT+4], 1\n rcl dword ptr[QUOTIENT+8], 1\n rcl dword ptr[QUOTIENT+12], 1\n rcl dword ptr[REMAINDER], 1\n rcl dword ptr[REMAINDER+4], 1\n rcl dword ptr[REMAINDER+8], 1\n rcl dword ptr[REMAINDER+12], 1\n\n \/\/ Test (REMAINDER >= Divider)\n xor eax, eax\n cmp dword ptr[REMAINDER+12], eax\n ja iftrue\n jb iffalse\n\n cmp dword ptr[REMAINDER+8], eax\n ja iftrue\n jb iffalse\n\n mov eax, dword ptr[REMAINDER+4]\n cmp eax, dword ptr[divider+4]\n ja iftrue\n jb iffalse\n\n mov eax, dword ptr[REMAINDER]\n cmp eax, dword ptr[divider]\n jb iffalse\niftrue:\n \/\/ Remainder = remainder - divider\n mov eax, dword ptr[divider]\n sub dword ptr[REMAINDER], eax\n mov eax, dword ptr[divider+4]\n sbb dword ptr[REMAINDER+4], eax\n xor eax, eax\n sbb dword ptr[REMAINDER+8], eax\n sbb dword ptr[REMAINDER+12], eax\n \/\/ Quotient = quotient +1\n add dword ptr[QUOTIENT], 1\n adc dword ptr[QUOTIENT+4], 0\n adc dword ptr[QUOTIENT+8], 0\n adc dword ptr[QUOTIENT+12], 0\niffalse:\n \/\/ Loop size = 101 bytes, is less than 127 so loop is possible\n loop loop1\n\napplySign:\n \/\/ Correct the sign of the result based on the stored combined sign\n popfd\n jns storeRes\n not dword ptr[edi+12]\n not dword ptr[edi+ 8]\n not dword ptr[edi+ 4]\n not dword ptr[edi]\n add dword ptr[edi], 1\n adc dword ptr[edi+ 4], 0\n adc dword ptr[edi+ 8], 0\n adc dword ptr[edi+12], 0\n\nstoreRES:\n \/\/ Get low order qword from var128\n mov edx, dword ptr[edi+4]\n mov eax, dword ptr[edi]\ndone:\n }\n \/\/ result is returned in edx:eax\n#elif defined (_M_X64 )\n#pragma warning(push)\n#pragma warning(disable: 4018)\n#pragma warning(disable: 4244)\n#pragma warning(disable: 4389)\n uint64_t a = operant;\n uint64_t b = multiplier;\n uint64_t c = divider;\n\n \/\/ Normalize divisor\n unsigned long shift;\n _BitScanReverse64(&shift, c);\n shift = 63 - shift;\n\n c <<= shift;\n\n \/\/ Multiply\n a = _umul128(a, b, &b);\n if (((b << shift) >> shift) != b)\n {\n \/\/ Overflow\n return 0xFFFFFFFFFFFFFFFF;\n }\n b = __shiftleft128(a, b, shift);\n a <<= shift;\n\n uint32_t div;\n uint32_t q0, q1;\n uint64_t t0, t1;\n\n \/\/ 1st Reduction\n div = (uint32_t)(c >> 32);\n t0 = b \/ div;\n if (t0 > 0xFFFFFFFF)\n t0 = 0xFFFFFFFF;\n q1 = (uint32_t)t0;\n while (1)\n {\n t0 = _umul128(c, (uint64_t)q1 << 32, &t1);\n if (t1 < b || (t1 == b && t0 <= a))\n break;\n q1--;\n }\n b -= t1;\n if (t0 > a)\n b--;\n a -= t0;\n\n if (b > 0xFFFFFFFF)\n {\n \/\/ Overflow\n return 0xFFFFFFFFFFFFFFFF;\n }\n\n \/\/ 2nd reduction\n t0 = ((b << 32) | (a >> 32)) \/ div;\n if (t0 > 0xFFFFFFFF)\n t0 = 0xFFFFFFFF;\n q0 = (uint32_t)t0;\n\n while (1)\n {\n t0 = _umul128(c, q0, &t1);\n if (t1 < b || (t1 == b && t0 <= a))\n break;\n q0--;\n }\n\n return ((uint64_t)q1 << 32) | q0;\n#pragma warning(pop)\n#endif\n#elif defined(__GNUC__)\n __uint128_t a = operant;\n __uint128_t b = multiplier;\n __uint128_t c = divider;\n\n return (uint64_t)(a * b \/ c);\n#else\n #error MulDiv64 is no supported!\n#endif\n}\n\n} \/\/ namespace CppBenchmark\n<commit_msg>Fix 32bit cygwin build<commit_after>\/*!\n \\file phase_metrics.cpp\n \\brief Benchmark phase metrics implementation\n \\author Ivan Shynkarenka\n \\date 03.07.2015\n \\copyright MIT License\n*\/\n\n#include \"benchmark\/phase_metrics.h\"\n\n#include \"benchmark\/system.h\"\n\nnamespace CppBenchmark {\n\nint64_t PhaseMetrics::avg_time() const noexcept\n{\n return (_total_iterations > 0) ? (_total_time \/ _total_iterations) : 0;\n}\n\nint64_t PhaseMetrics::min_time() const noexcept\n{\n return (_total_iterations > 0) ? (_min_time \/ _total_iterations) : _min_time;\n}\n\nint64_t PhaseMetrics::max_time() const noexcept\n{\n return (_total_iterations > 0) ? (_max_time \/ _total_iterations) : _max_time;\n}\n\nint64_t PhaseMetrics::iterations_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_iterations, 1000000000, _total_time);\n}\n\nint64_t PhaseMetrics::items_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_items, 1000000000, _total_time);\n}\n\nint64_t PhaseMetrics::bytes_per_second() const noexcept\n{\n if (_total_time <= 0)\n return 0;\n\n return MulDiv64(_total_bytes, 1000000000, _total_time);\n}\n\nvoid PhaseMetrics::StartCollecting() noexcept\n{\n _iterstamp = _total_iterations;\n _timestamp = System::Timestamp();\n}\n\nvoid PhaseMetrics::StopCollecting() noexcept\n{\n \/\/ Get iterations count & duration\n int64_t total_duration = System::Timestamp() - _timestamp;\n\n \/\/ Update time counters\n if (total_duration < _min_time)\n _min_time = total_duration;\n if (total_duration > _max_time)\n _max_time = total_duration;\n _total_time += total_duration;\n}\n\nvoid PhaseMetrics::MergeMetrics(const PhaseMetrics& metrics)\n{\n \/\/ Choose best min time\n if (metrics._min_time < _min_time)\n _min_time = metrics._min_time;\n\n \/\/ Choose best max time\n if (metrics._max_time > _max_time)\n _max_time = metrics._max_time;\n\n \/\/ Merge custom hash tables\n _custom_int.insert(metrics._custom_int.begin(), metrics._custom_int.end());\n _custom_uint.insert(metrics._custom_uint.begin(), metrics._custom_uint.end());\n _custom_int64.insert(metrics._custom_int64.begin(), metrics._custom_int64.end());\n _custom_uint64.insert(metrics._custom_uint64.begin(), metrics._custom_uint64.end());\n _custom_flt.insert(metrics._custom_flt.begin(), metrics._custom_flt.end());\n _custom_dbl.insert(metrics._custom_dbl.begin(), metrics._custom_dbl.end());\n _custom_str.insert(metrics._custom_str.begin(), metrics._custom_str.end());\n\n \/\/ Choose best total time with iterations, items and bytes\n if (metrics._total_time < _total_time)\n {\n _total_time = metrics._total_time;\n _total_iterations = metrics._total_iterations;\n _total_items = metrics._total_items;\n _total_bytes = metrics._total_bytes;\n \/\/ Overwrite metrics custom tables\n for (auto& it : metrics._custom_int)\n _custom_int[it.first] = it.second;\n for (auto& it : metrics._custom_uint)\n _custom_uint[it.first] = it.second;\n for (auto& it : metrics._custom_int64)\n _custom_int64[it.first] = it.second;\n for (auto& it : metrics._custom_uint64)\n _custom_uint64[it.first] = it.second;\n for (auto& it : metrics._custom_flt)\n _custom_flt[it.first] = it.second;\n for (auto& it : metrics._custom_dbl)\n _custom_dbl[it.first] = it.second;\n for (auto& it : metrics._custom_str)\n _custom_str[it.first] = it.second;\n }\n}\n\nuint64_t PhaseMetrics::MulDiv64(uint64_t operant, uint64_t multiplier, uint64_t divider)\n{\n#if defined(_MSC_VER)\n#if defined(_M_IX86)\n \/\/ Declare 128bit storage\n struct\n {\n unsigned long DW[4];\n } var128, quotient;\n\n \/\/ Change semantics for intermediate results for Full Div\n \/\/ by renaming the vars\n #define REMAINDER quotient\n #define QUOTIENT edi\n\n \/\/ Save combined sign on stack\n _asm\n {\n mov eax, dword ptr[operant+4]\n xor eax, dword ptr[multiplier+4]\n xor eax, dword ptr[divider+4]\n pushfd\n }\n\n _asm\n {\n \/\/ First check divider for 0\n mov eax, dword ptr[divider+4]\n or eax, dword ptr[divider]\n jnz dividerOK\n div eax\ndividerOK:\n lea edi,[var128] \/\/ edi = &var128\n \/\/ Check multiplier for 1 or 0\n xor eax, eax\n cmp eax, dword ptr[multiplier+4]\n jnz startMUL\n cmp eax, dword ptr[multiplier]\n jnz multiNotNUL\n xor edx, edx\n popfd \/\/ cleanup stack\n jmp done\nmultiNotNUL:\n \/\/ Set result HI part to 0\n xor eax,eax\n mov dword ptr[edi+12], eax\n mov dword ptr[edi+8], eax\n mov eax, 1\n cmp eax, dword ptr[multiplier]\n jnz smallMUL\n \/\/ Multiplier is 1 so just copy operant to result\n mov eax, dword ptr[operant+4]\n mov dword ptr[edi+4], eax\n mov eax, dword ptr[operant]\n mov dword ptr[edi], eax\n jmp startDIV\nsmallMUL:\n \/\/ Test for 32\/32 bit multiplication\n xor eax, eax\n mov ecx, dword ptr[operant+4]\n or ecx, eax ;test for both hiwords zero.\n jnz startMUL\n \/\/ Do 32\/32 bit multiplication\n mov ecx, dword ptr[multiplier]\n mov eax, dword ptr[operant]\n mul ecx\n mov dword ptr[edi+4], edx\n mov dword ptr[edi], eax\n jmp startDIV\nstartMUL:\n \/\/ Check signs\n \/\/ Multiply: var128 = operant * multiplier\n mov eax, dword ptr[multiplier] \/\/ eax = LO(multiplier)\n mul dword ptr[operant] \/\/ edx:eax = eax * LO(operant)\n mov dword ptr[edi], eax \/\/ var128.DW0 = eax\n mov ecx, edx \/\/ ecx = edx\n\n mov eax, dword ptr[multiplier] \/\/ eax = LO(multiplier)\n mul dword ptr[operant+4] \/\/ edx:eax = eax * HI(operant)\n add eax, ecx \/\/ eax = eax + ecx\n adc edx, 0 \/\/ edx = edx + 0 + carry\n mov ebx, eax\n mov ecx, edx\n\n mov eax, dword ptr[multiplier+4]\n mul dword ptr[operant]\n add eax, ebx\n mov dword ptr[edi+4], eax\n adc ecx, edx\n pushfd\n\n mov eax, dword ptr[multiplier+4]\n mul dword ptr[operant+4]\n popfd\n adc eax, ecx\n adc edx, 0\n mov dword ptr[edi+8], eax\n mov dword ptr[edi+12], edx\nstartDIV:\n \/\/ Divide: var128 = var128 \/ divider\n \/\/\n \/\/ Test divider = 32bit value\n mov eax, dword ptr[divider+4]\n cmp eax, 0\n jnz fullDIV\n mov ecx, dword ptr[divider]\n cmp ecx, 1\n jz applySign\n\n \/\/ Start 128\/32 bit division\n mov eax, dword ptr[edi+12]\n xor edx, edx\n div ecx\n mov dword ptr[quotient+12], eax\n\n mov eax, dword ptr[edi+8]\n div ecx\n mov dword ptr[quotient+8], eax\n\n mov eax, dword ptr[edi+4]\n div ecx\n mov dword ptr[quotient+4], eax\n\n mov eax, dword ptr[edi]\n div ecx\n mov dword ptr[quotient], eax\n\n \/\/ Copy the quotient to the result storage (var128)\n mov eax, dword ptr[quotient+12]\n mov dword ptr[edi+12], eax\n mov eax, dword ptr[quotient+8]\n mov dword ptr[edi+8], eax\n mov eax, dword ptr[quotient+4]\n mov dword ptr[edi+4], eax\n mov eax, dword ptr[quotient]\n mov dword ptr[edi], eax\n \/\/ To sign correction and return\n jmp applySign\n\nfullDIV:\n \/\/ Full 128\/64 bit division\n xor eax, eax\n mov dword ptr[REMAINDER+12], eax\n mov dword ptr[REMAINDER+8], eax\n mov dword ptr[REMAINDER+4], eax\n mov dword ptr[REMAINDER], eax\n\n mov ecx, 128\nloop1:\n \/\/ Compute REMAINDER:QUOTIENT = REMAINDER:QUOTIENT shl 1\n shl dword ptr[QUOTIENT], 1\n rcl dword ptr[QUOTIENT+4], 1\n rcl dword ptr[QUOTIENT+8], 1\n rcl dword ptr[QUOTIENT+12], 1\n rcl dword ptr[REMAINDER], 1\n rcl dword ptr[REMAINDER+4], 1\n rcl dword ptr[REMAINDER+8], 1\n rcl dword ptr[REMAINDER+12], 1\n\n \/\/ Test (REMAINDER >= Divider)\n xor eax, eax\n cmp dword ptr[REMAINDER+12], eax\n ja iftrue\n jb iffalse\n\n cmp dword ptr[REMAINDER+8], eax\n ja iftrue\n jb iffalse\n\n mov eax, dword ptr[REMAINDER+4]\n cmp eax, dword ptr[divider+4]\n ja iftrue\n jb iffalse\n\n mov eax, dword ptr[REMAINDER]\n cmp eax, dword ptr[divider]\n jb iffalse\niftrue:\n \/\/ Remainder = remainder - divider\n mov eax, dword ptr[divider]\n sub dword ptr[REMAINDER], eax\n mov eax, dword ptr[divider+4]\n sbb dword ptr[REMAINDER+4], eax\n xor eax, eax\n sbb dword ptr[REMAINDER+8], eax\n sbb dword ptr[REMAINDER+12], eax\n \/\/ Quotient = quotient +1\n add dword ptr[QUOTIENT], 1\n adc dword ptr[QUOTIENT+4], 0\n adc dword ptr[QUOTIENT+8], 0\n adc dword ptr[QUOTIENT+12], 0\niffalse:\n \/\/ Loop size = 101 bytes, is less than 127 so loop is possible\n loop loop1\n\napplySign:\n \/\/ Correct the sign of the result based on the stored combined sign\n popfd\n jns storeRes\n not dword ptr[edi+12]\n not dword ptr[edi+ 8]\n not dword ptr[edi+ 4]\n not dword ptr[edi]\n add dword ptr[edi], 1\n adc dword ptr[edi+ 4], 0\n adc dword ptr[edi+ 8], 0\n adc dword ptr[edi+12], 0\n\nstoreRES:\n \/\/ Get low order qword from var128\n mov edx, dword ptr[edi+4]\n mov eax, dword ptr[edi]\ndone:\n }\n \/\/ result is returned in edx:eax\n#elif defined (_M_X64 )\n#pragma warning(push)\n#pragma warning(disable: 4018)\n#pragma warning(disable: 4244)\n#pragma warning(disable: 4389)\n uint64_t a = operant;\n uint64_t b = multiplier;\n uint64_t c = divider;\n\n \/\/ Normalize divisor\n unsigned long shift;\n _BitScanReverse64(&shift, c);\n shift = 63 - shift;\n\n c <<= shift;\n\n \/\/ Multiply\n a = _umul128(a, b, &b);\n if (((b << shift) >> shift) != b)\n {\n \/\/ Overflow\n return 0xFFFFFFFFFFFFFFFF;\n }\n b = __shiftleft128(a, b, shift);\n a <<= shift;\n\n uint32_t div;\n uint32_t q0, q1;\n uint64_t t0, t1;\n\n \/\/ 1st Reduction\n div = (uint32_t)(c >> 32);\n t0 = b \/ div;\n if (t0 > 0xFFFFFFFF)\n t0 = 0xFFFFFFFF;\n q1 = (uint32_t)t0;\n while (1)\n {\n t0 = _umul128(c, (uint64_t)q1 << 32, &t1);\n if (t1 < b || (t1 == b && t0 <= a))\n break;\n q1--;\n }\n b -= t1;\n if (t0 > a)\n b--;\n a -= t0;\n\n if (b > 0xFFFFFFFF)\n {\n \/\/ Overflow\n return 0xFFFFFFFFFFFFFFFF;\n }\n\n \/\/ 2nd reduction\n t0 = ((b << 32) | (a >> 32)) \/ div;\n if (t0 > 0xFFFFFFFF)\n t0 = 0xFFFFFFFF;\n q0 = (uint32_t)t0;\n\n while (1)\n {\n t0 = _umul128(c, q0, &t1);\n if (t1 < b || (t1 == b && t0 <= a))\n break;\n q0--;\n }\n\n return ((uint64_t)q1 << 32) | q0;\n#pragma warning(pop)\n#endif\n#elif defined(__GNUC__)\n#if defined(__x86_64__) || defined(__amd64__) || defined(__aarch64__) || defined(__ia64__) || defined(__ppc64__)\n __uint128_t a = operant;\n __uint128_t b = multiplier;\n __uint128_t c = divider;\n\n return (uint64_t)(a * b \/ c);\n#else\n uint64_t a = operant;\n uint64_t b = multiplier;\n uint64_t c = divider;\n\n return (uint64_t)(a * b \/ c);\n#endif\n#else\n #error MulDiv64 is no supported!\n#endif\n}\n\n} \/\/ namespace CppBenchmark\n<|endoftext|>"} {"text":"<commit_before>\/* main.cpp *\/<commit_msg>basic cgi app<commit_after>#include <iostream>\n#include <cstdlib>\nint main(){\n std::cout<<\"Content-type: text\/html\\r\\n\\r\\n\";\n\n std::cout<<\"QUERY STRING IS: \";\n std::cout<<std::getenv(\"QUERY_STRING\"); \/\/ get enviroment variable\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n}\n\nvoid Cube() {\n\tglBegin(GL_QUADS);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\tglEnd();\n\n\tglColor3f(1, 1, 1);\n\n\tglBegin(GL_LINE_LOOP);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\tglEnd();\n\n\tglBegin(GL_LINE_LOOP);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\tglEnd();\n\n\tglBegin(GL_LINES);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\tglEnd();\n}\n\nvoid Pyramid() {\n\tglBegin(GL_TRIANGLE_FAN);\n\t\tglVertex3f(0, 0.5, 0);\n\t\t\n\t\tglVertex3f(0, -.25, -.433);\n\t\tglVertex3f(-.375, -.25, .2165);\n\t\tglVertex3f( .375, -.25, .2165);\n\t\tglVertex3f(0, -.25, -.433);\n\tglEnd();\n\n\tglColor3f(1, 1, 1);\n\n\tglBegin(GL_LINES);\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f(0, -.25, -.433);\n\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f(-.375, -.25, .2165);\n\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f( .375, -.25, .2165);\n\tglEnd();\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n\tglColor3f(0, 0, 0);\n\n\tCube();\n\n\tglPushMatrix();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(1, 0, 0);\n\n\tPyramid();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(0, 1, 0);\n\n\tCube();\n\n\tglPopMatrix();\n\t\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex2f( 0, 0);\n\t\t\/\/glVertex2f(1, 0);\n\t\t\/\/glVertex2f( 0, 1);\n\t\/\/glEnd();\n\n\t\/\/glColor3f(1, 0, 0);\n\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex3f( 0, 0, 1);\n\t\t\/\/glVertex3f( 1, 0, 1);\n\t\t\/\/glVertex3f( 0, 1, 1);\n\t\/\/glEnd();\n\n\t\/\/glColor3f(0, 1, 0);\n\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex3f( 0, 0, 2);\n\t\t\/\/glVertex3f( 1, 0, 2);\n\t\t\/\/glVertex3f( 0, 1, 2);\n\t\/\/glEnd();\n}\n\nvoid Update() {\n\tif(Key::I().Pressed('D')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i -= 0.1;\n\t\tCam::I().SetPos(pos);\n\t} else if(Key::I().Pressed('A')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i += 0.1;\n\t\tCam::I().SetPos(pos);\n\t}\n}\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tUpdate();\n\t\tKey::I().Update();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t\t\n\t\tglfwSleep(0.01);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<commit_msg>Added bottom face to pyramids<commit_after>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n}\n\nvoid Cube() {\n\tglBegin(GL_QUADS);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\tglEnd();\n\n\tglColor3f(1, 1, 1);\n\n\tglBegin(GL_LINE_LOOP);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\tglEnd();\n\n\tglBegin(GL_LINE_LOOP);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\tglEnd();\n\n\tglBegin(GL_LINES);\n\t\tglVertex3f(-0.25, -0.25, -0.25);\n\t\tglVertex3f(-0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, -0.25, -0.25);\n\t\tglVertex3f( 0.25, -0.25, 0.25);\n\n\t\tglVertex3f( 0.25, 0.25, -0.25);\n\t\tglVertex3f( 0.25, 0.25, 0.25);\n\n\t\tglVertex3f(-0.25, 0.25, -0.25);\n\t\tglVertex3f(-0.25, 0.25, 0.25);\n\tglEnd();\n}\n\nvoid Pyramid() {\n\tglBegin(GL_TRIANGLE_FAN);\n\t\tglVertex3f(0, 0.5, 0);\n\t\t\n\t\tglVertex3f(0, -.25, -.433);\n\t\tglVertex3f(-.375, -.25, .2165);\n\t\tglVertex3f( .375, -.25, .2165);\n\t\tglVertex3f(0, -.25, -.433);\n\tglEnd();\n\n\tglBegin(GL_TRIANGLES);\n\t\tglVertex3f(0, -.25, -.433);\n\t\tglVertex3f(-.375, -.25, .2165);\n\t\tglVertex3f( .375, -.25, .2165);\n\tglEnd();\n\n\tglColor3f(1, 1, 1);\n\n\tglBegin(GL_LINES);\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f(0, -.25, -.433);\n\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f(-.375, -.25, .2165);\n\n\t\tglVertex3f(0, 0.5, 0);\n\t\tglVertex3f( .375, -.25, .2165);\n\tglEnd();\n\n\tglBegin(GL_LINE_LOOP);\n\t\tglVertex3f(0, -.25, -.433);\n\t\tglVertex3f(-.375, -.25, .2165);\n\t\tglVertex3f( .375, -.25, .2165);\n\tglEnd();\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n\tglColor3f(0, 0, 0);\n\n\tCube();\n\n\tglPushMatrix();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(1, 0, 0);\n\n\tPyramid();\n\n\tglTranslatef(0, 0, 5.0);\n\n\tglColor3f(0, 1, 0);\n\n\tCube();\n\n\tglPopMatrix();\n\t\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex2f( 0, 0);\n\t\t\/\/glVertex2f(1, 0);\n\t\t\/\/glVertex2f( 0, 1);\n\t\/\/glEnd();\n\n\t\/\/glColor3f(1, 0, 0);\n\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex3f( 0, 0, 1);\n\t\t\/\/glVertex3f( 1, 0, 1);\n\t\t\/\/glVertex3f( 0, 1, 1);\n\t\/\/glEnd();\n\n\t\/\/glColor3f(0, 1, 0);\n\n\t\/\/glBegin(GL_TRIANGLE_STRIP);\n\t\t\/\/glVertex3f( 0, 0, 2);\n\t\t\/\/glVertex3f( 1, 0, 2);\n\t\t\/\/glVertex3f( 0, 1, 2);\n\t\/\/glEnd();\n}\n\nvoid Update() {\n\tif(Key::I().Pressed('D')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i -= 0.1;\n\t\tCam::I().SetPos(pos);\n\t} else if(Key::I().Pressed('A')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i += 0.1;\n\t\tCam::I().SetPos(pos);\n\t}\n}\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tglEnable(GL_DEPTH_TEST);\n\tglDepthFunc(GL_LEQUAL);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tUpdate();\n\t\tKey::I().Update();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t\t\n\t\tglfwSleep(0.01);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* main.cpp *\/\r\n\/\/-----------------------------------------------------------------------\r\n\/\/include files\r\n\/\/-----------------------------------------------------------------------\r\n#include <iostream>\r\n#include <oauth.h>\r\n#include <thread>\r\n#include <mutex>\r\n#include <chrono>\r\n#include <unistd.h>\r\n\r\n#include <opencv2\/opencv.hpp>\r\n#include <opencv2\/superres\/optical_flow.hpp>\r\n\r\n#include \"sequentialCaptCurrBuffer.h\"\r\n#include \"sequentialCalcDiffImg.h\"\r\n#include \"sequentialCalcOptFlow.h\"\r\n#include \"optFlow2RGB.h\"\r\n#include \"detectMotionObject.h\"\r\n\r\n#include \"tweet.h\"\r\n#include \"webclient.h\"\r\n\/\/ #include \"mykey.h\"\r\n#include \"jphacks_key.h\"\r\n\r\n\/\/-----------------------------------------------------------------------\r\n\/\/ using namespace\r\n\/\/-----------------------------------------------------------------------\r\nusing namespace std;\r\n\r\n\/\/-----------------------------------------------------------------------\r\n\r\n\/\/***********************************************************************\r\n\/\/ Function : main |\r\n\/\/***********************************************************************\r\nint main(void)\r\n{\r\n \/\/ buffering off for debug on pty\r\n setvbuf( stdout, NULL, _IONBF, BUFSIZ );\r\n\r\n WebClient::initialize();\r\n TwitterClient tc(c_key, c_sec, t_key, t_sec);\r\n std::string filename(\"..\/..\/skeleton.png\");\r\n cv::Mat src = cv::imread(filename);\r\n\r\n \/\/ current frame の連続取得(別スレッド)\r\n cv::Mat curr_tmp;\r\n bool break_flag = false;\r\n cv::VideoCapture cap(0);\r\n\t\tcap.set(CV_CAP_PROP_FRAME_WIDTH, 640);\r\n\t\tcap.set(CV_CAP_PROP_FRAME_HEIGHT, 480);\r\n thread cap_th( sequentialCaptCurrBuffer, ref(cap), ref(curr_tmp), ref(break_flag));\r\n while( curr_tmp.empty() ){\r\n std::chrono::milliseconds ms(250);\r\n std::this_thread::sleep_for(ms);\r\n }\r\n\r\n \/\/ 画像差分の連続算出(別スレッド)\r\n cv::Mat diff_tmp;\r\n thread diff_th( sequentialCalcDiffImg, ref(curr_tmp), ref(diff_tmp), ref(break_flag));\r\n while( diff_tmp.empty() ){\r\n std::chrono::milliseconds ms(250);\r\n std::this_thread::sleep_for(ms);\r\n }\r\n\r\n \/\/ \/\/ optical flow の連続算出(別スレッド)\r\n \/\/ cv::Mat flow_tmp;\r\n \/\/ thread optflow_th( sequentialCalcOptFlow, ref(curr_tmp), ref(flow_tmp), ref(break_flag));\r\n \/\/ while( flow_tmp.empty() ){\r\n \/\/ sleep(0);\r\n \/\/ }\r\n\r\n while( cv::waitKey(1) != '\\x1b' ) {\r\n cap_mtx.lock();\r\n cv::Mat curr = curr_tmp.clone();\r\n cap_mtx.unlock();\r\n\r\n diff_mtx.lock();\r\n cv::Mat diff = diff_tmp.clone();\r\n diff_mtx.unlock();\r\n cv::imshow(\"diff\", diff);\r\n\r\n \/\/ opt_flow_mtx.lock();\r\n \/\/ cv::Mat flow = flow_tmp.clone();\r\n \/\/ opt_flow_mtx.unlock();\r\n\r\n \/\/ \/\/ optical flow to RGB\r\n \/\/ cv::Mat flow_rgb;\r\n \/\/ optFlow2RGB( flow, flow_rgb );\r\n\r\n \/\/ \/\/ 表示\r\n \/\/ cv::imshow(\"optical flow\", flow_rgb);\r\n\r\n \/\/ \/\/ グレースケール\r\n \/\/ cv::Mat gray;\r\n \/\/ cv::cvtColor( flow_rgb, gray, CV_BGR2GRAY);\r\n\r\n vector<cv::Rect> detected_obj_diff, detected_obj_optflow;\r\n detectMotionObject(curr, diff, detected_obj_diff);\r\n \/\/ detectMotionObject(curr, gray, detected_obj_optflow);\r\n\r\n for(auto i: detected_obj_diff){\r\n cv::rectangle(curr, i.tl(), i.br(), cv::Scalar(255, 0, 0), 2, CV_AA);\r\n }\r\n \/\/ for(auto i: detected_obj_optflow){\r\n \/\/ cv::rectangle(curr, i.tl(), i.br(), cv::Scalar(0, 255, 0), 2, CV_AA);\r\n \/\/ }\r\n cv::imshow(\"dist\", curr);\r\n }\r\n\r\n \/\/ スレッドの終了\r\n break_flag = true;\r\n cap_th.join();\r\n diff_th.join();\r\n \/\/ optflow_th.join();\r\n\r\n \/\/return ( tc.tweet(message, src) ) ? 0 : 1;\r\n return 0;\r\n}\r\n<commit_msg>std::chrono::milliseconds の定義が冗長だったため修正<commit_after>\/* main.cpp *\/\r\n\/\/-----------------------------------------------------------------------\r\n\/\/include files\r\n\/\/-----------------------------------------------------------------------\r\n#include <iostream>\r\n#include <oauth.h>\r\n#include <thread>\r\n#include <mutex>\r\n#include <chrono>\r\n#include <unistd.h>\r\n\r\n#include <opencv2\/opencv.hpp>\r\n#include <opencv2\/superres\/optical_flow.hpp>\r\n\r\n#include \"sequentialCaptCurrBuffer.h\"\r\n#include \"sequentialCalcDiffImg.h\"\r\n#include \"sequentialCalcOptFlow.h\"\r\n#include \"optFlow2RGB.h\"\r\n#include \"detectMotionObject.h\"\r\n\r\n#include \"tweet.h\"\r\n#include \"webclient.h\"\r\n\/\/ #include \"mykey.h\"\r\n#include \"jphacks_key.h\"\r\n\r\n\/\/-----------------------------------------------------------------------\r\n\/\/ using namespace\r\n\/\/-----------------------------------------------------------------------\r\nusing namespace std;\r\n\r\n\/\/-----------------------------------------------------------------------\r\n\r\n\/\/***********************************************************************\r\n\/\/ Function : main |\r\n\/\/***********************************************************************\r\nint main(void)\r\n{\r\n \/\/ buffering off for debug on pty\r\n setvbuf( stdout, NULL, _IONBF, BUFSIZ );\r\n\r\n WebClient::initialize();\r\n TwitterClient tc(c_key, c_sec, t_key, t_sec);\r\n std::string filename(\"..\/..\/skeleton.png\");\r\n cv::Mat src = cv::imread(filename);\r\n\r\n \/\/ current frame の連続取得(別スレッド)\r\n cv::Mat curr_tmp;\r\n bool break_flag = false;\r\n std::chrono::milliseconds ms(250);\r\n cv::VideoCapture cap(0);\r\n cap.set(CV_CAP_PROP_FRAME_WIDTH, 640);\r\n cap.set(CV_CAP_PROP_FRAME_HEIGHT, 480);\r\n thread cap_th( sequentialCaptCurrBuffer, ref(cap), ref(curr_tmp), ref(break_flag));\r\n while( curr_tmp.empty() ){\r\n std::this_thread::sleep_for(ms);\r\n }\r\n\r\n \/\/ 画像差分の連続算出(別スレッド)\r\n cv::Mat diff_tmp;\r\n thread diff_th( sequentialCalcDiffImg, ref(curr_tmp), ref(diff_tmp), ref(break_flag));\r\n while( diff_tmp.empty() ){\r\n std::this_thread::sleep_for(ms);\r\n }\r\n\r\n \/\/ \/\/ optical flow の連続算出(別スレッド)\r\n \/\/ cv::Mat flow_tmp;\r\n \/\/ thread optflow_th( sequentialCalcOptFlow, ref(curr_tmp), ref(flow_tmp), ref(break_flag));\r\n \/\/ while( flow_tmp.empty() ){\r\n \/\/ std::this_thread::sleep_for(ms);\r\n \/\/ }\r\n\r\n while( cv::waitKey(1) != '\\x1b' ) {\r\n cap_mtx.lock();\r\n cv::Mat curr = curr_tmp.clone();\r\n cap_mtx.unlock();\r\n\r\n diff_mtx.lock();\r\n cv::Mat diff = diff_tmp.clone();\r\n diff_mtx.unlock();\r\n cv::imshow(\"diff\", diff);\r\n\r\n \/\/ opt_flow_mtx.lock();\r\n \/\/ cv::Mat flow = flow_tmp.clone();\r\n \/\/ opt_flow_mtx.unlock();\r\n\r\n \/\/ \/\/ optical flow to RGB\r\n \/\/ cv::Mat flow_rgb;\r\n \/\/ optFlow2RGB( flow, flow_rgb );\r\n\r\n \/\/ \/\/ 表示\r\n \/\/ cv::imshow(\"optical flow\", flow_rgb);\r\n\r\n \/\/ \/\/ グレースケール\r\n \/\/ cv::Mat gray;\r\n \/\/ cv::cvtColor( flow_rgb, gray, CV_BGR2GRAY);\r\n\r\n vector<cv::Rect> detected_obj_diff, detected_obj_optflow;\r\n detectMotionObject(curr, diff, detected_obj_diff);\r\n \/\/ detectMotionObject(curr, gray, detected_obj_optflow);\r\n\r\n for(auto i: detected_obj_diff){\r\n cv::rectangle(curr, i.tl(), i.br(), cv::Scalar(255, 0, 0), 2, CV_AA);\r\n }\r\n \/\/ for(auto i: detected_obj_optflow){\r\n \/\/ cv::rectangle(curr, i.tl(), i.br(), cv::Scalar(0, 255, 0), 2, CV_AA);\r\n \/\/ }\r\n cv::imshow(\"dist\", curr);\r\n }\r\n\r\n \/\/ スレッドの終了\r\n break_flag = true;\r\n cap_th.join();\r\n diff_th.join();\r\n \/\/ optflow_th.join();\r\n\r\n \/\/return ( tc.tweet(message, src) ) ? 0 : 1;\r\n return 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <cstdint>\n#include <algorithm>\n#include <memory>\n#include <stdio.h>\n#include <chrono>\n\n#include \"config.hpp\"\n#include \"dcpu_opcodes.hpp\"\n#include \"dcpu.hpp\"\n#include \"disassembler.hpp\"\n#include \"gclock.hpp\"\n#include \"gkeyboard.hpp\"\n#include \"lem1802.hpp\"\n#include \"lem1803.hpp\"\n#include \"cgm.hpp\"\n\n\n\nusing namespace cpu;\n\nvoid print_help(std::string program_name)\n{\n std::cout << \"usage : \" << program_name << \" [--options] <dcpu16-exe>\\n\";\n std::cout << \"--------------------------------------------------------\\n\";\n std::cout << \" options:\" << std::endl;\n std::cout << \" --debug : start in debug mode\\n\";\n std::cout << \" F1 : next step\" << std::endl;\n std::cout << \" F2 : print registers\" << std::endl;\n std::cout << \" F3 : reset (no need debug mode)\" << std::endl;\n std::cout << \" F12 : switch debug\/run\" << std::endl;\n std::cout << \" --monitor=<monitor_name> : use the following monitor\\n\";\n std::cout << \" 1802 -> Lem1802 (default) [c]\" << std::endl;\n std::cout << \" 1803 -> Lem1803 [c]\" << std::endl;\n std::cout << \" cgm -> Colour Graphics Monitor\" << std::endl;\n std::cout << \" [c] : compatible with Lem1802 0x10c programs\\n\";\n}\n\nint main (int argc, char **argv)\n{\n\n std::string filename;\n int monitor_type=0; \n bool debug=false;\n size_t size = 0;\n uint16_t* data;\n std::ifstream binfile;\n \n if (argc <= 1) {\n std::cerr << \"Missing input file, type --help for list options\\n\";\n return 0;\n }\n for (int k=1; k < argc; k++) \/\/parse arguments\n {\n if (argv[k][0] == '-')\n {\n std::string opt = argv[k];\n if (opt.find(\"--monitor\") != std::string::npos)\n {\n if (opt == \"--monitor=1802\") monitor_type=0;\n else if (opt == \"--monitor=1803\") monitor_type=1; \n else if (opt == \"--monitor=cgm\") monitor_type=2;\n else { \n std::cout << \"Warning unknow monitor type \"; \n std::cout << opt << std::endl;\n }\n }\n else if (opt==\"--help\"||opt==\"-help\"||opt==\"-h\")\n {\n std::string pn = argv[0];\n pn.erase(0,pn.find_last_of('\\\\')+1); \/\/windows\n pn.erase(0,pn.find_last_of('\/')+1); \/\/linux\n print_help(pn);\n return 0;\n }\n else if (opt==\"--debug\")\n {\n debug=true;\n }\n else\n {\n std::cout << \"Warning: unknow option \";\n std::cout << opt << \" it will be ignored !\" << std::endl;\n }\n }\n else\n {\n filename = argv[k];\n }\n \n }\n \n \n \/\/TODO make a function which do that but fast\n std::cout << \"Input BIN File : \" << filename << \"\\n\";\n \n binfile.open (filename.c_str(), std::ios::in | std::ios::binary );\n \n if (!binfile) {\n std::cerr << \"ERROR: I can open file\\n\";\n exit (1);\n }\n \n \/\/ get length of file:\n binfile.seekg (0, binfile.end);\n size = binfile.tellg();\n binfile.seekg (0, binfile.beg);\n \n data = new uint16_t[size \/ 2 + 1]();\n std::fill_n (data, size \/ 2, 0); \/\/ Clean it\n \n int i = 0;\n \n while (! binfile.eof() ) { \n \/\/need improvement read (read whole file and then switch endianess\n uint16_t word = 0;\n binfile.read ( (char*) &word, 2);\n uint16_t tmp = ( (word & 0xFF00) >> 8) & 0x00FF;\n word = ( (word & 0x00FF) << 8) | tmp;\n data[i] = word;\n i++;\n }\n \n binfile.close();\n \n \n std::cout << \"Readed \" << size << \" bytes - \" << size \/ 2 << \" words\\n\";\n size \/= 2;\n \n \n sf::String window_title=\"dcpu_vm\";\n auto dcpu = std::make_shared<DCPU>();\n auto gclock = std::make_shared<Generic_Clock>();\n auto gkeyboard = std::make_shared<keyboard::GKeyboard>();\n std::shared_ptr<AbstractMonitor> monitor;\n switch (monitor_type)\n {\n case 1:\n monitor=std::make_shared<lem::Lem1803>();\n std::cout << \"Use Lem1803 Monitor\" << std::endl;\n window_title = \"Lem 1803\";\n break;\n case 2:\n monitor=std::make_shared<cgm::CGM>();\n std::cout << \"Use CGM Monitor\" << std::endl;\n window_title = \"CGM\";\n break;\n default :\n monitor=std::make_shared<lem::Lem1802>();\n std::cout << \"Use Lem1802 Monitor\" << std::endl;\n window_title = \"Lem 1802\";\n break;\n }\n \n dcpu->attachHardware (monitor);\n dcpu->attachHardware (gclock);\n dcpu->attachHardware (gkeyboard);\n dcpu->reset();\n dcpu->loadProgram (data, size);\n \n sf::Texture texture; \/\/ texture of the screen\n sf::Sprite sprite; \/\/sprite of the screen\n const sf::Image* screen = monitor->getScreen();\n sf::Clock clock; \n sf::RenderWindow window;\n float border_add = monitor->borderSize()*2;\n window.create(sf::VideoMode(monitor->phyWidth()+border_add,\n monitor->phyHeight()+border_add),\n window_title);\n window.setFramerateLimit(60);\n \n \n \n while (window.isOpen()) \/\/Because non mainthread event are forbidden in OSX\n {\n \/\/ Process events\n sf::Event event;\n while (window.pollEvent(event)) \n {\n \/\/ Close window : exit\n if (event.type == sf::Event::Closed) {\n window.close();\n }\n else if (event.type == sf::Event::KeyPressed \n || event.type == sf::Event::KeyReleased)\n {\n bool pressed = false;\n unsigned char keycode=0;\n if (event.type == sf::Event::KeyPressed) pressed = true;\n if (event.key.code>=sf::Keyboard::A && \n event.key.code<=sf::Keyboard::Z)\n {\n if (event.key.shift)\n keycode=event.key.code+'A';\n else\n keycode=event.key.code+'a';\n }\n else if (event.key.code>=sf::Keyboard::Num0 && \n event.key.code<=sf::Keyboard::Num9)\n {\n keycode=event.key.code-sf::Keyboard::Num0+'0';\n }\n else \n {\n switch (event.key.code)\n {\n case sf::Keyboard::BackSpace:\n \/\/ NOTE: Changes between SFML 2.0 and 2.1\n keycode=keyboard::BACKSPACE;\n break;\n case sf::Keyboard::Return:\n keycode=keyboard::RETURN;\n break;\n case sf::Keyboard::Insert:\n keycode=keyboard::INSERT;\n break;\n case sf::Keyboard::Delete:\n keycode=keyboard::DELETE;\n break;\n case sf::Keyboard::Up:\n keycode=keyboard::ARROW_UP;\n break;\n case sf::Keyboard::Down:\n keycode=keyboard::ARROW_DOWN;\n break;\n case sf::Keyboard::Left:\n keycode=keyboard::ARROW_LEFT;\n break;\n case sf::Keyboard::Right:\n keycode=keyboard::ARROW_RIGHT;\n break;\n case sf::Keyboard::RShift:\n case sf::Keyboard::LShift:\n keycode=keyboard::SHIFT;\n break;\n case sf::Keyboard::RControl:\n case sf::Keyboard::LControl:\n keycode=keyboard::CONTROL;\n break;\n case sf::Keyboard::F1:\n if (debug && pressed)\n {\n std::cout << disassembly(dcpu->getMem()\n +dcpu->GetPC(),3);\n std::cout << std::endl;\n dcpu->step();\n }\n break;\n case sf::Keyboard::F2:\n if (debug && !pressed)\n {\n printf(\"A : 0x%04X | B : 0x%04X | C : 0x%04X\\n\",\n dcpu->ra,dcpu->rb,dcpu->rc);\n printf(\"X : 0x%04X | Y : 0x%04X | Z : 0x%04X\\n\",\n dcpu->rx,dcpu->ry,dcpu->rz);\n printf(\"I : 0x%04X | J : 0x%04X | IA: 0x%04X\\n\",\n dcpu->ri,dcpu->rj,dcpu->ria);\n printf(\"PC: 0x%04X | SP: 0x%04X | EX: 0x%04X\\n\",\n dcpu->rpc,dcpu->rsp,dcpu->rex);\n }\n break;\n case sf::Keyboard::F3: \n \/\/No need to be in debug mode for this one\n if (!pressed)\n {\n std::cout << \"Reset dcpu\" << std::endl;\n dcpu->reset();\n dcpu->loadProgram (data, size);\n }\n break;\n case sf::Keyboard::F12:\n if (!pressed)\n {\n debug = !debug;\n }\n break;\n \n default: break;\n }\n }\n if (keycode)\n gkeyboard->pushKeyEvent(pressed,keycode);\n \n }\n }\n \n \/\/\/DCPU emulation stuff\n monitor->prepareRender();\n const float delta=clock.getElapsedTime().asSeconds();\n clock.restart();\n unsigned int tick_needed=(float)dcpu->cpu_clock*delta;\n \n if (!debug)\n {\n if (tick_needed > dcpu->cpu_clock\/60)\n tick_needed = dcpu->cpu_clock\/60;\n dcpu->tick(tick_needed);\n }\n \/*border_add = monitor->borderSize();\n sprite.setPosition(sf::Vector2f(border_add,border_add));\n border_add *=2;\n \n \n float r_width = border_add + monitor->getScreen().getSize().x;\n float r_height = border_add + monitor->getScreen().getSize().y;\n border.setSize(sf::Vector2f(r_width,r_height));\n border.setFillColor(monitor->getBorder());*\/\n \n \/\/For emulations modes and windows resizes\n \/\/sf::FloatRect r(0,0,r_width,r_height);\n \/\/window.setView(sf::View(r));\n window.setActive(true);\n \n \n texture.loadFromImage(*screen); \/\/Slow function\n sprite.setTexture(texture);\n sprite.scale(\n monitor->phyWidth() \/ (float)(monitor->width() ) ,\n monitor->phyHeight() \/ (float)(monitor->height()) );\n sprite.setPosition(monitor->borderSize(), monitor->borderSize());\n\n window.clear(monitor->getBorder()); \/\/good idea\n window.draw(sprite);\n window.display();\n window.setActive(false);\n }\n return 0;\n}\n\n\n<commit_msg>Fixed resizing scale bug<commit_after>#include <iostream>\n#include <fstream>\n#include <cstdint>\n#include <algorithm>\n#include <memory>\n#include <stdio.h>\n#include <chrono>\n\n#include \"config.hpp\"\n#include \"dcpu_opcodes.hpp\"\n#include \"dcpu.hpp\"\n#include \"disassembler.hpp\"\n#include \"gclock.hpp\"\n#include \"gkeyboard.hpp\"\n#include \"lem1802.hpp\"\n#include \"lem1803.hpp\"\n#include \"cgm.hpp\"\n\n\n\nusing namespace cpu;\n\nvoid print_help(std::string program_name)\n{\n std::cout << \"usage : \" << program_name << \" [--options] <dcpu16-exe>\\n\";\n std::cout << \"--------------------------------------------------------\\n\";\n std::cout << \" options:\" << std::endl;\n std::cout << \" --debug : start in debug mode\\n\";\n std::cout << \" F1 : next step\" << std::endl;\n std::cout << \" F2 : print registers\" << std::endl;\n std::cout << \" F3 : reset (no need debug mode)\" << std::endl;\n std::cout << \" F12 : switch debug\/run\" << std::endl;\n std::cout << \" --monitor=<monitor_name> : use the following monitor\\n\";\n std::cout << \" 1802 -> Lem1802 (default) [c]\" << std::endl;\n std::cout << \" 1803 -> Lem1803 [c]\" << std::endl;\n std::cout << \" cgm -> Colour Graphics Monitor\" << std::endl;\n std::cout << \" [c] : compatible with Lem1802 0x10c programs\\n\";\n}\n\nint main (int argc, char **argv)\n{\n\n std::string filename;\n int monitor_type=0; \n bool debug=false;\n size_t size = 0;\n uint16_t* data;\n std::ifstream binfile;\n \n if (argc <= 1) {\n std::cerr << \"Missing input file, type --help for list options\\n\";\n return 0;\n }\n for (int k=1; k < argc; k++) \/\/parse arguments\n {\n if (argv[k][0] == '-')\n {\n std::string opt = argv[k];\n if (opt.find(\"--monitor\") != std::string::npos)\n {\n if (opt == \"--monitor=1802\") monitor_type=0;\n else if (opt == \"--monitor=1803\") monitor_type=1; \n else if (opt == \"--monitor=cgm\") monitor_type=2;\n else { \n std::cout << \"Warning unknow monitor type \"; \n std::cout << opt << std::endl;\n }\n }\n else if (opt==\"--help\"||opt==\"-help\"||opt==\"-h\")\n {\n std::string pn = argv[0];\n pn.erase(0,pn.find_last_of('\\\\')+1); \/\/windows\n pn.erase(0,pn.find_last_of('\/')+1); \/\/linux\n print_help(pn);\n return 0;\n }\n else if (opt==\"--debug\")\n {\n debug=true;\n }\n else\n {\n std::cout << \"Warning: unknow option \";\n std::cout << opt << \" it will be ignored !\" << std::endl;\n }\n }\n else\n {\n filename = argv[k];\n }\n \n }\n \n \n \/\/TODO make a function which do that but fast\n std::cout << \"Input BIN File : \" << filename << \"\\n\";\n \n binfile.open (filename.c_str(), std::ios::in | std::ios::binary );\n \n if (!binfile) {\n std::cerr << \"ERROR: I can open file\\n\";\n exit (1);\n }\n \n \/\/ get length of file:\n binfile.seekg (0, binfile.end);\n size = binfile.tellg();\n binfile.seekg (0, binfile.beg);\n \n data = new uint16_t[size \/ 2 + 1]();\n std::fill_n (data, size \/ 2, 0); \/\/ Clean it\n \n int i = 0;\n \n while (! binfile.eof() ) { \n \/\/need improvement read (read whole file and then switch endianess\n uint16_t word = 0;\n binfile.read ( (char*) &word, 2);\n uint16_t tmp = ( (word & 0xFF00) >> 8) & 0x00FF;\n word = ( (word & 0x00FF) << 8) | tmp;\n data[i] = word;\n i++;\n }\n \n binfile.close();\n \n \n std::cout << \"Readed \" << size << \" bytes - \" << size \/ 2 << \" words\\n\";\n size \/= 2;\n \n \n sf::String window_title=\"dcpu_vm\";\n auto dcpu = std::make_shared<DCPU>();\n auto gclock = std::make_shared<Generic_Clock>();\n auto gkeyboard = std::make_shared<keyboard::GKeyboard>();\n std::shared_ptr<AbstractMonitor> monitor;\n switch (monitor_type)\n {\n case 1:\n monitor=std::make_shared<lem::Lem1803>();\n std::cout << \"Use Lem1803 Monitor\" << std::endl;\n window_title = \"Lem 1803\";\n break;\n case 2:\n monitor=std::make_shared<cgm::CGM>();\n std::cout << \"Use CGM Monitor\" << std::endl;\n window_title = \"CGM\";\n break;\n default :\n monitor=std::make_shared<lem::Lem1802>();\n std::cout << \"Use Lem1802 Monitor\" << std::endl;\n window_title = \"Lem 1802\";\n break;\n }\n \n dcpu->attachHardware (monitor);\n dcpu->attachHardware (gclock);\n dcpu->attachHardware (gkeyboard);\n dcpu->reset();\n dcpu->loadProgram (data, size);\n \n sf::Texture texture; \/\/ texture of the screen\n sf::Sprite sprite; \/\/sprite of the screen\n const sf::Image* screen = monitor->getScreen();\n sf::Clock clock; \n sf::RenderWindow window;\n float border_add = monitor->borderSize()*2;\n window.create(sf::VideoMode(monitor->phyWidth()+border_add,\n monitor->phyHeight()+border_add),\n window_title);\n window.setFramerateLimit(60);\n \n \n \n while (window.isOpen()) \/\/Because non mainthread event are forbidden in OSX\n {\n \/\/ Process events\n sf::Event event;\n while (window.pollEvent(event)) \n {\n \/\/ Close window : exit\n if (event.type == sf::Event::Closed) {\n window.close();\n }\n else if (event.type == sf::Event::Resized)\n {\n \/\/Rewrap opengl camera\n float r_width = window.getSize().x;\n float r_height = window.getSize().y;\n \/\/For emulations modes and windows resizes\n sf::FloatRect r(0,0,r_width,r_height);\n window.setView(sf::View(r));\n }\n else if (event.type == sf::Event::KeyPressed \n || event.type == sf::Event::KeyReleased)\n {\n bool pressed = false;\n unsigned char keycode=0;\n if (event.type == sf::Event::KeyPressed) pressed = true;\n if (event.key.code>=sf::Keyboard::A && \n event.key.code<=sf::Keyboard::Z)\n {\n if (event.key.shift)\n keycode=event.key.code+'A';\n else\n keycode=event.key.code+'a';\n }\n else if (event.key.code>=sf::Keyboard::Num0 && \n event.key.code<=sf::Keyboard::Num9)\n {\n keycode=event.key.code-sf::Keyboard::Num0+'0';\n }\n else \n {\n switch (event.key.code)\n {\n case sf::Keyboard::BackSpace:\n \/\/ NOTE: Changes between SFML 2.0 and 2.1\n keycode=keyboard::BACKSPACE;\n break;\n case sf::Keyboard::Return:\n keycode=keyboard::RETURN;\n break;\n case sf::Keyboard::Insert:\n keycode=keyboard::INSERT;\n break;\n case sf::Keyboard::Delete:\n keycode=keyboard::DELETE;\n break;\n case sf::Keyboard::Up:\n keycode=keyboard::ARROW_UP;\n break;\n case sf::Keyboard::Down:\n keycode=keyboard::ARROW_DOWN;\n break;\n case sf::Keyboard::Left:\n keycode=keyboard::ARROW_LEFT;\n break;\n case sf::Keyboard::Right:\n keycode=keyboard::ARROW_RIGHT;\n break;\n case sf::Keyboard::RShift:\n case sf::Keyboard::LShift:\n keycode=keyboard::SHIFT;\n break;\n case sf::Keyboard::RControl:\n case sf::Keyboard::LControl:\n keycode=keyboard::CONTROL;\n break;\n case sf::Keyboard::F1:\n if (debug && pressed)\n {\n std::cout << disassembly(dcpu->getMem()\n +dcpu->GetPC(),3);\n std::cout << std::endl;\n dcpu->step();\n }\n break;\n case sf::Keyboard::F2:\n if (debug && !pressed)\n {\n printf(\"A : 0x%04X | B : 0x%04X | C : 0x%04X\\n\",\n dcpu->ra,dcpu->rb,dcpu->rc);\n printf(\"X : 0x%04X | Y : 0x%04X | Z : 0x%04X\\n\",\n dcpu->rx,dcpu->ry,dcpu->rz);\n printf(\"I : 0x%04X | J : 0x%04X | IA: 0x%04X\\n\",\n dcpu->ri,dcpu->rj,dcpu->ria);\n printf(\"PC: 0x%04X | SP: 0x%04X | EX: 0x%04X\\n\",\n dcpu->rpc,dcpu->rsp,dcpu->rex);\n }\n break;\n case sf::Keyboard::F3: \n \/\/No need to be in debug mode for this one\n if (!pressed)\n {\n std::cout << \"Reset dcpu\" << std::endl;\n dcpu->reset();\n dcpu->loadProgram (data, size);\n }\n break;\n case sf::Keyboard::F12:\n if (!pressed)\n {\n debug = !debug;\n }\n break;\n \n default: break;\n }\n }\n if (keycode)\n gkeyboard->pushKeyEvent(pressed,keycode);\n \n }\n }\n \n \/\/\/DCPU emulation stuff\n monitor->prepareRender();\n const float delta=clock.getElapsedTime().asSeconds();\n clock.restart();\n unsigned int tick_needed=(float)dcpu->cpu_clock*delta;\n \n if (!debug)\n {\n if (tick_needed > dcpu->cpu_clock\/60)\n tick_needed = dcpu->cpu_clock\/60;\n dcpu->tick(tick_needed);\n }\n \n \n window.setActive(true);\n \n \/\/Working resizing code\n border_add = monitor->borderSize();\n texture.loadFromImage(*screen); \/\/Slow function\n sprite.setTexture(texture);\n sprite.setScale( \/\/Warning setScale and scale are different !!\n (float) (window.getSize().x-border_add*2) \/ (float)(monitor->width()),\n (float) (window.getSize().y-border_add*2) \/ (float)(monitor->height()));\n sprite.setPosition(sf::Vector2f(border_add,border_add));\n\n window.clear(monitor->getBorder()); \/\/good idea\n window.draw(sprite);\n window.display();\n window.setActive(false);\n }\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SlsBitmapCache.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-10-24 07:39:19 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_SLIDESORTER_BITMAP_CACHE_HXX\n#define SD_SLIDESORTER_BITMAP_CACHE_HXX\n\nclass SdrPage;\n\n#include <vcl\/bitmapex.hxx>\n#include <osl\/mutex.hxx>\n#include <memory>\n#include <boost\/shared_ptr.hpp>\n#include <hash_map>\n\nnamespace sd { namespace slidesorter { namespace cache {\n\nclass BitmapReplacement;\nclass CacheCompactor;\nclass BitmapCompressor;\n\n\n\n\/** This low level cache is the actual bitmap container. It supports a\n precious flag for every preview bitmap and keeps track of total sizes\n for all previews with as well as those without the flag. The precious\n flag is used by compaction algorithms to determine which previews may be\n compressed or even discarded and which have to remain in their original\n form. The precious flag is usually set for the visible previews.\n*\/\nclass BitmapCache\n{\npublic:\n \/** The key for looking up preview bitmaps is a pointer to an SdrPage\n object. The prior use of PageObjectViewObjectContact objects (which\n ultimatly use them) turned out to be less suitable because their\n life time is shorter then that of the page objects. Frequent\n destruction and re-creation of the preview bitmaps was the result.\n *\/\n typedef const SdrPage* CacheKey;\n class CacheEntry;\n class CacheBitmapContainer;\n typedef ::std::vector<CacheKey> CacheIndex;\n\n \/** Create a new cache for bitmap objects.\n *\/\n BitmapCache (void);\n\n \/** The destructor clears the cache and relases all bitmaps still in it.\n *\/\n ~BitmapCache (void);\n\n \/** Remove all preview bitmaps from the cache. After this call the\n cache is empty.\n *\/\n void Clear (void);\n\n \/** Returns <TRUE\/> when there is no preview bitmap in the cache.\n *\/\n bool IsEmpty (void) const;\n\n \/** Return <TRUE\/> when the cache is full, i.e. the cache compactor had\n to be run.\n *\/\n bool IsFull (void) const;\n\n \/** Return the memory size that is occupied by all non-precious bitmaps\n in the cache.\n *\/\n sal_Int32 GetSize (void);\n\n \/** Return <TRUE\/> when a preview bitmap exists for the given key.\n *\/\n bool HasBitmap (const CacheKey& rKey);\n\n \/** Return <TRUE\/> when a preview bitmap exists for the given key and\n when it is up-to-date.\n *\/\n bool BitmapIsUpToDate (const CacheKey& rKey);\n\n \/** Return the preview bitmap for the given contact object.\n *\/\n ::boost::shared_ptr<BitmapEx> GetBitmap (const CacheKey& rKey);\n\n \/** Release the reference to the preview bitmap that is associated with\n the given key.\n *\/\n void ReleaseBitmap (const CacheKey& rKey);\n\n \/** Mark the specified preview bitmap as not being up-to-date anymore.\n *\/\n void InvalidateBitmap (const CacheKey& rKey);\n\n \/** Mark all preview bitmaps as not being up-to-date anymore.\n *\/\n void InvalidateCache (void);\n\n \/** Add or replace a bitmap for the given key.\n *\/\n void SetBitmap (\n const CacheKey& rKey,\n const ::boost::shared_ptr<BitmapEx>& rpPreview,\n bool bIsPrecious);\n\n \/** Return whether the specified preview bitmap has been marked as\n precious.\n *\/\n bool IsPrecious (const CacheKey& rKey);\n\n \/** Mark the specified preview bitmap as precious, i.e. that it must not\n be compressed or otherwise removed from the cache.\n *\/\n void SetPrecious (const CacheKey& rKey, bool bIsPrecious);\n\n \/** Calculate the cache size. This should rarely be necessary because\n the cache size is tracked with each modification of preview\n bitmaps.\n *\/\n void ReCalculateTotalCacheSize (void);\n\n \/** Use the previews in the given cache to initialize missing previews.\n *\/\n void Recycle (const BitmapCache& rCache);\n\n \/** Return a list of sorted cache keys that represent an index into (a\n part of) the cache. The entries of the index are sorted according\n to last access times with the least recently access time first.\n @param bIncludePrecious\n When this flag is <TRUE\/> entries with the precious flag set are\n included in the index. When the flag is <FALSE\/> these entries\n are ommited.\n @param bIncludeNoPreview\n When this flag is <TRUE\/> entries with that have no preview\n bitmaps are included in the index. When the flag is <FALSE\/> these entries\n are ommited.\n *\/\n ::std::auto_ptr<CacheIndex> GetCacheIndex (\n bool bIncludePrecious,\n bool bIncludeNoPreview) const;\n\n \/** Compress the specified preview bitmap with the given bitmap\n compressor. A reference to the compressor is stored for later\n decompression.\n *\/\n void Compress (\n const CacheKey& rKey,\n const ::boost::shared_ptr<BitmapCompressor>& rpCompressor);\n\nprivate:\n mutable ::osl::Mutex maMutex;\n\n ::std::auto_ptr<CacheBitmapContainer> mpBitmapContainer;\n\n \/** Total size of bytes that are occupied by bitmaps in the cache for\n whom the slides are currently not inside the visible area.\n *\/\n sal_Int32 mnNormalCacheSize;\n\n \/** Total size of bytes that are occupied by bitmaps in the cache for\n whom the slides are currently visible.\n *\/\n sal_Int32 mnPreciousCacheSize;\n\n \/** At the moment the access time is not an actual time or date value\n but a counter that is increased with every access. It thus defines\n the same ordering as a true time.\n *\/\n sal_Int32 mnCurrentAccessTime;\n\n \/** The maximal cache size for the off-screen preview bitmaps. When\n mnNormalCacheSize grows larger than this value then the\n mpCacheCompactor member is used to reduce the cache size.\n *\/\n sal_Int32 mnMaximalNormalCacheSize;\n\n \/** The cache compactor is used to reduce the number of bytes used by\n off-screen preview bitmaps.\n *\/\n ::std::auto_ptr<CacheCompactor> mpCacheCompactor;\n\n \/** This flag stores if the cache is or recently was full, i.e. the\n cache compactor has or had to be run in order to reduce the cache\n size to the allowed value.\n *\/\n bool mbIsFull;\n\n \/** Update mnNormalCacheSize or mnPreciousCacheSize according to the\n precious flag of the specified preview bitmap and the specified\n operation.\n *\/\n enum CacheOperation { ADD, REMOVE };\n void UpdateCacheSize (const CacheEntry& rKey, CacheOperation eOperation);\n};\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::cache\n\n#endif\n<commit_msg>INTEGRATION: CWS presenterview (1.4.354); FILE MERGED 2008\/02\/26 12:06:31 af 1.4.354.1: #i18486# Maximal cache size can be provided via constructor argument.<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: SlsBitmapCache.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2008-04-03 14:16:57 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_SLIDESORTER_BITMAP_CACHE_HXX\n#define SD_SLIDESORTER_BITMAP_CACHE_HXX\n\nclass SdrPage;\n\n#include <vcl\/bitmapex.hxx>\n#include <osl\/mutex.hxx>\n#include <memory>\n#include <boost\/shared_ptr.hpp>\n#include <hash_map>\n\nnamespace sd { namespace slidesorter { namespace cache {\n\nclass BitmapReplacement;\nclass CacheCompactor;\nclass BitmapCompressor;\n\n\/** This low level cache is the actual bitmap container. It supports a\n precious flag for every preview bitmap and keeps track of total sizes\n for all previews with as well as those without the flag. The precious\n flag is used by compaction algorithms to determine which previews may be\n compressed or even discarded and which have to remain in their original\n form. The precious flag is usually set for the visible previews.\n*\/\nclass BitmapCache\n{\npublic:\n \/** The key for looking up preview bitmaps is a pointer to an SdrPage\n object. The prior use of PageObjectViewObjectContact objects (which\n ultimatly use them) turned out to be less suitable because their\n life time is shorter then that of the page objects. Frequent\n destruction and re-creation of the preview bitmaps was the result.\n *\/\n typedef const SdrPage* CacheKey;\n class CacheEntry;\n class CacheBitmapContainer;\n typedef ::std::vector<CacheKey> CacheIndex;\n\n \/** Create a new cache for bitmap objects.\n @param nMaximalNormalCacheSize\n When a size larger then zero is given then that size is used.\n Otherwise the default value from the configuration is used.\n When that does not exist either then a internal default value is\n used.\n *\/\n BitmapCache (const sal_Int32 nMaximalNormalCacheSize = 0);\n\n \/** The destructor clears the cache and relases all bitmaps still in it.\n *\/\n ~BitmapCache (void);\n\n \/** Remove all preview bitmaps from the cache. After this call the\n cache is empty.\n *\/\n void Clear (void);\n\n \/** Returns <TRUE\/> when there is no preview bitmap in the cache.\n *\/\n bool IsEmpty (void) const;\n\n \/** Return <TRUE\/> when the cache is full, i.e. the cache compactor had\n to be run.\n *\/\n bool IsFull (void) const;\n\n \/** Return the memory size that is occupied by all non-precious bitmaps\n in the cache.\n *\/\n sal_Int32 GetSize (void);\n\n \/** Return <TRUE\/> when a preview bitmap exists for the given key.\n *\/\n bool HasBitmap (const CacheKey& rKey);\n\n \/** Return <TRUE\/> when a preview bitmap exists for the given key and\n when it is up-to-date.\n *\/\n bool BitmapIsUpToDate (const CacheKey& rKey);\n\n \/** Return the preview bitmap for the given contact object.\n *\/\n ::boost::shared_ptr<BitmapEx> GetBitmap (const CacheKey& rKey);\n\n \/** Release the reference to the preview bitmap that is associated with\n the given key.\n *\/\n void ReleaseBitmap (const CacheKey& rKey);\n\n \/** Mark the specified preview bitmap as not being up-to-date anymore.\n *\/\n void InvalidateBitmap (const CacheKey& rKey);\n\n \/** Mark all preview bitmaps as not being up-to-date anymore.\n *\/\n void InvalidateCache (void);\n\n \/** Add or replace a bitmap for the given key.\n *\/\n void SetBitmap (\n const CacheKey& rKey,\n const ::boost::shared_ptr<BitmapEx>& rpPreview,\n bool bIsPrecious);\n\n \/** Return whether the specified preview bitmap has been marked as\n precious.\n *\/\n bool IsPrecious (const CacheKey& rKey);\n\n \/** Mark the specified preview bitmap as precious, i.e. that it must not\n be compressed or otherwise removed from the cache.\n *\/\n void SetPrecious (const CacheKey& rKey, bool bIsPrecious);\n\n \/** Calculate the cache size. This should rarely be necessary because\n the cache size is tracked with each modification of preview\n bitmaps.\n *\/\n void ReCalculateTotalCacheSize (void);\n\n \/** Use the previews in the given cache to initialize missing previews.\n *\/\n void Recycle (const BitmapCache& rCache);\n\n \/** Return a list of sorted cache keys that represent an index into (a\n part of) the cache. The entries of the index are sorted according\n to last access times with the least recently access time first.\n @param bIncludePrecious\n When this flag is <TRUE\/> entries with the precious flag set are\n included in the index. When the flag is <FALSE\/> these entries\n are ommited.\n @param bIncludeNoPreview\n When this flag is <TRUE\/> entries with that have no preview\n bitmaps are included in the index. When the flag is <FALSE\/> these entries\n are ommited.\n *\/\n ::std::auto_ptr<CacheIndex> GetCacheIndex (\n bool bIncludePrecious,\n bool bIncludeNoPreview) const;\n\n \/** Compress the specified preview bitmap with the given bitmap\n compressor. A reference to the compressor is stored for later\n decompression.\n *\/\n void Compress (\n const CacheKey& rKey,\n const ::boost::shared_ptr<BitmapCompressor>& rpCompressor);\n\nprivate:\n mutable ::osl::Mutex maMutex;\n\n ::std::auto_ptr<CacheBitmapContainer> mpBitmapContainer;\n\n \/** Total size of bytes that are occupied by bitmaps in the cache for\n whom the slides are currently not inside the visible area.\n *\/\n sal_Int32 mnNormalCacheSize;\n\n \/** Total size of bytes that are occupied by bitmaps in the cache for\n whom the slides are currently visible.\n *\/\n sal_Int32 mnPreciousCacheSize;\n\n \/** At the moment the access time is not an actual time or date value\n but a counter that is increased with every access. It thus defines\n the same ordering as a true time.\n *\/\n sal_Int32 mnCurrentAccessTime;\n\n \/** The maximal cache size for the off-screen preview bitmaps. When\n mnNormalCacheSize grows larger than this value then the\n mpCacheCompactor member is used to reduce the cache size.\n *\/\n sal_Int32 mnMaximalNormalCacheSize;\n\n \/** The cache compactor is used to reduce the number of bytes used by\n off-screen preview bitmaps.\n *\/\n ::std::auto_ptr<CacheCompactor> mpCacheCompactor;\n\n \/** This flag stores if the cache is or recently was full, i.e. the\n cache compactor has or had to be run in order to reduce the cache\n size to the allowed value.\n *\/\n bool mbIsFull;\n\n \/** Update mnNormalCacheSize or mnPreciousCacheSize according to the\n precious flag of the specified preview bitmap and the specified\n operation.\n *\/\n enum CacheOperation { ADD, REMOVE };\n void UpdateCacheSize (const CacheEntry& rKey, CacheOperation eOperation);\n};\n\n\n\n} } } \/\/ end of namespace ::sd::slidesorter::cache\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"sock.h\"\n#include <sstream>\n#include <string>\n#include <tr1\/cstdint>\n#include <sys\/types.h>\n#include <netdb.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <unistd.h>\n#include <arpa\/inet.h>\n#include <fcntl.h>\n#include <netinet\/tcp.h>\n\n\nusing std::string;\n\n\n\nstatic inline\nbool load_peerinfo(int sock, string& host, uint16_t& port)\n{\n\tsockaddr_in addr;\n\tsocklen_t len;\n\n\t\/\/ Load info about the other end (the peer)\n\tlen = sizeof(addr);\n\tif (getpeername(sock, reinterpret_cast<sockaddr*>(&addr), &len) == -1)\n\t\treturn false;\n\n\t\/\/ Extract the hostname and remote port\n\tchar name[INET_ADDRSTRLEN];\n\tif (getnameinfo(reinterpret_cast<sockaddr*>(&addr), (socklen_t) sizeof(addr), name, sizeof(name), NULL, 0, NI_NUMERICHOST) != 0)\n\t\treturn false;\n\n\thost = std::string(name);\n\tport = ntohs(addr.sin_port);\n\n\treturn true;\n}\n\n\n\nstatic inline\nbool load_addrinfo(addrinfo*& info, const char* host, uint16_t port)\n{\n\taddrinfo hints;\n\n\tmemset(&hints, 0, sizeof(hints));\n\thints.ai_family = AF_INET;\n\thints.ai_socktype = SOCK_STREAM;\n\thints.ai_flags = host == NULL ? AI_PASSIVE : 0;\n\n\tstd::ostringstream converter;\n\tconverter << port;\n\n\treturn getaddrinfo(host, converter.str().c_str(), &hints, &info) == 0;\n}\n\n\n\nstatic inline\nbool bind_port(int sock, uint16_t port)\n{\n\tsockaddr_in addr;\n\n\tmemset(&addr, 0, sizeof(addr));\n\taddr.sin_family = AF_INET;\n\taddr.sin_addr.s_addr = INADDR_ANY;\n\taddr.sin_port = htons(port);\n\n\t\/\/ Set the port to quickly reusable, so subsequent connections can quickly\n\t\/\/ reuse the port\n\tint flag = 1;\n\tsetsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &flag, sizeof(flag));\n\n\treturn bind(sock, reinterpret_cast<sockaddr*>(&addr), sizeof(addr));\n}\n\n\n\nint Sock::create(uint16_t port)\n{\n\taddrinfo *ptr, *info = NULL;\n\n\t\/\/ Get info about the service\/port\n\tif (!load_addrinfo(info, NULL, port))\n\t{\n\t\tif (info != NULL)\n\t\t\tfreeaddrinfo(info);\n\n\t\treturn -1;\n\t}\n\n\tint sock = -1;\n\tfor (ptr = info; ptr != NULL; ptr = ptr->ai_next)\n\t{\n\t\t\/\/ Try to create a socket descriptor\n\t\tif ((sock = socket(ptr->ai_family, ptr->ai_socktype, ptr->ai_protocol)) == -1)\n\t\t\tcontinue;\n\n\t\t\/\/ Set port to be reusable\n\t\tint flag = 1;\n\t\tsetsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &flag, sizeof(flag));\n\n\t\t\/\/ Try to bind to the port and listen\n\t\tif (bind(sock, ptr->ai_addr, ptr->ai_addrlen) == 0\n\t\t\t\t&& listen(sock, SOMAXCONN) == 0)\n\t\t\tbreak;\n\n\t\t\/\/ Failed, close socket and try again\n\t\t::close(sock);\n\t}\n\n\tif (info != NULL)\n\t\tfreeaddrinfo(info);\n\n\tif (ptr == NULL)\n\t\treturn -1;\n\n\treturn sock;\n}\n\n\n\nint Sock::create(const char* host, uint16_t rem_port, uint16_t loc_port)\n{\n\taddrinfo *ptr, *info = NULL;\n\n\t\/\/ Get info about the service\/port\n\tif (!load_addrinfo(info, host, rem_port))\n\t{\n\t\tif (info != NULL)\n\t\t\tfreeaddrinfo(info);\n\n\t\treturn -1;\n\t}\n\n\tint sock = -1;\n\tfor (ptr = info; ptr != NULL; ptr = ptr->ai_next)\n\t{\n\t\t\/\/ Try to create a socket descriptor\n\t\tif ((sock = socket(ptr->ai_family, ptr->ai_socktype, ptr->ai_protocol)) == -1)\n\t\t\tcontinue;\n\n\t\t\/\/ Turn off Nagle's algorithm\n\t\tint flag = 1;\n\t\tsetsockopt(sock, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n\n\n\t\t\/\/ If a local port is given, try to bind to that port\n\t\tif (loc_port != 0)\n\t\t{\n\t\t\tbind_port(sock, loc_port);\n\t\t}\n\n\t\t\/\/ Try to connect to the remote host\n\t\tif (connect(sock, ptr->ai_addr, ptr->ai_addrlen) != -1)\n\t\t\tbreak;\n\n\t\t\/\/ Failed, close socket and try again\n\t\t::close(sock);\n\t}\n\n\tif (info != NULL)\n\t\tfreeaddrinfo(info);\n\n\tif (ptr == NULL)\n\t\treturn -1;\n\n\treturn sock;\n}\n\n\n\nint Sock::create(const char* host, uint16_t port)\n{\n\treturn create(host, port, 0);\n}\n\n\n\nstatic\nvoid close_sock(int* sfd)\n{\n\tif (*sfd != -1)\n\t\t::close(*sfd);\n\n\tdelete sfd;\n}\n\n\n\nSock::Sock(int fd)\n\t: sfd( new int(fd), &close_sock )\n{\n\t\/\/ TODO: Check if valid socket descriptor\n\n\t\/\/ Set descriptor to non-blocking\n\tif (*sfd != -1)\n\t{\n\t\tint flag = fcntl(*sfd, F_GETFL, 0);\n\t\tfcntl(*sfd, F_SETFL, flag | O_NONBLOCK);\n\t}\n}\n\n\n\nbool Sock::connected()\n{\n\tif (*sfd != -1)\n\t{\n\t\tint flag = 0;\n\t\tsocklen_t len = sizeof(flag);\n\t\tgetsockopt(*sfd, SOL_SOCKET, SO_ACCEPTCONN, &flag, &len);\n\t\treturn flag != 0;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\n\nint Sock::raw()\n{\n\treturn *sfd;\n}\n\n\n\nbool Sock::peer(string& name)\n{\n\tuint16_t port;\n\treturn *sfd != -1 && load_peerinfo(*sfd, name, port);\n}\n\n\n\nbool Sock::peer(uint16_t& port)\n{\n\tstring name;\n\treturn *sfd != -1 && load_peerinfo(*sfd, name, port);\n}\n\n\n\nbool Sock::host(uint16_t& port)\n{\n\tif (*sfd != -1)\n\t{\n\t\tsockaddr_in addr;\n\n\t\tsocklen_t len = sizeof(addr);\n\t\tif (getsockname(*sfd, reinterpret_cast<sockaddr*>(&addr), &len) == -1)\n\t\t\treturn false;\n\n\t\tport = ntohs(addr.sin_port);\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\n\nvoid Sock::close()\n{\n\tif (*sfd != -1)\n\t{\n\t\t::close(*sfd);\n\t\t*sfd = -1;\n\t}\n}\n<commit_msg>added a TODO<commit_after>#include \"sock.h\"\n#include <sstream>\n#include <string>\n#include <tr1\/cstdint>\n#include <sys\/types.h>\n#include <netdb.h>\n#include <string.h>\n#include <sys\/socket.h>\n#include <unistd.h>\n#include <arpa\/inet.h>\n#include <fcntl.h>\n#include <netinet\/tcp.h>\n\n\nusing std::string;\n\n\n\nstatic inline\nbool load_peerinfo(int sock, string& host, uint16_t& port)\n{\n\tsockaddr_in addr;\n\tsocklen_t len;\n\n\t\/\/ Load info about the other end (the peer)\n\tlen = sizeof(addr);\n\tif (getpeername(sock, reinterpret_cast<sockaddr*>(&addr), &len) == -1)\n\t\treturn false;\n\n\t\/\/ Extract the hostname and remote port\n\tchar name[INET_ADDRSTRLEN];\n\tif (getnameinfo(reinterpret_cast<sockaddr*>(&addr), (socklen_t) sizeof(addr), name, sizeof(name), NULL, 0, NI_NUMERICHOST) != 0)\n\t\treturn false;\n\n\thost = std::string(name);\n\tport = ntohs(addr.sin_port);\n\n\treturn true;\n}\n\n\n\nstatic inline\nbool load_addrinfo(addrinfo*& info, const char* host, uint16_t port)\n{\n\taddrinfo hints;\n\n\tmemset(&hints, 0, sizeof(hints));\n\thints.ai_family = AF_INET;\n\thints.ai_socktype = SOCK_STREAM;\n\thints.ai_flags = host == NULL ? AI_PASSIVE : 0;\n\n\tstd::ostringstream converter;\n\tconverter << port;\n\n\treturn getaddrinfo(host, converter.str().c_str(), &hints, &info) == 0;\n}\n\n\n\nstatic inline\nbool bind_port(int sock, uint16_t port)\n{\n\tsockaddr_in addr;\n\n\tmemset(&addr, 0, sizeof(addr));\n\taddr.sin_family = AF_INET;\n\taddr.sin_addr.s_addr = INADDR_ANY;\n\taddr.sin_port = htons(port);\n\n\t\/\/ Set the port to quickly reusable, so subsequent connections can quickly\n\t\/\/ reuse the port\n\tint flag = 1;\n\tsetsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &flag, sizeof(flag));\n\n\treturn bind(sock, reinterpret_cast<sockaddr*>(&addr), sizeof(addr));\n}\n\n\n\nint Sock::create(uint16_t port)\n{\n\taddrinfo *ptr, *info = NULL;\n\n\t\/\/ Get info about the service\/port\n\tif (!load_addrinfo(info, NULL, port))\n\t{\n\t\tif (info != NULL)\n\t\t\tfreeaddrinfo(info);\n\n\t\treturn -1;\n\t}\n\n\tint sock = -1;\n\tfor (ptr = info; ptr != NULL; ptr = ptr->ai_next)\n\t{\n\t\t\/\/ Try to create a socket descriptor\n\t\tif ((sock = socket(ptr->ai_family, ptr->ai_socktype, ptr->ai_protocol)) == -1)\n\t\t\tcontinue;\n\n\t\t\/\/ Set port to be reusable\n\t\tint flag = 1;\n\t\tsetsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &flag, sizeof(flag));\n\n\t\t\/\/ Try to bind to the port and listen\n\t\tif (bind(sock, ptr->ai_addr, ptr->ai_addrlen) == 0\n\t\t\t\t&& listen(sock, SOMAXCONN) == 0)\n\t\t\tbreak;\n\n\t\t\/\/ Failed, close socket and try again\n\t\t::close(sock);\n\t}\n\n\tif (info != NULL)\n\t\tfreeaddrinfo(info);\n\n\tif (ptr == NULL)\n\t\treturn -1;\n\n\treturn sock;\n}\n\n\n\nint Sock::create(const char* host, uint16_t rem_port, uint16_t loc_port)\n{\n\taddrinfo *ptr, *info = NULL;\n\n\t\/\/ Get info about the service\/port\n\tif (!load_addrinfo(info, host, rem_port))\n\t{\n\t\tif (info != NULL)\n\t\t\tfreeaddrinfo(info);\n\n\t\treturn -1;\n\t}\n\n\tint sock = -1;\n\tfor (ptr = info; ptr != NULL; ptr = ptr->ai_next)\n\t{\n\t\t\/\/ Try to create a socket descriptor\n\t\tif ((sock = socket(ptr->ai_family, ptr->ai_socktype, ptr->ai_protocol)) == -1)\n\t\t\tcontinue;\n\n\t\t\/\/ Turn off Nagle's algorithm\n\t\tint flag = 1;\n\t\tsetsockopt(sock, IPPROTO_TCP, TCP_NODELAY, &flag, sizeof(flag));\n\n\n\t\t\/\/ If a local port is given, try to bind to that port\n\t\tif (loc_port != 0)\n\t\t{\n\t\t\tbind_port(sock, loc_port);\n\t\t}\n\n\t\t\/\/ Try to connect to the remote host\n\t\tif (connect(sock, ptr->ai_addr, ptr->ai_addrlen) != -1)\n\t\t\tbreak;\n\n\t\t\/\/ Failed, close socket and try again\n\t\t::close(sock);\n\t}\n\n\tif (info != NULL)\n\t\tfreeaddrinfo(info);\n\n\tif (ptr == NULL)\n\t\treturn -1;\n\n\treturn sock;\n}\n\n\n\nint Sock::create(const char* host, uint16_t port)\n{\n\treturn create(host, port, 0);\n}\n\n\n\nstatic\nvoid close_sock(int* sfd)\n{\n\tif (*sfd != -1)\n\t\t::close(*sfd);\n\n\tdelete sfd;\n}\n\n\n\nSock::Sock(int fd)\n\t: sfd( new int(fd), &close_sock )\n{\n\t\/\/ TODO: Check if valid socket descriptor\n\n\t\/\/ Set descriptor to non-blocking\n\tif (*sfd != -1)\n\t{\n\t\tint flag = fcntl(*sfd, F_GETFL, 0);\n\t\tfcntl(*sfd, F_SETFL, flag | O_NONBLOCK);\n\t}\n}\n\n\n\nbool Sock::connected()\n{\n\tif (*sfd != -1)\n\t{\n\t\t\/\/ TODO: Check if descriptor is still alive\n\t\tint flag = 0;\n\t\tsocklen_t len = sizeof(flag);\n\t\tgetsockopt(*sfd, SOL_SOCKET, SO_ACCEPTCONN, &flag, &len);\n\t\treturn flag != 0;\n\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\n\nint Sock::raw()\n{\n\treturn *sfd;\n}\n\n\n\nbool Sock::peer(string& name)\n{\n\tuint16_t port;\n\treturn *sfd != -1 && load_peerinfo(*sfd, name, port);\n}\n\n\n\nbool Sock::peer(uint16_t& port)\n{\n\tstring name;\n\treturn *sfd != -1 && load_peerinfo(*sfd, name, port);\n}\n\n\n\nbool Sock::host(uint16_t& port)\n{\n\tif (*sfd != -1)\n\t{\n\t\tsockaddr_in addr;\n\n\t\tsocklen_t len = sizeof(addr);\n\t\tif (getsockname(*sfd, reinterpret_cast<sockaddr*>(&addr), &len) == -1)\n\t\t\treturn false;\n\n\t\tport = ntohs(addr.sin_port);\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\n\n\nvoid Sock::close()\n{\n\tif (*sfd != -1)\n\t{\n\t\t::close(*sfd);\n\t\t*sfd = -1;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"math\/vec.hpp\"\n#include \"math\/mat.hpp\"\n#include \"math\/MatrixTransform.hpp\"\n#include \"math\/Sphere.hpp\"\n#include \"math\/misc.hpp\"\n#include \"math\/Ray.hpp\"\n#include \"math\/TransformPair.hpp\"\n#include \"noncopyable.hpp\"\n#include \"output.hpp\"\n#include \"Optional.hpp\"\n#include <vector>\n#include <memory>\n#include <algorithm>\n#include <limits>\n\nusing namespace yks;\n\nstruct Material {\n\tvec3 diffuse;\n\n\tMaterial(vec3 diffuse)\n\t\t: diffuse(diffuse)\n\t{}\n};\n\nstruct SceneObject;\nstruct SceneShape;\n\nstruct Intersection {\n\tfloat t;\n\tvec3 position;\n\tvec3 normal;\n\tvec2 uv;\n\n\tconst SceneObject* object;\n\tconst SceneShape* shape;\n};\n\nstruct SceneShape {\n\tTransformPair transform;\n\n\tSceneShape(TransformPair transform)\n\t\t: transform(std::move(transform))\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const = 0;\n\n\tOptional<float> hasIntersection(const Ray& r, float max_t) const {\n\t\tconst Optional<float> t = hasIntersection(r);\n\t\tif (t && *t > max_t) {\n\t\t\treturn Optional<float>();\n\t\t}\n\t\treturn t;\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const = 0;\n\n\tOptional<Intersection> intersect(const Ray& r, float max_t) const {\n\t\tconst Optional<Intersection> intersection = intersect(r);\n\t\tif (intersection && intersection->t > max_t) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\t\treturn intersection;\n\t}\n};\n\nstruct ShapeSphere : SceneShape {\n\tShapeSphere(TransformPair transform)\n\t\t: SceneShape(transform)\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst vec3 o = local_ray.origin;\n\t\tconst vec3 v = local_ray.direction;\n\n\t\tfloat t1, t2;\n\t\tconst int solutions = solve_quadratic(dot(v, v), 2*dot(o, v), dot(o, o) - 1.0f, t1, t2);\n\t\t\n\t\tif (solutions > 0) {\n\t\t\treturn make_optional<float>(t1);\n\t\t} else {\n\t\t\treturn Optional<float>();\n\t\t}\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst vec3 o = local_ray.origin;\n\t\tconst vec3 v = local_ray.direction;\n\n\t\tfloat t1, t2;\n\t\tconst int solutions = solve_quadratic(dot(v, v), 2*dot(o, v), dot(o, o) - 1.0f, t1, t2);\n\n\t\tif (solutions == 0) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\n\t\tIntersection i;\n\t\ti.t = t1;\n\t\ti.position = r(t1);\n\t\tvec3 local_pos = local_ray(t1);\n\t\ti.uv = mvec2(std::atan2(local_pos[2], local_pos[0]) \/ (2*pi) + 0.5f, std::acos(local_pos[1]) \/ pi);\n\t\ti.normal = mvec3(transpose(transform.localFromParent) * mvec4(normalized(local_ray(t1)), 0.0f));\n\t\treturn make_optional<Intersection>(i);\n\t}\n};\n\nstruct ShapePlane : SceneShape {\n\tShapePlane(TransformPair transform)\n\t\t: SceneShape(std::move(transform))\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst float t = -local_ray.origin[1] \/ local_ray.direction[1];\n\t\treturn make_optional<float>(t);\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst float t = -local_ray.origin[1] \/ local_ray.direction[1];\n\t\tif (t < 0.0f) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\t\tIntersection i;\n\t\ti.t = t;\n\t\ti.position = r(t);\n\t\ti.uv = mvec2(0.0f, 0.0f);\n\t\ti.normal = mvec3(transpose(transform.localFromParent) * mvec4(vec3_y, 0.0f));\n\t\treturn make_optional<Intersection>(i);\n\t}\n};\n\nstruct SceneObject {\n\tMaterial material;\n\tstd::unique_ptr<SceneShape> shape;\n\n\tSceneObject(Material material, std::unique_ptr<SceneShape>&& shape)\n\t\t: material(material), shape(std::move(shape))\n\t{}\n\n\tSceneObject(SceneObject&& o)\n\t\t: material(std::move(o.material)), shape(std::move(o.shape))\n\t{}\n\nprivate:\n\tNONCOPYABLE(SceneObject);\n};\n\nstruct SceneLight {\n\tvec3 origin;\n\tvec3 intensity;\n};\n\nfloat focal_distance_from_fov(const float fov_degrees) {\n\tconst float half_fov = fov_degrees \/ 360.0f * pi;\n\treturn std::tan(0.5f*pi - half_fov);\n}\n\nstruct Camera {\n\tvec3 origin;\n\tmat3 orientation;\n\tfloat focal_length; \/\/ distance from image plane\n\n\tCamera(vec3 origin, mat3 orientation, float vertical_fov)\n\t\t: origin(origin), orientation(orientation), focal_length(focal_distance_from_fov(vertical_fov))\n\t{}\n\n\tRay createRay(const vec2 film_pos) const {\n\t\tconst vec3 cameraspace_ray = mvec3(film_pos[0], film_pos[1], focal_length);\n\t\treturn Ray{origin, orientation * cameraspace_ray};\n\t}\n};\n\nstruct Scene {\n\tCamera camera;\n\tstd::vector<SceneObject> objects;\n\n\tScene(Camera camera)\n\t\t: camera(camera)\n\t{}\n\n\tScene(Scene&& o)\n\t\t: camera(std::move(o.camera)), objects(std::move(o.objects))\n\t{}\n\nprivate:\n\tNONCOPYABLE(Scene);\n};\n\nScene setup_scene() {\n\tScene s(Camera(vec3_0, orient(vec3_y, vec3_z), 75.0f));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(vec3_1),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().translate(vec3_z * 2))\n\t\t));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(mvec3(0.5f, 0.0f, 0.0f)),\n\t\tstd::make_unique<ShapePlane>(TransformPair().translate(vec3_y * -1.5f))\n\t\t));\n\n\treturn std::move(s);\n}\n\nstatic vec2 filmspace_from_screenspace(const vec2 screen_pos, const vec2 screen_size) {\n\treturn (screen_pos - (screen_size * 0.5f)) * 2.0f * (1.0f \/ screen_size[1]);\n}\n\nOptional<Intersection> find_nearest_intersection(const Scene& scene, const Ray ray) {\n\tOptional<Intersection> nearest_intersection;\n\n\tfor (const SceneObject& object : scene.objects) {\n\t\tconst Optional<Intersection> intersection = object.shape->intersect(ray);\n\t\tif (intersection && (!nearest_intersection || intersection->t < nearest_intersection->t)) {\n\t\t\tnearest_intersection = intersection;\n\t\t\tnearest_intersection->object = &object;\n\t\t\tnearest_intersection->shape = object.shape.get();\n\t\t}\n\t}\n\t\n\treturn nearest_intersection;\n}\n\nint main(int, char* []) {\n\tstatic const int IMAGE_WIDTH = 1280;\n\tstatic const int IMAGE_HEIGHT = 720;\n\tstd::vector<vec3> image_data(IMAGE_WIDTH * IMAGE_HEIGHT);\n\n\tconst Scene scene = setup_scene();\n\n\tfor (int y = 0; y < IMAGE_HEIGHT; ++y) {\n\t\tfor (int x = 0; x < IMAGE_WIDTH; x++) {\n\t\t\tconst vec2 film_coord = filmspace_from_screenspace(mvec2(float(x), float(y)), mvec2(float(IMAGE_WIDTH), float(IMAGE_HEIGHT))) * mvec2(1.0f, -1.0f);\n\t\t\tconst Ray camera_ray = scene.camera.createRay(film_coord);\n\n\t\t\tconst Optional<Intersection> hit = find_nearest_intersection(scene, camera_ray);\n\t\t\tconst vec3 color = hit ? hit->normal * 0.5f + vec3_1 * 0.5f : vec3_1*0.1f;\n\t\t\t\/\/const vec3 color = hit ? hit->object->material.diffuse : vec3_1*0.1f;\n\t\t\t\n\t\t\timage_data[y*IMAGE_WIDTH + x] = color;\n\t\t}\n\t}\n\n\tsave_srgb_image(image_data, IMAGE_WIDTH, IMAGE_HEIGHT);\n}<commit_msg>Basic lighting.<commit_after>#include \"math\/vec.hpp\"\n#include \"math\/mat.hpp\"\n#include \"math\/MatrixTransform.hpp\"\n#include \"math\/Sphere.hpp\"\n#include \"math\/misc.hpp\"\n#include \"math\/Ray.hpp\"\n#include \"math\/TransformPair.hpp\"\n#include \"noncopyable.hpp\"\n#include \"output.hpp\"\n#include \"Optional.hpp\"\n#include <vector>\n#include <memory>\n#include <algorithm>\n#include <limits>\n\nusing namespace yks;\n\nstruct Material {\n\tvec3 diffuse;\n\n\tMaterial(vec3 diffuse)\n\t\t: diffuse(diffuse)\n\t{}\n};\n\nstruct SceneObject;\nstruct SceneShape;\n\nstruct Intersection {\n\tfloat t;\n\tvec3 position;\n\tvec3 normal;\n\tvec2 uv;\n\n\tconst SceneObject* object;\n\tconst SceneShape* shape;\n};\n\nstruct SceneShape {\n\tTransformPair transform;\n\n\tSceneShape(TransformPair transform)\n\t\t: transform(std::move(transform))\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const = 0;\n\n\tOptional<float> hasIntersection(const Ray& r, float max_t) const {\n\t\tconst Optional<float> t = hasIntersection(r);\n\t\tif (t && *t > max_t) {\n\t\t\treturn Optional<float>();\n\t\t}\n\t\treturn t;\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const = 0;\n\n\tOptional<Intersection> intersect(const Ray& r, float max_t) const {\n\t\tconst Optional<Intersection> intersection = intersect(r);\n\t\tif (intersection && intersection->t > max_t) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\t\treturn intersection;\n\t}\n};\n\nstruct ShapeSphere : SceneShape {\n\tShapeSphere(TransformPair transform)\n\t\t: SceneShape(transform)\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst vec3 o = local_ray.origin;\n\t\tconst vec3 v = local_ray.direction;\n\n\t\tfloat t1, t2;\n\t\tconst int solutions = solve_quadratic(dot(v, v), 2*dot(o, v), dot(o, o) - 1.0f, t1, t2);\n\t\t\n\t\tif (solutions > 0) {\n\t\t\treturn make_optional<float>(t1);\n\t\t} else {\n\t\t\treturn Optional<float>();\n\t\t}\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst vec3 o = local_ray.origin;\n\t\tconst vec3 v = local_ray.direction;\n\n\t\tfloat t1, t2;\n\t\tconst int solutions = solve_quadratic(dot(v, v), 2*dot(o, v), dot(o, o) - 1.0f, t1, t2);\n\n\t\tif (solutions == 0) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\n\t\tIntersection i;\n\t\ti.t = t1;\n\t\ti.position = r(t1);\n\t\tvec3 local_pos = local_ray(t1);\n\t\ti.uv = mvec2(std::atan2(local_pos[2], local_pos[0]) \/ (2*pi) + 0.5f, std::acos(local_pos[1]) \/ pi);\n\t\ti.normal = mvec3(transpose(transform.localFromParent) * mvec4(normalized(local_ray(t1)), 0.0f));\n\t\treturn make_optional<Intersection>(i);\n\t}\n};\n\nstruct ShapePlane : SceneShape {\n\tShapePlane(TransformPair transform)\n\t\t: SceneShape(std::move(transform))\n\t{}\n\n\tvirtual Optional<float> hasIntersection(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst float t = -local_ray.origin[1] \/ local_ray.direction[1];\n\t\treturn make_optional<float>(t);\n\t}\n\n\tvirtual Optional<Intersection> intersect(const Ray& r) const override {\n\t\tconst Ray local_ray = transform.localFromParent * r;\n\t\tconst float t = -local_ray.origin[1] \/ local_ray.direction[1];\n\t\tif (t < 0.0f) {\n\t\t\treturn Optional<Intersection>();\n\t\t}\n\t\tIntersection i;\n\t\ti.t = t;\n\t\ti.position = r(t);\n\t\ti.uv = mvec2(0.0f, 0.0f);\n\t\ti.normal = mvec3(transpose(transform.localFromParent) * mvec4(vec3_y, 0.0f));\n\t\treturn make_optional<Intersection>(i);\n\t}\n};\n\nstruct SceneObject {\n\tMaterial material;\n\tstd::unique_ptr<SceneShape> shape;\n\n\tSceneObject(Material material, std::unique_ptr<SceneShape>&& shape)\n\t\t: material(material), shape(std::move(shape))\n\t{}\n\n\tSceneObject(SceneObject&& o)\n\t\t: material(std::move(o.material)), shape(std::move(o.shape))\n\t{}\n\nprivate:\n\tNONCOPYABLE(SceneObject);\n};\n\nstruct SceneLight {\n\tvec3 origin;\n\tvec3 intensity;\n\n\tSceneLight(const vec3& origin, const vec3& intensity)\n\t\t: origin(origin), intensity(intensity)\n\t{}\n};\n\nfloat focal_distance_from_fov(const float fov_degrees) {\n\tconst float half_fov = fov_degrees \/ 360.0f * pi;\n\treturn std::tan(0.5f*pi - half_fov);\n}\n\nstruct Camera {\n\tvec3 origin;\n\tmat3 orientation;\n\tfloat focal_length; \/\/ distance from image plane\n\n\tCamera(vec3 origin, mat3 orientation, float vertical_fov)\n\t\t: origin(origin), orientation(orientation), focal_length(focal_distance_from_fov(vertical_fov))\n\t{}\n\n\tRay createRay(const vec2 film_pos) const {\n\t\tconst vec3 cameraspace_ray = mvec3(film_pos[0], film_pos[1], focal_length);\n\t\treturn Ray{origin, orientation * cameraspace_ray};\n\t}\n};\n\nstruct Scene {\n\tCamera camera;\n\tstd::vector<SceneObject> objects;\n\tstd::vector<SceneLight> lights;\n\n\tScene(Camera camera)\n\t\t: camera(camera)\n\t{}\n\n\tScene(Scene&& o)\n\t\t: camera(std::move(o.camera)), objects(std::move(o.objects)), lights(std::move(o.lights))\n\t{}\n\nprivate:\n\tNONCOPYABLE(Scene);\n};\n\nScene setup_scene() {\n\tScene s(Camera(vec3_0, orient(vec3_y, -vec3_z), 75.0f));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(vec3_1),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().translate(mvec3(0.0f, 0.0f, -5.0f)))\n\t\t));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(mvec3(0.5f, 0.0f, 0.0f)),\n\t\tstd::make_unique<ShapePlane>(TransformPair().translate(vec3_y * -1.0f))\n\t\t));\n\n\ts.lights.push_back(SceneLight(mvec3(-3.0f, 6.0f, 1.0f), vec3_1));\n\n\treturn std::move(s);\n}\n\nstatic vec2 filmspace_from_screenspace(const vec2 screen_pos, const vec2 screen_size) {\n\treturn (screen_pos - (screen_size * 0.5f)) * 2.0f * (1.0f \/ screen_size[1]);\n}\n\nOptional<Intersection> find_nearest_intersection(const Scene& scene, const Ray ray) {\n\tOptional<Intersection> nearest_intersection;\n\n\tfor (const SceneObject& object : scene.objects) {\n\t\tconst Optional<Intersection> intersection = object.shape->intersect(ray);\n\t\tif (intersection && (!nearest_intersection || intersection->t < nearest_intersection->t)) {\n\t\t\tnearest_intersection = intersection;\n\t\t\tnearest_intersection->object = &object;\n\t\t\tnearest_intersection->shape = object.shape.get();\n\t\t}\n\t}\n\t\n\treturn nearest_intersection;\n}\n\nint main(int, char* []) {\n\tstatic const int IMAGE_WIDTH = 1280;\n\tstatic const int IMAGE_HEIGHT = 720;\n\tstd::vector<vec3> image_data(IMAGE_WIDTH * IMAGE_HEIGHT);\n\n\tconst Scene scene = setup_scene();\n\n\tfor (int y = 0; y < IMAGE_HEIGHT; ++y) {\n\t\tfor (int x = 0; x < IMAGE_WIDTH; x++) {\n\t\t\tconst vec2 film_coord = filmspace_from_screenspace(mvec2(float(x), float(y)), mvec2(float(IMAGE_WIDTH), float(IMAGE_HEIGHT))) * mvec2(1.0f, -1.0f);\n\t\t\tconst Ray camera_ray = scene.camera.createRay(film_coord);\n\n\t\t\tvec3 color = vec3_0;\n\n\t\t\tconst Optional<Intersection> surface_hit = find_nearest_intersection(scene, camera_ray);\n\t\t\tif (surface_hit) {\n\t\t\t\tfor (const SceneLight& light : scene.lights) {\n\t\t\t\t\tconst vec3 light_dir = normalized(light.origin - surface_hit->position);\n\t\t\t\t\tcolor += surface_hit->object->material.diffuse * dot(light_dir, surface_hit->normal);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcolor = vec3_1 * 0.1f;\n\t\t\t}\n\t\t\t\n\t\t\timage_data[y*IMAGE_WIDTH + x] = color;\n\t\t}\n\t}\n\n\tsave_srgb_image(image_data, IMAGE_WIDTH, IMAGE_HEIGHT);\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: DDriver.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 07:03:10 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_DBASE_DDRIVER_HXX_\n#define _CONNECTIVITY_DBASE_DDRIVER_HXX_\n\n#ifndef _CPPUHELPER_COMPBASE2_HXX_\n#include <cppuhelper\/compbase2.hxx>\n#endif\n#ifndef _CONNECTIVITY_COMMONTOOLS_HXX_\n#include \"connectivity\/CommonTools.hxx\"\n#endif\n#ifndef _CONNECTIVITY_FILE_ODRIVER_HXX_\n#include \"file\/FDriver.hxx\"\n#endif\n\nnamespace connectivity\n{\n namespace dbase\n {\n\n ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL ODriver_CreateInstance(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) throw( ::com::sun::star::uno::Exception );\n\n class ODriver : public file::OFileDriver\n {\n public:\n ODriver(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) : file::OFileDriver(_rxFactory){}\n\n \/\/ XInterface\n static ::rtl::OUString getImplementationName_Static( ) throw(::com::sun::star::uno::RuntimeException);\n \/\/ static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static( ) throw (::com::sun::star::uno::RuntimeException);\n\n ::rtl::OUString SAL_CALL getImplementationName( ) throw(::com::sun::star::uno::RuntimeException);\n \/\/ XDriver\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL connect( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL acceptsURL( const ::rtl::OUString& url ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::com::sun::star::sdbc::DriverPropertyInfo > SAL_CALL getPropertyInfo( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n };\n }\n\n}\n#endif \/\/_CONNECTIVITY_DBASE_DDRIVER_HXX_\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.372); FILE MERGED 2008\/04\/01 15:09:10 thb 1.3.372.3: #i85898# Stripping all external header guards 2008\/04\/01 10:53:25 thb 1.3.372.2: #i85898# Stripping all external header guards 2008\/03\/28 15:24:18 rt 1.3.372.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: DDriver.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_DBASE_DDRIVER_HXX_\n#define _CONNECTIVITY_DBASE_DDRIVER_HXX_\n\n#include <cppuhelper\/compbase2.hxx>\n#include \"connectivity\/CommonTools.hxx\"\n#include \"file\/FDriver.hxx\"\n\nnamespace connectivity\n{\n namespace dbase\n {\n\n ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL ODriver_CreateInstance(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) throw( ::com::sun::star::uno::Exception );\n\n class ODriver : public file::OFileDriver\n {\n public:\n ODriver(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) : file::OFileDriver(_rxFactory){}\n\n \/\/ XInterface\n static ::rtl::OUString getImplementationName_Static( ) throw(::com::sun::star::uno::RuntimeException);\n \/\/ static ::com::sun::star::uno::Sequence< ::rtl::OUString > getSupportedServiceNames_Static( ) throw (::com::sun::star::uno::RuntimeException);\n\n ::rtl::OUString SAL_CALL getImplementationName( ) throw(::com::sun::star::uno::RuntimeException);\n \/\/ XDriver\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::sdbc::XConnection > SAL_CALL connect( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL acceptsURL( const ::rtl::OUString& url ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Sequence< ::com::sun::star::sdbc::DriverPropertyInfo > SAL_CALL getPropertyInfo( const ::rtl::OUString& url, const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& info ) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n };\n }\n\n}\n#endif \/\/_CONNECTIVITY_DBASE_DDRIVER_HXX_\n\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <boost\/foreach.hpp>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost;\n\nvector<string> tokenize(string x); \/\/prototype to tokenize the commands\nvector<string> separateByDelim(vector<string> origVector, string delimiter);\n\/\/function used to separate strings in a vector by a delimiter\nchar *stringToCstring(string z); \/\/converts a string to a cstring \n\nint main()\n{\n string commander; \/\/string to hold the user command\n \n bool restart = true; \/\/keep looping until user enters exit\n int test_state = 1;\n while(restart)\n {\n cout << \"$ \"; \/\/prompt the user\n getline(cin, commander); \/\/takes the entire line of prompts\n vector<string> inter = tokenize(commander); \n\t\/\/calls the tokenize function\n\tinter.push_back(\"\\0\");\n\n vector<char*> tokens;\n char* cmd;\n for(unsigned it = 0; it < inter.size(); it++) \n\t\/\/strings to char*\n {\n cmd = stringToCstring(inter.at(it)); \n tokens.push_back(cmd); \n }\n\tchar **command = &tokens[0];\n\t\n\tint counter = 0;\n for(unsigned i = 0; i < inter.size(); i++)\n {\n if(((inter.at(i) == \";\") || (inter.at(i) == \"||\") || \n (inter.at(i) == \"&&\") || (inter.at(i) == \"#\") ||\n\t\t(inter.at(i) == \"\\0\")))\n {\n pid_t pid = fork(); \/\/creates child process\n int state = 0;\n\n if(pid < 0)\n {\n perror(\"fork failed\\n\"); \/\/if forking fails\n exit(1);\n }\n\n else if(pid == 0)\n {\n\t\t command[counter] = NULL;\n int status = execvp(command[0], command);\n\t\t \n if(status < 0)\n {\n perror(\"execution failed\\n\"); \/\/if command fails\n exit(1);\n }\n }\n \n else\n {\n waitpid(-1, &state, 0);\n if(inter.at(i) == \"&&\" && (state > 0) && (test_state == 0)) \n\t\t\t\/\/when the command is and\n {\n break;\n }\n if(inter.at(i) == \"||\" && ((state <= 0) || (test_state == 1))) \/\/using or\n {\n break;\n }\n\n\t\t if(inter.at(i) == \"#\")\n\t\t {\n\t\t\tbreak;\n\t\t }\n }\n\n\t\tfor(int j = 0; j < counter; j++) \n\t\t\t\/\/makes sure commands don't run again\n\t\t{ \n\t\t command[j] = NULL;\n\t\t}\n\t\tcounter = 0;\n }\n \n else if(inter.at(i) == \"exit\") \/\/user wants to exit\n {\n exit(1);\n\t\treturn 0; \n }\n\n\t else if(inter.at(i) == \"test\" || inter.at(i) == \"[\")\n\t {\n\t\tstring remember = inter.at(i);\n\t\ti++;\n\t\t\/\/increment over test and [\n\t\tstruct stat sb;\n\t\tif(inter.at(i) == \"-d\")\n\t\t{\n\t\t i++;\n\t\t \/\/increments over -d\n\t\t command[counter] = new char[inter[i].size() + 1];\n\t\t copy(inter[i].begin(), inter[i].end(), command[counter]);\n\t\t command[counter][inter[i].size()] = '\\0';\n\t\t counter++;\n\t\t \/\/creates c_string to hold pathname\n\t\t if(stat(command[0], &sb) == 0 && S_ISDIR(sb.st_mode))\n\t\t {\n\t\t test_state = 1;\n\t\t }\n\t\t else\n\t\t {\n\t\t test_state = 0;\n\t\t }\n\t\t}\n\n\t\telse if(inter.at(i) == \"-f\")\n\t\t{\n\t\t i++;\n\t\t \/\/increments over -f\n\t\t command[counter] = new char[inter[i].size() + 1];\n\t\t copy(inter[i].begin(), inter[i].end(), command[counter]);\n\t\t command[counter][inter[i].size()] = '\\0';\n\t\t counter++;\n\t\t \/\/creates c_string to hold pathname\n\t\t if(stat(command[0], &sb) == 0 && S_ISREG(sb.st_mode))\n\t\t {\n\t\t test_state = 1;\n\t\t }\n\t\t else\n\t\t { \n\t\t test_state = 0;\n\t\t }\n\t\t}\n\n\t\telse\n\t\t{\n\t\t if(inter.at(i) != \"-e\")\n\t\t {\n\t\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n \tcommand[counter][inter[i].size()] = '\\0';\n\t\t\tcounter++;\n\t\t\tif(stat(command[0], &sb) == 0)\n\t\t\t{\n\t\t\t test_state = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t test_state = 0;\n\t\t\t}\n\t\t }\n\t\t \n\t\t else\n\t\t {\n\t\t\ti++;\n\t\t\t\/\/increments over -e\n\t\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n \tcommand[counter][inter[i].size()] = '\\0';\n\t\t\tcounter++;\n\t\t\t\/\/creates c_string to hold pathname\n\t\t\tif(stat(command[0], &sb) == 0)\n\t\t\t{\n\t\t\t test_state = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t test_state = 0;\n\t\t\t}\n\t\t } \n\t\t}\n\t\t\n\t\tif(remember == \"[\")\n\t\t{\n\t\t \/\/if the beginning string was [ increment over ]\n\t\t i++;\n\t\t}\n\t\n\t\tfor(int j = 0; j < counter; j++) \n\t\t\/\/makes sure commands don't run again\n\t\t{ \n\t\t command[j] = NULL;\n\t\t}\n\t\tcounter = 0;\n\t }\n\t\t\n\t else \/\/remake the command array\n\t {\n\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n command[counter][inter[i].size()] = '\\0';\n\t\tcounter++;\n\t }\n }\n } \n return 0;\n}\n\nvector<string> tokenize(string x)\n{\n vector<string> tokenVector;\n split(tokenVector, x, is_any_of(\" \"), token_compress_on);\n \/\/ separates by spaces\n\n vector<string> tokenVectorDelim = separateByDelim(tokenVector, \"&&\");\n \/\/ separates by &&\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"||\");\n \/\/separates by ||\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"#\");\n \/\/separates by #\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"[\");\n \/\/separates by [\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"]\");\n \/\/separates by ]\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \";\");\n \/\/separates by ;\n return tokenVectorDelim;\n}\n\nvector<string> separateByDelim(vector<string> origVector, string delimiter)\n{\n vector<string> tokenVectorFinal;\n int pos = 0;\n string oldString;\n string newString;\n for(unsigned l = 0; l < origVector.size(); l++)\n {\n oldString = origVector.at(l);\n\tif((pos = oldString.find(delimiter)) != string::npos\n\t && oldString != delimiter)\n\t{ \n while ((pos = oldString.find(delimiter)) != string::npos) \n {\n\t newString = oldString.substr(0, pos);\n\t tokenVectorFinal.push_back(newString);\n\t\ttokenVectorFinal.push_back(delimiter);\n\t oldString.erase(0, pos + delimiter.length());\n }\n\t tokenVectorFinal.push_back(oldString);\n\t}\n\n\telse\n\t{\n\t tokenVectorFinal.push_back(oldString);\n\t}\n }\n return tokenVectorFinal;\n}\n\nchar *stringToCstring(string z) \/\/makes a char* from a string\n{\n char *cstr = new char[z.length() + 1];\n strcpy(cstr, z.c_str());\n return cstr;\n} \n<commit_msg>fixed unsigned to signed comparison<commit_after>#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <cstdlib>\n#include <boost\/foreach.hpp>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost;\n\nvector<string> tokenize(string x); \/\/prototype to tokenize the commands\nvector<string> separateByDelim(vector<string> origVector, string delimiter);\n\/\/function used to separate strings in a vector by a delimiter\nchar *stringToCstring(string z); \/\/converts a string to a cstring \n\nint main()\n{\n string commander; \/\/string to hold the user command\n \n bool restart = true; \/\/keep looping until user enters exit\n int test_state = 1;\n while(restart)\n {\n cout << \"$ \"; \/\/prompt the user\n getline(cin, commander); \/\/takes the entire line of prompts\n vector<string> inter = tokenize(commander); \n\t\/\/calls the tokenize function\n\tinter.push_back(\"\\0\");\n\n vector<char*> tokens;\n char* cmd;\n for(unsigned it = 0; it < inter.size(); it++) \n\t\/\/strings to char*\n {\n cmd = stringToCstring(inter.at(it)); \n tokens.push_back(cmd); \n }\n\tchar **command = &tokens[0];\n\t\n\tint counter = 0;\n for(unsigned i = 0; i < inter.size(); i++)\n {\n if(((inter.at(i) == \";\") || (inter.at(i) == \"||\") || \n (inter.at(i) == \"&&\") || (inter.at(i) == \"#\") ||\n\t\t(inter.at(i) == \"\\0\")))\n {\n pid_t pid = fork(); \/\/creates child process\n int state = 0;\n\n if(pid < 0)\n {\n perror(\"fork failed\\n\"); \/\/if forking fails\n exit(1);\n }\n\n else if(pid == 0)\n {\n\t\t command[counter] = NULL;\n int status = execvp(command[0], command);\n\t\t \n if(status < 0)\n {\n perror(\"execution failed\\n\"); \/\/if command fails\n exit(1);\n }\n }\n \n else\n {\n waitpid(-1, &state, 0);\n if(inter.at(i) == \"&&\" && (state > 0) && (test_state == 0)) \n\t\t\t\/\/when the command is and\n {\n break;\n }\n if(inter.at(i) == \"||\" && ((state <= 0) || (test_state == 1))) \/\/using or\n {\n break;\n }\n\n\t\t if(inter.at(i) == \"#\")\n\t\t {\n\t\t\tbreak;\n\t\t }\n }\n\n\t\tfor(int j = 0; j < counter; j++) \n\t\t\t\/\/makes sure commands don't run again\n\t\t{ \n\t\t command[j] = NULL;\n\t\t}\n\t\tcounter = 0;\n }\n \n else if(inter.at(i) == \"exit\") \/\/user wants to exit\n {\n exit(1);\n\t\treturn 0; \n }\n\n\t else if(inter.at(i) == \"test\" || inter.at(i) == \"[\")\n\t {\n\t\tstring remember = inter.at(i);\n\t\ti++;\n\t\t\/\/increment over test and [\n\t\tstruct stat sb;\n\t\tif(inter.at(i) == \"-d\")\n\t\t{\n\t\t i++;\n\t\t \/\/increments over -d\n\t\t command[counter] = new char[inter[i].size() + 1];\n\t\t copy(inter[i].begin(), inter[i].end(), command[counter]);\n\t\t command[counter][inter[i].size()] = '\\0';\n\t\t counter++;\n\t\t \/\/creates c_string to hold pathname\n\t\t if(stat(command[0], &sb) == 0 && S_ISDIR(sb.st_mode))\n\t\t {\n\t\t test_state = 1;\n\t\t }\n\t\t else\n\t\t {\n\t\t test_state = 0;\n\t\t }\n\t\t}\n\n\t\telse if(inter.at(i) == \"-f\")\n\t\t{\n\t\t i++;\n\t\t \/\/increments over -f\n\t\t command[counter] = new char[inter[i].size() + 1];\n\t\t copy(inter[i].begin(), inter[i].end(), command[counter]);\n\t\t command[counter][inter[i].size()] = '\\0';\n\t\t counter++;\n\t\t \/\/creates c_string to hold pathname\n\t\t if(stat(command[0], &sb) == 0 && S_ISREG(sb.st_mode))\n\t\t {\n\t\t test_state = 1;\n\t\t }\n\t\t else\n\t\t { \n\t\t test_state = 0;\n\t\t }\n\t\t}\n\n\t\telse\n\t\t{\n\t\t if(inter.at(i) != \"-e\")\n\t\t {\n\t\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n \tcommand[counter][inter[i].size()] = '\\0';\n\t\t\tcounter++;\n\t\t\tif(stat(command[0], &sb) == 0)\n\t\t\t{\n\t\t\t test_state = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t test_state = 0;\n\t\t\t}\n\t\t }\n\t\t \n\t\t else\n\t\t {\n\t\t\ti++;\n\t\t\t\/\/increments over -e\n\t\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n \tcommand[counter][inter[i].size()] = '\\0';\n\t\t\tcounter++;\n\t\t\t\/\/creates c_string to hold pathname\n\t\t\tif(stat(command[0], &sb) == 0)\n\t\t\t{\n\t\t\t test_state = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t test_state = 0;\n\t\t\t}\n\t\t } \n\t\t}\n\t\t\n\t\tif(remember == \"[\")\n\t\t{\n\t\t \/\/if the beginning string was [ increment over ]\n\t\t i++;\n\t\t}\n\t\n\t\tfor(int j = 0; j < counter; j++) \n\t\t\/\/makes sure commands don't run again\n\t\t{ \n\t\t command[j] = NULL;\n\t\t}\n\t\tcounter = 0;\n\t }\n\t\t\n\t else \/\/remake the command array\n\t {\n\t\tcommand[counter] = new char[inter[i].size() + 1];\n\t\tcopy(inter[i].begin(), inter[i].end(), command[counter]);\n command[counter][inter[i].size()] = '\\0';\n\t\tcounter++;\n\t }\n }\n } \n return 0;\n}\n\nvector<string> tokenize(string x)\n{\n vector<string> tokenVector;\n split(tokenVector, x, is_any_of(\" \"), token_compress_on);\n \/\/ separates by spaces\n\n vector<string> tokenVectorDelim = separateByDelim(tokenVector, \"&&\");\n \/\/ separates by &&\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"||\");\n \/\/separates by ||\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"#\");\n \/\/separates by #\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"[\");\n \/\/separates by [\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \"]\");\n \/\/separates by ]\n tokenVectorDelim = separateByDelim(tokenVectorDelim, \";\");\n \/\/separates by ;\n return tokenVectorDelim;\n}\n\nvector<string> separateByDelim(vector<string> origVector, string delimiter)\n{\n vector<string> tokenVectorFinal;\n unsigned pos = 0;\n string oldString;\n string newString;\n for(unsigned l = 0; l < origVector.size(); l++)\n {\n oldString = origVector.at(l);\n\tif((pos = oldString.find(delimiter)) != string::npos\n\t && oldString != delimiter)\n\t{ \n while ((pos = oldString.find(delimiter)) != string::npos) \n {\n\t newString = oldString.substr(0, pos);\n\t tokenVectorFinal.push_back(newString);\n\t\ttokenVectorFinal.push_back(delimiter);\n\t oldString.erase(0, pos + delimiter.length());\n }\n\t tokenVectorFinal.push_back(oldString);\n\t}\n\n\telse\n\t{\n\t tokenVectorFinal.push_back(oldString);\n\t}\n }\n return tokenVectorFinal;\n}\n\nchar *stringToCstring(string z) \/\/makes a char* from a string\n{\n char *cstr = new char[z.length() + 1];\n strcpy(cstr, z.c_str());\n return cstr;\n} \n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <list>\n#include <exception>\n#include <typeinfo>\n\n#include <utils.hpp>\n\n\n#ifndef ARGUMENT_LIST_HPP\n#define ARGUMENT_LIST_HPP\n\nnamespace isa {\nnamespace utils {\n\n\/\/ Exception: no items in the command line\nclass EmptyCommandLine : public std::exception {};\n\/\/ Exception: requested switch not present\nclass SwitchNotFound : public std::exception {\npublic:\n SwitchNotFound(std::string option);\n ~SwitchNotFound() throw ();\n\n const char *what() const throw ();\n\nprivate:\n std::string option;\n};\n\n\n\/\/ ArgumentList class\nclass ArgumentList {\npublic:\n\tArgumentList(int argc, char * argv[]);\n\t~ArgumentList();\n\n inline std::string getName();\n\ttemplate< typename T > T getFirst() throw(EmptyCommandLine);\n\tbool getSwitch(const std::string & option) throw(EmptyCommandLine);\n\ttemplate< typename T > T getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound);\n\nprivate:\n std::list< std::string > args;\n std::string name;\n};\n\n\n\/\/ Implementations\n\nSwitchNotFound::SwitchNotFound(std::string option) : option(option) {}\n\nSwitchNotFound::~SwitchNotFound() throw () {}\n\nconst char * SwitchNotFound::what() const throw() {\n return (\"Switch \\\"\" + option + \"\\\" not found.\").c_str();\n}\n\nArgumentList::ArgumentList(int argc, char * argv[]) {\n name = std::string(argv[0]);\n\n for ( unsigned int i = 1; i < argc; i++ ) {\n args.push_back(std::string(argv[i]));\n }\n}\n\nArgumentList::~ArgumentList() {}\n\ninline std::string ArgumentList::getName() {\n\treturn name;\n}\n\ntemplate< typename T > T ArgumentList::getFirst() throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n std::string temp = args.front();\n\targs.pop_front();\n\treturn castToType< std::string, T >(temp);\n}\n\n\nbool ArgumentList::getSwitch(const std::string & option) throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\treturn false;\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n\t\t\targs.erase(s);\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\ntemplate< class T > T ArgumentList::getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n std::string temp = *(++s);\n\t\t\tT retVal = castToType< std::string, T >(temp);\n\n\t\t\targs.erase(s);\n\t\t\targs.erase(--s);\n\t\t\treturn retVal;\n\t\t}\n\t}\n\n\tthrow SwitchNotFound(option);\n}\n\n} \/\/ utils\n} \/\/ isa\n\n#endif \/\/ ARGUMENT_LIST_HPP\n\n<commit_msg>Few fixes in ArgumentList.<commit_after>\/\/ Copyright 2010 Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <string>\n#include <list>\n#include <exception>\n#include <typeinfo>\n\n#include <utils.hpp>\n\n\n#ifndef ARGUMENT_LIST_HPP\n#define ARGUMENT_LIST_HPP\n\nnamespace isa {\nnamespace utils {\n\n\/\/ Exception: no items in the command line\nclass EmptyCommandLine : public std::exception {};\n\/\/ Exception: requested switch not present\nclass SwitchNotFound : public std::exception {\npublic:\n SwitchNotFound(std::string option);\n ~SwitchNotFound() throw ();\n\n const char *what() const throw ();\n\nprivate:\n std::string option;\n};\n\n\n\/\/ ArgumentList class\nclass ArgumentList {\npublic:\n\tArgumentList(int argc, char * argv[]);\n\t~ArgumentList();\n\n inline std::string getName();\n\ttemplate< typename T > T getFirst() throw(EmptyCommandLine);\n\tbool getSwitch(const std::string & option) throw(EmptyCommandLine);\n\ttemplate< typename T > T getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound);\n\nprivate:\n std::list< std::string > args;\n std::string name;\n};\n\n\n\/\/ Implementations\n\nSwitchNotFound::SwitchNotFound(std::string option) : option(option) {}\n\nSwitchNotFound::~SwitchNotFound() throw () {}\n\nconst char * SwitchNotFound::what() const throw() {\n return (\"Switch \\\"\" + option + \"\\\" not found.\").c_str();\n}\n\nArgumentList::ArgumentList(int argc, char * argv[]) : name(std::string(argv[0])) {\n for ( int i = 1; i < argc; i++ ) {\n args.push_back(std::string(argv[i]));\n }\n}\n\nArgumentList::~ArgumentList() {}\n\ninline std::string ArgumentList::getName() {\n\treturn name;\n}\n\ntemplate< typename T > T ArgumentList::getFirst() throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n std::string temp = args.front();\n\targs.pop_front();\n\treturn castToType< std::string, T >(temp);\n}\n\n\nbool ArgumentList::getSwitch(const std::string & option) throw(EmptyCommandLine) {\n\tif ( args.empty() ) {\n\t\treturn false;\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n\t\t\targs.erase(s);\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\ntemplate< class T > T ArgumentList::getSwitchArgument(const std::string & option) throw(EmptyCommandLine, SwitchNotFound) {\n\tif ( args.empty() ) {\n\t\tthrow EmptyCommandLine();\n\t}\n\n\tfor ( std::list< std::string >::iterator s = args.begin(); s != args.end(); ++s ) {\n\t\tif ( option.compare(*s) == 0 ) {\n std::string temp = *(++s);\n\t\t\tT retVal = castToType< std::string, T >(temp);\n\n\t\t\targs.erase(s);\n\t\t\targs.erase(--s);\n\t\t\treturn retVal;\n\t\t}\n\t}\n\n\tthrow SwitchNotFound(option);\n}\n\n} \/\/ utils\n} \/\/ isa\n\n#endif \/\/ ARGUMENT_LIST_HPP\n\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * Copyright (C) ST-Ericsson SA 2011\n * License terms: 3-clause BSD license\n ******************************************************************************\/\n\n#include \"lcdriver_error_codes.h\"\n#include \"MemMappedFile.h\"\n#if defined(_WIN32)\n#include <windows.h>\n#elif (defined(__linux__) || defined(__APPLE__))\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n#include <string.h>\nusing namespace std;\n#else\n#error \"Unknown target\"\n#endif\n\n#ifdef __APPLE__\n#define lseek64 lseek\n#endif\n\nMemMappedFile::MemMappedFile(uint32 alignmentLength):\n size_(0),\n isMapped_(false),\n mappedData_(0),\n error_(0),\n alignmentLength_(alignmentLength),\n#ifdef _WIN32\n handle_(INVALID_HANDLE_VALUE),\n memmap_(INVALID_HANDLE_VALUE)\n#else\n descriptor_(-1)\n#endif\n{\n}\n\nMemMappedFile::~MemMappedFile()\n{\n#ifdef _WIN32\n\n if (0 != mappedData_) {\n UnmapViewOfFile(mappedData_);\n }\n\n if (INVALID_HANDLE_VALUE != memmap_) {\n CloseHandle(memmap_);\n }\n\n if (INVALID_HANDLE_VALUE != handle_) {\n CloseHandle(handle_);\n }\n\n#else\n\n if (0 != mappedData_) {\n munmap(mappedData_, size_);\n }\n\n if (-1 != descriptor_) {\n close(descriptor_);\n }\n\n#endif\n}\n\nint MemMappedFile::LoadFileData(const char *path)\n{\n path_ = path;\n#ifdef _WIN32\n handle_ = CreateFile(path_.c_str(), GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n\n if (INVALID_HANDLE_VALUE == handle_) {\n return FILE_OPENING_ERROR;\n }\n\n uint64 SizeHigh = 0;\n\n size_ = ::GetFileSize(handle_, (LPDWORD)&SizeHigh);\n size_ = (SizeHigh << 32) | size_;\n\n if (0 == size_) {\n return 0;\n }\n\n memmap_ = CreateFileMapping(handle_, NULL, PAGE_READONLY, 0, 0, NULL);\n\n if (INVALID_HANDLE_VALUE == memmap_) {\n return FILE_CREATE_MAPPING_ERROR;\n }\n\n mappedData_ = static_cast<uint8 *>(MapViewOfFile(memmap_, FILE_MAP_READ, 0, 0, 0));\n\n if (0 != mappedData_) {\n isMapped_ = true;\n volatile char tmp;\n\n for (uint64 i = 0; i < size_; i += 4096) {\n tmp = mappedData_[i];\n }\n } else {\n isMapped_ = false;\n CloseHandle(memmap_);\n memmap_ = INVALID_HANDLE_VALUE;\n }\n\n#else\n descriptor_ = open(path_.c_str(), O_RDONLY);\n\n if (-1 == descriptor_) {\n return FILE_OPENING_ERROR;\n }\n\n struct stat fileStat;\n\n if (0 != fstat(descriptor_, &fileStat)) {\n return FILE_FAILED_TO_GET_SIZE;\n }\n\n size_ = fileStat.st_size;\n\n \/* Map file in memory, BUT DON\"T Reserve SWAP memory, use only physical memory *\/\n mappedData_ = static_cast<uint8 *>(mmap(0, size_, PROT_READ, MAP_PRIVATE | MAP_NORESERVE \/*| MAP_POPULATE*\/, descriptor_, 0));\n\n if (MAP_FAILED != mappedData_) {\n isMapped_ = true;\n } else {\n isMapped_ = false;\n }\n\n#endif\n return 0;\n}\n\nuint8 *MemMappedFile::AllocateFileData(uint64 offset, uint64 size)\n{\n if (size_ < offset + size) {\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n uint32 alignedSize = (static_cast<uint32>(size) + (alignmentLength_ - 1)) & (~(alignmentLength_ - 1));\n\n if (isMapped_) {\n if (size_ < offset + alignedSize) {\n uint8 *data = new uint8[alignedSize];\n memcpy(data, mappedData_ + offset, static_cast<size_t>(size));\n return data;\n } else {\n return mappedData_ + offset;\n }\n } else {\n \/\/ file is not memory mapped fall back to plain read\n uint32 readSize = static_cast<uint32>(size);\n uint8 *data = new uint8[alignedSize];\n#ifdef _WIN32\n LARGE_INTEGER liOffset;\n liOffset.QuadPart = offset;\n\n if (!SetFilePointerEx(handle_, liOffset, NULL, FILE_BEGIN)) {\n delete[] data;\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n uint32 bytesRead;\n\n if (ReadFile(handle_, data, readSize, (LPDWORD)&bytesRead, NULL) && bytesRead == size) {\n return data;\n } else {\n delete[] data;\n error_ = FILE_READ_ERROR;\n return 0;\n }\n\n#else\n\n if (-1 == lseek64(descriptor_, offset, SEEK_SET)) {\n delete[] data;\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n if (readSize == (uint32)read(descriptor_, data, readSize)) {\n return data;\n } else {\n delete[] data;\n error_ = FILE_READ_ERROR;\n return 0;\n }\n\n#endif\n }\n}\n\nvoid MemMappedFile::ReleaseFileData(uint8 *data, uint64 offset, uint64 size)\n{\n uint32 alignedSize = (static_cast<uint32>(size) + (alignmentLength_ - 1)) & (~(alignmentLength_ - 1));\n\n if (!isMapped_ || size_ < offset + alignedSize) {\n delete[] data;\n }\n}\n\nuint64 MemMappedFile::GetFileSize()\n{\n return size_;\n}\n\nint MemMappedFile::GetError()\n{\n return error_;\n}\n<commit_msg>Missing include.<commit_after>\/*******************************************************************************\n * Copyright (C) ST-Ericsson SA 2011\n * License terms: 3-clause BSD license\n ******************************************************************************\/\n\n#include \"lcdriver_error_codes.h\"\n#include \"MemMappedFile.h\"\n#if defined(_WIN32)\n#include <windows.h>\n#elif (defined(__linux__) || defined(__APPLE__))\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/mman.h>\n#include <string.h>\n#include <unistd.h>\n\nusing namespace std;\n#else\n#error \"Unknown target\"\n#endif\n\n#ifdef __APPLE__\n#define lseek64 lseek\n#endif\n\nMemMappedFile::MemMappedFile(uint32 alignmentLength):\n size_(0),\n isMapped_(false),\n mappedData_(0),\n error_(0),\n alignmentLength_(alignmentLength),\n#ifdef _WIN32\n handle_(INVALID_HANDLE_VALUE),\n memmap_(INVALID_HANDLE_VALUE)\n#else\n descriptor_(-1)\n#endif\n{\n}\n\nMemMappedFile::~MemMappedFile()\n{\n#ifdef _WIN32\n\n if (0 != mappedData_) {\n UnmapViewOfFile(mappedData_);\n }\n\n if (INVALID_HANDLE_VALUE != memmap_) {\n CloseHandle(memmap_);\n }\n\n if (INVALID_HANDLE_VALUE != handle_) {\n CloseHandle(handle_);\n }\n\n#else\n\n if (0 != mappedData_) {\n munmap(mappedData_, size_);\n }\n\n if (-1 != descriptor_) {\n close(descriptor_);\n }\n\n#endif\n}\n\nint MemMappedFile::LoadFileData(const char *path)\n{\n path_ = path;\n#ifdef _WIN32\n handle_ = CreateFile(path_.c_str(), GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);\n\n if (INVALID_HANDLE_VALUE == handle_) {\n return FILE_OPENING_ERROR;\n }\n\n uint64 SizeHigh = 0;\n\n size_ = ::GetFileSize(handle_, (LPDWORD)&SizeHigh);\n size_ = (SizeHigh << 32) | size_;\n\n if (0 == size_) {\n return 0;\n }\n\n memmap_ = CreateFileMapping(handle_, NULL, PAGE_READONLY, 0, 0, NULL);\n\n if (INVALID_HANDLE_VALUE == memmap_) {\n return FILE_CREATE_MAPPING_ERROR;\n }\n\n mappedData_ = static_cast<uint8 *>(MapViewOfFile(memmap_, FILE_MAP_READ, 0, 0, 0));\n\n if (0 != mappedData_) {\n isMapped_ = true;\n volatile char tmp;\n\n for (uint64 i = 0; i < size_; i += 4096) {\n tmp = mappedData_[i];\n }\n } else {\n isMapped_ = false;\n CloseHandle(memmap_);\n memmap_ = INVALID_HANDLE_VALUE;\n }\n\n#else\n descriptor_ = open(path_.c_str(), O_RDONLY);\n\n if (-1 == descriptor_) {\n return FILE_OPENING_ERROR;\n }\n\n struct stat fileStat;\n\n if (0 != fstat(descriptor_, &fileStat)) {\n return FILE_FAILED_TO_GET_SIZE;\n }\n\n size_ = fileStat.st_size;\n\n \/* Map file in memory, BUT DON\"T Reserve SWAP memory, use only physical memory *\/\n mappedData_ = static_cast<uint8 *>(mmap(0, size_, PROT_READ, MAP_PRIVATE | MAP_NORESERVE \/*| MAP_POPULATE*\/, descriptor_, 0));\n\n if (MAP_FAILED != mappedData_) {\n isMapped_ = true;\n } else {\n isMapped_ = false;\n }\n\n#endif\n return 0;\n}\n\nuint8 *MemMappedFile::AllocateFileData(uint64 offset, uint64 size)\n{\n if (size_ < offset + size) {\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n uint32 alignedSize = (static_cast<uint32>(size) + (alignmentLength_ - 1)) & (~(alignmentLength_ - 1));\n\n if (isMapped_) {\n if (size_ < offset + alignedSize) {\n uint8 *data = new uint8[alignedSize];\n memcpy(data, mappedData_ + offset, static_cast<size_t>(size));\n return data;\n } else {\n return mappedData_ + offset;\n }\n } else {\n \/\/ file is not memory mapped fall back to plain read\n uint32 readSize = static_cast<uint32>(size);\n uint8 *data = new uint8[alignedSize];\n#ifdef _WIN32\n LARGE_INTEGER liOffset;\n liOffset.QuadPart = offset;\n\n if (!SetFilePointerEx(handle_, liOffset, NULL, FILE_BEGIN)) {\n delete[] data;\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n uint32 bytesRead;\n\n if (ReadFile(handle_, data, readSize, (LPDWORD)&bytesRead, NULL) && bytesRead == size) {\n return data;\n } else {\n delete[] data;\n error_ = FILE_READ_ERROR;\n return 0;\n }\n\n#else\n\n if (-1 == lseek64(descriptor_, offset, SEEK_SET)) {\n delete[] data;\n error_ = FILE_READ_INVALID_OFFSET;\n return 0;\n }\n\n if (readSize == (uint32)read(descriptor_, data, readSize)) {\n return data;\n } else {\n delete[] data;\n error_ = FILE_READ_ERROR;\n return 0;\n }\n\n#endif\n }\n}\n\nvoid MemMappedFile::ReleaseFileData(uint8 *data, uint64 offset, uint64 size)\n{\n uint32 alignedSize = (static_cast<uint32>(size) + (alignmentLength_ - 1)) & (~(alignmentLength_ - 1));\n\n if (!isMapped_ || size_ < offset + alignedSize) {\n delete[] data;\n }\n}\n\nuint64 MemMappedFile::GetFileSize()\n{\n return size_;\n}\n\nint MemMappedFile::GetError()\n{\n return error_;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include \"pam_pivportal.h\"\n\n\n\/\/ Mockup\nint pam_get_user(pam_handle_t *pamh, const char **username, const char *attr) {\n return 0;\n}\n\n\nTEST (write_curl_data, successisok) {\n ASSERT_EQ(write_curl_data(NULL, 5, 5, NULL), 25);\n}\n\n\nint main(int argc, char *argv[]) {\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}<commit_msg>#23. added unit test for randstring<commit_after>#include <gtest\/gtest.h>\n#include \"pam_pivportal.h\"\n\n\n\/\/ Mockup\nint pam_get_user(pam_handle_t *pamh, const char **username, const char *attr) {\n return 0;\n}\n\n\nTEST (write_curl_data, successisok) {\n ASSERT_EQ(write_curl_data(NULL, 5, 5, NULL), 25);\n}\n\n\nTEST (randstring, successisok) {\n char *randstr = NULL;\n randstr = randstring(10);\n ASSERT_EQ(strlen(randstr), 10);\n free(randstr);\n}\n\n\nint main(int argc, char *argv[]) {\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <thread>\n\n#include \"camera\/perspective.h\"\n#include \"engine\/cosine_debugger.h\"\n#include \"geom\/point.h\"\n#include \"geom\/rectangle.h\"\n#include \"geom\/vector.h\"\n#include \"image\/image.h\"\n#include \"model\/obj.h\"\n#include \"node\/group\/simple.h\"\n#include \"node\/group\/kdtree\/kdtree.h\"\n#include \"node\/group\/axis_selector\/round_robin.h\"\n#include \"node\/group\/split_strategy\/centre.h\"\n#include \"node\/group\/kdtree\/kdtree.h\"\n#include \"node\/group\/bvh.h\"\n#include \"node\/instance.h\"\n#include \"node\/solid\/disc.h\"\n#include \"node\/solid\/infinite_plane.h\"\n#include \"node\/solid\/sphere.h\"\n#include \"node\/solid\/triangle.h\"\n#include \"renderer\/parallel\/parallel.h\"\n#include \"renderer\/serial\/serial.h\"\n#include \"renderer\/settings.h\"\n#include \"supersampling\/random.h\"\n#include \"world\/world.h\"\n\nusing namespace Svit;\n\nint \nmain (void)\n{\n\tSettings settings;\n\tsettings.whole_area = Rectangle(Point2i(0, 0), Vector2i(800, 600));\n\tsettings.area = Rectangle(Point2i(0, 0), Vector2i(800, 600));\n\tsettings.max_thread_count = std::thread::hardware_concurrency();\n\tsettings.tile_size = Vector2i(100, 100);\n\tsettings.max_sample_count = 2;\n\tsettings.adaptive_sample_step = 10;\n\n\tCosineDebuggerEngine engine;\n\tParallelRenderer renderer;\n\tRandomSuperSampling super_sampling(true);\n\n\tPerspectiveCamera camera(\n\t\tPoint3(0.0, 0.75, -4.5),\n\t\tVector3(0.0, 0.0, 1.0),\n\t\tVector3(0.0, 1.0, 0.0),\n\t\tRectangle(Point2i(0, 0), Vector2i(80, 60)).get_aspect_ratio(),\n\t\tM_PI\/2.0f);\n\n\tObjModel cow_model;\n\tBVH cow_bvh(new RoundRobinAxisSelector(), new CentreSplitStrategy(), 520, 8);\n\tInstance cow(&cow_bvh);\n\n\tcow_model.load(\"mdl\/cow.obj\");\n\tcow_model.add_to_group(cow_bvh);\n\tcow_bvh.finish();\n\tcow.rotate(Vector3(0.0f, 0.0f, 1.0f), M_PI\/4.0f);\n\tcow.rotate(Vector3(0.0f, 1.0f, 0.0f), M_PI\/2.0f);\n\tcow.rotate(Vector3(0.0f, 0.0f, 1.0f), M_PI\/2.0f);\n\tcow.rotate(Vector3(0.0f, 1.0f, 0.0f), M_PI\/3.5f);\n\tcow.translate(Vector3(-3.5f, -2.0f, 0.0f));\n\n\tInfinitePlane plane(Point3(0.0f, -3.0f, 0.0f), Vector3(0.0f, 1.0f, 0.0f));\n\n\tSimpleGroup scene;\n\tscene.add(&cow);\n\tscene.add(&plane);\n\n\tWorld world;\n\tworld.scene = &scene;\n\tworld.camera = &camera;\n\n\tImage image = renderer.render(world, settings, engine, super_sampling);\n\timage.write_png(std::string(\"cow.png\"));\n\n\treturn 0;\n}\n\n<commit_msg>Removed kdtree include; lowered sample count<commit_after>#include <cmath>\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <thread>\n\n#include \"camera\/perspective.h\"\n#include \"engine\/cosine_debugger.h\"\n#include \"geom\/point.h\"\n#include \"geom\/rectangle.h\"\n#include \"geom\/vector.h\"\n#include \"image\/image.h\"\n#include \"model\/obj.h\"\n#include \"node\/group\/simple.h\"\n#include \"node\/group\/axis_selector\/round_robin.h\"\n#include \"node\/group\/split_strategy\/centre.h\"\n#include \"node\/group\/bvh.h\"\n#include \"node\/instance.h\"\n#include \"node\/solid\/disc.h\"\n#include \"node\/solid\/infinite_plane.h\"\n#include \"node\/solid\/sphere.h\"\n#include \"node\/solid\/triangle.h\"\n#include \"renderer\/parallel\/parallel.h\"\n#include \"renderer\/serial\/serial.h\"\n#include \"renderer\/settings.h\"\n#include \"supersampling\/random.h\"\n#include \"world\/world.h\"\n\nusing namespace Svit;\n\nint \nmain (void)\n{\n\tSettings settings;\n\tsettings.whole_area = Rectangle(Point2i(0, 0), Vector2i(800, 600));\n\tsettings.area = Rectangle(Point2i(0, 0), Vector2i(800, 600));\n\tsettings.max_thread_count = std::thread::hardware_concurrency();\n\tsettings.tile_size = Vector2i(100, 100);\n\tsettings.max_sample_count = 1;\n\tsettings.adaptive_sample_step = 10;\n\n\tCosineDebuggerEngine engine;\n\tParallelRenderer renderer;\n\tRandomSuperSampling super_sampling(true);\n\n\tPerspectiveCamera camera(\n\t\tPoint3(0.0, 0.75, -4.5),\n\t\tVector3(0.0, 0.0, 1.0),\n\t\tVector3(0.0, 1.0, 0.0),\n\t\tRectangle(Point2i(0, 0), Vector2i(80, 60)).get_aspect_ratio(),\n\t\tM_PI\/2.0f);\n\n\tObjModel cow_model;\n\tBVH cow_bvh(new RoundRobinAxisSelector(), new CentreSplitStrategy(), 520, 8);\n\tInstance cow(&cow_bvh);\n\n\tcow_model.load(\"mdl\/cow.obj\");\n\tcow_model.add_to_group(cow_bvh);\n\tcow_bvh.finish();\n\tcow.rotate(Vector3(0.0f, 0.0f, 1.0f), M_PI\/4.0f);\n\tcow.rotate(Vector3(0.0f, 1.0f, 0.0f), M_PI\/2.0f);\n\tcow.rotate(Vector3(0.0f, 0.0f, 1.0f), M_PI\/2.0f);\n\tcow.rotate(Vector3(0.0f, 1.0f, 0.0f), M_PI\/3.5f);\n\tcow.translate(Vector3(-3.5f, -2.0f, 0.0f));\n\n\tInfinitePlane plane(Point3(0.0f, -3.0f, 0.0f), Vector3(0.0f, 1.0f, 0.0f));\n\n\tSimpleGroup scene;\n\tscene.add(&cow);\n\tscene.add(&plane);\n\n\tWorld world;\n\tworld.scene = &scene;\n\tworld.camera = &camera;\n\n\tImage image = renderer.render(world, settings, engine, super_sampling);\n\timage.write_png(std::string(\"cow.png\"));\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: refbase.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 03:14:18 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n\n#ifndef CONNECTIVITY_DBTOOLS_REFBASE_HXX\n#include \"refbase.hxx\"\n#endif\n\n\/\/........................................................................\nnamespace connectivity\n{\n\/\/........................................................................\n\n \/\/================================================================\n \/\/= ORefBase\n \/\/================================================================\n \/\/----------------------------------------------------------------\n ORefBase::~ORefBase()\n {\n }\n\n \/\/----------------------------------------------------------------\n oslInterlockedCount SAL_CALL ORefBase::acquire()\n {\n return osl_incrementInterlockedCount(&m_refCount);\n }\n\n \/\/----------------------------------------------------------------\n oslInterlockedCount SAL_CALL ORefBase::release()\n {\n oslInterlockedCount nNewRefCount = osl_decrementInterlockedCount(&m_refCount);\n if (0 == nNewRefCount)\n delete this;\n\n return nNewRefCount;\n }\n\n\/\/........................................................................\n} \/\/ namespace connectivity\n\/\/........................................................................\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.4.216); FILE MERGED 2008\/04\/01 10:53:49 thb 1.4.216.2: #i85898# Stripping all external header guards 2008\/03\/28 15:24:41 rt 1.4.216.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: refbase.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_connectivity.hxx\"\n#include \"refbase.hxx\"\n\n\/\/........................................................................\nnamespace connectivity\n{\n\/\/........................................................................\n\n \/\/================================================================\n \/\/= ORefBase\n \/\/================================================================\n \/\/----------------------------------------------------------------\n ORefBase::~ORefBase()\n {\n }\n\n \/\/----------------------------------------------------------------\n oslInterlockedCount SAL_CALL ORefBase::acquire()\n {\n return osl_incrementInterlockedCount(&m_refCount);\n }\n\n \/\/----------------------------------------------------------------\n oslInterlockedCount SAL_CALL ORefBase::release()\n {\n oslInterlockedCount nNewRefCount = osl_decrementInterlockedCount(&m_refCount);\n if (0 == nNewRefCount)\n delete this;\n\n return nNewRefCount;\n }\n\n\/\/........................................................................\n} \/\/ namespace connectivity\n\/\/........................................................................\n\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdio.h>\n#include <errno.h>\n#include <stdlib.h>\n#include \"main.h\"\nusing namespace std;\n\npid_t wpid = 0;\npid_t fpid = 0;\nstatic void sigHandle(int sig, siginfo_t *Info, void *Pointer);\nint main() {\n\tstring userinput; \n\tstring login = getlogin();\n\tif(login == \"\")\n\t\tperror(\"getlogin\"); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\tbool ext = false;\n\tstring exit_status = \"exit\";\n\tstruct sigaction Curr;\n\tstruct sigaction Prev;\n\tsigset_t x;\n\tCurr.sa_mask = x;\n\tCurr.sa_sigaction = sigHandle;\n\tCurr.sa_flags = 0;\n\tPrev.sa_flags = 0;\n\tstring directory_a = \"\";\n\tif(sigaction(SIGINT, &Curr, &Prev) == -1)\n\t\tperror(\"SIGINT sigaction\");\n\tif(sigaction(SIGTSTP, &Curr, &Prev) == -1)\n\t\tperror(\"SIGTSTP sigaction\");\n\tif(sigaction(SIGCHLD, &Curr, &Prev) == -1) \n\t\tperror(\"SIGCHLD sigaction\");\t\n\twhile(!ext) {\n\t\tchar *pPath, *hHome;\n\t\tif((pPath = getenv(\"PWD\")) == NULL)\n\t\t\tperror(\"first.1 getenv\");\n\t\tif((hHome = getenv(\"HOME\")) == NULL)\n\t\t\tperror(\"first.2 getenv\");\n\t\tstring PPath(pPath), HHome(hHome);\n\t\tif(PPath.find(HHome) != string::npos) {\n\t\t\tPPath.erase(PPath.begin(), PPath.begin() + HHome.size());\n\t\t\tPPath.insert(PPath.begin(), '~');\n\t\t}\n\t\tcout << login << \"@\" << hostname << PPath << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tcin.clear();\n\t\tgetline(cin, userinput);\n\t\tif(userinput.find(\"#\") != string::npos)\n\t\t\tuserinput.erase(userinput.find(\"#\"), userinput.size());\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tbool multiple = false;\n\t\tif(userinput.size() != 0)\n\t\t\tconnectors(userinput, c_pat, c_pos, first, multiple);\n\t\tint x = 0;\n\t\tunsigned int b = 0;\n\t\tint y = 0;\n\t\tchar *arg[50000];\n\t\tint status;\n\t\tredir condition;\n\t\tif(userinput.size() != 0) {\n\t\t\twhile(userinput.substr(x, 1) != \"\") {\n\t\t\t\tif(multiple) {\n\t\t\t\t\tcout << \"Error: Incorrect connector config\" << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(first) {\n\t\t\t\t\tcout << \"Error: file does not exist\" << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tredir_check(condition, userinput.substr(x, c_pos.at(y) -x).c_str());\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\t\tcommand_a = strtok(command, \"&;| \\t\");\n\t\t\t\twhile(command_a != NULL) {\n\t\t\t\t\targ[b] = command_a;\n\t\t\t\t\tcommand_a = strtok(NULL, \"&;| \\t\");\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t\tif(userinput.substr(x, c_pos.at(y) - x).find(\"exit\") != string::npos && b==1) {\n\t\t\t\t\text = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(condition.redir_x) {\n\t\t\t\t\tredir_action(condition);\n\t\t\t\t\tnullify(condition);\t\n\t\t\t\t}\n\t\t\t\telse if(strcmp(arg[0], \"cd\") == 0) {\n\t\t\t\t\tif(b == 1) {\n\t\t\t\t\t\tchar *home, *old;\n\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_1.1\");\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_1.2\");\n\t\t\t\t\t\tif(chdir(home) == -1)\n\t\t\t\t\t\t\tperror(\"chdir_1\");\t\n\t\t\t\t\t\tif(setenv(\"PWD\", home, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_1.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_1.2\");\n\t\t\t\t\t}\n\t\t\t\t\telse if(strcmp(arg[1], \"-\") == 0) {\n\t\t\t\t\t\tchar *old, *newDir;\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\tperror(\"getenv_2.1\");\n\t\t\t\t\t\tif((newDir = getenv(\"OLDPWD\")) == NULL) \n\t\t\t\t\t\t\tperror(\"getenv_2.2\");\n\t\t\t\t\t\tif(chdir(newDir) == -1)\n\t\t\t\t\t\t\tperror(\"chdr_2\");\n\t\t\t\t\t\tif(setenv(\"PWD\", newDir, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_2.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1) \n\t\t\t\t\t\t\tperror(\"setenv_2.2\");\n\t\t\t\t\t}\n\t\t\t\t\telse if(strrchr(arg[1], '~') != NULL) {\n\t\t\t\t\t\tif(strlen(arg[1]) == 1) {\n\t\t\t\t\t\t\tchar *old, *home;\n\t\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\t\tperror(\"~ getenv1\");\n\t\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\t\tperror(\"~ getenv2\");\n\t\t\t\t\t\t\tif((chdir(home)) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ chdir\");\n\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ setenv_1\");\n\t\t\t\t\t\t\tif(setenv(\"PWD\", home, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ setenv_1\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tchar *old, *home;\n\t\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\t\tperror(\"~-- getenv1\");\n\t\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\t\tperror(\"~-- getenv2\");\n\t\t\t\t\t\t\tstring ndir(home), argu(arg[1]);\n\t\t\t\t\t\t\targu.erase(argu.begin());\n\t\t\t\t\t\t\tndir = ndir + argu;\n\t\t\t\t\t\t\tif((chdir(ndir.c_str())) == -1) {\n\t\t\t\t\t\t\t\tperror(\"~-- chdir\");\n\t\t\t\t\t\t\t\tif(chdir(old) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"chdir 1\");\n\t\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"~-- setenv1\");\n\t\t\t\t\t\t\t\tif(setenv(\"PWD\", old, 1) == -1) \n\t\t\t\t\t\t\t\t\tperror(\"~-- setenvr2\");\t\t\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"~-- setenv1\");\n\t\t\t\t\t\t\t\tif(setenv(\"PWD\", ndir.c_str(), 1) == -1) \n\t\t\t\t\t\t\t\t\tperror(\"~-- setenvr2\");\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tchar *old;\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_3.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_3.1\");\t\n\t\t\t\t\t\tif(chdir(arg[1]) == -1) {\n\t\t\t\t\t\t\tperror(\"chdir_3\");\n\t\t\t\t\t\t\tif(chdir(old) == -1) \n\t\t\t\t\t\t\t\tperror(\"chdir 2\");\n\t\t\t\t\t\t\tif(setenv(\"PWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"setenv 4\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {string newEnv(old);\n\t\t\t\t\t\t\tstring newDir(arg[1]);\n\t\t\t\t\t\t\tif(strcmp(arg[1],\"..\") != 0) {\n\t\t\t\t\t\t\t\tstring g(arg[1]);\n\t\t\t\t\t\t\t\tdirectory_a = g; \n\t\t\t\t\t\t\t\tnewEnv = newEnv + \"\/\" + newDir;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(strcmp(arg[1], \"..\") == 0) {\n\t\t\t\t\t\t\t\tchar *temp;\n\t\t\t\t\t\t\t\tif((temp = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\t\t\tperror(\".. getenv\");\n\t\t\t\t\t\t\t\tstring g(temp);\n\t\t\t\t\t\t\t\twhile(g.at(g.size() - 1) != '\/')\n\t\t\t\t\t\t\t\t\tg.erase(g.size() - 1);\n\t\t\t\t\t\t\t\tg.erase(g.size() - 1);\n\t\t\t\t\t\t\t\tnewEnv = g;\t\n\t\t\t\t\t\t\t} \n\t\t\t\t\t\t\tif(setenv(\"PWD\", newEnv.c_str(), 1) == -1) \n\t\t\t\t\t\t\t\tperror(\"setenv_3.2\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tfpid = fork();\n\t\t\t\t\tif(fpid == -1)\n\t\t\t\t\t\tperror(\"fork\");\n\t\t\t\t\tif(fpid == 0) {\n\t\t\t\t\t\tif(execvp(arg[0], arg) == -1) {\n\t\t\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t\t\t\texit(-1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\texit(0);\n\t\t\t\t\t}\n\t\t\t\t\tdo {\n\t\t\t\t\t\twpid = wait(&status);\n\t\t\t\t\t} while (wpid == -1 && errno == EINTR);\n\t\t\t\t\tif(wpid == -1) {\n\t\t\t\t\t\tperror(\"wait error\");\n\t\t\t\t\t\texit(-1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tx = c_pos.at(y);\n\t\t\t\tunsigned int help = c_pat.at(y);\n\t\t\t\tfor(unsigned int i = 0; i < b; i++)\n\t\t\t\t\targ[i] = NULL;\n\t\t\t\tif((help == 1 && status == 0) || (help == 0 && status != 0) || help == 2)\n\t\t\t\t\ty++;\n\t\t\t\telse if(help == 1 && status != 0 && (userinput.find(\"||\", x) != string::npos || userinput.find(\";\", x) != string::npos)) {\n\t\t\t\t\tx = c_pos.at(y + 1);\n\t\t\t\t\ty+=2;\n\t\t\t\t}\n\t\t\t\telse if(help == 0 && status == 0 && (userinput.find(\"&&\", x) != string::npos || userinput.find(\";\", x) != string::npos)) {\n\t\t\t\t\tx = c_pos.at(y + 1);\n\t\t\t\t\ty+=2;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t\tbreak;\n\t\t\t\tb = 0;\t\t\t\n\t\t\t}\n\t\t}\n\t\tdelete []command;\n\t}\n\treturn 0;\n}\nstatic void sigHandle(int sig, siginfo_t *Info, void *Pointer) {\n\tif(sig == SIGINT) {\n\t\tcout << Info->si_pid - Info->si_pid << Pointer;\n\t\tcout << \"C\" << endl;\n\t\treturn;\n\t}\n\telse if (sig == SIGTSTP) {\n\t\tif(fpid == 0) {\n\t\t\/\/\tkill(fpid, SIGSTOP);\n\t\t\traise(SIGSTOP);\n\t\t\tcout << endl;\n\t\t}\n\t}\n\telse {\n\t\/\/\tcout << \"not a valid signal\" << endl;\n\t\treturn;\n\t}\n}\n<commit_msg>gave up on ctrl z, fixed cd .<commit_after>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdio.h>\n#include <errno.h>\n#include <stdlib.h>\n#include \"main.h\"\nusing namespace std;\n\npid_t wpid = 0;\npid_t fpid = 0;\nstatic void sigHandle(int sig, siginfo_t *Info, void *Pointer);\nint main() {\n\tstring userinput; \n\tstring login = getlogin();\n\tif(login == \"\")\n\t\tperror(\"getlogin\"); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\tbool ext = false;\n\tstring exit_status = \"exit\";\n\tstruct sigaction Curr;\n\tstruct sigaction Prev;\n\tsigset_t x;\n\tCurr.sa_mask = x;\n\tCurr.sa_sigaction = sigHandle;\n\tCurr.sa_flags = 0;\n\tPrev.sa_flags = 0;\n\tstring directory_a = \"\";\n\tif(sigaction(SIGINT, &Curr, &Prev) == -1)\n\t\tperror(\"SIGINT sigaction\");\n\tif(sigaction(SIGTSTP, &Curr, &Prev) == -1)\n\t\tperror(\"SIGTSTP sigaction\");\n\tif(sigaction(SIGCHLD, &Curr, &Prev) == -1) \n\t\tperror(\"SIGCHLD sigaction\");\t\n\twhile(!ext) {\n\t\tchar *pPath, *hHome;\n\t\tif((pPath = getenv(\"PWD\")) == NULL)\n\t\t\tperror(\"first.1 getenv\");\n\t\tif((hHome = getenv(\"HOME\")) == NULL)\n\t\t\tperror(\"first.2 getenv\");\n\t\tstring PPath(pPath), HHome(hHome);\n\t\tif(PPath.find(HHome) != string::npos) {\n\t\t\tPPath.erase(PPath.begin(), PPath.begin() + HHome.size());\n\t\t\tPPath.insert(PPath.begin(), '~');\n\t\t}\n\t\tcout << login << \"@\" << hostname << \":\" << PPath << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tcin.clear();\n\t\tgetline(cin, userinput);\n\t\tif(userinput.find(\"#\") != string::npos)\n\t\t\tuserinput.erase(userinput.find(\"#\"), userinput.size());\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tbool multiple = false;\n\t\tif(userinput.size() != 0)\n\t\t\tconnectors(userinput, c_pat, c_pos, first, multiple);\n\t\tint x = 0;\n\t\tunsigned int b = 0;\n\t\tint y = 0;\n\t\tchar *arg[50000];\n\t\tint status;\n\t\tredir condition;\n\t\tif(userinput.size() != 0) {\n\t\t\twhile(userinput.substr(x, 1) != \"\") {\n\t\t\t\tif(multiple) {\n\t\t\t\t\tcout << \"Error: Incorrect connector config\" << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(first) {\n\t\t\t\t\tcout << \"Error: file does not exist\" << endl;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tredir_check(condition, userinput.substr(x, c_pos.at(y) -x).c_str());\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\t\tcommand_a = strtok(command, \"&;| \\t\");\n\t\t\t\twhile(command_a != NULL) {\n\t\t\t\t\targ[b] = command_a;\n\t\t\t\t\tcommand_a = strtok(NULL, \"&;| \\t\");\n\t\t\t\t\tb++;\n\t\t\t\t}\n\t\t\t\tif(userinput.substr(x, c_pos.at(y) - x).find(\"exit\") != string::npos && b==1) {\n\t\t\t\t\text = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(condition.redir_x) {\n\t\t\t\t\tredir_action(condition);\n\t\t\t\t\tnullify(condition);\t\n\t\t\t\t}\n\t\t\t\telse if(strcmp(arg[0], \"cd\") == 0) {\n\t\t\t\t\tif(b == 1) {\n\t\t\t\t\t\tchar *home, *old;\n\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_1.1\");\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_1.2\");\n\t\t\t\t\t\tif(chdir(home) == -1)\n\t\t\t\t\t\t\tperror(\"chdir_1\");\t\n\t\t\t\t\t\tif(setenv(\"PWD\", home, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_1.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_1.2\");\n\t\t\t\t\t}\n\t\t\t\t\telse if(strcmp(arg[1], \"-\") == 0) {\n\t\t\t\t\t\tchar *old, *newDir;\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\tperror(\"getenv_2.1\");\n\t\t\t\t\t\tif((newDir = getenv(\"OLDPWD\")) == NULL) \n\t\t\t\t\t\t\tperror(\"getenv_2.2\");\n\t\t\t\t\t\tif(chdir(newDir) == -1)\n\t\t\t\t\t\t\tperror(\"chdr_2\");\n\t\t\t\t\t\tif(setenv(\"PWD\", newDir, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_2.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1) \n\t\t\t\t\t\t\tperror(\"setenv_2.2\");\n\t\t\t\t\t}\n\t\t\t\t\telse if(strrchr(arg[1], '~') != NULL) {\n\t\t\t\t\t\tif(strlen(arg[1]) == 1) {\n\t\t\t\t\t\t\tchar *old, *home;\n\t\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\t\tperror(\"~ getenv1\");\n\t\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\t\tperror(\"~ getenv2\");\n\t\t\t\t\t\t\tif((chdir(home)) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ chdir\");\n\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ setenv_1\");\n\t\t\t\t\t\t\tif(setenv(\"PWD\", home, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"~ setenv_1\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tchar *old, *home;\n\t\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL) \n\t\t\t\t\t\t\t\tperror(\"~-- getenv1\");\n\t\t\t\t\t\t\tif((home = getenv(\"HOME\")) == NULL)\n\t\t\t\t\t\t\t\tperror(\"~-- getenv2\");\n\t\t\t\t\t\t\tstring ndir(home), argu(arg[1]);\n\t\t\t\t\t\t\targu.erase(argu.begin());\n\t\t\t\t\t\t\tndir = ndir + argu;\n\t\t\t\t\t\t\tif((chdir(ndir.c_str())) == -1) {\n\t\t\t\t\t\t\t\tperror(\"~-- chdir\");\n\t\t\t\t\t\t\t\tif(chdir(old) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"chdir 1\");\n\t\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"~-- setenv1\");\n\t\t\t\t\t\t\t\tif(setenv(\"PWD\", old, 1) == -1) \n\t\t\t\t\t\t\t\t\tperror(\"~-- setenvr2\");\t\t\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\t\tperror(\"~-- setenv1\");\n\t\t\t\t\t\t\t\tif(setenv(\"PWD\", ndir.c_str(), 1) == -1) \n\t\t\t\t\t\t\t\t\tperror(\"~-- setenvr2\");\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(strcmp(arg[1], \".\") == 0) {\n\t\t\t\t\t\tchar *rem;\n\t\t\t\t\t\tif((rem = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\tperror(\". getenv\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", rem, 1) == -1)\n\t\t\t\t\t\t\tperror(\". setenv1\");\n\t\t\t\t\t\tif(setenv(\"PWD\", rem, 1) == -1) \n\t\t\t\t\t\t\tperror(\". setenv2\");\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tchar *old;\n\t\t\t\t\t\tif((old = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\tperror(\"getenv_3.1\");\n\t\t\t\t\t\tif(setenv(\"OLDPWD\", old, 1) == -1)\n\t\t\t\t\t\t\tperror(\"setenv_3.1\");\t\n\t\t\t\t\t\tif(chdir(arg[1]) == -1) {\n\t\t\t\t\t\t\tperror(\"chdir_3\");\n\t\t\t\t\t\t\tif(chdir(old) == -1) \n\t\t\t\t\t\t\t\tperror(\"chdir 2\");\n\t\t\t\t\t\t\tif(setenv(\"PWD\", old, 1) == -1)\n\t\t\t\t\t\t\t\tperror(\"setenv 4\");\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {string newEnv(old);\n\t\t\t\t\t\t\tstring newDir(arg[1]);\n\t\t\t\t\t\t\tif(strcmp(arg[1],\"..\") != 0) {\n\t\t\t\t\t\t\t\tstring g(arg[1]);\n\t\t\t\t\t\t\t\tdirectory_a = g; \n\t\t\t\t\t\t\t\tnewEnv = newEnv + \"\/\" + newDir;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if(strcmp(arg[1], \"..\") == 0) {\n\t\t\t\t\t\t\t\tchar *temp;\n\t\t\t\t\t\t\t\tif((temp = getenv(\"PWD\")) == NULL)\n\t\t\t\t\t\t\t\t\tperror(\".. getenv\");\n\t\t\t\t\t\t\t\tstring g(temp);\n\t\t\t\t\t\t\t\twhile(g.at(g.size() - 1) != '\/')\n\t\t\t\t\t\t\t\t\tg.erase(g.size() - 1);\n\t\t\t\t\t\t\t\tg.erase(g.size() - 1);\n\t\t\t\t\t\t\t\tnewEnv = g;\t\n\t\t\t\t\t\t\t} \n\t\t\t\t\t\t\tif(setenv(\"PWD\", newEnv.c_str(), 1) == -1) \n\t\t\t\t\t\t\t\tperror(\"setenv_3.2\");\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tint i = fork();\n\t\t\t\t\tfpid = i;\n\t\t\t\t\tcout << fpid << endl;\n\t\t\t\t\tif(i == -1)\n\t\t\t\t\t\tperror(\"fork\");\n\t\t\t\t\tif(i == 0) {\n\t\t\t\t\t\tif(execvp(arg[0], arg) == -1) {\n\t\t\t\t\t\t\tperror(\"execvp\");\n\t\t\t\t\t\t\texit(-1);\n\t\t\t\t\t\t}\n\t\t\t\t\t\texit(0);\n\t\t\t\t\t}\n\t\t\t\t\tdo {\n\t\t\t\t\t\twpid = wait(&status);\n\t\t\t\t\t} while (wpid == -1 && errno == EINTR);\n\t\t\t\t\tif(wpid == -1) {\n\t\t\t\t\t\tperror(\"wait error\");\n\t\t\t\t\t\texit(-1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tx = c_pos.at(y);\n\t\t\t\tunsigned int help = c_pat.at(y);\n\t\t\t\tfor(unsigned int i = 0; i < b; i++)\n\t\t\t\t\targ[i] = NULL;\n\t\t\t\tif((help == 1 && status == 0) || (help == 0 && status != 0) || help == 2)\n\t\t\t\t\ty++;\n\t\t\t\telse if(help == 1 && status != 0 && (userinput.find(\"||\", x) != string::npos || userinput.find(\";\", x) != string::npos)) {\n\t\t\t\t\tx = c_pos.at(y + 1);\n\t\t\t\t\ty+=2;\n\t\t\t\t}\n\t\t\t\telse if(help == 0 && status == 0 && (userinput.find(\"&&\", x) != string::npos || userinput.find(\";\", x) != string::npos)) {\n\t\t\t\t\tx = c_pos.at(y + 1);\n\t\t\t\t\ty+=2;\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t\tbreak;\n\t\t\t\tb = 0;\t\t\t\n\t\t\t}\n\t\t}\n\t\tdelete []command;\n\t}\n\treturn 0;\n}\nstatic void sigHandle(int sig, siginfo_t *Info, void *Pointer) {\n\tif(sig == SIGINT) {\n\t\tif(fpid != 0) { \n\t\t\tkill(fpid, SIGKILL);\n\t\t}\n\t\tcout << Info->si_pid - Info->si_pid << Pointer;\n\t\tcout << \"C\" << endl;\n\t}\n\telse if (sig == SIGTSTP) {\n\t\tcout << fpid << endl;\n\t\tif(fpid == 0) {\n\t\t\treturn;\n\t\t}\n\t\tkill(-(fpid), SIGTSTP);\n\t\tcout << fpid << endl;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ros\/ros.h> \n#include <geometry_msgs\/Twist.h> \n#include <sensor_msgs\/PointCloud2.h>\n#include <sensor_msgs\/PointCloud.h>\n#include <sensor_msgs\/point_cloud_conversion.h>\n#include <tf\/transform_listener.h>\n\n#include <string>\n#include <math.h>\n\n#include \"dmath\/geometry.h\"\n\nstatic const float tol = 0.000000000000001f;\n\ndouble magnitude(double vec[3]){\n return sqrt(vec[0]*vec[0] + vec[1]*vec[1] + vec[2]*vec[2]);\n}\n\nvoid normalize(double vec[3]){\n float m = magnitude(vec);\n if(tol >= m) m = 1;\n vec[0] \/= m;\n vec[1] \/= m;\n vec[2] \/= m;\n\n if(fabs(vec[0]) < tol) vec[0] = 0.0f;\n if(fabs(vec[1]) < tol) vec[1] = 0.0f;\n if(fabs(vec[2]) < tol) vec[2] = 0.0f;\n}\n\nclass ArtificialPotentialField{\npublic:\n ArtificialPotentialField(ros::NodeHandle &node) : \n base_link_(\"base_link\"),\n cmd_pub_(node.advertise<geometry_msgs::Twist>(\"cmd_vel\", 10)),\n obs_sub_(node.subscribe(\"\/camera\/depth\/points\", 10, &ArtificialPotentialField::obstacleCallback, this))\n\n {\n for(int i=0; i < 3; i++) obs_[i] = 0;\n }\n\n void spin(){\n ros::Rate r(10);\n \n ros::Duration(1).sleep();\n geometry_msgs::Twist cmd;\n cmd.linear.z = 0.15;\n cmd_pub_.publish(cmd);\n ros::Duration(3).sleep();\n \n cmd.linear.z = 0;\n cmd_pub_.publish(cmd);\n ros::Duration(3).sleep();\n \n const double force = 0.025;\n \n while(ros::ok()){\n double Fs[3];\n Fs[0] = Fs[1] = Fs[2] = 0;\n \n double f_in[3];\n get_potential_force(obs_, f_in, 0, 3, 1, 2.0);\n \n Fs[0] += f_in[0];\n Fs[1] += f_in[1];\n Fs[2] += f_in[2];\n\n double g[3];\n g[0] = 0;\n g[1] = 0;\n g[2] = 0;\n\n get_potential_force(g, f_in, 2, 0, 1.5, 1);\n\n Fs[0] += f_in[0];\n Fs[1] += f_in[1];\n Fs[2] += f_in[2];\n\n cmd.linear.x = Fs[1] * force;\n \/\/cmd.linear.y = Fs[1] * force;\n \n ROS_INFO(\"obs = (%f, %f)\", obs_[0], obs_[1]);\n ROS_INFO_STREAM(\"cmd = \" << cmd);\n cmd_pub_.publish(cmd);\n r.sleep();\n ros::spinOnce();\n }\n }\n\nprivate:\n void get_potential_force(double dest_lc[3], double f_out[3], double A = 1, double B = 1, double n = 1, double m = 1){\n double u[3];\n u[0] = dest_lc[0];\n u[1] = dest_lc[1];\n u[2] = dest_lc[2];\n normalize(u);\n\n const double d = magnitude(dest_lc);\n double U = 0;\n if(fabs(d) > tol){\n U = -A\/pow(d, n) + B\/pow(d, m);\n }\n\n f_out[0] = U * u[0];\n f_out[1] = U * u[1];\n f_out[2] = U * u[2];\n }\n\n void obstacleCallback(const sensor_msgs::PointCloud2Ptr &obs_msg){\n sensor_msgs::PointCloud obs_lsr, obs_base;\n sensor_msgs::convertPointCloud2ToPointCloud(*obs_msg, obs_lsr);\n tf_listener_.transformPointCloud(obs_lsr.header.frame_id, obs_lsr.header.stamp, obs_lsr, base_link_, obs_base);\n\n if(obs_base.points.size() == 0){\n obs_[0] = 0;\n obs_[1] = 0;\n obs_[2] = 0;\n return;\n }\n \n double min_obs[3];\n min_obs[0] = obs_base.points[0].x;\n min_obs[1] = obs_base.points[0].y;\n min_obs[2] = obs_base.points[0].z;\n\n float min_dist = magnitude(min_obs);\n\n for(int i=1; i < obs_base.points.size(); i++){\n double obs[3];\n obs[0] = obs_base.points[i].x;\n obs[1] = obs_base.points[i].y;\n obs[2] = obs_base.points[i].z;\n \n \/\/ROS_INFO(\"(%f, %f)\", obs[0], obs[1]);\n\n double dist = magnitude(obs);\n if(dist < min_dist){\n min_obs[0] = obs[0];\n min_obs[1] = obs[1];\n min_obs[2] = obs[2];\n min_dist = dist;\n }\n }\n\n obs_[0] = min_obs[0];\n obs_[1] = min_obs[1];\n obs_[2] = min_obs[2];\n }\n \n double obs_[3];\n ros::Publisher cmd_pub_;\n ros::Subscriber obs_sub_;\n tf::TransformListener tf_listener_;\n std::string base_link_;\n};\n\nint main(int argc, char *argv[]){\n ros::init(argc, argv, \"apf_planner\");\n \n ros::NodeHandle node;\n ArtificialPotentialField apf(node);\n apf.spin();\n \n return 0;\n}\n\n<commit_msg>Use dmath tools<commit_after>#include <ros\/ros.h> \n#include <geometry_msgs\/Twist.h> \n#include <sensor_msgs\/PointCloud2.h>\n#include <sensor_msgs\/PointCloud.h>\n#include <sensor_msgs\/point_cloud_conversion.h>\n#include <tf\/transform_listener.h>\n\n#include <string>\n#include <math.h>\n\n#include \"dmath\/geometry.h\"\n\nclass ArtificialPotentialField{\npublic:\n ArtificialPotentialField(ros::NodeHandle &node) : \n base_link_(\"base_link\"),\n cmd_pub_(node.advertise<geometry_msgs::Twist>(\"cmd_vel\", 10)),\n obs_sub_(node.subscribe(\"\/camera\/depth\/points\", 10, &ArtificialPotentialField::obstacleCallback, this))\n\n {\n for(int i=0; i < 3; i++) obs_[i] = 0;\n }\n\n void spin(){\n ros::Rate r(10);\n \n ros::Duration(1).sleep();\n geometry_msgs::Twist cmd;\n cmd.linear.z = 0.15;\n cmd_pub_.publish(cmd);\n ros::Duration(3).sleep();\n \n cmd.linear.z = 0;\n cmd_pub_.publish(cmd);\n ros::Duration(3).sleep();\n \n const double force = 0.025;\n \n while(ros::ok()){\n dmath::Vector3D Fs;\n Fs += get_potential_force(obs_, 0, 3, 1, 2.0);\n\n dmath::Vector3D g;\n Fs += get_potential_force(g, 2, 0, 1.5, 1);\n \n dmath::Vector3D vel = Fs * force;\n \/\/cmd.linear.x = Fs[1] * force;\n \/\/cmd.linear.y = Fs[1] * force;\n \n ROS_INFO(\"obs = (%f, %f)\", obs_.x, obs_.y);\n ROS_INFO_STREAM(\"cmd = \" << cmd);\n cmd_pub_.publish(cmd);\n r.sleep();\n ros::spinOnce();\n }\n }\n\nprivate:\n Vector3D get_potential_force(const dmath::Vector3D &dest_lc, double A = 1, double B = 1, double n = 1, double m = 1){\n Vector3D u = dest_lc;\n normalize(u);\n\n const double d = magnitude(dest_lc);\n double U = 0;\n if(fabs(d) > dmath::tol){\n U = -A\/pow(d, n) + B\/pow(d, m);\n }\n \n return U * u;\n }\n\n void obstacleCallback(const sensor_msgs::PointCloud2Ptr &obs_msg){\n sensor_msgs::PointCloud obs_lsr, obs_base;\n sensor_msgs::convertPointCloud2ToPointCloud(*obs_msg, obs_lsr);\n tf_listener_.transformPointCloud(obs_lsr.header.frame_id, obs_lsr.header.stamp, obs_lsr, base_link_, obs_base);\n\n if(obs_base.points.size() == 0){\n obs_[0] = 0;\n obs_[1] = 0;\n obs_[2] = 0;\n return;\n }\n \n double min_obs[3];\n min_obs[0] = obs_base.points[0].x;\n min_obs[1] = obs_base.points[0].y;\n min_obs[2] = obs_base.points[0].z;\n\n float min_dist = magnitude(min_obs);\n\n for(int i=1; i < obs_base.points.size(); i++){\n double obs[3];\n obs[0] = obs_base.points[i].x;\n obs[1] = obs_base.points[i].y;\n obs[2] = obs_base.points[i].z;\n \n \/\/ROS_INFO(\"(%f, %f)\", obs[0], obs[1]);\n\n double dist = magnitude(obs);\n if(dist < min_dist){\n min_obs[0] = obs[0];\n min_obs[1] = obs[1];\n min_obs[2] = obs[2];\n min_dist = dist;\n }\n }\n\n obs_[0] = min_obs[0];\n obs_[1] = min_obs[1];\n obs_[2] = min_obs[2];\n }\n \n dmath::Vector3D obs_;\n ros::Publisher cmd_pub_;\n ros::Subscriber obs_sub_;\n tf::TransformListener tf_listener_;\n std::string base_link_;\n};\n\nint main(int argc, char *argv[]){\n ros::init(argc, argv, \"apf_planner\");\n \n ros::NodeHandle node;\n ArtificialPotentialField apf(node);\n apf.spin();\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <QDir>\n#include <QFileInfo>\n#include <QDateTime>\n#include <QTimer>\n#include <QThreadPool>\n\n#include \"seafile-applet.h\"\n#include \"ui\/tray-icon.h\"\n#include \"configurator.h\"\n#include \"account-mgr.h\"\n#include \"rpc\/rpc-client.h\"\n#include \"rpc\/local-repo.h\"\n#include \"utils\/file-utils.h\"\n#include \"utils\/utils.h\"\n#include \"utils\/uninstall-helpers.h\"\n#include \"data-mgr.h\"\n#include \"tasks.h\"\n#include \"transfer-mgr.h\"\n\n#include \"auto-update-mgr.h\"\n\nnamespace {\n\nconst char *kFileCacheTopDirName = \"file-cache\";\nconst char *kFileCacheTempTopDirName = \"file-cache-tmp\";\nconst char *kFileCacheDBFileName = \"file-cache.db\";\n\ninline bool addPath(QFileSystemWatcher *watcher, const QString &file) {\n if (watcher->files().contains(file))\n return true;\n bool ret = watcher->addPath(file);\n if (!ret) {\n qWarning(\"[AutoUpdateManager] failed to watch cache file %s\", file.toUtf8().data());\n }\n return ret;\n}\n\ninline bool removePath(QFileSystemWatcher *watcher, const QString &file) {\n if (!watcher->files().contains(file))\n return true;\n bool ret = watcher->removePath(file);\n if (!ret) {\n qWarning(\"[AutoUpdateManager] failed to remove watch on cache file %s\", file.toUtf8().data());\n }\n return ret;\n}\n} \/\/ anonymous namespace\n\nSINGLETON_IMPL(AutoUpdateManager)\n\n\nAutoUpdateManager::AutoUpdateManager()\n{\n connect(&watcher_, SIGNAL(fileChanged(const QString&)),\n this, SLOT(onFileChanged(const QString&)));\n}\n\nvoid AutoUpdateManager::start()\n{\n cleanCachedFile();\n}\n\nvoid AutoUpdateManager::watchCachedFile(const Account& account,\n const QString& repo_id,\n const QString& path)\n{\n QString local_path = DataManager::getLocalCacheFilePath(repo_id, path);\n qDebug(\"[AutoUpdateManager] watch cache file %s\", local_path.toUtf8().data());\n if (!QFileInfo(local_path).exists()) {\n qWarning(\"[AutoUpdateManager] unable to watch non-existent cache file %s\", local_path.toUtf8().data());\n return;\n }\n\n \/\/ do we have it in deferred list ?\n \/\/ skip if yes\n Q_FOREACH(const WatchedFileInfo& info, deleted_files_infos_)\n {\n if (repo_id == info.repo_id && path == info.path_in_repo)\n return;\n }\n\n addPath(&watcher_, local_path);\n watch_infos_[local_path] = WatchedFileInfo(account, repo_id, path);\n}\n\nvoid AutoUpdateManager::cleanCachedFile()\n{\n qDebug(\"[AutoUpdateManager] cancel all download tasks\");\n TransferManager::instance()->cancelAllDownloadTasks();\n\n const Account cur_account = seafApplet->accountManager()->currentAccount();\n foreach(const QString& key, watch_infos_.keys()) {\n if (watch_infos_[key].account == cur_account)\n watch_infos_.remove(key);\n }\n\n FileCache::instance()->cleanCurrentAccountCache();\n\n CachedFilesCleaner *cleaner = new CachedFilesCleaner();\n QThreadPool::globalInstance()->start(cleaner);\n}\n\nvoid AutoUpdateManager::onFileChanged(const QString& local_path)\n{\n qDebug(\"[AutoUpdateManager] detected cache file %s changed\", local_path.toUtf8().data());\n#ifdef Q_OS_MAC\n if (MacImageFilesWorkAround::instance()->isRecentOpenedImage(local_path)) {\n return;\n }\n#endif\n removePath(&watcher_, local_path);\n QString repo_id, path_in_repo;\n if (!watch_infos_.contains(local_path)) {\n \/\/ filter unwanted events\n return;\n }\n\n WatchedFileInfo &info = watch_infos_[local_path];\n\n if (!QFileInfo(local_path).exists()) {\n qDebug(\"[AutoUpdateManager] detected cache file %s renamed or removed\", local_path.toUtf8().data());\n WatchedFileInfo deferred_info = info;\n removeWatch(local_path);\n \/\/ Some application would deleted and recreate the file when saving.\n \/\/ We work around that by double checking whether the file gets\n \/\/ recreated after a short period\n QTimer::singleShot(5000, this, SLOT(checkFileRecreated()));\n deleted_files_infos_.enqueue(deferred_info);\n return;\n }\n\n DataManager data_mgr(info.account);\n FileNetworkTask *task = data_mgr.createUploadTask(\n info.repo_id, ::getParentPath(info.path_in_repo),\n local_path, ::getBaseName(local_path), true);\n\n connect(task, SIGNAL(finished(bool)),\n this, SLOT(onUpdateTaskFinished(bool)));\n\n qDebug(\"[AutoUpdateManager] start uploading new version of file %s\", local_path.toUtf8().data());\n\n task->start();\n info.uploading = true;\n}\n\nvoid AutoUpdateManager::onUpdateTaskFinished(bool success)\n{\n FileUploadTask *task = qobject_cast<FileUploadTask *>(sender());\n if (task == NULL)\n return;\n const QString local_path = task->localFilePath();\n if (success) {\n qDebug(\"[AutoUpdateManager] uploaded new version of file %s\", local_path.toUtf8().data());\n seafApplet->trayIcon()->showMessage(tr(\"Upload Success\"),\n tr(\"File \\\"%1\\\"\\nuploaded successfully.\").arg(QFileInfo(local_path).fileName()),\n task->repoId());\n emit fileUpdated(task->repoId(), task->path());\n addPath(&watcher_, local_path);\n WatchedFileInfo& info = watch_infos_[local_path];\n info.uploading = false;\n } else {\n qWarning(\"[AutoUpdateManager] failed to upload new version of file %s\", local_path.toUtf8().data());\n seafApplet->trayIcon()->showMessage(tr(\"Upload Failure\"),\n tr(\"File \\\"%1\\\"\\nfailed to upload.\").arg(QFileInfo(local_path).fileName()),\n task->repoId());\n watch_infos_.remove(local_path);\n return;\n }\n}\n\nvoid AutoUpdateManager::removeWatch(const QString& local_path)\n{\n watch_infos_.remove(local_path);\n removePath(&watcher_, local_path);\n}\n\nvoid AutoUpdateManager::checkFileRecreated()\n{\n if (deleted_files_infos_.isEmpty()) {\n \/\/ impossible\n return;\n }\n\n const WatchedFileInfo info = deleted_files_infos_.dequeue();\n const QString path = DataManager::getLocalCacheFilePath(info.repo_id, info.path_in_repo);\n if (QFileInfo(path).exists()) {\n qDebug(\"[AutoUpdateManager] detected recreated file %s\", path.toUtf8().data());\n addPath(&watcher_, path);\n watch_infos_[path] = info;\n \/\/ Some applications like MSOffice would remove the original file and\n \/\/ recreate it when the user modifies the file.\n onFileChanged(path);\n }\n}\n\n#ifdef Q_OS_MAC\nSINGLETON_IMPL(MacImageFilesWorkAround)\n\nMacImageFilesWorkAround::MacImageFilesWorkAround()\n{\n}\n\nvoid MacImageFilesWorkAround::fileOpened(const QString& path)\n{\n QString mimetype = ::mimeTypeFromFileName(path);\n if (mimetype.startsWith(\"image\") || mimetype == \"application\/pdf\") {\n images_[path] = QDateTime::currentMSecsSinceEpoch();\n }\n}\n\nbool MacImageFilesWorkAround::isRecentOpenedImage(const QString& path)\n{\n qint64 ts = images_.value(path, 0);\n if (QDateTime::currentMSecsSinceEpoch() < ts + 1000 * 10) {\n return true;\n } else {\n return false;\n }\n}\n#endif\n\nCachedFilesCleaner::CachedFilesCleaner()\n{\n}\n\nvoid CachedFilesCleaner::run()\n{\n QString file_cache_dir = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheTopDirName);\n QString file_cache_tmp_dir = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheTempTopDirName);\n QString file_cache_db_file = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheDBFileName);\n\n qDebug(\"[AutoUpdateManager] removing cached files\");\n if (QFile(file_cache_db_file).exists()) {\n if (!QFile(file_cache_db_file).remove()) {\n qWarning(\"[AutoUpdateManager] failed to remove db file\");\n }\n }\n if (QDir(file_cache_tmp_dir).exists()) {\n delete_dir_recursively(file_cache_tmp_dir);\n }\n if (QDir(file_cache_dir).exists()) {\n QDir().rename(file_cache_dir, file_cache_tmp_dir);\n delete_dir_recursively(file_cache_tmp_dir);\n }\n}\n<commit_msg>CFB: auto update should watch cached files after upload fails<commit_after>#include <QDir>\n#include <QFileInfo>\n#include <QDateTime>\n#include <QTimer>\n#include <QThreadPool>\n\n#include \"seafile-applet.h\"\n#include \"ui\/tray-icon.h\"\n#include \"configurator.h\"\n#include \"account-mgr.h\"\n#include \"rpc\/rpc-client.h\"\n#include \"rpc\/local-repo.h\"\n#include \"utils\/file-utils.h\"\n#include \"utils\/utils.h\"\n#include \"utils\/uninstall-helpers.h\"\n#include \"data-mgr.h\"\n#include \"tasks.h\"\n#include \"transfer-mgr.h\"\n\n#include \"auto-update-mgr.h\"\n\nnamespace {\n\nconst char *kFileCacheTopDirName = \"file-cache\";\nconst char *kFileCacheTempTopDirName = \"file-cache-tmp\";\nconst char *kFileCacheDBFileName = \"file-cache.db\";\n\ninline bool addPath(QFileSystemWatcher *watcher, const QString &file) {\n if (watcher->files().contains(file))\n return true;\n bool ret = watcher->addPath(file);\n if (!ret) {\n qWarning(\"[AutoUpdateManager] failed to watch cache file %s\", file.toUtf8().data());\n }\n return ret;\n}\n\ninline bool removePath(QFileSystemWatcher *watcher, const QString &file) {\n if (!watcher->files().contains(file))\n return true;\n bool ret = watcher->removePath(file);\n if (!ret) {\n qWarning(\"[AutoUpdateManager] failed to remove watch on cache file %s\", file.toUtf8().data());\n }\n return ret;\n}\n} \/\/ anonymous namespace\n\nSINGLETON_IMPL(AutoUpdateManager)\n\n\nAutoUpdateManager::AutoUpdateManager()\n{\n connect(&watcher_, SIGNAL(fileChanged(const QString&)),\n this, SLOT(onFileChanged(const QString&)));\n}\n\nvoid AutoUpdateManager::start()\n{\n cleanCachedFile();\n}\n\nvoid AutoUpdateManager::watchCachedFile(const Account& account,\n const QString& repo_id,\n const QString& path)\n{\n QString local_path = DataManager::getLocalCacheFilePath(repo_id, path);\n qDebug(\"[AutoUpdateManager] watch cache file %s\", local_path.toUtf8().data());\n if (!QFileInfo(local_path).exists()) {\n qWarning(\"[AutoUpdateManager] unable to watch non-existent cache file %s\", local_path.toUtf8().data());\n return;\n }\n\n \/\/ do we have it in deferred list ?\n \/\/ skip if yes\n Q_FOREACH(const WatchedFileInfo& info, deleted_files_infos_)\n {\n if (repo_id == info.repo_id && path == info.path_in_repo)\n return;\n }\n\n addPath(&watcher_, local_path);\n watch_infos_[local_path] = WatchedFileInfo(account, repo_id, path);\n}\n\nvoid AutoUpdateManager::cleanCachedFile()\n{\n qDebug(\"[AutoUpdateManager] cancel all download tasks\");\n TransferManager::instance()->cancelAllDownloadTasks();\n\n const Account cur_account = seafApplet->accountManager()->currentAccount();\n foreach(const QString& key, watch_infos_.keys()) {\n if (watch_infos_[key].account == cur_account)\n watch_infos_.remove(key);\n }\n\n FileCache::instance()->cleanCurrentAccountCache();\n\n CachedFilesCleaner *cleaner = new CachedFilesCleaner();\n QThreadPool::globalInstance()->start(cleaner);\n}\n\nvoid AutoUpdateManager::onFileChanged(const QString& local_path)\n{\n qDebug(\"[AutoUpdateManager] detected cache file %s changed\", local_path.toUtf8().data());\n#ifdef Q_OS_MAC\n if (MacImageFilesWorkAround::instance()->isRecentOpenedImage(local_path)) {\n return;\n }\n#endif\n removePath(&watcher_, local_path);\n QString repo_id, path_in_repo;\n if (!watch_infos_.contains(local_path)) {\n \/\/ filter unwanted events\n return;\n }\n\n WatchedFileInfo &info = watch_infos_[local_path];\n\n if (!QFileInfo(local_path).exists()) {\n qDebug(\"[AutoUpdateManager] detected cache file %s renamed or removed\", local_path.toUtf8().data());\n WatchedFileInfo deferred_info = info;\n removeWatch(local_path);\n \/\/ Some application would deleted and recreate the file when saving.\n \/\/ We work around that by double checking whether the file gets\n \/\/ recreated after a short period\n QTimer::singleShot(5000, this, SLOT(checkFileRecreated()));\n deleted_files_infos_.enqueue(deferred_info);\n return;\n }\n\n DataManager data_mgr(info.account);\n FileNetworkTask *task = data_mgr.createUploadTask(\n info.repo_id, ::getParentPath(info.path_in_repo),\n local_path, ::getBaseName(local_path), true);\n\n connect(task, SIGNAL(finished(bool)),\n this, SLOT(onUpdateTaskFinished(bool)));\n\n qDebug(\"[AutoUpdateManager] start uploading new version of file %s\", local_path.toUtf8().data());\n\n task->start();\n info.uploading = true;\n}\n\nvoid AutoUpdateManager::onUpdateTaskFinished(bool success)\n{\n FileUploadTask *task = qobject_cast<FileUploadTask *>(sender());\n if (task == NULL)\n return;\n const QString local_path = task->localFilePath();\n if (success) {\n qDebug(\"[AutoUpdateManager] uploaded new version of file %s\", local_path.toUtf8().data());\n seafApplet->trayIcon()->showMessage(tr(\"Upload Success\"),\n tr(\"File \\\"%1\\\"\\nuploaded successfully.\").arg(QFileInfo(local_path).fileName()),\n task->repoId());\n emit fileUpdated(task->repoId(), task->path());\n } else {\n qWarning(\"[AutoUpdateManager] failed to upload new version of file %s\", local_path.toUtf8().data());\n seafApplet->trayIcon()->showMessage(tr(\"Upload Failure\"),\n tr(\"File \\\"%1\\\"\\nfailed to upload.\").arg(QFileInfo(local_path).fileName()),\n task->repoId());\n }\n\n addPath(&watcher_, local_path);\n WatchedFileInfo& info = watch_infos_[local_path];\n info.uploading = false;\n}\n\nvoid AutoUpdateManager::removeWatch(const QString& local_path)\n{\n watch_infos_.remove(local_path);\n removePath(&watcher_, local_path);\n}\n\nvoid AutoUpdateManager::checkFileRecreated()\n{\n if (deleted_files_infos_.isEmpty()) {\n \/\/ impossible\n return;\n }\n\n const WatchedFileInfo info = deleted_files_infos_.dequeue();\n const QString path = DataManager::getLocalCacheFilePath(info.repo_id, info.path_in_repo);\n if (QFileInfo(path).exists()) {\n qDebug(\"[AutoUpdateManager] detected recreated file %s\", path.toUtf8().data());\n addPath(&watcher_, path);\n watch_infos_[path] = info;\n \/\/ Some applications like MSOffice would remove the original file and\n \/\/ recreate it when the user modifies the file.\n onFileChanged(path);\n }\n}\n\n#ifdef Q_OS_MAC\nSINGLETON_IMPL(MacImageFilesWorkAround)\n\nMacImageFilesWorkAround::MacImageFilesWorkAround()\n{\n}\n\nvoid MacImageFilesWorkAround::fileOpened(const QString& path)\n{\n QString mimetype = ::mimeTypeFromFileName(path);\n if (mimetype.startsWith(\"image\") || mimetype == \"application\/pdf\") {\n images_[path] = QDateTime::currentMSecsSinceEpoch();\n }\n}\n\nbool MacImageFilesWorkAround::isRecentOpenedImage(const QString& path)\n{\n qint64 ts = images_.value(path, 0);\n if (QDateTime::currentMSecsSinceEpoch() < ts + 1000 * 10) {\n return true;\n } else {\n return false;\n }\n}\n#endif\n\nCachedFilesCleaner::CachedFilesCleaner()\n{\n}\n\nvoid CachedFilesCleaner::run()\n{\n QString file_cache_dir = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheTopDirName);\n QString file_cache_tmp_dir = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheTempTopDirName);\n QString file_cache_db_file = pathJoin(seafApplet->configurator()->seafileDir(),\n kFileCacheDBFileName);\n\n qDebug(\"[AutoUpdateManager] removing cached files\");\n if (QFile(file_cache_db_file).exists()) {\n if (!QFile(file_cache_db_file).remove()) {\n qWarning(\"[AutoUpdateManager] failed to remove db file\");\n }\n }\n if (QDir(file_cache_tmp_dir).exists()) {\n delete_dir_recursively(file_cache_tmp_dir);\n }\n if (QDir(file_cache_dir).exists()) {\n QDir().rename(file_cache_dir, file_cache_tmp_dir);\n delete_dir_recursively(file_cache_tmp_dir);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <stdlib.h>\n#include <iostream>\n#include <string>\n#include <sstream>\n\n\nstd::string const intToString(int n){\n\tstd::stringstream ss;\n\tss << n;\n\treturn ss.str();\n}\n\nvoid const drawObject(cv::Point const ¢er, cv::Mat &frame, bool showCoords = false){\n\tcv::Scalar color(0, 255, 0);\n\tcv::circle(frame, center, 15, color, 2);\n\tif(showCoords){\n\t\tstd::string coords = \"x\" + intToString(center.x) + \" y\" + intToString(center.y);\n\t\tcv::putText(frame, coords, cv::Point(center.x + 20, center.y), 1, 1, color, 1);\n\t}\n}\n\nvoid const intro(){\n\tusing namespace std;\n\tcout << \"ECS: Quit\" << endl;\n\tcout << \"SPACEBAR: toggle tracking\" << endl;\n\tcout << \"c: toggle coords\" << endl;\n}\n\nint main(){\n\tusing namespace cv;\n\tintro();\n\n\tVideoCapture cap(0);\n\tif(!cap.isOpened()){\n\t\tstd::cerr << \"could not open webcam!\" << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tMat imgOrginal, imgOrginal2, imgGray1, imgGray2, imgDiff;\t\n\tbool tracking = false, showCoords = false;\n\twhile(true){\n\t\tif(!cap.read(imgOrginal)){\n\t\t\tstd::cerr << \"could not read frame from video stream!\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tcvtColor(imgOrginal, imgGray1, COLOR_BGR2GRAY);\n\t\tcap.read(imgOrginal2);\n\t\tcvtColor(imgOrginal2, imgGray2, COLOR_BGR2GRAY);\n\n\t\tabsdiff(imgGray1, imgGray2, imgDiff);\n\n\t\tif(tracking){\n\t\t\t\/\/tracking action\t\n\t\t}\n\t\t\n\t\timshow(\"Orginal\", imgDiff);\n\n\t\tint keyCode = waitKey(30);\n\t\tswitch(keyCode){\n\t\t\tcase 27: \/\/ESC\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\tbreak;\n\t\t\tcase 32: \/\/SPACEBAR\n\t\t\t\ttracking = !tracking;\n\t\t\tbreak;\n\t\t\tcase 99: \/\/ c key\n\t\t\t\tshowCoords = !showCoords;\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tif(keyCode >= 0){\n\t\t\t\t\tstd::cout << \"keyCode: \" << keyCode << std::endl;\n\t\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>WIP - search for motion<commit_after>#include <opencv2\/highgui\/highgui.hpp>\n#include <opencv2\/imgproc\/imgproc.hpp>\n#include <stdlib.h>\n#include <iostream>\n#include <string>\n#include <sstream>\n#include <vector>\n\nint const SENSITIVTY = 20;\ncv::Size const BLUR_SIZE(10, 10);\n\n\nstd::string const intToString(int n){\n\tstd::stringstream ss;\n\tss << n;\n\treturn ss.str();\n}\n\ncv::Point const searchForMovement(cv::Mat const &imgThreshold){\n\tint posX = 0, int posY = 0;\n\tstd::vector<std::vector<cv::Point>> contours;\n\tcv::findContours(imgThreshold, contours, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);\n\tif(contours.size > 0){ \/\/found something\n\t\t\/\/TODO\n\t}\n\treturn cv::Point(posX, posY);\n}\n\nvoid const drawObject(cv::Point const ¢er, cv::Mat &frame, bool showCoords = false){\n\tcv::Scalar color(0, 255, 0);\n\tcv::circle(frame, center, 15, color, 2);\n\tif(showCoords){\n\t\tstd::string coords = \"x\" + intToString(center.x) + \" y\" + intToString(center.y);\n\t\tcv::putText(frame, coords, cv::Point(center.x + 20, center.y), 1, 1, color, 1);\n\t}\n}\n\nvoid const intro(){\n\tusing namespace std;\n\tcout << \"ECS: Quit\" << endl;\n\tcout << \"SPACEBAR: toggle tracking\" << endl;\n\tcout << \"c: toggle coords\" << endl;\n}\n\nint main(){\n\tusing namespace cv;\n\tintro();\n\n\tVideoCapture cap(0);\n\tif(!cap.isOpened()){\n\t\tstd::cerr << \"could not open webcam!\" << std::endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tMat imgOrginal, imgOrginal2, imgGray1, imgGray2, imgDiff, imgThreshold;\t\n\tbool tracking = false, showCoords = false;\n\twhile(true){\n\t\tif(!cap.read(imgOrginal)){\n\t\t\tstd::cerr << \"could not read frame from video stream!\" << std::endl;\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t\tcvtColor(imgOrginal, imgGray1, COLOR_BGR2GRAY);\n\t\tcap.read(imgOrginal2);\n\t\tcvtColor(imgOrginal2, imgGray2, COLOR_BGR2GRAY);\n\n\t\tabsdiff(imgGray1, imgGray2, imgDiff);\n\t\tblur(imgDiff, imgDiff, BLUR_SIZE);\n\t\tthreshold(imgDiff, imgThreshold, SENSITIVTY, 255, THRESH_BINARY);\n\t\t\n\n\t\tif(tracking){\n\t\t\t\/\/tracking action\t\n\t\t}\n\t\t\n\t\timshow(\"Orginal\", imgThreshold);\n\n\t\tint keyCode = waitKey(30);\n\t\tswitch(keyCode){\n\t\t\tcase 27: \/\/ESC\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t\tbreak;\n\t\t\tcase 32: \/\/SPACEBAR\n\t\t\t\ttracking = !tracking;\n\t\t\tbreak;\n\t\t\tcase 99: \/\/ c key\n\t\t\t\tshowCoords = !showCoords;\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tif(keyCode >= 0){\n\t\t\t\t\tstd::cout << \"keyCode: \" << keyCode << std::endl;\n\t\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SDL.h\"\n#include \"SDL_opengl.h\"\n#include <cmath>\n\nconst float kPi = 4.0f * std::atan(1.0f);\nconst Uint32 kLagThreshold = 1000;\nconst Uint32 kFrameTime = 10;\n\nconst float kPlayerForwardSpeed = 10.0f * (kFrameTime * 0.001f);\nconst float kPlayerTurnSpeed = 100.0f * (kFrameTime * 0.001f);\n\nconst float kGridSpacing = 2.0f;\nconst int kGridSize = 8;\n\nbool buttonLeft = false, buttonRight = false,\n buttonUp = false, buttonDown = false;\nfloat playerX = 0.0f, playerY = 0.0f, playerFace = 0.0f;\nUint32 tickref = 0;\n\nvoid handleKey(SDL_keysym *key, bool state)\n{\n switch (key->sym) {\n case SDLK_ESCAPE:\n if (state) {\n SDL_Quit();\n exit(0);\n }\n break;\n case SDLK_UP:\n case SDLK_w:\n buttonUp = state;\n break;\n case SDLK_DOWN:\n case SDLK_s:\n buttonDown = state;\n break;\n case SDLK_LEFT:\n case SDLK_a:\n buttonLeft = state;\n break;\n case SDLK_RIGHT:\n case SDLK_d:\n buttonRight = state;\n break;\n default:\n break;\n }\n}\n\nvoid handleEvents(void)\n{\n SDL_Event event;\n while (SDL_PollEvent(&event)) {\n switch (event.type) {\n case SDL_KEYDOWN:\n handleKey(&event.key.keysym, true);\n break;\n case SDL_KEYUP:\n handleKey(&event.key.keysym, false);\n break;\n case SDL_QUIT:\n SDL_Quit();\n exit(0);\n break;\n }\n }\n}\n\nvoid advanceFrame(void)\n{\n float forward = 0.0f, turn = 0.0f, face;\n if (buttonLeft)\n turn += kPlayerTurnSpeed;\n if (buttonRight)\n turn -= kPlayerTurnSpeed;\n if (buttonUp)\n forward += kPlayerForwardSpeed;\n if (buttonDown)\n forward -= kPlayerForwardSpeed;\n playerFace += turn;\n face = playerFace * (kPi \/ 180.0f);\n playerX += forward * std::cos(face);\n playerY += forward * std::sin(face);\n}\n\nvoid updateState(void)\n{\n Uint32 tick = SDL_GetTicks();\n if (tick > tickref + kLagThreshold) {\n advanceFrame();\n tickref = tick;\n } else if (tick > tickref + kFrameTime) {\n do {\n advanceFrame();\n tickref += kFrameTime;\n } while (tick > tickref + kFrameTime);\n } else if (tick < tickref)\n tickref = tick;\n}\n\nstruct gradient_point {\n float pos;\n unsigned char color[3];\n};\n\nconst gradient_point sky[] = {\n { -0.50f, { 0, 0, 51 } },\n { -0.02f, { 0, 0, 0 } },\n { 0.00f, { 102, 204, 255 } },\n { 0.20f, { 51, 0, 255 } },\n { 0.70f, { 0, 0, 0 } }\n};\n\nvoid drawSky(void)\n{\n glPushAttrib(GL_CURRENT_BIT);\n glBegin(GL_TRIANGLE_STRIP);\n glColor3ubv(sky[0].color);\n glVertex3f(-2.0f, 1.0f, -1.0f);\n glVertex3f( 2.0f, 1.0f, -1.0f);\n for (int i = 0; i < sizeof(sky) \/ sizeof(*sky); ++i) {\n glColor3ubv(sky[i].color);\n glVertex3f(-2.0f, 1.0f, sky[i].pos);\n glVertex3f( 2.0f, 1.0f, sky[i].pos);\n }\n glVertex3f(-2.0f, 0.0f, 1.0f);\n glVertex3f( 2.0f, 0.0f, 1.0f);\n glEnd();\n glPopAttrib();\n}\n\nvoid drawGround(void)\n{\n float px = std::floor(playerX \/ kGridSpacing + 0.5f) * kGridSpacing;\n float py = std::floor(playerY \/ kGridSpacing + 0.5f) * kGridSpacing;\n glPushMatrix();\n glTranslatef(px, py, 0.0f);\n glScalef(kGridSpacing, kGridSpacing, 1.0f);\n glColor3ub(51, 0, 255);\n glBegin(GL_LINES);\n for (int i = -kGridSize; i <= kGridSize; ++i) {\n glVertex3f(i, -kGridSize, 0.0f);\n glVertex3f(i, kGridSize, 0.0f);\n glVertex3f(-kGridSize, i, 0.0f);\n glVertex3f( kGridSize, i, 0.0f);\n }\n glEnd();\n glPopAttrib();\n glPopMatrix();\n}\n\nvoid drawScene(void)\n{\n glLoadIdentity();\n drawSky();\n glRotatef(90.0f - playerFace, 0.0f, 0.0f, 1.0f);\n glTranslatef(-playerX, -playerY, -1.0f);\n drawGround();\n SDL_GL_SwapBuffers();\n}\n\nint main(int argc, char *argv[])\n{\n SDL_Surface *screen = NULL;\n int flags;\n\n if (SDL_Init(SDL_INIT_TIMER | SDL_INIT_VIDEO) < 0) {\n fprintf(stderr, \"Could not initialize SDL: %s\\n\",\n SDL_GetError());\n exit(1);\n }\n flags = SDL_OPENGL | SDL_GL_DOUBLEBUFFER;\n screen = SDL_SetVideoMode(640, 480, 32, flags);\n if (!screen) {\n fprintf(stderr, \"Could not initialize video: %s\\n\",\n SDL_GetError());\n SDL_Quit();\n exit(1);\n }\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glFrustum(-0.1f, 0.1f, -0.075f, 0.075f, 0.1f, 100.0f);\n glRotatef(-90.0f, 1.0f, 0.0f, 0.0f);\n glMatrixMode(GL_MODELVIEW);\n\n while (1) {\n handleEvents();\n updateState();\n drawScene();\n }\n\n return 0;\n}\n<commit_msg>Moved projection matrix back into loop, wrote separate init function.<commit_after>#include \"SDL.h\"\n#include \"SDL_opengl.h\"\n#include <cmath>\n\nconst float kPi = 4.0f * std::atan(1.0f);\nconst Uint32 kLagThreshold = 1000;\nconst Uint32 kFrameTime = 10;\n\nconst float kPlayerForwardSpeed = 10.0f * (kFrameTime * 0.001f);\nconst float kPlayerTurnSpeed = 100.0f * (kFrameTime * 0.001f);\n\nconst float kGridSpacing = 2.0f;\nconst int kGridSize = 8;\n\nbool buttonLeft = false, buttonRight = false,\n buttonUp = false, buttonDown = false;\nfloat playerX = 0.0f, playerY = 0.0f, playerFace = 0.0f;\nUint32 tickref = 0;\n\nvoid init(void)\n{\n SDL_Surface *screen = NULL;\n int flags;\n\n if (SDL_Init(SDL_INIT_TIMER | SDL_INIT_VIDEO) < 0) {\n fprintf(stderr, \"Could not initialize SDL: %s\\n\",\n SDL_GetError());\n exit(1);\n }\n flags = SDL_OPENGL | SDL_GL_DOUBLEBUFFER;\n screen = SDL_SetVideoMode(640, 480, 32, flags);\n if (!screen) {\n fprintf(stderr, \"Could not initialize video: %s\\n\",\n SDL_GetError());\n SDL_Quit();\n exit(1);\n }\n}\n\nvoid handleKey(SDL_keysym *key, bool state)\n{\n switch (key->sym) {\n case SDLK_ESCAPE:\n if (state) {\n SDL_Quit();\n exit(0);\n }\n break;\n case SDLK_UP:\n case SDLK_w:\n buttonUp = state;\n break;\n case SDLK_DOWN:\n case SDLK_s:\n buttonDown = state;\n break;\n case SDLK_LEFT:\n case SDLK_a:\n buttonLeft = state;\n break;\n case SDLK_RIGHT:\n case SDLK_d:\n buttonRight = state;\n break;\n default:\n break;\n }\n}\n\nvoid handleEvents(void)\n{\n SDL_Event event;\n while (SDL_PollEvent(&event)) {\n switch (event.type) {\n case SDL_KEYDOWN:\n handleKey(&event.key.keysym, true);\n break;\n case SDL_KEYUP:\n handleKey(&event.key.keysym, false);\n break;\n case SDL_QUIT:\n SDL_Quit();\n exit(0);\n break;\n }\n }\n}\n\nvoid advanceFrame(void)\n{\n float forward = 0.0f, turn = 0.0f, face;\n if (buttonLeft)\n turn += kPlayerTurnSpeed;\n if (buttonRight)\n turn -= kPlayerTurnSpeed;\n if (buttonUp)\n forward += kPlayerForwardSpeed;\n if (buttonDown)\n forward -= kPlayerForwardSpeed;\n playerFace += turn;\n face = playerFace * (kPi \/ 180.0f);\n playerX += forward * std::cos(face);\n playerY += forward * std::sin(face);\n}\n\nvoid updateState(void)\n{\n Uint32 tick = SDL_GetTicks();\n if (tick > tickref + kLagThreshold) {\n advanceFrame();\n tickref = tick;\n } else if (tick > tickref + kFrameTime) {\n do {\n advanceFrame();\n tickref += kFrameTime;\n } while (tick > tickref + kFrameTime);\n } else if (tick < tickref)\n tickref = tick;\n}\n\nstruct gradient_point {\n float pos;\n unsigned char color[3];\n};\n\nconst gradient_point sky[] = {\n { -0.50f, { 0, 0, 51 } },\n { -0.02f, { 0, 0, 0 } },\n { 0.00f, { 102, 204, 255 } },\n { 0.20f, { 51, 0, 255 } },\n { 0.70f, { 0, 0, 0 } }\n};\n\nvoid drawSky(void)\n{\n glPushAttrib(GL_CURRENT_BIT);\n glBegin(GL_TRIANGLE_STRIP);\n glColor3ubv(sky[0].color);\n glVertex3f(-2.0f, 1.0f, -1.0f);\n glVertex3f( 2.0f, 1.0f, -1.0f);\n for (int i = 0; i < sizeof(sky) \/ sizeof(*sky); ++i) {\n glColor3ubv(sky[i].color);\n glVertex3f(-2.0f, 1.0f, sky[i].pos);\n glVertex3f( 2.0f, 1.0f, sky[i].pos);\n }\n glVertex3f(-2.0f, 0.0f, 1.0f);\n glVertex3f( 2.0f, 0.0f, 1.0f);\n glEnd();\n glPopAttrib();\n}\n\nvoid drawGround(void)\n{\n float px = std::floor(playerX \/ kGridSpacing + 0.5f) * kGridSpacing;\n float py = std::floor(playerY \/ kGridSpacing + 0.5f) * kGridSpacing;\n glPushMatrix();\n glTranslatef(px, py, 0.0f);\n glScalef(kGridSpacing, kGridSpacing, 1.0f);\n glColor3ub(51, 0, 255);\n glBegin(GL_LINES);\n for (int i = -kGridSize; i <= kGridSize; ++i) {\n glVertex3f(i, -kGridSize, 0.0f);\n glVertex3f(i, kGridSize, 0.0f);\n glVertex3f(-kGridSize, i, 0.0f);\n glVertex3f( kGridSize, i, 0.0f);\n }\n glEnd();\n glPopAttrib();\n glPopMatrix();\n}\n\nvoid drawScene(void)\n{\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glFrustum(-0.1f, 0.1f, -0.075f, 0.075f, 0.1f, 100.0f);\n glRotatef(-90.0f, 1.0f, 0.0f, 0.0f);\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n\n drawSky();\n\n glRotatef(90.0f - playerFace, 0.0f, 0.0f, 1.0f);\n glTranslatef(-playerX, -playerY, -1.0f);\n\n drawGround();\n\n SDL_GL_SwapBuffers();\n}\n\nint main(int argc, char *argv[])\n{\n init();\n while (1) {\n handleEvents();\n updateState();\n drawScene();\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include<iostream>\n#define _USE_MATH_DEFINES\n#include<cmath>\n#include<cassert>\n#include<thread>\n#include<chrono>\n\n#include \"ics3\/ics\"\n\nint main(int argc, char **argv) {\n {\n ics::ID id(2);\n ics::Angle degree = ics::Angle::newDegree();\n try {\n ics::ICS3 ics(\"\/dev\/ttyUSB0\", ics::ICSBaudrate::RATE115200);\n assert(7500 == degree.getRaw());\n ics::Angle nowPos = ics.move(id, degree);\n std::cout << nowPos.get() << std::endl;\n } catch (std::runtime_error& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"EepParam test section\" << std::endl;\n ics::EepParam speed = ics::EepParam::speed();\n assert(127 == speed.get());\n speed.set(100);\n assert(100 == speed.get());\n try {\n speed.set(200);\n std::cerr << \"Never run this\" << std::endl;\n } catch (std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"angle test section\" << std::endl;\n ics::Angle degree = ics::Angle::newDegree();\n ics::Angle radian = ics::Angle::newRadian();\n assert(degree.getRaw() == radian.getRaw());\n degree.set(0);\n radian.set(0);\n assert(degree.getRaw() == radian.getRaw());\n degree.set(90);\n radian.set(M_PI \/ 2);\n assert(degree.getRaw() == radian.getRaw());\n degree.set(60);\n radian.set(M_PI \/ 3);\n assert(degree.getRaw() == radian.getRaw());\n try {\n degree.set(150);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n try {\n radian.set(M_PI);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"parameter test section\" << std::endl;\n ics::Parameter current = ics::Parameter::current();\n assert(63 == current.get());\n current.set(30);\n assert(30 == current.get());\n try {\n current.set(70);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n return 0;\n}\n<commit_msg>Update testcode for move task<commit_after>#include<iostream>\n#define _USE_MATH_DEFINES\n#include<cmath>\n#include<cassert>\n#include<thread>\n#include<chrono>\n\n#include \"ics3\/ics\"\n\nint main(int argc, char **argv) {\n {\n ics::ID id(2);\n ics::Angle degree = ics::Angle::newDegree();\n try {\n ics::ICS3 ics(\"\/dev\/ttyUSB0\", ics::ICSBaudrate::RATE115200);\n assert(7500 == degree.getRaw());\n ics::Angle nowPos = ics.move(id, degree);\n std::cout << nowPos.get() << std::endl;\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n degree.set(50);\n ics.move(id, degree);\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n degree.set(-50);\n ics.move(id, degree);\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n degree.set(0);\n ics.move(id, degree);\n } catch (std::runtime_error& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"EepParam test section\" << std::endl;\n ics::EepParam speed = ics::EepParam::speed();\n assert(127 == speed.get());\n speed.set(100);\n assert(100 == speed.get());\n try {\n speed.set(200);\n std::cerr << \"Never run this\" << std::endl;\n } catch (std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"angle test section\" << std::endl;\n ics::Angle degree = ics::Angle::newDegree();\n ics::Angle radian = ics::Angle::newRadian();\n assert(degree.getRaw() == radian.getRaw());\n degree.set(0);\n radian.set(0);\n assert(degree.getRaw() == radian.getRaw());\n degree.set(90);\n radian.set(M_PI \/ 2);\n assert(degree.getRaw() == radian.getRaw());\n degree.set(60);\n radian.set(M_PI \/ 3);\n assert(degree.getRaw() == radian.getRaw());\n try {\n degree.set(150);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n try {\n radian.set(M_PI);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"parameter test section\" << std::endl;\n ics::Parameter current = ics::Parameter::current();\n assert(63 == current.get());\n current.set(30);\n assert(30 == current.get());\n try {\n current.set(70);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument& e) {\n std::cout << e.what() << std::endl;\n }\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Test.cpp\n\/\/ Sean Jones\n\n#define GLFW_INCLUDE_GLU\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/constants.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/core\/type_vec3.hpp>\n#include <vector>\n#include <random>\n#include <chrono>\n\n\/\/ For Debug\n#include <iostream>\n\n\nusing namespace glm;\nusing namespace std;\nusing namespace std::chrono;\n\nGLFWwindow* window;\n\nbool running = true;\n\n\/\/ Number of points to generate\nconst int num_points = 50000;\n\/\/ Points generated\nvector<vec2> points;\n\n\nbool initialise()\n{\n\t\/\/ Set background to white.\n\tglClearColor(1.0f, 1.0f, 1.0f, 1.0f);\n\tglColor3f(1.0f, 0.0f, 0.0f);\n\n\t\/\/ Enable face culling\n\tglEnable(GL_CULL_FACE);\n\n\t\/\/ The three points we randomly select from\n\tvec2 v[3] =\n\t{\n\t\t\tvec2(-1.0f, -1.0f),\n\t\t\tvec2(0.0f, 1.0f),\n\t\t\tvec2(1.0f, -1.0f)\n\t};\n\n\t\/\/ Add starting point\n\tpoints.push_back(vec2(0.25f, 0.5f));\n\n\t\/\/ Create a random engine\n\tdefault_random_engine re;\n\n\t\/\/ Create a distribution. 3 points in array, so get 0, 1 or 2.\n\tuniform_int_distribution<int> dist(0,2);\n\n\n\tint k;\n\tfor(k=0; k <5000; k++)\n\t{\n\t\tfloat x,y;\n\n\t\tint r = dist(re);\n\n\t\t\/* compute point halfway between vertex and old point *\/\n\t\tpoints.push_back(vec2(\n\t\t\t\t(points.at(points.size()-1).x + v[r].x)\/2.0,\n\t\t\t\t(points.at(points.size()-1).y + v[r].y)\/2.0));\n\t}\n\n\treturn true;\n} \/\/ initialise\n\n\/\/updates the application\nvoid update(double deltaTime)\n{\n\n\n} \/\/ update\n\n\/\/renders the application\nvoid render()\n{\n\t\/\/ Clear the screen\n\tglClear(GL_COLOR_BUFFER_BIT);\n\t\/\/ Set Colour to black\n\tglColor3f(0.0f, 0.0f, 0.0f);\n\n\t\/\/Render a Triangle\n\tglBegin(GL_POINTS);\n\tfor (vec2& point : points) {\n\t\tglVertex2fv(value_ptr(point));\n\t}\n\tglEnd();\n\n\t\/\/ Swap front and back buffers\n\tglfwSwapBuffers(window);\n\n\t\/\/ Set transform matrix to identity (no transform)\n\tglLoadIdentity();\n\n} \/\/ render\n\nint main(void)\n{\n\t\/* Initialize the library *\/\n\tif (!glfwInit())\n\t{\n\t\treturn -1;\n\t}\n\n\t\/* Create a windowed mode window and its OpenGL context *\/\n\twindow = glfwCreateWindow(640, 480, \"Hello World\", NULL, NULL);\n\tif (!window)\n\t{\n\t\tglfwTerminate();\n\t\treturn -1;\n\t}\n\n\t\/* Make the window's context current *\/\n\tglfwMakeContextCurrent(window);\n\n\t\/\/initialise the window\n\tif (!initialise())\n\t{\n\t\tglfwTerminate();\n\t\treturn -1;\n\t}\n\n\t\/\/ Monitor the elapsed time per frame\n\tauto currentTimeStamp = system_clock::now();\n\tauto prevTimeStamp = system_clock::now();\n\n\n\t\/* Loop until the user closes the window *\/\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\t\/\/ Get current time\n\t\tcurrentTimeStamp = system_clock::now();\n\t\t\/\/ Calculate elapsed time\n\t\tauto elapsed = duration_cast<milliseconds>(currentTimeStamp\n\t\t\t\t- prevTimeStamp);\n\t\t\/\/Convert to fractions of a second\n\t\tauto seconds = double(elapsed.count()) \/ 1000.0;\n\n\t\t\/\/ Update Application\n\t\tupdate(seconds);\n\t\t\/\/Render scene\n\t\trender();\n\n\t\t\/* Swap front and back buffers *\/\n\t\tglfwSwapBuffers(window);\n\n\t\t\/* Poll for and process events *\/\n\t\tglfwPollEvents();\n\n\t\t\/\/ set the previous time stamp to current time stamp\n\t\tprevTimeStamp = currentTimeStamp;\n\t} \/\/ Main Loop\n\n\tglfwTerminate();\n\treturn 0;\n} \/\/ main\n<commit_msg>Implemented user controled scale, rotate and move<commit_after>\/\/ Test.cpp\n\/\/ Sean Jones\n\n#define GLFW_INCLUDE_GLU\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/constants.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/core\/type_vec3.hpp>\n#include <vector>\n#include <random>\n#include <chrono>\n\n\/\/ For Debug\n#include <iostream>\n\n\nusing namespace glm;\nusing namespace std;\nusing namespace std::chrono;\n\nGLFWwindow* window;\n\nbool running = true;\n\n\/\/ Number of points to generate\nconst int num_points = 50000;\n\/\/ Points generated\nvector<vec2> points;\n\n\/\/ Value to keep track of current orientation on axis\nfloat objOrientation = 0.0f;\n\/\/ Keep track of position\nglm::vec3 objPosition(0.0f, 0.0f, 0.0f);\n\/\/ Keep track of scale\nfloat objScale = 1.0f;\n\n\/\/ Keep track of current mode\nbool TRANSLATIONMODE = true;\n\nbool initialise()\n{\n\t\/\/ Set background to white.\n\tglClearColor(1.0f, 1.0f, 1.0f, 1.0f);\n\tglColor3f(1.0f, 0.0f, 0.0f);\n\n\t\/\/ Enable face culling\n\tglEnable(GL_CULL_FACE);\n\n\t\/\/ The three points we randomly select from\n\tvec2 v[3] =\n\t{\n\t\t\tvec2(-1.0f, -1.0f),\n\t\t\tvec2(0.0f, 1.0f),\n\t\t\tvec2(1.0f, -1.0f)\n\t};\n\n\t\/\/ Add starting point\n\tpoints.push_back(vec2(0.25f, 0.5f));\n\n\t\/\/ Create a random engine\n\tdefault_random_engine re;\n\n\t\/\/ Create a distribution. 3 points in array, so get 0, 1 or 2.\n\tuniform_int_distribution<int> dist(0,2);\n\n\n\tint k;\n\tfor(k=0; k <5000; k++)\n\t{\n\t\tfloat x,y;\n\n\t\tint r = dist(re);\n\n\t\t\/* compute point halfway between vertex and old point *\/\n\t\tpoints.push_back(vec2(\n\t\t\t\t(points.at(points.size()-1).x + v[r].x)\/2.0,\n\t\t\t\t(points.at(points.size()-1).y + v[r].y)\/2.0));\n\t}\n\n\treturn true;\n} \/\/ initialise\n\nstatic void key_callback(GLFWwindow* window, int key, int scancode, int action, int mods) {\n\tif (key == GLFW_KEY_SPACE && action == GLFW_PRESS) {\n\t\tif (TRANSLATIONMODE == true) {\n\t\t\tTRANSLATIONMODE = false;\n\t\t} else {\n\t\t\tTRANSLATIONMODE = true;\n\t\t}\n\n\t}\n} \/\/ Key_callback\n\nvoid userRotation(double deltaTime) {\n\n\tif (glfwGetKey(window, GLFW_KEY_RIGHT)){\n\t\tobjOrientation += (deltaTime * pi<float>());\n\t}\n\tif (glfwGetKey(window, GLFW_KEY_LEFT)){\n\t\tobjOrientation -= (deltaTime * pi<float>());\n\t}\n\n}\n\n\/*\n * userScale\n *\n * Increases and decreases the scale of the object.\n *\/\nvoid userScale(double deltaTime) {\n\tif (glfwGetKey(window, GLFW_KEY_UP)){\n\t\tobjScale += 1.0f * float(deltaTime);\n\t}\n\tif (glfwGetKey(window, GLFW_KEY_DOWN)){\n\t\tobjScale -= 1.0f * float(deltaTime);\n\t}\n\n}\n\n\/*\n * userTranslation\n *\n * moves the object around inside the window using the keyboard arrow keys.\n *\/\nvoid userTranslation(double deltaTime) {\n\t\/\/ Move the quad when arrow keys are pressed\n\tif (glfwGetKey(window, GLFW_KEY_RIGHT)){\n\t\tif (objPosition.x < (1 - (objScale\/2))) {\n\t\t\tobjPosition += vec3(1.0f, 0.0f, 0.0f) * float(deltaTime);\n\t\t}\n\t}\n\tif (glfwGetKey(window, GLFW_KEY_LEFT)){\n\t\tif (objPosition.x > (-1.0 + (objScale\/2))) {\n\t\t\tobjPosition -= vec3(1.0f, 0.0f, 0.0f) * float(deltaTime);\n\t\t}\n\t}\n\tif (glfwGetKey(window, GLFW_KEY_UP)){\n\t\tif (objPosition.y < (1.0 - (objScale\/2))) {\n\t\t\tobjPosition += vec3(0.0f, 1.0f, 0.0f) * float(deltaTime);\n\t\t}\n\t}\n\tif (glfwGetKey(window, GLFW_KEY_DOWN)){\n\t\tif (objPosition.y > (-1.0 + (objScale\/2))) {\n\t\t\tobjPosition -= vec3(0.0f, 1.0f, 0.0f) * float(deltaTime);\n\t\t}\n\t}\n\n} \/\/ userTranslation\n\n\/\/updates the application\nvoid update(double deltaTime)\n{\n\t\/\/ Check if escape pressed or window is closed\n\trunning = !glfwGetKey(window, GLFW_KEY_ESCAPE) &&\n\t\t\t!glfwWindowShouldClose(window);\n\n\tif (TRANSLATIONMODE) {\n\t\tuserTranslation(deltaTime);\n\t} else {\n\t\tuserScale(deltaTime);\n\t\tuserRotation(deltaTime);\n\t}\n\n} \/\/ update\n\n\/\/renders the application\nvoid render()\n{\n\t\/\/ Create model matrix\n\tauto model = translate(mat4(1.0f), objPosition);\n\t\/\/ Scale the triangle\n\tmodel *= scale(objScale, objScale, objScale);\n\t\/\/ Create rotation transform. Use Z-axis\n\tmodel *= rotate(mat4(10.f),\n\t\t\t\t\tdegrees(objOrientation),\n\t\t\t vec3(0.0f, 0.0f, 1.0f));\n\n\t\/\/ Set matrix mode\n\tglMatrixMode(GL_MODELVIEW);\n\t\/\/ Load model matrix\n\tglLoadMatrixf(value_ptr(model));\n\n\t\/\/ Clear the screen\n\tglClear(GL_COLOR_BUFFER_BIT);\n\t\/\/ Set Colour to black\n\tglColor3f(0.0f, 0.0f, 0.0f);\n\n\t\/\/Render a Triangle\n\tglBegin(GL_POINTS);\n\tfor (vec2& point : points) {\n\t\tglVertex2fv(value_ptr(point));\n\t}\n\tglEnd();\n\n\t\/\/ Swap front and back buffers\n\tglfwSwapBuffers(window);\n\n\t\/\/ Set transform matrix to identity (no transform)\n\tglLoadIdentity();\n\n} \/\/ render\n\nint main(void)\n{\n\t\/* Initialise the library *\/\n\tif (!glfwInit())\n\t{\n\t\treturn -1;\n\t}\n\n\t\/* Create a windowed mode window and its OpenGL context *\/\n\twindow = glfwCreateWindow(640, 480, \"Hello World\", NULL, NULL);\n\tif (!window)\n\t{\n\t\tglfwTerminate();\n\t\treturn -1;\n\t}\n\n\t\/* Make the window's context current *\/\n\tglfwMakeContextCurrent(window);\n\n glfwSetKeyCallback(window, key_callback);\n\n\t\/\/initialise the window\n\tif (!initialise())\n\t{\n\t\tglfwTerminate();\n\t\treturn -1;\n\t}\n\n\t\/\/ Monitor the elapsed time per frame\n\tauto currentTimeStamp = system_clock::now();\n\tauto prevTimeStamp = system_clock::now();\n\n\n\t\/* Loop until the user closes the window *\/\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\t\/\/ Get current time\n\t\tcurrentTimeStamp = system_clock::now();\n\t\t\/\/ Calculate elapsed time\n\t\tauto elapsed = duration_cast<milliseconds>(currentTimeStamp\n\t\t\t\t- prevTimeStamp);\n\t\t\/\/Convert to fractions of a second\n\t\tauto seconds = double(elapsed.count()) \/ 1000.0;\n\n\t\t\/\/ Update Application\n\t\tupdate(seconds);\n\t\t\/\/Render scene\n\t\trender();\n\n\t\t\/* Swap front and back buffers *\/\n\t\tglfwSwapBuffers(window);\n\n\t\t\/* Poll for and process events *\/\n\t\tglfwPollEvents();\n\n\t\t\/\/ set the previous time stamp to current time stamp\n\t\tprevTimeStamp = currentTimeStamp;\n\t} \/\/ Main Loop\n\n\tglfwTerminate();\n\treturn 0;\n} \/\/ main\n<|endoftext|>"} {"text":"<commit_before>#ifndef RPT_XMLIMAGE_HXX\n#define RPT_XMLIMAGE_HXX\n\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlImage.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2007-07-09 11:56:18 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef RPT_XMLREPORTELEMENTBASE_HXX\n#include \"xmlReportElementBase.hxx\"\n#endif\n#ifndef _COM_SUN_STAR_REPORT_XImageControl_HPP_\n#include <com\/sun\/star\/report\/XImageControl.hpp>\n#endif\n\nnamespace rptxml\n{\n class ORptFilter;\n class OXMLImage : public OXMLReportElementBase\n {\n OXMLImage(const OXMLImage&);\n void operator =(const OXMLImage&);\n public:\n\n OXMLImage( ORptFilter& rImport, sal_uInt16 nPrfx,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList > & xAttrList\n ,const ::com::sun::star::uno::Reference< ::com::sun::star::report::XImageControl >& _xComponent\n ,OXMLTable* _pContainer);\n virtual ~OXMLImage();\n };\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace rptxml\n\/\/ -----------------------------------------------------------------------------\n\n#endif \/\/ RPT_XMLIMAGE_HXX\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.104); FILE MERGED 2008\/04\/01 12:33:11 thb 1.2.104.2: #i85898# Stripping all external header guards 2008\/03\/31 13:32:09 rt 1.2.104.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlImage.hxx,v $\n * $Revision: 1.3 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef RPT_XMLIMAGE_HXX\n#define RPT_XMLIMAGE_HXX\n\n#include \"xmlReportElementBase.hxx\"\n#ifndef _COM_SUN_STAR_REPORT_XImageControl_HPP_\n#include <com\/sun\/star\/report\/XImageControl.hpp>\n#endif\n\nnamespace rptxml\n{\n class ORptFilter;\n class OXMLImage : public OXMLReportElementBase\n {\n OXMLImage(const OXMLImage&);\n void operator =(const OXMLImage&);\n public:\n\n OXMLImage( ORptFilter& rImport, sal_uInt16 nPrfx,\n const ::rtl::OUString& rLName,\n const ::com::sun::star::uno::Reference< ::com::sun::star::xml::sax::XAttributeList > & xAttrList\n ,const ::com::sun::star::uno::Reference< ::com::sun::star::report::XImageControl >& _xComponent\n ,OXMLTable* _pContainer);\n virtual ~OXMLImage();\n };\n\/\/ -----------------------------------------------------------------------------\n} \/\/ namespace rptxml\n\/\/ -----------------------------------------------------------------------------\n\n#endif \/\/ RPT_XMLIMAGE_HXX\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"generic_dbn_desc.hpp\"\n\nnamespace dll {\n\ntemplate <typename Layers, typename... Parameters>\nusing dbn_desc = generic_dbn_desc<dbn, Layers, Parameters...>;\n\ntemplate <typename Layers>\nstruct dyn_layers_t;\n\ntemplate <bool Labels, typename... Layers>\nstruct dyn_layers_t <dll::detail::layers<Labels, Layers...>> {\n using dyn_t = dll::detail::layers<Labels, typename Layers::desc::dyn_layer_t...>;\n};\n\ntemplate <template <typename> class DBN_T, typename Layers, typename... Parameters>\nstruct generic_dyn_dbn_desc : generic_dbn_desc<DBN_T, Layers, Parameters...> {\n \/* Dynify the layers *\/\n using layers = typename dyn_layers_t<Layers>::dyn_t;\n using base_layers = Layers;\n\n \/*! The DBN type *\/\n using dbn_t = DBN_T<generic_dyn_dbn_desc<DBN_T, Layers, Parameters...>>;\n};\n\ntemplate <typename Layers, typename... Parameters>\nusing dyn_dbn_desc = generic_dyn_dbn_desc<dbn, Layers, Parameters...>;\n\n} \/\/end of dll namespace\n<commit_msg>Add support for automatic hybrid compilation<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"generic_dbn_desc.hpp\"\n\nnamespace dll {\n\ntemplate <typename Layers>\nstruct dyn_layers_t;\n\ntemplate <bool Labels, typename... Layers>\nstruct dyn_layers_t <dll::detail::layers<Labels, Layers...>> {\n using dyn_t = dll::detail::layers<Labels, typename Layers::desc::dyn_layer_t...>;\n};\n\ntemplate <template <typename> class DBN_T, typename Layers, typename... Parameters>\nstruct generic_dyn_dbn_desc : generic_dbn_desc<DBN_T, Layers, Parameters...> {\n \/* Dynify the layers *\/\n using layers = typename dyn_layers_t<Layers>::dyn_t;\n using base_layers = Layers;\n\n \/*! The DBN type *\/\n using dbn_t = DBN_T<generic_dyn_dbn_desc<DBN_T, Layers, Parameters...>>;\n};\n\ntemplate <typename Layers, typename... Parameters>\nusing dyn_dbn_desc = generic_dyn_dbn_desc<dbn, Layers, Parameters...>;\n\n\/\/ By default dbn_desc use directly the layers that it is provided\n\/\/ if DLL_QUICK is set, it is set to hybrid mode by default\n\n#ifndef DLL_QUICK\ntemplate <typename Layers, typename... Parameters>\nusing dbn_desc = generic_dbn_desc<dbn, Layers, Parameters...>;\n#else\ntemplate <typename Layers, typename... Parameters>\nusing dbn_desc = generic_dyn_dbn_desc<dbn, Layers, Parameters...>;\n#endif\n\n\/\/ fast_dbn_desc is always forced to direct mode, will not respect\n\/\/ DLL_QUICK\n\ntemplate <typename Layers, typename... Parameters>\nusing fast_dbn_desc = generic_dbn_desc<dbn, Layers, Parameters...>;\n\n} \/\/end of dll namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015, 2016, Intel Corporation\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * * Neither the name of Intel Corporation nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY LOG OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <hwloc.h>\n\n#include \"geopm_message.h\"\n#include \"geopm_plugin.h\"\n#include \"GoverningDecider.hpp\"\n#include \"Exception.hpp\"\n\nint geopm_plugin_register(int plugin_type, struct geopm_factory_c *factory)\n{\n int err = 0;\n\n try {\n if (plugin_type == GEOPM_PLUGIN_TYPE_DECIDER) {\n geopm::Decider *decider = new geopm::GoverningDecider;\n geopm_factory_register(factory, decider);\n }\n }\n catch(...) {\n err = geopm::exception_handler(std::current_exception());\n }\n\n return err;\n}\n\nnamespace geopm\n{\n GoverningDecider::GoverningDecider()\n : m_name(\"governing\")\n , m_guard_band(0.05)\n , m_min_num_converged(5)\n , m_last_power_budget(DBL_MIN)\n {\n\n }\n\n GoverningDecider::~GoverningDecider()\n {\n\n }\n\n bool GoverningDecider::decider_supported(const std::string &description)\n {\n return (description == m_name);\n }\n\n const std::string& GoverningDecider::name(void) const\n {\n return m_name;\n }\n\n bool GoverningDecider::update_policy(const struct geopm_policy_message_s &policy_msg, Policy &curr_policy)\n {\n bool result = false;\n if (policy_msg.power_budget != m_last_power_budget) {\n int num_domain = curr_policy.num_domain();\n double split_budget = policy_msg.power_budget \/ num_domain;\n std::vector<double> domain_budget(num_domain);\n std::fill(domain_budget.begin(), domain_budget.end(), split_budget);\n std::vector<uint64_t> region_id;\n curr_policy.region_id(region_id);\n for (auto it = region_id.begin(); it != region_id.end(); ++it) {\n curr_policy.update(*it, domain_budget);\n }\n m_last_power_budget = policy_msg.power_budget;\n result = true;\n }\n return result;\n }\n\n bool GoverningDecider::update_policy(Region &curr_region, Policy &curr_policy)\n {\n const int num_domain = curr_policy.num_domain();\n const uint64_t region_id = curr_region.identifier();\n bool is_updated = false;\n\n std::vector<double> target(num_domain);\n curr_policy.target(region_id, target);\n for (int domain_idx = 0; domain_idx < num_domain; ++domain_idx) {\n double pkg_power = curr_region.derivative(domain_idx, GEOPM_TELEMETRY_TYPE_PKG_ENERGY);\n double dram_power = curr_region.derivative(domain_idx, GEOPM_TELEMETRY_TYPE_DRAM_ENERGY);\n double total_power = pkg_power + dram_power;\n if (total_power > target[domain_idx] * (1 + m_guard_band) ||\n total_power < target[domain_idx] * (1 - m_guard_band)) {\n target[domain_idx] -= dram_power;\n is_updated = true;\n }\n }\n if (is_updated) {\n curr_policy.update(region_id, target);\n auto it = m_num_converged.find(region_id);\n if (it == m_num_converged.end()) {\n it = m_num_converged.insert(m_num_converged.begin(), std::pair<uint64_t, unsigned>(region_id, 0));\n }\n else {\n (*it).second = 0;\n }\n curr_policy.is_converged(region_id, false);\n\n }\n else {\n auto it = m_num_converged.find(region_id);\n if (it == m_num_converged.end()) {\n it = m_num_converged.insert(m_num_converged.begin(), std::pair<uint64_t, unsigned>(region_id, 1));\n }\n else {\n ++(*it).second;\n }\n if ((*it).second >= m_min_num_converged) {\n curr_policy.is_converged(region_id, true);\n }\n }\n return is_updated;\n }\n}\n<commit_msg>Improve speed of map insertion in GoverningDecider.<commit_after>\/*\n * Copyright (c) 2015, 2016, Intel Corporation\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * * Neither the name of Intel Corporation nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY LOG OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <hwloc.h>\n\n#include \"geopm_message.h\"\n#include \"geopm_plugin.h\"\n#include \"GoverningDecider.hpp\"\n#include \"Exception.hpp\"\n\nint geopm_plugin_register(int plugin_type, struct geopm_factory_c *factory)\n{\n int err = 0;\n\n try {\n if (plugin_type == GEOPM_PLUGIN_TYPE_DECIDER) {\n geopm::Decider *decider = new geopm::GoverningDecider;\n geopm_factory_register(factory, decider);\n }\n }\n catch(...) {\n err = geopm::exception_handler(std::current_exception());\n }\n\n return err;\n}\n\nnamespace geopm\n{\n GoverningDecider::GoverningDecider()\n : m_name(\"governing\")\n , m_guard_band(0.05)\n , m_min_num_converged(5)\n , m_last_power_budget(DBL_MIN)\n {\n\n }\n\n GoverningDecider::~GoverningDecider()\n {\n\n }\n\n bool GoverningDecider::decider_supported(const std::string &description)\n {\n return (description == m_name);\n }\n\n const std::string& GoverningDecider::name(void) const\n {\n return m_name;\n }\n\n bool GoverningDecider::update_policy(const struct geopm_policy_message_s &policy_msg, Policy &curr_policy)\n {\n bool result = false;\n if (policy_msg.power_budget != m_last_power_budget) {\n int num_domain = curr_policy.num_domain();\n double split_budget = policy_msg.power_budget \/ num_domain;\n std::vector<double> domain_budget(num_domain);\n std::fill(domain_budget.begin(), domain_budget.end(), split_budget);\n std::vector<uint64_t> region_id;\n curr_policy.region_id(region_id);\n for (auto it = region_id.begin(); it != region_id.end(); ++it) {\n curr_policy.update(*it, domain_budget);\n }\n m_last_power_budget = policy_msg.power_budget;\n result = true;\n }\n return result;\n }\n\n bool GoverningDecider::update_policy(Region &curr_region, Policy &curr_policy)\n {\n const int num_domain = curr_policy.num_domain();\n const uint64_t region_id = curr_region.identifier();\n bool is_updated = false;\n\n std::vector<double> target(num_domain);\n curr_policy.target(region_id, target);\n for (int domain_idx = 0; domain_idx < num_domain; ++domain_idx) {\n double pkg_power = curr_region.derivative(domain_idx, GEOPM_TELEMETRY_TYPE_PKG_ENERGY);\n double dram_power = curr_region.derivative(domain_idx, GEOPM_TELEMETRY_TYPE_DRAM_ENERGY);\n double total_power = pkg_power + dram_power;\n if (total_power > target[domain_idx] * (1 + m_guard_band) ||\n total_power < target[domain_idx] * (1 - m_guard_band)) {\n target[domain_idx] -= dram_power;\n is_updated = true;\n }\n }\n if (is_updated) {\n curr_policy.update(region_id, target);\n auto it = m_num_converged.lower_bound(region_id);\n if (it != m_num_converged.end() && (*it).first == region_id) {\n (*it).second = 0;\n }\n else {\n it = m_num_converged.insert(it, std::pair<uint64_t, unsigned>(region_id, 0));\n }\n curr_policy.is_converged(region_id, false);\n }\n else {\n auto it = m_num_converged.lower_bound(region_id);\n if (it != m_num_converged.end() && (*it).first == region_id) {\n ++(*it).second;\n }\n else {\n it = m_num_converged.insert(it, std::pair<uint64_t, unsigned>(region_id, 1));\n }\n if ((*it).second >= m_min_num_converged) {\n curr_policy.is_converged(region_id, true);\n }\n }\n return is_updated;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"config.h\"\n\nConfig::Config(const bfs::path& config_path) {\n if(config_path.is_absolute()) {\n path = config_path;\n }\n else if(BuildVars::sysconfdir.is_absolute()) {\n path = BuildVars::sysconfdir \/ config_path;\n }\n else {\n path = BuildVars::install_prefix \/ BuildVars::sysconfdir \/ config_path;\n }\n \n read_ini(path.string(), vars);\n return;\n}\n\nConfig::Config(const std::string& config_path) : Config::Config(bfs::path(config_path)) {\n}\n\nstd::string Config::get(const std::string& key) const {\n return vars.get<std::string>(key);\n}\n<commit_msg>What did I change?<commit_after>#include \"config.h\"\n\nConfig::Config(const bfs::path& config_path) {\n if(config_path.is_absolute()) {\n path = config_path;\n }\n else if(BuildVars::sysconfdir.is_absolute()) {\n path = BuildVars::sysconfdir \/ config_path;\n }\n else {\n path = BuildVars::install_prefix \/ BuildVars::sysconfdir \/ config_path;\n }\n \n bpt::read_ini(path.string(), vars);\n return;\n}\n\nConfig::Config(const std::string& config_path) : Config::Config(bfs::path(config_path)) {\n}\n\nstd::string Config::get(const std::string& key) const {\n return vars.get<std::string>(key);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"System.h\"\n#include \"Display.h\"\n\n#include \"interface.h\"\n#include \"Signals.h\"\n\nConsole c(USART2, 115200);\nScreen mainScreen = Screen();\nScreen settingsScreen = Screen();\n\nextern \"C\" void TIM3_IRQHandler(void) {\n\tif (TIM_GetITStatus (TIM3, TIM_IT_Update) != RESET) {\n\t\tTIM_ClearITPendingBit(TIM3, TIM_IT_Update);\n\t\tint val = ecg.read();\n\t\tc.print(val);\n\t\tc.print(\"\\n\");\n\t}\n}\n\nvoid MainScreenInit(void){\n tft.fillScreen(RA8875_BLACK);\n tft.showGrid();\n mainScreen.initialDraw();\n}\n\nvoid SettingsScreenInit(void){\n tft.fillScreen(RA8875_BLACK);\n tft.showGrid();\n settingsScreen.initialDraw();\n}\n\n\nvoid systemInit() {\n\tadcInit();\n \ttft.startup();\n composeMainScreen(mainScreen);\n composeSettingsScreen(settingsScreen);\n connectSignalsToScreen(mainScreen);\n enableSignalAcquisition();\n}\n\nint main(void)\n{\n\tc.configure();\n\tc.print(\"\\n\");\n\tc.print(\"Starting FreePulse...\\n\");\n\tsystemInit();\n\tc.print(\"Welcome!\\n\");\n\twhile (1) {\n\t\tMainScreenInit();\n\t\tdelay(1000);\n\t\ttft.read_touch();\n\t\ttft.reset_touch();\n\t\twhile (currentMode == home) {\n\t\t\twhile (digitalRead(tft.interrupt)){\n mainScreen.update();\n\t\t\t\tdelay(100);\n\t\t\t}\n\t\t\ttft.read_touch();\t\n mainScreen.listenForTouch();\n\t\t\ttft.drawPixel(tft.touch_points[0],tft.touch_points[1], RA8875_WHITE);\n\t\t}\n\t\tif (currentMode == settings) {\n\t\t\tSettingsScreenInit();\n\t\t\tdelay(1000);\n\t\t\ttft.read_touch();\n\t\t\ttft.reset_touch();\n\t\t\twhile (currentMode == settings) {\n\t\t\t\twhile (digitalRead(tft.interrupt)){}\n\t\t\t\ttft.read_touch();\n settingsScreen.listenForTouch();\n\t\t\t\ttft.drawPixel(tft.touch_points[0],tft.touch_points[1], RA8875_WHITE);\n\t\t\t}\n\t\t}\n }\n return 0; \n}\n<commit_msg>Add print calls to debug touch screen<commit_after>#include \"System.h\"\n#include \"Display.h\"\n\n#include \"interface.h\"\n#include \"Signals.h\"\n\nConsole c(USART2, 115200);\nScreen mainScreen = Screen();\nScreen settingsScreen = Screen();\n\nextern \"C\" void TIM3_IRQHandler(void) {\n\tif (TIM_GetITStatus (TIM3, TIM_IT_Update) != RESET) {\n\t\tTIM_ClearITPendingBit(TIM3, TIM_IT_Update);\n\t\tint val = ecg.read();\n\t\t\/* c.print(val); *\/\n\t\t\/* c.print(\"\\n\"); *\/\n\t}\n}\n\nvoid MainScreenInit(void){\n tft.fillScreen(RA8875_BLACK);\n tft.showGrid();\n mainScreen.initialDraw();\n}\n\nvoid SettingsScreenInit(void){\n tft.fillScreen(RA8875_BLACK);\n tft.showGrid();\n settingsScreen.initialDraw();\n}\n\n\nvoid systemInit() {\n\tadcInit();\n \ttft.startup();\n composeMainScreen(mainScreen);\n composeSettingsScreen(settingsScreen);\n connectSignalsToScreen(mainScreen);\n enableSignalAcquisition();\n}\n\nint main(void)\n{\n\tc.configure();\n\tc.print(\"\\n\");\n\tc.print(\"Starting FreePulse...\\n\");\n\tsystemInit();\n\tc.print(\"Welcome!\\n\");\n\twhile (1) {\n\t\tMainScreenInit();\n\t\tdelay(1000);\n\t\ttft.read_touch();\n\t\ttft.reset_touch();\n\t\twhile (currentMode == home) {\n\t\t\twhile (digitalRead(tft.interrupt)){\n mainScreen.update();\n\t\t\t\tdelay(1000);\n\t\t\t}\n delay(1000);\n\t\t\ttft.read_touch();\n c.print(\"x: \");\n c.print(tft.touch_points[0]);\n c.print(\", y: \");\n c.print(tft.touch_points[1]);\n c.print(\"\\n\");\n mainScreen.listenForTouch();\n\t\t\ttft.drawPixel(tft.touch_points[0],tft.touch_points[1], RA8875_WHITE);\n\t\t}\n\t\tif (currentMode == settings) {\n\t\t\tSettingsScreenInit();\n\t\t\tdelay(1000);\n\t\t\ttft.read_touch();\n\t\t\ttft.reset_touch();\n\t\t\twhile (currentMode == settings) {\n\t\t\t\twhile (digitalRead(tft.interrupt)){}\n\t\t\t\ttft.read_touch();\n settingsScreen.listenForTouch();\n\t\t\t\ttft.drawPixel(tft.touch_points[0],tft.touch_points[1], RA8875_WHITE);\n\t\t\t}\n\t\t}\n }\n return 0; \n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file function.hpp\n * \\brief Activation functions for neural networks\n *\/\n\n#pragma once\n\nnamespace dll {\n\n\/*!\n * \\brief An activation function\n *\/\nenum class function {\n IDENTITY, \/\/\/< Identity activation function\n SIGMOID, \/\/\/< Sigmoid activation function\n TANH, \/\/\/< Hyperbolic tangent\n RELU, \/\/\/< Rectified Linear Unit\n SOFTMAX \/\/\/< Softmax\n};\n\ninline std::string to_string(function f) {\n switch (f) {\n case function::IDENTITY:\n return \"IDENTITY\";\n case function::SIGMOID:\n return \"SIGMOID\";\n case function::TANH:\n return \"TANH\";\n case function::RELU:\n return \"RELU\";\n case function::SOFTMAX:\n return \"SOFTMAX\";\n }\n\n cpp_unreachable(\"Unreachable code\");\n\n return \"UNDEFINED\";\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::IDENTITY)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::identity(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::SIGMOID)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::sigmoid(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::TANH)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::tanh(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::RELU)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::relu(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::SOFTMAX)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::softmax(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::IDENTITY)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::identity_derivative(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::SIGMOID)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::sigmoid_derivative(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::TANH)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::tanh_derivative(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::RELU)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::relu_derivative(std::forward<E>(expr));\n}\n\ntemplate <function F, typename E, cpp_enable_if(F == function::SOFTMAX)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::softmax_derivative(std::forward<E>(expr));\n}\n\n} \/\/end of dll namespace\n<commit_msg>Some doc<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file function.hpp\n * \\brief Activation functions for neural networks\n *\/\n\n#pragma once\n\nnamespace dll {\n\n\/*!\n * \\brief An activation function\n *\/\nenum class function {\n IDENTITY, \/\/\/< Identity activation function\n SIGMOID, \/\/\/< Sigmoid activation function\n TANH, \/\/\/< Hyperbolic tangent\n RELU, \/\/\/< Rectified Linear Unit\n SOFTMAX \/\/\/< Softmax\n};\n\n\/*!\n * \\brief Returns a string representation of an activation function\n * \\param f The function to transform to string\n * \\return a string representation of an activation function\n *\/\ninline std::string to_string(function f) {\n switch (f) {\n case function::IDENTITY:\n return \"IDENTITY\";\n case function::SIGMOID:\n return \"SIGMOID\";\n case function::TANH:\n return \"TANH\";\n case function::RELU:\n return \"RELU\";\n case function::SOFTMAX:\n return \"SOFTMAX\";\n }\n\n cpp_unreachable(\"Unreachable code\");\n\n return \"UNDEFINED\";\n}\n\n\/*!\n * \\brief Computes the activations from the given input using the specified activation function\n * \\param expr The input expression\n * \\tparam F The activation function to use\n * \\return The result of the activation function\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::IDENTITY)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::identity(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_activate\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::SIGMOID)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::sigmoid(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_activate\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::TANH)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::tanh(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_activate\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::RELU)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::relu(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_activate\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::SOFTMAX)>\ndecltype(auto) f_activate(E&& expr) {\n return etl::softmax(std::forward<E>(expr));\n}\n\n\/*!\n * \\brief Computes the derivatives from the given output using the specified activation function\n * \\param expr The input expression\n * \\tparam F The activation function to use\n * \\return The derivative of the activation function\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::IDENTITY)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::identity_derivative(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_derivative\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::SIGMOID)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::sigmoid_derivative(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_derivative\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::TANH)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::tanh_derivative(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_derivative\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::RELU)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::relu_derivative(std::forward<E>(expr));\n}\n\n\/*!\n * \\copydoc f_derivative\n *\/\ntemplate <function F, typename E, cpp_enable_if(F == function::SOFTMAX)>\ndecltype(auto) f_derivative(E&& expr) {\n return etl::softmax_derivative(std::forward<E>(expr));\n}\n\n} \/\/end of dll namespace\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include <iostream>\n#include \"parser.h\"\n#include \"scanner.h\"\n#include \"exp.h\"\n#include <sstream>\n\nusing namespace std;\n\n\nstring& checkcomanndcc123456(string &s) {\nint i = 0, index = 0;\nstring ss = \"\";\n\n if (s.empty()) {\n return s;\n }\n for(i=0 ; i<s.size() ; i++){\n if(s[i] != ' '){\n index = i;\n ss = ss + s[i];\n }\n }\n s = ss;\n return s;\n }\n\nint main( int argc , char **argv ) {\n string input;\n\n\tdo {\n\t\tcout << \"?-\";\n\t\tgetline(cin, input);\n\t\tif (checkcomanndcc123456(input) == \"halt.\"){\n break;\n }\n\t\tif (checkcomanndcc123456(input) == \"\"){\n continue;\n }\n\t\tScanner s(input);\n\t\tParser p(s);\n\t\ttry{\n\t\t\tp.buildExpression();\n\t\t\tstring result = p.getExpressionTree()->getExpressionResult() + '.';\n\t\t\tcout << result << endl;\n\t\t} catch (std::string & msg) {\n\t\t\tcout << msg << endl;\n\t\t}\n\t} while(true);\n return 0;\n}\n<commit_msg>HW8<commit_after>#include <gtest\/gtest.h>\n#include <iostream>\n#include \"parser.h\"\n#include \"scanner.h\"\n#include \"exp.h\"\n#include <sstream>\n\nusing namespace std;\n\n\nstring& checkcomanndcc123456(string &s) {\nint i = 0, index = 0;\nstring ss = \"\";\n\n if (s.empty()) {\n return s;\n }\n for(i=0 ; i<s.size() ; i++){\n if(s[i] != ' '){\n index = i;\n ss = ss + s[i];\n }\n }\n s = ss;\n return s;\n }\n\nint main( int argc , char **argv ) {\n string input, part, code = \"\";\n stringstream inputStream;\n\n\tdo {\n while ( input == \"\" || input.back() != '.') {\n if(input ==\"\"){\n cout << \"?-\";\n }else{\n cout << \"| \";\n }\n getline(cin, input);\n inputStream << input;\n while ( inputStream >> part)\n code += part ;\n\n inputStream.str(\"\"); \/\/ must have\n inputStream.clear(); \/\/ for reuse inputStream\n }\n\n\t\t\/\/ getline(cin, input);\n\t\t\/\/ if (checkcomanndcc123456(input) == \"halt.\"){\n \/\/ break;\n \/\/ }\n\t\t\/\/ if (checkcomanndcc123456(input) == \"\"){\n \/\/ continue;\n \/\/ }\n \/\/ if (checkcomanndcc123456(input) != \".\"){\n \/\/\n \/\/ }\n\t\tScanner s(input);\n\t\tParser p(s);\n\t\ttry{\n\t\t\tp.buildExpression();\n\t\t\tstring result = p.getExpressionTree()->getExpressionResult() + '.';\n\t\t\tcout << result << endl;\n\t\t} catch (std::string & msg) {\n\t\t\tcout << msg << endl;\n\t\t}\n\t} while(true);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/interprocess\/sync\/named_upgradable_mutex.hpp>\n#include <boost\/interprocess\/shared_memory_object.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include <boost\/interprocess\/sync\/sharable_lock.hpp>\n#include <boost\/interprocess\/sync\/scoped_lock.hpp>\n#include <string>\n#include <map>\n#include <util\/izene_serialization.h>\n#include <iostream>\n#include <glog\/logging.h>\n#include <signal.h>\n\nusing namespace std;\nusing namespace boost;\n\n#define SF1R_PROCESS_MUTEX_NAME \"sf1r_named_mutex_for_process\"\n#define SF1R_PROCESS_SHARED_MEM_NAME \"sf1r_shared_mem_for_process\"\n#define MAX_SHARED_SIZE 1024*32\n#define SLOW_THRESHOLD 10\ntypedef std::map<std::string, size_t> Sf1rSharedSlowCounterT;\n\nstatic volatile bool s_stop = false;\nstatic sigset_t maskset;\nstatic void* sig_thread(void *arg)\n{\n sigset_t *set = (sigset_t *)arg;\n int s,sig;\n for(;;){\n s = sigwait(set, &sig);\n if(s != 0)\n {\n exit(1);\n }\n switch(sig)\n {\n case SIGINT:\n case SIGHUP:\n case SIGQUIT:\n case SIGABRT:\n case SIGTERM:\n std::cout << \"got interrupt signal, begin quit\" << std::endl;\n s_stop = true;\n break;\n default:\n break;\n }\n }\n}\n\nvoid init_sig_env()\n{\n sigemptyset(&maskset);\n sigaddset(&maskset, SIGINT);\n sigaddset(&maskset, SIGHUP);\n sigaddset(&maskset, SIGQUIT);\n sigaddset(&maskset, SIGABRT);\n sigaddset(&maskset, SIGTERM);\n\n int ret;\n ret = pthread_sigmask(SIG_BLOCK, &maskset, NULL);\n if(ret != 0)\n {\n perror(\"failed to block signal\");\n exit(1);\n }\n\n pthread_t thread;\n ret = pthread_create(&thread, NULL, &sig_thread, (void*)&maskset);\n if(ret != 0)\n {\n perror(\"failed to create signal handle thread\");\n exit(1);\n }\n}\n\nvoid decreSlowCounterForAll()\n{\n \/\/ decrease the slow counter period.\n using namespace boost::interprocess;\n try\n {\n shared_memory_object shm_obj(open_only, SF1R_PROCESS_SHARED_MEM_NAME, read_write);\n mapped_region region(shm_obj, read_write);\n named_upgradable_mutex mutex(open_only, SF1R_PROCESS_MUTEX_NAME);\n LOG(INFO) << \"write lock begin : \";\n scoped_lock<named_upgradable_mutex> lock(mutex);\n\n LOG(INFO) << \"write lock success.\";\n Sf1rSharedSlowCounterT cur_shared_data;\n void *addr = region.get_address();\n size_t data_size = (*(int*)addr);\n if (data_size == 0)\n return;\n izenelib::util::izene_deserialization<Sf1rSharedSlowCounterT> izdeserial((char*)addr + sizeof(int), data_size);\n izdeserial.read_image(cur_shared_data);\n Sf1rSharedSlowCounterT::iterator it;\n it = cur_shared_data.begin();\n while(it != cur_shared_data.end())\n {\n if (it->second > 0)\n (it->second)--;\n ++it;\n }\n LOG(INFO) << \"current slow counter size :\" << cur_shared_data.size();\n\n char* buf;\n izenelib::util::izene_serialization<Sf1rSharedSlowCounterT> izs(cur_shared_data);\n izs.write_image(buf, data_size);\n if (data_size > MAX_SHARED_SIZE)\n {\n LOG(ERROR) << \"shared data is too large to write.\" << std::endl;\n return;\n }\n (*(int*)addr) = (int)data_size;\n memcpy((char*)addr + sizeof(int), buf, data_size);\n region.flush(0, region.get_size());\n }\n catch(const std::exception& e)\n {\n LOG(ERROR) << \"write shared memory failed : \" << e.what() << std::endl;\n return;\n }\n}\n\nvoid checking_func()\n{\n while(!s_stop)\n {\n struct timespec req, rem;\n req.tv_sec = 20;\n req.tv_nsec = 0;\n\n while(0 != nanosleep(&req, &rem))\n {\n if (errno == EINTR)\n req = rem;\n else\n {\n perror(\"sleep error.\");\n break;\n }\n }\n LOG(INFO) << \"decreasing slow counter period.\" << std::endl;\n decreSlowCounterForAll();\n }\n}\n\nint\nmain(int argc, char *argv[])\n{\n init_sig_env();\n using namespace boost::interprocess;\n shared_memory_object::remove(SF1R_PROCESS_SHARED_MEM_NAME);\n named_upgradable_mutex::remove(SF1R_PROCESS_MUTEX_NAME);\n\n shared_memory_object shm_obj(create_only, SF1R_PROCESS_SHARED_MEM_NAME, read_write);\n shm_obj.truncate(MAX_SHARED_SIZE);\n \n named_upgradable_mutex mutex(create_only, SF1R_PROCESS_MUTEX_NAME);\n\n LOG(INFO) << \"shared memory master started. \";\n boost::thread checking_thread(boost::bind(&checking_func));\n checking_thread.join();\n LOG(INFO) << \"shared data master quiting.\" << std::endl;\n shared_memory_object::remove(SF1R_PROCESS_SHARED_MEM_NAME);\n named_upgradable_mutex::remove(SF1R_PROCESS_MUTEX_NAME);\n return 0;\n}\n<commit_msg>reset shared memory data if data size is out of range.<commit_after>#include <boost\/interprocess\/sync\/named_upgradable_mutex.hpp>\n#include <boost\/interprocess\/shared_memory_object.hpp>\n#include <boost\/interprocess\/mapped_region.hpp>\n#include <boost\/interprocess\/sync\/sharable_lock.hpp>\n#include <boost\/interprocess\/sync\/scoped_lock.hpp>\n#include <string>\n#include <map>\n#include <util\/izene_serialization.h>\n#include <iostream>\n#include <glog\/logging.h>\n#include <signal.h>\n\nusing namespace std;\nusing namespace boost;\n\n#define SF1R_PROCESS_MUTEX_NAME \"sf1r_named_mutex_for_process\"\n#define SF1R_PROCESS_SHARED_MEM_NAME \"sf1r_shared_mem_for_process\"\n#define MAX_SHARED_SIZE 1024*32\n#define SLOW_THRESHOLD 10\ntypedef std::map<std::string, size_t> Sf1rSharedSlowCounterT;\n\nstatic volatile bool s_stop = false;\nstatic sigset_t maskset;\nstatic void* sig_thread(void *arg)\n{\n sigset_t *set = (sigset_t *)arg;\n int s,sig;\n for(;;){\n s = sigwait(set, &sig);\n if(s != 0)\n {\n exit(1);\n }\n switch(sig)\n {\n case SIGINT:\n case SIGHUP:\n case SIGQUIT:\n case SIGABRT:\n case SIGTERM:\n std::cout << \"got interrupt signal, begin quit\" << std::endl;\n s_stop = true;\n break;\n default:\n break;\n }\n }\n}\n\nvoid init_sig_env()\n{\n sigemptyset(&maskset);\n sigaddset(&maskset, SIGINT);\n sigaddset(&maskset, SIGHUP);\n sigaddset(&maskset, SIGQUIT);\n sigaddset(&maskset, SIGABRT);\n sigaddset(&maskset, SIGTERM);\n\n int ret;\n ret = pthread_sigmask(SIG_BLOCK, &maskset, NULL);\n if(ret != 0)\n {\n perror(\"failed to block signal\");\n exit(1);\n }\n\n pthread_t thread;\n ret = pthread_create(&thread, NULL, &sig_thread, (void*)&maskset);\n if(ret != 0)\n {\n perror(\"failed to create signal handle thread\");\n exit(1);\n }\n}\n\nvoid decreSlowCounterForAll()\n{\n \/\/ decrease the slow counter period.\n using namespace boost::interprocess;\n try\n {\n named_upgradable_mutex mutex(open_only, SF1R_PROCESS_MUTEX_NAME);\n LOG(INFO) << \"write lock begin : \";\n scoped_lock<named_upgradable_mutex> lock(mutex);\n\n LOG(INFO) << \"write lock success.\";\n shared_memory_object shm_obj(open_only, SF1R_PROCESS_SHARED_MEM_NAME, read_write);\n mapped_region region(shm_obj, read_write);\n\n Sf1rSharedSlowCounterT cur_shared_data;\n void *addr = region.get_address();\n size_t data_size = (*(int*)addr);\n if (data_size == 0)\n return;\n if (data_size >= MAX_SHARED_SIZE - sizeof(int))\n {\n LOG(ERROR) << \"the data_size is larger than shared memory size :\" << data_size;\n (*(int*)addr) = 0;\n std::memset((char*)addr + sizeof(int), 0, region.get_size() - sizeof(int));\n region.flush(0, region.get_size());\n return;\n }\n izenelib::util::izene_deserialization<Sf1rSharedSlowCounterT> izdeserial((const char*)addr + sizeof(int), data_size);\n izdeserial.read_image(cur_shared_data);\n Sf1rSharedSlowCounterT::iterator it;\n it = cur_shared_data.begin();\n while(it != cur_shared_data.end())\n {\n if (it->second > 0)\n (it->second)--;\n ++it;\n }\n LOG(INFO) << \"current slow counter size :\" << cur_shared_data.size();\n\n char* buf;\n izenelib::util::izene_serialization<Sf1rSharedSlowCounterT> izs(cur_shared_data);\n izs.write_image(buf, data_size);\n if (data_size >= MAX_SHARED_SIZE - sizeof(int))\n {\n LOG(ERROR) << \"shared data is too large to write.\" << std::endl;\n return;\n }\n (*(int*)addr) = (int)data_size;\n memcpy((char*)addr + sizeof(int), buf, data_size);\n region.flush(0, region.get_size());\n }\n catch(const std::exception& e)\n {\n LOG(ERROR) << \"write shared memory failed : \" << e.what() << std::endl;\n return;\n }\n}\n\nvoid checking_func()\n{\n while(!s_stop)\n {\n struct timespec req, rem;\n req.tv_sec = 20;\n req.tv_nsec = 0;\n\n while(0 != nanosleep(&req, &rem))\n {\n if (errno == EINTR)\n req = rem;\n else\n {\n perror(\"sleep error.\");\n break;\n }\n }\n LOG(INFO) << \"decreasing slow counter period.\" << std::endl;\n decreSlowCounterForAll();\n }\n}\n\nint\nmain(int argc, char *argv[])\n{\n init_sig_env();\n using namespace boost::interprocess;\n shared_memory_object::remove(SF1R_PROCESS_SHARED_MEM_NAME);\n named_upgradable_mutex::remove(SF1R_PROCESS_MUTEX_NAME);\n\n shared_memory_object shm_obj(create_only, SF1R_PROCESS_SHARED_MEM_NAME, read_write);\n shm_obj.truncate(MAX_SHARED_SIZE);\n \n {\n mapped_region region(shm_obj, read_write);\n LOG(INFO) << \"init shared memory size : \" << region.get_size();\n }\n named_upgradable_mutex mutex(create_only, SF1R_PROCESS_MUTEX_NAME);\n\n LOG(INFO) << \"shared memory master started. \";\n boost::thread checking_thread(boost::bind(&checking_func));\n checking_thread.join();\n LOG(INFO) << \"shared data master quiting.\" << std::endl;\n shared_memory_object::remove(SF1R_PROCESS_SHARED_MEM_NAME);\n named_upgradable_mutex::remove(SF1R_PROCESS_MUTEX_NAME);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of EasyRPG.\n\/\/\n\/\/ EasyRPG is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ EasyRPG is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with EasyRPG Player. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <algorithm>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"ldb_reader.h\"\n#include \"lmt_reader.h\"\n#include \"lmu_reader.h\"\n#include \"lsd_reader.h\"\n\nenum FileTypes\n{\n\tFileType_LCF_MapUnit,\n\tFileType_LCF_SaveData,\n\tFileType_LCF_Database,\n\tFileType_LCF_MapTree,\n\tFileType_XML_MapUnit,\n\tFileType_XML_SaveData,\n\tFileType_XML_Database,\n\tFileType_XML_MapTree,\n\tFileType_Invalid\n};\n\nstd::string GetFilename(const std::string& str);\nFileTypes GetFiletype(const std::string& in_file, std::string& out_extension);\nvoid PrintReaderError(const std::string data);\nint ReaderWriteToFile(const std::string& in, const std::string& out, FileTypes in_type);\n\nint main(int argc, char** argv)\n{\n\tif (argc <= 1)\n\t{\n\t\tstd::cerr << \"Lcf2Xml - Converts RPG Maker 2k\/2k3 Files to XML and vice versa\" << std::endl;\n\t\tstd::cerr << \"Usage: lcf2xml [FILE] [OUTFILE]\" << std::endl;\n\t\t\/\/std::cerr << \"If OUTFILE is missing the resulting file is named FILE with the extension replaced\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tstd::string infile;\n\tstd::string outfile;\n\n\tinfile = argv[1];\n\n\tFileTypes type;\n\tstd::string extension;\n\n\tif (argc >= 3)\n\t{\n\t\t\/\/ OUTFILE\n\t\toutfile = argv[2];\n\t\ttype = GetFiletype(infile, extension);\n\t}\n\telse\n\t{\n\t\t\/\/ No OUTFILE, add extension based on detected filetype\n\t\toutfile = GetFilename(infile);\n\t\ttype = GetFiletype(infile, extension);\n\t\toutfile += extension;\n\t}\n\n\treturn ReaderWriteToFile(infile, outfile, type);\n}\n\n\n\/\/\/ Returns the filename (without extension)\nstd::string GetFilename(const std::string& str)\n{\n\tstd::string s = str;\n#ifdef _WIN32\n\tstd::replace(s.begin(), s.end(), '\\\\', '\/');\n#endif\n\t\/\/ Extension\n\tsize_t found = s.find_last_of(\".\");\n\tif (found != std::string::npos)\n\t{\n\t\ts = s.substr(0, found);\n\t}\n\n\t\/\/ Filename\n\tfound = s.find_last_of(\"\/\");\n\tif (found == std::string::npos)\n\t{\n\t\treturn s;\n\t}\n\n\ts = s.substr(found + 1);\n\treturn s;\n}\n\n\/\/\/ Uses heuristics to detect the file type\nFileTypes GetFiletype(const std::string& in_file, std::string& out_extension)\n{\n\tstd::ifstream in(in_file);\n\n\tchar buf[128];\n\tmemset(buf, '\\0', 128);\n\n\tin.seekg(1, std::ios::beg);\n\tin.read(buf, 10);\n\tstd::string input(buf);\n\n\tout_extension = \".xml\";\n\tif (input == \"LcfDataBas\") {\n\t\treturn FileType_LCF_Database;\n\t} else if (input == \"LcfMapTree\") {\n\t\treturn FileType_LCF_MapTree;\n\t} else if (input == \"LcfSaveDat\") {\n\t\treturn FileType_LCF_SaveData;\n\t} else if (input == \"LcfMapUnit\") {\n\t\treturn FileType_LCF_MapUnit;\n\t} else if (input == \"?xml versi\") {\n\t\tin.read(buf, 128);\n\t\tstd::string in(buf);\n\n\t\tsize_t pos = in.find('<');\n\t\tif (pos != std::string::npos)\n\t\t{\n\t\t\tin = in.substr(pos + 1, 3);\n\t\t\tif (in == \"LDB\") {\n\t\t\t\tout_extension = \".ldb\";\n\t\t\t\treturn FileType_XML_Database;\n\t\t\t} else if (in == \"LMT\") {\n\t\t\t\tout_extension = \".lmt\";\n\t\t\t\treturn FileType_XML_MapTree;\n\t\t\t} else if (in == \"LSD\") {\n\t\t\t\tout_extension = \".lsd\";\n\t\t\t\treturn FileType_XML_SaveData;\n\t\t\t} else if (in == \"LMU\") {\n\t\t\t\tout_extension = \".lmu\";\n\t\t\t\treturn FileType_XML_MapUnit;\n\t\t\t}\n\t\t}\n\t}\n\n\tout_extension = \"\";\n\treturn FileType_Invalid;\n}\n\n\/\/\/ Utility func for errors\nvoid PrintReaderError(const std::string data)\n{\n\tstd::cerr << data << \" error: \" << LcfReader::GetError() << std::endl;\n}\n\n#define LCFXML_ERROR(cond, text) \\\n\tif (cond) {\\\n\t\tPrintReaderError(text);\\\n\t\treturn 2;\\\n\t}\n\n\/\/\/ Takes data from in and writes converted data into out using libreaders\nint ReaderWriteToFile(const std::string& in, const std::string& out, FileTypes in_type)\n{\n\tswitch (in_type)\n\t{\n\t\tcase FileType_LCF_MapUnit:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Map> file = LMU_Reader::Load(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LMU load\");\n\t\t\tLCFXML_ERROR(!LMU_Reader::SaveXml(out, *file), \"LMU XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_SaveData:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Save> file = LSD_Reader::Load(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LSD load\");\n\t\t\tLCFXML_ERROR(!LSD_Reader::SaveXml(out, *file), \"LSD XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_Database:\n\t\t{\n\t\t\tLCFXML_ERROR(!LDB_Reader::Load(in), \"LDB load\");\n\t\t\tLCFXML_ERROR(!LDB_Reader::SaveXml(out), \"LDB XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_MapTree:\n\t\t{\n\t\t\tLCFXML_ERROR(!LMT_Reader::Load(in), \"LMT load\");\n\t\t\tLCFXML_ERROR(!LMT_Reader::SaveXml(out), \"LMT XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_MapUnit:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Map> file = LMU_Reader::LoadXml(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LMU XML load\");\n\t\t\tLCFXML_ERROR(!LMU_Reader::Save(out, *file), \"LMU save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_SaveData:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Save> file = LSD_Reader::LoadXml(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LSD XML load\");\n\t\t\tLCFXML_ERROR(!LSD_Reader::Save(out, *file), \"LSD save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_Database:\n\t\t{\n\t\t\tLCFXML_ERROR(!LDB_Reader::LoadXml(in), \"LDB XML load\");\n\t\t\tLCFXML_ERROR(!LDB_Reader::Save(out), \"LDB save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_MapTree:\n\t\t{\n\t\t\tLCFXML_ERROR(!LMT_Reader::LoadXml(in), \"LMT XML load\");\n\t\t\tLCFXML_ERROR(!LMT_Reader::Save(out), \"LMT save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_Invalid:\n\t\t{\n\t\t\tstd::cerr << in << \" unsupported\" << std::endl;\n\t\t\treturn 2;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Fix compile error in mingw-w64-g++ 4.6<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ This file is part of EasyRPG.\n\/\/\n\/\/ EasyRPG is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ EasyRPG is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with EasyRPG Player. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <algorithm>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"ldb_reader.h\"\n#include \"lmt_reader.h\"\n#include \"lmu_reader.h\"\n#include \"lsd_reader.h\"\n\nenum FileTypes\n{\n\tFileType_LCF_MapUnit,\n\tFileType_LCF_SaveData,\n\tFileType_LCF_Database,\n\tFileType_LCF_MapTree,\n\tFileType_XML_MapUnit,\n\tFileType_XML_SaveData,\n\tFileType_XML_Database,\n\tFileType_XML_MapTree,\n\tFileType_Invalid\n};\n\nstd::string GetFilename(const std::string& str);\nFileTypes GetFiletype(const std::string& in_file, std::string& out_extension);\nvoid PrintReaderError(const std::string data);\nint ReaderWriteToFile(const std::string& in, const std::string& out, FileTypes in_type);\n\nint main(int argc, char** argv)\n{\n\tif (argc <= 1)\n\t{\n\t\tstd::cerr << \"Lcf2Xml - Converts RPG Maker 2k\/2k3 Files to XML and vice versa\" << std::endl;\n\t\tstd::cerr << \"Usage: lcf2xml [FILE] [OUTFILE]\" << std::endl;\n\t\t\/\/std::cerr << \"If OUTFILE is missing the resulting file is named FILE with the extension replaced\" << std::endl;\n\t\treturn 1;\n\t}\n\n\tstd::string infile;\n\tstd::string outfile;\n\n\tinfile = argv[1];\n\n\tFileTypes type;\n\tstd::string extension;\n\n\tif (argc >= 3)\n\t{\n\t\t\/\/ OUTFILE\n\t\toutfile = argv[2];\n\t\ttype = GetFiletype(infile, extension);\n\t}\n\telse\n\t{\n\t\t\/\/ No OUTFILE, add extension based on detected filetype\n\t\toutfile = GetFilename(infile);\n\t\ttype = GetFiletype(infile, extension);\n\t\toutfile += extension;\n\t}\n\n\treturn ReaderWriteToFile(infile, outfile, type);\n}\n\n\n\/\/\/ Returns the filename (without extension)\nstd::string GetFilename(const std::string& str)\n{\n\tstd::string s = str;\n#ifdef _WIN32\n\tstd::replace(s.begin(), s.end(), '\\\\', '\/');\n#endif\n\t\/\/ Extension\n\tsize_t found = s.find_last_of(\".\");\n\tif (found != std::string::npos)\n\t{\n\t\ts = s.substr(0, found);\n\t}\n\n\t\/\/ Filename\n\tfound = s.find_last_of(\"\/\");\n\tif (found == std::string::npos)\n\t{\n\t\treturn s;\n\t}\n\n\ts = s.substr(found + 1);\n\treturn s;\n}\n\n\/\/\/ Uses heuristics to detect the file type\nFileTypes GetFiletype(const std::string& in_file, std::string& out_extension)\n{\n\tstd::ifstream in(in_file.c_str());\n\n\tchar buf[128];\n\tmemset(buf, '\\0', 128);\n\n\tin.seekg(1, std::ios::beg);\n\tin.read(buf, 10);\n\tstd::string input(buf);\n\n\tout_extension = \".xml\";\n\tif (input == \"LcfDataBas\") {\n\t\treturn FileType_LCF_Database;\n\t} else if (input == \"LcfMapTree\") {\n\t\treturn FileType_LCF_MapTree;\n\t} else if (input == \"LcfSaveDat\") {\n\t\treturn FileType_LCF_SaveData;\n\t} else if (input == \"LcfMapUnit\") {\n\t\treturn FileType_LCF_MapUnit;\n\t} else if (input == \"?xml versi\") {\n\t\tin.read(buf, 128);\n\t\tstd::string in(buf);\n\n\t\tsize_t pos = in.find('<');\n\t\tif (pos != std::string::npos)\n\t\t{\n\t\t\tin = in.substr(pos + 1, 3);\n\t\t\tif (in == \"LDB\") {\n\t\t\t\tout_extension = \".ldb\";\n\t\t\t\treturn FileType_XML_Database;\n\t\t\t} else if (in == \"LMT\") {\n\t\t\t\tout_extension = \".lmt\";\n\t\t\t\treturn FileType_XML_MapTree;\n\t\t\t} else if (in == \"LSD\") {\n\t\t\t\tout_extension = \".lsd\";\n\t\t\t\treturn FileType_XML_SaveData;\n\t\t\t} else if (in == \"LMU\") {\n\t\t\t\tout_extension = \".lmu\";\n\t\t\t\treturn FileType_XML_MapUnit;\n\t\t\t}\n\t\t}\n\t}\n\n\tout_extension = \"\";\n\treturn FileType_Invalid;\n}\n\n\/\/\/ Utility func for errors\nvoid PrintReaderError(const std::string data)\n{\n\tstd::cerr << data << \" error: \" << LcfReader::GetError() << std::endl;\n}\n\n#define LCFXML_ERROR(cond, text) \\\n\tif (cond) {\\\n\t\tPrintReaderError(text);\\\n\t\treturn 2;\\\n\t}\n\n\/\/\/ Takes data from in and writes converted data into out using libreaders\nint ReaderWriteToFile(const std::string& in, const std::string& out, FileTypes in_type)\n{\n\tswitch (in_type)\n\t{\n\t\tcase FileType_LCF_MapUnit:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Map> file = LMU_Reader::Load(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LMU load\");\n\t\t\tLCFXML_ERROR(!LMU_Reader::SaveXml(out, *file), \"LMU XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_SaveData:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Save> file = LSD_Reader::Load(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LSD load\");\n\t\t\tLCFXML_ERROR(!LSD_Reader::SaveXml(out, *file), \"LSD XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_Database:\n\t\t{\n\t\t\tLCFXML_ERROR(!LDB_Reader::Load(in), \"LDB load\");\n\t\t\tLCFXML_ERROR(!LDB_Reader::SaveXml(out), \"LDB XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_LCF_MapTree:\n\t\t{\n\t\t\tLCFXML_ERROR(!LMT_Reader::Load(in), \"LMT load\");\n\t\t\tLCFXML_ERROR(!LMT_Reader::SaveXml(out), \"LMT XML save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_MapUnit:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Map> file = LMU_Reader::LoadXml(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LMU XML load\");\n\t\t\tLCFXML_ERROR(!LMU_Reader::Save(out, *file), \"LMU save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_SaveData:\n\t\t{\n\t\t\tstd::auto_ptr<RPG::Save> file = LSD_Reader::LoadXml(in);\n\t\t\tLCFXML_ERROR(file.get() == NULL, \"LSD XML load\");\n\t\t\tLCFXML_ERROR(!LSD_Reader::Save(out, *file), \"LSD save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_Database:\n\t\t{\n\t\t\tLCFXML_ERROR(!LDB_Reader::LoadXml(in), \"LDB XML load\");\n\t\t\tLCFXML_ERROR(!LDB_Reader::Save(out), \"LDB save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_XML_MapTree:\n\t\t{\n\t\t\tLCFXML_ERROR(!LMT_Reader::LoadXml(in), \"LMT XML load\");\n\t\t\tLCFXML_ERROR(!LMT_Reader::Save(out), \"LMT save\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FileType_Invalid:\n\t\t{\n\t\t\tstd::cerr << in << \" unsupported\" << std::endl;\n\t\t\treturn 2;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <unistd.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/wait.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <stdlib.h>\n\nusing namespace std;\n\n\/\/adds space before and after all instances of op in text to text\nvoid addSpaces(string &text, const string &op) {\n\tsize_t length = op.length();\n\tsize_t pos;\n\tpos = text.find(op, 0);\t\/\/some inspiration from stackoverflow.com\/questions\/4034750\n\n\n\twhile(pos != string::npos) {\n\t\t\/\/pos+1 to go to thing pos was pointing at, but want to move AFTER that\n\t\ttext.insert(pos, \" \");\t\/\/one space before\n\t\ttext.insert(pos+1+length, \" \"); \/\/and one space after\n\t\tpos = text.find(op, pos+1+length);\n\t}\n}\n\n\n\/\/adds space before and after all instances of op in text to text\nvoid addNumbers(string &text, const string &op) {\n\tsize_t length = op.length();\n\tsize_t pos;\n\tpos = text.find(op, 0);\t\/\/some inspiration from stackoverflow.com\/questions\/4034750\n\n\n\twhile(pos != string::npos) {\n\t\t\/\/pos+1 to go to thing pos was pointing at, but want to move AFTER that\n\t\ttext.insert(pos, \" \");\t\/\/one space before\n\t\ttext.insert(pos+1+length, \" \"); \/\/and one space after\n\t\tpos = text.find(op, pos+1+length);\n\t}\n}\n\n\n\/*\n\/\/takes in string and deliminator and tokenizes that string into vector<char*>\nvector<char*> parser(string text, const char *delim) {\n\tchar *line = new char[text.length()+1];\t\/\/strtok requires char*\n\t\t\t\t\t\t\/\/got this from cplusplus.com\/reference\/string\/string\/c_str\n\tstrcpy(line, text.c_str());\n\n\n\tchar *token = strtok(line, delim);\t\/\/can be any character\n\tvector<char*> words;\n\n\n\twhile(token != NULL) {\t\n\t\twords.push_back(token);\n\t\ttoken = strtok(NULL, delim);\n\t}\n\t\n\tdelete[] token;\n\t\n\treturn words;\n}\n*\/\n\nbool redirectionstuff(vector<char*> &onecommand) {\n\tfor(unsigned int i = 0; i < onecommand.size(); i++) {\n\t\tif(strcmp\n\t\t\/\/let's do input < first\n\t\tint save = dup(0);\n\t\tif(-1 == close(0)) {\n\t\t\tperror(\"close\");\n\t\t}\n\t\tint fd = open(blah, O_RDONLY);\n\t\tif(-1 == fd) {\n\t\t\tperror(\"error with open\");\n\t\t\texit(1);\n\t\t}\n\t\t\/\/run some execvp shti\n\t\t\n\t\t\n\t\tclose(0);\t\t\/\/closing what i oepened\n\t\tdup2(0, save);\t\t\/\/have to restore stdin to 0\n\t\tclose(save);\t\t\/\/gotta close the backup\n\t\t\t\n\nbool execvpstuff(vector<char*> &onecommand) {\n\tbool returnval = true;\n\tint pipearr[2];\n\tchar **command = &onecommand[0]; \/\/stackoverflow.com\/questions\/5846934\/\n\t\t\/\/EXECVP STUFF HERE\n\t\/\/http:\/\/github.com\/mikeizbicki\/ucr-cs100\/blob\/2015spring\/textbook\/assignment-help\/syscalls\/exec.md\n\tif(onecommand.size() < 2) {\n\t\treturnval = true;\n\t} else {\n\t\t\n\t\tif(strcmp(command[0], \"exit\") == 0) {\n\t\t\tonecommand.clear();\n\t\t\texit(0);\n\t\t} else {\n\t\t\tpipe(pipearr);\t\t\/\/some pipe bs.\n\t\t\tint pid = fork();\n\t\t\tif(pid == -1) {\n\t\t\t\tperror(\"Error with fork\");\n\t\t\t\texit(1);\n\t\t\t} else if(pid == 0) {\t\/\/child process\n\t\t\t\tclose(pipearr[0]);\n\t\t\t\tif(-1 == execvp(command[0], command)) {\n\t\t\t\t\treturnval = false;\n\t\t\t\t\twrite(pipearr[1], &returnval, sizeof(returnval));\n\t\t\t\t\tclose(pipearr[1]);\n\t\t\t\t\tperror(\"Error wit execvp\");\n\t\t\t\t}\n\t\t\t\tonecommand.clear();\t\t\/\/clear vector so it can hold next command.\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tif(-1 == wait(0)) {\n\t\t\t\tperror(\"error with wait\");\n\t\t\t}\n\t\t\tclose(pipearr[1]);\n\t\t\tread(pipearr[0], &returnval, sizeof(returnval));\n\t\t\tclose(pipearr[0]);\t\n\t\t\t\/\/parent here\n\t\t\tonecommand.clear();\n\t\t\treturn returnval;\n\t\t}\n\t}\n\treturn returnval;\n}\n\n\nvoid terminal() {\n\t\/\/~~~~~~~~~~~~print username, hostnam, and prompte~~~~~~~~\n\tchar host[32];\/\/add to readme: 32 cuz max is 64 and i dont want long printing\n\tint pid;\n\t\n\tstring input;\n\t\n\tpid = gethostname(host, 32);\n\tif(pid == -1) {\t\t\t\t\/\/error\n\t\tperror(\"gethostname\");\n\t} else {\n\t\t cout << getlogin() << \"§\" << host << ':' << ' ';\n\t}\n\t\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\t\n\t\/\/shit starts here\n\t\/\/we will begin tonight's program by taking in \n\tgetline(cin, input);\n\t\n\t\/\/add spaces before and after all operators in input\n\taddSpaces(input, \";\");\n\taddSpaces(input, \"&&\");\n\taddSpaces(input, \"||\");\n\taddSpaces(input, \"#\");\n\n\t\n\t\/\/vector<char*> words;\n\t\/\/words = parser(arg, \" \"); \/\/take out all spaces from arg\n\n\n\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~PARSER~~~~~~~~~~~~~~~~~~~~~~~~~~\n\tchar *line = new char[input.length()+1];\t\/\/strtok requires char*\n\t\t\t\t\t\t\/\/got this from cplusplus.com\/reference\/string\/string\/c_str\n\tstrcpy(line, input.c_str());\n\n\n\tchar *token = strtok(line, \" \\t\\n\");\t\/\/can be any character\n\tvector<char*> words;\n\n\n\twhile(token != NULL) {\t\n\t\twords.push_back(token);\n\t\ttoken = strtok(NULL, \" \\t\\n\");\n\t}\n\n\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~`\n\n\tchar cmenot[] = \";\";\n\twords.push_back(cmenot);\n\n\n\tvector<char*> onecommand;\n\tonecommand.clear();\n\n\tbool success = true;\t\/\/status of previous command. used for operators\t\n\t\n\tbool issemi;\n\tbool isand;\n\tbool isor;\n\tbool ispound;\n\tbool isoperator;\n\n\t\n\tsize_t i = 0;\n\t\n\twhile(i < words.size()) {\n\t\tissemi = strcmp(words.at(i), \";\") == 0;\n\t\tisand = strcmp(words.at(i), \"&&\") == 0;\n\t\tisor = strcmp(words.at(i), \"||\") == 0;\n\t\tispound = strcmp(words.at(i), \"#\") == 0;\n\t\tisoperator = issemi || isand || isor || ispound;\n\t\t\n\t\tif(!isoperator) {\n\t\t\tonecommand.push_back(words.at(i));\n\t\t\/\/\tfor(int j = 0; j < onecommand.size(); j++) cout << \"oc \" << j << onecommand.at(j) << endl;\n\t\t} else {\n\t\t\tonecommand.push_back(NULL);\t\/\/needs to end in null for exec\n\t\t\tsuccess = execvpstuff(onecommand);\n\t\t\tif(issemi) {\n\t\t\t\tonecommand.clear();\n\t\t\t\t\/\/moveon\n\t\t\t} else if(isand && success) {\n\t\t\t\t\/\/moveon\n\t\t\t\tonecommand.clear();\n\t\t\t} else if(isor && !success) {\n\t\t\t\tonecommand.clear();\n\t\t\t\t\/\/moveon\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\t\t\n\n\n\n\tdelete[] line;\n\t\n\t\n\t\/\/TESTING DELETE THIS LATER\n\/\/\tfor(int i = 0; i < words.size(); i++) cout << \"words\" << i << words.at(i) << endl;\n\n}\n\nint main(int argc, char* argv[]) {\n\n\tcout << \"¤¤¡¡¡¡¡Bienvenidos a la terminál rshell de Chirag!!!!!¤¤\" << endl;\n\t\n\twhile(1)\n\tterminal();\n\n\treturn 0;\n}\n<commit_msg>input< seems to work<commit_after>#include <unistd.h>\n#include <stdio.h>\n#include <errno.h>\n#include <sys\/wait.h>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <cstring>\n#include <stdlib.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n\nusing namespace std;\n\n\/\/adds space before and after all instances of op in text to text\nvoid addSpaces(string &text, const string &op) {\n\tsize_t length = op.length();\n\tsize_t pos;\n\tpos = text.find(op, 0);\t\/\/some inspiration from stackoverflow.com\/questions\/4034750\n\n\n\twhile(pos != string::npos) {\n\t\t\/\/pos+1 to go to thing pos was pointing at, but want to move AFTER that\n\t\ttext.insert(pos, \" \");\t\/\/one space before\n\t\ttext.insert(pos+1+length, \" \"); \/\/and one space after\n\t\tpos = text.find(op, pos+1+length);\n\t}\n}\n\n\n\/\/adds space before and after all instances of op in text to text\nvoid addNumbers(string &text, const string &op) {\n\tsize_t length = op.length();\n\tsize_t pos;\n\tpos = text.find(op, 0);\t\/\/some inspiration from stackoverflow.com\/questions\/4034750\n\n\n\twhile(pos != string::npos) {\n\t\t\/\/pos+1 to go to thing pos was pointing at, but want to move AFTER that\n\t\ttext.insert(pos, \" \");\t\/\/one space before\n\t\ttext.insert(pos+1+length, \" \"); \/\/and one space after\n\t\tpos = text.find(op, pos+1+length);\n\t}\n}\n\n\n\/*\n\/\/takes in string and deliminator and tokenizes that string into vector<char*>\nvector<char*> parser(string text, const char *delim) {\n\tchar *line = new char[text.length()+1];\t\/\/strtok requires char*\n\t\t\t\t\t\t\/\/got this from cplusplus.com\/reference\/string\/string\/c_str\n\tstrcpy(line, text.c_str());\n\n\n\tchar *token = strtok(line, delim);\t\/\/can be any character\n\tvector<char*> words;\n\n\n\twhile(token != NULL) {\t\n\t\twords.push_back(token);\n\t\ttoken = strtok(NULL, delim);\n\t}\n\t\n\tdelete[] token;\n\t\n\treturn words;\n}\n*\/\n\nbool redirectors(vector<char*> &onecommand) {\n\tsize_t i = 0;\n\t\/\/find the first redirector\n\t\/\/putting everything before it into char* vector along the way\n\tint redirector = -1;\n\tvector<char*> newcommand;\n\tfor(i = 0; (i < onecommand.size() - 1) && (redirector < 0); i++) {\n\t\tif(strcmp(onecommand.at(i), \"<\") == 0) {\n\t\t\tredirector = 0;\t\t\/\/input\n\t\t} else if(strcmp(onecommand.at(i), \">\") == 0) {\n\t\t\tredirector = 1;\t\t\/\/single output\n\t\t} else if(strcmp(onecommand.at(i), \">>\") == 0) {\n\t\t\tredirector = 2;\t\t\/\/double output\n\t\t} else if(strcmp(onecommand.at(i), \"|\") == 0) {\n\t\t\tredirector = 3;\t\t\/\/pipe\n\t\t} else {\n\t\t\tnewcommand.push_back(onecommand.at(i));\n\t\t\tcout << \"theo\" << onecommand.at(i) << endl;\n\t\t}\n\t}\n\tnewcommand.push_back(NULL);\n\n\t\/\/it's an input\n\tif(redirector == 0) {\t\t\n\t\tif(i < onecommand.size()) {\t\t\/\/check if file is in the vector\n\t\t\t\/\/close stdin\n\t\t\tint backup = dup(0);\n\t\t\tif(-1 == backup) {\n\t\t\t\tperror(\"error with dup\");\n\t\t\t}\n\t\t\tif(-1 == close(0)) {\n\t\t\t\tperror(\"error with close\");\n\t\t\t}\n\n\t\t\tint fd = open(onecommand.at(i), O_RDONLY);\t\/\/open to lowest file desc\n\t\t\tif(-1 == fd) {\n\t\t\t\tperror(\"error with open\");\n\t\t\t\texit(1);\n\t\t\t}\n\n\t\t\tint forkid = fork();\n\t\t\tif(-1 == forkid) {\n\t\t\t\tperror(\"error with fork\");\n\t\t\t\texit(1);\n\t\t\t} else if(0 == forkid) {\n\t\t\t\t\/\/the child\n\t\t\t\tif(-1 == execvp(newcommand.at(0), &newcommand[0])) {\n\t\t\t\t\tperror(\"erro with execvp\");\n\t\t\t\t}\n\t\t\t\tcout << \"before exit execvp\" << endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tcout << \"in parent\" << endl;\n\t\t\tif(-1 == wait(0)) {\n\t\t\t\tperror(\"error with wait\");\n\t\t\t}\n\t\t\t\/\/parent here i guess\n\t\t\tif(-1 == dup2(backup, 0)) {\n\t\t\t\tperror(\"error with dup2\");\n\t\t\t}\n\t\t\tif(-1 == close(backup)) {\n\t\t\t\tperror(\"error with close backup\");\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn true;\n}\n\n\/*\nvector<char*> redirectionstuff(vector<char*> &onecommand) {\n\tvector<char*> newcommand;\n\tfor(unsigned int i = 0; i < onecommand.size(); i++) {\n\t\tif(strcmp(onecommand.at(i), \"<\") == 0) {\n\t\t\tif(i > 0 && i+1 > onecommand.size()) {\n\t\t\t\t\/\/let's do input < first\n\t\t\t\tif(-1 == close(0)) {\n\t\t\t\t\tperror(\"close\");\n\t\t\t\t}\n\t\t\t\tint fd = open(blah, O_RDONLY);\t\/\/opened to 0 since we closed 0\n\t\t\t\tif(-1 == fd) {\n\t\t\t\t\tperror(\"error with open\");\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\t\/\/run some execvp shti\n\t\t\t\tnewcommand.push_back(onecommand.at(i-1));\n\t\t\t\twhile(i < )\n\t\t\n\t\t\t\t\/\/close(0);\t\t\/\/closing what i oepened\n\t\t\t} else {\n\t\t\t\tcout << \"Invalid use of redirection\" << endl;\n\t\t\t\texit(1);\n\t\t\t}\n\t\t}\n\t}\n\treturn newcommand;\n}\n*\/\t\t\t\n\nbool execvpstuff(vector<char*> &onecommand) {\n\tbool returnval = true;\n\tint pipearr[2];\n\n\tchar** command = &onecommand[0]; \/\/stackoverflow.com\/questions\/5846934\/\n\n\t\t\/\/EXECVP STUFF HERE\n\t\/\/http:\/\/github.com\/mikeizbicki\/ucr-cs100\/blob\/2015spring\/textbook\/assignment-help\/syscalls\/exec.md\n\tif(onecommand.size() < 2) {\n\t\treturnval = true;\n\t} else {\n\t\t\n\t\tif(strcmp(command[0], \"exit\") == 0) {\n\t\t\tonecommand.clear();\n\t\t\texit(0);\n\t\t} else {\n\t\t\tpipe(pipearr);\t\t\/\/some pipe bs.\n\t\t\tint pid = fork();\n\t\t\tif(pid == -1) {\n\t\t\t\tperror(\"Error with fork\");\n\t\t\t\texit(1);\n\t\t\t} else if(pid == 0) {\t\/\/child process\n\t\t\t\tclose(pipearr[0]);\n\t\t\t\tif(-1 == execvp(command[0], command)) {\n\t\t\t\t\treturnval = false;\n\t\t\t\t\twrite(pipearr[1], &returnval, sizeof(returnval));\n\t\t\t\t\tclose(pipearr[1]);\n\t\t\t\t\tperror(\"Error wit execvp\");\n\t\t\t\t}\n\t\t\t\tonecommand.clear();\t\t\/\/clear vector so it can hold next command.\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tif(-1 == wait(0)) {\n\t\t\t\tperror(\"error with wait\");\n\t\t\t}\n\t\t\tclose(pipearr[1]);\n\t\t\tread(pipearr[0], &returnval, sizeof(returnval));\n\t\t\tclose(pipearr[0]);\t\n\t\t\t\/\/parent here\n\t\t\tonecommand.clear();\n\t\t\treturn returnval;\n\t\t}\n\t}\n\treturn returnval;\n}\n\n\nvoid terminal() {\n\t\/\/~~~~~~~~~~~~print username, hostnam, and prompte~~~~~~~~\n\tchar host[32];\/\/add to readme: 32 cuz max is 64 and i dont want long printing\n\tint pid;\n\t\n\tstring input;\n\t\n\tpid = gethostname(host, 32);\n\tif(pid == -1) {\t\t\t\t\/\/error\n\t\tperror(\"gethostname\");\n\t} else {\n\t\t cout << getlogin() << \"§\" << host << ':' << ' ';\n\t}\n\t\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\n\t\n\t\/\/shit starts here\n\t\/\/we will begin tonight's program by taking in \n\tgetline(cin, input);\n\t\n\t\/\/add spaces before and after all operators in input\n\taddSpaces(input, \";\");\n\taddSpaces(input, \"&&\");\n\taddSpaces(input, \"||\");\n\taddSpaces(input, \"#\");\n\n\t\n\t\/\/vector<char*> words;\n\t\/\/words = parser(arg, \" \"); \/\/take out all spaces from arg\n\n\n\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~PARSER~~~~~~~~~~~~~~~~~~~~~~~~~~\n\tchar *line = new char[input.length()+1];\t\/\/strtok requires char*\n\t\t\t\t\t\t\/\/got this from cplusplus.com\/reference\/string\/string\/c_str\n\tstrcpy(line, input.c_str());\n\n\n\tchar *token = strtok(line, \" \\t\\n\");\t\/\/can be any character\n\tvector<char*> words;\n\n\n\twhile(token != NULL) {\t\n\t\twords.push_back(token);\n\t\ttoken = strtok(NULL, \" \\t\\n\");\n\t}\n\n\/\/~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~`\n\n\tchar cmenot[] = \";\";\n\twords.push_back(cmenot);\n\n\n\tvector<char*> onecommand;\n\tonecommand.clear();\n\n\tbool success = true;\t\/\/status of previous command. used for operators\t\n\t\n\tbool issemi;\n\tbool isand;\n\tbool isor;\n\tbool ispound;\n\tbool isoperator;\n\n\t\n\tsize_t i = 0;\n\t\n\twhile(i < words.size()) {\n\t\tissemi = strcmp(words.at(i), \";\") == 0;\n\t\tisand = strcmp(words.at(i), \"&&\") == 0;\n\t\tisor = strcmp(words.at(i), \"||\") == 0;\n\t\tispound = strcmp(words.at(i), \"#\") == 0;\n\t\tisoperator = issemi || isand || isor || ispound;\n\t\t\n\t\tif(!isoperator) {\n\t\t\tonecommand.push_back(words.at(i));\n\t\t\/\/\tfor(int j = 0; j < onecommand.size(); j++) cout << \"oc \" << j << onecommand.at(j) << endl;\n\t\t} else {\n\t\t\tonecommand.push_back(NULL);\t\/\/needs to end in null for exec\n\t\t\tsuccess = redirectors(onecommand);\n\t\t\tcout << success << endl;\n\t\/\/\t\tsuccess = execvpstuff(onecommand);\n\t\t\tif(issemi) {\n\t\t\t\tonecommand.clear();\n\t\t\t\t\/\/moveon\n\t\t\t} else if(isand && success) {\n\t\t\t\t\/\/moveon\n\t\t\t\tonecommand.clear();\n\t\t\t} else if(isor && !success) {\n\t\t\t\tonecommand.clear();\n\t\t\t\t\/\/moveon\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\ti++;\n\t}\n\t\t\n\n\n\n\tdelete[] line;\n\t\n\t\n\t\/\/TESTING DELETE THIS LATER\n\/\/\tfor(int i = 0; i < words.size(); i++) cout << \"words\" << i << words.at(i) << endl;\n\n}\n\nint main(int argc, char* argv[]) {\n\n\tcout << \"¤¤¡¡¡¡¡Bienvenidos a la terminál rshell de Chirag!!!!!¤¤\" << endl;\n\t\n\twhile(1)\n\tterminal();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Lesson 13.cpp : Defines the entry point for the console application.\n\n#include <render_framework\\render_framework.h>\n#include <chrono>\n#pragma comment (lib , \"Render Framework\" )\n\nusing namespace std;\nusing namespace glm;\nusing namespace render_framework;\nusing namespace chrono;\n\n#define OBJECTS 1\n\n\/\/ Global scope box\nshared_ptr<mesh> object[1];\nshared_ptr<chase_camera> cam;\nshared_ptr<mesh> plane;\n\n\n\/*\n * userTranslation\n *\n * Moves the object around inside the window using the keyboard arrow keys.\n *\/\nvoid userTranslation(float deltaTime)\n{\n\t\/\/ Move the quad when arrow keys are pressed\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_RIGHT)) {\n\t\tobject[0]->trans.translate(vec3(10.0, 0.0, 0.0) * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_LEFT)) {\n\t\tobject[0]->trans.translate(vec3(-10.0, 0.0, 0.0) * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_UP)) {\n\t\tobject[0]->trans.translate(vec3(0.0, 0.0, -10.0) * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_DOWN)) {\n\t\tobject[0]->trans.translate(vec3(0.0, 0.0, 10.0) * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), 'W')) {\n\t\tobject[0]->trans.translate(vec3(0.0, 10.0, 0.0) * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), 'S')) {\n\t\tobject[0]->trans.translate(vec3(0.0, -10.0, 0.0) * deltaTime);\n\t}\n\n} \/\/ userTranslation()\n\n\n\/*\n * Update routine\n *\n * Updates the application state\n *\/\nvoid update(float deltaTime) {\n\n\tuserTranslation(deltaTime);\n\n\tcam->move(object[0]->trans.position, eulerAngles(object[0]->trans.orientation));\n\n\tcam->rotate(vec3(0.0, half_pi<float>() * deltaTime, 0.0));\n\n\tcam->update(deltaTime);\n\n} \/\/ update()\n\n\nbool load_content() {\n\n\tint i = 0;\n\tfor (i=0;i<OBJECTS;i++) {\n\t\t\/\/ Create box\n\t\tobject[i] = make_shared<mesh>();\n\t\tobject[i]->geom = geometry_builder::create_box();\n\n\n\t\t\/\/ Load in effect. Start with shaders\n\t\tauto eff = make_shared<effect>();\n\t\teff->add_shader(\"shader.vert\", GL_VERTEX_SHADER);\n\t\teff->add_shader(\"shader.frag\", GL_FRAGMENT_SHADER);\n\t\tif (!effect_loader::build_effect(eff)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Create material for box\n\t\tobject[i]->mat = make_shared<material>();\n\t\tobject[i]->mat->effect = eff;\n\n\t\t\/\/ Set texture for shader\n\t\tobject[i]->mat->set_texture(\"tex\", texture_loader::load(\"Checkered.png\"));\n\n\t\t\/\/ Create plane\n\t\tplane = make_shared<mesh>();\n\t\tplane->geom = geometry_builder::create_plane();\n\t\tplane->trans.translate(vec3(0.0, -0.5, 0.0));\n\n\t\t\/\/ Reuse the material from the box\n\t\tplane->mat = object[i]->mat;\n\t}\n\n\treturn true;\n\n} \/\/ load_content()\n\nbool load_camera() {\n\t\/\/ Initialize the camera\n\tcam = make_shared<chase_camera>();\n\n\t\/* Set the projection matrix *\/\n\t\/\/ First get the aspect ratio (width\/height)\n\tfloat aspect = (float)renderer::get_instance().get_screen_width() \/\n\t\t\t\t\t(float)renderer::get_instance().get_screen_width();\n\t\/\/ Use this to set the camera projection matrix\n\tcam->set_projection(\n\t\t\t\t\t\tquarter_pi<float>(),\t\t\t\/\/ FOV\n\t\t\t\t\t\taspect,\t\t\t\t\t\t\t\/\/ Aspect ratio\n\t\t\t\t\t\t2.414f,\t\t\t\t\t\t\t\/\/ Near plane\n\t\t\t\t\t\t10000.0f);\t\t\t\t\t\t\/\/ Far plane\n\t\/\/ Set the camera properties\n\tcam->set_position(vec3(0.0, 0.0, 20.0));\n\tcam->set_springiness(0.001);\n\tcam->set_position_offset(vec3(0.0, 5.0, 10.0));\n\n\t\/\/ Attach camera to renderer\n\trenderer::get_instance().set_camera(cam);\n\n\t\/\/ Set the view matrix\n\tauto view = lookAt(\n\t\t\t\t\tvec3(20.0f, 20.0f, 20.0f),\t\/\/ Camera position\n\t\t\t\t\tvec3(0.0f, 0.0f, 0.0f),\t\t\/\/ Target\n\t\t\t\t\tvec3(0.0f, 1.0f, 0.0f));\t\/\/ Up vector\n\trenderer::get_instance().set_view(view);\n\n\treturn true;\n} \/\/ load_camera\n\nint main()\n{\n\t\/\/ Initialize the renderer\n\tif (!renderer::get_instance().initialise()) return -1;\n\n\t\/\/ Set the clear colour to cyan\n\tglClearColor(0.0f, 1.0f, 1.0f, 1.0f);\n\n\tif (!load_content()) {\n\t\treturn -1;\n\t}\n\n\tif (!load_camera()) {\n\t\treturn -1;\n\t}\n\n\t\/\/ Monitor the elapsed time per frame\n\tauto currentTimeStamp = system_clock::now();\n\tauto prevTimeStamp = system_clock::now();\n\n\n\t\/\/ Main render loop\n\twhile (renderer::get_instance().is_running())\n\t{\n\t\t\/\/ Get current time\n\t\tcurrentTimeStamp = system_clock::now();\n\t\t\/\/ Calculate elapsed time\n\t\tauto elapsed = duration_cast<milliseconds>(currentTimeStamp - prevTimeStamp);\n\t\t\/\/ Convert to fractions of a second\n\t\tauto seconds = float(elapsed.count()) \/ 1000.0;\n\n\t\t\/\/ Update Scene\n\t\tupdate(seconds);\n\n\t\t\/\/ Check if running\n\t\tif (renderer::get_instance().begin_render())\n\t\t{\n\t\t\t\/\/ Render Cube\n\t\t\tint i = 0;\n\t\t\tfor (i = 0; i <OBJECTS; i++) {\n\t\t\t\trenderer::get_instance().render(object[i]);\n\t\t\t}\n\n\t\t\t\/\/ Render plane\n\t\t\trenderer::get_instance().render(plane);\n\n\t\t\t\/\/ End the render\n\t\t\trenderer::get_instance().end_render();\n\t\t}\n\n\t\tprevTimeStamp = currentTimeStamp;\n\n\t} \/\/ Main render loop\n}\n<commit_msg>Changed camera to arc ball<commit_after>\/\/ Lesson 13.cpp : Defines the entry point for the console application.\n\n#include <render_framework\\render_framework.h>\n#include <chrono>\n#pragma comment (lib , \"Render Framework\" )\n\nusing namespace std;\nusing namespace glm;\nusing namespace render_framework;\nusing namespace chrono;\n\n#define OBJECTS 1\n\n\/\/ Global scope box\nshared_ptr<mesh> object[1];\nshared_ptr<arc_ball_camera> cam;\nshared_ptr<mesh> plane;\n\n\n\/*\n * userTranslation\n *\n * Moves the object around inside the window using the keyboard arrow keys.\n *\/\nvoid userTranslation(float deltaTime)\n{\n\t\/\/ Move the quad when arrow keys are pressed\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_RIGHT)) {\n\t\tcam->rotate(0.0, half_pi<float>() * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_LEFT)) {\n\t\tcam->rotate(0.0, -half_pi<float>() * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_UP)) {\n\t\tcam->move(-5.0f * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), GLFW_KEY_DOWN)) {\n\t\tcam->move(5.0f * deltaTime);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), 'W')) {\n\t\tcam->rotate(half_pi<float>() * deltaTime, 0.0);\n\t}\n\tif (glfwGetKey(renderer::get_instance().get_window(), 'S')) {\n\t\tcam->rotate(-half_pi<float>() * deltaTime, 0.0);\n\t}\n\n} \/\/ userTranslation()\n\n\n\/*\n * Update routine\n *\n * Updates the application state\n *\/\nvoid update(float deltaTime) {\n\n\tuserTranslation(deltaTime);\n\n\tcam->update(deltaTime);\n\n} \/\/ update()\n\n\nbool load_content() {\n\n\tint i = 0;\n\tfor (i=0;i<OBJECTS;i++) {\n\t\t\/\/ Create box\n\t\tobject[i] = make_shared<mesh>();\n\t\tobject[i]->geom = geometry_builder::create_box();\n\n\n\t\t\/\/ Load in effect. Start with shaders\n\t\tauto eff = make_shared<effect>();\n\t\teff->add_shader(\"shader.vert\", GL_VERTEX_SHADER);\n\t\teff->add_shader(\"shader.frag\", GL_FRAGMENT_SHADER);\n\t\tif (!effect_loader::build_effect(eff)) {\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Create material for box\n\t\tobject[i]->mat = make_shared<material>();\n\t\tobject[i]->mat->effect = eff;\n\n\t\t\/\/ Set texture for shader\n\t\tobject[i]->mat->set_texture(\"tex\", texture_loader::load(\"Checkered.png\"));\n\n\t\t\/\/ Create plane\n\t\tplane = make_shared<mesh>();\n\t\tplane->geom = geometry_builder::create_plane();\n\t\tplane->trans.translate(vec3(0.0, -0.5, 0.0));\n\n\t\t\/\/ Reuse the material from the box\n\t\tplane->mat = object[i]->mat;\n\t}\n\n\treturn true;\n\n} \/\/ load_content()\n\nbool load_camera() {\n\t\/\/ Initialize the camera\n\tcam = make_shared<arc_ball_camera>();\n\n\t\/* Set the projection matrix *\/\n\t\/\/ First get the aspect ratio (width\/height)\n\tfloat aspect = (float)renderer::get_instance().get_screen_width() \/\n\t\t\t\t\t(float)renderer::get_instance().get_screen_width();\n\t\/\/ Use this to set the camera projection matrix\n\tcam->set_projection(\n\t\t\t\t\t\tquarter_pi<float>(),\t\t\t\/\/ FOV\n\t\t\t\t\t\taspect,\t\t\t\t\t\t\t\/\/ Aspect ratio\n\t\t\t\t\t\t2.414f,\t\t\t\t\t\t\t\/\/ Near plane\n\t\t\t\t\t\t10000.0f);\t\t\t\t\t\t\/\/ Far plane\n\t\/\/ Set the camera properties\n\tcam->set_position(vec3(0.0, 0.0, 0.0));\n\tcam->set_distance(20.0f);\n\n\t\/\/ Attach camera to renderer\n\trenderer::get_instance().set_camera(cam);\n\n\t\/\/ Set the view matrix\n\tauto view = lookAt(\n\t\t\t\t\tvec3(20.0f, 20.0f, 20.0f),\t\/\/ Camera position\n\t\t\t\t\tvec3(0.0f, 0.0f, 0.0f),\t\t\/\/ Target\n\t\t\t\t\tvec3(0.0f, 1.0f, 0.0f));\t\/\/ Up vector\n\trenderer::get_instance().set_view(view);\n\n\treturn true;\n} \/\/ load_camera\n\nint main()\n{\n\t\/\/ Initialize the renderer\n\tif (!renderer::get_instance().initialise()) return -1;\n\n\t\/\/ Set the clear colour to cyan\n\tglClearColor(0.0f, 1.0f, 1.0f, 1.0f);\n\n\tif (!load_content()) {\n\t\treturn -1;\n\t}\n\n\tif (!load_camera()) {\n\t\treturn -1;\n\t}\n\n\t\/\/ Monitor the elapsed time per frame\n\tauto currentTimeStamp = system_clock::now();\n\tauto prevTimeStamp = system_clock::now();\n\n\n\t\/\/ Main render loop\n\twhile (renderer::get_instance().is_running())\n\t{\n\t\t\/\/ Get current time\n\t\tcurrentTimeStamp = system_clock::now();\n\t\t\/\/ Calculate elapsed time\n\t\tauto elapsed = duration_cast<milliseconds>(currentTimeStamp - prevTimeStamp);\n\t\t\/\/ Convert to fractions of a second\n\t\tauto seconds = float(elapsed.count()) \/ 1000.0;\n\n\t\t\/\/ Update Scene\n\t\tupdate(seconds);\n\n\t\t\/\/ Check if running\n\t\tif (renderer::get_instance().begin_render())\n\t\t{\n\t\t\t\/\/ Render Cube\n\t\t\tint i = 0;\n\t\t\tfor (i = 0; i <OBJECTS; i++) {\n\t\t\t\trenderer::get_instance().render(object[i]);\n\t\t\t}\n\n\t\t\t\/\/ Render plane\n\t\t\trenderer::get_instance().render(plane);\n\n\t\t\t\/\/ End the render\n\t\t\trenderer::get_instance().end_render();\n\t\t}\n\n\t\tprevTimeStamp = currentTimeStamp;\n\n\t} \/\/ Main render loop\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef LIBICS3_ICS3_VERSION_H_\n#define LIBICS3_ICS3_VERSION_H_\n\nnamespace ics {\n class MinorVersion {\n public:\n enum struct Versions {\n DEFAULT,\n V0,\n V5,\n V6\n };\n\n static const Versions getVersion();\n static void setVersion(const Versions);\n private:\n static Versions version;\n MinorVersion();\n };\n}\n\n#endif \/\/ LIBICS3_ICS3_VERSION_H_\n<commit_msg>Update version class for add noexception<commit_after>#ifndef LIBICS3_ICS3_VERSION_H_\n#define LIBICS3_ICS3_VERSION_H_\n\nnamespace ics {\n class MinorVersion {\n public:\n enum struct Versions {\n DEFAULT,\n V0,\n V5,\n V6\n };\n\n static const Versions getVersion() noexcept;\n static void setVersion(const Versions) noexcept;\n private:\n static Versions version;\n MinorVersion();\n };\n}\n\n#endif \/\/ LIBICS3_ICS3_VERSION_H_\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2010, Nikhil Marathe <nsm.nikhil@gmail.com> All rights reserved.\n * See LICENSE for details.\n*\/\n#include \"sasljs.h\"\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n\nusing namespace v8;\nusing namespace node;\n\n\/*\n * Macro from the sqlite3 bindings\n * http:\/\/github.com\/grumdrig\/node-sqlite\/blob\/master\/sqlite3_bindings.cc\n * by Eric Fredricksen\n *\/\n#define REQ_STR_ARG(I, VAR) \\\n if (args.Length() <= (I) || !args[I]->IsString()) \\\n return ThrowException(Exception::TypeError( \\\n String::New(\"Argument \" #I \" must be a string\"))); \\\n String::Utf8Value VAR(args[I]->ToString());\n\nnamespace sasljs {\nvoid ServerSession::Initialize ( Handle<Object> target )\n{\n v8::HandleScope scope;\n\n v8::Local<v8::FunctionTemplate> t = v8::FunctionTemplate::New(New);\n\n t->InstanceTemplate()->SetInternalFieldCount(1);\n\n NODE_DEFINE_CONSTANT( target, GSASL_OK );\n NODE_DEFINE_CONSTANT( target, GSASL_NEEDS_MORE );\n NODE_DEFINE_CONSTANT( target, GSASL_UNKNOWN_MECHANISM );\n NODE_DEFINE_CONSTANT( target, GSASL_MECHANISM_CALLED_TOO_MANY_TIMES );\n NODE_DEFINE_CONSTANT( target, GSASL_MALLOC_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_BASE64_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_CRYPTO_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SASLPREP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_MECHANISM_PARSE_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_AUTHENTICATION_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_INTEGRITY_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_CLIENT_CODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_SERVER_CODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_CALLBACK );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_ANONYMOUS_TOKEN );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_AUTHID );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_AUTHZID );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PASSWORD );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PASSCODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PIN );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_SERVICE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_HOSTNAME );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_RELEASE_BUFFER_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_IMPORT_NAME_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_INIT_SEC_CONTEXT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_ACCEPT_SEC_CONTEXT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_UNWRAP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_WRAP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_ACQUIRE_CRED_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_DISPLAY_NAME_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_UNSUPPORTED_PROTECTION_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_KERBEROS_V5_INIT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_KERBEROS_V5_INTERNAL_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SHISHI_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SECURID_SERVER_NEED_ADDITIONAL_PASSCODE );\n NODE_DEFINE_CONSTANT( target, GSASL_SECURID_SERVER_NEED_NEW_PIN );\n\n NODE_SET_PROTOTYPE_METHOD( t, \"_mechanisms\", GetMechanisms );\n NODE_SET_PROTOTYPE_METHOD( t, \"start\", Start );\n NODE_SET_PROTOTYPE_METHOD( t, \"step\", Step );\n\n target->Set( v8::String::NewSymbol( \"ServerSession\"), t->GetFunction() );\n}\n\n\/*\n * Call in JS\n * new ServerSession( \"service name\" );\n * All other options default to NULL for now\n *\/\nv8::Handle<v8::Value>\nServerSession::New (const v8::Arguments& args)\n{\n HandleScope scope;\n\n REQ_STR_ARG( 0, realm );\n\n if( args.Length() <= 1 || !args[1]->IsFunction() ) {\n return ThrowException(Exception::TypeError(\n String::New(\"Argument 1 must be a callback\")));\n }\n\n ServerSession *server = new ServerSession( *realm, cb_persist( args[1] ) );\n server->Wrap( args.This() );\n return args.This();\n}\n\nServerSession::ServerSession( const char *realm, Persistent<Function> *cb )\n : ObjectWrap()\n , m_session( NULL )\n , m_callback( cb )\n{\n}\n\nServerSession::~ServerSession()\n{\n}\n\nHandle<Value>\nServerSession::GetMechanisms( const v8::Arguments &args )\n{\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n\n char *result;\n \n int mechres = gsasl_server_mechlist( ctx, &result );\n if( mechres != GSASL_OK ) {\n return String::New( \"\" );\n }\n\n Handle<String> ret = String::New( result, strlen( result ) );\n free( result );\n return ret;\n}\n\nint\nServerSession::Callback( Gsasl *ctx, Gsasl_session *sctx, Gsasl_property prop )\n{\n ServerSession *sc = static_cast<ServerSession*>(gsasl_session_hook_get( sctx ));\n assert( sc );\n\n Local<Value> argv[] = { Integer::New( prop ) };\n Local<Value> ret = (*sc->m_callback)->Call( Context::GetCurrent()->Global(), 1, argv );\n std::cerr << \"Array \" << ret->IsArray();\n std::cerr << \"Obj \" << ret->IsObject();\n std::cerr << \"Integer \" << ret->IsInt32();\n std::cerr << \"String \" << ret->IsString();\n std::cerr << \"Null \" << ret->IsNull();\n std::cerr << \"Undefined \" << ret->IsUndefined();\n std::cerr << \"True \" << ret->IsTrue();\n std::cerr << \"False \" << ret->IsFalse();\n std::cerr << \"Function \" << ret->IsFunction();\n std::cerr << \"Number \" << ret->IsNumber();\n std::cerr << \"External \" << ret->IsExternal();\n if( ret->IsString() ) {\n std::cerr << \"--- Returned \" << *String::Utf8Value(ret->ToString());\n gsasl_property_set( sctx, prop, *String::Utf8Value(ret->ToString()) );\n return GSASL_OK;\n }\n return GSASL_NO_CALLBACK;\n}\n\n\/**\n * Returns a map\n * { status: integer_error_code,\n * data : data to send to client if error == GSASL_OK }\n *\/\nv8::Handle<v8::Value>\nServerSession::Start( const v8::Arguments &args )\n{\n REQ_STR_ARG( 0, mechanismString );\n\n int res;\n\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n if( sc->m_session != NULL ) {\n return ThrowException( Exception::Error( String::New( \"sasljs: This session is already started!\" ) ) );\n }\n\n res = gsasl_server_start( ctx, *mechanismString, &sc->m_session );\n gsasl_session_hook_set( sc->m_session, sc );\n gsasl_callback_set( ctx, sc->Callback );\n\n return Integer::New( res );\n}\n\nv8::Handle<v8::Value>\nServerSession::Step( const v8::Arguments &args )\n{\n REQ_STR_ARG( 0, clientinString );\n\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n\n char *reply;\n size_t len;\n\n char *b64;\n size_t crap;\n gsasl_base64_from( *clientinString, strlen( *clientinString ), &b64, &crap );\n std::cerr << std::endl << \"sasljs: step: \" << b64 << std::endl;\n\n gsasl_base64_from( *clientinString, strlen(*clientinString), &reply, &len );\n int res = gsasl_step64( sc->m_session, *clientinString, &reply );\n\n Handle<Object> obj = Object::New();\n Local<String> status = String::New( \"status\" );\n\n char *d64;\n gsasl_base64_from( reply, strlen(reply), &d64, &len );\n std::cerr << std::endl << \"sasljs: step OUT: \" << d64 << std::endl;\n\n if( res == GSASL_OK || res == GSASL_NEEDS_MORE ) {\n obj->Set( status, Integer::New( res ) );\n obj->Set( String::New( \"data\" ), String::New( reply, strlen( reply ) ) );\n\n return obj;\n }\n else {\n obj->Set( status, Integer::New( res ) );\n obj->Set( String::New( \"data\" ), String::New( gsasl_strerror( res ) ) );\n return obj;\n }\n}\n}\n\nextern \"C\" void\ninit (Handle<Object> target)\n{\n HandleScope scope;\n\n sasljs::ctx = NULL;\n int initres = gsasl_init( &sasljs::ctx );\n\n if( initres != GSASL_OK ) {\n fprintf( stderr, \"Could not initialize gsasl: %s\\n\", gsasl_strerror( initres ) );\n abort();\n }\n\n sasljs::ServerSession::Initialize(target);\n}\n<commit_msg>Added property\/callback constants<commit_after>\/*\n * Copyright 2010, Nikhil Marathe <nsm.nikhil@gmail.com> All rights reserved.\n * See LICENSE for details.\n*\/\n#include \"sasljs.h\"\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n\nusing namespace v8;\nusing namespace node;\n\n\/*\n * Macro from the sqlite3 bindings\n * http:\/\/github.com\/grumdrig\/node-sqlite\/blob\/master\/sqlite3_bindings.cc\n * by Eric Fredricksen\n *\/\n#define REQ_STR_ARG(I, VAR) \\\n if (args.Length() <= (I) || !args[I]->IsString()) \\\n return ThrowException(Exception::TypeError( \\\n String::New(\"Argument \" #I \" must be a string\"))); \\\n String::Utf8Value VAR(args[I]->ToString());\n\nnamespace sasljs {\nvoid ServerSession::Initialize ( Handle<Object> target )\n{\n v8::HandleScope scope;\n\n v8::Local<v8::FunctionTemplate> t = v8::FunctionTemplate::New(New);\n\n t->InstanceTemplate()->SetInternalFieldCount(1);\n\n \/\/ error codes\n NODE_DEFINE_CONSTANT( target, GSASL_OK );\n NODE_DEFINE_CONSTANT( target, GSASL_NEEDS_MORE );\n NODE_DEFINE_CONSTANT( target, GSASL_UNKNOWN_MECHANISM );\n NODE_DEFINE_CONSTANT( target, GSASL_MECHANISM_CALLED_TOO_MANY_TIMES );\n NODE_DEFINE_CONSTANT( target, GSASL_MALLOC_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_BASE64_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_CRYPTO_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SASLPREP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_MECHANISM_PARSE_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_AUTHENTICATION_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_INTEGRITY_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_CLIENT_CODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_SERVER_CODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_CALLBACK );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_ANONYMOUS_TOKEN );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_AUTHID );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_AUTHZID );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PASSWORD );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PASSCODE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_PIN );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_SERVICE );\n NODE_DEFINE_CONSTANT( target, GSASL_NO_HOSTNAME );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_RELEASE_BUFFER_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_IMPORT_NAME_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_INIT_SEC_CONTEXT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_ACCEPT_SEC_CONTEXT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_UNWRAP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_WRAP_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_ACQUIRE_CRED_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_DISPLAY_NAME_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_UNSUPPORTED_PROTECTION_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_KERBEROS_V5_INIT_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_KERBEROS_V5_INTERNAL_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SHISHI_ERROR );\n NODE_DEFINE_CONSTANT( target, GSASL_SECURID_SERVER_NEED_ADDITIONAL_PASSCODE );\n NODE_DEFINE_CONSTANT( target, GSASL_SECURID_SERVER_NEED_NEW_PIN );\n\n \/\/ property constants\n NODE_DEFINE_CONSTANT( target, GSASL_AUTHID );\n NODE_DEFINE_CONSTANT( target, GSASL_AUTHZID );\n NODE_DEFINE_CONSTANT( target, GSASL_PASSWORD );\n NODE_DEFINE_CONSTANT( target, GSASL_ANONYMOUS_TOKEN );\n NODE_DEFINE_CONSTANT( target, GSASL_SERVICE );\n NODE_DEFINE_CONSTANT( target, GSASL_HOSTNAME );\n NODE_DEFINE_CONSTANT( target, GSASL_GSSAPI_DISPLAY_NAME );\n NODE_DEFINE_CONSTANT( target, GSASL_PASSCODE );\n NODE_DEFINE_CONSTANT( target, GSASL_SUGGESTED_PIN );\n NODE_DEFINE_CONSTANT( target, GSASL_PIN );\n NODE_DEFINE_CONSTANT( target, GSASL_REALM );\n NODE_DEFINE_CONSTANT( target, GSASL_DIGEST_MD5_HASHED_PASSWORD );\n NODE_DEFINE_CONSTANT( target, GSASL_QOPS );\n NODE_DEFINE_CONSTANT( target, GSASL_QOP );\n NODE_DEFINE_CONSTANT( target, GSASL_SCRAM_ITER );\n NODE_DEFINE_CONSTANT( target, GSASL_SCRAM_SALT );\n NODE_DEFINE_CONSTANT( target, GSASL_SCRAM_SALTED_PASSWORD );\n NODE_DEFINE_CONSTANT( target, GSASL_VALIDATE_SIMPLE );\n NODE_DEFINE_CONSTANT( target, GSASL_VALIDATE_EXTERNAL );\n NODE_DEFINE_CONSTANT( target, GSASL_VALIDATE_ANONYMOUS );\n NODE_DEFINE_CONSTANT( target, GSASL_VALIDATE_GSSAPI );\n NODE_DEFINE_CONSTANT( target, GSASL_VALIDATE_SECURID );\n\n NODE_SET_PROTOTYPE_METHOD( t, \"_mechanisms\", GetMechanisms );\n NODE_SET_PROTOTYPE_METHOD( t, \"start\", Start );\n NODE_SET_PROTOTYPE_METHOD( t, \"step\", Step );\n\n target->Set( v8::String::NewSymbol( \"ServerSession\"), t->GetFunction() );\n}\n\n\/*\n * Call in JS\n * new ServerSession( \"service name\" );\n * All other options default to NULL for now\n *\/\nv8::Handle<v8::Value>\nServerSession::New (const v8::Arguments& args)\n{\n HandleScope scope;\n\n REQ_STR_ARG( 0, realm );\n\n if( args.Length() <= 1 || !args[1]->IsFunction() ) {\n return ThrowException(Exception::TypeError(\n String::New(\"Argument 1 must be a callback\")));\n }\n\n ServerSession *server = new ServerSession( *realm, cb_persist( args[1] ) );\n server->Wrap( args.This() );\n return args.This();\n}\n\nServerSession::ServerSession( const char *realm, Persistent<Function> *cb )\n : ObjectWrap()\n , m_session( NULL )\n , m_callback( cb )\n{\n}\n\nServerSession::~ServerSession()\n{\n}\n\nHandle<Value>\nServerSession::GetMechanisms( const v8::Arguments &args )\n{\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n\n char *result;\n \n int mechres = gsasl_server_mechlist( ctx, &result );\n if( mechres != GSASL_OK ) {\n return String::New( \"\" );\n }\n\n Handle<String> ret = String::New( result, strlen( result ) );\n free( result );\n return ret;\n}\n\nint\nServerSession::Callback( Gsasl *ctx, Gsasl_session *sctx, Gsasl_property prop )\n{\n ServerSession *sc = static_cast<ServerSession*>(gsasl_session_hook_get( sctx ));\n assert( sc );\n\n Local<Value> argv[] = { Integer::New( prop ) };\n Local<Value> ret = (*sc->m_callback)->Call( Context::GetCurrent()->Global(), 1, argv );\n std::cerr << \"Array \" << ret->IsArray();\n std::cerr << \"Obj \" << ret->IsObject();\n std::cerr << \"Integer \" << ret->IsInt32();\n std::cerr << \"String \" << ret->IsString();\n std::cerr << \"Null \" << ret->IsNull();\n std::cerr << \"Undefined \" << ret->IsUndefined();\n std::cerr << \"True \" << ret->IsTrue();\n std::cerr << \"False \" << ret->IsFalse();\n std::cerr << \"Function \" << ret->IsFunction();\n std::cerr << \"Number \" << ret->IsNumber();\n std::cerr << \"External \" << ret->IsExternal();\n if( ret->IsString() ) {\n std::cerr << \"--- Returned \" << *String::Utf8Value(ret->ToString());\n gsasl_property_set( sctx, prop, *String::Utf8Value(ret->ToString()) );\n return GSASL_OK;\n }\n return GSASL_NO_CALLBACK;\n}\n\n\/**\n * Returns a map\n * { status: integer_error_code,\n * data : data to send to client if error == GSASL_OK }\n *\/\nv8::Handle<v8::Value>\nServerSession::Start( const v8::Arguments &args )\n{\n REQ_STR_ARG( 0, mechanismString );\n\n int res;\n\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n if( sc->m_session != NULL ) {\n return ThrowException( Exception::Error( String::New( \"sasljs: This session is already started!\" ) ) );\n }\n\n res = gsasl_server_start( ctx, *mechanismString, &sc->m_session );\n gsasl_session_hook_set( sc->m_session, sc );\n gsasl_callback_set( ctx, sc->Callback );\n\n return Integer::New( res );\n}\n\nv8::Handle<v8::Value>\nServerSession::Step( const v8::Arguments &args )\n{\n REQ_STR_ARG( 0, clientinString );\n\n ServerSession *sc = Unwrap<ServerSession>( args.This() );\n\n char *reply;\n size_t len;\n\n char *b64;\n size_t crap;\n gsasl_base64_from( *clientinString, strlen( *clientinString ), &b64, &crap );\n std::cerr << std::endl << \"sasljs: step: \" << b64 << std::endl;\n\n gsasl_base64_from( *clientinString, strlen(*clientinString), &reply, &len );\n int res = gsasl_step64( sc->m_session, *clientinString, &reply );\n\n Handle<Object> obj = Object::New();\n Local<String> status = String::New( \"status\" );\n\n char *d64;\n gsasl_base64_from( reply, strlen(reply), &d64, &len );\n std::cerr << std::endl << \"sasljs: step OUT: \" << d64 << std::endl;\n\n if( res == GSASL_OK || res == GSASL_NEEDS_MORE ) {\n obj->Set( status, Integer::New( res ) );\n obj->Set( String::New( \"data\" ), String::New( reply, strlen( reply ) ) );\n\n return obj;\n }\n else {\n obj->Set( status, Integer::New( res ) );\n obj->Set( String::New( \"data\" ), String::New( gsasl_strerror( res ) ) );\n return obj;\n }\n}\n}\n\nextern \"C\" void\ninit (Handle<Object> target)\n{\n HandleScope scope;\n\n sasljs::ctx = NULL;\n int initres = gsasl_init( &sasljs::ctx );\n\n if( initres != GSASL_OK ) {\n fprintf( stderr, \"Could not initialize gsasl: %s\\n\", gsasl_strerror( initres ) );\n abort();\n }\n\n sasljs::ServerSession::Initialize(target);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"tile.hpp\"\n#include \"font_face_set.hpp\"\n#include \"harfbuzz_shaper.hpp\"\n\n\/\/ node\n#include <node_buffer.h>\n\n#include <set>\n#include <algorithm>\n#include <memory>\n\n\/\/ freetype2\nextern \"C\"\n{\n#include <ft2build.h>\n#include FT_FREETYPE_H\n\/\/ #include FT_STROKER_H\n}\n\nstruct ShapeBaton {\n v8::Persistent<v8::Function> callback;\n Tile *tile;\n std::string fontstack;\n};\n\nv8::Persistent<v8::FunctionTemplate> Tile::constructor;\n\nTile::Tile(const char *data, size_t length) : node::ObjectWrap() {\n tile.ParseFromArray(data, length);\n}\n\nTile::~Tile() {}\n\nvoid Tile::Init(v8::Handle<v8::Object> target) {\n v8::HandleScope scope;\n\n v8::Local<v8::FunctionTemplate> tpl = v8::FunctionTemplate::New(New);\n v8::Local<v8::String> name = v8::String::NewSymbol(\"Tile\");\n\n constructor = v8::Persistent<v8::FunctionTemplate>::New(tpl);\n\n \/\/ node::ObjectWrap uses the first internal field to store the wrapped pointer.\n constructor->InstanceTemplate()->SetInternalFieldCount(1);\n constructor->SetClassName(name);\n\n \/\/ Add all prototype methods, getters and setters here.\n constructor->PrototypeTemplate()->SetAccessor(v8::String::NewSymbol(\"length\"), Length);\n NODE_SET_PROTOTYPE_METHOD(constructor, \"serialize\", Serialize);\n NODE_SET_PROTOTYPE_METHOD(constructor, \"shape\", Shape);\n\n \/\/ This has to be last, otherwise the properties won't show up on the\n \/\/ object in JavaScript.\n target->Set(name, constructor->GetFunction());\n}\n\nv8::Handle<v8::Value> Tile::New(const v8::Arguments& args) {\n if (!args.IsConstructCall()) {\n return ThrowException(v8::Exception::TypeError(v8::String::New(\"Constructor must be called with new keyword\")));\n }\n if (args.Length() < 1 || !node::Buffer::HasInstance(args[0])) {\n return ThrowException(v8::Exception::TypeError(v8::String::New(\"First argument must be a buffer\")));\n }\n\n v8::Local<v8::Object> buffer = args[0]->ToObject();\n\n Tile* tile = new Tile(node::Buffer::Data(buffer), node::Buffer::Length(buffer));\n tile->Wrap(args.This());\n\n return args.This();\n}\n\nbool Tile::HasInstance(v8::Handle<v8::Value> val) {\n if (!val->IsObject()) return false;\n return constructor->HasInstance(val->ToObject());\n}\n\nv8::Handle<v8::Value> Tile::Length(v8::Local<v8::String> property, const v8::AccessorInfo &info) {\n v8::HandleScope scope;\n Tile* tile = node::ObjectWrap::Unwrap<Tile>(info.This());\n v8::Local<v8::Number> length = v8::Uint32::New(tile->tile.layers_size());\n return scope.Close(length);\n}\n\nv8::Handle<v8::Value> Tile::Serialize(const v8::Arguments& args) {\n v8::HandleScope scope;\n llmr::vector::tile& tile = node::ObjectWrap::Unwrap<Tile>(args.This())->tile;\n std::string serialized = tile.SerializeAsString();\n return scope.Close(node::Buffer::New(serialized.data(), serialized.length())->handle_);\n}\n\nv8::Handle<v8::Value> Tile::Shape(const v8::Arguments& args) {\n v8::HandleScope scope;\n\n if (args.Length() < 1) {\n return ThrowException(v8::Exception::TypeError(\n v8::String::New(\"First argument must be a font stack\")));\n }\n\n if (args.Length() < 2 || !args[1]->IsFunction()) {\n return ThrowException(v8::Exception::TypeError(\n v8::String::New(\"Second argument must be a callback function\")));\n }\n v8::Local<v8::Function> callback = v8::Local<v8::Function>::Cast(args[1]);\n \/\/ TODO: validate this is a string\n v8::String::Utf8Value fontstack(args[0]->ToString());\n\n Tile *tile = node::ObjectWrap::Unwrap<Tile>(args.This());\n\n ShapeBaton* baton = new ShapeBaton();\n baton->callback = v8::Persistent<v8::Function>::New(callback);\n baton->tile = tile;\n baton->fontstack = *fontstack;\n\n uv_work_t *req = new uv_work_t();\n req->data = baton;\n\n int status = uv_queue_work(uv_default_loop(), req, AsyncShape, (uv_after_work_cb)ShapeAfter);\n assert(status == 0);\n\n return v8::Undefined();\n}\n\nvoid Tile::AsyncShape(uv_work_t* req) {\n ShapeBaton* baton = static_cast<ShapeBaton*>(req->data);\n \/\/ Maps char index (UTF-16) to width. If multiple glyphs map to the\n \/\/ same char the sum of all widths is used.\n \/\/ Note: this probably isn't the best solution. it would be better\n \/\/ to have an object for each cluster, but it needs to be\n \/\/ implemented with no overhead.\n std::map<unsigned, double> width_map_;\n fontserver::freetype_engine font_engine_;\n fontserver::face_manager_freetype font_manager(font_engine_);\n fontserver::text_itemizer itemizer;\n\n fontserver::font_set fset(baton->fontstack);\n fset.add_fontstack(baton->fontstack, ',');\n\n fontserver::face_set_ptr face_set = font_manager.get_face_set(fset);\n \/\/ std::cout << \"FONTSTACK \" << baton->fontstack << ' ' << face_set->size() << '\\n';\n if (!face_set->size()) return;\n\n llmr::vector::tile& tile = baton->tile->tile;\n\n \/\/ for every label\n for (int i = 0; i < tile.layers_size(); i++) {\n const llmr::vector::layer& layer = tile.layers(i);\n\n typedef std::set<int> Strings;\n Strings strings;\n\n \/\/ Compile a set of all strings we need to shape.\n for (int j = 0; j < layer.features_size(); j++) {\n const llmr::vector::feature& feature = layer.features(j);\n\n for (int k = 1; k < feature.tags_size(); k += 2) {\n const std::string& key = layer.keys(feature.tags(k - 1));\n if (key == \"name\") {\n \/\/ TODO: handle multiple fonts stacks\n strings.insert(feature.tags(k));\n }\n \/\/ TODO: extract all keys we need to shape\n }\n }\n\n llmr::vector::layer* mutable_layer = tile.mutable_layers(i);\n fontserver::face_set_ptr layer_faces = font_manager.get_face_set();\n\n \/\/ Process strings per layer.\n for (auto const& key : strings) {\n const llmr::vector::value& value = layer.values(key);\n std::string text;\n if (value.has_string_value()) {\n text = value.string_value();\n }\n\n if (!text.empty()) {\n \/\/ Clear cluster widths.\n width_map_.clear();\n\n UnicodeString const& str = text.data();\n\n fontserver::text_line line(0, str.length() - 1);\n\n fontserver::text_format format(baton->fontstack, 24);\n fontserver::text_format_ptr format_ptr = \n std::make_shared<fontserver::text_format>(format);\n\n itemizer.add_text(str, format_ptr);\n\n const double scale_factor = 1.0;\n\n \/\/ Shape the text.\n fontserver::harfbuzz_shaper shaper;\n shaper.shape_text(line,\n itemizer,\n width_map_,\n font_manager,\n scale_factor);\n\n llmr::vector::label *label = mutable_layer->add_labels();\n label->set_text(key);\n\n \/\/ TODO: support multiple font stacks\n label->set_stack(0); \n\n \/\/ Add all glyphs for this labels and add new font\n \/\/ faces as they appear.\n for (auto const& glyph : line) {\n if (!glyph.face) {\n std::cout << text << ' ' << \n line.size() << \" glyphs\\n\" << \n \" codepoint: \" << glyph.glyph_index <<\n \" char_index: \" << glyph.char_index <<\n \" face_ptr: \" << glyph.face <<\n '\\n';\n continue;\n }\n\n \/\/ fontserver::face_ptr const& face = std::make_shared<fontserver::font_face>(*glyph.face);\n\n \/\/ Try to find whether this font has already been\n \/\/ used in this tile.\n fontserver::font_face_set::iterator face_itr = std::find(face_set->begin(), face_set->end(), glyph.face);\n if (face_itr == face_set->end()) {\n face_set->add(glyph.face);\n std::cout << \"Face not found: \" <<\n glyph.face->family_name() << ' ' <<\n glyph.face->style_name() << '\\n';\n }\n\n \/\/ Find out whether this font has been used in \n \/\/ this tile before and get its position.\n fontserver::font_face_set::iterator layer_itr = std::find(layer_faces->begin(), layer_faces->end(), glyph.face);\n if (layer_itr == layer_faces->end()) {\n layer_faces->add(glyph.face);\n layer_itr = layer_faces->end() - 1;\n }\n\n int layer_face_id = layer_itr - layer_faces->begin();\n\n \/*\n std::cout << \" face: \" << layer_face_id <<\n \" glyph: \" << glyph.glyph_index <<\n \" x: \" << width_map_[glyph.char_index] <<\n \" y: \" << glyph.offset.y <<\n '\\n';\n *\/\n\n label->add_faces(layer_face_id);\n label->add_glyphs(glyph.glyph_index);\n label->add_x(width_map_[glyph.char_index]);\n label->add_y(glyph.offset.y);\n }\n\n itemizer.clear();\n\n \/*\n std::cout << \"faces: \" << label->faces_size() <<\n \" glyphs: \" << label->glyphs_size() <<\n \" x: \" << label->x_size() <<\n \" y: \" << label->y_size() <<\n \" labels: \" << mutable_layer->labels_size() <<\n '\\n';\n *\/\n }\n }\n\n \/\/ Add a textual representation of the font so that we can figure out\n \/\/ later what font we need to use.\n for (auto const& face : *layer_faces) {\n std::string name = face->family_name() + \" \" + face->style_name();\n mutable_layer->add_faces(name);\n \/\/ We don't delete the TileFace objects here because\n \/\/ they are 'owned' by the global faces map and deleted\n \/\/ later on.\n }\n\n \/\/ Insert FAKE stacks\n mutable_layer->add_stacks(baton->fontstack);\n\n \/\/ std::cout << \" layer_faces: \" << mutable_layer->faces_size() << '\\n';\n }\n\n \/\/ Insert SDF glyphs + bitmaps\n for (auto const& face : *face_set) {\n llmr::vector::face *mutable_face = tile.add_faces();\n mutable_face->set_family(face->family_name());\n mutable_face->set_style(face->style_name());\n\n \/\/ Determine ASCII glyphs\n \/\/ std::set<uint32_t> omit;\n \/\/ FT_UInt glyph_index;\n \/\/ FT_ULong char_code = FT_Get_First_Char(ft_face, &glyph_index);\n \/\/ while (glyph_index != 0 && char_code < 256) {\n \/\/ omit.insert(glyph_index);\n \/\/ char_code = FT_Get_Next_Char(ft_face, char_code, &glyph_index);\n \/\/ }\n\n for (auto const& glyph : *face) {\n \/\/ Omit ASCII glyphs we determined earlier\n \/\/ if (omit.find(id) != omit.end()) {\n \/\/ continue;\n \/\/ }\n\n \/*\n std::cout << \" Glyph: \" << glyph.second.glyph_index <<\n \" width: \" << glyph.second.width <<\n \" height: \" << glyph.second.height() <<\n \" left: \" << glyph.second.left <<\n \" top: \" << glyph.second.top <<\n \" advance: \" << glyph.second.advance <<\n '\\n';\n *\/\n \n llmr::vector::glyph *mutable_glyph = mutable_face->add_glyphs();\n mutable_glyph->set_id(glyph.second.glyph_index);\n mutable_glyph->set_width(glyph.second.width);\n mutable_glyph->set_height(glyph.second.height);\n mutable_glyph->set_left(glyph.second.left);\n mutable_glyph->set_top(glyph.second.top);\n mutable_glyph->set_advance(glyph.second.advance);\n if (glyph.second.width > 0) {\n mutable_glyph->set_bitmap(glyph.second.bitmap);\n }\n }\n }\n}\n\nvoid Tile::ShapeAfter(uv_work_t* req) {\n v8::HandleScope scope;\n ShapeBaton* baton = static_cast<ShapeBaton*>(req->data);\n\n const unsigned argc = 1;\n v8::Local<v8::Value> argv[argc] = { v8::Local<v8::Value>::New(v8::Null()) };\n\n v8::TryCatch try_catch;\n baton->callback->Call(v8::Context::GetCurrent()->Global(), argc, argv);\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n\n baton->callback.Dispose();\n\n delete baton;\n delete req;\n}\n<commit_msg>create format outside of string loop<commit_after>#include \"tile.hpp\"\n#include \"font_face_set.hpp\"\n#include \"harfbuzz_shaper.hpp\"\n\n\/\/ node\n#include <node_buffer.h>\n\n#include <set>\n#include <algorithm>\n#include <memory>\n\n\/\/ freetype2\nextern \"C\"\n{\n#include <ft2build.h>\n#include FT_FREETYPE_H\n\/\/ #include FT_STROKER_H\n}\n\nstruct ShapeBaton {\n v8::Persistent<v8::Function> callback;\n Tile *tile;\n std::string fontstack;\n};\n\nv8::Persistent<v8::FunctionTemplate> Tile::constructor;\n\nTile::Tile(const char *data, size_t length) : node::ObjectWrap() {\n tile.ParseFromArray(data, length);\n}\n\nTile::~Tile() {}\n\nvoid Tile::Init(v8::Handle<v8::Object> target) {\n v8::HandleScope scope;\n\n v8::Local<v8::FunctionTemplate> tpl = v8::FunctionTemplate::New(New);\n v8::Local<v8::String> name = v8::String::NewSymbol(\"Tile\");\n\n constructor = v8::Persistent<v8::FunctionTemplate>::New(tpl);\n\n \/\/ node::ObjectWrap uses the first internal field to store the wrapped pointer.\n constructor->InstanceTemplate()->SetInternalFieldCount(1);\n constructor->SetClassName(name);\n\n \/\/ Add all prototype methods, getters and setters here.\n constructor->PrototypeTemplate()->SetAccessor(v8::String::NewSymbol(\"length\"), Length);\n NODE_SET_PROTOTYPE_METHOD(constructor, \"serialize\", Serialize);\n NODE_SET_PROTOTYPE_METHOD(constructor, \"shape\", Shape);\n\n \/\/ This has to be last, otherwise the properties won't show up on the\n \/\/ object in JavaScript.\n target->Set(name, constructor->GetFunction());\n}\n\nv8::Handle<v8::Value> Tile::New(const v8::Arguments& args) {\n if (!args.IsConstructCall()) {\n return ThrowException(v8::Exception::TypeError(v8::String::New(\"Constructor must be called with new keyword\")));\n }\n if (args.Length() < 1 || !node::Buffer::HasInstance(args[0])) {\n return ThrowException(v8::Exception::TypeError(v8::String::New(\"First argument must be a buffer\")));\n }\n\n v8::Local<v8::Object> buffer = args[0]->ToObject();\n\n Tile* tile = new Tile(node::Buffer::Data(buffer), node::Buffer::Length(buffer));\n tile->Wrap(args.This());\n\n return args.This();\n}\n\nbool Tile::HasInstance(v8::Handle<v8::Value> val) {\n if (!val->IsObject()) return false;\n return constructor->HasInstance(val->ToObject());\n}\n\nv8::Handle<v8::Value> Tile::Length(v8::Local<v8::String> property, const v8::AccessorInfo &info) {\n v8::HandleScope scope;\n Tile* tile = node::ObjectWrap::Unwrap<Tile>(info.This());\n v8::Local<v8::Number> length = v8::Uint32::New(tile->tile.layers_size());\n return scope.Close(length);\n}\n\nv8::Handle<v8::Value> Tile::Serialize(const v8::Arguments& args) {\n v8::HandleScope scope;\n llmr::vector::tile& tile = node::ObjectWrap::Unwrap<Tile>(args.This())->tile;\n std::string serialized = tile.SerializeAsString();\n return scope.Close(node::Buffer::New(serialized.data(), serialized.length())->handle_);\n}\n\nv8::Handle<v8::Value> Tile::Shape(const v8::Arguments& args) {\n v8::HandleScope scope;\n\n if (args.Length() < 1) {\n return ThrowException(v8::Exception::TypeError(\n v8::String::New(\"First argument must be a font stack\")));\n }\n\n if (args.Length() < 2 || !args[1]->IsFunction()) {\n return ThrowException(v8::Exception::TypeError(\n v8::String::New(\"Second argument must be a callback function\")));\n }\n v8::Local<v8::Function> callback = v8::Local<v8::Function>::Cast(args[1]);\n \/\/ TODO: validate this is a string\n v8::String::Utf8Value fontstack(args[0]->ToString());\n\n Tile *tile = node::ObjectWrap::Unwrap<Tile>(args.This());\n\n ShapeBaton* baton = new ShapeBaton();\n baton->callback = v8::Persistent<v8::Function>::New(callback);\n baton->tile = tile;\n baton->fontstack = *fontstack;\n\n uv_work_t *req = new uv_work_t();\n req->data = baton;\n\n int status = uv_queue_work(uv_default_loop(), req, AsyncShape, (uv_after_work_cb)ShapeAfter);\n assert(status == 0);\n\n return v8::Undefined();\n}\n\nvoid Tile::AsyncShape(uv_work_t* req) {\n ShapeBaton* baton = static_cast<ShapeBaton*>(req->data);\n \/\/ Maps char index (UTF-16) to width. If multiple glyphs map to the\n \/\/ same char the sum of all widths is used.\n \/\/ Note: this probably isn't the best solution. it would be better\n \/\/ to have an object for each cluster, but it needs to be\n \/\/ implemented with no overhead.\n std::map<unsigned, double> width_map_;\n fontserver::freetype_engine font_engine_;\n fontserver::face_manager_freetype font_manager(font_engine_);\n fontserver::text_itemizer itemizer;\n\n fontserver::font_set fset(baton->fontstack);\n fset.add_fontstack(baton->fontstack, ',');\n\n fontserver::face_set_ptr face_set = font_manager.get_face_set(fset);\n if (!face_set->size()) return;\n\n llmr::vector::tile& tile = baton->tile->tile;\n\n \/\/ for every label\n for (int i = 0; i < tile.layers_size(); i++) {\n const llmr::vector::layer& layer = tile.layers(i);\n\n typedef std::set<int> Strings;\n Strings strings;\n\n \/\/ Compile a set of all strings we need to shape.\n for (int j = 0; j < layer.features_size(); j++) {\n const llmr::vector::feature& feature = layer.features(j);\n\n for (int k = 1; k < feature.tags_size(); k += 2) {\n const std::string& key = layer.keys(feature.tags(k - 1));\n if (key == \"name\") {\n \/\/ TODO: handle multiple fonts stacks\n strings.insert(feature.tags(k));\n }\n \/\/ TODO: extract all keys we need to shape\n }\n }\n\n llmr::vector::layer* mutable_layer = tile.mutable_layers(i);\n fontserver::face_set_ptr layer_faces = font_manager.get_face_set();\n\n fontserver::text_format format(baton->fontstack, 24);\n fontserver::text_format_ptr format_ptr = \n std::make_shared<fontserver::text_format>(format);\n\n \/\/ Process strings per layer.\n for (auto const& key : strings) {\n const llmr::vector::value& value = layer.values(key);\n std::string text;\n if (value.has_string_value()) {\n text = value.string_value();\n }\n\n if (!text.empty()) {\n \/\/ Clear cluster widths.\n width_map_.clear();\n\n UnicodeString const& str = text.data();\n\n fontserver::text_line line(0, str.length() - 1);\n\n itemizer.add_text(str, format_ptr);\n\n const double scale_factor = 1.0;\n\n \/\/ Shape the text.\n fontserver::harfbuzz_shaper shaper;\n shaper.shape_text(line,\n itemizer,\n width_map_,\n font_manager,\n scale_factor);\n\n llmr::vector::label *label = mutable_layer->add_labels();\n label->set_text(key);\n\n \/\/ TODO: support multiple font stacks\n label->set_stack(0); \n\n \/\/ Add all glyphs for this labels and add new font\n \/\/ faces as they appear.\n for (auto const& glyph : line) {\n if (!glyph.face) {\n std::cout << text << ' ' << \n line.size() << \" glyphs\\n\" << \n \" codepoint: \" << glyph.glyph_index <<\n \" char_index: \" << glyph.char_index <<\n \" face_ptr: \" << glyph.face <<\n '\\n';\n continue;\n }\n\n \/\/ fontserver::face_ptr const& face = std::make_shared<fontserver::font_face>(*glyph.face);\n\n \/\/ Try to find whether this font has already been\n \/\/ used in this tile.\n fontserver::font_face_set::iterator face_itr = std::find(face_set->begin(), face_set->end(), glyph.face);\n if (face_itr == face_set->end()) {\n face_set->add(glyph.face);\n std::cout << \"Face not found: \" <<\n glyph.face->family_name() << ' ' <<\n glyph.face->style_name() << '\\n';\n }\n\n \/\/ Find out whether this font has been used in \n \/\/ this tile before and get its position.\n fontserver::font_face_set::iterator layer_itr = std::find(layer_faces->begin(), layer_faces->end(), glyph.face);\n if (layer_itr == layer_faces->end()) {\n layer_faces->add(glyph.face);\n layer_itr = layer_faces->end() - 1;\n }\n\n int layer_face_id = layer_itr - layer_faces->begin();\n\n \/*\n std::cout << \" face: \" << layer_face_id <<\n \" glyph: \" << glyph.glyph_index <<\n \" x: \" << width_map_[glyph.char_index] <<\n \" y: \" << glyph.offset.y <<\n '\\n';\n *\/\n\n label->add_faces(layer_face_id);\n label->add_glyphs(glyph.glyph_index);\n label->add_x(width_map_[glyph.char_index]);\n label->add_y(glyph.offset.y);\n }\n\n itemizer.clear();\n\n \/*\n std::cout << \"faces: \" << label->faces_size() <<\n \" glyphs: \" << label->glyphs_size() <<\n \" x: \" << label->x_size() <<\n \" y: \" << label->y_size() <<\n \" labels: \" << mutable_layer->labels_size() <<\n '\\n';\n *\/\n }\n }\n\n \/\/ Add a textual representation of the font so that we can figure out\n \/\/ later what font we need to use.\n for (auto const& face : *layer_faces) {\n std::string name = face->family_name() + \" \" + face->style_name();\n mutable_layer->add_faces(name);\n \/\/ We don't delete the TileFace objects here because\n \/\/ they are 'owned' by the global faces map and deleted\n \/\/ later on.\n }\n\n \/\/ Insert FAKE stacks\n mutable_layer->add_stacks(baton->fontstack);\n\n \/\/ std::cout << \" layer_faces: \" << mutable_layer->faces_size() << '\\n';\n }\n\n \/\/ Insert SDF glyphs + bitmaps\n for (auto const& face : *face_set) {\n llmr::vector::face *mutable_face = tile.add_faces();\n mutable_face->set_family(face->family_name());\n mutable_face->set_style(face->style_name());\n\n \/\/ Determine ASCII glyphs\n \/\/ std::set<uint32_t> omit;\n \/\/ FT_UInt glyph_index;\n \/\/ FT_ULong char_code = FT_Get_First_Char(ft_face, &glyph_index);\n \/\/ while (glyph_index != 0 && char_code < 256) {\n \/\/ omit.insert(glyph_index);\n \/\/ char_code = FT_Get_Next_Char(ft_face, char_code, &glyph_index);\n \/\/ }\n\n for (auto const& glyph : *face) {\n \/\/ Omit ASCII glyphs we determined earlier\n \/\/ if (omit.find(id) != omit.end()) {\n \/\/ continue;\n \/\/ }\n\n \/*\n std::cout << \" Glyph: \" << glyph.second.glyph_index <<\n \" width: \" << glyph.second.width <<\n \" height: \" << glyph.second.height() <<\n \" left: \" << glyph.second.left <<\n \" top: \" << glyph.second.top <<\n \" advance: \" << glyph.second.advance <<\n '\\n';\n *\/\n \n llmr::vector::glyph *mutable_glyph = mutable_face->add_glyphs();\n mutable_glyph->set_id(glyph.second.glyph_index);\n mutable_glyph->set_width(glyph.second.width);\n mutable_glyph->set_height(glyph.second.height);\n mutable_glyph->set_left(glyph.second.left);\n mutable_glyph->set_top(glyph.second.top);\n mutable_glyph->set_advance(glyph.second.advance);\n if (glyph.second.width > 0) {\n mutable_glyph->set_bitmap(glyph.second.bitmap);\n }\n }\n }\n}\n\nvoid Tile::ShapeAfter(uv_work_t* req) {\n v8::HandleScope scope;\n ShapeBaton* baton = static_cast<ShapeBaton*>(req->data);\n\n const unsigned argc = 1;\n v8::Local<v8::Value> argv[argc] = { v8::Local<v8::Value>::New(v8::Null()) };\n\n v8::TryCatch try_catch;\n baton->callback->Call(v8::Context::GetCurrent()->Global(), argc, argv);\n if (try_catch.HasCaught()) {\n node::FatalException(try_catch);\n }\n\n baton->callback.Dispose();\n\n delete baton;\n delete req;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"jpp\/Jpp.h\"\n\nusing namespace jpp::literals;\n\n\/\/****************************\n\/\/ Tests for Creating Objects\n\/\/****************************\n\nTEST(CreateJppObject, String) {\n jpp::obj temp {\n \"string0\"_f = \"stringy0\",\n \"string1\"_f = \"stringy1\",\n \"string2\"_f = \"stringy2\"\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Number) {\n jpp::obj temp{\n \"double0\"_f = 3.1415926500,\n \"double1\"_f = 3.1415926501,\n \"double2\"_f = 3.1415926502\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Integer) {\n jpp::obj temp{\n \"integer0\"_f = 1234500,\n \"integer1\"_f = 1234501,\n \"integer2\"_f = 1234502\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Boolean) {\n jpp::obj temp{\n \"boolean0\"_f = false,\n \"boolean1\"_f = true\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Arbitrary) {\n\n struct dummy { int x; };\n\n jpp::obj temp{\n \"struct0\"_f = dummy{ 1 },\n \"struct1\"_f = dummy{ 2 },\n \"struct2\"_f = dummy{ 3 }\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Null) {\n\n jpp::obj temp{\n \"null0\"_f = nullptr,\n \"null1\"_f = nullptr\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, All) {\n\n struct dummy { int x; };\n\n jpp::obj temp {\n \"string\"_f = \"stringy\",\n \"double\"_f = 3.1415,\n \"integer\"_f = 13245,\n \"boolean\"_f = false,\n \"fuckall\"_f = dummy{6666},\n \"nothing\"_f = nullptr\n };\n\n ASSERT_EQ(0, 0);\n}\n\n\/\/*****************************\n\/\/ Tests for Accessing Objects\n\/\/*****************************\n\n\nTEST(AccessJppObject, String) {\n jpp::obj temp{\n \"string0\"_f = \"stringy0\",\n \"string1\"_f = \"stringy1\",\n \"string2\"_f = \"stringy2\"\n };\n\n auto a0 = jpp::Get<jpp::str>(temp[\"string0\"]);\n auto a1 = jpp::Get<jpp::str>(temp[\"string1\"]);\n auto a2 = jpp::Get<jpp::str>(temp[\"string2\"]);\n\n EXPECT_STREQ(a0, \"stringy0\");\n EXPECT_STREQ(a1, \"stringy1\");\n EXPECT_STREQ(a2, \"stringy2\");\n}\n\n\nTEST(AccessJppObject, Number) {\n\n jpp::obj temp{\n \"double0\"_f = 3.1415926500,\n \"double1\"_f = 3.1415926501,\n \"double2\"_f = 3.1415926502\n };\n\n auto a0 = jpp::Get<double>(temp[\"double0\"]);\n auto a1 = jpp::Get<double>(temp[\"double1\"]);\n auto a2 = jpp::Get<double>(temp[\"double2\"]);\n\n EXPECT_EQ(a0, 3.1415926500);\n EXPECT_EQ(a1, 3.1415926501);\n EXPECT_EQ(a2, 3.1415926502);\n}\n\nTEST(AccessJppObject, Integer) {\n\n jpp::obj temp{\n \"integer0\"_f = 1234500,\n \"integer1\"_f = 1234501,\n \"integer2\"_f = 1234502\n };\n\n auto a0 = jpp::Get<int>(temp[\"integer0\"]);\n auto a1 = jpp::Get<int>(temp[\"integer1\"]);\n auto a2 = jpp::Get<int>(temp[\"integer2\"]);\n\n EXPECT_EQ(a0, 1234500);\n EXPECT_EQ(a1, 1234501);\n EXPECT_EQ(a2, 1234502);\n}\n\nTEST(AccessJppObject, Boolean) {\n\n jpp::obj temp{\n \"boolean0\"_f = false,\n \"boolean1\"_f = true\n };\n\n auto a0 = jpp::Get<bool>(temp[\"boolean0\"]);\n auto a1 = jpp::Get<bool>(temp[\"boolean1\"]);\n\n EXPECT_EQ(a0, false);\n EXPECT_EQ(a1, true);\n}\n\nTEST(AccessJppObject, Arbitrary) {\n\n struct dummy { int x; };\n\n jpp::obj temp{\n \"struct0\"_f = dummy{ 1 },\n \"struct1\"_f = dummy{ 2 },\n \"struct2\"_f = dummy{ 3 }\n };\n\n auto a0 = jpp::Get<dummy>(temp[\"struct0\"]);\n auto a1 = jpp::Get<dummy>(temp[\"struct1\"]);\n auto a2 = jpp::Get<dummy>(temp[\"struct2\"]);\n\n EXPECT_EQ(a0->x, 1);\n EXPECT_EQ(a1->x, 2);\n EXPECT_EQ(a2->x, 3);\n}\n\nTEST(AccessJppObject, Null) {\n\n jpp::obj temp{\n \"null0\"_f = nullptr,\n \"null1\"_f = nullptr\n };\n\n auto a0 = jpp::Get<jpp::null>(temp[\"null0\"]);\n auto a1 = jpp::Get<jpp::null>(temp[\"null1\"]);\n\n EXPECT_EQ(a0, nullptr);\n EXPECT_EQ(a1, nullptr);\n}\n\nTEST(AccessJppObject, All) {\n struct dummy { int x; };\n\n jpp::obj temp {\n \"string\"_f = \"stringy\",\n \"double\"_f = 3.1415,\n \"integer\"_f = 13245,\n \"boolean\"_f = false,\n \"fuckall\"_f = dummy{6666},\n \"nothing\"_f = nullptr\n };\n\n auto a0 = jpp::Get<jpp::str>(temp[\"string\"]);\n auto a1 = jpp::Get<double>(temp[\"double\"]);\n auto a2 = jpp::Get<int>(temp[\"integer\"]);\n auto a3 = jpp::Get<bool>(temp[\"boolean\"]);\n auto a4 = jpp::Get<dummy>(temp[\"fuckall\"]);\n auto a5 = jpp::Get<jpp::null>(temp[\"nothing\"]);\n\n EXPECT_STREQ(a0, \"stringy\");\n EXPECT_EQ(a1, 3.1415);\n EXPECT_EQ(a2, 13245);\n EXPECT_EQ(a3, false);\n EXPECT_EQ(a4->x, 6666);\n EXPECT_EQ(a5, nullptr);\n}\n\nTEST(WrongTypeAccessJppObject, String) {\n \n struct dummy {};\n \n jpp::obj temp{\n \"string0\"_f = \"stringy0\"\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"string0\"]), \"integral\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"string0\"]), \"boolean\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"string0\"]), \"floating\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"string0\"]), \"null\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"string0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Number) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"double0\"_f = 3.1415926500\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"double0\"]), \"integral\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"double0\"]), \"boolean\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"double0\"]), \"string\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"double0\"]), \"null\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"double0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Integer) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"integer0\"_f = 123456\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"integer0\"]), \"floating\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"integer0\"]), \"boolean\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"integer0\"]), \"string\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"integer0\"]), \"null\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"integer0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Boolean) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"boolean0\"_f = true\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"boolean0\"]), \"floating\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"boolean0\"]), \"integral\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"boolean0\"]), \"string\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"boolean0\"]), \"null\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"boolean0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Arbitrary) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"struct0\"_f = dummy{}\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"struct0\"]), \"floating\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"struct0\"]), \"integral\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"struct0\"]), \"string\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"struct0\"]), \"null\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"struct0\"]), \"boolean\");\n}\n\nTEST(WrongTypeAccessJppObject, Null) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"null0\"_f = nullptr\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"null0\"]), \"floating\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"null0\"]), \"integral\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"null0\"]), \"string\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"null0\"]), \"non-fundamental\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"null0\"]), \"boolean\");\n}\n\n\nTEST(NullAccessJppObject, All) {\n\n struct dummy {};\n\n jpp::obj temp{\n };\n\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<int>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<bool>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<float>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::str>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<jpp::null>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH_IF_SUPPORTED(jpp::Get<dummy>(temp[\"string0\"]), \"not.*found.*empty\");\n}\n\n\nTEST(ExampleTest, TestJSON) {\n\n jpp::obj temp {\n \"string\"_f = \"this is a string\",\n \"double\"_f = 3.14159265,\n \"integer\"_f = 12345,\n \"boolean\"_f = true,\n \"null\"_f = nullptr\n };\n}\n<commit_msg>Switch to running death tests always, regardless of support<commit_after>#include \"gtest\/gtest.h\"\n#include \"jpp\/Jpp.h\"\n\nusing namespace jpp::literals;\n\n\/\/****************************\n\/\/ Tests for Creating Objects\n\/\/****************************\n\nTEST(CreateJppObject, String) {\n jpp::obj temp {\n \"string0\"_f = \"stringy0\",\n \"string1\"_f = \"stringy1\",\n \"string2\"_f = \"stringy2\"\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Number) {\n jpp::obj temp{\n \"double0\"_f = 3.1415926500,\n \"double1\"_f = 3.1415926501,\n \"double2\"_f = 3.1415926502\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Integer) {\n jpp::obj temp{\n \"integer0\"_f = 1234500,\n \"integer1\"_f = 1234501,\n \"integer2\"_f = 1234502\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Boolean) {\n jpp::obj temp{\n \"boolean0\"_f = false,\n \"boolean1\"_f = true\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Arbitrary) {\n\n struct dummy { int x; };\n\n jpp::obj temp{\n \"struct0\"_f = dummy{ 1 },\n \"struct1\"_f = dummy{ 2 },\n \"struct2\"_f = dummy{ 3 }\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, Null) {\n\n jpp::obj temp{\n \"null0\"_f = nullptr,\n \"null1\"_f = nullptr\n };\n\n ASSERT_EQ(0, 0);\n}\n\nTEST(CreateJppObject, All) {\n\n struct dummy { int x; };\n\n jpp::obj temp {\n \"string\"_f = \"stringy\",\n \"double\"_f = 3.1415,\n \"integer\"_f = 13245,\n \"boolean\"_f = false,\n \"fuckall\"_f = dummy{6666},\n \"nothing\"_f = nullptr\n };\n\n ASSERT_EQ(0, 0);\n}\n\n\/\/*****************************\n\/\/ Tests for Accessing Objects\n\/\/*****************************\n\n\nTEST(AccessJppObject, String) {\n jpp::obj temp{\n \"string0\"_f = \"stringy0\",\n \"string1\"_f = \"stringy1\",\n \"string2\"_f = \"stringy2\"\n };\n\n auto a0 = jpp::Get<jpp::str>(temp[\"string0\"]);\n auto a1 = jpp::Get<jpp::str>(temp[\"string1\"]);\n auto a2 = jpp::Get<jpp::str>(temp[\"string2\"]);\n\n EXPECT_STREQ(a0, \"stringy0\");\n EXPECT_STREQ(a1, \"stringy1\");\n EXPECT_STREQ(a2, \"stringy2\");\n}\n\n\nTEST(AccessJppObject, Number) {\n\n jpp::obj temp{\n \"double0\"_f = 3.1415926500,\n \"double1\"_f = 3.1415926501,\n \"double2\"_f = 3.1415926502\n };\n\n auto a0 = jpp::Get<double>(temp[\"double0\"]);\n auto a1 = jpp::Get<double>(temp[\"double1\"]);\n auto a2 = jpp::Get<double>(temp[\"double2\"]);\n\n EXPECT_EQ(a0, 3.1415926500);\n EXPECT_EQ(a1, 3.1415926501);\n EXPECT_EQ(a2, 3.1415926502);\n}\n\nTEST(AccessJppObject, Integer) {\n\n jpp::obj temp{\n \"integer0\"_f = 1234500,\n \"integer1\"_f = 1234501,\n \"integer2\"_f = 1234502\n };\n\n auto a0 = jpp::Get<int>(temp[\"integer0\"]);\n auto a1 = jpp::Get<int>(temp[\"integer1\"]);\n auto a2 = jpp::Get<int>(temp[\"integer2\"]);\n\n EXPECT_EQ(a0, 1234500);\n EXPECT_EQ(a1, 1234501);\n EXPECT_EQ(a2, 1234502);\n}\n\nTEST(AccessJppObject, Boolean) {\n\n jpp::obj temp{\n \"boolean0\"_f = false,\n \"boolean1\"_f = true\n };\n\n auto a0 = jpp::Get<bool>(temp[\"boolean0\"]);\n auto a1 = jpp::Get<bool>(temp[\"boolean1\"]);\n\n EXPECT_EQ(a0, false);\n EXPECT_EQ(a1, true);\n}\n\nTEST(AccessJppObject, Arbitrary) {\n\n struct dummy { int x; };\n\n jpp::obj temp{\n \"struct0\"_f = dummy{ 1 },\n \"struct1\"_f = dummy{ 2 },\n \"struct2\"_f = dummy{ 3 }\n };\n\n auto a0 = jpp::Get<dummy>(temp[\"struct0\"]);\n auto a1 = jpp::Get<dummy>(temp[\"struct1\"]);\n auto a2 = jpp::Get<dummy>(temp[\"struct2\"]);\n\n EXPECT_EQ(a0->x, 1);\n EXPECT_EQ(a1->x, 2);\n EXPECT_EQ(a2->x, 3);\n}\n\nTEST(AccessJppObject, Null) {\n\n jpp::obj temp{\n \"null0\"_f = nullptr,\n \"null1\"_f = nullptr\n };\n\n auto a0 = jpp::Get<jpp::null>(temp[\"null0\"]);\n auto a1 = jpp::Get<jpp::null>(temp[\"null1\"]);\n\n EXPECT_EQ(a0, nullptr);\n EXPECT_EQ(a1, nullptr);\n}\n\nTEST(AccessJppObject, All) {\n struct dummy { int x; };\n\n jpp::obj temp {\n \"string\"_f = \"stringy\",\n \"double\"_f = 3.1415,\n \"integer\"_f = 13245,\n \"boolean\"_f = false,\n \"fuckall\"_f = dummy{6666},\n \"nothing\"_f = nullptr\n };\n\n auto a0 = jpp::Get<jpp::str>(temp[\"string\"]);\n auto a1 = jpp::Get<double>(temp[\"double\"]);\n auto a2 = jpp::Get<int>(temp[\"integer\"]);\n auto a3 = jpp::Get<bool>(temp[\"boolean\"]);\n auto a4 = jpp::Get<dummy>(temp[\"fuckall\"]);\n auto a5 = jpp::Get<jpp::null>(temp[\"nothing\"]);\n\n EXPECT_STREQ(a0, \"stringy\");\n EXPECT_EQ(a1, 3.1415);\n EXPECT_EQ(a2, 13245);\n EXPECT_EQ(a3, false);\n EXPECT_EQ(a4->x, 6666);\n EXPECT_EQ(a5, nullptr);\n}\n\nTEST(WrongTypeAccessJppObject, String) {\n \n struct dummy {};\n \n jpp::obj temp{\n \"string0\"_f = \"stringy0\"\n };\n\n EXPECT_DEATH(jpp::Get<int>(temp[\"string0\"]), \"integral\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"string0\"]), \"boolean\");\n EXPECT_DEATH(jpp::Get<float>(temp[\"string0\"]), \"floating\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"string0\"]), \"null\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"string0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Number) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"double0\"_f = 3.1415926500\n };\n\n EXPECT_DEATH(jpp::Get<int>(temp[\"double0\"]), \"integral\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"double0\"]), \"boolean\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"double0\"]), \"string\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"double0\"]), \"null\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"double0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Integer) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"integer0\"_f = 123456\n };\n\n EXPECT_DEATH(jpp::Get<float>(temp[\"integer0\"]), \"floating\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"integer0\"]), \"boolean\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"integer0\"]), \"string\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"integer0\"]), \"null\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"integer0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Boolean) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"boolean0\"_f = true\n };\n\n EXPECT_DEATH(jpp::Get<float>(temp[\"boolean0\"]), \"floating\");\n EXPECT_DEATH(jpp::Get<int>(temp[\"boolean0\"]), \"integral\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"boolean0\"]), \"string\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"boolean0\"]), \"null\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"boolean0\"]), \"non-fundamental\");\n}\n\nTEST(WrongTypeAccessJppObject, Arbitrary) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"struct0\"_f = dummy{}\n };\n\n EXPECT_DEATH(jpp::Get<float>(temp[\"struct0\"]), \"floating\");\n EXPECT_DEATH(jpp::Get<int>(temp[\"struct0\"]), \"integral\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"struct0\"]), \"string\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"struct0\"]), \"null\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"struct0\"]), \"boolean\");\n}\n\nTEST(WrongTypeAccessJppObject, Null) {\n\n struct dummy {};\n\n jpp::obj temp{\n \"null0\"_f = nullptr\n };\n\n EXPECT_DEATH(jpp::Get<float>(temp[\"null0\"]), \"floating\");\n EXPECT_DEATH(jpp::Get<int>(temp[\"null0\"]), \"integral\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"null0\"]), \"string\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"null0\"]), \"non-fundamental\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"null0\"]), \"boolean\");\n}\n\n\nTEST(NullAccessJppObject, All) {\n\n struct dummy {};\n\n jpp::obj temp{\n };\n\n EXPECT_DEATH(jpp::Get<int>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH(jpp::Get<bool>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH(jpp::Get<float>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH(jpp::Get<jpp::str>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH(jpp::Get<jpp::null>(temp[\"string0\"]), \"not.*found.*empty\");\n EXPECT_DEATH(jpp::Get<dummy>(temp[\"string0\"]), \"not.*found.*empty\");\n}\n\n\nTEST(ExampleTest, TestJSON) {\n\n jpp::obj temp {\n \"string\"_f = \"this is a string\",\n \"double\"_f = 3.14159265,\n \"integer\"_f = 12345,\n \"boolean\"_f = true,\n \"null\"_f = nullptr\n };\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of libigl, a simple c++ geometry processing library.\n\/\/\n\/\/ Copyright (C) 2013 Alec Jacobson <alecjacobson@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public License\n\/\/ v. 2.0. If a copy of the MPL was not distributed with this file, You can\n\/\/ obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n#include \"writeOBJ.h\"\n\n#include <iostream>\n#include <limits>\n#include <iomanip>\n#include <fstream>\n#include <cstdio>\n#include <cassert>\n\ntemplate <typename DerivedV, typename DerivedF, typename DerivedT>\nIGL_INLINE bool igl::writeOBJ(\n const std::string str,\n const Eigen::PlainObjectBase<DerivedV>& V,\n const Eigen::PlainObjectBase<DerivedF>& F,\n const Eigen::PlainObjectBase<DerivedV>& CN,\n const Eigen::PlainObjectBase<DerivedF>& FN,\n const Eigen::PlainObjectBase<DerivedT>& TC,\n const Eigen::PlainObjectBase<DerivedF>& FTC)\n{\n FILE * obj_file = fopen(str.c_str(),\"w\");\n if(NULL==obj_file)\n {\n printf(\"IOError: %s could not be opened for writing...\",str.c_str());\n return false;\n }\n \/\/ Loop over V\n for(int i = 0;i<(int)V.rows();i++)\n {\n fprintf(obj_file,\"v %0.15g %0.15g %0.15g\\n\",\n V(i,0),\n V(i,1),\n V(i,2)\n );\n }\n bool write_N = CN.rows() >0;\n\n if(write_N)\n {\n for(int i = 0;i<(int)CN.rows();i++)\n {\n fprintf(obj_file,\"v %0.15g %0.15g %0.15g\\n\",\n CN(i,0),\n CN(i,1),\n CN(i,2)\n );\n }\n fprintf(obj_file,\"\\n\");\n }\n\n bool write_texture_coords = TC.rows() >0;\n\n if(write_texture_coords)\n {\n for(int i = 0;i<(int)TC.rows();i++)\n {\n fprintf(obj_file, \"vt %0.15g %0.15g\\n\",TC(i,0),TC(i,1));\n }\n fprintf(obj_file,\"\\n\");\n }\n\n \/\/ loop over F\n for(int i = 0;i<(int)F.rows();++i)\n {\n fprintf(obj_file,\"f\");\n for(int j = 0; j<(int)F.cols();++j)\n {\n \/\/ OBJ is 1-indexed\n fprintf(obj_file,\" %u\",F(i,j)+1);\n\n if(write_texture_coords)\n fprintf(obj_file,\"\/%u\",FTC(i,j)+1);\n if(write_N)\n {\n if (write_texture_coords)\n fprintf(obj_file,\"\/%u\",FN(i,j)+1);\n else\n fprintf(obj_file,\"\/\/%u\",FN(i,j)+1);\n }\n }\n fprintf(obj_file,\"\\n\");\n }\n fclose(obj_file);\n return true;\n}\n\ntemplate <typename DerivedV, typename DerivedF>\nIGL_INLINE bool igl::writeOBJ(\n const std::string str,\n const Eigen::PlainObjectBase<DerivedV>& V,\n const Eigen::PlainObjectBase<DerivedF>& F)\n{\n using namespace std;\n using namespace Eigen;\n assert(V.cols() == 3 && \"V should have 3 columns\");\n ofstream s(str);\n if(!s.is_open())\n {\n fprintf(stderr,\"IOError: writeOBJ() could not open %s\\n\",str.c_str());\n return false;\n }\n s<<\n V.format(IOFormat(FullPrecision,DontAlignCols,\" \",\"\\n\",\"v \",\"\",\"\",\"\"))<<\n (F.array()+1).format(IOFormat(FullPrecision,DontAlignCols,\" \",\"\\n\",\"f \",\"\",\"\",\"\"));\n return true;\n}\n\n#ifdef IGL_STATIC_LIBRARY\n\/\/ Explicit template specialization\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 1, -1, 3>, Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1>, Eigen::Matrix<double, -1, 2, 1, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<float, -1, 3, 1, -1, 3>, Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1>, Eigen::Matrix<float, -1, 2, 1, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 2, 1, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, 2, 0, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 0, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&);\n#endif\n<commit_msg>write object bug: need newline between end of v and start of f<commit_after>\/\/ This file is part of libigl, a simple c++ geometry processing library.\n\/\/\n\/\/ Copyright (C) 2013 Alec Jacobson <alecjacobson@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public License\n\/\/ v. 2.0. If a copy of the MPL was not distributed with this file, You can\n\/\/ obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n#include \"writeOBJ.h\"\n\n#include <iostream>\n#include <limits>\n#include <iomanip>\n#include <fstream>\n#include <cstdio>\n#include <cassert>\n\ntemplate <typename DerivedV, typename DerivedF, typename DerivedT>\nIGL_INLINE bool igl::writeOBJ(\n const std::string str,\n const Eigen::PlainObjectBase<DerivedV>& V,\n const Eigen::PlainObjectBase<DerivedF>& F,\n const Eigen::PlainObjectBase<DerivedV>& CN,\n const Eigen::PlainObjectBase<DerivedF>& FN,\n const Eigen::PlainObjectBase<DerivedT>& TC,\n const Eigen::PlainObjectBase<DerivedF>& FTC)\n{\n FILE * obj_file = fopen(str.c_str(),\"w\");\n if(NULL==obj_file)\n {\n printf(\"IOError: %s could not be opened for writing...\",str.c_str());\n return false;\n }\n \/\/ Loop over V\n for(int i = 0;i<(int)V.rows();i++)\n {\n fprintf(obj_file,\"v %0.15g %0.15g %0.15g\\n\",\n V(i,0),\n V(i,1),\n V(i,2)\n );\n }\n bool write_N = CN.rows() >0;\n\n if(write_N)\n {\n for(int i = 0;i<(int)CN.rows();i++)\n {\n fprintf(obj_file,\"v %0.15g %0.15g %0.15g\\n\",\n CN(i,0),\n CN(i,1),\n CN(i,2)\n );\n }\n fprintf(obj_file,\"\\n\");\n }\n\n bool write_texture_coords = TC.rows() >0;\n\n if(write_texture_coords)\n {\n for(int i = 0;i<(int)TC.rows();i++)\n {\n fprintf(obj_file, \"vt %0.15g %0.15g\\n\",TC(i,0),TC(i,1));\n }\n fprintf(obj_file,\"\\n\");\n }\n\n \/\/ loop over F\n for(int i = 0;i<(int)F.rows();++i)\n {\n fprintf(obj_file,\"f\");\n for(int j = 0; j<(int)F.cols();++j)\n {\n \/\/ OBJ is 1-indexed\n fprintf(obj_file,\" %u\",F(i,j)+1);\n\n if(write_texture_coords)\n fprintf(obj_file,\"\/%u\",FTC(i,j)+1);\n if(write_N)\n {\n if (write_texture_coords)\n fprintf(obj_file,\"\/%u\",FN(i,j)+1);\n else\n fprintf(obj_file,\"\/\/%u\",FN(i,j)+1);\n }\n }\n fprintf(obj_file,\"\\n\");\n }\n fclose(obj_file);\n return true;\n}\n\ntemplate <typename DerivedV, typename DerivedF>\nIGL_INLINE bool igl::writeOBJ(\n const std::string str,\n const Eigen::PlainObjectBase<DerivedV>& V,\n const Eigen::PlainObjectBase<DerivedF>& F)\n{\n using namespace std;\n using namespace Eigen;\n assert(V.cols() == 3 && \"V should have 3 columns\");\n ofstream s(str);\n if(!s.is_open())\n {\n fprintf(stderr,\"IOError: writeOBJ() could not open %s\\n\",str.c_str());\n return false;\n }\n s<<\n V.format(IOFormat(FullPrecision,DontAlignCols,\" \",\"\\n\",\"v \",\"\",\"\",\"\\n\"))<<\n (F.array()+1).format(IOFormat(FullPrecision,DontAlignCols,\" \",\"\\n\",\"f \",\"\",\"\",\"\\n\"));\n return true;\n}\n\n#ifdef IGL_STATIC_LIBRARY\n\/\/ Explicit template specialization\n\/\/ generated by autoexplicit.sh\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 1, -1, 3>, Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1>, Eigen::Matrix<double, -1, 2, 1, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 1, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<float, -1, 3, 1, -1, 3>, Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1>, Eigen::Matrix<float, -1, 2, 1, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 3, 1, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<float, -1, 2, 1, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<unsigned int, -1, -1, 1, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, -1, 0, -1, -1>, Eigen::Matrix<int, -1, -1, 0, -1, -1>, Eigen::Matrix<double, -1, 2, 0, -1, 2> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 2, 0, -1, 2> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, -1, 0, -1, -1> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&);\ntemplate bool igl::writeOBJ<Eigen::Matrix<double, -1, 3, 0, -1, 3>, Eigen::Matrix<int, -1, 3, 0, -1, 3>, Eigen::Matrix<double, -1, -1, 0, -1, -1> >(std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&, Eigen::PlainObjectBase<Eigen::Matrix<double, -1, -1, 0, -1, -1> > const&, Eigen::PlainObjectBase<Eigen::Matrix<int, -1, 3, 0, -1, 3> > const&);\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"highlevel_feature_extractor.h\"\n#include <rcsc\/common\/server_param.h>\n\nusing namespace rcsc;\n\nHighLevelFeatureExtractor::HighLevelFeatureExtractor(int num_teammates,\n int num_opponents,\n bool playing_offense) :\n FeatureExtractor(num_teammates, num_opponents, playing_offense)\n{\n assert(numTeammates >= 0);\n assert(numOpponents >= 0);\n numFeatures = num_basic_features + features_per_teammate * numTeammates;\n if (numOpponents > 0) {\n \/\/ One extra basic feature and one feature per teammate\n numFeatures += 1 + numTeammates;\n }\n feature_vec.resize(numFeatures);\n}\n\nHighLevelFeatureExtractor::~HighLevelFeatureExtractor() {}\n\nconst std::vector<float>& HighLevelFeatureExtractor::ExtractFeatures(\n const WorldModel& wm) {\n featIndx = 0;\n const ServerParam& SP = ServerParam::i();\n const SelfObject& self = wm.self();\n const Vector2D& self_pos = self.pos();\n const float self_ang = self.body().radian();\n const PlayerCont& teammates = wm.teammates();\n float maxR = sqrtf(SP.pitchHalfLength() * SP.pitchHalfLength()\n + SP.pitchHalfWidth() * SP.pitchHalfWidth());\n \/\/ features about self pos\n \/\/ Allow the agent to go 10% over the playfield in any direction\n float tolerance_x = .1 * SP.pitchHalfLength();\n float tolerance_y = .1 * SP.pitchHalfWidth();\n \/\/ Feature[0]: X-postion\n if (playingOffense) {\n addNormFeature(self_pos.x, -tolerance_x, SP.pitchHalfLength() + tolerance_x);\n } else {\n addNormFeature(self_pos.x, -SP.pitchHalfLength()-tolerance_x, tolerance_x);\n }\n \/\/ addFeature(self_pos.x);\n\n \/\/ Feature[1]: Y-Position\n addNormFeature(self_pos.y, -SP.pitchHalfWidth() - tolerance_y,\n SP.pitchHalfWidth() + tolerance_y);\n \/\/ addFeature(self_pos.y);\n\n \/\/ Feature[2]: Self Angle\n addNormFeature(self_ang, -2*M_PI, 2*M_PI); \/\/ addFeature(self_ang);\n\n float r;\n float th;\n \/\/ features about the ball\n Vector2D ball_pos = wm.ball().pos();\n angleDistToPoint(self_pos, ball_pos, th, r);\n \/\/ Feature[3]: Dist to ball\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n \/\/ Feature[4]: Ang to ball\n addNormFeature(th, -2*M_PI, 2*M_PI); \/\/ addFeature(th);\n \/\/ Feature[5]: Able to kick\n addNormFeature(self.isKickable(), false, true); \/\/ addFeature(self.isKickable());\n\n \/\/ features about distance to goal center\n Vector2D goalCenter(SP.pitchHalfLength(), 0);\n if (!playingOffense) {\n goalCenter.assign(-SP.pitchHalfLength(), 0);\n }\n angleDistToPoint(self_pos, goalCenter, th, r);\n \/\/ Feature[6]: Goal Center Distance\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n \/\/ Feature[7]: Angle to goal center\n addNormFeature(th, -2*M_PI, 2*M_PI); \/\/ addFeature(th);\n \/\/ Feature[8]: largest open goal angle\n addNormFeature(calcLargestGoalAngle(wm, self_pos), 0, M_PI);\n \/\/ addFeature(calcLargestGoalAngle(wm, self_pos));\n\n \/\/ Features [9+T - 9 + 2T]: teammate's open angle to goal\n int detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n addNormFeature(calcLargestGoalAngle(wm, teammate.pos()), 0, M_PI);\n \/\/ addFeature(calcLargestGoalAngle(wm, teammate.pos()));\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n\n \/\/ dist to our closest opp\n if (numOpponents > 0) {\n calcClosestOpp(wm, self_pos, th, r);\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n\n \/\/ teammates dists to closest opps\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n calcClosestOpp(wm, teammate.pos(), th, r);\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n }\n\n \/\/ Features [9+2T - 9+3T]: open angle to teammates\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n addNormFeature(calcLargestTeammateAngle(wm, self_pos, teammate.pos()),0,M_PI);\n \/\/ addFeature(calcLargestTeammateAngle(wm, self_pos, teammate.pos()));\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n\n \/\/ Features [9+3T - end]: dist, angle, unum of teammates\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n angleDistToPoint(self_pos, teammate.pos(), th, r);\n addNormFeature(r,0,maxR); \/\/ addFeature(r);\n addNormFeature(th,-M_PI,M_PI); \/\/ addFeature(th);\n addFeature(teammate.unum());\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n addFeature(FEAT_INVALID);\n addFeature(FEAT_INVALID);\n }\n\n assert(featIndx == numFeatures);\n \/\/ checkFeatures();\n \/\/std::cout << \"features: \" << features.rows(0,ind-1).t();\n return feature_vec;\n}\n<commit_msg>Corrected bug in high level feature set.<commit_after>#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"highlevel_feature_extractor.h\"\n#include <rcsc\/common\/server_param.h>\n\nusing namespace rcsc;\n\nHighLevelFeatureExtractor::HighLevelFeatureExtractor(int num_teammates,\n int num_opponents,\n bool playing_offense) :\n FeatureExtractor(num_teammates, num_opponents, playing_offense)\n{\n assert(numTeammates >= 0);\n assert(numOpponents >= 0);\n numFeatures = num_basic_features + features_per_teammate * numTeammates;\n if (numOpponents > 0) {\n \/\/ One extra basic feature and one feature per teammate\n numFeatures += 1 + numTeammates;\n }\n feature_vec.resize(numFeatures);\n}\n\nHighLevelFeatureExtractor::~HighLevelFeatureExtractor() {}\n\nconst std::vector<float>& HighLevelFeatureExtractor::ExtractFeatures(\n const WorldModel& wm) {\n featIndx = 0;\n const ServerParam& SP = ServerParam::i();\n const SelfObject& self = wm.self();\n const Vector2D& self_pos = self.pos();\n const float self_ang = self.body().radian();\n const PlayerCont& teammates = wm.teammates();\n float maxR = sqrtf(SP.pitchHalfLength() * SP.pitchHalfLength()\n + SP.pitchHalfWidth() * SP.pitchHalfWidth());\n \/\/ features about self pos\n \/\/ Allow the agent to go 10% over the playfield in any direction\n float tolerance_x = .1 * SP.pitchHalfLength();\n float tolerance_y = .1 * SP.pitchHalfWidth();\n \/\/ Feature[0]: X-postion\n if (playingOffense) {\n addNormFeature(self_pos.x, -tolerance_x, SP.pitchHalfLength() + tolerance_x);\n } else {\n addNormFeature(self_pos.x, -SP.pitchHalfLength()-tolerance_x, tolerance_x);\n }\n \/\/ addFeature(self_pos.x);\n\n \/\/ Feature[1]: Y-Position\n addNormFeature(self_pos.y, -SP.pitchHalfWidth() - tolerance_y,\n SP.pitchHalfWidth() + tolerance_y);\n \/\/ addFeature(self_pos.y);\n\n \/\/ Feature[2]: Self Angle\n addNormFeature(self_ang, -M_PI, M_PI); \/\/ addFeature(self_ang);\n\n float r;\n float th;\n \/\/ features about the ball\n Vector2D ball_pos = wm.ball().pos();\n angleDistToPoint(self_pos, ball_pos, th, r);\n \/\/ Feature[3]: Dist to ball\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n \/\/ Feature[4]: Ang to ball\n addNormFeature(th, -M_PI, M_PI); \/\/ addFeature(th);\n \/\/ Feature[5]: Able to kick\n addNormFeature(self.isKickable(), false, true); \/\/ addFeature(self.isKickable());\n\n \/\/ features about distance to goal center\n Vector2D goalCenter(SP.pitchHalfLength(), 0);\n if (!playingOffense) {\n goalCenter.assign(-SP.pitchHalfLength(), 0);\n }\n angleDistToPoint(self_pos, goalCenter, th, r);\n \/\/ Feature[6]: Goal Center Distance\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n \/\/ Feature[7]: Angle to goal center\n addNormFeature(th, -M_PI, M_PI); \/\/ addFeature(th);\n \/\/ Feature[8]: largest open goal angle\n addNormFeature(calcLargestGoalAngle(wm, self_pos), 0, M_PI);\n \/\/ addFeature(calcLargestGoalAngle(wm, self_pos));\n\n \/\/ Features [9+T - 9 + 2T]: teammate's open angle to goal\n int detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n addNormFeature(calcLargestGoalAngle(wm, teammate.pos()), 0, M_PI);\n \/\/ addFeature(calcLargestGoalAngle(wm, teammate.pos()));\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n\n \/\/ dist to our closest opp\n if (numOpponents > 0) {\n calcClosestOpp(wm, self_pos, th, r);\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n\n \/\/ teammates dists to closest opps\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n calcClosestOpp(wm, teammate.pos(), th, r);\n addNormFeature(r, 0, maxR); \/\/ addFeature(r);\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n }\n\n \/\/ Features [9+2T - 9+3T]: open angle to teammates\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n addNormFeature(calcLargestTeammateAngle(wm, self_pos, teammate.pos()),0,M_PI);\n \/\/ addFeature(calcLargestTeammateAngle(wm, self_pos, teammate.pos()));\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n }\n\n \/\/ Features [9+3T - end]: dist, angle, unum of teammates\n detected_teammates = 0;\n for (PlayerCont::const_iterator it=teammates.begin(); it != teammates.end(); ++it) {\n const PlayerObject& teammate = *it;\n if (valid(teammate) && detected_teammates < numTeammates) {\n angleDistToPoint(self_pos, teammate.pos(), th, r);\n addNormFeature(r,0,maxR); \/\/ addFeature(r);\n addNormFeature(th,-M_PI,M_PI); \/\/ addFeature(th);\n addFeature(teammate.unum());\n detected_teammates++;\n }\n }\n \/\/ Add zero features for any missing teammates\n for (int i=detected_teammates; i<numTeammates; ++i) {\n addFeature(FEAT_INVALID);\n addFeature(FEAT_INVALID);\n addFeature(FEAT_INVALID);\n }\n\n assert(featIndx == numFeatures);\n \/\/ checkFeatures();\n \/\/std::cout << \"features: \" << features.rows(0,ind-1).t();\n return feature_vec;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <getopt.h>\n#include <signal.h>\n#include <map>\n\n#include <sys\/inotify.h>\n#include <unistd.h>\n\n#include \"debug-func.hpp\"\n#include \"main.hpp\"\n#include \"wayfire\/nonstd\/safe-list.hpp\"\n#include <wayfire\/config\/file.hpp>\n\n#include <wayland-server.h>\n\n#include \"core\/core-impl.hpp\"\n#include \"wayfire\/output.hpp\"\n\nwf_runtime_config runtime_config;\n\n#define INOT_BUF_SIZE (1024 * sizeof(inotify_event))\nstatic char buf[INOT_BUF_SIZE];\n\nstatic std::string config_dir, config_file;\n\nstatic void reload_config(int fd)\n{\n wf::config::load_configuration_options_from_file(\n wf::get_core().config, config_file);\n inotify_add_watch(fd, config_dir.c_str(), IN_CREATE);\n inotify_add_watch(fd, config_file.c_str(), IN_MODIFY);\n}\n\nstatic int handle_config_updated(int fd, uint32_t mask, void *data)\n{\n LOGD(\"Reloading configuration file\");\n\n \/* read, but don't use *\/\n read(fd, buf, INOT_BUF_SIZE);\n reload_config(fd);\n\n wf::get_core().emit_signal(\"reload-config\", nullptr);\n\n return 0;\n}\n\nstatic void print_version()\n{\n std::cout << WAYFIRE_VERSION << std::endl;\n exit(0);\n}\n\nstatic void print_help()\n{\n std::cout << \"Wayfire \" << WAYFIRE_VERSION << std::endl;\n std::cout << \"Usage: wayfire [OPTION]...\\n\" << std::endl;\n std::cout << \" -c, --config specify config file to use\" << std::endl;\n std::cout << \" -h, --help print this help\" << std::endl;\n std::cout << \" -d, --debug enable debug logging\" << std::endl;\n std::cout <<\n \" -D, --damage-debug enable additional debug for damaged regions\" <<\n std::endl;\n std::cout << \" -R, --damage-rerender rerender damaged regions\" << std::endl;\n std::cout << \" -v, --version print version and exit\" << std::endl;\n exit(0);\n}\n\nstd::map<EGLint, EGLint> default_attribs = {\n {EGL_RED_SIZE, 1},\n {EGL_GREEN_SIZE, 1},\n {EGL_BLUE_SIZE, 1},\n {EGL_DEPTH_SIZE, 1},\n};\n\nstd::map<wlr_renderer*, wlr_egl*> egl_for_renderer;\n\n\/* Merge the default config and the config we need *\/\nstatic std::vector<EGLint> generate_config_attribs(EGLint *renderer_attribs)\n{\n std::vector<EGLint> attribs;\n\n \/* See what we have in the default config *\/\n for (auto i = renderer_attribs; i != NULL && *i != EGL_NONE; i++)\n {\n \/* We will override this value later *\/\n if (default_attribs.count(*i))\n {\n ++i;\n continue;\n }\n\n attribs.push_back(*i);\n i++;\n attribs.push_back(*i);\n }\n\n \/* Then pack all values we want *\/\n for (auto & p : default_attribs)\n {\n attribs.push_back(p.first);\n attribs.push_back(p.second);\n }\n\n attribs.push_back(EGL_NONE);\n\n return attribs;\n}\n\nwlr_renderer *add_egl_depth_renderer(wlr_egl *egl, EGLenum platform,\n void *remote, EGLint *_r_attr, EGLint visual)\n{\n bool r;\n auto attribs = generate_config_attribs(_r_attr);\n r = wlr_egl_init(egl, platform, remote, attribs.data(), visual);\n\n if (!r)\n {\n LOGE(\"Failed to initialize EGL\");\n\n return NULL;\n }\n\n auto renderer = wlr_gles2_renderer_create(egl);\n if (!renderer)\n {\n LOGE(\"Failed to create GLES2 renderer\");\n wlr_egl_finish(egl);\n\n return NULL;\n }\n\n egl_for_renderer[renderer] = egl;\n\n return renderer;\n}\n\nnamespace wf\n{\nnamespace _safe_list_detail\n{\nwl_event_loop *event_loop;\nvoid idle_cleanup_func(void *data)\n{\n auto priv = reinterpret_cast<std::function<void()>*>(data);\n (*priv)();\n}\n}\n}\n\nstatic bool drop_permissions(void)\n{\n if ((getuid() != geteuid()) || (getgid() != getegid()))\n {\n \/\/ Set the gid and uid in the correct order.\n if ((setgid(getgid()) != 0) || (setuid(getuid()) != 0))\n {\n LOGE(\"Unable to drop root, refusing to start\");\n\n return false;\n }\n }\n\n if ((setgid(0) != -1) || (setuid(0) != -1))\n {\n LOGE(\"Unable to drop root (we shouldn't be able to \"\n \"restore it after setuid), refusing to start\");\n\n return false;\n }\n\n return true;\n}\n\nstatic wf::log::color_mode_t detect_color_mode()\n{\n return isatty(STDOUT_FILENO) ?\n wf::log::LOG_COLOR_MODE_ON : wf::log::LOG_COLOR_MODE_OFF;\n}\n\nstatic void wlr_log_handler(wlr_log_importance level,\n const char *fmt, va_list args)\n{\n const int bufsize = 4 * 1024;\n char buffer[bufsize];\n vsnprintf(buffer, bufsize, fmt, args);\n\n wf::log::log_level_t wlevel;\n switch (level)\n {\n case WLR_ERROR:\n wlevel = wf::log::LOG_LEVEL_ERROR;\n break;\n\n case WLR_INFO:\n wlevel = wf::log::LOG_LEVEL_INFO;\n break;\n\n case WLR_DEBUG:\n wlevel = wf::log::LOG_LEVEL_DEBUG;\n break;\n\n default:\n return;\n }\n\n wf::log::log_plain(wlevel, buffer);\n}\n\n#ifndef ASAN_ENABLED\nstatic void signal_handler(int signal)\n{\n std::string error;\n switch (signal)\n {\n case SIGSEGV:\n error = \"Segmentation fault\";\n break;\n\n case SIGFPE:\n error = \"Floating-point exception\";\n break;\n\n case SIGABRT:\n error = \"Fatal error(SIGABRT)\";\n break;\n\n default:\n error = \"Unknown\";\n }\n\n LOGE(\"Fatal error: \", error);\n wf::print_trace(false);\n std::exit(0);\n}\n\n#endif\n\nstatic std::optional<std::string> choose_socket(wl_display *display)\n{\n for (int i = 1; i <= 32; i++)\n {\n auto name = \"wayland-\" + std::to_string(i);\n if (wl_display_add_socket(display, name.c_str()) >= 0)\n {\n return name;\n }\n }\n\n return {};\n}\n\nint main(int argc, char *argv[])\n{\n config_dir = nonull(getenv(\"XDG_CONFIG_HOME\"));\n if (!config_dir.compare(\"nil\"))\n {\n config_dir = std::string(nonull(getenv(\"HOME\"))) + \"\/.config\";\n }\n\n config_file = config_dir + \"\/wayfire.ini\";\n\n wf::log::log_level_t log_level = wf::log::LOG_LEVEL_INFO;\n struct option opts[] = {\n {\n \"config\", required_argument, NULL, 'c'\n },\n {\"debug\", no_argument, NULL, 'd'},\n {\"damage-debug\", no_argument, NULL, 'D'},\n {\"damage-rerender\", no_argument, NULL, 'R'},\n {\"help\", no_argument, NULL, 'h'},\n {\"version\", no_argument, NULL, 'v'},\n {0, 0, NULL, 0}\n };\n\n int c, i;\n while ((c = getopt_long(argc, argv, \"c:dDhRv\", opts, &i)) != -1)\n {\n switch (c)\n {\n case 'c':\n config_file = optarg;\n break;\n\n case 'D':\n runtime_config.damage_debug = true;\n break;\n\n case 'R':\n runtime_config.no_damage_track = true;\n break;\n\n case 'h':\n print_help();\n break;\n\n case 'd':\n log_level = wf::log::LOG_LEVEL_DEBUG;\n break;\n\n case 'v':\n print_version();\n break;\n\n default:\n std::cerr << \"Unrecognized command line argument \" << optarg << \"\\n\" <<\n std::endl;\n }\n }\n\n auto wlr_log_level =\n (log_level == wf::log::LOG_LEVEL_DEBUG ? WLR_DEBUG : WLR_ERROR);\n wlr_log_init(wlr_log_level, wlr_log_handler);\n wf::log::initialize_logging(std::cout, log_level, detect_color_mode());\n\n#ifndef ASAN_ENABLED\n \/* In case of crash, print the stacktrace for debugging.\n * However, if ASAN is enabled, we'll get better stacktrace from there. *\/\n signal(SIGSEGV, signal_handler);\n signal(SIGFPE, signal_handler);\n signal(SIGABRT, signal_handler);\n#endif\n\n LOGI(\"Starting wayfire version \", WAYFIRE_VERSION);\n \/* First create display and initialize safe-list's event loop, so that\n * wf objects (which depend on safe-list) can work *\/\n auto display = wl_display_create();\n wf::_safe_list_detail::event_loop = wl_display_get_event_loop(display);\n\n auto& core = wf::get_core_impl();\n\n \/** TODO: move this to core_impl constructor *\/\n core.display = display;\n core.ev_loop = wl_display_get_event_loop(core.display);\n core.backend = wlr_backend_autocreate(core.display, add_egl_depth_renderer);\n core.renderer = wlr_backend_get_renderer(core.backend);\n core.egl = egl_for_renderer[core.renderer];\n assert(core.egl);\n\n if (!drop_permissions())\n {\n wl_display_destroy_clients(core.display);\n wl_display_destroy(core.display);\n\n return EXIT_FAILURE;\n }\n\n std::vector<std::string> xmldirs;\n if (char *plugin_xml_path = getenv(\"WAYFIRE_PLUGIN_XML_PATH\"))\n {\n std::stringstream ss(plugin_xml_path);\n std::string entry;\n while (std::getline(ss, entry, ':'))\n {\n xmldirs.push_back(entry);\n }\n }\n\n xmldirs.push_back(PLUGIN_XML_DIR);\n\n LOGI(\"using config file: \", config_file.c_str());\n core.config = wf::config::build_configuration(\n xmldirs, SYSCONFDIR \"\/wayfire\/defaults.ini\", config_file);\n\n int inotify_fd = inotify_init1(IN_CLOEXEC);\n reload_config(inotify_fd);\n\n wl_event_loop_add_fd(core.ev_loop, inotify_fd, WL_EVENT_READABLE,\n handle_config_updated, NULL);\n core.init();\n\n auto socket = choose_socket(core.display);\n if (!socket)\n {\n LOGE(\"Failed to create wayland socket, exiting.\");\n\n return -1;\n }\n\n core.wayland_display = socket.value();\n LOGI(\"Using socket name \", core.wayland_display);\n if (!wlr_backend_start(core.backend))\n {\n LOGE(\"Failed to initialize backend, exiting\");\n wlr_backend_destroy(core.backend);\n wl_display_destroy(core.display);\n\n return -1;\n }\n\n setenv(\"WAYLAND_DISPLAY\", core.wayland_display.c_str(), 1);\n wl_display_run(core.display);\n\n \/* Teardown *\/\n wl_display_destroy_clients(core.display);\n wl_display_destroy(core.display);\n\n return EXIT_SUCCESS;\n}\n<commit_msg>main: use _Exit() in signal handlers<commit_after>#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <getopt.h>\n#include <signal.h>\n#include <map>\n\n#include <sys\/inotify.h>\n#include <unistd.h>\n\n#include \"debug-func.hpp\"\n#include \"main.hpp\"\n#include \"wayfire\/nonstd\/safe-list.hpp\"\n#include <wayfire\/config\/file.hpp>\n\n#include <wayland-server.h>\n\n#include \"core\/core-impl.hpp\"\n#include \"wayfire\/output.hpp\"\n\nwf_runtime_config runtime_config;\n\n#define INOT_BUF_SIZE (1024 * sizeof(inotify_event))\nstatic char buf[INOT_BUF_SIZE];\n\nstatic std::string config_dir, config_file;\n\nstatic void reload_config(int fd)\n{\n wf::config::load_configuration_options_from_file(\n wf::get_core().config, config_file);\n inotify_add_watch(fd, config_dir.c_str(), IN_CREATE);\n inotify_add_watch(fd, config_file.c_str(), IN_MODIFY);\n}\n\nstatic int handle_config_updated(int fd, uint32_t mask, void *data)\n{\n LOGD(\"Reloading configuration file\");\n\n \/* read, but don't use *\/\n read(fd, buf, INOT_BUF_SIZE);\n reload_config(fd);\n\n wf::get_core().emit_signal(\"reload-config\", nullptr);\n\n return 0;\n}\n\nstatic void print_version()\n{\n std::cout << WAYFIRE_VERSION << std::endl;\n exit(0);\n}\n\nstatic void print_help()\n{\n std::cout << \"Wayfire \" << WAYFIRE_VERSION << std::endl;\n std::cout << \"Usage: wayfire [OPTION]...\\n\" << std::endl;\n std::cout << \" -c, --config specify config file to use\" << std::endl;\n std::cout << \" -h, --help print this help\" << std::endl;\n std::cout << \" -d, --debug enable debug logging\" << std::endl;\n std::cout <<\n \" -D, --damage-debug enable additional debug for damaged regions\" <<\n std::endl;\n std::cout << \" -R, --damage-rerender rerender damaged regions\" << std::endl;\n std::cout << \" -v, --version print version and exit\" << std::endl;\n exit(0);\n}\n\nstd::map<EGLint, EGLint> default_attribs = {\n {EGL_RED_SIZE, 1},\n {EGL_GREEN_SIZE, 1},\n {EGL_BLUE_SIZE, 1},\n {EGL_DEPTH_SIZE, 1},\n};\n\nstd::map<wlr_renderer*, wlr_egl*> egl_for_renderer;\n\n\/* Merge the default config and the config we need *\/\nstatic std::vector<EGLint> generate_config_attribs(EGLint *renderer_attribs)\n{\n std::vector<EGLint> attribs;\n\n \/* See what we have in the default config *\/\n for (auto i = renderer_attribs; i != NULL && *i != EGL_NONE; i++)\n {\n \/* We will override this value later *\/\n if (default_attribs.count(*i))\n {\n ++i;\n continue;\n }\n\n attribs.push_back(*i);\n i++;\n attribs.push_back(*i);\n }\n\n \/* Then pack all values we want *\/\n for (auto & p : default_attribs)\n {\n attribs.push_back(p.first);\n attribs.push_back(p.second);\n }\n\n attribs.push_back(EGL_NONE);\n\n return attribs;\n}\n\nwlr_renderer *add_egl_depth_renderer(wlr_egl *egl, EGLenum platform,\n void *remote, EGLint *_r_attr, EGLint visual)\n{\n bool r;\n auto attribs = generate_config_attribs(_r_attr);\n r = wlr_egl_init(egl, platform, remote, attribs.data(), visual);\n\n if (!r)\n {\n LOGE(\"Failed to initialize EGL\");\n\n return NULL;\n }\n\n auto renderer = wlr_gles2_renderer_create(egl);\n if (!renderer)\n {\n LOGE(\"Failed to create GLES2 renderer\");\n wlr_egl_finish(egl);\n\n return NULL;\n }\n\n egl_for_renderer[renderer] = egl;\n\n return renderer;\n}\n\nnamespace wf\n{\nnamespace _safe_list_detail\n{\nwl_event_loop *event_loop;\nvoid idle_cleanup_func(void *data)\n{\n auto priv = reinterpret_cast<std::function<void()>*>(data);\n (*priv)();\n}\n}\n}\n\nstatic bool drop_permissions(void)\n{\n if ((getuid() != geteuid()) || (getgid() != getegid()))\n {\n \/\/ Set the gid and uid in the correct order.\n if ((setgid(getgid()) != 0) || (setuid(getuid()) != 0))\n {\n LOGE(\"Unable to drop root, refusing to start\");\n\n return false;\n }\n }\n\n if ((setgid(0) != -1) || (setuid(0) != -1))\n {\n LOGE(\"Unable to drop root (we shouldn't be able to \"\n \"restore it after setuid), refusing to start\");\n\n return false;\n }\n\n return true;\n}\n\nstatic wf::log::color_mode_t detect_color_mode()\n{\n return isatty(STDOUT_FILENO) ?\n wf::log::LOG_COLOR_MODE_ON : wf::log::LOG_COLOR_MODE_OFF;\n}\n\nstatic void wlr_log_handler(wlr_log_importance level,\n const char *fmt, va_list args)\n{\n const int bufsize = 4 * 1024;\n char buffer[bufsize];\n vsnprintf(buffer, bufsize, fmt, args);\n\n wf::log::log_level_t wlevel;\n switch (level)\n {\n case WLR_ERROR:\n wlevel = wf::log::LOG_LEVEL_ERROR;\n break;\n\n case WLR_INFO:\n wlevel = wf::log::LOG_LEVEL_INFO;\n break;\n\n case WLR_DEBUG:\n wlevel = wf::log::LOG_LEVEL_DEBUG;\n break;\n\n default:\n return;\n }\n\n wf::log::log_plain(wlevel, buffer);\n}\n\n#ifndef ASAN_ENABLED\nstatic void signal_handler(int signal)\n{\n std::string error;\n switch (signal)\n {\n case SIGSEGV:\n error = \"Segmentation fault\";\n break;\n\n case SIGFPE:\n error = \"Floating-point exception\";\n break;\n\n case SIGABRT:\n error = \"Fatal error(SIGABRT)\";\n break;\n\n default:\n error = \"Unknown\";\n }\n\n LOGE(\"Fatal error: \", error);\n wf::print_trace(false);\n std::_Exit(-1);\n}\n\n#endif\n\nstatic std::optional<std::string> choose_socket(wl_display *display)\n{\n for (int i = 1; i <= 32; i++)\n {\n auto name = \"wayland-\" + std::to_string(i);\n if (wl_display_add_socket(display, name.c_str()) >= 0)\n {\n return name;\n }\n }\n\n return {};\n}\n\nint main(int argc, char *argv[])\n{\n config_dir = nonull(getenv(\"XDG_CONFIG_HOME\"));\n if (!config_dir.compare(\"nil\"))\n {\n config_dir = std::string(nonull(getenv(\"HOME\"))) + \"\/.config\";\n }\n\n config_file = config_dir + \"\/wayfire.ini\";\n\n wf::log::log_level_t log_level = wf::log::LOG_LEVEL_INFO;\n struct option opts[] = {\n {\n \"config\", required_argument, NULL, 'c'\n },\n {\"debug\", no_argument, NULL, 'd'},\n {\"damage-debug\", no_argument, NULL, 'D'},\n {\"damage-rerender\", no_argument, NULL, 'R'},\n {\"help\", no_argument, NULL, 'h'},\n {\"version\", no_argument, NULL, 'v'},\n {0, 0, NULL, 0}\n };\n\n int c, i;\n while ((c = getopt_long(argc, argv, \"c:dDhRv\", opts, &i)) != -1)\n {\n switch (c)\n {\n case 'c':\n config_file = optarg;\n break;\n\n case 'D':\n runtime_config.damage_debug = true;\n break;\n\n case 'R':\n runtime_config.no_damage_track = true;\n break;\n\n case 'h':\n print_help();\n break;\n\n case 'd':\n log_level = wf::log::LOG_LEVEL_DEBUG;\n break;\n\n case 'v':\n print_version();\n break;\n\n default:\n std::cerr << \"Unrecognized command line argument \" << optarg << \"\\n\" <<\n std::endl;\n }\n }\n\n auto wlr_log_level =\n (log_level == wf::log::LOG_LEVEL_DEBUG ? WLR_DEBUG : WLR_ERROR);\n wlr_log_init(wlr_log_level, wlr_log_handler);\n wf::log::initialize_logging(std::cout, log_level, detect_color_mode());\n\n#ifndef ASAN_ENABLED\n \/* In case of crash, print the stacktrace for debugging.\n * However, if ASAN is enabled, we'll get better stacktrace from there. *\/\n signal(SIGSEGV, signal_handler);\n signal(SIGFPE, signal_handler);\n signal(SIGABRT, signal_handler);\n#endif\n\n LOGI(\"Starting wayfire version \", WAYFIRE_VERSION);\n \/* First create display and initialize safe-list's event loop, so that\n * wf objects (which depend on safe-list) can work *\/\n auto display = wl_display_create();\n wf::_safe_list_detail::event_loop = wl_display_get_event_loop(display);\n\n auto& core = wf::get_core_impl();\n\n \/** TODO: move this to core_impl constructor *\/\n core.display = display;\n core.ev_loop = wl_display_get_event_loop(core.display);\n core.backend = wlr_backend_autocreate(core.display, add_egl_depth_renderer);\n core.renderer = wlr_backend_get_renderer(core.backend);\n core.egl = egl_for_renderer[core.renderer];\n assert(core.egl);\n\n if (!drop_permissions())\n {\n wl_display_destroy_clients(core.display);\n wl_display_destroy(core.display);\n\n return EXIT_FAILURE;\n }\n\n std::vector<std::string> xmldirs;\n if (char *plugin_xml_path = getenv(\"WAYFIRE_PLUGIN_XML_PATH\"))\n {\n std::stringstream ss(plugin_xml_path);\n std::string entry;\n while (std::getline(ss, entry, ':'))\n {\n xmldirs.push_back(entry);\n }\n }\n\n xmldirs.push_back(PLUGIN_XML_DIR);\n\n LOGI(\"using config file: \", config_file.c_str());\n core.config = wf::config::build_configuration(\n xmldirs, SYSCONFDIR \"\/wayfire\/defaults.ini\", config_file);\n\n int inotify_fd = inotify_init1(IN_CLOEXEC);\n reload_config(inotify_fd);\n\n wl_event_loop_add_fd(core.ev_loop, inotify_fd, WL_EVENT_READABLE,\n handle_config_updated, NULL);\n core.init();\n\n auto socket = choose_socket(core.display);\n if (!socket)\n {\n LOGE(\"Failed to create wayland socket, exiting.\");\n\n return -1;\n }\n\n core.wayland_display = socket.value();\n LOGI(\"Using socket name \", core.wayland_display);\n if (!wlr_backend_start(core.backend))\n {\n LOGE(\"Failed to initialize backend, exiting\");\n wlr_backend_destroy(core.backend);\n wl_display_destroy(core.display);\n\n return -1;\n }\n\n setenv(\"WAYLAND_DISPLAY\", core.wayland_display.c_str(), 1);\n wl_display_run(core.display);\n\n \/* Teardown *\/\n wl_display_destroy_clients(core.display);\n wl_display_destroy(core.display);\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QApplication>\n#include <QDir>\n#include <QDesktopServices>\n#include <QSettings>\n#include <QDate>\n#include <QIcon>\n#include <QPointer>\n\n#include \"window.h\"\n#include \"tracker.h\"\n\nQPointer<Window> window;\n\nvoid redirectLogMessages(QtMsgType type, const char *msg)\n{\n if(window) {\n window->addLogEntry(type, msg);\n }\n}\n\nint main(int argc, char **argv)\n{\n qInstallMsgHandler(redirectLogMessages);\n\n \/\/ Basic setup\n QApplication app(argc, argv);\n QIcon icon = QIcon(\":\/icons\/paw.svg\");\n app.setApplicationName(APP_NAME); \/\/ for proper DataLocation handling\n app.setOrganizationName(\"spidy.ch\");\n app.setOrganizationDomain(\"spidy.ch\");\n app.setWindowIcon(icon);\n\n \/\/ Logging\n \/\/ Non-generic DataLocation includes the organization name, which we don't want\n QString dataLocation = QDesktopServices::storageLocation(QDesktopServices::DataLocation) + QDir::separator() + app.applicationName();\n if(!QFile::exists(dataLocation)) {\n QDir dir;\n dir.mkpath(dataLocation);\n }\n string logFilePath = (dataLocation + QDir::separator() + app.applicationName() + \".log\").toStdString();\n Logger::Instance()->SetLogPath(logFilePath);\n\n \/\/ Start\n LOG(\"--> Launched On %s\", QDate::currentDate().toString(Qt::ISODate).toStdString().c_str());\n\n \/\/ Initalize Windows n stuff\n window = new Window();\n\n \/\/ Main Loop\n int exitCode = app.exec();\n\n \/\/ Tear down\n LOG(\"<-- Shutdown\");\n\n delete window;\n\n return exitCode;\n}\n<commit_msg>fix log path<commit_after>#include <QApplication>\n#include <QDir>\n#include <QDesktopServices>\n#include <QSettings>\n#include <QDate>\n#include <QIcon>\n#include <QPointer>\n\n#include \"window.h\"\n#include \"tracker.h\"\n\nQPointer<Window> window;\n\nvoid redirectLogMessages(QtMsgType type, const char *msg)\n{\n if(window) {\n window->addLogEntry(type, msg);\n }\n}\n\nint main(int argc, char **argv)\n{\n qInstallMsgHandler(redirectLogMessages);\n\n \/\/ Basic setup\n QApplication app(argc, argv);\n QIcon icon = QIcon(\":\/icons\/paw.svg\");\n app.setApplicationName(APP_NAME); \/\/ for proper DataLocation handling\n app.setOrganizationName(\"spidy.ch\");\n app.setOrganizationDomain(\"spidy.ch\");\n app.setWindowIcon(icon);\n\n \/\/ Logging\n QString dataLocation = QDesktopServices::storageLocation(QDesktopServices::DataLocation);\n if(!QFile::exists(dataLocation)) {\n QDir dir;\n dir.mkpath(dataLocation);\n }\n string logFilePath = (dataLocation + QDir::separator() + app.applicationName() + \".log\").toStdString();\n Logger::Instance()->SetLogPath(logFilePath);\n\n \/\/ Start\n LOG(\"--> Launched On %s\", QDate::currentDate().toString(Qt::ISODate).toStdString().c_str());\n\n \/\/ Initalize Windows n stuff\n window = new Window();\n\n \/\/ Main Loop\n int exitCode = app.exec();\n\n \/\/ Tear down\n LOG(\"<-- Shutdown\");\n\n delete window;\n\n return exitCode;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tOptimal Read Normalization Algorithm:\n\tDeveloped by : Dilip A Durai and Marcel H Schulz\n*\/\n\n#include <gatb\/gatb_core.hpp>\n#include <iostream>\n#include <string.h>\n#include <math.h>\n#include <algorithm>\n\ntypedef Kmer<>::Type bloom;\nstatic const char* STR_BASE = \"-base\";\nstatic const char* STR_INPUT = \"-input\";\nstatic const char* STR_OUTPUT = \"-output\";\nstatic const char* STR_KMER = \"-kmer\";\nstatic const char* STR_PAIR1 = \"-pair1\";\nstatic const char* STR_PAIR2 = \"-pair2\";\n\nint readacceptance(Graph graph, Kmer<>::ModelCanonical::Iterator itKmer, Kmer<>::ModelCanonical model, unsigned short *counter, double base){\n\tint acceptance=0;\n\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t{\n\t\tstd::string s = model.toString (itKmer->value());\n\t\tconst char* sq = s.c_str();\n\t\tNode node = graph.buildNode(sq);\n\t\tdouble threshold=0;\n\t\t\/\/Checking whether the node exists.\n\t\tauto index = graph.nodeMPHFIndex(node);\n\t\tauto abund = graph.queryAbundance(node);\n\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\tif(threshold>abund)\n\t\t{\n\t\t\tthreshold=abund;\n\t\t}\n\t\tif(threshold<1)\n\t\t{\n\t\t\tthreshold=1;\n\t\t}\n\t\tif(counter[index] < threshold)\n\t\t{\n\t\t\tacceptance=acceptance+1;\n\t\t\tbreak;\t\t\t\n\t\t\t\/\/__sync_fetch_and_add (&counter[index], 1);\n\t \t}\n\t}\n\treturn acceptance;\n}\n\nvoid singleend(const char* filename, const char* out_file, double base, unsigned short kmer, int nbCores)\n{\n\tint count=0;\n\t\/\/const char* error = getError(filename , pair1, pair2);\t\t\n\t\t\n\tDispatcher dispatcher(nbCores) ;\n\tISynchronizer* synchro = System::thread().newSynchronizer();\t\/\/Locking a section\n\n\t\/\/Variables required for GATB\n\tIBank* bank = Bank::open (filename);\n\tProgressIterator<Sequence> itSeq (*bank);\n\tIBank* outBank = new BankFasta (out_file);\n\t\n\t\/\/Creating a graph and an iterator. from the parameters. The threshold value is kept as the minimum abundance parameter of the graph. kmer size is the actual kmer+1\n\tGraph graph = Graph::create (Bank::open(filename), \"-kmer-size %d -abundance-min 1\", kmer);\n\tGraphIterator<Node> it = graph.iterator();\n\n\tlong node_size= it.size();\n\tunsigned short *counter = new unsigned short[node_size];\n\n\t\/\/Initializing the counter for each node in the de Bruijn graph\n\tfor(int i=0;i<node_size;i++)\n\t{\n\t counter[i]=0;\n\t}\n\n\t\/\/Iterating over sequences\n\tdispatcher.iterate (itSeq, [&] (Sequence& seq)\n\t{\n\t\tint length = seq.getDataSize();\n\t\tint flag=1;\n\t\tint gb = 1;\n\t\tint acceptance=0;\n\n\t\tKmer<>::ModelCanonical model (kmer);\n\t\tKmer<>::ModelCanonical::Iterator itKmer (model);\n\t\titKmer.setData (seq.getData());\n\t\tchar* data = seq.getDataBuffer();\n\t\n\t\t\/\/checking the thresholding\n\t\tif(flag==1){\n\t\t\tacceptance=readacceptance(graph, itKmer, model, counter, base);\n\t\t}\n\t\tif(acceptance > 0)\n\t\t{\n\t\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t\t\t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str(); \n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node))\n\t \t\t\t{\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\t__sync_fetch_and_add (&counter[index], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tsynchro->lock();\n\t\t\toutBank->insert(seq);\n\t\t\tcount++;\n\t\t\tsynchro->unlock();\n\t\t}\n\n\t});\n\tstd::cout << \"Kept \" << count << \" reads\" << std::endl;\n\n\t\/\/Free the memory\n\tstd::string filename1 = string(filename).substr(string(filename).find_last_of(\"\/\\\\\") + 1);\n\tsize_t lindex = filename1.find_last_of(\".\");\n\tfilename1 = (filename1.substr(0,lindex)) + string(\".h5\");\n\tremove(filename1.c_str());\n\t\n\tdelete [] counter;\n\tbank->flush();\n\toutBank->flush();\t\n}\n\nvoid pairedend(const char* read1, const char* read2, const char* out_file, double base, unsigned short kmer )\n{\n\tIBank* bank1 = Bank::open (read1); \n\tLOCAL (bank1);\n IBank* bank2 = Bank::open (read2); \n\tLOCAL (bank2);\n\t\n\tIBank* outBank = new BankFasta (out_file);\n\n\tGraph graph = Graph::create (\"-in %s,%s -kmer-size %d -abundance-min 1\", read1, read2, kmer);\n\tGraphIterator<Node> NodeIterator = graph.iterator();\t\n\tlong node_size= NodeIterator.size();\n\tunsigned short *counter = new unsigned short[node_size];\n\t\n\tfor(int i=0;i<node_size;i++)\n {\n counter[i]=0;\n }\n\n\tint cnt=0;\n\tint count=0;\n\tint num_sequence=0;\t\n\tint *pos;\t\n\tint size;\n\tint index;\n\tunsigned short length;\n\tint tmp=0;\n\t \n\t\/\/ We iterate the two banks. Note how we provide two iterators from the two banks.\n PairedIterator<Sequence> itPair (bank1->iterator(), bank2->iterator());\n for(itPair.first(); !itPair.isDone(); itPair.next())\n {\n \tnum_sequence++;\n }\n \/\/int inisize=2;\n\tstd::vector<int> tempBank;\n\t\n\tKmer<>::ModelCanonical model (kmer);\n\tKmer<>::ModelCanonical::Iterator itKmer (model);\n\tKmer<>::ModelCanonical::Iterator itKmer1 (model);\n \n\t\/\/Iteration 1\t\n\t \n\tfor (itPair.first(); !itPair.isDone(); itPair.next())\n {\n Sequence& s1 = itPair.item().first;\n Sequence& s2 = itPair.item().second;\n\t \n\t int acceptance1=0;\n\t int acceptance2=0;\n\n\t itKmer.setData (s1.getData());\n\t itKmer1.setData (s2.getData());\n\t \t \n\t \/\/checking the thresholding\n\t acceptance1 = readacceptance(graph, itKmer, model, counter, base);\n\t acceptance2 = readacceptance(graph, itKmer1, model, counter, base);\n\t if(acceptance1 > 0 && acceptance2>0)\n\t {\n\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t \t{\n\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\tconst char* sq = s.c_str();\n\t\t\tNode node = graph.buildNode(sq);\n\t\t\tdouble threshold=0;\n\t\t\t\/\/Checking whether the node exists.\n\t\t\tif(graph.contains(node))\n\t\t\t{\n\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\tif(threshold>abund)\n\t\t\t\t{\n\t\t\t\t\tthreshold=abund;\n\t\t\t\t}\n\t\t\t\tif(threshold<1)\n\t\t\t\t{\n\t\t\t\t\tthreshold=1;\n\t\t\t\t}\n\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t{\n\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (itKmer1.first(); !itKmer1.isDone(); itKmer1.next())\n\t \t{\n\t\t\tstd::string s = model.toString (itKmer1->value());\n\t\t\tconst char* sq = s.c_str();\n\t\t\tNode node = graph.buildNode(sq);\n\t\t\tdouble threshold=0;\n\t\t\t\/\/Checking whether the node exists.\n\t\t\tif(graph.contains(node))\n\t\t\t{\n\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\tif(threshold>abund)\n\t\t\t\t{\n\t\t\t\t\tthreshold=abund;\n\t\t\t\t}\n\t\t\t\tif(threshold<1)\n\t\t\t\t{\n\t\t\t\t\tthreshold=1;\n\t\t\t\t}\n\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t{\n\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t}\n\t\t\t}\n\t \t}\n\t \toutBank->insert(s1);\n\t\toutBank->insert(s2);\n\t\tcount++;\n\t }\n\t else if(acceptance1>0 || acceptance2>0){\n\t \ttempBank.push_back(tmp);\n\t }\n\t else{\n\t }\n\t tmp++;\n }\n \n\tint coun=0;\n\tint tmp_index=0;\n\tstd::cout << \"Second Iteration\" << std::endl;\n\t\n\tfor (itPair.first(); !itPair.isDone() && tmp_index<tempBank.size(); itPair.next())\n\t{\n \tif(coun==tempBank[tmp_index])\n \t{\n\t\t Sequence& s1 = itPair.item().first;\n\t\t Sequence& s2 = itPair.item().second;\n\t\t \n\t\t int acceptance1=0;\n\t\t int acceptance2=0;\n\t\t int acceptance=0;\n\n\t\t itKmer.setData (s1.getData());\n\t\t itKmer1.setData (s2.getData());\n\t\t \t \n\t\t \/\/checking the thresholding\n\t\t acceptance1 = readacceptance(graph, itKmer, model, counter, base);\n\t\t acceptance2 = readacceptance(graph, itKmer1, model, counter, base);\n\t\t \t \n\t\t if(acceptance1 > 0 || acceptance2 > 0)\n\t\t {\n\t\t\tfor (itKmer1.first(); !itKmer1.isDone(); itKmer1.next())\n\t\t \t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str();\n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\tdouble threshold=0;\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node)){\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\t\tif(threshold>abund){\n\t\t\t\t\t\tthreshold=abund;\n\t\t\t\t\t}\n\t\t\t\t\tif(threshold<1){\n\t\t\t\t\t\tthreshold=1;\n\t\t\t\t\t}\n\t\t\t\t\tif(counter[index] < threshold){\n\t\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t\t \t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str();\n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\tdouble threshold=0;\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node))\n\t\t\t\t{\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\t\tif(threshold>abund)\n\t\t\t\t\t{\n\t\t\t\t\t\tthreshold=abund;\n\t\t\t\t\t}\n\t\t\t\t\tif(threshold<1)\n\t\t\t\t\t{\n\t\t\t\t\t\tthreshold=1;\n\t\t\t\t\t}\n\t\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t\t{\n\t\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t \t}\n\t\t\toutBank->insert(s1);\n\t\t\toutBank->insert(s2);\n\t\t\tcount++;\n\t\t }\n\t\t tmp_index++;\n\t\t}\n\t\tcoun++;\n }\n\tstd::cout << \"kept \" << count << \" reads\" << std::endl;\n\tbank1->flush();\n\tbank2->flush();\n\tdelete [] counter;\n\toutBank->flush();\n}\n\n\nclass ORNA : public Tool\n{\npublic:\n\tORNA(): Tool(\"ORNA\")\n\t{\n\t\tgetParser()->push_front (new OptionOneParam (STR_KMER, \"kmer required\", false, \"21\"));\n\t getParser()->push_front (new OptionOneParam (STR_INPUT, \"Input File\", false, \"ORNAERROR\"));\n\t getParser()->push_front (new OptionOneParam (STR_OUTPUT, \"Output File\", false, \"Normalized.fa\"));\n\t\tgetParser()->push_front (new OptionOneParam (STR_BASE, \"Base for the logarithmic function\", false, \"1.7\"));\n\t\tgetParser()->push_front (new OptionOneParam (STR_PAIR1, \"First read of the pair\", false, \"ORNAERROR\" ));\n\t\tgetParser()->push_front (new OptionOneParam (STR_PAIR2, \"Second read of the pair\", false, \"ORNAERROR\" ));\n\t}\n\tvoid execute()\n\t{\n\t\tconst char* filename = (getInput()->get(STR_INPUT))->getString();\n\t\tconst char* read1= (getInput()->get(STR_PAIR1))->getString(); \n\t\tconst char* read2= (getInput()->get(STR_PAIR2))->getString();\n\t\tdouble base=getInput()->getDouble(STR_BASE);\n\t\tint user_kmer = getInput()->getInt(STR_KMER);\n\t\tconst char* out_file= (getInput()->get(STR_OUTPUT))->getString();\n\t\tint nbCores = getInput()->getInt(STR_NB_CORES);\n\t\tunsigned short pairflag = 0; \n\t\tunsigned short kmer = user_kmer + 1; \n\t\tunsigned short cores = sysconf(_SC_NPROCESSORS_ONLN); \n\t\tif(nbCores==cores){\n\t\t\tnbCores=1;\t\t\n\t\t} \n\t\tif(std::strcmp(filename, \"ORNAERROR\") == 0)\n\t\t{\n\t\t\tif((std::strcmp(read1, \"ORNAERROR\") == 0) && (std::strcmp(read2, \"ORNAERROR\") == 0))\n\t\t\t{\n\t\t\t\tstd::cout << \"Input File(s) missing. Please refer to the help\" << std::endl;\n\t\t\t}\n\t\t\tif (((std::strcmp(read1, \"ORNAERROR\") != 0) && (std::strcmp(read2, \"ORNAERROR\") == 0)) || ((std::strcmp(read1, \"ORNAERROR\") == 0) && (std::strcmp(read2, \"ORNAERROR\") != 0)))\n\t\t\t{\n\t\t\t\tstd::cout << \"One of the pair files is missing. Please refer to the help\" << std::endl;\t\n\t\t\t}\n\t\t\tif((std::strcmp(read1, \"ORNAERROR\") != 0) && (std::strcmp(read2, \"ORNAERROR\") != 0))\n\t\t\t{\n\t\t\t\tpairflag = 1; \n\t\t\t}\t\t\t\t\n\t\t}\n\t\tif(pairflag==0)\n\t\t{\n\t\t\tstd::cout << \"Running ORNA in single end mode\" << std::endl;\n\t\t\tsingleend(filename, out_file, base, kmer, nbCores);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \"Running ORNA in paired end mode\" << std::endl;\n\t\t\tpairedend(read1, read2, out_file, base, kmer);\n\t\t}\t\n\t}\n};\n\nint main (int argc, char* argv[])\n{\n\ttry{\n\t\tORNA().run(argc,argv);\n\t\treturn EXIT_SUCCESS;\t\n\t}\n\tcatch(Exception& e){\n\t\tstd::cout << \"EXCEPTION: \" << e.getMessage() << std::endl;\n \treturn EXIT_FAILURE;\n\t}\n \t\n}\n\n\n<commit_msg>Update main.cpp<commit_after>\/*\n\tOptimal Read Normalization Algorithm:\n\tDeveloped by : Dilip A Durai and Marcel H Schulz\n*\/\n\n#include <gatb\/gatb_core.hpp>\n#include <iostream>\n#include <string.h>\n#include <math.h>\n#include <algorithm>\n\ntypedef Kmer<>::Type bloom;\nstatic const char* STR_BASE = \"-base\";\nstatic const char* STR_INPUT = \"-input\";\nstatic const char* STR_OUTPUT = \"-output\";\nstatic const char* STR_KMER = \"-kmer\";\nstatic const char* STR_PAIR1 = \"-pair1\";\nstatic const char* STR_PAIR2 = \"-pair2\";\n\nint readacceptance(Graph graph, Kmer<>::ModelCanonical::Iterator itKmer, Kmer<>::ModelCanonical model, unsigned short *counter, double base){\n\tint acceptance=0;\n\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t{\n\t\tstd::string s = model.toString (itKmer->value());\n\t\tconst char* sq = s.c_str();\n\t\tNode node = graph.buildNode(sq);\n\t\tdouble threshold=0;\n\t\t\/\/Checking whether the node exists.\n\t\tauto index = graph.nodeMPHFIndex(node);\n\t\tauto abund = graph.queryAbundance(node);\n\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\tif(threshold>abund)\n\t\t{\n\t\t\tthreshold=abund;\n\t\t}\n\t\tif(threshold<1)\n\t\t{\n\t\t\tthreshold=1;\n\t\t}\n\t\tif(counter[index] < threshold)\n\t\t{\n\t\t\tacceptance=acceptance+1;\n\t\t\tbreak;\t\t\t\n\t\t\t\/\/__sync_fetch_and_add (&counter[index], 1);\n\t \t}\n\t}\n\treturn acceptance;\n}\n\nvoid singleend(const char* filename, const char* out_file, double base, unsigned short kmer, int nbCores)\n{\n\tint count=0;\n\t\/\/const char* error = getError(filename , pair1, pair2);\t\t\n\t\t\n\tDispatcher dispatcher(nbCores) ;\n\tISynchronizer* synchro = System::thread().newSynchronizer();\t\/\/Locking a section\n\n\t\/\/Variables required for GATB\n\tIBank* bank = Bank::open (filename);\n\tProgressIterator<Sequence> itSeq (*bank);\n\tIBank* outBank = new BankFasta (out_file);\n\t\n\t\/\/Creating a graph and an iterator. from the parameters. The threshold value is kept as the minimum abundance parameter of the graph. kmer size is the actual kmer+1\n\tGraph graph = Graph::create (Bank::open(filename), \"-kmer-size %d -abundance-min 1\", kmer);\n\tGraphIterator<Node> it = graph.iterator();\n\n\tlong node_size= it.size();\n\tunsigned short *counter = new unsigned short[node_size];\n\n\t\/\/Initializing the counter for each node in the de Bruijn graph\n\tfor(int i=0;i<node_size;i++)\n\t{\n\t counter[i]=0;\n\t}\n\n\t\/\/Iterating over sequences\n\tdispatcher.iterate (itSeq, [&] (Sequence& seq)\n\t{\n\t\tint length = seq.getDataSize();\n\t\tint flag=1;\n\t\tint gb = 1;\n\t\tint acceptance=0;\n\n\t\tKmer<>::ModelCanonical model (kmer);\n\t\tKmer<>::ModelCanonical::Iterator itKmer (model);\n\t\titKmer.setData (seq.getData());\n\t\tchar* data = seq.getDataBuffer();\n\t\n\t\t\/\/checking the thresholding\n\t\tif(flag==1){\n\t\t\tacceptance=readacceptance(graph, itKmer, model, counter, base);\n\t\t}\n\t\tif(acceptance > 0)\n\t\t{\n\t\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t\t\t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str(); \n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node))\n\t \t\t\t{\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\t__sync_fetch_and_add (&counter[index], 1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tsynchro->lock();\n\t\t\toutBank->insert(seq);\n\t\t\tcount++;\n\t\t\tsynchro->unlock();\n\t\t}\n\n\t});\n\tstd::cout << \"Kept \" << count << \" reads\" << std::endl;\n\n\t\/\/Free the memory\n\tstd::string filename1 = string(filename).substr(string(filename).find_last_of(\"\/\\\\\") + 1);\n\tsize_t lindex = filename1.find_last_of(\".\");\n\tfilename1 = (filename1.substr(0,lindex)) + string(\".h5\");\n\tremove(filename1.c_str());\n\t\n\tdelete [] counter;\n\tbank->flush();\n\toutBank->flush();\t\n}\n\nvoid pairedend(const char* read1, const char* read2, const char* out_file, double base, unsigned short kmer )\n{\n\tIBank* bank1 = Bank::open (read1); \n\tLOCAL (bank1);\n IBank* bank2 = Bank::open (read2); \n\tLOCAL (bank2);\n\t\n\tIBank* outBank = new BankFasta (out_file);\n\n\tGraph graph = Graph::create (\"-in %s,%s -kmer-size %d -abundance-min 1\", read1, read2, kmer);\n\tGraphIterator<Node> NodeIterator = graph.iterator();\t\n\tlong node_size= NodeIterator.size();\n\tunsigned short *counter = new unsigned short[node_size];\n\t\n\tfor(int i=0;i<node_size;i++)\n {\n counter[i]=0;\n }\n\n\tint cnt=0;\n\tint count=0;\n\tint num_sequence=0;\t\n\tint *pos;\t\n\tint size;\n\tint index;\n\tunsigned short length;\n\tint tmp=0;\n\t\t\n PairedIterator<Sequence> itPair (bank1->iterator(), bank2->iterator());\n for(itPair.first(); !itPair.isDone(); itPair.next())\n {\n \tnum_sequence++;\n }\n std::vector<int> tempBank;\n\t\n\tKmer<>::ModelCanonical model (kmer);\n\tKmer<>::ModelCanonical::Iterator itKmer (model);\n\tKmer<>::ModelCanonical::Iterator itKmer1 (model);\n \n\t\/\/Iteration 1\t\n\t \n\tfor (itPair.first(); !itPair.isDone(); itPair.next())\n {\n Sequence& s1 = itPair.item().first;\n Sequence& s2 = itPair.item().second;\n\t \n\t int acceptance1=0;\n\t int acceptance2=0;\n\n\t itKmer.setData (s1.getData());\n\t itKmer1.setData (s2.getData());\n\t \t \n\t \/\/checking the threshold\n\t acceptance1 = readacceptance(graph, itKmer, model, counter, base);\n\t acceptance2 = readacceptance(graph, itKmer1, model, counter, base);\n\t if(acceptance1 > 0 && acceptance2>0)\n\t {\n\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t \t{\n\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\tconst char* sq = s.c_str();\n\t\t\tNode node = graph.buildNode(sq);\n\t\t\tdouble threshold=0;\n\t\t\t\/\/Checking whether the node exists.\n\t\t\tif(graph.contains(node))\n\t\t\t{\n\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\tif(threshold>abund)\n\t\t\t\t{\n\t\t\t\t\tthreshold=abund;\n\t\t\t\t}\n\t\t\t\tif(threshold<1)\n\t\t\t\t{\n\t\t\t\t\tthreshold=1;\n\t\t\t\t}\n\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t{\n\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (itKmer1.first(); !itKmer1.isDone(); itKmer1.next())\n\t \t{\n\t\t\tstd::string s = model.toString (itKmer1->value());\n\t\t\tconst char* sq = s.c_str();\n\t\t\tNode node = graph.buildNode(sq);\n\t\t\tdouble threshold=0;\n\t\t\t\/\/Checking whether the node exists.\n\t\t\tif(graph.contains(node))\n\t\t\t{\n\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\tif(threshold>abund)\n\t\t\t\t{\n\t\t\t\t\tthreshold=abund;\n\t\t\t\t}\n\t\t\t\tif(threshold<1)\n\t\t\t\t{\n\t\t\t\t\tthreshold=1;\n\t\t\t\t}\n\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t{\n\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t}\n\t\t\t}\n\t \t}\n\t \toutBank->insert(s1);\n\t\toutBank->insert(s2);\n\t\tcount++;\n\t }\n\t else if(acceptance1>0 || acceptance2>0){\n\t \ttempBank.push_back(tmp);\n\t }\n\t else{\n\t }\n\t tmp++;\n }\n \n\tint coun=0;\n\tint tmp_index=0;\n\tstd::cout << \"Second Iteration\" << std::endl;\n\t\n\tfor (itPair.first(); !itPair.isDone() && tmp_index<tempBank.size(); itPair.next())\n\t{\n \tif(coun==tempBank[tmp_index])\n \t{\n\t\t Sequence& s1 = itPair.item().first;\n\t\t Sequence& s2 = itPair.item().second;\n\t\t \n\t\t int acceptance1=0;\n\t\t int acceptance2=0;\n\t\t int acceptance=0;\n\n\t\t itKmer.setData (s1.getData());\n\t\t itKmer1.setData (s2.getData());\n\t\t \t \n\t\t \/\/checking the thresholding\n\t\t acceptance1 = readacceptance(graph, itKmer, model, counter, base);\n\t\t acceptance2 = readacceptance(graph, itKmer1, model, counter, base);\n\t\t \t \n\t\t if(acceptance1 > 0 || acceptance2 > 0)\n\t\t {\n\t\t\tfor (itKmer1.first(); !itKmer1.isDone(); itKmer1.next())\n\t\t \t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str();\n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\tdouble threshold=0;\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node)){\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\t\tif(threshold>abund){\n\t\t\t\t\t\tthreshold=abund;\n\t\t\t\t\t}\n\t\t\t\t\tif(threshold<1){\n\t\t\t\t\t\tthreshold=1;\n\t\t\t\t\t}\n\t\t\t\t\tif(counter[index] < threshold){\n\t\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (itKmer.first(); !itKmer.isDone(); itKmer.next())\n\t\t \t{\n\t\t\t\tstd::string s = model.toString (itKmer->value());\n\t\t\t\tconst char* sq = s.c_str();\n\t\t\t\tNode node = graph.buildNode(sq);\n\t\t\t\tdouble threshold=0;\n\t\t\t\t\/\/Checking whether the node exists.\n\t\t\t\tif(graph.contains(node))\n\t\t\t\t{\n\t\t\t\t\tauto index = graph.nodeMPHFIndex(node);\n\t\t\t\t\tauto abund = graph.queryAbundance(node);\n\t\t\t\t\tthreshold = ceil((log(abund)\/log(base)));\n\t\t\t\t\tif(threshold>abund)\n\t\t\t\t\t{\n\t\t\t\t\t\tthreshold=abund;\n\t\t\t\t\t}\n\t\t\t\t\tif(threshold<1)\n\t\t\t\t\t{\n\t\t\t\t\t\tthreshold=1;\n\t\t\t\t\t}\n\t\t\t\t\tif(counter[index] < threshold)\n\t\t\t\t\t{\n\t\t\t\t\t\tcounter[index]=counter[index]+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t \t}\n\t\t\toutBank->insert(s1);\n\t\t\toutBank->insert(s2);\n\t\t\tcount++;\n\t\t }\n\t\t tmp_index++;\n\t\t}\n\t\tcoun++;\n }\n\tstd::cout << \"kept \" << count << \" reads\" << std::endl;\n\tbank1->flush();\n\tbank2->flush();\n\tdelete [] counter;\n\toutBank->flush();\n}\n\n\nclass ORNA : public Tool\n{\npublic:\n\tORNA(): Tool(\"ORNA\")\n\t{\n\t\tgetParser()->push_front (new OptionOneParam (STR_KMER, \"kmer required\", false, \"21\"));\n\t getParser()->push_front (new OptionOneParam (STR_INPUT, \"Input File\", false, \"ORNAERROR\"));\n\t getParser()->push_front (new OptionOneParam (STR_OUTPUT, \"Output File\", false, \"Normalized.fa\"));\n\t\tgetParser()->push_front (new OptionOneParam (STR_BASE, \"Base for the logarithmic function\", false, \"1.7\"));\n\t\tgetParser()->push_front (new OptionOneParam (STR_PAIR1, \"First read of the pair\", false, \"ORNAERROR\" ));\n\t\tgetParser()->push_front (new OptionOneParam (STR_PAIR2, \"Second read of the pair\", false, \"ORNAERROR\" ));\n\t}\n\tvoid execute()\n\t{\n\t\tconst char* filename = (getInput()->get(STR_INPUT))->getString();\n\t\tconst char* read1= (getInput()->get(STR_PAIR1))->getString(); \n\t\tconst char* read2= (getInput()->get(STR_PAIR2))->getString();\n\t\tdouble base=getInput()->getDouble(STR_BASE);\n\t\tint user_kmer = getInput()->getInt(STR_KMER);\n\t\tconst char* out_file= (getInput()->get(STR_OUTPUT))->getString();\n\t\tint nbCores = getInput()->getInt(STR_NB_CORES);\n\t\tunsigned short pairflag = 0; \n\t\tunsigned short kmer = user_kmer + 1; \n\t\tunsigned short cores = sysconf(_SC_NPROCESSORS_ONLN); \n\t\tif(nbCores==cores){\n\t\t\tnbCores=1;\t\t\n\t\t} \n\t\tif(std::strcmp(filename, \"ORNAERROR\") == 0)\n\t\t{\n\t\t\tif((std::strcmp(read1, \"ORNAERROR\") == 0) && (std::strcmp(read2, \"ORNAERROR\") == 0))\n\t\t\t{\n\t\t\t\tstd::cout << \"Input File(s) missing. Please refer to the help\" << std::endl;\n\t\t\t}\n\t\t\tif (((std::strcmp(read1, \"ORNAERROR\") != 0) && (std::strcmp(read2, \"ORNAERROR\") == 0)) || ((std::strcmp(read1, \"ORNAERROR\") == 0) && (std::strcmp(read2, \"ORNAERROR\") != 0)))\n\t\t\t{\n\t\t\t\tstd::cout << \"One of the pair files is missing. Please refer to the help\" << std::endl;\t\n\t\t\t}\n\t\t\tif((std::strcmp(read1, \"ORNAERROR\") != 0) && (std::strcmp(read2, \"ORNAERROR\") != 0))\n\t\t\t{\n\t\t\t\tpairflag = 1; \n\t\t\t}\t\t\t\t\n\t\t}\n\t\tif(pairflag==0)\n\t\t{\n\t\t\tstd::cout << \"Running ORNA in single end mode\" << std::endl;\n\t\t\tsingleend(filename, out_file, base, kmer, nbCores);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << \"Running ORNA in paired end mode\" << std::endl;\n\t\t\tpairedend(read1, read2, out_file, base, kmer);\n\t\t}\t\n\t}\n};\n\nint main (int argc, char* argv[])\n{\n\ttry{\n\t\tORNA().run(argc,argv);\n\t\treturn EXIT_SUCCESS;\t\n\t}\n\tcatch(Exception& e){\n\t\tstd::cout << \"EXCEPTION: \" << e.getMessage() << std::endl;\n \treturn EXIT_FAILURE;\n\t}\n \t\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <boost\/tokenizer.hpp>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\nusing namespace boost;\n\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\n\n\/\/function for iterating through parsed string\nvoid commandexec(vector<string> x)\n{\n\t\/\/position of iterator\n\tint pos = 0;\n\twhile (pos < x.size())\n\t{\n\t\t\/\/if 'ls' is found\n\t\tif (x.at(pos) == \"ls\")\n\t\t{\n\t\t\tint pid = fork();\n\t\t\tif (pid == -1) \/\/if pid is -s, an error has occurred.\n\t\t\t{\n\t\t\t\tperror(\"fork\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if (pid == 0) \/\/if pid is 0, you are in child process. execvp here.\n\t\t\t{\n\/\/\t\t\t\texecvp(x.at(pos), x.at(pos+1)); \n\t\t\t}\n\t\t\telse\n\t\t\t\twait(0);\n\t\t}\n\t}\n}\n\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell)\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\n\t\t\/\/TODO: Parse raw input string for commands and connectors\n\t\tchar_separator<char> delim(\" \", \"|\");\n\t\ttokenizer< char_separator<char> > mytok(rawinput);\n\n\t\t\n\t\t\/\/tokenizer test: storing tokenized objects in a string\n\t\tstring parsedinput;\n\t\tfor(auto it = mytok.begin(); it != mytok.end(); ++it)\n\t\t{\n\t\t\tparsedinput += *it;\n\t\t}\n\t\tparsedinput += \";\";\n\t\t\/\/token test output loop\n\t\tcout << parsedinput << endl;\n\t\t\n\t\t\/\/initial scan for syntax errors\n\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\/\/bool variable to tell when the inner for loop is done\n\t\tbool seploopdone = false;\n\n\t\t\/\/iterate through string and separate into commands and connectors\n\t\twhile (synerror != true && seploopdone == false)\n\t\t{\n\t\t\tstring parsecmd;\n\t\t\tfor (int i=0; i<parsedinput.size(); i++)\n\t\t\t{\n\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\/\/checks for & and |\n\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t{\n\t\t\t\t\t\/\/if 3 &&& |||, or 1 & | -- syntax error\n\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t{\n\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i+1) != parsedinput.at(i))\n\t\t\t\t\t{\n\t\t\t\t\t\tsynerror=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t{\n\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(synerror = true) break;\n\t\t\tseploopdone = true;\n\t\t}\n\n\t\t\/\/PARSING TEST OUTPUT\n\t\tfor (int i=0; i<cmds.size(); i++)\n\t\t\tcout << cmds.at(i) << endl;\n\t\n\t\t\/\/temporary input handling -- if exit was not entered, output the input.\n\t\tprintf(\"\\\"%s\\\" was entered.\\n\", rawinput.c_str());\n\t\t\n\n\t}\n\n\treturn 0;\n} \n<commit_msg>rewriting & debugging parsing algorithm.<commit_after>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <boost\/tokenizer.hpp>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\nusing namespace boost;\n\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\n\n\/\/function for iterating through parsed string\nvoid commandexec(vector<string> x)\n{\n\t\/\/position of iterator\n\tint pos = 0;\n\twhile (pos < x.size())\n\t{\n\t\t\/\/if 'ls' is found\n\t\tif (x.at(pos) == \"ls\")\n\t\t{\n\t\t\tint pid = fork();\n\t\t\tif (pid == -1) \/\/if pid is -s, an error has occurred.\n\t\t\t{\n\t\t\t\tperror(\"fork\");\n\t\t\t\texit(1);\n\t\t\t}\n\t\t\telse if (pid == 0) \/\/if pid is 0, you are in child process. execvp here.\n\t\t\t{\n\/\/\t\t\t\texecvp(x.at(pos), x.at(pos+1)); \n\t\t\t}\n\t\t\telse\n\t\t\t\twait(0);\n\t\t}\n\t}\n}\n\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell)\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\n\t\t\/\/variables to keep track of whitespaces\n\t\tint wsbegin = 0;\n\t\tint wsend = 0;\n\t\tstring parsedinput = rawinput;\n\n\n\t\t\/\/first remove leading whitespaces at the very beginning of the string\n\t\twhile (parsedinput.at(wsend) == ' ') wsend++;\n\t\tparsedinput = parsedinput.substr(wsend, parsedinput.size()-1);\n\t\t\/\/then reinit wsend for removing inner whitespaces\n\t\twsend = 0;\n\n\t\t\/\/next remove trailing whitespaces at the end of the string\n\t\twsbegin = parsedinput.size()-1;\n\t\tif(parsedinput.at(wsbegin) == ' ')\n\t\t{\n\t\t\twhile (parsedinput.at(wsbegin) == ' ')\n\t\t\t\t--wsbegin;\n\t\t\n\t\t\tparsedinput = parsedinput.substr(0, wsbegin+1);\n\t\t}\n\t\t\/\/then reinit wsbegin for removing inner whitespaces \n\t\twsbegin = 0;\n\n\t\t\/\/remove extra whitespaces in the middle of the string\n\t\tfor (int i=0; i<parsedinput.size(); i++) \n\t\t{\n\t\t}\n\t\t\t\n\n\n\t\tparsedinput += ';';\n\t\tcout << \"new input:\" << parsedinput << endl;\n\t\t\n\t\t\/\/initial scan for syntax errors\n\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\/\/bool variable to tell when the inner for loop is done\n\t\tbool seploopdone = false;\n\n\t\t\/\/iterate through string and separate into commands and connectors\n\t\twhile (synerror != true && seploopdone == false)\n\t\t{\n\t\t\tstring parsecmd;\n\t\t\tfor (int i=0; i<parsedinput.size(); i++)\n\t\t\t{\n\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\/\/checks for & and |\n\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t{\n\t\t\t\t\t\/\/if 3 &&& |||, or 1 & | -- syntax error\n\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t{\n\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i+1) != parsedinput.at(i))\n\t\t\t\t\t{\n\t\t\t\t\t\tsynerror=true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\ti++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t{\n\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(synerror = true) break;\n\t\t\tseploopdone = true;\n\t\t}\n\n\t\t\/\/PARSING TEST OUTPUT\n\t\tfor (int i=0; i<cmds.size(); i++)\n\t\t\tcout << cmds.at(i) << endl;\n\t\n\t\t\/\/temporary input handling -- if exit was not entered, output the input.\n\t\tprintf(\"\\\"%s\\\" was entered.\\n\", rawinput.c_str());\n\t\t\n\n\t}\n\n\treturn 0;\n} \n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2011 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_UTILS_HPP\n#define MAPNIK_UTILS_HPP\n\n#include <mapnik\/config.hpp>\n\n\/\/ boost\n#ifdef MAPNIK_THREADSAFE\n#include <boost\/thread\/mutex.hpp>\n#endif\n\n\/\/ stl\n#include <stdexcept>\n#include <cstdlib>\n#include <limits>\n#include <ctime>\n#include <algorithm>\n#include <cmath>\n\nnamespace mapnik\n{\n\n#ifdef MAPNIK_THREADSAFE\nusing boost::mutex;\n#endif\n\ntemplate <typename T>\nclass CreateUsingNew\n{\npublic:\n static T* create()\n {\n return new T;\n }\n static void destroy(T* obj)\n {\n delete obj;\n }\n};\n\ntemplate <typename T>\nclass CreateStatic\n{\nprivate:\n union MaxAlign\n {\n char t_[sizeof(T)];\n short int shortInt_;\n int int_;\n long int longInt_;\n float float_;\n double double_;\n long double longDouble_;\n struct Test;\n int Test::* pMember_;\n int (Test::*pMemberFn_)(int);\n };\n\npublic:\n\n static T* create()\n {\n static MaxAlign staticMemory;\n return new(&staticMemory) T;\n }\n#ifdef __SUNPRO_CC\n\/\/ Sun C++ Compiler doesn't handle `volatile` keyword same as GCC.\n static void destroy(T* obj)\n#else\n static void destroy(volatile T* obj)\n#endif\n {\n obj->~T();\n }\n};\n\n#ifdef __GNUC__\ntemplate <typename T,\n template <typename U> class CreatePolicy=CreateStatic> class MAPNIK_DECL singleton\n{\n#else\n template <typename T,\n template <typename U> class CreatePolicy=CreateStatic> class singleton\n {\n#endif\n\n#ifdef __SUNPRO_CC\n\/* Sun's C++ compiler will issue the following errors if CreatePolicy<T> is used:\n Error: A class template name was expected instead of mapnik::CreatePolicy<mapnik::T>\n Error: A \"friend\" declaration must specify a class or function.\n*\/\n friend class CreatePolicy;\n#else\n friend class CreatePolicy<T>;\n#endif\n static T* pInstance_;\n static bool destroyed_;\n singleton(const singleton &rhs);\n singleton& operator=(const singleton&);\n\n static void onDeadReference()\n {\n throw std::runtime_error(\"dead reference!\");\n }\n\n static void DestroySingleton()\n {\n CreatePolicy<T>::destroy(pInstance_);\n pInstance_ = 0;\n destroyed_ = true;\n }\n\n protected:\n#ifdef MAPNIK_THREADSAFE\n static mutex mutex_;\n#endif\n singleton() {}\n public:\n static T& instance()\n {\n if (! pInstance_)\n {\n#ifdef MAPNIK_THREADSAFE\n mutex::scoped_lock lock(mutex_);\n#endif\n if (! pInstance_)\n {\n if (destroyed_)\n {\n destroyed_ = false;\n onDeadReference();\n }\n else\n {\n pInstance_ = CreatePolicy<T>::create();\n\n \/\/ register destruction\n std::atexit(&DestroySingleton);\n }\n }\n }\n return *pInstance_;\n }\n };\n#ifdef MAPNIK_THREADSAFE\n template <typename T,\n template <typename U> class CreatePolicy> mutex singleton<T,CreatePolicy>::mutex_;\n#endif\n\n template <typename T,\n template <typename U> class CreatePolicy> T* singleton<T,CreatePolicy>::pInstance_=0;\n template <typename T,\n template <typename U> class CreatePolicy> bool singleton<T,CreatePolicy>::destroyed_=false;\n\n\n#ifdef _WINDOWS\n\n\/\/ UTF8 <--> UTF16 conversion routines\n\nMAPNIK_DECL std::string utf16_to_utf8(std::wstring const& wstr);\nMAPNIK_DECL std::wstring utf8_to_utf16(std::string const& str);\n\n#endif \/\/ _WINDOWS\n\n}\n\n#endif \/\/ MAPNIK_UTILS_HPP\n<commit_msg>drop suncc support from singleton class<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2011 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_UTILS_HPP\n#define MAPNIK_UTILS_HPP\n\n#include <mapnik\/config.hpp>\n\n\/\/ boost\n#ifdef MAPNIK_THREADSAFE\n#include <boost\/thread\/mutex.hpp>\n#endif\n\n\/\/ stl\n#include <stdexcept>\n#include <cstdlib>\n#include <limits>\n#include <ctime>\n#include <algorithm>\n#include <cmath>\n\nnamespace mapnik\n{\n\n#ifdef MAPNIK_THREADSAFE\nusing boost::mutex;\n#endif\n\ntemplate <typename T>\nclass CreateUsingNew\n{\npublic:\n static T* create()\n {\n return new T;\n }\n static void destroy(T* obj)\n {\n delete obj;\n }\n};\n\ntemplate <typename T>\nclass CreateStatic\n{\nprivate:\n union MaxAlign\n {\n char t_[sizeof(T)];\n short int shortInt_;\n int int_;\n long int longInt_;\n float float_;\n double double_;\n long double longDouble_;\n struct Test;\n int Test::* pMember_;\n int (Test::*pMemberFn_)(int);\n };\n\npublic:\n\n static T* create()\n {\n static MaxAlign staticMemory;\n return new(&staticMemory) T;\n }\n static void destroy(volatile T* obj)\n {\n obj->~T();\n }\n};\n\n\ntemplate <typename T,\n template <typename U> class CreatePolicy=CreateStatic> class MAPNIK_DECL singleton\n{\n friend class CreatePolicy<T>;\n static T* pInstance_;\n static bool destroyed_;\n singleton(const singleton &rhs);\n singleton& operator=(const singleton&);\n\n static void onDeadReference()\n {\n throw std::runtime_error(\"dead reference!\");\n }\n\n static void DestroySingleton()\n {\n CreatePolicy<T>::destroy(pInstance_);\n pInstance_ = 0;\n destroyed_ = true;\n }\n\nprotected:\n\n#ifdef MAPNIK_THREADSAFE\n static mutex mutex_;\n#endif\n singleton() {}\n public:\n static T& instance()\n {\n if (! pInstance_)\n {\n#ifdef MAPNIK_THREADSAFE\n mutex::scoped_lock lock(mutex_);\n#endif\n if (! pInstance_)\n {\n if (destroyed_)\n {\n destroyed_ = false;\n onDeadReference();\n }\n else\n {\n pInstance_ = CreatePolicy<T>::create();\n\n \/\/ register destruction\n std::atexit(&DestroySingleton);\n }\n }\n }\n return *pInstance_;\n }\n};\n\n#ifdef MAPNIK_THREADSAFE\n template <typename T,\n template <typename U> class CreatePolicy> mutex singleton<T,CreatePolicy>::mutex_;\n#endif\n\n template <typename T,\n template <typename U> class CreatePolicy> T* singleton<T,CreatePolicy>::pInstance_=0;\n template <typename T,\n template <typename U> class CreatePolicy> bool singleton<T,CreatePolicy>::destroyed_=false;\n\n\n#ifdef _WINDOWS\n\n\/\/ UTF8 <--> UTF16 conversion routines\n\nMAPNIK_DECL std::string utf16_to_utf8(std::wstring const& wstr);\nMAPNIK_DECL std::wstring utf8_to_utf16(std::string const& str);\n\n#endif \/\/ _WINDOWS\n\n}\n\n#endif \/\/ MAPNIK_UTILS_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string>\n\n#include <string>\n#include <channel\/Channel.h>\n\nusing namespace channel;\nusing namespace std;\n\nint main() {\n\n Channel<string> channel;\n auto& sink = channel.sink();\n auto& source = channel.source();\n\n sink.give(\"abcde\");\n sink.give(\"12345\");\n sink.give(\"hehe\");\n sink.give(\"öä+\");\n\n auto msgs1 = source.takeWithin(std::chrono::milliseconds(1));\n\n sink.give(\"wglalala\");\n sink.give(\"1aeh2345\");\n sink.give(\"heaeg4he\");\n sink.give(\"öä+ga4\");\n\n auto msgs2 = source.takeNow();\n\n for (const auto& msgs : { msgs1, msgs2 })\n for (const auto& msg : msgs)\n cout << msg << endl;\n\n return 0;\n}\n\n<commit_msg>Update main.cpp<commit_after>#include <iostream>\n#include <string>\n\n#include <channel\/Channel.h>\n\nusing namespace channel;\nusing namespace std;\n\nint main() {\n\n Channel<string> channel;\n auto& sink = channel.sink();\n auto& source = channel.source();\n\n sink.give(\"abcde\");\n sink.give(\"12345\");\n sink.give(\"hehe\");\n sink.give(\"öä+\");\n\n auto msgs1 = source.takeWithin(std::chrono::milliseconds(1));\n\n sink.give(\"wglalala\");\n sink.give(\"1aeh2345\");\n sink.give(\"heaeg4he\");\n sink.give(\"öä+ga4\");\n\n auto msgs2 = source.takeNow();\n\n for (const auto& msgs : { msgs1, msgs2 })\n for (const auto& msg : msgs)\n cout << msg << endl;\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include <cuda_runtime.h>\n\n#include <helper_math.h>\n\n#include \"path_tracer.hpp\"\n\nconst float kAperatureRadius = 0.04;\nconst uint2 kResolution = make_uint2(512, 512);\nconst size_t kNumScenes = 2;\n\nconst std::string kSceneFiles[kNumScenes]{\n \"..\/scenes\/scene-1\/scene01.obj\", \"..\/scenes\/scene-2\/scene02.obj\",\n};\nconst cupt::Camera kCameras[2]{\n cupt::Camera(kResolution, make_float3(0, 5, 10), make_float3(0, 0, -1),\n make_float3(0, 1, 0), make_float2(90, 90), kAperatureRadius,\n 5),\n cupt::Camera(kResolution, make_float3(0, 5, 10), make_float3(0, 0, -1),\n make_float3(0, 1, 0), make_float2(90, 90), kAperatureRadius,\n 5),\n};\n\nint main(int argc, const char* argv[]) {\n if (argc < 3) {\n std::cout << \"Usage: PathTracer SCENE-ID OUTPUT [SAMPLES] [DEPTH]\"\n << std::endl;\n return -1;\n }\n\n std::cout << \"Initializing CUDA Runtime...\" << std::flush;\n cudaSetDevice(0);\n std::cout << \"Done\" << std::endl;\n\n cupt::PathTracer::Parameter parameter;\n parameter.mc_sample_times = argc > 3 ? atoi(argv[3]) : 1;\n parameter.max_trace_depth = argc > 4 ? atoi(argv[4]) : 1;\n cupt::PathTracer tracer(parameter);\n\n const size_t id = atoi(argv[1]) - 1;\n assert(id < kNumScenes);\n\n const std::string& filename = kSceneFiles[id];\n const std::string basedir(filename, 0, filename.rfind(\"\/\") + 1);\n\n std::cout << \"Loading Scene...\" << std::flush;\n cupt::Scene scene(filename.c_str(), basedir.c_str());\n scene.light = 20;\n tracer.SetScene(scene);\n std::cout << \"Done\" << std::endl;\n\n std::cout << \"Rendering...\" << std::flush;\n const cupt::Camera& camera = kCameras[id];\n cupt::Image image = tracer.Render(camera);\n std::cout << \"Done\" << ::std::endl;\n\n std::cout << \"Saving Result...\" << std::flush;\n bool success = image.Save(argv[2]);\n if (success) {\n std::cout << \"Success!\" << std::endl;\n } else {\n std::cout << \"Failed!\" << std::endl;\n }\n\n return 0;\n}<commit_msg>调整部分参数<commit_after>#include <iostream>\n\n#include <cuda_runtime.h>\n\n#include <helper_math.h>\n\n#include \"path_tracer.hpp\"\n\nconst float kAperatureRadius = 0.04;\nconst uint2 kResolution = make_uint2(512, 512);\nconst size_t kNumScenes = 2;\n\nconst std::string kSceneFiles[kNumScenes]{\n \"..\/scenes\/scene-1\/scene01.obj\", \"..\/scenes\/scene-2\/scene02.obj\",\n};\nconst cupt::Camera kCameras[2]{\n cupt::Camera(kResolution, make_float3(0, 5, 10), make_float3(0, 0, -1),\n make_float3(0, 1, 0), make_float2(90, 90), kAperatureRadius,\n 10),\n cupt::Camera(kResolution, make_float3(1, 7, 25), make_float3(0, 0, -1),\n make_float3(0, 1, 0), make_float2(90, 90), kAperatureRadius,\n 5),\n};\n\nint main(int argc, const char* argv[]) {\n if (argc < 3) {\n std::cout << \"Usage: PathTracer SCENE-ID OUTPUT [SAMPLES] [DEPTH]\"\n << std::endl;\n return -1;\n }\n\n std::cout << \"Initializing CUDA Runtime...\" << std::flush;\n cudaSetDevice(0);\n std::cout << \"Done\" << std::endl;\n\n cupt::PathTracer::Parameter parameter;\n parameter.mc_sample_times = argc > 3 ? atoi(argv[3]) : 1;\n parameter.max_trace_depth = argc > 4 ? atoi(argv[4]) : 1;\n cupt::PathTracer tracer(parameter);\n\n const size_t id = atoi(argv[1]) - 1;\n assert(id < kNumScenes);\n\n const std::string& filename = kSceneFiles[id];\n const std::string basedir(filename, 0, filename.rfind(\"\/\") + 1);\n\n std::cout << \"Loading Scene...\" << std::flush;\n cupt::Scene scene(filename.c_str(), basedir.c_str());\n tracer.SetScene(scene);\n std::cout << \"Done\" << std::endl;\n\n std::cout << \"Rendering...\" << std::flush;\n const cupt::Camera& camera = kCameras[id];\n cupt::Image image = tracer.Render(camera);\n std::cout << \"Done\" << ::std::endl;\n\n std::cout << \"Saving Result...\" << std::flush;\n bool success = image.Save(argv[2]);\n if (success) {\n std::cout << \"Success!\" << std::endl;\n } else {\n std::cout << \"Failed!\" << std::endl;\n }\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, 2014 Jeffrey Carpenter <i8degrees@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_STDINT_TYPES_HPP\n#define NOMLIB_STDINT_TYPES_HPP\n\n#include \"platforms.hpp\"\n\n#define NOM_PTR_CAST(type, expression) \\\n ( std::dynamic_pointer_cast<type>(expression) )\n\/\/#define NOM_STATIC_CAST(type, expression) static_cast<type>(expression)\n\/\/#define NOM_CONST_CAST(type, expression) const_cast<type>(expression)\n\n#define NOM_ENDL(reserved) ( std::cout << std::endl )\n\n\/*\n TODO: This should be replaced by an actual CMake script -- think:\n compile-time check for the necessary feature support for C++11 style\n headers support.\n\n Look into why GCC doesn't like the inclusion of <cstdint> -- otherwise\n known as stdint.h. MSVCPP2013 & llvm-clang are fine with it).\n*\/\n\n#ifndef NOM_PLATFORM_LINUX \/\/ To be replace with NOM_COMPILER_FEATURE_NULLPTR\n \/\/ (see above TODO note).\n #include <cstdint>\n#else\n #include <sys\/types.h>\n#endif\n\n\/\/ Borrowed from \/usr\/include\/MacTypes.h && \/usr\/include\/objc\/objc.h:\n#ifndef NULL\n #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n #define NULL nullptr\n #else\n #define NULL 0 \/\/__DARWIN_NULL\n #endif\n#endif \/\/ ! NULL\n\n#ifndef nil\n #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n #define nil nullptr\n #else\n #define nil 0 \/\/__DARWIN_NULL\n #endif\n#endif \/\/ ! nil\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/ 8-bit integer types\ntypedef int8_t int8;\ntypedef uint8_t uint8;\n\n\/\/ 16-bit integer types\ntypedef int16_t int16;\ntypedef uint16_t uint16;\n\n\/\/ 32-bit integer types\ntypedef int32_t int32;\ntypedef uint32_t uint32;\n\n\/\/\/ \\brief 64-bit integer types\n\/\/\/ \\note As per **\/usr\/include\/MacTypes.h**:\n\/\/\/\n\/\/\/ \"The MS Visual C\/C++ compiler uses __int64 instead of long long\".\n#if defined( NOM_COMPILER_MSVCPP ) && defined( NOM_PLATFORM_ARCH_X86 )\n typedef signed __int64 int64;\n typedef unsigned __int64 uint64;\n#else \/\/ Blindly assume a 64-bit architecture\n typedef int64_t int64; \/\/typedef signed long long int int64;\n typedef uint64_t uint64; \/\/typedef unsigned long long int uint64;\n#endif\n\n\/\/ Additional integer type definitions\n#if defined (NOM_PLATFORM_ARCH_X86_64)\n typedef unsigned long ulong;\n#else \/\/ Blindly assume 32-bit arch\n typedef long long ulong;\n#endif\n\ntypedef unsigned char uchar;\ntypedef signed int sint;\ntypedef unsigned int uint;\ntypedef std::size_t size;\ntypedef int boolean;\n\ntypedef sint* sint_ptr;\ntypedef uint* uint_ptr;\n\ntypedef int32_t* int32_ptr;\ntypedef uint32_t* uint32_ptr;\n\ntypedef void* void_ptr;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n#if defined(NOM_PLATFORM_ARCH_X86_64)\n static_assert ( sizeof ( nom::size ) == ( sizeof(nom::uint64) ), \"nom::size\" );\n static_assert ( sizeof ( nom::int32_ptr ) == ( sizeof(long) ), \"nom::int32_ptr\" );\n static_assert ( sizeof ( nom::uint32_ptr ) == ( sizeof(nom::ulong) ), \"nom::uint32_ptr\" );\n#elif defined(NOM_PLATFORM_ARCH_X86)\n static_assert ( sizeof ( nom::size ) == ( sizeof(nom::uint32) ), \"nom::size\" );\n#else\n #pragma message ( \"types.hpp: Unknown architecture; defined data types may be wrong.\" )\n#endif\n\nstatic_assert ( sizeof ( nom::boolean ) == ( sizeof(int) ), \"nom::boolean\" );\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n\/\/#if defined(HAVE_SDL2)\nconst nom::sint SDL_SUCCESS = 0; \/\/ Non-error return value for SDL2 API\n\/\/#endif\n\n#endif \/\/ include guard defined\n<commit_msg>types: Introduce NOM_SCAST & NOM_CCAST macros<commit_after>\/******************************************************************************\n\n nomlib - C++11 cross-platform game engine\n\nCopyright (c) 2013, 2014 Jeffrey Carpenter <i8degrees@gmail.com>\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n2. Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\nSOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n******************************************************************************\/\n#ifndef NOMLIB_STDINT_TYPES_HPP\n#define NOMLIB_STDINT_TYPES_HPP\n\n#include \"platforms.hpp\"\n\n#define NOM_PTR_CAST(type, expression) \\\n ( std::dynamic_pointer_cast<type>(expression) )\n\n#define NOM_SCAST(type, expression) static_cast<type>(expression)\n#define NOM_CCAST(type, expression) const_cast<type>(expression)\n\n#define NOM_ENDL(reserved) ( std::cout << std::endl )\n\n\/*\n TODO: This should be replaced by an actual CMake script -- think:\n compile-time check for the necessary feature support for C++11 style\n headers support.\n\n Look into why GCC doesn't like the inclusion of <cstdint> -- otherwise\n known as stdint.h. MSVCPP2013 & llvm-clang are fine with it).\n*\/\n\n#ifndef NOM_PLATFORM_LINUX \/\/ To be replace with NOM_COMPILER_FEATURE_NULLPTR\n \/\/ (see above TODO note).\n #include <cstdint>\n#else\n #include <sys\/types.h>\n#endif\n\n\/\/ Borrowed from \/usr\/include\/MacTypes.h && \/usr\/include\/objc\/objc.h:\n#ifndef NULL\n #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n #define NULL nullptr\n #else\n #define NULL 0 \/\/__DARWIN_NULL\n #endif\n#endif \/\/ ! NULL\n\n#ifndef nil\n #if defined( NOM_COMPILER_FEATURE_NULLPTR )\n #define nil nullptr\n #else\n #define nil 0 \/\/__DARWIN_NULL\n #endif\n#endif \/\/ ! nil\n\n\/\/ Portable fixed-size data types derive from stdint.h\nnamespace nom {\n\n\/\/ 8-bit integer types\ntypedef int8_t int8;\ntypedef uint8_t uint8;\n\n\/\/ 16-bit integer types\ntypedef int16_t int16;\ntypedef uint16_t uint16;\n\n\/\/ 32-bit integer types\ntypedef int32_t int32;\ntypedef uint32_t uint32;\n\n\/\/\/ \\brief 64-bit integer types\n\/\/\/ \\note As per **\/usr\/include\/MacTypes.h**:\n\/\/\/\n\/\/\/ \"The MS Visual C\/C++ compiler uses __int64 instead of long long\".\n#if defined( NOM_COMPILER_MSVCPP ) && defined( NOM_PLATFORM_ARCH_X86 )\n typedef signed __int64 int64;\n typedef unsigned __int64 uint64;\n#else \/\/ Blindly assume a 64-bit architecture\n typedef int64_t int64; \/\/typedef signed long long int int64;\n typedef uint64_t uint64; \/\/typedef unsigned long long int uint64;\n#endif\n\n\/\/ Additional integer type definitions\n#if defined (NOM_PLATFORM_ARCH_X86_64)\n typedef unsigned long ulong;\n#else \/\/ Blindly assume 32-bit arch\n typedef long long ulong;\n#endif\n\ntypedef unsigned char uchar;\ntypedef signed int sint;\ntypedef unsigned int uint;\ntypedef std::size_t size;\ntypedef int boolean;\n\ntypedef sint* sint_ptr;\ntypedef uint* uint_ptr;\n\ntypedef int32_t* int32_ptr;\ntypedef uint32_t* uint32_ptr;\n\ntypedef void* void_ptr;\n\n} \/\/ namespace nom\n\n\/\/\/ Ensure our data types have the right sizes using C++11 compile-time asserts.\nstatic_assert ( sizeof ( nom::uint8 ) == 1, \"nom::uint8\" );\nstatic_assert ( sizeof ( nom::int8 ) == 1, \"nom::int8\" );\n\nstatic_assert ( sizeof ( nom::uint16 ) == 2, \"nom::uint16\" );\nstatic_assert ( sizeof ( nom::int16 ) == 2, \"nom::int16\" );\n\nstatic_assert ( sizeof ( nom::uint32 ) == 4, \"nom::uint32\" );\nstatic_assert ( sizeof ( nom::int32 ) == 4, \"nom::int32\" );\n\nstatic_assert ( sizeof ( nom::uint64 ) == 8, \"nom::uint64\" );\nstatic_assert ( sizeof ( nom::int64 ) == 8, \"nom::int64\" );\n\nstatic_assert ( sizeof ( nom::ulong ) == 8, \"nom::ulong\" );\n\nstatic_assert ( sizeof ( nom::uchar ) == 1, \"nom::uchar\" );\n\n#if defined(NOM_PLATFORM_ARCH_X86_64)\n static_assert ( sizeof ( nom::size ) == ( sizeof(nom::uint64) ), \"nom::size\" );\n static_assert ( sizeof ( nom::int32_ptr ) == ( sizeof(long) ), \"nom::int32_ptr\" );\n static_assert ( sizeof ( nom::uint32_ptr ) == ( sizeof(nom::ulong) ), \"nom::uint32_ptr\" );\n#elif defined(NOM_PLATFORM_ARCH_X86)\n static_assert ( sizeof ( nom::size ) == ( sizeof(nom::uint32) ), \"nom::size\" );\n#else\n #pragma message ( \"types.hpp: Unknown architecture; defined data types may be wrong.\" )\n#endif\n\nstatic_assert ( sizeof ( nom::boolean ) == ( sizeof(int) ), \"nom::boolean\" );\n\n\/\/\/ Additional type definitions\n\nconst nom::sint NOM_EXIT_FAILURE = 1; \/\/ EXIT_FAILURE from cstdlib headers\nconst nom::sint NOM_EXIT_SUCCESS = 0; \/\/ EXIT_SUCCESS from cstdlib headers\n\n\/\/#if defined(HAVE_SDL2)\nconst nom::sint SDL_SUCCESS = 0; \/\/ Non-error return value for SDL2 API\n\/\/#endif\n\n#endif \/\/ include guard defined\n<|endoftext|>"} {"text":"<commit_before>\/** String conversion definitions.\n *\n * DO NOT INCLUDE THIS FILE DIRECTLY; include pqxx\/stringconv instead.\n *\n * Copyright (c) 2008-2017, Jeroen T. Vermeulen <jtv@xs4all.nl>\n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\/\n#ifndef PQXX_H_STRINGCONV\n#define PQXX_H_STRINGCONV\n\n#include \"pqxx\/compiler-public.hxx\"\n\n#include <sstream>\n#include <stdexcept>\n\n\nnamespace pqxx\n{\n\n\/**\n * @defgroup stringconversion String conversion\n *\n * For purposes of communication with the server, values need to be converted\n * from and to a human-readable string format that (unlike the various functions\n * and templates in the C and C++ standard libraries) is not sensitive to locale\n * settings and internationalization. This section contains functionality that\n * is used extensively by libpqxx itself, but is also available for use by other\n * programs.\n *\/\n\/\/@{\n\n\/\/\/ Traits class for use in string conversions\n\/** Specialize this template for a type that you wish to add to_string and\n * from_string support for.\n *\/\ntemplate<typename T> struct string_traits {};\n\nnamespace internal\n{\n\/\/\/ Throw exception for attempt to convert null to given type.\n[[noreturn]] PQXX_LIBEXPORT void throw_null_conversion(\n\tconst std::string &type);\n} \/\/ namespace pqxx::internal\n\n#define PQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(T)\t\t\t\\\ntemplate<> struct PQXX_LIBEXPORT string_traits<T>\t\t\t\\\n{\t\t\t\t\t\t\t\t\t\\\n typedef T subject_type;\t\t\t\t\t\t\\\n static constexpr const char *name() noexcept { return #T; }\t\t\\\n static constexpr bool has_null() noexcept { return false; }\t\t\\\n static bool is_null(T) { return false; }\t\t\t\t\\\n static T null() \t\t\t\t\t\t\t\\\n { internal::throw_null_conversion(name()); return subject_type(); }\t\\\n static void from_string(const char Str[], T &Obj);\t\t\t\\\n static std::string to_string(T Obj);\t\t\t\t\t\\\n};\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(bool)\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(short)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned short)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(int)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned int)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned long long)\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(float)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(double)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long double)\n\n#undef PQXX_DECLARE_STRING_TRAITS_SPECIALIZATION\n\n\/\/\/ String traits for C-style string (\"pointer to const char\")\ntemplate<> struct PQXX_LIBEXPORT string_traits<const char *>\n{\n static constexpr const char *name() noexcept { return \"const char *\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char *t) { return !t; }\n static const char *null() { return nullptr; }\n static void from_string(const char Str[], const char *&Obj) { Obj = Str; }\n static std::string to_string(const char *Obj) { return Obj; }\n};\n\n\/\/\/ String traits for non-const C-style string (\"pointer to char\")\ntemplate<> struct PQXX_LIBEXPORT string_traits<char *>\n{\n static constexpr const char *name() noexcept { return \"char *\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char *t) { return !t; }\n static const char *null() { return nullptr; }\n\n \/\/ Don't allow this conversion since it breaks const-safety.\n \/\/ static void from_string(const char Str[], char *&Obj);\n\n static std::string to_string(char *Obj) { return Obj; }\n};\n\n\/\/\/ String traits for C-style string constant (\"array of char\")\ntemplate<size_t N> struct PQXX_LIBEXPORT string_traits<char[N]>\n{\n static constexpr const char *name() noexcept { return \"char[]\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char t[]) { return !t; }\n static const char *null() { return nullptr; }\n static std::string to_string(const char Obj[]) { return Obj; }\n};\n\n\/\/\/ String traits for \"array of const char.\"\n\/** Visual Studio 2010 isn't happy without this redundant specialization.\n * Other compilers shouldn't need it.\n *\/\ntemplate<size_t N> struct PQXX_LIBEXPORT string_traits<const char[N]>\n{\n static constexpr const char *name() noexcept { return \"char[]\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char t[]) { return !t; }\n static const char *null() { return nullptr; }\n static std::string to_string(const char Obj[]) { return Obj; }\n};\n\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<std::string>\n{\n static constexpr const char *name() noexcept { return \"string\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::string &) { return false; }\n static std::string null()\n\t{ internal::throw_null_conversion(name()); return std::string(); }\n static void from_string(const char Str[], std::string &Obj) { Obj=Str; }\n static std::string to_string(const std::string &Obj) { return Obj; }\n};\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<const std::string>\n{\n static constexpr const char *name() noexcept { return \"const string\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::string &) { return false; }\n static const std::string null()\n\t{ internal::throw_null_conversion(name()); return std::string(); }\n static const std::string to_string(const std::string &Obj) { return Obj; }\n};\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<std::stringstream>\n{\n static constexpr const char *name() noexcept { return \"stringstream\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::stringstream &) { return false; }\n static std::stringstream null()\n {\n internal::throw_null_conversion(name());\n \/\/ No, dear compiler, we don't need a return here.\n throw 0;\n }\n static void from_string(const char Str[], std::stringstream &Obj)\n\t{ Obj.clear(); Obj << Str; }\n static std::string to_string(const std::stringstream &Obj)\n\t{ return Obj.str(); }\n};\n\n\n\/\/ TODO: Implement date conversions\n\n\/\/\/ Attempt to convert postgres-generated string to given built-in type\n\/** If the form of the value found in the string does not match the expected\n * type, e.g. if a decimal point is found when converting to an integer type,\n * the conversion fails. Overflows (e.g. converting \"9999999999\" to a 16-bit\n * C++ type) are also treated as errors. If in some cases this behaviour should\n * be inappropriate, convert to something bigger such as @c long @c int first\n * and then truncate the resulting value.\n *\n * Only the simplest possible conversions are supported. No fancy features\n * such as hexadecimal or octal, spurious signs, or exponent notation will work.\n * No whitespace is stripped away. Only the kinds of strings that come out of\n * PostgreSQL and out of to_string() can be converted.\n *\/\ntemplate<typename T>\n inline void from_string(const char Str[], T &Obj)\n{\n if (!Str) throw std::runtime_error(\"Attempt to read null string\");\n string_traits<T>::from_string(Str, Obj);\n}\n\n\n\/\/\/ Conversion with known string length (for strings that may contain nuls)\n\/** This is only used for strings, where embedded nul bytes should not determine\n * the end of the string.\n *\n * For all other types, this just uses the regular, nul-terminated version of\n * from_string().\n *\/\ntemplate<typename T> inline void from_string(const char Str[], T &Obj, size_t)\n{\n return from_string(Str, Obj);\n}\n\ntemplate<>\n inline void from_string<std::string>(\t\t\t\t\t\/\/[t0]\n\tconst char Str[],\n\tstd::string &Obj,\n\tsize_t len)\n{\n if (!Str) throw std::runtime_error(\"Attempt to read null string\");\n Obj.assign(Str, len);\n}\n\ntemplate<typename T>\n inline void from_string(const std::string &Str, T &Obj)\t\t\/\/[t45]\n\t{ from_string(Str.c_str(), Obj); }\n\ntemplate<typename T>\n inline void from_string(const std::stringstream &Str, T &Obj)\t\t\/\/[t0]\n\t{ from_string(Str.str(), Obj); }\n\ntemplate<> inline void\nfrom_string(const std::string &Str, std::string &Obj)\t\t\t\/\/[t46]\n\t{ Obj = Str; }\n\n\nnamespace internal\n{\n\/\/\/ Compute numeric value of given textual digit (assuming that it is a digit)\ninline int digit_to_number(char c) noexcept { return c-'0'; }\ninline char number_to_digit(int i) noexcept\n\t{ return static_cast<char>(i+'0'); }\n} \/\/ namespace pqxx::internal\n\n\n\/\/\/ Convert built-in type to a readable string that PostgreSQL will understand\n\/** No special formatting is done, and any locale settings are ignored. The\n * resulting string will be human-readable and in a format suitable for use in\n * SQL queries.\n *\/\ntemplate<typename T> inline std::string to_string(const T &Obj)\n\t{ return string_traits<T>::to_string(Obj); }\n\n\/\/@}\n\n} \/\/ namespace pqxx\n\n#endif\n<commit_msg>Remove old workaround for noreturn warning.<commit_after>\/** String conversion definitions.\n *\n * DO NOT INCLUDE THIS FILE DIRECTLY; include pqxx\/stringconv instead.\n *\n * Copyright (c) 2008-2017, Jeroen T. Vermeulen <jtv@xs4all.nl>\n *\n * See COPYING for copyright license. If you did not receive a file called\n * COPYING with this source code, please notify the distributor of this mistake,\n * or contact the author.\n *\/\n#ifndef PQXX_H_STRINGCONV\n#define PQXX_H_STRINGCONV\n\n#include \"pqxx\/compiler-public.hxx\"\n\n#include <sstream>\n#include <stdexcept>\n\n\nnamespace pqxx\n{\n\n\/**\n * @defgroup stringconversion String conversion\n *\n * For purposes of communication with the server, values need to be converted\n * from and to a human-readable string format that (unlike the various functions\n * and templates in the C and C++ standard libraries) is not sensitive to locale\n * settings and internationalization. This section contains functionality that\n * is used extensively by libpqxx itself, but is also available for use by other\n * programs.\n *\/\n\/\/@{\n\n\/\/\/ Traits class for use in string conversions\n\/** Specialize this template for a type that you wish to add to_string and\n * from_string support for.\n *\/\ntemplate<typename T> struct string_traits {};\n\nnamespace internal\n{\n\/\/\/ Throw exception for attempt to convert null to given type.\n[[noreturn]] PQXX_LIBEXPORT void throw_null_conversion(\n\tconst std::string &type);\n} \/\/ namespace pqxx::internal\n\n#define PQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(T)\t\t\t\\\ntemplate<> struct PQXX_LIBEXPORT string_traits<T>\t\t\t\\\n{\t\t\t\t\t\t\t\t\t\\\n typedef T subject_type;\t\t\t\t\t\t\\\n static constexpr const char *name() noexcept { return #T; }\t\t\\\n static constexpr bool has_null() noexcept { return false; }\t\t\\\n static bool is_null(T) { return false; }\t\t\t\t\\\n [[noreturn]] static T null() \t\t\t\t\t\t\\\n { internal::throw_null_conversion(name()); }\t\t\t\\\n static void from_string(const char Str[], T &Obj);\t\t\t\\\n static std::string to_string(T Obj);\t\t\t\t\t\\\n};\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(bool)\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(short)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned short)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(int)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned int)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long long)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(unsigned long long)\n\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(float)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(double)\nPQXX_DECLARE_STRING_TRAITS_SPECIALIZATION(long double)\n\n#undef PQXX_DECLARE_STRING_TRAITS_SPECIALIZATION\n\n\/\/\/ String traits for C-style string (\"pointer to const char\")\ntemplate<> struct PQXX_LIBEXPORT string_traits<const char *>\n{\n static constexpr const char *name() noexcept { return \"const char *\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char *t) { return !t; }\n static const char *null() { return nullptr; }\n static void from_string(const char Str[], const char *&Obj) { Obj = Str; }\n static std::string to_string(const char *Obj) { return Obj; }\n};\n\n\/\/\/ String traits for non-const C-style string (\"pointer to char\")\ntemplate<> struct PQXX_LIBEXPORT string_traits<char *>\n{\n static constexpr const char *name() noexcept { return \"char *\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char *t) { return !t; }\n static const char *null() { return nullptr; }\n\n \/\/ Don't allow this conversion since it breaks const-safety.\n \/\/ static void from_string(const char Str[], char *&Obj);\n\n static std::string to_string(char *Obj) { return Obj; }\n};\n\n\/\/\/ String traits for C-style string constant (\"array of char\")\ntemplate<size_t N> struct PQXX_LIBEXPORT string_traits<char[N]>\n{\n static constexpr const char *name() noexcept { return \"char[]\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char t[]) { return !t; }\n static const char *null() { return nullptr; }\n static std::string to_string(const char Obj[]) { return Obj; }\n};\n\n\/\/\/ String traits for \"array of const char.\"\n\/** Visual Studio 2010 isn't happy without this redundant specialization.\n * Other compilers shouldn't need it.\n *\/\ntemplate<size_t N> struct PQXX_LIBEXPORT string_traits<const char[N]>\n{\n static constexpr const char *name() noexcept { return \"char[]\"; }\n static constexpr bool has_null() noexcept { return true; }\n static bool is_null(const char t[]) { return !t; }\n static const char *null() { return nullptr; }\n static std::string to_string(const char Obj[]) { return Obj; }\n};\n\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<std::string>\n{\n static constexpr const char *name() noexcept { return \"string\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::string &) { return false; }\n static std::string null()\n\t{ internal::throw_null_conversion(name()); return std::string(); }\n static void from_string(const char Str[], std::string &Obj) { Obj=Str; }\n static std::string to_string(const std::string &Obj) { return Obj; }\n};\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<const std::string>\n{\n static constexpr const char *name() noexcept { return \"const string\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::string &) { return false; }\n static const std::string null()\n\t{ internal::throw_null_conversion(name()); return std::string(); }\n static const std::string to_string(const std::string &Obj) { return Obj; }\n};\n\ntemplate<> struct PQXX_LIBEXPORT string_traits<std::stringstream>\n{\n static constexpr const char *name() noexcept { return \"stringstream\"; }\n static constexpr bool has_null() noexcept { return false; }\n static bool is_null(const std::stringstream &) { return false; }\n static std::stringstream null()\n {\n internal::throw_null_conversion(name());\n \/\/ No, dear compiler, we don't need a return here.\n throw 0;\n }\n static void from_string(const char Str[], std::stringstream &Obj)\n\t{ Obj.clear(); Obj << Str; }\n static std::string to_string(const std::stringstream &Obj)\n\t{ return Obj.str(); }\n};\n\n\n\/\/ TODO: Implement date conversions\n\n\/\/\/ Attempt to convert postgres-generated string to given built-in type\n\/** If the form of the value found in the string does not match the expected\n * type, e.g. if a decimal point is found when converting to an integer type,\n * the conversion fails. Overflows (e.g. converting \"9999999999\" to a 16-bit\n * C++ type) are also treated as errors. If in some cases this behaviour should\n * be inappropriate, convert to something bigger such as @c long @c int first\n * and then truncate the resulting value.\n *\n * Only the simplest possible conversions are supported. No fancy features\n * such as hexadecimal or octal, spurious signs, or exponent notation will work.\n * No whitespace is stripped away. Only the kinds of strings that come out of\n * PostgreSQL and out of to_string() can be converted.\n *\/\ntemplate<typename T>\n inline void from_string(const char Str[], T &Obj)\n{\n if (!Str) throw std::runtime_error(\"Attempt to read null string\");\n string_traits<T>::from_string(Str, Obj);\n}\n\n\n\/\/\/ Conversion with known string length (for strings that may contain nuls)\n\/** This is only used for strings, where embedded nul bytes should not determine\n * the end of the string.\n *\n * For all other types, this just uses the regular, nul-terminated version of\n * from_string().\n *\/\ntemplate<typename T> inline void from_string(const char Str[], T &Obj, size_t)\n{\n return from_string(Str, Obj);\n}\n\ntemplate<>\n inline void from_string<std::string>(\t\t\t\t\t\/\/[t0]\n\tconst char Str[],\n\tstd::string &Obj,\n\tsize_t len)\n{\n if (!Str) throw std::runtime_error(\"Attempt to read null string\");\n Obj.assign(Str, len);\n}\n\ntemplate<typename T>\n inline void from_string(const std::string &Str, T &Obj)\t\t\/\/[t45]\n\t{ from_string(Str.c_str(), Obj); }\n\ntemplate<typename T>\n inline void from_string(const std::stringstream &Str, T &Obj)\t\t\/\/[t0]\n\t{ from_string(Str.str(), Obj); }\n\ntemplate<> inline void\nfrom_string(const std::string &Str, std::string &Obj)\t\t\t\/\/[t46]\n\t{ Obj = Str; }\n\n\nnamespace internal\n{\n\/\/\/ Compute numeric value of given textual digit (assuming that it is a digit)\ninline int digit_to_number(char c) noexcept { return c-'0'; }\ninline char number_to_digit(int i) noexcept\n\t{ return static_cast<char>(i+'0'); }\n} \/\/ namespace pqxx::internal\n\n\n\/\/\/ Convert built-in type to a readable string that PostgreSQL will understand\n\/** No special formatting is done, and any locale settings are ignored. The\n * resulting string will be human-readable and in a format suitable for use in\n * SQL queries.\n *\/\ntemplate<typename T> inline std::string to_string(const T &Obj)\n\t{ return string_traits<T>::to_string(Obj); }\n\n\/\/@}\n\n} \/\/ namespace pqxx\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <tudocomp\/pre_header\/Registry.hpp>\n#include <tudocomp\/pre_header\/Env.hpp>\n\nnamespace tdc {\n\ninline AlgorithmValue& EnvRoot::algo_value() {\n return *m_algo_value;\n}\n\ninline Stat& EnvRoot::stat_current() {\n return m_stat_stack.empty() ? m_stat_root : m_stat_stack.top();\n}\n\ninline void EnvRoot::begin_stat_phase(const std::string& name) {\n DLOG(INFO) << \"begin phase \\\"\" << name << \"\\\"\";\n\n m_stat_stack.push(Stat(name));\n Stat& stat = m_stat_stack.top();\n stat.begin();\n}\n\ninline void EnvRoot::end_stat_phase() {\n DCHECK(!m_stat_stack.empty());\n\n Stat& stat_ref = m_stat_stack.top();\n DLOG(INFO) << \"end phase \\\"\" << stat_ref.title() << \"\\\"\";\n\n stat_ref.end();\n\n Stat stat = stat_ref; \/\/copy\n m_stat_stack.pop();\n\n if(!m_stat_stack.empty()) {\n Stat& parent = m_stat_stack.top();\n parent.add_sub(stat);\n } else {\n m_stat_root = stat;\n }\n}\n\ninline Stat& EnvRoot::finish_stats() {\n while(!m_stat_stack.empty()) {\n end_stat_phase();\n }\n\n return m_stat_root;\n}\n\ninline void EnvRoot::restart_stats(const std::string& root_name) {\n finish_stats();\n begin_stat_phase(root_name);\n}\n\ntemplate<class T>\ninline void EnvRoot::log_stat(const std::string& name, const T& value) {\n DLOG(INFO) << \"stat: \" << name << \" = \" << value;\n stat_current().add_stat(name, value);\n}\n\ninline Env::Env(Env&& other):\n m_root(std::move(other.m_root)),\n m_node(other.m_node),\n m_registry(std::move(other.m_registry)) {}\n\ninline Env::Env(std::shared_ptr<EnvRoot> root,\n const AlgorithmValue& node,\n const Registry& registry):\n m_root(root),\n m_node(node),\n m_registry(std::make_unique<Registry>(registry)) {}\n\ninline Env::~Env() = default;\n\ninline const AlgorithmValue& Env::algo() const {\n return m_node;\n}\n\ninline std::shared_ptr<EnvRoot>& Env::root() {\n return m_root;\n}\n\ninline const Registry& Env::registry() const {\n return *m_registry;\n}\n\ninline void Env::error(const std::string& msg) {\n throw std::runtime_error(msg);\n}\n\ninline Env Env::env_for_option(const std::string& option) {\n CHECK(algo().arguments().count(option) > 0);\n auto& a = algo().arguments().at(option).as_algorithm();\n\n return Env(m_root, a, registry());\n}\n\ninline const OptionValue& Env::option(const std::string& option) const {\n return algo().arguments().at(option);\n}\n\ninline void Env::begin_stat_phase(const std::string& name) {\n m_root->begin_stat_phase(name); \/\/delegate\n}\n\ninline void Env::end_stat_phase() {\n m_root->end_stat_phase(); \/\/delegate\n}\n\ninline Stat& Env::finish_stats() {\n return m_root->finish_stats(); \/\/delegate\n}\n\ninline void Env::restart_stats(const std::string& root_name) {\n m_root->restart_stats(root_name); \/\/delegate\n}\n\ntemplate<class T>\ninline void Env::log_stat(const std::string& name, const T& value) {\n m_root->log_stat(name, value);\n}\n\n}\n\n<commit_msg>Only log stat messages in super-verbose mode<commit_after>#pragma once\n\n#include <tudocomp\/pre_header\/Registry.hpp>\n#include <tudocomp\/pre_header\/Env.hpp>\n\nnamespace tdc {\n\ninline AlgorithmValue& EnvRoot::algo_value() {\n return *m_algo_value;\n}\n\ninline Stat& EnvRoot::stat_current() {\n return m_stat_stack.empty() ? m_stat_root : m_stat_stack.top();\n}\n\ninline void EnvRoot::begin_stat_phase(const std::string& name) {\n VLOG(2) << \"begin phase \\\"\" << name << \"\\\"\";\n\n m_stat_stack.push(Stat(name));\n Stat& stat = m_stat_stack.top();\n stat.begin();\n}\n\ninline void EnvRoot::end_stat_phase() {\n DCHECK(!m_stat_stack.empty());\n\n Stat& stat_ref = m_stat_stack.top();\n VLOG(2) << \"end phase \\\"\" << stat_ref.title() << \"\\\"\";\n\n stat_ref.end();\n\n Stat stat = stat_ref; \/\/copy\n m_stat_stack.pop();\n\n if(!m_stat_stack.empty()) {\n Stat& parent = m_stat_stack.top();\n parent.add_sub(stat);\n } else {\n m_stat_root = stat;\n }\n}\n\ninline Stat& EnvRoot::finish_stats() {\n while(!m_stat_stack.empty()) {\n end_stat_phase();\n }\n\n return m_stat_root;\n}\n\ninline void EnvRoot::restart_stats(const std::string& root_name) {\n finish_stats();\n begin_stat_phase(root_name);\n}\n\ntemplate<class T>\ninline void EnvRoot::log_stat(const std::string& name, const T& value) {\n VLOG(2) << \"stat: \" << name << \" = \" << value;\n stat_current().add_stat(name, value);\n}\n\ninline Env::Env(Env&& other):\n m_root(std::move(other.m_root)),\n m_node(other.m_node),\n m_registry(std::move(other.m_registry)) {}\n\ninline Env::Env(std::shared_ptr<EnvRoot> root,\n const AlgorithmValue& node,\n const Registry& registry):\n m_root(root),\n m_node(node),\n m_registry(std::make_unique<Registry>(registry)) {}\n\ninline Env::~Env() = default;\n\ninline const AlgorithmValue& Env::algo() const {\n return m_node;\n}\n\ninline std::shared_ptr<EnvRoot>& Env::root() {\n return m_root;\n}\n\ninline const Registry& Env::registry() const {\n return *m_registry;\n}\n\ninline void Env::error(const std::string& msg) {\n throw std::runtime_error(msg);\n}\n\ninline Env Env::env_for_option(const std::string& option) {\n CHECK(algo().arguments().count(option) > 0);\n auto& a = algo().arguments().at(option).as_algorithm();\n\n return Env(m_root, a, registry());\n}\n\ninline const OptionValue& Env::option(const std::string& option) const {\n return algo().arguments().at(option);\n}\n\ninline void Env::begin_stat_phase(const std::string& name) {\n m_root->begin_stat_phase(name); \/\/delegate\n}\n\ninline void Env::end_stat_phase() {\n m_root->end_stat_phase(); \/\/delegate\n}\n\ninline Stat& Env::finish_stats() {\n return m_root->finish_stats(); \/\/delegate\n}\n\ninline void Env::restart_stats(const std::string& root_name) {\n m_root->restart_stats(root_name); \/\/delegate\n}\n\ntemplate<class T>\ninline void Env::log_stat(const std::string& name, const T& value) {\n m_root->log_stat(name, value);\n}\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * unap.cpp\n *\n * Created on: Apr 2, 2013\n * Author: nikita.karnauhov@gmail.com\n *\/\n\n#include \"unap.h\"\n#include \"formats.h\"\n#include \"exception.h\"\n\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <fcntl.h>\n#include <netinet\/in.h>\n#include <netdb.h>\n#include <poll.h>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <random>\n\nunsigned int UNAP::s_cSeed = 0;\nstd::default_random_engine UNAP::s_randomEngine = std::default_random_engine();\n\nUNAP::UNAP() :\n strHost(\"127.0.0.1\"), nPort(26751), nMTU(1500), m_nSockWorker(0), m_status(usStopped),\n m_nSocket(-1)\n{\n if (s_cSeed == 0) {\n try {\n std::random_device rd;\n s_cSeed = rd();\n } catch (...) {\n s_cSeed = Clock::now().time_since_epoch().count();\n }\n\n s_randomEngine.seed(s_cSeed);\n }\n\n _reset(true);\n _init_descriptors();\n}\n\nUNAP::~UNAP() {\n if (m_nSocket >= -1)\n close(m_nSocket);\n}\n\nUNAP::Status UNAP::get_status() const {\n return m_status;\n}\n\nvoid UNAP::start() {\n _reset(false);\n m_status = usRunning;\n m_startTime = Clock::now();\n m_worker = std::thread(_make_worker());\n}\n\nvoid UNAP::stop() {\n if (m_status & usRunning)\n _send_stop();\n\n m_status = usStopped;\n\n if (m_worker.joinable())\n m_worker.join();\n}\n\nsnd_pcm_sframes_t UNAP::get_buffer_pointer() const {\n if (!m_bPrepared)\n return 0;\n\n const snd_pcm_sframes_t frames = _estimate_frames();\n snd_pcm_sframes_t nPointer = std::min(frames, m_nPointer)%get_buffer_size();\n std::lock_guard<std::mutex> lock(m_mutex);\n\n if (nPointer == 0 && m_queue.empty() && m_nPointer > 0 && frames > 0)\n nPointer = get_buffer_size(); \/\/ Nothing more to play, buffer must have ran out.\n\n return nPointer;\n}\n\nsnd_pcm_sframes_t UNAP::transfer(const char *_pData, size_t _cOffset, size_t _cSize) {\n assert(m_bPrepared);\n\n std::lock_guard<std::mutex> lock(m_mutex);\n\n size_t cSizeBytes = std::min<size_t>(_cSize, get_buffer_size() - m_nAvail);\n\n _cSize = cSizeBytes;\n cSizeBytes *= get_bytes_per_frame();\n\n if (cSizeBytes == 0)\n return 0;\n\n char *pStart = m_pBuffer.get();\n char *pDest = m_queue.empty() ? m_pBuffer.get() : m_queue.back().second;\n const char *pSrc = _pData + _cOffset*get_bytes_per_frame();\n const size_t cBufferBytes = get_buffer_size()*get_bytes_per_frame();\n\n if (pDest < pStart + cBufferBytes) {\n const size_t cPart = std::min(cSizeBytes, cBufferBytes - (pDest - pStart));\n memcpy(pDest, pSrc, cPart);\n m_queue.emplace_back(pDest, pDest + cPart);\n cSizeBytes -= cPart;\n pSrc += cPart;\n assert(m_queue.back().second > m_queue.back().first);\n }\n\n if (cSizeBytes > 0) {\n assert(cSizeBytes < cBufferBytes);\n memcpy(pStart, pSrc, cSizeBytes);\n m_queue.emplace_back(pStart, pStart + cSizeBytes);\n assert(m_queue.back().second > m_queue.back().first);\n }\n\n m_nAvail += _cSize;\n\n return _cSize;\n}\n\nvoid UNAP::prepare() {\n _reset(true);\n m_nAvail = 0;\n m_strFormat = get_format_name(get_format());\n m_cBitsPerSample = snd_pcm_format_physical_width(get_format());\n assert(get_bytes_per_frame() > 0);\n assert(get_buffer_size() > 0);\n std::unique_ptr<char[]> pBuffer(new char[get_buffer_size()*get_bytes_per_frame()]);\n m_pBuffer = std::move(pBuffer);\n m_bPrepared = true;\n}\n\nvoid UNAP::drain() {\n assert(m_bPrepared);\n m_status = usStopping;\n if (m_worker.joinable())\n m_worker.join();\n}\n\nvoid UNAP::pause() {\n assert(m_bPrepared && m_status == usRunning);\n m_nLastFrames = _estimate_frames();\n m_status = usPaused;\n m_startTime = TimePoint();\n}\n\nvoid UNAP::unpause() {\n m_status = usRunning;\n m_startTime = Clock::now();\n}\n\nsnd_pcm_sframes_t UNAP::get_unplayed_frames() const {\n return m_nAvail; \/\/ TODO m_nPosition - estimateFrames\n}\n\nvoid UNAP::_reset(bool _bResetStreamParams) {\n m_nPointer = 0;\n m_nLastFrames = 0;\n m_startTime = TimePoint();\n m_cStreamId = s_randomEngine();\n\n if (_bResetStreamParams) {\n m_nAvail = 0;\n m_strFormat = \"\";\n m_cBitsPerSample = 0;\n m_queue.clear();\n m_bPrepared = false;\n }\n}\n\nvoid UNAP::_init_descriptors() {\n int fds[2];\n\n if (socketpair(AF_LOCAL, SOCK_STREAM, 0, fds) != 0)\n perror(__FUNCTION__);\n\n for (int fd : fds) {\n int fl;\n\n if ((fl = fcntl(fd, F_GETFL)) < 0) {\n perror(__FUNCTION__);\n break;\n }\n\n if (fl & O_NONBLOCK)\n break;\n\n if (fcntl(fd, F_SETFL, fl | O_NONBLOCK) < 0) {\n perror(__FUNCTION__);\n break;\n }\n }\n\n poll_fd = fds[0];\n m_nSockWorker = fds[1];\n poll_events = POLLIN;\n}\n\nsnd_pcm_sframes_t UNAP::_estimate_frames() const {\n if (m_status == usPaused)\n return m_nLastFrames;\n DurationMS ms(std::chrono::duration_cast<DurationMS>(Clock::now() - m_startTime));\n return m_nLastFrames + ms.count()*(get_rate()\/1000.0);\n}\n\nstd::function<void(void)> UNAP::_make_worker() {\n return [&]() {\n if (!m_nSockWorker)\n return;\n\n Status prev = usRunning;\n\n while (m_status & usRunning) {\n if (prev == usRunning && m_status == usPaused)\n _send_pause();\n else if (prev == usPaused && m_status == usRunning)\n _send_unpause();\n\n if (!m_queue.empty()) {\n std::lock_guard<std::mutex> lock(m_mutex);\n\n while (!m_queue.empty())\n _send_data();\n } else if (m_bPrepared && m_status == UNAP::usStopping && _estimate_frames() >= m_nPointer) {\n _send_stop();\n m_status = UNAP::usStopped;\n }\n\n char buf[1] = {0};\n write(m_nSockWorker, buf, 1);\n prev = m_status;\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n }\n };\n}\n\nvoid UNAP::_prepare_packet(unap::Packet &_packet, unap::Packet_Kind _kind,\n uint64_t _nTimestamp)\n{\n _packet.set_version(1);\n _packet.set_stream(m_cStreamId);\n _packet.set_kind(_kind);\n _packet.set_channels(get_channel_count());\n _packet.set_rate(get_rate());\n _packet.set_format(m_strFormat);\n _packet.set_timestamp(_nTimestamp);\n\n if (_kind != unap::Packet_Kind_DATA)\n _packet.set_samples(\"\");\n}\n\nvoid UNAP::_send_buffer(const void *_pBuf, size_t _cSize) {\n for (size_t cRetry = 0; cRetry < 5; ++cRetry) {\n if (send(m_nSocket, _pBuf, _cSize, 0) >= 0)\n break;\n\n if (errno != ECONNREFUSED)\n throw SystemError(\"send()\");\n\n std::this_thread::sleep_for(std::chrono::milliseconds(1));\n }\n}\n\nvoid UNAP::_send_packet(const unap::Packet &_packet) {\n auto pBuf = std::unique_ptr<char[]>(new char[this->nMTU]);\n assert(_packet.ByteSize() <= this->nMTU);\n _packet.SerializeToArray((void *)pBuf.get(), this->nMTU);\n _send_buffer((const void *)pBuf.get(), _packet.ByteSize());\n}\n\nvoid UNAP::_send_stop() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_STOP, _estimate_frames());\n _send_packet(packet);\n}\n\nvoid UNAP::_send_pause() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_PAUSE, _estimate_frames());\n _send_packet(packet);\n}\n\nvoid UNAP::_send_unpause() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_UNPAUSE, m_nLastFrames);\n _send_packet(packet);\n}\n\nvoid UNAP::_send_data() {\n unap::Packet packet;\n\n assert(m_queue.front().second > m_queue.front().first);\n assert(m_bPrepared);\n _prepare_packet(packet, unap::Packet_Kind_DATA, m_nPointer);\n\n const size_t cHeaderSize = packet.ByteSize() + 4; \/\/ Account for data length field.\n const size_t cFrameSize = get_bytes_per_frame();\n const size_t cTotal = ((this->nMTU - cHeaderSize)\/cFrameSize)*cFrameSize;\n size_t cBytes = cTotal;\n auto pBuf = std::unique_ptr<char[]>(new char[this->nMTU]); \/\/ Reuse as serialization buffer.\n char *pPos = pBuf.get();\n\n while (!m_queue.empty() && cBytes > 0) {\n char *pSource = m_queue.front().first;\n char *pEnd = m_queue.front().second;\n const size_t cAvailable = pEnd - pSource;\n\n if (cAvailable > 0) {\n const size_t c = std::min(cAvailable, (cBytes\/cFrameSize)*cFrameSize);\n\n \/\/ FIXME c may equal zero.\n memcpy(pPos, pSource, c);\n\n pSource += c;\n pPos += c;\n cBytes -= c;\n }\n\n m_queue.front().first = pSource;\n\n assert(m_queue.front().second >= m_queue.front().first);\n\n if (pSource == pEnd)\n m_queue.pop_front();\n }\n\n packet.set_samples((const void *)pBuf.get(), cTotal - cBytes);\n m_nPointer += (cTotal - cBytes)\/get_bytes_per_frame();\n m_nAvail -= (cTotal - cBytes)\/get_bytes_per_frame();\n\n \/\/ Send.\n assert(packet.ByteSize() <= this->nMTU);\n packet.SerializeToArray((void *)pBuf.get(), this->nMTU);\n _send_buffer((const void *)pBuf.get(), packet.ByteSize());\n}\n\nvoid UNAP::connect() {\n struct sockaddr_in name;\n\n if (m_nSocket >= 0)\n close(m_nSocket);\n\n m_nSocket = socket(PF_INET, SOCK_DGRAM, 0);\n\n if (m_nSocket < 0)\n throw SystemError(\"socket()\");\n\n name.sin_family = AF_INET;\n name.sin_port = htons(this->nPort);\n\n struct hostent *pHost = gethostbyname(this->strHost.c_str());\n\n if (!pHost)\n throw SystemError(\"gethostbyname()\");\n\n name.sin_addr = *(struct in_addr *)pHost->h_addr;\n\n if (::connect(m_nSocket, (struct sockaddr *)&name, sizeof(name)) < 0)\n throw SystemError(\"connect()\");\n}\n\nconst std::vector<unsigned int> &UNAP::get_format_values() {\n m_formatValues.clear();\n\n for (const std::string &strFormat : formats) {\n auto iFormat = g_formats.find(strFormat);\n\n if (iFormat != g_formats.end())\n m_formatValues.push_back(iFormat->second);\n }\n\n return m_formatValues;\n}\n\nunsigned int UNAP::get_channel_count() const {\n return this->channels;\n}\n\nsnd_pcm_uframes_t UNAP::get_buffer_size() const {\n return this->buffer_size;\n}\n\nsnd_pcm_uframes_t UNAP::get_period_size() const {\n return this->buffer_size;\n}\n\nsize_t UNAP::get_bytes_per_frame() const {\n return get_channel_count()*m_cBitsPerSample\/8;\n}\n\nsnd_pcm_format_t UNAP::get_format() const {\n return this->format;\n}\n\nunsigned int UNAP::get_rate() const {\n return this->rate;\n}\n<commit_msg>Use exceptions instead of perror().<commit_after>\/*\n * unap.cpp\n *\n * Created on: Apr 2, 2013\n * Author: nikita.karnauhov@gmail.com\n *\/\n\n#include \"unap.h\"\n#include \"formats.h\"\n#include \"exception.h\"\n\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <fcntl.h>\n#include <netinet\/in.h>\n#include <netdb.h>\n#include <poll.h>\n\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <random>\n\nunsigned int UNAP::s_cSeed = 0;\nstd::default_random_engine UNAP::s_randomEngine = std::default_random_engine();\n\nUNAP::UNAP() :\n strHost(\"127.0.0.1\"), nPort(26751), nMTU(1500), m_nSockWorker(0), m_status(usStopped),\n m_nSocket(-1)\n{\n if (s_cSeed == 0) {\n try {\n std::random_device rd;\n s_cSeed = rd();\n } catch (...) {\n s_cSeed = Clock::now().time_since_epoch().count();\n }\n\n s_randomEngine.seed(s_cSeed);\n }\n\n _reset(true);\n _init_descriptors();\n}\n\nUNAP::~UNAP() {\n if (m_nSocket >= -1)\n close(m_nSocket);\n}\n\nUNAP::Status UNAP::get_status() const {\n return m_status;\n}\n\nvoid UNAP::start() {\n _reset(false);\n m_status = usRunning;\n m_startTime = Clock::now();\n m_worker = std::thread(_make_worker());\n}\n\nvoid UNAP::stop() {\n if (m_status & usRunning)\n _send_stop();\n\n m_status = usStopped;\n\n if (m_worker.joinable())\n m_worker.join();\n}\n\nsnd_pcm_sframes_t UNAP::get_buffer_pointer() const {\n if (!m_bPrepared)\n return 0;\n\n const snd_pcm_sframes_t frames = _estimate_frames();\n snd_pcm_sframes_t nPointer = std::min(frames, m_nPointer)%get_buffer_size();\n std::lock_guard<std::mutex> lock(m_mutex);\n\n if (nPointer == 0 && m_queue.empty() && m_nPointer > 0 && frames > 0)\n nPointer = get_buffer_size(); \/\/ Nothing more to play, buffer must have ran out.\n\n return nPointer;\n}\n\nsnd_pcm_sframes_t UNAP::transfer(const char *_pData, size_t _cOffset, size_t _cSize) {\n assert(m_bPrepared);\n\n std::lock_guard<std::mutex> lock(m_mutex);\n\n size_t cSizeBytes = std::min<size_t>(_cSize, get_buffer_size() - m_nAvail);\n\n _cSize = cSizeBytes;\n cSizeBytes *= get_bytes_per_frame();\n\n if (cSizeBytes == 0)\n return 0;\n\n char *pStart = m_pBuffer.get();\n char *pDest = m_queue.empty() ? m_pBuffer.get() : m_queue.back().second;\n const char *pSrc = _pData + _cOffset*get_bytes_per_frame();\n const size_t cBufferBytes = get_buffer_size()*get_bytes_per_frame();\n\n if (pDest < pStart + cBufferBytes) {\n const size_t cPart = std::min(cSizeBytes, cBufferBytes - (pDest - pStart));\n memcpy(pDest, pSrc, cPart);\n m_queue.emplace_back(pDest, pDest + cPart);\n cSizeBytes -= cPart;\n pSrc += cPart;\n assert(m_queue.back().second > m_queue.back().first);\n }\n\n if (cSizeBytes > 0) {\n assert(cSizeBytes < cBufferBytes);\n memcpy(pStart, pSrc, cSizeBytes);\n m_queue.emplace_back(pStart, pStart + cSizeBytes);\n assert(m_queue.back().second > m_queue.back().first);\n }\n\n m_nAvail += _cSize;\n\n return _cSize;\n}\n\nvoid UNAP::prepare() {\n _reset(true);\n m_nAvail = 0;\n m_strFormat = get_format_name(get_format());\n m_cBitsPerSample = snd_pcm_format_physical_width(get_format());\n assert(get_bytes_per_frame() > 0);\n assert(get_buffer_size() > 0);\n std::unique_ptr<char[]> pBuffer(new char[get_buffer_size()*get_bytes_per_frame()]);\n m_pBuffer = std::move(pBuffer);\n m_bPrepared = true;\n}\n\nvoid UNAP::drain() {\n assert(m_bPrepared);\n m_status = usStopping;\n if (m_worker.joinable())\n m_worker.join();\n}\n\nvoid UNAP::pause() {\n assert(m_bPrepared && m_status == usRunning);\n m_nLastFrames = _estimate_frames();\n m_status = usPaused;\n m_startTime = TimePoint();\n}\n\nvoid UNAP::unpause() {\n m_status = usRunning;\n m_startTime = Clock::now();\n}\n\nsnd_pcm_sframes_t UNAP::get_unplayed_frames() const {\n return m_nAvail; \/\/ TODO m_nPosition - estimateFrames\n}\n\nvoid UNAP::_reset(bool _bResetStreamParams) {\n m_nPointer = 0;\n m_nLastFrames = 0;\n m_startTime = TimePoint();\n m_cStreamId = s_randomEngine();\n\n if (_bResetStreamParams) {\n m_nAvail = 0;\n m_strFormat = \"\";\n m_cBitsPerSample = 0;\n m_queue.clear();\n m_bPrepared = false;\n }\n}\n\nvoid UNAP::_init_descriptors() {\n int fds[2];\n\n if (socketpair(AF_LOCAL, SOCK_STREAM, 0, fds) != 0)\n throw SystemError(\"socketpair()\");\n\n for (int fd : fds) {\n int fl;\n\n if ((fl = fcntl(fd, F_GETFL)) < 0)\n throw SystemError(\"fcntl()\");\n\n if (fl & O_NONBLOCK)\n break;\n\n if (fcntl(fd, F_SETFL, fl | O_NONBLOCK) < 0)\n throw SystemError(\"fcntl()\");\n }\n\n poll_fd = fds[0];\n m_nSockWorker = fds[1];\n poll_events = POLLIN;\n}\n\nsnd_pcm_sframes_t UNAP::_estimate_frames() const {\n if (m_status == usPaused)\n return m_nLastFrames;\n DurationMS ms(std::chrono::duration_cast<DurationMS>(Clock::now() - m_startTime));\n return m_nLastFrames + ms.count()*(get_rate()\/1000.0);\n}\n\nstd::function<void(void)> UNAP::_make_worker() {\n return [&]() {\n if (!m_nSockWorker)\n return;\n\n Status prev = usRunning;\n\n while (m_status & usRunning) {\n if (prev == usRunning && m_status == usPaused)\n _send_pause();\n else if (prev == usPaused && m_status == usRunning)\n _send_unpause();\n\n if (!m_queue.empty()) {\n std::lock_guard<std::mutex> lock(m_mutex);\n\n while (!m_queue.empty())\n _send_data();\n } else if (m_bPrepared && m_status == UNAP::usStopping && _estimate_frames() >= m_nPointer) {\n _send_stop();\n m_status = UNAP::usStopped;\n }\n\n char buf[1] = {0};\n write(m_nSockWorker, buf, 1);\n prev = m_status;\n std::this_thread::sleep_for(std::chrono::milliseconds(100));\n }\n };\n}\n\nvoid UNAP::_prepare_packet(unap::Packet &_packet, unap::Packet_Kind _kind,\n uint64_t _nTimestamp)\n{\n _packet.set_version(1);\n _packet.set_stream(m_cStreamId);\n _packet.set_kind(_kind);\n _packet.set_channels(get_channel_count());\n _packet.set_rate(get_rate());\n _packet.set_format(m_strFormat);\n _packet.set_timestamp(_nTimestamp);\n\n if (_kind != unap::Packet_Kind_DATA)\n _packet.set_samples(\"\");\n}\n\nvoid UNAP::_send_buffer(const void *_pBuf, size_t _cSize) {\n for (size_t cRetry = 0; cRetry < 5; ++cRetry) {\n if (send(m_nSocket, _pBuf, _cSize, 0) >= 0)\n break;\n\n if (errno != ECONNREFUSED)\n throw SystemError(\"send()\");\n\n std::this_thread::sleep_for(std::chrono::milliseconds(1));\n }\n}\n\nvoid UNAP::_send_packet(const unap::Packet &_packet) {\n auto pBuf = std::unique_ptr<char[]>(new char[this->nMTU]);\n assert(_packet.ByteSize() <= this->nMTU);\n _packet.SerializeToArray((void *)pBuf.get(), this->nMTU);\n _send_buffer((const void *)pBuf.get(), _packet.ByteSize());\n}\n\nvoid UNAP::_send_stop() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_STOP, _estimate_frames());\n _send_packet(packet);\n}\n\nvoid UNAP::_send_pause() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_PAUSE, _estimate_frames());\n _send_packet(packet);\n}\n\nvoid UNAP::_send_unpause() {\n unap::Packet packet;\n _prepare_packet(packet, unap::Packet_Kind_UNPAUSE, m_nLastFrames);\n _send_packet(packet);\n}\n\nvoid UNAP::_send_data() {\n unap::Packet packet;\n\n assert(m_queue.front().second > m_queue.front().first);\n assert(m_bPrepared);\n _prepare_packet(packet, unap::Packet_Kind_DATA, m_nPointer);\n\n const size_t cHeaderSize = packet.ByteSize() + 4; \/\/ Account for data length field.\n const size_t cFrameSize = get_bytes_per_frame();\n const size_t cTotal = ((this->nMTU - cHeaderSize)\/cFrameSize)*cFrameSize;\n size_t cBytes = cTotal;\n auto pBuf = std::unique_ptr<char[]>(new char[this->nMTU]); \/\/ Reuse as serialization buffer.\n char *pPos = pBuf.get();\n\n while (!m_queue.empty() && cBytes > 0) {\n char *pSource = m_queue.front().first;\n char *pEnd = m_queue.front().second;\n const size_t cAvailable = pEnd - pSource;\n\n if (cAvailable > 0) {\n const size_t c = std::min(cAvailable, (cBytes\/cFrameSize)*cFrameSize);\n\n \/\/ FIXME c may equal zero.\n memcpy(pPos, pSource, c);\n\n pSource += c;\n pPos += c;\n cBytes -= c;\n }\n\n m_queue.front().first = pSource;\n\n assert(m_queue.front().second >= m_queue.front().first);\n\n if (pSource == pEnd)\n m_queue.pop_front();\n }\n\n packet.set_samples((const void *)pBuf.get(), cTotal - cBytes);\n m_nPointer += (cTotal - cBytes)\/get_bytes_per_frame();\n m_nAvail -= (cTotal - cBytes)\/get_bytes_per_frame();\n\n \/\/ Send.\n assert(packet.ByteSize() <= this->nMTU);\n packet.SerializeToArray((void *)pBuf.get(), this->nMTU);\n _send_buffer((const void *)pBuf.get(), packet.ByteSize());\n}\n\nvoid UNAP::connect() {\n struct sockaddr_in name;\n\n if (m_nSocket >= 0)\n close(m_nSocket);\n\n m_nSocket = socket(PF_INET, SOCK_DGRAM, 0);\n\n if (m_nSocket < 0)\n throw SystemError(\"socket()\");\n\n name.sin_family = AF_INET;\n name.sin_port = htons(this->nPort);\n\n struct hostent *pHost = gethostbyname(this->strHost.c_str());\n\n if (!pHost)\n throw SystemError(\"gethostbyname()\");\n\n name.sin_addr = *(struct in_addr *)pHost->h_addr;\n\n if (::connect(m_nSocket, (struct sockaddr *)&name, sizeof(name)) < 0)\n throw SystemError(\"connect()\");\n}\n\nconst std::vector<unsigned int> &UNAP::get_format_values() {\n m_formatValues.clear();\n\n for (const std::string &strFormat : formats) {\n auto iFormat = g_formats.find(strFormat);\n\n if (iFormat != g_formats.end())\n m_formatValues.push_back(iFormat->second);\n }\n\n return m_formatValues;\n}\n\nunsigned int UNAP::get_channel_count() const {\n return this->channels;\n}\n\nsnd_pcm_uframes_t UNAP::get_buffer_size() const {\n return this->buffer_size;\n}\n\nsnd_pcm_uframes_t UNAP::get_period_size() const {\n return this->buffer_size;\n}\n\nsize_t UNAP::get_bytes_per_frame() const {\n return get_channel_count()*m_cBitsPerSample\/8;\n}\n\nsnd_pcm_format_t UNAP::get_format() const {\n return this->format;\n}\n\nunsigned int UNAP::get_rate() const {\n return this->rate;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file variant.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief Variant class that represents a subtype of\n\/\/\/ boost::variant that can hold integer\/bool\/double\/string values.\n\/\/----------------------------------------------------------------------------\n\/\/ Created: 2010-07-10\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (C) 2010 Serge Aleynikov <saleyn@gmail.com>\n\nThis library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\nLesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n***** END LICENSE BLOCK *****\n*\/\n\n\n#ifndef _UTXX_VARIANT_HPP_\n#define _UTXX_VARIANT_HPP_\n\n#include <boost\/variant.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/find.hpp>\n#include <boost\/mpl\/if.hpp>\n#include <boost\/mpl\/joint_view.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n#include <boost\/static_assert.hpp>\n#include <boost\/cstdint.hpp>\n#include <boost\/property_tree\/detail\/info_parser_utils.hpp>\n#include <stdexcept>\n#include <string.h>\n#include <stdio.h>\n\nnamespace utxx {\n\nstruct null {};\n\nclass variant: public boost::variant<null, bool, long, double, std::string>\n{\n typedef boost::variant <null, bool, long, double, std::string> base;\n typedef boost::mpl::vector<null, bool, long, double, std::string> internal_types;\n\n struct string_visitor: public boost::static_visitor<std::string> {\n std::string operator () (null v) const { return \"<NULL>\"; }\n std::string operator () (bool v) const { return v ? \"true\" : \"false\"; }\n std::string operator () (long v) const { return std::to_string(v); }\n std::string operator () (double v) const {\n char buf[128];\n snprintf(buf, sizeof(buf)-1, \"%f\", v);\n \/\/ Remove trailing zeros.\n for (char* p = buf+strlen(buf); p > buf && *(p-1) != '.'; p--)\n if (*p == '0')\n *p = '\\0';\n return buf;\n }\n std::string operator () (const std::string& v) const { return v; }\n };\n\n template <typename T>\n T get(T*) const { return boost::get<T>(*this); }\n const variant& get(variant*) const { return *this; }\n variant& get(variant*) { return *this; }\npublic:\n typedef boost::mpl::vector<\n int,int16_t,long,uint16_t,uint32_t,uint64_t> int_types;\n\n typedef boost::mpl::joint_view<\n int_types,\n boost::mpl::vector<null,bool,double,std::string>\n > valid_types;\n\n typedef boost::mpl::joint_view<\n int_types,\n boost::mpl::vector<null,bool,double,std::string,variant>\n > valid_get_types;\n\n \/\/ For integers - cast them all to long type\n template <typename T>\n class normal_type {\n typedef typename boost::mpl::find<int_types, T>::type int_iter;\n public:\n typedef\n typename boost::mpl::if_\n <boost::is_same<boost::mpl::end<int_types>::type, int_iter>,\n T, long>::type\n type;\n };\n\n enum value_type {\n TYPE_NULL\n , TYPE_BOOL\n , TYPE_INT\n , TYPE_DOUBLE\n , TYPE_STRING\n };\n\n variant() : base(null()) {}\n explicit variant(bool a) : base(a) {}\n explicit variant(int16_t a) : base((long)a) {}\n explicit variant(int a) : base((long)a) {}\n explicit variant(long a) : base(a) {}\n explicit variant(uint16_t a) : base((long)a) {}\n explicit variant(uint32_t a) : base((long)a) {}\n explicit variant(uint64_t a) : base((long)a) {}\n explicit variant(double a) : base(a) {}\n\n template <class Ch>\n variant(const std::basic_string<Ch>& a) : base(to_std_string<Ch>(a)) {}\n variant(const char* a) : base(std::string(a)) {}\n variant(const std::string& a) : base(a) {}\n\n variant(const variant& a) : base((const base&)a) {}\n\n#if __cplusplus >= 201103L\n variant(variant&& a) { swap(a); }\n variant& operator=(variant&& a) { clear(); swap(a); return *this; }\n#endif\n\n variant(value_type v, const std::string& a) { from_string(v, a); }\n\n void operator= (const variant& a) { *(base*)this = (const base&)a; }\n \/\/void operator= (null a) { *(base*)this = null(); }\n void operator= (int16_t a) { *(base*)this = (long)a; }\n void operator= (int a) { *(base*)this = (long)a; }\n void operator= (int64_t a) { *(base*)this = (long)a; }\n void operator= (uint16_t a) { *(base*)this = (long)a; }\n void operator= (uint32_t a) { *(base*)this = (long)a; }\n void operator= (uint64_t a) { *(base*)this = (long)a; }\n void operator= (const char* a) { *(base*)this = std::string(a); }\n void operator= (const std::string& a) { *(base*)this = a; }\n void operator= (bool a) { variant b(a); *this = b; }\n\n template <typename T>\n void operator= (T a) {\n typedef typename boost::mpl::find<valid_types, T>::type type_iter;\n BOOST_STATIC_ASSERT(\n (!boost::is_same<\n boost::mpl::end<valid_types>::type,\n type_iter >::value)\n );\n *(base*)this = a;\n }\n\n void operator+= (int16_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (int a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (int64_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint16_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint32_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint64_t a) { *(base*)this = is_null() ? (long)a : to_int()+(long)a; }\n void operator+= (double a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (const char* a) { *(base*)this = is_null() ? a : to_str() + a; }\n void operator+= (const std::string& a) { *(base*)this = is_null() ? a : to_str() + a; }\n\n template <typename T>\n void operator+= (T a) { throw std::runtime_error(\"Operation not supported!\"); }\n\n value_type type() const { return static_cast<value_type>(which()); }\n const char* type_str() const {\n static const char* s_types[] = { \"null\", \"bool\", \"int\", \"double\", \"string\" };\n return s_types[type()];\n }\n\n \/\/\/ Set value to null.\n void clear() { *(base*)this = null(); }\n\n \/\/\/ Returns true if the value is null.\n bool is_null() const { return type() == TYPE_NULL; }\n bool is_bool() const { return type() == TYPE_BOOL; }\n bool is_int() const { return type() == TYPE_INT; }\n bool is_double() const { return type() == TYPE_DOUBLE; }\n bool is_string() const { return type() == TYPE_STRING; }\n\n template <typename T>\n bool is_type() const {\n variant::type_visitor<T> v;\n return boost::apply_visitor(v, *this);\n }\n\n bool to_bool() const { return boost::get<bool>(*this); }\n long to_int() const { return boost::get<long>(*this); }\n long to_float() const { return boost::get<double>(*this); }\n const std::string& to_str() const { return boost::get<std::string>(*this); }\n const char* c_str() const { return boost::get<std::string>(\n *this).c_str(); }\n\n \/\/\/ Returns true if the variant doesn't contain a value or it's an empty string\n bool empty(bool a_check_empty_string = true) const {\n return is_null() || (a_check_empty_string && is_string() && to_str().empty());\n }\n\n \/\/\/ Convert value to string.\n std::string to_string() const {\n variant::string_visitor v;\n return boost::apply_visitor(v, *this);\n }\n\n template <typename T>\n T get() const {\n \/\/ Make sure given type is a valid variant type.\n \/\/ Note to user: an error raised here indicates that\n \/\/ there's a compile-time attempt to convert a variant to \n \/\/ unsupported type.\n typedef typename boost::mpl::find<valid_get_types, T>::type valid_iter;\n BOOST_STATIC_ASSERT(\n (!boost::is_same<boost::mpl::end<valid_get_types>::type, valid_iter>::value));\n \/\/ For integers - cast them to long type when fetching from the variant.\n typename normal_type<T>::type* dummy(NULL);\n return get(dummy);\n }\n\n const variant& get() const { return *this; }\n\n void from_string(value_type v, const std::string& a) {\n switch (v) {\n case TYPE_NULL: *this = null(); break;\n case TYPE_BOOL: *this = a == \"true\" || a == \"yes\"; break;\n case TYPE_INT: *this = boost::lexical_cast<long>(a); break;\n case TYPE_DOUBLE: *this = boost::lexical_cast<double>(a); break;\n case TYPE_STRING: *this = a;\n default: throw_type_error(type());\n }\n }\n\n bool operator== (const variant& rhs) const {\n if (type() != rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return true;\n case TYPE_BOOL: return to_bool() == rhs.to_bool();\n case TYPE_INT: return to_int() == rhs.to_int();\n case TYPE_DOUBLE: return to_float() == rhs.to_float();\n case TYPE_STRING: return to_str() == rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\n bool operator< (const variant& rhs) const {\n if (type() < rhs.type()) return true;\n if (type() > rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return false;\n case TYPE_BOOL: return to_bool() < rhs.to_bool();\n case TYPE_INT: return to_int() < rhs.to_int();\n case TYPE_DOUBLE: return to_float() < rhs.to_float();\n case TYPE_STRING: return to_str() < rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\n bool operator> (const variant& rhs) const {\n if (type() > rhs.type()) return true;\n if (type() < rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return false;\n case TYPE_BOOL: return to_bool() > rhs.to_bool();\n case TYPE_INT: return to_int() > rhs.to_int();\n case TYPE_DOUBLE: return to_float() > rhs.to_float();\n case TYPE_STRING: return to_str() > rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\nprivate:\n static void throw_type_error(value_type v) {\n std::stringstream s;\n s << \"Unknown type \" << v;\n throw std::runtime_error(s.str());\n }\n\n static std::string to_std_string(const std::basic_string<char>& a) {\n return a;\n }\n\n template <class Ch>\n static std::string to_std_string(const std::basic_string<Ch>& a) {\n return boost::property_tree::info_parser::convert_chtype<char, Ch>(a);\n }\n\n template <typename U>\n struct type_visitor: public boost::static_visitor<bool> {\n typedef typename normal_type<U>::type Type;\n bool operator() (Type v) const { return true; }\n\n template <typename T>\n bool operator() (T v) const { return false; }\n };\n};\n\nstatic inline std::ostream& operator<< (std::ostream& out, const variant& a) {\n return out << a.to_string();\n}\n\n} \/\/ namespace utxx\n\n#endif \/\/ _UTXX_VARIANT_HPP_\n<commit_msg>Bug fix variant::to_float()<commit_after>\/\/----------------------------------------------------------------------------\n\/\/\/ \\file variant.hpp\n\/\/\/ \\author Serge Aleynikov\n\/\/----------------------------------------------------------------------------\n\/\/\/ \\brief Variant class that represents a subtype of\n\/\/\/ boost::variant that can hold integer\/bool\/double\/string values.\n\/\/----------------------------------------------------------------------------\n\/\/ Created: 2010-07-10\n\/\/----------------------------------------------------------------------------\n\/*\n***** BEGIN LICENSE BLOCK *****\n\nThis file is part of the utxx open-source project.\n\nCopyright (C) 2010 Serge Aleynikov <saleyn@gmail.com>\n\nThis library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\nLesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public\nLicense along with this library; if not, write to the Free Software\nFoundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n***** END LICENSE BLOCK *****\n*\/\n\n\n#ifndef _UTXX_VARIANT_HPP_\n#define _UTXX_VARIANT_HPP_\n\n#include <boost\/variant.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <boost\/mpl\/vector.hpp>\n#include <boost\/mpl\/find.hpp>\n#include <boost\/mpl\/if.hpp>\n#include <boost\/mpl\/joint_view.hpp>\n#include <boost\/type_traits\/is_same.hpp>\n#include <boost\/static_assert.hpp>\n#include <boost\/cstdint.hpp>\n#include <boost\/property_tree\/detail\/info_parser_utils.hpp>\n#include <stdexcept>\n#include <string.h>\n#include <stdio.h>\n\nnamespace utxx {\n\nstruct null {};\n\nclass variant: public boost::variant<null, bool, long, double, std::string>\n{\n typedef boost::variant <null, bool, long, double, std::string> base;\n typedef boost::mpl::vector<null, bool, long, double, std::string> internal_types;\n\n struct string_visitor: public boost::static_visitor<std::string> {\n std::string operator () (null v) const { return \"<NULL>\"; }\n std::string operator () (bool v) const { return v ? \"true\" : \"false\"; }\n std::string operator () (long v) const { return std::to_string(v); }\n std::string operator () (double v) const {\n char buf[128];\n snprintf(buf, sizeof(buf)-1, \"%f\", v);\n \/\/ Remove trailing zeros.\n for (char* p = buf+strlen(buf); p > buf && *(p-1) != '.'; p--)\n if (*p == '0')\n *p = '\\0';\n return buf;\n }\n std::string operator () (const std::string& v) const { return v; }\n };\n\n template <typename T>\n T get(T*) const { return boost::get<T>(*this); }\n const variant& get(variant*) const { return *this; }\n variant& get(variant*) { return *this; }\npublic:\n typedef boost::mpl::vector<\n int,int16_t,long,uint16_t,uint32_t,uint64_t> int_types;\n\n typedef boost::mpl::joint_view<\n int_types,\n boost::mpl::vector<null,bool,double,std::string>\n > valid_types;\n\n typedef boost::mpl::joint_view<\n int_types,\n boost::mpl::vector<null,bool,double,std::string,variant>\n > valid_get_types;\n\n \/\/ For integers - cast them all to long type\n template <typename T>\n class normal_type {\n typedef typename boost::mpl::find<int_types, T>::type int_iter;\n public:\n typedef\n typename boost::mpl::if_\n <boost::is_same<boost::mpl::end<int_types>::type, int_iter>,\n T, long>::type\n type;\n };\n\n enum value_type {\n TYPE_NULL\n , TYPE_BOOL\n , TYPE_INT\n , TYPE_DOUBLE\n , TYPE_STRING\n };\n\n variant() : base(null()) {}\n explicit variant(bool a) : base(a) {}\n explicit variant(int16_t a) : base((long)a) {}\n explicit variant(int a) : base((long)a) {}\n explicit variant(long a) : base(a) {}\n explicit variant(uint16_t a) : base((long)a) {}\n explicit variant(uint32_t a) : base((long)a) {}\n explicit variant(uint64_t a) : base((long)a) {}\n explicit variant(double a) : base(a) {}\n\n template <class Ch>\n variant(const std::basic_string<Ch>& a) : base(to_std_string<Ch>(a)) {}\n variant(const char* a) : base(std::string(a)) {}\n variant(const std::string& a) : base(a) {}\n\n variant(const variant& a) : base((const base&)a) {}\n\n#if __cplusplus >= 201103L\n variant(variant&& a) { swap(a); }\n variant& operator=(variant&& a) { clear(); swap(a); return *this; }\n#endif\n\n variant(value_type v, const std::string& a) { from_string(v, a); }\n\n void operator= (const variant& a) { *(base*)this = (const base&)a; }\n \/\/void operator= (null a) { *(base*)this = null(); }\n void operator= (int16_t a) { *(base*)this = (long)a; }\n void operator= (int a) { *(base*)this = (long)a; }\n void operator= (int64_t a) { *(base*)this = (long)a; }\n void operator= (uint16_t a) { *(base*)this = (long)a; }\n void operator= (uint32_t a) { *(base*)this = (long)a; }\n void operator= (uint64_t a) { *(base*)this = (long)a; }\n void operator= (const char* a) { *(base*)this = std::string(a); }\n void operator= (const std::string& a) { *(base*)this = a; }\n void operator= (bool a) { variant b(a); *this = b; }\n\n template <typename T>\n void operator= (T a) {\n typedef typename boost::mpl::find<valid_types, T>::type type_iter;\n BOOST_STATIC_ASSERT(\n (!boost::is_same<\n boost::mpl::end<valid_types>::type,\n type_iter >::value)\n );\n *(base*)this = a;\n }\n\n void operator+= (int16_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (int a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (int64_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint16_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint32_t a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (uint64_t a) { *(base*)this = is_null() ? (long)a : to_int()+(long)a; }\n void operator+= (double a) { *(base*)this = is_null() ? a : to_int() + a; }\n void operator+= (const char* a) { *(base*)this = is_null() ? a : to_str() + a; }\n void operator+= (const std::string& a) { *(base*)this = is_null() ? a : to_str() + a; }\n\n template <typename T>\n void operator+= (T a) { throw std::runtime_error(\"Operation not supported!\"); }\n\n value_type type() const { return static_cast<value_type>(which()); }\n const char* type_str() const {\n static const char* s_types[] = { \"null\", \"bool\", \"int\", \"double\", \"string\" };\n return s_types[type()];\n }\n\n \/\/\/ Set value to null.\n void clear() { *(base*)this = null(); }\n\n \/\/\/ Returns true if the value is null.\n bool is_null() const { return type() == TYPE_NULL; }\n bool is_bool() const { return type() == TYPE_BOOL; }\n bool is_int() const { return type() == TYPE_INT; }\n bool is_double() const { return type() == TYPE_DOUBLE; }\n bool is_string() const { return type() == TYPE_STRING; }\n\n template <typename T>\n bool is_type() const {\n variant::type_visitor<T> v;\n return boost::apply_visitor(v, *this);\n }\n\n bool to_bool() const { return boost::get<bool>(*this); }\n long to_int() const { return boost::get<long>(*this); }\n double to_float() const { return boost::get<double>(*this); }\n double to_double() const { return boost::get<double>(*this); }\n const std::string& to_str() const { return boost::get<std::string>(*this); }\n const char* c_str() const { return boost::get<std::string>(\n *this).c_str(); }\n\n \/\/\/ Returns true if the variant doesn't contain a value or it's an empty string\n bool empty(bool a_check_empty_string = true) const {\n return is_null() || (a_check_empty_string && is_string() && to_str().empty());\n }\n\n \/\/\/ Convert value to string.\n std::string to_string() const {\n variant::string_visitor v;\n return boost::apply_visitor(v, *this);\n }\n\n template <typename T>\n T get() const {\n \/\/ Make sure given type is a valid variant type.\n \/\/ Note to user: an error raised here indicates that\n \/\/ there's a compile-time attempt to convert a variant to \n \/\/ unsupported type.\n typedef typename boost::mpl::find<valid_get_types, T>::type valid_iter;\n BOOST_STATIC_ASSERT(\n (!boost::is_same<boost::mpl::end<valid_get_types>::type, valid_iter>::value));\n \/\/ For integers - cast them to long type when fetching from the variant.\n typename normal_type<T>::type* dummy(NULL);\n return get(dummy);\n }\n\n const variant& get() const { return *this; }\n\n void from_string(value_type v, const std::string& a) {\n switch (v) {\n case TYPE_NULL: *this = null(); break;\n case TYPE_BOOL: *this = a == \"true\" || a == \"yes\"; break;\n case TYPE_INT: *this = boost::lexical_cast<long>(a); break;\n case TYPE_DOUBLE: *this = boost::lexical_cast<double>(a); break;\n case TYPE_STRING: *this = a;\n default: throw_type_error(type());\n }\n }\n\n bool operator== (const variant& rhs) const {\n if (type() != rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return true;\n case TYPE_BOOL: return to_bool() == rhs.to_bool();\n case TYPE_INT: return to_int() == rhs.to_int();\n case TYPE_DOUBLE: return to_float() == rhs.to_float();\n case TYPE_STRING: return to_str() == rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\n bool operator< (const variant& rhs) const {\n if (type() < rhs.type()) return true;\n if (type() > rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return false;\n case TYPE_BOOL: return to_bool() < rhs.to_bool();\n case TYPE_INT: return to_int() < rhs.to_int();\n case TYPE_DOUBLE: return to_float() < rhs.to_float();\n case TYPE_STRING: return to_str() < rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\n bool operator> (const variant& rhs) const {\n if (type() > rhs.type()) return true;\n if (type() < rhs.type()) return false;\n switch (type()) {\n case TYPE_NULL: return false;\n case TYPE_BOOL: return to_bool() > rhs.to_bool();\n case TYPE_INT: return to_int() > rhs.to_int();\n case TYPE_DOUBLE: return to_float() > rhs.to_float();\n case TYPE_STRING: return to_str() > rhs.to_str();\n default: throw_type_error(type());\n return false; \/\/ just to pease the compiler\n }\n }\n\nprivate:\n static void throw_type_error(value_type v) {\n std::stringstream s;\n s << \"Unknown type \" << v;\n throw std::runtime_error(s.str());\n }\n\n static std::string to_std_string(const std::basic_string<char>& a) {\n return a;\n }\n\n template <class Ch>\n static std::string to_std_string(const std::basic_string<Ch>& a) {\n return boost::property_tree::info_parser::convert_chtype<char, Ch>(a);\n }\n\n template <typename U>\n struct type_visitor: public boost::static_visitor<bool> {\n typedef typename normal_type<U>::type Type;\n bool operator() (Type v) const { return true; }\n\n template <typename T>\n bool operator() (T v) const { return false; }\n };\n};\n\nstatic inline std::ostream& operator<< (std::ostream& out, const variant& a) {\n return out << a.to_string();\n}\n\n} \/\/ namespace utxx\n\n#endif \/\/ _UTXX_VARIANT_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <cassert>\n\n#include \"logger.hpp\"\n#include \"lexer.hpp\"\n#include \"parser.hpp\"\n#include \"environment.hpp\"\n#include \"interpreter.hpp\"\n\n\/\/ conver a double value to percent\nstd::string format_probability(double prob)\n{\n if (prob < 0.0001 && prob != 0)\n {\n return \"< 0.01 %\";\n }\n return std::to_string(prob * 100) + \" %\"; \n}\n\n\/\/ value formatting functions\n\nvoid print(int value)\n{\n std::cout << value << std::endl;\n}\n\nvoid print(double value)\n{\n std::cout << value << std::endl;\n}\n\ntemplate<typename ValueType, typename ProbabilityType>\nvoid print(\n const dice::random_variable_decomposition<ValueType, ProbabilityType>& var)\n{\n const int width_value = 10;\n const int width_prob = 15;\n const int width_cdf = 15;\n\n std::cout << std::endl\n << \"\\e[1m\" << std::setw(width_value) << \"Value\" \n << \"\\e[1m\" << std::setw(width_prob) << \"PMF\" \n << \"\\e[1m\" << std::setw(width_cdf) << \"CDF\" \n << \"\\e[0m\" \n << std::endl;\n\n ProbabilityType sum = 0;\n for (auto&& pair : var.probability())\n {\n std::cout \n << std::setw(width_value) << pair.first \n << std::setw(width_prob) << format_probability(pair.second)\n << std::setw(width_cdf) << format_probability(sum)\n << std::endl;\n sum += pair.second;\n }\n}\n\n\/** Print computed value.\n * @param computed value\n *\/\nvoid print_value(const dice::base_value* value)\n{\n if (value == nullptr)\n {\n return;\n }\n\n \/\/ print value\n auto int_value = dynamic_cast<const dice::type_int*>(value);\n if (int_value != nullptr)\n {\n print(int_value->data());\n return;\n }\n \n auto double_value = dynamic_cast<const dice::type_double*>(value);\n if (double_value != nullptr)\n {\n print(double_value->data());\n return;\n }\n\n auto var_value = dynamic_cast<const dice::type_rand_var*>(value);\n if (var_value != nullptr)\n {\n print(var_value->data());\n return;\n }\n\n throw std::runtime_error(\"Unknown value.\");\n}\n\n\nstruct options\n{\n \/\/ Command line arguments\n std::vector<std::string> args;\n \/\/ Input stream\n std::istream* input;\n \/\/ Should we print the executed script?\n bool verbose;\n\n options(int argc, char** argv) : \n args(argv, argv + argc), \n input(nullptr),\n verbose(false)\n {\n parse();\n }\nprivate:\n std::ifstream input_file_;\n std::stringstream input_mem_;\n\n void parse()\n {\n auto it = args.begin() + 1; \/\/ first arg is the file path\n \n bool load_from_file = false;\n for (; it != args.end(); ++it)\n {\n if (*it == \"-f\") \/\/ input file\n {\n assert(it + 1 != args.end());\n ++it;\n input_file_.open(*it);\n input = &input_file_;\n load_from_file = true;\n }\n else if (*it == \"-v\")\n {\n verbose = true;\n }\n else \n {\n break;\n }\n }\n\n \/\/ load from arguments - concatenate the rest of the args\n if (!load_from_file && it != args.end())\n {\n std::string expr = *it++;\n for (; it != args.end(); ++it)\n expr += \" \" + *it;\n input_mem_ = std::stringstream{ expr };\n input = &input_mem_;\n }\n }\n};\n\nint main(int argc, char** argv)\n{\n options opt{ argc, argv };\n\n if (opt.input != nullptr)\n {\n \/\/ parse and interpret the expression\n dice::logger log;\n dice::lexer lexer{ opt.input, &log };\n dice::environment env;\n dice::interpreter<dice::environment> interpret{ &env };\n auto parser = dice::make_parser(&lexer, &log, &interpret);\n auto result = parser.parse(); \n\n for (auto&& value : result)\n {\n std::string expr;\n std::getline(interpret.code(), expr);\n if (value != nullptr || opt.verbose)\n {\n std::cout << expr;\n if (value != nullptr)\n std::cout << \": \";\n }\n print_value(value.get());\n if (value != nullptr)\n {\n std::cout << std::endl;\n }\n }\n }\n else \n {\n std::cerr << \"Dice expressions interpreter.\" << std::endl \n << std::endl\n << \"Usage:\" << std::endl \n << \" .\/dice_cli [options] [expression]\" << std::endl\n << std::endl\n << \" [options]:\" << std::endl\n << \" -f <file> load expression from file\" << std::endl\n << \" -v verbose output (show executed script)\" << std::endl\n << std::endl\n << \" [expression]:\" << std::endl\n << \" A dice expression. Can be in multiple arguments.\" << std::endl\n << \" The program will join them wih a space.\" << std::endl;\n return 1;\n }\n return 0;\n}<commit_msg>Add newline after definition in verbose mode<commit_after>#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <cassert>\n\n#include \"logger.hpp\"\n#include \"lexer.hpp\"\n#include \"parser.hpp\"\n#include \"environment.hpp\"\n#include \"interpreter.hpp\"\n\n\/\/ conver a double value to percent\nstd::string format_probability(double prob)\n{\n if (prob < 0.0001 && prob != 0)\n {\n return \"< 0.01 %\";\n }\n return std::to_string(prob * 100) + \" %\"; \n}\n\n\/\/ value formatting functions\n\nvoid print(int value)\n{\n std::cout << value << std::endl;\n}\n\nvoid print(double value)\n{\n std::cout << value << std::endl;\n}\n\ntemplate<typename ValueType, typename ProbabilityType>\nvoid print(\n const dice::random_variable_decomposition<ValueType, ProbabilityType>& var)\n{\n const int width_value = 10;\n const int width_prob = 15;\n const int width_cdf = 15;\n\n std::cout << std::endl\n << \"\\e[1m\" << std::setw(width_value) << \"Value\" \n << \"\\e[1m\" << std::setw(width_prob) << \"PMF\" \n << \"\\e[1m\" << std::setw(width_cdf) << \"CDF\" \n << \"\\e[0m\" \n << std::endl;\n\n ProbabilityType sum = 0;\n for (auto&& pair : var.probability())\n {\n std::cout \n << std::setw(width_value) << pair.first \n << std::setw(width_prob) << format_probability(pair.second)\n << std::setw(width_cdf) << format_probability(sum)\n << std::endl;\n sum += pair.second;\n }\n}\n\n\/** Print computed value.\n * @param computed value\n *\/\nvoid print_value(const dice::base_value* value)\n{\n if (value == nullptr)\n {\n return;\n }\n\n \/\/ print value\n auto int_value = dynamic_cast<const dice::type_int*>(value);\n if (int_value != nullptr)\n {\n print(int_value->data());\n return;\n }\n \n auto double_value = dynamic_cast<const dice::type_double*>(value);\n if (double_value != nullptr)\n {\n print(double_value->data());\n return;\n }\n\n auto var_value = dynamic_cast<const dice::type_rand_var*>(value);\n if (var_value != nullptr)\n {\n print(var_value->data());\n return;\n }\n\n throw std::runtime_error(\"Unknown value.\");\n}\n\n\nstruct options\n{\n \/\/ Command line arguments\n std::vector<std::string> args;\n \/\/ Input stream\n std::istream* input;\n \/\/ Should we print the executed script?\n bool verbose;\n\n options(int argc, char** argv) : \n args(argv, argv + argc), \n input(nullptr),\n verbose(false)\n {\n parse();\n }\nprivate:\n std::ifstream input_file_;\n std::stringstream input_mem_;\n\n void parse()\n {\n auto it = args.begin() + 1; \/\/ first arg is the file path\n \n bool load_from_file = false;\n for (; it != args.end(); ++it)\n {\n if (*it == \"-f\") \/\/ input file\n {\n assert(it + 1 != args.end());\n ++it;\n input_file_.open(*it);\n input = &input_file_;\n load_from_file = true;\n }\n else if (*it == \"-v\")\n {\n verbose = true;\n }\n else \n {\n break;\n }\n }\n\n \/\/ load from arguments - concatenate the rest of the args\n if (!load_from_file && it != args.end())\n {\n std::string expr = *it++;\n for (; it != args.end(); ++it)\n expr += \" \" + *it;\n input_mem_ = std::stringstream{ expr };\n input = &input_mem_;\n }\n }\n};\n\nint main(int argc, char** argv)\n{\n options opt{ argc, argv };\n\n if (opt.input != nullptr)\n {\n \/\/ parse and interpret the expression\n dice::logger log;\n dice::lexer lexer{ opt.input, &log };\n dice::environment env;\n dice::interpreter<dice::environment> interpret{ &env };\n auto parser = dice::make_parser(&lexer, &log, &interpret);\n auto result = parser.parse(); \n\n for (auto&& value : result)\n {\n std::string expr;\n std::getline(interpret.code(), expr);\n if (value != nullptr || opt.verbose)\n {\n std::cout << expr;\n if (value != nullptr)\n std::cout << \": \";\n }\n print_value(value.get());\n if (value != nullptr || opt.verbose)\n {\n std::cout << std::endl;\n }\n }\n }\n else \n {\n std::cerr << \"Dice expressions interpreter.\" << std::endl \n << std::endl\n << \"Usage:\" << std::endl \n << \" .\/dice_cli [options] [expression]\" << std::endl\n << std::endl\n << \" [options]:\" << std::endl\n << \" -f <file> load expression from file\" << std::endl\n << \" -v verbose output (show executed script)\" << std::endl\n << std::endl\n << \" [expression]:\" << std::endl\n << \" A dice expression. Can be in multiple arguments.\" << std::endl\n << \" The program will join them wih a space.\" << std::endl;\n return 1;\n }\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 1999-2009 Soeren Sonnenburg\n * Written (W) 1999-2008 Gunnar Raetsch\n * Copyright (C) 1999-2009 Fraunhofer Institute FIRST and Max-Planck-Society\n *\/\n\n#include \"features\/Features.h\"\n#include \"preproc\/PreProc.h\"\n#include \"lib\/io.h\"\n#include \"base\/Parameter.h\"\n\n#include <string.h>\n\nusing namespace shogun;\n\nCFeatures::CFeatures(int32_t size)\n: CSGObject()\n{\n\tinit();\n\tcache_size = size;\n}\n\nCFeatures::CFeatures(const CFeatures& orig)\n: CSGObject(orig)\n{\n\tinit();\n\n\tpreproc = orig.preproc;\n\tnum_preproc = orig.num_preproc;\n\n\tpreprocessed=new bool[orig.num_preproc];\n\tmemcpy(preprocessed, orig.preprocessed, sizeof(bool)*orig.num_preproc);\n}\n\nCFeatures::CFeatures(CFile* loader)\n: CSGObject()\n{\n\tinit();\n\n\tload(loader);\n\tSG_INFO(\"Feature object loaded (%p)\\n\",this) ;\n}\n\nCFeatures::~CFeatures()\n{\n\tif (m_subset_idx)\n\t\tdelete[] m_subset_idx;\n\n\tclean_preprocs();\n}\n\nvoid\nCFeatures::init(void)\n{\n\tm_parameters->add(&properties, \"properties\",\n\t\t\t\t\t \"Feature properties.\");\n\tm_parameters->add(&cache_size, \"cache_size\",\n\t\t\t\t\t \"Size of cache in MB.\");\n\n\tm_parameters->add_vector((CSGObject***) &preproc,\n\t\t\t\t\t\t\t &num_preproc, \"preproc\",\n\t\t\t\t\t\t\t \"List of preprocessors.\");\n\tm_parameters->add_vector(&preprocessed,\n\t\t\t\t\t\t\t &num_preproc, \"preprocessed\",\n\t\t\t\t\t\t\t \"Feature[i] is already preprocessed.\");\n\n\tm_parameters->add_vector(&m_subset_idx, &m_subset_len, \"subset_idx\", \"Subset indices.\");\n\n\n\tproperties = FP_NONE;\n\tcache_size = 0;\n\tpreproc = NULL;\n\tnum_preproc = 0;\n\tpreprocessed = NULL;\n\tm_subset_idx = NULL;\n\tm_subset_len = 0;\n}\n\n\/\/\/ set preprocessor\nint32_t CFeatures::add_preproc(CPreProc* p)\n{\n\tSG_INFO( \"%d preprocs currently, new preproc list is\\n\", num_preproc);\n\tASSERT(p);\n\n\tbool* preprocd=new bool[num_preproc+1];\n\tCPreProc** pps=new CPreProc*[num_preproc+1];\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t{\n\t\tpps[i]=preproc[i];\n\t\tpreprocd[i]=preprocessed[i];\n\t}\n\tdelete[] preproc;\n\tdelete[] preprocessed;\n\tpreproc=pps;\n\tpreprocessed=preprocd;\n\tpreproc[num_preproc]=p;\n\tpreprocessed[num_preproc]=false;\n\n\tnum_preproc++;\n\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t\tSG_INFO( \"preproc[%d]=%s %ld\\n\",i, preproc[i]->get_name(), preproc[i]) ;\n\n\tSG_REF(p);\n\n\treturn num_preproc;\n}\n\n\/\/\/ get current preprocessor\nCPreProc* CFeatures::get_preproc(int32_t num)\n{\n\tif (num<num_preproc)\n\t{\n\t\tSG_REF(preproc[num]);\n\t\treturn preproc[num];\n\t}\n\telse\n\t\treturn NULL;\n}\n\n\/\/\/ get whether specified preprocessor (or all if num=1) was\/were already applied\nint32_t CFeatures::get_num_preprocessed()\n{\n\tint32_t num=0;\n\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t{\n\t\tif (preprocessed[i])\n\t\t\tnum++;\n\t}\n\n\treturn num;\n}\n\n\/\/\/ clears all preprocs\nvoid CFeatures::clean_preprocs()\n{\n\twhile (del_preproc(0));\n}\n\n\/\/\/ del current preprocessor\nCPreProc* CFeatures::del_preproc(int32_t num)\n{\n\tCPreProc** pps=NULL;\n\tbool* preprocd=NULL;\n\tCPreProc* removed_preproc=NULL;\n\n\tif (num_preproc>0 && num<num_preproc)\n\t{\n\t\tremoved_preproc=preproc[num];\n\n\t\tif (num_preproc>1)\n\t\t{\n\t\t\tpps= new CPreProc*[num_preproc-1];\n\t\t\tpreprocd= new bool[num_preproc-1];\n\n\t\t\tif (pps && preprocd)\n\t\t\t{\n\t\t\t\tint32_t j=0;\n\t\t\t\tfor (int32_t i=0; i<num_preproc; i++)\n\t\t\t\t{\n\t\t\t\t\tif (i!=num)\n\t\t\t\t\t{\n\t\t\t\t\t\tpps[j]=preproc[i];\n\t\t\t\t\t\tpreprocd[j]=preprocessed[i];\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdelete[] preproc;\n\t\tpreproc=pps;\n\t\tdelete[] preprocessed;\n\t\tpreprocessed=preprocd;\n\n\t\tnum_preproc--;\n\n\t\tfor (int32_t i=0; i<num_preproc; i++)\n\t\t\tSG_INFO( \"preproc[%d]=%s\\n\",i, preproc[i]->get_name()) ;\n\t}\n\n\tSG_UNREF(removed_preproc);\n\treturn removed_preproc;\n}\n\nvoid CFeatures::list_feature_obj()\n{\n\tSG_INFO( \"%p - \", this);\n\tswitch (get_feature_class())\n\t{\n\t\tcase C_UNKNOWN:\n\t\t\tSG_INFO( \"C_UNKNOWN \");\n\t\t\tbreak;\n\t\tcase C_SIMPLE:\n\t\t\tSG_INFO( \"C_SIMPLE \");\n\t\t\tbreak;\n\t\tcase C_SPARSE:\n\t\t\tSG_INFO( \"C_SPARSE \");\n\t\t\tbreak;\n\t\tcase C_STRING:\n\t\t\tSG_INFO( \"C_STRING \");\n\t\t\tbreak;\n\t\tcase C_COMBINED:\n\t\t\tSG_INFO( \"C_COMBINED \");\n\t\t\tbreak;\n\t\tcase C_COMBINED_DOT:\n\t\t\tSG_INFO( \"C_COMBINED_DOT \");\n\t\t\tbreak;\n\t\tcase C_WD:\n\t\t\tSG_INFO( \"C_WD \");\n\t\t\tbreak;\n\t\tcase C_SPEC:\n\t\t\tSG_INFO( \"C_SPEC \");\n\t\t\tbreak;\n\t\tcase C_WEIGHTEDSPEC:\n\t\t\tSG_INFO( \"C_WEIGHTEDSPEC \");\n\t\t\tbreak;\n\t\tcase C_ANY:\n\t\t\tSG_INFO( \"C_ANY \");\n\t\t\tbreak;\n\t\tdefault:\n SG_ERROR( \"ERROR UNKNOWN FEATURE CLASS\");\n\t}\n\n\tswitch (get_feature_type())\n\t{\n\t\tcase F_UNKNOWN:\n\t\t\tSG_INFO( \"F_UNKNOWN \\n\");\n\t\t\tbreak;\n\t\tcase F_CHAR:\n\t\t\tSG_INFO( \"F_CHAR \\n\");\n\t\t\tbreak;\n\t\tcase F_BYTE:\n\t\t\tSG_INFO( \"F_BYTE \\n\");\n\t\t\tbreak;\n\t\tcase F_SHORT:\n\t\t\tSG_INFO( \"F_SHORT \\n\");\n\t\t\tbreak;\n\t\tcase F_WORD:\n\t\t\tSG_INFO( \"F_WORD \\n\");\n\t\t\tbreak;\n\t\tcase F_INT:\n\t\t\tSG_INFO( \"F_INT \\n\");\n\t\t\tbreak;\n\t\tcase F_UINT:\n\t\t\tSG_INFO( \"F_UINT \\n\");\n\t\t\tbreak;\n\t\tcase F_LONG:\n\t\t\tSG_INFO( \"F_LONG \\n\");\n\t\t\tbreak;\n\t\tcase F_ULONG:\n\t\t\tSG_INFO( \"F_ULONG \\n\");\n\t\t\tbreak;\n\t\tcase F_SHORTREAL:\n\t\t\tSG_INFO( \"F_SHORTEAL \\n\");\n\t\t\tbreak;\n\t\tcase F_DREAL:\n\t\t\tSG_INFO( \"F_DREAL \\n\");\n\t\t\tbreak;\n\t\tcase F_LONGREAL:\n\t\t\tSG_INFO( \"F_LONGREAL \\n\");\n\t\t\tbreak;\n\t\tcase F_ANY:\n\t\t\tSG_INFO( \"F_ANY \\n\");\n\t\t\tbreak;\n\t\tdefault:\n SG_ERROR( \"ERROR UNKNOWN FEATURE TYPE\\n\");\n\t}\n}\n\nbool CFeatures::check_feature_compatibility(CFeatures* f)\n{\n\tbool result=false;\n\n\tif (f)\n\t\tresult= ( (this->get_feature_class() == f->get_feature_class()) &&\n\t\t\t\t(this->get_feature_type() == f->get_feature_type()));\n\treturn result;\n}\n\nvoid CFeatures::set_feature_subset(int32_t subset_len, int32_t* subset_idx)\n{\n\tif (m_subset_idx)\n\t\tdelete[] m_subset_idx;\n\n\tm_subset_idx=subset_idx;\n\tm_subset_len=subset_len;\n}\n\nvoid CFeatures::set_feature_subset(int32_t* subset_idx, int32_t subset_len)\n{\n\tASSERT(subset_idx);\n\n\tif (m_subset_idx)\n\t{\n\t\tdelete[] m_subset_idx;\n\t\tm_subset_idx = NULL;\n\t}\n\n\tint64_t length=sizeof(int32_t)*subset_len;\n\n\tm_subset_idx=(int32_t*)malloc(length);\n\tif (!m_subset_idx)\n\t\tSG_ERROR(\"Allocating %ld bytes failes\\n\", length);\n\n\tmemcpy(m_subset_idx, subset_idx, length);\n}\n\nvoid CFeatures::remove_feature_subset()\n{\n\tif (!m_subset_idx)\n\t{\n\t\tdelete[] m_subset_idx;\n\t\tm_subset_idx=NULL;\n\t\tm_subset_len=0;\n\t}\n}\n\nvoid CFeatures::get_feature_subset(int32_t** subset_idx, int32_t* subset_len)\n{\n\tASSERT(m_subset_idx);\n\tint64_t length = sizeof(int32_t)*m_subset_len;\n\n\t*subset_len=m_subset_len;\n\t*subset_idx=(int32_t*)malloc(length);\n\tif (!*subset_idx)\n\t\tSG_ERROR(\"Allocating %ld bytes failes\\n\", length);\n\tmemcpy(*subset_idx, m_subset_idx, length);\n}\n<commit_msg>remove unnecessary NULL check<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 1999-2009 Soeren Sonnenburg\n * Written (W) 1999-2008 Gunnar Raetsch\n * Copyright (C) 1999-2009 Fraunhofer Institute FIRST and Max-Planck-Society\n *\/\n\n#include \"features\/Features.h\"\n#include \"preproc\/PreProc.h\"\n#include \"lib\/io.h\"\n#include \"base\/Parameter.h\"\n\n#include <string.h>\n\nusing namespace shogun;\n\nCFeatures::CFeatures(int32_t size)\n: CSGObject()\n{\n\tinit();\n\tcache_size = size;\n}\n\nCFeatures::CFeatures(const CFeatures& orig)\n: CSGObject(orig)\n{\n\tinit();\n\n\tpreproc = orig.preproc;\n\tnum_preproc = orig.num_preproc;\n\n\tpreprocessed=new bool[orig.num_preproc];\n\tmemcpy(preprocessed, orig.preprocessed, sizeof(bool)*orig.num_preproc);\n}\n\nCFeatures::CFeatures(CFile* loader)\n: CSGObject()\n{\n\tinit();\n\n\tload(loader);\n\tSG_INFO(\"Feature object loaded (%p)\\n\",this) ;\n}\n\nCFeatures::~CFeatures()\n{\n\tif (m_subset_idx)\n\t\tdelete[] m_subset_idx;\n\n\tclean_preprocs();\n}\n\nvoid\nCFeatures::init(void)\n{\n\tm_parameters->add(&properties, \"properties\",\n\t\t\t\t\t \"Feature properties.\");\n\tm_parameters->add(&cache_size, \"cache_size\",\n\t\t\t\t\t \"Size of cache in MB.\");\n\n\tm_parameters->add_vector((CSGObject***) &preproc,\n\t\t\t\t\t\t\t &num_preproc, \"preproc\",\n\t\t\t\t\t\t\t \"List of preprocessors.\");\n\tm_parameters->add_vector(&preprocessed,\n\t\t\t\t\t\t\t &num_preproc, \"preprocessed\",\n\t\t\t\t\t\t\t \"Feature[i] is already preprocessed.\");\n\n\tm_parameters->add_vector(&m_subset_idx, &m_subset_len, \"subset_idx\", \"Subset indices.\");\n\n\n\tproperties = FP_NONE;\n\tcache_size = 0;\n\tpreproc = NULL;\n\tnum_preproc = 0;\n\tpreprocessed = NULL;\n\tm_subset_idx = NULL;\n\tm_subset_len = 0;\n}\n\n\/\/\/ set preprocessor\nint32_t CFeatures::add_preproc(CPreProc* p)\n{\n\tSG_INFO( \"%d preprocs currently, new preproc list is\\n\", num_preproc);\n\tASSERT(p);\n\n\tbool* preprocd=new bool[num_preproc+1];\n\tCPreProc** pps=new CPreProc*[num_preproc+1];\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t{\n\t\tpps[i]=preproc[i];\n\t\tpreprocd[i]=preprocessed[i];\n\t}\n\tdelete[] preproc;\n\tdelete[] preprocessed;\n\tpreproc=pps;\n\tpreprocessed=preprocd;\n\tpreproc[num_preproc]=p;\n\tpreprocessed[num_preproc]=false;\n\n\tnum_preproc++;\n\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t\tSG_INFO( \"preproc[%d]=%s %ld\\n\",i, preproc[i]->get_name(), preproc[i]) ;\n\n\tSG_REF(p);\n\n\treturn num_preproc;\n}\n\n\/\/\/ get current preprocessor\nCPreProc* CFeatures::get_preproc(int32_t num)\n{\n\tif (num<num_preproc)\n\t{\n\t\tSG_REF(preproc[num]);\n\t\treturn preproc[num];\n\t}\n\telse\n\t\treturn NULL;\n}\n\n\/\/\/ get whether specified preprocessor (or all if num=1) was\/were already applied\nint32_t CFeatures::get_num_preprocessed()\n{\n\tint32_t num=0;\n\n\tfor (int32_t i=0; i<num_preproc; i++)\n\t{\n\t\tif (preprocessed[i])\n\t\t\tnum++;\n\t}\n\n\treturn num;\n}\n\n\/\/\/ clears all preprocs\nvoid CFeatures::clean_preprocs()\n{\n\twhile (del_preproc(0));\n}\n\n\/\/\/ del current preprocessor\nCPreProc* CFeatures::del_preproc(int32_t num)\n{\n\tCPreProc** pps=NULL;\n\tbool* preprocd=NULL;\n\tCPreProc* removed_preproc=NULL;\n\n\tif (num_preproc>0 && num<num_preproc)\n\t{\n\t\tremoved_preproc=preproc[num];\n\n\t\tif (num_preproc>1)\n\t\t{\n\t\t\tpps= new CPreProc*[num_preproc-1];\n\t\t\tpreprocd= new bool[num_preproc-1];\n\n\t\t\tif (pps && preprocd)\n\t\t\t{\n\t\t\t\tint32_t j=0;\n\t\t\t\tfor (int32_t i=0; i<num_preproc; i++)\n\t\t\t\t{\n\t\t\t\t\tif (i!=num)\n\t\t\t\t\t{\n\t\t\t\t\t\tpps[j]=preproc[i];\n\t\t\t\t\t\tpreprocd[j]=preprocessed[i];\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdelete[] preproc;\n\t\tpreproc=pps;\n\t\tdelete[] preprocessed;\n\t\tpreprocessed=preprocd;\n\n\t\tnum_preproc--;\n\n\t\tfor (int32_t i=0; i<num_preproc; i++)\n\t\t\tSG_INFO( \"preproc[%d]=%s\\n\",i, preproc[i]->get_name()) ;\n\t}\n\n\tSG_UNREF(removed_preproc);\n\treturn removed_preproc;\n}\n\nvoid CFeatures::list_feature_obj()\n{\n\tSG_INFO( \"%p - \", this);\n\tswitch (get_feature_class())\n\t{\n\t\tcase C_UNKNOWN:\n\t\t\tSG_INFO( \"C_UNKNOWN \");\n\t\t\tbreak;\n\t\tcase C_SIMPLE:\n\t\t\tSG_INFO( \"C_SIMPLE \");\n\t\t\tbreak;\n\t\tcase C_SPARSE:\n\t\t\tSG_INFO( \"C_SPARSE \");\n\t\t\tbreak;\n\t\tcase C_STRING:\n\t\t\tSG_INFO( \"C_STRING \");\n\t\t\tbreak;\n\t\tcase C_COMBINED:\n\t\t\tSG_INFO( \"C_COMBINED \");\n\t\t\tbreak;\n\t\tcase C_COMBINED_DOT:\n\t\t\tSG_INFO( \"C_COMBINED_DOT \");\n\t\t\tbreak;\n\t\tcase C_WD:\n\t\t\tSG_INFO( \"C_WD \");\n\t\t\tbreak;\n\t\tcase C_SPEC:\n\t\t\tSG_INFO( \"C_SPEC \");\n\t\t\tbreak;\n\t\tcase C_WEIGHTEDSPEC:\n\t\t\tSG_INFO( \"C_WEIGHTEDSPEC \");\n\t\t\tbreak;\n\t\tcase C_ANY:\n\t\t\tSG_INFO( \"C_ANY \");\n\t\t\tbreak;\n\t\tdefault:\n SG_ERROR( \"ERROR UNKNOWN FEATURE CLASS\");\n\t}\n\n\tswitch (get_feature_type())\n\t{\n\t\tcase F_UNKNOWN:\n\t\t\tSG_INFO( \"F_UNKNOWN \\n\");\n\t\t\tbreak;\n\t\tcase F_CHAR:\n\t\t\tSG_INFO( \"F_CHAR \\n\");\n\t\t\tbreak;\n\t\tcase F_BYTE:\n\t\t\tSG_INFO( \"F_BYTE \\n\");\n\t\t\tbreak;\n\t\tcase F_SHORT:\n\t\t\tSG_INFO( \"F_SHORT \\n\");\n\t\t\tbreak;\n\t\tcase F_WORD:\n\t\t\tSG_INFO( \"F_WORD \\n\");\n\t\t\tbreak;\n\t\tcase F_INT:\n\t\t\tSG_INFO( \"F_INT \\n\");\n\t\t\tbreak;\n\t\tcase F_UINT:\n\t\t\tSG_INFO( \"F_UINT \\n\");\n\t\t\tbreak;\n\t\tcase F_LONG:\n\t\t\tSG_INFO( \"F_LONG \\n\");\n\t\t\tbreak;\n\t\tcase F_ULONG:\n\t\t\tSG_INFO( \"F_ULONG \\n\");\n\t\t\tbreak;\n\t\tcase F_SHORTREAL:\n\t\t\tSG_INFO( \"F_SHORTEAL \\n\");\n\t\t\tbreak;\n\t\tcase F_DREAL:\n\t\t\tSG_INFO( \"F_DREAL \\n\");\n\t\t\tbreak;\n\t\tcase F_LONGREAL:\n\t\t\tSG_INFO( \"F_LONGREAL \\n\");\n\t\t\tbreak;\n\t\tcase F_ANY:\n\t\t\tSG_INFO( \"F_ANY \\n\");\n\t\t\tbreak;\n\t\tdefault:\n SG_ERROR( \"ERROR UNKNOWN FEATURE TYPE\\n\");\n\t}\n}\n\nbool CFeatures::check_feature_compatibility(CFeatures* f)\n{\n\tbool result=false;\n\n\tif (f)\n\t\tresult= ( (this->get_feature_class() == f->get_feature_class()) &&\n\t\t\t\t(this->get_feature_type() == f->get_feature_type()));\n\treturn result;\n}\n\nvoid CFeatures::set_feature_subset(int32_t subset_len, int32_t* subset_idx)\n{\n\tif (m_subset_idx)\n\t\tdelete[] m_subset_idx;\n\n\tm_subset_idx=subset_idx;\n\tm_subset_len=subset_len;\n}\n\nvoid CFeatures::set_feature_subset(int32_t* subset_idx, int32_t subset_len)\n{\n\tASSERT(subset_idx);\n\n\tdelete[] m_subset_idx;\n\tm_subset_idx = NULL;\n\n\tint64_t length=sizeof(int32_t)*subset_len;\n\n\tm_subset_idx=(int32_t*)malloc(length);\n\tif (!m_subset_idx)\n\t\tSG_ERROR(\"Allocating %ld bytes failes\\n\", length);\n\n\tmemcpy(m_subset_idx, subset_idx, length);\n}\n\nvoid CFeatures::remove_feature_subset()\n{\n\tif (!m_subset_idx)\n\t{\n\t\tdelete[] m_subset_idx;\n\t\tm_subset_idx=NULL;\n\t\tm_subset_len=0;\n\t}\n}\n\nvoid CFeatures::get_feature_subset(int32_t** subset_idx, int32_t* subset_len)\n{\n\tASSERT(m_subset_idx);\n\tint64_t length = sizeof(int32_t)*m_subset_len;\n\n\t*subset_len=m_subset_len;\n\t*subset_idx=(int32_t*)malloc(length);\n\tif (!*subset_idx)\n\t\tSG_ERROR(\"Allocating %ld bytes failes\\n\", length);\n\tmemcpy(*subset_idx, m_subset_idx, length);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ taskwarrior - a command line task list manager.\n\/\/\n\/\/ Copyright 2006-2012, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define L10N \/\/ Localization complete.\n\n#include <iostream>\n#include <stdlib.h>\n\n#ifdef CYGWIN\n#include <time.h>\n#else\n#include <sys\/time.h>\n#endif\n\n#include <i18n.h>\n#include <Context.h>\n#include <cmake.h>\n\nContext context;\n\n#ifdef HAVE_SRANDOM\n#define srand(x) srandom(x)\n#endif\n\nint main (int argc, const char** argv)\n{\n \/\/ Set up randomness.\n#ifdef CYGWIN\n srand (time (NULL));\n#else\n struct timeval tv;\n gettimeofday (&tv, NULL);\n srand (tv.tv_usec);\n#endif\n\n int status = 0;\n\n try\n {\n status = context.initialize (argc, argv);\n if (status == 0)\n status = context.run ();\n }\n\n catch (std::string& error)\n {\n std::cout << error << \"\\n\";\n status = -1;\n }\n\n catch (...)\n {\n std::cerr << STRING_UNKNOWN_ERROR << \"\\n\";\n status = -2;\n }\n\n return status;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<commit_msg>Bug #902 - 'task version' requires a .taskrc<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ taskwarrior - a command line task list manager.\n\/\/\n\/\/ Copyright 2006-2012, Paul Beckingham, Federico Hernandez.\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\/\/ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/\n\/\/ http:\/\/www.opensource.org\/licenses\/mit-license.php\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#define L10N \/\/ Localization complete.\n\n#include <iostream>\n#include <stdlib.h>\n\n#ifdef CYGWIN\n#include <time.h>\n#else\n#include <sys\/time.h>\n#endif\n\n#include <i18n.h>\n#include <Context.h>\n#include <cmake.h>\n\nContext context;\n\n#ifdef HAVE_SRANDOM\n#define srand(x) srandom(x)\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint main (int argc, const char** argv)\n{\n \/\/ Set up randomness.\n#ifdef CYGWIN\n srand (time (NULL));\n#else\n struct timeval tv;\n gettimeofday (&tv, NULL);\n srand (tv.tv_usec);\n#endif\n\n int status = 0;\n\n if (argc == 2 && !strcmp (argv[1], \"--version\"))\n {\n std::cout << VERSION << \"\\n\";\n }\n else\n {\n try\n {\n status = context.initialize (argc, argv);\n if (status == 0)\n status = context.run ();\n }\n\n catch (std::string& error)\n {\n std::cout << error << \"\\n\";\n status = -1;\n }\n\n catch (...)\n {\n std::cerr << STRING_UNKNOWN_ERROR << \"\\n\";\n status = -2;\n }\n }\n\n return status;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\r\n\/\/ main.cpp\r\n\/\/\r\n\/\/ main for pathed\r\n\/\/\r\n\/\/ Copyright (C) 2011 Neil Butterworth\r\n\/\/----------------------------------------------------------------------------\r\n\r\n#include <iostream>\r\n#include <set>\r\n#include \"cmdline.h\"\r\n#include \"error.h\"\r\n#include \"registry.h\"\r\n#include \"util.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Flags controling behaviour in various ways.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const ADD_FLAG = \"-a\";\t\t\t\/\/ add to path\r\nconst char * const REM_FLAG = \"-r\";\t\t\t\/\/ remove from path\r\nconst char * const SYS_FLAG = \"-s\";\t\t\t\/\/ use system instead of user path\r\nconst char * const EXIST_FLAG = \"-f\";\t\t\/\/ check path exists on disk\r\nconst char * const LIST_FLAG = \"-l\";\t\t\/\/ list current path\r\nconst char * const QUERY_FLAG = \"-q\";\t\t\/\/ list current path\r\nconst char * const VERIFY_FLAG = \"-v\";\t\t\/\/ verify path\r\nconst char * const EXPAND_FLAG = \"-x\";\t\t\/\/ expand path\r\nconst char * const PRUNE_FLAG = \"-p\";\t\t\/\/ prune path\r\n\r\nstatic bool Remove = false,\r\n\t\t\tAdd = false,\r\n\t\t\tUseSys = false,\r\n\t\t\tList = false,\r\n\t\t\tCheckExist = true,\r\n\t\t\tQueryPath = false,\r\n\t\t\tVerify = false,\r\n\t\t\tExpand = false,\r\n\t\t\tPrune = false;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Set flags from the command line, shifting them off as they are set.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid SetFlags( CmdLine & cl ) {\r\n\twhile( cl.Argc() > 1 ) {\r\n\t\tstring s = cl.Argv(1);\r\n\t\tif ( s.size() && s[0] == '-' ) {\r\n\t\t\tif ( s == REM_FLAG ) {\r\n\t\t\t\tRemove = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == PRUNE_FLAG ){\r\n\t\t\t\tPrune = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == ADD_FLAG ) {\r\n\t\t\t\tAdd = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == SYS_FLAG ) {\r\n\t\t\t\tUseSys = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXPAND_FLAG ) {\r\n\t\t\t\tExpand = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXIST_FLAG ) {\r\n\t\t\t\tCheckExist = false;\r\n\t\t\t}\r\n\t\t\telse if ( s == LIST_FLAG ) {\r\n\t\t\t\tList = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == QUERY_FLAG ) {\r\n\t\t\t\tQueryPath = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == VERIFY_FLAG ) {\r\n\t\t\t\tVerify = true;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tthrow Error( \"Invalid flag: \" + s );\r\n\t\t\t}\r\n\t\t\tcl.Shift(1);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ List PATH to stdout, one directory per line\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid ListPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tcout << ( Expand ? ExpandPath( path.At(i) ) : path.At(i) ) << \"\\n\";\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Add an entry to the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid AddPath( CmdLine & cl ) {\r\n\tif ( CheckExist ) {\r\n\t\tDWORD attr = GetFileAttributes( cl.Argv(1).c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES || ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tthrow Error( \"No such directory: \" + cl.Argv(1));\r\n\t\t}\r\n\t}\r\n\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( path.Find( cl.Argv(1), RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is already on the path\" );\r\n\t}\r\n\tpath.Add( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Remove entry from the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid RemovePath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( ! path.Find( cl.Argv(1) , RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is not on the path\" );\r\n\t}\r\n\tpath.Remove( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Prune duplicates and non-existent dirs from path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid PrunePath( CmdLine & ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\r\n\ttypedef std::set <string> DirSet;\r\n\tDirSet uniq;\r\n\tstd::vector <string> ordered;\r\n\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring dir = path.At( i );\r\n\t\tstd::pair<DirSet::iterator, bool> ok = uniq.insert( dir );\r\n\t\tif ( ok.second ) {\r\n\t\t\tordered.push_back( dir );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Pruned: \" << dir << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tstring entry;\r\n\r\n\tfor ( unsigned int i = 0; i < ordered.size(); i++ ) {\r\n\t\tstring dir = ExpandPath( ordered[i] );\r\n\t\tDWORD attr = GetFileAttributes( dir.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ||\r\n\t\t\t\t\t\t! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Pruned: \" << ordered[i] << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tif ( entry != \"\" ) {\r\n\t\t\t\tentry += \";\";\r\n\t\t\t}\r\n\t\t\tentry += ordered[i];\r\n\t\t}\r\n\r\n\t}\r\n\tpath.ReplaceAll( entry );\r\n\tstd::cout << entry << std::endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ See if directory is on the path, if so return success code (not boolean!)\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint FindPath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\treturn path.Find( cl.Argv(1), Expand ? RegPath::Expand : RegPath::NoExpand ) ? 0 : 1;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Verify directories on path exist.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint VerifyPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tint bad = 0;\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring epath = ExpandPath( path.At(i) );\r\n\t\tDWORD attr = GetFileAttributes( epath.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ) {\r\n\t\t\tcout << \"No such directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t\telse if ( ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Not a directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t}\r\n\treturn bad == 0 ? 0 : 1;\r\n}\r\n\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Display help\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Help() {\r\n\r\n\tcout <<\r\n\r\n\t\"pathed is a command-line tool for changing the Windows path in the registry\\n\"\r\n\t\"Version 0.4\\n\"\r\n\t\"Copyright (C) 2011 Neil Butterworth\\n\\n\"\r\n\t\"usage: pathed [-a | -r | -l | -q | -v] [-s] [-f] [-x] [dir]\\n\\n\"\r\n\t\"pathed -a dir adds dir to the path in the registry\\n\"\r\n\t\"pathed -r dir removes dir from the path in the registry\\n\"\r\n\t\"pathed -l lists the entries on the current path\\n\"\r\n\t\"pathed -q dir queries registry, returns 0 if dir is on path, 1 otherwise\\n\"\r\n\t\"pathed -v verifies that all directories on the path exist\\n\"\r\n\t\"pathed -p prunes the path by removing duplicates and non-existent directories\\n\\n\"\r\n\t\"By default, pathed works on the path in HKEY_CURRENT_USER. You can make it use\\n\"\r\n\t\"the system path in HKEY_LOCAL_MACHINE by using the -s flag.\\n\\n\"\r\n\t\"Normally, pathed will check a directory exists on disk before adding it to the\\n\"\r\n\t\"path. To prevent this, use the -f flag.\\n\\n\"\r\n\t\"Paths containing environment variables such as %systemroot% will not normally have\\n\"\r\n\t\"the variables expanded to their values. To expand them, use the -x flag\\n\\n\"\r\n\t\"AS WITH ALL COMMANDS THAT CHANGE THE REGISTRY, PATHED CAN CAUSE DAMAGE IF YOU\\n\"\r\n\t\"DO NOT KNOW WHAT YOU ARE DOING. IF IN DOUBT, DO NOT USE IT!\\n\"\r\n\r\n\t<< endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Main for pathed\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n\ttry {\r\n\t\tCmdLine cl( argc, argv );\r\n\r\n\t\tSetFlags( cl );\r\n\r\n\t\tif ( cl.Argc() == 1 && ! ( List || Verify || Prune ) ) {\r\n\t\t\tHelp();\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\telse if ( ! (List || Add || QueryPath || Remove || Verify || Prune ) ) {\r\n\t\t\tthrow Error( \"Need one of -a, -r, -l, -q, -p or -v\" );\r\n\t\t}\r\n\r\n\t\tif ( List ) {\r\n\t\t\tListPath();\r\n\t\t}\r\n\t\telse if ( Verify ) {\r\n\t\t\treturn VerifyPath();\r\n\t\t}\r\n\t\telse if ( QueryPath ) {\r\n\t\t\treturn FindPath( cl );\r\n\t\t}\r\n\t\telse if ( Remove ) {\r\n\t\t\tRemovePath( cl );\r\n\t\t}\r\n\t\telse if ( Prune ) {\r\n\t\t\tPrunePath( cl );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAddPath( cl );\r\n\t\t}\r\n\r\n\t\treturn 0;\r\n\t}\r\n\tcatch( const Error & e ) {\r\n\t\tcerr << e.what() << endl;\r\n\t\treturn 1;\r\n\t}\r\n\tcatch( ... ) {\r\n\t\tcerr << \"Unexpected exception\" << endl;\r\n\t\treturn 1;\r\n\t}\r\n}\r\n<commit_msg>comments etc.<commit_after>\/\/----------------------------------------------------------------------------\r\n\/\/ main.cpp\r\n\/\/\r\n\/\/ main for pathed\r\n\/\/\r\n\/\/ Copyright (C) 2011 Neil Butterworth\r\n\/\/----------------------------------------------------------------------------\r\n\r\n#include <iostream>\r\n#include <set>\r\n#include \"cmdline.h\"\r\n#include \"error.h\"\r\n#include \"registry.h\"\r\n#include \"util.h\"\r\n\r\nusing namespace std;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Flags controling behaviour in various ways.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nconst char * const ADD_FLAG = \"-a\";\t\t\t\/\/ add to path\r\nconst char * const REM_FLAG = \"-r\";\t\t\t\/\/ remove from path\r\nconst char * const SYS_FLAG = \"-s\";\t\t\t\/\/ use system instead of user path\r\nconst char * const EXIST_FLAG = \"-f\";\t\t\/\/ check path exists on disk\r\nconst char * const LIST_FLAG = \"-l\";\t\t\/\/ list current path\r\nconst char * const QUERY_FLAG = \"-q\";\t\t\/\/ list current path\r\nconst char * const VERIFY_FLAG = \"-v\";\t\t\/\/ verify path\r\nconst char * const EXPAND_FLAG = \"-x\";\t\t\/\/ expand path\r\nconst char * const PRUNE_FLAG = \"-p\";\t\t\/\/ prune path\r\n\r\nstatic bool Remove = false,\r\n\t\t\tAdd = false,\r\n\t\t\tUseSys = false,\r\n\t\t\tList = false,\r\n\t\t\tCheckExist = true,\r\n\t\t\tQueryPath = false,\r\n\t\t\tVerify = false,\r\n\t\t\tExpand = false,\r\n\t\t\tPrune = false;\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Set flags from the command line, shifting them off as they are set.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid SetFlags( CmdLine & cl ) {\r\n\twhile( cl.Argc() > 1 ) {\r\n\t\tstring s = cl.Argv(1);\r\n\t\tif ( s.size() && s[0] == '-' ) {\r\n\t\t\tif ( s == REM_FLAG ) {\r\n\t\t\t\tRemove = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == PRUNE_FLAG ){\r\n\t\t\t\tPrune = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == ADD_FLAG ) {\r\n\t\t\t\tAdd = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == SYS_FLAG ) {\r\n\t\t\t\tUseSys = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXPAND_FLAG ) {\r\n\t\t\t\tExpand = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == EXIST_FLAG ) {\r\n\t\t\t\tCheckExist = false;\r\n\t\t\t}\r\n\t\t\telse if ( s == LIST_FLAG ) {\r\n\t\t\t\tList = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == QUERY_FLAG ) {\r\n\t\t\t\tQueryPath = true;\r\n\t\t\t}\r\n\t\t\telse if ( s == VERIFY_FLAG ) {\r\n\t\t\t\tVerify = true;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tthrow Error( \"Invalid flag: \" + s );\r\n\t\t\t}\r\n\t\t\tcl.Shift(1);\r\n\t\t}\r\n\t\telse {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ List PATH to stdout, one directory per line\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid ListPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tcout << ( Expand ? ExpandPath( path.At(i) ) : path.At(i) ) << \"\\n\";\r\n\t}\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Add an entry to the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid AddPath( CmdLine & cl ) {\r\n\tif ( CheckExist ) {\r\n\t\tDWORD attr = GetFileAttributes( cl.Argv(1).c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES || ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tthrow Error( \"No such directory: \" + cl.Argv(1));\r\n\t\t}\r\n\t}\r\n\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( path.Find( cl.Argv(1), RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is already on the path\" );\r\n\t}\r\n\tpath.Add( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Remove entry from the path\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid RemovePath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tif ( ! path.Find( cl.Argv(1) , RegPath::NoExpand ) ) {\r\n\t\tthrow Error( cl.Argv(1) + \" is not on the path\" );\r\n\t}\r\n\tpath.Remove( cl.Argv(1) );\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Prune duplicates and non-existent dirs from path. Use a set to detect\r\n\/\/ dupes, but actually work with vector to meaintain path order.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid PrunePath( CmdLine & ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\r\n\ttypedef std::set <string> DirSet;\r\n\tDirSet uniq;\r\n\tstd::vector <string> ordered;\r\n\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring dir = path.At( i );\r\n\t\tstd::pair<DirSet::iterator, bool> ok = uniq.insert( dir );\r\n\t\tif ( ok.second ) {\r\n\t\t\tordered.push_back( dir );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcout << \"Pruned: \" << dir << endl;\r\n\t\t}\r\n\t}\r\n\r\n\tstring entry;\r\n\r\n\tfor ( unsigned int i = 0; i < ordered.size(); i++ ) {\r\n\t\tstring dir = ExpandPath( ordered[i] );\r\n\t\tDWORD attr = GetFileAttributes( dir.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ||\r\n\t\t\t\t\t\t! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Pruned: \" << ordered[i] << endl;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tif ( entry != \"\" ) {\r\n\t\t\t\tentry += \";\";\r\n\t\t\t}\r\n\t\t\tentry += ordered[i];\r\n\t\t}\r\n\r\n\t}\r\n\tpath.ReplaceAll( entry );\r\n\tstd::cout << entry << std::endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ See if directory is on the path, if so return success code (not boolean!)\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint FindPath( CmdLine & cl ) {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\treturn path.Find( cl.Argv(1), Expand ? RegPath::Expand : RegPath::NoExpand ) ? 0 : 1;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Verify directories on path exist.\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint VerifyPath() {\r\n\tRegPath path( UseSys ? HKEY_LOCAL_MACHINE : HKEY_CURRENT_USER );\r\n\tint bad = 0;\r\n\tfor ( unsigned int i = 0; i < path.Count(); i++ ) {\r\n\t\tstring epath = ExpandPath( path.At(i) );\r\n\t\tDWORD attr = GetFileAttributes( epath.c_str() );\r\n\t\tif ( attr == INVALID_FILE_ATTRIBUTES ) {\r\n\t\t\tcout << \"No such directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t\telse if ( ! (attr & FILE_ATTRIBUTE_DIRECTORY ) ) {\r\n\t\t\tcout << \"Not a directory: \" << epath << \"\\n\";\r\n\t\t\tbad++;\r\n\t\t}\r\n\t}\r\n\treturn bad == 0 ? 0 : 1;\r\n}\r\n\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Display help\r\n\/\/----------------------------------------------------------------------------\r\n\r\nvoid Help() {\r\n\r\n\tcout <<\r\n\r\n\t\"pathed is a command-line tool for changing the Windows path in the registry\\n\"\r\n\t\"Version 0.4\\n\"\r\n\t\"Copyright (C) 2011 Neil Butterworth\\n\\n\"\r\n\t\"usage: pathed [-a | -r | -l | -q | -v | -p] [-s] [-f] [-x] [dir]\\n\\n\"\r\n\t\"pathed -a dir adds dir to the path in the registry\\n\"\r\n\t\"pathed -r dir removes dir from the path in the registry\\n\"\r\n\t\"pathed -l lists the entries on the current path\\n\"\r\n\t\"pathed -q dir queries registry, returns 0 if dir is on path, 1 otherwise\\n\"\r\n\t\"pathed -v verifies that all directories on the path exist\\n\"\r\n\t\"pathed -p prunes the path by removing duplicates and non-existent directories\\n\\n\"\r\n\t\"By default, pathed works on the path in HKEY_CURRENT_USER. You can make it use\\n\"\r\n\t\"the system path in HKEY_LOCAL_MACHINE by using the -s flag.\\n\\n\"\r\n\t\"Normally, pathed will check a directory exists on disk before adding it to the\\n\"\r\n\t\"path. To prevent this, use the -f flag.\\n\\n\"\r\n\t\"Paths containing environment variables such as %systemroot% will not normally have\\n\"\r\n\t\"the variables expanded to their values. To expand them, use the -x flag\\n\\n\"\r\n\t\"AS WITH ALL COMMANDS THAT CHANGE THE REGISTRY, PATHED CAN CAUSE DAMAGE IF YOU\\n\"\r\n\t\"DO NOT KNOW WHAT YOU ARE DOING. IF IN DOUBT, DO NOT USE IT!\\n\"\r\n\r\n\t<< endl;\r\n}\r\n\r\n\/\/----------------------------------------------------------------------------\r\n\/\/ Main for pathed\r\n\/\/----------------------------------------------------------------------------\r\n\r\nint main( int argc, char *argv[] )\r\n{\r\n\ttry {\r\n\t\tCmdLine cl( argc, argv );\r\n\r\n\t\tSetFlags( cl );\r\n\r\n\t\tif ( cl.Argc() == 1 && ! ( List || Verify || Prune ) ) {\r\n\t\t\tHelp();\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\telse if ( ! (List || Add || QueryPath || Remove || Verify || Prune ) ) {\r\n\t\t\tthrow Error( \"Need one of -a, -r, -l, -q, -p or -v\" );\r\n\t\t}\r\n\r\n\t\tif ( List ) {\r\n\t\t\tListPath();\r\n\t\t}\r\n\t\telse if ( Verify ) {\r\n\t\t\treturn VerifyPath();\r\n\t\t}\r\n\t\telse if ( QueryPath ) {\r\n\t\t\treturn FindPath( cl );\r\n\t\t}\r\n\t\telse if ( Remove ) {\r\n\t\t\tRemovePath( cl );\r\n\t\t}\r\n\t\telse if ( Prune ) {\r\n\t\t\tPrunePath( cl );\r\n\t\t}\r\n\t\telse {\r\n\t\t\tAddPath( cl );\r\n\t\t}\r\n\r\n\t\treturn 0;\r\n\t}\r\n\tcatch( const Error & e ) {\r\n\t\tcerr << e.what() << endl;\r\n\t\treturn 1;\r\n\t}\r\n\tcatch( ... ) {\r\n\t\tcerr << \"Unexpected exception\" << endl;\r\n\t\treturn 1;\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ utils.cpp\n\/\/ Xapiand\n\/\/\n\/\/ Created by Germán M. Bravo on 2\/24\/15.\n\/\/ Copyright (c) 2015 Germán M. Bravo. All rights reserved.\n\/\/\n\n#include <stdio.h>\n\n#include \"pthread.h\"\n\n#include \"utils.h\"\n\n\nbool qmtx_inited = false;\npthread_mutex_t qmtx;\n\n\nstd::string repr(const std::string &string)\n{\n\treturn repr(string.c_str(), string.size());\n}\n\nstd::string repr(const char * p, size_t size)\n{\n\tconst char *p_end = p + size;\n\tstd::string ret;\n\tchar buff[4];\n\n\twhile (p != p_end) {\n\t\tchar c = *p++;\n\t\tif (c == 9) {\n\t\t\tret += \"\\\\t\";\n\t\t} else if (c == 10) {\n\t\t\tret += \"\\\\n\";\n\t\t} else if (c == 13) {\n\t\t\tret += \"\\\\r\";\n\/\/\t\t} else if (c == '\"') {\n\/\/\t\t\tret += \"\\\\\\\"\";\n\t\t} else if (c == '\\'') {\n\t\t\tret += \"\\\\\\'\";\n\t\t} else if (c >= ' ' && c <= '~') {\n\t\t\tsprintf(buff, \"%c\", c);\n\t\t\tret += buff;\n\t\t} else {\n\t\t\tsprintf(buff, \"\\\\x%02x\", c & 0xff);\n\t\t\tret += buff;\n\t\t}\n\t}\n\treturn ret;\n}\n\n\nvoid log(void *obj, const char *format, ...)\n{\n\tif (!qmtx_inited) {\n\t\tpthread_mutex_init(&qmtx, 0);\n\t\tqmtx_inited = true;\n\t}\n\n\tpthread_mutex_lock(&qmtx);\n\n\tFILE * file = stderr;\n\tfprintf(file, \"tid(0x%lx): 0x%lx - \", (unsigned long)pthread_self(), (unsigned long)obj);\n\tva_list argptr;\n\tva_start(argptr, format);\n\tvfprintf(file, format, argptr);\n\tva_end(argptr);\n\n\tpthread_mutex_unlock(&qmtx);\n}\n<commit_msg>Fixed issues with repr()<commit_after>\/\/\n\/\/ utils.cpp\n\/\/ Xapiand\n\/\/\n\/\/ Created by Germán M. Bravo on 2\/24\/15.\n\/\/ Copyright (c) 2015 Germán M. Bravo. All rights reserved.\n\/\/\n\n#include <stdio.h>\n\n#include \"pthread.h\"\n\n#include \"utils.h\"\n\n\nbool qmtx_inited = false;\npthread_mutex_t qmtx;\n\n\nstd::string repr(const std::string &string)\n{\n\treturn repr(string.c_str(), string.size());\n}\n\n\nstd::string repr(const char * p, size_t size)\n{\n\tchar *buff = new char[size * 4 + 1];\n\tchar *d = buff;\n\tconst char *p_end = p + size;\n\twhile (p != p_end) {\n\t\tchar c = *p++;\n\t\tif (c == 9) {\n\t\t\t*d++ = '\\\\';\n\t\t\t*d++ = 't';\n\t\t} else if (c == 10) {\n\t\t\t*d++ = '\\\\';\n\t\t\t*d++ = 'n';\n\t\t} else if (c == 13) {\n\t\t\t*d++ = '\\\\';\n\t\t\t*d++ = 'r';\n\t\t} else if (c == '\\'') {\n\t\t\t*d++ = '\\\\';\n\t\t\t*d++ = '\\'';\n\t\t} else if (c >= ' ' && c <= '~') {\n\t\t\t*d++ = c;\n\t\t} else {\n\t\t\t*d++ = '\\\\';\n\t\t\t*d++ = 'x';\n\t\t\tsprintf(d, \"%02x\", (unsigned char)c);\n\t\t\td += 2;\n\t\t}\n\t\t\/\/ printf(\"%02x: %ld < %ld\\n\", (unsigned char)c, d - buff, size * 4 + 1);\n\t}\n\t*d = '\\0';\n\tstd::string ret(buff);\n\tdelete [] buff;\n\treturn ret;\n}\n\n\nvoid log(void *obj, const char *format, ...)\n{\n\tif (!qmtx_inited) {\n\t\tpthread_mutex_init(&qmtx, 0);\n\t\tqmtx_inited = true;\n\t}\n\n\tpthread_mutex_lock(&qmtx);\n\n\tFILE * file = stderr;\n\tfprintf(file, \"tid(0x%lx): 0x%lx - \", (unsigned long)pthread_self(), (unsigned long)obj);\n\tva_list argptr;\n\tva_start(argptr, format);\n\tvfprintf(file, format, argptr);\n\tva_end(argptr);\n\n\tpthread_mutex_unlock(&qmtx);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#ifndef __LIB_UTILS_HPP\n#define __LIB_UTILS_HPP\n\n#include <experimental\/optional>\n\nnamespace lib::utils {\n\n template <class Base>\n struct DerivedClass : public Base {\n template <typename ...Args> DerivedClass (Args & ...args) : Base(args ...) {}\n };\n\n template <typename Base>\n using Nullable = std::experimental::optional<Base>;\n\n template <typename Base, Base byDefault>\n class Optional : public Nullable<Base> {\n private:\n typedef Nullable<Base> NBase;\n public:\n template <typename ...Args> Optional (Args ...args) : NBase(args ...) {}\n operator Base () {\n return NBase::value_or(byDefault);\n }\n };\n\n}\n\n#endif\n<commit_msg>Add\/remove some empty lines<commit_after>\n#ifndef __LIB_UTILS_HPP\n#define __LIB_UTILS_HPP\n\n#include <experimental\/optional>\n\nnamespace lib::utils {\n template <class Base>\n struct DerivedClass : public Base {\n template <typename ...Args> DerivedClass (Args & ...args) : Base(args ...) {}\n };\n\n template <typename Base>\n using Nullable = std::experimental::optional<Base>;\n\n template <typename Base, Base byDefault>\n class Optional : public Nullable<Base> {\n private:\n typedef Nullable<Base> NBase;\n\n public:\n template <typename ...Args> Optional (Args ...args) : NBase(args ...) {}\n\n operator Base () {\n return NBase::value_or(byDefault);\n }\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Nathan Osman\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n **\/\n\n#include <QApplication>\n#include <QMessageBox>\n\n#include \"application\/application.h\"\n#include \"application\/splashdialog.h\"\n#include \"settings\/settings.h\"\n#include \"util\/platform.h\"\n#include \"config.h\"\n\nint main(int argc, char **argv)\n{\n QApplication app(argc, argv);\n app.setQuitOnLastWindowClosed(false);\n\n \/\/ Set up application properties\n app.setApplicationDisplayName(PROJECT_NAME);\n app.setApplicationName(PROJECT_NAME);\n app.setApplicationVersion(PROJECT_VERSION);\n app.setOrganizationDomain(PROJECT_DOMAIN);\n app.setOrganizationName(PROJECT_AUTHOR);\n\n \/\/ Check to see if the splash screen has been displayed yet\n bool appSplash = Settings::instance()->get(Settings::Key::ApplicationSplash).toBool();\n\n \/\/ If not, display it and remember that the user has seen it\n if(!appSplash) {\n SplashDialog().exec();\n Settings::instance()->set(Settings::Key::ApplicationSplash, true);\n }\n\n#ifdef APPINDICATOR_FOUND\n \/\/ If the splash had not been seen and the user is running Gnome,\n \/\/ warn them that they need a special extension installed\n if(!appSplash && Platform::currentDesktopEnvironment() ==\n Platform::DesktopEnvironment::Gnome) {\n QMessageBox::about(nullptr, QObject::tr(\"Warning\"), QObject::tr(\n \"Some versions of Gnome do not support AppIndicators. This prevents \"\n \"NitroShare from displaying an indicator in the notification area. \"\n \"Please ensure you have this extension installed before continuing:\"\n \"<br><br><a href='%1'>%1<\/a>\"\n ).arg(\"https:\/\/extensions.gnome.org\/extension\/615\/appindicator-support\/\"));\n }\n#endif\n\n \/\/ Create the tray icon that runs the application\n Application nitroshare;\n Q_UNUSED(nitroshare);\n\n return app.exec();\n}\n<commit_msg>Added ability to load translations (#12).<commit_after>\/**\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Nathan Osman\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n **\/\n\n#include <QApplication>\n#include <QLibraryInfo>\n#include <QLocale>\n#include <QMessageBox>\n#include <QTranslator>\n\n#include \"application\/application.h\"\n#include \"application\/splashdialog.h\"\n#include \"settings\/settings.h\"\n#include \"util\/platform.h\"\n#include \"config.h\"\n\nint main(int argc, char **argv)\n{\n QApplication app(argc, argv);\n app.setQuitOnLastWindowClosed(false);\n\n \/\/ Set up application properties\n app.setApplicationDisplayName(PROJECT_NAME);\n app.setApplicationName(PROJECT_NAME);\n app.setApplicationVersion(PROJECT_VERSION);\n app.setOrganizationDomain(PROJECT_DOMAIN);\n app.setOrganizationName(PROJECT_AUTHOR);\n\n \/\/ Set up translations for Qt\n QTranslator qtTranslator;\n qtTranslator.load(QString(\"qt_%1\").arg(QLocale::system().name()),\n QLibraryInfo::location(QLibraryInfo::TranslationsPath));\n app.installTranslator(&qtTranslator);\n\n \/\/ Set up translations for NitroShare\n QTranslator nsTranslator;\n nsTranslator.load(QString(\"nitroshare_%1\").arg(QLocale::system().name()), \":\/qm\");\n app.installTranslator(&nsTranslator);\n\n \/\/ Check to see if the splash screen has been displayed yet\n bool appSplash = Settings::instance()->get(Settings::Key::ApplicationSplash).toBool();\n\n \/\/ If not, display it and remember that the user has seen it\n if(!appSplash) {\n SplashDialog().exec();\n Settings::instance()->set(Settings::Key::ApplicationSplash, true);\n }\n\n#ifdef APPINDICATOR_FOUND\n \/\/ If the splash had not been seen and the user is running Gnome,\n \/\/ warn them that they need a special extension installed\n if(!appSplash && Platform::currentDesktopEnvironment() ==\n Platform::DesktopEnvironment::Gnome) {\n QMessageBox::about(nullptr, QObject::tr(\"Warning\"), QObject::tr(\n \"Some versions of Gnome do not support AppIndicators. This prevents \"\n \"NitroShare from displaying an indicator in the notification area. \"\n \"Please ensure you have this extension installed before continuing:\"\n \"<br><br><a href='%1'>%1<\/a>\"\n ).arg(\"https:\/\/extensions.gnome.org\/extension\/615\/appindicator-support\/\"));\n }\n#endif\n\n \/\/ Create the tray icon that runs the application\n Application nitroshare;\n Q_UNUSED(nitroshare);\n\n return app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n\n\t\/\/ Read fiber center positions and compute related things\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1; \/\/ spectrometer has to be identified from 0 to F.Npetal-1\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\/\/get neighbors of each fiber;\n \/\/for each spectrometer, get list of fibers\n\n\t\/\/ Read plates in order they are to be observed\n \n\tPlates P = read_plate_centers(F);\n\tF.Nplate = P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct galaxy> T(G,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(G,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(G,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n\tAssignment A(G,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n \/\/simple_assign(G,P,pp,F,A);\n \n \/*\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,G,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,G,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\timprove(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,G,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,G,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n *\/\n\treturn(0);\n}\n<commit_msg>more debug of main.cpp<commit_after>#include\t<cstdlib>\n#include\t<cmath>\n#include\t<fstream>\n#include\t<sstream>\n#include\t<iostream>\n#include\t<iomanip>\n#include\t<string>\n#include\t<vector>\n#include\t<algorithm>\n#include\t<exception>\n#include\t<sys\/time.h>\n#include\t\"modules\/htmTree.h\"\n#include\t\"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n\t\/\/\/\/ Initializations ---------------------------------------------\n\tsrand48(1234); \/\/ Make sure we have reproducability\n\tcheck_args(argc);\n\tTime t, time; \/\/ t for global, time for local\n\tinit_time(t);\n\tFeat F;\n\n\t\/\/ Read parameters file \/\/\n\tF.readInputFile(argv[1]);\n\tprintFile(argv[1]);\n\n\t\/\/ Read galaxies\n\tGals G;\n if(F.Ascii){\n G=read_galaxies_ascii(F);}\n else{\n G = read_galaxies(F);\n }\n\tF.Ngal = G.size();\n\tprintf(\"# Read %s galaxies from %s \\n\",f(F.Ngal).c_str(),F.galFile.c_str());\n\n\t\/\/ Read fiber center positions and compute related things\n\tPP pp;\n\tpp.read_fiber_positions(F); \n\tF.Nfiber = pp.fp.size()\/2; \n\tF.Npetal = max(pp.spectrom)+1; \/\/ spectrometer has to be identified from 0 to F.Npetal-1\n\tF.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n\tpp.get_neighbors(F); pp.compute_fibsofsp(F);\/\/get neighbors of each fiber;\n \/\/for each spectrometer, get list of fibers\n\n\t\/\/ Read plates in order they are to be observed\n \n\tPlates P = read_plate_centers(F);\n\tF.Nplate = P.size();\n\tprintf(\"# Read %s plate centers from %s and %d fibers from %s\\n\",f(F.Nplate).c_str(),F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n\t\/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n\tF.cb = create_cb(); \/\/ cb=central body\n\tF.fh = create_fh(); \/\/ fh=fiber holder\n\n\t\/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n\t\/\/ HTM Tree of galaxies\n\tconst double MinTreeSize = 0.01;\n\tinit_time_at(time,\"# Start building HTM tree\",t);\n\thtmTree<struct galaxy> T(G,MinTreeSize);\n\tprint_time(time,\"# ... took :\");\/\/T.stats();\n\t\n\t\/\/ For plates\/fibers, collect available galaxies; done in parallel P[plate j].av_gal[k]=[g1,g2,..]\n\tcollect_galaxies_for_all(G,T,P,pp,F);\n\t\n\t\/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n\tcollect_available_tilefibers(G,P,F);\n\n\t\/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n\t\/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\"before assignment\");\n\tAssignment A(G,F);\n\tprint_time(t,\"# Start assignment at : \");\n\n\t\/\/ Make a plan ----------------------------------------------------\n\t\/\/new_assign_fibers(G,P,pp,F,A); \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n \/\/simple_assign(G,P,pp,F,A);\n \n \/*\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \/\/ Want to have even distribution of unused fibers\n \/\/ so we can put in sky fibers and standard stars\n\n\t\/\/ Smooth out distribution of free fibers, and increase the number of assignments\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\/\/ more iterations will improve performance slightly\n\tfor (int i=0; i<1; i++) { \/\/ more iterations will improve performance slightly\n\t\timprove(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t\tredistribute_tf(G,P,pp,F,A);\n\t}\n\tfor (int i=0; i<1; i++) redistribute_tf(G,P,pp,F,A);\n\n\tprint_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n\n\t\/\/ Still not updated, so all QSO targets have multiple observations etc\n\t\/\/ Apply and update the plan --------------------------------------\n\tinit_time_at(time,\"# Begin real time assignment\",t);\n\tfor (int jj=0; jj<F.Nplate; jj++) {\n\t\tint j = A.next_plate;\n\t\t\/\/printf(\" - Plate %d :\",j);\n\t\tassign_sf_ss(j,G,P,pp,F,A); \/\/ Assign SS and SF just before an observation\n\t\tassign_unused(j,G,P,pp,F,A);\n\t\t\/\/if (j%2000==0) pyplotTile(j,\"doc\/figs\",G,P,pp,F,A); \/\/ Picture of positioners, galaxies\n\t\t\n\t\t\/\/printf(\" %s not as - \",format(5,f(A.unused_f(j,F))).c_str()); fl();\n\t\t\/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\t\tif (0<=j-F.Analysis) update_plan_from_one_obs(G,P,pp,F,A,F.Nplate-1); else printf(\"\\n\");\n\t\tA.next_plate++;\n\t\t\/\/ Redistribute and improve on various occasions add more times if desired\n\n\t\tif ( j==2000 || j==4000) {\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t\timprove(G,P,pp,F,A);\n\t\t\tredistribute_tf(G,P,pp,F,A);\n\t\t}\n\t}\n\tprint_time(time,\"# ... took :\");\n\n\t\/\/ Results -------------------------------------------------------\n\tif (F.Output) for (int j=0; j<F.Nplate; j++) write_FAtile_ascii(j,F.outDir,G,P,pp,F,A); \/\/ Write output\n\tdisplay_results(\"doc\/figs\/\",G,P,pp,F,A,true);\n\tif (F.Verif) A.verif(P,G,pp,F); \/\/ Verification that the assignment is sane\n\n\n\tprint_time(t,\"# Finished !... in\");\n *\/\n\treturn(0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"systems\/partysystem.h\"\n#include \"cmapclient.h\"\n\nusing namespace Systems;\nusing namespace RoseCommon;\n\nPartySystem::PartySystem(SystemManager &m) : System(m) {\n m.registerDispatcher(ePacketType::PAKCS_PARTY_REQ, &PartySystem::processPartyReq);\n m.registerDispatcher(ePacketType::PAKCS_PARTY_REPLY, &PartySystem::processPartyReply);\n m.getEntityManager().on_component_removed<Party>([this](Entity entity, Component<Party> party) {\n (void)entity;\n (void)party;\n \/\/ TODO : send a packet to everyone else in the party\n });\n \/\/ TODO : use on_component_assign for new members?\n}\n\nvoid PartySystem::update(EntityManager &es, double) {\n Component<Party> party;\n Component<BasicInfo> info;\n for (Entity entity : es.entities_with_components(info, party)) {\n (void)entity;\n if (!party->party_) {\n logger_->trace(\"Client {} has the Party component but no affiliated party. {}\", info->id_, party->isRequested_);\n }\n logger_->trace(\"Client {} is in a party\", info->id_);\n logger_->trace(\"Party leader is {}, party members are\", party->party_->leader_);\n for (auto it : party->party_->members_)\n logger_->trace(\"client {}\", getId(it));\n }\n}\n\nvoid PartySystem::addPartyMember(Entity leader, Entity newMember) {\n auto Cparty = leader.component<Party>();\n if (!Cparty)\n return;\n std::shared_ptr<PartyBase> party = Cparty->party_;\n if (!party)\n party = Cparty->party_ = std::make_shared<PartyBase>(leader, newMember);\n if (newMember.component<Party>())\n return;\n newMember.assign<Party>(party);\n \/\/ TODO : send the packets\n party->addMember(newMember);\n}\n\nvoid PartySystem::processPartyReq(CMapClient *client, Entity entity, const CliPartyReq &packet) {\n logger_->trace(\"PartySystem::processPartyReq\");\n Entity other;\n if (!(other = manager_.getEntity(packet.idXorTag())) || !getClient(other)) {\n logger_->debug(\"Client {} requested a party with the non existing char {}\", getId(entity), packet.idXorTag());\n client->Send(*makePacket<ePacketType::PAKWC_PARTY_REPLY>(SrvPartyReply::NOT_FOUND, packet.idXorTag()));\n return;\n }\n Component<Party> party;\n switch (packet.request()) {\n case CliPartyReq::MAKE:\n if (entity.component<Party>()) {\n logger_->warn(\"Client {} tried to create a party when already in a party\", getId(entity));\n return;\n }\n party = entity.assign<Party>();\n case CliPartyReq::JOIN:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to execute an action on its party but doesn't have a party yet\", getId(entity));\n return;\n }\n party = entity.component<Party>();\n party->isRequested_ = true;\n getClient(other)->Send(*makePacket<ePacketType::PAKWC_PARTY_REQ>(static_cast<SrvPartyReq::Request>(packet.request()), entity));\n return;\n case CliPartyReq::LEFT:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to leave the party but isn't in one\", getId(entity));\n return;\n }\n entity.remove<Party>();\n return;\n case CliPartyReq::CHANGE_OWNER:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to give up ownership but isn't in a party\", getId(entity));\n return;\n }\n \/\/ TODO : change leader\n return;\n case CliPartyReq::KICK:\n if (!entity.component<Party>())\n return;\n \/\/ TODO : kick member\n return;\n default:\n logger_->warn(\"Client {} sent a non valid request code {}\", getId(entity), packet.request());\n }\n}\n\nvoid PartySystem::processPartyReply(CMapClient*, Entity entity, const RoseCommon::CliPartyReply &packet) {\n logger_->trace(\"PartySystem::processPartyRequest\");\n Entity other;\n if (!(other = manager_.getEntity(packet.idXorTag())) || getClient(other)) {\n logger_->warn(\"Client {} replied to a party request of the non existing char {}\", getId(entity), packet.idXorTag());\n return;\n }\n if (!other.component<Party>() || !other.component<Party>()->isRequested_) {\n logger_->warn(\"Client {} replied to a non existing party request\", getId(entity));\n return;\n }\n switch (packet.reply()) {\n \/\/ if the guy asked is busy or declined the invitation, we send it to the guy asking\n case CliPartyReply::BUSY:\n case CliPartyReply::REJECT:\n other.component<Party>()->isRequested_ = false;\n if (!other.component<Party>()->party_)\n other.remove<Party>();\n getClient(other)->Send(*makePacket<ePacketType::PAKWC_PARTY_REPLY>(static_cast<SrvPartyReply::Reply>(packet.reply()), entity));\n return;\n \/\/ if the guy asked accepts, we send it to the guy asking and we update the party\n case CliPartyReply::ACCEPT_MAKE:\n case CliPartyReply::ACCEPT_JOIN:\n other.component<Party>()->isRequested_ = false;\n \/\/ TODO : add party member\n return;\n default:\n logger_->warn(\"Client {} sent a party reply with reply {}\", getId(entity), (int)packet.reply());\n }\n}\n<commit_msg>Added the network code for adding a new member. Need to do something about that vector creation error<commit_after>#include \"systems\/partysystem.h\"\n#include \"cmapclient.h\"\n\nusing namespace Systems;\nusing namespace RoseCommon;\n\nPartySystem::PartySystem(SystemManager &m) : System(m) {\n m.registerDispatcher(ePacketType::PAKCS_PARTY_REQ, &PartySystem::processPartyReq);\n m.registerDispatcher(ePacketType::PAKCS_PARTY_REPLY, &PartySystem::processPartyReply);\n m.getEntityManager().on_component_removed<Party>([this](Entity entity, Component<Party> Cparty) {\n auto party = Cparty->party_;\n party->removeMember(entity);\n for (auto &it : party->members_)\n getClient(it)->Send(*makePacket<ePacketType::PAKWC_PARTY_MEMBER>(party->options_, true, {entity}));\n });\n \/\/ TODO : use on_component_assign for new members?\n}\n\nvoid PartySystem::update(EntityManager &es, double) {\n Component<Party> party;\n Component<BasicInfo> info;\n for (Entity entity : es.entities_with_components(info, party)) {\n (void)entity;\n if (!party->party_) {\n logger_->trace(\"Client {} has the Party component but no affiliated party. {}\", info->id_, party->isRequested_);\n }\n logger_->trace(\"Client {} is in a party\", info->id_);\n logger_->trace(\"Party leader is {}, party members are\", party->party_->leader_);\n for (auto it : party->party_->members_)\n logger_->trace(\"client {}\", getId(it));\n }\n}\n\nvoid PartySystem::addPartyMember(Entity leader, Entity newMember) {\n auto Cparty = leader.component<Party>();\n if (!Cparty)\n return;\n std::shared_ptr<PartyBase> party = Cparty->party_;\n if (!party)\n party = Cparty->party_ = std::make_shared<PartyBase>(leader, newMember);\n if (newMember.component<Party>())\n return;\n newMember.assign<Party>(party);\n for (auto &it : party->members_) {\n getClient(it)->Send(*makePacket<ePacketType::PAKWC_PARTY_MEMBER>(party->options_, false, {newMember}));\n }\n getClient(newMember)->Send(*makePacket<ePacketType::PAKWC_PARTY_MEMBER>(party->options_, false, party->members_));\n party->addMember(newMember);\n}\n\nvoid PartySystem::processPartyReq(CMapClient *client, Entity entity, const CliPartyReq &packet) {\n logger_->trace(\"PartySystem::processPartyReq\");\n Entity other;\n if (!(other = manager_.getEntity(packet.idXorTag())) || !getClient(other)) {\n logger_->debug(\"Client {} requested a party with the non existing char {}\", getId(entity), packet.idXorTag());\n client->Send(*makePacket<ePacketType::PAKWC_PARTY_REPLY>(SrvPartyReply::NOT_FOUND, packet.idXorTag()));\n return;\n }\n Component<Party> party;\n switch (packet.request()) {\n case CliPartyReq::MAKE:\n if (entity.component<Party>()) {\n logger_->warn(\"Client {} tried to create a party when already in a party\", getId(entity));\n return;\n }\n party = entity.assign<Party>();\n case CliPartyReq::JOIN:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to execute an action on its party but doesn't have a party yet\", getId(entity));\n return;\n }\n party = entity.component<Party>();\n party->isRequested_ = true;\n getClient(other)->Send(*makePacket<ePacketType::PAKWC_PARTY_REQ>(static_cast<SrvPartyReq::Request>(packet.request()), entity));\n return;\n case CliPartyReq::LEFT:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to leave the party but isn't in one\", getId(entity));\n return;\n }\n entity.remove<Party>();\n return;\n case CliPartyReq::CHANGE_OWNER:\n if (!entity.component<Party>()) {\n logger_->warn(\"Client {} tried to give up ownership but isn't in a party\", getId(entity));\n return;\n }\n \/\/ TODO : change leader\n return;\n case CliPartyReq::KICK:\n if (!entity.component<Party>())\n return;\n \/\/ TODO : kick member\n return;\n default:\n logger_->warn(\"Client {} sent a non valid request code {}\", getId(entity), packet.request());\n }\n}\n\nvoid PartySystem::processPartyReply(CMapClient*, Entity entity, const RoseCommon::CliPartyReply &packet) {\n logger_->trace(\"PartySystem::processPartyRequest\");\n Entity other;\n if (!(other = manager_.getEntity(packet.idXorTag())) || getClient(other)) {\n logger_->warn(\"Client {} replied to a party request of the non existing char {}\", getId(entity), packet.idXorTag());\n return;\n }\n if (!other.component<Party>() || !other.component<Party>()->isRequested_) {\n logger_->warn(\"Client {} replied to a non existing party request\", getId(entity));\n return;\n }\n switch (packet.reply()) {\n \/\/ if the guy asked is busy or declined the invitation, we send it to the guy asking\n case CliPartyReply::BUSY:\n case CliPartyReply::REJECT:\n other.component<Party>()->isRequested_ = false;\n if (!other.component<Party>()->party_)\n other.remove<Party>();\n getClient(other)->Send(*makePacket<ePacketType::PAKWC_PARTY_REPLY>(static_cast<SrvPartyReply::Reply>(packet.reply()), entity));\n return;\n \/\/ if the guy asked accepts, we send it to the guy asking and we update the party\n case CliPartyReply::ACCEPT_MAKE:\n case CliPartyReply::ACCEPT_JOIN:\n other.component<Party>()->isRequested_ = false;\n \/\/ TODO : add party member\n return;\n default:\n logger_->warn(\"Client {} sent a party reply with reply {}\", getId(entity), (int)packet.reply());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sstream>\n#include <iostream>\n#include <stdio.h>\n#include <unistd.h>\n#include \"errno.h\"\n#include <string>\n#include <list>\n#include <string.h>\n#include <vector>\n#include <cstdlib>\n#include <sys\/wait.h>\n#include <string.h> \n\n\nusing namespace std;\nbool global_continue = true;\nvoid fixing_spacing_command(char *org_prompt)\n{\n char *finished_prompt = (char*)malloc(50000);\n \/\/x is passed in prompt\n \/\/i is finished prompt after changing spaces\n for(int x = 0,i = 0; org_prompt[x] != '\\0'; x++, i++)\n {\n if(org_prompt[x] == '#')\n {\n org_prompt[x] = '\\0';\n finished_prompt[i] = '\\0';\n }\n else if(org_prompt[x] == ';')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = ';';\n finished_prompt[++i] = ' ';\n }\n else if(org_prompt[x] == '&' && org_prompt[x] == '&')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = '&';\n finished_prompt[++i] = '&';\n finished_prompt[++i] = ' ';\n ++x;\n }\n else if(org_prompt[x] == '|' && org_prompt[x] == '|')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = '|';\n finished_prompt[++i] = '|';\n finished_prompt[++i] = ' ';\n ++x;\n }\n else\n {\n finished_prompt[i] = org_prompt[x];\n }\n if(org_prompt[x + 1] == '\\0') finished_prompt[i + 1] = '\\0';\n }\n strcpy(org_prompt, finished_prompt);\n \n}\n\nbool execute(char* command, char* command_list[], int conect_type)\n{\n int exec_status;\n int status;\n int process_ID = fork();\n if(process_ID <= -1)\n {\n perror(\"Error occured during forking()\");\n exit(1);\n }\n else if(process_ID == 0) \/\/child process\n {\n\n exec_status = (execvp(command, command_list));\n if(exec_status == -1)\n {\n perror(\"error with passed in argument list\");\n exit(1);\n }\n }\n else if(process_ID > 0)\n {\n if(waitpid(process_ID, &status,0) == -1)\n {\n perror(\"error with waitpid()\");\n }\n }\n return(!(status == 0 && conect_type == -1) ||( status > 0 && conect_type == 2));\n}\n\nint check_connections(char* check)\n{\n if(!strcmp(check, \";\")) return 0;\n else if(!strcmp(check, \"||\")) return 1;\n else if(!strcmp(check, \"&&\")) return 2;\n else return -1;\n}\n\n\n\nint main(int argc, char **argv)\n{\n int sequence = 0; \/\/sequence of which is executable and flags\n int status;\n char* host = (char*)malloc(500);\n string userinfo;\n bool prompter = true;\n char* token; \/\/will be bit of code strtok cuts off\n\n \/\/error checks the user\n if(getlogin() != NULL)\n {\n userinfo = getlogin();\n }\n else\n {\n perror(\"error getting user info\");\n }\n\n if(gethostname(host, 500) == -1)\n {\n perror(\"Error getting host name\");\n }\n \/\/outputs the userinfo with login and host\n while(prompter)\n {\n cout << userinfo << \"@\" << host << \" $ \";\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/login part done, next is all shell commands \n char prompt_holder[50000];\/\/orginal array to hold prompt\n char *comd_arr[50000];\n for(int x = 0; x < 50001; x++)\n {\n prompt_holder[x] = 0;\n comd_arr[x] = 0;\n }\n unsigned int comd_arr_cnt = 0;\n \n string converter; \/\/converts all bits of string into one piece\n string to_be_tokenized;\n getline(cin, to_be_tokenized);\n for(unsigned int x = 0; x < to_be_tokenized.size(); x++)\n {\n prompt_holder[x] = to_be_tokenized.at(x);\n }\n fixing_spacing_command(prompt_holder);\n int connect_check; \/\/indicates which connection is in token\n int exec_result; \n token = strtok(prompt_holder, \"\\t \");\n while(token != NULL && prompter)\n {\n connect_check = check_connections(token);\n cout << \"connect_check: \" << connect_check << endl;\n cout << \"first token: \" << token << endl;\n if(connect_check == -1 && sequence < 1)\n {\n comd_arr[comd_arr_cnt] = token;\n comd_arr_cnt++;\n sequence++; \/\/increment only once to see which is executable\n }\n else if(sequence > 0 && connect_check == -1)\n {\n comd_arr[comd_arr_cnt] = token;\n comd_arr_cnt++;\n \n }\n else if(connect_check != -1 && global_continue == true)\n {\n cout << \"outputting token: \" << token << endl;\n comd_arr[comd_arr_cnt] = '\\0' ;\n sequence = 0;\n comd_arr_cnt = 0;\n exec_result = execute(comd_arr[0], comd_arr, connect_check);\n cout << \"exex_result: \" << exec_result << endl;\n }\n token = strtok(NULL, \" \");\n if(connect_check == -1 && token == NULL && global_continue == true)\n {\n cout << \"did this execute\" << endl;\n comd_arr[comd_arr_cnt] = '\\0';\n execute(comd_arr[0], comd_arr, connect_check);\n }\n }\n }\n}\n\n\/* || && ;\n\nsucceeds ||\nnotsucceed &&\n\nls -a\n\n[ls] [-a]\n\nexekcvp([ls],[[ls],[-a]])\nchar* argumentList[50000];\nchar executable[50000];\nargumentList[0] = executable;\nunsigned int size = 0;\nls -a \\0\nexecvp(argumentList[0], argumentList);\n*\/\n\n \n<commit_msg>got more going<commit_after>#include <sstream>\n#include <iostream>\n#include <stdio.h>\n#include <unistd.h>\n#include \"errno.h\"\n#include <string>\n#include <list>\n#include <string.h>\n#include <vector>\n#include <cstdlib>\n#include <sys\/wait.h>\n#include <string.h> \n\n\nusing namespace std;\nbool global_continue = true;\nvoid fixing_spacing_command(char *org_prompt)\n{\n char *finished_prompt = (char*)malloc(50000);\n \/\/x is passed in prompt\n \/\/i is finished prompt after changing spaces\n for(int x = 0,i = 0; org_prompt[x] != '\\0'; x++, i++)\n {\n if(org_prompt[x] == '#')\n {\n org_prompt[x] = '\\0';\n finished_prompt[i] = '\\0';\n }\n else if(org_prompt[x] == ';')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = ';';\n finished_prompt[++i] = ' ';\n }\n else if(org_prompt[x] == '&' && org_prompt[x] == '&')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = '&';\n finished_prompt[++i] = '&';\n finished_prompt[++i] = ' ';\n ++x;\n }\n else if(org_prompt[x] == '|' && org_prompt[x] == '|')\n {\n finished_prompt[i] = ' ';\n finished_prompt[++i] = '|';\n finished_prompt[++i] = '|';\n finished_prompt[++i] = ' ';\n ++x;\n }\n else\n {\n finished_prompt[i] = org_prompt[x];\n }\n if(org_prompt[x + 1] == '\\0') finished_prompt[i + 1] = '\\0';\n }\n strcpy(org_prompt, finished_prompt);\n \n}\n\nbool execute(char* command, char* command_list[], int conect_type)\n{\n int exec_status;\n int status;\n int process_ID = fork();\n if(process_ID <= -1)\n {\n perror(\"Error occured during forking()\");\n exit(1);\n }\n else if(process_ID == 0) \/\/child process\n {\n\n exec_status = (execvp(command, command_list));\n if(exec_status == -1)\n {\n perror(\"error with passed in argument list\");\n exit(1);\n }\n }\n else if(process_ID > 0)\n {\n if(waitpid(process_ID, &status,0) == -1)\n {\n perror(\"error with waitpid()\");\n }\n }\n return(!(status == 0 && conect_type == -1) ||( status > 0 && conect_type == 2));\n}\n\nint check_connections(char* check)\n{\n if(!strcmp(check, \";\")) return 0;\n else if(!strcmp(check, \"||\")) return 1;\n else if(!strcmp(check, \"&&\")) return 2;\n else return -1;\n}\nvoid check_exit(char *str)\n{\n if(!strcmp(str, \"exit\"))\n {\n exit(0);\n }\n}\n \n \n\n\nint main(int argc, char **argv)\n{\n int sequence = 0; \/\/sequence of which is executable and flags\n int status;\n char* host = (char*)malloc(500);\n string userinfo;\n bool prompter = true;\n char* token; \/\/will be bit of code strtok cuts off\n bool exec_result = true;\n \/\/error checks the user\n if(getlogin() != NULL)\n {\n userinfo = getlogin();\n }\n else\n {\n perror(\"error getting user info\");\n }\n\n if(gethostname(host, 500) == -1)\n {\n perror(\"Error getting host name\");\n }\n \n \/\/outputs the userinfo with login and host\n while(prompter)\n {\n cout << userinfo << \"@\" << host << \" $ \";\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/login part done, next is all shell commands \n char prompt_holder[50000];\/\/orginal array to hold prompt\n char *comd_arr[50000];\n for(int x = 0; x < 50001; x++)\n {\n prompt_holder[x] = 0;\n comd_arr[x] = 0;\n }\n unsigned int comd_arr_cnt = 0;\n \n string converter; \/\/converts all bits of string into one piece\n string to_be_tokenized;\n getline(cin, to_be_tokenized);\n for(unsigned int x = 0; x < to_be_tokenized.size(); x++)\n {\n prompt_holder[x] = to_be_tokenized.at(x);\n }\n fixing_spacing_command(prompt_holder);\n int connect_check; \/\/indicates which connection is in token\n token = strtok(prompt_holder, \"\\t \");\n while(token != NULL && exec_result)\n {\n connect_check = check_connections(token);\n if(connect_check == -1 && sequence < 1)\n {\n check_exit(token);\n comd_arr[comd_arr_cnt] = token;\n comd_arr_cnt++;\n sequence++; \/\/increment only once to see which is executable\n }\n else if(sequence > 0 && connect_check == -1)\n {\n comd_arr[comd_arr_cnt] = token;\n comd_arr_cnt++;\n \n }\n else if(connect_check != -1)\n {\n comd_arr[comd_arr_cnt] = '\\0' ;\n sequence = 0;\n comd_arr_cnt = 0;\n exec_result = execute(comd_arr[0], comd_arr, connect_check);\n if(exec_result == true && connect_check == 1)\n {\n exec_result = false;\n }\n \n }\n token = strtok(NULL, \" \");\n if(connect_check == -1 && token == NULL && exec_result)\n {\n comd_arr[comd_arr_cnt] = '\\0';\n execute(comd_arr[0], comd_arr, connect_check);\n }\n }\n }\n}\n\n\/* || && ;\n\nsucceeds ||\nnotsucceed &&\n\nls -a\n\n[ls] [-a]\n\nexekcvp([ls],[[ls],[-a]])\nchar* argumentList[50000];\nchar executable[50000];\nargumentList[0] = executable;\nunsigned int size = 0;\nls -a \\0\nexecvp(argumentList[0], argumentList);\n*\/\n\n \n<|endoftext|>"} {"text":"<commit_before>#ifdef __APPLE__\r\n\r\n #include <SDL2\/SDL.h>\r\n\r\n extern \"C\" {\r\n #include <lua.h>\r\n #include <lualib.h>\r\n #include <lauxlib.h>\r\n }\r\n\r\n#elif _WIN32\r\n\r\n #define SDL_MAIN_HANDLED\r\n #include <SDL.h>\r\n #include <stdio.h>\r\n #include <lua.hpp>\r\n\r\n#endif\r\n\r\n#include <string>\r\n\r\n#define SCREEN_WIDTH 400\r\n#define SCREEN_HEIGHT 225\r\n\r\n#define GAME_WIDTH 256\r\n#define GAME_HEIGHT 144\r\n\r\n\/\/http:\/\/www.lua.org\/manual\/5.3\/manual.html#lua_CFunction\r\nstatic int luaTestFunc(lua_State* state)\r\n{\r\n\t\/* number of arguments *\/\r\n\tint args = lua_gettop(state);\r\n\r\n\tfor (int n = 1; n <= args; ++n) {\r\n\t\tprintf(\" arg %d: '%s'\\n\", n, lua_tostring(state, n));\r\n\t}\r\n\r\n\tlua_pushnumber(state, 123);\r\n\treturn 1; \/* number of results *\/\r\n}\r\n\r\nvoid renderText(std::string str, SDL_Surface* charSet, SDL_Surface* surf) {\r\n\r\n\tunsigned int i = 0;\r\n\tfor (char& c : str) {\r\n\t\t\/\/printf(\"%c\", c);\r\n\t\tunsigned int charIndex = c - 32;\r\n\t\tSDL_Rect src = { 8 * charIndex, 0, 8, 8 };\r\n\t\tSDL_Rect dst = { 8 * i, 16, 8, 8 };\r\n\r\n\t\tSDL_BlitSurface(charSet, &src, surf, &dst);\r\n\t\t++i;\r\n\t}\r\n\r\n}\r\n\r\nint main(int argc, char* argv[]) {\r\n\r\n SDL_version compiled;\r\n SDL_version linked;\r\n \r\n SDL_VERSION(&compiled);\r\n SDL_GetVersion(&linked);\r\n \r\n printf(\"We compiled against SDL version %d.%d.%d ...\\n\",\r\n compiled.major, compiled.minor, compiled.patch);\r\n printf(\"We are linking against SDL version %d.%d.%d.\\n\",\r\n linked.major, linked.minor, linked.patch);\r\n \r\n \r\n \r\n SDL_Init(SDL_INIT_VIDEO);\r\n SDL_Window *window = SDL_CreateWindow(\r\n \"unamed-dungeon-crawler\",\r\n SDL_WINDOWPOS_UNDEFINED,\r\n SDL_WINDOWPOS_UNDEFINED,\r\n SCREEN_WIDTH*2,\r\n SCREEN_HEIGHT*2,\r\n\t SDL_WINDOW_RESIZABLE\r\n ); \r\n \r\n SDL_Renderer *renderer = SDL_CreateRenderer(window, -1, 0);\r\n\r\n \r\n SDL_Texture *texture = SDL_CreateTexture(renderer,\r\n SDL_PIXELFORMAT_ARGB8888,\r\n SDL_TEXTUREACCESS_STREAMING,\r\n SCREEN_WIDTH, SCREEN_HEIGHT);\r\n \r\n\/\/ SDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, \"linear\"); \/\/ make the scaled rendering look smoother.\r\n\/\/ SDL_RenderSetLogicalSize(renderer, SCREEN_WIDTH*4, SCREEN_HEIGHT*4);\r\n \r\n \/\/SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"ERROR\", SDL_GetError(), window);\r\n \r\n SDL_Surface *screen = SDL_CreateRGBSurface(0, SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0, 0, 0, 0);\r\n SDL_Surface *game = SDL_CreateRGBSurface(0, GAME_WIDTH, GAME_HEIGHT, 32, 0, 0, 0, 0);\r\n\r\n SDL_Surface *testSurface = SDL_LoadBMP(\"data\/base\/test.bmp\");\r\n SDL_Surface *borderSurface = SDL_LoadBMP(\"data\/base\/borders\/border.bmp\");\r\n\tSDL_Surface *tile00Surface = SDL_LoadBMP(\"data\/base\/tiles\/tile00.bmp\");\r\n\tSDL_Surface *tile01Surface = SDL_LoadBMP(\"data\/base\/tiles\/tile01.bmp\");\r\n\tSDL_Surface *player = SDL_LoadBMP(\"data\/base\/spritesheets\/player.bmp\");\r\n\tSDL_Surface *bmpFont = SDL_LoadBMP(\"data\/base\/fonts\/standard_font.bmp\");\r\n\r\n bool quit = false;\r\n\r\n SDL_Event e;\r\n\r\n\t\/\/SDL_Rect pos = { 0,40,100,100 };\r\n\r\n\t\/\/Lua\r\n\tlua_State *state = luaL_newstate();\r\n\tluaL_openlibs(state);\r\n\r\n\tlua_register(state, \"luaTestFunc\", luaTestFunc);\r\n\r\n\tluaL_dostring(state, \"io.write(\\\"luaTestFunc\\\")\");\r\n\tluaL_dostring(state, \"luaTestFunc(\\\"First\\\", \\\"Second\\\", 112233)\");\r\n\t\r\n\r\n\t\/\/Dungeon\r\n\tint tilesArray[] = { \r\n\t\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t\t1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,\r\n\t\t1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t};\r\n\r\n\tint arrayWidth = 16;\r\n\tint arrayHeight = 9;\r\n\r\n\tint playerPos = 0;\r\n\t \r\n while (!quit)\r\n {\r\n\r\n while (SDL_PollEvent(&e) != 0)\r\n {\r\n \r\n const Uint8 *state = SDL_GetKeyboardState(NULL);\r\n\r\n \r\n if (e.type == SDL_QUIT)\r\n {\r\n quit = true;\r\n }\r\n\r\n if (state[SDL_SCANCODE_LEFT]) {\r\n \r\n\t\t\t\t\/\/int oldPos = playerPos;\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\tx -= 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n } else\r\n \r\n if (state[SDL_SCANCODE_RIGHT]) {\r\n \r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\tx += 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n } else\r\n\r\n\t\t\tif (state[SDL_SCANCODE_UP]) {\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\ty -= 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n\t\t\t} else\r\n\r\n\t\t\tif (state[SDL_SCANCODE_DOWN]) {\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\ty += 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n\t\t\t}\r\n \r\n }\r\n\r\n\t\t\/\/clear screen surface\r\n\t\tSDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 255, 0, 0));\r\n\t\tSDL_FillRect(game, NULL, SDL_MapRGB(screen->format, 0, 255, 0));\r\n\r\n\t\t\/\/render tiles\r\n\t\tfor (size_t i = 0; i < arrayWidth * arrayHeight; i++)\r\n\t\t{\r\n\t\t\tint x = i % arrayWidth;\r\n\t\t\tint y = (i \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\tSDL_Rect pos = { x * 16, y * 16, 16, 16 };\r\n\r\n\t\t\t\/\/printf(\"x: %i , y: %i\\n\", x, y);\r\n\r\n\t\t\tif (tilesArray[i] == 0) {\r\n\r\n\t\t\t\tSDL_BlitSurface(tile00Surface, NULL, game, &pos);\r\n\t\t\t} else \r\n\r\n\t\t\tif (tilesArray[i] == 1) {\r\n\r\n\t\t\t\tSDL_BlitSurface(tile01Surface, NULL, game, &pos);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/render player\r\n\r\n\t\t{\r\n\r\n\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\tSDL_Rect pos = { x * 16, y * 16, 16, 16 };\r\n\t\t\tSDL_BlitSurface(player, NULL, game, &pos);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/SDL_BlitSurface(testSurface, 0, game, NULL);\r\n\r\n\t\tSDL_BlitSurface(borderSurface, 0, screen, 0);\r\n\r\n\t\tSDL_Rect location = { 72,40,100,100 };\r\n\t\tSDL_BlitSurface(game, 0, screen, &location);\r\n\r\n\t\t\/\/test\r\n\t\tSDL_BlitSurface(bmpFont, 0, screen, 0);\r\n\t\trenderText(\" 0123!\", bmpFont, screen);\r\n\r\n\r\n SDL_UpdateTexture(texture, NULL, screen->pixels, screen->pitch);\r\n SDL_RenderClear(renderer);\r\n SDL_RenderCopy(renderer, texture, 0, 0);\r\n SDL_RenderPresent(renderer);\r\n \r\n SDL_Delay(16);\r\n }\r\n\r\n\tlua_close(state);\r\n\r\n SDL_FreeSurface(testSurface);\r\n SDL_DestroyWindow(window);\r\n SDL_Quit();\r\n\r\n return 0;\r\n\r\n}\r\n<commit_msg>render text<commit_after>#ifdef __APPLE__\r\n\r\n #include <SDL2\/SDL.h>\r\n\r\n extern \"C\" {\r\n #include <lua.h>\r\n #include <lualib.h>\r\n #include <lauxlib.h>\r\n }\r\n\r\n#elif _WIN32\r\n\r\n #define SDL_MAIN_HANDLED\r\n #include <SDL.h>\r\n #include <stdio.h>\r\n #include <lua.hpp>\r\n\r\n#endif\r\n\r\n#include <string>\r\n\r\n#define SCREEN_WIDTH 400\r\n#define SCREEN_HEIGHT 225\r\n\r\n#define GAME_WIDTH 256\r\n#define GAME_HEIGHT 144\r\n\r\n\/\/http:\/\/www.lua.org\/manual\/5.3\/manual.html#lua_CFunction\r\nstatic int luaTestFunc(lua_State* state)\r\n{\r\n\t\/* number of arguments *\/\r\n\tint args = lua_gettop(state);\r\n\r\n\tfor (int n = 1; n <= args; ++n) {\r\n\t\tprintf(\" arg %d: '%s'\\n\", n, lua_tostring(state, n));\r\n\t}\r\n\r\n\tlua_pushnumber(state, 123);\r\n\treturn 1; \/* number of results *\/\r\n}\r\n\r\nvoid renderText(std::string str, SDL_Surface* charSet, SDL_Surface* surf) {\r\n\r\n\tunsigned int i = 0;\r\n\tunsigned int j = 0;\r\n\tfor (char& c : str) {\r\n\t\t\/\/printf(\"%c\", c);\r\n\t\tif (((int)c) == 10) {\r\n\t\t\t++j;\r\n\t\t\ti = 0;\r\n\t\t\tcontinue;\r\n\t\t};\r\n\t\tunsigned int charIndex = c - 32;\r\n\t\tSDL_Rect src = { 8 * charIndex, 0, 8, 8 };\r\n\t\tSDL_Rect dst = { 8 * i, (14 + j )*8 , 8, 8 };\r\n\r\n\t\tSDL_BlitSurface(charSet, &src, surf, &dst);\r\n\t\t++i;\r\n\t}\r\n\r\n}\r\n\r\nint main(int argc, char* argv[]) {\r\n\r\n SDL_version compiled;\r\n SDL_version linked;\r\n \r\n SDL_VERSION(&compiled);\r\n SDL_GetVersion(&linked);\r\n \r\n printf(\"We compiled against SDL version %d.%d.%d ...\\n\",\r\n compiled.major, compiled.minor, compiled.patch);\r\n printf(\"We are linking against SDL version %d.%d.%d.\\n\",\r\n linked.major, linked.minor, linked.patch);\r\n \r\n \r\n \r\n SDL_Init(SDL_INIT_VIDEO);\r\n SDL_Window *window = SDL_CreateWindow(\r\n \"unamed-dungeon-crawler\",\r\n SDL_WINDOWPOS_UNDEFINED,\r\n SDL_WINDOWPOS_UNDEFINED,\r\n SCREEN_WIDTH*2,\r\n SCREEN_HEIGHT*2,\r\n\t SDL_WINDOW_RESIZABLE\r\n ); \r\n \r\n SDL_Renderer *renderer = SDL_CreateRenderer(window, -1, 0);\r\n\r\n \r\n SDL_Texture *texture = SDL_CreateTexture(renderer,\r\n SDL_PIXELFORMAT_ARGB8888,\r\n SDL_TEXTUREACCESS_STREAMING,\r\n SCREEN_WIDTH, SCREEN_HEIGHT);\r\n \r\n\/\/ SDL_SetHint(SDL_HINT_RENDER_SCALE_QUALITY, \"linear\"); \/\/ make the scaled rendering look smoother.\r\n\/\/ SDL_RenderSetLogicalSize(renderer, SCREEN_WIDTH*4, SCREEN_HEIGHT*4);\r\n \r\n \/\/SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"ERROR\", SDL_GetError(), window);\r\n \r\n SDL_Surface *screen = SDL_CreateRGBSurface(0, SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0, 0, 0, 0);\r\n SDL_Surface *game = SDL_CreateRGBSurface(0, GAME_WIDTH, GAME_HEIGHT, 32, 0, 0, 0, 0);\r\n\r\n SDL_Surface *testSurface = SDL_LoadBMP(\"data\/base\/test.bmp\");\r\n SDL_Surface *borderSurface = SDL_LoadBMP(\"data\/base\/borders\/border.bmp\");\r\n\tSDL_Surface *tile00Surface = SDL_LoadBMP(\"data\/base\/tiles\/tile00.bmp\");\r\n\tSDL_Surface *tile01Surface = SDL_LoadBMP(\"data\/base\/tiles\/tile01.bmp\");\r\n\tSDL_Surface *player = SDL_LoadBMP(\"data\/base\/spritesheets\/player.bmp\");\r\n\tSDL_Surface *bmpFont = SDL_LoadBMP(\"data\/base\/fonts\/standard_font.bmp\");\r\n\r\n bool quit = false;\r\n\r\n SDL_Event e;\r\n\r\n\t\/\/SDL_Rect pos = { 0,40,100,100 };\r\n\r\n\t\/\/Lua\r\n\tlua_State *state = luaL_newstate();\r\n\tluaL_openlibs(state);\r\n\r\n\tlua_register(state, \"luaTestFunc\", luaTestFunc);\r\n\r\n\tluaL_dostring(state, \"io.write(\\\"luaTestFunc\\\")\");\r\n\tluaL_dostring(state, \"luaTestFunc(\\\"First\\\", \\\"Second\\\", 112233)\");\r\n\t\r\n\r\n\t\/\/Dungeon\r\n\tint tilesArray[] = { \r\n\t\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t\t1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,\r\n\t\t1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1,\r\n\t\t1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t\t1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,\r\n\t};\r\n\r\n\tint arrayWidth = 16;\r\n\tint arrayHeight = 9;\r\n\r\n\tint playerPos = 0;\r\n\t \r\n while (!quit)\r\n {\r\n\r\n while (SDL_PollEvent(&e) != 0)\r\n {\r\n \r\n const Uint8 *state = SDL_GetKeyboardState(NULL);\r\n\r\n \r\n if (e.type == SDL_QUIT)\r\n {\r\n quit = true;\r\n }\r\n\r\n if (state[SDL_SCANCODE_LEFT]) {\r\n \r\n\t\t\t\t\/\/int oldPos = playerPos;\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\tx -= 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n } else\r\n \r\n if (state[SDL_SCANCODE_RIGHT]) {\r\n \r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\tx += 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n } else\r\n\r\n\t\t\tif (state[SDL_SCANCODE_UP]) {\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\ty -= 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n\t\t\t} else\r\n\r\n\t\t\tif (state[SDL_SCANCODE_DOWN]) {\r\n\r\n\t\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\t\ty += 1;\r\n\r\n\t\t\t\tplayerPos = x + arrayWidth*y;\r\n\t\t\t}\r\n \r\n }\r\n\r\n\t\t\/\/clear screen surface\r\n\t\tSDL_FillRect(screen, NULL, SDL_MapRGB(screen->format, 255, 0, 0));\r\n\t\tSDL_FillRect(game, NULL, SDL_MapRGB(screen->format, 0, 255, 0));\r\n\r\n\t\t\/\/render tiles\r\n\t\tfor (size_t i = 0; i < arrayWidth * arrayHeight; i++)\r\n\t\t{\r\n\t\t\tint x = i % arrayWidth;\r\n\t\t\tint y = (i \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\tSDL_Rect pos = { x * 16, y * 16, 16, 16 };\r\n\r\n\t\t\t\/\/printf(\"x: %i , y: %i\\n\", x, y);\r\n\r\n\t\t\tif (tilesArray[i] == 0) {\r\n\r\n\t\t\t\tSDL_BlitSurface(tile00Surface, NULL, game, &pos);\r\n\t\t\t} else \r\n\r\n\t\t\tif (tilesArray[i] == 1) {\r\n\r\n\t\t\t\tSDL_BlitSurface(tile01Surface, NULL, game, &pos);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t\/\/render player\r\n\r\n\t\t{\r\n\r\n\t\t\tint x = playerPos % arrayWidth;\r\n\t\t\tint y = (playerPos \/ arrayWidth) % arrayHeight;\r\n\r\n\t\t\tSDL_Rect pos = { x * 16, y * 16, 16, 16 };\r\n\t\t\tSDL_BlitSurface(player, NULL, game, &pos);\r\n\t\t}\r\n\r\n\r\n\t\t\/\/SDL_BlitSurface(testSurface, 0, game, NULL);\r\n\r\n\t\tSDL_BlitSurface(borderSurface, 0, screen, 0);\r\n\r\n\t\tSDL_Rect location = { 72,40,100,100 };\r\n\t\tSDL_BlitSurface(game, 0, screen, &location);\r\n\r\n\t\t\/\/test\r\n\t\tSDL_BlitSurface(bmpFont, 0, screen, 0);\r\n\t\trenderText(\" 0123!\", bmpFont, screen);\r\n\r\n\r\n SDL_UpdateTexture(texture, NULL, screen->pixels, screen->pitch);\r\n SDL_RenderClear(renderer);\r\n SDL_RenderCopy(renderer, texture, 0, 0);\r\n SDL_RenderPresent(renderer);\r\n \r\n SDL_Delay(16);\r\n }\r\n\r\n\tlua_close(state);\r\n\r\n SDL_FreeSurface(testSurface);\r\n SDL_DestroyWindow(window);\r\n SDL_Quit();\r\n\r\n return 0;\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 Fondazione Istituto Italiano di Tecnologia\n * Authors: Silvio Traversaro\n * CopyPolicy: Released under the terms of the LGPLv2.1 or later, see LGPL.TXT\n *\n *\/\n\n\n#include <iDynTree\/Model\/FreeFloatingState.h>\n#include <iDynTree\/Model\/Model.h>\n\n#include <cassert>\n\nnamespace iDynTree\n{\n\nFreeFloatingPos::FreeFloatingPos(const Model& model)\n{\n resize(model);\n}\n\nvoid FreeFloatingPos::resize(const Model& model)\n{\n this->m_jointPos.resize(model.getNrOfPosCoords());\n}\n\n\nTransform& FreeFloatingPos::worldBasePos()\n{\n return this->m_worldBasePos;\n}\n\nIRawVector & FreeFloatingPos::jointPos()\n{\n return this->m_jointPos;\n}\n\nconst Transform& FreeFloatingPos::worldBasePos() const\n{\n return this->m_worldBasePos;\n}\n\nconst IRawVector & FreeFloatingPos::jointPos() const\n{\n return this->m_jointPos;\n}\n\n\nunsigned int FreeFloatingPos::getNrOfPosCoords() const\n{\n return this->m_jointPos.size();\n}\n\nFreeFloatingPos::~FreeFloatingPos()\n{\n}\n\n\nFreeFloatingVel::FreeFloatingVel(const Model& model)\n{\n resize(model);\n}\n\nTwist& FreeFloatingVel::baseVel()\n{\n return this->m_baseVel;\n}\n\nconst Twist& FreeFloatingVel::baseVel() const\n{\n return this->m_baseVel;\n}\n\nunsigned int FreeFloatingVel::getNrOfDOFs() const\n{\n return this->m_jointVel.size();\n}\n\nIRawVector& FreeFloatingVel::jointVel()\n{\n return this->m_jointVel;\n}\n\nconst IRawVector& FreeFloatingVel::jointVel() const\n{\n return this->m_jointVel;\n}\n\nvoid FreeFloatingVel::resize(const Model& model)\n{\n this->m_jointVel.resize(model.getNrOfDOFs());\n}\n\nFreeFloatingVel::~FreeFloatingVel()\n{\n\n}\n\nFreeFloatingAcc::FreeFloatingAcc(const Model& model)\n{\n resize(model);\n}\n\nSpatialAcc& FreeFloatingAcc::baseAcc()\n{\n return this->m_baseAcc;\n}\n\nconst SpatialAcc& FreeFloatingAcc::baseAcc() const\n{\n return this->m_baseAcc;\n}\n\nunsigned int FreeFloatingAcc::getNrOfDOFs() const\n{\n return this->m_jointAcc.size();\n}\n\nIRawVector& FreeFloatingAcc::jointAcc()\n{\n return this->m_jointAcc;\n}\n\nconst IRawVector& FreeFloatingAcc::jointAcc() const\n{\n return this->m_jointAcc;\n}\n\nvoid FreeFloatingAcc::resize(const Model& model)\n{\n this->m_jointAcc.resize(model.getNrOfDOFs());\n}\n\nFreeFloatingAcc::~FreeFloatingAcc()\n{\n\n}\n\nFreeFloatingGeneralizedTorques::FreeFloatingGeneralizedTorques(const Model& model)\n{\n resize(model);\n}\n\nvoid FreeFloatingGeneralizedTorques::resize(const Model& model)\n{\n this->m_jointTorques.resize(model.getNrOfDOFs());\n}\n\nWrench& FreeFloatingGeneralizedTorques::baseWrench()\n{\n return this->m_baseWrench;\n}\n\nIRawVector& FreeFloatingGeneralizedTorques::jointTorques()\n{\n return this->m_jointTorques;\n}\n\nconst Wrench& FreeFloatingGeneralizedTorques::baseWrench() const\n{\n return this->m_baseWrench;\n}\n\nconst IRawVector& FreeFloatingGeneralizedTorques::jointTorques() const\n{\n return this->m_jointTorques;\n}\n\nunsigned int FreeFloatingGeneralizedTorques::getNrOfDOFs() const\n{\n return this->m_jointTorques.size();\n}\n\nFreeFloatingGeneralizedTorques::~FreeFloatingGeneralizedTorques()\n{\n\n}\n\n\n}\n<commit_msg>Fix missing initialization in FreeFloating** resize<commit_after>\/*\n * Copyright (C) 2015 Fondazione Istituto Italiano di Tecnologia\n * Authors: Silvio Traversaro\n * CopyPolicy: Released under the terms of the LGPLv2.1 or later, see LGPL.TXT\n *\n *\/\n\n\n#include <iDynTree\/Model\/FreeFloatingState.h>\n#include <iDynTree\/Model\/Model.h>\n\n#include <cassert>\n\nnamespace iDynTree\n{\n\nFreeFloatingPos::FreeFloatingPos(const Model& model)\n{\n resize(model);\n}\n\nvoid FreeFloatingPos::resize(const Model& model)\n{\n this->m_worldBasePos = Transform::Identity();\n this->m_jointPos.resize(model.getNrOfPosCoords());\n this->m_jointPos.zero();\n}\n\n\nTransform& FreeFloatingPos::worldBasePos()\n{\n return this->m_worldBasePos;\n}\n\nIRawVector & FreeFloatingPos::jointPos()\n{\n return this->m_jointPos;\n}\n\nconst Transform& FreeFloatingPos::worldBasePos() const\n{\n return this->m_worldBasePos;\n}\n\nconst IRawVector & FreeFloatingPos::jointPos() const\n{\n return this->m_jointPos;\n}\n\n\nunsigned int FreeFloatingPos::getNrOfPosCoords() const\n{\n return this->m_jointPos.size();\n}\n\nFreeFloatingPos::~FreeFloatingPos()\n{\n}\n\n\nFreeFloatingVel::FreeFloatingVel(const Model& model)\n{\n resize(model);\n}\n\nTwist& FreeFloatingVel::baseVel()\n{\n return this->m_baseVel;\n}\n\nconst Twist& FreeFloatingVel::baseVel() const\n{\n return this->m_baseVel;\n}\n\nunsigned int FreeFloatingVel::getNrOfDOFs() const\n{\n return this->m_jointVel.size();\n}\n\nIRawVector& FreeFloatingVel::jointVel()\n{\n return this->m_jointVel;\n}\n\nconst IRawVector& FreeFloatingVel::jointVel() const\n{\n return this->m_jointVel;\n}\n\nvoid FreeFloatingVel::resize(const Model& model)\n{\n this->m_baseVel.zero();\n this->m_jointVel.resize(model.getNrOfDOFs());\n this->m_jointVel.zero();\n}\n\nFreeFloatingVel::~FreeFloatingVel()\n{\n\n}\n\nFreeFloatingAcc::FreeFloatingAcc(const Model& model)\n{\n resize(model);\n}\n\nSpatialAcc& FreeFloatingAcc::baseAcc()\n{\n return this->m_baseAcc;\n}\n\nconst SpatialAcc& FreeFloatingAcc::baseAcc() const\n{\n return this->m_baseAcc;\n}\n\nunsigned int FreeFloatingAcc::getNrOfDOFs() const\n{\n return this->m_jointAcc.size();\n}\n\nIRawVector& FreeFloatingAcc::jointAcc()\n{\n return this->m_jointAcc;\n}\n\nconst IRawVector& FreeFloatingAcc::jointAcc() const\n{\n return this->m_jointAcc;\n}\n\nvoid FreeFloatingAcc::resize(const Model& model)\n{\n this->m_baseAcc.zero();\n this->m_jointAcc.resize(model.getNrOfDOFs());\n this->m_jointAcc.zero();\n}\n\nFreeFloatingAcc::~FreeFloatingAcc()\n{\n\n}\n\nFreeFloatingGeneralizedTorques::FreeFloatingGeneralizedTorques(const Model& model)\n{\n resize(model);\n}\n\nvoid FreeFloatingGeneralizedTorques::resize(const Model& model)\n{\n this->m_jointTorques.resize(model.getNrOfDOFs());\n}\n\nWrench& FreeFloatingGeneralizedTorques::baseWrench()\n{\n return this->m_baseWrench;\n}\n\nIRawVector& FreeFloatingGeneralizedTorques::jointTorques()\n{\n return this->m_jointTorques;\n}\n\nconst Wrench& FreeFloatingGeneralizedTorques::baseWrench() const\n{\n return this->m_baseWrench;\n}\n\nconst IRawVector& FreeFloatingGeneralizedTorques::jointTorques() const\n{\n return this->m_jointTorques;\n}\n\nunsigned int FreeFloatingGeneralizedTorques::getNrOfDOFs() const\n{\n return this->m_jointTorques.size();\n}\n\nFreeFloatingGeneralizedTorques::~FreeFloatingGeneralizedTorques()\n{\n\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <msgpack.hpp>\n#include <string>\n#include <iostream>\n#include <sstream>\n\n#include <boost\/asio.hpp>\n#include <boost\/asio\/spawn.hpp>\n#include <boost\/asio\/yield.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <boost\/asio\/write.hpp>\n#include <boost\/bind.hpp>\n\nnamespace detail {\n using Packer = msgpack::packer<msgpack::sbuffer>;\n\n template<class X>\n Packer& pack(Packer& pk, const X& x)\n {\n return pk << x;\n }\n template<class X, class Y, class...Z>\n Packer& pack(Packer& pk, const X &x, const Y &y, const Z &...z)\n {\n return pack(pack(pk, x), y, z...);\n }\n\n\n static Packer& pack(Packer& pk)\n {\n return pk;\n }\n} \/\/ namespace detail\n\nclass Client {\n boost::asio::io_service &io_service_;\n boost::asio::ip::tcp::socket socket_;\n \n enum {\n REQUEST = 0,\n RESPONSE = 1,\n NOTIFY = 2\n };\n \npublic:\n Client(boost::asio::io_service &io_service)\n : io_service_(io_service),\n socket_(io_service)\n {\n\n }\n\n void start() {\n connect();\n }\n\nprivate:\n\n void connect() {\n socket_.async_connect(\n boost::asio::ip::tcp::endpoint(boost::asio::ip::address::from_string(\"127.0.0.1\"), 6666),\n boost::bind(&Client::on_connect, this, boost::asio::placeholders::error));\n }\n\n void on_connect(const boost::system::error_code &error) {\n if(error) {\n std::cout << \"connect failed: \" << error.message() << std::endl;\n } else {\n std::cout << \"connected\" << std::endl;\n send(79); \/\/debug vim_del_current_line\n }\n }\n \n template<typename...T>\n void send(uint64_t method, const T&...t) {\n \/\/msgpack::type::tuple<int, std::string, std::string> src(2, \"vim_command\", \"vsplit\");\n\n msgpack::sbuffer sbuf;\n detail::Packer pk(&sbuf);\n pk.pack_array(4) << (uint64_t)REQUEST\n << 0 \/\/id\n << method;\n \n pk.pack_array(sizeof...(t));\n detail::pack(pk, t...);\n \n msgpack::object_handle oh = msgpack::unpack(sbuf.data(), sbuf.size());\n\n msgpack::object deserialized = oh.get();\n\n std::cout << \"sbuf = \" << deserialized << std::endl;\n \n boost::asio::async_write(\n socket_,\n boost::asio::buffer(std::string(sbuf.data())),\n boost::bind(&Client::on_send, this, boost::asio::placeholders::error,\n boost::asio::placeholders::bytes_transferred));\n }\n\n void on_send(const boost::system::error_code &error, size_t \/*bytes_transferred*\/) {\n if(error) {\n std::cout << \"send failed: \" << error.message() << std::endl;\n } else {\n std::cout << \"send correct!\" << std::endl;\n }\n }\n};\n\nint main() {\n boost::asio::io_service io_service;\n Client client(io_service);\n\n client.start();\n \/\/client.connect();\n io_service.run();\n\n \/\/boost::asio::io_service::strand strand = socket.get_io_service();\n\n \/\/boost::asio::spawn(io_service, [](boost::asio::yield_context yield){\n \/\/async_read(socket, asio::buffer(buffer_), yield);\n \/\/async_write(socket, asio::buffer(buffer_), yield);\n\n \/\/do something...\n \/\/});\n\n msgpack::type::tuple<int, bool, std::string> src(1, true, \"example\");\n\n std::stringstream buffer;\n msgpack::pack(buffer, src);\n\n buffer.seekg(0);\n\n std::string str(buffer.str()); \/\/binary\n\n msgpack::object_handle oh = msgpack::unpack(str.data(), str.size());\n\n msgpack::object deserialized = oh.get();\n\n std::cout << deserialized << std::endl;\n \n msgpack::type::tuple<int, bool, std::string> dst;\n deserialized.convert(dst);\n\n return 0;\n}\n<commit_msg>msg id<commit_after>#include <msgpack.hpp>\n#include <string>\n#include <iostream>\n#include <sstream>\n\n#include <boost\/asio.hpp>\n#include <boost\/asio\/spawn.hpp>\n#include <boost\/asio\/yield.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/asio\/io_service.hpp>\n#include <boost\/asio\/write.hpp>\n#include <boost\/bind.hpp>\n\nnamespace detail {\n using Packer = msgpack::packer<msgpack::sbuffer>;\n\n template<class X>\n Packer& pack(Packer& pk, const X& x)\n {\n return pk << x;\n }\n template<class X, class Y, class...Z>\n Packer& pack(Packer& pk, const X &x, const Y &y, const Z &...z)\n {\n return pack(pack(pk, x), y, z...);\n }\n\n\n static Packer& pack(Packer& pk)\n {\n return pk;\n }\n} \/\/ namespace detail\n\nclass Client {\n boost::asio::io_service &io_service_;\n boost::asio::ip::tcp::socket socket_;\n \n enum {\n REQUEST = 0,\n RESPONSE = 1,\n NOTIFY = 2\n };\n \npublic:\n Client(boost::asio::io_service &io_service)\n : io_service_(io_service),\n socket_(io_service)\n {\n\n }\n\n void start() {\n connect();\n }\n\nprivate:\n\n void connect() {\n socket_.async_connect(\n boost::asio::ip::tcp::endpoint(boost::asio::ip::address::from_string(\"127.0.0.1\"), 6666),\n boost::bind(&Client::on_connect, this, boost::asio::placeholders::error));\n }\n\n void on_connect(const boost::system::error_code &error) {\n if(error) {\n std::cout << \"connect failed: \" << error.message() << std::endl;\n } else {\n std::cout << \"connected\" << std::endl;\n send(0); \/\/debug vim_del_current_line\n }\n }\n \n template<typename...T>\n void send(uint64_t method, const T&...t) {\n \/\/msgpack::type::tuple<int, std::string, std::string> src(2, \"vim_command\", \"vsplit\");\n\n msgpack::sbuffer sbuf;\n detail::Packer pk(&sbuf);\n pk.pack_array(4) << (uint64_t)REQUEST\n << (uint64_t)0 \/\/msgid\n << std::string(\"vim_del_current_line\");\n \n pk.pack_array(sizeof...(t));\n detail::pack(pk, t...);\n \n msgpack::object_handle oh = msgpack::unpack(sbuf.data(), sbuf.size());\n\n msgpack::object deserialized = oh.get();\n\n std::cout << \"sbuf = \" << deserialized << std::endl;\n \n boost::asio::async_write(\n socket_,\n boost::asio::buffer(std::string(sbuf.data())),\n boost::bind(&Client::on_send, this, boost::asio::placeholders::error,\n boost::asio::placeholders::bytes_transferred));\n }\n\n void on_send(const boost::system::error_code &error, size_t \/*bytes_transferred*\/) {\n if(error) {\n std::cout << \"send failed: \" << error.message() << std::endl;\n } else {\n std::cout << \"send correct!\" << std::endl;\n }\n }\n};\n\nint main() {\n boost::asio::io_service io_service;\n Client client(io_service);\n\n client.start();\n \/\/client.connect();\n io_service.run();\n\n \/\/boost::asio::io_service::strand strand = socket.get_io_service();\n\n \/\/boost::asio::spawn(io_service, [](boost::asio::yield_context yield){\n \/\/async_read(socket, asio::buffer(buffer_), yield);\n \/\/async_write(socket, asio::buffer(buffer_), yield);\n\n \/\/do something...\n \/\/});\n\n msgpack::type::tuple<int, bool, std::string> src(1, true, \"example\");\n\n std::stringstream buffer;\n msgpack::pack(buffer, src);\n\n buffer.seekg(0);\n\n std::string str(buffer.str()); \/\/binary\n\n msgpack::object_handle oh = msgpack::unpack(str.data(), str.size());\n\n msgpack::object deserialized = oh.get();\n\n std::cout << deserialized << std::endl;\n \n msgpack::type::tuple<int, bool, std::string> dst;\n deserialized.convert(dst);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include<QApplication>\n#include<version.hpp>\n\nint main(int argc,char** argv){\n\tQApplication mcswitch(argc,argv);\n\n\tmcswitch.setApplicationName(app_name);\n\tmcswitch.setApllicationVersion(app_ver);\n\n\n\treturn mcswitch.exec();\n}\n<commit_msg>main.cppにもMITライセンス条文を記述<commit_after>\/*\nCopyright (c) 2012 opamp\n\nPermission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#include<QApplication>\n#include<version.hpp>\n\nint main(int argc,char** argv){\n\tQApplication mcswitch(argc,argv);\n\n\tmcswitch.setApplicationName(app_name);\n\tmcswitch.setApllicationVersion(app_ver);\n\n\n\treturn mcswitch.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/mman.h>\n#include <pwd.h>\nusing namespace std;\n\nstatic int *glob_flag;\n\n\/\/output login @ machine $\nvoid prompt(){\nstruct passwd *log;\n\tint pid = fork();\n\t\tif(pid == -1){\n\t\t\tperror(\"fork() presented error\");\n\t\t\texit(1);\n\t\t\t}\n\t\telse if(pid==0){\n\t\t\tchar host[50];\n\t\t\tif ((gethostname(host, sizeof(host)-1))==-1) {\n\t\t\t\thost[0] = 'h';\n\t\t\t\thost[1] = 'o';\n\t\t\t\thost[2] = 's';\n\t\t\t\thost[3] = 't';\n\t\t\t\thost[4] = '\\0';\n\t\t\t\tperror(\"Error trying to get hostname\");\n\t\t\t}\n\t\t\tlog = getpwuid(getuid());\t\t\t\n\t\t\tif(log == '\\0'){\n\t\t\t\tperror(\"Error trying to get user login\");\n\t\t\t}\n\n\t\t\tcout << log->pw_name << \"@\" << host << \"$ \";\n\t\t\texit(1);\n\t\t\t}else if(pid>0){\n\t\t\t\tif(-1 == wait(0))\n\t\t\t \tperror(\"wait() presented error\");\n\t\t\n\t\t\t}\t\t\t \n}\n\nvoid execute(char *str[],int size){\n\nchar * newstr[256];\nchar * connector;\nint i,j,aux;\n\n\t\/\/create a shared memory to be accessed from child and process\n\tglob_flag =(int*) mmap(NULL, sizeof *glob_flag, PROT_READ | PROT_WRITE, \n MAP_SHARED | MAP_ANONYMOUS, -1, 0);\n\n\tfor(i=0;i<size;i++){\n\t\t*glob_flag = 0;\n\t\t\/\/newstr[0] receives commands, first parameter after a connector\n\t\tnewstr[0] = str[i];\n\t\taux=1;\n\t\t\/\/test command without flags carryng a ';'\n\t\tconnector = strchr(newstr[0],';');\n\t\tif(connector!=NULL) newstr[0][connector-newstr[0]] = '\\0';\n\t\telse\n\t\t\tfor(j=i+1;j<size;j++){\n\t\t\t\tconnector = strchr(str[j],';');\n\t\t\t\tif(connector!=NULL){\n\t\t\t\t\/\/erase the last character if ';'\n\t\t\t\t\tstr[j][connector-str[j]] = '\\0';\n\t\t\t\t}\n\t\t\t\t\/\/check for && setting a flag to 1\n\t\t\t\tif(memcmp(str[j], \"&&\",2)==0){\n\t\t\t\t\t*glob_flag = 1;\t\n\t\t\t\t\ti = j;\n\t\t\t\t\tbreak;\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\/\/check for || setting a flag to 3\n\t\t\t\tif(memcmp(str[j], \"||\",2)==0){\n\t\t\t\t\t*glob_flag = 3;\t\n\t\t\t\t\ti = j;\n\t\t\t\t\tbreak;\t\t\t\t\n\t\t\t\t}\n\n\t\t\t\t\/\/add flags to newstr\n\t\t\t\tnewstr[aux] = str[j];\n\t\t\t\taux++;\n\t\t\t\ti = j;\n\t\n\t\t\t\tif(connector!=NULL) break;\n\t\t\t}\n\t\n\t\tint pid = fork();\n\t\tif(pid == -1){\n\t\t\tperror(\"fork() presented error\");\n\t\t\texit(1);\n\t\t}\n\t\telse if(pid == 0){\t\t\t\t\t\n\t\t \t if(-1 == execvp(newstr[0], newstr)){\t\n\t\t\t\tperror(\"There was an error\");\n\t\t\t\t\/\/flag 1 means, first command must be successfull to apply the second\n\t\t\t\tif(*glob_flag == 1) *glob_flag = 2;\n\t\t\t\t\/\/flag 3 means, first command must be failed to apply the second\n\t\t\t\t\/\/number 5 won't pass in the breaking loop\n\t\t\t\tif(*glob_flag == 3) *glob_flag = 5;\n\t\t\t}\t\t\t\t\t\n \t \t\texit(1);\n\t\t}\n\t\telse if(pid>0){\n\t\t\tif(-1 == wait(0))\n\t\t \tperror(\"wait() presented error\");\n\t\t\n\t\t}\n\t\n\t\t\/\/ clear the vector newstr in order to execute new commands\n\t\tfor(int k=0;k<aux;k++)newstr[k]='\\0';\n\n\t\t\/\/break loop due to a non valid previous command connected by &&\t\t\t\t\t\n\t\tif(*glob_flag == 2) break;\n\t\t\/\/break loop due to a valid previous command connected by ||\n\t\tif(*glob_flag == 3) break;\n\t}\n}\n\n\n\n\nint main(){\n int index;\n string line;\n char * str[256];\n char * pch;\n\n while(true){\n\tdo{\n\t \/\/output login @ machine $\n\t prompt();\n\t getline(cin,line);\n\t}while(line[0]=='#');\n\n\t\/\/look for '#', if find erase everything until the end of line\n\tsize_t found = line.find('#');\n\t if (found!=std::string::npos)\n\t\tline.erase (found,line.length()-found);\n\n\t\/\/create a dynamic char that is a copy of input\n \tchar * input = new char [line.length()+1];\n \tstrcpy (input, line.c_str());\n\n\t\/\/built in function to finish program when typed 'EXIT'\n\tif(memcmp(input, \"exit\",4)==0) exit(0);\n\n\n\tindex=0;\n\tpch= strtok (input,\" \");\n\n\twhile(pch != NULL){\n\t str[index]=pch;\n\t pch = strtok(NULL, \" \");\n\t index++;\n\t}\n\n\tstr[index] = NULL;\n\n\texecute(str,index);\n\n }\n return 0;\n}\n<commit_msg>comparisions && and || updated<commit_after>#include <iostream>\n#include <string.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/mman.h>\n#include <pwd.h>\nusing namespace std;\n\nstatic int *glob_flag;\n\n\/\/output login @ machine $\nvoid prompt(){\n\tstruct passwd *log;\n\tint pid = fork();\n\tif(pid == -1){\n\tperror(\"fork() presented error\");\n\texit(1);\n\t}\n\telse if(pid==0){\n\tchar host[50];\n\tif ((gethostname(host, sizeof(host)-1))==-1) {\n\thost[0] = 'h';\n\thost[1] = 'o';\n\thost[2] = 's';\n\thost[3] = 't';\n\thost[4] = '\\0';\n\tperror(\"Error trying to get hostname\");\n\t}\n\tlog = getpwuid(getuid());\n\tif(log == '\\0'){\n\t\tperror(\"Error trying to get user login\");\n\t}\n\n\tcout << log->pw_name << \"@\" << host << \"$ \";\n\texit(1);\n\t}else if(pid>0){\n\tif(-1 == wait(0))\n\tperror(\"wait() presented error\");\n\n\t}\t\n}\n\nvoid execute(char *str[], int size){\n\n\tchar * newstr[512];\n\tchar * connector;\n\tint i, j, aux;\n\n\t\/\/create a shared memory to be accessed from child and process\n\tglob_flag = (int*)mmap(NULL, sizeof *glob_flag, PROT_READ | PROT_WRITE,\n\t\tMAP_SHARED | MAP_ANONYMOUS, -1, 0);\n\n\tfor (i = 0; i<size; i++){\n\t\t*glob_flag = 0;\n\t\t\/\/newstr[0] receives commands, first parameter after a connector\n\t\tnewstr[0] = str[i];\n\t\tif(memcmp(newstr[0],\"exit\",4)==0) exit(0);\n\t\taux = 1;\n\t\t\/\/test command without flags carryng a ';'\n\t\tconnector = strchr(newstr[0], ';');\n\t\tif (connector != NULL) newstr[0][connector - newstr[0]] = '\\0';\n\t\telse\n\t\t\tfor (j = i + 1; j<size; j++){\n\t\t\tconnector = strchr(str[j], ';');\n\t\t\tif (connector != NULL){\n\t\t\t\t\/\/erase the last character if ';'\n\t\t\t\tstr[j][connector - str[j]] = '\\0';\n\t\t\t}\n\t\t\t\/\/check for && setting a flag to 1\n\t\t\tif (memcmp(str[j], \"&&\", 2) == 0){\n\t\t\t\t*glob_flag = 1;\n\t\t\t\ti = j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\/\/check for || setting a flag to 3\n\t\t\tif (memcmp(str[j], \"||\", 2) == 0){\n\t\t\t\t*glob_flag = 3;\n\t\t\t\ti = j;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t\/\/add flags to newstr\n\t\t\tnewstr[aux] = str[j];\n\t\t\taux++;\n\t\t\ti = j;\n\n\t\t\tif (connector != NULL) break;\n\t\t\t}\n\n\t\tint pid = fork();\n\t\tif (pid == -1){\n\t\t\tperror(\"fork() presented error\");\n\t\t\texit(1);\n\t\t}\n\t\telse if (pid == 0){\n\t\t\tif (-1 == execvp(newstr[0], newstr)){\n\t\t\t\tperror(\"There was an error\");\n\t\t\t\t\/\/flag 1 means, first command must be successfull to apply the second\n\t\t\t\tif (*glob_flag == 1) *glob_flag = 2;\n\t\t\t\t\/\/flag 3 means, first command must be failed to apply the second\n\t\t\t\t\/\/number 5 won't pass in the breaking loop\n\t\t\t\tif (*glob_flag == 3) *glob_flag = 5;\n\t\t\t}\n\t\t\texit(1);\n\t\t}\n\t\telse if (pid>0){\n\n\t\t\tint status;\n\n\t\t\twait(&status);\n\t\t\tif (-1 == status)\n\t\t\t\tperror(\"wait() presented error\");\n\t\t\telse if (status>0){\n\t\t\t\t\/\/flag 1 means, first command must be successfull to apply the second\n\t\t\t\tif (*glob_flag == 1){\n\t\t\t\t\tint flag2 = 0;\n\t\t\t\t\tfor (int p = i; p<size; p++){\n\t\t\t\t\t\t\/\/in case command fails look for a semicolon to reestart from there\n\t\t\t\t\t\tconnector = strchr(str[p], ';');\n\t\t\t\t\t\tif (connector != NULL){\n\t\t\t\t\t\t\ti = p;\n\t\t\t\t\t\t\t\/\/changing this flag will make the parent loop do not break because a semicolon was found\n\t\t\t\t\t\t\tflag2 = 1;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\/\/if there is no more semicolons parent loop will break\n\t\t\t\t\tif (flag2 == 0) *glob_flag = 2;\n\t\t\t\t}\n\t\t\t\t\/\/flag 3 means, first command must be failed to apply the second\n\t\t\t\t\/\/number 5 won't pass in the breaking loop\n\t\t\t\tif (*glob_flag == 3) *glob_flag = 5;\n\t\t\t}\n\n\t\t}\n\n\t\t\/\/ clear the vector newstr in order to execute new commands\n\t\tfor (int k = 0; k<aux; k++)newstr[k] = '\\0';\n\n\t\t\/\/break loop due to a non valid previous command connected by &&\t\t\t\t\t\n\t\tif (*glob_flag == 2) break;\n\t\t\/\/break loop due to a valid previous command connected by ||\n\t\tif (*glob_flag == 3) break;\n\t}\n}\n\n\n\n\nint main(){\n\tint index;\n\tstring line;\n\tchar * str[512];\n\tchar * pch;\n\n\twhile (true){\n\t\tdo{\n\t\t\t\/\/output login @ machine $\n\t\t\tprompt();\n\t\t\tgetline(cin, line);\n\t\t} while (line[0] == '#');\n\n\t\t\/\/look for '#', if find erase everything until the end of line\n\t\tsize_t found = line.find('#');\n\t\tif (found != std::string::npos)\n\t\t\tline.erase(found, line.length() - found);\n\n\t\t\/\/create a dynamic char that is a copy of input\n\t\tchar * input = new char[line.length() + 1];\n\t\tstrcpy(input, line.c_str());\n\n\t\t\/\/built in function to finish program when typed 'EXIT'\n\t\tif (memcmp(input, \"exit\", 4) == 0) exit(0);\n\n\n\t\tindex = 0;\n\t\tpch = strtok(input, \" \");\n\n\t\twhile (pch != NULL){\n\t\t\tstr[index] = pch;\n\t\t\tpch = strtok(NULL, \" \");\n\t\t\tindex++;\n\t\t}\n\n\t\tstr[index] = NULL;\n\n\t\texecute(str, index);\n\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <sstream>\n#include <unistd.h> \/\/ sysconf()?\n#include <sys\/sysinfo.h>\n#include <linux\/kernel.h> \/\/ SI_LOAD_SHIFT\n\n#include \"load.h\"\n#include \"..\/luts.h\"\n\nstd::string load_string( bool use_colors = false ) {\n std::ostringstream oss;\n\n float f = static_cast<float>(1 << SI_LOAD_SHIFT);\n\n struct sysinfo sinfo;\n sysinfo(&sinfo);\n\n if( use_colors ) {\n \/\/ Likely does not work on BSD, but not tested\n unsigned number_of_cpus = sysconf( _SC_NPROCESSORS_ONLN );\n\n float recent_load = sinfo.loads[0] \/ f;\n\n \/\/ colors range from zero to twice the number of cpu's \n \/\/ for the most recent load metric\n unsigned load_percent = static_cast< unsigned int >( \n recent_load \/ number_of_cpus * 0.5f * 100.0f );\n \n if( load_percent > 100 )\n load_percent = 100;\n \n oss << load_lut[load_percent];\n }\n \n \/\/ set precision so we get results like \"0.22\"\n oss.setf( std::ios::fixed );\n oss.precision(2);\n \n oss << sinfo.loads[0] \/ f << \" \" << sinfo.load[1] \/ f << \" \" \n\t << sinfo.load[2] \/ f;\n \n if( use_colors )\n oss << \"#[fg=default,bg=default]\";\n\n return oss.str();\n}\n<commit_msg>Fixed typos in linux\/load.cc<commit_after>#include <string>\n#include <sstream>\n#include <unistd.h> \/\/ sysconf()?\n#include <sys\/sysinfo.h>\n#include <linux\/kernel.h> \/\/ SI_LOAD_SHIFT\n\n#include \"load.h\"\n#include \"..\/luts.h\"\n\nstd::string load_string( bool use_colors = false ) {\n std::ostringstream oss;\n\n float f = static_cast<float>(1 << SI_LOAD_SHIFT);\n\n struct sysinfo sinfo;\n sysinfo(&sinfo);\n\n if( use_colors ) {\n \/\/ Likely does not work on BSD, but not tested\n unsigned number_of_cpus = sysconf( _SC_NPROCESSORS_ONLN );\n\n float recent_load = sinfo.loads[0] \/ f;\n\n \/\/ colors range from zero to twice the number of cpu's \n \/\/ for the most recent load metric\n unsigned load_percent = static_cast< unsigned int >( \n recent_load \/ number_of_cpus * 0.5f * 100.0f );\n \n if( load_percent > 100 )\n load_percent = 100;\n \n oss << load_lut[load_percent];\n }\n \n \/\/ set precision so we get results like \"0.22\"\n oss.setf( std::ios::fixed );\n oss.precision(2);\n \n oss << sinfo.loads[0] \/ f << \" \" << sinfo.loads[1] \/ f << \" \" \n\t << sinfo.loads[2] \/ f;\n \n if( use_colors )\n oss << \"#[fg=default,bg=default]\";\n\n return oss.str();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n\/\/#include <stdio.h>\n#include <errno.h>\n\/\/#include <stdlib.h>\n\nusing namespace std;\n\nvoid connectors(string userinput, vector<int> &x, vector<int> &y, bool &first) {\n\tfor(unsigned int i = 0; i < userinput.size() - 1; i++) {\n\t\tif((userinput.at(i) == '|') && (userinput.at(i + 1) == '|')) {\n\t\t\tx.push_back(0);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == '&') && (userinput.at(i + 1) == '&')) {\n\t\t\tx.push_back(1);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == ';')) {\n\t\t\tx.push_back(2);\n\t\t\ty.push_back(i);\n\t\t}\n\t}\n\ty.push_back(0);\n}\n\nint main() {\n\tstring userinput = \"\";\n\tstring login;\n\tif(!getlogin())\n\t\tperror(\"getlogin\"); \n\telse \n\t\tlogin = getlogin(); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\t\n\n\tchar limits[5] = \";&| \";\n\tbool ext = false;\n\twhile(!ext) {\n\t\tcout << getlogin() << \"@\" << hostname << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tgetline(cin, userinput);\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tconnectors(userinput, c_pat, c_pos, first);\n\t\tint x = 0;\n\t\tint b = 0;\n\t\tint y = 0;\n\t\tchar *arg[100000];\n\t\twhile(c_pos.at(y) != 0) {\n\t\t\tif(c_pat.size() == 0)\n\t\t\t\tstrcpy(command, userinput.c_str());\n\t\t\telse\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\tcommand_a = strtok(command,limits);\n\t\t\twhile(command_a != NULL) {\n\t\t\t\targ[b] = command_a;\n\t\t\t\tcommand_a = strtok(NULL, limits);\n\t\t\t\tb++;\n\t\t\t}\n\t\t\tint i = fork();\n\t\t\tif(i == -1)\n\t\t\t\tperror(\"fork\");\n\t\t\tif(i == 0) {\n\t\t\t\tif(execvp(arg[0], arg) == -1)\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tint status;\n\t\t\twait(&status);\n\t\t\tfor(int i = 0; i < 100; i++) \n\t\t\t\tcout << arg[i];\n\t\t\tx = c_pos.at(y);\n\t\t\ty++;\n\t\t\tb = 0;\n\t\t}\n\t}\t\n\treturn 0;\n}\n<commit_msg>close to figuring the problem out<commit_after>#include <cstdlib>\n#include <sys\/wait.h>\n#include <string> \n#include <vector>\n#include <cstring>\n#include <iostream>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n\/\/#include <stdio.h>\n#include <errno.h>\n\/\/#include <stdlib.h>\n\nusing namespace std;\n\nvoid connectors(string userinput, vector<int> &x, vector<int> &y, bool &first) {\n\tfor(unsigned int i = 0; i < userinput.size() - 1; i++) {\n\t\tif((userinput.at(i) == '|') && (userinput.at(i + 1) == '|')) {\n\t\t\tx.push_back(0);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == '&') && (userinput.at(i + 1) == '&')) {\n\t\t\tx.push_back(1);\n\t\t\ty.push_back(i);\n\t\t}\n\t\telse if((userinput.at(i) == ';')) {\n\t\t\tx.push_back(2);\n\t\t\ty.push_back(i);\n\t\t}\n\t}\n\ty.push_back(0);\n}\n\nint main() {\n\tstring userinput = \"\";\n\tstring login;\n\tif(!getlogin())\n\t\tperror(\"getlogin\"); \n\telse \n\t\tlogin = getlogin(); \n\tchar hostname[128]; \n\tif(gethostname(hostname, sizeof hostname))\n\t\tperror(\"gethostname\");\n\t\n\n\tchar limits[5] = \";&| \";\n\tbool ext = false;\n\twhile(!ext) {\n\t\tcout << getlogin() << \"@\" << hostname << \" $ \";\n\t\tchar *command_a;\n\t\tchar *command;\n\t\tgetline(cin, userinput);\n\t\tcommand = new char[userinput.size()];\n\t\tvector<int> c_pat;\n\t\tvector<int> c_pos;\n\t\tbool first = false;\n\t\tconnectors(userinput, c_pat, c_pos, first);\n\t\tint x = 0;\n\t\tint b = 0;\n\t\tint y = 0;\n\t\tchar *arg[100000];\n\t\twhile(c_pos.at(y) != 0) {\n\t\t\tif(c_pat.size() == 0)\n\t\t\t\tstrcpy(command, userinput.c_str());\n\t\t\telse\n\t\t\t\tstrcpy(command, userinput.substr(x, c_pos.at(y) - x).c_str());\n\t\t\tcommand_a = strtok(command,limits);\n\t\t\tcout << command_a[0];\n\t\t\twhile(command_a != NULL) {\n\t\t\t\targ[b] = command_a;\n\t\t\t\tcommand_a = strtok(NULL, limits);\n\t\t\t\tb++;\n\t\t\t}\n\t\t\tint i = fork();\n\t\t\tif(i == -1)\n\t\t\t\tperror(\"fork\");\n\t\t\tif(i == 0) {\n\t\t\t\tif(execvp(arg[0], arg) == -1)\n\t\t\t\t\tperror(\"execvp\");\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\tint status;\n\t\t\twait(&status);\n\t\t\tx = c_pos.at(y);\n\t\t\ty++;\n\t\t\tb = 0;\n\t\t}\n\t}\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016-2017 gtalent2@gmail.com\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <QApplication>\n#include <QDebug>\n#include <QDesktopWidget>\n#include <QDialog>\n#include <QFileDialog>\n#include <QGridLayout>\n#include <QHeaderView>\n#include <QLabel>\n#include <QLineEdit>\n#include <QMenuBar>\n#include <QPluginLoader>\n#include <QSettings>\n#include <QTextStream>\n#include <QVector>\n\n#include \"lib\/json.hpp\"\n#include \"lib\/oxfstreeview.hpp\"\n#include \"lib\/project.hpp\"\n#include \"lib\/wizard.hpp\"\n\n#include \"mainwindow.hpp\"\n\nnamespace nostalgia {\nnamespace studio {\n\nconst QString MainWindow::StateFilePath = \"studio_state.json\";\n\nMainWindow::MainWindow(QString profilePath) {\n\tm_profilePath = profilePath;\n\t\/\/ load in profile file\n\tNostalgiaStudioProfile profile;\n\tQFile file(profilePath);\n\tif (file.exists()) {\n\t\tfile.open(QIODevice::ReadOnly);\n\t\tQTextStream in(&file);\n\t\treadJson(in.readAll(), &profile);\n\t}\n\n\tauto screenSize = QApplication::desktop()->screenGeometry();\n\n\t\/\/ set window to 75% of screen width, and center NostalgiaStudioProfile\n\tauto sizePct = 0.75;\n\tresize(screenSize.width() * sizePct, screenSize.height() * sizePct);\n\tmove(-x(), -y());\n\tmove(screenSize.width() * (1 - sizePct) \/ 2, screenSize.height() * (1 - sizePct) \/ 2);\n\n\tsetWindowTitle(profile.appName);\n\n\tm_tabbar = new QTabBar(this);\n\tsetCentralWidget(m_tabbar);\n\n\tsetupMenu();\n\tsetupProjectExplorer();\n\tstatusBar(); \/\/ setup status bar\n\n\tloadPlugins(profile);\n\n\treadState();\n}\n\nMainWindow::~MainWindow() {\n\tcloseProject();\n\tfor (auto f : m_cleanupTasks) {\n\t\tf();\n\t}\n}\n\nvoid MainWindow::loadPlugins(NostalgiaStudioProfile profile) {\n\tfor (auto p : profile.plugins) {\n#if defined(Q_OS_WIN)\n\t\tauto libName = p.libName + \".dll\";\n#elif defined(Q_OS_MAC)\n\t\tauto libName = \"lib\" + p.libName + \".dylib\";\n#else\n\t\tauto libName = \"lib\" + p.libName + \".so\";\n#endif\n\t\tauto pluginPath = QFileInfo(m_profilePath).absolutePath() + \"\/\" + p.dir + \"\/\" + libName;\n\n\t\tauto loader = new QPluginLoader(pluginPath);\n\t\tauto plugin = qobject_cast<Plugin*>(loader->instance());\n\t\tif (plugin) {\n\t\t\tm_cleanupTasks.push_back([loader]() {\n\t\t\t\tloader->unload();\n\t\t\t\tdelete loader;\n\t\t\t});\n\t\t\tm_plugins.push_back(plugin);\n\t\t}\n\t}\n}\n\nvoid MainWindow::setupMenu() {\n\tauto menu = menuBar();\n\tauto fileMenu = menu->addMenu(tr(\"&File\"));\n\tm_viewMenu = menu->addMenu(tr(\"&View\"));\n\n\t\/\/ New...\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"&New...\"),\n\t\ttr(\"\"),\n\t\tQKeySequence::New,\n\t\tthis,\n\t\tSLOT(showNewWizard())\n\t);\n\n\t\/\/ Import...\n\tm_importAction = addAction(\n\t\tfileMenu,\n\t\ttr(\"&Import...\"),\n\t\ttr(\"\"),\n\t\tthis,\n\t\tSLOT(showImportWizard())\n\t);\n\tm_importAction->setEnabled(false);\n\n\t\/\/ Open Project\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"&Open Project\"),\n\t\ttr(\"\"),\n\t\tQKeySequence::Open,\n\t\tthis,\n\t\tSLOT(openProject())\n\t);\n\n\t\/\/ Exit\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"E&xit\"),\n\t\ttr(\"Exit the application\"),\n\t\tQKeySequence::Quit,\n\t\tQApplication::quit\n\t);\n}\n\nvoid MainWindow::setupProjectExplorer() {\n\t\/\/ setup dock\n\tauto dock = new QDockWidget(tr(\"Project\"), this);\n\tdock->setAllowedAreas(Qt::LeftDockWidgetArea | Qt::RightDockWidgetArea);\n\tdock->setObjectName(\"Project Explorer\");\n\taddDockWidget(Qt::LeftDockWidgetArea, dock);\n\tresizeDocks({dock}, {(int) (width() * 0.25)}, Qt::Horizontal);\n\n\t\/\/ setup tree view\n\tm_projectExplorer = new QTreeView(dock);\n\tm_projectExplorer->header()->hide();\n\tdock->setWidget(m_projectExplorer);\n}\n\nvoid MainWindow::addDockWidget(Qt::DockWidgetArea area, QDockWidget *dockWidget) {\n\tQMainWindow::addDockWidget(area, dockWidget);\n\tm_viewMenu->addAction(dockWidget->toggleViewAction());\n\tm_dockWidgets.push_back(dockWidget);\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip, const QObject *tgt, const char *cb) {\n\tauto action = menu->addAction(text);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, SIGNAL(triggered()), tgt, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip,\n QKeySequence::StandardKey key, const QObject *tgt, const char *cb) {\n\tauto action = menu->addAction(text);\n\taction->setShortcuts(key);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, SIGNAL(triggered()), tgt, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip,\n QKeySequence::StandardKey key, void (*cb)()) {\n\tauto action = menu->addAction(text);\n\taction->setShortcuts(key);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, &QAction::triggered, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nint MainWindow::readState(QString path) {\n\tint err = 0;\n\n\tQSettings settings(\"Drinking Tea\", \"nostalgia-studio\");\n\tsettings.beginGroup(\"MainWindow\");\n\trestoreGeometry(settings.value(\"geometry\").toByteArray());\n\trestoreState(settings.value(\"windowState\").toByteArray());\n\tsettings.endGroup();\n\n\tQString json;\n\tQFile file(path);\n\terr |= !file.open(QIODevice::ReadOnly);\n\tjson = QTextStream(&file).readAll();\n\tfile.close();\n\terr |= readJson(json, &m_state);\n\terr |= openProject(m_state.projectPath);\n\treturn err;\n}\n\nint MainWindow::writeState(QString path) {\n\tint err = 0;\n\n\tQSettings settings(\"Drinking Tea\", \"nostalgia-studio\");\n\tsettings.beginGroup(\"MainWindow\");\n\tsettings.setValue(\"geometry\", saveGeometry());\n\tsettings.setValue(\"windowState\", saveState());\n\tsettings.endGroup();\n\n\tQString json;\n\terr |= writeJson(&json, &m_state);\n\tQFile file(path);\n\terr |= !file.open(QIODevice::WriteOnly);\n\tQTextStream(&file) << json;\n\tfile.close();\n\treturn err;\n}\n\nint MainWindow::openProject(QString projectPath) {\n\tauto err = closeProject();\n\tauto project = new Project(projectPath);\n\terr |= project->openRomFs();\n\tif (err == 0) {\n\t\tif (m_project) {\n\t\t\tdelete m_project;\n\t\t\tm_project = nullptr;\n\t\t}\n\t\tm_project = project;\n\t\tm_oxfsView = new OxFSModel(m_project->romFs());\n\t\tm_projectExplorer->setModel(m_oxfsView);\n\t\tconnect(m_project, SIGNAL(updated(QString)), m_oxfsView, SLOT(updateFile(QString)));\n\t\tm_importAction->setEnabled(true);\n\t\tm_state.projectPath = projectPath;\n\t}\n\treturn err;\n}\n\nint MainWindow::closeProject() {\n\tauto err = 0;\n\tif (m_project) {\n\t\tdisconnect(m_project, SIGNAL(updated(QString)), m_oxfsView, SLOT(updateFile(QString)));\n\n\t\tdelete m_project;\n\t\tm_project = nullptr;\n\n\t\tdelete m_oxfsView;\n\t\tm_oxfsView = nullptr;\n\t}\n\tif (m_projectExplorer->model()) {\n\t\tdelete m_projectExplorer->model();\n\t}\n\tm_projectExplorer->setModel(nullptr);\n\n\tm_importAction->setEnabled(false);\n\n\tm_state.projectPath = \"\";\n\treturn err;\n}\n\nvoid MainWindow::onExit() {\n\twriteState();\n}\n\n\n\/\/ private slots\n\nint MainWindow::openProject() {\n\tauto projectPath = QFileDialog::getExistingDirectory(this, tr(\"Select Project Directory...\"), QDir::homePath());\n\tint err = 0;\n\tif (projectPath != \"\") {\n\t\terr |= openProject(projectPath);\n\t\tif (err == 0) {\n\t\t\terr |= writeState();\n\t\t}\n\t}\n\treturn err;\n}\n\nvoid MainWindow::showNewWizard() {\n\tconst QString PROJECT_NAME = \"projectName\";\n\tconst QString PROJECT_PATH = \"projectPath\";\n\tWizard wizard(tr(\"New...\"));\n\tauto ws = new WizardSelect();\n\twizard.addPage(ws);\n\tws->addOption(tr(\"Project\"),\n\t\t[&wizard, PROJECT_NAME, PROJECT_PATH]() {\n\t\t\tQVector<QWizardPage*> pgs;\n\t\t\tauto pg = new WizardFormPage();\n\t\t\tpg->addLineEdit(tr(\"Project &Name:\"), PROJECT_NAME + \"*\", \"\", [PROJECT_PATH, pg, &wizard](QString projectName) {\n\t\t\t\t\tauto projectPath = wizard.field(PROJECT_PATH).toString();\n\t\t\t\t\tauto path = projectPath + \"\/\" + projectName;\n\t\t\t\t\tif (!QDir(path).exists()) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpg->showValidationError(tr(\"This project directory already exists.\"));\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t);\n\t\t\tpg->addPathBrowse(tr(\"Project &Path:\"), PROJECT_PATH + \"*\", QDir::homePath(), QFileDialog::Directory);\n\t\t\tpgs.push_back(pg);\n\t\t\tpgs.push_back(new WizardConclusionPage(tr(\"Creating project: \") + \"%1\/%2\", {PROJECT_PATH, PROJECT_NAME}));\n\n\t\t\treturn pgs;\n\t\t}\n\t);\n\twizard.setAccept([this, &wizard, ws, PROJECT_NAME, PROJECT_PATH]() -> int {\n\t\t\tauto projectName = wizard.field(PROJECT_NAME).toString();\n\t\t\tauto projectPath = wizard.field(PROJECT_PATH).toString();\n\t\t\tif (QDir(projectPath).exists()) {\n\t\t\t\tauto path = projectPath + \"\/\" + projectName;\n\t\t\t\tif (!QDir(path).exists()) {\n\t\t\t\t\tProject(path).create();\n\t\t\t\t\topenProject(path);\n\t\t\t\t\treturn 0;\n\t\t\t\t} else {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t}\n\t);\n\twizard.show();\n\twizard.exec();\n}\n\nvoid MainWindow::showImportWizard() {\n\tconst QString TILESHEET_NAME = \"projectName\";\n\tconst QString IMPORT_PATH = \"projectPath\";\n\tconst QString BPP = \"bpp\";\n\tWizard wizard(tr(\"Import...\"));\n\tauto ws = new WizardSelect();\n\twizard.addPage(ws);\n\n\tPluginArgs args {\n\t\t.project = m_project\n\t};\n\tfor (auto p : m_plugins) {\n\t\tfor (auto w : p->importWizards(args)) {\n\t\t\tws->addOption(w.name, w.make);\n\t\t}\n\t}\n\n\twizard.show();\n\twizard.exec();\n}\n\nvoid MainWindow::refreshProjectExplorer(QString path) {\n\tif (m_oxfsView) {\n\t\tm_oxfsView->updateFile(path);\n\t\tqInfo() << \"asdf\\n\";\n\t}\n}\n\n}\n}\n<commit_msg>Move application specific state to QSettings<commit_after>\/*\n * Copyright 2016-2017 gtalent2@gmail.com\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <QApplication>\n#include <QDebug>\n#include <QDesktopWidget>\n#include <QDialog>\n#include <QFileDialog>\n#include <QGridLayout>\n#include <QHeaderView>\n#include <QLabel>\n#include <QLineEdit>\n#include <QMenuBar>\n#include <QPluginLoader>\n#include <QSettings>\n#include <QTextStream>\n#include <QVector>\n\n#include \"lib\/json.hpp\"\n#include \"lib\/oxfstreeview.hpp\"\n#include \"lib\/project.hpp\"\n#include \"lib\/wizard.hpp\"\n\n#include \"mainwindow.hpp\"\n\nnamespace nostalgia {\nnamespace studio {\n\nconst QString MainWindow::StateFilePath = \"studio_state.json\";\n\nMainWindow::MainWindow(QString profilePath) {\n\tm_profilePath = profilePath;\n\t\/\/ load in profile file\n\tNostalgiaStudioProfile profile;\n\tQFile file(profilePath);\n\tif (file.exists()) {\n\t\tfile.open(QIODevice::ReadOnly);\n\t\tQTextStream in(&file);\n\t\treadJson(in.readAll(), &profile);\n\t}\n\n\tauto screenSize = QApplication::desktop()->screenGeometry();\n\n\t\/\/ set window to 75% of screen width, and center NostalgiaStudioProfile\n\tauto sizePct = 0.75;\n\tresize(screenSize.width() * sizePct, screenSize.height() * sizePct);\n\tmove(-x(), -y());\n\tmove(screenSize.width() * (1 - sizePct) \/ 2, screenSize.height() * (1 - sizePct) \/ 2);\n\n\tsetWindowTitle(profile.appName);\n\n\tm_tabbar = new QTabBar(this);\n\tsetCentralWidget(m_tabbar);\n\n\tsetupMenu();\n\tsetupProjectExplorer();\n\tstatusBar(); \/\/ setup status bar\n\n\tloadPlugins(profile);\n\n\treadState();\n}\n\nMainWindow::~MainWindow() {\n\tcloseProject();\n\tfor (auto f : m_cleanupTasks) {\n\t\tf();\n\t}\n}\n\nvoid MainWindow::loadPlugins(NostalgiaStudioProfile profile) {\n\tfor (auto p : profile.plugins) {\n#if defined(Q_OS_WIN)\n\t\tauto libName = p.libName + \".dll\";\n#elif defined(Q_OS_MAC)\n\t\tauto libName = \"lib\" + p.libName + \".dylib\";\n#else\n\t\tauto libName = \"lib\" + p.libName + \".so\";\n#endif\n\t\tauto pluginPath = QFileInfo(m_profilePath).absolutePath() + \"\/\" + p.dir + \"\/\" + libName;\n\n\t\tauto loader = new QPluginLoader(pluginPath);\n\t\tauto plugin = qobject_cast<Plugin*>(loader->instance());\n\t\tif (plugin) {\n\t\t\tm_cleanupTasks.push_back([loader]() {\n\t\t\t\tloader->unload();\n\t\t\t\tdelete loader;\n\t\t\t});\n\t\t\tm_plugins.push_back(plugin);\n\t\t}\n\t}\n}\n\nvoid MainWindow::setupMenu() {\n\tauto menu = menuBar();\n\tauto fileMenu = menu->addMenu(tr(\"&File\"));\n\tm_viewMenu = menu->addMenu(tr(\"&View\"));\n\n\t\/\/ New...\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"&New...\"),\n\t\ttr(\"\"),\n\t\tQKeySequence::New,\n\t\tthis,\n\t\tSLOT(showNewWizard())\n\t);\n\n\t\/\/ Import...\n\tm_importAction = addAction(\n\t\tfileMenu,\n\t\ttr(\"&Import...\"),\n\t\ttr(\"\"),\n\t\tthis,\n\t\tSLOT(showImportWizard())\n\t);\n\tm_importAction->setEnabled(false);\n\n\t\/\/ Open Project\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"&Open Project\"),\n\t\ttr(\"\"),\n\t\tQKeySequence::Open,\n\t\tthis,\n\t\tSLOT(openProject())\n\t);\n\n\t\/\/ Exit\n\taddAction(\n\t\tfileMenu,\n\t\ttr(\"E&xit\"),\n\t\ttr(\"Exit the application\"),\n\t\tQKeySequence::Quit,\n\t\tQApplication::quit\n\t);\n}\n\nvoid MainWindow::setupProjectExplorer() {\n\t\/\/ setup dock\n\tauto dock = new QDockWidget(tr(\"Project\"), this);\n\tdock->setAllowedAreas(Qt::LeftDockWidgetArea | Qt::RightDockWidgetArea);\n\tdock->setObjectName(\"Project Explorer\");\n\taddDockWidget(Qt::LeftDockWidgetArea, dock);\n\tresizeDocks({dock}, {(int) (width() * 0.25)}, Qt::Horizontal);\n\n\t\/\/ setup tree view\n\tm_projectExplorer = new QTreeView(dock);\n\tm_projectExplorer->header()->hide();\n\tdock->setWidget(m_projectExplorer);\n}\n\nvoid MainWindow::addDockWidget(Qt::DockWidgetArea area, QDockWidget *dockWidget) {\n\tQMainWindow::addDockWidget(area, dockWidget);\n\tm_viewMenu->addAction(dockWidget->toggleViewAction());\n\tm_dockWidgets.push_back(dockWidget);\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip, const QObject *tgt, const char *cb) {\n\tauto action = menu->addAction(text);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, SIGNAL(triggered()), tgt, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip,\n QKeySequence::StandardKey key, const QObject *tgt, const char *cb) {\n\tauto action = menu->addAction(text);\n\taction->setShortcuts(key);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, SIGNAL(triggered()), tgt, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nQAction *MainWindow::addAction(QMenu *menu, QString text, QString toolTip,\n QKeySequence::StandardKey key, void (*cb)()) {\n\tauto action = menu->addAction(text);\n\taction->setShortcuts(key);\n\taction->setStatusTip(toolTip);\n\tauto conn = connect(action, &QAction::triggered, cb);\n\tm_cleanupTasks.push_back([this, conn]() {\n\t\tQObject::disconnect(conn);\n\t});\n\treturn action;\n}\n\nint MainWindow::readState(QString path) {\n\tint err = 0;\n\n\tQSettings settings(\"Drinking Tea\", \"nostalgia-studio\");\n\tsettings.beginGroup(\"MainWindow\");\n\trestoreGeometry(settings.value(\"geometry\").toByteArray());\n\trestoreState(settings.value(\"windowState\").toByteArray());\n\tauto json = settings.value(\"json\").toString();\n\terr |= readJson(json, &m_state);\n\tsettings.endGroup();\n\n\terr |= openProject(m_state.projectPath);\n\n\treturn err;\n}\n\nint MainWindow::writeState(QString path) {\n\tint err = 0;\n\n\t\/\/ generate JSON for application specific state info\n\tQString json;\n\terr |= writeJson(&json, &m_state);\n\n\tQSettings settings(\"Drinking Tea\", \"nostalgia-studio\");\n\tsettings.beginGroup(\"MainWindow\");\n\tsettings.setValue(\"geometry\", saveGeometry());\n\tsettings.setValue(\"windowState\", saveState());\n\tsettings.setValue(\"json\", json);\n\tsettings.endGroup();\n\n\treturn err;\n}\n\nint MainWindow::openProject(QString projectPath) {\n\tauto err = closeProject();\n\tauto project = new Project(projectPath);\n\terr |= project->openRomFs();\n\tif (err == 0) {\n\t\tif (m_project) {\n\t\t\tdelete m_project;\n\t\t\tm_project = nullptr;\n\t\t}\n\t\tm_project = project;\n\t\tm_oxfsView = new OxFSModel(m_project->romFs());\n\t\tm_projectExplorer->setModel(m_oxfsView);\n\t\tconnect(m_project, SIGNAL(updated(QString)), m_oxfsView, SLOT(updateFile(QString)));\n\t\tm_importAction->setEnabled(true);\n\t\tm_state.projectPath = projectPath;\n\t}\n\treturn err;\n}\n\nint MainWindow::closeProject() {\n\tauto err = 0;\n\tif (m_project) {\n\t\tdisconnect(m_project, SIGNAL(updated(QString)), m_oxfsView, SLOT(updateFile(QString)));\n\n\t\tdelete m_project;\n\t\tm_project = nullptr;\n\n\t\tdelete m_oxfsView;\n\t\tm_oxfsView = nullptr;\n\t}\n\tif (m_projectExplorer->model()) {\n\t\tdelete m_projectExplorer->model();\n\t}\n\tm_projectExplorer->setModel(nullptr);\n\n\tm_importAction->setEnabled(false);\n\n\tm_state.projectPath = \"\";\n\treturn err;\n}\n\nvoid MainWindow::onExit() {\n\twriteState();\n}\n\n\n\/\/ private slots\n\nint MainWindow::openProject() {\n\tauto projectPath = QFileDialog::getExistingDirectory(this, tr(\"Select Project Directory...\"), QDir::homePath());\n\tint err = 0;\n\tif (projectPath != \"\") {\n\t\terr |= openProject(projectPath);\n\t\tif (err == 0) {\n\t\t\terr |= writeState();\n\t\t}\n\t}\n\treturn err;\n}\n\nvoid MainWindow::showNewWizard() {\n\tconst QString PROJECT_NAME = \"projectName\";\n\tconst QString PROJECT_PATH = \"projectPath\";\n\tWizard wizard(tr(\"New...\"));\n\tauto ws = new WizardSelect();\n\twizard.addPage(ws);\n\tws->addOption(tr(\"Project\"),\n\t\t[&wizard, PROJECT_NAME, PROJECT_PATH]() {\n\t\t\tQVector<QWizardPage*> pgs;\n\t\t\tauto pg = new WizardFormPage();\n\t\t\tpg->addLineEdit(tr(\"Project &Name:\"), PROJECT_NAME + \"*\", \"\", [PROJECT_PATH, pg, &wizard](QString projectName) {\n\t\t\t\t\tauto projectPath = wizard.field(PROJECT_PATH).toString();\n\t\t\t\t\tauto path = projectPath + \"\/\" + projectName;\n\t\t\t\t\tif (!QDir(path).exists()) {\n\t\t\t\t\t\treturn 0;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpg->showValidationError(tr(\"This project directory already exists.\"));\n\t\t\t\t\t\treturn 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t);\n\t\t\tpg->addPathBrowse(tr(\"Project &Path:\"), PROJECT_PATH + \"*\", QDir::homePath(), QFileDialog::Directory);\n\t\t\tpgs.push_back(pg);\n\t\t\tpgs.push_back(new WizardConclusionPage(tr(\"Creating project: \") + \"%1\/%2\", {PROJECT_PATH, PROJECT_NAME}));\n\n\t\t\treturn pgs;\n\t\t}\n\t);\n\twizard.setAccept([this, &wizard, ws, PROJECT_NAME, PROJECT_PATH]() -> int {\n\t\t\tauto projectName = wizard.field(PROJECT_NAME).toString();\n\t\t\tauto projectPath = wizard.field(PROJECT_PATH).toString();\n\t\t\tif (QDir(projectPath).exists()) {\n\t\t\t\tauto path = projectPath + \"\/\" + projectName;\n\t\t\t\tif (!QDir(path).exists()) {\n\t\t\t\t\tProject(path).create();\n\t\t\t\t\topenProject(path);\n\t\t\t\t\treturn 0;\n\t\t\t\t} else {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\treturn 2;\n\t\t\t}\n\t\t}\n\t);\n\twizard.show();\n\twizard.exec();\n}\n\nvoid MainWindow::showImportWizard() {\n\tconst QString TILESHEET_NAME = \"projectName\";\n\tconst QString IMPORT_PATH = \"projectPath\";\n\tconst QString BPP = \"bpp\";\n\tWizard wizard(tr(\"Import...\"));\n\tauto ws = new WizardSelect();\n\twizard.addPage(ws);\n\n\tPluginArgs args {\n\t\t.project = m_project\n\t};\n\tfor (auto p : m_plugins) {\n\t\tfor (auto w : p->importWizards(args)) {\n\t\t\tws->addOption(w.name, w.make);\n\t\t}\n\t}\n\n\twizard.show();\n\twizard.exec();\n}\n\nvoid MainWindow::refreshProjectExplorer(QString path) {\n\tif (m_oxfsView) {\n\t\tm_oxfsView->updateFile(path);\n\t}\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2008, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of the Willow Garage nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Ioan Sucan *\/\n\n#include \"ompl\/util\/RandomNumbers.h\"\n#include \"ompl\/util\/Exception.h\"\n#include \"ompl\/util\/Console.h\"\n#include <boost\/random\/lagged_fibonacci.hpp>\n#include <boost\/random\/uniform_int.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n\/\/\/ The seed the user asked for (cannot be 0)\nstatic boost::uint32_t& getUserSetSeed()\n{\n static boost::uint32_t userSetSeed = 0;\n return userSetSeed;\n}\n\n\/\/\/ Flag indicating whether the first seed has already been generated or not\nstatic bool& getFirstSeedGenerated()\n{\n static bool firstSeedGenerated = false;\n return firstSeedGenerated;\n}\n\n\/\/\/ Compute the first seed to be used; this function should be called only once\nstatic boost::uint32_t firstSeed()\n{\n \/\/\/ The value of the first seed\n static boost::uint32_t firstSeedValue = 0;\n\n static boost::mutex fsLock;\n boost::mutex::scoped_lock slock(fsLock);\n\n if (getFirstSeedGenerated())\n return firstSeedValue;\n\n if (getUserSetSeed() != 0)\n firstSeedValue = getUserSetSeed();\n else\n firstSeedValue =\n (boost::uint32_t)(boost::posix_time::microsec_clock::universal_time() -\n boost::posix_time::ptime(boost::date_time::min_date_time)).total_microseconds();\n getFirstSeedGenerated() = true;\n\n return firstSeedValue;\n}\n\n\/\/\/ We use a different random number generator for the seeds of the\n\/\/\/ Other random generators. The root seed is from the number of\n\/\/\/ nano-seconds in the current time.\nstatic boost::uint32_t nextSeed()\n{\n static boost::mutex rngMutex;\n boost::mutex::scoped_lock slock(rngMutex);\n static boost::lagged_fibonacci607 sGen(firstSeed());\n static boost::uniform_int<> sDist(1, 1000000000);\n static boost::variate_generator<boost::lagged_fibonacci607&, boost::uniform_int<> > s(sGen, sDist);\n return s();\n}\n\nboost::uint32_t ompl::RNG::getSeed()\n{\n return firstSeed();\n}\n\nvoid ompl::RNG::setSeed(boost::uint32_t seed)\n{\n if (getFirstSeedGenerated())\n {\n OMPL_ERROR(\"Random number generation already started. Changing seed now will not lead to deterministic sampling.\");\n }\n if (seed == 0)\n {\n OMPL_WARN(\"Random generator seed cannot be 0. Using 1 instead.\");\n getUserSetSeed() = 1;\n }\n else\n getUserSetSeed() = seed;\n}\n\nompl::RNG::RNG() : generator_(nextSeed()),\n uniDist_(0, 1),\n normalDist_(0, 1),\n uni_(generator_, uniDist_),\n normal_(generator_, normalDist_)\n{\n}\n\ndouble ompl::RNG::halfNormalReal(double r_min, double r_max, double focus)\n{\n assert(r_min <= r_max);\n\n const double mean = r_max - r_min;\n double v = gaussian(mean, mean\/focus);\n\n if (v > mean) v = 2.0 * mean - v;\n double r = v >= 0.0 ? v + r_min : r_min;\n return r > r_max ? r_max : r;\n}\n\nint ompl::RNG::halfNormalInt(int r_min, int r_max, double focus)\n{\n int r = (int)floor(halfNormalReal((double)r_min, (double)(r_max) + 1.0, focus));\n return (r > r_max) ? r_max : r;\n}\n\n\/\/ From: \"Uniform Random Rotations\", Ken Shoemake, Graphics Gems III,\n\/\/ pg. 124-132\nvoid ompl::RNG::quaternion(double value[4])\n{\n double x0 = uni_();\n double r1 = sqrt(1.0 - x0), r2 = sqrt(x0);\n double t1 = 2.0 * boost::math::constants::pi<double>() * uni_(), t2 = 2.0 * boost::math::constants::pi<double>() * uni_();\n double c1 = cos(t1), s1 = sin(t1);\n double c2 = cos(t2), s2 = sin(t2);\n value[0] = s1 * r1;\n value[1] = c1 * r1;\n value[2] = s2 * r2;\n value[3] = c2 * r2;\n}\n\n\/\/ From Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning, by James Kuffner, ICRA 2004\nvoid ompl::RNG::eulerRPY(double value[3])\n{\n value[0] = boost::math::constants::pi<double>() * (-2.0 * uni_() + 1.0);\n value[1] = acos(1.0 - 2.0 * uni_()) - boost::math::constants::pi<double>() \/ 2.0;\n value[2] = boost::math::constants::pi<double>() * (-2.0 * uni_() + 1.0);\n}\n<commit_msg>fix for static initialization issues in random seed generator<commit_after>\/*********************************************************************\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2008, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of the Willow Garage nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Ioan Sucan *\/\n\n#include \"ompl\/util\/RandomNumbers.h\"\n#include \"ompl\/util\/Exception.h\"\n#include \"ompl\/util\/Console.h\"\n#include <boost\/random\/lagged_fibonacci.hpp>\n#include <boost\/random\/uniform_int.hpp>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/thread\/once.hpp>\n#include <boost\/scoped_ptr.hpp>\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/math\/constants\/constants.hpp>\n\n\/\/\/ @cond IGNORE\nnamespace\n{\n \/\/\/ We use a different random number generator for the seeds of the\n \/\/\/ other random generators. The root seed is from the number of\n \/\/\/ nano-seconds in the current time, or given by the user.\n class RNGSeedGenerator\n {\n public:\n RNGSeedGenerator() :\n someSeedsGenerated_(false),\n firstSeed_((boost::uint32_t)(boost::posix_time::microsec_clock::universal_time() -\n boost::posix_time::ptime(boost::date_time::min_date_time)).total_microseconds()),\n sGen_(firstSeed_),\n sDist_(1, 1000000000),\n s_(sGen_, sDist_)\n {\n }\n\n boost::uint32_t firstSeed()\n {\n boost::mutex::scoped_lock slock(rngMutex_);\n return firstSeed_;\n }\n\n void setSeed(boost::uint32_t seed)\n {\n boost::mutex::scoped_lock slock(rngMutex_);\n if (seed > 0)\n {\n if (someSeedsGenerated_)\n {\n OMPL_ERROR(\"Random number generation already started. Changing seed now will not lead to deterministic sampling.\");\n }\n else\n {\n \/\/ In this case, since no seeds have been generated yet, so we remember this seed as the first one.\n firstSeed_ = seed;\n }\n }\n else\n {\n if (someSeedsGenerated_)\n {\n OMPL_WARN(\"Random generator seed cannot be 0. Ignoring seed.\");\n return;\n }\n else\n {\n OMPL_WARN(\"Random generator seed cannot be 0. Using 1 instead.\");\n seed = 1;\n }\n }\n sGen_.seed(seed);\n }\n\n boost::uint32_t nextSeed()\n {\n boost::mutex::scoped_lock slock(rngMutex_);\n someSeedsGenerated_ = true;\n return s_();\n }\n\n private:\n bool someSeedsGenerated_;\n boost::uint32_t firstSeed_;\n boost::mutex rngMutex_;\n boost::lagged_fibonacci607 sGen_;\n boost::uniform_int<> sDist_;\n boost::variate_generator<boost::lagged_fibonacci607&, boost::uniform_int<> > s_;\n };\n\n static boost::once_flag g_once = BOOST_ONCE_INIT;\n static boost::scoped_ptr<RNGSeedGenerator> g_RNGSeedGenerator;\n\n void initRNGSeedGenerator()\n {\n g_RNGSeedGenerator.reset(new RNGSeedGenerator());\n }\n\n RNGSeedGenerator& getRNGSeedGenerator()\n {\n boost::call_once(&initRNGSeedGenerator, g_once);\n return *g_RNGSeedGenerator;\n }\n} \/\/ namespace\n\/\/\/ @endcond\n\nboost::uint32_t ompl::RNG::getSeed()\n{\n return getRNGSeedGenerator().firstSeed();\n}\n\nvoid ompl::RNG::setSeed(boost::uint32_t seed)\n{\n getRNGSeedGenerator().setSeed(seed);\n}\n\nompl::RNG::RNG() :\n generator_(getRNGSeedGenerator().nextSeed()),\n uniDist_(0, 1),\n normalDist_(0, 1),\n uni_(generator_, uniDist_),\n normal_(generator_, normalDist_)\n{\n}\n\ndouble ompl::RNG::halfNormalReal(double r_min, double r_max, double focus)\n{\n assert(r_min <= r_max);\n\n const double mean = r_max - r_min;\n double v = gaussian(mean, mean\/focus);\n\n if (v > mean) v = 2.0 * mean - v;\n double r = v >= 0.0 ? v + r_min : r_min;\n return r > r_max ? r_max : r;\n}\n\nint ompl::RNG::halfNormalInt(int r_min, int r_max, double focus)\n{\n int r = (int)floor(halfNormalReal((double)r_min, (double)(r_max) + 1.0, focus));\n return (r > r_max) ? r_max : r;\n}\n\n\/\/ From: \"Uniform Random Rotations\", Ken Shoemake, Graphics Gems III,\n\/\/ pg. 124-132\nvoid ompl::RNG::quaternion(double value[4])\n{\n double x0 = uni_();\n double r1 = sqrt(1.0 - x0), r2 = sqrt(x0);\n double t1 = 2.0 * boost::math::constants::pi<double>() * uni_(), t2 = 2.0 * boost::math::constants::pi<double>() * uni_();\n double c1 = cos(t1), s1 = sin(t1);\n double c2 = cos(t2), s2 = sin(t2);\n value[0] = s1 * r1;\n value[1] = c1 * r1;\n value[2] = s2 * r2;\n value[3] = c2 * r2;\n}\n\n\/\/ From Effective Sampling and Distance Metrics for 3D Rigid Body Path Planning, by James Kuffner, ICRA 2004\nvoid ompl::RNG::eulerRPY(double value[3])\n{\n value[0] = boost::math::constants::pi<double>() * (-2.0 * uni_() + 1.0);\n value[1] = acos(1.0 - 2.0 * uni_()) - boost::math::constants::pi<double>() \/ 2.0;\n value[2] = boost::math::constants::pi<double>() * (-2.0 * uni_() + 1.0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n Solar Server\n esp8266 with access point mode and client ssid config\n\n Based on FSWebServer\n https:\/\/github.com\/esp8266\/Arduino\/blob\/master\/libraries\/ESP8266WebServer\/examples\/FSBrowser\/FSBrowser.ino\n\n access the sample web page at http:\/\/solar-server.local\n edit the page by going to http:\/\/solar-server.local\/edit\n*\/\n\n#ifndef UNIT_TEST \/\/ IMPORTANT LINE!\n\n#include <ESP8266WiFi.h>\n#include <ESP8266mDNS.h>\n#include <SolarServer.hpp>\n#include <Config.hpp>\n#include <Utils.hpp>\n#include <ESP8266HTTPClient.h>\n\n\/\/temp\n#include <Arduino.h>\n#include <SD.h>\n#include <SDController.hpp>\n\nconst char* host = \"solar-server\";\n\n\/\/ post variables\nconst char* post_host = \"192.168.0.109\";\nconst int post_port = 3000;\nString url = \"\/\";\n\n\n\/\/ instances for config and server\nConfig config;\nSolarServer server(80);\nSDController sdc;\n\/\/ Use WiFiClient class to create TCP connections\nWiFiClient client;\n\n#define USE_SERIAL Serial\n\nvoid apMode() {\n \/\/ AP Init\n Serial.print(\"Starting AP Mode...\");\n\n \/\/ AP to be open with the same host name\n WiFi.mode(WIFI_AP);\n WiFi.softAP(host);\n IPAddress myIP = WiFi.softAPIP();\n\n Serial.print(\"AP IP address: \" + myIP);\n Serial.println();\n\n \/\/ mdns helper\n MDNS.begin(host);\n\n \/\/ start server and have the server handle AP config on default route\n String indexPath = \"\/config.htm\";\n server.startRouter(indexPath);\n\n Serial.println(\"HTTP server started in AP mode\");\n}\n\nvoid clientMode(String ssid, String password) {\n\n \/\/WIFI INIT\n Serial.println(\"Connecting to: \" + ssid);\n\n Serial.println(\"currently configured SSID: \" + String(WiFi.SSID()));\n\n Serial.println(\"new ssid encountered...\" + ssid);\n WiFi.mode(WIFI_STA);\n WiFi.begin(ssid.c_str(), password.c_str());\n\n \/\/ mdns helper\n MDNS.begin(host);\n\n \/\/ try reconnect 4 times, then apMode.\n int count = 0;\n while (WiFi.status() != WL_CONNECTED) {\n Serial.println(\"waiting for re-connect\" + String(WiFi.status()));\n delay(500);\n count++;\n if (count == 20) {\n return apMode();\n }\n }\n\n \/\/ debug\n Serial.println(\"\");\n Serial.print(\"Connected! IP address: \");\n Serial.println(WiFi.localIP());\n Serial.print(\"Open http:\/\/\");\n Serial.print(host);\n Serial.println(\".local to see the file browser\");\n\n \/\/ start the server\n String indexPath = \"\/\";\n server.startRouter(indexPath);\n\n}\n\nvoid setup(void) {\n\n \/\/ Serial Init\n Serial.begin(115200);\n Serial.println();\n Serial.setDebugOutput(true);\n\n sdc.init();\n\n \/\/ SPIFFS setup\n SPIFFS.begin();\n {\n fs::Dir dir = SPIFFS.openDir(\"\/\");\n while (dir.next()) {\n String fileName = dir.fileName();\n size_t fileSize = dir.fileSize();\n Serial.printf(\"FS File: %s, size: %s\\n\", fileName.c_str(), formatBytes(fileSize).c_str());\n }\n Serial.printf(\"\\n\");\n }\n\n \/\/ disable ssid caching \/\/ debug\n \/\/ WiFi.persistent(false);\n \/\/ WiFi.forceSleepWake();\n \/\/ return apMode();\n\n \/\/ if no config.txt exists, run AP mode, else run in client mode\n if ( !config.exists() ) {\n\n apMode();\n\n } else {\n\n Serial.println(\"attempting config read...\");\n config.readConfigSettings();\n Serial.print(\"SSID=\");\n\n String ssid = config.ssid();\n String password = config.password();\n String customHost = config.host();\n\n Serial.println(config.ssid());\n\n if (ssid.length() == 0) {\n apMode();\n } else {\n clientMode(ssid, password);\n }\n\n }\n\n}\n\nvoid loop(void) {\n\n \/\/ server.handleClient();\n\n\n Serial.println(\"DELAY-----\");\n delay(10000);\n\n \/\/ open sd and file\n String fileName = \"bernie.JPG\";\n SD.begin(0);\n File myFile = SD.open(fileName);\n String fileSize = String(myFile.size());\n\n Serial.println();\n Serial.println(\"bernie file exists\");\n Serial.println(myFile);\n\n if (myFile) {\n\n \/\/ print content length and host\n Serial.println(\"contentLength\");\n Serial.println(fileSize);\n Serial.print(\"connecting to \");\n Serial.println(post_host);\n\n \/\/ try connect or return on fail\n if (!client.connect(post_host, post_port)) {\n Serial.println(\"http post connection failed\");\n return;\n }\n\n \/\/ We now create a URI for the request\n Serial.println(\"Connected to server\");\n Serial.print(\"Requesting URL: \");\n Serial.println(url);\n\n\n \/\/ Make a HTTP request and add HTTP headers\n String boundary = \"----WebKitFormBoundaryjg2qVIUS8teOAbN3\";\n String contentType = \"image\/jpg\";\n String portString = String(post_port);\n String hostString = String(post_host);\n\n \/\/ post header\n String postHeader = \"POST \" + url + \" HTTP\/1.1\\r\\n\";\n postHeader += \"Host: \" + hostString + \":\" + portString + \"\\r\\n\";\n postHeader += \"Content-Type: multipart\/form-data; boundary=\" + boundary + \"\\r\\n\";\n postHeader += \"Authorization: Bearer ullEKAEPV24AAAAAAAAAdiesM-JCKe-YY93zroJO1MzxmZm8ZRh2qmYCAvc6fREW\\r\\n\";\n postHeader += \"Dropbox-API-Arg: {\\\"path\\\": \\\" \" + fileName + \" \\\",\\\"mode\\\": \\\"add\\\",\\\"autorename\\\": true,\\\"mute\\\": false}\\r\\n\";\n postHeader += \"User-Agent: Arduino\\r\\n\";\n postHeader += \"Connection: close\\r\\n\";\n\n \/\/ request header\n String requestHead = \"--\" + boundary + \"\\r\\n\";\n requestHead += \"Content-Disposition: form-data; name=\\\"attachments\\\"; filename=\\\"\" + fileName + \"\\\"\\r\\n\";\n requestHead += \"Content-Type: \" + contentType + \"\\r\\n\\r\\n\";\n\n \/\/ request tail\n String tail = \"\\r\\n--\" + boundary + \"--\\r\\n\\r\\n\";\n\n \/\/ content length\n int contentLength = requestHead.length() + myFile.size() + tail.length();\n postHeader += \"Content-Length: \" + String(contentLength, DEC) + \"\\n\\n\";\n\n \/\/ send post header\n char charBuf0[postHeader.length() + 1];\n postHeader.toCharArray(charBuf0, postHeader.length() + 1);\n client.write(charBuf0);\n Serial.print(charBuf0);\n\n \/\/ send request buffer\n char charBuf1[requestHead.length() + 1];\n requestHead.toCharArray(charBuf1, requestHead.length() + 1);\n client.write(charBuf1);\n Serial.print(charBuf1);\n\n \/\/ create buffer\n const int bufSize = 2048;\n byte clientBuf[bufSize];\n int clientCount = 0;\n\n while (myFile.available()) {\n\n clientBuf[clientCount] = myFile.read();\n\n clientCount++;\n\n if (clientCount > (bufSize - 1)) {\n \/\/ Serial.println(\"Buffered and POST ing\");\n \/\/ send request buffer\n \/\/ for (int i = 0; i < bufSize; i++) {\n \/\/ client.write(clientBuf[i]);\n \/\/ }\n client.write((const uint8_t *)clientBuf, bufSize);\n clientCount = 0;\n }\n \/\/ client.write(myFile.read());\n\n }\n\n if (clientCount > 0) {\n Serial.println(\"Send LAST buffer\");\n\n \/\/ send last request\n \/\/ for (int i = 0; i < clientCount; i++) {\n \/\/ client.write(clientBuf[i]);\n \/\/ }\n client.write((const uint8_t *)clientBuf, clientCount);\n }\n\n \/\/ send tail\n char charBuf3[tail.length() + 1];\n tail.toCharArray(charBuf3, tail.length() + 1);\n client.write(charBuf3);\n Serial.print(charBuf3);\n\n\n\n \/\/ Read all the lines of the reply from server and print them to Serial\n Serial.println(\"request sent\");\n while (client.connected()) {\n Serial.println(\"while client connected\");\n String line = client.readStringUntil('\\n');\n if (line == \"\\r\") {\n Serial.println(\"headers received\");\n break;\n }\n }\n String line = client.readStringUntil('\\n');\n\n Serial.println(\"reply was:\");\n Serial.println(\"==========\");\n Serial.println(line);\n Serial.println(\"==========\");\n Serial.println(\"closing connection\");\n\n\n \/\/ close the file:\n myFile.close();\n\n\n }\n\n\n}\n\n#endif\n<commit_msg>working with aws<commit_after>\/**\n Solar Server\n esp8266 with access point mode and client ssid config\n\n Based on FSWebServer\n https:\/\/github.com\/esp8266\/Arduino\/blob\/master\/libraries\/ESP8266WebServer\/examples\/FSBrowser\/FSBrowser.ino\n\n access the sample web page at http:\/\/solar-server.local\n edit the page by going to http:\/\/solar-server.local\/edit\n*\/\n\n#ifndef UNIT_TEST \/\/ IMPORTANT LINE!\n\n#include <ESP8266WiFi.h>\n#include <ESP8266mDNS.h>\n#include <SolarServer.hpp>\n#include <Config.hpp>\n#include <Utils.hpp>\n#include <ESP8266HTTPClient.h>\n\n\/\/temp\n#include <Arduino.h>\n#include <SD.h>\n#include <SDController.hpp>\n\nconst char* host = \"solar-server\";\n\n\/\/ post variables\nconst char* post_host = \"solar-server.s3.amazonaws.com\";\nconst int post_port = 80 ;\nString url = \"\/\";\n\n\n\/\/ instances for config and server\nConfig config;\nSolarServer server(80);\nSDController sdc;\n\/\/ Use WiFiClient class to create TCP connections\nWiFiClient client;\n\n#define USE_SERIAL Serial\n\nvoid apMode() {\n \/\/ AP Init\n Serial.print(\"Starting AP Mode...\");\n\n \/\/ AP to be open with the same host name\n WiFi.mode(WIFI_AP);\n WiFi.softAP(host);\n IPAddress myIP = WiFi.softAPIP();\n\n Serial.print(\"AP IP address: \" + myIP);\n Serial.println();\n\n \/\/ mdns helper\n MDNS.begin(host);\n\n \/\/ start server and have the server handle AP config on default route\n String indexPath = \"\/config.htm\";\n server.startRouter(indexPath);\n\n Serial.println(\"HTTP server started in AP mode\");\n}\n\nvoid clientMode(String ssid, String password) {\n\n \/\/WIFI INIT\n Serial.println(\"Connecting to: \" + ssid);\n\n Serial.println(\"currently configured SSID: \" + String(WiFi.SSID()));\n\n Serial.println(\"new ssid encountered...\" + ssid);\n WiFi.mode(WIFI_STA);\n WiFi.begin(ssid.c_str(), password.c_str());\n\n \/\/ mdns helper\n MDNS.begin(host);\n\n \/\/ try reconnect 4 times, then apMode.\n int count = 0;\n while (WiFi.status() != WL_CONNECTED) {\n Serial.println(\"waiting for re-connect\" + String(WiFi.status()));\n delay(500);\n count++;\n if (count == 20) {\n return apMode();\n }\n }\n\n \/\/ debug\n Serial.println(\"\");\n Serial.print(\"Connected! IP address: \");\n Serial.println(WiFi.localIP());\n Serial.print(\"Open http:\/\/\");\n Serial.print(host);\n Serial.println(\".local to see the file browser\");\n\n \/\/ start the server\n String indexPath = \"\/\";\n server.startRouter(indexPath);\n\n}\n\nvoid setup(void) {\n\n \/\/ Serial Init\n Serial.begin(115200);\n Serial.println();\n Serial.setDebugOutput(true);\n\n sdc.init();\n\n \/\/ SPIFFS setup\n SPIFFS.begin();\n {\n fs::Dir dir = SPIFFS.openDir(\"\/\");\n while (dir.next()) {\n String fileName = dir.fileName();\n size_t fileSize = dir.fileSize();\n Serial.printf(\"FS File: %s, size: %s\\n\", fileName.c_str(), formatBytes(fileSize).c_str());\n }\n Serial.printf(\"\\n\");\n }\n\n \/\/ disable ssid caching \/\/ debug\n \/\/ WiFi.persistent(false);\n \/\/ WiFi.forceSleepWake();\n \/\/ return apMode();\n\n \/\/ if no config.txt exists, run AP mode, else run in client mode\n if ( !config.exists() ) {\n\n apMode();\n\n } else {\n\n Serial.println(\"attempting config read...\");\n config.readConfigSettings();\n Serial.print(\"SSID=\");\n\n String ssid = config.ssid();\n String password = config.password();\n String customHost = config.host();\n\n Serial.println(config.ssid());\n\n if (ssid.length() == 0) {\n apMode();\n } else {\n clientMode(ssid, password);\n }\n\n }\n\n}\n\nvoid loop(void) {\n\n \/\/ server.handleClient();\n\n\n Serial.println(\"DELAY-----\");\n delay(10000);\n\n \/\/ open sd and file\n String fileName = \"2.JPG\";\n SD.begin(0);\n File myFile = SD.open(fileName);\n String fileSize = String(myFile.size());\n\n Serial.println();\n Serial.println(\"bernie file exists\");\n Serial.println(myFile);\n\n if (myFile) {\n\n \/\/ print content length and host\n Serial.println(\"contentLength\");\n Serial.println(fileSize);\n Serial.print(\"connecting to \");\n Serial.println(post_host);\n\n \/\/ try connect or return on fail\n if (!client.connect(post_host, post_port)) {\n Serial.println(\"http post connection failed\");\n return;\n }\n\n \/\/ We now create a URI for the request\n Serial.println(\"Connected to server\");\n Serial.print(\"Requesting URL: \");\n Serial.println(url);\n\n\n \/\/ Make a HTTP request and add HTTP headers\n String boundary = \"SolarServerBoundaryjg2qVIUS8teOAbN3\";\n String contentType = \"image\/jpeg\";\n String portString = String(post_port);\n String hostString = String(post_host);\n\n \/\/ post header\n String postHeader = \"POST \" + url + \" HTTP\/1.1\\r\\n\";\n postHeader += \"Host: \" + hostString + \":\" + portString + \"\\r\\n\";\n postHeader += \"Content-Type: multipart\/form-data; boundary=\" + boundary + \"\\r\\n\";\n postHeader += \"Accept: text\/html,application\/xhtml+xml,application\/xml;q=0.9,*\/*;q=0.8\\r\\n\";\n postHeader += \"Accept-Encoding: gzip,deflate\\r\\n\";\n postHeader += \"Accept-Charset: ISO-8859-1,utf-8;q=0.7,*;q=0.7\\r\\n\";\n postHeader += \"User-Agent: Arduino\/Solar-Server\\r\\n\";\n postHeader += \"Keep-Alive: 300\\r\\n\";\n postHeader += \"Connection: keep-alive\\r\\n\";\n postHeader += \"Accept-Language: en-us\\r\\n\";\n\n \/\/ key header\n String keyHeader = \"--\" + boundary + \"\\r\\n\";\n keyHeader += \"Content-Disposition: form-data; name=\\\"key\\\"\\r\\n\\r\\n\";\n keyHeader += \"${filename}\\r\\n\";\n\n \/\/ request header\n String requestHead = \"--\" + boundary + \"\\r\\n\";\n requestHead += \"Content-Disposition: form-data; name=\\\"file\\\"; filename=\\\"\" + fileName + \"\\\"\\r\\n\";\n requestHead += \"Content-Type: \" + contentType + \"\\r\\n\\r\\n\";\n\n \/\/ request tail\n String tail = \"\\r\\n--\" + boundary + \"--\\r\\n\\r\\n\";\n\n \/\/ content length\n int contentLength = keyHeader.length() + requestHead.length() + myFile.size() + tail.length();\n postHeader += \"Content-Length: \" + String(contentLength, DEC) + \"\\n\\n\";\n\n \/\/ send post header\n char charBuf0[postHeader.length() + 1];\n postHeader.toCharArray(charBuf0, postHeader.length() + 1);\n client.write(charBuf0);\n Serial.print(charBuf0);\n\n \/\/ send key header\n char charBufKey[keyHeader.length() + 1];\n keyHeader.toCharArray(charBufKey, keyHeader.length() + 1);\n client.write(charBufKey);\n Serial.print(charBufKey);\n\n \/\/ send request buffer\n char charBuf1[requestHead.length() + 1];\n requestHead.toCharArray(charBuf1, requestHead.length() + 1);\n client.write(charBuf1);\n Serial.print(charBuf1);\n\n \/\/ create buffer\n const int bufSize = 2048;\n byte clientBuf[bufSize];\n int clientCount = 0;\n\n while (myFile.available()) {\n\n clientBuf[clientCount] = myFile.read();\n\n clientCount++;\n\n if (clientCount > (bufSize - 1)) {\n client.write((const uint8_t *)clientBuf, bufSize);\n clientCount = 0;\n }\n\n }\n\n if (clientCount > 0) {\n client.write((const uint8_t *)clientBuf, clientCount);\n Serial.println(\"Sent LAST buffer\");\n }\n\n \/\/ send tail\n char charBuf3[tail.length() + 1];\n tail.toCharArray(charBuf3, tail.length() + 1);\n client.write(charBuf3);\n Serial.print(charBuf3);\n\n\n\n \/\/ Read all the lines of the reply from server and print them to Serial\n Serial.println(\"request sent\");\n while (client.connected()) {\n \/\/ Serial.println(\"while client connected\");\n String line = client.readStringUntil('\\n');\n Serial.println(line);\n if (line == \"\\r\") {\n Serial.println(\"headers received\");\n break;\n }\n }\n\n while (client.connected()) {\n \/\/ Serial.println(\"while client connected\");\n String line = client.readStringUntil('\\n');\n Serial.println(line);\n if (line == \"\\r\") {\n Serial.println(\"body response received\");\n break;\n }\n }\n String line = client.readStringUntil('\\n');\n\n Serial.println(\"reply was:\");\n Serial.println(\"==========\");\n Serial.println(line);\n Serial.println(\"==========\");\n Serial.println(\"closing connection\");\n\n\n \/\/ close the file:\n myFile.close();\n\n\n }\n\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <iostream>\n\n#include \"Server.h\"\n#include \"commons.h\"\n\nint main(int argc, char *argv[]) {\n if (argc < 2) {\n std::cout << \"Použití: .\/server -port <port> -players <maxPlayers> -width <width> -height <height>\" << std::endl;\n exit(1);\n }\n\n std::unique_ptr<SnakeServer::ServerSettings> settings = std::make_unique<SnakeServer::ServerSettings>();\n int i = 0;\n\n while (i < argc) {\n std::string param(argv[++i]);\n std::cout << \"Testuji argument: \" << param << std::endl;\n\n if (param.compare(\"-port\") == 0) {\n std::string port = argv[++i];\n\n if (!Commons::isInteger(port)) {\n perror(\"Port musí být číslo\");\n exit(1);\n }\n\n settings->port = std::stoi(port);\n std::cout << \"Nastavuji port na: \" << port << std::endl;\n continue;\n }\n\n if (param == \"-players\") {\n std::string playersCount = argv[++i];\n\n if (!Commons::isInteger(playersCount)) {\n perror(\"Počet hráčů musí být číslo\");\n exit(1);\n }\n\n settings->maxPlayers = std::stoi(playersCount);\n std::cout << \"Nastavuji maximalni pocet hracu na: \" << playersCount << std::endl;\n continue;\n }\n\n if (param == \"-w\" || param == \"-width\") {\n std::string width = argv[++i];\n\n if (!Commons::isInteger(width)) {\n perror(\"Šířka mapy musí být číslo\");\n exit(1);\n }\n\n settings->width = std::stoi(width);\n continue;\n }\n\n if (param == \"-h\" || param == \"-height\") {\n std::string height = argv[++i];\n\n if (!Commons::isInteger(height)) {\n perror(\"Výška mapy musí být číslo\");\n exit(1);\n }\n\n settings->height = std::stoi(height);\n continue;\n }\n }\n\n std::cout << \"Program arguments parsed...\" << std::endl;\n\n\/\/ try {\n\/\/ SnakeServer::Server server;\n\/\/ server.init(settings);\n\/\/ server.start();\n\/\/ } catch (std::exception ex) {\n\/\/ std::cout << ex.what() << std::endl;\n\/\/ }\n\n std::cout << \"Unexpected exit\" << std::endl;\n return 0;\n}<commit_msg>Opravení parsování argumentů<commit_after>#include <stdio.h>\n#include <iostream>\n\n#include \"Server.h\"\n#include \"commons.h\"\n\nint main(int argc, char *argv[]) {\n if (argc < 2) {\n std::cout << \"Použití: .\/server -port <port> -players <maxPlayers> -width <width> -height <height>\" << std::endl;\n exit(1);\n }\n\n std::unique_ptr<SnakeServer::ServerSettings> settings = std::make_unique<SnakeServer::ServerSettings>();\n int i = 0;\n\n while (i < argc - 1) {\n std::string param(argv[++i]);\n std::cout << \"Testuji argument: \" << param << std::endl;\n\n if (param.compare(\"-port\") == 0) {\n std::string port = argv[++i];\n\n if (!Commons::isInteger(port)) {\n perror(\"Port musí být číslo\");\n exit(1);\n }\n\n settings->port = std::stoi(port);\n std::cout << \"Nastavuji port na: \" << port << std::endl;\n continue;\n }\n\n if (param == \"-players\") {\n std::string playersCount = argv[++i];\n\n if (!Commons::isInteger(playersCount)) {\n perror(\"Počet hráčů musí být číslo\");\n exit(1);\n }\n\n settings->maxPlayers = std::stoi(playersCount);\n std::cout << \"Nastavuji maximalni pocet hracu na: \" << playersCount << std::endl;\n continue;\n }\n\n if (param == \"-w\" || param == \"-width\") {\n std::string width = argv[++i];\n\n if (!Commons::isInteger(width)) {\n perror(\"Šířka mapy musí být číslo\");\n exit(1);\n }\n\n settings->width = std::stoi(width);\n continue;\n }\n\n if (param == \"-h\" || param == \"-height\") {\n std::string height = argv[++i];\n\n if (!Commons::isInteger(height)) {\n perror(\"Výška mapy musí být číslo\");\n exit(1);\n }\n\n settings->height = std::stoi(height);\n continue;\n }\n }\n\n std::cout << \"Program arguments parsed...\" << std::endl;\n\n\/\/ try {\n\/\/ SnakeServer::Server server;\n\/\/ server.init(settings);\n\/\/ server.start();\n\/\/ } catch (std::exception ex) {\n\/\/ std::cout << ex.what() << std::endl;\n\/\/ }\n\n std::cout << \"Unexpected exit\" << std::endl;\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n *\tCopyright © 2012-2016 Naim A.\n *\n *\tThis file is part of UDPT.\n *\n *\t\tUDPT is free software: you can redistribute it and\/or modify\n *\t\tit under the terms of the GNU General Public License as published by\n *\t\tthe Free Software Foundation, either version 3 of the License, or\n *\t\t(at your option) any later version.\n *\n *\t\tUDPT is distributed in the hope that it will be useful,\n *\t\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n *\t\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n *\t\tGNU General Public License for more details.\n *\n *\t\tYou should have received a copy of the GNU General Public License\n *\t\talong with UDPT. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <iostream>\n\n#include <cstdlib>\t\/\/ atoi\n#include <csignal>\t\/\/ signal\n#include <cstring>\t\/\/ strlen\n#include <memory>\n#include <boost\/program_options.hpp>\n\n#include \"multiplatform.h\"\n#include \"udpTracker.hpp\"\n#include \"http\/httpserver.hpp\"\n#include \"http\/webapp.hpp\"\n#include \"tracker.hpp\"\n#include \"service.hpp\"\n\nstatic void _signal_handler(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGTERM:\n\t\t\tUDPT::Tracker::getInstance().stop();\n\t\t\tbreak;\n\t}\n}\n\n#ifdef linux\nstatic void daemonize(const boost::program_options::variables_map& conf)\n{\n\tif (1 == ::getppid()) return; \/\/ already a daemon\n\tint r = ::fork();\n\tif (0 > r) ::exit(-1); \/\/ failed to daemonize.\n\tif (0 < r) ::exit(0); \/\/ parent exists.\n\n\t::umask(0);\n\t::setsid();\n\n\t\/\/ close all fds.\n\tfor (int i = ::getdtablesize(); i >=0; --i)\n\t{\n\t\t::close(i);\n\t}\n\n\t::chdir(conf[\"daemon.chdir\"].as<std::string>().c_str());\n\n}\n#endif\n\n#ifdef WIN32 \nvoid _close_wsa()\n{\n\t::WSACleanup();\n}\n#endif\n\nint main(int argc, char *argv[])\n{\n#ifdef WIN32\n\tWSADATA wsadata;\n\t::WSAStartup(MAKEWORD(2, 2), &wsadata);\n\t::atexit(_close_wsa);\n#endif\n\n\tboost::program_options::options_description commandLine(\"Command line options\");\n\tcommandLine.add_options()\n\t\t(\"help,h\", \"produce help message\")\n\t\t(\"all-help\", \"displays all help\")\n\t\t(\"test,t\", \"test configuration file\")\n\t\t(\"config,c\", boost::program_options::value<std::string>()->default_value(\"\/etc\/udpt.conf\"), \"configuration file to use\")\n#ifdef linux\n\t\t(\"interactive,i\", \"doesn't start as daemon\")\n#endif\n#ifdef WIN32\n\t\t(\"service,s\", boost::program_options::value<std::string>(), \"start\/stop\/install\/uninstall service\")\n#endif\n\t\t;\n\n\n\tboost::program_options::options_description configOptions(\"Configuration options\");\n\tconfigOptions.add_options()\n\t\t(\"db.driver\", boost::program_options::value<std::string>()->default_value(\"sqlite3\"), \"database driver to use\")\n\t\t(\"db.param\", boost::program_options::value<std::string>()->default_value(\"\/var\/lib\/udpt.db\"), \"database connection parameters\")\n\t\t\n\t\t(\"tracker.is_dynamic\", boost::program_options::value<bool>()->default_value(true), \"Sets if the tracker is dynamic\")\n\t\t(\"tracker.port\", boost::program_options::value<unsigned short>()->default_value(6969), \"UDP port to listen on\")\n\t\t(\"tracker.threads\", boost::program_options::value<unsigned>()->default_value(5), \"threads to run (UDP only)\")\n\t\t(\"tracker.allow_remotes\", boost::program_options::value<bool>()->default_value(true), \"allows clients to report remote IPs\")\n\t\t(\"tracker.allow_iana_ips\", boost::program_options::value<bool>()->default_value(false), \"allows IANA reserved IPs to connect (useful for debugging)\")\n\t\t(\"tracker.announce_interval\", boost::program_options::value<unsigned>()->default_value(1800), \"announce interval\")\n\t\t(\"tracker.cleanup_interval\", boost::program_options::value<unsigned>()->default_value(120), \"sets database cleanup interval\")\n\t\t\n\t\t(\"apiserver.enable\", boost::program_options::value<bool>()->default_value(0), \"Enable API server?\")\n\t\t(\"apiserver.threads\", boost::program_options::value<unsigned short>()->default_value(1), \"threads for API server\")\n\t\t(\"apiserver.port\", boost::program_options::value<unsigned short>()->default_value(6969), \"TCP port to listen on\")\n\n\t\t(\"logging.filename\", boost::program_options::value<std::string>()->default_value(\"stdout\"), \"file to write logs to\")\n\t\t(\"logging.level\", boost::program_options::value<std::string>()->default_value(\"warning\"), \"log level (error\/warning\/info\/debug)\")\n\n#ifdef linux\n\t\t(\"daemon.chdir\", boost::program_options::value<std::string>()->default_value(\"\/\"), \"home directory for daemon\")\n#endif\n#ifdef WIN32 \n\t\t(\"service.name\", boost::program_options::value<std::string>()->default_value(\"udpt\"), \"service name to use\")\n#endif\n\t\t;\n\n\tboost::program_options::variables_map var_map;\n\tboost::program_options::store(boost::program_options::parse_command_line(argc, argv, commandLine), var_map);\n\tboost::program_options::notify(var_map);\n\n\tif (var_map.count(\"help\"))\n\t{\n\t\tstd::cout << \"UDP Tracker (UDPT) \" << VERSION << \" (\" << PLATFORM << \")\" << std::endl\n\t\t\t<< \"Copyright 2012-2016 Naim A. <naim94a@gmail.com>\" << std::endl\n\t\t\t<< \"Build Date: \" << __DATE__ << std::endl << std::endl;\n\t\t\n\t\tstd::cout << commandLine << std::endl;\n\t\treturn 0;\n\t}\n\n\tif (var_map.count(\"all-help\"))\n\t{\n\t\tstd::cout << commandLine << std::endl;\n\t\tstd::cout << configOptions << std::endl;\n\t\treturn 0;\n\t}\n\n\tstd::string config_filename(var_map[\"config\"].as<std::string>());\n\tbool isTest = (0 != var_map.count(\"test\"));\n\n\tif (var_map.count(\"config\"))\n\t{\n\t\ttry\n\t\t{\n\t\t\tboost::program_options::basic_parsed_options<wchar_t> parsed_options = boost::program_options::parse_config_file<wchar_t>(config_filename.c_str(), configOptions);\n\t\t\tboost::program_options::store(\n\t\t\t\tparsed_options,\n\t\t\t\tvar_map);\n\t\t}\n\t\tcatch (const boost::program_options::error& ex)\n\t\t{\n\t\t\tstd::cerr << \"ERROR: \" << ex.what() << std::endl;\n\t\t\treturn -1;\n\t\t}\n\n\t\tif (isTest)\n\t\t{\n\t\t\tstd::cout << \"Config OK\" << std::endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t\/\/ setup logging...\n\n\tboost::log::sources::severity_channel_logger_mt<> logger(boost::log::keywords::channel = \"main\");\n\n#ifdef linux\n\tif (!var_map.count(\"interactive\"))\n\t{\n\t\tdaemonize(var_map);\n\t}\n\t::signal(SIGTERM, _signal_handler);\n#endif\n#ifdef WIN32 \n\tUDPT::Service svc(var_map);\n\tif (var_map.count(\"service\"))\n\t{\n\t\tconst std::string& action = var_map[\"service\"].as<std::string>();\n\t\ttry\n\t\t{\n\t\t\tif (\"install\" == action)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Installing service...\" << std::endl;\n\t\t\t\tsvc.install();\n\t\t\t\tstd::cerr << \"Installed.\" << std::endl;\n\t\t\t}\n\t\t\telse if (\"uninstall\" == action)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Removing service...\" << std::endl;\n\t\t\t\tsvc.uninstall();\n\t\t\t\tstd::cerr << \"Removed.\" << std::endl;\n\t\t\t}\n\t\t\telse if (\"start\" == action)\n\t\t\t{\n\t\t\t\tsvc.start();\n\t\t\t}\n\t\t\telse if (\"stop\" == action)\n\t\t\t{\n\t\t\t\tsvc.stop();\n\t\t\t}\n\t\t}\n\t\tcatch (const UDPT::OSError& ex)\n\t\t{\n\t\t\tstd::cerr << \"An operating system error occurred: \" << ex.getErrorCode() << std::endl;\n\t\t\treturn -1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\ttry \n\t{\n\t\tsvc.setup();\n\t}\n\tcatch (const OSError& err)\n\t{\n\t\tif (ERROR_FAILED_SERVICE_CONTROLLER_CONNECT != err.getErrorCode())\n\t\t{\n\t\t\tBOOST_LOG_SEV(logger, boost::log::trivial::fatal) << \"Failed to start as a Windows service: (\" << err.getErrorCode() << \"): \" << err.what();\n\t\t\treturn -1;\n\t\t}\n\t}\n#endif\n\n\ttry\n\t{\n\t\tTracker& tracker = UDPT::Tracker::getInstance();\n\t\ttracker.start(var_map);\n\t\ttracker.wait();\n\t}\n\tcatch (const UDPT::UDPTException& ex)\n\t{\n\t\tBOOST_LOG_SEV(logger, boost::log::trivial::fatal) << \"UDPT exception: (\" << ex.getErrorCode() << \"): \" << ex.what();\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Logging to file. WIP<commit_after>\/*\n *\tCopyright © 2012-2016 Naim A.\n *\n *\tThis file is part of UDPT.\n *\n *\t\tUDPT is free software: you can redistribute it and\/or modify\n *\t\tit under the terms of the GNU General Public License as published by\n *\t\tthe Free Software Foundation, either version 3 of the License, or\n *\t\t(at your option) any later version.\n *\n *\t\tUDPT is distributed in the hope that it will be useful,\n *\t\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n *\t\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n *\t\tGNU General Public License for more details.\n *\n *\t\tYou should have received a copy of the GNU General Public License\n *\t\talong with UDPT. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <iostream>\n\n#include <cstdlib>\t\/\/ atoi\n#include <csignal>\t\/\/ signal\n#include <cstring>\t\/\/ strlen\n#include <memory>\n#include <boost\/program_options.hpp>\n#include <boost\/date_time\/posix_time\/posix_time_types.hpp>\n#include <boost\/log\/trivial.hpp>\n#include <boost\/log\/sources\/severity_channel_logger.hpp>\n#include <boost\/log\/sinks\/text_file_backend.hpp>\n#include <boost\/log\/sinks\/async_frontend.hpp>\n#include <boost\/log\/keywords\/format.hpp>\n#include <boost\/log\/expressions.hpp>\n#include <boost\/log\/support\/date_time.hpp>\n#include <boost\/log\/utility\/setup\/common_attributes.hpp>\n\n#include \"multiplatform.h\"\n#include \"udpTracker.hpp\"\n#include \"http\/httpserver.hpp\"\n#include \"http\/webapp.hpp\"\n#include \"tracker.hpp\"\n#include \"service.hpp\"\n\nstatic void _signal_handler(int sig)\n{\n\tswitch (sig)\n\t{\n\t\tcase SIGTERM:\n\t\t\tUDPT::Tracker::getInstance().stop();\n\t\t\tbreak;\n\t}\n}\n\n#ifdef linux\nstatic void daemonize(const boost::program_options::variables_map& conf)\n{\n\tif (1 == ::getppid()) return; \/\/ already a daemon\n\tint r = ::fork();\n\tif (0 > r) ::exit(-1); \/\/ failed to daemonize.\n\tif (0 < r) ::exit(0); \/\/ parent exists.\n\n\t::umask(0);\n\t::setsid();\n\n\t\/\/ close all fds.\n\tfor (int i = ::getdtablesize(); i >=0; --i)\n\t{\n\t\t::close(i);\n\t}\n\n\t::chdir(conf[\"daemon.chdir\"].as<std::string>().c_str());\n\n}\n#endif\n\n#ifdef WIN32 \nvoid _close_wsa()\n{\n\t::WSACleanup();\n}\n#endif\n\nint main(int argc, char *argv[])\n{\n#ifdef WIN32\n\tWSADATA wsadata;\n\t::WSAStartup(MAKEWORD(2, 2), &wsadata);\n\t::atexit(_close_wsa);\n#endif\n\n\tboost::program_options::options_description commandLine(\"Command line options\");\n\tcommandLine.add_options()\n\t\t(\"help,h\", \"produce help message\")\n\t\t(\"all-help\", \"displays all help\")\n\t\t(\"test,t\", \"test configuration file\")\n\t\t(\"config,c\", boost::program_options::value<std::string>()->default_value(\"\/etc\/udpt.conf\"), \"configuration file to use\")\n#ifdef linux\n\t\t(\"interactive,i\", \"doesn't start as daemon\")\n#endif\n#ifdef WIN32\n\t\t(\"service,s\", boost::program_options::value<std::string>(), \"start\/stop\/install\/uninstall service\")\n#endif\n\t\t;\n\n\n\tboost::program_options::options_description configOptions(\"Configuration options\");\n\tconfigOptions.add_options()\n\t\t(\"db.driver\", boost::program_options::value<std::string>()->default_value(\"sqlite3\"), \"database driver to use\")\n\t\t(\"db.param\", boost::program_options::value<std::string>()->default_value(\"\/var\/lib\/udpt.db\"), \"database connection parameters\")\n\t\t\n\t\t(\"tracker.is_dynamic\", boost::program_options::value<bool>()->default_value(true), \"Sets if the tracker is dynamic\")\n\t\t(\"tracker.port\", boost::program_options::value<unsigned short>()->default_value(6969), \"UDP port to listen on\")\n\t\t(\"tracker.threads\", boost::program_options::value<unsigned>()->default_value(5), \"threads to run (UDP only)\")\n\t\t(\"tracker.allow_remotes\", boost::program_options::value<bool>()->default_value(true), \"allows clients to report remote IPs\")\n\t\t(\"tracker.allow_iana_ips\", boost::program_options::value<bool>()->default_value(false), \"allows IANA reserved IPs to connect (useful for debugging)\")\n\t\t(\"tracker.announce_interval\", boost::program_options::value<unsigned>()->default_value(1800), \"announce interval\")\n\t\t(\"tracker.cleanup_interval\", boost::program_options::value<unsigned>()->default_value(120), \"sets database cleanup interval\")\n\t\t\n\t\t(\"apiserver.enable\", boost::program_options::value<bool>()->default_value(0), \"Enable API server?\")\n\t\t(\"apiserver.threads\", boost::program_options::value<unsigned short>()->default_value(1), \"threads for API server\")\n\t\t(\"apiserver.port\", boost::program_options::value<unsigned short>()->default_value(6969), \"TCP port to listen on\")\n\n\t\t(\"logging.filename\", boost::program_options::value<std::string>()->default_value(\"\/var\/log\/udpt.log\"), \"file to write logs to\")\n\t\t(\"logging.level\", boost::program_options::value<std::string>()->default_value(\"warning\"), \"log level (error\/warning\/info\/debug)\")\n\n#ifdef linux\n\t\t(\"daemon.chdir\", boost::program_options::value<std::string>()->default_value(\"\/\"), \"home directory for daemon\")\n#endif\n#ifdef WIN32 \n\t\t(\"service.name\", boost::program_options::value<std::string>()->default_value(\"udpt\"), \"service name to use\")\n#endif\n\t\t;\n\n\tboost::program_options::variables_map var_map;\n\tboost::program_options::store(boost::program_options::parse_command_line(argc, argv, commandLine), var_map);\n\tboost::program_options::notify(var_map);\n\n\tif (var_map.count(\"help\"))\n\t{\n\t\tstd::cout << \"UDP Tracker (UDPT) \" << VERSION << \" (\" << PLATFORM << \")\" << std::endl\n\t\t\t<< \"Copyright 2012-2016 Naim A. <naim94a@gmail.com>\" << std::endl\n\t\t\t<< \"Build Date: \" << __DATE__ << std::endl << std::endl;\n\t\t\n\t\tstd::cout << commandLine << std::endl;\n\t\treturn 0;\n\t}\n\n\tif (var_map.count(\"all-help\"))\n\t{\n\t\tstd::cout << commandLine << std::endl;\n\t\tstd::cout << configOptions << std::endl;\n\t\treturn 0;\n\t}\n\n\tstd::string config_filename(var_map[\"config\"].as<std::string>());\n\tbool isTest = (0 != var_map.count(\"test\"));\n\n\tif (var_map.count(\"config\"))\n\t{\n\t\ttry\n\t\t{\n\t\t\tboost::program_options::basic_parsed_options<wchar_t> parsed_options = boost::program_options::parse_config_file<wchar_t>(config_filename.c_str(), configOptions);\n\t\t\tboost::program_options::store(\n\t\t\t\tparsed_options,\n\t\t\t\tvar_map);\n\t\t}\n\t\tcatch (const boost::program_options::error& ex)\n\t\t{\n\t\t\tstd::cerr << \"ERROR: \" << ex.what() << std::endl;\n\t\t\treturn -1;\n\t\t}\n\n\t\tif (isTest)\n\t\t{\n\t\t\tstd::cout << \"Config OK\" << std::endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t\/\/ setup logging...\n\tboost::log::add_common_attributes();\n\tboost::shared_ptr<boost::log::sinks::text_file_backend> logBackend = boost::make_shared<boost::log::sinks::text_file_backend>(\n\t\tboost::log::keywords::file_name = var_map[\"logging.filename\"].as<std::string>(),\n\t\tboost::log::keywords::auto_flush = true,\n\t\tboost::log::keywords::open_mode = std::ios::out | std::ios::app\n\t);\n\ttypedef boost::log::sinks::asynchronous_sink<boost::log::sinks::text_file_backend> udptSink_t;\n\tboost::shared_ptr<udptSink_t> async_sink (new udptSink_t(logBackend));\n\tasync_sink->set_formatter(\n\t\tboost::log::expressions::stream\n\t\t<< boost::log::expressions::format_date_time<boost::posix_time::ptime>(\"TimeStamp\", \"%Y-%m-%d %H:%M:%S\") << \" \"\n\t\t<< boost::log::expressions::attr<int>(\"Severity\")\n\t\t<< \" [\" << boost::log::expressions::attr<std::string>(\"Channel\") << \"] \\t\"\n\t\t<< boost::log::expressions::smessage\n\t);\n\tboost::log::core::get()->add_sink(async_sink);\n\n\tboost::log::sources::severity_channel_logger_mt<> logger(boost::log::keywords::channel = \"main\");\n\n#ifdef linux\n\tif (!var_map.count(\"interactive\"))\n\t{\n\t\tdaemonize(var_map);\n\t}\n\t::signal(SIGTERM, _signal_handler);\n#endif\n#ifdef WIN32 \n\tUDPT::Service svc(var_map);\n\tif (var_map.count(\"service\"))\n\t{\n\t\tconst std::string& action = var_map[\"service\"].as<std::string>();\n\t\ttry\n\t\t{\n\t\t\tif (\"install\" == action)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Installing service...\" << std::endl;\n\t\t\t\tsvc.install();\n\t\t\t\tstd::cerr << \"Installed.\" << std::endl;\n\t\t\t}\n\t\t\telse if (\"uninstall\" == action)\n\t\t\t{\n\t\t\t\tstd::cerr << \"Removing service...\" << std::endl;\n\t\t\t\tsvc.uninstall();\n\t\t\t\tstd::cerr << \"Removed.\" << std::endl;\n\t\t\t}\n\t\t\telse if (\"start\" == action)\n\t\t\t{\n\t\t\t\tsvc.start();\n\t\t\t}\n\t\t\telse if (\"stop\" == action)\n\t\t\t{\n\t\t\t\tsvc.stop();\n\t\t\t}\n\t\t}\n\t\tcatch (const UDPT::OSError& ex)\n\t\t{\n\t\t\tstd::cerr << \"An operating system error occurred: \" << ex.getErrorCode() << std::endl;\n\t\t\treturn -1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\n\ttry \n\t{\n\t\tsvc.setup();\n\t}\n\tcatch (const OSError& err)\n\t{\n\t\tif (ERROR_FAILED_SERVICE_CONTROLLER_CONNECT != err.getErrorCode())\n\t\t{\n\t\t\tBOOST_LOG_SEV(logger, boost::log::trivial::fatal) << \"Failed to start as a Windows service: (\" << err.getErrorCode() << \"): \" << err.what();\n\t\t\treturn -1;\n\t\t}\n\t}\n#endif\n\n\ttry\n\t{\n\t\tTracker& tracker = UDPT::Tracker::getInstance();\n\t\ttracker.start(var_map);\n\t\ttracker.wait();\n\t}\n\tcatch (const UDPT::UDPTException& ex)\n\t{\n\t\tBOOST_LOG_SEV(logger, boost::log::trivial::fatal) << \"UDPT exception: (\" << ex.getErrorCode() << \"): \" << ex.what();\n\t\treturn -1;\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\nclass Base{\n public:\n Base(){};\n virtual bool evaluate() = 0;\n}\n\nint main () {\n \n \/\/take user input\n string initialCommand = \"\";\n while (true) {\n string login = getlogin();\n char hostname[100];\n gethostname(hostname, 100);\n cout << \"[\" << login << \"@\" << hostname << \"] $ \";\n getline(cin, initialCommand);\n trim(initialCommand);\n\n }\n\n return 0;\n}\n<commit_msg>Started Command Class<commit_after>#include <iostream>\n#include <vector>\n#include <list>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <string.h>\n#include <netdb.h>\n#include <pwd.h>\n#include <sys\/socket.h>\n#include <boost\/algorithm\/string.hpp>\n\nusing namespace std;\nusing namespace boost::algorithm;\n\nclass Base{\n public:\n Base(){};\n virtual bool evaluate() = 0;\n}\n\nclass Command: public Base{\n private:\n vector<string> commandVec;\n public:\n Command(vector<string>s){\n commandVec = s;\n }\n \n};\n\nint main () {\n \n \/\/take user input\n string initialCommand = \"\";\n while (true) {\n string login = getlogin();\n char hostname[100];\n gethostname(hostname, 100);\n cout << \"[\" << login << \"@\" << hostname << \"] $ \";\n getline(cin, initialCommand);\n trim(initialCommand);\n\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <memory>\n\n#include <cstdlib>\n\n#include \"output.hxx\"\n#include \"threaded-manager.hxx\"\n#include \"tile.hxx\"\n#include \"exceptions.hxx\"\n\nusing namespace game_of_life;\n\nusing std::vector;\nusing std::string;\n\nusing std::domain_error;\n\nusing std::map;\n\nusing std::cin;\nusing std::istringstream;\nusing std::ifstream;\n\nvector<string> split(const string& s)\n{\n vector<string> ret;\n istringstream iss(s);\n string w;\n while (iss >> w)\n if (!w.empty())\n ret.push_back(w);\n return ret;\n}\n\nint toInt(const string &s)\n{\n int ret = 0;\n if (s.size() > 8)\n throw domain_error(string(\"\\\"\") + s + \"\\\" is too long for int\");\n for (size_t i = 0; i < s.size(); ++i)\n {\n char c = s[i];\n if (c >= '0' && c <= '9')\n ret = ret * 10 + c - '0';\n else\n throw domain_error(string(\"\\\"\") + s + \"\\\" is not an integer\");\n }\n return ret;\n}\n\nThreadedManager manager;\nMatrix matrix;\n\ntypedef const vector<string>& Params;\ntypedef void (*CommandHandler)(Params);\n\nvoid checkParamCount(const string& tag, Params p, size_t lo, size_t hi)\n{\n if (p.size() > hi)\n throw IncorrectCommandException(tag + \"too much parameters\");\n if (p.size() < lo)\n throw IncorrectCommandException(tag + \"too few parameters\");\n}\n\nvoid start(Params p)\n{\n static const string TAG(\"START: \");\n\n if (manager.getState() != ThreadedManager::NOT_STARTED)\n throw IncorrectCommandException(TAG + \"already started\");\n checkParamCount(TAG, p, 2, 3);\n\n int concurrency;\n try\n {\n concurrency = toInt(p[0]);\n if (p.size() == 3)\n {\n int h = toInt(p[1]), w = toInt(p[2]);\n matrix = Matrix::random(h, w, 42);\n }\n else\n {\n ifstream csv(p[1]);\n matrix = Matrix::fromCsv(csv);\n }\n }\n catch (domain_error& e)\n {\n throw IncorrectCommandException(TAG + e.what());\n }\n debug(TAG + \"starting the manager\");\n manager.start(matrix, concurrency);\n}\n\nvoid status(Params p)\n{\n static const string TAG(\"STATUS: \");\n checkParamCount(TAG, p, 0, 0);\n\n Manager::State state = manager.getState();\n\n OstreamLocker o(out());\n o << \"System state: \" << manager.stateStr(state) << \"\\n\";\n if (state != Manager::NOT_STARTED && state != Manager::RUNNING)\n matrix.output(o.get());\n}\n\nvoid run(Params p)\n{\n static const string TAG(\"RUN: \");\n checkParamCount(TAG, p, 1, 1);\n\n int runs;\n switch (manager.getState())\n {\n case Manager::NOT_STARTED:\n throw IncorrectCommandException(\n TAG + \"task unknown, use START to initialize.\");\n case Manager::STOPPED:\n runs = toInt(p[0]);\n debug(TAG + \"trying to add \" + p[0] + \" iterations\");\n manager.runForMore(runs);\n break;\n default:\n throw IncorrectCommandException(TAG + \"system is busy\");\n }\n}\n\nvoid stop(Params p)\n{\n static const string TAG(\"STOP: \");\n checkParamCount(TAG, p, 0, 0);\n\n switch (manager.getState())\n {\n case Manager::RUNNING:\n debug(TAG + \"stopping\");\n manager.pauseAll();\n manager.wakeWhenStateIs(Manager::STOPPED);\n debug(TAG + \"awake and stopped\");\n break;\n default:\n throw IncorrectCommandException(TAG + \"not running\");\n }\n}\n\nvoid quit(Params p)\n{\n static const string TAG(\"QUIT: \");\n checkParamCount(TAG, p, 0, 0);\n\n debug(TAG);\n if (manager.getState() != Manager::NOT_STARTED)\n {\n debug(TAG + \"manager has started, trying to shut him\");\n manager.shutdown();\n manager.join();\n debug(TAG + \"joined the manager\");\n }\n debug(TAG + \"exiting the program gracefully ----------\");\n exit(0);\n}\n\nvoid unknownCommand(const string& s)\n{\n throw IncorrectCommandException(string(\"\\\"\") + s + \"\\\" is not supported ._.\");\n}\n\nint main()\n{\n map<string, CommandHandler> cmdMap;\n cmdMap[\"START\"] = start;\n cmdMap[\"STATUS\"] = status;\n cmdMap[\"RUN\"] = run;\n cmdMap[\"STOP\"] = stop;\n cmdMap[\"QUIT\"] = quit;\n\n string line;\n debug(\"---------------- RESTART ----------------------\");\n while (out(\"game-of-life: \"), getline(cin, line))\n {\n vector<string> words = split(line);\n\n if (words.empty())\n continue;\n\n string cmd = words[0];\n for (size_t i = 0; i < cmd.size(); ++i)\n cmd[i] = toupper(cmd[i]);\n\n words.erase(words.begin());\n\n map<string, CommandHandler>::iterator it = cmdMap.find(cmd);\n try\n {\n if (it != cmdMap.end())\n it->second(words);\n else\n unknownCommand(cmd);\n }\n catch (IncorrectCommandException& e)\n {\n err() << e.what() << \"\\n\";\n }\n }\n out(\"quit\\n\");\n quit(vector<string>());\n}\n\n<commit_msg>Handle some incorrect input<commit_after>#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <map>\n#include <memory>\n\n#include <cstdlib>\n\n#include \"output.hxx\"\n#include \"threaded-manager.hxx\"\n#include \"tile.hxx\"\n#include \"exceptions.hxx\"\n\nusing namespace game_of_life;\n\nusing std::vector;\nusing std::string;\n\nusing std::exception;\nusing std::domain_error;\n\nusing std::map;\n\nusing std::cin;\nusing std::istringstream;\nusing std::ifstream;\n\nvector<string> split(const string& s)\n{\n vector<string> ret;\n istringstream iss(s);\n string w;\n while (iss >> w)\n if (!w.empty())\n ret.push_back(w);\n return ret;\n}\n\nint toInt(const string &s)\n{\n int ret = 0;\n if (s.size() > 8)\n throw domain_error(string(\"\\\"\") + s + \"\\\" is too long for int\");\n for (size_t i = 0; i < s.size(); ++i)\n {\n char c = s[i];\n if (c >= '0' && c <= '9')\n ret = ret * 10 + c - '0';\n else\n throw domain_error(string(\"\\\"\") + s + \"\\\" is not an integer\");\n }\n return ret;\n}\n\nThreadedManager manager;\nMatrix matrix;\n\ntypedef const vector<string>& Params;\ntypedef void (*CommandHandler)(Params);\n\nvoid checkParamCount(const string& tag, Params p, size_t lo, size_t hi)\n{\n if (p.size() > hi)\n throw IncorrectCommandException(tag + \"too much parameters\");\n if (p.size() < lo)\n throw IncorrectCommandException(tag + \"too few parameters\");\n}\n\nvoid start(Params p)\n{\n static const string TAG(\"START: \");\n\n if (manager.getState() != ThreadedManager::NOT_STARTED)\n throw IncorrectCommandException(TAG + \"already started\");\n checkParamCount(TAG, p, 2, 3);\n\n int concurrency;\n try\n {\n concurrency = toInt(p[0]);\n if (concurrency <= 0)\n throw IncorrectCommandException(TAG + \"incorrect concurrency\");\n if (p.size() == 3)\n {\n int h = toInt(p[1]), w = toInt(p[2]);\n if (h <= 0 || w <= 0)\n throw IncorrectCommandException(TAG + \"incorrect matrix size\");\n matrix = Matrix::random(h, w, 42);\n }\n else\n {\n try\n {\n ifstream csv(p[1].data());\n matrix = Matrix::fromCsv(csv);\n }\n catch (exception& e)\n {\n throw IncorrectCommandException(TAG + e.what());\n }\n }\n }\n catch (domain_error& e)\n {\n throw IncorrectCommandException(TAG + e.what());\n }\n debug(TAG + \"starting the manager\");\n manager.start(matrix, concurrency);\n}\n\nvoid status(Params p)\n{\n static const string TAG(\"STATUS: \");\n checkParamCount(TAG, p, 0, 0);\n\n Manager::State state = manager.getState();\n\n OstreamLocker o(out());\n o << \"System state: \" << manager.stateStr(state) << \"\\n\";\n if (state != Manager::NOT_STARTED && state != Manager::RUNNING)\n {\n o << \"After iteration \" << manager.getShared().getStop() << \":\\n\";\n matrix.output(o.get());\n }\n}\n\nvoid run(Params p)\n{\n static const string TAG(\"RUN: \");\n checkParamCount(TAG, p, 1, 1);\n\n int runs;\n switch (manager.getState())\n {\n case Manager::NOT_STARTED:\n throw IncorrectCommandException(\n TAG + \"task unknown, use START to initialize.\");\n case Manager::STOPPED:\n runs = toInt(p[0]);\n debug(TAG + \"trying to add \" + p[0] + \" iterations\");\n manager.runForMore(runs);\n break;\n default:\n throw IncorrectCommandException(TAG + \"system is busy\");\n }\n}\n\nvoid stop(Params p)\n{\n static const string TAG(\"STOP: \");\n checkParamCount(TAG, p, 0, 0);\n\n switch (manager.getState())\n {\n case Manager::RUNNING:\n debug(TAG + \"stopping\");\n manager.pauseAll();\n manager.wakeWhenStateIs(Manager::STOPPED);\n debug(TAG + \"awake and stopped\");\n out() << \"Stopped at \" << manager.getShared().getStop() << \"\\n\";\n break;\n default:\n throw IncorrectCommandException(TAG + \"not running\");\n }\n}\n\nvoid quit(Params p)\n{\n static const string TAG(\"QUIT: \");\n checkParamCount(TAG, p, 0, 0);\n\n debug(TAG);\n if (manager.getState() != Manager::NOT_STARTED)\n {\n debug(TAG + \"manager has started, trying to shut him\");\n manager.shutdown();\n manager.join();\n debug(TAG + \"joined the manager\");\n }\n debug(TAG + \"exiting the program gracefully ----------\");\n exit(0);\n}\n\nvoid unknownCommand(const string& s)\n{\n throw IncorrectCommandException(string(\"\\\"\") + s + \"\\\" is not supported ._.\");\n}\n\nint main()\n{\n map<string, CommandHandler> cmdMap;\n cmdMap[\"START\"] = start;\n cmdMap[\"STATUS\"] = status;\n cmdMap[\"RUN\"] = run;\n cmdMap[\"STOP\"] = stop;\n cmdMap[\"QUIT\"] = quit;\n\n string line;\n debug(\"---------------- RESTART ----------------------\");\n while (out(\"game-of-life: \"), getline(cin, line))\n {\n vector<string> words = split(line);\n\n if (words.empty())\n continue;\n\n string cmd = words[0];\n for (size_t i = 0; i < cmd.size(); ++i)\n cmd[i] = toupper(cmd[i]);\n\n words.erase(words.begin());\n\n map<string, CommandHandler>::iterator it = cmdMap.find(cmd);\n try\n {\n if (it != cmdMap.end())\n it->second(words);\n else\n unknownCommand(cmd);\n }\n catch (IncorrectCommandException& e)\n {\n err() << e.what() << \"\\n\";\n }\n }\n out(\"quit\\n\");\n quit(vector<string>());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ systypes.cpp -- Emit System Types (excluding structures)\n\/\/ Date: Tue Dec 3 19:15:39 2013\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n#include <assert.h>\n\n#include <iostream>\n#include <sstream>\n\n#include \"glue.hpp\"\n#include \"comp.hpp\"\n#include \"config.hpp\"\n\nvoid\nemit_sys_types() {\n\tchar sgenset[32];\n\tstd::fstream ads, adb;\n\n\tsprintf(sgenset,\"%04d\",config.sys_types.genset);\n\n\tstd::cout << \"Genset \" << sgenset << \" emit sys types\\n\";\n\t\n\tif ( !gcc_open(ads,config.sys_types.genset,\".ads\") )\n\t\texit(3);\n\n\tads << \"\\n\";\n\n\tfor ( auto it=config.sys_types.info.begin(); it != config.sys_types.info.end(); ++it ) {\n\t\tconst std::string& name = it->first;\n\t\ts_config::s_sys_types::s_sys_type& node = it->second;\n\n\t\tif ( node.is_unsigned ) {\n\t\t\tads \t<< \" type \"\n\t\t\t\t<< name << \" is mod 2**\" << node.size*8 << \";\\n\";\n\t\t} else\t{\n\t\t\tads \t<< \" type \"\n\t\t\t\t<< name << \" is range -2**\" << (node.size*8-1) << \" .. \"\n\t\t\t\t<< \"2**\" << (node.size*8-1) << \"-1;\\n\";\n\t\t}\n\t}\n}\n\n\/\/ End systypes.cpp\n<commit_msg>Added for type'Size clause generation<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ systypes.cpp -- Emit System Types (excluding structures)\n\/\/ Date: Tue Dec 3 19:15:39 2013\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n#include <assert.h>\n\n#include <iostream>\n#include <sstream>\n\n#include \"glue.hpp\"\n#include \"comp.hpp\"\n#include \"config.hpp\"\n\nvoid\nemit_sys_types() {\n\tchar sgenset[32];\n\tstd::fstream ads, adb;\n\n\tsprintf(sgenset,\"%04d\",config.sys_types.genset);\n\n\tstd::cout << \"Genset \" << sgenset << \" emit sys types\\n\";\n\t\n\tif ( !gcc_open(ads,config.sys_types.genset,\".ads\") )\n\t\texit(3);\n\n\tads << \"\\n\";\n\n\tfor ( auto it=config.sys_types.info.begin(); it != config.sys_types.info.end(); ++it ) {\n\t\tconst std::string& name = it->first;\n\t\ts_config::s_sys_types::s_sys_type& node = it->second;\n\n\t\tif ( node.is_unsigned ) {\n\t\t\tads \t<< \" type \"\n\t\t\t\t<< name << \" is mod 2**\" << node.size*8 << \";\\n\";\n\t\t} else\t{\n\t\t\tads \t<< \" type \"\n\t\t\t\t<< name << \" is range -2**\" << (node.size*8-1) << \" .. \"\n\t\t\t\t<< \"2**\" << (node.size*8-1) << \"-1;\\n\";\n\t\t}\n\t}\n\n\tads << \"\\n\";\n\n\tfor ( auto it=config.sys_types.info.begin(); it != config.sys_types.info.end(); ++it ) {\n\t\tconst std::string& name = it->first;\n\t\ts_config::s_sys_types::s_sys_type& node = it->second;\n\n\t\tads << \" for \" << name << \"'Size use \" << node.size*8 << \";\\n\";\n\t}\n}\n\n\/\/ End systypes.cpp\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <GL\/glut.h>\n#include <assert.h>\n#include <cstdlib>\n\n#include \"main.hpp\"\n#include \"Scene.hpp\"\n\n\/\/ don't define anything in headers! only declare it!!!1!one!\nVec3Df MyCameraPosition;\n\nstd::vector<Vec3Df> MyLightPositions;\n\n\/\/ double buffered\nunsigned int textures[2];\nunsigned int activeTexIndex = 0;\nunsigned int isDrawingTexture = 0;\nunsigned int isRealtimeRaytracing = 0;\nTree MyTree;\nScene MyScene;\n\n\/\/ options\nextern bool g_phong;\nextern bool g_checkerboard;\nextern bool g_debug;\n\nextern bool g_ambient;\nextern bool g_diffuse;\nextern bool g_specular;\nextern bool g_reflect;\nextern bool g_refract;\nextern bool g_occlusion;\n\nbool needRebuild = false; \/\/ if the raytrace needs to be built\n\n\/**\n * draw a full-screen texture\n *\/\nvoid drawTexture(int texIndex){\n glEnable(GL_TEXTURE_2D);\n glBindTexture(GL_TEXTURE_2D, textures[texIndex]);\n glBegin(GL_QUADS);\n glTexCoord2f(0, 0);\n glVertex3f(0, 0, 0);\n glTexCoord2f(1, 0);\n glVertex3f(4, 0, 0);\n glTexCoord2f(1, 1);\n glVertex3f(4, 4, 0);\n glTexCoord2f(0, 1);\n glVertex3f(0, 4, 0);\n glEnd();\n}\n\nvoid animate() {\n MyCameraPosition = getCameraPosition();\n glutPostRedisplay();\n}\n\nvoid display(void);\nvoid reshape(int w, int h);\nvoid keyboard(unsigned char key, int x, int y);\n\n\/\/ entry point\nint main(int argc, char** argv){\n glutInit(&argc, argv);\n\n \/\/ couches du framebuffer utilisees par l'application\n glutInitDisplayMode( GLUT_DOUBLE | GLUT_RGBA | GLUT_DEPTH);\n\n \/\/ position et taille de la fenetre\n glutInitWindowPosition(200, 100);\n glutInitWindowSize(WINDOW_RES_X, WINDOW_RES_Y);\n glutCreateWindow(argv[0]);\n\n \/\/ Initialisation du point de vue\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glTranslatef(0, 0, -8);\n glRotatef(-45, -1, 0, 0);\n tbInitTransform(); \/\/ initialisation du point de vue\n tbHelp(); \/\/ affiche l'aide sur la traqueboule\n MyCameraPosition = getCameraPosition();\n \/\/\n \/\/ Active la lumière\n \/\/ Pour la partie\n \/\/ ECLAIRAGE\n\n glEnable( GL_LIGHTING);\n glEnable( GL_LIGHT0);\n glEnable(GL_COLOR_MATERIAL);\n int LightPos[4] = {0, 0, 3, 1};\n glLightiv(GL_LIGHT0, GL_POSITION, LightPos);\n \/\/glMaterialiv(GL_FRONT_AND_BACK,GL_SPECULAR,MatSpec);\n \/\/glMateriali(GL_FRONT_AND_BACK,GL_SHININESS,10);\n\n glEnable(GL_NORMALIZE);\n glClearColor(0.0, 0.0, 0.0, 0.0);\n\n \/\/ Details sur le mode de tracé\n glEnable( GL_DEPTH_TEST); \/\/ effectuer le test de profondeur\n \/\/glEnable(GL_CULL_FACE);\n \/\/glCullFace(GL_BACK);\n glPolygonMode(GL_FRONT, GL_FILL);\n glPolygonMode(GL_BACK, GL_LINE);\n glShadeModel(GL_SMOOTH);\n\n \/\/ init textures\n char* buf = new char[1024 * 1024 * 3];\n glGenTextures(2, textures);\n\n \/\/ texture 1\n glBindTexture(GL_TEXTURE_2D, textures[0]);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 1024, 1024, 0, GL_RGB,\n GL_UNSIGNED_BYTE, buf);\n\n \/\/ texture 2\n glBindTexture(GL_TEXTURE_2D, textures[1]);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 1024, 1024, 0, GL_RGB,\n GL_UNSIGNED_BYTE, buf);\n\n delete[] buf;\n\n \/\/ cablage des callback\n glutReshapeFunc(reshape);\n \/\/ glutSetKeyRepeat(true);\n glutKeyboardFunc(keyboard);\n \/\/ glutKeyboardUpFunc(keyup);\n glutDisplayFunc(display);\n glutMouseFunc(tbMouseFunc); \/\/ traqueboule utilise la souris\n glutMotionFunc(tbMotionFunc); \/\/ traqueboule utilise la souris\n glutIdleFunc(animate);\n\n int ret = init(argc, argv);\n if(ret == 255)\n return 0;\n if(ret > 0)\n return ret;\n\n \/\/ lancement de la boucle principale\n glutMainLoop();\n\n return 0; \/\/ instruction jamais exécutée\n}\n\n\/\/ draw fps\nvoid drawFPS(){\n clock_t diff = clock() - lastFrameTime;\n lastFrameTime = clock();\n\n const int clock = CLOCKS_PER_SEC * (isRealtimeRaytracing ? THREADS : 1);\n\n if((0. + lastFrameTime - lastFPSRenderTime) \/ clock > .1){\n lastFPSRenderTime = lastFrameTime;\n float fps = (1. \/ diff) * clock;\n sprintf(screenFPS, \"%.1f fps\", fps);\n }\n\n int i = 0;\n while(screenFPS[i] != '\\0'){\n glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, screenFPS[i++]);\n }\n}\n\n\/\/ display\nclock_t ticks;\nvoid display(void) {\n\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n \/\/ Effacer tout\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT); \/\/ la couleur et le z\n drawFPS();\n\n glLoadIdentity(); \/\/ repere camera\n\n if(isDrawingTexture || isRealtimeRaytracing){\n const static GLdouble viewport[] = {\n 1, 0, 0, 0,\n 0, 1, 0, 0,\n 0, 0, 1, 0,\n -2,-2,-4, 1\n };\n\n glMultMatrixd(viewport);\n drawTexture(activeTexIndex);\n\n \/\/ reset view\n glLoadIdentity();\n tbVisuTransform();\n\n \/\/ swap buffers; draw on back buffer\n if (isRealtimeRaytracing){\n clock_t start = clock();\n startRayTracing(!activeTexIndex, false);\n ticks = clock() - start;\n activeTexIndex = !activeTexIndex;\n } else {\n if (needRebuild == true){\n int millis = (int)(ticks * 1000. \/ CLOCKS_PER_SEC);\n long long expected = millis;\n expected *= RAYTRACE_RES_X \/ PREVIEW_RES_X;\n expected *= RAYTRACE_RES_Y \/ PREVIEW_RES_Y;\n expected *= MSAA \/ PREVIEW_MSAA;\n expected *= MSAA \/ PREVIEW_MSAA;\n expected \/= THREADS;\n if (expected < 1000)\n printf(\"will take %d milliseconds\\n\", (int)expected);\n else if (expected < 1000 * 60)\n printf(\"will take %d seconds\\n\", (int)(expected \/ 1000));\n else if (expected < 1000 * 60 * 60)\n printf(\"will take %d minutes\\n\", (int)(expected \/ 1000 \/ 60));\n else if (expected < 1000 * 60 * 60 * 24) {\n printf(\"RENDERING WILL TAKE LONG!\\n\");\n printf(\"will take %d hour\\n\", (int)(expected \/ 1000 \/ 60 \/ 60));\n } else if (expected < (long long)1000 * 60 * 60 * 24 * 365) {\n printf(\"RENDERING WILL TAKE VERY LONG!\\n\");\n printf(\"will take %d days\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000) {\n printf(\"RENDERING will take years!\\n\");\n printf(\"will take %d year\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000 * 1000) {\n printf(\"RENDERING will take thousands of years!\\n\");\n printf(\"will take %d millenia\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 1000));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000 * 1000) {\n printf(\"RENDERING will take millions of years!\\n\");\n printf(\"will take %d million years\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 1000));\n }\n else if (expected < (float)1000 * 60 * 60 * 24 * 365 * 1000 * 1000 * 1000) {\n printf(\"If the dinosaurs were alive when you started rendering, it would be ready now.\\n\");\n printf(\"will take %d billion years\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 100));\n }\n else {\n printf(\"THIS IS MADNESS!\\n\");\n printf(\"will take %s seconds\\n\", \"<overflow error>\");\n }\n startRayTracing(activeTexIndex, true);\n needRebuild = false;\n }\n }\n } else {\n tbVisuTransform(); \/\/ origine et orientation de la scene\n MyScene.draw();\n\t\tif (g_debug)\n\t\t\tMyScene.debugDraw();\n }\n\n glutSwapBuffers();\n glPopAttrib();\n}\n\/\/ pour changement de taille ou desiconification\nvoid reshape(int w, int h){\n glViewport(0, 0, (GLsizei)w, (GLsizei)h);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n \/\/glOrtho (-1.1, 1.1, -1.1,1.1, -1000.0, 1000.0);\n gluPerspective(50, (float)w \/ h, 1, 10);\n glMatrixMode(GL_MODELVIEW);\n}\n\n\/\/ prise en compte du clavier\nvoid keyboard(unsigned char key, int x, int y){\n switch(key){\n case '1':\n g_phong = !g_phong;\n break;\n case '2':\n g_checkerboard = !g_checkerboard;\n break;\n\t\tcase '3':\n\t\t\tg_debug = !g_debug;\n\t\t\tbreak;\n\t\tcase '4': g_ambient = !g_ambient; break;\n\t\tcase '5': g_diffuse = !g_diffuse; break;\n\t\tcase '6': g_specular = !g_specular; break;\n\t\tcase '7': g_reflect = !g_reflect; break;\n\t\tcase '8': g_refract = !g_refract; break;\n\t\tcase '9': g_occlusion = !g_occlusion; break;\n case 't':\n isDrawingTexture = 0;\n isRealtimeRaytracing = 0;\n break;\n case 'L':\n MyScene.addLightPoint(getCameraPosition());\n break;\n case 'l':\n\t\t\tMyScene.lights[0] = getCameraPosition();\n break;\n case 'r':\n needRebuild = true;\n isDrawingTexture = 1;\n isRealtimeRaytracing = 0;\n break;\n case 'b':\n cout << \"Using \" << THREADS << \" threads and resolution of \"\n << PREVIEW_RES_X << \"x\" << PREVIEW_RES_Y << endl;\n isRealtimeRaytracing = 1;\n isDrawingTexture = 0;\n break;\n case 27: \/\/ touche ESC\n exit(0);\n }\n\n yourKeyboardPress(key, x, y);\n}\n\nvoid keyup(unsigned char key, int x, int y) {\n yourKeyboardRelease(key, x, y);\n}\n\n<commit_msg>incorrect merge I assume?<commit_after>#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <GL\/glut.h>\n#include <assert.h>\n#include <cstdlib>\n\n#include \"main.hpp\"\n#include \"Scene.hpp\"\n\n\/\/ don't define anything in headers! only declare it!!!1!one!\nVec3Df MyCameraPosition;\n\nstd::vector<Vec3Df> MyLightPositions;\n\n\/\/ double buffered\nunsigned int textures[2];\nunsigned int activeTexIndex = 0;\nunsigned int isDrawingTexture = 0;\nunsigned int isRealtimeRaytracing = 0;\nTree MyTree;\nScene MyScene;\n\n\/\/ options\nextern bool g_phong;\nextern bool g_checkerboard;\nextern bool g_debug;\n\nextern bool g_ambient;\nextern bool g_diffuse;\nextern bool g_specular;\nextern bool g_reflect;\nextern bool g_refract;\nextern bool g_occlusion;\n\nbool needRebuild = false; \/\/ if the raytrace needs to be built\n\n\/**\n * draw a full-screen texture\n *\/\nvoid drawTexture(int texIndex){\n glEnable(GL_TEXTURE_2D);\n glBindTexture(GL_TEXTURE_2D, textures[texIndex]);\n glBegin(GL_QUADS);\n glTexCoord2f(0, 0);\n glVertex3f(0, 0, 0);\n glTexCoord2f(1, 0);\n glVertex3f(4, 0, 0);\n glTexCoord2f(1, 1);\n glVertex3f(4, 4, 0);\n glTexCoord2f(0, 1);\n glVertex3f(0, 4, 0);\n glEnd();\n}\n\nvoid animate() {\n MyCameraPosition = getCameraPosition();\n glutPostRedisplay();\n}\n\nvoid display(void);\nvoid reshape(int w, int h);\nvoid keyboard(unsigned char key, int x, int y);\n\n\/\/ entry point\nint main(int argc, char** argv){\n glutInit(&argc, argv);\n\n \/\/ couches du framebuffer utilisees par l'application\n glutInitDisplayMode( GLUT_DOUBLE | GLUT_RGBA | GLUT_DEPTH);\n\n \/\/ position et taille de la fenetre\n glutInitWindowPosition(200, 100);\n glutInitWindowSize(WINDOW_RES_X, WINDOW_RES_Y);\n glutCreateWindow(argv[0]);\n\n \/\/ Initialisation du point de vue\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n glTranslatef(0, 0, -8);\n glRotatef(-45, -1, 0, 0);\n tbInitTransform(); \/\/ initialisation du point de vue\n tbHelp(); \/\/ affiche l'aide sur la traqueboule\n MyCameraPosition = getCameraPosition();\n \/\/\n \/\/ Active la lumière\n \/\/ Pour la partie\n \/\/ ECLAIRAGE\n\n glEnable( GL_LIGHTING);\n glEnable( GL_LIGHT0);\n glEnable(GL_COLOR_MATERIAL);\n int LightPos[4] = {0, 0, 3, 1};\n glLightiv(GL_LIGHT0, GL_POSITION, LightPos);\n \/\/glMaterialiv(GL_FRONT_AND_BACK,GL_SPECULAR,MatSpec);\n \/\/glMateriali(GL_FRONT_AND_BACK,GL_SHININESS,10);\n\n glEnable(GL_NORMALIZE);\n glClearColor(0.0, 0.0, 0.0, 0.0);\n\n \/\/ Details sur le mode de tracé\n glEnable( GL_DEPTH_TEST); \/\/ effectuer le test de profondeur\n \/\/glEnable(GL_CULL_FACE);\n \/\/glCullFace(GL_BACK);\n glPolygonMode(GL_FRONT, GL_FILL);\n glPolygonMode(GL_BACK, GL_LINE);\n glShadeModel(GL_SMOOTH);\n\n \/\/ init textures\n char* buf = new char[1024 * 1024 * 3];\n glGenTextures(2, textures);\n\n \/\/ texture 1\n glBindTexture(GL_TEXTURE_2D, textures[0]);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 1024, 1024, 0, GL_RGB,\n GL_UNSIGNED_BYTE, buf);\n\n \/\/ texture 2\n glBindTexture(GL_TEXTURE_2D, textures[1]);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 1024, 1024, 0, GL_RGB,\n GL_UNSIGNED_BYTE, buf);\n\n delete[] buf;\n\n \/\/ cablage des callback\n glutReshapeFunc(reshape);\n \/\/ glutSetKeyRepeat(true);\n glutKeyboardFunc(keyboard);\n \/\/ glutKeyboardUpFunc(keyup);\n glutDisplayFunc(display);\n glutMouseFunc(tbMouseFunc); \/\/ traqueboule utilise la souris\n glutMotionFunc(tbMotionFunc); \/\/ traqueboule utilise la souris\n glutIdleFunc(animate);\n\n int ret = init(argc, argv);\n if(ret == 255)\n return 0;\n if(ret > 0)\n return ret;\n\n \/\/ lancement de la boucle principale\n glutMainLoop();\n\n return 0; \/\/ instruction jamais exécutée\n}\n\n\/\/ draw fps\nvoid drawFPS(){\n clock_t diff = clock() - lastFrameTime;\n lastFrameTime = clock();\n\n const int clock = CLOCKS_PER_SEC * (isRealtimeRaytracing ? THREADS : 1);\n\n if((0. + lastFrameTime - lastFPSRenderTime) \/ clock > .1){\n lastFPSRenderTime = lastFrameTime;\n float fps = (1. \/ diff) * clock;\n sprintf(screenFPS, \"%.1f fps\", fps);\n }\n\n int i = 0;\n while(screenFPS[i] != '\\0'){\n glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, screenFPS[i++]);\n }\n}\n\n\/\/ display\nclock_t ticks;\nvoid display(void) {\n\n glPushAttrib(GL_ALL_ATTRIB_BITS);\n \/\/ Effacer tout\n glClear( GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT); \/\/ la couleur et le z\n drawFPS();\n\n glLoadIdentity(); \/\/ repere camera\n\n if(isDrawingTexture || isRealtimeRaytracing){\n const static GLdouble viewport[] = {\n 1, 0, 0, 0,\n 0, 1, 0, 0,\n 0, 0, 1, 0,\n -2,-2,-4, 1\n };\n\n glMultMatrixd(viewport);\n drawTexture(activeTexIndex);\n\n \/\/ reset view\n glLoadIdentity();\n tbVisuTransform();\n\n \/\/ swap buffers; draw on back buffer\n if (isRealtimeRaytracing){\n clock_t start = clock();\n startRayTracing(!activeTexIndex, false);\n ticks = clock() - start;\n activeTexIndex = !activeTexIndex;\n } else {\n if (needRebuild == true){\n int millis = (int)(ticks * 1000. \/ CLOCKS_PER_SEC);\n long long expected = millis;\n expected *= RAYTRACE_RES_X \/ PREVIEW_RES_X;\n expected *= RAYTRACE_RES_Y \/ PREVIEW_RES_Y;\n expected *= MSAA \/ PREVIEW_MSAA;\n expected *= MSAA \/ PREVIEW_MSAA;\n expected \/= THREADS;\n if (expected < 1000)\n printf(\"will take %d milliseconds\\n\", (int)expected);\n else if (expected < 1000 * 60)\n printf(\"will take %d seconds\\n\", (int)(expected \/ 1000));\n else if (expected < 1000 * 60 * 60)\n printf(\"will take %d minutes\\n\", (int)(expected \/ 1000 \/ 60));\n else if (expected < 1000 * 60 * 60 * 24) {\n printf(\"RENDERING WILL TAKE LONG!\\n\");\n printf(\"will take %d hour\\n\", (int)(expected \/ 1000 \/ 60 \/ 60));\n } else if (expected < (long long)1000 * 60 * 60 * 24 * 365) {\n printf(\"RENDERING WILL TAKE VERY LONG!\\n\");\n printf(\"will take %d days\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000) {\n printf(\"RENDERING will take years!\\n\");\n printf(\"will take %d year\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000 * 1000) {\n printf(\"RENDERING will take thousands of years!\\n\");\n printf(\"will take %d millenia\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 1000));\n }\n else if (expected < (long long)1000 * 60 * 60 * 24 * 365 * 1000 * 1000) {\n printf(\"RENDERING will take millions of years!\\n\");\n printf(\"will take %d million years\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 1000));\n }\n else if (expected < (float)1000 * 60 * 60 * 24 * 365 * 1000 * 1000 * 1000) {\n printf(\"If the dinosaurs were alive when you started rendering, it would be ready now.\\n\");\n printf(\"will take %d billion years\\n\", (int)(expected \/ 1000 \/ 60 \/ 60 \/ 24 \/ 365 \/ 1000 \/ 100));\n }\n else {\n printf(\"THIS IS MADNESS!\\n\");\n printf(\"will take %s seconds\\n\", \"<overflow error>\");\n }\n startRayTracing(activeTexIndex, true);\n needRebuild = false;\n }\n }\n } else {\n tbVisuTransform(); \/\/ origine et orientation de la scene\n MyScene.draw();\n\t\tif (g_debug)\n\t\t\tMyScene.debugDraw();\n }\n\n glutSwapBuffers();\n glPopAttrib();\n}\n\/\/ pour changement de taille ou desiconification\nvoid reshape(int w, int h){\n glViewport(0, 0, (GLsizei)w, (GLsizei)h);\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n \/\/glOrtho (-1.1, 1.1, -1.1,1.1, -1000.0, 1000.0);\n gluPerspective(50, (float)w \/ h, 1, 10);\n glMatrixMode(GL_MODELVIEW);\n}\n\n\/\/ prise en compte du clavier\nvoid keyboard(unsigned char key, int x, int y){\n switch(key){\n case '1':\n g_phong = !g_phong;\n break;\n case '2':\n g_checkerboard = !g_checkerboard;\n break;\n\t\tcase '3':\n\t\t\tg_debug = !g_debug;\n\t\t\tbreak;\n\t\tcase '4': g_ambient = !g_ambient; break;\n\t\tcase '5': g_diffuse = !g_diffuse; break;\n\t\tcase '6': g_specular = !g_specular; break;\n\t\tcase '7': g_reflect = !g_reflect; break;\n\t\tcase '8': g_refract = !g_refract; break;\n\t\tcase '9': g_occlusion = !g_occlusion; break;\n case 't':\n isDrawingTexture = 0;\n isRealtimeRaytracing = 0;\n break;\n case 'L':\n MyCameraPosition = getCameraPosition();\n MyScene.addLightPoint(MyCameraPosition);\n break;\n case 'l':\n\t\t\tMyScene.lights[0] = getCameraPosition();\n break;\n case 'r':\n needRebuild = true;\n isDrawingTexture = 1;\n isRealtimeRaytracing = 0;\n break;\n case 'b':\n cout << \"Using \" << THREADS << \" threads and resolution of \"\n << PREVIEW_RES_X << \"x\" << PREVIEW_RES_Y << endl;\n isRealtimeRaytracing = 1;\n isDrawingTexture = 0;\n break;\n case 27: \/\/ touche ESC\n exit(0);\n }\n\n yourKeyboardPress(key, x, y);\n}\n\nvoid keyup(unsigned char key, int x, int y) {\n yourKeyboardRelease(key, x, y);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/node.cpp\r\n#include <random>\r\n#include <cstdlib>\r\n#include <iostream>\r\n#include \"node.hpp\"\r\n\r\n\r\nusing namespace utils;\r\n\r\n\r\n \/\/--------------------CONSTRUTOR E DESTRUTOR--------------------------\/\/\r\n\r\nNode::Node(bool grow, int maxDepth, int numberOfXs){\r\n\r\n \/\/construtor, que recebe se deve construir a árvore no modo growStyle\r\n \/\/(caso falso, constrói no modo fullStyle). maxDepth determina a pro-\r\n \/\/fundidade máxima que a subárvore pode assumir. numberOfXs é nece-\r\n \/\/sário para que o construtor saiba quantas variáveis existem e possa\r\n \/\/criar este mesmo número de diferentes variáveis nas folhas.\r\n \/\/por padrão, grow = false, maxDepth = 0, numberOfXs = 1.\r\n\r\n this->numberOfXs = numberOfXs;\r\n this->maxDepth = maxDepth;\r\n\r\n if (grow) growStyle();\r\n else fullStyle();\r\n}\r\n\r\nNode::~Node(){\r\n \r\n \/\/destrutor, que recursivamente deleta o nó e todos os seus filhos.\r\n\r\n if (left) delete left;\r\n if (right) delete right;\r\n}\r\n\r\n\r\n \/\/------------ESTILOS DE CRIAÇÃO DE ÁRVORES DE EXPRESSÕES-------------\/\/\r\n\r\nvoid Node::growStyle(){\r\n\r\n \/\/estilo de crescimento aleatório, que funciona da seguinte forma:\r\n \/\/enquanto ainda há profundidade para as subárvores, não restringe\r\n \/\/o tipo que o nó pode ser. Quando chega na profundidade máxima,\r\n \/\/só cria folhas.\r\n\r\n if (maxDepth>1){\r\n tipo = random()%SIZETYPE;\r\n \r\n if (tipo==CTE) makeThisCte();\r\n else if (tipo==VAR) makeThisVar();\r\n else if (tipo==FUN1) makeThisFunc1(true);\r\n else makeThisFunc2(true); \/\/tipo==FUN2\r\n }\r\n else {\r\n tipo = random()%2;\r\n\r\n if (tipo==CTE) makeThisCte();\r\n else makeThisVar(); \/\/tipo==VAR\r\n }\r\n}\r\n\r\nvoid Node::fullStyle(){\r\n\r\n \/\/estilo de crescimento que gera sempre uma árvore binária completa\r\n \/\/(salvo casos onde são sorteadas funções de 1 parâmetro, tendo\r\n \/\/apenas um filho, e não dois).\r\n\r\n if (maxDepth>1){\r\n tipo = random()%2 + 2;\r\n\r\n if (tipo==FUN1) makeThisFunc1(false);\r\n else makeThisFunc2(false); \/\/tipo==FUN2 \r\n }\r\n else {\r\n tipo = random()%2;\r\n\r\n if (tipo==CTE) makeThisCte();\r\n else makeThisVar(); \/\/tipo==VAR\r\n }\r\n}\r\n\r\n\r\n \/\/----------FUNÇÕES AJUSTADORAS DE VALORES DA ÁRVORE------------------\/\/\r\n\r\nvoid Node::makeThisVar(){\r\n\r\n \/\/função que ajusta valores do nó para ser uma variável. Sorteia um\r\n \/\/índice de x para os n numberOfXs, deleta e \"nulla\" os ponteiros.\r\n\r\n C.idX = random()%numberOfXs;\r\n\r\n left = NULL;\r\n right = NULL;\r\n}\r\n\r\nvoid Node::makeThisCte(){\r\n\r\n \/\/ajusta os valores do nó para ser uma constante. Atribui um valor de\r\n \/\/ 0 a 9 para o nó, deleta e \"nulla\" os ponteiros.\r\n\r\n C.value = random()%10;\r\n\r\n left = NULL;\r\n right = NULL;\r\n}\r\n\r\nvoid Node::makeThisFunc1(bool grow){\r\n\r\n \/\/ajusta os valores do nó para ser uma função de 1 parâmetro. A fun-\r\n \/\/ção é sorteada dentro do utils, e por padrão o filho criado será na \r\n \/\/direita (isso não faria diferença aqui se fosse na esquerda), mas\r\n \/\/as funções do programa estão preparadas para lidar com casos onde\r\n \/\/a subárvore foi criada no lado esquerdo. chama recursivamente\r\n \/\/o construtor para que a árvore não fique incompleta.\r\n\r\n C.function = random() % SIZEFUNC1;\r\n\r\n right = new Node(grow, maxDepth-1, numberOfXs);\r\n left = NULL;\r\n}\r\n\r\nvoid Node::makeThisFunc2(bool grow){\r\n\r\n \/\/ajusta os valores do nó para ser uma função de 2 parâmetros. A\r\n \/\/função é sorteada dentro do utils. Chama recursivamente o cons-\r\n \/\/trutor dos dois filhos para que a árvore não fique incompleta.\r\n\r\n C.function = random() % SIZEFUNC2;\r\n\r\n right = new Node(grow, maxDepth-1, numberOfXs);\r\n left = new Node(grow, maxDepth-1, numberOfXs);\r\n}\r\n\r\n\r\n\r\n \/\/----------------FUNÇÕES DE UTILIDADE GERAL--------------------------\/\/\r\n\r\ndouble Node::eval(DataPoint p) {\r\n \r\n \/\/calcula o valor que a expressão retorna quando tem como valores\r\n \/\/para suas n variáveis os valores do DataPoint.x (vector<double>).\r\n\r\n if (this->tipo==VAR){\r\n return p.x[C.idX];\r\n } else if(this->tipo==CTE) {\r\n return C.value;\r\n } else if (this->tipo==FUN1){\r\n if (left)\r\n return func1_solver(C.function, left->eval(p));\r\n else\r\n return func1_solver(C.function, right->eval(p));\r\n } else \/\/this->tipo==FUN2\r\n return func2_solver(C.function, left->eval(p), right->eval(p));\r\n}\r\n\r\nvoid Node::print_node_d(){\r\n \r\n \/\/imprime a árvore recursivamente.\r\n\r\n if (tipo==FUN2){\r\n std::cout << \" (\";\r\n left->print_node_d();\r\n\r\n switch(C.function){\r\n case ADD:\r\n std::cout << \"+\";\r\n break;\r\n case DIV:\r\n std::cout << \"\/\";\r\n break;\r\n case SUB:\r\n std::cout << \"-\";\r\n break;\r\n case MULT:\r\n std::cout << \"*\";\r\n break;\r\n case POW:\r\n std::cout << \"^\";\r\n break;\r\n }\r\n\r\n right->print_node_d();\r\n std::cout << \") \";\r\n }\r\n else if (tipo==CTE)\r\n std::cout << this->C.value;\r\n else if (tipo==VAR)\r\n std::cout << \"x\" << C.idX;\r\n else{ \/\/tipo==FUN2\r\n switch(C.function){\r\n case LN:\r\n std::cout << \" ln(\";\r\n break;\r\n case EXP:\r\n std::cout <<\" (e^\";\r\n break;\r\n case SQRT:\r\n std::cout << \" sqrt(\";\r\n break;\r\n case SIN:\r\n std::cout << \" sin(\";\r\n break;\r\n case COS:\r\n std::cout << \" cos(\";\r\n break;\r\n case TAN:\r\n std::cout << \" tan(\";\r\n break;\r\n }\r\n right->print_node_d();\r\n std::cout << \") \";\r\n }\r\n}\r\n\r\nNode *Node::get_copy(){\r\n \r\n \/\/cria um novo Node, deleta seus filhos e ajusta todos os seus parâ-\r\n \/\/metros para que seja um ponteiro para uma cópia idêntica do nó que\r\n \/\/invocou o método.\r\n\r\n Node *aux = new Node(false, 0, 1); \r\n\r\n aux->tipo = this->tipo;\r\n aux->numberOfXs = this->numberOfXs;\r\n aux->maxDepth = this->maxDepth;\r\n\r\n if (tipo==VAR){\r\n aux->C.idX = this->C.idX;\r\n }\r\n else if (tipo==CTE){\r\n aux->C.value = this->C.value;\r\n }\r\n else if (tipo==FUN1){\r\n aux->C.function = this->C.function;\r\n\r\n if (right) aux->right = this->right->get_copy();\r\n else aux->left = this->left->get_copy();\r\n }\r\n else { \/\/tipo==FUN2\r\n aux->C.function = this->C.function;\r\n\r\n aux->left = this->left->get_copy();\r\n aux->right = this->right->get_copy();\r\n }\r\n return aux;\r\n}\r\n\r\nint Node::get_type(){\r\n\r\n \/\/retorna o tipo do nó. útil para funções da classe individual, já\r\n \/\/que o tipo é uma variável privada.\r\n\r\n return this->tipo;\r\n}\r\n<commit_msg>2.0.2 Print_node e println_node<commit_after>\/\/node.cpp\r\n#include <random>\r\n#include <cstdlib>\r\n#include <iostream>\r\n#include \"node.hpp\"\r\n\r\n\r\nusing namespace utils;\r\n\r\n\r\n \/\/--------------------CONSTRUTOR E DESTRUTOR--------------------------\/\/\r\n\r\nNode::Node(bool grow, int maxDepth, int numberOfXs){\r\n\r\n \/\/construtor, que recebe se deve construir a árvore no modo growStyle\r\n \/\/(caso falso, constrói no modo fullStyle). maxDepth determina a pro-\r\n \/\/fundidade máxima que a subárvore pode assumir. numberOfXs é nece-\r\n \/\/sário para que o construtor saiba quantas variáveis existem e possa\r\n \/\/criar este mesmo número de diferentes variáveis nas folhas.\r\n \/\/por padrão, grow = false, maxDepth = 0, numberOfXs = 1.\r\n\r\n this->numberOfXs = numberOfXs;\r\n this->maxDepth = maxDepth;\r\n\r\n if (grow) growStyle();\r\n else fullStyle();\r\n}\r\n\r\nNode::~Node(){\r\n \r\n \/\/destrutor, que recursivamente deleta o nó e todos os seus filhos.\r\n\r\n if (left) delete left;\r\n if (right) delete right;\r\n}\r\n\r\n\r\n \/\/------------ESTILOS DE CRIAÇÃO DE ÁRVORES DE EXPRESSÕES-------------\/\/\r\n\r\nvoid Node::growStyle(){\r\n\r\n \/\/estilo de crescimento aleatório, que funciona da seguinte forma:\r\n \/\/enquanto ainda há profundidade para as subárvores, não restringe\r\n \/\/o tipo que o nó pode ser. Quando chega na profundidade máxima,\r\n \/\/só cria folhas.\r\n\r\n if (maxDepth>1){\r\n tipo = random()%SIZETYPE;\r\n \r\n if (tipo==CTE) makeThisCte();\r\n else if (tipo==VAR) makeThisVar();\r\n else if (tipo==FUN1) makeThisFunc1(true);\r\n else makeThisFunc2(true); \/\/tipo==FUN2\r\n }\r\n else {\r\n tipo = random()%2;\r\n\r\n if (tipo==CTE) makeThisCte();\r\n else makeThisVar(); \/\/tipo==VAR\r\n }\r\n}\r\n\r\nvoid Node::fullStyle(){\r\n\r\n \/\/estilo de crescimento que gera sempre uma árvore binária completa\r\n \/\/(salvo casos onde são sorteadas funções de 1 parâmetro, tendo\r\n \/\/apenas um filho, e não dois).\r\n\r\n if (maxDepth>1){\r\n tipo = random()%2 + 2;\r\n\r\n if (tipo==FUN1) makeThisFunc1(false);\r\n else makeThisFunc2(false); \/\/tipo==FUN2 \r\n }\r\n else {\r\n tipo = random()%2;\r\n\r\n if (tipo==CTE) makeThisCte();\r\n else makeThisVar(); \/\/tipo==VAR\r\n }\r\n}\r\n\r\n\r\n \/\/----------FUNÇÕES AJUSTADORAS DE VALORES DA ÁRVORE------------------\/\/\r\n\r\nvoid Node::makeThisVar(){\r\n\r\n \/\/função que ajusta valores do nó para ser uma variável. Sorteia um\r\n \/\/índice de x para os n numberOfXs, deleta e \"nulla\" os ponteiros.\r\n\r\n C.idX = random()%numberOfXs;\r\n\r\n left = NULL;\r\n right = NULL;\r\n}\r\n\r\nvoid Node::makeThisCte(){\r\n\r\n \/\/ajusta os valores do nó para ser uma constante. Atribui um valor de\r\n \/\/ 0 a 9 para o nó, deleta e \"nulla\" os ponteiros.\r\n\r\n C.value = random()%10;\r\n\r\n left = NULL;\r\n right = NULL;\r\n}\r\n\r\nvoid Node::makeThisFunc1(bool grow){\r\n\r\n \/\/ajusta os valores do nó para ser uma função de 1 parâmetro. A fun-\r\n \/\/ção é sorteada dentro do utils, e por padrão o filho criado será na \r\n \/\/direita (isso não faria diferença aqui se fosse na esquerda), mas\r\n \/\/as funções do programa estão preparadas para lidar com casos onde\r\n \/\/a subárvore foi criada no lado esquerdo. chama recursivamente\r\n \/\/o construtor para que a árvore não fique incompleta.\r\n\r\n C.function = random() % SIZEFUNC1;\r\n\r\n right = new Node(grow, maxDepth-1, numberOfXs);\r\n left = NULL;\r\n}\r\n\r\nvoid Node::makeThisFunc2(bool grow){\r\n\r\n \/\/ajusta os valores do nó para ser uma função de 2 parâmetros. A\r\n \/\/função é sorteada dentro do utils. Chama recursivamente o cons-\r\n \/\/trutor dos dois filhos para que a árvore não fique incompleta.\r\n\r\n C.function = random() % SIZEFUNC2;\r\n\r\n right = new Node(grow, maxDepth-1, numberOfXs);\r\n left = new Node(grow, maxDepth-1, numberOfXs);\r\n}\r\n\r\n\r\n\r\n \/\/----------------FUNÇÕES DE UTILIDADE GERAL--------------------------\/\/\r\n\r\ndouble Node::eval(DataPoint p) {\r\n \r\n \/\/calcula o valor que a expressão retorna quando tem como valores\r\n \/\/para suas n variáveis os valores do DataPoint.x (vector<double>).\r\n\r\n if (this->tipo==VAR){\r\n return p.x[C.idX];\r\n } else if(this->tipo==CTE) {\r\n return C.value;\r\n } else if (this->tipo==FUN1){\r\n if (left)\r\n return func1_solver(C.function, left->eval(p));\r\n else\r\n return func1_solver(C.function, right->eval(p));\r\n } else \/\/this->tipo==FUN2\r\n return func2_solver(C.function, left->eval(p), right->eval(p));\r\n}\r\n\r\nvoid Node::print_node_d(){\r\n \r\n \/\/imprime a árvore recursivamente.\r\n\r\n if (tipo==FUN2){\r\n std::cout << \" (\";\r\n left->print_node_d();\r\n\r\n switch(C.function){\r\n case ADD:\r\n std::cout << \"+\";\r\n break;\r\n case DIV:\r\n std::cout << \"\/\";\r\n break;\r\n case SUB:\r\n std::cout << \"-\";\r\n break;\r\n case MULT:\r\n std::cout << \"*\";\r\n break;\r\n case POW:\r\n std::cout << \"^\";\r\n break;\r\n }\r\n\r\n right->print_node_d();\r\n std::cout << \") \";\r\n }\r\n else if (tipo==CTE)\r\n std::cout << this->C.value;\r\n else if (tipo==VAR)\r\n std::cout << \"x\" << C.idX;\r\n else{ \/\/tipo==FUN2\r\n switch(C.function){\r\n case LN:\r\n std::cout << \" ln(\";\r\n break;\r\n case EXP:\r\n std::cout <<\" (e^\";\r\n break;\r\n case SQRT:\r\n std::cout << \" sqrt(\";\r\n break;\r\n case SIN:\r\n std::cout << \" sin(\";\r\n break;\r\n case COS:\r\n std::cout << \" cos(\";\r\n break;\r\n case TAN:\r\n std::cout << \" tan(\";\r\n break;\r\n }\r\n right->print_node_d();\r\n std::cout << \") \";\r\n }\r\n}\r\n\r\nvoid Node::println_node_d(){\r\n print_node_d();\r\n std::cout << std::endl;\r\n}\r\n\r\nNode *Node::get_copy(){\r\n \r\n \/\/cria um novo Node, deleta seus filhos e ajusta todos os seus parâ-\r\n \/\/metros para que seja um ponteiro para uma cópia idêntica do nó que\r\n \/\/invocou o método.\r\n\r\n Node *aux = new Node(false, 0, 1); \r\n\r\n aux->tipo = this->tipo;\r\n aux->numberOfXs = this->numberOfXs;\r\n aux->maxDepth = this->maxDepth;\r\n\r\n if (tipo==VAR){\r\n aux->C.idX = this->C.idX;\r\n }\r\n else if (tipo==CTE){\r\n aux->C.value = this->C.value;\r\n }\r\n else if (tipo==FUN1){\r\n aux->C.function = this->C.function;\r\n\r\n if (right) aux->right = this->right->get_copy();\r\n else aux->left = this->left->get_copy();\r\n }\r\n else { \/\/tipo==FUN2\r\n aux->C.function = this->C.function;\r\n\r\n aux->left = this->left->get_copy();\r\n aux->right = this->right->get_copy();\r\n }\r\n return aux;\r\n}\r\n\r\nint Node::get_type(){\r\n\r\n \/\/retorna o tipo do nó. útil para funções da classe individual, já\r\n \/\/que o tipo é uma variável privada.\r\n\r\n return this->tipo;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2003 Daniel Wallin and Arvid Norberg\n\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF\n\/\/ ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\n\/\/ TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\/\/ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR\n\/\/ ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n\/\/ OR OTHER DEALINGS IN THE SOFTWARE.\n\n#define LUABIND_BUILDING\n\n#include <luabind\/lua_include.hpp>\n\n#include <luabind\/luabind.hpp>\n#include <luabind\/function.hpp>\n\nnamespace luabind {\n\nnamespace\n{\n\n int make_property(lua_State* L)\n {\n int args = lua_gettop(L);\n\n if (args == 0 || args > 2)\n {\n lua_pushstring(L, \"make_property() called with wrong number of arguments.\");\n lua_error(L);\n }\n\n if (args == 1)\n lua_pushnil(L);\n\n lua_pushcclosure(L, &detail::property_tag, 2);\n return 1;\n }\n\n} \/\/ namespace unnamed\n\n void open(lua_State* L)\n {\n \/\/ get the global class registry, or create one if it doesn't exist\n \/\/ (it's global within a lua state)\n detail::class_registry* r = 0;\n\n \/\/ If you hit this assert it's because you have called luabind::open()\n \/\/ twice on the same lua_State.\n assert((detail::class_registry::get_registry(L) == 0) \n && \"you cannot call luabind::open() twice\");\n\n lua_pushstring(L, \"__luabind_classes\");\n r = static_cast<detail::class_registry*>(\n lua_newuserdata(L, sizeof(detail::class_registry)));\n\n \/\/ set gc metatable\n lua_newtable(L);\n lua_pushstring(L, \"__gc\");\n lua_pushcclosure(\n L\n , detail::garbage_collector_s<\n detail::class_registry\n >::apply\n , 0);\n\n lua_settable(L, -3);\n lua_setmetatable(L, -2);\n\n new(r) detail::class_registry(L);\n lua_settable(L, LUA_REGISTRYINDEX);\n\n \/\/ add functions (class, cast etc...)\n lua_pushstring(L, \"class\");\n lua_pushcclosure(L, detail::create_class::stage1, 0);\n lua_settable(L, LUA_GLOBALSINDEX);\n\n lua_pushstring(L, \"property\");\n lua_pushcclosure(L, &make_property, 0);\n lua_settable(L, LUA_GLOBALSINDEX);\n }\n\n} \/\/ namespace luabind\n\n<commit_msg>Add missing LUABIND_API to luabind::open().<commit_after>\/\/ Copyright (c) 2003 Daniel Wallin and Arvid Norberg\n\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF\n\/\/ ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\n\/\/ TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\/\/ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR\n\/\/ ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n\/\/ OR OTHER DEALINGS IN THE SOFTWARE.\n\n#define LUABIND_BUILDING\n\n#include <luabind\/lua_include.hpp>\n\n#include <luabind\/luabind.hpp>\n#include <luabind\/function.hpp>\n\nnamespace luabind {\n\nnamespace\n{\n\n int make_property(lua_State* L)\n {\n int args = lua_gettop(L);\n\n if (args == 0 || args > 2)\n {\n lua_pushstring(L, \"make_property() called with wrong number of arguments.\");\n lua_error(L);\n }\n\n if (args == 1)\n lua_pushnil(L);\n\n lua_pushcclosure(L, &detail::property_tag, 2);\n return 1;\n }\n\n} \/\/ namespace unnamed\n\n LUABIND_API void open(lua_State* L)\n {\n \/\/ get the global class registry, or create one if it doesn't exist\n \/\/ (it's global within a lua state)\n detail::class_registry* r = 0;\n\n \/\/ If you hit this assert it's because you have called luabind::open()\n \/\/ twice on the same lua_State.\n assert((detail::class_registry::get_registry(L) == 0) \n && \"you cannot call luabind::open() twice\");\n\n lua_pushstring(L, \"__luabind_classes\");\n r = static_cast<detail::class_registry*>(\n lua_newuserdata(L, sizeof(detail::class_registry)));\n\n \/\/ set gc metatable\n lua_newtable(L);\n lua_pushstring(L, \"__gc\");\n lua_pushcclosure(\n L\n , detail::garbage_collector_s<\n detail::class_registry\n >::apply\n , 0);\n\n lua_settable(L, -3);\n lua_setmetatable(L, -2);\n\n new(r) detail::class_registry(L);\n lua_settable(L, LUA_REGISTRYINDEX);\n\n \/\/ add functions (class, cast etc...)\n lua_pushstring(L, \"class\");\n lua_pushcclosure(L, detail::create_class::stage1, 0);\n lua_settable(L, LUA_GLOBALSINDEX);\n\n lua_pushstring(L, \"property\");\n lua_pushcclosure(L, &make_property, 0);\n lua_settable(L, LUA_GLOBALSINDEX);\n }\n\n} \/\/ namespace luabind\n\n<|endoftext|>"} {"text":"<commit_before>#include \"param.h\"\n#include <TError.h>\n\nnamespace bdm {\n\n\/\/ simulation group\nstd::string Param::backup_file_ = \"\";\nstd::string Param::restore_file_ = \"\";\nuint32_t Param::backup_interval_ = 1800;\ndouble Param::simulation_time_step_ = 0.01;\ndouble Param::simulation_max_displacement_ = 3.0;\nbool Param::run_mechanical_interactions_ = true;\nbool Param::bound_space_ = false;\ndouble Param::min_bound_ = 0;\ndouble Param::max_bound_ = 100;\n\n\/\/ visualization group\nbool Param::live_visualization_ = false;\nbool Param::export_visualization_ = false;\nuint32_t Param::visualization_export_interval_ = 1;\nstd::unordered_map<std::string, std::set<std::string>>\n Param::visualize_sim_objects_;\nstd::vector<Param::VisualizeDiffusion> Param::visualize_diffusion_;\n\n\/\/ development group\nbool Param::output_op_runtime_ = false;\nbool Param::python_catalyst_pipeline_ = false;\n\n#define BDM_ASSIGN_CONFIG_VALUE(variable, config_key) \\\n { \\\n auto value = config->get_qualified_as<decltype(variable)>(config_key); \\\n if (value) { \\\n variable = *value; \\\n } \\\n }\n\nvoid Param::AssignFromConfig(const std::shared_ptr<cpptoml::table>& config) {\n \/\/ simulation group\n BDM_ASSIGN_CONFIG_VALUE(backup_file_, \"simulation.backup_file\");\n BDM_ASSIGN_CONFIG_VALUE(restore_file_, \"simulation.restore_file\");\n BDM_ASSIGN_CONFIG_VALUE(backup_interval_, \"simulation.backup_interval\");\n BDM_ASSIGN_CONFIG_VALUE(simulation_time_step_, \"simulation.time_step\");\n BDM_ASSIGN_CONFIG_VALUE(simulation_max_displacement_,\n \"simulation.max_displacement\");\n BDM_ASSIGN_CONFIG_VALUE(run_mechanical_interactions_,\n \"simulation.run_mechanical_interactions\");\n BDM_ASSIGN_CONFIG_VALUE(bound_space_, \"simulation.bound_space\");\n BDM_ASSIGN_CONFIG_VALUE(min_bound_, \"simulation.min_bound\");\n BDM_ASSIGN_CONFIG_VALUE(max_bound_, \"simulation.max_bound\");\n \/\/ visualization group\n BDM_ASSIGN_CONFIG_VALUE(live_visualization_, \"visualization.live\");\n BDM_ASSIGN_CONFIG_VALUE(export_visualization_, \"visualization.export\");\n BDM_ASSIGN_CONFIG_VALUE(visualization_export_interval_,\n \"visualization.export_interval\");\n\n \/\/ visualize_sim_objects_\n auto visualize_sim_objects_tarr =\n config->get_table_array(\"visualize_sim_object\");\n if (visualize_sim_objects_tarr) {\n for (const auto& table : *visualize_sim_objects_tarr) {\n \/\/ We do a 'redundant' check here, because `get_as` on Mac OS does not\n \/\/ catch the exception when the \"name\" is not defined in the bdm.toml\n \/\/ Same goes for all the other redundant checks\n if (table->contains(\"name\")) {\n auto name = table->get_as<std::string>(\"name\");\n if (!name) {\n Warning(\"AssignFromConfig\",\n \"Missing name for attribute visualize_sim_object\");\n continue;\n }\n\n if (table->contains(\"additional_data_members\")) {\n auto dm_option =\n table->get_array_of<std::string>(\"additional_data_members\");\n\n std::set<std::string> data_members;\n for (const auto& val : *dm_option) {\n data_members.insert(val);\n }\n visualize_sim_objects_[*name] = data_members;\n } else {\n std::set<std::string> data_members;\n visualize_sim_objects_[*name] = data_members;\n }\n }\n }\n }\n\n \/\/ visualize_diffusion_\n auto visualize_diffusion_tarr =\n config->get_table_array(\"visualize_diffusion\");\n if (visualize_diffusion_tarr) {\n for (const auto& table : *visualize_diffusion_tarr) {\n if (table->contains(\"name\")) {\n auto name = table->get_as<std::string>(\"name\");\n if (!name) {\n Warning(\"AssignFromConfig\",\n \"Missing name for attribute visualize_diffusion\");\n continue;\n }\n\n VisualizeDiffusion vd;\n vd.name_ = *name;\n\n if (table->contains(\"concentration\")) {\n auto concentration = table->get_as<bool>(\"concentration\");\n if (concentration) {\n vd.concentration_ = *concentration;\n }\n }\n if (table->contains(\"gradient\")) {\n auto gradient = table->get_as<bool>(\"gradient\");\n if (gradient) {\n vd.gradient_ = *gradient;\n }\n }\n\n visualize_diffusion_.push_back(vd);\n }\n }\n }\n\n \/\/ development group\n BDM_ASSIGN_CONFIG_VALUE(output_op_runtime_, \"development.output_op_runtime\");\n}\n\nvoid Param::Reset() {\n \/\/ simulation group\n backup_file_ = \"\";\n restore_file_ = \"\";\n backup_interval_ = 1800;\n simulation_time_step_ = 0.01;\n simulation_max_displacement_ = 3.0;\n run_mechanical_interactions_ = true;\n bound_space_ = false;\n min_bound_ = 0;\n max_bound_ = 100;\n\n \/\/ visualization group\n live_visualization_ = false;\n export_visualization_ = false;\n visualization_export_interval_ = 1;\n visualize_sim_objects_.clear();\n visualize_diffusion_.clear();\n\n \/\/ development group\n output_op_runtime_ = false;\n python_catalyst_pipeline_ = false;\n}\n\n} \/\/ namespace bdm\n<commit_msg>Fix toml segfault on OS X<commit_after>#include \"param.h\"\n#include <TError.h>\n\nnamespace bdm {\n\n\/\/ simulation group\nstd::string Param::backup_file_ = \"\";\nstd::string Param::restore_file_ = \"\";\nuint32_t Param::backup_interval_ = 1800;\ndouble Param::simulation_time_step_ = 0.01;\ndouble Param::simulation_max_displacement_ = 3.0;\nbool Param::run_mechanical_interactions_ = true;\nbool Param::bound_space_ = false;\ndouble Param::min_bound_ = 0;\ndouble Param::max_bound_ = 100;\n\n\/\/ visualization group\nbool Param::live_visualization_ = false;\nbool Param::export_visualization_ = false;\nuint32_t Param::visualization_export_interval_ = 1;\nstd::unordered_map<std::string, std::set<std::string>>\n Param::visualize_sim_objects_;\nstd::vector<Param::VisualizeDiffusion> Param::visualize_diffusion_;\n\n\/\/ development group\nbool Param::output_op_runtime_ = false;\nbool Param::python_catalyst_pipeline_ = false;\n\n#define BDM_ASSIGN_CONFIG_VALUE(variable, config_key) \\\n { \\\n if (config->contains_qualified(config_key)) { \\\n auto value = config->get_qualified_as<decltype(variable)>(config_key); \\\n if (value) { \\\n variable = *value; \\\n } \\\n } \\\n }\n\nvoid Param::AssignFromConfig(const std::shared_ptr<cpptoml::table>& config) {\n \/\/ simulation group\n BDM_ASSIGN_CONFIG_VALUE(backup_file_, \"simulation.backup_file\");\n BDM_ASSIGN_CONFIG_VALUE(restore_file_, \"simulation.restore_file\");\n BDM_ASSIGN_CONFIG_VALUE(backup_interval_, \"simulation.backup_interval\");\n BDM_ASSIGN_CONFIG_VALUE(simulation_time_step_, \"simulation.time_step\");\n BDM_ASSIGN_CONFIG_VALUE(simulation_max_displacement_,\n \"simulation.max_displacement\");\n BDM_ASSIGN_CONFIG_VALUE(run_mechanical_interactions_,\n \"simulation.run_mechanical_interactions\");\n BDM_ASSIGN_CONFIG_VALUE(bound_space_, \"simulation.bound_space\");\n BDM_ASSIGN_CONFIG_VALUE(min_bound_, \"simulation.min_bound\");\n BDM_ASSIGN_CONFIG_VALUE(max_bound_, \"simulation.max_bound\");\n \/\/ visualization group\n BDM_ASSIGN_CONFIG_VALUE(live_visualization_, \"visualization.live\");\n BDM_ASSIGN_CONFIG_VALUE(export_visualization_, \"visualization.export\");\n BDM_ASSIGN_CONFIG_VALUE(visualization_export_interval_,\n \"visualization.export_interval\");\n\n \/\/ visualize_sim_objects_\n auto visualize_sim_objects_tarr =\n config->get_table_array(\"visualize_sim_object\");\n if (visualize_sim_objects_tarr) {\n for (const auto& table : *visualize_sim_objects_tarr) {\n \/\/ We do a 'redundant' check here, because `get_as` on Mac OS does not\n \/\/ catch the exception when the \"name\" is not defined in the bdm.toml\n \/\/ Same goes for all the other redundant checks\n if (table->contains(\"name\")) {\n auto name = table->get_as<std::string>(\"name\");\n if (!name) {\n Warning(\"AssignFromConfig\",\n \"Missing name for attribute visualize_sim_object\");\n continue;\n }\n\n if (table->contains(\"additional_data_members\")) {\n auto dm_option =\n table->get_array_of<std::string>(\"additional_data_members\");\n\n std::set<std::string> data_members;\n for (const auto& val : *dm_option) {\n data_members.insert(val);\n }\n visualize_sim_objects_[*name] = data_members;\n } else {\n std::set<std::string> data_members;\n visualize_sim_objects_[*name] = data_members;\n }\n }\n }\n }\n\n \/\/ visualize_diffusion_\n auto visualize_diffusion_tarr =\n config->get_table_array(\"visualize_diffusion\");\n if (visualize_diffusion_tarr) {\n for (const auto& table : *visualize_diffusion_tarr) {\n if (table->contains(\"name\")) {\n auto name = table->get_as<std::string>(\"name\");\n if (!name) {\n Warning(\"AssignFromConfig\",\n \"Missing name for attribute visualize_diffusion\");\n continue;\n }\n\n VisualizeDiffusion vd;\n vd.name_ = *name;\n\n if (table->contains(\"concentration\")) {\n auto concentration = table->get_as<bool>(\"concentration\");\n if (concentration) {\n vd.concentration_ = *concentration;\n }\n }\n if (table->contains(\"gradient\")) {\n auto gradient = table->get_as<bool>(\"gradient\");\n if (gradient) {\n vd.gradient_ = *gradient;\n }\n }\n\n visualize_diffusion_.push_back(vd);\n }\n }\n }\n\n \/\/ development group\n BDM_ASSIGN_CONFIG_VALUE(output_op_runtime_, \"development.output_op_runtime\");\n}\n\nvoid Param::Reset() {\n \/\/ simulation group\n backup_file_ = \"\";\n restore_file_ = \"\";\n backup_interval_ = 1800;\n simulation_time_step_ = 0.01;\n simulation_max_displacement_ = 3.0;\n run_mechanical_interactions_ = true;\n bound_space_ = false;\n min_bound_ = 0;\n max_bound_ = 100;\n\n \/\/ visualization group\n live_visualization_ = false;\n export_visualization_ = false;\n visualization_export_interval_ = 1;\n visualize_sim_objects_.clear();\n visualize_diffusion_.clear();\n\n \/\/ development group\n output_op_runtime_ = false;\n python_catalyst_pipeline_ = false;\n}\n\n} \/\/ namespace bdm\n<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <iostream>\n#include \"config.hpp\"\n#include \"peers.hpp\"\n\nPeer::Peer(std::string hexIP, class User* u, bool seeding, unsigned int fid, std::string client) {\n\tstd::cout << \"Creating peer on torrent \" << std::to_string(fid) << \" using client \" << client << \" (\" << hexIP << \")\\n\";\n\tthis->hexIP = hexIP;\n\tthis->user = u;\n\tthis->seeding = seeding;\n\tthis->fid = fid;\n\tthis->client = client;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tlastUpdate = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tseedtime = 0;\n}\n\nUser* Peer::User() {\n\treturn this->user;\n}\n\nstd::string* Peer::getHexIP() {\n\treturn &this->hexIP;\n}\n\nvoid Peer::updateStats (unsigned long stats, const long long &now) {\n\tstd::cout << \"Updating stats (\" << std::to_string(this->stats) << \" -> \" << std::to_string(stats) << \") on a user from torrent \" << std::to_string(fid) << \" (\" << hexIP << \")\\n\";\n\tthis->stats += stats;\n\tseedtime += now - lastUpdate;\n\tlastUpdate = now;\n}\n\nvoid Peer::resetStats() {\n\tthis->stats = 0;\n}\n\nstd::string Peer::record(const unsigned int& left, const std::string& peerID) {\n\tstd::cout << \"Recording stats of peer \" << peerID << \" (left: \" << left << \")\\n\";\n\tunsigned int downloaded,uploaded = 0;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tauto now = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tif (seeding) {\n\t\tuploaded = stats;\n\t\tdownloaded = 0;\n\t\tseedtime = now - lastUpdate;\n\t} else {\n\t\tdownloaded = stats;\n\t\tuploaded = 0;\n\t}\n\tstats = 0;\n\tlastUpdate = now;\n\treturn \"INSERT INTO xbt_files_users(uid,downloaded,uploaded,remaining,seedtime,useragent,peerid,fid) VALUES ('\"\n\t\t\t\t\t\t+ std::to_string(*user->getID()) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(downloaded) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(uploaded) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(left) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(seedtime) + \"', \" +\n\t\t\t\t\t\"'\" + client + \"', \" +\n\t\t\t\t\t\"'\" + peerID + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(fid) + \"') ON DUPLICATE downloaded = downloaded + VALUES(downloaded), uploaded = uploaded + VALUES(uploaded), seedtime = seedtime + VALUES(seedtime)\";\n\tuser->updateStats(downloaded,uploaded);\n}\n\nstd::string Peer::remove(const std::string& peerID, const unsigned int& fid) {\n\tstd::cout << \"Removing peer \" << peerID << \" from torrent \" << std::to_string(fid) << '\\n';\n\treturn \"DELETE FROM xbt_files_users WHERE peer_id LIKE '\"\n\t\t+ peerID\n\t\t+ \"' AND fid = \"\n\t\t+ std::to_string(fid);\n}\n\nbool Peer::timedOut(const long long &now) {\n\tstd::cout << \"A PEER TIMED OUT\\n\";\n\treturn (now - lastUpdate > Config::getInt(\"timeout\"));\n}\n<commit_msg>fix mysql on duplicate syntax<commit_after>#include <chrono>\n#include <iostream>\n#include \"config.hpp\"\n#include \"peers.hpp\"\n\nPeer::Peer(std::string hexIP, class User* u, bool seeding, unsigned int fid, std::string client) {\n\tstd::cout << \"Creating peer on torrent \" << std::to_string(fid) << \" using client \" << client << \" (\" << hexIP << \")\\n\";\n\tthis->hexIP = hexIP;\n\tthis->user = u;\n\tthis->seeding = seeding;\n\tthis->fid = fid;\n\tthis->client = client;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tlastUpdate = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tseedtime = 0;\n}\n\nUser* Peer::User() {\n\treturn this->user;\n}\n\nstd::string* Peer::getHexIP() {\n\treturn &this->hexIP;\n}\n\nvoid Peer::updateStats (unsigned long stats, const long long &now) {\n\tstd::cout << \"Updating stats (\" << std::to_string(this->stats) << \" -> \" << std::to_string(stats) << \") on a user from torrent \" << std::to_string(fid) << \" (\" << hexIP << \")\\n\";\n\tthis->stats += stats;\n\tseedtime += now - lastUpdate;\n\tlastUpdate = now;\n}\n\nvoid Peer::resetStats() {\n\tthis->stats = 0;\n}\n\nstd::string Peer::record(const unsigned int& left, const std::string& peerID) {\n\tstd::cout << \"Recording stats of peer \" << peerID << \" (left: \" << left << \")\\n\";\n\tunsigned int downloaded,uploaded = 0;\n\tauto duration = std::chrono::system_clock::now().time_since_epoch();\n\tauto now = std::chrono::duration_cast<std::chrono::seconds>(duration).count();\n\tif (seeding) {\n\t\tuploaded = stats;\n\t\tdownloaded = 0;\n\t\tseedtime = now - lastUpdate;\n\t} else {\n\t\tdownloaded = stats;\n\t\tuploaded = 0;\n\t}\n\tstats = 0;\n\tlastUpdate = now;\n\treturn \"INSERT INTO xbt_files_users(uid,downloaded,uploaded,remaining,seedtime,useragent,peerid,fid) VALUES ('\"\n\t\t\t\t\t\t+ std::to_string(*user->getID()) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(downloaded) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(uploaded) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(left) + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(seedtime) + \"', \" +\n\t\t\t\t\t\"'\" + client + \"', \" +\n\t\t\t\t\t\"'\" + peerID + \"', \" +\n\t\t\t\t\t\"'\" + std::to_string(fid) + \"') ON DUPLICATE KEY UPDATE downloaded = downloaded + VALUES(downloaded), uploaded = uploaded + VALUES(uploaded), seedtime = seedtime + VALUES(seedtime)\";\n\tuser->updateStats(downloaded,uploaded);\n}\n\nstd::string Peer::remove(const std::string& peerID, const unsigned int& fid) {\n\tstd::cout << \"Removing peer \" << peerID << \" from torrent \" << std::to_string(fid) << '\\n';\n\treturn \"DELETE FROM xbt_files_users WHERE peer_id LIKE '\"\n\t\t+ peerID\n\t\t+ \"' AND fid = \"\n\t\t+ std::to_string(fid);\n}\n\nbool Peer::timedOut(const long long &now) {\n\tstd::cout << \"A PEER TIMED OUT\\n\";\n\treturn (now - lastUpdate > Config::getInt(\"timeout\"));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include <errno>\n#include \"omp.h\"\n\n\/\/ Contains the various options the user can pass ptgz.\nstruct Settings {\n\tSettings(): extract(),\n\t\t\t\tcompress(),\n \t\t\t\tverbose(),\n\t\t\t\tkeep(),\n\t\t\t\toutput() {}\n\tbool extract;\n\tbool compress;\n\tbool verbose;\n\tbool keep;\n\tbool output;\n\tstd::string name;\n};\n\n\/\/ Checks if the user asks for help.\n\/\/ Provides usage information to the user.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\nvoid helpCheck(int argc, char *argv[]) {\n\tif (argc == 1) {\n\t\tstd::cout << \"ERROR: ptgz was passed no parameters. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t}\n\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptgz - Parallel Tar GZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\tstd::cout << \" ptgz is a custom multi-threaded C++ file archiving utility to quickly bundle millions of files in \\n\";\n\t\tstd::cout << \" terrabyte sized directories into a single file. ptgz was developed at the National Center for \\n\";\n\t\tstd::cout << \" Supercomputing Applications.\\n\" << std::endl;\n\t\tstd::cout << \" Usage:\\n\";\n\t\tstd::cout << \" If you are compressing, your current working directory should be parent directory of all directories you\\n\";\n\t\tstd::cout << \" want to archive. If you are extracting, your current working directory should be the same as your archive.\\n\" << std::endl;\n\t\tstd::cout << \" ptgz [-c|-k|-v|-x] <archive>\\n\" << std::endl;\n\t\tstd::cout << \" Modes:\\n\";\n\t\tstd::cout << \" -c Compression ptgz will perform file compression. The current directory and all of it's\\n\";\n\t\tstd::cout << \" children will be archived and added to a single tarball. <archive> will be \\n\";\n\t\tstd::cout << \" prefix of the ptgz archive created.\\n\" << std::endl;\n\t\tstd::cout << \" -k Keep Archive ptgz will not delete the ptgz archive it has been passed to extract. \\\"-x\\\" \\n\";\n\t\tstd::cout << \" must also be used to use this option.\\n\" << std::endl;\n\t\tstd::cout << \" -v Enable Verbose ptgz will print the commands as they are called to STDOUT\\n\" << std::endl;\n\t\tstd::cout << \" -x Extraction ptgz will perform file extraction from an archive. The passed ptgz archive\\n\";\n\t\tstd::cout << \" will be unpacked and split into its component files. <archive> should be the\\n\";\n\t\tstd::cout << \" the name of the archive to extract.\" << std::endl;\n\t\texit(0);\n\t}\n}\n\n\/\/ Gets the parameters passed by the user and stores them.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\n\/\/ \t\t\t instance (Settings *) user argument storage.\nvoid getSettings(int argc, char *argv[], Settings *instance) {\n\t\/\/ Get all passed arguments\n\tstd::queue<std::string> settings;\n\tfor (int i = 1; i < argc; ++i) {\n\t\tsettings.push(argv[i]);\n\t}\n\t\n\t\/\/ Continue to check until there are no more passed arguments.\n\twhile (!settings.empty()) {\n\t\tstd::string arg = settings.front();\n\n\t\tif (arg == \"-x\") {\n\t\t\tif ((*instance).compress) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).extract = true;\n\t\t} else if (arg == \"-c\") {\n\t\t\tif ((*instance).extract) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).compress = true;\n\t\t} else if (arg == \"-v\"){\n\t\t\t(*instance).verbose = true;\n\t\t} else if (arg == \"-o\") {\n\t\t\t(*instance).output = true;\n\t\t} else if (arg == \"-k\") {\n\t\t\t(*instance).keep = true;\n\t\t} else {\n\t\t\tif (settings.size() > 1) {\n\t\t\t\tstd::cout << \"ERROR: ptgz was called incorrectly. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).output = true;\n\t\t\t(*instance).name = arg;\n\t\t}\n\n\t\tsettings.pop();\n\t}\n\n\tif (!(*instance).output) {\n\t\tstd::cout << \"ERROR: No output file name given. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t} else if ((*instance).keep && !(*instance).extract) {\n\t\tstd::cout << \"ERROR: Can't use keep option without extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t}\n}\n\n\/\/ Finds the number of files in the space to store.\n\/\/ Parameters: numFiles (int *) number of files.\n\/\/ \t\t\t cwd (const char *) current working directory.\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Gets the paths for all files in the space to store.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t cwd (const char *) current working directory.\n\/\/ \t\t\t rootPath (std::string) path from the root of the directory to be stored.\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Divides files into blocks.\n\/\/ Compresses each block into a single file.\n\/\/ Combines all compressed blocks into a single file.\n\/\/ Removes temporary blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) user given name for storage file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\nvoid compression(std::vector<std::string> *filePaths, std::string name, bool verbose) {\n\tstd::random_shuffle(filePaths->begin(), filePaths->end());\n\tunsigned long long int filePathSize = filePaths->size();\n\tunsigned long long int blockSize = (filePathSize \/ (omp_get_max_threads() * 10)) + 1;\n\tstd::vector<std::string> *tarNames = new std::vector<std::string>(filePathSize \/ blockSize + 1);\n\t\n\t\/\/ Gzips the blocks of files into a single compressed file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < omp_get_max_threads() * 10; ++i) {\n\t\tunsigned long long int start = blockSize * i;\n\t\tif (start < filePathSize) {\n\t\t\t\/\/ Store the name of each file for a block owned by each thread.\n\t\t\t\/\/ Each thread will use the file to tar and gzip compress their block.\n\t\t\tstd::ofstream tmp;\n\t\t\ttmp.open(std::to_string(i) + \".\" + name + \".ptgz.tmp\", std::ios_base::app);\n\t\t\tstd::string gzCommand = \"GZIP=-1 tar -cz -T \" + std::to_string(i) + \".\" + name + \".ptgz.tmp -f \" + std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t\tfor (unsigned long long int j = start; j < std::min(start + blockSize, filePathSize); ++j) {\n\t\t\t\ttmp << filePaths->at(j) + \"\\n\";\n\t\t\t}\n\t\n\t\t\tif (verbose) {\n\t\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t\t}\n\n\t\t\ttmp.close();\n\t\t\tsystem(gzCommand.c_str());\n\t\t\ttarNames->at(i) = std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t}\n\t}\n\n\t\/\/ Combines gzipped blocks together into a single tarball.\n\t\/\/ Write tarball names into an idx file for extraction.\n\tstd::ofstream idx, tmp;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::app);\n\tstd::string tarCommand = \"tar -c -T \" + name + \".ptgz.idx -f \" + name + \".ptgz.tar\";\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tidx << tarNames->at(i) + \"\\n\";\n\t}\n\tidx << name + \".ptgz.idx\" + \"\\n\";\n\tidx.close();\n\t\n\tif (verbose) {\n\t\tstd::cout << tarCommand + \"\\n\";\n\t}\n\t\n\tsystem(tarCommand.c_str());\n\n\t\/\/ Removes all temporary blocks and idx file.\n\t#pragma omp parallel for schedule(static)\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tstd::string rmCommand = tarNames->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(rmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t}\n\t\t\n\n\t\trmCommand = std::to_string(i) + \".\" + name + \".ptgz.tmp\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\t\/\/ if (remove(rmCommand.c_str())) {\n\t\t\t\/\/ std::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t\/\/ }\n\t}\n\n\tstd::string rmCommand;\n\tif (verbose) {\n\t\tstd::cout << \"remove(\" + name + \".ptgz.idx)\\n\";\n\t}\n\trmCommand = name + \".ptgz.idx\";\n\tif (remove(rmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t}\n\n\ttarNames->clear();\n\tdelete(tarNames);\n}\n\n\/\/ Unpacks the archive.\n\/\/ Reads in all the files from the index file.\n\/\/ Unpacks each file.\n\/\/ Deletes all temporary file blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) name of ptgz archive file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\n\/\/ \t\t\t keep (bool) user option for keeping ptgz archive.\nvoid extraction(std::vector<std::string> *filePaths, std::string name, bool verbose, bool keep) {\n\t\/\/ Unpack the 1st layer tarball\n\tstd::string exCommand = \"tar xf \" + name;\n\tif (verbose) {\n\t\tstd::cout << exCommand + \"\\n\";\n\t}\n\tsystem(exCommand.c_str());\n\n\t\/\/ Get the name from the name of the 1st layer tarball\n\tfor (int i = 0; i < 9; ++i) {\n\t\tname.pop_back();\n\t}\n\n\t\/\/ Read in all tar.gz files form the ptgz.idx file\n\t\/\/ Delete the ptgz.idx file\n\tstd::ifstream idx;\n\tstd::string line;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::in);\n\twhile (std::getline(idx, line)) {\n\t\tfilePaths->push_back(line);\n\t}\n\tidx.close();\n\tstd::string idxRmCommand = filePaths->back();\n\tif (remove(idxRmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + idxRmCommand + \" could not be removed.\\n\";\t\n\t}\n\tfilePaths->pop_back();\n\n\t\/\/ Unpack each tar.gz file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzCommand = \"tar xzf \" + filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t}\n\t\tsystem(gzCommand.c_str());\n\t\tstd::cout << std::errno(errno) << std::endl;\n\t}\n\n\t\/\/ Delete each tar.gz file\n\t#pragma omp parallel for schedule(static)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzRmCommand = filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + gzRmCommand + \")\\n\";\n\t\t}\n\t\t\/\/ if (remove(gzRmCommand.c_str())) {\n\t\t\t\/\/ std::cout << \"ERROR: \" + gzRmCommand + \" could not be removed.\\n\";\n\t\t\/\/ }\n\t}\n\t\n\t\/\/ Decided whether or not to keep the ptgz.tar archive\n\tif (!keep) {\n\t\tstd::string tarRmCommand = name + \".ptgz.tar\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + tarRmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(tarRmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + tarRmCommand + \" could not be removed.\\n\";\n\t\t}\n\t}\n}\n\nchar cwd [PATH_MAX];\n\n\/\/ Checks to see if the user asks for help.\n\/\/ Gathers the user provided settings for ptgz.\n\/\/ Finds the number of files that need to be stored.\n\/\/ Gathers the file paths of all files to be stored.\n\/\/ Either compresses the files or extracts the ptgz.tar archive.\nint main(int argc, char *argv[]) {\n\tSettings *instance = new Settings;\n\tint *numFiles = new int(0);\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\t\n\thelpCheck(argc, argv);\n\tgetSettings(argc, argv, instance);\n\tgetcwd(cwd, PATH_MAX);\n\n\tif ((*instance).compress) {\n\t\tfindAll(numFiles, cwd);\n\t\tgetPaths(filePaths, cwd, \"\");\n\t\tcompression(filePaths, (*instance).name, (*instance).verbose);\n\t} else {\n\t\textraction(filePaths, (*instance).name, (*instance).verbose, (*instance).keep);\n\t}\n\n\tdelete(instance);\n\tdelete(numFiles);\n\tfilePaths->clear();\n\tdelete(filePaths);\n\treturn 0;\n}\n<commit_msg>Fixed include<commit_after>#include <stdlib.h>\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <unistd.h>\n#include <dirent.h>\n#include <fstream>\n#include <sstream>\n#include <queue>\n#include <cerrno>\n#include \"omp.h\"\n\n\/\/ Contains the various options the user can pass ptgz.\nstruct Settings {\n\tSettings(): extract(),\n\t\t\t\tcompress(),\n \t\t\t\tverbose(),\n\t\t\t\tkeep(),\n\t\t\t\toutput() {}\n\tbool extract;\n\tbool compress;\n\tbool verbose;\n\tbool keep;\n\tbool output;\n\tstd::string name;\n};\n\n\/\/ Checks if the user asks for help.\n\/\/ Provides usage information to the user.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\nvoid helpCheck(int argc, char *argv[]) {\n\tif (argc == 1) {\n\t\tstd::cout << \"ERROR: ptgz was passed no parameters. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t}\n\n\tif (argv[1] == std::string(\"-h\") || argv[1] == std::string(\"--help\")) {\n\t\tstd::cout << \"\\nptgz - Parallel Tar GZ by Ryan Chui (2017)\\n\" << std::endl;\n\t\tstd::cout << \" ptgz is a custom multi-threaded C++ file archiving utility to quickly bundle millions of files in \\n\";\n\t\tstd::cout << \" terrabyte sized directories into a single file. ptgz was developed at the National Center for \\n\";\n\t\tstd::cout << \" Supercomputing Applications.\\n\" << std::endl;\n\t\tstd::cout << \" Usage:\\n\";\n\t\tstd::cout << \" If you are compressing, your current working directory should be parent directory of all directories you\\n\";\n\t\tstd::cout << \" want to archive. If you are extracting, your current working directory should be the same as your archive.\\n\" << std::endl;\n\t\tstd::cout << \" ptgz [-c|-k|-v|-x] <archive>\\n\" << std::endl;\n\t\tstd::cout << \" Modes:\\n\";\n\t\tstd::cout << \" -c Compression ptgz will perform file compression. The current directory and all of it's\\n\";\n\t\tstd::cout << \" children will be archived and added to a single tarball. <archive> will be \\n\";\n\t\tstd::cout << \" prefix of the ptgz archive created.\\n\" << std::endl;\n\t\tstd::cout << \" -k Keep Archive ptgz will not delete the ptgz archive it has been passed to extract. \\\"-x\\\" \\n\";\n\t\tstd::cout << \" must also be used to use this option.\\n\" << std::endl;\n\t\tstd::cout << \" -v Enable Verbose ptgz will print the commands as they are called to STDOUT\\n\" << std::endl;\n\t\tstd::cout << \" -x Extraction ptgz will perform file extraction from an archive. The passed ptgz archive\\n\";\n\t\tstd::cout << \" will be unpacked and split into its component files. <archive> should be the\\n\";\n\t\tstd::cout << \" the name of the archive to extract.\" << std::endl;\n\t\texit(0);\n\t}\n}\n\n\/\/ Gets the parameters passed by the user and stores them.\n\/\/ Parameters: argc (int) number of cli arguments.\n\/\/ \t\t\t argv (char *[]) user provided arguments.\n\/\/ \t\t\t instance (Settings *) user argument storage.\nvoid getSettings(int argc, char *argv[], Settings *instance) {\n\t\/\/ Get all passed arguments\n\tstd::queue<std::string> settings;\n\tfor (int i = 1; i < argc; ++i) {\n\t\tsettings.push(argv[i]);\n\t}\n\t\n\t\/\/ Continue to check until there are no more passed arguments.\n\twhile (!settings.empty()) {\n\t\tstd::string arg = settings.front();\n\n\t\tif (arg == \"-x\") {\n\t\t\tif ((*instance).compress) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).extract = true;\n\t\t} else if (arg == \"-c\") {\n\t\t\tif ((*instance).extract) {\n\t\t\t\tstd::cout << \"ERROR: ptgz cannot both compress and extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).compress = true;\n\t\t} else if (arg == \"-v\"){\n\t\t\t(*instance).verbose = true;\n\t\t} else if (arg == \"-o\") {\n\t\t\t(*instance).output = true;\n\t\t} else if (arg == \"-k\") {\n\t\t\t(*instance).keep = true;\n\t\t} else {\n\t\t\tif (settings.size() > 1) {\n\t\t\t\tstd::cout << \"ERROR: ptgz was called incorrectly. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t\t(*instance).output = true;\n\t\t\t(*instance).name = arg;\n\t\t}\n\n\t\tsettings.pop();\n\t}\n\n\tif (!(*instance).output) {\n\t\tstd::cout << \"ERROR: No output file name given. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t\texit(0);\n\t} else if ((*instance).keep && !(*instance).extract) {\n\t\tstd::cout << \"ERROR: Can't use keep option without extract. \\\"ptgz -h\\\" for help.\" << std::endl;\n\t}\n}\n\n\/\/ Finds the number of files in the space to store.\n\/\/ Parameters: numFiles (int *) number of files.\n\/\/ \t\t\t cwd (const char *) current working directory.\nvoid findAll(int *numFiles, const char *cwd) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tfindAll(numFiles, filePath.c_str());\n\t\t\t\t} else {\n\t\t\t\t\t*numFiles += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Gets the paths for all files in the space to store.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t cwd (const char *) current working directory.\n\/\/ \t\t\t rootPath (std::string) path from the root of the directory to be stored.\nvoid getPaths(std::vector<std::string> *filePaths, const char *cwd, std::string rootPath) {\n\tDIR *dir;\n\tstruct dirent *ent;\n\n\t\/\/ Check if cwd is a directory\n\tif ((dir = opendir(cwd)) != NULL) {\n\t\t\/\/ Get all file paths within directory.\n\t\twhile ((ent = readdir (dir)) != NULL) {\n\t\t\tstd::string fileBuff = std::string(ent -> d_name);\n\t\t\tif (fileBuff != \".\" && fileBuff != \"..\") {\n\t\t\t\tDIR *dir2;\n\t\t\t\tstd::string filePath = std::string(cwd) + \"\/\" + fileBuff;\n\t\t\t\t\/\/ Check if file path is a directory.\n\t\t\t\tif ((dir2 = opendir(filePath.c_str())) != NULL) {\n\t\t\t\t\tclosedir(dir2);\n\t\t\t\t\tgetPaths(filePaths, filePath.c_str(), rootPath + fileBuff + \"\/\");\n\t\t\t\t} else {\n\t\t\t\t\tfilePaths->push_back(rootPath + fileBuff);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tclosedir(dir);\n\t}\n}\n\n\/\/ Divides files into blocks.\n\/\/ Compresses each block into a single file.\n\/\/ Combines all compressed blocks into a single file.\n\/\/ Removes temporary blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) user given name for storage file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\nvoid compression(std::vector<std::string> *filePaths, std::string name, bool verbose) {\n\tstd::random_shuffle(filePaths->begin(), filePaths->end());\n\tunsigned long long int filePathSize = filePaths->size();\n\tunsigned long long int blockSize = (filePathSize \/ (omp_get_max_threads() * 10)) + 1;\n\tstd::vector<std::string> *tarNames = new std::vector<std::string>(filePathSize \/ blockSize + 1);\n\t\n\t\/\/ Gzips the blocks of files into a single compressed file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < omp_get_max_threads() * 10; ++i) {\n\t\tunsigned long long int start = blockSize * i;\n\t\tif (start < filePathSize) {\n\t\t\t\/\/ Store the name of each file for a block owned by each thread.\n\t\t\t\/\/ Each thread will use the file to tar and gzip compress their block.\n\t\t\tstd::ofstream tmp;\n\t\t\ttmp.open(std::to_string(i) + \".\" + name + \".ptgz.tmp\", std::ios_base::app);\n\t\t\tstd::string gzCommand = \"GZIP=-1 tar -cz -T \" + std::to_string(i) + \".\" + name + \".ptgz.tmp -f \" + std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t\tfor (unsigned long long int j = start; j < std::min(start + blockSize, filePathSize); ++j) {\n\t\t\t\ttmp << filePaths->at(j) + \"\\n\";\n\t\t\t}\n\t\n\t\t\tif (verbose) {\n\t\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t\t}\n\n\t\t\ttmp.close();\n\t\t\tsystem(gzCommand.c_str());\n\t\t\ttarNames->at(i) = std::to_string(i) + \".\" + name + \".tar.gz\";\n\t\t}\n\t}\n\n\t\/\/ Combines gzipped blocks together into a single tarball.\n\t\/\/ Write tarball names into an idx file for extraction.\n\tstd::ofstream idx, tmp;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::app);\n\tstd::string tarCommand = \"tar -c -T \" + name + \".ptgz.idx -f \" + name + \".ptgz.tar\";\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tidx << tarNames->at(i) + \"\\n\";\n\t}\n\tidx << name + \".ptgz.idx\" + \"\\n\";\n\tidx.close();\n\t\n\tif (verbose) {\n\t\tstd::cout << tarCommand + \"\\n\";\n\t}\n\t\n\tsystem(tarCommand.c_str());\n\n\t\/\/ Removes all temporary blocks and idx file.\n\t#pragma omp parallel for schedule(static)\n\tfor (unsigned long long int i = 0; i < tarNames->size(); ++i) {\n\t\tstd::string rmCommand = tarNames->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(rmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t}\n\t\t\n\n\t\trmCommand = std::to_string(i) + \".\" + name + \".ptgz.tmp\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + rmCommand + \")\\n\";\n\t\t}\n\t\t\/\/ if (remove(rmCommand.c_str())) {\n\t\t\t\/\/ std::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t\t\/\/ }\n\t}\n\n\tstd::string rmCommand;\n\tif (verbose) {\n\t\tstd::cout << \"remove(\" + name + \".ptgz.idx)\\n\";\n\t}\n\trmCommand = name + \".ptgz.idx\";\n\tif (remove(rmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + rmCommand + \" could not be removed.\\n\";\n\t}\n\n\ttarNames->clear();\n\tdelete(tarNames);\n}\n\n\/\/ Unpacks the archive.\n\/\/ Reads in all the files from the index file.\n\/\/ Unpacks each file.\n\/\/ Deletes all temporary file blocks and header files.\n\/\/ Parameters: filePaths (std::vector<std::string> *) holder for all file paths.\n\/\/ \t\t\t name (std::string) name of ptgz archive file.\n\/\/ \t\t\t verbose (bool) user option for verbose output.\n\/\/ \t\t\t keep (bool) user option for keeping ptgz archive.\nvoid extraction(std::vector<std::string> *filePaths, std::string name, bool verbose, bool keep) {\n\t\/\/ Unpack the 1st layer tarball\n\tstd::string exCommand = \"tar xf \" + name;\n\tif (verbose) {\n\t\tstd::cout << exCommand + \"\\n\";\n\t}\n\tsystem(exCommand.c_str());\n\n\t\/\/ Get the name from the name of the 1st layer tarball\n\tfor (int i = 0; i < 9; ++i) {\n\t\tname.pop_back();\n\t}\n\n\t\/\/ Read in all tar.gz files form the ptgz.idx file\n\t\/\/ Delete the ptgz.idx file\n\tstd::ifstream idx;\n\tstd::string line;\n\tidx.open(name + \".ptgz.idx\", std::ios_base::in);\n\twhile (std::getline(idx, line)) {\n\t\tfilePaths->push_back(line);\n\t}\n\tidx.close();\n\tstd::string idxRmCommand = filePaths->back();\n\tif (remove(idxRmCommand.c_str())) {\n\t\tstd::cout << \"ERROR: \" + idxRmCommand + \" could not be removed.\\n\";\t\n\t}\n\tfilePaths->pop_back();\n\n\t\/\/ Unpack each tar.gz file\n\t#pragma omp parallel for schedule(dynamic)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzCommand = \"tar xzf \" + filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << gzCommand + \"\\n\";\n\t\t}\n\t\tsystem(gzCommand.c_str());\n\t\tstd::cout << std::errno(errno) << std::endl;\n\t}\n\n\t\/\/ Delete each tar.gz file\n\t#pragma omp parallel for schedule(static)\n\tfor (int i = 0; i < filePaths->size(); ++i) {\n\t\tstd::string gzRmCommand = filePaths->at(i);\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + gzRmCommand + \")\\n\";\n\t\t}\n\t\t\/\/ if (remove(gzRmCommand.c_str())) {\n\t\t\t\/\/ std::cout << \"ERROR: \" + gzRmCommand + \" could not be removed.\\n\";\n\t\t\/\/ }\n\t}\n\t\n\t\/\/ Decided whether or not to keep the ptgz.tar archive\n\tif (!keep) {\n\t\tstd::string tarRmCommand = name + \".ptgz.tar\";\n\t\tif (verbose) {\n\t\t\tstd::cout << \"remove(\" + tarRmCommand + \")\\n\";\n\t\t}\n\t\tif (remove(tarRmCommand.c_str())) {\n\t\t\tstd::cout << \"ERROR: \" + tarRmCommand + \" could not be removed.\\n\";\n\t\t}\n\t}\n}\n\nchar cwd [PATH_MAX];\n\n\/\/ Checks to see if the user asks for help.\n\/\/ Gathers the user provided settings for ptgz.\n\/\/ Finds the number of files that need to be stored.\n\/\/ Gathers the file paths of all files to be stored.\n\/\/ Either compresses the files or extracts the ptgz.tar archive.\nint main(int argc, char *argv[]) {\n\tSettings *instance = new Settings;\n\tint *numFiles = new int(0);\n\tstd::vector<std::string> *filePaths = new std::vector<std::string>();\n\t\n\thelpCheck(argc, argv);\n\tgetSettings(argc, argv, instance);\n\tgetcwd(cwd, PATH_MAX);\n\n\tif ((*instance).compress) {\n\t\tfindAll(numFiles, cwd);\n\t\tgetPaths(filePaths, cwd, \"\");\n\t\tcompression(filePaths, (*instance).name, (*instance).verbose);\n\t} else {\n\t\textraction(filePaths, (*instance).name, (*instance).verbose, (*instance).keep);\n\t}\n\n\tdelete(instance);\n\tdelete(numFiles);\n\tfilePaths->clear();\n\tdelete(filePaths);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include <assert.h>\n#include <unistd.h>\n#include <libj\/string_buffer.h>\n\n#include \"libnode\/path.h\"\n\nnamespace libj {\nnamespace node {\nnamespace path {\n\nString::CPtr normalize(String::CPtr path) {\n static const String::CPtr empty = String::create();\n static const String::CPtr current = String::create(\".\");\n static const String::CPtr parent = String::create(\"..\");\n\n if (!path) return empty;\n\n Boolean absolute = false;\n Boolean endsWithSep = false;\n JsArray::Ptr dirs = JsArray::create();\n Size len = path->length();\n for (Size i = 0; i < len;) {\n Size idx = path->indexOf('\/', i);\n if (idx == 0) {\n absolute = true;\n } else if (idx != i) {\n String::CPtr dir;\n if (idx == NO_POS) {\n dir = path->substring(i);\n } else {\n dir = path->substring(i, idx);\n }\n if (dir->compareTo(parent) == 0) {\n Size numDirs = dirs->size();\n if (numDirs > 0 &&\n dirs->get(numDirs - 1).compareTo(parent) != 0) {\n dirs->remove(numDirs - 1);\n } else {\n dirs->add(dir);\n }\n } else if (dir->compareTo(current) != 0) {\n dirs->add(dir);\n }\n }\n\n if (idx == NO_POS) {\n endsWithSep = false;\n i = len;\n } else {\n endsWithSep = true;\n i = idx + 1;\n }\n\n }\n\n StringBuffer::Ptr normal = StringBuffer::create();\n if (absolute)\n normal->append(sep());\n Size numDirs = dirs->size();\n for (Size i = 0; i < numDirs; i++) {\n if (i) normal->append(sep());\n normal->append(dirs->get(i));\n }\n if (numDirs > 0 && endsWithSep)\n normal->append(sep());\n if (normal->length() == 0) {\n return current;\n } else {\n return normal->toString();\n }\n}\n\nString::CPtr join(JsArray::CPtr paths) {\n static const String::CPtr current = String::create(\".\");\n\n if (!paths) return current;\n\n StringBuffer::Ptr joined = StringBuffer::create();\n Size len = paths->length();\n Boolean first = true;\n for (Size i = 0; i < len; i++) {\n String::CPtr path = toCPtr<String>(paths->get(i));\n if (path) {\n if (first) {\n first = false;\n } else {\n joined->append(sep());\n }\n joined->append(path);\n }\n }\n return normalize(joined->toString());\n}\n\n\nstatic String::CPtr getCwd() {\n const Size kMax = 8192;\n char dir[kMax];\n getcwd(dir, kMax);\n return String::create(dir);\n}\n\nString::CPtr resolve(JsArray::CPtr paths) {\n if (!paths) return getCwd();\n\n StringBuffer::Ptr resolved = StringBuffer::create();\n resolved->append(getCwd());\n Size len = paths->length();\n for (Size i = 0; i < len; i++) {\n String::CPtr path = toCPtr<String>(paths->get(i));\n if (path) {\n if (path->startsWith(sep())) {\n resolved = StringBuffer::create();\n } else {\n resolved->append(sep());\n }\n resolved->append(path);\n }\n }\n return normalize(resolved->toString());\n}\n\nString::CPtr relative(String::CPtr from, String::CPtr to) {\n \/\/ TODO(plenluno): implement\n return String::create();\n}\n\nString::CPtr dirname(String::CPtr path) {\n static const String::CPtr current = String::create(\".\");\n\n if (!path) return current;\n\n String::CPtr base = basename(path);\n Size baseLen = base->length();\n Size pathLen = path->length();\n if (baseLen == pathLen) {\n return current;\n } else {\n Size sepPos = pathLen - baseLen - 1;\n assert(path->charAt(sepPos) == '\/');\n if (sepPos) {\n return path->substring(0, sepPos);\n } else { \/\/ path[0] is '\/'\n return sep();\n }\n }\n}\n\nString::CPtr basename(String::CPtr path) {\n static const String::CPtr empty = String::create();\n static const String::CPtr doubleSep = sep()->concat(sep());\n\n if (!path) return empty;\n if (path->compareTo(sep()) == 0) return empty;\n if (path->compareTo(doubleSep) == 0) return empty;\n\n Size lastIndex;\n Size len = path->length();\n if (path->endsWith(sep())) {\n Size from = len - sep()->length() - 1;\n lastIndex = path->lastIndexOf(sep(), from);\n } else {\n lastIndex = path->lastIndexOf(sep());\n }\n String::CPtr base;\n if (lastIndex == NO_POS) {\n base = path;\n } else {\n base = path->substring(lastIndex + 1);\n }\n return base;\n}\n\nString::CPtr extname(String::CPtr path) {\n static const String::CPtr empty = String::create();\n\n if (!path) return empty;\n\n String::CPtr base = basename(path);\n if (base->endsWith(sep())) return empty;\n\n Size lastIndex = NO_POS;\n if (base->length() > 1)\n lastIndex = base->lastIndexOf('.');\n String::CPtr ext;\n if (lastIndex == NO_POS) {\n ext = empty;\n } else {\n ext = base->substring(lastIndex);\n }\n return ext;\n}\n\nString::CPtr sep() {\n static const String::CPtr separator = String::create(\"\/\");\n return separator;\n}\n\n} \/\/ namespace path\n} \/\/ namespace node\n} \/\/ namespace libj\n<commit_msg>modify for cpplint<commit_after>\/\/ Copyright (c) 2012 Plenluno All rights reserved.\n\n#include <assert.h>\n#include <unistd.h>\n#include <libj\/string_buffer.h>\n\n#include \"libnode\/path.h\"\n\nnamespace libj {\nnamespace node {\nnamespace path {\n\nString::CPtr normalize(String::CPtr path) {\n static const String::CPtr empty = String::create();\n static const String::CPtr current = String::create(\".\");\n static const String::CPtr parent = String::create(\"..\");\n\n if (!path) return empty;\n\n Boolean absolute = false;\n Boolean endsWithSep = false;\n JsArray::Ptr dirs = JsArray::create();\n Size len = path->length();\n for (Size i = 0; i < len;) {\n Size idx = path->indexOf('\/', i);\n if (idx == 0) {\n absolute = true;\n } else if (idx != i) {\n String::CPtr dir;\n if (idx == NO_POS) {\n dir = path->substring(i);\n } else {\n dir = path->substring(i, idx);\n }\n if (dir->compareTo(parent) == 0) {\n Size numDirs = dirs->size();\n if (numDirs > 0 &&\n dirs->get(numDirs - 1).compareTo(parent) != 0) {\n dirs->remove(numDirs - 1);\n } else {\n dirs->add(dir);\n }\n } else if (dir->compareTo(current) != 0) {\n dirs->add(dir);\n }\n }\n\n if (idx == NO_POS) {\n endsWithSep = false;\n i = len;\n } else {\n endsWithSep = true;\n i = idx + 1;\n }\n }\n\n StringBuffer::Ptr normal = StringBuffer::create();\n if (absolute)\n normal->append(sep());\n Size numDirs = dirs->size();\n for (Size i = 0; i < numDirs; i++) {\n if (i) normal->append(sep());\n normal->append(dirs->get(i));\n }\n if (numDirs > 0 && endsWithSep)\n normal->append(sep());\n if (normal->length() == 0) {\n return current;\n } else {\n return normal->toString();\n }\n}\n\nString::CPtr join(JsArray::CPtr paths) {\n static const String::CPtr current = String::create(\".\");\n\n if (!paths) return current;\n\n StringBuffer::Ptr joined = StringBuffer::create();\n Size len = paths->length();\n Boolean first = true;\n for (Size i = 0; i < len; i++) {\n String::CPtr path = toCPtr<String>(paths->get(i));\n if (path) {\n if (first) {\n first = false;\n } else {\n joined->append(sep());\n }\n joined->append(path);\n }\n }\n return normalize(joined->toString());\n}\n\n\nstatic String::CPtr getCwd() {\n const Size kMax = 8192;\n char dir[kMax];\n getcwd(dir, kMax);\n return String::create(dir);\n}\n\nString::CPtr resolve(JsArray::CPtr paths) {\n if (!paths) return getCwd();\n\n StringBuffer::Ptr resolved = StringBuffer::create();\n resolved->append(getCwd());\n Size len = paths->length();\n for (Size i = 0; i < len; i++) {\n String::CPtr path = toCPtr<String>(paths->get(i));\n if (path) {\n if (path->startsWith(sep())) {\n resolved = StringBuffer::create();\n } else {\n resolved->append(sep());\n }\n resolved->append(path);\n }\n }\n return normalize(resolved->toString());\n}\n\nString::CPtr relative(String::CPtr from, String::CPtr to) {\n \/\/ TODO(plenluno): implement\n return String::create();\n}\n\nString::CPtr dirname(String::CPtr path) {\n static const String::CPtr current = String::create(\".\");\n\n if (!path) return current;\n\n String::CPtr base = basename(path);\n Size baseLen = base->length();\n Size pathLen = path->length();\n if (baseLen == pathLen) {\n return current;\n } else {\n Size sepPos = pathLen - baseLen - 1;\n assert(path->charAt(sepPos) == '\/');\n if (sepPos) {\n return path->substring(0, sepPos);\n } else { \/\/ path[0] is '\/'\n return sep();\n }\n }\n}\n\nString::CPtr basename(String::CPtr path) {\n static const String::CPtr empty = String::create();\n static const String::CPtr doubleSep = sep()->concat(sep());\n\n if (!path) return empty;\n if (path->compareTo(sep()) == 0) return empty;\n if (path->compareTo(doubleSep) == 0) return empty;\n\n Size lastIndex;\n Size len = path->length();\n if (path->endsWith(sep())) {\n Size from = len - sep()->length() - 1;\n lastIndex = path->lastIndexOf(sep(), from);\n } else {\n lastIndex = path->lastIndexOf(sep());\n }\n String::CPtr base;\n if (lastIndex == NO_POS) {\n base = path;\n } else {\n base = path->substring(lastIndex + 1);\n }\n return base;\n}\n\nString::CPtr extname(String::CPtr path) {\n static const String::CPtr empty = String::create();\n\n if (!path) return empty;\n\n String::CPtr base = basename(path);\n if (base->endsWith(sep())) return empty;\n\n Size lastIndex = NO_POS;\n if (base->length() > 1)\n lastIndex = base->lastIndexOf('.');\n String::CPtr ext;\n if (lastIndex == NO_POS) {\n ext = empty;\n } else {\n ext = base->substring(lastIndex);\n }\n return ext;\n}\n\nString::CPtr sep() {\n static const String::CPtr separator = String::create(\"\/\");\n return separator;\n}\n\n} \/\/ namespace path\n} \/\/ namespace node\n} \/\/ namespace libj\n<|endoftext|>"} {"text":"<commit_before>\n#include<iostream>\n#include \"petsc.h\"\n#include \"geom.hpp\"\n\nint main(int argc,char **args)\n{\n PetscErrorCode ierr;\n int nid,np;\n int N,numThetan,nTau;\n polygon_t rectangle;\n double tol = 1e-2;\n double omega[4] = {-2, 2, -2, 2};\n double sparsity = 0.1;\n int m[2];\n PetscInt Istart,Iend;\n linestring_t line;\n std::vector<point_t> intersect_pts;\n detector_geometry det;\n Mat A;\n\n \/\/ Initialize PETSc and MPI\n ierr = PetscInitialize(&argc,&args,(char*)0,NULL); CHKERRQ(ierr);\n \/* Get core's id *\/\n ierr = MPI_Comm_rank(PETSC_COMM_WORLD,&nid); CHKERRQ(ierr);\n \/* Get number of processors *\/\n ierr = MPI_Comm_size(PETSC_COMM_WORLD,&np); CHKERRQ(ierr);\n\n N = 30;\n numThetan = 60;\n nTau = (int)ceil(sqrt(2*N*N));\n\n m[0] = N; m[1] = N;\n\n ierr = MatCreate(PETSC_COMM_WORLD,&A); CHKERRQ(ierr);\n ierr = MatSetType(A,MATMPIAIJ); CHKERRQ(ierr);\n ierr = MatSetSizes(A,PETSC_DECIDE,PETSC_DECIDE,nTau*numThetan,m[0]*m[1]); CHKERRQ(ierr);\n ierr = MatSetFromOptions(A); CHKERRQ(ierr);\n ierr = MatMPIAIJSetPreallocation(A,sparsity*nTau*numThetan,NULL,sparsity*m[0]*m[1],NULL); CHKERRQ(ierr);\n det = detector_geometry(omega,tol,numThetan,m,nTau);\n\n ierr = MatGetOwnershipRange(A,&Istart,&Iend); CHKERRQ(ierr);\n\n for (int i=Istart;i<Iend;i++){\n \/\/i' = (j-1)*numThetan + i where j=tau and i=theta\n int tau_idx = i\/numThetan;\n int theta_idx = i%numThetan;\n setMatrixElements(tau_idx, theta_idx, det, A);\n \/\/ intersectionSet(tau_idx, theta_idx, det);\n }\n MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY);\n MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY);\n\n ierr = PetscFinalize(); CHKERRQ(ierr);\n return 0;\n}\n<commit_msg>Add TAO solving of synthetic data. Code needs cleaning and restructuring.<commit_after>\n#include<iostream>\n#include \"petsctao.h\"\n#include \"geom.hpp\"\n#include <fstream>\nvoid read_synthetic_data(Mat *A,Vec *sample,Vec *answer,int m[2],int *nTau,int numThetan);\nPetscErrorCode FormFunctionGradient(Tao tao,Vec X,PetscReal *f, Vec G,void *ptr);\nMat A;\nVec data;\nint main(int argc,char **args)\n{\n int nid,np;\n int N,numThetan,nTau;\n polygon_t rectangle;\n double tol = 1e-2;\n double omega[4] = {-2, 2, -2, 2};\n double sparsity = 0.05;\n int m[2];\n PetscInt Istart,Iend;\n linestring_t line;\n std::vector<point_t> intersect_pts;\n detector_geometry det;\n int synthetic_data = 1;\n Vec sample, rec_sample;\n Tao tao;\n\n \/\/ Initialize PETSc and MPI\n PetscInitialize(&argc,&args,(char*)0,NULL);\n \/* Get core's id *\/\n MPI_Comm_rank(PETSC_COMM_WORLD,&nid);\n \/* Get number of processors *\/\n MPI_Comm_size(PETSC_COMM_WORLD,&np);\n\n N = 300;\n numThetan = 160;\n nTau = (int)ceil(sqrt(2*N*N));\n m[0] = N; m[1] = N;\n\n if (synthetic_data) {\n numThetan = 130;\n read_synthetic_data(&A,&sample,&data,m,&nTau,numThetan);\n } else {\n MatCreate(PETSC_COMM_WORLD,&A);\n MatSetType(A,MATMPIAIJ);\n MatSetSizes(A,PETSC_DECIDE,PETSC_DECIDE,nTau*numThetan,m[0]*m[1]);\n MatSetFromOptions(A);\n MatMPIAIJSetPreallocation(A,sparsity*nTau*numThetan,NULL,sparsity*m[0]*m[1],NULL);\n }\n det = detector_geometry(omega,tol,numThetan,m,nTau);\n\n MatGetOwnershipRange(A,&Istart,&Iend);\n\n \/\/Set up matrix\n for (int i=Istart;i<Iend;i++){\n \/\/i' = (j-1)*numThetan + i where j=tau and i=theta\n int tau_idx = i\/numThetan;\n int theta_idx = i%numThetan;\n setMatrixElements(tau_idx, theta_idx, det, A);\n }\n MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY);\n MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY);\n\n MatMult(A,sample,data);\n VecDuplicate(sample,&rec_sample);\n\n \/\/Set TAO things\n TaoCreate(PETSC_COMM_SELF,&tao);\n TaoSetObjectiveAndGradientRoutine(tao,FormFunctionGradient,NULL);\n VecSet(rec_sample, 0.0);\n TaoSetInitialVector(tao,rec_sample);\n\n \/*\n * This allows one to set the solver at runtime; i.e.\n * .\/pirt -tao_type lmvm\n * or\n * .\/pirt -tau_type ntr\n * etc. Some require hessians which we have not yet coded\n *\/\n TaoSetFromOptions(tao);\n TaoSolve(tao);\n\n PetscReal norm;\n VecMin(rec_sample,NULL,&norm);\n std::cout << \"Min val \" << norm << std::endl;\n VecMax(rec_sample,NULL,&norm);\n std::cout << \"Max val \" << norm << std::endl;\n\n \/\/Uncomment below to print the full vector\n \/\/VecView(rec_sample,PETSC_VIEWER_STDOUT_SELF);\n\n\n \/\/calculate rec_sample = rec_sample + -1 * sample\n VecAXPY(rec_sample,-1.0,sample);\n VecNorm(rec_sample,NORM_2,&norm);\n std::cout << \"Diff norm: \" << norm << std::endl;\n MatNorm(A,NORM_FROBENIUS,&norm);\n if (nid==0) std::cout << \"Norm: \" << norm << \"\\n\";\n PetscFinalize();\n return 0;\n}\n\nPetscErrorCode FormFunctionGradient(Tao tao,Vec X,PetscReal *f, Vec G,void *ptr){\n Vec tmp;\n PetscReal norm;\n\n MatCreateVecs(A,NULL,&tmp);\n \/\/tmp = A * X\n MatMult(A,X,tmp);\n\n \/\/ tmp = tmp + -1.0 * data\n VecAXPY(tmp,-1.0,data);\n VecNorm(tmp,NORM_2,&norm);\n *f = 0.5*norm*norm;\n\n MatMultTranspose(A,tmp,G);\n\n VecDestroy(&tmp);\n PetscFunctionReturn(0);\n}\n\nvoid read_synthetic_data(Mat *A,Vec *sample,Vec *answer,int m[2],int *nTau, int numThetan){\n std::ifstream inFile;\n PetscScalar Aij;\n PetscInt i,j,iMax,jMax;\n inFile.open(\"sample.dat\");\n if (inFile.fail()){\n std::cout << \"Error in read file\\n\";\n exit(0);\n }\n iMax = -1; jMax = -1;\n\n while (!inFile.eof()){\n inFile >> i;\n inFile >> j;\n inFile >> Aij;\n\n if(i>iMax) iMax = i;\n if(j>jMax) jMax = j;\n }\n m[0] = iMax; m[1] = jMax;\n *nTau = (int)ceil(sqrt(2*m[0]*m[1]));\n\n MatCreate(PETSC_COMM_WORLD,A);\n MatSetType(*A,MATMPIAIJ);\n MatSetSizes(*A,PETSC_DECIDE,PETSC_DECIDE,(*nTau)*numThetan,iMax*jMax);\n MatSetFromOptions(*A);\n MatMPIAIJSetPreallocation(*A,iMax*2,NULL,iMax*2,NULL);\n\n MatCreateVecs(*A,sample,answer);\n \/\/Reset file to start\n inFile.clear();\n inFile.seekg(0);\n while (!inFile.eof()){\n inFile >> i;\n inFile >> j;\n inFile >> Aij;\n i = i-1; j = j-1;\n VecSetValue(*sample,i*iMax+j,Aij,INSERT_VALUES);\n if(i>iMax) iMax = i;\n if(j>jMax) jMax = j;\n }\n return;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * c7a\/data\/serializer.hpp\n *\n * Part of Project c7a.\n *\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_DATA_SERIALIZER_HEADER\n#define C7A_DATA_SERIALIZER_HEADER\n\n#include <string>\n#include <cstring>\n#include <utility>\n#include <cassert>\n\n\n\/\/TODO DELETE\n#include <iostream>\n\n\n\/\/TODO(ts) this copies data. That is bad and makes me sad.\n\nnamespace c7a {\nnamespace data {\n\n\/\/! internal representation of data elements\ntypedef std::string Blob;\n\n\/\/! \\namespace namespace to hide the implementations of serializers\nnamespace serializers {\n\ntemplate <class T>\nstruct Impl;\n\n\/\/! identity serializer from string to string\ntemplate <>\nstruct Impl<std::string>{\n static std::string Serialize(const std::string& x) {\n return x;\n }\n\n static std::string Deserialize(const std::string& x) {\n return x;\n }\n};\n\n\/\/! serializer for int\ntemplate <>\nstruct Impl<int>{\n static std::string Serialize(const int& x) {\n return std::to_string(x);\n }\n\n static int Deserialize(const std::string& x) {\n return std::stoi(x);\n }\n};\n\n\/\/! serializer for long\ntemplate <>\nstruct Impl<long>{\n static std::string Serialize(const long& x) {\n return std::to_string(x);\n }\n\n static long Deserialize(const std::string& x) {\n return std::stol(x);\n }\n};\n\n\/\/! serializer for long long\ntemplate <>\nstruct Impl<long long>{\n static std::string Serialize(const long long& x) {\n return std::to_string(x);\n }\n\n static long long Deserialize(const std::string& x) {\n return std::stoll(x);\n }\n};\n\n\/\/! serializer for unsigned\ntemplate <>\nstruct Impl<unsigned int>{\n static std::string Serialize(const unsigned int& x) {\n return std::to_string(x);\n }\n\n static unsigned int Deserialize(const std::string& x) {\n return std::stoul(x);\n \/\/TODO: WHY IS THIS WORKING???? I DONT UNDERSTAND\n }\n};\n\n\/\/! serializer for unsigned long\ntemplate <>\nstruct Impl<unsigned long>{\n static std::string Serialize(const unsigned long& x) {\n return std::to_string(x);\n }\n\n static unsigned long Deserialize(const std::string& x) {\n return std::stoul(x);\n }\n};\n\n\/\/! serializer for unsigned long long\ntemplate <>\nstruct Impl<unsigned long long>{\n static std::string Serialize(const unsigned long long& x) {\n return std::to_string(x);\n }\n\n static unsigned long long Deserialize(const std::string& x) {\n return std::stoull(x);\n }\n};\n\n\/\/! serializer for float\ntemplate <>\nstruct Impl<float>{\n static std::string Serialize(const float& x) {\n return std::to_string(x);\n }\n\n static float Deserialize(const std::string& x) {\n return std::stof(x);\n }\n};\n\n\/\/! serializer for double\ntemplate <>\nstruct Impl<double>{\n static std::string Serialize(const double& x) {\n return std::to_string(x);\n }\n\n static double Deserialize(const std::string& x) {\n return std::stod(x);\n }\n};\n\n\/\/! serializer for long double\ntemplate <>\nstruct Impl<long double>{\n static std::string Serialize(const long double& x) {\n return std::to_string(x);\n }\n\n static long double Deserialize(const std::string& x) {\n return std::stold(x);\n }\n};\n\n\/\/! serializer for (string, int) tuples\ntemplate <>\nstruct Impl<std::pair<std::string, int> >{\n static std::string Serialize(const std::pair<std::string, int>& x) {\n std::size_t len = sizeof(int) + x.first.size();\n char result[len];\n std::memcpy(result, &(x.second), sizeof(int));\n std::memcpy(result + sizeof(int), x.first.c_str(), x.first.size());\n return std::string(result, len);\n }\n \/\/TODO(tb): What exactly happens with c_string. What is thiiiiiis?\n static std::pair<std::string, int> Deserialize(const std::string& x) {\n int i;\n std::size_t str_len = x.size() - sizeof(int);\n std::memcpy(&i, x.c_str(), sizeof(int));\n std::string s(x, sizeof(int), str_len);\n return std::pair<std::string, int>(s, i);\n }\n};\n\n\/\/ TODO(cn): do we have clusternodes working on 32 and 64bit systems at the same time??\n\/\/! serializer for pairs\ntemplate <typename T1, typename T2>\nstruct Impl<std::pair<T1, T2>> {\n static std::string Serialize(const std::pair<T1, T2>& x) {\n if( x.first.size() > UINT_MAX ) {\n \/\/TODO ERROR\n }\n unsigned int len_t1 = static_cast<unsigned int>(x.first.size());\n std::string t1 = serializers::Impl<T1>::Serialize(x.first);\n std::string t2 = serializers::Impl<T2>::Serialize(x.second);\n\n std::size_t len = t1.size() + t2.size() + sizeof(unsigned int);\n char result[len];\n std::memcpy(result, &len_t1, sizeof(unsigned int));\n std::memcpy(result + sizeof(unsigned int), t1.c_str(), t1.size());\n std::memcpy(result + sizeof(unsigned int) + x.first.size(), t2.c_str(), t2.size());\n return std::string(result, len);\n }\n static std::pair<T1, T2> Deserialize(const std::string& x) {\n unsigned int len_t1;\n std::memcpy(&len_t1, x.c_str(), sizeof(unsigned int));\n std::size_t len_t2 = x.size() - sizeof(unsigned int) - len_t1;\n\n std::string t1_str = x.substr(sizeof(unsigned int), len_t1);\n std::string t2_str = x.substr(sizeof(unsigned int) + len_t1, len_t2);\n\n T1 t1 = serializers::Impl<T1>::Deserialize(t1_str);\n T1 t2 = serializers::Impl<T2>::Deserialize(t2_str);\n\n return std::pair<T1, T2>(t1, t2);\n }\n};\n\n\/\/! binary serializer for any integral type, usable as template.\ntemplate <typename Type>\nstruct GenericImpl {\n static std::string Serialize(const Type& v) {\n return std::string(reinterpret_cast<const char*>(&v), sizeof(v));\n }\n\n static Type Deserialize(const std::string& s) {\n assert(s.size() == sizeof(Type));\n return Type(*reinterpret_cast<const Type*>(s.data()));\n }\n};\n\ntemplate <>\nstruct Impl<std::pair<int, int> >: public GenericImpl<std::pair<int, int> >\n{ };\n\n} \/\/ namespace serializers\n\n\/\/! Serialize the type to std::string\ntemplate <class T>\ninline std::string Serialize(const T& x) {\n return serializers::Impl<T>::Serialize(x);\n}\n\n\/\/! Deserialize the std::string to the given type\ntemplate <class T>\ninline T Deserialize(const std::string& x) {\n return serializers::Impl<T>::Deserialize(x);\n}\n\n} \/\/ namespace data\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_DATA_SERIALIZER_HEADER\n\n\/******************************************************************************\/\n<commit_msg>remove UINT_MAX to fix error<commit_after>\/*******************************************************************************\n * c7a\/data\/serializer.hpp\n *\n * Part of Project c7a.\n *\n *\n * This file has no license. Only Chuck Norris can compile it.\n ******************************************************************************\/\n\n#pragma once\n#ifndef C7A_DATA_SERIALIZER_HEADER\n#define C7A_DATA_SERIALIZER_HEADER\n\n#include <string>\n#include <cstring>\n#include <utility>\n#include <cassert>\n\n\n\/\/TODO DELETE\n#include <iostream>\n\n\n\/\/TODO(ts) this copies data. That is bad and makes me sad.\n\nnamespace c7a {\nnamespace data {\n\n\/\/! internal representation of data elements\ntypedef std::string Blob;\n\n\/\/! \\namespace namespace to hide the implementations of serializers\nnamespace serializers {\n\ntemplate <class T>\nstruct Impl;\n\n\/\/! identity serializer from string to string\ntemplate <>\nstruct Impl<std::string>{\n static std::string Serialize(const std::string& x) {\n return x;\n }\n\n static std::string Deserialize(const std::string& x) {\n return x;\n }\n};\n\n\/\/! serializer for int\ntemplate <>\nstruct Impl<int>{\n static std::string Serialize(const int& x) {\n return std::to_string(x);\n }\n\n static int Deserialize(const std::string& x) {\n return std::stoi(x);\n }\n};\n\n\/\/! serializer for long\ntemplate <>\nstruct Impl<long>{\n static std::string Serialize(const long& x) {\n return std::to_string(x);\n }\n\n static long Deserialize(const std::string& x) {\n return std::stol(x);\n }\n};\n\n\/\/! serializer for long long\ntemplate <>\nstruct Impl<long long>{\n static std::string Serialize(const long long& x) {\n return std::to_string(x);\n }\n\n static long long Deserialize(const std::string& x) {\n return std::stoll(x);\n }\n};\n\n\/\/! serializer for unsigned\ntemplate <>\nstruct Impl<unsigned int>{\n static std::string Serialize(const unsigned int& x) {\n return std::to_string(x);\n }\n\n static unsigned int Deserialize(const std::string& x) {\n return std::stoul(x);\n \/\/TODO: WHY IS THIS WORKING???? I DONT UNDERSTAND\n }\n};\n\n\/\/! serializer for unsigned long\ntemplate <>\nstruct Impl<unsigned long>{\n static std::string Serialize(const unsigned long& x) {\n return std::to_string(x);\n }\n\n static unsigned long Deserialize(const std::string& x) {\n return std::stoul(x);\n }\n};\n\n\/\/! serializer for unsigned long long\ntemplate <>\nstruct Impl<unsigned long long>{\n static std::string Serialize(const unsigned long long& x) {\n return std::to_string(x);\n }\n\n static unsigned long long Deserialize(const std::string& x) {\n return std::stoull(x);\n }\n};\n\n\/\/! serializer for float\ntemplate <>\nstruct Impl<float>{\n static std::string Serialize(const float& x) {\n return std::to_string(x);\n }\n\n static float Deserialize(const std::string& x) {\n return std::stof(x);\n }\n};\n\n\/\/! serializer for double\ntemplate <>\nstruct Impl<double>{\n static std::string Serialize(const double& x) {\n return std::to_string(x);\n }\n\n static double Deserialize(const std::string& x) {\n return std::stod(x);\n }\n};\n\n\/\/! serializer for long double\ntemplate <>\nstruct Impl<long double>{\n static std::string Serialize(const long double& x) {\n return std::to_string(x);\n }\n\n static long double Deserialize(const std::string& x) {\n return std::stold(x);\n }\n};\n\n\/\/! serializer for (string, int) tuples\ntemplate <>\nstruct Impl<std::pair<std::string, int> >{\n static std::string Serialize(const std::pair<std::string, int>& x) {\n std::size_t len = sizeof(int) + x.first.size();\n char result[len];\n std::memcpy(result, &(x.second), sizeof(int));\n std::memcpy(result + sizeof(int), x.first.c_str(), x.first.size());\n return std::string(result, len);\n }\n \/\/TODO(tb): What exactly happens with c_string. What is thiiiiiis?\n static std::pair<std::string, int> Deserialize(const std::string& x) {\n int i;\n std::size_t str_len = x.size() - sizeof(int);\n std::memcpy(&i, x.c_str(), sizeof(int));\n std::string s(x, sizeof(int), str_len);\n return std::pair<std::string, int>(s, i);\n }\n};\n\n\/\/ TODO(cn): do we have clusternodes working on 32 and 64bit systems at the same time??\n\/\/! serializer for pairs\ntemplate <typename T1, typename T2>\nstruct Impl<std::pair<T1, T2>> {\n static std::string Serialize(const std::pair<T1, T2>& x) {\n \/\/ UINT_MAX not working on Jenkins o.o\n \/\/ if( x.first.size() > UINT_MAX ) {\n \/\/ \/\/TODO ERROR\n \/\/ }\n unsigned int len_t1 = static_cast<unsigned int>(x.first.size());\n std::string t1 = serializers::Impl<T1>::Serialize(x.first);\n std::string t2 = serializers::Impl<T2>::Serialize(x.second);\n\n std::size_t len = t1.size() + t2.size() + sizeof(unsigned int);\n char result[len];\n std::memcpy(result, &len_t1, sizeof(unsigned int));\n std::memcpy(result + sizeof(unsigned int), t1.c_str(), t1.size());\n std::memcpy(result + sizeof(unsigned int) + x.first.size(), t2.c_str(), t2.size());\n return std::string(result, len);\n }\n static std::pair<T1, T2> Deserialize(const std::string& x) {\n unsigned int len_t1;\n std::memcpy(&len_t1, x.c_str(), sizeof(unsigned int));\n std::size_t len_t2 = x.size() - sizeof(unsigned int) - len_t1;\n\n std::string t1_str = x.substr(sizeof(unsigned int), len_t1);\n std::string t2_str = x.substr(sizeof(unsigned int) + len_t1, len_t2);\n\n T1 t1 = serializers::Impl<T1>::Deserialize(t1_str);\n T1 t2 = serializers::Impl<T2>::Deserialize(t2_str);\n\n return std::pair<T1, T2>(t1, t2);\n }\n};\n\n\/\/! binary serializer for any integral type, usable as template.\ntemplate <typename Type>\nstruct GenericImpl {\n static std::string Serialize(const Type& v) {\n return std::string(reinterpret_cast<const char*>(&v), sizeof(v));\n }\n\n static Type Deserialize(const std::string& s) {\n assert(s.size() == sizeof(Type));\n return Type(*reinterpret_cast<const Type*>(s.data()));\n }\n};\n\ntemplate <>\nstruct Impl<std::pair<int, int> >: public GenericImpl<std::pair<int, int> >\n{ };\n\n} \/\/ namespace serializers\n\n\/\/! Serialize the type to std::string\ntemplate <class T>\ninline std::string Serialize(const T& x) {\n return serializers::Impl<T>::Serialize(x);\n}\n\n\/\/! Deserialize the std::string to the given type\ntemplate <class T>\ninline T Deserialize(const std::string& x) {\n return serializers::Impl<T>::Deserialize(x);\n}\n\n} \/\/ namespace data\n} \/\/ namespace c7a\n\n#endif \/\/ !C7A_DATA_SERIALIZER_HEADER\n\n\/******************************************************************************\/\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* collision_object_2d_sw.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2018 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"collision_object_2d_sw.h\"\n#include \"space_2d_sw.h\"\n\nvoid CollisionObject2DSW::add_shape(Shape2DSW *p_shape, const Transform2D &p_transform) {\n\n\tShape s;\n\ts.shape = p_shape;\n\ts.xform = p_transform;\n\ts.xform_inv = s.xform.affine_inverse();\n\ts.bpid = 0; \/\/needs update\n\ts.disabled = false;\n\ts.one_way_collision = false;\n\tshapes.push_back(s);\n\tp_shape->add_owner(this);\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::set_shape(int p_index, Shape2DSW *p_shape) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tshapes[p_index].shape->remove_owner(this);\n\tshapes[p_index].shape = p_shape;\n\n\tp_shape->add_owner(this);\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::set_shape_metadata(int p_index, const Variant &p_metadata) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tshapes[p_index].metadata = p_metadata;\n}\n\nvoid CollisionObject2DSW::set_shape_transform(int p_index, const Transform2D &p_transform) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\n\tshapes[p_index].xform = p_transform;\n\tshapes[p_index].xform_inv = p_transform.affine_inverse();\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::remove_shape(Shape2DSW *p_shape) {\n\n\t\/\/remove a shape, all the times it appears\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tif (shapes[i].shape == p_shape) {\n\t\t\tremove_shape(i);\n\t\t\ti--;\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::remove_shape(int p_index) {\n\n\t\/\/remove anything from shape to be erased to end, so subindices don't change\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tfor (int i = p_index; i < shapes.size(); i++) {\n\n\t\tif (shapes[i].bpid == 0)\n\t\t\tcontinue;\n\t\t\/\/should never get here with a null owner\n\t\tspace->get_broadphase()->remove(shapes[i].bpid);\n\t\tshapes[i].bpid = 0;\n\t}\n\tshapes[p_index].shape->remove_owner(this);\n\tshapes.remove(p_index);\n\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::_set_static(bool p_static) {\n\tif (_static == p_static)\n\t\treturn;\n\t_static = p_static;\n\n\tif (!space)\n\t\treturn;\n\tfor (int i = 0; i < get_shape_count(); i++) {\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid > 0) {\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::_unregister_shapes() {\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid > 0) {\n\t\t\tspace->get_broadphase()->remove(s.bpid);\n\t\t\ts.bpid = 0;\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::_update_shapes() {\n\n\tif (!space)\n\t\treturn;\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid == 0) {\n\t\t\ts.bpid = space->get_broadphase()->create(this, i);\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\n\t\t\/\/not quite correct, should compute the next matrix..\n\t\tRect2 shape_aabb = s.shape->get_aabb();\n\t\tTransform2D xform = transform * s.xform;\n\t\tshape_aabb = xform.xform(shape_aabb);\n\t\ts.aabb_cache = shape_aabb;\n\t\ts.aabb_cache = s.aabb_cache.grow((s.aabb_cache.size.x + s.aabb_cache.size.y) * 0.5 * 0.05);\n\n\t\tspace->get_broadphase()->move(s.bpid, s.aabb_cache);\n\t}\n}\n\nvoid CollisionObject2DSW::_update_shapes_with_motion(const Vector2 &p_motion) {\n\n\tif (!space)\n\t\treturn;\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid == 0) {\n\t\t\ts.bpid = space->get_broadphase()->create(this, i);\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\n\t\t\/\/not quite correct, should compute the next matrix..\n\t\tRect2 shape_aabb = s.shape->get_aabb();\n\t\tTransform2D xform = transform * s.xform;\n\t\tshape_aabb = xform.xform(shape_aabb);\n\t\tshape_aabb = shape_aabb.merge(Rect2(shape_aabb.position + p_motion, shape_aabb.size)); \/\/use motion\n\t\ts.aabb_cache = shape_aabb;\n\n\t\tspace->get_broadphase()->move(s.bpid, shape_aabb);\n\t}\n}\n\nvoid CollisionObject2DSW::_set_space(Space2DSW *p_space) {\n\n\tif (space) {\n\n\t\tspace->remove_object(this);\n\n\t\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\t\tShape &s = shapes[i];\n\t\t\tif (s.bpid) {\n\t\t\t\tspace->get_broadphase()->remove(s.bpid);\n\t\t\t\ts.bpid = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tspace = p_space;\n\n\tif (space) {\n\n\t\tspace->add_object(this);\n\t\t_update_shapes();\n\t}\n}\n\nvoid CollisionObject2DSW::_shape_changed() {\n\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nCollisionObject2DSW::CollisionObject2DSW(Type p_type) {\n\n\t_static = true;\n\ttype = p_type;\n\tspace = NULL;\n\tinstance_id = 0;\n\tcollision_mask = 1;\n\tcollision_layer = 1;\n\tpickable = true;\n}\n<commit_msg>Fix 2d collision body update on shape remove<commit_after>\/*************************************************************************\/\n\/* collision_object_2d_sw.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2018 Godot Engine contributors (cf. AUTHORS.md) *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"collision_object_2d_sw.h\"\n#include \"space_2d_sw.h\"\n\nvoid CollisionObject2DSW::add_shape(Shape2DSW *p_shape, const Transform2D &p_transform) {\n\n\tShape s;\n\ts.shape = p_shape;\n\ts.xform = p_transform;\n\ts.xform_inv = s.xform.affine_inverse();\n\ts.bpid = 0; \/\/needs update\n\ts.disabled = false;\n\ts.one_way_collision = false;\n\tshapes.push_back(s);\n\tp_shape->add_owner(this);\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::set_shape(int p_index, Shape2DSW *p_shape) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tshapes[p_index].shape->remove_owner(this);\n\tshapes[p_index].shape = p_shape;\n\n\tp_shape->add_owner(this);\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::set_shape_metadata(int p_index, const Variant &p_metadata) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tshapes[p_index].metadata = p_metadata;\n}\n\nvoid CollisionObject2DSW::set_shape_transform(int p_index, const Transform2D &p_transform) {\n\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\n\tshapes[p_index].xform = p_transform;\n\tshapes[p_index].xform_inv = p_transform.affine_inverse();\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::remove_shape(Shape2DSW *p_shape) {\n\n\t\/\/remove a shape, all the times it appears\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tif (shapes[i].shape == p_shape) {\n\t\t\tremove_shape(i);\n\t\t\ti--;\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::remove_shape(int p_index) {\n\n\t\/\/remove anything from shape to be erased to end, so subindices don't change\n\tERR_FAIL_INDEX(p_index, shapes.size());\n\tfor (int i = p_index; i < shapes.size(); i++) {\n\n\t\tif (shapes[i].bpid == 0)\n\t\t\tcontinue;\n\t\t\/\/should never get here with a null owner\n\t\tspace->get_broadphase()->remove(shapes[i].bpid);\n\t\tshapes[i].bpid = 0;\n\t}\n\tshapes[p_index].shape->remove_owner(this);\n\tshapes.remove(p_index);\n\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nvoid CollisionObject2DSW::_set_static(bool p_static) {\n\tif (_static == p_static)\n\t\treturn;\n\t_static = p_static;\n\n\tif (!space)\n\t\treturn;\n\tfor (int i = 0; i < get_shape_count(); i++) {\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid > 0) {\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::_unregister_shapes() {\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid > 0) {\n\t\t\tspace->get_broadphase()->remove(s.bpid);\n\t\t\ts.bpid = 0;\n\t\t}\n\t}\n}\n\nvoid CollisionObject2DSW::_update_shapes() {\n\n\tif (!space)\n\t\treturn;\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid == 0) {\n\t\t\ts.bpid = space->get_broadphase()->create(this, i);\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\n\t\t\/\/not quite correct, should compute the next matrix..\n\t\tRect2 shape_aabb = s.shape->get_aabb();\n\t\tTransform2D xform = transform * s.xform;\n\t\tshape_aabb = xform.xform(shape_aabb);\n\t\ts.aabb_cache = shape_aabb;\n\t\ts.aabb_cache = s.aabb_cache.grow((s.aabb_cache.size.x + s.aabb_cache.size.y) * 0.5 * 0.05);\n\n\t\tspace->get_broadphase()->move(s.bpid, s.aabb_cache);\n\t}\n}\n\nvoid CollisionObject2DSW::_update_shapes_with_motion(const Vector2 &p_motion) {\n\n\tif (!space)\n\t\treturn;\n\n\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\tShape &s = shapes[i];\n\t\tif (s.bpid == 0) {\n\t\t\ts.bpid = space->get_broadphase()->create(this, i);\n\t\t\tspace->get_broadphase()->set_static(s.bpid, _static);\n\t\t}\n\n\t\t\/\/not quite correct, should compute the next matrix..\n\t\tRect2 shape_aabb = s.shape->get_aabb();\n\t\tTransform2D xform = transform * s.xform;\n\t\tshape_aabb = xform.xform(shape_aabb);\n\t\tshape_aabb = shape_aabb.merge(Rect2(shape_aabb.position + p_motion, shape_aabb.size)); \/\/use motion\n\t\ts.aabb_cache = shape_aabb;\n\n\t\tspace->get_broadphase()->move(s.bpid, shape_aabb);\n\t}\n}\n\nvoid CollisionObject2DSW::_set_space(Space2DSW *p_space) {\n\n\tif (space) {\n\n\t\tspace->remove_object(this);\n\n\t\tfor (int i = 0; i < shapes.size(); i++) {\n\n\t\t\tShape &s = shapes[i];\n\t\t\tif (s.bpid) {\n\t\t\t\tspace->get_broadphase()->remove(s.bpid);\n\t\t\t\ts.bpid = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tspace = p_space;\n\n\tif (space) {\n\n\t\tspace->add_object(this);\n\t\t_update_shapes();\n\t}\n}\n\nvoid CollisionObject2DSW::_shape_changed() {\n\n\t_update_shapes();\n\t_shapes_changed();\n}\n\nCollisionObject2DSW::CollisionObject2DSW(Type p_type) {\n\n\t_static = true;\n\ttype = p_type;\n\tspace = NULL;\n\tinstance_id = 0;\n\tcollision_mask = 1;\n\tcollision_layer = 1;\n\tpickable = true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n#include \"ConversionHelper.hxx\"\n#include \"GraphicHelpers.hxx\"\n\n#include <ooxml\/resourceids.hxx>\n\n#include <com\/sun\/star\/text\/HoriOrientation.hpp>\n#include <com\/sun\/star\/text\/VertOrientation.hpp>\n#include <com\/sun\/star\/text\/RelOrientation.hpp>\n#include <com\/sun\/star\/text\/WrapTextMode.hpp>\n\n#include \"dmapperLoggers.hxx\"\n\n#include <iostream>\nusing namespace std;\n\nnamespace writerfilter {\nnamespace dmapper {\n\nusing namespace com::sun::star;\n\nint PositionHandler::savedPositionOffsetV = 0;\nint PositionHandler::savedPositionOffsetH = 0;\nint PositionHandler::savedAlignV = text::VertOrientation::NONE;\nint PositionHandler::savedAlignH = text::HoriOrientation::NONE;\n\nPositionHandler::PositionHandler( bool vertical ) :\nLoggedProperties(dmapper_logger, \"PositionHandler\")\n{\n m_nRelation = text::RelOrientation::FRAME;\n if( vertical )\n {\n m_nPosition = savedPositionOffsetV;\n m_nOrient = savedAlignV;\n savedPositionOffsetV = 0;\n savedAlignV = text::VertOrientation::NONE;\n }\n else\n {\n m_nPosition = savedPositionOffsetH;\n m_nOrient = savedAlignH;\n savedPositionOffsetH = 0;\n savedAlignH = text::HoriOrientation::NONE;\n }\n}\n\nPositionHandler::~PositionHandler( )\n{\n}\n\nvoid PositionHandler::lcl_attribute( Id aName, Value& rVal )\n{\n sal_Int32 nIntValue = rVal.getInt( );\n switch ( aName )\n {\n case NS_ooxml::LN_CT_PosV_relativeFrom:\n {\n \/\/ TODO There are some other unhandled values\n static Id pVertRelValues[] =\n {\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_margin,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_page,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_paragraph,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_line\n };\n\n static sal_Int16 pVertRelations[] =\n {\n text::RelOrientation::PAGE_PRINT_AREA,\n text::RelOrientation::PAGE_FRAME,\n text::RelOrientation::FRAME,\n text::RelOrientation::TEXT_LINE\n };\n\n for ( int i = 0; i < 4; i++ )\n {\n if ( pVertRelValues[i] == sal_uInt32( nIntValue ) )\n m_nRelation = pVertRelations[i];\n }\n }\n break;\n case NS_ooxml::LN_CT_PosH_relativeFrom:\n {\n \/\/ TODO There are some other unhandled values\n static Id pHoriRelValues[] =\n {\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_margin,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_page,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_column,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_character\n };\n\n static sal_Int16 pHoriRelations[] =\n {\n text::RelOrientation::PAGE_PRINT_AREA,\n text::RelOrientation::PAGE_FRAME,\n text::RelOrientation::FRAME,\n text::RelOrientation::CHAR,\n };\n\n for ( int i = 0; i < 4; i++ )\n {\n if ( pHoriRelValues[i] == sal_uInt32( nIntValue ) )\n m_nRelation = pHoriRelations[i];\n }\n }\n break;\n default:\n#ifdef DEBUG_DOMAINMAPPER\n dmapper_logger->element(\"unhandled\");\n#endif\n break;\n }\n}\n\nvoid PositionHandler::lcl_sprm( Sprm& )\n{\n}\n\nvoid PositionHandler::setPositionOffset(const ::rtl::OUString & sText, bool vertical)\n{\n if( vertical )\n savedPositionOffsetV = ConversionHelper::convertEMUToMM100( sText.toInt32());\n else\n savedPositionOffsetH = ConversionHelper::convertEMUToMM100( sText.toInt32());\n}\n\nvoid PositionHandler::setAlignH(const ::rtl::OUString & sText)\n{\n if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"left\" )))\n savedAlignH = text::HoriOrientation::LEFT;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"right\" )))\n savedAlignH = text::HoriOrientation::RIGHT;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"center\" )))\n savedAlignH = text::HoriOrientation::CENTER;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"inside\" )))\n savedAlignH = text::HoriOrientation::INSIDE;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"outside\" )))\n savedAlignH = text::HoriOrientation::OUTSIDE;\n}\n\nvoid PositionHandler::setAlignV(const ::rtl::OUString & sText)\n{\n if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"top\" )))\n savedAlignV = text::VertOrientation::TOP;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"bottom\" )))\n savedAlignV = text::VertOrientation::BOTTOM;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"center\" )))\n savedAlignV = text::VertOrientation::CENTER;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"inside\" )))\n savedAlignV = text::VertOrientation::NONE;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"outside\" )))\n savedAlignV = text::VertOrientation::NONE;\n}\n\nWrapHandler::WrapHandler( ) :\nLoggedProperties(dmapper_logger, \"WrapHandler\"),\n m_nType( 0 ),\n m_nSide( 0 )\n{\n}\n\nWrapHandler::~WrapHandler( )\n{\n}\n\nvoid WrapHandler::lcl_attribute( Id aName, Value& rVal )\n{\n switch ( aName )\n {\n case NS_ooxml::LN_CT_Wrap_type:\n m_nType = sal_Int32( rVal.getInt( ) );\n break;\n case NS_ooxml::LN_CT_Wrap_side:\n m_nSide = sal_Int32( rVal.getInt( ) );\n break;\n default:;\n }\n}\n\nvoid WrapHandler::lcl_sprm( Sprm& )\n{\n}\n\nsal_Int32 WrapHandler::getWrapMode( )\n{\n sal_Int32 nMode = com::sun::star::text::WrapTextMode_NONE;\n\n switch ( m_nType )\n {\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_square:\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_tight:\n {\n switch ( m_nSide )\n {\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapSide_left:\n nMode = com::sun::star::text::WrapTextMode_LEFT;\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapSide_right:\n nMode = com::sun::star::text::WrapTextMode_RIGHT;\n break;\n default:\n nMode = com::sun::star::text::WrapTextMode_PARALLEL;\n }\n }\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_through:\n nMode = com::sun::star::text::WrapTextMode_THROUGHT;\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_topAndBottom:\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_none:\n default:\n nMode = com::sun::star::text::WrapTextMode_NONE;\n }\n\n return nMode;\n}\n\n\nvoid GraphicZOrderHelper::addItem( uno::Reference< beans::XPropertySet > props, sal_Int32 relativeHeight )\n{\n items[ relativeHeight ] = props;\n}\n\n\/\/ The relativeHeight value in .docx is an arbitrary number, where only the relative ordering matters.\n\/\/ But in Writer, the z-order is index in 0..(numitems-1) range, so whenever a new item needs to be\n\/\/ added in the proper z-order, it is necessary to find the proper index.\nsal_Int32 GraphicZOrderHelper::findZOrder( sal_Int32 relativeHeight )\n{\n Items::const_iterator it = items.begin();\n while( it != items.end())\n {\n \/\/ std::map is iterated sorted by key\n if( it->first > relativeHeight )\n break; \/\/ this is the first one higher, we belong right before it\n else\n ++it;\n }\n if( it == items.end()) \/\/ we're topmost\n {\n if( items.empty())\n return 0;\n sal_Int32 itemZOrder;\n --it;\n if( it->second->getPropertyValue(PropertyNameSupplier::GetPropertyNameSupplier()\n .GetName( PROP_Z_ORDER )) >>= itemZOrder )\n return itemZOrder + 1; \/\/ after the topmost\n }\n else\n {\n sal_Int32 itemZOrder;\n if( it->second->getPropertyValue(PropertyNameSupplier::GetPropertyNameSupplier()\n .GetName( PROP_Z_ORDER )) >>= itemZOrder )\n return itemZOrder; \/\/ before the item\n }\n SAL_WARN( \"writerfilter\", \"findZOrder() didn't find item z-order\" );\n return 0; \/\/ this should not(?) happen\n}\n\n} }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>WaE: MacOSX itemZOrder may be unused uninitialized<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n#include \"ConversionHelper.hxx\"\n#include \"GraphicHelpers.hxx\"\n\n#include <ooxml\/resourceids.hxx>\n\n#include <com\/sun\/star\/text\/HoriOrientation.hpp>\n#include <com\/sun\/star\/text\/VertOrientation.hpp>\n#include <com\/sun\/star\/text\/RelOrientation.hpp>\n#include <com\/sun\/star\/text\/WrapTextMode.hpp>\n\n#include \"dmapperLoggers.hxx\"\n\n#include <iostream>\nusing namespace std;\n\nnamespace writerfilter {\nnamespace dmapper {\n\nusing namespace com::sun::star;\n\nint PositionHandler::savedPositionOffsetV = 0;\nint PositionHandler::savedPositionOffsetH = 0;\nint PositionHandler::savedAlignV = text::VertOrientation::NONE;\nint PositionHandler::savedAlignH = text::HoriOrientation::NONE;\n\nPositionHandler::PositionHandler( bool vertical ) :\nLoggedProperties(dmapper_logger, \"PositionHandler\")\n{\n m_nRelation = text::RelOrientation::FRAME;\n if( vertical )\n {\n m_nPosition = savedPositionOffsetV;\n m_nOrient = savedAlignV;\n savedPositionOffsetV = 0;\n savedAlignV = text::VertOrientation::NONE;\n }\n else\n {\n m_nPosition = savedPositionOffsetH;\n m_nOrient = savedAlignH;\n savedPositionOffsetH = 0;\n savedAlignH = text::HoriOrientation::NONE;\n }\n}\n\nPositionHandler::~PositionHandler( )\n{\n}\n\nvoid PositionHandler::lcl_attribute( Id aName, Value& rVal )\n{\n sal_Int32 nIntValue = rVal.getInt( );\n switch ( aName )\n {\n case NS_ooxml::LN_CT_PosV_relativeFrom:\n {\n \/\/ TODO There are some other unhandled values\n static Id pVertRelValues[] =\n {\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_margin,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_page,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_paragraph,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromV_line\n };\n\n static sal_Int16 pVertRelations[] =\n {\n text::RelOrientation::PAGE_PRINT_AREA,\n text::RelOrientation::PAGE_FRAME,\n text::RelOrientation::FRAME,\n text::RelOrientation::TEXT_LINE\n };\n\n for ( int i = 0; i < 4; i++ )\n {\n if ( pVertRelValues[i] == sal_uInt32( nIntValue ) )\n m_nRelation = pVertRelations[i];\n }\n }\n break;\n case NS_ooxml::LN_CT_PosH_relativeFrom:\n {\n \/\/ TODO There are some other unhandled values\n static Id pHoriRelValues[] =\n {\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_margin,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_page,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_column,\n NS_ooxml::LN_Value_wordprocessingDrawing_ST_RelFromH_character\n };\n\n static sal_Int16 pHoriRelations[] =\n {\n text::RelOrientation::PAGE_PRINT_AREA,\n text::RelOrientation::PAGE_FRAME,\n text::RelOrientation::FRAME,\n text::RelOrientation::CHAR,\n };\n\n for ( int i = 0; i < 4; i++ )\n {\n if ( pHoriRelValues[i] == sal_uInt32( nIntValue ) )\n m_nRelation = pHoriRelations[i];\n }\n }\n break;\n default:\n#ifdef DEBUG_DOMAINMAPPER\n dmapper_logger->element(\"unhandled\");\n#endif\n break;\n }\n}\n\nvoid PositionHandler::lcl_sprm( Sprm& )\n{\n}\n\nvoid PositionHandler::setPositionOffset(const ::rtl::OUString & sText, bool vertical)\n{\n if( vertical )\n savedPositionOffsetV = ConversionHelper::convertEMUToMM100( sText.toInt32());\n else\n savedPositionOffsetH = ConversionHelper::convertEMUToMM100( sText.toInt32());\n}\n\nvoid PositionHandler::setAlignH(const ::rtl::OUString & sText)\n{\n if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"left\" )))\n savedAlignH = text::HoriOrientation::LEFT;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"right\" )))\n savedAlignH = text::HoriOrientation::RIGHT;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"center\" )))\n savedAlignH = text::HoriOrientation::CENTER;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"inside\" )))\n savedAlignH = text::HoriOrientation::INSIDE;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"outside\" )))\n savedAlignH = text::HoriOrientation::OUTSIDE;\n}\n\nvoid PositionHandler::setAlignV(const ::rtl::OUString & sText)\n{\n if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"top\" )))\n savedAlignV = text::VertOrientation::TOP;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"bottom\" )))\n savedAlignV = text::VertOrientation::BOTTOM;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"center\" )))\n savedAlignV = text::VertOrientation::CENTER;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"inside\" )))\n savedAlignV = text::VertOrientation::NONE;\n else if( sText == rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( \"outside\" )))\n savedAlignV = text::VertOrientation::NONE;\n}\n\nWrapHandler::WrapHandler( ) :\nLoggedProperties(dmapper_logger, \"WrapHandler\"),\n m_nType( 0 ),\n m_nSide( 0 )\n{\n}\n\nWrapHandler::~WrapHandler( )\n{\n}\n\nvoid WrapHandler::lcl_attribute( Id aName, Value& rVal )\n{\n switch ( aName )\n {\n case NS_ooxml::LN_CT_Wrap_type:\n m_nType = sal_Int32( rVal.getInt( ) );\n break;\n case NS_ooxml::LN_CT_Wrap_side:\n m_nSide = sal_Int32( rVal.getInt( ) );\n break;\n default:;\n }\n}\n\nvoid WrapHandler::lcl_sprm( Sprm& )\n{\n}\n\nsal_Int32 WrapHandler::getWrapMode( )\n{\n sal_Int32 nMode = com::sun::star::text::WrapTextMode_NONE;\n\n switch ( m_nType )\n {\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_square:\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_tight:\n {\n switch ( m_nSide )\n {\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapSide_left:\n nMode = com::sun::star::text::WrapTextMode_LEFT;\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapSide_right:\n nMode = com::sun::star::text::WrapTextMode_RIGHT;\n break;\n default:\n nMode = com::sun::star::text::WrapTextMode_PARALLEL;\n }\n }\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_through:\n nMode = com::sun::star::text::WrapTextMode_THROUGHT;\n break;\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_topAndBottom:\n case NS_ooxml::LN_Value_vml_wordprocessingDrawing_ST_WrapType_none:\n default:\n nMode = com::sun::star::text::WrapTextMode_NONE;\n }\n\n return nMode;\n}\n\n\nvoid GraphicZOrderHelper::addItem( uno::Reference< beans::XPropertySet > props, sal_Int32 relativeHeight )\n{\n items[ relativeHeight ] = props;\n}\n\n\/\/ The relativeHeight value in .docx is an arbitrary number, where only the relative ordering matters.\n\/\/ But in Writer, the z-order is index in 0..(numitems-1) range, so whenever a new item needs to be\n\/\/ added in the proper z-order, it is necessary to find the proper index.\nsal_Int32 GraphicZOrderHelper::findZOrder( sal_Int32 relativeHeight )\n{\n Items::const_iterator it = items.begin();\n while( it != items.end())\n {\n \/\/ std::map is iterated sorted by key\n if( it->first > relativeHeight )\n break; \/\/ this is the first one higher, we belong right before it\n else\n ++it;\n }\n if( it == items.end()) \/\/ we're topmost\n {\n if( items.empty())\n return 0;\n sal_Int32 itemZOrder(0);\n --it;\n if( it->second->getPropertyValue(PropertyNameSupplier::GetPropertyNameSupplier()\n .GetName( PROP_Z_ORDER )) >>= itemZOrder )\n return itemZOrder + 1; \/\/ after the topmost\n }\n else\n {\n sal_Int32 itemZOrder(0);\n if( it->second->getPropertyValue(PropertyNameSupplier::GetPropertyNameSupplier()\n .GetName( PROP_Z_ORDER )) >>= itemZOrder )\n return itemZOrder; \/\/ before the item\n }\n SAL_WARN( \"writerfilter\", \"findZOrder() didn't find item z-order\" );\n return 0; \/\/ this should not(?) happen\n}\n\n} }\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#ifndef AMGCL_LEVEL_PARAMS_HPP\n#define AMGCL_LEVEL_PARAMS_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012 Denis Demidov <ddemidov@ksu.ru>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n\/**\n * \\file level_params.hpp\n * \\author Denis Demidov <ddemidov@ksu.ru>\n * \\brief Common parameters for level construction\/solution.\n *\/\n\nnamespace amgcl {\n\nnamespace level {\n\n\/\/\/ Common parameters for level construction\/solution.\nstruct params {\n \/\/\/ Number of pre-relaxations.\n unsigned npre;\n\n \/\/\/ Number of post-relaxations.\n unsigned npost;\n\n \/\/\/ Number of cycles (1 for V-cycle, 2 for W-cycle, etc.).\n unsigned ncycle;\n\n \/\/\/ How often to invoke k-cycle instead of just v-cycle.\n \/**\n * See \\ref Notay_2008 \"Notay (2008)\". K-cycle employs a Krylov method\n * (here CG) on each level of the grid hierarchy and uses this grid\n * hierarchy for the preconditioning of this Krylov method. The approach is\n * further extended by allowing such inner iterations only at levels of\n * given multiplicity, whereas normal V-cycle formulation is used at all\n * other levels.\n *\/\n \/\/ TODO: Try flexible (generalized) CG method here.\n unsigned kcycle;\n\n \/\/\/ Under-relaxation factor.\n float relax_factor;\n\n \/\/\/ Maximum number of iterations in standalone solver.\n unsigned maxiter;\n\n \/\/\/ The required precision for standalone solver.\n double tol;\n\n params()\n : npre(1), npost(1), ncycle(1), kcycle(0), relax_factor(0.72f),\n maxiter(100), tol(1e-8)\n { }\n};\n\n} \/\/ namespace level\n} \/\/ namespace amgcl\n\n#endif\n<commit_msg>Removed damping factor from general level params<commit_after>#ifndef AMGCL_LEVEL_PARAMS_HPP\n#define AMGCL_LEVEL_PARAMS_HPP\n\n\/*\nThe MIT License\n\nCopyright (c) 2012 Denis Demidov <ddemidov@ksu.ru>\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n\/**\n * \\file level_params.hpp\n * \\author Denis Demidov <ddemidov@ksu.ru>\n * \\brief Common parameters for level construction\/solution.\n *\/\n\nnamespace amgcl {\n\nnamespace level {\n\n\/\/\/ Common parameters for level construction\/solution.\nstruct params {\n \/\/\/ Number of pre-relaxations.\n unsigned npre;\n\n \/\/\/ Number of post-relaxations.\n unsigned npost;\n\n \/\/\/ Number of cycles (1 for V-cycle, 2 for W-cycle, etc.).\n unsigned ncycle;\n\n \/\/\/ How often to invoke k-cycle instead of just v-cycle.\n \/**\n * See \\ref Notay_2008 \"Notay (2008)\". K-cycle employs a Krylov method\n * (here CG) on each level of the grid hierarchy and uses this grid\n * hierarchy for the preconditioning of this Krylov method. The approach is\n * further extended by allowing such inner iterations only at levels of\n * given multiplicity, whereas normal V-cycle formulation is used at all\n * other levels.\n *\/\n \/\/ TODO: Try flexible (generalized) CG method here.\n unsigned kcycle;\n\n \/\/\/ Maximum number of iterations in standalone solver.\n unsigned maxiter;\n\n \/\/\/ The required precision for standalone solver.\n double tol;\n\n params()\n : npre(1), npost(1), ncycle(1), kcycle(0), maxiter(100), tol(1e-8)\n { }\n};\n\n} \/\/ namespace level\n} \/\/ namespace amgcl\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <sal\/types.h>\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include \"rtl\/ustring.hxx\"\n#include <iostream>\n\nnamespace test { namespace strings {\n\nclass valueX : public CppUnit::TestFixture {\npublic:\n void testOBoolean();\n void testOUBoolean();\n void testOUInt();\n void testOInt();\n void testOUFloat();\n void testOFloat();\n\n CPPUNIT_TEST_SUITE(valueX);\n CPPUNIT_TEST(testOBoolean);\n CPPUNIT_TEST(testOUBoolean);\n CPPUNIT_TEST(testOUInt);\n CPPUNIT_TEST(testOInt);\n CPPUNIT_TEST(testOUFloat);\n CPPUNIT_TEST(testOFloat);\n CPPUNIT_TEST_SUITE_END();\n};\n\n} }\n\nCPPUNIT_TEST_SUITE_REGISTRATION(test::strings::valueX);\n\nnamespace {\n\ntemplate< typename T >\nvoid testBoolean() {\n CPPUNIT_ASSERT_EQUAL( T( \"false\" ), T::boolean( false ) );\n CPPUNIT_ASSERT_EQUAL( T( \"false\" ), T::boolean( sal_False ) );\n CPPUNIT_ASSERT_EQUAL( T( \"true\" ), T::boolean( true ) );\n CPPUNIT_ASSERT_EQUAL( T( \"true\" ), T::boolean( sal_True ) );\n}\n\n}\n\nvoid test::strings::valueX::testOBoolean() {\n testBoolean<rtl::OString>();\n}\n\nvoid test::strings::valueX::testOUBoolean() {\n testBoolean<rtl::OString>();\n}\n\ntemplate< typename T >\nvoid testInt() {\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( 30039062 ));\n\n \/\/ test the overloading resolution\n\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< signed char >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< unsigned char >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< short >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< unsigned short >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< int >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned int >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< long >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned long >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< long long >( 30039062 )));\n \/\/ The highest bit set in unsigned long long may not actually work.\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned long long >( 30039062 )));\n\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< sal_Int8 >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< sal_uInt8 >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< sal_Int16 >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< sal_uInt16 >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_Int32 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_uInt32 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_Int64 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_uInt64 >( 30039062 )));\n\n \/\/ The implementation internally uses sal_Int64 etc. types, so check ranges.\n assert( sizeof( int ) <= sizeof( sal_Int32 ));\n assert( sizeof( long ) <= sizeof( sal_Int64 ));\n assert( sizeof( long long ) <= sizeof( sal_Int64 ));\n assert( sizeof( unsigned int ) < sizeof( sal_Int64 ));\n}\n\nvoid test::strings::valueX::testOUInt() {\n testInt<rtl::OUString>();\n}\n\nvoid test::strings::valueX::testOInt() {\n testInt<rtl::OString>();\n}\n\ntemplate< typename T >\nvoid testFloat() {\n CPPUNIT_ASSERT_EQUAL( T( \"39062.2\" ), T::number( 39062.2f ));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062.2\" ), T::number( 30039062.2 ));\n \/\/ long double not supported\n}\n\nvoid test::strings::valueX::testOUFloat() {\n testFloat<rtl::OUString>();\n}\n\nvoid test::strings::valueX::testOFloat() {\n testFloat<rtl::OString>();\n}\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>testOUBoolean should test with OUString, not OString<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <sal\/types.h>\n#include <cppunit\/TestFixture.h>\n#include <cppunit\/extensions\/HelperMacros.h>\n#include \"rtl\/ustring.hxx\"\n#include <iostream>\n\nnamespace test { namespace strings {\n\nclass valueX : public CppUnit::TestFixture {\npublic:\n void testOBoolean();\n void testOUBoolean();\n void testOUInt();\n void testOInt();\n void testOUFloat();\n void testOFloat();\n\n CPPUNIT_TEST_SUITE(valueX);\n CPPUNIT_TEST(testOBoolean);\n CPPUNIT_TEST(testOUBoolean);\n CPPUNIT_TEST(testOUInt);\n CPPUNIT_TEST(testOInt);\n CPPUNIT_TEST(testOUFloat);\n CPPUNIT_TEST(testOFloat);\n CPPUNIT_TEST_SUITE_END();\n};\n\n} }\n\nCPPUNIT_TEST_SUITE_REGISTRATION(test::strings::valueX);\n\nnamespace {\n\ntemplate< typename T >\nvoid testBoolean() {\n CPPUNIT_ASSERT_EQUAL( T( \"false\" ), T::boolean( false ) );\n CPPUNIT_ASSERT_EQUAL( T( \"false\" ), T::boolean( sal_False ) );\n CPPUNIT_ASSERT_EQUAL( T( \"true\" ), T::boolean( true ) );\n CPPUNIT_ASSERT_EQUAL( T( \"true\" ), T::boolean( sal_True ) );\n}\n\n}\n\nvoid test::strings::valueX::testOBoolean() {\n testBoolean<rtl::OString>();\n}\n\nvoid test::strings::valueX::testOUBoolean() {\n testBoolean<rtl::OUString>();\n}\n\ntemplate< typename T >\nvoid testInt() {\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( 30039062 ));\n\n \/\/ test the overloading resolution\n\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< signed char >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< unsigned char >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< short >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< unsigned short >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< int >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned int >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< long >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned long >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< long long >( 30039062 )));\n \/\/ The highest bit set in unsigned long long may not actually work.\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< unsigned long long >( 30039062 )));\n\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< sal_Int8 >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30\" ), T::number( static_cast< sal_uInt8 >( 30 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< sal_Int16 >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039\" ), T::number( static_cast< sal_uInt16 >( 30039 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_Int32 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_uInt32 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_Int64 >( 30039062 )));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062\" ), T::number( static_cast< sal_uInt64 >( 30039062 )));\n\n \/\/ The implementation internally uses sal_Int64 etc. types, so check ranges.\n assert( sizeof( int ) <= sizeof( sal_Int32 ));\n assert( sizeof( long ) <= sizeof( sal_Int64 ));\n assert( sizeof( long long ) <= sizeof( sal_Int64 ));\n assert( sizeof( unsigned int ) < sizeof( sal_Int64 ));\n}\n\nvoid test::strings::valueX::testOUInt() {\n testInt<rtl::OUString>();\n}\n\nvoid test::strings::valueX::testOInt() {\n testInt<rtl::OString>();\n}\n\ntemplate< typename T >\nvoid testFloat() {\n CPPUNIT_ASSERT_EQUAL( T( \"39062.2\" ), T::number( 39062.2f ));\n CPPUNIT_ASSERT_EQUAL( T( \"30039062.2\" ), T::number( 30039062.2 ));\n \/\/ long double not supported\n}\n\nvoid test::strings::valueX::testOUFloat() {\n testFloat<rtl::OUString>();\n}\n\nvoid test::strings::valueX::testOFloat() {\n testFloat<rtl::OString>();\n}\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- c++ -*-\n\/\/\n\/\/ Time-stamp: <2015-04-22 09:59:37 zophos>\n\/\/\n#define DEBUG\n\n#include <iostream>\n#include <fstream>\n\n#include <gdcmImageReader.h>\n\n#include <opencv2\/opencv.hpp>\n\ncv::Mat1d read_dcm(const std::string& filename)\n{\n\t\/\/ Read DCM\n\tgdcm::ImageReader ir;\n\tir.SetFileName(filename.c_str());\n\tif (!ir.Read()) {\n\t\treturn cv::Mat1d();\n\t}\n\n\tstd::cout << \"Getting image from ImageReader...\" << std::endl;\n\n\tconst gdcm::Image &gimage = ir.GetImage();\n\n\tstd::vector<short> vbuffer(gimage.GetBufferLength());\n\tgimage.GetBuffer((char*)&vbuffer[0]);\n\n\t\/\/const unsigned int* const dimension = gimage.GetDimensions();\n\tconst unsigned int size_x = gimage.GetDimensions()[0];\n\tconst unsigned int size_y = gimage.GetDimensions()[1];\n\n\tcv::Mat1d image(size_y, size_x);\n\n\tstd::copy(vbuffer.begin(), vbuffer.end(), image.begin());\n\treturn image;\n}\n\nint main(int argc, char *argv[])\n{\n\tif (argc < 2) {\n\t\treturn 1;\n\t}\n\tconst std::string filename = argv[1];\n\tconst std::string outname = argv[2];\n\n\tcv::Mat1d image = read_dcm(filename);\n\n\tdouble vmin, vmax;\n\tcv::minMaxLoc(image, &vmin, &vmax);\n\timage = (image - vmin) \/ (vmax - vmin);\n\n\tcv::imshow(\"\", image);\n\tcv::waitKey(0);\n\n\tcv::imwrite(outname, 255*image);\n\n\treturn 0;\n}\n<commit_msg>Tool annotate_kv: prints intersection of chamber slices with sax slice<commit_after>\/\/ -*- c++ -*-\n\/\/\n\/\/ Time-stamp: <2015-04-22 09:59:37 zophos>\n\/\/\n#define DEBUG\n\n#include <iostream>\n#include <fstream>\n\n#include <gdcmReader.h>\n#include <gdcmImageReader.h>\n#include <gdcmAttribute.h>\n\n\n#include <opencv2\/opencv.hpp>\n#include \"annotate_lv.h\"\n\nstruct Slice\n{\n\tcv::Mat1d image;\n\tcv::Vec3d row_dc;\n\tcv::Vec3d col_dc;\n\tcv::Vec3d position;\n\tcv::Vec3d pixel_spacing;\n\n\tcv::Mat1d rotation_matrix() const\n\t{\n\t\tcv::Mat1d rm;\n\t\trm.push_back(row_dc * pixel_spacing[0]);\n\t\trm.push_back(col_dc * pixel_spacing[0]);\n\t\trm.push_back(normal() * pixel_spacing[0]);\n\t\treturn rm.reshape(1, 3);\n\t}\n\tcv::Vec3d normal() const { return row_dc.cross(col_dc); };\n};\n\nSlice read_dcm(const std::string& filename)\n{\n\t\/\/ Read Imageimage_position\n\tgdcm::ImageReader ir;\n\tir.SetFileName(filename.c_str());\n\tif (!ir.Read()) {\n\t\tstd::cerr << \"Could not read: \" << filename << std::endl;\n\t\treturn Slice();\n\t}\n\n\tconst gdcm::Image &gimage = ir.GetImage();\n\n\tstd::vector<short> vbuffer(gimage.GetBufferLength());\n\tgimage.GetBuffer((char*)&vbuffer[0]);\n\n\t\/\/const unsigned int* const dimension = gimage.GetDimensions();\n\tconst unsigned int size_x = gimage.GetDimensions()[0];\n\tconst unsigned int size_y = gimage.GetDimensions()[1];\n\tcv::Mat1d image(size_y, size_x);\n\tstd::copy(vbuffer.begin(), vbuffer.end(), image.begin());\n\n\treturn Slice{\n\t\t\t\timage,\n\t\t\t\tcv::Vec3d(gimage.GetDirectionCosines()),\n\t\t\t\tcv::Vec3d(gimage.GetDirectionCosines() + 3),\n\t\t\t\tcv::Vec3d(gimage.GetOrigin()),\n\t\t\t\tcv::Vec3d(gimage.GetSpacing())\n\t\t\t};\n}\n\ncv::Vec3d slices_intersection(const Slice& s1, const Slice& s2, const Slice& s3)\n{\n\tcv::Mat1d normals;\n\tnormals.push_back(s1.normal());\n\tnormals.push_back(s2.normal());\n\tnormals.push_back(s3.normal());\n\tnormals = normals.reshape(1, 3);\n\n\tcv::Mat1d d = (cv::Mat1d(3, 1) << \n\t\ts1.normal().dot(s1.position), \n\t\ts2.normal().dot(s2.position), \n\t\ts3.normal().dot(s3.position)\n\t\t);\n\t\t\n\tcv::Mat1d intersection;\n\tcv::solve(normals, d, intersection, cv::DECOMP_SVD);\n\treturn cv::Vec3d(intersection);\n}\n\ncv::Point2d point2slice(const cv::Vec3d& p, const Slice& s)\n{\n\tconst cv::Mat1d projection = s.rotation_matrix().inv().t() * cv::Mat1d(p - s.position);\n\treturn { projection(0, 0), projection(1,0) };\n}\n\nint main(int argc, char *argv[])\n{\n\tif (argc < 4) {\n\t\treturn EXIT_FAILURE;\n\t}\n\tconst std::string slicecname_2ch = argv[1];\n\tconst std::string slicecname_4ch = argv[2];\n\tconst std::string slicecname_sax = argv[3];\n\n\tSlice slice_2ch = read_dcm(slicecname_2ch);\n\tSlice slice_4ch = read_dcm(slicecname_4ch);\n\tSlice slice_sax = read_dcm(slicecname_sax);\n\n\tcv::Vec3d intersection = slices_intersection(slice_2ch, slice_4ch, slice_sax);\n\tcv::Point2d intersection_sax = point2slice(intersection, slice_sax);\n\tdouble vmin, vmax;\n\tcv::minMaxLoc(slice_sax.image, &vmin, &vmax);\n\tcv::Mat1d image = (slice_sax.image - vmin) \/ (vmax - vmin);\n\n\tstd::cout\n\t\t<< slicecname_sax << \"\\t\"\n\t\t<< intersection_sax.x << \"\\t\"\n\t\t<< intersection_sax.y << \"\\t\"\n\t\t<< intersection_sax.x \/ slice_sax.image.rows << \"\\t\"\n\t\t<< intersection_sax.y \/ slice_sax.image.cols << std::endl;\n\n#if _DEBUG || 1\n\tcv::circle(image, intersection_sax, 2, cv::Scalar(255));\n\tcv::imshow(\"image\", image);\n\tcv::waitKey(0);\n\tcv::imwrite(\"1.png\", 255*image);\n#endif\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 Masayoshi Mizutani <mizutani@sfc.wide.ad.jp>\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS\n * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sstream>\n#include <iostream>\n#include <msgpack.hpp>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <assert.h>\n#include <math.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include \".\/fluent\/queue.hpp\"\n#include \".\/debug.h\"\n\nnamespace fluent {\n \/\/ ----------------------------------------------------------------\n \/\/ MsgQueue\n const bool MsgQueue::DBG = false;\n \n MsgQueue::MsgQueue() :\n msg_head_(nullptr), msg_tail_(nullptr),\n count_(0), limit_(1000) {\n }\n MsgQueue::~MsgQueue() {\n }\n bool MsgQueue::push(Message *msg) {\n bool rc = true;\n\n if (this->count_ < this->limit_) {\n if (this->msg_head_) {\n assert(this->msg_tail_);\n this->msg_tail_->attach(msg);\n } else {\n this->msg_head_ = msg;\n }\n this->msg_tail_ = msg;\n this->count_++;\n } else {\n \/\/ queue is full.\n rc = false;\n }\n \n return rc;\n }\n \n Message* MsgQueue::pop() {\n Message *msg;\n \n if (this->msg_head_ == nullptr) {\n return nullptr;\n }\n\n assert(this->count_ > 0);\n msg = this->msg_head_;\n this->msg_head_ = this->msg_tail_ = nullptr;\n this->count_ = 0;\n \n return msg;\n }\n \n void MsgQueue::set_limit(size_t limit) {\n this->limit_ = limit;\n }\n\n\n \/\/ ----------------------------------------------\n const bool MsgThreadQueue::DBG = true;\n\n MsgThreadQueue::MsgThreadQueue() : term_(false) {\n \/\/ Setup pthread.\n ::pthread_mutex_init(&(this->mutex_), NULL);\n ::pthread_cond_init(&(this->cond_), NULL);\n }\n MsgThreadQueue::~MsgThreadQueue() {\n }\n bool MsgThreadQueue::push(Message *msg) {\n bool rc = true;\n \n ::pthread_mutex_lock (&(this->mutex_));\n debug(DBG, \"entered lock\");\n\n debug(DBG, \"PUSH: count:%lu, limit:%lu\", this->count(), this->limit());\n if (this->term_) {\n \/\/ do not accept more msg because working thread going to shutdown.\n } else {\n rc = this->MsgQueue::push(msg);\n }\n debug(DBG, \"PUSHED: count:%lu, limit:%lu\", this->count(), this->limit());\n \n ::pthread_mutex_unlock (&(this->mutex_));\n debug(DBG, \"left lock\");\n \n return rc;\n }\n Message* MsgThreadQueue::pop() {\n Message *msg;\n \n debug(DBG, \"entering lock\");\n ::pthread_mutex_lock(&(this->mutex_));\n debug(DBG, \"entered lock\");\n\n msg = this->MsgQueue::pop();\n if (msg != nullptr) {\n ::pthread_mutex_unlock(&(this->mutex_));\n return msg;\n }\n\n if (this->term_) {\n \/\/ Going to shutdown the thread.\n ::pthread_mutex_unlock(&(this->mutex_));\n debug(DBG, \"going to shutdown, leave\");\n return nullptr;\n }\n \n debug(DBG, \"entered wait\");\n ::pthread_cond_wait(&(this->cond_), &(this->mutex_));\n debug(DBG, \"left wait\");\n\n msg = this->MsgQueue::pop();\n ::pthread_mutex_unlock(&(this->mutex_));\n if (msg) {\n debug(DBG, \"poped (%p)\", msg);\n } else {\n debug(DBG, \"no data\");\n }\n\n debug(DBG, \"left lock\");\n\n return msg;\n }\n\n void MsgThreadQueue::term() {\n \/\/ Sending terminate signal to worker thread.\n ::pthread_mutex_lock(&(this->mutex_));\n this->term_ = true;\n ::pthread_cond_signal (&(this->cond_));\n ::pthread_mutex_unlock(&(this->mutex_)); \n debug(DBG, \"sent terminate\");\n }\n\n bool MsgThreadQueue::is_term() {\n bool rc;\n ::pthread_mutex_lock(&(this->mutex_));\n rc = this->term_;\n ::pthread_mutex_unlock(&(this->mutex_));\n debug(DBG, \"checked terminate\");\n return rc;\n }\n \n void MsgThreadQueue::set_limit(size_t limit) {\n ::pthread_mutex_lock(&(this->mutex_));\n this->MsgQueue::set_limit(limit);\n ::pthread_mutex_unlock(&(this->mutex_)); \n }\n \n}\n<commit_msg>add pthread_cond_signal that was removed by mistake<commit_after>\/*\n * Copyright (c) 2015 Masayoshi Mizutani <mizutani@sfc.wide.ad.jp>\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS\n * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sstream>\n#include <iostream>\n#include <msgpack.hpp>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <assert.h>\n#include <math.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include \".\/fluent\/queue.hpp\"\n#include \".\/debug.h\"\n\nnamespace fluent {\n \/\/ ----------------------------------------------------------------\n \/\/ MsgQueue\n const bool MsgQueue::DBG = false;\n \n MsgQueue::MsgQueue() :\n msg_head_(nullptr), msg_tail_(nullptr),\n count_(0), limit_(1000) {\n }\n MsgQueue::~MsgQueue() {\n }\n bool MsgQueue::push(Message *msg) {\n bool rc = true;\n\n if (this->count_ < this->limit_) {\n if (this->msg_head_) {\n assert(this->msg_tail_);\n this->msg_tail_->attach(msg);\n } else {\n this->msg_head_ = msg;\n }\n this->msg_tail_ = msg;\n this->count_++;\n } else {\n \/\/ queue is full.\n rc = false;\n }\n \n return rc;\n }\n \n Message* MsgQueue::pop() {\n Message *msg;\n \n if (this->msg_head_ == nullptr) {\n return nullptr;\n }\n\n assert(this->count_ > 0);\n msg = this->msg_head_;\n this->msg_head_ = this->msg_tail_ = nullptr;\n this->count_ = 0;\n \n return msg;\n }\n \n void MsgQueue::set_limit(size_t limit) {\n this->limit_ = limit;\n }\n\n\n \/\/ ----------------------------------------------\n const bool MsgThreadQueue::DBG = false;\n\n MsgThreadQueue::MsgThreadQueue() : term_(false) {\n \/\/ Setup pthread.\n ::pthread_mutex_init(&(this->mutex_), NULL);\n ::pthread_cond_init(&(this->cond_), NULL);\n }\n MsgThreadQueue::~MsgThreadQueue() {\n }\n bool MsgThreadQueue::push(Message *msg) {\n bool rc = true;\n \n ::pthread_mutex_lock (&(this->mutex_));\n debug(DBG, \"entered lock\");\n\n debug(DBG, \"PUSH: count:%lu, limit:%lu\", this->count(), this->limit());\n if (this->term_) {\n \/\/ do not accept more msg because working thread going to shutdown.\n } else {\n rc = this->MsgQueue::push(msg);\n ::pthread_cond_signal (&(this->cond_));\n }\n debug(DBG, \"PUSHED: count:%lu, limit:%lu\", this->count(), this->limit());\n \n ::pthread_mutex_unlock (&(this->mutex_));\n debug(DBG, \"left lock\");\n \n return rc;\n }\n Message* MsgThreadQueue::pop() {\n Message *msg;\n \n debug(DBG, \"entering lock\");\n ::pthread_mutex_lock(&(this->mutex_));\n debug(DBG, \"entered lock\");\n\n msg = this->MsgQueue::pop();\n if (msg != nullptr) {\n debug(DBG, \"poped before wait (%p)\", msg);\n ::pthread_mutex_unlock(&(this->mutex_));\n return msg;\n }\n\n if (this->term_) {\n \/\/ Going to shutdown the thread.\n ::pthread_mutex_unlock(&(this->mutex_));\n debug(DBG, \"going to shutdown, leave\");\n return nullptr;\n }\n \n debug(DBG, \"entered wait\");\n ::pthread_cond_wait(&(this->cond_), &(this->mutex_));\n debug(DBG, \"left wait\");\n\n msg = this->MsgQueue::pop();\n ::pthread_mutex_unlock(&(this->mutex_));\n if (msg) {\n debug(DBG, \"poped (%p)\", msg);\n } else {\n debug(DBG, \"no data\");\n }\n\n debug(DBG, \"left lock\");\n\n return msg;\n }\n\n void MsgThreadQueue::term() {\n \/\/ Sending terminate signal to worker thread.\n ::pthread_mutex_lock(&(this->mutex_));\n this->term_ = true;\n ::pthread_cond_signal (&(this->cond_));\n ::pthread_mutex_unlock(&(this->mutex_)); \n debug(DBG, \"sent terminate\");\n }\n\n bool MsgThreadQueue::is_term() {\n bool rc;\n ::pthread_mutex_lock(&(this->mutex_));\n rc = this->term_;\n ::pthread_mutex_unlock(&(this->mutex_));\n debug(DBG, \"checked terminate\");\n return rc;\n }\n \n void MsgThreadQueue::set_limit(size_t limit) {\n ::pthread_mutex_lock(&(this->mutex_));\n this->MsgQueue::set_limit(limit);\n ::pthread_mutex_unlock(&(this->mutex_)); \n }\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/* +------------------------------------------------------------------------+\n | Mobile Robot Programming Toolkit (MRPT) |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2018, Individual contributors, see AUTHORS file |\n | See: http:\/\/www.mrpt.org\/Authors - All rights reserved. |\n | Released under BSD License. See details in http:\/\/www.mrpt.org\/License |\n +------------------------------------------------------------------------+ *\/\n\n\/**\n * icp3d\n * Execute an Iterative Closest Point algorithm using two 3D point clouds.\n *\/\n\n#include <mrpt\/slam\/CICP.h>\n\n#include <mrpt\/poses\/CPose3DPDF.h>\n#include <mrpt\/obs\/CObservation2DRangeScan.h>\n#include <mrpt\/maps\/CSimplePointsMap.h>\n#include <mrpt\/gui\/CDisplayWindow3D.h>\n#include <mrpt\/opengl\/CGridPlaneXY.h>\n#include <mrpt\/opengl\/CSphere.h>\n#include <mrpt\/opengl\/CAngularObservationMesh.h>\n#include <mrpt\/opengl\/CDisk.h>\n#include <mrpt\/opengl\/stock_objects.h>\n#include <iostream>\n\nusing namespace std;\nusing namespace mrpt;\nusing namespace mrpt::gui;\nusing namespace mrpt::opengl;\nusing namespace mrpt::poses;\nusing namespace mrpt::slam;\nusing namespace mrpt::maps;\nusing namespace mrpt::obs;\n\n\/\/ Increase this values to get more precision. It will also increase run time.\nconst size_t HOW_MANY_YAWS = 120;\nconst size_t HOW_MANY_PITCHS = 120;\n\n\/\/ The scans of the 3D object, taken from 2 different places:\nvector<CObservation2DRangeScan> sequence_scans1, sequence_scans2;\n\n\/\/ The two origins for the 3D scans\nCPose3D viewpoint1(-0.3, 0.7, 3, DEG2RAD(5), DEG2RAD(80), DEG2RAD(3));\nCPose3D viewpoint2(0.5, -0.2, 2.6, DEG2RAD(-5), DEG2RAD(100), DEG2RAD(-7));\n\nCPose3D SCAN2_POSE_ERROR(0.15, -0.07, 0.10, -0.03, 0.1, 0.1);\n\n\/**\n * Generate 3 objects to work with - 1 sphere, 2 disks\n *\/\nvoid generateObjects(CSetOfObjects::Ptr& world)\n{\n\tCSphere::Ptr sph = mrpt::make_aligned_shared<CSphere>(0.5);\n\tsph->setLocation(0, 0, 0);\n\tsph->setColor(1, 0, 0);\n\tworld->insert(sph);\n\n\tCDisk::Ptr pln = mrpt::make_aligned_shared<opengl::CDisk>();\n\tpln->setDiskRadius(2);\n\tpln->setPose(CPose3D(0, 0, 0, 0, DEG2RAD(5), DEG2RAD(5)));\n\tpln->setColor(0.8, 0, 0);\n\tworld->insert(pln);\n\n\t{\n\t\tCDisk::Ptr pln = mrpt::make_aligned_shared<opengl::CDisk>();\n\t\tpln->setDiskRadius(2);\n\t\tpln->setPose(CPose3D(0, 0, 0, DEG2RAD(30), DEG2RAD(-20), DEG2RAD(-2)));\n\t\tpln->setColor(0.9, 0, 0);\n\t\tworld->insert(pln);\n\t}\n}\n\nvoid test_icp3D()\n{\n\t\/\/ Create the reference objects:\n\tCOpenGLScene::Ptr scene1 = mrpt::make_aligned_shared<COpenGLScene>();\n\tCOpenGLScene::Ptr scene2 = mrpt::make_aligned_shared<COpenGLScene>();\n\tCOpenGLScene::Ptr scene3 = mrpt::make_aligned_shared<COpenGLScene>();\n\n\topengl::CGridPlaneXY::Ptr plane1 =\n\t\tmrpt::make_aligned_shared<CGridPlaneXY>(-20, 20, -20, 20, 0, 1);\n\tplane1->setColor(0.3, 0.3, 0.3);\n\tscene1->insert(plane1);\n\tscene2->insert(plane1);\n\tscene3->insert(plane1);\n\n\tCSetOfObjects::Ptr world = mrpt::make_aligned_shared<CSetOfObjects>();\n\tgenerateObjects(world);\n\tscene1->insert(world);\n\n\t\/\/ Perform the 3D scans:\n\tCAngularObservationMesh::Ptr aom1 =\n\t\tmrpt::make_aligned_shared<CAngularObservationMesh>();\n\tCAngularObservationMesh::Ptr aom2 =\n\t\tmrpt::make_aligned_shared<CAngularObservationMesh>();\n\n\tcout << \"Performing ray-tracing...\" << endl;\n\tCAngularObservationMesh::trace2DSetOfRays(\n\t\tscene1, viewpoint1, aom1,\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_PITCHS),\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_YAWS));\n\tCAngularObservationMesh::trace2DSetOfRays(\n\t\tscene1, viewpoint2, aom2,\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_PITCHS),\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_YAWS));\n\tcout << \"Ray-tracing done\" << endl;\n\n\t\/\/ Put the viewpoints origins:\n\t{\n\t\tCSetOfObjects::Ptr origin1 = opengl::stock_objects::CornerXYZ();\n\t\torigin1->setPose(viewpoint1);\n\t\torigin1->setScale(0.6);\n\t\tscene1->insert(origin1);\n\t\tscene2->insert(origin1);\n\t}\n\t{\n\t\tCSetOfObjects::Ptr origin2 = opengl::stock_objects::CornerXYZ();\n\t\torigin2->setPose(viewpoint2);\n\t\torigin2->setScale(0.6);\n\t\tscene1->insert(origin2);\n\t\tscene2->insert(origin2);\n\t}\n\n\t\/\/ Show the scanned points:\n\tCSimplePointsMap M1, M2;\n\n\taom1->generatePointCloud(&M1);\n\taom2->generatePointCloud(&M2);\n\n\t\/\/ Create the wrongly-localized M2:\n\tCSimplePointsMap M2_noisy;\n\tM2_noisy = M2;\n\tM2_noisy.changeCoordinatesReference(SCAN2_POSE_ERROR);\n\n\tCSetOfObjects::Ptr PTNS1 = mrpt::make_aligned_shared<CSetOfObjects>();\n\tCSetOfObjects::Ptr PTNS2 = mrpt::make_aligned_shared<CSetOfObjects>();\n\n\tCPointsMap::COLOR_3DSCENE(mrpt::img::TColorf(1, 0, 0));\n\tM1.getAs3DObject(PTNS1);\n\n\tCPointsMap::COLOR_3DSCENE(mrpt::img::TColorf(0, 0, 1));\n\tM2_noisy.getAs3DObject(PTNS2);\n\n\tscene2->insert(PTNS1);\n\tscene2->insert(PTNS2);\n\n\t\/\/ --------------------------------------\n\t\/\/ Do the ICP-3D\n\t\/\/ --------------------------------------\n\tfloat run_time;\n\tCICP icp;\n\tCICP::TReturnInfo icp_info;\n\n\ticp.options.thresholdDist = 0.40;\n\ticp.options.thresholdAng = 0;\n\n\tstd::vector<double> xs, ys, zs;\n\tM1.getAllPoints(xs, ys, ys);\n\tcout << \"Size of xs in M1: \" << xs.size() << endl;\n\tM2.getAllPoints(xs, ys, ys);\n\tcout << \"Size of xs in M2: \" << xs.size() << endl;\n\n\tCPose3DPDF::Ptr pdf = icp.Align3D(\n\t\t&M2_noisy, \/\/ Map to align\n\t\t&M1, \/\/ Reference map\n\t\tCPose3D(), \/\/ Initial gross estimate\n\t\t&run_time, &icp_info);\n\n\tCPose3D mean = pdf->getMeanVal();\n\n\tcout << \"ICP run took \" << run_time << \" secs.\" << endl;\n\tcout << \"Goodness: \" << 100 * icp_info.goodness\n\t\t << \"% , # of iterations= \" << icp_info.nIterations\n\t\t << \" Quality: \" << icp_info.quality << endl;\n\tcout << \"ICP output: mean= \" << mean << endl;\n\tcout << \"Real displacement: \" << SCAN2_POSE_ERROR << endl;\n\n\t\/\/ Aligned maps:\n\tCSetOfObjects::Ptr PTNS2_ALIGN = mrpt::make_aligned_shared<CSetOfObjects>();\n\n\tM2_noisy.changeCoordinatesReference(CPose3D() - mean);\n\tM2_noisy.getAs3DObject(PTNS2_ALIGN);\n\n\tscene3->insert(PTNS1);\n\tscene3->insert(PTNS2_ALIGN);\n\n\t\/\/ Show in Windows:\n\tCDisplayWindow3D window(\"ICP-3D demo: scene\", 500, 500);\n\tCDisplayWindow3D window2(\"ICP-3D demo: UNALIGNED scans\", 500, 500);\n\tCDisplayWindow3D window3(\"ICP-3D demo: ICP-ALIGNED scans\", 500, 500);\n\n\twindow.setPos(10, 10);\n\twindow2.setPos(530, 10);\n\twindow3.setPos(10, 520);\n\n\twindow.get3DSceneAndLock() = scene1;\n\twindow.unlockAccess3DScene();\n\n\twindow2.get3DSceneAndLock() = scene2;\n\twindow2.unlockAccess3DScene();\n\n\twindow3.get3DSceneAndLock() = scene3;\n\twindow3.unlockAccess3DScene();\n\n\tstd::this_thread::sleep_for(20ms);\n\twindow.forceRepaint();\n\twindow2.forceRepaint();\n\n\twindow.setCameraElevationDeg(15);\n\twindow.setCameraAzimuthDeg(90);\n\twindow.setCameraZoom(15);\n\n\twindow2.setCameraElevationDeg(15);\n\twindow2.setCameraAzimuthDeg(90);\n\twindow2.setCameraZoom(15);\n\n\twindow3.setCameraElevationDeg(15);\n\twindow3.setCameraAzimuthDeg(90);\n\twindow3.setCameraZoom(15);\n\n\tcout << \"Press any key to exit...\" << endl;\n\twindow.waitForKey();\n}\n\nint main()\n{\n\ttry\n\t{\n\t\ttest_icp3D();\n\t\treturn 0;\n\t}\n\tcatch (exception& e)\n\t{\n\t\tcout << \"Error: \" << e.what() << '.' << endl;\n\t\treturn -1;\n\t}\n\tcatch (...)\n\t{\n\t\tcout << \"Unknown Error.\\n\";\n\t\treturn -1;\n\t}\n}\n<commit_msg>Fix slam_icp3d_simple_example<commit_after>\/* +------------------------------------------------------------------------+\n | Mobile Robot Programming Toolkit (MRPT) |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2018, Individual contributors, see AUTHORS file |\n | See: http:\/\/www.mrpt.org\/Authors - All rights reserved. |\n | Released under BSD License. See details in http:\/\/www.mrpt.org\/License |\n +------------------------------------------------------------------------+ *\/\n\n\/**\n * icp3d\n * Execute an Iterative Closest Point algorithm using two 3D point clouds.\n *\/\n\n#include <mrpt\/slam\/CICP.h>\n\n#include <mrpt\/poses\/CPose3DPDF.h>\n#include <mrpt\/obs\/CObservation2DRangeScan.h>\n#include <mrpt\/maps\/CSimplePointsMap.h>\n#include <mrpt\/gui\/CDisplayWindow3D.h>\n#include <mrpt\/opengl\/CGridPlaneXY.h>\n#include <mrpt\/opengl\/CSphere.h>\n#include <mrpt\/opengl\/CAngularObservationMesh.h>\n#include <mrpt\/opengl\/CDisk.h>\n#include <mrpt\/opengl\/stock_objects.h>\n#include <iostream>\n\nusing namespace std;\nusing namespace mrpt;\nusing namespace mrpt::gui;\nusing namespace mrpt::opengl;\nusing namespace mrpt::poses;\nusing namespace mrpt::slam;\nusing namespace mrpt::maps;\nusing namespace mrpt::obs;\n\n\/\/ Increase this values to get more precision. It will also increase run time.\nconst size_t HOW_MANY_YAWS = 120;\nconst size_t HOW_MANY_PITCHS = 120;\n\n\/\/ The scans of the 3D object, taken from 2 different places:\nvector<CObservation2DRangeScan> sequence_scans1, sequence_scans2;\n\n\/\/ The two origins for the 3D scans\nCPose3D viewpoint1(-0.3, 0.7, 3, DEG2RAD(5), DEG2RAD(80), DEG2RAD(3));\nCPose3D viewpoint2(0.5, -0.2, 2.6, DEG2RAD(-5), DEG2RAD(100), DEG2RAD(-7));\n\nCPose3D SCAN2_POSE_ERROR(0.15, -0.07, 0.10, -0.03, 0.1, 0.1);\n\n\/**\n * Generate 3 objects to work with - 1 sphere, 2 disks\n *\/\nvoid generateObjects(CSetOfObjects::Ptr& world)\n{\n\tCSphere::Ptr sph = mrpt::make_aligned_shared<CSphere>(0.5);\n\tsph->setLocation(0, 0, 0);\n\tsph->setColor(1, 0, 0);\n\tworld->insert(sph);\n\n\tCDisk::Ptr pln = mrpt::make_aligned_shared<opengl::CDisk>();\n\tpln->setDiskRadius(2);\n\tpln->setPose(CPose3D(0, 0, 0, 0, DEG2RAD(5), DEG2RAD(5)));\n\tpln->setColor(0.8, 0, 0);\n\tworld->insert(pln);\n\n\t{\n\t\tCDisk::Ptr pln = mrpt::make_aligned_shared<opengl::CDisk>();\n\t\tpln->setDiskRadius(2);\n\t\tpln->setPose(CPose3D(0, 0, 0, DEG2RAD(30), DEG2RAD(-20), DEG2RAD(-2)));\n\t\tpln->setColor(0.9, 0, 0);\n\t\tworld->insert(pln);\n\t}\n}\n\nvoid test_icp3D()\n{\n\t\/\/ Create the reference objects:\n\tCOpenGLScene::Ptr scene1 = mrpt::make_aligned_shared<COpenGLScene>();\n\tCOpenGLScene::Ptr scene2 = mrpt::make_aligned_shared<COpenGLScene>();\n\tCOpenGLScene::Ptr scene3 = mrpt::make_aligned_shared<COpenGLScene>();\n\n\topengl::CGridPlaneXY::Ptr plane1 =\n\t\tmrpt::make_aligned_shared<CGridPlaneXY>(-20, 20, -20, 20, 0, 1);\n\tplane1->setColor(0.3, 0.3, 0.3);\n\tscene1->insert(plane1);\n\tscene2->insert(plane1);\n\tscene3->insert(plane1);\n\n\tCSetOfObjects::Ptr world = mrpt::make_aligned_shared<CSetOfObjects>();\n\tgenerateObjects(world);\n\tscene1->insert(world);\n\n\t\/\/ Perform the 3D scans:\n\tCAngularObservationMesh::Ptr aom1 =\n\t\tmrpt::make_aligned_shared<CAngularObservationMesh>();\n\tCAngularObservationMesh::Ptr aom2 =\n\t\tmrpt::make_aligned_shared<CAngularObservationMesh>();\n\n\tcout << \"Performing ray-tracing...\" << endl;\n\tCAngularObservationMesh::trace2DSetOfRays(\n\t\tscene1, viewpoint1, aom1,\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_PITCHS),\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_YAWS));\n\tCAngularObservationMesh::trace2DSetOfRays(\n\t\tscene1, viewpoint2, aom2,\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_PITCHS),\n\t\tCAngularObservationMesh::TDoubleRange::CreateFromAperture(\n\t\t\tM_PI, HOW_MANY_YAWS));\n\tcout << \"Ray-tracing done\" << endl;\n\n\t\/\/ Put the viewpoints origins:\n\t{\n\t\tCSetOfObjects::Ptr origin1 = opengl::stock_objects::CornerXYZ();\n\t\torigin1->setPose(viewpoint1);\n\t\torigin1->setScale(0.6);\n\t\tscene1->insert(origin1);\n\t\tscene2->insert(origin1);\n\t}\n\t{\n\t\tCSetOfObjects::Ptr origin2 = opengl::stock_objects::CornerXYZ();\n\t\torigin2->setPose(viewpoint2);\n\t\torigin2->setScale(0.6);\n\t\tscene1->insert(origin2);\n\t\tscene2->insert(origin2);\n\t}\n\n\t\/\/ Show the scanned points:\n\tCSimplePointsMap M1, M2;\n\n\taom1->generatePointCloud(&M1);\n\taom2->generatePointCloud(&M2);\n\n\t\/\/ Create the wrongly-localized M2:\n\tCSimplePointsMap M2_noisy;\n\tM2_noisy = M2;\n\tM2_noisy.changeCoordinatesReference(SCAN2_POSE_ERROR);\n\n\tCSetOfObjects::Ptr PTNS1 = mrpt::make_aligned_shared<CSetOfObjects>();\n\tCSetOfObjects::Ptr PTNS2 = mrpt::make_aligned_shared<CSetOfObjects>();\n\n\tM1.renderOptions.color = mrpt::img::TColorf(1, 0, 0);\n\tM1.getAs3DObject(PTNS1);\n\n\tM2_noisy.renderOptions.color = mrpt::img::TColorf(0, 0, 1);\n\tM2_noisy.getAs3DObject(PTNS2);\n\n\tscene2->insert(PTNS1);\n\tscene2->insert(PTNS2);\n\n\t\/\/ --------------------------------------\n\t\/\/ Do the ICP-3D\n\t\/\/ --------------------------------------\n\tfloat run_time;\n\tCICP icp;\n\tCICP::TReturnInfo icp_info;\n\n\ticp.options.thresholdDist = 0.40;\n\ticp.options.thresholdAng = 0;\n\n\tstd::vector<double> xs, ys, zs;\n\tM1.getAllPoints(xs, ys, ys);\n\tcout << \"Size of xs in M1: \" << xs.size() << endl;\n\tM2.getAllPoints(xs, ys, ys);\n\tcout << \"Size of xs in M2: \" << xs.size() << endl;\n\n\tCPose3DPDF::Ptr pdf = icp.Align3D(\n\t\t&M2_noisy, \/\/ Map to align\n\t\t&M1, \/\/ Reference map\n\t\tCPose3D(), \/\/ Initial gross estimate\n\t\t&run_time, &icp_info);\n\n\tCPose3D mean = pdf->getMeanVal();\n\n\tcout << \"ICP run took \" << run_time << \" secs.\" << endl;\n\tcout << \"Goodness: \" << 100 * icp_info.goodness\n\t\t << \"% , # of iterations= \" << icp_info.nIterations\n\t\t << \" Quality: \" << icp_info.quality << endl;\n\tcout << \"ICP output: mean= \" << mean << endl;\n\tcout << \"Real displacement: \" << SCAN2_POSE_ERROR << endl;\n\n\t\/\/ Aligned maps:\n\tCSetOfObjects::Ptr PTNS2_ALIGN = mrpt::make_aligned_shared<CSetOfObjects>();\n\n\tM2_noisy.changeCoordinatesReference(CPose3D() - mean);\n\tM2_noisy.getAs3DObject(PTNS2_ALIGN);\n\n\tscene3->insert(PTNS1);\n\tscene3->insert(PTNS2_ALIGN);\n\n\t\/\/ Show in Windows:\n\tCDisplayWindow3D window(\"ICP-3D demo: scene\", 500, 500);\n\tCDisplayWindow3D window2(\"ICP-3D demo: UNALIGNED scans\", 500, 500);\n\tCDisplayWindow3D window3(\"ICP-3D demo: ICP-ALIGNED scans\", 500, 500);\n\n\twindow.setPos(10, 10);\n\twindow2.setPos(530, 10);\n\twindow3.setPos(10, 520);\n\n\twindow.get3DSceneAndLock() = scene1;\n\twindow.unlockAccess3DScene();\n\n\twindow2.get3DSceneAndLock() = scene2;\n\twindow2.unlockAccess3DScene();\n\n\twindow3.get3DSceneAndLock() = scene3;\n\twindow3.unlockAccess3DScene();\n\n\tstd::this_thread::sleep_for(20ms);\n\twindow.forceRepaint();\n\twindow2.forceRepaint();\n\n\twindow.setCameraElevationDeg(15);\n\twindow.setCameraAzimuthDeg(90);\n\twindow.setCameraZoom(15);\n\n\twindow2.setCameraElevationDeg(15);\n\twindow2.setCameraAzimuthDeg(90);\n\twindow2.setCameraZoom(15);\n\n\twindow3.setCameraElevationDeg(15);\n\twindow3.setCameraAzimuthDeg(90);\n\twindow3.setCameraZoom(15);\n\n\tcout << \"Press any key to exit...\" << endl;\n\twindow.waitForKey();\n}\n\nint main()\n{\n\ttry\n\t{\n\t\ttest_icp3D();\n\t\treturn 0;\n\t}\n\tcatch (exception& e)\n\t{\n\t\tcout << \"Error: \" << e.what() << '.' << endl;\n\t\treturn -1;\n\t}\n\tcatch (...)\n\t{\n\t\tcout << \"Unknown Error.\\n\";\n\t\treturn -1;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"sandbox\/win\/sandbox_poc\/pocdll\/exports.h\"\n#include \"sandbox\/win\/sandbox_poc\/pocdll\/utils.h\"\n\n\/\/ This file contains the tests used to verify the security of the registry.\n\n\/\/ Converts an HKEY to a string. This is using the lazy way and works only\n\/\/ for the main hives.\n\/\/ \"key\" is the hive to convert to string.\n\/\/ The return value is the string corresponding to the hive or \"unknown\"\nconst wchar_t *HKEYToString(const HKEY key) {\n switch (reinterpret_cast<LONG_PTR>(key)) {\n case reinterpret_cast<LONG_PTR>(HKEY_CLASSES_ROOT):\n return L\"HKEY_CLASSES_ROOT\";\n case reinterpret_cast<LONG_PTR>(HKEY_CURRENT_CONFIG):\n return L\"HKEY_CURRENT_CONFIG\";\n case reinterpret_cast<LONG_PTR>(HKEY_CURRENT_USER):\n return L\"HKEY_CURRENT_USER\";\n case reinterpret_cast<LONG_PTR>(HKEY_LOCAL_MACHINE):\n return L\"HKEY_LOCAL_MACHINE\";\n case reinterpret_cast<LONG_PTR>(HKEY_USERS):\n return L\"HKEY_USERS\";\n }\n return L\"unknown\";\n}\n\n\/\/ Tries to open the key hive\\path and outputs the result.\n\/\/ \"output\" is the stream used for logging.\nvoid TryOpenKey(const HKEY hive, const wchar_t *path, FILE *output) {\n HKEY key;\n LONG err_code = ::RegOpenKeyEx(hive,\n path,\n 0, \/\/ Reserved, must be 0.\n MAXIMUM_ALLOWED,\n &key);\n if (ERROR_SUCCESS == err_code) {\n fprintf(output, \"[GRANTED] Opening key \\\"%S\\\\%S\\\". Handle 0x%p\\r\\n\",\n HKEYToString(hive),\n path,\n key);\n ::RegCloseKey(key);\n } else {\n fprintf(output, \"[BLOCKED] Opening key \\\"%S\\\\%S\\\". Error %ld\\r\\n\",\n HKEYToString(hive),\n path,\n err_code);\n }\n}\n\nvoid POCDLL_API TestRegistry(HANDLE log) {\n HandleToFile handle2file;\n FILE *output = handle2file.Translate(log, \"w\");\n\n TryOpenKey(HKEY_LOCAL_MACHINE, NULL, output);\n TryOpenKey(HKEY_CURRENT_USER, NULL, output);\n TryOpenKey(HKEY_USERS, NULL, output);\n TryOpenKey(HKEY_LOCAL_MACHINE,\n L\"Software\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\\\\WinLogon\",\n output);\n}\n<commit_msg>More compiler whack-a-mole.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"sandbox\/win\/sandbox_poc\/pocdll\/exports.h\"\n#include \"sandbox\/win\/sandbox_poc\/pocdll\/utils.h\"\n\n\/\/ This file contains the tests used to verify the security of the registry.\n\n\/\/ Tries to open the key hive\\path and outputs the result.\n\/\/ \"output\" is the stream used for logging.\nvoid TryOpenKey(const HKEY hive,\n const wchar_t* hive_name,\n const wchar_t* path,\n FILE* output) {\n HKEY key;\n LONG err_code = ::RegOpenKeyEx(hive,\n path,\n 0, \/\/ Reserved, must be 0.\n MAXIMUM_ALLOWED,\n &key);\n if (ERROR_SUCCESS == err_code) {\n fprintf(output,\n \"[GRANTED] Opening key \\\"%S\\\\%S\\\". Handle 0x%p\\r\\n\",\n hive_name,\n path,\n key);\n ::RegCloseKey(key);\n } else {\n fprintf(output,\n \"[BLOCKED] Opening key \\\"%S\\\\%S\\\". Error %ld\\r\\n\",\n hive_name,\n path,\n err_code);\n }\n}\n\nvoid POCDLL_API TestRegistry(HANDLE log) {\n HandleToFile handle2file;\n FILE *output = handle2file.Translate(log, \"w\");\n\n TryOpenKey(HKEY_LOCAL_MACHINE, L\"HKEY_LOCAL_MACHINE\", NULL, output);\n TryOpenKey(HKEY_CURRENT_USER, L\"HKEY_CURRENT_USER\", NULL, output);\n TryOpenKey(HKEY_USERS, L\"HKEY_USERS\", NULL, output);\n TryOpenKey(HKEY_LOCAL_MACHINE,\n L\"HKEY_LOCAL_MACHINE\",\n L\"Software\\\\Microsoft\\\\Windows NT\\\\CurrentVersion\\\\WinLogon\",\n output);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 The Ray Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"ray\/util\/logging.h\"\n\n#include <chrono>\n#include <cstdlib>\n#include <iostream>\n\n#include \"absl\/strings\/str_format.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"ray\/util\/filesystem.h\"\n\nusing namespace testing;\n\nnamespace ray {\n\nint64_t current_time_ms() {\n std::chrono::milliseconds ms_since_epoch =\n std::chrono::duration_cast<std::chrono::milliseconds>(\n std::chrono::steady_clock::now().time_since_epoch());\n return ms_since_epoch.count();\n}\n\n\/\/ This is not really test.\n\/\/ This file just print some information using the logging macro.\n\nvoid PrintLog() {\n RAY_LOG(DEBUG) << \"This is the\"\n << \" DEBUG\"\n << \" message\";\n RAY_LOG(INFO) << \"This is the\"\n << \" INFO message\";\n RAY_LOG(WARNING) << \"This is the\"\n << \" WARNING message\";\n RAY_LOG(ERROR) << \"This is the\"\n << \" ERROR message\";\n RAY_CHECK(true) << \"This is a RAY_CHECK\"\n << \" message but it won't show up\";\n \/\/ The following 2 lines should not run since it will cause program failure.\n \/\/ RAY_LOG(FATAL) << \"This is the FATAL message\";\n \/\/ RAY_CHECK(false) << \"This is a RAY_CHECK message but it won't show up\";\n}\n\nTEST(PrintLogTest, LogTestWithoutInit) {\n \/\/ Without RayLog::StartRayLog, this should also work.\n PrintLog();\n}\n\n#if GTEST_HAS_STREAM_REDIRECTION\nusing testing::internal::CaptureStderr;\nusing testing::internal::GetCapturedStderr;\n\nnamespace {\nvoid VerifyOnlyNthOccurenceLogged(bool fallback_to_debug) {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n static int non_fallback_counter = 0;\n static int fallback_counter = 0;\n int &counter = fallback_to_debug ? fallback_counter : non_fallback_counter;\n for (int i = 0; i < 9; i++) {\n counter++;\n if (fallback_to_debug) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n } else {\n RAY_LOG_EVERY_N(INFO, 3) << kLogStr;\n }\n }\n std::string output = GetCapturedStderr();\n for (int i = counter - 8; i <= counter; i++) {\n std::string expected_str = absl::StrFormat(\"[%d] this is a test log\", i);\n if (i % 3 == 1) {\n EXPECT_THAT(output, HasSubstr(expected_str));\n } else {\n EXPECT_THAT(output, Not(HasSubstr(expected_str)));\n }\n }\n\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 3);\n}\n\nvoid VerifyAllOccurenceLogged() {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n for (int i = 0; i < 10; i++) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n }\n std::string output = GetCapturedStderr();\n size_t occurrences = 0;\n std::string::size_type start = 0;\n while ((start = output.find(\"[0] this is a test log\", start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 10);\n}\n\nvoid VerifyNothingLogged(bool fallback_to_debug) {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n for (int i = 0; i < 10; i++) {\n if (fallback_to_debug) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n } else {\n RAY_LOG_EVERY_N(INFO, 3) << kLogStr;\n };\n }\n std::string output = GetCapturedStderr();\n\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 0);\n}\n} \/\/ namespace\n\nTEST(PrintLogTest, TestRayLogEveryN) {\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::DEBUG;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::WARNING;\n VerifyNothingLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n}\n\nTEST(PrintLogTest, TestRayLogEveryNOrDebug) {\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ true);\n\n RayLog::severity_threshold_ = RayLogLevel::DEBUG;\n VerifyAllOccurenceLogged();\n\n RayLog::severity_threshold_ = RayLogLevel::WARNING;\n VerifyNothingLogged(\/*fallback_to_debug*\/ true);\n\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n}\n\nTEST(PrintLogTest, TestRayLogEveryMs) {\n CaptureStderr();\n const std::string kLogStr = \"this is a test log\";\n auto start_time = std::chrono::steady_clock::now().time_since_epoch();\n size_t num_iterations = 0;\n while (std::chrono::steady_clock::now().time_since_epoch() - start_time <\n std::chrono::milliseconds(100)) {\n num_iterations++;\n RAY_LOG_EVERY_MS(INFO, 10) << kLogStr;\n }\n std::string output = GetCapturedStderr();\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_LT(occurrences, num_iterations);\n EXPECT_GT(occurrences, 5);\n EXPECT_LT(occurrences, 15);\n}\n\n#endif \/* GTEST_HAS_STREAM_REDIRECTION *\/\n\nTEST(PrintLogTest, LogTestWithInit) {\n \/\/ Test empty app name.\n RayLog::StartRayLog(\"\", RayLogLevel::DEBUG, ray::GetUserTempDir());\n PrintLog();\n RayLog::ShutDownRayLog();\n}\n\n\/\/ This test will output large amount of logs to stderr, should be disabled in travis.\nTEST(LogPerfTest, PerfTest) {\n RayLog::StartRayLog(\n \"\/fake\/path\/to\/appdire\/LogPerfTest\", RayLogLevel::ERROR, ray::GetUserTempDir());\n int rounds = 10;\n\n int64_t start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_LOG(DEBUG) << \"This is the \"\n << \"RAY_DEBUG message\";\n }\n int64_t elapsed = current_time_ms() - start_time;\n std::cout << \"Testing DEBUG log for \" << rounds << \" rounds takes \" << elapsed << \" ms.\"\n << std::endl;\n\n start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_LOG(ERROR) << \"This is the \"\n << \"RAY_ERROR message\";\n }\n elapsed = current_time_ms() - start_time;\n std::cout << \"Testing RAY_ERROR log for \" << rounds << \" rounds takes \" << elapsed\n << \" ms.\" << std::endl;\n\n start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_CHECK(i >= 0) << \"This is a RAY_CHECK \"\n << \"message but it won't show up\";\n }\n elapsed = current_time_ms() - start_time;\n std::cout << \"Testing RAY_CHECK(true) for \" << rounds << \" rounds takes \" << elapsed\n << \" ms.\" << std::endl;\n RayLog::ShutDownRayLog();\n}\n\nTEST(PrintLogTest, TestCheckOp) {\n int i = 1;\n RAY_CHECK_EQ(i, 1);\n ASSERT_DEATH(RAY_CHECK_EQ(i, 2), \"1 vs 2\");\n\n RAY_CHECK_NE(i, 0);\n ASSERT_DEATH(RAY_CHECK_NE(i, 1), \"1 vs 1\");\n\n RAY_CHECK_LE(i, 1);\n ASSERT_DEATH(RAY_CHECK_LE(i, 0), \"1 vs 0\");\n\n RAY_CHECK_LT(i, 2);\n ASSERT_DEATH(RAY_CHECK_LT(i, 1), \"1 vs 1\");\n\n RAY_CHECK_GE(i, 1);\n ASSERT_DEATH(RAY_CHECK_GE(i, 2), \"1 vs 2\");\n\n RAY_CHECK_GT(i, 0);\n ASSERT_DEATH(RAY_CHECK_GT(i, 1), \"1 vs 1\");\n\n int j = 0;\n RAY_CHECK_NE(i, j);\n ASSERT_DEATH(RAY_CHECK_EQ(i, j), \"1 vs 0\");\n}\n\nstd::string TestFunctionLevel0() {\n std::ostringstream oss;\n oss << ray::StackTrace();\n std::string stack_trace = oss.str();\n RAY_LOG(INFO) << \"TestFunctionLevel0\\n\" << stack_trace;\n return stack_trace;\n}\n\nstd::string TestFunctionLevel1() {\n RAY_LOG(INFO) << \"TestFunctionLevel1:\";\n return TestFunctionLevel0();\n}\n\nstd::string TestFunctionLevel2() {\n RAY_LOG(INFO) << \"TestFunctionLevel2:\";\n return TestFunctionLevel1();\n}\n\nTEST(PrintLogTest, TestStackTrace) {\n auto ret0 = TestFunctionLevel0();\n EXPECT_TRUE(ret0.find(\"TestFunctionLevel0\") != std::string::npos) << ret0;\n auto ret1 = TestFunctionLevel1();\n EXPECT_TRUE(ret1.find(\"TestFunctionLevel1\") != std::string::npos) << ret1;\n auto ret2 = TestFunctionLevel2();\n EXPECT_TRUE(ret2.find(\"TestFunctionLevel2\") != std::string::npos) << ret2;\n}\n\nint TerminateHandlerLevel0() {\n RAY_LOG(INFO) << \"TerminateHandlerLevel0\";\n auto terminate_handler = std::get_terminate();\n (*terminate_handler)();\n return 0;\n}\n\nint TerminateHandlerLevel1() {\n RAY_LOG(INFO) << \"TerminateHandlerLevel1\";\n TerminateHandlerLevel0();\n return 1;\n}\n\nTEST(PrintLogTest, TestTerminateHandler) {\n ray::RayLog::InstallTerminateHandler();\n ASSERT_DEATH(TerminateHandlerLevel1(),\n \".*TerminateHandlerLevel0.*TerminateHandlerLevel1.*\");\n}\n\nTEST(PrintLogTest, TestFailureSignalHandler) {\n ray::RayLog::InstallFailureSignalHandler(nullptr);\n ASSERT_DEATH(abort(), \".*SIGABRT received.*\");\n}\n\n} \/\/ namespace ray\n\nint main(int argc, char **argv) {\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>Disable stack trace logging tests for windows (#26488)<commit_after>\/\/ Copyright 2017 The Ray Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"ray\/util\/logging.h\"\n\n#include <chrono>\n#include <cstdlib>\n#include <iostream>\n\n#include \"absl\/strings\/str_format.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"ray\/util\/filesystem.h\"\n\nusing namespace testing;\n\nnamespace ray {\n\nint64_t current_time_ms() {\n std::chrono::milliseconds ms_since_epoch =\n std::chrono::duration_cast<std::chrono::milliseconds>(\n std::chrono::steady_clock::now().time_since_epoch());\n return ms_since_epoch.count();\n}\n\n\/\/ This is not really test.\n\/\/ This file just print some information using the logging macro.\n\nvoid PrintLog() {\n RAY_LOG(DEBUG) << \"This is the\"\n << \" DEBUG\"\n << \" message\";\n RAY_LOG(INFO) << \"This is the\"\n << \" INFO message\";\n RAY_LOG(WARNING) << \"This is the\"\n << \" WARNING message\";\n RAY_LOG(ERROR) << \"This is the\"\n << \" ERROR message\";\n RAY_CHECK(true) << \"This is a RAY_CHECK\"\n << \" message but it won't show up\";\n \/\/ The following 2 lines should not run since it will cause program failure.\n \/\/ RAY_LOG(FATAL) << \"This is the FATAL message\";\n \/\/ RAY_CHECK(false) << \"This is a RAY_CHECK message but it won't show up\";\n}\n\nTEST(PrintLogTest, LogTestWithoutInit) {\n \/\/ Without RayLog::StartRayLog, this should also work.\n PrintLog();\n}\n\n#if GTEST_HAS_STREAM_REDIRECTION\nusing testing::internal::CaptureStderr;\nusing testing::internal::GetCapturedStderr;\n\nnamespace {\nvoid VerifyOnlyNthOccurenceLogged(bool fallback_to_debug) {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n static int non_fallback_counter = 0;\n static int fallback_counter = 0;\n int &counter = fallback_to_debug ? fallback_counter : non_fallback_counter;\n for (int i = 0; i < 9; i++) {\n counter++;\n if (fallback_to_debug) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n } else {\n RAY_LOG_EVERY_N(INFO, 3) << kLogStr;\n }\n }\n std::string output = GetCapturedStderr();\n for (int i = counter - 8; i <= counter; i++) {\n std::string expected_str = absl::StrFormat(\"[%d] this is a test log\", i);\n if (i % 3 == 1) {\n EXPECT_THAT(output, HasSubstr(expected_str));\n } else {\n EXPECT_THAT(output, Not(HasSubstr(expected_str)));\n }\n }\n\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 3);\n}\n\nvoid VerifyAllOccurenceLogged() {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n for (int i = 0; i < 10; i++) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n }\n std::string output = GetCapturedStderr();\n size_t occurrences = 0;\n std::string::size_type start = 0;\n while ((start = output.find(\"[0] this is a test log\", start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 10);\n}\n\nvoid VerifyNothingLogged(bool fallback_to_debug) {\n const std::string kLogStr = \"this is a test log\";\n CaptureStderr();\n for (int i = 0; i < 10; i++) {\n if (fallback_to_debug) {\n RAY_LOG_EVERY_N_OR_DEBUG(INFO, 3) << kLogStr;\n } else {\n RAY_LOG_EVERY_N(INFO, 3) << kLogStr;\n };\n }\n std::string output = GetCapturedStderr();\n\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_EQ(occurrences, 0);\n}\n} \/\/ namespace\n\nTEST(PrintLogTest, TestRayLogEveryN) {\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::DEBUG;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::WARNING;\n VerifyNothingLogged(\/*fallback_to_debug*\/ false);\n\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n}\n\nTEST(PrintLogTest, TestRayLogEveryNOrDebug) {\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n VerifyOnlyNthOccurenceLogged(\/*fallback_to_debug*\/ true);\n\n RayLog::severity_threshold_ = RayLogLevel::DEBUG;\n VerifyAllOccurenceLogged();\n\n RayLog::severity_threshold_ = RayLogLevel::WARNING;\n VerifyNothingLogged(\/*fallback_to_debug*\/ true);\n\n RayLog::severity_threshold_ = RayLogLevel::INFO;\n}\n\nTEST(PrintLogTest, TestRayLogEveryMs) {\n CaptureStderr();\n const std::string kLogStr = \"this is a test log\";\n auto start_time = std::chrono::steady_clock::now().time_since_epoch();\n size_t num_iterations = 0;\n while (std::chrono::steady_clock::now().time_since_epoch() - start_time <\n std::chrono::milliseconds(100)) {\n num_iterations++;\n RAY_LOG_EVERY_MS(INFO, 10) << kLogStr;\n }\n std::string output = GetCapturedStderr();\n size_t occurrences = 0;\n std::string::size_type start = 0;\n\n while ((start = output.find(kLogStr, start)) != std::string::npos) {\n ++occurrences;\n start += kLogStr.length();\n }\n EXPECT_LT(occurrences, num_iterations);\n EXPECT_GT(occurrences, 5);\n EXPECT_LT(occurrences, 15);\n}\n\n#endif \/* GTEST_HAS_STREAM_REDIRECTION *\/\n\nTEST(PrintLogTest, LogTestWithInit) {\n \/\/ Test empty app name.\n RayLog::StartRayLog(\"\", RayLogLevel::DEBUG, ray::GetUserTempDir());\n PrintLog();\n RayLog::ShutDownRayLog();\n}\n\n\/\/ This test will output large amount of logs to stderr, should be disabled in travis.\nTEST(LogPerfTest, PerfTest) {\n RayLog::StartRayLog(\n \"\/fake\/path\/to\/appdire\/LogPerfTest\", RayLogLevel::ERROR, ray::GetUserTempDir());\n int rounds = 10;\n\n int64_t start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_LOG(DEBUG) << \"This is the \"\n << \"RAY_DEBUG message\";\n }\n int64_t elapsed = current_time_ms() - start_time;\n std::cout << \"Testing DEBUG log for \" << rounds << \" rounds takes \" << elapsed << \" ms.\"\n << std::endl;\n\n start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_LOG(ERROR) << \"This is the \"\n << \"RAY_ERROR message\";\n }\n elapsed = current_time_ms() - start_time;\n std::cout << \"Testing RAY_ERROR log for \" << rounds << \" rounds takes \" << elapsed\n << \" ms.\" << std::endl;\n\n start_time = current_time_ms();\n for (int i = 0; i < rounds; ++i) {\n RAY_CHECK(i >= 0) << \"This is a RAY_CHECK \"\n << \"message but it won't show up\";\n }\n elapsed = current_time_ms() - start_time;\n std::cout << \"Testing RAY_CHECK(true) for \" << rounds << \" rounds takes \" << elapsed\n << \" ms.\" << std::endl;\n RayLog::ShutDownRayLog();\n}\n\nTEST(PrintLogTest, TestCheckOp) {\n int i = 1;\n RAY_CHECK_EQ(i, 1);\n ASSERT_DEATH(RAY_CHECK_EQ(i, 2), \"1 vs 2\");\n\n RAY_CHECK_NE(i, 0);\n ASSERT_DEATH(RAY_CHECK_NE(i, 1), \"1 vs 1\");\n\n RAY_CHECK_LE(i, 1);\n ASSERT_DEATH(RAY_CHECK_LE(i, 0), \"1 vs 0\");\n\n RAY_CHECK_LT(i, 2);\n ASSERT_DEATH(RAY_CHECK_LT(i, 1), \"1 vs 1\");\n\n RAY_CHECK_GE(i, 1);\n ASSERT_DEATH(RAY_CHECK_GE(i, 2), \"1 vs 2\");\n\n RAY_CHECK_GT(i, 0);\n ASSERT_DEATH(RAY_CHECK_GT(i, 1), \"1 vs 1\");\n\n int j = 0;\n RAY_CHECK_NE(i, j);\n ASSERT_DEATH(RAY_CHECK_EQ(i, j), \"1 vs 0\");\n}\n\n#ifndef _WIN32\nstd::string TestFunctionLevel0() {\n std::ostringstream oss;\n oss << ray::StackTrace();\n std::string stack_trace = oss.str();\n RAY_LOG(INFO) << \"TestFunctionLevel0\\n\" << stack_trace;\n return stack_trace;\n}\n\nstd::string TestFunctionLevel1() {\n RAY_LOG(INFO) << \"TestFunctionLevel1:\";\n return TestFunctionLevel0();\n}\n\nstd::string TestFunctionLevel2() {\n RAY_LOG(INFO) << \"TestFunctionLevel2:\";\n return TestFunctionLevel1();\n}\n\nTEST(PrintLogTest, TestStackTrace) {\n auto ret0 = TestFunctionLevel0();\n EXPECT_TRUE(ret0.find(\"TestFunctionLevel0\") != std::string::npos) << ret0;\n auto ret1 = TestFunctionLevel1();\n EXPECT_TRUE(ret1.find(\"TestFunctionLevel1\") != std::string::npos) << ret1;\n auto ret2 = TestFunctionLevel2();\n EXPECT_TRUE(ret2.find(\"TestFunctionLevel2\") != std::string::npos) << ret2;\n}\n\nint TerminateHandlerLevel0() {\n RAY_LOG(INFO) << \"TerminateHandlerLevel0\";\n auto terminate_handler = std::get_terminate();\n (*terminate_handler)();\n return 0;\n}\n\nint TerminateHandlerLevel1() {\n RAY_LOG(INFO) << \"TerminateHandlerLevel1\";\n TerminateHandlerLevel0();\n return 1;\n}\n\nTEST(PrintLogTest, TestTerminateHandler) {\n ray::RayLog::InstallTerminateHandler();\n ASSERT_DEATH(TerminateHandlerLevel1(),\n \".*TerminateHandlerLevel0.*TerminateHandlerLevel1.*\");\n}\n#endif\n\nTEST(PrintLogTest, TestFailureSignalHandler) {\n ray::RayLog::InstallFailureSignalHandler(nullptr);\n ASSERT_DEATH(abort(), \".*SIGABRT received.*\");\n}\n\n} \/\/ namespace ray\n\nint main(int argc, char **argv) {\n ::testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: XMLEventImportHelper.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 12:48:48 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _XMLOFF_EVENTIMPORTHELPER_HXX\n#define _XMLOFF_EVENTIMPORTHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLEVENT_HXX\n#include \"xmlevent.hxx\"\n#endif\n\n#include <map>\n#include <list>\n\n\nnamespace com { namespace sun { namespace star {\n namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLEventContextFactory;\nclass XMLEventsImportContext;\nstruct XMLEventNameTranslation;\n\ntypedef ::std::map< ::rtl::OUString, XMLEventContextFactory* > FactoryMap;\ntypedef ::std::map< XMLEventName, ::rtl::OUString > NameMap;\ntypedef ::std::list< NameMap* > NameMapList;\n\n\n\/**\n * Helps the XMLEventsImportContext.\n *\n * This class stores\n * a) the translation from XML event names to API event names, and\n * b) a mapping from script language names to XMLEventContextFactory objects\n * (that handle particular languages).\n *\n * Event name translation tables may be added, i.e. they will be joined\n * together. If different translations are needed (i.e., if the same XML name\n * needs to be translated to different API names in different contexts), then\n * translation tables may be saved on a translation table stack.\n *\/\nclass XMLEventImportHelper\n{\n \/\/\/ map of XMLEventContextFactory objects\n FactoryMap aFactoryMap;\n\n \/\/\/ map from XML to API names\n NameMap* pEventNameMap;\n\n \/\/\/ stack of previous aEventNameMap\n NameMapList aEventNameMapList;\n\npublic:\n XMLEventImportHelper();\n\n ~XMLEventImportHelper();\n\n \/\/\/ register a handler for a particular language type\n void RegisterFactory( const ::rtl::OUString& rLanguage,\n XMLEventContextFactory* aFactory );\n\n \/\/\/ add event name translation to the internal table\n void AddTranslationTable( const XMLEventNameTranslation* pTransTable );\n\n \/\/\/ save the old translation table on a stack and install an empty table\n void PushTranslationTable();\n\n \/\/\/ recover the top-most previously saved translation table\n void PopTranslationTable();\n\n \/\/\/ create an appropriate import context for a particular event\n SvXMLImportContext* CreateContext(\n SvXMLImport& rImport,\n sal_uInt16 nPrefix,\n const ::rtl::OUString& rLocalName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList,\n XMLEventsImportContext* rEvents,\n const ::rtl::OUString& rXmlEventName,\n const ::rtl::OUString& rLanguage);\n\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS vgbugs07 (1.4.276); FILE MERGED 2007\/06\/04 13:23:17 vg 1.4.276.1: #i76605# Remove -I ...\/inc\/module hack introduced by hedaburemove01<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: XMLEventImportHelper.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2007-06-27 14:39:33 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _XMLOFF_EVENTIMPORTHELPER_HXX\n#define _XMLOFF_EVENTIMPORTHELPER_HXX\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_HXX_\n#include <com\/sun\/star\/uno\/Reference.hxx>\n#endif\n\n#ifndef _XMLOFF_XMLEVENT_HXX\n#include <xmloff\/xmlevent.hxx>\n#endif\n\n#include <map>\n#include <list>\n\n\nnamespace com { namespace sun { namespace star {\n namespace xml { namespace sax { class XAttributeList; } }\n} } }\nnamespace rtl { class OUString; }\nclass XMLEventContextFactory;\nclass XMLEventsImportContext;\nstruct XMLEventNameTranslation;\n\ntypedef ::std::map< ::rtl::OUString, XMLEventContextFactory* > FactoryMap;\ntypedef ::std::map< XMLEventName, ::rtl::OUString > NameMap;\ntypedef ::std::list< NameMap* > NameMapList;\n\n\n\/**\n * Helps the XMLEventsImportContext.\n *\n * This class stores\n * a) the translation from XML event names to API event names, and\n * b) a mapping from script language names to XMLEventContextFactory objects\n * (that handle particular languages).\n *\n * Event name translation tables may be added, i.e. they will be joined\n * together. If different translations are needed (i.e., if the same XML name\n * needs to be translated to different API names in different contexts), then\n * translation tables may be saved on a translation table stack.\n *\/\nclass XMLEventImportHelper\n{\n \/\/\/ map of XMLEventContextFactory objects\n FactoryMap aFactoryMap;\n\n \/\/\/ map from XML to API names\n NameMap* pEventNameMap;\n\n \/\/\/ stack of previous aEventNameMap\n NameMapList aEventNameMapList;\n\npublic:\n XMLEventImportHelper();\n\n ~XMLEventImportHelper();\n\n \/\/\/ register a handler for a particular language type\n void RegisterFactory( const ::rtl::OUString& rLanguage,\n XMLEventContextFactory* aFactory );\n\n \/\/\/ add event name translation to the internal table\n void AddTranslationTable( const XMLEventNameTranslation* pTransTable );\n\n \/\/\/ save the old translation table on a stack and install an empty table\n void PushTranslationTable();\n\n \/\/\/ recover the top-most previously saved translation table\n void PopTranslationTable();\n\n \/\/\/ create an appropriate import context for a particular event\n SvXMLImportContext* CreateContext(\n SvXMLImport& rImport,\n sal_uInt16 nPrefix,\n const ::rtl::OUString& rLocalName,\n const ::com::sun::star::uno::Reference<\n ::com::sun::star::xml::sax::XAttributeList> & xAttrList,\n XMLEventsImportContext* rEvents,\n const ::rtl::OUString& rXmlEventName,\n const ::rtl::OUString& rLanguage);\n\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2012] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_UTIL_TERMINATE_HPP\n#define REALM_UTIL_TERMINATE_HPP\n\n#include <cstdlib>\n#include <sstream>\n#include <string>\n\n#include <realm\/util\/features.h>\n#include <realm\/version.hpp>\n\n#define REALM_TERMINATE(msg) realm::util::terminate((msg), __FILE__, __LINE__)\n\nnamespace realm {\nnamespace util {\nREALM_NORETURN void terminate_internal(std::stringstream&) noexcept;\n\nREALM_NORETURN inline void terminate(const char* message, const char* file, long line) noexcept\n{\n std::stringstream ss;\n ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \"\\n\";\n terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2) noexcept\n{\n std::stringstream ss;\n ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \" [\" << info1 << \", \" << info2 << \"]\\n\";\n terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2, T3 info3,\n T4 info4) noexcept\n{\n std::stringstream ss;\n ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message\n << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \" << info4 << \"]\\n\";\n terminate_internal(ss);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>\nREALM_NORETURN void terminate(const char* message, const char* file, long line, T1 info1, T2 info2, T3 info3,\n T4 info4, T5 info5, T6 info6) noexcept\n{\n std::stringstream ss;\n ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message\n << \" [\" << info1 << \", \" << info2 << \", \" << info3 << \", \"\n << info4 << \", \" << info5 << \", \" << info6 << \"]\\n\";\n terminate_internal(ss);\n}\n\n} \/\/ namespace util\n} \/\/ namespace realm\n\n#endif \/\/ REALM_UTIL_TERMINATE_HPP\n<commit_msg>Refactored util::terminate() to use variadics<commit_after>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2012] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_UTIL_TERMINATE_HPP\n#define REALM_UTIL_TERMINATE_HPP\n\n#include <cstdlib>\n#include <sstream>\n\n#include <realm\/util\/features.h>\n#include <realm\/version.hpp>\n\n#define REALM_TERMINATE(msg) realm::util::terminate((msg), __FILE__, __LINE__)\n\nnamespace realm {\nnamespace util {\nREALM_NORETURN void terminate_internal(std::stringstream&) noexcept;\n\nREALM_NORETURN inline void terminate(const char* message, const char* file, long line) noexcept\n{\n std::stringstream ss;\n ss << file << \":\" << line << \": \" REALM_VER_CHUNK \" \" << message << \"\\n\";\n terminate_internal(ss);\n}\n\ntemplate<typename T, typename... Ts>\nREALM_NORETURN void terminate(const char* message, const char* file, long line,\n T first_info, Ts... other_infos) noexcept\n{\n std::stringstream ss;\n using variadics_unpacker = int[];\n\n static_assert(sizeof...(other_infos) == 1 || sizeof...(other_infos) == 3 || sizeof...(other_infos) == 5,\n \"Called realm::util::terminate() with wrong number of arguments\");\n\n ss << file << ':' << line << \": \" REALM_VER_CHUNK \" \" << message << \" [\" << first_info;\n (void) variadics_unpacker { 0, (ss << \", \" << other_infos, void(), 0)... };\n ss << \"]\" << std::endl;\n\n terminate_internal(ss);\n}\n\n} \/\/ namespace util\n} \/\/ namespace realm\n\n#endif \/\/ REALM_UTIL_TERMINATE_HPP\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#include <bordrhdl.hxx>\n#include <sax\/tools\/converter.hxx>\n#include <xmloff\/xmltoken.hxx>\n#include <xmloff\/xmluconv.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/table\/BorderLine2.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::xmloff::token;\n\nconst sal_uInt16 API_LINE_SOLID = 0;\nconst sal_uInt16 API_LINE_DOTTED = 1;\nconst sal_uInt16 API_LINE_DASHED = 2;\nconst sal_uInt16 API_LINE_DOUBLE = 3;\nconst sal_uInt16 API_LINE_THINTHICK_SMALLGAP = 4;\nconst sal_uInt16 API_LINE_THINTHICK_MEDIUMGAP = 5;\nconst sal_uInt16 API_LINE_THINTHICK_LARGEGAP = 6;\nconst sal_uInt16 API_LINE_THICKTHIN_SMALLGAP = 7;\nconst sal_uInt16 API_LINE_THICKTHIN_MEDIUMGAP = 8;\nconst sal_uInt16 API_LINE_THICKTHIN_LARGEGAP = 9;\nconst sal_uInt16 API_LINE_EMBOSSED = 10;\nconst sal_uInt16 API_LINE_ENGRAVED = 11;\nconst sal_uInt16 API_LINE_OUTSET = 12;\nconst sal_uInt16 API_LINE_INSET = 13;\nconst sal_uInt16 API_LINE_FINE_DASHED = 14;\nconst sal_uInt16 API_LINE_NONE = USHRT_MAX;\n\n#define DEF_LINE_WIDTH_0 1\n#define DEF_LINE_WIDTH_1 35\n#define DEF_LINE_WIDTH_2 88\n\n#define SVX_XML_BORDER_WIDTH_THIN 0\n#define SVX_XML_BORDER_WIDTH_MIDDLE 1\n#define SVX_XML_BORDER_WIDTH_THICK 2\n\nSvXMLEnumMapEntry pXML_BorderStyles[] =\n{\n { XML_NONE, API_LINE_NONE },\n { XML_HIDDEN, API_LINE_NONE },\n { XML_SOLID, API_LINE_SOLID },\n { XML_DOUBLE, API_LINE_DOUBLE },\n { XML_DOTTED, API_LINE_DOTTED },\n { XML_DASHED, API_LINE_DASHED },\n { XML_GROOVE, API_LINE_ENGRAVED },\n { XML_RIDGE, API_LINE_EMBOSSED },\n { XML_INSET, API_LINE_INSET },\n { XML_OUTSET, API_LINE_OUTSET },\n { XML_FINE_DASHED, API_LINE_FINE_DASHED },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry pXML_NamedBorderWidths[] =\n{\n { XML_THIN, SVX_XML_BORDER_WIDTH_THIN },\n { XML_MIDDLE, SVX_XML_BORDER_WIDTH_MIDDLE },\n { XML_THICK, SVX_XML_BORDER_WIDTH_THICK },\n { XML_TOKEN_INVALID, 0 }\n};\n\/\/ mapping tables to map external xml input to internal box line widths\n\nstatic sal_uInt16 const aBorderWidths[] =\n{\n DEF_LINE_WIDTH_0,\n DEF_LINE_WIDTH_1,\n DEF_LINE_WIDTH_2\n};\n\nstatic void lcl_frmitems_setXMLBorderStyle( table::BorderLine2 & rBorderLine, sal_uInt16 nStyle )\n{\n sal_Int16 eStyle = -1; \/\/ None\n if ( nStyle != API_LINE_NONE )\n eStyle = sal_Int16( nStyle );\n\n rBorderLine.LineStyle = eStyle;\n}\n\n\/\/\n\/\/ class XMLEscapementPropHdl\n\/\/\n\nXMLBorderWidthHdl::~XMLBorderWidthHdl()\n{\n \/\/ nothing to do\n}\n\nbool XMLBorderWidthHdl::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n SvXMLTokenEnumerator aTokenEnum( rStrImpValue );\n\n sal_Int32 nInWidth, nDistance, nOutWidth;\n\n OUString aToken;\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nInWidth, aToken, 0, 500 ))\n return false;\n\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nDistance, aToken, 0, 500 ))\n return false;\n\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nOutWidth, aToken, 0, 500 ))\n return false;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n aBorderLine.Color = 0;\n\n aBorderLine.InnerLineWidth = sal::static_int_cast< sal_Int16 >(nInWidth);\n aBorderLine.OuterLineWidth = sal::static_int_cast< sal_Int16 >(nOutWidth);\n aBorderLine.LineDistance = sal::static_int_cast< sal_Int16 >(nDistance);\n\n rValue <<= aBorderLine;\n return true;\n}\n\nbool XMLBorderWidthHdl::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n OUStringBuffer aOut;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n return false;\n\n bool bDouble = false;\n switch ( aBorderLine.LineStyle )\n {\n case API_LINE_DOUBLE:\n case API_LINE_THINTHICK_SMALLGAP:\n case API_LINE_THINTHICK_MEDIUMGAP:\n case API_LINE_THINTHICK_LARGEGAP:\n case API_LINE_THICKTHIN_SMALLGAP:\n case API_LINE_THICKTHIN_MEDIUMGAP:\n case API_LINE_THICKTHIN_LARGEGAP:\n bDouble = true;\n break;\n default:\n break;\n }\n\n if( ( aBorderLine.LineDistance == 0 && aBorderLine.InnerLineWidth == 0 ) || !bDouble )\n return false;\n\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.InnerLineWidth );\n aOut.append( ' ' );\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.LineDistance );\n aOut.append( ' ' );\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.OuterLineWidth );\n\n rStrExpValue = aOut.makeStringAndClear();\n return true;\n}\n\n\/\/\n\/\/ class XMLEscapementHeightPropHdl\n\/\/\n\nXMLBorderHdl::~XMLBorderHdl()\n{\n \/\/ nothing to do\n}\n\nbool XMLBorderHdl::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n OUString aToken;\n SvXMLTokenEnumerator aTokens( rStrImpValue );\n\n bool bHasStyle = false;\n bool bHasWidth = false;\n bool bHasColor = false;\n\n sal_uInt16 nStyle = USHRT_MAX;\n sal_uInt16 nWidth = 0;\n sal_uInt16 nNamedWidth = USHRT_MAX;\n sal_Int32 nColor = 0;\n\n sal_Int32 nTemp;\n while( aTokens.getNextToken( aToken ) && !aToken.isEmpty() )\n {\n if( !bHasWidth &&\n rUnitConverter.convertEnum( nNamedWidth, aToken,\n pXML_NamedBorderWidths ) )\n {\n bHasWidth = true;\n }\n else if( !bHasStyle &&\n rUnitConverter.convertEnum( nStyle, aToken,\n pXML_BorderStyles ) )\n {\n bHasStyle = true;\n }\n else if (!bHasColor && ::sax::Converter::convertColor(nColor, aToken))\n {\n bHasColor = true;\n }\n else if( !bHasWidth &&\n rUnitConverter.convertMeasureToCore( nTemp, aToken, 0,\n USHRT_MAX ) )\n {\n nWidth = (sal_uInt16)nTemp;\n bHasWidth = true;\n }\n else\n {\n \/\/ missformed\n return false;\n }\n }\n\n \/\/ if there is no style or a different style than none but no width,\n \/\/ then the declaration is not valid.\n if( !bHasStyle || (API_LINE_NONE != nStyle && !bHasWidth) )\n return false;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n {\n aBorderLine.Color = 0;\n aBorderLine.InnerLineWidth = 0;\n aBorderLine.OuterLineWidth = 0;\n aBorderLine.LineDistance = 0;\n aBorderLine.LineWidth = 0;\n }\n\n \/\/ first of all, delete an empty line\n if( (bHasStyle && API_LINE_NONE == nStyle) ||\n (bHasWidth && USHRT_MAX == nNamedWidth && 0 == nWidth) )\n {\n aBorderLine.InnerLineWidth = 0;\n aBorderLine.OuterLineWidth = 0;\n aBorderLine.LineDistance = 0;\n aBorderLine.LineWidth = 0;\n }\n else if( bHasWidth )\n {\n if( USHRT_MAX != nNamedWidth )\n {\n aBorderLine.LineWidth = aBorderWidths[nNamedWidth];\n }\n else\n {\n aBorderLine.LineWidth = nWidth;\n lcl_frmitems_setXMLBorderStyle( aBorderLine, nStyle );\n }\n }\n else\n {\n aBorderLine.LineWidth = 0;\n lcl_frmitems_setXMLBorderStyle( aBorderLine, nStyle );\n }\n\n \/\/ set color\n if( bHasColor )\n {\n aBorderLine.Color = nColor;\n }\n\n rValue <<= aBorderLine;\n return true;\n}\n\nbool XMLBorderHdl::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& \/* rUnitConverter *\/ ) const\n{\n OUStringBuffer aOut;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n return false;\n\n sal_Int32 nWidth = aBorderLine.LineWidth;\n\n if( nWidth == 0 )\n {\n aOut.append( GetXMLToken( XML_NONE ) );\n }\n else\n {\n ::sax::Converter::convertMeasure( aOut, nWidth,\n util::MeasureUnit::MM_100TH, util::MeasureUnit::POINT);\n\n aOut.append( ' ' );\n\n XMLTokenEnum eStyleToken = XML_SOLID;\n switch ( aBorderLine.LineStyle )\n {\n case API_LINE_DASHED:\n eStyleToken = XML_DASHED;\n break;\n case API_LINE_DOTTED:\n eStyleToken = XML_DOTTED;\n break;\n case API_LINE_DOUBLE:\n case API_LINE_THINTHICK_SMALLGAP:\n case API_LINE_THINTHICK_MEDIUMGAP:\n case API_LINE_THINTHICK_LARGEGAP:\n case API_LINE_THICKTHIN_SMALLGAP:\n case API_LINE_THICKTHIN_MEDIUMGAP:\n case API_LINE_THICKTHIN_LARGEGAP:\n eStyleToken = XML_DOUBLE;\n break;\n case API_LINE_EMBOSSED:\n eStyleToken = XML_RIDGE;\n break;\n case API_LINE_ENGRAVED:\n eStyleToken = XML_GROOVE;\n break;\n case API_LINE_OUTSET:\n eStyleToken = XML_OUTSET;\n break;\n case API_LINE_INSET:\n eStyleToken = XML_INSET;\n break;\n case API_LINE_FINE_DASHED:\n eStyleToken = XML_FINE_DASHED;\n break;\n case API_LINE_SOLID:\n default:\n break;\n }\n aOut.append( GetXMLToken( eStyleToken ) );\n\n aOut.append( ' ' );\n\n ::sax::Converter::convertColor( aOut, aBorderLine.Color );\n }\n\n rStrExpValue = aOut.makeStringAndClear();\n\n return true;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Remove this duplicate and use the UNO constant values instead.<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * This file incorporates work covered by the following license notice:\n *\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed\n * with this work for additional information regarding copyright\n * ownership. The ASF licenses this file to you under the Apache\n * License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of\n * the License at http:\/\/www.apache.org\/licenses\/LICENSE-2.0 .\n *\/\n\n#include <bordrhdl.hxx>\n#include <sax\/tools\/converter.hxx>\n#include <xmloff\/xmltoken.hxx>\n#include <xmloff\/xmluconv.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/table\/BorderLine2.hpp>\n#include <com\/sun\/star\/table\/BorderLineStyle.hpp>\n\nusing namespace ::com::sun::star;\nusing namespace ::xmloff::token;\n\n#define DEF_LINE_WIDTH_0 1\n#define DEF_LINE_WIDTH_1 35\n#define DEF_LINE_WIDTH_2 88\n\n#define SVX_XML_BORDER_WIDTH_THIN 0\n#define SVX_XML_BORDER_WIDTH_MIDDLE 1\n#define SVX_XML_BORDER_WIDTH_THICK 2\n\nSvXMLEnumMapEntry pXML_BorderStyles[] =\n{\n { XML_NONE, table::BorderLineStyle::NONE },\n { XML_HIDDEN, table::BorderLineStyle::NONE },\n { XML_SOLID, table::BorderLineStyle::SOLID },\n { XML_DOUBLE, table::BorderLineStyle::DOUBLE },\n { XML_DOTTED, table::BorderLineStyle::DOTTED },\n { XML_DASHED, table::BorderLineStyle::DASHED },\n { XML_GROOVE, table::BorderLineStyle::ENGRAVED },\n { XML_RIDGE, table::BorderLineStyle::EMBOSSED },\n { XML_INSET, table::BorderLineStyle::INSET },\n { XML_OUTSET, table::BorderLineStyle::OUTSET },\n { XML_FINE_DASHED, table::BorderLineStyle::FINE_DASHED },\n { XML_TOKEN_INVALID, 0 }\n};\n\nSvXMLEnumMapEntry pXML_NamedBorderWidths[] =\n{\n { XML_THIN, SVX_XML_BORDER_WIDTH_THIN },\n { XML_MIDDLE, SVX_XML_BORDER_WIDTH_MIDDLE },\n { XML_THICK, SVX_XML_BORDER_WIDTH_THICK },\n { XML_TOKEN_INVALID, 0 }\n};\n\/\/ mapping tables to map external xml input to internal box line widths\n\nstatic sal_uInt16 const aBorderWidths[] =\n{\n DEF_LINE_WIDTH_0,\n DEF_LINE_WIDTH_1,\n DEF_LINE_WIDTH_2\n};\n\nstatic void lcl_frmitems_setXMLBorderStyle( table::BorderLine2 & rBorderLine, sal_uInt16 nStyle )\n{\n sal_Int16 eStyle = -1; \/\/ None\n if (nStyle != table::BorderLineStyle::NONE)\n eStyle = sal_Int16( nStyle );\n\n rBorderLine.LineStyle = eStyle;\n}\n\n\/\/\n\/\/ class XMLEscapementPropHdl\n\/\/\n\nXMLBorderWidthHdl::~XMLBorderWidthHdl()\n{\n \/\/ nothing to do\n}\n\nbool XMLBorderWidthHdl::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n SvXMLTokenEnumerator aTokenEnum( rStrImpValue );\n\n sal_Int32 nInWidth, nDistance, nOutWidth;\n\n OUString aToken;\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nInWidth, aToken, 0, 500 ))\n return false;\n\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nDistance, aToken, 0, 500 ))\n return false;\n\n if( !aTokenEnum.getNextToken( aToken ) )\n return false;\n\n if (!rUnitConverter.convertMeasureToCore( nOutWidth, aToken, 0, 500 ))\n return false;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n aBorderLine.Color = 0;\n\n aBorderLine.InnerLineWidth = sal::static_int_cast< sal_Int16 >(nInWidth);\n aBorderLine.OuterLineWidth = sal::static_int_cast< sal_Int16 >(nOutWidth);\n aBorderLine.LineDistance = sal::static_int_cast< sal_Int16 >(nDistance);\n\n rValue <<= aBorderLine;\n return true;\n}\n\nbool XMLBorderWidthHdl::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n OUStringBuffer aOut;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n return false;\n\n bool bDouble = false;\n switch ( aBorderLine.LineStyle )\n {\n case table::BorderLineStyle::DOUBLE:\n case table::BorderLineStyle::THINTHICK_SMALLGAP:\n case table::BorderLineStyle::THINTHICK_MEDIUMGAP:\n case table::BorderLineStyle::THINTHICK_LARGEGAP:\n case table::BorderLineStyle::THICKTHIN_SMALLGAP:\n case table::BorderLineStyle::THICKTHIN_MEDIUMGAP:\n case table::BorderLineStyle::THICKTHIN_LARGEGAP:\n bDouble = true;\n break;\n default:\n break;\n }\n\n if( ( aBorderLine.LineDistance == 0 && aBorderLine.InnerLineWidth == 0 ) || !bDouble )\n return false;\n\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.InnerLineWidth );\n aOut.append( ' ' );\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.LineDistance );\n aOut.append( ' ' );\n rUnitConverter.convertMeasureToXML( aOut, aBorderLine.OuterLineWidth );\n\n rStrExpValue = aOut.makeStringAndClear();\n return true;\n}\n\n\/\/\n\/\/ class XMLEscapementHeightPropHdl\n\/\/\n\nXMLBorderHdl::~XMLBorderHdl()\n{\n \/\/ nothing to do\n}\n\nbool XMLBorderHdl::importXML( const OUString& rStrImpValue, uno::Any& rValue, const SvXMLUnitConverter& rUnitConverter ) const\n{\n OUString aToken;\n SvXMLTokenEnumerator aTokens( rStrImpValue );\n\n bool bHasStyle = false;\n bool bHasWidth = false;\n bool bHasColor = false;\n\n sal_uInt16 nStyle = USHRT_MAX;\n sal_uInt16 nWidth = 0;\n sal_uInt16 nNamedWidth = USHRT_MAX;\n sal_Int32 nColor = 0;\n\n sal_Int32 nTemp;\n while( aTokens.getNextToken( aToken ) && !aToken.isEmpty() )\n {\n if( !bHasWidth &&\n rUnitConverter.convertEnum( nNamedWidth, aToken,\n pXML_NamedBorderWidths ) )\n {\n bHasWidth = true;\n }\n else if( !bHasStyle &&\n rUnitConverter.convertEnum( nStyle, aToken,\n pXML_BorderStyles ) )\n {\n bHasStyle = true;\n }\n else if (!bHasColor && ::sax::Converter::convertColor(nColor, aToken))\n {\n bHasColor = true;\n }\n else if( !bHasWidth &&\n rUnitConverter.convertMeasureToCore( nTemp, aToken, 0,\n USHRT_MAX ) )\n {\n nWidth = (sal_uInt16)nTemp;\n bHasWidth = true;\n }\n else\n {\n \/\/ missformed\n return false;\n }\n }\n\n \/\/ if there is no style or a different style than none but no width,\n \/\/ then the declaration is not valid.\n if (!bHasStyle || (table::BorderLineStyle::NONE != nStyle && !bHasWidth))\n return false;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n {\n aBorderLine.Color = 0;\n aBorderLine.InnerLineWidth = 0;\n aBorderLine.OuterLineWidth = 0;\n aBorderLine.LineDistance = 0;\n aBorderLine.LineWidth = 0;\n }\n\n \/\/ first of all, delete an empty line\n if ((bHasStyle && table::BorderLineStyle::NONE == nStyle) ||\n (bHasWidth && USHRT_MAX == nNamedWidth && 0 == nWidth) )\n {\n aBorderLine.InnerLineWidth = 0;\n aBorderLine.OuterLineWidth = 0;\n aBorderLine.LineDistance = 0;\n aBorderLine.LineWidth = 0;\n }\n else if( bHasWidth )\n {\n if( USHRT_MAX != nNamedWidth )\n {\n aBorderLine.LineWidth = aBorderWidths[nNamedWidth];\n }\n else\n {\n aBorderLine.LineWidth = nWidth;\n lcl_frmitems_setXMLBorderStyle( aBorderLine, nStyle );\n }\n }\n else\n {\n aBorderLine.LineWidth = 0;\n lcl_frmitems_setXMLBorderStyle( aBorderLine, nStyle );\n }\n\n \/\/ set color\n if( bHasColor )\n {\n aBorderLine.Color = nColor;\n }\n\n rValue <<= aBorderLine;\n return true;\n}\n\nbool XMLBorderHdl::exportXML( OUString& rStrExpValue, const uno::Any& rValue, const SvXMLUnitConverter& \/* rUnitConverter *\/ ) const\n{\n OUStringBuffer aOut;\n\n table::BorderLine2 aBorderLine;\n if(!(rValue >>= aBorderLine))\n return false;\n\n sal_Int32 nWidth = aBorderLine.LineWidth;\n\n if( nWidth == 0 )\n {\n aOut.append( GetXMLToken( XML_NONE ) );\n }\n else\n {\n ::sax::Converter::convertMeasure( aOut, nWidth,\n util::MeasureUnit::MM_100TH, util::MeasureUnit::POINT);\n\n aOut.append( ' ' );\n\n XMLTokenEnum eStyleToken = XML_SOLID;\n switch ( aBorderLine.LineStyle )\n {\n case table::BorderLineStyle::DASHED:\n eStyleToken = XML_DASHED;\n break;\n case table::BorderLineStyle::DOTTED:\n eStyleToken = XML_DOTTED;\n break;\n case table::BorderLineStyle::DOUBLE:\n case table::BorderLineStyle::THINTHICK_SMALLGAP:\n case table::BorderLineStyle::THINTHICK_MEDIUMGAP:\n case table::BorderLineStyle::THINTHICK_LARGEGAP:\n case table::BorderLineStyle::THICKTHIN_SMALLGAP:\n case table::BorderLineStyle::THICKTHIN_MEDIUMGAP:\n case table::BorderLineStyle::THICKTHIN_LARGEGAP:\n eStyleToken = XML_DOUBLE;\n break;\n case table::BorderLineStyle::EMBOSSED:\n eStyleToken = XML_RIDGE;\n break;\n case table::BorderLineStyle::ENGRAVED:\n eStyleToken = XML_GROOVE;\n break;\n case table::BorderLineStyle::OUTSET:\n eStyleToken = XML_OUTSET;\n break;\n case table::BorderLineStyle::INSET:\n eStyleToken = XML_INSET;\n break;\n case table::BorderLineStyle::FINE_DASHED:\n eStyleToken = XML_FINE_DASHED;\n break;\n case table::BorderLineStyle::SOLID:\n default:\n break;\n }\n aOut.append( GetXMLToken( eStyleToken ) );\n\n aOut.append( ' ' );\n\n ::sax::Converter::convertColor( aOut, aBorderLine.Color );\n }\n\n rStrExpValue = aOut.makeStringAndClear();\n\n return true;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"MainWindow.h\"\n#include \"ui_MainWindow.h\"\n#include <QTextCursor>\n#include <QFileInfo>\n#include <QDebug>\n#include <QMessageBox>\n#include <QCloseEvent>\n\n#include \"Widgets\/InputWidget.h\"\n#include \"Widgets\/HistoryWidget.h\"\n#include \"Managers\/HistoryManager.h\"\n#include \"Managers\/FileManager.h\"\n#include \"Managers\/MarkovRunManager.h\"\n\n\nMainWindow::MainWindow(QWidget *parent) :\n QMainWindow(parent),\n ui(new Ui::MainWindow),\n _has_unsaved_data(true),\n _current_file(\"\")\n{\n ui->setupUi(this);\n\n updateWindowTitle();\n redoAvailable(false);\n undoAvailable(false);\n copyAvailable(false);\n\n \/\/Connect MainWindow menu\n connect(ui->actionExit, SIGNAL(triggered()), this, SLOT(close()));\n connect(ui->actionUndo, SIGNAL(triggered()), this, SIGNAL(undo()));\n connect(ui->actionRedo, SIGNAL(triggered()), this, SIGNAL(redo()));\n connect(ui->actionSelect_All, SIGNAL(triggered()), this, SIGNAL(selectAll()));\n connect(ui->actionCopy, SIGNAL(triggered()), this, SIGNAL(copy()));\n connect(ui->actionPaste, SIGNAL(triggered()), this, SIGNAL(paste()));\n connect(ui->actionCut, SIGNAL(triggered()), this, SIGNAL(cut()));\n connect(ui->actionDelete, SIGNAL(triggered()), this, SIGNAL(deleteSelection()));\n connect(ui->actionNew, SIGNAL(triggered()), this, SIGNAL(newFile()));\n connect(ui->actionOpen, SIGNAL(triggered()), this, SIGNAL(open()));\n connect(ui->actionSave, SIGNAL(triggered()), this, SIGNAL(save()));\n connect(ui->actionSave_As, SIGNAL(triggered()), this, SIGNAL(saveAs()));\n\n \/\/Connect InputWidget and HistoryManager\n HistoryManager* history_manager = HistoryManager::getInstance();\n\n connect(ui->input, SIGNAL(addToHistory(QString)),\n history_manager, SLOT(addToHistory(QString)));\n connect(history_manager, SIGNAL(wordSelected(QString)),\n ui->input, SLOT(setInput(QString)));\n\n \/\/Connect HistoryWidget and HistoryManager\n connect(ui->history, SIGNAL(inputWordSelected(QString)),\n history_manager, SIGNAL(wordSelected(QString)));\n connect(ui->history, SIGNAL(removeFromHistory(QString)),\n history_manager, SLOT(removeFromHistory(QString)));\n connect(history_manager, SIGNAL(historyChanged(QVector<QString>)),\n ui->history, SLOT(historyChanged(QVector<QString>)));\n\n \/\/Connect MainWindows and FileManager\n FileManager* file_manager = FileManager::getInstance();\n connect(this, SIGNAL(newFile()), file_manager, SLOT(newFile()));\n connect(this, SIGNAL(open()), file_manager, SLOT(open()));\n connect(this, SIGNAL(save()), file_manager, SLOT(save()));\n connect(this, SIGNAL(saveAs()), file_manager, SLOT(saveAs()));\n connect(file_manager, SIGNAL(hasUnsavedData(bool)),\n this, SLOT(hasUnsavedData(bool)));\n connect(file_manager, SIGNAL(fileNameChanged(QString)),\n this, SLOT(fileNameChanged(QString)));\n\n \/\/Connect MainWindows and EditorWindowWidget\n connect(this, SIGNAL(undo()), ui->editorWindow, SLOT(undo()));\n connect(this, SIGNAL(redo()), ui->editorWindow, SLOT(redo()));\n connect(this, SIGNAL(selectAll()), ui->editorWindow, SLOT(selectAll()));\n connect(this, SIGNAL(copy()), ui->editorWindow, SLOT(copy()));\n connect(this, SIGNAL(paste()), ui->editorWindow, SLOT(paste()));\n connect(this, SIGNAL(cut()), ui->editorWindow, SLOT(cut()));\n connect(this, SIGNAL(deleteSelection()),\n ui->editorWindow, SLOT(deleteSelection()));\n\n connect(ui->editorWindow, SIGNAL(redoAvailable(bool)),\n this, SLOT(redoAvailable(bool)));\n connect(ui->editorWindow, SIGNAL(undoAvailable(bool)),\n this, SLOT(undoAvailable(bool)));\n connect(ui->editorWindow, SIGNAL(copyAvailable(bool)),\n this, SLOT(copyAvailable(bool)));\n\n \/\/Connect InputWidget and MarkovRunManager\n MarkovRunManager* run_manager = MarkovRunManager::getInstance();\n\n connect(ui->input, SIGNAL(run(QString)),\n run_manager, SLOT(runWithoutDebug(QString)));\n connect(ui->input, SIGNAL(runWithDebug(QString)),\n run_manager, SLOT(runWithDebug(QString)));\n\n connect(run_manager, SIGNAL(runWithoutDebugStarted(QString)),\n ui->input, SLOT(runStarted()));\n connect(run_manager, SIGNAL(debugStarted(QString)),\n ui->input, SLOT(runStarted()));\n\n connect(run_manager, SIGNAL(runWithoutDebugFinishFail(QString,RunError,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(runWithoutDebugFinishSuccess(QString,QString,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(debugFinishFail(QString,RunError,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(debugFinishSuccess(QString,QString,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(canRunSourceCode(bool)),\n ui->input, SLOT(canRunAlgorithm(bool)));\n\n \/\/Read file to open from command line\n QStringList arguments = QCoreApplication::arguments();\n if(arguments.size() >= 2)\n {\n QString file_name = arguments.at(1);\n FileManager::getInstance()->openFile(file_name);\n }\n else\n {\n ui->editorWindow->setDefaultSourceCode(tr(\"\/\/Alphabet\\nT = {}\\n\\n\/\/Rules\\n\/\/a -> b\"));\n }\n\n}\n\nvoid MainWindow::updateWindowTitle()\n{\n QString file = _current_file;\n if(file == \"\")\n file = tr(\"Untitiled\");\n\n QFileInfo fileInfo(file);\n QString filename(fileInfo.fileName());\n\n QString saved=\"\";\n if(_has_unsaved_data)\n saved = \"*\";\n\n QString title = tr(\"%1%2 - Yad Studio\").arg(filename, saved);\n this->setWindowTitle(title);\n}\n\nvoid MainWindow::fileNameChanged(QString new_name)\n{\n _current_file = new_name;\n updateWindowTitle();\n}\n\nvoid MainWindow::hasUnsavedData(bool has_unsaved_data)\n{\n _has_unsaved_data = has_unsaved_data;\n updateWindowTitle();\n}\n\nvoid MainWindow::redoAvailable(bool v)\n{\n ui->actionRedo->setEnabled(v);\n}\n\nvoid MainWindow::undoAvailable(bool v)\n{\n ui->actionUndo->setEnabled(v);\n}\n\nvoid MainWindow::copyAvailable(bool v)\n{\n ui->actionCopy->setEnabled(v);\n ui->actionCut->setEnabled(v);\n ui->actionDelete->setEnabled(v);\n}\n\nMainWindow::~MainWindow()\n{\n delete ui;\n}\n\nvoid MainWindow::closeEvent(QCloseEvent * event)\n{\n if(FileManager::getInstance()->hasUnsavedData())\n {\n QMessageBox msgBox;\n msgBox.setText(tr(\"<b>The document has been modified.<\/b>\"));\n msgBox.setInformativeText(tr(\"Do you want to save your changes?\"));\n msgBox.setStandardButtons(QMessageBox::Save | QMessageBox::Discard | QMessageBox::Cancel);\n msgBox.setDefaultButton(QMessageBox::Save);\n int ret = msgBox.exec();\n\n if(ret == QMessageBox::Save)\n {\n FileManager::getInstance()->save();\n QMainWindow::closeEvent(event);\n }\n else if(ret == QMessageBox::Discard)\n {\n QMainWindow::closeEvent(event);\n }\n else\n {\n event->ignore();\n }\n\n }\n else\n {\n QMainWindow::closeEvent(event);\n }\n}\n<commit_msg>close #49 Connect SourceCodeManager and EditorWindowWidget<commit_after>#include \"MainWindow.h\"\n#include \"ui_MainWindow.h\"\n#include <QTextCursor>\n#include <QFileInfo>\n#include <QDebug>\n#include <QMessageBox>\n#include <QCloseEvent>\n\n#include \"Widgets\/InputWidget.h\"\n#include \"Widgets\/HistoryWidget.h\"\n#include \"Managers\/HistoryManager.h\"\n#include \"Managers\/FileManager.h\"\n#include \"Managers\/MarkovRunManager.h\"\n#include \"Managers\/SourceCodeManager.h\"\n\n\nMainWindow::MainWindow(QWidget *parent) :\n QMainWindow(parent),\n ui(new Ui::MainWindow),\n _has_unsaved_data(true),\n _current_file(\"\")\n{\n ui->setupUi(this);\n\n updateWindowTitle();\n redoAvailable(false);\n undoAvailable(false);\n copyAvailable(false);\n\n \/\/Connect MainWindow menu\n connect(ui->actionExit, SIGNAL(triggered()), this, SLOT(close()));\n connect(ui->actionUndo, SIGNAL(triggered()), this, SIGNAL(undo()));\n connect(ui->actionRedo, SIGNAL(triggered()), this, SIGNAL(redo()));\n connect(ui->actionSelect_All, SIGNAL(triggered()), this, SIGNAL(selectAll()));\n connect(ui->actionCopy, SIGNAL(triggered()), this, SIGNAL(copy()));\n connect(ui->actionPaste, SIGNAL(triggered()), this, SIGNAL(paste()));\n connect(ui->actionCut, SIGNAL(triggered()), this, SIGNAL(cut()));\n connect(ui->actionDelete, SIGNAL(triggered()), this, SIGNAL(deleteSelection()));\n connect(ui->actionNew, SIGNAL(triggered()), this, SIGNAL(newFile()));\n connect(ui->actionOpen, SIGNAL(triggered()), this, SIGNAL(open()));\n connect(ui->actionSave, SIGNAL(triggered()), this, SIGNAL(save()));\n connect(ui->actionSave_As, SIGNAL(triggered()), this, SIGNAL(saveAs()));\n\n \/\/Connect InputWidget and HistoryManager\n HistoryManager* history_manager = HistoryManager::getInstance();\n\n connect(ui->input, SIGNAL(addToHistory(QString)),\n history_manager, SLOT(addToHistory(QString)));\n connect(history_manager, SIGNAL(wordSelected(QString)),\n ui->input, SLOT(setInput(QString)));\n\n \/\/Connect HistoryWidget and HistoryManager\n connect(ui->history, SIGNAL(inputWordSelected(QString)),\n history_manager, SIGNAL(wordSelected(QString)));\n connect(ui->history, SIGNAL(removeFromHistory(QString)),\n history_manager, SLOT(removeFromHistory(QString)));\n connect(history_manager, SIGNAL(historyChanged(QVector<QString>)),\n ui->history, SLOT(historyChanged(QVector<QString>)));\n\n \/\/Connect MainWindows and FileManager\n FileManager* file_manager = FileManager::getInstance();\n connect(this, SIGNAL(newFile()), file_manager, SLOT(newFile()));\n connect(this, SIGNAL(open()), file_manager, SLOT(open()));\n connect(this, SIGNAL(save()), file_manager, SLOT(save()));\n connect(this, SIGNAL(saveAs()), file_manager, SLOT(saveAs()));\n connect(file_manager, SIGNAL(hasUnsavedData(bool)),\n this, SLOT(hasUnsavedData(bool)));\n connect(file_manager, SIGNAL(fileNameChanged(QString)),\n this, SLOT(fileNameChanged(QString)));\n\n \/\/Connect MainWindows and EditorWindowWidget\n connect(this, SIGNAL(undo()), ui->editorWindow, SLOT(undo()));\n connect(this, SIGNAL(redo()), ui->editorWindow, SLOT(redo()));\n connect(this, SIGNAL(selectAll()), ui->editorWindow, SLOT(selectAll()));\n connect(this, SIGNAL(copy()), ui->editorWindow, SLOT(copy()));\n connect(this, SIGNAL(paste()), ui->editorWindow, SLOT(paste()));\n connect(this, SIGNAL(cut()), ui->editorWindow, SLOT(cut()));\n connect(this, SIGNAL(deleteSelection()),\n ui->editorWindow, SLOT(deleteSelection()));\n\n connect(ui->editorWindow, SIGNAL(redoAvailable(bool)),\n this, SLOT(redoAvailable(bool)));\n connect(ui->editorWindow, SIGNAL(undoAvailable(bool)),\n this, SLOT(undoAvailable(bool)));\n connect(ui->editorWindow, SIGNAL(copyAvailable(bool)),\n this, SLOT(copyAvailable(bool)));\n\n \/\/Connect InputWidget and MarkovRunManager\n MarkovRunManager* run_manager = MarkovRunManager::getInstance();\n\n connect(ui->input, SIGNAL(run(QString)),\n run_manager, SLOT(runWithoutDebug(QString)));\n connect(ui->input, SIGNAL(runWithDebug(QString)),\n run_manager, SLOT(runWithDebug(QString)));\n connect(run_manager, SIGNAL(runWithoutDebugStarted(QString)),\n ui->input, SLOT(runStarted()));\n connect(run_manager, SIGNAL(debugStarted(QString)),\n ui->input, SLOT(runStarted()));\n connect(run_manager, SIGNAL(runWithoutDebugFinishFail(QString,RunError,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(runWithoutDebugFinishSuccess(QString,QString,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(debugFinishFail(QString,RunError,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(debugFinishSuccess(QString,QString,int)),\n ui->input, SLOT(runFinished()));\n connect(run_manager, SIGNAL(canRunSourceCode(bool)),\n ui->input, SLOT(canRunAlgorithm(bool)));\n\n \/\/Connect SourceCodeManager and EditorWindowWidget\n SourceCodeManager* source_manager = SourceCodeManager::getInstance();\n connect(source_manager, SIGNAL(newSourceCodeWasLoaded(QString)),\n ui->editorWindow, SLOT(newSourceCode(QString)));\n connect(ui->editorWindow, SIGNAL(sourceCodeChanged(QString)),\n source_manager, SLOT(setSourceCode(QString)));\n\n \/\/Read file to open from command line\n QStringList arguments = QCoreApplication::arguments();\n if(arguments.size() >= 2)\n {\n QString file_name = arguments.at(1);\n FileManager::getInstance()->openFile(file_name);\n }\n else\n {\n source_manager->setNewSourceCodeFromFile(tr(\"\/\/Alphabet\\nT = {}\\n\\n\/\/Rules\\n\/\/a -> b\"));\n }\n\n}\n\nvoid MainWindow::updateWindowTitle()\n{\n QString file = _current_file;\n if(file == \"\")\n file = tr(\"Untitiled\");\n\n QFileInfo fileInfo(file);\n QString filename(fileInfo.fileName());\n\n QString saved=\"\";\n if(_has_unsaved_data)\n saved = \"*\";\n\n QString title = tr(\"%1%2 - Yad Studio\").arg(filename, saved);\n this->setWindowTitle(title);\n}\n\nvoid MainWindow::fileNameChanged(QString new_name)\n{\n _current_file = new_name;\n updateWindowTitle();\n}\n\nvoid MainWindow::hasUnsavedData(bool has_unsaved_data)\n{\n _has_unsaved_data = has_unsaved_data;\n updateWindowTitle();\n}\n\nvoid MainWindow::redoAvailable(bool v)\n{\n ui->actionRedo->setEnabled(v);\n}\n\nvoid MainWindow::undoAvailable(bool v)\n{\n ui->actionUndo->setEnabled(v);\n}\n\nvoid MainWindow::copyAvailable(bool v)\n{\n ui->actionCopy->setEnabled(v);\n ui->actionCut->setEnabled(v);\n ui->actionDelete->setEnabled(v);\n}\n\nMainWindow::~MainWindow()\n{\n delete ui;\n}\n\nvoid MainWindow::closeEvent(QCloseEvent * event)\n{\n if(FileManager::getInstance()->hasUnsavedData())\n {\n QMessageBox msgBox;\n msgBox.setText(tr(\"<b>The document has been modified.<\/b>\"));\n msgBox.setInformativeText(tr(\"Do you want to save your changes?\"));\n msgBox.setStandardButtons(QMessageBox::Save | QMessageBox::Discard | QMessageBox::Cancel);\n msgBox.setDefaultButton(QMessageBox::Save);\n int ret = msgBox.exec();\n\n if(ret == QMessageBox::Save)\n {\n FileManager::getInstance()->save();\n QMainWindow::closeEvent(event);\n }\n else if(ret == QMessageBox::Discard)\n {\n QMainWindow::closeEvent(event);\n }\n else\n {\n event->ignore();\n }\n\n }\n else\n {\n QMainWindow::closeEvent(event);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015 Aldebaran\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n*\/\n\n#ifndef BASIC_EVENT_RECORDER_HPP\n#define BASIC_EVENT_RECORDER_HPP\n\n\/*\n* LOCAL includes\n*\/\n#include <alrosbridge\/recorder\/globalrecorder.hpp>\n#include \"..\/helpers.hpp\"\n\n\/*\n* STANDARD includes\n*\/\n#include <string>\n\nnamespace alros\n{\nnamespace recorder\n{\n\ntemplate<class T>\nclass BasicEventRecorder\n{\n\npublic:\n BasicEventRecorder( const std::string& topic ):\n topic_( topic ),\n buffer_duration_( helpers::bufferDefaultDuration ),\n is_initialized_( false ),\n is_subscribed_( false )\n {\n std::cout << \"Size of buffer: \" << buffer_.size() << std::endl;\n }\n\n virtual ~BasicEventRecorder() {}\n\n inline std::string topic() const\n {\n return topic_;\n }\n\n inline bool isInitialized() const\n {\n return is_initialized_;\n }\n\n inline void subscribe( bool state)\n {\n is_subscribed_ = state;\n }\n\n inline bool isSubscribed() const\n {\n return is_subscribed_;\n }\n\n virtual void write(const T& msg)\n {\n if (!msg.header.stamp.isZero()) {\n gr_->write(topic_, msg, msg.header.stamp);\n }\n else {\n gr_->write(topic_, msg);\n }\n }\n\n virtual void writeDump()\n {\n boost::mutex::scoped_lock lock_write_buffer( mutex_ );\n removeOld();\n typename std::list<T>::iterator it;\n for (it = buffer_.begin(); it != buffer_.end(); it++)\n {\n if (!it->header.stamp.isZero()) {\n gr_->write(topic_, *it, it->header.stamp);\n }\n else {\n gr_->write(topic_, *it);\n }\n }\n }\n\n virtual void bufferize(const T& msg)\n {\n std::cout << \"In bufferize function\" << std::endl;\n boost::mutex::scoped_lock lock_bufferize( mutex_ );\n typename std::list<T>::iterator it;\n removeOld();\n buffer_.push_back(msg);\n\n }\n\n virtual void reset(boost::shared_ptr<GlobalRecorder> gr, float conv_frequency)\n {\n gr_ = gr;\n is_initialized_ = true;\n }\n\n virtual void setBufferDuration(float duration)\n {\n boost::mutex::scoped_lock lock_bufferize( mutex_ );\n buffer_duration_ = duration;\n }\n\nprotected:\n bool isTooOld(const T& msg)\n {\n ros::Duration d( ros::Time::now() - msg.header.stamp );\n if (static_cast<float>(d.toSec()) > buffer_duration_)\n {\n std::cout << \"Removing old data in buffer: \"\n << d.toSec() << \"s\" << std::endl;\n return true;\n }\n return false;\n }\n\n void removeOld()\n {\n std::cout << \"Size of buffer: \" << buffer_.size() << std::endl;\n while (buffer_.size() > 0 && isTooOld(buffer_.front()))\n {\n buffer_.pop_front();\n }\n }\n\nprotected:\n std::string topic_;\n\n std::list<T> buffer_;\n float buffer_duration_;\n boost::mutex mutex_;\n\n bool is_initialized_;\n bool is_subscribed_;\n\n boost::shared_ptr<alros::recorder::GlobalRecorder> gr_;\n\n}; \/\/ class\n\n} \/\/ publisher\n} \/\/ alros\n\n#endif\n<commit_msg>Remove spamming logs<commit_after>\/*\n * Copyright 2015 Aldebaran\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n*\/\n\n#ifndef BASIC_EVENT_RECORDER_HPP\n#define BASIC_EVENT_RECORDER_HPP\n\n\/*\n* LOCAL includes\n*\/\n#include <alrosbridge\/recorder\/globalrecorder.hpp>\n#include \"..\/helpers.hpp\"\n\n\/*\n* STANDARD includes\n*\/\n#include <string>\n\nnamespace alros\n{\nnamespace recorder\n{\n\ntemplate<class T>\nclass BasicEventRecorder\n{\n\npublic:\n BasicEventRecorder( const std::string& topic ):\n topic_( topic ),\n buffer_duration_( helpers::bufferDefaultDuration ),\n is_initialized_( false ),\n is_subscribed_( false )\n {}\n\n virtual ~BasicEventRecorder() {}\n\n inline std::string topic() const\n {\n return topic_;\n }\n\n inline bool isInitialized() const\n {\n return is_initialized_;\n }\n\n inline void subscribe( bool state)\n {\n is_subscribed_ = state;\n }\n\n inline bool isSubscribed() const\n {\n return is_subscribed_;\n }\n\n virtual void write(const T& msg)\n {\n if (!msg.header.stamp.isZero()) {\n gr_->write(topic_, msg, msg.header.stamp);\n }\n else {\n gr_->write(topic_, msg);\n }\n }\n\n virtual void writeDump()\n {\n boost::mutex::scoped_lock lock_write_buffer( mutex_ );\n removeOld();\n typename std::list<T>::iterator it;\n for (it = buffer_.begin(); it != buffer_.end(); it++)\n {\n if (!it->header.stamp.isZero()) {\n gr_->write(topic_, *it, it->header.stamp);\n }\n else {\n gr_->write(topic_, *it);\n }\n }\n }\n\n virtual void bufferize(const T& msg)\n {\n boost::mutex::scoped_lock lock_bufferize( mutex_ );\n typename std::list<T>::iterator it;\n removeOld();\n buffer_.push_back(msg);\n\n }\n\n virtual void reset(boost::shared_ptr<GlobalRecorder> gr, float conv_frequency)\n {\n gr_ = gr;\n is_initialized_ = true;\n }\n\n virtual void setBufferDuration(float duration)\n {\n boost::mutex::scoped_lock lock_bufferize( mutex_ );\n buffer_duration_ = duration;\n }\n\nprotected:\n bool isTooOld(const T& msg)\n {\n ros::Duration d( ros::Time::now() - msg.header.stamp );\n if (static_cast<float>(d.toSec()) > buffer_duration_)\n {\n return true;\n }\n return false;\n }\n\n void removeOld()\n {\n while (buffer_.size() > 0 && isTooOld(buffer_.front()))\n {\n buffer_.pop_front();\n }\n }\n\nprotected:\n std::string topic_;\n\n std::list<T> buffer_;\n float buffer_duration_;\n boost::mutex mutex_;\n\n bool is_initialized_;\n bool is_subscribed_;\n\n boost::shared_ptr<alros::recorder::GlobalRecorder> gr_;\n\n}; \/\/ class\n\n} \/\/ publisher\n} \/\/ alros\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/socket.h>\n#include <sys\/un.h>\n\n#include \"data\/Event.h\"\n#include \"ipc\/server\/Json.h\"\n\nnamespace blitzortung {\n namespace ipc {\n namespace server {\n\n Json::Json(const unsigned int socket, const Process& process, const hardware::Pcb& hardware) :\n\tBase(socket),\n\tprocess_(process),\n\thardware_(hardware),\n\tlogger_(\"ipc.server.Json\")\n {\n\tif (logger_.isDebugEnabled())\n\t logger_.debugStream() << \"initialize for socket \" << socket;\n }\n\n void Json::cmdGetInfo() {\n\t json_object* jsonHardware = json_object_new_object();\n\t json_object_object_add(jsonHardware, \"firmware\", json_object_new_string(hardware_.getFirmwareVersion().c_str()));\n\t json_object_object_add(jsonResponse_, \"hardware\", jsonHardware);\n\n\t const hardware::gps::Base& gps = hardware_.getGps();\n\t json_object* jsonGps = json_object_new_object();\n\t char gpsStatus = gps.getStatus();\n\t json_object_object_add(jsonGps, \"longitude\", json_object_new_double(gps.getLocation().getLongitude()));\n\t json_object_object_add(jsonGps, \"longitudeError\", json_object_new_double(gps.getLocation().getLongitudeError()));\n\t json_object_object_add(jsonGps, \"latitude\", json_object_new_double(gps.getLocation().getLatitude()));\n\t json_object_object_add(jsonGps, \"latitudeError\", json_object_new_double(gps.getLocation().getLatitudeError()));\n\t json_object_object_add(jsonGps, \"altitude\", json_object_new_int(gps.getLocation().getAltitude()));\n\t json_object_object_add(jsonGps, \"altitudeError\", json_object_new_int(gps.getLocation().getAltitudeError()));\n\t pt::ptime gpsTime = gps.getTime();\n\t std::ostringstream oss;\n\t gr::date_facet *datefacet = new gr::date_facet();\n\t datefacet->format(\"%Y-%m-%d\");\n\t oss.imbue(std::locale(std::locale::classic(), datefacet));\n\t oss << gpsTime.date();\n\t json_object_object_add(jsonGps, \"date\", json_object_new_string(oss.str().c_str()));\n\t oss.str(\"\");\n\t oss << gpsTime.time_of_day();\n\t json_object_object_add(jsonGps, \"time\", json_object_new_string(oss.str().c_str()));\n\t json_object_object_add(jsonGps, \"ticksPerSecond\", json_object_new_double(gps.getTicksPerSecond()));\n\t json_object_object_add(jsonGps, \"tickError\", json_object_new_double(gps.getTickError()));\n\t json_object_object_add(jsonGps, \"status\", json_object_new_string_len(&gpsStatus, 1));\n\t json_object_object_add(jsonGps, \"satelliteCount\", json_object_new_int(gps.getSatelliteCount()));\n\t json_object_object_add(jsonGps, \"type\", json_object_new_string(gps.getType().c_str()));\n\t json_object_object_add(jsonHardware, \"gps\", jsonGps);\n\t \n\t const hardware::comm::Base& comm = hardware_.getComm();\n\t json_object* jsonComm = json_object_new_object();\n\t json_object_object_add(jsonComm, \"baudRate\", json_object_new_int(comm.getBaudRate()));\n\t json_object_object_add(jsonComm, \"interfaceName\", json_object_new_string(comm.getInterfaceName().c_str()));\n\t json_object_object_add(jsonHardware, \"comm\", jsonComm);\n\n\t json_object* jsonProcess = json_object_new_object();\n\t json_object_object_add(jsonProcess, \"numberOfSeconds\", json_object_new_int(process_.getEventCountBuffer().getActualSize()));\n\t json_object_object_add(jsonProcess, \"numberOfEvents\", json_object_new_int(process_.getEventCountBuffer().getSum()));\n\t json_object_object_add(jsonProcess, \"eventsPerSecond\", json_object_new_double(process_.getEventCountBuffer().getAverage()));\n\t json_object_object_add(jsonResponse_, \"process\", jsonProcess);\n }\n\n std::string Json::respond(const std::string& input) {\n\tjsonResponse_ = json_object_new_object();\n\n\tjson_object* jsonObj = json_tokener_parse(input.c_str());\n\tif (jsonObj != 0) {\n\t json_object* cmd_obj = json_object_object_get(jsonObj, \"cmd\");\n\t if (cmd_obj != 0) {\n\t std::string command(json_object_get_string(cmd_obj));\n\n\t json_object_object_add(jsonResponse_, \"command\", json_object_new_string(command.c_str()));\n\n\t if (command == \"getInfo\")\n\t cmdGetInfo();\n\t else if (command ==\"getActivity\")\n\t cmdGetActivity();\n\t \t \n\t json_object_put(cmd_obj);\n\t }\n\n\t json_object_put(jsonObj);\n\t} else {\n\t std::string result = \"could not parse command '\" + input + \"'\";\n\t json_object_object_add(jsonResponse_, \"error\", json_object_new_string(result.c_str()));\n\t logger_.warnStream() << result;\n\t}\n\n\tstd::string jsonString(json_object_to_json_string(jsonResponse_));\n\tjson_object_put(jsonResponse_);\n\n\treturn jsonString;\n }\n\n void Json::cmdGetActivity() {\n\t json_object* jsonActivity = json_object_new_array();\n\n\t const unsigned int intervalSeconds = 60;\n\t const int totalNumberOfSeconds = process_.getEventCountBuffer().getActualSize();\n\t const int totalNumberOfIntervals = totalNumberOfSeconds \/ intervalSeconds;\n\n\n\t for (int interval = totalNumberOfIntervals; interval > 0; interval--) {\n\t int eventsPerInterval = 0;\n\t for (int second = 0; second < intervalSeconds; second ++) {\n\t\tint index = (totalNumberOfIntervals - interval) * intervalSeconds + second;\n\t\teventsPerInterval += process_.getEventCountBuffer()[index];\n\t }\n\t json_object_array_add(jsonActivity, json_object_new_int(eventsPerInterval));\n\t }\n\n\t json_object_object_add(jsonResponse_, \"activity\", jsonActivity);\n\n\t json_object_object_add(jsonResponse_, \"intervalSeconds\", json_object_new_int(intervalSeconds));\n\n\t const hardware::gps::Base& gps = hardware_.getGps();\n\t pt::ptime gpsTime = gps.getTime();\n\t std::ostringstream oss;\n\t gr::date_facet *datefacet = new gr::date_facet();\n\t datefacet->format(\"%Y-%m-%d\");\n\t oss.imbue(std::locale(std::locale::classic(), datefacet));\n\t oss << gpsTime.date();\n\t json_object_object_add(jsonResponse_, \"date\", json_object_new_string(oss.str().c_str()));\n\t oss.str(\"\");\n\t oss << gpsTime.time_of_day();\n\t json_object_object_add(jsonResponse_, \"time\", json_object_new_string(oss.str().c_str()));\n }\n\n\n }\n }\n}\n<commit_msg>fixed variable type<commit_after>#include <sys\/socket.h>\n#include <sys\/un.h>\n\n#include \"data\/Event.h\"\n#include \"ipc\/server\/Json.h\"\n\nnamespace blitzortung {\n namespace ipc {\n namespace server {\n\n Json::Json(const unsigned int socket, const Process& process, const hardware::Pcb& hardware) :\n\tBase(socket),\n\tprocess_(process),\n\thardware_(hardware),\n\tlogger_(\"ipc.server.Json\")\n {\n\tif (logger_.isDebugEnabled())\n\t logger_.debugStream() << \"initialize for socket \" << socket;\n }\n\n void Json::cmdGetInfo() {\n\t json_object* jsonHardware = json_object_new_object();\n\t json_object_object_add(jsonHardware, \"firmware\", json_object_new_string(hardware_.getFirmwareVersion().c_str()));\n\t json_object_object_add(jsonResponse_, \"hardware\", jsonHardware);\n\n\t const hardware::gps::Base& gps = hardware_.getGps();\n\t json_object* jsonGps = json_object_new_object();\n\t char gpsStatus = gps.getStatus();\n\t json_object_object_add(jsonGps, \"longitude\", json_object_new_double(gps.getLocation().getLongitude()));\n\t json_object_object_add(jsonGps, \"longitudeError\", json_object_new_double(gps.getLocation().getLongitudeError()));\n\t json_object_object_add(jsonGps, \"latitude\", json_object_new_double(gps.getLocation().getLatitude()));\n\t json_object_object_add(jsonGps, \"latitudeError\", json_object_new_double(gps.getLocation().getLatitudeError()));\n\t json_object_object_add(jsonGps, \"altitude\", json_object_new_int(gps.getLocation().getAltitude()));\n\t json_object_object_add(jsonGps, \"altitudeError\", json_object_new_int(gps.getLocation().getAltitudeError()));\n\t pt::ptime gpsTime = gps.getTime();\n\t std::ostringstream oss;\n\t gr::date_facet *datefacet = new gr::date_facet();\n\t datefacet->format(\"%Y-%m-%d\");\n\t oss.imbue(std::locale(std::locale::classic(), datefacet));\n\t oss << gpsTime.date();\n\t json_object_object_add(jsonGps, \"date\", json_object_new_string(oss.str().c_str()));\n\t oss.str(\"\");\n\t oss << gpsTime.time_of_day();\n\t json_object_object_add(jsonGps, \"time\", json_object_new_string(oss.str().c_str()));\n\t json_object_object_add(jsonGps, \"ticksPerSecond\", json_object_new_double(gps.getTicksPerSecond()));\n\t json_object_object_add(jsonGps, \"tickError\", json_object_new_double(gps.getTickError()));\n\t json_object_object_add(jsonGps, \"status\", json_object_new_string_len(&gpsStatus, 1));\n\t json_object_object_add(jsonGps, \"satelliteCount\", json_object_new_int(gps.getSatelliteCount()));\n\t json_object_object_add(jsonGps, \"type\", json_object_new_string(gps.getType().c_str()));\n\t json_object_object_add(jsonHardware, \"gps\", jsonGps);\n\t \n\t const hardware::comm::Base& comm = hardware_.getComm();\n\t json_object* jsonComm = json_object_new_object();\n\t json_object_object_add(jsonComm, \"baudRate\", json_object_new_int(comm.getBaudRate()));\n\t json_object_object_add(jsonComm, \"interfaceName\", json_object_new_string(comm.getInterfaceName().c_str()));\n\t json_object_object_add(jsonHardware, \"comm\", jsonComm);\n\n\t json_object* jsonProcess = json_object_new_object();\n\t json_object_object_add(jsonProcess, \"numberOfSeconds\", json_object_new_int(process_.getEventCountBuffer().getActualSize()));\n\t json_object_object_add(jsonProcess, \"numberOfEvents\", json_object_new_int(process_.getEventCountBuffer().getSum()));\n\t json_object_object_add(jsonProcess, \"eventsPerSecond\", json_object_new_double(process_.getEventCountBuffer().getAverage()));\n\t json_object_object_add(jsonResponse_, \"process\", jsonProcess);\n }\n\n std::string Json::respond(const std::string& input) {\n\tjsonResponse_ = json_object_new_object();\n\n\tjson_object* jsonObj = json_tokener_parse(input.c_str());\n\tif (jsonObj != 0) {\n\t json_object* cmd_obj = json_object_object_get(jsonObj, \"cmd\");\n\t if (cmd_obj != 0) {\n\t std::string command(json_object_get_string(cmd_obj));\n\n\t json_object_object_add(jsonResponse_, \"command\", json_object_new_string(command.c_str()));\n\n\t if (command == \"getInfo\")\n\t cmdGetInfo();\n\t else if (command ==\"getActivity\")\n\t cmdGetActivity();\n\t \t \n\t json_object_put(cmd_obj);\n\t }\n\n\t json_object_put(jsonObj);\n\t} else {\n\t std::string result = \"could not parse command '\" + input + \"'\";\n\t json_object_object_add(jsonResponse_, \"error\", json_object_new_string(result.c_str()));\n\t logger_.warnStream() << result;\n\t}\n\n\tstd::string jsonString(json_object_to_json_string(jsonResponse_));\n\tjson_object_put(jsonResponse_);\n\n\treturn jsonString;\n }\n\n void Json::cmdGetActivity() {\n\t json_object* jsonActivity = json_object_new_array();\n\n\t const unsigned int intervalSeconds = 60;\n\t const int totalNumberOfSeconds = process_.getEventCountBuffer().getActualSize();\n\t const int totalNumberOfIntervals = totalNumberOfSeconds \/ intervalSeconds;\n\n\n\t for (int interval = totalNumberOfIntervals; interval > 0; interval--) {\n\t int eventsPerInterval = 0;\n\t for (unsigned int second = 0; second < intervalSeconds; second ++) {\n\t\tint index = (totalNumberOfIntervals - interval) * intervalSeconds + second;\n\t\teventsPerInterval += process_.getEventCountBuffer()[index];\n\t }\n\t json_object_array_add(jsonActivity, json_object_new_int(eventsPerInterval));\n\t }\n\n\t json_object_object_add(jsonResponse_, \"activity\", jsonActivity);\n\n\t json_object_object_add(jsonResponse_, \"intervalSeconds\", json_object_new_int(intervalSeconds));\n\n\t const hardware::gps::Base& gps = hardware_.getGps();\n\t pt::ptime gpsTime = gps.getTime();\n\t std::ostringstream oss;\n\t gr::date_facet *datefacet = new gr::date_facet();\n\t datefacet->format(\"%Y-%m-%d\");\n\t oss.imbue(std::locale(std::locale::classic(), datefacet));\n\t oss << gpsTime.date();\n\t json_object_object_add(jsonResponse_, \"date\", json_object_new_string(oss.str().c_str()));\n\t oss.str(\"\");\n\t oss << gpsTime.time_of_day();\n\t json_object_object_add(jsonResponse_, \"time\", json_object_new_string(oss.str().c_str()));\n }\n\n\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"calculator\/cell\/integrated_fission_source.h\"\n\n#include <memory>\n\n#include \"data\/cross_sections.h\"\n#include \"domain\/domain_types.h\"\n#include \"domain\/tests\/finite_element_mock.h\"\n#include \"material\/tests\/mock_material.h\"\n#include \"system\/moments\/spherical_harmonic_types.h\"\n#include \"system\/moments\/tests\/spherical_harmonic_mock.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/dealii_test_domain.h\"\n\n\nnamespace {\n\nusing namespace bart;\n\nusing ::testing::Return, ::testing::ReturnRef, ::testing::DoDefault, ::testing::NiceMock;\n\ntemplate <typename DimensionWrapper>\nclass CalcCellIntegratedFissionSourceTest :\n public ::testing::Test,\n public bart::testing::DealiiTestDomain<DimensionWrapper::value> {\n protected:\n static constexpr int dim = DimensionWrapper::value;\n using FiniteElementType = typename domain::FiniteElementMock<dim>;\n using FissionSourceNormType = typename calculator::cell::IntegratedFissionSource<dim>;\n using SphericalHarmonicType = system::moments::SphericalHarmonicMock;\n\n \/\/ Supporting objects and mocks\n std::shared_ptr<NiceMock<FiniteElementType>> finite_element_ptr_;\n std::shared_ptr<data::CrossSections> cross_sections_ptr_;\n std::shared_ptr<SphericalHarmonicType > spherical_harmonic_ptr_;\n\n\n NiceMock<btest::MockMaterial> mock_material_;\n\n \/\/ test parameters\n const int quadrature_points_ = 4;\n\n void SetUp() override;\n};\n\ntemplate <typename DimensionWrapper>\nvoid CalcCellIntegratedFissionSourceTest<DimensionWrapper>::SetUp() {\n\n std::unordered_map<int, bool> fissile_id_map{{0, true}, {1, false}};\n std::unordered_map<int, std::vector<double>> nu_sigma_f = {\n {0, {1.0, 2.0}},\n {1, {3.0, 6.0}}\n };\n\n ON_CALL(mock_material_, GetFissileIDMap())\n .WillByDefault(Return(fissile_id_map));\n ON_CALL(mock_material_, GetNuSigF())\n .WillByDefault(Return(nu_sigma_f));\n\n finite_element_ptr_ = std::make_shared<NiceMock<FiniteElementType>>();\n cross_sections_ptr_ = std::make_shared<data::CrossSections>(mock_material_);\n spherical_harmonic_ptr_ = std::make_shared<SphericalHarmonicType>();\n\n ON_CALL(*finite_element_ptr_, n_cell_quad_pts())\n .WillByDefault(Return(this->quadrature_points_));\n\n this->SetUpDealii();\n}\n\nTYPED_TEST_CASE(CalcCellIntegratedFissionSourceTest, bart::testing::AllDimensions);\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, Constructor) {\n static constexpr int dim = this->dim;\n\n EXPECT_CALL(*this->finite_element_ptr_, n_cell_quad_pts())\n .WillOnce(DoDefault());\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n EXPECT_EQ(this->finite_element_ptr_.use_count(), 2);\n EXPECT_EQ(this->cross_sections_ptr_.use_count(), 2);\n}\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, CellValueNonFissileMPI) {\n static constexpr int dim = this->dim;\n\n for (auto cell : this->cells_) {\n \/\/ Set to the non-fissile material\n cell->set_material_id(1);\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n double fission_norm = test_calculator.CellValue(\n cell,\n this->spherical_harmonic_ptr_.get());\n EXPECT_EQ(fission_norm, 0.0);\n break;\n }\n}\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, CellValueMPI) {\n static constexpr int dim = this->dim;\n auto& finite_element_mock = *(this->finite_element_ptr_);\n auto& spherical_harmonic_mock = *(this->spherical_harmonic_ptr_);\n\n for (auto cell : this->cells_) {\n \/\/ Set to the non-fissile material\n cell->set_material_id(0);\n\n \/\/ EXPECTATIONS\n \/\/ Jacobian should be called for each quadrature point\n for (int q = 0; q < this->quadrature_points_; ++q) {\n EXPECT_CALL(finite_element_mock, Jacobian(q))\n .Times(2) \/\/ Called twice, once for each group\n .WillRepeatedly(Return(10*(q+1)));\n }\n \/\/ Number of groups should be determined by Spherical Harmonics\n EXPECT_CALL(spherical_harmonic_mock, total_groups())\n .WillOnce(Return(2));\n \/\/ Zeroth moments should be queried for each group\n std::vector<double> group_0_flux{1, 2, 3, 4};\n std::vector<double> group_1_flux{4, 3, 2, 1};\n\n system::moments::MomentVector group_0_flux_vector(group_0_flux.begin(),\n group_0_flux.end());\n system::moments::MomentVector group_1_flux_vector(group_1_flux.begin(),\n group_1_flux.end());\n\n system::moments::MomentIndex group_0_index{0,0,0};\n system::moments::MomentIndex group_1_index{1,0,0};\n\n EXPECT_CALL(spherical_harmonic_mock, GetMoment(group_0_index))\n .WillOnce(ReturnRef(group_0_flux_vector));\n EXPECT_CALL(spherical_harmonic_mock, GetMoment(group_1_index))\n .WillOnce(ReturnRef(group_1_flux_vector));\n EXPECT_CALL(finite_element_mock, ValueAtQuadrature(group_0_flux_vector))\n .WillOnce(Return(group_0_flux));\n EXPECT_CALL(finite_element_mock, ValueAtQuadrature(group_1_flux_vector))\n .WillOnce(Return(group_1_flux));\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n double fission_norm = test_calculator.CellValue(\n cell,\n this->spherical_harmonic_ptr_.get());\n EXPECT_EQ(fission_norm, 700.0);\n break;\n }\n}\n\n\n\n\n} \/\/ namespace<commit_msg>fixed typo in IntegratedFissionSource test<commit_after>#include \"calculator\/cell\/integrated_fission_source.h\"\n\n#include <memory>\n\n#include \"data\/cross_sections.h\"\n#include \"domain\/domain_types.h\"\n#include \"domain\/tests\/finite_element_mock.h\"\n#include \"material\/tests\/mock_material.h\"\n#include \"system\/moments\/spherical_harmonic_types.h\"\n#include \"system\/moments\/tests\/spherical_harmonic_mock.h\"\n#include \"test_helpers\/gmock_wrapper.h\"\n#include \"test_helpers\/dealii_test_domain.h\"\n\n\nnamespace {\n\nusing namespace bart;\n\nusing ::testing::Return, ::testing::ReturnRef, ::testing::DoDefault, ::testing::NiceMock;\n\ntemplate <typename DimensionWrapper>\nclass CalcCellIntegratedFissionSourceTest :\n public ::testing::Test,\n public bart::testing::DealiiTestDomain<DimensionWrapper::value> {\n protected:\n static constexpr int dim = DimensionWrapper::value;\n using FiniteElementType = typename domain::FiniteElementMock<dim>;\n using FissionSourceNormType = typename calculator::cell::IntegratedFissionSource<dim>;\n using SphericalHarmonicType = system::moments::SphericalHarmonicMock;\n\n \/\/ Supporting objects and mocks\n std::shared_ptr<NiceMock<FiniteElementType>> finite_element_ptr_;\n std::shared_ptr<data::CrossSections> cross_sections_ptr_;\n std::shared_ptr<SphericalHarmonicType > spherical_harmonic_ptr_;\n\n\n NiceMock<btest::MockMaterial> mock_material_;\n\n \/\/ test parameters\n const int quadrature_points_ = 4;\n\n void SetUp() override;\n};\n\ntemplate <typename DimensionWrapper>\nvoid CalcCellIntegratedFissionSourceTest<DimensionWrapper>::SetUp() {\n\n std::unordered_map<int, bool> fissile_id_map{{0, true}, {1, false}};\n std::unordered_map<int, std::vector<double>> nu_sigma_f = {\n {0, {1.0, 2.0}},\n {1, {3.0, 6.0}}\n };\n\n ON_CALL(mock_material_, GetFissileIDMap())\n .WillByDefault(Return(fissile_id_map));\n ON_CALL(mock_material_, GetNuSigF())\n .WillByDefault(Return(nu_sigma_f));\n\n finite_element_ptr_ = std::make_shared<NiceMock<FiniteElementType>>();\n cross_sections_ptr_ = std::make_shared<data::CrossSections>(mock_material_);\n spherical_harmonic_ptr_ = std::make_shared<SphericalHarmonicType>();\n\n ON_CALL(*finite_element_ptr_, n_cell_quad_pts())\n .WillByDefault(Return(this->quadrature_points_));\n\n this->SetUpDealii();\n}\n\nTYPED_TEST_CASE(CalcCellIntegratedFissionSourceTest, bart::testing::AllDimensions);\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, Constructor) {\n static constexpr int dim = this->dim;\n\n EXPECT_CALL(*this->finite_element_ptr_, n_cell_quad_pts())\n .WillOnce(DoDefault());\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n EXPECT_EQ(this->finite_element_ptr_.use_count(), 2);\n EXPECT_EQ(this->cross_sections_ptr_.use_count(), 2);\n}\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, CellValueNonFissileMPI) {\n static constexpr int dim = this->dim;\n\n for (auto cell : this->cells_) {\n \/\/ Set to the non-fissile material\n cell->set_material_id(1);\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n double fission_norm = test_calculator.CellValue(\n cell,\n this->spherical_harmonic_ptr_.get());\n EXPECT_EQ(fission_norm, 0.0);\n break;\n }\n}\n\nTYPED_TEST(CalcCellIntegratedFissionSourceTest, CellValueMPI) {\n static constexpr int dim = this->dim;\n auto& finite_element_mock = *(this->finite_element_ptr_);\n auto& spherical_harmonic_mock = *(this->spherical_harmonic_ptr_);\n\n for (auto cell : this->cells_) {\n \/\/ Set to the fissile material\n cell->set_material_id(0);\n\n \/\/ EXPECTATIONS\n \/\/ Jacobian should be called for each quadrature point\n for (int q = 0; q < this->quadrature_points_; ++q) {\n EXPECT_CALL(finite_element_mock, Jacobian(q))\n .Times(2) \/\/ Called twice, once for each group\n .WillRepeatedly(Return(10*(q+1)));\n }\n \/\/ Number of groups should be determined by Spherical Harmonics\n EXPECT_CALL(spherical_harmonic_mock, total_groups())\n .WillOnce(Return(2));\n \/\/ Zeroth moments should be queried for each group\n std::vector<double> group_0_flux{1, 2, 3, 4};\n std::vector<double> group_1_flux{4, 3, 2, 1};\n\n system::moments::MomentVector group_0_flux_vector(group_0_flux.begin(),\n group_0_flux.end());\n system::moments::MomentVector group_1_flux_vector(group_1_flux.begin(),\n group_1_flux.end());\n\n system::moments::MomentIndex group_0_index{0,0,0};\n system::moments::MomentIndex group_1_index{1,0,0};\n\n EXPECT_CALL(spherical_harmonic_mock, GetMoment(group_0_index))\n .WillOnce(ReturnRef(group_0_flux_vector));\n EXPECT_CALL(spherical_harmonic_mock, GetMoment(group_1_index))\n .WillOnce(ReturnRef(group_1_flux_vector));\n EXPECT_CALL(finite_element_mock, ValueAtQuadrature(group_0_flux_vector))\n .WillOnce(Return(group_0_flux));\n EXPECT_CALL(finite_element_mock, ValueAtQuadrature(group_1_flux_vector))\n .WillOnce(Return(group_1_flux));\n\n calculator::cell::IntegratedFissionSource<dim> test_calculator(\n this->finite_element_ptr_,\n this->cross_sections_ptr_);\n\n double fission_norm = test_calculator.CellValue(\n cell,\n this->spherical_harmonic_ptr_.get());\n EXPECT_EQ(fission_norm, 700.0);\n break;\n }\n}\n\n\n\n\n} \/\/ namespace<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitCore *\n * @(#)root\/roofitcore:$Id$\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [CAT] --\n\/\/ RooMappedCategory provides a category-to-category mapping defined\n\/\/ by pattern matching on their state labels\n\/\/\n\/\/ The mapping function consists of a series of wild card regular expressions.\n\/\/ Each expression is matched to the input categories state labels, and an associated\n\/\/ output state label.\n\n#include <cstdio>\n#include <memory>\n#include <cstdlib>\n\n#include \"RooFit.h\"\n\n#include \"Riostream.h\"\n#include \"TString.h\"\n#include \"RooMappedCategory.h\"\n#include \"RooStreamParser.h\"\n#include \"RooMsgService.h\"\n#include \"TBuffer.h\"\n#include \"TString.h\"\n#include \"RooAbsCache.h\"\n\nClassImp(RooMappedCategory)\nClassImp(RooMappedCategory::Entry)\n\nclass RooMappedCategoryCache : public RooAbsCache {\n public:\n RooMappedCategoryCache(RooAbsArg* owner = 0) : RooAbsCache(owner)\n { initialise(); }\n RooMappedCategoryCache(const RooAbsCache& other, RooAbsArg* owner = 0) :\n RooAbsCache(other, owner)\n { initialise(); }\n\n \/\/ look up our parent's output based on our parent's input category index\n const RooCatType* lookup(Int_t idx) const\n { return _map[idx]; }\n\n virtual void wireCache()\n { _map.clear(); initialise(); }\n\n virtual Bool_t redirectServersHook(const RooAbsCollection& \/*newServerList*\/, Bool_t \/*mustReplaceAll*\/, Bool_t \/*nameChange*\/, Bool_t \/*isRecursive*\/)\n { _map.clear(); initialise(); return kFALSE; }\n\n private:\n mutable std::map<Int_t, const RooCatType*> _map;\n\n \/\/ pre-map categories of input category on something easily searchable\n \/\/ like the index (not the name!)\n void initialise()\n {\n const RooMappedCategory& parent = *static_cast<const RooMappedCategory*>(_owner);\n std::unique_ptr<TIterator> tit(static_cast<const RooAbsCategory&>(\n parent._inputCat.arg()).typeIterator());\n for (const RooCatType* inCat = static_cast<const RooCatType*>(tit->Next());\n inCat; inCat = static_cast<const RooCatType*>(tit->Next())) {\n const char* inKey = inCat->GetName();\n \/\/ Scan array of regexps\n bool found = false;\n for (std::map<std::string, RooMappedCategory::Entry>::const_iterator\n iter = parent._mapArray.begin(),\n end = parent._mapArray.end(); end != iter; ++iter) {\n if (iter->second.match(inKey)) {\n found = true;\n _map[inCat->getVal()] = &(iter->second.outCat());\n break;\n }\n }\n if (!found) _map[inCat->getVal()] = parent._defCat;\n }\n }\n};\n\nRooMappedCategory::RooMappedCategory(const char *name, const char *title, RooAbsCategory& inputCat, const char* defOut, Int_t defOutIdx) :\n RooAbsCategory(name, title), _inputCat(\"input\",\"Input category\",this,inputCat),\n _mapcache(0)\n{\n \/\/ Constructor with input category and name of default output state, which is assigned\n \/\/ to all input category states that do not follow any mapping rule.\n if (defOutIdx==NoCatIdx) {\n _defCat = (RooCatType*) defineType(defOut) ;\n } else {\n _defCat = (RooCatType*) defineType(defOut,defOutIdx) ;\n }\n}\n\n\nRooMappedCategory::RooMappedCategory(const RooMappedCategory& other, const char *name) :\n RooAbsCategory(other,name), _inputCat(\"input\",this,other._inputCat), _mapArray(other._mapArray),\n _mapcache(0)\n{\n _defCat = (RooCatType*) lookupType(other._defCat->GetName()) ;\n}\n\n\n\nRooMappedCategory::~RooMappedCategory()\n{\n \/\/ Destructor\n delete _mapcache;\n}\n\n\n\nBool_t RooMappedCategory::map(const char* inKeyRegExp, const char* outKey, Int_t outIdx)\n{\n \/\/ Add mapping rule: any input category state label matching the 'inKeyRegExp'\n \/\/ wildcard expression will be mapped to an output state with name 'outKey'\n \/\/\n \/\/ Rules are evaluated in the order they were added. In case an input state\n \/\/ matches more than one rule, the first rules output state will be assigned\n\n if (!inKeyRegExp || !outKey) return kTRUE ;\n\n \/\/ Check if pattern is already registered\n if (_mapArray.find(inKeyRegExp)!=_mapArray.end()) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName() << \"): ERROR expression \"\n << inKeyRegExp << \" already mapped\" << std::endl ;\n return kTRUE ;\n }\n\n \/\/ Check if output type exists, if not register\n const RooCatType* outType = lookupType(outKey) ;\n if (!outType) {\n if (outIdx==NoCatIdx) {\n outType = defineType(outKey) ;\n } else {\n outType = defineType(outKey,outIdx) ;\n }\n }\n if (!outType) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName()\n << \"): ERROR, unable to output type \" << outKey << std::endl ;\n return kTRUE ;\n }\n\n \/\/ Create new map entry ;\n Entry e(inKeyRegExp,outType) ;\n if (!e.ok()) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName()\n << \"): ERROR, expression \" << inKeyRegExp << \" didn't compile\" << std::endl ;\n return kTRUE ;\n }\n\n _mapArray[inKeyRegExp] = e ;\n return kFALSE ;\n}\n\n\n\nRooCatType RooMappedCategory::evaluate() const\n{\n const RooMappedCategoryCache* cache = getOrCreateCache();\n return *(cache->lookup(Int_t(_inputCat)));\n}\n\nconst RooMappedCategoryCache* RooMappedCategory::getOrCreateCache() const\n{\n if (!_mapcache) _mapcache = new RooMappedCategoryCache(\n const_cast<RooMappedCategory*>(this));\n return _mapcache;\n}\n\nvoid RooMappedCategory::printMultiline(std::ostream& os, Int_t content, Bool_t verbose, TString indent) const\n{\n \/\/ Print info about this mapped category to the specified stream. In addition to the info\n \/\/ from RooAbsCategory::printStream() we add:\n \/\/\n \/\/ Standard : input category\n \/\/ Shape : default value\n \/\/ Verbose : list of mapping rules\n\n RooAbsCategory::printMultiline(os,content,verbose,indent);\n\n if (verbose) {\n os << indent << \"--- RooMappedCategory ---\" << std::endl\n << indent << \" Maps from \" ;\n _inputCat.arg().printStream(os,0,kStandard);\n\n os << indent << \" Default value is \";\n _defCat->printStream(os,kName|kValue,kSingleLine);\n\n os << indent << \" Mapping rules:\" << std::endl;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n os << indent << \" \" << iter->first << \" -> \" << iter->second.outCat().GetName() << std::endl ;\n }\n }\n}\n\n\nBool_t RooMappedCategory::readFromStream(std::istream& is, Bool_t compact, Bool_t \/*verbose*\/)\n{\n \/\/ Read object contents from given stream\n if (compact) {\n coutE(InputArguments) << \"RooMappedCategory::readFromSteam(\" << GetName() << \"): can't read in compact mode\" << std::endl ;\n return kTRUE ;\n } else {\n\n \/\/Clear existing definitions, but preserve default output\n TString defCatName(_defCat->GetName()) ;\n _mapArray.clear() ;\n delete _mapcache;\n _mapcache = 0;\n clearTypes() ;\n _defCat = (RooCatType*) defineType(defCatName) ;\n\n TString token,errorPrefix(\"RooMappedCategory::readFromStream(\") ;\n errorPrefix.Append(GetName()) ;\n errorPrefix.Append(\")\") ;\n RooStreamParser parser(is,errorPrefix) ;\n parser.setPunctuation(\":,\") ;\n\n TString destKey,srcKey ;\n Bool_t readToken(kTRUE) ;\n\n \/\/ Loop over definition sequences\n while(1) {\n if (readToken) token=parser.readToken() ;\n if (token.IsNull()) break ;\n readToken=kTRUE ;\n\n destKey = token ;\n if (parser.expectToken(\":\",kTRUE)) return kTRUE ;\n\n \/\/ Loop over list of sources for this destination\n while(1) {\n srcKey = parser.readToken() ;\n token = parser.readToken() ;\n\n \/\/ Map a value\n if (map(srcKey,destKey)) return kTRUE ;\n\n \/\/ Unless next token is ',' current token\n \/\/ is destination part of next sequence\n if (token.CompareTo(\",\")) {\n readToken = kFALSE ;\n break ;\n }\n }\n }\n return kFALSE ;\n }\n \/\/return kFALSE ; \/\/ statement unreachable (OSF)\n}\n\n\n\/\/_____________________________________________________________________________\nvoid RooMappedCategory::printMetaArgs(std::ostream& os) const\n{\n \/\/ Customized printing of arguments of a RooMappedCategory to more intuitively reflect the contents of the\n \/\/ product operator construction\n\n \/\/ Scan array of regexps\n RooCatType prevOutCat ;\n Bool_t first(kTRUE) ;\n os << \"map=(\" ;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n if (iter->second.outCat().getVal()!=prevOutCat.getVal()) {\n if (!first) { os << \" \" ; }\n first=kFALSE ;\n\n os << iter->second.outCat().GetName() << \":\" << iter->first ;\n prevOutCat=iter->second.outCat() ;\n } else {\n os << \",\" << iter->first ;\n }\n }\n\n if (!first) { os << \" \" ; }\n os << _defCat->GetName() << \":*\" ;\n\n os << \") \" ;\n}\n\n\n\n\nvoid RooMappedCategory::writeToStream(std::ostream& os, Bool_t compact) const\n{\n \/\/ Write object contents to given stream\n if (compact) {\n \/\/ Write value only\n os << getLabel() ;\n } else {\n \/\/ Write mapping expression\n\n \/\/ Scan array of regexps\n RooCatType prevOutCat ;\n Bool_t first(kTRUE) ;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n if (iter->second.outCat().getVal()!=prevOutCat.getVal()) {\n if (!first) { os << \" \" ; }\n first=kFALSE ;\n\n os << iter->second.outCat().GetName() << \"<-\" << iter->first ;\n prevOutCat=iter->second.outCat() ;\n } else {\n os << \",\" << iter->first ;\n }\n }\n\n if (!first) { os << \" \" ; }\n os << _defCat->GetName() << \":*\" ;\n }\n}\n\n\n\n\n\/\/_____________________________________________________________________________\nRooMappedCategory::Entry& RooMappedCategory::Entry::operator=(const RooMappedCategory::Entry& other)\n{\n if (&other==this) return *this ;\n\n _expr = other._expr ;\n _cat = other._cat ;\n\n if (_regexp) {\n delete _regexp ;\n }\n _regexp = new TRegexp(_expr.Data(),kTRUE) ;\n\n return *this;\n}\n\n\n\n\/\/_____________________________________________________________________________\nTString RooMappedCategory::Entry::mangle(const char* exp) const\n{\n \/\/ Mangle name : escape regexp character '+'\n TString t ;\n const char *c = exp ;\n while(*c) {\n if (*c=='+') t.Append('\\\\') ;\n t.Append(*c) ;\n c++ ;\n }\n return t ;\n}\n\n\n\n\/\/_____________________________________________________________________________\nvoid RooMappedCategory::Entry::Streamer(TBuffer &R__b)\n{\n typedef ::RooMappedCategory::Entry ThisClass;\n\n \/\/ Stream an object of class RooWorkspace::CodeRepo.\n if (R__b.IsReading()) {\n\n UInt_t R__s, R__c;\n R__b.ReadVersion(&R__s, &R__c);\n\n \/\/ Stream contents of ClassFiles map\n R__b >> _expr ;\n _cat.Streamer(R__b) ;\n _regexp = new TRegexp(_expr.Data(),kTRUE) ;\n R__b.CheckByteCount(R__s, R__c, ThisClass::IsA());\n\n } else {\n\n UInt_t R__c;\n R__c = R__b.WriteVersion(ThisClass::IsA(), kTRUE);\n\n \/\/ Stream contents of ClassRelInfo map\n R__b << _expr ;\n _cat.Streamer(R__b) ;\n\n R__b.SetByteCount(R__c, kTRUE);\n\n }\n}\n<commit_msg>v5.34 can not require C++11<commit_after>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitCore *\n * @(#)root\/roofitcore:$Id$\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [CAT] --\n\/\/ RooMappedCategory provides a category-to-category mapping defined\n\/\/ by pattern matching on their state labels\n\/\/\n\/\/ The mapping function consists of a series of wild card regular expressions.\n\/\/ Each expression is matched to the input categories state labels, and an associated\n\/\/ output state label.\n\n#include <cstdio>\n#include <memory>\n#include <cstdlib>\n\n#include \"RooFit.h\"\n\n#include \"Riostream.h\"\n#include \"TString.h\"\n#include \"RooMappedCategory.h\"\n#include \"RooStreamParser.h\"\n#include \"RooMsgService.h\"\n#include \"TBuffer.h\"\n#include \"TString.h\"\n#include \"RooAbsCache.h\"\n\nClassImp(RooMappedCategory)\nClassImp(RooMappedCategory::Entry)\n\nclass RooMappedCategoryCache : public RooAbsCache {\n public:\n RooMappedCategoryCache(RooAbsArg* owner = 0) : RooAbsCache(owner)\n { initialise(); }\n RooMappedCategoryCache(const RooAbsCache& other, RooAbsArg* owner = 0) :\n RooAbsCache(other, owner)\n { initialise(); }\n\n \/\/ look up our parent's output based on our parent's input category index\n const RooCatType* lookup(Int_t idx) const\n { return _map[idx]; }\n\n virtual void wireCache()\n { _map.clear(); initialise(); }\n\n virtual Bool_t redirectServersHook(const RooAbsCollection& \/*newServerList*\/, Bool_t \/*mustReplaceAll*\/, Bool_t \/*nameChange*\/, Bool_t \/*isRecursive*\/)\n { _map.clear(); initialise(); return kFALSE; }\n\n private:\n mutable std::map<Int_t, const RooCatType*> _map;\n\n \/\/ pre-map categories of input category on something easily searchable\n \/\/ like the index (not the name!)\n void initialise()\n {\n const RooMappedCategory& parent = *static_cast<const RooMappedCategory*>(_owner);\n TIterator* tit(static_cast<const RooAbsCategory&>(\n parent._inputCat.arg()).typeIterator());\n for (const RooCatType* inCat = static_cast<const RooCatType*>(tit->Next());\n inCat; inCat = static_cast<const RooCatType*>(tit->Next())) {\n const char* inKey = inCat->GetName();\n \/\/ Scan array of regexps\n bool found = false;\n for (std::map<std::string, RooMappedCategory::Entry>::const_iterator\n iter = parent._mapArray.begin(),\n end = parent._mapArray.end(); end != iter; ++iter) {\n if (iter->second.match(inKey)) {\n found = true;\n _map[inCat->getVal()] = &(iter->second.outCat());\n break;\n }\n }\n if (!found) _map[inCat->getVal()] = parent._defCat;\n }\n delete tit;\n }\n};\n\nRooMappedCategory::RooMappedCategory(const char *name, const char *title, RooAbsCategory& inputCat, const char* defOut, Int_t defOutIdx) :\n RooAbsCategory(name, title), _inputCat(\"input\",\"Input category\",this,inputCat),\n _mapcache(0)\n{\n \/\/ Constructor with input category and name of default output state, which is assigned\n \/\/ to all input category states that do not follow any mapping rule.\n if (defOutIdx==NoCatIdx) {\n _defCat = (RooCatType*) defineType(defOut) ;\n } else {\n _defCat = (RooCatType*) defineType(defOut,defOutIdx) ;\n }\n}\n\n\nRooMappedCategory::RooMappedCategory(const RooMappedCategory& other, const char *name) :\n RooAbsCategory(other,name), _inputCat(\"input\",this,other._inputCat), _mapArray(other._mapArray),\n _mapcache(0)\n{\n _defCat = (RooCatType*) lookupType(other._defCat->GetName()) ;\n}\n\n\n\nRooMappedCategory::~RooMappedCategory()\n{\n \/\/ Destructor\n delete _mapcache;\n}\n\n\n\nBool_t RooMappedCategory::map(const char* inKeyRegExp, const char* outKey, Int_t outIdx)\n{\n \/\/ Add mapping rule: any input category state label matching the 'inKeyRegExp'\n \/\/ wildcard expression will be mapped to an output state with name 'outKey'\n \/\/\n \/\/ Rules are evaluated in the order they were added. In case an input state\n \/\/ matches more than one rule, the first rules output state will be assigned\n\n if (!inKeyRegExp || !outKey) return kTRUE ;\n\n \/\/ Check if pattern is already registered\n if (_mapArray.find(inKeyRegExp)!=_mapArray.end()) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName() << \"): ERROR expression \"\n << inKeyRegExp << \" already mapped\" << std::endl ;\n return kTRUE ;\n }\n\n \/\/ Check if output type exists, if not register\n const RooCatType* outType = lookupType(outKey) ;\n if (!outType) {\n if (outIdx==NoCatIdx) {\n outType = defineType(outKey) ;\n } else {\n outType = defineType(outKey,outIdx) ;\n }\n }\n if (!outType) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName()\n << \"): ERROR, unable to output type \" << outKey << std::endl ;\n return kTRUE ;\n }\n\n \/\/ Create new map entry ;\n Entry e(inKeyRegExp,outType) ;\n if (!e.ok()) {\n coutE(InputArguments) << \"RooMappedCategory::map(\" << GetName()\n << \"): ERROR, expression \" << inKeyRegExp << \" didn't compile\" << std::endl ;\n return kTRUE ;\n }\n\n _mapArray[inKeyRegExp] = e ;\n return kFALSE ;\n}\n\n\n\nRooCatType RooMappedCategory::evaluate() const\n{\n const RooMappedCategoryCache* cache = getOrCreateCache();\n return *(cache->lookup(Int_t(_inputCat)));\n}\n\nconst RooMappedCategoryCache* RooMappedCategory::getOrCreateCache() const\n{\n if (!_mapcache) _mapcache = new RooMappedCategoryCache(\n const_cast<RooMappedCategory*>(this));\n return _mapcache;\n}\n\nvoid RooMappedCategory::printMultiline(std::ostream& os, Int_t content, Bool_t verbose, TString indent) const\n{\n \/\/ Print info about this mapped category to the specified stream. In addition to the info\n \/\/ from RooAbsCategory::printStream() we add:\n \/\/\n \/\/ Standard : input category\n \/\/ Shape : default value\n \/\/ Verbose : list of mapping rules\n\n RooAbsCategory::printMultiline(os,content,verbose,indent);\n\n if (verbose) {\n os << indent << \"--- RooMappedCategory ---\" << std::endl\n << indent << \" Maps from \" ;\n _inputCat.arg().printStream(os,0,kStandard);\n\n os << indent << \" Default value is \";\n _defCat->printStream(os,kName|kValue,kSingleLine);\n\n os << indent << \" Mapping rules:\" << std::endl;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n os << indent << \" \" << iter->first << \" -> \" << iter->second.outCat().GetName() << std::endl ;\n }\n }\n}\n\n\nBool_t RooMappedCategory::readFromStream(std::istream& is, Bool_t compact, Bool_t \/*verbose*\/)\n{\n \/\/ Read object contents from given stream\n if (compact) {\n coutE(InputArguments) << \"RooMappedCategory::readFromSteam(\" << GetName() << \"): can't read in compact mode\" << std::endl ;\n return kTRUE ;\n } else {\n\n \/\/Clear existing definitions, but preserve default output\n TString defCatName(_defCat->GetName()) ;\n _mapArray.clear() ;\n delete _mapcache;\n _mapcache = 0;\n clearTypes() ;\n _defCat = (RooCatType*) defineType(defCatName) ;\n\n TString token,errorPrefix(\"RooMappedCategory::readFromStream(\") ;\n errorPrefix.Append(GetName()) ;\n errorPrefix.Append(\")\") ;\n RooStreamParser parser(is,errorPrefix) ;\n parser.setPunctuation(\":,\") ;\n\n TString destKey,srcKey ;\n Bool_t readToken(kTRUE) ;\n\n \/\/ Loop over definition sequences\n while(1) {\n if (readToken) token=parser.readToken() ;\n if (token.IsNull()) break ;\n readToken=kTRUE ;\n\n destKey = token ;\n if (parser.expectToken(\":\",kTRUE)) return kTRUE ;\n\n \/\/ Loop over list of sources for this destination\n while(1) {\n srcKey = parser.readToken() ;\n token = parser.readToken() ;\n\n \/\/ Map a value\n if (map(srcKey,destKey)) return kTRUE ;\n\n \/\/ Unless next token is ',' current token\n \/\/ is destination part of next sequence\n if (token.CompareTo(\",\")) {\n readToken = kFALSE ;\n break ;\n }\n }\n }\n return kFALSE ;\n }\n \/\/return kFALSE ; \/\/ statement unreachable (OSF)\n}\n\n\n\/\/_____________________________________________________________________________\nvoid RooMappedCategory::printMetaArgs(std::ostream& os) const\n{\n \/\/ Customized printing of arguments of a RooMappedCategory to more intuitively reflect the contents of the\n \/\/ product operator construction\n\n \/\/ Scan array of regexps\n RooCatType prevOutCat ;\n Bool_t first(kTRUE) ;\n os << \"map=(\" ;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n if (iter->second.outCat().getVal()!=prevOutCat.getVal()) {\n if (!first) { os << \" \" ; }\n first=kFALSE ;\n\n os << iter->second.outCat().GetName() << \":\" << iter->first ;\n prevOutCat=iter->second.outCat() ;\n } else {\n os << \",\" << iter->first ;\n }\n }\n\n if (!first) { os << \" \" ; }\n os << _defCat->GetName() << \":*\" ;\n\n os << \") \" ;\n}\n\n\n\n\nvoid RooMappedCategory::writeToStream(std::ostream& os, Bool_t compact) const\n{\n \/\/ Write object contents to given stream\n if (compact) {\n \/\/ Write value only\n os << getLabel() ;\n } else {\n \/\/ Write mapping expression\n\n \/\/ Scan array of regexps\n RooCatType prevOutCat ;\n Bool_t first(kTRUE) ;\n for (std::map<std::string,Entry>::const_iterator iter = _mapArray.begin() ; iter!=_mapArray.end() ; iter++) {\n if (iter->second.outCat().getVal()!=prevOutCat.getVal()) {\n if (!first) { os << \" \" ; }\n first=kFALSE ;\n\n os << iter->second.outCat().GetName() << \"<-\" << iter->first ;\n prevOutCat=iter->second.outCat() ;\n } else {\n os << \",\" << iter->first ;\n }\n }\n\n if (!first) { os << \" \" ; }\n os << _defCat->GetName() << \":*\" ;\n }\n}\n\n\n\n\n\/\/_____________________________________________________________________________\nRooMappedCategory::Entry& RooMappedCategory::Entry::operator=(const RooMappedCategory::Entry& other)\n{\n if (&other==this) return *this ;\n\n _expr = other._expr ;\n _cat = other._cat ;\n\n if (_regexp) {\n delete _regexp ;\n }\n _regexp = new TRegexp(_expr.Data(),kTRUE) ;\n\n return *this;\n}\n\n\n\n\/\/_____________________________________________________________________________\nTString RooMappedCategory::Entry::mangle(const char* exp) const\n{\n \/\/ Mangle name : escape regexp character '+'\n TString t ;\n const char *c = exp ;\n while(*c) {\n if (*c=='+') t.Append('\\\\') ;\n t.Append(*c) ;\n c++ ;\n }\n return t ;\n}\n\n\n\n\/\/_____________________________________________________________________________\nvoid RooMappedCategory::Entry::Streamer(TBuffer &R__b)\n{\n typedef ::RooMappedCategory::Entry ThisClass;\n\n \/\/ Stream an object of class RooWorkspace::CodeRepo.\n if (R__b.IsReading()) {\n\n UInt_t R__s, R__c;\n R__b.ReadVersion(&R__s, &R__c);\n\n \/\/ Stream contents of ClassFiles map\n R__b >> _expr ;\n _cat.Streamer(R__b) ;\n _regexp = new TRegexp(_expr.Data(),kTRUE) ;\n R__b.CheckByteCount(R__s, R__c, ThisClass::IsA());\n\n } else {\n\n UInt_t R__c;\n R__c = R__b.WriteVersion(ThisClass::IsA(), kTRUE);\n\n \/\/ Stream contents of ClassRelInfo map\n R__b << _expr ;\n _cat.Streamer(R__b) ;\n\n R__b.SetByteCount(R__c, kTRUE);\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ oryol-shdc\n\/\/------------------------------------------------------------------------------\n#include \"ExportUtil\/CmdLineArgs.h\"\n#include \"ExportUtil\/Log.h\"\n#include \"spirv_hlsl.hpp\"\n#include \"spirv_msl.hpp\"\n#include \"pystring.h\"\n#include \"cJSON.h\"\n#include <stdio.h>\n\nusing namespace OryolTools;\nusing namespace spv;\nusing namespace spirv_cross;\nusing namespace std;\n\n\/\/------------------------------------------------------------------------------\nvector<uint32_t> read_spirv_file(const string& path) {\n FILE* fp = fopen(path.c_str(), \"rb\");\n if (!fp) {\n Log::Fatal(\"Failed to open SPIRV file '%s'\\n\", path.c_str());\n }\n fseek(fp, 0, SEEK_END);\n long len = ftell(fp) \/ sizeof(uint32_t);\n fseek(fp, 0, SEEK_SET);\n vector<uint32_t> spirv(len);\n if (fread(spirv.data(), sizeof(uint32_t), len, fp) != size_t(len)) {\n Log::Fatal(\"Error reading SPIRV file '%s'\\n\", path.c_str());\n }\n fclose(fp);\n return spirv;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid write_source_file(const string& path, const string& content) {\n FILE* fp = fopen(path.c_str(), \"w\");\n if (!fp) {\n Log::Fatal(\"Failed to open '%s' for writing\\n\", path.c_str());\n }\n fwrite(content.c_str(), 1, content.length(), fp);\n fclose(fp);\n}\n\n\/\/------------------------------------------------------------------------------\nconst char* type_to_uniform_type(const SPIRType& type) {\n if (type.basetype == SPIRType::Float) {\n if (type.columns == 1) {\n \/\/ scalar or vec\n switch (type.vecsize) {\n case 1: return \"float\";\n case 2: return \"vec2\";\n case 3: return \"vec3\";\n case 4: return \"vec4\";\n }\n }\n else {\n \/\/ a matrix\n if ((type.vecsize == 2) && (type.columns == 2)) {\n return \"mat2\";\n }\n else if ((type.vecsize == 3) && (type.columns == 3)) {\n return \"mat3\";\n }\n else if ((type.vecsize == 4) && (type.columns == 4)) {\n return \"mat4\";\n }\n }\n }\n else if (type.basetype == SPIRType::Int) {\n return \"int\";\n }\n else if (type.basetype == SPIRType::Boolean) {\n return \"bool\";\n }\n Log::Fatal(\"Invalid member type in uniform block! (expected: float, vec2, vec3, vec4, mat2, mat3, mat4, int, bool)\\n\");\n return nullptr;\n}\n\n\/\/------------------------------------------------------------------------------\nconst char* type_to_attr_format(const SPIRType& type) {\n if (type.basetype == SPIRType::Float && type.columns == 1) {\n switch (type.vecsize) {\n case 1: return \"float\";\n case 2: return \"vec2\";\n case 3: return \"vec3\";\n case 4: return \"vec4\";\n }\n }\n Log::Fatal(\"Invalid vertex attribute type! (expected: float, vec2, vec3, vec4)\\n\");\n return nullptr;\n}\n\n\/\/------------------------------------------------------------------------------\ncJSON* extract_resource_info(Compiler* compiler) {\n cJSON* root = cJSON_CreateObject();\n\n \/\/ shader stage\n const char* stage_str = nullptr;\n switch (compiler->get_execution_model()) {\n case ExecutionModelVertex: stage_str = \"vs\"; break;\n case ExecutionModelFragment: stage_str = \"fs\"; break;\n default: break;\n }\n if (stage_str) {\n cJSON_AddItemToObject(root, \"stage\", cJSON_CreateString(stage_str));\n }\n else {\n Log::Fatal(\"only vertex- or fragment-shaders allowed!\\n\");\n }\n\n \/\/ uniform blocks\n int ub_slot = 0;\n ShaderResources res = compiler->get_shader_resources();\n cJSON* ub_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"uniform_blocks\", ub_array);\n for (const Resource& ub_res : res.uniform_buffers) {\n const SPIRType& ub_type = compiler->get_type(ub_res.base_type_id);\n string ub_name = compiler->get_name(ub_res.id);\n if (ub_name.empty()) {\n char buf[64];\n snprintf(buf, sizeof(buf), \"_%d\", ub_res.id);\n ub_name = buf;\n }\n cJSON* ub = cJSON_CreateObject();\n cJSON_AddItemToArray(ub_array, ub);\n cJSON_AddItemToObject(ub, \"type\", cJSON_CreateString(ub_res.name.c_str()));\n cJSON_AddItemToObject(ub, \"name\", cJSON_CreateString(ub_name.c_str()));\n cJSON_AddItemToObject(ub, \"slot\", cJSON_CreateNumber(ub_slot++));\n cJSON* ub_members = cJSON_CreateArray();\n cJSON_AddItemToObject(ub, \"members\", ub_members);\n for (int m_index = 0; m_index < int(ub_type.member_types.size()); m_index++) {\n cJSON* ub_member = cJSON_CreateObject();\n cJSON_AddItemToArray(ub_members, ub_member);\n string m_name = compiler->get_member_name(ub_res.base_type_id, m_index);\n const SPIRType& m_type = compiler->get_type(ub_type.member_types[m_index]);\n const char* m_type_str = type_to_uniform_type(m_type);\n cJSON_AddItemToObject(ub_member, \"name\", cJSON_CreateString(m_name.c_str()));\n cJSON_AddItemToObject(ub_member, \"type\", cJSON_CreateString(m_type_str));\n int num = 1;\n if (m_type.array.size() > 0) {\n num = m_type.array[0];\n }\n cJSON_AddItemToObject(ub_member, \"num\", cJSON_CreateNumber(num));\n }\n }\n\n \/\/ textures\n int tex_slot = 0;\n cJSON* tex_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"textures\", tex_array);\n for (const Resource& img_res : res.sampled_images) {\n const SPIRType& img_type = compiler->get_type(img_res.type_id);\n cJSON* tex = cJSON_CreateObject();\n cJSON_AddItemToArray(tex_array, tex);\n const char* tex_type_str = nullptr;\n if (img_type.image.arrayed) {\n if (img_type.image.dim == Dim2D) {\n tex_type_str = \"sampler2DArray\";\n }\n }\n else {\n switch (img_type.image.dim) {\n case Dim2D: tex_type_str = \"sampler2D\"; break;\n case DimCube: tex_type_str = \"samplerCube\"; break;\n case Dim3D: tex_type_str = \"sampler3D\"; break;\n default: break;\n }\n }\n if (!tex_type_str) {\n Log::Fatal(\"Invalid texture type! (expected: 2D, Cube, 3D or 2D-array)\\n\");\n }\n cJSON_AddItemToObject(tex, \"name\", cJSON_CreateString(img_res.name.c_str()));\n cJSON_AddItemToObject(tex, \"type\", cJSON_CreateString(tex_type_str));\n cJSON_AddItemToObject(tex, \"slot\", cJSON_CreateNumber(tex_slot++));\n }\n\n \/\/ stage inputs\n cJSON* inputs_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"inputs\", inputs_array);\n for (const Resource& stage_input : res.stage_inputs) {\n cJSON* input = cJSON_CreateObject();\n cJSON_AddItemToArray(inputs_array, input);\n const SPIRType& type = compiler->get_type(stage_input.base_type_id);\n const char* type_str = type_to_attr_format(type);\n cJSON_AddItemToObject(input, \"name\", cJSON_CreateString(stage_input.name.c_str()));\n cJSON_AddItemToObject(input, \"type\", cJSON_CreateString(type_str));\n if (compiler->get_execution_model() == ExecutionModelVertex) {\n uint32_t loc = compiler->get_decoration(stage_input.id, DecorationLocation);\n cJSON_AddItemToObject(input, \"slot\", cJSON_CreateNumber(loc));\n }\n }\n\n \/\/ stage outputs\n cJSON* outputs_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"outputs\", outputs_array);\n for (const Resource& stage_output : res.stage_outputs) {\n cJSON* output = cJSON_CreateObject();\n cJSON_AddItemToArray(outputs_array, output);\n const SPIRType& type = compiler->get_type(stage_output.base_type_id);\n const char* type_str = type_to_attr_format(type);\n cJSON_AddItemToObject(output, \"name\", cJSON_CreateString(stage_output.name.c_str()));\n cJSON_AddItemToObject(output, \"type\", cJSON_CreateString(type_str));\n }\n\n return root;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid fix_vertex_attr_locations(Compiler* compiler) {\n if (compiler->get_execution_model() == ExecutionModelVertex) {\n ShaderResources res = compiler->get_shader_resources();\n for (const auto& input : res.stage_inputs) {\n int loc = -1;\n if (input.name == \"position\") loc = 0;\n else if (input.name == \"normal\") loc = 1;\n else if (input.name == \"texcoord0\") loc = 2;\n else if (input.name == \"texcoord1\") loc = 3;\n else if (input.name == \"texcoord2\") loc = 4;\n else if (input.name == \"texcoord3\") loc = 5;\n else if (input.name == \"tangent\") loc = 6;\n else if (input.name == \"binormal\") loc = 7;\n else if (input.name == \"weights\") loc = 8;\n else if (input.name == \"indices\") loc = 9;\n else if (input.name == \"color0\") loc = 10;\n else if (input.name == \"color1\") loc = 11;\n else if (input.name == \"instance0\") loc = 12;\n else if (input.name == \"instance1\") loc = 13;\n else if (input.name == \"instance2\") loc = 14;\n else if (input.name == \"instance3\") loc = 15;\n if (-1 != loc) {\n compiler->set_decoration(input.id, DecorationLocation, (uint32_t)loc);\n }\n }\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_reflection_json(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerGLSL compiler(spirv);\n fix_vertex_attr_locations(&compiler);\n cJSON* json = extract_resource_info(&compiler);\n char* json_raw_str = cJSON_Print(json);\n string json_str(json_raw_str);\n std::free(json_raw_str);\n cJSON_Delete(json);\n write_source_file(base_path + \".json\", json_str);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_glsl(const vector<uint32_t>& spirv, const string& base_path, const string& file_ext, uint32_t version, bool is_es) {\n CompilerGLSL compiler(spirv);\n auto opts = compiler.get_options();\n opts.version = version;\n opts.es = is_es;\n opts.vertex.fixup_clipspace = false;\n compiler.set_options(opts);\n fix_vertex_attr_locations(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile GLSL v100 source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + file_ext, src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_hlsl_sm5(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerHLSL compiler(spirv);\n auto opts = compiler.get_options();\n opts.shader_model = 50;\n opts.fixup_clipspace = true;\n compiler.set_options(opts);\n fix_vertex_attr_locations(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile HLSL5 source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + \".hlsl\", src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_mlsl(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerMSL compiler(spirv);\n fix_vertex_attr_locations(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile MetalSL source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + \".metal\", src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nint main(int argc, const char** argv) {\n CmdLineArgs args;\n args.AddBool(\"-help\", \"show help\");\n args.AddString(\"-spirv\", \"SPIR-V input file\", \"\");\n if (!args.Parse(argc, argv)) {\n Log::Warn(\"Failed to parse args!\\n\");\n return 10; \n }\n\n if (args.HasArg(\"-help\")) {\n Log::Info(\"Oryol SPIR-V to GLSL\/HLSL\/MSL cross-compiler\\n\"\n \"Based on SPIRV-Cross: https:\/\/github.com\/KhronosGroup\/SPIRV-Cross\\n\");\n args.ShowHelp();\n return 0; \n }\n string spirv_path = args.GetString(\"-spirv\");\n if (spirv_path.empty()) {\n Log::Fatal(\"-spirv arg expected\");\n }\n\n \/\/ load SPIRV byte code\n auto spirv = read_spirv_file(spirv_path);\n\n \/\/ ...translate and write to output files...\n string base_path, ext;\n pystring::os::path::splitext(base_path, ext, spirv_path);\n to_reflection_json(spirv, base_path);\n to_glsl(spirv, base_path, \".glsl100.glsl\", 100, true);\n to_glsl(spirv, base_path, \".glsl120.glsl\", 120, false);\n to_glsl(spirv, base_path, \".glsles3.glsl\", 300, true);\n to_glsl(spirv, base_path, \".glsl330.glsl\", 330, false);\n to_hlsl_sm5(spirv, base_path);\n to_mlsl(spirv, base_path);\n\n return 0;\n}\n<commit_msg>Force ub matrices to ColMajor<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ oryol-shdc\n\/\/------------------------------------------------------------------------------\n#include \"ExportUtil\/CmdLineArgs.h\"\n#include \"ExportUtil\/Log.h\"\n#include \"spirv_hlsl.hpp\"\n#include \"spirv_msl.hpp\"\n#include \"pystring.h\"\n#include \"cJSON.h\"\n#include <stdio.h>\n\nusing namespace OryolTools;\nusing namespace spv;\nusing namespace spirv_cross;\nusing namespace std;\n\n\/\/------------------------------------------------------------------------------\nvector<uint32_t> read_spirv_file(const string& path) {\n FILE* fp = fopen(path.c_str(), \"rb\");\n if (!fp) {\n Log::Fatal(\"Failed to open SPIRV file '%s'\\n\", path.c_str());\n }\n fseek(fp, 0, SEEK_END);\n long len = ftell(fp) \/ sizeof(uint32_t);\n fseek(fp, 0, SEEK_SET);\n vector<uint32_t> spirv(len);\n if (fread(spirv.data(), sizeof(uint32_t), len, fp) != size_t(len)) {\n Log::Fatal(\"Error reading SPIRV file '%s'\\n\", path.c_str());\n }\n fclose(fp);\n return spirv;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid write_source_file(const string& path, const string& content) {\n FILE* fp = fopen(path.c_str(), \"w\");\n if (!fp) {\n Log::Fatal(\"Failed to open '%s' for writing\\n\", path.c_str());\n }\n fwrite(content.c_str(), 1, content.length(), fp);\n fclose(fp);\n}\n\n\/\/------------------------------------------------------------------------------\nconst char* type_to_uniform_type(const SPIRType& type) {\n if (type.basetype == SPIRType::Float) {\n if (type.columns == 1) {\n \/\/ scalar or vec\n switch (type.vecsize) {\n case 1: return \"float\";\n case 2: return \"vec2\";\n case 3: return \"vec3\";\n case 4: return \"vec4\";\n }\n }\n else {\n \/\/ a matrix\n if ((type.vecsize == 2) && (type.columns == 2)) {\n return \"mat2\";\n }\n else if ((type.vecsize == 3) && (type.columns == 3)) {\n return \"mat3\";\n }\n else if ((type.vecsize == 4) && (type.columns == 4)) {\n return \"mat4\";\n }\n }\n }\n else if (type.basetype == SPIRType::Int) {\n return \"int\";\n }\n else if (type.basetype == SPIRType::Boolean) {\n return \"bool\";\n }\n Log::Fatal(\"Invalid member type in uniform block! (expected: float, vec2, vec3, vec4, mat2, mat3, mat4, int, bool)\\n\");\n return nullptr;\n}\n\n\/\/------------------------------------------------------------------------------\nconst char* type_to_attr_format(const SPIRType& type) {\n if (type.basetype == SPIRType::Float && type.columns == 1) {\n switch (type.vecsize) {\n case 1: return \"float\";\n case 2: return \"vec2\";\n case 3: return \"vec3\";\n case 4: return \"vec4\";\n }\n }\n Log::Fatal(\"Invalid vertex attribute type! (expected: float, vec2, vec3, vec4)\\n\");\n return nullptr;\n}\n\n\/\/------------------------------------------------------------------------------\ncJSON* extract_resource_info(Compiler* compiler) {\n cJSON* root = cJSON_CreateObject();\n\n \/\/ shader stage\n const char* stage_str = nullptr;\n switch (compiler->get_execution_model()) {\n case ExecutionModelVertex: stage_str = \"vs\"; break;\n case ExecutionModelFragment: stage_str = \"fs\"; break;\n default: break;\n }\n if (stage_str) {\n cJSON_AddItemToObject(root, \"stage\", cJSON_CreateString(stage_str));\n }\n else {\n Log::Fatal(\"only vertex- or fragment-shaders allowed!\\n\");\n }\n\n \/\/ uniform blocks\n int ub_slot = 0;\n ShaderResources res = compiler->get_shader_resources();\n cJSON* ub_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"uniform_blocks\", ub_array);\n for (const Resource& ub_res : res.uniform_buffers) {\n const SPIRType& ub_type = compiler->get_type(ub_res.base_type_id);\n string ub_name = compiler->get_name(ub_res.id);\n if (ub_name.empty()) {\n char buf[64];\n snprintf(buf, sizeof(buf), \"_%d\", ub_res.id);\n ub_name = buf;\n }\n cJSON* ub = cJSON_CreateObject();\n cJSON_AddItemToArray(ub_array, ub);\n cJSON_AddItemToObject(ub, \"type\", cJSON_CreateString(ub_res.name.c_str()));\n cJSON_AddItemToObject(ub, \"name\", cJSON_CreateString(ub_name.c_str()));\n cJSON_AddItemToObject(ub, \"slot\", cJSON_CreateNumber(ub_slot++));\n cJSON* ub_members = cJSON_CreateArray();\n cJSON_AddItemToObject(ub, \"members\", ub_members);\n for (int m_index = 0; m_index < int(ub_type.member_types.size()); m_index++) {\n cJSON* ub_member = cJSON_CreateObject();\n cJSON_AddItemToArray(ub_members, ub_member);\n string m_name = compiler->get_member_name(ub_res.base_type_id, m_index);\n const SPIRType& m_type = compiler->get_type(ub_type.member_types[m_index]);\n const char* m_type_str = type_to_uniform_type(m_type);\n cJSON_AddItemToObject(ub_member, \"name\", cJSON_CreateString(m_name.c_str()));\n cJSON_AddItemToObject(ub_member, \"type\", cJSON_CreateString(m_type_str));\n int num = 1;\n if (m_type.array.size() > 0) {\n num = m_type.array[0];\n }\n cJSON_AddItemToObject(ub_member, \"num\", cJSON_CreateNumber(num));\n }\n }\n\n \/\/ textures\n int tex_slot = 0;\n cJSON* tex_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"textures\", tex_array);\n for (const Resource& img_res : res.sampled_images) {\n const SPIRType& img_type = compiler->get_type(img_res.type_id);\n cJSON* tex = cJSON_CreateObject();\n cJSON_AddItemToArray(tex_array, tex);\n const char* tex_type_str = nullptr;\n if (img_type.image.arrayed) {\n if (img_type.image.dim == Dim2D) {\n tex_type_str = \"sampler2DArray\";\n }\n }\n else {\n switch (img_type.image.dim) {\n case Dim2D: tex_type_str = \"sampler2D\"; break;\n case DimCube: tex_type_str = \"samplerCube\"; break;\n case Dim3D: tex_type_str = \"sampler3D\"; break;\n default: break;\n }\n }\n if (!tex_type_str) {\n Log::Fatal(\"Invalid texture type! (expected: 2D, Cube, 3D or 2D-array)\\n\");\n }\n cJSON_AddItemToObject(tex, \"name\", cJSON_CreateString(img_res.name.c_str()));\n cJSON_AddItemToObject(tex, \"type\", cJSON_CreateString(tex_type_str));\n cJSON_AddItemToObject(tex, \"slot\", cJSON_CreateNumber(tex_slot++));\n }\n\n \/\/ stage inputs\n cJSON* inputs_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"inputs\", inputs_array);\n for (const Resource& stage_input : res.stage_inputs) {\n cJSON* input = cJSON_CreateObject();\n cJSON_AddItemToArray(inputs_array, input);\n const SPIRType& type = compiler->get_type(stage_input.base_type_id);\n const char* type_str = type_to_attr_format(type);\n cJSON_AddItemToObject(input, \"name\", cJSON_CreateString(stage_input.name.c_str()));\n cJSON_AddItemToObject(input, \"type\", cJSON_CreateString(type_str));\n if (compiler->get_execution_model() == ExecutionModelVertex) {\n uint32_t loc = compiler->get_decoration(stage_input.id, DecorationLocation);\n cJSON_AddItemToObject(input, \"slot\", cJSON_CreateNumber(loc));\n }\n }\n\n \/\/ stage outputs\n cJSON* outputs_array = cJSON_CreateArray();\n cJSON_AddItemToObject(root, \"outputs\", outputs_array);\n for (const Resource& stage_output : res.stage_outputs) {\n cJSON* output = cJSON_CreateObject();\n cJSON_AddItemToArray(outputs_array, output);\n const SPIRType& type = compiler->get_type(stage_output.base_type_id);\n const char* type_str = type_to_attr_format(type);\n cJSON_AddItemToObject(output, \"name\", cJSON_CreateString(stage_output.name.c_str()));\n cJSON_AddItemToObject(output, \"type\", cJSON_CreateString(type_str));\n }\n\n return root;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid fix_vertex_attr_locations(Compiler* compiler) {\n if (compiler->get_execution_model() == ExecutionModelVertex) {\n ShaderResources res = compiler->get_shader_resources();\n for (const auto& input : res.stage_inputs) {\n int loc = -1;\n if (input.name == \"position\") loc = 0;\n else if (input.name == \"normal\") loc = 1;\n else if (input.name == \"texcoord0\") loc = 2;\n else if (input.name == \"texcoord1\") loc = 3;\n else if (input.name == \"texcoord2\") loc = 4;\n else if (input.name == \"texcoord3\") loc = 5;\n else if (input.name == \"tangent\") loc = 6;\n else if (input.name == \"binormal\") loc = 7;\n else if (input.name == \"weights\") loc = 8;\n else if (input.name == \"indices\") loc = 9;\n else if (input.name == \"color0\") loc = 10;\n else if (input.name == \"color1\") loc = 11;\n else if (input.name == \"instance0\") loc = 12;\n else if (input.name == \"instance1\") loc = 13;\n else if (input.name == \"instance2\") loc = 14;\n else if (input.name == \"instance3\") loc = 15;\n if (-1 != loc) {\n compiler->set_decoration(input.id, DecorationLocation, (uint32_t)loc);\n }\n }\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid fix_ub_matrix_force_colmajor(Compiler* compiler) {\n \/\/ go though all uniform block matrixes and decorate them with\n \/\/ column-major, this is needed in the HLSL backend to fix the\n \/\/ multiplication order\n ShaderResources res = compiler->get_shader_resources();\n for (const Resource& ub_res : res.uniform_buffers) {\n const SPIRType& ub_type = compiler->get_type(ub_res.base_type_id);\n for (int m_index = 0; m_index < int(ub_type.member_types.size()); m_index++) {\n const SPIRType& m_type = compiler->get_type(ub_type.member_types[m_index]);\n if ((m_type.basetype == SPIRType::Float) && (m_type.vecsize > 1) && (m_type.columns > 1)) {\n compiler->set_member_decoration(ub_res.base_type_id, m_index, DecorationColMajor);\n }\n }\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_reflection_json(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerGLSL compiler(spirv);\n fix_vertex_attr_locations(&compiler);\n cJSON* json = extract_resource_info(&compiler);\n char* json_raw_str = cJSON_Print(json);\n string json_str(json_raw_str);\n std::free(json_raw_str);\n cJSON_Delete(json);\n write_source_file(base_path + \".json\", json_str);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_glsl(const vector<uint32_t>& spirv, const string& base_path, const string& file_ext, uint32_t version, bool is_es) {\n CompilerGLSL compiler(spirv);\n auto opts = compiler.get_options();\n opts.version = version;\n opts.es = is_es;\n opts.vertex.fixup_clipspace = false;\n compiler.set_options(opts);\n fix_vertex_attr_locations(&compiler);\n fix_ub_matrix_force_colmajor(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile GLSL v100 source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + file_ext, src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_hlsl_sm5(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerHLSL compiler(spirv);\n auto opts = compiler.get_options();\n opts.shader_model = 50;\n opts.fixup_clipspace = true;\n compiler.set_options(opts);\n fix_vertex_attr_locations(&compiler);\n fix_ub_matrix_force_colmajor(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile HLSL5 source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + \".hlsl\", src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nvoid to_mlsl(const vector<uint32_t>& spirv, const string& base_path) {\n CompilerMSL compiler(spirv);\n fix_vertex_attr_locations(&compiler);\n string src = compiler.compile();\n if (src.empty()) {\n Log::Fatal(\"Failed to compile MetalSL source for '%s'!\\n\", base_path.c_str());\n }\n else {\n write_source_file(base_path + \".metal\", src);\n }\n}\n\n\/\/------------------------------------------------------------------------------\nint main(int argc, const char** argv) {\n CmdLineArgs args;\n args.AddBool(\"-help\", \"show help\");\n args.AddString(\"-spirv\", \"SPIR-V input file\", \"\");\n if (!args.Parse(argc, argv)) {\n Log::Warn(\"Failed to parse args!\\n\");\n return 10; \n }\n\n if (args.HasArg(\"-help\")) {\n Log::Info(\"Oryol SPIR-V to GLSL\/HLSL\/MSL cross-compiler\\n\"\n \"Based on SPIRV-Cross: https:\/\/github.com\/KhronosGroup\/SPIRV-Cross\\n\");\n args.ShowHelp();\n return 0; \n }\n string spirv_path = args.GetString(\"-spirv\");\n if (spirv_path.empty()) {\n Log::Fatal(\"-spirv arg expected\");\n }\n\n \/\/ load SPIRV byte code\n auto spirv = read_spirv_file(spirv_path);\n\n \/\/ ...translate and write to output files...\n string base_path, ext;\n pystring::os::path::splitext(base_path, ext, spirv_path);\n to_reflection_json(spirv, base_path);\n to_glsl(spirv, base_path, \".glsl100.glsl\", 100, true);\n to_glsl(spirv, base_path, \".glsl120.glsl\", 120, false);\n to_glsl(spirv, base_path, \".glsles3.glsl\", 300, true);\n to_glsl(spirv, base_path, \".glsl330.glsl\", 330, false);\n to_hlsl_sm5(spirv, base_path);\n to_mlsl(spirv, base_path);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n +----------------------------------------------------------------------+\n | Swoole |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.0 of the Apache license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http:\/\/www.apache.org\/licenses\/LICENSE-2.0.html |\n | If you did not receive a copy of the Apache2.0 license and are unable|\n | to obtain it through the world-wide-web, please send a note to |\n | license@swoole.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Author: Tianfeng Han <mikan.tenny@gmail.com> |\n +----------------------------------------------------------------------+\n *\/\n\n#include \"swoole_api.h\"\n#include \"async.h\"\n\n#include <thread>\n#include <atomic>\n#include <unordered_map>\n#include <condition_variable>\n#include <mutex>\n#include <queue>\n\nusing namespace std;\n\ntypedef swAio_event async_event;\n\nswAsyncIO SwooleAIO;\n\nstatic void swAio_free(void *private_data);\n\nint swAio_callback(swReactor *reactor, swEvent *_event)\n{\n int i;\n async_event *events[SW_AIO_EVENT_NUM];\n ssize_t n = read(_event->fd, events, sizeof(async_event*) * SW_AIO_EVENT_NUM);\n if (n < 0)\n {\n swSysWarn(\"read() failed\");\n return SW_ERR;\n }\n for (i = 0; i < n \/ (int) sizeof(async_event*); i++)\n {\n if (!events[i]->canceled)\n {\n events[i]->callback(events[i]);\n }\n SwooleAIO.task_num--;\n delete events[i];\n }\n return SW_OK;\n}\n\nclass async_event_queue\n{\npublic:\n inline bool push(async_event *event)\n {\n unique_lock<mutex> lock(_mutex);\n _queue.push(event);\n return true;\n }\n inline async_event* pop()\n {\n unique_lock<mutex> lock(_mutex);\n if (_queue.empty())\n {\n return nullptr;\n }\n async_event* retval = _queue.front();\n _queue.pop();\n return retval;\n }\n inline bool empty()\n {\n unique_lock<mutex> lock(_mutex);\n return _queue.empty();\n }\n inline size_t count()\n {\n return _queue.size();\n }\nprivate:\n queue<async_event*> _queue;\n mutex _mutex;\n};\n\nclass async_thread_pool\n{\npublic:\n async_thread_pool(int _min_threads, int _max_threads)\n {\n n_waiting = 0;\n running = false;\n min_threads = _min_threads;\n max_threads = _max_threads;\n current_task_id = 0;\n current_pid = getpid();\n\n if (swPipeBase_create(&_aio_pipe, 0) < 0)\n {\n swoole_throw_error(SW_ERROR_SYSTEM_CALL_FAIL);\n }\n _pipe_read = _aio_pipe.getFd(&_aio_pipe, 0);\n _pipe_write = _aio_pipe.getFd(&_aio_pipe, 1);\n swoole_event_add(_pipe_read, SW_EVENT_READ, SW_FD_AIO);\n }\n\n ~async_thread_pool()\n {\n shutdown();\n if (SwooleTG.reactor)\n {\n swoole_event_del(_pipe_read);\n }\n _aio_pipe.close(&_aio_pipe);\n }\n\n void schedule()\n {\n int i = (int) threads.size();\n \/\/++\n if (n_waiting == 0 && i < max_threads)\n {\n create_thread(i);\n }\n \/\/--\n else if (n_waiting > min_threads)\n {\n i -= 1;\n *exit_flags[i] = true;\n threads[i]->detach();\n threads.erase(i);\n exit_flags.erase(i);\n }\n }\n\n bool start()\n {\n running = true;\n for (int i = 0; i < min_threads; i++)\n {\n create_thread(i);\n }\n return true;\n }\n\n bool shutdown()\n {\n if (!running)\n {\n return false;\n }\n running = false;\n\n _mutex.lock();\n _cv.notify_all();\n _mutex.unlock();\n\n for (int i = 0; i < static_cast<int>(threads.size()); ++i)\n {\n if (threads[i]->joinable())\n {\n threads[i]->join();\n }\n }\n\n threads.clear();\n exit_flags.clear();\n return true;\n }\n\n async_event* dispatch(const async_event *request)\n {\n auto _event_copy = new async_event(*request);\n schedule();\n _event_copy->task_id = current_task_id++;\n queue.push(_event_copy);\n _cv.notify_one();\n return _event_copy;\n }\n\n inline size_t thread_count()\n {\n return threads.size();\n }\n\n inline size_t queue_count()\n {\n return queue.count();\n }\n\n pid_t current_pid;\n\nprivate:\n void create_thread(int i)\n {\n exit_flags[i] = make_shared<atomic<bool>>(false);\n shared_ptr<atomic<bool>> flag(exit_flags[i]);\n thread *_thread;\n\n try\n {\n _thread = new thread([this, flag]()\n {\n SwooleTG.buffer_stack = swString_new(SW_STACK_BUFFER_SIZE);\n if (SwooleTG.buffer_stack == nullptr)\n {\n return;\n }\n\n swSignal_none();\n\n atomic<bool> &_flag = *flag;\n async_event *event;\n _accept:\n event = queue.pop();\n if (event)\n {\n if (sw_unlikely(event->handler == nullptr))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else if (sw_unlikely(event->canceled))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else\n {\n event->handler(event);\n }\n\n swTrace(\"aio_thread ok. ret=%d, error=%d\", event->ret, event->error);\n\n _error:\n while (true)\n {\n SwooleAIO.lock.lock(&SwooleAIO.lock);\n int ret = write(_pipe_write, &event, sizeof(event));\n SwooleAIO.lock.unlock(&SwooleAIO.lock);\n if (ret < 0)\n {\n if (errno == EAGAIN)\n {\n swSocket_wait(_pipe_write, 1000, SW_EVENT_WRITE);\n continue;\n }\n else if (errno == EINTR)\n {\n continue;\n }\n else\n {\n swSysWarn(\"sendto swoole_aio_pipe_write failed\");\n }\n }\n break;\n }\n \/\/exit\n if (_flag)\n {\n return;\n }\n }\n else\n {\n unique_lock<mutex> lock(_mutex);\n if (running)\n {\n ++n_waiting;\n _cv.wait(lock);\n --n_waiting;\n }\n }\n if (running)\n {\n goto _accept;\n }\n });\n }\n catch (const std::system_error& e)\n {\n swSysNotice(\"create aio thread#%d failed, please check your system configuration or adjust max_thread_count\", i);\n return;\n }\n\n threads[i] = unique_ptr<thread>(_thread);\n }\n\n swPipe _aio_pipe;\n int _pipe_read;\n int _pipe_write;\n int current_task_id;\n\n unordered_map<int, unique_ptr<thread>> threads;\n unordered_map<int, shared_ptr<atomic<bool>>> exit_flags;\n\n async_event_queue queue;\n bool running;\n atomic<int> n_waiting;\n int min_threads;\n int max_threads;\n mutex _mutex;\n condition_variable _cv;\n};\n\nstatic async_thread_pool *pool = nullptr;\n\nstatic int swAio_init()\n{\n if (SwooleAIO.init)\n {\n swWarn(\"AIO has already been initialized\");\n return SW_ERR;\n }\n if (!SwooleTG.reactor)\n {\n swWarn(\"no event loop, cannot initialized\");\n return SW_ERR;\n }\n\n if (swMutex_create(&SwooleAIO.lock, 0) < 0)\n {\n swWarn(\"create mutex lock error\");\n return SW_ERR;\n }\n\n if (SwooleAIO.min_thread_count == 0)\n {\n SwooleAIO.min_thread_count = SW_AIO_THREAD_DEFAULT_NUM;\n }\n if (SwooleAIO.max_thread_count == 0)\n {\n SwooleAIO.max_thread_count = (SW_CPU_NUM * 2) * SW_AIO_THREAD_NUM_MULTIPLE;\n }\n if (SwooleAIO.min_thread_count > SwooleAIO.max_thread_count)\n {\n SwooleAIO.max_thread_count = SwooleAIO.min_thread_count;\n }\n\n swReactor_add_destroy_callback(SwooleTG.reactor, swAio_free, nullptr);\n\n pool = new async_thread_pool(SwooleAIO.min_thread_count, SwooleAIO.max_thread_count);\n pool->start();\n SwooleAIO.init = 1;\n\n return SW_OK;\n}\n\nsize_t swAio_thread_count()\n{\n return pool ? pool->thread_count() : 0;\n}\n\nint swAio_dispatch(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n async_event *event = pool->dispatch(request);\n return event->task_id;\n}\n\nswAio_event* swAio_dispatch2(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n return pool->dispatch(request);\n}\n\nstatic void swAio_free(void *private_data)\n{\n if (!SwooleAIO.init)\n {\n return;\n }\n if (pool->current_pid == getpid())\n {\n delete pool;\n }\n pool = nullptr;\n SwooleAIO.init = 0;\n}\n<commit_msg>Remove shared ptr<commit_after>\/*\n +----------------------------------------------------------------------+\n | Swoole |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.0 of the Apache license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http:\/\/www.apache.org\/licenses\/LICENSE-2.0.html |\n | If you did not receive a copy of the Apache2.0 license and are unable|\n | to obtain it through the world-wide-web, please send a note to |\n | license@swoole.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Author: Tianfeng Han <mikan.tenny@gmail.com> |\n +----------------------------------------------------------------------+\n *\/\n\n#include \"swoole_api.h\"\n#include \"async.h\"\n\n#include <thread>\n#include <atomic>\n#include <unordered_map>\n#include <condition_variable>\n#include <mutex>\n#include <queue>\n\nusing namespace std;\n\ntypedef swAio_event async_event;\n\nswAsyncIO SwooleAIO;\n\nstatic void swAio_free(void *private_data);\n\nint swAio_callback(swReactor *reactor, swEvent *_event)\n{\n int i;\n async_event *events[SW_AIO_EVENT_NUM];\n ssize_t n = read(_event->fd, events, sizeof(async_event*) * SW_AIO_EVENT_NUM);\n if (n < 0)\n {\n swSysWarn(\"read() failed\");\n return SW_ERR;\n }\n for (i = 0; i < n \/ (int) sizeof(async_event*); i++)\n {\n if (!events[i]->canceled)\n {\n events[i]->callback(events[i]);\n }\n SwooleAIO.task_num--;\n delete events[i];\n }\n return SW_OK;\n}\n\nclass async_event_queue\n{\npublic:\n inline bool push(async_event *event)\n {\n unique_lock<mutex> lock(_mutex);\n _queue.push(event);\n return true;\n }\n inline async_event* pop()\n {\n unique_lock<mutex> lock(_mutex);\n if (_queue.empty())\n {\n return nullptr;\n }\n async_event* retval = _queue.front();\n _queue.pop();\n return retval;\n }\n inline bool empty()\n {\n unique_lock<mutex> lock(_mutex);\n return _queue.empty();\n }\n inline size_t count()\n {\n return _queue.size();\n }\nprivate:\n queue<async_event*> _queue;\n mutex _mutex;\n};\n\nclass async_thread_pool\n{\npublic:\n async_thread_pool(int _min_threads, int _max_threads)\n {\n n_waiting = 0;\n running = false;\n min_threads = _min_threads;\n max_threads = _max_threads;\n current_task_id = 0;\n current_pid = getpid();\n\n if (swPipeBase_create(&_aio_pipe, 0) < 0)\n {\n swoole_throw_error(SW_ERROR_SYSTEM_CALL_FAIL);\n }\n _pipe_read = _aio_pipe.getFd(&_aio_pipe, 0);\n _pipe_write = _aio_pipe.getFd(&_aio_pipe, 1);\n swoole_event_add(_pipe_read, SW_EVENT_READ, SW_FD_AIO);\n }\n\n ~async_thread_pool()\n {\n shutdown();\n if (SwooleTG.reactor)\n {\n swoole_event_del(_pipe_read);\n }\n _aio_pipe.close(&_aio_pipe);\n }\n\n void schedule()\n {\n int i = (int) threads.size();\n \/\/++\n if (n_waiting == 0 && i < max_threads)\n {\n create_thread(i);\n }\n \/\/--\n else if (n_waiting > min_threads)\n {\n i -= 1;\n exit_flags[i] = true;\n threads[i]->detach();\n threads.erase(i);\n exit_flags.erase(i);\n }\n }\n\n bool start()\n {\n running = true;\n for (int i = 0; i < min_threads; i++)\n {\n create_thread(i);\n }\n return true;\n }\n\n bool shutdown()\n {\n if (!running)\n {\n return false;\n }\n running = false;\n\n _mutex.lock();\n _cv.notify_all();\n _mutex.unlock();\n\n for (int i = 0; i < static_cast<int>(threads.size()); ++i)\n {\n if (threads[i]->joinable())\n {\n threads[i]->join();\n }\n }\n\n threads.clear();\n exit_flags.clear();\n return true;\n }\n\n async_event* dispatch(const async_event *request)\n {\n auto _event_copy = new async_event(*request);\n schedule();\n _event_copy->task_id = current_task_id++;\n queue.push(_event_copy);\n _cv.notify_one();\n return _event_copy;\n }\n\n inline size_t thread_count()\n {\n return threads.size();\n }\n\n inline size_t queue_count()\n {\n return queue.count();\n }\n\n pid_t current_pid;\n\nprivate:\n void create_thread(int i)\n {\n exit_flags[i] = false;\n atomic<bool> &exit_flag = exit_flags[i];\n thread *_thread;\n\n try\n {\n _thread = new thread([this, &exit_flag]()\n {\n SwooleTG.buffer_stack = swString_new(SW_STACK_BUFFER_SIZE);\n if (SwooleTG.buffer_stack == nullptr)\n {\n return;\n }\n\n swSignal_none();\n\n async_event *event;\n _accept:\n event = queue.pop();\n if (event)\n {\n if (sw_unlikely(event->handler == nullptr))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else if (sw_unlikely(event->canceled))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else\n {\n event->handler(event);\n }\n\n swTrace(\"aio_thread ok. ret=%d, error=%d\", event->ret, event->error);\n\n _error:\n while (true)\n {\n SwooleAIO.lock.lock(&SwooleAIO.lock);\n int ret = write(_pipe_write, &event, sizeof(event));\n SwooleAIO.lock.unlock(&SwooleAIO.lock);\n if (ret < 0)\n {\n if (errno == EAGAIN)\n {\n swSocket_wait(_pipe_write, 1000, SW_EVENT_WRITE);\n continue;\n }\n else if (errno == EINTR)\n {\n continue;\n }\n else\n {\n swSysWarn(\"sendto swoole_aio_pipe_write failed\");\n }\n }\n break;\n }\n \/\/exit\n if (exit_flag)\n {\n return;\n }\n }\n else\n {\n unique_lock<mutex> lock(_mutex);\n if (running)\n {\n ++n_waiting;\n _cv.wait(lock);\n --n_waiting;\n }\n }\n if (running)\n {\n goto _accept;\n }\n });\n }\n catch (const std::system_error& e)\n {\n swSysNotice(\"create aio thread#%d failed, please check your system configuration or adjust max_thread_count\", i);\n return;\n }\n\n threads[i] = unique_ptr<thread>(_thread);\n }\n\n swPipe _aio_pipe;\n int _pipe_read;\n int _pipe_write;\n int current_task_id;\n\n unordered_map<int, unique_ptr<thread>> threads;\n unordered_map<int, atomic<bool>> exit_flags;\n\n async_event_queue queue;\n bool running;\n atomic<int> n_waiting;\n int min_threads;\n int max_threads;\n mutex _mutex;\n condition_variable _cv;\n};\n\nstatic async_thread_pool *pool = nullptr;\n\nstatic int swAio_init()\n{\n if (SwooleAIO.init)\n {\n swWarn(\"AIO has already been initialized\");\n return SW_ERR;\n }\n if (!SwooleTG.reactor)\n {\n swWarn(\"no event loop, cannot initialized\");\n return SW_ERR;\n }\n\n if (swMutex_create(&SwooleAIO.lock, 0) < 0)\n {\n swWarn(\"create mutex lock error\");\n return SW_ERR;\n }\n\n if (SwooleAIO.min_thread_count == 0)\n {\n SwooleAIO.min_thread_count = SW_AIO_THREAD_DEFAULT_NUM;\n }\n if (SwooleAIO.max_thread_count == 0)\n {\n SwooleAIO.max_thread_count = (SW_CPU_NUM * 2) * SW_AIO_THREAD_NUM_MULTIPLE;\n }\n if (SwooleAIO.min_thread_count > SwooleAIO.max_thread_count)\n {\n SwooleAIO.max_thread_count = SwooleAIO.min_thread_count;\n }\n\n swReactor_add_destroy_callback(SwooleTG.reactor, swAio_free, nullptr);\n\n pool = new async_thread_pool(SwooleAIO.min_thread_count, SwooleAIO.max_thread_count);\n pool->start();\n SwooleAIO.init = 1;\n\n return SW_OK;\n}\n\nsize_t swAio_thread_count()\n{\n return pool ? pool->thread_count() : 0;\n}\n\nint swAio_dispatch(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n async_event *event = pool->dispatch(request);\n return event->task_id;\n}\n\nswAio_event* swAio_dispatch2(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n return pool->dispatch(request);\n}\n\nstatic void swAio_free(void *private_data)\n{\n if (!SwooleAIO.init)\n {\n return;\n }\n if (pool->current_pid == getpid())\n {\n delete pool;\n }\n pool = nullptr;\n SwooleAIO.init = 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n +----------------------------------------------------------------------+\n | Swoole |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.0 of the Apache license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http:\/\/www.apache.org\/licenses\/LICENSE-2.0.html |\n | If you did not receive a copy of the Apache2.0 license and are unable|\n | to obtain it through the world-wide-web, please send a note to |\n | license@swoole.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Author: Tianfeng Han <mikan.tenny@gmail.com> |\n +----------------------------------------------------------------------+\n *\/\n\n#include \"swoole_api.h\"\n#include \"async.h\"\n\n#include <thread>\n#include <atomic>\n#include <unordered_map>\n#include <condition_variable>\n#include <mutex>\n#include <queue>\n\nusing namespace std;\n\ntypedef swAio_event async_event;\n\nswAsyncIO SwooleAIO;\n\nstatic void swAio_free(void *private_data);\n\nint swAio_callback(swReactor *reactor, swEvent *_event)\n{\n async_event *events[SW_AIO_EVENT_NUM];\n ssize_t n = read(_event->fd, events, sizeof(async_event*) * SW_AIO_EVENT_NUM);\n if (n < 0)\n {\n swSysWarn(\"read() failed\");\n return SW_ERR;\n }\n for (size_t i = 0; i < n \/ sizeof(async_event *); i++)\n {\n if (!events[i]->canceled)\n {\n events[i]->callback(events[i]);\n }\n SwooleAIO.task_num--;\n delete events[i];\n }\n return SW_OK;\n}\n\nstruct thread_context\n{\n thread *_thread;\n atomic<bool> *_exit_flag;\n thread_context(thread *_thread, atomic<bool> *_exit_flag) : _thread(_thread), _exit_flag(_exit_flag) { }\n};\n\nclass async_event_queue\n{\npublic:\n inline bool push(async_event *event)\n {\n unique_lock<mutex> lock(_mutex);\n _queue.push(event);\n return true;\n }\n inline async_event* pop()\n {\n unique_lock<mutex> lock(_mutex);\n if (_queue.empty())\n {\n return nullptr;\n }\n async_event* retval = _queue.front();\n _queue.pop();\n return retval;\n }\n inline bool empty()\n {\n unique_lock<mutex> lock(_mutex);\n return _queue.empty();\n }\n inline size_t count()\n {\n return _queue.size();\n }\nprivate:\n queue<async_event*> _queue;\n mutex _mutex;\n};\n\nclass async_thread_pool\n{\npublic:\n async_thread_pool(size_t _min_threads, size_t _max_threads)\n {\n n_waiting = 0;\n running = false;\n min_threads = SW_MAX(SW_AIO_THREAD_DEFAULT_NUM, _min_threads);\n max_threads = SW_MAX(min_threads, _max_threads);\n current_task_id = 0;\n current_pid = getpid();\n\n if (swPipeBase_create(&_aio_pipe, 0) < 0)\n {\n swoole_throw_error(SW_ERROR_SYSTEM_CALL_FAIL);\n }\n _pipe_read = _aio_pipe.getFd(&_aio_pipe, 0);\n _pipe_write = _aio_pipe.getFd(&_aio_pipe, 1);\n swoole_event_add(_pipe_read, SW_EVENT_READ, SW_FD_AIO);\n }\n\n ~async_thread_pool()\n {\n shutdown();\n if (SwooleTG.reactor)\n {\n swoole_event_del(_pipe_read);\n }\n _aio_pipe.close(&_aio_pipe);\n }\n\n void schedule()\n {\n \/\/++\n if (n_waiting == 0 && threads.size() < max_threads)\n {\n create_thread();\n }\n \/\/--\n else if (n_waiting > min_threads)\n {\n thread_context *tc = &threads.front();\n *tc->_exit_flag = false;\n tc->_thread->detach();\n delete tc->_thread;\n threads.pop();\n }\n }\n\n bool start()\n {\n running = true;\n for (size_t i = 0; i < min_threads; i++)\n {\n create_thread();\n }\n return true;\n }\n\n bool shutdown()\n {\n if (!running)\n {\n return false;\n }\n running = false;\n\n _mutex.lock();\n _cv.notify_all();\n _mutex.unlock();\n\n while (!threads.empty())\n {\n thread_context *tc = &threads.front();\n if (tc->_thread->joinable())\n {\n tc->_thread->join();\n }\n threads.pop();\n }\n\n return true;\n }\n\n async_event* dispatch(const async_event *request)\n {\n auto _event_copy = new async_event(*request);\n schedule();\n _event_copy->task_id = current_task_id++;\n _queue.push(_event_copy);\n _cv.notify_one();\n return _event_copy;\n }\n\n inline size_t thread_count()\n {\n return threads.size();\n }\n\n inline size_t queue_count()\n {\n return _queue.count();\n }\n\n pid_t current_pid;\n\nprivate:\n void create_thread()\n {\n atomic<bool> *_exit_flag = new atomic<bool>(false);\n try\n {\n thread *_thread = new thread([this, _exit_flag]()\n {\n SwooleTG.buffer_stack = swString_new(SW_STACK_BUFFER_SIZE);\n if (SwooleTG.buffer_stack == nullptr)\n {\n return;\n }\n\n swSignal_none();\n\n while (running)\n {\n async_event *event = _queue.pop();\n if (event)\n {\n if (sw_unlikely(event->handler == nullptr))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else if (sw_unlikely(event->canceled))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else\n {\n event->handler(event);\n }\n\n swTrace(\"aio_thread ok. ret=%d, error=%d\", event->ret, event->error);\n\n _error:\n while (true)\n {\n SwooleAIO.lock.lock(&SwooleAIO.lock);\n int ret = write(_pipe_write, &event, sizeof(event));\n SwooleAIO.lock.unlock(&SwooleAIO.lock);\n if (ret < 0)\n {\n if (errno == EAGAIN)\n {\n swSocket_wait(_pipe_write, 1000, SW_EVENT_WRITE);\n continue;\n }\n else if (errno == EINTR)\n {\n continue;\n }\n else\n {\n swSysWarn(\"sendto swoole_aio_pipe_write failed\");\n }\n }\n break;\n }\n\n \/\/ exit\n if (*_exit_flag)\n {\n break;\n }\n }\n else\n {\n unique_lock<mutex> lock(_mutex);\n if (running)\n {\n ++n_waiting;\n _cv.wait(lock);\n --n_waiting;\n }\n }\n }\n\n delete _exit_flag;\n });\n threads.push(thread_context(_thread, _exit_flag));\n }\n catch (const std::system_error& e)\n {\n swSysNotice(\"create aio thread failed, please check your system configuration or adjust max_thread_count\");\n delete _exit_flag;\n return;\n }\n }\n\n size_t min_threads;\n size_t max_threads;\n\n swPipe _aio_pipe;\n int _pipe_read;\n int _pipe_write;\n int current_task_id;\n\n queue<thread_context> threads;\n async_event_queue _queue;\n bool running;\n atomic<size_t> n_waiting;\n mutex _mutex;\n condition_variable _cv;\n};\n\nstatic async_thread_pool *pool = nullptr;\n\nstatic int swAio_init()\n{\n if (SwooleAIO.init)\n {\n swWarn(\"AIO has already been initialized\");\n return SW_ERR;\n }\n if (!SwooleTG.reactor)\n {\n swWarn(\"no event loop, cannot initialized\");\n return SW_ERR;\n }\n\n if (swMutex_create(&SwooleAIO.lock, 0) < 0)\n {\n swWarn(\"create mutex lock error\");\n return SW_ERR;\n }\n\n if (SwooleAIO.min_thread_num == 0)\n {\n SwooleAIO.min_thread_num = SW_AIO_THREAD_DEFAULT_NUM;\n }\n if (SwooleAIO.max_thread_num == 0)\n {\n SwooleAIO.max_thread_num = (SW_CPU_NUM * 2) * SW_AIO_THREAD_NUM_MULTIPLE;\n }\n if (SwooleAIO.min_thread_num > SwooleAIO.max_thread_num)\n {\n SwooleAIO.max_thread_num = SwooleAIO.min_thread_num;\n }\n\n swReactor_add_destroy_callback(SwooleTG.reactor, swAio_free, nullptr);\n\n pool = new async_thread_pool(SwooleAIO.min_thread_num, SwooleAIO.max_thread_num);\n pool->start();\n SwooleAIO.init = 1;\n\n return SW_OK;\n}\n\nsize_t swAio_thread_count()\n{\n return pool ? pool->thread_count() : 0;\n}\n\nint swAio_dispatch(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n async_event *event = pool->dispatch(request);\n return event->task_id;\n}\n\nswAio_event* swAio_dispatch2(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n return pool->dispatch(request);\n}\n\nstatic void swAio_free(void *private_data)\n{\n if (!SwooleAIO.init)\n {\n return;\n }\n if (pool->current_pid == getpid())\n {\n delete pool;\n }\n pool = nullptr;\n SwooleAIO.init = 0;\n}\n<commit_msg>Fix warning<commit_after>\/*\n +----------------------------------------------------------------------+\n | Swoole |\n +----------------------------------------------------------------------+\n | This source file is subject to version 2.0 of the Apache license, |\n | that is bundled with this package in the file LICENSE, and is |\n | available through the world-wide-web at the following url: |\n | http:\/\/www.apache.org\/licenses\/LICENSE-2.0.html |\n | If you did not receive a copy of the Apache2.0 license and are unable|\n | to obtain it through the world-wide-web, please send a note to |\n | license@swoole.com so we can mail you a copy immediately. |\n +----------------------------------------------------------------------+\n | Author: Tianfeng Han <mikan.tenny@gmail.com> |\n +----------------------------------------------------------------------+\n *\/\n\n#include \"swoole_api.h\"\n#include \"async.h\"\n\n#include <thread>\n#include <atomic>\n#include <unordered_map>\n#include <condition_variable>\n#include <mutex>\n#include <queue>\n\nusing namespace std;\n\ntypedef swAio_event async_event;\n\nswAsyncIO SwooleAIO;\n\nstatic void swAio_free(void *private_data);\n\nint swAio_callback(swReactor *reactor, swEvent *_event)\n{\n async_event *events[SW_AIO_EVENT_NUM];\n ssize_t n = read(_event->fd, events, sizeof(async_event*) * SW_AIO_EVENT_NUM);\n if (n < 0)\n {\n swSysWarn(\"read() failed\");\n return SW_ERR;\n }\n for (size_t i = 0; i < n \/ sizeof(async_event *); i++)\n {\n if (!events[i]->canceled)\n {\n events[i]->callback(events[i]);\n }\n SwooleAIO.task_num--;\n delete events[i];\n }\n return SW_OK;\n}\n\nstruct thread_context\n{\n thread *_thread;\n atomic<bool> *_exit_flag;\n thread_context(thread *_thread, atomic<bool> *_exit_flag) : _thread(_thread), _exit_flag(_exit_flag) { }\n};\n\nclass async_event_queue\n{\npublic:\n inline bool push(async_event *event)\n {\n unique_lock<mutex> lock(_mutex);\n _queue.push(event);\n return true;\n }\n inline async_event* pop()\n {\n unique_lock<mutex> lock(_mutex);\n if (_queue.empty())\n {\n return nullptr;\n }\n async_event* retval = _queue.front();\n _queue.pop();\n return retval;\n }\n inline bool empty()\n {\n unique_lock<mutex> lock(_mutex);\n return _queue.empty();\n }\n inline size_t count()\n {\n return _queue.size();\n }\nprivate:\n queue<async_event*> _queue;\n mutex _mutex;\n};\n\nclass async_thread_pool\n{\npublic:\n async_thread_pool(size_t _min_threads, size_t _max_threads)\n {\n n_waiting = 0;\n running = false;\n min_threads = SW_MAX(SW_AIO_THREAD_DEFAULT_NUM, _min_threads);\n max_threads = SW_MAX(min_threads, _max_threads);\n current_task_id = 0;\n current_pid = getpid();\n\n if (swPipeBase_create(&_aio_pipe, 0) < 0)\n {\n swoole_throw_error(SW_ERROR_SYSTEM_CALL_FAIL);\n }\n _pipe_read = _aio_pipe.getFd(&_aio_pipe, 0);\n _pipe_write = _aio_pipe.getFd(&_aio_pipe, 1);\n swoole_event_add(_pipe_read, SW_EVENT_READ, SW_FD_AIO);\n }\n\n ~async_thread_pool()\n {\n shutdown();\n if (SwooleTG.reactor)\n {\n swoole_event_del(_pipe_read);\n }\n _aio_pipe.close(&_aio_pipe);\n }\n\n void schedule()\n {\n \/\/++\n if (n_waiting == 0 && threads.size() < max_threads)\n {\n create_thread();\n }\n \/\/--\n else if (n_waiting > min_threads && threads.size() > min_threads)\n {\n thread_context *tc = &threads.front();\n *tc->_exit_flag = false;\n tc->_thread->detach();\n delete tc->_thread;\n threads.pop();\n }\n }\n\n bool start()\n {\n running = true;\n for (size_t i = 0; i < min_threads; i++)\n {\n create_thread();\n }\n return true;\n }\n\n bool shutdown()\n {\n if (!running)\n {\n return false;\n }\n running = false;\n\n _mutex.lock();\n _cv.notify_all();\n _mutex.unlock();\n\n while (!threads.empty())\n {\n thread_context *tc = &threads.front();\n if (tc->_thread->joinable())\n {\n tc->_thread->join();\n }\n threads.pop();\n }\n\n return true;\n }\n\n async_event* dispatch(const async_event *request)\n {\n auto _event_copy = new async_event(*request);\n schedule();\n _event_copy->task_id = current_task_id++;\n _queue.push(_event_copy);\n _cv.notify_one();\n return _event_copy;\n }\n\n inline size_t thread_count()\n {\n return threads.size();\n }\n\n inline size_t queue_count()\n {\n return _queue.count();\n }\n\n pid_t current_pid;\n\nprivate:\n void create_thread()\n {\n atomic<bool> *_exit_flag = new atomic<bool>(false);\n try\n {\n thread *_thread = new thread([this, _exit_flag]()\n {\n SwooleTG.buffer_stack = swString_new(SW_STACK_BUFFER_SIZE);\n if (SwooleTG.buffer_stack == nullptr)\n {\n return;\n }\n\n swSignal_none();\n\n while (running)\n {\n async_event *event = _queue.pop();\n if (event)\n {\n if (sw_unlikely(event->handler == nullptr))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else if (sw_unlikely(event->canceled))\n {\n event->error = SW_ERROR_AIO_BAD_REQUEST;\n event->ret = -1;\n goto _error;\n }\n else\n {\n event->handler(event);\n }\n\n swTrace(\"aio_thread ok. ret=%d, error=%d\", event->ret, event->error);\n\n _error:\n while (true)\n {\n SwooleAIO.lock.lock(&SwooleAIO.lock);\n int ret = write(_pipe_write, &event, sizeof(event));\n SwooleAIO.lock.unlock(&SwooleAIO.lock);\n if (ret < 0)\n {\n if (errno == EAGAIN)\n {\n swSocket_wait(_pipe_write, 1000, SW_EVENT_WRITE);\n continue;\n }\n else if (errno == EINTR)\n {\n continue;\n }\n else\n {\n swSysWarn(\"sendto swoole_aio_pipe_write failed\");\n }\n }\n break;\n }\n\n \/\/ exit\n if (*_exit_flag)\n {\n break;\n }\n }\n else\n {\n unique_lock<mutex> lock(_mutex);\n if (running)\n {\n ++n_waiting;\n _cv.wait(lock);\n --n_waiting;\n }\n }\n }\n\n delete _exit_flag;\n });\n threads.push(thread_context(_thread, _exit_flag));\n }\n catch (const std::system_error& e)\n {\n swSysNotice(\"create aio thread failed, please check your system configuration or adjust max_thread_count\");\n delete _exit_flag;\n return;\n }\n }\n\n size_t min_threads;\n size_t max_threads;\n\n swPipe _aio_pipe;\n int _pipe_read;\n int _pipe_write;\n int current_task_id;\n\n queue<thread_context> threads;\n async_event_queue _queue;\n bool running;\n atomic<size_t> n_waiting;\n mutex _mutex;\n condition_variable _cv;\n};\n\nstatic async_thread_pool *pool = nullptr;\n\nstatic int swAio_init()\n{\n if (SwooleAIO.init)\n {\n swWarn(\"AIO has already been initialized\");\n return SW_ERR;\n }\n if (!SwooleTG.reactor)\n {\n swWarn(\"no event loop, cannot initialized\");\n return SW_ERR;\n }\n\n if (swMutex_create(&SwooleAIO.lock, 0) < 0)\n {\n swWarn(\"create mutex lock error\");\n return SW_ERR;\n }\n\n if (SwooleAIO.min_thread_num == 0)\n {\n SwooleAIO.min_thread_num = SW_AIO_THREAD_DEFAULT_NUM;\n }\n if (SwooleAIO.max_thread_num == 0)\n {\n SwooleAIO.max_thread_num = (SW_CPU_NUM * 2) * SW_AIO_THREAD_NUM_MULTIPLE;\n }\n if (SwooleAIO.min_thread_num > SwooleAIO.max_thread_num)\n {\n SwooleAIO.max_thread_num = SwooleAIO.min_thread_num;\n }\n\n swReactor_add_destroy_callback(SwooleTG.reactor, swAio_free, nullptr);\n\n pool = new async_thread_pool(SwooleAIO.min_thread_num, SwooleAIO.max_thread_num);\n pool->start();\n SwooleAIO.init = 1;\n\n return SW_OK;\n}\n\nsize_t swAio_thread_count()\n{\n return pool ? pool->thread_count() : 0;\n}\n\nint swAio_dispatch(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n async_event *event = pool->dispatch(request);\n return event->task_id;\n}\n\nswAio_event* swAio_dispatch2(const swAio_event *request)\n{\n if (sw_unlikely(!SwooleAIO.init))\n {\n swAio_init();\n }\n SwooleAIO.task_num++;\n return pool->dispatch(request);\n}\n\nstatic void swAio_free(void *private_data)\n{\n if (!SwooleAIO.init)\n {\n return;\n }\n if (pool->current_pid == getpid())\n {\n delete pool;\n }\n pool = nullptr;\n SwooleAIO.init = 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef PIXELBOOST_DISABLE_GRAPHICS\n\n#include <algorithm>\n#include <set>\n\n#include \"pixelboost\/graphics\/camera\/camera.h\"\n#include \"pixelboost\/graphics\/camera\/viewport.h\"\n#include \"pixelboost\/graphics\/device\/device.h\"\n#include \"pixelboost\/graphics\/effect\/effect.h\"\n#include \"pixelboost\/graphics\/effect\/manager.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/irenderer.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderable.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderer.h\"\n\nusing namespace pb;\n\nRenderer* Renderer::Renderer::_Instance = 0;\n\nRenderer::Renderer()\n{\n _Instance = this;\n \n _EffectManager = new EffectManager();\n}\n\nRenderer::~Renderer()\n{\n _Instance = 0;\n}\n\nRenderer* Renderer::Instance()\n{\n return _Instance;\n}\n\nvoid Renderer::Render()\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n (*it)->Render();\n \n FlushBuffer(*it);\n }\n}\n\nEffectManager* Renderer::GetEffectManager()\n{\n return _EffectManager;\n}\n\nvoid Renderer::AttachRenderable(Renderable* renderable)\n{\n _Renderables[renderable->GetLayer()].push_back(renderable);\n}\n\nvoid Renderer::AddViewport(Viewport* viewport)\n{\n _Viewports.push_back(viewport);\n}\n\nvoid Renderer::RemoveViewport(Viewport* viewport)\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n if (*it == viewport)\n {\n _Viewports.erase(it);\n return;\n }\n }\n}\n\nvoid Renderer::SetHandler(int renderableType, IRenderer* renderer)\n{\n _RenderableHandlers[renderableType] = renderer;\n}\n\nbool RenderableBackToFrontSorter(const Renderable* a, const Renderable* b)\n{\n return a->GetMVP()[3][2] > b->GetMVP()[3][2];\n}\n\nvoid Renderer::FlushBuffer(Viewport* viewport)\n{\n for (int i=0; i<16; i++)\n {\n RenderableList& renderables = _Renderables[i];\n \n if (!renderables.size())\n continue;\n \n for (RenderableList::iterator it = renderables.begin(); it != renderables.end(); ++it)\n {\n (*it)->CalculateMVP(viewport);\n }\n \n std::stable_sort(renderables.begin(), renderables.end(), &RenderableBackToFrontSorter);\n \n Uid type = renderables[0]->GetRenderableType();\n Effect* effect = renderables[0]->GetEffect();\n int start = 0;\n int count = 0;\n \n for (int i=0; i < renderables.size(); i++)\n {\n Uid newType = renderables[i]->GetRenderableType();\n Effect* newEffect = renderables[i]->GetEffect();\n \n if (type == newType && effect == newEffect)\n {\n count++;\n } else {\n RenderBatch(viewport, count, &renderables[start], effect);\n start = i;\n count = 1;\n type = newType;\n effect = newEffect;\n }\n }\n \n if (count > 0)\n {\n RenderBatch(viewport, count, &renderables[start], effect);\n }\n }\n \n _Renderables.clear();\n}\n\nvoid Renderer::RenderBatch(Viewport* viewport, int count, Renderable** renderable, Effect* effect)\n{\n if (!effect)\n return;\n \n RenderableHandlerMap::iterator it = _RenderableHandlers.find(renderable[0]->GetRenderableType());\n \n if (it != _RenderableHandlers.end())\n {\n EffectTechnique* technique = effect->GetTechnique(viewport->GetRenderScheme());\n \n if (!technique)\n {\n for (int i=0; i < count; i++)\n {\n technique = viewport->GetTechnique(renderable[i], effect);\n \n if (technique)\n {\n for (int j=0; j<technique->GetNumPasses(); j++)\n {\n EffectPass* pass = technique->GetPass(j);\n pass->Bind();\n it->second->Render(1, &renderable[i], viewport, pass);\n }\n }\n }\n } else\n {\n for (int i=0; i<technique->GetNumPasses(); i++)\n {\n EffectPass* pass = technique->GetPass(i);\n pass->Bind();\n it->second->Render(count, renderable, viewport, pass);\n }\n }\n }\n}\n\n#endif\n<commit_msg>Fix compiler warning<commit_after>#ifndef PIXELBOOST_DISABLE_GRAPHICS\n\n#include <algorithm>\n#include <set>\n\n#include \"pixelboost\/graphics\/camera\/camera.h\"\n#include \"pixelboost\/graphics\/camera\/viewport.h\"\n#include \"pixelboost\/graphics\/device\/device.h\"\n#include \"pixelboost\/graphics\/effect\/effect.h\"\n#include \"pixelboost\/graphics\/effect\/manager.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/irenderer.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderable.h\"\n#include \"pixelboost\/graphics\/renderer\/common\/renderer.h\"\n\nusing namespace pb;\n\nRenderer* Renderer::Renderer::_Instance = 0;\n\nRenderer::Renderer()\n{\n _Instance = this;\n \n _EffectManager = new EffectManager();\n}\n\nRenderer::~Renderer()\n{\n _Instance = 0;\n}\n\nRenderer* Renderer::Instance()\n{\n return _Instance;\n}\n\nvoid Renderer::Render()\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n (*it)->Render();\n \n FlushBuffer(*it);\n }\n}\n\nEffectManager* Renderer::GetEffectManager()\n{\n return _EffectManager;\n}\n\nvoid Renderer::AttachRenderable(Renderable* renderable)\n{\n _Renderables[renderable->GetLayer()].push_back(renderable);\n}\n\nvoid Renderer::AddViewport(Viewport* viewport)\n{\n _Viewports.push_back(viewport);\n}\n\nvoid Renderer::RemoveViewport(Viewport* viewport)\n{\n for (ViewportList::iterator it = _Viewports.begin(); it != _Viewports.end(); ++it)\n {\n if (*it == viewport)\n {\n _Viewports.erase(it);\n return;\n }\n }\n}\n\nvoid Renderer::SetHandler(int renderableType, IRenderer* renderer)\n{\n _RenderableHandlers[renderableType] = renderer;\n}\n\nstatic bool RenderableBackToFrontSorter(const Renderable* a, const Renderable* b)\n{\n return a->GetMVP()[3][2] > b->GetMVP()[3][2];\n}\n\nvoid Renderer::FlushBuffer(Viewport* viewport)\n{\n for (int i=0; i<16; i++)\n {\n RenderableList& renderables = _Renderables[i];\n \n if (!renderables.size())\n continue;\n \n for (RenderableList::iterator it = renderables.begin(); it != renderables.end(); ++it)\n {\n (*it)->CalculateMVP(viewport);\n }\n \n std::stable_sort(renderables.begin(), renderables.end(), &RenderableBackToFrontSorter);\n \n Uid type = renderables[0]->GetRenderableType();\n Effect* effect = renderables[0]->GetEffect();\n int start = 0;\n int count = 0;\n \n for (int i=0; i < renderables.size(); i++)\n {\n Uid newType = renderables[i]->GetRenderableType();\n Effect* newEffect = renderables[i]->GetEffect();\n \n if (type == newType && effect == newEffect)\n {\n count++;\n } else {\n RenderBatch(viewport, count, &renderables[start], effect);\n start = i;\n count = 1;\n type = newType;\n effect = newEffect;\n }\n }\n \n if (count > 0)\n {\n RenderBatch(viewport, count, &renderables[start], effect);\n }\n }\n \n _Renderables.clear();\n}\n\nvoid Renderer::RenderBatch(Viewport* viewport, int count, Renderable** renderable, Effect* effect)\n{\n if (!effect)\n return;\n \n RenderableHandlerMap::iterator it = _RenderableHandlers.find(renderable[0]->GetRenderableType());\n \n if (it != _RenderableHandlers.end())\n {\n EffectTechnique* technique = effect->GetTechnique(viewport->GetRenderScheme());\n \n if (!technique)\n {\n for (int i=0; i < count; i++)\n {\n technique = viewport->GetTechnique(renderable[i], effect);\n \n if (technique)\n {\n for (int j=0; j<technique->GetNumPasses(); j++)\n {\n EffectPass* pass = technique->GetPass(j);\n pass->Bind();\n it->second->Render(1, &renderable[i], viewport, pass);\n }\n }\n }\n } else\n {\n for (int i=0; i<technique->GetNumPasses(); i++)\n {\n EffectPass* pass = technique->GetPass(i);\n pass->Bind();\n it->second->Render(count, renderable, viewport, pass);\n }\n }\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <osg\/DrawPixels>\n\nusing namespace osg;\n\nDrawPixels::DrawPixels()\n{\n \/\/ turn off display lists right now, just incase we want to modify the projection matrix along the way.\n setSupportsDisplayList(false);\n \n _position.set(0.0f,0.0f,0.0f);\n \n _useSubImage = false;\n _offsetX = 0;\n _offsetY = 0; \n _width = 0;\n _height = 0;\n}\n\nDrawPixels::DrawPixels(const DrawPixels& drawimage,const CopyOp& copyop=CopyOp::SHALLOW_COPY):\n Drawable(drawimage,copyop),\n _position(drawimage._position),\n _image(drawimage._image),\n _useSubImage(drawimage._useSubImage),\n _offsetX(drawimage._offsetX), \n _offsetY(drawimage._offsetY),\n _width(drawimage._width),\n _height(drawimage._height)\n{\n}\n\nDrawPixels::~DrawPixels()\n{\n \/\/ image will delete itself thanks to ref_ptr :-)\n}\n\nvoid DrawPixels::setPosition(const osg::Vec3& position)\n{\n _position = position;\n dirtyBound();\n}\n\nvoid DrawPixels::setSubImageDimensions(unsigned int offsetX,unsigned int offsetY,unsigned int width,unsigned int height)\n{\n _useSubImage = true;\n _offsetX = offsetX;\n _offsetY = offsetY; \n _width = width;\n _height = height;\n}\n\nvoid DrawPixels::getSubImageDimensions(unsigned int& offsetX,unsigned int& offsetY,unsigned int& width,unsigned int& height) const\n{\n offsetX = _offsetX;\n offsetY = _offsetY; \n width = _width;\n height = _height;\n}\n\n\nconst bool DrawPixels::computeBound() const\n{\n \/\/ really needs to be dependant of view poistion and projection... will implement simple version right now.\n _bbox.init();\n float diagonal = 0.0f;\n if (_useSubImage)\n {\n diagonal = sqrtf(_width*_width+_height*_height);\n }\n else\n {\n diagonal = sqrtf(_image->s()*_image->s()+_image->t()*_image->t());\n }\n \n _bbox.expandBy(_position-osg::Vec3(diagonal,diagonal,diagonal));\n _bbox.expandBy(_position+osg::Vec3(diagonal,diagonal,diagonal));\n _bbox_computed = true;\n return true;\n}\n\nvoid DrawPixels::drawImmediateMode(State&)\n{\n glRasterPos3f(_position.x(),_position.y(),_position.z());\n\n if (_useSubImage)\n {\n const GLvoid* pixels = _image->data();\n glDrawPixels(_width,_height,\n (GLenum)_image->pixelFormat(),\n (GLenum)_image->dataType(),\n pixels);\n }\n else\n {\n glDrawPixels(_image->s(), _image->t(),\n (GLenum)_image->pixelFormat(),\n (GLenum)_image->dataType(),\n _image->data() );\n }\n}\n\n<commit_msg>Fix for Win32 build.<commit_after>#include <osg\/DrawPixels>\n\nusing namespace osg;\n\nDrawPixels::DrawPixels()\n{\n \/\/ turn off display lists right now, just incase we want to modify the projection matrix along the way.\n setSupportsDisplayList(false);\n \n _position.set(0.0f,0.0f,0.0f);\n \n _useSubImage = false;\n _offsetX = 0;\n _offsetY = 0; \n _width = 0;\n _height = 0;\n}\n\nDrawPixels::DrawPixels(const DrawPixels& drawimage,const CopyOp& copyop):\n Drawable(drawimage,copyop),\n _position(drawimage._position),\n _image(drawimage._image),\n _useSubImage(drawimage._useSubImage),\n _offsetX(drawimage._offsetX), \n _offsetY(drawimage._offsetY),\n _width(drawimage._width),\n _height(drawimage._height)\n{\n}\n\nDrawPixels::~DrawPixels()\n{\n \/\/ image will delete itself thanks to ref_ptr :-)\n}\n\nvoid DrawPixels::setPosition(const osg::Vec3& position)\n{\n _position = position;\n dirtyBound();\n}\n\nvoid DrawPixels::setSubImageDimensions(unsigned int offsetX,unsigned int offsetY,unsigned int width,unsigned int height)\n{\n _useSubImage = true;\n _offsetX = offsetX;\n _offsetY = offsetY; \n _width = width;\n _height = height;\n}\n\nvoid DrawPixels::getSubImageDimensions(unsigned int& offsetX,unsigned int& offsetY,unsigned int& width,unsigned int& height) const\n{\n offsetX = _offsetX;\n offsetY = _offsetY; \n width = _width;\n height = _height;\n}\n\n\nconst bool DrawPixels::computeBound() const\n{\n \/\/ really needs to be dependant of view poistion and projection... will implement simple version right now.\n _bbox.init();\n float diagonal = 0.0f;\n if (_useSubImage)\n {\n diagonal = sqrtf(_width*_width+_height*_height);\n }\n else\n {\n diagonal = sqrtf(_image->s()*_image->s()+_image->t()*_image->t());\n }\n \n _bbox.expandBy(_position-osg::Vec3(diagonal,diagonal,diagonal));\n _bbox.expandBy(_position+osg::Vec3(diagonal,diagonal,diagonal));\n _bbox_computed = true;\n return true;\n}\n\nvoid DrawPixels::drawImmediateMode(State&)\n{\n glRasterPos3f(_position.x(),_position.y(),_position.z());\n\n if (_useSubImage)\n {\n const GLvoid* pixels = _image->data();\n glDrawPixels(_width,_height,\n (GLenum)_image->pixelFormat(),\n (GLenum)_image->dataType(),\n pixels);\n }\n else\n {\n glDrawPixels(_image->s(), _image->t(),\n (GLenum)_image->pixelFormat(),\n (GLenum)_image->dataType(),\n _image->data() );\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2014 Robert Osfield\n *\n * This library is open source and may be redistributed and\/or modified under\n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or\n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * OpenSceneGraph Public License for more details.\n*\/\n\n\n#include <osgUI\/LineEdit>\n#include <osgText\/String>\n#include <osgText\/Font>\n#include <osgText\/Text>\n#include <osg\/Notify>\n#include <osg\/ValueObject>\n\nusing namespace osgUI;\n\nLineEdit::LineEdit()\n{\n}\n\nLineEdit::LineEdit(const osgUI::LineEdit& label, const osg::CopyOp& copyop):\n Widget(label, copyop),\n _text(label._text)\n{\n}\n\nbool LineEdit::handleImplementation(osgGA::EventVisitor* \/*ev*\/, osgGA::Event* event)\n{\n if (!getHasEventFocus()) return false;\n\n osgGA::GUIEventAdapter* ea = event->asGUIEventAdapter();\n if (!ea) return false;\n\n switch(ea->getEventType())\n {\n case(osgGA::GUIEventAdapter::KEYDOWN):\n if (ea->getKey()==osgGA::GUIEventAdapter::KEY_BackSpace ||\n ea->getKey()==osgGA::GUIEventAdapter::KEY_Delete)\n {\n if (!_text.empty())\n {\n setText(_text.substr(0, _text.size()-1));\n return true;\n\n }\n }\n else if (ea->getKey()>=32 && ea->getKey()<=0xff00)\n {\n setText(_text + std::string::value_type(ea->getKey()));\n return true;\n }\n else if (ea->getKey()==osgGA::GUIEventAdapter::KEY_Return )\n {\n if (_validator.valid())\n {\n std::string text_copy(_text);\n int cursorpos;\n if (_validator->validate(text_copy, cursorpos)==Validator::INTERMEDIATE)\n {\n _validator->fixup(text_copy);\n }\n if (text_copy!=_text) setText(text_copy);\n }\n\n returnPressed();\n return true;\n }\n\n OSG_NOTICE<<\"Key pressed : \"<<ea->getKey()<<std::endl;\n\n break;\n default:\n break;\n }\n\n return false;\n}\n\nvoid LineEdit::setText(const std::string& text)\n{\n if (_text==text) return;\n\n std::string text_copy(text);\n if (_validator.valid())\n {\n int cursorpos = 0;\n Validator::State state = _validator->validate(text_copy, cursorpos);\n if (state==Validator::INVALID) return;\n }\n\n _text = text_copy;\n\n textChanged(_text);\n\n if (_textDrawable) _textDrawable->setText(_text);\n}\n\nvoid LineEdit::enterImplementation()\n{\n OSG_NOTICE<<\"LineEdit enter\"<<std::endl;\n if (_backgroundSwitch.valid()) _backgroundSwitch->setSingleChildOn(1);\n}\n\n\nvoid LineEdit::leaveImplementation()\n{\n OSG_NOTICE<<\"LineEdit leave\"<<std::endl;\n if (_backgroundSwitch.valid()) _backgroundSwitch->setSingleChildOn(0);\n}\n\n\nvoid LineEdit::textChanged(const std::string& text)\n{\n osg::CallbackObject* co = getCallbackObject(this, \"textChanged\");\n if (co)\n {\n osg::Parameters inputParameters, outputParameters;\n inputParameters.push_back(new osg::StringValueObject(\"text\",text));\n if (co->run(this, inputParameters, outputParameters))\n {\n return;\n }\n }\n textChangedImplementation(text);\n}\n\nvoid LineEdit::textChangedImplementation(const std::string& text)\n{\n OSG_NOTICE<<\"textChangedImplementation(\"<<text<<\")\"<<std::endl;\n}\n\nvoid LineEdit::returnPressedImplementation()\n{\n OSG_NOTICE<<\"returnPressedImplementation()\"<<std::endl;\n}\n\nvoid LineEdit::createGraphicsImplementation()\n{\n Style* style = (getStyle()!=0) ? getStyle() : Style::instance().get();\n\n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n osg::BoundingBox extents(_extents);\n float unFocused = 0.92;\n float withFocus = 0.97;\n\n osg::Vec4 frameColor(unFocused,unFocused,unFocused,1.0f);\n\n bool requiresFrame = (getFrameSettings() && getFrameSettings()->getShape()!=osgUI::FrameSettings::NO_FRAME);\n if (requiresFrame)\n {\n group->addChild(style->createFrame(_extents, getFrameSettings(), frameColor));\n extents.xMin() += getFrameSettings()->getLineWidth();\n extents.xMax() -= getFrameSettings()->getLineWidth();\n extents.yMin() += getFrameSettings()->getLineWidth();\n extents.yMax() -= getFrameSettings()->getLineWidth();\n }\n\n \/\/ clear background of edit region\n _backgroundSwitch = new osg::Switch;\n _backgroundSwitch->addChild(style->createPanel(extents, osg::Vec4(unFocused, unFocused,unFocused, 1.0)));\n _backgroundSwitch->addChild(style->createPanel(extents, osg::Vec4(withFocus, withFocus, withFocus,1.0)));\n _backgroundSwitch->setSingleChildOn(0);\n group->addChild(_backgroundSwitch.get());\n\n osg::ref_ptr<Node> node = style->createText(extents, getAlignmentSettings(), getTextSettings(), _text);\n _textDrawable = dynamic_cast<osgText::Text*>(node.get());\n _textDrawable->setDataVariance(osg::Object::DYNAMIC);\n group->addChild(node.get());\n\n style->setupClipStateSet(_extents, getOrCreateWidgetStateSet());\n\n setGraphicsSubgraph(0, group.get());\n}\n<commit_msg>Fixed handling of when dynamic_cast<> returns NULL<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2014 Robert Osfield\n *\n * This library is open source and may be redistributed and\/or modified under\n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or\n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * OpenSceneGraph Public License for more details.\n*\/\n\n\n#include <osgUI\/LineEdit>\n#include <osgText\/String>\n#include <osgText\/Font>\n#include <osgText\/Text>\n#include <osg\/Notify>\n#include <osg\/ValueObject>\n\nusing namespace osgUI;\n\nLineEdit::LineEdit()\n{\n}\n\nLineEdit::LineEdit(const osgUI::LineEdit& label, const osg::CopyOp& copyop):\n Widget(label, copyop),\n _text(label._text)\n{\n}\n\nbool LineEdit::handleImplementation(osgGA::EventVisitor* \/*ev*\/, osgGA::Event* event)\n{\n if (!getHasEventFocus()) return false;\n\n osgGA::GUIEventAdapter* ea = event->asGUIEventAdapter();\n if (!ea) return false;\n\n switch(ea->getEventType())\n {\n case(osgGA::GUIEventAdapter::KEYDOWN):\n if (ea->getKey()==osgGA::GUIEventAdapter::KEY_BackSpace ||\n ea->getKey()==osgGA::GUIEventAdapter::KEY_Delete)\n {\n if (!_text.empty())\n {\n setText(_text.substr(0, _text.size()-1));\n return true;\n\n }\n }\n else if (ea->getKey()>=32 && ea->getKey()<=0xff00)\n {\n setText(_text + std::string::value_type(ea->getKey()));\n return true;\n }\n else if (ea->getKey()==osgGA::GUIEventAdapter::KEY_Return )\n {\n if (_validator.valid())\n {\n std::string text_copy(_text);\n int cursorpos;\n if (_validator->validate(text_copy, cursorpos)==Validator::INTERMEDIATE)\n {\n _validator->fixup(text_copy);\n }\n if (text_copy!=_text) setText(text_copy);\n }\n\n returnPressed();\n return true;\n }\n\n OSG_NOTICE<<\"Key pressed : \"<<ea->getKey()<<std::endl;\n\n break;\n default:\n break;\n }\n\n return false;\n}\n\nvoid LineEdit::setText(const std::string& text)\n{\n if (_text==text) return;\n\n std::string text_copy(text);\n if (_validator.valid())\n {\n int cursorpos = 0;\n Validator::State state = _validator->validate(text_copy, cursorpos);\n if (state==Validator::INVALID) return;\n }\n\n _text = text_copy;\n\n textChanged(_text);\n\n if (_textDrawable) _textDrawable->setText(_text);\n}\n\nvoid LineEdit::enterImplementation()\n{\n OSG_NOTICE<<\"LineEdit enter\"<<std::endl;\n if (_backgroundSwitch.valid()) _backgroundSwitch->setSingleChildOn(1);\n}\n\n\nvoid LineEdit::leaveImplementation()\n{\n OSG_NOTICE<<\"LineEdit leave\"<<std::endl;\n if (_backgroundSwitch.valid()) _backgroundSwitch->setSingleChildOn(0);\n}\n\n\nvoid LineEdit::textChanged(const std::string& text)\n{\n osg::CallbackObject* co = getCallbackObject(this, \"textChanged\");\n if (co)\n {\n osg::Parameters inputParameters, outputParameters;\n inputParameters.push_back(new osg::StringValueObject(\"text\",text));\n if (co->run(this, inputParameters, outputParameters))\n {\n return;\n }\n }\n textChangedImplementation(text);\n}\n\nvoid LineEdit::textChangedImplementation(const std::string& text)\n{\n OSG_NOTICE<<\"textChangedImplementation(\"<<text<<\")\"<<std::endl;\n}\n\nvoid LineEdit::returnPressedImplementation()\n{\n OSG_NOTICE<<\"returnPressedImplementation()\"<<std::endl;\n}\n\nvoid LineEdit::createGraphicsImplementation()\n{\n Style* style = (getStyle()!=0) ? getStyle() : Style::instance().get();\n\n osg::ref_ptr<osg::Group> group = new osg::Group;\n\n osg::BoundingBox extents(_extents);\n float unFocused = 0.92;\n float withFocus = 0.97;\n\n osg::Vec4 frameColor(unFocused,unFocused,unFocused,1.0f);\n\n bool requiresFrame = (getFrameSettings() && getFrameSettings()->getShape()!=osgUI::FrameSettings::NO_FRAME);\n if (requiresFrame)\n {\n group->addChild(style->createFrame(_extents, getFrameSettings(), frameColor));\n extents.xMin() += getFrameSettings()->getLineWidth();\n extents.xMax() -= getFrameSettings()->getLineWidth();\n extents.yMin() += getFrameSettings()->getLineWidth();\n extents.yMax() -= getFrameSettings()->getLineWidth();\n }\n\n \/\/ clear background of edit region\n _backgroundSwitch = new osg::Switch;\n _backgroundSwitch->addChild(style->createPanel(extents, osg::Vec4(unFocused, unFocused,unFocused, 1.0)));\n _backgroundSwitch->addChild(style->createPanel(extents, osg::Vec4(withFocus, withFocus, withFocus,1.0)));\n _backgroundSwitch->setSingleChildOn(0);\n group->addChild(_backgroundSwitch.get());\n\n osg::ref_ptr<Node> node = style->createText(extents, getAlignmentSettings(), getTextSettings(), _text);\n _textDrawable = dynamic_cast<osgText::Text*>(node.get());\n node->setDataVariance(osg::Object::DYNAMIC);\n group->addChild(node.get());\n\n style->setupClipStateSet(_extents, getOrCreateWidgetStateSet());\n\n setGraphicsSubgraph(0, group.get());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"TextureFont.hpp\"\n#include FT_LCD_FILTER_H\n#include FT_STROKER_H\n\nusing namespace rffalcon;\n\n#define POINT_RES 64\n#define DPI 72\n\nTextureFont::TextureFont(std::shared_ptr<TextureAtlas> atlas, const float pointSize, const std::string &filename)\n\t: _atlas(atlas), _pointSize(pointSize), _filename(filename)\n{\n\t_lcdWeights[0] = 0x10;\n\t_lcdWeights[0] = 0x40;\n\t_lcdWeights[0] = 0x70;\n\t_lcdWeights[0] = 0x40;\n\t_lcdWeights[0] = 0x10;\n\t_initialize();\n}\n\nTextureFont::~TextureFont()\n{\n}\n\nfloat TextureFont::getHeight() const\n{\n\treturn _height;\n}\n\nvoid TextureFont::loadGlyphs(const std::string &text)\n{\n\tint width = _atlas->getWidth();\n\tint height = _atlas->getHeight();\n\tint depth = _atlas->getDepth();\n\n\tFT_Library library;\n\tFT_Face face;\n\tFT_Error error = FT_Init_FreeType(&library);\n\tif (error != FT_Err_Ok) { throw new std::exception(); }\n\n\t_loadFace(library, &face);\n\n\tFT_Int32 flags = _getFlags();\n\tint length = text.length();\n\t\/\/ Load the glyph for each character in the string\n\tfor (int i = 0; i < length; ++i)\n\t{\n\t\tchar charCode = text[i];\n\t\tif (_shouldLoadGlyph(charCode))\n\t\t{\n\t\t\t_setFiltering(library);\n\t\t\tFT_UInt glyphIndex = FT_Get_Char_Index(face, charCode);\n\t\t\terror = FT_Load_Glyph(face, glyphIndex, flags);\n\t\t\tif (error) { throw new std::exception(); }\n\t\t\tGlyphLocation glyphLocation = _getGlyphLocation(library, face);\n\t\t\ts1::ivec4 region = _atlas->getRegion(glyphLocation.width, glyphLocation.height);\n\t\t}\n\t}\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\n}\n\n\n\nGlyphLocation TextureFont::_getGlyphLocation(FT_Library library, FT_Face face)\n{\n\tGlyphLocation glyphLocation;\n\tFT_Bitmap bitmap;\n\tint depth = _atlas->getDepth();\n\tif (_outlineType == 0)\n\t{\n\t\tFT_GlyphSlot slot = face->glyph;\n\t\tbitmap = slot->bitmap;\n\t\tglyphLocation.top = slot->bitmap_top;\n\t\tglyphLocation.left = slot->bitmap_left;\n\t}\n\telse\n\t{\n\t\tFT_Stroker stroker;\n\t\tFT_BitmapGlyph bitmapGlyph;\n\t\t\n\t\tFT_Error error = FT_Stroker_New(library, &stroker);\n\t\tif (error) { throw new std::exception(); }\n\t\t\n\t\tFT_Stroker_Set(stroker, static_cast<int>(_outlineThickness * POINT_RES),\n\t\t\tFT_STROKER_LINECAP_ROUND, FT_STROKER_LINEJOIN_ROUND, 0);\n\t\t\n\t\tFT_Glyph glyph;\n\t\terror = FT_Get_Glyph(face->glyph, &glyph);\n\t\tif (error) { throw new std::exception(); }\n\n\t\tif (_outlineType == 1)\n\t\t{\n\t\t\terror = FT_Glyph_Stroke(&glyph, stroker, 1);\n\t\t}\n\t\telse if (_outlineType == 2)\n\t\t{\n\t\t\terror = FT_Glyph_StrokeBorder(&glyph, stroker, 0, 1);\n\t\t}\n\t\telse if (_outlineType == 3)\n\t\t{\n\t\t\terror = FT_Glyph_StrokeBorder(&glyph, stroker, 1, 1);\n\t\t}\n\n\t\tif (error) { throw new std::exception(); }\n\n\t\tFT_Render_Mode renderMode = _atlas->getDepth() == 1 ? FT_RENDER_MODE_NORMAL : FT_RENDER_MODE_LCD;\n\t\terror = FT_Glyph_To_Bitmap(&glyph, renderMode, 0, 1);\n\t\tif (error) { throw new std::exception(); }\n\n\t\tbitmapGlyph = reinterpret_cast<FT_BitmapGlyph>(glyph);\n\t\tbitmap = bitmapGlyph->bitmap;\n\t\tglyphLocation.left = bitmapGlyph->left;\n\t\tglyphLocation.top = bitmapGlyph->top;\n\t\tFT_Stroker_Done(stroker);\n\t}\n\n\tglyphLocation.width = bitmap.width \/ depth;\n\tglyphLocation.height = bitmap.rows;\n\n\treturn glyphLocation;\n}\n\nvoid TextureFont::_setFiltering(FT_Library library)\n{\n\tif (_atlas->getDepth() == 3)\n\t{\n\t\tFT_Library_SetLcdFilter(library, FT_LCD_FILTER_LIGHT);\n\t\tif (_filtering)\n\t\t{\n\t\t\tFT_Library_SetLcdFilterWeights(library, _lcdWeights);\n\t\t}\n\t}\n}\n\nFT_Int32 TextureFont::_getFlags()\n{\n\tFT_Int32 flags = 0;\n\tif (_outlineType > 0)\n\t{\n\t\tflags |= FT_LOAD_NO_BITMAP;\n\t}\n\telse\n\t{\n\t\tflags |= FT_LOAD_RENDER;\n\t}\n\n\tif (!_hinting)\n\t{\n\t\tflags |= FT_LOAD_NO_HINTING | FT_LOAD_NO_AUTOHINT;\n\t}\n\telse\n\t{\n\t\tflags |= FT_LOAD_FORCE_AUTOHINT;\n\t}\n\n\tif (_atlas->getDepth() == 3)\n\t{\n\t\tflags |= FT_LOAD_TARGET_LCD;\n\t}\n\n\treturn flags;\n}\n\nbool TextureFont::_shouldLoadGlyph(const char charCode)\n{\n\t\/\/ Skip glyphs that have already been loaded\n\tbool skip = false;\n\tint sizeGlyphs = static_cast<int>(_glyphs.size());\n\tfor (int j = 0; j < sizeGlyphs; ++j)\n\t{\n\t\tauto glyph = _glyphs[j];\n\t\tif (glyph->charCode == charCode &&\n\t\t\t(glyph->outlineType == _outlineType && glyph->outlineThickness == _outlineThickness))\n\t\t{\n\t\t\tskip = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn skip;\n}\n\nvoid TextureFont::_initialize()\n{\n\tFT_Library library;\n\tFT_Face face;\n\tFT_Size_Metrics metrics;\n\n\tFT_Error error = FT_Init_FreeType(&library);\n\tif (error != FT_Err_Ok) { throw new std::exception(); }\n\n\t_loadFace(library, &face, _pointSize * 100.0f);\n\tmetrics = face->size->metrics;\n\t_ascender = (metrics.ascender >> 6) \/ 100.0f;\n\t_descender = (metrics.descender >> 6) \/ 100.0f;\n\t_height = (metrics.height >> 6) \/ 100.0f;\n\t_linegap = _height - _ascender + _descender;\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\n}\n\nvoid TextureFont::_loadFace(FT_Library library, FT_Face *face, float pointSize)\n{\n\tFT_Error error = FT_New_Face(library, _filename.c_str(), 0, face);\n\tif (error != FT_Err_Ok)\n\t{\n\t\tthrow new std::exception();\n\t}\n\n\terror = FT_Select_Charmap(*face, FT_ENCODING_UNICODE);\n\tif (error)\n\t{\n\t\tthrow new std::exception();\n\t}\n\n\terror = FT_Set_Char_Size(*face, (int)(pointSize * POINT_RES), 0, DPI * POINT_RES, DPI);\n\tif (error)\n\t{\n\t\tthrow new std::exception();\n\t}\n\t\n\tFT_Matrix matrix = {\n\t\t(int)((1.0 \/ POINT_RES) * 0x10000L),\n\t\t0,\n\t\t0,\n\t\t0x10000L\n\t};\n\n\tFT_Set_Transform(*face, &matrix, nullptr);\n}\n\nvoid TextureFont::_loadFace(FT_Library library, FT_Face *face)\n{\n\t_loadFace(library, face, _pointSize);\n}<commit_msg>Remove some space<commit_after>#include \"TextureFont.hpp\"\n#include FT_LCD_FILTER_H\n#include FT_STROKER_H\n\nusing namespace rffalcon;\n\n#define POINT_RES 64\n#define DPI 72\n\nTextureFont::TextureFont(std::shared_ptr<TextureAtlas> atlas, const float pointSize, const std::string &filename)\n\t: _atlas(atlas), _pointSize(pointSize), _filename(filename)\n{\n\t_lcdWeights[0] = 0x10;\n\t_lcdWeights[0] = 0x40;\n\t_lcdWeights[0] = 0x70;\n\t_lcdWeights[0] = 0x40;\n\t_lcdWeights[0] = 0x10;\n\t_initialize();\n}\n\nTextureFont::~TextureFont()\n{\n}\n\nfloat TextureFont::getHeight() const\n{\n\treturn _height;\n}\n\nvoid TextureFont::loadGlyphs(const std::string &text)\n{\n\tint width = _atlas->getWidth();\n\tint height = _atlas->getHeight();\n\tint depth = _atlas->getDepth();\n\n\tFT_Library library;\n\tFT_Face face;\n\tFT_Error error = FT_Init_FreeType(&library);\n\tif (error != FT_Err_Ok) { throw new std::exception(); }\n\n\t_loadFace(library, &face);\n\n\tFT_Int32 flags = _getFlags();\n\tint length = text.length();\n\t\/\/ Load the glyph for each character in the string\n\tfor (int i = 0; i < length; ++i)\n\t{\n\t\tchar charCode = text[i];\n\t\tif (_shouldLoadGlyph(charCode))\n\t\t{\n\t\t\t_setFiltering(library);\n\t\t\tFT_UInt glyphIndex = FT_Get_Char_Index(face, charCode);\n\t\t\terror = FT_Load_Glyph(face, glyphIndex, flags);\n\t\t\tif (error) { throw new std::exception(); }\n\t\t\tGlyphLocation glyphLocation = _getGlyphLocation(library, face);\n\t\t\ts1::ivec4 region = _atlas->getRegion(glyphLocation.width, glyphLocation.height);\n\t\t}\n\t}\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\n}\n\nGlyphLocation TextureFont::_getGlyphLocation(FT_Library library, FT_Face face)\n{\n\tGlyphLocation glyphLocation;\n\tFT_Bitmap bitmap;\n\tint depth = _atlas->getDepth();\n\tif (_outlineType == 0)\n\t{\n\t\tFT_GlyphSlot slot = face->glyph;\n\t\tbitmap = slot->bitmap;\n\t\tglyphLocation.top = slot->bitmap_top;\n\t\tglyphLocation.left = slot->bitmap_left;\n\t}\n\telse\n\t{\n\t\tFT_Stroker stroker;\n\t\tFT_BitmapGlyph bitmapGlyph;\n\t\t\n\t\tFT_Error error = FT_Stroker_New(library, &stroker);\n\t\tif (error) { throw new std::exception(); }\n\t\t\n\t\tFT_Stroker_Set(stroker, static_cast<int>(_outlineThickness * POINT_RES),\n\t\t\tFT_STROKER_LINECAP_ROUND, FT_STROKER_LINEJOIN_ROUND, 0);\n\t\t\n\t\tFT_Glyph glyph;\n\t\terror = FT_Get_Glyph(face->glyph, &glyph);\n\t\tif (error) { throw new std::exception(); }\n\n\t\tif (_outlineType == 1)\n\t\t{\n\t\t\terror = FT_Glyph_Stroke(&glyph, stroker, 1);\n\t\t}\n\t\telse if (_outlineType == 2)\n\t\t{\n\t\t\terror = FT_Glyph_StrokeBorder(&glyph, stroker, 0, 1);\n\t\t}\n\t\telse if (_outlineType == 3)\n\t\t{\n\t\t\terror = FT_Glyph_StrokeBorder(&glyph, stroker, 1, 1);\n\t\t}\n\n\t\tif (error) { throw new std::exception(); }\n\n\t\tFT_Render_Mode renderMode = _atlas->getDepth() == 1 ? FT_RENDER_MODE_NORMAL : FT_RENDER_MODE_LCD;\n\t\terror = FT_Glyph_To_Bitmap(&glyph, renderMode, 0, 1);\n\t\tif (error) { throw new std::exception(); }\n\n\t\tbitmapGlyph = reinterpret_cast<FT_BitmapGlyph>(glyph);\n\t\tbitmap = bitmapGlyph->bitmap;\n\t\tglyphLocation.left = bitmapGlyph->left;\n\t\tglyphLocation.top = bitmapGlyph->top;\n\t\tFT_Stroker_Done(stroker);\n\t}\n\n\tglyphLocation.width = bitmap.width \/ depth;\n\tglyphLocation.height = bitmap.rows;\n\n\treturn glyphLocation;\n}\n\nvoid TextureFont::_setFiltering(FT_Library library)\n{\n\tif (_atlas->getDepth() == 3)\n\t{\n\t\tFT_Library_SetLcdFilter(library, FT_LCD_FILTER_LIGHT);\n\t\tif (_filtering)\n\t\t{\n\t\t\tFT_Library_SetLcdFilterWeights(library, _lcdWeights);\n\t\t}\n\t}\n}\n\nFT_Int32 TextureFont::_getFlags()\n{\n\tFT_Int32 flags = 0;\n\tif (_outlineType > 0)\n\t{\n\t\tflags |= FT_LOAD_NO_BITMAP;\n\t}\n\telse\n\t{\n\t\tflags |= FT_LOAD_RENDER;\n\t}\n\n\tif (!_hinting)\n\t{\n\t\tflags |= FT_LOAD_NO_HINTING | FT_LOAD_NO_AUTOHINT;\n\t}\n\telse\n\t{\n\t\tflags |= FT_LOAD_FORCE_AUTOHINT;\n\t}\n\n\tif (_atlas->getDepth() == 3)\n\t{\n\t\tflags |= FT_LOAD_TARGET_LCD;\n\t}\n\n\treturn flags;\n}\n\nbool TextureFont::_shouldLoadGlyph(const char charCode)\n{\n\t\/\/ Skip glyphs that have already been loaded\n\tbool skip = false;\n\tint sizeGlyphs = static_cast<int>(_glyphs.size());\n\tfor (int j = 0; j < sizeGlyphs; ++j)\n\t{\n\t\tauto glyph = _glyphs[j];\n\t\tif (glyph->charCode == charCode &&\n\t\t\t(glyph->outlineType == _outlineType && glyph->outlineThickness == _outlineThickness))\n\t\t{\n\t\t\tskip = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\treturn skip;\n}\n\nvoid TextureFont::_initialize()\n{\n\tFT_Library library;\n\tFT_Face face;\n\tFT_Size_Metrics metrics;\n\n\tFT_Error error = FT_Init_FreeType(&library);\n\tif (error != FT_Err_Ok) { throw new std::exception(); }\n\n\t_loadFace(library, &face, _pointSize * 100.0f);\n\tmetrics = face->size->metrics;\n\t_ascender = (metrics.ascender >> 6) \/ 100.0f;\n\t_descender = (metrics.descender >> 6) \/ 100.0f;\n\t_height = (metrics.height >> 6) \/ 100.0f;\n\t_linegap = _height - _ascender + _descender;\n\n\tFT_Done_Face(face);\n\tFT_Done_FreeType(library);\n}\n\nvoid TextureFont::_loadFace(FT_Library library, FT_Face *face, float pointSize)\n{\n\tFT_Error error = FT_New_Face(library, _filename.c_str(), 0, face);\n\tif (error != FT_Err_Ok)\n\t{\n\t\tthrow new std::exception();\n\t}\n\n\terror = FT_Select_Charmap(*face, FT_ENCODING_UNICODE);\n\tif (error)\n\t{\n\t\tthrow new std::exception();\n\t}\n\n\terror = FT_Set_Char_Size(*face, (int)(pointSize * POINT_RES), 0, DPI * POINT_RES, DPI);\n\tif (error)\n\t{\n\t\tthrow new std::exception();\n\t}\n\t\n\tFT_Matrix matrix = {\n\t\t(int)((1.0 \/ POINT_RES) * 0x10000L),\n\t\t0,\n\t\t0,\n\t\t0x10000L\n\t};\n\n\tFT_Set_Transform(*face, &matrix, nullptr);\n}\n\nvoid TextureFont::_loadFace(FT_Library library, FT_Face *face)\n{\n\t_loadFace(library, face, _pointSize);\n}<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/mc\/perf_reg.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file perf_reg.C\n\/\/\/ @brief Subroutines to manipulate the memory controller performance registers\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n\n#include <p9_mc_scom_addresses.H>\n#include <p9_mc_scom_addresses_fld.H>\n\n#include <lib\/mss_attribute_accessors.H>\n#include <lib\/shared\/mss_const.H>\n#include <lib\/mc\/mc.H>\n#include <generic\/memory\/lib\/utils\/scom.H>\n#include <lib\/dimm\/kind.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_MCS;\nusing fapi2::TARGET_TYPE_DIMM;\n\nnamespace mss\n{\n\nnamespace mc\n{\n\n\/\/\/\n\/\/\/ @brief Perform initializations of the MC performance registers\n\/\/\/ @note Some of these bits are taken care of in the scom initfiles\n\/\/\/ @param[in] i_target the target which has the MCA to map\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode setup_perf2_register(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n fapi2::buffer<uint64_t> l_data;\n\n \/\/ Get the values we need to put in the register\n uint64_t l_value;\n FAPI_TRY( calculate_perf2(i_target, l_value) );\n\n \/\/ Setup the registers\n FAPI_TRY( mss::getScom(i_target, MCS_0_PORT02_MCPERF2, l_data) );\n\n \/\/ Per S. Powell 7\/16, setup these registers but don't enable the function yet. So enable bits are\n \/\/ intentionally not set\n l_data.insertFromRight<MCS_PORT02_MCPERF2_REFRESH_BLOCK_CONFIG,\n MCS_PORT02_MCPERF2_REFRESH_BLOCK_CONFIG_LEN>(l_value);\n\n FAPI_TRY( mss::putScom(i_target, MCS_0_PORT02_MCPERF2, l_data) );\n\nfapi_try_exit:\n return fapi2::FAPI2_RC_SUCCESS;\n}\n\n\/\/\/\n\/\/\/ @brief Calculate the value of the MC perf2 register.\n\/\/\/ @param[in] i_target the target which has the MCA to map\n\/\/\/ @param[out] o_value the perf2 value for the MCA\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode calculate_perf2(const fapi2::Target<TARGET_TYPE_MCA>& i_target, uint64_t& o_value)\n{\n \/\/\n \/\/ From Senor Powell 7\/16\n \/\/ if (slots=1, masters=1)\n \/\/ MCPERF2_Refresh_Block_Config=0b000\n \/\/ if (slots=1, masters=2)\n \/\/ MCPERF2_Refresh_Block_Config=0b001\n \/\/ if (slots=1, masters=4)\n \/\/ MCPERF2_Refresh_Block_Config=0b100\n \/\/ if (slots=2, masters=1)\n \/\/ MCPERF2_Refresh_Block_Config=0b010\n \/\/ if (slots=2, masters=2)\n \/\/ MCPERF2_Refresh_Block_Config=0b011\n \/\/ if (slots=2, masters=4)\n \/\/ MCPERF2_Refresh_Block_Config=0b100\n \/\/\n \/\/ if slot0 is 2 masters and slot1 is 1 master, just choose the 2 slot, 2 masters setting.\n \/\/ (i.e., choose the max(mranks_dimm1, mranks_dimm2)\n\n constexpr uint64_t l_refresh_values[MAX_DIMM_PER_PORT][MAX_RANK_PER_DIMM] =\n {\n {0b000, 0b001, 0, 0b100}, \/\/ Skip the ol' 3 rank DIMM\n {0b010, 0b011, 0, 0b100}\n };\n\n FAPI_INF(\"Calculating perf2 register for MCA%d (%d)\", mss::pos(i_target), mss::index(i_target));\n\n \/\/ Find the DIMM on this port with the most master ranks.\n \/\/ That's how we know which element in the table to use.\n \/\/ uint8_t so I can use it to read from an attribute directly\n\n uint8_t l_mrank_index = 0;\n uint8_t l_master_ranks_zero = 0;\n uint8_t l_master_ranks_one = 0;\n\n fapi2::buffer<uint64_t> l_data;\n\n const auto l_dimm = mss::find_targets<TARGET_TYPE_DIMM>(i_target);\n const auto l_slot_index = l_dimm.size() - 1;\n\n switch(l_dimm.size())\n {\n \/\/ No DIMM, nothing to do\n case 0:\n return fapi2::FAPI2_RC_SUCCESS;\n break;\n\n \/\/ One DIMM, we've got the slots of fun\n case 1:\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[0], l_mrank_index) );\n --l_mrank_index;\n FAPI_INF(\"1 DIMM mranks: D0[%d] index %d\", l_mrank_index + 1, l_mrank_index);\n break;\n\n \/\/ Two DIMM, find the max of the master ranks\n case 2:\n {\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[0], l_master_ranks_zero) );\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[1], l_master_ranks_one) );\n\n l_mrank_index = std::max(l_master_ranks_zero, l_master_ranks_one) - 1;\n FAPI_INF(\"2 DIMM mranks: D0[%d] D1[%d] index %d\", l_master_ranks_zero, l_master_ranks_one, l_mrank_index);\n }\n break;\n\n default:\n \/\/ We have a bug - no way to get more than 2 DIMM in a dual-drop system\n FAPI_ERR(\"seeing %d DIMM on %s\", l_dimm.size(), mss::c_str(i_target));\n fapi2::Assert(false);\n break;\n };\n\n FAPI_INF(\"Refresh Block Config: %u ([%d][%d] populated slots: %d, max mranks: %d)\",\n l_refresh_values[l_slot_index][l_mrank_index],\n l_slot_index, l_mrank_index,\n l_slot_index + 1, l_mrank_index + 1);\n\n o_value = l_refresh_values[l_slot_index][l_mrank_index];\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n} \/\/ namespace\n\n} \/\/ namespace\n<commit_msg>Update HPW Level for MSS API library<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/mc\/perf_reg.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file perf_reg.C\n\/\/\/ @brief Subroutines to manipulate the memory controller performance registers\n\/\/\/\n\/\/ *HWP HWP Owner: Stephen Glancy <sglancy@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 3\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n\n#include <p9_mc_scom_addresses.H>\n#include <p9_mc_scom_addresses_fld.H>\n\n#include <lib\/mss_attribute_accessors.H>\n#include <lib\/shared\/mss_const.H>\n#include <lib\/mc\/mc.H>\n#include <generic\/memory\/lib\/utils\/scom.H>\n#include <lib\/dimm\/kind.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n\nusing fapi2::TARGET_TYPE_MCA;\nusing fapi2::TARGET_TYPE_MCS;\nusing fapi2::TARGET_TYPE_DIMM;\n\nnamespace mss\n{\n\nnamespace mc\n{\n\n\/\/\/\n\/\/\/ @brief Perform initializations of the MC performance registers\n\/\/\/ @note Some of these bits are taken care of in the scom initfiles\n\/\/\/ @param[in] i_target the target which has the MCA to map\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode setup_perf2_register(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n fapi2::buffer<uint64_t> l_data;\n\n \/\/ Get the values we need to put in the register\n uint64_t l_value;\n FAPI_TRY( calculate_perf2(i_target, l_value) );\n\n \/\/ Setup the registers\n FAPI_TRY( mss::getScom(i_target, MCS_0_PORT02_MCPERF2, l_data) );\n\n \/\/ Per S. Powell 7\/16, setup these registers but don't enable the function yet. So enable bits are\n \/\/ intentionally not set\n l_data.insertFromRight<MCS_PORT02_MCPERF2_REFRESH_BLOCK_CONFIG,\n MCS_PORT02_MCPERF2_REFRESH_BLOCK_CONFIG_LEN>(l_value);\n\n FAPI_TRY( mss::putScom(i_target, MCS_0_PORT02_MCPERF2, l_data) );\n\nfapi_try_exit:\n return fapi2::FAPI2_RC_SUCCESS;\n}\n\n\/\/\/\n\/\/\/ @brief Calculate the value of the MC perf2 register.\n\/\/\/ @param[in] i_target the target which has the MCA to map\n\/\/\/ @param[out] o_value the perf2 value for the MCA\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\nfapi2::ReturnCode calculate_perf2(const fapi2::Target<TARGET_TYPE_MCA>& i_target, uint64_t& o_value)\n{\n \/\/\n \/\/ From Senor Powell 7\/16\n \/\/ if (slots=1, masters=1)\n \/\/ MCPERF2_Refresh_Block_Config=0b000\n \/\/ if (slots=1, masters=2)\n \/\/ MCPERF2_Refresh_Block_Config=0b001\n \/\/ if (slots=1, masters=4)\n \/\/ MCPERF2_Refresh_Block_Config=0b100\n \/\/ if (slots=2, masters=1)\n \/\/ MCPERF2_Refresh_Block_Config=0b010\n \/\/ if (slots=2, masters=2)\n \/\/ MCPERF2_Refresh_Block_Config=0b011\n \/\/ if (slots=2, masters=4)\n \/\/ MCPERF2_Refresh_Block_Config=0b100\n \/\/\n \/\/ if slot0 is 2 masters and slot1 is 1 master, just choose the 2 slot, 2 masters setting.\n \/\/ (i.e., choose the max(mranks_dimm1, mranks_dimm2)\n\n constexpr uint64_t l_refresh_values[MAX_DIMM_PER_PORT][MAX_RANK_PER_DIMM] =\n {\n {0b000, 0b001, 0, 0b100}, \/\/ Skip the ol' 3 rank DIMM\n {0b010, 0b011, 0, 0b100}\n };\n\n FAPI_INF(\"Calculating perf2 register for MCA%d (%d)\", mss::pos(i_target), mss::index(i_target));\n\n \/\/ Find the DIMM on this port with the most master ranks.\n \/\/ That's how we know which element in the table to use.\n \/\/ uint8_t so I can use it to read from an attribute directly\n\n uint8_t l_mrank_index = 0;\n uint8_t l_master_ranks_zero = 0;\n uint8_t l_master_ranks_one = 0;\n\n fapi2::buffer<uint64_t> l_data;\n\n const auto l_dimm = mss::find_targets<TARGET_TYPE_DIMM>(i_target);\n const auto l_slot_index = l_dimm.size() - 1;\n\n switch(l_dimm.size())\n {\n \/\/ No DIMM, nothing to do\n case 0:\n return fapi2::FAPI2_RC_SUCCESS;\n break;\n\n \/\/ One DIMM, we've got the slots of fun\n case 1:\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[0], l_mrank_index) );\n --l_mrank_index;\n FAPI_INF(\"1 DIMM mranks: D0[%d] index %d\", l_mrank_index + 1, l_mrank_index);\n break;\n\n \/\/ Two DIMM, find the max of the master ranks\n case 2:\n {\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[0], l_master_ranks_zero) );\n FAPI_TRY( mss::eff_num_master_ranks_per_dimm(l_dimm[1], l_master_ranks_one) );\n\n l_mrank_index = std::max(l_master_ranks_zero, l_master_ranks_one) - 1;\n FAPI_INF(\"2 DIMM mranks: D0[%d] D1[%d] index %d\", l_master_ranks_zero, l_master_ranks_one, l_mrank_index);\n }\n break;\n\n default:\n \/\/ We have a bug - no way to get more than 2 DIMM in a dual-drop system\n FAPI_ERR(\"seeing %d DIMM on %s\", l_dimm.size(), mss::c_str(i_target));\n fapi2::Assert(false);\n break;\n };\n\n FAPI_INF(\"Refresh Block Config: %u ([%d][%d] populated slots: %d, max mranks: %d)\",\n l_refresh_values[l_slot_index][l_mrank_index],\n l_slot_index, l_mrank_index,\n l_slot_index + 1, l_mrank_index + 1);\n\n o_value = l_refresh_values[l_slot_index][l_mrank_index];\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n} \/\/ namespace\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * MRustC - Rust Compiler\n * - By John Hodge (Mutabah\/thePowersGang)\n *\n * span.cpp\n * - Spans and error handling\n *\/\n#include <functional>\n#include <iostream>\n#include <span.hpp>\n#include <parse\/lex.hpp>\n#include <common.hpp>\n\nSpan::Span(const Span& x):\n outer_span(x.outer_span),\n filename(x.filename),\n start_line(x.start_line),\n start_ofs(x.start_ofs),\n end_line(x.end_line),\n end_ofs(x.end_ofs)\n{\n}\nSpan::Span(const Position& pos):\n outer_span(),\n filename(pos.filename),\n start_line(pos.line),\n start_ofs(pos.ofs),\n end_line(pos.line),\n end_ofs(pos.ofs)\n{\n}\nSpan::Span():\n outer_span(),\n filename(\"\")\/*,\n start_line(0), start_ofs(0),\n end_line(0), end_ofs(0) \/\/ *\/\n{\n DEBUG(\"Empty span\");\n \/\/filename = FMT(\":\" << __builtin_return_address(0));\n}\n\nvoid Span::bug(::std::function<void(::std::ostream&)> msg) const\n{\n ::std::cerr << this->filename << \":\" << this->start_line << \": BUG:\";\n msg(::std::cerr);\n ::std::cerr << ::std::endl;\n abort();\n}\n\nvoid Span::error(ErrorType tag, ::std::function<void(::std::ostream&)> msg) const {\n ::std::cerr << this->filename << \":\" << this->start_line << \": error:\" << tag <<\":\";\n msg(::std::cerr);\n ::std::cerr << ::std::endl;\n abort();\n}\nvoid Span::warning(WarningType tag, ::std::function<void(::std::ostream&)> msg) const {\n ::std::cerr << this->filename << \":\" << this->start_line << \": warning:\" << tag << \":\";\n msg(::std::cerr);\n ::std::cerr << ::std::endl;\n \/\/abort();\n}\nvoid Span::note(::std::function<void(::std::ostream&)> msg) const {\n ::std::cerr << this->filename << \":\" << this->start_line << \": note:\";\n msg(::std::cerr);\n ::std::cerr << ::std::endl;\n \/\/abort();\n}\n\n::std::ostream& operator<<(::std::ostream& os, const Span& sp)\n{\n os << sp.filename << \":\" << sp.start_line;\n return os;\n}\n<commit_msg>Span - Tweak printing to print context (doesn't apply yet, because nothing provides context)<commit_after>\/*\n * MRustC - Rust Compiler\n * - By John Hodge (Mutabah\/thePowersGang)\n *\n * span.cpp\n * - Spans and error handling\n *\/\n#include <functional>\n#include <iostream>\n#include <span.hpp>\n#include <parse\/lex.hpp>\n#include <common.hpp>\n\nSpan::Span(const Span& x):\n outer_span(x.outer_span),\n filename(x.filename),\n start_line(x.start_line),\n start_ofs(x.start_ofs),\n end_line(x.end_line),\n end_ofs(x.end_ofs)\n{\n}\nSpan::Span(const Position& pos):\n outer_span(),\n filename(pos.filename),\n start_line(pos.line),\n start_ofs(pos.ofs),\n end_line(pos.line),\n end_ofs(pos.ofs)\n{\n}\nSpan::Span():\n outer_span(),\n filename(\"\")\/*,\n start_line(0), start_ofs(0),\n end_line(0), end_ofs(0) \/\/ *\/\n{\n DEBUG(\"Empty span\");\n \/\/filename = FMT(\":\" << __builtin_return_address(0));\n}\n\nnamespace {\n void print_span_message(const Span& sp, ::std::function<void(::std::ostream&)> tag, ::std::function<void(::std::ostream&)> msg)\n {\n auto& sink = ::std::cerr;\n sink << sp.filename << \":\" << sp.start_line << \": \";\n tag(sink);\n sink << \":\";\n msg(sink);\n sink << ::std::endl;\n const auto* parent = sp.outer_span.get();\n while(parent)\n {\n sink << parent->filename << \":\" << parent->start_line << \": note: From here\" << ::std::endl;\n parent = parent->outer_span.get();\n }\n }\n}\nvoid Span::bug(::std::function<void(::std::ostream&)> msg) const\n{\n print_span_message(*this, [](auto& os){os << \"BUG\";}, msg);\n abort();\n}\n\nvoid Span::error(ErrorType tag, ::std::function<void(::std::ostream&)> msg) const {\n print_span_message(*this, [&](auto& os){os << \"error:\" << tag;}, msg);\n abort();\n}\nvoid Span::warning(WarningType tag, ::std::function<void(::std::ostream&)> msg) const {\n print_span_message(*this, [&](auto& os){os << \"warning\" << tag;}, msg);\n}\nvoid Span::note(::std::function<void(::std::ostream&)> msg) const {\n print_span_message(*this, [](auto& os){os << \"note\";}, msg);\n}\n\n::std::ostream& operator<<(::std::ostream& os, const Span& sp)\n{\n os << sp.filename << \":\" << sp.start_line;\n return os;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/perv\/p9_extract_sbe_rc.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/------------------------------------------------------------------------------\n\/\/\/ @file p9_extract_sbe_rc.H\n\/\/\/\n\/\/\/ @brief Check for errors on the PNOR , SEEPROM\n\/\/------------------------------------------------------------------------------\n\/\/ *HWP HW Owner : Soma BhanuTej <soma.bhanu@in.ibm.com>\n\/\/ *HWP HW Backup Owner : Srinivas V Naga <srinivan@in.ibm.com>\n\/\/ *HWP FW Owner : Sunil Kumar <skumar8j@in.ibm.com>\n\/\/ *HWP Team : Perv\n\/\/ *HWP Level : 2\n\/\/ *HWP Consumed by : FSP:HB\n\/\/------------------------------------------------------------------------------\n\n\n#ifndef _P9_EXTRACT_SBE_RC_H_\n#define _P9_EXTRACT_SBE_RC_H_\n\n\n#include <fapi2.H>\n\n\ntypedef fapi2::ReturnCode (*p9_extract_sbe_rc_FP_t)(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&);\n\n\/\/\/ @brief called on all chips(master and slaves) to look for any correctable errors on the PNOR and\/or SEEPROM, the soft_error flag tells the procedure not to generate error if no HW issue.\n\/\/\/\n\/\/\/ @param[in] i_target_chiplet Reference to TARGET_TYPE_PROC_CHIP target\n\/\/\/ @return FAPI2_RC_SUCCESS if success, else error code.\nextern \"C\"\n{\n fapi2::ReturnCode p9_extract_sbe_rc(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target_chip);\n}\n\n#endif\n<commit_msg>Level 2 HWP for p9_extract_sbe_rc - Ver2<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/perv\/p9_extract_sbe_rc.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/------------------------------------------------------------------------------\n\/\/\/ @file p9_extract_sbe_rc.H\n\/\/\/\n\/\/\/ @brief Check for errors on the SBE, OTPROM, PIBMEM & SEEPROM\n\/\/------------------------------------------------------------------------------\n\/\/ *HWP HW Owner : Soma BhanuTej <soma.bhanu@in.ibm.com>\n\/\/ *HWP HW Backup Owner : Srinivas V Naga <srinivan@in.ibm.com>\n\/\/ *HWP FW Owner : Sunil Kumar <skumar8j@in.ibm.com>\n\/\/ *HWP Team : Perv\n\/\/ *HWP Level : 2\n\/\/ *HWP Consumed by : FSP:HB\n\/\/------------------------------------------------------------------------------\n\n\n#ifndef _P9_EXTRACT_SBE_RC_H_\n#define _P9_EXTRACT_SBE_RC_H_\n\n\n#include <fapi2.H>\n\nnamespace P9_EXTRACT_SBE_RC\n{\nenum RETURN_ACTION\n{\n RESTART_SBE = 1, \/\/ Trigger external HRESET to reset SBE\n RESTART_CBS = 2, \/\/ Trigger Warm ipl where we don't switch off VSB just toggle start_cbs from FSP\n REIPL_BKP_SEEPROM = 3, \/\/ Run IPL by selecting backup seeprom\n RE_IPL = 4, \/\/ Reload\/update of SEEPROM required or deconfig the chip\n NO_RECOVERY_ACTION = 5 \/\/ No recovery action possible to correct this error, Replace the chip with new one\n};\n};\n\ntypedef fapi2::ReturnCode (*p9_extract_sbe_rc_FP_t)(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>&,\n P9_EXTRACT_SBE_RC::RETURN_ACTION&);\n\n\/\/\/ @brief called on all chips(master and slaves) to look for any correctable errors on the SBE, OTPROM, PIBMEM & SEEPROM, the soft_error flag tells the procedure not to generate error if no HW issue.\n\/\/\/\n\/\/\/ @param[in] i_target_chiplet Reference to TARGET_TYPE_PROC_CHIP target\n\/\/\/ @param[out] o_return_action Returns the action to be taken on an error\n\/\/\/ @return FAPI2_RC_SUCCESS if success, else error code.\nextern \"C\"\n{\n fapi2::ReturnCode p9_extract_sbe_rc(const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_target_chip,\n P9_EXTRACT_SBE_RC::RETURN_ACTION& o_return_action);\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#ifndef regex_hh_INCLUDED\n#define regex_hh_INCLUDED\n\n#include \"string.hh\"\n#include \"regex_impl.hh\"\n\nnamespace Kakoune\n{\n\n\/\/ Regex that keeps track of its string representation\nclass Regex\n{\npublic:\n Regex() = default;\n\n explicit Regex(StringView re, RegexCompileFlags flags = RegexCompileFlags::None);\n bool empty() const { return m_str.empty(); }\n bool operator==(const Regex& other) const { return m_str == other.m_str; }\n bool operator!=(const Regex& other) const { return m_str != other.m_str; }\n\n const String& str() const { return m_str; }\n\n size_t mark_count() const { return m_impl->save_count \/ 2 - 1; }\n\n static constexpr const char* option_type_name = \"regex\";\n\n const CompiledRegex* impl() const { return m_impl.get(); }\n\nprivate:\n RefPtr<CompiledRegex> m_impl;\n String m_str;\n};\n\ntemplate<typename Iterator>\nstruct MatchResults\n{\n struct SubMatch : std::pair<Iterator, Iterator>\n {\n SubMatch() = default;\n SubMatch(Iterator begin, Iterator end)\n : std::pair<Iterator, Iterator>{begin, end}, matched{begin != Iterator{}}\n {}\n\n bool matched = false;\n };\n\n struct iterator : std::iterator<std::bidirectional_iterator_tag, SubMatch, size_t, SubMatch*, SubMatch>\n {\n using It = typename Vector<Iterator, MemoryDomain::Regex>::const_iterator;\n\n iterator() = default;\n iterator(It it) : m_it{std::move(it)} {}\n\n iterator& operator--() { m_it += 2; return *this; }\n iterator& operator++() { m_it += 2; return *this; }\n SubMatch operator*() const { return {*m_it, *(m_it+1)}; }\n\n friend bool operator==(const iterator& lhs, const iterator& rhs) { return lhs.m_it == rhs.m_it; }\n friend bool operator!=(const iterator& lhs, const iterator& rhs) { return lhs.m_it != rhs.m_it; }\n private:\n\n It m_it;\n };\n\n MatchResults() = default;\n MatchResults(Vector<Iterator, MemoryDomain::Regex> values) : m_values{std::move(values)} {}\n\n iterator begin() const { return iterator{m_values.begin()}; }\n iterator cbegin() const { return iterator{m_values.cbegin()}; }\n iterator end() const { return iterator{m_values.end()}; }\n iterator cend() const { return iterator{m_values.cend()}; }\n\n size_t size() const { return m_values.size() \/ 2; }\n bool empty() const { return m_values.empty(); }\n\n SubMatch operator[](size_t i) const\n {\n return i * 2 < m_values.size() ?\n SubMatch{m_values[i*2], m_values[i*2+1]} : SubMatch{};\n }\n\n friend bool operator==(const MatchResults& lhs, const MatchResults& rhs)\n {\n return lhs.m_values == rhs.m_values;\n }\n\n friend bool operator!=(const MatchResults& lhs, const MatchResults& rhs)\n {\n return not (lhs == rhs);\n }\n\n void swap(MatchResults& other)\n {\n m_values.swap(other.m_values);\n }\n\n Vector<Iterator, MemoryDomain::Regex>& values() { return m_values; }\n\nprivate:\n Vector<Iterator, MemoryDomain::Regex> m_values;\n};\n\ninline RegexExecFlags match_flags(bool bol, bool eol, bool bow, bool eow)\n{\n return (bol ? RegexExecFlags::None : RegexExecFlags::NotBeginOfLine) |\n (eol ? RegexExecFlags::None : RegexExecFlags::NotEndOfLine) |\n (bow ? RegexExecFlags::None : RegexExecFlags::NotBeginOfWord) |\n (eow ? RegexExecFlags::None : RegexExecFlags::NotEndOfWord);\n}\n\ntemplate<typename It>\nbool regex_match(It begin, It end, const Regex& re)\n{\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n return vm.exec(begin, end, begin, end, RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It>\nbool regex_match(It begin, It end, MatchResults<It>& res, const Regex& re)\n{\n res.values().clear();\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n if (vm.exec(begin, end, begin, end, RegexExecFlags::None))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(res.values()));\n return true;\n }\n return false;\n}\n\ntemplate<typename It>\nbool regex_search(It begin, It end, It subject_begin, It subject_end, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n return vm.exec(begin, end, subject_begin, subject_end,\n flags | RegexExecFlags::Search | RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, It subject_begin, It subject_end,\n MatchResults<It>& res, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n res.values().clear();\n ThreadedRegexVM<It, direction> vm{*re.impl()};\n if (vm.exec(begin, end, subject_begin, subject_end, flags | RegexExecFlags::Search))\n {\n std::move(vm.captures().begin(), vm.captures().end(), std::back_inserter(res.values()));\n return true;\n }\n return false;\n}\n\ntemplate<typename It>\nbool backward_regex_search(It begin, It end, It subject_begin, It subject_end,\n MatchResults<It>& res, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n return regex_search<It, MatchDirection::Backward>(begin, end, subject_begin, subject_end, res, re, flags);\n}\n\nString option_to_string(const Regex& re);\nvoid option_from_string(StringView str, Regex& re);\n\ntemplate<typename Iterator, MatchDirection direction = MatchDirection::Forward>\nstruct RegexIterator\n{\n using ValueType = MatchResults<Iterator>;\n\n RegexIterator() = default;\n RegexIterator(Iterator begin, Iterator end,\n Iterator subject_begin, Iterator subject_end,\n const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n : m_regex{&re}, m_next_pos{direction == MatchDirection::Forward ? begin : end},\n m_begin{begin}, m_end{end},\n m_subject_begin{subject_begin}, m_subject_end{subject_end},\n m_flags{flags}\n {\n next();\n }\n\n RegexIterator(Iterator begin, Iterator end, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n : RegexIterator{begin, end, begin, end, re, flags} {}\n\n const ValueType& operator*() const { kak_assert(m_regex); return m_results; }\n const ValueType* operator->() const { kak_assert(m_regex); return &m_results; }\n\n RegexIterator& operator++()\n {\n next();\n return *this;\n }\n\n friend bool operator==(const RegexIterator& lhs, const RegexIterator& rhs)\n {\n if (lhs.m_regex == nullptr and rhs.m_regex == nullptr)\n return true;\n\n return lhs.m_regex == rhs.m_regex and\n lhs.m_next_pos == rhs.m_next_pos and\n lhs.m_end == rhs.m_end and\n lhs.m_flags == rhs.m_flags and\n lhs.m_results == rhs.m_results;\n }\n\n friend bool operator!=(const RegexIterator& lhs, const RegexIterator& rhs)\n {\n return not (lhs == rhs);\n }\n\n RegexIterator begin() { return *this; }\n RegexIterator end() { return {}; }\n\nprivate:\n void next()\n {\n kak_assert(m_regex);\n\n RegexExecFlags additional_flags{};\n if (m_results.size() and m_results[0].first == m_results[0].second)\n additional_flags |= RegexExecFlags::NotInitialNull;\n\n if (direction == MatchDirection::Forward)\n {\n if (not regex_search(m_next_pos, m_end, m_subject_begin, m_subject_end,\n m_results, *m_regex, m_flags | additional_flags))\n m_regex = nullptr;\n else\n m_next_pos = m_results[0].second;\n }\n else\n {\n if (not backward_regex_search(m_begin, m_next_pos, m_subject_begin, m_subject_end,\n m_results, *m_regex, m_flags | additional_flags))\n m_regex = nullptr;\n else\n m_next_pos = m_results[0].first;\n }\n }\n\n const Regex* m_regex = nullptr;\n MatchResults<Iterator> m_results;\n Iterator m_next_pos{};\n const Iterator m_begin{};\n const Iterator m_end{};\n const Iterator m_subject_begin{};\n const Iterator m_subject_end{};\n const RegexExecFlags m_flags = RegexExecFlags::None;\n};\n\n}\n\n#endif \/\/ regex_hh_INCLUDED\n<commit_msg>Refactor RegexIterator::next to directly use a ThreadedRegexVM<commit_after>#ifndef regex_hh_INCLUDED\n#define regex_hh_INCLUDED\n\n#include \"string.hh\"\n#include \"regex_impl.hh\"\n\nnamespace Kakoune\n{\n\n\/\/ Regex that keeps track of its string representation\nclass Regex\n{\npublic:\n Regex() = default;\n\n explicit Regex(StringView re, RegexCompileFlags flags = RegexCompileFlags::None);\n bool empty() const { return m_str.empty(); }\n bool operator==(const Regex& other) const { return m_str == other.m_str; }\n bool operator!=(const Regex& other) const { return m_str != other.m_str; }\n\n const String& str() const { return m_str; }\n\n size_t mark_count() const { return m_impl->save_count \/ 2 - 1; }\n\n static constexpr const char* option_type_name = \"regex\";\n\n const CompiledRegex* impl() const { return m_impl.get(); }\n\nprivate:\n RefPtr<CompiledRegex> m_impl;\n String m_str;\n};\n\ntemplate<typename Iterator>\nstruct MatchResults\n{\n struct SubMatch : std::pair<Iterator, Iterator>\n {\n SubMatch() = default;\n SubMatch(Iterator begin, Iterator end)\n : std::pair<Iterator, Iterator>{begin, end}, matched{begin != Iterator{}}\n {}\n\n bool matched = false;\n };\n\n struct iterator : std::iterator<std::bidirectional_iterator_tag, SubMatch, size_t, SubMatch*, SubMatch>\n {\n using It = typename Vector<Iterator, MemoryDomain::Regex>::const_iterator;\n\n iterator() = default;\n iterator(It it) : m_it{std::move(it)} {}\n\n iterator& operator--() { m_it += 2; return *this; }\n iterator& operator++() { m_it += 2; return *this; }\n SubMatch operator*() const { return {*m_it, *(m_it+1)}; }\n\n friend bool operator==(const iterator& lhs, const iterator& rhs) { return lhs.m_it == rhs.m_it; }\n friend bool operator!=(const iterator& lhs, const iterator& rhs) { return lhs.m_it != rhs.m_it; }\n private:\n\n It m_it;\n };\n\n MatchResults() = default;\n MatchResults(Vector<Iterator, MemoryDomain::Regex> values) : m_values{std::move(values)} {}\n\n iterator begin() const { return iterator{m_values.begin()}; }\n iterator cbegin() const { return iterator{m_values.cbegin()}; }\n iterator end() const { return iterator{m_values.end()}; }\n iterator cend() const { return iterator{m_values.cend()}; }\n\n size_t size() const { return m_values.size() \/ 2; }\n bool empty() const { return m_values.empty(); }\n\n SubMatch operator[](size_t i) const\n {\n return i * 2 < m_values.size() ?\n SubMatch{m_values[i*2], m_values[i*2+1]} : SubMatch{};\n }\n\n friend bool operator==(const MatchResults& lhs, const MatchResults& rhs)\n {\n return lhs.m_values == rhs.m_values;\n }\n\n friend bool operator!=(const MatchResults& lhs, const MatchResults& rhs)\n {\n return not (lhs == rhs);\n }\n\n void swap(MatchResults& other)\n {\n m_values.swap(other.m_values);\n }\n\n Vector<Iterator, MemoryDomain::Regex>& values() { return m_values; }\n\nprivate:\n Vector<Iterator, MemoryDomain::Regex> m_values;\n};\n\ninline RegexExecFlags match_flags(bool bol, bool eol, bool bow, bool eow)\n{\n return (bol ? RegexExecFlags::None : RegexExecFlags::NotBeginOfLine) |\n (eol ? RegexExecFlags::None : RegexExecFlags::NotEndOfLine) |\n (bow ? RegexExecFlags::None : RegexExecFlags::NotBeginOfWord) |\n (eow ? RegexExecFlags::None : RegexExecFlags::NotEndOfWord);\n}\n\ntemplate<typename It>\nbool regex_match(It begin, It end, const Regex& re)\n{\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n return vm.exec(begin, end, begin, end, RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It>\nbool regex_match(It begin, It end, MatchResults<It>& res, const Regex& re)\n{\n res.values().clear();\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n if (vm.exec(begin, end, begin, end, RegexExecFlags::None))\n {\n std::copy(vm.captures().begin(), vm.captures().end(), std::back_inserter(res.values()));\n return true;\n }\n return false;\n}\n\ntemplate<typename It>\nbool regex_search(It begin, It end, It subject_begin, It subject_end, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n ThreadedRegexVM<It, MatchDirection::Forward> vm{*re.impl()};\n return vm.exec(begin, end, subject_begin, subject_end,\n flags | RegexExecFlags::Search | RegexExecFlags::AnyMatch | RegexExecFlags::NoSaves);\n}\n\ntemplate<typename It, MatchDirection direction = MatchDirection::Forward>\nbool regex_search(It begin, It end, It subject_begin, It subject_end,\n MatchResults<It>& res, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n res.values().clear();\n ThreadedRegexVM<It, direction> vm{*re.impl()};\n if (vm.exec(begin, end, subject_begin, subject_end, flags | RegexExecFlags::Search))\n {\n std::move(vm.captures().begin(), vm.captures().end(), std::back_inserter(res.values()));\n return true;\n }\n return false;\n}\n\ntemplate<typename It>\nbool backward_regex_search(It begin, It end, It subject_begin, It subject_end,\n MatchResults<It>& res, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n{\n return regex_search<It, MatchDirection::Backward>(begin, end, subject_begin, subject_end, res, re, flags);\n}\n\nString option_to_string(const Regex& re);\nvoid option_from_string(StringView str, Regex& re);\n\ntemplate<typename Iterator, MatchDirection direction = MatchDirection::Forward>\nstruct RegexIterator\n{\n using ValueType = MatchResults<Iterator>;\n\n RegexIterator() = default;\n RegexIterator(Iterator begin, Iterator end,\n Iterator subject_begin, Iterator subject_end,\n const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n : m_program{re.impl()}, m_next_pos{direction == MatchDirection::Forward ? begin : end},\n m_begin{std::move(begin)}, m_end{std::move(end)},\n m_subject_begin{std::move(subject_begin)}, m_subject_end{std::move(subject_end)},\n m_flags{flags}\n {\n next();\n }\n\n RegexIterator(const Iterator& begin, const Iterator& end, const Regex& re,\n RegexExecFlags flags = RegexExecFlags::None)\n : RegexIterator{begin, end, begin, end, re, flags} {}\n\n const ValueType& operator*() const { kak_assert(m_program); return m_results; }\n const ValueType* operator->() const { kak_assert(m_program); return &m_results; }\n\n RegexIterator& operator++()\n {\n next();\n return *this;\n }\n\n friend bool operator==(const RegexIterator& lhs, const RegexIterator& rhs)\n {\n if (lhs.m_program == nullptr and rhs.m_program == nullptr)\n return true;\n\n return lhs.m_program == rhs.m_program and\n lhs.m_next_pos == rhs.m_next_pos and\n lhs.m_end == rhs.m_end and\n lhs.m_flags == rhs.m_flags and\n lhs.m_results == rhs.m_results;\n }\n\n friend bool operator!=(const RegexIterator& lhs, const RegexIterator& rhs)\n {\n return not (lhs == rhs);\n }\n\n RegexIterator begin() { return *this; }\n RegexIterator end() { return {}; }\n\nprivate:\n void next()\n {\n kak_assert(m_program);\n\n auto additional_flags = RegexExecFlags::Search;\n if (m_results.size() and m_results[0].first == m_results[0].second)\n additional_flags |= RegexExecFlags::NotInitialNull;\n\n ThreadedRegexVM<Iterator, direction> vm{*m_program};\n constexpr bool forward = direction == MatchDirection::Forward;\n\n if (vm.exec(forward ? m_next_pos : m_begin, forward ? m_end : m_next_pos,\n m_subject_begin, m_subject_end, m_flags | additional_flags))\n {\n m_results.values().clear();\n std::move(vm.captures().begin(), vm.captures().end(), std::back_inserter(m_results.values()));\n m_next_pos = (direction == MatchDirection::Forward) ? m_results[0].second : m_results[0].first;\n }\n else\n m_program = nullptr;\n }\n\n const CompiledRegex* m_program = nullptr;\n MatchResults<Iterator> m_results;\n Iterator m_next_pos{};\n const Iterator m_begin{};\n const Iterator m_end{};\n const Iterator m_subject_begin{};\n const Iterator m_subject_end{};\n const RegexExecFlags m_flags = RegexExecFlags::None;\n};\n\n}\n\n#endif \/\/ regex_hh_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/------------------------------------------------------------------------------\n\/\/ ParserBase.cpp\n\/\/ Base class for parsing.\n\/\/\n\/\/ File is under the MIT license; see LICENSE for details.\n\/\/------------------------------------------------------------------------------\n#include \"slang\/parsing\/ParserBase.h\"\n\n#include \"slang\/parsing\/Preprocessor.h\"\n#include \"slang\/util\/BumpAllocator.h\"\n\nnamespace slang {\n\nParserBase::ParserBase(Preprocessor& preprocessor) :\n alloc(preprocessor.getAllocator()), window(preprocessor) {\n}\n\nvoid ParserBase::prependSkippedTokens(Token& token) {\n SmallVectorSized<Trivia, 8> buffer;\n buffer.append(Trivia{ TriviaKind::SkippedTokens, skippedTokens.copy(alloc) });\n buffer.appendRange(token.trivia());\n\n token = token.withTrivia(alloc, buffer.copy(alloc));\n skippedTokens.clear();\n}\n\nDiagnostics& ParserBase::getDiagnostics() {\n return window.tokenSource.getDiagnostics();\n}\n\nDiagnostic& ParserBase::addDiag(DiagCode code, SourceLocation location) {\n \/\/ If we issued this error in response to seeing an EOF token, back up and put\n \/\/ the error on the last consumed token instead.\n if (peek(TokenKind::EndOfFile) && peek().location() == location) {\n Token last = getLastConsumed();\n if (last)\n location = last.location() + last.rawText().size();\n }\n\n return getDiagnostics().add(code, location);\n}\n\nToken ParserBase::peek(uint32_t offset) {\n while (window.currentOffset + offset >= window.count)\n window.addNew();\n return window.buffer[window.currentOffset + offset];\n}\n\nToken ParserBase::peek() {\n if (!window.currentToken) {\n if (window.currentOffset >= window.count)\n window.addNew();\n window.currentToken = window.buffer[window.currentOffset];\n }\n ASSERT(window.currentToken);\n return window.currentToken;\n}\n\nbool ParserBase::peek(TokenKind kind) {\n return peek().kind == kind;\n}\n\nToken ParserBase::consume() {\n auto result = peek();\n window.moveToNext();\n if (!skippedTokens.empty())\n prependSkippedTokens(result);\n return result;\n}\n\nToken ParserBase::consumeIf(TokenKind kind) {\n if (peek(kind))\n return consume();\n return Token();\n}\n\nToken ParserBase::expect(TokenKind kind) {\n \/\/ keep this method small so that it gets inlined\n auto result = peek();\n if (result.kind != kind)\n result = Token::createExpected(alloc, getDiagnostics(), result, kind, window.lastConsumed);\n else\n window.moveToNext();\n\n if (!skippedTokens.empty())\n prependSkippedTokens(result);\n\n return result;\n}\n\nvoid ParserBase::skipToken(std::optional<DiagCode> diagCode) {\n auto token = peek();\n skippedTokens.append(token);\n window.moveToNext();\n\n if (diagCode)\n addDiag(*diagCode, token.location()) << token.range();\n}\n\nvoid ParserBase::pushTokens(span<const Token> tokens) {\n window.insertHead(tokens);\n}\n\nToken ParserBase::missingToken(TokenKind kind, SourceLocation location) {\n return Token::createMissing(alloc, kind, location);\n}\n\nToken ParserBase::getLastConsumed() const {\n return window.lastConsumed;\n}\n\nvoid ParserBase::Window::addNew() {\n if (count >= capacity) {\n \/\/ shift tokens to the left if we are too far to the right\n uint32_t shift = count - currentOffset;\n if (currentOffset > (capacity >> 1)) {\n if (shift > 0)\n memmove(buffer, buffer + currentOffset, shift * sizeof(Token));\n }\n else {\n capacity *= 2;\n Token* newBuffer = new Token[capacity];\n memcpy(newBuffer, buffer + currentOffset, shift * sizeof(Token));\n\n delete[] buffer;\n buffer = newBuffer;\n }\n\n count -= currentOffset;\n currentOffset = 0;\n }\n\n buffer[count] = tokenSource.next();\n count++;\n}\n\nvoid ParserBase::Window::moveToNext() {\n lastConsumed = currentToken;\n currentToken = Token();\n currentOffset++;\n}\n\nvoid ParserBase::Window::insertHead(span<const Token> tokens) {\n if (currentOffset >= (uint32_t)tokens.size()) {\n currentOffset -= (uint32_t)tokens.size();\n memcpy(buffer + currentOffset, tokens.data(), tokens.size() * sizeof(Token));\n return;\n }\n\n uint32_t existing = count - currentOffset;\n ASSERT((uint32_t)tokens.size() + existing < capacity);\n\n memmove(buffer + tokens.size(), buffer + currentOffset, existing * sizeof(Token));\n memcpy(buffer, tokens.data(), tokens.size() * sizeof(Token));\n\n currentOffset = 0;\n count = (uint32_t)tokens.size() + existing;\n}\n\n} \/\/ namespace slang<commit_msg>Fix Clang warning<commit_after>\/\/------------------------------------------------------------------------------\n\/\/ ParserBase.cpp\n\/\/ Base class for parsing.\n\/\/\n\/\/ File is under the MIT license; see LICENSE for details.\n\/\/------------------------------------------------------------------------------\n#include \"slang\/parsing\/ParserBase.h\"\n\n#include \"slang\/parsing\/Preprocessor.h\"\n#include \"slang\/util\/BumpAllocator.h\"\n\nnamespace slang {\n\nParserBase::ParserBase(Preprocessor& preprocessor) :\n alloc(preprocessor.getAllocator()), window(preprocessor) {\n}\n\nvoid ParserBase::prependSkippedTokens(Token& token) {\n SmallVectorSized<Trivia, 8> buffer;\n buffer.append(Trivia{ TriviaKind::SkippedTokens, skippedTokens.copy(alloc) });\n buffer.appendRange(token.trivia());\n\n token = token.withTrivia(alloc, buffer.copy(alloc));\n skippedTokens.clear();\n}\n\nDiagnostics& ParserBase::getDiagnostics() {\n return window.tokenSource.getDiagnostics();\n}\n\nDiagnostic& ParserBase::addDiag(DiagCode code, SourceLocation location) {\n \/\/ If we issued this error in response to seeing an EOF token, back up and put\n \/\/ the error on the last consumed token instead.\n if (peek(TokenKind::EndOfFile) && peek().location() == location) {\n Token last = getLastConsumed();\n if (last)\n location = last.location() + last.rawText().size();\n }\n\n return getDiagnostics().add(code, location);\n}\n\nToken ParserBase::peek(uint32_t offset) {\n while (window.currentOffset + offset >= window.count)\n window.addNew();\n return window.buffer[window.currentOffset + offset];\n}\n\nToken ParserBase::peek() {\n if (!window.currentToken) {\n if (window.currentOffset >= window.count)\n window.addNew();\n window.currentToken = window.buffer[window.currentOffset];\n }\n ASSERT(window.currentToken);\n return window.currentToken;\n}\n\nbool ParserBase::peek(TokenKind kind) {\n return peek().kind == kind;\n}\n\nToken ParserBase::consume() {\n auto result = peek();\n window.moveToNext();\n if (!skippedTokens.empty())\n prependSkippedTokens(result);\n return result;\n}\n\nToken ParserBase::consumeIf(TokenKind kind) {\n if (peek(kind))\n return consume();\n return Token();\n}\n\nToken ParserBase::expect(TokenKind kind) {\n \/\/ keep this method small so that it gets inlined\n auto result = peek();\n if (result.kind != kind)\n result = Token::createExpected(alloc, getDiagnostics(), result, kind, window.lastConsumed);\n else\n window.moveToNext();\n\n if (!skippedTokens.empty())\n prependSkippedTokens(result);\n\n return result;\n}\n\nvoid ParserBase::skipToken(std::optional<DiagCode> diagCode) {\n auto token = peek();\n skippedTokens.append(token);\n window.moveToNext();\n\n if (diagCode)\n addDiag(*diagCode, token.location()) << token.range();\n}\n\nvoid ParserBase::pushTokens(span<const Token> tokens) {\n window.insertHead(tokens);\n}\n\nToken ParserBase::missingToken(TokenKind kind, SourceLocation location) {\n return Token::createMissing(alloc, kind, location);\n}\n\nToken ParserBase::getLastConsumed() const {\n return window.lastConsumed;\n}\n\nvoid ParserBase::Window::addNew() {\n if (count >= capacity) {\n \/\/ shift tokens to the left if we are too far to the right\n uint32_t shift = count - currentOffset;\n if (currentOffset > (capacity >> 1)) {\n if (shift > 0)\n memmove(buffer, buffer + currentOffset, shift * sizeof(Token));\n }\n else {\n capacity *= 2;\n Token* newBuffer = new Token[capacity];\n memcpy(newBuffer, buffer + currentOffset, shift * sizeof(Token));\n\n delete[] buffer;\n buffer = newBuffer;\n }\n\n count -= currentOffset;\n currentOffset = 0;\n }\n\n buffer[count] = tokenSource.next();\n count++;\n}\n\nvoid ParserBase::Window::moveToNext() {\n lastConsumed = currentToken;\n currentToken = Token();\n currentOffset++;\n}\n\nvoid ParserBase::Window::insertHead(span<const Token> tokens) {\n if (currentOffset >= (uint32_t)tokens.size()) {\n currentOffset -= (uint32_t)tokens.size();\n memcpy(buffer + currentOffset, tokens.data(), (uint32_t)tokens.size() * sizeof(Token));\n return;\n }\n\n uint32_t existing = count - currentOffset;\n ASSERT((uint32_t)tokens.size() + existing < capacity);\n\n memmove(buffer + tokens.size(), buffer + currentOffset, existing * sizeof(Token));\n memcpy(buffer, tokens.data(), (uint32_t)tokens.size() * sizeof(Token));\n\n currentOffset = 0;\n count = (uint32_t)tokens.size() + existing;\n}\n\n} \/\/ namespace slang<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n#define RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n\n#include <memory>\n#include <stdexcept>\n\n#include \"rcl\/types.h\"\n\n#include \"rclcpp\/allocator\/allocator_common.hpp\"\n#include \"rclcpp\/exceptions.hpp\"\n#include \"rclcpp\/macros.hpp\"\n#include \"rclcpp\/visibility_control.hpp\"\n\n#include \"rmw\/serialized_message.h\"\n\nnamespace rclcpp\n{\nnamespace message_memory_strategy\n{\n\n\/\/\/ Default allocation strategy for messages received by subscriptions.\n\/** A message memory strategy must be templated on the type of the subscription it belongs to. *\/\ntemplate<typename MessageT, typename Alloc = std::allocator<void>>\nclass MessageMemoryStrategy\n{\npublic:\n RCLCPP_SMART_PTR_DEFINITIONS(MessageMemoryStrategy)\n\n using MessageAllocTraits = allocator::AllocRebind<MessageT, Alloc>;\n using MessageAlloc = typename MessageAllocTraits::allocator_type;\n using MessageDeleter = allocator::Deleter<MessageAlloc, MessageT>;\n\n using SerializedMessageAllocTraits = allocator::AllocRebind<rcl_serialized_message_t, Alloc>;\n using SerializedMessageAlloc = typename SerializedMessageAllocTraits::allocator_type;\n using SerializedMessageDeleter =\n allocator::Deleter<SerializedMessageAlloc, rcl_serialized_message_t>;\n\n using BufferAllocTraits = allocator::AllocRebind<char, Alloc>;\n using BufferAlloc = typename BufferAllocTraits::allocator_type;\n using BufferDeleter = allocator::Deleter<BufferAlloc, char>;\n\n MessageMemoryStrategy()\n {\n message_allocator_ = std::make_shared<MessageAlloc>();\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>();\n buffer_allocator_ = std::make_shared<BufferAlloc>();\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n explicit MessageMemoryStrategy(std::shared_ptr<Alloc> allocator)\n {\n message_allocator_ = std::make_shared<MessageAlloc>(*allocator.get());\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>(*allocator.get());\n buffer_allocator_ = std::make_shared<BufferAlloc>(*allocator.get());\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n \/\/\/ Default factory method\n static SharedPtr create_default()\n {\n return std::make_shared<MessageMemoryStrategy<MessageT, Alloc>>(std::make_shared<Alloc>());\n }\n\n \/\/\/ By default, dynamically allocate a new message.\n \/** \\return Shared pointer to the new message. *\/\n virtual std::shared_ptr<MessageT> borrow_message()\n {\n return std::allocate_shared<MessageT, MessageAlloc>(*message_allocator_.get());\n }\n\n virtual std::shared_ptr<rcl_serialized_message_t> borrow_serialized_message(size_t capacity)\n {\n auto msg = new rcl_serialized_message_t;\n *msg = rmw_get_zero_initialized_serialized_message();\n auto ret = rmw_serialized_message_init(msg, capacity, &rcutils_allocator_);\n if (ret != RCL_RET_OK) {\n rclcpp::exceptions::throw_from_rcl_error(ret);\n }\n\n auto serialized_msg = std::shared_ptr<rcl_serialized_message_t>(msg,\n [](rmw_serialized_message_t * msg) {\n auto ret = rmw_serialized_message_fini(msg);\n delete msg;\n if (ret != RCL_RET_OK) {\n rclcpp::exceptions::throw_from_rcl_error(ret, \"leaking memory\");\n }\n });\n\n return serialized_msg;\n }\n\n virtual std::shared_ptr<rcl_serialized_message_t> borrow_serialized_message()\n {\n return borrow_serialized_message(default_buffer_capacity_);\n }\n\n virtual void set_default_buffer_capacity(size_t capacity)\n {\n default_buffer_capacity_ = capacity;\n }\n\n \/\/\/ Release ownership of the message, which will deallocate it if it has no more owners.\n \/** \\param[in] msg Shared pointer to the message we are returning. *\/\n virtual void return_message(std::shared_ptr<MessageT> & msg)\n {\n msg.reset();\n }\n\n virtual void return_serialized_message(std::shared_ptr<rcl_serialized_message_t> & serialized_msg)\n {\n serialized_msg.reset();\n }\n\n std::shared_ptr<MessageAlloc> message_allocator_;\n MessageDeleter message_deleter_;\n\n std::shared_ptr<SerializedMessageAlloc> serialized_message_allocator_;\n SerializedMessageDeleter serialized_message_deleter_;\n\n std::shared_ptr<BufferAlloc> buffer_allocator_;\n BufferDeleter buffer_deleter_;\n size_t default_buffer_capacity_ = 0;\n\n rcutils_allocator_t rcutils_allocator_;\n};\n\n} \/\/ namespace message_memory_strategy\n} \/\/ namespace rclcpp\n\n#endif \/\/ RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n<commit_msg>log error message instead of throwing exception in destructor (#535)<commit_after>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#ifndef RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n#define RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n\n#include <memory>\n#include <stdexcept>\n\n#include \"rcl\/types.h\"\n\n#include \"rclcpp\/allocator\/allocator_common.hpp\"\n#include \"rclcpp\/exceptions.hpp\"\n#include \"rclcpp\/macros.hpp\"\n#include \"rclcpp\/visibility_control.hpp\"\n\n#include \"rcutils\/logging_macros.h\"\n\n#include \"rmw\/serialized_message.h\"\n\nnamespace rclcpp\n{\nnamespace message_memory_strategy\n{\n\n\/\/\/ Default allocation strategy for messages received by subscriptions.\n\/** A message memory strategy must be templated on the type of the subscription it belongs to. *\/\ntemplate<typename MessageT, typename Alloc = std::allocator<void>>\nclass MessageMemoryStrategy\n{\npublic:\n RCLCPP_SMART_PTR_DEFINITIONS(MessageMemoryStrategy)\n\n using MessageAllocTraits = allocator::AllocRebind<MessageT, Alloc>;\n using MessageAlloc = typename MessageAllocTraits::allocator_type;\n using MessageDeleter = allocator::Deleter<MessageAlloc, MessageT>;\n\n using SerializedMessageAllocTraits = allocator::AllocRebind<rcl_serialized_message_t, Alloc>;\n using SerializedMessageAlloc = typename SerializedMessageAllocTraits::allocator_type;\n using SerializedMessageDeleter =\n allocator::Deleter<SerializedMessageAlloc, rcl_serialized_message_t>;\n\n using BufferAllocTraits = allocator::AllocRebind<char, Alloc>;\n using BufferAlloc = typename BufferAllocTraits::allocator_type;\n using BufferDeleter = allocator::Deleter<BufferAlloc, char>;\n\n MessageMemoryStrategy()\n {\n message_allocator_ = std::make_shared<MessageAlloc>();\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>();\n buffer_allocator_ = std::make_shared<BufferAlloc>();\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n explicit MessageMemoryStrategy(std::shared_ptr<Alloc> allocator)\n {\n message_allocator_ = std::make_shared<MessageAlloc>(*allocator.get());\n serialized_message_allocator_ = std::make_shared<SerializedMessageAlloc>(*allocator.get());\n buffer_allocator_ = std::make_shared<BufferAlloc>(*allocator.get());\n rcutils_allocator_ = allocator::get_rcl_allocator<char, BufferAlloc>(*buffer_allocator_.get());\n }\n\n \/\/\/ Default factory method\n static SharedPtr create_default()\n {\n return std::make_shared<MessageMemoryStrategy<MessageT, Alloc>>(std::make_shared<Alloc>());\n }\n\n \/\/\/ By default, dynamically allocate a new message.\n \/** \\return Shared pointer to the new message. *\/\n virtual std::shared_ptr<MessageT> borrow_message()\n {\n return std::allocate_shared<MessageT, MessageAlloc>(*message_allocator_.get());\n }\n\n virtual std::shared_ptr<rcl_serialized_message_t> borrow_serialized_message(size_t capacity)\n {\n auto msg = new rcl_serialized_message_t;\n *msg = rmw_get_zero_initialized_serialized_message();\n auto ret = rmw_serialized_message_init(msg, capacity, &rcutils_allocator_);\n if (ret != RCL_RET_OK) {\n rclcpp::exceptions::throw_from_rcl_error(ret);\n }\n\n auto serialized_msg = std::shared_ptr<rcl_serialized_message_t>(msg,\n [](rmw_serialized_message_t * msg) {\n auto ret = rmw_serialized_message_fini(msg);\n delete msg;\n if (ret != RCL_RET_OK) {\n RCUTILS_LOG_ERROR_NAMED(\n \"rclcpp\",\n \"failed to destroy serialized message: %s\", rcl_get_error_string_safe());\n }\n });\n\n return serialized_msg;\n }\n\n virtual std::shared_ptr<rcl_serialized_message_t> borrow_serialized_message()\n {\n return borrow_serialized_message(default_buffer_capacity_);\n }\n\n virtual void set_default_buffer_capacity(size_t capacity)\n {\n default_buffer_capacity_ = capacity;\n }\n\n \/\/\/ Release ownership of the message, which will deallocate it if it has no more owners.\n \/** \\param[in] msg Shared pointer to the message we are returning. *\/\n virtual void return_message(std::shared_ptr<MessageT> & msg)\n {\n msg.reset();\n }\n\n virtual void return_serialized_message(std::shared_ptr<rcl_serialized_message_t> & serialized_msg)\n {\n serialized_msg.reset();\n }\n\n std::shared_ptr<MessageAlloc> message_allocator_;\n MessageDeleter message_deleter_;\n\n std::shared_ptr<SerializedMessageAlloc> serialized_message_allocator_;\n SerializedMessageDeleter serialized_message_deleter_;\n\n std::shared_ptr<BufferAlloc> buffer_allocator_;\n BufferDeleter buffer_deleter_;\n size_t default_buffer_capacity_ = 0;\n\n rcutils_allocator_t rcutils_allocator_;\n};\n\n} \/\/ namespace message_memory_strategy\n} \/\/ namespace rclcpp\n\n#endif \/\/ RCLCPP__MESSAGE_MEMORY_STRATEGY_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include \"dataraptor.h\"\n#include \"routing.h\"\nnamespace navitia { namespace routing { namespace raptor {\n\nvoid dataRAPTOR::load(const type::PT_Data &data)\n{\n retour_constant.resize(data.route_points.size());\n retour_constant_reverse.resize(data.route_points.size());\n\n for(auto &r : retour_constant_reverse) {\n r.arrival = DateTime::min;\n r.departure = DateTime::min;\n }\n\n for(auto &r : retour_constant) {\n r.arrival = DateTime::inf;\n r.departure = DateTime::inf;\n }\n \n foot_path.clear();\n std::vector<list_connections> footpath_temp;\n footpath_temp.resize(data.route_points.size());\n\n \/\/Construction des connexions entre routepoints\n \/\/(sert pour les prolongements de service ainsi que les correpondances garanties\n for(type::RoutePointConnection rpc : data.route_point_connections) {\n footpath_rp_forward.insert(std::make_pair(rpc.departure_route_point_idx, rpc)); \n footpath_rp_backward.insert(std::make_pair(rpc.destination_route_point_idx, rpc));\n }\n\n \/\/Construction de la liste des marche à pied à partir des connexions renseignées\n for(type::Connection connection : data.connections) {\n footpath_temp[connection.departure_stop_point_idx][connection.destination_stop_point_idx] = connection;\n }\n\n for(type::Connection connection : data.connections) {\n if(footpath_temp[connection.destination_stop_point_idx].find(connection.departure_stop_point_idx) ==\n footpath_temp[connection.destination_stop_point_idx].end() ) {\n \n type::Connection inverse;\n inverse.duration = connection.duration;\n inverse.departure_stop_point_idx = connection.destination_stop_point_idx;\n inverse.destination_stop_point_idx = connection.departure_stop_point_idx;\n footpath_temp[inverse.departure_stop_point_idx][inverse.destination_stop_point_idx] = inverse;\n }\n }\n\n \/\/On rajoute des connexions entre les stops points d'un même stop area si elles n'existent pas\n footpath_index.resize(data.stop_points.size());\n footpath_index.resize(data.stop_points.size());\n for(type::StopPoint sp : data.stop_points) {\n type::StopArea sa = data.stop_areas[sp.stop_area_idx];\n footpath_index[sp.idx].first = foot_path.size();\n\n int size = 0;\n for(auto conn : footpath_temp[sp.idx]) {\n foot_path.push_back(conn.second);\n ++size;\n }\n\n\n for(type::idx_t spidx2 : sa.stop_point_list) {\n if(sp.idx != spidx2 && \n footpath_temp[sp.idx].find(spidx2) == footpath_temp[sp.idx].end()) {\n type::Connection c;\n c.departure_stop_point_idx = sp.idx;\n c.destination_stop_point_idx = spidx2;\n c.duration = 2 * 60;\n foot_path.push_back(c);\n ++size;\n }\n }\n footpath_index[sp.idx].second = size;\n }\n\n\n\n\n typedef std::unordered_map<navitia::type::idx_t, vector_idx> idx_vector_idx;\n idx_vector_idx ridx_route;\n \n arrival_times.clear();\n departure_times.clear();\n st_idx_forward.clear();\n st_idx_backward.clear();\n first_stop_time.clear();\n vp_idx_forward.clear();\n vp_idx_backward.clear();\n\n\n \/\/On recopie les validity patterns\n for(auto vp : data.validity_patterns) \n validity_patterns.push_back(vp.days);\n\n for(const type::Route & route : data.routes) {\n first_stop_time.push_back(arrival_times.size());\n nb_trips.push_back(route.vehicle_journey_list.size());\n for(unsigned int i=0; i < route.route_point_list.size(); ++i) {\n std::vector<type::idx_t> vec_stdix;\n for(type::idx_t vjidx : route.vehicle_journey_list) {\n vec_stdix.push_back(data.vehicle_journeys[vjidx].stop_time_list[i]);\n }\n std::sort(vec_stdix.begin(), vec_stdix.end(),\n [&](type::idx_t stidx1, type::idx_t stidx2)->bool{\n const type::StopTime & st1 = data.stop_times[stidx1];\n const type::StopTime & st2 = data.stop_times[stidx2];\n return (st1.departure_time % SECONDS_PER_DAY == st2.departure_time % SECONDS_PER_DAY && stidx1 < stidx2) ||\n (st1.departure_time % SECONDS_PER_DAY < st2.departure_time % SECONDS_PER_DAY);});\n \/\/\/Suppresion des montées interdites\n \/\/std::remove_if(vec_stdix.begin(), vec_stdix.end(), [&](type::idx_t &st){return !data.stop_times[st].pick_up_allowed();});\n st_idx_forward.insert(st_idx_forward.end(), vec_stdix.begin(), vec_stdix.end());\n\n for(auto stidx : vec_stdix) {\n const auto & st = data.stop_times[stidx];\n departure_times.push_back(st.departure_time % SECONDS_PER_DAY);\n if(st.departure_time > SECONDS_PER_DAY) {\n auto vp = data.validity_patterns[data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx].days;\n vp >>=1;\n auto it = std::find(validity_patterns.begin(), validity_patterns.end(), vp);\n if(it == validity_patterns.end()) {\n vp_idx_forward.push_back(validity_patterns.size());\n validity_patterns.push_back(vp);\n } else {\n vp_idx_forward.push_back(it - validity_patterns.begin());\n }\n } else {\n vp_idx_forward.push_back(data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx);\n }\n }\n\n std::sort(vec_stdix.begin(), vec_stdix.end(),\n [&](type::idx_t stidx1, type::idx_t stidx2)->bool{\n const type::StopTime & st1 = data.stop_times[stidx1];\n const type::StopTime & st2 = data.stop_times[stidx2];\n return (st1.arrival_time % SECONDS_PER_DAY == st2.arrival_time % SECONDS_PER_DAY && stidx1 > stidx2) ||\n (st1.arrival_time % SECONDS_PER_DAY > st2.arrival_time % SECONDS_PER_DAY);});\n \/\/\/Suppresion des descentes interdites\n \/\/std::remove_if(vec_stdix.begin(), vec_stdix.end(), [&](type::idx_t &st){return !data.stop_times[st].drop_off_allowed();});\n\n st_idx_backward.insert(st_idx_backward.end(), vec_stdix.begin(), vec_stdix.end());\n for(auto stidx : vec_stdix) {\n const auto & st = data.stop_times[stidx];\n arrival_times.push_back(st.arrival_time % SECONDS_PER_DAY);\n if(st.arrival_time > SECONDS_PER_DAY) {\n auto vp = data.validity_patterns[data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx].days;\n vp >>=1;;\n auto it = std::find(validity_patterns.begin(), validity_patterns.end(), vp);\n if(it == validity_patterns.end()) {\n vp_idx_backward.push_back(validity_patterns.size());\n validity_patterns.push_back(vp);\n } else {\n vp_idx_backward.push_back(it - validity_patterns.begin());\n }\n } else {\n vp_idx_backward.push_back(data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx);\n }\n }\n\n }\n }\n\n std::cout << \"Nb data stop times : \" << data.stop_times.size() << \" stopTimes : \" << arrival_times.size()\n << \" nb foot path : \" << foot_path.size() << \" Nombre de stop points : \" << data.stop_points.size() << \"nb vp : \" << data.validity_patterns.size() << std::endl;\n\n}\n\n\n }}}\n<commit_msg>dataraptor : Vérification de l'appartenance d'un stop point à un stop area lors de la construction des footpath<commit_after>#include \"dataraptor.h\"\n#include \"routing.h\"\nnamespace navitia { namespace routing { namespace raptor {\n\nvoid dataRAPTOR::load(const type::PT_Data &data)\n{\n retour_constant.resize(data.route_points.size());\n retour_constant_reverse.resize(data.route_points.size());\n\n for(auto &r : retour_constant_reverse) {\n r.arrival = DateTime::min;\n r.departure = DateTime::min;\n }\n\n for(auto &r : retour_constant) {\n r.arrival = DateTime::inf;\n r.departure = DateTime::inf;\n }\n \n foot_path.clear();\n std::vector<list_connections> footpath_temp;\n footpath_temp.resize(data.route_points.size());\n\n \/\/Construction des connexions entre routepoints\n \/\/(sert pour les prolongements de service ainsi que les correpondances garanties\n for(type::RoutePointConnection rpc : data.route_point_connections) {\n footpath_rp_forward.insert(std::make_pair(rpc.departure_route_point_idx, rpc)); \n footpath_rp_backward.insert(std::make_pair(rpc.destination_route_point_idx, rpc));\n }\n\n \/\/Construction de la liste des marche à pied à partir des connexions renseignées\n for(type::Connection connection : data.connections) {\n footpath_temp[connection.departure_stop_point_idx][connection.destination_stop_point_idx] = connection;\n }\n\n for(type::Connection connection : data.connections) {\n if(footpath_temp[connection.destination_stop_point_idx].find(connection.departure_stop_point_idx) ==\n footpath_temp[connection.destination_stop_point_idx].end() ) {\n \n type::Connection inverse;\n inverse.duration = connection.duration;\n inverse.departure_stop_point_idx = connection.destination_stop_point_idx;\n inverse.destination_stop_point_idx = connection.departure_stop_point_idx;\n footpath_temp[inverse.departure_stop_point_idx][inverse.destination_stop_point_idx] = inverse;\n }\n }\n\n \/\/On rajoute des connexions entre les stops points d'un même stop area si elles n'existent pas\n footpath_index.resize(data.stop_points.size());\n footpath_index.resize(data.stop_points.size());\n for(type::StopPoint sp : data.stop_points) {\n if(sp.stop_area_idx != type::invalid_idx) {\n type::StopArea sa = data.stop_areas[sp.stop_area_idx];\n footpath_index[sp.idx].first = foot_path.size();\n\n int size = 0;\n for(auto conn : footpath_temp[sp.idx]) {\n foot_path.push_back(conn.second);\n ++size;\n }\n\n\n for(type::idx_t spidx2 : sa.stop_point_list) {\n if(sp.idx != spidx2 &&\n footpath_temp[sp.idx].find(spidx2) == footpath_temp[sp.idx].end()) {\n type::Connection c;\n c.departure_stop_point_idx = sp.idx;\n c.destination_stop_point_idx = spidx2;\n c.duration = 2 * 60;\n foot_path.push_back(c);\n ++size;\n }\n }\n footpath_index[sp.idx].second = size;\n }\n }\n\n\n\n\n typedef std::unordered_map<navitia::type::idx_t, vector_idx> idx_vector_idx;\n idx_vector_idx ridx_route;\n \n arrival_times.clear();\n departure_times.clear();\n st_idx_forward.clear();\n st_idx_backward.clear();\n first_stop_time.clear();\n vp_idx_forward.clear();\n vp_idx_backward.clear();\n\n\n \/\/On recopie les validity patterns\n for(auto vp : data.validity_patterns) \n validity_patterns.push_back(vp.days);\n\n for(const type::Route & route : data.routes) {\n first_stop_time.push_back(arrival_times.size());\n nb_trips.push_back(route.vehicle_journey_list.size());\n for(unsigned int i=0; i < route.route_point_list.size(); ++i) {\n std::vector<type::idx_t> vec_stdix;\n for(type::idx_t vjidx : route.vehicle_journey_list) {\n vec_stdix.push_back(data.vehicle_journeys[vjidx].stop_time_list[i]);\n }\n std::sort(vec_stdix.begin(), vec_stdix.end(),\n [&](type::idx_t stidx1, type::idx_t stidx2)->bool{\n const type::StopTime & st1 = data.stop_times[stidx1];\n const type::StopTime & st2 = data.stop_times[stidx2];\n return (st1.departure_time % SECONDS_PER_DAY == st2.departure_time % SECONDS_PER_DAY && stidx1 < stidx2) ||\n (st1.departure_time % SECONDS_PER_DAY < st2.departure_time % SECONDS_PER_DAY);});\n \/\/\/Suppresion des montées interdites\n \/\/std::remove_if(vec_stdix.begin(), vec_stdix.end(), [&](type::idx_t &st){return !data.stop_times[st].pick_up_allowed();});\n st_idx_forward.insert(st_idx_forward.end(), vec_stdix.begin(), vec_stdix.end());\n\n for(auto stidx : vec_stdix) {\n const auto & st = data.stop_times[stidx];\n departure_times.push_back(st.departure_time % SECONDS_PER_DAY);\n if(st.departure_time > SECONDS_PER_DAY) {\n auto vp = data.validity_patterns[data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx].days;\n vp >>=1;\n auto it = std::find(validity_patterns.begin(), validity_patterns.end(), vp);\n if(it == validity_patterns.end()) {\n vp_idx_forward.push_back(validity_patterns.size());\n validity_patterns.push_back(vp);\n } else {\n vp_idx_forward.push_back(it - validity_patterns.begin());\n }\n } else {\n vp_idx_forward.push_back(data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx);\n }\n }\n\n std::sort(vec_stdix.begin(), vec_stdix.end(),\n [&](type::idx_t stidx1, type::idx_t stidx2)->bool{\n const type::StopTime & st1 = data.stop_times[stidx1];\n const type::StopTime & st2 = data.stop_times[stidx2];\n return (st1.arrival_time % SECONDS_PER_DAY == st2.arrival_time % SECONDS_PER_DAY && stidx1 > stidx2) ||\n (st1.arrival_time % SECONDS_PER_DAY > st2.arrival_time % SECONDS_PER_DAY);});\n \/\/\/Suppresion des descentes interdites\n \/\/std::remove_if(vec_stdix.begin(), vec_stdix.end(), [&](type::idx_t &st){return !data.stop_times[st].drop_off_allowed();});\n\n st_idx_backward.insert(st_idx_backward.end(), vec_stdix.begin(), vec_stdix.end());\n for(auto stidx : vec_stdix) {\n const auto & st = data.stop_times[stidx];\n arrival_times.push_back(st.arrival_time % SECONDS_PER_DAY);\n if(st.arrival_time > SECONDS_PER_DAY) {\n auto vp = data.validity_patterns[data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx].days;\n vp >>=1;;\n auto it = std::find(validity_patterns.begin(), validity_patterns.end(), vp);\n if(it == validity_patterns.end()) {\n vp_idx_backward.push_back(validity_patterns.size());\n validity_patterns.push_back(vp);\n } else {\n vp_idx_backward.push_back(it - validity_patterns.begin());\n }\n } else {\n vp_idx_backward.push_back(data.vehicle_journeys[st.vehicle_journey_idx].validity_pattern_idx);\n }\n }\n\n }\n }\n\n std::cout << \"Nb data stop times : \" << data.stop_times.size() << \" stopTimes : \" << arrival_times.size()\n << \" nb foot path : \" << foot_path.size() << \" Nombre de stop points : \" << data.stop_points.size() << \"nb vp : \" << data.validity_patterns.size() << std::endl;\n\n}\n\n\n }}}\n<|endoftext|>"} {"text":"<commit_before>\n#if defined(WIN32) && !defined(_DEBUG)\n#pragma comment(linker, \"\/SUBSYSTEM:WINDOWS \/entry:mainCRTStartup\")\n#endif\n\n\n#include \"Application.h\"\n\n#include <memory>\n\n#include <gloperate-qtapplication\/Viewer.h>\n\n\nint main(int argc, char * argv[])\n{\n Application app(argc, argv);\n\n std::unique_ptr<gloperate_qtapplication::Viewer> viewer(new gloperate_qtapplication::Viewer()); \/\/ make_unique is C++14\n viewer->show();\n\n return app.exec();\n}\n<commit_msg>Use dark theme in cgwhite<commit_after>\n#if defined(WIN32) && !defined(_DEBUG)\n#pragma comment(linker, \"\/SUBSYSTEM:WINDOWS \/entry:mainCRTStartup\")\n#endif\n\n\n#include \"Application.h\"\n\n#include <memory>\n\n#include <gloperate-qtapplication\/Viewer.h>\n\n#include <widgetzeug\/dark_fusion_style.hpp>\n\n\nint main(int argc, char * argv[])\n{\n Application app(argc, argv);\n\n widgetzeug::enableDarkFusionStyle();\n\n std::unique_ptr<gloperate_qtapplication::Viewer> viewer(new gloperate_qtapplication::Viewer()); \/\/ make_unique is C++14\n viewer->show();\n\n return app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/grid\/view\/subdomain\/part.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/assembler\/boundary.hh>\n#include <dune\/gdt\/assembler\/coupling.hh>\n#include <dune\/gdt\/playground\/spaces\/block.hh>\n#include <dune\/gdt\/local\/integrands\/elliptic-ipdg.hh>\n#include <dune\/gdt\/local\/functionals\/integrals.hh>\n#include <dune\/gdt\/local\/operators\/integrals.hh>\n\n#include \"..\/problems\/base.hh\"\n#include \"base.hh\"\n#include \"ipdg.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\todo add pattern() to StationaryContainerBasedDefaultDiscretization, avoid computation of local_pattern below\n *\/\ntemplate <class GridType,\n ChooseSpaceBackend spacebackend = ChooseSpaceBackend::fem, \/\/ we only have local grid parts atm\n XT::LA::Backends la = XT::LA::default_sparse_backend,\n int pol = 1,\n class RangeFieldType = double,\n size_t dimRange = 1,\n LocalEllipticIpdgIntegrands::Method local_method = LocalEllipticIpdgIntegrands::default_method,\n LocalEllipticIpdgIntegrands::Method coupling_method = LocalEllipticIpdgIntegrands::default_method>\nclass BlockIpdgDiscretizer\n{\n typedef IpdgDiscretizer<GridType,\n XT::Grid::Layers::dd_subdomain,\n spacebackend,\n la,\n pol,\n RangeFieldType,\n dimRange,\n local_method>\n LocalDiscretizer;\n typedef typename LocalDiscretizer::DiscretizationType LocalDiscretizationType;\n typedef typename LocalDiscretizer::SpaceType LocalSpaceType;\n\npublic:\n typedef typename LocalDiscretizer::ProblemType ProblemType;\n typedef BlockSpace<LocalSpaceType> SpaceType;\n typedef typename LocalDiscretizer::MatrixType MatrixType;\n typedef typename LocalDiscretizer::VectorType VectorType;\n typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n DiscretizationType;\n static const constexpr ChooseDiscretizer type = ChooseDiscretizer::block_ipdg;\n static const constexpr XT::LA::Backends la_backend = la;\n static const int polOrder = pol;\n\n static std::string static_id()\n {\n return std::string(\"gdt.linearelliptic.discretization.block-ipdg.order_\")\n + Dune::XT::Common::to_string(int(polOrder)); \/\/ int() needed, otherwise we get a linker error\n }\n\n static DiscretizationType\n discretize(XT::Grid::GridProvider<GridType, XT::Grid::DD::SubdomainGrid<GridType>>& grid_provider,\n const ProblemType& problem,\n const int \/*level*\/ = 0,\n const size_t inner_boundary_index = std::numeric_limits<size_t>::max() - 42)\n {\n auto logger = XT::Common::TimedLogger().get(static_id());\n const auto& dd_grid = grid_provider.dd_grid();\n logger.info() << \"Creating \" << dd_grid.size() << \" local discretizations... \" << std::endl;\n XT::Common::Configuration local_boundary_cfg;\n local_boundary_cfg[\"type\"] = \"xt.grid.boundaryinfo.boundarysegment\";\n local_boundary_cfg[\"default\"] = \"dirichlet\";\n local_boundary_cfg[\"neumann\"] =\n \"[\" + XT::Common::to_string(inner_boundary_index) + \" \" + XT::Common::to_string(inner_boundary_index + 1) + \"]\";\n LinearElliptic::ProblemBase<typename GridType::template Codim<0>::Entity,\n typename GridType::ctype,\n GridType::dimension,\n typename SpaceType::RangeFieldType,\n 1>\n local_problem(problem.diffusion_factor(),\n problem.diffusion_tensor(),\n problem.force(),\n problem.dirichlet(),\n problem.neumann(),\n XT::Common::Configuration(),\n local_boundary_cfg);\n std::vector<LocalDiscretizationType> local_discretizations;\n std::vector<LocalSpaceType> local_spaces;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n local_discretizations.emplace_back(\n LocalDiscretizer::discretize(grid_provider, local_problem, boost::numeric_cast<int>(ss)));\n local_spaces.emplace_back(local_discretizations.back().test_space());\n }\n logger.info() << \"Creating space... \" << std::endl;\n SpaceType space(dd_grid, std::move(local_spaces));\n\n logger.info() << \"Preparing container...\" << std::endl;\n std::vector<XT::LA::SparsityPatternDefault> local_patterns(dd_grid.size());\n std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> inside_outside_patterns(dd_grid.size());\n std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> outside_inside_patterns(dd_grid.size());\n std::map<size_t, XT::LA::SparsityPatternDefault> boundary_patterns;\n XT::LA::SparsityPatternDefault pattern(space.mapper().size());\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n local_patterns[ss] = local_spaces[ss].compute_face_and_volume_pattern(); \/\/ todo: from the local discretization\n copy_local_to_global(local_patterns[ss], space, ss, ss, pattern);\n if (dd_grid.boundary(ss)) {\n \/\/ in general, this can differ from the local one (think of CG)\n boundary_patterns[ss] = local_spaces[ss].compute_face_pattern(dd_grid.boundaryGridPart(ss));\n copy_local_to_global(boundary_patterns[ss], space, ss, ss, pattern);\n }\n for (auto&& nn : dd_grid.neighborsOf(ss)) {\n if (ss < nn) { \/\/ each coupling only once\n inside_outside_patterns[ss][nn] =\n local_spaces[ss].compute_face_pattern(dd_grid.couplingGridPart(ss, nn), local_spaces[nn]);\n copy_local_to_global(inside_outside_patterns[ss][nn], space, ss, nn, pattern);\n outside_inside_patterns[nn][ss] =\n local_spaces[nn].compute_face_pattern(dd_grid.couplingGridPart(nn, ss), local_spaces[ss]);\n copy_local_to_global(outside_inside_patterns[nn][ss], space, nn, ss, pattern);\n }\n }\n }\n pattern.sort();\n MatrixType system_matrix(space.mapper().size(), space.mapper().size(), pattern);\n VectorType rhs_vector(space.mapper().size());\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n copy_local_to_global(local_discretizations[ss].system_matrix(), local_patterns[ss], space, ss, ss, system_matrix);\n copy_local_to_global(local_discretizations[ss].rhs_vector(), space, ss, rhs_vector);\n }\n\n logger.info() << \"Assembling coupling contributions...\" << std::endl;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n for (auto&& nn : dd_grid.neighborsOf(ss)) {\n if (ss < nn) { \/\/ each coupling only once\n MatrixType inside_inside_matrix(\n local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), local_patterns[ss]);\n MatrixType outside_outside_matrix(\n local_spaces[nn].mapper().size(), local_spaces[nn].mapper().size(), local_patterns[nn]);\n MatrixType inside_outside_matrix(\n local_spaces[ss].mapper().size(), local_spaces[nn].mapper().size(), inside_outside_patterns[ss][nn]);\n MatrixType outside_inside_matrix(\n local_spaces[nn].mapper().size(), local_spaces[ss].mapper().size(), outside_inside_patterns[nn][ss]);\n auto coupling_grid_part = dd_grid.couplingGridPart(ss, nn);\n \/\/ put all of this into a coupling operator\n CouplingAssembler<LocalSpaceType, decltype(coupling_grid_part)> coupling_assembler(\n coupling_grid_part, local_spaces[ss], local_spaces[ss], local_spaces[nn], local_spaces[nn]);\n typedef LocalEllipticIpdgIntegrands::Inner<typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n CouplingIntegrandType;\n LocalCouplingIntegralOperator<CouplingIntegrandType> local_coupling_operator(problem.diffusion_factor(),\n problem.diffusion_tensor());\n LocalCouplingTwoFormAssembler<LocalCouplingIntegralOperator<CouplingIntegrandType>> local_coupling_assembler(\n local_coupling_operator);\n coupling_assembler.append(local_coupling_assembler,\n inside_inside_matrix,\n outside_outside_matrix,\n inside_outside_matrix,\n outside_inside_matrix);\n coupling_assembler.assemble();\n copy_local_to_global(inside_inside_matrix, local_patterns[ss], space, ss, ss, system_matrix);\n copy_local_to_global(outside_outside_matrix, local_patterns[nn], space, nn, nn, system_matrix);\n copy_local_to_global(inside_outside_matrix, inside_outside_patterns[ss][nn], space, ss, nn, system_matrix);\n copy_local_to_global(outside_inside_matrix, outside_inside_patterns[nn][ss], space, nn, ss, system_matrix);\n }\n }\n }\n\n logger.info() << \"Assembling boundary contributions...\" << std::endl;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n if (dd_grid.boundary(ss)) {\n auto boundary_grid_part = dd_grid.boundaryGridPart(ss);\n auto boundary_pattern = local_spaces[ss].compute_face_and_volume_pattern(boundary_grid_part);\n MatrixType boundary_matrix(\n local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), boundary_pattern);\n VectorType boundary_vector(local_spaces[ss].mapper().size());\n BoundaryAssembler<LocalSpaceType, decltype(boundary_grid_part)> boundary_assembler(\n boundary_grid_part, local_spaces[ss], local_spaces[ss]);\n auto boundary_info =\n XT::Grid::BoundaryInfoFactory<typename decltype(boundary_grid_part)::IntersectionType>::create(\n problem.boundary_info_cfg());\n typedef LocalEllipticIpdgIntegrands::BoundaryLHS<typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n BoundaryLhsIntegrandType;\n LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType> local_boundary_operator(problem.diffusion_factor(),\n problem.diffusion_tensor());\n LocalBoundaryTwoFormAssembler<LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType>>\n local_boundary_operator_assembler(local_boundary_operator);\n boundary_assembler.append(\n local_boundary_operator_assembler,\n boundary_matrix,\n new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n typedef LocalEllipticIpdgIntegrands::BoundaryRHS<typename ProblemType::FunctionType,\n typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n BoundaryRhsIntegrandType;\n LocalFaceIntegralFunctional<BoundaryRhsIntegrandType> local_boundary_functional(\n problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor());\n LocalFaceFunctionalAssembler<LocalFaceIntegralFunctional<BoundaryRhsIntegrandType>>\n local_boundary_functional_assembler(local_boundary_functional);\n boundary_assembler.append(\n local_boundary_functional_assembler,\n boundary_vector,\n new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n boundary_assembler.assemble();\n copy_local_to_global(boundary_matrix, boundary_pattern, space, ss, ss, system_matrix);\n copy_local_to_global(boundary_vector, space, ss, rhs_vector);\n }\n }\n\n \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n return DiscretizationType(problem, space, system_matrix, rhs_vector);\n } \/\/ ... discretize(...)\n\nprivate:\n static void copy_local_to_global(const XT::LA::SparsityPatternDefault& local_pattern,\n const SpaceType& space,\n const size_t test_subdomain,\n const size_t ansatz_subdomain,\n XT::LA::SparsityPatternDefault& global_pattern)\n {\n const auto& mapper = space.mapper();\n for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n const size_t global_ii = mapper.mapToGlobal(test_subdomain, local_ii);\n const auto& local_rows = local_pattern.inner(local_ii);\n for (const auto& local_jj : local_rows) {\n const size_t global_jj = mapper.mapToGlobal(ansatz_subdomain, local_jj);\n global_pattern.insert(global_ii, global_jj);\n }\n }\n } \/\/ ... copy_local_to_global(...)\n\n static void copy_local_to_global(const MatrixType& local_matrix,\n const XT::LA::SparsityPatternDefault& local_pattern,\n const SpaceType& space,\n const size_t test_subdomain,\n const size_t ansatz_subdomain,\n MatrixType& global_matrix)\n {\n for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n const size_t global_ii = space.mapper().mapToGlobal(test_subdomain, local_ii);\n for (const size_t& local_jj : local_pattern.inner(local_ii)) {\n const size_t global_jj = space.mapper().mapToGlobal(ansatz_subdomain, local_jj);\n global_matrix.add_to_entry(global_ii, global_jj, local_matrix.get_entry(local_ii, local_jj));\n }\n }\n } \/\/ ... copy_local_to_global_matrix(...)\n\n static void copy_local_to_global(const VectorType& local_vector,\n const SpaceType& space,\n const size_t subdomain,\n VectorType& global_vector)\n {\n for (size_t local_ii = 0; local_ii < local_vector.size(); ++local_ii) {\n const size_t global_ii = space.mapper().mapToGlobal(subdomain, local_ii);\n global_vector.add_to_entry(global_ii, local_vector.get_entry(local_ii));\n }\n } \/\/ ... copy_local_to_global_matrix(...)\n}; \/\/ class BlockIpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n<commit_msg>[test.linearelliptic.block-ipdg] update memory management<commit_after>#ifndef DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n#define DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n\n#include <dune\/xt\/common\/timedlogging.hh>\n#include <dune\/xt\/common\/memory.hh>\n#include <dune\/xt\/grid\/boundaryinfo.hh>\n#include <dune\/xt\/grid\/layers.hh>\n#include <dune\/xt\/grid\/gridprovider.hh>\n#include <dune\/xt\/grid\/view\/subdomain\/part.hh>\n#include <dune\/xt\/la\/container.hh>\n\n#include <dune\/gdt\/assembler\/boundary.hh>\n#include <dune\/gdt\/assembler\/coupling.hh>\n#include <dune\/gdt\/playground\/spaces\/block.hh>\n#include <dune\/gdt\/local\/integrands\/elliptic-ipdg.hh>\n#include <dune\/gdt\/local\/functionals\/integrals.hh>\n#include <dune\/gdt\/local\/operators\/integrals.hh>\n\n#include \"..\/problems\/base.hh\"\n#include \"base.hh\"\n#include \"ipdg.hh\"\n\nnamespace Dune {\nnamespace GDT {\nnamespace LinearElliptic {\n\n\n\/**\n * \\todo add pattern() to StationaryContainerBasedDefaultDiscretization, avoid computation of local_pattern below\n *\/\ntemplate <class GridType,\n ChooseSpaceBackend spacebackend = ChooseSpaceBackend::fem, \/\/ we only have local grid parts atm\n XT::LA::Backends la = XT::LA::default_sparse_backend,\n int pol = 1,\n class RangeFieldType = double,\n size_t dimRange = 1,\n LocalEllipticIpdgIntegrands::Method local_method = LocalEllipticIpdgIntegrands::default_method,\n LocalEllipticIpdgIntegrands::Method coupling_method = LocalEllipticIpdgIntegrands::default_method>\nclass BlockIpdgDiscretizer\n{\n typedef IpdgDiscretizer<GridType,\n XT::Grid::Layers::dd_subdomain,\n spacebackend,\n la,\n pol,\n RangeFieldType,\n dimRange,\n local_method>\n LocalDiscretizer;\n typedef typename LocalDiscretizer::DiscretizationType LocalDiscretizationType;\n typedef typename LocalDiscretizer::SpaceType LocalSpaceType;\n\npublic:\n typedef typename LocalDiscretizer::ProblemType ProblemType;\n typedef BlockSpace<LocalSpaceType> SpaceType;\n typedef typename LocalDiscretizer::MatrixType MatrixType;\n typedef typename LocalDiscretizer::VectorType VectorType;\n typedef StationaryContainerBasedDefaultDiscretization<ProblemType, SpaceType, MatrixType, VectorType, SpaceType>\n DiscretizationType;\n static const constexpr ChooseDiscretizer type = ChooseDiscretizer::block_ipdg;\n static const constexpr XT::LA::Backends la_backend = la;\n static const int polOrder = pol;\n\n static std::string static_id()\n {\n return std::string(\"gdt.linearelliptic.discretization.block-ipdg.order_\")\n + Dune::XT::Common::to_string(int(polOrder)); \/\/ int() needed, otherwise we get a linker error\n }\n\n static DiscretizationType\n discretize(XT::Grid::GridProvider<GridType, XT::Grid::DD::SubdomainGrid<GridType>>& grid_provider,\n const ProblemType& problem,\n const int \/*level*\/ = 0,\n const size_t inner_boundary_index = std::numeric_limits<size_t>::max() - 42)\n {\n auto logger = XT::Common::TimedLogger().get(static_id());\n const auto& dd_grid = grid_provider.dd_grid();\n logger.info() << \"Creating \" << dd_grid.size() << \" local discretizations... \" << std::endl;\n XT::Common::Configuration local_boundary_cfg;\n local_boundary_cfg[\"type\"] = \"xt.grid.boundaryinfo.boundarysegment\";\n local_boundary_cfg[\"default\"] = \"dirichlet\";\n local_boundary_cfg[\"neumann\"] =\n \"[\" + XT::Common::to_string(inner_boundary_index) + \" \" + XT::Common::to_string(inner_boundary_index + 1) + \"]\";\n LinearElliptic::ProblemBase<typename GridType::template Codim<0>::Entity,\n typename GridType::ctype,\n GridType::dimension,\n typename SpaceType::RangeFieldType,\n 1>\n local_problem(problem.diffusion_factor(),\n problem.diffusion_tensor(),\n problem.force(),\n problem.dirichlet(),\n problem.neumann(),\n XT::Common::Configuration(),\n local_boundary_cfg);\n std::vector<LocalDiscretizationType> local_discretizations;\n auto local_spaces_ptr = std::make_shared<std::vector<LocalSpaceType>>();\n auto& local_spaces = *local_spaces_ptr;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n local_discretizations.emplace_back(\n LocalDiscretizer::discretize(grid_provider, local_problem, boost::numeric_cast<int>(ss)));\n local_spaces.emplace_back(local_discretizations.back().test_space());\n }\n logger.info() << \"Creating space... \" << std::endl;\n SpaceType space(dd_grid, local_spaces_ptr);\n\n logger.info() << \"Preparing container...\" << std::endl;\n std::vector<XT::LA::SparsityPatternDefault> local_patterns(dd_grid.size());\n std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> inside_outside_patterns(dd_grid.size());\n std::vector<std::map<size_t, XT::LA::SparsityPatternDefault>> outside_inside_patterns(dd_grid.size());\n std::map<size_t, XT::LA::SparsityPatternDefault> boundary_patterns;\n XT::LA::SparsityPatternDefault pattern(space.mapper().size());\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n local_patterns[ss] = local_spaces[ss].compute_face_and_volume_pattern(); \/\/ todo: from the local discretization\n copy_local_to_global(local_patterns[ss], space, ss, ss, pattern);\n if (dd_grid.boundary(ss)) {\n \/\/ in general, this can differ from the local one (think of CG)\n boundary_patterns[ss] = local_spaces[ss].compute_face_pattern(dd_grid.boundaryGridPart(ss));\n copy_local_to_global(boundary_patterns[ss], space, ss, ss, pattern);\n }\n for (auto&& nn : dd_grid.neighborsOf(ss)) {\n if (ss < nn) { \/\/ each coupling only once\n inside_outside_patterns[ss][nn] =\n local_spaces[ss].compute_face_pattern(dd_grid.couplingGridPart(ss, nn), local_spaces[nn]);\n copy_local_to_global(inside_outside_patterns[ss][nn], space, ss, nn, pattern);\n outside_inside_patterns[nn][ss] =\n local_spaces[nn].compute_face_pattern(dd_grid.couplingGridPart(nn, ss), local_spaces[ss]);\n copy_local_to_global(outside_inside_patterns[nn][ss], space, nn, ss, pattern);\n }\n }\n }\n pattern.sort();\n MatrixType system_matrix(space.mapper().size(), space.mapper().size(), pattern);\n VectorType rhs_vector(space.mapper().size());\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n copy_local_to_global(local_discretizations[ss].system_matrix(), local_patterns[ss], space, ss, ss, system_matrix);\n copy_local_to_global(local_discretizations[ss].rhs_vector(), space, ss, rhs_vector);\n }\n\n logger.info() << \"Assembling coupling contributions...\" << std::endl;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n for (auto&& nn : dd_grid.neighborsOf(ss)) {\n if (ss < nn) { \/\/ each coupling only once\n MatrixType inside_inside_matrix(\n local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), local_patterns[ss]);\n MatrixType outside_outside_matrix(\n local_spaces[nn].mapper().size(), local_spaces[nn].mapper().size(), local_patterns[nn]);\n MatrixType inside_outside_matrix(\n local_spaces[ss].mapper().size(), local_spaces[nn].mapper().size(), inside_outside_patterns[ss][nn]);\n MatrixType outside_inside_matrix(\n local_spaces[nn].mapper().size(), local_spaces[ss].mapper().size(), outside_inside_patterns[nn][ss]);\n auto coupling_grid_part = dd_grid.couplingGridPart(ss, nn);\n \/\/ put all of this into a coupling operator\n CouplingAssembler<LocalSpaceType, decltype(coupling_grid_part)> coupling_assembler(\n coupling_grid_part, local_spaces[ss], local_spaces[ss], local_spaces[nn], local_spaces[nn]);\n typedef LocalEllipticIpdgIntegrands::Inner<typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n CouplingIntegrandType;\n LocalCouplingIntegralOperator<CouplingIntegrandType> local_coupling_operator(problem.diffusion_factor(),\n problem.diffusion_tensor());\n LocalCouplingTwoFormAssembler<LocalCouplingIntegralOperator<CouplingIntegrandType>> local_coupling_assembler(\n local_coupling_operator);\n coupling_assembler.append(local_coupling_assembler,\n inside_inside_matrix,\n outside_outside_matrix,\n inside_outside_matrix,\n outside_inside_matrix);\n coupling_assembler.assemble();\n copy_local_to_global(inside_inside_matrix, local_patterns[ss], space, ss, ss, system_matrix);\n copy_local_to_global(outside_outside_matrix, local_patterns[nn], space, nn, nn, system_matrix);\n copy_local_to_global(inside_outside_matrix, inside_outside_patterns[ss][nn], space, ss, nn, system_matrix);\n copy_local_to_global(outside_inside_matrix, outside_inside_patterns[nn][ss], space, nn, ss, system_matrix);\n }\n }\n }\n\n logger.info() << \"Assembling boundary contributions...\" << std::endl;\n for (size_t ss = 0; ss < dd_grid.size(); ++ss) {\n if (dd_grid.boundary(ss)) {\n auto boundary_grid_part = dd_grid.boundaryGridPart(ss);\n auto boundary_pattern = local_spaces[ss].compute_face_and_volume_pattern(boundary_grid_part);\n MatrixType boundary_matrix(\n local_spaces[ss].mapper().size(), local_spaces[ss].mapper().size(), boundary_pattern);\n VectorType boundary_vector(local_spaces[ss].mapper().size());\n BoundaryAssembler<LocalSpaceType, decltype(boundary_grid_part)> boundary_assembler(\n boundary_grid_part, local_spaces[ss], local_spaces[ss]);\n auto boundary_info =\n XT::Grid::BoundaryInfoFactory<typename decltype(boundary_grid_part)::IntersectionType>::create(\n problem.boundary_info_cfg());\n typedef LocalEllipticIpdgIntegrands::BoundaryLHS<typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n BoundaryLhsIntegrandType;\n LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType> local_boundary_operator(problem.diffusion_factor(),\n problem.diffusion_tensor());\n LocalBoundaryTwoFormAssembler<LocalBoundaryIntegralOperator<BoundaryLhsIntegrandType>>\n local_boundary_operator_assembler(local_boundary_operator);\n boundary_assembler.append(\n local_boundary_operator_assembler,\n boundary_matrix,\n new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n typedef LocalEllipticIpdgIntegrands::BoundaryRHS<typename ProblemType::FunctionType,\n typename ProblemType::DiffusionFactorType,\n typename ProblemType::DiffusionTensorType,\n coupling_method>\n BoundaryRhsIntegrandType;\n LocalFaceIntegralFunctional<BoundaryRhsIntegrandType> local_boundary_functional(\n problem.dirichlet(), problem.diffusion_factor(), problem.diffusion_tensor());\n LocalFaceFunctionalAssembler<LocalFaceIntegralFunctional<BoundaryRhsIntegrandType>>\n local_boundary_functional_assembler(local_boundary_functional);\n boundary_assembler.append(\n local_boundary_functional_assembler,\n boundary_vector,\n new XT::Grid::ApplyOn::DirichletIntersections<decltype(boundary_grid_part)>(*boundary_info));\n boundary_assembler.assemble();\n copy_local_to_global(boundary_matrix, boundary_pattern, space, ss, ss, system_matrix);\n copy_local_to_global(boundary_vector, space, ss, rhs_vector);\n }\n }\n\n \/\/ create the discretization (no copy of the containers done here, bc. of cow)\n return DiscretizationType(problem, space, system_matrix, rhs_vector);\n } \/\/ ... discretize(...)\n\nprivate:\n static void copy_local_to_global(const XT::LA::SparsityPatternDefault& local_pattern,\n const SpaceType& space,\n const size_t test_subdomain,\n const size_t ansatz_subdomain,\n XT::LA::SparsityPatternDefault& global_pattern)\n {\n const auto& mapper = space.mapper();\n for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n const size_t global_ii = mapper.mapToGlobal(test_subdomain, local_ii);\n const auto& local_rows = local_pattern.inner(local_ii);\n for (const auto& local_jj : local_rows) {\n const size_t global_jj = mapper.mapToGlobal(ansatz_subdomain, local_jj);\n global_pattern.insert(global_ii, global_jj);\n }\n }\n } \/\/ ... copy_local_to_global(...)\n\n static void copy_local_to_global(const MatrixType& local_matrix,\n const XT::LA::SparsityPatternDefault& local_pattern,\n const SpaceType& space,\n const size_t test_subdomain,\n const size_t ansatz_subdomain,\n MatrixType& global_matrix)\n {\n for (size_t local_ii = 0; local_ii < local_pattern.size(); ++local_ii) {\n const size_t global_ii = space.mapper().mapToGlobal(test_subdomain, local_ii);\n for (const size_t& local_jj : local_pattern.inner(local_ii)) {\n const size_t global_jj = space.mapper().mapToGlobal(ansatz_subdomain, local_jj);\n global_matrix.add_to_entry(global_ii, global_jj, local_matrix.get_entry(local_ii, local_jj));\n }\n }\n } \/\/ ... copy_local_to_global_matrix(...)\n\n static void copy_local_to_global(const VectorType& local_vector,\n const SpaceType& space,\n const size_t subdomain,\n VectorType& global_vector)\n {\n for (size_t local_ii = 0; local_ii < local_vector.size(); ++local_ii) {\n const size_t global_ii = space.mapper().mapToGlobal(subdomain, local_ii);\n global_vector.add_to_entry(global_ii, local_vector.get_entry(local_ii));\n }\n } \/\/ ... copy_local_to_global_matrix(...)\n}; \/\/ class BlockIpdgDiscretizer\n\n\n} \/\/ namespace LinearElliptic\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_TESTS_LINEARELLIPTIC_DISCRETIZERS_BLOCK_IPDG_HH\n<|endoftext|>"} {"text":"<commit_before><commit_msg>remove old filesystem<commit_after><|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n#include \"main.h\"\n#include \"uplink.h\"\n#include \"usonic.h\"\n\nextern \"C\" {\n #include \"battery.h\"\n #include \"motor.h\"\n #include \"pinout.h\"\n #include \"odometry.h\"\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Scheduler vars \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nuint16_t scheduler_send_status = INT16_MAX;\nuint16_t scheduler_send_sensor = INT16_MAX;\nuint16_t scheduler_measure_ultrasonic = INT16_MAX;\nuint16_t scheduler_measure_battery = INT16_MAX;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Setup function \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid setup() {\n battery_setup();\n motor_setup();\n odometry_setup();\n uplink_setup();\n ultrasonic_setup();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Endless loop \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid loop() {\n\n if (scheduler_measure_battery > SCHEDULER_MEASURE_BATTERY_DELAY){\n battery_measure();\n scheduler_measure_battery = 0;\n }\n\n if (scheduler_measure_ultrasonic > SCHEDULER_MEASURE_ULTRASONIC_DELAY){\n ultrasonic_measure();\n scheduler_measure_ultrasonic = 0;\n }\n\n if (scheduler_send_status > SCHEDULER_SEND_STATUS_DELAY){\n \/\/uplink_sendStatus();\n scheduler_send_status = 0;\n }\n\n if (scheduler_send_sensor > SCHEDULER_SEND_SENSOR_DELAY){\n uplink_sendSensor();\n scheduler_send_sensor = 0;\n }\n\n scheduler_send_status++;\n scheduler_send_sensor++;\n scheduler_measure_ultrasonic++;\n scheduler_measure_battery++;\n}\n<commit_msg>replaced int by uint<commit_after>#include <Arduino.h>\n#include \"main.h\"\n#include \"uplink.h\"\n#include \"usonic.h\"\n\nextern \"C\" {\n #include \"battery.h\"\n #include \"motor.h\"\n #include \"pinout.h\"\n #include \"odometry.h\"\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Scheduler vars \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nuint16_t scheduler_send_status = UINT16_MAX;\nuint16_t scheduler_send_sensor = UINT16_MAX;\nuint16_t scheduler_measure_ultrasonic = UINT16_MAX;\nuint16_t scheduler_measure_battery = UINT16_MAX;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Setup function \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid setup() {\n battery_setup();\n motor_setup();\n odometry_setup();\n uplink_setup();\n ultrasonic_setup();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ Endless loop \/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid loop() {\n\n if (scheduler_measure_battery > SCHEDULER_MEASURE_BATTERY_DELAY){\n battery_measure();\n scheduler_measure_battery = 0;\n }\n\n if (scheduler_measure_ultrasonic > SCHEDULER_MEASURE_ULTRASONIC_DELAY){\n ultrasonic_measure();\n scheduler_measure_ultrasonic = 0;\n }\n\n if (scheduler_send_status > SCHEDULER_SEND_STATUS_DELAY){\n \/\/uplink_sendStatus();\n scheduler_send_status = 0;\n }\n\n if (scheduler_send_sensor > SCHEDULER_SEND_SENSOR_DELAY){\n uplink_sendSensor();\n scheduler_send_sensor = 0;\n }\n\n scheduler_send_status++;\n scheduler_send_sensor++;\n scheduler_measure_ultrasonic++;\n scheduler_measure_battery++;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"gsldatahandle.hh\"\n#include \"gsldatautils.hh\"\n#include \"gslfilter.hh\"\n#include \"bseblockutils.hh\"\n#include <complex>\n#include <vector>\n#include <string.h>\n#include <stdio.h>\n#include <math.h>\n#include <FLAC\/stream_decoder.h>\n\nnamespace Bse {\n\nusing std::vector;\nusing std::string;\nusing std::min;\n\nclass DataHandleFlac;\n\nstruct CDataHandleFlac : public GslDataHandle\n{\n \/\/ back pointer to get casting right, even in presence of C++ vtable:\n DataHandleFlac* cxx_dh;\n};\n\nclass DataHandleFlac {\nprivate:\n static FLAC__StreamDecoderWriteStatus\n flac_write_callback (const FLAC__StreamDecoder *decoder,\n const FLAC__Frame *frame,\n const FLAC__int32 *const buffer[],\n void *client_data)\n {\n DataHandleFlac *dh = static_cast<DataHandleFlac *> (client_data);\n dh->m_buffer_start = frame->header.number.sample_number * frame->header.channels;\n dh->m_buffer.clear();\n\n \/\/ scale with 1\/32768 for 16 bit, 1\/(2^23) for 24 bit\n double scale = 2.0 \/ (1 << frame->header.bits_per_sample);\n for (int i = 0; i < frame->header.blocksize; i++)\n {\n \/\/ interleave channels\n for (int ch = 0; ch < frame->header.channels; ch++)\n dh->m_buffer.push_back (buffer[ch][i] * scale);\n }\n return FLAC__STREAM_DECODER_WRITE_STATUS_CONTINUE;\n }\n\n \/\/ pass error status from flac callback to caller\n bool m_error_occurred;\n FLAC__StreamDecoderErrorStatus m_error_status;\n\n static void\n flac_error_callback (const FLAC__StreamDecoder *decoder,\n FLAC__StreamDecoderErrorStatus status,\n void *client_data)\n {\n DataHandleFlac *dh = static_cast<DataHandleFlac *> (client_data);\n dh->m_error_occurred = true;\n dh->m_error_status = status;\n }\n\nprotected:\n CDataHandleFlac\tm_dhandle;\n int m_n_channels;\n bool\t\t\tm_init_ok;\n string m_file_name;\n FLAC__StreamDecoder *m_decoder;\n int64 m_buffer_start;\n vector<float> m_buffer;\n float m_osc_freq;\n\npublic:\n DataHandleFlac (const string& file_name,\n\t\t float osc_freq) :\n m_init_ok (false),\n m_decoder (NULL)\n {\n memset (&m_dhandle, 0, sizeof (m_dhandle));\n m_init_ok = gsl_data_handle_common_init (&m_dhandle, NULL);\n m_file_name = file_name;\n m_dhandle.name = g_strdup (m_file_name.c_str());\n m_osc_freq = osc_freq;\n }\n\n \/* protected destructor: (use reference counting instead) *\/\n virtual\n ~DataHandleFlac()\n {\n if (m_init_ok)\n gsl_data_handle_common_free (&m_dhandle);\n }\n\n BseErrorType\n open (GslDataHandleSetup *setup)\n {\n m_decoder = FLAC__stream_decoder_new();\n if (!m_decoder)\n return BSE_ERROR_IO;\n\n m_error_occurred = false;\n int err = FLAC__stream_decoder_init_file (m_decoder, m_file_name.c_str(),\n flac_write_callback, NULL, flac_error_callback, this);\n if (err != 0)\n return BSE_ERROR_IO;\n\n \/* decode enough to figure out number of channels *\/\n FLAC__bool mdok;\n do {\n mdok = FLAC__stream_decoder_process_single (m_decoder);\n } while (FLAC__stream_decoder_get_channels (m_decoder) == 0 && mdok);\n\n if (FLAC__stream_decoder_get_channels (m_decoder) == 0)\n return BSE_ERROR_IO;\n\n if (m_error_occurred)\n return BSE_ERROR_IO;\n\n m_n_channels = setup->n_channels = FLAC__stream_decoder_get_channels (m_decoder);\n setup->n_values = FLAC__stream_decoder_get_total_samples (m_decoder);\n setup->bit_depth = FLAC__stream_decoder_get_bits_per_sample (m_decoder);\n setup->mix_freq = FLAC__stream_decoder_get_sample_rate (m_decoder);\n setup->xinfos = bse_xinfos_add_float (setup->xinfos, \"osc-freq\", m_osc_freq);\n\n return BSE_ERROR_NONE;\n }\n\n void\n close()\n {\n m_dhandle.setup.xinfos = NULL;\t\/* cleanup pointer reference *\/\n }\n\n int64\n read_samples (int64 voffset,\n\t int64 n_values,\n\t float *values)\n {\n if (voffset >= m_buffer_start + m_buffer.size())\n {\n \/\/ try to read on, probably we'll have just the samples we need, then\n m_error_occurred = false;\n FLAC__bool decode_ok = FLAC__stream_decoder_process_single (m_decoder);\n\n if (!decode_ok || m_error_occurred)\n return -1;\n }\n\n if (voffset >= m_buffer_start && voffset < m_buffer_start + m_buffer.size())\n {\n int64 buffer_offset = voffset - m_buffer_start;\n n_values = MIN (n_values, m_buffer.size() - buffer_offset);\n std::copy (m_buffer.begin() + buffer_offset, m_buffer.begin() + buffer_offset + n_values, values);\n return n_values;\n }\n\n \/\/ need to seek to get to the right location\n m_error_occurred = false;\n FLAC__bool seek_ok = FLAC__stream_decoder_seek_absolute (m_decoder, voffset \/ m_n_channels);\n if (!seek_ok || m_error_occurred)\n return -1;\n\n if (voffset == m_buffer_start)\n return read_samples (voffset, n_values, values); \/\/ will work this time, since we have the right samples now\n\n return 0;\n }\n\n static GslDataHandle*\n dh_create (DataHandleFlac *cxx_dh)\n {\n static GslDataHandleFuncs dh_vtable =\n {\n dh_open,\n dh_read,\n dh_close,\n NULL,\n NULL,\n dh_destroy,\n };\n\n if (cxx_dh->m_init_ok)\n {\n\tcxx_dh->m_dhandle.vtable = &dh_vtable;\n\tcxx_dh->m_dhandle.cxx_dh = cxx_dh;\t\/* make casts work, later on *\/\n\treturn &cxx_dh->m_dhandle;\n }\n else\n {\n\tdelete cxx_dh;\n\treturn NULL;\n }\n }\n static DataHandleFlac*\n dh_cast (GslDataHandle *dhandle)\n {\n return static_cast<CDataHandleFlac *> (dhandle)->cxx_dh;\n }\nprivate:\n\/* for the \"C\" API (vtable) *\/\n static BseErrorType\n dh_open (GslDataHandle *dhandle, GslDataHandleSetup *setup)\n {\n return dh_cast (dhandle)->open (setup);\n }\n static void\n dh_close (GslDataHandle *dhandle)\n {\n dh_cast (dhandle)->close();\n }\n static void\n dh_destroy (GslDataHandle *dhandle)\n {\n delete dh_cast (dhandle);\n }\n static int64\n dh_read (GslDataHandle *dhandle,\n\t int64 voffset,\n\t int64 n_values,\n\t gfloat *values)\n {\n return dh_cast (dhandle)->read_samples (voffset, n_values, values);\n }\n};\n\n}\n\nusing namespace Bse;\n\nextern \"C\" GslDataHandle*\nbse_data_handle_new_flac (const char *file_name,\n gfloat osc_freq)\n{\n DataHandleFlac *cxx_dh = new DataHandleFlac (file_name, osc_freq);\n return DataHandleFlac::dh_create (cxx_dh);\n}\n<commit_msg>FLAC: fix length information for multi-channel files<commit_after>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"gsldatahandle.hh\"\n#include \"gsldatautils.hh\"\n#include \"gslfilter.hh\"\n#include \"bseblockutils.hh\"\n#include <complex>\n#include <vector>\n#include <string.h>\n#include <stdio.h>\n#include <math.h>\n#include <FLAC\/stream_decoder.h>\n\nnamespace Bse {\n\nusing std::vector;\nusing std::string;\nusing std::min;\n\nclass DataHandleFlac;\n\nstruct CDataHandleFlac : public GslDataHandle\n{\n \/\/ back pointer to get casting right, even in presence of C++ vtable:\n DataHandleFlac* cxx_dh;\n};\n\nclass DataHandleFlac {\nprivate:\n static FLAC__StreamDecoderWriteStatus\n flac_write_callback (const FLAC__StreamDecoder *decoder,\n const FLAC__Frame *frame,\n const FLAC__int32 *const buffer[],\n void *client_data)\n {\n DataHandleFlac *dh = static_cast<DataHandleFlac *> (client_data);\n dh->m_buffer_start = frame->header.number.sample_number * frame->header.channels;\n dh->m_buffer.clear();\n\n \/\/ scale with 1\/32768 for 16 bit, 1\/(2^23) for 24 bit\n double scale = 2.0 \/ (1 << frame->header.bits_per_sample);\n for (int i = 0; i < frame->header.blocksize; i++)\n {\n \/\/ interleave channels\n for (int ch = 0; ch < frame->header.channels; ch++)\n dh->m_buffer.push_back (buffer[ch][i] * scale);\n }\n return FLAC__STREAM_DECODER_WRITE_STATUS_CONTINUE;\n }\n\n \/\/ pass error status from flac callback to caller\n bool m_error_occurred;\n FLAC__StreamDecoderErrorStatus m_error_status;\n\n static void\n flac_error_callback (const FLAC__StreamDecoder *decoder,\n FLAC__StreamDecoderErrorStatus status,\n void *client_data)\n {\n DataHandleFlac *dh = static_cast<DataHandleFlac *> (client_data);\n dh->m_error_occurred = true;\n dh->m_error_status = status;\n }\n\nprotected:\n CDataHandleFlac\tm_dhandle;\n int m_n_channels;\n bool\t\t\tm_init_ok;\n string m_file_name;\n FLAC__StreamDecoder *m_decoder;\n int64 m_buffer_start;\n vector<float> m_buffer;\n float m_osc_freq;\n\npublic:\n DataHandleFlac (const string& file_name,\n\t\t float osc_freq) :\n m_init_ok (false),\n m_decoder (NULL)\n {\n memset (&m_dhandle, 0, sizeof (m_dhandle));\n m_init_ok = gsl_data_handle_common_init (&m_dhandle, NULL);\n m_file_name = file_name;\n m_dhandle.name = g_strdup (m_file_name.c_str());\n m_osc_freq = osc_freq;\n }\n\n \/* protected destructor: (use reference counting instead) *\/\n virtual\n ~DataHandleFlac()\n {\n if (m_init_ok)\n gsl_data_handle_common_free (&m_dhandle);\n }\n\n BseErrorType\n open (GslDataHandleSetup *setup)\n {\n m_decoder = FLAC__stream_decoder_new();\n if (!m_decoder)\n return BSE_ERROR_IO;\n\n m_error_occurred = false;\n int err = FLAC__stream_decoder_init_file (m_decoder, m_file_name.c_str(),\n flac_write_callback, NULL, flac_error_callback, this);\n if (err != 0)\n return BSE_ERROR_IO;\n\n \/* decode enough to figure out number of channels *\/\n FLAC__bool mdok;\n do {\n mdok = FLAC__stream_decoder_process_single (m_decoder);\n } while (FLAC__stream_decoder_get_channels (m_decoder) == 0 && mdok);\n\n if (FLAC__stream_decoder_get_channels (m_decoder) == 0)\n return BSE_ERROR_IO;\n\n if (m_error_occurred)\n return BSE_ERROR_IO;\n\n m_n_channels = setup->n_channels = FLAC__stream_decoder_get_channels (m_decoder);\n setup->n_values = FLAC__stream_decoder_get_total_samples (m_decoder) * m_n_channels;\n setup->bit_depth = FLAC__stream_decoder_get_bits_per_sample (m_decoder);\n setup->mix_freq = FLAC__stream_decoder_get_sample_rate (m_decoder);\n setup->xinfos = bse_xinfos_add_float (setup->xinfos, \"osc-freq\", m_osc_freq);\n\n return BSE_ERROR_NONE;\n }\n\n void\n close()\n {\n m_dhandle.setup.xinfos = NULL;\t\/* cleanup pointer reference *\/\n }\n\n int64\n read_samples (int64 voffset,\n\t int64 n_values,\n\t float *values)\n {\n if (voffset >= m_buffer_start + m_buffer.size())\n {\n \/\/ try to read on, probably we'll have just the samples we need, then\n m_error_occurred = false;\n FLAC__bool decode_ok = FLAC__stream_decoder_process_single (m_decoder);\n\n if (!decode_ok || m_error_occurred)\n return -1;\n }\n\n if (voffset >= m_buffer_start && voffset < m_buffer_start + m_buffer.size())\n {\n int64 buffer_offset = voffset - m_buffer_start;\n n_values = MIN (n_values, m_buffer.size() - buffer_offset);\n std::copy (m_buffer.begin() + buffer_offset, m_buffer.begin() + buffer_offset + n_values, values);\n return n_values;\n }\n\n \/\/ need to seek to get to the right location\n m_error_occurred = false;\n FLAC__bool seek_ok = FLAC__stream_decoder_seek_absolute (m_decoder, voffset \/ m_n_channels);\n if (!seek_ok || m_error_occurred)\n return -1;\n\n if (voffset == m_buffer_start)\n return read_samples (voffset, n_values, values); \/\/ will work this time, since we have the right samples now\n\n return 0;\n }\n\n static GslDataHandle*\n dh_create (DataHandleFlac *cxx_dh)\n {\n static GslDataHandleFuncs dh_vtable =\n {\n dh_open,\n dh_read,\n dh_close,\n NULL,\n NULL,\n dh_destroy,\n };\n\n if (cxx_dh->m_init_ok)\n {\n\tcxx_dh->m_dhandle.vtable = &dh_vtable;\n\tcxx_dh->m_dhandle.cxx_dh = cxx_dh;\t\/* make casts work, later on *\/\n\treturn &cxx_dh->m_dhandle;\n }\n else\n {\n\tdelete cxx_dh;\n\treturn NULL;\n }\n }\n static DataHandleFlac*\n dh_cast (GslDataHandle *dhandle)\n {\n return static_cast<CDataHandleFlac *> (dhandle)->cxx_dh;\n }\nprivate:\n\/* for the \"C\" API (vtable) *\/\n static BseErrorType\n dh_open (GslDataHandle *dhandle, GslDataHandleSetup *setup)\n {\n return dh_cast (dhandle)->open (setup);\n }\n static void\n dh_close (GslDataHandle *dhandle)\n {\n dh_cast (dhandle)->close();\n }\n static void\n dh_destroy (GslDataHandle *dhandle)\n {\n delete dh_cast (dhandle);\n }\n static int64\n dh_read (GslDataHandle *dhandle,\n\t int64 voffset,\n\t int64 n_values,\n\t gfloat *values)\n {\n return dh_cast (dhandle)->read_samples (voffset, n_values, values);\n }\n};\n\n}\n\nusing namespace Bse;\n\nextern \"C\" GslDataHandle*\nbse_data_handle_new_flac (const char *file_name,\n gfloat osc_freq)\n{\n DataHandleFlac *cxx_dh = new DataHandleFlac (file_name, osc_freq);\n return DataHandleFlac::dh_create (cxx_dh);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <iterator>\n\n#include <R.h>\n#include <Rinternals.h>\n\nextern \"C\"\n{\n\nclass sexp_scaled_point_iterator\n : public std::iterator<std::input_iterator_tag, double>\n{\n\nprivate:\n\n double * vector;\n size_t dimention;\n\npublic:\n\n sexp_scaled_point_iterator(const SEXP & val, size_t d)\n : vector(REAL(val))\n { }\n\n sexp_scaled_point_iterator(const SEXP & val, size_t d, size_t begin_index)\n : vector(REAL(val) + begin_index)\n , dimention(d)\n { }\n\n sexp_scaled_point_iterator (const sexp_scaled_point_iterator& x) = default;\n\n double operator*() const\n {\n return *vector;\n }\n\n double * operator->() const\n {\n return vector;\n }\n\n sexp_scaled_point_iterator& operator++()\n {\n vector += dimention;\n return *this;\n }\n\n sexp_scaled_point_iterator operator++(int)\n {\n sexp_scaled_point_iterator temp(*this);\n vector += dimention;\n return temp;\n }\n\n friend bool operator==(sexp_scaled_point_iterator const & a, sexp_scaled_point_iterator const & b)\n {\n return (a.vector == b.vector) && (a.dimention == b.dimention);\n }\n\n friend bool operator!=(sexp_scaled_point_iterator const & a, sexp_scaled_point_iterator const & b)\n {\n return !(a == b);\n }\n};\n\n} \/\/ extern \"C\";\n<commit_msg>Delete obsolete files ;)<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"constants.hpp\"\n#include \"filesystem.hpp\"\n#include \"local_datagram_client.hpp\"\n#include \"session.hpp\"\n#include \"types.hpp\"\n#include <unistd.h>\n#include <vector>\n\nclass grabber_client final {\npublic:\n grabber_client(const grabber_client&) = delete;\n\n grabber_client(void) {\n \/\/ Check socket file existance\n if (!filesystem::exists(constants::get_grabber_socket_file_path())) {\n throw std::runtime_error(\"grabber socket is not found\");\n }\n\n \/\/ Check socket file permission\n if (auto current_console_user_id = session::get_current_console_user_id()) {\n if (!filesystem::is_owned(constants::get_grabber_socket_file_path(), *current_console_user_id)) {\n throw std::runtime_error(\"grabber socket is not writable\");\n }\n } else {\n throw std::runtime_error(\"session::get_current_console_user_id error\");\n }\n\n client_ = std::make_unique<local_datagram_client>(constants::get_grabber_socket_file_path());\n }\n\n void connect(krbn::connect_from connect_from) {\n krbn::operation_type_connect_struct s;\n s.connect_from = connect_from;\n s.pid = getpid();\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void system_preferences_values_updated(const system_preferences::values values) {\n krbn::operation_type_system_preferences_values_updated_struct s;\n s.values = values;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void clear_simple_modifications(void) {\n krbn::operation_type_clear_simple_modifications_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void add_simple_modification(krbn::key_code from_key_code, krbn::key_code to_key_code) {\n krbn::operation_type_add_simple_modification_struct s;\n s.from_key_code = from_key_code;\n s.to_key_code = to_key_code;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void clear_fn_function_keys(void) {\n krbn::operation_type_clear_fn_function_keys_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void add_fn_function_key(krbn::key_code from_key_code, krbn::key_code to_key_code) {\n krbn::operation_type_add_fn_function_key_struct s;\n s.from_key_code = from_key_code;\n s.to_key_code = to_key_code;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void set_caps_lock_led_state(krbn::led_state led_state) {\n krbn::operation_type_set_caps_lock_led_state_struct s;\n s.led_state = led_state;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\nprivate:\n std::unique_ptr<local_datagram_client> client_;\n};\n<commit_msg>add clear_devices,add_device,complete_devices<commit_after>#pragma once\n\n#include \"constants.hpp\"\n#include \"filesystem.hpp\"\n#include \"local_datagram_client.hpp\"\n#include \"session.hpp\"\n#include \"types.hpp\"\n#include <unistd.h>\n#include <vector>\n\nclass grabber_client final {\npublic:\n grabber_client(const grabber_client&) = delete;\n\n grabber_client(void) {\n \/\/ Check socket file existance\n if (!filesystem::exists(constants::get_grabber_socket_file_path())) {\n throw std::runtime_error(\"grabber socket is not found\");\n }\n\n \/\/ Check socket file permission\n if (auto current_console_user_id = session::get_current_console_user_id()) {\n if (!filesystem::is_owned(constants::get_grabber_socket_file_path(), *current_console_user_id)) {\n throw std::runtime_error(\"grabber socket is not writable\");\n }\n } else {\n throw std::runtime_error(\"session::get_current_console_user_id error\");\n }\n\n client_ = std::make_unique<local_datagram_client>(constants::get_grabber_socket_file_path());\n }\n\n void connect(krbn::connect_from connect_from) {\n krbn::operation_type_connect_struct s;\n s.connect_from = connect_from;\n s.pid = getpid();\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void system_preferences_values_updated(const system_preferences::values values) {\n krbn::operation_type_system_preferences_values_updated_struct s;\n s.values = values;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void clear_simple_modifications(void) {\n krbn::operation_type_clear_simple_modifications_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void add_simple_modification(krbn::key_code from_key_code, krbn::key_code to_key_code) {\n krbn::operation_type_add_simple_modification_struct s;\n s.from_key_code = from_key_code;\n s.to_key_code = to_key_code;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void clear_fn_function_keys(void) {\n krbn::operation_type_clear_fn_function_keys_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void add_fn_function_key(krbn::key_code from_key_code, krbn::key_code to_key_code) {\n krbn::operation_type_add_fn_function_key_struct s;\n s.from_key_code = from_key_code;\n s.to_key_code = to_key_code;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void clear_devices(void) {\n krbn::operation_type_clear_devices_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void add_device(krbn::vendor_product_id vendor_product_id, bool ignore) {\n krbn::operation_type_add_device_struct s;\n s.vendor_product_id = vendor_product_id;\n s.ignore = ignore;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void complete_devices(void) {\n krbn::operation_type_complete_devices_struct s;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\n void set_caps_lock_led_state(krbn::led_state led_state) {\n krbn::operation_type_set_caps_lock_led_state_struct s;\n s.led_state = led_state;\n client_->send_to(reinterpret_cast<uint8_t*>(&s), sizeof(s));\n }\n\nprivate:\n std::unique_ptr<local_datagram_client> client_;\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ net.cpp\n\/\/ Luves\n\/\/\n\/\/ Created by leviathan on 16\/5\/17.\n\/\/ Copyright © 2016年 leviathan. All rights reserved.\n\/\/\n#include <stdio.h>\n\n#include \"net.h\"\n\nnamespace luves\n{\n \/\/\n \/\/Socket属性操作\n \/\/\n int SocketOp::SetNonblock(int fd)\n {\n int flags=fcntl(fd, F_GETFL,0);\n if(flags<0)\n return errno;\n return fcntl(fd, F_SETFL,flags|O_NONBLOCK);\n }\n\n int SocketOp::SetReuseaddr(int fd)\n {\n int flags=1;\n int len=sizeof(flags);\n return setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &flags, len);\n }\n\n int SocketOp::SetReuseport(int fd)\n {\n int flags=1;\n int len=sizeof(flags);\n return setsockopt(fd, SOL_SOCKET, SO_REUSEPORT, &flags, len);\n }\n\n \/\/\n \/\/Ip4地址模块\n \/\/\n std::string Ip4Addr::ToString()\n {\n uint32_t host = addr_.sin_addr.s_addr;\n char str[64];\n sprintf(str, \"%d.%d.%d.%d:%d\",(host>> 0)&0xff,(host >> 8)&0xff,(host >> 16)&0xff,(host>> 24)&0xff, ntohs(addr_.sin_port));\n return str;\n }\n\n \/\/\n \/\/Socket\n \/\/\n Socket::~Socket()\n {\n Socket::Close(fd_);\n }\n\n void Socket::Close(int fd)\n {\n close(fd);\n }\n\n int Socket::CreateNonBlockSocket()\n {\n int socket_fd=socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n FATALIF_LOG(!socket_fd,\"socket fd create failed!\");\n return socket_fd;\n }\n\n int Socket::Bind(int fd,sockaddr_in * server_addr)\n {\n int ret =bind(fd,(struct sockaddr *)server_addr,sizeof(*server_addr));\n if (ret==-1)\n {\n close(fd);\n ERROR_LOG(\"bind to %d failed! %d %s\",fd,errno,strerror(errno));\n return ret;\n }\n return 0;\n }\n\n void Socket::Listen(int fd)\n {\n int ret=listen(fd, 20);\n if (ret==-1)\n {\n ERROR_LOG(\"listen to %d failed! %d %s\",fd,errno,strerror(errno));\n }\n }\n\n int Socket::Accept(int fd,sockaddr_in * client_addr)\n {\n socklen_t client_len=sizeof(*client_addr);\n int accept_fd=accept(fd, (struct sockaddr *)client_addr,&client_len);\n if(accept_fd==-1 & errno!=EAGAIN)\n ERROR_LOG(\"accept to %d failed! %d %s\",fd,errno,strerror(errno));\n return accept_fd;\n }\n\n void Socket::Connect(int fd,sockaddr_in * server_addr)\n {\n connect(fd, (struct sockaddr *)&server_addr, sizeof(server_addr));\n\n }\n\n}\n<commit_msg>modify listen backlog<commit_after>\/\/\n\/\/ net.cpp\n\/\/ Luves\n\/\/\n\/\/ Created by leviathan on 16\/5\/17.\n\/\/ Copyright © 2016年 leviathan. All rights reserved.\n\/\/\n#include <stdio.h>\n\n#include \"net.h\"\n\nnamespace luves\n{\n \/\/\n \/\/Socket属性操作\n \/\/\n int SocketOp::SetNonblock(int fd)\n {\n int flags=fcntl(fd, F_GETFL,0);\n if(flags<0)\n return errno;\n return fcntl(fd, F_SETFL,flags|O_NONBLOCK);\n }\n\n int SocketOp::SetReuseaddr(int fd)\n {\n int flags=1;\n int len=sizeof(flags);\n return setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, &flags, len);\n }\n\n int SocketOp::SetReuseport(int fd)\n {\n int flags=1;\n int len=sizeof(flags);\n return setsockopt(fd, SOL_SOCKET, SO_REUSEPORT, &flags, len);\n }\n\n \/\/\n \/\/Ip4地址模块\n \/\/\n std::string Ip4Addr::ToString()\n {\n uint32_t host = addr_.sin_addr.s_addr;\n char str[64];\n sprintf(str, \"%d.%d.%d.%d:%d\",(host>> 0)&0xff,(host >> 8)&0xff,(host >> 16)&0xff,(host>> 24)&0xff, ntohs(addr_.sin_port));\n return str;\n }\n\n \/\/\n \/\/Socket\n \/\/\n Socket::~Socket()\n {\n Socket::Close(fd_);\n }\n\n void Socket::Close(int fd)\n {\n close(fd);\n }\n\n int Socket::CreateNonBlockSocket()\n {\n int socket_fd=socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n FATALIF_LOG(!socket_fd,\"socket fd create failed!\");\n return socket_fd;\n }\n\n int Socket::Bind(int fd,sockaddr_in * server_addr)\n {\n int ret =bind(fd,(struct sockaddr *)server_addr,sizeof(*server_addr));\n if (ret==-1)\n {\n close(fd);\n ERROR_LOG(\"bind to %d failed! %d %s\",fd,errno,strerror(errno));\n return ret;\n }\n return 0;\n }\n\n void Socket::Listen(int fd)\n {\n int ret=listen(fd, 1024);\n if (ret==-1)\n {\n ERROR_LOG(\"listen to %d failed! %d %s\",fd,errno,strerror(errno));\n }\n }\n\n int Socket::Accept(int fd,sockaddr_in * client_addr)\n {\n socklen_t client_len=sizeof(*client_addr);\n int accept_fd=accept(fd, (struct sockaddr *)client_addr,&client_len);\n if(accept_fd==-1 & errno!=EAGAIN)\n ERROR_LOG(\"accept to %d failed! %d %s\",fd,errno,strerror(errno));\n return accept_fd;\n }\n\n void Socket::Connect(int fd,sockaddr_in * server_addr)\n {\n connect(fd, (struct sockaddr *)&server_addr, sizeof(server_addr));\n\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*-------------------------------------------------------------------------\n * Vulkan CTS Framework\n * --------------------\n *\n * Copyright (c) 2018 The Khronos Group Inc.\n * Copyright (c) 2018 Intel Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\/*!\n * \\file\n * \\brief RenderDoc utility\n *\/\/*--------------------------------------------------------------------*\/\n\n#include \"vkRenderDocUtil.hpp\"\n\n#include \"deDynamicLibrary.hpp\"\n#include \"deUniquePtr.hpp\"\n#include \"tcuDefs.hpp\"\n\n#include \"renderdoc_app.h\"\n#include <stdexcept>\n\n#if (DE_OS == DE_OS_WIN32)\n#\tdefine RENDERDOC_LIBRARY_NAME \"renderdoc.dll\"\n#else\n#\tdefine RENDERDOC_LIBRARY_NAME \"librenderdoc.so\"\n#endif\n\nnamespace vk\n{\n\nstruct RenderDocPrivate\n{\n\t\t\t\t\t\t\t\t\t\tRenderDocPrivate\t(void)\t: m_api(DE_NULL), m_valid(false) {}\n\n\tde::MovePtr<de::DynamicLibrary>\t\tm_library;\n\t::RENDERDOC_API_1_1_2*\t\t\t\tm_api;\n\tbool\t\t\t\t\t\t\t\tm_valid;\n};\n\nRenderDocUtil::RenderDocUtil (void)\n\t: m_priv\t(new RenderDocPrivate)\n{\n\ttry\n\t{\n\t\tm_priv->m_library\t = de::MovePtr<de::DynamicLibrary>(new de::DynamicLibrary(RENDERDOC_LIBRARY_NAME));\n\t}\n\tcatch (const std::runtime_error& e)\n\t{\n\t\ttcu::print(\"Library %s not loaded: %s, RenderDoc API not available\", e.what(), RENDERDOC_LIBRARY_NAME);\n\t}\n\n\tif (m_priv->m_library)\n\t{\n\t\t::pRENDERDOC_GetAPI pGetApi = (::pRENDERDOC_GetAPI)m_priv->m_library->getFunction(\"RENDERDOC_GetAPI\");\n\t\tconst int\t\t\tret\t\t= pGetApi(eRENDERDOC_API_Version_1_1_2, (void **)&m_priv->m_api);\n\n\t\tif (ret == 1)\n\t\t{\n\t\t\tm_priv->m_api->TriggerCapture();\n\n\t\t\tm_priv->m_valid = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttcu::print(\"RENDERDOC_GetAPI returned %d status, RenderDoc API not available\", ret);\n\t\t}\n\t}\n}\n\nRenderDocUtil::~RenderDocUtil (void)\n{\n\tif (m_priv)\n\t{\n\t\tdelete m_priv;\n\t}\n}\n\nbool RenderDocUtil::isValid (void)\n{\n\treturn m_priv != DE_NULL && m_priv->m_valid;\n}\n\nvoid RenderDocUtil::startFrame (vk::VkInstance instance)\n{\n\tif (!isValid()) return;\n\n\tm_priv->m_api->StartFrameCapture(RENDERDOC_DEVICEPOINTER_FROM_VKINSTANCE(instance), DE_NULL);\n}\n\nvoid RenderDocUtil::endFrame (vk::VkInstance instance)\n{\n\tif (!isValid()) return;\n\n\tm_priv->m_api->EndFrameCapture(RENDERDOC_DEVICEPOINTER_FROM_VKINSTANCE(instance), DE_NULL);\n}\n\n} \/\/ vk\n<commit_msg>Fix renderdoc library name on android<commit_after>\/*-------------------------------------------------------------------------\n * Vulkan CTS Framework\n * --------------------\n *\n * Copyright (c) 2018 The Khronos Group Inc.\n * Copyright (c) 2018 Intel Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\/*!\n * \\file\n * \\brief RenderDoc utility\n *\/\/*--------------------------------------------------------------------*\/\n\n#include \"vkRenderDocUtil.hpp\"\n\n#include \"deDynamicLibrary.hpp\"\n#include \"deUniquePtr.hpp\"\n#include \"tcuDefs.hpp\"\n\n#include \"renderdoc_app.h\"\n#include <stdexcept>\n\n#if (DE_OS == DE_OS_WIN32)\n#\tdefine RENDERDOC_LIBRARY_NAME \"renderdoc.dll\"\n#elif (DE_OS == DE_OS_ANDROID)\n#\tdefine RENDERDOC_LIBRARY_NAME \"libVkLayer_GLES_RenderDoc.so\"\n#else\n#\tdefine RENDERDOC_LIBRARY_NAME \"librenderdoc.so\"\n#endif\n\nnamespace vk\n{\n\nstruct RenderDocPrivate\n{\n\t\t\t\t\t\t\t\t\t\tRenderDocPrivate\t(void)\t: m_api(DE_NULL), m_valid(false) {}\n\n\tde::MovePtr<de::DynamicLibrary>\t\tm_library;\n\t::RENDERDOC_API_1_1_2*\t\t\t\tm_api;\n\tbool\t\t\t\t\t\t\t\tm_valid;\n};\n\nRenderDocUtil::RenderDocUtil (void)\n\t: m_priv\t(new RenderDocPrivate)\n{\n\ttry\n\t{\n\t\tm_priv->m_library\t = de::MovePtr<de::DynamicLibrary>(new de::DynamicLibrary(RENDERDOC_LIBRARY_NAME));\n\t}\n\tcatch (const std::runtime_error& e)\n\t{\n\t\ttcu::print(\"Library %s not loaded: %s, RenderDoc API not available\", e.what(), RENDERDOC_LIBRARY_NAME);\n\t}\n\n\tif (m_priv->m_library)\n\t{\n\t\t::pRENDERDOC_GetAPI pGetApi = (::pRENDERDOC_GetAPI)m_priv->m_library->getFunction(\"RENDERDOC_GetAPI\");\n\t\tconst int\t\t\tret\t\t= pGetApi(eRENDERDOC_API_Version_1_1_2, (void **)&m_priv->m_api);\n\n\t\tif (ret == 1)\n\t\t{\n\t\t\tm_priv->m_api->TriggerCapture();\n\n\t\t\tm_priv->m_valid = true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\ttcu::print(\"RENDERDOC_GetAPI returned %d status, RenderDoc API not available\", ret);\n\t\t}\n\t}\n}\n\nRenderDocUtil::~RenderDocUtil (void)\n{\n\tif (m_priv)\n\t{\n\t\tdelete m_priv;\n\t}\n}\n\nbool RenderDocUtil::isValid (void)\n{\n\treturn m_priv != DE_NULL && m_priv->m_valid;\n}\n\nvoid RenderDocUtil::startFrame (vk::VkInstance instance)\n{\n\tif (!isValid()) return;\n\n\tm_priv->m_api->StartFrameCapture(RENDERDOC_DEVICEPOINTER_FROM_VKINSTANCE(instance), DE_NULL);\n}\n\nvoid RenderDocUtil::endFrame (vk::VkInstance instance)\n{\n\tif (!isValid()) return;\n\n\tm_priv->m_api->EndFrameCapture(RENDERDOC_DEVICEPOINTER_FROM_VKINSTANCE(instance), DE_NULL);\n}\n\n} \/\/ vk\n<|endoftext|>"} {"text":"<commit_before>\/*Copyright 2010-2013 George Karagoulis\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.*\/\n\n#ifndef GUTIL_NO_GUI_FUNCTIONALITY\n\n#include \"messageboxlogger.h\"\n#include <QMessageBox>\n#include <QDateTime>\n#include <QMetaType>\nUSING_NAMESPACE_GUTIL;\n\nNAMESPACE_GUTIL1(QT);\n\n\nMessageBoxLogger::MessageBoxLogger(QWidget *parent)\n :QObject((QObject *)parent),\n m_parentWidget(parent)\n{\n qRegisterMetaType<LoggingData>(\"LoggingData\");\n}\n\nvoid MessageBoxLogger::Log(const LoggingData &d) noexcept\n{\n \/\/ Invoke this as a queued signal so the logging happens in our event loop\n QMetaObject::invokeMethod(this, \"_log\", Qt::QueuedConnection,\n Q_ARG(LoggingData, d));\n}\n\nvoid MessageBoxLogger::_log(const LoggingData &d)\n{\n QString title = QString(\"%1 %2\")\n .arg(QDateTime::fromTime_t(d.LogTime).toString())\n .arg(d.Title.ConstData());\n QString msg(d.Message.ConstData());\n switch(d.MessageLevel)\n {\n case LogLevelInfo:\n QMessageBox::information(m_parentWidget, title, msg);\n break;\n case LogLevelWarning:\n QMessageBox::warning(m_parentWidget, title, msg);\n break;\n case LogLevelError:\n QMessageBox::critical(m_parentWidget, title, msg);\n break;\n default:\n break;\n }\n}\n\n\nEND_NAMESPACE_GUTIL1;\n\n#endif \/\/ GUI_FUNCTIONALITY\n<commit_msg>Made this an AutoConnection so if you are on the same thread it doesn't get queued.<commit_after>\/*Copyright 2010-2013 George Karagoulis\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.*\/\n\n#ifndef GUTIL_NO_GUI_FUNCTIONALITY\n\n#include \"messageboxlogger.h\"\n#include <QMessageBox>\n#include <QDateTime>\n#include <QMetaType>\nUSING_NAMESPACE_GUTIL;\n\nNAMESPACE_GUTIL1(QT);\n\n\nMessageBoxLogger::MessageBoxLogger(QWidget *parent)\n :QObject((QObject *)parent),\n m_parentWidget(parent)\n{\n qRegisterMetaType<LoggingData>(\"LoggingData\");\n}\n\nvoid MessageBoxLogger::Log(const LoggingData &d) noexcept\n{\n \/\/ Invoke this as a queued signal so the logging happens in our event loop\n QMetaObject::invokeMethod(this, \"_log\", Qt::AutoConnection,\n Q_ARG(LoggingData, d));\n}\n\nvoid MessageBoxLogger::_log(const LoggingData &d)\n{\n QString title = QString(\"%1 %2\")\n .arg(QDateTime::fromTime_t(d.LogTime).toString())\n .arg(d.Title.ConstData());\n QString msg(d.Message.ConstData());\n switch(d.MessageLevel)\n {\n case LogLevelInfo:\n QMessageBox::information(m_parentWidget, title, msg);\n break;\n case LogLevelWarning:\n QMessageBox::warning(m_parentWidget, title, msg);\n break;\n case LogLevelError:\n QMessageBox::critical(m_parentWidget, title, msg);\n break;\n default:\n break;\n }\n}\n\n\nEND_NAMESPACE_GUTIL1;\n\n#endif \/\/ GUI_FUNCTIONALITY\n<|endoftext|>"} {"text":"<commit_before>#include <unistd.h>\n#include <iostream>\n#include <string.h>\n#include <string>\n#include <sys\/time.h>\n#include <errno.h>\n#include <fcntl.h>\n#include <stdlib.h>\n#include <fstream>\n\n#define BUFSIZE 100\n\n\/* program to glitch pictures\n * TODO:\n * []bitmap \/ single file support\n * *[X]extention recognition\n * *[X]read file\n * *[]one glitch method\n * *[]bitmap output\n * []multiple file support\n * []multiple extension support\n*\/\n\n\nusing namespace std;\n\n\/\/fun crap, for runtime info\nfloat chrono(clock_t t1, clock_t t2){\n float ticks = t2 - t2;\n float cps = (float)ticks\/CLOCKS_PER_SEC;\n \n string calcs = to_string(ticks) + \" ticks, or \" + to_string(cps) + \" seconds\";\n \n return (float)(t2 - t1)\/CLOCKS_PER_SEC;\n}\n\nstring load(char *argv[]){\n string contents;\n ifstream infile;\n infile.open(argv[1]);\n if(infile.is_open())\n while(infile.good())\n getline(infile, contents);\n\n\n infile.close();\n return contents;\n}\n\n\/\/runs a check on the extension, making sure the file is a bitmap\n\/\/maybe a more secure way of doing this?\nstring getExt(int argc, char *argv[]){\n if(argv[1] != NULL){\n size_t nameSize = strlen(argv[1]);\n string ext = \"\";\n\n for(int i = 0; i < nameSize; i++){\n if(argv[1][i] == '.'){\n for(int k = i; k < nameSize; k++){\n ext += argv[1][k];\n }\n }\n }\n\n if(ext != \".bmp\"){\n cout << ext + \" file format not supported (yet?), sorey m8\" << endl;\n exit(1);\n }\n else \n return ext;\n }\n else{\n cout << \"no file specified, try '.\/glitch somefile.bmp'\" << endl;\n exit(2);\n }\n}\n\nint main(int argc, char *argv[]){\n clock_t t1, t2;\n t1 = clock();\n \/\/cout << \"clock1 good\" << endl;\n getExt(argc, argv);\n \/\/cout << \"getExt good\" << endl;\n load(argv);\n \/\/cout << \"load good\" << endl;\n t2 = clock();\n cout << chrono(t1, t2) << endl;\n \n return 0;\n}\n<commit_msg>remove maelstrom.cpp for idea revamp<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <ctime>\n\n#include \"marian.h\"\n\nmarian::Var layer(size_t max) {\n \n using namespace marian;\n \n Var x0 = 1, x1 = 2, x2 = 3;\n Var y = 0.0;\n for(int i = 0; i < max; i++) {\n Var xi = i;\n y = y + x0 + log(x2) + x1;\n for(int j = 0; j < i; ++j) {\n y = y + xi;\n }\n }\n \n return y;\n}\n\nint main(int argc, char** argv) {\n srand(time(NULL));\n \n using namespace marian;\n \n Var y1 = layer(10);\n Var y2 = layer(5);\n \n Var y = y1 + log(y2);\n \n set_zero_all_adjoints();\n y.calc_gradients();\n \n std::cerr << \"y1 = \" << y1.val() << std::endl;\n std::cerr << \"y2 = \" << y2.val() << std::endl;\n std::cerr << \"y = \" << y.val() << std::endl;\n \n std::cerr << \"dy\/dy1 = \" << y1.grad() << std::endl;\n std::cerr << \"dy\/dy2 = \" << y2.grad() << std::endl;\n \n}<commit_msg>changed name<commit_after>#include <iostream>\n#include <ctime>\n\n#include \"marian.h\"\n\nmarian::Var layer(size_t max) {\n \n using namespace marian;\n \n Var x0 = 1, x1 = 2, x2 = 3;\n Var y = 0.0;\n for(int i = 0; i < max; i++) {\n Var xi = i;\n y = y + x0 + log(x2) + x1;\n for(int j = 0; j < i; ++j) {\n y = y + xi;\n }\n }\n \n return y;\n}\n\nint main(int argc, char** argv) {\n srand(time(NULL));\n \n using namespace marian;\n \n Var y1 = layer(10);\n Var y2 = layer(rand() % 20 + 1);\n \n Var y = y1 + log(y2);\n \n set_zero_all_adjoints();\n y.calc_gradients();\n \n std::cerr << \"y1 = \" << y1.val() << std::endl;\n std::cerr << \"y2 = \" << y2.val() << std::endl;\n std::cerr << \"y = \" << y.val() << std::endl;\n \n std::cerr << \"dy\/dy1 = \" << y1.grad() << std::endl;\n std::cerr << \"dy\/dy2 = \" << y2.grad() << std::endl;\n \n}<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#define _USE_MATH_DEFINES\n#include <cmath>\n\n#include \"ics3\/ics\"\n\nint main(int argc, char **argv) {\n std::cout << \"angle of degree test section\" << std::endl;\n {\n ics::Angle degree = ics::Angle::createDegree();\n degree.set(0);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n degree.set(90);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n degree.set(60);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n try {\n degree.set(150);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"angle of radian test section\" << std::endl;\n ics::Angle radian = ics::Angle::createRadian();\n radian.set(0);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n radian.set(M_PI \/ 2);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n radian.set(M_PI \/ 3);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n try {\n radian.set(M_PI);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"parameter test section\" << std::endl;\n ics::Parameter current = ics::Parameter::current();\n current.set(30);\n std::cout << static_cast<int>(current.get()) << std::endl;\n try {\n current.set(70);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"EepParam test section\" << std::endl;\n ics::EepParam speed = ics::EepParam::speed();\n std::cout << speed.get() << std::endl;\n speed.set(100);\n std::cout << speed.get() << std::endl;\n try {\n speed.set(200);\n std::cerr << \"Never run this\" << std::endl;\n } catch (std::invalid_argument e) {\n std::cout << e.what() << std::endl;\n }\n }\n return 0;\n}\n<commit_msg>Update test.cpp for default value check<commit_after>#include <iostream>\n#define _USE_MATH_DEFINES\n#include <cmath>\n\n#include \"ics3\/ics\"\n\nint main(int argc, char **argv) {\n std::cout << \"angle of degree test section\" << std::endl;\n {\n ics::Angle degree = ics::Angle::createDegree();\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n degree.set(0);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n degree.set(90);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n degree.set(60);\n std::cout << degree.get() << ':' << degree.getRaw() << std::endl;\n try {\n degree.set(150);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"angle of radian test section\" << std::endl;\n ics::Angle radian = ics::Angle::createRadian();\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n radian.set(0);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n radian.set(M_PI \/ 2);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n radian.set(M_PI \/ 3);\n std::cout << radian.get() << ':' << radian.getRaw() << std::endl;\n try {\n radian.set(M_PI);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"parameter test section\" << std::endl;\n ics::Parameter current = ics::Parameter::current();\n std::cout << static_cast<int>(current.get()) << std::endl;\n current.set(30);\n std::cout << static_cast<int>(current.get()) << std::endl;\n try {\n current.set(70);\n std::cerr << \"Never run this\" << std::endl;\n } catch (const std::invalid_argument &e) {\n std::cout << e.what() << std::endl;\n }\n }\n {\n std::cout << std::endl << \"EepParam test section\" << std::endl;\n ics::EepParam speed = ics::EepParam::speed();\n std::cout << speed.get() << std::endl;\n speed.set(100);\n std::cout << speed.get() << std::endl;\n try {\n speed.set(200);\n std::cerr << \"Never run this\" << std::endl;\n } catch (std::invalid_argument e) {\n std::cout << e.what() << std::endl;\n }\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * client.cpp\n *\n * Handles the client env.\n *\n * Created by Ryan Faulkner on 2014-06-08\n * Copyright (c) 2014. All rights reserved.\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <regex>\n#include <assert.h>\n\n#include \"column_types.h\"\n#include \"redis.h\"\n#include \"md5.h\"\n#include \"index.h\"\n\n#define REDISHOST \"127.0.0.1\"\n#define REDISPORT 6379\n\nusing namespace std;\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisSet() {\n RedisHandler r;\n r.connect();\n r.write(\"foo\", \"bar\");\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisGet() {\n RedisHandler r;\n r.connect();\n cout << endl << \"VALUE FOR KEY foo\" << endl;\n cout << r.read(\"foo\") << endl << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisKeys() {\n RedisHandler r;\n std::vector<string>* vec;\n\n r.connect();\n vec = r.keys(\"*\");\n cout << \"KEY LIST FOR *\" << endl;\n for (std::vector<std::string>::iterator it = vec->begin() ; it != vec->end(); ++it) {\n cout << *it << endl;\n }\n cout << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisIO() {\n RedisHandler r;\n std::vector<string>* vec;\n std::string outTrue, outFalse = \"\";\n\n r.connect();\n r.write(\"test_key\", \"test value\");\n outTrue = r.read(\"test_key\");\n assert(std::strcmp(outTrue.c_str(), \"test value\") == 0);\n r.deleteKey(\"test_key\");\n assert(!r.exists(\"test_key\"));\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testMd5Hashing() {\n cout << endl << \"md5 of 'mykey': \" << md5(\"mykey\") << endl;\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testRegexForTypes() {\n IntegerColumn ic;\n FloatColumn fc;\n assert(ic.validate(\"1981\"));\n assert(fc.validate(\"5.2\"));\n cout << \"Passed regex tests.\" << endl;\n}\n\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testOrderPairAlphaNumeric() {\n IndexHandler ih;\n assert(std::strcmp(ih.orderPairAlphaNumeric(\"b\", \"a\").c_str(), \"a_b\") == 0);\n cout << \"Passed orderPairAlphaNumeric tests.\" << endl;\n}\n\n\/**\n * Test to ensure that relation entities are encoded properly\n *\/\nvoid testRelationJSONEntityEncoding() {\n \/\/ Create entities\n \/\/ Create relation in redis\n \/\/ Fetch the entity representation\n \/\/ assert\n}\n\n\n\/**\n * Test to ensure that relation fields are encoded properly\n *\/\nvoid testRelationJSONRelationEncoding() {\n \/\/ Create entities\n \/\/ Create relation in redis\n \/\/ Fetch the field representation\n \/\/ assert\n}\n\nint main() {\n cout << \"-- TESTS BEGIN --\" << endl << endl;\n\n\/\/ testRedisSet();\n\/\/ testRedisGet();\n\/\/ testRedisKeys();\n\/\/ md5Hashing();\n\/\/ testRedisIO();\n testRegexForTypes();\n testOrderPairAlphaNumeric();\n\n cout << endl << \"-- TESTS END --\" << endl;\n\n return 0;\n}\n<commit_msg>flesh out functional portion of entity encoding test<commit_after>\n\/*\n * client.cpp\n *\n * Handles the client env.\n *\n * Created by Ryan Faulkner on 2014-06-08\n * Copyright (c) 2014. All rights reserved.\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <regex>\n#include <assert.h>\n\n#include \"column_types.h\"\n#include \"redis.h\"\n#include \"md5.h\"\n#include \"index.h\"\n\n#define REDISHOST \"127.0.0.1\"\n#define REDISPORT 6379\n\nusing namespace std;\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisSet() {\n RedisHandler r;\n r.connect();\n r.write(\"foo\", \"bar\");\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisGet() {\n RedisHandler r;\n r.connect();\n cout << endl << \"VALUE FOR KEY foo\" << endl;\n cout << r.read(\"foo\") << endl << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisKeys() {\n RedisHandler r;\n std::vector<std::string> vec;\n\n r.connect();\n vec = r.keys(\"*\");\n cout << \"KEY LIST FOR *\" << endl;\n for (std::vector<std::string>::iterator it = vec.begin() ; it != vec.end(); ++it) {\n cout << *it << endl;\n }\n cout << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisIO() {\n RedisHandler r;\n std::vector<string>* vec;\n std::string outTrue, outFalse = \"\";\n\n r.connect();\n r.write(\"test_key\", \"test value\");\n outTrue = r.read(\"test_key\");\n assert(std::strcmp(outTrue.c_str(), \"test value\") == 0);\n r.deleteKey(\"test_key\");\n assert(!r.exists(\"test_key\"));\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testMd5Hashing() {\n cout << endl << \"md5 of 'mykey': \" << md5(\"mykey\") << endl;\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testRegexForTypes() {\n IntegerColumn ic;\n FloatColumn fc;\n assert(ic.validate(\"1981\"));\n assert(fc.validate(\"5.2\"));\n cout << \"Passed regex tests.\" << endl;\n}\n\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testOrderPairAlphaNumeric() {\n IndexHandler ih;\n assert(std::strcmp(ih.orderPairAlphaNumeric(\"b\", \"a\").c_str(), \"a_b\") == 0);\n cout << \"Passed orderPairAlphaNumeric tests.\" << endl;\n}\n\n\/**\n * Test to ensure that relation entities are encoded properly\n *\/\nvoid testJSONEntityEncoding() {\n IndexHandler ih;\n Json::Value* ret;\n std::vector<std::pair<ColumnBase*, std::string>>* fields_ent = new vector<std::pair<ColumnBase*, std::string>>;\n fields_ent->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n ih.writeEntity(\"test\", fields_ent);\n \/\/ Fetch the entity representation\n ret = ih.fetchEntity(\"test\");\n cout << ret->toStyledString() << endl;\n\n \/\/ TODO - assert\n \/\/ TODO - remove entity\n}\n\n\n\/**\n * Test to ensure that relation fields are encoded properly\n *\/\nvoid testRelationJSONRelationEncoding() {\n\/\/ IndexHandler ih;\n\/\/ std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_1 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_2 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<std::string, std::string>>* fields_rel_1 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<std::string, std::string>>* fields_rel_2 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/\n\/\/ \/\/ Popualate fields\n\/\/ fields_ent_1->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n\/\/ fields_ent_2->push_back(std::make_pair(getColumnType(\"string\"), \"b\"));\n\/\/ fields_rel_1->push_back(std::make_pair(\"a\", \"1\"));\n\/\/ fields_rel_2->push_back(std::make_pair(\"b\", \"hello\"));\n\/\/\n\/\/ \/\/ Create entities\n\/\/ ih.writeEntity(\"test_1\", fields_ent_1);\n\/\/ ih.writeEntity(\"test_2\", fields_ent_1);\n\/\/\n\/\/ \/\/ Create relation in redis\n\/\/ ih.writeRelation(\"test_1\", \"test_2\", fields_rel_1, fields_rel_2)\n\n \/\/ Fetch the entity representation\n\n \/\/ assert\n}\n\nint main() {\n cout << \"-- TESTS BEGIN --\" << endl << endl;\n\n\/\/ testRedisSet();\n\/\/ testRedisGet();\n\/\/ testRedisKeys();\n\/\/ md5Hashing();\n\/\/ testRedisIO();\n\/\/ testRegexForTypes();\n\/\/ testOrderPairAlphaNumeric();\n testJSONEntityEncoding();\n\n cout << endl << \"-- TESTS END --\" << endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2020 Intel Corporation. All Rights Reserved.\n\n#include \"hdr-merge.h\"\n\nnamespace librealsense\n{\n hdr_merge::hdr_merge()\n : generic_processing_block(\"HDR Merge\")\n {}\n\n \/\/ processing only framesets\n bool hdr_merge::should_process(const rs2::frame& frame)\n {\n if (!frame)\n return false;\n\n auto set = frame.as<rs2::frameset>();\n if (!set)\n return false;\n\n auto depth_frame = set.get_depth_frame();\n if (!depth_frame)\n return false;\n\n if (!depth_frame.supports_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_SIZE))\n return false;\n if (!depth_frame.supports_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID))\n return false;\n int depth_sequ_size = depth_frame.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_SIZE);\n if (depth_sequ_size != 2)\n return false;\n\n return true;\n }\n\n\n rs2::frame hdr_merge::process_frame(const rs2::frame_source& source, const rs2::frame& f)\n {\n \/\/ steps:\n \/\/ 1. get depth frame from incoming frameset\n \/\/ 2. add the frameset to vector of framesets\n \/\/ 3. check if size of this vector is at least 2 (if not - return latest merge frame)\n \/\/ 4. pop out both framesets from the vector\n \/\/ 5. apply merge algo\n \/\/ 6. save merge frame as latest merge frame\n \/\/ 7. return the merge frame\n\n \/\/ 1. get depth frame from incoming frameset\n auto fs = f.as<rs2::frameset>();\n auto depth_frame = fs.get_depth_frame();\n\n \/\/ 2. add the frameset to vector of framesets\n int depth_sequ_id = depth_frame.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n\n \/\/ condition added to ensure that frames are saved in the right order\n \/\/ to prevent for example the saving of frame with sequence id 1 before\n \/\/ saving frame of sequence id 0\n \/\/ so that the merging with be deterministic - always done with frame n and n+1\n \/\/ with frame n as basis\n if (_framesets.size() == depth_sequ_id)\n {\n _framesets[depth_sequ_id] = fs;\n }\n\n \/\/ 3. check if size of this vector is at least 2 (if not - return latest merge frame)\n if (_framesets.size() >= 2)\n {\n \/\/ 4. pop out both framesets from the vector\n rs2::frameset fs_0 = _framesets[0];\n rs2::frameset fs_1 = _framesets[1];\n _framesets.clear();\n\n bool use_ir = false;\n if (check_frames_mergeability(fs_0, fs_1, use_ir))\n {\n \/\/ 5. apply merge algo\n rs2::frame new_frame = merging_algorithm(source, fs_0, fs_1, use_ir);\n if (new_frame)\n {\n \/\/ 6. save merge frame as latest merge frame\n _depth_merged_frame = new_frame;\n }\n }\n else\n {\n discard_depth_merged_frame_if_needed(f);\n }\n }\n\n \/\/ 7. return the merge frame\n if (_depth_merged_frame)\n return _depth_merged_frame;\n\n return f;\n }\n\n void hdr_merge::discard_depth_merged_frame_if_needed(const rs2::frame& f)\n {\n \/\/ criteria for discarding saved merged_depth_frame:\n \/\/ if its frame counter is greater than the input frame\n auto depth_merged_frame_counter = _depth_merged_frame.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n auto input_frame_counter = f.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n if (depth_merged_frame_counter > input_frame_counter)\n {\n _depth_merged_frame = nullptr;\n }\n }\n\n bool hdr_merge::check_frames_mergeability(const rs2::frameset first_fs, const rs2::frameset second_fs,\n bool& use_ir) const\n {\n auto first_depth = first_fs.get_depth_frame();\n auto second_depth = second_fs.get_depth_frame();\n auto first_ir = first_fs.get_infrared_frame();\n auto second_ir = second_fs.get_infrared_frame();\n\n auto first_fs_frame_counter = first_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n auto second_fs_frame_counter = second_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n\n \/\/ The aim of this checking is that the output merged frame will have frame counter n and\n \/\/ frame counter n and will be created by frames n and n+1\n if (first_fs_frame_counter + 1 != second_fs_frame_counter)\n return false;\n\n use_ir = should_ir_be_used_for_merging(first_depth, first_ir, second_depth, second_ir);\n\n return true;\n }\n\n rs2::frame hdr_merge::merging_algorithm(const rs2::frame_source& source, const rs2::frameset first_fs, const rs2::frameset second_fs, const bool use_ir)\n {\n auto first = first_fs;\n auto second = second_fs;\n\n auto first_depth = first.get_depth_frame();\n auto second_depth = second.get_depth_frame();\n auto first_ir = first.get_infrared_frame();\n auto second_ir = second.get_infrared_frame();\n\n \/\/ new frame allocation\n auto vf = first_depth.as<rs2::depth_frame>();\n auto width = vf.get_width();\n auto height = vf.get_height();\n auto new_f = source.allocate_video_frame(first_depth.get_profile(), first_depth,\n vf.get_bytes_per_pixel(), width, height, vf.get_stride_in_bytes(), RS2_EXTENSION_DEPTH_FRAME);\n\n if (new_f)\n {\n auto ptr = dynamic_cast<librealsense::depth_frame*>((librealsense::frame_interface*)new_f.get());\n auto orig = dynamic_cast<librealsense::depth_frame*>((librealsense::frame_interface*)first_depth.get());\n\n auto d0 = (uint16_t*)first_depth.get_data();\n auto d1 = (uint16_t*)second_depth.get_data();\n\n auto new_data = (uint16_t*)ptr->get_frame_data();\n\n ptr->set_sensor(orig->get_sensor());\n\n memset(new_data, 0, width * height * sizeof(uint16_t));\n\n if (use_ir)\n {\n auto i0 = (uint8_t*)first_ir.get_data();\n auto i1 = (uint8_t*)second_ir.get_data();\n\n for (int i = 0; i < width * height; i++)\n {\n if (is_infrared_valid(i0[i]) && d0[i])\n new_data[i] = d0[i];\n else if (is_infrared_valid(i1[i]) && d1[i])\n new_data[i] = d1[i];\n else\n new_data[i] = 0;\n }\n }\n else\n {\n for (int i = 0; i < width * height; i++)\n {\n if (d0[i])\n new_data[i] = d0[i];\n else if (d1[i])\n new_data[i] = d1[i];\n else\n new_data[i] = 0;\n }\n }\n\n return new_f;\n }\n return first_fs;\n }\n\n bool hdr_merge::is_infrared_valid(uint8_t ir_value) const\n {\n return (ir_value > IR_UNDER_SATURATED_VALUE) && (ir_value < IR_OVER_SATURATED_VALUE);\n }\n\n bool hdr_merge::should_ir_be_used_for_merging(const rs2::depth_frame& first_depth, const rs2::video_frame& first_ir,\n const rs2::depth_frame& second_depth, const rs2::video_frame& second_ir) const\n {\n \/\/ checking ir frames are not null\n bool use_ir = (first_ir && second_ir);\n\n \/\/ checking frame counter of first depth and ir are the same\n if (use_ir)\n {\n int depth_frame_counter = static_cast<int>(first_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n int ir_frame_counter = static_cast<int>(first_ir.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n use_ir = (depth_frame_counter == ir_frame_counter);\n\n \/\/ checking frame counter of second depth and ir are the same\n if (use_ir)\n {\n depth_frame_counter = static_cast<int>(second_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n ir_frame_counter = static_cast<int>(second_ir.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n use_ir = (depth_frame_counter == ir_frame_counter);\n\n \/\/ checking sequence id of first depth and ir are the same\n if (use_ir)\n {\n auto depth_seq_id = first_depth.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n auto ir_seq_id = first_ir.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n use_ir = (depth_seq_id == ir_seq_id);\n\n \/\/ checking sequence id of second depth and ir are the same\n if (use_ir)\n {\n depth_seq_id = second_depth.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n ir_seq_id = second_ir.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n use_ir = (depth_seq_id == ir_seq_id);\n }\n }\n }\n }\n\n return use_ir;\n }\n}\n<commit_msg>Fix HDR on change of resolutions<commit_after>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2020 Intel Corporation. All Rights Reserved.\n\n#include \"hdr-merge.h\"\n\nnamespace librealsense\n{\n hdr_merge::hdr_merge()\n : generic_processing_block(\"HDR Merge\")\n {}\n\n \/\/ processing only framesets\n bool hdr_merge::should_process(const rs2::frame& frame)\n {\n if (!frame)\n return false;\n\n auto set = frame.as<rs2::frameset>();\n if (!set)\n return false;\n\n auto depth_frame = set.get_depth_frame();\n if (!depth_frame)\n return false;\n\n if (!depth_frame.supports_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_SIZE))\n return false;\n if (!depth_frame.supports_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID))\n return false;\n auto depth_seq_size = depth_frame.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_SIZE);\n if (depth_seq_size != 2)\n return false;\n\n return true;\n }\n\n\n rs2::frame hdr_merge::process_frame(const rs2::frame_source& source, const rs2::frame& f)\n {\n \/\/ steps:\n \/\/ 1. get depth frame from incoming frameset\n \/\/ 2. add the frameset to vector of framesets\n \/\/ 3. check if size of this vector is at least 2 (if not - return latest merge frame)\n \/\/ 4. pop out both framesets from the vector\n \/\/ 5. apply merge algo\n \/\/ 6. save merge frame as latest merge frame\n \/\/ 7. return the merge frame\n\n \/\/ 1. get depth frame from incoming frameset\n auto fs = f.as<rs2::frameset>();\n auto depth_frame = fs.get_depth_frame();\n\n \/\/ 2. add the frameset to vector of framesets\n auto depth_seq_id = depth_frame.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n\n \/\/ condition added to ensure that frames are saved in the right order\n \/\/ to prevent for example the saving of frame with sequence id 1 before\n \/\/ saving frame of sequence id 0\n \/\/ so that the merging with be deterministic - always done with frame n and n+1\n \/\/ with frame n as basis\n if (_framesets.size() == depth_seq_id)\n {\n _framesets[depth_seq_id] = fs;\n }\n\n \/\/ 3. check if size of this vector is at least 2 (if not - return latest merge frame)\n if (_framesets.size() >= 2)\n {\n \/\/ 4. pop out both framesets from the vector\n rs2::frameset fs_0 = _framesets[0];\n rs2::frameset fs_1 = _framesets[1];\n _framesets.clear();\n\n bool use_ir = false;\n if (check_frames_mergeability(fs_0, fs_1, use_ir))\n {\n \/\/ 5. apply merge algo\n rs2::frame new_frame = merging_algorithm(source, fs_0, fs_1, use_ir);\n if (new_frame)\n {\n \/\/ 6. save merge frame as latest merge frame\n _depth_merged_frame = new_frame;\n }\n }\n else\n {\n discard_depth_merged_frame_if_needed(f);\n }\n }\n\n \/\/ 7. return the merge frame\n if (_depth_merged_frame)\n return _depth_merged_frame;\n\n return f;\n }\n\n void hdr_merge::discard_depth_merged_frame_if_needed(const rs2::frame& f)\n {\n if (_depth_merged_frame)\n {\n \/\/ criteria for discarding saved merged_depth_frame:\n \/\/ 1 - frame counter for merged depth is greater than the input frame\n \/\/ 2 - resolution change\n auto depth_merged_frame_counter = _depth_merged_frame.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n auto input_frame_counter = f.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n\n auto merged_d_profile = _depth_merged_frame.get_profile().as<rs2::video_stream_profile>();\n auto new_d_profile = f.get_profile().as<rs2::video_stream_profile>();\n\n if ((depth_merged_frame_counter > input_frame_counter) ||\n (merged_d_profile.width() != new_d_profile.width()) ||\n (merged_d_profile.height() != new_d_profile.height()))\n {\n _depth_merged_frame = nullptr;\n }\n }\n }\n\n bool hdr_merge::check_frames_mergeability(const rs2::frameset first_fs, const rs2::frameset second_fs,\n bool& use_ir) const\n {\n auto first_depth = first_fs.get_depth_frame();\n auto second_depth = second_fs.get_depth_frame();\n auto first_ir = first_fs.get_infrared_frame();\n auto second_ir = second_fs.get_infrared_frame();\n\n auto first_fs_frame_counter = first_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n auto second_fs_frame_counter = second_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER);\n\n \/\/ The aim of this checking is that the output merged frame will have frame counter n and\n \/\/ frame counter n and will be created by frames n and n+1\n if (first_fs_frame_counter + 1 != second_fs_frame_counter)\n return false;\n \/\/ Depth dimensions must align\n if ((first_depth.get_height() != second_depth.get_height()) ||\n (first_depth.get_width() != second_depth.get_width()))\n return false;\n\n use_ir = should_ir_be_used_for_merging(first_depth, first_ir, second_depth, second_ir);\n\n return true;\n }\n\n rs2::frame hdr_merge::merging_algorithm(const rs2::frame_source& source, const rs2::frameset first_fs, const rs2::frameset second_fs, const bool use_ir)\n {\n auto first = first_fs;\n auto second = second_fs;\n\n auto first_depth = first.get_depth_frame();\n auto second_depth = second.get_depth_frame();\n auto first_ir = first.get_infrared_frame();\n auto second_ir = second.get_infrared_frame();\n\n \/\/ new frame allocation\n auto vf = first_depth.as<rs2::depth_frame>();\n auto width = vf.get_width();\n auto height = vf.get_height();\n auto new_f = source.allocate_video_frame(first_depth.get_profile(), first_depth,\n vf.get_bytes_per_pixel(), width, height, vf.get_stride_in_bytes(), RS2_EXTENSION_DEPTH_FRAME);\n\n if (new_f)\n {\n auto ptr = dynamic_cast<librealsense::depth_frame*>((librealsense::frame_interface*)new_f.get());\n auto orig = dynamic_cast<librealsense::depth_frame*>((librealsense::frame_interface*)first_depth.get());\n\n auto d0 = (uint16_t*)first_depth.get_data();\n auto d1 = (uint16_t*)second_depth.get_data();\n\n auto new_data = (uint16_t*)ptr->get_frame_data();\n\n ptr->set_sensor(orig->get_sensor());\n\n memset(new_data, 0, width * height * sizeof(uint16_t));\n\n if (use_ir)\n {\n auto i0 = (uint8_t*)first_ir.get_data();\n auto i1 = (uint8_t*)second_ir.get_data();\n\n for (int i = 0; i < width * height; i++)\n {\n if (is_infrared_valid(i0[i]) && d0[i])\n new_data[i] = d0[i];\n else if (is_infrared_valid(i1[i]) && d1[i])\n new_data[i] = d1[i];\n else\n new_data[i] = 0;\n }\n }\n else\n {\n for (int i = 0; i < width * height; i++)\n {\n if (d0[i])\n new_data[i] = d0[i];\n else if (d1[i])\n new_data[i] = d1[i];\n else\n new_data[i] = 0;\n }\n }\n\n return new_f;\n }\n return first_fs;\n }\n\n bool hdr_merge::is_infrared_valid(uint8_t ir_value) const\n {\n return (ir_value > IR_UNDER_SATURATED_VALUE) && (ir_value < IR_OVER_SATURATED_VALUE);\n }\n\n bool hdr_merge::should_ir_be_used_for_merging(const rs2::depth_frame& first_depth, const rs2::video_frame& first_ir,\n const rs2::depth_frame& second_depth, const rs2::video_frame& second_ir) const\n {\n \/\/ checking ir frames are not null\n bool use_ir = (first_ir && second_ir);\n\n \/\/ IR and Depth dimensions must be aligned\n if ((first_depth.get_height() != first_ir.get_height()) ||\n (first_depth.get_width() != first_ir.get_width()) ||\n (second_ir.get_height() != first_ir.get_height()) ||\n (second_ir.get_width() != first_ir.get_width()))\n use_ir = false;\n\n \/\/ checking frame counter of first depth and ir are the same\n if (use_ir)\n {\n int depth_frame_counter = static_cast<int>(first_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n int ir_frame_counter = static_cast<int>(first_ir.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n use_ir = (depth_frame_counter == ir_frame_counter);\n\n \/\/ checking frame counter of second depth and ir are the same\n if (use_ir)\n {\n depth_frame_counter = static_cast<int>(second_depth.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n ir_frame_counter = static_cast<int>(second_ir.get_frame_metadata(RS2_FRAME_METADATA_FRAME_COUNTER));\n use_ir = (depth_frame_counter == ir_frame_counter);\n\n \/\/ checking sequence id of first depth and ir are the same\n if (use_ir)\n {\n auto depth_seq_id = first_depth.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n auto ir_seq_id = first_ir.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n use_ir = (depth_seq_id == ir_seq_id);\n\n \/\/ checking sequence id of second depth and ir are the same\n if (use_ir)\n {\n depth_seq_id = second_depth.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n ir_seq_id = second_ir.get_frame_metadata(RS2_FRAME_METADATA_SUBPRESET_SEQUENCE_ID);\n use_ir = (depth_seq_id == ir_seq_id);\n }\n }\n }\n }\n\n return use_ir;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/proj_transform.hpp>\n#include <mapnik\/utils.hpp>\n\/\/ proj4\n#include <proj_api.h>\n\nnamespace mapnik {\n \nproj_transform::proj_transform(projection const& source, \n projection const& dest)\n : source_(source),\n dest_(dest) \n{\n is_source_longlat_ = source_.is_geographic();\n is_dest_longlat_ = dest_.is_geographic();\n is_source_equal_dest_ = (source_ == dest_);\n}\n\nbool proj_transform::equal() const\n{\n return is_source_equal_dest_;\n}\n\nbool proj_transform::forward (double & x, double & y , double & z) const\n{\n if (is_source_equal_dest_)\n return true;\n\n if (is_source_longlat_)\n {\n x *= DEG_TO_RAD;\n y *= DEG_TO_RAD;\n }\n\n#if defined(MAPNIK_THREADSAFE) && PJ_VERSION < 480\n mutex::scoped_lock lock(projection::mutex_);\n#endif\n \n if (pj_transform( source_.proj_, dest_.proj_, 1, \n 0, &x,&y,&z) != 0)\n {\n return false;\n }\n \n if (is_dest_longlat_)\n {\n x *= RAD_TO_DEG;\n y *= RAD_TO_DEG;\n }\n \n return true;\n} \n \nbool proj_transform::backward (double & x, double & y , double & z) const\n{\n if (is_source_equal_dest_)\n return true;\n \n if (is_dest_longlat_)\n {\n x *= DEG_TO_RAD;\n y *= DEG_TO_RAD;\n }\n \n#if defined(MAPNIK_THREADSAFE) && PJ_VERSION < 480\n mutex::scoped_lock lock(projection::mutex_);\n#endif\n\n if (pj_transform( dest_.proj_, source_.proj_, 1, \n 0, &x,&y,&z) != 0)\n {\n return false;\n }\n \n if (is_source_longlat_)\n {\n x *= RAD_TO_DEG;\n y *= RAD_TO_DEG;\n }\n \n return true;\n}\n\nbool proj_transform::forward (box2d<double> & box) const\n{\n if (is_source_equal_dest_)\n return true;\n double minx = box.minx();\n double miny = box.miny();\n double maxx = box.maxx();\n double maxy = box.maxy();\n double z = 0.0;\n bool ok0 = forward(minx,miny,z);\n bool ok1 = forward(maxx,maxy,z);\n box.init(minx,miny,maxx,maxy);\n return ok0 & ok1;\n} \n \nbool proj_transform::backward (box2d<double> & box) const\n{\n if (is_source_equal_dest_)\n return true;\n\n double minx = box.minx();\n double miny = box.miny();\n double maxx = box.maxx();\n double maxy = box.maxy();\n double z = 0.0;\n bool ok0 = backward(minx,miny,z);\n bool ok1 = backward(maxx,maxy,z);\n box.init(minx,miny,maxx,maxy);\n return ok0 & ok1;\n}\n\nmapnik::projection const& proj_transform::source() const\n{\n return source_;\n}\nmapnik::projection const& proj_transform::dest() const\n{\n return dest_;\n}\n \n}\n<commit_msg>fix return from proj_transform when coordinates cannot be reprojected<commit_after>\/*****************************************************************************\n * \n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2006 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/$Id$\n\n\/\/ mapnik\n#include <mapnik\/proj_transform.hpp>\n#include <mapnik\/utils.hpp>\n\/\/ proj4\n#include <proj_api.h>\n\nnamespace mapnik {\n \nproj_transform::proj_transform(projection const& source, \n projection const& dest)\n : source_(source),\n dest_(dest) \n{\n is_source_longlat_ = source_.is_geographic();\n is_dest_longlat_ = dest_.is_geographic();\n is_source_equal_dest_ = (source_ == dest_);\n}\n\nbool proj_transform::equal() const\n{\n return is_source_equal_dest_;\n}\n\nbool proj_transform::forward (double & x, double & y , double & z) const\n{\n if (is_source_equal_dest_)\n return true;\n\n if (is_source_longlat_)\n {\n x *= DEG_TO_RAD;\n y *= DEG_TO_RAD;\n }\n\n#if defined(MAPNIK_THREADSAFE) && PJ_VERSION < 480\n mutex::scoped_lock lock(projection::mutex_);\n#endif\n \n if (pj_transform( source_.proj_, dest_.proj_, 1, \n 0, &x,&y,&z) != 0)\n {\n return false;\n }\n \n if (is_dest_longlat_)\n {\n x *= RAD_TO_DEG;\n y *= RAD_TO_DEG;\n }\n \n return true;\n} \n \nbool proj_transform::backward (double & x, double & y , double & z) const\n{\n if (is_source_equal_dest_)\n return true;\n \n if (is_dest_longlat_)\n {\n x *= DEG_TO_RAD;\n y *= DEG_TO_RAD;\n }\n \n#if defined(MAPNIK_THREADSAFE) && PJ_VERSION < 480\n mutex::scoped_lock lock(projection::mutex_);\n#endif\n\n if (pj_transform( dest_.proj_, source_.proj_, 1, \n 0, &x,&y,&z) != 0)\n {\n return false;\n }\n \n if (is_source_longlat_)\n {\n x *= RAD_TO_DEG;\n y *= RAD_TO_DEG;\n }\n \n return true;\n}\n\nbool proj_transform::forward (box2d<double> & box) const\n{\n if (is_source_equal_dest_)\n return true;\n double minx = box.minx();\n double miny = box.miny();\n double maxx = box.maxx();\n double maxy = box.maxy();\n double z = 0.0;\n if (!forward(minx,miny,z))\n return false;\n if (!forward(maxx,maxy,z))\n return false;\n box.init(minx,miny,maxx,maxy);\n return true;\n} \n \nbool proj_transform::backward (box2d<double> & box) const\n{\n if (is_source_equal_dest_)\n return true;\n\n double minx = box.minx();\n double miny = box.miny();\n double maxx = box.maxx();\n double maxy = box.maxy();\n double z = 0.0;\n if (!backward(minx,miny,z))\n return false;\n if (!backward(maxx,maxy,z))\n return false;\n box.init(minx,miny,maxx,maxy);\n return true;\n}\n\nmapnik::projection const& proj_transform::source() const\n{\n return source_;\n}\nmapnik::projection const& proj_transform::dest() const\n{\n return dest_;\n}\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ros\/ros.h\"\n#include <gtest\/gtest.h>\n#include <Eigen\/Dense>\n#include \"geometry_msgs\/Wrench.h\"\n#include \"uranus_dp\/State.h\"\n\nclass ControllerTest : public ::testing::Test {\npublic:\n ControllerTest()\n {\n state_pub_ = node_handle_.advertise<uranus_dp::State>(\"state\", 5);\n setpoint_pub_ = node_handle_.advertise<uranus_dp::State>(\"setpoint\", 5);\n subscriber_ = node_handle_.subscribe(\"control_input\", 5, &ControllerTest::Callback, this);\n message_received_ = false;\n }\n\n void SetUp()\n {\n while (!IsNodeReady())\n {\n ros::spinOnce();\n }\n }\n\n \/\/ void PublishState(Eigen::Vector3 p, Eigen::Quaternion q, Eigen::Vector3 v, eigen::Vector3 omega)\n \/\/ {\n \/\/ uranus_dp::Wrench msg;\n \/\/ msg.force.x = surge * NORMALIZATION * SCALING_LIN;\n \/\/ msg.force.y = sway * NORMALIZATION * SCALING_LIN;\n \/\/ msg.force.z = heave * NORMALIZATION * SCALING_LIN;\n \/\/ msg.torque.x = roll * NORMALIZATION * SCALING_ANG;\n \/\/ msg.torque.y = pitch * NORMALIZATION * SCALING_ANG;\n \/\/ msg.torque.z = yaw * NORMALIZATION * SCALING_ANG;\n \/\/ publisher_.publish(msg);\n \/\/ }\n\n \/\/ void PublishSetpoint()\n\n void WaitForMessage()\n {\n while(!message_received_)\n {\n ros::spinOnce();\n }\n }\n\n static const double EPSILON = 1e-6; \/\/ Max absolute error \n\n private:\n ros::NodeHandle node_handle_;\n ros::Publisher state_pub_;\n ros::Publisher setpoint_pub_;\n ros::Subscriber subscriber_;\n bool message_received_;\n\n void Callback(const geometry_msgs::Wrench& msg)\n {\n message_received_ = true;\n }\n\n bool IsNodeReady()\n {\n return (state_pub_.getNumSubscribers() > 0) && (setpoint_pub_.getNumSubscribers() > 0) && (subscriber_.getNumPublishers() > 0);\n }\n};\n\nTEST_F(ControllerTest, CheckResponsiveness)\n{\n \/\/ Publish(1, 2, 3, 4, 5, 5);\n \/\/ WaitForMessage();\n ASSERT_TRUE(true);\n}\n\nint main(int argc, char **argv)\n{\n testing::InitGoogleTest(&argc, argv);\n ros::init(argc, argv, \"controller_test\");\n ROS_INFO(\"Launching node controller_test.\");\n\n int ret = RUN_ALL_TESTS();\n ros::shutdown();\n return ret;\n}\n<commit_msg>Write zero error zero output test<commit_after>#include \"ros\/ros.h\"\n#include <gtest\/gtest.h>\n#include <Eigen\/Dense>\n#include <eigen_conversions\/eigen_msg.h>\n#include \"geometry_msgs\/Wrench.h\"\n#include \"uranus_dp\/State.h\"\n\nclass ControllerTest : public ::testing::Test {\npublic:\n ControllerTest()\n {\n state_pub_ = node_handle_.advertise<uranus_dp::State>(\"state\", 1);\n setpoint_pub_ = node_handle_.advertise<uranus_dp::State>(\"setpoint\", 1);\n subscriber_ = node_handle_.subscribe(\"control_input\", 5, &ControllerTest::Callback, this);\n message_received_ = false;\n }\n\n void SetUp()\n {\n while (!IsNodeReady())\n {\n ros::spinOnce();\n }\n }\n\n void PublishState(Eigen::Vector3d p, Eigen::Quaterniond q, Eigen::Vector3d v, Eigen::Vector3d omega)\n {\n uranus_dp::State msg;\n msg.pose.position.x = p(0);\n msg.pose.position.y = p(1);\n msg.pose.position.z = p(2);\n msg.pose.orientation.x = q.w();\n msg.pose.orientation.y = q.x();\n msg.pose.orientation.z = q.y();\n msg.pose.orientation.w = q.z();\n msg.twist.linear.x = v(0);\n msg.twist.linear.y = v(1);\n msg.twist.linear.z = v(2);\n msg.twist.angular.x = omega(0);\n msg.twist.angular.y = omega(1);\n msg.twist.angular.z = omega(2);\n state_pub_.publish(msg);\n }\n\n void PublishSetpoint(Eigen::Vector3d p, Eigen::Quaterniond q, Eigen::Vector3d v, Eigen::Vector3d omega)\n {\n uranus_dp::State msg;\n msg.pose.position.x = p(0);\n msg.pose.position.y = p(1);\n msg.pose.position.z = p(2);\n msg.pose.orientation.x = q.w();\n msg.pose.orientation.y = q.x();\n msg.pose.orientation.z = q.y();\n msg.pose.orientation.w = q.z();\n msg.twist.linear.x = v(0);\n msg.twist.linear.y = v(1);\n msg.twist.linear.z = v(2);\n msg.twist.angular.x = omega(0);\n msg.twist.angular.y = omega(1);\n msg.twist.angular.z = omega(2);\n setpoint_pub_.publish(msg);\n }\n\n void WaitForMessage()\n {\n message_received_ = false;\n while (!message_received_)\n {\n ros::spinOnce();\n }\n }\n\n Eigen::Matrix<double,6,1> tau_;\n static const double EPSILON = 1e-6; \/\/ Max absolute error (Newton or Newton meters)\n\n private:\n ros::NodeHandle node_handle_;\n ros::Publisher state_pub_;\n ros::Publisher setpoint_pub_;\n ros::Subscriber subscriber_;\n bool message_received_;\n\n void Callback(const geometry_msgs::Wrench& msg)\n {\n tf::wrenchMsgtoEigen(msg, tau_);\n message_received_ = true;\n }\n\n bool IsNodeReady()\n {\n return (state_pub_.getNumSubscribers() > 0) && (setpoint_pub_.getNumSubscribers() > 0) && (subscriber_.getNumPublishers() > 0);\n }\n};\n\n \/*\n * Make sure we receive messages at all.\n *\/\nTEST_F(ControllerTest, CheckResponsiveness)\n{\n WaitForMessage();\n ASSERT_TRUE(true);\n}\n\n \/*\n * Input zero speed and nonzero pose. Input same pose state and pose setpoint. Expect zero output.\n *\/\nTEST_F(ControllerTest, ZeroErrorZeroOutput)\n{\n Eigen::Vector3d p(1,2,3);\n Eigen::Quaterniond q(4,5,6,7);\n q.normalize();\n\n Eigen::Vector3d v(0,0,0);\n Eigen::Vector3d omega(0,0,0);\n\n PublishState(p, q, v, omega);\n PublishSetpoint(p, q, v, omega);\n\n WaitForMessage();\n\n EXPECT_NEAR(tau_(0), 0, EPSILON);\n EXPECT_NEAR(tau_(1), 0, EPSILON);\n EXPECT_NEAR(tau_(2), 0, EPSILON);\n EXPECT_NEAR(tau_(3), 0, EPSILON);\n EXPECT_NEAR(tau_(4), 0, EPSILON);\n EXPECT_NEAR(tau_(5), 0, EPSILON);\n}\n\nint main(int argc, char **argv)\n{\n testing::InitGoogleTest(&argc, argv);\n ros::init(argc, argv, \"controller_test\");\n ROS_INFO(\"Launching node controller_test.\");\n\n int ret = RUN_ALL_TESTS();\n ros::shutdown();\n return ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string.h>\n\n#include \"topic.h\"\n\nusing namespace std;\n\nconst char* keyProducerStr = \"producer_head\";\nconst char* keyConsumerStr = \"consumer_head_%s\";\n\nint descCmp(const MDB_val *a, const MDB_val *b) {\n \/* DESC order in size *\/\n if (a->mv_size > b->mv_size) return -1;\n if (a->mv_size < b->mv_size) return 1;\n\n switch (a->mv_size)\n {\n case sizeof(uint32_t) :\n return mdbIntCmp<uint32_t>(a, b);\n case sizeof(uint64_t) :\n return mdbIntCmp<uint64_t>(a, b);\n default:\n return memcmp(a->mv_data, b->mv_data, a->mv_size);\n }\n}\n\nTopic::Topic(Env* env, const string& name) : _env(env), _name(name) {\n Txn txn(env, NULL);\n int rc = mdb_dbi_open(txn.getEnvTxn(), name.c_str(), MDB_CREATE, &_desc);\n if (rc != 0) {\n printf(\"Topic open error.\\n%s\\n\", mdb_strerror(rc));\n return;\n }\n\n mdb_set_compare(txn.getEnvTxn(), _desc, descCmp);\n\n MDB_val key{ 0, 0 }, val{ 0, 0 };\n\n uint64_t head = 0;\n key.mv_data = (void*)keyProducerStr;\n key.mv_size = strlen(keyProducerStr);\n val.mv_data = &head;\n val.mv_size = sizeof(head);\n rc = mdb_put(txn.getEnvTxn(), _desc, &key, &val, MDB_NOOVERWRITE);\n\n if (rc == 0) {\n uint32_t headFile = 0;\n key.mv_data = &headFile;\n key.mv_size = sizeof(headFile);\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, MDB_NOOVERWRITE);\n }\n\n txn.commit();\n}\n\nTopic::~Topic() {\n mdb_dbi_close(_env->getMdbEnv(), _desc);\n}\n\nuint32_t Topic::getProducerHeadFile(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n cur.gotoLast();\n return *(uint32_t*)cur.key().mv_data;\n}\n\nvoid Topic::setProducerHeadFile(Txn& txn, uint32_t file, uint64_t offset) {\n MDB_val key{ sizeof(file), &file},\n val{ sizeof(offset), &offset };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nuint64_t Topic::getProducerHead(Txn& txn) {\n MDB_val key{ strlen(keyProducerStr), (void*)keyProducerStr },\n val{ 0, 0 };\n\n mdb_get(txn.getEnvTxn(), _desc, &key, &val);\n return *(uint64_t*)val.mv_data;\n}\n\nvoid Topic::setProducerHead(Txn& txn, uint64_t head) {\n MDB_val key{ strlen(keyProducerStr), (void*)keyProducerStr },\n val{ sizeof(head), &head };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nuint32_t Topic::getConsumerHeadFile(Txn& txn, const std::string& name, uint32_t searchFrom) {\n char keyStr[4096];\n sprintf(keyStr, keyConsumerStr, name.c_str());\n\n}\n\nuint64_t Topic::getConsumerHead(Txn& txn, const std::string& name) {\n char keyStr[4096];\n sprintf(keyStr, keyConsumerStr, name.c_str());\n\n MDB_val key{ strlen(keyStr), keyStr }, val{ 0, nullptr };\n int rc = mdb_get(txn.getEnvTxn(), _desc, &key, &val);\n if (rc == 0) {\n return *(uint64_t*)val.mv_data;\n } else {\n if (rc != MDB_NOTFOUND) cout << \"Consumer seek error: \" << mdb_strerror(rc) << endl;\n\n }\n}\n\nvoid Topic::setConsumerHead(Txn& txn, const std::string& name, uint64_t head) {\n char keyStr[4096];\n sprintf(keyStr, keyConsumerStr, name.c_str());\n\n MDB_val key{ strlen(keyStr), keyStr },\n val{ sizeof(head), &head };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nint Topic::getChunkFilePath(char* buf, uint32_t chunkSeq) {\n return sprintf(buf, \"%s\/%s.%d\", getEnv()->getRoot().c_str(), getName().c_str(), chunkSeq);\n}\n\nsize_t Topic::countChunks(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n\n size_t count = 0;\n uint32_t minFile = 0;\n int rc = cur.gte(minFile);\n\n while (rc == 0 && cur.key().mv_size == 4) {\n ++count;\n rc = cur.next();\n }\n\n return count;\n}\n\nvoid Topic::removeOldestChunk(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n\n uint32_t oldest = 0;\n int rc = cur.gte(oldest);\n if (rc == 0 && cur.key().mv_size == sizeof(oldest)) {\n oldest = *(uint32_t*)cur.key().mv_data;\n cur.del();\n\n char path[4096];\n getChunkFilePath(path, oldest);\n remove(path);\n strcat(path, \"-lock\");\n remove(path);\n }\n}\n<commit_msg>Topic consumer related.<commit_after>#include <string.h>\n\n#include \"topic.h\"\n\nusing namespace std;\n\nconst char* keyProducerStr = \"producer_head\";\nconst char* keyConsumerStr = \"consumer_head_%s\";\n\nint descCmp(const MDB_val *a, const MDB_val *b) {\n \/* DESC order in size *\/\n if (a->mv_size > b->mv_size) return -1;\n if (a->mv_size < b->mv_size) return 1;\n\n switch (a->mv_size)\n {\n case sizeof(uint32_t) :\n return mdbIntCmp<uint32_t>(a, b);\n case sizeof(uint64_t) :\n return mdbIntCmp<uint64_t>(a, b);\n default:\n return memcmp(a->mv_data, b->mv_data, a->mv_size);\n }\n}\n\nTopic::Topic(Env* env, const string& name) : _env(env), _name(name) {\n Txn txn(env, NULL);\n int rc = mdb_dbi_open(txn.getEnvTxn(), name.c_str(), MDB_CREATE, &_desc);\n if (rc != 0) {\n printf(\"Topic open error.\\n%s\\n\", mdb_strerror(rc));\n return;\n }\n\n mdb_set_compare(txn.getEnvTxn(), _desc, descCmp);\n\n MDB_val key{ 0, 0 }, val{ 0, 0 };\n\n uint64_t head = 0;\n key.mv_data = (void*)keyProducerStr;\n key.mv_size = strlen(keyProducerStr);\n val.mv_data = &head;\n val.mv_size = sizeof(head);\n rc = mdb_put(txn.getEnvTxn(), _desc, &key, &val, MDB_NOOVERWRITE);\n\n if (rc == 0) {\n uint32_t headFile = 0;\n key.mv_data = &headFile;\n key.mv_size = sizeof(headFile);\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, MDB_NOOVERWRITE);\n }\n\n txn.commit();\n}\n\nTopic::~Topic() {\n mdb_dbi_close(_env->getMdbEnv(), _desc);\n}\n\nuint32_t Topic::getProducerHeadFile(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n cur.gotoLast();\n return cur.key<uint32_t>();\n}\n\nvoid Topic::setProducerHeadFile(Txn& txn, uint32_t file, uint64_t offset) {\n MDB_val key{ sizeof(file), &file},\n val{ sizeof(offset), &offset };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nuint64_t Topic::getProducerHead(Txn& txn) {\n MDB_val key{ strlen(keyProducerStr), (void*)keyProducerStr },\n val{ 0, 0 };\n\n mdb_get(txn.getEnvTxn(), _desc, &key, &val);\n return *(uint64_t*)val.mv_data;\n}\n\nvoid Topic::setProducerHead(Txn& txn, uint64_t head) {\n MDB_val key{ strlen(keyProducerStr), (void*)keyProducerStr },\n val{ sizeof(head), &head };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nuint32_t Topic::getConsumerHeadFile(Txn& txn, const std::string& name, uint32_t searchFrom) {\n uint64_t head = getConsumerHead(txn, name);\n\n MDBCursor cur(_desc, txn.getEnvTxn());\n int rc = cur.gte(searchFrom);\n uint32_t ret = cur.key<uint32_t>();\n uint64_t fh = cur.val<uint64_t>();\n while (rc && head > fh) {\n rc = cur.next();\n if (rc == 0) {\n uint64_t ch = cur.val<uint64_t>();\n if (head < ch) {\n return ret;\n } else {\n ret = cur.key<uint32_t>();\n fh = ch;\n }\n }\n }\n\n return ret;\n}\n\nuint64_t Topic::getConsumerHead(Txn& txn, const std::string& name) {\n char keyStr[4096];\n sprintf(keyStr, keyConsumerStr, name.c_str());\n\n MDB_val key{ strlen(keyStr), keyStr }, val{ 0, nullptr };\n int rc = mdb_get(txn.getEnvTxn(), _desc, &key, &val);\n if (rc == 0) {\n return *(uint64_t*)val.mv_data;\n } else {\n if (rc != MDB_NOTFOUND) cout << \"Consumer seek error: \" << mdb_strerror(rc) << endl;\n\n MDBCursor cur(_desc, txn.getEnvTxn());\n cur.gte(uint32_t(0));\n return cur.val<uint64_t>();\n }\n}\n\nvoid Topic::setConsumerHead(Txn& txn, const std::string& name, uint64_t head) {\n char keyStr[4096];\n sprintf(keyStr, keyConsumerStr, name.c_str());\n\n MDB_val key{ strlen(keyStr), keyStr },\n val{ sizeof(head), &head };\n\n mdb_put(txn.getEnvTxn(), _desc, &key, &val, 0);\n}\n\nint Topic::getChunkFilePath(char* buf, uint32_t chunkSeq) {\n return sprintf(buf, \"%s\/%s.%d\", getEnv()->getRoot().c_str(), getName().c_str(), chunkSeq);\n}\n\nsize_t Topic::countChunks(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n\n size_t count = 0;\n uint32_t minFile = 0;\n int rc = cur.gte(minFile);\n\n while (rc == 0 && cur.key().mv_size == 4) {\n ++count;\n rc = cur.next();\n }\n\n return count;\n}\n\nvoid Topic::removeOldestChunk(Txn& txn) {\n MDBCursor cur(_desc, txn.getEnvTxn());\n\n uint32_t oldest = 0;\n int rc = cur.gte(oldest);\n if (rc == 0 && cur.key().mv_size == sizeof(oldest)) {\n oldest = cur.key<int32_t>();\n cur.del();\n\n char path[4096];\n getChunkFilePath(path, oldest);\n remove(path);\n strcat(path, \"-lock\");\n remove(path);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <assert.h>\n\n#include <string>\n\nusing namespace std;\n\n#include \"game.h\"\n#include \"coordinate.h\"\n#include \"command.h\"\n#include \"io.h\"\n#include \"armor.h\"\n#include \"fight.h\"\n#include \"colors.h\"\n#include \"level.h\"\n#include \"rings.h\"\n#include \"misc.h\"\n#include \"weapons.h\"\n#include \"monster.h\"\n#include \"os.h\"\n#include \"player.h\"\n#include \"death.h\"\n\n#include \"traps.h\"\n\nstring const trap_names[] = {\n \"a trapdoor\",\n \"an arrow trap\",\n \"a sleeping gas trap\",\n \"a beartrap\",\n \"a teleport trap\",\n \"a poison dart trap\",\n \"a rust trap\",\n \"a mysterious trap\"\n};\n\nstatic enum trap_t\ntrap_door_player(void)\n{\n Game::new_level(Game::current_level + 1);\n io_msg(\"you fell into a trap!\");\n return T_DOOR;\n}\n\nstatic enum trap_t\ntrap_door_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s fell through the floor\", victim->get_name().c_str());\n }\n monster_remove_from_screen(&victim->get_position(), victim, false);\n return T_DOOR;\n}\n\nstatic enum trap_t\ntrap_bear_player(void)\n{\n player->become_stuck();\n io_msg(\"you are caught in a bear trap\");\n return T_BEAR;\n}\n\nstatic enum trap_t\ntrap_bear_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s was caught in a bear trap\", victim->get_name().c_str());\n }\n victim->set_stuck();\n return T_BEAR;\n}\n\nstatic enum trap_t\ntrap_myst_player(void)\n{\n switch(os_rand_range(11))\n {\n case 0: io_msg(\"you are suddenly in a parallel dimension\"); break;\n case 1: io_msg(\"the light in here suddenly seems %s\", color_random().c_str()); break;\n case 2: io_msg(\"you feel a sting in the side of your neck\"); break;\n case 3: io_msg(\"multi-colored lines swirl around you, then fade\"); break;\n case 4: io_msg(\"a %s light flashes in your eyes\", color_random().c_str()); break;\n case 5: io_msg(\"a spike shoots past your ear!\"); break;\n case 6: io_msg(\"%s sparks dance across your armor\", color_random().c_str()); break;\n case 7: io_msg(\"you suddenly feel very thirsty\"); break;\n case 8: io_msg(\"you feel time speed up suddenly\"); break;\n case 9: io_msg(\"time now seems to be going slower\"); break;\n case 10: io_msg(\"you pack turns %s!\", color_random().c_str()); break;\n }\n return T_MYST;\n}\n\nstatic enum trap_t\ntrap_myst_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s seems to have stepped on something\", victim->get_name().c_str());\n }\n return T_MYST;\n}\n\nstatic enum trap_t\ntrap_sleep_player(void)\n{\n player->fall_asleep();\n io_msg_add(\"a strange white mist envelops you and \");\n return T_SLEEP;\n}\n\nstatic enum trap_t\ntrap_sleep_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s collapsed to the ground\", victim->get_name().c_str());\n }\n victim->set_held();\n return T_SLEEP;\n}\n\nstatic enum trap_t\ntrap_arrow_player(void)\n{\n if (fight_swing_hits(player->get_level() - 1, player->get_armor(), 1))\n {\n player->take_damage(roll(1, 6));\n if (player->get_health() <= 0)\n {\n io_msg(\"an arrow killed you\");\n death(DEATH_ARROW);\n }\n else\n io_msg(\"oh no! An arrow shot you\");\n }\n else\n {\n Item* arrow = weapon_create(ARROW, false);\n arrow->o_count = 1;\n arrow->set_pos(player->get_position());\n weapon_missile_fall(arrow, false);\n io_msg(\"an arrow shoots past you\");\n }\n return T_ARROW;\n}\n\nstatic enum trap_t\ntrap_arrow_monster(Monster* victim)\n{\n if (fight_swing_hits(victim->get_level() -1,\n victim->get_armor(), 1))\n {\n victim->take_damage(roll(1,6));\n if (victim->get_health() <= 0)\n {\n monster_on_death(victim, false);\n if (monster_seen_by_player(victim))\n io_msg(\"An arrow killed %s\", victim->get_name().c_str());\n }\n else if (monster_seen_by_player(victim))\n io_msg(\"An arrow shot %s\", victim->get_name().c_str());\n }\n else\n {\n Item* arrow = weapon_create(ARROW, false);\n arrow->o_count = 1;\n arrow->set_pos(victim->get_position());\n weapon_missile_fall(arrow, false);\n if (monster_seen_by_player(victim))\n io_msg(\"An arrow barely missed %s\", victim->get_name().c_str());\n }\n return T_ARROW;\n}\n\nstatic enum trap_t\ntrap_telep_player(Coordinate* trap_coord)\n{\n player->teleport(nullptr);\n Game::io->print_color(trap_coord->x, trap_coord->y, TRAP); \/* Mark trap before we leave *\/\n return T_TELEP;\n}\n\nstatic enum trap_t\ntrap_telep_monster(Monster* victim)\n{\n bool was_seen = monster_seen_by_player(victim);\n if (was_seen)\n {\n io_msg_add(\"%s \", victim->get_name().c_str());\n }\n\n monster_teleport(victim, nullptr);\n if (was_seen)\n {\n if (monster_seen_by_player(victim))\n io_msg(\"teleported a short distance\");\n else\n io_msg(\"disappeared\");\n }\n\n if (!was_seen && monster_seen_by_player(victim))\n {\n io_msg(\"%s appeared out of thin air\", victim->get_name().c_str());\n }\n\n return T_TELEP;\n}\n\nstatic enum trap_t\ntrap_dart_player(void)\n{\n if (!fight_swing_hits(player->get_level() + 1, player->get_armor(), 1))\n io_msg(\"a small dart whizzes by your ear and vanishes\");\n else\n {\n player->take_damage(roll(1, 4));\n if (player->get_health() <= 0)\n {\n io_msg(\"a poisoned dart killed you\");\n death(DEATH_DART);\n }\n if (!player->has_ring_with_ability(Ring::Type::SUSTSTR) &&\n !player->saving_throw(VS_POISON))\n player->modify_strength(-1);\n io_msg(\"a small dart just hit you in the shoulder\");\n }\n return T_DART;\n}\n\nstatic enum trap_t\ntrap_dart_monster(Monster* victim)\n{\n \/* TODO: In the future this should probably weaken the monster *\/\n if (fight_swing_hits(victim->get_level() + 1,\n victim->get_armor(), 1))\n {\n victim->take_damage(roll(1,4));\n if (victim->get_health() <= 0)\n {\n monster_on_death(victim, false);\n if (monster_seen_by_player(victim))\n {\n io_msg(\"A poisoned dart killed %s\", victim->get_name().c_str());\n }\n }\n else if (monster_seen_by_player(victim))\n {\n io_msg(\"An dart hit %s\", victim->get_name().c_str());\n }\n }\n else if (monster_seen_by_player(victim))\n {\n io_msg(\"A dart barely missed %s\", victim->get_name().c_str());\n }\n return T_DART;\n}\n\nstatic enum trap_t\ntrap_rust_player(void)\n{\n io_msg(\"a gush of water hits you on the head\");\n player->rust_armor();\n return T_RUST;\n}\n\nstatic enum trap_t\ntrap_rust_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"a gush of water hits %s\", victim->get_name().c_str());\n }\n return T_RUST;\n}\n\nenum trap_t\ntrap_spring(Monster* victim, Coordinate* trap_coord)\n{\n assert(trap_coord != nullptr);\n\n bool is_player = victim == nullptr;\n size_t tr = Game::level->get_trap_type(*trap_coord);\n\n if (is_player) {\n command_stop(true);\n }\n\n if (victim == nullptr || monster_seen_by_player(victim)) {\n Game::level->set_ch(*trap_coord, TRAP);\n Game::level->set_discovered(*trap_coord);\n }\n\n switch (tr)\n {\n case T_DOOR:\n if (is_player) return trap_door_player();\n else return trap_door_monster(victim);\n case T_BEAR:\n if (is_player) return trap_bear_player();\n else return trap_bear_monster(victim);\n case T_MYST:\n if (is_player) return trap_myst_player();\n else return trap_myst_monster(victim);\n case T_SLEEP:\n if (is_player) return trap_sleep_player();\n else return trap_sleep_monster(victim);\n case T_ARROW:\n if (is_player) return trap_arrow_player();\n else return trap_arrow_monster(victim);\n case T_TELEP:\n if (is_player) return trap_telep_player(trap_coord);\n else return trap_telep_monster(victim);\n case T_DART:\n if (is_player) return trap_dart_player();\n else return trap_dart_monster(victim);\n case T_RUST:\n if (is_player) return trap_rust_player();\n else return trap_rust_monster(victim);\n default:\n assert(0);\n return T_MYST;\n }\n}\n\n\n<commit_msg>don't use free'd memory<commit_after>#include <assert.h>\n\n#include <string>\n\nusing namespace std;\n\n#include \"game.h\"\n#include \"coordinate.h\"\n#include \"command.h\"\n#include \"io.h\"\n#include \"armor.h\"\n#include \"fight.h\"\n#include \"colors.h\"\n#include \"level.h\"\n#include \"rings.h\"\n#include \"misc.h\"\n#include \"weapons.h\"\n#include \"monster.h\"\n#include \"os.h\"\n#include \"player.h\"\n#include \"death.h\"\n\n#include \"traps.h\"\n\nstring const trap_names[] = {\n \"a trapdoor\",\n \"an arrow trap\",\n \"a sleeping gas trap\",\n \"a beartrap\",\n \"a teleport trap\",\n \"a poison dart trap\",\n \"a rust trap\",\n \"a mysterious trap\"\n};\n\nstatic enum trap_t\ntrap_door_player(void)\n{\n Game::new_level(Game::current_level + 1);\n io_msg(\"you fell into a trap!\");\n return T_DOOR;\n}\n\nstatic enum trap_t\ntrap_door_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s fell through the floor\", victim->get_name().c_str());\n }\n monster_remove_from_screen(&victim->get_position(), victim, false);\n return T_DOOR;\n}\n\nstatic enum trap_t\ntrap_bear_player(void)\n{\n player->become_stuck();\n io_msg(\"you are caught in a bear trap\");\n return T_BEAR;\n}\n\nstatic enum trap_t\ntrap_bear_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s was caught in a bear trap\", victim->get_name().c_str());\n }\n victim->set_stuck();\n return T_BEAR;\n}\n\nstatic enum trap_t\ntrap_myst_player(void)\n{\n switch(os_rand_range(11))\n {\n case 0: io_msg(\"you are suddenly in a parallel dimension\"); break;\n case 1: io_msg(\"the light in here suddenly seems %s\", color_random().c_str()); break;\n case 2: io_msg(\"you feel a sting in the side of your neck\"); break;\n case 3: io_msg(\"multi-colored lines swirl around you, then fade\"); break;\n case 4: io_msg(\"a %s light flashes in your eyes\", color_random().c_str()); break;\n case 5: io_msg(\"a spike shoots past your ear!\"); break;\n case 6: io_msg(\"%s sparks dance across your armor\", color_random().c_str()); break;\n case 7: io_msg(\"you suddenly feel very thirsty\"); break;\n case 8: io_msg(\"you feel time speed up suddenly\"); break;\n case 9: io_msg(\"time now seems to be going slower\"); break;\n case 10: io_msg(\"you pack turns %s!\", color_random().c_str()); break;\n }\n return T_MYST;\n}\n\nstatic enum trap_t\ntrap_myst_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s seems to have stepped on something\", victim->get_name().c_str());\n }\n return T_MYST;\n}\n\nstatic enum trap_t\ntrap_sleep_player(void)\n{\n player->fall_asleep();\n io_msg_add(\"a strange white mist envelops you and \");\n return T_SLEEP;\n}\n\nstatic enum trap_t\ntrap_sleep_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"%s collapsed to the ground\", victim->get_name().c_str());\n }\n victim->set_held();\n return T_SLEEP;\n}\n\nstatic enum trap_t\ntrap_arrow_player(void)\n{\n if (fight_swing_hits(player->get_level() - 1, player->get_armor(), 1))\n {\n player->take_damage(roll(1, 6));\n if (player->get_health() <= 0)\n {\n io_msg(\"an arrow killed you\");\n death(DEATH_ARROW);\n }\n else\n io_msg(\"oh no! An arrow shot you\");\n }\n else\n {\n Item* arrow = weapon_create(ARROW, false);\n arrow->o_count = 1;\n arrow->set_pos(player->get_position());\n weapon_missile_fall(arrow, false);\n io_msg(\"an arrow shoots past you\");\n }\n return T_ARROW;\n}\n\nstatic enum trap_t\ntrap_arrow_monster(Monster* victim)\n{\n if (fight_swing_hits(victim->get_level() -1,\n victim->get_armor(), 1))\n {\n victim->take_damage(roll(1,6));\n if (victim->get_health() <= 0)\n {\n if (monster_seen_by_player(victim))\n io_msg(\"An arrow killed %s\", victim->get_name().c_str());\n monster_on_death(victim, false);\n victim = nullptr;\n }\n else if (monster_seen_by_player(victim))\n io_msg(\"An arrow shot %s\", victim->get_name().c_str());\n }\n else\n {\n Item* arrow = weapon_create(ARROW, false);\n arrow->o_count = 1;\n arrow->set_pos(victim->get_position());\n weapon_missile_fall(arrow, false);\n if (monster_seen_by_player(victim))\n io_msg(\"An arrow barely missed %s\", victim->get_name().c_str());\n }\n return T_ARROW;\n}\n\nstatic enum trap_t\ntrap_telep_player(Coordinate* trap_coord)\n{\n player->teleport(nullptr);\n Game::io->print_color(trap_coord->x, trap_coord->y, TRAP); \/* Mark trap before we leave *\/\n return T_TELEP;\n}\n\nstatic enum trap_t\ntrap_telep_monster(Monster* victim)\n{\n bool was_seen = monster_seen_by_player(victim);\n if (was_seen)\n {\n io_msg_add(\"%s \", victim->get_name().c_str());\n }\n\n monster_teleport(victim, nullptr);\n if (was_seen)\n {\n if (monster_seen_by_player(victim))\n io_msg(\"teleported a short distance\");\n else\n io_msg(\"disappeared\");\n }\n\n if (!was_seen && monster_seen_by_player(victim))\n {\n io_msg(\"%s appeared out of thin air\", victim->get_name().c_str());\n }\n\n return T_TELEP;\n}\n\nstatic enum trap_t\ntrap_dart_player(void)\n{\n if (!fight_swing_hits(player->get_level() + 1, player->get_armor(), 1))\n io_msg(\"a small dart whizzes by your ear and vanishes\");\n else\n {\n player->take_damage(roll(1, 4));\n if (player->get_health() <= 0)\n {\n io_msg(\"a poisoned dart killed you\");\n death(DEATH_DART);\n }\n if (!player->has_ring_with_ability(Ring::Type::SUSTSTR) &&\n !player->saving_throw(VS_POISON))\n player->modify_strength(-1);\n io_msg(\"a small dart just hit you in the shoulder\");\n }\n return T_DART;\n}\n\nstatic enum trap_t\ntrap_dart_monster(Monster* victim)\n{\n \/* TODO: In the future this should probably weaken the monster *\/\n if (fight_swing_hits(victim->get_level() + 1,\n victim->get_armor(), 1))\n {\n victim->take_damage(roll(1,4));\n if (victim->get_health() <= 0)\n {\n if (monster_seen_by_player(victim))\n {\n io_msg(\"A poisoned dart killed %s\", victim->get_name().c_str());\n }\n monster_on_death(victim, false);\n victim = nullptr;\n }\n else if (monster_seen_by_player(victim))\n {\n io_msg(\"An dart hit %s\", victim->get_name().c_str());\n }\n }\n else if (monster_seen_by_player(victim))\n {\n io_msg(\"A dart barely missed %s\", victim->get_name().c_str());\n }\n return T_DART;\n}\n\nstatic enum trap_t\ntrap_rust_player(void)\n{\n io_msg(\"a gush of water hits you on the head\");\n player->rust_armor();\n return T_RUST;\n}\n\nstatic enum trap_t\ntrap_rust_monster(Monster* victim)\n{\n if (monster_seen_by_player(victim))\n {\n io_msg(\"a gush of water hits %s\", victim->get_name().c_str());\n }\n return T_RUST;\n}\n\nenum trap_t\ntrap_spring(Monster* victim, Coordinate* trap_coord)\n{\n assert(trap_coord != nullptr);\n\n bool is_player = victim == nullptr;\n size_t tr = Game::level->get_trap_type(*trap_coord);\n\n if (is_player) {\n command_stop(true);\n }\n\n if (victim == nullptr || monster_seen_by_player(victim)) {\n Game::level->set_ch(*trap_coord, TRAP);\n Game::level->set_discovered(*trap_coord);\n }\n\n switch (tr)\n {\n case T_DOOR:\n if (is_player) return trap_door_player();\n else return trap_door_monster(victim);\n case T_BEAR:\n if (is_player) return trap_bear_player();\n else return trap_bear_monster(victim);\n case T_MYST:\n if (is_player) return trap_myst_player();\n else return trap_myst_monster(victim);\n case T_SLEEP:\n if (is_player) return trap_sleep_player();\n else return trap_sleep_monster(victim);\n case T_ARROW:\n if (is_player) return trap_arrow_player();\n else return trap_arrow_monster(victim);\n case T_TELEP:\n if (is_player) return trap_telep_player(trap_coord);\n else return trap_telep_monster(victim);\n case T_DART:\n if (is_player) return trap_dart_player();\n else return trap_dart_monster(victim);\n case T_RUST:\n if (is_player) return trap_rust_player();\n else return trap_rust_monster(victim);\n default:\n assert(0);\n return T_MYST;\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#if !(defined MPL_ENVIRONMENT_HPP)\n\n#define MPL_ENVIRONMENT_HPP\n\n#include <string>\n#include <memory>\n#include <mpi.h>\n\nnamespace mpl {\n \n enum class threading_modes { single=MPI_THREAD_SINGLE, \n funneled=MPI_THREAD_FUNNELED, \n serialized=MPI_THREAD_SERIALIZED, \n multiple=MPI_THREAD_MULTIPLE }; \n\n namespace environment {\n\n namespace detail {\n\n class env {\n\tclass initializer {\n\tpublic:\n\t initializer() {\n\t int thread_mode;\n\t MPI_Init_thread(0, 0, MPI_THREAD_MULTIPLE, &thread_mode);\n\t }\n\t ~initializer() {\n\t MPI_Finalize();\n\t }\n\t};\n\t\n\tinitializer init;\n\tmpl::communicator comm_world_, comm_self_;\n public:\n\tenv() : \n\t init(), comm_world_(MPI_COMM_WORLD), comm_self_(MPI_COMM_SELF) {\n\t}\n\tenv(const env &) = delete;\n\tenv& operator=(const env &) = delete;\n\tint tag_up() const {\n\t void *p;\n\t int flag;\n\t MPI_Comm_get_attr(MPI_COMM_WORLD, MPI_TAG_UB, &p, &flag);\n\t return *reinterpret_cast<int *>(p);\n\t}\n\tthreading_modes threading_mode() const {\n\t int provided;\n\t MPI_Query_thread(&provided);\n\t switch (provided) {\n\t case MPI_THREAD_SINGLE:\n\t return threading_modes::single;\n\t case MPI_THREAD_FUNNELED:\n\t return threading_modes::funneled;\n\t case MPI_THREAD_SERIALIZED:\n\t return threading_modes::serialized;\n\t case MPI_THREAD_MULTIPLE:\n\t return threading_modes::multiple;\n\t }\n\t return threading_modes::single; \/\/ make compiler happy\n\t}\n\tbool is_thread_main() const {\n\t int res;\n\t MPI_Is_thread_main(&res);\n\t return static_cast<bool>(res);\n\t}\n\tbool wtime_is_global() const {\n\t void *p;\n\t int flag;\n\t MPI_Comm_get_attr(MPI_COMM_WORLD, MPI_WTIME_IS_GLOBAL, &p, &flag);\n\t return *reinterpret_cast<int *>(p);\n\t}\n\tconst communicator & comm_world() const {\n\t return comm_world_;\n\t}\n\tconst communicator & comm_self() const {\n\t return comm_self_;\n\t}\n\tstd::string processor_name() const {\n\t char name[MPI_MAX_PROCESSOR_NAME];\n\t int len;\n\t MPI_Get_processor_name(name, &len);\n\t return std::string(name);\n\t}\n\tdouble wtime() const {\n\t return MPI_Wtime();\n\t}\n\tdouble wtick() const {\n\t return MPI_Wtick();\n\t}\n\tvoid buffer_attach(void *buff, int size) const {\n\t MPI_Buffer_attach(buff, size);\n\t}\n\tstd::pair<void *, int> buffer_detach() const {\n\t void *buff;\n\t int size;\n\t MPI_Buffer_detach(&buff, &size);\n\t return std::make_pair(buff, size);\n\t}\n };\n\n \/\/----------------------------------------------------------------\n\n const env & get_env() {\n\tstatic env the_env;\n\treturn the_env;\n }\n \n }\n \n \/\/------------------------------------------------------------------\n \n inline int tag_up() {\n return detail::get_env().tag_up();\n }\n \n constexpr int any_tag() {\n return MPI_ANY_TAG;\n }\n \n constexpr int any_source() {\n return MPI_ANY_SOURCE;\n }\n\n constexpr int proc_null() {\n return MPI_PROC_NULL;\n }\n\n constexpr int undefined() {\n return MPI_UNDEFINED;\n }\n\n constexpr int root() {\n return MPI_ROOT;\n }\n\n constexpr int bsend_overheadroot() {\n return MPI_BSEND_OVERHEAD;\n }\n\t \n inline threading_modes threading_mode() {\n return detail::get_env().threading_mode();\n }\n\n inline bool is_thread_main() {\n return detail::get_env().is_thread_main();\n }\n\n inline bool wtime_is_global() {\n return detail::get_env().wtime_is_global();\n }\n\n inline const communicator & comm_world() {\n return detail::get_env().comm_world();\n }\n\n inline const communicator & comm_self() {\n return detail::get_env().comm_self();\n }\n\n inline std::string processor_name() {\n return detail::get_env().processor_name();\n }\n\n inline double wtime() {\n return detail::get_env().wtime();\n }\n\n inline double wtick() {\n return detail::get_env().wtick();\n }\n\n inline void buffer_attach(void *buff, int size) {\n return detail::get_env().buffer_attach(buff, size);\n }\n\n inline std::pair<void *, int> buffer_detach() {\n return detail::get_env().buffer_detach();\n }\n\n }\n\n \/\/--------------------------------------------------------------------\n\n template<typename A=std::allocator<char>>\n class bsend_buffer {\n int size;\n A alloc;\n char *buff;\n public:\n bsend_buffer(int size) : size(size), alloc(), buff(alloc.allocate(size)) {\n environment::buffer_attach(buff, size);\n }\n bsend_buffer(int size, A alloc) : size(size), alloc(alloc), buff(alloc.allocate(size)) {\n environment::buffer_attach(buff, size);\n }\n ~bsend_buffer() {\n environment::buffer_detach();\n alloc.deallocate(buff, size);\n }\n };\n\n}\n\n#endif\n<commit_msg>remove trailing whitespace<commit_after>#if !(defined MPL_ENVIRONMENT_HPP)\n\n#define MPL_ENVIRONMENT_HPP\n\n#include <string>\n#include <memory>\n#include <mpi.h>\n\nnamespace mpl {\n\n enum class threading_modes { single=MPI_THREAD_SINGLE,\n funneled=MPI_THREAD_FUNNELED,\n serialized=MPI_THREAD_SERIALIZED,\n multiple=MPI_THREAD_MULTIPLE };\n\n namespace environment {\n\n namespace detail {\n\n class env {\n\tclass initializer {\n\tpublic:\n\t initializer() {\n\t int thread_mode;\n\t MPI_Init_thread(0, 0, MPI_THREAD_MULTIPLE, &thread_mode);\n\t }\n\t ~initializer() {\n\t MPI_Finalize();\n\t }\n\t};\n\n\tinitializer init;\n\tmpl::communicator comm_world_, comm_self_;\n public:\n\tenv() :\n\t init(), comm_world_(MPI_COMM_WORLD), comm_self_(MPI_COMM_SELF) {\n\t}\n\tenv(const env &) = delete;\n\tenv& operator=(const env &) = delete;\n\tint tag_up() const {\n\t void *p;\n\t int flag;\n\t MPI_Comm_get_attr(MPI_COMM_WORLD, MPI_TAG_UB, &p, &flag);\n\t return *reinterpret_cast<int *>(p);\n\t}\n\tthreading_modes threading_mode() const {\n\t int provided;\n\t MPI_Query_thread(&provided);\n\t switch (provided) {\n\t case MPI_THREAD_SINGLE:\n\t return threading_modes::single;\n\t case MPI_THREAD_FUNNELED:\n\t return threading_modes::funneled;\n\t case MPI_THREAD_SERIALIZED:\n\t return threading_modes::serialized;\n\t case MPI_THREAD_MULTIPLE:\n\t return threading_modes::multiple;\n\t }\n\t return threading_modes::single; \/\/ make compiler happy\n\t}\n\tbool is_thread_main() const {\n\t int res;\n\t MPI_Is_thread_main(&res);\n\t return static_cast<bool>(res);\n\t}\n\tbool wtime_is_global() const {\n\t void *p;\n\t int flag;\n\t MPI_Comm_get_attr(MPI_COMM_WORLD, MPI_WTIME_IS_GLOBAL, &p, &flag);\n\t return *reinterpret_cast<int *>(p);\n\t}\n\tconst communicator & comm_world() const {\n\t return comm_world_;\n\t}\n\tconst communicator & comm_self() const {\n\t return comm_self_;\n\t}\n\tstd::string processor_name() const {\n\t char name[MPI_MAX_PROCESSOR_NAME];\n\t int len;\n\t MPI_Get_processor_name(name, &len);\n\t return std::string(name);\n\t}\n\tdouble wtime() const {\n\t return MPI_Wtime();\n\t}\n\tdouble wtick() const {\n\t return MPI_Wtick();\n\t}\n\tvoid buffer_attach(void *buff, int size) const {\n\t MPI_Buffer_attach(buff, size);\n\t}\n\tstd::pair<void *, int> buffer_detach() const {\n\t void *buff;\n\t int size;\n\t MPI_Buffer_detach(&buff, &size);\n\t return std::make_pair(buff, size);\n\t}\n };\n\n \/\/----------------------------------------------------------------\n\n const env & get_env() {\n\tstatic env the_env;\n\treturn the_env;\n }\n\n }\n\n \/\/------------------------------------------------------------------\n\n inline int tag_up() {\n return detail::get_env().tag_up();\n }\n\n constexpr int any_tag() {\n return MPI_ANY_TAG;\n }\n\n constexpr int any_source() {\n return MPI_ANY_SOURCE;\n }\n\n constexpr int proc_null() {\n return MPI_PROC_NULL;\n }\n\n constexpr int undefined() {\n return MPI_UNDEFINED;\n }\n\n constexpr int root() {\n return MPI_ROOT;\n }\n\n constexpr int bsend_overheadroot() {\n return MPI_BSEND_OVERHEAD;\n }\n\n inline threading_modes threading_mode() {\n return detail::get_env().threading_mode();\n }\n\n inline bool is_thread_main() {\n return detail::get_env().is_thread_main();\n }\n\n inline bool wtime_is_global() {\n return detail::get_env().wtime_is_global();\n }\n\n inline const communicator & comm_world() {\n return detail::get_env().comm_world();\n }\n\n inline const communicator & comm_self() {\n return detail::get_env().comm_self();\n }\n\n inline std::string processor_name() {\n return detail::get_env().processor_name();\n }\n\n inline double wtime() {\n return detail::get_env().wtime();\n }\n\n inline double wtick() {\n return detail::get_env().wtick();\n }\n\n inline void buffer_attach(void *buff, int size) {\n return detail::get_env().buffer_attach(buff, size);\n }\n\n inline std::pair<void *, int> buffer_detach() {\n return detail::get_env().buffer_detach();\n }\n\n }\n\n \/\/--------------------------------------------------------------------\n\n template<typename A=std::allocator<char>>\n class bsend_buffer {\n int size;\n A alloc;\n char *buff;\n public:\n bsend_buffer(int size) : size(size), alloc(), buff(alloc.allocate(size)) {\n environment::buffer_attach(buff, size);\n }\n bsend_buffer(int size, A alloc) : size(size), alloc(alloc), buff(alloc.allocate(size)) {\n environment::buffer_attach(buff, size);\n }\n ~bsend_buffer() {\n environment::buffer_detach();\n alloc.deallocate(buff, size);\n }\n };\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ sota.cpp : Defines the entry point for the console application.\n\/\/\n#include <array>\n#include <string>\n#include <iostream>\n#include <exception>\n\n#include \"ast.h\"\n#include \"token.h\"\n#include \"parser.h\"\n#include \"grammar.h\"\n\nusing namespace sota;\n\nint main(int argc, char* argv[]) {\n\n std::string source = \"1 + 2\";\n\n auto parser = Parser(Type2Symbol);\n parser.Source = source;\n auto token = parser.LookAhead(5);\n std::cout << token << std::endl;\n\n return 0;\n}\n<commit_msg>fixed lingering case issue, Source -> source ... -sai<commit_after>\/\/ sota.cpp : Defines the entry point for the console application.\n\/\/\n#include <array>\n#include <string>\n#include <iostream>\n#include <exception>\n\n#include \"ast.h\"\n#include \"token.h\"\n#include \"parser.h\"\n#include \"grammar.h\"\n\nusing namespace sota;\n\nint main(int argc, char* argv[]) {\n\n std::string source = \"1 + 2\";\n\n auto parser = Parser(Type2Symbol);\n parser.source = source;\n auto token = parser.LookAhead(5);\n std::cout << token << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * v8cgi main file. Loosely based on V8's \"shell\" sample app.\n *\/\n\n#include <v8.h>\n#include \"js_system.h\"\n#include \"js_io.h\"\n#include \"js_common.h\"\n#include \"js_macros.h\"\n#include <sstream>\n\n#ifndef windows\n#\tinclude <dlfcn.h>\n#else\n#\tinclude <windows.h>\n#\tdefine dlopen(x,y) (void*)LoadLibrary(x)\n#\tdefine dlsym(x,y) (void*)GetProcAddress((HMODULE)x,y)\n#\tdefine dlclose(x) FreeLibrary((HMODULE)x)\n#endif\n\n#define _STRING(x) #x\n#define STRING(x) _STRING(x)\n\n\/\/ chdir()\n#ifndef HAVE_CHDIR\n#\tinclude <direct.h>\n#\tdefine chdir(name) _chdir(name)\n#endif\n\n\/\/ getcwd()\n#ifndef HAVE_GETCWD\n#\tinclude <direct.h>\n#\tdefine getcwd(name, bytes) _getcwd(name, bytes)\n#endif\n\nv8::Handle<v8::Array> __onexit;\n\nvoid die(int code) {\n\tuint32_t max = __onexit->Length();\n\tv8::Handle<v8::Function> fun;\n\tfor (unsigned int i=0;i<max;i++) {\n\t\tfun = v8::Handle<v8::Function>::Cast(__onexit->Get(JS_INT(i)));\n\t\tfun->Call(v8::Context::GetCurrent()->Global(), 0, NULL);\n\t}\n\texit(code);\n}\n\nv8::Handle<v8::String> read_file(const char* name) {\n\tFILE* file = fopen(name, \"rb\");\n\tif (file == NULL) return v8::Handle<v8::String>();\n\n\tfseek(file, 0, SEEK_END);\n\tsize_t size = ftell(file);\n\trewind(file);\n\n\tchar* chars = new char[size + 1];\n\tchars[size] = '\\0';\n\tfor (unsigned int i = 0; i < size;) {\n\t\tsize_t read = fread(&chars[i], 1, size - i, file);\n\t\ti += read;\n\t}\n\tfclose(file);\n\n\t\/* remove shebang line *\/\t\n\tstd::string str = chars;\n\tif ( str.find('#',0) == 0 && str.find('!',1) == 1 ) {\n\t\tunsigned int pfix = str.find('\\n',0);\n\t\tstr.erase(0,pfix);\n\t};\n\t\n\tv8::Handle<v8::String> result = JS_STR(str.c_str());\n\tdelete[] chars;\n\treturn result;\n}\n\nvoid report_exception(v8::TryCatch* try_catch) {\n\tv8::HandleScope handle_scope;\n\tv8::String::Utf8Value exception(try_catch->Exception());\n\tv8::Handle<v8::Message> message = try_catch->Message();\n\tstd::string msgstring = \"\";\n\tstd::stringstream ss;\n\tstd::string tmp;\n\n\tif (message.IsEmpty()) {\n\t\tmsgstring += *exception;\n\t\tmsgstring += \"\\n\";\n\t} else {\n\t\tv8::String::Utf8Value filename(message->GetScriptResourceName());\n\t\tint linenum = message->GetLineNumber();\n\t\tmsgstring += *filename;\n\t\tmsgstring += \":\";\n\t\t\n\t\tss << linenum;\n\t\tss >> tmp;\n\n\t\tmsgstring += tmp;\n\t\tmsgstring += \": \";\n\t\tmsgstring += *exception;\n\t\tmsgstring += \"\\n\";\n\t}\n\t\n\tint cgi = 0;\n\tv8::Local<v8::Function> fun;\n\tv8::Local<v8::Value> context = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"response\"));\n\tif (context->IsObject()) {\n\t\tv8::Local<v8::Value> print = context->ToObject()->Get(JS_STR(\"error\"));\n\t\tif (print->IsObject()) {\n\t\t\tfun = v8::Local<v8::Function>::Cast(print);\n\t\t\tcgi = 1;\n\t\t}\n\t}\n\tif (!cgi) {\n\t\tcontext = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"System\"));\n\t\tfun = v8::Local<v8::Function>::Cast(context->ToObject()->Get(JS_STR(\"stdout\")));\n\t}\n\t\n\tv8::Handle<v8::Value> data[1];\n\tdata[0] = JS_STR(msgstring.c_str());\n\tfun->Call(context->ToObject(), 1, data);\n}\n\nint execute_file(const char * str, bool change) {\n\tv8::HandleScope handle_scope;\n\tv8::TryCatch try_catch;\n\tv8::Handle<v8::String> name = JS_STR(str);\n\tv8::Handle<v8::String> source = read_file(str);\n\n\tif (source.IsEmpty()) {\n\t\tprintf(\"Error reading '%s'\\n\", str);\n\t\treturn 1;\n\t}\n\t\n\tv8::Handle<v8::Script> script = v8::Script::Compile(source, name);\n\tif (script.IsEmpty()) {\n\t\treport_exception(&try_catch);\n\t\treturn 1;\n\t} else {\n\t\tchar * old = getcwd(NULL, 0);\n\t\tchar * end = strrchr((char *)str, '\/');\n\t\tif (end == NULL) {\n\t\t\tend = strrchr((char *)str, '\\\\');\n\t\t}\n\t\tif (end != NULL && change) {\n\t\t\tint len = end-str;\n\t\t\tchar * base = (char *) malloc(len+1);\n\t\t\tstrncpy(base, str, len);\n \t\tbase[len] = '\\0';\n \t\tchdir(base);\n\t\t\tfree(base);\n\t\t}\n\t\t\n\t\tv8::Handle<v8::Value> result = script->Run();\n\t\t\n\t\tchdir(old);\n\t\tif (result.IsEmpty()) {\n\t\t\treport_exception(&try_catch);\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\nint library(char * name) {\n\tv8::HandleScope handle_scope;\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Value> prefix = config->ToObject()->Get(JS_STR(\"libraryPath\"));\n\tv8::String::Utf8Value pfx(prefix);\n\tstd::string path = \"\";\n\t\n\tpath += *pfx;\n\tpath += \"\/\";\n\tpath += name;\n\t\n\tif (path.find(\".so\") != std::string::npos) {\n\t\tvoid * handle;\n\t if (!(handle = dlopen(path.c_str(), RTLD_LAZY))) {\n\t\t\tprintf(\"open\");\n\t\t\treturn 1;\n\t\t}\n\t\tvoid (*func) (v8::Handle<v8::Object>);\n\t\tif (!(func = reinterpret_cast<void (*)(v8::Handle<v8::Object>)>(dlsym(handle, \"init\")))) {\n\t\t\tprintf(\"init\");\n\t\t\tdlclose(handle);\n\t\t\treturn 1;\n\t\t}\n\t\tfunc(v8::Context::GetCurrent()->Global());\n\t\treturn 0;\t\t\t\t\t\t\t\t\t\n\t} else {\n\t\treturn execute_file(path.c_str(), false);\n\t}\n}\n\nv8::Handle<v8::Value> _include(const v8::Arguments& args) {\n\tbool ok = true;\n\tint result;\n\tfor (int i = 0; i < args.Length(); i++) {\n\t\tv8::HandleScope handle_scope;\n\t\tv8::String::Utf8Value file(args[i]);\n\t\tresult = execute_file(*file, false);\n\t\tif (result != 0) { ok = false; }\n\t}\n\treturn JS_BOOL(ok);\n}\n\nv8::Handle<v8::Value> _library(const v8::Arguments & args) {\n\tbool ok = true;\n\tint result;\n\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Value> prefix = config->ToObject()->Get(JS_STR(\"libraryPath\"));\n\tv8::String::Utf8Value pfx(prefix);\n\n\tfor (int i = 0; i < args.Length(); i++) {\n\t\tv8::HandleScope handle_scope;\n\t\tv8::String::Utf8Value file(args[i]);\n\t\tresult = library(*file);\n\t\tif (result != 0) { ok = false; }\n\t}\n\treturn JS_BOOL(ok);\n}\n\nv8::Handle<v8::Value> _exit(const v8::Arguments& args) {\n\tdie(args[0]->Int32Value());\n\treturn v8::Undefined();\n}\n\nv8::Handle<v8::Value> _onexit(const v8::Arguments& args) {\n\t__onexit->Set(JS_INT(__onexit->Length()), args[0]);\n\treturn v8::Undefined();\n}\n\nint library_autoload() {\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Array> list = v8::Handle<v8::Array>::Cast(config->ToObject()->Get(JS_STR(\"libraryAutoload\")));\n\tint cnt = list->Length();\n\tfor (int i=0;i<cnt;i++) {\n\t\tv8::Handle<v8::Value> item = list->Get(JS_INT(i));\n\t\tv8::String::Utf8Value name(item);\n\t\tif (library(*name)) { return 1; }\n\t}\n\treturn 0;\n}\n\nvoid init(char * cfg) {\n\tint result = execute_file(cfg, false);\n\tif (result) { \n\t\tprintf(\"Cannot load configuration, quitting...\\n\");\n\t\tdie(1);\n\t}\n\tresult = library_autoload();\n\tif (result) { \n\t\tprintf(\"Cannot load default libraries, quitting...\\n\");\n\t\tdie(1);\n\t}\n}\n\nint main(int argc, char ** argv, char ** envp) {\n\tv8::V8::SetFlagsFromCommandLine(&argc, argv, true);\n\tv8::HandleScope handle_scope;\n\n\tv8::Handle<v8::ObjectTemplate> global = v8::ObjectTemplate::New();\n\tv8::Handle<v8::Context> context = v8::Context::New(NULL, global);\n\tv8::Context::Scope context_scope(context);\n\n\t__onexit = v8::Array::New();\n\tcontext->Global()->Set(JS_STR(\"library\"), v8::FunctionTemplate::New(_library)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"include\"), v8::FunctionTemplate::New(_include)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"exit\"), v8::FunctionTemplate::New(_exit)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"onexit\"), v8::FunctionTemplate::New(_onexit)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"global\"), context->Global());\n\tcontext->Global()->Set(JS_STR(\"Config\"), v8::Object::New());\n\n\tsetup_system(envp, context->Global());\n\tsetup_io(context->Global());\t\n\t\n\tchar * cfg = STRING(CONFIG_PATH);\n\tint argptr = 0;\n\tfor (int i = 1; i < argc; i++) {\n\t\tconst char* str = argv[i];\n\t\targptr = i;\n\t\tif (strcmp(str, \"-c\") == 0 && i + 1 < argc) {\n\t\t\tcfg = argv[i+1];\n\t\t\targptr = 0;\n\t\t\ti++;\n\t\t}\n\t}\n\t\t\t\t\t\t\t \n\tinit(cfg);\n\t\n\tif (!argptr) {\n\t\t\/\/ try the PATH_TRANSLATED env var\n\t\tv8::Handle<v8::Value> sys = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"System\"));\n\t\tv8::Handle<v8::Value> env = sys->ToObject()->Get(JS_STR(\"env\"));\n\t\tv8::Handle<v8::Value> pt = env->ToObject()->Get(JS_STR(\"PATH_TRANSLATED\"));\n\t\tif (pt->IsString()) {\n\t\t\tv8::String::Utf8Value name(pt);\n\t\t\tint result = execute_file(*name, true);\n\t\t\tif (result) { die(result); }\n\t\t} else {\n\t\t\tprintf(\"Nothing to do.\\n\");\n\t\t}\n\t} else {\n\t\tint result = execute_file(argv[argptr], true);\n\t\tif (result) { die(result); }\n\t}\n\tdie(0);\n}\n<commit_msg>dll<commit_after>\/*\n * v8cgi main file. Loosely based on V8's \"shell\" sample app.\n *\/\n\n#include <v8.h>\n#include \"js_system.h\"\n#include \"js_io.h\"\n#include \"js_common.h\"\n#include \"js_macros.h\"\n#include <sstream>\n\n#ifndef windows\n#\tinclude <dlfcn.h>\n#else\n#\tinclude <windows.h>\n#\tdefine dlopen(x,y) (void*)LoadLibrary(x)\n#\tdefine dlsym(x,y) (void*)GetProcAddress((HMODULE)x,y)\n#\tdefine dlclose(x) FreeLibrary((HMODULE)x)\n#endif\n\n#define _STRING(x) #x\n#define STRING(x) _STRING(x)\n\n\/\/ chdir()\n#ifndef HAVE_CHDIR\n#\tinclude <direct.h>\n#\tdefine chdir(name) _chdir(name)\n#endif\n\n\/\/ getcwd()\n#ifndef HAVE_GETCWD\n#\tinclude <direct.h>\n#\tdefine getcwd(name, bytes) _getcwd(name, bytes)\n#endif\n\nv8::Handle<v8::Array> __onexit;\n\nvoid die(int code) {\n\tuint32_t max = __onexit->Length();\n\tv8::Handle<v8::Function> fun;\n\tfor (unsigned int i=0;i<max;i++) {\n\t\tfun = v8::Handle<v8::Function>::Cast(__onexit->Get(JS_INT(i)));\n\t\tfun->Call(v8::Context::GetCurrent()->Global(), 0, NULL);\n\t}\n\texit(code);\n}\n\nv8::Handle<v8::String> read_file(const char* name) {\n\tFILE* file = fopen(name, \"rb\");\n\tif (file == NULL) return v8::Handle<v8::String>();\n\n\tfseek(file, 0, SEEK_END);\n\tsize_t size = ftell(file);\n\trewind(file);\n\n\tchar* chars = new char[size + 1];\n\tchars[size] = '\\0';\n\tfor (unsigned int i = 0; i < size;) {\n\t\tsize_t read = fread(&chars[i], 1, size - i, file);\n\t\ti += read;\n\t}\n\tfclose(file);\n\n\t\/* remove shebang line *\/\t\n\tstd::string str = chars;\n\tif ( str.find('#',0) == 0 && str.find('!',1) == 1 ) {\n\t\tunsigned int pfix = str.find('\\n',0);\n\t\tstr.erase(0,pfix);\n\t};\n\t\n\tv8::Handle<v8::String> result = JS_STR(str.c_str());\n\tdelete[] chars;\n\treturn result;\n}\n\nvoid report_exception(v8::TryCatch* try_catch) {\n\tv8::HandleScope handle_scope;\n\tv8::String::Utf8Value exception(try_catch->Exception());\n\tv8::Handle<v8::Message> message = try_catch->Message();\n\tstd::string msgstring = \"\";\n\tstd::stringstream ss;\n\tstd::string tmp;\n\n\tif (message.IsEmpty()) {\n\t\tmsgstring += *exception;\n\t\tmsgstring += \"\\n\";\n\t} else {\n\t\tv8::String::Utf8Value filename(message->GetScriptResourceName());\n\t\tint linenum = message->GetLineNumber();\n\t\tmsgstring += *filename;\n\t\tmsgstring += \":\";\n\t\t\n\t\tss << linenum;\n\t\tss >> tmp;\n\n\t\tmsgstring += tmp;\n\t\tmsgstring += \": \";\n\t\tmsgstring += *exception;\n\t\tmsgstring += \"\\n\";\n\t}\n\t\n\tint cgi = 0;\n\tv8::Local<v8::Function> fun;\n\tv8::Local<v8::Value> context = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"response\"));\n\tif (context->IsObject()) {\n\t\tv8::Local<v8::Value> print = context->ToObject()->Get(JS_STR(\"error\"));\n\t\tif (print->IsObject()) {\n\t\t\tfun = v8::Local<v8::Function>::Cast(print);\n\t\t\tcgi = 1;\n\t\t}\n\t}\n\tif (!cgi) {\n\t\tcontext = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"System\"));\n\t\tfun = v8::Local<v8::Function>::Cast(context->ToObject()->Get(JS_STR(\"stdout\")));\n\t}\n\t\n\tv8::Handle<v8::Value> data[1];\n\tdata[0] = JS_STR(msgstring.c_str());\n\tfun->Call(context->ToObject(), 1, data);\n}\n\nint execute_file(const char * str, bool change) {\n\tv8::HandleScope handle_scope;\n\tv8::TryCatch try_catch;\n\tv8::Handle<v8::String> name = JS_STR(str);\n\tv8::Handle<v8::String> source = read_file(str);\n\n\tif (source.IsEmpty()) {\n\t\tprintf(\"Error reading '%s'\\n\", str);\n\t\treturn 1;\n\t}\n\t\n\tv8::Handle<v8::Script> script = v8::Script::Compile(source, name);\n\tif (script.IsEmpty()) {\n\t\treport_exception(&try_catch);\n\t\treturn 1;\n\t} else {\n\t\tchar * old = getcwd(NULL, 0);\n\t\tchar * end = strrchr((char *)str, '\/');\n\t\tif (end == NULL) {\n\t\t\tend = strrchr((char *)str, '\\\\');\n\t\t}\n\t\tif (end != NULL && change) {\n\t\t\tint len = end-str;\n\t\t\tchar * base = (char *) malloc(len+1);\n\t\t\tstrncpy(base, str, len);\n \t\tbase[len] = '\\0';\n \t\tchdir(base);\n\t\t\tfree(base);\n\t\t}\n\t\t\n\t\tv8::Handle<v8::Value> result = script->Run();\n\t\t\n\t\tchdir(old);\n\t\tif (result.IsEmpty()) {\n\t\t\treport_exception(&try_catch);\n\t\t\treturn 1;\n\t\t}\n\t}\n\treturn 0;\n}\n\nint library(char * name) {\n\tv8::HandleScope handle_scope;\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Value> prefix = config->ToObject()->Get(JS_STR(\"libraryPath\"));\n\tv8::String::Utf8Value pfx(prefix);\n\tstd::string path = \"\";\n\t\n\tpath += *pfx;\n\tpath += \"\/\";\n\tpath += name;\n\t\n\tif (path.find(\".so\") != std::string::npos || path.find(\".dll\") != std::string::npos) {\n\t\tvoid * handle;\n\t if (!(handle = dlopen(path.c_str(), RTLD_LAZY))) {\n\t\t\tprintf(\"open\");\n\t\t\treturn 1;\n\t\t}\n\t\tvoid (*func) (v8::Handle<v8::Object>);\n\t\tif (!(func = reinterpret_cast<void (*)(v8::Handle<v8::Object>)>(dlsym(handle, \"init\")))) {\n\t\t\tprintf(\"init\");\n\t\t\tdlclose(handle);\n\t\t\treturn 1;\n\t\t}\n\t\tfunc(v8::Context::GetCurrent()->Global());\n\t\treturn 0;\t\t\t\t\t\t\t\t\t\n\t} else {\n\t\treturn execute_file(path.c_str(), false);\n\t}\n}\n\nv8::Handle<v8::Value> _include(const v8::Arguments& args) {\n\tbool ok = true;\n\tint result;\n\tfor (int i = 0; i < args.Length(); i++) {\n\t\tv8::HandleScope handle_scope;\n\t\tv8::String::Utf8Value file(args[i]);\n\t\tresult = execute_file(*file, false);\n\t\tif (result != 0) { ok = false; }\n\t}\n\treturn JS_BOOL(ok);\n}\n\nv8::Handle<v8::Value> _library(const v8::Arguments & args) {\n\tbool ok = true;\n\tint result;\n\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Value> prefix = config->ToObject()->Get(JS_STR(\"libraryPath\"));\n\tv8::String::Utf8Value pfx(prefix);\n\n\tfor (int i = 0; i < args.Length(); i++) {\n\t\tv8::HandleScope handle_scope;\n\t\tv8::String::Utf8Value file(args[i]);\n\t\tresult = library(*file);\n\t\tif (result != 0) { ok = false; }\n\t}\n\treturn JS_BOOL(ok);\n}\n\nv8::Handle<v8::Value> _exit(const v8::Arguments& args) {\n\tdie(args[0]->Int32Value());\n\treturn v8::Undefined();\n}\n\nv8::Handle<v8::Value> _onexit(const v8::Arguments& args) {\n\t__onexit->Set(JS_INT(__onexit->Length()), args[0]);\n\treturn v8::Undefined();\n}\n\nint library_autoload() {\n\tv8::Handle<v8::Value> config = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"Config\"));\n\tv8::Handle<v8::Array> list = v8::Handle<v8::Array>::Cast(config->ToObject()->Get(JS_STR(\"libraryAutoload\")));\n\tint cnt = list->Length();\n\tfor (int i=0;i<cnt;i++) {\n\t\tv8::Handle<v8::Value> item = list->Get(JS_INT(i));\n\t\tv8::String::Utf8Value name(item);\n\t\tif (library(*name)) { return 1; }\n\t}\n\treturn 0;\n}\n\nvoid init(char * cfg) {\n\tint result = execute_file(cfg, false);\n\tif (result) { \n\t\tprintf(\"Cannot load configuration, quitting...\\n\");\n\t\tdie(1);\n\t}\n\tresult = library_autoload();\n\tif (result) { \n\t\tprintf(\"Cannot load default libraries, quitting...\\n\");\n\t\tdie(1);\n\t}\n}\n\nint main(int argc, char ** argv, char ** envp) {\n\tv8::V8::SetFlagsFromCommandLine(&argc, argv, true);\n\tv8::HandleScope handle_scope;\n\n\tv8::Handle<v8::ObjectTemplate> global = v8::ObjectTemplate::New();\n\tv8::Handle<v8::Context> context = v8::Context::New(NULL, global);\n\tv8::Context::Scope context_scope(context);\n\n\t__onexit = v8::Array::New();\n\tcontext->Global()->Set(JS_STR(\"library\"), v8::FunctionTemplate::New(_library)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"include\"), v8::FunctionTemplate::New(_include)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"exit\"), v8::FunctionTemplate::New(_exit)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"onexit\"), v8::FunctionTemplate::New(_onexit)->GetFunction());\n\tcontext->Global()->Set(JS_STR(\"global\"), context->Global());\n\tcontext->Global()->Set(JS_STR(\"Config\"), v8::Object::New());\n\n\tsetup_system(envp, context->Global());\n\tsetup_io(context->Global());\t\n\t\n\tchar * cfg = STRING(CONFIG_PATH);\n\tint argptr = 0;\n\tfor (int i = 1; i < argc; i++) {\n\t\tconst char* str = argv[i];\n\t\targptr = i;\n\t\tif (strcmp(str, \"-c\") == 0 && i + 1 < argc) {\n\t\t\tcfg = argv[i+1];\n\t\t\targptr = 0;\n\t\t\ti++;\n\t\t}\n\t}\n\t\t\t\t\t\t\t \n\tinit(cfg);\n\t\n\tif (!argptr) {\n\t\t\/\/ try the PATH_TRANSLATED env var\n\t\tv8::Handle<v8::Value> sys = v8::Context::GetCurrent()->Global()->Get(JS_STR(\"System\"));\n\t\tv8::Handle<v8::Value> env = sys->ToObject()->Get(JS_STR(\"env\"));\n\t\tv8::Handle<v8::Value> pt = env->ToObject()->Get(JS_STR(\"PATH_TRANSLATED\"));\n\t\tif (pt->IsString()) {\n\t\t\tv8::String::Utf8Value name(pt);\n\t\t\tint result = execute_file(*name, true);\n\t\t\tif (result) { die(result); }\n\t\t} else {\n\t\t\tprintf(\"Nothing to do.\\n\");\n\t\t}\n\t} else {\n\t\tint result = execute_file(argv[argptr], true);\n\t\tif (result) { die(result); }\n\t}\n\tdie(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"sync.h\"\n\n#include \"util.h\"\n#include \"utilstrencodings.h\"\n\n#include <stdio.h>\n\n#include <boost\/foreach.hpp>\n#include <boost\/thread.hpp>\n\n#ifdef DEBUG_LOCKCONTENTION\nvoid PrintLockContention(const char* pszName, const char* pszFile, int nLine)\n{\n LogPrintf(\"LOCKCONTENTION: %s\\n\", pszName);\n LogPrintf(\"Locker: %s:%d\\n\", pszFile, nLine);\n}\n#endif \/* DEBUG_LOCKCONTENTION *\/\n\n#ifdef DEBUG_LOCKORDER\n\/\/\n\/\/ Early deadlock detection.\n\/\/ Problem being solved:\n\/\/ Thread 1 locks A, then B, then C\n\/\/ Thread 2 locks D, then C, then A\n\/\/ --> may result in deadlock between the two threads, depending on when they run.\n\/\/ Solution implemented here:\n\/\/ Keep track of pairs of locks: (A before B), (A before C), etc.\n\/\/ Complain if any thread tries to lock in a different order.\n\/\/\n\nstruct CLockLocation {\n CLockLocation(const char* pszName, const char* pszFile, int nLine, bool fTryIn)\n {\n mutexName = pszName;\n sourceFile = pszFile;\n sourceLine = nLine;\n fTry = fTryIn;\n }\n\n std::string ToString() const\n {\n return mutexName + \" \" + sourceFile + \":\" + itostr(sourceLine) + (fTry ? \" (TRY)\" : \"\");\n }\n\n std::string MutexName() const { return mutexName; }\n\n bool fTry;\nprivate:\n std::string mutexName;\n std::string sourceFile;\n int sourceLine;\n};\n\ntypedef std::vector<std::pair<void*, CLockLocation> > LockStack;\ntypedef std::map<std::pair<void*, void*>, LockStack> LockOrders;\ntypedef std::set<std::pair<void*, void*> > InvLockOrders;\n\nstruct LockData {\n \/\/ Very ugly hack: as the global constructs and destructors run single\n \/\/ threaded, we use this boolean to know whether LockData still exists,\n \/\/ as DeleteLock can get called by global CCriticalSection destructors\n \/\/ after LockData disappears.\n bool available;\n LockData() : available(true) {}\n ~LockData() { available = false; }\n\n LockOrders lockorders;\n InvLockOrders invlockorders;\n boost::mutex dd_mutex;\n} static lockdata;\n\nboost::thread_specific_ptr<LockStack> lockstack;\n\nstatic void potential_deadlock_detected(const std::pair<void*, void*>& mismatch, const LockStack& s1, const LockStack& s2)\n{\n LogPrintf(\"POTENTIAL DEADLOCK DETECTED\\n\");\n LogPrintf(\"Previous lock order was:\\n\");\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, s2) {\n if (i.first == mismatch.first) {\n LogPrintf(\" (1)\");\n }\n if (i.first == mismatch.second) {\n LogPrintf(\" (2)\");\n }\n LogPrintf(\" %s\\n\", i.second.ToString());\n }\n LogPrintf(\"Current lock order is:\\n\");\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, s1) {\n if (i.first == mismatch.first) {\n LogPrintf(\" (1)\");\n }\n if (i.first == mismatch.second) {\n LogPrintf(\" (2)\");\n }\n LogPrintf(\" %s\\n\", i.second.ToString());\n }\n assert(false);\n}\n\nstatic void push_lock(void* c, const CLockLocation& locklocation, bool fTry)\n{\n if (lockstack.get() == NULL)\n lockstack.reset(new LockStack);\n\n boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);\n\n (*lockstack).push_back(std::make_pair(c, locklocation));\n\n if (!fTry) {\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, (*lockstack)) {\n if (i.first == c)\n break;\n\n std::pair<void*, void*> p1 = std::make_pair(i.first, c);\n if (lockdata.lockorders.count(p1))\n continue;\n lockdata.lockorders[p1] = (*lockstack);\n\n std::pair<void*, void*> p2 = std::make_pair(c, i.first);\n lockdata.invlockorders.insert(p2);\n if (lockdata.lockorders.count(p2))\n potential_deadlock_detected(p1, lockdata.lockorders[p2], lockdata.lockorders[p1]);\n }\n }\n}\n\nstatic void pop_lock()\n{\n (*lockstack).pop_back();\n}\n\nvoid EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry)\n{\n push_lock(cs, CLockLocation(pszName, pszFile, nLine, fTry), fTry);\n}\n\nvoid LeaveCritical()\n{\n pop_lock();\n}\n\nstd::string LocksHeld()\n{\n std::string result;\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, *lockstack)\n result += i.second.ToString() + std::string(\"\\n\");\n return result;\n}\n\nvoid AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs)\n{\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, *lockstack)\n if (i.first == cs)\n return;\n fprintf(stderr, \"Assertion failed: lock %s not held in %s:%i; locks held:\\n%s\", pszName, pszFile, nLine, LocksHeld().c_str());\n abort();\n}\n\nvoid DeleteLock(void* cs)\n{\n if (!lockdata.available) {\n \/\/ We're already shutting down.\n return;\n }\n boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);\n std::pair<void*, void*> item = std::make_pair(cs, (void*)0);\n LockOrders::iterator it = lockdata.lockorders.lower_bound(item);\n while (it != lockdata.lockorders.end() && it->first.first == cs) {\n std::pair<void*, void*> invitem = std::make_pair(it->first.second, it->first.first);\n lockdata.invlockorders.erase(invitem);\n lockdata.lockorders.erase(it++);\n }\n InvLockOrders::iterator invit = lockdata.invlockorders.lower_bound(item);\n while (invit != lockdata.invlockorders.end() && invit->first == cs) {\n std::pair<void*, void*> invinvitem = std::make_pair(invit->second, invit->first);\n lockdata.lockorders.erase(invinvitem);\n lockdata.invlockorders.erase(invit++);\n }\n}\n\n#endif \/* DEBUG_LOCKORDER *\/\n<commit_msg>Further-enforce lockordering by enforcing directly after TRY_LOCKs<commit_after>\/\/ Copyright (c) 2011-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"sync.h\"\n\n#include \"util.h\"\n#include \"utilstrencodings.h\"\n\n#include <stdio.h>\n\n#include <boost\/foreach.hpp>\n#include <boost\/thread.hpp>\n\n#ifdef DEBUG_LOCKCONTENTION\nvoid PrintLockContention(const char* pszName, const char* pszFile, int nLine)\n{\n LogPrintf(\"LOCKCONTENTION: %s\\n\", pszName);\n LogPrintf(\"Locker: %s:%d\\n\", pszFile, nLine);\n}\n#endif \/* DEBUG_LOCKCONTENTION *\/\n\n#ifdef DEBUG_LOCKORDER\n\/\/\n\/\/ Early deadlock detection.\n\/\/ Problem being solved:\n\/\/ Thread 1 locks A, then B, then C\n\/\/ Thread 2 locks D, then C, then A\n\/\/ --> may result in deadlock between the two threads, depending on when they run.\n\/\/ Solution implemented here:\n\/\/ Keep track of pairs of locks: (A before B), (A before C), etc.\n\/\/ Complain if any thread tries to lock in a different order.\n\/\/\n\nstruct CLockLocation {\n CLockLocation(const char* pszName, const char* pszFile, int nLine, bool fTryIn)\n {\n mutexName = pszName;\n sourceFile = pszFile;\n sourceLine = nLine;\n fTry = fTryIn;\n }\n\n std::string ToString() const\n {\n return mutexName + \" \" + sourceFile + \":\" + itostr(sourceLine) + (fTry ? \" (TRY)\" : \"\");\n }\n\n std::string MutexName() const { return mutexName; }\n\n bool fTry;\nprivate:\n std::string mutexName;\n std::string sourceFile;\n int sourceLine;\n};\n\ntypedef std::vector<std::pair<void*, CLockLocation> > LockStack;\ntypedef std::map<std::pair<void*, void*>, LockStack> LockOrders;\ntypedef std::set<std::pair<void*, void*> > InvLockOrders;\n\nstruct LockData {\n \/\/ Very ugly hack: as the global constructs and destructors run single\n \/\/ threaded, we use this boolean to know whether LockData still exists,\n \/\/ as DeleteLock can get called by global CCriticalSection destructors\n \/\/ after LockData disappears.\n bool available;\n LockData() : available(true) {}\n ~LockData() { available = false; }\n\n LockOrders lockorders;\n InvLockOrders invlockorders;\n boost::mutex dd_mutex;\n} static lockdata;\n\nboost::thread_specific_ptr<LockStack> lockstack;\n\nstatic void potential_deadlock_detected(const std::pair<void*, void*>& mismatch, const LockStack& s1, const LockStack& s2)\n{\n LogPrintf(\"POTENTIAL DEADLOCK DETECTED\\n\");\n LogPrintf(\"Previous lock order was:\\n\");\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, s2) {\n if (i.first == mismatch.first) {\n LogPrintf(\" (1)\");\n }\n if (i.first == mismatch.second) {\n LogPrintf(\" (2)\");\n }\n LogPrintf(\" %s\\n\", i.second.ToString());\n }\n LogPrintf(\"Current lock order is:\\n\");\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, s1) {\n if (i.first == mismatch.first) {\n LogPrintf(\" (1)\");\n }\n if (i.first == mismatch.second) {\n LogPrintf(\" (2)\");\n }\n LogPrintf(\" %s\\n\", i.second.ToString());\n }\n assert(false);\n}\n\nstatic void push_lock(void* c, const CLockLocation& locklocation, bool fTry)\n{\n if (lockstack.get() == NULL)\n lockstack.reset(new LockStack);\n\n boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);\n\n (*lockstack).push_back(std::make_pair(c, locklocation));\n\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, (*lockstack)) {\n if (i.first == c)\n break;\n\n std::pair<void*, void*> p1 = std::make_pair(i.first, c);\n if (lockdata.lockorders.count(p1))\n continue;\n lockdata.lockorders[p1] = (*lockstack);\n\n std::pair<void*, void*> p2 = std::make_pair(c, i.first);\n lockdata.invlockorders.insert(p2);\n if (lockdata.lockorders.count(p2))\n potential_deadlock_detected(p1, lockdata.lockorders[p2], lockdata.lockorders[p1]);\n }\n}\n\nstatic void pop_lock()\n{\n (*lockstack).pop_back();\n}\n\nvoid EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry)\n{\n push_lock(cs, CLockLocation(pszName, pszFile, nLine, fTry), fTry);\n}\n\nvoid LeaveCritical()\n{\n pop_lock();\n}\n\nstd::string LocksHeld()\n{\n std::string result;\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, *lockstack)\n result += i.second.ToString() + std::string(\"\\n\");\n return result;\n}\n\nvoid AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs)\n{\n BOOST_FOREACH (const PAIRTYPE(void*, CLockLocation) & i, *lockstack)\n if (i.first == cs)\n return;\n fprintf(stderr, \"Assertion failed: lock %s not held in %s:%i; locks held:\\n%s\", pszName, pszFile, nLine, LocksHeld().c_str());\n abort();\n}\n\nvoid DeleteLock(void* cs)\n{\n if (!lockdata.available) {\n \/\/ We're already shutting down.\n return;\n }\n boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);\n std::pair<void*, void*> item = std::make_pair(cs, (void*)0);\n LockOrders::iterator it = lockdata.lockorders.lower_bound(item);\n while (it != lockdata.lockorders.end() && it->first.first == cs) {\n std::pair<void*, void*> invitem = std::make_pair(it->first.second, it->first.first);\n lockdata.invlockorders.erase(invitem);\n lockdata.lockorders.erase(it++);\n }\n InvLockOrders::iterator invit = lockdata.invlockorders.lower_bound(item);\n while (invit != lockdata.invlockorders.end() && invit->first == cs) {\n std::pair<void*, void*> invinvitem = std::make_pair(invit->second, invit->first);\n lockdata.lockorders.erase(invinvitem);\n lockdata.invlockorders.erase(invit++);\n }\n}\n\n#endif \/* DEBUG_LOCKORDER *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"txdb.h\"\n#include \"main.h\"\n\nusing namespace std;\n\nvoid static BatchWriteCoins(CLevelDBBatch &batch, const uint256 &hash, const CCoins &coins) {\n if (coins.IsPruned())\n batch.Erase(make_pair('c', hash));\n else\n batch.Write(make_pair('c', hash), coins);\n}\n\nvoid static BatchWriteHashBestChain(CLevelDBBatch &batch, const uint256 &hash) {\n batch.Write('B', hash);\n}\n\nCCoinsViewDB::CCoinsViewDB(bool fMemory) : db(GetDataDir() \/ \"coins\", fMemory) {\n}\n\nbool CCoinsViewDB::GetCoins(uint256 txid, CCoins &coins) { \n return db.Read(make_pair('c', txid), coins); \n}\n\nbool CCoinsViewDB::SetCoins(uint256 txid, const CCoins &coins) {\n CLevelDBBatch batch;\n BatchWriteCoins(batch, txid, coins);\n return db.WriteBatch(batch);\n}\n\nbool CCoinsViewDB::HaveCoins(uint256 txid) {\n return db.Exists(make_pair('c', txid)); \n}\n\nCBlockIndex *CCoinsViewDB::GetBestBlock() {\n uint256 hashBestChain;\n if (!db.Read('B', hashBestChain))\n return NULL;\n std::map<uint256, CBlockIndex*>::iterator it = mapBlockIndex.find(hashBestChain);\n if (it == mapBlockIndex.end())\n return NULL;\n return it->second;\n}\n\nbool CCoinsViewDB::SetBestBlock(CBlockIndex *pindex) {\n CLevelDBBatch batch;\n BatchWriteHashBestChain(batch, pindex->GetBlockHash()); \n return db.WriteBatch(batch);\n}\n\nbool CCoinsViewDB::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) {\n printf(\"Committing %u changed transactions to coin database...\\n\", (unsigned int)mapCoins.size());\n\n CLevelDBBatch batch;\n for (std::map<uint256, CCoins>::const_iterator it = mapCoins.begin(); it != mapCoins.end(); it++)\n BatchWriteCoins(batch, it->first, it->second);\n BatchWriteHashBestChain(batch, pindex->GetBlockHash());\n\n return db.WriteBatch(batch);\n}\n\nCBlockTreeDB::CBlockTreeDB(bool fMemory) : CLevelDB(GetDataDir() \/ \"blktree\", fMemory) {\n}\n\nbool CBlockTreeDB::WriteBlockIndex(const CDiskBlockIndex& blockindex)\n{\n return Write(make_pair('b', blockindex.GetBlockHash()), blockindex);\n}\n\nbool CBlockTreeDB::ReadBestInvalidWork(CBigNum& bnBestInvalidWork)\n{\n return Read('I', bnBestInvalidWork);\n}\n\nbool CBlockTreeDB::WriteBestInvalidWork(const CBigNum& bnBestInvalidWork)\n{\n return Write('I', bnBestInvalidWork);\n}\n\nbool CBlockTreeDB::WriteBlockFileInfo(int nFile, const CBlockFileInfo &info) {\n return Write(make_pair('f', nFile), info);\n}\n\nbool CBlockTreeDB::ReadBlockFileInfo(int nFile, CBlockFileInfo &info) {\n return Read(make_pair('f', nFile), info);\n}\n\nbool CBlockTreeDB::WriteLastBlockFile(int nFile) {\n return Write('l', nFile);\n}\n\nbool CBlockTreeDB::ReadLastBlockFile(int &nFile) {\n return Read('l', nFile);\n}\n\nbool CCoinsViewDB::GetStats(CCoinsStats &stats) {\n leveldb::Iterator *pcursor = db.NewIterator();\n pcursor->SeekToFirst();\n\n while (pcursor->Valid()) {\n try {\n leveldb::Slice slKey = pcursor->key();\n CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);\n char chType;\n ssKey >> chType;\n if (chType == 'c' && !fRequestShutdown) {\n leveldb::Slice slValue = pcursor->value();\n CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);\n CCoins coins;\n ssValue >> coins;\n uint256 txhash;\n ssKey >> txhash;\n\n stats.nTransactions++;\n BOOST_FOREACH(const CTxOut &out, coins.vout) {\n if (!out.IsNull())\n stats.nTransactionOutputs++;\n }\n stats.nSerializedSize += 32 + slValue.size();\n }\n pcursor->Next();\n } catch (std::exception &e) {\n return error(\"%s() : deserialize error\", __PRETTY_FUNCTION__);\n }\n }\n delete pcursor;\n stats.nHeight = GetBestBlock()->nHeight;\n return true;\n}\n\nbool CBlockTreeDB::LoadBlockIndexGuts()\n{\n leveldb::Iterator *pcursor = NewIterator();\n\n CDataStream ssKeySet(SER_DISK, CLIENT_VERSION);\n ssKeySet << make_pair('b', uint256(0));\n pcursor->Seek(ssKeySet.str());\n\n \/\/ Load mapBlockIndex\n while (pcursor->Valid()) {\n try {\n leveldb::Slice slKey = pcursor->key();\n CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);\n char chType;\n ssKey >> chType;\n if (chType == 'b' && !fRequestShutdown) {\n leveldb::Slice slValue = pcursor->value();\n CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);\n CDiskBlockIndex diskindex;\n ssValue >> diskindex;\n\n \/\/ Construct block index object\n CBlockIndex* pindexNew = InsertBlockIndex(diskindex.GetBlockHash());\n pindexNew->pprev = InsertBlockIndex(diskindex.hashPrev);\n pindexNew->nHeight = diskindex.nHeight;\n pindexNew->nFile = diskindex.nFile;\n pindexNew->nDataPos = diskindex.nDataPos;\n pindexNew->nUndoPos = diskindex.nUndoPos;\n pindexNew->nVersion = diskindex.nVersion;\n pindexNew->hashMerkleRoot = diskindex.hashMerkleRoot;\n pindexNew->nTime = diskindex.nTime;\n pindexNew->nBits = diskindex.nBits;\n pindexNew->nNonce = diskindex.nNonce;\n pindexNew->nStatus = diskindex.nStatus;\n pindexNew->nTx = diskindex.nTx;\n\n \/\/ Watch for genesis block\n if (pindexGenesisBlock == NULL && diskindex.GetBlockHash() == hashGenesisBlock)\n pindexGenesisBlock = pindexNew;\n\n if (!pindexNew->CheckIndex())\n return error(\"LoadBlockIndex() : CheckIndex failed: %s\", pindexNew->ToString().c_str());\n\n pcursor->Next();\n } else {\n break; \/\/ if shutdown requested or finished loading block index\n }\n } catch (std::exception &e) {\n return error(\"%s() : deserialize error\", __PRETTY_FUNCTION__);\n }\n }\n delete pcursor;\n\n return true;\n}\n<commit_msg>Bugfix: don't crash by trying to write unchanged best block<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"txdb.h\"\n#include \"main.h\"\n\nusing namespace std;\n\nvoid static BatchWriteCoins(CLevelDBBatch &batch, const uint256 &hash, const CCoins &coins) {\n if (coins.IsPruned())\n batch.Erase(make_pair('c', hash));\n else\n batch.Write(make_pair('c', hash), coins);\n}\n\nvoid static BatchWriteHashBestChain(CLevelDBBatch &batch, const uint256 &hash) {\n batch.Write('B', hash);\n}\n\nCCoinsViewDB::CCoinsViewDB(bool fMemory) : db(GetDataDir() \/ \"coins\", fMemory) {\n}\n\nbool CCoinsViewDB::GetCoins(uint256 txid, CCoins &coins) { \n return db.Read(make_pair('c', txid), coins); \n}\n\nbool CCoinsViewDB::SetCoins(uint256 txid, const CCoins &coins) {\n CLevelDBBatch batch;\n BatchWriteCoins(batch, txid, coins);\n return db.WriteBatch(batch);\n}\n\nbool CCoinsViewDB::HaveCoins(uint256 txid) {\n return db.Exists(make_pair('c', txid)); \n}\n\nCBlockIndex *CCoinsViewDB::GetBestBlock() {\n uint256 hashBestChain;\n if (!db.Read('B', hashBestChain))\n return NULL;\n std::map<uint256, CBlockIndex*>::iterator it = mapBlockIndex.find(hashBestChain);\n if (it == mapBlockIndex.end())\n return NULL;\n return it->second;\n}\n\nbool CCoinsViewDB::SetBestBlock(CBlockIndex *pindex) {\n CLevelDBBatch batch;\n BatchWriteHashBestChain(batch, pindex->GetBlockHash()); \n return db.WriteBatch(batch);\n}\n\nbool CCoinsViewDB::BatchWrite(const std::map<uint256, CCoins> &mapCoins, CBlockIndex *pindex) {\n printf(\"Committing %u changed transactions to coin database...\\n\", (unsigned int)mapCoins.size());\n\n CLevelDBBatch batch;\n for (std::map<uint256, CCoins>::const_iterator it = mapCoins.begin(); it != mapCoins.end(); it++)\n BatchWriteCoins(batch, it->first, it->second);\n if (pindex)\n BatchWriteHashBestChain(batch, pindex->GetBlockHash());\n\n return db.WriteBatch(batch);\n}\n\nCBlockTreeDB::CBlockTreeDB(bool fMemory) : CLevelDB(GetDataDir() \/ \"blktree\", fMemory) {\n}\n\nbool CBlockTreeDB::WriteBlockIndex(const CDiskBlockIndex& blockindex)\n{\n return Write(make_pair('b', blockindex.GetBlockHash()), blockindex);\n}\n\nbool CBlockTreeDB::ReadBestInvalidWork(CBigNum& bnBestInvalidWork)\n{\n return Read('I', bnBestInvalidWork);\n}\n\nbool CBlockTreeDB::WriteBestInvalidWork(const CBigNum& bnBestInvalidWork)\n{\n return Write('I', bnBestInvalidWork);\n}\n\nbool CBlockTreeDB::WriteBlockFileInfo(int nFile, const CBlockFileInfo &info) {\n return Write(make_pair('f', nFile), info);\n}\n\nbool CBlockTreeDB::ReadBlockFileInfo(int nFile, CBlockFileInfo &info) {\n return Read(make_pair('f', nFile), info);\n}\n\nbool CBlockTreeDB::WriteLastBlockFile(int nFile) {\n return Write('l', nFile);\n}\n\nbool CBlockTreeDB::ReadLastBlockFile(int &nFile) {\n return Read('l', nFile);\n}\n\nbool CCoinsViewDB::GetStats(CCoinsStats &stats) {\n leveldb::Iterator *pcursor = db.NewIterator();\n pcursor->SeekToFirst();\n\n while (pcursor->Valid()) {\n try {\n leveldb::Slice slKey = pcursor->key();\n CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);\n char chType;\n ssKey >> chType;\n if (chType == 'c' && !fRequestShutdown) {\n leveldb::Slice slValue = pcursor->value();\n CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);\n CCoins coins;\n ssValue >> coins;\n uint256 txhash;\n ssKey >> txhash;\n\n stats.nTransactions++;\n BOOST_FOREACH(const CTxOut &out, coins.vout) {\n if (!out.IsNull())\n stats.nTransactionOutputs++;\n }\n stats.nSerializedSize += 32 + slValue.size();\n }\n pcursor->Next();\n } catch (std::exception &e) {\n return error(\"%s() : deserialize error\", __PRETTY_FUNCTION__);\n }\n }\n delete pcursor;\n stats.nHeight = GetBestBlock()->nHeight;\n return true;\n}\n\nbool CBlockTreeDB::LoadBlockIndexGuts()\n{\n leveldb::Iterator *pcursor = NewIterator();\n\n CDataStream ssKeySet(SER_DISK, CLIENT_VERSION);\n ssKeySet << make_pair('b', uint256(0));\n pcursor->Seek(ssKeySet.str());\n\n \/\/ Load mapBlockIndex\n while (pcursor->Valid()) {\n try {\n leveldb::Slice slKey = pcursor->key();\n CDataStream ssKey(slKey.data(), slKey.data()+slKey.size(), SER_DISK, CLIENT_VERSION);\n char chType;\n ssKey >> chType;\n if (chType == 'b' && !fRequestShutdown) {\n leveldb::Slice slValue = pcursor->value();\n CDataStream ssValue(slValue.data(), slValue.data()+slValue.size(), SER_DISK, CLIENT_VERSION);\n CDiskBlockIndex diskindex;\n ssValue >> diskindex;\n\n \/\/ Construct block index object\n CBlockIndex* pindexNew = InsertBlockIndex(diskindex.GetBlockHash());\n pindexNew->pprev = InsertBlockIndex(diskindex.hashPrev);\n pindexNew->nHeight = diskindex.nHeight;\n pindexNew->nFile = diskindex.nFile;\n pindexNew->nDataPos = diskindex.nDataPos;\n pindexNew->nUndoPos = diskindex.nUndoPos;\n pindexNew->nVersion = diskindex.nVersion;\n pindexNew->hashMerkleRoot = diskindex.hashMerkleRoot;\n pindexNew->nTime = diskindex.nTime;\n pindexNew->nBits = diskindex.nBits;\n pindexNew->nNonce = diskindex.nNonce;\n pindexNew->nStatus = diskindex.nStatus;\n pindexNew->nTx = diskindex.nTx;\n\n \/\/ Watch for genesis block\n if (pindexGenesisBlock == NULL && diskindex.GetBlockHash() == hashGenesisBlock)\n pindexGenesisBlock = pindexNew;\n\n if (!pindexNew->CheckIndex())\n return error(\"LoadBlockIndex() : CheckIndex failed: %s\", pindexNew->ToString().c_str());\n\n pcursor->Next();\n } else {\n break; \/\/ if shutdown requested or finished loading block index\n }\n } catch (std::exception &e) {\n return error(\"%s() : deserialize error\", __PRETTY_FUNCTION__);\n }\n }\n delete pcursor;\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <cstdarg>\n#include <assert.h>\n\n#include \"opencv2\/opencv.hpp\"\nusing namespace cv;\n\n#include \"structures.hpp\"\n#include \"util.hpp\"\n\nvoid showImage(const char* title, const Mat& img)\n{\n\tstd::cout << \"\\nShowing image: \\\"\" << title << \"\\\".\" << std::endl;\n\tnamedWindow(title, CV_WINDOW_NORMAL);\n\timshow(title, img);\n}\n\nvoid showImageAndWait(const char* title, const Mat& img)\n{\n\tshowImage(title, img);\n\tstd::cout << \"Press any key to continue...\" << std::endl;\n\twaitKey(0);\n}\n\nPoint3f backproject3D(const float x,const float y, float depth, const Mat m_cameraMatrix)\n{\n\tMat new_point = depth * (Mat_<float>(1,3) << x,y,1) * m_cameraMatrix.inv().t();\n\treturn Point3f(new_point);\n}\n\n\/**\n * Custom logger, instantiate with namespace string to prefix messages with.\n * For example:\n * Logger _log(\"Load Images\");\n *\/\nLogger::Logger(const char* _namespace)\n\t: name_space(_namespace), start(ch::system_clock::now())\n{}\n\nvoid Logger::operator() (const char* format, ...)\n{\n\tva_list args;\n\tva_start(args, format);\n\n\tprintf(\"%s>\\t\", name_space);\n\tvprintf(format, args);\n\tprintf(\"\\n\");\n\n\tva_end(args);\n}\n\nvoid Logger::tok()\n{\n\tconst clock_t end = ch::system_clock::now();\n\tch::milliseconds dur = ch::duration_cast<ch::milliseconds>(end - start);\n\t(*this)(\"Done in %.2fs.\", (float)dur.count() \/ 1e3);\n}\n\n\/*\n * convert rotation matrix to quaternion\n*\/\nVec4f R2Quaternion(Mat& R)\n{\n\tassert(R.rows == 3 && R.cols == 3);\n\t\/\/ typedef typename DataType<float>::work_type _wTp;\n\tif (R.type() != CV_32F) R.convertTo(R, CV_32F);;\n\tfloat q0,q1,q2,q3;\n\tfloat r00 = R.at<float>(0,0);\n\tfloat r01 = R.at<float>(0,1);\n\tfloat r02 = R.at<float>(0,2);\n\tfloat r10 = R.at<float>(1,0);\n\tfloat r11 = R.at<float>(1,1);\n\tfloat r12 = R.at<float>(1,2);\n\tfloat r20 = R.at<float>(2,0);\n\tfloat r21 = R.at<float>(2,1);\n\tfloat r22 = R.at<float>(2,2);\n\n\tfloat trace = r00 + r11 + r22;\n\tif( trace > 0 ){\n\t\tfloat s = 0.5 \/ sqrt(trace+ 1.0);\n \tq0 = 0.25 \/ s;\n \tq1 = ( r21 - r12 ) * s;\n \tq2 = ( r02 - r20 ) * s;\n \tq3 = ( r10 - r01 ) * s;\n\t} else {\n \tif ( r00 > r11 && r00 > r22 ) \n \t{\n \tfloat s = 2.0 * sqrt( 1.0 + r00 - r11 - r22);\n \tq0 = (r21 - r12 ) \/ s;\n \tq1 = 0.25 * s;\n \tq2 = (r01 + r10 ) \/ s;\n \tq3 = (r02 + r20 ) \/ s;\n \t} else if (r11 > r22) {\n\t float s = 2.0 * sqrt( 1.0 + r11 - r00 - r22);\n\t q0 = (r02 - r20 ) \/ s;\n\t q1 = (r01 + r10 ) \/ s;\n\t q2 = 0.25 * s;\n\t q3 = (r12 + r21 ) \/ s;\n \t} else {\n \tfloat s = 2.0 * sqrt( 1.0 + r22 - r00 - r11 );\n \tq0 = (r10 - r01 ) \/ s;\n\t q1 = (r02 + r20 ) \/ s;\n\t q2 = (r12 + r21 ) \/ s;\n\t q3 = 0.25 * s;\n \t}\n\t}\n\tVec4f q = normalize(Vec<float,4>::Vec(q0, q1, q2, q3));\n\treturn q;\n}\n\nMat quat2R(Vec4f& q){\n\t\n float sqw = q[0]*q[0];\n float sqx = q[1]*q[1];\n float sqy = q[2]*q[2];\n float sqz = q[3]*q[3];\n\n \/\/ invs (inverse square length) is only required if quaternion is not already normalised\n float invs = 1 \/ (sqx + sqy + sqz + sqw);\n float m00 = ( sqx - sqy - sqz + sqw)*invs ; \/\/ since sqw + sqx + sqy + sqz =1\/invs*invs\n float m11 = (-sqx + sqy - sqz + sqw)*invs ;\n float m22 = (-sqx - sqy + sqz + sqw)*invs ;\n \n float tmp1 = q[1]*q[2];\n float tmp2 = q[3]*q[0];\n float m10 = 2.0 * (tmp1 + tmp2)*invs ;\n float m01 = 2.0 * (tmp1 - tmp2)*invs ;\n \n tmp1 = q[1]*q[3];\n tmp2 = q[2]*q[0];\n float m20 = 2.0 * (tmp1 - tmp2)*invs ;\n float m02 = 2.0 * (tmp1 + tmp2)*invs ;\n tmp1 = q[2]*q[3];\n tmp2 = q[1]*q[0];\n float m21 = 2.0 * (tmp1 + tmp2)*invs ;\n float m12 = 2.0 * (tmp1 - tmp2)*invs ;\n Mat R = (Mat_<float>(3,3) << m00, m01, m02, m10, m11, m12, m20, m21, m22);\n return R;\n}\n\nbool checkCoherentRotation(cv::Mat& R) {\n\t\n\tif(fabs(determinant(R))-1.0 > 1e-05) return false;\n\treturn true;\n}\n\nbool checkCoherentQ(Vec4f& q0, Vec4f& q1)\n{\t\n\tVec4f absdelta,reldelta;\n\tabsdiff(q0,q1,absdelta);\n\tdivide(absdelta,q1,reldelta);\n\tif (reldelta[0]>0.05 ||reldelta[1]>0.05 ||reldelta[2]>0.05 ||reldelta[3]>0.05)\n\t\treturn false;\n\treturn true;\n}\n\n<commit_msg>Fix Vec4f constructor in util<commit_after>#include <cmath>\n#include <cstdarg>\n#include <assert.h>\n\n#include \"opencv2\/opencv.hpp\"\nusing namespace cv;\n\n#include \"structures.hpp\"\n#include \"util.hpp\"\n\nvoid showImage(const char* title, const Mat& img)\n{\n\tstd::cout << \"\\nShowing image: \\\"\" << title << \"\\\".\" << std::endl;\n\tnamedWindow(title, CV_WINDOW_NORMAL);\n\timshow(title, img);\n}\n\nvoid showImageAndWait(const char* title, const Mat& img)\n{\n\tshowImage(title, img);\n\tstd::cout << \"Press any key to continue...\" << std::endl;\n\twaitKey(0);\n}\n\nPoint3f backproject3D(const float x,const float y, float depth, const Mat m_cameraMatrix)\n{\n\tMat new_point = depth * (Mat_<float>(1,3) << x,y,1) * m_cameraMatrix.inv().t();\n\treturn Point3f(new_point);\n}\n\n\/**\n * Custom logger, instantiate with namespace string to prefix messages with.\n * For example:\n * Logger _log(\"Load Images\");\n *\/\nLogger::Logger(const char* _namespace)\n\t: name_space(_namespace), start(ch::system_clock::now())\n{}\n\nvoid Logger::operator() (const char* format, ...)\n{\n\tva_list args;\n\tva_start(args, format);\n\n\tprintf(\"%s>\\t\", name_space);\n\tvprintf(format, args);\n\tprintf(\"\\n\");\n\n\tva_end(args);\n}\n\nvoid Logger::tok()\n{\n\tconst clock_t end = ch::system_clock::now();\n\tch::milliseconds dur = ch::duration_cast<ch::milliseconds>(end - start);\n\t(*this)(\"Done in %.2fs.\", (float)dur.count() \/ 1e3);\n}\n\n\/*\n * convert rotation matrix to quaternion\n*\/\nVec4f R2Quaternion(Mat& R)\n{\n\tassert(R.rows == 3 && R.cols == 3);\n\t\/\/ typedef typename DataType<float>::work_type _wTp;\n\tif (R.type() != CV_32F) R.convertTo(R, CV_32F);;\n\tfloat q0,q1,q2,q3;\n\tfloat r00 = R.at<float>(0,0);\n\tfloat r01 = R.at<float>(0,1);\n\tfloat r02 = R.at<float>(0,2);\n\tfloat r10 = R.at<float>(1,0);\n\tfloat r11 = R.at<float>(1,1);\n\tfloat r12 = R.at<float>(1,2);\n\tfloat r20 = R.at<float>(2,0);\n\tfloat r21 = R.at<float>(2,1);\n\tfloat r22 = R.at<float>(2,2);\n\n\tfloat trace = r00 + r11 + r22;\n\tif( trace > 0 ){\n\t\tfloat s = 0.5 \/ sqrt(trace+ 1.0);\n \tq0 = 0.25 \/ s;\n \tq1 = ( r21 - r12 ) * s;\n \tq2 = ( r02 - r20 ) * s;\n \tq3 = ( r10 - r01 ) * s;\n\t} else {\n \tif ( r00 > r11 && r00 > r22 ) \n \t{\n \tfloat s = 2.0 * sqrt( 1.0 + r00 - r11 - r22);\n \tq0 = (r21 - r12 ) \/ s;\n \tq1 = 0.25 * s;\n \tq2 = (r01 + r10 ) \/ s;\n \tq3 = (r02 + r20 ) \/ s;\n \t} else if (r11 > r22) {\n\t float s = 2.0 * sqrt( 1.0 + r11 - r00 - r22);\n\t q0 = (r02 - r20 ) \/ s;\n\t q1 = (r01 + r10 ) \/ s;\n\t q2 = 0.25 * s;\n\t q3 = (r12 + r21 ) \/ s;\n \t} else {\n \tfloat s = 2.0 * sqrt( 1.0 + r22 - r00 - r11 );\n \tq0 = (r10 - r01 ) \/ s;\n\t q1 = (r02 + r20 ) \/ s;\n\t q2 = (r12 + r21 ) \/ s;\n\t q3 = 0.25 * s;\n \t}\n\t}\n\tVec4f q = normalize(Vec4f(q0, q1, q2, q3));\n\treturn q;\n}\n\nMat quat2R(Vec4f& q){\n\n float sqw = q[0]*q[0];\n float sqx = q[1]*q[1];\n float sqy = q[2]*q[2];\n float sqz = q[3]*q[3];\n\n \/\/ invs (inverse square length) is only required if quaternion is not already normalised\n float invs = 1 \/ (sqx + sqy + sqz + sqw);\n float m00 = ( sqx - sqy - sqz + sqw)*invs ; \/\/ since sqw + sqx + sqy + sqz =1\/invs*invs\n float m11 = (-sqx + sqy - sqz + sqw)*invs ;\n float m22 = (-sqx - sqy + sqz + sqw)*invs ;\n \n float tmp1 = q[1]*q[2];\n float tmp2 = q[3]*q[0];\n float m10 = 2.0 * (tmp1 + tmp2)*invs ;\n float m01 = 2.0 * (tmp1 - tmp2)*invs ;\n \n tmp1 = q[1]*q[3];\n tmp2 = q[2]*q[0];\n float m20 = 2.0 * (tmp1 - tmp2)*invs ;\n float m02 = 2.0 * (tmp1 + tmp2)*invs ;\n tmp1 = q[2]*q[3];\n tmp2 = q[1]*q[0];\n float m21 = 2.0 * (tmp1 + tmp2)*invs ;\n float m12 = 2.0 * (tmp1 - tmp2)*invs ;\n Mat R = (Mat_<float>(3,3) << m00, m01, m02, m10, m11, m12, m20, m21, m22);\n return R;\n}\n\nbool checkCoherentRotation(cv::Mat& R) {\n\t\n\tif(fabs(determinant(R))-1.0 > 1e-05) return false;\n\treturn true;\n}\n\nbool checkCoherentQ(Vec4f& q0, Vec4f& q1)\n{\t\n\tVec4f absdelta,reldelta;\n\tabsdiff(q0,q1,absdelta);\n\tdivide(absdelta,q1,reldelta);\n\tif (reldelta[0]>0.05 ||reldelta[1]>0.05 ||reldelta[2]>0.05 ||reldelta[3]>0.05)\n\t\treturn false;\n\treturn true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkImageRegistrationMethodTest_16.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#include \"itkImageRegistrationMethod.h\"\n#include \"itkAffineTransform.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkGradientDescentOptimizer.h\"\n#include \"itkMeanSquaresImageToImageMetric.h\"\n#include \"itkCommandIterationUpdate.h\"\n\n#include \"itkImageRegistrationMethodImageSource.h\"\n\n\/** \n * This program tests one instantiation of the itk::ImageRegistrationMethod class\n * \n * \n *\/\n\n\ntemplate<class DataType>\nbool DoRegistration ()\n{\n \n bool pass = true;\n\n const unsigned int dimension = 2;\n\n \/\/ Fixed Image Type\n typedef itk::Image<DataType,dimension> FixedImageType;\n\n \/\/ Moving Image Type\n typedef itk::Image<DataType,dimension> MovingImageType;\n\n \/\/ Size Type\n typedef typename MovingImageType::SizeType SizeType;\n\n \/\/ Transform Type\n typedef itk::AffineTransform< double, dimension > TransformType;\n typedef typename TransformType::ParametersType ParametersType;\n\n typedef typename FixedImageType::PixelType FixedImagePixelType;\n typedef typename MovingImageType::PixelType MovingImagePixelType;\n\n \/\/ ImageSource\n typedef itk::testhelper::ImageRegistrationMethodImageSource<\n FixedImagePixelType,\n MovingImagePixelType,\n dimension > ImageSourceType;\n \/\/ Transform Type\n typedef itk::AffineTransform< double, dimension > TransformType;\n typedef typename TransformType::ParametersType ParametersType;\n\n \/\/ Optimizer Type\n typedef itk::GradientDescentOptimizer OptimizerType;\n\n \/\/ Metric Type\n typedef itk::MeanSquaresImageToImageMetric< \n FixedImageType, \n MovingImageType > MetricType;\n\n \/\/ Interpolation technique\n typedef itk:: LinearInterpolateImageFunction< \n MovingImageType,\n double > InterpolatorType;\n\n \/\/ Registration Method\n typedef itk::ImageRegistrationMethod< \n FixedImageType, \n MovingImageType > RegistrationType;\n\n typedef itk::CommandIterationUpdate< \n OptimizerType > CommandIterationType;\n\n\n typename MetricType::Pointer metric = MetricType::New();\n typename TransformType::Pointer transform = TransformType::New();\n typename OptimizerType::Pointer optimizer = OptimizerType::New();\n typename TransformType::Pointer trasform = TransformType::New();\n typename InterpolatorType::Pointer interpolator = InterpolatorType::New();\n typename RegistrationType::Pointer registration = RegistrationType::New();\n\n typename ImageSourceType::Pointer imageSource = ImageSourceType::New();\n\n SizeType size;\n size[0] = 100;\n size[1] = 100;\n \n imageSource->GenerateImages( size );\n\n typename FixedImageType::ConstPointer fixedImage = imageSource->GetFixedImage();\n typename MovingImageType::ConstPointer movingImage = imageSource->GetMovingImage();\n\n \/\/\n \/\/ Connect all the components required for Registratio\n \/\/\n registration->SetMetric( metric );\n registration->SetOptimizer( optimizer );\n registration->SetTransform( transform );\n registration->SetFixedImage( fixedImage );\n registration->SetMovingImage( movingImage );\n registration->SetInterpolator( interpolator );\n\n\n \/\/ Select the Region of Interest over which the Metric will be computed\n \/\/ Registration time will be proportional to the number of pixels in this region.\n metric->SetFixedImageRegion( fixedImage->GetBufferedRegion() );\n\n \/\/ Instantiate an Observer to report the progress of the Optimization\n CommandIterationType::Pointer iterationCommand = CommandIterationType::New();\n iterationCommand->SetOptimizer( optimizer.GetPointer() );\n\n \/\/ Scale the translation components of the Transform in the Optimizer\n OptimizerType::ScalesType scales( transform->GetNumberOfParameters() );\n scales.Fill( 1.0 );\n\n \n unsigned long numberOfIterations = 100;\n double translationScale = 1e-6;\n double learningRate = 1e-8;\n\n for( unsigned int i=0; i<dimension; i++)\n {\n scales[ i + dimension * dimension ] = translationScale;\n }\n\n optimizer->SetScales( scales );\n optimizer->SetLearningRate( learningRate );\n optimizer->SetNumberOfIterations( numberOfIterations );\n optimizer->MinimizeOn();\n\n \/\/ Start from an Identity transform (in a normal case, the user \n \/\/ can probably provide a better guess than the identity...\n transform->SetIdentity();\n registration->SetInitialTransformParameters( transform->GetParameters() );\n\n \/\/ Initialize the internal connections of the registration method. \n \/\/ This can potentially throw an exception\n try\n {\n registration->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << e << std::endl;\n pass = false;\n }\n\n ParametersType actualParameters = imageSource->GetActualParameters();\n ParametersType finalParameters = registration->GetLastTransformParameters();\n\n const unsigned int numbeOfParameters = actualParameters.Size();\n\n \/\/ We know that for the Affine transform the Translation parameters are at \n \/\/ the end of the list of parameters.\n const unsigned int offsetOrder = finalParameters.Size()-actualParameters.Size();\n \n\n\n const double tolerance = 1.0; \/\/ equivalent to 1 pixel.\n\n for(unsigned int i=0; i<numbeOfParameters; i++) \n {\n \/\/ the parameters are negated in order to get the inverse transformation.\n \/\/ this only works for comparing translation parameters....\n std::cout << finalParameters[i+offsetOrder] << \" == \" << -actualParameters[i] << std::endl;\n if( fabs ( finalParameters[i+offsetOrder] - (-actualParameters[i]) ) > tolerance )\n {\n std::cout << \"Tolerance exceeded at component \" << i << std::endl;\n pass = false;\n }\n }\n\n return pass;\n\n}\nint itkImageRegistrationMethodTest_16(int itkNotUsed(argc), char*[] itkNotUsed(argv) )\n{\n bool result_uc, result_c, result_us, result_s,\n result_ui, result_i, result_ul, result_l,\n result_f, result_d;\n result_uc = DoRegistration<unsigned char>();\n result_c = DoRegistration<char>();\n result_us = DoRegistration<unsigned short>();\n result_s = DoRegistration<short>();\n result_ui = DoRegistration<unsigned int>();\n result_i = DoRegistration<int>();\n result_ul = DoRegistration<unsigned long>();\n result_l = DoRegistration<long>();\n result_f = DoRegistration<float>();\n#ifndef __BORLANDC__\n result_d = DoRegistration<double>();\n#else\n result_d = true;\n#endif\n\n std::cout << \"<unsigned char>: \" << result_uc << std::endl;\n std::cout << \"<char>: \" << result_c << std::endl;\n std::cout << \"<unsigned short>: \" << result_us << std::endl;\n std::cout << \"<short>: \" << result_s << std::endl;\n std::cout << \"<unsigned int>: \" << result_ui << std::endl;\n std::cout << \"<int>: \" << result_i << std::endl;\n std::cout << \"<unsigned long>: \" << result_ul << std::endl;\n std::cout << \"<long>: \" << result_l << std::endl;\n std::cout << \"<float>: \" << result_f << std::endl;\n std::cout << \"<double>: \" << result_d << std::endl;\n \n return EXIT_SUCCESS;\n}\n\n<commit_msg>COMP: ITK_LEAN_AND_MEAN to avoid overflow in Microsoft compiler.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkImageRegistrationMethodTest_16.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n#ifdef _MSC_VER\n#define ITK_LEAN_AND_MEAN\n#endif\n\n#include \"itkImageRegistrationMethod.h\"\n#include \"itkAffineTransform.h\"\n#include \"itkLinearInterpolateImageFunction.h\"\n#include \"itkGradientDescentOptimizer.h\"\n#include \"itkMeanSquaresImageToImageMetric.h\"\n#include \"itkCommandIterationUpdate.h\"\n\n#include \"itkImageRegistrationMethodImageSource.h\"\n\n\/** \n * This program tests one instantiation of the itk::ImageRegistrationMethod class\n * \n * \n *\/\n\n\ntemplate<class DataType>\nbool DoRegistration ()\n{\n \n bool pass = true;\n\n const unsigned int dimension = 2;\n\n \/\/ Fixed Image Type\n typedef itk::Image<DataType,dimension> FixedImageType;\n\n \/\/ Moving Image Type\n typedef itk::Image<DataType,dimension> MovingImageType;\n\n \/\/ Size Type\n typedef typename MovingImageType::SizeType SizeType;\n\n \/\/ Transform Type\n typedef itk::AffineTransform< double, dimension > TransformType;\n typedef typename TransformType::ParametersType ParametersType;\n\n typedef typename FixedImageType::PixelType FixedImagePixelType;\n typedef typename MovingImageType::PixelType MovingImagePixelType;\n\n \/\/ ImageSource\n typedef itk::testhelper::ImageRegistrationMethodImageSource<\n FixedImagePixelType,\n MovingImagePixelType,\n dimension > ImageSourceType;\n \/\/ Transform Type\n typedef itk::AffineTransform< double, dimension > TransformType;\n typedef typename TransformType::ParametersType ParametersType;\n\n \/\/ Optimizer Type\n typedef itk::GradientDescentOptimizer OptimizerType;\n\n \/\/ Metric Type\n typedef itk::MeanSquaresImageToImageMetric< \n FixedImageType, \n MovingImageType > MetricType;\n\n \/\/ Interpolation technique\n typedef itk:: LinearInterpolateImageFunction< \n MovingImageType,\n double > InterpolatorType;\n\n \/\/ Registration Method\n typedef itk::ImageRegistrationMethod< \n FixedImageType, \n MovingImageType > RegistrationType;\n\n typedef itk::CommandIterationUpdate< \n OptimizerType > CommandIterationType;\n\n\n typename MetricType::Pointer metric = MetricType::New();\n typename TransformType::Pointer transform = TransformType::New();\n typename OptimizerType::Pointer optimizer = OptimizerType::New();\n typename TransformType::Pointer trasform = TransformType::New();\n typename InterpolatorType::Pointer interpolator = InterpolatorType::New();\n typename RegistrationType::Pointer registration = RegistrationType::New();\n\n typename ImageSourceType::Pointer imageSource = ImageSourceType::New();\n\n SizeType size;\n size[0] = 100;\n size[1] = 100;\n \n imageSource->GenerateImages( size );\n\n typename FixedImageType::ConstPointer fixedImage = imageSource->GetFixedImage();\n typename MovingImageType::ConstPointer movingImage = imageSource->GetMovingImage();\n\n \/\/\n \/\/ Connect all the components required for Registratio\n \/\/\n registration->SetMetric( metric );\n registration->SetOptimizer( optimizer );\n registration->SetTransform( transform );\n registration->SetFixedImage( fixedImage );\n registration->SetMovingImage( movingImage );\n registration->SetInterpolator( interpolator );\n\n\n \/\/ Select the Region of Interest over which the Metric will be computed\n \/\/ Registration time will be proportional to the number of pixels in this region.\n metric->SetFixedImageRegion( fixedImage->GetBufferedRegion() );\n\n \/\/ Instantiate an Observer to report the progress of the Optimization\n CommandIterationType::Pointer iterationCommand = CommandIterationType::New();\n iterationCommand->SetOptimizer( optimizer.GetPointer() );\n\n \/\/ Scale the translation components of the Transform in the Optimizer\n OptimizerType::ScalesType scales( transform->GetNumberOfParameters() );\n scales.Fill( 1.0 );\n\n \n unsigned long numberOfIterations = 100;\n double translationScale = 1e-6;\n double learningRate = 1e-8;\n\n for( unsigned int i=0; i<dimension; i++)\n {\n scales[ i + dimension * dimension ] = translationScale;\n }\n\n optimizer->SetScales( scales );\n optimizer->SetLearningRate( learningRate );\n optimizer->SetNumberOfIterations( numberOfIterations );\n optimizer->MinimizeOn();\n\n \/\/ Start from an Identity transform (in a normal case, the user \n \/\/ can probably provide a better guess than the identity...\n transform->SetIdentity();\n registration->SetInitialTransformParameters( transform->GetParameters() );\n\n \/\/ Initialize the internal connections of the registration method. \n \/\/ This can potentially throw an exception\n try\n {\n registration->Update();\n }\n catch( itk::ExceptionObject & e )\n {\n std::cerr << e << std::endl;\n pass = false;\n }\n\n ParametersType actualParameters = imageSource->GetActualParameters();\n ParametersType finalParameters = registration->GetLastTransformParameters();\n\n const unsigned int numbeOfParameters = actualParameters.Size();\n\n \/\/ We know that for the Affine transform the Translation parameters are at \n \/\/ the end of the list of parameters.\n const unsigned int offsetOrder = finalParameters.Size()-actualParameters.Size();\n \n\n\n const double tolerance = 1.0; \/\/ equivalent to 1 pixel.\n\n for(unsigned int i=0; i<numbeOfParameters; i++) \n {\n \/\/ the parameters are negated in order to get the inverse transformation.\n \/\/ this only works for comparing translation parameters....\n std::cout << finalParameters[i+offsetOrder] << \" == \" << -actualParameters[i] << std::endl;\n if( fabs ( finalParameters[i+offsetOrder] - (-actualParameters[i]) ) > tolerance )\n {\n std::cout << \"Tolerance exceeded at component \" << i << std::endl;\n pass = false;\n }\n }\n\n return pass;\n\n}\nint itkImageRegistrationMethodTest_16(int itkNotUsed(argc), char*[] itkNotUsed(argv) )\n{\n bool result_uc, result_c, result_us, result_s,\n result_ui, result_i, result_ul, result_l,\n result_f, result_d;\n result_uc = DoRegistration<unsigned char>();\n result_c = DoRegistration<char>();\n result_us = DoRegistration<unsigned short>();\n result_s = DoRegistration<short>();\n result_ui = DoRegistration<unsigned int>();\n result_i = DoRegistration<int>();\n result_ul = DoRegistration<unsigned long>();\n result_l = DoRegistration<long>();\n result_f = DoRegistration<float>();\n#ifndef __BORLANDC__\n result_d = DoRegistration<double>();\n#else\n result_d = true;\n#endif\n\n std::cout << \"<unsigned char>: \" << result_uc << std::endl;\n std::cout << \"<char>: \" << result_c << std::endl;\n std::cout << \"<unsigned short>: \" << result_us << std::endl;\n std::cout << \"<short>: \" << result_s << std::endl;\n std::cout << \"<unsigned int>: \" << result_ui << std::endl;\n std::cout << \"<int>: \" << result_i << std::endl;\n std::cout << \"<unsigned long>: \" << result_ul << std::endl;\n std::cout << \"<long>: \" << result_l << std::endl;\n std::cout << \"<float>: \" << result_f << std::endl;\n std::cout << \"<double>: \" << result_d << std::endl;\n \n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Game.hpp\"\n\nGame::Game(options o) : players(o.players), this_player_go(o.this_player_go) {\n \/\/ Generate board and start playing\n rapidjson::Document d = get_config_from_file(o.board_config);\n string board_name(d[\"board_name\"].GetString());\n int width = d[\"board_width\"].GetInt();\n int height = d[\"board_height\"].GetInt();\n rapidjson::Value& mods(d[\"modifiers\"]);\n rapidjson::Value& scores(d[\"scores\"]);\n this->b = new Board(board_name, width, height, mods, scores);\n\n \/\/ Get other details (for later implementation)\n if (d.HasMember(\"tiles\") &&\n d[\"tiles\"].HasMember(\"each\") &&\n d[\"tiles\"].HasMember(\"total\")) {\n this->tiles_each = d[\"tiles\"][\"each\"].GetInt();\n this->tiles_left = d[\"tiles\"][\"total\"].GetInt();\n } else {\n this->tiles_each = 7;\n this->tiles_left = 100;\n }\n\n assert(o.players > 0 && o.this_player_go > 0 && o.this_player_go <= o.players);\n\n cout << \"Players:\\t\" << this->players << endl;\n cout << \"Your Go:\\t\" << this->this_player_go << endl;\n cout << endl;\n cout << \"Board:\\t\" << endl;\n this->b->print_board();\n\n int go = 0;\n while (!this->is_end()) {\n int player_turn = go % o.players;\n if (player_turn == o.this_player_go - 1) {\n cout << \"Your go!\" << endl;\n this->player_go();\n } else {\n cout << \"Opponent's go:\\tPlayer\" << (player_turn + 1) << endl;\n this->opponent_go();\n this->b->print_board();\n }\n go++;\n }\n}\n\nrapidjson::Document get_config_from_file(string& config) {\n ifstream config_file(config);\n\n \/\/ get length of file:\n config_file.seekg (0, config_file.end);\n int length = config_file.tellg();\n config_file.seekg (0, config_file.beg);\n char* config_file_raw = new char[length];\n\n config_file.read(config_file_raw, length);\n\n rapidjson::Document d;\n d.Parse(config_file_raw);\n\n return d;\n}\n\nbool Game::is_end(void) {\n return this->tiles_left == 0;\n}\n\nvoid Game::opponent_go(void) {\n while (true) {\n string input;\n\n \/\/ For putting on the Board\n string word;\n int x, y;\n Direction d;\n\n while (true) {\n string word_regex(\"[A-Za-z]{0,\");\n word_regex.append(to_string(this->tiles_each));\n word_regex.append(\"}\");\n regex validator(word_regex);\n\n \/\/ Get the word\n cout << \"Please enter the word (if you type more than 1 word, the second will be ignored):\\t\";\n cin >> noskipws >> input;\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n if (input.compare(\"\") == 0) {\n cout << \"The opponent passed!\" << endl;\n return;\n }\n\n if (regex_match(input, validator) && valid_word_for_game(input)) {\n word = input;\n break;\n }\n\n cout << \"The word you entered was invalid. Please try again.\" << endl;\n }\n\n while (true) {\n regex y_(\"^[A-Za-z]$\");\n\n \/\/ Get the position\n cout << \"Please enter the position on the board (e.g. 1 A):\\t\";\n cin >> input;\n try {\n x = stoi(input);\n if (x <= 0 || x > this->b->get_width()) {\n throw invalid_argument(\"\");\n }\n x -= 1; \/\/ Convert from user to program\n } catch (invalid_argument e) {\n cout << \"The value \" << input << \" is not in the range {1,\"\n << this->b->get_width() << \"}.\"<< endl;\n continue;\n }\n\n cin >> input;\n if (!regex_match(input, y_)) {\n continue;\n }\n y = (int) toupper(input[0]) - 'A';\n\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n if (valid_position_for_game(x, y)) {\n break;\n }\n }\n\n while (true) {\n \/\/ Get the word\n cout << \"Please enter the direction (NORTH|EAST|SOUTH|WEST):\\t\";\n cin >> input;\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n for (auto& c : input) {\n c = toupper(c);\n }\n\n if (input.compare(\"NORTH\") == 0) {\n d = NORTH; break;\n } else if (input.compare(\"EAST\") == 0) {\n d = EAST; break;\n } else if (input.compare(\"SOUTH\") == 0) {\n d = SOUTH; break;\n } else if (input.compare(\"WEST\") == 0) {\n d = WEST; break;\n }\n\n cout << \"Incorrect direction. Please try again!\" << endl;\n }\n\n if (can_put_word_on_board(word, x, y, d)) {\n this->b->set_word(word, x, y, d);\n break;\n }\n\n cout << \"Incorrect parameters specified. Please try again!\" << endl;\n }\n}\n\nvoid Game::player_go(void) {\n while (true) {\n string input_; \/\/ Dummy variable\n vector<char > input;\n\n \/\/ For putting on the Board\n int tiles_available = 0;\n \/\/ string word;\n \/\/ int x, y;\n \/\/ Direction d;\n\n \/\/ Get the number of tiles\n while (true) {\n cout << \"How many tiles do you have left? (Between 0 and \" << this->tiles_each << \")\\t\";\n cin >> input_;\n try {\n tiles_available = stoi(input_);\n if (tiles_available > 0 && tiles_available <= this->tiles_each) {\n break;\n }\n } catch (invalid_argument e) {\n continue;\n }\n }\n\n \/\/ Get the tiles from the user\n while (true) {\n string word_regex(\"[A-Za-z]{0,\");\n word_regex.append(to_string(this->tiles_each));\n word_regex.append(\"}\");\n regex validator(word_regex);\n\n \/\/ Get the word\n cout << \"Please enter the tiles you have left, separated by a space:\\t\";\n char c;\n for (int i = 0; i < tiles_available; i++) {\n cin >> c;\n input.push_back(toupper(c));\n }\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n for (auto it = input.begin(); it != input.end(); it++) {\n cout << *it << \" \";\n }\n cout << endl;\n }\n }\n}\n\nbool Game::valid_word_for_game(string& input) {\n return true;\n}\n\nbool Game::valid_position_for_game(int& x, int& y) {\n return true;\n}\n\nbool Game::can_put_word_on_board(string& word, int& w, int& h, Direction& d) {\n return true;\n}\n<commit_msg>Clean up<commit_after>#include \"Game.hpp\"\n\nGame::Game(options o) : players(o.players), this_player_go(o.this_player_go) {\n \/\/ Generate board and start playing\n rapidjson::Document d = get_config_from_file(o.board_config);\n string board_name(d[\"board_name\"].GetString());\n int width = d[\"board_width\"].GetInt();\n int height = d[\"board_height\"].GetInt();\n rapidjson::Value& mods(d[\"modifiers\"]);\n rapidjson::Value& scores(d[\"scores\"]);\n this->b = new Board(board_name, width, height, mods, scores);\n\n \/\/ Get other details (for later implementation)\n if (d.HasMember(\"tiles\") &&\n d[\"tiles\"].HasMember(\"each\") &&\n d[\"tiles\"].HasMember(\"total\")) {\n this->tiles_each = d[\"tiles\"][\"each\"].GetInt();\n this->tiles_left = d[\"tiles\"][\"total\"].GetInt();\n } else {\n this->tiles_each = 7;\n this->tiles_left = 100;\n }\n\n assert(o.players > 0 && o.this_player_go > 0 && o.this_player_go <= o.players);\n\n cout << \"Players:\\t\" << this->players << endl;\n cout << \"Your Go:\\t\" << this->this_player_go << endl;\n cout << endl;\n cout << \"Board:\\t\" << endl;\n this->b->print_board();\n\n int go = 0;\n while (!this->is_end()) {\n int player_turn = go % o.players;\n if (player_turn == o.this_player_go - 1) {\n cout << \"Your go!\" << endl;\n this->player_go();\n } else {\n cout << \"Opponent's go:\\tPlayer\" << (player_turn + 1) << endl;\n this->opponent_go();\n this->b->print_board();\n }\n go++;\n }\n}\n\nrapidjson::Document get_config_from_file(string& config) {\n ifstream config_file(config);\n\n \/\/ get length of file:\n config_file.seekg (0, config_file.end);\n int length = config_file.tellg();\n config_file.seekg (0, config_file.beg);\n char* config_file_raw = new char[length];\n\n config_file.read(config_file_raw, length);\n\n rapidjson::Document d;\n d.Parse(config_file_raw);\n\n return d;\n}\n\nbool Game::is_end(void) {\n return this->tiles_left == 0;\n}\n\nvoid Game::opponent_go(void) {\n while (true) {\n string input;\n\n \/\/ For putting on the Board\n string word;\n int x, y;\n Direction d;\n\n while (true) {\n string word_regex(\"[A-Za-z]{0,\");\n word_regex.append(to_string(this->tiles_each));\n word_regex.append(\"}\");\n regex validator(word_regex);\n\n \/\/ Get the word\n cout << \"Please enter the word (if you type more than 1 word, the second will be ignored):\\t\";\n cin >> noskipws >> input;\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n if (input.compare(\"\") == 0) {\n cout << \"The opponent passed!\" << endl;\n return;\n }\n\n if (regex_match(input, validator) && valid_word_for_game(input)) {\n word = input;\n break;\n }\n\n cout << \"The word you entered was invalid. Please try again.\" << endl;\n }\n\n while (true) {\n regex y_(\"^[A-Za-z]$\");\n\n \/\/ Get the position\n cout << \"Please enter the position on the board (e.g. 1 A):\\t\";\n cin >> input;\n try {\n x = stoi(input);\n if (x <= 0 || x > this->b->get_width()) {\n throw invalid_argument(\"\");\n }\n x -= 1; \/\/ Convert from user to program\n } catch (invalid_argument e) {\n cout << \"The value \" << input << \" is not in the range {1,\"\n << this->b->get_width() << \"}.\"<< endl;\n continue;\n }\n\n cin >> input;\n if (!regex_match(input, y_)) {\n continue;\n }\n y = (int) toupper(input[0]) - 'A';\n\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n if (valid_position_for_game(x, y)) {\n break;\n }\n }\n\n while (true) {\n \/\/ Get the word\n cout << \"Please enter the direction (NORTH|EAST|SOUTH|WEST):\\t\";\n cin >> input;\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n\n for (auto& c : input) {\n c = toupper(c);\n }\n\n if (input.compare(\"NORTH\") == 0) {\n d = NORTH; break;\n } else if (input.compare(\"EAST\") == 0) {\n d = EAST; break;\n } else if (input.compare(\"SOUTH\") == 0) {\n d = SOUTH; break;\n } else if (input.compare(\"WEST\") == 0) {\n d = WEST; break;\n }\n\n cout << \"Incorrect direction. Please try again!\" << endl;\n }\n\n if (can_put_word_on_board(word, x, y, d)) {\n this->b->set_word(word, x, y, d);\n break;\n }\n\n cout << \"Incorrect parameters specified. Please try again!\" << endl;\n }\n}\n\nvoid Game::player_go(void) {\n while (true) {\n string input_; \/\/ Dummy variable\n vector<char > input;\n\n \/\/ For putting on the Board\n int tiles_available = 0;\n \/\/ string word;\n \/\/ int x, y;\n \/\/ Direction d;\n\n \/\/ Get the number of tiles\n while (true) {\n cout << \"How many tiles do you have left? (Between 0 and \" << this->tiles_each << \")\\t\";\n cin >> input_;\n try {\n tiles_available = stoi(input_);\n if (tiles_available > 0 && tiles_available <= this->tiles_each) {\n break;\n }\n } catch (invalid_argument e) {\n continue;\n }\n }\n\n \/\/ Get the tiles from the user\n while (true) {\n string word_regex(\"[A-Za-z]{0,\");\n word_regex.append(to_string(this->tiles_each));\n word_regex.append(\"}\");\n regex validator(word_regex);\n\n \/\/ Get the word\n cout << \"Please enter the tiles you have left, separated by a space:\\t\";\n char c;\n for (int i = 0; i < tiles_available; i++) {\n cin >> c;\n input.push_back(toupper(c));\n }\n cin.clear();\n cin.ignore(INT_MAX, '\\n');\n }\n }\n}\n\nbool Game::valid_word_for_game(string& input) {\n return true;\n}\n\nbool Game::valid_position_for_game(int& x, int& y) {\n return true;\n}\n\nbool Game::can_put_word_on_board(string& word, int& w, int& h, Direction& d) {\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef NET_TCP_COMMON_HPP\n#define NET_TCP_COMMON_HPP\n\n#include <net\/ip4\/addr.hpp>\n#include <net\/packet.hpp>\n\nnamespace net {\n namespace tcp {\n\n \/\/ Constants\n \/\/ default size of TCP window - how much data can be \"in flight\" (unacknowledged)\n static constexpr uint16_t default_window_size = 0xffff;\n \/\/ maximum size of a TCP segment - later set based on MTU or peer\n static constexpr uint16_t default_mss = 536;\n \/\/ the maximum amount of half-open connections per port (listener)\n static constexpr size_t max_syn_backlog = 64;\n\n using Address = ip4::Addr;\n\n \/** A port *\/\n using port_t = uint16_t;\n\n \/** A Sequence number (SYN\/ACK) (32 bits) *\/\n using seq_t = uint32_t;\n\n \/** A shared buffer pointer *\/\n using buffer_t = std::shared_ptr<uint8_t>;\n\n \/**\n * @brief Creates a shared buffer with a given length\n *\n * @param length buffer length\n * @return a newly created buffer_t\n *\/\n static buffer_t new_shared_buffer(uint64_t length)\n { return buffer_t(new uint8_t[length], std::default_delete<uint8_t[]>()); }\n\n class Packet;\n using Packet_ptr = std::unique_ptr<Packet>;\n\n class Connection;\n using Connection_ptr = std::shared_ptr<Connection>;\n\n } \/\/ < namespace tcp\n} \/\/ < namespace net\n\n#endif \/\/ < NET_TCP_COMMON_HPP\n<commit_msg>tcp: Removed static keyword for non-class helper function<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#pragma once\n#ifndef NET_TCP_COMMON_HPP\n#define NET_TCP_COMMON_HPP\n\n#include <net\/ip4\/addr.hpp>\n#include <net\/packet.hpp>\n\nnamespace net {\n namespace tcp {\n\n \/\/ Constants\n \/\/ default size of TCP window - how much data can be \"in flight\" (unacknowledged)\n static constexpr uint16_t default_window_size = 0xffff;\n \/\/ maximum size of a TCP segment - later set based on MTU or peer\n static constexpr uint16_t default_mss = 536;\n \/\/ the maximum amount of half-open connections per port (listener)\n static constexpr size_t max_syn_backlog = 64;\n\n using Address = ip4::Addr;\n\n \/** A port *\/\n using port_t = uint16_t;\n\n \/** A Sequence number (SYN\/ACK) (32 bits) *\/\n using seq_t = uint32_t;\n\n \/** A shared buffer pointer *\/\n using buffer_t = std::shared_ptr<uint8_t>;\n\n \/**\n * @brief Creates a shared buffer with a given length\n *\n * @param length buffer length\n * @return a newly created buffer_t\n *\/\n inline buffer_t new_shared_buffer(uint64_t length)\n { return buffer_t(new uint8_t[length], std::default_delete<uint8_t[]>()); }\n\n class Packet;\n using Packet_ptr = std::unique_ptr<Packet>;\n\n class Connection;\n using Connection_ptr = std::shared_ptr<Connection>;\n\n } \/\/ < namespace tcp\n} \/\/ < namespace net\n\n#endif \/\/ < NET_TCP_COMMON_HPP\n<|endoftext|>"} {"text":"<commit_before>#include <iostream> \/* cin, cout *\/\n#include <stdio.h> \/* printf *\/\n#include <stdlib.h> \/* srand, rand *\/\n#include <time.h> \/* time *\/\n#include <vector> \/* vector *\/\n\nusing namespace std;\n\n\/\/ Variable declarations\nint next_move = 2; \/\/ \"X\" = 2; \"O\" = 5;\nint next_player = 1; \/\/ -1 = human, 1 = AI, 0 = no move;\nint board[9] = {0,0,0,0,0,0,0,0,0};\nconst int board_size = 3;\nbool game_running = true;\nconst int X = 2;\nconst int O = 5;\n\n\/\/ Function declarations\nbool makeMove(int node, int brd[], int player);\nint checkLine(int line, int brd[]);\nvoid showBoard(const int brd[]);\nchar gridChar(int i);\nvoid drawBoard(int brd[]);\nint switchPlayer(int player);\nint checkScore(int brd[], int player);\nbool boardFull(int brd[]);\nint gameScore(int brd[], int player);\nint randomMove(int brd[], int player);\nint betterMove(int brd[], int player);\nint forkMove(int brd[], int player);\nvoid humanMove(int brd[], int player);\n\/\/int minimax(int brd[], int player);\n\/\/int aiMove(int brd[], int player);\n\nint main () {\n while(game_running){\n drawBoard(board);\n\n if (next_move==X) {cout<<\"Next move: X\"<<endl;}\n else if (next_move == O){cout<<\"Next move: O\"<<endl;}\n\n int node = 0;\n\n if (next_player == -1){\n humanMove(board, next_move);\n }\n\n else if (next_player == 1){\n node = betterMove(board,next_move);\n \/\/node = aiMove(board, next_move);\n \/\/node = randomMove(board,next_move);\n makeMove(node, board, next_move);\n }\n\n int score = gameScore(board, next_move);\n next_player = -next_player;\n\n if (score!=-1){\n game_running = false;\n drawBoard(board);\n cout<<\"GAME OVER!\"<<endl;\n }\n next_move = switchPlayer(next_move);\n cout<<\"----------------------------------------\"<<endl;\n }\n}\n\nint lines[8][3] = {\n {0,1,2}, {3,4,5},{6,7,8}, \/\/ rows\n {0,3,6}, {1,4,7},{2,5,8}, \/\/ columns\n {0,4,8}, {2,4,6} \/\/ diagonals\n};\n\nbool makeMove(int node, int brd[], int player) {\n bool good_move = false;\n\n if (brd[node]==0){\n brd[node]=player;\n good_move=true;\n }\n else {\n cout<<\"Invallid move!\"<<endl;\n }\n\n return good_move;\n}\n\nint checkLine(int line, int brd[]) {\n int sum = 0;\n\n for (int i=0; i<board_size; i++) {\n sum = sum+brd[lines[line][i]];\n }\n\n return sum;\n}\n\nvoid showBoard(const int brd[]){\n for (int m=0; m<board_size; m++){\n for (int n=0; n<board_size; n++) {\n char p = '-';\n if (brd[m*board_size+n]==2) {\n p = 'X';\n }\n\n else if (brd[m*board_size+n]==5) {\n p = 'O';\n }\n\n cout<<p<<' ';\n }\n cout<<endl;\n }\n}\n\nchar gridChar(int i) {\n switch(i) {\n case 2:\n return 'X';\n case 5:\n return 'O';\n default:\n return ' ';\n }\n}\n\nvoid drawBoard(int brd[]) {\n printf(\"\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[0]),gridChar(brd[1]),gridChar(brd[2]));\n printf(\"---+---+---\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[3]),gridChar(brd[4]),gridChar(brd[5]));\n printf(\"---+---+---\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[6]),gridChar(brd[7]),gridChar(brd[8]));\n printf(\"\\n\");\n}\n\nint switchPlayer(int player){\n int mv = 0;\n if (player == 2) {\n mv=5;\n }\n else mv = 2;\n return mv;\n}\n\nint checkScore(int brd[], int player) {\n int score = -1;\n\n for (int i = 0; i<8; i++){\n if(checkLine(i, brd)== (3 * player)){\n score = 100;\n }\n\n else if(checkLine(i, brd)== (3 * switchPlayer(player))){\n score = -100;\n }\n\n else if (boardFull(brd)){\n score = 0;\n }\n }\n return score;\n}\n\nbool boardFull(int brd[]){\n bool full = true;\n for (int m=0; m < (board_size * board_size); m++){\n if (brd[m]==0) {\n full = false;\n }\n }\n return full;\n}\n\nint gameScore(int brd[], int player){\n int game_score = -1;\n\n for (int i=0; i<8; i++){\n int score = checkLine(i, brd);\n if (score == (player * 3)){\n game_score = 10;\n }\n\n else if (score == (switchPlayer(player)*3)){\n game_score = -10;\n }\n }\n\n if (game_score==-1 && boardFull(brd)){\n game_score = 0;\n }\n\n return game_score;\n};\n\nint randomMove(int brd[], int player){\n vector<int> freeNodes;\n srand (time(NULL));\n for (int i=0; i<9; i++){\n if (brd[i]==0){\n freeNodes.push_back(i);\n }\n }\n int r = freeNodes.size();\n int n = rand() % r;\n int m = freeNodes[n];\n return m;\n}\n\nint betterMove(int brd[], int player){\n int mv = -1;\n\n \/\/first move\n int sum = 0;\n int corners[4] = {0,2,6,8};\n\n for (int n = 0; n<8; n++) {\n sum = sum + brd[n];\n }\n\n \/\/if the board is empty, take a corner\n if (sum == 0){\n srand (time(NULL));\n int n = rand() % 4;\n mv = corners[n];\n return mv;\n }\n\n else if (sum == X || sum == O){\n if (brd[4]==0){\n mv = 4;\n return mv;\n }\n\n else {\n srand (time(NULL));\n int n = rand() % 4;\n mv = corners[n];\n return mv;\n }\n }\n\n \/\/win move\n for (int n = 0; n<8; n++){\n int s = checkLine(n, brd);\n if (s == (2 * player)){\n cout<<\"I can win!\"<<endl;\n for (int k=0; k<3; k++){\n if (board[lines[n][k]] == 0){\n mv = lines[n][k];\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n }\n }\n }\n\n \/\/block move\n for (int n = 0; n<8; n++){\n int s = checkLine(n, brd);\n if (s == (2 * switchPlayer(player))){\n cout<<\"I have to block!\"<<endl;\n for (int k=0; k<3; k++){\n if (board[lines[n][k]] == 0){\n mv = lines[n][k];\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n }\n }\n }\n\n \/\/fork move\n if(forkMove(brd,player)>-1){\n mv = forkMove(brd, player);\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n\n \/\/random move\n if (mv==-1){\n cout<<\"Playing random!\"<<endl;\n mv = randomMove(brd, player);\n }\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n}\n\nint forkMove(int brd[], int player){\n int fork_move = -1;\n for (int i = 0; i<9; i++){\n int l = 0;\n if (brd[i]==0){\n makeMove(i, brd, player);\n for (int m = 0; m<8; m++){\n if (checkLine(m, brd)== (2 * player)){\n l = l+1;\n }\n }\n if (l>1){\n fork_move = i;\n cout<<\"I can fork!\"<<endl;\n }\n brd[i]=0;\n return fork_move;\n }\n }\n return fork_move;\n}\n\nvoid humanMove(int brd[], int player){\n bool done = false;\n\n while (done == false){\n cout<<\"Your turn! Select an empty square.\"<<endl;\n int box;\n cin>>box;\n done = makeMove(box, brd, player);\n }\n}\n\n\/*\nint aiMove(int brd[], int player){\n int best_move = -1;\n int score = -9000;\n\n for (int m=0; m<9; m++){\n if (brd[m]==0){\n brd[m] = player;\n int temp_score = minimax(brd, player);\n brd[m] = 0; \/\/reset board\n\n if (temp_score > score){\n score = temp_score;\n best_move = m;\n cout<<best_move<<\"|\"<<score;\n }\n }\n }\n\n cout<<\"AI best move:\"<<best_move<<endl;\n return best_move;\n}\n\nint minimax(int brd[], int player){\n int score = -9000;\n int temp_score = checkScore(brd, player);\n\n if (temp_score != -1){\n score = temp_score;\n }\n\n for (int m=0; m<9; m++){\n if (brd[m]==0){\n brd[m] = player;\n }\n }\n\n else {\n for (int n=0; n<9; n++){\n if (brd[n]==0){\n brd[n]= player;\n int other_player = switchPlayer(player);\n int sc = - minimax(brd, other_player);\n\n if (sc > score){\n score = sc;\n }\n brd[n]=0;\n }\n }\n }\n return score;\n}\n*\/\n<commit_msg>Clean-up<commit_after>#include <iostream> \/* cin, cout *\/\n#include <stdio.h> \/* printf *\/\n#include <stdlib.h> \/* srand, rand *\/\n#include <time.h> \/* time *\/\n#include <vector> \/* vector *\/\n\nusing namespace std;\n\n\/\/ Variable declarations\nint next_move = 2; \/\/ \"X\" = 2; \"O\" = 5;\nint next_player = 1; \/\/ -1 = human, 1 = AI, 0 = no move;\nint board[9] = {0,0,0,0,0,0,0,0,0};\nconst int board_size = 3;\nbool game_running = true;\nconst int X = 2;\nconst int O = 5;\n\n\/\/ Function declarations\nbool makeMove(int node, int brd[], int player);\nint checkLine(int line, int brd[]);\nvoid showBoard(const int brd[]);\nchar gridChar(int i);\nvoid drawBoard(int brd[]);\nint switchPlayer(int player);\nint checkScore(int brd[], int player);\nbool boardFull(int brd[]);\nint gameScore(int brd[], int player);\nint randomMove(int brd[], int player);\nint betterMove(int brd[], int player);\nint forkMove(int brd[], int player);\nvoid humanMove(int brd[], int player);\n\nint main () {\n while(game_running){\n drawBoard(board);\n\n if (next_move==X) {cout<<\"Next move: X\"<<endl;}\n else if (next_move == O){cout<<\"Next move: O\"<<endl;}\n\n int node = 0;\n\n if (next_player == -1){\n humanMove(board, next_move);\n }\n\n else if (next_player == 1){\n node = betterMove(board,next_move);\n \/\/node = aiMove(board, next_move);\n \/\/node = randomMove(board,next_move);\n makeMove(node, board, next_move);\n }\n\n int score = gameScore(board, next_move);\n next_player = -next_player;\n\n if (score!=-1){\n game_running = false;\n drawBoard(board);\n cout<<\"GAME OVER!\"<<endl;\n }\n next_move = switchPlayer(next_move);\n cout<<\"----------------------------------------\"<<endl;\n }\n}\n\nint lines[8][3] = {\n {0,1,2}, {3,4,5},{6,7,8}, \/\/ rows\n {0,3,6}, {1,4,7},{2,5,8}, \/\/ columns\n {0,4,8}, {2,4,6} \/\/ diagonals\n};\n\nbool makeMove(int node, int brd[], int player) {\n bool good_move = false;\n\n if (brd[node]==0){\n brd[node]=player;\n good_move=true;\n }\n else {\n cout<<\"Invallid move!\"<<endl;\n }\n\n return good_move;\n}\n\nint checkLine(int line, int brd[]) {\n int sum = 0;\n\n for (int i=0; i<board_size; i++) {\n sum = sum+brd[lines[line][i]];\n }\n\n return sum;\n}\n\nvoid showBoard(const int brd[]){\n for (int m=0; m<board_size; m++){\n for (int n=0; n<board_size; n++) {\n char p = '-';\n if (brd[m*board_size+n]==2) {\n p = 'X';\n }\n\n else if (brd[m*board_size+n]==5) {\n p = 'O';\n }\n\n cout<<p<<' ';\n }\n cout<<endl;\n }\n}\n\nchar gridChar(int i) {\n switch(i) {\n case 2:\n return 'X';\n case 5:\n return 'O';\n default:\n return ' ';\n }\n}\n\nvoid drawBoard(int brd[]) {\n printf(\"\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[0]),gridChar(brd[1]),gridChar(brd[2]));\n printf(\"---+---+---\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[3]),gridChar(brd[4]),gridChar(brd[5]));\n printf(\"---+---+---\\n\");\n printf(\" %c | %c | %c\\n\",gridChar(brd[6]),gridChar(brd[7]),gridChar(brd[8]));\n printf(\"\\n\");\n}\n\nint switchPlayer(int player){\n int mv = 0;\n if (player == 2) {\n mv=5;\n }\n else mv = 2;\n return mv;\n}\n\nint checkScore(int brd[], int player) {\n int score = -1;\n\n for (int i = 0; i<8; i++){\n if(checkLine(i, brd)== (3 * player)){\n score = 100;\n }\n\n else if(checkLine(i, brd)== (3 * switchPlayer(player))){\n score = -100;\n }\n\n else if (boardFull(brd)){\n score = 0;\n }\n }\n return score;\n}\n\nbool boardFull(int brd[]){\n bool full = true;\n for (int m=0; m < (board_size * board_size); m++){\n if (brd[m]==0) {\n full = false;\n }\n }\n return full;\n}\n\nint gameScore(int brd[], int player){\n int game_score = -1;\n\n for (int i=0; i<8; i++){\n int score = checkLine(i, brd);\n if (score == (player * 3)){\n game_score = 10;\n }\n\n else if (score == (switchPlayer(player)*3)){\n game_score = -10;\n }\n }\n\n if (game_score==-1 && boardFull(brd)){\n game_score = 0;\n }\n\n return game_score;\n};\n\nint randomMove(int brd[], int player){\n vector<int> freeNodes;\n srand (time(NULL));\n for (int i=0; i<9; i++){\n if (brd[i]==0){\n freeNodes.push_back(i);\n }\n }\n int r = freeNodes.size();\n int n = rand() % r;\n int m = freeNodes[n];\n return m;\n}\n\nint betterMove(int brd[], int player){\n int mv = -1;\n\n \/\/first move\n int sum = 0;\n int corners[4] = {0,2,6,8};\n\n for (int n = 0; n<8; n++) {\n sum = sum + brd[n];\n }\n\n \/\/if the board is empty, take a corner\n if (sum == 0){\n srand (time(NULL));\n int n = rand() % 4;\n mv = corners[n];\n return mv;\n }\n\n else if (sum == X || sum == O){\n if (brd[4]==0){\n mv = 4;\n return mv;\n }\n\n else {\n srand (time(NULL));\n int n = rand() % 4;\n mv = corners[n];\n return mv;\n }\n }\n\n \/\/win move\n for (int n = 0; n<8; n++){\n int s = checkLine(n, brd);\n if (s == (2 * player)){\n cout<<\"I can win!\"<<endl;\n for (int k=0; k<3; k++){\n if (board[lines[n][k]] == 0){\n mv = lines[n][k];\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n }\n }\n }\n\n \/\/block move\n for (int n = 0; n<8; n++){\n int s = checkLine(n, brd);\n if (s == (2 * switchPlayer(player))){\n cout<<\"I have to block!\"<<endl;\n for (int k=0; k<3; k++){\n if (board[lines[n][k]] == 0){\n mv = lines[n][k];\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n }\n }\n }\n\n \/\/fork move\n if(forkMove(brd,player)>-1){\n mv = forkMove(brd, player);\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n }\n\n \/\/random move\n if (mv==-1){\n cout<<\"Playing random!\"<<endl;\n mv = randomMove(brd, player);\n }\n cout<<\"Best Move: \"<<mv<<endl;\n return mv;\n}\n\nint forkMove(int brd[], int player){\n int fork_move = -1;\n for (int i = 0; i<9; i++){\n int l = 0;\n if (brd[i]==0){\n makeMove(i, brd, player);\n for (int m = 0; m<8; m++){\n if (checkLine(m, brd)== (2 * player)){\n l = l+1;\n }\n }\n if (l>1){\n fork_move = i;\n cout<<\"I can fork!\"<<endl;\n }\n brd[i]=0;\n return fork_move;\n }\n }\n return fork_move;\n}\n\nvoid humanMove(int brd[], int player){\n bool done = false;\n\n while (done == false){\n cout<<\"Your turn! Select an empty square.\"<<endl;\n int box;\n cin>>box;\n done = makeMove(box, brd, player);\n }\n}<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <limits>\n\n\/\/psi: PolyStatic Interpreter\n\/\/\"psi\" -> interactive interpreter\n\/\/\"psi liquify file.ps[liquid,solid]\" -> interactive interpreter starting with environment from file.psliquid or file.pssolid\n\/\/\"psi solidify file.psliquid\" -> compile file.psliquid into file.pssolid\n\/\/\"psi melt file.pssolid\" -> extract interface information from file.pssolid to file.psgas\n\nint main(int nargs, char const *const *args)\n{\n\tfor(unsigned i = 0; i < nargs; ++i)\n\t{\n\t\tstd::cout << args[i] << std::endl;\n\t}\n\n\tstd::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n}\n<commit_msg>More planning<commit_after>#include <iostream>\n#include <limits>\n#include <string>\n#include <vector>\n#include <algorithm>\n\n\/\/psi: PolyStatic Interpreter\n\/\/\"psi\" -> interactive interpreter\n\/\/\"psi liquify file.ps[liquid,solid]...\" -> interactive interpreter starting with environment from file.psliquid or file.pssolid (*.ps*id)\n\/\/\"psi solidify file.psliquid...\" -> compile file.psliquid into file.pssolid\n\/\/\"psi melt file.pssolid...\" -> extract interface information from file.pssolid to file.psgas\n\nvoid Liquify(std::vector<std::string> const &files = std::vector<std::string>());\nvoid Solidify(std::vector<std::string> const &files);\nvoid Melt(std::vector<std::string> const &files);\n\nint main(int nargs, char const *const *args_)\n{\n\/\/\tauto &WaitForEnter = []{ std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n'); };\n\tif(nargs < 1) return -1;\n\tstd::vector<std::string> args;\n\tstd::for_each(args_+1, args_+nargs, [&args](char const *s)\n\t{\n\t\targs.push_back(s);\n\t});\n\n\tif(args.size() == 0)\n\t{\n\t\tLiquify();\n\t}\n\telse\n\t{\n\t\tstd::string command = args[0];\n\t\targs.pop_front();\n\t\tstd::transform(command.begin(), command.end(), command.begin(), ::tolower);\n\t\tif(command == \"liquify\")\n\t\t{\n\t\t\tLiquify(args);\n\t\t}\n\t\telse if(command == \"solidify\")\n\t\t{\n\t\t\tSolidify(args);\n\t\t}\n\t\telse if(command == \"melt\")\n\t\t{\n\t\t\tMelt(args);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tstd::cout << '\"' << command << \"\\\" is not a command\" << std::endl;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\n\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include <log4cplus\/configurator.h>\n#include <log4cplus\/loggingmacros.h>\n#include \"Brain.h\"\n#include \"CurlHelpers.h\"\n#include \"MHEHardDevContainer.h\"\n#include \"MHEDatabase.h\"\n#include \"MHEHardware.h\"\n#include \"MHEWeb.h\"\n\nstatic log4cplus::Logger logger;\n\nint main(int ac, char **av)\n{\n boost::program_options::options_description desc(\"ConfigFile\");\n\tboost::program_options::variables_map vm;\n\tstd::string gcmAppId;\n\tint webPort, brainRefresh;\n\n\tlog4cplus::PropertyConfigurator::doConfigure(\"log4cplus.properties\");\n\tlogger = log4cplus::Logger::getInstance(LOG4CPLUS_TEXT(\"Main\"));\n\tdesc.add_options()\n\t\t(\"WebServer.port\", boost::program_options::value<int>(&webPort)->default_value(8080))\n\t\t(\"Brain.refresh\", boost::program_options::value<int>(&brainRefresh)->default_value(300))\n\t\t(\"Notify.gcmAppId\", boost::program_options::value<std::string>(&gcmAppId))\n\t ;\n std::ifstream settings_file(\"config.ini\", std::ifstream::in);\n\tboost::program_options::store(boost::program_options::parse_config_file(settings_file, desc, true), vm);\n\tsettings_file.close();\n\tboost::program_options::notify(vm);\n\tcurlInit();\n\tLOG4CPLUS_INFO(logger, LOG4CPLUS_TEXT(\"Application starting...\"));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - WebServer.port=\" << webPort));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - Brain.refresh=\" << brainRefresh));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - Notify.gcmAppId=\" << gcmAppId));\n\n MHEDatabase *db = new MHEDatabase();\n\n if (logger.isEnabledFor(log4cplus::DEBUG_LOG_LEVEL))\n {\n std::vector<DBCondition> conds = db->getConditions();\n BOOST_FOREACH(DBCondition cond, conds)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)cond));\n }\n std::vector<DBGraph> graphs = db->getGraphs();\n BOOST_FOREACH(DBGraph graph, graphs)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)graph));\n }\n std::vector<DBRoom> rooms = db->getRooms();\n BOOST_FOREACH(DBRoom room, rooms)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)room));\n }\n std::vector<DBRoomGraphCond> roomGraphConds = db->getRoomGraphCondByActiveDaysAndCalendar();\n BOOST_FOREACH(DBRoomGraphCond rgc, roomGraphConds)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)rgc));\n }\n }\n\n MHEMobileNotify *notify = (gcmAppId.size() == 0 ? NULL : new MHEMobileNotify(gcmAppId, db));\n MHEHardDevContainer *hardDev = new MHEHardDevContainer(*db);\n MHEWeb *ws = new MHEWeb(webPort, db, hardDev, notify);\n Brain b(db, hardDev, brainRefresh, notify);\n b.start();\n\n LOG4CPLUS_INFO(logger, LOG4CPLUS_TEXT(\"Application stopping...\"));\n delete ws;\n if (notify != NULL)\n delete notify;\n delete hardDev;\n delete db;\n curlDestroy();\n}\n<commit_msg>Clean code.<commit_after>#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <string>\n\n#include <boost\/foreach.hpp>\n#include <boost\/program_options.hpp>\n#include <log4cplus\/configurator.h>\n#include <log4cplus\/loggingmacros.h>\n#include \"Brain.h\"\n#include \"CurlHelpers.h\"\n#include \"MHEHardDevContainer.h\"\n#include \"MHEDatabase.h\"\n#include \"MHEHardware.h\"\n#include \"MHEWeb.h\"\n\nint main(int ac, char **av)\n{\n boost::program_options::options_description desc(\"ConfigFile\");\n\tboost::program_options::variables_map vm;\n\tlog4cplus::Logger logger;\n\tstd::string gcmAppId;\n\tint webPort, brainRefresh;\n\n\tlog4cplus::PropertyConfigurator::doConfigure(\"log4cplus.properties\");\n\tlogger = log4cplus::Logger::getInstance(LOG4CPLUS_TEXT(\"Main\"));\n\tdesc.add_options()\n\t\t(\"WebServer.port\", boost::program_options::value<int>(&webPort)->default_value(8080))\n\t\t(\"Brain.refresh\", boost::program_options::value<int>(&brainRefresh)->default_value(300))\n\t\t(\"Notify.gcmAppId\", boost::program_options::value<std::string>(&gcmAppId))\n\t ;\n std::ifstream settings_file(\"config.ini\", std::ifstream::in);\n\tboost::program_options::store(boost::program_options::parse_config_file(settings_file, desc, true), vm);\n\tsettings_file.close();\n\tboost::program_options::notify(vm);\n\tcurlInit();\n\tLOG4CPLUS_INFO(logger, LOG4CPLUS_TEXT(\"Application starting...\"));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - WebServer.port=\" << webPort));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - Brain.refresh=\" << brainRefresh));\n\tLOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - Notify.gcmAppId=\" << gcmAppId));\n\n MHEDatabase *db = new MHEDatabase();\n\n if (logger.isEnabledFor(log4cplus::DEBUG_LOG_LEVEL))\n {\n std::vector<DBCondition> conds = db->getConditions();\n BOOST_FOREACH(DBCondition cond, conds)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)cond));\n }\n std::vector<DBGraph> graphs = db->getGraphs();\n BOOST_FOREACH(DBGraph graph, graphs)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)graph));\n }\n std::vector<DBRoom> rooms = db->getRooms();\n BOOST_FOREACH(DBRoom room, rooms)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)room));\n }\n std::vector<DBRoomGraphCond> roomGraphConds = db->getRoomGraphCondByActiveDaysAndCalendar();\n BOOST_FOREACH(DBRoomGraphCond rgc, roomGraphConds)\n {\n LOG4CPLUS_DEBUG(logger, LOG4CPLUS_TEXT(\"main - \" << (std::string)rgc));\n }\n }\n\n MHEMobileNotify *notify = (gcmAppId.size() == 0 ? NULL : new MHEMobileNotify(gcmAppId, db));\n MHEHardDevContainer *hardDev = new MHEHardDevContainer(*db);\n MHEWeb *ws = new MHEWeb(webPort, db, hardDev, notify);\n Brain b(db, hardDev, brainRefresh, notify);\n b.start();\n\n LOG4CPLUS_INFO(logger, LOG4CPLUS_TEXT(\"Application stopping...\"));\n delete ws;\n if (notify != NULL)\n delete notify;\n delete hardDev;\n delete db;\n curlDestroy();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_MODULE Sort\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <vexcl\/vector.hpp>\n#include <vexcl\/reductor.hpp>\n#include \"context_setup.hpp\"\n\nBOOST_AUTO_TEST_CASE(threads)\n{\n const size_t n = 1024 * 1024;\n\n auto run = [n](vex::backend::command_queue queue, cl_long *s) {\n std::vector<vex::backend::command_queue> q(1, queue);\n vex::vector<int> x(q, n);\n x = 1;\n vex::Reductor<cl_long, vex::SUM> sum(q);\n *s = sum(x);\n };\n\n std::vector< boost::thread > threads;\n std::vector< cl_long > results(ctx.size(), 0);\n\n for(unsigned d = 0; d < ctx.size(); ++d) {\n threads.push_back( boost::thread(run, ctx.queue(d), &results[d]) );\n }\n\n cl_long sum = 0;\n for(unsigned d = 0; d < ctx.size(); ++d) {\n threads[d].join();\n sum += results[d];\n }\n\n BOOST_CHECK_EQUAL(sum, n * ctx.size());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Avoid copying boost::thread<commit_after>#define BOOST_TEST_MODULE Sort\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n#include <vexcl\/vector.hpp>\n#include <vexcl\/reductor.hpp>\n#include \"context_setup.hpp\"\n\nBOOST_AUTO_TEST_CASE(threads)\n{\n const size_t n = 1024 * 1024;\n\n auto run = [n](vex::backend::command_queue queue, cl_long *s) {\n std::vector<vex::backend::command_queue> q(1, queue);\n vex::vector<int> x(q, n);\n x = 1;\n vex::Reductor<cl_long, vex::SUM> sum(q);\n *s = sum(x);\n };\n\n boost::ptr_vector< boost::thread > threads;\n std::vector< cl_long > results(ctx.size(), 0);\n\n for(unsigned d = 0; d < ctx.size(); ++d) {\n threads.push_back( new boost::thread(run, ctx.queue(d), &results[d]) );\n }\n\n cl_long sum = 0;\n for(unsigned d = 0; d < ctx.size(); ++d) {\n threads[d].join();\n sum += results[d];\n }\n\n BOOST_CHECK_EQUAL(sum, n * ctx.size());\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <DOMSupport\/DOMSupportDefault.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathSupportDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XercesParserLiaison\/XercesParserLiaison.hpp>\n\n\n\n#include <XercesPlatformSupport\/TextFileOutputStream.hpp>\n#include <XercesPlatformSupport\/XercesDOMPrintWriter.hpp>\n\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\t\/* argv *\/[])\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::endl;\n\tusing std::ofstream;\n#endif\n\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: SimpleTransform\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\t\t\tXSLTEngineImpl::Initialize();\n\n\t\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\t\tDOMSupportDefault\t\t\t\ttheDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\ttheParserLiaison(theDOMSupport);\n\t\t\tXPathSupportDefault\t\t\t\ttheXPathSupport(theDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\t\/\/ Create a processor...\n\t\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\ttheXPathFactory);\n\n\t\t\t\/\/ Connect the processor to the support object...\n\t\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\t\/\/ Create a stylesheet construction context, and a stylesheet\n\t\t\t\/\/ execution context...\n\t\t\tStylesheetConstructionContextDefault\ttheConstructionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\tStylesheetExecutionContextDefault\t\ttheExecutionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\t\/\/ Our input files...The assumption is that the executable will be run\n\t\t\t\/\/ from same directory as the input files.\n\t\t\tconst XalanDOMString\t\ttheXMLFileName(\"foo.xml\");\n\t\t\tconst XalanDOMString\t\ttheXSLFileName(\"foo.xsl\");\n\n\t\t\t\/\/ Our input sources...\n\t\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLFileName));\n\t\t\tXSLTInputSource\t\ttheStylesheetSource(c_wstr(theXSLFileName));\n\n\t\t\t\/\/ Our output target...\n\t\t\tTextFileOutputStream\ttheOutputStream(\"foo.out\");\n\t\t\tXercesDOMPrintWriter\ttheResultWriter(theOutputStream);\n\t\t\tXSLTResultTarget\t\ttheResultTarget(&theResultWriter);\n\n\t\t\ttheProcessor.process(\n\t\t\t\t\t\ttheInputSource,\n\t\t\t\t\t\ttheStylesheetSource,\n\t\t\t\t\t\ttheResultTarget,\n\t\t\t\t\t\ttheConstructionContext,\n\t\t\t\t\t\ttheExecutionContext);\n\n\t\t\t\/\/ Call the static terminators...\n\t\t\tXMLPlatformUtils::Terminate();\n\t\t\tXSLTEngineImpl::Terminate();\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Made some minor changes to support UNIX platforms.<commit_after>\/\/ Base header file. Must be first.\n#include <Include\/PlatformDefinitions.hpp>\n\n\n\n#include <iostream>\n#include <fstream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <DOMSupport\/DOMSupportDefault.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathSupportDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XercesParserLiaison\/XercesParserLiaison.hpp>\n\n\n\n#include <XercesPlatformSupport\/TextFileOutputStream.hpp>\n#include <XercesPlatformSupport\/XercesDOMPrintWriter.hpp>\n\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\t\/* argv *\/[])\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::endl;\n\tusing std::ofstream;\n#endif\n\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: SimpleTransform\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\t\t\tXSLTEngineImpl::Initialize();\n\n\t\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\t\tDOMSupportDefault\t\t\t\ttheDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\ttheParserLiaison(theDOMSupport);\n\t\t\tXPathSupportDefault\t\t\t\ttheXPathSupport(theDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory;\n\t\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\t\/\/ Create a processor...\n\t\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\ttheXPathFactory);\n\n\t\t\t\/\/ Connect the processor to the support object...\n\t\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\t\/\/ Create a stylesheet construction context, and a stylesheet\n\t\t\t\/\/ execution context...\n\t\t\tStylesheetConstructionContextDefault\ttheConstructionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\tStylesheetExecutionContextDefault\t\ttheExecutionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\t\/\/ Our input files...The assumption is that the executable will be run\n\t\t\t\/\/ from same directory as the input files.\n\t\t\tconst XalanDOMString\t\ttheXMLFileName(\"foo.xml\");\n\t\t\tconst XalanDOMString\t\ttheXSLFileName(\"foo.xsl\");\n\n\t\t\t\/\/ Our input sources...\n\t\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLFileName));\n\t\t\tXSLTInputSource\t\ttheStylesheetSource(c_wstr(theXSLFileName));\n\n\t\t\t\/\/ Our output target...\n\t\t\tTextFileOutputStream\ttheOutputStream(\"foo.out\");\n\t\t\tXercesDOMPrintWriter\ttheResultWriter(theOutputStream);\n\t\t\tXSLTResultTarget\t\ttheResultTarget(&theResultWriter);\n\n\t\t\ttheProcessor.process(\n\t\t\t\t\t\ttheInputSource,\n\t\t\t\t\t\ttheStylesheetSource,\n\t\t\t\t\t\ttheResultTarget,\n\t\t\t\t\t\ttheConstructionContext,\n\t\t\t\t\t\ttheExecutionContext);\n\n\t\t\t\/\/ Call the static terminators...\n\t\t\tXMLPlatformUtils::Terminate();\n\t\t\tXSLTEngineImpl::Terminate();\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Server_Common\/Logger.h>\n#include <Server_Common\/Database.h>\n#include <Server_Common\/ExdData.h>\n#include <boost\/lexical_cast.hpp>\n\n#include \"ZoneMgr.h\"\n#include \"Zone.h\"\n\n#include \"ZonePosition.h\"\n\n\nextern Core::Logger g_log;\nextern Core::Db::Database g_database;\nextern Core::Data::ExdData g_exdData;\n\nnamespace Core {\n\n ZoneMgr::ZoneMgr()\n {\n }\n\n ZoneMgr::~ZoneMgr()\n {\n }\n\n void ZoneMgr::loadZonePositionMap()\n {\n auto pQR = g_database.query( \"SELECT id, target_zone_id, pos_x, pos_y, pos_z, pos_o, radius \" \\\n \"FROM dbzonepositions;\" );\n\n if( !pQR )\n return;\n\n do\n {\n Db::Field *field = pQR->fetch();\n uint32_t id = field[0].getUInt32();\n uint32_t targetZoneId = field[1].getUInt32();\n Common::FFXIVARR_POSITION3 pos;\n pos.x = field[2].getFloat();\n pos.y = field[3].getFloat();\n pos.z = field[4].getFloat();\n float posO = field[5].getFloat();\n uint32_t radius = field[6].getUInt32();\n \n m_zonePositionMap[id] = ZonePositionPtr( new ZonePosition( id, targetZoneId, pos, radius, posO ) );\n\n } while( pQR->nextRow() );\n }\n\n ZonePositionPtr ZoneMgr::getZonePosition( uint32_t zonePositionId )\n {\n auto it = m_zonePositionMap.find( zonePositionId );\n\n if( it != m_zonePositionMap.end() )\n return it->second;\n\n return nullptr;\n }\n\n bool ZoneMgr::createZones()\n {\n loadZonePositionMap();\n\n \/\/ find zone info from exd\n for( auto zone : g_exdData.m_zoneInfoMap )\n {\n uint32_t zoneId = zone.first;\n\n \n auto info = zone.second;\n g_log.Log( LoggingSeverity::info, std::to_string( info.id ) + \"\\t\" + info.zone_str );\n\n ZonePtr pZone( new Zone( info.id, info.layout_id, info.zone_name, info.zone_str, false ) );\n pZone->init();\n m_zoneMap[info.id] = pZone;\n }\n\n \/\/do\n \/\/{\n \/\/ Db::Field *field = pQR->fetch();\n \/\/ uint16_t id = field[0].getUInt16();\n \/\/ std::string inName = field[1].getString();\n \/\/ std::string name = field[2].getString();\n \/\/ uint32_t layoutId = field[3].getUInt32();\n \/\/ bool isPrivate = field[4].getBool();\n\n \/\/ if(!isPrivate)\n \/\/ {\n \/\/ g_log.Log(LoggingSeverity::info, std::to_string(id) + \"\\t\" + inName + \" - \" + name);\n\n \/\/ ZonePtr pZone( new Zone( id, layoutId, name, inName, isPrivate ) );\n\n \/\/ m_zoneMap[id] = pZone;\n\n \/\/ \/\/ start the region worker\n \/\/ \/\/ ThreadPool->executeTask(pRegion);\n \/\/ }\n \/\/ else\n \/\/ {\n \/\/ \/\/Console->outTime(\" --> %s\", inName.c_str());\n \/\/ \/\/Console->outTime(\"\\tCached private instance...\", name.c_str());\n\n \/\/ \/\/\/\/ write the instance data into the instance cache for later use\n \/\/ \/\/InstanceCacheEntry * pICE = new InstanceCacheEntry();\n \/\/ \/\/pICE->id\t\t= id;\n \/\/ \/\/pICE->inName\t= inName;\n \/\/ \/\/pICE->minX\t\t= minX;\n \/\/ \/\/pICE->maxX\t\t= maxX;\n \/\/ \/\/pICE->minY\t\t= minY;\n \/\/ \/\/pICE->maxY\t\t= maxY;\n \/\/ \/\/pICE->name\t\t= name;\n \/\/ \/\/pICE->layoutId = layoutId;\n \/\/ \/\/pICE->isPrivate\t= isPrivate;\n\n \/\/ \/\/m_instanceCache[pICE->id] = pICE;\n \/\/ \/\/m_instanceCacheName[inName] = pICE;\n\n \/\/ \/\/createInstance(pICE);\n \/\/ }\n\n \/\/} while(pQR->nextRow());\n\n return true;\n }\n\n void ZoneMgr::updateZones()\n {\n for( auto zone : m_zoneMap )\n {\n zone.second->runZoneLogic();\n }\n }\n\n ZonePtr ZoneMgr::getZone( uint32_t zoneId )\n {\n ZoneMap::iterator it;\n it = m_zoneMap.find( zoneId );\n\n if( it != m_zoneMap.end() )\n return it->second;\n\n return nullptr;\n }\n\n}\n<commit_msg>Fix zoneline handler<commit_after>#include <Server_Common\/Logger.h>\n#include <Server_Common\/Database.h>\n#include <Server_Common\/ExdData.h>\n#include <boost\/lexical_cast.hpp>\n\n#include \"ZoneMgr.h\"\n#include \"Zone.h\"\n\n#include \"ZonePosition.h\"\n\n\nextern Core::Logger g_log;\nextern Core::Db::Database g_database;\nextern Core::Data::ExdData g_exdData;\n\nnamespace Core {\n\n ZoneMgr::ZoneMgr()\n {\n }\n\n ZoneMgr::~ZoneMgr()\n {\n }\n\n void ZoneMgr::loadZonePositionMap()\n {\n auto pQR = g_database.query( \"SELECT id, target_zone_id, pos_x, pos_y, pos_z, pos_o, radius \" \\\n \"FROM zonepositions;\" );\n\n if( !pQR )\n return;\n\n do\n {\n Db::Field *field = pQR->fetch();\n uint32_t id = field[0].getUInt32();\n uint32_t targetZoneId = field[1].getUInt32();\n Common::FFXIVARR_POSITION3 pos;\n pos.x = field[2].getFloat();\n pos.y = field[3].getFloat();\n pos.z = field[4].getFloat();\n float posO = field[5].getFloat();\n uint32_t radius = field[6].getUInt32();\n \n m_zonePositionMap[id] = ZonePositionPtr( new ZonePosition( id, targetZoneId, pos, radius, posO ) );\n\n } while( pQR->nextRow() );\n }\n\n ZonePositionPtr ZoneMgr::getZonePosition( uint32_t zonePositionId )\n {\n auto it = m_zonePositionMap.find( zonePositionId );\n\n if( it != m_zonePositionMap.end() )\n return it->second;\n\n return nullptr;\n }\n\n bool ZoneMgr::createZones()\n {\n loadZonePositionMap();\n\n \/\/ find zone info from exd\n for( auto zone : g_exdData.m_zoneInfoMap )\n {\n uint32_t zoneId = zone.first;\n\n \n auto info = zone.second;\n g_log.Log( LoggingSeverity::info, std::to_string( info.id ) + \"\\t\" + info.zone_str );\n\n ZonePtr pZone( new Zone( info.id, info.layout_id, info.zone_name, info.zone_str, false ) );\n pZone->init();\n m_zoneMap[info.id] = pZone;\n }\n\n \/\/do\n \/\/{\n \/\/ Db::Field *field = pQR->fetch();\n \/\/ uint16_t id = field[0].getUInt16();\n \/\/ std::string inName = field[1].getString();\n \/\/ std::string name = field[2].getString();\n \/\/ uint32_t layoutId = field[3].getUInt32();\n \/\/ bool isPrivate = field[4].getBool();\n\n \/\/ if(!isPrivate)\n \/\/ {\n \/\/ g_log.Log(LoggingSeverity::info, std::to_string(id) + \"\\t\" + inName + \" - \" + name);\n\n \/\/ ZonePtr pZone( new Zone( id, layoutId, name, inName, isPrivate ) );\n\n \/\/ m_zoneMap[id] = pZone;\n\n \/\/ \/\/ start the region worker\n \/\/ \/\/ ThreadPool->executeTask(pRegion);\n \/\/ }\n \/\/ else\n \/\/ {\n \/\/ \/\/Console->outTime(\" --> %s\", inName.c_str());\n \/\/ \/\/Console->outTime(\"\\tCached private instance...\", name.c_str());\n\n \/\/ \/\/\/\/ write the instance data into the instance cache for later use\n \/\/ \/\/InstanceCacheEntry * pICE = new InstanceCacheEntry();\n \/\/ \/\/pICE->id\t\t= id;\n \/\/ \/\/pICE->inName\t= inName;\n \/\/ \/\/pICE->minX\t\t= minX;\n \/\/ \/\/pICE->maxX\t\t= maxX;\n \/\/ \/\/pICE->minY\t\t= minY;\n \/\/ \/\/pICE->maxY\t\t= maxY;\n \/\/ \/\/pICE->name\t\t= name;\n \/\/ \/\/pICE->layoutId = layoutId;\n \/\/ \/\/pICE->isPrivate\t= isPrivate;\n\n \/\/ \/\/m_instanceCache[pICE->id] = pICE;\n \/\/ \/\/m_instanceCacheName[inName] = pICE;\n\n \/\/ \/\/createInstance(pICE);\n \/\/ }\n\n \/\/} while(pQR->nextRow());\n\n return true;\n }\n\n void ZoneMgr::updateZones()\n {\n for( auto zone : m_zoneMap )\n {\n zone.second->runZoneLogic();\n }\n }\n\n ZonePtr ZoneMgr::getZone( uint32_t zoneId )\n {\n ZoneMap::iterator it;\n it = m_zoneMap.find( zoneId );\n\n if( it != m_zoneMap.end() )\n return it->second;\n\n return nullptr;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * VHDL code generation for logic devices.\n *\n * Copyright (C) 2008 Nick Gasson (nick@nickg.me.uk)\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include \"vhdl_target.h\"\n#include \"vhdl_element.hh\"\n\n#include <cassert>\n\n \n\/*\n * Convert the inputs of a logic gate to a binary expression.\n *\/\nstatic vhdl_expr *inputs_to_expr(vhdl_scope *scope, vhdl_binop_t op,\n ivl_net_logic_t log)\n{\n \/\/ Not always std_logic but this is probably OK since\n \/\/ the program has already been type checked\n vhdl_binop_expr *gate =\n new vhdl_binop_expr(op, vhdl_type::std_logic());\n \n int npins = ivl_logic_pins(log);\n for (int i = 1; i < npins; i++) {\n ivl_nexus_t input = ivl_logic_pin(log, i);\n gate->add_expr(nexus_to_var_ref(scope, input));\n }\n\n return gate;\n}\n\n\/*\n * Convert a gate intput to an unary expression.\n *\/\nstatic vhdl_expr *input_to_expr(vhdl_scope *scope, vhdl_unaryop_t op,\n ivl_net_logic_t log)\n{\n ivl_nexus_t input = ivl_logic_pin(log, 1);\n assert(input);\n\n vhdl_expr *operand = nexus_to_var_ref(scope, input);\n return new vhdl_unaryop_expr(op, operand, vhdl_type::std_logic()); \n}\n\nstatic void bufif_logic(vhdl_arch *arch, ivl_net_logic_t log, bool if0)\n{\n ivl_nexus_t output = ivl_logic_pin(log, 0);\n vhdl_var_ref *lhs = nexus_to_var_ref(arch->get_scope(), output);\n assert(lhs);\n \n vhdl_expr *val = nexus_to_var_ref(arch->get_scope(), ivl_logic_pin(log, 1));\n assert(val);\n\n vhdl_expr *sel = nexus_to_var_ref(arch->get_scope(), ivl_logic_pin(log, 2));\n assert(val);\n\n vhdl_expr *on = new vhdl_const_bit(if0 ? '0' : '1');\n vhdl_expr *cmp = new vhdl_binop_expr(sel, VHDL_BINOP_EQ, on, NULL);\n\n ivl_signal_t sig = find_signal_named(lhs->get_name(), arch->get_scope());\n char zbit;\n switch (ivl_signal_type(sig)) {\n case IVL_SIT_TRI0:\n zbit = '0';\n break;\n case IVL_SIT_TRI1:\n zbit = '1';\n break;\n case IVL_SIT_TRI:\n default:\n zbit = 'Z';\n }\n \n vhdl_const_bit *z = new vhdl_const_bit(zbit);\n vhdl_cassign_stmt *cass = new vhdl_cassign_stmt(lhs, z);\n cass->add_condition(val, cmp);\n\n arch->add_stmt(cass);\n}\n\nstatic vhdl_expr *translate_logic_inputs(vhdl_scope *scope, ivl_net_logic_t log)\n{\n switch (ivl_logic_type(log)) {\n case IVL_LO_NOT:\n return input_to_expr(scope, VHDL_UNARYOP_NOT, log);\n case IVL_LO_AND:\n return inputs_to_expr(scope, VHDL_BINOP_AND, log);\n case IVL_LO_OR:\n return inputs_to_expr(scope, VHDL_BINOP_OR, log);\n case IVL_LO_XOR:\n return inputs_to_expr(scope, VHDL_BINOP_XOR, log);\n case IVL_LO_BUF:\n case IVL_LO_BUFZ:\n return nexus_to_var_ref(scope, ivl_logic_pin(log, 1));\n case IVL_LO_PULLUP:\n return new vhdl_const_bit('1');\n case IVL_LO_PULLDOWN:\n return new vhdl_const_bit('0');\n default:\n error(\"Don't know how to translate logic type = %d to expression\",\n ivl_logic_type(log));\n return NULL;\n }\n}\n\nvoid draw_logic(vhdl_arch *arch, ivl_net_logic_t log)\n{\n switch (ivl_logic_type(log)) {\n case IVL_LO_BUFIF0:\n bufif_logic(arch, log, true);\n break;\n case IVL_LO_BUFIF1:\n bufif_logic(arch, log, false);\n break;\n default:\n { \n \/\/ The output is always pin zero\n ivl_nexus_t output = ivl_logic_pin(log, 0);\n vhdl_var_ref *lhs = nexus_to_var_ref(arch->get_scope(), output);\n\n vhdl_expr *rhs = translate_logic_inputs(arch->get_scope(), log);\n vhdl_cassign_stmt *ass = new vhdl_cassign_stmt(lhs, rhs);\n \n ivl_expr_t delay = ivl_logic_delay(log, 1);\n if (delay)\n ass->set_after(translate_time_expr(delay));\n \n arch->add_stmt(ass);\n }\n }\n}\n<commit_msg>Stub for UDP logic devices<commit_after>\/*\n * VHDL code generation for logic devices.\n *\n * Copyright (C) 2008 Nick Gasson (nick@nickg.me.uk)\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include \"vhdl_target.h\"\n#include \"vhdl_element.hh\"\n\n#include <cassert>\n\n \n\/*\n * Convert the inputs of a logic gate to a binary expression.\n *\/\nstatic vhdl_expr *inputs_to_expr(vhdl_scope *scope, vhdl_binop_t op,\n ivl_net_logic_t log)\n{\n \/\/ Not always std_logic but this is probably OK since\n \/\/ the program has already been type checked\n vhdl_binop_expr *gate =\n new vhdl_binop_expr(op, vhdl_type::std_logic());\n \n int npins = ivl_logic_pins(log);\n for (int i = 1; i < npins; i++) {\n ivl_nexus_t input = ivl_logic_pin(log, i);\n gate->add_expr(nexus_to_var_ref(scope, input));\n }\n\n return gate;\n}\n\n\/*\n * Convert a gate intput to an unary expression.\n *\/\nstatic vhdl_expr *input_to_expr(vhdl_scope *scope, vhdl_unaryop_t op,\n ivl_net_logic_t log)\n{\n ivl_nexus_t input = ivl_logic_pin(log, 1);\n assert(input);\n\n vhdl_expr *operand = nexus_to_var_ref(scope, input);\n return new vhdl_unaryop_expr(op, operand, vhdl_type::std_logic()); \n}\n\nstatic void bufif_logic(vhdl_arch *arch, ivl_net_logic_t log, bool if0)\n{\n ivl_nexus_t output = ivl_logic_pin(log, 0);\n vhdl_var_ref *lhs = nexus_to_var_ref(arch->get_scope(), output);\n assert(lhs);\n \n vhdl_expr *val = nexus_to_var_ref(arch->get_scope(), ivl_logic_pin(log, 1));\n assert(val);\n\n vhdl_expr *sel = nexus_to_var_ref(arch->get_scope(), ivl_logic_pin(log, 2));\n assert(val);\n\n vhdl_expr *on = new vhdl_const_bit(if0 ? '0' : '1');\n vhdl_expr *cmp = new vhdl_binop_expr(sel, VHDL_BINOP_EQ, on, NULL);\n\n ivl_signal_t sig = find_signal_named(lhs->get_name(), arch->get_scope());\n char zbit;\n switch (ivl_signal_type(sig)) {\n case IVL_SIT_TRI0:\n zbit = '0';\n break;\n case IVL_SIT_TRI1:\n zbit = '1';\n break;\n case IVL_SIT_TRI:\n default:\n zbit = 'Z';\n }\n \n vhdl_const_bit *z = new vhdl_const_bit(zbit);\n vhdl_cassign_stmt *cass = new vhdl_cassign_stmt(lhs, z);\n cass->add_condition(val, cmp);\n\n arch->add_stmt(cass);\n}\n\nstatic void udp_logic(vhdl_arch *arch, ivl_udp_t udp)\n{\n\n}\n\nstatic vhdl_expr *translate_logic_inputs(vhdl_scope *scope, ivl_net_logic_t log)\n{\n switch (ivl_logic_type(log)) {\n case IVL_LO_NOT:\n return input_to_expr(scope, VHDL_UNARYOP_NOT, log);\n case IVL_LO_AND:\n return inputs_to_expr(scope, VHDL_BINOP_AND, log);\n case IVL_LO_OR:\n return inputs_to_expr(scope, VHDL_BINOP_OR, log);\n case IVL_LO_XOR:\n return inputs_to_expr(scope, VHDL_BINOP_XOR, log);\n case IVL_LO_BUF:\n case IVL_LO_BUFZ:\n return nexus_to_var_ref(scope, ivl_logic_pin(log, 1));\n case IVL_LO_PULLUP:\n return new vhdl_const_bit('1');\n case IVL_LO_PULLDOWN:\n return new vhdl_const_bit('0');\n default:\n error(\"Don't know how to translate logic type = %d to expression\",\n ivl_logic_type(log));\n return NULL;\n }\n}\n\nvoid draw_logic(vhdl_arch *arch, ivl_net_logic_t log)\n{\n switch (ivl_logic_type(log)) {\n case IVL_LO_BUFIF0:\n bufif_logic(arch, log, true);\n break;\n case IVL_LO_BUFIF1:\n bufif_logic(arch, log, false);\n break;\n case IVL_LO_UDP:\n udp_logic(arch, ivl_logic_udp(log));\n break;\n default:\n { \n \/\/ The output is always pin zero\n ivl_nexus_t output = ivl_logic_pin(log, 0);\n vhdl_var_ref *lhs = nexus_to_var_ref(arch->get_scope(), output);\n\n vhdl_expr *rhs = translate_logic_inputs(arch->get_scope(), log);\n vhdl_cassign_stmt *ass = new vhdl_cassign_stmt(lhs, rhs);\n \n ivl_expr_t delay = ivl_logic_delay(log, 1);\n if (delay)\n ass->set_after(translate_time_expr(delay));\n \n arch->add_stmt(ass);\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include \"..\/config.h\"\n#include \"..\/dbmanager.h\"\n#include \"..\/iconmanager.h\"\n#include \"..\/mainwindow.h\"\n#include \"..\/tools\/logger.h\"\n#include \"..\/widgets\/resultview.h\"\n\n#include \"queryeditorwidget.h\"\n\n#include <QSqlQuery>\n\nQueryEditorWidget::QueryEditorWidget(QWidget *parent)\n : AbstractTabWidget(parent) {\n setupUi(this);\n setupWidgets();\n setupConnections();\n\n setAutoDelete(false);\n\n model = new QSqlQueryModel(this);\n shortModel = new QStandardItemModel(this);\n \/\/ watcher = new QFileSystemWatcher(this);\n}\n\nAbstractTabWidget::Actions QueryEditorWidget::availableActions() {\n Actions ret = baseActions;\n if (!isSaved()) {\n ret |= Save;\n }\n\n if (editor->document()->isUndoAvailable()) {\n ret |= Undo;\n }\n\n if (editor->document()->isRedoAvailable()) {\n ret |= Redo;\n }\n\n return ret;\n}\n\nvoid QueryEditorWidget::checkDbOpen() {\n DbManager::lastIndex = dbChooser->currentIndex();\n\n QSqlDatabase *db = DbManager::getDatabase(dbChooser->currentIndex());\n if (db == NULL) {\n runButton->setEnabled(false);\n return;\n }\n\n runButton->setEnabled(db->isOpen());\n\n if (!db->isOpen() || db->driverName().startsWith(\"QOCI\")) {\n return;\n }\n\n QMultiMap<QString, QString> fields;\n QSqlRecord r;\n QStringList tables = db->tables();\n foreach (QString t, tables) {\n r = db->record(t);\n for (int i=0; i<r.count(); i++) {\n fields.insert(t, r.fieldName(i));\n }\n }\n\n editor->reloadContext(tables, fields);\n}\n\nvoid QueryEditorWidget::closeEvent(QCloseEvent *event) {\n if (isSaved()) {\n event->accept();\n } else {\n if (confirmClose()) {\n event->accept();\n } else {\n event->ignore();\n }\n }\n}\n\nbool QueryEditorWidget::confirmClose() {\n \/\/ check if it's saved or not\n if (!isSaved()) {\n int ret = QMessageBox::warning(\n this,\n tr( \"DbMaster\" ),\n tr( \"Warning ! All your modifications will be lost.\\nDo you want to save ?\" ),\n QMessageBox::Cancel | QMessageBox::Save | QMessageBox::Discard,\n QMessageBox::Cancel);\n\n switch (ret) {\n case QMessageBox::Cancel:\n return false;\n\n case QMessageBox::Save:\n return save();\n }\n }\n\n return true;\n}\n\nint QueryEditorWidget::confirmCloseAll() {\n if (isSaved()) {\n return QMessageBox::Yes;\n }\n\n QString msg(tr(\"Warning ! All your modifications will be lost.\\nDo you want to save ?\"));\n if (filePath.isNull()) {\n msg = QString(tr(\"Warning ! %1 hasn't been saved\\nDo you want to save ?\"))\n .arg(filePath);\n }\n\n int ret = QMessageBox::warning(this, tr(\"DbMaster\"), msg,\n QMessageBox::Save | QMessageBox::SaveAll |\n QMessageBox::No | QMessageBox::NoAll |\n QMessageBox::Cancel,\n QMessageBox::Cancel);\n\n return ret;\n}\n\nvoid QueryEditorWidget::copy() {\n editor->copy();\n}\n\nvoid QueryEditorWidget::cut() {\n editor->cut();\n}\n\nQString QueryEditorWidget::file() {\n return filePath;\n}\n\nvoid QueryEditorWidget::onFileChanged(QString path) {\n if (QFile::exists(path)) {\n \/\/ Le fichier a été modifié\n } else {\n \/\/ Le fichier a été supprimé\n }\n}\n\nQIcon QueryEditorWidget::icon() {\n return IconManager::get(\"accessories-text-editor\");\n}\n\nQString QueryEditorWidget::id() {\n QString ret = \"q\";\n if (!filePath.isEmpty()) {\n ret.append(\" %1\").arg( filePath );\n }\n return ret;\n}\n\nbool QueryEditorWidget::isSaved() {\n return !editor->document()->isModified();\n}\n\nvoid QueryEditorWidget::keyPressEvent(QKeyEvent *event) {\n if (event->key() == Qt::Key_Escape) {\n \/\/ Appui touche échap = masque le panel de résultat\n tabView->hide();\n resultButton->setChecked(false);\n } else {\n QWidget::keyPressEvent(event);\n }\n}\n\nvoid QueryEditorWidget::lowerCase() {\n QTextCursor tc = editor->textCursor();\n if (tc.selectedText().size() > 0) {\n QString txt = tc.selectedText();\n tc.removeSelectedText();\n tc.insertText(txt.toLower());\n tc.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, txt.size());\n editor->setTextCursor(tc);\n }\n}\n\nvoid QueryEditorWidget::open(QString path) {\n if (!confirmClose())\n return;\n\n setFilePath(path);\n reloadFile();\n}\n\nvoid QueryEditorWidget::paste() {\n editor->paste();\n}\n\nvoid QueryEditorWidget::print() {\n QPainter painter;\n painter.begin(&m_printer);\n editor->document()->drawContents(&painter);\n painter.end();\n}\n\nQPrinter *QueryEditorWidget::printer() {\n return &m_printer;\n}\n\nvoid QueryEditorWidget::redo() {\n editor->redo();\n}\n\nvoid QueryEditorWidget::refresh() {\n checkDbOpen();\n}\n\nvoid QueryEditorWidget::reload() {\n run();\n}\n\n\/**\n * Called after open(QString)\n *\/\nvoid QueryEditorWidget::reloadFile() {\n if (!confirmClose()) {\n return;\n }\n\n editor->clear();\n\n \/\/ loading the file\n QFile file(filePath);\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) {\n \/\/ OMG ! an error occured\n QMessageBox::critical(this, tr(\"DbMaster\"),\n tr(\"Unable to open the file !\"),\n QMessageBox::Ok );\n return;\n }\n\n if (Config::editorEncoding == \"latin1\") {\n editor->append(QString::fromLatin1(file.readAll().data()));\n }\n\n if (Config::editorEncoding == \"utf8\") {\n editor->append(QString::fromUtf8(file.readAll().data()));\n }\n\n file.close();\n\n editor->document()->setModified(false);\n\n emit fileChanged(filePath);\n}\n\nvoid QueryEditorWidget::run() {\n QString qtext = editor->textCursor().selectedText();\n if (qtext.isEmpty()) {\n qtext = editor->toPlainText();\n }\n\n QSqlDatabase* db = DbManager::getDatabase(dbChooser->currentIndex());\n query = QSqlQuery(*db);\n query.exec(qtext);\n model->setQuery(query);\n\n emit queryFinished();\n}\n\n\/**\n * @returns false in case of error\n *\/\nbool QueryEditorWidget::save() {\n if (isSaved()) {\n return true;\n }\n\n if (filePath.isNull()) {\n setFilePath(QFileDialog::getSaveFileName(\n this, tr(\"DbMaster\"), lastDir.path(),\n tr(\"Query file (*.sql);;All files (*.*)\")));\n\n if(filePath.isNull())\n return false;\n }\n\n QFile file(filePath);\n lastDir = filePath;\n\n if (!file.open(QIODevice::WriteOnly | QIODevice::Text)) {\n QMessageBox::critical(this, tr(\"DbMaster\"), tr(\"Unable to save the file !\"),\n QMessageBox::Ok);\n return false;\n }\n\n editor->setEnabled(false);\n setCursor(Qt::BusyCursor);\n\n QTextStream out( &file );\n QStringList list( editor->toPlainText().split( '\\n' ) );\n\n int count = list.count();\n for (int i = 0; i < count; i++) {\n out << list[i];\n if( i != count )\n out << '\\n';\n }\n\n file.close();\n\n editor->document()->setModified(false);\n\n editor->setEnabled(true);\n setCursor(Qt::ArrowCursor);\n\n emit modificationChanged(editor->document()->isModified());\n return true;\n}\n\nvoid QueryEditorWidget::saveAs(QString name) {\n filePath = name;\n save();\n}\n\nvoid QueryEditorWidget::selectAll() {\n editor->selectAll();\n}\n\nvoid QueryEditorWidget::setFilePath(QString path) {\n \/\/ watcher->removePath(this->filePath);\n this->filePath = path;\n\n if(path.size() > 30)\n path = QFileInfo(path).fileName();\n\n pathLabel->setText(path);\n if (path.length() > 0) {\n \/\/ watcher->addPath(path);\n }\n}\n\nvoid QueryEditorWidget::setupConnections() {\n connect(dbChooser, SIGNAL(currentIndexChanged(int)),\n this, SLOT(checkDbOpen()));\n connect(tabView, SIGNAL(reloadRequested()), this, SLOT(reload()));\n\n connect(runButton, SIGNAL(clicked()), this, SLOT(start()));\n\n connect(editor->document(), SIGNAL(modificationChanged(bool)),\n this, SIGNAL(modificationChanged(bool)));\n\n connect(this, SIGNAL(queryFinished()),\n this, SLOT(validateQuery()));\n\n \/\/ connect(watcher, SIGNAL(fileChanged(QString)),\n \/\/ this, SLOT(onFileChanged(QString)));\n}\n\nvoid QueryEditorWidget::setupWidgets() {\n editor->setFont(Config::editorFont);\n\n tabView->hide();\n\n statusBar = new QStatusBar(this);\n statusBar->setSizeGripEnabled(false);\n gridLayout->addWidget(statusBar, gridLayout->rowCount(), 0, 1, -1);\n\n resultButton = new QToolButton(this);\n resultButton->setText(tr(\"Display result\"));\n resultButton->setCheckable(true);\n resultButton->setEnabled(false);\n statusBar->addPermanentWidget(resultButton);\n connect(resultButton, SIGNAL(clicked(bool)),\n tabView, SLOT(setVisible(bool)));\n\n baseActions = CaseLower | CaseUpper | Copy | Cut | Paste | Print | SaveAs\n | Search | SelectAll;\n\n dbChooser->setModel(DbManager::model());\n dbChooser->setCurrentIndex(DbManager::lastIndex);\n\n runButton->setIcon(IconManager::get(\"player_play\"));\n\n refresh();\n}\n\nvoid QueryEditorWidget::showEvent(QShowEvent *event) {\n editor->setFocus();\n}\n\nvoid QueryEditorWidget::start() {\n resultButton->setChecked(false);\n tabView->setVisible(false);\n resultButton->setEnabled(false);\n runButton->setEnabled(false);\n\n statusBar->showMessage(tr(\"Running...\"));\n\n QThreadPool::globalInstance()->start(this);\n}\n\nQString QueryEditorWidget::title() {\n QString t;\n if(!filePath.isEmpty())\n t = QFileInfo(filePath).fileName();\n else\n t = tr(\"Query editor\");\n\n return t;\n}\n\nQTextEdit* QueryEditorWidget::textEdit() {\n return editor;\n}\n\nvoid QueryEditorWidget::undo() {\n editor->undo();\n}\n\nvoid QueryEditorWidget::upperCase() {\n QTextCursor tc = editor->textCursor();\n if (tc.selectedText().size() > 0) {\n QString txt = tc.selectedText();\n tc.removeSelectedText();\n tc.insertText(txt.toUpper());\n tc.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, txt.size());\n editor->setTextCursor(tc);\n }\n}\n\nvoid QueryEditorWidget::validateQuery() {\n \/\/ tabWidget->setTabEnabled(1, false);\n\n QString logMsg;\n\n switch(query.lastError().type()) {\n case QSqlError::NoError:\n tabView->setQuery(model);\n tabView->setVisible(true);\n resultButton->setEnabled(true);\n logMsg = tr(\"Query executed with success (%1 lines returned)\")\n .arg(model->rowCount());\n \/\/ .arg(token->duration());\n\n statusBar->showMessage(logMsg);\n break;\n\n default:\n logMsg = tr(\"Unable to run query\");\n statusBar->showMessage(logMsg);\n logMsg.append(\n QString(\"<br \/><span style=\\\"color: red\\\">%1<\/span>\")\n .arg(query.lastError().text()));\n break;\n }\n\n logMsg.append(\n QString(\"<br \/><span style=\\\"color: blue\\\">%1<\/span>\")\n .arg(query.lastQuery().replace(\"\\n\", \" \")));\n Logger::instance->log(logMsg);\n\n runButton->setEnabled(true);\n}\n<commit_msg>Button error<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License as published by the Free Software\n * Foundation; version 3 of the License.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n *\/\n\n\n#include \"..\/config.h\"\n#include \"..\/dbmanager.h\"\n#include \"..\/iconmanager.h\"\n#include \"..\/mainwindow.h\"\n#include \"..\/tools\/logger.h\"\n#include \"..\/widgets\/resultview.h\"\n\n#include \"queryeditorwidget.h\"\n\n#include <QSqlQuery>\n\nQueryEditorWidget::QueryEditorWidget(QWidget *parent)\n : AbstractTabWidget(parent) {\n setupUi(this);\n setupWidgets();\n setupConnections();\n\n setAutoDelete(false);\n\n model = new QSqlQueryModel(this);\n shortModel = new QStandardItemModel(this);\n \/\/ watcher = new QFileSystemWatcher(this);\n}\n\nAbstractTabWidget::Actions QueryEditorWidget::availableActions() {\n Actions ret = baseActions;\n if (!isSaved()) {\n ret |= Save;\n }\n\n if (editor->document()->isUndoAvailable()) {\n ret |= Undo;\n }\n\n if (editor->document()->isRedoAvailable()) {\n ret |= Redo;\n }\n\n return ret;\n}\n\nvoid QueryEditorWidget::checkDbOpen() {\n DbManager::lastIndex = dbChooser->currentIndex();\n\n QSqlDatabase *db = DbManager::getDatabase(dbChooser->currentIndex());\n if (db == NULL) {\n runButton->setEnabled(false);\n return;\n }\n\n runButton->setEnabled(db->isOpen());\n\n if (!db->isOpen() || db->driverName().startsWith(\"QOCI\")) {\n return;\n }\n\n QMultiMap<QString, QString> fields;\n QSqlRecord r;\n QStringList tables = db->tables();\n foreach (QString t, tables) {\n r = db->record(t);\n for (int i=0; i<r.count(); i++) {\n fields.insert(t, r.fieldName(i));\n }\n }\n\n editor->reloadContext(tables, fields);\n}\n\nvoid QueryEditorWidget::closeEvent(QCloseEvent *event) {\n if (isSaved()) {\n event->accept();\n } else {\n if (confirmClose()) {\n event->accept();\n } else {\n event->ignore();\n }\n }\n}\n\nbool QueryEditorWidget::confirmClose() {\n \/\/ check if it's saved or not\n if (!isSaved()) {\n int ret = QMessageBox::warning(\n this,\n tr( \"DbMaster\" ),\n tr( \"Warning ! All your modifications will be lost.\\nDo you want to save ?\" ),\n QMessageBox::Cancel | QMessageBox::Save | QMessageBox::Discard,\n QMessageBox::Cancel);\n\n switch (ret) {\n case QMessageBox::Cancel:\n return false;\n\n case QMessageBox::Save:\n return save();\n }\n }\n\n return true;\n}\n\nint QueryEditorWidget::confirmCloseAll() {\n if (isSaved()) {\n return QMessageBox::Yes;\n }\n\n QString msg(tr(\"Warning ! All your modifications will be lost.\\nDo you want to save ?\"));\n if (filePath.isNull()) {\n msg = QString(tr(\"Warning ! %1 hasn't been saved\\nDo you want to save ?\"))\n .arg(filePath);\n }\n\n int ret = QMessageBox::warning(this, tr(\"DbMaster\"), msg,\n QMessageBox::Save | QMessageBox::SaveAll |\n QMessageBox::No | QMessageBox::NoAll |\n QMessageBox::Cancel,\n QMessageBox::Cancel);\n\n return ret;\n}\n\nvoid QueryEditorWidget::copy() {\n editor->copy();\n}\n\nvoid QueryEditorWidget::cut() {\n editor->cut();\n}\n\nQString QueryEditorWidget::file() {\n return filePath;\n}\n\nvoid QueryEditorWidget::onFileChanged(QString path) {\n if (QFile::exists(path)) {\n \/\/ Le fichier a été modifié\n } else {\n \/\/ Le fichier a été supprimé\n }\n}\n\nQIcon QueryEditorWidget::icon() {\n return IconManager::get(\"accessories-text-editor\");\n}\n\nQString QueryEditorWidget::id() {\n QString ret = \"q\";\n if (!filePath.isEmpty()) {\n ret.append(\" %1\").arg( filePath );\n }\n return ret;\n}\n\nbool QueryEditorWidget::isSaved() {\n return !editor->document()->isModified();\n}\n\nvoid QueryEditorWidget::keyPressEvent(QKeyEvent *event) {\n if (event->key() == Qt::Key_Escape) {\n \/\/ Appui touche échap = masque le panel de résultat\n tabView->hide();\n resultButton->setChecked(false);\n } else {\n QWidget::keyPressEvent(event);\n }\n}\n\nvoid QueryEditorWidget::lowerCase() {\n QTextCursor tc = editor->textCursor();\n if (tc.selectedText().size() > 0) {\n QString txt = tc.selectedText();\n tc.removeSelectedText();\n tc.insertText(txt.toLower());\n tc.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, txt.size());\n editor->setTextCursor(tc);\n }\n}\n\nvoid QueryEditorWidget::open(QString path) {\n if (!confirmClose())\n return;\n\n setFilePath(path);\n reloadFile();\n}\n\nvoid QueryEditorWidget::paste() {\n editor->paste();\n}\n\nvoid QueryEditorWidget::print() {\n QPainter painter;\n painter.begin(&m_printer);\n editor->document()->drawContents(&painter);\n painter.end();\n}\n\nQPrinter *QueryEditorWidget::printer() {\n return &m_printer;\n}\n\nvoid QueryEditorWidget::redo() {\n editor->redo();\n}\n\nvoid QueryEditorWidget::refresh() {\n checkDbOpen();\n}\n\nvoid QueryEditorWidget::reload() {\n run();\n}\n\n\/**\n * Called after open(QString)\n *\/\nvoid QueryEditorWidget::reloadFile() {\n if (!confirmClose()) {\n return;\n }\n\n editor->clear();\n\n \/\/ loading the file\n QFile file(filePath);\n if (!file.open(QIODevice::ReadOnly | QIODevice::Text)) {\n \/\/ OMG ! an error occured\n QMessageBox::critical(this, tr(\"DbMaster\"),\n tr(\"Unable to open the file !\"),\n QMessageBox::Ok );\n return;\n }\n\n if (Config::editorEncoding == \"latin1\") {\n editor->append(QString::fromLatin1(file.readAll().data()));\n }\n\n if (Config::editorEncoding == \"utf8\") {\n editor->append(QString::fromUtf8(file.readAll().data()));\n }\n\n file.close();\n\n editor->document()->setModified(false);\n\n emit fileChanged(filePath);\n}\n\nvoid QueryEditorWidget::run() {\n QString qtext = editor->textCursor().selectedText();\n if (qtext.isEmpty()) {\n qtext = editor->toPlainText();\n }\n\n QSqlDatabase* db = DbManager::getDatabase(dbChooser->currentIndex());\n query = QSqlQuery(*db);\n query.exec(qtext);\n model->setQuery(query);\n\n emit queryFinished();\n}\n\n\/**\n * @returns false in case of error\n *\/\nbool QueryEditorWidget::save() {\n if (isSaved()) {\n return true;\n }\n\n if (filePath.isNull()) {\n setFilePath(QFileDialog::getSaveFileName(\n this, tr(\"DbMaster\"), lastDir.path(),\n tr(\"Query file (*.sql);;All files (*.*)\")));\n\n if(filePath.isNull())\n return false;\n }\n\n QFile file(filePath);\n lastDir = filePath;\n\n if (!file.open(QIODevice::WriteOnly | QIODevice::Text)) {\n QMessageBox::critical(this, tr(\"DbMaster\"), tr(\"Unable to save the file !\"),\n QMessageBox::Ok);\n return false;\n }\n\n editor->setEnabled(false);\n setCursor(Qt::BusyCursor);\n\n QTextStream out( &file );\n QStringList list( editor->toPlainText().split( '\\n' ) );\n\n int count = list.count();\n for (int i = 0; i < count; i++) {\n out << list[i];\n if( i != count )\n out << '\\n';\n }\n\n file.close();\n\n editor->document()->setModified(false);\n\n editor->setEnabled(true);\n setCursor(Qt::ArrowCursor);\n\n emit modificationChanged(editor->document()->isModified());\n return true;\n}\n\nvoid QueryEditorWidget::saveAs(QString name) {\n filePath = name;\n save();\n}\n\nvoid QueryEditorWidget::selectAll() {\n editor->selectAll();\n}\n\nvoid QueryEditorWidget::setFilePath(QString path) {\n \/\/ watcher->removePath(this->filePath);\n this->filePath = path;\n\n if(path.size() > 30)\n path = QFileInfo(path).fileName();\n\n pathLabel->setText(path);\n if (path.length() > 0) {\n \/\/ watcher->addPath(path);\n }\n}\n\nvoid QueryEditorWidget::setupConnections() {\n connect(dbChooser, SIGNAL(currentIndexChanged(int)),\n this, SLOT(checkDbOpen()));\n connect(tabView, SIGNAL(reloadRequested()), this, SLOT(reload()));\n\n connect(runButton, SIGNAL(clicked()), this, SLOT(start()));\n\n connect(editor->document(), SIGNAL(modificationChanged(bool)),\n this, SIGNAL(modificationChanged(bool)));\n\n connect(this, SIGNAL(queryFinished()),\n this, SLOT(validateQuery()));\n\n \/\/ connect(watcher, SIGNAL(fileChanged(QString)),\n \/\/ this, SLOT(onFileChanged(QString)));\n}\n\nvoid QueryEditorWidget::setupWidgets() {\n editor->setFont(Config::editorFont);\n\n tabView->hide();\n\n statusBar = new QStatusBar(this);\n statusBar->setSizeGripEnabled(false);\n gridLayout->addWidget(statusBar, gridLayout->rowCount(), 0, 1, -1);\n\n resultButton = new QToolButton(this);\n resultButton->setText(tr(\"Display result\"));\n resultButton->setCheckable(true);\n resultButton->setEnabled(false);\n statusBar->addPermanentWidget(resultButton);\n connect(resultButton, SIGNAL(clicked(bool)),\n tabView, SLOT(setVisible(bool)));\n\n baseActions = CaseLower | CaseUpper | Copy | Cut | Paste | Print | SaveAs\n | Search | SelectAll;\n\n dbChooser->setModel(DbManager::model());\n dbChooser->setCurrentIndex(DbManager::lastIndex);\n\n runButton->setIcon(IconManager::get(\"player_play\"));\n\n refresh();\n}\n\nvoid QueryEditorWidget::showEvent(QShowEvent *event) {\n editor->setFocus();\n}\n\nvoid QueryEditorWidget::start() {\n resultButton->setChecked(false);\n tabView->setVisible(false);\n resultButton->setEnabled(false);\n runButton->setEnabled(false);\n\n statusBar->showMessage(tr(\"Running...\"));\n\n QThreadPool::globalInstance()->start(this);\n}\n\nQString QueryEditorWidget::title() {\n QString t;\n if(!filePath.isEmpty())\n t = QFileInfo(filePath).fileName();\n else\n t = tr(\"Query editor\");\n\n return t;\n}\n\nQTextEdit* QueryEditorWidget::textEdit() {\n return editor;\n}\n\nvoid QueryEditorWidget::undo() {\n editor->undo();\n}\n\nvoid QueryEditorWidget::upperCase() {\n QTextCursor tc = editor->textCursor();\n if (tc.selectedText().size() > 0) {\n QString txt = tc.selectedText();\n tc.removeSelectedText();\n tc.insertText(txt.toUpper());\n tc.movePosition(QTextCursor::PreviousCharacter, QTextCursor::KeepAnchor, txt.size());\n editor->setTextCursor(tc);\n }\n}\n\nvoid QueryEditorWidget::validateQuery() {\n \/\/ tabWidget->setTabEnabled(1, false);\n\n QString logMsg;\n\n switch(query.lastError().type()) {\n case QSqlError::NoError:\n tabView->setQuery(model);\n tabView->setVisible(true);\n resultButton->setEnabled(true);\n resultButton->setChecked(true);\n logMsg = tr(\"Query executed with success (%1 lines returned)\")\n .arg(model->rowCount());\n \/\/ .arg(token->duration());\n\n statusBar->showMessage(logMsg);\n break;\n\n default:\n logMsg = tr(\"Unable to run query\");\n statusBar->showMessage(logMsg);\n logMsg.append(\n QString(\"<br \/><span style=\\\"color: red\\\">%1<\/span>\")\n .arg(query.lastError().text()));\n break;\n }\n\n logMsg.append(\n QString(\"<br \/><span style=\\\"color: blue\\\">%1<\/span>\")\n .arg(query.lastQuery().replace(\"\\n\", \" \")));\n Logger::instance->log(logMsg);\n\n runButton->setEnabled(true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Modified by ScyllaDB\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include <memory>\n\n#include \"utils\/data_output.hh\"\n#include \"core\/future.hh\"\n#include \"core\/shared_ptr.hh\"\n#include \"core\/stream.hh\"\n#include \"replay_position.hh\"\n#include \"commitlog_entry.hh\"\n\nnamespace seastar { class file; }\n\n#include \"seastarx.hh\"\n\nnamespace db {\n\nclass config;\nclass rp_set;\nclass rp_handle;\n\n\/*\n * Commit Log tracks every write operation into the system. The aim of\n * the commit log is to be able to successfully recover data that was\n * not stored to disk via the Memtable.\n *\n * This impl is cassandra log format compatible (for what it is worth).\n * The behaviour is similar, but not 100% identical as \"stock cl\".\n *\n * Files are managed with \"normal\" file writes (as normal as seastar\n * gets) - no mmapping. Data is kept in internal buffers which, when\n * full, are written to disk (see below). Files are also flushed\n * periodically (or always), ensuring all data is written + writes are\n * complete.\n *\n * In BATCH mode, every write to the log will also send the data to disk\n * + issue a flush and wait for both to complete.\n *\n * In PERIODIC mode, most writes will only add to the internal memory\n * buffers. If the mem buffer is saturated, data is sent to disk, but we\n * don't wait for the write to complete. However, if periodic (timer)\n * flushing has not been done in X ms, we will write + flush to file. In\n * which case we wait for it.\n *\n * The commitlog does not guarantee any ordering between \"add\" callers\n * (due to the above). The actual order in the commitlog is however\n * identified by the replay_position returned.\n *\n * Like the stock cl, the log segments keep track of the highest dirty\n * (added) internal position for a given table id (cf_id_type \/ UUID).\n * Code should ensure to use discard_completed_segments with UUID +\n * highest rp once a memtable has been flushed. This will allow\n * discarding used segments. Failure to do so will keep stuff\n * indefinately.\n *\/\nclass commitlog {\npublic:\n using timeout_clock = lowres_clock;\n\n class segment_manager;\n class segment;\n\n friend class rp_handle;\nprivate:\n ::shared_ptr<segment_manager> _segment_manager;\npublic:\n enum class sync_mode {\n PERIODIC, BATCH\n };\n struct config {\n config() = default;\n config(const config&) = default;\n config(const db::config&);\n\n sstring commit_log_location;\n sstring metrics_category_name;\n uint64_t commitlog_total_space_in_mb = 0;\n uint64_t commitlog_segment_size_in_mb = 32;\n uint64_t commitlog_sync_period_in_ms = 10 * 1000; \/\/TODO: verify default!\n \/\/ Max number of segments to keep in pre-alloc reserve.\n \/\/ Not (yet) configurable from scylla.conf.\n uint64_t max_reserve_segments = 12;\n \/\/ Max active writes\/flushes. Default value\n \/\/ zero means try to figure it out ourselves\n uint64_t max_active_writes = 0;\n uint64_t max_active_flushes = 0;\n\n sync_mode mode = sync_mode::PERIODIC;\n std::string fname_prefix = descriptor::FILENAME_PREFIX;\n };\n\n struct descriptor {\n private:\n descriptor(std::pair<uint64_t, uint32_t> p, const std::string& fname_prefix);\n public:\n static const std::string SEPARATOR;\n static const std::string FILENAME_PREFIX;\n static const std::string FILENAME_EXTENSION;\n\n descriptor(descriptor&&) = default;\n descriptor(const descriptor&) = default;\n descriptor(segment_id_type i, const std::string& fname_prefix, uint32_t v = 1);\n descriptor(replay_position p, const std::string& fname_prefix);\n descriptor(const sstring& filename, const std::string& fname_prefix);\n\n sstring filename() const;\n operator replay_position() const;\n\n const segment_id_type id;\n const uint32_t ver;\n const std::string filename_prefix = FILENAME_PREFIX;\n };\n\n commitlog(commitlog&&) noexcept;\n ~commitlog();\n\n \/**\n * Commitlog is created via a factory func.\n * This of course because it needs to access disk to get up to speed.\n * Optionally, could have an \"init\" func and require calling this.\n *\/\n static future<commitlog> create_commitlog(config);\n\n\n \/**\n * Note: To be able to keep impl out of header file,\n * actual data writing is done via a std::function.\n * If it is proven that this has unacceptable overhead, this can be replace\n * by iter an interface or move segments and stuff into the header. But\n * I hope not.\n *\n * A serializing func is provided along with a parameter indicating the size\n * of data to be written. (See add).\n * Don't write less, absolutely don't write more...\n *\/\n using output = data_output;\n using serializer_func = std::function<void(output&)>;\n\n \/**\n * Add a \"Mutation\" to the commit log.\n *\n * Resolves with timed_out_error when timeout is reached.\n *\n * @param mutation_func a function that writes 'size' bytes to the log, representing the mutation.\n *\/\n future<rp_handle> add(const cf_id_type& id, size_t size, timeout_clock::time_point timeout, serializer_func mutation_func);\n\n \/**\n * Template version of add.\n * Resolves with timed_out_error when timeout is reached.\n * @param mu an invokable op that generates the serialized data. (Of size bytes)\n *\/\n template<typename _MutationOp>\n future<rp_handle> add_mutation(const cf_id_type& id, size_t size, timeout_clock::time_point timeout, _MutationOp&& mu) {\n return add(id, size, timeout, [mu = std::forward<_MutationOp>(mu)](output& out) {\n mu(out);\n });\n }\n\n \/**\n * Template version of add.\n * @param mu an invokable op that generates the serialized data. (Of size bytes)\n *\/\n template<typename _MutationOp>\n future<rp_handle> add_mutation(const cf_id_type& id, size_t size, _MutationOp&& mu) {\n return add_mutation(id, size, timeout_clock::time_point::max(), std::forward<_MutationOp>(mu));\n }\n\n \/**\n * Add an entry to the commit log.\n * Resolves with timed_out_error when timeout is reached.\n * @param entry_writer a writer responsible for writing the entry\n *\/\n future<rp_handle> add_entry(const cf_id_type& id, const commitlog_entry_writer& entry_writer, timeout_clock::time_point timeout);\n\n \/**\n * Modifies the per-CF dirty cursors of any commit log segments for the column family according to the position\n * given. Discards any commit log segments that are no longer used.\n *\n * @param cfId the column family ID that was flushed\n * @param rp_set the replay positions of the flush\n *\/\n void discard_completed_segments(const cf_id_type&, const rp_set&);\n\n void discard_completed_segments(const cf_id_type&);\n\n \/**\n * A 'flush_handler' is invoked when the CL determines that size on disk has\n * exceeded allowable threshold. It is called once for every currently active\n * CF id with the highest replay_position which we would prefer to free \"until\".\n * I.e. a the highest potentially freeable position in the CL.\n *\n * Whatever the callback does to help (or not) this desire is up to him.\n * This is called synchronously, so callee might want to instigate async ops\n * in the background.\n *\n *\/\n typedef std::function<void(cf_id_type, replay_position)> flush_handler;\n typedef uint64_t flush_handler_id;\n\n class flush_handler_anchor {\n public:\n friend class commitlog;\n ~flush_handler_anchor();\n flush_handler_anchor(flush_handler_anchor&&);\n flush_handler_anchor(const flush_handler_anchor&) = delete;\n\n flush_handler_id release(); \/\/ disengage anchor - danger danger.\n void unregister();\n\n private:\n flush_handler_anchor(commitlog&, flush_handler_id);\n\n commitlog & _cl;\n flush_handler_id _id;\n };\n\n flush_handler_anchor add_flush_handler(flush_handler);\n void remove_flush_handler(flush_handler_id);\n\n \/**\n * Returns a vector of the segment names\n *\/\n std::vector<sstring> get_active_segment_names() const;\n\n \/**\n * Returns a vector of segment paths which were\n * preexisting when this instance of commitlog was created.\n *\n * The list will be empty when called for the second time.\n *\/\n std::vector<sstring> get_segments_to_replay();\n\n uint64_t get_total_size() const;\n uint64_t get_completed_tasks() const;\n uint64_t get_flush_count() const;\n uint64_t get_pending_tasks() const;\n uint64_t get_pending_flushes() const;\n uint64_t get_pending_allocations() const;\n uint64_t get_flush_limit_exceeded_count() const;\n uint64_t get_num_segments_created() const;\n uint64_t get_num_segments_destroyed() const;\n \/**\n * Get number of inactive (finished), segments lingering\n * due to still being dirty\n *\/\n uint64_t get_num_dirty_segments() const;\n \/**\n * Get number of active segments, i.e. still being allocated to\n *\/\n uint64_t get_num_active_segments() const;\n\n \/**\n * Returns the largest amount of data that can be written in a single \"mutation\".\n *\/\n size_t max_record_size() const;\n\n \/**\n * Return max allowed pending writes (per this shard)\n *\/\n uint64_t max_active_writes() const;\n \/**\n * Return max allowed pending flushes (per this shard)\n *\/\n uint64_t max_active_flushes() const;\n\n future<> clear();\n\n const config& active_config() const;\n\n \/**\n * Issues disk sync on all (allocating) segments. I.e. ensures that\n * all data written up until this call is indeed on disk.\n * _However_, if you issue new \"add\" ops while this is executing,\n * those can\/will be missed.\n *\/\n future<> sync_all_segments();\n \/**\n * Shuts everything down and causes any\n * incoming writes to throw exceptions\n *\/\n future<> shutdown();\n \/**\n * Ensure segments are released, even if we don't free the\n * commitlog proper. (hint, our shutdown is \"partial\")\n *\/\n future<> release();\n\n future<std::vector<descriptor>> list_existing_descriptors() const;\n future<std::vector<descriptor>> list_existing_descriptors(const sstring& dir) const;\n\n future<std::vector<sstring>> list_existing_segments() const;\n future<std::vector<sstring>> list_existing_segments(const sstring& dir) const;\n\n typedef std::function<future<>(temporary_buffer<char>, replay_position)> commit_load_reader_func;\n\n class segment_data_corruption_error: public std::runtime_error {\n public:\n segment_data_corruption_error(std::string msg, uint64_t s)\n : std::runtime_error(msg), _bytes(s) {\n }\n uint64_t bytes() const {\n return _bytes;\n }\n private:\n uint64_t _bytes;\n };\n\n static subscription<temporary_buffer<char>, replay_position> read_log_file(file, commit_load_reader_func, position_type = 0);\n static future<std::unique_ptr<subscription<temporary_buffer<char>, replay_position>>> read_log_file(\n const sstring&, commit_load_reader_func, position_type = 0);\nprivate:\n commitlog(config);\n\n struct entry_writer {\n virtual size_t size(segment&) = 0;\n \/\/ Returns segment-independent size of the entry. Must be <= than segment-dependant size.\n virtual size_t size() = 0;\n virtual void write(segment&, output&) = 0;\n virtual ~entry_writer() {};\n };\n};\n\n}\n<commit_msg>Fix compilation of tests\/commitlog_test.cc<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Modified by ScyllaDB\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include <memory>\n\n#include \"utils\/data_output.hh\"\n#include \"core\/future.hh\"\n#include \"core\/shared_ptr.hh\"\n#include \"core\/stream.hh\"\n#include \"replay_position.hh\"\n#include \"commitlog_entry.hh\"\n\nnamespace seastar { class file; }\n\n#include \"seastarx.hh\"\n\nnamespace db {\n\nclass config;\nclass rp_set;\nclass rp_handle;\n\n\/*\n * Commit Log tracks every write operation into the system. The aim of\n * the commit log is to be able to successfully recover data that was\n * not stored to disk via the Memtable.\n *\n * This impl is cassandra log format compatible (for what it is worth).\n * The behaviour is similar, but not 100% identical as \"stock cl\".\n *\n * Files are managed with \"normal\" file writes (as normal as seastar\n * gets) - no mmapping. Data is kept in internal buffers which, when\n * full, are written to disk (see below). Files are also flushed\n * periodically (or always), ensuring all data is written + writes are\n * complete.\n *\n * In BATCH mode, every write to the log will also send the data to disk\n * + issue a flush and wait for both to complete.\n *\n * In PERIODIC mode, most writes will only add to the internal memory\n * buffers. If the mem buffer is saturated, data is sent to disk, but we\n * don't wait for the write to complete. However, if periodic (timer)\n * flushing has not been done in X ms, we will write + flush to file. In\n * which case we wait for it.\n *\n * The commitlog does not guarantee any ordering between \"add\" callers\n * (due to the above). The actual order in the commitlog is however\n * identified by the replay_position returned.\n *\n * Like the stock cl, the log segments keep track of the highest dirty\n * (added) internal position for a given table id (cf_id_type \/ UUID).\n * Code should ensure to use discard_completed_segments with UUID +\n * highest rp once a memtable has been flushed. This will allow\n * discarding used segments. Failure to do so will keep stuff\n * indefinately.\n *\/\nclass commitlog {\npublic:\n using timeout_clock = lowres_clock;\n\n class segment_manager;\n class segment;\n\n friend class rp_handle;\nprivate:\n ::shared_ptr<segment_manager> _segment_manager;\npublic:\n enum class sync_mode {\n PERIODIC, BATCH\n };\n struct config {\n config() = default;\n config(const config&) = default;\n config(const db::config&);\n\n sstring commit_log_location;\n sstring metrics_category_name;\n uint64_t commitlog_total_space_in_mb = 0;\n uint64_t commitlog_segment_size_in_mb = 32;\n uint64_t commitlog_sync_period_in_ms = 10 * 1000; \/\/TODO: verify default!\n \/\/ Max number of segments to keep in pre-alloc reserve.\n \/\/ Not (yet) configurable from scylla.conf.\n uint64_t max_reserve_segments = 12;\n \/\/ Max active writes\/flushes. Default value\n \/\/ zero means try to figure it out ourselves\n uint64_t max_active_writes = 0;\n uint64_t max_active_flushes = 0;\n\n sync_mode mode = sync_mode::PERIODIC;\n std::string fname_prefix = descriptor::FILENAME_PREFIX;\n };\n\n struct descriptor {\n private:\n descriptor(std::pair<uint64_t, uint32_t> p, const std::string& fname_prefix);\n public:\n static const std::string SEPARATOR;\n static const std::string FILENAME_PREFIX;\n static const std::string FILENAME_EXTENSION;\n\n descriptor(descriptor&&) = default;\n descriptor(const descriptor&) = default;\n descriptor(segment_id_type i, const std::string& fname_prefix, uint32_t v = 1);\n descriptor(replay_position p, const std::string& fname_prefix = FILENAME_PREFIX);\n descriptor(const sstring& filename, const std::string& fname_prefix = FILENAME_PREFIX);\n\n sstring filename() const;\n operator replay_position() const;\n\n const segment_id_type id;\n const uint32_t ver;\n const std::string filename_prefix = FILENAME_PREFIX;\n };\n\n commitlog(commitlog&&) noexcept;\n ~commitlog();\n\n \/**\n * Commitlog is created via a factory func.\n * This of course because it needs to access disk to get up to speed.\n * Optionally, could have an \"init\" func and require calling this.\n *\/\n static future<commitlog> create_commitlog(config);\n\n\n \/**\n * Note: To be able to keep impl out of header file,\n * actual data writing is done via a std::function.\n * If it is proven that this has unacceptable overhead, this can be replace\n * by iter an interface or move segments and stuff into the header. But\n * I hope not.\n *\n * A serializing func is provided along with a parameter indicating the size\n * of data to be written. (See add).\n * Don't write less, absolutely don't write more...\n *\/\n using output = data_output;\n using serializer_func = std::function<void(output&)>;\n\n \/**\n * Add a \"Mutation\" to the commit log.\n *\n * Resolves with timed_out_error when timeout is reached.\n *\n * @param mutation_func a function that writes 'size' bytes to the log, representing the mutation.\n *\/\n future<rp_handle> add(const cf_id_type& id, size_t size, timeout_clock::time_point timeout, serializer_func mutation_func);\n\n \/**\n * Template version of add.\n * Resolves with timed_out_error when timeout is reached.\n * @param mu an invokable op that generates the serialized data. (Of size bytes)\n *\/\n template<typename _MutationOp>\n future<rp_handle> add_mutation(const cf_id_type& id, size_t size, timeout_clock::time_point timeout, _MutationOp&& mu) {\n return add(id, size, timeout, [mu = std::forward<_MutationOp>(mu)](output& out) {\n mu(out);\n });\n }\n\n \/**\n * Template version of add.\n * @param mu an invokable op that generates the serialized data. (Of size bytes)\n *\/\n template<typename _MutationOp>\n future<rp_handle> add_mutation(const cf_id_type& id, size_t size, _MutationOp&& mu) {\n return add_mutation(id, size, timeout_clock::time_point::max(), std::forward<_MutationOp>(mu));\n }\n\n \/**\n * Add an entry to the commit log.\n * Resolves with timed_out_error when timeout is reached.\n * @param entry_writer a writer responsible for writing the entry\n *\/\n future<rp_handle> add_entry(const cf_id_type& id, const commitlog_entry_writer& entry_writer, timeout_clock::time_point timeout);\n\n \/**\n * Modifies the per-CF dirty cursors of any commit log segments for the column family according to the position\n * given. Discards any commit log segments that are no longer used.\n *\n * @param cfId the column family ID that was flushed\n * @param rp_set the replay positions of the flush\n *\/\n void discard_completed_segments(const cf_id_type&, const rp_set&);\n\n void discard_completed_segments(const cf_id_type&);\n\n \/**\n * A 'flush_handler' is invoked when the CL determines that size on disk has\n * exceeded allowable threshold. It is called once for every currently active\n * CF id with the highest replay_position which we would prefer to free \"until\".\n * I.e. a the highest potentially freeable position in the CL.\n *\n * Whatever the callback does to help (or not) this desire is up to him.\n * This is called synchronously, so callee might want to instigate async ops\n * in the background.\n *\n *\/\n typedef std::function<void(cf_id_type, replay_position)> flush_handler;\n typedef uint64_t flush_handler_id;\n\n class flush_handler_anchor {\n public:\n friend class commitlog;\n ~flush_handler_anchor();\n flush_handler_anchor(flush_handler_anchor&&);\n flush_handler_anchor(const flush_handler_anchor&) = delete;\n\n flush_handler_id release(); \/\/ disengage anchor - danger danger.\n void unregister();\n\n private:\n flush_handler_anchor(commitlog&, flush_handler_id);\n\n commitlog & _cl;\n flush_handler_id _id;\n };\n\n flush_handler_anchor add_flush_handler(flush_handler);\n void remove_flush_handler(flush_handler_id);\n\n \/**\n * Returns a vector of the segment names\n *\/\n std::vector<sstring> get_active_segment_names() const;\n\n \/**\n * Returns a vector of segment paths which were\n * preexisting when this instance of commitlog was created.\n *\n * The list will be empty when called for the second time.\n *\/\n std::vector<sstring> get_segments_to_replay();\n\n uint64_t get_total_size() const;\n uint64_t get_completed_tasks() const;\n uint64_t get_flush_count() const;\n uint64_t get_pending_tasks() const;\n uint64_t get_pending_flushes() const;\n uint64_t get_pending_allocations() const;\n uint64_t get_flush_limit_exceeded_count() const;\n uint64_t get_num_segments_created() const;\n uint64_t get_num_segments_destroyed() const;\n \/**\n * Get number of inactive (finished), segments lingering\n * due to still being dirty\n *\/\n uint64_t get_num_dirty_segments() const;\n \/**\n * Get number of active segments, i.e. still being allocated to\n *\/\n uint64_t get_num_active_segments() const;\n\n \/**\n * Returns the largest amount of data that can be written in a single \"mutation\".\n *\/\n size_t max_record_size() const;\n\n \/**\n * Return max allowed pending writes (per this shard)\n *\/\n uint64_t max_active_writes() const;\n \/**\n * Return max allowed pending flushes (per this shard)\n *\/\n uint64_t max_active_flushes() const;\n\n future<> clear();\n\n const config& active_config() const;\n\n \/**\n * Issues disk sync on all (allocating) segments. I.e. ensures that\n * all data written up until this call is indeed on disk.\n * _However_, if you issue new \"add\" ops while this is executing,\n * those can\/will be missed.\n *\/\n future<> sync_all_segments();\n \/**\n * Shuts everything down and causes any\n * incoming writes to throw exceptions\n *\/\n future<> shutdown();\n \/**\n * Ensure segments are released, even if we don't free the\n * commitlog proper. (hint, our shutdown is \"partial\")\n *\/\n future<> release();\n\n future<std::vector<descriptor>> list_existing_descriptors() const;\n future<std::vector<descriptor>> list_existing_descriptors(const sstring& dir) const;\n\n future<std::vector<sstring>> list_existing_segments() const;\n future<std::vector<sstring>> list_existing_segments(const sstring& dir) const;\n\n typedef std::function<future<>(temporary_buffer<char>, replay_position)> commit_load_reader_func;\n\n class segment_data_corruption_error: public std::runtime_error {\n public:\n segment_data_corruption_error(std::string msg, uint64_t s)\n : std::runtime_error(msg), _bytes(s) {\n }\n uint64_t bytes() const {\n return _bytes;\n }\n private:\n uint64_t _bytes;\n };\n\n static subscription<temporary_buffer<char>, replay_position> read_log_file(file, commit_load_reader_func, position_type = 0);\n static future<std::unique_ptr<subscription<temporary_buffer<char>, replay_position>>> read_log_file(\n const sstring&, commit_load_reader_func, position_type = 0);\nprivate:\n commitlog(config);\n\n struct entry_writer {\n virtual size_t size(segment&) = 0;\n \/\/ Returns segment-independent size of the entry. Must be <= than segment-dependant size.\n virtual size_t size() = 0;\n virtual void write(segment&, output&) = 0;\n virtual ~entry_writer() {};\n };\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: PresentationViewShell.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-02-07 16:13:48 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef SD_PRESENTATION_VIEW_SHELL_HXX\n#define SD_PRESENTATION_VIEW_SHELL_HXX\n\n#ifndef SD_DRAW_VIEW_SHELL\n#include \"DrawViewShell.hxx\"\n#endif\n\nnamespace sd {\n\n\/** This view shell is responsible for showing the presentation of an\n Impress document.\n*\/\nclass PresentationViewShell\n : public DrawViewShell\n{\npublic:\n TYPEINFO();\n\n SFX_DECL_VIEWFACTORY(PresViewShell);\n SFX_DECL_INTERFACE( SD_IF_SDPRESVIEWSHELL );\n\n PresentationViewShell (\n SfxViewFrame* pFrame,\n ViewShellBase& rViewShellBase,\n ::Window* pParentWindow,\n FrameView* pFrameView = NULL);\n static void CreateFullScreenShow(ViewShell* pOriginShell, SfxRequest& rReq );\n\n \/** This method is used by a simple class that passes some\n arguments from the creator of the new view shell to the new view\n shell object by waiting for its asynchronous creation.\n @param pFrameView\n The frame view that is typically used by the creating object and\n that shall be shared by the created view shell.\n @param rRequest\n A request from which some arguments are extracted by the\n FuSlideShow object. It usually comes from an Execute() method\n that initiated the creation of the new presentation view shell.\n @param nPageNumber\n The number of the page at which to start the show.\n *\/\n void FinishInitialization (\n FrameView* pFrameView,\n SfxRequest& rRequest,\n USHORT nPageNumber);\n\nprotected:\n virtual SvxRuler* CreateHRuler(::sd::Window* pWin, BOOL bIsFirst);\n virtual SvxRuler* CreateVRuler(::sd::Window* pWin);\n\nprivate:\n Rectangle maOldVisArea;\n sal_Bool mbShowStarted;\n\n PresentationViewShell (\n SfxViewFrame* pFrame,\n ::Window* pParentWindow,\n const DrawViewShell& rShell);\n virtual ~PresentationViewShell (void);\n\n virtual void Activate (BOOL bIsMDIActivate);\n virtual void Paint (const Rectangle& rRect, ::sd::Window* pWin);\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.212); FILE MERGED 2005\/09\/05 13:22:45 rt 1.4.212.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: PresentationViewShell.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 05:12:15 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SD_PRESENTATION_VIEW_SHELL_HXX\n#define SD_PRESENTATION_VIEW_SHELL_HXX\n\n#ifndef SD_DRAW_VIEW_SHELL\n#include \"DrawViewShell.hxx\"\n#endif\n\nnamespace sd {\n\n\/** This view shell is responsible for showing the presentation of an\n Impress document.\n*\/\nclass PresentationViewShell\n : public DrawViewShell\n{\npublic:\n TYPEINFO();\n\n SFX_DECL_VIEWFACTORY(PresViewShell);\n SFX_DECL_INTERFACE( SD_IF_SDPRESVIEWSHELL );\n\n PresentationViewShell (\n SfxViewFrame* pFrame,\n ViewShellBase& rViewShellBase,\n ::Window* pParentWindow,\n FrameView* pFrameView = NULL);\n static void CreateFullScreenShow(ViewShell* pOriginShell, SfxRequest& rReq );\n\n \/** This method is used by a simple class that passes some\n arguments from the creator of the new view shell to the new view\n shell object by waiting for its asynchronous creation.\n @param pFrameView\n The frame view that is typically used by the creating object and\n that shall be shared by the created view shell.\n @param rRequest\n A request from which some arguments are extracted by the\n FuSlideShow object. It usually comes from an Execute() method\n that initiated the creation of the new presentation view shell.\n @param nPageNumber\n The number of the page at which to start the show.\n *\/\n void FinishInitialization (\n FrameView* pFrameView,\n SfxRequest& rRequest,\n USHORT nPageNumber);\n\nprotected:\n virtual SvxRuler* CreateHRuler(::sd::Window* pWin, BOOL bIsFirst);\n virtual SvxRuler* CreateVRuler(::sd::Window* pWin);\n\nprivate:\n Rectangle maOldVisArea;\n sal_Bool mbShowStarted;\n\n PresentationViewShell (\n SfxViewFrame* pFrame,\n ::Window* pParentWindow,\n const DrawViewShell& rShell);\n virtual ~PresentationViewShell (void);\n\n virtual void Activate (BOOL bIsMDIActivate);\n virtual void Paint (const Rectangle& rRect, ::sd::Window* pWin);\n};\n\n} \/\/ end of namespace sd\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cstdio>\n#include <vector>\n#include <array>\n#include <map>\n#include <unordered_map>\n#include <memory>\n#include <string>\n#include <stdlib.h>\n#include <complex>\n#include <thread>\n#if !defined(_WIN32)\n#include <unistd.h>\n#include <dlfcn.h>\n#else\n#include <windows.h>\nvoid sleep(unsigned secs) { Sleep(secs * 1000); }\n#endif\n\n#include \"dir1\/debuggee.h\"\n#include \"dir2\/debuggee.h\"\n\nextern \"C\" void disassembly1();\n\nextern \"C\" void sharedlib_entry();\n\nvoid deepstack(int levelsToGo)\n{\n if (levelsToGo > 0)\n {\n deepstack(levelsToGo - 1);\n }\n} \/\/ #BP2\n\nvoid inf_loop()\n{\n long long i = 0;\n for (;;)\n {\n printf(\"\\r%lld \", i);\n fflush(stdout);\n sleep(1);\n i += 1;\n }\n}\n\nvoid threads(int num_threads)\n{\n#if !defined(__MINGW32__) || defined(_GLIBCXX_HAS_GTHREADS)\n std::vector<int> alive(num_threads);\n std::vector<std::thread> threads;\n for (int i = 0; i < num_threads; ++i)\n {\n int *am_alive = &alive[i];\n std::thread thread([am_alive](int id) {\n *am_alive = 1;\n printf(\"I'm thread %d\\n\", id);\n sleep(id % 4 + 1);\n printf(\"Thread %d exiting\\n\", id);\n *am_alive = 0;\n },\n i);\n threads.push_back(std::move(thread));\n }\n sleep(1);\n for (int i = 0; i < num_threads; ++i)\n {\n printf(\"Joining %d\\n\", i);\n threads[i].join();\n }\n#else\n sleep(1);\n#endif\n}\n\nbool check_env(const char *env_name, const char *expected)\n{\n const char *val = getenv(env_name);\n printf(\"%s=%s\\n\", env_name, val);\n return val && std::string(val) == std::string(expected);\n}\n\nvoid echo()\n{\n char buffer[1024];\n do\n {\n fgets(buffer, sizeof(buffer), stdin);\n fputs(buffer, stdout);\n } while (buffer[0] != '\\n'); \/\/ till empty line is read\n}\n\nclass Klazz\n{\n static int m1;\n};\nint Klazz::m1 = 42;\n\nvoid vars()\n{\n struct Struct\n {\n int a;\n char b;\n float c;\n int d[4];\n };\n\n struct DeepStruct\n {\n int a;\n const char *b;\n float c;\n Struct d;\n Struct e[5];\n };\n\n int a = 10;\n int b = 20;\n for (int i = 0; i < 10; i++)\n {\n int a = 30;\n int b = 40;\n float pi = 3.14159265;\n static int sss = 555;\n const char c[] = \"foobar\";\n char buffer[10240] = {0};\n int array_int[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};\n std::vector<std::vector<int>> vec_int(10, {i * 1, i * 2, i * 3, i * 4, i * 5});\n std::vector<std::vector<int>> empty_vec;\n Struct s1 = {i + 1, 'a', 3.0f, {i, i, i, i}};\n Struct s2 = {i + 10, 'b', 999.0f, {i * 10, i * 10, i * 10, i * 10}};\n Struct *s_ptr = &s1;\n Struct *null_s_ptr = nullptr;\n Struct *invalid_s_ptr = (Struct *)1;\n DeepStruct ds1 = {13, \"foo\", 3.14, \/\/\n {i, 'd', 4.0f, {1, 2, 3, i}}, \/\/\n {{i * 2, 's', 5.0f, {4, 5, 6, i}}, \/\/\n {i * 3, 'x', 5.5f, {3, 5, 1, i}}}};\n std::vector<Struct> vec_struct(3, {i * 2, 'b', 4.0f});\n std::array<int, 5> stdarr_int;\n std::map<int, float> ord_map = {{1, 2.34}, {2, 3.56}};\n std::unordered_map<int, float> unord_map = {{1, 2.34}, {2, 3.56}};\n auto shared_ptr = std::make_shared<std::map<int, float>>(ord_map);\n Struct array_struct[5] = {{i * 2, 'b', 4.0f}};\n std::string str1 = \"The quick brown fox\";\n char invalid_utf8[] = \"ABC\\xFF\\x01\\xFEXYZ\";\n std::string empty_str;\n std::string *str_ptr = &str1;\n std::string &str_ref = str1;\n wchar_t wstr1[] = L\"Превед йожэг!\";\n std::wstring wstr2 = L\"Ḥ̪͔̦̺E͍̹̯̭͜ C̨͙̹̖̙O̡͍̪͖ͅM̢̗͙̫̬E̜͍̟̟̮S̢̢̪̘̦!\";\n int zzz = i; \/\/ #BP3\n }\n}\n\nvoid mandelbrot()\n{\n const int xdim = 500;\n const int ydim = 500;\n const int max_iter = 100;\n int image[xdim * ydim] = {0};\n for (int y = 0; y < ydim; ++y)\n {\n \/\/ \/py debugvis.plot_image($image, $xdim, $ydim) if $y % 50 == 0 else False\n for (int x = 0; x < xdim; ++x)\n {\n std::complex<float> xy(-2.05 + x * 3.0 \/ xdim, -1.5 + y * 3.0 \/ ydim);\n std::complex<float> z(0, 0);\n int count = max_iter;\n for (int i = 0; i < max_iter; ++i)\n {\n z = z * z + xy;\n if (std::abs(z) >= 2)\n {\n count = i;\n break;\n }\n }\n image[y * xdim + x] = count;\n }\n }\n for (int y = 0; y < ydim; y += 10)\n {\n for (int x = 0; x < xdim; x += 5)\n {\n putchar(image[y * xdim + x] < max_iter ? '.' : '#');\n }\n putchar('\\n');\n }\n}\n\nint main(int argc, char *argv[])\n{\n std::vector<std::string> args;\n for (int i = 0; i < argc; ++i)\n args.push_back(argv[i]);\n\n if (args.size() < 2) \/\/ #BP1\n {\n return -1;\n }\n\n std::string testcase = args[1];\n if (testcase == \"crash\")\n {\n *(volatile int *)0 = 42;\n }\n else if (testcase == \"throw\")\n {\n throw std::runtime_error(\"error\");\n }\n else if (testcase == \"deepstack\")\n {\n deepstack(50);\n }\n else if (testcase == \"threads\")\n {\n threads(15);\n }\n else if (testcase == \"check_env\")\n {\n if (argc < 4)\n {\n return -1;\n }\n return (int)check_env(argv[2], argv[3]);\n }\n else if (testcase == \"inf_loop\")\n {\n inf_loop();\n }\n else if (testcase == \"echo\")\n {\n echo();\n }\n else if (testcase == \"vars\")\n {\n vars();\n }\n else if (testcase == \"header\")\n {\n header_fn1(1);\n header_fn2(2);\n#if !defined(_WIN32)\n void *hlib = dlopen(\"libdebuggee.so\", RTLD_NOW);\n auto sharedlib_entry = reinterpret_cast<void (*)()>(dlsym(hlib, \"sharedlib_entry\"));\n#else\n HMODULE hlib = LoadLibrary(\"libdebuggee.dll\");\n auto sharedlib_entry = reinterpret_cast<void (*)()>(GetProcAddress(hlib, \"sharedlib_entry\"));\n#endif\n sharedlib_entry();\n }\n else if (testcase == \"mandelbrot\")\n {\n mandelbrot();\n }\n else if (testcase == \"dasm\")\n {\n disassembly1();\n }\n return 0;\n}\n<commit_msg>Fix dlopen on travis.<commit_after>#include <cstdlib>\n#include <cstdio>\n#include <vector>\n#include <array>\n#include <map>\n#include <unordered_map>\n#include <memory>\n#include <string>\n#include <stdlib.h>\n#include <complex>\n#include <thread>\n#if !defined(_WIN32)\n#include <unistd.h>\n#include <dlfcn.h>\n#else\n#include <windows.h>\nvoid sleep(unsigned secs) { Sleep(secs * 1000); }\n#endif\n\n#include \"dir1\/debuggee.h\"\n#include \"dir2\/debuggee.h\"\n\nextern \"C\" void disassembly1();\n\nextern \"C\" void sharedlib_entry();\n\nvoid deepstack(int levelsToGo)\n{\n if (levelsToGo > 0)\n {\n deepstack(levelsToGo - 1);\n }\n} \/\/ #BP2\n\nvoid inf_loop()\n{\n long long i = 0;\n for (;;)\n {\n printf(\"\\r%lld \", i);\n fflush(stdout);\n sleep(1);\n i += 1;\n }\n}\n\nvoid threads(int num_threads)\n{\n#if !defined(__MINGW32__) || defined(_GLIBCXX_HAS_GTHREADS)\n std::vector<int> alive(num_threads);\n std::vector<std::thread> threads;\n for (int i = 0; i < num_threads; ++i)\n {\n int *am_alive = &alive[i];\n std::thread thread([am_alive](int id) {\n *am_alive = 1;\n printf(\"I'm thread %d\\n\", id);\n sleep(id % 4 + 1);\n printf(\"Thread %d exiting\\n\", id);\n *am_alive = 0;\n },\n i);\n threads.push_back(std::move(thread));\n }\n sleep(1);\n for (int i = 0; i < num_threads; ++i)\n {\n printf(\"Joining %d\\n\", i);\n threads[i].join();\n }\n#else\n sleep(1);\n#endif\n}\n\nbool check_env(const char *env_name, const char *expected)\n{\n const char *val = getenv(env_name);\n printf(\"%s=%s\\n\", env_name, val);\n return val && std::string(val) == std::string(expected);\n}\n\nvoid echo()\n{\n char buffer[1024];\n do\n {\n fgets(buffer, sizeof(buffer), stdin);\n fputs(buffer, stdout);\n } while (buffer[0] != '\\n'); \/\/ till empty line is read\n}\n\nclass Klazz\n{\n static int m1;\n};\nint Klazz::m1 = 42;\n\nvoid vars()\n{\n struct Struct\n {\n int a;\n char b;\n float c;\n int d[4];\n };\n\n struct DeepStruct\n {\n int a;\n const char *b;\n float c;\n Struct d;\n Struct e[5];\n };\n\n int a = 10;\n int b = 20;\n for (int i = 0; i < 10; i++)\n {\n int a = 30;\n int b = 40;\n float pi = 3.14159265;\n static int sss = 555;\n const char c[] = \"foobar\";\n char buffer[10240] = {0};\n int array_int[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};\n std::vector<std::vector<int>> vec_int(10, {i * 1, i * 2, i * 3, i * 4, i * 5});\n std::vector<std::vector<int>> empty_vec;\n Struct s1 = {i + 1, 'a', 3.0f, {i, i, i, i}};\n Struct s2 = {i + 10, 'b', 999.0f, {i * 10, i * 10, i * 10, i * 10}};\n Struct *s_ptr = &s1;\n Struct *null_s_ptr = nullptr;\n Struct *invalid_s_ptr = (Struct *)1;\n DeepStruct ds1 = {13, \"foo\", 3.14, \/\/\n {i, 'd', 4.0f, {1, 2, 3, i}}, \/\/\n {{i * 2, 's', 5.0f, {4, 5, 6, i}}, \/\/\n {i * 3, 'x', 5.5f, {3, 5, 1, i}}}};\n std::vector<Struct> vec_struct(3, {i * 2, 'b', 4.0f});\n std::array<int, 5> stdarr_int;\n std::map<int, float> ord_map = {{1, 2.34}, {2, 3.56}};\n std::unordered_map<int, float> unord_map = {{1, 2.34}, {2, 3.56}};\n auto shared_ptr = std::make_shared<std::map<int, float>>(ord_map);\n Struct array_struct[5] = {{i * 2, 'b', 4.0f}};\n std::string str1 = \"The quick brown fox\";\n char invalid_utf8[] = \"ABC\\xFF\\x01\\xFEXYZ\";\n std::string empty_str;\n std::string *str_ptr = &str1;\n std::string &str_ref = str1;\n wchar_t wstr1[] = L\"Превед йожэг!\";\n std::wstring wstr2 = L\"Ḥ̪͔̦̺E͍̹̯̭͜ C̨͙̹̖̙O̡͍̪͖ͅM̢̗͙̫̬E̜͍̟̟̮S̢̢̪̘̦!\";\n int zzz = i; \/\/ #BP3\n }\n}\n\nvoid mandelbrot()\n{\n const int xdim = 500;\n const int ydim = 500;\n const int max_iter = 100;\n int image[xdim * ydim] = {0};\n for (int y = 0; y < ydim; ++y)\n {\n \/\/ \/py debugvis.plot_image($image, $xdim, $ydim) if $y % 50 == 0 else False\n for (int x = 0; x < xdim; ++x)\n {\n std::complex<float> xy(-2.05 + x * 3.0 \/ xdim, -1.5 + y * 3.0 \/ ydim);\n std::complex<float> z(0, 0);\n int count = max_iter;\n for (int i = 0; i < max_iter; ++i)\n {\n z = z * z + xy;\n if (std::abs(z) >= 2)\n {\n count = i;\n break;\n }\n }\n image[y * xdim + x] = count;\n }\n }\n for (int y = 0; y < ydim; y += 10)\n {\n for (int x = 0; x < xdim; x += 5)\n {\n putchar(image[y * xdim + x] < max_iter ? '.' : '#');\n }\n putchar('\\n');\n }\n}\n\nint main(int argc, char *argv[])\n{\n std::vector<std::string> args;\n for (int i = 0; i < argc; ++i)\n args.push_back(argv[i]);\n\n if (args.size() < 2) \/\/ #BP1\n {\n return -1;\n }\n\n std::string testcase = args[1];\n if (testcase == \"crash\")\n {\n *(volatile int *)0 = 42;\n }\n else if (testcase == \"throw\")\n {\n throw std::runtime_error(\"error\");\n }\n else if (testcase == \"deepstack\")\n {\n deepstack(50);\n }\n else if (testcase == \"threads\")\n {\n threads(15);\n }\n else if (testcase == \"check_env\")\n {\n if (argc < 4)\n {\n return -1;\n }\n return (int)check_env(argv[2], argv[3]);\n }\n else if (testcase == \"inf_loop\")\n {\n inf_loop();\n }\n else if (testcase == \"echo\")\n {\n echo();\n }\n else if (testcase == \"vars\")\n {\n vars();\n }\n else if (testcase == \"header\")\n {\n header_fn1(1);\n header_fn2(2);\n#if !defined(_WIN32)\n void *hlib = dlopen(\".\/libdebuggee.so\", RTLD_NOW);\n auto sharedlib_entry = reinterpret_cast<void (*)()>(dlsym(hlib, \"sharedlib_entry\"));\n#else\n HMODULE hlib = LoadLibrary(\"libdebuggee.dll\");\n auto sharedlib_entry = reinterpret_cast<void (*)()>(GetProcAddress(hlib, \"sharedlib_entry\"));\n#endif\n sharedlib_entry();\n }\n else if (testcase == \"mandelbrot\")\n {\n mandelbrot();\n }\n else if (testcase == \"dasm\")\n {\n disassembly1();\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2018, John Haddon. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided with\n\/\/ the distribution.\n\/\/\n\/\/ * Neither the name of John Haddon nor the names of\n\/\/ any other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"GafferScene\/Wireframe.h\"\n\n#include \"Gaffer\/StringPlug.h\"\n\n#include \"IECoreScene\/MeshPrimitive.h\"\n#include \"IECoreScene\/CurvesPrimitive.h\"\n\n#include \"IECore\/DataAlgo.h\"\n\n#include \"boost\/functional\/hash.hpp\"\n\n#include <unordered_set>\n\nusing namespace std;\nusing namespace Imath;\nusing namespace IECore;\nusing namespace IECoreScene;\nusing namespace Gaffer;\nusing namespace GafferScene;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Internal utilities\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n\nstruct MakeWireframe\n{\n\n\tCurvesPrimitivePtr operator() ( const V2fVectorData *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\treturn makeWireframe<V2fVectorData>( data, mesh, name, primitiveVariable );\n\t}\n\n\tCurvesPrimitivePtr operator() ( const V3fVectorData *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\treturn makeWireframe<V3fVectorData>( data, mesh, name, primitiveVariable );\n\t}\n\n\tCurvesPrimitivePtr operator() ( const Data *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\tthrow IECore::Exception( boost::str(\n\t\t\tboost::format( \"PrimitiveVariable \\\"%1%\\\" has unsupported type \\\"%2%\\\"\" ) % name % data->typeName()\n\t\t) );\n\t}\n\n\tprivate :\n\n\t\ttemplate<typename T>\n\t\tCurvesPrimitivePtr makeWireframe( const T *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t\t{\n\t\t\tusing Vec = typename T::ValueType::value_type;\n\t\t\tusing DataView = PrimitiveVariable::IndexedView<Vec>;\n\n\t\t\tDataView dataView;\n\t\t\tconst vector<int> *vertexIds = nullptr;\n\t\t\tswitch( primitiveVariable.interpolation )\n\t\t\t{\n\t\t\t\tcase PrimitiveVariable::Vertex :\n\t\t\t\tcase PrimitiveVariable::Varying :\n\t\t\t\t\tvertexIds = &mesh->vertexIds()->readable();\n\t\t\t\t\tdataView = DataView( primitiveVariable );\n\t\t\t\t\tbreak;\n\t\t\t\tcase PrimitiveVariable::FaceVarying :\n\t\t\t\t\tvertexIds = primitiveVariable.indices ? &primitiveVariable.indices->readable() : nullptr;\n\t\t\t\t\tdataView = DataView( data->readable(), nullptr );\n\t\t\t\t\tbreak;\n\t\t\t\tdefault :\n\t\t\t\t\tthrow IECore::Exception( boost::str(\n\t\t\t\t\t\tboost::format( \"Primitive variable \\\"%1%\\\" must have Vertex, Varying or FaceVarying interpolation\" ) % name\n\t\t\t\t\t) );\n\t\t\t}\n\n\t\t\tIECore::V3fVectorDataPtr pData = new V3fVectorData;\n\t\t\tpData->setInterpretation( GeometricData::Point );\n\t\t\tvector<V3f> &p = pData->writable();\n\n\t\t\tusing Edge = std::pair<int, int>;\n\t\t\tusing EdgeSet = unordered_set<Edge, boost::hash<Edge>>;\n\t\t\tEdgeSet edgesVisited;\n\n\t\t\tint vertexIdsIndex = 0;\n\t\t\tfor( int numVertices : mesh->verticesPerFace()->readable() )\n\t\t\t{\n\t\t\t\tfor( int i = 0; i < numVertices; ++i )\n\t\t\t\t{\n\t\t\t\t\tint index0 = vertexIdsIndex + i;\n\t\t\t\t\tint index1 = vertexIdsIndex + (i + 1) % numVertices;\n\t\t\t\t\tif( vertexIds )\n\t\t\t\t\t{\n\t\t\t\t\t\tindex0 = (*vertexIds)[index0];\n\t\t\t\t\t\tindex1 = (*vertexIds)[index1];\n\t\t\t\t\t}\n\n\t\t\t\t\tEdge edge( min( index0, index1 ), max( index0, index1 ) );\n\t\t\t\t\tif( edgesVisited.insert( edge ).second )\n\t\t\t\t\t{\n\t\t\t\t\t\tp.push_back( v3f( dataView[index0] ) );\n\t\t\t\t\t\tp.push_back( v3f( dataView[index1] ) );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvertexIdsIndex += numVertices;\n\t\t\t}\n\n\t\t\tIECore::IntVectorDataPtr vertsPerCurveData = new IntVectorData;\n\t\t\tvertsPerCurveData->writable().resize( p.size() \/ 2, 2 );\n\n\t\t\tCurvesPrimitivePtr result = new CurvesPrimitive( vertsPerCurveData );\n\t\t\tresult->variables[\"P\"] = PrimitiveVariable( PrimitiveVariable::Vertex, pData );\n\t\t\treturn result;\n\t\t}\n\n\t\tV3f v3f( const Imath::V3f &v )\n\t\t{\n\t\t\treturn v;\n\t\t}\n\n\t\tV3f v3f( const Imath::V2f &v )\n\t\t{\n\t\t\treturn V3f( v.x, v.y, 0.0f );\n\t\t}\n\n};\n\n\/\/\/ \\todo Perhaps this could go in IECoreScene::MeshAlgo\nCurvesPrimitivePtr wireframe( const MeshPrimitive *mesh, const std::string &position )\n{\n\tauto it = mesh->variables.find( position );\n\tif( it == mesh->variables.end() )\n\t{\n\t\tthrow IECore::Exception( boost::str(\n\t\t\tboost::format( \"MeshPrimitive has no primitive variable named \\\"%1%\\\"\" ) % position\n\t\t) );\n\t}\n\n\tCurvesPrimitivePtr result = dispatch( it->second.data.get(), MakeWireframe(), mesh, it->first, it->second );\n\treturn result;\n}\n\n} \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Wireframe\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nIE_CORE_DEFINERUNTIMETYPED( Wireframe );\n\nsize_t Wireframe::g_firstPlugIndex = 0;\n\nWireframe::Wireframe( const std::string &name )\n\t:\tSceneElementProcessor( name, PathMatcher::NoMatch )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild( new StringPlug( \"position\", Plug::In, \"P\" ) );\n\taddChild( new FloatPlug( \"width\", Plug::In, 1.0f, 0.0f ) );\n\n\t\/\/ Fast pass-throughs for things we don't modify\n\toutPlug()->attributesPlug()->setInput( inPlug()->attributesPlug() );\n\toutPlug()->transformPlug()->setInput( inPlug()->transformPlug() );\n}\n\nWireframe::~Wireframe()\n{\n}\n\nGaffer::StringPlug *Wireframe::positionPlug()\n{\n\treturn getChild<StringPlug>( g_firstPlugIndex );\n}\n\nconst Gaffer::StringPlug *Wireframe::positionPlug() const\n{\n\treturn getChild<StringPlug>( g_firstPlugIndex );\n}\n\nGaffer::FloatPlug *Wireframe::widthPlug()\n{\n\treturn getChild<FloatPlug>( g_firstPlugIndex + 1 );\n}\n\nconst Gaffer::FloatPlug *Wireframe::widthPlug() const\n{\n\treturn getChild<FloatPlug>( g_firstPlugIndex + 1 );\n}\n\nvoid Wireframe::affects( const Gaffer::Plug *input, AffectedPlugsContainer &outputs ) const\n{\n\tSceneElementProcessor::affects( input, outputs );\n\n\tif(\n\t\tinput == positionPlug() ||\n\t\tinput == widthPlug()\n\t)\n\t{\n\t\toutputs.push_back( outPlug()->objectPlug() );\n\t}\n}\n\nbool Wireframe::processesBound() const\n{\n\treturn true;\n}\n\nvoid Wireframe::hashProcessedBound( const ScenePath &path, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\toutPlug()->objectPlug()->hash( h );\n}\n\nImath::Box3f Wireframe::computeProcessedBound( const ScenePath &path, const Gaffer::Context *context, const Imath::Box3f &inputBound ) const\n{\n\tConstObjectPtr object = outPlug()->objectPlug()->getValue();\n\tif( const CurvesPrimitive *wireframe = runTimeCast<const CurvesPrimitive>( object.get() ) )\n\t{\n\t\treturn wireframe->bound();\n\t}\n\treturn inputBound;\n}\n\nbool Wireframe::processesObject() const\n{\n\treturn true;\n}\n\nvoid Wireframe::hashProcessedObject( const ScenePath &path, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\tpositionPlug()->hash( h );\n\twidthPlug()->hash( h );\n}\n\nIECore::ConstObjectPtr Wireframe::computeProcessedObject( const ScenePath &path, const Gaffer::Context *context, IECore::ConstObjectPtr inputObject ) const\n{\n\tconst MeshPrimitive *mesh = runTimeCast<const MeshPrimitive>( inputObject.get() );\n\tif( !mesh )\n\t{\n\t\treturn inputObject;\n\t}\n\n\tCurvesPrimitivePtr result = wireframe( mesh, positionPlug()->getValue() );\n\tfor( const auto &pv : mesh->variables )\n\t{\n\t\tif( pv.second.interpolation == PrimitiveVariable::Constant )\n\t\t{\n\t\t\t\/\/ OK to reference data directly, because result becomes const upon return.\n\t\t\tresult->variables.insert( pv );\n\t\t}\n\t}\n\tresult->variables[\"width\"] = PrimitiveVariable( PrimitiveVariable::Constant, new FloatData( widthPlug()->getValue() ) );\n\n\treturn result;\n}\n<commit_msg>Wireframe : Reserve space for `edgesVisited`<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2018, John Haddon. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided with\n\/\/ the distribution.\n\/\/\n\/\/ * Neither the name of John Haddon nor the names of\n\/\/ any other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"GafferScene\/Wireframe.h\"\n\n#include \"Gaffer\/StringPlug.h\"\n\n#include \"IECoreScene\/MeshPrimitive.h\"\n#include \"IECoreScene\/CurvesPrimitive.h\"\n\n#include \"IECore\/DataAlgo.h\"\n\n#include \"boost\/functional\/hash.hpp\"\n\n#include <unordered_set>\n\nusing namespace std;\nusing namespace Imath;\nusing namespace IECore;\nusing namespace IECoreScene;\nusing namespace Gaffer;\nusing namespace GafferScene;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Internal utilities\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n\nstruct MakeWireframe\n{\n\n\tCurvesPrimitivePtr operator() ( const V2fVectorData *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\treturn makeWireframe<V2fVectorData>( data, mesh, name, primitiveVariable );\n\t}\n\n\tCurvesPrimitivePtr operator() ( const V3fVectorData *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\treturn makeWireframe<V3fVectorData>( data, mesh, name, primitiveVariable );\n\t}\n\n\tCurvesPrimitivePtr operator() ( const Data *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t{\n\t\tthrow IECore::Exception( boost::str(\n\t\t\tboost::format( \"PrimitiveVariable \\\"%1%\\\" has unsupported type \\\"%2%\\\"\" ) % name % data->typeName()\n\t\t) );\n\t}\n\n\tprivate :\n\n\t\ttemplate<typename T>\n\t\tCurvesPrimitivePtr makeWireframe( const T *data, const MeshPrimitive *mesh, const string &name, const PrimitiveVariable &primitiveVariable )\n\t\t{\n\t\t\tusing Vec = typename T::ValueType::value_type;\n\t\t\tusing DataView = PrimitiveVariable::IndexedView<Vec>;\n\n\t\t\tDataView dataView;\n\t\t\tconst vector<int> *vertexIds = nullptr;\n\t\t\tswitch( primitiveVariable.interpolation )\n\t\t\t{\n\t\t\t\tcase PrimitiveVariable::Vertex :\n\t\t\t\tcase PrimitiveVariable::Varying :\n\t\t\t\t\tvertexIds = &mesh->vertexIds()->readable();\n\t\t\t\t\tdataView = DataView( primitiveVariable );\n\t\t\t\t\tbreak;\n\t\t\t\tcase PrimitiveVariable::FaceVarying :\n\t\t\t\t\tvertexIds = primitiveVariable.indices ? &primitiveVariable.indices->readable() : nullptr;\n\t\t\t\t\tdataView = DataView( data->readable(), nullptr );\n\t\t\t\t\tbreak;\n\t\t\t\tdefault :\n\t\t\t\t\tthrow IECore::Exception( boost::str(\n\t\t\t\t\t\tboost::format( \"Primitive variable \\\"%1%\\\" must have Vertex, Varying or FaceVarying interpolation\" ) % name\n\t\t\t\t\t) );\n\t\t\t}\n\n\t\t\tIECore::V3fVectorDataPtr pData = new V3fVectorData;\n\t\t\tpData->setInterpretation( GeometricData::Point );\n\t\t\tvector<V3f> &p = pData->writable();\n\n\t\t\tusing Edge = std::pair<int, int>;\n\t\t\tusing EdgeSet = unordered_set<Edge, boost::hash<Edge>>;\n\t\t\tEdgeSet edgesVisited;\n\t\t\tedgesVisited.reserve( mesh->variableSize( PrimitiveVariable::FaceVarying ) );\n\n\t\t\tint vertexIdsIndex = 0;\n\t\t\tfor( int numVertices : mesh->verticesPerFace()->readable() )\n\t\t\t{\n\t\t\t\tfor( int i = 0; i < numVertices; ++i )\n\t\t\t\t{\n\t\t\t\t\tint index0 = vertexIdsIndex + i;\n\t\t\t\t\tint index1 = vertexIdsIndex + (i + 1) % numVertices;\n\t\t\t\t\tif( vertexIds )\n\t\t\t\t\t{\n\t\t\t\t\t\tindex0 = (*vertexIds)[index0];\n\t\t\t\t\t\tindex1 = (*vertexIds)[index1];\n\t\t\t\t\t}\n\n\t\t\t\t\tEdge edge( min( index0, index1 ), max( index0, index1 ) );\n\t\t\t\t\tif( edgesVisited.insert( edge ).second )\n\t\t\t\t\t{\n\t\t\t\t\t\tp.push_back( v3f( dataView[index0] ) );\n\t\t\t\t\t\tp.push_back( v3f( dataView[index1] ) );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvertexIdsIndex += numVertices;\n\t\t\t}\n\n\t\t\tIECore::IntVectorDataPtr vertsPerCurveData = new IntVectorData;\n\t\t\tvertsPerCurveData->writable().resize( p.size() \/ 2, 2 );\n\n\t\t\tCurvesPrimitivePtr result = new CurvesPrimitive( vertsPerCurveData );\n\t\t\tresult->variables[\"P\"] = PrimitiveVariable( PrimitiveVariable::Vertex, pData );\n\t\t\treturn result;\n\t\t}\n\n\t\tV3f v3f( const Imath::V3f &v )\n\t\t{\n\t\t\treturn v;\n\t\t}\n\n\t\tV3f v3f( const Imath::V2f &v )\n\t\t{\n\t\t\treturn V3f( v.x, v.y, 0.0f );\n\t\t}\n\n};\n\n\/\/\/ \\todo Perhaps this could go in IECoreScene::MeshAlgo\nCurvesPrimitivePtr wireframe( const MeshPrimitive *mesh, const std::string &position )\n{\n\tauto it = mesh->variables.find( position );\n\tif( it == mesh->variables.end() )\n\t{\n\t\tthrow IECore::Exception( boost::str(\n\t\t\tboost::format( \"MeshPrimitive has no primitive variable named \\\"%1%\\\"\" ) % position\n\t\t) );\n\t}\n\n\tCurvesPrimitivePtr result = dispatch( it->second.data.get(), MakeWireframe(), mesh, it->first, it->second );\n\treturn result;\n}\n\n} \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Wireframe\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nIE_CORE_DEFINERUNTIMETYPED( Wireframe );\n\nsize_t Wireframe::g_firstPlugIndex = 0;\n\nWireframe::Wireframe( const std::string &name )\n\t:\tSceneElementProcessor( name, PathMatcher::NoMatch )\n{\n\tstoreIndexOfNextChild( g_firstPlugIndex );\n\taddChild( new StringPlug( \"position\", Plug::In, \"P\" ) );\n\taddChild( new FloatPlug( \"width\", Plug::In, 1.0f, 0.0f ) );\n\n\t\/\/ Fast pass-throughs for things we don't modify\n\toutPlug()->attributesPlug()->setInput( inPlug()->attributesPlug() );\n\toutPlug()->transformPlug()->setInput( inPlug()->transformPlug() );\n}\n\nWireframe::~Wireframe()\n{\n}\n\nGaffer::StringPlug *Wireframe::positionPlug()\n{\n\treturn getChild<StringPlug>( g_firstPlugIndex );\n}\n\nconst Gaffer::StringPlug *Wireframe::positionPlug() const\n{\n\treturn getChild<StringPlug>( g_firstPlugIndex );\n}\n\nGaffer::FloatPlug *Wireframe::widthPlug()\n{\n\treturn getChild<FloatPlug>( g_firstPlugIndex + 1 );\n}\n\nconst Gaffer::FloatPlug *Wireframe::widthPlug() const\n{\n\treturn getChild<FloatPlug>( g_firstPlugIndex + 1 );\n}\n\nvoid Wireframe::affects( const Gaffer::Plug *input, AffectedPlugsContainer &outputs ) const\n{\n\tSceneElementProcessor::affects( input, outputs );\n\n\tif(\n\t\tinput == positionPlug() ||\n\t\tinput == widthPlug()\n\t)\n\t{\n\t\toutputs.push_back( outPlug()->objectPlug() );\n\t}\n}\n\nbool Wireframe::processesBound() const\n{\n\treturn true;\n}\n\nvoid Wireframe::hashProcessedBound( const ScenePath &path, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\toutPlug()->objectPlug()->hash( h );\n}\n\nImath::Box3f Wireframe::computeProcessedBound( const ScenePath &path, const Gaffer::Context *context, const Imath::Box3f &inputBound ) const\n{\n\tConstObjectPtr object = outPlug()->objectPlug()->getValue();\n\tif( const CurvesPrimitive *wireframe = runTimeCast<const CurvesPrimitive>( object.get() ) )\n\t{\n\t\treturn wireframe->bound();\n\t}\n\treturn inputBound;\n}\n\nbool Wireframe::processesObject() const\n{\n\treturn true;\n}\n\nvoid Wireframe::hashProcessedObject( const ScenePath &path, const Gaffer::Context *context, IECore::MurmurHash &h ) const\n{\n\tpositionPlug()->hash( h );\n\twidthPlug()->hash( h );\n}\n\nIECore::ConstObjectPtr Wireframe::computeProcessedObject( const ScenePath &path, const Gaffer::Context *context, IECore::ConstObjectPtr inputObject ) const\n{\n\tconst MeshPrimitive *mesh = runTimeCast<const MeshPrimitive>( inputObject.get() );\n\tif( !mesh )\n\t{\n\t\treturn inputObject;\n\t}\n\n\tCurvesPrimitivePtr result = wireframe( mesh, positionPlug()->getValue() );\n\tfor( const auto &pv : mesh->variables )\n\t{\n\t\tif( pv.second.interpolation == PrimitiveVariable::Constant )\n\t\t{\n\t\t\t\/\/ OK to reference data directly, because result becomes const upon return.\n\t\t\tresult->variables.insert( pv );\n\t\t}\n\t}\n\tresult->variables[\"width\"] = PrimitiveVariable( PrimitiveVariable::Constant, new FloatData( widthPlug()->getValue() ) );\n\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Genes\/Look_Ahead_Gene.h\"\n\n#include <cmath>\n#include <cassert>\n\n#include \"Genes\/Gene.h\"\n#include \"Utility.h\"\n#include \"Game\/Board.h\"\n#include \"Game\/Clock.h\"\n#include \"Moves\/Complete_Move.h\"\n\n\nLook_Ahead_Gene::Look_Ahead_Gene() :\n mean_game_length(50),\n game_length_uncertainty(0.5),\n speculation_constant(0.0)\n{\n recalculate_exponent();\n}\n\nvoid Look_Ahead_Gene::reset_properties() const\n{\n properties[\"Mean Game Length\"] = mean_game_length;\n properties[\"Game Length Uncertainty\"] = game_length_uncertainty;\n properties[\"Speculation Constant\"] = speculation_constant;\n}\n\nvoid Look_Ahead_Gene::load_properties()\n{\n mean_game_length = properties[\"Mean Game Length\"];\n game_length_uncertainty = properties[\"Game Length Uncertainty\"];\n speculation_constant = properties[\"Speculation Constant\"];\n recalculate_exponent();\n}\n\ndouble Look_Ahead_Gene::time_to_examine(const Board& board, const Clock& clock) const\n{\n if( ! is_active())\n {\n return 0.0;\n }\n\n auto time_left = clock.time_left(board.whose_turn());\n auto moves_to_reset = clock.moves_to_reset(board.whose_turn());\n\n auto moves_so_far = board.get_game_record().size()\/2; \/\/ only count moves by this player\n auto moves_left = Math::average_moves_left(mean_game_length, game_length_uncertainty, moves_so_far);\n\n return time_left\/std::min(moves_left, double(moves_to_reset));\n}\n\nvoid Look_Ahead_Gene::gene_specific_mutation()\n{\n switch(Random::random_integer(1, 3))\n {\n case 1:\n mean_game_length = std::max(1.0, mean_game_length + Random::random_normal(1.0));\n break;\n case 2:\n game_length_uncertainty = std::abs(game_length_uncertainty + Random::random_normal(0.01));\n break;\n case 3:\n speculation_constant += Random::random_normal(0.01);\n speculation_constant = std::max(speculation_constant, 0.0);\n speculation_constant = std::min(speculation_constant, 1.0);\n recalculate_exponent();\n break;\n default:\n assert(false); \/\/ If here, random_integer() called with wrong parameters\n break;\n }\n}\n\nLook_Ahead_Gene* Look_Ahead_Gene::duplicate() const\n{\n return new Look_Ahead_Gene(*this);\n}\n\nstd::string Look_Ahead_Gene::name() const\n{\n return \"Look Ahead Gene\";\n}\n\ndouble Look_Ahead_Gene::score_board(const Board&, Color) const\n{\n return 0.0;\n}\n\nbool Look_Ahead_Gene::enough_time_to_recurse(double time_allotted, const Board& board, double positions_per_second) const\n{\n \/\/ The idea is that, if the time allotted to a move is less than the time\n \/\/ this gene thinks it takes to examine every move of the resulting board state\n \/\/ without recursion, then it should still recurse with a probability that is a\n \/\/ function of the ratio of the time allotted to time needed. The speculation_constant\n \/\/ specifies how often this should happen, with 0 being never and 1 being always\n \/\/ (see the recalculate_exponent() function for the math).\n\n auto minimum_time_to_recurse = board.legal_moves().size()\/positions_per_second;\n auto base = time_allotted\/minimum_time_to_recurse;\n\n if(base <= 0.0)\n {\n return false;\n }\n\n if(base >= 1.0)\n {\n return true;\n }\n\n return Random::success_probability(std::pow(base, speculation_exponent));\n}\n\nvoid Look_Ahead_Gene::recalculate_exponent()\n{\n if(speculation_constant > 0.0)\n {\n speculation_exponent = (1.0 - speculation_constant)\/speculation_constant;\n }\n else\n {\n speculation_exponent = Math::infinity;\n }\n\n \/\/ constant = 0.0 ==> exponent = infinity\n \/\/ constant = 0.5 ==> exponent = 1\n \/\/ constant = 1.0 ==> exponent = 0\n \/\/\n \/\/ Additionally, the function is symmetric about constant = 0.5:\n \/\/ constant --> 1 - constant ==> exponent --> 1\/exponent\n \/\/\n \/\/ This results in a value of the std::pow() expression in enough_time_to_recurse()\n \/\/\n \/\/ value = (0 < base < 1)^exponent\n \/\/\n \/\/ Large exponents result in values near zero, which means recursion with little time\n \/\/ has little probability. Small exponents result in values near 1, so recursion with\n \/\/ little time is more likely.\n}\n<commit_msg>Start with more aggressive Look Ahead speculation<commit_after>#include \"Genes\/Look_Ahead_Gene.h\"\n\n#include <cmath>\n#include <cassert>\n\n#include \"Genes\/Gene.h\"\n#include \"Utility.h\"\n#include \"Game\/Board.h\"\n#include \"Game\/Clock.h\"\n#include \"Moves\/Complete_Move.h\"\n\n\nLook_Ahead_Gene::Look_Ahead_Gene() :\n mean_game_length(50),\n game_length_uncertainty(0.5),\n speculation_constant(0.5)\n{\n recalculate_exponent();\n}\n\nvoid Look_Ahead_Gene::reset_properties() const\n{\n properties[\"Mean Game Length\"] = mean_game_length;\n properties[\"Game Length Uncertainty\"] = game_length_uncertainty;\n properties[\"Speculation Constant\"] = speculation_constant;\n}\n\nvoid Look_Ahead_Gene::load_properties()\n{\n mean_game_length = properties[\"Mean Game Length\"];\n game_length_uncertainty = properties[\"Game Length Uncertainty\"];\n speculation_constant = properties[\"Speculation Constant\"];\n recalculate_exponent();\n}\n\ndouble Look_Ahead_Gene::time_to_examine(const Board& board, const Clock& clock) const\n{\n if( ! is_active())\n {\n return 0.0;\n }\n\n auto time_left = clock.time_left(board.whose_turn());\n auto moves_to_reset = clock.moves_to_reset(board.whose_turn());\n\n auto moves_so_far = board.get_game_record().size()\/2; \/\/ only count moves by this player\n auto moves_left = Math::average_moves_left(mean_game_length, game_length_uncertainty, moves_so_far);\n\n return time_left\/std::min(moves_left, double(moves_to_reset));\n}\n\nvoid Look_Ahead_Gene::gene_specific_mutation()\n{\n switch(Random::random_integer(1, 3))\n {\n case 1:\n mean_game_length = std::max(1.0, mean_game_length + Random::random_normal(1.0));\n break;\n case 2:\n game_length_uncertainty = std::abs(game_length_uncertainty + Random::random_normal(0.01));\n break;\n case 3:\n speculation_constant += Random::random_normal(0.01);\n speculation_constant = std::max(speculation_constant, 0.0);\n speculation_constant = std::min(speculation_constant, 1.0);\n recalculate_exponent();\n break;\n default:\n assert(false); \/\/ If here, random_integer() called with wrong parameters\n break;\n }\n}\n\nLook_Ahead_Gene* Look_Ahead_Gene::duplicate() const\n{\n return new Look_Ahead_Gene(*this);\n}\n\nstd::string Look_Ahead_Gene::name() const\n{\n return \"Look Ahead Gene\";\n}\n\ndouble Look_Ahead_Gene::score_board(const Board&, Color) const\n{\n return 0.0;\n}\n\nbool Look_Ahead_Gene::enough_time_to_recurse(double time_allotted, const Board& board, double positions_per_second) const\n{\n \/\/ The idea is that, if the time allotted to a move is less than the time\n \/\/ this gene thinks it takes to examine every move of the resulting board state\n \/\/ without recursion, then it should still recurse with a probability that is a\n \/\/ function of the ratio of the time allotted to time needed. The speculation_constant\n \/\/ specifies how often this should happen, with 0 being never and 1 being always\n \/\/ (see the recalculate_exponent() function for the math).\n\n auto minimum_time_to_recurse = board.legal_moves().size()\/positions_per_second;\n auto base = time_allotted\/minimum_time_to_recurse;\n\n if(base <= 0.0)\n {\n return false;\n }\n\n if(base >= 1.0)\n {\n return true;\n }\n\n return Random::success_probability(std::pow(base, speculation_exponent));\n}\n\nvoid Look_Ahead_Gene::recalculate_exponent()\n{\n if(speculation_constant > 0.0)\n {\n speculation_exponent = (1.0 - speculation_constant)\/speculation_constant;\n }\n else\n {\n speculation_exponent = Math::infinity;\n }\n\n \/\/ constant = 0.0 ==> exponent = infinity\n \/\/ constant = 0.5 ==> exponent = 1\n \/\/ constant = 1.0 ==> exponent = 0\n \/\/\n \/\/ Additionally, the function is symmetric about constant = 0.5:\n \/\/ constant --> 1 - constant ==> exponent --> 1\/exponent\n \/\/\n \/\/ This results in a value of the std::pow() expression in enough_time_to_recurse()\n \/\/\n \/\/ value = (0 < base < 1)^exponent\n \/\/\n \/\/ Large exponents result in values near zero, which means recursion with little time\n \/\/ has little probability. Small exponents result in values near 1, so recursion with\n \/\/ little time is more likely.\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* this file is part of the oxygen gtk engine\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* based on the Null Theme Engine for Gtk+.\n* Copyright (c) 2008 Robert Staudinger <robert.staudinger@gmail.com>\n*\n* This library is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2 of the License, or( at your option ) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free\n* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,\n* MA 02110-1301, USA.\n*\/\n\n#include \"oxygendemodialog.h\"\n#include \"oxygeninputdemowidget.h\"\n#include \"oxygenbuttondemowidget.h\"\n#include \"oxygenframedemowidget.h\"\n#include \"oxygentabdemowidget.h\"\n\n#include <iostream>\n\nnamespace Oxygen\n{\n\n \/\/_____________________________________________\n DemoDialog::DemoDialog( void )\n {\n\n \/\/ create main widget\n _mainWidget = gtk_window_new( GTK_WINDOW_TOPLEVEL );\n gtk_window_set_default_size( GTK_WINDOW( _mainWidget ), 630, 500 );\n gtk_window_set_title( GTK_WINDOW( _mainWidget ), \"Oxygen-gtk Demo\" );\n gtk_container_set_border_width( GTK_CONTAINER( _mainWidget ), 10 );\n\n \/\/ vertical container\n GtkWidget* vbox( gtk_vbox_new( false, 5 ) );\n gtk_container_add( GTK_CONTAINER( _mainWidget ), vbox );\n gtk_widget_show( vbox );\n\n GtkWidget* iconView(0L);\n {\n \/\/ first horizontal container\n GtkWidget* hbox( gtk_hbox_new( false, 8 ) );\n gtk_box_pack_start( GTK_BOX( vbox ), hbox, true, true, 0 );\n gtk_widget_show( hbox );\n\n \/\/ iconview model\n _model = gtk_list_store_new( 2, GDK_TYPE_PIXBUF, G_TYPE_STRING );\n\n \/\/ inconview\n GtkWidget* scrolledWindow( gtk_scrolled_window_new( 0L, 0L ) );\n gtk_scrolled_window_set_shadow_type( GTK_SCROLLED_WINDOW( scrolledWindow ), GTK_SHADOW_IN );\n gtk_scrolled_window_set_policy( GTK_SCROLLED_WINDOW( scrolledWindow ), GTK_POLICY_NEVER, GTK_POLICY_NEVER );\n gtk_box_pack_start( GTK_BOX( hbox ), scrolledWindow, false, true, 0 );\n gtk_widget_show( scrolledWindow );\n\n iconView = gtk_icon_view_new_with_model( GTK_TREE_MODEL( _model ) );\n gtk_icon_view_set_pixbuf_column( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_text_column( GTK_ICON_VIEW( iconView ), 1 );\n gtk_icon_view_set_columns( GTK_ICON_VIEW( iconView ), 1 );\n\n gtk_icon_view_set_item_width( GTK_ICON_VIEW( iconView ), 108 );\n gtk_icon_view_set_spacing( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_margin( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_column_spacing( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_row_spacing( GTK_ICON_VIEW( iconView ), 0 );\n\n \/\/ get list of renderers, find text renderer and make font format bold\n GList* cells( gtk_cell_layout_get_cells( GTK_CELL_LAYOUT( iconView ) ) );\n for( GList *cell = g_list_first( cells ); cell; cell = g_list_next( cell ) )\n {\n if( !GTK_IS_CELL_RENDERER_TEXT( cell->data ) ) continue;\n\n \/\/ create pango attributes list\n PangoAttrList* attributes( pango_attr_list_new() );\n pango_attr_list_insert( attributes, pango_attr_weight_new( PANGO_WEIGHT_BOLD ) );\n\n GValue val = { 0, };\n g_value_init(&val, PANGO_TYPE_ATTR_LIST );\n g_value_set_boxed( &val, attributes );\n g_object_set_property( G_OBJECT( cell->data ), \"attributes\", &val );\n\n pango_attr_list_unref( attributes );\n\n }\n\n if( cells ) g_list_free( cells );\n\n \/\/ connect signals\n _selectionChangedId.connect( G_OBJECT(iconView), \"selection-changed\", G_CALLBACK( selectionChanged ), this );\n\n gtk_container_add( GTK_CONTAINER( scrolledWindow ), iconView );\n gtk_widget_show( iconView );\n\n \/\/ notebook\n _notebook = gtk_notebook_new();\n gtk_notebook_set_show_tabs( GTK_NOTEBOOK( _notebook ), false );\n gtk_box_pack_start( GTK_BOX( hbox ), _notebook, true, true, 0 );\n gtk_widget_show( _notebook );\n\n }\n\n {\n \/\/ statusbar\n GtkWidget* statusBar( gtk_hbox_new( false, 2 ) );\n gtk_box_pack_start( GTK_BOX( vbox ), statusBar, false, true, 0 );\n gtk_widget_show( statusBar );\n\n \/\/ enable checkbox\n _stateButton = gtk_check_button_new_with_label( \"Enabled\" );\n gtk_toggle_button_set_active( GTK_TOGGLE_BUTTON( _stateButton ), true );\n gtk_box_pack_start( GTK_BOX( statusBar ), _stateButton, false, false, 0 );\n gtk_widget_show( _stateButton );\n\n _toggleEnableStateId.connect( G_OBJECT(_stateButton), \"toggled\", G_CALLBACK( toggleEnableState ), this );\n\n \/\/ button box\n #if GTK_CHECK_VERSION( 3, 0, 0 )\n GtkWidget* buttonBox( gtk_button_box_new( GTK_ORIENTATION_HORIZONTAL) );\n #else\n GtkWidget* buttonBox( gtk_hbutton_box_new() );\n #endif\n\n gtk_button_box_set_layout( GTK_BUTTON_BOX( buttonBox ), GTK_BUTTONBOX_END );\n gtk_box_pack_end( GTK_BOX( statusBar ), buttonBox, true, true, 0 );\n gtk_widget_show( buttonBox );\n\n \/\/ close button\n GtkWidget* button = gtk_button_new_from_stock( GTK_STOCK_OK );\n gtk_box_pack_end( GTK_BOX( buttonBox ), button, false, true, 0 );\n gtk_widget_show( button );\n\n g_signal_connect( G_OBJECT(button), \"clicked\", G_CALLBACK( gtk_main_quit ), 0L );\n\n }\n\n addPage( new InputDemoWidget() );\n addPage( new TabDemoWidget() );\n addPage( new ButtonDemoWidget() );\n addPage( new FrameDemoWidget() );\n\n \/\/ select first raw\n GtkTreePath *path( gtk_tree_path_new_from_indices(0, -1 ) );\n gtk_icon_view_select_path( GTK_ICON_VIEW( iconView ), path );\n\n }\n\n \/\/_____________________________________________\n DemoDialog::~DemoDialog( void )\n {}\n\n \/\/_____________________________________________\n void DemoDialog::addPage( DemoWidget* page )\n {\n \/\/ get icon\n GdkPixbuf* icon( 0L );\n if( !page->iconName().empty() )\n {\n\n \/\/ TODO: should get this icon size from options\n GtkIconTheme* theme( gtk_icon_theme_get_default() );\n icon = gtk_icon_theme_load_icon( theme, page->iconName().c_str(), 32, (GtkIconLookupFlags) 0, 0L );\n\n }\n\n \/\/ insert in list\n GtkTreeIter iter;\n gtk_list_store_append( _model, &iter );\n gtk_list_store_set( _model, &iter, 0, icon, 1, page->name().c_str(), -1 );\n\n \/\/ add to notebook\n int index( gtk_notebook_append_page( GTK_NOTEBOOK( _notebook ), page->mainWidget(), 0L ) );\n gtk_widget_show( page->mainWidget() );\n\n _pages.insert( std::make_pair( index, page ) );\n }\n\n \/\/_____________________________________________\n void DemoDialog::selectionChanged( GtkIconView* view, gpointer data )\n {\n \/\/ get pointer to dialog\n DemoDialog& dialog( *static_cast<DemoDialog*>( data ) );\n\n \/\/ get selection\n GList* selection = gtk_icon_view_get_selected_items( view );\n if( !selection ) return;\n\n \/\/ get first child\n GtkTreePath* path( static_cast<GtkTreePath*>( g_list_first( selection )->data ) );\n const int page( gtk_tree_path_get_indices( path )[0] );\n gtk_notebook_set_current_page( GTK_NOTEBOOK( dialog._notebook ), page );\n g_list_free( selection );\n\n \/\/ store enable state\n const bool enabled( gtk_toggle_button_get_active( GTK_TOGGLE_BUTTON( dialog._stateButton ) ) );\n\n \/\/ get matching page\n DemoWidget* widget( dialog._pages[page] );\n widget->setEnabled( enabled );\n\n\n }\n\n \/\/_____________________________________________\n void DemoDialog::toggleEnableState( GtkToggleButton* button, gpointer data )\n {\n\n \/\/ get pointer to dialog\n DemoDialog& dialog( *static_cast<DemoDialog*>( data ) );\n\n \/\/ store enable state\n const bool enabled( gtk_toggle_button_get_active( button ) );\n\n \/\/ get current page\n const int page( gtk_notebook_get_current_page( GTK_NOTEBOOK( dialog._notebook ) ) );\n\n \/\/ get matching page\n DemoWidget* widget( dialog._pages[page] );\n widget->setEnabled( enabled );\n\n }\n}\n<commit_msg>Make it impossible to deselect an item in oxygen-gtk-demo iconview<commit_after>\/*\n* this file is part of the oxygen gtk engine\n* Copyright (c) 2010 Hugo Pereira Da Costa <hugo@oxygen-icons.org>\n*\n* based on the Null Theme Engine for Gtk+.\n* Copyright (c) 2008 Robert Staudinger <robert.staudinger@gmail.com>\n*\n* This library is free software; you can redistribute it and\/or\n* modify it under the terms of the GNU Lesser General Public\n* License as published by the Free Software Foundation; either\n* version 2 of the License, or( at your option ) any later version.\n*\n* This library is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n* Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Lesser General Public\n* License along with this library; if not, write to the Free\n* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,\n* MA 02110-1301, USA.\n*\/\n\n#include \"oxygendemodialog.h\"\n#include \"oxygeninputdemowidget.h\"\n#include \"oxygenbuttondemowidget.h\"\n#include \"oxygenframedemowidget.h\"\n#include \"oxygentabdemowidget.h\"\n\n#include <iostream>\n\nnamespace Oxygen\n{\n\n \/\/_____________________________________________\n DemoDialog::DemoDialog( void )\n {\n\n \/\/ create main widget\n _mainWidget = gtk_window_new( GTK_WINDOW_TOPLEVEL );\n gtk_window_set_default_size( GTK_WINDOW( _mainWidget ), 630, 500 );\n gtk_window_set_title( GTK_WINDOW( _mainWidget ), \"Oxygen-gtk Demo\" );\n gtk_container_set_border_width( GTK_CONTAINER( _mainWidget ), 10 );\n\n \/\/ vertical container\n GtkWidget* vbox( gtk_vbox_new( false, 5 ) );\n gtk_container_add( GTK_CONTAINER( _mainWidget ), vbox );\n gtk_widget_show( vbox );\n\n GtkWidget* iconView(0L);\n {\n \/\/ first horizontal container\n GtkWidget* hbox( gtk_hbox_new( false, 8 ) );\n gtk_box_pack_start( GTK_BOX( vbox ), hbox, true, true, 0 );\n gtk_widget_show( hbox );\n\n \/\/ iconview model\n _model = gtk_list_store_new( 2, GDK_TYPE_PIXBUF, G_TYPE_STRING );\n\n \/\/ inconview\n GtkWidget* scrolledWindow( gtk_scrolled_window_new( 0L, 0L ) );\n gtk_scrolled_window_set_shadow_type( GTK_SCROLLED_WINDOW( scrolledWindow ), GTK_SHADOW_IN );\n gtk_scrolled_window_set_policy( GTK_SCROLLED_WINDOW( scrolledWindow ), GTK_POLICY_NEVER, GTK_POLICY_NEVER );\n gtk_box_pack_start( GTK_BOX( hbox ), scrolledWindow, false, true, 0 );\n gtk_widget_show( scrolledWindow );\n\n iconView = gtk_icon_view_new_with_model( GTK_TREE_MODEL( _model ) );\n gtk_icon_view_set_pixbuf_column( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_text_column( GTK_ICON_VIEW( iconView ), 1 );\n gtk_icon_view_set_columns( GTK_ICON_VIEW( iconView ), 1 );\n\n gtk_icon_view_set_item_width( GTK_ICON_VIEW( iconView ), 108 );\n gtk_icon_view_set_spacing( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_margin( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_column_spacing( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_row_spacing( GTK_ICON_VIEW( iconView ), 0 );\n gtk_icon_view_set_selection_mode( GTK_ICON_VIEW( iconView ), GTK_SELECTION_BROWSE );\n\n \/\/ get list of renderers, find text renderer and make font format bold\n GList* cells( gtk_cell_layout_get_cells( GTK_CELL_LAYOUT( iconView ) ) );\n for( GList *cell = g_list_first( cells ); cell; cell = g_list_next( cell ) )\n {\n if( !GTK_IS_CELL_RENDERER_TEXT( cell->data ) ) continue;\n\n \/\/ create pango attributes list\n PangoAttrList* attributes( pango_attr_list_new() );\n pango_attr_list_insert( attributes, pango_attr_weight_new( PANGO_WEIGHT_BOLD ) );\n\n GValue val = { 0, };\n g_value_init(&val, PANGO_TYPE_ATTR_LIST );\n g_value_set_boxed( &val, attributes );\n g_object_set_property( G_OBJECT( cell->data ), \"attributes\", &val );\n\n pango_attr_list_unref( attributes );\n\n }\n\n if( cells ) g_list_free( cells );\n\n \/\/ connect signals\n _selectionChangedId.connect( G_OBJECT(iconView), \"selection-changed\", G_CALLBACK( selectionChanged ), this );\n\n gtk_container_add( GTK_CONTAINER( scrolledWindow ), iconView );\n gtk_widget_show( iconView );\n\n \/\/ notebook\n _notebook = gtk_notebook_new();\n gtk_notebook_set_show_tabs( GTK_NOTEBOOK( _notebook ), false );\n gtk_box_pack_start( GTK_BOX( hbox ), _notebook, true, true, 0 );\n gtk_widget_show( _notebook );\n\n }\n\n {\n \/\/ statusbar\n GtkWidget* statusBar( gtk_hbox_new( false, 2 ) );\n gtk_box_pack_start( GTK_BOX( vbox ), statusBar, false, true, 0 );\n gtk_widget_show( statusBar );\n\n \/\/ enable checkbox\n _stateButton = gtk_check_button_new_with_label( \"Enabled\" );\n gtk_toggle_button_set_active( GTK_TOGGLE_BUTTON( _stateButton ), true );\n gtk_box_pack_start( GTK_BOX( statusBar ), _stateButton, false, false, 0 );\n gtk_widget_show( _stateButton );\n\n _toggleEnableStateId.connect( G_OBJECT(_stateButton), \"toggled\", G_CALLBACK( toggleEnableState ), this );\n\n \/\/ button box\n #if GTK_CHECK_VERSION( 3, 0, 0 )\n GtkWidget* buttonBox( gtk_button_box_new( GTK_ORIENTATION_HORIZONTAL) );\n #else\n GtkWidget* buttonBox( gtk_hbutton_box_new() );\n #endif\n\n gtk_button_box_set_layout( GTK_BUTTON_BOX( buttonBox ), GTK_BUTTONBOX_END );\n gtk_box_pack_end( GTK_BOX( statusBar ), buttonBox, true, true, 0 );\n gtk_widget_show( buttonBox );\n\n \/\/ close button\n GtkWidget* button = gtk_button_new_from_stock( GTK_STOCK_OK );\n gtk_box_pack_end( GTK_BOX( buttonBox ), button, false, true, 0 );\n gtk_widget_show( button );\n\n g_signal_connect( G_OBJECT(button), \"clicked\", G_CALLBACK( gtk_main_quit ), 0L );\n\n }\n\n addPage( new InputDemoWidget() );\n addPage( new TabDemoWidget() );\n addPage( new ButtonDemoWidget() );\n addPage( new FrameDemoWidget() );\n\n \/\/ select first raw\n GtkTreePath *path( gtk_tree_path_new_from_indices(0, -1 ) );\n gtk_icon_view_select_path( GTK_ICON_VIEW( iconView ), path );\n\n }\n\n \/\/_____________________________________________\n DemoDialog::~DemoDialog( void )\n {}\n\n \/\/_____________________________________________\n void DemoDialog::addPage( DemoWidget* page )\n {\n \/\/ get icon\n GdkPixbuf* icon( 0L );\n if( !page->iconName().empty() )\n {\n\n \/\/ TODO: should get this icon size from options\n GtkIconTheme* theme( gtk_icon_theme_get_default() );\n icon = gtk_icon_theme_load_icon( theme, page->iconName().c_str(), 32, (GtkIconLookupFlags) 0, 0L );\n\n }\n\n \/\/ insert in list\n GtkTreeIter iter;\n gtk_list_store_append( _model, &iter );\n gtk_list_store_set( _model, &iter, 0, icon, 1, page->name().c_str(), -1 );\n\n \/\/ add to notebook\n int index( gtk_notebook_append_page( GTK_NOTEBOOK( _notebook ), page->mainWidget(), 0L ) );\n gtk_widget_show( page->mainWidget() );\n\n _pages.insert( std::make_pair( index, page ) );\n }\n\n \/\/_____________________________________________\n void DemoDialog::selectionChanged( GtkIconView* view, gpointer data )\n {\n \/\/ get pointer to dialog\n DemoDialog& dialog( *static_cast<DemoDialog*>( data ) );\n\n \/\/ get selection\n GList* selection = gtk_icon_view_get_selected_items( view );\n if( !selection ) return;\n\n \/\/ get first child\n GtkTreePath* path( static_cast<GtkTreePath*>( g_list_first( selection )->data ) );\n const int page( gtk_tree_path_get_indices( path )[0] );\n gtk_notebook_set_current_page( GTK_NOTEBOOK( dialog._notebook ), page );\n g_list_free( selection );\n\n \/\/ store enable state\n const bool enabled( gtk_toggle_button_get_active( GTK_TOGGLE_BUTTON( dialog._stateButton ) ) );\n\n \/\/ get matching page\n DemoWidget* widget( dialog._pages[page] );\n widget->setEnabled( enabled );\n\n\n }\n\n \/\/_____________________________________________\n void DemoDialog::toggleEnableState( GtkToggleButton* button, gpointer data )\n {\n\n \/\/ get pointer to dialog\n DemoDialog& dialog( *static_cast<DemoDialog*>( data ) );\n\n \/\/ store enable state\n const bool enabled( gtk_toggle_button_get_active( button ) );\n\n \/\/ get current page\n const int page( gtk_notebook_get_current_page( GTK_NOTEBOOK( dialog._notebook ) ) );\n\n \/\/ get matching page\n DemoWidget* widget( dialog._pages[page] );\n widget->setEnabled( enabled );\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"lexicalAnalyzer.h\"\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool isDigit(const char &symbol)\n{\n\treturn (symbol >= '0' && symbol <= '9');\n}\n\nbool isDot(const char &symbol)\n{\n\treturn (symbol == '.');\n}\n\nbool isSign(const char &symbol)\n{\n\treturn (symbol == '+' || symbol == '-');\n}\n\nbool isExponent(const char &symbol)\n{\n\treturn (symbol == 'E');\n}\n\nbool isLastSymbol(int index, int sizeOfStr)\n{\n\treturn (index == sizeOfStr - 1);\n}\n\nbool isRealNumber(const string &str)\n{\n\tconst int sizeOfStr = str.length();\n\tint state = 0;\n\tchar symbol = '0';\n\n\tfor (int i = 0; i < sizeOfStr; ++i)\n\t{\n\t\tsymbol = str[i];\n\t\tswitch (state)\n\t\t{\n\t\tcase 0:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 1:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 1;\n\t\t\t}\n\t\t\telse if (isDot(symbol) && !isLastSymbol(i, sizeOfStr))\n\t\t\t{\n\t\t\t\tstate = 2;\n\t\t\t}\n\t\t\telse if (isExponent(symbol) && !isLastSymbol(i, sizeOfStr))\n\t\t\t{\n\t\t\t\tstate = 4;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 2:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 3:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 3;\n\t\t\t}\n\t\t\telse if (isExponent(symbol) && !isLastSymbol(i, sizeOfStr))\n\t\t\t{\n\t\t\t\tstate = 4;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 4:\n\t\t{\n\t\t\tif (isSign(symbol) && !isLastSymbol(i, sizeOfStr))\n\t\t\t{\n\t\t\t\tstate = 5;\n\t\t\t}\n\t\t\telse if (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 5;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 5:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 5;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\t}\n\t}\n\treturn true;\n}<commit_msg>Removed isLastSymbol<commit_after>#include \"lexicalAnalyzer.h\"\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nbool isDigit(const char &symbol)\n{\n\treturn (symbol >= '0' && symbol <= '9');\n}\n\nbool isDot(const char &symbol)\n{\n\treturn (symbol == '.');\n}\n\nbool isSign(const char &symbol)\n{\n\treturn (symbol == '+' || symbol == '-');\n}\n\nbool isExponent(const char &symbol)\n{\n\treturn (symbol == 'E');\n}\n\nbool isRealNumber(const string &str)\n{\n\tconst int sizeOfStr = str.length();\n\tint state = 0;\n\tchar symbol = '0';\n\n\tfor (int i = 0; i < sizeOfStr; ++i)\n\t{\n\t\tsymbol = str[i];\n\t\tswitch (state)\n\t\t{\n\t\tcase 0:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 1;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 1:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 1;\n\t\t\t}\n\t\t\telse if (isDot(symbol))\n\t\t\t{\n\t\t\t\tstate = 2;\n\t\t\t}\n\t\t\telse if (isExponent(symbol))\n\t\t\t{\n\t\t\t\tstate = 4;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 2:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 3;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 3:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 3;\n\t\t\t}\n\t\t\telse if (isExponent(symbol))\n\t\t\t{\n\t\t\t\tstate = 4;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 4:\n\t\t{\n\t\t\tif (isSign(symbol))\n\t\t\t{\n\t\t\t\tstate = 5;\n\t\t\t}\n\t\t\telse if (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 6;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 5:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 6;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\tcase 6:\n\t\t{\n\t\t\tif (isDigit(symbol))\n\t\t\t{\n\t\t\t\tstate = 6;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\t}\n\t}\n\treturn (state == 1 || state == 3 || state == 6);\n}<|endoftext|>"} {"text":"<commit_before>#include \"test_slitherlink_field.h\"\r\n#include \"test.h\"\r\n\r\n#include <cassert>\r\n#include <vector>\r\n\r\n#include \"..\/slitherlink\/sl_field.h\"\r\n#include \"..\/slitherlink\/sl_database.h\"\r\n\r\nnamespace\r\n{\r\n\/\/ Place clues and check edges\r\nvoid DoAddClueTest(penciloid::Y height, penciloid::X width, std::vector<const char*> test_target, penciloid::slitherlink::Database *db)\r\n{\r\n\tusing namespace penciloid;\r\n\tusing namespace penciloid::slitherlink;\r\n\r\n\tField field(height, width);\r\n\tfield.SetDatabase(db);\r\n\r\n\tfor (Y y = 0; y < height; ++y) {\r\n\t\tfor (X x = 0; x < width; ++x) {\r\n\t\t\tif ('0' <= test_target[y * 2 + 1][x * 2 + 1] && test_target[y * 2 + 1][x * 2 + 1] <= '3') {\r\n\t\t\t\tfield.AddClue(Position(y, x), test_target[y * 2 + 1][x * 2 + 1] - '0');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfor (Y y = 0; y <= 2 * height; ++y) {\r\n\t\tfor (X x = 0; x <= 2 * width; ++x) {\r\n\t\t\tif (y % 2 != x % 2) {\r\n\t\t\t\tField::EdgeState expected;\r\n\t\t\t\tif (test_target[y][x] == 'x') expected = Field::EDGE_BLANK;\r\n\t\t\t\telse if (test_target[y][x] == ' ') expected = Field::EDGE_UNDECIDED;\r\n\t\t\t\telse expected = Field::EDGE_LINE;\r\n\r\n\t\t\t\tif (field.GetEdge(Position(y, x)) != expected) {\r\n\t\t\t\t\ty = y;\r\n\t\t\t\t}\r\n\t\t\t\tassert(field.GetEdge(Position(y, x)) == expected);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n}\r\n\r\nnamespace penciloid\r\n{\r\nnamespace test\r\n{\r\nvoid RunAllSlitherlinkFieldTest()\r\n{\r\n\tSlitherlinkFieldAddClue();\r\n\tSlitherlinkFieldTheorem();\r\n}\r\nvoid SlitherlinkFieldAddClue()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" x0x \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+ + +\",\r\n\t\t\"x1 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ +-+ +\",\r\n\t\t\" 2 \",\r\n\t\t\"+ + + +\",\r\n\t\t\"| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+ + +\",\r\n\t\t\"|3 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+x+-+\",\r\n\t\t\"x0x2| |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"x | x |\",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+ +\",\r\n\t\t\"| x \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+-+\",\r\n\t\t\"| x2| x\",\r\n\t\t\"+ +-+x+\",\r\n\t\t\" x x\",\r\n\t\t\"+ +x+x+\",\r\n\t}, &db);\r\n}\r\nvoid SlitherlinkFieldTheorem()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t\t\"|3|3| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 4, {\r\n\t\t\"+ + +-+x+\",\r\n\t\t\" 3| x\",\r\n\t\t\"+ + + + +\",\r\n\t\t\" |3 \",\r\n\t\t\"+x+-+ + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"| x x |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"|3|3| |\",\r\n\t\t\"+-+x+ +\",\r\n\t\t\"x1x \",\r\n\t\t\"+x+x+ +\",\r\n\t}, &db);\r\n}\r\n}\r\n}\r\n<commit_msg>Slitherlink: check IsInconsistent and IsFullySolved in DoAddClueTest<commit_after>#include \"test_slitherlink_field.h\"\r\n#include \"test.h\"\r\n\r\n#include <cassert>\r\n#include <vector>\r\n\r\n#include \"..\/slitherlink\/sl_field.h\"\r\n#include \"..\/slitherlink\/sl_database.h\"\r\n\r\nnamespace\r\n{\r\n\/\/ Place clues and check edges\r\nvoid DoAddClueTest(penciloid::Y height, penciloid::X width, std::vector<const char*> test_target, penciloid::slitherlink::Database *db, bool inconsistent = false, bool fully_solved = false)\r\n{\r\n\tusing namespace penciloid;\r\n\tusing namespace penciloid::slitherlink;\r\n\r\n\tField field(height, width);\r\n\tfield.SetDatabase(db);\r\n\r\n\tfor (Y y = 0; y < height; ++y) {\r\n\t\tfor (X x = 0; x < width; ++x) {\r\n\t\t\tif ('0' <= test_target[y * 2 + 1][x * 2 + 1] && test_target[y * 2 + 1][x * 2 + 1] <= '3') {\r\n\t\t\t\tfield.AddClue(Position(y, x), test_target[y * 2 + 1][x * 2 + 1] - '0');\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tfor (Y y = 0; y <= 2 * height; ++y) {\r\n\t\tfor (X x = 0; x <= 2 * width; ++x) {\r\n\t\t\tif (y % 2 != x % 2) {\r\n\t\t\t\tField::EdgeState expected;\r\n\t\t\t\tif (test_target[y][x] == 'x') expected = Field::EDGE_BLANK;\r\n\t\t\t\telse if (test_target[y][x] == ' ') expected = Field::EDGE_UNDECIDED;\r\n\t\t\t\telse expected = Field::EDGE_LINE;\r\n\r\n\t\t\t\tif (field.GetEdge(Position(y, x)) != expected) {\r\n\t\t\t\t\ty = y;\r\n\t\t\t\t}\r\n\t\t\t\tassert(field.GetEdge(Position(y, x)) == expected);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tassert(field.IsInconsistent() == inconsistent);\r\n\tassert(field.IsFullySolved() == fully_solved);\r\n}\r\n}\r\n\r\nnamespace penciloid\r\n{\r\nnamespace test\r\n{\r\nvoid RunAllSlitherlinkFieldTest()\r\n{\r\n\tSlitherlinkFieldAddClue();\r\n\tSlitherlinkFieldTheorem();\r\n}\r\nvoid SlitherlinkFieldAddClue()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" x0x \",\r\n\t\t\"+ +x+ +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+ + +\",\r\n\t\t\"x1 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ +-+ +\",\r\n\t\t\" 2 \",\r\n\t\t\"+ + + +\",\r\n\t\t\"| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+ + +\",\r\n\t\t\"|3 \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+x+x+-+\",\r\n\t\t\"x0x2| |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"x | x |\",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+ +\",\r\n\t\t\"| x \",\r\n\t\t\"+ + + +\",\r\n\t\t\" \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"|2x1x |\",\r\n\t\t\"+x+x+-+\",\r\n\t\t\"| x2| x\",\r\n\t\t\"+ +-+x+\",\r\n\t\t\" x x\",\r\n\t\t\"+ +x+x+\",\r\n\t}, &db);\r\n}\r\nvoid SlitherlinkFieldTheorem()\r\n{\r\n\tusing namespace slitherlink;\r\n\r\n\tDatabase db;\r\n\tdb.CreateDefault();\r\n\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t\t\"|3|3| \",\r\n\t\t\"+ + + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 4, {\r\n\t\t\"+ + +-+x+\",\r\n\t\t\" 3| x\",\r\n\t\t\"+ + + + +\",\r\n\t\t\" |3 \",\r\n\t\t\"+x+-+ + +\",\r\n\t\t\" x \",\r\n\t\t\"+ + + + +\",\r\n\t}, &db);\r\n\tDoAddClueTest(3, 3, {\r\n\t\t\"+-+-+-+\",\r\n\t\t\"| x x |\",\r\n\t\t\"+x+-+x+\",\r\n\t\t\"|3|3| |\",\r\n\t\t\"+-+x+ +\",\r\n\t\t\"x1x \",\r\n\t\t\"+x+x+ +\",\r\n\t}, &db);\r\n}\r\n}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <seqan\/sequence.h>\n\nint computeScore(seqan::String<seqan::Dna> subText, seqan::String<seqan::Dna> pattern)\n{\n int localScore = 0;\n for (unsigned i = 0; i < seqan::length(pattern); ++i)\n if (subText[i] == pattern[i])\n ++localScore;\n \n return localScore;\n}\n\nint main()\n{\n seqan::String<seqan::Dna> text = \"This is an awesome tutorial to get to now the basic principles of SeqAn!\";\n seqan::String<seqan::Dna> pattern = \"tutorial\";\n\n seqan::String<int> score;\n seqan::resize(score, seqan::length(text), 0);\n\n for (unsigned i = 0; i < seqan::length(text) - seqan::length(pattern) + 1; ++i)\n score[i] = computeScore(seqan::infix(text, i, i + seqan::length(pattern)), pattern);\n\n for (unsigned i = 0; i < seqan::length(score); ++i)\n std::cout << score[i] << \" \";\n std::cout << std::endl;\n\n return 0;\n}\n<commit_msg>[DOC] Added a print statement to the example code.<commit_after>#include <iostream>\n#include <seqan\/sequence.h>\n\nint computeScore(seqan::String<seqan::Dna> subText, seqan::String<seqan::Dna> pattern)\n{\n int localScore = 0;\n for (unsigned i = 0; i < seqan::length(pattern); ++i)\n if (subText[i] == pattern[i])\n ++localScore;\n \n return localScore;\n}\n\nint main()\n{\n seqan::String<seqan::Dna> text = \"This is an awesome tutorial to get to now the basic principles of SeqAn!\";\n seqan::String<seqan::Dna> pattern = \"tutorial\";\n\n std::cout << text << std::endl;\n\n seqan::String<int> score;\n seqan::resize(score, seqan::length(text), 0);\n\n for (unsigned i = 0; i < seqan::length(text) - seqan::length(pattern) + 1; ++i)\n score[i] = computeScore(seqan::infix(text, i, i + seqan::length(pattern)), pattern);\n\n for (unsigned i = 0; i < seqan::length(score); ++i)\n std::cout << score[i] << \" \";\n std::cout << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MATH_CPP\n#define MATH_CPP\n#include <cmath>\n\n#include \"math.hpp\"\n\nfloat distanceTo(float aX, float aY, float bX, float bY)\n{\n \/\/ax-bx sq + ay-by sq\n float x=aX-bX;\n float y=aY-bY;\n return sqrtf(x*x + y*y);\n}\nfloat manhattanTo(float aX, float aY, float bX, float bY)\n{\n \/\/ax-bx sq + ay-by sq\n float x=aX-bX;\n float y=aY-bY;\n return x*x + y*y;\n}\nfloat pointTowards(float aX, float aY, float bX, float bY)\n{\n return radToDeg(atan2f((bY-aY) , (bX-aX)));\n}\nfloat magnitude(float x, float y)\n{\n return distanceTo(0, 0, x, y);\n}\nvoid normalize(coordinate* toNormalize)\n{\n\tfloat length=magnitude(toNormalize->x, toNormalize->y);\n if (length > 0)\n {\n toNormalize->x\/=length;\n toNormalize->y\/=length;\n }\n}\ncoordinate getVectorNormal(float x, float y, bool right)\n{\n\tcoordinate returnCoord;\n\tif (!right)\n\t{\n\t\treturnCoord.x=-y;\n\t\treturnCoord.y=x;\n\t}\n\telse\n\t{\n\t\treturnCoord.x=y;\n\t\treturnCoord.y=-x;\n\t}\n\treturn returnCoord;\n}\ncoordinate getVectorNormal(coordinate* vectorIn, bool right)\n{\n\tcoordinate returnCoord;\n\tif (!right)\n\t{\n\t\treturnCoord.x=-vectorIn->y;\n\t\treturnCoord.y=vectorIn->x;\n\t}\n\telse\n\t{\n\t\treturnCoord.x=vectorIn->y;\n\t\treturnCoord.y=-vectorIn->x;\n\t}\n\treturn returnCoord;\n}\nfloat radToDeg(float radian)\n{\n\t\/\/180\/pi\n\treturn radian*57.295779513;\n}\nfloat degToRad(float degree)\n{\n\t\/\/pi\/180\n\treturn degree*0.017453278;\n}\ncoordinate degToVec(float degree)\n{\n\tcoordinate result;\n\tfloat radian=degToRad(degree);\n\tresult.x=cosf(radian);\n\tresult.y=sinf(radian);\n\treturn result;\n}\nbool isVisible(int x, int y, int wX, int wY, int windowW, int windowH)\n{\n\tif (x + wX < 0 || y + wY < 0) return false;\n\tif (x > windowW || y > windowH) return false;\n\treturn true;\n}\n#endif\n<commit_msg>Changed manhattan function to abs rather than square<commit_after>#ifndef MATH_CPP\n#define MATH_CPP\n#include <cmath>\n\n#include \"math.hpp\"\n\nfloat distanceTo(float aX, float aY, float bX, float bY)\n{\n \/\/ax-bx sq + ay-by sq\n float x=aX-bX;\n float y=aY-bY;\n return sqrtf(x*x + y*y);\n}\nfloat manhattanTo(float aX, float aY, float bX, float bY)\n{\n \/\/ax-bx abs + ay-by abs\n float x=aX-bX;\n float y=aY-bY;\n return fabs(x) + fabs(y);\n}\nfloat pointTowards(float aX, float aY, float bX, float bY)\n{\n return radToDeg(atan2f((bY-aY) , (bX-aX)));\n}\nfloat magnitude(float x, float y)\n{\n return distanceTo(0, 0, x, y);\n}\nvoid normalize(coordinate* toNormalize)\n{\n\tfloat length=magnitude(toNormalize->x, toNormalize->y);\n if (length > 0)\n {\n toNormalize->x\/=length;\n toNormalize->y\/=length;\n }\n}\ncoordinate getVectorNormal(float x, float y, bool right)\n{\n\tcoordinate returnCoord;\n\tif (!right)\n\t{\n\t\treturnCoord.x=-y;\n\t\treturnCoord.y=x;\n\t}\n\telse\n\t{\n\t\treturnCoord.x=y;\n\t\treturnCoord.y=-x;\n\t}\n\treturn returnCoord;\n}\ncoordinate getVectorNormal(coordinate* vectorIn, bool right)\n{\n\tcoordinate returnCoord;\n\tif (!right)\n\t{\n\t\treturnCoord.x=-vectorIn->y;\n\t\treturnCoord.y=vectorIn->x;\n\t}\n\telse\n\t{\n\t\treturnCoord.x=vectorIn->y;\n\t\treturnCoord.y=-vectorIn->x;\n\t}\n\treturn returnCoord;\n}\nfloat radToDeg(float radian)\n{\n\t\/\/180\/pi\n\treturn radian*57.295779513;\n}\nfloat degToRad(float degree)\n{\n\t\/\/pi\/180\n\treturn degree*0.017453278;\n}\ncoordinate degToVec(float degree)\n{\n\tcoordinate result;\n\tfloat radian=degToRad(degree);\n\tresult.x=cosf(radian);\n\tresult.y=sinf(radian);\n\treturn result;\n}\nbool isVisible(int x, int y, int wX, int wY, int windowW, int windowH)\n{\n\tif (x + wX < 0 || y + wY < 0) return false;\n\tif (x > windowW || y > windowH) return false;\n\treturn true;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2012, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreGL\/ColorTexture.h\"\n#include \"IECoreGL\/Exception.h\"\n#include \"IECoreGL\/NumericTraits.h\"\n\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/MessageHandler.h\"\n\nusing namespace IECoreGL;\nusing namespace IECore;\nusing namespace Imath;\nusing namespace std;\nusing namespace boost;\n\nIE_CORE_DEFINERUNTIMETYPED( ColorTexture );\n\nColorTexture::ColorTexture( unsigned int width, unsigned int height )\n{\n\tglGenTextures( 1, &m_texture );\n\tScopedBinding binding( *this );\n\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\n\tglTexImage2D( GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_RGBA,\n\t\tGL_FLOAT, 0 );\n}\n\nColorTexture::ColorTexture( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\tconstruct( width, height, r, g, b, a );\n}\n\nstatic IECore::ConstDataPtr findChannel( const IECore::PrimitiveVariableMap &variables, const char **names )\n{\n\twhile( *names!=0 )\n\t{\n\t\tIECore::PrimitiveVariableMap::const_iterator it = variables.find( *names );\n\t\tif( it!=variables.end() )\n\t\t{\n\t\t\tPrimitiveVariable::Interpolation interpolation = it->second.interpolation;\n\t\t\tif( interpolation==PrimitiveVariable::Vertex ||\n\t\t\t\tinterpolation==PrimitiveVariable::Varying ||\n\t\t\t\tinterpolation==PrimitiveVariable::FaceVarying )\n\t\t\t{\n\t\t\t\treturn it->second.data;\n\t\t\t}\n\t\t}\n\t\tnames++;\n\t}\n\treturn 0;\n}\n\nColorTexture::ColorTexture( IECore::ConstImagePrimitivePtr image )\n{\n\tstatic const char *redNames[] = { \"r\", \"R\", \"red\", 0 };\n\tstatic const char *greenNames[] = { \"g\", \"G\", \"green\", 0 };\n\tstatic const char *blueNames[] = { \"b\", \"B\", \"blue\", 0 };\n\tstatic const char *alphaNames[] = { \"a\", \"A\", \"alpha\", 0 };\n\n\tIECore::ConstDataPtr r = findChannel( image->variables, redNames );\n\tIECore::ConstDataPtr g = findChannel( image->variables, greenNames );\n\tIECore::ConstDataPtr b = findChannel( image->variables, blueNames );\n\tIECore::ConstDataPtr a = findChannel( image->variables, alphaNames );\n\n\tif( !(r && g && b) )\n\t{\n\t\tthrow Exception( \"Unsupported color format.\" );\n\t}\n\n\tint width = image->getDataWindow().size().x + 1;\n\tint height = image->getDataWindow().size().y + 1;\n\tconstruct( width, height, r, g, b, a );\n}\n\nColorTexture::~ColorTexture()\n{\n}\n\nvoid ColorTexture::construct( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\tif( r->typeId() != g->typeId() ||\n\t\tr->typeId() != b->typeId() ||\n\t\t( a && (r->typeId() != a->typeId()) ) )\n\t{\n\t\tthrow Exception( \"Channel types do not match.\" );\n\t}\n\n\tif( r->typeId()==UCharVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<UCharVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==CharVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<CharVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==UIntVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<UIntVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==IntVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<IntVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==HalfVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<HalfVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==FloatVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<FloatVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==DoubleVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<DoubleVectorData>( width, height, r, g, b, a );\n\t}\n\telse {\n\t\tthrow Exception( boost::str( boost::format( \"Unsupported channel type \\\"%s\\\".\" ) % r->typeName() ) );\n\t}\n}\n\ntemplate<class T>\nvoid ColorTexture::castConstruct( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\ttemplateConstruct( width, height,\n\t\tstaticPointerCast<const T>( r ),\n\t\tstaticPointerCast<const T>( g ),\n\t\tstaticPointerCast<const T>( b ),\n\t\tstaticPointerCast<const T>( a )\t);\n}\n\ntemplate<typename T>\nvoid ColorTexture::templateConstruct( unsigned int width, unsigned int height, IECore::IntrusivePtr<const T> r,\n\tIECore::IntrusivePtr<const T> g, IECore::IntrusivePtr<const T> b, IECore::IntrusivePtr<const T> a )\n{\n\ttypedef typename T::ValueType::value_type ElementType;\n\n\tconst std::vector<ElementType> &rr = r->readable();\n\tconst std::vector<ElementType> &rg = g->readable();\n\tconst std::vector<ElementType> &rb = b->readable();\n\tconst std::vector<ElementType> *ra = a ? &a->readable() : 0;\n\n\tunsigned int n = width * height;\n\tif( rr.size()!=n || rg.size()!=n || rb.size()!=n || (ra && ra->size()!=n) )\n\t{\n\t\tthrow IECore::Exception( \"Image data has wrong size.\" );\n\t}\n\n\tstd::vector<ElementType> interleaved( n * (ra ? 4 : 3) );\n\n\tunsigned int i = 0;\n\tfor( int y=height-1; y>=0; y-- )\n\t{\n\t\tconst ElementType *dr = &rr[y*width];\n\t\tconst ElementType *dg = &rg[y*width];\n\t\tconst ElementType *db = &rb[y*width];\n\t\tconst ElementType *da = ra ? &(*ra)[y*width] : 0;\n\n\t\tfor( unsigned int x=0; x<width; x++ )\n\t\t{\n\t\t\tinterleaved[i++] = dr[x];\n\t\t\tinterleaved[i++] = dg[x];\n\t\t\tinterleaved[i++] = db[x];\n\t\t\tif( da )\n\t\t\t{\n\t\t\t\tinterleaved[i++] = da[x];\n\t\t\t}\n\t\t}\n\t}\n\n\tglGenTextures( 1, &m_texture );\n\t\n\tScopedBinding binding( *this );\n\n\tglPixelStorei( GL_UNPACK_ALIGNMENT, 1 );\n\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\n\tglTexImage2D( GL_TEXTURE_2D, 0, ra ? GL_RGBA16 : GL_RGB16, width, height, 0, ra ? GL_RGBA : GL_RGB,\n\t\tNumericTraits<ElementType>::glType(), &interleaved[0] );\n\n\tException::throwIfError();\n\n}\n\nImagePrimitivePtr ColorTexture::imagePrimitive() const\n{\n\tScopedBinding binding( *this );\n\n\tGLint width = 0;\n\tGLint height = 0;\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_WIDTH, &width );\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_HEIGHT, &height );\n\n\tGLint internalFormat = 0;\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_INTERNAL_FORMAT, &internalFormat );\n\n\tunsigned int numChannels = 4;\n\tvector<float> data( width * height * numChannels );\n\n\tglGetTexImage( GL_TEXTURE_2D, 0, GL_RGBA, GL_FLOAT, &data[0] );\n\n\tFloatVectorDataPtr rd = new FloatVectorData();\n\tvector<float> &r = rd->writable(); r.resize( width * height );\n\n\tFloatVectorDataPtr gd = new FloatVectorData();\n\tvector<float> &g = gd->writable(); g.resize( width * height );\n\n\tFloatVectorDataPtr bd = new FloatVectorData();\n\tvector<float> &b = bd->writable(); b.resize( width * height );\n\n\tFloatVectorDataPtr ad = 0;\n\tvector<float> *a = 0;\n\t\/\/ there are potentially loads of different internal formats which denote alpha.\n\t\/\/ these are the only ones encountered so far, but it's not a great way of testing\n\t\/\/ and i can't find another way of doing it.\n\tif( internalFormat==GL_RGBA || internalFormat==GL_RGBA8_EXT )\n\t{\n\t\tad = new FloatVectorData();\n\t\ta = &ad->writable(); a->resize( width * height );\n\t}\n\n\tunsigned int i = 0;\n\tfor( int y=height-1; y>=0; y-- )\n\t{\n\t\tfloat *rr = &r[y*width];\n\t\tfloat *rg = &g[y*width];\n\t\tfloat *rb = &b[y*width];\n\t\tfloat *ra = a ? &(*a)[y*width] : 0;\n\t\tfor( int x=0; x<width; x++ )\n\t\t{\n\t\t\trr[x] = data[i++];\n\t\t\trg[x] = data[i++];\n\t\t\trb[x] = data[i++];\n\t\t\tif( ra )\n\t\t\t{\n\t\t\t\tra[x] = data[i++];\n\t\t\t}\n\t\t}\n\t}\n\n\tBox2i imageExtents( V2i( 0, 0 ), V2i( width-1, height-1 ) );\n\tImagePrimitivePtr image = new ImagePrimitive( imageExtents, imageExtents );\n\timage->variables[\"R\"] = PrimitiveVariable( PrimitiveVariable::Vertex, rd );\n\timage->variables[\"G\"] = PrimitiveVariable( PrimitiveVariable::Vertex, gd );\n\timage->variables[\"B\"] = PrimitiveVariable( PrimitiveVariable::Vertex, bd );\n\tif( a )\n\t{\n\t\timage->variables[\"A\"] = PrimitiveVariable( PrimitiveVariable::Vertex, ad );\n\t}\n\n\tException::throwIfError();\n\t\n\treturn image;\n}\n<commit_msg>Fixed the failing IECoreGL::ColorTexture test cases.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007-2012, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"IECoreGL\/ColorTexture.h\"\n#include \"IECoreGL\/Exception.h\"\n#include \"IECoreGL\/NumericTraits.h\"\n\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/MessageHandler.h\"\n\nusing namespace IECoreGL;\nusing namespace IECore;\nusing namespace Imath;\nusing namespace std;\nusing namespace boost;\n\nIE_CORE_DEFINERUNTIMETYPED( ColorTexture );\n\nColorTexture::ColorTexture( unsigned int width, unsigned int height )\n{\n\tglGenTextures( 1, &m_texture );\n\tScopedBinding binding( *this );\n\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\n\tglTexImage2D( GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_RGBA,\n\t\tGL_FLOAT, 0 );\n}\n\nColorTexture::ColorTexture( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\tconstruct( width, height, r, g, b, a );\n}\n\nstatic IECore::ConstDataPtr findChannel( const IECore::PrimitiveVariableMap &variables, const char **names )\n{\n\twhile( *names!=0 )\n\t{\n\t\tIECore::PrimitiveVariableMap::const_iterator it = variables.find( *names );\n\t\tif( it!=variables.end() )\n\t\t{\n\t\t\tPrimitiveVariable::Interpolation interpolation = it->second.interpolation;\n\t\t\tif( interpolation==PrimitiveVariable::Vertex ||\n\t\t\t\tinterpolation==PrimitiveVariable::Varying ||\n\t\t\t\tinterpolation==PrimitiveVariable::FaceVarying )\n\t\t\t{\n\t\t\t\treturn it->second.data;\n\t\t\t}\n\t\t}\n\t\tnames++;\n\t}\n\treturn 0;\n}\n\nColorTexture::ColorTexture( IECore::ConstImagePrimitivePtr image )\n{\n\tstatic const char *redNames[] = { \"r\", \"R\", \"red\", 0 };\n\tstatic const char *greenNames[] = { \"g\", \"G\", \"green\", 0 };\n\tstatic const char *blueNames[] = { \"b\", \"B\", \"blue\", 0 };\n\tstatic const char *alphaNames[] = { \"a\", \"A\", \"alpha\", 0 };\n\n\tIECore::ConstDataPtr r = findChannel( image->variables, redNames );\n\tIECore::ConstDataPtr g = findChannel( image->variables, greenNames );\n\tIECore::ConstDataPtr b = findChannel( image->variables, blueNames );\n\tIECore::ConstDataPtr a = findChannel( image->variables, alphaNames );\n\n\tif( !(r && g && b) )\n\t{\n\t\tthrow Exception( \"Unsupported color format.\" );\n\t}\n\n\tint width = image->getDataWindow().size().x + 1;\n\tint height = image->getDataWindow().size().y + 1;\n\tconstruct( width, height, r, g, b, a );\n}\n\nColorTexture::~ColorTexture()\n{\n}\n\nvoid ColorTexture::construct( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\tif( r->typeId() != g->typeId() ||\n\t\tr->typeId() != b->typeId() ||\n\t\t( a && (r->typeId() != a->typeId()) ) )\n\t{\n\t\tthrow Exception( \"Channel types do not match.\" );\n\t}\n\n\tif( r->typeId()==UCharVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<UCharVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==CharVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<CharVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==UIntVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<UIntVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==IntVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<IntVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==HalfVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<HalfVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==FloatVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<FloatVectorData>( width, height, r, g, b, a );\n\t}\n\telse if( r->typeId()==DoubleVectorData::staticTypeId() )\n\t{\n\t\tcastConstruct<DoubleVectorData>( width, height, r, g, b, a );\n\t}\n\telse {\n\t\tthrow Exception( boost::str( boost::format( \"Unsupported channel type \\\"%s\\\".\" ) % r->typeName() ) );\n\t}\n}\n\ntemplate<class T>\nvoid ColorTexture::castConstruct( unsigned int width, unsigned int height, IECore::ConstDataPtr r,\n\tIECore::ConstDataPtr g, IECore::ConstDataPtr b, IECore::ConstDataPtr a )\n{\n\ttemplateConstruct( width, height,\n\t\tstaticPointerCast<const T>( r ),\n\t\tstaticPointerCast<const T>( g ),\n\t\tstaticPointerCast<const T>( b ),\n\t\tstaticPointerCast<const T>( a )\t);\n}\n\ntemplate<typename T>\nvoid ColorTexture::templateConstruct( unsigned int width, unsigned int height, IECore::IntrusivePtr<const T> r,\n\tIECore::IntrusivePtr<const T> g, IECore::IntrusivePtr<const T> b, IECore::IntrusivePtr<const T> a )\n{\n\ttypedef typename T::ValueType::value_type ElementType;\n\n\tconst std::vector<ElementType> &rr = r->readable();\n\tconst std::vector<ElementType> &rg = g->readable();\n\tconst std::vector<ElementType> &rb = b->readable();\n\tconst std::vector<ElementType> *ra = a ? &a->readable() : 0;\n\n\tunsigned int n = width * height;\n\tif( rr.size()!=n || rg.size()!=n || rb.size()!=n || (ra && ra->size()!=n) )\n\t{\n\t\tthrow IECore::Exception( \"Image data has wrong size.\" );\n\t}\n\n\tstd::vector<ElementType> interleaved( n * (ra ? 4 : 3) );\n\n\tunsigned int i = 0;\n\tfor( int y=height-1; y>=0; y-- )\n\t{\n\t\tconst ElementType *dr = &rr[y*width];\n\t\tconst ElementType *dg = &rg[y*width];\n\t\tconst ElementType *db = &rb[y*width];\n\t\tconst ElementType *da = ra ? &(*ra)[y*width] : 0;\n\n\t\tfor( unsigned int x=0; x<width; x++ )\n\t\t{\n\t\t\tinterleaved[i++] = dr[x];\n\t\t\tinterleaved[i++] = dg[x];\n\t\t\tinterleaved[i++] = db[x];\n\t\t\tif( da )\n\t\t\t{\n\t\t\t\tinterleaved[i++] = da[x];\n\t\t\t}\n\t\t}\n\t}\n\n\tglGenTextures( 1, &m_texture );\n\t\n\tScopedBinding binding( *this );\n\n\tglPixelStorei( GL_UNPACK_ALIGNMENT, 1 );\n\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST );\n\tglTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\n\tglTexImage2D( GL_TEXTURE_2D, 0, ra ? GL_RGBA16 : GL_RGB16, width, height, 0, ra ? GL_RGBA : GL_RGB,\n\t\tNumericTraits<ElementType>::glType(), &interleaved[0] );\n\n\tException::throwIfError();\n\n}\n\nImagePrimitivePtr ColorTexture::imagePrimitive() const\n{\n\tScopedBinding binding( *this );\n\n\tGLint width = 0;\n\tGLint height = 0;\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_WIDTH, &width );\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_HEIGHT, &height );\n\n\tGLint internalFormat = 0;\n\tglGetTexLevelParameteriv( GL_TEXTURE_2D, 0, GL_TEXTURE_INTERNAL_FORMAT, &internalFormat );\n\n\tunsigned int numChannels = 4;\n\tvector<float> data( width * height * numChannels );\n\n\tglGetTexImage( GL_TEXTURE_2D, 0, GL_RGBA, GL_FLOAT, &data[0] );\n\n\tFloatVectorDataPtr rd = new FloatVectorData();\n\tvector<float> &r = rd->writable(); r.resize( width * height );\n\n\tFloatVectorDataPtr gd = new FloatVectorData();\n\tvector<float> &g = gd->writable(); g.resize( width * height );\n\n\tFloatVectorDataPtr bd = new FloatVectorData();\n\tvector<float> &b = bd->writable(); b.resize( width * height );\n\n\tFloatVectorDataPtr ad = 0;\n\tvector<float> *a = 0;\n\t\/\/ there are potentially loads of different internal formats which denote alpha.\n\t\/\/ these are the only ones encountered so far, but it's not a great way of testing\n\t\/\/ and i can't find another way of doing it.\n\tif( internalFormat==GL_RGBA || internalFormat==GL_RGBA8_EXT || internalFormat==GL_RGBA16 )\n\t{\n\t\tad = new FloatVectorData();\n\t\ta = &ad->writable(); a->resize( width * height );\n\t}\n\n\tunsigned int i = 0;\n\tfor( int y=height-1; y>=0; y-- )\n\t{\n\t\tfloat *rr = &r[y*width];\n\t\tfloat *rg = &g[y*width];\n\t\tfloat *rb = &b[y*width];\n\t\tfloat *ra = a ? &(*a)[y*width] : 0;\n\t\tfor( int x=0; x<width; x++ )\n\t\t{\n\t\t\trr[x] = data[i++];\n\t\t\trg[x] = data[i++];\n\t\t\trb[x] = data[i++];\n\t\t\tif( ra )\n\t\t\t{\n\t\t\t\tra[x] = data[i++];\n\t\t\t}\n\t\t}\n\t}\n\n\tBox2i imageExtents( V2i( 0, 0 ), V2i( width-1, height-1 ) );\n\tImagePrimitivePtr image = new ImagePrimitive( imageExtents, imageExtents );\n\timage->variables[\"R\"] = PrimitiveVariable( PrimitiveVariable::Vertex, rd );\n\timage->variables[\"G\"] = PrimitiveVariable( PrimitiveVariable::Vertex, gd );\n\timage->variables[\"B\"] = PrimitiveVariable( PrimitiveVariable::Vertex, bd );\n\tif( a )\n\t{\n\t\timage->variables[\"A\"] = PrimitiveVariable( PrimitiveVariable::Vertex, ad );\n\t}\n\n\tException::throwIfError();\n\t\n\treturn image;\n}\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\r\n * Copyright (c) 2008 Werner Mayer <werner.wm.mayer@gmx.de> *\r\n * *\r\n * This file is part of the FreeCAD CAx development system. *\r\n * *\r\n * This library is free software; you can redistribute it and\/or *\r\n * modify it under the terms of the GNU Library General Public *\r\n * License as published by the Free Software Foundation; either *\r\n * version 2 of the License, or (at your option) any later version. *\r\n * *\r\n * This library is distributed in the hope that it will be useful, *\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r\n * GNU Library General Public License for more details. *\r\n * *\r\n * You should have received a copy of the GNU Library General Public *\r\n * License along with this library; see the file COPYING.LIB. If not, *\r\n * write to the Free Software Foundation, Inc., 59 Temple Place, *\r\n * Suite 330, Boston, MA 02111-1307, USA *\r\n * *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <qobject.h>\r\n#endif\r\n\r\n#include \"Workbench.h\"\r\n#include <Gui\/ToolBarManager.h>\r\n#include <Gui\/MenuManager.h>\r\n\r\n\r\nusing namespace FemGui;\r\n\r\n#if 0 \/\/ needed for Qt's lupdate utility\r\n qApp->translate(\"Workbench\", \"FEM\");\r\n qApp->translate(\"Workbench\", \"&FEM\");\r\n#endif\r\n\r\n\/\/\/ @namespace FemGui @class Workbench\r\nTYPESYSTEM_SOURCE(FemGui::Workbench, Gui::StdWorkbench)\r\n\r\nWorkbench::Workbench()\r\n{\r\n}\r\n\r\nWorkbench::~Workbench()\r\n{\r\n}\r\n\r\nGui::ToolBarItem* Workbench::setupToolBars() const\r\n{\r\n Gui::ToolBarItem* root = StdWorkbench::setupToolBars();\r\n Gui::ToolBarItem* fem = new Gui::ToolBarItem(root);\r\n fem->setCommand(\"FEM\");\r\n *fem << \"Fem_MechanicalMaterial\"\r\n << \"Fem_NewMechanicalAnalysis\"\r\n << \"Fem_MechanicalJobControl\"\r\n << \"Separator\"\r\n << \"Fem_CreateNodesSet\"\r\n << \"Separator\"\r\n << \"Fem_ConstraintFixed\"\r\n << \"Fem_ConstraintForce\"\r\n << \"Fem_ConstraintBearing\"\r\n << \"Fem_ConstraintGear\" \r\n << \"Fem_ConstraintPulley\"\r\n << \"Separator\"\r\n << \"Fem_ShowResult\";\r\n return root;\r\n}\r\n\r\nGui::MenuItem* Workbench::setupMenuBar() const\r\n{\r\n Gui::MenuItem* root = StdWorkbench::setupMenuBar();\r\n Gui::MenuItem* item = root->findItem(\"&Windows\");\r\n Gui::MenuItem* fem = new Gui::MenuItem;\r\n root->insertItem(item, fem);\r\n fem->setCommand(\"&FEM\");\r\n *fem << \"Fem_MechanicalMaterial\"\r\n << \"Fem_NewMechanicalAnalysis\"\r\n << \"Fem_MechanicalJobControl\"\r\n << \"Separator\"\r\n << \"Fem_CreateNodesSet\"\r\n << \"Separator\"\r\n << \"Fem_ConstraintFixed\"\r\n << \"Fem_ConstraintForce\"\r\n << \"Fem_ConstraintBearing\"\r\n << \"Fem_ConstraintGear\" \r\n << \"Fem_ConstraintPulley\"\r\n << \"Separator\"\r\n << \"Fem_ShowResult\"\r\n ;\r\n\r\n return root;\r\n}\r\n<commit_msg>FEM: Change order of FEM toolbar items<commit_after>\/***************************************************************************\r\n * Copyright (c) 2008 Werner Mayer <werner.wm.mayer@gmx.de> *\r\n * *\r\n * This file is part of the FreeCAD CAx development system. *\r\n * *\r\n * This library is free software; you can redistribute it and\/or *\r\n * modify it under the terms of the GNU Library General Public *\r\n * License as published by the Free Software Foundation; either *\r\n * version 2 of the License, or (at your option) any later version. *\r\n * *\r\n * This library is distributed in the hope that it will be useful, *\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r\n * GNU Library General Public License for more details. *\r\n * *\r\n * You should have received a copy of the GNU Library General Public *\r\n * License along with this library; see the file COPYING.LIB. If not, *\r\n * write to the Free Software Foundation, Inc., 59 Temple Place, *\r\n * Suite 330, Boston, MA 02111-1307, USA *\r\n * *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <qobject.h>\r\n#endif\r\n\r\n#include \"Workbench.h\"\r\n#include <Gui\/ToolBarManager.h>\r\n#include <Gui\/MenuManager.h>\r\n\r\n\r\nusing namespace FemGui;\r\n\r\n#if 0 \/\/ needed for Qt's lupdate utility\r\n qApp->translate(\"Workbench\", \"FEM\");\r\n qApp->translate(\"Workbench\", \"&FEM\");\r\n#endif\r\n\r\n\/\/\/ @namespace FemGui @class Workbench\r\nTYPESYSTEM_SOURCE(FemGui::Workbench, Gui::StdWorkbench)\r\n\r\nWorkbench::Workbench()\r\n{\r\n}\r\n\r\nWorkbench::~Workbench()\r\n{\r\n}\r\n\r\nGui::ToolBarItem* Workbench::setupToolBars() const\r\n{\r\n Gui::ToolBarItem* root = StdWorkbench::setupToolBars();\r\n Gui::ToolBarItem* fem = new Gui::ToolBarItem(root);\r\n fem->setCommand(\"FEM\");\r\n *fem << \"Fem_NewMechanicalAnalysis\"\r\n << \"Fem_MechanicalMaterial\"\r\n << \"Separator\"\r\n << \"Fem_CreateNodesSet\"\r\n << \"Separator\"\r\n << \"Fem_ConstraintFixed\"\r\n << \"Fem_ConstraintForce\"\r\n << \"Fem_ConstraintBearing\"\r\n << \"Fem_ConstraintGear\" \r\n << \"Fem_ConstraintPulley\"\r\n << \"Separator\"\r\n << \"Fem_MechanicalJobControl\"\r\n << \"Fem_ShowResult\";\r\n return root;\r\n}\r\n\r\nGui::MenuItem* Workbench::setupMenuBar() const\r\n{\r\n Gui::MenuItem* root = StdWorkbench::setupMenuBar();\r\n Gui::MenuItem* item = root->findItem(\"&Windows\");\r\n Gui::MenuItem* fem = new Gui::MenuItem;\r\n root->insertItem(item, fem);\r\n fem->setCommand(\"&FEM\");\r\n *fem << \"Fem_NewMechanicalAnalysis\"\r\n << \"Fem_MechanicalMaterial\"\r\n << \"Separator\"\r\n << \"Fem_CreateNodesSet\"\r\n << \"Separator\"\r\n << \"Fem_ConstraintFixed\"\r\n << \"Fem_ConstraintForce\"\r\n << \"Fem_ConstraintBearing\"\r\n << \"Fem_ConstraintGear\" \r\n << \"Fem_ConstraintPulley\"\r\n << \"Separator\"\r\n << \"Fem_MechanicalJobControl\"\r\n << \"Fem_ShowResult\";\r\n\r\n return root;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * FPGAFitnessCalculator.cpp\n *\n * Created on: 26\/03\/2015\n * Author: Vitor\n *\/\n\n#include \"FPGAFitnessCalculator.h\"\n\nvoid FPGAFitnessCalculator::fitness(std::vector<Cromossomo>& populacao,\n\t\tint num_inputs, int le_num_inputs, int num_outputs) {\n\tcompilar(populacao, le_num_inputs);\n\n\tcarregar();\n\n\tint bauds = 115200;\n\tint comport_num = 6;\n\tchar mode[10] = \"8N1\";\n\tif (RS232_OpenComport(comport_num, bauds, mode)) {\n\t\tfprintf(stderr, \"Nao consegui abrir COM port %d\\n\", comport_num + 1);\n\t\texit(1);\n\t}\n\n\tfor (unsigned int i = 0; i < populacao.size(); i++) {\n\t\tRS232_SendByte(comport_num, (unsigned char) SET_CIRCUIT);\n\t\tRS232_SendByte(comport_num, (unsigned char) i);\n\t\tpopulacao[i].set_fitness(\n\t\t\t\tfitness_calculator(receive_data(num_inputs, comport_num)));\n\t}\n\n\tRS232_CloseComport(comport_num);\n}\n\nvoid FPGAFitnessCalculator::compilar(const std::vector<Cromossomo>& populacao,\n\t\tint le_num_inputs) {\n\tauto project_path = std::string(\"Verilog\/circ_gen\/\");\n\tgerar_arquivo_logic_e(project_path + \"logic_e.v\", le_num_inputs);\n\tfor (unsigned int i = 0; i < populacao.size(); i++) {\n\t\tpopulacao[i].criar_arquivo_verilog(\n\t\t\t\tproject_path + \"genetico\" + to_string(i) + \".v\",\n\t\t\t\t\"genetico\" + to_string(i));\n\t}\n\tauto system_call = std::string(\"quartus_map \") + project_path\n\t\t\t+ \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_map.\\n\";\n\t\texit(1);\n\t}\n\tsystem_call = std::string(\"quartus_fit \") + project_path + \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_fit.\\n\";\n\t\texit(1);\n\t}\n\tsystem_call = std::string(\"quartus_asm \") + project_path + \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_asm.\\n\";\n\t\texit(1);\n\t}\n}\n\nvoid FPGAFitnessCalculator::carregar() {\n\tauto project_path = std::string(\"Verilog\/circ_gen\/\");\n\tauto system_call = std::string(\"quartus_pgm -c USB-Blaster -m jtag -o p;\")\n\t\t\t+ project_path + \"circ_gen.sof > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_pgm.\\n\";\n\t\texit(1);\n\t}\n}\n\nstd::vector<std::vector<std::bitset<8>>> FPGAFitnessCalculator::receive_data(\n\t\tint num_inputs, int comport_num) {\n\tunsigned char buffer[4096];\n\tstd::vector<std::vector<std::bitset<8>>> results;\n\n\tfor (int i = 0; i < (int) pow(2, num_inputs); i++) {\n\t\tint total = 0;\n\t\tRS232_SendByte(comport_num, (unsigned char) SET_VALUE);\n\t\tRS232_SendByte(comport_num, (unsigned char) i);\n\t\tresults.emplace_back(std::vector<std::bitset<8>>());\n\n\t\tTimer timeout_timer;\n\t\ttimeout_timer.start(1000);\n\t\twhile (total < NUM_SAMPLES) {\n\t\t\ttimeout_timer.update();\n\t\t\tif (timeout_timer.isDone()) {\n\t\t\t\tstd::cout << \"TIMEOUT Detectado com \" << total << \" amostras coletadas.\" << std::endl;\n\t\t\t\tstd::cout << \"Replicando a ultima amostra.\" << std::endl;\n\t\t\t\tfor (int j = total; j < NUM_SAMPLES; j++) {\n\t\t\t\t\tresults[i].emplace_back(results[i][total - 1]);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint n = RS232_PollComport(comport_num, buffer, 4096);\n\t\t\tif (n != 0) { \/\/ Se dados foram recebidos\n\t\t\t\ttimeout_timer.start(1000);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++, total++) {\n\t\t\t\tresults[i].emplace_back(std::bitset<8>(buffer[j]));\n\t\t\t}\n\t\t}\n\n\t\tSleep(100);\n\t}\n\n\treturn results;\n}\n\nvoid replace(std::string& source, const std::string& to_replace,\n\t\tconst std::string& replace_with) {\n\tsource.replace(source.find(to_replace), to_replace.length(), replace_with);\n}\n\nvoid FPGAFitnessCalculator::cria_arquivo_genetico() {\n\tstd::ifstream arquivo_modelo(\"genetico_modelo\");\n\tstd::ofstream arquivo_resultado(\"genetico.v\");\n\tstd::stringstream buffer;\n\tbuffer << arquivo_modelo.rdbuf();\n\tauto arquivo_modelo_str = buffer.str();\n\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int tam_le = ceil(log2(genetic_params.num_funcs))\n\t\t\t+ ceil(log2(total_pinos)) * genetic_params.le_num_in;\n\n\treplace(arquivo_modelo_str, \"#tam_le\", to_string(tam_le - 1));\n\treplace(arquivo_modelo_str, \"#r_x_c\",\n\t\t\tto_string(genetic_params.r * genetic_params.c - 1));\n\treplace(arquivo_modelo_str, \"#num_in\",\n\t\t\tto_string(genetic_params.num_in - 1));\n\treplace(arquivo_modelo_str, \"#num_out\",\n\t\t\tto_string(genetic_params.num_out - 1));\n\treplace(arquivo_modelo_str, \"#num_out\",\n\t\t\tto_string(genetic_params.num_out - 1));\n\treplace(arquivo_modelo_str, \"#r_x_c\",\n\t\t\tto_string(genetic_params.r * genetic_params.c - 1));\n\treplace(arquivo_modelo_str, \"#bits_pinos\", to_string(bits_pinos - 1));\n\treplace(arquivo_modelo_str, \"#num_pinos\", to_string(total_pinos - 1));\n\treplace(arquivo_modelo_str, \"#all_inputs_for_out\", gera_string_saida());\n\treplace(arquivo_modelo_str, \"#les\", gera_les());\n\n\tarquivo_resultado << arquivo_modelo_str;\n}\n\nvoid FPGAFitnessCalculator::cria_arquivo_logic_e() {\n\tstd::ifstream arquivo_modelo(\"logic_e_modelo\");\n\tstd::ofstream arquivo_resultado(\"logic_e.v\");\n\tstd::stringstream buffer;\n\tbuffer << arquivo_modelo.rdbuf();\n\tauto arquivo_modelo_str = buffer.str();\n\n\tconst int bits_func = ceil(log2(genetic_params.num_funcs));\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int bits_inputs = bits_pinos * genetic_params.le_num_in;\n\n\treplace(arquivo_modelo_str, \"#bits_func\", to_string(bits_func - 1));\n\treplace(arquivo_modelo_str, \"#bits_inputs\", to_string(bits_inputs - 1));\n\treplace(arquivo_modelo_str, \"#total_pinos\", to_string(total_pinos - 1));\n\n\tstd::string output;\n\tfor (int i = genetic_params.le_num_in; i > 0; i--) {\n\t\tconst int current_max = (i * bits_pinos) - 1;\n\t\tconst int current_min = current_max - (bits_pinos - 1);\n\t\toutput += std::string(\"all_inputs[conf_ins[\") + to_string(current_max)\n\t\t\t\t+ \":\" + to_string(current_min) + \"]]\";\n\t\tif (i != 1) {\n\t\t\toutput += \", \";\n\t\t}\n\t}\n\n\treplace(arquivo_modelo_str, \"#all_inputs_le_out\", output);\n\n\tarquivo_resultado << arquivo_modelo_str;\n}\n\nstd::string FPGAFitnessCalculator::gera_string_saida() {\n\tstd::string resultado;\n\tfor (int i = genetic_params.num_out - 1; i >= 0; i--) {\n\t\tresultado += std::string(\"all_inputs[conf_outs[\") + to_string(i) + \"]]\";\n\t\tif (i != 0) {\n\t\t\tresultado += \", \";\n\t\t}\n\t}\n\treturn resultado;\n}\n\nstd::string FPGAFitnessCalculator::gera_les() {\n\tstd::string resultado;\n\tconst std::string base = std::string(\"logic_e le#r#c(\\n\")\n\t\t\t+ std::string(\"\\t.conf_func(conf_les[#n][#bits_top:#bits_next]),\\n\")\n\t\t\t+ std::string(\"\\t.conf_ins(conf_les[#n][#bits_rest:0]),\\n\")\n\t\t\t+ std::string(\"\\t.all_inputs(all_inputs),\\n\")\n\t\t\t+ std::string(\"\\t.out(le_out[#n])\\n\") + \");\\n\\n\";\n\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int bits_func = ceil(log2(genetic_params.num_funcs));\n\tconst int bits_top = bits_func + genetic_params.le_num_in * bits_pinos;\n\n\tfor (unsigned int j = 0; j < genetic_params.c; j++) {\n\t\tfor (unsigned int i = 0; i < genetic_params.r; i++) {\n\t\t\tconst int current = j * genetic_params.r + i;\n\t\t\tauto current_le = base;\n\t\t\treplace(current_le, \"#r\", to_string(i));\n\t\t\treplace(current_le, \"#c\", to_string(j));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#bits_top\", to_string(bits_top - 1));\n\t\t\treplace(current_le, \"#bits_next\", to_string(bits_top - bits_func));\n\t\t\treplace(current_le, \"#bits_rest\", to_string((bits_top - bits_func) - 1));\n\t\t\tresultado += current_le;\n\t\t}\n\t}\n\n\treturn resultado;\n}\n<commit_msg>Corrigida criacao da saida do logic_e.<commit_after>\/*\n * FPGAFitnessCalculator.cpp\n *\n * Created on: 26\/03\/2015\n * Author: Vitor\n *\/\n\n#include \"FPGAFitnessCalculator.h\"\n\nvoid FPGAFitnessCalculator::fitness(std::vector<Cromossomo>& populacao,\n\t\tint num_inputs, int le_num_inputs, int num_outputs) {\n\tcompilar(populacao, le_num_inputs);\n\n\tcarregar();\n\n\tint bauds = 115200;\n\tint comport_num = 6;\n\tchar mode[10] = \"8N1\";\n\tif (RS232_OpenComport(comport_num, bauds, mode)) {\n\t\tfprintf(stderr, \"Nao consegui abrir COM port %d\\n\", comport_num + 1);\n\t\texit(1);\n\t}\n\n\tfor (unsigned int i = 0; i < populacao.size(); i++) {\n\t\tRS232_SendByte(comport_num, (unsigned char) SET_CIRCUIT);\n\t\tRS232_SendByte(comport_num, (unsigned char) i);\n\t\tpopulacao[i].set_fitness(\n\t\t\t\tfitness_calculator(receive_data(num_inputs, comport_num)));\n\t}\n\n\tRS232_CloseComport(comport_num);\n}\n\nvoid FPGAFitnessCalculator::compilar(const std::vector<Cromossomo>& populacao,\n\t\tint le_num_inputs) {\n\tauto project_path = std::string(\"Verilog\/circ_gen\/\");\n\tgerar_arquivo_logic_e(project_path + \"logic_e.v\", le_num_inputs);\n\tfor (unsigned int i = 0; i < populacao.size(); i++) {\n\t\tpopulacao[i].criar_arquivo_verilog(\n\t\t\t\tproject_path + \"genetico\" + to_string(i) + \".v\",\n\t\t\t\t\"genetico\" + to_string(i));\n\t}\n\tauto system_call = std::string(\"quartus_map \") + project_path\n\t\t\t+ \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_map.\\n\";\n\t\texit(1);\n\t}\n\tsystem_call = std::string(\"quartus_fit \") + project_path + \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_fit.\\n\";\n\t\texit(1);\n\t}\n\tsystem_call = std::string(\"quartus_asm \") + project_path + \"circ_gen > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_asm.\\n\";\n\t\texit(1);\n\t}\n}\n\nvoid FPGAFitnessCalculator::carregar() {\n\tauto project_path = std::string(\"Verilog\/circ_gen\/\");\n\tauto system_call = std::string(\"quartus_pgm -c USB-Blaster -m jtag -o p;\")\n\t\t\t+ project_path + \"circ_gen.sof > NUL\";\n\tif (system(system_call.c_str()) != 0) {\n\t\tstd::cerr << \"Erro na chamada quartus_pgm.\\n\";\n\t\texit(1);\n\t}\n}\n\nstd::vector<std::vector<std::bitset<8>>> FPGAFitnessCalculator::receive_data(\n\t\tint num_inputs, int comport_num) {\n\tunsigned char buffer[4096];\n\tstd::vector<std::vector<std::bitset<8>>> results;\n\n\tfor (int i = 0; i < (int) pow(2, num_inputs); i++) {\n\t\tint total = 0;\n\t\tRS232_SendByte(comport_num, (unsigned char) SET_VALUE);\n\t\tRS232_SendByte(comport_num, (unsigned char) i);\n\t\tresults.emplace_back(std::vector<std::bitset<8>>());\n\n\t\tTimer timeout_timer;\n\t\ttimeout_timer.start(1000);\n\t\twhile (total < NUM_SAMPLES) {\n\t\t\ttimeout_timer.update();\n\t\t\tif (timeout_timer.isDone()) {\n\t\t\t\tstd::cout << \"TIMEOUT Detectado com \" << total << \" amostras coletadas.\" << std::endl;\n\t\t\t\tstd::cout << \"Replicando a ultima amostra.\" << std::endl;\n\t\t\t\tfor (int j = total; j < NUM_SAMPLES; j++) {\n\t\t\t\t\tresults[i].emplace_back(results[i][total - 1]);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tint n = RS232_PollComport(comport_num, buffer, 4096);\n\t\t\tif (n != 0) { \/\/ Se dados foram recebidos\n\t\t\t\ttimeout_timer.start(1000);\n\t\t\t}\n\t\t\tfor (int j = 0; j < n; j++, total++) {\n\t\t\t\tresults[i].emplace_back(std::bitset<8>(buffer[j]));\n\t\t\t}\n\t\t}\n\n\t\tSleep(100);\n\t}\n\n\treturn results;\n}\n\nvoid replace(std::string& source, const std::string& to_replace,\n\t\tconst std::string& replace_with) {\n\tsource.replace(source.find(to_replace), to_replace.length(), replace_with);\n}\n\nvoid FPGAFitnessCalculator::cria_arquivo_genetico() {\n\tstd::ifstream arquivo_modelo(\"genetico_modelo\");\n\tstd::ofstream arquivo_resultado(\"genetico.v\");\n\tstd::stringstream buffer;\n\tbuffer << arquivo_modelo.rdbuf();\n\tauto arquivo_modelo_str = buffer.str();\n\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int tam_le = ceil(log2(genetic_params.num_funcs))\n\t\t\t+ ceil(log2(total_pinos)) * genetic_params.le_num_in;\n\n\treplace(arquivo_modelo_str, \"#tam_le\", to_string(tam_le - 1));\n\treplace(arquivo_modelo_str, \"#r_x_c\",\n\t\t\tto_string(genetic_params.r * genetic_params.c - 1));\n\treplace(arquivo_modelo_str, \"#num_in\",\n\t\t\tto_string(genetic_params.num_in - 1));\n\treplace(arquivo_modelo_str, \"#num_out\",\n\t\t\tto_string(genetic_params.num_out - 1));\n\treplace(arquivo_modelo_str, \"#num_out\",\n\t\t\tto_string(genetic_params.num_out - 1));\n\treplace(arquivo_modelo_str, \"#r_x_c\",\n\t\t\tto_string(genetic_params.r * genetic_params.c - 1));\n\treplace(arquivo_modelo_str, \"#bits_pinos\", to_string(bits_pinos - 1));\n\treplace(arquivo_modelo_str, \"#num_pinos\", to_string(total_pinos - 1));\n\treplace(arquivo_modelo_str, \"#all_inputs_for_out\", gera_string_saida());\n\treplace(arquivo_modelo_str, \"#les\", gera_les());\n\n\tarquivo_resultado << arquivo_modelo_str;\n}\n\nvoid FPGAFitnessCalculator::cria_arquivo_logic_e() {\n\tstd::ifstream arquivo_modelo(\"logic_e_modelo\");\n\tstd::ofstream arquivo_resultado(\"logic_e.v\");\n\tstd::stringstream buffer;\n\tbuffer << arquivo_modelo.rdbuf();\n\tauto arquivo_modelo_str = buffer.str();\n\n\tconst int bits_func = ceil(log2(genetic_params.num_funcs));\n\tconst int bits_bits_func = log2(bits_func);\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int bits_inputs = bits_pinos * genetic_params.le_num_in;\n\n\treplace(arquivo_modelo_str, \"#bits_func\", to_string(bits_func - 1));\n\treplace(arquivo_modelo_str, \"#bits_inputs\", to_string(bits_inputs - 1));\n\treplace(arquivo_modelo_str, \"#total_pinos\", to_string(total_pinos - 1));\n\n\tstd::string output;\n\tfor (int i = bits_bits_func; i > 0; i--) {\n\t\tconst int current_max = (i * bits_pinos) - 1;\n\t\tconst int current_min = current_max - (bits_pinos - 1);\n\t\toutput += std::string(\"all_inputs[conf_ins[\") + to_string(current_max)\n\t\t\t\t+ \":\" + to_string(current_min) + \"]]\";\n\t\tif (i != 1) {\n\t\t\toutput += \", \";\n\t\t}\n\t}\n\n\treplace(arquivo_modelo_str, \"#all_inputs_le_out\", output);\n\n\tarquivo_resultado << arquivo_modelo_str;\n}\n\nstd::string FPGAFitnessCalculator::gera_string_saida() {\n\tstd::string resultado;\n\tfor (int i = genetic_params.num_out - 1; i >= 0; i--) {\n\t\tresultado += std::string(\"all_inputs[conf_outs[\") + to_string(i) + \"]]\";\n\t\tif (i != 0) {\n\t\t\tresultado += \", \";\n\t\t}\n\t}\n\treturn resultado;\n}\n\nstd::string FPGAFitnessCalculator::gera_les() {\n\tstd::string resultado;\n\tconst std::string base = std::string(\"logic_e le#r#c(\\n\")\n\t\t\t+ std::string(\"\\t.conf_func(conf_les[#n][#bits_top:#bits_next]),\\n\")\n\t\t\t+ std::string(\"\\t.conf_ins(conf_les[#n][#bits_rest:0]),\\n\")\n\t\t\t+ std::string(\"\\t.all_inputs(all_inputs),\\n\")\n\t\t\t+ std::string(\"\\t.out(le_out[#n])\\n\") + \");\\n\\n\";\n\n\tconst int total_pinos = genetic_params.r * genetic_params.c\n\t\t\t+ genetic_params.num_in;\n\tconst int bits_pinos = ceil(log2(total_pinos));\n\tconst int bits_func = ceil(log2(genetic_params.num_funcs));\n\tconst int bits_top = bits_func + genetic_params.le_num_in * bits_pinos;\n\n\tfor (unsigned int j = 0; j < genetic_params.c; j++) {\n\t\tfor (unsigned int i = 0; i < genetic_params.r; i++) {\n\t\t\tconst int current = j * genetic_params.r + i;\n\t\t\tauto current_le = base;\n\t\t\treplace(current_le, \"#r\", to_string(i));\n\t\t\treplace(current_le, \"#c\", to_string(j));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#n\", to_string(current));\n\t\t\treplace(current_le, \"#bits_top\", to_string(bits_top - 1));\n\t\t\treplace(current_le, \"#bits_next\", to_string(bits_top - bits_func));\n\t\t\treplace(current_le, \"#bits_rest\", to_string((bits_top - bits_func) - 1));\n\t\t\tresultado += current_le;\n\t\t}\n\t}\n\n\treturn resultado;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"math.h\"\n#include \"stdlib.h\"\n#include \"sys\/time.h\"\n#include \"time.h\"\n#include \"time.h\"\n#include \"string.h\"\n#include \"stdio.h\"\n#include \"stdint.h\"\n#include \"jni.h\"\n#include \"jni-util.h\"\n\n#ifdef WIN32\n# include \"windows.h\"\n#else\n# undef JNIEXPORT\n# define JNIEXPORT __attribute__ ((visibility(\"default\")))\n#endif\n\n#ifdef WIN32\n# define SO_PREFIX \"\"\n#else\n# define SO_PREFIX \"lib\"\n#endif\n\n#ifdef __APPLE__\n# define SO_SUFFIX \".jnilib\"\n#elif defined WIN32\n# define SO_SUFFIX \".dll\"\n#else\n# define SO_SUFFIX \".so\"\n#endif\n\nextern \"C\" JNIEXPORT jstring JNICALL\nJava_java_lang_System_getProperty(JNIEnv* e, jclass, jint code)\n{\n enum {\n LineSeparator = 100,\n FileSeparator = 101,\n OsName = 102,\n JavaIoTmpdir = 103,\n UserHome = 104\n };\n\n switch (code) {\n#ifdef WIN32 \n case LineSeparator:\n return e->NewStringUTF(\"\\r\\n\");\n \n case FileSeparator:\n return e->NewStringUTF(\"\\\\\");\n \n case OsName:\n return e->NewStringUTF(\"Windows\");\n\n case JavaIoTmpdir: {\n TCHAR buffer[MAX_PATH];\n GetTempPath(MAX_PATH, buffer);\n return e->NewStringUTF(buffer);\n }\n\n case UserHome: {\n LPWSTR home = _wgetenv(L\"USERPROFILE\");\n return e->NewString(reinterpret_cast<jchar*>(home), lstrlenW(home));\n }\n#else\n case LineSeparator:\n return e->NewStringUTF(\"\\n\");\n\n case FileSeparator:\n return e->NewStringUTF(\"\/\");\n\n case OsName:\n return e->NewStringUTF(\"posix\");\n\n case JavaIoTmpdir:\n return e->NewStringUTF(\"\/tmp\");\n\n case UserHome:\n return e->NewStringUTF(getenv(\"HOME\"));\n }\n#endif\n\n default:\n throwNew(e, \"java\/lang\/RuntimeException\", 0);\n return 0;\n }\n}\n\nextern \"C\" JNIEXPORT jlong JNICALL\nJava_java_lang_System_currentTimeMillis(JNIEnv*, jclass)\n{\n#ifdef WIN32\n static LARGE_INTEGER frequency;\n static LARGE_INTEGER time;\n static bool init = true;\n\n if (init) {\n QueryPerformanceFrequency(&frequency);\n\n if (frequency.QuadPart == 0) {\n return 0; \n }\n\n init = false;\n }\n\n QueryPerformanceCounter(&time);\n return static_cast<int64_t>\n (((static_cast<double>(time.QuadPart)) * 1000.0) \/\n (static_cast<double>(frequency.QuadPart)));\n#else\n timeval tv = { 0, 0 };\n gettimeofday(&tv, 0);\n return (static_cast<jlong>(tv.tv_sec) * 1000) +\n (static_cast<jlong>(tv.tv_usec) \/ 1000);\n#endif\n}\n\nextern \"C\" JNIEXPORT jstring JNICALL\nJava_java_lang_System_doMapLibraryName(JNIEnv* e, jclass, jstring name)\n{\n jstring r = 0;\n const char* chars = e->GetStringUTFChars(name, 0);\n if (chars) {\n unsigned nameLength = strlen(chars);\n unsigned size = sizeof(SO_PREFIX) + nameLength + sizeof(SO_SUFFIX);\n char buffer[size];\n snprintf(buffer, size, SO_PREFIX \"%s\" SO_SUFFIX, chars);\n r = e->NewStringUTF(buffer);\n\n e->ReleaseStringUTFChars(name, chars);\n }\n return r;\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_sin(JNIEnv*, jclass, jdouble val)\n{\n return sin(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_sqrt(JNIEnv*, jclass, jdouble val)\n{\n return sqrt(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_pow(JNIEnv*, jclass, jdouble val, jdouble exp)\n{\n return pow(val, exp);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_floor(JNIEnv*, jclass, jdouble val)\n{\n return floor(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_ceil(JNIEnv*, jclass, jdouble val)\n{\n return ceil(val);\n}\n\nextern \"C\" JNIEXPORT jint JNICALL\nJava_java_lang_Double_fillBufferWithDouble(JNIEnv* e, jclass, jdouble val,\n\t\t\t\t\t jbyteArray buffer, jint bufferSize) {\n jboolean isCopy;\n jbyte* buf = e->GetByteArrayElements(buffer, &isCopy);\n jint count = snprintf(reinterpret_cast<char*>(buf), bufferSize, \"%g\", val);\n e->ReleaseByteArrayElements(buffer, buf, 0);\n return count;\n}\n<commit_msg>fix unix build breakage<commit_after>#include \"math.h\"\n#include \"stdlib.h\"\n#include \"sys\/time.h\"\n#include \"time.h\"\n#include \"time.h\"\n#include \"string.h\"\n#include \"stdio.h\"\n#include \"stdint.h\"\n#include \"jni.h\"\n#include \"jni-util.h\"\n\n#ifdef WIN32\n# include \"windows.h\"\n#else\n# undef JNIEXPORT\n# define JNIEXPORT __attribute__ ((visibility(\"default\")))\n#endif\n\n#ifdef WIN32\n# define SO_PREFIX \"\"\n#else\n# define SO_PREFIX \"lib\"\n#endif\n\n#ifdef __APPLE__\n# define SO_SUFFIX \".jnilib\"\n#elif defined WIN32\n# define SO_SUFFIX \".dll\"\n#else\n# define SO_SUFFIX \".so\"\n#endif\n\nextern \"C\" JNIEXPORT jstring JNICALL\nJava_java_lang_System_getProperty(JNIEnv* e, jclass, jint code)\n{\n enum {\n LineSeparator = 100,\n FileSeparator = 101,\n OsName = 102,\n JavaIoTmpdir = 103,\n UserHome = 104\n };\n\n switch (code) {\n#ifdef WIN32 \n case LineSeparator:\n return e->NewStringUTF(\"\\r\\n\");\n \n case FileSeparator:\n return e->NewStringUTF(\"\\\\\");\n \n case OsName:\n return e->NewStringUTF(\"Windows\");\n\n case JavaIoTmpdir: {\n TCHAR buffer[MAX_PATH];\n GetTempPath(MAX_PATH, buffer);\n return e->NewStringUTF(buffer);\n }\n\n case UserHome: {\n LPWSTR home = _wgetenv(L\"USERPROFILE\");\n return e->NewString(reinterpret_cast<jchar*>(home), lstrlenW(home));\n }\n#else\n case LineSeparator:\n return e->NewStringUTF(\"\\n\");\n\n case FileSeparator:\n return e->NewStringUTF(\"\/\");\n\n case OsName:\n return e->NewStringUTF(\"posix\");\n\n case JavaIoTmpdir:\n return e->NewStringUTF(\"\/tmp\");\n\n case UserHome:\n return e->NewStringUTF(getenv(\"HOME\"));\n#endif\n\n default:\n throwNew(e, \"java\/lang\/RuntimeException\", 0);\n return 0;\n }\n}\n\nextern \"C\" JNIEXPORT jlong JNICALL\nJava_java_lang_System_currentTimeMillis(JNIEnv*, jclass)\n{\n#ifdef WIN32\n static LARGE_INTEGER frequency;\n static LARGE_INTEGER time;\n static bool init = true;\n\n if (init) {\n QueryPerformanceFrequency(&frequency);\n\n if (frequency.QuadPart == 0) {\n return 0; \n }\n\n init = false;\n }\n\n QueryPerformanceCounter(&time);\n return static_cast<int64_t>\n (((static_cast<double>(time.QuadPart)) * 1000.0) \/\n (static_cast<double>(frequency.QuadPart)));\n#else\n timeval tv = { 0, 0 };\n gettimeofday(&tv, 0);\n return (static_cast<jlong>(tv.tv_sec) * 1000) +\n (static_cast<jlong>(tv.tv_usec) \/ 1000);\n#endif\n}\n\nextern \"C\" JNIEXPORT jstring JNICALL\nJava_java_lang_System_doMapLibraryName(JNIEnv* e, jclass, jstring name)\n{\n jstring r = 0;\n const char* chars = e->GetStringUTFChars(name, 0);\n if (chars) {\n unsigned nameLength = strlen(chars);\n unsigned size = sizeof(SO_PREFIX) + nameLength + sizeof(SO_SUFFIX);\n char buffer[size];\n snprintf(buffer, size, SO_PREFIX \"%s\" SO_SUFFIX, chars);\n r = e->NewStringUTF(buffer);\n\n e->ReleaseStringUTFChars(name, chars);\n }\n return r;\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_sin(JNIEnv*, jclass, jdouble val)\n{\n return sin(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_sqrt(JNIEnv*, jclass, jdouble val)\n{\n return sqrt(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_pow(JNIEnv*, jclass, jdouble val, jdouble exp)\n{\n return pow(val, exp);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_floor(JNIEnv*, jclass, jdouble val)\n{\n return floor(val);\n}\n\nextern \"C\" JNIEXPORT jdouble JNICALL\nJava_java_lang_Math_ceil(JNIEnv*, jclass, jdouble val)\n{\n return ceil(val);\n}\n\nextern \"C\" JNIEXPORT jint JNICALL\nJava_java_lang_Double_fillBufferWithDouble(JNIEnv* e, jclass, jdouble val,\n\t\t\t\t\t jbyteArray buffer, jint bufferSize) {\n jboolean isCopy;\n jbyte* buf = e->GetByteArrayElements(buffer, &isCopy);\n jint count = snprintf(reinterpret_cast<char*>(buf), bufferSize, \"%g\", val);\n e->ReleaseByteArrayElements(buffer, buf, 0);\n return count;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Arduino.h\"\n#include \"Display.h\"\n\n#define DIGIT_ON HIGH\n#define DIGIT_OFF LOW\n\n#define SEGMENT_ON LOW\n#define SEGMENT_OFF HIGH\n\nDisplay::Display() {\n pinMode(PIN_DISPLAY_SEGMENT_A, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_B, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_C, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_D, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_E, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_F, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_G, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_COLON, OUTPUT);\n\n pinMode(PIN_DISPLAY_DIGIT_1, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_2, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_3, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_4, OUTPUT);\n\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_OFF);\n}\n\nvoid Display::display_text(char* text) {\n \/\/ Serial.println(text);\n\n _pause_if_required();\n\n _display_digit(PIN_DISPLAY_DIGIT_1, text[0]);\n _display_digit(PIN_DISPLAY_DIGIT_2, text[1]);\n _display_digit(PIN_DISPLAY_DIGIT_3, text[2]);\n _display_digit(PIN_DISPLAY_DIGIT_4, text[3]);\n}\n\nvoid Display::display_time(int toDisplay) {\n\n\n int minutes = toDisplay \/ 60;\n int seconds = toDisplay % 60;\n char numbers_as_letters[] = \"0123456789\";\n\n _pause_if_required();\n _display_digit(PIN_DISPLAY_DIGIT_1, ':');\n _display_digit(PIN_DISPLAY_DIGIT_1, numbers_as_letters[minutes \/ 10 % 10]);\n _display_digit(PIN_DISPLAY_DIGIT_2, numbers_as_letters[minutes % 10 ]);\n _display_digit(PIN_DISPLAY_DIGIT_3, numbers_as_letters[seconds \/ 10 ]);\n _display_digit(PIN_DISPLAY_DIGIT_4, numbers_as_letters[seconds % 10 ]);\n}\n\nvoid Display::_pause_if_required() {\n \/\/ Pause if the display has been painted too recently;\n while( (millis() - _display_last_painted) < DISPLAY_LOOP_TIME) ;\n _display_last_painted = millis();\n}\n\nvoid Display::_display_digit(int digit, char toDisplay) {\n digitalWrite(digit, DIGIT_ON);\n _turn_segments_on(toDisplay);\n delayMicroseconds(DISPLAY_BRIGHTNESS);\n digitalWrite(digit, DIGIT_OFF);\n _turn_all_segments_off();\n}\n\nvoid Display::_turn_all_segments_off () {\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_OFF);\n}\n\n\/\/ Given a number, turns on those segments\nvoid Display::_turn_segments_on(char charToDisplay) {\n\n \/\/ TODO - change all these to use a byte per char and the bits in the byte to\n \/\/ represent the segments in the LED display.\n\n switch (charToDisplay) {\n\n case ' ':\n case 0: \/\/ nul\n _turn_all_segments_off();\n break;\n\n case '0':\n case 'O':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n break;\n\n case '1':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n break;\n\n case '2':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '3':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '4':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '5':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '6':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '7':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n break;\n\n case '8':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '9':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'B':\n case 'b':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'i':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n break;\n\n case 'E':\n case 'e':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'F':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'l':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n break;\n\n case 'o':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'R':\n case 'r':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'Y':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'v':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n break;\n\n case ':': \/\/ Only works when PIN_DISPLAY_DIGIT_1 in active...\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_ON);\n break;\n\n default:\n Serial.print(\"ERROR - can't light up segment for ascii decimal '\");\n Serial.print((int)charToDisplay);\n Serial.println(\"'\");\n break;\n\n }\n}\n<commit_msg>Tweak so that all segments stay on the same length of time.<commit_after>#include \"Arduino.h\"\n#include \"Display.h\"\n\n#define DIGIT_ON HIGH\n#define DIGIT_OFF LOW\n\n#define SEGMENT_ON LOW\n#define SEGMENT_OFF HIGH\n\nDisplay::Display() {\n pinMode(PIN_DISPLAY_SEGMENT_A, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_B, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_C, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_D, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_E, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_F, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_G, OUTPUT);\n pinMode(PIN_DISPLAY_SEGMENT_COLON, OUTPUT);\n\n pinMode(PIN_DISPLAY_DIGIT_1, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_2, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_3, OUTPUT);\n pinMode(PIN_DISPLAY_DIGIT_4, OUTPUT);\n\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_OFF);\n}\n\nvoid Display::display_text(char* text) {\n \/\/ Serial.println(text);\n\n _pause_if_required();\n\n _display_digit(PIN_DISPLAY_DIGIT_1, text[0]);\n _display_digit(PIN_DISPLAY_DIGIT_2, text[1]);\n _display_digit(PIN_DISPLAY_DIGIT_3, text[2]);\n _display_digit(PIN_DISPLAY_DIGIT_4, text[3]);\n}\n\nvoid Display::display_time(int toDisplay) {\n\n\n int minutes = toDisplay \/ 60;\n int seconds = toDisplay % 60;\n char numbers_as_letters[] = \"0123456789\";\n\n _pause_if_required();\n _display_digit(PIN_DISPLAY_DIGIT_1, ':');\n _display_digit(PIN_DISPLAY_DIGIT_1, numbers_as_letters[minutes \/ 10 % 10]);\n _display_digit(PIN_DISPLAY_DIGIT_2, numbers_as_letters[minutes % 10 ]);\n _display_digit(PIN_DISPLAY_DIGIT_3, numbers_as_letters[seconds \/ 10 ]);\n _display_digit(PIN_DISPLAY_DIGIT_4, numbers_as_letters[seconds % 10 ]);\n}\n\nvoid Display::_pause_if_required() {\n \/\/ Pause if the display has been painted too recently;\n while( (millis() - _display_last_painted) < DISPLAY_LOOP_TIME) ;\n _display_last_painted = millis();\n}\n\nvoid Display::_display_digit(int digit, char toDisplay) {\n _turn_segments_on(toDisplay);\n digitalWrite(digit, DIGIT_ON);\n delayMicroseconds(DISPLAY_BRIGHTNESS);\n digitalWrite(digit, DIGIT_OFF);\n _turn_all_segments_off();\n}\n\nvoid Display::_turn_all_segments_off () {\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_OFF);\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_OFF);\n}\n\n\/\/ Given a number, turns on those segments\nvoid Display::_turn_segments_on(char charToDisplay) {\n\n \/\/ TODO - change all these to use a byte per char and the bits in the byte to\n \/\/ represent the segments in the LED display.\n\n switch (charToDisplay) {\n\n case ' ':\n case 0: \/\/ nul\n _turn_all_segments_off();\n break;\n\n case '0':\n case 'O':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n break;\n\n case '1':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n break;\n\n case '2':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '3':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '4':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '5':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '6':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '7':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n break;\n\n case '8':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case '9':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'B':\n case 'b':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'i':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n break;\n\n case 'E':\n case 'e':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'F':\n digitalWrite(PIN_DISPLAY_SEGMENT_A, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'l':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n break;\n\n case 'o':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'R':\n case 'r':\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'Y':\n digitalWrite(PIN_DISPLAY_SEGMENT_B, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_F, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_G, SEGMENT_ON);\n break;\n\n case 'v':\n digitalWrite(PIN_DISPLAY_SEGMENT_C, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_D, SEGMENT_ON);\n digitalWrite(PIN_DISPLAY_SEGMENT_E, SEGMENT_ON);\n break;\n\n case ':': \/\/ Only works when PIN_DISPLAY_DIGIT_1 in active...\n digitalWrite(PIN_DISPLAY_SEGMENT_COLON, SEGMENT_ON);\n break;\n\n default:\n Serial.print(\"ERROR - can't light up segment for ascii decimal '\");\n Serial.print((int)charToDisplay);\n Serial.println(\"'\");\n break;\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before> \/*\n * BWCSentence.cpp\n * \n * (C) Copyright 2016 Pavel Bobov.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <Time.h>\n\n#include \"Nmea.h\"\n#include \"StrUtils.h\"\n\nBWCSentence::BWCSentence() : Sentence(\"GP\", NMEA_BWC) {\n waypointId[0] = '\\0';\n}\n\nBWCSentence::~BWCSentence() {\n}\n\nchar* BWCSentence::get(char str[], size_t buflen) const {\n if (str == NULL || buflen < NMEA_MAX_LENGTH)\n return NULL;\n \n str[0] = '$';\n str[1] = '\\0';\n strcat(str, talker);\n strcat(str, tag);\n\n addComma(str);\n\n timeToString(datetime, milliseconds, strchr(str, '\\0'));\n\n addComma(str);\n \n pointToString(waypoint, strchr(str, '\\0'));\n\n addComma(str);\n\n if (bearingTrue >= 0)\n ftoa(bearingTrue, strchr(str, '\\0'), 2);\n\n addComma(str);\n \n strcat(str, \"T\");\n\n addComma(str);\n\n if (bearingMagnetic >= 0)\n ftoa(bearingMagnetic, strchr(str, '\\0'), 2);\n\n addComma(str);\n \n strcat(str, \"M\");\n\n addComma(str);\n\n if (distance >= 0)\n ftoa(distance, strchr(str, '\\0'), 2);\n \n addComma(str);\n\n strcat(str, \"N\");\n\n addComma(str);\n\n strcat(str, waypointId);\n \n return addChecksum(str);\n}\n\nbool BWCSentence::set(const char nmea[]) {\n if (!valid(nmea))\n return false;\n\n if (!matches(nmea))\n return false;\n \n const char *p = nmea;\n\n \/\/ get time\n p = nextToken(p);\n\n p = parseTime(p, datetime, milliseconds);\n \n p = parsePoint(p, waypoint);\n\n if (',' != *p)\n bearingTrue = atof(p);\n else \n bearingTrue = -1;\n \n p = nextToken(p);\n p = nextToken(p);\n\n if (',' != *p)\n bearingMagnetic = atof(p);\n else \n bearingMagnetic = -1;\n \n p = nextToken(p);\n p = nextToken(p);\n\n if (',' != *p)\n distance = atof(p);\n else \n distance = -1;\n\n p = nextToken(p);\n p = nextToken(p);\n \n if (',' != *p)\n strncpy(waypointId, p, strchr(p, '*') - p);\n else \n waypointId[0] = '\\0';\n \n return true;\n}\n\n<commit_msg>Added members initialization to BWCSentence constructor<commit_after> \/*\n * BWCSentence.cpp\n * \n * (C) Copyright 2016 Pavel Bobov.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <Time.h>\n\n#include \"Nmea.h\"\n#include \"StrUtils.h\"\n\nBWCSentence::BWCSentence() : Sentence(\"GP\", NMEA_BWC),\n bearingMagnetic(-1), bearingTrue(-1), milliseconds(0), distance(-1) {\n waypointId[0] = '\\0';\n}\n\nBWCSentence::~BWCSentence() {\n}\n\nchar* BWCSentence::get(char str[], size_t buflen) const {\n if (str == NULL || buflen < NMEA_MAX_LENGTH)\n return NULL;\n \n str[0] = '$';\n str[1] = '\\0';\n strcat(str, talker);\n strcat(str, tag);\n\n addComma(str);\n\n timeToString(datetime, milliseconds, strchr(str, '\\0'));\n\n addComma(str);\n \n pointToString(waypoint, strchr(str, '\\0'));\n\n addComma(str);\n\n if (bearingTrue >= 0)\n ftoa(bearingTrue, strchr(str, '\\0'), 2);\n\n addComma(str);\n \n strcat(str, \"T\");\n\n addComma(str);\n\n if (bearingMagnetic >= 0)\n ftoa(bearingMagnetic, strchr(str, '\\0'), 2);\n\n addComma(str);\n \n strcat(str, \"M\");\n\n addComma(str);\n\n if (distance >= 0)\n ftoa(distance, strchr(str, '\\0'), 2);\n \n addComma(str);\n\n strcat(str, \"N\");\n\n addComma(str);\n\n strcat(str, waypointId);\n \n return addChecksum(str);\n}\n\nbool BWCSentence::set(const char nmea[]) {\n if (!valid(nmea))\n return false;\n\n if (!matches(nmea))\n return false;\n \n const char *p = nmea;\n\n \/\/ get time\n p = nextToken(p);\n\n p = parseTime(p, datetime, milliseconds);\n \n p = parsePoint(p, waypoint);\n\n if (',' != *p)\n bearingTrue = atof(p);\n else \n bearingTrue = -1;\n \n p = nextToken(p);\n p = nextToken(p);\n\n if (',' != *p)\n bearingMagnetic = atof(p);\n else \n bearingMagnetic = -1;\n \n p = nextToken(p);\n p = nextToken(p);\n\n if (',' != *p)\n distance = atof(p);\n else \n distance = -1;\n\n p = nextToken(p);\n p = nextToken(p);\n \n if (',' != *p)\n strncpy(waypointId, p, strchr(p, '*') - p);\n else \n waypointId[0] = '\\0';\n \n return true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* ---------------------------------------------------------------------------\n** This software is in the public domain, furnished \"as is\", without technical\n** support, and with no warranty, express or implied, as to its usefulness for\n** any purpose.\n**\n** ServerMediaSubsession.cpp\n** \n** -------------------------------------------------------------------------*\/\n\n#include <sstream>\n#include <linux\/videodev2.h>\n\n\/\/ project\n#include \"ServerMediaSubsession.h\"\n#include \"MJPEGVideoSource.h\"\n#include \"DeviceSource.h\"\n\n\/\/ ---------------------------------\n\/\/ BaseServerMediaSubsession\n\/\/ ---------------------------------\nFramedSource* BaseServerMediaSubsession::createSource(UsageEnvironment& env, FramedSource* videoES, const std::string& format)\n{\n\tFramedSource* source = NULL;\n\tif (format == \"video\/MP2T\")\n\t{\n\t\tsource = MPEG2TransportStreamFramer::createNew(env, videoES); \n\t}\n\telse if (format == \"video\/H264\")\n\t{\n\t\tsource = H264VideoStreamDiscreteFramer::createNew(env, videoES);\n\t}\n#if LIVEMEDIA_LIBRARY_VERSION_INT > 1414454400\n\telse if (format == \"video\/H265\")\n\t{\n\t\tsource = H265VideoStreamDiscreteFramer::createNew(env, videoES);\n\t}\n#endif\n\telse if (format == \"video\/JPEG\")\n\t{\n\t\tsource = MJPEGVideoSource::createNew(env, videoES);\n\t}\n\telse \n\t{\n\t\tsource = videoES;\n\t}\n\treturn source;\n}\n\nRTPSink* BaseServerMediaSubsession::createSink(UsageEnvironment& env, Groupsock* rtpGroupsock, unsigned char rtpPayloadTypeIfDynamic, const std::string& format, V4L2DeviceSource* source)\n{\n\tRTPSink* videoSink = NULL;\n\tif (format == \"video\/MP2T\")\n\t{\n\t\tvideoSink = SimpleRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic, 90000, \"video\", \"MP2T\", 1, True, False); \n\t}\n\telse if (format == \"video\/H264\")\n {\n\t\tvideoSink = H264VideoRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic);\n\t}\n\telse if (format == \"video\/VP8\")\n\t{\n\t\tvideoSink = VP8VideoRTPSink::createNew (env, rtpGroupsock,rtpPayloadTypeIfDynamic); \n\t}\n#if LIVEMEDIA_LIBRARY_VERSION_INT > 1414454400\n\telse if (format == \"video\/VP9\")\n\t{\n\t\tvideoSink = VP9VideoRTPSink::createNew (env, rtpGroupsock,rtpPayloadTypeIfDynamic); \n\t}\n\telse if (format == \"video\/H265\")\n {\n\t\tvideoSink = H265VideoRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic);\n\t}\n#endif\t\n\telse if (format == \"video\/JPEG\")\n\t{\n\t\tvideoSink = JPEGVideoRTPSink::createNew (env, rtpGroupsock); \n } \n#if LIVEMEDIA_LIBRARY_VERSION_INT >= 1536192000\t\n\telse if (format ==\"video\/RAW\") \n\t{ \n\t\tstd::string sampling;\n\t\tswitch (source->getCaptureFormat()) {\n\t\t\tcase V4L2_PIX_FMT_YUV444: sampling = \"YCbCr-4:4:4\"; break;\n\t\t\tcase V4L2_PIX_FMT_YUYV: sampling = \"YCbCr-4:2:2\"; break;\n\t\t}\n\t\tvideoSink = RawVideoRTPSink::createNew(env, rtpGroupsock, rtpPayloadTypeIfDynamic, source->getHeight(), source->getWidth(), 8, sampling.c_str());\n\t\tif (videoSink) {\n\t\t\tsource->setAuxLine(videoSink->auxSDPLine());\n\t\t}\n } \n#endif\t\n\telse if (format.find(\"audio\/L16\") == 0)\n\t{\n\t\tstd::istringstream is(format);\n\t\tstd::string dummy;\n\t\tgetline(is, dummy, '\/');\t\n\t\tgetline(is, dummy, '\/');\t\n\t\tstd::string sampleRate(\"44100\");\n\t\tgetline(is, sampleRate, '\/');\t\n\t\tstd::string channels(\"2\");\n\t\tgetline(is, channels);\t\n\t\tvideoSink = SimpleRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic, std::stoi(sampleRate), \"audio\", \"L16\", std::stoi(channels), True, False); \n\t}\n\treturn videoSink;\n}\n\nchar const* BaseServerMediaSubsession::getAuxLine(V4L2DeviceSource* source,unsigned char rtpPayloadType)\n{\n\tconst char* auxLine = NULL;\n\tif (source)\n\t{\n\t\tstd::ostringstream os; \n\t\tos << \"a=fmtp:\" << int(rtpPayloadType) << \" \";\t\t\t\t\n\t\tos << source->getAuxLine();\t\t\t\t\n\t\tos << \"\\r\\n\";\t\t\n\t\tint width = source->getWidth();\n\t\tint height = source->getHeight();\n\t\tif ( (width > 0) && (height>0) ) {\n\t\t\tos << \"a=x-dimensions:\" << width << \",\" << height << \"\\r\\n\";\t\t\t\t\n\t\t}\n\t\tauxLine = strdup(os.str().c_str());\n\t} \n\treturn auxLine;\n}\n\n<commit_msg>replace std::stoi with atoi<commit_after>\/* ---------------------------------------------------------------------------\n** This software is in the public domain, furnished \"as is\", without technical\n** support, and with no warranty, express or implied, as to its usefulness for\n** any purpose.\n**\n** ServerMediaSubsession.cpp\n** \n** -------------------------------------------------------------------------*\/\n\n#include <sstream>\n#include <linux\/videodev2.h>\n\n\/\/ project\n#include \"ServerMediaSubsession.h\"\n#include \"MJPEGVideoSource.h\"\n#include \"DeviceSource.h\"\n\n\/\/ ---------------------------------\n\/\/ BaseServerMediaSubsession\n\/\/ ---------------------------------\nFramedSource* BaseServerMediaSubsession::createSource(UsageEnvironment& env, FramedSource* videoES, const std::string& format)\n{\n\tFramedSource* source = NULL;\n\tif (format == \"video\/MP2T\")\n\t{\n\t\tsource = MPEG2TransportStreamFramer::createNew(env, videoES); \n\t}\n\telse if (format == \"video\/H264\")\n\t{\n\t\tsource = H264VideoStreamDiscreteFramer::createNew(env, videoES);\n\t}\n#if LIVEMEDIA_LIBRARY_VERSION_INT > 1414454400\n\telse if (format == \"video\/H265\")\n\t{\n\t\tsource = H265VideoStreamDiscreteFramer::createNew(env, videoES);\n\t}\n#endif\n\telse if (format == \"video\/JPEG\")\n\t{\n\t\tsource = MJPEGVideoSource::createNew(env, videoES);\n\t}\n\telse \n\t{\n\t\tsource = videoES;\n\t}\n\treturn source;\n}\n\nRTPSink* BaseServerMediaSubsession::createSink(UsageEnvironment& env, Groupsock* rtpGroupsock, unsigned char rtpPayloadTypeIfDynamic, const std::string& format, V4L2DeviceSource* source)\n{\n\tRTPSink* videoSink = NULL;\n\tif (format == \"video\/MP2T\")\n\t{\n\t\tvideoSink = SimpleRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic, 90000, \"video\", \"MP2T\", 1, True, False); \n\t}\n\telse if (format == \"video\/H264\")\n {\n\t\tvideoSink = H264VideoRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic);\n\t}\n\telse if (format == \"video\/VP8\")\n\t{\n\t\tvideoSink = VP8VideoRTPSink::createNew (env, rtpGroupsock,rtpPayloadTypeIfDynamic); \n\t}\n#if LIVEMEDIA_LIBRARY_VERSION_INT > 1414454400\n\telse if (format == \"video\/VP9\")\n\t{\n\t\tvideoSink = VP9VideoRTPSink::createNew (env, rtpGroupsock,rtpPayloadTypeIfDynamic); \n\t}\n\telse if (format == \"video\/H265\")\n {\n\t\tvideoSink = H265VideoRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic);\n\t}\n#endif\t\n\telse if (format == \"video\/JPEG\")\n\t{\n\t\tvideoSink = JPEGVideoRTPSink::createNew (env, rtpGroupsock); \n } \n#if LIVEMEDIA_LIBRARY_VERSION_INT >= 1536192000\t\n\telse if (format ==\"video\/RAW\") \n\t{ \n\t\tstd::string sampling;\n\t\tswitch (source->getCaptureFormat()) {\n\t\t\tcase V4L2_PIX_FMT_YUV444: sampling = \"YCbCr-4:4:4\"; break;\n\t\t\tcase V4L2_PIX_FMT_YUYV: sampling = \"YCbCr-4:2:2\"; break;\n\t\t}\n\t\tvideoSink = RawVideoRTPSink::createNew(env, rtpGroupsock, rtpPayloadTypeIfDynamic, source->getHeight(), source->getWidth(), 8, sampling.c_str());\n\t\tif (videoSink) {\n\t\t\tsource->setAuxLine(videoSink->auxSDPLine());\n\t\t}\n } \n#endif\t\n\telse if (format.find(\"audio\/L16\") == 0)\n\t{\n\t\tstd::istringstream is(format);\n\t\tstd::string dummy;\n\t\tgetline(is, dummy, '\/');\t\n\t\tgetline(is, dummy, '\/');\t\n\t\tstd::string sampleRate(\"44100\");\n\t\tgetline(is, sampleRate, '\/');\t\n\t\tstd::string channels(\"2\");\n\t\tgetline(is, channels);\t\n\t\tvideoSink = SimpleRTPSink::createNew(env, rtpGroupsock,rtpPayloadTypeIfDynamic, atoi(sampleRate), \"audio\", \"L16\", atoi(channels), True, False); \n\t}\n\treturn videoSink;\n}\n\nchar const* BaseServerMediaSubsession::getAuxLine(V4L2DeviceSource* source,unsigned char rtpPayloadType)\n{\n\tconst char* auxLine = NULL;\n\tif (source)\n\t{\n\t\tstd::ostringstream os; \n\t\tos << \"a=fmtp:\" << int(rtpPayloadType) << \" \";\t\t\t\t\n\t\tos << source->getAuxLine();\t\t\t\t\n\t\tos << \"\\r\\n\";\t\t\n\t\tint width = source->getWidth();\n\t\tint height = source->getHeight();\n\t\tif ( (width > 0) && (height>0) ) {\n\t\t\tos << \"a=x-dimensions:\" << width << \",\" << height << \"\\r\\n\";\t\t\t\t\n\t\t}\n\t\tauxLine = strdup(os.str().c_str());\n\t} \n\treturn auxLine;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n NUI3 - C++ cross-platform GUI framework for OpenGL based applications\n Copyright (C) 2002-2003 Sebastien Metrot\n \n licence: see nui3\/LICENCE.TXT\n *\/\n\n#include \"nui.h\"\n#include \"nuiHTMLText.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ nuiHTMLText\nnuiHTMLText::nuiHTMLText(nuiHTMLNode* pNode, nuiHTMLNode* pAnchor, const nglString& rText)\n: nuiHTMLItem(pNode, pAnchor, true), mText(rText), mpLayout(NULL), mpFont(NULL), mpCompositeLayout(NULL), mpNextInRun(NULL), mFirstInRun(false), mUnderline(false), mStrikeThrough(false)\n{\n\n}\n\nnuiHTMLText::~nuiHTMLText()\n{\n if (mpFont)\n mpFont->Release();\n delete mpLayout;\n delete mpCompositeLayout;\n mpNextInRun = NULL;\n}\n\nvoid nuiHTMLText::Draw(nuiDrawContext* pContext)\n{\n if (!mFirstInRun)\n return;\n \n pContext->SetTextColor(mTextFgColor);\n \/\/nuiColor mTextBgColor;\n pContext->SetFont(mpFont, false);\n \n if (!mpCompositeLayout)\n {\n nuiHTMLText* pIt = this;\n nglString str(nglString::Empty);\n do \n {\n if (!pIt->mFirstInRun)\n str.Add(_T(\" \"));\n str.Add(pIt->mText);\n pIt = pIt->mpNextInRun;\n } while (pIt);\n \n mpCompositeLayout = new nuiFontLayout(*mpFont, 0, 0, nuiHorizontal);\n mpCompositeLayout->SetUnderline(mUnderline);\n mpCompositeLayout->SetStrikeThrough(mStrikeThrough);\n mpCompositeLayout->Layout(str);\n }\n \n pContext->DrawText(0, mpCompositeLayout->GetAscender() , *mpCompositeLayout);\n}\n\nvoid nuiHTMLText::Layout(nuiHTMLContext& rContext)\n{\n delete mpLayout;\n if (mpFont)\n mpFont->Release();\n mpFont = rContext.mpFont;\n mpFont->Acquire();\n \n mpLayout = new nuiFontLayout(*mpFont, 0, 0, nuiHorizontal);\n mpLayout->SetUnderline(rContext.mUnderline);\n mpLayout->SetStrikeThrough(rContext.mStrikeThrough);\n mUnderline = rContext.mUnderline;\n mStrikeThrough = rContext.mStrikeThrough;\n \n mpLayout->Layout(mText);\n mIdealRect = mpLayout->GetRect();\n mIdealRect.SetWidth(mIdealRect.GetWidth() + rContext.mHSpace);\n mTextFgColor = rContext.mTextFgColor;\n mTextBgColor = rContext.mTextBgColor;\n \/\/printf(\"text layout done (%ls)\\n\", mIdealRect.GetValue().GetChars());\n \n delete mpCompositeLayout;\n mpCompositeLayout = NULL;\n}\n\nfloat nuiHTMLText::GetAscender() const\n{\n return mpLayout->GetAscender();\n}\n\nfloat nuiHTMLText::GetDescender() const\n{\n return mpLayout->GetDescender();\n}\n\nvoid nuiHTMLText::SetNextInRun(nuiHTMLText* pNext)\n{\n mpNextInRun = pNext;\n}\n\nvoid nuiHTMLText::SetFirstInRun(bool set)\n{\n mFirstInRun = set;\n}\n<commit_msg>fixed one more html layout bug<commit_after>\/*\n NUI3 - C++ cross-platform GUI framework for OpenGL based applications\n Copyright (C) 2002-2003 Sebastien Metrot\n \n licence: see nui3\/LICENCE.TXT\n *\/\n\n#include \"nui.h\"\n#include \"nuiHTMLText.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ nuiHTMLText\nnuiHTMLText::nuiHTMLText(nuiHTMLNode* pNode, nuiHTMLNode* pAnchor, const nglString& rText)\n: nuiHTMLItem(pNode, pAnchor, true), mText(rText), mpLayout(NULL), mpFont(NULL), mpCompositeLayout(NULL), mpNextInRun(NULL), mFirstInRun(false), mUnderline(false), mStrikeThrough(false)\n{\n\n}\n\nnuiHTMLText::~nuiHTMLText()\n{\n if (mpFont)\n mpFont->Release();\n delete mpLayout;\n delete mpCompositeLayout;\n mpNextInRun = NULL;\n}\n\nvoid nuiHTMLText::Draw(nuiDrawContext* pContext)\n{\n if (!mFirstInRun)\n return;\n \n pContext->SetTextColor(mTextFgColor);\n \/\/nuiColor mTextBgColor;\n pContext->SetFont(mpFont, false);\n \n if (!mpCompositeLayout)\n {\n nuiHTMLText* pIt = this;\n nglString str(nglString::Empty);\n do \n {\n str.Add(pIt->mText);\n str.Add(_T(\" \"));\n pIt = pIt->mpNextInRun;\n } while (pIt && !pIt->mFirstInRun);\n \n mpCompositeLayout = new nuiFontLayout(*mpFont, 0, 0, nuiHorizontal);\n mpCompositeLayout->SetUnderline(mUnderline);\n mpCompositeLayout->SetStrikeThrough(mStrikeThrough);\n mpCompositeLayout->Layout(str);\n \n NGL_OUT(_T(\"Draw HTMLText: %ls\\n\"), str.GetChars());\n }\n \n pContext->DrawText(0, mpCompositeLayout->GetAscender() , *mpCompositeLayout);\n}\n\nvoid nuiHTMLText::Layout(nuiHTMLContext& rContext)\n{\n delete mpLayout;\n if (mpFont)\n mpFont->Release();\n mpFont = rContext.mpFont;\n mpFont->Acquire();\n \n mpLayout = new nuiFontLayout(*mpFont, 0, 0, nuiHorizontal);\n mpLayout->SetUnderline(rContext.mUnderline);\n mpLayout->SetStrikeThrough(rContext.mStrikeThrough);\n mUnderline = rContext.mUnderline;\n mStrikeThrough = rContext.mStrikeThrough;\n \n mpLayout->Layout(mText);\n mIdealRect = mpLayout->GetRect();\n mIdealRect.SetWidth(mIdealRect.GetWidth() + rContext.mHSpace);\n mTextFgColor = rContext.mTextFgColor;\n mTextBgColor = rContext.mTextBgColor;\n \/\/printf(\"text layout done (%ls)\\n\", mIdealRect.GetValue().GetChars());\n \n delete mpCompositeLayout;\n mpCompositeLayout = NULL;\n}\n\nfloat nuiHTMLText::GetAscender() const\n{\n return mpLayout->GetAscender();\n}\n\nfloat nuiHTMLText::GetDescender() const\n{\n return mpLayout->GetDescender();\n}\n\nvoid nuiHTMLText::SetNextInRun(nuiHTMLText* pNext)\n{\n mpNextInRun = pNext;\n}\n\nvoid nuiHTMLText::SetFirstInRun(bool set)\n{\n mFirstInRun = set;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n expal.cpp - Arduino Class that provides easy interfacing to a shift register along with multiplexing via registers\/latches\n\n Copyright (C) 2015 James Vess\n All Rights Reserved\n\n  This library is free software; you can redistribute it and\/or\n  modify it under the terms of the GNU Lesser General Public\n  License as published by the Free Software Foundation; either\n  version 2.1 of the License, or (at your option) any later version.\n\n  This library is distributed in the hope that it will be useful,\n  but WITHOUT ANY WARRANTY; without even the implied warranty of\n  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n  Lesser General Public License for more details.\n\n  You should have received a copy of the GNU Lesser General Public\n  License along with this library; if not, write to the Free Software\n  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n\n =-= Notes =-=\n\n If you're going to increase the maximum registers from 25 ( Wow ) then you'll need to make\n sure you increase the array sizes of REGDATA and REGPINS.\n\n*\/\r\n\r\n#include \"Arduino.h\"\r\n#include \"Expal.h\"\r\n\n\/\/ Private Functions\n\nvoid Expal::blinkBit(int pin) {\n digitalWrite(pin, HIGH);\n digitalWrite(pin, LOW);\n}\n\nvoid Expal::blinkBitI(int pin) {\n digitalWrite(pin, LOW);\n digitalWrite(pin, HIGH);\n}\n\nvoid Expal::shiftOutByte(byte data) {\n\n \/\/ Reset the Shift Register\n blinkBitI(SHIFTREG_R);\n\n \/\/ Write out the bits\n int pin = 0;\n byte mask = B00000000;\n for (mask = 10000000; mask>0; mask >>= 1) { \/\/iterate through bit mask\n if (data & mask){ \/\/ if bitwise AND resolves to true\n digitalWrite(SHIFTREG_D,HIGH); \/\/ send 1\n }\n else{ \/\/if bitwise and resolves to false\n digitalWrite(SHIFTREG_D,LOW); \/\/ send 0\n }\n \/\/ Write the bit\n blinkBit(SHIFTREG_C);\n pin++;\n }\n\n}\n\nint Expal::isNumeric(int num) {\n if( num >= 0 && num <= 99999 ) {\n return 1;\n }\n return 0;\n}\n\nint Expal::isReg(int num) {\n if ( num >= 0 && num <= REGINT ) {\n return 1;\n }\n return 0;\n}\n\n\/\/ Public Functions\n\nExpal::Expal(int shift_data, int shift_clear, int shift_clock, int registers[] ) {\n\n \/\/ Setup Vars\n SHIFTREG_D = shift_data;\n SHIFTREG_R = shift_clear;\n SHIFTREG_C = shift_clock;\n\n \/\/ Set Shiftreg Pins\n pinMode(SHIFTREG_D, OUTPUT);\n pinMode(SHIFTREG_R, OUTPUT);\n pinMode(SHIFTREG_C, OUTPUT);\n\n \/\/ Set the clear pin to high\n digitalWrite(SHIFTREG_R, HIGH);\n\n \/\/ Iterate the max register to pull all supplied registers\n for(int i = 0; i < sizeof(registers); ++i) {\n\n if ( !isNumeric(registers[i]) ) {\n continue;\n }\n REGDATA[REGINT] = B00000000;\n REGPINS[REGINT] = registers[i];\n pinMode(registers[i], OUTPUT);\n ++REGINT;\n }\n\n}\n\nvoid Expal::clear(int registerid) {\n if ( !isReg(registerid) ) {\n return;\n }\n \/\/ Reset the Shift Register\n blinkBit(REGPINS[registerid]);\n}\n\nvoid Expal::writeByte(int registerid, byte data) {\n if ( !isReg(registerid) ) {\n return;\n }\n shiftOutByte(data);\n blinkBit(REGPINS[registerid]);\n REGDATA[registerid] = data;\n}\n\nvoid Expal::clearAll() {\n for(int i = 0; i < REGINT; ++i) {\n clear(i);\n }\n}\n\nvoid Expal::setPin(int registerid, int pin, int value) {\n\n if ( !isReg(registerid) ) {\n return;\n }\n if ( pin < 0 || pin > 8 ) {\n return;\n }\n\n byte newval;\n\n if ( value ) {\n byte bytemask = B00000001;\n bytemask = bytemask << pin;\n newval = REGDATA[registerid] | bytemask;\n } else {\n byte bytemask = B11111110;\n bytemask = bytemask << pin;\n newval = REGDATA[registerid] & bytemask;\n }\n\n writeByte(registerid, newval);\n}\n<commit_msg>Wow, yet more fun. Resolved issues with endianness again<commit_after>\/*\n\n expal.cpp - Arduino Class that provides easy interfacing to a shift register along with multiplexing via registers\/latches\n\n Copyright (C) 2015 James Vess\n All Rights Reserved\n\n  This library is free software; you can redistribute it and\/or\n  modify it under the terms of the GNU Lesser General Public\n  License as published by the Free Software Foundation; either\n  version 2.1 of the License, or (at your option) any later version.\n\n  This library is distributed in the hope that it will be useful,\n  but WITHOUT ANY WARRANTY; without even the implied warranty of\n  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n  Lesser General Public License for more details.\n\n  You should have received a copy of the GNU Lesser General Public\n  License along with this library; if not, write to the Free Software\n  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n\n =-= Notes =-=\n\n If you're going to increase the maximum registers from 25 ( Wow ) then you'll need to make\n sure you increase the array sizes of REGDATA and REGPINS.\n\n*\/\r\n\r\n#include \"Arduino.h\"\r\n#include \"Expal.h\"\r\n\n\/\/ Private Functions\n\nvoid Expal::blinkBit(int pin) {\n digitalWrite(pin, HIGH);\n digitalWrite(pin, LOW);\n}\n\nvoid Expal::blinkBitI(int pin) {\n digitalWrite(pin, LOW);\n digitalWrite(pin, HIGH);\n}\n\nvoid Expal::shiftOutByte(byte data) {\n\n \/\/ Reset the Shift Register\n blinkBitI(SHIFTREG_R);\n\n \/\/ Write out the bits\n int pin = 0;\n byte mask = B00000000;\n for (mask = 00000001; mask>0; mask <<= 1) { \/\/iterate through bit mask\n if (data & mask){ \/\/ if bitwise AND resolves to true\n digitalWrite(SHIFTREG_D,HIGH); \/\/ send 1\n }\n else{ \/\/if bitwise and resolves to false\n digitalWrite(SHIFTREG_D,LOW); \/\/ send 0\n }\n \/\/ Write the bit\n blinkBit(SHIFTREG_C);\n pin++;\n }\n\n}\n\nint Expal::isNumeric(int num) {\n if( num >= 0 && num <= 99999 ) {\n return 1;\n }\n return 0;\n}\n\nint Expal::isReg(int num) {\n if ( num >= 0 && num <= REGINT ) {\n return 1;\n }\n return 0;\n}\n\n\/\/ Public Functions\n\nExpal::Expal(int shift_data, int shift_clear, int shift_clock, int registers[] ) {\n\n \/\/ Setup Vars\n SHIFTREG_D = shift_data;\n SHIFTREG_R = shift_clear;\n SHIFTREG_C = shift_clock;\n\n \/\/ Set Shiftreg Pins\n pinMode(SHIFTREG_D, OUTPUT);\n pinMode(SHIFTREG_R, OUTPUT);\n pinMode(SHIFTREG_C, OUTPUT);\n\n \/\/ Set the clear pin to high\n digitalWrite(SHIFTREG_R, HIGH);\n\n \/\/ Iterate the max register to pull all supplied registers\n for(int i = 0; i < sizeof(registers); ++i) {\n\n if ( !isNumeric(registers[i]) ) {\n continue;\n }\n REGDATA[REGINT] = B00000000;\n REGPINS[REGINT] = registers[i];\n pinMode(registers[i], OUTPUT);\n ++REGINT;\n }\n\n}\n\nvoid Expal::clear(int registerid) {\n if ( !isReg(registerid) ) {\n return;\n }\n \/\/ Reset the Shift Register\n blinkBit(REGPINS[registerid]);\n}\n\nvoid Expal::writeByte(int registerid, byte data) {\n if ( !isReg(registerid) ) {\n return;\n }\n shiftOutByte(data);\n blinkBit(REGPINS[registerid]);\n REGDATA[registerid] = data;\n}\n\nvoid Expal::clearAll() {\n for(int i = 0; i < REGINT; ++i) {\n clear(i);\n }\n}\n\nvoid Expal::setPin(int registerid, int pin, int value) {\n\n if ( !isReg(registerid) ) {\n return;\n }\n if ( pin < 0 || pin > 8 ) {\n return;\n }\n\n byte newval;\n byte bytemask = B10000000;\n bytemask = bytemask >> pin;\n if ( value ) {\n newval = REGDATA[registerid] | bytemask;\n } else {\n bytemask = ~bytemask;\n newval = REGDATA[registerid] & bytemask;\n }\n\n writeByte(registerid, newval);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"services\/asset_bundle\/asset_bundle_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"mojo\/common\/data_pipe_utils.h\"\n\nnamespace mojo {\nnamespace asset_bundle {\nnamespace {\n\nvoid Ignored(bool) {\n}\n\n} \/\/ namespace\n\nAssetBundleImpl::AssetBundleImpl(InterfaceRequest<AssetBundle> request,\n scoped_ptr<base::ScopedTempDir> asset_dir,\n scoped_refptr<base::TaskRunner> worker_runner)\n : binding_(this, request.Pass()),\n asset_dir_(asset_dir.Pass()),\n worker_runner_(worker_runner.Pass()) {\n}\n\nAssetBundleImpl::~AssetBundleImpl() {\n}\n\nvoid AssetBundleImpl::GetAsStream(\n const String& asset_name,\n const Callback<void(ScopedDataPipeConsumerHandle)>& callback) {\n DataPipe pipe;\n callback.Run(pipe.consumer_handle.Pass());\n\n std::string asset_string = asset_name.To<std::string>();\n base::FilePath asset_path =\n base::MakeAbsoluteFilePath(asset_dir_->path().Append(asset_string));\n\n if (!asset_dir_->path().IsParent(asset_path)) {\n LOG(WARNING) << \"Requested asset '\" << asset_string << \"' does not exist.\";\n return;\n }\n\n common::CopyFromFile(asset_path, pipe.producer_handle.Pass(), 0,\n worker_runner_.get(), base::Bind(&Ignored));\n}\n\n} \/\/ namespace asset_bundle\n} \/\/ namespace mojo\n<commit_msg>Fix IsParent() check in asset_bundle<commit_after>\/\/ Copyright 2015 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"services\/asset_bundle\/asset_bundle_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/files\/file_path.h\"\n#include \"base\/files\/file_util.h\"\n#include \"base\/logging.h\"\n#include \"mojo\/common\/data_pipe_utils.h\"\n\nnamespace mojo {\nnamespace asset_bundle {\nnamespace {\n\nvoid Ignored(bool) {\n}\n\n} \/\/ namespace\n\nAssetBundleImpl::AssetBundleImpl(InterfaceRequest<AssetBundle> request,\n scoped_ptr<base::ScopedTempDir> asset_dir,\n scoped_refptr<base::TaskRunner> worker_runner)\n : binding_(this, request.Pass()),\n asset_dir_(asset_dir.Pass()),\n worker_runner_(worker_runner.Pass()) {\n}\n\nAssetBundleImpl::~AssetBundleImpl() {\n}\n\nvoid AssetBundleImpl::GetAsStream(\n const String& asset_name,\n const Callback<void(ScopedDataPipeConsumerHandle)>& callback) {\n DataPipe pipe;\n callback.Run(pipe.consumer_handle.Pass());\n\n std::string asset_string = asset_name.To<std::string>();\n base::FilePath asset_path =\n base::MakeAbsoluteFilePath(asset_dir_->path().Append(asset_string));\n\n auto asset_dir_abs = base::MakeAbsoluteFilePath(asset_dir_->path());\n if (!asset_dir_abs.IsParent(asset_path)) {\n LOG(WARNING) << \"Requested asset '\" << asset_string << \"' does not exist.\";\n return;\n }\n\n common::CopyFromFile(asset_path, pipe.producer_handle.Pass(), 0,\n worker_runner_.get(), base::Bind(&Ignored));\n}\n\n} \/\/ namespace asset_bundle\n} \/\/ namespace mojo\n<|endoftext|>"} {"text":"<commit_before>#include \"aboutdialog.h\"\n#include \"ui_aboutdialog.h\"\n\n#include \"clientmodel.h\"\n#include \"clientversion.h\"\n\n\/\/ Copyright year (2009-this)\n\/\/ Todo: update this when changing our copyright comments in the source\nconst int ABOUTDIALOG_COPYRIGHT_YEAR = 2013;\n\nAboutDialog::AboutDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::AboutDialog)\n{\n ui->setupUi(this);\n\n \/\/ Set current copyright year\n ui->copyrightLabel->setText(tr(\"Copyright\") + QString(\" © 2009-%1 \").arg(COPYRIGHT_YEAR) + tr(\"The Bitcoin developers\") + QString(\"<br>\") + tr(\"Copyright\") + QString(\" © \") + tr(\"2011-%1 The mtgoxcoin developers\").arg(ABOUTDIALOG_COPYRIGHT_YEAR));\n}\n\nvoid AboutDialog::setModel(ClientModel *model)\n{\n if(model)\n {\n ui->versionLabel->setText(model->formatFullVersion());\n }\n}\n\nAboutDialog::~AboutDialog()\n{\n delete ui;\n}\n\nvoid AboutDialog::on_buttonBox_accepted()\n{\n close();\n}\n<commit_msg>added copyrights in about qt<commit_after>#include \"aboutdialog.h\"\n#include \"ui_aboutdialog.h\"\n\n#include \"clientmodel.h\"\n#include \"clientversion.h\"\n\n\/\/ Copyright year (2009-this)\n\/\/ Todo: update this when changing our copyright comments in the source\nconst int ABOUTDIALOG_COPYRIGHT_YEAR = 2013;\n\nAboutDialog::AboutDialog(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::AboutDialog)\n{\n ui->setupUi(this);\n\n \/\/ Set current copyright year\n ui->copyrightLabel->setText(tr(\"Copyright\") + QString(\" © 2009-%1 \").arg(COPYRIGHT_YEAR) + tr(\"The Bitcoin developers\") + QString(\"<br>\") + tr(\"Copyright\") + QString(\" © \") + tr(\"2011-%1 The litecoin developers\") + QString(\"<br>\") + tr(\"Copyright\") + QString(\" © \") + tr(\"2014 The mtgoxcoin developers\").arg(ABOUTDIALOG_COPYRIGHT_YEAR));\n}\n\nvoid AboutDialog::setModel(ClientModel *model)\n{\n if(model)\n {\n ui->versionLabel->setText(model->formatFullVersion());\n }\n}\n\nAboutDialog::~AboutDialog()\n{\n delete ui;\n}\n\nvoid AboutDialog::on_buttonBox_accepted()\n{\n close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2015 The Bitcoin Core developers\n\/\/ Copyright (c) 2015-2017 The Bitcoin Unlimited developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"clientmodel.h\"\n\n#include \"bantablemodel.h\"\n#include \"guiconstants.h\"\n#include \"peertablemodel.h\"\n\n#include \"chainparams.h\"\n#include \"checkpoints.h\"\n#include \"clientversion.h\"\n#include \"net.h\"\n#include \"txmempool.h\"\n#include \"ui_interface.h\"\n#include \"util.h\"\n\n#include <stdint.h>\n\n#include <QDebug>\n#include <QTimer>\n\nclass CBlockIndex;\n\nstatic const int64_t nClientStartupTime = GetTime();\nstatic int64_t nLastBlockTipUpdateNotification = 0;\n\nClientModel::ClientModel(OptionsModel *optionsModel, UnlimitedModel *ul, QObject *parent)\n : QObject(parent), unlimitedModel(ul), optionsModel(optionsModel), peerTableModel(0), banTableModel(0),\n pollTimer1(0), pollTimer2(0)\n{\n peerTableModel = new PeerTableModel(this);\n banTableModel = new BanTableModel(this);\n\n pollTimer1 = new QTimer(this);\n connect(pollTimer1, SIGNAL(timeout()), this, SLOT(updateTimer1()));\n pollTimer1->start(MODEL_UPDATE_DELAY1);\n\n pollTimer2 = new QTimer(this);\n connect(pollTimer2, SIGNAL(timeout()), this, SLOT(updateTimer2()));\n pollTimer2->start(MODEL_UPDATE_DELAY2);\n\n subscribeToCoreSignals();\n}\n\nClientModel::~ClientModel() { unsubscribeFromCoreSignals(); }\nint ClientModel::getNumConnections(unsigned int flags) const\n{\n LOCK(cs_vNodes);\n if (flags == CONNECTIONS_ALL) \/\/ Shortcut if we want total\n return vNodes.size();\n\n int nNum = 0;\n BOOST_FOREACH (const CNode *pnode, vNodes)\n if (flags & (pnode->fInbound ? CONNECTIONS_IN : CONNECTIONS_OUT))\n nNum++;\n\n return nNum;\n}\n\nint ClientModel::getNumBlocks() const\n{\n LOCK(cs_main);\n return chainActive.Height();\n}\n\nquint64 ClientModel::getTotalBytesRecv() const { return CNode::GetTotalBytesRecv(); }\nquint64 ClientModel::getTotalBytesSent() const { return CNode::GetTotalBytesSent(); }\nQDateTime ClientModel::getLastBlockDate() const\n{\n LOCK(cs_main);\n\n if (chainActive.Tip())\n return QDateTime::fromTime_t(chainActive.Tip()->GetBlockTime());\n\n return QDateTime::fromTime_t(Params().GenesisBlock().GetBlockTime()); \/\/ Genesis block's time of current network\n}\n\nlong ClientModel::getMempoolSize() const { return mempool.size(); }\nlong ClientModel::getOrphanPoolSize() const\n{\n LOCK(cs_orphancache);\n return mapOrphanTransactions.size();\n}\n\nsize_t ClientModel::getMempoolDynamicUsage() const { return mempool.DynamicMemoryUsage(); }\n\/\/ BU: begin\ndouble ClientModel::getTransactionsPerSecond() const { return mempool.TransactionsPerSecond(); }\n\/\/ BU: end\n\ndouble ClientModel::getVerificationProgress(const CBlockIndex *tipIn) const\n{\n CBlockIndex *tip = const_cast<CBlockIndex *>(tipIn);\n if (!tip)\n {\n LOCK(cs_main);\n tip = chainActive.Tip();\n }\n return Checkpoints::GuessVerificationProgress(Params().Checkpoints(), tip);\n}\n\nvoid ClientModel::updateTimer1()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will acquire the required lock\n Q_EMIT mempoolSizeChanged(getMempoolSize(), getMempoolDynamicUsage());\n Q_EMIT transactionsPerSecondChanged(getTransactionsPerSecond());\n}\n\nvoid ClientModel::updateTimer2()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will aquire the required lock\n Q_EMIT orphanPoolSizeChanged(getOrphanPoolSize());\n Q_EMIT bytesChanged(getTotalBytesRecv(), getTotalBytesSent());\n\n uiInterface.BannedListChanged();\n}\n\nvoid ClientModel::updateNumConnections(int numConnections) { Q_EMIT numConnectionsChanged(numConnections); }\nvoid ClientModel::updateAlert() { Q_EMIT alertsChanged(getStatusBarWarnings()); }\nbool ClientModel::inInitialBlockDownload() const { return IsInitialBlockDownload(); }\nenum BlockSource ClientModel::getBlockSource() const\n{\n if (fReindex)\n return BLOCK_SOURCE_REINDEX;\n else if (fImporting)\n return BLOCK_SOURCE_DISK;\n else if (getNumConnections() > 0)\n return BLOCK_SOURCE_NETWORK;\n\n return BLOCK_SOURCE_NONE;\n}\n\nQString ClientModel::getStatusBarWarnings() const { return QString::fromStdString(GetWarnings(\"gui\")); }\nOptionsModel *ClientModel::getOptionsModel() { return optionsModel; }\nPeerTableModel *ClientModel::getPeerTableModel() { return peerTableModel; }\nBanTableModel *ClientModel::getBanTableModel() { return banTableModel; }\nQString ClientModel::formatFullVersion() const { return QString::fromStdString(FormatFullVersion()); }\nQString ClientModel::formatSubVersion() const { return QString::fromStdString(strSubVersion); }\nbool ClientModel::isReleaseVersion() const { return CLIENT_VERSION_IS_RELEASE; }\nQString ClientModel::clientName() const { return QString::fromStdString(CLIENT_NAME); }\nQString ClientModel::formatClientStartupTime() const\n{\n QString time_format = \"MMM d yyyy, HH:mm:ss\";\n return QDateTime::fromTime_t(nClientStartupTime).toString(time_format);\n}\n\nQString ClientModel::dataDir() const { return QString::fromStdString(GetDataDir().string()); }\nvoid ClientModel::updateBanlist() { banTableModel->refresh(); }\n\/\/ Handlers for core signals\nstatic void ShowProgress(ClientModel *clientmodel, const std::string &title, int nProgress)\n{\n \/\/ emits signal \"showProgress\"\n QMetaObject::invokeMethod(clientmodel, \"showProgress\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(title)), Q_ARG(int, nProgress));\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel *clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: qDebug() << \"NotifyNumConnectionsChanged: \" + QString::number(newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection, Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyAlertChanged(ClientModel *clientmodel)\n{\n qDebug() << \"NotifyAlertChanged\";\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection);\n}\n\nstatic void BannedListChanged(ClientModel *clientmodel)\n{\n qDebug() << QString(\"%1: Requesting update for peer banlist\").arg(__func__);\n QMetaObject::invokeMethod(clientmodel, \"updateBanlist\", Qt::QueuedConnection);\n}\n\nstatic void BlockTipChanged(ClientModel *clientmodel, bool initialSync, const CBlockIndex *pIndex)\n{\n \/\/ lock free async UI updates in case we have a new block tip\n \/\/ during initial sync, only update the UI if the last update\n \/\/ was > 250ms (MODEL_UPDATE_DELAY1) ago\n int64_t now = 0;\n if (initialSync)\n now = GetTimeMillis();\n\n \/\/ if we are in-sync, update the UI regardless of last update time\n if (!initialSync || now - nLastBlockTipUpdateNotification > MODEL_UPDATE_DELAY1)\n {\n \/\/ pass a async signal to the UI thread\n QMetaObject::invokeMethod(clientmodel, \"numBlocksChanged\", Qt::QueuedConnection, Q_ARG(int, pIndex->nHeight),\n Q_ARG(QDateTime, QDateTime::fromTime_t(pIndex->GetBlockTime())),\n Q_ARG(double, clientmodel->getVerificationProgress(pIndex)));\n nLastBlockTipUpdateNotification = now;\n }\n}\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.ShowProgress.connect(boost::bind(ShowProgress, this, _1, _2));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.connect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.connect(boost::bind(BlockTipChanged, this, _1, _2));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.ShowProgress.disconnect(boost::bind(ShowProgress, this, _1, _2));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.disconnect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.disconnect(boost::bind(BlockTipChanged, this, _1, _2));\n}\n<commit_msg>Fix for #846: remove extra space between year and month in debug ui.<commit_after>\/\/ Copyright (c) 2011-2015 The Bitcoin Core developers\n\/\/ Copyright (c) 2015-2017 The Bitcoin Unlimited developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"clientmodel.h\"\n\n#include \"bantablemodel.h\"\n#include \"guiconstants.h\"\n#include \"peertablemodel.h\"\n\n#include \"chainparams.h\"\n#include \"checkpoints.h\"\n#include \"clientversion.h\"\n#include \"net.h\"\n#include \"txmempool.h\"\n#include \"ui_interface.h\"\n#include \"util.h\"\n\n#include <stdint.h>\n\n#include <QDebug>\n#include <QTimer>\n\nclass CBlockIndex;\n\nstatic const int64_t nClientStartupTime = GetTime();\nstatic int64_t nLastBlockTipUpdateNotification = 0;\n\nClientModel::ClientModel(OptionsModel *optionsModel, UnlimitedModel *ul, QObject *parent)\n : QObject(parent), unlimitedModel(ul), optionsModel(optionsModel), peerTableModel(0), banTableModel(0),\n pollTimer1(0), pollTimer2(0)\n{\n peerTableModel = new PeerTableModel(this);\n banTableModel = new BanTableModel(this);\n\n pollTimer1 = new QTimer(this);\n connect(pollTimer1, SIGNAL(timeout()), this, SLOT(updateTimer1()));\n pollTimer1->start(MODEL_UPDATE_DELAY1);\n\n pollTimer2 = new QTimer(this);\n connect(pollTimer2, SIGNAL(timeout()), this, SLOT(updateTimer2()));\n pollTimer2->start(MODEL_UPDATE_DELAY2);\n\n subscribeToCoreSignals();\n}\n\nClientModel::~ClientModel() { unsubscribeFromCoreSignals(); }\nint ClientModel::getNumConnections(unsigned int flags) const\n{\n LOCK(cs_vNodes);\n if (flags == CONNECTIONS_ALL) \/\/ Shortcut if we want total\n return vNodes.size();\n\n int nNum = 0;\n BOOST_FOREACH (const CNode *pnode, vNodes)\n if (flags & (pnode->fInbound ? CONNECTIONS_IN : CONNECTIONS_OUT))\n nNum++;\n\n return nNum;\n}\n\nint ClientModel::getNumBlocks() const\n{\n LOCK(cs_main);\n return chainActive.Height();\n}\n\nquint64 ClientModel::getTotalBytesRecv() const { return CNode::GetTotalBytesRecv(); }\nquint64 ClientModel::getTotalBytesSent() const { return CNode::GetTotalBytesSent(); }\nQDateTime ClientModel::getLastBlockDate() const\n{\n LOCK(cs_main);\n\n if (chainActive.Tip())\n return QDateTime::fromTime_t(chainActive.Tip()->GetBlockTime());\n\n return QDateTime::fromTime_t(Params().GenesisBlock().GetBlockTime()); \/\/ Genesis block's time of current network\n}\n\nlong ClientModel::getMempoolSize() const { return mempool.size(); }\nlong ClientModel::getOrphanPoolSize() const\n{\n LOCK(cs_orphancache);\n return mapOrphanTransactions.size();\n}\n\nsize_t ClientModel::getMempoolDynamicUsage() const { return mempool.DynamicMemoryUsage(); }\n\/\/ BU: begin\ndouble ClientModel::getTransactionsPerSecond() const { return mempool.TransactionsPerSecond(); }\n\/\/ BU: end\n\ndouble ClientModel::getVerificationProgress(const CBlockIndex *tipIn) const\n{\n CBlockIndex *tip = const_cast<CBlockIndex *>(tipIn);\n if (!tip)\n {\n LOCK(cs_main);\n tip = chainActive.Tip();\n }\n return Checkpoints::GuessVerificationProgress(Params().Checkpoints(), tip);\n}\n\nvoid ClientModel::updateTimer1()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will acquire the required lock\n Q_EMIT mempoolSizeChanged(getMempoolSize(), getMempoolDynamicUsage());\n Q_EMIT transactionsPerSecondChanged(getTransactionsPerSecond());\n}\n\nvoid ClientModel::updateTimer2()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will aquire the required lock\n Q_EMIT orphanPoolSizeChanged(getOrphanPoolSize());\n Q_EMIT bytesChanged(getTotalBytesRecv(), getTotalBytesSent());\n\n uiInterface.BannedListChanged();\n}\n\nvoid ClientModel::updateNumConnections(int numConnections) { Q_EMIT numConnectionsChanged(numConnections); }\nvoid ClientModel::updateAlert() { Q_EMIT alertsChanged(getStatusBarWarnings()); }\nbool ClientModel::inInitialBlockDownload() const { return IsInitialBlockDownload(); }\nenum BlockSource ClientModel::getBlockSource() const\n{\n if (fReindex)\n return BLOCK_SOURCE_REINDEX;\n else if (fImporting)\n return BLOCK_SOURCE_DISK;\n else if (getNumConnections() > 0)\n return BLOCK_SOURCE_NETWORK;\n\n return BLOCK_SOURCE_NONE;\n}\n\nQString ClientModel::getStatusBarWarnings() const { return QString::fromStdString(GetWarnings(\"gui\")); }\nOptionsModel *ClientModel::getOptionsModel() { return optionsModel; }\nPeerTableModel *ClientModel::getPeerTableModel() { return peerTableModel; }\nBanTableModel *ClientModel::getBanTableModel() { return banTableModel; }\nQString ClientModel::formatFullVersion() const { return QString::fromStdString(FormatFullVersion()); }\nQString ClientModel::formatSubVersion() const { return QString::fromStdString(strSubVersion); }\nbool ClientModel::isReleaseVersion() const { return CLIENT_VERSION_IS_RELEASE; }\nQString ClientModel::clientName() const { return QString::fromStdString(CLIENT_NAME); }\nQString ClientModel::formatClientStartupTime() const\n{\n QString time_format = \"MMM d yyyy, HH:mm:ss\";\n return QDateTime::fromTime_t(nClientStartupTime).toString(time_format);\n}\n\nQString ClientModel::dataDir() const { return QString::fromStdString(GetDataDir().string()); }\nvoid ClientModel::updateBanlist() { banTableModel->refresh(); }\n\/\/ Handlers for core signals\nstatic void ShowProgress(ClientModel *clientmodel, const std::string &title, int nProgress)\n{\n \/\/ emits signal \"showProgress\"\n QMetaObject::invokeMethod(clientmodel, \"showProgress\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(title)), Q_ARG(int, nProgress));\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel *clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: qDebug() << \"NotifyNumConnectionsChanged: \" + QString::number(newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection, Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyAlertChanged(ClientModel *clientmodel)\n{\n qDebug() << \"NotifyAlertChanged\";\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection);\n}\n\nstatic void BannedListChanged(ClientModel *clientmodel)\n{\n qDebug() << QString(\"%1: Requesting update for peer banlist\").arg(__func__);\n QMetaObject::invokeMethod(clientmodel, \"updateBanlist\", Qt::QueuedConnection);\n}\n\nstatic void BlockTipChanged(ClientModel *clientmodel, bool initialSync, const CBlockIndex *pIndex)\n{\n \/\/ lock free async UI updates in case we have a new block tip\n \/\/ during initial sync, only update the UI if the last update\n \/\/ was > 250ms (MODEL_UPDATE_DELAY1) ago\n int64_t now = 0;\n if (initialSync)\n now = GetTimeMillis();\n\n \/\/ if we are in-sync, update the UI regardless of last update time\n if (!initialSync || now - nLastBlockTipUpdateNotification > MODEL_UPDATE_DELAY1)\n {\n \/\/ pass a async signal to the UI thread\n QMetaObject::invokeMethod(clientmodel, \"numBlocksChanged\", Qt::QueuedConnection, Q_ARG(int, pIndex->nHeight),\n Q_ARG(QDateTime, QDateTime::fromTime_t(pIndex->GetBlockTime())),\n Q_ARG(double, clientmodel->getVerificationProgress(pIndex)));\n nLastBlockTipUpdateNotification = now;\n }\n}\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.ShowProgress.connect(boost::bind(ShowProgress, this, _1, _2));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.connect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.connect(boost::bind(BlockTipChanged, this, _1, _2));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.ShowProgress.disconnect(boost::bind(ShowProgress, this, _1, _2));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, _1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.disconnect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.disconnect(boost::bind(BlockTipChanged, this, _1, _2));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011-2017 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <qt\/clientmodel.h>\n\n#include <qt\/bantablemodel.h>\n#include <qt\/guiconstants.h>\n#include <qt\/guiutil.h>\n#include <qt\/peertablemodel.h>\n\n#include <chain.h>\n#include <chainparams.h>\n#include <checkpoints.h>\n#include <clientversion.h>\n#include <net.h>\n#include <txmempool.h>\n#include <ui_interface.h>\n#include <util.h>\n#include <validation.h>\n#include <warnings.h>\n\n#include <stdint.h>\n\n#include <QDebug>\n#include <QTimer>\n\nclass CBlockIndex;\n\nstatic int64_t nLastHeaderTipUpdateNotification = 0;\nstatic int64_t nLastBlockTipUpdateNotification = 0;\n\nClientModel::ClientModel(OptionsModel* _optionsModel, QObject* parent) : QObject(parent),\n optionsModel(_optionsModel),\n peerTableModel(0),\n banTableModel(0),\n pollTimer(0)\n{\n cachedBestHeaderHeight = -1;\n cachedBestHeaderTime = -1;\n peerTableModel = new PeerTableModel(this);\n banTableModel = new BanTableModel(this);\n pollTimer = new QTimer(this);\n connect(pollTimer, SIGNAL(timeout()), this, SLOT(updateTimer()));\n pollTimer->start(MODEL_UPDATE_DELAY);\n\n versionOutDated = false;\n\n subscribeToCoreSignals();\n\n setDSUntaringRequested(false);\n}\n\nClientModel::~ClientModel()\n{\n unsubscribeFromCoreSignals();\n}\n\nint ClientModel::getNumConnections(unsigned int flags) const\n{\n CConnman::NumConnections connections = CConnman::CONNECTIONS_NONE;\n\n if (flags == CONNECTIONS_IN)\n connections = CConnman::CONNECTIONS_IN;\n else if (flags == CONNECTIONS_OUT)\n connections = CConnman::CONNECTIONS_OUT;\n else if (flags == CONNECTIONS_ALL)\n connections = CConnman::CONNECTIONS_ALL;\n\n if (g_connman)\n return g_connman->GetNodeCount(connections);\n return 0;\n}\n\nint ClientModel::getNumBlocks() const\n{\n LOCK(cs_main);\n return chainActive.Height();\n}\n\nint ClientModel::getHeaderTipHeight() const\n{\n if (cachedBestHeaderHeight == -1) {\n \/\/ make sure we initially populate the cache via a cs_main lock\n \/\/ otherwise we need to wait for a tip update\n LOCK(cs_main);\n if (pindexBestHeader) {\n cachedBestHeaderHeight = pindexBestHeader->nHeight;\n cachedBestHeaderTime = pindexBestHeader->GetBlockTime();\n }\n }\n return cachedBestHeaderHeight;\n}\n\nint64_t ClientModel::getHeaderTipTime() const\n{\n if (cachedBestHeaderTime == -1) {\n LOCK(cs_main);\n if (pindexBestHeader) {\n cachedBestHeaderHeight = pindexBestHeader->nHeight;\n cachedBestHeaderTime = pindexBestHeader->GetBlockTime();\n }\n }\n return cachedBestHeaderTime;\n}\n\nquint64 ClientModel::getTotalBytesRecv() const\n{\n if (!g_connman)\n return 0;\n return g_connman->GetTotalBytesRecv();\n}\n\nquint64 ClientModel::getTotalBytesSent() const\n{\n if (!g_connman)\n return 0;\n return g_connman->GetTotalBytesSent();\n}\n\nQDateTime ClientModel::getLastBlockDate() const\n{\n LOCK(cs_main);\n\n if (chainActive.Tip())\n return QDateTime::fromTime_t(chainActive.Tip()->GetBlockTime());\n\n return QDateTime::fromTime_t(Params().GenesisBlock().GetBlockTime()); \/\/ Genesis block's time of current network\n}\n\nlong ClientModel::getMempoolSize() const\n{\n return mempool.size();\n}\n\nsize_t ClientModel::getMempoolDynamicUsage() const\n{\n return mempool.DynamicMemoryUsage();\n}\n\ndouble ClientModel::getVerificationProgress(const CBlockIndex* tipIn) const\n{\n CBlockIndex* tip = const_cast<CBlockIndex*>(tipIn);\n if (!tip) {\n LOCK(cs_main);\n tip = chainActive.Tip();\n }\n return GuessVerificationProgress(Params().TxData(), tip);\n}\n\nvoid ClientModel::updateTimer()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will acquire the required lock\n Q_EMIT mempoolSizeChanged(getMempoolSize(), getMempoolDynamicUsage());\n Q_EMIT bytesChanged(getTotalBytesRecv(), getTotalBytesSent());\n}\n\nvoid ClientModel::updateNetwork(bool active)\n{\n Q_EMIT setNetworkActive(active);\n}\n\nvoid ClientModel::updateNumConnections(int numConnections)\n{\n Q_EMIT numConnectionsChanged(numConnections);\n}\n\nvoid ClientModel::updateNetworkActive(bool networkActive)\n{\n Q_EMIT networkActiveChanged(networkActive);\n}\n\nvoid ClientModel::updateAlert()\n{\n Q_EMIT alertsChanged(getStatusBarWarnings());\n}\n\nbool ClientModel::inInitialBlockDownload() const\n{\n return IsInitialBlockDownload();\n}\n\nvoid ClientModel::updateBlockchainStatus(int status)\n{\n Q_EMIT BlockchainStatusChanged(status);\n}\n\nenum BlockSource ClientModel::getBlockSource() const\n{\n if (fReindex)\n return BLOCK_SOURCE_REINDEX;\n else if (fImporting)\n return BLOCK_SOURCE_DISK;\n else if (getNumConnections() > 0)\n return BLOCK_SOURCE_NETWORK;\n\n return BLOCK_SOURCE_NONE;\n}\n\nvoid ClientModel::setNetworkActive(bool active)\n{\n if (g_connman) {\n g_connman->SetNetworkActive(active);\n }\n}\n\nbool ClientModel::getNetworkActive() const\n{\n if (g_connman) {\n return g_connman->GetNetworkActive();\n }\n return false;\n}\n\nQString ClientModel::getStatusBarWarnings() const\n{\n return QString::fromStdString(GetWarnings(\"gui\"));\n}\n\nOptionsModel* ClientModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nPeerTableModel* ClientModel::getPeerTableModel()\n{\n return peerTableModel;\n}\n\nBanTableModel* ClientModel::getBanTableModel()\n{\n return banTableModel;\n}\n\nQString ClientModel::formatFullVersion() const\n{\n return QString::fromStdString(FormatFullVersion());\n}\n\nQString ClientModel::formatSubVersion() const\n{\n return QString::fromStdString(strSubVersion);\n}\n\nbool ClientModel::isReleaseVersion() const\n{\n return CLIENT_VERSION_IS_RELEASE;\n}\n\nQString ClientModel::formatClientStartupTime() const\n{\n return QDateTime::fromTime_t(GetStartupTime()).toString();\n}\n\nQString ClientModel::dataDir() const\n{\n return GUIUtil::boostPathToQString(GetDataDir());\n}\n\nvoid ClientModel::updateBanlist()\n{\n banTableModel->refresh();\n}\n\n\/\/ Handlers for core signals\nstatic void ShowProgress(ClientModel* clientmodel, const std::string& title, int nProgress)\n{\n \/\/ emits signal \"showProgress\"\n QMetaObject::invokeMethod(clientmodel, \"showProgress\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(title)),\n Q_ARG(int, nProgress));\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel* clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: qDebug() << \"NotifyNumConnectionsChanged: \" + QString::number(newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection,\n Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyNetworkActiveChanged(ClientModel* clientmodel, bool networkActive)\n{\n QMetaObject::invokeMethod(clientmodel, \"updateNetworkActive\", Qt::QueuedConnection,\n Q_ARG(bool, networkActive));\n}\n\nstatic void NotifyAlertChanged(ClientModel* clientmodel)\n{\n qDebug() << \"NotifyAlertChanged\";\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection);\n}\n\nstatic void NotifyBlockchainStatusChanged(ClientModel* clientmodel, int newStatus)\n{\n qDebug() << \"NotifyBlockchainStatusChanged: \" + QString::number(newStatus);\n QMetaObject::invokeMethod(clientmodel, \"updateBlockchainStatus\", Qt::QueuedConnection,\n Q_ARG(int, newStatus));\n}\n\nstatic void BannedListChanged(ClientModel* clientmodel)\n{\n qDebug() << QString(\"%1: Requesting update for peer banlist\").arg(__func__);\n QMetaObject::invokeMethod(clientmodel, \"updateBanlist\", Qt::QueuedConnection);\n}\n\nstatic void BlockTipChanged(ClientModel* clientmodel, bool initialSync, const CBlockIndex* pIndex, bool fHeader)\n{\n \/\/ lock free async UI updates in case we have a new block tip\n \/\/ during initial sync, only update the UI if the last update\n \/\/ was > 250ms (MODEL_UPDATE_DELAY) ago\n int64_t now = 0;\n if (initialSync)\n now = GetTimeMillis();\n\n int64_t& nLastUpdateNotification = fHeader ? nLastHeaderTipUpdateNotification : nLastBlockTipUpdateNotification;\n\n if (fHeader) {\n \/\/ cache best headers time and height to reduce future cs_main locks\n clientmodel->cachedBestHeaderHeight = pIndex->nHeight;\n clientmodel->cachedBestHeaderTime = pIndex->GetBlockTime();\n }\n \/\/ if we are in-sync, update the UI regardless of last update time\n if (!initialSync || now - nLastUpdateNotification > MODEL_UPDATE_DELAY) {\n \/\/pass an async signal to the UI thread\n QMetaObject::invokeMethod(clientmodel, \"numBlocksChanged\", Qt::QueuedConnection,\n Q_ARG(int, pIndex->nHeight),\n Q_ARG(QDateTime, QDateTime::fromTime_t(pIndex->GetBlockTime())),\n Q_ARG(double, clientmodel->getVerificationProgress(pIndex)),\n Q_ARG(bool, fHeader));\n nLastUpdateNotification = now;\n }\n}\n\nbool ClientModel::isNewVersionAvailable()\n{\n \/\/Connect to default tor node\n QNetworkProxy proxy;\n proxy.setType(QNetworkProxy::Socks5Proxy);\n proxy.setHostName(\"127.0.0.1\");\n proxy.setPort(9081);\n\n QUrl url(\"https:\/\/deeponion.org\/latestversion.txt\");\n qInfo() << url.toString();\n QNetworkRequest request(url);\n QNetworkAccessManager nam;\n nam.setProxy(proxy);\n QNetworkReply* reply = nam.get(request);\n QTimer timer;\n timer.setSingleShot(true);\n timer.start(5000);\n\n while (timer.isActive()) {\n qApp->processEvents();\n if (reply->isFinished()) {\n timer.stop();\n\n \/\/ QMessageBox Msgbox;\n \/\/ Msgbox.setText(reply->readAll());\n \/\/ Msgbox.exec();\n\n QByteArray response_data = reply->readAll();\n int ver = QString(response_data).toInt();\n if (ver == 0) {\n versionStatus = \"<i> - not available - <\/i>\";\n reply->close();\n return false; \/\/Empty response\n }\n if (isNewVersion(ver)) {\n versionStatus = \"<font color=red>outdated<\/>\";\n versionOutDated = true;\n } else {\n versionStatus = \"<font color=green>up to date<\/>\";\n versionOutDated = false;\n }\n reply->close();\n return true;\n }\n }\n \/\/Timeout\n versionStatus = \"<i> - not available - <\/i>\";\n reply->close();\n return false;\n}\n\nbool ClientModel::isNewVersion(int ver)\n{\n if (ver > CLIENT_VERSION)\n return true;\n else\n return false;\n}\n\nQString ClientModel::VersionStatus()\n{\n return versionStatus;\n}\n\nbool ClientModel::VersionOutDated()\n{\n return versionOutDated;\n}\n\nbool ClientModel::isDSUntaringRequested()\n{\n return isDSUntaringRequested_;\n}\n\nvoid ClientModel::setDSUntaringRequested(bool b)\n{\n isDSUntaringRequested_ = b;\n}\n\nvoid ClientModel::setDeepSyncUntarInfo(boost::filesystem::path tarDir, boost::filesystem::path targetDir, boost::filesystem::path tempDir)\n{\n tarDir_ = tarDir;\n targetDir_ = targetDir;\n deepSyncTempDir_ = tempDir;\n}\n\nvoid ClientModel::getDeepSyncUntarInfo(boost::filesystem::path &tarDir, boost::filesystem::path &targetDir, boost::filesystem::path &tempDir)\n{\n tarDir = tarDir_;\n targetDir = targetDir_;\n tempDir = deepSyncTempDir_;\n}\n\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.ShowProgress.connect(boost::bind(ShowProgress, this, boost::placeholders::_1, boost::placeholders::_2));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, boost::placeholders::_1));\n uiInterface.NotifyNetworkActiveChanged.connect(boost::bind(NotifyNetworkActiveChanged, this, boost::placeholders::_1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.connect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.connect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, false));\n uiInterface.NotifyHeaderTip.connect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, true));\n uiInterface.NotifyBlockchainStatusChanged.connect(boost::bind(NotifyBlockchainStatusChanged, this, boost::placeholders::_1));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.ShowProgress.disconnect(boost::bind(ShowProgress, this, boost::placeholders::_1, boost::placeholders::_2));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, boost::placeholders::_1));\n uiInterface.NotifyNetworkActiveChanged.disconnect(boost::bind(NotifyNetworkActiveChanged, this, boost::placeholders::_1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.disconnect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.disconnect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, false));\n uiInterface.NotifyHeaderTip.disconnect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, true));\n uiInterface.NotifyBlockchainStatusChanged.disconnect(boost::bind(NotifyBlockchainStatusChanged, this, boost::placeholders::_1));\n}\n<commit_msg>Request network info for proxy settings.<commit_after>\/\/ Copyright (c) 2011-2017 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <qt\/clientmodel.h>\n\n#include <qt\/bantablemodel.h>\n#include <qt\/guiconstants.h>\n#include <qt\/guiutil.h>\n#include <qt\/peertablemodel.h>\n\n#include <netbase.h>\n#include <chain.h>\n#include <chainparams.h>\n#include <checkpoints.h>\n#include <clientversion.h>\n#include <netaddress.h>\n#include <txmempool.h>\n#include <ui_interface.h>\n#include <util.h>\n#include <validation.h>\n#include <warnings.h>\n\n#include <stdint.h>\n\n#include <QDebug>\n#include <QTimer>\n\nclass CBlockIndex;\n\nstatic int64_t nLastHeaderTipUpdateNotification = 0;\nstatic int64_t nLastBlockTipUpdateNotification = 0;\n\nClientModel::ClientModel(OptionsModel* _optionsModel, QObject* parent) : QObject(parent),\n optionsModel(_optionsModel),\n peerTableModel(0),\n banTableModel(0),\n pollTimer(0)\n{\n cachedBestHeaderHeight = -1;\n cachedBestHeaderTime = -1;\n peerTableModel = new PeerTableModel(this);\n banTableModel = new BanTableModel(this);\n pollTimer = new QTimer(this);\n connect(pollTimer, SIGNAL(timeout()), this, SLOT(updateTimer()));\n pollTimer->start(MODEL_UPDATE_DELAY);\n\n versionOutDated = false;\n\n subscribeToCoreSignals();\n\n setDSUntaringRequested(false);\n}\n\nClientModel::~ClientModel()\n{\n unsubscribeFromCoreSignals();\n}\n\nint ClientModel::getNumConnections(unsigned int flags) const\n{\n CConnman::NumConnections connections = CConnman::CONNECTIONS_NONE;\n\n if (flags == CONNECTIONS_IN)\n connections = CConnman::CONNECTIONS_IN;\n else if (flags == CONNECTIONS_OUT)\n connections = CConnman::CONNECTIONS_OUT;\n else if (flags == CONNECTIONS_ALL)\n connections = CConnman::CONNECTIONS_ALL;\n\n if (g_connman)\n return g_connman->GetNodeCount(connections);\n return 0;\n}\n\nint ClientModel::getNumBlocks() const\n{\n LOCK(cs_main);\n return chainActive.Height();\n}\n\nint ClientModel::getHeaderTipHeight() const\n{\n if (cachedBestHeaderHeight == -1) {\n \/\/ make sure we initially populate the cache via a cs_main lock\n \/\/ otherwise we need to wait for a tip update\n LOCK(cs_main);\n if (pindexBestHeader) {\n cachedBestHeaderHeight = pindexBestHeader->nHeight;\n cachedBestHeaderTime = pindexBestHeader->GetBlockTime();\n }\n }\n return cachedBestHeaderHeight;\n}\n\nint64_t ClientModel::getHeaderTipTime() const\n{\n if (cachedBestHeaderTime == -1) {\n LOCK(cs_main);\n if (pindexBestHeader) {\n cachedBestHeaderHeight = pindexBestHeader->nHeight;\n cachedBestHeaderTime = pindexBestHeader->GetBlockTime();\n }\n }\n return cachedBestHeaderTime;\n}\n\nquint64 ClientModel::getTotalBytesRecv() const\n{\n if (!g_connman)\n return 0;\n return g_connman->GetTotalBytesRecv();\n}\n\nquint64 ClientModel::getTotalBytesSent() const\n{\n if (!g_connman)\n return 0;\n return g_connman->GetTotalBytesSent();\n}\n\nQDateTime ClientModel::getLastBlockDate() const\n{\n LOCK(cs_main);\n\n if (chainActive.Tip())\n return QDateTime::fromTime_t(chainActive.Tip()->GetBlockTime());\n\n return QDateTime::fromTime_t(Params().GenesisBlock().GetBlockTime()); \/\/ Genesis block's time of current network\n}\n\nlong ClientModel::getMempoolSize() const\n{\n return mempool.size();\n}\n\nsize_t ClientModel::getMempoolDynamicUsage() const\n{\n return mempool.DynamicMemoryUsage();\n}\n\ndouble ClientModel::getVerificationProgress(const CBlockIndex* tipIn) const\n{\n CBlockIndex* tip = const_cast<CBlockIndex*>(tipIn);\n if (!tip) {\n LOCK(cs_main);\n tip = chainActive.Tip();\n }\n return GuessVerificationProgress(Params().TxData(), tip);\n}\n\nvoid ClientModel::updateTimer()\n{\n \/\/ no locking required at this point\n \/\/ the following calls will acquire the required lock\n Q_EMIT mempoolSizeChanged(getMempoolSize(), getMempoolDynamicUsage());\n Q_EMIT bytesChanged(getTotalBytesRecv(), getTotalBytesSent());\n}\n\nvoid ClientModel::updateNetwork(bool active)\n{\n Q_EMIT setNetworkActive(active);\n}\n\nvoid ClientModel::updateNumConnections(int numConnections)\n{\n Q_EMIT numConnectionsChanged(numConnections);\n}\n\nvoid ClientModel::updateNetworkActive(bool networkActive)\n{\n Q_EMIT networkActiveChanged(networkActive);\n}\n\nvoid ClientModel::updateAlert()\n{\n Q_EMIT alertsChanged(getStatusBarWarnings());\n}\n\nbool ClientModel::inInitialBlockDownload() const\n{\n return IsInitialBlockDownload();\n}\n\nvoid ClientModel::updateBlockchainStatus(int status)\n{\n Q_EMIT BlockchainStatusChanged(status);\n}\n\nenum BlockSource ClientModel::getBlockSource() const\n{\n if (fReindex)\n return BLOCK_SOURCE_REINDEX;\n else if (fImporting)\n return BLOCK_SOURCE_DISK;\n else if (getNumConnections() > 0)\n return BLOCK_SOURCE_NETWORK;\n\n return BLOCK_SOURCE_NONE;\n}\n\nvoid ClientModel::setNetworkActive(bool active)\n{\n if (g_connman) {\n g_connman->SetNetworkActive(active);\n }\n}\n\nbool ClientModel::getNetworkActive() const\n{\n if (g_connman) {\n return g_connman->GetNetworkActive();\n }\n return false;\n}\n\nQString ClientModel::getStatusBarWarnings() const\n{\n return QString::fromStdString(GetWarnings(\"gui\"));\n}\n\nOptionsModel* ClientModel::getOptionsModel()\n{\n return optionsModel;\n}\n\nPeerTableModel* ClientModel::getPeerTableModel()\n{\n return peerTableModel;\n}\n\nBanTableModel* ClientModel::getBanTableModel()\n{\n return banTableModel;\n}\n\nQString ClientModel::formatFullVersion() const\n{\n return QString::fromStdString(FormatFullVersion());\n}\n\nQString ClientModel::formatSubVersion() const\n{\n return QString::fromStdString(strSubVersion);\n}\n\nbool ClientModel::isReleaseVersion() const\n{\n return CLIENT_VERSION_IS_RELEASE;\n}\n\nQString ClientModel::formatClientStartupTime() const\n{\n return QDateTime::fromTime_t(GetStartupTime()).toString();\n}\n\nQString ClientModel::dataDir() const\n{\n return GUIUtil::boostPathToQString(GetDataDir());\n}\n\nvoid ClientModel::updateBanlist()\n{\n banTableModel->refresh();\n}\n\n\/\/ Handlers for core signals\nstatic void ShowProgress(ClientModel* clientmodel, const std::string& title, int nProgress)\n{\n \/\/ emits signal \"showProgress\"\n QMetaObject::invokeMethod(clientmodel, \"showProgress\", Qt::QueuedConnection,\n Q_ARG(QString, QString::fromStdString(title)),\n Q_ARG(int, nProgress));\n}\n\nstatic void NotifyNumConnectionsChanged(ClientModel* clientmodel, int newNumConnections)\n{\n \/\/ Too noisy: qDebug() << \"NotifyNumConnectionsChanged: \" + QString::number(newNumConnections);\n QMetaObject::invokeMethod(clientmodel, \"updateNumConnections\", Qt::QueuedConnection,\n Q_ARG(int, newNumConnections));\n}\n\nstatic void NotifyNetworkActiveChanged(ClientModel* clientmodel, bool networkActive)\n{\n QMetaObject::invokeMethod(clientmodel, \"updateNetworkActive\", Qt::QueuedConnection,\n Q_ARG(bool, networkActive));\n}\n\nstatic void NotifyAlertChanged(ClientModel* clientmodel)\n{\n qDebug() << \"NotifyAlertChanged\";\n QMetaObject::invokeMethod(clientmodel, \"updateAlert\", Qt::QueuedConnection);\n}\n\nstatic void NotifyBlockchainStatusChanged(ClientModel* clientmodel, int newStatus)\n{\n qDebug() << \"NotifyBlockchainStatusChanged: \" + QString::number(newStatus);\n QMetaObject::invokeMethod(clientmodel, \"updateBlockchainStatus\", Qt::QueuedConnection,\n Q_ARG(int, newStatus));\n}\n\nstatic void BannedListChanged(ClientModel* clientmodel)\n{\n qDebug() << QString(\"%1: Requesting update for peer banlist\").arg(__func__);\n QMetaObject::invokeMethod(clientmodel, \"updateBanlist\", Qt::QueuedConnection);\n}\n\nstatic void BlockTipChanged(ClientModel* clientmodel, bool initialSync, const CBlockIndex* pIndex, bool fHeader)\n{\n \/\/ lock free async UI updates in case we have a new block tip\n \/\/ during initial sync, only update the UI if the last update\n \/\/ was > 250ms (MODEL_UPDATE_DELAY) ago\n int64_t now = 0;\n if (initialSync)\n now = GetTimeMillis();\n\n int64_t& nLastUpdateNotification = fHeader ? nLastHeaderTipUpdateNotification : nLastBlockTipUpdateNotification;\n\n if (fHeader) {\n \/\/ cache best headers time and height to reduce future cs_main locks\n clientmodel->cachedBestHeaderHeight = pIndex->nHeight;\n clientmodel->cachedBestHeaderTime = pIndex->GetBlockTime();\n }\n \/\/ if we are in-sync, update the UI regardless of last update time\n if (!initialSync || now - nLastUpdateNotification > MODEL_UPDATE_DELAY) {\n \/\/pass an async signal to the UI thread\n QMetaObject::invokeMethod(clientmodel, \"numBlocksChanged\", Qt::QueuedConnection,\n Q_ARG(int, pIndex->nHeight),\n Q_ARG(QDateTime, QDateTime::fromTime_t(pIndex->GetBlockTime())),\n Q_ARG(double, clientmodel->getVerificationProgress(pIndex)),\n Q_ARG(bool, fHeader));\n nLastUpdateNotification = now;\n }\n}\n\nbool ClientModel::isNewVersionAvailable()\n{\n \/\/Connect to default tor node\n QNetworkProxy proxy;\n \/\/Set Proxy\n proxy.setType(QNetworkProxy::Socks5Proxy);\n\n for (int n = 0; n < NET_MAX; ++n) {\n enum Network network = static_cast<enum Network>(n);\n if (network == NET_UNROUTABLE || network == NET_INTERNAL)\n continue;\n proxyType _proxy;\n GetProxy(network, _proxy);\n std::string hostname;\n std::string port;\n if (_proxy.IsValid()) {\n hostname = _proxy.proxy.ToStringIP();\n port = _proxy.proxy.ToStringPort();\n }\n proxy.setHostName(QString::fromStdString(hostname));\n proxy.setPort(QString::fromStdString(port).toShort());\n }\n\n QUrl url(\"https:\/\/deeponion.org\/latestversion.txt\");\n qInfo() << url.toString();\n QNetworkRequest request(url);\n QNetworkAccessManager nam;\n nam.setProxy(proxy);\n QNetworkReply* reply = nam.get(request);\n QTimer timer;\n timer.setSingleShot(true);\n timer.start(5000);\n\n while (timer.isActive()) {\n qApp->processEvents();\n if (reply->isFinished()) {\n timer.stop();\n\n \/\/ QMessageBox Msgbox;\n \/\/ Msgbox.setText(reply->readAll());\n \/\/ Msgbox.exec();\n\n QByteArray response_data = reply->readAll();\n int ver = QString(response_data).toInt();\n if (ver == 0) {\n versionStatus = \"<i> - not available - <\/i>\";\n reply->close();\n return false; \/\/Empty response\n }\n if (isNewVersion(ver)) {\n versionStatus = \"<font color=red>outdated<\/>\";\n versionOutDated = true;\n } else {\n versionStatus = \"<font color=green>up to date<\/>\";\n versionOutDated = false;\n }\n reply->close();\n return true;\n }\n }\n \/\/Timeout\n versionStatus = \"<i> - not available - <\/i>\";\n reply->close();\n return false;\n}\n\nbool ClientModel::isNewVersion(int ver)\n{\n if (ver > CLIENT_VERSION)\n return true;\n else\n return false;\n}\n\nQString ClientModel::VersionStatus()\n{\n return versionStatus;\n}\n\nbool ClientModel::VersionOutDated()\n{\n return versionOutDated;\n}\n\nbool ClientModel::isDSUntaringRequested()\n{\n return isDSUntaringRequested_;\n}\n\nvoid ClientModel::setDSUntaringRequested(bool b)\n{\n isDSUntaringRequested_ = b;\n}\n\nvoid ClientModel::setDeepSyncUntarInfo(boost::filesystem::path tarDir, boost::filesystem::path targetDir, boost::filesystem::path tempDir)\n{\n tarDir_ = tarDir;\n targetDir_ = targetDir;\n deepSyncTempDir_ = tempDir;\n}\n\nvoid ClientModel::getDeepSyncUntarInfo(boost::filesystem::path& tarDir, boost::filesystem::path& targetDir, boost::filesystem::path& tempDir)\n{\n tarDir = tarDir_;\n targetDir = targetDir_;\n tempDir = deepSyncTempDir_;\n}\n\n\nvoid ClientModel::subscribeToCoreSignals()\n{\n \/\/ Connect signals to client\n uiInterface.ShowProgress.connect(boost::bind(ShowProgress, this, boost::placeholders::_1, boost::placeholders::_2));\n uiInterface.NotifyNumConnectionsChanged.connect(boost::bind(NotifyNumConnectionsChanged, this, boost::placeholders::_1));\n uiInterface.NotifyNetworkActiveChanged.connect(boost::bind(NotifyNetworkActiveChanged, this, boost::placeholders::_1));\n uiInterface.NotifyAlertChanged.connect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.connect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.connect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, false));\n uiInterface.NotifyHeaderTip.connect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, true));\n uiInterface.NotifyBlockchainStatusChanged.connect(boost::bind(NotifyBlockchainStatusChanged, this, boost::placeholders::_1));\n}\n\nvoid ClientModel::unsubscribeFromCoreSignals()\n{\n \/\/ Disconnect signals from client\n uiInterface.ShowProgress.disconnect(boost::bind(ShowProgress, this, boost::placeholders::_1, boost::placeholders::_2));\n uiInterface.NotifyNumConnectionsChanged.disconnect(boost::bind(NotifyNumConnectionsChanged, this, boost::placeholders::_1));\n uiInterface.NotifyNetworkActiveChanged.disconnect(boost::bind(NotifyNetworkActiveChanged, this, boost::placeholders::_1));\n uiInterface.NotifyAlertChanged.disconnect(boost::bind(NotifyAlertChanged, this));\n uiInterface.BannedListChanged.disconnect(boost::bind(BannedListChanged, this));\n uiInterface.NotifyBlockTip.disconnect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, false));\n uiInterface.NotifyHeaderTip.disconnect(boost::bind(BlockTipChanged, this, boost::placeholders::_1, boost::placeholders::_2, true));\n uiInterface.NotifyBlockchainStatusChanged.disconnect(boost::bind(NotifyBlockchainStatusChanged, this, boost::placeholders::_1));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file license.txt or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"qtipcserver.h\"\n#include \"guiconstants.h\"\n#include \"ui_interface.h\"\n#include \"util.h\"\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n#include <boost\/version.hpp>\n\n#if defined(WIN32) && (!defined(BOOST_INTERPROCESS_HAS_WINDOWS_KERNEL_BOOTTIME) || !defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME) || BOOST_VERSION < 104900)\n#warning Compiling without BOOST_INTERPROCESS_HAS_WINDOWS_KERNEL_BOOTTIME and BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME uncommented in boost\/interprocess\/detail\/tmp_dir_helpers.hpp or using a boost version before 1.49 may have unintended results see svn.boost.org\/trac\/boost\/ticket\/5392\n#endif\n\nusing namespace boost;\nusing namespace boost::interprocess;\nusing namespace boost::posix_time;\n\nstatic void ipcThread2(void* pArg);\n\n#ifdef MAC_OSX\n\/\/ URI handling not implemented on OSX yet\n\nvoid ipcInit() { }\n\n#else\n\nstatic void ipcThread(void* pArg)\n{\n IMPLEMENT_RANDOMIZE_STACK(ipcThread(pArg));\n\t\n \/\/ Make this thread recognisable as the GUI-IPC thread\n RenameThread(\"bitcoin-gui-ipc\");\n\t\n try\n {\n ipcThread2(pArg);\n }\n catch (std::exception& e) {\n PrintExceptionContinue(&e, \"ipcThread()\");\n } catch (...) {\n PrintExceptionContinue(NULL, \"ipcThread()\");\n }\n printf(\"ipcThread exited\\n\");\n}\n\nstatic void ipcThread2(void* pArg)\n{\n printf(\"ipcThread started\\n\");\n\n message_queue* mq = (message_queue*)pArg;\n char buffer[MAX_URI_LENGTH + 1] = \"\";\n size_t nSize = 0;\n unsigned int nPriority = 0;\n\n loop\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(100);\n if (mq->timed_receive(&buffer, sizeof(buffer), nSize, nPriority, d))\n {\n uiInterface.ThreadSafeHandleURI(std::string(buffer, nSize));\n Sleep(1000);\n }\n\n if (fShutdown)\n break;\n }\n\n \/\/ Remove message queue\n message_queue::remove(BITCOINURI_QUEUE_NAME);\n \/\/ Cleanup allocated memory\n delete mq;\n}\n\nvoid ipcInit()\n{\n message_queue* mq = NULL;\n char buffer[MAX_URI_LENGTH + 1] = \"\";\n size_t nSize = 0;\n unsigned int nPriority = 0;\n\n try {\n mq = new message_queue(open_or_create, BITCOINURI_QUEUE_NAME, 2, MAX_URI_LENGTH);\n\n \/\/ Make sure we don't lose any barcoin: URIs\n for (int i = 0; i < 2; i++)\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(1);\n if (mq->timed_receive(&buffer, sizeof(buffer), nSize, nPriority, d))\n {\n uiInterface.ThreadSafeHandleURI(std::string(buffer, nSize));\n }\n else\n break;\n }\n\n \/\/ Make sure only one instance is listening\n message_queue::remove(BITCOINURI_QUEUE_NAME);\n delete mq;\n\n mq = new message_queue(open_or_create, BITCOINURI_QUEUE_NAME, 2, MAX_URI_LENGTH);\n }\n catch (interprocess_exception &ex) {\n printf(\"ipcInit() - boost interprocess exception #%d: %s\\n\", ex.get_error_code(), ex.what());\n return;\n }\n\n if (!CreateThread(ipcThread, mq))\n {\n delete mq;\n return;\n }\n}\n\n#endif\n<commit_msg>Update qtipcserver.cpp<commit_after>\/\/ Copyright (c) 2009-2012 The Bitcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file license.txt or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"qtipcserver.h\"\n#include \"guiconstants.h\"\n#include \"ui_interface.h\"\n#include \"util.h\"\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/interprocess\/ipc\/message_queue.hpp>\n#include <boost\/version.hpp>\n\n#if defined(WIN32) && (!defined(BOOST_INTERPROCESS_HAS_WINDOWS_KERNEL_BOOTTIME) || !defined(BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME) || BOOST_VERSION < 104900)\n#warning Compiling without BOOST_INTERPROCESS_HAS_WINDOWS_KERNEL_BOOTTIME and BOOST_INTERPROCESS_HAS_KERNEL_BOOTTIME uncommented in boost\/interprocess\/detail\/tmp_dir_helpers.hpp or using a boost version before 1.49 may have unintended results see svn.boost.org\/trac\/boost\/ticket\/5392\n#endif\n\nusing namespace boost;\nusing namespace boost::interprocess;\nusing namespace boost::posix_time;\n\nstatic void ipcThread2(void* pArg);\n\n#ifdef MAC_OSX\n\/\/ URI handling not implemented on OSX yet\n\nvoid ipcInit() { }\n\n#else\n\nstatic void ipcThread(void* pArg)\n{\n IMPLEMENT_RANDOMIZE_STACK(ipcThread(pArg));\n\t\n \/\/ Make this thread recognisable as the GUI-IPC thread\n RenameThread(\"bitcoin-gui-ipc\");\n\t\n try\n {\n ipcThread2(pArg);\n }\n catch (std::exception& e) {\n PrintExceptionContinue(&e, \"ipcThread()\");\n } catch (...) {\n PrintExceptionContinue(NULL, \"ipcThread()\");\n }\n printf(\"ipcThread exited\\n\");\n}\n\nstatic void ipcThread2(void* pArg)\n{\n printf(\"ipcThread started\\n\");\n\n message_queue* mq = (message_queue*)pArg;\n char buffer[MAX_URI_LENGTH + 1] = \"\";\n size_t nSize = 0;\n unsigned int nPriority = 0;\n\n loop\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(100);\n if (mq->timed_receive(&buffer, sizeof(buffer), nSize, nPriority, d))\n {\n uiInterface.ThreadSafeHandleURI(std::string(buffer, nSize));\n Sleep(1000);\n }\n\n if (fShutdown)\n break;\n }\n\n \/\/ Remove message queue\n message_queue::remove(BITCOINURI_QUEUE_NAME);\n \/\/ Cleanup allocated memory\n delete mq;\n}\n\nvoid ipcInit()\n{\n message_queue* mq = NULL;\n char buffer[MAX_URI_LENGTH + 1] = \"\";\n size_t nSize = 0;\n unsigned int nPriority = 0;\n\n try {\n mq = new message_queue(open_or_create, BITCOINURI_QUEUE_NAME, 2, MAX_URI_LENGTH);\n\n \/\/ Make sure we don't lose any lightcoin: URIs\n for (int i = 0; i < 2; i++)\n {\n ptime d = boost::posix_time::microsec_clock::universal_time() + millisec(1);\n if (mq->timed_receive(&buffer, sizeof(buffer), nSize, nPriority, d))\n {\n uiInterface.ThreadSafeHandleURI(std::string(buffer, nSize));\n }\n else\n break;\n }\n\n \/\/ Make sure only one instance is listening\n message_queue::remove(BITCOINURI_QUEUE_NAME);\n delete mq;\n\n mq = new message_queue(open_or_create, BITCOINURI_QUEUE_NAME, 2, MAX_URI_LENGTH);\n }\n catch (interprocess_exception &ex) {\n printf(\"ipcInit() - boost interprocess exception #%d: %s\\n\", ex.get_error_code(), ex.what());\n return;\n }\n\n if (!CreateThread(ipcThread, mq))\n {\n delete mq;\n return;\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n Flexisip, a flexible SIP proxy server with media capabilities.\n Copyright (C) 2014 Belledonne Communications SARL.\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"module.hh\"\n#include \"agent.hh\"\n#include \"log\/logmanager.hh\"\n#include <sofia-sip\/tport.h>\n#include <sofia-sip\/msg_addr.h>\n#include <unordered_map>\n\nusing namespace ::std;\n\ntypedef struct DosContext {\n uint64_t recv_msg_count_since_last_check;\n\tdouble last_check_recv_msg_check_time;\n\tdouble packet_count_rate;\n} DosContext;\n\nclass ModuleDoS: public Module, ModuleToolbox {\n\nprivate:\n\tstatic ModuleInfo<ModuleDoS> sInfo;\n\tint mTimePeriod;\n\tint mPacketRateLimit;\n\tint mBanTime;\n\tunordered_map<string, DosContext> mDosContexts;\n\n\tvoid onDeclare(GenericStruct *module_config) {\n\t\tConfigItemDescriptor configs[] = {\n\t\t\t{ Integer , \"time-period\", \"Number of milliseconds to calculate the packet rate\", \"3000\"},\n\t\t\t{ Integer , \"packet-rate-limit\", \"Maximum packet rate received in [time-period] millisecond(s) to consider to consider it a DoS attack.\", \"10\"},\n\t\t\t{ Integer , \"ban-time\", \"Number of minutes to ban the ip\/port using iptables (might be less because it justs uses the minutes of the clock, not the seconds. So if the unban command is queued at 13:11:56 and scheduled and the ban time is 1 minute, it will be executed at 13:12:00)\", \"2\"},\n\t\t\tconfig_item_end\n\t\t};1\n\t\tmodule_config->get<ConfigBoolean>(\"enabled\")->setDefault(\"true\");\n\t\tmodule_config->addChildrenValues(configs);\n\t}\n\n\tvoid onLoad(const GenericStruct *mc) {\n\t\tmTimePeriod = mc->get<ConfigInt>(\"time-period\")->read();\n\t\tmPacketRateLimit = mc->get<ConfigInt>(\"packet-rate-limit\")->read();\n\t\tmBanTime = mc->get<ConfigInt>(\"ban-time\")->read();\n\t\t\n\t\ttport_t *primaries=tport_primaries(nta_agent_tports(mAgent->getSofiaAgent()));\n\t\tif (primaries == NULL) LOGF(\"No sip transport defined.\");\n\t\tfor(tport_t *tport = primaries; tport != NULL; tport = tport_next(tport)) {\n\t\t\ttport_set_params(tport, TPTAG_DOS(mTimePeriod), TAG_END());\n\t\t}\n\t}\n\n\tvoid onUnload() {\n\t\t\n\t}\n\t\n\tvoid onRequest(shared_ptr<RequestSipEvent> &ev) {\n\t\tshared_ptr<tport_t> inTport = ev->getIncomingTport();\n\t\ttport_t *tport = inTport.get();\n\t\t\n\t\tif (tport_is_udp(tport)) { \/\/ Sofia doesn't create a secondary tport for udp, so it will ban the primary and we don't want that\n\t\t\tshared_ptr<MsgSip> msg = ev->getMsgSip();\n\t\t\tMsgSip *msgSip = msg.get();\n\t\t\tsu_sockaddr_t su[1];\n\t\t\tsocklen_t len = sizeof su;\n\t\t\tsockaddr *addr = NULL;\n\t\t\tchar ip[NI_MAXHOST], port[NI_MAXSERV];\n\t\t\tchar iptables_cmd[512];\n\t\t\tmsg_get_address(msgSip->getMsg(), su, &len);\n\t\t\taddr = &(su[0].su_sa);\n\t\t\t\n\t\t\tif (addr != NULL && getnameinfo(addr, len, ip, sizeof(ip), port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV) == 0) {\n\t\t\t\tstring id = string(ip) + \":\" + string(port);\n\t\t\t\tstruct timeval now;\n\t\t\t\tDosContext dosContext = mDosContexts[id];\n\t\t\t\tdouble now_in_millis, time_elapsed;\n\t\t\t\t\n\t\t\t\tdosContext.recv_msg_count_since_last_check++;\n\t\t\t\tgettimeofday(&now, NULL);\n\t\t\t\tnow_in_millis = now.tv_sec * 1000 + (now.tv_usec \/ 1000);\n\t\t\t\tif (dosContext.last_check_recv_msg_check_time == 0) {\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ttime_elapsed = now_in_millis - dosContext.last_check_recv_msg_check_time;\n\t\t\t\tif (time_elapsed < 0) {\n\t\t\t\t\tdosContext.packet_count_rate = 0;\n\t\t\t\t\tdosContext.recv_msg_count_since_last_check = 0;\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t} else if (time_elapsed >= mTimePeriod) {\n\t\t\t\t\tdosContext.packet_count_rate = dosContext.recv_msg_count_since_last_check \/ time_elapsed * 1000;\n\t\t\t\t\tdosContext.recv_msg_count_since_last_check = 0;\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t}\n\t\t\t\tmDosContexts[id] = dosContext;\n\t\t\t\t\n\t\t\t\tif (dosContext.packet_count_rate >= mPacketRateLimit) {\n\t\t\t\t\tif (getuid() != 0) {\n\t\t\t\t\t\tLOGE(\"Flexisip not started with root privileges! Can't add iptables rule\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tLOGW(\"Packet count rate (%f) >= limit (%i), blocking ip\/port %s\/%s on protocol udp for %i minutes\", dosContext.packet_count_rate, mPacketRateLimit, ip, port, mBanTime);\n\t\t\t\t\tsnprintf(iptables_cmd, sizeof(iptables_cmd), \"iptables -A INPUT -p udp -s %s -m multiport --sports %s -j DROP && echo \\\"iptables -D INPUT -p udp -s %s -m multiport --sports %s -j DROP\\\" | at now +%i minutes\", \n\t\t\t\t\t\tip, port, ip, port, mBanTime);\n\t\t\t\t\tsystem(iptables_cmd);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfloat packet_count_rate = tport_get_packet_count_rate(tport);\n\t\t\tif (packet_count_rate >= mPacketRateLimit) {\n\t\t\t\tchar iptables_cmd[512];\n\t\t\t\tsockaddr *addr = tport_get_address(tport)->ai_addr;\n\t\t\t\tsocklen_t len = tport_get_address(tport)->ai_addrlen;\n\t\t\t\tchar ip[NI_MAXHOST], port[NI_MAXSERV];\n\t\t\t\tif (getnameinfo(addr, len, ip, sizeof(ip), port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV) == 0) {\n\t\t\t\t\tif (getuid() != 0) {\n\t\t\t\t\t\tLOGE(\"Flexisip not started with root privileges! Can't add iptables rule\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tLOGW(\"Packet count rate (%f) >= limit (%i), blocking ip\/port %s\/%s on protocol tcp for %i minutes\", packet_count_rate, mPacketRateLimit, ip, port, mBanTime);\n\t\t\t\t\tsnprintf(iptables_cmd, sizeof(iptables_cmd), \"iptables -A INPUT -p tcp -s %s -m multiport --sports %s -j DROP && echo \\\"iptables -D INPUT -p tcp -s %s -m multiport --sports %s -j DROP\\\" | at now +%i minutes\", \n\t\t\t\t\t\tip, port, ip, port, mBanTime);\n\t\t\t\t\tsystem(iptables_cmd);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ttport_reset_packet_count_rate(tport);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid onResponse(std::shared_ptr<ResponseSipEvent> &ev) {\n\t\t\n\t};\n\npublic:\n\t\tModuleDoS(Agent *ag) : Module(ag) {\n\t\t\t\n\t\t}\n\n\t\t~ModuleDoS() {\n\t\t\t\n\t\t}\n};\n\nModuleInfo<ModuleDoS> ModuleDoS::sInfo(\"DoS\",\n\t\t\"This module bans user when they are sending too much packets on a given timelapse\"\n\t\t\"To see the list of currently banned ips\/ports, use iptables -L\"\n\t\t\"You can also check the queue of unban commands using atq\",\n\t\tModuleInfoBase::ModuleOid::DoS);<commit_msg>Fix typo<commit_after>\/*\n Flexisip, a flexible SIP proxy server with media capabilities.\n Copyright (C) 2014 Belledonne Communications SARL.\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"module.hh\"\n#include \"agent.hh\"\n#include \"log\/logmanager.hh\"\n#include <sofia-sip\/tport.h>\n#include <sofia-sip\/msg_addr.h>\n#include <unordered_map>\n\nusing namespace ::std;\n\ntypedef struct DosContext {\n uint64_t recv_msg_count_since_last_check;\n\tdouble last_check_recv_msg_check_time;\n\tdouble packet_count_rate;\n} DosContext;\n\nclass ModuleDoS: public Module, ModuleToolbox {\n\nprivate:\n\tstatic ModuleInfo<ModuleDoS> sInfo;\n\tint mTimePeriod;\n\tint mPacketRateLimit;\n\tint mBanTime;\n\tunordered_map<string, DosContext> mDosContexts;\n\n\tvoid onDeclare(GenericStruct *module_config) {\n\t\tConfigItemDescriptor configs[] = {\n\t\t\t{ Integer , \"time-period\", \"Number of milliseconds to calculate the packet rate\", \"3000\"},\n\t\t\t{ Integer , \"packet-rate-limit\", \"Maximum packet rate received in [time-period] millisecond(s) to consider to consider it a DoS attack.\", \"10\"},\n\t\t\t{ Integer , \"ban-time\", \"Number of minutes to ban the ip\/port using iptables (might be less because it justs uses the minutes of the clock, not the seconds. So if the unban command is queued at 13:11:56 and scheduled and the ban time is 1 minute, it will be executed at 13:12:00)\", \"2\"},\n\t\t\tconfig_item_end\n\t\t};\n\t\tmodule_config->get<ConfigBoolean>(\"enabled\")->setDefault(\"true\");\n\t\tmodule_config->addChildrenValues(configs);\n\t}\n\n\tvoid onLoad(const GenericStruct *mc) {\n\t\tmTimePeriod = mc->get<ConfigInt>(\"time-period\")->read();\n\t\tmPacketRateLimit = mc->get<ConfigInt>(\"packet-rate-limit\")->read();\n\t\tmBanTime = mc->get<ConfigInt>(\"ban-time\")->read();\n\t\t\n\t\ttport_t *primaries=tport_primaries(nta_agent_tports(mAgent->getSofiaAgent()));\n\t\tif (primaries == NULL) LOGF(\"No sip transport defined.\");\n\t\tfor(tport_t *tport = primaries; tport != NULL; tport = tport_next(tport)) {\n\t\t\ttport_set_params(tport, TPTAG_DOS(mTimePeriod), TAG_END());\n\t\t}\n\t}\n\n\tvoid onUnload() {\n\t\t\n\t}\n\t\n\tvoid onRequest(shared_ptr<RequestSipEvent> &ev) {\n\t\tshared_ptr<tport_t> inTport = ev->getIncomingTport();\n\t\ttport_t *tport = inTport.get();\n\t\t\n\t\tif (tport_is_udp(tport)) { \/\/ Sofia doesn't create a secondary tport for udp, so it will ban the primary and we don't want that\n\t\t\tshared_ptr<MsgSip> msg = ev->getMsgSip();\n\t\t\tMsgSip *msgSip = msg.get();\n\t\t\tsu_sockaddr_t su[1];\n\t\t\tsocklen_t len = sizeof su;\n\t\t\tsockaddr *addr = NULL;\n\t\t\tchar ip[NI_MAXHOST], port[NI_MAXSERV];\n\t\t\tchar iptables_cmd[512];\n\t\t\tmsg_get_address(msgSip->getMsg(), su, &len);\n\t\t\taddr = &(su[0].su_sa);\n\t\t\t\n\t\t\tif (addr != NULL && getnameinfo(addr, len, ip, sizeof(ip), port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV) == 0) {\n\t\t\t\tstring id = string(ip) + \":\" + string(port);\n\t\t\t\tstruct timeval now;\n\t\t\t\tDosContext dosContext = mDosContexts[id];\n\t\t\t\tdouble now_in_millis, time_elapsed;\n\t\t\t\t\n\t\t\t\tdosContext.recv_msg_count_since_last_check++;\n\t\t\t\tgettimeofday(&now, NULL);\n\t\t\t\tnow_in_millis = now.tv_sec * 1000 + (now.tv_usec \/ 1000);\n\t\t\t\tif (dosContext.last_check_recv_msg_check_time == 0) {\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ttime_elapsed = now_in_millis - dosContext.last_check_recv_msg_check_time;\n\t\t\t\tif (time_elapsed < 0) {\n\t\t\t\t\tdosContext.packet_count_rate = 0;\n\t\t\t\t\tdosContext.recv_msg_count_since_last_check = 0;\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t} else if (time_elapsed >= mTimePeriod) {\n\t\t\t\t\tdosContext.packet_count_rate = dosContext.recv_msg_count_since_last_check \/ time_elapsed * 1000;\n\t\t\t\t\tdosContext.recv_msg_count_since_last_check = 0;\n\t\t\t\t\tdosContext.last_check_recv_msg_check_time = now_in_millis;\n\t\t\t\t}\n\t\t\t\tmDosContexts[id] = dosContext;\n\t\t\t\t\n\t\t\t\tif (dosContext.packet_count_rate >= mPacketRateLimit) {\n\t\t\t\t\tif (getuid() != 0) {\n\t\t\t\t\t\tLOGE(\"Flexisip not started with root privileges! Can't add iptables rule\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tLOGW(\"Packet count rate (%f) >= limit (%i), blocking ip\/port %s\/%s on protocol udp for %i minutes\", dosContext.packet_count_rate, mPacketRateLimit, ip, port, mBanTime);\n\t\t\t\t\tsnprintf(iptables_cmd, sizeof(iptables_cmd), \"iptables -A INPUT -p udp -s %s -m multiport --sports %s -j DROP && echo \\\"iptables -D INPUT -p udp -s %s -m multiport --sports %s -j DROP\\\" | at now +%i minutes\", \n\t\t\t\t\t\tip, port, ip, port, mBanTime);\n\t\t\t\t\tsystem(iptables_cmd);\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfloat packet_count_rate = tport_get_packet_count_rate(tport);\n\t\t\tif (packet_count_rate >= mPacketRateLimit) {\n\t\t\t\tchar iptables_cmd[512];\n\t\t\t\tsockaddr *addr = tport_get_address(tport)->ai_addr;\n\t\t\t\tsocklen_t len = tport_get_address(tport)->ai_addrlen;\n\t\t\t\tchar ip[NI_MAXHOST], port[NI_MAXSERV];\n\t\t\t\tif (getnameinfo(addr, len, ip, sizeof(ip), port, sizeof(port), NI_NUMERICHOST | NI_NUMERICSERV) == 0) {\n\t\t\t\t\tif (getuid() != 0) {\n\t\t\t\t\t\tLOGE(\"Flexisip not started with root privileges! Can't add iptables rule\");\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tLOGW(\"Packet count rate (%f) >= limit (%i), blocking ip\/port %s\/%s on protocol tcp for %i minutes\", packet_count_rate, mPacketRateLimit, ip, port, mBanTime);\n\t\t\t\t\tsnprintf(iptables_cmd, sizeof(iptables_cmd), \"iptables -A INPUT -p tcp -s %s -m multiport --sports %s -j DROP && echo \\\"iptables -D INPUT -p tcp -s %s -m multiport --sports %s -j DROP\\\" | at now +%i minutes\", \n\t\t\t\t\t\tip, port, ip, port, mBanTime);\n\t\t\t\t\tsystem(iptables_cmd);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\ttport_reset_packet_count_rate(tport);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvoid onResponse(std::shared_ptr<ResponseSipEvent> &ev) {\n\t\t\n\t};\n\npublic:\n\t\tModuleDoS(Agent *ag) : Module(ag) {\n\t\t\t\n\t\t}\n\n\t\t~ModuleDoS() {\n\t\t\t\n\t\t}\n};\n\nModuleInfo<ModuleDoS> ModuleDoS::sInfo(\"DoS\",\n\t\t\"This module bans user when they are sending too much packets on a given timelapse\"\n\t\t\"To see the list of currently banned ips\/ports, use iptables -L\"\n\t\t\"You can also check the queue of unban commands using atq\",\n\t\tModuleInfoBase::ModuleOid::DoS);<|endoftext|>"} {"text":"<commit_before>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <errno.h>\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"common\/config.h\"\n#include \"common\/ceph_argparse.h\"\n#include \"global\/global_init.h\"\n#include \"mon\/MonMap.h\"\n\nvoid usage()\n{\n cout << \" usage: [--print] [--create [--clobber]] [--add name 1.2.3.4:567] [--rm name] <mapfilename>\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n\n const char *me = argv[0];\n\n std::string fn;\n bool print = false;\n bool create = false;\n bool clobber = false;\n bool modified = false;\n map<string,entity_addr_t> add;\n list<string> rm;\n\n global_init(args, CEPH_ENTITY_TYPE_CLIENT, CODE_ENVIRONMENT_UTILITY,\n\t CINIT_FLAG_NO_DEFAULT_CONFIG_FILE);\n common_init_finish(g_ceph_context);\n std::string val;\n for (std::vector<const char*>::iterator i = args.begin(); i != args.end(); ) {\n if (ceph_argparse_double_dash(args, i)) {\n break;\n } else if (ceph_argparse_flag(args, i, \"-h\", \"--help\", (char*)NULL)) {\n usage();\n } else if (ceph_argparse_flag(args, i, \"-p\", \"--print\", (char*)NULL)) {\n print = true;\n } else if (ceph_argparse_flag(args, i, \"--create\", (char*)NULL)) {\n create = true;\n } else if (ceph_argparse_flag(args, i, \"--clobber\", (char*)NULL)) {\n clobber = true;\n } else if (ceph_argparse_flag(args, i, \"--add\", (char*)NULL)) {\n string name = *i;\n i = args.erase(i);\n if (i == args.end())\n\tusage();\n entity_addr_t addr;\n if (!addr.parse(*i)) {\n\tcerr << me << \": invalid ip:port '\" << *i << \"'\" << std::endl;\n\treturn -1;\n }\n if (addr.get_port() == 0)\n\taddr.set_port(CEPH_MON_PORT);\n add[name] = addr;\n modified = true;\n i = args.erase(i);\n } else if (ceph_argparse_witharg(args, i, &val, \"--rm\", (char*)NULL)) {\n rm.push_back(val);\n modified = true;\n } else {\n ++i;\n }\n }\n if (args.size() < 1) {\n cerr << me << \": must specify monmap filename\" << std::endl;\n usage();\n }\n else if (args.size() > 1) {\n cerr << me << \": too many arguments\" << std::endl;\n usage();\n }\n fn = args[0];\n \n MonMap monmap;\n\n cout << me << \": monmap file \" << fn << std::endl;\n\n int r = 0;\n if (!(create && clobber)) {\n try {\n r = monmap.read(fn.c_str());\n } catch (...) {\n cerr << me << \": unable to read monmap file\" << std::endl;\n return -1;\n }\n }\n\n char buf[80];\n if (!create && r < 0) {\n cerr << me << \": couldn't open \" << fn << \": \" << strerror_r(-r, buf, sizeof(buf)) << std::endl;\n return -1;\n } \n else if (create && !clobber && r == 0) {\n cerr << me << \": \" << fn << \" exists, --clobber to overwrite\" << std::endl;\n return -1;\n }\n\n if (create) {\n monmap.created = ceph_clock_now(g_ceph_context);\n monmap.last_changed = monmap.created;\n srand(getpid() + time(0));\n monmap.generate_fsid();\n cout << me << \": generated fsid \" << monmap.fsid << std::endl;\n modified = true;\n }\n\n for (map<string,entity_addr_t>::iterator p = add.begin(); p != add.end(); p++) {\n if (monmap.contains(p->first)) {\n cerr << me << \": map already contains mon.\" << p->first << std::endl;\n usage();\n }\n if (monmap.contains(p->second)) {\n cerr << me << \": map already contains \" << p->second << std::endl;\n usage();\n }\n monmap.add(p->first, p->second);\n }\n for (list<string>::iterator p = rm.begin(); p != rm.end(); p++) {\n cout << me << \": removing \" << *p << std::endl;\n if (!monmap.contains(*p)) {\n cerr << me << \": map does not contain \" << *p << std::endl;\n usage();\n }\n monmap.remove(*p);\n }\n\n if (!print && !modified)\n usage();\n\n if (modified)\n monmap.epoch++;\n\n if (print) \n monmap.print(cout);\n\n if (modified) {\n \/\/ write it out\n cout << me << \": writing epoch \" << monmap.epoch\n\t << \" to \" << fn\n\t << \" (\" << monmap.size() << \" monitors)\" \n\t << std::endl;\n int r = monmap.write(fn.c_str());\n if (r < 0) {\n cerr << \"monmaptool: error writing to '\" << fn << \"': \" << strerror_r(-r, buf, sizeof(buf)) << std::endl;\n return 1;\n }\n }\n \n\n return 0;\n}\n<commit_msg>monmaptool: new maps get epoch 0<commit_after>\/\/ -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- \n\/\/ vim: ts=8 sw=2 smarttab\n\/*\n * Ceph - scalable distributed file system\n *\n * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>\n *\n * This is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software \n * Foundation. See file COPYING.\n * \n *\/\n\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <errno.h>\n\n#include <sys\/stat.h>\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"common\/config.h\"\n#include \"common\/ceph_argparse.h\"\n#include \"global\/global_init.h\"\n#include \"mon\/MonMap.h\"\n\nvoid usage()\n{\n cout << \" usage: [--print] [--create [--clobber]] [--add name 1.2.3.4:567] [--rm name] <mapfilename>\" << std::endl;\n exit(1);\n}\n\nint main(int argc, const char **argv)\n{\n vector<const char*> args;\n argv_to_vec(argc, argv, args);\n\n const char *me = argv[0];\n\n std::string fn;\n bool print = false;\n bool create = false;\n bool clobber = false;\n bool modified = false;\n map<string,entity_addr_t> add;\n list<string> rm;\n\n global_init(args, CEPH_ENTITY_TYPE_CLIENT, CODE_ENVIRONMENT_UTILITY,\n\t CINIT_FLAG_NO_DEFAULT_CONFIG_FILE);\n common_init_finish(g_ceph_context);\n std::string val;\n for (std::vector<const char*>::iterator i = args.begin(); i != args.end(); ) {\n if (ceph_argparse_double_dash(args, i)) {\n break;\n } else if (ceph_argparse_flag(args, i, \"-h\", \"--help\", (char*)NULL)) {\n usage();\n } else if (ceph_argparse_flag(args, i, \"-p\", \"--print\", (char*)NULL)) {\n print = true;\n } else if (ceph_argparse_flag(args, i, \"--create\", (char*)NULL)) {\n create = true;\n } else if (ceph_argparse_flag(args, i, \"--clobber\", (char*)NULL)) {\n clobber = true;\n } else if (ceph_argparse_flag(args, i, \"--add\", (char*)NULL)) {\n string name = *i;\n i = args.erase(i);\n if (i == args.end())\n\tusage();\n entity_addr_t addr;\n if (!addr.parse(*i)) {\n\tcerr << me << \": invalid ip:port '\" << *i << \"'\" << std::endl;\n\treturn -1;\n }\n if (addr.get_port() == 0)\n\taddr.set_port(CEPH_MON_PORT);\n add[name] = addr;\n modified = true;\n i = args.erase(i);\n } else if (ceph_argparse_witharg(args, i, &val, \"--rm\", (char*)NULL)) {\n rm.push_back(val);\n modified = true;\n } else {\n ++i;\n }\n }\n if (args.size() < 1) {\n cerr << me << \": must specify monmap filename\" << std::endl;\n usage();\n }\n else if (args.size() > 1) {\n cerr << me << \": too many arguments\" << std::endl;\n usage();\n }\n fn = args[0];\n \n MonMap monmap;\n\n cout << me << \": monmap file \" << fn << std::endl;\n\n int r = 0;\n if (!(create && clobber)) {\n try {\n r = monmap.read(fn.c_str());\n } catch (...) {\n cerr << me << \": unable to read monmap file\" << std::endl;\n return -1;\n }\n }\n\n char buf[80];\n if (!create && r < 0) {\n cerr << me << \": couldn't open \" << fn << \": \" << strerror_r(-r, buf, sizeof(buf)) << std::endl;\n return -1;\n } \n else if (create && !clobber && r == 0) {\n cerr << me << \": \" << fn << \" exists, --clobber to overwrite\" << std::endl;\n return -1;\n }\n\n if (create) {\n monmap.epoch = 0;\n monmap.created = ceph_clock_now(g_ceph_context);\n monmap.last_changed = monmap.created;\n srand(getpid() + time(0));\n monmap.generate_fsid();\n cout << me << \": generated fsid \" << monmap.fsid << std::endl;\n modified = true;\n }\n\n for (map<string,entity_addr_t>::iterator p = add.begin(); p != add.end(); p++) {\n if (monmap.contains(p->first)) {\n cerr << me << \": map already contains mon.\" << p->first << std::endl;\n usage();\n }\n if (monmap.contains(p->second)) {\n cerr << me << \": map already contains \" << p->second << std::endl;\n usage();\n }\n monmap.add(p->first, p->second);\n }\n for (list<string>::iterator p = rm.begin(); p != rm.end(); p++) {\n cout << me << \": removing \" << *p << std::endl;\n if (!monmap.contains(*p)) {\n cerr << me << \": map does not contain \" << *p << std::endl;\n usage();\n }\n monmap.remove(*p);\n }\n\n if (!print && !modified)\n usage();\n\n if (modified && !create)\n monmap.epoch++;\n\n if (print) \n monmap.print(cout);\n\n if (modified) {\n \/\/ write it out\n cout << me << \": writing epoch \" << monmap.epoch\n\t << \" to \" << fn\n\t << \" (\" << monmap.size() << \" monitors)\" \n\t << std::endl;\n int r = monmap.write(fn.c_str());\n if (r < 0) {\n cerr << \"monmaptool: error writing to '\" << fn << \"': \" << strerror_r(-r, buf, sizeof(buf)) << std::endl;\n return 1;\n }\n }\n \n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * main .cpp file for CheckpointSystemTest\n *\n *\/\n\n\n#include <columns\/buildandrun.hpp>\n#include <io\/ParamGroupHandler.hpp>\n#include \"CPTestInputLayer.hpp\"\n#include \"VaryingHyPerConn.hpp\"\n\nclass CustomGroupHandler : public ParamGroupHandler {\npublic:\n CustomGroupHandler() {}\n virtual ~CustomGroupHandler() {}\n virtual ParamGroupType getGroupType(char const * keyword) {\n ParamGroupType result = UnrecognizedGroupType;\n if (keyword==NULL) { result = UnrecognizedGroupType; }\n else if (!strcmp(keyword, \"CPTestInputLayer\")) { result = LayerGroupType; }\n else if (!strcmp(keyword, \"VaryingHyPerConn\")) { result = ConnectionGroupType; }\n else { result = UnrecognizedGroupType; }\n return result;\n }\n virtual HyPerLayer * createLayer(char const * keyword, char const * name, HyPerCol * hc) {\n HyPerLayer * addedLayer = NULL;\n bool matched = false;\n if (keyword==NULL) { addedLayer = NULL; }\n else if (!strcmp(keyword, \"CPTestInputLayer\")) {\n matched = true;\n addedLayer = new CPTestInputLayer(name, hc);\n }\n else { addedLayer = NULL; }\n if (matched && !addedLayer) {\n fprintf(stderr, \"Rank %d process unable to create %s \\\"%s\\\".\\n\", hc->columnId(), keyword, name);\n exit(EXIT_FAILURE);\n }\n return addedLayer;\n }\n virtual BaseConnection * createConnection(char const * keyword, char const * name, HyPerCol * hc, InitWeights * weightInitializer, NormalizeBase * weightNormalizer) {\n BaseConnection * addedConn = NULL;\n bool matched = false;\n if (keyword==NULL) { addedConn = NULL; }\n else if (!strcmp(keyword, \"VaryingHyPerConn\")) {\n matched = true;\n addedConn = new VaryingHyPerConn(name, hc);\n }\n else { addedConn = NULL; }\n if (matched && !addedConn) {\n fprintf(stderr, \"Rank %d process unable to create %s \\\"%s\\\".\\n\", hc->columnId(), keyword, name);\n exit(EXIT_FAILURE);\n }\n return addedConn;\n }\n}; \/\/ class CustomGroupHandler\n\nint customexit(HyPerCol * hc, int argc, char * argv[]);\n\nint main(int argc, char * argv[]) {\n int rank = 0;\n#ifdef PV_USE_MPI\n MPI_Init(&argc, &argv);\n MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n#endif \/\/ PV_USE_MPI\n char const * paramFile1 = \"input\/CheckpointParameters1.params\";\n char const * paramFile2 = \"input\/CheckpointParameters2.params\";\n int status = PV_SUCCESS;\n if (pv_getopt_str(argc, argv, \"-p\", NULL, NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the params file argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (pv_getopt_str(argc, argv, \"-c\", NULL, NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the checkpoint directory argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (pv_getopt(argc, argv, \"-r\", NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the checkpoint directory argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (status != PV_SUCCESS) {\n if (rank==0) {\n fprintf(stderr, \"This test uses two hard-coded params files, %s and %s. The second run is started from a checkpoint from the first run, and the results of the two runs are compared.\\n\",\n paramFile1, paramFile2);\n }\n MPI_Barrier(MPI_COMM_WORLD);\n exit(EXIT_FAILURE);\n }\n\n if (rank==0) {\n char const * rmcommand = \"rm -rf checkpoints1 checkpoints2 output\";\n status = system(rmcommand);\n if (status != 0) {\n fprintf(stderr, \"deleting old checkpoints and output directories failed: \\\"%s\\\" returned %d\\n\", rmcommand, status);\n exit(EXIT_FAILURE);\n }\n }\n\n ParamGroupHandler * customGroupHandler = new CustomGroupHandler;\n\n int pv_argc1 = 2 + argc; \/\/ command line arguments, plus \"-p\" plus paramFile1\n int pv_argc2 = 4 + argc; \/\/ pv_argc1 arguments with paramFile2 in place of paramFile1, plus \"-c\", plus checkpoint directory\n assert(pv_argc1 < pv_argc2); \/\/ so we can allocate based on pv_argc2 and be sure it will hold pv_argc1 arguments.\n char ** pv_argv = (char **) calloc((pv_argc2+1), sizeof(char *));\n assert(pv_argv!=NULL);\n int pv_arg=0;\n for (pv_arg = 0; pv_arg < argc; pv_arg++) {\n pv_argv[pv_arg] = strdup(argv[pv_arg]);\n assert(pv_argv[pv_arg]);\n }\n assert(pv_arg==argc);\n pv_argv[pv_arg++] = strdup(\"-p\");\n pv_argv[pv_arg++] = strdup(paramFile1);\n assert(pv_arg==pv_argc1 && pv_arg==argc+2);\n assert(pv_argv[argc]!=NULL && pv_argv[argc+1]!=NULL && pv_argv[argc+2]==NULL);\n\n status = buildandrun((int) pv_argc1, pv_argv, NULL, NULL, &customGroupHandler, 1);\n if( status != PV_SUCCESS ) {\n fprintf(stderr, \"%s: rank %d running with params file %s returned error %d.\\n\", pv_argv[0], rank, paramFile1, status);\n exit(status);\n }\n\n free(pv_argv[argc+1]);\n pv_argv[argc+1] = strdup(paramFile2);\n assert(pv_argv[argc+1]);\n assert(pv_arg==argc+2);\n pv_argv[pv_arg++] = strdup(\"-c\");\n pv_argv[pv_arg++] = strdup(\"checkpoints1\/Checkpoint12\");\n assert(pv_arg==pv_argc2 && pv_arg==argc+4);\n assert(pv_argv[argc+2]!=NULL && pv_argv[argc+3]!=NULL && pv_argv[argc+4]==NULL);\n\n status = buildandrun(pv_argc2, pv_argv, NULL, &customexit, &customGroupHandler, 1);\n if( status != PV_SUCCESS ) {\n fprintf(stderr, \"%s: rank %d running with params file %s returned error %d.\\n\", pv_argv[0], rank, paramFile2, status);\n }\n\n for (size_t arg=0; arg<pv_argc2; arg++) {\n free(pv_argv[arg]);\n }\n free(pv_argv);\n\n#ifdef PV_USE_MPI\n MPI_Finalize();\n#endif\n return status==PV_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n\nint customexit(HyPerCol * hc, int argc, char * argv[]) {\n int status = PV_SUCCESS;\n int rank = hc->icCommunicator()->commRank();\n int rootproc = 0;\n if( rank == rootproc ) {\n int index = hc->getFinalStep()-hc->getInitialStep();\n const char * cpdir1 = \"checkpoints1\";\n const char * cpdir2 = hc->parameters()->stringValue(\"column\", \"checkpointWriteDir\");\n if(cpdir1 == NULL || cpdir2 == NULL) {\n fprintf(stderr, \"%s: unable to allocate memory for names of checkpoint directories\", argv[0]);\n exit(EXIT_FAILURE);\n }\n char * shellcommand;\n char c;\n const char * fmtstr = \"diff -r -q -x timers.txt -x pv.params %s\/Checkpoint%d %s\/Checkpoint%d\";\n int len = snprintf(&c, 1, fmtstr, cpdir1, index, cpdir2, index);\n shellcommand = (char *) malloc(len+1);\n if( shellcommand == NULL) {\n fprintf(stderr, \"%s: unable to allocate memory for shell diff command.\\n\", argv[0]);\n status = PV_FAILURE;\n }\n assert( snprintf(shellcommand, len+1, fmtstr, cpdir1, index, cpdir2, index) == len );\n status = system(shellcommand);\n if( status != 0 ) {\n fprintf(stderr, \"system(\\\"%s\\\") returned %d\\n\", shellcommand, status);\n \/\/ Because system() seems to return the result of the shell command multiplied by 256,\n \/\/ and Unix only sees the 8 least-significant bits of the value returned by a C\/C++ program,\n \/\/ simply returning the result of the system call doesn't work.\n \/\/ I haven't found the mult-by-256 behavior in the documentation, so I'm not sure what's\n \/\/ going on.\n status = PV_FAILURE;\n }\n free(shellcommand); shellcommand = NULL;\n }\n#ifdef PV_USE_MPI\n MPI_Bcast(&status, 1, MPI_INT, rootproc, hc->icCommunicator()->communicator());\n#endif\n return status;\n}\n<commit_msg>Bugfix in CheckpointSystemTest<commit_after>\/*\n * main .cpp file for CheckpointSystemTest\n *\n *\/\n\n\n#include <columns\/buildandrun.hpp>\n#include <io\/ParamGroupHandler.hpp>\n#include \"CPTestInputLayer.hpp\"\n#include \"VaryingHyPerConn.hpp\"\n\nclass CustomGroupHandler : public ParamGroupHandler {\npublic:\n CustomGroupHandler() {}\n virtual ~CustomGroupHandler() {}\n virtual ParamGroupType getGroupType(char const * keyword) {\n ParamGroupType result = UnrecognizedGroupType;\n if (keyword==NULL) { result = UnrecognizedGroupType; }\n else if (!strcmp(keyword, \"CPTestInputLayer\")) { result = LayerGroupType; }\n else if (!strcmp(keyword, \"VaryingHyPerConn\")) { result = ConnectionGroupType; }\n else { result = UnrecognizedGroupType; }\n return result;\n }\n virtual HyPerLayer * createLayer(char const * keyword, char const * name, HyPerCol * hc) {\n HyPerLayer * addedLayer = NULL;\n bool matched = false;\n if (keyword==NULL) { addedLayer = NULL; }\n else if (!strcmp(keyword, \"CPTestInputLayer\")) {\n matched = true;\n addedLayer = new CPTestInputLayer(name, hc);\n }\n else { addedLayer = NULL; }\n if (matched && !addedLayer) {\n fprintf(stderr, \"Rank %d process unable to create %s \\\"%s\\\".\\n\", hc->columnId(), keyword, name);\n exit(EXIT_FAILURE);\n }\n return addedLayer;\n }\n virtual BaseConnection * createConnection(char const * keyword, char const * name, HyPerCol * hc, InitWeights * weightInitializer, NormalizeBase * weightNormalizer) {\n BaseConnection * addedConn = NULL;\n bool matched = false;\n if (keyword==NULL) { addedConn = NULL; }\n else if (!strcmp(keyword, \"VaryingHyPerConn\")) {\n matched = true;\n addedConn = new VaryingHyPerConn(name, hc, weightInitializer, weightNormalizer);\n }\n else { addedConn = NULL; }\n if (matched && !addedConn) {\n fprintf(stderr, \"Rank %d process unable to create %s \\\"%s\\\".\\n\", hc->columnId(), keyword, name);\n exit(EXIT_FAILURE);\n }\n return addedConn;\n }\n}; \/\/ class CustomGroupHandler\n\nint customexit(HyPerCol * hc, int argc, char * argv[]);\n\nint main(int argc, char * argv[]) {\n int rank = 0;\n#ifdef PV_USE_MPI\n MPI_Init(&argc, &argv);\n MPI_Comm_rank(MPI_COMM_WORLD, &rank);\n#endif \/\/ PV_USE_MPI\n char const * paramFile1 = \"input\/CheckpointParameters1.params\";\n char const * paramFile2 = \"input\/CheckpointParameters2.params\";\n int status = PV_SUCCESS;\n if (pv_getopt_str(argc, argv, \"-p\", NULL, NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the params file argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (pv_getopt_str(argc, argv, \"-c\", NULL, NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the checkpoint directory argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (pv_getopt(argc, argv, \"-r\", NULL)==0) {\n if (rank==0) {\n fprintf(stderr, \"%s should be run without the checkpoint directory argument.\\n\", argv[0]);\n }\n status = PV_FAILURE;\n }\n if (status != PV_SUCCESS) {\n if (rank==0) {\n fprintf(stderr, \"This test uses two hard-coded params files, %s and %s. The second run is started from a checkpoint from the first run, and the results of the two runs are compared.\\n\",\n paramFile1, paramFile2);\n }\n MPI_Barrier(MPI_COMM_WORLD);\n exit(EXIT_FAILURE);\n }\n\n if (rank==0) {\n char const * rmcommand = \"rm -rf checkpoints1 checkpoints2 output\";\n status = system(rmcommand);\n if (status != 0) {\n fprintf(stderr, \"deleting old checkpoints and output directories failed: \\\"%s\\\" returned %d\\n\", rmcommand, status);\n exit(EXIT_FAILURE);\n }\n }\n\n ParamGroupHandler * customGroupHandler = new CustomGroupHandler;\n\n int pv_argc1 = 2 + argc; \/\/ command line arguments, plus \"-p\" plus paramFile1\n int pv_argc2 = 4 + argc; \/\/ pv_argc1 arguments with paramFile2 in place of paramFile1, plus \"-c\", plus checkpoint directory\n assert(pv_argc1 < pv_argc2); \/\/ so we can allocate based on pv_argc2 and be sure it will hold pv_argc1 arguments.\n char ** pv_argv = (char **) calloc((pv_argc2+1), sizeof(char *));\n assert(pv_argv!=NULL);\n int pv_arg=0;\n for (pv_arg = 0; pv_arg < argc; pv_arg++) {\n pv_argv[pv_arg] = strdup(argv[pv_arg]);\n assert(pv_argv[pv_arg]);\n }\n assert(pv_arg==argc);\n pv_argv[pv_arg++] = strdup(\"-p\");\n pv_argv[pv_arg++] = strdup(paramFile1);\n assert(pv_arg==pv_argc1 && pv_arg==argc+2);\n assert(pv_argv[argc]!=NULL && pv_argv[argc+1]!=NULL && pv_argv[argc+2]==NULL);\n\n status = buildandrun((int) pv_argc1, pv_argv, NULL, NULL, &customGroupHandler, 1);\n if( status != PV_SUCCESS ) {\n fprintf(stderr, \"%s: rank %d running with params file %s returned error %d.\\n\", pv_argv[0], rank, paramFile1, status);\n exit(status);\n }\n\n free(pv_argv[argc+1]);\n pv_argv[argc+1] = strdup(paramFile2);\n assert(pv_argv[argc+1]);\n assert(pv_arg==argc+2);\n pv_argv[pv_arg++] = strdup(\"-c\");\n pv_argv[pv_arg++] = strdup(\"checkpoints1\/Checkpoint12\");\n assert(pv_arg==pv_argc2 && pv_arg==argc+4);\n assert(pv_argv[argc+2]!=NULL && pv_argv[argc+3]!=NULL && pv_argv[argc+4]==NULL);\n\n status = buildandrun(pv_argc2, pv_argv, NULL, &customexit, &customGroupHandler, 1);\n if( status != PV_SUCCESS ) {\n fprintf(stderr, \"%s: rank %d running with params file %s returned error %d.\\n\", pv_argv[0], rank, paramFile2, status);\n }\n\n delete customGroupHandler;\n\n for (size_t arg=0; arg<pv_argc2; arg++) {\n free(pv_argv[arg]);\n }\n free(pv_argv);\n\n#ifdef PV_USE_MPI\n MPI_Finalize();\n#endif\n return status==PV_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n\nint customexit(HyPerCol * hc, int argc, char * argv[]) {\n int status = PV_SUCCESS;\n int rank = hc->icCommunicator()->commRank();\n int rootproc = 0;\n if( rank == rootproc ) {\n int index = hc->getFinalStep()-hc->getInitialStep();\n const char * cpdir1 = \"checkpoints1\";\n const char * cpdir2 = hc->parameters()->stringValue(\"column\", \"checkpointWriteDir\");\n if(cpdir1 == NULL || cpdir2 == NULL) {\n fprintf(stderr, \"%s: unable to allocate memory for names of checkpoint directories\", argv[0]);\n exit(EXIT_FAILURE);\n }\n char * shellcommand;\n char c;\n const char * fmtstr = \"diff -r -q -x timers.txt -x pv.params %s\/Checkpoint%d %s\/Checkpoint%d\";\n int len = snprintf(&c, 1, fmtstr, cpdir1, index, cpdir2, index);\n shellcommand = (char *) malloc(len+1);\n if( shellcommand == NULL) {\n fprintf(stderr, \"%s: unable to allocate memory for shell diff command.\\n\", argv[0]);\n status = PV_FAILURE;\n }\n assert( snprintf(shellcommand, len+1, fmtstr, cpdir1, index, cpdir2, index) == len );\n status = system(shellcommand);\n if( status != 0 ) {\n fprintf(stderr, \"system(\\\"%s\\\") returned %d\\n\", shellcommand, status);\n \/\/ Because system() seems to return the result of the shell command multiplied by 256,\n \/\/ and Unix only sees the 8 least-significant bits of the value returned by a C\/C++ program,\n \/\/ simply returning the result of the system call doesn't work.\n \/\/ I haven't found the mult-by-256 behavior in the documentation, so I'm not sure what's\n \/\/ going on.\n status = PV_FAILURE;\n }\n free(shellcommand); shellcommand = NULL;\n }\n#ifdef PV_USE_MPI\n MPI_Bcast(&status, 1, MPI_INT, rootproc, hc->icCommunicator()->communicator());\n#endif\n return status;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- llc.cpp - Implement the LLVM Native Code Generator ----------------===\/\/\n\/\/\n\/\/ This is the llc code generator.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Pass.h\"\n#include \"Support\/CommandLine.h\"\n#include \"Support\/Signals.h\"\n#include <memory>\n#include <fstream>\n\n\/\/ General options for llc. Other pass-specific options are specified\n\/\/ within the corresponding llc passes, and target-specific options\n\/\/ and back-end code generation options are specified with the target machine.\n\/\/ \nstatic cl::opt<std::string>\nInputFilename(cl::Positional, cl::desc(\"<input bytecode>\"), cl::init(\"-\"));\n\nstatic cl::opt<std::string>\nOutputFilename(\"o\", cl::desc(\"Output filename\"), cl::value_desc(\"filename\"));\n\nstatic cl::opt<bool> Force(\"f\", cl::desc(\"Overwrite output files\"));\n\nenum ArchName { noarch, x86, Sparc };\n\nstatic cl::opt<ArchName>\nArch(\"march\", cl::desc(\"Architecture to generate assembly for:\"), cl::Prefix,\n cl::values(clEnumVal(x86, \" IA-32 (Pentium and above)\"),\n clEnumValN(Sparc, \"sparc\", \" SPARC V9\"),\n\t\t0),\n cl::init(noarch));\n\n\/\/ GetFileNameRoot - Helper function to get the basename of a filename...\nstatic inline std::string\nGetFileNameRoot(const std::string &InputFilename)\n{\n std::string IFN = InputFilename;\n std::string outputFilename;\n int Len = IFN.length();\n if (IFN[Len-3] == '.' && IFN[Len-2] == 'b' && IFN[Len-1] == 'c') {\n outputFilename = std::string(IFN.begin(), IFN.end()-3); \/\/ s\/.bc\/.s\/\n } else {\n outputFilename = IFN;\n }\n return outputFilename;\n}\n\n\n\/\/ main - Entry point for the llc compiler.\n\/\/\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv, \" llvm system compiler\\n\");\n \n \/\/ Load the module to be compiled...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n std::cerr << argv[0] << \": bytecode didn't read correctly.\\n\";\n return 1;\n }\n Module &mod = *M.get();\n\n \/\/ Allocate target machine. First, check whether the user has\n \/\/ explicitly specified an architecture to compile for.\n TargetMachine* (*TargetMachineAllocator)(unsigned) = 0;\n switch (Arch) {\n case x86:\n TargetMachineAllocator = allocateX86TargetMachine;\n break;\n case Sparc:\n TargetMachineAllocator = allocateSparcTargetMachine;\n break;\n default:\n \/\/ Decide what the default target machine should be, by looking at\n \/\/ the module. This heuristic (ILP32, LE -> IA32; LP64, BE ->\n \/\/ SPARCV9) is kind of gross, but it will work until we have more\n \/\/ sophisticated target information to work from.\n if (mod.getEndianness() == Module::LittleEndian &&\n mod.getPointerSize() == Module::Pointer32) { \n TargetMachineAllocator = allocateX86TargetMachine;\n } else if (mod.getEndianness() == Module::BigEndian &&\n mod.getPointerSize() == Module::Pointer64) { \n TargetMachineAllocator = allocateSparcTargetMachine;\n } else {\n \/\/ If the module is target independent, favor a target which matches the\n \/\/ current build system.\n#if defined(i386) || defined(__i386__) || defined(__x86__)\n TargetMachineAllocator = allocateX86TargetMachine;\n#elif defined(sparc) || defined(__sparc__) || defined(__sparcv9)\n TargetMachineAllocator = allocateSparcTargetMachine;\n#else\n std::cerr << argv[0] << \": module does not specify a target to use. \"\n << \"You must use the -march option.\\n\";\n return 1;\n#endif\n } \n break;\n }\n std::auto_ptr<TargetMachine> target((*TargetMachineAllocator)(0));\n assert(target.get() && \"Could not allocate target machine!\");\n TargetMachine &Target = *target.get();\n const TargetData &TD = Target.getTargetData();\n\n \/\/ Build up all of the passes that we want to do to the module...\n PassManager Passes;\n\n Passes.add(new TargetData(\"llc\", TD.isLittleEndian(), TD.getPointerSize(),\n TD.getPointerAlignment(), TD.getDoubleAlignment()));\n\n \/\/ Figure out where we are going to send the output...\n std::ostream *Out = 0;\n if (OutputFilename != \"\") {\n if (OutputFilename != \"-\") {\n \/\/ Specified an output filename?\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n\t\/\/ If force is not specified, make sure not to overwrite a file!\n\tstd::cerr << argv[0] << \": error opening '\" << OutputFilename\n\t\t << \"': file exists!\\n\"\n\t\t << \"Use -f command line argument to force output\\n\";\n\treturn 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n \/\/ Make sure that the Out file gets unlink'd from the disk if we get a\n \/\/ SIGINT\n RemoveFileOnSignal(OutputFilename);\n } else {\n Out = &std::cout;\n }\n } else {\n if (InputFilename == \"-\") {\n OutputFilename = \"-\";\n Out = &std::cout;\n } else {\n OutputFilename = GetFileNameRoot(InputFilename); \n OutputFilename += \".s\";\n \n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n std::cerr << argv[0] << \": error opening '\" << OutputFilename\n << \"': file exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n \n Out = new std::ofstream(OutputFilename.c_str());\n if (!Out->good()) {\n std::cerr << argv[0] << \": error opening \" << OutputFilename << \"!\\n\";\n delete Out;\n return 1;\n }\n \n \/\/ Make sure that the Out file gets unlink'd from the disk if we get a\n \/\/ SIGINT\n RemoveFileOnSignal(OutputFilename);\n }\n }\n\n \/\/ Ask the target to add backend passes as necessary\n if (Target.addPassesToEmitAssembly(Passes, *Out)) {\n std::cerr << argv[0] << \": target '\" << Target.getName()\n << \"' does not support static compilation!\\n\";\n if (Out != &std::cout) delete Out;\n \/\/ And the Out file is empty and useless, so remove it now.\n std::remove(OutputFilename.c_str());\n return 1;\n } else {\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M.get());\n }\n\n \/\/ Delete the ostream if it's not a stdout stream\n if (Out != &std::cout) delete Out;\n\n return 0;\n}\n<commit_msg>Targets now configure themselves with the module, not flags<commit_after>\/\/===-- llc.cpp - Implement the LLVM Native Code Generator ----------------===\/\/\n\/\/\n\/\/ This is the llc code generator.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Target\/TargetMachineImpls.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Pass.h\"\n#include \"Support\/CommandLine.h\"\n#include \"Support\/Signals.h\"\n#include <memory>\n#include <fstream>\n\n\/\/ General options for llc. Other pass-specific options are specified\n\/\/ within the corresponding llc passes, and target-specific options\n\/\/ and back-end code generation options are specified with the target machine.\n\/\/ \nstatic cl::opt<std::string>\nInputFilename(cl::Positional, cl::desc(\"<input bytecode>\"), cl::init(\"-\"));\n\nstatic cl::opt<std::string>\nOutputFilename(\"o\", cl::desc(\"Output filename\"), cl::value_desc(\"filename\"));\n\nstatic cl::opt<bool> Force(\"f\", cl::desc(\"Overwrite output files\"));\n\nenum ArchName { noarch, x86, Sparc };\n\nstatic cl::opt<ArchName>\nArch(\"march\", cl::desc(\"Architecture to generate assembly for:\"), cl::Prefix,\n cl::values(clEnumVal(x86, \" IA-32 (Pentium and above)\"),\n clEnumValN(Sparc, \"sparc\", \" SPARC V9\"),\n\t\t0),\n cl::init(noarch));\n\n\/\/ GetFileNameRoot - Helper function to get the basename of a filename...\nstatic inline std::string\nGetFileNameRoot(const std::string &InputFilename)\n{\n std::string IFN = InputFilename;\n std::string outputFilename;\n int Len = IFN.length();\n if (IFN[Len-3] == '.' && IFN[Len-2] == 'b' && IFN[Len-1] == 'c') {\n outputFilename = std::string(IFN.begin(), IFN.end()-3); \/\/ s\/.bc\/.s\/\n } else {\n outputFilename = IFN;\n }\n return outputFilename;\n}\n\n\n\/\/ main - Entry point for the llc compiler.\n\/\/\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv, \" llvm system compiler\\n\");\n \n \/\/ Load the module to be compiled...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n std::cerr << argv[0] << \": bytecode didn't read correctly.\\n\";\n return 1;\n }\n Module &mod = *M.get();\n\n \/\/ Allocate target machine. First, check whether the user has\n \/\/ explicitly specified an architecture to compile for.\n TargetMachine* (*TargetMachineAllocator)(const Module&) = 0;\n switch (Arch) {\n case x86:\n TargetMachineAllocator = allocateX86TargetMachine;\n break;\n case Sparc:\n TargetMachineAllocator = allocateSparcTargetMachine;\n break;\n default:\n \/\/ Decide what the default target machine should be, by looking at\n \/\/ the module. This heuristic (ILP32, LE -> IA32; LP64, BE ->\n \/\/ SPARCV9) is kind of gross, but it will work until we have more\n \/\/ sophisticated target information to work from.\n if (mod.getEndianness() == Module::LittleEndian &&\n mod.getPointerSize() == Module::Pointer32) { \n TargetMachineAllocator = allocateX86TargetMachine;\n } else if (mod.getEndianness() == Module::BigEndian &&\n mod.getPointerSize() == Module::Pointer64) { \n TargetMachineAllocator = allocateSparcTargetMachine;\n } else {\n \/\/ If the module is target independent, favor a target which matches the\n \/\/ current build system.\n#if defined(i386) || defined(__i386__) || defined(__x86__)\n TargetMachineAllocator = allocateX86TargetMachine;\n#elif defined(sparc) || defined(__sparc__) || defined(__sparcv9)\n TargetMachineAllocator = allocateSparcTargetMachine;\n#else\n std::cerr << argv[0] << \": module does not specify a target to use. \"\n << \"You must use the -march option.\\n\";\n return 1;\n#endif\n } \n break;\n }\n std::auto_ptr<TargetMachine> target(TargetMachineAllocator(mod));\n assert(target.get() && \"Could not allocate target machine!\");\n TargetMachine &Target = *target.get();\n const TargetData &TD = Target.getTargetData();\n\n \/\/ Build up all of the passes that we want to do to the module...\n PassManager Passes;\n\n Passes.add(new TargetData(\"llc\", TD.isLittleEndian(), TD.getPointerSize(),\n TD.getPointerAlignment(), TD.getDoubleAlignment()));\n\n \/\/ Figure out where we are going to send the output...\n std::ostream *Out = 0;\n if (OutputFilename != \"\") {\n if (OutputFilename != \"-\") {\n \/\/ Specified an output filename?\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n\t\/\/ If force is not specified, make sure not to overwrite a file!\n\tstd::cerr << argv[0] << \": error opening '\" << OutputFilename\n\t\t << \"': file exists!\\n\"\n\t\t << \"Use -f command line argument to force output\\n\";\n\treturn 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n \/\/ Make sure that the Out file gets unlink'd from the disk if we get a\n \/\/ SIGINT\n RemoveFileOnSignal(OutputFilename);\n } else {\n Out = &std::cout;\n }\n } else {\n if (InputFilename == \"-\") {\n OutputFilename = \"-\";\n Out = &std::cout;\n } else {\n OutputFilename = GetFileNameRoot(InputFilename); \n OutputFilename += \".s\";\n \n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n std::cerr << argv[0] << \": error opening '\" << OutputFilename\n << \"': file exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n \n Out = new std::ofstream(OutputFilename.c_str());\n if (!Out->good()) {\n std::cerr << argv[0] << \": error opening \" << OutputFilename << \"!\\n\";\n delete Out;\n return 1;\n }\n \n \/\/ Make sure that the Out file gets unlink'd from the disk if we get a\n \/\/ SIGINT\n RemoveFileOnSignal(OutputFilename);\n }\n }\n\n \/\/ Ask the target to add backend passes as necessary\n if (Target.addPassesToEmitAssembly(Passes, *Out)) {\n std::cerr << argv[0] << \": target '\" << Target.getName()\n << \"' does not support static compilation!\\n\";\n if (Out != &std::cout) delete Out;\n \/\/ And the Out file is empty and useless, so remove it now.\n std::remove(OutputFilename.c_str());\n return 1;\n } else {\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M.get());\n }\n\n \/\/ Delete the ostream if it's not a stdout stream\n if (Out != &std::cout) delete Out;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* robotBlocksSimulator.cpp\n*\n* Created on: 12 janvier 2014\n* Author: Benoît\n*\/\n\n#include <iostream>\n#include \"robotBlocksSimulator.h\"\n#include <string.h>\n#include \"trace.h\"\n\nusing namespace std;\n\nnamespace RobotBlocks {\n\nRobotBlocksBlockCode*(* RobotBlocksSimulator::buildNewBlockCode)(RobotBlocksBlock*)=NULL;\n\nvoid RobotBlocksSimulator::help() {\n cerr << \"VisibleSim:\" << endl;\n\tcerr << \"Robot01\" << endl;\n exit(EXIT_SUCCESS);\n}\n\nRobotBlocksSimulator::RobotBlocksSimulator(int argc, char *argv[], RobotBlocksBlockCode *(*robotBlocksBlockCodeBuildingFunction)(RobotBlocksBlock*)) : BaseSimulator::Simulator(argc, argv) {\n\tOUTPUT << \"\\033[1;34m\" << \"RobotBlocksSimulator constructor\" << \"\\033[0m\" << endl;\n\n\tint currentID = 1;\n\tRobotBlocksWorld *world = NULL;\n\tbuildNewBlockCode = robotBlocksBlockCodeBuildingFunction;\n\n\ttestMode = false;\n\n\t\/* reading the xml file *\/\n\tTiXmlNode *node = xmlDoc->FirstChild(\"world\");\n\tif (node) {\n\t\tTiXmlElement* worldElement = node->ToElement();\n\t\tconst char *attr= worldElement->Attribute(\"gridSize\");\n\t\tint lx,ly,lz;\n\t\tif (attr) {\n\t\t\tstring str=attr;\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\tlx = atoi(str.substr(0,pos1).c_str());\n\t\t\tly = atoi(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tlz = atoi(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tOUTPUT << \"grid size : \" << lx << \" x \" << ly << \" x \" << lz << endl;\n\t\t} else {\n\t\t\tOUTPUT << \"WARNING No grid size in XML file\" << endl;\n\t\t}\n\t\tattr=worldElement->Attribute(\"windowSize\");\n\t\tif (attr) {\n\t\t\tstring str=attr;\n\t \t\tint pos = str.find_first_of(',');\n\t\t\tGlutContext::initialScreenWidth = atoi(str.substr(0,pos).c_str());\n\t\t\tGlutContext::initialScreenHeight = atoi(str.substr(pos+1,str.length()-pos-1).c_str());\n\t\t\tGlutContext::screenWidth = GlutContext::initialScreenWidth;\n\t\t\tGlutContext::screenHeight = GlutContext::initialScreenHeight;\n\t\t}\n\n\t\tcreateWorld(lx, ly, lz, argc, argv);\n\t\tworld = getWorld();\n\t\tworld->loadTextures(\"..\/..\/simulatorCore\/robotBlocksTextures\");\n\n\t} else {\n\t\tERRPUT << \"ERROR : NO world in XML file\" << endl;\n\t\texit(1);\n\t}\n\n\tcreateScheduler();\n\n\t\/\/ loading the camera parameters\n\tTiXmlNode *nodeConfig = node->FirstChild(\"camera\");\n\tif (nodeConfig) {\n\t\tTiXmlElement* cameraElement = nodeConfig->ToElement();\n\t\tconst char *attr=cameraElement->Attribute(\"target\");\n\t\tdouble def_near=1,def_far=1500;\n\t\tfloat angle=45.0;\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tVecteur target;\n\t\t\ttarget.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\ttarget.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\ttarget.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tworld->getCamera()->setTarget(target);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"angle\");\n\t\tif (attr) {\n\t\t\tangle = atof(attr);\n\t\t\tworld->getCamera()->setAngle(angle);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"directionSpherical\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tfloat az,ele,dist;\n\t\t\taz = -90.0+atof(str.substr(0,pos1).c_str());\n\t\t\tele = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tdist = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tworld->getCamera()->setDirection(az,ele);\n\t\t\tworld->getCamera()->setDistance(dist);\n\t\t\taz = dist*sin(angle*M_PI\/180.0);\n\t\t\tdef_near = dist-az;\n\t\t\tdef_far = dist+az;\n\t\t}\n\t\tattr=cameraElement->Attribute(\"near\");\n\t\tif (attr) {\n\t\t\tdef_near = atof(attr);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"far\");\n\t\tif (attr) {\n\t\t\tdef_far = atof(attr);\n\t\t}\n\t\tworld->getCamera()->setNearFar(def_near,def_far);\n\t}\n\n\t\/\/ loading the spotlight parameters\n\tnodeConfig = node->FirstChild(\"spotlight\");\n\tif (nodeConfig) {\n\t\tVecteur target;\n\t\tfloat az=0,ele=60,dist=1000,angle=50;\n\t\tTiXmlElement* lightElement = nodeConfig->ToElement();\n\t\tconst char *attr=lightElement->Attribute(\"target\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\ttarget.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\ttarget.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\ttarget.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t}\n\t\tattr=lightElement->Attribute(\"directionSpherical\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\taz = -90.0+atof(str.substr(0,pos1).c_str());\n\t\t\tele = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tdist = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t}\n\t\tattr=lightElement->Attribute(\"angle\");\n\t\tif (attr) {\n\t\t\tangle = atof(attr);\n\t\t}\n\t\tfloat farplane=2.0*dist*tan(angle*M_PI\/180.0);\n\t\tworld->getCamera()->setLightParameters(target,az,ele,dist,angle,10.0,farplane);\n\n\t}\n\n\tTiXmlNode *nodeBlock = node->FirstChild(\"blockList\");\n\tif (nodeBlock) {\n\t\tColor defaultColor=DARKGREY;\n\t\tTiXmlElement* element = nodeBlock->ToElement();\n\t\tconst char *attr= element->Attribute(\"color\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tdefaultColor.rgba[0] = atof(str.substr(0,pos1).c_str())\/255.0;\n\t\t\tdefaultColor.rgba[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0;\n\t\t\tdefaultColor.rgba[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0;\n\t\t\tOUTPUT << \"new default color :\" << defaultColor << endl;\n\t\t}\n\t\tattr= element->Attribute(\"blocksize\");\n if (attr) {\n\t\t string str(attr);\n\t\t int pos1 = str.find_first_of(','),\n\t\t pos2 = str.find_last_of(',');\n\t\t float siz[3];\n\t\t siz[0] = atof(str.substr(0,pos1).c_str());\n\t\t siz[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t siz[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t OUTPUT << \"blocksize =\" << siz[0] << \",\" << siz[1] << \",\" << siz[2] << endl;\n\t\t world->setBlocksSize(siz);\n\t\t}\n\n\t\/* Reading a robotblock *\/\n\t\tTiXmlNode *block = nodeBlock->FirstChild(\"block\");\n\t\tVecteur position;\n\t\tColor color;\n\t\tbool master;\n\t\twhile (block) {\n\t\t element = block->ToElement();\n\t\t color=defaultColor;\n\t\t master=false;\n\t\t attr = element->Attribute(\"color\");\n\t\t if (attr) {\n\t\t\t string str(attr);\n\t\t\t int pos1 = str.find_first_of(','),\n\t\t \t\t pos2 = str.find_last_of(',');\n\t\t\t color.set(atof(str.substr(0,pos1).c_str())\/255.0,\n atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0,\n atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0);\n\t\t\t OUTPUT << \"new color :\" << defaultColor << endl;\n\t\t\t}\n\t\t\tattr = element->Attribute(\"position\");\n\t\t\tif (attr) {\n string str(attr);\n int pos1 = str.find_first_of(','),\n\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\t\tposition.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\t\tposition.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\t\tposition.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\t\tOUTPUT << \"position : \" << position << endl;\n\t\t\t}\n\t\t\tattr = element->Attribute(\"master\");\n\t\t\tif (attr) {\n string str(attr);\n if (str.compare(\"true\")==0 || str.compare(\"1\")==0) {\n\t\t\t\t\tmaster=true;\n }\n OUTPUT << \"master : \" << master << endl;\n\t\t\t}\n\t\t\tworld->addBlock(currentID++,RobotBlocksSimulator::buildNewBlockCode,position,color,master);\n\t\t\tblock = block->NextSibling(\"block\");\n\t\t} \/\/ end while (block)\n\n\t\tblock = nodeBlock->FirstChild(\"blocksLine\");\n\t\tint line,plane;\n\t\twhile (block) {\n\t\t\telement = block->ToElement();\n\t\t\tcolor=defaultColor;\n\t\t\tattr = element->Attribute(\"color\");\n\t\t\tif (attr) {\n\t\t\t\tstring str(attr);\n\t\t\t\tint pos1 = str.find_first_of(','),\n\t\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\t\tcolor.rgba[0] = atof(str.substr(0,pos1).c_str())\/255.0;\n\t\t\t\tcolor.rgba[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0;\n\t\t\t\tcolor.rgba[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0;\n\t\t\t\tOUTPUT << \"line color :\" << color << endl;\n\n\t\t\t}\n\t\t\tattr = element->Attribute(\"line\");\n\t\t\tif (attr) {\n\t\t\t\tline = atoi(attr);\n\t\t\t}\n\t\t\tattr = element->Attribute(\"plane\");\n\t\t\tif (attr) {\n\t\t\t\tplane = atoi(attr);\n\t\t\t}\n\t\t\tattr = element->Attribute(\"values\");\n\t\t\tif (attr) {\n\t\t\t\tstring str(attr);\n\t\t\t\tposition.pt[2] = plane;\n\t\t\t\tposition.pt[1] = line;\n\t\t\t\tint n = str.length();\n\t\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t \tif (str[i]=='1') {\n\t\t\t \t\tposition.pt[0]=i;\n\t\t\t \t\tworld->addBlock(currentID++,RobotBlocksSimulator::buildNewBlockCode,position,color);\n\t\t\t \t}\n\t\t\t }\n\t\t\t}\n\t\t\tblock = block->NextSibling(\"blocksLine\");\n\t\t} \/\/ end while (nodeBlock)\n\t} else \/\/ end if(nodeBlock)\n\t{ cerr << \"no Block List\" << endl;\n\t}\n\tTiXmlNode *nodeGrid = node->FirstChild(\"targetGrid\");\n\tif (nodeGrid) {\n world->initTargetGrid();\n\t\tTiXmlNode *block = nodeGrid->FirstChild(\"targetLine\");\n\t\tint line,plane;\n\t\twhile (block) {\n\t\t\tTiXmlElement* element = block->ToElement();\n\t\t\tconst char *attr = element->Attribute(\"line\");\n\t \t\tif (attr) {\n\t \t\t\tline = atoi(attr);\n\t \t\t}\n\t \t\tattr = element->Attribute(\"plane\");\n\t \t\tif (attr) {\n\t \t\t\tplane = atoi(attr);\n\t \t\t}\n\t \t\tattr = element->Attribute(\"values\");\n\t \t\tif (attr) {\n\t \t\t\tstring str(attr);\n\t \t\t\tint n = str.length();\n\t \t\t\tfor(int i=0; i<n; i++) {\n\t \t\t \tworld->setTargetGrid((str[i]=='1')?fullCell:emptyCell,i,line,plane);\n\t \t\t }\n\t \t\t}\n\t \t\tblock = block->NextSibling(\"targetLine\");\n\t \t}\n\t } else {\n\t \tERRPUT << \"No target grid\" << endl;\n\t }\n\n TiXmlNode *nodeCapa = node->FirstChild(\"capabilities\");\n\tif (nodeCapa) {\n world->setCapabilities(new RobotBlocksCapabilities(nodeCapa));\n }\n\n world->linkBlocks();\n\n\/\/\tgetScheduler()->sem_schedulerStart->post();\n\/\/\tgetScheduler()->setState(Scheduler::NOTSTARTED);\n\n\tif (!testMode) {\n GlutContext::mainLoop();\n }\n}\n\nRobotBlocksSimulator::~RobotBlocksSimulator() {\n\tOUTPUT << \"\\033[1;34m\" << \"RobotBlocksSimulator destructor\" << \"\\033[0m\" <<endl;\n}\n\nvoid RobotBlocksSimulator::createSimulator(int argc, char *argv[], RobotBlocksBlockCode *(*robotBlocksBlockCodeBuildingFunction)(RobotBlocksBlock*)) {\n\tsimulator = new RobotBlocksSimulator(argc, argv, robotBlocksBlockCodeBuildingFunction);\n}\n\nvoid RobotBlocksSimulator::deleteSimulator() {\n\tdelete((RobotBlocksSimulator*)simulator);\n}\n\n} \/\/ RobotBlocks namespace\n<commit_msg>Fixed error during config file parsing for gridsize on robotBlocks<commit_after>\/*\n* robotBlocksSimulator.cpp\n*\n* Created on: 12 janvier 2014\n* Author: Benoît\n*\/\n\n#include <iostream>\n#include \"robotBlocksSimulator.h\"\n#include <string.h>\n#include \"trace.h\"\n\nusing namespace std;\n\nnamespace RobotBlocks {\n\nRobotBlocksBlockCode*(* RobotBlocksSimulator::buildNewBlockCode)(RobotBlocksBlock*)=NULL;\n\nvoid RobotBlocksSimulator::help() {\n cerr << \"VisibleSim:\" << endl;\n\tcerr << \"Robot01\" << endl;\n exit(EXIT_SUCCESS);\n}\n\nRobotBlocksSimulator::RobotBlocksSimulator(int argc, char *argv[], RobotBlocksBlockCode *(*robotBlocksBlockCodeBuildingFunction)(RobotBlocksBlock*)) : BaseSimulator::Simulator(argc, argv) {\n\tOUTPUT << \"\\033[1;34m\" << \"RobotBlocksSimulator constructor\" << \"\\033[0m\" << endl;\n\n\tint currentID = 1;\n\tRobotBlocksWorld *world = NULL;\n\tbuildNewBlockCode = robotBlocksBlockCodeBuildingFunction;\n\n\ttestMode = false;\n\n\t\/* reading the xml file *\/\n\tTiXmlNode *node = xmlDoc->FirstChild(\"world\");\n\tif (node) {\n\t\tTiXmlElement* worldElement = node->ToElement();\n\t\tconst char *attr= worldElement->Attribute(\"gridsize\");\n\t\tint lx,ly,lz;\n\t\tif (attr) {\n\t\t\tstring str=attr;\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\tlx = atoi(str.substr(0,pos1).c_str());\n\t\t\tly = atoi(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tlz = atoi(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tOUTPUT << \"grid size : \" << lx << \" x \" << ly << \" x \" << lz << endl;\n\t\t} else {\n\t\t\tOUTPUT << \"WARNING No grid size in XML file\" << endl;\n\t\t}\n\t\tattr=worldElement->Attribute(\"windowSize\");\n\t\tif (attr) {\n\t\t\tstring str=attr;\n\t \t\tint pos = str.find_first_of(',');\n\t\t\tGlutContext::initialScreenWidth = atoi(str.substr(0,pos).c_str());\n\t\t\tGlutContext::initialScreenHeight = atoi(str.substr(pos+1,str.length()-pos-1).c_str());\n\t\t\tGlutContext::screenWidth = GlutContext::initialScreenWidth;\n\t\t\tGlutContext::screenHeight = GlutContext::initialScreenHeight;\n\t\t}\n\n\t\tcreateWorld(lx, ly, lz, argc, argv);\n\t\tworld = getWorld();\n\t\tworld->loadTextures(\"..\/..\/simulatorCore\/robotBlocksTextures\");\n\n\t} else {\n\t\tERRPUT << \"ERROR : NO world in XML file\" << endl;\n\t\texit(1);\n\t}\n\n\tcreateScheduler();\n\n\t\/\/ loading the camera parameters\n\tTiXmlNode *nodeConfig = node->FirstChild(\"camera\");\n\tif (nodeConfig) {\n\t\tTiXmlElement* cameraElement = nodeConfig->ToElement();\n\t\tconst char *attr=cameraElement->Attribute(\"target\");\n\t\tdouble def_near=1,def_far=1500;\n\t\tfloat angle=45.0;\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tVecteur target;\n\t\t\ttarget.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\ttarget.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\ttarget.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tworld->getCamera()->setTarget(target);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"angle\");\n\t\tif (attr) {\n\t\t\tangle = atof(attr);\n\t\t\tworld->getCamera()->setAngle(angle);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"directionSpherical\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tfloat az,ele,dist;\n\t\t\taz = -90.0+atof(str.substr(0,pos1).c_str());\n\t\t\tele = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tdist = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\tworld->getCamera()->setDirection(az,ele);\n\t\t\tworld->getCamera()->setDistance(dist);\n\t\t\taz = dist*sin(angle*M_PI\/180.0);\n\t\t\tdef_near = dist-az;\n\t\t\tdef_far = dist+az;\n\t\t}\n\t\tattr=cameraElement->Attribute(\"near\");\n\t\tif (attr) {\n\t\t\tdef_near = atof(attr);\n\t\t}\n\t\tattr=cameraElement->Attribute(\"far\");\n\t\tif (attr) {\n\t\t\tdef_far = atof(attr);\n\t\t}\n\t\tworld->getCamera()->setNearFar(def_near,def_far);\n\t}\n\n\t\/\/ loading the spotlight parameters\n\tnodeConfig = node->FirstChild(\"spotlight\");\n\tif (nodeConfig) {\n\t\tVecteur target;\n\t\tfloat az=0,ele=60,dist=1000,angle=50;\n\t\tTiXmlElement* lightElement = nodeConfig->ToElement();\n\t\tconst char *attr=lightElement->Attribute(\"target\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\ttarget.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\ttarget.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\ttarget.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t}\n\t\tattr=lightElement->Attribute(\"directionSpherical\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\taz = -90.0+atof(str.substr(0,pos1).c_str());\n\t\t\tele = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\tdist = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t}\n\t\tattr=lightElement->Attribute(\"angle\");\n\t\tif (attr) {\n\t\t\tangle = atof(attr);\n\t\t}\n\t\tfloat farplane=2.0*dist*tan(angle*M_PI\/180.0);\n\t\tworld->getCamera()->setLightParameters(target,az,ele,dist,angle,10.0,farplane);\n\n\t}\n\n\tTiXmlNode *nodeBlock = node->FirstChild(\"blockList\");\n\tif (nodeBlock) {\n\t\tColor defaultColor=DARKGREY;\n\t\tTiXmlElement* element = nodeBlock->ToElement();\n\t\tconst char *attr= element->Attribute(\"color\");\n\t\tif (attr) {\n\t\t\tstring str(attr);\n\t\t\tint pos1 = str.find_first_of(','),\n\t\t\tpos2 = str.find_last_of(',');\n\t\t\tdefaultColor.rgba[0] = atof(str.substr(0,pos1).c_str())\/255.0;\n\t\t\tdefaultColor.rgba[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0;\n\t\t\tdefaultColor.rgba[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0;\n\t\t\tOUTPUT << \"new default color :\" << defaultColor << endl;\n\t\t}\n\t\tattr= element->Attribute(\"blocksize\");\n if (attr) {\n\t\t string str(attr);\n\t\t int pos1 = str.find_first_of(','),\n\t\t pos2 = str.find_last_of(',');\n\t\t float siz[3];\n\t\t siz[0] = atof(str.substr(0,pos1).c_str());\n\t\t siz[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t siz[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t OUTPUT << \"blocksize =\" << siz[0] << \",\" << siz[1] << \",\" << siz[2] << endl;\n\t\t world->setBlocksSize(siz);\n\t\t}\n\n\t\/* Reading a robotblock *\/\n\t\tTiXmlNode *block = nodeBlock->FirstChild(\"block\");\n\t\tVecteur position;\n\t\tColor color;\n\t\tbool master;\n\t\twhile (block) {\n\t\t element = block->ToElement();\n\t\t color=defaultColor;\n\t\t master=false;\n\t\t attr = element->Attribute(\"color\");\n\t\t if (attr) {\n\t\t\t string str(attr);\n\t\t\t int pos1 = str.find_first_of(','),\n\t\t \t\t pos2 = str.find_last_of(',');\n\t\t\t color.set(atof(str.substr(0,pos1).c_str())\/255.0,\n atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0,\n atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0);\n\t\t\t OUTPUT << \"new color :\" << defaultColor << endl;\n\t\t\t}\n\t\t\tattr = element->Attribute(\"position\");\n\t\t\tif (attr) {\n string str(attr);\n int pos1 = str.find_first_of(','),\n\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\t\tposition.pt[0] = atof(str.substr(0,pos1).c_str());\n\t\t\t\tposition.pt[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str());\n\t\t\t\tposition.pt[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str());\n\t\t\t\tOUTPUT << \"position : \" << position << endl;\n\t\t\t}\n\t\t\tattr = element->Attribute(\"master\");\n\t\t\tif (attr) {\n string str(attr);\n if (str.compare(\"true\")==0 || str.compare(\"1\")==0) {\n\t\t\t\t\tmaster=true;\n }\n OUTPUT << \"master : \" << master << endl;\n\t\t\t}\n\t\t\tworld->addBlock(currentID++,RobotBlocksSimulator::buildNewBlockCode,position,color,master);\n\t\t\tblock = block->NextSibling(\"block\");\n\t\t} \/\/ end while (block)\n\n\t\tblock = nodeBlock->FirstChild(\"blocksLine\");\n\t\tint line,plane;\n\t\twhile (block) {\n\t\t\telement = block->ToElement();\n\t\t\tcolor=defaultColor;\n\t\t\tattr = element->Attribute(\"color\");\n\t\t\tif (attr) {\n\t\t\t\tstring str(attr);\n\t\t\t\tint pos1 = str.find_first_of(','),\n\t\t\t\t\tpos2 = str.find_last_of(',');\n\t\t\t\tcolor.rgba[0] = atof(str.substr(0,pos1).c_str())\/255.0;\n\t\t\t\tcolor.rgba[1] = atof(str.substr(pos1+1,pos2-pos1-1).c_str())\/255.0;\n\t\t\t\tcolor.rgba[2] = atof(str.substr(pos2+1,str.length()-pos1-1).c_str())\/255.0;\n\t\t\t\tOUTPUT << \"line color :\" << color << endl;\n\n\t\t\t}\n\t\t\tattr = element->Attribute(\"line\");\n\t\t\tif (attr) {\n\t\t\t\tline = atoi(attr);\n\t\t\t}\n\t\t\tattr = element->Attribute(\"plane\");\n\t\t\tif (attr) {\n\t\t\t\tplane = atoi(attr);\n\t\t\t}\n\t\t\tattr = element->Attribute(\"values\");\n\t\t\tif (attr) {\n\t\t\t\tstring str(attr);\n\t\t\t\tposition.pt[2] = plane;\n\t\t\t\tposition.pt[1] = line;\n\t\t\t\tint n = str.length();\n\t\t\t\tfor(int i=0; i<n; i++) {\n\t\t\t \tif (str[i]=='1') {\n\t\t\t \t\tposition.pt[0]=i;\n\t\t\t \t\tworld->addBlock(currentID++,RobotBlocksSimulator::buildNewBlockCode,position,color);\n\t\t\t \t}\n\t\t\t }\n\t\t\t}\n\t\t\tblock = block->NextSibling(\"blocksLine\");\n\t\t} \/\/ end while (nodeBlock)\n\t} else \/\/ end if(nodeBlock)\n\t{ cerr << \"no Block List\" << endl;\n\t}\n\tTiXmlNode *nodeGrid = node->FirstChild(\"targetGrid\");\n\tif (nodeGrid) {\n world->initTargetGrid();\n\t\tTiXmlNode *block = nodeGrid->FirstChild(\"targetLine\");\n\t\tint line,plane;\n\t\twhile (block) {\n\t\t\tTiXmlElement* element = block->ToElement();\n\t\t\tconst char *attr = element->Attribute(\"line\");\n\t \t\tif (attr) {\n\t \t\t\tline = atoi(attr);\n\t \t\t}\n\t \t\tattr = element->Attribute(\"plane\");\n\t \t\tif (attr) {\n\t \t\t\tplane = atoi(attr);\n\t \t\t}\n\t \t\tattr = element->Attribute(\"values\");\n\t \t\tif (attr) {\n\t \t\t\tstring str(attr);\n\t \t\t\tint n = str.length();\n\t \t\t\tfor(int i=0; i<n; i++) {\n\t \t\t \tworld->setTargetGrid((str[i]=='1')?fullCell:emptyCell,i,line,plane);\n\t \t\t }\n\t \t\t}\n\t \t\tblock = block->NextSibling(\"targetLine\");\n\t \t}\n\t } else {\n\t \tERRPUT << \"No target grid\" << endl;\n\t }\n\n TiXmlNode *nodeCapa = node->FirstChild(\"capabilities\");\n\tif (nodeCapa) {\n world->setCapabilities(new RobotBlocksCapabilities(nodeCapa));\n }\n\n world->linkBlocks();\n\n\/\/\tgetScheduler()->sem_schedulerStart->post();\n\/\/\tgetScheduler()->setState(Scheduler::NOTSTARTED);\n\n\tif (!testMode) {\n GlutContext::mainLoop();\n }\n}\n\nRobotBlocksSimulator::~RobotBlocksSimulator() {\n\tOUTPUT << \"\\033[1;34m\" << \"RobotBlocksSimulator destructor\" << \"\\033[0m\" <<endl;\n}\n\nvoid RobotBlocksSimulator::createSimulator(int argc, char *argv[], RobotBlocksBlockCode *(*robotBlocksBlockCodeBuildingFunction)(RobotBlocksBlock*)) {\n\tsimulator = new RobotBlocksSimulator(argc, argv, robotBlocksBlockCodeBuildingFunction);\n}\n\nvoid RobotBlocksSimulator::deleteSimulator() {\n\tdelete((RobotBlocksSimulator*)simulator);\n}\n\n} \/\/ RobotBlocks namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ \r\n\/\/ Copyright (C) 2007 SIPez LLC. \r\n\/\/ Licensed to SIPfoundry under a Contributor Agreement. \r\n\/\/\r\n\/\/ Copyright (C) 2007 SIPfoundry Inc.\r\n\/\/ Licensed by SIPfoundry under the LGPL license.\r\n\/\/\r\n\/\/ $$\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include <cppunit\/extensions\/HelperMacros.h>\r\n#include <cppunit\/TestCase.h>\r\n#include <sipxunit\/TestUtilities.h>\r\n\r\n#include <mp\/MpMMTimer.h>\r\n#include <os\/OsDateTime.h>\r\n#include <os\/OsSysLog.h>\r\n#include <os\/OsNotification.h>\r\n#include <os\/OsTask.h>\r\n\r\n#ifdef WIN32\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n#include <mp\/MpMMTimerWnt.h>\r\n#endif\r\n\r\n\/\/ Forward Decl's\r\nclass MpMMTimerTest;\r\n\r\nclass TimerNotification : public OsNotification\r\n{\r\npublic:\r\n TimerNotification(MpMMTimerTest* pMMTimerTest);\r\n virtual ~TimerNotification() {}\r\n OsStatus signal(const intptr_t eventData);\r\n\r\nprivate:\r\n MpMMTimerTest* mpMMTimerTest;\r\n};\r\n\r\n\r\n\r\n\/**\r\n * Unittest for MpMMTimer and its successors\r\n *\/\r\nclass MpMMTimerTest : public CppUnit::TestCase\r\n{\r\n CPPUNIT_TEST_SUITE(MpMMTimerTest);\r\n CPPUNIT_TEST(testGetResolution);\r\n CPPUNIT_TEST(testPeriodRange);\r\n CPPUNIT_TEST(testLinearTimer);\r\n CPPUNIT_TEST(testNotificationTimer);\r\n CPPUNIT_TEST_SUITE_END();\r\n\r\n\r\npublic:\r\n void setUp()\r\n {\r\n mpPerfTimes = NULL;\r\n mPerfTimesSz = 0;\r\n mCurNPerfTimes = 0;\r\n }\r\n\r\n void tearDown()\r\n {\r\n if(mpPerfTimes != NULL)\r\n {\r\n delete[] mpPerfTimes;\r\n }\r\n mpPerfTimes = NULL;\r\n mPerfTimesSz = 0;\r\n mCurNPerfTimes = 0;\r\n }\r\n\r\n void checkDeltasAgainstThresholds(long deltas[], long absDeltas[], unsigned nDeltas, \r\n unsigned targetDelta, \/\/ <-- was periodUSecs\r\n long lowerThresh, long upperThresh)\r\n {\r\n CPPUNIT_ASSERT_MESSAGE(\"Timer didn't fire or deltas were not collected!\",\r\n nDeltas > 0);\r\n\r\n printf(\"Timing values in microseconds, CSV: \\n\");\r\n long valOutsideThreshs = targetDelta; \/\/ initialize to exactly what we want.\r\n unsigned i;\r\n for(i = 0; i < nDeltas; i++)\r\n {\r\n \/\/ Print output in CSV format, for easy graphing.\r\n printf(\"%ld\\t%ld\", deltas[i], absDeltas[i]);\r\n printf((i < nDeltas-1) ? \"\\n\" : \"\\n\\n\"); \/\/ done this way for easy change to comma CSV\r\n\r\n \/\/ Check if we're outside some reasonable thresholds.\r\n if(i > 0 && \/\/ don't include the first value in our tests - it's always high.\r\n valOutsideThreshs == targetDelta) \/\/ Only check if we haven't already gone outside threshold.\r\n {\r\n if(deltas[i]-(long)targetDelta < lowerThresh ||\r\n deltas[i]-(long)targetDelta > upperThresh)\r\n {\r\n valOutsideThreshs = deltas[i];\r\n }\r\n }\r\n }\r\n\r\n \/\/ Assert when single value outside error range specified above.\r\n char errStrBuf[256];\r\n snprintf(errStrBuf, 256, \r\n \"Single timer value %ld falls outside threshold of %ld to %ld us\",\r\n valOutsideThreshs, lowerThresh, upperThresh);\r\n\r\n CPPUNIT_ASSERT_MESSAGE(errStrBuf,\r\n (valOutsideThreshs-(long)targetDelta >= lowerThresh && \r\n valOutsideThreshs-(long)targetDelta <= upperThresh));\r\n }\r\n\r\n void checkMeanAgainstThresholds(const OsTime& start, const OsTime& stop, \r\n unsigned nDeltas,\r\n unsigned targetDelta, \/\/ <-- was periodUSecs\r\n long lowerMeanThresh, long upperMeanThresh)\r\n {\r\n CPPUNIT_ASSERT_MESSAGE(\"Timer didn't fire or deltas were not collected!\",\r\n nDeltas > 0);\r\n\r\n double meanAvg = 0;\r\n\r\n int64_t totStartUSecs = start.seconds()*1000*1000 + start.usecs();\r\n int64_t totStopUSecs = stop.seconds()*1000*1000 + stop.usecs();\r\n\r\n meanAvg = (totStopUSecs-totStartUSecs)\/(double)nDeltas;\r\n printf(\"Mean: %.2f us\\n\", meanAvg);\r\n\r\n \/\/ Assert when mean is outside error range specified above.\r\n char errStrBuf[256];\r\n snprintf(errStrBuf, 256, \r\n \"Mean timer value %.2f falls outside threshold of %ld to %ld us\",\r\n meanAvg, lowerMeanThresh, upperMeanThresh);\r\n\r\n CPPUNIT_ASSERT_MESSAGE(errStrBuf,\r\n (meanAvg-(long)targetDelta >= lowerMeanThresh && \r\n meanAvg-(long)targetDelta <= upperMeanThresh));\r\n }\r\n\r\n void testGetResolution()\r\n {\r\n \/\/ Test getting the resolution, and get it..\r\n unsigned resolution;\r\n\r\n#ifdef WIN32\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, MpMMTimer::getResolution(resolution));\r\n printf(\"Minimum timer resolution is %d usecs\\n\", resolution);\r\n#else\r\n printf(\"MpMMTimer::getResolution() not yet implemented on this \"\r\n \"platform, excluding test.\\n\");\r\n#endif\r\n }\r\n\r\n void testPeriodRange()\r\n {\r\n \/\/ Test the period range static method..\r\n unsigned unusedMin = 0;\r\n unsigned unusedMax = 0;\r\n#ifdef WIN32\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, \r\n MpMMTimer::getPeriodRange(&unusedMin, &unusedMax));\r\n#else\r\n printf(\"MpMMTimer::getPeriodRange() not yet implemented on this \"\r\n \"platform, excluding test.\\n\");\r\n#endif\r\n }\r\n\r\n void testLinearTimer()\r\n {\r\n \/\/ Set the below variables and preprocessor defines to tweak this test.\r\n \/\/ TLT_LOOP_COUNT defines the number of timer fire repetitions to do \r\n \/\/ (set this to an even value),\r\n \/\/ and periodUSecs defines how long to wait in each one.\r\n# define TLT_LOOP_CNT 2000\r\n unsigned periodUSecs = 10000;\r\n long lowerThresh = -(long)periodUSecs; \/\/ Assert when outside an error range\r\n long lowerMeanThresh = -50; \/\/ specified below.\r\n long upperThresh = periodUSecs*2; \/\/ One for single values\r\n long upperMeanThresh = 50; \/\/ One for mean values\r\n\r\n\r\n MpMMTimer* pMMTimer = NULL;\r\n#ifdef WIN32\r\n MpMMTimerWnt mmTimerWnt(MpMMTimer::Linear);\r\n pMMTimer = &mmTimerWnt;\r\n#else\r\n \/\/ Right now MMTimers are only implemented for win32.\r\n \/\/ as other platforms are implemented, change this.\r\n printf(\"MMTimer not implemented for this platform. Test disabled.\\n\");\r\n return;\r\n#endif\r\n\r\n \/\/ Allocate time objects to hold measurements\r\n OsTime perfTimes[TLT_LOOP_CNT];\r\n\r\n \/\/ Initialize the timer.\r\n printf(\"Firing every %d usecs\\n\", periodUSecs);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->run(periodUSecs));\r\n\r\n \/\/ Perform the timing measurements.\r\n int i;\r\n for(i = 0; i < TLT_LOOP_CNT; i++)\r\n {\r\n OsDateTime::getCurTime(perfTimes[i]);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->waitForNextTick());\r\n }\r\n\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->stop());\r\n\r\n \/\/ Determine delta times from individual time measurements..\r\n int64_t curUsec_i = 0;\r\n int64_t curUsec_iPlus1 = 0;\r\n int64_t curUsec_0 = 0;\r\n long deltas[TLT_LOOP_CNT-1];\r\n long absDeltas[TLT_LOOP_CNT-1];\r\n for(i = 0; i < TLT_LOOP_CNT-1; i++)\r\n {\r\n curUsec_i = perfTimes[i].seconds()*1000*1000 + perfTimes[i].usecs();\r\n curUsec_iPlus1 = perfTimes[i+1].seconds()*1000*1000 + perfTimes[i+1].usecs();\r\n curUsec_0 = perfTimes[0].seconds()*1000*1000 + perfTimes[0].usecs();\r\n\r\n deltas[i] = (long)(curUsec_iPlus1 - curUsec_i);\r\n absDeltas[i] = (long)((curUsec_iPlus1 - curUsec_0) - periodUSecs*i);\r\n }\r\n\r\n\r\n checkDeltasAgainstThresholds(deltas, absDeltas, TLT_LOOP_CNT-1, \r\n periodUSecs, \r\n lowerThresh, upperThresh);\r\n checkMeanAgainstThresholds(perfTimes[0], perfTimes[TLT_LOOP_CNT-1],\r\n TLT_LOOP_CNT-1, \r\n periodUSecs, \r\n lowerMeanThresh, upperMeanThresh);\r\n }\r\n\r\n void notificationTimerRecordTick()\r\n {\r\n int x;\r\n x = mPerfTimesSz;\r\n CPPUNIT_ASSERT(mpPerfTimes != NULL);\r\n CPPUNIT_ASSERT(mPerfTimesSz > 0);\r\n\r\n \/\/ Collect measurements while we have space left.\r\n if(mCurNPerfTimes < mPerfTimesSz)\r\n {\r\n OsDateTime::getCurTime(mpPerfTimes[mCurNPerfTimes]);\r\n mCurNPerfTimes++;\r\n }\r\n }\r\n\r\n void testNotificationTimer()\r\n {\r\n \/\/ Set the below variables and preprocessor defines to tweak this test.\r\n \/\/ mPerfCountsSz defines the number of timer fire repetitions to do \r\n \/\/ (set this to an even value),\r\n \/\/ and periodUSecs defines how long to wait in each one.\r\n mPerfTimesSz = 2000;\r\n unsigned periodUSecs = 10000;\r\n long lowerThresh = -(long)periodUSecs+1; \/\/ Assert when outside an error range\r\n long lowerMeanThresh = -50; \/\/ specified below.\r\n long upperThresh = periodUSecs*2-1; \/\/ One for single values\r\n long upperMeanThresh = 50; \/\/ One for mean values\r\n\r\n TimerNotification timerNotification(this);\r\n MpMMTimer* pMMTimer = NULL;\r\n#ifdef WIN32\r\n MpMMTimerWnt mmTimerWnt(MpMMTimer::Notification);\r\n pMMTimer = &mmTimerWnt;\r\n#else\r\n \/\/ Right now MMTimers are only implemented for win32.\r\n \/\/ as other platforms are implemented, change this.\r\n printf(\"MMTimer not implemented for this platform. Test disabled.\\n\");\r\n return;\r\n#endif\r\n\r\n \/\/ Set the notification..\r\n pMMTimer->setNotification(&timerNotification);\r\n\r\n \/\/ Allocate time objects to hold measurements\r\n mpPerfTimes = new OsTime[mPerfTimesSz];\r\n\r\n \/\/ Initialize the timer.\r\n printf(\"Firing every %d usecs\\n\", periodUSecs);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->run(periodUSecs));\r\n\r\n \/\/ Wait for the callbacks to perform the timing measurements.\r\n OsTask::delay(periodUSecs*mPerfTimesSz\/1000 + 50);\r\n \r\n \/\/ The callbacks should be done by now, so if they aren't,\r\n \/\/ then bitch.\r\n \/\/We should have a current count of the actual size of the perf buffer.\r\n CPPUNIT_ASSERT_EQUAL(mPerfTimesSz, mCurNPerfTimes);\r\n\r\n \/\/ Clear the OsNotification, as it doesn't need to be continuing to notify.\r\n pMMTimer->setNotification(NULL);\r\n\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->stop());\r\n\r\n \/\/ Determine delta times from individual time measurements..\r\n int64_t curUsec_i = 0;\r\n int64_t curUsec_iPlus1 = 0;\r\n int64_t curUsec_0 = 0;\r\n long* pDeltas = new long[mPerfTimesSz-1];\r\n long* pAbsDeltas = new long[mPerfTimesSz-1];\r\n unsigned i;\r\n for(i = 0; i < mPerfTimesSz-1; i = i++)\r\n {\r\n curUsec_i = mpPerfTimes[i].seconds()*1000*1000 + mpPerfTimes[i].usecs();\r\n curUsec_iPlus1 = mpPerfTimes[i+1].seconds()*1000*1000 + mpPerfTimes[i+1].usecs();\r\n curUsec_0 = mpPerfTimes[0].seconds()*1000*1000 + mpPerfTimes[0].usecs();\r\n\r\n pDeltas[i] = (long)(curUsec_iPlus1 - curUsec_i);\r\n pAbsDeltas[i] = (long)((curUsec_iPlus1 - curUsec_0) - periodUSecs*i);\r\n }\r\n\r\n checkDeltasAgainstThresholds(pDeltas, pAbsDeltas, mPerfTimesSz-1,\r\n periodUSecs,\r\n lowerThresh, upperThresh);\r\n checkMeanAgainstThresholds(mpPerfTimes[0], mpPerfTimes[mPerfTimesSz-1],\r\n mPerfTimesSz-1, \r\n periodUSecs,\r\n lowerMeanThresh, upperMeanThresh);\r\n\r\n \/\/ Cleanup!\r\n delete[] pDeltas;\r\n pDeltas = NULL;\r\n delete[] pAbsDeltas;\r\n pAbsDeltas = NULL;\r\n delete[] mpPerfTimes;\r\n mpPerfTimes = NULL;\r\n mCurNPerfTimes = 0;\r\n mPerfTimesSz = 0;\r\n }\r\n\r\nprotected:\r\n\r\n OsTime* mpPerfTimes;\r\n unsigned mPerfTimesSz;\r\n unsigned mCurNPerfTimes;\r\n};\r\n\r\nCPPUNIT_TEST_SUITE_REGISTRATION(MpMMTimerTest);\r\n\r\n\r\n\r\n\r\n\r\n\/\/ Implementation of TimerNotification methods.\r\nTimerNotification::TimerNotification(MpMMTimerTest* pMMTimerTest) \r\n : mpMMTimerTest(pMMTimerTest)\r\n{\r\n CPPUNIT_ASSERT(pMMTimerTest != NULL);\r\n}\r\n\r\nOsStatus TimerNotification::signal(const intptr_t eventData) \r\n{\r\n mpMMTimerTest->notificationTimerRecordTick();\r\n return OS_SUCCESS;\r\n}\r\n<commit_msg>Fix infinite loop in MpMMTimerTest::testNotificationTimer().<commit_after>\/\/ \r\n\/\/ Copyright (C) 2007 SIPez LLC. \r\n\/\/ Licensed to SIPfoundry under a Contributor Agreement. \r\n\/\/\r\n\/\/ Copyright (C) 2007 SIPfoundry Inc.\r\n\/\/ Licensed by SIPfoundry under the LGPL license.\r\n\/\/\r\n\/\/ $$\r\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n\r\n#include <cppunit\/extensions\/HelperMacros.h>\r\n#include <cppunit\/TestCase.h>\r\n#include <sipxunit\/TestUtilities.h>\r\n\r\n#include <mp\/MpMMTimer.h>\r\n#include <os\/OsDateTime.h>\r\n#include <os\/OsSysLog.h>\r\n#include <os\/OsNotification.h>\r\n#include <os\/OsTask.h>\r\n\r\n#ifdef WIN32\r\n#define WIN32_LEAN_AND_MEAN\r\n#include <windows.h>\r\n#include <mp\/MpMMTimerWnt.h>\r\n#endif\r\n\r\n\/\/ Forward Decl's\r\nclass MpMMTimerTest;\r\n\r\nclass TimerNotification : public OsNotification\r\n{\r\npublic:\r\n TimerNotification(MpMMTimerTest* pMMTimerTest);\r\n virtual ~TimerNotification() {}\r\n OsStatus signal(const intptr_t eventData);\r\n\r\nprivate:\r\n MpMMTimerTest* mpMMTimerTest;\r\n};\r\n\r\n\r\n\r\n\/**\r\n * Unittest for MpMMTimer and its successors\r\n *\/\r\nclass MpMMTimerTest : public CppUnit::TestCase\r\n{\r\n CPPUNIT_TEST_SUITE(MpMMTimerTest);\r\n CPPUNIT_TEST(testGetResolution);\r\n CPPUNIT_TEST(testPeriodRange);\r\n CPPUNIT_TEST(testLinearTimer);\r\n CPPUNIT_TEST(testNotificationTimer);\r\n CPPUNIT_TEST_SUITE_END();\r\n\r\n\r\npublic:\r\n void setUp()\r\n {\r\n mpPerfTimes = NULL;\r\n mPerfTimesSz = 0;\r\n mCurNPerfTimes = 0;\r\n }\r\n\r\n void tearDown()\r\n {\r\n if(mpPerfTimes != NULL)\r\n {\r\n delete[] mpPerfTimes;\r\n }\r\n mpPerfTimes = NULL;\r\n mPerfTimesSz = 0;\r\n mCurNPerfTimes = 0;\r\n }\r\n\r\n void checkDeltasAgainstThresholds(long deltas[], long absDeltas[], unsigned nDeltas, \r\n unsigned targetDelta, \/\/ <-- was periodUSecs\r\n long lowerThresh, long upperThresh)\r\n {\r\n CPPUNIT_ASSERT_MESSAGE(\"Timer didn't fire or deltas were not collected!\",\r\n nDeltas > 0);\r\n\r\n printf(\"Timing values in microseconds, CSV: \\n\");\r\n long valOutsideThreshs = targetDelta; \/\/ initialize to exactly what we want.\r\n unsigned i;\r\n for(i = 0; i < nDeltas; i++)\r\n {\r\n \/\/ Print output in CSV format, for easy graphing.\r\n printf(\"%ld\\t%ld\", deltas[i], absDeltas[i]);\r\n printf((i < nDeltas-1) ? \"\\n\" : \"\\n\\n\"); \/\/ done this way for easy change to comma CSV\r\n\r\n \/\/ Check if we're outside some reasonable thresholds.\r\n if(i > 0 && \/\/ don't include the first value in our tests - it's always high.\r\n valOutsideThreshs == targetDelta) \/\/ Only check if we haven't already gone outside threshold.\r\n {\r\n if(deltas[i]-(long)targetDelta < lowerThresh ||\r\n deltas[i]-(long)targetDelta > upperThresh)\r\n {\r\n valOutsideThreshs = deltas[i];\r\n }\r\n }\r\n }\r\n\r\n \/\/ Assert when single value outside error range specified above.\r\n char errStrBuf[256];\r\n snprintf(errStrBuf, 256, \r\n \"Single timer value %ld falls outside threshold of %ld to %ld us\",\r\n valOutsideThreshs, lowerThresh, upperThresh);\r\n\r\n CPPUNIT_ASSERT_MESSAGE(errStrBuf,\r\n (valOutsideThreshs-(long)targetDelta >= lowerThresh && \r\n valOutsideThreshs-(long)targetDelta <= upperThresh));\r\n }\r\n\r\n void checkMeanAgainstThresholds(const OsTime& start, const OsTime& stop, \r\n unsigned nDeltas,\r\n unsigned targetDelta, \/\/ <-- was periodUSecs\r\n long lowerMeanThresh, long upperMeanThresh)\r\n {\r\n CPPUNIT_ASSERT_MESSAGE(\"Timer didn't fire or deltas were not collected!\",\r\n nDeltas > 0);\r\n\r\n double meanAvg = 0;\r\n\r\n int64_t totStartUSecs = start.seconds()*1000*1000 + start.usecs();\r\n int64_t totStopUSecs = stop.seconds()*1000*1000 + stop.usecs();\r\n\r\n meanAvg = (totStopUSecs-totStartUSecs)\/(double)nDeltas;\r\n printf(\"Mean: %.2f us\\n\", meanAvg);\r\n\r\n \/\/ Assert when mean is outside error range specified above.\r\n char errStrBuf[256];\r\n snprintf(errStrBuf, 256, \r\n \"Mean timer value %.2f falls outside threshold of %ld to %ld us\",\r\n meanAvg, lowerMeanThresh, upperMeanThresh);\r\n\r\n CPPUNIT_ASSERT_MESSAGE(errStrBuf,\r\n (meanAvg-(long)targetDelta >= lowerMeanThresh && \r\n meanAvg-(long)targetDelta <= upperMeanThresh));\r\n }\r\n\r\n void testGetResolution()\r\n {\r\n \/\/ Test getting the resolution, and get it..\r\n unsigned resolution;\r\n\r\n#ifdef WIN32\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, MpMMTimer::getResolution(resolution));\r\n printf(\"Minimum timer resolution is %d usecs\\n\", resolution);\r\n#else\r\n printf(\"MpMMTimer::getResolution() not yet implemented on this \"\r\n \"platform, excluding test.\\n\");\r\n#endif\r\n }\r\n\r\n void testPeriodRange()\r\n {\r\n \/\/ Test the period range static method..\r\n unsigned unusedMin = 0;\r\n unsigned unusedMax = 0;\r\n#ifdef WIN32\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, \r\n MpMMTimer::getPeriodRange(&unusedMin, &unusedMax));\r\n#else\r\n printf(\"MpMMTimer::getPeriodRange() not yet implemented on this \"\r\n \"platform, excluding test.\\n\");\r\n#endif\r\n }\r\n\r\n void testLinearTimer()\r\n {\r\n \/\/ Set the below variables and preprocessor defines to tweak this test.\r\n \/\/ TLT_LOOP_COUNT defines the number of timer fire repetitions to do \r\n \/\/ (set this to an even value),\r\n \/\/ and periodUSecs defines how long to wait in each one.\r\n# define TLT_LOOP_CNT 2000\r\n unsigned periodUSecs = 10000;\r\n long lowerThresh = -(long)periodUSecs; \/\/ Assert when outside an error range\r\n long lowerMeanThresh = -50; \/\/ specified below.\r\n long upperThresh = periodUSecs*2; \/\/ One for single values\r\n long upperMeanThresh = 50; \/\/ One for mean values\r\n\r\n\r\n MpMMTimer* pMMTimer = NULL;\r\n#ifdef WIN32\r\n MpMMTimerWnt mmTimerWnt(MpMMTimer::Linear);\r\n pMMTimer = &mmTimerWnt;\r\n#else\r\n \/\/ Right now MMTimers are only implemented for win32.\r\n \/\/ as other platforms are implemented, change this.\r\n printf(\"MMTimer not implemented for this platform. Test disabled.\\n\");\r\n return;\r\n#endif\r\n\r\n \/\/ Allocate time objects to hold measurements\r\n OsTime perfTimes[TLT_LOOP_CNT];\r\n\r\n \/\/ Initialize the timer.\r\n printf(\"Firing every %d usecs\\n\", periodUSecs);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->run(periodUSecs));\r\n\r\n \/\/ Perform the timing measurements.\r\n int i;\r\n for(i = 0; i < TLT_LOOP_CNT; i++)\r\n {\r\n OsDateTime::getCurTime(perfTimes[i]);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->waitForNextTick());\r\n }\r\n\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->stop());\r\n\r\n \/\/ Determine delta times from individual time measurements..\r\n int64_t curUsec_i = 0;\r\n int64_t curUsec_iPlus1 = 0;\r\n int64_t curUsec_0 = 0;\r\n long deltas[TLT_LOOP_CNT-1];\r\n long absDeltas[TLT_LOOP_CNT-1];\r\n for(i = 0; i < TLT_LOOP_CNT-1; i++)\r\n {\r\n curUsec_i = perfTimes[i].seconds()*1000*1000 + perfTimes[i].usecs();\r\n curUsec_iPlus1 = perfTimes[i+1].seconds()*1000*1000 + perfTimes[i+1].usecs();\r\n curUsec_0 = perfTimes[0].seconds()*1000*1000 + perfTimes[0].usecs();\r\n\r\n deltas[i] = (long)(curUsec_iPlus1 - curUsec_i);\r\n absDeltas[i] = (long)((curUsec_iPlus1 - curUsec_0) - periodUSecs*i);\r\n }\r\n\r\n\r\n checkDeltasAgainstThresholds(deltas, absDeltas, TLT_LOOP_CNT-1, \r\n periodUSecs, \r\n lowerThresh, upperThresh);\r\n checkMeanAgainstThresholds(perfTimes[0], perfTimes[TLT_LOOP_CNT-1],\r\n TLT_LOOP_CNT-1, \r\n periodUSecs, \r\n lowerMeanThresh, upperMeanThresh);\r\n }\r\n\r\n void notificationTimerRecordTick()\r\n {\r\n int x;\r\n x = mPerfTimesSz;\r\n CPPUNIT_ASSERT(mpPerfTimes != NULL);\r\n CPPUNIT_ASSERT(mPerfTimesSz > 0);\r\n\r\n \/\/ Collect measurements while we have space left.\r\n if(mCurNPerfTimes < mPerfTimesSz)\r\n {\r\n OsDateTime::getCurTime(mpPerfTimes[mCurNPerfTimes]);\r\n mCurNPerfTimes++;\r\n }\r\n }\r\n\r\n void testNotificationTimer()\r\n {\r\n \/\/ Set the below variables and preprocessor defines to tweak this test.\r\n \/\/ mPerfCountsSz defines the number of timer fire repetitions to do \r\n \/\/ (set this to an even value),\r\n \/\/ and periodUSecs defines how long to wait in each one.\r\n mPerfTimesSz = 2000;\r\n unsigned periodUSecs = 10000;\r\n long lowerThresh = -(long)periodUSecs+1; \/\/ Assert when outside an error range\r\n long lowerMeanThresh = -50; \/\/ specified below.\r\n long upperThresh = periodUSecs*2-1; \/\/ One for single values\r\n long upperMeanThresh = 50; \/\/ One for mean values\r\n\r\n TimerNotification timerNotification(this);\r\n MpMMTimer* pMMTimer = NULL;\r\n#ifdef WIN32\r\n MpMMTimerWnt mmTimerWnt(MpMMTimer::Notification);\r\n pMMTimer = &mmTimerWnt;\r\n#else\r\n \/\/ Right now MMTimers are only implemented for win32.\r\n \/\/ as other platforms are implemented, change this.\r\n printf(\"MMTimer not implemented for this platform. Test disabled.\\n\");\r\n return;\r\n#endif\r\n\r\n \/\/ Set the notification..\r\n pMMTimer->setNotification(&timerNotification);\r\n\r\n \/\/ Allocate time objects to hold measurements\r\n mpPerfTimes = new OsTime[mPerfTimesSz];\r\n\r\n \/\/ Initialize the timer.\r\n printf(\"Firing every %d usecs\\n\", periodUSecs);\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->run(periodUSecs));\r\n\r\n \/\/ Wait for the callbacks to perform the timing measurements.\r\n OsTask::delay(periodUSecs*mPerfTimesSz\/1000 + 50);\r\n \r\n \/\/ The callbacks should be done by now, so if they aren't,\r\n \/\/ then bitch.\r\n \/\/We should have a current count of the actual size of the perf buffer.\r\n CPPUNIT_ASSERT_EQUAL(mPerfTimesSz, mCurNPerfTimes);\r\n\r\n \/\/ Clear the OsNotification, as it doesn't need to be continuing to notify.\r\n pMMTimer->setNotification(NULL);\r\n\r\n CPPUNIT_ASSERT_EQUAL(OS_SUCCESS, pMMTimer->stop());\r\n\r\n \/\/ Determine delta times from individual time measurements..\r\n int64_t curUsec_i = 0;\r\n int64_t curUsec_iPlus1 = 0;\r\n int64_t curUsec_0 = 0;\r\n long* pDeltas = new long[mPerfTimesSz-1];\r\n long* pAbsDeltas = new long[mPerfTimesSz-1];\r\n unsigned i;\r\n for(i = 0; i < mPerfTimesSz-1; i++)\r\n {\r\n curUsec_i = mpPerfTimes[i].seconds()*1000*1000 + mpPerfTimes[i].usecs();\r\n curUsec_iPlus1 = mpPerfTimes[i+1].seconds()*1000*1000 + mpPerfTimes[i+1].usecs();\r\n curUsec_0 = mpPerfTimes[0].seconds()*1000*1000 + mpPerfTimes[0].usecs();\r\n\r\n pDeltas[i] = (long)(curUsec_iPlus1 - curUsec_i);\r\n pAbsDeltas[i] = (long)((curUsec_iPlus1 - curUsec_0) - periodUSecs*i);\r\n }\r\n\r\n checkDeltasAgainstThresholds(pDeltas, pAbsDeltas, mPerfTimesSz-1,\r\n periodUSecs,\r\n lowerThresh, upperThresh);\r\n checkMeanAgainstThresholds(mpPerfTimes[0], mpPerfTimes[mPerfTimesSz-1],\r\n mPerfTimesSz-1, \r\n periodUSecs,\r\n lowerMeanThresh, upperMeanThresh);\r\n\r\n \/\/ Cleanup!\r\n delete[] pDeltas;\r\n pDeltas = NULL;\r\n delete[] pAbsDeltas;\r\n pAbsDeltas = NULL;\r\n delete[] mpPerfTimes;\r\n mpPerfTimes = NULL;\r\n mCurNPerfTimes = 0;\r\n mPerfTimesSz = 0;\r\n }\r\n\r\nprotected:\r\n\r\n OsTime* mpPerfTimes;\r\n unsigned mPerfTimesSz;\r\n unsigned mCurNPerfTimes;\r\n};\r\n\r\nCPPUNIT_TEST_SUITE_REGISTRATION(MpMMTimerTest);\r\n\r\n\r\n\r\n\r\n\r\n\/\/ Implementation of TimerNotification methods.\r\nTimerNotification::TimerNotification(MpMMTimerTest* pMMTimerTest) \r\n : mpMMTimerTest(pMMTimerTest)\r\n{\r\n CPPUNIT_ASSERT(pMMTimerTest != NULL);\r\n}\r\n\r\nOsStatus TimerNotification::signal(const intptr_t eventData) \r\n{\r\n mpMMTimerTest->notificationTimerRecordTick();\r\n return OS_SUCCESS;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ refract\/Element.cc\n\/\/ librefract\n\/\/\n\/\/ Created by Jiri Kratochvil on 18\/05\/15.\n\/\/ Copyright (c) 2015 Apiary Inc. All rights reserved.\n\/\/\n#include \"Element.h\"\n#include <cassert>\n\n#include <set>\n#include <map>\n#include <string>\n\n#include \"ComparableVisitor.h\"\n#include \"TypeQueryVisitor.h\"\n\n#include <string.h>\n#include <array>\n\nnamespace refract\n{\n\n namespace {\n\n const constexpr std::array<const char*, 13> reservedKeywords = {\n\n \"null\",\n \"boolean\",\n \"number\",\n \"string\",\n\n \"member\",\n\n \"array\",\n \"enum\",\n \"object\",\n\n \"ref\",\n \"select\",\n \"option\",\n \"extend\",\n\n \"generic\"\n };\n\n const constexpr std::array<const char*, 3> noMetaKeywords = {\n \"id\",\n \"prefix\",\n \"namespace\" \n };\n\n const constexpr std::array<const char*, 0> emptyArray;\n\n template <typename Container>\n struct inKeys {\n const Container& keywords;\n inKeys(const Container& keywords) : keywords(keywords) {}\n\n bool operator()(const std::string& searched) {\n return std::any_of(keywords.begin(), keywords.end(),\n [&searched](const char* key) {\n return !strcmp(key, searched.c_str());\n });\n }\n };\n\n template <typename Container>\n inKeys<Container> InKeysChecker(const Container& keywords) {\n return inKeys<Container>(keywords);\n }\n\n }\n\n\n\n bool isReserved(const std::string& element) {\n return InKeysChecker(reservedKeywords)(element);\n }\n\n IElement::MemberElementCollection::const_iterator IElement::MemberElementCollection::find(\n const std::string& name) const\n {\n ComparableVisitor v(name);\n Visitor visitor(v);\n\n return std::find_if(elements.begin(), elements.end(), [&visitor, &v](const MemberElement* e) {\n e->value.first->content(visitor);\n return v.get();\n });\n }\n\n IElement::MemberElementCollection::iterator IElement::MemberElementCollection::find(const std::string& name)\n {\n ComparableVisitor v(name);\n Visitor visitor(v);\n\n return std::find_if(elements.begin(), elements.end(), [&visitor, &v](const MemberElement* e) {\n e->value.first->content(visitor);\n return v.get();\n });\n }\n\n IElement::MemberElementCollection::~MemberElementCollection()\n {\n for (MemberElement* e : elements)\n delete e;\n }\n\n StringElement* IElement::Create(const char* value)\n {\n return Create(std::string(value));\n };\n\n MemberElement& IElement::MemberElementCollection::operator[](const std::string& name)\n {\n auto it = find(name);\n if (it != elements.end()) {\n return *(*it);\n }\n\n elements.emplace_back(new MemberElement(new StringElement(name), nullptr));\n\n return *elements.back();\n }\n\n void IElement::MemberElementCollection::clone(const IElement::MemberElementCollection& other)\n {\n for (const auto& el : other.elements) {\n elements.emplace_back(static_cast<MemberElement*>(el->clone()));\n }\n }\n\n void IElement::MemberElementCollection::erase(const std::string& key)\n {\n auto it = find(key);\n\n if (it != elements.end()) {\n delete *it;\n elements.erase(it);\n }\n }\n\n namespace\n {\n\n bool TypeChecker(const ExtendElement::ValueType& values)\n {\n if (values.empty()) {\n return true;\n }\n\n TypeQueryVisitor visitor;\n Visit(visitor, *values.front());\n\n const TypeQueryVisitor::ElementType base = visitor.get();\n\n return std::all_of(values.begin(), values.end(), [&visitor, base](const IElement* e) {\n Visit(visitor, *e);\n return base == visitor.get();\n });\n }\n }\n\n void ExtendElement::set(const ExtendElement::ValueType& val)\n {\n if (!TypeChecker(val)) {\n throw LogicError(\"ExtendElement must be composed from Elements of same type\");\n }\n\n if (val.empty()) {\n return;\n }\n\n hasContent = true;\n value = val;\n }\n\n void ExtendElement::push_back(IElement* e)\n {\n\n if (!e) {\n return;\n }\n\n if (!value.empty()) {\n TypeQueryVisitor baseType;\n Visit(baseType, *value.front());\n\n TypeQueryVisitor type;\n Visit(type, *e);\n\n if (baseType.get() != type.get()) {\n throw LogicError(\"ExtendElement must be composed from Elements of same type\");\n }\n }\n\n hasContent = true;\n value.push_back(e);\n }\n\n namespace\n {\n\n class ElementMerger\n {\n\n IElement* result;\n TypeQueryVisitor::ElementType base;\n\n \/**\n * Merge strategy for Primitive types - just replace by latest value\n *\/\n template <typename T, typename V = typename T::ValueType>\n struct ValueMerge {\n V& value;\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n value = merge.value;\n }\n };\n\n template <typename T>\n struct ValueMerge<T, IElement*> {\n IElement*& value;\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n if (!value && merge.value) {\n value = merge.value->clone();\n }\n }\n };\n\n \/**\n * Merge stategy for objects\/array\n * - if member\n * - without existing key -> append\n * - with existing key - replace old value\n * - if not member\n * - if empty value -> ignore (type holder for array)\n * - else append\n *\/\n template <typename T>\n struct ValueMerge<T, RefractElements> {\n typename T::ValueType& value;\n\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n typedef std::map<std::string, MemberElement*> MapKeyToMember;\n typedef std::map<std::string, RefElement*> MapNameToRef;\n\n MapKeyToMember keysBase;\n MapNameToRef refBase;\n\n for (auto& element : value) {\n if (MemberElement* member = TypeQueryVisitor::as<MemberElement>(element)) {\n\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n keysBase[key->value] = member;\n }\n } else if (RefElement* ref = TypeQueryVisitor::as<RefElement>(element)) {\n refBase[ref->value] = ref;\n }\n }\n\n for (auto const& element : merge.value) {\n if (MemberElement* member = TypeQueryVisitor::as<MemberElement>(element)) {\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n MapKeyToMember::iterator iKey = keysBase.find(key->value);\n\n if (iKey != keysBase.end()) { \/\/ key is already presented, replace value\n delete iKey->second->value.second;\n iKey->second->value.second = member->value.second->clone();\n\n CollectionMerge()(iKey->second->meta, member->meta, InKeysChecker(noMetaKeywords));\n CollectionMerge()(iKey->second->attributes, member->attributes, InKeysChecker(emptyArray));\n }\n else { \/\/ unknown key, append value\n MemberElement* clone = static_cast<MemberElement*>(member->clone());\n value.push_back(clone);\n keysBase[key->value] = clone;\n }\n }\n } else if (RefElement* ref = TypeQueryVisitor::as<RefElement>(element)) {\n if (refBase.find(ref->value) == refBase.end()) {\n RefElement* clone = static_cast<RefElement*>(member->clone());\n value.push_back(clone);\n refBase[ref->value] = clone;\n }\n } else if (!(element)->empty()) { \/\/ merge member is not MemberElement, append value\n value.push_back(element->clone());\n }\n }\n }\n };\n\n\n class CollectionMerge {\n\n public:\n CollectionMerge() = default;\n\n void operator()(IElement::MemberElementCollection& info, const IElement::MemberElementCollection& append, std::function<bool (const std::string&)> noMerge) {\n IElement::MemberElementCollection toAppend;\n\n for (const auto& member : append) {\n\n assert(member);\n\n if (!member) {\n continue;\n }\n\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n if (noMerge(key->value)) {\n continue;\n }\n\n IElement::MemberElementCollection::iterator item = info.find(key->value);\n if (item != info.end()) {\n \/\/ this key alrady exist, replace value\n delete (*item)->value.second;\n (*item)->value.second = member->value.second->clone();\n continue;\n }\n }\n\n toAppend.push_back(static_cast<MemberElement*>(member->clone()));\n }\n\n for (const auto& member : toAppend) {\n info.push_back(member);\n }\n\n toAppend.clear();\n }\n };\n\n \/**\n * precondition - target && append element MUST BE of same type\n * we use static_cast<> without checking type this is responsibility of caller\n *\/\n template <typename T>\n static void doMerge(IElement* target, const IElement* append)\n {\n typedef T ElementType;\n\n CollectionMerge()(target->meta, append->meta, InKeysChecker(noMetaKeywords));\n CollectionMerge()(target->attributes, append->attributes, InKeysChecker(emptyArray));\n\n ValueMerge<T>(static_cast<ElementType&>(*target))(static_cast<const ElementType&>(*append));\n }\n\n public:\n ElementMerger() : result(NULL), base(TypeQueryVisitor::Unknown)\n {\n }\n\n void operator()(const IElement* e)\n {\n if (!e) {\n return;\n }\n\n if (!result) {\n result = e->clone();\n\n TypeQueryVisitor type;\n Visit(type, *result);\n base = type.get();\n return;\n }\n\n TypeQueryVisitor type;\n VisitBy(*e, type);\n\n if (type.get() != base) {\n throw refract::LogicError(\"Can not merge different types of elements\");\n }\n\n switch (base) {\n case TypeQueryVisitor::String:\n doMerge<StringElement>(result, e);\n return;\n\n case TypeQueryVisitor::Number:\n doMerge<NumberElement>(result, e);\n return;\n\n case TypeQueryVisitor::Boolean:\n doMerge<BooleanElement>(result, e);\n return;\n\n case TypeQueryVisitor::Array:\n doMerge<ArrayElement>(result, e);\n return;\n\n case TypeQueryVisitor::Object:\n doMerge<ObjectElement>(result, e);\n return;\n\n case TypeQueryVisitor::Enum:\n doMerge<EnumElement>(result, e);\n return;\n\n case TypeQueryVisitor::Ref:\n doMerge<RefElement>(result, e);\n return;\n\n case TypeQueryVisitor::Member:\n case TypeQueryVisitor::Extend:\n case TypeQueryVisitor::Null:\n throw LogicError(\"Unappropriate kind of element to merging\");\n default:\n throw LogicError(\"Element has no implemented merging\");\n }\n }\n\n operator IElement*() const\n {\n return result;\n }\n };\n }\n\n IElement* ExtendElement::merge() const\n {\n return std::for_each(value.begin(), value.end(), ElementMerger());\n }\n\n\n}; \/\/ namespace refract\n<commit_msg>reformat according to clangformat as required in review<commit_after>\/\/\n\/\/ refract\/Element.cc\n\/\/ librefract\n\/\/\n\/\/ Created by Jiri Kratochvil on 18\/05\/15.\n\/\/ Copyright (c) 2015 Apiary Inc. All rights reserved.\n\/\/\n#include \"Element.h\"\n#include <cassert>\n\n#include <set>\n#include <map>\n#include <string>\n\n#include \"ComparableVisitor.h\"\n#include \"TypeQueryVisitor.h\"\n\n#include <string.h>\n#include <array>\n\nnamespace refract\n{\n\n namespace\n {\n\n const constexpr std::array<const char*, 13> reservedKeywords = {\n\n \"null\",\n \"boolean\",\n \"number\",\n \"string\",\n\n \"member\",\n\n \"array\",\n \"enum\",\n \"object\",\n\n \"ref\",\n \"select\",\n \"option\",\n \"extend\",\n\n \"generic\"\n };\n\n const constexpr std::array<const char*, 3> noMetaKeywords = { \"id\", \"prefix\", \"namespace\" };\n\n const constexpr std::array<const char*, 0> emptyArray;\n\n template <typename Container>\n struct inKeys {\n const Container& keywords;\n inKeys(const Container& keywords) : keywords(keywords)\n {\n }\n\n bool operator()(const std::string& searched)\n {\n return std::any_of(keywords.begin(), keywords.end(), [&searched](const char* key) {\n return !strcmp(key, searched.c_str());\n });\n }\n };\n\n template <typename Container>\n inKeys<Container> InKeysChecker(const Container& keywords)\n {\n return inKeys<Container>(keywords);\n }\n }\n\n bool isReserved(const std::string& element)\n {\n return InKeysChecker(reservedKeywords)(element);\n }\n\n IElement::MemberElementCollection::const_iterator IElement::MemberElementCollection::find(\n const std::string& name) const\n {\n ComparableVisitor v(name);\n Visitor visitor(v);\n\n return std::find_if(elements.begin(), elements.end(), [&visitor, &v](const MemberElement* e) {\n e->value.first->content(visitor);\n return v.get();\n });\n }\n\n IElement::MemberElementCollection::iterator IElement::MemberElementCollection::find(const std::string& name)\n {\n ComparableVisitor v(name);\n Visitor visitor(v);\n\n return std::find_if(elements.begin(), elements.end(), [&visitor, &v](const MemberElement* e) {\n e->value.first->content(visitor);\n return v.get();\n });\n }\n\n IElement::MemberElementCollection::~MemberElementCollection()\n {\n for (MemberElement* e : elements)\n delete e;\n }\n\n StringElement* IElement::Create(const char* value)\n {\n return Create(std::string(value));\n };\n\n MemberElement& IElement::MemberElementCollection::operator[](const std::string& name)\n {\n auto it = find(name);\n if (it != elements.end()) {\n return *(*it);\n }\n\n elements.emplace_back(new MemberElement(new StringElement(name), nullptr));\n\n return *elements.back();\n }\n\n void IElement::MemberElementCollection::clone(const IElement::MemberElementCollection& other)\n {\n for (const auto& el : other.elements) {\n elements.emplace_back(static_cast<MemberElement*>(el->clone()));\n }\n }\n\n void IElement::MemberElementCollection::erase(const std::string& key)\n {\n auto it = find(key);\n\n if (it != elements.end()) {\n delete *it;\n elements.erase(it);\n }\n }\n\n namespace\n {\n\n bool TypeChecker(const ExtendElement::ValueType& values)\n {\n if (values.empty()) {\n return true;\n }\n\n TypeQueryVisitor visitor;\n Visit(visitor, *values.front());\n\n const TypeQueryVisitor::ElementType base = visitor.get();\n\n return std::all_of(values.begin(), values.end(), [&visitor, base](const IElement* e) {\n Visit(visitor, *e);\n return base == visitor.get();\n });\n }\n }\n\n void ExtendElement::set(const ExtendElement::ValueType& val)\n {\n if (!TypeChecker(val)) {\n throw LogicError(\"ExtendElement must be composed from Elements of same type\");\n }\n\n if (val.empty()) {\n return;\n }\n\n hasContent = true;\n value = val;\n }\n\n void ExtendElement::push_back(IElement* e)\n {\n\n if (!e) {\n return;\n }\n\n if (!value.empty()) {\n TypeQueryVisitor baseType;\n Visit(baseType, *value.front());\n\n TypeQueryVisitor type;\n Visit(type, *e);\n\n if (baseType.get() != type.get()) {\n throw LogicError(\"ExtendElement must be composed from Elements of same type\");\n }\n }\n\n hasContent = true;\n value.push_back(e);\n }\n\n namespace\n {\n\n class ElementMerger\n {\n\n IElement* result;\n TypeQueryVisitor::ElementType base;\n\n \/**\n * Merge strategy for Primitive types - just replace by latest value\n *\/\n template <typename T, typename V = typename T::ValueType>\n struct ValueMerge {\n V& value;\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n value = merge.value;\n }\n };\n\n template <typename T>\n struct ValueMerge<T, IElement*> {\n IElement*& value;\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n if (!value && merge.value) {\n value = merge.value->clone();\n }\n }\n };\n\n \/**\n * Merge stategy for objects\/array\n * - if member\n * - without existing key -> append\n * - with existing key - replace old value\n * - if not member\n * - if empty value -> ignore (type holder for array)\n * - else append\n *\/\n template <typename T>\n struct ValueMerge<T, RefractElements> {\n typename T::ValueType& value;\n\n ValueMerge(T& element) : value(element.value)\n {\n }\n\n void operator()(const T& merge)\n {\n typedef std::map<std::string, MemberElement*> MapKeyToMember;\n typedef std::map<std::string, RefElement*> MapNameToRef;\n\n MapKeyToMember keysBase;\n MapNameToRef refBase;\n\n for (auto& element : value) {\n if (MemberElement* member = TypeQueryVisitor::as<MemberElement>(element)) {\n\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n keysBase[key->value] = member;\n }\n } else if (RefElement* ref = TypeQueryVisitor::as<RefElement>(element)) {\n refBase[ref->value] = ref;\n }\n }\n\n for (auto const& element : merge.value) {\n if (MemberElement* member = TypeQueryVisitor::as<MemberElement>(element)) {\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n MapKeyToMember::iterator iKey = keysBase.find(key->value);\n\n if (iKey != keysBase.end()) { \/\/ key is already presented, replace value\n delete iKey->second->value.second;\n iKey->second->value.second = member->value.second->clone();\n\n CollectionMerge()(iKey->second->meta, member->meta, InKeysChecker(noMetaKeywords));\n CollectionMerge()(\n iKey->second->attributes, member->attributes, InKeysChecker(emptyArray));\n } else { \/\/ unknown key, append value\n MemberElement* clone = static_cast<MemberElement*>(member->clone());\n value.push_back(clone);\n keysBase[key->value] = clone;\n }\n }\n } else if (RefElement* ref = TypeQueryVisitor::as<RefElement>(element)) {\n if (refBase.find(ref->value) == refBase.end()) {\n RefElement* clone = static_cast<RefElement*>(member->clone());\n value.push_back(clone);\n refBase[ref->value] = clone;\n }\n } else if (!(element)->empty()) { \/\/ merge member is not MemberElement, append value\n value.push_back(element->clone());\n }\n }\n }\n };\n\n class CollectionMerge\n {\n\n public:\n CollectionMerge() = default;\n\n void operator()(IElement::MemberElementCollection& info, const IElement::MemberElementCollection& append, std::function<bool (const std::string&)> noMerge) {\n IElement::MemberElementCollection toAppend;\n\n for (const auto& member : append) {\n\n assert(member);\n\n if (!member) {\n continue;\n }\n\n if (StringElement* key = TypeQueryVisitor::as<StringElement>(member->value.first)) {\n if (noMerge(key->value)) {\n continue;\n }\n\n IElement::MemberElementCollection::iterator item = info.find(key->value);\n if (item != info.end()) {\n \/\/ this key alrady exist, replace value\n delete (*item)->value.second;\n (*item)->value.second = member->value.second->clone();\n continue;\n }\n }\n\n toAppend.push_back(static_cast<MemberElement*>(member->clone()));\n }\n\n for (const auto& member : toAppend) {\n info.push_back(member);\n }\n\n toAppend.clear();\n }\n };\n\n \/**\n * precondition - target && append element MUST BE of same type\n * we use static_cast<> without checking type this is responsibility of caller\n *\/\n template <typename T>\n static void doMerge(IElement* target, const IElement* append)\n {\n typedef T ElementType;\n\n CollectionMerge()(target->meta, append->meta, InKeysChecker(noMetaKeywords));\n CollectionMerge()(target->attributes, append->attributes, InKeysChecker(emptyArray));\n\n ValueMerge<T>(static_cast<ElementType&>(*target))(static_cast<const ElementType&>(*append));\n }\n\n public:\n ElementMerger() : result(NULL), base(TypeQueryVisitor::Unknown)\n {\n }\n\n void operator()(const IElement* e)\n {\n if (!e) {\n return;\n }\n\n if (!result) {\n result = e->clone();\n\n TypeQueryVisitor type;\n Visit(type, *result);\n base = type.get();\n return;\n }\n\n TypeQueryVisitor type;\n VisitBy(*e, type);\n\n if (type.get() != base) {\n throw refract::LogicError(\"Can not merge different types of elements\");\n }\n\n switch (base) {\n case TypeQueryVisitor::String:\n doMerge<StringElement>(result, e);\n return;\n\n case TypeQueryVisitor::Number:\n doMerge<NumberElement>(result, e);\n return;\n\n case TypeQueryVisitor::Boolean:\n doMerge<BooleanElement>(result, e);\n return;\n\n case TypeQueryVisitor::Array:\n doMerge<ArrayElement>(result, e);\n return;\n\n case TypeQueryVisitor::Object:\n doMerge<ObjectElement>(result, e);\n return;\n\n case TypeQueryVisitor::Enum:\n doMerge<EnumElement>(result, e);\n return;\n\n case TypeQueryVisitor::Ref:\n doMerge<RefElement>(result, e);\n return;\n\n case TypeQueryVisitor::Member:\n case TypeQueryVisitor::Extend:\n case TypeQueryVisitor::Null:\n throw LogicError(\"Unappropriate kind of element to merging\");\n default:\n throw LogicError(\"Element has no implemented merging\");\n }\n }\n\n operator IElement*() const\n {\n return result;\n }\n };\n }\n\n IElement* ExtendElement::merge() const\n {\n return std::for_each(value.begin(), value.end(), ElementMerger());\n }\n\n\n}; \/\/ namespace refract\n<|endoftext|>"} {"text":"<commit_before>\/* ************************************************************************\n * Copyright 2018 Advanced Micro Devices, Inc.\n * ************************************************************************ *\/\n\n#include \"unit.hpp\"\n\n#include <rocsparse.h>\n#include <hip\/hip_runtime_api.h>\n\n#ifdef GOOGLE_TEST\n#include <gtest\/gtest.h>\n#endif\n\n\/* ========================================Gtest Unit Check\n * ==================================================== *\/\n\n\/*! \\brief Template: gtest unit compare two matrices float\/double\/complex *\/\n\/\/ Do not put a wrapper over ASSERT_FLOAT_EQ, sincer assert exit the current function NOT the test\n\/\/ case\n\/\/ a wrapper will cause the loop keep going\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, float* hCPU, float* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_FLOAT_EQ(hCPU[i + j], hGPU[i + j]);\n#endif\n }\n }\n}\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, double* hCPU, double* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_DOUBLE_EQ(hCPU[i + j], hGPU[i + j]);\n#endif\n }\n }\n}\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, rocsparse_int* hCPU, rocsparse_int* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_EQ(hCPU[i + j], hGPU[i + j]);\n#endif\n }\n }\n}\n<commit_msg>added asserts to unit check to be able to verify when benchmarking<commit_after>\/* ************************************************************************\n * Copyright 2018 Advanced Micro Devices, Inc.\n * ************************************************************************ *\/\n\n#include \"unit.hpp\"\n\n#include <rocsparse.h>\n#include <assert.h>\n#include <hip\/hip_runtime_api.h>\n\n#ifdef GOOGLE_TEST\n#include <gtest\/gtest.h>\n#endif\n\n\/* ========================================Gtest Unit Check\n * ==================================================== *\/\n\n\/*! \\brief Template: gtest unit compare two matrices float\/double\/complex *\/\n\/\/ Do not put a wrapper over ASSERT_FLOAT_EQ, sincer assert exit the current function NOT the test\n\/\/ case\n\/\/ a wrapper will cause the loop keep going\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, float* hCPU, float* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_FLOAT_EQ(hCPU[i + j], hGPU[i + j]);\n#else\n assert(hCPU[i + j] == hGPU[i + j]);\n#endif\n }\n }\n}\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, double* hCPU, double* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_DOUBLE_EQ(hCPU[i + j], hGPU[i + j]);\n#else\n assert(hCPU[i + j] == hGPU[i + j]);\n#endif\n }\n }\n}\n\ntemplate <>\nvoid unit_check_general(rocsparse_int M, rocsparse_int N, rocsparse_int* hCPU, rocsparse_int* hGPU)\n{\n for(rocsparse_int j = 0; j < N; j++)\n {\n for(rocsparse_int i = 0; i < M; i++)\n {\n#ifdef GOOGLE_TEST\n ASSERT_EQ(hCPU[i + j], hGPU[i + j]);\n#else\n assert(hCPU[i + j] == hGPU[i + j]);\n#endif\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: AccessibleSelectionBase.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: vg $ $Date: 2003-04-24 16:49:39 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n#define _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n\n#ifndef COMPHELPER_ACCESSIBLE_SELECTION_HELPER_HXX\n#include <comphelper\/accessibleselectionhelper.hxx>\n#endif\n\nnamespace accessibility\n{\n\/** @descr\n This base class provides a base implementation of the\n <type>XAccessibleSelection<\/type> interface.\n The following methods have to be implemented if this\n class is used:\n\n <method>implGetMutex<\/method>,\n <method>implGetAccessibleContext<\/method>,\n <method>implIsSelected<\/method>,\n <method>implSelect<\/method>,\n*\/\n class AccessibleSelectionBase : public ::comphelper::OCommonAccessibleSelection,\n public ::com::sun::star::accessibility::XAccessibleSelection\n {\n protected:\n\n virtual ::osl::Mutex& implGetMutex() = 0;\n\n public:\n\n \/\/ XAccessibleSelection - default implementations\n virtual void SAL_CALL selectAccessibleChild( sal_Int32 nChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL clearAccessibleSelection( ) throw (::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL selectAllAccessible( ) throw (::com::sun::star::uno::RuntimeException);\n virtual sal_Int32 SAL_CALL getSelectedAccessibleChildCount( ) throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > SAL_CALL getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n\n public:\n\n AccessibleSelectionBase();\n virtual ~AccessibleSelectionBase();\n };\n\n}\n\n#endif \/\/ _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n<commit_msg>INTEGRATION: CWS uaa03 (1.2.30); FILE MERGED 2003\/05\/21 15:46:00 mt 1.2.30.1: #i14623# UAA finalization<commit_after>\/*************************************************************************\n *\n * $RCSfile: AccessibleSelectionBase.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: vg $ $Date: 2003-05-22 12:53:27 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n#define _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n\n#ifndef COMPHELPER_ACCESSIBLE_SELECTION_HELPER_HXX\n#include <comphelper\/accessibleselectionhelper.hxx>\n#endif\n\nnamespace accessibility\n{\n\/** @descr\n This base class provides a base implementation of the\n <type>XAccessibleSelection<\/type> interface.\n The following methods have to be implemented if this\n class is used:\n\n <method>implGetMutex<\/method>,\n <method>implGetAccessibleContext<\/method>,\n <method>implIsSelected<\/method>,\n <method>implSelect<\/method>,\n*\/\n class AccessibleSelectionBase : public ::comphelper::OCommonAccessibleSelection,\n public ::com::sun::star::accessibility::XAccessibleSelection\n {\n protected:\n\n virtual ::osl::Mutex& implGetMutex() = 0;\n\n public:\n\n \/\/ XAccessibleSelection - default implementations\n virtual void SAL_CALL selectAccessibleChild( sal_Int32 nChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual sal_Bool SAL_CALL isAccessibleChildSelected( sal_Int32 nChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL clearAccessibleSelection( ) throw (::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL selectAllAccessibleChildren( ) throw (::com::sun::star::uno::RuntimeException);\n virtual sal_Int32 SAL_CALL getSelectedAccessibleChildCount( ) throw (::com::sun::star::uno::RuntimeException);\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible > SAL_CALL getSelectedAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n virtual void SAL_CALL deselectAccessibleChild( sal_Int32 nSelectedChildIndex ) throw (::com::sun::star::lang::IndexOutOfBoundsException, ::com::sun::star::uno::RuntimeException);\n\n public:\n\n AccessibleSelectionBase();\n virtual ~AccessibleSelectionBase();\n };\n\n}\n\n#endif \/\/ _SVX_ACCESSIBILITY_ACCESSIBLE_SELECTION_BASE_HXX\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: txatbase.cxx,v $\n *\n * $Revision: 1.9 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 21:47:32 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _TXATBASE_HXX\n#include <txatbase.hxx>\n#endif\n\nSwTxtAttr::SwTxtAttr( const SfxPoolItem& rAttr, xub_StrLen nStt )\n : pAttr( &rAttr ), nStart( nStt )\n{\n bDontExpand = bLockExpandFlag = bDontMergeAttr = bDontMoveAttr =\n bCharFmtAttr = bOverlapAllowedAttr = bPriorityAttr =\n bDontExpandStart = FALSE;\n}\n\nSwTxtAttr::~SwTxtAttr( )\n{\n}\n\nxub_StrLen* SwTxtAttr::GetEnd()\n{\n return 0;\n}\n\n \/\/ RemoveFromPool muss immer vorm DTOR Aufruf erfolgen!!\n \/\/ Meldet sein Attribut beim Pool ab\nvoid SwTxtAttr::RemoveFromPool( SfxItemPool& rPool )\n{\n rPool.Remove( GetAttr() );\n pAttr = 0;\n}\n\nint SwTxtAttr::operator==( const SwTxtAttr& rAttr ) const\n{\n return GetAttr() == rAttr.GetAttr();\n}\n\nSwTxtAttrEnd::SwTxtAttrEnd( const SfxPoolItem& rAttr, xub_StrLen nS,\n xub_StrLen nE )\n : SwTxtAttr( rAttr, nS ), nEnd( nE )\n{\n}\n\nxub_StrLen* SwTxtAttrEnd::GetEnd()\n{\n return &nEnd;\n}\n<commit_msg>INTEGRATION: CWS notes2 (1.9.320); FILE MERGED 2007\/10\/12 22:30:10 mod 1.9.320.1: fix for overlays, layout algorithm fix, patch for ww8 import<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: txatbase.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: rt $ $Date: 2008-02-19 13:48:46 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sw.hxx\"\n\n\n\n#ifndef _SFXITEMPOOL_HXX\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _TXATBASE_HXX\n#include <txatbase.hxx>\n#endif\n\n#ifndef _FMTFLD_HXX \/\/autogen\n#include <fmtfld.hxx>\n#endif\n#ifndef _DOCUFLD_HXX \/\/autogen\n#include <docufld.hxx>\n#endif\n\n\n#include \"doc.hxx\"\n#include \"docsh.hxx\"\n#include \"..\/..\/..\/inc\/PostItMgr.hxx\"\n#include \"..\/..\/ui\/inc\/view.hxx\"\n\n\nSwTxtAttr::SwTxtAttr( const SfxPoolItem& rAttr, xub_StrLen nStt )\n : pAttr( &rAttr ), nStart( nStt )\n{\n bDontExpand = bLockExpandFlag = bDontMergeAttr = bDontMoveAttr =\n bCharFmtAttr = bOverlapAllowedAttr = bPriorityAttr =\n bDontExpandStart = FALSE;\n}\n\nSwTxtAttr::~SwTxtAttr( )\n{\n}\n\nxub_StrLen* SwTxtAttr::GetEnd()\n{\n return 0;\n}\n\n \/\/ RemoveFromPool muss immer vorm DTOR Aufruf erfolgen!!\n \/\/ Meldet sein Attribut beim Pool ab\nvoid SwTxtAttr::RemoveFromPool( SfxItemPool& rPool )\n{\n \/*\n \/\/ delete in SwPostItMgr\n if (Which()==RES_TXTATR_FIELD)\n {\n if ( ((SwFmtFld&)(GetAttr())).GetFld()->GetTyp()->Which()==RES_POSTITFLD)\n {\n SwDocShell* aShell = static_cast<SwPostItFieldType*>(((SwFmtFld&)GetAttr()).GetFld()->GetTyp())->GetDoc()->GetDocShell();\n if (aShell)\n {\n aShell->GetView()->GetPostItMgr()->Delete(&(SwFmtFld&)GetAttr());\n }\n\n }\n }\n *\/\n rPool.Remove( GetAttr() );\n pAttr = 0;\n}\n\nint SwTxtAttr::operator==( const SwTxtAttr& rAttr ) const\n{\n return GetAttr() == rAttr.GetAttr();\n}\n\nSwTxtAttrEnd::SwTxtAttrEnd( const SfxPoolItem& rAttr, xub_StrLen nS,\n xub_StrLen nE )\n : SwTxtAttr( rAttr, nS ), nEnd( nE )\n{\n}\n\nxub_StrLen* SwTxtAttrEnd::GetEnd()\n{\n return &nEnd;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n\n#ifdef _WIN32\n#define DLLEXPORT __declspec(dllexport)\n#else\n#define DLLEXPORT\n#endif\n\nclass DLLEXPORT Foo {\npublic:\n Foo();\n ~Foo();\n virtual int TakeAVoid(void);\n virtual int TakeABool(bool i);\n virtual int TakeAChar(char i);\n virtual int TakeAShort(short i);\n virtual int TakeAnInt(int i);\n virtual int TakeALong(long i);\n virtual int TakeALongLong(long long i);\n virtual int TakeAFloat(float i);\n virtual int TakeADouble(double i);\n virtual int TakeAString(char *i);\n virtual int TakeAnArray(int i[]);\n virtual int TakeAPointer(void *i);\n virtual int TakeABoolPointer(bool *i);\n virtual int TakeACharPointer(char *i);\n virtual int TakeAShortPointer(short *i);\n virtual int TakeAnIntPointer(int *i);\n virtual int TakeALongPointer(long *i);\n virtual int TakeALongLongPointer(long long *i);\n virtual int TakeAFloatPointer(float *i);\n virtual int TakeADoublePointer(double *i);\n virtual int TakeAUInt(uint i);\n virtual int TakeAUShort(ushort i);\n virtual int TakeAUChar(unsigned char i);\n virtual int TakeAInt64(long long i);\n virtual int TakeAULongLong(unsigned long long i);\n virtual int TakeAUInt64(unsigned long long i);\n};\n\nFoo::Foo() { };\nFoo::~Foo() { };\n\nint Foo::TakeAVoid(void) { return 0; }\nint Foo::TakeABool(bool i) { return 1; }\nint Foo::TakeAChar(char i) { return 2; }\nint Foo::TakeAShort(short i) { return 3; }\nint Foo::TakeAnInt(int i) { return 4; }\nint Foo::TakeALong(long i) { return 5; }\nint Foo::TakeALongLong(long long i) { return 6; }\nint Foo::TakeAFloat(float i) { return 7; }\nint Foo::TakeADouble(double i) { return 8; }\nint Foo::TakeAString(char *i) { return 9; }\nint Foo::TakeAnArray(int i[]) { return 10; }\nint Foo::TakeAPointer(void *i) { return 11; }\nint Foo::TakeABoolPointer(bool *i) { return 12; }\nint Foo::TakeACharPointer(char *i) { return 13; }\nint Foo::TakeAShortPointer(short *i) { return 14; }\nint Foo::TakeAnIntPointer(int *i) { return 15; }\nint Foo::TakeALongPointer(long *i) { return 16; }\nint Foo::TakeALongLongPointer(long long *i) { return 17; }\nint Foo::TakeAFloatPointer(float *i) { return 18; }\nint Foo::TakeADoublePointer(double *i) { return 19; }\nint Foo::TakeAUInt(uint i) { return 20; }\nint Foo::TakeAUShort(ushort i) { return 21; }\nint Foo::TakeAUChar(unsigned char i) { return 22; }\nint Foo::TakeAInt64(long long i) { return 23; }\nint Foo::TakeAULongLong(unsigned long long i) { return 24; }\nint Foo::TakeAUInt64(unsigned long long i) { return 25; }\n<commit_msg>Fixes for Windows suggested by FROGGS++<commit_after>#include <stdlib.h>\n\n#ifdef _WIN32\n#define DLLEXPORT __declspec(dllexport)\n#else\n#define DLLEXPORT\n#endif\n\nclass DLLEXPORT Foo {\npublic:\n Foo();\n ~Foo();\n virtual int TakeAVoid(void);\n virtual int TakeABool(bool i);\n virtual int TakeAChar(char i);\n virtual int TakeAShort(short i);\n virtual int TakeAnInt(int i);\n virtual int TakeALong(long i);\n virtual int TakeALongLong(long long i);\n virtual int TakeAFloat(float i);\n virtual int TakeADouble(double i);\n virtual int TakeAString(char *i);\n virtual int TakeAnArray(int i[]);\n virtual int TakeAPointer(void *i);\n virtual int TakeABoolPointer(bool *i);\n virtual int TakeACharPointer(char *i);\n virtual int TakeAShortPointer(short *i);\n virtual int TakeAnIntPointer(int *i);\n virtual int TakeALongPointer(long *i);\n virtual int TakeALongLongPointer(long long *i);\n virtual int TakeAFloatPointer(float *i);\n virtual int TakeADoublePointer(double *i);\n virtual int TakeAUInt(unsigned int i);\n virtual int TakeAUShort(unsigned short i);\n virtual int TakeAUChar(unsigned char i);\n virtual int TakeAInt64(long long i);\n virtual int TakeAULongLong(unsigned long long i);\n virtual int TakeAUInt64(unsigned long long i);\n};\n\nFoo::Foo() { };\nFoo::~Foo() { };\n\nint Foo::TakeAVoid(void) { return 0; }\nint Foo::TakeABool(bool i) { return 1; }\nint Foo::TakeAChar(char i) { return 2; }\nint Foo::TakeAShort(short i) { return 3; }\nint Foo::TakeAnInt(int i) { return 4; }\nint Foo::TakeALong(long i) { return 5; }\nint Foo::TakeALongLong(long long i) { return 6; }\nint Foo::TakeAFloat(float i) { return 7; }\nint Foo::TakeADouble(double i) { return 8; }\nint Foo::TakeAString(char *i) { return 9; }\nint Foo::TakeAnArray(int i[]) { return 10; }\nint Foo::TakeAPointer(void *i) { return 11; }\nint Foo::TakeABoolPointer(bool *i) { return 12; }\nint Foo::TakeACharPointer(char *i) { return 13; }\nint Foo::TakeAShortPointer(short *i) { return 14; }\nint Foo::TakeAnIntPointer(int *i) { return 15; }\nint Foo::TakeALongPointer(long *i) { return 16; }\nint Foo::TakeALongLongPointer(long long *i) { return 17; }\nint Foo::TakeAFloatPointer(float *i) { return 18; }\nint Foo::TakeADoublePointer(double *i) { return 19; }\nint Foo::TakeAUInt(unsigned int i) { return 20; }\nint Foo::TakeAUShort(unsigned short i) { return 21; }\nint Foo::TakeAUChar(unsigned char i) { return 22; }\nint Foo::TakeAInt64(long long i) { return 23; }\nint Foo::TakeAULongLong(unsigned long long i) { return 24; }\nint Foo::TakeAUInt64(unsigned long long i) { return 25; }\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/\/ @author Andrei Alexandrescu (andrei.alexandrescu@fb.com)\n\n#include \"Benchmark.h\"\n#include \"Foreach.h\"\n#include \"json.h\"\n#include \"String.h\"\n\n#include <algorithm>\n#include <boost\/regex.hpp>\n#include <cmath>\n#include <iostream>\n#include <limits>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\nDEFINE_bool(benchmark, false, \"Run benchmarks.\");\nDEFINE_bool(json, false, \"Output in JSON format.\");\n\nDEFINE_string(bm_regex, \"\",\n \"Only benchmarks whose names match this regex will be run.\");\n\nDEFINE_int64(bm_min_usec, 100,\n \"Minimum # of microseconds we'll accept for each benchmark.\");\n\nDEFINE_int64(bm_min_iters, 1,\n \"Minimum # of iterations we'll try for each benchmark.\");\n\nDEFINE_int32(bm_max_secs, 1,\n \"Maximum # of seconds we'll spend on each benchmark.\");\n\n\nnamespace folly {\n\nBenchmarkSuspender::NanosecondsSpent BenchmarkSuspender::nsSpent;\n\ntypedef function<uint64_t(unsigned int)> BenchmarkFun;\nstatic vector<tuple<const char*, const char*, BenchmarkFun>> benchmarks;\n\n\/\/ Add the global baseline\nBENCHMARK(globalBenchmarkBaseline) {\n asm volatile(\"\");\n}\n\nvoid detail::addBenchmarkImpl(const char* file, const char* name,\n BenchmarkFun fun) {\n benchmarks.emplace_back(file, name, std::move(fun));\n}\n\n\/**\n * Given a point, gives density at that point as a number 0.0 < x <=\n * 1.0. The result is 1.0 if all samples are equal to where, and\n * decreases near 0 if all points are far away from it. The density is\n * computed with the help of a radial basis function.\n *\/\nstatic double density(const double * begin, const double *const end,\n const double where, const double bandwidth) {\n assert(begin < end);\n assert(bandwidth > 0.0);\n double sum = 0.0;\n FOR_EACH_RANGE (i, begin, end) {\n auto d = (*i - where) \/ bandwidth;\n sum += exp(- d * d);\n }\n return sum \/ (end - begin);\n}\n\n\/**\n * Computes mean and variance for a bunch of data points. Note that\n * mean is currently not being used.\n *\/\nstatic pair<double, double>\nmeanVariance(const double * begin, const double *const end) {\n assert(begin < end);\n double sum = 0.0, sum2 = 0.0;\n FOR_EACH_RANGE (i, begin, end) {\n sum += *i;\n sum2 += *i * *i;\n }\n auto const n = end - begin;\n return make_pair(sum \/ n, sqrt((sum2 - sum * sum \/ n) \/ n));\n}\n\n\/**\n * Computes the mode of a sample set through brute force. Assumes\n * input is sorted.\n *\/\nstatic double mode(const double * begin, const double *const end) {\n assert(begin < end);\n \/\/ Lower bound and upper bound for result and their respective\n \/\/ densities.\n auto\n result = 0.0,\n bestDensity = 0.0;\n\n \/\/ Get the variance so we pass it down to density()\n auto const sigma = meanVariance(begin, end).second;\n if (!sigma) {\n \/\/ No variance means constant signal\n return *begin;\n }\n\n FOR_EACH_RANGE (i, begin, end) {\n assert(i == begin || *i >= i[-1]);\n auto candidate = density(begin, end, *i, sigma * sqrt(2.0));\n if (candidate > bestDensity) {\n \/\/ Found a new best\n bestDensity = candidate;\n result = *i;\n } else {\n \/\/ Density is decreasing... we could break here if we definitely\n \/\/ knew this is unimodal.\n }\n }\n\n return result;\n}\n\n\/**\n * Given a bunch of benchmark samples, estimate the actual run time.\n *\/\nstatic double estimateTime(double * begin, double * end) {\n assert(begin < end);\n\n \/\/ Current state of the art: get the minimum. After some\n \/\/ experimentation, it seems taking the minimum is the best.\n\n return *min_element(begin, end);\n\n \/\/ What follows after estimates the time as the mode of the\n \/\/ distribution.\n\n \/\/ Select the awesomest (i.e. most frequent) result. We do this by\n \/\/ sorting and then computing the longest run length.\n sort(begin, end);\n\n \/\/ Eliminate outliers. A time much larger than the minimum time is\n \/\/ considered an outlier.\n while (end[-1] > 2.0 * *begin) {\n --end;\n if (begin == end) {\n LOG(INFO) << *begin;\n }\n assert(begin < end);\n }\n\n double result = 0;\n\n \/* Code used just for comparison purposes *\/ {\n unsigned bestFrequency = 0;\n unsigned candidateFrequency = 1;\n double candidateValue = *begin;\n for (auto current = begin + 1; ; ++current) {\n if (current == end || *current != candidateValue) {\n \/\/ Done with the current run, see if it was best\n if (candidateFrequency > bestFrequency) {\n bestFrequency = candidateFrequency;\n result = candidateValue;\n }\n if (current == end) {\n break;\n }\n \/\/ Start a new run\n candidateValue = *current;\n candidateFrequency = 1;\n } else {\n \/\/ Cool, inside a run, increase the frequency\n ++candidateFrequency;\n }\n }\n }\n\n result = mode(begin, end);\n\n return result;\n}\n\nstatic double runBenchmarkGetNSPerIteration(const BenchmarkFun& fun,\n const double globalBaseline) {\n \/\/ They key here is accuracy; too low numbers means the accuracy was\n \/\/ coarse. We up the ante until we get to at least minNanoseconds\n \/\/ timings.\n static uint64_t resolutionInNs = 0, coarseResolutionInNs = 0;\n if (!resolutionInNs) {\n timespec ts;\n CHECK_EQ(0, clock_getres(detail::DEFAULT_CLOCK_ID, &ts));\n CHECK_EQ(0, ts.tv_sec) << \"Clock sucks.\";\n CHECK_LT(0, ts.tv_nsec) << \"Clock too fast for its own good.\";\n CHECK_EQ(1, ts.tv_nsec) << \"Clock too coarse, upgrade your kernel.\";\n resolutionInNs = ts.tv_nsec;\n }\n \/\/ We choose a minimum minimum (sic) of 100,000 nanoseconds, but if\n \/\/ the clock resolution is worse than that, it will be larger. In\n \/\/ essence we're aiming at making the quantization noise 0.01%.\n static const auto minNanoseconds =\n max(FLAGS_bm_min_usec * 1000UL,\n min(resolutionInNs * 100000, 1000000000ULL));\n\n \/\/ We do measurements in several epochs and take the minimum, to\n \/\/ account for jitter.\n static const unsigned int epochs = 1000;\n \/\/ We establish a total time budget as we don't want a measurement\n \/\/ to take too long. This will curtail the number of actual epochs.\n const uint64_t timeBudgetInNs = FLAGS_bm_max_secs * 1000000000;\n timespec global;\n CHECK_EQ(0, clock_gettime(CLOCK_REALTIME, &global));\n\n double epochResults[epochs] = { 0 };\n size_t actualEpochs = 0;\n\n for (; actualEpochs < epochs; ++actualEpochs) {\n for (unsigned int n = FLAGS_bm_min_iters; n < (1UL << 30); n *= 2) {\n auto const nsecs = fun(n);\n if (nsecs < minNanoseconds) {\n continue;\n }\n \/\/ We got an accurate enough timing, done. But only save if\n \/\/ smaller than the current result.\n epochResults[actualEpochs] = max(0.0, double(nsecs) \/ n - globalBaseline);\n \/\/ Done with the current epoch, we got a meaningful timing.\n break;\n }\n timespec now;\n CHECK_EQ(0, clock_gettime(CLOCK_REALTIME, &now));\n if (detail::timespecDiff(now, global) >= timeBudgetInNs) {\n \/\/ No more time budget available.\n ++actualEpochs;\n break;\n }\n }\n\n \/\/ If the benchmark was basically drowned in baseline noise, it's\n \/\/ possible it became negative.\n return max(0.0, estimateTime(epochResults, epochResults + actualEpochs));\n}\n\nstruct ScaleInfo {\n double boundary;\n const char* suffix;\n};\n\nstatic const ScaleInfo kTimeSuffixes[] {\n { 365.25 * 24 * 3600, \"years\" },\n { 24 * 3600, \"days\" },\n { 3600, \"hr\" },\n { 60, \"min\" },\n { 1, \"s\" },\n { 1E-3, \"ms\" },\n { 1E-6, \"us\" },\n { 1E-9, \"ns\" },\n { 1E-12, \"ps\" },\n { 1E-15, \"fs\" },\n { 0, NULL },\n};\n\nstatic const ScaleInfo kMetricSuffixes[] {\n { 1E24, \"Y\" }, \/\/ yotta\n { 1E21, \"Z\" }, \/\/ zetta\n { 1E18, \"X\" }, \/\/ \"exa\" written with suffix 'X' so as to not create\n \/\/ confusion with scientific notation\n { 1E15, \"P\" }, \/\/ peta\n { 1E12, \"T\" }, \/\/ terra\n { 1E9, \"G\" }, \/\/ giga\n { 1E6, \"M\" }, \/\/ mega\n { 1E3, \"K\" }, \/\/ kilo\n { 1, \"\" },\n { 1E-3, \"m\" }, \/\/ milli\n { 1E-6, \"u\" }, \/\/ micro\n { 1E-9, \"n\" }, \/\/ nano\n { 1E-12, \"p\" }, \/\/ pico\n { 1E-15, \"f\" }, \/\/ femto\n { 1E-18, \"a\" }, \/\/ atto\n { 1E-21, \"z\" }, \/\/ zepto\n { 1E-24, \"y\" }, \/\/ yocto\n { 0, NULL },\n};\n\nstatic string humanReadable(double n, unsigned int decimals,\n const ScaleInfo* scales) {\n if (std::isinf(n) || std::isnan(n)) {\n return folly::to<string>(n);\n }\n\n const double absValue = fabs(n);\n const ScaleInfo* scale = scales;\n while (absValue < scale[0].boundary && scale[1].suffix != NULL) {\n ++scale;\n }\n\n const double scaledValue = n \/ scale->boundary;\n return stringPrintf(\"%.*f%s\", decimals, scaledValue, scale->suffix);\n}\n\nstatic string readableTime(double n, unsigned int decimals) {\n return humanReadable(n, decimals, kTimeSuffixes);\n}\n\nstatic string metricReadable(double n, unsigned int decimals) {\n return humanReadable(n, decimals, kMetricSuffixes);\n}\n\nstatic void printBenchmarkResultsAsTable(\n const vector<tuple<const char*, const char*, double> >& data) {\n \/\/ Width available\n static const uint columns = 76;\n\n \/\/ Compute the longest benchmark name\n size_t longestName = 0;\n FOR_EACH_RANGE (i, 1, benchmarks.size()) {\n longestName = max(longestName, strlen(get<1>(benchmarks[i])));\n }\n\n \/\/ Print a horizontal rule\n auto separator = [&](char pad) {\n puts(string(columns, pad).c_str());\n };\n\n \/\/ Print header for a file\n auto header = [&](const char* file) {\n separator('=');\n printf(\"%-*srelative time\/iter iters\/s\\n\",\n columns - 28, file);\n separator('=');\n };\n\n double baselineNsPerIter = numeric_limits<double>::max();\n const char* lastFile = \"\";\n\n for (auto& datum : data) {\n auto file = get<0>(datum);\n if (strcmp(file, lastFile)) {\n \/\/ New file starting\n header(file);\n lastFile = file;\n }\n\n string s = get<1>(datum);\n if (s == \"-\") {\n separator('-');\n continue;\n }\n bool useBaseline \/* = void *\/;\n if (s[0] == '%') {\n s.erase(0, 1);\n useBaseline = true;\n } else {\n baselineNsPerIter = get<2>(datum);\n useBaseline = false;\n }\n s.resize(columns - 29, ' ');\n auto nsPerIter = get<2>(datum);\n auto secPerIter = nsPerIter \/ 1E9;\n auto itersPerSec = 1 \/ secPerIter;\n if (!useBaseline) {\n \/\/ Print without baseline\n printf(\"%*s %9s %7s\\n\",\n static_cast<int>(s.size()), s.c_str(),\n readableTime(secPerIter, 2).c_str(),\n metricReadable(itersPerSec, 2).c_str());\n } else {\n \/\/ Print with baseline\n auto rel = baselineNsPerIter \/ nsPerIter * 100.0;\n printf(\"%*s %7.2f%% %9s %7s\\n\",\n static_cast<int>(s.size()), s.c_str(),\n rel,\n readableTime(secPerIter, 2).c_str(),\n metricReadable(itersPerSec, 2).c_str());\n }\n }\n separator('=');\n}\n\nstatic void printBenchmarkResultsAsJson(\n const vector<tuple<const char*, const char*, double> >& data) {\n dynamic d = dynamic::object;\n for (auto& datum: data) {\n d[std::get<1>(datum)] = std::get<2>(datum) * 1000.;\n }\n\n printf(\"%s\\n\", toPrettyJson(d).c_str());\n}\n\nstatic void printBenchmarkResults(\n const vector<tuple<const char*, const char*, double> >& data) {\n\n if (FLAGS_json) {\n printBenchmarkResultsAsJson(data);\n } else {\n printBenchmarkResultsAsTable(data);\n }\n}\n\nvoid runBenchmarks() {\n CHECK(!benchmarks.empty());\n\n vector<tuple<const char*, const char*, double>> results;\n results.reserve(benchmarks.size() - 1);\n\n std::unique_ptr<boost::regex> bmRegex;\n if (!FLAGS_bm_regex.empty()) {\n bmRegex.reset(new boost::regex(FLAGS_bm_regex));\n }\n\n \/\/ PLEASE KEEP QUIET. MEASUREMENTS IN PROGRESS.\n\n auto const globalBaseline = runBenchmarkGetNSPerIteration(\n get<2>(benchmarks.front()), 0);\n FOR_EACH_RANGE (i, 1, benchmarks.size()) {\n double elapsed = 0.0;\n if (!strcmp(get<1>(benchmarks[i]), \"-\") == 0) { \/\/ skip separators\n if (bmRegex && !boost::regex_search(get<1>(benchmarks[i]), *bmRegex)) {\n continue;\n }\n elapsed = runBenchmarkGetNSPerIteration(get<2>(benchmarks[i]),\n globalBaseline);\n }\n results.emplace_back(get<0>(benchmarks[i]),\n get<1>(benchmarks[i]), elapsed);\n }\n\n \/\/ PLEASE MAKE NOISE. MEASUREMENTS DONE.\n\n printBenchmarkResults(results);\n}\n\n} \/\/ namespace folly\n<commit_msg>revert folly\/Benchmark.cpp<commit_after>\/*\n * Copyright 2013 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/\/ @author Andrei Alexandrescu (andrei.alexandrescu@fb.com)\n\n#include \"Benchmark.h\"\n#include \"Foreach.h\"\n#include \"json.h\"\n#include \"String.h\"\n\n#include <algorithm>\n#include <boost\/regex.hpp>\n#include <cmath>\n#include <iostream>\n#include <limits>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n\nDEFINE_bool(benchmark, false, \"Run benchmarks.\");\nDEFINE_bool(json, false, \"Output in JSON format.\");\n\nDEFINE_string(bm_regex, \"\",\n \"Only benchmarks whose names match this regex will be run.\");\n\nDEFINE_int64(bm_min_usec, 100,\n \"Minimum # of microseconds we'll accept for each benchmark.\");\n\nDEFINE_int64(bm_min_iters, 1,\n \"Minimum # of iterations we'll try for each benchmark.\");\n\nDEFINE_int32(bm_max_secs, 1,\n \"Maximum # of seconds we'll spend on each benchmark.\");\n\n\nnamespace folly {\n\nBenchmarkSuspender::NanosecondsSpent BenchmarkSuspender::nsSpent;\n\ntypedef function<uint64_t(unsigned int)> BenchmarkFun;\nstatic vector<tuple<const char*, const char*, BenchmarkFun>> benchmarks;\n\n\/\/ Add the global baseline\nBENCHMARK(globalBenchmarkBaseline) {\n asm volatile(\"\");\n}\n\nvoid detail::addBenchmarkImpl(const char* file, const char* name,\n BenchmarkFun fun) {\n benchmarks.emplace_back(file, name, std::move(fun));\n}\n\n\/**\n * Given a point, gives density at that point as a number 0.0 < x <=\n * 1.0. The result is 1.0 if all samples are equal to where, and\n * decreases near 0 if all points are far away from it. The density is\n * computed with the help of a radial basis function.\n *\/\nstatic double density(const double * begin, const double *const end,\n const double where, const double bandwidth) {\n assert(begin < end);\n assert(bandwidth > 0.0);\n double sum = 0.0;\n FOR_EACH_RANGE (i, begin, end) {\n auto d = (*i - where) \/ bandwidth;\n sum += exp(- d * d);\n }\n return sum \/ (end - begin);\n}\n\n\/**\n * Computes mean and variance for a bunch of data points. Note that\n * mean is currently not being used.\n *\/\nstatic pair<double, double>\nmeanVariance(const double * begin, const double *const end) {\n assert(begin < end);\n double sum = 0.0, sum2 = 0.0;\n FOR_EACH_RANGE (i, begin, end) {\n sum += *i;\n sum2 += *i * *i;\n }\n auto const n = end - begin;\n return make_pair(sum \/ n, sqrt((sum2 - sum * sum \/ n) \/ n));\n}\n\n\/**\n * Computes the mode of a sample set through brute force. Assumes\n * input is sorted.\n *\/\nstatic double mode(const double * begin, const double *const end) {\n assert(begin < end);\n \/\/ Lower bound and upper bound for result and their respective\n \/\/ densities.\n auto\n result = 0.0,\n bestDensity = 0.0;\n\n \/\/ Get the variance so we pass it down to density()\n auto const sigma = meanVariance(begin, end).second;\n if (!sigma) {\n \/\/ No variance means constant signal\n return *begin;\n }\n\n FOR_EACH_RANGE (i, begin, end) {\n assert(i == begin || *i >= i[-1]);\n auto candidate = density(begin, end, *i, sigma * sqrt(2.0));\n if (candidate > bestDensity) {\n \/\/ Found a new best\n bestDensity = candidate;\n result = *i;\n } else {\n \/\/ Density is decreasing... we could break here if we definitely\n \/\/ knew this is unimodal.\n }\n }\n\n return result;\n}\n\n\/**\n * Given a bunch of benchmark samples, estimate the actual run time.\n *\/\nstatic double estimateTime(double * begin, double * end) {\n assert(begin < end);\n\n \/\/ Current state of the art: get the minimum. After some\n \/\/ experimentation, it seems taking the minimum is the best.\n\n return *min_element(begin, end);\n\n \/\/ What follows after estimates the time as the mode of the\n \/\/ distribution.\n\n \/\/ Select the awesomest (i.e. most frequent) result. We do this by\n \/\/ sorting and then computing the longest run length.\n sort(begin, end);\n\n \/\/ Eliminate outliers. A time much larger than the minimum time is\n \/\/ considered an outlier.\n while (end[-1] > 2.0 * *begin) {\n --end;\n if (begin == end) {\n LOG(INFO) << *begin;\n }\n assert(begin < end);\n }\n\n double result = 0;\n\n \/* Code used just for comparison purposes *\/ {\n unsigned bestFrequency = 0;\n unsigned candidateFrequency = 1;\n double candidateValue = *begin;\n for (auto current = begin + 1; ; ++current) {\n if (current == end || *current != candidateValue) {\n \/\/ Done with the current run, see if it was best\n if (candidateFrequency > bestFrequency) {\n bestFrequency = candidateFrequency;\n result = candidateValue;\n }\n if (current == end) {\n break;\n }\n \/\/ Start a new run\n candidateValue = *current;\n candidateFrequency = 1;\n } else {\n \/\/ Cool, inside a run, increase the frequency\n ++candidateFrequency;\n }\n }\n }\n\n result = mode(begin, end);\n\n return result;\n}\n\nstatic double runBenchmarkGetNSPerIteration(const BenchmarkFun& fun,\n const double globalBaseline) {\n \/\/ They key here is accuracy; too low numbers means the accuracy was\n \/\/ coarse. We up the ante until we get to at least minNanoseconds\n \/\/ timings.\n static uint64_t resolutionInNs = 0, coarseResolutionInNs = 0;\n if (!resolutionInNs) {\n timespec ts;\n CHECK_EQ(0, clock_getres(detail::DEFAULT_CLOCK_ID, &ts));\n CHECK_EQ(0, ts.tv_sec) << \"Clock sucks.\";\n CHECK_LT(0, ts.tv_nsec) << \"Clock too fast for its own good.\";\n CHECK_EQ(1, ts.tv_nsec) << \"Clock too coarse, upgrade your kernel.\";\n resolutionInNs = ts.tv_nsec;\n }\n \/\/ We choose a minimum minimum (sic) of 100,000 nanoseconds, but if\n \/\/ the clock resolution is worse than that, it will be larger. In\n \/\/ essence we're aiming at making the quantization noise 0.01%.\n static const auto minNanoseconds =\n max(FLAGS_bm_min_usec * 1000UL, min(resolutionInNs * 100000, 1000000000UL));\n\n \/\/ We do measurements in several epochs and take the minimum, to\n \/\/ account for jitter.\n static const unsigned int epochs = 1000;\n \/\/ We establish a total time budget as we don't want a measurement\n \/\/ to take too long. This will curtail the number of actual epochs.\n const uint64_t timeBudgetInNs = FLAGS_bm_max_secs * 1000000000;\n timespec global;\n CHECK_EQ(0, clock_gettime(CLOCK_REALTIME, &global));\n\n double epochResults[epochs] = { 0 };\n size_t actualEpochs = 0;\n\n for (; actualEpochs < epochs; ++actualEpochs) {\n for (unsigned int n = FLAGS_bm_min_iters; n < (1UL << 30); n *= 2) {\n auto const nsecs = fun(n);\n if (nsecs < minNanoseconds) {\n continue;\n }\n \/\/ We got an accurate enough timing, done. But only save if\n \/\/ smaller than the current result.\n epochResults[actualEpochs] = max(0.0, double(nsecs) \/ n - globalBaseline);\n \/\/ Done with the current epoch, we got a meaningful timing.\n break;\n }\n timespec now;\n CHECK_EQ(0, clock_gettime(CLOCK_REALTIME, &now));\n if (detail::timespecDiff(now, global) >= timeBudgetInNs) {\n \/\/ No more time budget available.\n ++actualEpochs;\n break;\n }\n }\n\n \/\/ If the benchmark was basically drowned in baseline noise, it's\n \/\/ possible it became negative.\n return max(0.0, estimateTime(epochResults, epochResults + actualEpochs));\n}\n\nstruct ScaleInfo {\n double boundary;\n const char* suffix;\n};\n\nstatic const ScaleInfo kTimeSuffixes[] {\n { 365.25 * 24 * 3600, \"years\" },\n { 24 * 3600, \"days\" },\n { 3600, \"hr\" },\n { 60, \"min\" },\n { 1, \"s\" },\n { 1E-3, \"ms\" },\n { 1E-6, \"us\" },\n { 1E-9, \"ns\" },\n { 1E-12, \"ps\" },\n { 1E-15, \"fs\" },\n { 0, NULL },\n};\n\nstatic const ScaleInfo kMetricSuffixes[] {\n { 1E24, \"Y\" }, \/\/ yotta\n { 1E21, \"Z\" }, \/\/ zetta\n { 1E18, \"X\" }, \/\/ \"exa\" written with suffix 'X' so as to not create\n \/\/ confusion with scientific notation\n { 1E15, \"P\" }, \/\/ peta\n { 1E12, \"T\" }, \/\/ terra\n { 1E9, \"G\" }, \/\/ giga\n { 1E6, \"M\" }, \/\/ mega\n { 1E3, \"K\" }, \/\/ kilo\n { 1, \"\" },\n { 1E-3, \"m\" }, \/\/ milli\n { 1E-6, \"u\" }, \/\/ micro\n { 1E-9, \"n\" }, \/\/ nano\n { 1E-12, \"p\" }, \/\/ pico\n { 1E-15, \"f\" }, \/\/ femto\n { 1E-18, \"a\" }, \/\/ atto\n { 1E-21, \"z\" }, \/\/ zepto\n { 1E-24, \"y\" }, \/\/ yocto\n { 0, NULL },\n};\n\nstatic string humanReadable(double n, unsigned int decimals,\n const ScaleInfo* scales) {\n if (std::isinf(n) || std::isnan(n)) {\n return folly::to<string>(n);\n }\n\n const double absValue = fabs(n);\n const ScaleInfo* scale = scales;\n while (absValue < scale[0].boundary && scale[1].suffix != NULL) {\n ++scale;\n }\n\n const double scaledValue = n \/ scale->boundary;\n return stringPrintf(\"%.*f%s\", decimals, scaledValue, scale->suffix);\n}\n\nstatic string readableTime(double n, unsigned int decimals) {\n return humanReadable(n, decimals, kTimeSuffixes);\n}\n\nstatic string metricReadable(double n, unsigned int decimals) {\n return humanReadable(n, decimals, kMetricSuffixes);\n}\n\nstatic void printBenchmarkResultsAsTable(\n const vector<tuple<const char*, const char*, double> >& data) {\n \/\/ Width available\n static const uint columns = 76;\n\n \/\/ Compute the longest benchmark name\n size_t longestName = 0;\n FOR_EACH_RANGE (i, 1, benchmarks.size()) {\n longestName = max(longestName, strlen(get<1>(benchmarks[i])));\n }\n\n \/\/ Print a horizontal rule\n auto separator = [&](char pad) {\n puts(string(columns, pad).c_str());\n };\n\n \/\/ Print header for a file\n auto header = [&](const char* file) {\n separator('=');\n printf(\"%-*srelative time\/iter iters\/s\\n\",\n columns - 28, file);\n separator('=');\n };\n\n double baselineNsPerIter = numeric_limits<double>::max();\n const char* lastFile = \"\";\n\n for (auto& datum : data) {\n auto file = get<0>(datum);\n if (strcmp(file, lastFile)) {\n \/\/ New file starting\n header(file);\n lastFile = file;\n }\n\n string s = get<1>(datum);\n if (s == \"-\") {\n separator('-');\n continue;\n }\n bool useBaseline \/* = void *\/;\n if (s[0] == '%') {\n s.erase(0, 1);\n useBaseline = true;\n } else {\n baselineNsPerIter = get<2>(datum);\n useBaseline = false;\n }\n s.resize(columns - 29, ' ');\n auto nsPerIter = get<2>(datum);\n auto secPerIter = nsPerIter \/ 1E9;\n auto itersPerSec = 1 \/ secPerIter;\n if (!useBaseline) {\n \/\/ Print without baseline\n printf(\"%*s %9s %7s\\n\",\n static_cast<int>(s.size()), s.c_str(),\n readableTime(secPerIter, 2).c_str(),\n metricReadable(itersPerSec, 2).c_str());\n } else {\n \/\/ Print with baseline\n auto rel = baselineNsPerIter \/ nsPerIter * 100.0;\n printf(\"%*s %7.2f%% %9s %7s\\n\",\n static_cast<int>(s.size()), s.c_str(),\n rel,\n readableTime(secPerIter, 2).c_str(),\n metricReadable(itersPerSec, 2).c_str());\n }\n }\n separator('=');\n}\n\nstatic void printBenchmarkResultsAsJson(\n const vector<tuple<const char*, const char*, double> >& data) {\n dynamic d = dynamic::object;\n for (auto& datum: data) {\n d[std::get<1>(datum)] = std::get<2>(datum) * 1000.;\n }\n\n printf(\"%s\\n\", toPrettyJson(d).c_str());\n}\n\nstatic void printBenchmarkResults(\n const vector<tuple<const char*, const char*, double> >& data) {\n\n if (FLAGS_json) {\n printBenchmarkResultsAsJson(data);\n } else {\n printBenchmarkResultsAsTable(data);\n }\n}\n\nvoid runBenchmarks() {\n CHECK(!benchmarks.empty());\n\n vector<tuple<const char*, const char*, double>> results;\n results.reserve(benchmarks.size() - 1);\n\n std::unique_ptr<boost::regex> bmRegex;\n if (!FLAGS_bm_regex.empty()) {\n bmRegex.reset(new boost::regex(FLAGS_bm_regex));\n }\n\n \/\/ PLEASE KEEP QUIET. MEASUREMENTS IN PROGRESS.\n\n auto const globalBaseline = runBenchmarkGetNSPerIteration(\n get<2>(benchmarks.front()), 0);\n FOR_EACH_RANGE (i, 1, benchmarks.size()) {\n double elapsed = 0.0;\n if (!strcmp(get<1>(benchmarks[i]), \"-\") == 0) { \/\/ skip separators\n if (bmRegex && !boost::regex_search(get<1>(benchmarks[i]), *bmRegex)) {\n continue;\n }\n elapsed = runBenchmarkGetNSPerIteration(get<2>(benchmarks[i]),\n globalBaseline);\n }\n results.emplace_back(get<0>(benchmarks[i]),\n get<1>(benchmarks[i]), elapsed);\n }\n\n \/\/ PLEASE MAKE NOISE. MEASUREMENTS DONE.\n\n printBenchmarkResults(results);\n}\n\n} \/\/ namespace folly\n<|endoftext|>"} {"text":"<commit_before>#include <sstream>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <math.h>\n\n#include \"entity.h\"\n#include \"board.h\"\n\nusing namespace std;\n\nEntity::Entity(std::string name, ABoard& board, Player& owner, r2 position, r2 size, double speed, int sight_radius, bool solid, int capacity) :\n\tposition(position),\n\tspeed(speed),\n\tdeletable(false),\n\torientation(0),\n\tsize(size),\n\tname(name),\n\towner(owner),\n\tboard(board),\n\tsight_radius(sight_radius),\n\tsolid(solid),\n\tcapacity(capacity)\n{\n\tstatic size_t idCount = 0;\n\tid = idCount++;\n\tadjustPosition();\n\tstringstream message;\n\tmessage << \"Created Entity \" << this\n\t\t<< \" with ID \" << id\n\t\t<< \" of kind \" << name\n\t\t<< \" owned by board \" << &board\n\t\t<< \" at \" << position.x << \",\" << position.y;\n\tLogger::getInstance()->writeInformation(message.str());\n}\n\nEntity::~Entity() {\n\tstringstream message;\n\tmessage << \"Killing Entity \" << this << \" of kind \" << name;\n\tLogger::getInstance()->writeInformation(message.str());\n}\n\nbool Entity::adjustPosition() {\n\tdouble topX = board.sizeX - size.x;\n\tdouble topY = board.sizeY - size.y;\n\tr2 oldpos = position;\n\tposition = {clip(position.x, 0, topX),clip(position.y, 0, topY)};\n\tbool adjusted = oldpos != position;\n\tif (adjusted) {\n\t\tsetFrame();\n\t}\n\treturn adjusted;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ HIC SVNT DRACONES\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <queue>\n#include <set>\n\nstruct TSNode {\n\tr2 position;\n\tdouble g, f;\n\tshared_ptr<TSNode> previous;\n\tTSNode(r2 position, double g, double f, shared_ptr<TSNode> previous) :\n\t\tposition(position), g(g), f(f), previous(previous) {};\n};\n\nclass compare {\n\tpublic:\n\t\tbool operator()(const shared_ptr<TSNode> a, const shared_ptr<TSNode> b) {\n\t\t\treturn a->f > b->f;\n\t\t}\n};\n\nvoid Entity::addTarget(r2 newTarget) {\n\tauto round = [](r2 a) {return r2(floor(a.x)+.5, floor(a.y)+.5);};\n\tr2\n\t\tend = targeted() ? waypoints.back() : position,\n\t\tstart = round(newTarget);\n\n\tpriority_queue<TSNode, vector<shared_ptr<TSNode>>, compare> open;\n\tauto h = [&end](r2& p) {return (p - end).length();};\n\tauto f = [&h](TSNode n) {return h(n.position) + n.g;};\n\tbool closed[board.sizeX][board.sizeY];\n\tfor(size_t i = 0; i < board.sizeX; i++) {\n\t\tfor(size_t j = 0; j < board.sizeY; j++) {\n\t\t\tclosed[i][j] = false;\n\t\t}\n\t}\n\n\topen.emplace(make_shared<TSNode>(start, 0, h(start), nullptr));\n\twhile (open.size() > 0) {\n\t\tauto c = open.top();\n\t\topen.pop();\n\t\tauto cpos = c->position;\n\t\tif(closed[(int)floor(cpos.x)][(int)floor(cpos.y)]) {\n\t\t\tcontinue;\n\t\t}\n\t\tclosed[(int)floor(cpos.x)][(int)floor(cpos.y)] = true;\n\t\tif ((int)cpos.x == (int)end.x && (int)cpos.y == (int)end.y) {\n\t\t\tfor (auto p = c; p; p = p->previous) {\n\t\t\t\tauto pos = p->position;\n\t\t\t\twaypoints.push_back(p->position);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tfor(auto y = cpos.y - 1; y <= cpos.y + 1; y++) {\n\t\t\tfor(auto x = cpos.x - 1; x <= cpos.x + 1; x++) {\n\t\t\t\tauto p = round(r2(x, y));\n\t\t\t\tif ((p == cpos) ||\n\t\t\t\t\t\t!(canEnter(p) &&\n\t\t\t\t\t\t\tcanEnter(rectangle::box(p - size\/2, cpos - size\/2, size)))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tauto n = make_shared<TSNode>(p, (cpos - p).length() + c->g, .0, c);\n\t\t\t\tn->f = f(*n);\n\t\t\t\tif (closed[(int)floor(p.x)][(int)floor(p.y)]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\twhile(n->previous?\n\t\t\t\t\t\tn->previous->previous?\n\t\t\t\t\t\tcanEnter(rectangle::box(p, n->previous->previous->position, size))\n\t\t\t\t\t\t:false\n\t\t\t\t\t\t:false) {\n\t\t\t\t\tn->previous = n->previous->previous;\n\t\t\t\t}\n\t\t\t\topen.emplace(n);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Entity::unsetTarget() {\n\twaypoints.clear();\n}\n\nr2 Entity::target() {\n\treturn waypoints.size() > 0?\n\t\twaypoints.front():\n\t\tr2(0, 0);\n}\n\nbool Entity::targeted() {\n\treturn waypoints.size() > 0;\n}\n\nvoid Entity::collide(Entity* other) {\n\tif(other) {\n\t\tif(!deletable &&\n\t\t\t\t!other->deletable) {\n\t\t\tother->collide(*this);\n\t\t}\n\t}\n}\n\nvoid Entity::collide(Entity& other) {}\n\nvoid Entity::collide(ResourceEntity& other) {}\n\nbool Entity::canEnter(rectangle r) {\n\tauto& p = r.position;\n\tauto& s = r.size;\n\tfor (int dx = 0; dx < s.x + 1; dx++) {\n\t\tfor (int dy = 0; dy < s.y + 1; dy++) {\n\t\t\tauto t = board.getTerrain(floor(p.x + dx), floor(p.y + dy));\n\t\t\tif (t) {\n\t\t\t\tif(t->solid) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tauto colliders = board.selectEntities([this, r](shared_ptr<Entity> e) {\n\t\t\treturn (*e != *this) &&\n\t\t\te->solid &&\n\t\t\t!e->deletable &&\n\t\t\t(rectangle(e->position, e->size).intersects(r));\n\t\t\t});\n\treturn colliders.size() == 0;\n}\n\nbool Entity::canEnter(r2 newPosition) {\n\tauto newCenter = newPosition + size \/ 2;\n\tif (newCenter.x < 0 ||\n\t\t\tnewCenter.y < 0 ||\n\t\t\tnewCenter.x >= board.sizeX ||\n\t\t\tnewCenter.y >= board.sizeY) {\n\t\treturn false;\n\t}\n\treturn canEnter(rectangle(newPosition, size));\n}\n\nvoid Entity::update() {\n\tif (targeted()) {\n\t\tauto traj = trajectory();\n\t\torientation = atan2(traj.y, traj.x);\n\t\tauto dr = speed*board.dt\/1000;\n\t\tif (pow(dr, 2) < sqDistance()) {\n\t\t\tauto newPos = position + r2::fromPolar(orientation, dr);\n\t\t\trectangle shapeCandidate(newPos, size);\n\t\t\tauto colliders = board.selectEntities([this, shapeCandidate](shared_ptr<Entity> e) {\n\t\t\t\t\treturn (*e != *this) &&\n\t\t\t\t\t(rectangle(e->position, e->size).intersects(shapeCandidate));\n\t\t\t\t\t});\n\t\t\tfor(auto c : colliders) {\n\t\t\t\tcollide(c.get());\n\t\t\t}\n\t\t\tif (!canEnter(newPos)) {\n\t\t\t\tunsetTarget();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tposition = newPos;\n\t\t} else {\n\t\t\tposition = target() - size\/2;\n\t\t\twaypoints.pop_front();\n\t\t}\n\t\tif (adjustPosition()) {\n\t\t\tunsetTarget();\n\t\t}\n\t\tsetFrame();\n\t}\n}\n\nr2 Entity::center() {\n\treturn position + (size\/2);\n}\n\nr2 Entity::getPosition() {\n\treturn position;\n}\n\nr2 Entity::trajectory() {\n\treturn target() - center();\n}\n\ndouble Entity::sqDistance() {\n\treturn trajectory().sqLength();\n}\n\ndouble Entity::distance() {\n\treturn trajectory().length();\n}\n\nDirections Entity::getDirection(){\n\treturn static_cast<Directions>((unsigned)floor(4*orientation\/M_PI+.5)%8);\n}\n\nvoid Entity::setDeletable() {\n\tdeletable = true;\n\tsetFrame();\n}\n\nbool Entity::getDeletable() {\n\treturn deletable;\n}\n\nsize_t Entity::getId() {\n\treturn id;\n}\n\nvoid Entity::setFrame() {\n\tframe = board.getFrame();\n}\n\nsize_t Entity::getFrame() {\n\treturn frame;\n}\n\nbool Entity::operator==(Entity& other) {\n\treturn this == &other;\n}\n\nbool Entity::operator!=(Entity& other) {\n\treturn !operator==(other);\n}\n\nstring Entity::serialize() {\n\tstringstream ret;\n\tret << \"E\\t\" << id << '\\t' << name << '\\t'\n\t\t<< frame << '\\t'\n\t\t<< owner.getId() << '\\t'\n\t\t<< position.x << '\\t' << position.y << '\\t'\n\t\t<< orientation << endl;\n\treturn ret.str();\n}\n\nResourceEntity::ResourceEntity(std::string name, ABoard& board, Player& owner, r2 position, r2 size, double speed, int sight_radius, bool solid, int capacity):Entity(name, board, owner, position, size, speed, sight_radius, solid, capacity)\n{}\n\nvoid ResourceEntity::collide(Entity& other) {\n\tif(!getDeletable() &&\n\t\t\t!other.getDeletable()) {\n\t\tstringstream message;\n\t\tmessage << \"Un \" << other.name << \" de \" << other.owner.name << \" encontró\" << name;\n\t\tif(other.owner.grantResources(name, capacity)) {\n\t\t\tsetDeletable();\n\t\t\tmessage << \"; ahora \" << other.owner.name\n\t\t\t\t<< \" tiene \" << other.owner.getResources()[name]\n\t\t\t\t<< \" \" << name;\n\t\t} else {\n\t\t\tmessage << \"; pero no puede tomarlos\";\n\t\t}\n\t\tLogger::getInstance()->writeInformation(message.str());\n\t}\n}\n\nvoid ResourceEntity::collide(ResourceEntity& other) {}\n\n<commit_msg>Redondeo<commit_after>#include <sstream>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <math.h>\n\n#include \"entity.h\"\n#include \"board.h\"\n\nusing namespace std;\n\nEntity::Entity(std::string name, ABoard& board, Player& owner, r2 position, r2 size, double speed, int sight_radius, bool solid, int capacity) :\n\tposition(position),\n\tspeed(speed),\n\tdeletable(false),\n\torientation(0),\n\tsize(size),\n\tname(name),\n\towner(owner),\n\tboard(board),\n\tsight_radius(sight_radius),\n\tsolid(solid),\n\tcapacity(capacity)\n{\n\tstatic size_t idCount = 0;\n\tid = idCount++;\n\tadjustPosition();\n\tstringstream message;\n\tmessage << \"Created Entity \" << this\n\t\t<< \" with ID \" << id\n\t\t<< \" of kind \" << name\n\t\t<< \" owned by board \" << &board\n\t\t<< \" at \" << position.x << \",\" << position.y;\n\tLogger::getInstance()->writeInformation(message.str());\n}\n\nEntity::~Entity() {\n\tstringstream message;\n\tmessage << \"Killing Entity \" << this << \" of kind \" << name;\n\tLogger::getInstance()->writeInformation(message.str());\n}\n\nbool Entity::adjustPosition() {\n\tdouble topX = board.sizeX - size.x;\n\tdouble topY = board.sizeY - size.y;\n\tr2 oldpos = position;\n\tposition = {clip(position.x, 0, topX),clip(position.y, 0, topY)};\n\tbool adjusted = oldpos != position;\n\tif (adjusted) {\n\t\tsetFrame();\n\t}\n\treturn adjusted;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ HIC SVNT DRACONES\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <queue>\n#include <set>\n\nstruct TSNode {\n\tr2 position;\n\tdouble g, f;\n\tshared_ptr<TSNode> previous;\n\tTSNode(r2 position, double g, double f, shared_ptr<TSNode> previous) :\n\t\tposition(position), g(g), f(f), previous(previous) {};\n};\n\nclass compare {\n\tpublic:\n\t\tbool operator()(const shared_ptr<TSNode> a, const shared_ptr<TSNode> b) {\n\t\t\treturn a->f > b->f;\n\t\t}\n};\n\nvoid Entity::addTarget(r2 newTarget) {\n\tauto round = [](r2 a) {return r2(floor(a.x)+.5, floor(a.y)+.5);};\n\tr2\n\t\tend = round(targeted() ? waypoints.back() : position),\n\t\tstart = round(newTarget);\n\n\tpriority_queue<TSNode, vector<shared_ptr<TSNode>>, compare> open;\n\tauto h = [&end](r2& p) {return (p - end).length();};\n\tauto f = [&h](TSNode n) {return h(n.position) + n.g;};\n\tbool closed[board.sizeX][board.sizeY];\n\tfor(size_t i = 0; i < board.sizeX; i++) {\n\t\tfor(size_t j = 0; j < board.sizeY; j++) {\n\t\t\tclosed[i][j] = false;\n\t\t}\n\t}\n\n\topen.emplace(make_shared<TSNode>(start, 0, h(start), nullptr));\n\twhile (open.size() > 0) {\n\t\tauto c = open.top();\n\t\topen.pop();\n\t\tauto cpos = c->position;\n\t\tif(closed[(int)floor(cpos.x)][(int)floor(cpos.y)]) {\n\t\t\tcontinue;\n\t\t}\n\t\tclosed[(int)floor(cpos.x)][(int)floor(cpos.y)] = true;\n\t\tif ((int)cpos.x == (int)end.x && (int)cpos.y == (int)end.y) {\n\t\t\tfor (auto p = c; p; p = p->previous) {\n\t\t\t\tauto pos = p->position;\n\t\t\t\twaypoints.push_back(p->position);\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tfor(auto y = cpos.y - 1; y <= cpos.y + 1; y++) {\n\t\t\tfor(auto x = cpos.x - 1; x <= cpos.x + 1; x++) {\n\t\t\t\tauto p = r2(x, y);\n\t\t\t\tif ((p == cpos) ||\n\t\t\t\t\t\t!(canEnter(p) &&\n\t\t\t\t\t\t\tcanEnter(rectangle::box(p - size\/2, cpos - size\/2, size)))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tauto n = make_shared<TSNode>(p, (cpos - p).length() + c->g, .0, c);\n\t\t\t\tn->f = f(*n);\n\t\t\t\tif (closed[(int)floor(p.x)][(int)floor(p.y)]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\twhile(n->previous?\n\t\t\t\t\t\tn->previous->previous?\n\t\t\t\t\t\tcanEnter(rectangle::box(p, n->previous->previous->position, size))\n\t\t\t\t\t\t:false\n\t\t\t\t\t\t:false) {\n\t\t\t\t\tn->previous = n->previous->previous;\n\t\t\t\t}\n\t\t\t\topen.emplace(n);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Entity::unsetTarget() {\n\twaypoints.clear();\n}\n\nr2 Entity::target() {\n\treturn waypoints.size() > 0?\n\t\twaypoints.front():\n\t\tr2(0, 0);\n}\n\nbool Entity::targeted() {\n\treturn waypoints.size() > 0;\n}\n\nvoid Entity::collide(Entity* other) {\n\tif(other) {\n\t\tif(!deletable &&\n\t\t\t\t!other->deletable) {\n\t\t\tother->collide(*this);\n\t\t}\n\t}\n}\n\nvoid Entity::collide(Entity& other) {}\n\nvoid Entity::collide(ResourceEntity& other) {}\n\nbool Entity::canEnter(rectangle r) {\n\tauto& p = r.position;\n\tauto& s = r.size;\n\tfor (int dx = 0; dx < s.x + 1; dx++) {\n\t\tfor (int dy = 0; dy < s.y + 1; dy++) {\n\t\t\tauto t = board.getTerrain(floor(p.x + dx), floor(p.y + dy));\n\t\t\tif (t) {\n\t\t\t\tif(t->solid) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tauto colliders = board.selectEntities([this, r](shared_ptr<Entity> e) {\n\t\t\treturn (*e != *this) &&\n\t\t\te->solid &&\n\t\t\t!e->deletable &&\n\t\t\t(rectangle(e->position, e->size).intersects(r));\n\t\t\t});\n\treturn colliders.size() == 0;\n}\n\nbool Entity::canEnter(r2 newPosition) {\n\tauto newCenter = newPosition + size \/ 2;\n\tif (newCenter.x < 0 ||\n\t\t\tnewCenter.y < 0 ||\n\t\t\tnewCenter.x >= board.sizeX ||\n\t\t\tnewCenter.y >= board.sizeY) {\n\t\treturn false;\n\t}\n\treturn canEnter(rectangle(newPosition, size));\n}\n\nvoid Entity::update() {\n\tif (targeted()) {\n\t\tauto traj = trajectory();\n\t\torientation = atan2(traj.y, traj.x);\n\t\tauto dr = speed*board.dt\/1000;\n\t\tif (pow(dr, 2) < sqDistance()) {\n\t\t\tauto newPos = position + r2::fromPolar(orientation, dr);\n\t\t\trectangle shapeCandidate(newPos, size);\n\t\t\tauto colliders = board.selectEntities([this, shapeCandidate](shared_ptr<Entity> e) {\n\t\t\t\t\treturn (*e != *this) &&\n\t\t\t\t\t(rectangle(e->position, e->size).intersects(shapeCandidate));\n\t\t\t\t\t});\n\t\t\tfor(auto c : colliders) {\n\t\t\t\tcollide(c.get());\n\t\t\t}\n\t\t\tif (!canEnter(newPos)) {\n\t\t\t\tunsetTarget();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tposition = newPos;\n\t\t} else {\n\t\t\tposition = target() - size\/2;\n\t\t\twaypoints.pop_front();\n\t\t}\n\t\tif (adjustPosition()) {\n\t\t\tunsetTarget();\n\t\t}\n\t\tsetFrame();\n\t}\n}\n\nr2 Entity::center() {\n\treturn position + (size\/2);\n}\n\nr2 Entity::getPosition() {\n\treturn position;\n}\n\nr2 Entity::trajectory() {\n\treturn target() - center();\n}\n\ndouble Entity::sqDistance() {\n\treturn trajectory().sqLength();\n}\n\ndouble Entity::distance() {\n\treturn trajectory().length();\n}\n\nDirections Entity::getDirection(){\n\treturn static_cast<Directions>((unsigned)floor(4*orientation\/M_PI+.5)%8);\n}\n\nvoid Entity::setDeletable() {\n\tdeletable = true;\n\tsetFrame();\n}\n\nbool Entity::getDeletable() {\n\treturn deletable;\n}\n\nsize_t Entity::getId() {\n\treturn id;\n}\n\nvoid Entity::setFrame() {\n\tframe = board.getFrame();\n}\n\nsize_t Entity::getFrame() {\n\treturn frame;\n}\n\nbool Entity::operator==(Entity& other) {\n\treturn this == &other;\n}\n\nbool Entity::operator!=(Entity& other) {\n\treturn !operator==(other);\n}\n\nstring Entity::serialize() {\n\tstringstream ret;\n\tret << \"E\\t\" << id << '\\t' << name << '\\t'\n\t\t<< frame << '\\t'\n\t\t<< owner.getId() << '\\t'\n\t\t<< position.x << '\\t' << position.y << '\\t'\n\t\t<< orientation << endl;\n\treturn ret.str();\n}\n\nResourceEntity::ResourceEntity(std::string name, ABoard& board, Player& owner, r2 position, r2 size, double speed, int sight_radius, bool solid, int capacity):Entity(name, board, owner, position, size, speed, sight_radius, solid, capacity)\n{}\n\nvoid ResourceEntity::collide(Entity& other) {\n\tif(!getDeletable() &&\n\t\t\t!other.getDeletable()) {\n\t\tstringstream message;\n\t\tmessage << \"Un \" << other.name << \" de \" << other.owner.name << \" encontró\" << name;\n\t\tif(other.owner.grantResources(name, capacity)) {\n\t\t\tsetDeletable();\n\t\t\tmessage << \"; ahora \" << other.owner.name\n\t\t\t\t<< \" tiene \" << other.owner.getResources()[name]\n\t\t\t\t<< \" \" << name;\n\t\t} else {\n\t\t\tmessage << \"; pero no puede tomarlos\";\n\t\t}\n\t\tLogger::getInstance()->writeInformation(message.str());\n\t}\n}\n\nvoid ResourceEntity::collide(ResourceEntity& other) {}\n\n<|endoftext|>"} {"text":"<commit_before>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2013, Numenta, Inc. Unless you have an agreement\n * with Numenta, Inc., for a separate license for this software code, the\n * following terms and conditions apply:\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License version 3 as\n * published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n * See the GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see http:\/\/www.gnu.org\/licenses.\n *\n * http:\/\/numenta.org\/licenses\/\n * ---------------------------------------------------------------------\n *\/\n\n\/** @file\n Random Number Generator interface\n*\/\n\n#include <nta\/types\/Types.hpp>\n#include <cstdlib>\n#include <string>\n#include <vector>\n\n#ifndef NTA_RANDOM_HPP\n#define NTA_RANDOM_HPP\n\ntypedef NTA_UInt64 (*RandomSeedFuncPtr)();\n\nnamespace nta {\n \/**\n * @b Responsibility\n * Provides standardized random number generation for the NuPIC Runtime Engine.\n * Seed can be logged in one run and then set in another.\n * @b Rationale\n * Makes it possible to reproduce tests that are driven by random number generation.\n *\n * @b Description\n * Functionality is similar to the standard random() function that is provided by C.\n *\n * Each Random object is a random number generator. There are three ways of\n * creating one:\n * 1) explicit seed\n * Random rng(seed);\n * 2) self-seeded\n * Random rng;\n * 3) named generator -- normally self-seeded, but seed may be\n * set explicitly through an environment variable\n * Random rng(\"level2TP\");\n * If NTA_RANDOM_DEBUG is set, this object will log its self-seed\n * The seed can be explicitly set through NTA_RANDOM_SEED_level2TP\n *\n * Good self-seeds are generated by an internal global random number generator.\n * This global rng is seeded from the current time, but its seed may be\n * overridden with NTA_RANDOM_SEED\n *\n * Automated tests that use random numbers should normally use named generators.\n * This allows them to get a different seed each time, but also allows reproducibility\n * in the case that a test failure is triggered by a particular seed.\n *\n * Random should not be used if cryptographic strength is required (e.g. for\n * generating a challenge in an authentication scheme).\n *\n * @todo Add ability to specify different rng algorithms.\n *\/\n class RandomImpl;\n\n class Random\n {\n public:\n \/**\n * Retrieve the seeder. If seeder not set, allocates the\n * singleton and and initializes the seeder.\n *\/\n static RandomSeedFuncPtr getSeeder();\n\n Random(UInt64 seed = 0);\n\n \/\/ support copy constructor and operator= -- these require non-default\n \/\/ implementations because of the impl_ pointer.\n \/\/ They do a deep copy of impl_ so that an RNG and its copy generate the\n \/\/ same set of numbers.\n Random(const Random&);\n Random& operator=(const Random&);\n ~Random();\n\n \/\/ return a value uniformly distributed between 0 and max-1\n UInt32 getUInt32(UInt32 max = MAX32);\n UInt64 getUInt64(UInt64 max = MAX64);\n \/\/ return a double uniformly distributed on 0...1.0\n Real64 getReal64();\n\n \/\/ populate choices with a random selection of num elements from population\n \/\/ templated functions must be defined in header\n template <typename T>\n void sample(T population[], UInt32 nPopulation,\n T sample[], UInt32 nSample)\n {\n if (nSample == 0)\n {\n return;\n }\n UInt32 nextChoice = 0;\n for (UInt32 i = 0; i < nPopulation; ++i)\n {\n if (getUInt32(nPopulation - i) < (nSample - nextChoice))\n {\n sample[nextChoice] = population[i];\n ++nextChoice;\n if (nextChoice == nSample)\n {\n break;\n }\n }\n }\n }\n\n \/\/ randomly shuffle the elements\n template <class RandomAccessIterator>\n void shuffle(RandomAccessIterator first, RandomAccessIterator last)\n {\n std::random_shuffle(first, last, *this);\n }\n\n \/\/ for STL compatibility\n UInt32 operator()(UInt32 n = MAX32) { return getUInt32(n); }\n\n \/\/ normally used for debugging only\n UInt64 getSeed() {return seed_;}\n\n \/\/ for STL\n typedef UInt32 argument_type;\n typedef UInt32 result_type;\n\n result_type max() { return MAX32; }\n result_type min() { return 0; }\n\n static const UInt32 MAX32;\n static const UInt64 MAX64;\n\n \/\/ called by the plugin framework so that plugins\n \/\/ get the \"global\" seeder\n static void initSeeder(const RandomSeedFuncPtr r);\n\n static void shutdown();\n\n protected:\n\n \/\/ each \"universe\" (application\/plugin\/python module) has its own instance,\n \/\/ but the instance should be NULL in all but one\n static Random *theInstanceP_;\n \/\/ seeder_ is a function called by the constructor to get new random seeds\n \/\/ If not set when we call Random constructor, then the singleton is allocated\n \/\/ and seeder_ is set to a function that uses our singleton\n \/\/ initFromPlatformServices can also be used to initialize the seeder_\n static RandomSeedFuncPtr seeder_;\n\n void reseed(UInt64 seed);\n\n RandomImpl *impl_;\n UInt64 seed_;\n\n friend class RandomTest;\n friend std::ostream& operator<<(std::ostream&, const Random&);\n friend std::istream& operator>>(std::istream&, Random&);\n friend NTA_UInt64 GetRandomSeed();\n\n };\n\n \/\/ serialization\/deserialization\n std::ostream& operator<<(std::ostream&, const Random&);\n std::istream& operator>>(std::istream&, Random&);\n\n \/\/ This function returns seeds from the Random singleton in our\n \/\/ \"universe\" (application, plugin, python module). If, when the\n \/\/ Random constructor is called, seeder_ is NULL, then seeder_ is\n \/\/ set to this function. The plugin framework can override this\n \/\/ behavior by explicitly setting the seeder to the RandomSeeder\n \/\/ function provided by the application.\n NTA_UInt64 GetRandomSeed();\n\n\n} \/\/ namespace nta\n\n\n\n#endif \/\/ NTA_RANDOM_HPP\n\n<commit_msg>Add missing include.<commit_after>\/* ---------------------------------------------------------------------\n * Numenta Platform for Intelligent Computing (NuPIC)\n * Copyright (C) 2013, Numenta, Inc. Unless you have an agreement\n * with Numenta, Inc., for a separate license for this software code, the\n * following terms and conditions apply:\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License version 3 as\n * published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n * See the GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see http:\/\/www.gnu.org\/licenses.\n *\n * http:\/\/numenta.org\/licenses\/\n * ---------------------------------------------------------------------\n *\/\n\n\/** @file\n Random Number Generator interface\n*\/\n\n#include <nta\/types\/Types.hpp>\n#include <algorithm>\n#include <cstdlib>\n#include <string>\n#include <vector>\n\n#ifndef NTA_RANDOM_HPP\n#define NTA_RANDOM_HPP\n\ntypedef NTA_UInt64 (*RandomSeedFuncPtr)();\n\nnamespace nta {\n \/**\n * @b Responsibility\n * Provides standardized random number generation for the NuPIC Runtime Engine.\n * Seed can be logged in one run and then set in another.\n * @b Rationale\n * Makes it possible to reproduce tests that are driven by random number generation.\n *\n * @b Description\n * Functionality is similar to the standard random() function that is provided by C.\n *\n * Each Random object is a random number generator. There are three ways of\n * creating one:\n * 1) explicit seed\n * Random rng(seed);\n * 2) self-seeded\n * Random rng;\n * 3) named generator -- normally self-seeded, but seed may be\n * set explicitly through an environment variable\n * Random rng(\"level2TP\");\n * If NTA_RANDOM_DEBUG is set, this object will log its self-seed\n * The seed can be explicitly set through NTA_RANDOM_SEED_level2TP\n *\n * Good self-seeds are generated by an internal global random number generator.\n * This global rng is seeded from the current time, but its seed may be\n * overridden with NTA_RANDOM_SEED\n *\n * Automated tests that use random numbers should normally use named generators.\n * This allows them to get a different seed each time, but also allows reproducibility\n * in the case that a test failure is triggered by a particular seed.\n *\n * Random should not be used if cryptographic strength is required (e.g. for\n * generating a challenge in an authentication scheme).\n *\n * @todo Add ability to specify different rng algorithms.\n *\/\n class RandomImpl;\n\n class Random\n {\n public:\n \/**\n * Retrieve the seeder. If seeder not set, allocates the\n * singleton and and initializes the seeder.\n *\/\n static RandomSeedFuncPtr getSeeder();\n\n Random(UInt64 seed = 0);\n\n \/\/ support copy constructor and operator= -- these require non-default\n \/\/ implementations because of the impl_ pointer.\n \/\/ They do a deep copy of impl_ so that an RNG and its copy generate the\n \/\/ same set of numbers.\n Random(const Random&);\n Random& operator=(const Random&);\n ~Random();\n\n \/\/ return a value uniformly distributed between 0 and max-1\n UInt32 getUInt32(UInt32 max = MAX32);\n UInt64 getUInt64(UInt64 max = MAX64);\n \/\/ return a double uniformly distributed on 0...1.0\n Real64 getReal64();\n\n \/\/ populate choices with a random selection of num elements from population\n \/\/ templated functions must be defined in header\n template <typename T>\n void sample(T population[], UInt32 nPopulation,\n T sample[], UInt32 nSample)\n {\n if (nSample == 0)\n {\n return;\n }\n UInt32 nextChoice = 0;\n for (UInt32 i = 0; i < nPopulation; ++i)\n {\n if (getUInt32(nPopulation - i) < (nSample - nextChoice))\n {\n sample[nextChoice] = population[i];\n ++nextChoice;\n if (nextChoice == nSample)\n {\n break;\n }\n }\n }\n }\n\n \/\/ randomly shuffle the elements\n template <class RandomAccessIterator>\n void shuffle(RandomAccessIterator first, RandomAccessIterator last)\n {\n std::random_shuffle(first, last, *this);\n }\n\n \/\/ for STL compatibility\n UInt32 operator()(UInt32 n = MAX32) { return getUInt32(n); }\n\n \/\/ normally used for debugging only\n UInt64 getSeed() {return seed_;}\n\n \/\/ for STL\n typedef UInt32 argument_type;\n typedef UInt32 result_type;\n\n result_type max() { return MAX32; }\n result_type min() { return 0; }\n\n static const UInt32 MAX32;\n static const UInt64 MAX64;\n\n \/\/ called by the plugin framework so that plugins\n \/\/ get the \"global\" seeder\n static void initSeeder(const RandomSeedFuncPtr r);\n\n static void shutdown();\n\n protected:\n\n \/\/ each \"universe\" (application\/plugin\/python module) has its own instance,\n \/\/ but the instance should be NULL in all but one\n static Random *theInstanceP_;\n \/\/ seeder_ is a function called by the constructor to get new random seeds\n \/\/ If not set when we call Random constructor, then the singleton is allocated\n \/\/ and seeder_ is set to a function that uses our singleton\n \/\/ initFromPlatformServices can also be used to initialize the seeder_\n static RandomSeedFuncPtr seeder_;\n\n void reseed(UInt64 seed);\n\n RandomImpl *impl_;\n UInt64 seed_;\n\n friend class RandomTest;\n friend std::ostream& operator<<(std::ostream&, const Random&);\n friend std::istream& operator>>(std::istream&, Random&);\n friend NTA_UInt64 GetRandomSeed();\n\n };\n\n \/\/ serialization\/deserialization\n std::ostream& operator<<(std::ostream&, const Random&);\n std::istream& operator>>(std::istream&, Random&);\n\n \/\/ This function returns seeds from the Random singleton in our\n \/\/ \"universe\" (application, plugin, python module). If, when the\n \/\/ Random constructor is called, seeder_ is NULL, then seeder_ is\n \/\/ set to this function. The plugin framework can override this\n \/\/ behavior by explicitly setting the seeder to the RandomSeeder\n \/\/ function provided by the application.\n NTA_UInt64 GetRandomSeed();\n\n\n} \/\/ namespace nta\n\n\n\n#endif \/\/ NTA_RANDOM_HPP\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2013 David Edmundson <kde@davidedmundson.co.uk>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"text-channel-watcher-proxy-model.h\"\n\n#include <TelepathyQt\/TextChannel>\n#include <TelepathyQt\/ChannelClassSpecList>\n#include <TelepathyQt\/MethodInvocationContext>\n#include <TelepathyQt\/Types>\n#include <TelepathyQt\/ReceivedMessage>\n\n#include <KTp\/types.h>\n#include <KTp\/contact.h>\n#include <KTp\/message.h>\n\n\ninline Tp::ChannelClassSpecList channelClasses() {\n return Tp::ChannelClassSpecList() << Tp::ChannelClassSpec::textChat();\n}\n\nclass ChannelWatcher : public QObject, public Tp::RefCounted\n{\n Q_OBJECT\npublic:\n ChannelWatcher(const QPersistentModelIndex &index, const Tp::TextChannelPtr &channel, QObject *parent=0);\n int unreadMessageCount() const;\n QString lastMessage() const;\n KTp::Message::MessageDirection lastMessageDirection() const;\n QPersistentModelIndex modelIndex() const;\nQ_SIGNALS:\n void messagesChanged();\n void invalidated();\nprivate Q_SLOTS:\n void onMessageReceived(const Tp::ReceivedMessage &message);\n void onMessageSent(const Tp::Message &message);\nprivate:\n QPersistentModelIndex m_index;\n Tp::TextChannelPtr m_channel;\n QString m_lastMessage;\n KTp::Message::MessageDirection m_lastMessageDirection;\n};\n\ntypedef Tp::SharedPtr<ChannelWatcher> ChannelWatcherPtr;\n\nChannelWatcher::ChannelWatcher(const QPersistentModelIndex &index, const Tp::TextChannelPtr &channel, QObject *parent):\n QObject(parent),\n m_index(index),\n m_channel(channel),\n m_lastMessageDirection(KTp::Message::LocalToRemote)\n{\n connect(channel.data(), SIGNAL(pendingMessageRemoved(Tp::ReceivedMessage)), SIGNAL(messagesChanged()));\n connect(channel.data(), SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)), SIGNAL(invalidated()));\n\n connect(channel.data(), SIGNAL(messageReceived(Tp::ReceivedMessage)), SLOT(onMessageReceived(Tp::ReceivedMessage)));\n connect(channel.data(), SIGNAL(messageSent(Tp::Message,Tp::MessageSendingFlags,QString)), SLOT(onMessageSent(Tp::Message)));\n\n \/\/trigger an update to the contact straight away\n QTimer::singleShot(0, this, SIGNAL(messagesChanged()));\n}\n\nQPersistentModelIndex ChannelWatcher::modelIndex() const\n{\n return m_index;\n}\n\nint ChannelWatcher::unreadMessageCount() const\n{\n return m_channel->messageQueue().size();\n}\n\nQString ChannelWatcher::lastMessage() const\n{\n return m_lastMessage;\n}\n\nKTp::Message::MessageDirection ChannelWatcher::lastMessageDirection() const\n{\n return m_lastMessageDirection;\n}\n\nvoid ChannelWatcher::onMessageReceived(const Tp::ReceivedMessage &message)\n{\n if (!message.isDeliveryReport()) {\n m_lastMessage = message.text();\n m_lastMessageDirection = KTp::Message::RemoteToLocal;\n Q_EMIT messagesChanged();\n }\n}\n\nvoid ChannelWatcher::onMessageSent(const Tp::Message &message)\n{\n m_lastMessage = message.text();\n m_lastMessageDirection = KTp::Message::LocalToRemote;\n Q_EMIT messagesChanged();\n}\n\nnamespace KTp {\n\nclass TextChannelWatcherProxyModel::Private {\npublic:\n QHash<KTp::ContactPtr, ChannelWatcherPtr> currentChannels;\n};\n\n} \/\/namespace\n\n\n\n\nKTp::TextChannelWatcherProxyModel::TextChannelWatcherProxyModel(QObject *parent) :\n QIdentityProxyModel(parent),\n Tp::AbstractClientObserver(channelClasses(), true),\n d(new TextChannelWatcherProxyModel::Private)\n{\n}\n\nKTp::TextChannelWatcherProxyModel::~TextChannelWatcherProxyModel()\n{\n delete d;\n}\n\nvoid KTp::TextChannelWatcherProxyModel::observeChannels(const Tp::MethodInvocationContextPtr<> &context, const Tp::AccountPtr &account, const Tp::ConnectionPtr &connection, const QList<Tp::ChannelPtr> &channels, const Tp::ChannelDispatchOperationPtr &dispatchOperation, const QList<Tp::ChannelRequestPtr> &requestsSatisfied, const Tp::AbstractClientObserver::ObserverInfo &observerInfo)\n{\n Q_UNUSED(context)\n Q_UNUSED(account)\n Q_UNUSED(connection)\n Q_UNUSED(dispatchOperation)\n Q_UNUSED(requestsSatisfied)\n Q_UNUSED(observerInfo)\n\n if (!sourceModel()) {\n return;\n }\n\n Q_FOREACH(const Tp::ChannelPtr & channel, channels) {\n Tp::TextChannelPtr textChannel = Tp::TextChannelPtr::dynamicCast(channel);\n if (textChannel) {\n KTp::ContactPtr targetContact = KTp::ContactPtr::qObjectCast(textChannel->targetContact());\n\n \/\/skip group chats and situations where we don't have a single contact to mark messages for\n if (targetContact.isNull()) {\n continue;\n }\n\n \/\/if it's not in our source model, ignore the channel\n QModelIndexList matchedContacts = sourceModel()->match(QModelIndex(sourceModel()->index(0,0)), KTp::ContactRole, QVariant::fromValue(targetContact));\n if (matchedContacts.size() !=1) {\n continue;\n }\n\n QPersistentModelIndex contactIndex(matchedContacts[0]);\n\n ChannelWatcherPtr watcher = ChannelWatcherPtr(new ChannelWatcher(contactIndex, textChannel));\n d->currentChannels[targetContact] = watcher;\n\n connect(watcher.data(), SIGNAL(messagesChanged()), SLOT(onChannelMessagesChanged()));\n }\n }\n}\n\nQVariant KTp::TextChannelWatcherProxyModel::data(const QModelIndex &proxyIndex, int role) const\n{\n const QModelIndex sourceIndex = mapToSource(proxyIndex);\n if (role == KTp::ContactHasTextChannelRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return true;\n }\n }\n return false;\n }\n\n if (role == KTp::ContactUnreadMessageCountRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->unreadMessageCount();\n }\n }\n return 0;\n }\n if (role == KTp::ContactLastMessageRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->lastMessage();\n }\n }\n return QString();\n }\n if (role == KTp::ContactLastMessageDirectionRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->lastMessageDirection();\n }\n }\n return KTp::Message::LocalToRemote;\n }\n\n return sourceIndex.data(role);\n}\n\nvoid KTp::TextChannelWatcherProxyModel::onChannelMessagesChanged()\n{\n ChannelWatcher* watcher = qobject_cast<ChannelWatcher*>(sender());\n Q_ASSERT(watcher);\n const QModelIndex &index = mapFromSource(watcher->modelIndex());\n dataChanged(index, index);\n}\n\nvoid KTp::TextChannelWatcherProxyModel::onChannelInvalidated()\n{\n ChannelWatcher* watcher = qobject_cast<ChannelWatcher*>(sender());\n Q_ASSERT(watcher);\n const QModelIndex &index = mapFromSource(watcher->modelIndex());\n const KTp::ContactPtr &contact = index.data(KTp::ContactRole).value<KTp::ContactPtr>();\n\n d->currentChannels.remove(contact);\n dataChanged(index, index);\n}\n\n#include \"text-channel-watcher-proxy-model.moc\"\n#include \"moc_text-channel-watcher-proxy-model.cpp\"\n<commit_msg>Match contacts in watcher proxy by contact id instead of ContactPtr<commit_after>\/*\n * Copyright (C) 2013 David Edmundson <kde@davidedmundson.co.uk>\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \"text-channel-watcher-proxy-model.h\"\n\n#include <TelepathyQt\/TextChannel>\n#include <TelepathyQt\/ChannelClassSpecList>\n#include <TelepathyQt\/MethodInvocationContext>\n#include <TelepathyQt\/Types>\n#include <TelepathyQt\/ReceivedMessage>\n\n#include <KTp\/types.h>\n#include <KTp\/contact.h>\n#include <KTp\/message.h>\n\n\ninline Tp::ChannelClassSpecList channelClasses() {\n return Tp::ChannelClassSpecList() << Tp::ChannelClassSpec::textChat();\n}\n\nclass ChannelWatcher : public QObject, public Tp::RefCounted\n{\n Q_OBJECT\npublic:\n ChannelWatcher(const QPersistentModelIndex &index, const Tp::TextChannelPtr &channel, QObject *parent=0);\n int unreadMessageCount() const;\n QString lastMessage() const;\n KTp::Message::MessageDirection lastMessageDirection() const;\n QPersistentModelIndex modelIndex() const;\nQ_SIGNALS:\n void messagesChanged();\n void invalidated();\nprivate Q_SLOTS:\n void onMessageReceived(const Tp::ReceivedMessage &message);\n void onMessageSent(const Tp::Message &message);\nprivate:\n QPersistentModelIndex m_index;\n Tp::TextChannelPtr m_channel;\n QString m_lastMessage;\n KTp::Message::MessageDirection m_lastMessageDirection;\n};\n\ntypedef Tp::SharedPtr<ChannelWatcher> ChannelWatcherPtr;\n\nChannelWatcher::ChannelWatcher(const QPersistentModelIndex &index, const Tp::TextChannelPtr &channel, QObject *parent):\n QObject(parent),\n m_index(index),\n m_channel(channel),\n m_lastMessageDirection(KTp::Message::LocalToRemote)\n{\n connect(channel.data(), SIGNAL(pendingMessageRemoved(Tp::ReceivedMessage)), SIGNAL(messagesChanged()));\n connect(channel.data(), SIGNAL(invalidated(Tp::DBusProxy*,QString,QString)), SIGNAL(invalidated()));\n\n connect(channel.data(), SIGNAL(messageReceived(Tp::ReceivedMessage)), SLOT(onMessageReceived(Tp::ReceivedMessage)));\n connect(channel.data(), SIGNAL(messageSent(Tp::Message,Tp::MessageSendingFlags,QString)), SLOT(onMessageSent(Tp::Message)));\n\n \/\/trigger an update to the contact straight away\n QTimer::singleShot(0, this, SIGNAL(messagesChanged()));\n}\n\nQPersistentModelIndex ChannelWatcher::modelIndex() const\n{\n return m_index;\n}\n\nint ChannelWatcher::unreadMessageCount() const\n{\n return m_channel->messageQueue().size();\n}\n\nQString ChannelWatcher::lastMessage() const\n{\n return m_lastMessage;\n}\n\nKTp::Message::MessageDirection ChannelWatcher::lastMessageDirection() const\n{\n return m_lastMessageDirection;\n}\n\nvoid ChannelWatcher::onMessageReceived(const Tp::ReceivedMessage &message)\n{\n if (!message.isDeliveryReport()) {\n m_lastMessage = message.text();\n m_lastMessageDirection = KTp::Message::RemoteToLocal;\n Q_EMIT messagesChanged();\n }\n}\n\nvoid ChannelWatcher::onMessageSent(const Tp::Message &message)\n{\n m_lastMessage = message.text();\n m_lastMessageDirection = KTp::Message::LocalToRemote;\n Q_EMIT messagesChanged();\n}\n\nnamespace KTp {\n\nclass TextChannelWatcherProxyModel::Private {\npublic:\n QHash<KTp::ContactPtr, ChannelWatcherPtr> currentChannels;\n};\n\n} \/\/namespace\n\n\n\n\nKTp::TextChannelWatcherProxyModel::TextChannelWatcherProxyModel(QObject *parent) :\n QIdentityProxyModel(parent),\n Tp::AbstractClientObserver(channelClasses(), true),\n d(new TextChannelWatcherProxyModel::Private)\n{\n}\n\nKTp::TextChannelWatcherProxyModel::~TextChannelWatcherProxyModel()\n{\n delete d;\n}\n\nvoid KTp::TextChannelWatcherProxyModel::observeChannels(const Tp::MethodInvocationContextPtr<> &context, const Tp::AccountPtr &account, const Tp::ConnectionPtr &connection, const QList<Tp::ChannelPtr> &channels, const Tp::ChannelDispatchOperationPtr &dispatchOperation, const QList<Tp::ChannelRequestPtr> &requestsSatisfied, const Tp::AbstractClientObserver::ObserverInfo &observerInfo)\n{\n Q_UNUSED(context)\n Q_UNUSED(account)\n Q_UNUSED(connection)\n Q_UNUSED(dispatchOperation)\n Q_UNUSED(requestsSatisfied)\n Q_UNUSED(observerInfo)\n\n if (!sourceModel()) {\n return;\n }\n\n Q_FOREACH(const Tp::ChannelPtr & channel, channels) {\n Tp::TextChannelPtr textChannel = Tp::TextChannelPtr::dynamicCast(channel);\n if (textChannel) {\n KTp::ContactPtr targetContact = KTp::ContactPtr::qObjectCast(textChannel->targetContact());\n\n \/\/skip group chats and situations where we don't have a single contact to mark messages for\n if (targetContact.isNull()) {\n continue;\n }\n\n \/\/if it's not in our source model, ignore the channel\n QModelIndexList matchedContacts = sourceModel()->match(QModelIndex(sourceModel()->index(0,0)), KTp::IdRole, QVariant::fromValue(targetContact->id()));\n if (matchedContacts.size() !=1) {\n continue;\n }\n\n QPersistentModelIndex contactIndex(matchedContacts[0]);\n\n ChannelWatcherPtr watcher = ChannelWatcherPtr(new ChannelWatcher(contactIndex, textChannel));\n d->currentChannels[targetContact] = watcher;\n\n connect(watcher.data(), SIGNAL(messagesChanged()), SLOT(onChannelMessagesChanged()));\n }\n }\n}\n\nQVariant KTp::TextChannelWatcherProxyModel::data(const QModelIndex &proxyIndex, int role) const\n{\n const QModelIndex sourceIndex = mapToSource(proxyIndex);\n if (role == KTp::ContactHasTextChannelRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return true;\n }\n }\n return false;\n }\n\n if (role == KTp::ContactUnreadMessageCountRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->unreadMessageCount();\n }\n }\n return 0;\n }\n if (role == KTp::ContactLastMessageRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->lastMessage();\n }\n }\n return QString();\n }\n if (role == KTp::ContactLastMessageDirectionRole) {\n KTp::ContactPtr contact = sourceIndex.data(KTp::ContactRole).value<KTp::ContactPtr>();\n if (contact) {\n if (d->currentChannels.contains(contact)) {\n return d->currentChannels[contact]->lastMessageDirection();\n }\n }\n return KTp::Message::LocalToRemote;\n }\n\n return sourceIndex.data(role);\n}\n\nvoid KTp::TextChannelWatcherProxyModel::onChannelMessagesChanged()\n{\n ChannelWatcher* watcher = qobject_cast<ChannelWatcher*>(sender());\n Q_ASSERT(watcher);\n const QModelIndex &index = mapFromSource(watcher->modelIndex());\n dataChanged(index, index);\n}\n\nvoid KTp::TextChannelWatcherProxyModel::onChannelInvalidated()\n{\n ChannelWatcher* watcher = qobject_cast<ChannelWatcher*>(sender());\n Q_ASSERT(watcher);\n const QModelIndex &index = mapFromSource(watcher->modelIndex());\n const KTp::ContactPtr &contact = index.data(KTp::ContactRole).value<KTp::ContactPtr>();\n\n d->currentChannels.remove(contact);\n dataChanged(index, index);\n}\n\n#include \"text-channel-watcher-proxy-model.moc\"\n#include \"moc_text-channel-watcher-proxy-model.cpp\"\n<|endoftext|>"} {"text":"<commit_before>#include \"regex.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include \"document.h\"\n#include \"prolog.h\"\n#include \"pi.h\"\n#include \"doctype.h\"\n#include \"attribute.h\"\n#include \"element.h\"\n#include \"composite_element.h\"\n#include \"content.h\"\n\nstatic std::string schema_to_regex(CompositeElement *);\nstatic std::string element_to_regex(Element *);\nstatic std::string simple_element_to_regex(Element *);\nstatic std::string complexe_type_to_regex(CompositeElement *);\nstatic std::string choice_to_regex(CompositeElement *);\nstatic std::string sequence_to_regex(CompositeElement *);\nstatic std::string string_to_regex();\nstatic std::string date_to_regex();\nstatic std::string mixed_to_regex();\n\nstd::string xsl_to_regex(Document * doc)\n{\n CompositeElement * root = dynamic_cast<CompositeElement *>(doc->root());\n if (root == nullptr)\n return \"^$\";\n if (root->begin_tag() == \"xsd:schema\")\n return \"^\" + schema_to_regex(root) + \"$\";\n return \"^$\";\n}\n\nstd::string schema_to_regex(CompositeElement * s)\n{\n std::string r;\n for (auto c : s->content())\n {\n auto e = dynamic_cast<Element *>(c);\n if (e != nullptr && e->name() == \"xsd:element\")\n r += element_to_regex(e);\n }\n return r;\n}\n\nstd::string element_to_regex(Element * e)\n{\n auto it_name = std::find_if(e->attributes().begin(), e->attributes().end(),\n [](Attribute * a) { return a->name() == \"name\"; });\n if (it_name == e->attributes().end())\n return \"\";\n\n auto name = (*it_name)->value();\n\n auto ce = dynamic_cast<CompositeElement *>(e);\n if (ce != nullptr)\n {\n CompositeElement * cce = nullptr;\n if (ce->content().size() >= 1\n && (cce = dynamic_cast<CompositeElement *>(ce->content().front())) != nullptr\n && cce->begin_tag() == \"xsd:complexType\")\n {\n return \"<\" + name + \">\" + complexe_type_to_regex(cce) + \"<\/\" + name + \">\";\n }\n }\n else\n {\n return \"<\" + name + \">\" + simple_element_to_regex(e) + \"<\/\" + name + \">\";\n }\n return \"\";\n}\n\nstd::string simple_element_to_regex(Element * e)\n{\n auto it_type = std::find_if(e->attributes().begin(), e->attributes().end(),\n [](Attribute * a) { return a->name() == \"type\"; });\n if (it_type == e->attributes().end())\n return \"\";\n\n auto type = (*it_type)->value();\n if (type == \"xsd:string\")\n return string_to_regex();\n else if (type == \"xsd:date\")\n return date_to_regex();\n return \"\";\n}\n\nstd::string complexe_type_to_regex(CompositeElement * e)\n{\n if (e->content().size() < 1)\n return \"\";\n\n CompositeElement * ce = dynamic_cast<CompositeElement *>(e->content().front());\n if (ce == nullptr)\n return \"\";\n\n std::string s;\n if (ce->begin_tag() == \"xsd:choice\")\n {\n s += choice_to_regex(ce);\n }\n else if (ce->begin_tag() == \"xsd:sequence\")\n {\n s += sequence_to_regex(ce);\n }\n return s;\n}\n\nstd::string choice_to_regex(CompositeElement * e)\n{\n std::string s;\n for (auto c : e->content())\n {\n auto ce = dynamic_cast<Element *>(c);\n if (ce)\n {\n s += element_to_regex(ce);\n if (c != e->content().back())\n s += \"|\";\n }\n }\n return \"(\" + s + \")\";\n}\n\nstd::string sequence_to_regex(CompositeElement * e)\n{\n std::string s;\n for (auto c : e->content())\n {\n auto ce = dynamic_cast<Element *>(c);\n if (ce)\n {\n s += \"(\" + element_to_regex(ce) + \")\";\n }\n }\n return \"(\" + s + \")\";\n}\n\nstd::string string_to_regex()\n{\n return \"[^<]*\";\n}\n\nstd::string date_to_regex()\n{\n return \"[0-9]{4}-[0-9]{2}-[0-9]{2}(((\\\\+|-)[0-2][0-9]:[0-5][0-9])|Z)?\";\n}\n\nstd::string mixed_to_regex()\n{\n return \"[^<]*\";\n}\n<commit_msg>Ajout de blancs possible entres les balises<commit_after>#include \"regex.h\"\n\n#include <iostream>\n#include <algorithm>\n\n#include \"document.h\"\n#include \"prolog.h\"\n#include \"pi.h\"\n#include \"doctype.h\"\n#include \"attribute.h\"\n#include \"element.h\"\n#include \"composite_element.h\"\n#include \"content.h\"\n\nstatic std::string schema_to_regex(CompositeElement *);\nstatic std::string element_to_regex(Element *);\nstatic std::string simple_element_to_regex(Element *);\nstatic std::string complexe_type_to_regex(CompositeElement *);\nstatic std::string choice_to_regex(CompositeElement *);\nstatic std::string sequence_to_regex(CompositeElement *);\nstatic std::string string_to_regex();\nstatic std::string date_to_regex();\nstatic std::string mixed_to_regex();\nstatic std::string blank_to_regex();\n\nstd::string xsl_to_regex(Document * doc)\n{\n CompositeElement * root = dynamic_cast<CompositeElement *>(doc->root());\n if (root == nullptr)\n return \"^$\";\n if (root->begin_tag() == \"xsd:schema\")\n return \"^\" + schema_to_regex(root) + \"$\";\n return \"^$\";\n}\n\nstd::string schema_to_regex(CompositeElement * s)\n{\n std::string r;\n for (auto c : s->content())\n {\n auto e = dynamic_cast<Element *>(c);\n if (e != nullptr && e->name() == \"xsd:element\")\n r += element_to_regex(e);\n }\n return r;\n}\n\nstd::string element_to_regex(Element * e)\n{\n auto it_name = std::find_if(e->attributes().begin(), e->attributes().end(),\n [](Attribute * a) { return a->name() == \"name\"; });\n if (it_name == e->attributes().end())\n return \"\";\n\n auto name = (*it_name)->value();\n\n auto ce = dynamic_cast<CompositeElement *>(e);\n if (ce != nullptr)\n {\n CompositeElement * cce = nullptr;\n if (ce->content().size() >= 1\n && (cce = dynamic_cast<CompositeElement *>(ce->content().front())) != nullptr\n && cce->begin_tag() == \"xsd:complexType\")\n {\n return \"<\" + name + \">\\\\s?\" + complexe_type_to_regex(cce) + \"<\/\" + name + \">\\\\s?\";\n }\n }\n else\n {\n return \"<\" + name + \"\\\\s?>\" + simple_element_to_regex(e) + \"<\/\" + name + \"\\\\s?>\";\n }\n return \"\";\n}\n\nstd::string simple_element_to_regex(Element * e)\n{\n auto it_type = std::find_if(e->attributes().begin(), e->attributes().end(),\n [](Attribute * a) { return a->name() == \"type\"; });\n if (it_type == e->attributes().end())\n return \"\";\n\n auto type = (*it_type)->value();\n if (type == \"xsd:string\")\n return string_to_regex();\n else if (type == \"xsd:date\")\n return date_to_regex();\n return \"\";\n}\n\nstd::string complexe_type_to_regex(CompositeElement * e)\n{\n if (e->content().size() < 1)\n return \"\";\n\n CompositeElement * ce = dynamic_cast<CompositeElement *>(e->content().front());\n if (ce == nullptr)\n return \"\";\n\n std::string s;\n if (ce->begin_tag() == \"xsd:choice\")\n {\n s += choice_to_regex(ce);\n }\n else if (ce->begin_tag() == \"xsd:sequence\")\n {\n s += sequence_to_regex(ce);\n }\n return s;\n}\n\nstd::string choice_to_regex(CompositeElement * e)\n{\n std::string s;\n for (auto c : e->content())\n {\n auto ce = dynamic_cast<Element *>(c);\n if (ce)\n {\n s += element_to_regex(ce);\n if (c != e->content().back())\n s += \"|\";\n }\n }\n return blank_to_regex() + \"(\" + s + \")\" + blank_to_regex();\n}\n\nstd::string sequence_to_regex(CompositeElement * e)\n{\n std::string s;\n for (auto c : e->content())\n {\n auto ce = dynamic_cast<Element *>(c);\n if (ce)\n {\n s += element_to_regex(ce) + blank_to_regex();\n }\n }\n return blank_to_regex() + s;\n}\n\nstd::string string_to_regex()\n{\n return \"[^<]*\";\n}\n\nstd::string date_to_regex()\n{\n return \"[0-9]{4}-[0-9]{2}-[0-9]{2}(((\\\\+|-)[0-2][0-9]:[0-5][0-9])|Z)?\";\n}\n\nstd::string mixed_to_regex()\n{\n return \"[^<]*\";\n}\n\nstd::string blank_to_regex()\n{\n return \"\\\\s*\";\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n\/\/ See docs in ..\/ops\/sdca_ops.cc.\n\n#define EIGEN_USE_THREADS\n\n#include <stdint.h>\n#include <atomic>\n#include <limits>\n#include <memory>\n#include <new>\n#include <string>\n#include <vector>\n\n#include \"third_party\/eigen3\/unsupported\/Eigen\/CXX11\/Tensor\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/tensor_types.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/kernels\/hinge-loss.h\"\n#include \"tensorflow\/core\/kernels\/logistic-loss.h\"\n#include \"tensorflow\/core\/kernels\/loss.h\"\n#include \"tensorflow\/core\/kernels\/sdca_internal.h\"\n#include \"tensorflow\/core\/kernels\/smooth-hinge-loss.h\"\n#include \"tensorflow\/core\/kernels\/squared-loss.h\"\n#include \"tensorflow\/core\/lib\/core\/coding.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/core\/stringpiece.h\"\n#include \"tensorflow\/core\/lib\/gtl\/inlined_vector.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/fingerprint.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/util\/work_sharder.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\nusing sdca::Regularizations;\nusing sdca::Example;\nusing sdca::Examples;\nusing sdca::ExampleStatistics;\nusing sdca::ModelWeights;\n\nstruct ComputeOptions {\n ComputeOptions(OpKernelConstruction* const context) {\n string loss_type;\n OP_REQUIRES_OK(context, context->GetAttr(\"loss_type\", &loss_type));\n if (loss_type == \"logistic_loss\") {\n loss_updater.reset(new LogisticLossUpdater);\n } else if (loss_type == \"squared_loss\") {\n loss_updater.reset(new SquaredLossUpdater);\n } else if (loss_type == \"hinge_loss\") {\n loss_updater.reset(new HingeLossUpdater);\n } else if (loss_type == \"smooth_hinge_loss\") {\n loss_updater.reset(new SmoothHingeLossUpdater);\n } else {\n OP_REQUIRES(context, false, errors::InvalidArgument(\n \"Unsupported loss type: \", loss_type));\n }\n OP_REQUIRES_OK(context, context->GetAttr(\"adaptative\", &adaptative));\n OP_REQUIRES_OK(\n context, context->GetAttr(\"num_sparse_features\", &num_sparse_features));\n OP_REQUIRES_OK(context, context->GetAttr(\"num_sparse_features_with_values\",\n &num_sparse_features_with_values));\n OP_REQUIRES_OK(context,\n context->GetAttr(\"num_dense_features\", &num_dense_features));\n OP_REQUIRES(\n context, num_sparse_features + num_dense_features > 0,\n errors::InvalidArgument(\"Requires at least one feature to train.\"));\n\n OP_REQUIRES(context, static_cast<int64>(num_sparse_features) +\n static_cast<int64>(num_dense_features) <=\n std::numeric_limits<int>::max(),\n errors::InvalidArgument(\n strings::Printf(\"Too many feature groups: %lld > %d\",\n static_cast<int64>(num_sparse_features) +\n static_cast<int64>(num_dense_features),\n std::numeric_limits<int>::max())));\n OP_REQUIRES_OK(\n context, context->GetAttr(\"num_loss_partitions\", &num_loss_partitions));\n OP_REQUIRES_OK(context, context->GetAttr(\"num_inner_iterations\",\n &num_inner_iterations));\n OP_REQUIRES_OK(context, regularizations.Initialize(context));\n }\n\n std::unique_ptr<DualLossUpdater> loss_updater;\n int num_sparse_features = 0;\n int num_sparse_features_with_values = 0;\n int num_dense_features = 0;\n int num_inner_iterations = 0;\n int num_loss_partitions = 0;\n bool adaptative = false;\n Regularizations regularizations;\n};\n\n\/\/ TODO(shengx): The helper classes\/methods are changed to support multiclass\n\/\/ SDCA, which lead to changes within this function. Need to revisit the\n\/\/ convergence once the multiclass SDCA is in.\nvoid DoCompute(const ComputeOptions& options, OpKernelContext* const context) {\n ModelWeights model_weights;\n OP_REQUIRES_OK(context, model_weights.Initialize(context));\n\n Examples examples;\n OP_REQUIRES_OK(\n context,\n examples.Initialize(context, model_weights, options.num_sparse_features,\n options.num_sparse_features_with_values,\n options.num_dense_features));\n\n const Tensor* example_state_data_t;\n OP_REQUIRES_OK(context,\n context->input(\"example_state_data\", &example_state_data_t));\n TensorShape expected_example_state_shape({examples.num_examples(), 4});\n OP_REQUIRES(context,\n example_state_data_t->shape() == expected_example_state_shape,\n errors::InvalidArgument(\n \"Expected shape \", expected_example_state_shape.DebugString(),\n \" for example_state_data, got \",\n example_state_data_t->shape().DebugString()));\n\n Tensor mutable_example_state_data_t(*example_state_data_t);\n auto example_state_data = mutable_example_state_data_t.matrix<float>();\n context->set_output(\"out_example_state_data\", mutable_example_state_data_t);\n\n if (options.adaptative) {\n OP_REQUIRES_OK(context,\n examples.SampleAdaptativeProbabilities(\n options.num_loss_partitions, options.regularizations,\n model_weights, example_state_data, options.loss_updater,\n \/*num_weight_vectors =*\/1));\n }\n\n mutex mu;\n Status train_step_status GUARDED_BY(mu);\n std::atomic<std::int64_t> atomic_index(-1);\n auto train_step = [&](const int64 begin, const int64 end) {\n \/\/ The static_cast here is safe since begin and end can be at most\n \/\/ num_examples which is an int.\n for (int id = static_cast<int>(begin); id < end; ++id) {\n const int64 example_index =\n examples.sampled_index(++atomic_index, options.adaptative);\n const Example& example = examples.example(example_index);\n const float dual = example_state_data(example_index, 0);\n const float example_weight = example.example_weight();\n float example_label = example.example_label();\n const Status conversion_status =\n options.loss_updater->ConvertLabel(&example_label);\n if (!conversion_status.ok()) {\n mutex_lock l(mu);\n train_step_status = conversion_status;\n \/\/ Return from this worker thread - the calling thread is\n \/\/ responsible for checking context status and returning on error.\n return;\n }\n\n \/\/ Compute wx, example norm weighted by regularization, dual loss,\n \/\/ primal loss.\n \/\/ For binary SDCA, num_weight_vectors should be one.\n const ExampleStatistics example_statistics =\n example.ComputeWxAndWeightedExampleNorm(\n options.num_loss_partitions, model_weights,\n options.regularizations, 1 \/* num_weight_vectors *\/);\n\n const double new_dual = options.loss_updater->ComputeUpdatedDual(\n options.num_loss_partitions, example_label, example_weight, dual,\n example_statistics.wx[0], example_statistics.normalized_squared_norm);\n\n \/\/ Compute new weights.\n const double normalized_bounded_dual_delta =\n (new_dual - dual) * example_weight \/\n options.regularizations.symmetric_l2();\n model_weights.UpdateDeltaWeights(\n context->eigen_cpu_device(), example,\n std::vector<double>{normalized_bounded_dual_delta});\n\n \/\/ Update example data.\n example_state_data(example_index, 0) = new_dual;\n example_state_data(example_index, 1) =\n options.loss_updater->ComputePrimalLoss(\n example_statistics.prev_wx[0], example_label, example_weight);\n example_state_data(example_index, 2) =\n options.loss_updater->ComputeDualLoss(dual, example_label,\n example_weight);\n example_state_data(example_index, 3) = example_weight;\n }\n };\n \/\/ TODO(sibyl-Aix6ihai): Tune this properly based on sparsity of the data,\n \/\/ number of cpus, and cost per example.\n const int64 kCostPerUnit = examples.num_features();\n const DeviceBase::CpuWorkerThreads& worker_threads =\n *context->device()->tensorflow_cpu_worker_threads();\n\n Shard(worker_threads.num_threads, worker_threads.workers,\n examples.num_examples(), kCostPerUnit, train_step);\n OP_REQUIRES_OK(context, train_step_status);\n}\n\n} \/\/ namespace\n\nclass SdcaOptimizer : public OpKernel {\n public:\n explicit SdcaOptimizer(OpKernelConstruction* const context)\n : OpKernel(context), options_(context) {}\n\n void Compute(OpKernelContext* const context) override {\n DoCompute(options_, context);\n }\n\n private:\n \/\/ TODO(sibyl-Aix6ihai): We could use the type-constraint on loss_type, and\n \/\/ template the entire class to avoid the virtual table lookup penalty in\n \/\/ the inner loop.\n ComputeOptions options_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaOptimizer\").Device(DEVICE_CPU),\n SdcaOptimizer);\n\nclass SdcaShrinkL1 : public OpKernel {\n public:\n explicit SdcaShrinkL1(OpKernelConstruction* const context)\n : OpKernel(context) {\n OP_REQUIRES_OK(context, regularizations_.Initialize(context));\n }\n\n void Compute(OpKernelContext* const context) override {\n OpMutableInputList weights_inputs;\n OP_REQUIRES_OK(context,\n context->mutable_input_list(\"weights\", &weights_inputs));\n\n auto do_work = [&](const int64 begin, const int64 end) {\n for (int i = begin; i < end; ++i) {\n auto prox_w = weights_inputs.at(i, \/*lock_held=*\/true).flat<float>();\n prox_w.device(context->eigen_cpu_device()) =\n regularizations_.EigenShrinkVector(prox_w);\n }\n };\n\n if (weights_inputs.size() > 0) {\n int64 num_weights = 0;\n for (int i = 0; i < weights_inputs.size(); ++i) {\n num_weights += weights_inputs.at(i, \/*lock_held=*\/true).NumElements();\n }\n \/\/ TODO(sibyl-Aix6ihai): Tune this value.\n const int64 kCostPerUnit = (num_weights * 50) \/ weights_inputs.size();\n const DeviceBase::CpuWorkerThreads& worker_threads =\n *context->device()->tensorflow_cpu_worker_threads();\n Shard(worker_threads.num_threads, worker_threads.workers,\n weights_inputs.size(), kCostPerUnit, do_work);\n }\n }\n\n private:\n Regularizations regularizations_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaShrinkL1\").Device(DEVICE_CPU), SdcaShrinkL1);\n\n\/\/ Computes platform independent, compact and unique (with very high\n\/\/ probability) representation of an example id. It shouldn't be put in\n\/\/ persistent storage, as its implementation may change in the future.\n\/\/\n\/\/ The current probability of at least one collision for 1B example_ids is\n\/\/ approximately 10^-21 (ie 2^60 \/ 2^129).\nclass SdcaFprint : public OpKernel {\n public:\n explicit SdcaFprint(OpKernelConstruction* const context)\n : OpKernel(context) {}\n\n void Compute(OpKernelContext* const context) override {\n const Tensor& input = context->input(0);\n OP_REQUIRES(context, TensorShapeUtils::IsVector(input.shape()),\n errors::InvalidArgument(\"Input must be a vector, got shape \",\n input.shape().DebugString()));\n Tensor* out;\n const int64 num_elements = input.NumElements();\n OP_REQUIRES_OK(context, context->allocate_output(\n 0, TensorShape({num_elements, 2}), &out));\n\n const auto in_values = input.flat<string>();\n auto out_values = out->matrix<int64>();\n\n for (int64 i = 0; i < num_elements; ++i) {\n const Fprint128 fprint = Fingerprint128(in_values(i));\n \/\/ Never return 0 or 1 as the first value of the hash to allow these to\n \/\/ safely be used as sentinel values (e.g. dense hash table empty key).\n out_values(i, 0) = TF_PREDICT_TRUE(fprint.low64 >= 2)\n ? fprint.low64\n : fprint.low64 + ~static_cast<uint64>(1);\n out_values(i, 1) = fprint.high64;\n }\n }\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaFprint\").Device(DEVICE_CPU), SdcaFprint);\n\n} \/\/ namespace tensorflow\n<commit_msg>Fixed the signature of the Sdca*::Compute() methods Change: 141203556<commit_after>\/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n\/\/ See docs in ..\/ops\/sdca_ops.cc.\n\n#define EIGEN_USE_THREADS\n\n#include <stdint.h>\n#include <atomic>\n#include <limits>\n#include <memory>\n#include <new>\n#include <string>\n#include <vector>\n\n#include \"third_party\/eigen3\/unsupported\/Eigen\/CXX11\/Tensor\"\n#include \"tensorflow\/core\/framework\/device_base.h\"\n#include \"tensorflow\/core\/framework\/kernel_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op.h\"\n#include \"tensorflow\/core\/framework\/op_def_builder.h\"\n#include \"tensorflow\/core\/framework\/op_kernel.h\"\n#include \"tensorflow\/core\/framework\/tensor.h\"\n#include \"tensorflow\/core\/framework\/tensor_shape.h\"\n#include \"tensorflow\/core\/framework\/tensor_types.h\"\n#include \"tensorflow\/core\/framework\/types.h\"\n#include \"tensorflow\/core\/kernels\/hinge-loss.h\"\n#include \"tensorflow\/core\/kernels\/logistic-loss.h\"\n#include \"tensorflow\/core\/kernels\/loss.h\"\n#include \"tensorflow\/core\/kernels\/sdca_internal.h\"\n#include \"tensorflow\/core\/kernels\/smooth-hinge-loss.h\"\n#include \"tensorflow\/core\/kernels\/squared-loss.h\"\n#include \"tensorflow\/core\/lib\/core\/coding.h\"\n#include \"tensorflow\/core\/lib\/core\/errors.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/core\/stringpiece.h\"\n#include \"tensorflow\/core\/lib\/gtl\/inlined_vector.h\"\n#include \"tensorflow\/core\/lib\/strings\/stringprintf.h\"\n#include \"tensorflow\/core\/platform\/fingerprint.h\"\n#include \"tensorflow\/core\/platform\/macros.h\"\n#include \"tensorflow\/core\/platform\/mutex.h\"\n#include \"tensorflow\/core\/platform\/types.h\"\n#include \"tensorflow\/core\/util\/work_sharder.h\"\n\nnamespace tensorflow {\n\nnamespace {\n\nusing sdca::Regularizations;\nusing sdca::Example;\nusing sdca::Examples;\nusing sdca::ExampleStatistics;\nusing sdca::ModelWeights;\n\nstruct ComputeOptions {\n ComputeOptions(OpKernelConstruction* const context) {\n string loss_type;\n OP_REQUIRES_OK(context, context->GetAttr(\"loss_type\", &loss_type));\n if (loss_type == \"logistic_loss\") {\n loss_updater.reset(new LogisticLossUpdater);\n } else if (loss_type == \"squared_loss\") {\n loss_updater.reset(new SquaredLossUpdater);\n } else if (loss_type == \"hinge_loss\") {\n loss_updater.reset(new HingeLossUpdater);\n } else if (loss_type == \"smooth_hinge_loss\") {\n loss_updater.reset(new SmoothHingeLossUpdater);\n } else {\n OP_REQUIRES(context, false, errors::InvalidArgument(\n \"Unsupported loss type: \", loss_type));\n }\n OP_REQUIRES_OK(context, context->GetAttr(\"adaptative\", &adaptative));\n OP_REQUIRES_OK(\n context, context->GetAttr(\"num_sparse_features\", &num_sparse_features));\n OP_REQUIRES_OK(context, context->GetAttr(\"num_sparse_features_with_values\",\n &num_sparse_features_with_values));\n OP_REQUIRES_OK(context,\n context->GetAttr(\"num_dense_features\", &num_dense_features));\n OP_REQUIRES(\n context, num_sparse_features + num_dense_features > 0,\n errors::InvalidArgument(\"Requires at least one feature to train.\"));\n\n OP_REQUIRES(context, static_cast<int64>(num_sparse_features) +\n static_cast<int64>(num_dense_features) <=\n std::numeric_limits<int>::max(),\n errors::InvalidArgument(\n strings::Printf(\"Too many feature groups: %lld > %d\",\n static_cast<int64>(num_sparse_features) +\n static_cast<int64>(num_dense_features),\n std::numeric_limits<int>::max())));\n OP_REQUIRES_OK(\n context, context->GetAttr(\"num_loss_partitions\", &num_loss_partitions));\n OP_REQUIRES_OK(context, context->GetAttr(\"num_inner_iterations\",\n &num_inner_iterations));\n OP_REQUIRES_OK(context, regularizations.Initialize(context));\n }\n\n std::unique_ptr<DualLossUpdater> loss_updater;\n int num_sparse_features = 0;\n int num_sparse_features_with_values = 0;\n int num_dense_features = 0;\n int num_inner_iterations = 0;\n int num_loss_partitions = 0;\n bool adaptative = false;\n Regularizations regularizations;\n};\n\n\/\/ TODO(shengx): The helper classes\/methods are changed to support multiclass\n\/\/ SDCA, which lead to changes within this function. Need to revisit the\n\/\/ convergence once the multiclass SDCA is in.\nvoid DoCompute(const ComputeOptions& options, OpKernelContext* const context) {\n ModelWeights model_weights;\n OP_REQUIRES_OK(context, model_weights.Initialize(context));\n\n Examples examples;\n OP_REQUIRES_OK(\n context,\n examples.Initialize(context, model_weights, options.num_sparse_features,\n options.num_sparse_features_with_values,\n options.num_dense_features));\n\n const Tensor* example_state_data_t;\n OP_REQUIRES_OK(context,\n context->input(\"example_state_data\", &example_state_data_t));\n TensorShape expected_example_state_shape({examples.num_examples(), 4});\n OP_REQUIRES(context,\n example_state_data_t->shape() == expected_example_state_shape,\n errors::InvalidArgument(\n \"Expected shape \", expected_example_state_shape.DebugString(),\n \" for example_state_data, got \",\n example_state_data_t->shape().DebugString()));\n\n Tensor mutable_example_state_data_t(*example_state_data_t);\n auto example_state_data = mutable_example_state_data_t.matrix<float>();\n context->set_output(\"out_example_state_data\", mutable_example_state_data_t);\n\n if (options.adaptative) {\n OP_REQUIRES_OK(context,\n examples.SampleAdaptativeProbabilities(\n options.num_loss_partitions, options.regularizations,\n model_weights, example_state_data, options.loss_updater,\n \/*num_weight_vectors =*\/1));\n }\n\n mutex mu;\n Status train_step_status GUARDED_BY(mu);\n std::atomic<std::int64_t> atomic_index(-1);\n auto train_step = [&](const int64 begin, const int64 end) {\n \/\/ The static_cast here is safe since begin and end can be at most\n \/\/ num_examples which is an int.\n for (int id = static_cast<int>(begin); id < end; ++id) {\n const int64 example_index =\n examples.sampled_index(++atomic_index, options.adaptative);\n const Example& example = examples.example(example_index);\n const float dual = example_state_data(example_index, 0);\n const float example_weight = example.example_weight();\n float example_label = example.example_label();\n const Status conversion_status =\n options.loss_updater->ConvertLabel(&example_label);\n if (!conversion_status.ok()) {\n mutex_lock l(mu);\n train_step_status = conversion_status;\n \/\/ Return from this worker thread - the calling thread is\n \/\/ responsible for checking context status and returning on error.\n return;\n }\n\n \/\/ Compute wx, example norm weighted by regularization, dual loss,\n \/\/ primal loss.\n \/\/ For binary SDCA, num_weight_vectors should be one.\n const ExampleStatistics example_statistics =\n example.ComputeWxAndWeightedExampleNorm(\n options.num_loss_partitions, model_weights,\n options.regularizations, 1 \/* num_weight_vectors *\/);\n\n const double new_dual = options.loss_updater->ComputeUpdatedDual(\n options.num_loss_partitions, example_label, example_weight, dual,\n example_statistics.wx[0], example_statistics.normalized_squared_norm);\n\n \/\/ Compute new weights.\n const double normalized_bounded_dual_delta =\n (new_dual - dual) * example_weight \/\n options.regularizations.symmetric_l2();\n model_weights.UpdateDeltaWeights(\n context->eigen_cpu_device(), example,\n std::vector<double>{normalized_bounded_dual_delta});\n\n \/\/ Update example data.\n example_state_data(example_index, 0) = new_dual;\n example_state_data(example_index, 1) =\n options.loss_updater->ComputePrimalLoss(\n example_statistics.prev_wx[0], example_label, example_weight);\n example_state_data(example_index, 2) =\n options.loss_updater->ComputeDualLoss(dual, example_label,\n example_weight);\n example_state_data(example_index, 3) = example_weight;\n }\n };\n \/\/ TODO(sibyl-Aix6ihai): Tune this properly based on sparsity of the data,\n \/\/ number of cpus, and cost per example.\n const int64 kCostPerUnit = examples.num_features();\n const DeviceBase::CpuWorkerThreads& worker_threads =\n *context->device()->tensorflow_cpu_worker_threads();\n\n Shard(worker_threads.num_threads, worker_threads.workers,\n examples.num_examples(), kCostPerUnit, train_step);\n OP_REQUIRES_OK(context, train_step_status);\n}\n\n} \/\/ namespace\n\nclass SdcaOptimizer : public OpKernel {\n public:\n explicit SdcaOptimizer(OpKernelConstruction* const context)\n : OpKernel(context), options_(context) {}\n\n void Compute(OpKernelContext* context) override {\n DoCompute(options_, context);\n }\n\n private:\n \/\/ TODO(sibyl-Aix6ihai): We could use the type-constraint on loss_type, and\n \/\/ template the entire class to avoid the virtual table lookup penalty in\n \/\/ the inner loop.\n ComputeOptions options_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaOptimizer\").Device(DEVICE_CPU),\n SdcaOptimizer);\n\nclass SdcaShrinkL1 : public OpKernel {\n public:\n explicit SdcaShrinkL1(OpKernelConstruction* const context)\n : OpKernel(context) {\n OP_REQUIRES_OK(context, regularizations_.Initialize(context));\n }\n\n void Compute(OpKernelContext* context) override {\n OpMutableInputList weights_inputs;\n OP_REQUIRES_OK(context,\n context->mutable_input_list(\"weights\", &weights_inputs));\n\n auto do_work = [&](const int64 begin, const int64 end) {\n for (int i = begin; i < end; ++i) {\n auto prox_w = weights_inputs.at(i, \/*lock_held=*\/true).flat<float>();\n prox_w.device(context->eigen_cpu_device()) =\n regularizations_.EigenShrinkVector(prox_w);\n }\n };\n\n if (weights_inputs.size() > 0) {\n int64 num_weights = 0;\n for (int i = 0; i < weights_inputs.size(); ++i) {\n num_weights += weights_inputs.at(i, \/*lock_held=*\/true).NumElements();\n }\n \/\/ TODO(sibyl-Aix6ihai): Tune this value.\n const int64 kCostPerUnit = (num_weights * 50) \/ weights_inputs.size();\n const DeviceBase::CpuWorkerThreads& worker_threads =\n *context->device()->tensorflow_cpu_worker_threads();\n Shard(worker_threads.num_threads, worker_threads.workers,\n weights_inputs.size(), kCostPerUnit, do_work);\n }\n }\n\n private:\n Regularizations regularizations_;\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaShrinkL1\").Device(DEVICE_CPU), SdcaShrinkL1);\n\n\/\/ Computes platform independent, compact and unique (with very high\n\/\/ probability) representation of an example id. It shouldn't be put in\n\/\/ persistent storage, as its implementation may change in the future.\n\/\/\n\/\/ The current probability of at least one collision for 1B example_ids is\n\/\/ approximately 10^-21 (ie 2^60 \/ 2^129).\nclass SdcaFprint : public OpKernel {\n public:\n explicit SdcaFprint(OpKernelConstruction* const context)\n : OpKernel(context) {}\n\n void Compute(OpKernelContext* context) override {\n const Tensor& input = context->input(0);\n OP_REQUIRES(context, TensorShapeUtils::IsVector(input.shape()),\n errors::InvalidArgument(\"Input must be a vector, got shape \",\n input.shape().DebugString()));\n Tensor* out;\n const int64 num_elements = input.NumElements();\n OP_REQUIRES_OK(context, context->allocate_output(\n 0, TensorShape({num_elements, 2}), &out));\n\n const auto in_values = input.flat<string>();\n auto out_values = out->matrix<int64>();\n\n for (int64 i = 0; i < num_elements; ++i) {\n const Fprint128 fprint = Fingerprint128(in_values(i));\n \/\/ Never return 0 or 1 as the first value of the hash to allow these to\n \/\/ safely be used as sentinel values (e.g. dense hash table empty key).\n out_values(i, 0) = TF_PREDICT_TRUE(fprint.low64 >= 2)\n ? fprint.low64\n : fprint.low64 + ~static_cast<uint64>(1);\n out_values(i, 1) = fprint.high64;\n }\n }\n};\nREGISTER_KERNEL_BUILDER(Name(\"SdcaFprint\").Device(DEVICE_CPU), SdcaFprint);\n\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>#include \"qmapboxgl.h\"\n#include \"qmapboxgl_p.h\"\n\n#include <QMouseEvent>\n#include <QOpenGLContext>\n#include <QWheelEvent>\n\n#include <mbgl\/map\/map.hpp>\n#include <mbgl\/platform\/gl.hpp>\n#include <mbgl\/storage\/default_file_source.hpp>\n\nQMapboxGL::QMapboxGL(QWindow *parent)\n : QOpenGLWindow(QOpenGLWindow::NoPartialUpdate, parent)\n , d_ptr(new QMapboxGLPrivate(this))\n{\n QSurfaceFormat format;\n format.setRedBufferSize(8);\n format.setGreenBufferSize(8);\n format.setBlueBufferSize(8);\n format.setStencilBufferSize(8);\n format.setAlphaBufferSize(8);\n format.setDepthBufferSize(16);\n\n setFormat(format);\n}\n\nQMapboxGL::~QMapboxGL()\n{\n delete d_ptr;\n}\n\nvoid QMapboxGL::setAccessToken(const QString &token)\n{\n d_ptr->map.setAccessToken(token.toUtf8().constData());\n}\n\nvoid QMapboxGL::setStyleJSON(const QString &style)\n{\n d_ptr->map.setStyleJSON(style.toUtf8().constData());\n}\n\ndouble QMapboxGL::latitude() const\n{\n return d_ptr->map.getLatLng().latitude;\n}\n\nvoid QMapboxGL::setLatitude(double latitude)\n{\n d_ptr->map.setLatLng({latitude, longitude()});\n}\n\ndouble QMapboxGL::longitude() const\n{\n return d_ptr->map.getLatLng().longitude;\n}\n\nvoid QMapboxGL::setLongitude(double longitude)\n{\n d_ptr->map.setLatLng({latitude(), longitude});\n}\n\ndouble QMapboxGL::zoom() const\n{\n return d_ptr->map.getZoom();\n}\n\nvoid QMapboxGL::setZoom(double zoom)\n{\n d_ptr->map.setZoom(zoom);\n}\n\nvoid QMapboxGL::mousePressEvent(QMouseEvent *ev)\n{\n if (!(ev->buttons() & Qt::LeftButton)) {\n return;\n }\n\n d_ptr->lastX = ev->x();\n d_ptr->lastY = ev->y();\n\n ev->accept();\n}\n\nvoid QMapboxGL::mouseMoveEvent(QMouseEvent *ev)\n{\n if (!(ev->buttons() & Qt::LeftButton)) {\n return;\n }\n\n int dx = ev->x() - d_ptr->lastX;\n int dy = ev->y() - d_ptr->lastY;\n\n d_ptr->lastX = ev->x();\n d_ptr->lastY = ev->y();\n\n if (dx || dy) {\n d_ptr->map.moveBy(dx, dy);\n }\n\n ev->accept();\n}\n\nvoid QMapboxGL::wheelEvent(QWheelEvent *ev)\n{\n QPoint numDegrees = ev->angleDelta();\n\n if (numDegrees.y() > 0) {\n d_ptr->map.scaleBy(1.10, ev->x(), ev->y());\n } else {\n d_ptr->map.scaleBy(0.90, ev->x(), ev->y());\n }\n\n ev->accept();\n}\n\nvoid QMapboxGL::resizeGL(int w, int h)\n{\n \/\/ FIXME: Find out why sprites don't get rendered\n \/\/ correctly if I use 1.0 here.\n d_ptr->map.resize(w, h, 1.00001);\n}\n\nQMapboxGLPrivate::QMapboxGLPrivate(QMapboxGL *q)\n : fileSource(nullptr)\n , map(*this, fileSource)\n , q_ptr(q)\n{\n}\n\nQMapboxGLPrivate::~QMapboxGLPrivate()\n{\n}\n\nvoid QMapboxGLPrivate::deactivate()\n{\n context->doneCurrent();\n}\n\nvoid QMapboxGLPrivate::invalidate(std::function<void()> renderCallback)\n{\n if (!q_ptr->isExposed()) {\n return;\n }\n\n if (!context) {\n context = new QOpenGLContext();\n context->setFormat(q_ptr->requestedFormat());\n context->create();\n context->makeCurrent(q_ptr);\n\n mbgl::gl::InitializeExtensions([](const char *name) {\n QOpenGLContext *thisContext = QOpenGLContext::currentContext();\n return thisContext->getProcAddress(name);\n });\n }\n\n renderCallback();\n\n context->swapBuffers(q_ptr);\n}\n<commit_msg>Updated Mapboxgl API usage to ios-v0.3.2<commit_after>#include \"qmapboxgl.h\"\n#include \"qmapboxgl_p.h\"\n\n#include <QMouseEvent>\n#include <QOpenGLContext>\n#include <QWheelEvent>\n\n#include <mbgl\/map\/map.hpp>\n#include <mbgl\/platform\/gl.hpp>\n#include <mbgl\/storage\/default_file_source.hpp>\n\nQMapboxGL::QMapboxGL(QWindow *parent)\n : QOpenGLWindow(QOpenGLWindow::NoPartialUpdate, parent)\n , d_ptr(new QMapboxGLPrivate(this))\n{\n QSurfaceFormat format;\n format.setRedBufferSize(8);\n format.setGreenBufferSize(8);\n format.setBlueBufferSize(8);\n format.setStencilBufferSize(8);\n format.setAlphaBufferSize(8);\n format.setDepthBufferSize(16);\n\n setFormat(format);\n}\n\nQMapboxGL::~QMapboxGL()\n{\n delete d_ptr;\n}\n\nvoid QMapboxGL::setAccessToken(const QString &token)\n{\n d_ptr->fileSource.setAccessToken(token.toUtf8().constData());\n}\n\nvoid QMapboxGL::setStyleJSON(const QString &style)\n{\n d_ptr->map.setStyleJSON(style.toUtf8().constData());\n}\n\ndouble QMapboxGL::latitude() const\n{\n return d_ptr->map.getLatLng().latitude;\n}\n\nvoid QMapboxGL::setLatitude(double latitude)\n{\n d_ptr->map.setLatLng({latitude, longitude()});\n}\n\ndouble QMapboxGL::longitude() const\n{\n return d_ptr->map.getLatLng().longitude;\n}\n\nvoid QMapboxGL::setLongitude(double longitude)\n{\n d_ptr->map.setLatLng({latitude(), longitude});\n}\n\ndouble QMapboxGL::zoom() const\n{\n return d_ptr->map.getZoom();\n}\n\nvoid QMapboxGL::setZoom(double zoom)\n{\n d_ptr->map.setZoom(zoom);\n}\n\nvoid QMapboxGL::mousePressEvent(QMouseEvent *ev)\n{\n if (!(ev->buttons() & Qt::LeftButton)) {\n return;\n }\n\n d_ptr->lastX = ev->x();\n d_ptr->lastY = ev->y();\n\n ev->accept();\n}\n\nvoid QMapboxGL::mouseMoveEvent(QMouseEvent *ev)\n{\n if (!(ev->buttons() & Qt::LeftButton)) {\n return;\n }\n\n int dx = ev->x() - d_ptr->lastX;\n int dy = ev->y() - d_ptr->lastY;\n\n d_ptr->lastX = ev->x();\n d_ptr->lastY = ev->y();\n\n if (dx || dy) {\n d_ptr->map.moveBy(dx, dy);\n }\n\n ev->accept();\n}\n\nvoid QMapboxGL::wheelEvent(QWheelEvent *ev)\n{\n QPoint numDegrees = ev->angleDelta();\n\n if (numDegrees.y() > 0) {\n d_ptr->map.scaleBy(1.10, ev->x(), ev->y());\n } else {\n d_ptr->map.scaleBy(0.90, ev->x(), ev->y());\n }\n\n ev->accept();\n}\n\nvoid QMapboxGL::resizeGL(int w, int h)\n{\n \/\/ FIXME: Find out why sprites don't get rendered\n \/\/ correctly if I use 1.0 here.\n d_ptr->map.resize(w, h, 1.00001);\n}\n\nQMapboxGLPrivate::QMapboxGLPrivate(QMapboxGL *q)\n : fileSource(nullptr)\n , map(*this, fileSource)\n , q_ptr(q)\n{\n}\n\nQMapboxGLPrivate::~QMapboxGLPrivate()\n{\n}\n\nvoid QMapboxGLPrivate::deactivate()\n{\n context->doneCurrent();\n}\n\nvoid QMapboxGLPrivate::invalidate(std::function<void()> renderCallback)\n{\n if (!q_ptr->isExposed()) {\n return;\n }\n\n if (!context) {\n context = new QOpenGLContext();\n context->setFormat(q_ptr->requestedFormat());\n context->create();\n context->makeCurrent(q_ptr);\n\n mbgl::gl::InitializeExtensions([](const char *name) {\n QOpenGLContext *thisContext = QOpenGLContext::currentContext();\n return thisContext->getProcAddress(name);\n });\n }\n\n renderCallback();\n\n context->swapBuffers(q_ptr);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include <iostream>\n\n#include \"dbn\/rbm.hpp\"\n#include \"dbn\/layer.hpp\"\n#include \"dbn\/conf.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n\n#include \"utils.hpp\"\n\nint main(int argc, char* argv[]){\n auto reconstruction = false;\n auto load = false;\n\n for(int i = 1; i < argc; ++i){\n std::string command(argv[i]);\n\n if(command == \"sample\"){\n reconstruction = true;\n }\n\n if(command == \"load\"){\n load = true;\n }\n }\n\n dbn::rbm<dbn::layer<\n dbn::conf<true, 50, true, false, true, dbn::Type::SIGMOID, dbn::Type::RLU>, \n 28 * 28, 100>> rbm;\n\n auto training_images = mnist::read_training_images<std::vector, vector, double>();\n\n binarize_each(training_images);\n\n if(load){\n std::ifstream is(\"rbm-1.dat\", std::ofstream::binary);\n rbm.load(is);\n } else {\n rbm.train(training_images, 10);\n\n std::ofstream os(\"rbm-1.dat\", std::ofstream::binary);\n rbm.store(os);\n }\n\n if(reconstruction){\n auto test_images = mnist::read_test_images<std::vector, vector, double>();\n binarize_each(test_images);\n\n for(size_t t = 0; t < 10; ++t){\n auto& image = test_images[666 + t];\n\n std::cout << \"Source image\" << std::endl;\n for(size_t i = 0; i < 28; ++i){\n for(size_t j = 0; j < 28; ++j){\n std::cout << static_cast<size_t>(image[i * 28 + j]) << \" \";\n }\n std::cout << std::endl;\n }\n\n rbm.reconstruct(image);\n\n std::cout << \"Reconstructed image\" << std::endl;\n rbm.display_visible_units(28);\n }\n }\n\n return 0;\n}\n<commit_msg>Replace RLU with nRLU<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include <iostream>\n\n#include \"dbn\/rbm.hpp\"\n#include \"dbn\/layer.hpp\"\n#include \"dbn\/conf.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n\n#include \"utils.hpp\"\n\nint main(int argc, char* argv[]){\n auto reconstruction = false;\n auto load = false;\n\n for(int i = 1; i < argc; ++i){\n std::string command(argv[i]);\n\n if(command == \"sample\"){\n reconstruction = true;\n }\n\n if(command == \"load\"){\n load = true;\n }\n }\n\n dbn::rbm<dbn::layer<\n dbn::conf<true, 50, true, false, true, dbn::Type::SIGMOID, dbn::Type::NRLU>, \n 28 * 28, 100>> rbm;\n\n auto training_images = mnist::read_training_images<std::vector, vector, double>();\n\n binarize_each(training_images);\n\n if(load){\n std::ifstream is(\"rbm-1.dat\", std::ofstream::binary);\n rbm.load(is);\n } else {\n rbm.train(training_images, 10);\n\n std::ofstream os(\"rbm-1.dat\", std::ofstream::binary);\n rbm.store(os);\n }\n\n if(reconstruction){\n auto test_images = mnist::read_test_images<std::vector, vector, double>();\n binarize_each(test_images);\n\n for(size_t t = 0; t < 10; ++t){\n auto& image = test_images[666 + t];\n\n std::cout << \"Source image\" << std::endl;\n for(size_t i = 0; i < 28; ++i){\n for(size_t j = 0; j < 28; ++j){\n std::cout << static_cast<size_t>(image[i * 28 + j]) << \" \";\n }\n std::cout << std::endl;\n }\n\n rbm.reconstruct(image);\n\n std::cout << \"Reconstructed image\" << std::endl;\n rbm.display_visible_units(28);\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <limits.h>\n#include \"redis_conn.h\"\n#include \"pink_define.h\"\n#include \"worker_thread.h\"\n#include \"xdebug.h\"\n\n#include <string>\n\nnamespace pink {\nstatic bool IsHexDigit(char ch) {\n return (ch>='0' && ch<='9') || (ch>='a' && ch<='f') || (ch>='A' && ch<'F');\n}\n\nstatic int HexDigitToInt32(char ch) {\n if (ch <= '9' && ch >= '0') {\n return ch-'0';\n } else if (ch <= 'F' && ch >= 'A') {\n return ch-'A';\n } else if (ch <= 'f' && ch >= 'a') {\n return ch-'a';\n } else {\n return 0;\n }\n}\nstatic int split2args(const std::string& req_buf, RedisCmdArgsType& argv) {\n const char *p = req_buf.data();\n std::string arg;\n\n while(1) {\n \/* skip blanks *\/\n while(*p && isspace(*p)) p++;\n if (*p) {\n \/* get a token *\/\n int inq=0; \/* set to 1 if we are in \"quotes\" *\/\n int insq=0; \/* set to 1 if we are in 'single quotes' *\/\n int done=0;\n\n arg.clear();\n while(!done) {\n if (inq) {\n if (*p == '\\\\' && *(p+1) == 'x' &&\n IsHexDigit(*(p+2)) &&\n IsHexDigit(*(p+3))) {\n unsigned char byte = HexDigitToInt32(*(p+2))*16 + HexDigitToInt32(*(p+3));\n arg.append(1, byte);\n p += 3;\n } else if (*p == '\\\\' && *(p+1)) {\n char c;\n\n p++;\n switch(*p) {\n case 'n': c = '\\n'; break;\n case 'r': c = '\\r'; break;\n case 't': c = '\\t'; break;\n case 'b': c = '\\b'; break;\n case 'a': c = '\\a'; break;\n default: c = *p; break;\n }\n arg.append(1, c);\n } else if (*p == '\"') {\n \/* closing quote must be followed by a space or\n * nothing at all. *\/\n if (*(p+1) && !isspace(*(p+1))) {\n argv.clear();\n return -1;\n };\n done=1;\n } else if (!*p) {\n \/* unterminated quotes *\/\n argv.clear();\n return -1;\n } else {\n arg.append(1, *p);\n }\n } else if (insq) {\n if (*p == '\\\\' && *(p+1) == '\\'') {\n p++;\n arg.append(1, '\\'');\n } else if (*p == '\\'') {\n \/* closing quote must be followed by a space or\n * nothing at all. *\/\n if (*(p+1) && !isspace(*(p+1))) {\n argv.clear();\n return -1;\n }\n done=1;\n } else if (!*p) {\n \/* unterminated quotes *\/\n argv.clear();\n return -1;\n } else {\n arg.append(1, *p);\n }\n } else {\n switch(*p) {\n case ' ':\n case '\\n':\n case '\\r':\n case '\\t':\n case '\\0':\n done=1;\n break;\n case '\"':\n inq=1;\n break;\n case '\\'':\n insq=1;\n break;\n default:\n \/\/current = sdscatlen(current,p,1);\n arg.append(1, *p);\n break;\n }\n }\n if (*p) p++;\n }\n argv.push_back(arg);\n } else {\n return 0;\n }\n }\n}\n\nRedisConn::RedisConn(const int fd, const std::string &ip_port) :\n PinkConn(fd, ip_port),\n wbuf_size_(REDIS_MAX_MESSAGE),\n last_read_pos_(-1),\n next_parse_pos_(0),\n req_type_(0),\n multibulk_len_(0),\n bulk_len_(-1),\n is_find_sep_(true),\n is_overtake_(false),\n wbuf_pos_(0),\n wbuf_len_(0)\n{\n rbuf_ = (char *)malloc(sizeof(char) * REDIS_MAX_MESSAGE);\n wbuf_ = (char *)malloc(sizeof(char) * REDIS_MAX_MESSAGE);\n}\n\nRedisConn::~RedisConn()\n{\n free(wbuf_);\n free(rbuf_);\n}\n\nReadStatus RedisConn::ProcessInlineBuffer() {\n int32_t pos, ret;\n pos = FindNextSeparators();\n if (pos == -1 && (last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError;\n }\n if (pos == -1 && (last_read_pos_ + 1) % REDIS_MAX_MESSAGE != next_parse_pos_) {\n return kReadHalf;\n }\n std::string req_buf;\n if (pos > next_parse_pos_) {\n req_buf = std::string(rbuf_ + next_parse_pos_, pos - next_parse_pos_-1);\n } else if (pos == 0) {\n req_buf = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_ - 1);\n } else {\n req_buf = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_) + std::string(rbuf_, pos - 1);\n }\n argv_.clear();\n ret = split2args(req_buf, argv_);\n next_parse_pos_ = (pos+1)%REDIS_MAX_MESSAGE;\n if (ret == -1) {\n return kParseError;\n }\n\n if ((last_read_pos_+1)%REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n return kReadAll;\n}\n\nReadStatus RedisConn::ProcessMultibulkBuffer() {\n int32_t pos;\n if (multibulk_len_ == 0) {\n \/* The client should have been reset *\/;\n\n pos = FindNextSeparators();\n if (pos != -1) {\n if (GetNextNum(pos, &multibulk_len_) != 0) {\n \/\/Protocol error: invalid multibulk length\n return kParseError; \n }\n next_parse_pos_ = (pos + 1) % REDIS_MAX_MESSAGE;\n argv_.clear();\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kReadHalf;\n }\n } else {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError; \/*FULL_ERROR*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n }\n }\n std::string tmp;\n while (!is_overtake_ && multibulk_len_) {\n if (bulk_len_ == -1) {\n pos = FindNextSeparators();\n if (pos != -1) {\n if (rbuf_[next_parse_pos_] != '$') {\n return kParseError;\/\/PARSE_ERROR\n }\n\n if (GetNextNum(pos, &bulk_len_) != 0) {\n \/\/Protocol error: invalid bulk length\n return kParseError; \n }\n next_parse_pos_ = (pos + 1) % REDIS_MAX_MESSAGE;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kReadHalf;\n }\n } else {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError; \/*FULL_ERROR*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n }\n }\n if (next_parse_pos_ <= last_read_pos_) {\n if (last_read_pos_ - next_parse_pos_ + 1 < bulk_len_ + 2) {\n break;\n } else {\n argv_.push_back(std::string(rbuf_ + next_parse_pos_, bulk_len_));\n next_parse_pos_ = (next_parse_pos_ + (bulk_len_ + 2)) % REDIS_MAX_MESSAGE;\n bulk_len_ = -1;\n multibulk_len_--;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n }\n } else {\n if (REDIS_MAX_MESSAGE - next_parse_pos_ + last_read_pos_ + 1 < bulk_len_ + 2) {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError;\n }\n break;\n } else {\n if (REDIS_MAX_MESSAGE - next_parse_pos_ >= bulk_len_) {\n argv_.push_back(std::string(rbuf_ + next_parse_pos_, bulk_len_));\n } else {\n tmp = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_) + std::string(rbuf_, bulk_len_ - (REDIS_MAX_MESSAGE - next_parse_pos_));\n argv_.push_back(tmp);\n }\n next_parse_pos_ = bulk_len_ - (REDIS_MAX_MESSAGE - next_parse_pos_) + 2;\n bulk_len_ = -1;\n multibulk_len_--;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n }\n }\n }\n\n if (multibulk_len_ == 0) {\n return kReadAll; \/*OK*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n}\n\nvoid RedisConn::ResetClient() {\n argv_.clear();\n req_type_ = 0;\n multibulk_len_ = 0;\n bulk_len_ = -1;\n}\n\nbool RedisConn::ExpandWbuf() {\n if (wbuf_size_ >= REDIS_MAX_MESSAGE * 32) {\n return false;\n }\n wbuf_size_ *= 2;\n wbuf_ = (char*)realloc(wbuf_, wbuf_size_);\n return true;\n}\n\nReadStatus RedisConn::ProcessInputBuffer() {\n ReadStatus ret;\n while (!is_overtake_) {\n if (!req_type_) {\n if (rbuf_[next_parse_pos_] == '*') {\n req_type_ = REDIS_REQ_MULTIBULK;\n } else {\n req_type_ = REDIS_REQ_INLINE;\n }\n }\n\n if (req_type_ == REDIS_REQ_INLINE) {\n ret = ProcessInlineBuffer();\n if (ret != kReadAll) {\n return ret;\n }\n } else if (req_type_ == REDIS_REQ_MULTIBULK) {\n ret = ProcessMultibulkBuffer();\n if (ret != kReadAll\/*OK*\/) { \/\/FULL_ERROR || HALF || PARSE_ERROR\n return ret;\n }\n } else {\n \/\/Unknown requeset type;\n return kParseError;\n }\n\n if (argv_.size() == 0) {\n ResetClient();\n } else {\n DealMessage(); \n }\n }\n req_type_ = 0;\n next_parse_pos_ = 0;\n last_read_pos_ = -1;\n return kReadAll;\/*OK*\/\n}\n\nReadStatus RedisConn::GetRequest()\n{\n ssize_t nread = 0;\n int32_t next_read_pos = (last_read_pos_ + 1) % REDIS_MAX_MESSAGE;\n int32_t read_len = 0;\n if (next_read_pos == next_parse_pos_ && !is_find_sep_) {\n \/\/too big message, close client;\n \/\/err_msg_ = \"-ERR: Protocol error: too big mbulk count string\\r\\n\"; \n return kParseError;\n } else if (next_read_pos >= next_parse_pos_) {\n read_len = REDIS_IOBUF_LEN < (REDIS_MAX_MESSAGE - next_read_pos) ? REDIS_IOBUF_LEN : (REDIS_MAX_MESSAGE - next_read_pos);\n } else if (next_read_pos < next_parse_pos_) {\n read_len = next_parse_pos_ - next_read_pos;\n } \n\n nread = read(fd(), rbuf_ + next_read_pos, read_len);\n if (nread == -1) {\n if (errno == EAGAIN) {\n nread = 0;\n return kReadHalf; \/\/HALF\n } else {\n \/\/ error happened, close client\n return kReadError;\n }\n } else if (nread == 0) {\n \/\/ client closed, close client\n return kReadClose;\n }\n\n if (nread) {\n last_read_pos_ = (last_read_pos_ + nread) % REDIS_MAX_MESSAGE;\n is_overtake_ = false;\n }\n ReadStatus ret = ProcessInputBuffer();\n if (ret == kFullError\/*FULL_ERROR*\/) {\n is_find_sep_ = false;\n }\n return ret; \/\/OK || HALF || FULL_ERROR || PARSE_ERROR\n}\n\nWriteStatus RedisConn::SendReply()\n{\n ssize_t nwritten = 0;\n while (wbuf_len_ > 0) {\n nwritten = write(fd(), wbuf_ + wbuf_pos_, wbuf_len_ - wbuf_pos_);\n if (nwritten <= 0) {\n break;\n }\n wbuf_pos_ += nwritten;\n if (wbuf_pos_ == wbuf_len_) {\n wbuf_len_ = 0;\n wbuf_pos_ = 0;\n }\n }\n if (nwritten == -1) {\n if (errno == EAGAIN) {\n return kWriteHalf;\n } else {\n \/\/ Here we should close the connection\n return kWriteError;\n }\n }\n if (wbuf_len_ == 0) {\n return kWriteAll;\n } else {\n return kWriteHalf;\n }\n}\n\nint32_t RedisConn::FindNextSeparators() {\n int pos;\n if (next_parse_pos_ <= last_read_pos_) {\n pos = next_parse_pos_;\n } else {\n pos = 0;\n }\n while (pos <= last_read_pos_) {\n if (rbuf_[pos] == '\\n') {\n return pos;\n }\n pos++;\n }\n return -1;\n}\n\nint32_t RedisConn::GetNextNum(int32_t pos, int32_t *value) {\n std::string tmp;\n if (pos > next_parse_pos_) {\n \/\/ [next_parse_pos_ + 1, pos - next_parse_pos_- 2]\n tmp = std::string(rbuf_ + next_parse_pos_ + 1, pos - next_parse_pos_ - 2);\n } else {\n if (pos != 0) {\n tmp = std::string(rbuf_ + ((next_parse_pos_ + 1) % REDIS_MAX_MESSAGE), REDIS_MAX_MESSAGE - next_parse_pos_ - 1) + std::string(rbuf_, pos - 1);\n } else {\n tmp = std::string(rbuf_ + ((next_parse_pos_ + 1) % REDIS_MAX_MESSAGE), REDIS_MAX_MESSAGE - next_parse_pos_ - 1);\n }\n \/\/ [next_parse_pos_ + 1, REDIS_MAX_MESSAGE - next_parse_pos_ - 1] + [0, pos - 1]\n }\n\n char* end;\n errno = 0;\n long num = strtol(tmp.c_str(), &end, 10);\n if ((num == 0 && errno == EINVAL) || \n ((num == LONG_MAX || num == LONG_MIN) && errno == ERANGE)) {\n return -1;\n }\n\n if (value) *value = static_cast<int32_t>(num);\n return 0;\n}\n}\n<commit_msg>bugfix: reset wbuf_pos_ = 0 when expandwbuf error<commit_after>#include <stdlib.h>\n#include <limits.h>\n#include \"redis_conn.h\"\n#include \"pink_define.h\"\n#include \"worker_thread.h\"\n#include \"xdebug.h\"\n\n#include <string>\n\nnamespace pink {\nstatic bool IsHexDigit(char ch) {\n return (ch>='0' && ch<='9') || (ch>='a' && ch<='f') || (ch>='A' && ch<'F');\n}\n\nstatic int HexDigitToInt32(char ch) {\n if (ch <= '9' && ch >= '0') {\n return ch-'0';\n } else if (ch <= 'F' && ch >= 'A') {\n return ch-'A';\n } else if (ch <= 'f' && ch >= 'a') {\n return ch-'a';\n } else {\n return 0;\n }\n}\nstatic int split2args(const std::string& req_buf, RedisCmdArgsType& argv) {\n const char *p = req_buf.data();\n std::string arg;\n\n while(1) {\n \/* skip blanks *\/\n while(*p && isspace(*p)) p++;\n if (*p) {\n \/* get a token *\/\n int inq=0; \/* set to 1 if we are in \"quotes\" *\/\n int insq=0; \/* set to 1 if we are in 'single quotes' *\/\n int done=0;\n\n arg.clear();\n while(!done) {\n if (inq) {\n if (*p == '\\\\' && *(p+1) == 'x' &&\n IsHexDigit(*(p+2)) &&\n IsHexDigit(*(p+3))) {\n unsigned char byte = HexDigitToInt32(*(p+2))*16 + HexDigitToInt32(*(p+3));\n arg.append(1, byte);\n p += 3;\n } else if (*p == '\\\\' && *(p+1)) {\n char c;\n\n p++;\n switch(*p) {\n case 'n': c = '\\n'; break;\n case 'r': c = '\\r'; break;\n case 't': c = '\\t'; break;\n case 'b': c = '\\b'; break;\n case 'a': c = '\\a'; break;\n default: c = *p; break;\n }\n arg.append(1, c);\n } else if (*p == '\"') {\n \/* closing quote must be followed by a space or\n * nothing at all. *\/\n if (*(p+1) && !isspace(*(p+1))) {\n argv.clear();\n return -1;\n };\n done=1;\n } else if (!*p) {\n \/* unterminated quotes *\/\n argv.clear();\n return -1;\n } else {\n arg.append(1, *p);\n }\n } else if (insq) {\n if (*p == '\\\\' && *(p+1) == '\\'') {\n p++;\n arg.append(1, '\\'');\n } else if (*p == '\\'') {\n \/* closing quote must be followed by a space or\n * nothing at all. *\/\n if (*(p+1) && !isspace(*(p+1))) {\n argv.clear();\n return -1;\n }\n done=1;\n } else if (!*p) {\n \/* unterminated quotes *\/\n argv.clear();\n return -1;\n } else {\n arg.append(1, *p);\n }\n } else {\n switch(*p) {\n case ' ':\n case '\\n':\n case '\\r':\n case '\\t':\n case '\\0':\n done=1;\n break;\n case '\"':\n inq=1;\n break;\n case '\\'':\n insq=1;\n break;\n default:\n \/\/current = sdscatlen(current,p,1);\n arg.append(1, *p);\n break;\n }\n }\n if (*p) p++;\n }\n argv.push_back(arg);\n } else {\n return 0;\n }\n }\n}\n\nRedisConn::RedisConn(const int fd, const std::string &ip_port) :\n PinkConn(fd, ip_port),\n wbuf_size_(REDIS_MAX_MESSAGE),\n last_read_pos_(-1),\n next_parse_pos_(0),\n req_type_(0),\n multibulk_len_(0),\n bulk_len_(-1),\n is_find_sep_(true),\n is_overtake_(false),\n wbuf_pos_(0),\n wbuf_len_(0)\n{\n rbuf_ = (char *)malloc(sizeof(char) * REDIS_MAX_MESSAGE);\n wbuf_ = (char *)malloc(sizeof(char) * REDIS_MAX_MESSAGE);\n}\n\nRedisConn::~RedisConn()\n{\n free(wbuf_);\n free(rbuf_);\n}\n\nReadStatus RedisConn::ProcessInlineBuffer() {\n int32_t pos, ret;\n pos = FindNextSeparators();\n if (pos == -1 && (last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError;\n }\n if (pos == -1 && (last_read_pos_ + 1) % REDIS_MAX_MESSAGE != next_parse_pos_) {\n return kReadHalf;\n }\n std::string req_buf;\n if (pos > next_parse_pos_) {\n req_buf = std::string(rbuf_ + next_parse_pos_, pos - next_parse_pos_-1);\n } else if (pos == 0) {\n req_buf = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_ - 1);\n } else {\n req_buf = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_) + std::string(rbuf_, pos - 1);\n }\n argv_.clear();\n ret = split2args(req_buf, argv_);\n next_parse_pos_ = (pos+1)%REDIS_MAX_MESSAGE;\n if (ret == -1) {\n return kParseError;\n }\n\n if ((last_read_pos_+1)%REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n return kReadAll;\n}\n\nReadStatus RedisConn::ProcessMultibulkBuffer() {\n int32_t pos;\n if (multibulk_len_ == 0) {\n \/* The client should have been reset *\/;\n\n pos = FindNextSeparators();\n if (pos != -1) {\n if (GetNextNum(pos, &multibulk_len_) != 0) {\n \/\/Protocol error: invalid multibulk length\n return kParseError; \n }\n next_parse_pos_ = (pos + 1) % REDIS_MAX_MESSAGE;\n argv_.clear();\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kReadHalf;\n }\n } else {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError; \/*FULL_ERROR*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n }\n }\n std::string tmp;\n while (!is_overtake_ && multibulk_len_) {\n if (bulk_len_ == -1) {\n pos = FindNextSeparators();\n if (pos != -1) {\n if (rbuf_[next_parse_pos_] != '$') {\n return kParseError;\/\/PARSE_ERROR\n }\n\n if (GetNextNum(pos, &bulk_len_) != 0) {\n \/\/Protocol error: invalid bulk length\n return kParseError; \n }\n next_parse_pos_ = (pos + 1) % REDIS_MAX_MESSAGE;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kReadHalf;\n }\n } else {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError; \/*FULL_ERROR*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n }\n }\n if (next_parse_pos_ <= last_read_pos_) {\n if (last_read_pos_ - next_parse_pos_ + 1 < bulk_len_ + 2) {\n break;\n } else {\n argv_.push_back(std::string(rbuf_ + next_parse_pos_, bulk_len_));\n next_parse_pos_ = (next_parse_pos_ + (bulk_len_ + 2)) % REDIS_MAX_MESSAGE;\n bulk_len_ = -1;\n multibulk_len_--;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n }\n } else {\n if (REDIS_MAX_MESSAGE - next_parse_pos_ + last_read_pos_ + 1 < bulk_len_ + 2) {\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n return kFullError;\n }\n break;\n } else {\n if (REDIS_MAX_MESSAGE - next_parse_pos_ >= bulk_len_) {\n argv_.push_back(std::string(rbuf_ + next_parse_pos_, bulk_len_));\n } else {\n tmp = std::string(rbuf_ + next_parse_pos_, REDIS_MAX_MESSAGE - next_parse_pos_) + std::string(rbuf_, bulk_len_ - (REDIS_MAX_MESSAGE - next_parse_pos_));\n argv_.push_back(tmp);\n }\n next_parse_pos_ = bulk_len_ - (REDIS_MAX_MESSAGE - next_parse_pos_) + 2;\n bulk_len_ = -1;\n multibulk_len_--;\n if ((last_read_pos_ + 1) % REDIS_MAX_MESSAGE == next_parse_pos_) {\n is_overtake_ = true;\n }\n }\n }\n }\n\n if (multibulk_len_ == 0) {\n return kReadAll; \/*OK*\/\n } else {\n return kReadHalf; \/*HALF*\/\n }\n}\n\nvoid RedisConn::ResetClient() {\n argv_.clear();\n req_type_ = 0;\n multibulk_len_ = 0;\n bulk_len_ = -1;\n}\n\nbool RedisConn::ExpandWbuf() {\n if (wbuf_size_ >= REDIS_MAX_MESSAGE * 32) {\n wbuf_pos_ = 0;\n return false;\n }\n wbuf_size_ *= 2;\n wbuf_ = (char*)realloc(wbuf_, wbuf_size_);\n return true;\n}\n\nReadStatus RedisConn::ProcessInputBuffer() {\n ReadStatus ret;\n while (!is_overtake_) {\n if (!req_type_) {\n if (rbuf_[next_parse_pos_] == '*') {\n req_type_ = REDIS_REQ_MULTIBULK;\n } else {\n req_type_ = REDIS_REQ_INLINE;\n }\n }\n\n if (req_type_ == REDIS_REQ_INLINE) {\n ret = ProcessInlineBuffer();\n if (ret != kReadAll) {\n return ret;\n }\n } else if (req_type_ == REDIS_REQ_MULTIBULK) {\n ret = ProcessMultibulkBuffer();\n if (ret != kReadAll\/*OK*\/) { \/\/FULL_ERROR || HALF || PARSE_ERROR\n return ret;\n }\n } else {\n \/\/Unknown requeset type;\n return kParseError;\n }\n\n if (argv_.size() == 0) {\n ResetClient();\n } else {\n DealMessage(); \n }\n }\n req_type_ = 0;\n next_parse_pos_ = 0;\n last_read_pos_ = -1;\n return kReadAll;\/*OK*\/\n}\n\nReadStatus RedisConn::GetRequest()\n{\n ssize_t nread = 0;\n int32_t next_read_pos = (last_read_pos_ + 1) % REDIS_MAX_MESSAGE;\n int32_t read_len = 0;\n if (next_read_pos == next_parse_pos_ && !is_find_sep_) {\n \/\/too big message, close client;\n \/\/err_msg_ = \"-ERR: Protocol error: too big mbulk count string\\r\\n\"; \n return kParseError;\n } else if (next_read_pos >= next_parse_pos_) {\n read_len = REDIS_IOBUF_LEN < (REDIS_MAX_MESSAGE - next_read_pos) ? REDIS_IOBUF_LEN : (REDIS_MAX_MESSAGE - next_read_pos);\n } else if (next_read_pos < next_parse_pos_) {\n read_len = next_parse_pos_ - next_read_pos;\n } \n\n nread = read(fd(), rbuf_ + next_read_pos, read_len);\n if (nread == -1) {\n if (errno == EAGAIN) {\n nread = 0;\n return kReadHalf; \/\/HALF\n } else {\n \/\/ error happened, close client\n return kReadError;\n }\n } else if (nread == 0) {\n \/\/ client closed, close client\n return kReadClose;\n }\n\n if (nread) {\n last_read_pos_ = (last_read_pos_ + nread) % REDIS_MAX_MESSAGE;\n is_overtake_ = false;\n }\n ReadStatus ret = ProcessInputBuffer();\n if (ret == kFullError\/*FULL_ERROR*\/) {\n is_find_sep_ = false;\n }\n return ret; \/\/OK || HALF || FULL_ERROR || PARSE_ERROR\n}\n\nWriteStatus RedisConn::SendReply()\n{\n ssize_t nwritten = 0;\n while (wbuf_len_ > 0) {\n nwritten = write(fd(), wbuf_ + wbuf_pos_, wbuf_len_ - wbuf_pos_);\n if (nwritten <= 0) {\n break;\n }\n wbuf_pos_ += nwritten;\n if (wbuf_pos_ == wbuf_len_) {\n wbuf_len_ = 0;\n wbuf_pos_ = 0;\n }\n }\n if (nwritten == -1) {\n if (errno == EAGAIN) {\n return kWriteHalf;\n } else {\n \/\/ Here we should close the connection\n return kWriteError;\n }\n }\n if (wbuf_len_ == 0) {\n return kWriteAll;\n } else {\n return kWriteHalf;\n }\n}\n\nint32_t RedisConn::FindNextSeparators() {\n int pos;\n if (next_parse_pos_ <= last_read_pos_) {\n pos = next_parse_pos_;\n } else {\n pos = 0;\n }\n while (pos <= last_read_pos_) {\n if (rbuf_[pos] == '\\n') {\n return pos;\n }\n pos++;\n }\n return -1;\n}\n\nint32_t RedisConn::GetNextNum(int32_t pos, int32_t *value) {\n std::string tmp;\n if (pos > next_parse_pos_) {\n \/\/ [next_parse_pos_ + 1, pos - next_parse_pos_- 2]\n tmp = std::string(rbuf_ + next_parse_pos_ + 1, pos - next_parse_pos_ - 2);\n } else {\n if (pos != 0) {\n tmp = std::string(rbuf_ + ((next_parse_pos_ + 1) % REDIS_MAX_MESSAGE), REDIS_MAX_MESSAGE - next_parse_pos_ - 1) + std::string(rbuf_, pos - 1);\n } else {\n tmp = std::string(rbuf_ + ((next_parse_pos_ + 1) % REDIS_MAX_MESSAGE), REDIS_MAX_MESSAGE - next_parse_pos_ - 1);\n }\n \/\/ [next_parse_pos_ + 1, REDIS_MAX_MESSAGE - next_parse_pos_ - 1] + [0, pos - 1]\n }\n\n char* end;\n errno = 0;\n long num = strtol(tmp.c_str(), &end, 10);\n if ((num == 0 && errno == EINVAL) || \n ((num == LONG_MAX || num == LONG_MIN) && errno == ERANGE)) {\n return -1;\n }\n\n if (value) *value = static_cast<int32_t>(num);\n return 0;\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 1994-2019 Leonid Yuriev <leo@yuriev.ru>.\n * https:\/\/github.com\/leo-yuriev\/erthink\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifdef _MSC_VER\n#define _USE_MATH_DEFINES\n#endif\n\n#include \"erthink_d2a.h\"\n#include \"erthink_defs.h\"\n#include \"testing.h\"\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#pragma warning(disable : 4710) \/* function not inlined *\/\n#endif\n#include <cfloat> \/\/ for FLT_MAX, etc\n#include <cmath> \/\/ for M_PI, etc\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n__hot __dll_export __noinline char *_d2a(const double value, char *ptr) {\n return erthink::d2a(value, ptr);\n}\n\n\/\/------------------------------------------------------------------------------\n\nstatic void probe_d2a(char (&buffer)[23 + 1], const double value) {\n char *d2a_end = _d2a(value, buffer);\n ASSERT_LT(buffer, d2a_end);\n ASSERT_GT(erthink::array_end(buffer), d2a_end);\n *d2a_end = '\\0';\n\n char *strtod_end = nullptr;\n double probe = strtod(buffer, &strtod_end);\n EXPECT_EQ(d2a_end, strtod_end);\n EXPECT_EQ(value, probe);\n}\n\nTEST(d2a, trivia) {\n char buffer[23 + 1];\n char *end = _d2a(0, buffer);\n EXPECT_EQ(1, end - buffer);\n EXPECT_EQ(buffer[0], '0');\n\n probe_d2a(buffer, 0.0);\n probe_d2a(buffer, 1.0);\n probe_d2a(buffer, 2.0);\n probe_d2a(buffer, 3.0);\n probe_d2a(buffer, -0.0);\n probe_d2a(buffer, -1.0);\n probe_d2a(buffer, -2.0);\n probe_d2a(buffer, -3.0);\n probe_d2a(buffer, M_PI);\n probe_d2a(buffer, -M_PI);\n\n probe_d2a(buffer, INT32_MIN);\n probe_d2a(buffer, INT32_MAX);\n probe_d2a(buffer, UINT16_MAX);\n probe_d2a(buffer, UINT32_MAX);\n probe_d2a(buffer, FLT_MAX);\n probe_d2a(buffer, -FLT_MAX);\n probe_d2a(buffer, FLT_MAX);\n probe_d2a(buffer, -FLT_MAX);\n probe_d2a(buffer, FLT_MIN);\n probe_d2a(buffer, -FLT_MIN);\n probe_d2a(buffer, FLT_MAX * M_PI);\n probe_d2a(buffer, -FLT_MAX * M_PI);\n probe_d2a(buffer, FLT_MIN * M_PI);\n probe_d2a(buffer, -FLT_MIN * M_PI);\n\n probe_d2a(buffer, DBL_MAX);\n probe_d2a(buffer, -DBL_MAX);\n probe_d2a(buffer, DBL_MIN);\n probe_d2a(buffer, -DBL_MIN);\n probe_d2a(buffer, DBL_MAX \/ M_PI);\n probe_d2a(buffer, -DBL_MAX \/ M_PI);\n probe_d2a(buffer, DBL_MIN * M_PI);\n probe_d2a(buffer, -DBL_MIN * M_PI);\n}\n\nstatic bool probe_d2a(uint64_t u64, char (&buffer)[23 + 1]) {\n erthink::grisu::casting_union casting(u64);\n switch (std::fpclassify(casting.f)) {\n case FP_NAN:\n case FP_INFINITE:\n return false;\n default:\n probe_d2a(buffer, casting.f);\n }\n\n const float f32 = static_cast<float>(casting.f);\n switch (std::fpclassify(f32)) {\n case FP_NAN:\n case FP_INFINITE:\n return false;\n default:\n probe_d2a(buffer, f32);\n return true;\n }\n}\n\nTEST(d2a, stairwell) {\n char buffer[23 + 1];\n probe_d2a(UINT64_C(4989988387303176888), buffer);\n probe_d2a(UINT64_C(4895412794877399892), buffer);\n probe_d2a(UINT64_C(13717964465041107931), buffer);\n probe_d2a(UINT64_C(13416223289762161370), buffer);\n probe_d2a(UINT64_C(13434237688651515774), buffer);\n probe_d2a(UINT64_C(5008002785836588600), buffer);\n probe_d2a(UINT64_C(4210865651786747166), buffer);\n probe_d2a(UINT64_C(14231374822717078073), buffer);\n probe_d2a(UINT64_C(13434237688189056622), buffer);\n probe_d2a(UINT64_C(13717964465155820979), buffer);\n probe_d2a(UINT64_C(4237887249171175423), buffer);\n probe_d2a(UINT64_C(13632396072180810313), buffer);\n\n const double up = 1.1283791670955125739 \/* 2\/sqrt(pi) *\/;\n for (double value = DBL_MIN * up; value < DBL_MAX \/ up; value *= up) {\n probe_d2a(buffer, value);\n const float f32 = static_cast<float>(value);\n if (!std::isinf(f32))\n probe_d2a(buffer, f32);\n }\n\n const double down = 0.91893853320467274178 \/* ln(sqrt(2pi)) *\/;\n for (double value = DBL_MAX * down; value > DBL_MIN \/ down; value *= down) {\n probe_d2a(buffer, value);\n const float f32 = static_cast<float>(value);\n if (!std::isinf(f32))\n probe_d2a(buffer, f32);\n }\n\n for (uint64_t mantissa = erthink::grisu::IEEE754_DOUBLE_MANTISSA_MASK;\n mantissa != 0; mantissa >>= 1) {\n for (uint64_t offset = 1; offset < mantissa; offset <<= 1) {\n for (uint64_t exp = 0;\n exp <= erthink::grisu::IEEE754_DOUBLE_EXPONENT_MASK;\n exp += erthink::grisu::IEEE754_DOUBLE_IMPLICIT_LEAD) {\n probe_d2a((mantissa + offset) ^ exp, buffer);\n probe_d2a((mantissa - offset) ^ exp, buffer);\n }\n }\n }\n}\n\nTEST(d2a, random3e6) {\n char buffer[23 + 1];\n uint64_t prng(uint64_t(time(0)));\n SCOPED_TRACE(\"PGNG seed=\" + std::to_string(prng));\n for (int i = 0; i < 3333333;) {\n i += probe_d2a(prng, buffer);\n prng *= UINT64_C(6364136223846793005);\n prng += UINT64_C(1442695040888963407);\n }\n}\n\n\/\/------------------------------------------------------------------------------\n\nint main(int argc, char **argv) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<commit_msg>erthink: d2a-test: adds SHOW_LAST_DIGIT_ROUNDING_INACCURACY option.<commit_after>\/*\n * Copyright (c) 1994-2019 Leonid Yuriev <leo@yuriev.ru>.\n * https:\/\/github.com\/leo-yuriev\/erthink\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifdef _MSC_VER\n#define _USE_MATH_DEFINES\n#endif\n\n#include \"erthink_d2a.h\"\n#include \"erthink_defs.h\"\n#include \"testing.h\"\n\n#ifdef _MSC_VER\n#pragma warning(push, 1)\n#pragma warning(disable : 4710) \/* function not inlined *\/\n#endif\n#include <cfloat> \/\/ for FLT_MAX, etc\n#include <cmath> \/\/ for M_PI, etc\n#ifdef _MSC_VER\n#pragma warning(pop)\n#endif\n\n__hot __dll_export __noinline char *_d2a(const double value, char *ptr) {\n return erthink::d2a(value, ptr);\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ #define SHOW_LAST_DIGIT_ROUNDING_INACCURACY\n#ifdef SHOW_LAST_DIGIT_ROUNDING_INACCURACY\nstatic std::tuple<bool, int, int> mantissa_str_diff(const char *a,\n const char *b) {\n int i = 0, j = 0;\n for (;;) {\n if (a[i] == '.')\n i++;\n const bool a_end = (a[i] == 'e' || a[i] == 'E' || a[i] == '\\0');\n\n if (b[j] == '.')\n j++;\n const bool b_end = (b[j] == 'e' || b[j] == 'E' || b[j] == '\\0');\n\n if (a_end && b_end)\n break;\n\n const char a_digit = a_end ? '0' : a[i];\n const char b_digit = b_end ? '0' : b[j];\n if (a_digit != b_digit)\n return std::make_tuple(true, i, j);\n\n i += !a_end;\n j += !b_end;\n }\n return std::make_tuple(false, 0, 0);\n}\n#endif \/* SHOW_LAST_DIGIT_ROUNDING_INACCURACY *\/\n\nstatic void probe_d2a(char (&buffer)[23 + 1], const double value) {\n char *d2a_end = _d2a(value, buffer);\n ASSERT_LT(buffer, d2a_end);\n ASSERT_GT(erthink::array_end(buffer), d2a_end);\n *d2a_end = '\\0';\n\n char *strtod_end = nullptr;\n double probe = strtod(buffer, &strtod_end);\n EXPECT_EQ(d2a_end, strtod_end);\n EXPECT_EQ(value, probe);\n\n#ifdef SHOW_LAST_DIGIT_ROUNDING_INACCURACY\n int i = 0;\n const char *s = buffer;\n for (;;) {\n if (*s == '-' || *s == '.')\n s++;\n else if (s[i] >= '0' && s[i] <= '9')\n i++;\n else\n break;\n }\n char print_buffer[32];\n snprintf(print_buffer, sizeof(print_buffer), \"%.*e\", i - 1, value);\n const auto diff = mantissa_str_diff(buffer, print_buffer);\n if (std::get<0>(diff)) {\n printf(\"d2a:%s <> printf:%s\\n\"\n \"%*c%*c\\n\",\n buffer, print_buffer, std::get<1>(diff) + 5, '^',\n std::get<2>(diff) + 16, '^');\n fflush(nullptr);\n }\n#endif \/* SHOW_LAST_DIGIT_ROUNDING_INACCURACY *\/\n}\n\nTEST(d2a, trivia) {\n char buffer[23 + 1];\n char *end = _d2a(0, buffer);\n EXPECT_EQ(1, end - buffer);\n EXPECT_EQ(buffer[0], '0');\n\n probe_d2a(buffer, 0.0);\n probe_d2a(buffer, 1.0);\n probe_d2a(buffer, 2.0);\n probe_d2a(buffer, 3.0);\n probe_d2a(buffer, -0.0);\n probe_d2a(buffer, -1.0);\n probe_d2a(buffer, -2.0);\n probe_d2a(buffer, -3.0);\n probe_d2a(buffer, M_PI);\n probe_d2a(buffer, -M_PI);\n\n probe_d2a(buffer, INT32_MIN);\n probe_d2a(buffer, INT32_MAX);\n probe_d2a(buffer, UINT16_MAX);\n probe_d2a(buffer, UINT32_MAX);\n probe_d2a(buffer, FLT_MAX);\n probe_d2a(buffer, -FLT_MAX);\n probe_d2a(buffer, FLT_MAX);\n probe_d2a(buffer, -FLT_MAX);\n probe_d2a(buffer, FLT_MIN);\n probe_d2a(buffer, -FLT_MIN);\n probe_d2a(buffer, FLT_MAX * M_PI);\n probe_d2a(buffer, -FLT_MAX * M_PI);\n probe_d2a(buffer, FLT_MIN * M_PI);\n probe_d2a(buffer, -FLT_MIN * M_PI);\n\n probe_d2a(buffer, DBL_MAX);\n probe_d2a(buffer, -DBL_MAX);\n probe_d2a(buffer, DBL_MIN);\n probe_d2a(buffer, -DBL_MIN);\n probe_d2a(buffer, DBL_MAX \/ M_PI);\n probe_d2a(buffer, -DBL_MAX \/ M_PI);\n probe_d2a(buffer, DBL_MIN * M_PI);\n probe_d2a(buffer, -DBL_MIN * M_PI);\n}\n\nstatic bool probe_d2a(uint64_t u64, char (&buffer)[23 + 1]) {\n erthink::grisu::casting_union casting(u64);\n switch (std::fpclassify(casting.f)) {\n case FP_NAN:\n case FP_INFINITE:\n return false;\n default:\n probe_d2a(buffer, casting.f);\n }\n\n const float f32 = static_cast<float>(casting.f);\n switch (std::fpclassify(f32)) {\n case FP_NAN:\n case FP_INFINITE:\n return false;\n default:\n probe_d2a(buffer, f32);\n return true;\n }\n}\n\nTEST(d2a, stairwell) {\n char buffer[23 + 1];\n probe_d2a(UINT64_C(4989988387303176888), buffer);\n probe_d2a(UINT64_C(4895412794877399892), buffer);\n probe_d2a(UINT64_C(13717964465041107931), buffer);\n probe_d2a(UINT64_C(13416223289762161370), buffer);\n probe_d2a(UINT64_C(13434237688651515774), buffer);\n probe_d2a(UINT64_C(5008002785836588600), buffer);\n probe_d2a(UINT64_C(4210865651786747166), buffer);\n probe_d2a(UINT64_C(14231374822717078073), buffer);\n probe_d2a(UINT64_C(13434237688189056622), buffer);\n probe_d2a(UINT64_C(13717964465155820979), buffer);\n probe_d2a(UINT64_C(4237887249171175423), buffer);\n probe_d2a(UINT64_C(13632396072180810313), buffer);\n\n const double up = 1.1283791670955125739 \/* 2\/sqrt(pi) *\/;\n for (double value = DBL_MIN * up; value < DBL_MAX \/ up; value *= up) {\n probe_d2a(buffer, value);\n const float f32 = static_cast<float>(value);\n if (!std::isinf(f32))\n probe_d2a(buffer, f32);\n }\n\n const double down = 0.91893853320467274178 \/* ln(sqrt(2pi)) *\/;\n for (double value = DBL_MAX * down; value > DBL_MIN \/ down; value *= down) {\n probe_d2a(buffer, value);\n const float f32 = static_cast<float>(value);\n if (!std::isinf(f32))\n probe_d2a(buffer, f32);\n }\n\n for (uint64_t mantissa = erthink::grisu::IEEE754_DOUBLE_MANTISSA_MASK;\n mantissa != 0; mantissa >>= 1) {\n for (uint64_t offset = 1; offset < mantissa; offset <<= 1) {\n for (uint64_t exp = 0;\n exp <= erthink::grisu::IEEE754_DOUBLE_EXPONENT_MASK;\n exp += erthink::grisu::IEEE754_DOUBLE_IMPLICIT_LEAD) {\n probe_d2a((mantissa + offset) ^ exp, buffer);\n probe_d2a((mantissa - offset) ^ exp, buffer);\n }\n }\n }\n}\n\nTEST(d2a, random3e6) {\n char buffer[23 + 1];\n uint64_t prng(uint64_t(time(0)));\n SCOPED_TRACE(\"PGNG seed=\" + std::to_string(prng));\n for (int i = 0; i < 3333333;) {\n i += probe_d2a(prng, buffer);\n prng *= UINT64_C(6364136223846793005);\n prng += UINT64_C(1442695040888963407);\n }\n}\n\n\/\/------------------------------------------------------------------------------\n\nint main(int argc, char **argv) {\n testing::InitGoogleTest(&argc, argv);\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include <deque>\n\n#include \"catch.hpp\"\n\n#include \"dll\/dbn.hpp\"\n\n#include \"dll\/binarize_layer.hpp\"\n#include \"dll\/normalize_layer.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE( \"dbn\/mnist_1\", \"dbn::simple\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\nTEST_CASE( \"dbn\/mnist_2\", \"dbn::containers\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>();\n\n REQUIRE(!dataset.training_images.empty());\n dataset.training_images.resize(200);\n dataset.training_labels.resize(200);\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 5);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 5, 50);\n\n REQUIRE(error < 5e-2);\n}\n\nTEST_CASE( \"dbn\/mnist_3\", \"dbn::labels\" ) {\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>();\n\n REQUIRE(!dataset.training_images.empty());\n dataset.training_images.resize(1000);\n dataset.training_labels.resize(1000);\n\n mnist::binarize_dataset(dataset);\n\n typedef dll::dbn_desc<\n dll::dbn_label_layers<\n dll::rbm_desc<28 * 28, 200, dll::batch_size<50>, dll::init_weights, dll::momentum>::rbm_t,\n dll::rbm_desc<200, 300, dll::batch_size<50>, dll::momentum>::rbm_t,\n dll::rbm_desc<310, 500, dll::batch_size<50>, dll::momentum>::rbm_t>>::dbn_t dbn_simple_t;\n\n auto dbn = std::make_unique<dbn_simple_t>();\n\n dbn->train_with_labels(dataset.training_images, dataset.training_labels, 10, 10);\n\n auto error = dll::test_set(dbn, dataset.training_images, dataset.training_labels, dll::label_predictor());\n std::cout << \"test_error:\" << error << std::endl;\n REQUIRE(error < 0.3);\n}\n\nTEST_CASE( \"dbn\/mnist_6\", \"dbn::cg_gaussian\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 200, dll::momentum, dll::batch_size<25>, dll::visible<dll::unit_type::GAUSSIAN>>::rbm_t,\n dll::rbm_desc<200, 500, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<500, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>\n >::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>(1000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::normalize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\n\/\/This test should not perform well, but should not fail\nTEST_CASE( \"dbn\/mnist_8\", \"dbn::cg_relu\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::RELU>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>(200);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(std::isfinite(error));\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n}\n\nTEST_CASE( \"dbn\/mnist_15\", \"dbn::parallel\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::parallel, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::parallel, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::parallel, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\nTEST_CASE( \"dbn\/mnist_16\", \"dbn::fast\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<5>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<5>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<5>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(25);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 5);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 2, 5);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\n\/\/{{{ Performance debugging tests\n\nTEST_CASE( \"dbn\/mnist_101\", \"dbn::slow_parallel\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 300, dll::momentum, dll::parallel, dll::batch_size<24>, dll::init_weights>::rbm_t,\n dll::rbm_desc<300, 1000, dll::momentum, dll::parallel, dll::batch_size<24>>::rbm_t,\n dll::rbm_desc<1000, 10, dll::momentum, dll::parallel, dll::batch_size<24>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(2000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n}\n\nTEST_CASE( \"dbn\/mnist_102\", \"[dbn][bench][slow]\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 300, dll::momentum, dll::batch_size<24>, dll::init_weights>::rbm_t,\n dll::rbm_desc<300, 1000, dll::momentum, dll::batch_size<24>>::rbm_t,\n dll::rbm_desc<1000, 10, dll::momentum, dll::batch_size<24>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(2000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n}\n\n\/\/}}}\n\nTEST_CASE( \"dbn\/mnist_17\", \"dbn::memory\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>\n , dll::memory>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(\n dataset.training_images.begin(), dataset.training_images.end(),\n dataset.training_labels.begin(), dataset.training_labels.end(),\n 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n<commit_msg>Add test for prepare_one_output<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include <deque>\n\n#include \"catch.hpp\"\n\n#include \"dll\/dbn.hpp\"\n\n#include \"dll\/binarize_layer.hpp\"\n#include \"dll\/normalize_layer.hpp\"\n\n#include \"mnist\/mnist_reader.hpp\"\n#include \"mnist\/mnist_utils.hpp\"\n\nTEST_CASE( \"dbn\/mnist_1\", \"dbn::simple\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\nTEST_CASE( \"dbn\/mnist_2\", \"dbn::containers\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>();\n\n REQUIRE(!dataset.training_images.empty());\n dataset.training_images.resize(200);\n dataset.training_labels.resize(200);\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 5);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 5, 50);\n\n REQUIRE(error < 5e-2);\n}\n\nTEST_CASE( \"dbn\/mnist_3\", \"dbn::labels\" ) {\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>();\n\n REQUIRE(!dataset.training_images.empty());\n dataset.training_images.resize(1000);\n dataset.training_labels.resize(1000);\n\n mnist::binarize_dataset(dataset);\n\n typedef dll::dbn_desc<\n dll::dbn_label_layers<\n dll::rbm_desc<28 * 28, 200, dll::batch_size<50>, dll::init_weights, dll::momentum>::rbm_t,\n dll::rbm_desc<200, 300, dll::batch_size<50>, dll::momentum>::rbm_t,\n dll::rbm_desc<310, 500, dll::batch_size<50>, dll::momentum>::rbm_t>>::dbn_t dbn_simple_t;\n\n auto dbn = std::make_unique<dbn_simple_t>();\n\n dbn->train_with_labels(dataset.training_images, dataset.training_labels, 10, 10);\n\n auto error = dll::test_set(dbn, dataset.training_images, dataset.training_labels, dll::label_predictor());\n std::cout << \"test_error:\" << error << std::endl;\n REQUIRE(error < 0.3);\n}\n\nTEST_CASE( \"dbn\/mnist_6\", \"dbn::cg_gaussian\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 200, dll::momentum, dll::batch_size<25>, dll::visible<dll::unit_type::GAUSSIAN>>::rbm_t,\n dll::rbm_desc<200, 500, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<500, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>\n >::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>(1000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::normalize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\n\/\/This test should not perform well, but should not fail\nTEST_CASE( \"dbn\/mnist_8\", \"dbn::cg_relu\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::RELU>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::deque, double>(200);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(std::isfinite(error));\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n}\n\nTEST_CASE( \"dbn\/mnist_15\", \"dbn::parallel\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::parallel, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::parallel, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::parallel, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\nTEST_CASE( \"dbn\/mnist_16\", \"dbn::fast\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<5>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<5>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<5>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(25);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 5);\n auto error = dbn->fine_tune(dataset.training_images, dataset.training_labels, 2, 5);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n}\n\n\/\/{{{ Performance debugging tests\n\nTEST_CASE( \"dbn\/mnist_101\", \"dbn::slow_parallel\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 300, dll::momentum, dll::parallel, dll::batch_size<24>, dll::init_weights>::rbm_t,\n dll::rbm_desc<300, 1000, dll::momentum, dll::parallel, dll::batch_size<24>>::rbm_t,\n dll::rbm_desc<1000, 10, dll::momentum, dll::parallel, dll::batch_size<24>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(2000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n}\n\nTEST_CASE( \"dbn\/mnist_102\", \"[dbn][bench][slow]\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 300, dll::momentum, dll::batch_size<24>, dll::init_weights>::rbm_t,\n dll::rbm_desc<300, 1000, dll::momentum, dll::batch_size<24>>::rbm_t,\n dll::rbm_desc<1000, 10, dll::momentum, dll::batch_size<24>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(2000);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n}\n\n\/\/}}}\n\nTEST_CASE( \"dbn\/mnist_17\", \"dbn::memory\" ) {\n typedef dll::dbn_desc<\n dll::dbn_layers<\n dll::rbm_desc<28 * 28, 100, dll::momentum, dll::batch_size<25>, dll::init_weights>::rbm_t,\n dll::rbm_desc<100, 200, dll::momentum, dll::batch_size<25>>::rbm_t,\n dll::rbm_desc<200, 10, dll::momentum, dll::batch_size<25>, dll::hidden<dll::unit_type::SOFTMAX>>::rbm_t>\n , dll::memory>::dbn_t dbn_t;\n\n auto dataset = mnist::read_dataset<std::vector, std::vector, double>(500);\n\n REQUIRE(!dataset.training_images.empty());\n\n mnist::binarize_dataset(dataset);\n\n auto dbn = std::make_unique<dbn_t>();\n\n dbn->pretrain(dataset.training_images, 20);\n auto error = dbn->fine_tune(\n dataset.training_images.begin(), dataset.training_images.end(),\n dataset.training_labels.begin(), dataset.training_labels.end(),\n 10, 50);\n\n REQUIRE(error < 5e-2);\n\n auto test_error = dll::test_set(dbn, dataset.test_images, dataset.test_labels, dll::predictor());\n\n std::cout << \"test_error:\" << test_error << std::endl;\n\n REQUIRE(test_error < 0.2);\n\n \/\/Mostly here to ensure compilation\n auto out = dbn->prepare_one_output();\n REQUIRE(out.size() > 0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"..\/common\/numbers.h\"\n#include \"materials.h\"\n\n#include <deal.II\/base\/utilities.h>\n\nMaterials::Materials (dealii::ParameterHandler &prm)\n : is_eigen_problem_(prm.get_bool(\"do eigenvalue calculations\")),\n do_nda_(prm.get_bool(\"do nda\")),\n n_group_(prm.get_integer(\"number of groups\")),\n n_material_(prm.get_integer(\"number of materials\")) {\n ProcessMaterials(prm);\n}\n\nMaterials::~Materials () {}\n\nvoid Materials::ProcessMaterials (dealii::ParameterHandler &prm) {\n if (n_group_>1) {\n prm.enter_subsection (\"sigma_t, group=1 to G\");\n {\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of sigma_t\"));\n std::vector<double> tmp, inv_tmp;\n for (int g=0; g<n_group_; ++g) {\n tmp.push_back (std::atof (strings[g].c_str ()));\n inv_tmp.push_back (1.0\/tmp[g]);\n }\n sigt_[m] = tmp;\n inv_sigt_[m] = inv_tmp;\n }\n }\n prm.leave_subsection ();\n\n \/\/ This block takes in scattering transfer matrices\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream osm;\n osm << \"sigma_s, material \" << m + 1;\n dealii::FullMatrix<double> tmp_sigs (n_group_, n_group_);\n prm.enter_subsection (osm.str());\n {\n for (int gin=0; gin<n_group_; ++gin) {\n std::ostringstream os;\n os << \"g_in=\" << gin + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size()==n_group_,\n dealii::ExcMessage(\"sigma_s should have n_group_ entries per in group\"));\n for (int g=0; g<n_group_; ++g) {\n tmp_sigs(gin, g) = std::atof (strings[g].c_str());\n }\n }\n }\n prm.leave_subsection ();\n sigs_[m] = tmp_sigs;\n sigs_per_ster_[m] = tmp_sigs;\n sigs_per_ster_[m] *= bconst::kInvFourPi;\n }\n\n if (!is_eigen_problem_) {\n prm.enter_subsection (\"Q, group=1 to G\");\n {\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of Q\"));\n std::vector<double> tmp_q;\n for (int g=0; g<n_group_; ++g)\n tmp_q.push_back (std::atof (strings[g].c_str ()));\n q_[m] = tmp_q;\n q_per_ster_[m] = tmp_q;\n std::for_each(q_per_ster_[m].begin(), q_per_ster_[m].end(),\n [&](double &val){return val*bconst::kInvFourPi;});\n }\n }\n prm.leave_subsection ();\n }\n } else {\n prm.enter_subsection (\"one-group sigma_t\");\n {\n std::cout << \"are we here1\" << std::endl;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()>=n_material_,\n dealii::ExcMessage(\"One-group sigma_t should have n_material_ entries\"));\n std::cout << \"are we here2\" << std::endl;\n\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp = {std::atof (strings[m].c_str())};\n std::vector<double> inv_tmp = {1.0 \/ std::atof (strings[m].c_str())};\n sigt_[m] = tmp;\n inv_sigt_[m] = inv_tmp;\n }\n std::cout << \"are we here3\" << std::endl;\n\n }\n prm.leave_subsection ();\n\n prm.enter_subsection (\"one-group sigma_s\");\n {\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group sigma_s should have n_material_ entries\"));\n for (int m=0; m<n_material_; ++m) {\n dealii::FullMatrix<double> tmp(1,1);\n std::cout << \"material\" << m << std::endl;\n tmp(0,0) = std::atof(strings[m].c_str());\n sigs_[m] = tmp;\n sigs_per_ster_[m] = tmp;\n sigs_per_ster_[m] *= bconst::kInvFourPi;\n }\n std::cout << \"are we here 9\" << std::endl;\n }\n prm.leave_subsection ();\n\n if (!is_eigen_problem_) {\n prm.enter_subsection (\"one-group Q\");\n {\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group Q should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp = {std::atof (strings[m].c_str())};\n q_[m] = tmp;\n std::vector<double> tmp_per_ster = {std::atof(strings[m].c_str())\/bconst::kFourPi};\n q_per_ster_[m] = tmp_per_ster;\n }\n }\n prm.leave_subsection ();\n }\n }\n\n \/\/ This block is for eigenvalue problems\n if (is_eigen_problem_)\n ProcessEigenMaterials (prm);\n std::cout << \"are we here end1\" << std::endl;\n}\n\nvoid Materials::ProcessEigenMaterials (dealii::ParameterHandler &prm) {\n prm.enter_subsection (\"fissile material IDs\");\n {\n std::ostringstream os;\n os << \"fissile material ids\";\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () > 0,\n dealii::ExcMessage (\"Fissile material IDs must be inserted for eigen problems\"));\n \/\/ std::set<int> fissile_ids;\n for (int i=0; i<strings.size(); ++i)\n fissile_ids_.insert (std::atoi(strings[i].c_str())-1);\n }\n prm.leave_subsection ();\n\n for (int m=0; m<n_material_; ++m) {\n if (fissile_ids_.find(m)!=fissile_ids_.end())\n is_material_fissile_[m] = true;\n else\n is_material_fissile_[m] = false;\n }\n AssertThrow (!is_material_fissile_.empty (),\n dealii::ExcMessage (\"Please specify at least one valid ID for fissile materials\"));\n std::cout << \"are we here 7\" << std::endl;\n if (n_group_>1) {\n prm.enter_subsection (\"chi, group=1 to G\");\n {\n for (int m=0; m<n_material_;++m) {\n std::vector<double> tmp(n_group_);\n if (is_material_fissile_[m]) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of chi\"));\n std::vector<double> tmp(n_group_);\n for (int g=0; g<n_group_; ++g)\n tmp[g] = std::atof (strings[g].c_str ());\n }\n chi_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n\n prm.enter_subsection (\"nu_sigf, group=1 to G\");\n {\n for (int m=0; m<n_material_;++m) {\n std::vector<double> tmp(n_group_);\n if (is_material_fissile_[m]) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of nusigf\"));\n std::vector<double> tmp(n_group_);\n for (int g=0; g<n_group_; ++g)\n tmp[g] = std::atof (strings[g].c_str ());\n }\n nu_sigf_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n } else {\n \/\/ the following is for one-group\n prm.enter_subsection (\"one-group chi\");\n {\n std::cout << \"are we here 6\" << std::endl;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n std::cout << \"chi size \" << strings.size() << \" materi \" << n_material_ << std::endl;\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group chi should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp {is_material_fissile_[m] ?\n std::atof (strings[m].c_str()) : 0.0};\n chi_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n std::cout << \"are we here 5\" << std::endl;\n prm.enter_subsection (\"one-group nu_sigf\");\n {\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group sigma_t should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m)\n {\n std::vector<double> tmp {is_material_fissile_[m] ?\n std::atof (strings[m].c_str()) : 0.0};\n nu_sigf_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n }\n std::cout << \"are we here 4\" << std::endl;\n for (int m=0; m<n_material_; ++m)\n {\n dealii::FullMatrix<double> tmp (n_group_, n_group_);\n if (is_material_fissile_[m])\n for (int gin=0; gin<n_group_; ++gin)\n for (int g=0; g<n_group_; ++g)\n tmp(gin,g) = chi_[m][g] * nu_sigf_[m][gin];\n\n fiss_transfer_[m] = tmp;\n fiss_transfer_per_ster_[m] = tmp;\n fiss_transfer_per_ster_[m] *= bconst::kInvFourPi;\n }\n std::cout << \"are we here end\" << std::endl;\n\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetSigT () const {\n return sigt_;\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetInvSigT () const {\n return inv_sigt_;\n}\n\nstd::unordered_map<int, std::vector<double>> Materials::GetQ() const {\n return q_;\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetQPerSter() const {\n return q_per_ster_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetSigS() const {\n return sigs_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetSigSPerSter () const {\n return sigs_per_ster_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetFissTransfer () const {\n return fiss_transfer_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetFissTransferPerSter () const {\n return fiss_transfer_per_ster_;\n}\n\nstd::unordered_map<int, std::vector<double>> Materials::GetNuSigf () const {\n return nu_sigf_;\n}\n\nstd::unordered_map<int, bool> Materials::GetFissileIDMap () const {\n return is_material_fissile_;\n}\n<commit_msg>deleted debugging stuff<commit_after>#include \"..\/common\/numbers.h\"\n#include \"materials.h\"\n\n#include <deal.II\/base\/utilities.h>\n\nMaterials::Materials (dealii::ParameterHandler &prm)\n : is_eigen_problem_(prm.get_bool(\"do eigenvalue calculations\")),\n do_nda_(prm.get_bool(\"do nda\")),\n n_group_(prm.get_integer(\"number of groups\")),\n n_material_(prm.get_integer(\"number of materials\")) {\n ProcessMaterials(prm);\n}\n\nMaterials::~Materials () {}\n\nvoid Materials::ProcessMaterials (dealii::ParameterHandler &prm) {\n if (n_group_>1) {\n prm.enter_subsection (\"sigma_t, group=1 to G\");\n {\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of sigma_t\"));\n std::vector<double> tmp, inv_tmp;\n for (int g=0; g<n_group_; ++g) {\n tmp.push_back (std::atof (strings[g].c_str ()));\n inv_tmp.push_back (1.0\/tmp[g]);\n }\n sigt_[m] = tmp;\n inv_sigt_[m] = inv_tmp;\n }\n }\n prm.leave_subsection ();\n\n \/\/ This block takes in scattering transfer matrices\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream osm;\n osm << \"sigma_s, material \" << m + 1;\n dealii::FullMatrix<double> tmp_sigs (n_group_, n_group_);\n prm.enter_subsection (osm.str());\n {\n for (int gin=0; gin<n_group_; ++gin) {\n std::ostringstream os;\n os << \"g_in=\" << gin + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size()==n_group_,\n dealii::ExcMessage(\"sigma_s should have n_group_ entries per in group\"));\n for (int g=0; g<n_group_; ++g) {\n tmp_sigs(gin, g) = std::atof (strings[g].c_str());\n }\n }\n }\n prm.leave_subsection ();\n sigs_[m] = tmp_sigs;\n sigs_per_ster_[m] = tmp_sigs;\n sigs_per_ster_[m] *= bconst::kInvFourPi;\n }\n\n if (!is_eigen_problem_) {\n prm.enter_subsection (\"Q, group=1 to G\");\n {\n for (int m=0; m<n_material_; ++m) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of Q\"));\n std::vector<double> tmp_q;\n for (int g=0; g<n_group_; ++g)\n tmp_q.push_back (std::atof (strings[g].c_str ()));\n q_[m] = tmp_q;\n q_per_ster_[m] = tmp_q;\n std::for_each(q_per_ster_[m].begin(), q_per_ster_[m].end(),\n [&](double &val){return val*bconst::kInvFourPi;});\n }\n }\n prm.leave_subsection ();\n }\n } else {\n prm.enter_subsection (\"one-group sigma_t\");\n {\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()>=n_material_,\n dealii::ExcMessage(\"One-group sigma_t should have n_material_ entries\"));\n\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp = {std::atof (strings[m].c_str())};\n std::vector<double> inv_tmp = {1.0 \/ std::atof (strings[m].c_str())};\n sigt_[m] = tmp;\n inv_sigt_[m] = inv_tmp;\n }\n }\n prm.leave_subsection ();\n\n prm.enter_subsection (\"one-group sigma_s\");\n {\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group sigma_s should have n_material_ entries\"));\n for (int m=0; m<n_material_; ++m) {\n dealii::FullMatrix<double> tmp(1,1);\n tmp(0,0) = std::atof(strings[m].c_str());\n sigs_[m] = tmp;\n sigs_per_ster_[m] = tmp;\n sigs_per_ster_[m] *= bconst::kInvFourPi;\n }\n }\n prm.leave_subsection ();\n\n if (!is_eigen_problem_) {\n prm.enter_subsection (\"one-group Q\");\n {\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group Q should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp = {std::atof (strings[m].c_str())};\n q_[m] = tmp;\n std::vector<double> tmp_per_ster = {std::atof(strings[m].c_str())\/bconst::kFourPi};\n q_per_ster_[m] = tmp_per_ster;\n }\n }\n prm.leave_subsection ();\n }\n }\n\n \/\/ This block is for eigenvalue problems\n if (is_eigen_problem_)\n ProcessEigenMaterials (prm);\n}\n\nvoid Materials::ProcessEigenMaterials (dealii::ParameterHandler &prm) {\n prm.enter_subsection (\"fissile material IDs\");\n {\n std::ostringstream os;\n os << \"fissile material ids\";\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () > 0,\n dealii::ExcMessage (\"Fissile material IDs must be inserted for eigen problems\"));\n \/\/ std::set<int> fissile_ids;\n for (int i=0; i<strings.size(); ++i)\n fissile_ids_.insert (std::atoi(strings[i].c_str())-1);\n }\n prm.leave_subsection ();\n\n for (int m=0; m<n_material_; ++m) {\n if (fissile_ids_.find(m)!=fissile_ids_.end())\n is_material_fissile_[m] = true;\n else\n is_material_fissile_[m] = false;\n }\n AssertThrow (!is_material_fissile_.empty (),\n dealii::ExcMessage (\"Please specify at least one valid ID for fissile materials\"));\n if (n_group_>1) {\n prm.enter_subsection (\"chi, group=1 to G\");\n {\n for (int m=0; m<n_material_;++m) {\n std::vector<double> tmp(n_group_);\n if (is_material_fissile_[m]) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(os.str()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of chi\"));\n std::vector<double> tmp(n_group_);\n for (int g=0; g<n_group_; ++g)\n tmp[g] = std::atof (strings[g].c_str ());\n }\n chi_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n\n prm.enter_subsection (\"nu_sigf, group=1 to G\");\n {\n for (int m=0; m<n_material_;++m) {\n std::vector<double> tmp(n_group_);\n if (is_material_fissile_[m]) {\n std::ostringstream os;\n os << \"material \" << m + 1;\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get (os.str ()));\n AssertThrow (strings.size () == n_group_,\n dealii::ExcMessage (\"n_group_ is not equal to group number of nusigf\"));\n std::vector<double> tmp(n_group_);\n for (int g=0; g<n_group_; ++g)\n tmp[g] = std::atof (strings[g].c_str ());\n }\n nu_sigf_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n } else {\n \/\/ the following is for one-group\n prm.enter_subsection (\"one-group chi\");\n {\n std::vector<std::string> strings =\n dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group chi should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m) {\n std::vector<double> tmp {is_material_fissile_[m] ?\n std::atof (strings[m].c_str()) : 0.0};\n chi_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n prm.enter_subsection (\"one-group nu_sigf\");\n {\n std::vector<std::string> strings = dealii::Utilities::split_string_list (prm.get(\"values\"));\n AssertThrow (strings.size()==n_material_,\n dealii::ExcMessage(\"One-group sigma_t should have n_material_ entries\"));\n std::vector<double> tmp_sigt (n_material_);\n for (int m=0; m<n_material_; ++m)\n {\n std::vector<double> tmp {is_material_fissile_[m] ?\n std::atof (strings[m].c_str()) : 0.0};\n nu_sigf_[m] = tmp;\n }\n }\n prm.leave_subsection ();\n }\n for (int m=0; m<n_material_; ++m)\n {\n dealii::FullMatrix<double> tmp (n_group_, n_group_);\n if (is_material_fissile_[m])\n for (int gin=0; gin<n_group_; ++gin)\n for (int g=0; g<n_group_; ++g)\n tmp(gin,g) = chi_[m][g] * nu_sigf_[m][gin];\n\n fiss_transfer_[m] = tmp;\n fiss_transfer_per_ster_[m] = tmp;\n fiss_transfer_per_ster_[m] *= bconst::kInvFourPi;\n }\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetSigT () const {\n return sigt_;\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetInvSigT () const {\n return inv_sigt_;\n}\n\nstd::unordered_map<int, std::vector<double>> Materials::GetQ() const {\n return q_;\n}\n\nstd::unordered_map<int, std::vector<double>>\nMaterials::GetQPerSter() const {\n return q_per_ster_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetSigS() const {\n return sigs_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetSigSPerSter () const {\n return sigs_per_ster_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetFissTransfer () const {\n return fiss_transfer_;\n}\n\nstd::unordered_map<int, dealii::FullMatrix<double>>\nMaterials::GetFissTransferPerSter () const {\n return fiss_transfer_per_ster_;\n}\n\nstd::unordered_map<int, std::vector<double>> Materials::GetNuSigf () const {\n return nu_sigf_;\n}\n\nstd::unordered_map<int, bool> Materials::GetFissileIDMap () const {\n return is_material_fissile_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * (cd ..\/lib && make all-c)\n * afl-g++ -std=gnu++11 -fPIC -O -I..\/lib fuzz.c ..\/lib\/graph.cc ..\/lib\/murmur32s.pico ..\/lib\/murmur32v.pico ..\/lib\/xxh32s.pico ..\/lib\/xxh64s.pico ..\/lib\/fastdiv.pico ..\/lib\/jenkins2v.pico\n *\n * .\/a.out && mv fuzz.dat ${INPUTDIR:?}\n * afl-fuzz -i ${INPUTDIR:?} -o ${OUTPUTDIR:?} .\/a.out @@\n *\/\n\n#include <fcntl.h>\n#include <stdbool.h>\n#include <stddef.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"rgph_defs.h\"\n#include \"rgph_graph.h\"\n\nstatic const char letters[] = \"abcdefghijklmnopqrstuvwxyz\";\n\nstruct fuzz_entry {\n\tuint64_t index;\n\tuint8_t has_index;\n\tuint8_t keylen;\n\tchar key[54];\n};\n\nstruct fuzz_header {\n\tsize_t nverts;\n\tunsigned long seed;\n\tint alloc_flags;\n\tint build_flags;\n\tint assign_flags;\n\tunsigned int nentries;\n\tstruct fuzz_entry entries[];\n};\n\nstruct iterator_state {\n\tsize_t pos;\n\tsize_t nentries;\n\tstruct fuzz_entry *entries;\n\tstruct rgph_entry out;\n};\n\nstatic inline size_t\nmin(size_t a, size_t b)\n{\n\n\treturn a < b ? a : b;\n}\n\nstatic inline size_t\nmax(size_t a, size_t b)\n{\n\n\treturn a > b ? a : b;\n}\n\nstatic const struct rgph_entry *\niterator_func(void *state)\n{\n\tstruct iterator_state *s = (struct iterator_state *)state;\n\tstruct fuzz_entry *in = &s->entries[s->pos];\n\tstruct rgph_entry *out = &s->out;\n\n\tif (s->pos == s->nentries)\n\t\treturn NULL;\n\n\tout->key = out->data = in->key;\n\tout->keylen = out->datalen = min(sizeof(in->key), in->keylen);\n\tout->index = in->index;\n\tout->has_index = in->has_index;\n\n\ts->pos++;\n\treturn out;\n}\n\nint\nwrite_sample_input(void)\n{\n\tfuzz_header h;\n\tFILE *f;\n\tsize_t i;\n\n\tmemset(&h, 0, sizeof(h));\n\n\tf = fopen(\"fuzz.dat\", \"w\");\n\tif (f == NULL)\n\t\treturn EXIT_FAILURE;\n\n\th.nverts = h.nentries = sizeof(letters) - 1;\n\th.seed = 123456789;\n\th.alloc_flags = 0;\n\th.build_flags = 0;\n\th.assign_flags = 0;\n\n\tif (fwrite(&h, 1, sizeof(h), f) != sizeof(h)) {\n\t\tfclose(f);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tfor (i = 0; i < sizeof(letters) - 1; i++) {\n\t\tstruct fuzz_entry e;\n\n\t\te.index = i;\n\t\te.has_index = true;\n\t\te.keylen = 2;\n\t\tmemcpy(e.key, &letters[i], 2);\n\n\t\tif (fwrite(&e, 1, sizeof(e), f) != sizeof(e)) {\n\t\t\tfclose(f);\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\tfclose(f);\n\treturn EXIT_SUCCESS;\n}\n\nint\nmain(int argc, char *argv[])\n{\n\titerator_state state;\n\tstruct stat st;\n\tstruct fuzz_header *h;\n\tstruct rgph_graph *g;\n\tvoid *buf;\n\tsize_t flen;\n\tunsigned long seed;\n\tint build_flags, fd, i, res;\n\n\tif (argc < 2)\n\t\treturn write_sample_input();\n\n\tfd = open(argv[1], O_RDONLY);\n\tif (fd == -1)\n\t\treturn EXIT_FAILURE;\n\n\tif (fstat(fd, &st) == -1) {\n\t\tclose(fd);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tflen = max(st.st_size, sizeof(*h));\n\n\tbuf = mmap(NULL, flen, PROT_READ, MAP_FILE | MAP_PRIVATE, fd, 0);\n\th = (struct fuzz_header *)buf;\n\tclose(fd);\n\n\tif (buf == MAP_FAILED)\n\t\treturn EXIT_FAILURE;\n\n\tg = rgph_alloc_graph(h->nverts, h->alloc_flags);\n\tif (g == NULL)\n\t\treturn EXIT_FAILURE;\n\n\tseed = h->seed;\n\tbuild_flags = h->build_flags;\n\tstate.entries = h->entries;\n\tstate.nentries = min(h->nentries,\n\t (flen - sizeof(*h)) \/ sizeof(h->entries[0]));\n\n\tfor (i = 0; true; i++) {\n\t\tsize_t dup[2];\n\n\t\tstate.pos = 0;\n\t\tres = rgph_build_graph(g, build_flags, seed++,\n\t\t &iterator_func, &state);\n\t\tif (res == RGPH_SUCCESS || res != RGPH_AGAIN)\n\t\t\tbreak;\n\n\t\tstate.pos = 0;\n\t\tres = rgph_find_duplicates(g, &iterator_func, &state, dup);\n\t\tif (res == RGPH_SUCCESS)\n\t\t\tbreak;\n\n\t\t\/* Some hashes are weak. Rotate them periodically. *\/\n\t\tif ((i % 8) == 7) {\n\t\t\tint next_hash = (build_flags & RGPH_HASH_MASK) + 1;\n\n\t\t\tif (next_hash >= RGPH_HASH_LAST)\n\t\t\t\tnext_hash = 0;\n\n\t\t\tbuild_flags &= ~RGPH_HASH_MASK;\n\t\t\tbuild_flags |= next_hash;\n\t\t}\n\t}\n\n\tres = rgph_assign(g, h->assign_flags);\n\n\trgph_free_graph(g);\n\n\treturn res == RGPH_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<commit_msg>It's now .cc.<commit_after>\/*\n * (cd ..\/lib && make all-c)\n * afl-g++ -std=gnu++11 -fPIC -O -I..\/lib fuzz.cc ..\/lib\/graph.cc ..\/lib\/murmur32s.pico ..\/lib\/murmur32v.pico ..\/lib\/xxh32s.pico ..\/lib\/xxh64s.pico ..\/lib\/fastdiv.pico ..\/lib\/jenkins2v.pico\n *\n * .\/a.out && mv fuzz.dat ${INPUTDIR:?}\n * afl-fuzz -i ${INPUTDIR:?} -o ${OUTPUTDIR:?} .\/a.out @@\n *\/\n\n#include <fcntl.h>\n#include <stdbool.h>\n#include <stddef.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"rgph_defs.h\"\n#include \"rgph_graph.h\"\n\nstatic const char letters[] = \"abcdefghijklmnopqrstuvwxyz\";\n\nstruct fuzz_entry {\n\tuint64_t index;\n\tuint8_t has_index;\n\tuint8_t keylen;\n\tchar key[54];\n};\n\nstruct fuzz_header {\n\tsize_t nverts;\n\tunsigned long seed;\n\tint alloc_flags;\n\tint build_flags;\n\tint assign_flags;\n\tunsigned int nentries;\n\tstruct fuzz_entry entries[];\n};\n\nstruct iterator_state {\n\tsize_t pos;\n\tsize_t nentries;\n\tstruct fuzz_entry *entries;\n\tstruct rgph_entry out;\n};\n\nstatic inline size_t\nmin(size_t a, size_t b)\n{\n\n\treturn a < b ? a : b;\n}\n\nstatic inline size_t\nmax(size_t a, size_t b)\n{\n\n\treturn a > b ? a : b;\n}\n\nstatic const struct rgph_entry *\niterator_func(void *state)\n{\n\tstruct iterator_state *s = (struct iterator_state *)state;\n\tstruct fuzz_entry *in = &s->entries[s->pos];\n\tstruct rgph_entry *out = &s->out;\n\n\tif (s->pos == s->nentries)\n\t\treturn NULL;\n\n\tout->key = out->data = in->key;\n\tout->keylen = out->datalen = min(sizeof(in->key), in->keylen);\n\tout->index = in->index;\n\tout->has_index = in->has_index;\n\n\ts->pos++;\n\treturn out;\n}\n\nint\nwrite_sample_input(void)\n{\n\tfuzz_header h;\n\tFILE *f;\n\tsize_t i;\n\n\tmemset(&h, 0, sizeof(h));\n\n\tf = fopen(\"fuzz.dat\", \"w\");\n\tif (f == NULL)\n\t\treturn EXIT_FAILURE;\n\n\th.nverts = h.nentries = sizeof(letters) - 1;\n\th.seed = 123456789;\n\th.alloc_flags = 0;\n\th.build_flags = 0;\n\th.assign_flags = 0;\n\n\tif (fwrite(&h, 1, sizeof(h), f) != sizeof(h)) {\n\t\tfclose(f);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tfor (i = 0; i < sizeof(letters) - 1; i++) {\n\t\tstruct fuzz_entry e;\n\n\t\te.index = i;\n\t\te.has_index = true;\n\t\te.keylen = 2;\n\t\tmemcpy(e.key, &letters[i], 2);\n\n\t\tif (fwrite(&e, 1, sizeof(e), f) != sizeof(e)) {\n\t\t\tfclose(f);\n\t\t\treturn EXIT_FAILURE;\n\t\t}\n\t}\n\n\tfclose(f);\n\treturn EXIT_SUCCESS;\n}\n\nint\nmain(int argc, char *argv[])\n{\n\titerator_state state;\n\tstruct stat st;\n\tstruct fuzz_header *h;\n\tstruct rgph_graph *g;\n\tvoid *buf;\n\tsize_t flen;\n\tunsigned long seed;\n\tint build_flags, fd, i, res;\n\n\tif (argc < 2)\n\t\treturn write_sample_input();\n\n\tfd = open(argv[1], O_RDONLY);\n\tif (fd == -1)\n\t\treturn EXIT_FAILURE;\n\n\tif (fstat(fd, &st) == -1) {\n\t\tclose(fd);\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tflen = max(st.st_size, sizeof(*h));\n\n\tbuf = mmap(NULL, flen, PROT_READ, MAP_FILE | MAP_PRIVATE, fd, 0);\n\th = (struct fuzz_header *)buf;\n\tclose(fd);\n\n\tif (buf == MAP_FAILED)\n\t\treturn EXIT_FAILURE;\n\n\tg = rgph_alloc_graph(h->nverts, h->alloc_flags);\n\tif (g == NULL)\n\t\treturn EXIT_FAILURE;\n\n\tseed = h->seed;\n\tbuild_flags = h->build_flags;\n\tstate.entries = h->entries;\n\tstate.nentries = min(h->nentries,\n\t (flen - sizeof(*h)) \/ sizeof(h->entries[0]));\n\n\tfor (i = 0; true; i++) {\n\t\tsize_t dup[2];\n\n\t\tstate.pos = 0;\n\t\tres = rgph_build_graph(g, build_flags, seed++,\n\t\t &iterator_func, &state);\n\t\tif (res == RGPH_SUCCESS || res != RGPH_AGAIN)\n\t\t\tbreak;\n\n\t\tstate.pos = 0;\n\t\tres = rgph_find_duplicates(g, &iterator_func, &state, dup);\n\t\tif (res == RGPH_SUCCESS)\n\t\t\tbreak;\n\n\t\t\/* Some hashes are weak. Rotate them periodically. *\/\n\t\tif ((i % 8) == 7) {\n\t\t\tint next_hash = (build_flags & RGPH_HASH_MASK) + 1;\n\n\t\t\tif (next_hash >= RGPH_HASH_LAST)\n\t\t\t\tnext_hash = 0;\n\n\t\t\tbuild_flags &= ~RGPH_HASH_MASK;\n\t\t\tbuild_flags |= next_hash;\n\t\t}\n\t}\n\n\tres = rgph_assign(g, h->assign_flags);\n\n\trgph_free_graph(g);\n\n\treturn res == RGPH_SUCCESS ? EXIT_SUCCESS : EXIT_FAILURE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ REQUIRES: x86-registered-target,x86-64-registered-target\n\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -std=c++11 -S %s -o %t-64.s\n\/\/ RUN: FileCheck -check-prefix CHECK-LP64 --input-file=%t-64.s %s\n\/\/ RUN: %clang_cc1 -triple i386-apple-darwin -std=c++11 -S %s -o %t-32.s\n\/\/ RUN: FileCheck -check-prefix CHECK-LP32 --input-file=%t-32.s %s\n\nextern \"C\" int printf(...);\n\nint f1(int arg) { return arg; }; \n\nint f2(float arg) { return int(arg); }; \n\ntypedef int (*fp1)(int); \n\ntypedef int (*fp2)(float); \n\nstruct A {\n operator fp1() { return f1; }\n operator fp2() { return f2; } \n} a;\n\n\n\/\/ Test for function reference.\ntypedef int (&fr1)(int); \ntypedef int (&fr2)(float); \n\nstruct B {\n operator fr1() { return f1; }\n operator fr2() { return f2; } \n} b;\n\nint main()\n{\n int i = a(10); \/\/ Calls f1 via pointer returned from conversion function\n printf(\"i = %d\\n\", i);\n\n int j = b(20); \/\/ Calls f1 via pointer returned from conversion function\n printf(\"j = %d\\n\", j);\n return 0;\n}\n\n\/\/ CHECK-LP64: callq __ZN1AcvPFiiEEv\n\/\/ CHECK-LP64: callq __ZN1BcvRFiiEEv\n\n\/\/ CHECK-LP32: calll L__ZN1AcvPFiiEEv\n\/\/ CHECK-LP32: calll L__ZN1BcvRFiiEEv\n\n<commit_msg>Check IR on this test.<commit_after>\/\/ RUN: %clang_cc1 -triple x86_64-apple-darwin -std=c++11 -emit-llvm %s -o - | \\\n\/\/ RUN: FileCheck %s\n\/\/ RUN: %clang_cc1 -triple i386-apple-darwin -std=c++11 -emit-llvm %s -o - | \\\n\/\/ RUN: FileCheck %s\n\nextern \"C\" int printf(...);\n\nint f1(int arg) { return arg; }; \n\nint f2(float arg) { return int(arg); }; \n\ntypedef int (*fp1)(int); \n\ntypedef int (*fp2)(float); \n\nstruct A {\n operator fp1() { return f1; }\n operator fp2() { return f2; } \n} a;\n\n\n\/\/ Test for function reference.\ntypedef int (&fr1)(int); \ntypedef int (&fr2)(float); \n\nstruct B {\n operator fr1() { return f1; }\n operator fr2() { return f2; } \n} b;\n\nint main()\n{\n int i = a(10); \/\/ Calls f1 via pointer returned from conversion function\n printf(\"i = %d\\n\", i);\n\n int j = b(20); \/\/ Calls f1 via pointer returned from conversion function\n printf(\"j = %d\\n\", j);\n return 0;\n}\n\n\/\/ CHECK: call i32 (i32)* (%struct.A*)* @_ZN1AcvPFiiEEv\n\/\/ CHECK: call i32 (i32)* (%struct.B*)* @_ZN1BcvRFiiEEv\n<|endoftext|>"} {"text":"<commit_before>#include \"Utils\/Testing.hpp\"\n\n#include \"Messaging\/MessageQueue.hpp\"\n\nusing namespace Core;\nusing namespace Messaging;\n\nusing namespace fakeit;\nusing namespace std::placeholders;\n\nnamespace {\n\n class Content : public Core::IEntity {\n TYPE_INFO(Content, Core::IEntity, \"content\")\n };\n\n struct EventSink {\n virtual Core::IEntity::Unique onRequest(const Content&) = 0;\n virtual void onResponse(const Response&) = 0;\n virtual void onResponseContent(const Content&) = 0;\n virtual void onResponseStatus(const Status&) = 0;\n virtual void onEvent(const Event&) const = 0;\n virtual void onEventContent(const Content&) const = 0;\n };\n\n}\n\nTEST_CASE(\"message queue is routing an event to a generic client\", \"[MessageQueue]\") {\n auto content = Content::makeUnique();\n auto contentPtr = content.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onEvent)).Do([=](const Event& event) {\n REQUIRE(event.getEventType() == \"created\");\n REQUIRE(event.getResource() == \"resource\");\n REQUIRE(event.getContent() == contentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\");\n client->setOnEvent(std::bind(&EventSink::onEvent, &eventSink.get(), _1));\n\n auto event = Event::makeUnique(\"created\", \"resource\", std::move(content));\n queue->addEvent(std::move(event));\n queue->idle();\n\n Verify(Method(eventSink, onEvent));\n}\n\nTEST_CASE(\"message queue is not routing an event to a deleted generic client\", \"[MessageQueue]\") {\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n auto queue = MessageQueue::makeUnique(logger);\n\n {\n Mock<EventSink> eventSink;\n auto client = queue->createClient(\"clientId\");\n client->setOnEvent(std::bind(&EventSink::onEvent, &eventSink.get(), _1));\n client.reset();\n }\n\n queue->addEvent(Event::makeUnique(\"created\", \"resource\"));\n queue->idle();\n}\n\nTEST_CASE(\"message queue is routing a response to a generic client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto requestContentPtr = requestContent.get();\n auto responseContent = Content::makeUnique();\n auto responseContentPtr = responseContent.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content& param) {\n REQUIRE(¶m == requestContentPtr);\n return std::move(responseContent);\n });\n\n When(Method(eventSink, onResponse)).Do([=](const Response& response) {\n REQUIRE(response.getRequestType() == \"get\");\n REQUIRE(response.getReceiver() == \"clientId\");\n REQUIRE(response.getResource() == \"resource\");\n REQUIRE(&response.getContent() == responseContentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\");\n client->setOnResponse(std::bind(&EventSink::onResponse, &eventSink.get(), _1));\n\n queue->createController(\"resource_controller_before\");\n auto controller = queue->createController(\"resource\");\n queue->createController(\"resource_controller_after\");\n\n controller->addOnRequest(\"get\", [&](const Content& c){ return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", \"resource\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(eventSink, onResponse));\n}\n\n\nTEST_CASE(\"message queue is routing an event to a resource client\", \"[MessageQueue]\") {\n auto content = Content::makeUnique();\n auto contentPtr = content.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onEventContent)).Do([=](const Content& param) {\n REQUIRE(¶m == contentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnEvent(\"created\", [&](const Content& c){ eventSink.get().onEventContent(c); });\n\n auto event = Event::makeUnique(\"created\", \"resource\", std::move(content));\n queue->addEvent(std::move(event));\n queue->idle();\n\n Verify(Method(eventSink, onEventContent));\n}\n\nTEST_CASE(\"message queue is routing a response to a resource client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto requestContentPtr = requestContent.get();\n auto responseContent = Content::makeUnique();\n auto responseContentPtr = responseContent.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content& param) {\n REQUIRE(¶m == requestContentPtr);\n return std::move(responseContent);\n });\n\n When(Method(eventSink, onResponseContent)).Do([=](const Content& param) {\n REQUIRE(¶m == responseContentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Content& c){ return eventSink.get().onResponseContent(c); });\n\n queue->createController(\"resource_controller_before\");\n auto controller = queue->createController(\"resource\");\n queue->createController(\"resource_controller_after\");\n controller->addOnRequest(\"get\", [&](const Content& c){ return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(eventSink, onResponseContent));\n}\n\nTEST_CASE(\"message queue is failing to route a response to an implicitly deleted client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content&) {\n return std::move(responseContent);\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n auto queue = MessageQueue::makeUnique(logger);\n\n QueueResourceClient* clientPtr;\n {\n auto client = queue->createClient(\"clientId\", \"resource\");\n clientPtr = client.get();\n }\n\n auto controller = queue->createController(\"resource\");\n controller->addOnRequest(\"get\", [&](const Content& c) { return eventSink.get().onRequest(c); });\n\n clientPtr->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(loggerInstanse, message));\n Verify(Method(loggerInstanse, error));\n}\n\nTEST_CASE(\"message queue is failing to route a response to an explicitly deleted client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content&) {\n return std::move(responseContent);\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n auto controller = queue->createController(\"resource\");\n controller->addOnRequest(\"get\", [&](const Content& c) { return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->removeClient(*client);\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(loggerInstanse, message));\n Verify(Method(loggerInstanse, error));\n}\n\nTEST_CASE(\"message queue is failing to route a request if there is no controller to handle it\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n\n When(Method(eventSink, onResponseStatus)).Do([=](const Status& status) {\n REQUIRE(status.getStatusCode() == StatusCode::NotFound);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Status& c){ return eventSink.get().onResponseStatus(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onResponseStatus));\n}\n\nTEST_CASE(\"message queue is failing to route a request if the controller was implicitly deleted\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n\n When(Method(eventSink, onResponseStatus)).Do([=](const Status& status) {\n REQUIRE(status.getStatusCode() == StatusCode::NotFound);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Status& c){ return eventSink.get().onResponseStatus(c); });\n\n {\n auto controller = queue->createController(\"resource\");\n controller->addOnRequest(\"get\", [&](const Content& c) { return eventSink.get().onRequest(c); });\n }\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onResponseStatus));\n}\n\nTEST_CASE(\"message queue is failing to route a request if the controller was explicitly deleted\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n\n When(Method(eventSink, onResponseStatus)).Do([=](const Status& status) {\n REQUIRE(status.getStatusCode() == StatusCode::NotFound);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Status& c){ return eventSink.get().onResponseStatus(c); });\n auto controller = queue->createController(\"resource\");\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->removeController(*controller);\n queue->idle();\n\n Verify(Method(eventSink, onResponseStatus));\n}\n<commit_msg>Removing the implicite deletion support<commit_after>#include \"Utils\/Testing.hpp\"\n\n#include \"Messaging\/MessageQueue.hpp\"\n\nusing namespace Core;\nusing namespace Messaging;\n\nusing namespace fakeit;\nusing namespace std::placeholders;\n\nnamespace {\n\n class Content : public Core::IEntity {\n TYPE_INFO(Content, Core::IEntity, \"content\")\n };\n\n struct EventSink {\n virtual Core::IEntity::Unique onRequest(const Content&) = 0;\n virtual void onResponse(const Response&) = 0;\n virtual void onResponseContent(const Content&) = 0;\n virtual void onResponseStatus(const Status&) = 0;\n virtual void onEvent(const Event&) const = 0;\n virtual void onEventContent(const Content&) const = 0;\n };\n\n}\n\nTEST_CASE(\"message queue is routing an event to a generic client\", \"[MessageQueue]\") {\n auto content = Content::makeUnique();\n auto contentPtr = content.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onEvent)).Do([=](const Event& event) {\n REQUIRE(event.getEventType() == \"created\");\n REQUIRE(event.getResource() == \"resource\");\n REQUIRE(event.getContent() == contentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\");\n client->setOnEvent(std::bind(&EventSink::onEvent, &eventSink.get(), _1));\n\n auto event = Event::makeUnique(\"created\", \"resource\", std::move(content));\n queue->addEvent(std::move(event));\n queue->idle();\n\n Verify(Method(eventSink, onEvent));\n}\n\nTEST_CASE(\"message queue is not routing an event to a deleted generic client\", \"[MessageQueue]\") {\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n auto queue = MessageQueue::makeUnique(logger);\n\n {\n Mock<EventSink> eventSink;\n auto client = queue->createClient(\"clientId\");\n client->setOnEvent(std::bind(&EventSink::onEvent, &eventSink.get(), _1));\n client.reset();\n }\n\n queue->addEvent(Event::makeUnique(\"created\", \"resource\"));\n queue->idle();\n}\n\nTEST_CASE(\"message queue is routing a response to a generic client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto requestContentPtr = requestContent.get();\n auto responseContent = Content::makeUnique();\n auto responseContentPtr = responseContent.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content& param) {\n REQUIRE(¶m == requestContentPtr);\n return std::move(responseContent);\n });\n\n When(Method(eventSink, onResponse)).Do([=](const Response& response) {\n REQUIRE(response.getRequestType() == \"get\");\n REQUIRE(response.getReceiver() == \"clientId\");\n REQUIRE(response.getResource() == \"resource\");\n REQUIRE(&response.getContent() == responseContentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\");\n client->setOnResponse(std::bind(&EventSink::onResponse, &eventSink.get(), _1));\n\n queue->createController(\"resource_controller_before\");\n auto controller = queue->createController(\"resource\");\n queue->createController(\"resource_controller_after\");\n\n controller->addOnRequest(\"get\", [&](const Content& c){ return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", \"resource\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(eventSink, onResponse));\n}\n\n\nTEST_CASE(\"message queue is routing an event to a resource client\", \"[MessageQueue]\") {\n auto content = Content::makeUnique();\n auto contentPtr = content.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onEventContent)).Do([=](const Content& param) {\n REQUIRE(¶m == contentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnEvent(\"created\", [&](const Content& c){ eventSink.get().onEventContent(c); });\n\n auto event = Event::makeUnique(\"created\", \"resource\", std::move(content));\n queue->addEvent(std::move(event));\n queue->idle();\n\n Verify(Method(eventSink, onEventContent));\n}\n\nTEST_CASE(\"message queue is routing a response to a resource client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto requestContentPtr = requestContent.get();\n auto responseContent = Content::makeUnique();\n auto responseContentPtr = responseContent.get();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content& param) {\n REQUIRE(¶m == requestContentPtr);\n return std::move(responseContent);\n });\n\n When(Method(eventSink, onResponseContent)).Do([=](const Content& param) {\n REQUIRE(¶m == responseContentPtr);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Content& c){ return eventSink.get().onResponseContent(c); });\n\n queue->createController(\"resource_controller_before\");\n auto controller = queue->createController(\"resource\");\n queue->createController(\"resource_controller_after\");\n controller->addOnRequest(\"get\", [&](const Content& c){ return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(eventSink, onResponseContent));\n}\n\nTEST_CASE(\"message queue is failing to route a response to an explicitly deleted client\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n When(Method(eventSink, onRequest)).Do([&](const Content&) {\n return std::move(responseContent);\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n auto controller = queue->createController(\"resource\");\n controller->addOnRequest(\"get\", [&](const Content& c) { return eventSink.get().onRequest(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->removeClient(*client);\n queue->idle();\n\n Verify(Method(eventSink, onRequest));\n Verify(Method(loggerInstanse, message));\n Verify(Method(loggerInstanse, error));\n}\n\nTEST_CASE(\"message queue is failing to route a request if there is no controller to handle it\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n\n When(Method(eventSink, onResponseStatus)).Do([=](const Status& status) {\n REQUIRE(status.getStatusCode() == StatusCode::NotFound);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Status& c){ return eventSink.get().onResponseStatus(c); });\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->idle();\n\n Verify(Method(eventSink, onResponseStatus));\n}\n\nTEST_CASE(\"message queue is failing to route a request if the controller was explicitly deleted\", \"[MessageQueue]\") {\n auto requestContent = Content::makeUnique();\n auto responseContent = Content::makeUnique();\n\n Mock<EventSink> eventSink;\n\n When(Method(eventSink, onResponseStatus)).Do([=](const Status& status) {\n REQUIRE(status.getStatusCode() == StatusCode::NotFound);\n return Status::OK;\n });\n\n Mock<ILogger> loggerInstanse;\n Fake(Method(loggerInstanse, message));\n Fake(Method(loggerInstanse, error));\n auto logger = ILogger::Shared(&loggerInstanse.get(), [](...) {});\n\n auto queue = MessageQueue::makeUnique(logger);\n\n auto client = queue->createClient(\"clientId\", \"resource\");\n client->addOnResponse(\"get\", [&](const Status& c){ return eventSink.get().onResponseStatus(c); });\n auto controller = queue->createController(\"resource\");\n\n client->sendRequest(\"get\", std::move(requestContent));\n queue->removeController(*controller);\n queue->idle();\n\n Verify(Method(eventSink, onResponseStatus));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ REQUIRES: python27\n\/\/ RUN: sed 's\/placeholder_for_f\/f\/' %s > %t.cpp\n\/\/ RUN: clang-tidy -checks=-*,misc-use-override %t.cpp -- -std=c++11 | FileCheck -check-prefix=CHECK-SANITY %s\n\/\/ RUN: not diff -U0 %s %t.cpp | %python %S\/..\/..\/clang-tidy\/tool\/clang-tidy-diff.py -checks=-*,misc-use-override -- -std=c++11 2>&1 | FileCheck %s\nstruct A {\n virtual void f() {}\n virtual void g() {}\n};\n\/\/ CHECK-NOT: warning\nstruct B : public A {\n void placeholder_for_f() {}\n\/\/ CHECK-SANITY: [[@LINE-1]]:8: warning: Use exactly\n\/\/ CHECK: [[@LINE-2]]:8: warning: Use exactly\n void g() {}\n\/\/ CHECK-SANITY: [[@LINE-1]]:8: warning: Use exactly\n\/\/ CHECK-NOT: warning:\n};\n\/\/ CHECK-SANITY-NOT: Suppressed\n\/\/ CHECK: Suppressed 1 warnings (1 due to line filter).\n<commit_msg>Suppress clang-tools-extra\/test\/clang-tidy\/clang-tidy-diff.cpp on win32 due to dos path issue.<commit_after>\/\/ REQUIRES: python27\n\/\/ RUN: sed 's\/placeholder_for_f\/f\/' %s > %t.cpp\n\/\/ RUN: clang-tidy -checks=-*,misc-use-override %t.cpp -- -std=c++11 | FileCheck -check-prefix=CHECK-SANITY %s\n\/\/ RUN: not diff -U0 %s %t.cpp | %python %S\/..\/..\/clang-tidy\/tool\/clang-tidy-diff.py -checks=-*,misc-use-override -- -std=c++11 2>&1 | FileCheck %s\nstruct A {\n virtual void f() {}\n virtual void g() {}\n};\n\/\/ CHECK-NOT: warning\nstruct B : public A {\n void placeholder_for_f() {}\n\/\/ CHECK-SANITY: [[@LINE-1]]:8: warning: Use exactly\n\/\/ CHECK: [[@LINE-2]]:8: warning: Use exactly\n void g() {}\n\/\/ CHECK-SANITY: [[@LINE-1]]:8: warning: Use exactly\n\/\/ CHECK-NOT: warning:\n};\n\/\/ CHECK-SANITY-NOT: Suppressed\n\/\/ CHECK: Suppressed 1 warnings (1 due to line filter).\n\n\/\/ FIXME: clang-tidy-diff.py is incompatible to dos path. Excluding win32.\n\/\/ REQUIRES: shell\n<|endoftext|>"} {"text":"<commit_before>\/*\r\nDwarf Therapist\r\nCopyright (c) 2009 Trey Stout (chmod)\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n*\/\r\n#include <QtCore>\r\n#include <QtDebug>\r\n\r\n#include \"dfinstance.h\"\r\n#include \"dwarfmodel.h\"\r\n#include \"dwarf.h\"\r\n#include \"skill.h\"wh\r\n#include \"labor.h\"\r\n#include \"profession.h\"\r\n#include \"statetableview.h\"\r\n#include \"defines.h\"\r\n#include \"dwarftherapist.h\"\r\n\r\n#include \"columntypes.h\"\r\n#include \"gridview.h\"\r\n#include \"viewcolumnset.h\"\r\n#include \"viewcolumn.h\"\r\n#include \"laborcolumn.h\"\r\n#include \"skillcolumn.h\"\r\n#include \"spacercolumn.h\"\r\n\r\n\r\nDwarfModel::DwarfModel(QObject *parent)\r\n\t: QStandardItemModel(parent)\r\n\t, m_df(0)\r\n\t, m_group_by(GB_NOTHING)\r\n\t, m_selected_col(-1)\r\n{}\r\n\r\nDwarfModel::~DwarfModel() {\r\n\tclear_all();\r\n}\r\n\r\nvoid DwarfModel::clear_all() {\r\n\tclear_pending();\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tdelete d;\r\n\t}\r\n\tm_dwarves.clear();\r\n\tm_grouped_dwarves.clear();\r\n\tclear();\r\n}\r\n\r\nvoid DwarfModel::section_right_clicked(int col) {\r\n\tif (col == m_selected_col) {\r\n\t\tm_selected_col = -1; \/\/ turn off the guides\r\n\t} else {\r\n\t\tm_selected_col = col;\r\n\t}\r\n\temit dataChanged(index(0, col), index(rowCount()-1, col));\r\n}\r\n\r\nvoid DwarfModel::load_dwarves() {\r\n\t\/\/ clear id->dwarf map\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tdelete d;\r\n\t}\r\n\tm_dwarves.clear();\r\n\tif (rowCount())\r\n\t\tremoveRows(0, rowCount());\r\n\r\n\tm_df->attach();\r\n\tforeach(Dwarf *d, m_df->load_dwarves()) {\r\n\t\tm_dwarves[d->id()] = d;\r\n\t}\r\n\tm_df->detach();\r\n\t\/*! Let's try to guess the wave a dwarf arrived in based on ID.\r\n\tThe game appears to assign ids to creates in a serial manner.\r\n\tSince at least 1 season seems to pass in between waves there is a\r\n\thigh likelihood that dwarves arriving in a new wave will be folling\r\n\tseveral other creatures such as groundhogs and the like, thus\r\n\tproducing a gap in IDs of more than 1 \r\n\t*\/\r\n\tint last_id = 0;\r\n\tint wave = 0;\r\n\tQList<int> ids = m_dwarves.uniqueKeys(); \/\/ get all ids\r\n\tqSort(ids); \/\/ now in order;\r\n\tfor (int i = 0; i < ids.size(); ++i) {\r\n\t\tint id = ids.at(i);\r\n\t\tif ((id - last_id) > 5)\r\n\t\t\twave++;\r\n\t\tlast_id = id;\r\n\t\tm_dwarves[id]->set_migration_wave(wave);\r\n\t}\r\n \r\n}\r\n\r\nvoid DwarfModel::build_rows() {\r\n\t\/\/ don't need to go delete the dwarf pointers in here, since the earlier foreach should have\r\n\t\/\/ deleted them\r\n\tm_grouped_dwarves.clear();\r\n\tclear();\r\n\r\n\t\/\/ populate dwarf maps\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tswitch (m_group_by) {\r\n\t\t\tcase GB_NOTHING:\r\n\t\t\t\tm_grouped_dwarves[QString::number(d->id())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_PROFESSION:\r\n\t\t\t\tm_grouped_dwarves[d->profession()].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_LEGENDARY:\r\n\t\t\t\t{\r\n\t\t\t\t\tint legendary_skills = 0;\r\n\t\t\t\t\tforeach(Skill s, *d->get_skills()) {\r\n\t\t\t\t\t\tif (s.rating() >= 15)\r\n\t\t\t\t\t\t\tlegendary_skills++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (legendary_skills)\r\n\t\t\t\t\t\tm_grouped_dwarves[\"Legends\"].append(d);\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tm_grouped_dwarves[\"Losers\"].append(d);\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\tcase GB_SEX:\r\n\t\t\t\tif (d->is_male())\r\n\t\t\t\t\tm_grouped_dwarves[\"Males\"].append(d);\r\n\t\t\t\telse\r\n\t\t\t\t\tm_grouped_dwarves[\"Females\"].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_HAPPINESS:\r\n\t\t\t\tm_grouped_dwarves[QString::number(d->get_happiness())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_MIGRATION_WAVE:\r\n\t\t\t\tm_grouped_dwarves[QString(\"Wave %1\").arg(d->migration_wave())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tint start_col = 1;\r\n\tsetHorizontalHeaderItem(0, new QStandardItem);\r\n\temit clear_spacers();\r\n\tQSettings *s = DT->user_settings();\r\n\tint width = s->value(\"options\/grid\/cell_size\", DEFAULT_CELL_SIZE).toInt();\r\n\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\tQStandardItem *header = new QStandardItem(col->title());\r\n\t\t\theader->setData(col->bg_color(), Qt::BackgroundColorRole);\r\n\t\t\tsetHorizontalHeaderItem(start_col++, header);\r\n\t\t\tswitch (col->type()) {\r\n\t\t\t\tcase CT_SPACER:\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tSpacerColumn *c = static_cast<SpacerColumn*>(col);\r\n\t\t\t\t\t\temit set_index_as_spacer(start_col - 1);\r\n\t\t\t\t\t\temit preferred_header_size(start_col - 1, c->width());\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\temit preferred_header_size(start_col - 1, width);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/FIXME : jump to prof and jump to pending change\r\n\tif (m_group_by == GB_PROFESSION) {\r\n\t\t\/\/ sort professions by column labors\r\n\t\tQStringList group_order;\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tint skill = -1;\r\n\t\t\t\tif (col->type() == CT_LABOR) {\r\n\t\t\t\t\tLaborColumn *lc = static_cast<LaborColumn*>(col);\r\n\t\t\t\t\tskill = lc->skill_id();\r\n\t\t\t\t} else if (col->type() == CT_SKILL) {\r\n\t\t\t\t\tSkillColumn *sc = static_cast<SkillColumn*>(col);\r\n\t\t\t\t\tskill = sc->skill_id();\r\n\t\t\t\t}\r\n\t\t\t\tif (skill != -1) {\r\n\t\t\t\t\tgroup_order << GameDataReader::ptr()->get_skill_name(skill);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tforeach(QString prof_name, group_order) {\r\n\t\t\tif (m_grouped_dwarves.contains(prof_name)) {\r\n\t\t\t\tbuild_row(prof_name);\r\n\t\t\t}\r\n\t\t}\r\n\t\tforeach(QString key, m_grouped_dwarves.uniqueKeys()) {\r\n\t\t\tif (!group_order.contains(key)) {\r\n\t\t\t\tbuild_row(key);\r\n\t\t\t}\r\n\t\t}\r\n\t} else {\r\n\t\tforeach(QString key, m_grouped_dwarves.uniqueKeys()) {\r\n\t\t\tbuild_row(key);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid DwarfModel::build_row(const QString &key) {\r\n\tQIcon icn_f(\":img\/female.png\");\r\n\tQIcon icn_m(\":img\/male.png\");\r\n\tQStandardItem *root = 0;\r\n\tQList<QStandardItem*> root_row;\r\n\r\n\tif (m_group_by != GB_NOTHING) {\r\n\t\t\/\/ we need a root element to hold group members...\r\n\t\tQString title = QString(\"%1 (%2)\").arg(key).arg(m_grouped_dwarves.value(key).size());\r\n\t\troot = new QStandardItem(title);\r\n\t\troot->setData(true, DR_IS_AGGREGATE);\r\n\t\troot->setData(0, DR_RATING);\r\n\t\troot_row << root;\r\n\t}\r\n\r\n\tif (root) { \/\/ we have a parent, so we should draw an aggregate row\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tQStandardItem *item = col->build_aggregate(key, m_grouped_dwarves[key]);\r\n\t\t\t\troot_row << item;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tforeach(Dwarf *d, m_grouped_dwarves.value(key)) {\r\n Profession *p = GameDataReader::ptr()->get_profession(d->raw_profession());\r\n QString name = d->nice_name();\r\n if (p && p->is_military())\r\n name = \"[M]\" + name;\r\n\t\tQStandardItem *i_name = new QStandardItem(name);\r\n\r\n\t\ti_name->setToolTip(d->tooltip_text());\r\n\t\ti_name->setStatusTip(d->nice_name());\r\n\t\ti_name->setData(false, DR_IS_AGGREGATE);\r\n\t\ti_name->setData(0, DR_RATING);\r\n\t\ti_name->setData(d->id(), DR_ID);\r\n i_name->setData(d->raw_profession(), DR_SORT_VALUE);\r\n\t\t\r\n\t\tif (d->is_male()) {\r\n\t\t\ti_name->setIcon(icn_m);\r\n\t\t} else {\r\n\t\t\ti_name->setIcon(icn_f);\r\n\t\t}\r\n\r\n\t\tQList<QStandardItem*> items;\r\n\t\titems << i_name;\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tQStandardItem *item = col->build_cell(d);\r\n\t\t\t\titems << item;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (root) {\r\n\t\t\troot->appendRow(items);\r\n\t\t} else {\r\n\t\t\tappendRow(items);\r\n\t\t}\r\n\t\td->m_name_idx = indexFromItem(i_name);\r\n\t}\r\n\tif (root) {\r\n\t\tappendRow(root_row);\r\n\t}\r\n}\r\n\r\nvoid DwarfModel::cell_activated(const QModelIndex &idx) {\r\n QStandardItem *item = itemFromIndex(idx);\r\n bool is_aggregate = item->data(DR_IS_AGGREGATE).toBool();\r\n if (idx.column() == 0) {\r\n if (is_aggregate)\r\n return; \/\/ no double clicking aggregate names\r\n int dwarf_id = item->data(DR_ID).toInt(); \/\/ TODO: handle no id\r\n if (!dwarf_id) {\r\n LOGW << \"double clicked what should have been a dwarf name, but the ID wasn't set!\";\r\n return;\r\n }\r\n Dwarf *d = get_dwarf_by_id(dwarf_id);\r\n d->show_details();\r\n return;\r\n }\r\n\r\n\tCOLUMN_TYPE type = static_cast<COLUMN_TYPE>(idx.data(DwarfModel::DR_COL_TYPE).toInt());\r\n\tif (type != CT_LABOR) \r\n\t\treturn;\r\n\r\n\t\r\n\tQ_ASSERT(item);\r\n\r\n\tint labor_id = item->data(DR_LABOR_ID).toInt();\r\n\tint dwarf_id = item->data(DR_ID).toInt(); \/\/ TODO: handle no id\r\n\tif (is_aggregate) {\r\n\t\tQModelIndex first_col = idx.sibling(idx.row(), 0);\r\n\t\t\r\n\t\t\/\/ first find out how many are enabled...\r\n\t\tint enabled_count = 0;\r\n\t\tQString group_name = idx.data(DwarfModel::DR_GROUP_NAME).toString();\r\n\t\tint children = rowCount(first_col);\r\n\r\n\t\tforeach(Dwarf *d, m_grouped_dwarves.value(group_name)) {\r\n\t\t\tif (d->is_labor_enabled(labor_id))\r\n\t\t\t\tenabled_count++;\r\n\t\t}\r\n\r\n\t\t\/\/ if none or some are enabled, enable all of them\r\n\t\tbool enabled = (enabled_count < children);\r\n\t\tforeach(Dwarf *d, m_grouped_dwarves.value(group_name)) {\r\n\t\t\td->set_labor(labor_id, enabled);\r\n\t\t}\r\n\r\n\t\t\/\/ tell the view what we touched...\r\n\t\tsetData(idx, idx.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\tfor(int i = 0; i < rowCount(first_col); ++i) {\r\n\t\t\tQModelIndex tmp_index = index(i, idx.column(), first_col);\r\n\t\t\tsetData(tmp_index, tmp_index.data(DR_DUMMY).toInt()+1, DR_DUMMY);\r\n\t\t}\r\n\t} else {\r\n if (!dwarf_id) {\r\n LOGW << \"dwarf_id was 0 for cell at\" << idx << \"!\";\r\n } else {\r\n\t\t QModelIndex aggregate_col = index(idx.parent().row(), idx.column());\r\n\t\t if (aggregate_col.isValid())\r\n\t\t \tsetData(aggregate_col, aggregate_col.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\t setData(idx, idx.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\t m_dwarves[dwarf_id]->toggle_labor(labor_id);\r\n }\r\n\t}\r\n\tcalculate_pending();\r\n\tTRACE << \"toggling\" << labor_id << \"for dwarf:\" << dwarf_id;\r\n}\r\n\r\nvoid DwarfModel::set_group_by(int group_by) {\r\n\tLOGD << \"group_by now set to\" << group_by;\r\n\tm_group_by = static_cast<GROUP_BY>(group_by);\r\n\tif (m_df)\r\n\t\tbuild_rows();\r\n}\r\n\r\nvoid DwarfModel::calculate_pending() {\r\n\tint changes = 0;\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tchanges += d->pending_changes();\r\n\t}\r\n\temit new_pending_changes(changes);\r\n}\r\n\r\nvoid DwarfModel::clear_pending() {\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes()) {\r\n\t\t\td->clear_pending();\r\n\t\t}\r\n\t}\r\n\t\/\/reset();\r\n\temit new_pending_changes(0);\r\n\temit need_redraw();\r\n}\r\n\r\nvoid DwarfModel::commit_pending() {\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes()) {\r\n\t\t\td->commit_pending();\r\n\t\t}\r\n\t}\r\n\tload_dwarves();\r\n\temit new_pending_changes(0);\r\n\temit need_redraw();\r\n}\r\n\r\nQVector<Dwarf*> DwarfModel::get_dirty_dwarves() {\r\n\tQVector<Dwarf*> dwarves;\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes())\r\n\t\t\tdwarves.append(d);\r\n\t}\r\n\treturn dwarves;\r\n}\r\n<commit_msg>stupid typo<commit_after>\/*\r\nDwarf Therapist\r\nCopyright (c) 2009 Trey Stout (chmod)\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n*\/\r\n#include <QtCore>\r\n#include <QtDebug>\r\n\r\n#include \"dfinstance.h\"\r\n#include \"dwarfmodel.h\"\r\n#include \"dwarf.h\"\r\n#include \"skill.h\"\r\n#include \"labor.h\"\r\n#include \"profession.h\"\r\n#include \"statetableview.h\"\r\n#include \"defines.h\"\r\n#include \"dwarftherapist.h\"\r\n\r\n#include \"columntypes.h\"\r\n#include \"gridview.h\"\r\n#include \"viewcolumnset.h\"\r\n#include \"viewcolumn.h\"\r\n#include \"laborcolumn.h\"\r\n#include \"skillcolumn.h\"\r\n#include \"spacercolumn.h\"\r\n\r\n\r\nDwarfModel::DwarfModel(QObject *parent)\r\n\t: QStandardItemModel(parent)\r\n\t, m_df(0)\r\n\t, m_group_by(GB_NOTHING)\r\n\t, m_selected_col(-1)\r\n{}\r\n\r\nDwarfModel::~DwarfModel() {\r\n\tclear_all();\r\n}\r\n\r\nvoid DwarfModel::clear_all() {\r\n\tclear_pending();\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tdelete d;\r\n\t}\r\n\tm_dwarves.clear();\r\n\tm_grouped_dwarves.clear();\r\n\tclear();\r\n}\r\n\r\nvoid DwarfModel::section_right_clicked(int col) {\r\n\tif (col == m_selected_col) {\r\n\t\tm_selected_col = -1; \/\/ turn off the guides\r\n\t} else {\r\n\t\tm_selected_col = col;\r\n\t}\r\n\temit dataChanged(index(0, col), index(rowCount()-1, col));\r\n}\r\n\r\nvoid DwarfModel::load_dwarves() {\r\n\t\/\/ clear id->dwarf map\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tdelete d;\r\n\t}\r\n\tm_dwarves.clear();\r\n\tif (rowCount())\r\n\t\tremoveRows(0, rowCount());\r\n\r\n\tm_df->attach();\r\n\tforeach(Dwarf *d, m_df->load_dwarves()) {\r\n\t\tm_dwarves[d->id()] = d;\r\n\t}\r\n\tm_df->detach();\r\n\t\/*! Let's try to guess the wave a dwarf arrived in based on ID.\r\n\tThe game appears to assign ids to creates in a serial manner.\r\n\tSince at least 1 season seems to pass in between waves there is a\r\n\thigh likelihood that dwarves arriving in a new wave will be folling\r\n\tseveral other creatures such as groundhogs and the like, thus\r\n\tproducing a gap in IDs of more than 1 \r\n\t*\/\r\n\tint last_id = 0;\r\n\tint wave = 0;\r\n\tQList<int> ids = m_dwarves.uniqueKeys(); \/\/ get all ids\r\n\tqSort(ids); \/\/ now in order;\r\n\tfor (int i = 0; i < ids.size(); ++i) {\r\n\t\tint id = ids.at(i);\r\n\t\tif ((id - last_id) > 5)\r\n\t\t\twave++;\r\n\t\tlast_id = id;\r\n\t\tm_dwarves[id]->set_migration_wave(wave);\r\n\t}\r\n \r\n}\r\n\r\nvoid DwarfModel::build_rows() {\r\n\t\/\/ don't need to go delete the dwarf pointers in here, since the earlier foreach should have\r\n\t\/\/ deleted them\r\n\tm_grouped_dwarves.clear();\r\n\tclear();\r\n\r\n\t\/\/ populate dwarf maps\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tswitch (m_group_by) {\r\n\t\t\tcase GB_NOTHING:\r\n\t\t\t\tm_grouped_dwarves[QString::number(d->id())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_PROFESSION:\r\n\t\t\t\tm_grouped_dwarves[d->profession()].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_LEGENDARY:\r\n\t\t\t\t{\r\n\t\t\t\t\tint legendary_skills = 0;\r\n\t\t\t\t\tforeach(Skill s, *d->get_skills()) {\r\n\t\t\t\t\t\tif (s.rating() >= 15)\r\n\t\t\t\t\t\t\tlegendary_skills++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (legendary_skills)\r\n\t\t\t\t\t\tm_grouped_dwarves[\"Legends\"].append(d);\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tm_grouped_dwarves[\"Losers\"].append(d);\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\tcase GB_SEX:\r\n\t\t\t\tif (d->is_male())\r\n\t\t\t\t\tm_grouped_dwarves[\"Males\"].append(d);\r\n\t\t\t\telse\r\n\t\t\t\t\tm_grouped_dwarves[\"Females\"].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_HAPPINESS:\r\n\t\t\t\tm_grouped_dwarves[QString::number(d->get_happiness())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t\tcase GB_MIGRATION_WAVE:\r\n\t\t\t\tm_grouped_dwarves[QString(\"Wave %1\").arg(d->migration_wave())].append(d);\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\r\n\tint start_col = 1;\r\n\tsetHorizontalHeaderItem(0, new QStandardItem);\r\n\temit clear_spacers();\r\n\tQSettings *s = DT->user_settings();\r\n\tint width = s->value(\"options\/grid\/cell_size\", DEFAULT_CELL_SIZE).toInt();\r\n\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\tQStandardItem *header = new QStandardItem(col->title());\r\n\t\t\theader->setData(col->bg_color(), Qt::BackgroundColorRole);\r\n\t\t\tsetHorizontalHeaderItem(start_col++, header);\r\n\t\t\tswitch (col->type()) {\r\n\t\t\t\tcase CT_SPACER:\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tSpacerColumn *c = static_cast<SpacerColumn*>(col);\r\n\t\t\t\t\t\temit set_index_as_spacer(start_col - 1);\r\n\t\t\t\t\t\temit preferred_header_size(start_col - 1, c->width());\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\temit preferred_header_size(start_col - 1, width);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t\/\/FIXME : jump to prof and jump to pending change\r\n\tif (m_group_by == GB_PROFESSION) {\r\n\t\t\/\/ sort professions by column labors\r\n\t\tQStringList group_order;\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tint skill = -1;\r\n\t\t\t\tif (col->type() == CT_LABOR) {\r\n\t\t\t\t\tLaborColumn *lc = static_cast<LaborColumn*>(col);\r\n\t\t\t\t\tskill = lc->skill_id();\r\n\t\t\t\t} else if (col->type() == CT_SKILL) {\r\n\t\t\t\t\tSkillColumn *sc = static_cast<SkillColumn*>(col);\r\n\t\t\t\t\tskill = sc->skill_id();\r\n\t\t\t\t}\r\n\t\t\t\tif (skill != -1) {\r\n\t\t\t\t\tgroup_order << GameDataReader::ptr()->get_skill_name(skill);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tforeach(QString prof_name, group_order) {\r\n\t\t\tif (m_grouped_dwarves.contains(prof_name)) {\r\n\t\t\t\tbuild_row(prof_name);\r\n\t\t\t}\r\n\t\t}\r\n\t\tforeach(QString key, m_grouped_dwarves.uniqueKeys()) {\r\n\t\t\tif (!group_order.contains(key)) {\r\n\t\t\t\tbuild_row(key);\r\n\t\t\t}\r\n\t\t}\r\n\t} else {\r\n\t\tforeach(QString key, m_grouped_dwarves.uniqueKeys()) {\r\n\t\t\tbuild_row(key);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid DwarfModel::build_row(const QString &key) {\r\n\tQIcon icn_f(\":img\/female.png\");\r\n\tQIcon icn_m(\":img\/male.png\");\r\n\tQStandardItem *root = 0;\r\n\tQList<QStandardItem*> root_row;\r\n\r\n\tif (m_group_by != GB_NOTHING) {\r\n\t\t\/\/ we need a root element to hold group members...\r\n\t\tQString title = QString(\"%1 (%2)\").arg(key).arg(m_grouped_dwarves.value(key).size());\r\n\t\troot = new QStandardItem(title);\r\n\t\troot->setData(true, DR_IS_AGGREGATE);\r\n\t\troot->setData(0, DR_RATING);\r\n\t\troot_row << root;\r\n\t}\r\n\r\n\tif (root) { \/\/ we have a parent, so we should draw an aggregate row\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tQStandardItem *item = col->build_aggregate(key, m_grouped_dwarves[key]);\r\n\t\t\t\troot_row << item;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t\r\n\tforeach(Dwarf *d, m_grouped_dwarves.value(key)) {\r\n Profession *p = GameDataReader::ptr()->get_profession(d->raw_profession());\r\n QString name = d->nice_name();\r\n if (p && p->is_military())\r\n name = \"[M]\" + name;\r\n\t\tQStandardItem *i_name = new QStandardItem(name);\r\n\r\n\t\ti_name->setToolTip(d->tooltip_text());\r\n\t\ti_name->setStatusTip(d->nice_name());\r\n\t\ti_name->setData(false, DR_IS_AGGREGATE);\r\n\t\ti_name->setData(0, DR_RATING);\r\n\t\ti_name->setData(d->id(), DR_ID);\r\n i_name->setData(d->raw_profession(), DR_SORT_VALUE);\r\n\t\t\r\n\t\tif (d->is_male()) {\r\n\t\t\ti_name->setIcon(icn_m);\r\n\t\t} else {\r\n\t\t\ti_name->setIcon(icn_f);\r\n\t\t}\r\n\r\n\t\tQList<QStandardItem*> items;\r\n\t\titems << i_name;\r\n\t\tforeach(ViewColumnSet *set, m_gridview->sets()) {\r\n\t\t\tforeach(ViewColumn *col, set->columns()) {\r\n\t\t\t\tQStandardItem *item = col->build_cell(d);\r\n\t\t\t\titems << item;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (root) {\r\n\t\t\troot->appendRow(items);\r\n\t\t} else {\r\n\t\t\tappendRow(items);\r\n\t\t}\r\n\t\td->m_name_idx = indexFromItem(i_name);\r\n\t}\r\n\tif (root) {\r\n\t\tappendRow(root_row);\r\n\t}\r\n}\r\n\r\nvoid DwarfModel::cell_activated(const QModelIndex &idx) {\r\n QStandardItem *item = itemFromIndex(idx);\r\n bool is_aggregate = item->data(DR_IS_AGGREGATE).toBool();\r\n if (idx.column() == 0) {\r\n if (is_aggregate)\r\n return; \/\/ no double clicking aggregate names\r\n int dwarf_id = item->data(DR_ID).toInt(); \/\/ TODO: handle no id\r\n if (!dwarf_id) {\r\n LOGW << \"double clicked what should have been a dwarf name, but the ID wasn't set!\";\r\n return;\r\n }\r\n Dwarf *d = get_dwarf_by_id(dwarf_id);\r\n d->show_details();\r\n return;\r\n }\r\n\r\n\tCOLUMN_TYPE type = static_cast<COLUMN_TYPE>(idx.data(DwarfModel::DR_COL_TYPE).toInt());\r\n\tif (type != CT_LABOR) \r\n\t\treturn;\r\n\r\n\t\r\n\tQ_ASSERT(item);\r\n\r\n\tint labor_id = item->data(DR_LABOR_ID).toInt();\r\n\tint dwarf_id = item->data(DR_ID).toInt(); \/\/ TODO: handle no id\r\n\tif (is_aggregate) {\r\n\t\tQModelIndex first_col = idx.sibling(idx.row(), 0);\r\n\t\t\r\n\t\t\/\/ first find out how many are enabled...\r\n\t\tint enabled_count = 0;\r\n\t\tQString group_name = idx.data(DwarfModel::DR_GROUP_NAME).toString();\r\n\t\tint children = rowCount(first_col);\r\n\r\n\t\tforeach(Dwarf *d, m_grouped_dwarves.value(group_name)) {\r\n\t\t\tif (d->is_labor_enabled(labor_id))\r\n\t\t\t\tenabled_count++;\r\n\t\t}\r\n\r\n\t\t\/\/ if none or some are enabled, enable all of them\r\n\t\tbool enabled = (enabled_count < children);\r\n\t\tforeach(Dwarf *d, m_grouped_dwarves.value(group_name)) {\r\n\t\t\td->set_labor(labor_id, enabled);\r\n\t\t}\r\n\r\n\t\t\/\/ tell the view what we touched...\r\n\t\tsetData(idx, idx.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\tfor(int i = 0; i < rowCount(first_col); ++i) {\r\n\t\t\tQModelIndex tmp_index = index(i, idx.column(), first_col);\r\n\t\t\tsetData(tmp_index, tmp_index.data(DR_DUMMY).toInt()+1, DR_DUMMY);\r\n\t\t}\r\n\t} else {\r\n if (!dwarf_id) {\r\n LOGW << \"dwarf_id was 0 for cell at\" << idx << \"!\";\r\n } else {\r\n\t\t QModelIndex aggregate_col = index(idx.parent().row(), idx.column());\r\n\t\t if (aggregate_col.isValid())\r\n\t\t \tsetData(aggregate_col, aggregate_col.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\t setData(idx, idx.data(DR_DUMMY).toInt()+1, DR_DUMMY); \/\/ redraw the aggregate...\r\n\t\t m_dwarves[dwarf_id]->toggle_labor(labor_id);\r\n }\r\n\t}\r\n\tcalculate_pending();\r\n\tTRACE << \"toggling\" << labor_id << \"for dwarf:\" << dwarf_id;\r\n}\r\n\r\nvoid DwarfModel::set_group_by(int group_by) {\r\n\tLOGD << \"group_by now set to\" << group_by;\r\n\tm_group_by = static_cast<GROUP_BY>(group_by);\r\n\tif (m_df)\r\n\t\tbuild_rows();\r\n}\r\n\r\nvoid DwarfModel::calculate_pending() {\r\n\tint changes = 0;\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tchanges += d->pending_changes();\r\n\t}\r\n\temit new_pending_changes(changes);\r\n}\r\n\r\nvoid DwarfModel::clear_pending() {\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes()) {\r\n\t\t\td->clear_pending();\r\n\t\t}\r\n\t}\r\n\t\/\/reset();\r\n\temit new_pending_changes(0);\r\n\temit need_redraw();\r\n}\r\n\r\nvoid DwarfModel::commit_pending() {\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes()) {\r\n\t\t\td->commit_pending();\r\n\t\t}\r\n\t}\r\n\tload_dwarves();\r\n\temit new_pending_changes(0);\r\n\temit need_redraw();\r\n}\r\n\r\nQVector<Dwarf*> DwarfModel::get_dirty_dwarves() {\r\n\tQVector<Dwarf*> dwarves;\r\n\tforeach(Dwarf *d, m_dwarves) {\r\n\t\tif (d->pending_changes())\r\n\t\t\tdwarves.append(d);\r\n\t}\r\n\treturn dwarves;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>static int clear_stack(lua_State *lua) {\n lua_pop(lua, lua_gettop(lua));\n return 0;\n}\n\ninternal s32 lua_graphics_load_texture(lua_State *lua) {\n char *filename = (char *)lua_tostring(lua, 1);\n\n Texture texture = graphics_load_texture(filename);\n \/\/ Can't just push the texture as userdata because it gets\n \/\/ deleted after scope finishes\n lua_newtable(lua);\n lua_pushnumber(lua, texture.width);\n lua_setfield(lua, -2, \"width\");\n lua_pushnumber(lua, texture.height);\n lua_setfield(lua, -2, \"height\");\n lua_pushnumber(lua, texture.gl_handle);\n lua_setfield(lua, -2, \"handle\");\n \/\/ This should be used to determine if the proper type\n \/\/ is being passed into C functions from Lua\n lua_pushstring(lua, \"__TEXTURE__\");\n lua_setfield(lua, -2, \"__type\");\n return 1;\n}\n\ninternal s32 lua_graphics_draw_sprite(lua_State *lua) {\n \/\/ TODO(zedzull): This should probably check for the correct arguments\n\tluaL_checktype(lua, 1, LUA_TTABLE);\n lua_getfield(lua, 1, \"__type\");\n const char *type = luaL_checkstring(lua, -1);\n \/\/ TODO(darithorn): Check if type == \"__TEXTURE__\"\n lua_getfield(lua, 1, \"width\");\n lua_getfield(lua, 1, \"height\");\n lua_getfield(lua, 1, \"handle\");\n int width = luaL_checknumber(lua, -3);\n int height = luaL_checknumber(lua, -2);\n GLuint handle = (GLuint)luaL_checknumber(lua, -1);\n Texture texture = { width, height, handle };\n f32 x = lua_tonumber(lua, 2);\n f32 y = lua_tonumber(lua, 3);\n\n graphics_draw_sprite(texture, x, y);\n clear_stack(lua);\n return 0;\n}\n\nstatic int lua_graphics_draw_sprite_ex(lua_State *lua) {\n luaL_checktype(lua, 1, LUA_TTABLE);\n lua_getfield(lua, 1, \"__type\");\n const char *type = luaL_checkstring(lua, -1);\n \/\/ TODO(darithorn): Check if type == \"__TEXTURE__\"\n lua_getfield(lua, 1, \"width\");\n lua_getfield(lua, 1, \"height\");\n lua_getfield(lua, 1, \"handle\");\n int width = luaL_checknumber(lua, -3);\n int height = luaL_checknumber(lua, -2);\n GLuint handle = (GLuint)luaL_checknumber(lua, -1);\n Texture texture = { width, height, handle };\n float dest_x = lua_tonumber(lua, 2);\n float dest_y = lua_tonumber(lua, 3);\n float dest_width = lua_tonumber(lua, 4);\n float dest_height = lua_tonumber(lua, 5);\n float src_x = lua_tonumber(lua, 6);\n float src_y = lua_tonumber(lua, 7);\n float src_width = lua_tonumber(lua, 8);\n float src_height = lua_tonumber(lua, 9);\n\n graphics_draw_sprite_ex(texture, \n dest_x, dest_y, dest_width, dest_height, \n src_x, src_y, src_width, src_height);\n clear_stack(lua);\n return 0;\n}\n\ninternal s32 lua_runtime_error(lua_State *lua) {\n luaL_traceback(lua, lua, lua_tostring(lua, lua_gettop(lua)), 1);\n printf(\"%s\\n\", lua_tolstring(lua, lua_gettop(lua), NULL));\n\n exit(1);\n\n return 0;\n}\n\ninternal s32 safe_lua_call(lua_State *lua, s32 num_args, s32 num_returns) {\n s32 error_handler_pos = lua_gettop(lua) - num_args;\n\n lua_pushcfunction(lua, lua_runtime_error);\n lua_insert(lua, error_handler_pos);\n\n s32 result = lua_pcall(lua, num_args, num_returns, error_handler_pos);\n\n lua_remove(lua, error_handler_pos);\n\n return result;\n}\n\ninternal lua_State *lua;\n\nbool script_init(const char *file) {\n lua = luaL_newstate();\n luaL_openlibs(lua);\n\n lua_newtable(lua);\n\n \/\/ Bind graphics functions\n {\n lua_newtable(lua);\n\n lua_pushcfunction(lua, lua_graphics_load_texture);\n lua_setfield(lua, lua_gettop(lua) - 1, \"load_texture\");\n\n lua_pushcfunction(lua, lua_graphics_draw_sprite);\n lua_setfield(lua, lua_gettop(lua) - 1, \"draw_sprite\");\n\n lua_pushcfunction(lua, lua_graphics_draw_sprite_ex);\n lua_setfield(lua, lua_gettop(lua) - 1, \"draw_sprite_ex\");\n\n lua_setfield(lua, lua_gettop(lua) - 1, \"graphics\");\n }\n\n lua_setglobal(lua, \"zull\");\n\n s32 status = luaL_loadfile(lua, file);\n\n if (status == LUA_ERRFILE) {\n printf(\"Could not load '%s'!\\n\", file);\n return false;\n }\n\n if (status == LUA_ERRSYNTAX) {\n printf(\"%s\\n\", lua_tolstring(lua, lua_gettop(lua), NULL));\n return false;\n }\n\n safe_lua_call(lua, 0, 0);\n\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"init\");\n\n safe_lua_call(lua, 0, 0);\n\n return true;\n}\n\n\/\/ TODO(zedzull): If any of these built-in \"callback\" functions aren't present in the script, it generates a runtime error.\nvoid script_update(f64 delta_time) {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"update\");\n lua_pushnumber(lua, delta_time);\n\n safe_lua_call(lua, 1, 0);\n}\n\nvoid script_draw() {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"draw\");\n\n safe_lua_call(lua, 0, 0);\n}\n\nvoid script_shutdown() {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"shutdown\");\n\n safe_lua_call(lua, 0, 0);\n\n lua_close(lua);\n}\n<commit_msg>Added script_input_update<commit_after>static int clear_stack(lua_State *lua) {\n lua_pop(lua, lua_gettop(lua));\n return 0;\n}\n\ninternal s32 lua_graphics_load_texture(lua_State *lua) {\n char *filename = (char *)lua_tostring(lua, 1);\n\n Texture texture = graphics_load_texture(filename);\n \/\/ Can't just push the texture as userdata because it gets\n \/\/ deleted after scope finishes\n lua_newtable(lua);\n lua_pushnumber(lua, texture.width);\n lua_setfield(lua, -2, \"width\");\n lua_pushnumber(lua, texture.height);\n lua_setfield(lua, -2, \"height\");\n lua_pushnumber(lua, texture.gl_handle);\n lua_setfield(lua, -2, \"handle\");\n \/\/ This should be used to determine if the proper type\n \/\/ is being passed into C functions from Lua\n lua_pushstring(lua, \"__TEXTURE__\");\n lua_setfield(lua, -2, \"__type\");\n return 1;\n}\n\ninternal s32 lua_graphics_draw_sprite(lua_State *lua) {\n \/\/ TODO(zedzull): This should probably check for the correct arguments\n\tluaL_checktype(lua, 1, LUA_TTABLE);\n lua_getfield(lua, 1, \"__type\");\n const char *type = luaL_checkstring(lua, -1);\n \/\/ TODO(darithorn): Check if type == \"__TEXTURE__\"\n lua_getfield(lua, 1, \"width\");\n lua_getfield(lua, 1, \"height\");\n lua_getfield(lua, 1, \"handle\");\n int width = luaL_checknumber(lua, -3);\n int height = luaL_checknumber(lua, -2);\n GLuint handle = (GLuint)luaL_checknumber(lua, -1);\n Texture texture = { width, height, handle };\n f32 x = lua_tonumber(lua, 2);\n f32 y = lua_tonumber(lua, 3);\n\n graphics_draw_sprite(texture, x, y);\n clear_stack(lua);\n return 0;\n}\n\nstatic int lua_graphics_draw_sprite_ex(lua_State *lua) {\n luaL_checktype(lua, 1, LUA_TTABLE);\n lua_getfield(lua, 1, \"__type\");\n const char *type = luaL_checkstring(lua, -1);\n \/\/ TODO(darithorn): Check if type == \"__TEXTURE__\"\n lua_getfield(lua, 1, \"width\");\n lua_getfield(lua, 1, \"height\");\n lua_getfield(lua, 1, \"handle\");\n int width = luaL_checknumber(lua, -3);\n int height = luaL_checknumber(lua, -2);\n GLuint handle = (GLuint)luaL_checknumber(lua, -1);\n Texture texture = { width, height, handle };\n float dest_x = lua_tonumber(lua, 2);\n float dest_y = lua_tonumber(lua, 3);\n float dest_width = lua_tonumber(lua, 4);\n float dest_height = lua_tonumber(lua, 5);\n float src_x = lua_tonumber(lua, 6);\n float src_y = lua_tonumber(lua, 7);\n float src_width = lua_tonumber(lua, 8);\n float src_height = lua_tonumber(lua, 9);\n\n graphics_draw_sprite_ex(texture, \n dest_x, dest_y, dest_width, dest_height, \n src_x, src_y, src_width, src_height);\n clear_stack(lua);\n return 0;\n}\n\ninternal s32 lua_runtime_error(lua_State *lua) {\n luaL_traceback(lua, lua, lua_tostring(lua, lua_gettop(lua)), 1);\n printf(\"%s\\n\", lua_tolstring(lua, lua_gettop(lua), NULL));\n\n exit(1);\n\n return 0;\n}\n\ninternal s32 safe_lua_call(lua_State *lua, s32 num_args, s32 num_returns) {\n s32 error_handler_pos = lua_gettop(lua) - num_args;\n\n lua_pushcfunction(lua, lua_runtime_error);\n lua_insert(lua, error_handler_pos);\n\n s32 result = lua_pcall(lua, num_args, num_returns, error_handler_pos);\n\n lua_remove(lua, error_handler_pos);\n clear_stack(lua);\n return result;\n}\n\ninternal lua_State *lua;\n\nbool script_init(const char *file) {\n lua = luaL_newstate();\n luaL_openlibs(lua);\n\n lua_newtable(lua);\n\n \/\/ Bind graphics functions\n {\n lua_newtable(lua);\n\n lua_pushcfunction(lua, lua_graphics_load_texture);\n lua_setfield(lua, lua_gettop(lua) - 1, \"load_texture\");\n\n lua_pushcfunction(lua, lua_graphics_draw_sprite);\n lua_setfield(lua, lua_gettop(lua) - 1, \"draw_sprite\");\n\n lua_pushcfunction(lua, lua_graphics_draw_sprite_ex);\n lua_setfield(lua, lua_gettop(lua) - 1, \"draw_sprite_ex\");\n\n lua_setfield(lua, lua_gettop(lua) - 1, \"graphics\");\n }\n\n lua_setglobal(lua, \"zull\");\n\n s32 status = luaL_loadfile(lua, file);\n\n if (status == LUA_ERRFILE) {\n printf(\"Could not load '%s'!\\n\", file);\n return false;\n }\n\n if (status == LUA_ERRSYNTAX) {\n printf(\"%s\\n\", lua_tolstring(lua, lua_gettop(lua), NULL));\n return false;\n }\n\n safe_lua_call(lua, 0, 0);\n\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"init\");\n\n safe_lua_call(lua, 0, 0);\n\n return true;\n}\n\n\/\/ TODO(zedzull): If any of these built-in \"callback\" functions aren't present in the script, it generates a runtime error.\nvoid script_update(f64 delta_time) {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"update\");\n lua_pushnumber(lua, delta_time);\n\n safe_lua_call(lua, 1, 0);\n}\n\nvoid script_draw() {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"draw\");\n\n safe_lua_call(lua, 0, 0);\n}\n\nvoid script_input_update(SDL_Event event) {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"input\");\n lua_newtable(lua);\n lua_pushstring(lua, \"__EVENT__\");\n lua_setfield(lua, -2, \"__type\");\n if (event.type == SDL_KEYUP || event.type == SDL_KEYDOWN) {\n lua_pushstring(lua, SDL_GetKeyName(event.key.keysym.sym));\n lua_setfield(lua, -2, \"key\");\n if (event.key.state == SDL_RELEASED) {\n lua_pushstring(lua, \"up\");\n } else {\n lua_pushstring(lua, \"down\");\n }\n lua_setfield(lua, -2, \"state\");\n }\n safe_lua_call(lua, 1, 0);\n}\n\nvoid script_shutdown() {\n lua_getglobal(lua, \"zull\");\n lua_getfield(lua, lua_gettop(lua), \"shutdown\");\n\n safe_lua_call(lua, 0, 0);\n\n lua_close(lua);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <xzero\/executor\/Executor.h>\n#include <xzero\/net\/InetConnector.h>\n#include <xzero\/net\/InetEndPoint.h>\n#include <xzero\/net\/ConnectionFactory.h>\n#include <xzero\/net\/Connection.h>\n#include <xzero\/net\/IPAddress.h>\n#include <xzero\/io\/SelectionKey.h>\n#include <xzero\/sysconfig.h>\n#include <algorithm>\n#include <mutex>\n#include <system_error>\n\n#include <netinet\/tcp.h>\n#include <arpa\/inet.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <netdb.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <unistd.h>\n#include <assert.h>\n\n#if defined(SD_FOUND)\n#include <systemd\/sd-daemon.h>\n#endif\n\n#if !defined(SO_REUSEPORT)\n#define SO_REUSEPORT 15\n#endif\n\n#if 0 \/\/ !defined(NDEBUG)\nstatic std::mutex m;\n#define TRACE(msg...) do { \\\n m.lock(); \\\n printf(\"InetConnector: \" msg); \\\n printf(\"\\n\"); \\\n m.unlock(); \\\n } while (0);\n#else\n#define TRACE(msg...) do { } while (0)\n#endif\n\nnamespace xzero {\n\nInetConnector::InetConnector(const std::string& name, Executor* executor,\n Scheduler* scheduler, Selector* selector,\n WallClock* clock)\n : Connector(name, executor, clock),\n selector_(selector),\n scheduler_(scheduler),\n connectedEndPoints_(),\n socket_(-1),\n addressFamily_(IPAddress::V4),\n typeMask_(0),\n flags_(0),\n backlog_(256),\n multiAcceptCount_(1),\n isStarted_(false) {\n}\n\nInetConnector::InetConnector(const std::string& name, Executor* executor,\n Scheduler* scheduler, Selector* selector,\n WallClock* clock,\n const IPAddress& ipaddress, int port, int backlog,\n bool reuseAddr, bool reusePort)\n : InetConnector(name, executor, scheduler, selector, clock) {\n\n open(ipaddress, port, backlog, reuseAddr, reusePort);\n}\n\nvoid InetConnector::open(const IPAddress& ipaddress, int port, int backlog,\n bool reuseAddr, bool reusePort) {\n if (isOpen())\n throw std::runtime_error(\"InetConnector already opened\");\n\n socket_ = ::socket(ipaddress.family(), SOCK_STREAM, 0);\n addressFamily_ = ipaddress.family();\n\n if (socket_ < 0)\n throw std::system_error(errno, std::system_category());\n\n if (reusePort)\n setReusePort(reusePort);\n\n if (reuseAddr)\n setReuseAddr(reuseAddr);\n\n bind(ipaddress, port);\n}\n\nvoid InetConnector::close() {\n if (isStarted()) {\n stop();\n }\n\n if (isOpen()) {\n ::close(socket_);\n socket_ = -1;\n }\n}\n\nvoid InetConnector::bind(const IPAddress& ipaddr, int port) {\n char sa[sizeof(sockaddr_in6)];\n socklen_t salen = ipaddr.size();\n\n switch (ipaddr.family()) {\n case IPAddress::V4:\n salen = sizeof(sockaddr_in);\n ((sockaddr_in*)sa)->sin_port = htons(port);\n ((sockaddr_in*)sa)->sin_family = AF_INET;\n memcpy(&((sockaddr_in*)sa)->sin_addr, ipaddr.data(), ipaddr.size());\n break;\n case IPAddress::V6:\n salen = sizeof(sockaddr_in6);\n ((sockaddr_in6*)sa)->sin6_port = htons(port);\n ((sockaddr_in6*)sa)->sin6_family = AF_INET6;\n memcpy(&((sockaddr_in6*)sa)->sin6_addr, ipaddr.data(), ipaddr.size());\n break;\n default:\n throw std::system_error(EINVAL, std::system_category());\n }\n\n int rv = ::bind(socket_, (sockaddr*)sa, salen);\n if (rv < 0)\n throw std::system_error(errno, std::system_category());\n\n addressFamily_ = ipaddr.family();\n}\n\nvoid InetConnector::listen(int backlog) {\n int rv = ::listen(socket_, backlog);\n if (rv < 0)\n throw std::system_error(errno, std::system_category());\n}\n\nbool InetConnector::isOpen() const noexcept {\n return socket_ >= 0;\n}\n\nInetConnector::~InetConnector() {\n TRACE(\"~InetConnector\");\n if (isStarted()) {\n stop();\n }\n\n if (socket_ >= 0) {\n ::close(socket_);\n }\n}\n\nSelector* InetConnector::selector() const noexcept {\n return selector_;\n}\n\nint InetConnector::handle() const noexcept {\n return socket_;\n}\n\nvoid InetConnector::setSocket(int socket) {\n socket_ = socket;\n}\n\nsize_t InetConnector::backlog() const noexcept {\n return backlog_;\n}\n\nvoid InetConnector::setBacklog(size_t value) {\n if (isStarted()) {\n throw std::runtime_error(\"Cannot change backlog when already listening.\");\n }\n\n backlog_ = value;\n}\n\nbool InetConnector::isBlocking() const {\n return !(fcntl(socket_, F_GETFL) & O_NONBLOCK);\n}\n\nvoid InetConnector::setBlocking(bool enable) {\n unsigned flags = enable ? fcntl(socket_, F_GETFL) & ~O_NONBLOCK\n : fcntl(socket_, F_GETFL) | O_NONBLOCK;\n\n if (fcntl(socket_, F_SETFL, flags) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n if (enable) {\n typeMask_ |= SOCK_NONBLOCK;\n } else {\n typeMask_ &= ~SOCK_NONBLOCK;\n }\n#else\n if (enable) {\n flags_ |= O_NONBLOCK;\n } else {\n flags_ &= ~O_NONBLOCK;\n }\n#endif\n}\n\nbool InetConnector::closeOnExec() const {\n return fcntl(socket_, F_GETFD) & FD_CLOEXEC;\n}\n\nvoid InetConnector::setCloseOnExec(bool enable) {\n unsigned flags = enable ? fcntl(socket_, F_GETFD) | FD_CLOEXEC\n : fcntl(socket_, F_GETFD) & ~FD_CLOEXEC;\n\n if (fcntl(socket_, F_SETFD, flags) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n if (enable) {\n typeMask_ |= SOCK_CLOEXEC;\n } else {\n typeMask_ &= ~SOCK_CLOEXEC;\n }\n#else\n if (enable) {\n flags_ |= O_CLOEXEC;\n } else {\n flags_ &= ~O_CLOEXEC;\n }\n#endif\n}\n\nbool InetConnector::deferAccept() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_TCP, TCP_DEFER_ACCEPT, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setDeferAccept(bool enable) {\n#if defined(TCP_DEFER_ACCEPT) && defined(ENABLE_TCP_DEFER_ACCEPT)\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_TCP, TCP_DEFER_ACCEPT, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n#else\n throw std::system_error(ENOTSUP, std::system_category());\n#endif\n}\n\nbool InetConnector::quickAck() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_TCP, TCP_QUICKACK, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setQuickAck(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_TCP, TCP_QUICKACK, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nbool InetConnector::reusePort() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_SOCKET, SO_REUSEPORT, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setReusePort(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_SOCKET, SO_REUSEPORT, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nbool InetConnector::reuseAddr() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_SOCKET, SO_REUSEADDR, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setReuseAddr(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_SOCKET, SO_REUSEADDR, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nsize_t InetConnector::multiAcceptCount() const noexcept {\n return multiAcceptCount_;\n}\n\nvoid InetConnector::setMultiAcceptCount(size_t value) noexcept {\n multiAcceptCount_ = value;\n}\n\nvoid InetConnector::start() {\n if (!isOpen()) {\n throw std::runtime_error(\"Connector must be open in order to be started.\");\n }\n\n if (isStarted()) {\n return;\n }\n\n listen(backlog_);\n\n isStarted_ = true;\n\n if (selector_)\n selectionKey_ = selector_->createSelectable(this, READ);\n else {\n executor()->execute([this]() {\n while (isStarted_) {\n acceptOne();\n }\n });\n }\n}\n\nbool InetConnector::isStarted() const noexcept {\n return isStarted_;\n}\n\nvoid InetConnector::stop() {\n TRACE(\"stop: %s\", name().c_str());\n if (!isStarted()) {\n return;\n }\n\n selectionKey_.reset();\n isStarted_ = false;\n}\n\nvoid InetConnector::onSelectable() noexcept {\n try {\n for (size_t i = 0; i < multiAcceptCount_; i++) {\n if (!acceptOne()) {\n break;\n }\n }\n } catch (const std::exception& e) {\n \/\/ TODO\n } catch (...) {\n \/\/ TODO\n }\n}\n\nbool InetConnector::acceptOne() {\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n bool flagged = true;\n int cfd = ::accept4(socket_, nullptr, 0, typeMask_);\n if (cfd < 0 && errno == ENOSYS) {\n cfd = ::accept(socket_, nullptr, 0);\n flagged = false;\n }\n#else\n bool flagged = false;\n int cfd = ::accept(socket_, nullptr, 0);\n#endif\n\n if (cfd < 0) {\n switch (errno) {\n case EINTR:\n case EAGAIN:\n#if EAGAIN != EWOULDBLOCK\n case EWOULDBLOCK:\n#endif\n return true;\n default:\n throw std::system_error(errno, std::system_category());\n }\n }\n\n if (!flagged && flags_ &&\n fcntl(cfd, F_SETFL, fcntl(cfd, F_GETFL) | flags_) < 0) {\n ::close(cfd);\n throw std::system_error(errno, std::system_category());\n }\n\n std::unique_ptr<InetEndPoint> endpoint(new InetEndPoint(cfd, this));\n connectedEndPoints_.push_back(endpoint.get());\n\n auto connection =\n defaultConnectionFactory()->create(this, std::move(endpoint));\n connection->onOpen();\n\n return true;\n}\n\nstd::list<EndPoint*> InetConnector::connectedEndPoints() {\n std::list<EndPoint*> result;\n for (InetEndPoint* ep : connectedEndPoints_) {\n result.push_back(ep);\n }\n return result;\n}\n\nvoid InetConnector::onEndPointClosed(InetEndPoint* endpoint) {\n assert(endpoint != nullptr);\n assert(endpoint->connection() != nullptr);\n\n auto i = std::find(connectedEndPoints_.begin(), connectedEndPoints_.end(),\n endpoint);\n\n assert(i != connectedEndPoints_.end());\n\n if (i != connectedEndPoints_.end()) {\n endpoint->connection()->onClose();\n\n connectedEndPoints_.erase(i);\n\n if (!endpoint->isBusy()) {\n \/\/ do only actually delete if not currently inside an io handler\n release(endpoint->connection());\n }\n }\n}\n\nvoid InetConnector::release(Connection* inetConnection) {\n assert(inetConnection != nullptr);\n assert(dynamic_cast<InetEndPoint*>(inetConnection->endpoint()) != nullptr);\n assert(!static_cast<InetEndPoint*>(inetConnection->endpoint())->isBusy());\n\n delete inetConnection;\n}\n\n} \/\/ namespace xzero\n<commit_msg>InetConnector blocking\/non-blocking fix<commit_after>#include <xzero\/executor\/Executor.h>\n#include <xzero\/net\/InetConnector.h>\n#include <xzero\/net\/InetEndPoint.h>\n#include <xzero\/net\/ConnectionFactory.h>\n#include <xzero\/net\/Connection.h>\n#include <xzero\/net\/IPAddress.h>\n#include <xzero\/io\/SelectionKey.h>\n#include <xzero\/sysconfig.h>\n#include <algorithm>\n#include <mutex>\n#include <system_error>\n\n#include <netinet\/tcp.h>\n#include <arpa\/inet.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/un.h>\n#include <netdb.h>\n#include <fcntl.h>\n#include <errno.h>\n#include <unistd.h>\n#include <assert.h>\n\n#if defined(SD_FOUND)\n#include <systemd\/sd-daemon.h>\n#endif\n\n#if !defined(SO_REUSEPORT)\n#define SO_REUSEPORT 15\n#endif\n\n#if 0 \/\/ !defined(NDEBUG)\nstatic std::mutex m;\n#define TRACE(msg...) do { \\\n m.lock(); \\\n printf(\"InetConnector: \" msg); \\\n printf(\"\\n\"); \\\n m.unlock(); \\\n } while (0);\n#else\n#define TRACE(msg...) do { } while (0)\n#endif\n\nnamespace xzero {\n\nInetConnector::InetConnector(const std::string& name, Executor* executor,\n Scheduler* scheduler, Selector* selector,\n WallClock* clock)\n : Connector(name, executor, clock),\n selector_(selector),\n scheduler_(scheduler),\n connectedEndPoints_(),\n socket_(-1),\n addressFamily_(IPAddress::V4),\n typeMask_(0),\n flags_(0),\n backlog_(256),\n multiAcceptCount_(1),\n isStarted_(false) {\n}\n\nInetConnector::InetConnector(const std::string& name, Executor* executor,\n Scheduler* scheduler, Selector* selector,\n WallClock* clock,\n const IPAddress& ipaddress, int port, int backlog,\n bool reuseAddr, bool reusePort)\n : InetConnector(name, executor, scheduler, selector, clock) {\n\n open(ipaddress, port, backlog, reuseAddr, reusePort);\n}\n\nvoid InetConnector::open(const IPAddress& ipaddress, int port, int backlog,\n bool reuseAddr, bool reusePort) {\n if (isOpen())\n throw std::runtime_error(\"InetConnector already opened\");\n\n socket_ = ::socket(ipaddress.family(), SOCK_STREAM, 0);\n addressFamily_ = ipaddress.family();\n\n if (socket_ < 0)\n throw std::system_error(errno, std::system_category());\n\n if (reusePort)\n setReusePort(reusePort);\n\n if (reuseAddr)\n setReuseAddr(reuseAddr);\n\n bind(ipaddress, port);\n}\n\nvoid InetConnector::close() {\n if (isStarted()) {\n stop();\n }\n\n if (isOpen()) {\n ::close(socket_);\n socket_ = -1;\n }\n}\n\nvoid InetConnector::bind(const IPAddress& ipaddr, int port) {\n char sa[sizeof(sockaddr_in6)];\n socklen_t salen = ipaddr.size();\n\n switch (ipaddr.family()) {\n case IPAddress::V4:\n salen = sizeof(sockaddr_in);\n ((sockaddr_in*)sa)->sin_port = htons(port);\n ((sockaddr_in*)sa)->sin_family = AF_INET;\n memcpy(&((sockaddr_in*)sa)->sin_addr, ipaddr.data(), ipaddr.size());\n break;\n case IPAddress::V6:\n salen = sizeof(sockaddr_in6);\n ((sockaddr_in6*)sa)->sin6_port = htons(port);\n ((sockaddr_in6*)sa)->sin6_family = AF_INET6;\n memcpy(&((sockaddr_in6*)sa)->sin6_addr, ipaddr.data(), ipaddr.size());\n break;\n default:\n throw std::system_error(EINVAL, std::system_category());\n }\n\n int rv = ::bind(socket_, (sockaddr*)sa, salen);\n if (rv < 0)\n throw std::system_error(errno, std::system_category());\n\n addressFamily_ = ipaddr.family();\n}\n\nvoid InetConnector::listen(int backlog) {\n int rv = ::listen(socket_, backlog);\n if (rv < 0)\n throw std::system_error(errno, std::system_category());\n}\n\nbool InetConnector::isOpen() const noexcept {\n return socket_ >= 0;\n}\n\nInetConnector::~InetConnector() {\n TRACE(\"~InetConnector\");\n if (isStarted()) {\n stop();\n }\n\n if (socket_ >= 0) {\n ::close(socket_);\n }\n}\n\nSelector* InetConnector::selector() const noexcept {\n return selector_;\n}\n\nint InetConnector::handle() const noexcept {\n return socket_;\n}\n\nvoid InetConnector::setSocket(int socket) {\n socket_ = socket;\n}\n\nsize_t InetConnector::backlog() const noexcept {\n return backlog_;\n}\n\nvoid InetConnector::setBacklog(size_t value) {\n if (isStarted()) {\n throw std::runtime_error(\"Cannot change backlog when already listening.\");\n }\n\n backlog_ = value;\n}\n\nbool InetConnector::isBlocking() const {\n return !(fcntl(socket_, F_GETFL) & O_NONBLOCK);\n}\n\nvoid InetConnector::setBlocking(bool enable) {\n unsigned flags = enable ? fcntl(socket_, F_GETFL) & ~O_NONBLOCK\n : fcntl(socket_, F_GETFL) | O_NONBLOCK;\n\n if (fcntl(socket_, F_SETFL, flags) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n if (enable) {\n typeMask_ &= ~SOCK_NONBLOCK;\n } else {\n typeMask_ |= SOCK_NONBLOCK;\n }\n#else\n if (enable) {\n flags_ &= ~O_NONBLOCK;\n } else {\n flags_ |= O_NONBLOCK;\n }\n#endif\n}\n\nbool InetConnector::closeOnExec() const {\n return fcntl(socket_, F_GETFD) & FD_CLOEXEC;\n}\n\nvoid InetConnector::setCloseOnExec(bool enable) {\n unsigned flags = enable ? fcntl(socket_, F_GETFD) | FD_CLOEXEC\n : fcntl(socket_, F_GETFD) & ~FD_CLOEXEC;\n\n if (fcntl(socket_, F_SETFD, flags) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n if (enable) {\n typeMask_ |= SOCK_CLOEXEC;\n } else {\n typeMask_ &= ~SOCK_CLOEXEC;\n }\n#else\n if (enable) {\n flags_ |= O_CLOEXEC;\n } else {\n flags_ &= ~O_CLOEXEC;\n }\n#endif\n}\n\nbool InetConnector::deferAccept() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_TCP, TCP_DEFER_ACCEPT, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setDeferAccept(bool enable) {\n#if defined(TCP_DEFER_ACCEPT) && defined(ENABLE_TCP_DEFER_ACCEPT)\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_TCP, TCP_DEFER_ACCEPT, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n#else\n throw std::system_error(ENOTSUP, std::system_category());\n#endif\n}\n\nbool InetConnector::quickAck() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_TCP, TCP_QUICKACK, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setQuickAck(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_TCP, TCP_QUICKACK, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nbool InetConnector::reusePort() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_SOCKET, SO_REUSEPORT, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setReusePort(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_SOCKET, SO_REUSEPORT, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nbool InetConnector::reuseAddr() const {\n int optval = 1;\n socklen_t optlen = sizeof(optval);\n return ::getsockopt(socket_, SOL_SOCKET, SO_REUSEADDR, &optval, &optlen) == 0\n ? optval != 0\n : false;\n}\n\nvoid InetConnector::setReuseAddr(bool enable) {\n int rc = enable ? 1 : 0;\n if (::setsockopt(socket_, SOL_SOCKET, SO_REUSEADDR, &rc, sizeof(rc)) < 0) {\n throw std::system_error(errno, std::system_category());\n }\n}\n\nsize_t InetConnector::multiAcceptCount() const noexcept {\n return multiAcceptCount_;\n}\n\nvoid InetConnector::setMultiAcceptCount(size_t value) noexcept {\n multiAcceptCount_ = value;\n}\n\nvoid InetConnector::start() {\n if (!isOpen()) {\n throw std::runtime_error(\"Connector must be open in order to be started.\");\n }\n\n if (isStarted()) {\n return;\n }\n\n listen(backlog_);\n\n isStarted_ = true;\n\n if (selector_)\n selectionKey_ = selector_->createSelectable(this, READ);\n else {\n executor()->execute([this]() {\n while (isStarted_) {\n acceptOne();\n }\n });\n }\n}\n\nbool InetConnector::isStarted() const noexcept {\n return isStarted_;\n}\n\nvoid InetConnector::stop() {\n TRACE(\"stop: %s\", name().c_str());\n if (!isStarted()) {\n return;\n }\n\n selectionKey_.reset();\n isStarted_ = false;\n}\n\nvoid InetConnector::onSelectable() noexcept {\n try {\n for (size_t i = 0; i < multiAcceptCount_; i++) {\n if (!acceptOne()) {\n break;\n }\n }\n } catch (const std::exception& e) {\n \/\/ TODO\n } catch (...) {\n \/\/ TODO\n }\n}\n\nbool InetConnector::acceptOne() {\n#if defined(HAVE_ACCEPT4) && defined(ENABLE_ACCEPT4)\n bool flagged = true;\n int cfd = ::accept4(socket_, nullptr, 0, typeMask_);\n if (cfd < 0 && errno == ENOSYS) {\n cfd = ::accept(socket_, nullptr, 0);\n flagged = false;\n }\n#else\n bool flagged = false;\n int cfd = ::accept(socket_, nullptr, 0);\n#endif\n\n if (cfd < 0) {\n switch (errno) {\n case EINTR:\n case EAGAIN:\n#if EAGAIN != EWOULDBLOCK\n case EWOULDBLOCK:\n#endif\n return true;\n default:\n throw std::system_error(errno, std::system_category());\n }\n }\n\n if (!flagged && flags_ &&\n fcntl(cfd, F_SETFL, fcntl(cfd, F_GETFL) | flags_) < 0) {\n ::close(cfd);\n throw std::system_error(errno, std::system_category());\n }\n\n std::unique_ptr<InetEndPoint> endpoint(new InetEndPoint(cfd, this));\n connectedEndPoints_.push_back(endpoint.get());\n\n auto connection =\n defaultConnectionFactory()->create(this, std::move(endpoint));\n connection->onOpen();\n\n return true;\n}\n\nstd::list<EndPoint*> InetConnector::connectedEndPoints() {\n std::list<EndPoint*> result;\n for (InetEndPoint* ep : connectedEndPoints_) {\n result.push_back(ep);\n }\n return result;\n}\n\nvoid InetConnector::onEndPointClosed(InetEndPoint* endpoint) {\n assert(endpoint != nullptr);\n assert(endpoint->connection() != nullptr);\n\n auto i = std::find(connectedEndPoints_.begin(), connectedEndPoints_.end(),\n endpoint);\n\n assert(i != connectedEndPoints_.end());\n\n if (i != connectedEndPoints_.end()) {\n endpoint->connection()->onClose();\n\n connectedEndPoints_.erase(i);\n\n if (!endpoint->isBusy()) {\n \/\/ do only actually delete if not currently inside an io handler\n release(endpoint->connection());\n }\n }\n}\n\nvoid InetConnector::release(Connection* inetConnection) {\n assert(inetConnection != nullptr);\n assert(dynamic_cast<InetEndPoint*>(inetConnection->endpoint()) != nullptr);\n assert(!static_cast<InetEndPoint*>(inetConnection->endpoint())->isBusy());\n\n delete inetConnection;\n}\n\n} \/\/ namespace xzero\n<|endoftext|>"} {"text":"<commit_before>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2009-2014 The Regents of\nthe University of Michigan All rights reserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n\n\/\/! label the boost test module\n#define BOOST_TEST_MODULE GridshiftCorrectionTests\n#include \"boost_utf_configure.h\"\n\n#include \"HOOMDMath.h\"\n#include \"VectorMath.h\"\n#include \"System.h\"\n#include \"ParticleData.h\"\n\n#include <math.h>\n#include <boost\/shared_ptr.hpp>\n\n\n\/*! \\file test_gridshift_correct.cc\n \\brief Unit tests for the ParticleData class in response to origin shifts\n \\ingroup unit_tests\n*\/\n\n\/\/! boost test case to verify proper operation of ZeroMomentumUpdater\nBOOST_AUTO_TEST_CASE( ParticleDataGridShiftGetMethods )\n {\n \/\/ create a simple particle data to test with\n boost::shared_ptr<SystemDefinition> sysdef(new SystemDefinition(3, BoxDim(10.0), 4));\n boost::shared_ptr<ParticleData> pdata = sysdef->getParticleData();\n BoxDim box = pdata->getBox();\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<Scalar4> h_vel(pdata->getVelocities(), access_location::host, access_mode::readwrite);\n\n h_pos.data[0].x = h_pos.data[0].y = h_pos.data[0].z = 0.0;\n h_pos.data[1].x = h_pos.data[1].y = h_pos.data[1].z = 1.0;\n }\n\n \/\/ compute a shift and apply it to all particles, and origin\n Scalar3 shift = make_scalar3(0.5,0.125,0.75);\n pdata->translateOrigin(shift);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n Scalar3 pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-0.0), tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-1.0), tol_small);\n\n int3 pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n\n \/\/ compute a shift that will shift the image of the box\n Scalar3 shift_img = make_scalar3(10.5,10.125,10.75);\n pdata->translateOrigin(shift_img);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift_img);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(pos.x-0.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.y-0.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.z-0.0, tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(pos.x-1.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.y-1.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.z-1.0, tol_small);\n\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n }\n\nBOOST_AUTO_TEST_CASE( ParticleDataGridShiftSetMethods )\n {\n \/\/ create a simple particle data to test with\n boost::shared_ptr<SystemDefinition> sysdef(new SystemDefinition(3, BoxDim(10.0), 4));\n boost::shared_ptr<ParticleData> pdata = sysdef->getParticleData();\n BoxDim box = pdata->getBox();\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<Scalar4> h_vel(pdata->getVelocities(), access_location::host, access_mode::readwrite);\n\n h_pos.data[0].x = h_pos.data[0].y = h_pos.data[0].z = 0.0;\n h_pos.data[1].x = h_pos.data[1].y = h_pos.data[1].z = 1.0;\n }\n\n \/\/ compute a shift that will shift the image of the box\n Scalar3 shift_img = make_scalar3(10.5,10.125,10.75);\n pdata->translateOrigin(shift_img);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift_img);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n Scalar3 pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(pos.x-0.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.y-0.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.z-0.0, tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(pos.x-1.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.y-1.0, tol_small);\n MY_BOOST_CHECK_SMALL(pos.z-1.0, tol_small);\n\n int3 pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(1);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n\n\n \/\/OK, now we set the positions using the particle data proxy\n Scalar3 new_pos0 = make_scalar3(0.1,0.5,0.7);\n pdata->setPosition(0,new_pos0);\n Scalar3 new_pos1 = make_scalar3(0.4,0.1,2.75);\n pdata->setPosition(1,new_pos1);\n\n Scalar3 ret_pos0 = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(ret_pos0.x-new_pos0.x, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos0.y-new_pos0.y, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos0.z-new_pos0.z, tol_small);\n\n Scalar3 ret_pos1 = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(ret_pos1.x-new_pos1.x, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos1.y-new_pos1.y, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos1.z-new_pos1.z, tol_small);\n\n \/\/OK, now do the same with the images\n int3 new_img0 = make_int3(1,-5,7);\n pdata->setImage(0,new_img0);\n int3 new_img1 = make_int3(4,1,10);\n pdata->setImage(1,new_img1);\n\n int3 ret_img0 = pdata->getImage(0);\n BOOST_CHECK_EQUAL(ret_img0.x-new_img0.x, 0);\n BOOST_CHECK_EQUAL(ret_img0.y-new_img0.y, 0);\n BOOST_CHECK_EQUAL(ret_img0.z-new_img0.z, 0);\n\n int3 ret_img1 = pdata->getImage(1);\n BOOST_CHECK_EQUAL(ret_img1.x-new_img1.x, 0);\n BOOST_CHECK_EQUAL(ret_img1.y-new_img1.y, 0);\n BOOST_CHECK_EQUAL(ret_img1.z-new_img1.z, 0);\n }\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n<commit_msg>Really fix compile error<commit_after>\/*\nHighly Optimized Object-oriented Many-particle Dynamics -- Blue Edition\n(HOOMD-blue) Open Source Software License Copyright 2009-2014 The Regents of\nthe University of Michigan All rights reserved.\n\nHOOMD-blue may contain modifications (\"Contributions\") provided, and to which\ncopyright is held, by various Contributors who have granted The Regents of the\nUniversity of Michigan the right to modify and\/or distribute such Contributions.\n\nYou may redistribute, use, and create derivate works of HOOMD-blue, in source\nand binary forms, provided you abide by the following conditions:\n\n* Redistributions of source code must retain the above copyright notice, this\nlist of conditions, and the following disclaimer both in the code and\nprominently in any materials provided with the distribution.\n\n* Redistributions in binary form must reproduce the above copyright notice, this\nlist of conditions, and the following disclaimer in the documentation and\/or\nother materials provided with the distribution.\n\n* All publications and presentations based on HOOMD-blue, including any reports\nor published results obtained, in whole or in part, with HOOMD-blue, will\nacknowledge its use according to the terms posted at the time of submission on:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/citations.html\n\n* Any electronic documents citing HOOMD-Blue will link to the HOOMD-Blue website:\nhttp:\/\/codeblue.umich.edu\/hoomd-blue\/\n\n* Apart from the above required attributions, neither the name of the copyright\nholder nor the names of HOOMD-blue's contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nDisclaimer\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS ``AS IS'' AND\nANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND\/OR ANY\nWARRANTIES THAT THIS SOFTWARE IS FREE OF INFRINGEMENT ARE DISCLAIMED.\n\nIN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\nINDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\nBUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\nLIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE\nOR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\nADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n\n#ifdef WIN32\n#pragma warning( push )\n#pragma warning( disable : 4103 4244 )\n#endif\n\n\n\/\/! label the boost test module\n#define BOOST_TEST_MODULE GridshiftCorrectionTests\n#include \"boost_utf_configure.h\"\n\n#include \"HOOMDMath.h\"\n#include \"VectorMath.h\"\n#include \"System.h\"\n#include \"ParticleData.h\"\n\n#include <math.h>\n#include <boost\/shared_ptr.hpp>\n\n\n\/*! \\file test_gridshift_correct.cc\n \\brief Unit tests for the ParticleData class in response to origin shifts\n \\ingroup unit_tests\n*\/\n\n\/\/! boost test case to verify proper operation of ZeroMomentumUpdater\nBOOST_AUTO_TEST_CASE( ParticleDataGridShiftGetMethods )\n {\n \/\/ create a simple particle data to test with\n boost::shared_ptr<SystemDefinition> sysdef(new SystemDefinition(3, BoxDim(10.0), 4));\n boost::shared_ptr<ParticleData> pdata = sysdef->getParticleData();\n BoxDim box = pdata->getBox();\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<Scalar4> h_vel(pdata->getVelocities(), access_location::host, access_mode::readwrite);\n\n h_pos.data[0].x = h_pos.data[0].y = h_pos.data[0].z = 0.0;\n h_pos.data[1].x = h_pos.data[1].y = h_pos.data[1].z = 1.0;\n }\n\n \/\/ compute a shift and apply it to all particles, and origin\n Scalar3 shift = make_scalar3(0.5,0.125,0.75);\n pdata->translateOrigin(shift);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n Scalar3 pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-0.0), tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-1.0), tol_small);\n\n int3 pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n\n \/\/ compute a shift that will shift the image of the box\n Scalar3 shift_img = make_scalar3(10.5,10.125,10.75);\n pdata->translateOrigin(shift_img);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift_img);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-0.0), tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-1.0), tol_small);\n\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n }\n\nBOOST_AUTO_TEST_CASE( ParticleDataGridShiftSetMethods )\n {\n \/\/ create a simple particle data to test with\n boost::shared_ptr<SystemDefinition> sysdef(new SystemDefinition(3, BoxDim(10.0), 4));\n boost::shared_ptr<ParticleData> pdata = sysdef->getParticleData();\n BoxDim box = pdata->getBox();\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<Scalar4> h_vel(pdata->getVelocities(), access_location::host, access_mode::readwrite);\n\n h_pos.data[0].x = h_pos.data[0].y = h_pos.data[0].z = 0.0;\n h_pos.data[1].x = h_pos.data[1].y = h_pos.data[1].z = 1.0;\n }\n\n \/\/ compute a shift that will shift the image of the box\n Scalar3 shift_img = make_scalar3(10.5,10.125,10.75);\n pdata->translateOrigin(shift_img);\n {\n ArrayHandle<Scalar4> h_pos(pdata->getPositions(), access_location::host, access_mode::readwrite);\n ArrayHandle<int3> h_img(pdata->getImages(), access_location::host, access_mode::readwrite);\n\n for (unsigned int i = 0; i < pdata->getN(); i++)\n {\n \/\/ read in the current position and orientation\n Scalar4 pos_i = h_pos.data[i];\n vec3<Scalar> r_i = vec3<Scalar>(pos_i); \/\/ translation from local to global coordinates\n r_i += vec3<Scalar>(shift_img);\n h_pos.data[i] = vec_to_scalar4(r_i, pos_i.w);\n box.wrap(h_pos.data[i], h_img.data[i]);\n }\n }\n\n \/\/ check that the particle positions are still the original ones\n Scalar3 pos = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-0.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-0.0), tol_small);\n pos = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(Scalar(pos.x-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.y-1.0), tol_small);\n MY_BOOST_CHECK_SMALL(Scalar(pos.z-1.0), tol_small);\n\n int3 pimg = pdata->getImage(0);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n pimg = pdata->getImage(1);\n BOOST_CHECK_EQUAL(pimg.x, 0);\n BOOST_CHECK_EQUAL(pimg.y, 0);\n BOOST_CHECK_EQUAL(pimg.z, 0);\n\n\n \/\/OK, now we set the positions using the particle data proxy\n Scalar3 new_pos0 = make_scalar3(0.1,0.5,0.7);\n pdata->setPosition(0,new_pos0);\n Scalar3 new_pos1 = make_scalar3(0.4,0.1,2.75);\n pdata->setPosition(1,new_pos1);\n\n Scalar3 ret_pos0 = pdata->getPosition(0);\n MY_BOOST_CHECK_SMALL(ret_pos0.x-new_pos0.x, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos0.y-new_pos0.y, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos0.z-new_pos0.z, tol_small);\n\n Scalar3 ret_pos1 = pdata->getPosition(1);\n MY_BOOST_CHECK_SMALL(ret_pos1.x-new_pos1.x, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos1.y-new_pos1.y, tol_small);\n MY_BOOST_CHECK_SMALL(ret_pos1.z-new_pos1.z, tol_small);\n\n \/\/OK, now do the same with the images\n int3 new_img0 = make_int3(1,-5,7);\n pdata->setImage(0,new_img0);\n int3 new_img1 = make_int3(4,1,10);\n pdata->setImage(1,new_img1);\n\n int3 ret_img0 = pdata->getImage(0);\n BOOST_CHECK_EQUAL(ret_img0.x-new_img0.x, 0);\n BOOST_CHECK_EQUAL(ret_img0.y-new_img0.y, 0);\n BOOST_CHECK_EQUAL(ret_img0.z-new_img0.z, 0);\n\n int3 ret_img1 = pdata->getImage(1);\n BOOST_CHECK_EQUAL(ret_img1.x-new_img1.x, 0);\n BOOST_CHECK_EQUAL(ret_img1.y-new_img1.y, 0);\n BOOST_CHECK_EQUAL(ret_img1.z-new_img1.z, 0);\n }\n\n#ifdef WIN32\n#pragma warning( pop )\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012-2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n#include <scheduler.h>\n#include <util\/time.h>\n\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(scheduler_tests)\n\nstatic void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, std::chrono::system_clock::time_point rescheduleTime)\n{\n {\n boost::unique_lock<boost::mutex> lock(mutex);\n counter += delta;\n }\n std::chrono::system_clock::time_point noTime = std::chrono::system_clock::time_point::min();\n if (rescheduleTime != noTime) {\n CScheduler::Function f = std::bind(µTask, std::ref(s), std::ref(mutex), std::ref(counter), -delta + 1, noTime);\n s.schedule(f, rescheduleTime);\n }\n}\n\nBOOST_AUTO_TEST_CASE(manythreads)\n{\n \/\/ Stress test: hundreds of microsecond-scheduled tasks,\n \/\/ serviced by 10 threads.\n \/\/\n \/\/ So... ten shared counters, which if all the tasks execute\n \/\/ properly will sum to the number of tasks done.\n \/\/ Each task adds or subtracts a random amount from one of the\n \/\/ counters, and then schedules another task 0-1000\n \/\/ microseconds in the future to subtract or add from\n \/\/ the counter -random_amount+1, so in the end the shared\n \/\/ counters should sum to the number of initial tasks performed.\n CScheduler microTasks;\n\n boost::mutex counterMutex[10];\n int counter[10] = { 0 };\n FastRandomContext rng{\/* fDeterministic *\/ true};\n auto zeroToNine = [](FastRandomContext& rc) -> int { return rc.randrange(10); }; \/\/ [0, 9]\n auto randomMsec = [](FastRandomContext& rc) -> int { return -11 + (int)rc.randrange(1012); }; \/\/ [-11, 1000]\n auto randomDelta = [](FastRandomContext& rc) -> int { return -1000 + (int)rc.randrange(2001); }; \/\/ [-1000, 1000]\n\n std::chrono::system_clock::time_point start = std::chrono::system_clock::now();\n std::chrono::system_clock::time_point now = start;\n std::chrono::system_clock::time_point first, last;\n size_t nTasks = microTasks.getQueueInfo(first, last);\n BOOST_CHECK(nTasks == 0);\n\n for (int i = 0; i < 100; ++i) {\n std::chrono::system_clock::time_point t = now + std::chrono::microseconds(randomMsec(rng));\n std::chrono::system_clock::time_point tReschedule = now + std::chrono::microseconds(500 + randomMsec(rng));\n int whichCounter = zeroToNine(rng);\n CScheduler::Function f = std::bind(µTask, std::ref(microTasks),\n std::ref(counterMutex[whichCounter]), std::ref(counter[whichCounter]),\n randomDelta(rng), tReschedule);\n microTasks.schedule(f, t);\n }\n nTasks = microTasks.getQueueInfo(first, last);\n BOOST_CHECK(nTasks == 100);\n BOOST_CHECK(first < last);\n BOOST_CHECK(last > now);\n\n \/\/ As soon as these are created they will start running and servicing the queue\n boost::thread_group microThreads;\n for (int i = 0; i < 5; i++)\n microThreads.create_thread(std::bind(&CScheduler::serviceQueue, µTasks));\n\n UninterruptibleSleep(std::chrono::microseconds{600});\n now = std::chrono::system_clock::now();\n\n \/\/ More threads and more tasks:\n for (int i = 0; i < 5; i++)\n microThreads.create_thread(std::bind(&CScheduler::serviceQueue, µTasks));\n for (int i = 0; i < 100; i++) {\n std::chrono::system_clock::time_point t = now + std::chrono::microseconds(randomMsec(rng));\n std::chrono::system_clock::time_point tReschedule = now + std::chrono::microseconds(500 + randomMsec(rng));\n int whichCounter = zeroToNine(rng);\n CScheduler::Function f = std::bind(µTask, std::ref(microTasks),\n std::ref(counterMutex[whichCounter]), std::ref(counter[whichCounter]),\n randomDelta(rng), tReschedule);\n microTasks.schedule(f, t);\n }\n\n \/\/ Drain the task queue then exit threads\n microTasks.stop(true);\n microThreads.join_all(); \/\/ ... wait until all the threads are done\n\n int counterSum = 0;\n for (int i = 0; i < 10; i++) {\n BOOST_CHECK(counter[i] != 0);\n counterSum += counter[i];\n }\n BOOST_CHECK_EQUAL(counterSum, 200);\n}\n\nBOOST_AUTO_TEST_CASE(singlethreadedscheduler_ordered)\n{\n CScheduler scheduler;\n\n \/\/ each queue should be well ordered with respect to itself but not other queues\n SingleThreadedSchedulerClient queue1(&scheduler);\n SingleThreadedSchedulerClient queue2(&scheduler);\n\n \/\/ create more threads than queues\n \/\/ if the queues only permit execution of one task at once then\n \/\/ the extra threads should effectively be doing nothing\n \/\/ if they don't we'll get out of order behaviour\n boost::thread_group threads;\n for (int i = 0; i < 5; ++i) {\n threads.create_thread(std::bind(&CScheduler::serviceQueue, &scheduler));\n }\n\n \/\/ these are not atomic, if SinglethreadedSchedulerClient prevents\n \/\/ parallel execution at the queue level no synchronization should be required here\n int counter1 = 0;\n int counter2 = 0;\n\n \/\/ just simply count up on each queue - if execution is properly ordered then\n \/\/ the callbacks should run in exactly the order in which they were enqueued\n for (int i = 0; i < 100; ++i) {\n queue1.AddToProcessQueue([i, &counter1]() {\n bool expectation = i == counter1++;\n assert(expectation);\n });\n\n queue2.AddToProcessQueue([i, &counter2]() {\n bool expectation = i == counter2++;\n assert(expectation);\n });\n }\n\n \/\/ finish up\n scheduler.stop(true);\n threads.join_all();\n\n BOOST_CHECK_EQUAL(counter1, 100);\n BOOST_CHECK_EQUAL(counter2, 100);\n}\n\nBOOST_AUTO_TEST_CASE(mockforward)\n{\n CScheduler scheduler;\n\n int counter{0};\n CScheduler::Function dummy = [&counter]{counter++;};\n\n \/\/ schedule jobs for 2, 5 & 8 minutes into the future\n int64_t min_in_milli = 60*1000;\n scheduler.scheduleFromNow(dummy, 2*min_in_milli);\n scheduler.scheduleFromNow(dummy, 5*min_in_milli);\n scheduler.scheduleFromNow(dummy, 8*min_in_milli);\n\n \/\/ check taskQueue\n std::chrono::system_clock::time_point first, last;\n size_t num_tasks = scheduler.getQueueInfo(first, last);\n BOOST_CHECK_EQUAL(num_tasks, 3ul);\n\n std::thread scheduler_thread([&]() { scheduler.serviceQueue(); });\n\n \/\/ bump the scheduler forward 5 minutes\n scheduler.MockForward(std::chrono::seconds(5*60));\n\n \/\/ ensure scheduler has chance to process all tasks queued for before 1 ms from now.\n scheduler.scheduleFromNow([&scheduler]{ scheduler.stop(false); }, 1);\n scheduler_thread.join();\n\n \/\/ check that the queue only has one job remaining\n num_tasks = scheduler.getQueueInfo(first, last);\n BOOST_CHECK_EQUAL(num_tasks, 1ul);\n\n \/\/ check that the dummy function actually ran\n BOOST_CHECK_EQUAL(counter, 2);\n\n \/\/ check that the time of the remaining job has been updated\n std::chrono::system_clock::time_point now = std::chrono::system_clock::now();\n int delta = std::chrono::duration_cast<std::chrono::seconds>(first - now).count();\n \/\/ should be between 2 & 3 minutes from now\n BOOST_CHECK(delta > 2*60 && delta < 3*60);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>test: Check that wait_until returns if time point is in the past<commit_after>\/\/ Copyright (c) 2012-2019 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <random.h>\n#include <scheduler.h>\n#include <util\/time.h>\n\n#include <boost\/thread.hpp>\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_AUTO_TEST_SUITE(scheduler_tests)\n\nstatic void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, std::chrono::system_clock::time_point rescheduleTime)\n{\n {\n boost::unique_lock<boost::mutex> lock(mutex);\n counter += delta;\n }\n std::chrono::system_clock::time_point noTime = std::chrono::system_clock::time_point::min();\n if (rescheduleTime != noTime) {\n CScheduler::Function f = std::bind(µTask, std::ref(s), std::ref(mutex), std::ref(counter), -delta + 1, noTime);\n s.schedule(f, rescheduleTime);\n }\n}\n\nBOOST_AUTO_TEST_CASE(manythreads)\n{\n \/\/ Stress test: hundreds of microsecond-scheduled tasks,\n \/\/ serviced by 10 threads.\n \/\/\n \/\/ So... ten shared counters, which if all the tasks execute\n \/\/ properly will sum to the number of tasks done.\n \/\/ Each task adds or subtracts a random amount from one of the\n \/\/ counters, and then schedules another task 0-1000\n \/\/ microseconds in the future to subtract or add from\n \/\/ the counter -random_amount+1, so in the end the shared\n \/\/ counters should sum to the number of initial tasks performed.\n CScheduler microTasks;\n\n boost::mutex counterMutex[10];\n int counter[10] = { 0 };\n FastRandomContext rng{\/* fDeterministic *\/ true};\n auto zeroToNine = [](FastRandomContext& rc) -> int { return rc.randrange(10); }; \/\/ [0, 9]\n auto randomMsec = [](FastRandomContext& rc) -> int { return -11 + (int)rc.randrange(1012); }; \/\/ [-11, 1000]\n auto randomDelta = [](FastRandomContext& rc) -> int { return -1000 + (int)rc.randrange(2001); }; \/\/ [-1000, 1000]\n\n std::chrono::system_clock::time_point start = std::chrono::system_clock::now();\n std::chrono::system_clock::time_point now = start;\n std::chrono::system_clock::time_point first, last;\n size_t nTasks = microTasks.getQueueInfo(first, last);\n BOOST_CHECK(nTasks == 0);\n\n for (int i = 0; i < 100; ++i) {\n std::chrono::system_clock::time_point t = now + std::chrono::microseconds(randomMsec(rng));\n std::chrono::system_clock::time_point tReschedule = now + std::chrono::microseconds(500 + randomMsec(rng));\n int whichCounter = zeroToNine(rng);\n CScheduler::Function f = std::bind(µTask, std::ref(microTasks),\n std::ref(counterMutex[whichCounter]), std::ref(counter[whichCounter]),\n randomDelta(rng), tReschedule);\n microTasks.schedule(f, t);\n }\n nTasks = microTasks.getQueueInfo(first, last);\n BOOST_CHECK(nTasks == 100);\n BOOST_CHECK(first < last);\n BOOST_CHECK(last > now);\n\n \/\/ As soon as these are created they will start running and servicing the queue\n boost::thread_group microThreads;\n for (int i = 0; i < 5; i++)\n microThreads.create_thread(std::bind(&CScheduler::serviceQueue, µTasks));\n\n UninterruptibleSleep(std::chrono::microseconds{600});\n now = std::chrono::system_clock::now();\n\n \/\/ More threads and more tasks:\n for (int i = 0; i < 5; i++)\n microThreads.create_thread(std::bind(&CScheduler::serviceQueue, µTasks));\n for (int i = 0; i < 100; i++) {\n std::chrono::system_clock::time_point t = now + std::chrono::microseconds(randomMsec(rng));\n std::chrono::system_clock::time_point tReschedule = now + std::chrono::microseconds(500 + randomMsec(rng));\n int whichCounter = zeroToNine(rng);\n CScheduler::Function f = std::bind(µTask, std::ref(microTasks),\n std::ref(counterMutex[whichCounter]), std::ref(counter[whichCounter]),\n randomDelta(rng), tReschedule);\n microTasks.schedule(f, t);\n }\n\n \/\/ Drain the task queue then exit threads\n microTasks.stop(true);\n microThreads.join_all(); \/\/ ... wait until all the threads are done\n\n int counterSum = 0;\n for (int i = 0; i < 10; i++) {\n BOOST_CHECK(counter[i] != 0);\n counterSum += counter[i];\n }\n BOOST_CHECK_EQUAL(counterSum, 200);\n}\n\nBOOST_AUTO_TEST_CASE(wait_until_past)\n{\n std::condition_variable condvar;\n Mutex mtx;\n WAIT_LOCK(mtx, lock);\n\n const auto no_wait= [&](const std::chrono::seconds& d) {\n return condvar.wait_until(lock, std::chrono::system_clock::now() - d);\n };\n\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::seconds{1}));\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::minutes{1}));\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::hours{1}));\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::hours{10}));\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::hours{100}));\n BOOST_CHECK(std::cv_status::timeout == no_wait(std::chrono::hours{1000}));\n}\n\nBOOST_AUTO_TEST_CASE(singlethreadedscheduler_ordered)\n{\n CScheduler scheduler;\n\n \/\/ each queue should be well ordered with respect to itself but not other queues\n SingleThreadedSchedulerClient queue1(&scheduler);\n SingleThreadedSchedulerClient queue2(&scheduler);\n\n \/\/ create more threads than queues\n \/\/ if the queues only permit execution of one task at once then\n \/\/ the extra threads should effectively be doing nothing\n \/\/ if they don't we'll get out of order behaviour\n boost::thread_group threads;\n for (int i = 0; i < 5; ++i) {\n threads.create_thread(std::bind(&CScheduler::serviceQueue, &scheduler));\n }\n\n \/\/ these are not atomic, if SinglethreadedSchedulerClient prevents\n \/\/ parallel execution at the queue level no synchronization should be required here\n int counter1 = 0;\n int counter2 = 0;\n\n \/\/ just simply count up on each queue - if execution is properly ordered then\n \/\/ the callbacks should run in exactly the order in which they were enqueued\n for (int i = 0; i < 100; ++i) {\n queue1.AddToProcessQueue([i, &counter1]() {\n bool expectation = i == counter1++;\n assert(expectation);\n });\n\n queue2.AddToProcessQueue([i, &counter2]() {\n bool expectation = i == counter2++;\n assert(expectation);\n });\n }\n\n \/\/ finish up\n scheduler.stop(true);\n threads.join_all();\n\n BOOST_CHECK_EQUAL(counter1, 100);\n BOOST_CHECK_EQUAL(counter2, 100);\n}\n\nBOOST_AUTO_TEST_CASE(mockforward)\n{\n CScheduler scheduler;\n\n int counter{0};\n CScheduler::Function dummy = [&counter]{counter++;};\n\n \/\/ schedule jobs for 2, 5 & 8 minutes into the future\n int64_t min_in_milli = 60*1000;\n scheduler.scheduleFromNow(dummy, 2*min_in_milli);\n scheduler.scheduleFromNow(dummy, 5*min_in_milli);\n scheduler.scheduleFromNow(dummy, 8*min_in_milli);\n\n \/\/ check taskQueue\n std::chrono::system_clock::time_point first, last;\n size_t num_tasks = scheduler.getQueueInfo(first, last);\n BOOST_CHECK_EQUAL(num_tasks, 3ul);\n\n std::thread scheduler_thread([&]() { scheduler.serviceQueue(); });\n\n \/\/ bump the scheduler forward 5 minutes\n scheduler.MockForward(std::chrono::seconds(5*60));\n\n \/\/ ensure scheduler has chance to process all tasks queued for before 1 ms from now.\n scheduler.scheduleFromNow([&scheduler]{ scheduler.stop(false); }, 1);\n scheduler_thread.join();\n\n \/\/ check that the queue only has one job remaining\n num_tasks = scheduler.getQueueInfo(first, last);\n BOOST_CHECK_EQUAL(num_tasks, 1ul);\n\n \/\/ check that the dummy function actually ran\n BOOST_CHECK_EQUAL(counter, 2);\n\n \/\/ check that the time of the remaining job has been updated\n std::chrono::system_clock::time_point now = std::chrono::system_clock::now();\n int delta = std::chrono::duration_cast<std::chrono::seconds>(first - now).count();\n \/\/ should be between 2 & 3 minutes from now\n BOOST_CHECK(delta > 2*60 && delta < 3*60);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2017> <Thomas Ballenthin>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE linux auth test\n\n#include <boost\/test\/unit_test.hpp>\n#include <crypt.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <stdio.h>\n#include <string>\n\n#include \"authenticate.h\"\n#include \"json\/cJSON.h\"\n\nextern \"C\" {\n\tint cjet_timer_init(struct cjet_timer *timer, struct eventloop *loop){\n\t\t(void) timer;\n\t\t(void) loop;\n\t\treturn 0;\n\t}\n\n\tvoid cjet_timer_destroy(struct cjet_timer *timer){\n\t\t(void) timer;\n\t}\n\n\tvoid cjet_get_random_bytes(void *bytes, size_t num_bytes)\n\t{\n\t\tBOOST_REQUIRE_MESSAGE(false,\"the cjet_get_random_bytes function needs to be implemented, when it is actually used.\");\n\t\t(void) bytes;\n\t\t(void) num_bytes;\n\t}\n}\n\nstatic std::string create_temp_copy_of_file(std::string source_filename, std::string filename_apendix)\n{\n\tstd::string destination_filename(source_filename);\n\tdestination_filename.append(filename_apendix);\n\n\tstd::ifstream source(source_filename.c_str(), std::ios::binary);\n\tstd::ofstream dest(destination_filename.c_str(), std::ios::binary);\n\n\tBOOST_REQUIRE_MESSAGE(source != NULL, \"Can't open source file: \" << source_filename);\n\tBOOST_REQUIRE_MESSAGE(dest != NULL, \"Can't open destination file: \" << destination_filename);\n\tdest << source.rdbuf();\n\n\tsource.close();\n\tdest.close();\n\n\treturn destination_filename;\n}\n\nstruct F {\n\tF()\n\t{\n\t\tint response = load_passwd_data(\"input_data\/passwd_std.json\");\n\t\tBOOST_REQUIRE_MESSAGE(response == 0, \"Loading password file failed.\");\n\t}\n\n\t~F()\n\t{\n\t\tfree_passwd_data();\n\t}\n};\n\nBOOST_AUTO_TEST_CASE(check_load_passwd_data_error_paths)\n{\n\tint response = load_passwd_data(NULL);\n\tBOOST_CHECK_MESSAGE(response == 0, \"Expected 0 as return value when calling load_passwd_data(NULL).\");\n\n\tresponse = load_passwd_data(\"*\/___\/\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when calling realpath with '*\/___\/'.\");\n\n\tresponse = load_passwd_data(\"some_non_existing_file_641587976.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non-existing file.\");\n\n\tresponse = load_passwd_data(\"input_data\/no_json.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non JSON file.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_user_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without user data.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_fetch_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as fetch group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_set_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as set group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_call_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as callgroup.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_json_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without any JSON.\");\n}\n\nBOOST_FIXTURE_TEST_CASE(check_credentials, F)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tchar unknown_user[] = \"mister_x\";\n\tchar passwd_to_null[] = \"doe\";\n\n\tchar user_no_passwd[] = \"john-no_passwd\";\n\tchar user_passwd_no_string[] = \"john-pw_no_string\";\n\n\tconst cJSON *response1 = credentials_ok(NULL, NULL);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user_name nor passwd is provided.\");\n\n\tconst cJSON *response2 = credentials_ok(username, NULL);\n\tBOOST_CHECK_MESSAGE(response2 == NULL, \"Response should be NULL when no passwd is provided.\");\n\n\tconst cJSON *response3 = credentials_ok(NULL, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response3 == NULL, \"Response should be NULL when no user_name is provided.\");\n\tBOOST_CHECK_MESSAGE(std::strcmp(passwd_to_null, \"\\0\\0\\0\"), \"The password has not been zeroed. Instead it was:\\\"\" << passwd << \"\\\".\");\n\n\tconst cJSON *response4 = credentials_ok(user_no_passwd, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response4 == NULL, \"Response should be NULL when no password is given in the user database.\");\n\n\tconst cJSON *response5 = credentials_ok(user_passwd_no_string, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response5 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response6 = credentials_ok(unknown_user, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response6 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response7 = credentials_ok(username, passwd);\n\tBOOST_REQUIRE_MESSAGE(response7 != NULL, \"User authentication failed even with correct credentials.\");\n}\n\nBOOST_AUTO_TEST_CASE(check_credentials_no_user_data_loaded)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tconst cJSON *response1 = credentials_ok(username, passwd);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user data is loaded in before.\");\n}\n\nBOOST_AUTO_TEST_CASE(test_copying)\n{\n\tstd::string temporarily_file = create_temp_copy_of_file(\"input_data\/passwd_std.json\", \"_temp\");\n}\n<commit_msg>auth_file_test: added plattform independet pseudo random number generation to test<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2017> <Thomas Ballenthin>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE linux auth test\n\n#include <boost\/test\/unit_test.hpp>\n#include <crypt.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string>\n#include <time.h>\n\n#include \"authenticate.h\"\n#include \"peer.h\"\n#include \"json\/cJSON.h\"\n\nextern \"C\" {\nint cjet_timer_init(struct cjet_timer *timer, struct eventloop *loop)\n{\n\t(void)timer;\n\t(void)loop;\n\treturn 0;\n}\n\nvoid cjet_timer_destroy(struct cjet_timer *timer)\n{\n\t(void)timer;\n}\n\nvoid cjet_get_random_bytes(void *bytes, size_t num_bytes)\n{\n\tuint8_t *buffer = (uint8_t *)bytes;\n\tsrand(time(NULL));\n\tint random_number;\n\n\tfor (size_t i = 0; i < num_bytes; i++) {\n\t\trandom_number = rand();\n\t\t*buffer = random_number & 0xff;\n\t\tbuffer++;\n\t}\n}\n}\n\nstatic std::string create_temp_copy_of_file(std::string source_filename, std::string filename_apendix)\n{\n\tstd::string destination_filename(source_filename);\n\tdestination_filename.append(filename_apendix);\n\n\tstd::ifstream source(source_filename.c_str(), std::ios::binary);\n\tstd::ofstream dest(destination_filename.c_str(), std::ios::binary);\n\n\tBOOST_REQUIRE_MESSAGE(source != NULL, \"Can't open source file: \" << source_filename);\n\tBOOST_REQUIRE_MESSAGE(dest != NULL, \"Can't open destination file: \" << destination_filename);\n\tdest << source.rdbuf();\n\n\tsource.close();\n\tdest.close();\n\n\treturn destination_filename;\n}\n\nstatic struct eventloop loop;\n\nstruct peer *alloc_peer()\n{\n\tstruct peer *p = (struct peer *)::malloc(sizeof(*p));\n\tinit_peer(p, false, &loop);\n\tp->send_message = NULL;\n\treturn p;\n}\n\nvoid free_peer(struct peer *p) { ::free(p); }\n\nstruct F {\n\tF()\n\t{\n\t\tstd::string temporarily_file = create_temp_copy_of_file(\n\t\t \"input_data\/passwd_std.json\", \"_temp\");\n\t\tint response =\n\t\t load_passwd_data(\"input_data\/passwd_std.json_temp\");\n\t\tBOOST_REQUIRE_MESSAGE(response == 0, \"Loading password file failed.\");\n\t}\n\n\t~F()\n\t{\n\t\tfree_passwd_data();\n\t}\n};\n\nBOOST_AUTO_TEST_CASE(check_load_passwd_data_error_paths)\n{\n\tint response = load_passwd_data(NULL);\n\tBOOST_CHECK_MESSAGE(response == 0, \"Expected 0 as return value when calling load_passwd_data(NULL).\");\n\n\tresponse = load_passwd_data(\"*\/___\/\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when calling realpath with '*\/___\/'.\");\n\n\tresponse = load_passwd_data(\"some_non_existing_file_641587976.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non-existing file.\");\n\n\tresponse = load_passwd_data(\"input_data\/no_json.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non JSON file.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_user_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without user data.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_fetch_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as fetch group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_set_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as set group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_call_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as callgroup.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_json_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without any JSON.\");\n}\n\nBOOST_FIXTURE_TEST_CASE(check_credentials, F)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tchar unknown_user[] = \"mister_x\";\n\tchar passwd_to_null[] = \"doe\";\n\n\tchar user_no_passwd[] = \"john-no_passwd\";\n\tchar user_passwd_no_string[] = \"john-pw_no_string\";\n\n\tconst cJSON *response1 = credentials_ok(NULL, NULL);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user_name nor passwd is provided.\");\n\n\tconst cJSON *response2 = credentials_ok(username, NULL);\n\tBOOST_CHECK_MESSAGE(response2 == NULL, \"Response should be NULL when no passwd is provided.\");\n\n\tconst cJSON *response3 = credentials_ok(NULL, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response3 == NULL, \"Response should be NULL when no user_name is provided.\");\n\tBOOST_CHECK_MESSAGE(std::strcmp(passwd_to_null, \"\\0\\0\\0\"), \"The password has not been zeroed. Instead it was:\\\"\" << passwd << \"\\\".\");\n\n\tconst cJSON *response4 = credentials_ok(user_no_passwd, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response4 == NULL, \"Response should be NULL when no password is given in the user database.\");\n\n\tconst cJSON *response5 = credentials_ok(user_passwd_no_string, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response5 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response6 = credentials_ok(unknown_user, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response6 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response7 = credentials_ok(username, passwd);\n\tBOOST_REQUIRE_MESSAGE(response7 != NULL, \"User authentication failed even with correct credentials.\");\n}\n\nBOOST_AUTO_TEST_CASE(check_credentials_no_user_data_loaded)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tconst cJSON *response1 = credentials_ok(username, passwd);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user data is loaded in before.\");\n}\n\nBOOST_FIXTURE_TEST_CASE(change_credentials, F)\n{\n\tchar username[] = \"john\";\n\tchar old_passwd[] = \"doe\";\n\tchar new_passwd[] = \"secret\";\n\n\tcJSON *fake_request = cJSON_CreateObject();\n\tpeer *test_peer = alloc_peer();\n\ttest_peer->user_name = username;\n\n\tcJSON *response = change_password(test_peer, fake_request, username, new_passwd);\n\n\tcJSON_Delete(fake_request);\n\tfree_peer(test_peer);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <gtest\/gtest.h>\n\n#include \"tests\/script.hpp\"\n\n\n\/\/ Run each of the sample frameworks in local mode.\nTEST_SCRIPT(ExamplesTest, TestFramework, \"test_framework_test.sh\")\nTEST_SCRIPT(ExamplesTest, NoExecutorFramework, \"no_executor_framework_test.sh\")\n\n\nTEST_SCRIPT(ExamplesTest, EventCallFramework, \"event_call_framework_test.sh\")\n\n\nTEST_SCRIPT(ExamplesTest, PersistentVolumeFramework,\n \"persistent_volume_framework_test.sh\")\n\n\n#ifdef MESOS_HAS_JAVA\nTEST_SCRIPT(ExamplesTest, JavaFramework, \"java_framework_test.sh\")\nTEST_SCRIPT(ExamplesTest, JavaException, \"java_exception_test.sh\")\nTEST_SCRIPT(ExamplesTest, JavaLog, \"java_log_test.sh\")\n#endif\n\n\n#ifdef MESOS_HAS_PYTHON\nTEST_SCRIPT(ExamplesTest, PythonFramework, \"python_framework_test.sh\")\n#endif\n<commit_msg>Temporarily disabled EventCallFramework test due to MESOS-3273.<commit_after>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <gtest\/gtest.h>\n\n#include \"tests\/script.hpp\"\n\n\n\/\/ Run each of the sample frameworks in local mode.\nTEST_SCRIPT(ExamplesTest, TestFramework, \"test_framework_test.sh\")\nTEST_SCRIPT(ExamplesTest, NoExecutorFramework, \"no_executor_framework_test.sh\")\n\n\n\/\/ Temporarily disabled this test due to MESOS-3273.\nTEST_SCRIPT(DISABLED_ExamplesTest, EventCallFramework,\n \"event_call_framework_test.sh\")\n\n\nTEST_SCRIPT(ExamplesTest, PersistentVolumeFramework,\n \"persistent_volume_framework_test.sh\")\n\n\n#ifdef MESOS_HAS_JAVA\nTEST_SCRIPT(ExamplesTest, JavaFramework, \"java_framework_test.sh\")\nTEST_SCRIPT(ExamplesTest, JavaException, \"java_exception_test.sh\")\nTEST_SCRIPT(ExamplesTest, JavaLog, \"java_log_test.sh\")\n#endif\n\n\n#ifdef MESOS_HAS_PYTHON\nTEST_SCRIPT(ExamplesTest, PythonFramework, \"python_framework_test.sh\")\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2012 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/mapnik\n#include <mapnik\/text\/placements\/list.hpp>\n#include <mapnik\/xml_node.hpp>\n#include <mapnik\/make_unique.hpp>\n\/\/boost\n#include <boost\/property_tree\/ptree.hpp>\n\nnamespace mapnik\n{\n\nbool text_placement_info_list::next()\n{\n if (state == 0)\n {\n properties = parent_->defaults;\n }\n else\n {\n if (state > parent_->list_.size()) return false;\n properties = parent_->list_[state-1];\n }\n ++state;\n return true;\n}\n\ntext_symbolizer_properties & text_placements_list::add()\n{\n if (list_.size())\n {\n text_symbolizer_properties & last = list_.back();\n list_.push_back(last); \/\/Preinitialize with old values FIXME\n }\n else\n {\n list_.push_back(defaults);\n }\n return list_.back();\n}\n\ntext_symbolizer_properties & text_placements_list::get(unsigned i)\n{\n return list_[i];\n}\n\n\ntext_placement_info_ptr text_placements_list::get_placement_info(double scale_factor) const\n{\n return std::make_unique<text_placement_info_list>(this, scale_factor);\n}\n\ntext_placements_list::text_placements_list()\n : text_placements(),\n list_(0) {}\n\nvoid text_placements_list::add_expressions(expression_set & output) const\n{\n defaults.add_expressions(output);\n for (auto & prop : list_)\n {\n prop.add_expressions(output);\n }\n}\n\nunsigned text_placements_list::size() const\n{\n return list_.size();\n}\n\n\ntext_placements_ptr text_placements_list::from_xml(xml_node const& xml, fontset_map const& fontsets)\n{\n using boost::property_tree::ptree;\n text_placements_list *list = new text_placements_list;\n text_placements_ptr ptr = text_placements_ptr(list);\n list->defaults.from_xml(xml, fontsets);\n xml_node::const_iterator itr = xml.begin();\n xml_node::const_iterator end = xml.end();\n for( ;itr != end; ++itr)\n {\n if (itr->is_text() || !itr->is(\"Placement\")) continue;\n text_symbolizer_properties & p = list->add();\n \/\/p.format = std::make_shared<detail::evaluated_format_properties>(*(p.format)); \/\/Make a deep copy -- FIXME\n \/\/TODO: This needs a real copy constructor for text_symbolizer_properties\n p.from_xml(*itr, fontsets);\n \/\/TODO: if (strict_ && !p.format.fontset.size())\n \/\/ ensure_font_face(p.format.face_name);\n }\n return ptr;\n}\n\n} \/\/ns mapnik\n<commit_msg>c++11 : cleanup crufty code<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2012 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/mapnik\n#include <mapnik\/text\/placements\/list.hpp>\n#include <mapnik\/xml_node.hpp>\n#include <mapnik\/make_unique.hpp>\n\/\/boost\n#include <boost\/property_tree\/ptree.hpp>\n\nnamespace mapnik\n{\n\nbool text_placement_info_list::next()\n{\n if (state == 0)\n {\n properties = parent_->defaults;\n }\n else\n {\n if (state > parent_->list_.size()) return false;\n properties = parent_->list_[state-1];\n }\n ++state;\n return true;\n}\n\ntext_symbolizer_properties & text_placements_list::add()\n{\n if (list_.size())\n {\n text_symbolizer_properties & last = list_.back();\n list_.push_back(last); \/\/Preinitialize with old values FIXME\n }\n else\n {\n list_.push_back(defaults);\n }\n return list_.back();\n}\n\ntext_symbolizer_properties & text_placements_list::get(unsigned i)\n{\n return list_[i];\n}\n\n\ntext_placement_info_ptr text_placements_list::get_placement_info(double scale_factor) const\n{\n return std::make_unique<text_placement_info_list>(this, scale_factor);\n}\n\ntext_placements_list::text_placements_list()\n : text_placements(),\n list_(0) {}\n\nvoid text_placements_list::add_expressions(expression_set & output) const\n{\n defaults.add_expressions(output);\n for (auto & prop : list_)\n {\n prop.add_expressions(output);\n }\n}\n\nunsigned text_placements_list::size() const\n{\n return list_.size();\n}\n\n\ntext_placements_ptr text_placements_list::from_xml(xml_node const& node, fontset_map const& fontsets)\n{\n auto list = std::make_shared<text_placements_list>();\n list->defaults.from_xml(node, fontsets);\n for( auto const& child : node)\n {\n if (child.is_text() || !child.is(\"Placement\")) continue;\n text_symbolizer_properties & p = list->add();\n p.from_xml(child, fontsets);\n \/\/if (strict_ && !p.format.fontset.size())\n \/\/ ensure_font_face(p.format.face_name);\n }\n return list;\n}\n\n} \/\/ns mapnik\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @brief Implementation of charge propagation module with transient behavior simulation\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n#include \"TransientPropagationModule.hpp\"\n\n#include <map>\n#include <memory>\n#include <random>\n#include <string>\n#include <utility>\n\n#include <Eigen\/Core>\n\n#include \"core\/utils\/log.h\"\n#include \"objects\/PixelCharge.hpp\"\n#include \"tools\/runge_kutta.h\"\n\nusing namespace allpix;\n\nTransientPropagationModule::TransientPropagationModule(Configuration& config,\n Messenger* messenger,\n std::shared_ptr<Detector> detector)\n : Module(config, detector), detector_(std::move(detector)), messenger_(messenger) {\n\n \/\/ Save detector model\n model_ = detector_->getModel();\n\n \/\/ Require deposits message for single detector:\n messenger_->bindSingle(this, &TransientPropagationModule::deposits_message_, MsgFlags::REQUIRED);\n\n \/\/ Seed the random generator with the module seed\n random_generator_.seed(getRandomSeed());\n\n \/\/ Set default value for config variables\n config_.setDefault<double>(\"timestep\", Units::get(0.01, \"ns\"));\n config_.setDefault<double>(\"integration_time\", Units::get(25, \"ns\"));\n config_.setDefault<unsigned int>(\"charge_per_step\", 10);\n config_.setDefault<double>(\"temperature\", 293.15);\n config_.setDefault<bool>(\"output_plots\", false);\n\n \/\/ Copy some variables from configuration to avoid lookups:\n temperature_ = config_.get<double>(\"temperature\");\n timestep_ = config_.get<double>(\"timestep\");\n integration_time_ = config_.get<double>(\"integration_time\");\n output_plots_ = config_.get<bool>(\"output_plots\");\n\n \/\/ Parameterization variables from https:\/\/doi.org\/10.1016\/0038-1101(77)90054-5 (section 5.2)\n electron_Vm_ = Units::get(1.53e9 * std::pow(temperature_, -0.87), \"cm\/s\");\n electron_Ec_ = Units::get(1.01 * std::pow(temperature_, 1.55), \"V\/cm\");\n electron_Beta_ = 2.57e-2 * std::pow(temperature_, 0.66);\n\n hole_Vm_ = Units::get(1.62e8 * std::pow(temperature_, -0.52), \"cm\/s\");\n hole_Ec_ = Units::get(1.24 * std::pow(temperature_, 1.68), \"V\/cm\");\n hole_Beta_ = 0.46 * std::pow(temperature_, 0.17);\n\n boltzmann_kT_ = Units::get(8.6173e-5, \"eV\/K\") * temperature_;\n}\n\nvoid TransientPropagationModule::init() {\n\n auto detector = getDetector();\n\n \/\/ Check for electric field\n if(!detector->hasElectricField()) {\n LOG(WARNING) << \"This detector does not have an electric field.\";\n }\n\n if(!detector_->hasWeightingPotential()) {\n throw ModuleError(\"This module requires a weighting potential.\");\n }\n\n if(output_plots_) {\n induced_charge_histo_ = new TH1D(\"induced_charge_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n induced_charge_e_histo_ = new TH1D(\"induced_charge_e_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n induced_charge_h_histo_ = new TH1D(\"induced_charge_h_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n }\n}\n\nvoid TransientPropagationModule::run(unsigned int) {\n\n \/\/ Create map for all pixels\n std::map<Pixel::Index, Pulse> pixel_map;\n\n \/\/ Loop over all deposits for propagation\n LOG(TRACE) << \"Propagating charges in sensor\";\n for(auto& deposit : deposits_message_->getData()) {\n\n \/\/ Loop over all charges in the deposit\n unsigned int charges_remaining = deposit.getCharge();\n\n LOG(DEBUG) << \"Set of charge carriers (\" << deposit.getType() << \") on \"\n << Units::display(deposit.getLocalPosition(), {\"mm\", \"um\"});\n\n auto charge_per_step = config_.get<unsigned int>(\"charge_per_step\");\n while(charges_remaining > 0) {\n \/\/ Define number of charges to be propagated and remove charges of this step from the total\n if(charge_per_step > charges_remaining) {\n charge_per_step = charges_remaining;\n }\n charges_remaining -= charge_per_step;\n\n \/\/ Get position and propagate through sensor\n auto position = deposit.getLocalPosition();\n\n \/\/ Propagate a single charge deposit\n propagate(position, deposit.getType(), charge_per_step, pixel_map);\n LOG(DEBUG) << \" Propagated \" << charge_per_step << \" from \" << Units::display(position, {\"mm\", \"um\"});\n }\n }\n\n \/\/ Create vector of pixel pulses to return for this detector\n std::vector<PixelCharge> pixel_charges;\n for(auto& pixel_index_pulse : pixel_map) {\n pixel_charges.emplace_back(detector_->getPixel(pixel_index_pulse.first), std::move(pixel_index_pulse.second));\n }\n\n \/\/ Create a new message with pixel pulses\n auto pixel_charge_message = std::make_shared<PixelChargeMessage>(std::move(pixel_charges), detector_);\n\n \/\/ Dispatch the message with pixel charges\n messenger_->dispatchMessage(this, pixel_charge_message);\n}\n\n\/**\n * Propagation is simulated using a parameterization for the electron mobility. This is used to calculate the electron\n * velocity at every point with help of the electric field map of the detector. A Runge-Kutta integration is applied in\n * multiple steps, adding a random diffusion to the propagating charge every step.\n *\/\nvoid TransientPropagationModule::propagate(const ROOT::Math::XYZPoint& pos,\n const CarrierType& type,\n const unsigned int charge,\n std::map<Pixel::Index, Pulse>& pixel_map) {\n\n \/\/ Create a runge kutta solver using the electric field as step function\n Eigen::Vector3d position(pos.x(), pos.y(), pos.z());\n\n \/\/ Define a lambda function to compute the carrier mobility\n \/\/ NOTE This function is typically the most frequently executed part of the framework and therefore the bottleneck\n auto carrier_mobility = [&](double efield_mag) {\n \/\/ Compute carrier mobility from constants and electric field magnitude\n double numerator, denominator;\n if(type == CarrierType::ELECTRON) {\n numerator = electron_Vm_ \/ electron_Ec_;\n denominator = std::pow(1. + std::pow(efield_mag \/ electron_Ec_, electron_Beta_), 1.0 \/ electron_Beta_);\n } else {\n numerator = hole_Vm_ \/ hole_Ec_;\n denominator = std::pow(1. + std::pow(efield_mag \/ hole_Ec_, hole_Beta_), 1.0 \/ hole_Beta_);\n }\n return numerator \/ denominator;\n };\n\n \/\/ Define a function to compute the diffusion\n auto carrier_diffusion = [&](double efield_mag, double timestep) -> Eigen::Vector3d {\n double diffusion_constant = boltzmann_kT_ * carrier_mobility(efield_mag);\n double diffusion_std_dev = std::sqrt(2. * diffusion_constant * timestep);\n\n \/\/ Compute the independent diffusion in three\n std::normal_distribution<double> gauss_distribution(0, diffusion_std_dev);\n Eigen::Vector3d diffusion;\n for(int i = 0; i < 3; ++i) {\n diffusion[i] = gauss_distribution(random_generator_);\n }\n return diffusion;\n };\n\n \/\/ Define a lambda function to compute the electron velocity\n auto carrier_velocity = [&](double, Eigen::Vector3d cur_pos) -> Eigen::Vector3d {\n auto raw_field = detector_->getElectricField(static_cast<ROOT::Math::XYZPoint>(cur_pos));\n \/\/ Compute the drift velocity\n Eigen::Vector3d efield(raw_field.x(), raw_field.y(), raw_field.z());\n\n return static_cast<int>(type) * carrier_mobility(efield.norm()) * efield;\n };\n\n \/\/ Create the runge kutta solver with an RKF5 tableau\n auto runge_kutta = make_runge_kutta(tableau::RK5, carrier_velocity, timestep_, position);\n\n \/\/ Continue propagation until the deposit is outside the sensor\n Eigen::Vector3d last_position = position;\n double last_time = 0;\n bool within_sensor = true;\n while(within_sensor && runge_kutta.getTime() < integration_time_) {\n\n \/\/ Save previous position and time\n last_position = position;\n last_time = runge_kutta.getTime();\n\n \/\/ Execute a Runge Kutta step\n runge_kutta.step();\n\n \/\/ Get the current result\n position = runge_kutta.getValue();\n\n \/\/ Get electric field at current position and fall back to empty field if it does not exist\n auto efield = detector_->getElectricField(static_cast<ROOT::Math::XYZPoint>(position));\n\n \/\/ Apply diffusion step\n auto diffusion = carrier_diffusion(std::sqrt(efield.Mag2()), timestep_);\n position += diffusion;\n runge_kutta.setValue(position);\n\n \/\/ Check for overshooting outside the sensor and correct for it:\n if(!detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(position))) {\n LOG(TRACE) << \"Found position outside: \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"});\n \/\/ FIXME this simply changes the z coordinate to be within the sensor - maybe we can be more clever\n if(model_->getSensorSize().z() \/ 2.0 - position.z() < 0) {\n position = Eigen::Vector3d(position.x(), position.y(), model_->getSensorSize().z() \/ 2.0 - 1e-9);\n } else if(position.z() - model_->getSensorSize().z() \/ 2.0 < 0) {\n position = Eigen::Vector3d(position.x(), position.y(), -model_->getSensorSize().z() \/ 2.0 + 1e-9);\n }\n LOG(TRACE) << \"New position: \" << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"});\n within_sensor = false;\n }\n\n \/\/ Find the nearest pixel\n auto xpixel = static_cast<int>(std::round(position.x() \/ model_->getPixelSize().x()));\n auto ypixel = static_cast<int>(std::round(position.y() \/ model_->getPixelSize().y()));\n LOG(TRACE) << \"Moving carriers below pixel \"\n << Pixel::Index(static_cast<unsigned int>(xpixel), static_cast<unsigned int>(ypixel)) << \" from \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(last_position), {\"um\", \"mm\"}) << \" to \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"}) << \", \"\n << Units::display(runge_kutta.getTime(), \"ns\");\n\n \/\/ Loop over NxN pixels:\n for(int x = xpixel - 1; x <= xpixel + 1; x++) {\n for(int y = ypixel - 1; y <= ypixel + 1; y++) {\n \/\/ Ignore if out of pixel grid\n if(x < 0 || x >= model_->getNPixels().x() || y < 0 || y >= model_->getNPixels().y()) {\n LOG(TRACE) << \"Pixel (\" << x << \",\" << y << \") skipped, outside the grid\";\n continue;\n }\n\n Pixel::Index pixel_index(static_cast<unsigned int>(x), static_cast<unsigned int>(y));\n auto ramo = detector_->getWeightingPotential(static_cast<ROOT::Math::XYZPoint>(position), pixel_index);\n auto last_ramo =\n detector_->getWeightingPotential(static_cast<ROOT::Math::XYZPoint>(last_position), pixel_index);\n\n \/\/ Induced charge on electrode is q_int = q * (phi(x1) - phi(x0))\n auto induced = charge * (ramo - last_ramo);\n LOG(TRACE) << \"Pixel \" << pixel_index << \" dPhi = \" << (ramo - last_ramo) << \", induced \" << type\n << \" q = \" << Units::display(induced, \"e\");\n\n \/\/ Check if this pulse exists already:\n if(pixel_map.find(pixel_index) == pixel_map.end()) {\n pixel_map[pixel_index] = Pulse(integration_time_, timestep_);\n }\n\n \/\/ Store induced charge in the respective pixel pulse:\n pixel_map[pixel_index].addCharge(induced, runge_kutta.getTime());\n\n if(output_plots_ && x == 0 && y == 0) {\n induced_charge_histo_->Fill(runge_kutta.getTime(), induced);\n if(type == CarrierType::ELECTRON) {\n induced_charge_e_histo_->Fill(runge_kutta.getTime(), induced);\n } else {\n induced_charge_h_histo_->Fill(runge_kutta.getTime(), induced);\n }\n }\n }\n }\n }\n\n \/\/ Find proper final position in the sensor\n auto time = runge_kutta.getTime();\n if(!detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(position))) {\n auto check_position = position;\n check_position.z() = last_position.z();\n if(position.z() > 0 && detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(check_position))) {\n \/\/ Carrier left sensor on the side of the pixel grid, interpolate end point on surface\n auto z_cur_border = std::fabs(position.z() - model_->getSensorSize().z() \/ 2.0);\n auto z_last_border = std::fabs(model_->getSensorSize().z() \/ 2.0 - last_position.z());\n auto z_total = z_cur_border + z_last_border;\n position = (z_last_border \/ z_total) * position + (z_cur_border \/ z_total) * last_position;\n time = (z_last_border \/ z_total) * time + (z_cur_border \/ z_total) * last_time;\n } else {\n \/\/ Carrier left sensor on any order border, use last position inside instead\n position = last_position;\n time = last_time;\n }\n }\n LOG(TRACE) << \"Time: \" << Units::display(time, {\"ps\", \"ns\"});\n}\n\nvoid TransientPropagationModule::finalize() {\n if(output_plots_) {\n induced_charge_histo_->Write();\n induced_charge_e_histo_->Write();\n induced_charge_h_histo_->Write();\n }\n}\n<commit_msg>TransientPropagation: invert sign for different charge carrier types to create correct pulse<commit_after>\/**\n * @file\n * @brief Implementation of charge propagation module with transient behavior simulation\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n#include \"TransientPropagationModule.hpp\"\n\n#include <map>\n#include <memory>\n#include <random>\n#include <string>\n#include <utility>\n\n#include <Eigen\/Core>\n\n#include \"core\/utils\/log.h\"\n#include \"objects\/PixelCharge.hpp\"\n#include \"tools\/runge_kutta.h\"\n\nusing namespace allpix;\n\nTransientPropagationModule::TransientPropagationModule(Configuration& config,\n Messenger* messenger,\n std::shared_ptr<Detector> detector)\n : Module(config, detector), detector_(std::move(detector)), messenger_(messenger) {\n\n \/\/ Save detector model\n model_ = detector_->getModel();\n\n \/\/ Require deposits message for single detector:\n messenger_->bindSingle(this, &TransientPropagationModule::deposits_message_, MsgFlags::REQUIRED);\n\n \/\/ Seed the random generator with the module seed\n random_generator_.seed(getRandomSeed());\n\n \/\/ Set default value for config variables\n config_.setDefault<double>(\"timestep\", Units::get(0.01, \"ns\"));\n config_.setDefault<double>(\"integration_time\", Units::get(25, \"ns\"));\n config_.setDefault<unsigned int>(\"charge_per_step\", 10);\n config_.setDefault<double>(\"temperature\", 293.15);\n config_.setDefault<bool>(\"output_plots\", false);\n\n \/\/ Copy some variables from configuration to avoid lookups:\n temperature_ = config_.get<double>(\"temperature\");\n timestep_ = config_.get<double>(\"timestep\");\n integration_time_ = config_.get<double>(\"integration_time\");\n output_plots_ = config_.get<bool>(\"output_plots\");\n\n \/\/ Parameterization variables from https:\/\/doi.org\/10.1016\/0038-1101(77)90054-5 (section 5.2)\n electron_Vm_ = Units::get(1.53e9 * std::pow(temperature_, -0.87), \"cm\/s\");\n electron_Ec_ = Units::get(1.01 * std::pow(temperature_, 1.55), \"V\/cm\");\n electron_Beta_ = 2.57e-2 * std::pow(temperature_, 0.66);\n\n hole_Vm_ = Units::get(1.62e8 * std::pow(temperature_, -0.52), \"cm\/s\");\n hole_Ec_ = Units::get(1.24 * std::pow(temperature_, 1.68), \"V\/cm\");\n hole_Beta_ = 0.46 * std::pow(temperature_, 0.17);\n\n boltzmann_kT_ = Units::get(8.6173e-5, \"eV\/K\") * temperature_;\n}\n\nvoid TransientPropagationModule::init() {\n\n auto detector = getDetector();\n\n \/\/ Check for electric field\n if(!detector->hasElectricField()) {\n LOG(WARNING) << \"This detector does not have an electric field.\";\n }\n\n if(!detector_->hasWeightingPotential()) {\n throw ModuleError(\"This module requires a weighting potential.\");\n }\n\n if(output_plots_) {\n induced_charge_histo_ = new TH1D(\"induced_charge_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n induced_charge_e_histo_ = new TH1D(\"induced_charge_e_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n induced_charge_h_histo_ = new TH1D(\"induced_charge_h_histo\",\n \"Induced charge per time;Drift time [ns];charge [e]\",\n static_cast<int>(integration_time_ \/ timestep_),\n 0,\n static_cast<double>(Units::convert(integration_time_, \"ns\")));\n }\n}\n\nvoid TransientPropagationModule::run(unsigned int) {\n\n \/\/ Create map for all pixels\n std::map<Pixel::Index, Pulse> pixel_map;\n\n \/\/ Loop over all deposits for propagation\n LOG(TRACE) << \"Propagating charges in sensor\";\n for(auto& deposit : deposits_message_->getData()) {\n\n \/\/ Loop over all charges in the deposit\n unsigned int charges_remaining = deposit.getCharge();\n\n LOG(DEBUG) << \"Set of charge carriers (\" << deposit.getType() << \") on \"\n << Units::display(deposit.getLocalPosition(), {\"mm\", \"um\"});\n\n auto charge_per_step = config_.get<unsigned int>(\"charge_per_step\");\n while(charges_remaining > 0) {\n \/\/ Define number of charges to be propagated and remove charges of this step from the total\n if(charge_per_step > charges_remaining) {\n charge_per_step = charges_remaining;\n }\n charges_remaining -= charge_per_step;\n\n \/\/ Get position and propagate through sensor\n auto position = deposit.getLocalPosition();\n\n \/\/ Propagate a single charge deposit\n propagate(position, deposit.getType(), charge_per_step, pixel_map);\n LOG(DEBUG) << \" Propagated \" << charge_per_step << \" from \" << Units::display(position, {\"mm\", \"um\"});\n }\n }\n\n \/\/ Create vector of pixel pulses to return for this detector\n std::vector<PixelCharge> pixel_charges;\n for(auto& pixel_index_pulse : pixel_map) {\n pixel_charges.emplace_back(detector_->getPixel(pixel_index_pulse.first), std::move(pixel_index_pulse.second));\n }\n\n \/\/ Create a new message with pixel pulses\n auto pixel_charge_message = std::make_shared<PixelChargeMessage>(std::move(pixel_charges), detector_);\n\n \/\/ Dispatch the message with pixel charges\n messenger_->dispatchMessage(this, pixel_charge_message);\n}\n\n\/**\n * Propagation is simulated using a parameterization for the electron mobility. This is used to calculate the electron\n * velocity at every point with help of the electric field map of the detector. A Runge-Kutta integration is applied in\n * multiple steps, adding a random diffusion to the propagating charge every step.\n *\/\nvoid TransientPropagationModule::propagate(const ROOT::Math::XYZPoint& pos,\n const CarrierType& type,\n const unsigned int charge,\n std::map<Pixel::Index, Pulse>& pixel_map) {\n\n \/\/ Create a runge kutta solver using the electric field as step function\n Eigen::Vector3d position(pos.x(), pos.y(), pos.z());\n\n \/\/ Define a lambda function to compute the carrier mobility\n \/\/ NOTE This function is typically the most frequently executed part of the framework and therefore the bottleneck\n auto carrier_mobility = [&](double efield_mag) {\n \/\/ Compute carrier mobility from constants and electric field magnitude\n double numerator, denominator;\n if(type == CarrierType::ELECTRON) {\n numerator = electron_Vm_ \/ electron_Ec_;\n denominator = std::pow(1. + std::pow(efield_mag \/ electron_Ec_, electron_Beta_), 1.0 \/ electron_Beta_);\n } else {\n numerator = hole_Vm_ \/ hole_Ec_;\n denominator = std::pow(1. + std::pow(efield_mag \/ hole_Ec_, hole_Beta_), 1.0 \/ hole_Beta_);\n }\n return numerator \/ denominator;\n };\n\n \/\/ Define a function to compute the diffusion\n auto carrier_diffusion = [&](double efield_mag, double timestep) -> Eigen::Vector3d {\n double diffusion_constant = boltzmann_kT_ * carrier_mobility(efield_mag);\n double diffusion_std_dev = std::sqrt(2. * diffusion_constant * timestep);\n\n \/\/ Compute the independent diffusion in three\n std::normal_distribution<double> gauss_distribution(0, diffusion_std_dev);\n Eigen::Vector3d diffusion;\n for(int i = 0; i < 3; ++i) {\n diffusion[i] = gauss_distribution(random_generator_);\n }\n return diffusion;\n };\n\n \/\/ Define a lambda function to compute the electron velocity\n auto carrier_velocity = [&](double, Eigen::Vector3d cur_pos) -> Eigen::Vector3d {\n auto raw_field = detector_->getElectricField(static_cast<ROOT::Math::XYZPoint>(cur_pos));\n \/\/ Compute the drift velocity\n Eigen::Vector3d efield(raw_field.x(), raw_field.y(), raw_field.z());\n\n return static_cast<int>(type) * carrier_mobility(efield.norm()) * efield;\n };\n\n \/\/ Create the runge kutta solver with an RKF5 tableau\n auto runge_kutta = make_runge_kutta(tableau::RK5, carrier_velocity, timestep_, position);\n\n \/\/ Continue propagation until the deposit is outside the sensor\n Eigen::Vector3d last_position = position;\n double last_time = 0;\n bool within_sensor = true;\n while(within_sensor && runge_kutta.getTime() < integration_time_) {\n\n \/\/ Save previous position and time\n last_position = position;\n last_time = runge_kutta.getTime();\n\n \/\/ Execute a Runge Kutta step\n runge_kutta.step();\n\n \/\/ Get the current result\n position = runge_kutta.getValue();\n\n \/\/ Get electric field at current position and fall back to empty field if it does not exist\n auto efield = detector_->getElectricField(static_cast<ROOT::Math::XYZPoint>(position));\n\n \/\/ Apply diffusion step\n auto diffusion = carrier_diffusion(std::sqrt(efield.Mag2()), timestep_);\n position += diffusion;\n runge_kutta.setValue(position);\n\n \/\/ Check for overshooting outside the sensor and correct for it:\n if(!detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(position))) {\n LOG(TRACE) << \"Found position outside: \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"});\n \/\/ FIXME this simply changes the z coordinate to be within the sensor - maybe we can be more clever\n if(model_->getSensorSize().z() \/ 2.0 - position.z() < 0) {\n position = Eigen::Vector3d(position.x(), position.y(), model_->getSensorSize().z() \/ 2.0 - 1e-9);\n } else if(position.z() - model_->getSensorSize().z() \/ 2.0 < 0) {\n position = Eigen::Vector3d(position.x(), position.y(), -model_->getSensorSize().z() \/ 2.0 + 1e-9);\n }\n LOG(TRACE) << \"New position: \" << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"});\n within_sensor = false;\n }\n\n \/\/ Find the nearest pixel\n auto xpixel = static_cast<int>(std::round(position.x() \/ model_->getPixelSize().x()));\n auto ypixel = static_cast<int>(std::round(position.y() \/ model_->getPixelSize().y()));\n LOG(TRACE) << \"Moving carriers below pixel \"\n << Pixel::Index(static_cast<unsigned int>(xpixel), static_cast<unsigned int>(ypixel)) << \" from \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(last_position), {\"um\", \"mm\"}) << \" to \"\n << Units::display(static_cast<ROOT::Math::XYZPoint>(position), {\"um\", \"mm\"}) << \", \"\n << Units::display(runge_kutta.getTime(), \"ns\");\n\n \/\/ Loop over NxN pixels:\n for(int x = xpixel - 1; x <= xpixel + 1; x++) {\n for(int y = ypixel - 1; y <= ypixel + 1; y++) {\n \/\/ Ignore if out of pixel grid\n if(x < 0 || x >= model_->getNPixels().x() || y < 0 || y >= model_->getNPixels().y()) {\n LOG(TRACE) << \"Pixel (\" << x << \",\" << y << \") skipped, outside the grid\";\n continue;\n }\n\n Pixel::Index pixel_index(static_cast<unsigned int>(x), static_cast<unsigned int>(y));\n auto ramo = detector_->getWeightingPotential(static_cast<ROOT::Math::XYZPoint>(position), pixel_index);\n auto last_ramo =\n detector_->getWeightingPotential(static_cast<ROOT::Math::XYZPoint>(last_position), pixel_index);\n\n \/\/ Induced charge on electrode is q_int = q * (phi(x1) - phi(x0))\n auto induced = charge * (ramo - last_ramo) * (-static_cast<std::underlying_type<CarrierType>::type>(type));\n LOG(TRACE) << \"Pixel \" << pixel_index << \" dPhi = \" << (ramo - last_ramo) << \", induced \" << type\n << \" q = \" << Units::display(induced, \"e\");\n\n \/\/ Check if this pulse exists already:\n if(pixel_map.find(pixel_index) == pixel_map.end()) {\n pixel_map[pixel_index] = Pulse(integration_time_, timestep_);\n }\n\n \/\/ Store induced charge in the respective pixel pulse:\n pixel_map[pixel_index].addCharge(induced, runge_kutta.getTime());\n\n if(output_plots_ && x == 0 && y == 0) {\n induced_charge_histo_->Fill(runge_kutta.getTime(), induced);\n if(type == CarrierType::ELECTRON) {\n induced_charge_e_histo_->Fill(runge_kutta.getTime(), induced);\n } else {\n induced_charge_h_histo_->Fill(runge_kutta.getTime(), induced);\n }\n }\n }\n }\n }\n\n \/\/ Find proper final position in the sensor\n auto time = runge_kutta.getTime();\n if(!detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(position))) {\n auto check_position = position;\n check_position.z() = last_position.z();\n if(position.z() > 0 && detector_->isWithinSensor(static_cast<ROOT::Math::XYZPoint>(check_position))) {\n \/\/ Carrier left sensor on the side of the pixel grid, interpolate end point on surface\n auto z_cur_border = std::fabs(position.z() - model_->getSensorSize().z() \/ 2.0);\n auto z_last_border = std::fabs(model_->getSensorSize().z() \/ 2.0 - last_position.z());\n auto z_total = z_cur_border + z_last_border;\n position = (z_last_border \/ z_total) * position + (z_cur_border \/ z_total) * last_position;\n time = (z_last_border \/ z_total) * time + (z_cur_border \/ z_total) * last_time;\n } else {\n \/\/ Carrier left sensor on any order border, use last position inside instead\n position = last_position;\n time = last_time;\n }\n }\n LOG(TRACE) << \"Time: \" << Units::display(time, {\"ps\", \"ns\"});\n}\n\nvoid TransientPropagationModule::finalize() {\n if(output_plots_) {\n induced_charge_histo_->Write();\n induced_charge_e_histo_->Write();\n induced_charge_h_histo_->Write();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Transforms\/UnifyMethodExitNodes.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include \"llvm\/Transforms\/CleanupGCCOutput.h\"\n#include \"llvm\/Transforms\/LevelChange.h\"\n#include \"llvm\/Transforms\/MethodInlining.h\"\n#include \"llvm\/Transforms\/SymbolStripping.h\"\n#include \"llvm\/Transforms\/ChangeAllocations.h\"\n#include \"llvm\/Transforms\/IPO\/SimpleStructMutation.h\"\n#include \"llvm\/Transforms\/IPO\/GlobalDCE.h\"\n#include \"llvm\/Transforms\/Scalar\/DCE.h\"\n#include \"llvm\/Transforms\/Scalar\/ConstantProp.h\"\n#include \"llvm\/Transforms\/Scalar\/IndVarSimplify.h\"\n#include \"llvm\/Transforms\/Scalar\/InstructionCombining.h\"\n#include \"llvm\/Transforms\/Scalar\/PromoteMemoryToRegister.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"Support\/CommandLine.h\"\n#include <fstream>\n#include <memory>\n\n\/\/ Opts enum - All of the transformations we can do...\nenum Opts {\n \/\/ Basic optimizations\n dce, constprop, inlining, constmerge, strip, mstrip, mergereturn,\n\n \/\/ Miscellaneous Transformations\n trace, tracem, raiseallocs, cleangcc,\n\n \/\/ Printing and verifying...\n print, verify,\n\n \/\/ More powerful optimizations\n indvars, instcombine, sccp, adce, raise, mem2reg,\n\n \/\/ Interprocedural optimizations...\n globaldce, swapstructs, sortstructs,\n};\n\n\n\/\/ New template functions - Provide functions that return passes of specified\n\/\/ types, with specified arguments...\n\/\/\ntemplate<class PassClass>\nPass *New() {\n return new PassClass();\n}\n\ntemplate<class PassClass, typename ArgTy1, ArgTy1 Arg1>\nPass *New() {\n return new PassClass(Arg1);\n}\n\ntemplate<class PassClass, typename ArgTy1, ArgTy1 Arg1, \n typename ArgTy2, ArgTy1 Arg2>\nPass *New() {\n return new PassClass(Arg1, Arg2);\n}\n\nstatic Pass *NewPrintMethodPass() {\n return new PrintMethodPass(\"Current Method: \\n\", &cerr);\n}\n\n\/\/ OptTable - Correlate enum Opts to Pass constructors...\n\/\/\nstruct {\n enum Opts OptID;\n Pass * (*PassCtor)();\n} OptTable[] = {\n { dce , New<DeadCodeElimination> },\n { constprop , New<ConstantPropogation> }, \n { inlining , New<MethodInlining> },\n { constmerge , New<ConstantMerge> },\n { strip , New<SymbolStripping> },\n { mstrip , New<FullSymbolStripping> },\n { mergereturn, New<UnifyMethodExitNodes> },\n\n { indvars , New<InductionVariableSimplify> },\n { instcombine, New<InstructionCombining> },\n { sccp , New<SCCPPass> },\n { adce , New<AgressiveDCE> },\n { raise , New<RaisePointerReferences> },\n { mem2reg , newPromoteMemoryToRegister },\n\n { trace , New<InsertTraceCode, bool, true, bool, true> },\n { tracem , New<InsertTraceCode, bool, false, bool, true> },\n { print , NewPrintMethodPass },\n { verify , createVerifierPass },\n { raiseallocs, New<RaiseAllocations> },\n { cleangcc , New<CleanupGCCOutput> },\n { globaldce , New<GlobalDCE> },\n { swapstructs, New<SimpleStructMutation, SimpleStructMutation::Transform,\n SimpleStructMutation::SwapElements>},\n { sortstructs, New<SimpleStructMutation, SimpleStructMutation::Transform,\n SimpleStructMutation::SortElements>},\n};\n\n\/\/ Command line option handling code...\n\/\/\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag PrintEachXForm(\"p\", \"Print module after each transformation\");\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(constprop , \"Simple constant propogation\"),\n clEnumValN(inlining , \"inline\", \"Method integration\"),\n clEnumVal(constmerge , \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip symbols\"),\n clEnumVal(mstrip , \"Strip module symbols\"),\n clEnumVal(mergereturn, \"Unify method exit nodes\"),\n\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(instcombine, \"Combine redundant instructions\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(mem2reg , \"Promote alloca locations to registers\"),\n\n clEnumVal(globaldce , \"Remove unreachable globals\"),\n clEnumVal(swapstructs, \"Swap structure types around\"),\n clEnumVal(sortstructs, \"Sort structure elements\"),\n\n clEnumVal(raiseallocs, \"Raise allocations from calls to instructions\"),\n clEnumVal(cleangcc , \"Cleanup GCC Output\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n\n clEnumVal(print , \"Print working method to stderr\"),\n clEnumVal(verify , \"Verify module is well formed\"),\n0);\n\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n\n \/\/ Load the input module...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n \/\/ Figure out what stream we are supposed to write to...\n std::ostream *Out = &std::cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n cerr << \"Error opening '\" << OutputFilename << \"': File exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n return 1;\n }\n }\n\n \/\/ Create a PassManager to hold and optimize the collection of passes we are\n \/\/ about to build...\n \/\/\n PassManager Passes;\n\n \/\/ Create a new optimization pass for each one specified on the command line\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n for (unsigned j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j)\n if (Opt == OptTable[j].OptID) {\n Passes.add(OptTable[j].PassCtor());\n break;\n }\n\n if (PrintEachXForm)\n Passes.add(new PrintModulePass(&std::cerr));\n }\n\n \/\/ Check that the module is well formed on completion of optimization\n Passes.add(createVerifierPass());\n\n \/\/ Write bytecode out to disk or cout as the last step...\n Passes.add(new WriteBytecodePass(Out, Out != &std::cout));\n\n \/\/ Now that we have all of the passes ready, run them.\n if (Passes.run(M.get()) && !Quiet)\n cerr << \"Program modified.\\n\";\n\n return 0;\n}\n<commit_msg>Includes -paths option to trace paths in the program<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Transforms\/UnifyMethodExitNodes.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include \"llvm\/Transforms\/CleanupGCCOutput.h\"\n#include \"llvm\/Transforms\/LevelChange.h\"\n#include \"llvm\/Transforms\/MethodInlining.h\"\n#include \"llvm\/Transforms\/SymbolStripping.h\"\n#include \"llvm\/Transforms\/ChangeAllocations.h\"\n#include \"llvm\/Transforms\/IPO\/SimpleStructMutation.h\"\n#include \"llvm\/Transforms\/IPO\/GlobalDCE.h\"\n#include \"llvm\/Transforms\/Scalar\/DCE.h\"\n#include \"llvm\/Transforms\/Scalar\/ConstantProp.h\"\n#include \"llvm\/Transforms\/Scalar\/IndVarSimplify.h\"\n#include \"llvm\/Transforms\/Scalar\/InstructionCombining.h\"\n#include \"llvm\/Transforms\/Scalar\/PromoteMemoryToRegister.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"llvm\/Transforms\/Instrumentation\/ProfilePaths.h\"\n#include \"Support\/CommandLine.h\"\n#include <fstream>\n#include <memory>\n\n\/\/ Opts enum - All of the transformations we can do...\nenum Opts {\n \/\/ Basic optimizations\n dce, constprop, inlining, constmerge, strip, mstrip, mergereturn,\n\n \/\/ Miscellaneous Transformations\n raiseallocs, cleangcc,\n\n \/\/ Printing and verifying...\n print, verify,\n\n \/\/ More powerful optimizations\n indvars, instcombine, sccp, adce, raise, mem2reg,\n\n \/\/ Instrumentation\n trace, tracem, paths,\n\n \/\/ Interprocedural optimizations...\n globaldce, swapstructs, sortstructs,\n};\n\n\n\/\/ New template functions - Provide functions that return passes of specified\n\/\/ types, with specified arguments...\n\/\/\ntemplate<class PassClass>\nPass *New() {\n return new PassClass();\n}\n\ntemplate<class PassClass, typename ArgTy1, ArgTy1 Arg1>\nPass *New() {\n return new PassClass(Arg1);\n}\n\ntemplate<class PassClass, typename ArgTy1, ArgTy1 Arg1, \n typename ArgTy2, ArgTy1 Arg2>\nPass *New() {\n return new PassClass(Arg1, Arg2);\n}\n\nstatic Pass *NewPrintMethodPass() {\n return new PrintMethodPass(\"Current Method: \\n\", &cerr);\n}\n\n\/\/ OptTable - Correlate enum Opts to Pass constructors...\n\/\/\nstruct {\n enum Opts OptID;\n Pass * (*PassCtor)();\n} OptTable[] = {\n { dce , New<DeadCodeElimination> },\n { constprop , New<ConstantPropogation> }, \n { inlining , New<MethodInlining> },\n { constmerge , New<ConstantMerge> },\n { strip , New<SymbolStripping> },\n { mstrip , New<FullSymbolStripping> },\n { mergereturn, New<UnifyMethodExitNodes> },\n\n { indvars , New<InductionVariableSimplify> },\n { instcombine, New<InstructionCombining> },\n { sccp , New<SCCPPass> },\n { adce , New<AgressiveDCE> },\n { raise , New<RaisePointerReferences> },\n { mem2reg , newPromoteMemoryToRegister },\n\n { trace , New<InsertTraceCode, bool, true, bool, true> },\n { tracem , New<InsertTraceCode, bool, false, bool, true> },\n { paths , New<ProfilePaths> },\n { print , NewPrintMethodPass },\n { verify , createVerifierPass },\n { raiseallocs, New<RaiseAllocations> },\n { cleangcc , New<CleanupGCCOutput> },\n { globaldce , New<GlobalDCE> },\n { swapstructs, New<SimpleStructMutation, SimpleStructMutation::Transform,\n SimpleStructMutation::SwapElements>},\n { sortstructs, New<SimpleStructMutation, SimpleStructMutation::Transform,\n SimpleStructMutation::SortElements>},\n};\n\n\/\/ Command line option handling code...\n\/\/\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag PrintEachXForm(\"p\", \"Print module after each transformation\");\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(constprop , \"Simple constant propogation\"),\n clEnumValN(inlining , \"inline\", \"Method integration\"),\n clEnumVal(constmerge , \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip symbols\"),\n clEnumVal(mstrip , \"Strip module symbols\"),\n clEnumVal(mergereturn, \"Unify method exit nodes\"),\n\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(instcombine, \"Combine redundant instructions\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(mem2reg , \"Promote alloca locations to registers\"),\n\n clEnumVal(globaldce , \"Remove unreachable globals\"),\n clEnumVal(swapstructs, \"Swap structure types around\"),\n clEnumVal(sortstructs, \"Sort structure elements\"),\n\n clEnumVal(raiseallocs, \"Raise allocations from calls to instructions\"),\n clEnumVal(cleangcc , \"Cleanup GCC Output\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n clEnumVal(paths , \"Insert path profiling instrumentation\"),\n clEnumVal(print , \"Print working method to stderr\"),\n clEnumVal(verify , \"Verify module is well formed\"),\n0);\n\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n\n \/\/ Load the input module...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n \/\/ Figure out what stream we are supposed to write to...\n std::ostream *Out = &std::cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n cerr << \"Error opening '\" << OutputFilename << \"': File exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n return 1;\n }\n }\n\n \/\/ Create a PassManager to hold and optimize the collection of passes we are\n \/\/ about to build...\n \/\/\n PassManager Passes;\n\n \/\/ Create a new optimization pass for each one specified on the command line\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n for (unsigned j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j)\n if (Opt == OptTable[j].OptID) {\n Passes.add(OptTable[j].PassCtor());\n break;\n }\n\n if (PrintEachXForm)\n Passes.add(new PrintModulePass(&std::cerr));\n }\n\n \/\/ Check that the module is well formed on completion of optimization\n Passes.add(createVerifierPass());\n\n \/\/ Write bytecode out to disk or cout as the last step...\n Passes.add(new WriteBytecodePass(Out, Out != &std::cout));\n\n \/\/ Now that we have all of the passes ready, run them.\n if (Passes.run(M.get()) && !Quiet)\n cerr << \"Program modified.\\n\";\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/Writer.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Optimizations\/AllOpts.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include <fstream>\n\nusing namespace opt;\n\nenum Opts {\n \/\/ Basic optimizations\n dce, constprop, inlining, mergecons, strip, mstrip,\n\n \/\/ Miscellaneous Transformations\n trace, tracem, print,\n\n \/\/ More powerful optimizations\n indvars, sccp, adce, raise,\n};\n\nstruct {\n enum Opts OptID;\n Pass *ThePass;\n} OptTable[] = {\n { dce , new opt::DeadCodeElimination() },\n { constprop, new opt::ConstantPropogation() }, \n { inlining , new opt::MethodInlining() },\n { mergecons, new ConstantMerge() },\n { strip , new opt::SymbolStripping() },\n { mstrip , new opt::FullSymbolStripping() },\n { indvars , new opt::InductionVariableCannonicalize() },\n { sccp , new opt::SCCPPass() },\n { adce , new opt::AgressiveDCE() },\n { raise , new opt::RaiseRepresentation() },\n { trace , new InsertTraceCode(true, true) },\n { tracem , new InsertTraceCode(false, true) },\n { print , new PrintModulePass(\"Current Method: \\n\",&cerr) },\n};\n\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(constprop, \"Simple Constant Propogation\"),\n clEnumValN(inlining , \"inline\", \"Method Integration\"),\n clEnumVal(mergecons, \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip Symbols\"),\n clEnumVal(mstrip , \"Strip Module Symbols\"),\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n clEnumVal(print , \"Print working method to stderr\"),\n0);\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n \n Module *C = ParseBytecodeFile(InputFilename);\n if (C == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n\n unsigned j;\n for (j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j) {\n if (Opt == OptTable[j].OptID) {\n if (OptTable[j].ThePass->run(C) && !Quiet)\n cerr << OptimizationList.getArgName(Opt)\n\t << \" pass made modifications!\\n\";\n break;\n }\n }\n\n if (j == sizeof(OptTable)\/sizeof(OptTable[0])) \n cerr << \"Optimization tables inconsistent!!\\n\";\n }\n\n ostream *Out = &cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n Out = new ofstream(OutputFilename.c_str(), \n (Force ? 0 : ios::noreplace)|ios::out);\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n delete C;\n return 1;\n }\n }\n\n \/\/ Okay, we're done now... write out result...\n WriteBytecodeToFile(C, *Out);\n delete C;\n\n if (Out != &cout) delete Out;\n return 0;\n}\n<commit_msg>Add hook for GCC cleanup pass<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/Writer.h\"\n#include \"llvm\/Support\/CommandLine.h\"\n#include \"llvm\/Optimizations\/AllOpts.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include \"llvm\/Transforms\/CleanupGCCOutput.h\"\n#include <fstream>\n\nusing namespace opt;\n\nenum Opts {\n \/\/ Basic optimizations\n dce, constprop, inlining, mergecons, strip, mstrip,\n\n \/\/ Miscellaneous Transformations\n trace, tracem, print, cleangcc,\n\n \/\/ More powerful optimizations\n indvars, sccp, adce, raise,\n};\n\nstruct {\n enum Opts OptID;\n Pass *ThePass;\n} OptTable[] = {\n { dce , new opt::DeadCodeElimination() },\n { constprop, new opt::ConstantPropogation() }, \n { inlining , new opt::MethodInlining() },\n { mergecons, new ConstantMerge() },\n { strip , new opt::SymbolStripping() },\n { mstrip , new opt::FullSymbolStripping() },\n { indvars , new opt::InductionVariableCannonicalize() },\n { sccp , new opt::SCCPPass() },\n { adce , new opt::AgressiveDCE() },\n { raise , new opt::RaiseRepresentation() },\n { trace , new InsertTraceCode(true, true) },\n { tracem , new InsertTraceCode(false, true) },\n { print , new PrintModulePass(\"Current Method: \\n\",&cerr) },\n { cleangcc , new CleanupGCCOutput() },\n};\n\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(constprop, \"Simple Constant Propogation\"),\n clEnumValN(inlining , \"inline\", \"Method Integration\"),\n clEnumVal(mergecons, \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip Symbols\"),\n clEnumVal(mstrip , \"Strip Module Symbols\"),\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(cleangcc , \"Cleanup GCC Output\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n clEnumVal(print , \"Print working method to stderr\"),\n0);\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n \n Module *C = ParseBytecodeFile(InputFilename);\n if (C == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n\n unsigned j;\n for (j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j) {\n if (Opt == OptTable[j].OptID) {\n if (OptTable[j].ThePass->run(C) && !Quiet)\n cerr << OptimizationList.getArgName(Opt)\n\t << \" pass made modifications!\\n\";\n break;\n }\n }\n\n if (j == sizeof(OptTable)\/sizeof(OptTable[0])) \n cerr << \"Optimization tables inconsistent!!\\n\";\n }\n\n ostream *Out = &cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n Out = new ofstream(OutputFilename.c_str(), \n (Force ? 0 : ios::noreplace)|ios::out);\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n delete C;\n return 1;\n }\n }\n\n \/\/ Okay, we're done now... write out result...\n WriteBytecodeToFile(C, *Out);\n delete C;\n\n if (Out != &cout) delete Out;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Transforms\/UnifyMethodExitNodes.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include \"llvm\/Transforms\/CleanupGCCOutput.h\"\n#include \"llvm\/Transforms\/LevelChange.h\"\n#include \"llvm\/Transforms\/MethodInlining.h\"\n#include \"llvm\/Transforms\/SymbolStripping.h\"\n#include \"llvm\/Transforms\/ChangeAllocations.h\"\n#include \"llvm\/Transforms\/IPO\/SimpleStructMutation.h\"\n#include \"llvm\/Transforms\/IPO\/GlobalDCE.h\"\n#include \"llvm\/Transforms\/Scalar\/DCE.h\"\n#include \"llvm\/Transforms\/Scalar\/ConstantProp.h\"\n#include \"llvm\/Transforms\/Scalar\/IndVarSimplify.h\"\n#include \"llvm\/Transforms\/Scalar\/InstructionCombining.h\"\n#include \"llvm\/Transforms\/Scalar\/PromoteMemoryToRegister.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"llvm\/Transforms\/Instrumentation\/ProfilePaths.h\"\n#include \"Support\/CommandLine.h\"\n#include <fstream>\n#include <memory>\n\n\/\/ Opts enum - All of the transformations we can do...\nenum Opts {\n \/\/ Basic optimizations\n dce, constprop, inlining, constmerge, strip, mstrip, mergereturn,\n\n \/\/ Miscellaneous Transformations\n raiseallocs, cleangcc,\n\n \/\/ Printing and verifying...\n print, verify,\n\n \/\/ More powerful optimizations\n indvars, instcombine, sccp, adce, raise, mem2reg,\n\n \/\/ Instrumentation\n trace, tracem, paths,\n\n \/\/ Interprocedural optimizations...\n globaldce, swapstructs, sortstructs,\n};\n\nstatic Pass *createPrintMethodPass() {\n return new PrintMethodPass(\"Current Method: \\n\", &cerr);\n}\n\n\/\/ OptTable - Correlate enum Opts to Pass constructors...\n\/\/\nstruct {\n enum Opts OptID;\n Pass * (*PassCtor)();\n} OptTable[] = {\n { dce , createDeadCodeEliminationPass },\n { constprop , createConstantPropogationPass }, \n { inlining , createMethodInliningPass },\n { constmerge , createConstantMergePass },\n { strip , createSymbolStrippingPass },\n { mstrip , createFullSymbolStrippingPass },\n { mergereturn, createUnifyMethodExitNodesPass },\n\n { indvars , createIndVarSimplifyPass },\n { instcombine, createInstructionCombiningPass },\n { sccp , createSCCPPass },\n { adce , createAgressiveDCEPass },\n { raise , createRaisePointerReferencesPass },\n { mem2reg , newPromoteMemoryToRegister },\n\n { trace , createTraceValuesPassForBasicBlocks },\n { tracem , createTraceValuesPassForMethod },\n { paths , createProfilePathsPass },\n\n { print , createPrintMethodPass },\n { verify , createVerifierPass },\n\n { raiseallocs, createRaiseAllocationsPass },\n { cleangcc , createCleanupGCCOutputPass },\n { globaldce , createGlobalDCEPass },\n { swapstructs, createSwapElementsPass },\n { sortstructs, createSortElementsPass },\n};\n\n\/\/ Command line option handling code...\n\/\/\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag PrintEachXForm(\"p\", \"Print module after each transformation\");\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(constprop , \"Simple constant propogation\"),\n clEnumValN(inlining , \"inline\", \"Method integration\"),\n clEnumVal(constmerge , \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip symbols\"),\n clEnumVal(mstrip , \"Strip module symbols\"),\n clEnumVal(mergereturn, \"Unify method exit nodes\"),\n\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(instcombine, \"Combine redundant instructions\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(mem2reg , \"Promote alloca locations to registers\"),\n\n clEnumVal(globaldce , \"Remove unreachable globals\"),\n clEnumVal(swapstructs, \"Swap structure types around\"),\n clEnumVal(sortstructs, \"Sort structure elements\"),\n\n clEnumVal(raiseallocs, \"Raise allocations from calls to instructions\"),\n clEnumVal(cleangcc , \"Cleanup GCC Output\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n clEnumVal(paths , \"Insert path profiling instrumentation\"),\n clEnumVal(print , \"Print working method to stderr\"),\n clEnumVal(verify , \"Verify module is well formed\"),\n0);\n\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n\n \/\/ Load the input module...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n \/\/ Figure out what stream we are supposed to write to...\n std::ostream *Out = &std::cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n cerr << \"Error opening '\" << OutputFilename << \"': File exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n return 1;\n }\n }\n\n \/\/ Create a PassManager to hold and optimize the collection of passes we are\n \/\/ about to build...\n \/\/\n PassManager Passes;\n\n \/\/ Create a new optimization pass for each one specified on the command line\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n for (unsigned j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j)\n if (Opt == OptTable[j].OptID) {\n Passes.add(OptTable[j].PassCtor());\n break;\n }\n\n if (PrintEachXForm)\n Passes.add(new PrintModulePass(&std::cerr));\n }\n\n \/\/ Check that the module is well formed on completion of optimization\n Passes.add(createVerifierPass());\n\n \/\/ Write bytecode out to disk or cout as the last step...\n Passes.add(new WriteBytecodePass(Out, Out != &std::cout));\n\n \/\/ Now that we have all of the passes ready, run them.\n if (Passes.run(M.get()) && !Quiet)\n cerr << \"Program modified.\\n\";\n\n return 0;\n}\n<commit_msg>Expose dead instruction elimination pass<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/ LLVM 'OPT' UTILITY \n\/\/\n\/\/ Optimizations may be specified an arbitrary number of times on the command\n\/\/ line, they are run in the order specified.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Bytecode\/Reader.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Assembly\/PrintModulePass.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Transforms\/UnifyMethodExitNodes.h\"\n#include \"llvm\/Transforms\/ConstantMerge.h\"\n#include \"llvm\/Transforms\/CleanupGCCOutput.h\"\n#include \"llvm\/Transforms\/LevelChange.h\"\n#include \"llvm\/Transforms\/MethodInlining.h\"\n#include \"llvm\/Transforms\/SymbolStripping.h\"\n#include \"llvm\/Transforms\/ChangeAllocations.h\"\n#include \"llvm\/Transforms\/IPO\/SimpleStructMutation.h\"\n#include \"llvm\/Transforms\/IPO\/GlobalDCE.h\"\n#include \"llvm\/Transforms\/Scalar\/DCE.h\"\n#include \"llvm\/Transforms\/Scalar\/ConstantProp.h\"\n#include \"llvm\/Transforms\/Scalar\/IndVarSimplify.h\"\n#include \"llvm\/Transforms\/Scalar\/InstructionCombining.h\"\n#include \"llvm\/Transforms\/Scalar\/PromoteMemoryToRegister.h\"\n#include \"llvm\/Transforms\/Instrumentation\/TraceValues.h\"\n#include \"llvm\/Transforms\/Instrumentation\/ProfilePaths.h\"\n#include \"Support\/CommandLine.h\"\n#include <fstream>\n#include <memory>\n\n\/\/ Opts enum - All of the transformations we can do...\nenum Opts {\n \/\/ Basic optimizations\n dce, die, constprop, inlining, constmerge, strip, mstrip, mergereturn,\n\n \/\/ Miscellaneous Transformations\n raiseallocs, cleangcc,\n\n \/\/ Printing and verifying...\n print, verify,\n\n \/\/ More powerful optimizations\n indvars, instcombine, sccp, adce, raise, mem2reg,\n\n \/\/ Instrumentation\n trace, tracem, paths,\n\n \/\/ Interprocedural optimizations...\n globaldce, swapstructs, sortstructs,\n};\n\nstatic Pass *createPrintMethodPass() {\n return new PrintMethodPass(\"Current Method: \\n\", &cerr);\n}\n\n\/\/ OptTable - Correlate enum Opts to Pass constructors...\n\/\/\nstruct {\n enum Opts OptID;\n Pass * (*PassCtor)();\n} OptTable[] = {\n { dce , createDeadCodeEliminationPass },\n { die , createDeadInstEliminationPass },\n { constprop , createConstantPropogationPass }, \n { inlining , createMethodInliningPass },\n { constmerge , createConstantMergePass },\n { strip , createSymbolStrippingPass },\n { mstrip , createFullSymbolStrippingPass },\n { mergereturn, createUnifyMethodExitNodesPass },\n\n { indvars , createIndVarSimplifyPass },\n { instcombine, createInstructionCombiningPass },\n { sccp , createSCCPPass },\n { adce , createAgressiveDCEPass },\n { raise , createRaisePointerReferencesPass },\n { mem2reg , newPromoteMemoryToRegister },\n\n { trace , createTraceValuesPassForBasicBlocks },\n { tracem , createTraceValuesPassForMethod },\n { paths , createProfilePathsPass },\n\n { print , createPrintMethodPass },\n { verify , createVerifierPass },\n\n { raiseallocs, createRaiseAllocationsPass },\n { cleangcc , createCleanupGCCOutputPass },\n { globaldce , createGlobalDCEPass },\n { swapstructs, createSwapElementsPass },\n { sortstructs, createSortElementsPass },\n};\n\n\/\/ Command line option handling code...\n\/\/\ncl::String InputFilename (\"\", \"Load <arg> file to optimize\", cl::NoFlags, \"-\");\ncl::String OutputFilename(\"o\", \"Override output filename\", cl::NoFlags, \"\");\ncl::Flag Force (\"f\", \"Overwrite output files\", cl::NoFlags, false);\ncl::Flag PrintEachXForm(\"p\", \"Print module after each transformation\");\ncl::Flag Quiet (\"q\", \"Don't print modifying pass names\", 0, false);\ncl::Alias QuietA (\"quiet\", \"Alias for -q\", cl::NoFlags, Quiet);\ncl::EnumList<enum Opts> OptimizationList(cl::NoFlags,\n clEnumVal(dce , \"Dead Code Elimination\"),\n clEnumVal(die , \"Dead Instruction Elimination\"),\n clEnumVal(constprop , \"Simple constant propogation\"),\n clEnumValN(inlining , \"inline\", \"Method integration\"),\n clEnumVal(constmerge , \"Merge identical global constants\"),\n clEnumVal(strip , \"Strip symbols\"),\n clEnumVal(mstrip , \"Strip module symbols\"),\n clEnumVal(mergereturn, \"Unify method exit nodes\"),\n\n clEnumVal(indvars , \"Simplify Induction Variables\"),\n clEnumVal(instcombine, \"Combine redundant instructions\"),\n clEnumVal(sccp , \"Sparse Conditional Constant Propogation\"),\n clEnumVal(adce , \"Agressive DCE\"),\n clEnumVal(mem2reg , \"Promote alloca locations to registers\"),\n\n clEnumVal(globaldce , \"Remove unreachable globals\"),\n clEnumVal(swapstructs, \"Swap structure types around\"),\n clEnumVal(sortstructs, \"Sort structure elements\"),\n\n clEnumVal(raiseallocs, \"Raise allocations from calls to instructions\"),\n clEnumVal(cleangcc , \"Cleanup GCC Output\"),\n clEnumVal(raise , \"Raise to Higher Level\"),\n clEnumVal(trace , \"Insert BB & Method trace code\"),\n clEnumVal(tracem , \"Insert Method trace code only\"),\n clEnumVal(paths , \"Insert path profiling instrumentation\"),\n clEnumVal(print , \"Print working method to stderr\"),\n clEnumVal(verify , \"Verify module is well formed\"),\n0);\n\n\n\nint main(int argc, char **argv) {\n cl::ParseCommandLineOptions(argc, argv,\n\t\t\t \" llvm .bc -> .bc modular optimizer\\n\");\n\n \/\/ Load the input module...\n std::auto_ptr<Module> M(ParseBytecodeFile(InputFilename));\n if (M.get() == 0) {\n cerr << \"bytecode didn't read correctly.\\n\";\n return 1;\n }\n\n \/\/ Figure out what stream we are supposed to write to...\n std::ostream *Out = &std::cout; \/\/ Default to printing to stdout...\n if (OutputFilename != \"\") {\n if (!Force && std::ifstream(OutputFilename.c_str())) {\n \/\/ If force is not specified, make sure not to overwrite a file!\n cerr << \"Error opening '\" << OutputFilename << \"': File exists!\\n\"\n << \"Use -f command line argument to force output\\n\";\n return 1;\n }\n Out = new std::ofstream(OutputFilename.c_str());\n\n if (!Out->good()) {\n cerr << \"Error opening \" << OutputFilename << \"!\\n\";\n return 1;\n }\n }\n\n \/\/ Create a PassManager to hold and optimize the collection of passes we are\n \/\/ about to build...\n \/\/\n PassManager Passes;\n\n \/\/ Create a new optimization pass for each one specified on the command line\n for (unsigned i = 0; i < OptimizationList.size(); ++i) {\n enum Opts Opt = OptimizationList[i];\n for (unsigned j = 0; j < sizeof(OptTable)\/sizeof(OptTable[0]); ++j)\n if (Opt == OptTable[j].OptID) {\n Passes.add(OptTable[j].PassCtor());\n break;\n }\n\n if (PrintEachXForm)\n Passes.add(new PrintModulePass(&std::cerr));\n }\n\n \/\/ Check that the module is well formed on completion of optimization\n Passes.add(createVerifierPass());\n\n \/\/ Write bytecode out to disk or cout as the last step...\n Passes.add(new WriteBytecodePass(Out, Out != &std::cout));\n\n \/\/ Now that we have all of the passes ready, run them.\n if (Passes.run(M.get()) && !Quiet)\n cerr << \"Program modified.\\n\";\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2003-2005 Max Howell <max.howell@methylblue.com>\n Copyright (c) 2007-2009 Mark Kretschmann <kretschmann@kde.org>\n Copyright (c) 2010 Kevin Funk <krf@electrostorm.net>\n Copyright (c) 2011 Harald Sitter <sitter@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"debug.h\"\n#include \"debug_p.h\"\n\n#include <QtCore\/QMutex>\n#include <QtCore\/QObject>\n#include <QtGui\/QApplication>\n\n#include <iostream>b\n#include <unistd.h>\n\n\/\/ Define Application wide prefix\n#ifndef APP_PREFIX\n#define APP_PREFIX QLatin1String( \"PHONON-GST\" )\n#endif\n\n#define DEBUG_INDENT_OBJECTNAME QLatin1String(\"Debug_Indent_object\")\n\nQMutex Debug::mutex( QMutex::Recursive );\n\nusing namespace Debug;\n\nstatic bool s_debugEnabled = true;\nstatic bool s_debugColorsEnabled = true;\n\nIndentPrivate::IndentPrivate(QObject* parent)\n : QObject(parent)\n{\n setObjectName( DEBUG_INDENT_OBJECTNAME );\n}\n\n\/**\n * We can't use a statically instantiated QString for the indent, because\n * static namespaces are unique to each dlopened library. So we piggy back\n * the QString on the KApplication instance\n *\/\nIndentPrivate* IndentPrivate::instance()\n{\n QObject* qOApp = reinterpret_cast<QObject*>(qApp);\n QObject* obj = qOApp ? qOApp->findChild<QObject*>( DEBUG_INDENT_OBJECTNAME ) : 0;\n return (obj ? static_cast<IndentPrivate*>( obj ) : new IndentPrivate( qApp ));\n}\n\n\/*\n Text color codes (use last digit here)\n 30=black 31=red 32=green 33=yellow 34=blue 35=magenta 36=cyan 37=white\n*\/\nstatic int s_colors[] = { 1, 2, 4, 5, 6 }; \/\/ no yellow and white for sanity\nstatic int s_colorIndex = 0;\n\nstatic QString toString( DebugLevel level )\n{\n switch( level )\n {\n case KDEBUG_WARN:\n return \"[WARNING]\";\n case KDEBUG_ERROR:\n return \"[ERROR__]\";\n case KDEBUG_FATAL:\n return \"[FATAL__]\";\n default:\n return QString();\n }\n}\n\nstatic int toColor( DebugLevel level )\n{\n switch( level ) {\n case KDEBUG_WARN:\n return 3; \/\/ red\n case KDEBUG_ERROR:\n case KDEBUG_FATAL:\n return 1; \/\/ yellow\n default:\n return 0; \/\/ default: black\n }\n}\n\nstatic QString colorize( const QString &text, int color = s_colorIndex )\n{\n if( !debugColorEnabled() )\n return text;\n\n return QString( \"\\x1b[00;3%1m%2\\x1b[00;39m\" ).arg( QString::number(s_colors[color]), text );\n}\n\nstatic QString reverseColorize( const QString &text, int color )\n{\n if( !debugColorEnabled() )\n return text;\n\n return QString( \"\\x1b[07;3%1m%2\\x1b[00;39m\" ).arg( QString::number(color), text );\n}\n\nQString Debug::indent()\n{\n return IndentPrivate::instance()->m_string;\n}\n\nbool Debug::debugEnabled()\n{\n return s_debugEnabled;\n}\n\nbool Debug::debugColorEnabled()\n{\n return s_debugColorsEnabled;\n}\n\nvoid Debug::setDebugEnabled( bool enable )\n{\n s_debugEnabled = enable;\n}\n\nvoid Debug::setColoredDebug( bool enable )\n{\n s_debugColorsEnabled = enable;\n}\n\nQDebug Debug::dbgstream( DebugLevel level )\n{\n#ifdef __GNUC__\n#warning FIXME\n#endif\n\/\/ if( !debugEnabled() )\n\/\/ return kDebugDevNull();\n\n mutex.lock();\n const QString currentIndent = indent();\n mutex.unlock();\n\n QString text = QString(\"%1%2\").arg( APP_PREFIX ).arg( currentIndent );\n if ( level > KDEBUG_INFO )\n text.append( ' ' + reverseColorize( toString(level), toColor( level ) ) );\n\n return QDebug( QtDebugMsg ) << qPrintable( text );\n}\n\nvoid Debug::perfLog( const QString &message, const QString &func )\n{\n#ifdef Q_OS_UNIX\n if( !debugEnabled() )\n return;\n\n QString str = QString( \"MARK: %1: %2 %3\" ).arg( qApp->applicationName(), func, message );\n access( str.toLocal8Bit().data(), F_OK );\n#endif\n}\n\nBlock::Block( const char *label )\n : m_label( label )\n , m_color( s_colorIndex )\n{\n if( !debugEnabled() )\n return;\n\n#if QT_VERSION >= 0x040700\n m_startTime.start();\n#else\n m_startTime = QTime::currentTime();\n#endif\n\n mutex.lock();\n s_colorIndex = (s_colorIndex + 1) % 5;\n dbgstream()\n << qPrintable( colorize( QLatin1String( \"BEGIN:\" ), m_color ) )\n << m_label;\n IndentPrivate::instance()->m_string += QLatin1String(\" \");\n mutex.unlock();\n}\n\nBlock::~Block()\n{\n if( !debugEnabled() )\n return;\n\n#if QT_VERSION >= 0x040700\n const double duration = m_startTime.elapsed() \/ 1000.0;\n#else\n const double duration = (double)m_startTime.msecsTo( QTime::currentTime() ) \/ 1000.0;\n#endif\n\n mutex.lock();\n IndentPrivate::instance()->m_string.truncate( Debug::indent().length() - 2 );\n mutex.unlock();\n\n \/\/ Print timing information, and a special message (DELAY) if the method took longer than 5s\n if( duration < 5.0 )\n {\n dbgstream()\n << qPrintable( colorize( QLatin1String( \"END__:\" ), m_color ) )\n << m_label\n << qPrintable( colorize( QString( \"[Took: %3s]\")\n .arg( QString::number(duration, 'g', 2) ), m_color ) );\n }\n else\n {\n dbgstream()\n << qPrintable( colorize( QString( \"END__:\" ), m_color ) )\n << m_label\n << qPrintable( reverseColorize( QString( \"[DELAY Took (quite long) %3s]\")\n .arg( QString::number(duration, 'g', 2) ), toColor( KDEBUG_WARN ) ) );\n }\n}\n\nvoid Debug::stamp()\n{\n static int n = 0;\n debug() << \"| Stamp: \" << ++n << endl;\n}\n<commit_msg>warning--<commit_after>\/*\n Copyright (c) 2003-2005 Max Howell <max.howell@methylblue.com>\n Copyright (c) 2007-2009 Mark Kretschmann <kretschmann@kde.org>\n Copyright (c) 2010 Kevin Funk <krf@electrostorm.net>\n Copyright (c) 2011 Harald Sitter <sitter@kde.org>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"debug.h\"\n#include \"debug_p.h\"\n\n#include <QtCore\/QMutex>\n#include <QtCore\/QObject>\n#include <QtGui\/QApplication>\n\n#include <iostream>\n#include <unistd.h>\n\n\/\/ Define Application wide prefix\n#ifndef APP_PREFIX\n#define APP_PREFIX QLatin1String( \"PHONON-GST\" )\n#endif\n\n#define DEBUG_INDENT_OBJECTNAME QLatin1String(\"Debug_Indent_object\")\n\nQMutex Debug::mutex( QMutex::Recursive );\n\nusing namespace Debug;\n\nstatic bool s_debugEnabled = true;\nstatic bool s_debugColorsEnabled = true;\n\nIndentPrivate::IndentPrivate(QObject* parent)\n : QObject(parent)\n{\n setObjectName( DEBUG_INDENT_OBJECTNAME );\n}\n\n\/**\n * We can't use a statically instantiated QString for the indent, because\n * static namespaces are unique to each dlopened library. So we piggy back\n * the QString on the KApplication instance\n *\/\nIndentPrivate* IndentPrivate::instance()\n{\n QObject* qOApp = reinterpret_cast<QObject*>(qApp);\n QObject* obj = qOApp ? qOApp->findChild<QObject*>( DEBUG_INDENT_OBJECTNAME ) : 0;\n return (obj ? static_cast<IndentPrivate*>( obj ) : new IndentPrivate( qApp ));\n}\n\n\/*\n Text color codes (use last digit here)\n 30=black 31=red 32=green 33=yellow 34=blue 35=magenta 36=cyan 37=white\n*\/\nstatic int s_colors[] = { 1, 2, 4, 5, 6 }; \/\/ no yellow and white for sanity\nstatic int s_colorIndex = 0;\n\nstatic QString toString( DebugLevel level )\n{\n switch( level )\n {\n case KDEBUG_WARN:\n return \"[WARNING]\";\n case KDEBUG_ERROR:\n return \"[ERROR__]\";\n case KDEBUG_FATAL:\n return \"[FATAL__]\";\n default:\n return QString();\n }\n}\n\nstatic int toColor( DebugLevel level )\n{\n switch( level ) {\n case KDEBUG_WARN:\n return 3; \/\/ red\n case KDEBUG_ERROR:\n case KDEBUG_FATAL:\n return 1; \/\/ yellow\n default:\n return 0; \/\/ default: black\n }\n}\n\nstatic QString colorize( const QString &text, int color = s_colorIndex )\n{\n if( !debugColorEnabled() )\n return text;\n\n return QString( \"\\x1b[00;3%1m%2\\x1b[00;39m\" ).arg( QString::number(s_colors[color]), text );\n}\n\nstatic QString reverseColorize( const QString &text, int color )\n{\n if( !debugColorEnabled() )\n return text;\n\n return QString( \"\\x1b[07;3%1m%2\\x1b[00;39m\" ).arg( QString::number(color), text );\n}\n\nQString Debug::indent()\n{\n return IndentPrivate::instance()->m_string;\n}\n\nbool Debug::debugEnabled()\n{\n return s_debugEnabled;\n}\n\nbool Debug::debugColorEnabled()\n{\n return s_debugColorsEnabled;\n}\n\nvoid Debug::setDebugEnabled( bool enable )\n{\n s_debugEnabled = enable;\n}\n\nvoid Debug::setColoredDebug( bool enable )\n{\n s_debugColorsEnabled = enable;\n}\n\nQDebug Debug::dbgstream( DebugLevel level )\n{\n#ifdef __GNUC__\n#warning FIXME\n#endif\n\/\/ if( !debugEnabled() )\n\/\/ return kDebugDevNull();\n\n mutex.lock();\n const QString currentIndent = indent();\n mutex.unlock();\n\n QString text = QString(\"%1%2\").arg( APP_PREFIX ).arg( currentIndent );\n if ( level > KDEBUG_INFO )\n text.append( ' ' + reverseColorize( toString(level), toColor( level ) ) );\n\n return QDebug( QtDebugMsg ) << qPrintable( text );\n}\n\nvoid Debug::perfLog( const QString &message, const QString &func )\n{\n#ifdef Q_OS_UNIX\n if( !debugEnabled() )\n return;\n\n QString str = QString( \"MARK: %1: %2 %3\" ).arg( qApp->applicationName(), func, message );\n access( str.toLocal8Bit().data(), F_OK );\n#endif\n}\n\nBlock::Block( const char *label )\n : m_label( label )\n , m_color( s_colorIndex )\n{\n if( !debugEnabled() )\n return;\n\n#if QT_VERSION >= 0x040700\n m_startTime.start();\n#else\n m_startTime = QTime::currentTime();\n#endif\n\n mutex.lock();\n s_colorIndex = (s_colorIndex + 1) % 5;\n dbgstream()\n << qPrintable( colorize( QLatin1String( \"BEGIN:\" ), m_color ) )\n << m_label;\n IndentPrivate::instance()->m_string += QLatin1String(\" \");\n mutex.unlock();\n}\n\nBlock::~Block()\n{\n if( !debugEnabled() )\n return;\n\n#if QT_VERSION >= 0x040700\n const double duration = m_startTime.elapsed() \/ 1000.0;\n#else\n const double duration = (double)m_startTime.msecsTo( QTime::currentTime() ) \/ 1000.0;\n#endif\n\n mutex.lock();\n IndentPrivate::instance()->m_string.truncate( Debug::indent().length() - 2 );\n mutex.unlock();\n\n \/\/ Print timing information, and a special message (DELAY) if the method took longer than 5s\n if( duration < 5.0 )\n {\n dbgstream()\n << qPrintable( colorize( QLatin1String( \"END__:\" ), m_color ) )\n << m_label\n << qPrintable( colorize( QString( \"[Took: %3s]\")\n .arg( QString::number(duration, 'g', 2) ), m_color ) );\n }\n else\n {\n dbgstream()\n << qPrintable( colorize( QString( \"END__:\" ), m_color ) )\n << m_label\n << qPrintable( reverseColorize( QString( \"[DELAY Took (quite long) %3s]\")\n .arg( QString::number(duration, 'g', 2) ), toColor( KDEBUG_WARN ) ) );\n }\n}\n\nvoid Debug::stamp()\n{\n static int n = 0;\n debug() << \"| Stamp: \" << ++n << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: b2dhommatrix.cxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: obo $ $Date: 2006-07-13 09:56:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n\n#ifndef _BGFX_MATRIX_B2DHOMMATRIX_HXX\n#include <basegfx\/matrix\/b2dhommatrix.hxx>\n#endif\n\n#ifndef _HOMMATRIX_TEMPLATE_HXX\n#include <hommatrixtemplate.hxx>\n#endif\n\n#ifndef _BGFX_MATRIX_B3DHOMMATRIX_HXX\n#include <basegfx\/matrix\/b3dhommatrix.hxx>\n#endif\n\n#ifndef _BGFX_TUPLE_B3DTUPLE_HXX\n#include <basegfx\/tuple\/b3dtuple.hxx>\n#endif\n\n#ifndef _BGFX_TUPLE_B2DTUPLE_HXX\n#include <basegfx\/tuple\/b2dtuple.hxx>\n#endif\n\n#ifndef _BGFX_VECTOR_B2DVECTOR_HXX\n#include <basegfx\/vector\/b2dvector.hxx>\n#endif\n\nnamespace basegfx\n{\n class Impl2DHomMatrix : public ::basegfx::internal::ImplHomMatrixTemplate< 3 >\n {\n };\n\n namespace { struct IdentityMatrix : public rtl::Static< B2DHomMatrix::ImplType,\n IdentityMatrix > {}; }\n\n B2DHomMatrix::B2DHomMatrix() :\n mpImpl( IdentityMatrix::get() ) \/\/ use common identity matrix\n {\n }\n\n B2DHomMatrix::B2DHomMatrix(const B2DHomMatrix& rMat) :\n mpImpl(rMat.mpImpl)\n {\n }\n\n B2DHomMatrix::~B2DHomMatrix()\n {\n }\n\n B2DHomMatrix& B2DHomMatrix::operator=(const B2DHomMatrix& rMat)\n {\n mpImpl = rMat.mpImpl;\n return *this;\n }\n\n void B2DHomMatrix::makeUnique()\n {\n mpImpl.make_unique();\n }\n\n double B2DHomMatrix::get(sal_uInt16 nRow, sal_uInt16 nColumn) const\n {\n return mpImpl->get(nRow, nColumn);\n }\n\n void B2DHomMatrix::set(sal_uInt16 nRow, sal_uInt16 nColumn, double fValue)\n {\n mpImpl->set(nRow, nColumn, fValue);\n }\n\n bool B2DHomMatrix::isLastLineDefault() const\n {\n return mpImpl->isLastLineDefault();\n }\n\n bool B2DHomMatrix::isIdentity() const\n {\n if(mpImpl.same_object(IdentityMatrix::get()))\n return true;\n\n return mpImpl->isIdentity();\n }\n\n void B2DHomMatrix::identity()\n {\n mpImpl = IdentityMatrix::get();\n }\n\n bool B2DHomMatrix::isInvertible() const\n {\n return mpImpl->isInvertible();\n }\n\n bool B2DHomMatrix::invert()\n {\n Impl2DHomMatrix aWork(*mpImpl);\n sal_uInt16* pIndex = new sal_uInt16[mpImpl->getEdgeLength()];\n sal_Int16 nParity;\n\n if(aWork.ludcmp(pIndex, nParity))\n {\n mpImpl->doInvert(aWork, pIndex);\n delete[] pIndex;\n\n return true;\n }\n\n delete[] pIndex;\n return false;\n }\n\n bool B2DHomMatrix::isNormalized() const\n {\n return mpImpl->isNormalized();\n }\n\n void B2DHomMatrix::normalize()\n {\n if(!const_cast<const B2DHomMatrix*>(this)->mpImpl->isNormalized())\n mpImpl->doNormalize();\n }\n\n double B2DHomMatrix::determinant() const\n {\n return mpImpl->doDeterminant();\n }\n\n double B2DHomMatrix::trace() const\n {\n return mpImpl->doTrace();\n }\n\n void B2DHomMatrix::transpose()\n {\n mpImpl->doTranspose();\n }\n\n B2DHomMatrix& B2DHomMatrix::operator+=(const B2DHomMatrix& rMat)\n {\n mpImpl->doAddMatrix(*rMat.mpImpl);\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator-=(const B2DHomMatrix& rMat)\n {\n mpImpl->doSubMatrix(*rMat.mpImpl);\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator*=(double fValue)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fValue))\n mpImpl->doMulMatrix(fValue);\n\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator\/=(double fValue)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fValue))\n mpImpl->doMulMatrix(1.0 \/ fValue);\n\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator*=(const B2DHomMatrix& rMat)\n {\n if(!rMat.isIdentity())\n mpImpl->doMulMatrix(*rMat.mpImpl);\n\n return *this;\n }\n\n bool B2DHomMatrix::operator==(const B2DHomMatrix& rMat) const\n {\n if(mpImpl.same_object(rMat.mpImpl))\n return true;\n\n return mpImpl->isEqual(*rMat.mpImpl);\n }\n\n bool B2DHomMatrix::operator!=(const B2DHomMatrix& rMat) const\n {\n return !(*this == rMat);\n }\n\n void B2DHomMatrix::rotate(double fRadiant)\n {\n if(!fTools::equalZero(fRadiant))\n {\n double fSin;\n double fCos;\n\n \/\/ is the rotation angle an approximate multiple of pi\/2?\n \/\/ If yes, force fSin\/fCos to -1\/0\/1, to maintain\n \/\/ orthogonality (which might also be advantageous for the\n \/\/ other cases, but: for multiples of pi\/2, the exact\n \/\/ values _can_ be attained. It would be largely\n \/\/ unintuitive, if a 180 degrees rotation would introduce\n \/\/ slight roundoff errors, instead of exactly mirroring\n \/\/ the coordinate system).\n if( fTools::equalZero( fmod( fRadiant, F_PI2 ) ) )\n {\n \/\/ determine quadrant\n const sal_Int32 nQuad(\n (4 + fround( 4\/F_2PI*fmod( fRadiant, F_2PI ) )) % 4 );\n switch( nQuad )\n {\n case 0: \/\/ -2pi,0,2pi\n fSin = 0.0;\n fCos = 1.0;\n break;\n\n case 1: \/\/ -3\/2pi,1\/2pi\n fSin = 1.0;\n fCos = 0.0;\n break;\n\n case 2: \/\/ -pi,pi\n fSin = 0.0;\n fCos = -1.0;\n break;\n\n case 3: \/\/ -1\/2pi,3\/2pi\n fSin = -1.0;\n fCos = 0.0;\n break;\n\n default:\n OSL_ENSURE( false,\n \"B2DHomMatrix::rotate(): Impossible case reached\" );\n }\n }\n else\n {\n \/\/ TODO(P1): Maybe use glibc's sincos here (though\n \/\/ that's kinda non-portable...)\n fSin = sin(fRadiant);\n fCos = cos(fRadiant);\n }\n\n Impl2DHomMatrix aRotMat;\n\n aRotMat.set(0, 0, fCos);\n aRotMat.set(1, 1, fCos);\n aRotMat.set(1, 0, fSin);\n aRotMat.set(0, 1, -fSin);\n\n mpImpl->doMulMatrix(aRotMat);\n }\n }\n\n void B2DHomMatrix::translate(double fX, double fY)\n {\n if(!fTools::equalZero(fX) || !fTools::equalZero(fY))\n {\n Impl2DHomMatrix aTransMat;\n\n aTransMat.set(0, 2, fX);\n aTransMat.set(1, 2, fY);\n\n mpImpl->doMulMatrix(aTransMat);\n }\n }\n\n void B2DHomMatrix::scale(double fX, double fY)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fX) || !fTools::equal(fOne, fY))\n {\n Impl2DHomMatrix aScaleMat;\n\n aScaleMat.set(0, 0, fX);\n aScaleMat.set(1, 1, fY);\n\n mpImpl->doMulMatrix(aScaleMat);\n }\n }\n\n void B2DHomMatrix::shearX(double fSx)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fSx))\n {\n Impl2DHomMatrix aShearXMat;\n\n aShearXMat.set(0, 1, fSx);\n\n mpImpl->doMulMatrix(aShearXMat);\n }\n }\n\n void B2DHomMatrix::shearY(double fSy)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fSy))\n {\n Impl2DHomMatrix aShearYMat;\n\n aShearYMat.set(1, 0, fSy);\n\n mpImpl->doMulMatrix(aShearYMat);\n }\n }\n\n \/\/ Decomposition\n bool B2DHomMatrix::decompose(B2DTuple& rScale, B2DTuple& rTranslate, double& rRotate, double& rShearX) const\n {\n \/\/ when perspective is used, decompose is not made here\n if(!mpImpl->isLastLineDefault())\n return false;\n\n \/\/ test for rotation and shear\n if(fTools::equalZero(get(0, 1)) && fTools::equalZero(get(1, 0)))\n {\n \/\/ no rotation and shear, direct value extraction\n rRotate = rShearX = 0.0;\n\n \/\/ copy scale values\n rScale.setX(get(0, 0));\n rScale.setY(get(1, 1));\n\n \/\/ copy translation values\n rTranslate.setX(get(0, 2));\n rTranslate.setY(get(1, 2));\n\n return true;\n }\n else\n {\n \/\/ test if shear is zero. That's the case, if the unit vectors in the matrix\n \/\/ are perpendicular -> scalar is zero\n const ::basegfx::B2DVector aUnitVecX(get(0, 0), get(1, 0));\n const ::basegfx::B2DVector aUnitVecY(get(0, 1), get(1, 1));\n\n if(fTools::equalZero(aUnitVecX.scalar(aUnitVecY)))\n {\n \/\/ calculate rotation\n rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());\n\n \/\/ calculate scale values\n rScale.setX(aUnitVecX.getLength());\n rScale.setY(aUnitVecY.getLength());\n\n \/\/ copy translation values\n rTranslate.setX(get(0, 2));\n rTranslate.setY(get(1, 2));\n\n return true;\n }\n else\n {\n \/\/ If determinant is zero, decomposition is not possible\n if(0.0 == determinant())\n return false;\n\n \/\/ copy 2x2 matrix and translate vector to 3x3 matrix\n ::basegfx::B3DHomMatrix a3DHomMat;\n\n a3DHomMat.set(0, 0, get(0, 0));\n a3DHomMat.set(0, 1, get(0, 1));\n a3DHomMat.set(1, 0, get(1, 0));\n a3DHomMat.set(1, 1, get(1, 1));\n a3DHomMat.set(0, 3, get(0, 2));\n a3DHomMat.set(1, 3, get(1, 2));\n\n ::basegfx::B3DTuple r3DScale, r3DTranslate, r3DRotate, r3DShear;\n\n if(a3DHomMat.decompose(r3DScale, r3DTranslate, r3DRotate, r3DShear))\n {\n \/\/ copy scale values\n rScale.setX(r3DScale.getX());\n rScale.setY(r3DScale.getY());\n\n \/\/ copy shear\n rShearX = r3DShear.getX();\n\n \/\/ copy rotate\n rRotate = r3DRotate.getZ();\n\n \/\/ copy translate\n rTranslate.setX(r3DTranslate.getX());\n rTranslate.setY(r3DTranslate.getY());\n\n return true;\n }\n }\n }\n\n return false;\n }\n} \/\/ end of namespace basegfx\n\n\/\/ eof\n<commit_msg>INTEGRATION: CWS pchfix02 (1.12.10); FILE MERGED 2006\/09\/01 17:16:34 kaib 1.12.10.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: b2dhommatrix.cxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 07:58:56 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_basegfx.hxx\"\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef INCLUDED_RTL_INSTANCE_HXX\n#include <rtl\/instance.hxx>\n#endif\n\n#ifndef _BGFX_MATRIX_B2DHOMMATRIX_HXX\n#include <basegfx\/matrix\/b2dhommatrix.hxx>\n#endif\n\n#ifndef _HOMMATRIX_TEMPLATE_HXX\n#include <hommatrixtemplate.hxx>\n#endif\n\n#ifndef _BGFX_MATRIX_B3DHOMMATRIX_HXX\n#include <basegfx\/matrix\/b3dhommatrix.hxx>\n#endif\n\n#ifndef _BGFX_TUPLE_B3DTUPLE_HXX\n#include <basegfx\/tuple\/b3dtuple.hxx>\n#endif\n\n#ifndef _BGFX_TUPLE_B2DTUPLE_HXX\n#include <basegfx\/tuple\/b2dtuple.hxx>\n#endif\n\n#ifndef _BGFX_VECTOR_B2DVECTOR_HXX\n#include <basegfx\/vector\/b2dvector.hxx>\n#endif\n\nnamespace basegfx\n{\n class Impl2DHomMatrix : public ::basegfx::internal::ImplHomMatrixTemplate< 3 >\n {\n };\n\n namespace { struct IdentityMatrix : public rtl::Static< B2DHomMatrix::ImplType,\n IdentityMatrix > {}; }\n\n B2DHomMatrix::B2DHomMatrix() :\n mpImpl( IdentityMatrix::get() ) \/\/ use common identity matrix\n {\n }\n\n B2DHomMatrix::B2DHomMatrix(const B2DHomMatrix& rMat) :\n mpImpl(rMat.mpImpl)\n {\n }\n\n B2DHomMatrix::~B2DHomMatrix()\n {\n }\n\n B2DHomMatrix& B2DHomMatrix::operator=(const B2DHomMatrix& rMat)\n {\n mpImpl = rMat.mpImpl;\n return *this;\n }\n\n void B2DHomMatrix::makeUnique()\n {\n mpImpl.make_unique();\n }\n\n double B2DHomMatrix::get(sal_uInt16 nRow, sal_uInt16 nColumn) const\n {\n return mpImpl->get(nRow, nColumn);\n }\n\n void B2DHomMatrix::set(sal_uInt16 nRow, sal_uInt16 nColumn, double fValue)\n {\n mpImpl->set(nRow, nColumn, fValue);\n }\n\n bool B2DHomMatrix::isLastLineDefault() const\n {\n return mpImpl->isLastLineDefault();\n }\n\n bool B2DHomMatrix::isIdentity() const\n {\n if(mpImpl.same_object(IdentityMatrix::get()))\n return true;\n\n return mpImpl->isIdentity();\n }\n\n void B2DHomMatrix::identity()\n {\n mpImpl = IdentityMatrix::get();\n }\n\n bool B2DHomMatrix::isInvertible() const\n {\n return mpImpl->isInvertible();\n }\n\n bool B2DHomMatrix::invert()\n {\n Impl2DHomMatrix aWork(*mpImpl);\n sal_uInt16* pIndex = new sal_uInt16[mpImpl->getEdgeLength()];\n sal_Int16 nParity;\n\n if(aWork.ludcmp(pIndex, nParity))\n {\n mpImpl->doInvert(aWork, pIndex);\n delete[] pIndex;\n\n return true;\n }\n\n delete[] pIndex;\n return false;\n }\n\n bool B2DHomMatrix::isNormalized() const\n {\n return mpImpl->isNormalized();\n }\n\n void B2DHomMatrix::normalize()\n {\n if(!const_cast<const B2DHomMatrix*>(this)->mpImpl->isNormalized())\n mpImpl->doNormalize();\n }\n\n double B2DHomMatrix::determinant() const\n {\n return mpImpl->doDeterminant();\n }\n\n double B2DHomMatrix::trace() const\n {\n return mpImpl->doTrace();\n }\n\n void B2DHomMatrix::transpose()\n {\n mpImpl->doTranspose();\n }\n\n B2DHomMatrix& B2DHomMatrix::operator+=(const B2DHomMatrix& rMat)\n {\n mpImpl->doAddMatrix(*rMat.mpImpl);\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator-=(const B2DHomMatrix& rMat)\n {\n mpImpl->doSubMatrix(*rMat.mpImpl);\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator*=(double fValue)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fValue))\n mpImpl->doMulMatrix(fValue);\n\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator\/=(double fValue)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fValue))\n mpImpl->doMulMatrix(1.0 \/ fValue);\n\n return *this;\n }\n\n B2DHomMatrix& B2DHomMatrix::operator*=(const B2DHomMatrix& rMat)\n {\n if(!rMat.isIdentity())\n mpImpl->doMulMatrix(*rMat.mpImpl);\n\n return *this;\n }\n\n bool B2DHomMatrix::operator==(const B2DHomMatrix& rMat) const\n {\n if(mpImpl.same_object(rMat.mpImpl))\n return true;\n\n return mpImpl->isEqual(*rMat.mpImpl);\n }\n\n bool B2DHomMatrix::operator!=(const B2DHomMatrix& rMat) const\n {\n return !(*this == rMat);\n }\n\n void B2DHomMatrix::rotate(double fRadiant)\n {\n if(!fTools::equalZero(fRadiant))\n {\n double fSin;\n double fCos;\n\n \/\/ is the rotation angle an approximate multiple of pi\/2?\n \/\/ If yes, force fSin\/fCos to -1\/0\/1, to maintain\n \/\/ orthogonality (which might also be advantageous for the\n \/\/ other cases, but: for multiples of pi\/2, the exact\n \/\/ values _can_ be attained. It would be largely\n \/\/ unintuitive, if a 180 degrees rotation would introduce\n \/\/ slight roundoff errors, instead of exactly mirroring\n \/\/ the coordinate system).\n if( fTools::equalZero( fmod( fRadiant, F_PI2 ) ) )\n {\n \/\/ determine quadrant\n const sal_Int32 nQuad(\n (4 + fround( 4\/F_2PI*fmod( fRadiant, F_2PI ) )) % 4 );\n switch( nQuad )\n {\n case 0: \/\/ -2pi,0,2pi\n fSin = 0.0;\n fCos = 1.0;\n break;\n\n case 1: \/\/ -3\/2pi,1\/2pi\n fSin = 1.0;\n fCos = 0.0;\n break;\n\n case 2: \/\/ -pi,pi\n fSin = 0.0;\n fCos = -1.0;\n break;\n\n case 3: \/\/ -1\/2pi,3\/2pi\n fSin = -1.0;\n fCos = 0.0;\n break;\n\n default:\n OSL_ENSURE( false,\n \"B2DHomMatrix::rotate(): Impossible case reached\" );\n }\n }\n else\n {\n \/\/ TODO(P1): Maybe use glibc's sincos here (though\n \/\/ that's kinda non-portable...)\n fSin = sin(fRadiant);\n fCos = cos(fRadiant);\n }\n\n Impl2DHomMatrix aRotMat;\n\n aRotMat.set(0, 0, fCos);\n aRotMat.set(1, 1, fCos);\n aRotMat.set(1, 0, fSin);\n aRotMat.set(0, 1, -fSin);\n\n mpImpl->doMulMatrix(aRotMat);\n }\n }\n\n void B2DHomMatrix::translate(double fX, double fY)\n {\n if(!fTools::equalZero(fX) || !fTools::equalZero(fY))\n {\n Impl2DHomMatrix aTransMat;\n\n aTransMat.set(0, 2, fX);\n aTransMat.set(1, 2, fY);\n\n mpImpl->doMulMatrix(aTransMat);\n }\n }\n\n void B2DHomMatrix::scale(double fX, double fY)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fX) || !fTools::equal(fOne, fY))\n {\n Impl2DHomMatrix aScaleMat;\n\n aScaleMat.set(0, 0, fX);\n aScaleMat.set(1, 1, fY);\n\n mpImpl->doMulMatrix(aScaleMat);\n }\n }\n\n void B2DHomMatrix::shearX(double fSx)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fSx))\n {\n Impl2DHomMatrix aShearXMat;\n\n aShearXMat.set(0, 1, fSx);\n\n mpImpl->doMulMatrix(aShearXMat);\n }\n }\n\n void B2DHomMatrix::shearY(double fSy)\n {\n const double fOne(1.0);\n\n if(!fTools::equal(fOne, fSy))\n {\n Impl2DHomMatrix aShearYMat;\n\n aShearYMat.set(1, 0, fSy);\n\n mpImpl->doMulMatrix(aShearYMat);\n }\n }\n\n \/\/ Decomposition\n bool B2DHomMatrix::decompose(B2DTuple& rScale, B2DTuple& rTranslate, double& rRotate, double& rShearX) const\n {\n \/\/ when perspective is used, decompose is not made here\n if(!mpImpl->isLastLineDefault())\n return false;\n\n \/\/ test for rotation and shear\n if(fTools::equalZero(get(0, 1)) && fTools::equalZero(get(1, 0)))\n {\n \/\/ no rotation and shear, direct value extraction\n rRotate = rShearX = 0.0;\n\n \/\/ copy scale values\n rScale.setX(get(0, 0));\n rScale.setY(get(1, 1));\n\n \/\/ copy translation values\n rTranslate.setX(get(0, 2));\n rTranslate.setY(get(1, 2));\n\n return true;\n }\n else\n {\n \/\/ test if shear is zero. That's the case, if the unit vectors in the matrix\n \/\/ are perpendicular -> scalar is zero\n const ::basegfx::B2DVector aUnitVecX(get(0, 0), get(1, 0));\n const ::basegfx::B2DVector aUnitVecY(get(0, 1), get(1, 1));\n\n if(fTools::equalZero(aUnitVecX.scalar(aUnitVecY)))\n {\n \/\/ calculate rotation\n rRotate = atan2(aUnitVecX.getY(), aUnitVecX.getX());\n\n \/\/ calculate scale values\n rScale.setX(aUnitVecX.getLength());\n rScale.setY(aUnitVecY.getLength());\n\n \/\/ copy translation values\n rTranslate.setX(get(0, 2));\n rTranslate.setY(get(1, 2));\n\n return true;\n }\n else\n {\n \/\/ If determinant is zero, decomposition is not possible\n if(0.0 == determinant())\n return false;\n\n \/\/ copy 2x2 matrix and translate vector to 3x3 matrix\n ::basegfx::B3DHomMatrix a3DHomMat;\n\n a3DHomMat.set(0, 0, get(0, 0));\n a3DHomMat.set(0, 1, get(0, 1));\n a3DHomMat.set(1, 0, get(1, 0));\n a3DHomMat.set(1, 1, get(1, 1));\n a3DHomMat.set(0, 3, get(0, 2));\n a3DHomMat.set(1, 3, get(1, 2));\n\n ::basegfx::B3DTuple r3DScale, r3DTranslate, r3DRotate, r3DShear;\n\n if(a3DHomMat.decompose(r3DScale, r3DTranslate, r3DRotate, r3DShear))\n {\n \/\/ copy scale values\n rScale.setX(r3DScale.getX());\n rScale.setY(r3DScale.getY());\n\n \/\/ copy shear\n rShearX = r3DShear.getX();\n\n \/\/ copy rotate\n rRotate = r3DRotate.getZ();\n\n \/\/ copy translate\n rTranslate.setX(r3DTranslate.getX());\n rTranslate.setY(r3DTranslate.getY());\n\n return true;\n }\n }\n }\n\n return false;\n }\n} \/\/ end of namespace basegfx\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtCore module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <string.h>\n\n#include \"qnetworkconfigmanager_p.h\"\n\n#include <QDebug>\n#include <QtDBus>\n#include <QRegExp>\n\n#include <wlancond.h>\n#include <libicd-network-wlan-dev.h>\n#include <maemo_icd.h>\n#include <iapconf.h>\n\n\nQT_BEGIN_NAMESPACE\n\nvoid QNetworkConfigurationManagerPrivate::registerPlatformCapabilities()\n{\n capFlags |= QNetworkConfigurationManager::BearerManagement;\n capFlags |= QNetworkConfigurationManager::DataStatistics;\n capFlags |= QNetworkConfigurationManager::SystemSessionSupport;\n capFlags |= QNetworkConfigurationManager::ForcedRoaming;\n}\n\n\nstatic inline QString network_attrs_to_security(uint network_attrs)\n{\n uint cap;\n nwattr2cap(network_attrs, &cap); \/* from libicd-network-wlan-dev.h *\/\n if (cap & WLANCOND_OPEN)\n\treturn \"NONE\";\n else if (cap & WLANCOND_WEP)\n\treturn \"WEP\";\n else if (cap & WLANCOND_WPA_PSK)\n\treturn \"WPA_PSK\";\n else if (cap & WLANCOND_WPA_EAP)\n\treturn \"WPA_EAP\";\n return \"\";\n}\n\n\nstruct SSIDInfo {\n QString iap_id;\n QString wlan_security;\n};\n\nvoid QNetworkConfigurationManagerPrivate::updateConfigurations()\n{\n \/* Contains known network id (like ssid) from storage *\/\n QMultiHash<QByteArray, SSIDInfo* > knownConfigs;\n\n \/* All the scanned access points *\/\n QList<Maemo::IcdScanResult> scanned;\n\n const QRegExp wlan = QRegExp(\"WLAN.*\");\n\n \/* We return currently configured IAPs in the first run and do the WLAN\n * scan in subsequent runs.\n *\/\n QList<QString> all_iaps;\n Maemo::IAPConf::getAll(all_iaps);\n\n foreach (QString iap_id, all_iaps) {\n\tQByteArray ssid;\n\tMaemo::IAPConf saved_ap(iap_id);\n\tbool is_temporary = saved_ap.value(\"temporary\").toBool();\n\tif (is_temporary) {\n\t qDebug() << \"IAP\" << iap_id << \"is temporary, skipping it.\";\n\t continue;\n\t}\n\n\tQString iap_type = saved_ap.value(\"type\").toString();\n\tif (iap_type.contains(wlan)) {\n\t ssid = saved_ap.value(\"wlan_ssid\").toByteArray();\n\t if (ssid.isEmpty()) {\n\t\tqWarning() << \"Cannot get ssid for\" << iap_id;\n\t\tcontinue;\n\t }\n\n\t QString security_method = saved_ap.value(\"wlan_security\").toString();\n\t SSIDInfo *info = new SSIDInfo;\n\t info->iap_id = iap_id;\n\t info->wlan_security = security_method;\n\t knownConfigs.insert(ssid, info);\n\t} else if (iap_type.isEmpty()) {\n\t qWarning() << \"IAP\" << iap_id << \"network type is not set! Skipping it\";\n\t continue;\n\t} else {\n\t qDebug() << \"IAP\" << iap_id << \"network type is\" << iap_type;\n\t ssid.clear();\n\t}\n\n\tif (!accessPointConfigurations.contains(iap_id)) {\n\t QNetworkConfigurationPrivate* cpPriv = new QNetworkConfigurationPrivate();\n\t \/\/cpPriv->name = iap_info.value().toString();\n\t cpPriv->name = saved_ap.value(\"name\").toString();\n\t if (cpPriv->name.isEmpty())\n\t\tif (ssid.size() > 0)\n\t\t cpPriv->name = ssid.data();\n\t\telse\n\t\t cpPriv->name = iap_id;\n\t cpPriv->isValid = true;\n\t cpPriv->id = iap_id;\n\t cpPriv->network_id = ssid;\n\t cpPriv->iap_type = iap_type;\n\t cpPriv->type = QNetworkConfiguration::InternetAccessPoint;\n\t cpPriv->state = QNetworkConfiguration::Defined;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> ptr(cpPriv);\n\t accessPointConfigurations.insert(iap_id, ptr);\n\n\t qDebug(\"IAP: %s, name: %s, ssid: %s, added to known list\", iap_id.toAscii().data(), cpPriv->name.toAscii().data(), ssid.size() ? ssid.data() : \"-\");\n\t} else {\n\t qDebug(\"IAP: %s, ssid: %s, already exists in the known list\", iap_id.toAscii().data(), ssid.size() ? ssid.data() : \"-\");\n\t}\n }\n\n\n if (!firstUpdate) {\n\tQStringList scannedNetworkTypes;\n\tQStringList networkTypesToScan;\n\tQString error;\n\tMaemo::Icd icd(ICD_SHORT_SCAN_TIMEOUT);\n\n\tscannedNetworkTypes = icd.scan(ICD_SCAN_REQUEST_ACTIVE,\n\t\t\t\t networkTypesToScan,\n\t\t\t\t scanned,\n\t\t\t\t error);\n\tif (!error.isEmpty()) {\n\t qWarning() << \"Network scanning failed.\";\n\t} else {\n\t qDebug() << \"Scan returned\" << scanned.size() << \"networks\";\n\t}\n }\n\n\n \/* This is skipped in the first update as scanned size is zero *\/\n for (int i=0; i<scanned.size(); ++i) {\n\tconst Maemo::IcdScanResult ap = scanned.at(i); \n\n\tif (ap.scan.network_attrs & ICD_NW_ATTR_IAPNAME) {\n\t \/* The network_id is IAP id, so the IAP is a known one *\/\n\t QString iapid = ap.scan.network_id.data();\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> priv = accessPointConfigurations.take(iapid);\n\t if (priv) {\n\t\tpriv->state = QNetworkConfiguration::Discovered; \/* Defined is set automagically *\/\n\t\taccessPointConfigurations.insert(iapid, priv);\n\t\tqDebug(\"IAP: %s, ssid: %s, discovered\", iapid.toAscii().data(), priv->network_id.data());\n\n\t\tif (!ap.scan.network_type.contains(wlan))\n\t\t continue; \/\/ not a wlan AP\n\n\t\t\/* Remove scanned AP from known configurations so that we can\n\t\t * emit configurationRemoved signal later\n\t\t *\/\n\t\tQList<SSIDInfo* > known_iaps = knownConfigs.values(priv->network_id);\n\t rescan_list:\n\t\tfor (int k=0; k<known_iaps.size(); ++k) {\n\t\t SSIDInfo *iap = known_iaps.at(k);\n\t\t if (iap->wlan_security == \n\t\t\tnetwork_attrs_to_security(ap.scan.network_attrs)) {\n\t\t\t\/* Remove IAP from the list *\/\n\t\t\tknownConfigs.remove(priv->network_id, iap);\n\t\t\tqDebug() << \"Removed IAP\" << iap->iap_id << \"from known config\";\n\t\t\tknown_iaps.removeAt(k);\n\t\t\tdelete iap;\n\t\t\tgoto rescan_list;\n\t\t }\n\t\t}\n\t } else {\n\t\tqWarning() << \"IAP\" << iapid << \"is missing!\";\n\t }\n\n\t} else {\n\t \/* Non saved access point data *\/\n\t QByteArray scanned_ssid = ap.scan.network_id;\n\t QNetworkConfigurationPrivate* cpPriv = new QNetworkConfigurationPrivate();\n\t QString hrs = scanned_ssid.data();\n\t cpPriv->name = ap.network_name.isEmpty() ? hrs : ap.network_name;\n\t cpPriv->isValid = true;\n\t cpPriv->id = scanned_ssid.data(); \/\/ Note: id is now ssid, it should be set to IAP id if the IAP is saved\n\t cpPriv->network_id = scanned_ssid;\n\t cpPriv->iap_type = ap.scan.network_type;\n\t cpPriv->type = QNetworkConfiguration::InternetAccessPoint;\n\t cpPriv->state = QNetworkConfiguration::Undefined;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> ptr(cpPriv);\n\t accessPointConfigurations.insert(cpPriv->id, ptr);\n\n\t qDebug() << \"IAP with network id\" << cpPriv->id << \"was found in the scan.\";\n\n\t QNetworkConfiguration item;\n\t item.d = ptr;\n\t emit configurationAdded(item);\n\t}\n }\n\n\n \/* Remove non existing iaps since last update *\/\n if (!firstUpdate) {\n\tQHashIterator<QByteArray, SSIDInfo* > i(knownConfigs);\n\twhile (i.hasNext()) {\n\t i.next();\n\t SSIDInfo *iap = i.value();\n\t QString iap_id = iap->iap_id;\n\t \/\/qDebug() << i.key() << \": \" << iap_id;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> priv = accessPointConfigurations.take(iap_id);\n\t if (priv) {\n\t\tpriv->isValid = false;\n\t\tqDebug() << \"IAP\" << iap_id << \"was removed as it was not found in scan.\";\n\n\t\tQNetworkConfiguration item;\n\t\titem.d = priv;\n\t\temit configurationRemoved(item);\n\n\t\t\/\/if we would have SNAP support we would have to remove the references\n\t\t\/\/from existing ServiceNetworks to the removed access point configuration\n\t }\n\t}\n }\n\n\n QMutableHashIterator<QByteArray, SSIDInfo* > i(knownConfigs);\n while (i.hasNext()) {\n\ti.next();\n\tSSIDInfo *iap = i.value();\n\tdelete iap;\n\ti.remove();\n }\n\n if (firstUpdate)\n firstUpdate = false;\n\n QTimer::singleShot(0, this, SIGNAL(configurationUpdateComplete()));\n}\n\n\nQNetworkConfiguration QNetworkConfigurationManagerPrivate::defaultConfiguration()\n{\n \/* Here we just create a [ANY] request to icd and let the icd decide which\n * AP to connect.\n *\/\n QNetworkConfigurationPrivate *d = new QNetworkConfigurationPrivate; \/\/ TODO: where is this freed?\n if (d) {\n\td->name = OSSO_IAP_ANY;\n\td->id = OSSO_IAP_ANY;\n\td->state = QNetworkConfiguration::Defined;\n\td->type = QNetworkConfiguration::UserChoice;\n\td->roamingSupported = false;\n\td->isValid = true;\n }\n\n QNetworkConfiguration item;\n item.d = d;\n return item;\n}\n\n\nvoid QNetworkConfigurationManagerPrivate::performAsyncConfigurationUpdate()\n{\n QTimer::singleShot(0, this, SLOT(updateConfigurations()));\n}\n\nQT_END_NAMESPACE\n<commit_msg>Debug print fixed.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtCore module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <string.h>\n\n#include \"qnetworkconfigmanager_p.h\"\n\n#include <QDebug>\n#include <QtDBus>\n#include <QRegExp>\n\n#include <wlancond.h>\n#include <libicd-network-wlan-dev.h>\n#include <maemo_icd.h>\n#include <iapconf.h>\n\n\nQT_BEGIN_NAMESPACE\n\nvoid QNetworkConfigurationManagerPrivate::registerPlatformCapabilities()\n{\n capFlags |= QNetworkConfigurationManager::BearerManagement;\n capFlags |= QNetworkConfigurationManager::DataStatistics;\n capFlags |= QNetworkConfigurationManager::SystemSessionSupport;\n capFlags |= QNetworkConfigurationManager::ForcedRoaming;\n}\n\n\nstatic inline QString network_attrs_to_security(uint network_attrs)\n{\n uint cap;\n nwattr2cap(network_attrs, &cap); \/* from libicd-network-wlan-dev.h *\/\n if (cap & WLANCOND_OPEN)\n\treturn \"NONE\";\n else if (cap & WLANCOND_WEP)\n\treturn \"WEP\";\n else if (cap & WLANCOND_WPA_PSK)\n\treturn \"WPA_PSK\";\n else if (cap & WLANCOND_WPA_EAP)\n\treturn \"WPA_EAP\";\n return \"\";\n}\n\n\nstruct SSIDInfo {\n QString iap_id;\n QString wlan_security;\n};\n\nvoid QNetworkConfigurationManagerPrivate::updateConfigurations()\n{\n \/* Contains known network id (like ssid) from storage *\/\n QMultiHash<QByteArray, SSIDInfo* > knownConfigs;\n\n \/* All the scanned access points *\/\n QList<Maemo::IcdScanResult> scanned;\n\n const QRegExp wlan = QRegExp(\"WLAN.*\");\n\n \/* We return currently configured IAPs in the first run and do the WLAN\n * scan in subsequent runs.\n *\/\n QList<QString> all_iaps;\n Maemo::IAPConf::getAll(all_iaps);\n\n foreach (QString iap_id, all_iaps) {\n\tQByteArray ssid;\n\tMaemo::IAPConf saved_ap(iap_id);\n\tbool is_temporary = saved_ap.value(\"temporary\").toBool();\n\tif (is_temporary) {\n\t qDebug() << \"IAP\" << iap_id << \"is temporary, skipping it.\";\n\t continue;\n\t}\n\n\tQString iap_type = saved_ap.value(\"type\").toString();\n\tif (iap_type.contains(wlan)) {\n\t ssid = saved_ap.value(\"wlan_ssid\").toByteArray();\n\t if (ssid.isEmpty()) {\n\t\tqWarning() << \"Cannot get ssid for\" << iap_id;\n\t\tcontinue;\n\t }\n\n\t QString security_method = saved_ap.value(\"wlan_security\").toString();\n\t SSIDInfo *info = new SSIDInfo;\n\t info->iap_id = iap_id;\n\t info->wlan_security = security_method;\n\t knownConfigs.insert(ssid, info);\n\t} else if (iap_type.isEmpty()) {\n\t qWarning() << \"IAP\" << iap_id << \"network type is not set! Skipping it\";\n\t continue;\n\t} else {\n\t qDebug() << \"IAP\" << iap_id << \"network type is\" << iap_type;\n\t ssid.clear();\n\t}\n\n\tif (!accessPointConfigurations.contains(iap_id)) {\n\t QNetworkConfigurationPrivate* cpPriv = new QNetworkConfigurationPrivate();\n\t \/\/cpPriv->name = iap_info.value().toString();\n\t cpPriv->name = saved_ap.value(\"name\").toString();\n\t if (cpPriv->name.isEmpty())\n\t\tif (ssid.size() > 0)\n\t\t cpPriv->name = ssid.data();\n\t\telse\n\t\t cpPriv->name = iap_id;\n\t cpPriv->isValid = true;\n\t cpPriv->id = iap_id;\n\t cpPriv->network_id = ssid;\n\t cpPriv->iap_type = iap_type;\n\t cpPriv->type = QNetworkConfiguration::InternetAccessPoint;\n\t cpPriv->state = QNetworkConfiguration::Defined;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> ptr(cpPriv);\n\t accessPointConfigurations.insert(iap_id, ptr);\n\n\t qDebug(\"IAP: %s, name: %s, ssid: %s, added to known list\", iap_id.toAscii().data(), cpPriv->name.toAscii().data(), ssid.size() ? ssid.data() : \"-\");\n\t} else {\n\t qDebug(\"IAP: %s, ssid: %s, already exists in the known list\", iap_id.toAscii().data(), ssid.size() ? ssid.data() : \"-\");\n\t}\n }\n\n\n if (!firstUpdate) {\n\tQStringList scannedNetworkTypes;\n\tQStringList networkTypesToScan;\n\tQString error;\n\tMaemo::Icd icd(ICD_SHORT_SCAN_TIMEOUT);\n\n\tscannedNetworkTypes = icd.scan(ICD_SCAN_REQUEST_ACTIVE,\n\t\t\t\t networkTypesToScan,\n\t\t\t\t scanned,\n\t\t\t\t error);\n\tif (!error.isEmpty()) {\n\t qWarning() << \"Network scanning failed.\";\n\t} else {\n\t qDebug() << \"Scan returned\" << scanned.size() << \"networks\";\n\t}\n }\n\n\n \/* This is skipped in the first update as scanned size is zero *\/\n for (int i=0; i<scanned.size(); ++i) {\n\tconst Maemo::IcdScanResult ap = scanned.at(i); \n\n\tif (ap.scan.network_attrs & ICD_NW_ATTR_IAPNAME) {\n\t \/* The network_id is IAP id, so the IAP is a known one *\/\n\t QString iapid = ap.scan.network_id.data();\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> priv = accessPointConfigurations.take(iapid);\n\t if (priv) {\n\t\tpriv->state = QNetworkConfiguration::Discovered; \/* Defined is set automagically *\/\n\t\taccessPointConfigurations.insert(iapid, priv);\n\t\tqDebug(\"IAP: %s, ssid: %s, discovered\", iapid.toAscii().data(), priv->network_id.data());\n\n\t\tif (!ap.scan.network_type.contains(wlan))\n\t\t continue; \/\/ not a wlan AP\n\n\t\t\/* Remove scanned AP from known configurations so that we can\n\t\t * emit configurationRemoved signal later\n\t\t *\/\n\t\tQList<SSIDInfo* > known_iaps = knownConfigs.values(priv->network_id);\n\t rescan_list:\n\t\tfor (int k=0; k<known_iaps.size(); ++k) {\n\t\t SSIDInfo *iap = known_iaps.at(k);\n\t\t if (iap->wlan_security == \n\t\t\tnetwork_attrs_to_security(ap.scan.network_attrs)) {\n\t\t\t\/* Remove IAP from the list *\/\n\t\t\tknownConfigs.remove(priv->network_id, iap);\n\t\t\tqDebug() << \"Removed IAP\" << iap->iap_id << \"from unknown config\";\n\t\t\tknown_iaps.removeAt(k);\n\t\t\tdelete iap;\n\t\t\tgoto rescan_list;\n\t\t }\n\t\t}\n\t } else {\n\t\tqWarning() << \"IAP\" << iapid << \"is missing!\";\n\t }\n\n\t} else {\n\t \/* Non saved access point data *\/\n\t QByteArray scanned_ssid = ap.scan.network_id;\n\t QNetworkConfigurationPrivate* cpPriv = new QNetworkConfigurationPrivate();\n\t QString hrs = scanned_ssid.data();\n\t cpPriv->name = ap.network_name.isEmpty() ? hrs : ap.network_name;\n\t cpPriv->isValid = true;\n\t cpPriv->id = scanned_ssid.data(); \/\/ Note: id is now ssid, it should be set to IAP id if the IAP is saved\n\t cpPriv->network_id = scanned_ssid;\n\t cpPriv->iap_type = ap.scan.network_type;\n\t cpPriv->type = QNetworkConfiguration::InternetAccessPoint;\n\t cpPriv->state = QNetworkConfiguration::Undefined;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> ptr(cpPriv);\n\t accessPointConfigurations.insert(cpPriv->id, ptr);\n\n\t qDebug() << \"IAP with network id\" << cpPriv->id << \"was found in the scan.\";\n\n\t QNetworkConfiguration item;\n\t item.d = ptr;\n\t emit configurationAdded(item);\n\t}\n }\n\n\n \/* Remove non existing iaps since last update *\/\n if (!firstUpdate) {\n\tQHashIterator<QByteArray, SSIDInfo* > i(knownConfigs);\n\twhile (i.hasNext()) {\n\t i.next();\n\t SSIDInfo *iap = i.value();\n\t QString iap_id = iap->iap_id;\n\t \/\/qDebug() << i.key() << \": \" << iap_id;\n\n\t QExplicitlySharedDataPointer<QNetworkConfigurationPrivate> priv = accessPointConfigurations.take(iap_id);\n\t if (priv) {\n\t\tpriv->isValid = false;\n\t\tqDebug() << \"IAP\" << iap_id << \"was removed as it was not found in scan.\";\n\n\t\tQNetworkConfiguration item;\n\t\titem.d = priv;\n\t\temit configurationRemoved(item);\n\n\t\t\/\/if we would have SNAP support we would have to remove the references\n\t\t\/\/from existing ServiceNetworks to the removed access point configuration\n\t }\n\t}\n }\n\n\n QMutableHashIterator<QByteArray, SSIDInfo* > i(knownConfigs);\n while (i.hasNext()) {\n\ti.next();\n\tSSIDInfo *iap = i.value();\n\tdelete iap;\n\ti.remove();\n }\n\n if (firstUpdate)\n firstUpdate = false;\n\n QTimer::singleShot(0, this, SIGNAL(configurationUpdateComplete()));\n}\n\n\nQNetworkConfiguration QNetworkConfigurationManagerPrivate::defaultConfiguration()\n{\n \/* Here we just create a [ANY] request to icd and let the icd decide which\n * AP to connect.\n *\/\n QNetworkConfigurationPrivate *d = new QNetworkConfigurationPrivate; \/\/ TODO: where is this freed?\n if (d) {\n\td->name = OSSO_IAP_ANY;\n\td->id = OSSO_IAP_ANY;\n\td->state = QNetworkConfiguration::Defined;\n\td->type = QNetworkConfiguration::UserChoice;\n\td->roamingSupported = false;\n\td->isValid = true;\n }\n\n QNetworkConfiguration item;\n item.d = d;\n return item;\n}\n\n\nvoid QNetworkConfigurationManagerPrivate::performAsyncConfigurationUpdate()\n{\n QTimer::singleShot(0, this, SLOT(updateConfigurations()));\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Copyright (C) 2013 kangliqiang ,kangliq@163.com\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include \"SocketUtil.h\"\n#include <stdlib.h>\n#include <assert.h>\n#include <string.h>\n#include <sstream>\n#include <vector>\n\nint SocketInit()\n{\n#ifdef WIN32\n\n\tWSADATA wsaData;\n\tWORD versionRequested;\n\n\tversionRequested = MAKEWORD(2, 2);\n\n\tif (0 != WSAStartup(versionRequested, &wsaData))\n\t{\n\t\treturn -1;\n\t}\n\n#else\n\n\tsignal(SIGPIPE, SIG_IGN);\n\n#endif\n\n\treturn 0;\n}\n\nint MakeSocketNonblocking (SOCKET fd)\n{\n#ifdef WIN32\n\tunsigned long para = 1;\n\treturn ioctlsocket (fd,FIONBIO,¶);\n#else\n\tint flags = fcntl (fd, F_GETFL, 0);\n\tassert (flags != -1);\n\tflags = (flags | O_NONBLOCK);\n\treturn fcntl (fd, F_SETFL, flags);\n#endif\n}\n\nint SetTcpNoDelay(SOCKET fd)\n{\n\tint flag = 1;\n\treturn setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, (const char*)&flag, sizeof(flag));\n}\n\nbool SplitURL(const std::string& serverURL, std::string &addr, short &nPort)\n{\n\tsize_t pos = serverURL.find(':');\n\tif (pos == std::string::npos)\n\t{\n\t\treturn false;\n\t}\n\n\taddr = serverURL.substr(0, pos);\n\tif (0 == addr.compare(\"localhost\"))\n\t{\n\t\taddr = \"127.0.0.1\";\n\t}\n\n\tpos ++;\n\n\tstd::string port = serverURL.substr(pos, serverURL.length() - pos);\n\tnPort = atoi(port.c_str());\n\treturn true;\n}\n\nsockaddr string2SocketAddress(const std::string& addrString)\n{\n\tstd::string strAddr;\n\tshort port;\n\tSplitURL(addrString,strAddr,port);\n\n\tstruct sockaddr_in sa;\n\tsa.sin_family = AF_INET;\n\tsa.sin_port = htons(port);\n\n\tsa.sin_addr.s_addr = inet_addr(strAddr.c_str());\n\n\tsockaddr addr;\n\tmemcpy(&addr,&sa,sizeof(sockaddr));\n\n\treturn addr;\n}\n\nstd::string socketAddress2String(sockaddr addr)\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\n\treturn inet_ntoa(in.sin_addr);\n}\n\nvoid GetLocalAddrs(std::vector<unsigned int> &addrs)\n{\n\taddrs.clear();\n\n#ifdef WIN32\n\tWSADATA wsaData;\n\tint ret = WSAStartup(MAKEWORD(2, 2), &wsaData);\n\tif (ret != 0) {\n\t\treturn;\n\t}\n\n\tSOCKET sfd = socket(AF_INET, SOCK_DGRAM, 0);\n\n\tif(sfd != INVALID_SOCKET)\n\t{\n\t\tDWORD bytesRet = 0;\n\t\tchar * buffer;\n\t\tint bufSize = 1024;\n\t\tdo\n\t\t{\n\t\t\tbuffer = (char*)malloc(bufSize);\n\t\t\tif (WSAIoctl(sfd, SIO_GET_INTERFACE_LIST, NULL, 0, buffer, bufSize, &bytesRet, NULL, NULL) == SOCKET_ERROR)\n\t\t\t{\n\t\t\t\tif (WSAGetLastError() == WSAEFAULT)\n\t\t\t\t{\n\t\t\t\t\tbufSize <<= 1;\n\t\t\t\t\tfree(buffer);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbytesRet = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}while (true);\n\n\t\tint size = bytesRet \/ sizeof(INTERFACE_INFO);\n\t\tINTERFACE_INFO* iinfo = (INTERFACE_INFO*)buffer;\n\n\t\tfor (int i = 0; i < size; i++)\n\t\t{\n\t\t\tif (iinfo[i].iiAddress.AddressIn.sin_family == AF_INET)\n\t\t\t{\n\t\t\t\taddrs.push_back(ntohl(iinfo[i].iiAddress.AddressIn.sin_addr.s_addr));\n\t\t\t}\n\t\t}\n\n\t\tfree(buffer);\n\t\tbuffer = NULL;\n\t\tclosesocket(sfd);\n\t}\n#else\n\n\tstruct ifconf ifc;\n\tifc.ifc_buf = NULL;\n\tifc.ifc_len = 0;\n\n\tint sfd = socket(AF_INET, SOCK_DGRAM, 0);\n\tif(sfd != INVALID_SOCKET)\n\t{\n\t\tint ret = ioctl(sfd, SIOCGIFCONF, (char *)&ifc);\n\n\t\tif(ret != -1)\n\t\t{\n\t\t\tifc.ifc_req=(struct ifreq *)malloc(ifc.ifc_len);\n\t\t\tret = ioctl(sfd, SIOCGIFCONF, (char *)&ifc);\n\t\t\tif(ret != -1)\n\t\t\t{\n\t\t\t\tfor(int i=0; i<ifc.ifc_len\/sizeof(struct ifreq); i++)\n\t\t\t\t{\n\t\t\t\t\tstruct sockaddr* sa = (struct sockaddr *)&(ifc.ifc_req[i].ifr_addr);\n\t\t\t\t\tif (AF_INET==sa->sa_family)\n\t\t\t\t\t{\n\t\t\t\t\t\tunsigned int addr = ((struct sockaddr_in *)sa)->sin_addr.s_addr;\n\t\t\t\t\t\taddrs.push_back(htonl(addr));\n\t\t\t\t\t}\t\t\t\t\n\t\t\t\t}\t\t\t\n\t\t\t}\n\n\t\t\tfree(ifc.ifc_req);\n\t\t\tifc.ifc_req = NULL;\n\t\t}\n\n\t\tclose(sfd);\n\t}\n\n#endif\n\n\tif(addrs.empty())\n\t{\t\t\n\t\tchar hostname[1024];\n\n\t\tint ret = gethostname(hostname, sizeof(hostname));\n\t\tif (ret == 0)\n\t\t{\n\t\t\tstruct addrinfo *result = NULL;\n\t\t\tstruct addrinfo *ptr = NULL;\n\t\t\tstruct addrinfo hints;\n\n\t\t\tmemset(&hints, 0,sizeof(hints) );\n\t\t\thints.ai_family = AF_INET;\n\t\t\thints.ai_socktype = SOCK_STREAM;\n\t\t\thints.ai_protocol = IPPROTO_TCP;\n\n\t\t\tret = getaddrinfo(hostname, NULL, &hints, &result);\n\t\t\tif ( ret == 0 ) \n\t\t\t{\n\t\t\t\tfor(ptr=result; ptr != NULL ;ptr=ptr->ai_next) \n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tstruct sockaddr_in *sockaddr_ipv4 = (struct sockaddr_in *) ptr->ai_addr;\n\t\t\t\t\taddrs.push_back(ntohl(sockaddr_ipv4->sin_addr.s_addr));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfreeaddrinfo(result);\n\t\t}\n\t}\n\n\tstd::vector<unsigned int>::iterator it = addrs.begin();\n\tfor (;it!=addrs.end();)\n\t{\n\t\tif (*it>= 0x7F000000U && *it < 0x80000000U)\n\t\t{\n\t\t\tit = addrs.erase(it);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tit++;\n\t\t}\n\t}\n\n\tif (addrs.empty())\n\t{\n\t\taddrs.push_back(INADDR_LOOPBACK);\n\t}\n\n#ifdef WIN32\n\t\tWSACleanup();\n#endif\n}\n\nstd::string getLocalAddress()\n{\n\tstd::vector<unsigned int> addrs;\n\tGetLocalAddrs(addrs);\n\tstruct in_addr addr;\n\taddr.s_addr=htonl(addrs[0]);\n\n\treturn inet_ntoa(addr);\n}\n\nstd::string getHostName(sockaddr addr)\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\t\n\tstruct hostent *remoteHost = gethostbyaddr((char*) &(in.sin_addr), 4, AF_INET);\n\tchar** alias = remoteHost->h_aliases;\n\tif (*alias!=0)\n\t{\n\t\treturn *alias;\n\t}\n\telse\n\t{\n\t\treturn inet_ntoa(in.sin_addr);\n\t}\n}\n\n\nunsigned long long swapll(unsigned long long v)\n{\n#ifdef ENDIANMODE_BIG\n\treturn v;\n#else\n\tunsigned long long ret = ((v << 56) \n\t\t\t\t\t\t\t\t| ((v & 0xff00) << 40)\n\t\t\t\t\t\t\t\t| ((v & 0xff0000) << 24)\n\t\t\t\t\t\t\t\t| ((v & 0xff000000) << 8)\n\t\t\t\t\t\t\t\t| ((v >> 8 ) & 0xff000000)\n\t\t\t\t\t\t\t\t| ((v >> 24 ) & 0xff0000)\n\t\t\t\t\t\t\t\t| ((v >> 40 ) & 0xff00)\n\t\t\t\t\t\t\t\t| (v >> 56 ));\n\n\treturn ret;\n#endif\n}\n\nunsigned long long h2nll(unsigned long long v)\n{\n\treturn swapll(v);\n}\n\nunsigned long long n2hll(unsigned long long v)\n{\n\treturn swapll(v);\n}\n\nstd::string socketAddress2IPPort( sockaddr addr )\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\n\tchar tmp[32];\n\tsprintf(tmp,\"%s:%d\",inet_ntoa(in.sin_addr),ntohs(in.sin_port));\n\n\tstd::string ipport = tmp;\n\treturn ipport;\n}\n<commit_msg>Update SocketUtil.cpp<commit_after>\/**\n* Copyright (C) 2013 kangliqiang ,kangliq@163.com\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n\n#include \"SocketUtil.h\"\n#include <stdlib.h>\n#include <assert.h>\n#include <string.h>\n#include <sstream>\n#include <vector>\n#include <stdio.h>\n\nint SocketInit()\n{\n#ifdef WIN32\n\n\tWSADATA wsaData;\n\tWORD versionRequested;\n\n\tversionRequested = MAKEWORD(2, 2);\n\n\tif (0 != WSAStartup(versionRequested, &wsaData))\n\t{\n\t\treturn -1;\n\t}\n\n#else\n\n\tsignal(SIGPIPE, SIG_IGN);\n\n#endif\n\n\treturn 0;\n}\n\nint MakeSocketNonblocking (SOCKET fd)\n{\n#ifdef WIN32\n\tunsigned long para = 1;\n\treturn ioctlsocket (fd,FIONBIO,¶);\n#else\n\tint flags = fcntl (fd, F_GETFL, 0);\n\tassert (flags != -1);\n\tflags = (flags | O_NONBLOCK);\n\treturn fcntl (fd, F_SETFL, flags);\n#endif\n}\n\nint SetTcpNoDelay(SOCKET fd)\n{\n\tint flag = 1;\n\treturn setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, (const char*)&flag, sizeof(flag));\n}\n\nbool SplitURL(const std::string& serverURL, std::string &addr, short &nPort)\n{\n\tsize_t pos = serverURL.find(':');\n\tif (pos == std::string::npos)\n\t{\n\t\treturn false;\n\t}\n\n\taddr = serverURL.substr(0, pos);\n\tif (0 == addr.compare(\"localhost\"))\n\t{\n\t\taddr = \"127.0.0.1\";\n\t}\n\n\tpos ++;\n\n\tstd::string port = serverURL.substr(pos, serverURL.length() - pos);\n\tnPort = atoi(port.c_str());\n\treturn true;\n}\n\nsockaddr string2SocketAddress(const std::string& addrString)\n{\n\tstd::string strAddr;\n\tshort port;\n\tSplitURL(addrString,strAddr,port);\n\n\tstruct sockaddr_in sa;\n\tsa.sin_family = AF_INET;\n\tsa.sin_port = htons(port);\n\n\tsa.sin_addr.s_addr = inet_addr(strAddr.c_str());\n\n\tsockaddr addr;\n\tmemcpy(&addr,&sa,sizeof(sockaddr));\n\n\treturn addr;\n}\n\nstd::string socketAddress2String(sockaddr addr)\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\n\treturn inet_ntoa(in.sin_addr);\n}\n\nvoid GetLocalAddrs(std::vector<unsigned int> &addrs)\n{\n\taddrs.clear();\n\n#ifdef WIN32\n\tWSADATA wsaData;\n\tint ret = WSAStartup(MAKEWORD(2, 2), &wsaData);\n\tif (ret != 0) {\n\t\treturn;\n\t}\n\n\tSOCKET sfd = socket(AF_INET, SOCK_DGRAM, 0);\n\n\tif(sfd != INVALID_SOCKET)\n\t{\n\t\tDWORD bytesRet = 0;\n\t\tchar * buffer;\n\t\tint bufSize = 1024;\n\t\tdo\n\t\t{\n\t\t\tbuffer = (char*)malloc(bufSize);\n\t\t\tif (WSAIoctl(sfd, SIO_GET_INTERFACE_LIST, NULL, 0, buffer, bufSize, &bytesRet, NULL, NULL) == SOCKET_ERROR)\n\t\t\t{\n\t\t\t\tif (WSAGetLastError() == WSAEFAULT)\n\t\t\t\t{\n\t\t\t\t\tbufSize <<= 1;\n\t\t\t\t\tfree(buffer);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tbytesRet = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}while (true);\n\n\t\tint size = bytesRet \/ sizeof(INTERFACE_INFO);\n\t\tINTERFACE_INFO* iinfo = (INTERFACE_INFO*)buffer;\n\n\t\tfor (int i = 0; i < size; i++)\n\t\t{\n\t\t\tif (iinfo[i].iiAddress.AddressIn.sin_family == AF_INET)\n\t\t\t{\n\t\t\t\taddrs.push_back(ntohl(iinfo[i].iiAddress.AddressIn.sin_addr.s_addr));\n\t\t\t}\n\t\t}\n\n\t\tfree(buffer);\n\t\tbuffer = NULL;\n\t\tclosesocket(sfd);\n\t}\n#else\n\n\tstruct ifconf ifc;\n\tifc.ifc_buf = NULL;\n\tifc.ifc_len = 0;\n\n\tint sfd = socket(AF_INET, SOCK_DGRAM, 0);\n\tif(sfd != INVALID_SOCKET)\n\t{\n\t\tint ret = ioctl(sfd, SIOCGIFCONF, (char *)&ifc);\n\n\t\tif(ret != -1)\n\t\t{\n\t\t\tifc.ifc_req=(struct ifreq *)malloc(ifc.ifc_len);\n\t\t\tret = ioctl(sfd, SIOCGIFCONF, (char *)&ifc);\n\t\t\tif(ret != -1)\n\t\t\t{\n\t\t\t\tfor(int i=0; i<ifc.ifc_len\/sizeof(struct ifreq); i++)\n\t\t\t\t{\n\t\t\t\t\tstruct sockaddr* sa = (struct sockaddr *)&(ifc.ifc_req[i].ifr_addr);\n\t\t\t\t\tif (AF_INET==sa->sa_family)\n\t\t\t\t\t{\n\t\t\t\t\t\tunsigned int addr = ((struct sockaddr_in *)sa)->sin_addr.s_addr;\n\t\t\t\t\t\taddrs.push_back(htonl(addr));\n\t\t\t\t\t}\t\t\t\t\n\t\t\t\t}\t\t\t\n\t\t\t}\n\n\t\t\tfree(ifc.ifc_req);\n\t\t\tifc.ifc_req = NULL;\n\t\t}\n\n\t\tclose(sfd);\n\t}\n\n#endif\n\n\tif(addrs.empty())\n\t{\t\t\n\t\tchar hostname[1024];\n\n\t\tint ret = gethostname(hostname, sizeof(hostname));\n\t\tif (ret == 0)\n\t\t{\n\t\t\tstruct addrinfo *result = NULL;\n\t\t\tstruct addrinfo *ptr = NULL;\n\t\t\tstruct addrinfo hints;\n\n\t\t\tmemset(&hints, 0,sizeof(hints) );\n\t\t\thints.ai_family = AF_INET;\n\t\t\thints.ai_socktype = SOCK_STREAM;\n\t\t\thints.ai_protocol = IPPROTO_TCP;\n\n\t\t\tret = getaddrinfo(hostname, NULL, &hints, &result);\n\t\t\tif ( ret == 0 ) \n\t\t\t{\n\t\t\t\tfor(ptr=result; ptr != NULL ;ptr=ptr->ai_next) \n\t\t\t\t{\n\t\t\t\t\t\n\t\t\t\t\tstruct sockaddr_in *sockaddr_ipv4 = (struct sockaddr_in *) ptr->ai_addr;\n\t\t\t\t\taddrs.push_back(ntohl(sockaddr_ipv4->sin_addr.s_addr));\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfreeaddrinfo(result);\n\t\t}\n\t}\n\n\tstd::vector<unsigned int>::iterator it = addrs.begin();\n\tfor (;it!=addrs.end();)\n\t{\n\t\tif (*it>= 0x7F000000U && *it < 0x80000000U)\n\t\t{\n\t\t\tit = addrs.erase(it);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tit++;\n\t\t}\n\t}\n\n\tif (addrs.empty())\n\t{\n\t\taddrs.push_back(INADDR_LOOPBACK);\n\t}\n\n#ifdef WIN32\n\t\tWSACleanup();\n#endif\n}\n\nstd::string getLocalAddress()\n{\n\tstd::vector<unsigned int> addrs;\n\tGetLocalAddrs(addrs);\n\tstruct in_addr addr;\n\taddr.s_addr=htonl(addrs[0]);\n\n\treturn inet_ntoa(addr);\n}\n\nstd::string getHostName(sockaddr addr)\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\t\n\tstruct hostent *remoteHost = gethostbyaddr((char*) &(in.sin_addr), 4, AF_INET);\n\tchar** alias = remoteHost->h_aliases;\n\tif (*alias!=0)\n\t{\n\t\treturn *alias;\n\t}\n\telse\n\t{\n\t\treturn inet_ntoa(in.sin_addr);\n\t}\n}\n\n\nunsigned long long swapll(unsigned long long v)\n{\n#ifdef ENDIANMODE_BIG\n\treturn v;\n#else\n\tunsigned long long ret = ((v << 56) \n\t\t\t\t\t\t\t\t| ((v & 0xff00) << 40)\n\t\t\t\t\t\t\t\t| ((v & 0xff0000) << 24)\n\t\t\t\t\t\t\t\t| ((v & 0xff000000) << 8)\n\t\t\t\t\t\t\t\t| ((v >> 8 ) & 0xff000000)\n\t\t\t\t\t\t\t\t| ((v >> 24 ) & 0xff0000)\n\t\t\t\t\t\t\t\t| ((v >> 40 ) & 0xff00)\n\t\t\t\t\t\t\t\t| (v >> 56 ));\n\n\treturn ret;\n#endif\n}\n\nunsigned long long h2nll(unsigned long long v)\n{\n\treturn swapll(v);\n}\n\nunsigned long long n2hll(unsigned long long v)\n{\n\treturn swapll(v);\n}\n\nstd::string socketAddress2IPPort( sockaddr addr )\n{\n\tsockaddr_in in;\n\tmemcpy(&in,&addr,sizeof(sockaddr));\n\n\tchar tmp[32];\n\tsprintf(tmp,\"%s:%d\",inet_ntoa(in.sin_addr),ntohs(in.sin_port));\n\n\tstd::string ipport = tmp;\n\treturn ipport;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"twitchchannel.hpp\"\n#include \"debug\/log.hpp\"\n#include \"emotemanager.hpp\"\n#include \"util\/urlfetch.hpp\"\n\n#include <QThread>\n#include <QTimer>\n\nnamespace chatterino {\nnamespace twitch {\n\nTwitchChannel::TwitchChannel(IrcManager &ircManager, const QString &channelName, bool _isSpecial)\n : Channel(channelName)\n , ircManager(ircManager)\n , bttvChannelEmotes(new EmoteMap)\n , ffzChannelEmotes(new EmoteMap)\n , subscriptionURL(\"https:\/\/www.twitch.tv\/\" + name + \"\/subscribe?ref=in_chat_subscriber_link\")\n , channelURL(\"https:\/\/twitch.tv\/\" + name)\n , popoutPlayerURL(\"https:\/\/player.twitch.tv\/?channel=\" + name)\n , isLive(false)\n , isSpecial(_isSpecial)\n{\n debug::Log(\"[TwitchChannel:{}] Opened\", this->name);\n\n this->dontAddMessages = true;\n\n if (!this->isSpecial) {\n this->reloadChannelEmotes();\n }\n\n this->liveStatusTimer = new QTimer;\n QObject::connect(this->liveStatusTimer, &QTimer::timeout, [this]() {\n this->refreshLiveStatus(); \/\/\n });\n this->liveStatusTimer->start(60000);\n\n this->roomIDchanged.connect([this]() {\n this->refreshLiveStatus(); \/\/\n });\n\n this->fetchMessages.connect([this] {\n this->fetchRecentMessages(); \/\/\n });\n}\n\nTwitchChannel::~TwitchChannel()\n{\n this->liveStatusTimer->stop();\n this->liveStatusTimer->deleteLater();\n}\n\nbool TwitchChannel::isEmpty() const\n{\n return this->name.isEmpty();\n}\n\nbool TwitchChannel::canSendMessage() const\n{\n return !this->isEmpty() && !this->isSpecial;\n}\n\nvoid TwitchChannel::setRoomID(const QString &_roomID)\n{\n this->roomID = _roomID;\n this->roomIDchanged();\n this->fetchMessages.invoke();\n}\n\nvoid TwitchChannel::reloadChannelEmotes()\n{\n auto &emoteManager = EmoteManager::getInstance();\n\n debug::Log(\"[TwitchChannel:{}] Reloading channel emotes\", this->name);\n\n emoteManager.reloadBTTVChannelEmotes(this->name, this->bttvChannelEmotes);\n emoteManager.reloadFFZChannelEmotes(this->name, this->ffzChannelEmotes);\n}\n\nvoid TwitchChannel::sendMessage(const QString &message)\n{\n auto &emoteManager = EmoteManager::getInstance();\n\n debug::Log(\"[TwitchChannel:{}] Send message: {}\", this->name, message);\n\n \/\/ Do last message processing\n QString parsedMessage = emoteManager.replaceShortCodes(message);\n\n this->ircManager.sendMessage(this->name, parsedMessage);\n}\n\nvoid TwitchChannel::setLive(bool newLiveStatus)\n{\n if (this->isLive == newLiveStatus) {\n return;\n }\n\n this->isLive = newLiveStatus;\n this->onlineStatusChanged();\n}\n\nvoid TwitchChannel::refreshLiveStatus()\n{\n if (this->roomID.isEmpty()) {\n this->setLive(false);\n return;\n }\n\n debug::Log(\"[TwitchChannel:{}] Refreshing live status\", this->name);\n\n QString url(\"https:\/\/api.twitch.tv\/kraken\/streams\/\" + this->roomID);\n\n util::twitch::get2(url, QThread::currentThread(), [this](rapidjson::Document &d) {\n if (!d.IsObject()) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] root is not an object\");\n return;\n }\n\n if (!d.HasMember(\"stream\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing stream in root\");\n return;\n }\n\n const auto &stream = d[\"stream\"];\n\n if (!stream.IsObject()) {\n \/\/ Stream is offline (stream is most likely null)\n this->setLive(false);\n return;\n }\n\n if (!stream.HasMember(\"viewers\") || !stream.HasMember(\"game\") ||\n !stream.HasMember(\"channel\") || !stream.HasMember(\"created_at\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing members in stream\");\n this->setLive(false);\n return;\n }\n\n const rapidjson::Value &streamChannel = stream[\"channel\"];\n\n if (!streamChannel.IsObject() || !streamChannel.HasMember(\"status\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing member \\\"status\\\" in channel\");\n return;\n }\n\n \/\/ Stream is live\n this->streamViewerCount = QString::number(stream[\"viewers\"].GetInt());\n this->streamGame = stream[\"game\"].GetString();\n this->streamStatus = streamChannel[\"status\"].GetString();\n QDateTime since = QDateTime::fromString(stream[\"created_at\"].GetString(), Qt::ISODate);\n auto diff = since.secsTo(QDateTime::currentDateTime());\n this->streamUptime =\n QString::number(diff \/ 3600) + \"h \" + QString::number(diff % 3600 \/ 60) + \"m\";\n\n this->setLive(true);\n });\n}\n\nvoid TwitchChannel::fetchRecentMessages()\n{\n static QString genericURL =\n \"https:\/\/tmi.twitch.tv\/api\/rooms\/%1\/recent_messages?client_id=\" + getDefaultClientID();\n static auto readConnection = this->ircManager.getReadConnection();\n\n util::twitch::get(genericURL.arg(roomID), QThread::currentThread(), [=](QJsonObject obj) {\n this->dontAddMessages = false;\n auto msgArray = obj.value(\"messages\").toArray();\n if (msgArray.size())\n for (int i = 0; i < msgArray.size(); i++) {\n QByteArray content = msgArray[i].toString().toUtf8();\n auto msg = Communi::IrcMessage::fromData(content, readConnection);\n auto privMsg = static_cast<Communi::IrcPrivateMessage *>(msg);\n this->ircManager.privateMessageReceived(privMsg);\n }\n });\n}\n\n} \/\/ namespace twitch\n} \/\/ namespace chatterino\n<commit_msg>update subscribe url<commit_after>#include \"twitchchannel.hpp\"\n#include \"debug\/log.hpp\"\n#include \"emotemanager.hpp\"\n#include \"util\/urlfetch.hpp\"\n\n#include <QThread>\n#include <QTimer>\n\nnamespace chatterino {\nnamespace twitch {\n\nTwitchChannel::TwitchChannel(IrcManager &ircManager, const QString &channelName, bool _isSpecial)\n : Channel(channelName)\n , ircManager(ircManager)\n , bttvChannelEmotes(new EmoteMap)\n , ffzChannelEmotes(new EmoteMap)\n , subscriptionURL(\"https:\/\/www.twitch.tv\/subs\/\" + name)\n , channelURL(\"https:\/\/twitch.tv\/\" + name)\n , popoutPlayerURL(\"https:\/\/player.twitch.tv\/?channel=\" + name)\n , isLive(false)\n , isSpecial(_isSpecial)\n{\n debug::Log(\"[TwitchChannel:{}] Opened\", this->name);\n\n this->dontAddMessages = true;\n\n if (!this->isSpecial) {\n this->reloadChannelEmotes();\n }\n\n this->liveStatusTimer = new QTimer;\n QObject::connect(this->liveStatusTimer, &QTimer::timeout, [this]() {\n this->refreshLiveStatus(); \/\/\n });\n this->liveStatusTimer->start(60000);\n\n this->roomIDchanged.connect([this]() {\n this->refreshLiveStatus(); \/\/\n });\n\n this->fetchMessages.connect([this] {\n this->fetchRecentMessages(); \/\/\n });\n}\n\nTwitchChannel::~TwitchChannel()\n{\n this->liveStatusTimer->stop();\n this->liveStatusTimer->deleteLater();\n}\n\nbool TwitchChannel::isEmpty() const\n{\n return this->name.isEmpty();\n}\n\nbool TwitchChannel::canSendMessage() const\n{\n return !this->isEmpty() && !this->isSpecial;\n}\n\nvoid TwitchChannel::setRoomID(const QString &_roomID)\n{\n this->roomID = _roomID;\n this->roomIDchanged();\n this->fetchMessages.invoke();\n}\n\nvoid TwitchChannel::reloadChannelEmotes()\n{\n auto &emoteManager = EmoteManager::getInstance();\n\n debug::Log(\"[TwitchChannel:{}] Reloading channel emotes\", this->name);\n\n emoteManager.reloadBTTVChannelEmotes(this->name, this->bttvChannelEmotes);\n emoteManager.reloadFFZChannelEmotes(this->name, this->ffzChannelEmotes);\n}\n\nvoid TwitchChannel::sendMessage(const QString &message)\n{\n auto &emoteManager = EmoteManager::getInstance();\n\n debug::Log(\"[TwitchChannel:{}] Send message: {}\", this->name, message);\n\n \/\/ Do last message processing\n QString parsedMessage = emoteManager.replaceShortCodes(message);\n\n this->ircManager.sendMessage(this->name, parsedMessage);\n}\n\nvoid TwitchChannel::setLive(bool newLiveStatus)\n{\n if (this->isLive == newLiveStatus) {\n return;\n }\n\n this->isLive = newLiveStatus;\n this->onlineStatusChanged();\n}\n\nvoid TwitchChannel::refreshLiveStatus()\n{\n if (this->roomID.isEmpty()) {\n this->setLive(false);\n return;\n }\n\n debug::Log(\"[TwitchChannel:{}] Refreshing live status\", this->name);\n\n QString url(\"https:\/\/api.twitch.tv\/kraken\/streams\/\" + this->roomID);\n\n util::twitch::get2(url, QThread::currentThread(), [this](rapidjson::Document &d) {\n if (!d.IsObject()) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] root is not an object\");\n return;\n }\n\n if (!d.HasMember(\"stream\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing stream in root\");\n return;\n }\n\n const auto &stream = d[\"stream\"];\n\n if (!stream.IsObject()) {\n \/\/ Stream is offline (stream is most likely null)\n this->setLive(false);\n return;\n }\n\n if (!stream.HasMember(\"viewers\") || !stream.HasMember(\"game\") ||\n !stream.HasMember(\"channel\") || !stream.HasMember(\"created_at\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing members in stream\");\n this->setLive(false);\n return;\n }\n\n const rapidjson::Value &streamChannel = stream[\"channel\"];\n\n if (!streamChannel.IsObject() || !streamChannel.HasMember(\"status\")) {\n debug::Log(\"[TwitchChannel:refreshLiveStatus] Missing member \\\"status\\\" in channel\");\n return;\n }\n\n \/\/ Stream is live\n this->streamViewerCount = QString::number(stream[\"viewers\"].GetInt());\n this->streamGame = stream[\"game\"].GetString();\n this->streamStatus = streamChannel[\"status\"].GetString();\n QDateTime since = QDateTime::fromString(stream[\"created_at\"].GetString(), Qt::ISODate);\n auto diff = since.secsTo(QDateTime::currentDateTime());\n this->streamUptime =\n QString::number(diff \/ 3600) + \"h \" + QString::number(diff % 3600 \/ 60) + \"m\";\n\n this->setLive(true);\n });\n}\n\nvoid TwitchChannel::fetchRecentMessages()\n{\n static QString genericURL =\n \"https:\/\/tmi.twitch.tv\/api\/rooms\/%1\/recent_messages?client_id=\" + getDefaultClientID();\n static auto readConnection = this->ircManager.getReadConnection();\n\n util::twitch::get(genericURL.arg(roomID), QThread::currentThread(), [=](QJsonObject obj) {\n this->dontAddMessages = false;\n auto msgArray = obj.value(\"messages\").toArray();\n if (msgArray.size())\n for (int i = 0; i < msgArray.size(); i++) {\n QByteArray content = msgArray[i].toString().toUtf8();\n auto msg = Communi::IrcMessage::fromData(content, readConnection);\n auto privMsg = static_cast<Communi::IrcPrivateMessage *>(msg);\n this->ircManager.privateMessageReceived(privMsg);\n }\n });\n}\n\n} \/\/ namespace twitch\n} \/\/ namespace chatterino\n<|endoftext|>"} {"text":"<commit_before>#include <assert.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\n\n#include <absl\/strings\/str_cat.h>\n#include <gflags\/gflags.h>\n\nDEFINE_int32(\n c,\n 4,\n \"threshold under which candidates are output. set to -1 to output all.\");\nDEFINE_bool(i, false, \"add inverted tags\");\nDEFINE_int32(m, 0, \"min number of set\/cleared samples each\");\nDEFINE_int32(M, 0, \"min number of set\/cleared samples total\");\nDEFINE_string(o, \"\", \"set output file\");\nDEFINE_string(k, \"\", \"set output mask file\");\n\nusing std::map;\nusing std::string;\nusing std::tuple;\nusing std::vector;\n\nint num_bits = 0, num_tags = 0;\nmap<string, int> bit_ids, tag_ids;\nvector<string> bit_ids_r, tag_ids_r;\n\n#if 0\nstruct bool_vec\n{\n\tvector<bool> data;\n\n\tbool_vec(int n = 0, bool initval = false) : data(n, initval)\n\t{\n\t}\n\n\tvoid set(int n)\n\t{\n\t\tif (int(data.size()) <= n)\n\t\t\tdata.resize(n+1);\n\t\tdata[n] = true;\n\t}\n\n\tbool get(int n)\n\t{\n\t\treturn data.at(n);\n\t}\n\n\tvoid resize(int n)\n\t{\n\t\tdata.resize(n);\n\t}\n\n\tint count()\n\t{\n\t\treturn std::accumulate(data.begin(), data.end(), 0);\n\t}\n\n\tvoid apply_and(const bool_vec &other)\n\t{\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] = data[i] && other.data[i];\n\t}\n\n\tvoid apply_andc(const bool_vec &other)\n\t{\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] = data[i] && !other.data[i];\n\t}\n};\n#else\nstruct bool_vec {\n\tvector<uint64_t> data;\n\n\tbool_vec(int n = 0, bool initval = false)\n\t : data((n + 63) \/ 64, initval ? ~uint64_t(0) : uint64_t(0)) {\n\t\tfor (int i = data.size() * 64 - 1; i >= n; i--)\n\t\t\tdata[n \/ 64] &= ~(uint64_t(1) << (n % 64));\n\t}\n\n\tvoid set(int n) {\n\t\tif (int(data.size() * 64) <= n)\n\t\t\tdata.resize((n + 64) \/ 64);\n\t\tdata[n \/ 64] |= uint64_t(1) << (n % 64);\n\t}\n\n\tbool get(int n) { return (data[n \/ 64] >> (n % 64)) & 1; }\n\n\tvoid resize(int n) { data.resize((n + 63) \/ 64); }\n\n\tint count() {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < 64 * int(data.size()); i++)\n\t\t\tif (get(i))\n\t\t\t\tsum++;\n\t\treturn sum;\n\t}\n\n\tvoid apply_and(const bool_vec& other) {\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] &= other.data[i];\n\t}\n\n\tvoid apply_andc(const bool_vec& other) {\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] &= ~other.data[i];\n\t}\n};\n#endif\n\n\/\/ segname -> bits, tags_on, tags_off\ntypedef tuple<bool_vec, bool_vec, bool_vec> segdata_t;\nmap<string, segdata_t> segdata;\n\nmap<string, int> segnamecnt;\n\nstatic inline bool_vec& segdata_bits(segdata_t& sd) {\n\treturn std::get<0>(sd);\n}\nstatic inline bool_vec& segdata_tags1(segdata_t& sd) {\n\treturn std::get<1>(sd);\n}\nstatic inline bool_vec& segdata_tags0(segdata_t& sd) {\n\treturn std::get<2>(sd);\n}\n\nvoid read_input(std::istream& f, std::string filename) {\n\tstring token;\n\tsegdata_t* segptr = nullptr;\n\n\twhile (f >> token) {\n\t\tif (token == \"seg\") {\n\t\t\tf >> token;\n\t\t\ttoken = filename + \":\" + token;\n\t\t\twhile (segdata.count(token)) {\n\t\t\t\tint idx = 1;\n\t\t\t\tif (segnamecnt.count(token))\n\t\t\t\t\tidx = segnamecnt.at(token);\n\t\t\t\tsegnamecnt[token] = idx + 1;\n\t\t\t\tchar buffer[64];\n\t\t\t\tsnprintf(buffer, 64, \"-%d\", idx);\n\t\t\t\ttoken += buffer;\n\t\t\t}\n\t\t\tsegptr = &segdata[token];\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (token == \"bit\") {\n\t\t\tassert(segptr != nullptr);\n\n\t\t\tf >> token;\n\t\t\tif (bit_ids.count(token) == 0) {\n\t\t\t\tbit_ids[token] = num_bits++;\n\t\t\t\tbit_ids_r.push_back(token);\n\t\t\t}\n\n\t\t\tint bit_idx = bit_ids.at(token);\n\t\t\tauto& bits = segdata_bits(*segptr);\n\n\t\t\tbits.set(bit_idx);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (token == \"tag\") {\n\t\t\tassert(segptr != nullptr);\n\n\t\t\tf >> token;\n\t\t\tif (tag_ids.count(token) == 0) {\n\t\t\t\ttag_ids[token] = num_tags++;\n\t\t\t\ttag_ids_r.push_back(token);\n\t\t\t}\n\n\t\t\tint tag_idx = tag_ids.at(token);\n\n\t\t\tf >> token;\n\t\t\tassert(token == \"0\" || token == \"1\");\n\n\t\t\tauto& tags = token == \"1\" ? segdata_tags1(*segptr)\n\t\t\t : segdata_tags0(*segptr);\n\n\t\t\ttags.set(tag_idx);\n\n\t\t\tif (FLAGS_i) {\n\t\t\t\tauto& inv_tags = token == \"1\"\n\t\t\t\t ? segdata_tags0(*segptr)\n\t\t\t\t : segdata_tags1(*segptr);\n\n\t\t\t\ttoken = tag_ids_r.at(tag_idx) + \"__INV\";\n\n\t\t\t\tif (tag_ids.count(token) == 0) {\n\t\t\t\t\ttag_ids[token] = num_tags++;\n\t\t\t\t\ttag_ids_r.push_back(token);\n\t\t\t\t}\n\n\t\t\t\tint inv_tag_idx = tag_ids.at(token);\n\t\t\t\tinv_tags.set(inv_tag_idx);\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tabort();\n\t}\n\n\t\/\/ printf(\"Number of segments: %d\\n\", int(segdata.size()));\n\t\/\/ printf(\"Number of bits: %d\\n\", num_bits);\n\t\/\/ printf(\"Number of tags: %d\\n\", num_tags);\n\n\tfor (auto& segdat : segdata) {\n\t\tsegdata_bits(segdat.second).resize(num_bits);\n\t\tsegdata_tags1(segdat.second).resize(num_tags);\n\t\tsegdata_tags0(segdat.second).resize(num_tags);\n\t}\n}\n\nint main(int argc, char** argv) {\n\tgflags::SetUsageMessage(\n\t absl::StrCat(\"Usage: \", argv[0], \" [options] file..\"));\n\tgflags::ParseCommandLineFlags(&argc, &argv, true);\n\n\tif (argc > 1) {\n\t\tfor (int optind = 1; optind < argc; optind++) {\n\t\t\tprintf(\"Reading %s.\\n\", argv[optind]);\n\t\t\tstd::ifstream f;\n\t\t\tf.open(argv[optind]);\n\n\t\t\t\/\/ Check if input file exists.\n\t\t\tif (!f.good()) {\n\t\t\t\tprintf(\"WARNING: Input file does not exist!\\n\");\n\t\t\t}\n\n\t\t\tassert(!f.fail());\n\t\t\tread_input(f, argv[optind]);\n\t\t}\n\t} else {\n\t\tprintf(\"Reading from stding.\\n\");\n\t\tread_input(std::cin, \"stdin\");\n\t}\n\n\tprintf(\"#of segments: %d\\n\", int(segdata.size()));\n\tprintf(\"#of bits: %d\\n\", num_bits);\n\tprintf(\"#of tags: %d\\n\", num_tags);\n\n\tFILE* f = stdout;\n\n\tif (!FLAGS_o.empty()) {\n\t\tf = fopen(FLAGS_o.c_str(), \"w\");\n\t\tassert(f != nullptr);\n\t}\n\n\tint cnt_const0 = 0;\n\tint cnt_const1 = 0;\n\tint cnt_candidates = 0;\n\tint min_candidates = num_bits;\n\tint max_candidates = 0;\n\tfloat avg_candidates = 0;\n\n\tstd::vector<std::string> out_lines;\n\n\tfor (int tag_idx = 0; tag_idx < num_tags; tag_idx++) {\n\t\tbool_vec mask(num_bits, true);\n\t\tint count1 = 0, count0 = 0;\n\n\t\tfor (auto& segdat : segdata) {\n\t\t\tauto& sd = segdat.second;\n\t\t\tbool tag1 = segdata_tags1(sd).get(tag_idx);\n\t\t\tbool tag0 = segdata_tags0(sd).get(tag_idx);\n\n\t\t\tassert(!tag1 || !tag0);\n\n\t\t\tif (tag1) {\n\t\t\t\tcount1++;\n\t\t\t\tmask.apply_and(segdata_bits(sd));\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (tag0) {\n\t\t\t\tcount0++;\n\t\t\t\tmask.apply_andc(segdata_bits(sd));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tassert(count1 || count0);\n\n\t\tstd::string out_line = tag_ids_r.at(tag_idx);\n\n\t\tif (count1 < FLAGS_m) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <m1 %d>\", count1);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (count0 < FLAGS_m) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <m0 %d>\", count0);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (count1 + count0 < FLAGS_M) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <M %d %d>\", count1, count0);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (!count1) {\n\t\t\tout_lines.push_back(out_line + \" <const0>\");\n\t\t\tcnt_const0 += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!count0) {\n\t\t\tout_line += \" <const1>\";\n\t\t\tcnt_const1 += 1;\n\t\t}\n\n\t\tint num_candidates = mask.count();\n\n\t\tif (count0) {\n\t\t\tmin_candidates =\n\t\t\t std::min(min_candidates, num_candidates);\n\t\t\tmax_candidates =\n\t\t\t std::max(max_candidates, num_candidates);\n\t\t\tavg_candidates += num_candidates;\n\t\t\tcnt_candidates += 1;\n\t\t}\n\n\t\tif (FLAGS_c < 0 ||\n\t\t (0 < num_candidates && num_candidates <= FLAGS_c)) {\n\t\t\tstd::vector<std::string> out_tags;\n\t\t\tfor (int bit_idx = 0; bit_idx < num_bits; bit_idx++)\n\t\t\t\tif (mask.get(bit_idx))\n\t\t\t\t\tout_tags.push_back(\n\t\t\t\t\t bit_ids_r.at(bit_idx));\n\t\t\tstd::sort(out_tags.begin(), out_tags.end());\n\t\t\tfor (auto& tag : out_tags)\n\t\t\t\tout_line += \" \" + tag;\n\t\t} else {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <%d candidates>\",\n\t\t\t num_candidates);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tout_lines.push_back(out_line);\n\t}\n\n\tstd::sort(out_lines.begin(), out_lines.end());\n\n\tfor (auto& line : out_lines)\n\t\tfprintf(f, \"%s\\n\", line.c_str());\n\n\tif (cnt_candidates)\n\t\tavg_candidates \/= cnt_candidates;\n\n\tprintf(\"#of const0 tags: %d\\n\", cnt_const0);\n\tprintf(\"#of const1 tags: %d\\n\", cnt_const1);\n\n\tif (cnt_candidates) {\n\t\tprintf(\"min #of candidates: %d\\n\", min_candidates);\n\t\tprintf(\"max #of candidates: %d\\n\", max_candidates);\n\t\tprintf(\"avg #of candidates: %.3f\\n\", avg_candidates);\n\t}\n\n\tif (!FLAGS_k.empty()) {\n\t\tf = fopen(FLAGS_k.c_str(), \"w\");\n\t\tassert(f != nullptr);\n\t\tstd::sort(bit_ids_r.begin(), bit_ids_r.end());\n\t\tfor (auto bit : bit_ids_r)\n\t\t\tfprintf(f, \"bit %s\\n\", bit.c_str());\n\t}\n\n\treturn 0;\n}\n<commit_msg>segmatch.cpp: if f_in does not exits returns -1<commit_after>#include <assert.h>\n#include <stdint.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\n\n#include <absl\/strings\/str_cat.h>\n#include <gflags\/gflags.h>\n\nDEFINE_int32(\n c,\n 4,\n \"threshold under which candidates are output. set to -1 to output all.\");\nDEFINE_bool(i, false, \"add inverted tags\");\nDEFINE_int32(m, 0, \"min number of set\/cleared samples each\");\nDEFINE_int32(M, 0, \"min number of set\/cleared samples total\");\nDEFINE_string(o, \"\", \"set output file\");\nDEFINE_string(k, \"\", \"set output mask file\");\n\nusing std::map;\nusing std::string;\nusing std::tuple;\nusing std::vector;\n\nint num_bits = 0, num_tags = 0;\nmap<string, int> bit_ids, tag_ids;\nvector<string> bit_ids_r, tag_ids_r;\n\n#if 0\nstruct bool_vec\n{\n\tvector<bool> data;\n\n\tbool_vec(int n = 0, bool initval = false) : data(n, initval)\n\t{\n\t}\n\n\tvoid set(int n)\n\t{\n\t\tif (int(data.size()) <= n)\n\t\t\tdata.resize(n+1);\n\t\tdata[n] = true;\n\t}\n\n\tbool get(int n)\n\t{\n\t\treturn data.at(n);\n\t}\n\n\tvoid resize(int n)\n\t{\n\t\tdata.resize(n);\n\t}\n\n\tint count()\n\t{\n\t\treturn std::accumulate(data.begin(), data.end(), 0);\n\t}\n\n\tvoid apply_and(const bool_vec &other)\n\t{\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] = data[i] && other.data[i];\n\t}\n\n\tvoid apply_andc(const bool_vec &other)\n\t{\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] = data[i] && !other.data[i];\n\t}\n};\n#else\nstruct bool_vec {\n\tvector<uint64_t> data;\n\n\tbool_vec(int n = 0, bool initval = false)\n\t : data((n + 63) \/ 64, initval ? ~uint64_t(0) : uint64_t(0)) {\n\t\tfor (int i = data.size() * 64 - 1; i >= n; i--)\n\t\t\tdata[n \/ 64] &= ~(uint64_t(1) << (n % 64));\n\t}\n\n\tvoid set(int n) {\n\t\tif (int(data.size() * 64) <= n)\n\t\t\tdata.resize((n + 64) \/ 64);\n\t\tdata[n \/ 64] |= uint64_t(1) << (n % 64);\n\t}\n\n\tbool get(int n) { return (data[n \/ 64] >> (n % 64)) & 1; }\n\n\tvoid resize(int n) { data.resize((n + 63) \/ 64); }\n\n\tint count() {\n\t\tint sum = 0;\n\t\tfor (int i = 0; i < 64 * int(data.size()); i++)\n\t\t\tif (get(i))\n\t\t\t\tsum++;\n\t\treturn sum;\n\t}\n\n\tvoid apply_and(const bool_vec& other) {\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] &= other.data[i];\n\t}\n\n\tvoid apply_andc(const bool_vec& other) {\n\t\tassert(data.size() == other.data.size());\n\t\tfor (int i = 0; i < int(data.size()); i++)\n\t\t\tdata[i] &= ~other.data[i];\n\t}\n};\n#endif\n\n\/\/ segname -> bits, tags_on, tags_off\ntypedef tuple<bool_vec, bool_vec, bool_vec> segdata_t;\nmap<string, segdata_t> segdata;\n\nmap<string, int> segnamecnt;\n\nstatic inline bool_vec& segdata_bits(segdata_t& sd) {\n\treturn std::get<0>(sd);\n}\nstatic inline bool_vec& segdata_tags1(segdata_t& sd) {\n\treturn std::get<1>(sd);\n}\nstatic inline bool_vec& segdata_tags0(segdata_t& sd) {\n\treturn std::get<2>(sd);\n}\n\nvoid read_input(std::istream& f, std::string filename) {\n\tstring token;\n\tsegdata_t* segptr = nullptr;\n\n\twhile (f >> token) {\n\t\tif (token == \"seg\") {\n\t\t\tf >> token;\n\t\t\ttoken = filename + \":\" + token;\n\t\t\twhile (segdata.count(token)) {\n\t\t\t\tint idx = 1;\n\t\t\t\tif (segnamecnt.count(token))\n\t\t\t\t\tidx = segnamecnt.at(token);\n\t\t\t\tsegnamecnt[token] = idx + 1;\n\t\t\t\tchar buffer[64];\n\t\t\t\tsnprintf(buffer, 64, \"-%d\", idx);\n\t\t\t\ttoken += buffer;\n\t\t\t}\n\t\t\tsegptr = &segdata[token];\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (token == \"bit\") {\n\t\t\tassert(segptr != nullptr);\n\n\t\t\tf >> token;\n\t\t\tif (bit_ids.count(token) == 0) {\n\t\t\t\tbit_ids[token] = num_bits++;\n\t\t\t\tbit_ids_r.push_back(token);\n\t\t\t}\n\n\t\t\tint bit_idx = bit_ids.at(token);\n\t\t\tauto& bits = segdata_bits(*segptr);\n\n\t\t\tbits.set(bit_idx);\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (token == \"tag\") {\n\t\t\tassert(segptr != nullptr);\n\n\t\t\tf >> token;\n\t\t\tif (tag_ids.count(token) == 0) {\n\t\t\t\ttag_ids[token] = num_tags++;\n\t\t\t\ttag_ids_r.push_back(token);\n\t\t\t}\n\n\t\t\tint tag_idx = tag_ids.at(token);\n\n\t\t\tf >> token;\n\t\t\tassert(token == \"0\" || token == \"1\");\n\n\t\t\tauto& tags = token == \"1\" ? segdata_tags1(*segptr)\n\t\t\t : segdata_tags0(*segptr);\n\n\t\t\ttags.set(tag_idx);\n\n\t\t\tif (FLAGS_i) {\n\t\t\t\tauto& inv_tags = token == \"1\"\n\t\t\t\t ? segdata_tags0(*segptr)\n\t\t\t\t : segdata_tags1(*segptr);\n\n\t\t\t\ttoken = tag_ids_r.at(tag_idx) + \"__INV\";\n\n\t\t\t\tif (tag_ids.count(token) == 0) {\n\t\t\t\t\ttag_ids[token] = num_tags++;\n\t\t\t\t\ttag_ids_r.push_back(token);\n\t\t\t\t}\n\n\t\t\t\tint inv_tag_idx = tag_ids.at(token);\n\t\t\t\tinv_tags.set(inv_tag_idx);\n\t\t\t}\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tabort();\n\t}\n\n\t\/\/ printf(\"Number of segments: %d\\n\", int(segdata.size()));\n\t\/\/ printf(\"Number of bits: %d\\n\", num_bits);\n\t\/\/ printf(\"Number of tags: %d\\n\", num_tags);\n\n\tfor (auto& segdat : segdata) {\n\t\tsegdata_bits(segdat.second).resize(num_bits);\n\t\tsegdata_tags1(segdat.second).resize(num_tags);\n\t\tsegdata_tags0(segdat.second).resize(num_tags);\n\t}\n}\n\nint main(int argc, char** argv) {\n\tgflags::SetUsageMessage(\n\t absl::StrCat(\"Usage: \", argv[0], \" [options] file..\"));\n\tgflags::ParseCommandLineFlags(&argc, &argv, true);\n\n\tif (argc > 1) {\n\t\tfor (int optind = 1; optind < argc; optind++) {\n\t\t\tprintf(\"Reading %s.\\n\", argv[optind]);\n\t\t\tstd::ifstream f;\n\t\t\tf.open(argv[optind]);\n\n\t\t\t\/\/ Check if input file exists.\n\t\t\tif (!f.good()) {\n\t\t\t\tprintf(\"ERROR: Input file does not exist!\\n\");\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tassert(!f.fail());\n\t\t\tread_input(f, argv[optind]);\n\t\t}\n\t} else {\n\t\tprintf(\"Reading from stding.\\n\");\n\t\tread_input(std::cin, \"stdin\");\n\t}\n\n\tprintf(\"#of segments: %d\\n\", int(segdata.size()));\n\tprintf(\"#of bits: %d\\n\", num_bits);\n\tprintf(\"#of tags: %d\\n\", num_tags);\n\n\tFILE* f = stdout;\n\n\tif (!FLAGS_o.empty()) {\n\t\tf = fopen(FLAGS_o.c_str(), \"w\");\n\t\tassert(f != nullptr);\n\t}\n\n\tint cnt_const0 = 0;\n\tint cnt_const1 = 0;\n\tint cnt_candidates = 0;\n\tint min_candidates = num_bits;\n\tint max_candidates = 0;\n\tfloat avg_candidates = 0;\n\n\tstd::vector<std::string> out_lines;\n\n\tfor (int tag_idx = 0; tag_idx < num_tags; tag_idx++) {\n\t\tbool_vec mask(num_bits, true);\n\t\tint count1 = 0, count0 = 0;\n\n\t\tfor (auto& segdat : segdata) {\n\t\t\tauto& sd = segdat.second;\n\t\t\tbool tag1 = segdata_tags1(sd).get(tag_idx);\n\t\t\tbool tag0 = segdata_tags0(sd).get(tag_idx);\n\n\t\t\tassert(!tag1 || !tag0);\n\n\t\t\tif (tag1) {\n\t\t\t\tcount1++;\n\t\t\t\tmask.apply_and(segdata_bits(sd));\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (tag0) {\n\t\t\t\tcount0++;\n\t\t\t\tmask.apply_andc(segdata_bits(sd));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t\tassert(count1 || count0);\n\n\t\tstd::string out_line = tag_ids_r.at(tag_idx);\n\n\t\tif (count1 < FLAGS_m) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <m1 %d>\", count1);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (count0 < FLAGS_m) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <m0 %d>\", count0);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (count1 + count0 < FLAGS_M) {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <M %d %d>\", count1, count0);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tif (!count1) {\n\t\t\tout_lines.push_back(out_line + \" <const0>\");\n\t\t\tcnt_const0 += 1;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (!count0) {\n\t\t\tout_line += \" <const1>\";\n\t\t\tcnt_const1 += 1;\n\t\t}\n\n\t\tint num_candidates = mask.count();\n\n\t\tif (count0) {\n\t\t\tmin_candidates =\n\t\t\t std::min(min_candidates, num_candidates);\n\t\t\tmax_candidates =\n\t\t\t std::max(max_candidates, num_candidates);\n\t\t\tavg_candidates += num_candidates;\n\t\t\tcnt_candidates += 1;\n\t\t}\n\n\t\tif (FLAGS_c < 0 ||\n\t\t (0 < num_candidates && num_candidates <= FLAGS_c)) {\n\t\t\tstd::vector<std::string> out_tags;\n\t\t\tfor (int bit_idx = 0; bit_idx < num_bits; bit_idx++)\n\t\t\t\tif (mask.get(bit_idx))\n\t\t\t\t\tout_tags.push_back(\n\t\t\t\t\t bit_ids_r.at(bit_idx));\n\t\t\tstd::sort(out_tags.begin(), out_tags.end());\n\t\t\tfor (auto& tag : out_tags)\n\t\t\t\tout_line += \" \" + tag;\n\t\t} else {\n\t\t\tchar buffer[64];\n\t\t\tsnprintf(buffer, 64, \" <%d candidates>\",\n\t\t\t num_candidates);\n\t\t\tout_line += buffer;\n\t\t}\n\n\t\tout_lines.push_back(out_line);\n\t}\n\n\tstd::sort(out_lines.begin(), out_lines.end());\n\n\tfor (auto& line : out_lines)\n\t\tfprintf(f, \"%s\\n\", line.c_str());\n\n\tif (cnt_candidates)\n\t\tavg_candidates \/= cnt_candidates;\n\n\tprintf(\"#of const0 tags: %d\\n\", cnt_const0);\n\tprintf(\"#of const1 tags: %d\\n\", cnt_const1);\n\n\tif (cnt_candidates) {\n\t\tprintf(\"min #of candidates: %d\\n\", min_candidates);\n\t\tprintf(\"max #of candidates: %d\\n\", max_candidates);\n\t\tprintf(\"avg #of candidates: %.3f\\n\", avg_candidates);\n\t}\n\n\tif (!FLAGS_k.empty()) {\n\t\tf = fopen(FLAGS_k.c_str(), \"w\");\n\t\tassert(f != nullptr);\n\t\tstd::sort(bit_ids_r.begin(), bit_ids_r.end());\n\t\tfor (auto bit : bit_ids_r)\n\t\t\tfprintf(f, \"bit %s\\n\", bit.c_str());\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* $Id: http.C,v 1.1 2002\/05\/01 20:35:09 jsr Exp $ *\/\n\n\/*\n *\n * Copyright (C) 2000 David Mazieres (dm@uun.org)\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License as\n * published by the Free Software Foundation; either version 2, or (at\n * your option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307\n * USA\n *\n *\/\n\n#include \"http.h\"\n#include \"rxx.h\"\n#include \"sha1.h\"\n#include <pwd.h>\n\nstatic rxx hdrnameval (\"^([^\\\\s:]+):\\\\s*(.*)\\r?\\n\\\\z\", \"s\");\n\nstr\nsuio_remstr (suio *uio, size_t n)\n{\n mstr m (n);\n uio->copyout (m, n);\n uio->rembytes (n);\n return m;\n}\n\nstr\nhashstr (str src)\n{\n char hash[sha1::hashsize];\n sha1_hash (hash, src, src.len ());\n return armor32 (hash, sizeof (hash));\n}\n\nstr\nhttptime ()\n{\n char buf[30];\n time_t now = time (NULL);\n int n = strftime (buf, 30, \"%a, %d %b %Y %H:%M:%S GMT\", gmtime (&now));\n assert (n == 29);\n return buf;\n}\n\nstr\nhttperror (int status, str statmsg, str url, str description)\n{\n static str server;\n if (!server) {\n struct passwd *pw = NULL;\n if (char *login = getlogin ())\n pw = getpwnam (login);\n if (!pw)\n pw = getpwuid (getuid ());\n if (pw && *pw->pw_gecos)\n server = strbuf (\"%s's proxy server\", pw->pw_gecos);\n else\n server = \"G22.3033-010 proxy server\";\n }\n\n strbuf body;\n body << \"<HTML><HEAD>\\n\\\n<TITLE>ERROR: The requested URL could not be retrieved<\/TITLE>\\n\\\n<\/HEAD><BODY>\\n\\\n<H1>ERROR<\/H1>\\n\\\n<H2>The requested URL could not be retrieved<\/H2>\\n\\\n<HR>\\n\\\n<P>\\n\\\nWhile trying to retrieve the URL:\\n\"\n << \"<A HREF=\\\"\" << url << \"\\\">\" << url << \"<\/A>\\n\\\n<P>\\n\\\nThe following error was encountered:\\n\\\n<P>\\n\"\n << \"<STRONG>\" << description << \"<\/STRONG><BR>\\n\"\n << \"<P>\" << server << \" at \" << myname () << \"\\n\"\n << \"<\/BODY><\/HTML>\\n\";\n\n strbuf head (\"HTTP\/1.0 %03d \", status);\n head << statmsg << \"\\r\\n\";\n str now = httptime ();\n head << \"Mime-Version: 1.0\\r\\nContent-Type: text\/html\\r\\n\"\n << \"Content-Length: \" << body.tosuio ()->resid () << \"\\r\\n\"\n << \"Server: \" << server << \"\\r\\n\"\n << \"Date: \" << now << \"\\r\\n\"\n << \"Expires: \" << now << \"\\r\\n\\r\\n\";\n head.tosuio ()->take (body.tosuio ());\n return head;\n}\n\nstr\nhttpparse::gethdr (suio *uio)\n{\n size_t n = 0;\n for (const iovec *v = uio->iov (), *e = uio->iovlim ();\n v < e; n += v++->iov_len) {\n const char *base = static_cast<char *> (v->iov_base);\n const char *lim = base + v->iov_len;\n const char *p = base;\n while ((p = static_cast<char *> (memchr (p, '\\n', v->iov_len)))) {\n p++;\n if (n + (p - base) == 1) {\n\tuio->rembytes (1);\n\treturn \"\";\n }\n if (n + (p - base) == 2\n\t && *static_cast<char *> (uio->iov ()->iov_base) == '\\r') {\n\tuio->rembytes (2);\n\treturn \"\";\n }\n if (p < lim) {\n\tif (*p == ' ' || *p == '\\t')\n\t continue;\n }\n else if (v + 1 < e) {\n\tif (*static_cast<char *> (v[1].iov_base) == ' '\n\t || *static_cast<char *> (v[1].iov_base) == '\\t')\n\t continue;\n }\n else\n\t\/* Might or might not have complete line, need next char to tell. *\/\n\treturn NULL;\n return suio_remstr (uio, n + (p - base));\n }\n }\n return NULL;\n}\n\nstr\nhttpparse::hdrname (str hdr)\n{\n if (!hdrnameval.search (hdr))\n return NULL;\n return str2lower (hdrnameval[1]);\n}\n\nstr\nhttpparse::hdrval (str hdr)\n{\n if (!hdrnameval.search (hdr))\n panic << \"hdrval: bad header: \" << hdr << \"\\n\";\n return hdrnameval[2];\n}\n\ntime_t\nhttpparse::parsetime (const char *text)\n{\n time_t t;\n struct tm stm;\n bzero (&stm, sizeof (stm));\n if (!strptime (text, \"%a, %d %b %Y %H:%M:%S GMT\", &stm)\n && !strptime (text, \"%a %b %d %H:%M:%S %Y\", &stm))\n return -1;\n t = mktime (&stm);\n t += stm.tm_gmtoff;\n return t;\n}\n\nbool\nhttpparse::checkpragma (str val, str pragma)\n{\n strbuf rxb;\n rxb << \"(^|,)\\\\s*\";\n for (const char *p = pragma, *e = p + pragma.len (); p < e; p++)\n if (isalnum (*p))\n rxb.tosuio ()->print (p, 1);\n else {\n rxb.tosuio ()->print (\"\\\\\", 1);\n rxb.tosuio ()->print (p, 1);\n }\n rxb << \"\\\\s*(,|$)\";\n str s (rxb);\n rxx pragmarx (s, \"i\");\n return pragmarx.search (val);\n}\n\nstatic rxx urlrx (\"^http:\/\/([\\\\w.-]+)(:(\\\\d+))?(\/\\\\S*)?\", \"i\");\nbool\nhttpparse::parseurl (str *host, u_int16_t *port, str *path, str url)\n{\n if (!urlrx.search (url))\n return false;\n *host = str2lower (urlrx[1]);\n *port = 80;\n if (str p = urlrx[3])\n convertint (p, port);\n\n if (!(*path = urlrx[4]))\n *path = \"\/\";\n return true;\n}\n\nextern char hostname[1024];\nextern int hostport;\n\nstatic rxx reqrx (\"^(\\\\S+)\\\\s+(\/\\\\S*)\", \"i\");\nbool\nhttpparse::parsereq (str *method, str *url, str line)\n{\n if (!reqrx.search (line))\n return false;\n *method = str2upper (reqrx[1]);\n\n if (hostport == 80)\n *url = strbuf () << \"http:\/\/\" << hostname << reqrx[2];\n else\n *url = strbuf () << \"http:\/\/\" << hostname << \":\" << hostport << reqrx[2];\n\n return true;\n}\n\nstatic rxx resprx (\"^HTTP\/\\\\d+\\\\.\\\\d+\\\\s+([1-5]\\\\d\\\\d)\\\\s+(.*)\", \"i\");\nbool\nhttpparse::parseresp (int *status, str *msg, str line)\n{\n if (!resprx.search (line))\n return false;\n convertint (resprx[1], status);\n *msg = resprx[2];\n return true;\n}\n\nint\nhttpparse::parse (suio *uio)\n{\n while (str h = gethdr (uio)) {\n if (!firstdone) {\n if (!dofirst (h))\n\treturn -1;\n firstdone = true;\n continue;\n }\n if (!h.len ())\n return 1;\n if (!hdrnameval.search (h))\n return -1;\n if (!doheader (str2lower (hdrnameval[1]), hdrnameval[2]))\n headers << h;\n }\n return 0;\n}\n\nbool\nhttpreq::dofirst (str line)\n{\n if (!parsereq (&method, &url, line)\n || !parseurl (&host, &port, &path, url))\n return false;\n headers << method << \" \" << path << \" HTTP\/1.0\\r\\n\";\n urlhash = hashstr (url);\n return true;\n}\n\nbool\nhttpreq::doheader (str name, str val)\n{\n if (name == \"pragma\") {\n if (checkpragma (val, \"no-cache\"))\n nocache = true;\n }\n else if (name == \"if-modified-since\") {\n if_modified_since = parsetime (val);\n }\n else if (name == \"content-length\")\n content_length = atoi (val.cstr ());\n \/\/ convertint (val, &content_length);\n else if (name == \"authorization\")\n authorization = val;\n else if (name == \"referer\")\n parseurl(&referer_host, &r_port, &r_path, val);\n return false;\n}\n\nbool\nhttpresp::dofirst (str line)\n{\n if (!parseresp (&status, &statusmsg, line))\n return false;\n headers << line;\n return true;\n}\n\nbool\nhttpresp::doheader (str name, str val)\n{\n if (name == \"pragma\") {\n if (checkpragma (val, \"no-cache\"))\n nocache = true;\n }\n else if (name == \"date\")\n date = parsetime (val);\n else if (name == \"expires\")\n expires = parsetime (val);\n else if (name == \"last-modified\")\n last_modified = parsetime (val);\n else if (name == \"content-length\")\n content_length = atoi (val.cstr ());\n return false;\n}\n<commit_msg>*** empty log message ***<commit_after>\/* $Id: http.C,v 1.2 2002\/05\/17 00:00:28 jsr Exp $ *\/\n\n\/*\n *\n * Copyright (C) 2000 David Mazieres (dm@uun.org)\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License as\n * published by the Free Software Foundation; either version 2, or (at\n * your option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307\n * USA\n *\n *\/\n\n#include \"http.h\"\n#include \"rxx.h\"\n#include \"sha1.h\"\n#include <pwd.h>\n#include <time.h>\n\nstatic rxx hdrnameval (\"^([^\\\\s:]+):\\\\s*(.*)\\r?\\n\\\\z\", \"s\");\n\nstr\nsuio_remstr (suio *uio, size_t n)\n{\n mstr m (n);\n uio->copyout (m, n);\n uio->rembytes (n);\n return m;\n}\n\nstr\nhashstr (str src)\n{\n char hash[sha1::hashsize];\n sha1_hash (hash, src, src.len ());\n return armor32 (hash, sizeof (hash));\n}\n\nstr\nhttptime ()\n{\n char buf[30];\n time_t now = time (NULL);\n int n = strftime (buf, 30, \"%a, %d %b %Y %H:%M:%S GMT\", gmtime (&now));\n assert (n == 29);\n return buf;\n}\n\nstr\nhttperror (int status, str statmsg, str url, str description)\n{\n static str server;\n if (!server) {\n struct passwd *pw = NULL;\n if (char *login = getlogin ())\n pw = getpwnam (login);\n if (!pw)\n pw = getpwuid (getuid ());\n if (pw && *pw->pw_gecos)\n server = strbuf (\"%s's proxy server\", pw->pw_gecos);\n else\n server = \"G22.3033-010 proxy server\";\n }\n\n strbuf body;\n body << \"<HTML><HEAD>\\n\\\n<TITLE>ERROR: The requested URL could not be retrieved<\/TITLE>\\n\\\n<\/HEAD><BODY>\\n\\\n<H1>ERROR<\/H1>\\n\\\n<H2>The requested URL could not be retrieved<\/H2>\\n\\\n<HR>\\n\\\n<P>\\n\\\nWhile trying to retrieve the URL:\\n\"\n << \"<A HREF=\\\"\" << url << \"\\\">\" << url << \"<\/A>\\n\\\n<P>\\n\\\nThe following error was encountered:\\n\\\n<P>\\n\"\n << \"<STRONG>\" << description << \"<\/STRONG><BR>\\n\"\n << \"<P>\" << server << \" at \" << myname () << \"\\n\"\n << \"<\/BODY><\/HTML>\\n\";\n\n strbuf head (\"HTTP\/1.0 %03d \", status);\n head << statmsg << \"\\r\\n\";\n str now = httptime ();\n head << \"Mime-Version: 1.0\\r\\nContent-Type: text\/html\\r\\n\"\n << \"Content-Length: \" << body.tosuio ()->resid () << \"\\r\\n\"\n << \"Server: \" << server << \"\\r\\n\"\n << \"Date: \" << now << \"\\r\\n\"\n << \"Expires: \" << now << \"\\r\\n\\r\\n\";\n head.tosuio ()->take (body.tosuio ());\n return head;\n}\n\nstr\nhttpparse::gethdr (suio *uio)\n{\n size_t n = 0;\n for (const iovec *v = uio->iov (), *e = uio->iovlim ();\n v < e; n += v++->iov_len) {\n const char *base = static_cast<char *> (v->iov_base);\n const char *lim = base + v->iov_len;\n const char *p = base;\n while ((p = static_cast<char *> (memchr (p, '\\n', v->iov_len)))) {\n p++;\n if (n + (p - base) == 1) {\n\tuio->rembytes (1);\n\treturn \"\";\n }\n if (n + (p - base) == 2\n\t && *static_cast<char *> (uio->iov ()->iov_base) == '\\r') {\n\tuio->rembytes (2);\n\treturn \"\";\n }\n if (p < lim) {\n\tif (*p == ' ' || *p == '\\t')\n\t continue;\n }\n else if (v + 1 < e) {\n\tif (*static_cast<char *> (v[1].iov_base) == ' '\n\t || *static_cast<char *> (v[1].iov_base) == '\\t')\n\t continue;\n }\n else\n\t\/* Might or might not have complete line, need next char to tell. *\/\n\treturn NULL;\n return suio_remstr (uio, n + (p - base));\n }\n }\n return NULL;\n}\n\nstr\nhttpparse::hdrname (str hdr)\n{\n if (!hdrnameval.search (hdr))\n return NULL;\n return str2lower (hdrnameval[1]);\n}\n\nstr\nhttpparse::hdrval (str hdr)\n{\n if (!hdrnameval.search (hdr))\n panic << \"hdrval: bad header: \" << hdr << \"\\n\";\n return hdrnameval[2];\n}\n\ntime_t\nhttpparse::parsetime (const char *text)\n{\n time_t t;\n struct tm stm;\n bzero (&stm, sizeof (stm));\n if (!strptime (text, \"%a, %d %b %Y %H:%M:%S GMT\", &stm)\n && !strptime (text, \"%a %b %d %H:%M:%S %Y\", &stm))\n return -1;\n t = mktime (&stm);\n t += stm.tm_gmtoff;\n return t;\n}\n\nbool\nhttpparse::checkpragma (str val, str pragma)\n{\n strbuf rxb;\n rxb << \"(^|,)\\\\s*\";\n for (const char *p = pragma, *e = p + pragma.len (); p < e; p++)\n if (isalnum (*p))\n rxb.tosuio ()->print (p, 1);\n else {\n rxb.tosuio ()->print (\"\\\\\", 1);\n rxb.tosuio ()->print (p, 1);\n }\n rxb << \"\\\\s*(,|$)\";\n str s (rxb);\n rxx pragmarx (s, \"i\");\n return pragmarx.search (val);\n}\n\nstatic rxx urlrx (\"^http:\/\/([\\\\w.-]+)(:(\\\\d+))?(\/\\\\S*)?\", \"i\");\nbool\nhttpparse::parseurl (str *host, u_int16_t *port, str *path, str url)\n{\n if (!urlrx.search (url))\n return false;\n *host = str2lower (urlrx[1]);\n *port = 80;\n if (str p = urlrx[3])\n convertint (p, port);\n\n if (!(*path = urlrx[4]))\n *path = \"\/\";\n return true;\n}\n\nextern char hostname[1024];\nextern int hostport;\n\nstatic rxx reqrx (\"^(\\\\S+)\\\\s+(\/\\\\S*)\", \"i\");\nbool\nhttpparse::parsereq (str *method, str *url, str line)\n{\n if (!reqrx.search (line))\n return false;\n *method = str2upper (reqrx[1]);\n\n if (hostport == 80)\n *url = strbuf () << \"http:\/\/\" << hostname << reqrx[2];\n else\n *url = strbuf () << \"http:\/\/\" << hostname << \":\" << hostport << reqrx[2];\n\n return true;\n}\n\nstatic rxx resprx (\"^HTTP\/\\\\d+\\\\.\\\\d+\\\\s+([1-5]\\\\d\\\\d)\\\\s+(.*)\", \"i\");\nbool\nhttpparse::parseresp (int *status, str *msg, str line)\n{\n if (!resprx.search (line))\n return false;\n convertint (resprx[1], status);\n *msg = resprx[2];\n return true;\n}\n\nint\nhttpparse::parse (suio *uio)\n{\n while (str h = gethdr (uio)) {\n if (!firstdone) {\n if (!dofirst (h))\n\treturn -1;\n firstdone = true;\n continue;\n }\n if (!h.len ())\n return 1;\n if (!hdrnameval.search (h))\n return -1;\n if (!doheader (str2lower (hdrnameval[1]), hdrnameval[2]))\n headers << h;\n }\n return 0;\n}\n\nbool\nhttpreq::dofirst (str line)\n{\n if (!parsereq (&method, &url, line)\n || !parseurl (&host, &port, &path, url))\n return false;\n headers << method << \" \" << path << \" HTTP\/1.0\\r\\n\";\n urlhash = hashstr (url);\n return true;\n}\n\nbool\nhttpreq::doheader (str name, str val)\n{\n if (name == \"pragma\") {\n if (checkpragma (val, \"no-cache\"))\n nocache = true;\n }\n else if (name == \"if-modified-since\") {\n if_modified_since = parsetime (val);\n }\n else if (name == \"content-length\")\n content_length = atoi (val.cstr ());\n \/\/ convertint (val, &content_length);\n else if (name == \"authorization\")\n authorization = val;\n else if (name == \"referer\")\n parseurl(&referer_host, &r_port, &r_path, val);\n return false;\n}\n\nbool\nhttpresp::dofirst (str line)\n{\n if (!parseresp (&status, &statusmsg, line))\n return false;\n headers << line;\n return true;\n}\n\nbool\nhttpresp::doheader (str name, str val)\n{\n if (name == \"pragma\") {\n if (checkpragma (val, \"no-cache\"))\n nocache = true;\n }\n else if (name == \"date\")\n date = parsetime (val);\n else if (name == \"expires\")\n expires = parsetime (val);\n else if (name == \"last-modified\")\n last_modified = parsetime (val);\n else if (name == \"content-length\")\n content_length = atoi (val.cstr ());\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n\n This file is part of Lasercake.\n\n Lasercake is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Lasercake is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Lasercake. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"world.hpp\"\n#include \"data_structures\/borrowed_bitset.hpp\"\n#include \"object_and_tile_iteration.hpp\"\n#include \"data_structures\/polygon_collision_detection.hpp\"\n\nconst int SUN_AREA_SIZE = 5000;\n\n\nstruct sunlight_visitor {\n sunlight_visitor(world *w, vector3<fine_scalar> sun_direction): packets(SUN_AREA_SIZE*SUN_AREA_SIZE),w(w),sun_direction(sun_direction) {}\n borrowed_bitset packets;\n octant_number octant()const { return vector_octant(sun_direction); }\n octant_number octant_; \/\/e.g. from vector_octant()\n\n int do_poly(convex_polyhedron const& p) {\n int result = 0;\n int max_x, max_y, min_x, min_y;\n bool any = false;\n for (vector3<fine_scalar> const& v : p.vertices()) {\n vector3<fine_scalar> projected_vertex = v;\n projected_vertex -= world_center_fine_coords;\n \/*projected_vertex[X] -= projected_vertex(Z) * sun_direction(X) \/ sun_direction(Z);\n projected_vertex[Y] -= projected_vertex(Z) * sun_direction(Y) \/ sun_direction(Z);\n projected_vertex[Z] = 0;\n\n projected_vertex[X] = (projected_vertex(X) * 10 \/ tile_width) + (SUN_AREA_SIZE \/ 2);\n projected_vertex[Y] = (projected_vertex(Y) * 10 \/ tile_width) + (SUN_AREA_SIZE \/ 2);*\/\n projected_vertex[X] = ((projected_vertex(X) * sun_direction(Z) - projected_vertex(Z) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n projected_vertex[Y] = ((projected_vertex(Y) * sun_direction(Z) - projected_vertex(Z) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n if (!any || projected_vertex(X) > max_x) max_x = projected_vertex(X);\n if (!any || projected_vertex(Y) > max_y) max_y = projected_vertex(Y);\n if (!any || projected_vertex(X) < min_x) min_x = projected_vertex(X);\n if (!any || projected_vertex(Y) < min_y) min_y = projected_vertex(Y);\n any = true;\n }\n assert(any);\n if (min_x < 0) min_x = 0;\n if (min_y < 0) min_y = 0;\n if (max_x >= SUN_AREA_SIZE-1) max_x = SUN_AREA_SIZE-1;\n if (max_y >= SUN_AREA_SIZE-1) max_y = SUN_AREA_SIZE-1;\n\n for (int x = min_x; x <= max_x; ++x) {\n for (int y = min_y; y <= max_y; ++y) {\n result += !packets.test(x*SUN_AREA_SIZE + y);\n packets.set(x*SUN_AREA_SIZE + y);\n }\n }\n return result;\n }\n \n int do_bbox(bounding_box bb) {\n int result = 0;\n\n bb.translate(-world_center_fine_coords);\n \n fine_scalar max_x = ((bb.max(X) * sun_direction(Z) - (sun_direction(X) > 0 ? bb.max(Z) : bb.min(Z)) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar min_x = ((bb.min(X) * sun_direction(Z) - (sun_direction(X) > 0 ? bb.min(Z) : bb.max(Z)) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar max_y = ((bb.max(Y) * sun_direction(Z) - (sun_direction(Y) > 0 ? bb.max(Z) : bb.min(Z)) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar min_y = ((bb.min(Y) * sun_direction(Z) - (sun_direction(Y) > 0 ? bb.min(Z) : bb.max(Z)) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n \n if (min_x < 0) min_x = 0;\n if (min_y < 0) min_y = 0;\n if (max_x >= SUN_AREA_SIZE-1) max_x = SUN_AREA_SIZE-1;\n if (max_y >= SUN_AREA_SIZE-1) max_y = SUN_AREA_SIZE-1;\n \/\/std::cerr << max_x - min_x << \"\\n\" << max_y - min_y << \"!\\n\";\n\n for (int x = min_x; x <= max_x; ++x) {\n for (int y = min_y; y <= max_y; ++y) {\n result += !packets.test(x*SUN_AREA_SIZE + y);\n packets.set(x*SUN_AREA_SIZE + y);\n }\n }\n return result;\n }\n \n int do_shape(shape const& s) {\n int result = 0;\n for (convex_polyhedron const& p : s.get_polyhedra()) {\n result += do_poly(p);\n }\n for (bounding_box const& b : s.get_boxes()) {\n result += do_bbox(b);\n }\n return result;\n }\n \n void found(tile_location const& loc) {\n w->litnesses_.insert(std::pair<object_or_tile_identifier, int>(loc, 0)).first->second += do_bbox(fine_bounding_box_of_tile(loc.coords()));\n }\n void found(object_identifier oid) {\n shape const* ods = find_as_pointer(w->get_object_detail_shapes(), oid); assert(ods);\n w->litnesses_.insert(std::pair<object_or_tile_identifier, int>(oid, 0)).first->second += do_shape(*ods);\n }\n\n world *w;\n vector3<fine_scalar> sun_direction;\n};\n\nvoid world::update_light(vector3<fine_scalar> sun_direction)\n{\n litnesses_.clear();\n std::unique_ptr<sunlight_visitor> sv(new sunlight_visitor(this, sun_direction));\n visit_collidable_tiles_and_objects(*sv);\n}\n<commit_msg>Tweaked the borrowed_bitset optimization<commit_after>\/*\n\n Copyright Eli Dupree and Isaac Dupree, 2011, 2012\n\n This file is part of Lasercake.\n\n Lasercake is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Lasercake is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with Lasercake. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"world.hpp\"\n#include \"data_structures\/borrowed_bitset.hpp\"\n#include \"object_and_tile_iteration.hpp\"\n#include \"data_structures\/polygon_collision_detection.hpp\"\n\nconst int SUN_AREA_SIZE = 5000;\n\n\nstruct sunlight_visitor {\n sunlight_visitor(world *w, vector3<fine_scalar> sun_direction): packets(SUN_AREA_SIZE*SUN_AREA_SIZE),w(w),sun_direction(sun_direction) {}\n borrowed_bitset_that_always_clears_using_memset packets;\n octant_number octant()const { return vector_octant(sun_direction); }\n octant_number octant_; \/\/e.g. from vector_octant()\n\n int do_poly(convex_polyhedron const& p) {\n int result = 0;\n int max_x, max_y, min_x, min_y;\n bool any = false;\n for (vector3<fine_scalar> const& v : p.vertices()) {\n vector3<fine_scalar> projected_vertex = v;\n projected_vertex -= world_center_fine_coords;\n \/*projected_vertex[X] -= projected_vertex(Z) * sun_direction(X) \/ sun_direction(Z);\n projected_vertex[Y] -= projected_vertex(Z) * sun_direction(Y) \/ sun_direction(Z);\n projected_vertex[Z] = 0;\n\n projected_vertex[X] = (projected_vertex(X) * 10 \/ tile_width) + (SUN_AREA_SIZE \/ 2);\n projected_vertex[Y] = (projected_vertex(Y) * 10 \/ tile_width) + (SUN_AREA_SIZE \/ 2);*\/\n projected_vertex[X] = ((projected_vertex(X) * sun_direction(Z) - projected_vertex(Z) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n projected_vertex[Y] = ((projected_vertex(Y) * sun_direction(Z) - projected_vertex(Z) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n if (!any || projected_vertex(X) > max_x) max_x = projected_vertex(X);\n if (!any || projected_vertex(Y) > max_y) max_y = projected_vertex(Y);\n if (!any || projected_vertex(X) < min_x) min_x = projected_vertex(X);\n if (!any || projected_vertex(Y) < min_y) min_y = projected_vertex(Y);\n any = true;\n }\n assert(any);\n if (min_x < 0) min_x = 0;\n if (min_y < 0) min_y = 0;\n if (max_x >= SUN_AREA_SIZE-1) max_x = SUN_AREA_SIZE-1;\n if (max_y >= SUN_AREA_SIZE-1) max_y = SUN_AREA_SIZE-1;\n\n for (int x = min_x; x <= max_x; ++x) {\n for (int y = min_y; y <= max_y; ++y) {\n result += !packets.test(x*SUN_AREA_SIZE + y);\n packets.set(x*SUN_AREA_SIZE + y);\n }\n }\n return result;\n }\n \n int do_bbox(bounding_box bb) {\n int result = 0;\n\n bb.translate(-world_center_fine_coords);\n \n fine_scalar max_x = ((bb.max(X) * sun_direction(Z) - (sun_direction(X) > 0 ? bb.max(Z) : bb.min(Z)) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar min_x = ((bb.min(X) * sun_direction(Z) - (sun_direction(X) > 0 ? bb.min(Z) : bb.max(Z)) * sun_direction(X)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar max_y = ((bb.max(Y) * sun_direction(Z) - (sun_direction(Y) > 0 ? bb.max(Z) : bb.min(Z)) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n fine_scalar min_y = ((bb.min(Y) * sun_direction(Z) - (sun_direction(Y) > 0 ? bb.min(Z) : bb.max(Z)) * sun_direction(Y)) * 10 \/ (tile_width * sun_direction(Z))) + (SUN_AREA_SIZE \/ 2);\n \n if (min_x < 0) min_x = 0;\n if (min_y < 0) min_y = 0;\n if (max_x >= SUN_AREA_SIZE-1) max_x = SUN_AREA_SIZE-1;\n if (max_y >= SUN_AREA_SIZE-1) max_y = SUN_AREA_SIZE-1;\n \/\/std::cerr << max_x - min_x << \"\\n\" << max_y - min_y << \"!\\n\";\n\n for (int x = min_x; x <= max_x; ++x) {\n for (int y = min_y; y <= max_y; ++y) {\n result += !packets.test(x*SUN_AREA_SIZE + y);\n packets.set(x*SUN_AREA_SIZE + y);\n }\n }\n return result;\n }\n \n int do_shape(shape const& s) {\n int result = 0;\n for (convex_polyhedron const& p : s.get_polyhedra()) {\n result += do_poly(p);\n }\n for (bounding_box const& b : s.get_boxes()) {\n result += do_bbox(b);\n }\n return result;\n }\n \n void found(tile_location const& loc) {\n w->litnesses_.insert(std::pair<object_or_tile_identifier, int>(loc, 0)).first->second += do_bbox(fine_bounding_box_of_tile(loc.coords()));\n }\n void found(object_identifier oid) {\n shape const* ods = find_as_pointer(w->get_object_detail_shapes(), oid); assert(ods);\n w->litnesses_.insert(std::pair<object_or_tile_identifier, int>(oid, 0)).first->second += do_shape(*ods);\n }\n\n world *w;\n vector3<fine_scalar> sun_direction;\n};\n\nvoid world::update_light(vector3<fine_scalar> sun_direction)\n{\n litnesses_.clear();\n std::unique_ptr<sunlight_visitor> sv(new sunlight_visitor(this, sun_direction));\n visit_collidable_tiles_and_objects(*sv);\n}\n<|endoftext|>"} {"text":"<commit_before>#define usint unsigned short int\n#define uncast reinterpret_cast<unsigned short int>\n#define recast reinterpret_cast<char *>\n#define rechcast reinterpret_cast<const char *> \n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <sys\/time.h>\n\nusing namespace std;\n\nstruct DirEntry{\n char filename[11];\n char attributes;\n unsigned long created_time;\n usint address;\n unsigned int filesize;\n char reserved[6]; \n};\n\nusint getFATindex(int);\nvoid setFATindex(int, usint);\nchar* getDataCluster(int);\nvoid setDataCluster(int,char*);\nbool hasNextCluster(int);\nDirEntry makeDirEntry(char*,char,usint,unsigned int);\nchar* getDirRawData(int, char*);\nDirEntry* parseDirEntries(char*);\nchar* packDirEntries(DirEntry*);\nvector<string> getTokens(string, char);\n\nconst int FAT_OFFSET = 512; \/\/ 1 sector\nconst int DATA_OFFSET = FAT_OFFSET + 256*1024; \/\/ 1 sector + 256kB\nconst int CLUSTER_SIZE = 512*8; \/\/ 4kB (8 sectors\/cluster at 512B\/sector) \nconst usint FAT_EOF = 0xFFFF;\n\/\/ DirEntry Attribute Constants \nconst char ATTR_READONLY = 0x01;\nconst char ATTR_HIDDEN = 0x02;\nconst char ATTR_SYSTEMFILE = 0x04;\nconst char ATTR_VOLUMELABEL = 0x08;\nconst char ATTR_DIRECTORY = 0x10;\nconst char ATTR_FILE = 0x20;\n\nfstream FAT;\nstring CURR_DIR;\n\nint main(int argc, char* argv[]){\n if(argc > 1){\n FAT.open(argv[1], ios::binary | ios::in);\n }else{\n cout << \"Please include filename in args\" << endl;\n return 0;\n }\n if(!FAT.is_open()){\n cout << \"Can't open file!\" << endl;\n return 1;\n }\n cout << \"File opened succesfully.\" << endl;\n cout << \"READING BOOT SECTOR\" << endl;\n char* OS_name = new char[8];\n FAT.seekg(FAT.beg+3);\n FAT.read(OS_name,8);\n cout << \"OS NAME: \" << OS_name << endl;\n \/* Check FS Initalized status *\/\n cout << \"Checking FS status...\" << endl;\n cout << \"FAT index 0: \" << getFATindex(0) << endl;\n cout << \"FAT index 1: \" << getFATindex(1) << endl;\n cout << \"FAT index 2 (ROOT): \" << getFATindex(2) << endl;\n if (getFATindex(2)==0){\n cout << \"FAT still uninitalized. Writing root...\" << endl;\n DirEntry* root = parseDirEntries(getDataCluster(2));\n root[0]=makeDirEntry(\".\",ATTR_DIRECTORY | ATTR_SYSTEMFILE,2,0);\n root[1]=makeDirEntry(\"..\",ATTR_DIRECTORY | ATTR_SYSTEMFILE,2,0);\n setDataCluster(2,packDirEntries(root));\n setFATindex(2,FAT_EOF);\n cout << \"Root written.\" << endl;\n }\n \/\/Welcome to the shell\n int status = 0;\n\twhile(!status) {\n\t\tcout << OS_name << \"> \";\n\t\tstring line;\n\t\tgetline(cin,line);\n\t\tvector<string> tokens = getTokens(line, ' ');\n if(tokens.size() > 0)\n cout << \"cmd to execute: \" << tokens[0] << endl;\n if(tokens.size() == 0 || tokens[0] == \"exit\")\n status = 1;\n\t\t\/\/status = executeCommand(tokens);\n\t};\n if(status != 1){\n\t\tcerr << \"ERROR \" << status << \": al ejecutar el comando\" << endl;\n\t}\n delete[] OS_name;\n FAT.close();\n return 0;\n}\n\nusint getFATindex(int index){\n FAT.seekg(FAT.beg+FAT_OFFSET+(index*2));\n usint value;\n FAT.read(recast(&value),2);\n return value;\n}\n\nvoid setFATindex(int index, usint value){\n FAT.seekg(FAT.beg+FAT_OFFSET+(index*2));\n FAT.write(rechcast(&value),2);\n}\n\nchar* getDataCluster(int index){\n FAT.seekg(FAT.beg+DATA_OFFSET+(index*CLUSTER_SIZE));\n char* data = new char[CLUSTER_SIZE];\n FAT.read(data,CLUSTER_SIZE);\n return data;\n}\n\nvoid setDataCluster(int index, char* data){\n FAT.seekg(FAT.beg+DATA_OFFSET+(index*CLUSTER_SIZE));\n FAT.write(data,CLUSTER_SIZE);\n}\n\nbool hasNextCluster(int index){\n return getFATindex(index)!=FAT_EOF; \n}\n\nDirEntry makeDirEntry(char* fn, char attr, usint addr, unsigned int size){\n DirEntry entry;\n \/\/entry.filename=fn;\n for(int i=0; i<11; i++){\n entry.filename[i]=fn[i];\n if(fn[i]=='\\0'){\n break;\n }\n }\n entry.attributes=attr;\n struct timeval tp;\n gettimeofday(&tp, NULL);\n entry.created_time = tp.tv_sec * 1000 + tp.tv_usec \/ 1000;\n \/\/entry.created_time=std::chrono::system_clock::now().time_since_epoch() \/ std::chrono::milliseconds(1);\n entry.address=addr;\n entry.filesize=size;\n return entry;\n}\n\nchar* getDirRawData(int index, char* data){\n char* entry = new char[32];\n for(int i=0; i<32; i++){\n entry[i]=data[index*32+i];\n }\n return entry;\n}\n\n\/**\n Transforms a 4kB cluster of data into 512 DirEntries.\n\n @param data The 4kB cluster as a char array.\n @return The array of 512 DirEntries.\n*\/\nDirEntry* parseDirEntries(char* data){\n DirEntry* entries = new DirEntry[512];\n for(int i=0; i<512; i++){\n entries[i] = *(reinterpret_cast<DirEntry*>(getDirRawData(i,data)));\n }\n return entries;\n}\n\n\/**\n The reverse of parseDirEntries. It packs 512 DirEntries into a 4kB cluster.\n\n @param entries Array of 512 DirEntries to pack.\n @return The 4kB cluster as a char array.\n*\/\nchar* packDirEntries(DirEntry* entries){\n char* data = new char[CLUSTER_SIZE];\n char* entry;\n for(int i=0; i<512; i++){\n entry=recast(&(entries[i]));\n for(int j=0; j<32; j++){\n data[i*32+j]=entry[j];\n }\n }\n return data;\n}\n\n\/**\n Only works with one char delimiter but it works!!\n\n @param entries Array of 512 DirEntries to pack.\n @return The 4kB cluster as a char array.\n*\/\nvector<string> getTokens(string toTokenize, char delimiter){\n\tvector<string> v;\n\tstring::iterator stringIT = toTokenize.begin();\n\tfor(string::iterator i = toTokenize.begin(); i != toTokenize.end(); i++){\n\t\tif(*i == delimiter){\n\t\t\tv.push_back(string(stringIT,i));\n\t\t\tstringIT=i+1;\n\t\t}\n\t}\n\tv.push_back(string(stringIT,toTokenize.end()));\n\treturn v;\n}<commit_msg>Implemented(?) ls. What's going on?<commit_after>#define usint unsigned short int\n#define uncast reinterpret_cast<unsigned short int>\n#define recast reinterpret_cast<char *>\n#define rechcast reinterpret_cast<const char *> \n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <sys\/time.h>\n\nusing namespace std;\n\nstruct DirEntry{\n char filename[11];\n char attributes;\n unsigned long created_time;\n usint address;\n unsigned int filesize;\n char reserved[6]; \n};\n\nusint getFATindex(int);\nvoid setFATindex(int, usint);\nchar* getDataCluster(int);\nvoid setDataCluster(int,char*);\nbool hasNextCluster(int);\nDirEntry makeDirEntry(char*,char,usint,unsigned int);\nchar* getDirRawData(int, char*);\nDirEntry* parseDirEntries(char*);\nchar* packDirEntries(DirEntry*);\nvector<string> getTokens(string, char);\n\nconst int FAT_OFFSET = 512; \/\/ 1 sector\nconst int DATA_OFFSET = FAT_OFFSET + 256*1024; \/\/ 1 sector + 256kB\nconst int CLUSTER_SIZE = 512*8; \/\/ 4kB (8 sectors\/cluster at 512B\/sector) \nconst usint FAT_EOF = 0xFFFF;\n\/\/ DirEntry Attribute Constants \nconst char ATTR_READONLY = 0x01;\nconst char ATTR_HIDDEN = 0x02;\nconst char ATTR_SYSTEMFILE = 0x04;\nconst char ATTR_VOLUMELABEL = 0x08;\nconst char ATTR_DIRECTORY = 0x10;\nconst char ATTR_FILE = 0x20;\n\nfstream FAT;\nstring currentDir=\"\/\";\nint currentIndex=2;\n\nint main(int argc, char* argv[]){\n if(argc > 1){\n FAT.open(argv[1], ios::binary | ios::in);\n }else{\n cout << \"Please include filename in args\" << endl;\n return 0;\n }\n if(!FAT.is_open()){\n cout << \"Can't open file!\" << endl;\n return 1;\n }\n cout << \"File opened succesfully.\" << endl;\n cout << \"READING BOOT SECTOR\" << endl;\n char* OS_name = new char[8];\n FAT.seekg(FAT.beg+3);\n FAT.read(OS_name,8);\n cout << \"OS NAME: \" << OS_name << endl;\n \/* Check FS Initalized status *\/\n cout << \"Checking FS status...\" << endl;\n cout << \"FAT index 0: \" << getFATindex(0) << endl;\n cout << \"FAT index 1: \" << getFATindex(1) << endl;\n cout << \"FAT index 2 (ROOT): \" << getFATindex(2) << endl;\n if (getFATindex(2)==0){\n cout << \"FAT still uninitalized. Writing root...\" << endl;\n DirEntry* root = parseDirEntries(getDataCluster(2));\n root[0]=makeDirEntry(\".\",ATTR_DIRECTORY | ATTR_SYSTEMFILE,2,0);\n root[1]=makeDirEntry(\"..\",ATTR_DIRECTORY | ATTR_SYSTEMFILE,2,0);\n setDataCluster(2,packDirEntries(root));\n setFATindex(2,FAT_EOF);\n cout << \"Root written.\" << endl;\n }\n \/\/Welcome to the shell\n int status = 0;\n\twhile(!status) {\n\t\tcout << OS_name << \"> \";\n\t\tstring line;\n\t\tgetline(cin,line);\n\t\tvector<string> tokens = getTokens(line, ' ');\n if(tokens.size() > 0)\n cout << \"cmd to execute: \" << tokens[0] << endl;\n if(tokens.size() == 0 || tokens[0] == \"exit\"){\n status = 1;\n }else if(tokens[0]==\"ls\"){\n DirEntry* myDir = parseDirEntries(getDataCluster(currentIndex));\n cout << \"Filename |Type |Date |Size\" << endl;\n cout << \"=======================================\" << endl;\n for(int i=0; i<512; i++){\n if(myDir[i].filename[0]!='\\0'){\/\/Check if valid DirEntry\n cout << myDir[i].filename << \" \";\n if(myDir[i].attributes & ATTR_DIRECTORY){\n cout << \"DIR \";\n }else{\n cout << \"FILE \";\n }\n cout << myDir[i].created_time; \/\/UNFORMATTED!!!\n cout << myDir[i].filesize << \"B\" << endl;\n }\n }\n }\n \/\/status = executeCommand(tokens);\n\t};\n if(status != 1){\n\t\tcerr << \"ERROR \" << status << \": al ejecutar el comando\" << endl;\n\t}\n delete[] OS_name;\n FAT.close();\n return 0;\n}\n\nusint getFATindex(int index){\n FAT.seekg(FAT.beg+FAT_OFFSET+(index*2));\n usint value;\n FAT.read(recast(&value),2);\n return value;\n}\n\nvoid setFATindex(int index, usint value){\n FAT.seekg(FAT.beg+FAT_OFFSET+(index*2));\n FAT.write(rechcast(&value),2);\n}\n\nchar* getDataCluster(int index){\n FAT.seekg(FAT.beg+DATA_OFFSET+(index*CLUSTER_SIZE));\n char* data = new char[CLUSTER_SIZE];\n FAT.read(data,CLUSTER_SIZE);\n return data;\n}\n\nvoid setDataCluster(int index, char* data){\n FAT.seekg(FAT.beg+DATA_OFFSET+(index*CLUSTER_SIZE));\n FAT.write(data,CLUSTER_SIZE);\n}\n\nbool hasNextCluster(int index){\n return getFATindex(index)!=FAT_EOF; \n}\n\nDirEntry makeDirEntry(char* fn, char attr, usint addr, unsigned int size){\n DirEntry entry;\n \/\/entry.filename=fn;\n for(int i=0; i<11; i++){\n entry.filename[i]=fn[i];\n if(fn[i]=='\\0'){\n break;\n }\n }\n entry.attributes=attr;\n struct timeval tp;\n gettimeofday(&tp, NULL);\n entry.created_time = tp.tv_sec * 1000 + tp.tv_usec \/ 1000;\n \/\/entry.created_time=std::chrono::system_clock::now().time_since_epoch() \/ std::chrono::milliseconds(1);\n entry.address=addr;\n entry.filesize=size;\n return entry;\n}\n\nchar* getDirRawData(int index, char* data){\n char* entry = new char[32];\n for(int i=0; i<32; i++){\n entry[i]=data[index*32+i];\n }\n return entry;\n}\n\n\/**\n Transforms a 4kB cluster of data into 512 DirEntries.\n\n @param data The 4kB cluster as a char array.\n @return The array of 512 DirEntries.\n*\/\nDirEntry* parseDirEntries(char* data){\n DirEntry* entries = new DirEntry[512];\n for(int i=0; i<512; i++){\n entries[i] = *(reinterpret_cast<DirEntry*>(getDirRawData(i,data)));\n }\n return entries;\n}\n\n\/**\n The reverse of parseDirEntries. It packs 512 DirEntries into a 4kB cluster.\n\n @param entries Array of 512 DirEntries to pack.\n @return The 4kB cluster as a char array.\n*\/\nchar* packDirEntries(DirEntry* entries){\n char* data = new char[CLUSTER_SIZE];\n char* entry;\n for(int i=0; i<512; i++){\n entry=recast(&(entries[i]));\n for(int j=0; j<32; j++){\n data[i*32+j]=entry[j];\n }\n }\n return data;\n}\n\n\/**\n Only works with one char delimiter but it works!!\n*\/\nvector<string> getTokens(string toTokenize, char delimiter){\n\tvector<string> v;\n\tstring::iterator stringIT = toTokenize.begin();\n\tfor(string::iterator i = toTokenize.begin(); i != toTokenize.end(); i++){\n\t\tif(*i == delimiter){\n\t\t\tv.push_back(string(stringIT,i));\n\t\t\tstringIT=i+1;\n\t\t}\n\t}\n\tv.push_back(string(stringIT,toTokenize.end()));\n\treturn v;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Daniel Wallin & Arvid Norberg 2009. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <libtorrent\/create_torrent.hpp>\n#include <libtorrent\/file_storage.hpp>\n#include \"libtorrent\/intrusive_ptr_base.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n void set_hash(create_torrent& c, int p, char const* hash)\n {\n c.set_hash(p, sha1_hash(hash));\n }\n\n void call_python_object(boost::python::object const& obj, int i)\n {\n obj(i);\n }\n\n#ifndef BOOST_NO_EXCEPTIONS\n void set_piece_hashes_callback(create_torrent& c, std::string const& p\n , boost::python::object cb)\n {\n set_piece_hashes(c, p, boost::bind(call_python_object, cb, _1));\n }\n#else\n void set_piece_hashes_callback(create_torrent& c, std::string const& p\n , boost::python::object cb)\n {\n error_code ec;\n set_piece_hashes(c, p, boost::bind(call_python_object, cb, _1), ec);\n }\n\n void set_piece_hashes0(create_torrent& c, std::string const & s)\n {\n error_code ec;\n set_piece_hashes(c, s, ec);\n }\n#endif\n\n void add_node(create_torrent& ct, std::string const& addr, int port)\n {\n ct.add_node(std::make_pair(addr, port));\n }\n\n void add_file(file_storage& ct, file_entry const& fe)\n {\n ct.add_file(fe);\n }\n}\n\nvoid bind_create_torrent()\n{\n void (file_storage::*add_file0)(std::string const&, size_type, int, std::time_t, std::string const&) = &file_storage::add_file;\n#if TORRENT_USE_WSTRING\n void (file_storage::*add_file1)(std::wstring const&, size_type, int, std::time_t, std::string const&) = &file_storage::add_file;\n#endif\n\n void (file_storage::*set_name0)(std::string const&) = &file_storage::set_name;\n#if TORRENT_USE_WSTRING\n void (file_storage::*set_name1)(std::wstring const&) = &file_storage::set_name;\n#endif\n\n#ifndef BOOST_NO_EXCEPTIONS\n void (*set_piece_hashes0)(create_torrent&, std::string const&) = &set_piece_hashes;\n#endif\n void (*add_files0)(file_storage&, std::string const&, boost::uint32_t) = add_files;\n\n file_entry (file_storage::*at)(int) const = &file_storage::at;\n\n class_<file_storage>(\"file_storage\")\n .def(\"is_valid\", &file_storage::is_valid)\n .def(\"add_file\", add_file, arg(\"entry\"))\n .def(\"add_file\", add_file0, (arg(\"path\"), arg(\"size\"), arg(\"flags\") = 0, arg(\"mtime\") = 0, arg(\"linkpath\") = \"\"))\n#if TORRENT_USE_WSTRING\n .def(\"add_file\", add_file1, (arg(\"path\"), arg(\"size\"), arg(\"flags\") = 0, arg(\"mtime\") = 0, arg(\"linkpath\") = \"\"))\n#endif\n .def(\"num_files\", &file_storage::num_files)\n .def(\"at\", at)\n\/\/ .def(\"hash\", &file_storage::hash)\n\/\/ .def(\"symlink\", &file_storage::symlink, return_internal_reference<>())\n\/\/ .def(\"file_index\", &file_storage::file_index)\n\/\/ .def(\"file_base\", &file_storage::file_base)\n\/\/ .def(\"set_file_base\", &file_storage::set_file_base)\n\/\/ .def(\"file_path\", &file_storage::file_path)\n .def(\"total_size\", &file_storage::total_size)\n .def(\"set_num_pieces\", &file_storage::set_num_pieces)\n .def(\"num_pieces\", &file_storage::num_pieces)\n .def(\"set_piece_length\", &file_storage::set_piece_length)\n .def(\"piece_length\", &file_storage::piece_length)\n .def(\"piece_size\", &file_storage::piece_size)\n .def(\"set_name\", set_name0)\n#if TORRENT_USE_WSTRING\n .def(\"set_name\", set_name1)\n#endif\n .def(\"name\", &file_storage::name, return_internal_reference<>())\n ;\n\n class_<create_torrent>(\"create_torrent\", no_init)\n .def(init<file_storage&>())\n .def(init<file_storage&, torrent_info const&>(arg(\"ti\")))\n .def(init<file_storage&, int, int, int>((arg(\"storage\"), arg(\"piece_size\") = 0\n , arg(\"pad_file_limit\") = -1, arg(\"flags\") = int(libtorrent::create_torrent::optimize))))\n\n .def(\"generate\", &create_torrent::generate)\n\n .def(\"files\", &create_torrent::files, return_internal_reference<>())\n .def(\"set_comment\", &create_torrent::set_comment)\n .def(\"set_creator\", &create_torrent::set_creator)\n .def(\"set_hash\", &set_hash)\n .def(\"add_url_seed\", &create_torrent::add_url_seed)\n .def(\"add_node\", &add_node)\n .def(\"add_tracker\", &create_torrent::add_tracker, (arg(\"announce_url\"), arg(\"tier\") = 0))\n .def(\"set_priv\", &create_torrent::set_priv)\n .def(\"num_pieces\", &create_torrent::num_pieces)\n .def(\"piece_length\", &create_torrent::piece_length)\n .def(\"piece_size\", &create_torrent::piece_size)\n .def(\"priv\", &create_torrent::priv)\n ;\n\n enum_<create_torrent::flags_t>(\"create_torrent_flags_t\")\n .value(\"optimize\", create_torrent::optimize)\n .value(\"merkle\", create_torrent::merkle)\n .value(\"modification_time\", create_torrent::modification_time)\n .value(\"symlinks\", create_torrent::symlinks)\n ;\n\n def(\"add_files\", add_files0, (arg(\"fs\"), arg(\"path\"), arg(\"flags\") = 0));\n def(\"set_piece_hashes\", set_piece_hashes0);\n def(\"set_piece_hashes\", set_piece_hashes_callback);\n\n}\n<commit_msg>fixed typo in python binding<commit_after>\/\/ Copyright Daniel Wallin & Arvid Norberg 2009. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <libtorrent\/create_torrent.hpp>\n#include <libtorrent\/file_storage.hpp>\n#include \"libtorrent\/intrusive_ptr_base.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n void set_hash(create_torrent& c, int p, char const* hash)\n {\n c.set_hash(p, sha1_hash(hash));\n }\n\n void call_python_object(boost::python::object const& obj, int i)\n {\n obj(i);\n }\n\n#ifndef BOOST_NO_EXCEPTIONS\n void set_piece_hashes_callback(create_torrent& c, std::string const& p\n , boost::python::object cb)\n {\n set_piece_hashes(c, p, boost::bind(call_python_object, cb, _1));\n }\n#else\n void set_piece_hashes_callback(create_torrent& c, std::string const& p\n , boost::python::object cb)\n {\n error_code ec;\n set_piece_hashes(c, p, boost::bind(call_python_object, cb, _1), ec);\n }\n\n void set_piece_hashes0(create_torrent& c, std::string const & s)\n {\n error_code ec;\n set_piece_hashes(c, s, ec);\n }\n#endif\n\n void add_node(create_torrent& ct, std::string const& addr, int port)\n {\n ct.add_node(std::make_pair(addr, port));\n }\n\n void add_file(file_storage& ct, file_entry const& fe)\n {\n ct.add_file(fe);\n }\n}\n\nvoid bind_create_torrent()\n{\n void (file_storage::*add_file0)(std::string const&, size_type, int, std::time_t, std::string const&) = &file_storage::add_file;\n#if TORRENT_USE_WSTRING\n void (file_storage::*add_file1)(std::wstring const&, size_type, int, std::time_t, std::string const&) = &file_storage::add_file;\n#endif\n\n void (file_storage::*set_name0)(std::string const&) = &file_storage::set_name;\n#if TORRENT_USE_WSTRING\n void (file_storage::*set_name1)(std::wstring const&) = &file_storage::set_name;\n#endif\n\n#ifndef BOOST_NO_EXCEPTIONS\n void (*set_piece_hashes0)(create_torrent&, std::string const&) = &set_piece_hashes;\n#endif\n void (*add_files0)(file_storage&, std::string const&, boost::uint32_t) = add_files;\n\n file_entry (file_storage::*at)(int) const = &file_storage::at;\n\n class_<file_storage>(\"file_storage\")\n .def(\"is_valid\", &file_storage::is_valid)\n .def(\"add_file\", add_file, arg(\"entry\"))\n .def(\"add_file\", add_file0, (arg(\"path\"), arg(\"size\"), arg(\"flags\") = 0, arg(\"mtime\") = 0, arg(\"linkpath\") = \"\"))\n#if TORRENT_USE_WSTRING\n .def(\"add_file\", add_file1, (arg(\"path\"), arg(\"size\"), arg(\"flags\") = 0, arg(\"mtime\") = 0, arg(\"linkpath\") = \"\"))\n#endif\n .def(\"num_files\", &file_storage::num_files)\n .def(\"at\", at)\n\/\/ .def(\"hash\", &file_storage::hash)\n\/\/ .def(\"symlink\", &file_storage::symlink, return_internal_reference<>())\n\/\/ .def(\"file_index\", &file_storage::file_index)\n\/\/ .def(\"file_base\", &file_storage::file_base)\n\/\/ .def(\"set_file_base\", &file_storage::set_file_base)\n\/\/ .def(\"file_path\", &file_storage::file_path)\n .def(\"total_size\", &file_storage::total_size)\n .def(\"set_num_pieces\", &file_storage::set_num_pieces)\n .def(\"num_pieces\", &file_storage::num_pieces)\n .def(\"set_piece_length\", &file_storage::set_piece_length)\n .def(\"piece_length\", &file_storage::piece_length)\n .def(\"piece_size\", &file_storage::piece_size)\n .def(\"set_name\", set_name0)\n#if TORRENT_USE_WSTRING\n .def(\"set_name\", set_name1)\n#endif\n .def(\"name\", &file_storage::name, return_internal_reference<>())\n ;\n\n class_<create_torrent>(\"create_torrent\", no_init)\n .def(init<file_storage&>())\n .def(init<torrent_info const&>(arg(\"ti\")))\n .def(init<file_storage&, int, int, int>((arg(\"storage\"), arg(\"piece_size\") = 0\n , arg(\"pad_file_limit\") = -1, arg(\"flags\") = int(libtorrent::create_torrent::optimize))))\n\n .def(\"generate\", &create_torrent::generate)\n\n .def(\"files\", &create_torrent::files, return_internal_reference<>())\n .def(\"set_comment\", &create_torrent::set_comment)\n .def(\"set_creator\", &create_torrent::set_creator)\n .def(\"set_hash\", &set_hash)\n .def(\"add_url_seed\", &create_torrent::add_url_seed)\n .def(\"add_node\", &add_node)\n .def(\"add_tracker\", &create_torrent::add_tracker, (arg(\"announce_url\"), arg(\"tier\") = 0))\n .def(\"set_priv\", &create_torrent::set_priv)\n .def(\"num_pieces\", &create_torrent::num_pieces)\n .def(\"piece_length\", &create_torrent::piece_length)\n .def(\"piece_size\", &create_torrent::piece_size)\n .def(\"priv\", &create_torrent::priv)\n ;\n\n enum_<create_torrent::flags_t>(\"create_torrent_flags_t\")\n .value(\"optimize\", create_torrent::optimize)\n .value(\"merkle\", create_torrent::merkle)\n .value(\"modification_time\", create_torrent::modification_time)\n .value(\"symlinks\", create_torrent::symlinks)\n ;\n\n def(\"add_files\", add_files0, (arg(\"fs\"), arg(\"path\"), arg(\"flags\") = 0));\n def(\"set_piece_hashes\", set_piece_hashes0);\n def(\"set_piece_hashes\", set_piece_hashes_callback);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <libtorrent\/torrent_handle.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n list url_seeds(torrent_handle& handle)\n {\n list ret;\n std::set<std::string> urls;\n {\n allow_threading_guard guard;\n urls = handle.url_seeds();\n }\n\n for (std::set<std::string>::iterator i(urls.begin())\n , end(urls.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n list piece_availability(torrent_handle& handle)\n {\n list ret;\n std::vector<int> avail;\n {\n allow_threading_guard guard;\n handle.piece_availability(avail);\n }\n\n for (std::vector<int>::iterator i(avail.begin())\n , end(avail.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n list piece_priorities(torrent_handle& handle)\n {\n list ret;\n std::vector<int> prio;\n {\n allow_threading_guard guard;\n prio = handle.piece_priorities();\n }\n\n for (std::vector<int>::iterator i(prio.begin())\n , end(prio.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n std::vector<announce_entry>::const_iterator begin_trackers(torrent_handle& i)\n {\n allow_threading_guard guard;\n return i.trackers().begin();\n }\n\n std::vector<announce_entry>::const_iterator end_trackers(torrent_handle& i)\n {\n allow_threading_guard guard;\n return i.trackers().end();\n }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n std::vector<size_type> p;\n\n {\n allow_threading_guard guard;\n p.reserve(handle.get_torrent_info().num_files());\n handle.file_progress(p);\n }\n\n list result;\n\n for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n result.append(*i);\n\n return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n std::vector<peer_info> pi;\n\n {\n allow_threading_guard guard;\n handle.get_peer_info(pi);\n }\n\n list result;\n\n for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n result.append(*i);\n\n return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n std::vector<int> result;\n try\n {\n object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n while( 1 )\n {\n object obj = extract<object>( iter_obj.attr( \"next\" )() );\n result.push_back(extract<int const>( obj ));\n }\n }\n catch( error_already_set )\n {\n PyErr_Clear();\n info.prioritize_pieces(result);\n return;\n }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n std::vector<int> result;\n try\n {\n object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n while( 1 )\n {\n object obj = extract<object>( iter_obj.attr( \"next\" )() );\n result.push_back(extract<int const>( obj ));\n }\n }\n catch( error_already_set )\n {\n PyErr_Clear();\n info.prioritize_files(result);\n return;\n }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n list ret;\n std::vector<int> priorities = handle.file_priorities();\n\n for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n ret.append(*i);\n\n return ret;\n}\n\nvoid replace_trackers(torrent_handle& info, object trackers)\n{\n object iter(trackers.attr(\"__iter__\")());\n\n std::vector<announce_entry> result;\n\n for (;;)\n {\n handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n if (entry == handle<>())\n break;\n\n result.push_back(extract<announce_entry const&>(object(entry)));\n }\n\n allow_threading_guard guard;\n info.replace_trackers(result);\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n using boost::python::make_tuple;\n\n list ret;\n\n std::vector<partial_piece_info> downloading;\n\n {\n allow_threading_guard guard;\n handle.get_download_queue(downloading);\n }\n\n for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n , end(downloading.end()); i != end; ++i)\n {\n dict partial_piece;\n partial_piece[\"piece_index\"] = i->piece_index;\n partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n list block_list;\n for (int k = 0; k < i->blocks_in_piece; ++k)\n {\n dict block_info;\n block_info[\"state\"] = i->blocks[k].state;\n block_info[\"num_peers\"] = i->blocks[k].num_peers;\n block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n block_info[\"block_size\"] = i->blocks[k].block_size;\n block_info[\"peer\"] = make_tuple(\n boost::lexical_cast<std::string>(i->blocks[k].peer.address()), i->blocks[k].peer.port());\n block_list.append(block_info);\n }\n partial_piece[\"blocks\"] = block_list;\n\n ret.append(partial_piece);\n }\n\n return ret;\n}\n\nnamespace\n{\n tcp::endpoint tuple_to_endpoint(tuple const& t)\n {\n return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid add_piece(torrent_handle& th, int piece, char const *data, int flags)\n{\n th.add_piece(piece, data, flags);\n}\n\nvoid bind_torrent_handle()\n{\n void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n void (torrent_handle::*move_storage0)(fs::path const&) const = &torrent_handle::move_storage;\n void (torrent_handle::*move_storage1)(fs::wpath const&) const = &torrent_handle::move_storage;\n\n void (torrent_handle::*rename_file0)(int, fs::path const&) const = &torrent_handle::rename_file;\n void (torrent_handle::*rename_file1)(int, fs::wpath const&) const = &torrent_handle::rename_file;\n\t\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n#define _ allow_threads\n\n class_<torrent_handle>(\"torrent_handle\")\n .def(\"get_peer_info\", get_peer_info)\n .def(\"status\", _(&torrent_handle::status))\n .def(\"get_download_queue\", get_download_queue)\n .def(\"file_progress\", file_progress)\n .def(\"trackers\", range(begin_trackers, end_trackers))\n .def(\"replace_trackers\", replace_trackers)\n .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n .def(\"url_seeds\", url_seeds)\n .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n .def(\"is_valid\", _(&torrent_handle::is_valid))\n .def(\"is_seed\", _(&torrent_handle::is_seed))\n .def(\"is_finished\", _(&torrent_handle::is_finished))\n .def(\"is_paused\", _(&torrent_handle::is_paused))\n .def(\"pause\", _(&torrent_handle::pause))\n .def(\"resume\", _(&torrent_handle::resume))\n .def(\"clear_error\", _(&torrent_handle::clear_error))\n\n .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n .def(\"queue_position\", _(&torrent_handle::queue_position))\n .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n .def(\"resolve_countries\", _(resolve_countries0))\n .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n .def(\"add_piece\", add_piece)\n .def(\"read_piece\", _(&torrent_handle::read_piece))\n .def(\"piece_availability\", piece_availability)\n .def(\"piece_priority\", _(piece_priority0))\n .def(\"piece_priority\", _(piece_priority1))\n .def(\"prioritize_pieces\", prioritize_pieces)\n .def(\"piece_priorities\", piece_priorities)\n .def(\"prioritize_files\", prioritize_files)\n .def(\"file_priorities\", file_priorities)\n .def(\"use_interface\", &torrent_handle::use_interface)\n .def(\"save_resume_data\", _(&torrent_handle::save_resume_data))\n .def(\"force_reannounce\", _(force_reannounce0))\n .def(\"force_reannounce\", force_reannounce)\n .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n .def(\"name\", _(&torrent_handle::name))\n .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n .def(\"download_limit\", _(&torrent_handle::download_limit))\n .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n .def(\"set_peer_upload_limit\", set_peer_upload_limit)\n .def(\"set_peer_download_limit\", set_peer_download_limit)\n .def(\"connect_peer\", connect_peer)\n .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n .def(\"save_path\", _(&torrent_handle::save_path))\n .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n .def(\"move_storage\", _(move_storage0))\n .def(\"move_storage\", _(move_storage1))\n .def(\"info_hash\", _(&torrent_handle::info_hash))\n .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n .def(\"rename_file\", _(rename_file0))\n .def(\"rename_file\", _(rename_file1))\n ;\n}\n<commit_msg>updated python bindings with the recent API change<commit_after>\/\/ Copyright Daniel Wallin 2006. Use, modification and distribution is\n\/\/ subject to the Boost Software License, Version 1.0. (See accompanying\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include <boost\/python.hpp>\n#include <boost\/python\/tuple.hpp>\n#include <libtorrent\/torrent_handle.hpp>\n#include <boost\/lexical_cast.hpp>\n#include \"gil.hpp\"\n\nusing namespace boost::python;\nusing namespace libtorrent;\n\nnamespace\n{\n\n list url_seeds(torrent_handle& handle)\n {\n list ret;\n std::set<std::string> urls;\n {\n allow_threading_guard guard;\n urls = handle.url_seeds();\n }\n\n for (std::set<std::string>::iterator i(urls.begin())\n , end(urls.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n list piece_availability(torrent_handle& handle)\n {\n list ret;\n std::vector<int> avail;\n {\n allow_threading_guard guard;\n handle.piece_availability(avail);\n }\n\n for (std::vector<int>::iterator i(avail.begin())\n , end(avail.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n list piece_priorities(torrent_handle& handle)\n {\n list ret;\n std::vector<int> prio;\n {\n allow_threading_guard guard;\n prio = handle.piece_priorities();\n }\n\n for (std::vector<int>::iterator i(prio.begin())\n , end(prio.end()); i != end; ++i)\n ret.append(*i);\n return ret;\n }\n\n std::vector<announce_entry>::const_iterator begin_trackers(torrent_handle& i)\n {\n allow_threading_guard guard;\n return i.trackers().begin();\n }\n\n std::vector<announce_entry>::const_iterator end_trackers(torrent_handle& i)\n {\n allow_threading_guard guard;\n return i.trackers().end();\n }\n\n} \/\/ namespace unnamed\n\nlist file_progress(torrent_handle& handle)\n{\n std::vector<size_type> p;\n\n {\n allow_threading_guard guard;\n p.reserve(handle.get_torrent_info().num_files());\n handle.file_progress(p);\n }\n\n list result;\n\n for (std::vector<size_type>::iterator i(p.begin()), e(p.end()); i != e; ++i)\n result.append(*i);\n\n return result;\n}\n\nlist get_peer_info(torrent_handle const& handle)\n{\n std::vector<peer_info> pi;\n\n {\n allow_threading_guard guard;\n handle.get_peer_info(pi);\n }\n\n list result;\n\n for (std::vector<peer_info>::iterator i = pi.begin(); i != pi.end(); ++i)\n result.append(*i);\n\n return result;\n}\n\nvoid prioritize_pieces(torrent_handle& info, object o)\n{\n std::vector<int> result;\n try\n {\n object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n while( 1 )\n {\n object obj = extract<object>( iter_obj.attr( \"next\" )() );\n result.push_back(extract<int const>( obj ));\n }\n }\n catch( error_already_set )\n {\n PyErr_Clear();\n info.prioritize_pieces(result);\n return;\n }\n}\n\nvoid prioritize_files(torrent_handle& info, object o)\n{\n std::vector<int> result;\n try\n {\n object iter_obj = object( handle<>( PyObject_GetIter( o.ptr() ) ));\n while( 1 )\n {\n object obj = extract<object>( iter_obj.attr( \"next\" )() );\n result.push_back(extract<int const>( obj ));\n }\n }\n catch( error_already_set )\n {\n PyErr_Clear();\n info.prioritize_files(result);\n return;\n }\n}\n\nlist file_priorities(torrent_handle& handle)\n{\n list ret;\n std::vector<int> priorities = handle.file_priorities();\n\n for (std::vector<int>::iterator i = priorities.begin(); i != priorities.end(); ++i)\n ret.append(*i);\n\n return ret;\n}\n\nvoid replace_trackers(torrent_handle& info, object trackers)\n{\n object iter(trackers.attr(\"__iter__\")());\n\n std::vector<announce_entry> result;\n\n for (;;)\n {\n handle<> entry(allow_null(PyIter_Next(iter.ptr())));\n\n if (entry == handle<>())\n break;\n\n result.push_back(extract<announce_entry const&>(object(entry)));\n }\n\n allow_threading_guard guard;\n info.replace_trackers(result);\n}\n\nlist get_download_queue(torrent_handle& handle)\n{\n using boost::python::make_tuple;\n\n list ret;\n\n std::vector<partial_piece_info> downloading;\n\n {\n allow_threading_guard guard;\n handle.get_download_queue(downloading);\n }\n\n for (std::vector<partial_piece_info>::iterator i = downloading.begin()\n , end(downloading.end()); i != end; ++i)\n {\n dict partial_piece;\n partial_piece[\"piece_index\"] = i->piece_index;\n partial_piece[\"blocks_in_piece\"] = i->blocks_in_piece;\n list block_list;\n for (int k = 0; k < i->blocks_in_piece; ++k)\n {\n dict block_info;\n block_info[\"state\"] = i->blocks[k].state;\n block_info[\"num_peers\"] = i->blocks[k].num_peers;\n block_info[\"bytes_progress\"] = i->blocks[k].bytes_progress;\n block_info[\"block_size\"] = i->blocks[k].block_size;\n block_info[\"peer\"] = make_tuple(\n boost::lexical_cast<std::string>(i->blocks[k].peer().address()), i->blocks[k].peer().port());\n block_list.append(block_info);\n }\n partial_piece[\"blocks\"] = block_list;\n\n ret.append(partial_piece);\n }\n\n return ret;\n}\n\nnamespace\n{\n tcp::endpoint tuple_to_endpoint(tuple const& t)\n {\n return tcp::endpoint(address::from_string(extract<std::string>(t[0])), extract<int>(t[1]));\n }\n}\n\nvoid force_reannounce(torrent_handle& th, int s)\n{\n th.force_reannounce(boost::posix_time::seconds(s));\n}\n\nvoid connect_peer(torrent_handle& th, tuple ip, int source)\n{\n th.connect_peer(tuple_to_endpoint(ip), source);\n}\n\nvoid set_peer_upload_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n th.set_peer_upload_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid set_peer_download_limit(torrent_handle& th, tuple const& ip, int limit)\n{\n th.set_peer_download_limit(tuple_to_endpoint(ip), limit);\n}\n\nvoid add_piece(torrent_handle& th, int piece, char const *data, int flags)\n{\n th.add_piece(piece, data, flags);\n}\n\nvoid bind_torrent_handle()\n{\n void (torrent_handle::*force_reannounce0)() const = &torrent_handle::force_reannounce;\n\n int (torrent_handle::*piece_priority0)(int) const = &torrent_handle::piece_priority;\n void (torrent_handle::*piece_priority1)(int, int) const = &torrent_handle::piece_priority;\n\n void (torrent_handle::*move_storage0)(fs::path const&) const = &torrent_handle::move_storage;\n void (torrent_handle::*move_storage1)(fs::wpath const&) const = &torrent_handle::move_storage;\n\n void (torrent_handle::*rename_file0)(int, fs::path const&) const = &torrent_handle::rename_file;\n void (torrent_handle::*rename_file1)(int, fs::wpath const&) const = &torrent_handle::rename_file;\n\t\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n bool (torrent_handle::*resolve_countries0)() const = &torrent_handle::resolve_countries;\n void (torrent_handle::*resolve_countries1)(bool) = &torrent_handle::resolve_countries;\n#endif\n\n#define _ allow_threads\n\n class_<torrent_handle>(\"torrent_handle\")\n .def(\"get_peer_info\", get_peer_info)\n .def(\"status\", _(&torrent_handle::status))\n .def(\"get_download_queue\", get_download_queue)\n .def(\"file_progress\", file_progress)\n .def(\"trackers\", range(begin_trackers, end_trackers))\n .def(\"replace_trackers\", replace_trackers)\n .def(\"add_url_seed\", _(&torrent_handle::add_url_seed))\n .def(\"remove_url_seed\", _(&torrent_handle::remove_url_seed))\n .def(\"url_seeds\", url_seeds)\n .def(\"has_metadata\", _(&torrent_handle::has_metadata))\n .def(\"get_torrent_info\", _(&torrent_handle::get_torrent_info), return_internal_reference<>())\n .def(\"is_valid\", _(&torrent_handle::is_valid))\n .def(\"is_seed\", _(&torrent_handle::is_seed))\n .def(\"is_finished\", _(&torrent_handle::is_finished))\n .def(\"is_paused\", _(&torrent_handle::is_paused))\n .def(\"pause\", _(&torrent_handle::pause))\n .def(\"resume\", _(&torrent_handle::resume))\n .def(\"clear_error\", _(&torrent_handle::clear_error))\n\n .def(\"is_auto_managed\", _(&torrent_handle::is_auto_managed))\n .def(\"auto_managed\", _(&torrent_handle::auto_managed))\n .def(\"queue_position\", _(&torrent_handle::queue_position))\n .def(\"queue_position_up\", _(&torrent_handle::queue_position_up))\n .def(\"queue_position_down\", _(&torrent_handle::queue_position_down))\n .def(\"queue_position_top\", _(&torrent_handle::queue_position_top))\n .def(\"queue_position_bottom\", _(&torrent_handle::queue_position_bottom))\n\n#ifndef TORRENT_DISABLE_RESOLVE_COUNTRIES\n .def(\"resolve_countries\", _(resolve_countries0))\n .def(\"resolve_countries\", _(resolve_countries1))\n#endif\n \/\/ deprecated\n#ifndef TORRENT_NO_DEPRECATE\n .def(\"filter_piece\", _(&torrent_handle::filter_piece))\n .def(\"is_piece_filtered\", _(&torrent_handle::is_piece_filtered))\n .def(\"write_resume_data\", _(&torrent_handle::write_resume_data))\n#endif\n .def(\"add_piece\", add_piece)\n .def(\"read_piece\", _(&torrent_handle::read_piece))\n .def(\"piece_availability\", piece_availability)\n .def(\"piece_priority\", _(piece_priority0))\n .def(\"piece_priority\", _(piece_priority1))\n .def(\"prioritize_pieces\", prioritize_pieces)\n .def(\"piece_priorities\", piece_priorities)\n .def(\"prioritize_files\", prioritize_files)\n .def(\"file_priorities\", file_priorities)\n .def(\"use_interface\", &torrent_handle::use_interface)\n .def(\"save_resume_data\", _(&torrent_handle::save_resume_data))\n .def(\"force_reannounce\", _(force_reannounce0))\n .def(\"force_reannounce\", force_reannounce)\n .def(\"scrape_tracker\", _(&torrent_handle::scrape_tracker))\n .def(\"name\", _(&torrent_handle::name))\n .def(\"set_upload_limit\", _(&torrent_handle::set_upload_limit))\n .def(\"upload_limit\", _(&torrent_handle::upload_limit))\n .def(\"set_download_limit\", _(&torrent_handle::set_download_limit))\n .def(\"download_limit\", _(&torrent_handle::download_limit))\n .def(\"set_sequential_download\", _(&torrent_handle::set_sequential_download))\n .def(\"set_peer_upload_limit\", set_peer_upload_limit)\n .def(\"set_peer_download_limit\", set_peer_download_limit)\n .def(\"connect_peer\", connect_peer)\n .def(\"set_ratio\", _(&torrent_handle::set_ratio))\n .def(\"save_path\", _(&torrent_handle::save_path))\n .def(\"set_max_uploads\", _(&torrent_handle::set_max_uploads))\n .def(\"set_max_connections\", _(&torrent_handle::set_max_connections))\n .def(\"set_tracker_login\", _(&torrent_handle::set_tracker_login))\n .def(\"move_storage\", _(move_storage0))\n .def(\"move_storage\", _(move_storage1))\n .def(\"info_hash\", _(&torrent_handle::info_hash))\n .def(\"force_recheck\", _(&torrent_handle::force_recheck))\n .def(\"rename_file\", _(rename_file0))\n .def(\"rename_file\", _(rename_file1))\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2013 Mateusz Łoskot <mateusz@loskot.net>\n\/\/ Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n\/\/\n\/\/ This file is part of Qt Creator Boost.Build plugin project.\n\/\/\n\/\/ This is free software; you can redistribute and\/or modify it under\n\/\/ the terms of the GNU Lesser General Public License, Version 2.1\n\/\/ as published by the Free Software Foundation.\n\/\/ See accompanying file LICENSE.txt or copy at \n\/\/ http:\/\/www.gnu.org\/licenses\/lgpl-2.1-standalone.html.\n\/\/\n#include \"bbbuildconfiguration.hpp\"\n#include \"bbbuildstep.hpp\"\n#include \"bbopenprojectwizard.hpp\"\n#include \"bbproject.hpp\"\n#include \"bbprojectfile.hpp\"\n#include \"bbprojectmanager.hpp\"\n#include \"bbprojectmanagerconstants.hpp\"\n#include \"bbprojectnode.hpp\"\n#include \"bbutility.hpp\"\n\/\/ Qt Creator\n#include <app\/app_version.h>\n#include <coreplugin\/icontext.h>\n#include <coreplugin\/icore.h>\n#include <coreplugin\/generatedfile.h>\n#include <coreplugin\/mimedatabase.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <cpptools\/cppmodelmanager.h>\n#include <cpptools\/cppprojects.h>\n#include <cpptools\/cpptoolsconstants.h>\n#include <projectexplorer\/kit.h>\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/kitmanager.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/projectexplorerconstants.h>\n#include <projectexplorer\/projectnodes.h>\n#include <projectexplorer\/target.h>\n#include <qtsupport\/customexecutablerunconfiguration.h>\n#include <utils\/fileutils.h>\n#include <utils\/QtConcurrentTools>\n\/\/ Qt\n#include <QDir>\n#include <QFileInfo>\n#include <QMessageBox>\n\nnamespace BoostBuildProjectManager {\nnamespace Internal {\n\nProject::Project(ProjectManager* manager, QString const& fileName)\n : manager_(manager)\n , filePath_(fileName)\n , projectFile_(new ProjectFile(this, filePath_)) \/\/ enables projectDirectory()\n , projectNode_(new ProjectNode(this, projectFile_))\n{\n Q_ASSERT(manager_);\n Q_ASSERT(!filePath_.isEmpty());\n\n setProjectContext(Core::Context(Constants::PROJECT_CONTEXT));\n setProjectLanguages(Core::Context(ProjectExplorer::Constants::LANG_CXX));\n#if defined(IDE_VERSION_MAJOR) && (IDE_VERSION_MAJOR == 3 && IDE_VERSION_MINOR > 0)\n setId(Constants::PROJECT_ID);\n#endif\n\n QFileInfo const projectFileInfo(filePath_);\n QDir const projectDir(projectFileInfo.dir());\n projectName_ = defaultProjectName(filePath_);\n filesFilePath_ = QFileInfo(projectDir\n , filePath_ + QLatin1String(Constants::EXT_JAMFILE_FILES)).absoluteFilePath();\n includesFilePath_ = QFileInfo(projectDir\n , filePath_ + QLatin1String(Constants::EXT_JAMFILE_INCLUDES)).absoluteFilePath();\n\n projectNode_->setDisplayName(displayName());\n\n manager_->registerProject(this);\n\n \/\/ TODO: Add file watchers\n \/\/projectFileWatcher_->addPath(projectFilePath);\n \/\/connect(projectFileWatcher_, SIGNAL(fileChanged(QString)), this, SLOT(refresh()));\n\n BBPM_QDEBUG(\"created project: \" << displayName() << \" in \" << projectDirectory());\n}\n\nProject::~Project()\n{\n manager_->unregisterProject(this);\n delete projectNode_;\n}\n\nQString Project::displayName() const\n{\n return projectName_;\n}\n\n#if defined(IDE_VERSION_MAJOR) && (IDE_VERSION_MAJOR == 3 && IDE_VERSION_MINOR == 0)\nCore::Id Project::id() const\n{\n return Core::Id(Constants::PROJECT_ID);\n}\n#endif\n \nCore::IDocument* Project::document() const\n{\n return projectFile_;\n}\n\nProjectExplorer::IProjectManager* Project::projectManager() const\n{\n return manager_;\n}\n\nProjectExplorer::ProjectNode* Project::rootProjectNode() const\n{\n return projectNode_;\n}\n\nQStringList Project::files(FilesMode fileMode) const\n{\n \/\/ TODO: handle ExcludeGeneratedFiles, but what files exactly?\n \/\/ *.qtcreator.files, *.qtcreator.includes and *.user?\n Q_UNUSED(fileMode);\n return files_;\n}\n\nQStringList Project::files() const\n{\n return files(FilesMode::AllFiles);\n}\n\nQString Project::filesFilePath() const\n{\n Q_ASSERT(!filesFilePath_.isEmpty());\n return filesFilePath_;\n}\n\nQString Project::includesFilePath() const\n{\n Q_ASSERT(!includesFilePath_.isEmpty());\n return includesFilePath_;\n}\n\nbool Project::needsConfiguration() const\n{\n \/\/ TODO: Does Boost.Build project require any configuration on loading?\n \/\/ - Kit selection\n \/\/ - build\/stage directory\n \/\/ - targets listing\n \/\/ CMakeProjectManager seems to request configuration in fromMap()\n\n return false;\n}\n\n\/*static*\/\nQString Project::defaultProjectName(QString const& fileName)\n{\n QFileInfo const fileInfo(fileName);\n return fileInfo.absoluteDir().dirName();\n}\n\n\/*static*\/\nQString Project::defaultBuildDirectory(QString const& top)\n{\n Utils::FileName fn(Utils::FileName::fromString(defaultWorkingDirectory(top)));\n fn.appendPath(BBPM_C(BUILD_DIR_NAME));\n return fn.toString();\n}\n\n\/*static*\/\nQString Project::defaultWorkingDirectory(QString const& top)\n{\n \/\/ Accepts both, project file or project directory, as top.\n return ProjectExplorer::Project::projectDirectory(Utils::FileName::fromString(top)).toString();\n}\n\nvoid Project::setProjectName(QString const& name)\n{\n if (projectName_ != name)\n {\n projectName_ = name;\n projectNode_->setDisplayName(projectName_);\n \/\/ TODO: signal?\n }\n}\n\nQVariantMap Project::toMap() const\n{\n QVariantMap map(ProjectExplorer::Project::toMap());\n map.insert(QLatin1String(Constants::P_KEY_PROJECTNAME), projectName_);\n return map;\n}\n\n\/\/ This function is called at the very beginning to restore the settings\n\/\/ from .user file, if there is any with previous settings stored.\nbool Project::fromMap(QVariantMap const& map)\n{\n BBPM_QDEBUG(displayName());\n QTC_ASSERT(projectNode_, return false);\n\n if (!ProjectExplorer::Project::fromMap(map))\n return false;\n\n QVariantMap extraValues(map);\n if (!extraValues.contains(BBPM_C(P_KEY_PROJECTNAME)))\n extraValues.insert(BBPM_C(P_KEY_PROJECTNAME), projectName_);\n setProjectName(map.value(BBPM_C(P_KEY_PROJECTNAME)).toString());\n\n \/\/ Check required auxiliary files, run wizard of necessary\n if (!QFileInfo(filesFilePath()).exists() || !QFileInfo(includesFilePath()).exists())\n {\n ProjectExplorer::Kit* defaultKit = ProjectExplorer::KitManager::defaultKit();\n Q_ASSERT(defaultKit);\n\n OpenProjectWizard wizard(this);\n if (!wizard.run(defaultKit->displayName(), extraValues))\n return false;\n\n QVariantMap outputValues = wizard.outputValues();\n setProjectName(outputValues.value(BBPM_C(P_KEY_PROJECTNAME)).toString());\n }\n\n \/\/ Set up active ProjectConfiguration (aka Target).\n \/\/ NOTE: Call setActiveBuildConfiguration when creating new build configurations.\n if (!activeTarget())\n {\n \/\/ Create project configuration from scratch\n\n \/\/ TODO: Map the Kit to Boost.Build toolset option value\n ProjectExplorer::Kit* defaultKit = ProjectExplorer::KitManager::defaultKit();\n Q_ASSERT(defaultKit);\n\n \/\/ Creates as many {Build|Run|Deploy}Configurations for as corresponding\n \/\/ factories report as available.\n \/\/ For example, BuildConfigurationFactory::availableBuilds => Debug and Release\n ProjectExplorer::Target* target = createTarget(defaultKit);\n QTC_ASSERT(target, return false);\n\n addTarget(target);\n }\n else\n {\n \/\/ Configure project from settings sorced from .user file\n \/\/ TODO: Do we need to handle anything from .user here? Do we need this case?\n BBPM_QDEBUG(displayName() << \"has user file\");\n }\n\n \/\/ Sanity check (taken from GenericProjectManager):\n \/\/ We need both a BuildConfiguration and a RunConfiguration!\n QList<ProjectExplorer::Target*> targetList = targets();\n foreach (ProjectExplorer::Target* t, targetList)\n {\n if (!t->activeBuildConfiguration())\n {\n removeTarget(t);\n continue;\n }\n if (!t->activeRunConfiguration())\n t->addRunConfiguration(new QtSupport::CustomExecutableRunConfiguration(t));\n }\n\n QTC_ASSERT(hasActiveBuildSettings(), return false);\n QTC_ASSERT(activeTarget() != 0, return false);\n\n \/\/ Trigger loading project tree and parsing sources\n refresh();\n\n return true;\n}\n\nvoid Project::refresh()\n{\n QTC_ASSERT(QFileInfo(filesFilePath()).exists(), return);\n QTC_ASSERT(QFileInfo(includesFilePath()).exists(), return);\n\n QSet<QString> oldFileList;\n oldFileList = files_.toSet();\n\n \/\/ Parse project:\n \/\/ The manager does not parse Jamfile files.\n \/\/ Only generates and parses list of source files in Jamfile.${JAMFILE_FILES_EXT}\n QString const projectPath(projectDirectory().toString());\n filesRaw_ = Utility::readLines(filesFilePath());\n files_ = Utility::makeAbsolutePaths(projectPath, filesRaw_);\n\n QStringList includePaths =\n Utility::makeAbsolutePaths(projectPath,\n Utility::readLines(includesFilePath()));\n\n emit fileListChanged();\n\n projectNode_->refresh(oldFileList);\n\n \/\/ TODO: Does it make sense to move this to separate asynchronous task?\n \/\/ TODO: extract updateCppCodeModel\n CppTools::CppModelManager *modelmanager =\n CppTools::CppModelManager::instance();\n if (modelmanager) {\n CppTools::ProjectInfo pinfo = modelmanager->projectInfo(this);\n pinfo.clearProjectParts();\n\n CppTools::ProjectPartBuilder builder(pinfo);\n builder.setDisplayName(displayName());\n builder.setProjectFile(projectFilePath().toString());\n \/\/builder.setDefines();\t\/\/ TODO: waiting for Jamfile parser\n builder.setIncludePaths(QStringList() << projectDirectory().toString() << includePaths);\n\n const QList<Core::Id> languages = builder.createProjectPartsForFiles(files_);\n foreach (Core::Id language, languages)\n setProjectLanguage(language, true);\n\n cppModelFuture_.cancel();\n pinfo.finish();\n cppModelFuture_ = modelmanager->updateProjectInfo(pinfo);\n }\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace BoostBuildProjectManager\n<commit_msg>Remove call of clearProjectParts<commit_after>\/\/\n\/\/ Copyright (C) 2013 Mateusz Łoskot <mateusz@loskot.net>\n\/\/ Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n\/\/\n\/\/ This file is part of Qt Creator Boost.Build plugin project.\n\/\/\n\/\/ This is free software; you can redistribute and\/or modify it under\n\/\/ the terms of the GNU Lesser General Public License, Version 2.1\n\/\/ as published by the Free Software Foundation.\n\/\/ See accompanying file LICENSE.txt or copy at \n\/\/ http:\/\/www.gnu.org\/licenses\/lgpl-2.1-standalone.html.\n\/\/\n#include \"bbbuildconfiguration.hpp\"\n#include \"bbbuildstep.hpp\"\n#include \"bbopenprojectwizard.hpp\"\n#include \"bbproject.hpp\"\n#include \"bbprojectfile.hpp\"\n#include \"bbprojectmanager.hpp\"\n#include \"bbprojectmanagerconstants.hpp\"\n#include \"bbprojectnode.hpp\"\n#include \"bbutility.hpp\"\n\/\/ Qt Creator\n#include <app\/app_version.h>\n#include <coreplugin\/icontext.h>\n#include <coreplugin\/icore.h>\n#include <coreplugin\/generatedfile.h>\n#include <coreplugin\/mimedatabase.h>\n#include <coreplugin\/progressmanager\/progressmanager.h>\n#include <cpptools\/cppmodelmanager.h>\n#include <cpptools\/cppprojects.h>\n#include <cpptools\/cpptoolsconstants.h>\n#include <projectexplorer\/kit.h>\n#include <projectexplorer\/kitinformation.h>\n#include <projectexplorer\/kitmanager.h>\n#include <projectexplorer\/project.h>\n#include <projectexplorer\/projectexplorerconstants.h>\n#include <projectexplorer\/projectnodes.h>\n#include <projectexplorer\/target.h>\n#include <qtsupport\/customexecutablerunconfiguration.h>\n#include <utils\/fileutils.h>\n#include <utils\/QtConcurrentTools>\n\/\/ Qt\n#include <QDir>\n#include <QFileInfo>\n#include <QMessageBox>\n\nnamespace BoostBuildProjectManager {\nnamespace Internal {\n\nProject::Project(ProjectManager* manager, QString const& fileName)\n : manager_(manager)\n , filePath_(fileName)\n , projectFile_(new ProjectFile(this, filePath_)) \/\/ enables projectDirectory()\n , projectNode_(new ProjectNode(this, projectFile_))\n{\n Q_ASSERT(manager_);\n Q_ASSERT(!filePath_.isEmpty());\n\n setProjectContext(Core::Context(Constants::PROJECT_CONTEXT));\n setProjectLanguages(Core::Context(ProjectExplorer::Constants::LANG_CXX));\n#if defined(IDE_VERSION_MAJOR) && (IDE_VERSION_MAJOR == 3 && IDE_VERSION_MINOR > 0)\n setId(Constants::PROJECT_ID);\n#endif\n\n QFileInfo const projectFileInfo(filePath_);\n QDir const projectDir(projectFileInfo.dir());\n projectName_ = defaultProjectName(filePath_);\n filesFilePath_ = QFileInfo(projectDir\n , filePath_ + QLatin1String(Constants::EXT_JAMFILE_FILES)).absoluteFilePath();\n includesFilePath_ = QFileInfo(projectDir\n , filePath_ + QLatin1String(Constants::EXT_JAMFILE_INCLUDES)).absoluteFilePath();\n\n projectNode_->setDisplayName(displayName());\n\n manager_->registerProject(this);\n\n \/\/ TODO: Add file watchers\n \/\/projectFileWatcher_->addPath(projectFilePath);\n \/\/connect(projectFileWatcher_, SIGNAL(fileChanged(QString)), this, SLOT(refresh()));\n\n BBPM_QDEBUG(\"created project: \" << displayName() << \" in \" << projectDirectory());\n}\n\nProject::~Project()\n{\n manager_->unregisterProject(this);\n delete projectNode_;\n}\n\nQString Project::displayName() const\n{\n return projectName_;\n}\n\n#if defined(IDE_VERSION_MAJOR) && (IDE_VERSION_MAJOR == 3 && IDE_VERSION_MINOR == 0)\nCore::Id Project::id() const\n{\n return Core::Id(Constants::PROJECT_ID);\n}\n#endif\n \nCore::IDocument* Project::document() const\n{\n return projectFile_;\n}\n\nProjectExplorer::IProjectManager* Project::projectManager() const\n{\n return manager_;\n}\n\nProjectExplorer::ProjectNode* Project::rootProjectNode() const\n{\n return projectNode_;\n}\n\nQStringList Project::files(FilesMode fileMode) const\n{\n \/\/ TODO: handle ExcludeGeneratedFiles, but what files exactly?\n \/\/ *.qtcreator.files, *.qtcreator.includes and *.user?\n Q_UNUSED(fileMode);\n return files_;\n}\n\nQStringList Project::files() const\n{\n return files(FilesMode::AllFiles);\n}\n\nQString Project::filesFilePath() const\n{\n Q_ASSERT(!filesFilePath_.isEmpty());\n return filesFilePath_;\n}\n\nQString Project::includesFilePath() const\n{\n Q_ASSERT(!includesFilePath_.isEmpty());\n return includesFilePath_;\n}\n\nbool Project::needsConfiguration() const\n{\n \/\/ TODO: Does Boost.Build project require any configuration on loading?\n \/\/ - Kit selection\n \/\/ - build\/stage directory\n \/\/ - targets listing\n \/\/ CMakeProjectManager seems to request configuration in fromMap()\n\n return false;\n}\n\n\/*static*\/\nQString Project::defaultProjectName(QString const& fileName)\n{\n QFileInfo const fileInfo(fileName);\n return fileInfo.absoluteDir().dirName();\n}\n\n\/*static*\/\nQString Project::defaultBuildDirectory(QString const& top)\n{\n Utils::FileName fn(Utils::FileName::fromString(defaultWorkingDirectory(top)));\n fn.appendPath(BBPM_C(BUILD_DIR_NAME));\n return fn.toString();\n}\n\n\/*static*\/\nQString Project::defaultWorkingDirectory(QString const& top)\n{\n \/\/ Accepts both, project file or project directory, as top.\n return ProjectExplorer::Project::projectDirectory(Utils::FileName::fromString(top)).toString();\n}\n\nvoid Project::setProjectName(QString const& name)\n{\n if (projectName_ != name)\n {\n projectName_ = name;\n projectNode_->setDisplayName(projectName_);\n \/\/ TODO: signal?\n }\n}\n\nQVariantMap Project::toMap() const\n{\n QVariantMap map(ProjectExplorer::Project::toMap());\n map.insert(QLatin1String(Constants::P_KEY_PROJECTNAME), projectName_);\n return map;\n}\n\n\/\/ This function is called at the very beginning to restore the settings\n\/\/ from .user file, if there is any with previous settings stored.\nbool Project::fromMap(QVariantMap const& map)\n{\n BBPM_QDEBUG(displayName());\n QTC_ASSERT(projectNode_, return false);\n\n if (!ProjectExplorer::Project::fromMap(map))\n return false;\n\n QVariantMap extraValues(map);\n if (!extraValues.contains(BBPM_C(P_KEY_PROJECTNAME)))\n extraValues.insert(BBPM_C(P_KEY_PROJECTNAME), projectName_);\n setProjectName(map.value(BBPM_C(P_KEY_PROJECTNAME)).toString());\n\n \/\/ Check required auxiliary files, run wizard of necessary\n if (!QFileInfo(filesFilePath()).exists() || !QFileInfo(includesFilePath()).exists())\n {\n ProjectExplorer::Kit* defaultKit = ProjectExplorer::KitManager::defaultKit();\n Q_ASSERT(defaultKit);\n\n OpenProjectWizard wizard(this);\n if (!wizard.run(defaultKit->displayName(), extraValues))\n return false;\n\n QVariantMap outputValues = wizard.outputValues();\n setProjectName(outputValues.value(BBPM_C(P_KEY_PROJECTNAME)).toString());\n }\n\n \/\/ Set up active ProjectConfiguration (aka Target).\n \/\/ NOTE: Call setActiveBuildConfiguration when creating new build configurations.\n if (!activeTarget())\n {\n \/\/ Create project configuration from scratch\n\n \/\/ TODO: Map the Kit to Boost.Build toolset option value\n ProjectExplorer::Kit* defaultKit = ProjectExplorer::KitManager::defaultKit();\n Q_ASSERT(defaultKit);\n\n \/\/ Creates as many {Build|Run|Deploy}Configurations for as corresponding\n \/\/ factories report as available.\n \/\/ For example, BuildConfigurationFactory::availableBuilds => Debug and Release\n ProjectExplorer::Target* target = createTarget(defaultKit);\n QTC_ASSERT(target, return false);\n\n addTarget(target);\n }\n else\n {\n \/\/ Configure project from settings sorced from .user file\n \/\/ TODO: Do we need to handle anything from .user here? Do we need this case?\n BBPM_QDEBUG(displayName() << \"has user file\");\n }\n\n \/\/ Sanity check (taken from GenericProjectManager):\n \/\/ We need both a BuildConfiguration and a RunConfiguration!\n QList<ProjectExplorer::Target*> targetList = targets();\n foreach (ProjectExplorer::Target* t, targetList)\n {\n if (!t->activeBuildConfiguration())\n {\n removeTarget(t);\n continue;\n }\n if (!t->activeRunConfiguration())\n t->addRunConfiguration(new QtSupport::CustomExecutableRunConfiguration(t));\n }\n\n QTC_ASSERT(hasActiveBuildSettings(), return false);\n QTC_ASSERT(activeTarget() != 0, return false);\n\n \/\/ Trigger loading project tree and parsing sources\n refresh();\n\n return true;\n}\n\nvoid Project::refresh()\n{\n QTC_ASSERT(QFileInfo(filesFilePath()).exists(), return);\n QTC_ASSERT(QFileInfo(includesFilePath()).exists(), return);\n\n QSet<QString> oldFileList;\n oldFileList = files_.toSet();\n\n \/\/ Parse project:\n \/\/ The manager does not parse Jamfile files.\n \/\/ Only generates and parses list of source files in Jamfile.${JAMFILE_FILES_EXT}\n QString const projectPath(projectDirectory().toString());\n filesRaw_ = Utility::readLines(filesFilePath());\n files_ = Utility::makeAbsolutePaths(projectPath, filesRaw_);\n\n QStringList includePaths =\n Utility::makeAbsolutePaths(projectPath,\n Utility::readLines(includesFilePath()));\n\n emit fileListChanged();\n\n projectNode_->refresh(oldFileList);\n\n \/\/ TODO: Does it make sense to move this to separate asynchronous task?\n \/\/ TODO: extract updateCppCodeModel\n CppTools::CppModelManager *modelmanager =\n CppTools::CppModelManager::instance();\n if (modelmanager) {\n CppTools::ProjectInfo pinfo = modelmanager->projectInfo(this);\n\n CppTools::ProjectPartBuilder builder(pinfo);\n builder.setDisplayName(displayName());\n builder.setProjectFile(projectFilePath().toString());\n \/\/builder.setDefines();\t\/\/ TODO: waiting for Jamfile parser\n builder.setIncludePaths(QStringList() << projectDirectory().toString() << includePaths);\n\n const QList<Core::Id> languages = builder.createProjectPartsForFiles(files_);\n foreach (Core::Id language, languages)\n setProjectLanguage(language, true);\n\n cppModelFuture_.cancel();\n pinfo.finish();\n cppModelFuture_ = modelmanager->updateProjectInfo(pinfo);\n }\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace BoostBuildProjectManager\n<|endoftext|>"} {"text":"<commit_before>#include <random>\n\n#include \"rank_filter.hxx\"\n\n\n\n\nint main(int argc, char** argv)\n{\n std::random_device rd;\n std::mt19937 gen(rd());\n\n std::normal_distribution<float> dist;\n\n vigra::MultiArray<3, float>::difference_type shape(100, 101, 102);\n vigra::MultiArray<3, float> input(shape);\n vigra::MultiArray<3, float> output(shape);\n\n for (unsigned long i_0 = 0; i_0 < shape[0]; i_0++)\n {\n for (unsigned long i_1 = 0; i_1 < shape[1]; i_1++)\n {\n for (unsigned long i_2 = 0; i_2 < shape[2]; i_2++)\n {\n input(i_0, i_1, i_2) = dist(gen);\n }\n }\n }\n\n lineRankOrderFilter(input, output, 800L, 0.5, 0);\n\n return(0);\n}\n<commit_msg>src\/benchmark_rank_filter.cxx: Fix window size to be reasonable.<commit_after>#include <random>\n\n#include \"rank_filter.hxx\"\n\n\n\n\nint main(int argc, char** argv)\n{\n std::random_device rd;\n std::mt19937 gen(rd());\n\n std::normal_distribution<float> dist;\n\n vigra::MultiArray<3, float>::difference_type shape(100, 101, 102);\n vigra::MultiArray<3, float> input(shape);\n vigra::MultiArray<3, float> output(shape);\n\n for (unsigned long i_0 = 0; i_0 < shape[0]; i_0++)\n {\n for (unsigned long i_1 = 0; i_1 < shape[1]; i_1++)\n {\n for (unsigned long i_2 = 0; i_2 < shape[2]; i_2++)\n {\n input(i_0, i_1, i_2) = dist(gen);\n }\n }\n }\n\n lineRankOrderFilter(input, output, 25L, 0.5, 0);\n\n return(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n *\n * @ingroup spatdiflib\n *\n * @brief\n *\n * @details\n *\n * @authors Chikashi Miyama, Trond Lossius\n *\n * @copyright Copyright (C) 2013 - 2014 Zurich University of the Arts, Institute for Computer Music and Sound Technology @n\n * This code is licensed under the terms of the \"New BSD License\" @n\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"sdConst.h\"\n#include \"sdOSCResponder.h\"\n#include <vector>\n#include <sstream>\n\nusing namespace std;\n\nsdOSCResponder::sdOSCResponder(void){\n queryTime = 0.0;\n writeTime = 0.0;\n}\n\nsdOSCResponder::sdOSCResponder(sdScene *scene){\n sdOSCResponder::scene =scene;\n sdOSCResponder();\n}\n\nvector<string> sdOSCResponder::splitString(const string &str){\n vector<string> res;\n size_t current = 0, found;\n while((found = str.find_first_of('\/', current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + 1;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\nbool sdOSCResponder::checkNumberOfArguments(int expectedNumber, int actualNumber, string command, string &errorMessage){\n string mes;\n if (actualNumber == expectedNumber){\n return true;\n }else if (actualNumber < expectedNumber) {\n mes = \"too few arguments\";\n }else if(actualNumber > expectedNumber){\n mes = \"too many arguments\";\n }\n errorMessage = \"\/spatdif\/error\";\n return false;\n}\n\n\nstring sdOSCResponder::forwardOSCMessage(string oscMessage, double time){\n setQueryTime(time);\n return forwardOSCMessage(oscMessage);\n}\n\nstring sdOSCResponder::forwardOSCMessage(string oscMessage){\n\n\/\/ interpret\n string element, command, errorMessage;\n vector<string> arguments;\n istringstream iss(oscMessage);\n int count = 0;\n EKind kd;\n \n \/\/ analyze\n while(iss.good()){\n iss >> element;\n \n switch(count){\n case 0:{\n \/\/address pattern\n if (element[0] != '\/') {\n cout << \"sdOSCReponder Error: The first element of incoming OSC Message is not an address pattern.\" << endl;\n return NULL;\n }\n \/\/split into parts\n vector <string>ads = splitString(element);\n ads.erase (ads.begin());\n \n if (ads.size() < 2 ) {\n cout << \"sdOSCResponder Error: The address pattern consists of two few elements.\" << endl;\n return NULL;\n }\n \n if(ads[0] != \"spatdifcmd\"){\n cout << \"sdOSCResponder Error: The address pattern of the received message does not begin with \\\"spatdifcmd\\\".\" << endl;\n return NULL;\n }\n \n command = ads[1];\n \n break;\n }\n case 1:{\n if (element[0] == ',') { \/\/ with type tag, just ignore\n iss >> element;\n }\n }\n default:{\n arguments.push_back(element); \/\/ copy all arguments to vector\n }\n }\n count++;\n }\n\n \/\/ interpet the command\n \n if( command == \"setQueryTime\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage))\n return errorMessage;\n \n setQueryTime(stringToDouble(arguments[0]));\n\n }else if(command == \"getQueryTime\"){\n\n if(!checkNumberOfArguments( 0, arguments.size(), command, errorMessage))\n return errorMessage;\n\n return \"\/spatdif\/queryTime d \" + doubleToString(getQueryTime());\n\n }else if(command == \"setWriteTime\"){\n \n if(!checkNumberOfArguments( 1, arguments.size(), command, errorMessage))\n return errorMessage;\n\n setWriteTime(stringToDouble(arguments[0]));\n \n }else if(command == \"getWriteTime\"){\n if(!checkNumberOfArguments( 0, arguments.size(), command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/writeTime d \" + doubleToString(getWriteTime());\n \n }else if(command == \"setPosition\"){\n if(!checkNumberOfArguments( 4, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n double pos[3];\n pos[0] = stringToDouble(arguments[1]);\n pos[1] = stringToDouble(arguments[2]);\n pos[2] = stringToDouble(arguments[3]);\n scene->setValue(arguments[0], writeTime, SD_POSITION, (void*)pos);\n \n }else if(command == \"getPosition\"){\n\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_POSITION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/position ddd \" + event->getValueAsString();\n \n }else if(command == \"setOrientation\"){\n if(!checkNumberOfArguments( 4, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n double ori[3];\n ori[0] = stringToDouble(arguments[1]);\n ori[1] = stringToDouble(arguments[2]);\n ori[2] = stringToDouble(arguments[3]);\n scene->setValue(arguments[0], writeTime, SD_ORIENTATION, (void*)ori);\n \n }else if(command == \"getOrientation\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_ORIENTATION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/orientation ddd \" + event->getValueAsString();\n \n }else if(command == \"setPresent\"){\n if(!checkNumberOfArguments( 2, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n bool present = stringToBool(arguments[1]);\n scene->setValue(arguments[0], writeTime, SD_PRESENT, (void*)&present);\n \n }else if(command == \"getPresent\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_PRESENT);\n if(!event){\n return \"\/spatdif\/error\";\n }\n return \"\/spatdif\/source\/\" + entity->getName() + \"\/present s \" + event->getValueAsString();\n\n }else if(command == \"getNumberOfEntities\"){\n \n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/source\/numberOfEntities i \" + intToString(scene->getNumberOfEntities());\n \n }else if(command == \"getEntityNames\"){\n \n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n int num = scene->getNumberOfEntities();\n string tt, names;\n for(int i = 0; i< num; i++){\n tt += 's';\n names += scene->getEntityName(i);\n names += ' ';\n }\n return \"\/spatdif\/source\/entityNames \" + tt + ' ' + names;\n \n }else if(command == \"getOrdering\"){\n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/ordering s \" + scene->getOrderingAsString();\n \n }else if(command == \"setOrdering\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n if(arguments[0] == \"track\"){\n scene->setOrdering(SD_TRACK);\n }else if(arguments[0] == \"time\"){\n scene->setOrdering(SD_TIME);\n }else{\n return \"\/spatdif\/error\";\n }\n }else if(command == \"addEntity\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->addEntity(arguments[0]);\n }else if(command == \"removeEntity\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->removeEntity(arguments[0]);\n\n }else if(command == \"removeAllEntities\"){\n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->removeAllEntities();\n }\n \n return \"\/spatdif\/success\";\n \n}\n \n\n<commit_msg>added 6 more commands<commit_after>\/** @file\n *\n * @ingroup spatdiflib\n *\n * @brief\n *\n * @details\n *\n * @authors Chikashi Miyama, Trond Lossius\n *\n * @copyright Copyright (C) 2013 - 2014 Zurich University of the Arts, Institute for Computer Music and Sound Technology @n\n * This code is licensed under the terms of the \"New BSD License\" @n\n * http:\/\/creativecommons.org\/licenses\/BSD\/\n *\/\n\n#include \"sdConst.h\"\n#include \"sdOSCResponder.h\"\n#include <vector>\n#include <sstream>\n\nusing namespace std;\n\nsdOSCResponder::sdOSCResponder(void){\n queryTime = 0.0;\n writeTime = 0.0;\n}\n\nsdOSCResponder::sdOSCResponder(sdScene *scene){\n sdOSCResponder::scene =scene;\n sdOSCResponder();\n}\n\nvector<string> sdOSCResponder::splitString(const string &str){\n vector<string> res;\n size_t current = 0, found;\n while((found = str.find_first_of('\/', current)) != string::npos){\n res.push_back(string(str, current, found - current));\n current = found + 1;\n }\n res.push_back(string(str, current, str.size() - current));\n return res;\n}\n\nbool sdOSCResponder::checkNumberOfArguments(int expectedNumber, int actualNumber, string command, string &errorMessage){\n string mes;\n if (actualNumber == expectedNumber){\n return true;\n }else if (actualNumber < expectedNumber) {\n mes = \"too few arguments\";\n }else if(actualNumber > expectedNumber){\n mes = \"too many arguments\";\n }\n errorMessage = \"\/spatdif\/error\";\n return false;\n}\n\n\nstring sdOSCResponder::forwardOSCMessage(string oscMessage, double time){\n setQueryTime(time);\n return forwardOSCMessage(oscMessage);\n}\n\nstring sdOSCResponder::forwardOSCMessage(string oscMessage){\n\n\/\/ interpret\n string element, command, errorMessage;\n vector<string> arguments;\n istringstream iss(oscMessage);\n int count = 0;\n EKind kd;\n \n \/\/ analyze\n while(iss.good()){\n iss >> element;\n \n switch(count){\n case 0:{\n \/\/address pattern\n if (element[0] != '\/') {\n cout << \"sdOSCReponder Error: The first element of incoming OSC Message is not an address pattern.\" << endl;\n return NULL;\n }\n \/\/split into parts\n vector <string>ads = splitString(element);\n ads.erase (ads.begin());\n \n if (ads.size() < 2 ) {\n cout << \"sdOSCResponder Error: The address pattern consists of two few elements.\" << endl;\n return NULL;\n }\n \n if(ads[0] != \"spatdifcmd\"){\n cout << \"sdOSCResponder Error: The address pattern of the received message does not begin with \\\"spatdifcmd\\\".\" << endl;\n return NULL;\n }\n \n command = ads[1];\n \n break;\n }\n case 1:{\n if (element[0] == ',') { \/\/ with type tag, just ignore\n iss >> element;\n }\n }\n default:{\n arguments.push_back(element); \/\/ copy all arguments to vector\n }\n }\n count++;\n }\n\n \/\/ interpet the command\n \n if( command == \"setQueryTime\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage))\n return errorMessage;\n \n setQueryTime(stringToDouble(arguments[0]));\n\n }else if(command == \"getQueryTime\"){\n\n if(!checkNumberOfArguments( 0, arguments.size(), command, errorMessage))\n return errorMessage;\n\n return \"\/spatdif\/queryTime d \" + doubleToString(getQueryTime());\n\n }else if(command == \"setWriteTime\"){\n \n if(!checkNumberOfArguments( 1, arguments.size(), command, errorMessage))\n return errorMessage;\n\n setWriteTime(stringToDouble(arguments[0]));\n \n }else if(command == \"getWriteTime\"){\n if(!checkNumberOfArguments( 0, arguments.size(), command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/writeTime d \" + doubleToString(getWriteTime());\n \n }else if(command == \"setPosition\"){\n if(!checkNumberOfArguments( 4, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n double pos[3];\n pos[0] = stringToDouble(arguments[1]);\n pos[1] = stringToDouble(arguments[2]);\n pos[2] = stringToDouble(arguments[3]);\n scene->setValue(arguments[0], writeTime, SD_POSITION, (void*)pos);\n \n }else if(command == \"getPosition\"){\n\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_POSITION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/position ddd \" + event->getValueAsString();\n \n }else if(command == \"getNextPosition\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getNextEvent(queryTime, SD_POSITION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/position dddd \" + event->getTimeAsString() + ' ' + event->getValueAsString();\n \n }else if(command == \"getPreviousPosition\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getPreviousEvent(queryTime, SD_POSITION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/position dddd \" + event->getTimeAsString() + ' ' + event->getValueAsString();\n \n }\n else if(command == \"setOrientation\"){\n if(!checkNumberOfArguments( 4, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n double ori[3];\n ori[0] = stringToDouble(arguments[1]);\n ori[1] = stringToDouble(arguments[2]);\n ori[2] = stringToDouble(arguments[3]);\n scene->setValue(arguments[0], writeTime, SD_ORIENTATION, (void*)ori);\n \n }else if(command == \"getOrientation\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_ORIENTATION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/orientation ddd \" + event->getValueAsString();\n \n }else if(command == \"getNextOrientation\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getNextEvent(queryTime, SD_ORIENTATION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/orientation dddd \" + event->getTimeAsString() + ' '+ event->getValueAsString();\n \n }else if(command == \"getPreviousOrientation\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getPreviousEvent(queryTime, SD_ORIENTATION);\n if(!event){\n return \"\/spatdif\/error\";\n }\n string returnStr = \"\/spatdif\/source\/\";\n return returnStr + entity->getName() + \"\/orientation dddd \" + event->getTimeAsString() + ' ' + event->getValueAsString();\n \n }\nelse if(command == \"setPresent\"){\n if(!checkNumberOfArguments( 2, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n bool present = stringToBool(arguments[1]);\n scene->setValue(arguments[0], writeTime, SD_PRESENT, (void*)&present);\n \n }else if(command == \"getPresent\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getEvent(queryTime, SD_PRESENT);\n if(!event){\n return \"\/spatdif\/error\";\n }\n return \"\/spatdif\/source\/\" + entity->getName() + \"\/present s \" + event->getValueAsString();\n\n }else if(command == \"getNextPresent\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getNextEvent(queryTime, SD_PRESENT);\n if(!event){\n return \"\/spatdif\/error\";\n }\n return \"\/spatdif\/source\/\" + entity->getName() + \"\/present ds \" + event->getTimeAsString() + ' ' + event->getValueAsString();\n \n }else if(command == \"getPreviousPresent\"){\n \n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n sdEntityCore* entity = scene->getEntity(arguments[0]);\n if (!entity) {\n return \"\/spatdif\/error\";\n }\n sdEventCore* event = (sdEventCore*)entity->getPreviousEvent(queryTime, SD_PRESENT);\n if(!event){\n return \"\/spatdif\/error\";\n }\n return \"\/spatdif\/source\/\" + entity->getName() + \"\/present ds \" + event->getTimeAsString() + ' ' + event->getValueAsString();\n \n }else if(command == \"getNumberOfEntities\"){\n \n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/source\/numberOfEntities i \" + intToString(scene->getNumberOfEntities());\n \n }else if(command == \"getEntityNames\"){\n \n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n int num = scene->getNumberOfEntities();\n string tt, names;\n for(int i = 0; i< num; i++){\n tt += 's';\n names += scene->getEntityName(i);\n names += ' ';\n }\n return \"\/spatdif\/source\/entityNames \" + tt + ' ' + names;\n \n }else if(command == \"getOrdering\"){\n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n return \"\/spatdif\/ordering s \" + scene->getOrderingAsString();\n \n }else if(command == \"setOrdering\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n \n if(arguments[0] == \"track\"){\n scene->setOrdering(SD_TRACK);\n }else if(arguments[0] == \"time\"){\n scene->setOrdering(SD_TIME);\n }else{\n return \"\/spatdif\/error\";\n }\n }else if(command == \"addEntity\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->addEntity(arguments[0]);\n }else if(command == \"removeEntity\"){\n if(!checkNumberOfArguments( 1, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->removeEntity(arguments[0]);\n\n }else if(command == \"removeAllEntities\"){\n if(!checkNumberOfArguments( 0, arguments.size() ,command, errorMessage)){\n return errorMessage;\n }\n scene->removeAllEntities();\n }\n \n return \"\/spatdif\/success\";\n \n}\n \n\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of the Grantlee template system.\n\n Copyright (c) 2009,2010 Stephen Kelly <steveire@gmail.com>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either version\n 2.1 of the Licence, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"util.h\"\n\n#include \"grantlee_latin1literal_p.h\"\n#include \"metaenumvariable_p.h\"\n#include \"metatype.h\"\n\n#include <QtCore\/QStringList>\n\nQString Grantlee::unescapeStringLiteral( const QString &input )\n{\n return input.mid( 1, input.size() - 2 )\n .replace( QLatin1String( \"\\\\\\'\" ), QChar::fromLatin1( '\\'' ) )\n .replace( QLatin1String( \"\\\\\\\"\" ), QChar::fromLatin1( '\"' ) )\n .replace( QLatin1String( \"\\\\\\\\\" ), QChar::fromLatin1( '\\\\' ) );\n}\n\nbool Grantlee::variantIsTrue( const QVariant &variant )\n{\n\n if ( !variant.isValid() )\n return false;\n switch ( variant.userType() ) {\n case QVariant::Bool: {\n return variant.toBool();\n }\n case QVariant::Int: {\n return ( variant.toInt() > 0 );\n }\n case QVariant::Double: {\n return ( variant.toDouble() > 0 );\n }\n case QMetaType::QObjectStar: {\n QObject *obj = variant.value<QObject *>();\n if ( !obj )\n return false;\n\n if ( obj->property( \"__true__\" ).isValid() ) {\n return obj->property( \"__true__\" ).toBool();\n }\n return true;\n }\n case QVariant::List: {\n return ( variant.toList().size() > 0 );\n }\n case QVariant::Hash: {\n return ( variant.toHash().size() > 0 );\n }\n }\n\n return !getSafeString( variant ).get().isEmpty();\n}\n\nQVariantList Grantlee::variantToList( const QVariant &var )\n{\n return MetaType::toVariantList( var );\n}\n\nGrantlee::SafeString Grantlee::markSafe( const Grantlee::SafeString &input )\n{\n Grantlee::SafeString sret = input;\n sret.setSafety( Grantlee::SafeString::IsSafe );\n return sret;\n}\n\nGrantlee::SafeString Grantlee::markForEscaping( const Grantlee::SafeString &input )\n{\n Grantlee::SafeString temp = input;\n if ( input.isSafe() || input.needsEscape() )\n return input;\n\n temp.setNeedsEscape( true );\n return temp;\n}\n\nGrantlee::SafeString Grantlee::getSafeString( const QVariant &input )\n{\n if ( input.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n return input.value<Grantlee::SafeString>();\n } else {\n return input.toString();\n }\n}\n\nbool Grantlee::isSafeString( const QVariant &input )\n{\n const int type = input.userType();\n return (( type == qMetaTypeId<Grantlee::SafeString>() )\n || type == QVariant::String );\n}\n\nstatic QList<int> getPrimitives()\n{\n QList<int> primitives;\n primitives << qMetaTypeId<Grantlee::SafeString>()\n << QVariant::Bool\n << QVariant::Int\n << QVariant::Double\n << QVariant::DateTime;\n return primitives;\n}\n\nbool Grantlee::supportedOutputType( const QVariant &input )\n{\n static const QList<int> primitives = getPrimitives();\n return primitives.contains( input.userType() );\n}\n\n\nbool Grantlee::equals( const QVariant &lhs, const QVariant &rhs )\n{\n\n \/\/ TODO: Redesign...\n\n \/\/ QVariant doesn't use operator== to compare its held data, so we do it manually instead for SafeString.\n bool equal = false;\n if ( lhs.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n if ( rhs.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n equal = ( lhs.value<Grantlee::SafeString>() == rhs.value<Grantlee::SafeString>() );\n } else if ( rhs.userType() == QVariant::String ) {\n equal = ( lhs.value<Grantlee::SafeString>() == rhs.toString() );\n }\n } else if ( rhs.userType() == qMetaTypeId<Grantlee::SafeString>() && lhs.userType() == QVariant::String ) {\n equal = ( rhs.value<Grantlee::SafeString>() == lhs.toString() );\n } else if ( rhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n if ( lhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n equal = ( rhs.value<MetaEnumVariable>() == lhs.value<MetaEnumVariable>() );\n } else if ( lhs.type() == QVariant::Int ) {\n equal = ( rhs.value<MetaEnumVariable>() == lhs.toInt() );\n }\n } else if ( lhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n if ( rhs.type() == QVariant::Int ) {\n equal = ( lhs.value<MetaEnumVariable>() == rhs.toInt() );\n }\n } else {\n equal = (( lhs == rhs ) && ( lhs.userType() == rhs.userType() ) );\n }\n return equal;\n}\n\nGrantlee::SafeString Grantlee::toString( const QVariantList &list )\n{\n QString output( QLatin1Char( '[' ) );\n QVariantList::const_iterator it = list.constBegin();\n const QVariantList::const_iterator end = list.constEnd();\n while ( it != end ) {\n const QVariant item = *it;\n if ( isSafeString( item ) ) {\n output += QLatin1Literal( \"u\\'\" )\n + static_cast<QString>( getSafeString( item ).get() )\n + QLatin1Char( '\\'' );\n }\n if ( ( item.type() == QVariant::Int )\n || ( item.type() == QVariant::UInt )\n || ( item.type() == QVariant::Double )\n || ( item.type() == QVariant::LongLong )\n || ( item.type() == QVariant::ULongLong )\n ) {\n output += item.toString();\n }\n if ( item.type() == QVariant::List ) {\n output += static_cast<QString>( toString( item.toList() ).get() );\n }\n if ( ( it + 1 ) != end )\n output += QLatin1String( \", \" );\n ++it;\n }\n\n return output.append( QLatin1Char( ']' ) );\n}\n\n<commit_msg>Support QDate and QTime objects.<commit_after>\/*\n This file is part of the Grantlee template system.\n\n Copyright (c) 2009,2010 Stephen Kelly <steveire@gmail.com>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either version\n 2.1 of the Licence, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"util.h\"\n\n#include \"grantlee_latin1literal_p.h\"\n#include \"metaenumvariable_p.h\"\n#include \"metatype.h\"\n\n#include <QtCore\/QStringList>\n\nQString Grantlee::unescapeStringLiteral( const QString &input )\n{\n return input.mid( 1, input.size() - 2 )\n .replace( QLatin1String( \"\\\\\\'\" ), QChar::fromLatin1( '\\'' ) )\n .replace( QLatin1String( \"\\\\\\\"\" ), QChar::fromLatin1( '\"' ) )\n .replace( QLatin1String( \"\\\\\\\\\" ), QChar::fromLatin1( '\\\\' ) );\n}\n\nbool Grantlee::variantIsTrue( const QVariant &variant )\n{\n\n if ( !variant.isValid() )\n return false;\n switch ( variant.userType() ) {\n case QVariant::Bool: {\n return variant.toBool();\n }\n case QVariant::Int: {\n return ( variant.toInt() > 0 );\n }\n case QVariant::Double: {\n return ( variant.toDouble() > 0 );\n }\n case QMetaType::QObjectStar: {\n QObject *obj = variant.value<QObject *>();\n if ( !obj )\n return false;\n\n if ( obj->property( \"__true__\" ).isValid() ) {\n return obj->property( \"__true__\" ).toBool();\n }\n return true;\n }\n case QVariant::List: {\n return ( variant.toList().size() > 0 );\n }\n case QVariant::Hash: {\n return ( variant.toHash().size() > 0 );\n }\n }\n\n return !getSafeString( variant ).get().isEmpty();\n}\n\nQVariantList Grantlee::variantToList( const QVariant &var )\n{\n return MetaType::toVariantList( var );\n}\n\nGrantlee::SafeString Grantlee::markSafe( const Grantlee::SafeString &input )\n{\n Grantlee::SafeString sret = input;\n sret.setSafety( Grantlee::SafeString::IsSafe );\n return sret;\n}\n\nGrantlee::SafeString Grantlee::markForEscaping( const Grantlee::SafeString &input )\n{\n Grantlee::SafeString temp = input;\n if ( input.isSafe() || input.needsEscape() )\n return input;\n\n temp.setNeedsEscape( true );\n return temp;\n}\n\nGrantlee::SafeString Grantlee::getSafeString( const QVariant &input )\n{\n if ( input.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n return input.value<Grantlee::SafeString>();\n } else {\n return input.toString();\n }\n}\n\nbool Grantlee::isSafeString( const QVariant &input )\n{\n const int type = input.userType();\n return (( type == qMetaTypeId<Grantlee::SafeString>() )\n || type == QVariant::String );\n}\n\nstatic QList<int> getPrimitives()\n{\n QList<int> primitives;\n primitives << qMetaTypeId<Grantlee::SafeString>()\n << QVariant::Bool\n << QVariant::Int\n << QVariant::Double\n << QVariant::Date\n << QVariant::Time\n << QVariant::DateTime;\n return primitives;\n}\n\nbool Grantlee::supportedOutputType( const QVariant &input )\n{\n static const QList<int> primitives = getPrimitives();\n return primitives.contains( input.userType() );\n}\n\n\nbool Grantlee::equals( const QVariant &lhs, const QVariant &rhs )\n{\n\n \/\/ TODO: Redesign...\n\n \/\/ QVariant doesn't use operator== to compare its held data, so we do it manually instead for SafeString.\n bool equal = false;\n if ( lhs.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n if ( rhs.userType() == qMetaTypeId<Grantlee::SafeString>() ) {\n equal = ( lhs.value<Grantlee::SafeString>() == rhs.value<Grantlee::SafeString>() );\n } else if ( rhs.userType() == QVariant::String ) {\n equal = ( lhs.value<Grantlee::SafeString>() == rhs.toString() );\n }\n } else if ( rhs.userType() == qMetaTypeId<Grantlee::SafeString>() && lhs.userType() == QVariant::String ) {\n equal = ( rhs.value<Grantlee::SafeString>() == lhs.toString() );\n } else if ( rhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n if ( lhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n equal = ( rhs.value<MetaEnumVariable>() == lhs.value<MetaEnumVariable>() );\n } else if ( lhs.type() == QVariant::Int ) {\n equal = ( rhs.value<MetaEnumVariable>() == lhs.toInt() );\n }\n } else if ( lhs.userType() == qMetaTypeId<MetaEnumVariable>() ) {\n if ( rhs.type() == QVariant::Int ) {\n equal = ( lhs.value<MetaEnumVariable>() == rhs.toInt() );\n }\n } else {\n equal = (( lhs == rhs ) && ( lhs.userType() == rhs.userType() ) );\n }\n return equal;\n}\n\nGrantlee::SafeString Grantlee::toString( const QVariantList &list )\n{\n QString output( QLatin1Char( '[' ) );\n QVariantList::const_iterator it = list.constBegin();\n const QVariantList::const_iterator end = list.constEnd();\n while ( it != end ) {\n const QVariant item = *it;\n if ( isSafeString( item ) ) {\n output += QLatin1Literal( \"u\\'\" )\n + static_cast<QString>( getSafeString( item ).get() )\n + QLatin1Char( '\\'' );\n }\n if ( ( item.type() == QVariant::Int )\n || ( item.type() == QVariant::UInt )\n || ( item.type() == QVariant::Double )\n || ( item.type() == QVariant::LongLong )\n || ( item.type() == QVariant::ULongLong )\n ) {\n output += item.toString();\n }\n if ( item.type() == QVariant::List ) {\n output += static_cast<QString>( toString( item.toList() ).get() );\n }\n if ( ( it + 1 ) != end )\n output += QLatin1String( \", \" );\n ++it;\n }\n\n return output.append( QLatin1Char( ']' ) );\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"c7a\/api\/dia_base.hpp\"\n#include \"c7a\/engine\/stage_builder.hpp\"\n#include \"c7a\/api\/dia.hpp\"\n#include \"c7a\/api\/context.hpp\"\n\nusing namespace c7a::engine;\n\nTEST(Stage, GetStagesFromBuilder) {\n using c7a::DIA;\n using c7a::Context;\n Context ctx;\n auto doubles = ctx.ReadFromFileSystem(\"tests\/inputs\/test1\", [](std::string line) {\n return std::stod(line);\n });\n\n auto key_ex = [](double in) { return (int) in; };\n auto red_fn = [](double in1, double in2) { return in1 + in2; };\n auto map_fn = [](double input) {\n std::cout << \"Map\" << std::endl;\n return input;\n };\n\n auto fmap_fn = [](double input, std::function<void(double)> emit_func) {\n std::cout << \"FlatMap\" << std::endl;\n emit_func(input);\n emit_func(input);\n };\n\n auto duplicates = doubles.Map(map_fn);\n \/\/ auto duplicates2 = duplicates.Map(map_fn);\n auto doubles2 = doubles.Reduce(key_ex, red_fn);\n\n \/\/ auto duplicates3 = red_duplicates.Map(map_fn);\n auto red_duplicates2 = doubles2.Reduce(key_ex, red_fn);\n\n\n std::vector<Stage> result;\n FindStages(red_duplicates2.get_node(), result);\n for (auto s : result)\n {\n s.Run();\n }\n}\n<commit_msg>Use g_workpath for input files.<commit_after>#include \"gtest\/gtest.h\"\n#include <tests\/c7a-tests.hpp>\n#include \"c7a\/api\/dia_base.hpp\"\n#include \"c7a\/engine\/stage_builder.hpp\"\n#include \"c7a\/api\/dia.hpp\"\n#include \"c7a\/api\/context.hpp\"\n\nusing namespace c7a::engine;\n\nTEST(Stage, GetStagesFromBuilder) {\n using c7a::DIA;\n using c7a::Context;\n Context ctx;\n auto doubles = ctx.ReadFromFileSystem(\n g_workpath + \"\/inputs\/test1\",\n [](std::string line) {\n return std::stod(line);\n });\n\n auto key_ex = [](double in) { return (int) in; };\n auto red_fn = [](double in1, double in2) { return in1 + in2; };\n auto map_fn = [](double input) {\n std::cout << \"Map\" << std::endl;\n return input;\n };\n\n auto fmap_fn = [](double input, std::function<void(double)> emit_func) {\n std::cout << \"FlatMap\" << std::endl;\n emit_func(input);\n emit_func(input);\n };\n\n auto duplicates = doubles.Map(map_fn);\n \/\/ auto duplicates2 = duplicates.Map(map_fn);\n auto doubles2 = doubles.Reduce(key_ex, red_fn);\n\n \/\/ auto duplicates3 = red_duplicates.Map(map_fn);\n auto red_duplicates2 = doubles2.Reduce(key_ex, red_fn);\n\n\n std::vector<Stage> result;\n FindStages(red_duplicates2.get_node(), result);\n for (auto s : result)\n {\n s.Run();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#define LOG_NDEBUG 0\n#define LOG_TAG \"volume\"\n#include <utils\/Log.h>\n#include <cutils\/properties.h>\n#include <media\/AudioSystem.h>\n\nusing namespace android;\n\n#define VOLUME_MAX_LEVEL 100\n\nint clampVolume(int v) {\n if (v < 0) return 0;\n if (v > VOLUME_MAX_LEVEL) return VOLUME_MAX_LEVEL;\n return v;\n}\n\n#define OK(expression) \\\n { \\\n status_t err = expression; \\\n if (err != 0) { \\\n ALOGE(#expression \" failed: %d\\n\", err); \\\n printf(\"Error: \" #expression \" failed: %d\\n\", err); \\\n exit(1); \\\n } \\\n } \\\n\n\nint main(int argc, char **argv)\n{\n int level = clampVolume(property_get_int32(\"persist.silk.volume.level\", 0));\n bool mute = property_get_bool(\"persist.silk.volume.mute\", 0) != 0;\n bool init = property_get_bool(\"silk.volume.init\", 0) != 0;\n\n if (!init) {\n ALOGV(\"Initializing audio system\");\n for (int as = AUDIO_STREAM_MIN; as < AUDIO_STREAM_PUBLIC_CNT; ++as) {\n OK(AudioSystem::initStreamVolume(static_cast<audio_stream_type_t>(as),\n 0, VOLUME_MAX_LEVEL));\n }\n OK(AudioSystem::setMasterVolume(1.0));\n OK(AudioSystem::setMode(AUDIO_MODE_NORMAL));\n property_set(\"silk.volume.init\", \"true\");\n }\n\n ALOGW(\"Volume: %.1f%% (%d of %d) mute=%d\", 100.0 * level \/ VOLUME_MAX_LEVEL,\n level, VOLUME_MAX_LEVEL, mute);\n\n OK(AudioSystem::setMasterMute(mute));\n for (int as = AUDIO_STREAM_MIN; as < AUDIO_STREAM_PUBLIC_CNT; ++as) {\n OK(AudioSystem::setStreamVolumeIndex(static_cast<audio_stream_type_t>(as),\n level, AUDIO_DEVICE_OUT_SPEAKER));\n }\n\n return 0;\n}\n<commit_msg>Suppress -Wunused-parameter<commit_after>#define LOG_NDEBUG 0\n#define LOG_TAG \"volume\"\n#include <utils\/Log.h>\n#include <cutils\/properties.h>\n#include <media\/AudioSystem.h>\n\nusing namespace android;\n\n#define VOLUME_MAX_LEVEL 100\n\nint clampVolume(int v) {\n if (v < 0) return 0;\n if (v > VOLUME_MAX_LEVEL) return VOLUME_MAX_LEVEL;\n return v;\n}\n\n#define OK(expression) \\\n { \\\n status_t err = expression; \\\n if (err != 0) { \\\n ALOGE(#expression \" failed: %d\\n\", err); \\\n printf(\"Error: \" #expression \" failed: %d\\n\", err); \\\n exit(1); \\\n } \\\n } \\\n\n\nint main(int argc, char **argv)\n{\n (void) argc;\n (void) argv;\n\n int level = clampVolume(property_get_int32(\"persist.silk.volume.level\", 0));\n bool mute = property_get_bool(\"persist.silk.volume.mute\", 0) != 0;\n bool init = property_get_bool(\"silk.volume.init\", 0) != 0;\n\n if (!init) {\n ALOGV(\"Initializing audio system\");\n for (int as = AUDIO_STREAM_MIN; as < AUDIO_STREAM_PUBLIC_CNT; ++as) {\n OK(AudioSystem::initStreamVolume(static_cast<audio_stream_type_t>(as),\n 0, VOLUME_MAX_LEVEL));\n }\n OK(AudioSystem::setMasterVolume(1.0));\n OK(AudioSystem::setMode(AUDIO_MODE_NORMAL));\n property_set(\"silk.volume.init\", \"true\");\n }\n\n ALOGW(\"Volume: %.1f%% (%d of %d) mute=%d\", 100.0 * level \/ VOLUME_MAX_LEVEL,\n level, VOLUME_MAX_LEVEL, mute);\n\n OK(AudioSystem::setMasterMute(mute));\n for (int as = AUDIO_STREAM_MIN; as < AUDIO_STREAM_PUBLIC_CNT; ++as) {\n OK(AudioSystem::setStreamVolumeIndex(static_cast<audio_stream_type_t>(as),\n level, AUDIO_DEVICE_OUT_SPEAKER));\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Definition of member functions of class Scanner *\/\n\n#include \"..\/headers\/Scanner.hpp\"\n\n#include <utility>\n#include <string>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n\nusing namespace std;\n\n\nScanner::Scanner() :\n m_lineNo(1),\n m_column(1),\n m_errors(0),\n m_sourceFile(),\n m_currentToken(0),\n m_nTokens(0),\n m_tokensLexemes(),\n m_keywordsMap(),\n m_errorReporter()\n{\n m_keywordsMap[\"alfanumerico\"] = KEYWORD_ALPHANUM;\n m_keywordsMap[\"canal\"] = KEYWORD_CHANNEL;\n m_keywordsMap[\"caracter\"] = KEYWORD_CHAR;\n m_keywordsMap[\"caso\"] = KEYWORD_CASE;\n m_keywordsMap[\"const\"] = KEYWORD_CONST;\n m_keywordsMap[\"continua\"] = KEYWORD_CONTINUE;\n m_keywordsMap[\"defecto\"] = KEYWORD_DEFAULT;\n m_keywordsMap[\"desde\"] = KEYWORD_FOR;\n m_keywordsMap[\"diferir\"] = KEYWORD_DIFFER;\n m_keywordsMap[\"div\"] = KEYWORD_DIV;\n m_keywordsMap[\"entero\"] = KEYWORD_INT;\n m_keywordsMap[\"enteros\"] = KEYWORD_UINT;\n m_keywordsMap[\"estructura\"] = KEYWORD_STRUCT;\n m_keywordsMap[\"funcion\"] = KEYWORD_FUNCTION;\n m_keywordsMap[\"importar\"] = KEYWORD_IMPORT;\n m_keywordsMap[\"interfaz\"] = KEYWORD_INTERFACE;\n m_keywordsMap[\"interrumpe\"] = KEYWORD_BREAK;\n m_keywordsMap[\"ir\"] = KEYWORD_GO;\n m_keywordsMap[\"ir_a\"] = KEYWORD_GOTO;\n m_keywordsMap[\"logico\"] = KEYWORD_LOGIC;\n m_keywordsMap[\"mapa\"] = KEYWORD_MAP;\n m_keywordsMap[\"mod\"] = KEYWORD_MOD;\n m_keywordsMap[\"paquete\"] = KEYWORD_PACKET;\n m_keywordsMap[\"principal\"] = KEYWORD_MAIN;\n m_keywordsMap[\"rango\"] = KEYWORD_RANGE;\n m_keywordsMap[\"real\"] = KEYWORD_REAL;\n m_keywordsMap[\"regresa\"] = KEYWORD_RETURN;\n m_keywordsMap[\"si\"] = KEYWORD_IF;\n m_keywordsMap[\"sino\"] = KEYWORD_ELSE;\n m_keywordsMap[\"selecciona\"] = KEYWORD_SELECT;\n m_keywordsMap[\"tipo\"] = KEYWORD_TYPE;\n m_keywordsMap[\"valor\"] = KEYWORD_SWITCH;\n m_keywordsMap[\"variable\"] = KEYWORD_VAR;\n}\n\n\nvoid Scanner::scan(const string& fileName) { \n m_sourceFile.open(fileName.c_str());\n\n if (m_sourceFile.is_open())\n {\n\n char currentChar;\n int nextState = 0, currentState = 0;\n TokenType_t token;\n string lexeme;\n\n string line;\n size_t lineLength;\n m_lineNo = 1;\n while (m_sourceFile.good() && m_errors < ERRORS_MAX_LIMIT) {\n getline(m_sourceFile, line);\n line += \"\\n\";\n\n lineLength = line.length();\n m_column = 1;\n while (m_column <= lineLength && m_errors <= ERRORS_MAX_LIMIT) {\n currentChar = line.at(m_column - 1);\n nextState = automata[currentState][getTransitionIndex(currentChar)];\n\n#ifdef DEBUG\n cout << \"CState: \" << setw(2) << currentState << \" NState: \" << \n setw(2) << nextState << \" TIndex: \" << \n setw(2) << getTransitionIndex(currentChar) << \n \" Char: \";\n if (!isspace(currentChar))\n cout << currentChar;\n else\n cout << ' ';\n cout << \" : \" << setw(3) << (int)currentChar << endl;\n#endif\n \n \n if (nextState == STATE_ACCEPT_ERROR) {\n switch (currentState) {\n case 1 :\n case 2 : token = TOKEN_OCT;\n break;\n case 4 :\n token = TOKEN_HEX;\n break;\n case 5 :\n token = TOKEN_DEC;\n break;\n case 6 :\n case 11 :\n token = TOKEN_FLOAT;\n break;\n case 7 :\n case 26 :\n token = TOKEN_DELIMITER;\n break;\n case 8 :\n token = TOKEN_FLOAT;\n break;\n case 13 :\n token = TOKEN_STRING;\n break;\n case 14 :\n case 19 :\n token = TOKEN_ARITHOP;\n break;\n case 16 :\n token = TOKEN_LINECOMMENT;\n break;\n case 18 :\n token = TOKEN_MULTICOMMENT;\n break;\n case 22 :\n case 24 :\n token = TOKEN_LOGICOP;\n break;\n case 23 :\n case 27 :\n token = TOKEN_ASSIGNOP;\n break;\n case 25 :\n case 35 :\n case 36 :\n token = TOKEN_RELOP;\n break;\n case 28 : \n token = TOKEN_IDEN;\n if (m_keywordsMap.find(lexeme) != m_keywordsMap.end()) {\n token = TOKEN_KEYWORD;\n }\n else if (lexeme.compare(\"verdadero\") == 0 ||\n lexeme.compare(\"falso\") == 0) {\n token = TOKEN_LOGICCONST;\n }\n break;\n case 29 :\n token = TOKEN_DELIMITER;\n break;\n case 33 :\n token = TOKEN_CHARCONST;\n break;\n default :\n cerr << \"vecomp: error de estado siguiente\" << endl;\n break;\n }\n\n if (token != TOKEN_LINECOMMENT && token != TOKEN_MULTICOMMENT)\n m_tokensLexemes.push(TokenLexeme(token, lexeme, m_lineNo, \n m_column - lexeme.length()));\n\n token = TOKEN_INVALID;\n lexeme = \"\";\n nextState = 0;\n --m_column;\n }\n else if (nextState == STATE_ERROR) {\n#ifdef DEBUG\n cout << \"calling lexicalerror\" << currentState << \" \" <<\n currentChar << endl;\n#endif\n m_errorReporter.writeLexicalError(currentState, currentChar, line,\n lexeme, m_lineNo, m_column);\n ++m_errors;\n\n token = TOKEN_INVALID;\n lexeme = \"\";\n nextState = 0;\n }\n else if ( isspace(currentChar) && \n (currentState == 12 || currentState == 15 || \n currentState == 17))\n lexeme += currentChar;\n else if (!isspace(currentChar))\n lexeme += currentChar;\n\n currentState = nextState;\n\n ++m_column;\n }\n ++m_lineNo;\n line = \"\";\n }\n\n if (!m_sourceFile.good()) {\n#ifdef DEBUG\n cout << \"final state: \" << currentState << endl;\n#endif\n if (currentState != 0 && !isTerminalState(currentState))\n m_errorReporter.writeLexicalError(currentState, currentChar, line,\n lexeme, m_lineNo, m_column);\n }\n\n m_nTokens = m_tokensLexemes.size();\n\n if (m_tokensLexemes.empty())\n m_errorReporter.writeError(\"archivo vacio\");\n }\n else {\n m_errorReporter.writeError(\"error al abrir codigo fuente\");\n ++m_errors;\n }\n}\n\nTokenLexeme Scanner::getNextTokenLexeme() {\n TokenLexeme temporal;\n if (!m_tokensLexemes.empty()) {\n temporal = m_tokensLexemes.front();\n m_tokensLexemes.pop();\n }\n return temporal;\n}\n\nTransition_t Scanner::getTransitionIndex(char character) {\n Transition_t transitionIndex = TRANS_ANY; \n\n if (isdigit(character)) {\n if (character == '0')\n transitionIndex = TRANS_ZERO;\n else if (character <= '7')\n transitionIndex = TRANS_OCT;\n else\n transitionIndex = TRANS_DEC;\n }\n else if (isalpha(character)) {\n if (tolower(character) == 'e')\n transitionIndex = TRANS_E;\n else if (tolower(character) == 'x')\n transitionIndex = TRANS_X;\n else if (tolower(character) <= 'f')\n transitionIndex = TRANS_HEX;\n else\n transitionIndex = TRANS_LETTER;\n }\n else {\n switch (character) {\n case '|' :\n transitionIndex = TRANS_PIPE;\n break;\n case '&' :\n transitionIndex = TRANS_AMPERS;\n break;\n case '!' :\n transitionIndex = TRANS_EXCLAMATION;\n break;\n case ' ' :\n case '\\t' :\n case '\\r' :\n transitionIndex = TRANS_SPACE;\n break;\n case '\\n' :\n transitionIndex = TRANS_NEWLINE;\n break;\n case ',' :\n case ';' :\n case '(' :\n case ')' :\n case '[' :\n case ']' :\n case '{' :\n case '}' :\n transitionIndex = TRANS_DELIMITER;\n break;\n case '+' :\n case '-' :\n transitionIndex = TRANS_SIGN;\n break;\n case '*' :\n transitionIndex = TRANS_ASTERISK;\n break;\n case '\/' :\n transitionIndex = TRANS_SLASH;\n break;\n case '%' :\n case '^' :\n transitionIndex = TRANS_ARITHMETIC;\n break;\n case ':' :\n transitionIndex = TRANS_COLON;\n break;\n case '=' :\n transitionIndex = TRANS_EQUAL;\n break;\n case '<' :\n transitionIndex = TRANS_LESSER;\n break;\n case '>' :\n transitionIndex = TRANS_GREATER;\n break;\n case '_' :\n transitionIndex = TRANS_UNDERSCORE;\n break;\n case '\\'' :\n transitionIndex = TRANS_SQUOTE;\n break;\n case '\\\\' :\n transitionIndex = TRANS_BACKSLASH;\n case '\"' :\n transitionIndex = TRANS_DQUOTE;\n break;\n case '.' :\n transitionIndex = TRANS_DOT;\n break;\n default :\n transitionIndex = TRANS_ANY;\n break;\n }\n }\n \n return transitionIndex;\n}\n\nint Scanner::getMaxTokens() const {\n return m_nTokens;\n}\n\nint Scanner::getErrors() const {\n return m_errors;\n}\n\nbool Scanner::isTerminalState(int state) {\n switch (state) {\n case 1 :\n case 2 :\n case 4 :\n case 5 :\n case 6 :\n case 7 :\n case 8 :\n case 11 :\n case 13 :\n case 14 :\n case 16 :\n case 18 :\n case 19 :\n case 22 :\n case 23 :\n case 24 :\n case 25 :\n case 26 :\n case 27 :\n case 28 :\n case 29 :\n case 33 :\n case 35 :\n case 36 :\n return true;\n break;\n }\n\n return false;\n}\n\n<commit_msg>added increment in errors count when file empty<commit_after>\/* Definition of member functions of class Scanner *\/\n\n#include \"..\/headers\/Scanner.hpp\"\n\n#include <utility>\n#include <string>\n#include <iostream>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n\nusing namespace std;\n\n\nScanner::Scanner() :\n m_lineNo(1),\n m_column(1),\n m_errors(0),\n m_sourceFile(),\n m_currentToken(0),\n m_nTokens(0),\n m_tokensLexemes(),\n m_keywordsMap(),\n m_errorReporter()\n{\n m_keywordsMap[\"alfanumerico\"] = KEYWORD_ALPHANUM;\n m_keywordsMap[\"canal\"] = KEYWORD_CHANNEL;\n m_keywordsMap[\"caracter\"] = KEYWORD_CHAR;\n m_keywordsMap[\"caso\"] = KEYWORD_CASE;\n m_keywordsMap[\"const\"] = KEYWORD_CONST;\n m_keywordsMap[\"continua\"] = KEYWORD_CONTINUE;\n m_keywordsMap[\"defecto\"] = KEYWORD_DEFAULT;\n m_keywordsMap[\"desde\"] = KEYWORD_FOR;\n m_keywordsMap[\"diferir\"] = KEYWORD_DIFFER;\n m_keywordsMap[\"div\"] = KEYWORD_DIV;\n m_keywordsMap[\"entero\"] = KEYWORD_INT;\n m_keywordsMap[\"enteros\"] = KEYWORD_UINT;\n m_keywordsMap[\"estructura\"] = KEYWORD_STRUCT;\n m_keywordsMap[\"funcion\"] = KEYWORD_FUNCTION;\n m_keywordsMap[\"importar\"] = KEYWORD_IMPORT;\n m_keywordsMap[\"interfaz\"] = KEYWORD_INTERFACE;\n m_keywordsMap[\"interrumpe\"] = KEYWORD_BREAK;\n m_keywordsMap[\"ir\"] = KEYWORD_GO;\n m_keywordsMap[\"ir_a\"] = KEYWORD_GOTO;\n m_keywordsMap[\"logico\"] = KEYWORD_LOGIC;\n m_keywordsMap[\"mapa\"] = KEYWORD_MAP;\n m_keywordsMap[\"mod\"] = KEYWORD_MOD;\n m_keywordsMap[\"paquete\"] = KEYWORD_PACKET;\n m_keywordsMap[\"principal\"] = KEYWORD_MAIN;\n m_keywordsMap[\"rango\"] = KEYWORD_RANGE;\n m_keywordsMap[\"real\"] = KEYWORD_REAL;\n m_keywordsMap[\"regresa\"] = KEYWORD_RETURN;\n m_keywordsMap[\"si\"] = KEYWORD_IF;\n m_keywordsMap[\"sino\"] = KEYWORD_ELSE;\n m_keywordsMap[\"selecciona\"] = KEYWORD_SELECT;\n m_keywordsMap[\"tipo\"] = KEYWORD_TYPE;\n m_keywordsMap[\"valor\"] = KEYWORD_SWITCH;\n m_keywordsMap[\"variable\"] = KEYWORD_VAR;\n}\n\n\nvoid Scanner::scan(const string& fileName) { \n m_sourceFile.open(fileName.c_str());\n\n if (m_sourceFile.is_open())\n {\n\n char currentChar;\n int nextState = 0, currentState = 0;\n TokenType_t token;\n string lexeme;\n\n string line;\n size_t lineLength;\n m_lineNo = 1;\n while (m_sourceFile.good() && m_errors < ERRORS_MAX_LIMIT) {\n getline(m_sourceFile, line);\n line += \"\\n\";\n\n lineLength = line.length();\n m_column = 1;\n while (m_column <= lineLength && m_errors <= ERRORS_MAX_LIMIT) {\n currentChar = line.at(m_column - 1);\n nextState = automata[currentState][getTransitionIndex(currentChar)];\n\n#ifdef DEBUG\n cout << \"CState: \" << setw(2) << currentState << \" NState: \" << \n setw(2) << nextState << \" TIndex: \" << \n setw(2) << getTransitionIndex(currentChar) << \n \" Char: \";\n if (!isspace(currentChar))\n cout << currentChar;\n else\n cout << ' ';\n cout << \" : \" << setw(3) << (int)currentChar << endl;\n#endif\n \n \n if (nextState == STATE_ACCEPT_ERROR) {\n switch (currentState) {\n case 1 :\n case 2 : token = TOKEN_OCT;\n break;\n case 4 :\n token = TOKEN_HEX;\n break;\n case 5 :\n token = TOKEN_DEC;\n break;\n case 6 :\n case 11 :\n token = TOKEN_FLOAT;\n break;\n case 7 :\n case 26 :\n token = TOKEN_DELIMITER;\n break;\n case 8 :\n token = TOKEN_FLOAT;\n break;\n case 13 :\n token = TOKEN_STRING;\n break;\n case 14 :\n case 19 :\n token = TOKEN_ARITHOP;\n break;\n case 16 :\n token = TOKEN_LINECOMMENT;\n break;\n case 18 :\n token = TOKEN_MULTICOMMENT;\n break;\n case 22 :\n case 24 :\n token = TOKEN_LOGICOP;\n break;\n case 23 :\n case 27 :\n token = TOKEN_ASSIGNOP;\n break;\n case 25 :\n case 35 :\n case 36 :\n token = TOKEN_RELOP;\n break;\n case 28 : \n token = TOKEN_IDEN;\n if (m_keywordsMap.find(lexeme) != m_keywordsMap.end()) {\n token = TOKEN_KEYWORD;\n }\n else if (lexeme.compare(\"verdadero\") == 0 ||\n lexeme.compare(\"falso\") == 0) {\n token = TOKEN_LOGICCONST;\n }\n break;\n case 29 :\n token = TOKEN_DELIMITER;\n break;\n case 33 :\n token = TOKEN_CHARCONST;\n break;\n default :\n cerr << \"vecomp: error de estado siguiente\" << endl;\n break;\n }\n\n if (token != TOKEN_LINECOMMENT && token != TOKEN_MULTICOMMENT)\n m_tokensLexemes.push(TokenLexeme(token, lexeme, m_lineNo, \n m_column - lexeme.length()));\n\n token = TOKEN_INVALID;\n lexeme = \"\";\n nextState = 0;\n --m_column;\n }\n else if (nextState == STATE_ERROR) {\n#ifdef DEBUG\n cout << \"calling lexicalerror\" << currentState << \" \" <<\n currentChar << endl;\n#endif\n m_errorReporter.writeLexicalError(currentState, currentChar, line,\n lexeme, m_lineNo, m_column);\n ++m_errors;\n\n token = TOKEN_INVALID;\n lexeme = \"\";\n nextState = 0;\n }\n else if ( isspace(currentChar) && \n (currentState == 12 || currentState == 15 || \n currentState == 17))\n lexeme += currentChar;\n else if (!isspace(currentChar))\n lexeme += currentChar;\n\n currentState = nextState;\n\n ++m_column;\n }\n ++m_lineNo;\n line = \"\";\n }\n\n if (!m_sourceFile.good()) {\n#ifdef DEBUG\n cout << \"final state: \" << currentState << endl;\n#endif\n if (currentState != 0 && !isTerminalState(currentState))\n m_errorReporter.writeLexicalError(currentState, currentChar, line,\n lexeme, m_lineNo, m_column);\n }\n\n m_nTokens = m_tokensLexemes.size();\n\n if (m_tokensLexemes.empty()) {\n m_errorReporter.writeError(\"archivo vacio\");\n ++m_errors;\n }\n }\n else {\n m_errorReporter.writeError(\"error al abrir codigo fuente\");\n ++m_errors;\n }\n}\n\nTokenLexeme Scanner::getNextTokenLexeme() {\n TokenLexeme temporal;\n if (!m_tokensLexemes.empty()) {\n temporal = m_tokensLexemes.front();\n m_tokensLexemes.pop();\n }\n return temporal;\n}\n\nTransition_t Scanner::getTransitionIndex(char character) {\n Transition_t transitionIndex = TRANS_ANY; \n\n if (isdigit(character)) {\n if (character == '0')\n transitionIndex = TRANS_ZERO;\n else if (character <= '7')\n transitionIndex = TRANS_OCT;\n else\n transitionIndex = TRANS_DEC;\n }\n else if (isalpha(character)) {\n if (tolower(character) == 'e')\n transitionIndex = TRANS_E;\n else if (tolower(character) == 'x')\n transitionIndex = TRANS_X;\n else if (tolower(character) <= 'f')\n transitionIndex = TRANS_HEX;\n else\n transitionIndex = TRANS_LETTER;\n }\n else {\n switch (character) {\n case '|' :\n transitionIndex = TRANS_PIPE;\n break;\n case '&' :\n transitionIndex = TRANS_AMPERS;\n break;\n case '!' :\n transitionIndex = TRANS_EXCLAMATION;\n break;\n case ' ' :\n case '\\t' :\n case '\\r' :\n transitionIndex = TRANS_SPACE;\n break;\n case '\\n' :\n transitionIndex = TRANS_NEWLINE;\n break;\n case ',' :\n case ';' :\n case '(' :\n case ')' :\n case '[' :\n case ']' :\n case '{' :\n case '}' :\n transitionIndex = TRANS_DELIMITER;\n break;\n case '+' :\n case '-' :\n transitionIndex = TRANS_SIGN;\n break;\n case '*' :\n transitionIndex = TRANS_ASTERISK;\n break;\n case '\/' :\n transitionIndex = TRANS_SLASH;\n break;\n case '%' :\n case '^' :\n transitionIndex = TRANS_ARITHMETIC;\n break;\n case ':' :\n transitionIndex = TRANS_COLON;\n break;\n case '=' :\n transitionIndex = TRANS_EQUAL;\n break;\n case '<' :\n transitionIndex = TRANS_LESSER;\n break;\n case '>' :\n transitionIndex = TRANS_GREATER;\n break;\n case '_' :\n transitionIndex = TRANS_UNDERSCORE;\n break;\n case '\\'' :\n transitionIndex = TRANS_SQUOTE;\n break;\n case '\\\\' :\n transitionIndex = TRANS_BACKSLASH;\n case '\"' :\n transitionIndex = TRANS_DQUOTE;\n break;\n case '.' :\n transitionIndex = TRANS_DOT;\n break;\n default :\n transitionIndex = TRANS_ANY;\n break;\n }\n }\n \n return transitionIndex;\n}\n\nint Scanner::getMaxTokens() const {\n return m_nTokens;\n}\n\nint Scanner::getErrors() const {\n return m_errors;\n}\n\nbool Scanner::isTerminalState(int state) {\n switch (state) {\n case 1 :\n case 2 :\n case 4 :\n case 5 :\n case 6 :\n case 7 :\n case 8 :\n case 11 :\n case 13 :\n case 14 :\n case 16 :\n case 18 :\n case 19 :\n case 22 :\n case 23 :\n case 24 :\n case 25 :\n case 26 :\n case 27 :\n case 28 :\n case 29 :\n case 33 :\n case 35 :\n case 36 :\n return true;\n break;\n }\n\n return false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n#include \"native-stack.hh\"\n#include \"native-stack-impl.hh\"\n#include \"net.hh\"\n#include \"ip.hh\"\n#include \"tcp-stack.hh\"\n#include \"udp.hh\"\n#include \"virtio.hh\"\n#include \"xenfront.hh\"\n#include \"proxy.hh\"\n#include \"dhcp.hh\"\n#include <memory>\n#include <queue>\n#ifdef HAVE_OSV\n#include <osv\/firmware.hh>\n#include <gnu\/libc-version.h>\n#endif\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\nnamespace net {\n\n\/\/ native_network_stack\nclass native_network_stack : public network_stack {\n static std::unique_ptr<native_network_stack> _s;\n interface _netif;\n ipv4 _inet;\n udp_v4 _udp;\n bool _dhcp = false;\n promise<> _config;\n timer _timer;\n\n void on_dhcp(bool, const dhcp::lease &, bool);\n\n using tcp4 = tcp<ipv4_traits>;\npublic:\n explicit native_network_stack(boost::program_options::variables_map opts);\n virtual server_socket listen(socket_address sa, listen_options opt) override;\n virtual udp_channel make_udp_channel(ipv4_addr addr) override;\n virtual future<> initialize() override;\n static std::unique_ptr<network_stack> create(boost::program_options::variables_map opts) {\n return std::make_unique<native_network_stack>(opts);\n }\n virtual bool has_per_core_namespace() override { return true; };\n friend class native_server_socket_impl<tcp4>;\n};\n\nudp_channel\nnative_network_stack::make_udp_channel(ipv4_addr addr) {\n return _udp.make_channel(addr);\n}\n\nenum class xen_info {\n nonxen = 0,\n userspace = 1,\n osv = 2,\n};\n\n#ifdef HAVE_XEN\nstatic xen_info is_xen()\n{\n struct stat buf;\n if (!stat(\"\/proc\/xen\", &buf) || !stat(\"\/dev\/xen\", &buf)) {\n return xen_info::userspace;\n }\n\n#ifdef HAVE_OSV\n const char *str = gnu_get_libc_release();\n if (std::string(\"OSv\") != str) {\n return xen_info::nonxen;\n }\n auto firmware = osv::firmware_vendor();\n if (firmware == \"Xen\") {\n return xen_info::osv;\n }\n#endif\n\n return xen_info::nonxen;\n}\n#endif\n\nstd::unique_ptr<net::device> create_native_net_device(boost::program_options::variables_map opts) {\n\n if (!smp::main_thread()) {\n return create_proxy_net_device(opts);\n }\n\n#ifdef HAVE_XEN\n auto xen = is_xen();\n if (xen != xen_info::nonxen) {\n return xen::create_xenfront_net_device(opts, xen == xen_info::userspace);\n }\n#endif\n return create_virtio_net_device(opts[\"tap-device\"].as<std::string>(), opts);\n}\n\nvoid\nadd_native_net_options_description(boost::program_options::options_description &opts) {\n\n#ifdef HAVE_XEN\n auto xen = is_xen();\n if (xen != xen_info::nonxen) {\n opts.add(xen::get_xenfront_net_options_description());\n return;\n }\n#endif\n opts.add(get_virtio_net_options_description());\n}\n\nnative_network_stack::native_network_stack(boost::program_options::variables_map opts)\n : _netif(create_native_net_device(opts))\n , _inet(&_netif)\n , _udp(_inet) {\n _inet.set_host_address(ipv4_address(opts[\"host-ipv4-addr\"].as<std::string>()));\n _inet.set_gw_address(ipv4_address(opts[\"gw-ipv4-addr\"].as<std::string>()));\n _inet.set_netmask_address(ipv4_address(opts[\"netmask-ipv4-addr\"].as<std::string>()));\n _udp.set_queue_size(opts[\"udpv4-queue-size\"].as<int>());\n _dhcp = opts[\"host-ipv4-addr\"].defaulted()\n && opts[\"gw-ipv4-addr\"].defaulted()\n && opts[\"netmask-ipv4-addr\"].defaulted() && opts[\"dhcp\"].as<bool>();\n}\n\nserver_socket\nnative_network_stack::listen(socket_address sa, listen_options opts) {\n assert(sa.as_posix_sockaddr().sa_family == AF_INET);\n return tcpv4_listen(_inet.get_tcp(), ntohs(sa.as_posix_sockaddr_in().sin_port), opts);\n}\n\nusing namespace std::chrono_literals;\n\nvoid native_network_stack::on_dhcp(bool success, const dhcp::lease & res, bool is_renew) {\n if (success) {\n _inet.set_host_address(res.ip);\n _inet.set_gw_address(res.gateway);\n _inet.set_netmask_address(res.netmask);\n }\n \/\/ Signal waiters.\n if (!is_renew) {\n _config.set_value();\n }\n\n if (smp::main_thread()) {\n \/\/ And the other cpus, which, in the case of initial discovery,\n \/\/ will be waiting for us.\n for (unsigned i = 1; i < smp::count; i++) {\n smp::submit_to(i, [success, res, is_renew]() {\n auto & ns = static_cast<native_network_stack&>(engine.net());\n ns.on_dhcp(success, res, is_renew);\n });\n }\n if (success) {\n \/\/ And set up to renew the lease later on.\n _timer.set_callback(\n [this, res]() {\n _config = promise<>();\n shared_ptr<dhcp> d = make_shared<dhcp>(_inet);\n d->renew(res).then([this, d](bool success, const dhcp::lease & res) {\n on_dhcp(success, res, true);\n });\n });\n _timer.arm(\n std::chrono::duration_cast<clock_type::duration>(\n res.lease_time));\n }\n }\n}\n\nfuture<> native_network_stack::initialize() {\n return network_stack::initialize().then([this]() {\n if (!_dhcp) {\n return make_ready_future();\n }\n \/\/ Only run actual discover on main cpu.\n \/\/ All other cpus must simply for main thread to complete and signal them.\n if (smp::main_thread()) {\n shared_ptr<dhcp> d = make_shared<dhcp>(_inet);\n return d->discover().then([this, d](bool success, const dhcp::lease & res) {\n on_dhcp(success, res, false);\n });\n }\n return _config.get_future();\n });\n}\n\nstd::unique_ptr<native_network_stack> native_network_stack::_s;\n\nboost::program_options::options_description nns_options() {\n boost::program_options::options_description opts(\n \"Native networking stack options\");\n opts.add_options()\n (\"tap-device\",\n boost::program_options::value<std::string>()->default_value(\"tap0\"),\n \"tap device to connect to\")\n (\"host-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"192.168.122.2\"),\n \"static IPv4 address to use\")\n (\"gw-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"192.168.122.1\"),\n \"static IPv4 gateway to use\")\n (\"netmask-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"255.255.255.0\"),\n \"static IPv4 netmask to use\")\n (\"udpv4-queue-size\",\n boost::program_options::value<int>()->default_value(udp_v4::default_queue_size),\n \"Default size of the UDPv4 per-channel packet queue\")\n (\"dhcp\",\n boost::program_options::value<bool>()->default_value(true),\n \"Use DHCP discovery\")\n ;\n\n add_native_net_options_description(opts);\n return opts;\n}\n\nnetwork_stack_registrator nns_registrator{\n \"native\", nns_options(), native_network_stack::create\n};\n\n}\n<commit_msg>net: remove unused variable in native_network_stack<commit_after>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n#include \"native-stack.hh\"\n#include \"native-stack-impl.hh\"\n#include \"net.hh\"\n#include \"ip.hh\"\n#include \"tcp-stack.hh\"\n#include \"udp.hh\"\n#include \"virtio.hh\"\n#include \"xenfront.hh\"\n#include \"proxy.hh\"\n#include \"dhcp.hh\"\n#include <memory>\n#include <queue>\n#ifdef HAVE_OSV\n#include <osv\/firmware.hh>\n#include <gnu\/libc-version.h>\n#endif\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\nnamespace net {\n\n\/\/ native_network_stack\nclass native_network_stack : public network_stack {\n interface _netif;\n ipv4 _inet;\n udp_v4 _udp;\n bool _dhcp = false;\n promise<> _config;\n timer _timer;\n\n void on_dhcp(bool, const dhcp::lease &, bool);\n\n using tcp4 = tcp<ipv4_traits>;\npublic:\n explicit native_network_stack(boost::program_options::variables_map opts);\n virtual server_socket listen(socket_address sa, listen_options opt) override;\n virtual udp_channel make_udp_channel(ipv4_addr addr) override;\n virtual future<> initialize() override;\n static std::unique_ptr<network_stack> create(boost::program_options::variables_map opts) {\n return std::make_unique<native_network_stack>(opts);\n }\n virtual bool has_per_core_namespace() override { return true; };\n friend class native_server_socket_impl<tcp4>;\n};\n\nudp_channel\nnative_network_stack::make_udp_channel(ipv4_addr addr) {\n return _udp.make_channel(addr);\n}\n\nenum class xen_info {\n nonxen = 0,\n userspace = 1,\n osv = 2,\n};\n\n#ifdef HAVE_XEN\nstatic xen_info is_xen()\n{\n struct stat buf;\n if (!stat(\"\/proc\/xen\", &buf) || !stat(\"\/dev\/xen\", &buf)) {\n return xen_info::userspace;\n }\n\n#ifdef HAVE_OSV\n const char *str = gnu_get_libc_release();\n if (std::string(\"OSv\") != str) {\n return xen_info::nonxen;\n }\n auto firmware = osv::firmware_vendor();\n if (firmware == \"Xen\") {\n return xen_info::osv;\n }\n#endif\n\n return xen_info::nonxen;\n}\n#endif\n\nstd::unique_ptr<net::device> create_native_net_device(boost::program_options::variables_map opts) {\n\n if (!smp::main_thread()) {\n return create_proxy_net_device(opts);\n }\n\n#ifdef HAVE_XEN\n auto xen = is_xen();\n if (xen != xen_info::nonxen) {\n return xen::create_xenfront_net_device(opts, xen == xen_info::userspace);\n }\n#endif\n return create_virtio_net_device(opts[\"tap-device\"].as<std::string>(), opts);\n}\n\nvoid\nadd_native_net_options_description(boost::program_options::options_description &opts) {\n\n#ifdef HAVE_XEN\n auto xen = is_xen();\n if (xen != xen_info::nonxen) {\n opts.add(xen::get_xenfront_net_options_description());\n return;\n }\n#endif\n opts.add(get_virtio_net_options_description());\n}\n\nnative_network_stack::native_network_stack(boost::program_options::variables_map opts)\n : _netif(create_native_net_device(opts))\n , _inet(&_netif)\n , _udp(_inet) {\n _inet.set_host_address(ipv4_address(opts[\"host-ipv4-addr\"].as<std::string>()));\n _inet.set_gw_address(ipv4_address(opts[\"gw-ipv4-addr\"].as<std::string>()));\n _inet.set_netmask_address(ipv4_address(opts[\"netmask-ipv4-addr\"].as<std::string>()));\n _udp.set_queue_size(opts[\"udpv4-queue-size\"].as<int>());\n _dhcp = opts[\"host-ipv4-addr\"].defaulted()\n && opts[\"gw-ipv4-addr\"].defaulted()\n && opts[\"netmask-ipv4-addr\"].defaulted() && opts[\"dhcp\"].as<bool>();\n}\n\nserver_socket\nnative_network_stack::listen(socket_address sa, listen_options opts) {\n assert(sa.as_posix_sockaddr().sa_family == AF_INET);\n return tcpv4_listen(_inet.get_tcp(), ntohs(sa.as_posix_sockaddr_in().sin_port), opts);\n}\n\nusing namespace std::chrono_literals;\n\nvoid native_network_stack::on_dhcp(bool success, const dhcp::lease & res, bool is_renew) {\n if (success) {\n _inet.set_host_address(res.ip);\n _inet.set_gw_address(res.gateway);\n _inet.set_netmask_address(res.netmask);\n }\n \/\/ Signal waiters.\n if (!is_renew) {\n _config.set_value();\n }\n\n if (smp::main_thread()) {\n \/\/ And the other cpus, which, in the case of initial discovery,\n \/\/ will be waiting for us.\n for (unsigned i = 1; i < smp::count; i++) {\n smp::submit_to(i, [success, res, is_renew]() {\n auto & ns = static_cast<native_network_stack&>(engine.net());\n ns.on_dhcp(success, res, is_renew);\n });\n }\n if (success) {\n \/\/ And set up to renew the lease later on.\n _timer.set_callback(\n [this, res]() {\n _config = promise<>();\n shared_ptr<dhcp> d = make_shared<dhcp>(_inet);\n d->renew(res).then([this, d](bool success, const dhcp::lease & res) {\n on_dhcp(success, res, true);\n });\n });\n _timer.arm(\n std::chrono::duration_cast<clock_type::duration>(\n res.lease_time));\n }\n }\n}\n\nfuture<> native_network_stack::initialize() {\n return network_stack::initialize().then([this]() {\n if (!_dhcp) {\n return make_ready_future();\n }\n \/\/ Only run actual discover on main cpu.\n \/\/ All other cpus must simply for main thread to complete and signal them.\n if (smp::main_thread()) {\n shared_ptr<dhcp> d = make_shared<dhcp>(_inet);\n return d->discover().then([this, d](bool success, const dhcp::lease & res) {\n on_dhcp(success, res, false);\n });\n }\n return _config.get_future();\n });\n}\n\nboost::program_options::options_description nns_options() {\n boost::program_options::options_description opts(\n \"Native networking stack options\");\n opts.add_options()\n (\"tap-device\",\n boost::program_options::value<std::string>()->default_value(\"tap0\"),\n \"tap device to connect to\")\n (\"host-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"192.168.122.2\"),\n \"static IPv4 address to use\")\n (\"gw-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"192.168.122.1\"),\n \"static IPv4 gateway to use\")\n (\"netmask-ipv4-addr\",\n boost::program_options::value<std::string>()->default_value(\"255.255.255.0\"),\n \"static IPv4 netmask to use\")\n (\"udpv4-queue-size\",\n boost::program_options::value<int>()->default_value(udp_v4::default_queue_size),\n \"Default size of the UDPv4 per-channel packet queue\")\n (\"dhcp\",\n boost::program_options::value<bool>()->default_value(true),\n \"Use DHCP discovery\")\n ;\n\n add_native_net_options_description(opts);\n return opts;\n}\n\nnetwork_stack_registrator nns_registrator{\n \"native\", nns_options(), native_network_stack::create\n};\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2003 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#ifdef _WIN32\n#pragma warning( 4: 4786)\n#endif\n\n#include <iostream>\n\n#include \"BZAdminClient.h\"\n#include \"version.h\"\n\n\nBZAdminClient::BZAdminClient(std::string callsign, std::string host,\n\t\t\t int port, BZAdminUI* bzInterface)\n : myTeam(ObserverTeam), sLink(Address(host), port), valid(false),\n ui(bzInterface) {\n\n if (sLink.getState() != ServerLink::Okay) {\n std::cerr<<\"Could not connect to \"<<host<<':'<<port<<'.'<<std::endl;\n return;\n }\n sLink.sendEnter(TankPlayer, myTeam, callsign.c_str(), \"\");\n if (sLink.getState() != ServerLink::Okay) {\n std::cerr<<\"Rejected.\"<<std::endl;\n return;\n }\n valid = true;\n}\n\n\nPlayerId BZAdminClient::getMyId() {\n return sLink.getId();\n}\n\n\nBZAdminClient::ServerCode BZAdminClient::getServerString(std::string& str) {\n uint16_t code, len;\n char inbuf[MaxPacketLen];\n int e;\n std::string dstName, srcName;\n str = \"\";\n\n \/* read until we have a package that we want, or until there are no more\n packages for 100 ms *\/\n while ((e = sLink.read(code, len, inbuf, 100)) == 1) {\n void* vbuf = inbuf;\n PlayerId p;\n switch (code) {\n\n case MsgAddPlayer:\n\n vbuf = nboUnpackUByte(vbuf, p);\n\n uint16_t team, type, wins, losses, tks;\n char callsign[CallSignLen];\n char email[EmailLen];\n vbuf = nboUnpackUShort(vbuf, type);\n vbuf = nboUnpackUShort(vbuf, team);\n vbuf = nboUnpackUShort(vbuf, wins);\n vbuf = nboUnpackUShort(vbuf, losses);\n vbuf = nboUnpackUShort(vbuf, tks);\n vbuf = nboUnpackString(vbuf, callsign, CallSignLen);\n vbuf = nboUnpackString(vbuf, email, EmailLen);\n players[p] = callsign;\n if (p != sLink.getId() && ui != NULL)\n\tui->addedPlayer(p);\n str = str + \"*** '\" + callsign + \"' joined the game.\";\n return GotMessage;\n\n case MsgRemovePlayer:\n vbuf = nboUnpackUByte(vbuf, p);\n str = str + \"*** '\" + players[p] + \"' left the game.\";\n if (ui != NULL)\n\tui->removingPlayer(p);\n players.erase(p);\n return GotMessage;\n\n case MsgSuperKill:\n return Superkilled;\n\n case MsgMessage:\n\n \/\/ unpack the message header\n PlayerId src;\n PlayerId dst;\n PlayerId me = sLink.getId();\n vbuf = nboUnpackUByte(vbuf, src);\n vbuf = nboUnpackUByte(vbuf, dst);\n\n \/\/ is the message for me?\n TeamColor dstTeam = (dst >= 244 && dst <= 250 ?\n\t\t\t TeamColor(250 - dst) : NoTeam);\n if (dst == AllPlayers || src == me || dst == me || dstTeam == myTeam) {\n\tstr = (char*)vbuf;\n\tif (str == \"CLIENTQUERY\") {\n\t sendMessage(std::string(\"bzadmin \") + getAppVersion(), src);\n\t if (ui != NULL)\n\t ui->outputMessage(\" [Sent versioninfo per request]\");\n\t}\n\telse {\n\t str = formatMessage((char*)vbuf, src, dst, dstTeam, me);\n\t return GotMessage;\n\t}\n }\n }\n }\n\n if (sLink.getState() != ServerLink::Okay) {\n return CommError;\n }\n\n return NoMessage;\n}\n\n\nstd::map<PlayerId, std::string>& BZAdminClient::getPlayers() {\n return players;\n}\n\n\nbool BZAdminClient::isValid() const {\n return valid;\n}\n\n\nvoid BZAdminClient::runLoop() {\n std::string str;\n ServerCode what(NoMessage);\n while (true) {\n while ((what = getServerString(str)) == GotMessage) {\n if (ui != NULL)\n\tui->outputMessage(str);\n }\n if (what == Superkilled || what == CommError)\n break;\n if (ui != NULL && ui->checkCommand(str)) {\n if (str == \"\/quit\")\n\tbreak;\n sendMessage(str, ui->getTarget());\n }\n }\n\n \/\/ why did we leave the loop?\n switch (what) {\n case Superkilled:\n if (ui != NULL)\n ui->outputMessage(\"--- ERROR: Server forced disconnect\");\n break;\n case CommError:\n if (ui != NULL)\n ui->outputMessage(\"--- ERROR: Connection to server lost\");\n break;\n default:\n waitForServer();\n }\n}\n\n\nvoid BZAdminClient::sendMessage(const std::string& msg,\n\t\t\t\tPlayerId target) {\n char buffer[MessageLen];\n char buffer2[1 + MessageLen];\n void* buf = buffer2;\n\n buf = nboPackUByte(buf, target);\n memset(buffer, 0, MessageLen);\n strncpy(buffer, msg.c_str(), MessageLen - 1);\n nboPackString(buffer2 + 1, buffer, MessageLen);\n sLink.send(MsgMessage, sizeof(buffer2), buffer2);\n}\n\n\nstd::string BZAdminClient::formatMessage(const std::string& msg, PlayerId src,\n\t\t\t\t PlayerId dst, TeamColor dstTeam,\n\t\t\t\t PlayerId me) {\n std::string formatted = \" \";\n\n \/\/ get sender and receiver\n const std::string srcName = (src == ServerPlayer ? \"SERVER\" :\n\t\t\t (players.count(src) ? players[src] : \"(UNKNOWN)\"));\n const std::string dstName = (players.count(dst) ? players[dst] : \"(UNKNOWN)\");\n\n \/\/ direct message to or from me\n if (dst == me || players.count(dst)) {\n if (!(src == me && dst == me)) {\n formatted += \"[\";\n if (src == me) {\n\tformatted += \"->\";\n\tformatted += dstName;\n }\n else {\n\tformatted += srcName;\n\tformatted += \"->\";\n }\n formatted += \"] \";\n }\n formatted += msg;\n }\n\n \/\/ public or team message\n else {\n if (dstTeam != NoTeam)\n formatted += \"[Team] \";\n formatted += srcName;\n formatted += \": \";\n formatted += msg;\n }\n\n return formatted;\n}\n\n\nvoid BZAdminClient::setUI(BZAdminUI* bzInterface) {\n ui = bzInterface;\n}\n\n\nvoid BZAdminClient::waitForServer() {\n \/\/ we need to know that the server has processed all our messages\n \/\/ send a private message to ourself and wait for it to come back\n \/\/ this assumes that the order of messages isn't changed along the way\n PlayerId me = sLink.getId();\n if (sLink.getState() == ServerLink::Okay) {\n sendMessage(\"bzadminping\", me);\n std::string expected = formatMessage(\"bzadminping\", me, me, NoTeam, me);\n std::string str;\n do {\n getServerString(str);\n } while (str != expected);\n }\n}\n\n\/\/ Local variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<commit_msg>quell some deep compiler moaning (header error) on os x gcc 3.3<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2003 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n#ifdef _WIN32\n#pragma warning( 4: 4786)\n#endif\n\n#include <iostream>\n\n#include \"BZAdminClient.h\"\n#include \"version.h\"\n\n\nBZAdminClient::BZAdminClient(std::string callsign, std::string host,\n\t\t\t int port, BZAdminUI* bzInterface)\n : myTeam(ObserverTeam), sLink(Address(host), port), valid(false),\n ui(bzInterface) {\n\n if (sLink.getState() != ServerLink::Okay) {\n std::cerr<<\"Could not connect to \"<<host<<':'<<port<<'.'<<std::endl;\n return;\n }\n sLink.sendEnter(TankPlayer, myTeam, callsign.c_str(), \"\");\n if (sLink.getState() != ServerLink::Okay) {\n std::cerr<<\"Rejected.\"<<std::endl;\n return;\n }\n valid = true;\n}\n\n\nPlayerId BZAdminClient::getMyId() {\n return sLink.getId();\n}\n\n\nBZAdminClient::ServerCode BZAdminClient::getServerString(std::string& str) {\n uint16_t code, len;\n char inbuf[MaxPacketLen];\n int e;\n std::string dstName, srcName;\n str = \"\";\n\n \/* read until we have a package that we want, or until there are no more\n packages for 100 ms *\/\n while ((e = sLink.read(code, len, inbuf, 100)) == 1) {\n void* vbuf = inbuf;\n PlayerId p;\n switch (code) {\n\n case MsgAddPlayer:\n\n vbuf = nboUnpackUByte(vbuf, p);\n\n uint16_t team, type, wins, losses, tks;\n char callsign[CallSignLen];\n char email[EmailLen];\n vbuf = nboUnpackUShort(vbuf, type);\n vbuf = nboUnpackUShort(vbuf, team);\n vbuf = nboUnpackUShort(vbuf, wins);\n vbuf = nboUnpackUShort(vbuf, losses);\n vbuf = nboUnpackUShort(vbuf, tks);\n vbuf = nboUnpackString(vbuf, callsign, CallSignLen);\n vbuf = nboUnpackString(vbuf, email, EmailLen);\n players[p].clear();\n players[p].append(callsign);\n if (p != sLink.getId() && ui != NULL)\n\tui->addedPlayer(p);\n str = str + \"*** '\" + callsign + \"' joined the game.\";\n return GotMessage;\n\n case MsgRemovePlayer:\n vbuf = nboUnpackUByte(vbuf, p);\n str = str + \"*** '\" + players[p] + \"' left the game.\";\n if (ui != NULL)\n\tui->removingPlayer(p);\n players.erase(p);\n return GotMessage;\n\n case MsgSuperKill:\n return Superkilled;\n\n case MsgMessage:\n\n \/\/ unpack the message header\n PlayerId src;\n PlayerId dst;\n PlayerId me = sLink.getId();\n vbuf = nboUnpackUByte(vbuf, src);\n vbuf = nboUnpackUByte(vbuf, dst);\n\n \/\/ is the message for me?\n TeamColor dstTeam = (dst >= 244 && dst <= 250 ?\n\t\t\t TeamColor(250 - dst) : NoTeam);\n if (dst == AllPlayers || src == me || dst == me || dstTeam == myTeam) {\n\tstr = (char*)vbuf;\n\tif (str == \"CLIENTQUERY\") {\n\t sendMessage(std::string(\"bzadmin \") + getAppVersion(), src);\n\t if (ui != NULL)\n\t ui->outputMessage(\" [Sent versioninfo per request]\");\n\t}\n\telse {\n\t str = formatMessage((char*)vbuf, src, dst, dstTeam, me);\n\t return GotMessage;\n\t}\n }\n }\n }\n\n if (sLink.getState() != ServerLink::Okay) {\n return CommError;\n }\n\n return NoMessage;\n}\n\n\nstd::map<PlayerId, std::string>& BZAdminClient::getPlayers() {\n return players;\n}\n\n\nbool BZAdminClient::isValid() const {\n return valid;\n}\n\n\nvoid BZAdminClient::runLoop() {\n std::string str;\n ServerCode what(NoMessage);\n while (true) {\n while ((what = getServerString(str)) == GotMessage) {\n if (ui != NULL)\n\tui->outputMessage(str);\n }\n if (what == Superkilled || what == CommError)\n break;\n if (ui != NULL && ui->checkCommand(str)) {\n if (str == \"\/quit\")\n\tbreak;\n sendMessage(str, ui->getTarget());\n }\n }\n\n \/\/ why did we leave the loop?\n switch (what) {\n case Superkilled:\n if (ui != NULL)\n ui->outputMessage(\"--- ERROR: Server forced disconnect\");\n break;\n case CommError:\n if (ui != NULL)\n ui->outputMessage(\"--- ERROR: Connection to server lost\");\n break;\n default:\n waitForServer();\n }\n}\n\n\nvoid BZAdminClient::sendMessage(const std::string& msg,\n\t\t\t\tPlayerId target) {\n char buffer[MessageLen];\n char buffer2[1 + MessageLen];\n void* buf = buffer2;\n\n buf = nboPackUByte(buf, target);\n memset(buffer, 0, MessageLen);\n strncpy(buffer, msg.c_str(), MessageLen - 1);\n nboPackString(buffer2 + 1, buffer, MessageLen);\n sLink.send(MsgMessage, sizeof(buffer2), buffer2);\n}\n\n\nstd::string BZAdminClient::formatMessage(const std::string& msg, PlayerId src,\n\t\t\t\t PlayerId dst, TeamColor dstTeam,\n\t\t\t\t PlayerId me) {\n std::string formatted = \" \";\n\n \/\/ get sender and receiver\n const std::string srcName = (src == ServerPlayer ? \"SERVER\" :\n\t\t\t (players.count(src) ? players[src] : \"(UNKNOWN)\"));\n const std::string dstName = (players.count(dst) ? players[dst] : \"(UNKNOWN)\");\n\n \/\/ direct message to or from me\n if (dst == me || players.count(dst)) {\n if (!(src == me && dst == me)) {\n formatted += \"[\";\n if (src == me) {\n\tformatted += \"->\";\n\tformatted += dstName;\n }\n else {\n\tformatted += srcName;\n\tformatted += \"->\";\n }\n formatted += \"] \";\n }\n formatted += msg;\n }\n\n \/\/ public or team message\n else {\n if (dstTeam != NoTeam)\n formatted += \"[Team] \";\n formatted += srcName;\n formatted += \": \";\n formatted += msg;\n }\n\n return formatted;\n}\n\n\nvoid BZAdminClient::setUI(BZAdminUI* bzInterface) {\n ui = bzInterface;\n}\n\n\nvoid BZAdminClient::waitForServer() {\n \/\/ we need to know that the server has processed all our messages\n \/\/ send a private message to ourself and wait for it to come back\n \/\/ this assumes that the order of messages isn't changed along the way\n PlayerId me = sLink.getId();\n if (sLink.getState() == ServerLink::Okay) {\n sendMessage(\"bzadminping\", me);\n std::string expected = formatMessage(\"bzadminping\", me, me, NoTeam, me);\n std::string str;\n do {\n getServerString(str);\n } while (str != expected);\n }\n}\n\n\/\/ Local variables: ***\n\/\/ mode:C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<|endoftext|>"} {"text":"<commit_before>\/*ckwg +5\n * Copyright 2011-2013 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"utils.h\"\n\n#ifdef HAVE_PTHREAD_NAMING\n#define NAME_THREAD_USING_PTHREAD\n#ifdef HAVE_PTHREAD_SET_NAME_NP\n#ifdef NDEBUG\n\/\/ The mechanism only make sense in debugging mode.\n#undef NAME_THREAD_USING_PTHREAD\n#endif\n#endif\n#endif\n\n#ifdef HAVE_SETPROCTITLE\n#define NAME_THREAD_USING_SETPROCTITLE\n#endif\n\n#ifdef __linux__\n#define NAME_THREAD_USING_PRCTL\n#endif\n\n#if defined(_WIN32) || defined(_WIN64)\n#ifndef NDEBUG\n\/\/ The mechanism only make sense in debugging mode.\n#define NAME_THREAD_USING_WIN32\n#endif\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\n#include <pthread.h>\n#ifdef HAVE_PTHREAD_SET_NAME_NP\n#include <pthread_np.h>\n#endif\n#endif\n\n#ifdef NAME_THREAD_USING_PRCTL\n#include <sys\/prctl.h>\n#endif\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <boost\/scoped_array.hpp>\n\n#include <windows.h>\n#else\n#include <cstdlib>\n#endif\n\n\/**\n * \\file utils.cxx\n *\n * \\brief Implementation of pipeline utilities.\n *\/\n\nnamespace vistk\n{\n\n#ifdef NAME_THREAD_USING_PRCTL\nstatic bool name_thread_prctl(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\nstatic bool name_thread_setproctitle(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\nstatic bool name_thread_pthread(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\nstatic bool name_thread_win32(thread_name_t const& name);\n#endif\n\nbool\nname_thread(thread_name_t const& name)\n{\n bool ret = false;\n\n#ifdef NAME_THREAD_USING_PRCTL\n if (!ret)\n {\n ret = name_thread_prctl(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\n if (!ret)\n {\n ret = name_thread_setproctitle(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\n if (!ret)\n {\n ret = name_thread_pthread(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\n if (!ret)\n {\n ret = name_thread_win32(name);\n }\n#endif\n\n return ret;\n}\n\nenvvar_value_t\nget_envvar(envvar_name_t const& name)\n{\n envvar_value_t value;\n\n#if defined(_WIN32) || defined(_WIN64)\n char const* const name_cstr = name.c_str();\n\n DWORD sz = GetEnvironmentVariable(name_cstr, NULL, 0);\n\n if (sz)\n {\n typedef boost::scoped_array<char> raw_envvar_value_t;\n raw_envvar_value_t const envvalue(new char[sz]);\n\n sz = GetEnvironmentVariable(name_cstr, envvalue.get(), sz);\n\n value = envvalue.get();\n }\n\n if (!sz)\n {\n \/\/\/ \\todo Log error that the environment reading failed.\n }\n#else\n char const* const envvalue = getenv(name.c_str());\n\n if (envvalue)\n {\n value = envvalue;\n }\n#endif\n\n return value;\n}\n\n#ifdef NAME_THREAD_USING_PRCTL\nbool\nname_thread_prctl(thread_name_t const& name)\n{\n int const ret = prctl(PR_SET_NAME, reinterpret_cast<unsigned long>(name.c_str()), 0, 0, 0);\n\n return (ret == 0);\n}\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\nbool\nname_thread_setproctitle(thread_name_t const& name)\n{\n setproctitle(\"%s\", name.c_str());\n}\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\nbool\nname_thread_pthread(thread_name_t const& name)\n{\n int ret;\n\n#ifdef HAVE_PTHREAD_SETNAME_NP\n#ifdef PTHREAD_SETNAME_NP_TAKES_ID\n pthread_t const tid = pthread_self();\n\n ret = pthread_setname_np(tid, name.c_str());\n#else\n ret = pthread_setname_np(name.c_str());\n#endif\n#elif defined(HAVE_PTHREAD_SET_NAME_NP)\n pthread_t const tid = pthread_self();\n\n ret = pthread_set_name_np(tid, name.c_str());\n#endif\n\n return (ret == 0);\n}\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\nstatic void set_thread_name(DWORD thread_id, LPCSTR name);\n\nbool\nname_thread_win32(thread_name_t const& name)\n{\n static DWORD const current_thread = -1;\n\n set_thread_name(current_thread, name.c_str());\n\n return true;\n}\n\n\/\/ Code obtained from http:\/\/msdn.microsoft.com\/en-us\/library\/xcb2z8hs.aspx\n#pragma pack(push,8)\ntypedef struct tagTHREADNAME_INFO\n{\n DWORD dwType; \/\/ Must be 0x1000.\n LPCSTR szName; \/\/ Pointer to name (in user addr space).\n DWORD dwThreadID; \/\/ Thread ID (-1 = caller thread).\n DWORD dwFlags; \/\/ Reserved for future use, must be zero.\n} THREADNAME_INFO;\n#pragma pack(pop)\n\nvoid\nset_thread_name(DWORD thread_id, LPCSTR name)\n{\n THREADNAME_INFO info;\n info.dwType = 0x1000;\n info.szName = name;\n info.dwThreadID = thread_id;\n info.dwFlags = 0;\n\n __try\n {\n static DWORD const MS_VC_EXCEPTION = 0x406D1388;\n\n RaiseException(MS_VC_EXCEPTION,\n 0,\n sizeof(info) \/ sizeof(ULONG_PTR),\n reinterpret_cast<ULONG_PTR*>&info);\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n }\n}\n#endif\n\n}\n<commit_msg>Initialize the return value to -ENOTSUP<commit_after>\/*ckwg +5\n * Copyright 2011-2013 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"utils.h\"\n\n#ifdef HAVE_PTHREAD_NAMING\n#define NAME_THREAD_USING_PTHREAD\n#ifdef HAVE_PTHREAD_SET_NAME_NP\n#ifdef NDEBUG\n\/\/ The mechanism only make sense in debugging mode.\n#undef NAME_THREAD_USING_PTHREAD\n#endif\n#endif\n#endif\n\n#ifdef HAVE_SETPROCTITLE\n#define NAME_THREAD_USING_SETPROCTITLE\n#endif\n\n#ifdef __linux__\n#define NAME_THREAD_USING_PRCTL\n#endif\n\n#if defined(_WIN32) || defined(_WIN64)\n#ifndef NDEBUG\n\/\/ The mechanism only make sense in debugging mode.\n#define NAME_THREAD_USING_WIN32\n#endif\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\n#include <errno.h>\n#include <pthread.h>\n#ifdef HAVE_PTHREAD_SET_NAME_NP\n#include <pthread_np.h>\n#endif\n#endif\n\n#ifdef NAME_THREAD_USING_PRCTL\n#include <sys\/prctl.h>\n#endif\n\n#if defined(_WIN32) || defined(_WIN64)\n#include <boost\/scoped_array.hpp>\n\n#include <windows.h>\n#else\n#include <cstdlib>\n#endif\n\n\/**\n * \\file utils.cxx\n *\n * \\brief Implementation of pipeline utilities.\n *\/\n\nnamespace vistk\n{\n\n#ifdef NAME_THREAD_USING_PRCTL\nstatic bool name_thread_prctl(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\nstatic bool name_thread_setproctitle(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\nstatic bool name_thread_pthread(thread_name_t const& name);\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\nstatic bool name_thread_win32(thread_name_t const& name);\n#endif\n\nbool\nname_thread(thread_name_t const& name)\n{\n bool ret = false;\n\n#ifdef NAME_THREAD_USING_PRCTL\n if (!ret)\n {\n ret = name_thread_prctl(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\n if (!ret)\n {\n ret = name_thread_setproctitle(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\n if (!ret)\n {\n ret = name_thread_pthread(name);\n }\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\n if (!ret)\n {\n ret = name_thread_win32(name);\n }\n#endif\n\n return ret;\n}\n\nenvvar_value_t\nget_envvar(envvar_name_t const& name)\n{\n envvar_value_t value;\n\n#if defined(_WIN32) || defined(_WIN64)\n char const* const name_cstr = name.c_str();\n\n DWORD sz = GetEnvironmentVariable(name_cstr, NULL, 0);\n\n if (sz)\n {\n typedef boost::scoped_array<char> raw_envvar_value_t;\n raw_envvar_value_t const envvalue(new char[sz]);\n\n sz = GetEnvironmentVariable(name_cstr, envvalue.get(), sz);\n\n value = envvalue.get();\n }\n\n if (!sz)\n {\n \/\/\/ \\todo Log error that the environment reading failed.\n }\n#else\n char const* const envvalue = getenv(name.c_str());\n\n if (envvalue)\n {\n value = envvalue;\n }\n#endif\n\n return value;\n}\n\n#ifdef NAME_THREAD_USING_PRCTL\nbool\nname_thread_prctl(thread_name_t const& name)\n{\n int const ret = prctl(PR_SET_NAME, reinterpret_cast<unsigned long>(name.c_str()), 0, 0, 0);\n\n return (ret == 0);\n}\n#endif\n\n#ifdef NAME_THREAD_USING_SETPROCTITLE\nbool\nname_thread_setproctitle(thread_name_t const& name)\n{\n setproctitle(\"%s\", name.c_str());\n}\n#endif\n\n#ifdef NAME_THREAD_USING_PTHREAD\nbool\nname_thread_pthread(thread_name_t const& name)\n{\n int ret = -ENOTSUP;\n\n#ifdef HAVE_PTHREAD_SETNAME_NP\n#ifdef PTHREAD_SETNAME_NP_TAKES_ID\n pthread_t const tid = pthread_self();\n\n ret = pthread_setname_np(tid, name.c_str());\n#else\n ret = pthread_setname_np(name.c_str());\n#endif\n#elif defined(HAVE_PTHREAD_SET_NAME_NP)\n pthread_t const tid = pthread_self();\n\n ret = pthread_set_name_np(tid, name.c_str());\n#endif\n\n return (ret == 0);\n}\n#endif\n\n#ifdef NAME_THREAD_USING_WIN32\nstatic void set_thread_name(DWORD thread_id, LPCSTR name);\n\nbool\nname_thread_win32(thread_name_t const& name)\n{\n static DWORD const current_thread = -1;\n\n set_thread_name(current_thread, name.c_str());\n\n return true;\n}\n\n\/\/ Code obtained from http:\/\/msdn.microsoft.com\/en-us\/library\/xcb2z8hs.aspx\n#pragma pack(push,8)\ntypedef struct tagTHREADNAME_INFO\n{\n DWORD dwType; \/\/ Must be 0x1000.\n LPCSTR szName; \/\/ Pointer to name (in user addr space).\n DWORD dwThreadID; \/\/ Thread ID (-1 = caller thread).\n DWORD dwFlags; \/\/ Reserved for future use, must be zero.\n} THREADNAME_INFO;\n#pragma pack(pop)\n\nvoid\nset_thread_name(DWORD thread_id, LPCSTR name)\n{\n THREADNAME_INFO info;\n info.dwType = 0x1000;\n info.szName = name;\n info.dwThreadID = thread_id;\n info.dwFlags = 0;\n\n __try\n {\n static DWORD const MS_VC_EXCEPTION = 0x406D1388;\n\n RaiseException(MS_VC_EXCEPTION,\n 0,\n sizeof(info) \/ sizeof(ULONG_PTR),\n reinterpret_cast<ULONG_PTR*>&info);\n }\n __except(EXCEPTION_EXECUTE_HANDLER)\n {\n }\n}\n#endif\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; c-basic-offset: 4; tab-width: 4; indent-tabs-mode: nil; -*-\n#define YBORM_SOURCE\n\n#ifdef YB_DEBUG_DOMAIN_REG\n#include <iostream>\n#endif\n#include \"orm\/domain_object.h\"\n\nnamespace Yb {\n\nNoDataObject::NoDataObject()\n : ORMError(_T(\"No ROW data is associated with DomainObject\"))\n{}\n\nNoSessionBaseGiven::NoSessionBaseGiven()\n : ORMError(_T(\"No session given to the WeakObject\"))\n{}\n\nAlreadySavedInAnotherSession::AlreadySavedInAnotherSession()\n : ORMError(_T(\"Object has been already saved in some other session\"))\n{}\n\nCouldNotSaveEmptyObject::CouldNotSaveEmptyObject()\n : ORMError(_T(\"Attempt to save an empty object failed\"))\n{}\n\nOutOfManagedList::OutOfManagedList(int pos, int sz)\n : ORMError(_T(\"Trying to access index \") +\n to_string(pos) + \n _T(\" that falls out of ManagedList of size \") +\n to_string(sz))\n{}\n\nInvalidIterator::InvalidIterator()\n : ORMError(_T(\"Trying to use an invalid iterator\"))\n{}\n\nnamespace {\ntypedef std::pair<Tables, Relations> SchemaInfo;\n}\n\nint DomainObject::init_flag_ = 0;\nvoid *DomainObject::pending_ = NULL;\n\nbool DomainObject::register_table_meta(Table::Ptr tbl)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"register_table_meta(\" << tbl->name() \n << \"), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return false;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (!items)\n items = new SchemaInfo();\n items->first.push_back(tbl);\n return true;\n}\n\nbool DomainObject::register_relation_meta(Relation::Ptr rel)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"register_relation_meta(\" << rel->side(0)\n << \", \" << rel->side(1)\n << \"), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return false;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (!items)\n items = new SchemaInfo();\n items->second.push_back(rel);\n return true;\n}\n\nvoid DomainObject::save_registered(Schema &schema)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"save_registered(), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return;\n init_flag_ = 1;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (items) {\n Tables &tables = items->first;\n Tables::iterator i = tables.begin(), iend = tables.end();\n for (; i != iend; ++i) {\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"table: \" << (*i)->name() << std::endl;\n#endif\n schema.add_table(*i);\n }\n Relations &relations = items->second;\n Relations::iterator j = relations.begin(), jend = relations.end();\n for (; j != jend; ++j) {\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"relation: \" << (*j)->side(0) << \",\" << (*j)->side(1) << std::endl;\n#endif\n schema.add_relation(*j);\n }\n delete items;\n items = NULL;\n }\n}\n\nvoid DomainObject::check_ptr() const\n{\n if (!shptr_get(d_))\n throw NoDataObject();\n}\n\nDomainObject::DomainObject(const Table &table,\n DomainObject *owner, const String &prop_name)\n : owner_(owner)\n , prop_name_(prop_name)\n{}\n\nDataObject::Ptr DomainObject::get_data_object(bool check) const\n{\n if (owner_)\n return DataObject::get_master(owner_->get_data_object(check), prop_name_);\n if (check)\n check_ptr();\n return d_;\n}\n\nvoid DomainObject::set_data_object(DataObject::Ptr d)\n{\n if (owner_) {\n owner_->check_ptr();\n DomainObject master(d);\n owner_->link_to_master(master, prop_name_);\n }\n else\n d_ = d;\n}\n\nDomainObject::DomainObject()\n : owner_(NULL)\n{}\n\nDomainObject::DomainObject(DataObject::Ptr d)\n : d_(d)\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const Table &table)\n : d_(DataObject::create_new(table))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const Schema &schema, const String &table_name)\n : d_(DataObject::create_new(schema.table(table_name)))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(Session &session, const Key &key)\n : d_(session.get_lazy(key))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(Session &session, const String &tbl_name,\n LongInt id)\n : d_(session.get_lazy(session.schema().table(tbl_name).mk_key(id)))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const DomainObject &obj)\n : d_(obj.get_data_object())\n , owner_(NULL)\n{}\n\nDomainObject::~DomainObject()\n{}\n\nDomainObject &DomainObject::operator=(const DomainObject &obj)\n{\n if (this != &obj)\n set_data_object(obj.get_data_object());\n return *this;\n}\n\nvoid DomainObject::save(Session &session)\n{\n session.save(get_data_object());\n}\n\nvoid DomainObject::detach(Session &session)\n{\n session.detach(get_data_object());\n}\n\nbool DomainObject::is_empty() const\n{\n return !shptr_get(get_data_object(false));\n}\n\nSession *DomainObject::get_session() const\n{\n return get_data_object()->session();\n}\n\nconst Value &DomainObject::get(const String &col_name) const\n{\n return get_data_object()->get(col_name);\n}\n\nvoid DomainObject::set(const String &col_name, const Value &value)\n{\n get_data_object()->set(col_name, value);\n}\n\nconst Value &DomainObject::get(int col_num) const\n{\n return get_data_object()->get(col_num);\n}\n\nvoid DomainObject::set(int col_num, const Value &value)\n{\n get_data_object()->set(col_num, value);\n}\n\nconst DomainObject DomainObject::get_master(\n const String &relation_name) const\n{\n return DomainObject(\n DataObject::get_master(get_data_object(), relation_name));\n}\n\nRelationObject *DomainObject::get_slaves_ro(\n const String &relation_name) const\n{\n return get_data_object()->get_slaves(relation_name);\n}\n\nManagedList<DomainObject> DomainObject::get_slaves(\n const String &relation_name) const\n{\n DataObject::Ptr p = get_data_object();\n return ManagedList<DomainObject>(p->get_slaves(relation_name), p);\n}\n\nvoid DomainObject::link_to_master(DomainObject &master,\n const String relation_name)\n{\n DataObject::link_slave_to_master(get_data_object(),\n master.get_data_object(), relation_name);\n}\n\nvoid DomainObject::link_to_slave(DomainObject &slave,\n const String relation_name)\n{\n DataObject::link_master_to_slave(get_data_object(),\n slave.get_data_object(), relation_name);\n}\n\nvoid DomainObject::delete_object()\n{\n get_data_object()->delete_object();\n}\n\nDataObject::Status DomainObject::status() const\n{\n return get_data_object()->status();\n}\n\nconst Table &DomainObject::get_table() const\n{\n return get_data_object()->table();\n}\n\nint DomainObject::cmp(const DomainObject &x) const\n{\n DataObject::Ptr p1 = get_data_object(false), p2 = x.get_data_object(false);\n if (p1 == p2)\n return 0;\n if (!shptr_get(p1))\n return -1;\n if (!shptr_get(p2))\n return 1;\n if (p1->raw_values() == p2->raw_values())\n return 0;\n return p1->raw_values() < p2->raw_values()? -1: 1;\n}\n\nElementTree::ElementPtr DomainObject::xmlize(\n int depth, const String &alt_name) const\n{\n Session *s = get_session();\n if (!s)\n throw NoSessionBaseGiven();\n return deep_xmlize(*s, get_data_object(), depth, alt_name);\n}\n\n} \/\/ namespace Yb\n\n\/\/ vim:ts=4:sts=4:sw=4:et:\n<commit_msg>thanks msvc: fixed a bug<commit_after>\/\/ -*- Mode: C++; c-basic-offset: 4; tab-width: 4; indent-tabs-mode: nil; -*-\n#define YBORM_SOURCE\n\n#ifdef YB_DEBUG_DOMAIN_REG\n#include <iostream>\n#endif\n#include \"orm\/domain_object.h\"\n\nnamespace Yb {\n\nNoDataObject::NoDataObject()\n : ORMError(_T(\"No ROW data is associated with DomainObject\"))\n{}\n\nNoSessionBaseGiven::NoSessionBaseGiven()\n : ORMError(_T(\"No session given to the WeakObject\"))\n{}\n\nAlreadySavedInAnotherSession::AlreadySavedInAnotherSession()\n : ORMError(_T(\"Object has been already saved in some other session\"))\n{}\n\nCouldNotSaveEmptyObject::CouldNotSaveEmptyObject()\n : ORMError(_T(\"Attempt to save an empty object failed\"))\n{}\n\nOutOfManagedList::OutOfManagedList(int pos, int sz)\n : ORMError(_T(\"Trying to access index \") +\n to_string(pos) + \n _T(\" that falls out of ManagedList of size \") +\n to_string(sz))\n{}\n\nInvalidIterator::InvalidIterator()\n : ORMError(_T(\"Trying to use an invalid iterator\"))\n{}\n\nnamespace {\ntypedef std::pair<Tables, Relations> SchemaInfo;\n}\n\nint DomainObject::init_flag_ = 0;\nvoid *DomainObject::pending_ = NULL;\n\nbool DomainObject::register_table_meta(Table::Ptr tbl)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"register_table_meta(\" << tbl->name() \n << \"), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return false;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (!items)\n items = new SchemaInfo();\n items->first.push_back(tbl);\n return true;\n}\n\nbool DomainObject::register_relation_meta(Relation::Ptr rel)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"register_relation_meta(\" << rel->side(0)\n << \", \" << rel->side(1)\n << \"), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return false;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (!items)\n items = new SchemaInfo();\n items->second.push_back(rel);\n return true;\n}\n\nvoid DomainObject::save_registered(Schema &schema)\n{\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"save_registered(), init_flag_=\" << init_flag_ << std::endl;\n#endif\n if (init_flag_)\n return;\n init_flag_ = 1;\n SchemaInfo *&items =\n *reinterpret_cast<SchemaInfo **> (&pending_);\n if (items) {\n Tables &tables = items->first;\n Tables::iterator i = tables.begin(), iend = tables.end();\n for (; i != iend; ++i) {\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"table: \" << (*i)->name() << std::endl;\n#endif\n schema.add_table(*i);\n }\n Relations &relations = items->second;\n Relations::iterator j = relations.begin(), jend = relations.end();\n for (; j != jend; ++j) {\n#ifdef YB_DEBUG_DOMAIN_REG\n std::cerr << \"relation: \" << (*j)->side(0) << \",\" << (*j)->side(1) << std::endl;\n#endif\n schema.add_relation(*j);\n }\n delete items;\n items = NULL;\n }\n}\n\nvoid DomainObject::check_ptr() const\n{\n if (!shptr_get(d_))\n throw NoDataObject();\n}\n\nDomainObject::DomainObject(const Table &table,\n DomainObject *owner, const String &prop_name)\n : owner_(owner)\n , prop_name_(prop_name)\n{}\n\nDataObject::Ptr DomainObject::get_data_object(bool check) const\n{\n if (owner_)\n return DataObject::get_master(owner_->get_data_object(check), prop_name_);\n if (check)\n check_ptr();\n return d_;\n}\n\nvoid DomainObject::set_data_object(DataObject::Ptr d)\n{\n if (owner_) {\n owner_->check_ptr();\n DomainObject master(d);\n owner_->link_to_master(master, prop_name_);\n }\n else\n d_ = d;\n}\n\nDomainObject::DomainObject()\n : owner_(NULL)\n{}\n\nDomainObject::DomainObject(DataObject::Ptr d)\n : d_(d)\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const Table &table)\n : d_(DataObject::create_new(table))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const Schema &schema, const String &table_name)\n : d_(DataObject::create_new(schema.table(table_name)))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(Session &session, const Key &key)\n : d_(session.get_lazy(key))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(Session &session, const String &tbl_name,\n LongInt id)\n : d_(session.get_lazy(session.schema().table(tbl_name).mk_key(id)))\n , owner_(NULL)\n{}\n\nDomainObject::DomainObject(const DomainObject &obj)\n : d_(obj.get_data_object(false))\n , owner_(NULL)\n{}\n\nDomainObject::~DomainObject()\n{}\n\nDomainObject &DomainObject::operator=(const DomainObject &obj)\n{\n if (this != &obj)\n set_data_object(obj.get_data_object(false));\n return *this;\n}\n\nvoid DomainObject::save(Session &session)\n{\n session.save(get_data_object());\n}\n\nvoid DomainObject::detach(Session &session)\n{\n session.detach(get_data_object());\n}\n\nbool DomainObject::is_empty() const\n{\n return !shptr_get(get_data_object(false));\n}\n\nSession *DomainObject::get_session() const\n{\n return get_data_object()->session();\n}\n\nconst Value &DomainObject::get(const String &col_name) const\n{\n return get_data_object()->get(col_name);\n}\n\nvoid DomainObject::set(const String &col_name, const Value &value)\n{\n get_data_object()->set(col_name, value);\n}\n\nconst Value &DomainObject::get(int col_num) const\n{\n return get_data_object()->get(col_num);\n}\n\nvoid DomainObject::set(int col_num, const Value &value)\n{\n get_data_object()->set(col_num, value);\n}\n\nconst DomainObject DomainObject::get_master(\n const String &relation_name) const\n{\n return DomainObject(\n DataObject::get_master(get_data_object(), relation_name));\n}\n\nRelationObject *DomainObject::get_slaves_ro(\n const String &relation_name) const\n{\n return get_data_object()->get_slaves(relation_name);\n}\n\nManagedList<DomainObject> DomainObject::get_slaves(\n const String &relation_name) const\n{\n DataObject::Ptr p = get_data_object();\n return ManagedList<DomainObject>(p->get_slaves(relation_name), p);\n}\n\nvoid DomainObject::link_to_master(DomainObject &master,\n const String relation_name)\n{\n DataObject::link_slave_to_master(get_data_object(),\n master.get_data_object(), relation_name);\n}\n\nvoid DomainObject::link_to_slave(DomainObject &slave,\n const String relation_name)\n{\n DataObject::link_master_to_slave(get_data_object(),\n slave.get_data_object(), relation_name);\n}\n\nvoid DomainObject::delete_object()\n{\n get_data_object()->delete_object();\n}\n\nDataObject::Status DomainObject::status() const\n{\n return get_data_object()->status();\n}\n\nconst Table &DomainObject::get_table() const\n{\n return get_data_object()->table();\n}\n\nint DomainObject::cmp(const DomainObject &x) const\n{\n DataObject::Ptr p1 = get_data_object(false), p2 = x.get_data_object(false);\n if (p1 == p2)\n return 0;\n if (!shptr_get(p1))\n return -1;\n if (!shptr_get(p2))\n return 1;\n if (p1->raw_values() == p2->raw_values())\n return 0;\n return p1->raw_values() < p2->raw_values()? -1: 1;\n}\n\nElementTree::ElementPtr DomainObject::xmlize(\n int depth, const String &alt_name) const\n{\n Session *s = get_session();\n if (!s)\n throw NoSessionBaseGiven();\n return deep_xmlize(*s, get_data_object(), depth, alt_name);\n}\n\n} \/\/ namespace Yb\n\n\/\/ vim:ts=4:sts=4:sw=4:et:\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: c++; tab-width: 2; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\/* vim:set softtabstop=2 shiftwidth=2 tabstop=2 expandtab: *\/\n\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2012, Dirk Holz, University of Bonn.\n * All rights reserved.\n * The code is based on early pcl example code.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/PointCloud2.h>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/format.hpp>\n#include <boost\/date_time\/posix_time\/posix_time_io.hpp>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n#include <pcl_conversions\/pcl_conversions.h>\ntypedef pcl::PCLPointCloud2 PointCloud2;\n#else\ntypedef sensor_msgs::PointCloud2 PointCloud2;\n#endif\n\ntypedef pcl::PointXYZ Point;\ntypedef pcl::visualization::PointCloudColorHandler<PointCloud2> ColorHandler;\ntypedef ColorHandler::Ptr ColorHandlerPtr;\ntypedef ColorHandler::ConstPtr ColorHandlerConstPtr;\n\ntypedef PointCloud2::Ptr PointCloudPtr;\ntypedef PointCloud2::ConstPtr PointCloudConstPtr;\nPointCloudConstPtr cloud_, cloud_old_;\nboost::mutex m;\n\nbool paused = false;\nbool record_continuously = false;\nbool record_single = false;\nstd::string topic_name = \"\";\n\nbool record_fixed_number = false;\nint rec_max_frames = 100;\nint rec_nr_frames = 0;\n\nvoid cloud_cb (const PointCloudConstPtr& cloud)\n{\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n float stamp = static_cast<float>(cloud->header.stamp); \/\/ TODO: check!\n#else\n float stamp = cloud->header.stamp.toSec ();\n#endif\n ROS_INFO (\"PointCloud with %d data points (%s), stamp %f, and frame %s.\", \n cloud->width * cloud->height, \n pcl::getFieldsList (*cloud).c_str (), \n stamp, \n cloud->header.frame_id.c_str ()); \n m.lock ();\n\n cloud_ = cloud;\n\n if(record_continuously || record_single)\n {\n boost::posix_time::time_facet *facet = new boost::posix_time::time_facet(\"%Y_%m_%d_%H_%M_%s\");\n std::basic_stringstream<char> ss;\n ss.imbue(std::locale(std::cout.getloc(), facet));\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n ss << boost::posix_time::from_time_t(cloud->header.stamp); \/\/ TODO: check\n#else\n ss << cloud->header.stamp.toBoost();\n#endif\n std::string formatted_stamp = ss.str();\n replace(formatted_stamp.begin(), formatted_stamp.end(), '.', '_');\n\n std::string filename = str(boost::format(\"%s_%s.pcd\") \n % topic_name \n % formatted_stamp);\n replace(filename.begin(), filename.end(), '\/', '_');\n \n try\n {\n pcl::io::savePCDFile(filename.c_str(), \n *cloud,\n Eigen::Vector4f::Zero(), \n Eigen::Quaternionf::Identity(), \n true);\n if (record_single)\n pcl::console::print_info(\"Stored file %s.\\n\", filename.c_str());\n record_single = false;\n }\n catch (pcl::IOException& e)\n {\n std::cerr << e.what() << std::endl;\n return;\n }\n\n if (record_fixed_number)\n if (++rec_nr_frames >= rec_max_frames)\n record_continuously = false;\n }\n \n m.unlock ();\n}\n\nvoid keyboardEventOccurred (const pcl::visualization::KeyboardEvent &event,\n void* viewer_void)\n{\n boost::shared_ptr<pcl::visualization::PCLVisualizer> viewer = *static_cast<boost::shared_ptr<pcl::visualization::PCLVisualizer> *> (viewer_void);\n if (event.keyDown())\n {\n switch (event.getKeyCode())\n {\n case ' ': \/\/ space: grab a single frame\n record_single = true;\n break;\n \n case 'p': \/\/ paused\n paused = !paused;\n break;\n \n case 'R':\n record_fixed_number = false;\n record_continuously = !record_continuously;\n if (record_continuously)\n std::cerr << \"STARTED recording.\" << std::endl;\n else\n std::cerr << \"STOPPED recording.\" << std::endl;\n break;\n\n case 'L':\n record_fixed_number = true;\n record_continuously = !record_continuously;\n if (record_continuously)\n {\n std::cerr << \"STARTED recording.\" << std::endl;\n rec_nr_frames = 0;\n }\n else\n std::cerr << \"STOPPED recording.\" << std::endl;\n break;\n }\n }\n}\n\n\nint main (int argc, char** argv)\n{\n ros::init (argc, argv, \"pcl_online_viewer\");\n ros::NodeHandle nh;\n\n int queue_size = 1;\n pcl::console::parse_argument (argc, argv, \"-qsize\", queue_size);\n \n ros::Subscriber sub = nh.subscribe (\"input\", queue_size, cloud_cb);\n topic_name = ros::names::remap(\"input\").c_str();\n pcl::console::print_highlight(\"Subscribing to %s using a queue size of %d\\n\", topic_name.c_str(), queue_size);\n \n pcl::visualization::PCLVisualizer p (argc, argv, \"Online PointCloud2 Viewer\");\n pcl::PointCloud<Point>::Ptr cloud_xyz(new pcl::PointCloud<Point>);\n ColorHandlerPtr color_handler;\n\n p.registerKeyboardCallback(keyboardEventOccurred, (void*)&p);\n\n int color_handler_idx = 0;\n double psize = 0;\n while (nh.ok ())\n {\n ros::spinOnce ();\n ros::Duration (0.001).sleep ();\n p.spinOnce (10);\n\n if (!cloud_)\n continue;\n\n if (cloud_ == cloud_old_)\n continue;\n\n color_handler_idx = p.getColorHandlerIndex (\"cloud\");\n p.getPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"cloud\");\n p.removePointCloud (\"cloud\");\n m.lock ();\n {\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n pcl::fromPCLPointCloud2 (*cloud_, *cloud_xyz);\n#else\n pcl::fromROSMsg (*cloud_, *cloud_xyz);\n#endif\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerCustom<PointCloud2> (cloud_, 255.0, 1.0, 1.0));\n p.addPointCloud<Point>(cloud_xyz, color_handler, \"cloud\");\n for (size_t i = 0; i < cloud_->fields.size (); ++i)\n {\n if (cloud_->fields[i].name == \"rgb\" || cloud_->fields[i].name == \"rgba\")\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerRGBField<PointCloud2> (cloud_));\n else\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerGenericField<PointCloud2> (cloud_, cloud_->fields[i].name));\n p.addPointCloud<Point>(cloud_xyz, color_handler, \"cloud\");\n }\n p.setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"cloud\");\n if (color_handler_idx != -1)\n p.updateColorHandlerIndex (\"cloud\", color_handler_idx);\n cloud_old_ = cloud_;\n }\n m.unlock ();\n }\n\n return (0);\n}\n<commit_msg>changed keyboard shortcut for continuous recording (-> 'K'), temp: showing min and max measurement distance<commit_after>\/* -*- Mode: c++; tab-width: 2; c-basic-offset: 2; indent-tabs-mode: nil -*- *\/\n\/* vim:set softtabstop=2 shiftwidth=2 tabstop=2 expandtab: *\/\n\/*\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2012, Dirk Holz, University of Bonn.\n * All rights reserved.\n * The code is based on early pcl example code.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <ros\/ros.h>\n#include <sensor_msgs\/PointCloud2.h>\n#include <boost\/thread\/mutex.hpp>\n#include <boost\/format.hpp>\n#include <boost\/date_time\/posix_time\/posix_time_io.hpp>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n#include <pcl_conversions\/pcl_conversions.h>\ntypedef pcl::PCLPointCloud2 PointCloud2;\n#else\ntypedef sensor_msgs::PointCloud2 PointCloud2;\n#endif\n\ntypedef pcl::PointXYZ Point;\ntypedef pcl::visualization::PointCloudColorHandler<PointCloud2> ColorHandler;\ntypedef ColorHandler::Ptr ColorHandlerPtr;\ntypedef ColorHandler::ConstPtr ColorHandlerConstPtr;\n\ntypedef PointCloud2::Ptr PointCloudPtr;\ntypedef PointCloud2::ConstPtr PointCloudConstPtr;\nPointCloudConstPtr cloud_, cloud_old_;\nboost::mutex m;\n\nbool paused = false;\nbool record_continuously = false;\nbool record_single = false;\nstd::string topic_name = \"\";\n\nbool record_fixed_number = false;\nint rec_max_frames = 100;\nint rec_nr_frames = 0;\n\nvoid cloud_cb (const PointCloudConstPtr& cloud)\n{\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n float stamp = static_cast<float>(cloud->header.stamp); \/\/ TODO: check!\n#else\n float stamp = cloud->header.stamp.toSec ();\n#endif\n ROS_INFO (\"PointCloud with %d data points (%s), stamp %f, and frame %s.\", \n cloud->width * cloud->height, \n pcl::getFieldsList (*cloud).c_str (), \n stamp, \n cloud->header.frame_id.c_str ()); \n m.lock ();\n\n cloud_ = cloud;\n\n if(record_continuously || record_single)\n {\n boost::posix_time::time_facet *facet = new boost::posix_time::time_facet(\"%Y_%m_%d_%H_%M_%s\");\n std::basic_stringstream<char> ss;\n ss.imbue(std::locale(std::cout.getloc(), facet));\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n ss << boost::posix_time::from_time_t(cloud->header.stamp); \/\/ TODO: check\n#else\n ss << cloud->header.stamp.toBoost();\n#endif\n std::string formatted_stamp = ss.str();\n replace(formatted_stamp.begin(), formatted_stamp.end(), '.', '_');\n\n std::string filename = str(boost::format(\"%s_%s.pcd\") \n % topic_name \n % formatted_stamp);\n replace(filename.begin(), filename.end(), '\/', '_');\n \n try\n {\n pcl::io::savePCDFile(filename.c_str(), \n *cloud,\n Eigen::Vector4f::Zero(), \n Eigen::Quaternionf::Identity(), \n true);\n if (record_single)\n pcl::console::print_info(\"Stored file %s.\\n\", filename.c_str());\n record_single = false;\n }\n catch (pcl::IOException& e)\n {\n std::cerr << e.what() << std::endl;\n return;\n }\n\n if (record_fixed_number)\n if (++rec_nr_frames >= rec_max_frames)\n record_continuously = false;\n }\n \n m.unlock ();\n}\n\nvoid keyboardEventOccurred (const pcl::visualization::KeyboardEvent &event,\n void* viewer_void)\n{\n boost::shared_ptr<pcl::visualization::PCLVisualizer> viewer = *static_cast<boost::shared_ptr<pcl::visualization::PCLVisualizer> *> (viewer_void);\n if (event.keyDown())\n {\n switch (event.getKeyCode())\n {\n case ' ': \/\/ space: grab a single frame\n record_single = true;\n break;\n \n case 'p': \/\/ paused\n paused = !paused;\n break;\n \n case 'K':\n record_fixed_number = false;\n record_continuously = !record_continuously;\n if (record_continuously)\n std::cerr << \"STARTED recording.\" << std::endl;\n else\n std::cerr << \"STOPPED recording.\" << std::endl;\n break;\n\n case 'L':\n record_fixed_number = true;\n record_continuously = !record_continuously;\n if (record_continuously)\n {\n std::cerr << \"STARTED recording.\" << std::endl;\n rec_nr_frames = 0;\n }\n else\n std::cerr << \"STOPPED recording.\" << std::endl;\n break;\n }\n }\n}\n\n\nint main (int argc, char** argv)\n{\n ros::init (argc, argv, \"pcl_online_viewer\");\n ros::NodeHandle nh;\n\n int queue_size = 1;\n pcl::console::parse_argument (argc, argv, \"-qsize\", queue_size);\n \n ros::Subscriber sub = nh.subscribe (\"input\", queue_size, cloud_cb);\n topic_name = ros::names::remap(\"input\").c_str();\n pcl::console::print_highlight(\"Subscribing to %s using a queue size of %d\\n\", topic_name.c_str(), queue_size);\n \n pcl::visualization::PCLVisualizer p (argc, argv, \"Online PointCloud2 Viewer\");\n pcl::PointCloud<Point>::Ptr cloud_xyz(new pcl::PointCloud<Point>);\n ColorHandlerPtr color_handler;\n\n p.registerKeyboardCallback(keyboardEventOccurred, (void*)&p);\n\n int color_handler_idx = 0;\n double psize = 0;\n while (nh.ok ())\n {\n ros::spinOnce ();\n ros::Duration (0.001).sleep ();\n p.spinOnce (10);\n\n if (!cloud_)\n continue;\n\n if (cloud_ == cloud_old_)\n continue;\n\n color_handler_idx = p.getColorHandlerIndex (\"cloud\");\n p.getPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"cloud\");\n p.removePointCloud (\"cloud\");\n m.lock ();\n {\n#if (defined PCL_MINOR_VERSION && (PCL_MINOR_VERSION >= 7))\n pcl::fromPCLPointCloud2 (*cloud_, *cloud_xyz);\n#else\n pcl::fromROSMsg (*cloud_, *cloud_xyz);\n#endif\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerCustom<PointCloud2> (cloud_, 255.0, 1.0, 1.0));\n p.addPointCloud<Point>(cloud_xyz, color_handler, \"cloud\");\n for (size_t i = 0; i < cloud_->fields.size (); ++i)\n {\n if (cloud_->fields[i].name == \"rgb\" || cloud_->fields[i].name == \"rgba\")\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerRGBField<PointCloud2> (cloud_));\n else\n color_handler.reset (new pcl::visualization::PointCloudColorHandlerGenericField<PointCloud2> (cloud_, cloud_->fields[i].name));\n p.addPointCloud<Point>(cloud_xyz, color_handler, \"cloud\");\n }\n p.setPointCloudRenderingProperties (pcl::visualization::PCL_VISUALIZER_POINT_SIZE, psize, \"cloud\");\n if (color_handler_idx != -1)\n p.updateColorHandlerIndex (\"cloud\", color_handler_idx);\n cloud_old_ = cloud_;\n\n float min_z = std::numeric_limits<float>::max();\n float max_z = std::numeric_limits<float>::min();\n for(pcl::PointCloud<Point>::iterator iter = cloud_xyz->begin(); iter != cloud_xyz->end(); ++iter)\n {\n min_z = std::min(min_z, iter->z);\n max_z = std::max(max_z, iter->z);\n }\n printf(\"Measurement range: %0.2fcm - %0.2fcm\\n\", min_z*100.0f, max_z*100.0f);\n }\n m.unlock ();\n }\n\n return (0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\\\n * Copyright 2005, 2006 Niels Lohmann, Christian Gierds, Dennis Reinert *\n * *\n * This file is part of BPEL2oWFN. *\n * *\n * BPEL2oWFN is free software; you can redistribute it and\/or modify it *\n * under the terms of the GNU General Public License as published by the *\n * Free Software Foundation; either version 2 of the License, or(at your *\n * option) any later version. *\n * *\n * BPEL2oWFN is distributed in the hope that it will be useful, but WITHOUT *\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n * more details. *\n * *\n * You should have received a copy of the GNU General Public License along *\n * with BPEL2oWFN; if not, write to the Free Software Foundation, Inc., 51 *\n * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. *\n\\*****************************************************************************\/\n\n\/*!\n * \\file petrinet-reduction.cc\n *\n * \\brief Reduction rules for Petri nets (implementation)\n *\n * This file implements the classes and functions defined in petrinet.h.\n *\n * - PetriNet::removeInterface()\n * - PetriNet::simplify()\n * - PetriNet::removeIsolatedNodes()\n * - PetriNet::removeVariables()\n *\n * \\author\n * - responsible: Niels Lohmann <nlohmann@informatik.hu-berlin.de>\n * - last changes of: \\$Author: gierds $\n *\n * \\date\n * - created: 2006-03-16\n * - last changed: \\$Date: 2006\/04\/12 16:21:33 $\n *\n * \\note This file is part of the tool BPEL2oWFN and was created during the\n * project \"Tools4BPEL\" at the Humboldt-Universitt zu Berlin. See\n * http:\/\/www.informatik.hu-berlin.de\/top\/tools4bpel for details.\n *\n * \\version \\$Revision: 1.11 $\n *\/\n\n\n\n\n\n#include <list>\n#include \"petrinet.h\"\n#include \"debug.h\"\t\t\/\/ debugging help\n#include \"symbol-table.h\"\n#include \"helpers.h\"\n\n\n\n\/******************************************************************************\n * Functions to remove several aspects of the Petri net model\n *****************************************************************************\/\n\n\/*!\n * Collect all input and output places and remove (i.e. detach) them. Formally\n * the inner of the generated open workflow is builded.\n *\/\nvoid PetriNet::removeInterface()\n{\n trace(TRACE_DEBUG, \"[PN]\\tRemoving interface places.\\n\");\n\n list<Place *> killList;\n\n for (set<Place *>::iterator p = P_in.begin(); p != P_in.end(); p++)\n killList.push_back(*p);\n\n for (set<Place *>::iterator p = P_out.begin(); p != P_out.end(); p++)\n killList.push_back(*p);\n\n for (list<Place *>::iterator it = killList.begin(); it != killList.end(); it++)\n removePlace(*it);\n\n hasNoInterface = true;\n}\n\n\n\n\n\n\/*!\n * Remove the places modelling variables.\n *\/\nvoid PetriNet::removeVariables()\n{\n extern SymbolTable symTab;\n \n for (list<string>::iterator variable = symTab.variables.begin();\n variable != symTab.variables.end(); variable++)\n {\n removePlace( findPlace(\"variable.\" + *variable) );\n }\n\n removePlace( findPlace(\"1.internal.clock\") );\n}\n\n\n\n\n\n\/******************************************************************************\n * Functions to structurally simplify the Petri net model\n *****************************************************************************\/\n\n\n\/*!\n * Remove structural dead nodes.\n *\/\nvoid PetriNet::removeDeadNodes()\n{\n bool done = false;\n while (!done)\n {\n done = true;\n \n list<Place*> deadPlaces;\n list<Transition*> deadTransitions;\n list<Place*> tempPlaces;\n\n \/\/ find unmarked places with empty preset\n for (set<Place*>::iterator p = P.begin(); p != P.end(); p++)\n {\n if (preset(*p).empty() && !(*p)->marked)\n {\n\tdeadPlaces.push_back(*p);\n\ttempPlaces.push_back(*p);\n\ttrace(TRACE_VERY_DEBUG, \"[PN]\\tPlace p\" + intToString((*p)->id) + \" is structurally dead.\\n\");\n\tdone = false;\n }\n }\n\n while (!tempPlaces.empty())\n {\n \/\/ p is a dead place\n Place* p = tempPlaces.back();\n tempPlaces.pop_back();\n set<Node*> ps = postset(p);\n\n \/\/ transitions in the postset of a dead place are dead\n for (set<Node*>::iterator t = ps.begin(); t != ps.end(); t++)\n {\n \tdeadTransitions.push_back( (Transition*)(*t) );\n\ttrace(TRACE_VERY_DEBUG, \"[PN]\\tTransition t\" + intToString((*t)->id) + \" is structurally dead\\n\");\n\tdone = false;\n }\n }\n\n\n \/\/ remove dead places and transitions\n for (list<Place*>::iterator p = deadPlaces.begin(); p != deadPlaces.end(); p++)\n if (P.find(*p) != P.end())\n\tremovePlace(*p);\n for (list<Transition*>::iterator t = deadTransitions.begin(); t != deadTransitions.end(); t++)\n if (T. find(*t) != T.end())\n\tremoveTransition(*t);\n }\n}\n\n\n\n\n\n\/*!\n * Merges twin transitions.\n *\/\nvoid PetriNet::mergeTwinTransitions()\n{\n \/\/ a pair to store transitions to be merged\n vector<pair<string, string> > transitionPairs;\n\n trace(TRACE_VERY_DEBUG, \"[PN]\\tSearching for transitions with same preset and postset...\\n\");\n \/\/ find transitions with same preset and postset\n for (set<Transition *>::iterator t1 = T.begin(); t1 != T.end(); t1++)\n {\n set<Node*> postSet = postset(*t1);\n set<Node*> preSet = preset(*t1);\n\n for (set<Node *>:: iterator prePlace = preSet.begin(); prePlace != preSet.end(); prePlace++)\n {\n set<Node *> pPostSet = postset(*prePlace);\n for (set<Node *>::iterator t2 = pPostSet.begin(); t2 != pPostSet.end(); t2++)\n\tif (*t1 != *t2)\n\t if ((preSet == preset(*t2)) && (postSet == postset(*t2)))\n\t transitionPairs.push_back(pair<string, string>(*((*t1)->history.begin()), *((*t2)->history.begin())));\n } \n \n }\n \n trace(TRACE_VERY_DEBUG, \"[PN]\\tFound \" + intToString(transitionPairs.size()) + \" transitions with same preset and postset...\\n\");\n\n \/\/ merge the found transitions\n for (unsigned int i = 0; i < transitionPairs.size(); i++)\n {\n Transition *t1 = findTransition(transitionPairs[i].first);\n Transition *t2 = findTransition(transitionPairs[i].second);\n\n if ((t1 != NULL) && (t2 != NULL) && (t1 != t2))\n mergeTransitions(t1, t2);\n }\n}\n\n\n\n\n\n\/*!\n * Returns true if there is a communicating transition in the postset of the\n * given place p.\n *\n * \\param p a place to check\n * \\return true, if a communicating transition was found\n *\/\nbool PetriNet::communicationInPostSet(Place *p)\n{\n set<Node*> pp = postset(p);\n for (set<Node*>::iterator t = pp.begin();\n t != pp.end();\n t++)\n {\n if (((Transition*)(*t))->communicating)\n return true;\n }\n \n return false;\n}\n\n\n\n\n\n\/*!\n * Collapse simple sequences.\n *\n * A simple sequence is a transition with\n * - singleton preset\n * - singleton postset\n * - no communicating transition following\n * - preset != postset\n *\/\nvoid PetriNet::collapseSequences()\n{\n trace(TRACE_VERY_DEBUG, \"[PN]\\tCollapsing simple sequences\\n\");\n\n \/\/ a pair to store places to be merged\n vector<string> sequenceTransitions;\n vector<pair<string, string> >placeMerge;\n\n \/\/ find transitions with singelton preset and postset\n for (set<Transition *>::iterator t = T.begin(); t != T.end(); t++)\n {\n if (\n\t(preset(*t).size() == 1) &&\n\t(postset(*t).size() == 1) &&\n\t!communicationInPostSet((Place*)*(postset(*t).begin())) &&\n\t(*(postset(*t).begin()) != (*preset(*t).begin()))\n )\n {\n string id1 = *((*(preset(*t).begin()))->history.begin());\n string id2 = *((*(postset(*t).begin()))->history.begin());\n placeMerge.push_back(pair < string, string >(id1, id2));\n sequenceTransitions.push_back(*((*t)->history.begin()));\n }\n }\n\n \/\/ merge preset and postset\n for (unsigned int i = 0; i < placeMerge.size(); i++)\n mergePlaces(placeMerge[i].first, placeMerge[i].second);\n\n \/\/ remove \"sequence\"-transtions\n for (unsigned int i = 0; i < sequenceTransitions.size(); i++)\n {\n Transition *sequenceTransition = findTransition(sequenceTransitions[i]);\n if (sequenceTransition != NULL)\n removeTransition(sequenceTransition);\n } \n}\n\n\n\n\n\n\/*!\n * Implements some simple structural reduction rules for Petri nets:\n *\n * - Structural dead nodes are removed.\n * - If two transitions t1 and t2 have the same preset and postset, one of them\n * can safely be removed.\n * - If a transition has a singleton preset and postset, the transition can be\n * removed(sequence) and the preset and postset can be merged.\n *\n * \\todo\n * -(nlohmann) improve performance\n * -(nlohmann) implement more reduction rules\n *\n *\/\nvoid PetriNet::simplify()\n{\n trace(TRACE_DEBUG, \"[PN]\\tPetri net size before simplification: \" + information() + \"\\n\");\n trace(TRACE_INFORMATION, \"Simplifying Petri net...\\n\");\n\n string old = information();\n bool done = false;\n int passes = 1;\n while (!done)\n {\n removeDeadNodes();\n mergeTwinTransitions();\n \/\/ collapseSequences();\n \n trace(TRACE_DEBUG, \"[PN]\\tPetri net size after simplification pass \" + intToString(passes++) + \": \" + information() + \"\\n\");\n\n done = (old == information());\n old = information();\n }\n\n trace(TRACE_INFORMATION, \"Simplifying complete.\\n\");\n trace(TRACE_DEBUG, \"[PN]\\tPetri net size after simplification: \" + information() + \"\\n\");\n}\n<commit_msg>* real marcoplace rule<commit_after>\/*****************************************************************************\\\n * Copyright 2005, 2006 Niels Lohmann, Christian Gierds, Dennis Reinert *\n * *\n * This file is part of BPEL2oWFN. *\n * *\n * BPEL2oWFN is free software; you can redistribute it and\/or modify it *\n * under the terms of the GNU General Public License as published by the *\n * Free Software Foundation; either version 2 of the License, or(at your *\n * option) any later version. *\n * *\n * BPEL2oWFN is distributed in the hope that it will be useful, but WITHOUT *\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n * more details. *\n * *\n * You should have received a copy of the GNU General Public License along *\n * with BPEL2oWFN; if not, write to the Free Software Foundation, Inc., 51 *\n * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. *\n\\*****************************************************************************\/\n\n\/*!\n * \\file petrinet-reduction.cc\n *\n * \\brief Reduction rules for Petri nets (implementation)\n *\n * This file implements the classes and functions defined in petrinet.h.\n *\n * - PetriNet::removeInterface()\n * - PetriNet::simplify()\n * - PetriNet::removeIsolatedNodes()\n * - PetriNet::removeVariables()\n *\n * \\author\n * - responsible: Niels Lohmann <nlohmann@informatik.hu-berlin.de>\n * - last changes of: \\$Author: gierds $\n *\n * \\date\n * - created: 2006-03-16\n * - last changed: \\$Date: 2006\/04\/25 11:56:55 $\n *\n * \\note This file is part of the tool BPEL2oWFN and was created during the\n * project \"Tools4BPEL\" at the Humboldt-Universitt zu Berlin. See\n * http:\/\/www.informatik.hu-berlin.de\/top\/tools4bpel for details.\n *\n * \\version \\$Revision: 1.12 $\n *\/\n\n\n\n\n\n#include <list>\n#include \"petrinet.h\"\n#include \"debug.h\"\t\t\/\/ debugging help\n#include \"symbol-table.h\"\n#include \"helpers.h\"\n\n\n\n\/******************************************************************************\n * Functions to remove several aspects of the Petri net model\n *****************************************************************************\/\n\n\/*!\n * Collect all input and output places and remove (i.e. detach) them. Formally\n * the inner of the generated open workflow is builded.\n *\/\nvoid PetriNet::removeInterface()\n{\n trace(TRACE_DEBUG, \"[PN]\\tRemoving interface places.\\n\");\n\n list<Place *> killList;\n\n for (set<Place *>::iterator p = P_in.begin(); p != P_in.end(); p++)\n killList.push_back(*p);\n\n for (set<Place *>::iterator p = P_out.begin(); p != P_out.end(); p++)\n killList.push_back(*p);\n\n for (list<Place *>::iterator it = killList.begin(); it != killList.end(); it++)\n removePlace(*it);\n\n hasNoInterface = true;\n}\n\n\n\n\n\n\/*!\n * Remove the places modelling variables.\n *\/\nvoid PetriNet::removeVariables()\n{\n extern SymbolTable symTab;\n \n for (list<string>::iterator variable = symTab.variables.begin();\n variable != symTab.variables.end(); variable++)\n {\n removePlace( findPlace(\"variable.\" + *variable) );\n }\n\n removePlace( findPlace(\"1.internal.clock\") );\n}\n\n\n\n\n\n\/******************************************************************************\n * Functions to structurally simplify the Petri net model\n *****************************************************************************\/\n\n\n\/*!\n * Remove structural dead nodes.\n *\/\nvoid PetriNet::removeDeadNodes()\n{\n bool done = false;\n while (!done)\n {\n done = true;\n \n list<Place*> deadPlaces;\n list<Transition*> deadTransitions;\n list<Place*> tempPlaces;\n\n \/\/ find unmarked places with empty preset\n for (set<Place*>::iterator p = P.begin(); p != P.end(); p++)\n {\n if (preset(*p).empty() && !(*p)->marked)\n {\n\tdeadPlaces.push_back(*p);\n\ttempPlaces.push_back(*p);\n\ttrace(TRACE_VERY_DEBUG, \"[PN]\\tPlace p\" + intToString((*p)->id) + \" is structurally dead.\\n\");\n\tdone = false;\n }\n }\n\n while (!tempPlaces.empty())\n {\n \/\/ p is a dead place\n Place* p = tempPlaces.back();\n tempPlaces.pop_back();\n set<Node*> ps = postset(p);\n\n \/\/ transitions in the postset of a dead place are dead\n for (set<Node*>::iterator t = ps.begin(); t != ps.end(); t++)\n {\n \tdeadTransitions.push_back( (Transition*)(*t) );\n\ttrace(TRACE_VERY_DEBUG, \"[PN]\\tTransition t\" + intToString((*t)->id) + \" is structurally dead\\n\");\n\tdone = false;\n }\n }\n\n\n \/\/ remove dead places and transitions\n for (list<Place*>::iterator p = deadPlaces.begin(); p != deadPlaces.end(); p++)\n if (P.find(*p) != P.end())\n\tremovePlace(*p);\n for (list<Transition*>::iterator t = deadTransitions.begin(); t != deadTransitions.end(); t++)\n if (T. find(*t) != T.end())\n\tremoveTransition(*t);\n }\n}\n\n\n\n\n\n\/*!\n * Merges twin transitions.\n *\/\nvoid PetriNet::mergeTwinTransitions()\n{\n \/\/ a pair to store transitions to be merged\n vector<pair<string, string> > transitionPairs;\n\n trace(TRACE_VERY_DEBUG, \"[PN]\\tSearching for transitions with same preset and postset...\\n\");\n \/\/ find transitions with same preset and postset\n for (set<Transition *>::iterator t1 = T.begin(); t1 != T.end(); t1++)\n {\n set<Node*> postSet = postset(*t1);\n set<Node*> preSet = preset(*t1);\n\n for (set<Node *>:: iterator prePlace = preSet.begin(); prePlace != preSet.end(); prePlace++)\n {\n set<Node *> pPostSet = postset(*prePlace);\n for (set<Node *>::iterator t2 = pPostSet.begin(); t2 != pPostSet.end(); t2++)\n\tif (*t1 != *t2)\n\t if ((preSet == preset(*t2)) && (postSet == postset(*t2)))\n\t transitionPairs.push_back(pair<string, string>(*((*t1)->history.begin()), *((*t2)->history.begin())));\n } \n \n }\n \n trace(TRACE_VERY_DEBUG, \"[PN]\\tFound \" + intToString(transitionPairs.size()) + \" transitions with same preset and postset...\\n\");\n\n \/\/ merge the found transitions\n for (unsigned int i = 0; i < transitionPairs.size(); i++)\n {\n Transition *t1 = findTransition(transitionPairs[i].first);\n Transition *t2 = findTransition(transitionPairs[i].second);\n\n if ((t1 != NULL) && (t2 != NULL) && (t1 != t2))\n mergeTransitions(t1, t2);\n }\n}\n\n\n\n\n\n\/*!\n * Returns true if there is a communicating transition in the postset of the\n * given place p.\n *\n * \\param p a place to check\n * \\return true, if a communicating transition was found\n *\/\nbool PetriNet::communicationInPostSet(Place *p)\n{\n set<Node*> pp = postset(p);\n for (set<Node*>::iterator t = pp.begin();\n t != pp.end();\n t++)\n {\n if (((Transition*)(*t))->communicating)\n return true;\n }\n \n return false;\n}\n\n\n\n\n\n\/*!\n * Collapse simple sequences.\n *\n * A simple sequence is a transition with\n * - singleton preset\n * - singleton postset\n * - no communicating transition following\n * - preset != postset\n *\/\nvoid PetriNet::collapseSequences()\n{\n trace(TRACE_VERY_DEBUG, \"[PN]\\tCollapsing simple sequences\\n\");\n\n \/\/ a pair to store places to be merged\n list<string> sequenceTransitions;\n list<pair<string, string> >placeMerge;\n\n \/\/ find transitions with singelton preset and postset\n for (set<Transition *>::iterator t = T.begin(); t != T.end(); t++)\n {\n set<Node *> postSet = postset(*t);\n set<Node *> preSet = preset (*t);\n Place * prePlace = (Place*) *(preSet.begin());\n Place * postPlace = (Place*) *(postSet.begin());\n if (\n\t(preSet.size() == 1) &&\n\t(postSet.size() == 1) &&\n\/\/\t!communicationInPostSet((Place*)*(postSet.begin())) &&\n\t(prePlace != postPlace) &&\n\t(postset(prePlace).size() == 1) \n )\n {\n string id1 = *((*(preSet.begin()))->history.begin());\n string id2 = *((*(postSet.begin()))->history.begin());\n placeMerge.push_back(pair < string, string >(id1, id2));\n sequenceTransitions.push_back(*((*t)->history.begin()));\n }\n }\n\n \/\/ remove \"sequence\"-transtions\n for (list< string >::iterator i = sequenceTransitions.begin(); i != sequenceTransitions.end(); i++)\n {\n Transition *sequenceTransition = findTransition(*i);\n if (sequenceTransition != NULL)\n removeTransition(sequenceTransition);\n } \n\n \/\/ merge preset and postset\n for (list< pair<string, string> >::iterator i = placeMerge.begin(); i != placeMerge.end(); i++)\n mergePlaces(i->first, i->second);\n\n}\n\n\n\n\n\n\/*!\n * Implements some simple structural reduction rules for Petri nets:\n *\n * - Structural dead nodes are removed.\n * - If two transitions t1 and t2 have the same preset and postset, one of them\n * can safely be removed.\n * - If a transition has a singleton preset and postset, the transition can be\n * removed(sequence) and the preset and postset can be merged.\n *\n * \\todo\n * -(nlohmann) improve performance\n * -(nlohmann) implement more reduction rules\n *\n *\/\nvoid PetriNet::simplify()\n{\n trace(TRACE_DEBUG, \"[PN]\\tPetri net size before simplification: \" + information() + \"\\n\");\n trace(TRACE_INFORMATION, \"Simplifying Petri net...\\n\");\n\n string old = information();\n bool done = false;\n int passes = 1;\n while (!done)\n {\n removeDeadNodes();\n mergeTwinTransitions();\n collapseSequences();\n \n trace(TRACE_DEBUG, \"[PN]\\tPetri net size after simplification pass \" + intToString(passes++) + \": \" + information() + \"\\n\");\n\n done = (old == information());\n old = information();\n }\n\n trace(TRACE_INFORMATION, \"Simplifying complete.\\n\");\n trace(TRACE_DEBUG, \"[PN]\\tPetri net size after simplification: \" + information() + \"\\n\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include <assert.h>\n#include \"ast.h\"\n\nvoid test()\n{\n extern void lex_test();\n extern void ast_test();\n lex_test();\n ast_test();\n}\n\nclass expr {\npublic:\n virtual ~expr() {}\n virtual std::unique_ptr<expr> clone() const = 0;\n\n friend std::ostream& operator<<(std::ostream& os, const expr& e) {\n e.print(os);\n return os;\n }\n\nprotected:\n expr() {}\n\nprivate:\n virtual void print(std::ostream& os) const = 0;\n};\n\ntypedef std::unique_ptr<expr> expr_ptr;\n\nclass const_expr : public expr {\npublic:\n explicit const_expr(double value) : value_(value) {}\n virtual std::unique_ptr<expr> clone() const override { return std::unique_ptr<expr>{new const_expr{value_}}; }\n double value() const { return value_; }\nprivate:\n double value_;\n virtual void print(std::ostream& os) const override {\n os << value_;\n }\n};\n\nclass var_expr : public expr {\npublic:\n explicit var_expr(const std::string& name) : name_(name) {}\n std::string name() const { return name_; }\n virtual std::unique_ptr<expr> clone() const override { return std::unique_ptr<expr>{new var_expr{name_}}; }\nprivate:\n std::string name_;\n virtual void print(std::ostream& os) const override {\n os << name_;\n }\n};\n\nclass bin_op_expr : public expr {\npublic:\n bin_op_expr(expr_ptr lhs, expr_ptr rhs, char op) : lhs_(std::move(lhs)), rhs_(std::move(rhs)), op_(op) {}\n const expr& lhs() const { return *lhs_; }\n const expr& rhs() const { return *rhs_; }\n char op() const { return op_; }\n virtual std::unique_ptr<expr> clone() const override {\n return std::unique_ptr<expr>{new bin_op_expr{lhs().clone(), rhs().clone(), op_}};\n }\nprivate:\n expr_ptr lhs_;\n expr_ptr rhs_;\n char op_;\n virtual void print(std::ostream& os) const override {\n os << \"{\" << op_ << \" \" << lhs() << \" \" << rhs() << \"}\";\n }\n};\n\nexpr_ptr constant(double d) { return expr_ptr{new const_expr{d}}; }\nexpr_ptr var(const std::string& n) { return expr_ptr{new var_expr{n}}; }\n\nexpr_ptr operator+(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '+'}};\n}\n\nexpr_ptr operator-(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '-'}};\n}\n\nexpr_ptr operator*(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '*'}};\n}\n\nexpr_ptr operator\/(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '\/'}};\n}\n\nstd::ostream& operator<<(std::ostream& os, const expr_ptr& e) {\n os << *e;\n return os;\n}\n\ntemplate<typename T>\nconst T* expr_cast(const expr_ptr& e) {\n return dynamic_cast<const T*>(e.get());\n}\n\nbool match_const(const expr_ptr& e, const double& v) {\n auto cp = expr_cast<const_expr>(e);\n return cp && cp->value() == v;\n}\n\nbool match_var(const expr_ptr& e, const std::string& v) {\n auto vp = expr_cast<var_expr>(e);\n return vp && vp->name() == v;\n}\n\n\/\/ Solve the equation \"e\" for variable \"v\"\nexpr_ptr solve(const expr_ptr& lhs, const expr_ptr& rhs, const std::string& v) {\n if (match_var(lhs, v)) {\n return rhs->clone();\n }\n if (match_var(rhs, v)) {\n return lhs->clone();\n }\n\n std::ostringstream oss;\n oss << \"Unable to solve '\" << lhs << \"'='\" << rhs << \"' for '\" << v << \"'\";\n throw std::runtime_error(oss.str());\n}\n\nvoid test_solve(const expr_ptr& lhs, const expr_ptr& rhs, const std::string& v, double value) {\n auto s = solve(lhs, rhs, v);\n if (match_const(s, value)) {\n return;\n }\n\n std::cout << \"Wrong answer for '\" << lhs << \"'='\" << rhs << \"' for '\" << v << \"'\\n\";\n std::cout << \"Expected: \" << value << std::endl;\n std::cout << \"Got: '\" << s << \"'\" << std::endl;\n}\n\n\nint main()\n{\n test();\n\n test_solve(var(\"x\"), constant(8), \"x\", 8);\n test_solve(constant(42), var(\"x\"), \"x\", 42);\n\/\/ std::cout << solve(constant(2) * var(\"x\"), constant(8), \"x\") << std::endl;\n}\n<commit_msg>Basic solver<commit_after>#include <iostream>\n#include <sstream>\n#include <queue>\n#include <assert.h>\n#include \"ast.h\"\n\nvoid test()\n{\n extern void lex_test();\n extern void ast_test();\n lex_test();\n ast_test();\n}\n\nclass expr {\npublic:\n virtual ~expr() {}\n virtual std::unique_ptr<expr> clone() const = 0;\n\n operator std::unique_ptr<expr>() const {\n return clone();\n }\n\n friend std::ostream& operator<<(std::ostream& os, const expr& e) {\n e.print(os);\n return os;\n }\n\nprotected:\n expr() {}\n\nprivate:\n virtual void print(std::ostream& os) const = 0;\n};\n\ntypedef std::unique_ptr<expr> expr_ptr;\n\nclass const_expr : public expr {\npublic:\n explicit const_expr(double value) : value_(value) {}\n virtual std::unique_ptr<expr> clone() const override { return std::unique_ptr<expr>{new const_expr{value_}}; }\n double value() const { return value_; }\nprivate:\n double value_;\n virtual void print(std::ostream& os) const override {\n os << value_;\n }\n};\n\nclass var_expr : public expr {\npublic:\n explicit var_expr(const std::string& name) : name_(name) {}\n std::string name() const { return name_; }\n virtual std::unique_ptr<expr> clone() const override { return std::unique_ptr<expr>{new var_expr{name_}}; }\nprivate:\n std::string name_;\n virtual void print(std::ostream& os) const override {\n os << name_;\n }\n};\n\nclass bin_op_expr : public expr {\npublic:\n bin_op_expr(expr_ptr lhs, expr_ptr rhs, char op) : lhs_(std::move(lhs)), rhs_(std::move(rhs)), op_(op) {}\n const expr& lhs() const { return *lhs_; }\n const expr& rhs() const { return *rhs_; }\n char op() const { return op_; }\n virtual std::unique_ptr<expr> clone() const override {\n return std::unique_ptr<expr>{new bin_op_expr{lhs().clone(), rhs().clone(), op_}};\n }\nprivate:\n expr_ptr lhs_;\n expr_ptr rhs_;\n char op_;\n virtual void print(std::ostream& os) const override {\n os << \"{\" << op_ << \" \" << lhs() << \" \" << rhs() << \"}\";\n }\n};\n\nexpr_ptr constant(double d) { return expr_ptr{new const_expr{d}}; }\nexpr_ptr var(const std::string& n) { return expr_ptr{new var_expr{n}}; }\n\nexpr_ptr operator+(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '+'}};\n}\n\nexpr_ptr operator-(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '-'}};\n}\n\nexpr_ptr operator*(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '*'}};\n}\n\nexpr_ptr operator\/(expr_ptr a, expr_ptr b) {\n return expr_ptr{new bin_op_expr{std::move(a), std::move(b), '\/'}};\n}\n\nstd::ostream& operator<<(std::ostream& os, const expr_ptr& e) {\n os << *e;\n return os;\n}\n\ntemplate<typename T, typename E>\nconst T* expr_cast(const E& e) {\n return dynamic_cast<const T*>(&e);\n}\n\nbool match_const(const expr& e, const double& v) {\n auto cp = expr_cast<const_expr>(e);\n return cp && cp->value() == v;\n}\n\nbool extract_const(const expr& e, double& v) {\n if (auto cp = expr_cast<const_expr>(e)) {\n v = cp->value();\n return true;\n }\n v = 0;\n return false;\n}\n\nbool match_var(const expr& e, const std::string& v) {\n auto vp = expr_cast<var_expr>(e);\n return vp && vp->name() == v;\n}\n\nstruct solver {\n explicit solver(const std::string& v) : v_(v) {}\n\n expr_ptr solve(const expr& lhs, const expr& rhs) {\n items_ = std::queue<item_type>{};\n push_job(lhs.clone(), rhs.clone());\n return do_solve_1();\n }\n\n \/\/ Solve the equation \"e\" for variable \"v\"\nprivate:\n typedef std::pair<expr_ptr, expr_ptr> item_type;\n std::string v_;\n std::queue<item_type> items_;\n\n void push_job(expr_ptr lhs, expr_ptr rhs) {\n items_.push(make_pair(std::move(lhs), std::move(rhs)));\n }\n\n expr_ptr do_solve_1() {\n while (!items_.empty()) {\n auto& top = items_.front();\n if (auto e = do_solve(*top.first, *top.second)) {\n return e;\n }\n items_.pop();\n }\n assert(false);\n return nullptr;\n }\n\n expr_ptr do_solve(const expr& lhs, const expr& rhs) {\n double val;\n std::cout << \">>>solve lhs=\" << lhs << \" rhs=\" << rhs << std::endl;\n if (match_var(lhs, v_) && extract_const(rhs, val)) {\n return constant(val);\n }\n if (match_var(rhs, v_) && extract_const(lhs, val)) {\n return constant(val);\n }\n if (auto bp = expr_cast<bin_op_expr>(lhs)) {\n return do_solve_bin_op(*bp, rhs);\n }\n if (auto bp = expr_cast<bin_op_expr>(rhs)) {\n return do_solve_bin_op(*bp, lhs);\n }\n assert(false);\n return nullptr;\n }\n\n expr_ptr do_solve_bin_op(const bin_op_expr& a, const expr& b) {\n double ac, bc;\n if (extract_const(a.lhs(), ac) && extract_const(a.rhs(), bc)) {\n switch (a.op()) {\n case '+': return constant(ac + bc);\n case '-': return constant(ac - bc);\n case '*': return constant(ac * bc);\n case '\/': return constant(ac \/ bc);\n default:\n std::cout << \"Don't know how to handle \" << a.op() << std::endl;\n assert(false);\n }\n }\n\n switch (a.op()) {\n case '*':\n push_job(a.lhs(), b \/ a.rhs());\n push_job(a.rhs(), b \/ a.lhs());\n break;\n case '\/':\n push_job(a.lhs(), b * a.rhs());\n push_job(a.rhs(), b * a.lhs());\n break;\n default:\n std::cout << \"Don't know how to handle \" << a.op() << std::endl;\n assert(false);\n }\n return nullptr;\n }\n};\n\nvoid test_solve(const expr_ptr& lhs, const expr_ptr& rhs, const std::string& v, double value) {\n solver solv{v};\n auto s = solv.solve(*lhs, *rhs);\n if (!s) {\n std::cout << \"Unable to solve '\" << lhs << \"'='\" << rhs << \"' for '\" << v << \"'\" << std::endl;\n assert(false);\n }\n if (match_const(*s, value)) {\n std::cout << \"OK: \" << lhs << \"=\" << rhs << \" ==> \" << v << \"=\" << *s << std::endl;\n return;\n }\n\n std::cout << \"Wrong answer for '\" << lhs << \"'='\" << rhs << \"' for '\" << v << \"'\\n\";\n std::cout << \"Expected: \" << value << std::endl;\n std::cout << \"Got: '\" << s << \"'\" << std::endl;\n}\n\n\nint main()\n{\n test();\n\n test_solve(var(\"x\"), constant(8), \"x\", 8);\n test_solve(constant(42), var(\"x\"), \"x\", 42);\n test_solve(constant(2) * var(\"x\"), constant(8), \"x\", 4);\n}\n<|endoftext|>"} {"text":"<commit_before>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/**************************************************************************\n Connections\n\n Commonality across all platforms -- move out as required.\n\n**************************************************************************\/\n\n#include \"ink_unused.h\" \/* MAGIC_EDITING_TAG *\/\n#include \"libts.h\"\n\n#include \"P_Net.h\"\n\n#define SET_TCP_NO_DELAY\n#define SET_NO_LINGER\n\/\/ set in the OS\n\/\/ #define RECV_BUF_SIZE (1024*64)\n\/\/ #define SEND_BUF_SIZE (1024*64)\n#define FIRST_RANDOM_PORT 16000\n#define LAST_RANDOM_PORT 32000\n\n#define ROUNDUP(x, y) ((((x)+((y)-1))\/(y))*(y))\n\nint\nget_listen_backlog(void)\n{\n int listen_backlog = 1024;\n\n IOCORE_ReadConfigInteger(listen_backlog, \"proxy.config.net.listen_backlog\");\n return listen_backlog;\n}\n\n\n\/\/\n\/\/ Functions\n\/\/\nchar const*\nNetVCOptions::toString(addr_bind_style s) {\n return ANY_ADDR == s ? \"any\"\n : INTF_ADDR == s ? \"interface\"\n : \"foreign\"\n ;\n}\n\nConnection::Connection()\n : fd(NO_FD)\n , is_bound(false)\n , is_connected(false)\n{\n memset(&sa, 0, sizeof(struct sockaddr_storage));\n}\n\n\nConnection::~Connection()\n{\n close();\n}\n\n\nint\nServer::accept(Connection * c)\n{\n int res = 0;\n socklen_t sz = sizeof(c->sa);\n\n res = socketManager.accept(fd, (struct sockaddr *)&c->sa, &sz);\n if (res < 0)\n return res;\n c->fd = res;\n\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n if ((res = safe_nonblocking(c->fd)) < 0)\n goto Lerror;\n#ifdef SEND_BUF_SIZE\n socketManager.set_sndbuf_size(c->fd, SEND_BUF_SIZE);\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n return 0;\nLerror:\n c->close();\n return res;\n}\n\n\nint\nConnection::close()\n{\n is_connected = false;\n is_bound = false;\n \/\/ don't close any of the standards\n if (fd >= 2) {\n int fd_save = fd;\n fd = NO_FD;\n return socketManager.close(fd_save);\n } else {\n fd = NO_FD;\n return -EBADF;\n }\n}\n\nint\nServer::setup_fd_for_listen(bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n int res = 0;\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n \/\/ coverity[negative_sink_in_call]\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int)) < 0))\n goto Lerror;\n#endif\n\n \/*\n * dg: this has been removed since the ISS patch under solaris seems\n * to not like the socket being listened on twice. This is first done\n * in the manager when the socket is created.\n *\/\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\nLerror:\n res = -errno;\n \/\/ coverity[check_after_sink]\n if (fd != NO_FD)\n close();\n return res;\n}\n\n\nint\nServer::listen(int port_number, int domain, bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n ink_assert(fd == NO_FD);\n int res = 0;\n int gai_errno = 0;\n\n char port[6] = {'\\0'};\n struct addrinfo hints;\n struct addrinfo *ai_res = NULL;\n struct addrinfo *ai = NULL;\n socklen_t addrlen = 0; \/\/ keep track of length of socket address info\n snprintf(port, sizeof(port), \"%d\", port_number);\n\n memset(&hints, 0, sizeof(hints));\n hints.ai_family = domain;\n hints.ai_socktype = SOCK_STREAM;\n hints.ai_flags = AI_PASSIVE|AI_NUMERICHOST|AI_ADDRCONFIG;\n gai_errno = getaddrinfo(accept_ip_str, port, &hints, &ai_res);\n if(0 != gai_errno) {\n Error(\"getaddrinfo error %i: %s\", gai_errno, gai_strerror(gai_errno));\n return -1;\n }\n\n ai = ai_res;\n\n res = socketManager.socket(ai->ai_family, ai->ai_socktype, ai->ai_protocol);\n\n memset(&sa, 0, sizeof(sa));\n addrlen = ai->ai_addrlen; \/\/ save value for later since ai will be freed asap\n memcpy(&sa, ai->ai_addr, ai->ai_addrlen);\n\n freeaddrinfo(ai_res);\n\n if (res < 0)\n return res;\n fd = res;\n\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n\n if (domain == AF_INET6 && (res = safe_setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = socketManager.ink_bind(fd, (struct sockaddr *) &sa, addrlen, IPPROTO_TCP)) < 0) {\n goto Lerror;\n }\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n if ((res = safe_listen(fd, get_listen_backlog())) < 0)\n goto Lerror;\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n if (!port_number) {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\n\nLerror:\n if (fd != NO_FD)\n close();\n Error(\"Could not bind or listen to port %d (error: %d)\", port_number, res);\n return res;\n}\n<commit_msg>TS-851 run TS without a real interface<commit_after>\/** @file\n\n A brief file description\n\n @section license License\n\n Licensed to the Apache Software Foundation (ASF) under one\n or more contributor license agreements. See the NOTICE file\n distributed with this work for additional information\n regarding copyright ownership. The ASF licenses this file\n to you under the Apache License, Version 2.0 (the\n \"License\"); you may not use this file except in compliance\n with the License. You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n *\/\n\n\/**************************************************************************\n Connections\n\n Commonality across all platforms -- move out as required.\n\n**************************************************************************\/\n\n#include \"ink_unused.h\" \/* MAGIC_EDITING_TAG *\/\n#include \"libts.h\"\n\n#include \"P_Net.h\"\n\n#define SET_TCP_NO_DELAY\n#define SET_NO_LINGER\n\/\/ set in the OS\n\/\/ #define RECV_BUF_SIZE (1024*64)\n\/\/ #define SEND_BUF_SIZE (1024*64)\n#define FIRST_RANDOM_PORT 16000\n#define LAST_RANDOM_PORT 32000\n\n#define ROUNDUP(x, y) ((((x)+((y)-1))\/(y))*(y))\n\nint\nget_listen_backlog(void)\n{\n int listen_backlog = 1024;\n\n IOCORE_ReadConfigInteger(listen_backlog, \"proxy.config.net.listen_backlog\");\n return listen_backlog;\n}\n\n\n\/\/\n\/\/ Functions\n\/\/\nchar const*\nNetVCOptions::toString(addr_bind_style s) {\n return ANY_ADDR == s ? \"any\"\n : INTF_ADDR == s ? \"interface\"\n : \"foreign\"\n ;\n}\n\nConnection::Connection()\n : fd(NO_FD)\n , is_bound(false)\n , is_connected(false)\n{\n memset(&sa, 0, sizeof(struct sockaddr_storage));\n}\n\n\nConnection::~Connection()\n{\n close();\n}\n\n\nint\nServer::accept(Connection * c)\n{\n int res = 0;\n socklen_t sz = sizeof(c->sa);\n\n res = socketManager.accept(fd, (struct sockaddr *)&c->sa, &sz);\n if (res < 0)\n return res;\n c->fd = res;\n\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n if ((res = safe_nonblocking(c->fd)) < 0)\n goto Lerror;\n#ifdef SEND_BUF_SIZE\n socketManager.set_sndbuf_size(c->fd, SEND_BUF_SIZE);\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n return 0;\nLerror:\n c->close();\n return res;\n}\n\n\nint\nConnection::close()\n{\n is_connected = false;\n is_bound = false;\n \/\/ don't close any of the standards\n if (fd >= 2) {\n int fd_save = fd;\n fd = NO_FD;\n return socketManager.close(fd_save);\n } else {\n fd = NO_FD;\n return -EBADF;\n }\n}\n\nint\nServer::setup_fd_for_listen(bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n int res = 0;\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n \/\/ coverity[negative_sink_in_call]\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int)) < 0))\n goto Lerror;\n#endif\n\n \/*\n * dg: this has been removed since the ISS patch under solaris seems\n * to not like the socket being listened on twice. This is first done\n * in the manager when the socket is created.\n *\/\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\nLerror:\n res = -errno;\n \/\/ coverity[check_after_sink]\n if (fd != NO_FD)\n close();\n return res;\n}\n\n\nint\nServer::listen(int port_number, int domain, bool non_blocking, int recv_bufsize, int send_bufsize)\n{\n ink_assert(fd == NO_FD);\n int res = 0;\n int gai_errno = 0;\n\n char port[6] = {'\\0'};\n struct addrinfo hints;\n struct addrinfo *ai_res = NULL;\n struct addrinfo *ai = NULL;\n socklen_t addrlen = 0; \/\/ keep track of length of socket address info\n snprintf(port, sizeof(port), \"%d\", port_number);\n\n memset(&hints, 0, sizeof(hints));\n hints.ai_family = domain;\n hints.ai_socktype = SOCK_STREAM;\n hints.ai_flags = AI_PASSIVE|AI_NUMERICHOST;\n gai_errno = getaddrinfo(accept_ip_str, port, &hints, &ai_res);\n if(0 != gai_errno) {\n Error(\"getaddrinfo %s:%s error %i: %s\", accept_ip_str, port, gai_errno, gai_strerror(gai_errno));\n return -1;\n }\n\n ai = ai_res;\n\n res = socketManager.socket(ai->ai_family, ai->ai_socktype, ai->ai_protocol);\n\n memset(&sa, 0, sizeof(sa));\n addrlen = ai->ai_addrlen; \/\/ save value for later since ai will be freed asap\n memcpy(&sa, ai->ai_addr, ai->ai_addrlen);\n\n freeaddrinfo(ai_res);\n\n if (res < 0)\n return res;\n fd = res;\n\n#ifdef SEND_BUF_SIZE\n {\n int send_buf_size = SEND_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_SNDBUF, (char *) &send_buf_size, sizeof(int)) < 0))\n goto Lerror;\n }\n#endif\n#ifdef RECV_BUF_SIZE\n {\n int recv_buf_size = RECV_BUF_SIZE;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_RCVBUF, (char *) &recv_buf_size, sizeof(int))) < 0)\n goto Lerror;\n }\n#endif\n\n if (recv_bufsize) {\n if (socketManager.set_rcvbuf_size(fd, recv_bufsize)) {\n \/\/ Round down until success\n int rbufsz = ROUNDUP(recv_bufsize, 1024);\n while (rbufsz) {\n if (socketManager.set_rcvbuf_size(fd, rbufsz)) {\n rbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n if (send_bufsize) {\n if (socketManager.set_sndbuf_size(fd, send_bufsize)) {\n \/\/ Round down until success\n int sbufsz = ROUNDUP(send_bufsize, 1024);\n while (sbufsz) {\n if (socketManager.set_sndbuf_size(fd, sbufsz)) {\n sbufsz -= 1024;\n } else {\n break;\n }\n }\n }\n }\n#ifdef SET_CLOSE_ON_EXEC\n if ((res = safe_fcntl(fd, F_SETFD, 1)) < 0)\n goto Lerror;\n#endif\n\n#ifdef SET_NO_LINGER\n {\n struct linger l;\n l.l_onoff = 0;\n l.l_linger = 0;\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_LINGER, (char *) &l, sizeof(l))) < 0)\n goto Lerror;\n }\n#endif\n\n if (domain == AF_INET6 && (res = safe_setsockopt(fd, IPPROTO_IPV6, IPV6_V6ONLY, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_REUSEADDR, ON, sizeof(int))) < 0)\n goto Lerror;\n\n if ((res = socketManager.ink_bind(fd, (struct sockaddr *) &sa, addrlen, IPPROTO_TCP)) < 0) {\n goto Lerror;\n }\n#ifdef SET_TCP_NO_DELAY\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n#ifdef SET_SO_KEEPALIVE\n \/\/ enables 2 hour inactivity probes, also may fix IRIX FIN_WAIT_2 leak\n if ((res = safe_setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, ON, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n#if defined(linux)\n if (NetProcessor::accept_mss > 0)\n if ((res = safe_setsockopt(fd, IPPROTO_TCP, TCP_MAXSEG, (char *) &NetProcessor::accept_mss, sizeof(int))) < 0)\n goto Lerror;\n#endif\n\n if ((res = safe_listen(fd, get_listen_backlog())) < 0)\n goto Lerror;\n if (non_blocking)\n if ((res = safe_nonblocking(fd)) < 0)\n goto Lerror;\n if (!port_number) {\n int namelen = sizeof(sa);\n if ((res = safe_getsockname(fd, (struct sockaddr *) &sa, &namelen)))\n goto Lerror;\n }\n return 0;\n\nLerror:\n if (fd != NO_FD)\n close();\n Error(\"Could not bind or listen to port %d (error: %d)\", port_number, res);\n return res;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <iostream>\n#include <limits>\n\n#include <halide_image_io.h>\n#include <benchmark.h>\n\nenum InterpolationType {\n BOX, LINEAR, CUBIC, LANCZOS\n};\n\nExpr kernel_box(Expr x) {\n Expr xx = abs(x);\n return select(xx <= 0.5f, 1.0f, 0.0f);\n}\n\nExpr kernel_linear(Expr x) {\n Expr xx = abs(x);\n return select(xx < 1.0f, 1.0f - xx, 0.0f);\n}\n\nExpr kernel_cubic(Expr x) {\n Expr xx = abs(x);\n Expr xx2 = xx * xx;\n Expr xx3 = xx2 * xx;\n float a = -0.5f;\n\n return select(xx < 1.0f, (a + 2.0f) * xx3 - (a + 3.0f) * xx2 + 1,\n select (xx < 2.0f, a * xx3 - 5 * a * xx2 + 8 * a * xx - 4.0f * a,\n 0.0f));\n}\n\nExpr sinc(Expr x) {\n return sin(float(M_PI) * x) \/ x;\n}\n\nExpr kernel_lanczos(Expr x) {\n Expr value = sinc(x) * sinc(x\/3);\n value = select(x == 0.0f, 1.0f, value); \/\/ Take care of singularity at zero\n value = select(x > 3 || x < -3, 0.0f, value); \/\/ Clamp to zero out of bounds\n return value;\n}\n\nstruct KernelInfo {\n const char *name;\n float size;\n Expr (*kernel)(Expr);\n};\n\nstatic KernelInfo kernelInfo[] = {\n { \"box\", 0.5f, kernel_box },\n { \"linear\", 1.0f, kernel_linear },\n { \"cubic\", 2.0f, kernel_cubic },\n { \"lanczos\", 3.0f, kernel_lanczos }\n};\n\n\nstd::string infile, outfile;\nInterpolationType interpolationType = LINEAR;\nfloat scaleFactor = 1.0f;\nbool show_usage = false;\nint schedule = 0;\n\nvoid parse_commandline(int argc, char **argv) {\n for (int i = 1; i < argc; i++) {\n std::string arg = argv[i];\n if (arg == \"-f\" && i+1 < argc) {\n scaleFactor = atof(argv[++i]);\n } else if (arg == \"-s\" && i+1 < argc) {\n schedule = atoi(argv[++i]);\n if (schedule < 0 || schedule > 3) {\n fprintf(stderr, \"Invalid schedule\\n\");\n show_usage = true;\n }\n } else if (arg == \"-t\" && i+1 < argc) {\n arg = argv[++i];\n if (arg == \"box\") {\n interpolationType = BOX;\n } else if (arg == \"linear\") {\n interpolationType = LINEAR;\n } else if (arg == \"cubic\") {\n interpolationType = CUBIC;\n } else if (arg == \"lanczos\") {\n interpolationType = LANCZOS;\n } else {\n fprintf(stderr, \"Invalid interpolation type '%s' specified.\\n\",\n arg.c_str());\n show_usage = true;\n }\n } else if (infile.empty()) {\n infile = arg;\n } else if (outfile.empty()) {\n outfile = arg;\n } else {\n fprintf(stderr, \"Unexpected command line option '%s'.\\n\", arg.c_str());\n }\n }\n}\n\nint main(int argc, char **argv) {\n parse_commandline(argc, argv);\n if (infile.empty() || outfile.empty() || show_usage) {\n fprintf(stderr,\n \"Usage:\\n\"\n \"\\t.\/resample [-f scalefactor] [-s schedule] [-t box|linear|cubic|lanczos] in.png out.png\\n\"\n \"\\t\\tSchedules: 0=default 1=vectorized 2=parallel 3=vectorized+parallel\\n\");\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n Var x(\"x\"), y(\"y\"), c(\"c\"), k(\"k\");\n\n Func clamped = BoundaryConditions::repeat_edge(input);\n\n \/\/ For downscaling, widen the interpolation kernel to perform lowpass\n \/\/ filtering.\n float kernelScaling = std::min(scaleFactor, 1.0f);\n float kernelSize = kernelInfo[interpolationType].size \/ kernelScaling;\n\n \/\/ source[xy] are the (non-integer) coordinates inside the source image\n Expr sourcex = (x + 0.5f) \/ scaleFactor;\n Expr sourcey = (y + 0.5f) \/ scaleFactor;\n\n \/\/ Initialize interpolation kernels. Since we allow an arbitrary\n \/\/ scaling factor, the filter coefficients are different for each x\n \/\/ and y coordinate.\n Func kernelx(\"kernelx\"), kernely(\"kernely\");\n Expr beginx = cast<int>(sourcex - kernelSize + 0.5f);\n Expr beginy = cast<int>(sourcey - kernelSize + 0.5f);\n RDom domx(0, static_cast<int>(2.0f * kernelSize) + 1, \"domx\");\n RDom domy(0, static_cast<int>(2.0f * kernelSize) + 1, \"domy\");\n {\n const KernelInfo &info = kernelInfo[interpolationType];\n Func kx, ky;\n kx(x, k) = info.kernel((k + beginx - sourcex) * kernelScaling);\n ky(y, k) = info.kernel((k + beginy - sourcey) * kernelScaling);\n kernelx(x, k) = kx(x, k) \/ sum(kx(x, domx));\n kernely(y, k) = ky(y, k) \/ sum(ky(y, domy));\n }\n\n \/\/ Perform separable resizing\n Func resized_x(\"resized_x\");\n Func resized_y(\"resized_y\");\n resized_x(x, y, c) = sum(kernelx(x, domx) * cast<float>(clamped(domx + beginx, y, c)));\n resized_y(x, y, c) = sum(kernely(y, domy) * resized_x(x, domy + beginy, c));\n\n Func final(\"final\");\n final(x, y, c) = clamp(resized_y(x, y, c), 0.0f, 1.0f);\n\n std::cout << \"Finished function setup.\" << std::endl;\n\n \/\/ Scheduling\n bool parallelize = (schedule >= 2);\n bool vectorize = (schedule == 1 || schedule == 3);\n\n kernelx.compute_root();\n kernely.compute_at(final, y);\n\n if (vectorize) {\n resized_x.vectorize(x, 4);\n final.vectorize(x, 4);\n }\n\n if (parallelize) {\n Var yo, yi;\n final.split(y, yo, y, 32).parallel(yo);\n resized_x.store_at(final, yo).compute_at(final, y);\n } else {\n resized_x.store_at(final, c).compute_at(final, y);\n }\n\n Target target = get_jit_target_from_environment();\n final.compile_jit(target);\n\n printf(\"Loading '%s'\\n\", infile.c_str());\n Buffer<float> in_png = Tools::load_image(infile);\n int out_width = in_png.width() * scaleFactor;\n int out_height = in_png.height() * scaleFactor;\n Buffer<float> out(out_width, out_height, 3);\n input.set(in_png);\n printf(\"Resampling '%s' from %dx%d to %dx%d using %s interpolation\\n\",\n infile.c_str(),\n in_png.width(), in_png.height(),\n out_width, out_height,\n kernelInfo[interpolationType].name);\n\n double min = benchmark(10, 1, [&]() { final.realize(out); });\n std::cout << \" took min=\" << min * 1000 << \" msec.\" << std::endl;\n\n Tools::save_image(out, outfile);\n}\n<commit_msg>Fix includes & benchmark in apps\/resize<commit_after>#include \"Halide.h\"\n\nusing namespace Halide;\n\n#include <iostream>\n#include <limits>\n\n#include \"halide_image_io.h\"\n#include \"halide_benchmark.h\"\n\nenum InterpolationType {\n BOX, LINEAR, CUBIC, LANCZOS\n};\n\nExpr kernel_box(Expr x) {\n Expr xx = abs(x);\n return select(xx <= 0.5f, 1.0f, 0.0f);\n}\n\nExpr kernel_linear(Expr x) {\n Expr xx = abs(x);\n return select(xx < 1.0f, 1.0f - xx, 0.0f);\n}\n\nExpr kernel_cubic(Expr x) {\n Expr xx = abs(x);\n Expr xx2 = xx * xx;\n Expr xx3 = xx2 * xx;\n float a = -0.5f;\n\n return select(xx < 1.0f, (a + 2.0f) * xx3 - (a + 3.0f) * xx2 + 1,\n select (xx < 2.0f, a * xx3 - 5 * a * xx2 + 8 * a * xx - 4.0f * a,\n 0.0f));\n}\n\nExpr sinc(Expr x) {\n return sin(float(M_PI) * x) \/ x;\n}\n\nExpr kernel_lanczos(Expr x) {\n Expr value = sinc(x) * sinc(x\/3);\n value = select(x == 0.0f, 1.0f, value); \/\/ Take care of singularity at zero\n value = select(x > 3 || x < -3, 0.0f, value); \/\/ Clamp to zero out of bounds\n return value;\n}\n\nstruct KernelInfo {\n const char *name;\n float size;\n Expr (*kernel)(Expr);\n};\n\nstatic KernelInfo kernelInfo[] = {\n { \"box\", 0.5f, kernel_box },\n { \"linear\", 1.0f, kernel_linear },\n { \"cubic\", 2.0f, kernel_cubic },\n { \"lanczos\", 3.0f, kernel_lanczos }\n};\n\n\nstd::string infile, outfile;\nInterpolationType interpolationType = LINEAR;\nfloat scaleFactor = 1.0f;\nbool show_usage = false;\nint schedule = 0;\n\nvoid parse_commandline(int argc, char **argv) {\n for (int i = 1; i < argc; i++) {\n std::string arg = argv[i];\n if (arg == \"-f\" && i+1 < argc) {\n scaleFactor = atof(argv[++i]);\n } else if (arg == \"-s\" && i+1 < argc) {\n schedule = atoi(argv[++i]);\n if (schedule < 0 || schedule > 3) {\n fprintf(stderr, \"Invalid schedule\\n\");\n show_usage = true;\n }\n } else if (arg == \"-t\" && i+1 < argc) {\n arg = argv[++i];\n if (arg == \"box\") {\n interpolationType = BOX;\n } else if (arg == \"linear\") {\n interpolationType = LINEAR;\n } else if (arg == \"cubic\") {\n interpolationType = CUBIC;\n } else if (arg == \"lanczos\") {\n interpolationType = LANCZOS;\n } else {\n fprintf(stderr, \"Invalid interpolation type '%s' specified.\\n\",\n arg.c_str());\n show_usage = true;\n }\n } else if (infile.empty()) {\n infile = arg;\n } else if (outfile.empty()) {\n outfile = arg;\n } else {\n fprintf(stderr, \"Unexpected command line option '%s'.\\n\", arg.c_str());\n }\n }\n}\n\nint main(int argc, char **argv) {\n parse_commandline(argc, argv);\n if (infile.empty() || outfile.empty() || show_usage) {\n fprintf(stderr,\n \"Usage:\\n\"\n \"\\t.\/resample [-f scalefactor] [-s schedule] [-t box|linear|cubic|lanczos] in.png out.png\\n\"\n \"\\t\\tSchedules: 0=default 1=vectorized 2=parallel 3=vectorized+parallel\\n\");\n return 1;\n }\n\n ImageParam input(Float(32), 3);\n\n Var x(\"x\"), y(\"y\"), c(\"c\"), k(\"k\");\n\n Func clamped = BoundaryConditions::repeat_edge(input);\n\n \/\/ For downscaling, widen the interpolation kernel to perform lowpass\n \/\/ filtering.\n float kernelScaling = std::min(scaleFactor, 1.0f);\n float kernelSize = kernelInfo[interpolationType].size \/ kernelScaling;\n\n \/\/ source[xy] are the (non-integer) coordinates inside the source image\n Expr sourcex = (x + 0.5f) \/ scaleFactor;\n Expr sourcey = (y + 0.5f) \/ scaleFactor;\n\n \/\/ Initialize interpolation kernels. Since we allow an arbitrary\n \/\/ scaling factor, the filter coefficients are different for each x\n \/\/ and y coordinate.\n Func kernelx(\"kernelx\"), kernely(\"kernely\");\n Expr beginx = cast<int>(sourcex - kernelSize + 0.5f);\n Expr beginy = cast<int>(sourcey - kernelSize + 0.5f);\n RDom domx(0, static_cast<int>(2.0f * kernelSize) + 1, \"domx\");\n RDom domy(0, static_cast<int>(2.0f * kernelSize) + 1, \"domy\");\n {\n const KernelInfo &info = kernelInfo[interpolationType];\n Func kx, ky;\n kx(x, k) = info.kernel((k + beginx - sourcex) * kernelScaling);\n ky(y, k) = info.kernel((k + beginy - sourcey) * kernelScaling);\n kernelx(x, k) = kx(x, k) \/ sum(kx(x, domx));\n kernely(y, k) = ky(y, k) \/ sum(ky(y, domy));\n }\n\n \/\/ Perform separable resizing\n Func resized_x(\"resized_x\");\n Func resized_y(\"resized_y\");\n resized_x(x, y, c) = sum(kernelx(x, domx) * cast<float>(clamped(domx + beginx, y, c)));\n resized_y(x, y, c) = sum(kernely(y, domy) * resized_x(x, domy + beginy, c));\n\n Func final(\"final\");\n final(x, y, c) = clamp(resized_y(x, y, c), 0.0f, 1.0f);\n\n std::cout << \"Finished function setup.\" << std::endl;\n\n \/\/ Scheduling\n bool parallelize = (schedule >= 2);\n bool vectorize = (schedule == 1 || schedule == 3);\n\n kernelx.compute_root();\n kernely.compute_at(final, y);\n\n if (vectorize) {\n resized_x.vectorize(x, 4);\n final.vectorize(x, 4);\n }\n\n if (parallelize) {\n Var yo, yi;\n final.split(y, yo, y, 32).parallel(yo);\n resized_x.store_at(final, yo).compute_at(final, y);\n } else {\n resized_x.store_at(final, c).compute_at(final, y);\n }\n\n Target target = get_jit_target_from_environment();\n final.compile_jit(target);\n\n printf(\"Loading '%s'\\n\", infile.c_str());\n Buffer<float> in_png = Tools::load_image(infile);\n int out_width = in_png.width() * scaleFactor;\n int out_height = in_png.height() * scaleFactor;\n Buffer<float> out(out_width, out_height, 3);\n input.set(in_png);\n printf(\"Resampling '%s' from %dx%d to %dx%d using %s interpolation\\n\",\n infile.c_str(),\n in_png.width(), in_png.height(),\n out_width, out_height,\n kernelInfo[interpolationType].name);\n\n double min = Tools::benchmark(10, 1, [&]() { final.realize(out); });\n std::cout << \" took min=\" << min * 1000 << \" msec.\" << std::endl;\n\n Tools::save_image(out, outfile);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Implementation of a ACME client.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"GlueHttpClient.hxx\"\n#include \"event\/Loop.hxx\"\n#include \"curl\/Request.hxx\"\n#include \"curl\/Handler.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n\n#include <exception>\n\nGlueHttpServerAddress::GlueHttpServerAddress(bool ssl,\n const char *_host_and_port)\n :url(ssl ? \"https:\/\/\" : \"http:\/\/\")\n{\n url += _host_and_port;\n}\n\nGlueHttpClient::GlueHttpClient(EventLoop &event_loop)\n :curl_global(event_loop)\n{\n}\n\nGlueHttpClient::~GlueHttpClient()\n{\n}\n\nclass GlueHttpResponseHandler final : public CurlResponseHandler {\n http_status_t status;\n std::multimap<std::string, std::string> headers;\n\n std::string body_string;\n\n std::exception_ptr error;\n\n bool done = false;\n\npublic:\n bool IsDone() const {\n return done;\n }\n\n void CheckThrowError() {\n if (error)\n std::rethrow_exception(error);\n }\n\n GlueHttpResponse MoveResponse() {\n return {status, std::move(headers), std::move(body_string)};\n }\n\npublic:\n \/* virtual methods from class CurlResponseHandler *\/\n\n void OnHeaders(unsigned _status,\n std::multimap<std::string, std::string> &&_headers) override {\n status = http_status_t(_status);\n headers = std::move(_headers);\n }\n\n void OnData(ConstBuffer<void> data) override {\n body_string.append((const char *)data.data, data.size);\n }\n\n void OnEnd() override {\n done = true;\n }\n\n void OnError(std::exception_ptr e) override {\n error = std::move(e);\n done = true;\n }\n};\n\n\/**\n * A helper class which feeds a (foreign) memory buffer into the\n * CURLOPT_READFUNCTION.\n *\/\nclass CurlRequestBody {\n ConstBuffer<char> data;\n\npublic:\n explicit CurlRequestBody(ConstBuffer<void> _data)\n :data(ConstBuffer<char>::FromVoid(_data)) {}\n\n void Enable(CurlRequest &request) {\n request.SetOption(CURLOPT_READFUNCTION, Callback);\n request.SetOption(CURLOPT_READDATA, this);\n }\n\nprivate:\n size_t Read(char *buffer, size_t size) {\n size_t n = std::min(size, data.size);\n std::copy_n(data.begin(), n, buffer);\n data.skip_front(n);\n return n;\n }\n\n static size_t Callback(char *buffer, size_t size, size_t nitems,\n void *instream) {\n auto &rb = *(CurlRequestBody *)instream;\n return rb.Read(buffer, size * nitems);\n }\n};\n\nGlueHttpResponse\nGlueHttpClient::Request(EventLoop &event_loop,\n GlueHttpServerAddress &server,\n http_method_t method, const char *uri,\n ConstBuffer<void> _body)\n{\n std::string url = server.url + uri;\n\n GlueHttpResponseHandler handler;\n CurlRequest request(curl_global, url.c_str(), handler);\n\n if (method == HTTP_METHOD_HEAD)\n request.SetOption(CURLOPT_NOBODY, 1l);\n else if (method == HTTP_METHOD_POST)\n request.SetOption(CURLOPT_POST, 1l);\n\n CurlRequestBody body(_body);\n if (!_body.IsNull())\n body.Enable(request);\n\n request.Start();\n\n while (!handler.IsDone() && event_loop.LoopOnce()) {}\n\n handler.CheckThrowError();\n return handler.MoveResponse();\n}\n<commit_msg>certdb\/GlueHttpClient: use CURLOPT_POSTFIELDS instead of CURLOPT_READFUNCTION<commit_after>\/*\n * Implementation of a ACME client.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"GlueHttpClient.hxx\"\n#include \"event\/Loop.hxx\"\n#include \"curl\/Request.hxx\"\n#include \"curl\/Handler.hxx\"\n#include \"util\/ConstBuffer.hxx\"\n\n#include <exception>\n\nGlueHttpServerAddress::GlueHttpServerAddress(bool ssl,\n const char *_host_and_port)\n :url(ssl ? \"https:\/\/\" : \"http:\/\/\")\n{\n url += _host_and_port;\n}\n\nGlueHttpClient::GlueHttpClient(EventLoop &event_loop)\n :curl_global(event_loop)\n{\n}\n\nGlueHttpClient::~GlueHttpClient()\n{\n}\n\nclass GlueHttpResponseHandler final : public CurlResponseHandler {\n http_status_t status;\n std::multimap<std::string, std::string> headers;\n\n std::string body_string;\n\n std::exception_ptr error;\n\n bool done = false;\n\npublic:\n bool IsDone() const {\n return done;\n }\n\n void CheckThrowError() {\n if (error)\n std::rethrow_exception(error);\n }\n\n GlueHttpResponse MoveResponse() {\n return {status, std::move(headers), std::move(body_string)};\n }\n\npublic:\n \/* virtual methods from class CurlResponseHandler *\/\n\n void OnHeaders(unsigned _status,\n std::multimap<std::string, std::string> &&_headers) override {\n status = http_status_t(_status);\n headers = std::move(_headers);\n }\n\n void OnData(ConstBuffer<void> data) override {\n body_string.append((const char *)data.data, data.size);\n }\n\n void OnEnd() override {\n done = true;\n }\n\n void OnError(std::exception_ptr e) override {\n error = std::move(e);\n done = true;\n }\n};\n\nGlueHttpResponse\nGlueHttpClient::Request(EventLoop &event_loop,\n GlueHttpServerAddress &server,\n http_method_t method, const char *uri,\n ConstBuffer<void> body)\n{\n std::string url = server.url + uri;\n\n GlueHttpResponseHandler handler;\n CurlRequest request(curl_global, url.c_str(), handler);\n\n if (method == HTTP_METHOD_HEAD)\n request.SetOption(CURLOPT_NOBODY, 1l);\n else if (method == HTTP_METHOD_POST)\n request.SetOption(CURLOPT_POST, 1l);\n\n if (!body.IsNull()) {\n request.SetOption(CURLOPT_POSTFIELDS, (const char *)body.data);\n request.SetOption(CURLOPT_POSTFIELDSIZE, long(body.size));\n }\n\n request.Start();\n\n while (!handler.IsDone() && event_loop.LoopOnce()) {}\n\n handler.CheckThrowError();\n return handler.MoveResponse();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"sn_boundary.hpp\"\n\n#include <iostream>\n\nusing std::cout;\nusing std::endl;\n\nnamespace mocc {\n SnBoundary::SnBoundary( int n_group, const AngularQuadrature &ang_quad,\n const Mesh &mesh ):\n n_group_( n_group ),\n ang_quad_( ang_quad ),\n n_ang_( ang_quad.ndir() ),\n nx_( mesh.nx() ),\n ny_( mesh.ny() ),\n nz_( mesh.nz() ),\n ang_stride_( nx_*ny_ + nx_*nz_ + ny_*nz_ ),\n group_stride_( ang_stride_*n_ang_ ),\n bc_( mesh.boundary() ),\n data_( 0.0, group_stride_* n_group )\n {\n assert( n_group_ > 0 );\n n_face_[(int)Normal::X_NORM] = ny_*nz_;\n n_face_[(int)Normal::Y_NORM] = nx_*nz_;\n n_face_[(int)Normal::Z_NORM] = nx_*ny_;\n int offset = 0;\n for( const auto norm: AllNormals ) {\n face_offset_[(int)norm] = offset;\n offset += n_face_[(int)norm];\n }\n\n return;\n }\n\n void SnBoundary::update( size_t group, const SnBoundary &out ) {\n assert( group < n_group_ );\n assert( out.n_group() == 1 );\n\n \/\/ In the below, iang is the incoming angle index to be set, iang_refl\n \/\/ is the reflected angle from which a reflective BC should get its flux\n int iang = 0;\n for( auto &ang: ang_quad_ ) {\n Surface surf;\n Normal norm;\n int iang_refl;\n\n \/\/ X-normal surface\n norm = Normal::X_NORM;\n surf = (ang.ox > 0) ? Surface::WEST : Surface::EAST;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face( group, iang, norm, new_bc );\n } else {\n this->zero_face(group, iang, norm);\n }\n \/\/ Y-normal surface\n norm = Normal::Y_NORM;\n surf = (ang.oy > 0) ? Surface::SOUTH : Surface::NORTH;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face(group, iang, norm, new_bc);\n } else {\n this->zero_face(group, iang, norm);\n }\n \/\/ Z-normal surface\n norm = Normal::Z_NORM;\n surf = (ang.oz > 0) ? Surface::BOTTOM : Surface::TOP;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face(group, iang, norm, new_bc );\n } else {\n this->zero_face(group, iang, norm);\n }\n\n iang++;\n }\n return;\n }\n\n void SnBoundary::update( size_t group, size_t ang, const SnBoundary &out ) {\n Angle angle = ang_quad_[ang];\n Surface surf;\n Normal norm;\n int iang_refl = 0;\n\n \/\/\/ \\todo replace with a loop over AllNormal\n \/\/ X-normal surface\n norm = Normal::X_NORM;\n surf = (angle.ox > 0) ? Surface::WEST : Surface::EAST;\n iang_refl = ang_quad_.reflect( ang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, ang, norm );\n this->set_face( group, iang_refl, norm, new_bc );\n } else {\n this->zero_face(group, iang_refl, norm);\n }\n \/\/ Y-normal surface\n norm = Normal::Y_NORM;\n surf = (angle.oy > 0) ? Surface::SOUTH : Surface::NORTH;\n iang_refl = ang_quad_.reflect( ang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, ang, norm );\n this->set_face(group, iang_refl, norm, new_bc);\n } else {\n this->zero_face(group, iang_refl, norm);\n }\n \/\/ Z-normal surface\n norm = Normal::Z_NORM;\n surf = (angle.oz > 0) ? Surface::BOTTOM : Surface::TOP;\n iang_refl = ang_quad_.reflect( ang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, ang, norm );\n this->set_face(group, iang_refl, norm, new_bc );\n } else {\n this->zero_face(group, iang_refl, norm);\n }\n }\n\n std::ostream& operator<<(std::ostream& os, const SnBoundary &b ) {\n for( size_t ig=0; ig<b.n_group_; ig++ ) {\n cout << \"Group \" << ig << endl;\n for( size_t iang=0; iang<b.n_ang_; iang++ ) {\n cout << \"Angle \" << iang << endl;\n cout << \"X-Normal face:\" << endl;\n ArrayF f = b.get_face( ig, iang, Normal::X_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << \"Y-Normal face:\" << endl;\n f = b.get_face( ig, iang, Normal::Y_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << \"Z-Normal face:\" << endl;\n f = b.get_face( ig, iang, Normal::Z_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << endl;\n\n }\n }\n return os;\n }\n}\n<commit_msg>Fix and simplify GS Sn BC update<commit_after>#include \"sn_boundary.hpp\"\n\n#include <iostream>\n\nusing std::cout;\nusing std::endl;\n\nnamespace mocc {\n SnBoundary::SnBoundary( int n_group, const AngularQuadrature &ang_quad,\n const Mesh &mesh ):\n n_group_( n_group ),\n ang_quad_( ang_quad ),\n n_ang_( ang_quad.ndir() ),\n nx_( mesh.nx() ),\n ny_( mesh.ny() ),\n nz_( mesh.nz() ),\n ang_stride_( nx_*ny_ + nx_*nz_ + ny_*nz_ ),\n group_stride_( ang_stride_*n_ang_ ),\n bc_( mesh.boundary() ),\n data_( 0.0, group_stride_* n_group )\n {\n assert( n_group_ > 0 );\n n_face_[(int)Normal::X_NORM] = ny_*nz_;\n n_face_[(int)Normal::Y_NORM] = nx_*nz_;\n n_face_[(int)Normal::Z_NORM] = nx_*ny_;\n int offset = 0;\n for( const auto norm: AllNormals ) {\n face_offset_[(int)norm] = offset;\n offset += n_face_[(int)norm];\n }\n\n return;\n }\n\n void SnBoundary::update( size_t group, const SnBoundary &out ) {\n assert( group < n_group_ );\n assert( out.n_group() == 1 );\n\n \/\/ In the below, iang is the incoming angle index to be set, iang_refl\n \/\/ is the reflected angle from which a reflective BC should get its flux\n int iang = 0;\n for( auto &ang: ang_quad_ ) {\n Surface surf;\n Normal norm;\n int iang_refl;\n\n \/\/ X-normal surface\n norm = Normal::X_NORM;\n surf = (ang.ox > 0) ? Surface::WEST : Surface::EAST;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face( group, iang, norm, new_bc );\n } else {\n this->zero_face(group, iang, norm);\n }\n \/\/ Y-normal surface\n norm = Normal::Y_NORM;\n surf = (ang.oy > 0) ? Surface::SOUTH : Surface::NORTH;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face(group, iang, norm, new_bc);\n } else {\n this->zero_face(group, iang, norm);\n }\n \/\/ Z-normal surface\n norm = Normal::Z_NORM;\n surf = (ang.oz > 0) ? Surface::BOTTOM : Surface::TOP;\n iang_refl = ang_quad_.reflect( iang, norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, iang_refl, norm );\n this->set_face(group, iang, norm, new_bc );\n } else {\n this->zero_face(group, iang, norm);\n }\n\n iang++;\n }\n return;\n }\n\n void SnBoundary::update( size_t group, size_t ang, const SnBoundary &out ) {\n Surface surf;\n Normal norm;\n\n \/\/\/ \\todo Refactor to use Blitz arrays, avoid excess copies\n for( auto norm: AllNormals ) {\n int iang_refl = ang_quad_.reflect( ang, norm );\n Angle angle = ang_quad_[iang_refl];\n Surface surf = angle.upwind_surface( norm );\n if( bc_[(int)surf] == Boundary::REFLECT ) {\n auto new_bc = out.get_face( 0, ang, norm );\n this->set_face( group, iang_refl, norm, new_bc );\n } else {\n this->zero_face( group, iang_refl, norm );\n }\n }\n return;\n }\n\n std::ostream& operator<<(std::ostream& os, const SnBoundary &b ) {\n for( size_t ig=0; ig<b.n_group_; ig++ ) {\n cout << \"Group \" << ig << endl;\n for( size_t iang=0; iang<b.n_ang_; iang++ ) {\n cout << \"Angle \" << iang << endl;\n cout << \"X-Normal face:\" << endl;\n ArrayF f = b.get_face( ig, iang, Normal::X_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << \"Y-Normal face:\" << endl;\n f = b.get_face( ig, iang, Normal::Y_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << \"Z-Normal face:\" << endl;\n f = b.get_face( ig, iang, Normal::Z_NORM );\n for( auto v: f ) {\n cout << v << \" \";\n }\n cout << endl;\n cout << endl;\n\n }\n }\n return os;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"cefclient.h\"\n#include <stdio.h>\n#include <cstdlib>\n#include <sstream>\n#include <string>\n#include <errno.h>\n#include \"include\/cef_app.h\"\n#include \"include\/cef_browser.h\"\n#include \"include\/cef_command_line.h\"\n#include \"include\/cef_frame.h\"\n#include \"include\/cef_web_plugin.h\"\n#include \"include\/base\/cef_logging.h\"\n#include \"client_handler.h\"\n#include \"appshell\/common\/client_switches.h\"\n#include \"appshell\/appshell_helpers.h\"\n#include \"config.h\"\n\nCefRefPtr<ClientHandler> g_handler;\nint g_remote_debugging_port = 0;\n\n#ifdef OS_WIN\nbool g_force_enable_acc = false;\n#endif\n\nCefRefPtr<CefBrowser> AppGetBrowser() {\n if (!g_handler.get())\n return NULL;\n return g_handler->GetBrowser();\n}\n\nCefWindowHandle AppGetMainHwnd() {\n if (!g_handler.get())\n return NULL;\n return g_handler->GetMainHwnd();\n}\n\n\/\/ CefCommandLine::HasSwitch is unable to report the presense of switches,\n\/\/ in the command line properly. This is a generic function that could be\n\/\/ used to check for any particular switch, passed as a command line argument.\nbool HasSwitch(CefRefPtr<CefCommandLine> command_line , CefString& switch_name)\n{\n if (command_line) {\n ExtensionString cmdLine = command_line->GetCommandLineString();\n size_t idx = cmdLine.find(switch_name);\n return idx > 0 && idx < cmdLine.length();\n } else {\n return false;\n }\n}\n\n\/\/ Returns the application settings based on command line arguments.\nvoid AppGetSettings(CefSettings& settings, CefRefPtr<CefCommandLine> command_line) {\n DCHECK(command_line.get());\n if (!command_line.get())\n return;\n\n#if defined(OS_WIN)\n settings.multi_threaded_message_loop =\n command_line->HasSwitch(client::switches::kMultiThreadedMessageLoop);\n#endif\n\n CefString(&settings.cache_path) =\n command_line->GetSwitchValue(client::switches::kCachePath);\n CefString(&settings.log_file) =\n command_line->GetSwitchValue(client::switches::kLogFile);\n\n {\n std::string str = command_line->GetSwitchValue(client::switches::kLogSeverity);\n\n \/\/ Default to LOGSEVERITY_DISABLE\n settings.log_severity = LOGSEVERITY_DISABLE;\n\n if (!str.empty()) {\n if (str == client::switches::kLogSeverity_Verbose)\n settings.log_severity = LOGSEVERITY_VERBOSE;\n else if (str == client::switches::kLogSeverity_Info)\n settings.log_severity = LOGSEVERITY_INFO;\n else if (str == client::switches::kLogSeverity_Warning)\n settings.log_severity = LOGSEVERITY_WARNING;\n else if (str == client::switches::kLogSeverity_Error)\n settings.log_severity = LOGSEVERITY_ERROR;\n else if (str == client::switches::kLogSeverity_Disable)\n settings.log_severity = LOGSEVERITY_DISABLE;\n }\n }\n\n \/\/ Don't update the settings.locale with the locale that we detected from the OS.\n \/\/ Otherwise, CEF will use it to find the resources and when it fails in finding resources\n \/\/ for some locales that are not available in resources, it crashes.\n \/\/CefString(&settings.locale) = appshell::GetCurrentLanguage( );\n\n CefString(&settings.javascript_flags) =\n command_line->GetSwitchValue(client::switches::kJavascriptFlags);\n \n \/\/ Enable dev tools\n CefString debugger_port = command_line->GetSwitchValue(\"remote-debugging-port\");\n if (!debugger_port.empty()) {\n const long port = strtol(debugger_port.ToString().c_str(), NULL, 10);\n if (errno == ERANGE || port == 0) {\n LOG(ERROR) << \"Could not enable Remote debugging.\";\n LOG(ERROR) << \"Error while parsing remote-debugging-port arg: \"<< debugger_port.ToString();\n errno = 0;\n }\n else {\n static const long max_port_num = 65535;\n static const long max_reserved_port_num = 1024;\n if (port > max_reserved_port_num && port < max_port_num) {\n g_remote_debugging_port = static_cast<int>(port);\n settings.remote_debugging_port = g_remote_debugging_port;\n }\n else {\n LOG(ERROR) << \"Could not enable Remote debugging on port: \"<< port\n << \". Port number must be greater than \"<< max_reserved_port_num\n << \" and less than \" << max_port_num << \".\";\n }\n }\n }\n \n std::wstring versionStr = appshell::AppGetProductVersionString();\n \n if (!versionStr.empty()) {\n \/\/ Explicitly append the Chromium version to our own product version string\n \/\/ since assigning product version always replaces the Chromium version in\n \/\/ the User Agent string.\n versionStr.append(L\" \");\n versionStr.append(appshell::AppGetChromiumVersionString());\n \n \/\/ Set product version, which gets added to the User Agent string\n CefString(&settings.product_version) = versionStr;\n }\n\n#ifdef OS_WIN\n \/\/ We disable renderer accessibility by default as it is known to cause performance\n \/\/ issues. But if any one wants to enable it back, then we need to honor the flag.\n\n CefString force_acc_switch_name(\"--force-renderer-accessibility\");\n CefString enable_acc_switch_name(\"--enable-renderer-accessibility\");\n\n if (HasSwitch(command_line, force_acc_switch_name) || HasSwitch(command_line, enable_acc_switch_name))\n g_force_enable_acc = true;\n#endif\n\n}\n<commit_msg>Improved console error messages (#669)<commit_after>\/\/ Copyright (c) 2010 The Chromium Embedded Framework Authors. All rights\n\/\/ reserved. Use of this source code is governed by a BSD-style license that\n\/\/ can be found in the LICENSE file.\n\n#include \"cefclient.h\"\n#include <stdio.h>\n#include <cstdlib>\n#include <sstream>\n#include <string>\n#include <errno.h>\n#include \"include\/cef_app.h\"\n#include \"include\/cef_browser.h\"\n#include \"include\/cef_command_line.h\"\n#include \"include\/cef_frame.h\"\n#include \"include\/cef_web_plugin.h\"\n#include \"include\/base\/cef_logging.h\"\n#include \"client_handler.h\"\n#include \"appshell\/common\/client_switches.h\"\n#include \"appshell\/appshell_helpers.h\"\n#include \"config.h\"\n\nCefRefPtr<ClientHandler> g_handler;\nint g_remote_debugging_port = 0;\n\n#ifdef OS_WIN\nbool g_force_enable_acc = false;\n#endif\n\nCefRefPtr<CefBrowser> AppGetBrowser() {\n if (!g_handler.get())\n return NULL;\n return g_handler->GetBrowser();\n}\n\nCefWindowHandle AppGetMainHwnd() {\n if (!g_handler.get())\n return NULL;\n return g_handler->GetMainHwnd();\n}\n\n\/\/ CefCommandLine::HasSwitch is unable to report the presense of switches,\n\/\/ in the command line properly. This is a generic function that could be\n\/\/ used to check for any particular switch, passed as a command line argument.\nbool HasSwitch(CefRefPtr<CefCommandLine> command_line , CefString& switch_name)\n{\n if (command_line) {\n ExtensionString cmdLine = command_line->GetCommandLineString();\n size_t idx = cmdLine.find(switch_name);\n return idx > 0 && idx < cmdLine.length();\n } else {\n return false;\n }\n}\n\n\/\/ Returns the application settings based on command line arguments.\nvoid AppGetSettings(CefSettings& settings, CefRefPtr<CefCommandLine> command_line) {\n DCHECK(command_line.get());\n if (!command_line.get())\n return;\n\n#if defined(OS_WIN)\n settings.multi_threaded_message_loop =\n command_line->HasSwitch(client::switches::kMultiThreadedMessageLoop);\n#endif\n\n CefString(&settings.cache_path) =\n command_line->GetSwitchValue(client::switches::kCachePath);\n CefString(&settings.log_file) =\n command_line->GetSwitchValue(client::switches::kLogFile);\n\n {\n std::string str = command_line->GetSwitchValue(client::switches::kLogSeverity);\n\n \/\/ Default to LOGSEVERITY_DISABLE\n settings.log_severity = LOGSEVERITY_DISABLE;\n\n if (!str.empty()) {\n if (str == client::switches::kLogSeverity_Verbose)\n settings.log_severity = LOGSEVERITY_VERBOSE;\n else if (str == client::switches::kLogSeverity_Info)\n settings.log_severity = LOGSEVERITY_INFO;\n else if (str == client::switches::kLogSeverity_Warning)\n settings.log_severity = LOGSEVERITY_WARNING;\n else if (str == client::switches::kLogSeverity_Error)\n settings.log_severity = LOGSEVERITY_ERROR;\n else if (str == client::switches::kLogSeverity_Disable)\n settings.log_severity = LOGSEVERITY_DISABLE;\n }\n }\n\n \/\/ Don't update the settings.locale with the locale that we detected from the OS.\n \/\/ Otherwise, CEF will use it to find the resources and when it fails in finding resources\n \/\/ for some locales that are not available in resources, it crashes.\n \/\/CefString(&settings.locale) = appshell::GetCurrentLanguage( );\n\n CefString(&settings.javascript_flags) =\n command_line->GetSwitchValue(client::switches::kJavascriptFlags);\n \n \/\/ Enable dev tools\n CefString debugger_port = command_line->GetSwitchValue(\"remote-debugging-port\");\n if (!debugger_port.empty()) {\n const long port = strtol(debugger_port.ToString().c_str(), NULL, 10);\n if (errno == ERANGE || port == 0) {\n LOG(ERROR) << \"Could not enable remote debugging.\"\n << \" Error while parsing remote-debugging-port arg: \"<< debugger_port.ToString();\n errno = 0;\n }\n else {\n static const long max_port_num = 65534;\n static const long max_reserved_port_num = 1025;\n if (port >= max_reserved_port_num && port <= max_port_num) {\n g_remote_debugging_port = static_cast<int>(port);\n settings.remote_debugging_port = g_remote_debugging_port;\n }\n else {\n LOG(ERROR) << \"Cannot enable remote debugging on port \"<< port\n << \". Port numbers should be between \"<< max_reserved_port_num\n << \" and \" << max_port_num << \".\";\n }\n }\n }\n \n std::wstring versionStr = appshell::AppGetProductVersionString();\n \n if (!versionStr.empty()) {\n \/\/ Explicitly append the Chromium version to our own product version string\n \/\/ since assigning product version always replaces the Chromium version in\n \/\/ the User Agent string.\n versionStr.append(L\" \");\n versionStr.append(appshell::AppGetChromiumVersionString());\n \n \/\/ Set product version, which gets added to the User Agent string\n CefString(&settings.product_version) = versionStr;\n }\n\n#ifdef OS_WIN\n \/\/ We disable renderer accessibility by default as it is known to cause performance\n \/\/ issues. But if any one wants to enable it back, then we need to honor the flag.\n\n CefString force_acc_switch_name(\"--force-renderer-accessibility\");\n CefString enable_acc_switch_name(\"--enable-renderer-accessibility\");\n\n if (HasSwitch(command_line, force_acc_switch_name) || HasSwitch(command_line, enable_acc_switch_name))\n g_force_enable_acc = true;\n#endif\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Class for arangodb's graph features. Wrapper around the graph informations\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2015 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Michael Hackstein\n\/\/\/ @author Copyright 2014-2015, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Basics\/JsonHelper.h\"\n#include \"Aql\/Graphs.h\"\nusing namespace triagens::basics;\nusing namespace triagens::aql;\n\nchar const* Graph::_attrEdgeDefs = \"edgeDefinitions\";\nchar const* Graph::_attrOrphans = \"orphanCollections\";\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- Local utils\n\/\/ -----------------------------------------------------------------------------\n\nvoid Graph::insertVertexCollectionsFromJsonArray(triagens::basics::Json& arr) {\n for (size_t j = 0; j < arr.size(); ++j) {\n Json c = arr.at(j);\n TRI_ASSERT(c.isString());\n std::string name = JsonHelper::getStringValue(c.json(), \"\");\n addVertexCollection(name);\n }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- Graph Class\n\/\/ -----------------------------------------------------------------------------\n\nstd::unordered_set<std::string> const& Graph::vertexCollections () const {\n return _vertexColls;\n}\n\nstd::unordered_set<std::string> const& Graph::edgeCollections () const {\n return _edgeColls;\n}\n\nvoid Graph::addEdgeCollection (std::string name) {\n _edgeColls.insert(name);\n}\n\nvoid Graph::addVertexCollection (std::string name) {\n _vertexColls.insert(name);\n}\n\ntriagens::basics::Json Graph::toJson (TRI_memory_zone_t* z,\n bool verbose) const\n{\n triagens::basics::Json json(z, triagens::basics::Json::Object);\n\n if (_vertexColls.size() > 0) {\n triagens::basics::Json vcn(z, triagens::basics::Json::Array);\n for (auto cn : _vertexColls) {\n vcn.add(triagens::basics::Json(cn));\n }\n json(\"vertexCollectionNames\", vcn);\n }\n\n if (_edgeColls.size() > 0) {\n triagens::basics::Json ecn(z, triagens::basics::Json::Array);\n for (auto cn : _edgeColls) {\n ecn.add(triagens::basics::Json(cn));\n }\n json(\"edgeCollectionNames\", ecn);\n }\n\n return json;\n}\n\nGraph::Graph(triagens::basics::Json j) : \n _vertexColls(),\n _edgeColls()\n{\n auto jsonDef = j.get(_attrEdgeDefs);\n\n for (size_t i = 0; i < jsonDef.size(); ++i) {\n Json def = jsonDef.at(i);\n TRI_ASSERT(def.isObject());\n Json e = def.get(\"collection\");\n TRI_ASSERT(e.isString());\n std::string eCol = JsonHelper::getStringValue(e.json(), \"\");\n addEdgeCollection(eCol);\n e = def.get(\"from\");\n TRI_ASSERT(e.isArray());\n insertVertexCollectionsFromJsonArray(e);\n e = def.get(\"to\");\n TRI_ASSERT(e.isArray());\n insertVertexCollectionsFromJsonArray(e);\n }\n auto orphans = j.get(_attrOrphans);\n insertVertexCollectionsFromJsonArray(orphans);\n}\n\n<commit_msg>Indention fix<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief Class for arangodb's graph features. Wrapper around the graph informations\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014-2015 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Michael Hackstein\n\/\/\/ @author Copyright 2014-2015, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Basics\/JsonHelper.h\"\n#include \"Aql\/Graphs.h\"\nusing namespace triagens::basics;\nusing namespace triagens::aql;\n\nchar const* Graph::_attrEdgeDefs = \"edgeDefinitions\";\nchar const* Graph::_attrOrphans = \"orphanCollections\";\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- Local utils\n\/\/ -----------------------------------------------------------------------------\n\nvoid Graph::insertVertexCollectionsFromJsonArray(triagens::basics::Json& arr) {\n for (size_t j = 0; j < arr.size(); ++j) {\n Json c = arr.at(j);\n TRI_ASSERT(c.isString());\n std::string name = JsonHelper::getStringValue(c.json(), \"\");\n addVertexCollection(name);\n }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- Graph Class\n\/\/ -----------------------------------------------------------------------------\n\nstd::unordered_set<std::string> const& Graph::vertexCollections () const {\n return _vertexColls;\n}\n\nstd::unordered_set<std::string> const& Graph::edgeCollections () const {\n return _edgeColls;\n}\n\nvoid Graph::addEdgeCollection (std::string name) {\n _edgeColls.insert(name);\n}\n\nvoid Graph::addVertexCollection (std::string name) {\n _vertexColls.insert(name);\n}\n\ntriagens::basics::Json Graph::toJson (TRI_memory_zone_t* z,\n bool verbose) const {\n triagens::basics::Json json(z, triagens::basics::Json::Object);\n\n if (_vertexColls.size() > 0) {\n triagens::basics::Json vcn(z, triagens::basics::Json::Array);\n for (auto cn : _vertexColls) {\n vcn.add(triagens::basics::Json(cn));\n }\n json(\"vertexCollectionNames\", vcn);\n }\n\n if (_edgeColls.size() > 0) {\n triagens::basics::Json ecn(z, triagens::basics::Json::Array);\n for (auto cn : _edgeColls) {\n ecn.add(triagens::basics::Json(cn));\n }\n json(\"edgeCollectionNames\", ecn);\n }\n\n return json;\n}\n\nGraph::Graph(triagens::basics::Json j) : \n _vertexColls(),\n _edgeColls()\n{\n auto jsonDef = j.get(_attrEdgeDefs);\n\n for (size_t i = 0; i < jsonDef.size(); ++i) {\n Json def = jsonDef.at(i);\n TRI_ASSERT(def.isObject());\n Json e = def.get(\"collection\");\n TRI_ASSERT(e.isString());\n std::string eCol = JsonHelper::getStringValue(e.json(), \"\");\n addEdgeCollection(eCol);\n e = def.get(\"from\");\n TRI_ASSERT(e.isArray());\n insertVertexCollectionsFromJsonArray(e);\n e = def.get(\"to\");\n TRI_ASSERT(e.isArray());\n insertVertexCollectionsFromJsonArray(e);\n }\n auto orphans = j.get(_attrOrphans);\n insertVertexCollectionsFromJsonArray(orphans);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"common.h\"\n#include <istream>\n\n#define __STDC_LIMIT_MACROS\n#define __STDC_CONSTANT_MACROS\n#include \"llvm\/Support\/InstIterator.h\"\n\n#include \"Kernel.h\"\n#include \"Memory.h\"\n#include \"Device.h\"\n#include \"WorkGroup.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nDevice::Device()\n{\n m_globalMemory = new Memory();\n}\n\nDevice::~Device()\n{\n delete m_globalMemory;\n}\n\nMemory* Device::getGlobalMemory() const\n{\n return m_globalMemory;\n}\n\nvoid Device::run(const Kernel& kernel,\n const size_t ndrange[3], const size_t wgsize[3])\n{\n \/\/ Create work-groups\n size_t numGroups[3] = {ndrange[0]\/wgsize[0],\n ndrange[1]\/wgsize[1],\n ndrange[2]\/wgsize[2]};\n size_t totalNumGroups = numGroups[0]*numGroups[1]*numGroups[2];\n for (int k = 0; k < numGroups[2]; k++)\n {\n for (int j = 0; j < numGroups[1]; j++)\n {\n for (int i = 0; i < numGroups[0]; i++)\n {\n if (m_outputMask &\n (OUTPUT_INSTRUCTIONS | OUTPUT_PRIVATE_MEM | OUTPUT_LOCAL_MEM))\n {\n cout << endl << BIG_SEPARATOR << endl;\n cout << \"Work-group (\"\n << i << \",\"\n << j << \",\"\n << k\n << \")\" << endl;\n cout << BIG_SEPARATOR << endl;\n }\n\n WorkGroup *workGroup = new WorkGroup(kernel, *m_globalMemory,\n i, j, k, wgsize);\n\n workGroup->run(kernel, m_outputMask & OUTPUT_INSTRUCTIONS);\n\n \/\/ Dump contents of memories\n if (m_outputMask & OUTPUT_PRIVATE_MEM)\n {\n workGroup->dumpPrivateMemory();\n }\n if (m_outputMask & OUTPUT_LOCAL_MEM)\n {\n workGroup->dumpLocalMemory();\n }\n\n delete workGroup;\n }\n }\n }\n\n \/\/ Output global memory dump if required\n if (m_outputMask & OUTPUT_GLOBAL_MEM)\n {\n cout << endl << BIG_SEPARATOR << endl << \"Global Memory:\";\n m_globalMemory->dump();\n cout << BIG_SEPARATOR << endl;\n }\n}\n\nvoid Device::setOutputMask(unsigned char mask)\n{\n m_outputMask = mask;\n}\n<commit_msg>Initialize m_outputMask to 0 on Device creation.<commit_after>#include \"common.h\"\n#include <istream>\n\n#define __STDC_LIMIT_MACROS\n#define __STDC_CONSTANT_MACROS\n#include \"llvm\/Support\/InstIterator.h\"\n\n#include \"Kernel.h\"\n#include \"Memory.h\"\n#include \"Device.h\"\n#include \"WorkGroup.h\"\n\nusing namespace spirsim;\nusing namespace std;\n\nDevice::Device()\n{\n m_globalMemory = new Memory();\n m_outputMask = 0;\n}\n\nDevice::~Device()\n{\n delete m_globalMemory;\n}\n\nMemory* Device::getGlobalMemory() const\n{\n return m_globalMemory;\n}\n\nvoid Device::run(const Kernel& kernel,\n const size_t ndrange[3], const size_t wgsize[3])\n{\n \/\/ Create work-groups\n size_t numGroups[3] = {ndrange[0]\/wgsize[0],\n ndrange[1]\/wgsize[1],\n ndrange[2]\/wgsize[2]};\n size_t totalNumGroups = numGroups[0]*numGroups[1]*numGroups[2];\n for (int k = 0; k < numGroups[2]; k++)\n {\n for (int j = 0; j < numGroups[1]; j++)\n {\n for (int i = 0; i < numGroups[0]; i++)\n {\n if (m_outputMask &\n (OUTPUT_INSTRUCTIONS | OUTPUT_PRIVATE_MEM | OUTPUT_LOCAL_MEM))\n {\n cout << endl << BIG_SEPARATOR << endl;\n cout << \"Work-group (\"\n << i << \",\"\n << j << \",\"\n << k\n << \")\" << endl;\n cout << BIG_SEPARATOR << endl;\n }\n\n WorkGroup *workGroup = new WorkGroup(kernel, *m_globalMemory,\n i, j, k, wgsize);\n\n workGroup->run(kernel, m_outputMask & OUTPUT_INSTRUCTIONS);\n\n \/\/ Dump contents of memories\n if (m_outputMask & OUTPUT_PRIVATE_MEM)\n {\n workGroup->dumpPrivateMemory();\n }\n if (m_outputMask & OUTPUT_LOCAL_MEM)\n {\n workGroup->dumpLocalMemory();\n }\n\n delete workGroup;\n }\n }\n }\n\n \/\/ Output global memory dump if required\n if (m_outputMask & OUTPUT_GLOBAL_MEM)\n {\n cout << endl << BIG_SEPARATOR << endl << \"Global Memory:\";\n m_globalMemory->dump();\n cout << BIG_SEPARATOR << endl;\n }\n}\n\nvoid Device::setOutputMask(unsigned char mask)\n{\n m_outputMask = mask;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"myFunctions.h\"\n#include <iostream>\n#include <fstream>\n#include <string>\nusing namespace std;\n\nvoid printTitle(ostream &os) { \/\/ DONE\n\tcout\n\t\t<< \"\\n\\t This is a lab on completely filled arrays \"\n\t\t<< \"\\n\\t By J. Guerra \";\n}\n\nvoid load5(int a[], int n) { \/\/ DONE\n\tfor (int i = 0; i < n; i++)\n\t\ta[i] = 5;\n}\n\n\nvoid printArr(const int a[], int n, int epl, ostream &os) { \/\/ DONE\n\tfor (int i = 0; i < n; i++)\n\t\tos << a[i] << (i % epl == epl - 1 || i == n - 1 ? \"\\n\" : \"\\t\");\n}\n\nchar getYorN() {\n\tchar c;\n\n\tcin >> c;\tcin.ignore(80, '\\n');\n\n\twhile (c != 'Y' && c != 'y' && c != 'N' && c != 'n') {\n\t\tcout << \"Please type Y or N. Try again: \";\n\t\tcin >> c;\t\tcin.ignore(80, '\\n');\n\t}\n\n\treturn (c == 'y' ? 'Y' : c == 'n' ? 'N' : c);\t\/\/ returns only capitals\n}\n\nstring getFileName() {\n\tstring filename;\n\t\n\tgetline(cin >> ws, filename);\n\n\treturn filename;\n}<commit_msg>get output file<commit_after>#include \"myFunctions.h\"\n#include <iostream>\n#include <fstream>\n#include <string>\nusing namespace std;\n\nvoid printTitle(ostream &os) { \/\/ DONE\n\tcout\n\t\t<< \"\\n\\t This is a lab on completely filled arrays \"\n\t\t<< \"\\n\\t By J. Guerra \";\n}\n\nvoid load5(int a[], int n) { \/\/ DONE\n\tfor (int i = 0; i < n; i++)\n\t\ta[i] = 5;\n}\n\nvoid loadEven(int a[], int n) {\n\tfor (int i = 0; i < n; i++)\n\t\ta[i] = (i + 1) * 2;\n}\n\nvoid loadOdd(int a[], int n) {\n\tfor (int i = 0; i < n; i++)\n\t\ta[i] = i * 2 + 1;\n}\n\nvoid loadSq(int a[], int n) {\n\tfor (int i = 0; i < n; i++)\n\t\ta[i] = (i + 1) * (i + 1);\n}\n\n\/\/ Pre Condition: n is the size of the array\n\/\/ Post Condition: Loads the array with the first n consecutive prime numbers\nvoid loadPrime(int a[], int n) {\n\tint currentNum = 2;\n\tfor (int i = 0; i < n; i++) {\n\t\twhile (!isPrime(currentNum))\n\t\t\tcurrentNum++;\n\t\ta[i] = currentNum;\n\t\tcurrentNum++;\n\t}\n}\n\nbool isPrime(int x){ \/\/ DONE\n\tfor (int i = 2; i * i <= x; i++)\n\t\tif (x % i == 0)\n\t\t\treturn false;\n\treturn true;\n}\n\nvoid printArr(const int a[], int n, int epl, ostream &os) { \/\/ DONE\n\tfor (int i = 0; i < n; i++)\n\t\tos << a[i] << (i % epl == epl - 1 || i == n - 1 ? \"\\n\" : \"\\t\");\n}\n\nchar getYorN() {\n\tchar c;\n\n\tcin >> c;\tcin.ignore(80, '\\n');\n\n\twhile (c != 'Y' && c != 'y' && c != 'N' && c != 'n') {\n\t\tcout << \"Please type Y or N. Try again: \";\n\t\tcin >> c;\t\tcin.ignore(80, '\\n');\n\t}\n\n\treturn (c == 'y' ? 'Y' : c == 'n' ? 'N' : c);\t\/\/ returns only capitals\n}\n\nstring connectFileStream() {\n\tstring filename;\n\tofstream ofs;\n\t\n\tgetline(cin >> ws, filename);\n\tofs.open(filename);\n\n\twhile (ofs.fail()) {\n\t\tcout << \"Unable to open file. Try again: \";\n\t\tgetline(cin >> ws, filename);\n\t\tofs.open(filename);\n\t}\n\n\tofs.close();\n\n\treturn filename;\n}<|endoftext|>"} {"text":"<commit_before>#ifndef __STAN__IO__WRITER_HPP__\n#define __STAN__IO__WRITER_HPP__\n\n#include <cstddef>\n#include <stdexcept>\n#include <vector>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <stan\/math\/matrix.hpp>\n#include <stan\/math\/special_functions.hpp>\n\n#include <stan\/prob\/transform.hpp>\n\nnamespace stan {\n\n namespace io {\n\n \/**\n * A stream-based writer for integer, scalar, vector, matrix\n * and array data types, which transforms from constrained to\n * a sequence of constrained variables. \n *\n * <p>This class converts constrained values to unconstrained\n * values with mappings that invert those defined in\n * <code>stan::io::reader<\/code> to convert unconstrained values\n * to constrained values.\n *\n * @tparam T Basic scalar type.\n *\/\n template <typename T>\n class writer {\n private:\n std::vector<T> data_r_;\n std::vector<int> data_i_;\n public:\n\n typedef typename stan::math::EigenType<T>::matrix matrix_t;\n typedef typename stan::math::EigenType<T>::vector vector_t;\n typedef typename stan::math::EigenType<T>::row_vector row_vector_t;\n \n typedef Eigen::Array<T,Eigen::Dynamic,1> array_vec_t;\n\n \/**\n * This is the tolerance for checking arithmetic bounds\n * in rank and in simplexes. The current value is <code>1E-8<\/code>.\n *\/\n const double CONSTRAINT_TOLERANCE;\n\n \/**\n * Construct a writer that writes to the specified\n * scalar and integer vectors.\n *\n * @param data_r Scalar values.\n * @param data_i Integer values.\n *\/\n writer(std::vector<T>& data_r,\n std::vector<int>& data_i)\n : data_r_(data_r),\n data_i_(data_i),\n CONSTRAINT_TOLERANCE(1E-8) {\n }\n\n \/**\n * Destroy this writer.\n *\/\n ~writer() { }\n\n \/**\n * Return a reference to the underlying vector of real values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<T>& data_r() {\n return &data_r_;\n }\n\n\n \/**\n * Return a reference to the underlying vector of integer values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<int>& data_i() {\n return &data_i_;\n }\n\n \/**\n * Write the specified integer to the sequence of integer values.\n *\n * @param n Integer to write.\n *\/\n void integer(int n) {\n data_i_.push_back(n);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * scalar. Here, the unconstrain operation is a no-op, which\n * matches <code>reader::scalar_constrain()<\/code>.\n *\n * @param y The value.\n *\/\n void scalar_unconstrain(T& y) {\n data_r_.push_back(y);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * positive-constrained scalar. The transformation applied is\n * <code>log(y)<\/code>, which is the inverse of constraining\n * transform specified in <code>reader::scalar_pos_constrain()<\/code>.\n *\n * <p>This method will fail if the argument is not non-negative.\n *\n * @param y The positive value.\n * @throw std::runtime_error if y is negative.\n *\/\n void scalar_pos_unconstrain(T& y) {\n if (y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is negative\"));\n data_r_.push_back(log(y));\n }\n\n \/**\n * Return the unconstrained version of the specified input,\n * which is constrained to be above the specified lower bound.\n * The unconstraining transform is <code>log(y - lb)<\/code>, which \n * inverts the constraining\n * transform defined in <code>reader::scalar_lb_constrain(double)<\/code>,\n *\n * @param lb Lower bound.\n * @param y Lower-bounded value.\n * @throw std::runtime_error if y is lower than the lower bound provided.\n *\/\n void scalar_lb_unconstrain(double lb, T& y) {\n if (y < lb)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is lower than the lower bound\"));\n data_r_.push_back(log(y - lb));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * lower-bounded value. The unconstraining transform is\n * <code>log(ub - y)<\/code>, which reverses the constraining\n * transform defined in <code>reader::scalar_ub_constrain(double)<\/code>.\n *\n * @param ub Upper bound.\n * @param y Constrained value.\n * @throw std::runtime_error if y is higher than the upper bound provided.\n *\/\n void scalar_ub_unconstrain(double ub, T& y) {\n if (y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is higher than the lower bound\"));\n data_r_.push_back(log(ub - y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * value with the specified bounds. The unconstraining\n * transform is given by <code>reader::logit((y-L)\/(U-L))<\/code>, which\n * inverts the constraining transform defined in\n * <code>scalar_lub_constrain(double,double)<\/code>.\n *\n * @param lb Lower bound.\n * @param ub Upper bound.\n * @param y Bounded value.\n * @throw std::runtime_error if y is not between the lower and upper bounds\n *\/\n void scalar_lub_unconstrain(double lb, double ub, T& y) {\n if (y < lb || y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between the lower and upper bounds\"));\n data_r_.push_back(stan::math::logit((y - lb) \/ (ub - lb)));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * correlation-constrained variable.\n *\n * <p>The unconstraining transform is <code>atanh(y)<\/code>, which\n * reverses the transfrom in <code>corr_constrain()<\/code>.\n *\n * @param y Correlation value.\n * @throw std::runtime_error if y is not between -1.0 and 1.0\n *\/\n void corr_unconstrain(T& y) {\n if (y > 1.0 || y < -1.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between -1.0 and 1.0\"));\n data_r_.push_back(atanh(y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the\n * specified probability value.\n *\n * <p>The unconstraining transform is <code>logit(y)<\/code>,\n * which inverts the constraining transform defined in\n * <code>prob_constrain()<\/code>.\n *\n * @param y Probability value.\n * @throw std::runtime_error if y is not between 0.0 and 1.0\n *\/\n void prob_unconstrain(T& y) {\n if (y > 1.0 || y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between 0.0 and 1.0\"));\n data_r_.push_back(stan::math::logit(y));\n }\n\n \/**\n * Write the unconstrained vector that corresponds to the specified\n * positive ordered vector.\n * \n * <p>The unconstraining transform is defined for input vector <code>y<\/code>\n * to produce an output vector <code>x<\/code> of the same size, defined\n * by <code>x[0] = log(y[0])<\/code> and by\n * <code>x[k] = log(y[k] - y[k-1])<\/code> for <code>k > 0<\/code>. This\n * unconstraining transform inverts the constraining transform specified\n * in <code>pos_ordered_constrain(size_t)<\/code>.\n *\n * @param y Positive, ordered vector.\n * @return Unconstrained vector corresponding to the specified vector.\n * @throw std::runtime_error if vector is not positive ordered\n *\/\n void pos_ordered_unconstrain(vector_t& y) {\n if (y.size() == 0) return;\n stan::math::check_pos_ordered(\"stan::io::pos_ordered_unconstrain(%1%)\", y, \"y\");\n data_r_.push_back(log(y[0]));\n for (typename vector_t::size_type i = 1; i < y.size(); ++i) {\n data_r_.push_back(log(y[i] - y[i-1]));\n }\n }\n\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void row_vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained matrix.\n *\n * @param y Matrix to write.\n *\/\n void matrix_unconstrain(const matrix_t& y) {\n for (size_t i = 0; i < y.rows(); ++i)\n for (size_t j = 0; j < y.cols(); ++j) \n data_r_.push_back(y(i,j));\n }\n\n \n\n \/**\n * Write the unconstrained vector corresponding to the specified simplex \n * value. If the specified constrained simplex is of size <code>K<\/code>,\n * the returned unconstrained vector is of size <code>K-1<\/code>.\n *\n * <p>The transform takes <code>y = y[1],...,y[K]<\/code> and\n * produces the unconstrained vector <code>x = log(y[1]) -\n * log(y[K]), ..., log(y[K-1]) - log(y[K])<\/code>. This inverts\n * the constraining transform of\n * <code>simplex_constrain(size_t)<\/code>.\n *\n * @param y Simplex constrained value.\n * @return Unconstrained value.\n * @throw std::runtime_error if the vector is not a simplex.\n *\/\n void simplex_unconstrain(vector_t& y) {\n stan::math::check_simplex(\"stan::io::simplex_unconstrain(%1%)\", y, \"y\");\n typename vector_t::size_type k_minus_1 = y.size() - 1;\n double log_y_k = log(y[k_minus_1]);\n for (typename vector_t::size_type i = 0; i < k_minus_1; ++i) {\n data_r_.push_back(log(y[i]) - log_y_k);\n }\n }\n\n \/**\n * Writes the unconstrained correlation matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>corr_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained correlation matrix.\n * @throw std::runtime_error if the correlation matrix has no elements or\n * is not a square matrix.\n * @throw std::runtime_error if the correlation matrix cannot be factorized\n * by factor_cov_matrix() or if the sds returned by factor_cov_matrix()\n * on log scale are unconstrained.\n *\/\n void corr_matrix_unconstrain(matrix_t& y) {\n stan::math::check_corr_matrix(\"stan::io::corr_matrix_unconstrain(%1%)\", y, \"y\");\n size_t k = y.rows();\n size_t k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if (!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y cannot be factorized by factor_cov_matrix\"));\n for (size_t i = 0; i < k; ++i) {\n \/\/ sds on log scale unconstrained\n if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"sds on log scale are unconstrained\"));\n }\n for (size_t i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n }\n\n \/**\n * Writes the unconstrained covariance matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>cov_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained covariance matrix.\n * @throw std::runtime_error if y has no elements or if it is not square\n *\/\n void cov_matrix_unconstrain(matrix_t& y) {\n typename matrix_t::size_type k = y.rows();\n if (k == 0 || y.cols() != k)\n BOOST_THROW_EXCEPTION(\n std::runtime_error (\"y must have elements and y must be a square matrix\"));\n typename matrix_t::size_type k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if(!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"factor_cov_matrix failed\"));\n for (typename matrix_t::size_type i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n for (typename matrix_t::size_type i = 0; i < k; ++i)\n data_r_.push_back(sds[i]);\n }\n };\n }\n\n}\n\n#endif\n<commit_msg>fixed writer reference return issue<commit_after>#ifndef __STAN__IO__WRITER_HPP__\n#define __STAN__IO__WRITER_HPP__\n\n#include <cstddef>\n#include <stdexcept>\n#include <vector>\n\n#include <boost\/multi_array.hpp>\n#include <boost\/throw_exception.hpp>\n\n#include <stan\/math\/matrix.hpp>\n#include <stan\/math\/special_functions.hpp>\n\n#include <stan\/prob\/transform.hpp>\n\nnamespace stan {\n\n namespace io {\n\n \/**\n * A stream-based writer for integer, scalar, vector, matrix\n * and array data types, which transforms from constrained to\n * a sequence of constrained variables. \n *\n * <p>This class converts constrained values to unconstrained\n * values with mappings that invert those defined in\n * <code>stan::io::reader<\/code> to convert unconstrained values\n * to constrained values.\n *\n * @tparam T Basic scalar type.\n *\/\n template <typename T>\n class writer {\n private:\n std::vector<T> data_r_;\n std::vector<int> data_i_;\n public:\n\n typedef typename stan::math::EigenType<T>::matrix matrix_t;\n typedef typename stan::math::EigenType<T>::vector vector_t;\n typedef typename stan::math::EigenType<T>::row_vector row_vector_t;\n \n typedef Eigen::Array<T,Eigen::Dynamic,1> array_vec_t;\n\n \/**\n * This is the tolerance for checking arithmetic bounds\n * in rank and in simplexes. The current value is <code>1E-8<\/code>.\n *\/\n const double CONSTRAINT_TOLERANCE;\n\n \/**\n * Construct a writer that writes to the specified\n * scalar and integer vectors.\n *\n * @param data_r Scalar values.\n * @param data_i Integer values.\n *\/\n writer(std::vector<T>& data_r,\n std::vector<int>& data_i)\n : data_r_(data_r),\n data_i_(data_i),\n CONSTRAINT_TOLERANCE(1E-8) {\n }\n\n \/**\n * Destroy this writer.\n *\/\n ~writer() { }\n\n \/**\n * Return a reference to the underlying vector of real values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<T>& data_r() {\n return data_r_;\n }\n\n\n \/**\n * Return a reference to the underlying vector of integer values\n * that have been written.\n *\n * @return Values that have been written.\n *\/\n std::vector<int>& data_i() {\n return data_i_;\n }\n\n \/**\n * Write the specified integer to the sequence of integer values.\n *\n * @param n Integer to write.\n *\/\n void integer(int n) {\n data_i_.push_back(n);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * scalar. Here, the unconstrain operation is a no-op, which\n * matches <code>reader::scalar_constrain()<\/code>.\n *\n * @param y The value.\n *\/\n void scalar_unconstrain(T& y) {\n data_r_.push_back(y);\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * positive-constrained scalar. The transformation applied is\n * <code>log(y)<\/code>, which is the inverse of constraining\n * transform specified in <code>reader::scalar_pos_constrain()<\/code>.\n *\n * <p>This method will fail if the argument is not non-negative.\n *\n * @param y The positive value.\n * @throw std::runtime_error if y is negative.\n *\/\n void scalar_pos_unconstrain(T& y) {\n if (y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is negative\"));\n data_r_.push_back(log(y));\n }\n\n \/**\n * Return the unconstrained version of the specified input,\n * which is constrained to be above the specified lower bound.\n * The unconstraining transform is <code>log(y - lb)<\/code>, which \n * inverts the constraining\n * transform defined in <code>reader::scalar_lb_constrain(double)<\/code>,\n *\n * @param lb Lower bound.\n * @param y Lower-bounded value.\n * @throw std::runtime_error if y is lower than the lower bound provided.\n *\/\n void scalar_lb_unconstrain(double lb, T& y) {\n if (y < lb)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is lower than the lower bound\"));\n data_r_.push_back(log(y - lb));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * lower-bounded value. The unconstraining transform is\n * <code>log(ub - y)<\/code>, which reverses the constraining\n * transform defined in <code>reader::scalar_ub_constrain(double)<\/code>.\n *\n * @param ub Upper bound.\n * @param y Constrained value.\n * @throw std::runtime_error if y is higher than the upper bound provided.\n *\/\n void scalar_ub_unconstrain(double ub, T& y) {\n if (y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is higher than the lower bound\"));\n data_r_.push_back(log(ub - y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * value with the specified bounds. The unconstraining\n * transform is given by <code>reader::logit((y-L)\/(U-L))<\/code>, which\n * inverts the constraining transform defined in\n * <code>scalar_lub_constrain(double,double)<\/code>.\n *\n * @param lb Lower bound.\n * @param ub Upper bound.\n * @param y Bounded value.\n * @throw std::runtime_error if y is not between the lower and upper bounds\n *\/\n void scalar_lub_unconstrain(double lb, double ub, T& y) {\n if (y < lb || y > ub)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between the lower and upper bounds\"));\n data_r_.push_back(stan::math::logit((y - lb) \/ (ub - lb)));\n }\n\n \/**\n * Write the unconstrained value corresponding to the specified\n * correlation-constrained variable.\n *\n * <p>The unconstraining transform is <code>atanh(y)<\/code>, which\n * reverses the transfrom in <code>corr_constrain()<\/code>.\n *\n * @param y Correlation value.\n * @throw std::runtime_error if y is not between -1.0 and 1.0\n *\/\n void corr_unconstrain(T& y) {\n if (y > 1.0 || y < -1.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between -1.0 and 1.0\"));\n data_r_.push_back(atanh(y));\n }\n\n \/**\n * Write the unconstrained value corresponding to the\n * specified probability value.\n *\n * <p>The unconstraining transform is <code>logit(y)<\/code>,\n * which inverts the constraining transform defined in\n * <code>prob_constrain()<\/code>.\n *\n * @param y Probability value.\n * @throw std::runtime_error if y is not between 0.0 and 1.0\n *\/\n void prob_unconstrain(T& y) {\n if (y > 1.0 || y < 0.0)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y is not between 0.0 and 1.0\"));\n data_r_.push_back(stan::math::logit(y));\n }\n\n \/**\n * Write the unconstrained vector that corresponds to the specified\n * positive ordered vector.\n * \n * <p>The unconstraining transform is defined for input vector <code>y<\/code>\n * to produce an output vector <code>x<\/code> of the same size, defined\n * by <code>x[0] = log(y[0])<\/code> and by\n * <code>x[k] = log(y[k] - y[k-1])<\/code> for <code>k > 0<\/code>. This\n * unconstraining transform inverts the constraining transform specified\n * in <code>pos_ordered_constrain(size_t)<\/code>.\n *\n * @param y Positive, ordered vector.\n * @return Unconstrained vector corresponding to the specified vector.\n * @throw std::runtime_error if vector is not positive ordered\n *\/\n void pos_ordered_unconstrain(vector_t& y) {\n if (y.size() == 0) return;\n stan::math::check_pos_ordered(\"stan::io::pos_ordered_unconstrain(%1%)\", y, \"y\");\n data_r_.push_back(log(y[0]));\n for (typename vector_t::size_type i = 1; i < y.size(); ++i) {\n data_r_.push_back(log(y[i] - y[i-1]));\n }\n }\n\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained vector.\n * \n * @param y Vector to write.\n *\/\n void row_vector_unconstrain(const vector_t& y) {\n for (size_t i = 0; i < y.size(); ++i)\n data_r_.push_back(y[i]);\n }\n\n \/**\n * Write the specified unconstrained matrix.\n *\n * @param y Matrix to write.\n *\/\n void matrix_unconstrain(const matrix_t& y) {\n for (size_t i = 0; i < y.rows(); ++i)\n for (size_t j = 0; j < y.cols(); ++j) \n data_r_.push_back(y(i,j));\n }\n\n \n\n \/**\n * Write the unconstrained vector corresponding to the specified simplex \n * value. If the specified constrained simplex is of size <code>K<\/code>,\n * the returned unconstrained vector is of size <code>K-1<\/code>.\n *\n * <p>The transform takes <code>y = y[1],...,y[K]<\/code> and\n * produces the unconstrained vector <code>x = log(y[1]) -\n * log(y[K]), ..., log(y[K-1]) - log(y[K])<\/code>. This inverts\n * the constraining transform of\n * <code>simplex_constrain(size_t)<\/code>.\n *\n * @param y Simplex constrained value.\n * @return Unconstrained value.\n * @throw std::runtime_error if the vector is not a simplex.\n *\/\n void simplex_unconstrain(vector_t& y) {\n stan::math::check_simplex(\"stan::io::simplex_unconstrain(%1%)\", y, \"y\");\n typename vector_t::size_type k_minus_1 = y.size() - 1;\n double log_y_k = log(y[k_minus_1]);\n for (typename vector_t::size_type i = 0; i < k_minus_1; ++i) {\n data_r_.push_back(log(y[i]) - log_y_k);\n }\n }\n\n \/**\n * Writes the unconstrained correlation matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>corr_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained correlation matrix.\n * @throw std::runtime_error if the correlation matrix has no elements or\n * is not a square matrix.\n * @throw std::runtime_error if the correlation matrix cannot be factorized\n * by factor_cov_matrix() or if the sds returned by factor_cov_matrix()\n * on log scale are unconstrained.\n *\/\n void corr_matrix_unconstrain(matrix_t& y) {\n stan::math::check_corr_matrix(\"stan::io::corr_matrix_unconstrain(%1%)\", y, \"y\");\n size_t k = y.rows();\n size_t k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if (!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"y cannot be factorized by factor_cov_matrix\"));\n for (size_t i = 0; i < k; ++i) {\n \/\/ sds on log scale unconstrained\n if (fabs(sds[i] - 0.0) >= CONSTRAINT_TOLERANCE)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"sds on log scale are unconstrained\"));\n }\n for (size_t i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n }\n\n \/**\n * Writes the unconstrained covariance matrix corresponding\n * to the specified constrained correlation matrix.\n *\n * <p>The unconstraining operation is the inverse of the\n * constraining operation in\n * <code>cov_matrix_constrain(Matrix<T,Dynamic,Dynamic)<\/code>.\n *\n * @param y Constrained covariance matrix.\n * @throw std::runtime_error if y has no elements or if it is not square\n *\/\n void cov_matrix_unconstrain(matrix_t& y) {\n typename matrix_t::size_type k = y.rows();\n if (k == 0 || y.cols() != k)\n BOOST_THROW_EXCEPTION(\n std::runtime_error (\"y must have elements and y must be a square matrix\"));\n typename matrix_t::size_type k_choose_2 = (k * (k-1)) \/ 2;\n array_vec_t cpcs(k_choose_2);\n array_vec_t sds(k);\n bool successful = stan::prob::factor_cov_matrix(cpcs,sds,y);\n if(!successful)\n BOOST_THROW_EXCEPTION(std::runtime_error (\"factor_cov_matrix failed\"));\n for (typename matrix_t::size_type i = 0; i < k_choose_2; ++i)\n data_r_.push_back(cpcs[i]);\n for (typename matrix_t::size_type i = 0; i < k; ++i)\n data_r_.push_back(sds[i]);\n }\n };\n }\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2008-2017 the MRtrix3 contributors.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * MRtrix is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty\n * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n * For more details, see http:\/\/www.mrtrix.org\/.\n *\/\n\n\n#include \"stats\/permtest.h\"\n\nnamespace MR\n{\n namespace Stats\n {\n namespace PermTest\n {\n\n\n\n PreProcessor::PreProcessor (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n matrix_type& global_enhanced_sum,\n vector<vector<size_t>>& global_enhanced_count) :\n stats_calculator (stats_calculator),\n enhancer (enhancer),\n global_enhanced_sum (global_enhanced_sum),\n global_enhanced_count (global_enhanced_count),\n enhanced_sum (vector_type::Zero (global_enhanced_sum.size())),\n enhanced_count (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0)),\n stats (global_enhanced_sum.rows(), global_enhanced_sum.cols()),\n enhanced_stats (global_enhanced_sum.rows(), global_enhanced_sum.cols()),\n mutex (new std::mutex())\n {\n assert (stats_calculator);\n assert (enhancer);\n }\n\n\n\n PreProcessor::~PreProcessor ()\n {\n std::lock_guard<std::mutex> lock (*mutex);\n global_enhanced_sum.array() += enhanced_sum.array();\n for (ssize_t row = 0; row != global_enhanced_sum.rows(); ++row) {\n for (ssize_t col = 0; col != global_enhanced_sum.cols(); ++col)\n global_enhanced_count[row][col] += enhanced_count[row][col];\n }\n }\n\n\n\n bool PreProcessor::operator() (const Math::Stats::Shuffle& shuffle)\n {\n if (!shuffle.data.rows())\n return false;\n (*stats_calculator) (shuffle.data, stats);\n (*enhancer) (stats, enhanced_stats);\n for (ssize_t c = 0; c != enhanced_stats.rows(); ++c) {\n for (ssize_t i = 0; i < enhanced_stats.cols(); ++i) {\n if (enhanced_stats(c, i) > 0.0) {\n enhanced_sum(c, i) += enhanced_stats(c, i);\n enhanced_count[c][i]++;\n }\n }\n }\n return true;\n }\n\n\n\n\n\n\n\n Processor::Processor (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistics,\n const matrix_type& default_enhanced_statistics,\n matrix_type& perm_dist,\n vector<vector<size_t>>& global_uncorrected_pvalue_counter) :\n stats_calculator (stats_calculator),\n enhancer (enhancer),\n empirical_enhanced_statistics (empirical_enhanced_statistics),\n default_enhanced_statistics (default_enhanced_statistics),\n statistics (stats_calculator->num_elements(), stats_calculator->num_outputs()),\n enhanced_statistics (stats_calculator->num_elements(), stats_calculator->num_outputs()),\n \/\/ TODO Consider changing to Eigen::Array<size_t>\n uncorrected_pvalue_counter (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0)),\n perm_dist (perm_dist),\n global_uncorrected_pvalue_counter (global_uncorrected_pvalue_counter),\n mutex (new std::mutex())\n {\n assert (stats_calculator);\n }\n\n\n\n Processor::~Processor ()\n {\n std::lock_guard<std::mutex> lock (*mutex);\n for (size_t contrast = 0; contrast != stats_calculator->num_outputs(); ++contrast) {\n for (size_t element = 0; element != stats_calculator->num_elements(); ++element)\n global_uncorrected_pvalue_counter[contrast][element] += uncorrected_pvalue_counter[contrast][element];\n }\n }\n\n\n\n bool Processor::operator() (const Math::Stats::Shuffle& shuffle)\n {\n (*stats_calculator) (shuffle.data, statistics);\n if (enhancer)\n (*enhancer) (statistics, enhanced_statistics);\n else\n enhanced_statistics = statistics;\n\n if (empirical_enhanced_statistics.size())\n enhanced_statistics.array() \/= empirical_enhanced_statistics.array();\n\n perm_dist.row(shuffle.index) = enhanced_statistics.colwise().maxCoeff();\n\n for (ssize_t contrast = 0; contrast != enhanced_statistics.cols(); ++contrast) {\n for (ssize_t element = 0; element != enhanced_statistics.rows(); ++element) {\n if (default_enhanced_statistics(element, contrast) > enhanced_statistics(element, contrast))\n uncorrected_pvalue_counter[contrast][element]++;\n }\n }\n\n return true;\n }\n\n\n\n\n\n\n\n void precompute_empirical_stat (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n matrix_type& empirical_statistic)\n {\n assert (stats_calculator);\n vector<vector<size_t>> global_enhanced_count (empirical_statistic.rows(), vector<size_t> (empirical_statistic.cols(), 0));\n {\n Math::Stats::Shuffler shuffler (stats_calculator->num_subjects(), true, \"Pre-computing empirical statistic for non-stationarity correction\");\n PreProcessor preprocessor (stats_calculator, enhancer, empirical_statistic, global_enhanced_count);\n Thread::run_queue (shuffler, Math::Stats::Shuffle(), Thread::multi (preprocessor));\n }\n for (ssize_t row = 0; row != empirical_statistic.rows(); ++row) {\n for (ssize_t i = 0; i != empirical_statistic.cols(); ++i) {\n if (global_enhanced_count[row][i] > 0.0)\n empirical_statistic(row, i) \/= static_cast<default_type> (global_enhanced_count[row][i]);\n }\n }\n }\n\n\n\n\n void precompute_default_permutation (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistic,\n matrix_type& default_enhanced_statistics,\n matrix_type& default_statistics)\n {\n assert (stats_calculator);\n default_statistics.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n default_enhanced_statistics.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n\n const matrix_type default_shuffle (matrix_type::Identity (stats_calculator->num_subjects(), stats_calculator->num_subjects()));\n (*stats_calculator) (default_shuffle, default_statistics);\n\n if (enhancer)\n (*enhancer) (default_statistics, default_enhanced_statistics);\n else\n default_enhanced_statistics = default_statistics;\n\n if (empirical_enhanced_statistic.size())\n default_enhanced_statistics.array() \/= empirical_enhanced_statistic.array();\n }\n\n\n\n\n void run_permutations (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistic,\n const matrix_type& default_enhanced_statistics,\n matrix_type& perm_dist,\n matrix_type& uncorrected_pvalues)\n {\n assert (stats_calculator);\n Math::Stats::Shuffler shuffler (stats_calculator->num_subjects(), false, \"Running permutations\");\n perm_dist.resize (shuffler.size(), stats_calculator->num_outputs());\n uncorrected_pvalues.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n\n vector<vector<size_t>> global_uncorrected_pvalue_count (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0));\n {\n Processor processor (stats_calculator, enhancer,\n empirical_enhanced_statistic,\n default_enhanced_statistics,\n perm_dist,\n global_uncorrected_pvalue_count);\n Thread::run_queue (shuffler, Math::Stats::Shuffle(), Thread::multi (processor));\n }\n\n for (size_t contrast = 0; contrast != stats_calculator->num_outputs(); ++contrast) {\n for (size_t element = 0; element != stats_calculator->num_elements(); ++element)\n uncorrected_pvalues(element, contrast) = global_uncorrected_pvalue_count[contrast][element] \/ default_type(shuffler.size());\n }\n }\n\n\n\n\n }\n }\n}\n\n<commit_msg>Stats: Fix -nonstationary option<commit_after>\/* Copyright (c) 2008-2017 the MRtrix3 contributors.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, you can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * MRtrix is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty\n * of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n *\n * For more details, see http:\/\/www.mrtrix.org\/.\n *\/\n\n\n#include \"stats\/permtest.h\"\n\nnamespace MR\n{\n namespace Stats\n {\n namespace PermTest\n {\n\n\n\n PreProcessor::PreProcessor (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n matrix_type& global_enhanced_sum,\n vector<vector<size_t>>& global_enhanced_count) :\n stats_calculator (stats_calculator),\n enhancer (enhancer),\n global_enhanced_sum (global_enhanced_sum),\n global_enhanced_count (global_enhanced_count),\n enhanced_sum (vector_type::Zero (global_enhanced_sum.size())),\n enhanced_count (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0)),\n stats (global_enhanced_sum.rows(), global_enhanced_sum.cols()),\n enhanced_stats (global_enhanced_sum.rows(), global_enhanced_sum.cols()),\n mutex (new std::mutex())\n {\n assert (stats_calculator);\n assert (enhancer);\n }\n\n\n\n PreProcessor::~PreProcessor ()\n {\n std::lock_guard<std::mutex> lock (*mutex);\n global_enhanced_sum.array() += enhanced_sum.array();\n for (ssize_t row = 0; row != global_enhanced_sum.rows(); ++row) {\n for (ssize_t col = 0; col != global_enhanced_sum.cols(); ++col)\n global_enhanced_count[row][col] += enhanced_count[row][col];\n }\n }\n\n\n\n bool PreProcessor::operator() (const Math::Stats::Shuffle& shuffle)\n {\n if (!shuffle.data.rows())\n return false;\n (*stats_calculator) (shuffle.data, stats);\n (*enhancer) (stats, enhanced_stats);\n for (ssize_t c = 0; c != enhanced_stats.rows(); ++c) {\n for (ssize_t i = 0; i < enhanced_stats.cols(); ++i) {\n if (enhanced_stats(c, i) > 0.0) {\n enhanced_sum(c, i) += enhanced_stats(c, i);\n enhanced_count[c][i]++;\n }\n }\n }\n return true;\n }\n\n\n\n\n\n\n\n Processor::Processor (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistics,\n const matrix_type& default_enhanced_statistics,\n matrix_type& perm_dist,\n vector<vector<size_t>>& global_uncorrected_pvalue_counter) :\n stats_calculator (stats_calculator),\n enhancer (enhancer),\n empirical_enhanced_statistics (empirical_enhanced_statistics),\n default_enhanced_statistics (default_enhanced_statistics),\n statistics (stats_calculator->num_elements(), stats_calculator->num_outputs()),\n enhanced_statistics (stats_calculator->num_elements(), stats_calculator->num_outputs()),\n \/\/ TODO Consider changing to Eigen::Array<size_t>\n uncorrected_pvalue_counter (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0)),\n perm_dist (perm_dist),\n global_uncorrected_pvalue_counter (global_uncorrected_pvalue_counter),\n mutex (new std::mutex())\n {\n assert (stats_calculator);\n }\n\n\n\n Processor::~Processor ()\n {\n std::lock_guard<std::mutex> lock (*mutex);\n for (size_t contrast = 0; contrast != stats_calculator->num_outputs(); ++contrast) {\n for (size_t element = 0; element != stats_calculator->num_elements(); ++element)\n global_uncorrected_pvalue_counter[contrast][element] += uncorrected_pvalue_counter[contrast][element];\n }\n }\n\n\n\n bool Processor::operator() (const Math::Stats::Shuffle& shuffle)\n {\n (*stats_calculator) (shuffle.data, statistics);\n if (enhancer)\n (*enhancer) (statistics, enhanced_statistics);\n else\n enhanced_statistics = statistics;\n\n if (empirical_enhanced_statistics.size())\n enhanced_statistics.array() \/= empirical_enhanced_statistics.array();\n\n perm_dist.row(shuffle.index) = enhanced_statistics.colwise().maxCoeff();\n\n for (ssize_t contrast = 0; contrast != enhanced_statistics.cols(); ++contrast) {\n for (ssize_t element = 0; element != enhanced_statistics.rows(); ++element) {\n if (default_enhanced_statistics(element, contrast) > enhanced_statistics(element, contrast))\n uncorrected_pvalue_counter[contrast][element]++;\n }\n }\n\n return true;\n }\n\n\n\n\n\n\n\n void precompute_empirical_stat (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n matrix_type& empirical_statistic)\n {\n assert (stats_calculator);\n empirical_statistic = matrix_type::Zero (stats_calculator->num_elements(), stats_calculator->num_outputs());\n vector<vector<size_t>> global_enhanced_count (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0));\n {\n Math::Stats::Shuffler shuffler (stats_calculator->num_subjects(), true, \"Pre-computing empirical statistic for non-stationarity correction\");\n PreProcessor preprocessor (stats_calculator, enhancer, empirical_statistic, global_enhanced_count);\n Thread::run_queue (shuffler, Math::Stats::Shuffle(), Thread::multi (preprocessor));\n }\n for (ssize_t contrast = 0; contrast != stats_calculator->num_outputs(); ++contrast) {\n for (ssize_t element = 0; element != stats_calculator->num_elements(); ++element) {\n if (global_enhanced_count[contrast][element] > 0)\n empirical_statistic(contrast, element) \/= static_cast<default_type> (global_enhanced_count[contrast][element]);\n }\n }\n }\n\n\n\n\n void precompute_default_permutation (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistic,\n matrix_type& default_enhanced_statistics,\n matrix_type& default_statistics)\n {\n assert (stats_calculator);\n default_statistics.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n default_enhanced_statistics.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n\n const matrix_type default_shuffle (matrix_type::Identity (stats_calculator->num_subjects(), stats_calculator->num_subjects()));\n (*stats_calculator) (default_shuffle, default_statistics);\n\n if (enhancer)\n (*enhancer) (default_statistics, default_enhanced_statistics);\n else\n default_enhanced_statistics = default_statistics;\n\n if (empirical_enhanced_statistic.size())\n default_enhanced_statistics.array() \/= empirical_enhanced_statistic.array();\n }\n\n\n\n\n void run_permutations (const std::shared_ptr<Math::Stats::GLM::TestBase> stats_calculator,\n const std::shared_ptr<EnhancerBase> enhancer,\n const matrix_type& empirical_enhanced_statistic,\n const matrix_type& default_enhanced_statistics,\n matrix_type& perm_dist,\n matrix_type& uncorrected_pvalues)\n {\n assert (stats_calculator);\n Math::Stats::Shuffler shuffler (stats_calculator->num_subjects(), false, \"Running permutations\");\n perm_dist.resize (shuffler.size(), stats_calculator->num_outputs());\n uncorrected_pvalues.resize (stats_calculator->num_elements(), stats_calculator->num_outputs());\n\n vector<vector<size_t>> global_uncorrected_pvalue_count (stats_calculator->num_outputs(), vector<size_t> (stats_calculator->num_elements(), 0));\n {\n Processor processor (stats_calculator, enhancer,\n empirical_enhanced_statistic,\n default_enhanced_statistics,\n perm_dist,\n global_uncorrected_pvalue_count);\n Thread::run_queue (shuffler, Math::Stats::Shuffle(), Thread::multi (processor));\n }\n\n for (size_t contrast = 0; contrast != stats_calculator->num_outputs(); ++contrast) {\n for (size_t element = 0; element != stats_calculator->num_elements(); ++element)\n uncorrected_pvalues(element, contrast) = global_uncorrected_pvalue_count[contrast][element] \/ default_type(shuffler.size());\n }\n }\n\n\n\n\n }\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <cassert>\n#include <fstream>\n#include <cstring>\n#include <string>\n\n\/**\n * This namespace defines wrappers for std::ifstream, std::ofstream, and\n * std::fstream objects. The wrappers perform the following steps:\n * - check the open modes make sense\n * - check that the call to open() is successful\n * - (for input streams) check that the opened file is peek-able\n * - turn on the badbit in the exception mask\n *\/\nnamespace strict_fstream\n{\n\n\/\/ Help people out a bit, it seems like this is a common recommenation since\n\/\/ musl breaks all over the place.\n#if defined(__NEED_size_t) && !defined(__MUSL__)\n#warning \"It seems to be recommended to patch in a define for __MUSL__ if you use musl globally: https:\/\/www.openwall.com\/lists\/musl\/2013\/02\/10\/5\"\n#define __MUSL__\n#endif\n\n\/\/ Workaround for broken musl implementation\n\/\/ Since musl insists that they are perfectly compatible, ironically enough,\n\/\/ they don't officially have a __musl__ or similar. But __NEED_size_t is defined in their\n\/\/ relevant header (and not in working implementations), so we can use that.\n#ifdef __MUSL__\n#warning \"Working around broken strerror_r() implementation in musl, remove when musl is fixed\"\n#endif\n\n\/\/ Non-gnu variants of strerror_* don't necessarily null-terminate if\n\/\/ truncating, so we have to do things manually.\ninline std::string &trim_to_null(std::string &buff)\n{\n const std::string::size_type pos = buff.find('\\0');\n if (pos == std::string::npos) {\n buff += \" [...]\"; \/\/ it has been truncated\n } else {\n buff.resize(pos);\n }\n return buff;\n}\n\n\/\/\/ Overload of error-reporting function, to enable use with VS.\n\/\/\/ Ref: http:\/\/stackoverflow.com\/a\/901316\/717706\nstatic std::string strerror()\n{\n std::string buff(256, '\\0');\n#ifdef _WIN32\n \/\/ Since strerror_s might set errno itself, we need to store it.\n const int err_num = errno;\n if (strerror_s(buff.data(), buff.size(), err_num) != 0) {\n return trim_to_null(buff);\n } else {\n return \"Unknown error (\" + std::to_string(err_num) + \")\";\n }\n#elif ((_POSIX_C_SOURCE >= 200112L || _XOPEN_SOURCE >= 600 || defined(__APPLE__)) && ! _GNU_SOURCE) || defined(__MUSL__)\n\/\/ XSI-compliant strerror_r()\n const int err_num = errno; \/\/ See above\n if (strerror_r(err_num, buff.data(), buff.size()) == 0) {\n return trim_to_null(buff);\n } else {\n return \"Unknown error (\" + std::to_string(err_num) + \")\";\n }\n#else\n\/\/ GNU-specific strerror_r()\n char * p = strerror_r(errno, &buff[0], buff.size());\n return std::string(p, std::strlen(p));\n#endif\n}\n\n\/\/\/ Exception class thrown by failed operations.\nclass Exception\n : public std::exception\n{\npublic:\n Exception(const std::string& msg) : _msg(msg) {}\n const char * what() const noexcept { return _msg.c_str(); }\nprivate:\n std::string _msg;\n}; \/\/ class Exception\n\nnamespace detail\n{\n\nstruct static_method_holder\n{\n static std::string mode_to_string(std::ios_base::openmode mode)\n {\n static const int n_modes = 6;\n static const std::ios_base::openmode mode_val_v[n_modes] =\n {\n std::ios_base::in,\n std::ios_base::out,\n std::ios_base::app,\n std::ios_base::ate,\n std::ios_base::trunc,\n std::ios_base::binary\n };\n\n static const char * mode_name_v[n_modes] =\n {\n \"in\",\n \"out\",\n \"app\",\n \"ate\",\n \"trunc\",\n \"binary\"\n };\n std::string res;\n for (int i = 0; i < n_modes; ++i)\n {\n if (mode & mode_val_v[i])\n {\n res += (! res.empty()? \"|\" : \"\");\n res += mode_name_v[i];\n }\n }\n if (res.empty()) res = \"none\";\n return res;\n }\n static void check_mode(const std::string& filename, std::ios_base::openmode mode)\n {\n if ((mode & std::ios_base::trunc) && ! (mode & std::ios_base::out))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: trunc and not out\");\n }\n else if ((mode & std::ios_base::app) && ! (mode & std::ios_base::out))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: app and not out\");\n }\n else if ((mode & std::ios_base::trunc) && (mode & std::ios_base::app))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: trunc and app\");\n }\n }\n static void check_open(std::ios * s_p, const std::string& filename, std::ios_base::openmode mode)\n {\n if (s_p->fail())\n {\n throw Exception(std::string(\"strict_fstream: open('\")\n + filename + \"',\" + mode_to_string(mode) + \"): open failed: \"\n + strerror());\n }\n }\n static void check_peek(std::istream * is_p, const std::string& filename, std::ios_base::openmode mode)\n {\n bool peek_failed = true;\n try\n {\n is_p->peek();\n peek_failed = is_p->fail();\n }\n catch (const std::ios_base::failure &) {}\n if (peek_failed)\n {\n throw Exception(std::string(\"strict_fstream: open('\")\n + filename + \"',\" + mode_to_string(mode) + \"): peek failed: \"\n + strerror());\n }\n is_p->clear();\n }\n}; \/\/ struct static_method_holder\n\n} \/\/ namespace detail\n\nclass ifstream\n : public std::ifstream\n{\npublic:\n ifstream() = default;\n ifstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n mode |= std::ios_base::in;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::ifstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n detail::static_method_holder::check_peek(this, filename, mode);\n }\n}; \/\/ class ifstream\n\nclass ofstream\n : public std::ofstream\n{\npublic:\n ofstream() = default;\n ofstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::out)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::out)\n {\n mode |= std::ios_base::out;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::ofstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n }\n}; \/\/ class ofstream\n\nclass fstream\n : public std::fstream\n{\npublic:\n fstream() = default;\n fstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n if (! (mode & std::ios_base::out)) mode |= std::ios_base::in;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::fstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n detail::static_method_holder::check_peek(this, filename, mode);\n }\n}; \/\/ class fstream\n\n} \/\/ namespace strict_fstream\n\n<commit_msg>fix macos\/alpine<commit_after>#pragma once\n\n#include <cassert>\n#include <fstream>\n#include <cstring>\n#include <string>\n#include <vector>\n\n\/**\n * This namespace defines wrappers for std::ifstream, std::ofstream, and\n * std::fstream objects. The wrappers perform the following steps:\n * - check the open modes make sense\n * - check that the call to open() is successful\n * - (for input streams) check that the opened file is peek-able\n * - turn on the badbit in the exception mask\n *\/\nnamespace strict_fstream\n{\n\n\/\/ Help people out a bit, it seems like this is a common recommenation since\n\/\/ musl breaks all over the place.\n#if defined(__NEED_size_t) && !defined(__MUSL__)\n#warning \"It seems to be recommended to patch in a define for __MUSL__ if you use musl globally: https:\/\/www.openwall.com\/lists\/musl\/2013\/02\/10\/5\"\n#define __MUSL__\n#endif\n\n\/\/ Workaround for broken musl implementation\n\/\/ Since musl insists that they are perfectly compatible, ironically enough,\n\/\/ they don't officially have a __musl__ or similar. But __NEED_size_t is defined in their\n\/\/ relevant header (and not in working implementations), so we can use that.\n#ifdef __MUSL__\n#warning \"Working around broken strerror_r() implementation in musl, remove when musl is fixed\"\n#endif\n\n\/\/ Non-gnu variants of strerror_* don't necessarily null-terminate if\n\/\/ truncating, so we have to do things manually.\ninline std::string trim_to_null(const std::vector<char> &buff)\n{\n std::string ret(buff.begin(), buff.end());\n\n const std::string::size_type pos = ret.find('\\0');\n if (pos == std::string::npos) {\n ret += \" [...]\"; \/\/ it has been truncated\n } else {\n ret.resize(pos);\n }\n return ret;\n}\n\n\/\/\/ Overload of error-reporting function, to enable use with VS and non-GNU\n\/\/\/ POSIX libc's\n\/\/\/ Ref:\n\/\/\/ - http:\/\/stackoverflow.com\/a\/901316\/717706\nstatic std::string strerror()\n{\n \/\/ Can't use std::string since we're pre-C++17\n std::vector<char> buff(256, '\\0');\n\n#ifdef _WIN32\n \/\/ Since strerror_s might set errno itself, we need to store it.\n const int err_num = errno;\n if (strerror_s(buff.data(), buff.size(), err_num) != 0) {\n return trim_to_null(buff);\n } else {\n return \"Unknown error (\" + std::to_string(err_num) + \")\";\n }\n#elif ((_POSIX_C_SOURCE >= 200112L || _XOPEN_SOURCE >= 600 || defined(__APPLE__)) && ! _GNU_SOURCE) || defined(__MUSL__)\n\/\/ XSI-compliant strerror_r()\n const int err_num = errno; \/\/ See above\n if (strerror_r(err_num, buff.data(), buff.size()) == 0) {\n return trim_to_null(buff);\n } else {\n return \"Unknown error (\" + std::to_string(err_num) + \")\";\n }\n#else\n\/\/ GNU-specific strerror_r()\n char * p = strerror_r(errno, &buff[0], buff.size());\n return std::string(p, std::strlen(p));\n#endif\n}\n\n\/\/\/ Exception class thrown by failed operations.\nclass Exception\n : public std::exception\n{\npublic:\n Exception(const std::string& msg) : _msg(msg) {}\n const char * what() const noexcept { return _msg.c_str(); }\nprivate:\n std::string _msg;\n}; \/\/ class Exception\n\nnamespace detail\n{\n\nstruct static_method_holder\n{\n static std::string mode_to_string(std::ios_base::openmode mode)\n {\n static const int n_modes = 6;\n static const std::ios_base::openmode mode_val_v[n_modes] =\n {\n std::ios_base::in,\n std::ios_base::out,\n std::ios_base::app,\n std::ios_base::ate,\n std::ios_base::trunc,\n std::ios_base::binary\n };\n\n static const char * mode_name_v[n_modes] =\n {\n \"in\",\n \"out\",\n \"app\",\n \"ate\",\n \"trunc\",\n \"binary\"\n };\n std::string res;\n for (int i = 0; i < n_modes; ++i)\n {\n if (mode & mode_val_v[i])\n {\n res += (! res.empty()? \"|\" : \"\");\n res += mode_name_v[i];\n }\n }\n if (res.empty()) res = \"none\";\n return res;\n }\n static void check_mode(const std::string& filename, std::ios_base::openmode mode)\n {\n if ((mode & std::ios_base::trunc) && ! (mode & std::ios_base::out))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: trunc and not out\");\n }\n else if ((mode & std::ios_base::app) && ! (mode & std::ios_base::out))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: app and not out\");\n }\n else if ((mode & std::ios_base::trunc) && (mode & std::ios_base::app))\n {\n throw Exception(std::string(\"strict_fstream: open('\") + filename + \"'): mode error: trunc and app\");\n }\n }\n static void check_open(std::ios * s_p, const std::string& filename, std::ios_base::openmode mode)\n {\n if (s_p->fail())\n {\n throw Exception(std::string(\"strict_fstream: open('\")\n + filename + \"',\" + mode_to_string(mode) + \"): open failed: \"\n + strerror());\n }\n }\n static void check_peek(std::istream * is_p, const std::string& filename, std::ios_base::openmode mode)\n {\n bool peek_failed = true;\n try\n {\n is_p->peek();\n peek_failed = is_p->fail();\n }\n catch (const std::ios_base::failure &) {}\n if (peek_failed)\n {\n throw Exception(std::string(\"strict_fstream: open('\")\n + filename + \"',\" + mode_to_string(mode) + \"): peek failed: \"\n + strerror());\n }\n is_p->clear();\n }\n}; \/\/ struct static_method_holder\n\n} \/\/ namespace detail\n\nclass ifstream\n : public std::ifstream\n{\npublic:\n ifstream() = default;\n ifstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n mode |= std::ios_base::in;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::ifstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n detail::static_method_holder::check_peek(this, filename, mode);\n }\n}; \/\/ class ifstream\n\nclass ofstream\n : public std::ofstream\n{\npublic:\n ofstream() = default;\n ofstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::out)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::out)\n {\n mode |= std::ios_base::out;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::ofstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n }\n}; \/\/ class ofstream\n\nclass fstream\n : public std::fstream\n{\npublic:\n fstream() = default;\n fstream(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n open(filename, mode);\n }\n void open(const std::string& filename, std::ios_base::openmode mode = std::ios_base::in)\n {\n if (! (mode & std::ios_base::out)) mode |= std::ios_base::in;\n exceptions(std::ios_base::badbit);\n detail::static_method_holder::check_mode(filename, mode);\n std::fstream::open(filename, mode);\n detail::static_method_holder::check_open(this, filename, mode);\n detail::static_method_holder::check_peek(this, filename, mode);\n }\n}; \/\/ class fstream\n\n} \/\/ namespace strict_fstream\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Unit tests for denial-of-service detection\/prevention code\n\/\/\n#include <algorithm>\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/date_time\/posix_time\/posix_time_types.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/foreach.hpp>\n\n#include \"main.h\"\n#include \"wallet.h\"\n#include \"net.h\"\n#include \"util.h\"\n\n#include <stdint.h>\n\n\/\/ Tests this internal-to-main.cpp method:\nextern bool AddOrphanTx(const CDataStream& vMsg);\nextern unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans);\nextern std::map<uint256, CDataStream*> mapOrphanTransactions;\nextern std::map<uint256, std::map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;\n\nCService ip(uint32_t i)\n{\n struct in_addr s;\n s.s_addr = i;\n return CService(CNetAddr(s), GetDefaultPort());\n}\n\nBOOST_AUTO_TEST_SUITE(DoS_tests)\n\nBOOST_AUTO_TEST_CASE(DoS_banning)\n{\n CNode::ClearBanned();\n CAddress addr1(ip(0xa0b0c001));\n CNode dummyNode1(INVALID_SOCKET, addr1, \"\", true);\n dummyNode1.Misbehaving(100); \/\/ Should get banned\n BOOST_CHECK(CNode::IsBanned(addr1));\n BOOST_CHECK(!CNode::IsBanned(ip(0xa0b0c001|0x0000ff00))); \/\/ Different ip, not banned\n\n CAddress addr2(ip(0xa0b0c002));\n CNode dummyNode2(INVALID_SOCKET, addr2, \"\", true);\n dummyNode2.Misbehaving(50);\n BOOST_CHECK(!CNode::IsBanned(addr2)); \/\/ 2 not banned yet...\n BOOST_CHECK(CNode::IsBanned(addr1)); \/\/ ... but 1 still should be\n dummyNode2.Misbehaving(50);\n BOOST_CHECK(CNode::IsBanned(addr2));\n} \n\nBOOST_AUTO_TEST_CASE(DoS_banscore)\n{\n CNode::ClearBanned();\n mapArgs[\"-banscore\"] = \"111\"; \/\/ because 11 is my favorite number\n CAddress addr1(ip(0xa0b0c001));\n CNode dummyNode1(INVALID_SOCKET, addr1, \"\", true);\n dummyNode1.Misbehaving(100);\n BOOST_CHECK(!CNode::IsBanned(addr1));\n dummyNode1.Misbehaving(10);\n BOOST_CHECK(!CNode::IsBanned(addr1));\n dummyNode1.Misbehaving(1);\n BOOST_CHECK(CNode::IsBanned(addr1));\n mapArgs.erase(\"-banscore\");\n}\n\nBOOST_AUTO_TEST_CASE(DoS_bantime)\n{\n CNode::ClearBanned();\n int64 nStartTime = GetTime();\n SetMockTime(nStartTime); \/\/ Overrides future calls to GetTime()\n\n CAddress addr(ip(0xa0b0c001));\n CNode dummyNode(INVALID_SOCKET, addr, \"\", true);\n\n dummyNode.Misbehaving(100);\n BOOST_CHECK(CNode::IsBanned(addr));\n\n SetMockTime(nStartTime+60*60);\n BOOST_CHECK(CNode::IsBanned(addr));\n\n SetMockTime(nStartTime+60*60*24+1);\n BOOST_CHECK(!CNode::IsBanned(addr));\n}\n\nstatic bool CheckNBits(unsigned int nbits1, int64 time1, unsigned int nbits2, int64 time2)\\\n{\n if (time1 > time2)\n return CheckNBits(nbits2, time2, nbits1, time1);\n int64 deltaTime = time2-time1;\n\n CBigNum required;\n required.SetCompact(ComputeMinWork(nbits1, deltaTime, false));\n CBigNum have;\n have.SetCompact(nbits2);\n return (have <= required);\n}\n\nCTransaction RandomOrphan()\n{\n std::map<uint256, CDataStream*>::iterator it;\n it = mapOrphanTransactions.lower_bound(GetRandHash());\n if (it == mapOrphanTransactions.end())\n it = mapOrphanTransactions.begin();\n const CDataStream* pvMsg = it->second;\n CTransaction tx;\n CDataStream(*pvMsg) >> tx;\n return tx;\n}\n\nBOOST_AUTO_TEST_CASE(DoS_mapOrphans)\n{\n CKey key;\n key.MakeNewKey(true);\n CBasicKeyStore keystore;\n keystore.AddKey(key);\n\n \/\/ 50 orphan transactions:\n for (int i = 0; i < 50; i++)\n {\n CTransaction tx;\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = GetRandHash();\n tx.vin[0].scriptSig << OP_1;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ ... and 50 that depend on other orphans:\n for (int i = 0; i < 50; i++)\n {\n CTransaction txPrev = RandomOrphan();\n\n CTransaction tx;\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = txPrev.GetHash();\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n SignSignature(keystore, txPrev, tx, 0);\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ This really-big orphan should be ignored:\n for (int i = 0; i < 10; i++)\n {\n CTransaction txPrev = RandomOrphan();\n\n CTransaction tx;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n tx.vin.resize(500);\n for (int j = 0; j < tx.vin.size(); j++)\n {\n tx.vin[j].prevout.n = j;\n tx.vin[j].prevout.hash = txPrev.GetHash();\n }\n SignSignature(keystore, txPrev, tx, 0);\n \/\/ Re-use same signature for other inputs\n \/\/ (they don't have to be valid for this test)\n for (int j = 1; j < tx.vin.size(); j++)\n tx.vin[j].scriptSig = tx.vin[0].scriptSig;\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n BOOST_CHECK(!AddOrphanTx(ds));\n }\n\n \/\/ Test LimitOrphanTxSize() function:\n LimitOrphanTxSize(40);\n BOOST_CHECK(mapOrphanTransactions.size() <= 40);\n LimitOrphanTxSize(10);\n BOOST_CHECK(mapOrphanTransactions.size() <= 10);\n LimitOrphanTxSize(0);\n BOOST_CHECK(mapOrphanTransactions.empty());\n BOOST_CHECK(mapOrphanTransactionsByPrev.empty());\n}\n\nBOOST_AUTO_TEST_CASE(DoS_checkSig)\n{\n \/\/ Test signature caching code (see key.cpp Verify() methods)\n\n CKey key;\n key.MakeNewKey(true);\n CBasicKeyStore keystore;\n keystore.AddKey(key);\n\n \/\/ 100 orphan transactions:\n static const int NPREV=100;\n CTransaction orphans[NPREV];\n for (int i = 0; i < NPREV; i++)\n {\n CTransaction& tx = orphans[i];\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = GetRandHash();\n tx.vin[0].scriptSig << OP_1;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ Create a transaction that depends on orphans:\n CTransaction tx;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n tx.vin.resize(NPREV);\n for (int j = 0; j < tx.vin.size(); j++)\n {\n tx.vin[j].prevout.n = 0;\n tx.vin[j].prevout.hash = orphans[j].GetHash();\n }\n \/\/ Creating signatures primes the cache:\n boost::posix_time::ptime mst1 = boost::posix_time::microsec_clock::local_time();\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(SignSignature(keystore, orphans[j], tx, j));\n boost::posix_time::ptime mst2 = boost::posix_time::microsec_clock::local_time();\n boost::posix_time::time_duration msdiff = mst2 - mst1;\n long nOneValidate = msdiff.total_milliseconds();\n if (fDebug) printf(\"DoS_Checksig sign: %ld\\n\", nOneValidate);\n\n \/\/ ... now validating repeatedly should be quick:\n \/\/ 2.8GHz machine, -g build: Sign takes ~760ms,\n \/\/ uncached Verify takes ~250ms, cached Verify takes ~50ms\n \/\/ (for 100 single-signature inputs)\n mst1 = boost::posix_time::microsec_clock::local_time();\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(VerifySignature(orphans[j], tx, j, true, SIGHASH_ALL));\n mst2 = boost::posix_time::microsec_clock::local_time();\n msdiff = mst2 - mst1;\n long nManyValidate = msdiff.total_milliseconds();\n if (fDebug) printf(\"DoS_Checksig five: %ld\\n\", nManyValidate);\n\n BOOST_CHECK_MESSAGE(nManyValidate < nOneValidate, \"Signature cache timing failed\");\n\n \/\/ Empty a signature, validation should fail:\n CScript save = tx.vin[0].scriptSig;\n tx.vin[0].scriptSig = CScript();\n BOOST_CHECK(!VerifySignature(orphans[0], tx, 0, true, SIGHASH_ALL));\n tx.vin[0].scriptSig = save;\n\n \/\/ Swap signatures, validation should fail:\n std::swap(tx.vin[0].scriptSig, tx.vin[1].scriptSig);\n BOOST_CHECK(!VerifySignature(orphans[0], tx, 0, true, SIGHASH_ALL));\n BOOST_CHECK(!VerifySignature(orphans[1], tx, 1, true, SIGHASH_ALL));\n std::swap(tx.vin[0].scriptSig, tx.vin[1].scriptSig);\n\n \/\/ Exercise -maxsigcachesize code:\n mapArgs[\"-maxsigcachesize\"] = \"10\";\n \/\/ Generate a new, different signature for vin[0] to trigger cache clear:\n CScript oldSig = tx.vin[0].scriptSig;\n BOOST_CHECK(SignSignature(keystore, orphans[0], tx, 0));\n BOOST_CHECK(tx.vin[0].scriptSig != oldSig);\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(VerifySignature(orphans[j], tx, j, true, SIGHASH_ALL));\n mapArgs.erase(\"-maxsigcachesize\");\n\n LimitOrphanTxSize(0);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Remove the rest of the unneeded checknbits test.<commit_after>\/\/\n\/\/ Unit tests for denial-of-service detection\/prevention code\n\/\/\n#include <algorithm>\n\n#include <boost\/assign\/list_of.hpp> \/\/ for 'map_list_of()'\n#include <boost\/date_time\/posix_time\/posix_time_types.hpp>\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/foreach.hpp>\n\n#include \"main.h\"\n#include \"wallet.h\"\n#include \"net.h\"\n#include \"util.h\"\n\n#include <stdint.h>\n\n\/\/ Tests this internal-to-main.cpp method:\nextern bool AddOrphanTx(const CDataStream& vMsg);\nextern unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans);\nextern std::map<uint256, CDataStream*> mapOrphanTransactions;\nextern std::map<uint256, std::map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;\n\nCService ip(uint32_t i)\n{\n struct in_addr s;\n s.s_addr = i;\n return CService(CNetAddr(s), GetDefaultPort());\n}\n\nBOOST_AUTO_TEST_SUITE(DoS_tests)\n\nBOOST_AUTO_TEST_CASE(DoS_banning)\n{\n CNode::ClearBanned();\n CAddress addr1(ip(0xa0b0c001));\n CNode dummyNode1(INVALID_SOCKET, addr1, \"\", true);\n dummyNode1.Misbehaving(100); \/\/ Should get banned\n BOOST_CHECK(CNode::IsBanned(addr1));\n BOOST_CHECK(!CNode::IsBanned(ip(0xa0b0c001|0x0000ff00))); \/\/ Different ip, not banned\n\n CAddress addr2(ip(0xa0b0c002));\n CNode dummyNode2(INVALID_SOCKET, addr2, \"\", true);\n dummyNode2.Misbehaving(50);\n BOOST_CHECK(!CNode::IsBanned(addr2)); \/\/ 2 not banned yet...\n BOOST_CHECK(CNode::IsBanned(addr1)); \/\/ ... but 1 still should be\n dummyNode2.Misbehaving(50);\n BOOST_CHECK(CNode::IsBanned(addr2));\n} \n\nBOOST_AUTO_TEST_CASE(DoS_banscore)\n{\n CNode::ClearBanned();\n mapArgs[\"-banscore\"] = \"111\"; \/\/ because 11 is my favorite number\n CAddress addr1(ip(0xa0b0c001));\n CNode dummyNode1(INVALID_SOCKET, addr1, \"\", true);\n dummyNode1.Misbehaving(100);\n BOOST_CHECK(!CNode::IsBanned(addr1));\n dummyNode1.Misbehaving(10);\n BOOST_CHECK(!CNode::IsBanned(addr1));\n dummyNode1.Misbehaving(1);\n BOOST_CHECK(CNode::IsBanned(addr1));\n mapArgs.erase(\"-banscore\");\n}\n\nBOOST_AUTO_TEST_CASE(DoS_bantime)\n{\n CNode::ClearBanned();\n int64 nStartTime = GetTime();\n SetMockTime(nStartTime); \/\/ Overrides future calls to GetTime()\n\n CAddress addr(ip(0xa0b0c001));\n CNode dummyNode(INVALID_SOCKET, addr, \"\", true);\n\n dummyNode.Misbehaving(100);\n BOOST_CHECK(CNode::IsBanned(addr));\n\n SetMockTime(nStartTime+60*60);\n BOOST_CHECK(CNode::IsBanned(addr));\n\n SetMockTime(nStartTime+60*60*24+1);\n BOOST_CHECK(!CNode::IsBanned(addr));\n}\n\nCTransaction RandomOrphan()\n{\n std::map<uint256, CDataStream*>::iterator it;\n it = mapOrphanTransactions.lower_bound(GetRandHash());\n if (it == mapOrphanTransactions.end())\n it = mapOrphanTransactions.begin();\n const CDataStream* pvMsg = it->second;\n CTransaction tx;\n CDataStream(*pvMsg) >> tx;\n return tx;\n}\n\nBOOST_AUTO_TEST_CASE(DoS_mapOrphans)\n{\n CKey key;\n key.MakeNewKey(true);\n CBasicKeyStore keystore;\n keystore.AddKey(key);\n\n \/\/ 50 orphan transactions:\n for (int i = 0; i < 50; i++)\n {\n CTransaction tx;\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = GetRandHash();\n tx.vin[0].scriptSig << OP_1;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ ... and 50 that depend on other orphans:\n for (int i = 0; i < 50; i++)\n {\n CTransaction txPrev = RandomOrphan();\n\n CTransaction tx;\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = txPrev.GetHash();\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n SignSignature(keystore, txPrev, tx, 0);\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ This really-big orphan should be ignored:\n for (int i = 0; i < 10; i++)\n {\n CTransaction txPrev = RandomOrphan();\n\n CTransaction tx;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n tx.vin.resize(500);\n for (int j = 0; j < tx.vin.size(); j++)\n {\n tx.vin[j].prevout.n = j;\n tx.vin[j].prevout.hash = txPrev.GetHash();\n }\n SignSignature(keystore, txPrev, tx, 0);\n \/\/ Re-use same signature for other inputs\n \/\/ (they don't have to be valid for this test)\n for (int j = 1; j < tx.vin.size(); j++)\n tx.vin[j].scriptSig = tx.vin[0].scriptSig;\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n BOOST_CHECK(!AddOrphanTx(ds));\n }\n\n \/\/ Test LimitOrphanTxSize() function:\n LimitOrphanTxSize(40);\n BOOST_CHECK(mapOrphanTransactions.size() <= 40);\n LimitOrphanTxSize(10);\n BOOST_CHECK(mapOrphanTransactions.size() <= 10);\n LimitOrphanTxSize(0);\n BOOST_CHECK(mapOrphanTransactions.empty());\n BOOST_CHECK(mapOrphanTransactionsByPrev.empty());\n}\n\nBOOST_AUTO_TEST_CASE(DoS_checkSig)\n{\n \/\/ Test signature caching code (see key.cpp Verify() methods)\n\n CKey key;\n key.MakeNewKey(true);\n CBasicKeyStore keystore;\n keystore.AddKey(key);\n\n \/\/ 100 orphan transactions:\n static const int NPREV=100;\n CTransaction orphans[NPREV];\n for (int i = 0; i < NPREV; i++)\n {\n CTransaction& tx = orphans[i];\n tx.vin.resize(1);\n tx.vin[0].prevout.n = 0;\n tx.vin[0].prevout.hash = GetRandHash();\n tx.vin[0].scriptSig << OP_1;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n\n CDataStream ds(SER_DISK, CLIENT_VERSION);\n ds << tx;\n AddOrphanTx(ds);\n }\n\n \/\/ Create a transaction that depends on orphans:\n CTransaction tx;\n tx.vout.resize(1);\n tx.vout[0].nValue = 1*CENT;\n tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());\n tx.vin.resize(NPREV);\n for (int j = 0; j < tx.vin.size(); j++)\n {\n tx.vin[j].prevout.n = 0;\n tx.vin[j].prevout.hash = orphans[j].GetHash();\n }\n \/\/ Creating signatures primes the cache:\n boost::posix_time::ptime mst1 = boost::posix_time::microsec_clock::local_time();\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(SignSignature(keystore, orphans[j], tx, j));\n boost::posix_time::ptime mst2 = boost::posix_time::microsec_clock::local_time();\n boost::posix_time::time_duration msdiff = mst2 - mst1;\n long nOneValidate = msdiff.total_milliseconds();\n if (fDebug) printf(\"DoS_Checksig sign: %ld\\n\", nOneValidate);\n\n \/\/ ... now validating repeatedly should be quick:\n \/\/ 2.8GHz machine, -g build: Sign takes ~760ms,\n \/\/ uncached Verify takes ~250ms, cached Verify takes ~50ms\n \/\/ (for 100 single-signature inputs)\n mst1 = boost::posix_time::microsec_clock::local_time();\n for (int i = 0; i < 5; i++)\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(VerifySignature(orphans[j], tx, j, true, SIGHASH_ALL));\n mst2 = boost::posix_time::microsec_clock::local_time();\n msdiff = mst2 - mst1;\n long nManyValidate = msdiff.total_milliseconds();\n if (fDebug) printf(\"DoS_Checksig five: %ld\\n\", nManyValidate);\n\n BOOST_CHECK_MESSAGE(nManyValidate < nOneValidate, \"Signature cache timing failed\");\n\n \/\/ Empty a signature, validation should fail:\n CScript save = tx.vin[0].scriptSig;\n tx.vin[0].scriptSig = CScript();\n BOOST_CHECK(!VerifySignature(orphans[0], tx, 0, true, SIGHASH_ALL));\n tx.vin[0].scriptSig = save;\n\n \/\/ Swap signatures, validation should fail:\n std::swap(tx.vin[0].scriptSig, tx.vin[1].scriptSig);\n BOOST_CHECK(!VerifySignature(orphans[0], tx, 0, true, SIGHASH_ALL));\n BOOST_CHECK(!VerifySignature(orphans[1], tx, 1, true, SIGHASH_ALL));\n std::swap(tx.vin[0].scriptSig, tx.vin[1].scriptSig);\n\n \/\/ Exercise -maxsigcachesize code:\n mapArgs[\"-maxsigcachesize\"] = \"10\";\n \/\/ Generate a new, different signature for vin[0] to trigger cache clear:\n CScript oldSig = tx.vin[0].scriptSig;\n BOOST_CHECK(SignSignature(keystore, orphans[0], tx, 0));\n BOOST_CHECK(tx.vin[0].scriptSig != oldSig);\n for (int j = 0; j < tx.vin.size(); j++)\n BOOST_CHECK(VerifySignature(orphans[j], tx, j, true, SIGHASH_ALL));\n mapArgs.erase(\"-maxsigcachesize\");\n\n LimitOrphanTxSize(0);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include \"base_test.hpp\"\n\n#include <algorithm>\n#include <fstream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"..\/lib\/storage\/storage_manager.hpp\"\n\nnamespace opossum {\n\nvoid BaseTest::EXPECT_TABLE_EQ(const Table &tleft, const Table &tright, bool order_sensitive) {\n EXPECT_TRUE(_table_equal(tleft, tright, order_sensitive));\n}\n\nvoid BaseTest::ASSERT_TABLE_EQ(const Table &tleft, const Table &tright, bool order_sensitive) {\n ASSERT_TRUE(_table_equal(tleft, tright, order_sensitive));\n}\n\nvoid BaseTest::EXPECT_TABLE_EQ(std::shared_ptr<const Table> tleft, std::shared_ptr<const Table> tright,\n bool order_sensitive) {\n EXPECT_TABLE_EQ(*tleft, *tright, order_sensitive);\n}\n\nvoid BaseTest::ASSERT_TABLE_EQ(std::shared_ptr<const Table> tleft, std::shared_ptr<const Table> tright,\n bool order_sensitive) {\n ASSERT_TABLE_EQ(*tleft, *tright, order_sensitive);\n}\n\nBaseTest::Matrix BaseTest::_table_to_matrix(const Table &t) {\n \/\/ initialize matrix with table sizes\n Matrix matrix(t.row_count(), std::vector<AllTypeVariant>(t.col_count()));\n\n \/\/ set values\n unsigned row_offset = 0;\n for (ChunkID chunk_id = 0; chunk_id < t.chunk_count(); chunk_id++) {\n const Chunk &chunk = t.get_chunk(chunk_id);\n\n for (size_t col_id = 0; col_id < t.col_count(); ++col_id) {\n std::shared_ptr<BaseColumn> column = chunk.get_column(col_id);\n\n for (ChunkOffset chunk_offset = 0; chunk_offset < chunk.size(); ++chunk_offset) {\n matrix[row_offset + chunk_offset][col_id] = (*column)[chunk_offset];\n }\n }\n row_offset += chunk.size();\n }\n\n return matrix;\n}\n\nvoid BaseTest::_print_matrix(const BaseTest::Matrix &m) {\n std::cout << \"-------------\" << std::endl;\n for (unsigned row = 0; row < m.size(); row++) {\n for (unsigned col = 0; col < m[row].size(); col++) {\n std::cout << std::setw(8) << m[row][col] << \" \";\n }\n std::cout << std::endl;\n }\n std::cout << \"-------------\" << std::endl;\n}\n\n::testing::AssertionResult BaseTest::_table_equal(const Table &tleft, const Table &tright, bool order_sensitive) {\n Matrix left = _table_to_matrix(tleft);\n Matrix right = _table_to_matrix(tright);\n \/\/ compare schema of tables\n \/\/ - column count\n if (tleft.col_count() != tright.col_count()) {\n _print_matrix(left);\n _print_matrix(right);\n return ::testing::AssertionFailure() << \"Number of columns is different.\";\n }\n \/\/ - column names and types\n for (size_t col_id = 0; col_id < tright.col_count(); ++col_id) {\n if (tleft.column_type(col_id) != tright.column_type(col_id) ||\n tleft.column_name(col_id) != tright.column_name(col_id)) {\n std::cout << \"Column with ID \" << col_id << \" is different\" << std::endl;\n std::cout << \"Got: \" << tleft.column_name(col_id) << \" (\" << tleft.column_type(col_id) << \")\" << std::endl;\n std::cout << \"Expected: \" << tright.column_name(col_id) << \" (\" << tright.column_type(col_id) << \")\" << std::endl;\n return ::testing::AssertionFailure() << \"Table schema is different.\";\n }\n }\n\n \/\/ compare content of tables\n \/\/ - row count for fast failure\n if (tleft.row_count() != tright.row_count()) {\n _print_matrix(left);\n _print_matrix(right);\n return ::testing::AssertionFailure() << \"Number of rows is different.\";\n }\n\n \/\/ sort if order does not matter\n if (!order_sensitive) {\n std::sort(left.begin(), left.end());\n std::sort(right.begin(), right.end());\n }\n\n if (left == right) {\n return ::testing::AssertionSuccess();\n } else {\n _print_matrix(left);\n _print_matrix(right);\n return ::testing::AssertionFailure() << \"Table content is different.\";\n }\n}\n\ntemplate <typename T>\nstd::vector<T> BaseTest::_split(const std::string &str, char delimiter) {\n std::vector<T> internal;\n std::stringstream ss(str);\n std::string tok;\n\n while (std::getline(ss, tok, delimiter)) {\n internal.push_back(tok);\n }\n\n return internal;\n}\n\nstd::shared_ptr<Table> BaseTest::load_table(const std::string &file_name, size_t chunk_size) {\n std::shared_ptr<Table> test_table = std::make_shared<Table>(chunk_size);\n\n std::ifstream infile(file_name);\n std::string line;\n\n std::getline(infile, line);\n std::vector<std::string> col_names = _split<std::string>(line, '|');\n std::getline(infile, line);\n std::vector<std::string> col_types = _split<std::string>(line, '|');\n\n for (size_t i = 0; i < col_names.size(); i++) {\n test_table->add_column(col_names[i], col_types[i]);\n }\n\n while (std::getline(infile, line)) {\n std::vector<AllTypeVariant> values = _split<AllTypeVariant>(line, '|');\n test_table->append(values);\n }\n return test_table;\n}\n\nBaseTest::~BaseTest() { StorageManager::reset(); }\n\n} \/\/ namespace opossum\n<commit_msg>Update base_test.cpp<commit_after>#include \"base_test.hpp\"\n\n#include <algorithm>\n#include <fstream>\n#include <memory>\n#include <sstream>\n#include <string>\n#include <vector>\n\n#include \"..\/lib\/storage\/storage_manager.hpp\"\n\nnamespace opossum {\n\nvoid BaseTest::EXPECT_TABLE_EQ(const Table &tleft, const Table &tright, bool order_sensitive) {\n EXPECT_TRUE(_table_equal(tleft, tright, order_sensitive));\n}\n\nvoid BaseTest::ASSERT_TABLE_EQ(const Table &tleft, const Table &tright, bool order_sensitive) {\n ASSERT_TRUE(_table_equal(tleft, tright, order_sensitive));\n}\n\nvoid BaseTest::EXPECT_TABLE_EQ(std::shared_ptr<const Table> tleft, std::shared_ptr<const Table> tright,\n bool order_sensitive) {\n EXPECT_TABLE_EQ(*tleft, *tright, order_sensitive);\n}\n\nvoid BaseTest::ASSERT_TABLE_EQ(std::shared_ptr<const Table> tleft, std::shared_ptr<const Table> tright,\n bool order_sensitive) {\n ASSERT_TABLE_EQ(*tleft, *tright, order_sensitive);\n}\n\nBaseTest::Matrix BaseTest::_table_to_matrix(const Table &t) {\n \/\/ initialize matrix with table sizes\n Matrix matrix(t.row_count(), std::vector<AllTypeVariant>(t.col_count()));\n\n \/\/ set values\n unsigned row_offset = 0;\n for (ChunkID chunk_id = 0; chunk_id < t.chunk_count(); chunk_id++) {\n const Chunk &chunk = t.get_chunk(chunk_id);\n\n for (size_t col_id = 0; col_id < t.col_count(); ++col_id) {\n std::shared_ptr<BaseColumn> column = chunk.get_column(col_id);\n\n for (ChunkOffset chunk_offset = 0; chunk_offset < chunk.size(); ++chunk_offset) {\n matrix[row_offset + chunk_offset][col_id] = (*column)[chunk_offset];\n }\n }\n row_offset += chunk.size();\n }\n\n return matrix;\n}\n\nvoid BaseTest::_print_matrix(const BaseTest::Matrix &m) {\n std::cout << \"-------------\" << std::endl;\n for (unsigned row = 0; row < m.size(); row++) {\n for (unsigned col = 0; col < m[row].size(); col++) {\n std::cout << std::setw(8) << m[row][col] << \" \";\n }\n std::cout << std::endl;\n }\n std::cout << \"-------------\" << std::endl;\n}\n\n::testing::AssertionResult BaseTest::_table_equal(const Table &tleft, const Table &tright, bool order_sensitive) {\n Matrix left = _table_to_matrix(tleft);\n Matrix right = _table_to_matrix(tright);\n \/\/ compare schema of tables\n \/\/ - column count\n if (tleft.col_count() != tright.col_count()) {\n _print_matrix(left);\n _print_matrix(right);\n return ::testing::AssertionFailure() << \"Number of columns is different.\";\n }\n \/\/ - column names and types\n for (size_t col_id = 0; col_id < tright.col_count(); ++col_id) {\n if (tleft.column_type(col_id) != tright.column_type(col_id) ||\n tleft.column_name(col_id) != tright.column_name(col_id)) {\n std::cout << \"Column with ID \" << col_id << \" is different\" << std::endl;\n std::cout << \"Got: \" << tleft.column_name(col_id) << \" (\" << tleft.column_type(col_id) << \")\" << std::endl;\n std::cout << \"Expected: \" << tright.column_name(col_id) << \" (\" << tright.column_type(col_id) << \")\" << std::endl;\n return ::testing::AssertionFailure() << \"Table schema is different.\";\n }\n }\n\n \/\/ compare content of tables\n \/\/ - row count for fast failure\n if (tleft.row_count() != tright.row_count()) {\n _print_matrix(left);\n _print_matrix(right);\n return ::testing::AssertionFailure() << \"Number of rows is different.\";\n }\n\n \/\/ sort if order does not matter\n if (!order_sensitive) {\n std::sort(left.begin(), left.end());\n std::sort(right.begin(), right.end());\n }\n\n for (unsigned row = 0; row < left.size(); row++)\n for (unsigned col = 0; col < left[row].size(); col++) {\n if (tleft.column_type(col) == \"float\") {\n EXPECT_FLOAT_EQ(type_cast<float>(left[row][col]), type_cast<float>(right[row][col])) << \"Row\/Col:\" << row << \"\/\"\n << col;\n } else if (tleft.column_type(col) == \"double\") {\n EXPECT_DOUBLE_EQ(type_cast<double>(left[row][col]), type_cast<double>(right[row][col])) << \"Row\/Col:\" << row\n << \"\/\" << col;\n } else {\n EXPECT_EQ(left[row][col], right[row][col]) << \"Row:\" << row + 1 << \" Col:\" << col + 1;\n }\n }\n\n return ::testing::AssertionSuccess();\n}\n\ntemplate <typename T>\nstd::vector<T> BaseTest::_split(const std::string &str, char delimiter) {\n std::vector<T> internal;\n std::stringstream ss(str);\n std::string tok;\n\n while (std::getline(ss, tok, delimiter)) {\n internal.push_back(tok);\n }\n\n return internal;\n}\n\nstd::shared_ptr<Table> BaseTest::load_table(const std::string &file_name, size_t chunk_size) {\n std::shared_ptr<Table> test_table = std::make_shared<Table>(chunk_size);\n\n std::ifstream infile(file_name);\n std::string line;\n\n std::getline(infile, line);\n std::vector<std::string> col_names = _split<std::string>(line, '|');\n std::getline(infile, line);\n std::vector<std::string> col_types = _split<std::string>(line, '|');\n\n for (size_t i = 0; i < col_names.size(); i++) {\n test_table->add_column(col_names[i], col_types[i]);\n }\n\n while (std::getline(infile, line)) {\n std::vector<AllTypeVariant> values = _split<AllTypeVariant>(line, '|');\n test_table->append(values);\n }\n return test_table;\n}\n\nBaseTest::~BaseTest() { StorageManager::reset(); }\n\n} \/\/ namespace opossum\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <gtest\/gtest.h>\n#include <parser\/BibParser.h>\n\nTEST(BibParserTest, simple)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={233},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"title\"));\n}\n\nTEST(BibParserTest, notFormated)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\"\n\t\t\t\t\t\t\t\t\t\t \"author={Albiac, F.},\"\n\t\t\t\t\t\t\t\t\t\t \"author={Kalton, N.J.},\"\n\t\t\t\t\t\t\t\t\t\t \"title={Topics in Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"series={Grad. Text in Math.},\"\n\t\t\t\t\t\t\t\t\t\t \"volume={233},\"\n\t\t\t\t\t\t\t\t\t\t \"publisher={Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"date={2006},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n}\n\nTEST(BibParserTest, extraSpaces)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib {LibroA} {book} {\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.} , \"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.} , \"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory} , \"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.} , \"\n\t\t\t\t\t\t\t\t\t\t \" volume={233}, \"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer} ,\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006} , \"\n\t\t\t\t\t\t\t\t\t\t \" }\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n}\n\nTEST(BibParserTest, minimalKeys)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{A}{B}{\"\n\t\t\t\t\t\t\t\t\t\t \"a={Albiac, F.},\"\n\t\t\t\t\t\t\t\t\t\t \"a={Kalton, N.J.},\"\n\t\t\t\t\t\t\t\t\t\t \"t={Topics in Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"s={Grad. Text in Math.},\"\n\t\t\t\t\t\t\t\t\t\t \"v={233},\"\n\t\t\t\t\t\t\t\t\t\t \"p={Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"d={2006},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"d\"));\n}\n\nTEST(BibParserTest, minimalKeysAndValues)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{A}{B}{\"\n\t\t\t\t\t\t\t\t\t\t \"a={a},\"\n\t\t\t\t\t\t\t\t\t\t \"a={b},\"\n\t\t\t\t\t\t\t\t\t\t \"t={c},\"\n\t\t\t\t\t\t\t\t\t\t \"s={d},\"\n\t\t\t\t\t\t\t\t\t\t \"v={e},\"\n\t\t\t\t\t\t\t\t\t\t \"p={f},\"\n\t\t\t\t\t\t\t\t\t\t \"d={{}},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"c\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"a\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"b\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"d\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"e\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"f\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"{}\", bib.getValue(\"d\"));\n}\n\nTEST(BibParserTest, minimalKeysAndValuesRandomSpaces)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib {A} {B} {\"\n\t\t\t\t\t\t\t\t\t\t \"a={a} ,\"\n\t\t\t\t\t\t\t\t\t\t \" a={b} ,\"\n\t\t\t\t\t\t\t\t\t\t \" t={c} , \"\n\t\t\t\t\t\t\t\t\t\t \" s={d}, \"\n\t\t\t\t\t\t\t\t\t\t \" v={e},\"\n\t\t\t\t\t\t\t\t\t\t \"p={f} ,\"\n\t\t\t\t\t\t\t\t\t\t \"d={{ } },\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"c\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"a\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"b\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"d\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"e\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"f\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"{ } \", bib.getValue(\"d\"));\n}\n\n<commit_msg>Add more tests<commit_after>#pragma once\n\n#include <gtest\/gtest.h>\n#include <parser\/BibParser.h>\n\nTEST(BibParserTest, simple)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={233},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"title\"));\n}\n\nTEST(BibParserTest, notFormated)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\"\n\t\t\t\t\t\t\t\t\t\t \"author={Albiac, F.},\"\n\t\t\t\t\t\t\t\t\t\t \"author={Kalton, N.J.},\"\n\t\t\t\t\t\t\t\t\t\t \"title={Topics in Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"series={Grad. Text in Math.},\"\n\t\t\t\t\t\t\t\t\t\t \"volume={233},\"\n\t\t\t\t\t\t\t\t\t\t \"publisher={Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"date={2006},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n}\n\nTEST(BibParserTest, extraSpaces)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib {LibroA} {book} {\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.} , \"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.} , \"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory} , \"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.} , \"\n\t\t\t\t\t\t\t\t\t\t \" volume={233}, \"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer} ,\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006} , \"\n\t\t\t\t\t\t\t\t\t\t \" }\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\tEXPECT_EQ(\"book\", bib.getEntryType());\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n}\n\nTEST(BibParserTest, minimalKeys)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{A}{B}{\"\n\t\t\t\t\t\t\t\t\t\t \"a={Albiac, F.},\"\n\t\t\t\t\t\t\t\t\t\t \"a={Kalton, N.J.},\"\n\t\t\t\t\t\t\t\t\t\t \"t={Topics in Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"s={Grad. Text in Math.},\"\n\t\t\t\t\t\t\t\t\t\t \"v={233},\"\n\t\t\t\t\t\t\t\t\t\t \"p={Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"d={2006},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"233\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"Springer\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"2006\", bib.getValue(\"d\"));\n}\n\nTEST(BibParserTest, minimalKeysAndValues)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{A}{B}{\"\n\t\t\t\t\t\t\t\t\t\t \"a={a},\"\n\t\t\t\t\t\t\t\t\t\t \"a={b},\"\n\t\t\t\t\t\t\t\t\t\t \"t={c},\"\n\t\t\t\t\t\t\t\t\t\t \"s={d},\"\n\t\t\t\t\t\t\t\t\t\t \"v={e},\"\n\t\t\t\t\t\t\t\t\t\t \"p={f},\"\n\t\t\t\t\t\t\t\t\t\t \"d={{}},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"c\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"a\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"b\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"d\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"e\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"f\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"{}\", bib.getValue(\"d\"));\n}\n\nTEST(BibParserTest, minimalKeysAndValuesRandomSpaces)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib {A} {B} {\"\n\t\t\t\t\t\t\t\t\t\t \"a={a} ,\"\n\t\t\t\t\t\t\t\t\t\t \" a={b} ,\"\n\t\t\t\t\t\t\t\t\t\t \" t={c} , \"\n\t\t\t\t\t\t\t\t\t\t \" s={d}, \"\n\t\t\t\t\t\t\t\t\t\t \" v={e},\"\n\t\t\t\t\t\t\t\t\t\t \"p={f} ,\"\n\t\t\t\t\t\t\t\t\t\t \"d={{ } },\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"A\", bib.getCite());\n\tEXPECT_EQ(\"B\", bib.getEntryType());\n\tEXPECT_EQ(\"c\", bib.getValue(\"t\"));\n\tEXPECT_EQ(\"a\", bib.getValue(\"a\"));\n\tEXPECT_EQ(\"b\", bib.getValue(\"a\", 1));\n\tEXPECT_EQ(\"d\", bib.getValue(\"s\"));\n\tEXPECT_EQ(\"e\", bib.getValue(\"v\"));\n\tEXPECT_EQ(\"f\", bib.getValue(\"p\"));\n\tEXPECT_EQ(\"{ } \", bib.getValue(\"d\"));\n}\n\nTEST(BibParserTest, nested)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{KostrikinS1965}{article}{ author={Kostrikin, A. I.}, \"\n\t\t\t\t\t\t\t\t\t\t \"author={\\\\v{S}afarevi\\\\v{c}, I. R.}, title={Cartan pseudogroups and Lie \"\n\t\t\t\t\t\t\t\t\t\t \"$p$-algebras}, journal={Dokl. Akad. Nauk SSSR}, volume={168}, date={1965},\"\n\t\t\t\t\t\t\t\t\t\t \" pages={740--742}, translation={ journal={Soviet Math. Dokl.}, volume={6}, date={1965}, pages={715--718} }, review={\\\\MR{0199235}} }\");\n\n\tEXPECT_EQ(1, singleBib.size());\n\n\tauto& bib = singleBib.front();\n\tEXPECT_EQ(\"KostrikinS1965\", bib.getCite());\n\tEXPECT_EQ(\"article\", bib.getEntryType());\n\tEXPECT_EQ(\"Kostrikin, A. I.\", bib.getValue(\"author\"));\n\tEXPECT_EQ(\"\\\\v{S}afarevi\\\\v{c}, I. R.\", bib.getValue(\"author\", 1));\n\tEXPECT_EQ(\"168\", bib.getValue(\"volume\"));\n\tEXPECT_EQ(\"1965\", bib.getValue(\"date\"));\n\tEXPECT_EQ(\"740--742\", bib.getValue(\"pages\"));\n\tEXPECT_EQ(\"\\\\MR{0199235}\", bib.getValue(\"review\"));\n\tEXPECT_EQ(\" journal={Soviet Math. Dokl.}, volume={6}, date={1965}, pages={715--718} \", bib.getValue(\"translation\"));\n\t\/\/TODO check parsing nested\n\tEXPECT_EQ(\"Dokl. Akad. Nauk SSSR\", bib.getValue(\"journal\"));\n\tEXPECT_EQ(\"Cartan pseudogroups and Lie $p$-algebras\", bib.getValue(\"title\"));\n}\n\nTEST(BibParserTest, two)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={233},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\\n\"\n\t\t\t\t\t\t\t\t\t\t \"\\\\bib{LibroCa}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Carothers, N.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={A~short course on Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={London Math. Soc student text},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={64},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Cambridge Univ. Press},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2004},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(2, singleBib.size());\n\t{\n\t\tauto& bib = singleBib[0];\n\t\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\t\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n\t\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"title\"));\n\t}\n\t{\n\t\tauto& bib = singleBib[1];\n\t\tEXPECT_EQ(\"LibroCa\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Carothers, N.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"A~short course on Banach spaces theory\", bib.getValue(\"title\"));\n\t\tEXPECT_EQ(\"London Math. Soc student text\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"64\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"Cambridge Univ. Press\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"2004\", bib.getValue(\"date\"));\n\t}\n}\n\nTEST(BibParserTest, three)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Albiac, F.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Kalton, N.J.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={Topics in Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={Grad. Text in Math.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={233},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Springer},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2006},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\\n\"\n\t\t\t\t\t\t\t\t\t\t \"\\\\bib{LibroCa}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Carothers, N.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={A~short course on Banach spaces theory},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={London Math. Soc student text},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" volume={64},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Cambridge Univ. Press},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2004},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\\n\"\n\t\t\t\t\t\t\t\t\t\t \"\\\\bib{LibroC}{book}{\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Cruz-Uribe, D.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" author={Fiorenza, A.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" title={Variable Lebesgue spaces. Foundations and harmonic analysis},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" series={Applied and Numerical Harmonic Analysis},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" publisher={Birkhauser\/Springer},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" place={Heidelberg.},\\n\"\n\t\t\t\t\t\t\t\t\t\t \" date={2013},\\n\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(3, singleBib.size());\n\t{\n\t\tauto& bib = singleBib[0];\n\t\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\t\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n\t\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"title\"));\n\t}\n\t{\n\t\tauto& bib = singleBib[1];\n\t\tEXPECT_EQ(\"LibroCa\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Carothers, N.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"A~short course on Banach spaces theory\", bib.getValue(\"title\"));\n\t\tEXPECT_EQ(\"London Math. Soc student text\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"64\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"Cambridge Univ. Press\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"2004\", bib.getValue(\"date\"));\n\t}\n\t{\n\t\tauto& bib = singleBib[2];\n\t\tEXPECT_EQ(\"LibroC\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Cruz-Uribe, D.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"Fiorenza, A.\", bib.getValue(\"author\", 1));\n\t\tEXPECT_EQ(\"Variable Lebesgue spaces. Foundations and harmonic analysis\", bib.getValue(\"title\"));\n\t\tEXPECT_EQ(\"Applied and Numerical Harmonic Analysis\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"Heidelberg.\", bib.getValue(\"place\"));\n\t\tEXPECT_EQ(\"Birkhauser\/Springer\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"2013\", bib.getValue(\"date\"));\n\t}\n}\n\nTEST(BibParserTest, threeMinimalFormat)\n{\n\tBibParser parser;\n\n\tauto singleBib = parser.parse(\"\\\\bib{LibroA}{book}{\"\n\t\t\t\t\t\t\t\t\t\t \"author={Albiac, F.},\"\n\t\t\t\t\t\t\t\t\t\t \"author={Kalton, N.J.},\"\n\t\t\t\t\t\t\t\t\t\t \"title={Topics in Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"series={Grad. Text in Math.},\"\n\t\t\t\t\t\t\t\t\t\t \"volume={233},\"\n\t\t\t\t\t\t\t\t\t\t \"publisher={Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"date={2006},\"\n\t\t\t\t\t\t\t\t\t\t \"}\"\n\t\t\t\t\t\t\t\t\t\t \"\\\\bib{LibroCa}{book}{\"\n\t\t\t\t\t\t\t\t\t\t \"author={Carothers, N.},\"\n\t\t\t\t\t\t\t\t\t\t \"title={A~short course on Banach spaces theory},\"\n\t\t\t\t\t\t\t\t\t\t \"series={London Math. Soc student text},\"\n\t\t\t\t\t\t\t\t\t\t \"volume={64},\"\n\t\t\t\t\t\t\t\t\t\t \"publisher={Cambridge Univ. Press},\"\n\t\t\t\t\t\t\t\t\t\t \"date={2004},\"\n\t\t\t\t\t\t\t\t\t\t \"}\"\n\t\t\t\t\t\t\t\t\t\t \"\\\\bib{LibroC}{book}{\"\n\t\t\t\t\t\t\t\t\t\t \"author={Cruz-Uribe, D.},\"\n\t\t\t\t\t\t\t\t\t\t \"author={Fiorenza, A.},\"\n\t\t\t\t\t\t\t\t\t\t \"title={Variable Lebesgue spaces. Foundations and harmonic analysis},\"\n\t\t\t\t\t\t\t\t\t\t \"series={Applied and Numerical Harmonic Analysis},\"\n\t\t\t\t\t\t\t\t\t\t \"publisher={Birkhauser\/Springer},\"\n\t\t\t\t\t\t\t\t\t\t \"place={Heidelberg.},\"\n\t\t\t\t\t\t\t\t\t\t \"date={2013},\"\n\t\t\t\t\t\t\t\t\t\t \"}\");\n\n\tEXPECT_EQ(3, singleBib.size());\n\t{\n\t\tauto& bib = singleBib[0];\n\t\tEXPECT_EQ(\"LibroA\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Albiac, F.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"Kalton, N.J.\", bib.getValue(\"author\", 1));\n\t\tEXPECT_EQ(\"233\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"2006\", bib.getValue(\"date\"));\n\t\tEXPECT_EQ(\"Grad. Text in Math.\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"Springer\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"Topics in Banach spaces theory\", bib.getValue(\"title\"));\n\t}\n\t{\n\t\tauto& bib = singleBib[1];\n\t\tEXPECT_EQ(\"LibroCa\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Carothers, N.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"A~short course on Banach spaces theory\", bib.getValue(\"title\"));\n\t\tEXPECT_EQ(\"London Math. Soc student text\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"64\", bib.getValue(\"volume\"));\n\t\tEXPECT_EQ(\"Cambridge Univ. Press\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"2004\", bib.getValue(\"date\"));\n\t}\n\t{\n\t\tauto& bib = singleBib[2];\n\t\tEXPECT_EQ(\"LibroC\", bib.getCite());\n\t\tEXPECT_EQ(\"book\", bib.getEntryType());\n\t\tEXPECT_EQ(\"Cruz-Uribe, D.\", bib.getValue(\"author\"));\n\t\tEXPECT_EQ(\"Fiorenza, A.\", bib.getValue(\"author\", 1));\n\t\tEXPECT_EQ(\"Variable Lebesgue spaces. Foundations and harmonic analysis\", bib.getValue(\"title\"));\n\t\tEXPECT_EQ(\"Applied and Numerical Harmonic Analysis\", bib.getValue(\"series\"));\n\t\tEXPECT_EQ(\"Heidelberg.\", bib.getValue(\"place\"));\n\t\tEXPECT_EQ(\"Birkhauser\/Springer\", bib.getValue(\"publisher\"));\n\t\tEXPECT_EQ(\"2013\", bib.getValue(\"date\"));\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gmock\/gmock.h>\n\n#include <string>\n#include <vector>\n\n#include \"mutant\/IniParser.h\"\n#include \"mutant\/error.h\"\n\n\nclass IniParserTest: public ::testing::Test {\npublic:\n Config config;\n IniParser parser;\n};\n\n\nTEST_F(IniParserTest, parse) {\n std::string content = R\"(\n[core]\nuser.email = test@example.com\npath = \/usr\/local\/lib\/mutant\/libs:$HOME\/projects\/mutant-libs\nfoo = \"Some path with spaces here\"\n\n[watch]\nbar = 12.3\n)\";\n\n int error = parser.parse(config, content);\n\n ASSERT_EQ(ERROR_OK, error);\n ASSERT_EQ(2, config.groups.size());\n\n auto it = config.groups.find(\"core\");\n ASSERT_TRUE(it != config.groups.end());\n\n ConfigGroup& core = it->second;\n ASSERT_EQ(3, core.settings.size());\n\n auto emailIt = core.settings.find(\"user.email\");\n ASSERT_TRUE(emailIt != core.settings.end());\n ASSERT_EQ(\"test@example.com\", emailIt->second);\n\n auto pathIt = core.settings.find(\"path\");\n ASSERT_TRUE(pathIt != core.settings.end());\n ASSERT_EQ(\"\/usr\/local\/lib\/mutant\/libs:$HOME\/projects\/mutant-libs\", pathIt->second);\n\n auto fooIt = core.settings.find(\"foo\");\n ASSERT_TRUE(fooIt != core.settings.end());\n ASSERT_EQ(\"Some path with spaces here\", fooIt->second);\n\n auto watchIt = config.groups.find(\"watch\");\n ASSERT_TRUE(watchIt != config.groups.end());\n\n ConfigGroup& watch = watchIt->second;\n ASSERT_EQ(1, watch.settings.size());\n}\n\n\nTEST_F(IniParserTest, extractGroupName) {\n std::string content = \" [some-group] \";\n std::string expected = \"some-group\";\n\n std::string name = IniParser::extractGroupName(content, 0, content.length());\n\n ASSERT_EQ(expected, name);\n}\n<commit_msg>remove IniParserTest::extractGroupName<commit_after>#include <gmock\/gmock.h>\n\n#include <string>\n#include <vector>\n\n#include \"mutant\/IniParser.h\"\n#include \"mutant\/error.h\"\n\n\nclass IniParserTest: public ::testing::Test {\npublic:\n Config config;\n IniParser parser;\n};\n\n\nTEST_F(IniParserTest, parse) {\n std::string content = R\"(\n[core]\nuser.email = test@example.com\npath = \/usr\/local\/lib\/mutant\/libs:$HOME\/projects\/mutant-libs\nfoo = \"Some path with spaces here\"\n\n[watch]\nbar = 12.3\n)\";\n\n int error = parser.parse(config, content);\n\n ASSERT_EQ(ERROR_OK, error);\n ASSERT_EQ(2, config.groups.size());\n\n auto it = config.groups.find(\"core\");\n ASSERT_TRUE(it != config.groups.end());\n\n ConfigGroup& core = it->second;\n ASSERT_EQ(3, core.settings.size());\n\n auto emailIt = core.settings.find(\"user.email\");\n ASSERT_TRUE(emailIt != core.settings.end());\n ASSERT_EQ(\"test@example.com\", emailIt->second);\n\n auto pathIt = core.settings.find(\"path\");\n ASSERT_TRUE(pathIt != core.settings.end());\n ASSERT_EQ(\"\/usr\/local\/lib\/mutant\/libs:$HOME\/projects\/mutant-libs\", pathIt->second);\n\n auto fooIt = core.settings.find(\"foo\");\n ASSERT_TRUE(fooIt != core.settings.end());\n ASSERT_EQ(\"Some path with spaces here\", fooIt->second);\n\n auto watchIt = config.groups.find(\"watch\");\n ASSERT_TRUE(watchIt != config.groups.end());\n\n ConfigGroup& watch = watchIt->second;\n ASSERT_EQ(1, watch.settings.size());\n}\n<|endoftext|>"} {"text":"<commit_before>\/* flappy.cc --- ncurses flappy bird clone\n * This is free and unencumbered software released into the public domain.\n * c++ -std=c++11 flappy.cc -lncurses -lm -o flappy\n *\/\n\n#include <algorithm>\n#include <thread>\n#include <deque>\n#include <ctime>\n#include <cmath>\n#include <cstring>\n#include <ncurses.h>\n#include \"sqlite3.h\"\n#include \"highscores.hh\"\n\nstruct Display {\n Display(int width = 40, int height = 20) : height{height}, width{width} {\n initscr();\n raw();\n timeout(0);\n noecho();\n curs_set(0);\n keypad(stdscr, TRUE);\n erase();\n }\n\n ~Display() { endwin(); }\n\n void erase() {\n ::erase();\n for (int y = 0; y < height; y++) {\n mvaddch(y, 0, '|');\n mvaddch(y, width - 1, '|');\n }\n for (int x = 0; x < width; x++) {\n mvaddch(0, x, '-');\n mvaddch(height - 1, x, '-');\n }\n mvaddch(0, 0, '\/');\n mvaddch(height - 1, 0, '\\\\');\n mvaddch(0, width - 1, '\\\\');\n mvaddch(height - 1, width - 1, '\/');\n }\n\n void refresh() { ::refresh(); }\n\n const int height, width;\n\n int block_getch() {\n refresh();\n timeout(-1);\n int c = getch();\n timeout(0);\n return c;\n }\n\n void read_name(int y, int x, char *target, size_t n) {\n int p = 0;\n timeout(-1);\n curs_set(1);\n bool reading = true;\n while (reading) {\n move(y, x + p);\n refresh();\n int c = getch();\n switch (c) {\n case KEY_ENTER:\n case '\\n':\n case '\\r':\n reading = false;\n break;\n case KEY_LEFT:\n case KEY_BACKSPACE:\n if (p > 0) mvaddch(y, x + --p, ' ');\n break;\n default:\n if (p < n - 1) {\n target[p] = c;\n mvaddch(y, x + p++, c);\n }\n }\n }\n target[p + 1] = '\\0';\n timeout(0);\n curs_set(0);\n }\n};\n\nstruct World {\n World(Display *display) : display{display} {\n for (int x = 1; x < display->width - 1; x++) {\n walls.push_back(0);\n }\n }\n\n std::deque<int> walls;\n Display *display;\n int steps = 0;\n\n constexpr static int kRate = 2, kVGap = 2, kHGap = 10;\n\n int rand_wall() {\n int h = display->height;\n return (rand() % h \/ 2) + h \/ 4;\n }\n\n void step() {\n steps++;\n if (steps % kRate == 0) {\n walls.pop_front();\n switch (steps % (kRate * kHGap)) {\n case 0:\n walls.push_back(rand_wall());\n break;\n case kRate * 1:\n case kRate * 2:\n walls.push_back(walls.back());\n break;\n default:\n walls.push_back(0);\n }\n }\n }\n\n void draw() {\n for (int i = 0; i < walls.size(); i++) {\n int wall = walls[i];\n if (wall != 0) {\n for (int y = 1; y < display->height - 1; y++) {\n if (y == wall - kVGap - 1|| y == wall + kVGap + 1) {\n mvaddch(y, i + 1, '=');\n } else if (y < wall - kVGap || y > wall + kVGap) {\n mvaddch(y, i + 1, '*');\n }\n }\n }\n }\n mvprintw(display->height, 0, \"Score: %d\", score());\n }\n\n int score() { return std::max(0, steps \/ (kRate * kHGap) - 2); }\n};\n\nstruct Bird {\n Bird(Display *display) : y{display->height \/ 2.0}, display{display} {}\n\n static constexpr double kImpulse = -0.8, kGravity = 0.1;\n\n double y, dy = kImpulse;\n Display *display;\n\n void gravity() {\n dy += kGravity;\n y += dy;\n }\n\n void poke() { dy = kImpulse; }\n\n void draw() { draw('@'); }\n\n void draw(int c) {\n int h = std::round(y);\n h = std::max(1, std::min(h, display->height - 2));\n mvaddch(h, display->width \/ 2, c);\n }\n\n bool is_alive(World &world) {\n if (y <= 0 || y >= display->height) {\n return false;\n }\n int wall = world.walls[display->width \/ 2 - 1];\n if (wall != 0) {\n return y > wall - World::kVGap && y < wall + World::kVGap;\n }\n return true;\n }\n};\n\nstruct Game {\n Game(Display *display) : display{display}, bird{display}, world{display} {}\n\n Display *display;\n Bird bird;\n World world;\n\n int run() {\n display->erase();\n const char *intro = \"[Press SPACE to hop upwards]\";\n mvprintw(display->height \/ 2 - 2,\n display->width \/ 2 - std::strlen(intro) \/ 2, intro);\n bird.draw();\n display->block_getch();\n while (bird.is_alive(world)) {\n int c = getch();\n if (c == 'q') {\n return -1;\n } else if (c != ERR) {\n while (getch() != ERR)\n ; \/\/ clear repeat buffer\n bird.poke();\n }\n display->erase();\n world.step();\n world.draw();\n bird.gravity();\n bird.draw();\n display->refresh();\n std::this_thread::sleep_for(std::chrono::milliseconds{67});\n }\n bird.draw('X');\n display->refresh();\n return world.score();\n }\n};\n\nvoid print_scores(Display &display, HighScores &scores) {\n mvprintw(0, display.width + 4, \"== High Scores ==\");\n int i = 1;\n for (auto &line : scores.top_scores()) {\n mvprintw(i, display.width + 1, \"%s\", line.name.c_str());\n clrtoeol();\n mvprintw(i, display.width + 24, \"%d\", line.score);\n i++;\n }\n}\n\nint main(int argc, const char **argv) {\n srand(std::time(NULL));\n const char *filename = \"\/tmp\/flappy-scores.db\";\n if (argc > 1) {\n filename = argv[1];\n }\n Display display;\n HighScores scores{filename, display.height};\n\n while (true) {\n Game game{&display};\n\n int score = game.run();\n if (score < 0) {\n return 0; \/\/ game quit early\n }\n\n \/* Game over *\/\n mvprintw(display.height + 1, 0, \"Game over!\");\n print_scores(display, scores);\n\n \/* Enter new high score *\/\n if (scores.is_best(score)) {\n mvprintw(display.height + 2, 0, \"You have a high score!\");\n mvprintw(display.height + 3, 0, \"Enter name: \");\n char name[23] = {0};\n display.read_name(display.height + 3, 12, name, sizeof(name));\n if (std::strlen(name) == 0) {\n std::strcpy(name, \"(anonymous)\");\n }\n scores.insert_score(name, score);\n move(display.height + 3, 0);\n clrtoeol();\n print_scores(display, scores);\n }\n\n \/* Handle quit\/restart *\/\n mvprintw(display.height + 2, 0, \"Press 'q' to quit, 'r' to retry.\");\n int c;\n while ((c = display.block_getch()) != 'r') {\n if (c == 'q' || c == ERR) {\n return 0;\n }\n }\n }\n return 0;\n}\n<commit_msg>Adjust score keeping.<commit_after>\/* flappy.cc --- ncurses flappy bird clone\n * This is free and unencumbered software released into the public domain.\n * c++ -std=c++11 flappy.cc -lncurses -lm -o flappy\n *\/\n\n#include <algorithm>\n#include <thread>\n#include <deque>\n#include <ctime>\n#include <cmath>\n#include <cstring>\n#include <ncurses.h>\n#include \"sqlite3.h\"\n#include \"highscores.hh\"\n\nstruct Display {\n Display(int width = 40, int height = 20) : height{height}, width{width} {\n initscr();\n raw();\n timeout(0);\n noecho();\n curs_set(0);\n keypad(stdscr, TRUE);\n erase();\n }\n\n ~Display() { endwin(); }\n\n void erase() {\n ::erase();\n for (int y = 0; y < height; y++) {\n mvaddch(y, 0, '|');\n mvaddch(y, width - 1, '|');\n }\n for (int x = 0; x < width; x++) {\n mvaddch(0, x, '-');\n mvaddch(height - 1, x, '-');\n }\n mvaddch(0, 0, '\/');\n mvaddch(height - 1, 0, '\\\\');\n mvaddch(0, width - 1, '\\\\');\n mvaddch(height - 1, width - 1, '\/');\n }\n\n void refresh() { ::refresh(); }\n\n const int height, width;\n\n int block_getch() {\n refresh();\n timeout(-1);\n int c = getch();\n timeout(0);\n return c;\n }\n\n void read_name(int y, int x, char *target, size_t n) {\n int p = 0;\n timeout(-1);\n curs_set(1);\n bool reading = true;\n while (reading) {\n move(y, x + p);\n refresh();\n int c = getch();\n switch (c) {\n case KEY_ENTER:\n case '\\n':\n case '\\r':\n reading = false;\n break;\n case KEY_LEFT:\n case KEY_BACKSPACE:\n if (p > 0) mvaddch(y, x + --p, ' ');\n break;\n default:\n if (p < n - 1) {\n target[p] = c;\n mvaddch(y, x + p++, c);\n }\n }\n }\n target[p + 1] = '\\0';\n timeout(0);\n curs_set(0);\n }\n};\n\nstruct World {\n World(Display *display) : display{display} {\n for (int x = 1; x < display->width - 1; x++) {\n walls.push_back(0);\n }\n }\n\n std::deque<int> walls;\n Display *display;\n int steps = 0;\n\n constexpr static int kRate = 2, kVGap = 2, kHGap = 10;\n\n int rand_wall() {\n int h = display->height;\n return (rand() % h \/ 2) + h \/ 4;\n }\n\n void step() {\n steps++;\n if (steps % kRate == 0) {\n walls.pop_front();\n switch (steps % (kRate * kHGap)) {\n case 0:\n walls.push_back(rand_wall());\n break;\n case kRate * 1:\n case kRate * 2:\n walls.push_back(walls.back());\n break;\n default:\n walls.push_back(0);\n }\n }\n }\n\n void draw() {\n for (int i = 0; i < walls.size(); i++) {\n int wall = walls[i];\n if (wall != 0) {\n for (int y = 1; y < display->height - 1; y++) {\n if (y == wall - kVGap - 1|| y == wall + kVGap + 1) {\n mvaddch(y, i + 1, '=');\n } else if (y < wall - kVGap || y > wall + kVGap) {\n mvaddch(y, i + 1, '*');\n }\n }\n }\n }\n mvprintw(display->height, 0, \"Score: %d\", score());\n }\n\n int score() { return std::max(0, (steps - 2) \/ (kRate * kHGap) - 2); }\n};\n\nstruct Bird {\n Bird(Display *display) : y{display->height \/ 2.0}, display{display} {}\n\n static constexpr double kImpulse = -0.8, kGravity = 0.1;\n\n double y, dy = kImpulse;\n Display *display;\n\n void gravity() {\n dy += kGravity;\n y += dy;\n }\n\n void poke() { dy = kImpulse; }\n\n void draw() { draw('@'); }\n\n void draw(int c) {\n int h = std::round(y);\n h = std::max(1, std::min(h, display->height - 2));\n mvaddch(h, display->width \/ 2, c);\n }\n\n bool is_alive(World &world) {\n if (y <= 0 || y >= display->height) {\n return false;\n }\n int wall = world.walls[display->width \/ 2 - 1];\n if (wall != 0) {\n return y > wall - World::kVGap && y < wall + World::kVGap;\n }\n return true;\n }\n};\n\nstruct Game {\n Game(Display *display) : display{display}, bird{display}, world{display} {}\n\n Display *display;\n Bird bird;\n World world;\n\n int run() {\n display->erase();\n const char *intro = \"[Press SPACE to hop upwards]\";\n mvprintw(display->height \/ 2 - 2,\n display->width \/ 2 - std::strlen(intro) \/ 2, intro);\n bird.draw();\n display->block_getch();\n while (bird.is_alive(world)) {\n int c = getch();\n if (c == 'q') {\n return -1;\n } else if (c != ERR) {\n while (getch() != ERR)\n ; \/\/ clear repeat buffer\n bird.poke();\n }\n display->erase();\n world.step();\n world.draw();\n bird.gravity();\n bird.draw();\n display->refresh();\n std::this_thread::sleep_for(std::chrono::milliseconds{67});\n }\n bird.draw('X');\n display->refresh();\n return world.score();\n }\n};\n\nvoid print_scores(Display &display, HighScores &scores) {\n mvprintw(0, display.width + 4, \"== High Scores ==\");\n int i = 1;\n for (auto &line : scores.top_scores()) {\n mvprintw(i, display.width + 1, \"%s\", line.name.c_str());\n clrtoeol();\n mvprintw(i, display.width + 24, \"%d\", line.score);\n i++;\n }\n}\n\nint main(int argc, const char **argv) {\n srand(std::time(NULL));\n const char *filename = \"\/tmp\/flappy-scores.db\";\n if (argc > 1) {\n filename = argv[1];\n }\n Display display;\n HighScores scores{filename, display.height};\n\n while (true) {\n Game game{&display};\n\n int score = game.run();\n if (score < 0) {\n return 0; \/\/ game quit early\n }\n\n \/* Game over *\/\n mvprintw(display.height + 1, 0, \"Game over!\");\n print_scores(display, scores);\n\n \/* Enter new high score *\/\n if (scores.is_best(score)) {\n mvprintw(display.height + 2, 0, \"You have a high score!\");\n mvprintw(display.height + 3, 0, \"Enter name: \");\n char name[23] = {0};\n display.read_name(display.height + 3, 12, name, sizeof(name));\n if (std::strlen(name) == 0) {\n std::strcpy(name, \"(anonymous)\");\n }\n scores.insert_score(name, score);\n move(display.height + 3, 0);\n clrtoeol();\n print_scores(display, scores);\n }\n\n \/* Handle quit\/restart *\/\n mvprintw(display.height + 2, 0, \"Press 'q' to quit, 'r' to retry.\");\n int c;\n while ((c = display.block_getch()) != 'r') {\n if (c == 'q' || c == ERR) {\n return 0;\n }\n }\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* tntnet.cpp\n * Copyright (C) 2003-2005 Tommi Maekitalo\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\n\n#include \"tnt\/tntnet.h\"\n#include \"tnt\/worker.h\"\n#include \"tnt\/listener.h\"\n#include \"tnt\/http.h\"\n#include \"tnt\/httpreply.h\"\n#include \"tnt\/sessionscope.h\"\n\n#include <cxxtools\/tcpstream.h>\n#include <cxxtools\/log.h>\n\n#include <config.h>\n\n#ifndef TNTNET_CONF\n# define TNTNET_CONF \"\/etc\/tntnet.conf\"\n#endif\n\n#ifndef TNTNET_PID\n# define TNTNET_PID \"\/var\/run\/tntnet.pid\"\n#endif\n\nlog_define(\"tntnet.tntnet\")\n\nnamespace\n{\n void configureDispatcher(tnt::Dispatcher& dis, const tnt::Tntconfig& config)\n {\n typedef tnt::Dispatcher::CompidentType CompidentType;\n\n const tnt::Tntconfig::config_entries_type& params = config.getConfigValues();\n\n tnt::Tntconfig::config_entries_type::const_iterator vi;\n for (vi = params.begin(); vi != params.end(); ++vi)\n {\n const tnt::Tntconfig::config_entry_type& v = *vi;\n const tnt::Tntconfig::params_type& args = v.params;\n if (v.key == \"MapUrl\")\n {\n if (args.size() < 2)\n {\n std::ostringstream msg;\n msg << \"invalid number of parameters (\" << args.size() << \") in MapUrl\";\n throw std::runtime_error(msg.str());\n }\n\n std::string url = args[0];\n\n CompidentType ci = CompidentType(args[1]);\n if (args.size() > 2)\n {\n ci.setPathInfo(args[2]);\n if (args.size() > 3)\n ci.setArgs(CompidentType::args_type(args.begin() + 3, args.end()));\n }\n\n dis.addUrlMapEntry(std::string(), url, ci);\n }\n else if (v.key == \"VMapUrl\")\n {\n if (args.size() < 3)\n {\n std::ostringstream msg;\n msg << \"invalid number of parameters (\" << args.size() << \") in VMapUrl\";\n throw std::runtime_error(msg.str());\n }\n\n std::string vhost = args[0];\n std::string url = args[1];\n\n CompidentType ci = CompidentType(args[2]);\n if (args.size() > 3)\n {\n ci.setPathInfo(args[3]);\n if (args.size() > 4)\n ci.setArgs(CompidentType::args_type(args.begin() + 4, args.end()));\n }\n\n dis.addUrlMapEntry(vhost, url, ci);\n }\n }\n }\n}\n\nnamespace tnt\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Tntnet\n \/\/\n bool Tntnet::stop = false;\n\n void Tntnet::init(const Tntconfig& config)\n {\n minthreads = config.getValue<unsigned>(\"MinThreads\", 5);\n maxthreads = config.getValue<unsigned>(\"MaxThreads\", 100);\n threadstartdelay = config.getValue<unsigned>(\"ThreadStartDelay\", 10);\n timersleep = config.getValue<unsigned>(\"TimerSleep\", 10);\n Worker::setMinThreads(minthreads);\n Worker::setMaxRequestTime(config.getValue<unsigned>(\"MaxRequestTime\", Worker::getMaxRequestTime()));\n Worker::setEnableCompression(config.getBoolValue(\"EnableCompression\", Worker::getEnableCompression()));\n queue.setCapacity(config.getValue<unsigned>(\"QueueSize\", queue.getCapacity()));\n Sessionscope::setDefaultTimeout(config.getValue<unsigned>(\"SessionTimeout\", Sessionscope::getDefaultTimeout()));\n Listener::setBacklog(config.getValue<int>(\"ListenBacklog\", Listener::getBacklog()));\n Listener::setListenRetry(config.getValue<int>(\"ListenRetry\", Listener::getListenRetry()));\n Dispatcher::setMaxUrlMapCache(config.getValue<unsigned>(\"MaxUrlMapCache\", Dispatcher::getMaxUrlMapCache()));\n\n Tntconfig::config_entries_type configSetEnv;\n config.getConfigValues(\"SetEnv\", configSetEnv);\n for (Tntconfig::config_entries_type::const_iterator it = configSetEnv.begin();\n it != configSetEnv.end(); ++it)\n {\n if (it->params.size() >= 2)\n {\n#ifdef HAVE_SETENV\n log_debug(\"setenv \" << it->params[0] << \"=\\\"\" << it->params[1] << '\"');\n ::setenv(it->params[0].c_str(), it->params[1].c_str(), 1);\n#else\n std::string name = it->params[0];\n std::string value = it->params[1];\n\n char* env = new char[name.size() + value.size() + 2];\n name.copy(env, name.size());\n env[name.size()] = '=';\n value.copy(env + name.size() + 1, value.size());\n env[name.size() + value.size() + 1] = '\\0';\n\n log_debug(\"putenv(\" << env << ')');\n ::putenv(env);\n#endif\n }\n }\n\n configureDispatcher(d_dispatcher, config);\n\n \/\/ configure worker (static)\n Comploader::configure(config);\n\n \/\/ configure http\n HttpMessage::setMaxRequestSize(\n config.getValue(\"MaxRequestSize\", HttpMessage::getMaxRequestSize()));\n Job::setSocketReadTimeout(\n config.getValue(\"SocketReadTimeout\", Job::getSocketReadTimeout()));\n Job::setSocketWriteTimeout(\n config.getValue(\"SocketWriteTimeout\", Job::getSocketWriteTimeout()));\n Job::setKeepAliveMax(\n config.getValue(\"KeepAliveMax\", Job::getKeepAliveMax()));\n Job::setSocketBufferSize(\n config.getValue(\"BufferSize\", Job::getSocketBufferSize()));\n HttpReply::setMinCompressSize(\n config.getValue(\"MinCompressSize\", HttpReply::getMinCompressSize()));\n HttpReply::setKeepAliveTimeout(\n config.getValue(\"KeepAliveTimeout\", HttpReply::getKeepAliveTimeout()));\n HttpReply::setDefaultContentType(\n config.getValue(\"DefaultContentType\", HttpReply::getDefaultContentType()));\n\n \/\/ initialize listeners\n Tntconfig::config_entries_type configListen;\n config.getConfigValues(\"Listen\", configListen);\n\n if (configListen.empty())\n {\n unsigned short int port = (getuid() == 0 ? 80 : 8000);\n log_info(\"no listeners defined - using ip 0.0.0.0 port \" << port);\n listeners.insert(new tnt::Listener(\"0.0.0.0\", port, queue));\n }\n else\n {\n for (Tntconfig::config_entries_type::const_iterator it = configListen.begin();\n it != configListen.end(); ++it)\n {\n if (it->params.empty())\n throw std::runtime_error(\"empty Listen-entry\");\n\n unsigned short int port = 80;\n if (it->params.size() >= 2)\n {\n std::istringstream p(it->params[1]);\n p >> port;\n if (!p)\n {\n std::ostringstream msg;\n msg << \"invalid port \" << it->params[1];\n throw std::runtime_error(msg.str());\n }\n }\n\n std::string ip(it->params[0]);\n log_info(\"listen on ip \" << ip << \" port \" << port);\n listeners.insert(new tnt::Listener(ip, port, queue));\n }\n }\n\n#ifdef USE_SSL\n \/\/ initialize ssl-listener\n std::string defaultCertificateFile = config.getValue(\"SslCertificate\");\n std::string defaultCertificateKey = config.getValue(\"SslKey\");\n configListen.clear();\n config.getConfigValues(\"SslListen\", configListen);\n\n for (Tntconfig::config_entries_type::const_iterator it = configListen.begin();\n it != configListen.end(); ++it)\n {\n if (it->params.empty())\n throw std::runtime_error(\"empty SslListen-entry\");\n\n unsigned short int port = 443;\n if (it->params.size() >= 2)\n {\n std::istringstream p(it->params[1]);\n p >> port;\n if (!p)\n {\n std::ostringstream msg;\n msg << \"invalid port \" << it->params[1];\n throw std::runtime_error(msg.str());\n }\n }\n\n std::string certificateFile =\n it->params.size() >= 3 ? it->params[2]\n : defaultCertificateFile;\n std::string certificateKey =\n it->params.size() >= 4 ? it->params[3] :\n it->params.size() >= 3 ? it->params[2] : defaultCertificateKey;\n\n if (certificateFile.empty())\n throw std::runtime_error(\"Ssl-certificate not configured\");\n\n std::string ip(it->params[0]);\n log_info(\"listen on ip \" << ip << \" port \" << port << \" (ssl)\");\n listeners.insert(new Ssllistener(certificateFile.c_str(),\n certificateKey.c_str(), ip, port, queue));\n }\n#endif \/\/ USE_SSL\n\n log_debug(\"listeners.size()=\" << listeners.size());\n }\n\n void Tntnet::run()\n {\n log_debug(\"worker-process\");\n\n if (listeners.size() > minthreads)\n {\n log_warn(\"need at least one worker per listener - set MinThreads to \" << listeners.size());\n minthreads = listeners.size();\n }\n\n if (maxthreads < minthreads)\n {\n log_warn(\"MaxThreads < MinThreads - set MaxThreads = MinThreads = \" << minthreads);\n maxthreads = minthreads;\n }\n\n \/\/ initialize worker-process\n \/\/ create worker-threads\n log_info(\"create \" << minthreads << \" worker threads\");\n for (unsigned i = 0; i < minthreads; ++i)\n {\n log_debug(\"create worker \" << i);\n Worker* s = new Worker(*this);\n s->create();\n }\n\n \/\/ create poller-thread\n log_debug(\"start poller thread\");\n pollerthread.create();\n\n log_debug(\"start timer thread\");\n cxxtools::MethodThread<Tntnet, cxxtools::AttachedThread> timerThread(*this, &Tntnet::timerTask);\n timerThread.create();\n\n \/\/ mainloop\n cxxtools::Mutex mutex;\n while (!stop)\n {\n {\n cxxtools::MutexLock lock(mutex);\n queue.noWaitThreads.wait(lock);\n }\n\n if (stop)\n break;\n\n if (Worker::getCountThreads() < maxthreads)\n {\n log_info(\"create workerthread\");\n Worker* s = new Worker(*this);\n s->create();\n }\n else\n log_info(\"max worker-threadcount \" << maxthreads << \" reached\");\n\n if (threadstartdelay > 0)\n usleep(threadstartdelay * 1000);\n }\n\n log_warn(\"stopping Tntnet\");\n\n \/\/ join-loop\n while (!listeners.empty())\n {\n listeners_type::value_type s = *listeners.begin();\n log_debug(\"remove listener from listener-list\");\n listeners.erase(s);\n\n log_debug(\"request listener to stop\");\n s->doStop();\n\n delete s;\n\n log_debug(\"listener stopped\");\n }\n\n log_info(\"listeners stopped\");\n }\n\n void Tntnet::timerTask()\n {\n log_debug(\"timer thread\");\n\n while (!stop)\n {\n sleep(timersleep);\n getScopemanager().checkSessionTimeout();\n Worker::timer();\n }\n\n log_warn(\"stopping Tntnet\");\n\n queue.noWaitThreads.signal();\n Worker::setMinThreads(0);\n pollerthread.doStop();\n }\n\n void Tntnet::shutdown()\n {\n stop = true;\n }\n}\n<commit_msg>there must be always one worker thread more than listeners<commit_after>\/* tntnet.cpp\n * Copyright (C) 2003-2005 Tommi Maekitalo\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\n\n#include \"tnt\/tntnet.h\"\n#include \"tnt\/worker.h\"\n#include \"tnt\/listener.h\"\n#include \"tnt\/http.h\"\n#include \"tnt\/httpreply.h\"\n#include \"tnt\/sessionscope.h\"\n\n#include <cxxtools\/tcpstream.h>\n#include <cxxtools\/log.h>\n\n#include <config.h>\n\n#ifndef TNTNET_CONF\n# define TNTNET_CONF \"\/etc\/tntnet.conf\"\n#endif\n\n#ifndef TNTNET_PID\n# define TNTNET_PID \"\/var\/run\/tntnet.pid\"\n#endif\n\nlog_define(\"tntnet.tntnet\")\n\nnamespace\n{\n void configureDispatcher(tnt::Dispatcher& dis, const tnt::Tntconfig& config)\n {\n typedef tnt::Dispatcher::CompidentType CompidentType;\n\n const tnt::Tntconfig::config_entries_type& params = config.getConfigValues();\n\n tnt::Tntconfig::config_entries_type::const_iterator vi;\n for (vi = params.begin(); vi != params.end(); ++vi)\n {\n const tnt::Tntconfig::config_entry_type& v = *vi;\n const tnt::Tntconfig::params_type& args = v.params;\n if (v.key == \"MapUrl\")\n {\n if (args.size() < 2)\n {\n std::ostringstream msg;\n msg << \"invalid number of parameters (\" << args.size() << \") in MapUrl\";\n throw std::runtime_error(msg.str());\n }\n\n std::string url = args[0];\n\n CompidentType ci = CompidentType(args[1]);\n if (args.size() > 2)\n {\n ci.setPathInfo(args[2]);\n if (args.size() > 3)\n ci.setArgs(CompidentType::args_type(args.begin() + 3, args.end()));\n }\n\n dis.addUrlMapEntry(std::string(), url, ci);\n }\n else if (v.key == \"VMapUrl\")\n {\n if (args.size() < 3)\n {\n std::ostringstream msg;\n msg << \"invalid number of parameters (\" << args.size() << \") in VMapUrl\";\n throw std::runtime_error(msg.str());\n }\n\n std::string vhost = args[0];\n std::string url = args[1];\n\n CompidentType ci = CompidentType(args[2]);\n if (args.size() > 3)\n {\n ci.setPathInfo(args[3]);\n if (args.size() > 4)\n ci.setArgs(CompidentType::args_type(args.begin() + 4, args.end()));\n }\n\n dis.addUrlMapEntry(vhost, url, ci);\n }\n }\n }\n}\n\nnamespace tnt\n{\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Tntnet\n \/\/\n bool Tntnet::stop = false;\n\n void Tntnet::init(const Tntconfig& config)\n {\n minthreads = config.getValue<unsigned>(\"MinThreads\", 5);\n maxthreads = config.getValue<unsigned>(\"MaxThreads\", 100);\n threadstartdelay = config.getValue<unsigned>(\"ThreadStartDelay\", 10);\n timersleep = config.getValue<unsigned>(\"TimerSleep\", 10);\n Worker::setMinThreads(minthreads);\n Worker::setMaxRequestTime(config.getValue<unsigned>(\"MaxRequestTime\", Worker::getMaxRequestTime()));\n Worker::setEnableCompression(config.getBoolValue(\"EnableCompression\", Worker::getEnableCompression()));\n queue.setCapacity(config.getValue<unsigned>(\"QueueSize\", queue.getCapacity()));\n Sessionscope::setDefaultTimeout(config.getValue<unsigned>(\"SessionTimeout\", Sessionscope::getDefaultTimeout()));\n Listener::setBacklog(config.getValue<int>(\"ListenBacklog\", Listener::getBacklog()));\n Listener::setListenRetry(config.getValue<int>(\"ListenRetry\", Listener::getListenRetry()));\n Dispatcher::setMaxUrlMapCache(config.getValue<unsigned>(\"MaxUrlMapCache\", Dispatcher::getMaxUrlMapCache()));\n\n Tntconfig::config_entries_type configSetEnv;\n config.getConfigValues(\"SetEnv\", configSetEnv);\n for (Tntconfig::config_entries_type::const_iterator it = configSetEnv.begin();\n it != configSetEnv.end(); ++it)\n {\n if (it->params.size() >= 2)\n {\n#ifdef HAVE_SETENV\n log_debug(\"setenv \" << it->params[0] << \"=\\\"\" << it->params[1] << '\"');\n ::setenv(it->params[0].c_str(), it->params[1].c_str(), 1);\n#else\n std::string name = it->params[0];\n std::string value = it->params[1];\n\n char* env = new char[name.size() + value.size() + 2];\n name.copy(env, name.size());\n env[name.size()] = '=';\n value.copy(env + name.size() + 1, value.size());\n env[name.size() + value.size() + 1] = '\\0';\n\n log_debug(\"putenv(\" << env << ')');\n ::putenv(env);\n#endif\n }\n }\n\n configureDispatcher(d_dispatcher, config);\n\n \/\/ configure worker (static)\n Comploader::configure(config);\n\n \/\/ configure http\n HttpMessage::setMaxRequestSize(\n config.getValue(\"MaxRequestSize\", HttpMessage::getMaxRequestSize()));\n Job::setSocketReadTimeout(\n config.getValue(\"SocketReadTimeout\", Job::getSocketReadTimeout()));\n Job::setSocketWriteTimeout(\n config.getValue(\"SocketWriteTimeout\", Job::getSocketWriteTimeout()));\n Job::setKeepAliveMax(\n config.getValue(\"KeepAliveMax\", Job::getKeepAliveMax()));\n Job::setSocketBufferSize(\n config.getValue(\"BufferSize\", Job::getSocketBufferSize()));\n HttpReply::setMinCompressSize(\n config.getValue(\"MinCompressSize\", HttpReply::getMinCompressSize()));\n HttpReply::setKeepAliveTimeout(\n config.getValue(\"KeepAliveTimeout\", HttpReply::getKeepAliveTimeout()));\n HttpReply::setDefaultContentType(\n config.getValue(\"DefaultContentType\", HttpReply::getDefaultContentType()));\n\n \/\/ initialize listeners\n Tntconfig::config_entries_type configListen;\n config.getConfigValues(\"Listen\", configListen);\n\n if (configListen.empty())\n {\n unsigned short int port = (getuid() == 0 ? 80 : 8000);\n log_info(\"no listeners defined - using ip 0.0.0.0 port \" << port);\n listeners.insert(new tnt::Listener(\"0.0.0.0\", port, queue));\n }\n else\n {\n for (Tntconfig::config_entries_type::const_iterator it = configListen.begin();\n it != configListen.end(); ++it)\n {\n if (it->params.empty())\n throw std::runtime_error(\"empty Listen-entry\");\n\n unsigned short int port = 80;\n if (it->params.size() >= 2)\n {\n std::istringstream p(it->params[1]);\n p >> port;\n if (!p)\n {\n std::ostringstream msg;\n msg << \"invalid port \" << it->params[1];\n throw std::runtime_error(msg.str());\n }\n }\n\n std::string ip(it->params[0]);\n log_info(\"listen on ip \" << ip << \" port \" << port);\n listeners.insert(new tnt::Listener(ip, port, queue));\n }\n }\n\n#ifdef USE_SSL\n \/\/ initialize ssl-listener\n std::string defaultCertificateFile = config.getValue(\"SslCertificate\");\n std::string defaultCertificateKey = config.getValue(\"SslKey\");\n configListen.clear();\n config.getConfigValues(\"SslListen\", configListen);\n\n for (Tntconfig::config_entries_type::const_iterator it = configListen.begin();\n it != configListen.end(); ++it)\n {\n if (it->params.empty())\n throw std::runtime_error(\"empty SslListen-entry\");\n\n unsigned short int port = 443;\n if (it->params.size() >= 2)\n {\n std::istringstream p(it->params[1]);\n p >> port;\n if (!p)\n {\n std::ostringstream msg;\n msg << \"invalid port \" << it->params[1];\n throw std::runtime_error(msg.str());\n }\n }\n\n std::string certificateFile =\n it->params.size() >= 3 ? it->params[2]\n : defaultCertificateFile;\n std::string certificateKey =\n it->params.size() >= 4 ? it->params[3] :\n it->params.size() >= 3 ? it->params[2] : defaultCertificateKey;\n\n if (certificateFile.empty())\n throw std::runtime_error(\"Ssl-certificate not configured\");\n\n std::string ip(it->params[0]);\n log_info(\"listen on ip \" << ip << \" port \" << port << \" (ssl)\");\n listeners.insert(new Ssllistener(certificateFile.c_str(),\n certificateKey.c_str(), ip, port, queue));\n }\n#endif \/\/ USE_SSL\n\n log_debug(\"listeners.size()=\" << listeners.size());\n }\n\n void Tntnet::run()\n {\n log_debug(\"worker-process\");\n\n if (listeners.size() >= minthreads)\n {\n log_warn(\"at least one more worker than listeners needed - set MinThreads to \" << listeners.size() + 1);\n minthreads = listeners.size() + 1;\n }\n\n if (maxthreads < minthreads)\n {\n log_warn(\"MaxThreads < MinThreads - set MaxThreads = MinThreads = \" << minthreads);\n maxthreads = minthreads;\n }\n\n \/\/ initialize worker-process\n \/\/ create worker-threads\n log_info(\"create \" << minthreads << \" worker threads\");\n for (unsigned i = 0; i < minthreads; ++i)\n {\n log_debug(\"create worker \" << i);\n Worker* s = new Worker(*this);\n s->create();\n }\n\n \/\/ create poller-thread\n log_debug(\"start poller thread\");\n pollerthread.create();\n\n log_debug(\"start timer thread\");\n cxxtools::MethodThread<Tntnet, cxxtools::AttachedThread> timerThread(*this, &Tntnet::timerTask);\n timerThread.create();\n\n \/\/ mainloop\n cxxtools::Mutex mutex;\n while (!stop)\n {\n {\n cxxtools::MutexLock lock(mutex);\n queue.noWaitThreads.wait(lock);\n }\n\n if (stop)\n break;\n\n if (Worker::getCountThreads() < maxthreads)\n {\n log_info(\"create workerthread\");\n Worker* s = new Worker(*this);\n s->create();\n }\n else\n log_info(\"max worker-threadcount \" << maxthreads << \" reached\");\n\n if (threadstartdelay > 0)\n usleep(threadstartdelay * 1000);\n }\n\n log_warn(\"stopping Tntnet\");\n\n \/\/ join-loop\n while (!listeners.empty())\n {\n listeners_type::value_type s = *listeners.begin();\n log_debug(\"remove listener from listener-list\");\n listeners.erase(s);\n\n log_debug(\"request listener to stop\");\n s->doStop();\n\n delete s;\n\n log_debug(\"listener stopped\");\n }\n\n log_info(\"listeners stopped\");\n }\n\n void Tntnet::timerTask()\n {\n log_debug(\"timer thread\");\n\n while (!stop)\n {\n sleep(timersleep);\n getScopemanager().checkSessionTimeout();\n Worker::timer();\n }\n\n log_warn(\"stopping Tntnet\");\n\n queue.noWaitThreads.signal();\n Worker::setMinThreads(0);\n pollerthread.doStop();\n }\n\n void Tntnet::shutdown()\n {\n stop = true;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"collectors.h\"\n#include <fstream>\n#include <iostream>\n#include <chrono>\n\nusing namespace watcheD;\nnamespace collectors {\n\nclass CpuSpeedCollector : public Collector {\npublic:\n\tCpuSpeedCollector(std::shared_ptr<HttpServer> p_srv, Json::Value* p_cfg) : Collector(\"cpuspeed\", p_srv, p_cfg) {\n\t\tstd::string\tline;\n\t\tstd::string\tid;\n\t\tstd::ifstream\tinfile(\"\/proc\/cpuinfo\");\n\t\twhile(infile.good() && getline(infile, line)) {\n\t\t\tif (line.substr(0, line.find(\"\\t\")) == \"processor\") {\n\t\t\t\tid = line.substr(line.find(\" \")+1,line.length());\n\t\t\t\taddRessource(id, \"CPU \"+id+\" speed (Mhz)\", \"cpuspeed\");\n\t\t\t\tressources[id]->addProperty(\"MHz\", \"CPU speed (Mhz)\", \"number\");\n\t\t\t}\n\t\t}\n\t\taddGetMetricRoute();\n\t\tif (infile.good())\n\t\t\tinfile.close();\n\t}\n\n\tvoid collect() {\n\t\tstd::string\t\tline;\n\t\tstd::string\t\tvalue;\n\t\tstd::string\t\tid = \"\";\n\t\tstd::ifstream\tinfile(\"\/proc\/cpuinfo\");\n\t\twhile(infile.good() && getline(infile, line)) {\n\t\t\tif (line.substr(0, line.find(\"\\t\")) == \"processor\")\n\t\t\t\tid = line.substr(line.find(\" \")+1,line.length());\n\t\t\telse if (line.substr(0, line.find(\"\\t\")) == \"cpu MHz\" && id != \"\") {\n\t\t\t\tvalue = line.substr(line.find(\" \",6)+1,line.length());\n\t\t\t\tressources[id]->nextValue();\n\t\t\t\tressources[id]->setProperty(\"MHz\", atoi(value.c_str()));\n\t\t\t}\n\t\t}\n\t\tif (infile.good())\n\t\t\tinfile.close();\n\t}\n};\n\nMAKE_PLUGIN_COLLECTOR(CpuSpeedCollector, cpuspeed)\n\n}\n<commit_msg>Improved cpu speed reading<commit_after>#include \"collectors.h\"\n#include <dirent.h>\n#include <sys\/stat.h>\n#include <fstream>\n#include <streambuf>\n#include <iostream>\n#include <chrono>\n\nusing namespace watcheD;\nnamespace collectors {\n\nclass CpuSpeedCollector : public Collector {\npublic:\n\tCpuSpeedCollector(std::shared_ptr<HttpServer> p_srv, Json::Value* p_cfg) : Collector(\"cpuspeed\", p_srv, p_cfg) {\n\t\t\/*std::string\tline;\n\t\tstd::string\tid;\n\t\tstd::ifstream\tinfile(\"\/proc\/cpuinfo\");\n\t\twhile(infile.good() && getline(infile, line)) {\n\t\t\tif (line.substr(0, line.find(\"\\t\")) == \"processor\") {\n\t\t\t\tid = line.substr(line.find(\" \")+1,line.length());\n\t\t\t\taddRessource(id, \"CPU \"+id+\" speed (Mhz)\", \"cpuspeed\");\n\t\t\t\tressources[id]->addProperty(\"MHz\", \"CPU speed (Mhz)\", \"number\");\n\t\t\t}\n\t\t}\n\t\tif (infile.good())\n\t\t\tinfile.close();*\/\n\t\taddGetMetricRoute();\n\t}\n\n\tvoid collect() {\n\t\tconst std::string directory = \"\/sys\/devices\/system\/cpu\/cpufreq\";\n\t\tDIR *dir;\n\t\tstruct dirent *ent;\n\t\tstruct stat st;\n\t\tdir = opendir(directory.c_str());\n\t\tif (dir != NULL) {\n\t\t\twhile ((ent = readdir(dir)) != NULL) {\n\t\t\t\tconst std::string file_name = ent->d_name;\n\t\t\t\tconst std::string full_dir_name = directory + \"\/\" + file_name;\n\t\t\t\tconst std::string full_file_name = full_dir_name+\"\/scaling_cur_freq\";\n\n\t\t\t\tint cpuid = -1;\n\t\t\t\tsscanf( file_name.c_str(), \"%*[^0-9]%d\", &cpuid);\n\t\t\t\tif (cpuid == -1)\n\t\t\t\t\tcontinue;\n\n\t\t\t\tif (file_name[0] == '.')\n\t\t\t\t\tcontinue;\n\t\t\t\tif (stat(full_dir_name.c_str(), &st) == -1)\n\t\t\t\t\tcontinue;\n\t\t\t\tconst bool is_directory = (st.st_mode & S_IFDIR) != 0;\n\t\t\t\tif (!is_directory)\n\t\t\t\t\tcontinue;\n\t\t\t\tif (stat(full_file_name.c_str(), &st) == -1)\n\t\t\t\t\tcontinue;\n\t\t\t\tstd::ifstream t(full_file_name.c_str());\n\t\t\t\tstd::string str;\n\n\t\t\t\t\/\/ reading cpu speed value\n\t\t\t\tt.seekg(0, std::ios::end); \n\t\t\t\tstr.reserve(t.tellg());\n\t\t\t\tt.seekg(0, std::ios::beg);\n\t\t\t\tstr.assign((std::istreambuf_iterator<char>(t)),\n\t\t\t\t\tstd::istreambuf_iterator<char>());\n\t\t\t\tif (ressources.find(file_name) == ressources.end()) {\n\t\t\t\t\taddRessource(file_name, \"CPU \"+std::to_string(cpuid)+\" speed (Mhz)\", \"cpuspeed\");\n\t\t\t\t\tressources[file_name]->addProperty(\"MHz\", \"CPU speed (Mhz)\", \"number\");\n\t\t\t\t}\n\t\t\t\tressources[file_name]->nextValue();\n\t\t\t\tressources[file_name]->setProperty(\"MHz\", atoi(str.c_str())\/1000);\n\n\t\t\t\t\n\t\t\t}\n\t\t\tclosedir(dir);\n\t\t}\n\t\t\/*std::string\t\tline;\n\t\tstd::string\t\tvalue;\n\t\tstd::string\t\tid = \"\";\n\t\tstd::ifstream\tinfile(\"\/proc\/cpuinfo\");\n\t\twhile(infile.good() && getline(infile, line)) {\n\t\t\tif (line.substr(0, line.find(\"\\t\")) == \"processor\")\n\t\t\t\tid = line.substr(line.find(\" \")+1,line.length());\n\t\t\telse if (line.substr(0, line.find(\"\\t\")) == \"cpu MHz\" && id != \"\") {\n\t\t\t\tvalue = line.substr(line.find(\" \",6)+1,line.length());\n\t\t\t\tressources[id]->nextValue();\n\t\t\t\tressources[id]->setProperty(\"MHz\", atoi(value.c_str()));\n\t\t\t}\n\t\t}\n\t\tif (infile.good())\n\t\t\tinfile.close();\n\t\t*\/\n\t}\n};\n\nMAKE_PLUGIN_COLLECTOR(CpuSpeedCollector, cpuspeed)\n\n}\n<|endoftext|>"} {"text":"<commit_before>#line 2 \"togo\/gfx\/types.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Graphics types.\n@ingroup types\n@ingroup gfx\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/utility\/traits.hpp>\n#include <togo\/utility\/utility.hpp>\n\n#include <initializer_list>\n\nnamespace togo {\nnamespace gfx {\n\n\/**\n\t@addtogroup gfx_display\n\t@{\n*\/\n\n\/\/\/ Graphics configuration flags.\nenum class DisplayConfigFlags : unsigned {\n\t\/\/\/ Empty flag.\n\tnone = 0,\n\t\/\/\/ Double-buffered display.\n\tdouble_buffered = 1 << 0,\n};\n\n\/\/\/ Graphics configuration.\n\/\/\/\n\/\/\/ If either msaa_num_buffers or msaa_num_samples are 0, MSAA is\n\/\/\/ disabled.\nstruct DisplayConfig {\n\tstruct ColorBits {\n\t\tunsigned red;\n\t\tunsigned green;\n\t\tunsigned blue;\n\t\tunsigned alpha;\n\t};\n\n\t\/\/\/ Color buffer bits.\n\tgfx::DisplayConfig::ColorBits color_bits;\n\n\t\/\/\/ Depth buffer bits.\n\t\/\/\/ If this is 0, the depth buffer should be assumed unavailable.\n\tunsigned depth_bits;\n\n\t\/\/\/ Stencil buffer bits.\n\t\/\/\/ If this is 0, the stencil buffer should be assumed unavailable.\n\tunsigned stencil_bits;\n\n\t\/\/\/ Number of MSAA buffers.\n\tunsigned msaa_num_buffers;\n\t\/\/\/ Number of MSAA samples.\n\tunsigned msaa_num_samples;\n\n\t\/\/\/ Miscellaneous flags.\n\tgfx::DisplayConfigFlags flags;\n};\n\n\/\/\/ Display flags.\nenum class DisplayFlags : unsigned {\n\t\/\/\/ Empty flag.\n\tnone = 0,\n\t\/\/\/ Center window.\n\tcentered = 1 << 0,\n\t\/\/\/ Border-less window.\n\tborderless = 1 << 1,\n\t\/\/\/ Full-screen window.\n\tfullscreen = 1 << 2,\n\t\/\/\/ Re-sizable window.\n\tresizable = 1 << 3,\n\n\towned_by_input_buffer = 1 << 4,\n};\n\n\/\/\/ Display swap modes.\nenum class DisplaySwapMode : unsigned {\n\t\/\/\/ No screen synchronization.\n\timmediate = 0,\n\n\t\/\/\/ Wait for at least one refresh cycle before swapping.\n\twait_refresh,\n};\n\n\/\/\/ Graphics display.\nstruct Display;\n\n\/** @} *\/ \/\/ end of doc-group gfx_display\n\n\/**\n\t@addtogroup gfx_renderer\n\t@{\n*\/\n\n\/\/ TODO: Documentation & configuration\n#define TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS 16\n\n#define TOGO_GFX_NODE_NUM_COMMANDS 1024\n#define TOGO_GFX_NODE_BUFFER_SIZE 8192\n\n#define TOGO_GFX_CONFIG_NUM_VIEWPORTS 4\n#define TOGO_GFX_CONFIG_NUM_PIPES 8\n#define TOGO_GFX_PIPE_NUM_LAYERS 32\n#define TOGO_GFX_LAYER_NUM_GENERATORS 16\n\n#define TOGO_GFX_NUM_VERTEX_BUFFERS 2048\n#define TOGO_GFX_NUM_INDEX_BUFFERS 2048\n#define TOGO_GFX_NUM_TEXTURES 2048\n#define TOGO_GFX_NUM_UNIFORMS 64\n#define TOGO_GFX_NUM_PROGRAMS 128\n#define TOGO_GFX_NUM_NODES 4\n\n\/\/\/ Buffer data binding mode.\nenum class BufferDataBinding : unsigned {\n\t\/\/\/ Buffer data never changes.\n\tfixed,\n\t\/\/\/ Buffer data changes frequently.\n\tdynamic,\n\n\tNUM\n};\n\n\/\/\/ Render node.\nstruct RenderNode;\n\n\/\/\/ Renderer.\nstruct Renderer;\n\n\/\/\/ Vertex attribute data type.\nenum class VertexAttribType : unsigned {\n\tf32, f64,\n\tu8, u16, u32,\n};\n\n\/\/\/ Unpacked vertex attribute.\nstruct VertexAttrib {\n\tgfx::VertexAttribType type;\n\tunsigned num_components;\n\tbool normalize_fixed;\n};\n\n\/\/ TODO: Encode attribute data to an integer to save memory\n\/\/ TODO: Utilize C++14 constexpr features for compile-time construction\n\/\/\/ Vertex format.\nstruct VertexFormat {\n\tu32_fast _num_attribs;\n\tu32_fast _stride;\n\tgfx::VertexAttrib _attribs[TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS];\n\tu8 _offsets[TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS];\n\n\tinline \/*constexpr*\/ VertexFormat(\n\t\tstd::initializer_list<gfx::VertexAttrib> const ilist\n\t) noexcept\n\t\t: _num_attribs(0)\n\t\t, _stride(0)\n\t\t, _attribs()\n\t\t, _offsets()\n\t{\n\t\tstatic constexpr unsigned const\n\t\tattrib_type_size[]{\n\t\t\tsizeof(f32), sizeof(f64),\n\t\t\tsizeof(u8), sizeof(u16), sizeof(u32)\n\t\t};\n\t\tfor (auto const& attrib : ilist) {\n\t\t\t_attribs[_num_attribs] = attrib;\n\t\t\t_offsets[_num_attribs] = _stride;\n\t\t\t_stride += attrib_type_size[unsigned_cast(attrib.type)] * attrib.num_components;\n\t\t\t++_num_attribs;\n\t\t}\n\t}\n};\n\nenum : u32 {\n\t\/\/\/ Null resource ID.\n\tID_VALUE_NULL = 0,\n};\n\n\/** @cond INTERNAL *\/\nstruct VertexBuffer;\nstruct IndexBuffer;\nstruct Texture;\nstruct Uniform;\nstruct Shader;\n\ntemplate<class \/*R*\/>\nstruct ResourceID {\n\tu32 _value;\n};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ Vertex buffer ID.\nusing VertexBufferID = ResourceID<VertexBuffer>;\n\n\/\/\/ Index buffer ID.\nusing IndexBufferID = ResourceID<IndexBuffer>;\n\n\/\/\/ Texture ID.\nusing TextureID = ResourceID<Texture>;\n\n\/\/\/ Uniform ID.\nusing UniformID = ResourceID<Uniform>;\n\n\/\/\/ Shader ID.\nusing ShaderID = ResourceID<Shader>;\n\n\/** @} *\/ \/\/ end of doc-group gfx_renderer\n\n} \/\/ namespace gfx\n\n\/** @cond INTERNAL *\/\ntemplate<>\nstruct enable_enum_bitwise_ops<gfx::DisplayConfigFlags> : true_type {};\n\ntemplate<>\nstruct enable_enum_bitwise_ops<gfx::DisplayFlags> : true_type {};\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\n<commit_msg>gfx\/types: changed TOGO_GFX_CONFIG_NUM_VIEWPORTS to 8.<commit_after>#line 2 \"togo\/gfx\/types.hpp\"\n\/**\n@copyright MIT license; see @ref index or the accompanying LICENSE file.\n\n@file\n@brief Graphics types.\n@ingroup types\n@ingroup gfx\n*\/\n\n#pragma once\n\n#include <togo\/config.hpp>\n#include <togo\/types.hpp>\n#include <togo\/utility\/traits.hpp>\n#include <togo\/utility\/utility.hpp>\n\n#include <initializer_list>\n\nnamespace togo {\nnamespace gfx {\n\n\/**\n\t@addtogroup gfx_display\n\t@{\n*\/\n\n\/\/\/ Graphics configuration flags.\nenum class DisplayConfigFlags : unsigned {\n\t\/\/\/ Empty flag.\n\tnone = 0,\n\t\/\/\/ Double-buffered display.\n\tdouble_buffered = 1 << 0,\n};\n\n\/\/\/ Graphics configuration.\n\/\/\/\n\/\/\/ If either msaa_num_buffers or msaa_num_samples are 0, MSAA is\n\/\/\/ disabled.\nstruct DisplayConfig {\n\tstruct ColorBits {\n\t\tunsigned red;\n\t\tunsigned green;\n\t\tunsigned blue;\n\t\tunsigned alpha;\n\t};\n\n\t\/\/\/ Color buffer bits.\n\tgfx::DisplayConfig::ColorBits color_bits;\n\n\t\/\/\/ Depth buffer bits.\n\t\/\/\/ If this is 0, the depth buffer should be assumed unavailable.\n\tunsigned depth_bits;\n\n\t\/\/\/ Stencil buffer bits.\n\t\/\/\/ If this is 0, the stencil buffer should be assumed unavailable.\n\tunsigned stencil_bits;\n\n\t\/\/\/ Number of MSAA buffers.\n\tunsigned msaa_num_buffers;\n\t\/\/\/ Number of MSAA samples.\n\tunsigned msaa_num_samples;\n\n\t\/\/\/ Miscellaneous flags.\n\tgfx::DisplayConfigFlags flags;\n};\n\n\/\/\/ Display flags.\nenum class DisplayFlags : unsigned {\n\t\/\/\/ Empty flag.\n\tnone = 0,\n\t\/\/\/ Center window.\n\tcentered = 1 << 0,\n\t\/\/\/ Border-less window.\n\tborderless = 1 << 1,\n\t\/\/\/ Full-screen window.\n\tfullscreen = 1 << 2,\n\t\/\/\/ Re-sizable window.\n\tresizable = 1 << 3,\n\n\towned_by_input_buffer = 1 << 4,\n};\n\n\/\/\/ Display swap modes.\nenum class DisplaySwapMode : unsigned {\n\t\/\/\/ No screen synchronization.\n\timmediate = 0,\n\n\t\/\/\/ Wait for at least one refresh cycle before swapping.\n\twait_refresh,\n};\n\n\/\/\/ Graphics display.\nstruct Display;\n\n\/** @} *\/ \/\/ end of doc-group gfx_display\n\n\/**\n\t@addtogroup gfx_renderer\n\t@{\n*\/\n\n\/\/ TODO: Documentation & configuration\n#define TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS 16\n\n#define TOGO_GFX_NODE_NUM_COMMANDS 1024\n#define TOGO_GFX_NODE_BUFFER_SIZE 8192\n\n#define TOGO_GFX_CONFIG_NUM_PIPES 8\n#define TOGO_GFX_CONFIG_NUM_VIEWPORTS 8\n#define TOGO_GFX_PIPE_NUM_LAYERS 32\n#define TOGO_GFX_LAYER_NUM_GENERATORS 16\n\n#define TOGO_GFX_NUM_VERTEX_BUFFERS 2048\n#define TOGO_GFX_NUM_INDEX_BUFFERS 2048\n#define TOGO_GFX_NUM_TEXTURES 2048\n#define TOGO_GFX_NUM_UNIFORMS 64\n#define TOGO_GFX_NUM_PROGRAMS 128\n#define TOGO_GFX_NUM_NODES 4\n\n\/\/\/ Buffer data binding mode.\nenum class BufferDataBinding : unsigned {\n\t\/\/\/ Buffer data never changes.\n\tfixed,\n\t\/\/\/ Buffer data changes frequently.\n\tdynamic,\n\n\tNUM\n};\n\n\/\/\/ Render node.\nstruct RenderNode;\n\n\/\/\/ Renderer.\nstruct Renderer;\n\n\/\/\/ Vertex attribute data type.\nenum class VertexAttribType : unsigned {\n\tf32, f64,\n\tu8, u16, u32,\n};\n\n\/\/\/ Unpacked vertex attribute.\nstruct VertexAttrib {\n\tgfx::VertexAttribType type;\n\tunsigned num_components;\n\tbool normalize_fixed;\n};\n\n\/\/ TODO: Encode attribute data to an integer to save memory\n\/\/ TODO: Utilize C++14 constexpr features for compile-time construction\n\/\/\/ Vertex format.\nstruct VertexFormat {\n\tu32_fast _num_attribs;\n\tu32_fast _stride;\n\tgfx::VertexAttrib _attribs[TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS];\n\tu8 _offsets[TOGO_GFX_VERTEXFORMAT_NUM_ATTRIBS];\n\n\tinline \/*constexpr*\/ VertexFormat(\n\t\tstd::initializer_list<gfx::VertexAttrib> const ilist\n\t) noexcept\n\t\t: _num_attribs(0)\n\t\t, _stride(0)\n\t\t, _attribs()\n\t\t, _offsets()\n\t{\n\t\tstatic constexpr unsigned const\n\t\tattrib_type_size[]{\n\t\t\tsizeof(f32), sizeof(f64),\n\t\t\tsizeof(u8), sizeof(u16), sizeof(u32)\n\t\t};\n\t\tfor (auto const& attrib : ilist) {\n\t\t\t_attribs[_num_attribs] = attrib;\n\t\t\t_offsets[_num_attribs] = _stride;\n\t\t\t_stride += attrib_type_size[unsigned_cast(attrib.type)] * attrib.num_components;\n\t\t\t++_num_attribs;\n\t\t}\n\t}\n};\n\nenum : u32 {\n\t\/\/\/ Null resource ID.\n\tID_VALUE_NULL = 0,\n};\n\n\/** @cond INTERNAL *\/\nstruct VertexBuffer;\nstruct IndexBuffer;\nstruct Texture;\nstruct Uniform;\nstruct Shader;\n\ntemplate<class \/*R*\/>\nstruct ResourceID {\n\tu32 _value;\n};\n\/** @endcond *\/ \/\/ INTERNAL\n\n\/\/\/ Vertex buffer ID.\nusing VertexBufferID = ResourceID<VertexBuffer>;\n\n\/\/\/ Index buffer ID.\nusing IndexBufferID = ResourceID<IndexBuffer>;\n\n\/\/\/ Texture ID.\nusing TextureID = ResourceID<Texture>;\n\n\/\/\/ Uniform ID.\nusing UniformID = ResourceID<Uniform>;\n\n\/\/\/ Shader ID.\nusing ShaderID = ResourceID<Shader>;\n\n\/** @} *\/ \/\/ end of doc-group gfx_renderer\n\n} \/\/ namespace gfx\n\n\/** @cond INTERNAL *\/\ntemplate<>\nstruct enable_enum_bitwise_ops<gfx::DisplayConfigFlags> : true_type {};\n\ntemplate<>\nstruct enable_enum_bitwise_ops<gfx::DisplayFlags> : true_type {};\n\/** @endcond *\/ \/\/ INTERNAL\n\n} \/\/ namespace togo\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"product.h\"\n\nvoid test_product_large()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( product(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_2( product(MatrixXd(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_3( product(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_4( product(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2), internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2))) );\n CALL_SUBTEST_5( product(Matrix<float,Dynamic,Dynamic,RowMajor>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n\n#if defined EIGEN_TEST_PART_6\n {\n \/\/ test a specific issue in DiagonalProduct\n int N = 1000000;\n VectorXf v = VectorXf::Ones(N);\n MatrixXf m = MatrixXf::Ones(N,3);\n m = (v+v).asDiagonal() * m;\n VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2));\n }\n\n {\n \/\/ test deferred resizing in Matrix::operator=\n MatrixXf a = MatrixXf::Random(10,4), b = MatrixXf::Random(4,10), c = a;\n VERIFY_IS_APPROX((a = a * b), (c * b).eval());\n }\n\n {\n \/\/ check the functions to setup blocking sizes compile and do not segfault\n \/\/ FIXME check they do what they are supposed to do !!\n std::ptrdiff_t l1 = internal::random<int>(10000,20000);\n std::ptrdiff_t l2 = internal::random<int>(1000000,2000000);\n setCpuCacheSizes(l1,l2);\n VERIFY(l1==l1CacheSize());\n VERIFY(l2==l2CacheSize());\n std::ptrdiff_t k1 = internal::random<int>(10,100)*16;\n std::ptrdiff_t m1 = internal::random<int>(10,100)*16;\n std::ptrdiff_t n1 = internal::random<int>(10,100)*16;\n \/\/ only makes sure it compiles fine\n internal::computeProductBlockingSizes<float,float>(k1,m1,n1);\n }\n\n {\n \/\/ test regression in row-vector by matrix (bad Map type)\n MatrixXf mat1(10,32); mat1.setRandom();\n MatrixXf mat2(32,32); mat2.setRandom();\n MatrixXf r1 = mat1.row(2)*mat2.transpose();\n VERIFY_IS_APPROX(r1, (mat1.row(2)*mat2.transpose()).eval());\n\n MatrixXf r2 = mat1.row(2)*mat2;\n VERIFY_IS_APPROX(r2, (mat1.row(2)*mat2).eval());\n }\n#endif\n}\n<commit_msg>Regression test for bug 714. Note that the bug only occurs on some compilers and is not fixed yet<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2006-2008 Benoit Jacob <jacob.benoit.1@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"product.h\"\n\nvoid test_product_large()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( product(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_2( product(MatrixXd(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_3( product(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_4( product(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2), internal::random<int>(1,EIGEN_TEST_MAX_SIZE\/2))) );\n CALL_SUBTEST_5( product(Matrix<float,Dynamic,Dynamic,RowMajor>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n\n#if defined EIGEN_TEST_PART_6\n {\n \/\/ test a specific issue in DiagonalProduct\n int N = 1000000;\n VectorXf v = VectorXf::Ones(N);\n MatrixXf m = MatrixXf::Ones(N,3);\n m = (v+v).asDiagonal() * m;\n VERIFY_IS_APPROX(m, MatrixXf::Constant(N,3,2));\n }\n\n {\n \/\/ test deferred resizing in Matrix::operator=\n MatrixXf a = MatrixXf::Random(10,4), b = MatrixXf::Random(4,10), c = a;\n VERIFY_IS_APPROX((a = a * b), (c * b).eval());\n }\n\n {\n \/\/ check the functions to setup blocking sizes compile and do not segfault\n \/\/ FIXME check they do what they are supposed to do !!\n std::ptrdiff_t l1 = internal::random<int>(10000,20000);\n std::ptrdiff_t l2 = internal::random<int>(1000000,2000000);\n setCpuCacheSizes(l1,l2);\n VERIFY(l1==l1CacheSize());\n VERIFY(l2==l2CacheSize());\n std::ptrdiff_t k1 = internal::random<int>(10,100)*16;\n std::ptrdiff_t m1 = internal::random<int>(10,100)*16;\n std::ptrdiff_t n1 = internal::random<int>(10,100)*16;\n \/\/ only makes sure it compiles fine\n internal::computeProductBlockingSizes<float,float>(k1,m1,n1);\n }\n\n {\n \/\/ test regression in row-vector by matrix (bad Map type)\n MatrixXf mat1(10,32); mat1.setRandom();\n MatrixXf mat2(32,32); mat2.setRandom();\n MatrixXf r1 = mat1.row(2)*mat2.transpose();\n VERIFY_IS_APPROX(r1, (mat1.row(2)*mat2.transpose()).eval());\n\n MatrixXf r2 = mat1.row(2)*mat2;\n VERIFY_IS_APPROX(r2, (mat1.row(2)*mat2).eval());\n }\n#endif\n\n \/\/ Regression test for bug 714:\n#ifdef EIGEN_HAS_OPENMP\n std::cout << \"Testing omp_set_dynamic(1)\\n\";\n omp_set_dynamic(1);\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_6( product(Matrix<float,Dynamic,Dynamic>(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright © 2017 INFN Torino - INDIGO-DataCloud\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"PriorityManager.h\"\n\n#include <stdlib.h>\n#include <signal.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <pwd.h>\n#include <pthread.h>\n#include <errno.h>\n\/\/ booh #include <time.h>\n#include <stdexcept>\n#include <cmath>\n#include <iomanip>\n#include <ctime>\n#include <climits>\n#include <list>\n#include \"Fass.h\"\n#include \"FassLog.h\"\n#include \"VMPool.h\"\n#include \"VirtualMachine.h\"\n\/\/ #include \"InitShares.h\"\n#include <boost\/algorithm\/string\/classification.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n\nlist<PriorityManager::user*> PriorityManager::user_list;\n\n\/\/ unary operator\nPriorityManager::user*\nPriorityManager::make_user(\n const std::string& user_group_share, const int& sum) {\n vector< string > tokens;\n boost::split(tokens, user_group_share, boost::is_any_of(\":\"));\n\n if ( 4 != tokens.size() ) {\n throw;\n }\n\n PriorityManager::user *us = new PriorityManager::user(\n boost::lexical_cast<int16_t>(tokens[1]),\n boost::lexical_cast<int16_t>(tokens[2]),\n boost::lexical_cast<float_t>(tokens[3])\/sum);\n\n return us;\n}\n\nPriorityManager::PriorityManager(\n const string _one_xmlrpc,\n const string _one_secret,\n int _message_size,\n int _timeout,\n unsigned int _max_vm,\n vector<string> _shares,\n int _manager_timer):\n one_xmlrpc(_one_xmlrpc),\n one_secret(_one_secret),\n message_size(_message_size),\n timeout(_timeout),\n max_vm(_max_vm),\n shares(_shares),\n manager_timer(_manager_timer),\n stop_manager(false) {\n \/\/ initialize XML-RPC Client\n ostringstream oss;\n int rc;\n\n try {\n XMLRPCClient::initialize(one_secret, one_xmlrpc, message_size, timeout);\n\n client = XMLRPCClient::client();\n\n oss << \"XML-RPC client using \"\n << (XMLRPCClient::client())->get_message_size()\n << \" bytes for response buffer.\" << endl;\n\n FassLog::log(\"PM\", Log::INFO, oss);\n }\n catch(runtime_error &) {\n throw;\n }\n\n \/\/ create list of user objects with initial shares\n rc = calculate_initial_shares();\n\n if (!rc) {\n FassLog::log(\"PM\", Log::ERROR, \"Could not evaluate initial shares.\");\n }\n}\n\nextern \"C\" void * pm_loop(void *arg) {\n PriorityManager * pm;\n\n if ( arg == 0 ) {\n return 0;\n }\n\n FassLog::log(\"PM\", Log::INFO, \"Priority Manager started.\");\n\n pm = static_cast<PriorityManager *>(arg);\n\n \/\/ set thread cancel state\n pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, 0);\n pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, 0);\n\n \/\/ here the actual loop happens\n int rc;\n struct timespec timeout;\n\n ostringstream oss;\n \/\/ oss << \"Manager timer is: \" << pm->manager_timer;\n \/\/ FassLog::log(\"SARA\", Log::INFO, oss);\n\n \/\/ actual loop\n while (!pm->stop_manager) {\n bool wait = true;\n timeout.tv_sec = time(NULL) + pm->manager_timer;\n timeout.tv_nsec = 0;\n\n \/\/ FassLog::log(\"SARA\", Log::INFO, \"Pippo!\");\n\n pm->lock();\n while (wait && !pm->stop_manager) { \/\/ block for manager_timer seconds\n rc = pthread_cond_timedwait(&pm->cond, &pm->mutex, &timeout);\n \/\/ ostringstream oss;\n \/\/ oss << \"Timedwait return value: \" << rc;\n \/\/ FassLog::log(\"SARA\",Log::INFO, oss);\n\n if ( rc == ETIMEDOUT ) wait = false;\n }\n\n \/\/ FassLog::log(\"SARA\", Log::INFO, \"Pluto!\");\n pm->unlock();\n\n\n pm->loop();\n }\n\n FassLog::log(\"PM\", Log::INFO, \"Priority Manager stopped.\");\n\n return 0;\n}\n\nvoid PriorityManager::loop() {\n FassLog::log(\"SARA\", Log::INFO, \"PRIORITY MANAGER LOOP\");\n\n int rc;\n \/\/ let's get the list of pending VMs from ONE\n rc = get_pending();\n\n if ( rc != 0 ) {\n FassLog::log(\"PM\", Log::ERROR, \"Cannot get the VM pool!\");\n }\n\n \/\/ return an xml string with reordered VMs\n rc = set_queue();\n\n if ( !rc ) {\n FassLog::log(\"PM\", Log::ERROR, \"Cannot set the VM pool!\");\n }\n\n \/\/ do_prioritize();\n}\n\nbool PriorityManager::set_queue() {\n queue = \"pippo\";\n\n return true;\n}\n\nint PriorityManager::start() {\n pthread_attr_t pattr;\n ostringstream oss;\n \/\/ int rc;\n\n FassLog::log(\"PM\", Log::INFO, \"Starting Priority Manager...\");\n\n\n pthread_attr_init(&pattr);\n pthread_attr_setdetachstate(&pattr, PTHREAD_CREATE_JOINABLE);\n\n pthread_create(&pm_thread, &pattr, pm_loop, reinterpret_cast<void *>(this));\n\n return true;\n}\n\nint PriorityManager::get_pending() {\n FassLog::log(\"PM\", Log::DEBUG, \"Executing get_pending...\");\n int rc;\n \/\/ VM pool\n \/\/ TODO(valzacc or svallero): is it needed?\n bool live_resched = true;\n vmpool = new VMPool(client, max_vm, live_resched);\n\n \/\/ cleans the cache and gets the VM pool\n rc = vmpool->set_up();\n \/\/ TODO(svallero): real return code\n return rc;\n}\n\n\/*\nvoid PriorityManager::do_prioritize() {\n FassLog::log(\"PM\", Log::INFO, \"Executing do_prioritize...\");\n int rc;\n ostringstream oss;\n\n VirtualMachine * vm;\n\n int oid;\n int uid;\n int gid;\n int vm_memory;\n int vm_cpu;\n\/\/ list<user> user_list;\n\n const map<int, VirtualMachine*> pending_vms = vmpool->get_objects();\n\n time_t time_start = time(0);\n time_t time_end = time(0);\n\n tm tmp_tm = *localtime(&time_start);\n\n int start_month = 1; \/\/ January\n int start_year = 2016; \/\/ TODO Make this number settable in the config file \n \n float vm_prio = 1.0; \/\/ value from 0 to 1\n\n tmp_tm.tm_sec = 0;\n tmp_tm.tm_min = 0;\n tmp_tm.tm_hour = 0;\n tmp_tm.tm_mday = 1;\n tmp_tm.tm_mon = start_month - 1;\n tmp_tm.tm_year = start_year - 1900;\n tmp_tm.tm_isdst = -1; \/\/ Unknown daylight saving time\n\n time_start = mktime(&tmp_tm);\n\n \/\/ first param is the filter flag: \n \/\/ -3: Connected user resources\n \/\/ -2: All resources\n \/\/ -1: Connected user and his group resources \n \/\/ 0: UID User Resources\n \n \/\/client->call(\"one.vmpool.accounting\", \"iii\", &result, 0, time_start, time_end); \/\/ how to use this info? TODO with Sara\n\n\n map<int, VirtualMachine*>::const_iterator vm_it;\n\n oss << \"Scheduling Results:\" << endl;\n\n for (vm_it=pending_vms.begin(); vm_it != pending_vms.end(); vm_it++) {\n\n vm = static_cast<VirtualMachine*>(vm_it->second);\n \n vm->get_requirements(vm_cpu, vm_memory);\n oid = vm->get_oid(); \n vm->get_uid();\n vm->get_gid();\n\/\/ vm->get_state(); \n\/\/ \/\/ I think that this is not relevant \n\/\/ \/\/ vm->get_rank(); \n \t \n \/\/oss << *vm;\n oss << oid << \" \";\n \/\/FassLog::log(\"PM\", Log::INFO, oss);\n }\n FassLog::log(\"PM\", Log::INFO, oss);\n\n \n\/\/ oss << \"\\tNumber of VMs: \"\n\/\/ << pending_vms.size() << endl;\n\n\/\/ FassLog::log(\"PM\", Log::INFO, oss);\n\n\n\/\/ \/\/shares retrieved in Fass class and passed into pm \n\n\n\/\/ PluginBasic::update_prio(oid, uid, gid, vm_cpu, vm_memory, list_of_users, &vm_prio); \/\/ TODO we miss historical usage U\n\n return;\n}\n*\/\n\nbool PriorityManager::calculate_initial_shares() {\n FassLog::log(\"PM\", Log::INFO, \"Evaluating initial shares...\");\n\n \/\/ TODO(svallero or valzacc):\n \/\/ for the time being only user shares are considered\n vector<string> norm_shares;\n int sum = 0;\n for (vector<string>::const_iterator i= shares.begin();\n i != shares.end(); i++) {\n vector<string> tokens;\n boost::split(tokens, *i, boost::is_any_of(\":\"));\n sum += boost::lexical_cast<int16_t>(tokens[3]);\n }\n\n for (vector<string>::const_iterator i= shares.begin();\n i != shares.end(); i++) {\n user_list.push_back(make_user(*i , sum));\n }\n\n ostringstream oss;\n oss << \"\" << endl;\n for (list<user*>::const_iterator i = user_list.begin();\n i != user_list.end(); ++i) {\n oss << (*i)->userID << \" \"\n << (*i)->groupID << \" \"\n << (*i)->share << endl;\n }\n \n FassLog::log(\"SARA\", Log::INFO, oss);\n\n return true;\n}\n\n\n<commit_msg>Codestyle<commit_after>\/**\n * Copyright © 2017 INFN Torino - INDIGO-DataCloud\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"PriorityManager.h\"\n\n#include <stdlib.h>\n#include <signal.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <pwd.h>\n#include <pthread.h>\n#include <errno.h>\n\/\/ booh #include <time.h>\n#include <stdexcept>\n#include <cmath>\n#include <iomanip>\n#include <ctime>\n#include <climits>\n#include <list>\n#include \"Fass.h\"\n#include \"FassLog.h\"\n#include \"VMPool.h\"\n#include \"VirtualMachine.h\"\n\/\/ #include \"InitShares.h\"\n#include <boost\/algorithm\/string\/classification.hpp>\n#include <boost\/algorithm\/string\/split.hpp>\n\nlist<PriorityManager::user*> PriorityManager::user_list;\n\n\/\/ unary operator\nPriorityManager::user*\nPriorityManager::make_user(\n const std::string& user_group_share, const int& sum) {\n vector< string > tokens;\n boost::split(tokens, user_group_share, boost::is_any_of(\":\"));\n\n if ( 4 != tokens.size() ) {\n throw;\n }\n\n PriorityManager::user *us = new PriorityManager::user(\n boost::lexical_cast<int16_t>(tokens[1]),\n boost::lexical_cast<int16_t>(tokens[2]),\n boost::lexical_cast<float_t>(tokens[3])\/sum);\n\n return us;\n}\n\nPriorityManager::PriorityManager(\n const string _one_xmlrpc,\n const string _one_secret,\n int _message_size,\n int _timeout,\n unsigned int _max_vm,\n vector<string> _shares,\n int _manager_timer):\n one_xmlrpc(_one_xmlrpc),\n one_secret(_one_secret),\n message_size(_message_size),\n timeout(_timeout),\n max_vm(_max_vm),\n shares(_shares),\n manager_timer(_manager_timer),\n stop_manager(false) {\n \/\/ initialize XML-RPC Client\n ostringstream oss;\n int rc;\n\n try {\n XMLRPCClient::initialize(one_secret, one_xmlrpc, message_size, timeout);\n\n client = XMLRPCClient::client();\n\n oss << \"XML-RPC client using \"\n << (XMLRPCClient::client())->get_message_size()\n << \" bytes for response buffer.\" << endl;\n\n FassLog::log(\"PM\", Log::INFO, oss);\n }\n catch(runtime_error &) {\n throw;\n }\n\n \/\/ create list of user objects with initial shares\n rc = calculate_initial_shares();\n\n if (!rc) {\n FassLog::log(\"PM\", Log::ERROR, \"Could not evaluate initial shares.\");\n }\n}\n\nextern \"C\" void * pm_loop(void *arg) {\n PriorityManager * pm;\n\n if ( arg == 0 ) {\n return 0;\n }\n\n FassLog::log(\"PM\", Log::INFO, \"Priority Manager started.\");\n\n pm = static_cast<PriorityManager *>(arg);\n\n \/\/ set thread cancel state\n pthread_setcancelstate(PTHREAD_CANCEL_ENABLE, 0);\n pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, 0);\n\n \/\/ here the actual loop happens\n int rc;\n struct timespec timeout;\n\n ostringstream oss;\n \/\/ oss << \"Manager timer is: \" << pm->manager_timer;\n \/\/ FassLog::log(\"SARA\", Log::INFO, oss);\n\n \/\/ actual loop\n while (!pm->stop_manager) {\n bool wait = true;\n timeout.tv_sec = time(NULL) + pm->manager_timer;\n timeout.tv_nsec = 0;\n\n \/\/ FassLog::log(\"SARA\", Log::INFO, \"Pippo!\");\n\n pm->lock();\n while (wait && !pm->stop_manager) { \/\/ block for manager_timer seconds\n rc = pthread_cond_timedwait(&pm->cond, &pm->mutex, &timeout);\n \/\/ ostringstream oss;\n \/\/ oss << \"Timedwait return value: \" << rc;\n \/\/ FassLog::log(\"SARA\",Log::INFO, oss);\n\n if ( rc == ETIMEDOUT ) wait = false;\n }\n\n \/\/ FassLog::log(\"SARA\", Log::INFO, \"Pluto!\");\n pm->unlock();\n\n\n pm->loop();\n }\n\n FassLog::log(\"PM\", Log::INFO, \"Priority Manager stopped.\");\n\n return 0;\n}\n\nvoid PriorityManager::loop() {\n FassLog::log(\"SARA\", Log::INFO, \"PRIORITY MANAGER LOOP\");\n\n int rc;\n \/\/ let's get the list of pending VMs from ONE\n rc = get_pending();\n\n if ( rc != 0 ) {\n FassLog::log(\"PM\", Log::ERROR, \"Cannot get the VM pool!\");\n }\n\n \/\/ return an xml string with reordered VMs\n rc = set_queue();\n\n if ( !rc ) {\n FassLog::log(\"PM\", Log::ERROR, \"Cannot set the VM pool!\");\n }\n\n \/\/ do_prioritize();\n}\n\nbool PriorityManager::set_queue() {\n queue = \"pippo\";\n\n return true;\n}\n\nint PriorityManager::start() {\n pthread_attr_t pattr;\n ostringstream oss;\n \/\/ int rc;\n\n FassLog::log(\"PM\", Log::INFO, \"Starting Priority Manager...\");\n\n\n pthread_attr_init(&pattr);\n pthread_attr_setdetachstate(&pattr, PTHREAD_CREATE_JOINABLE);\n\n pthread_create(&pm_thread, &pattr, pm_loop, reinterpret_cast<void *>(this));\n\n return true;\n}\n\nint PriorityManager::get_pending() {\n FassLog::log(\"PM\", Log::DEBUG, \"Executing get_pending...\");\n int rc;\n \/\/ VM pool\n \/\/ TODO(valzacc or svallero): is it needed?\n bool live_resched = true;\n vmpool = new VMPool(client, max_vm, live_resched);\n\n \/\/ cleans the cache and gets the VM pool\n rc = vmpool->set_up();\n \/\/ TODO(svallero): real return code\n return rc;\n}\n\n\/*\nvoid PriorityManager::do_prioritize() {\n FassLog::log(\"PM\", Log::INFO, \"Executing do_prioritize...\");\n int rc;\n ostringstream oss;\n\n VirtualMachine * vm;\n\n int oid;\n int uid;\n int gid;\n int vm_memory;\n int vm_cpu;\n\/\/ list<user> user_list;\n\n const map<int, VirtualMachine*> pending_vms = vmpool->get_objects();\n\n time_t time_start = time(0);\n time_t time_end = time(0);\n\n tm tmp_tm = *localtime(&time_start);\n\n int start_month = 1; \/\/ January\n int start_year = 2016; \/\/ TODO Make this number settable in the config file \n \n float vm_prio = 1.0; \/\/ value from 0 to 1\n\n tmp_tm.tm_sec = 0;\n tmp_tm.tm_min = 0;\n tmp_tm.tm_hour = 0;\n tmp_tm.tm_mday = 1;\n tmp_tm.tm_mon = start_month - 1;\n tmp_tm.tm_year = start_year - 1900;\n tmp_tm.tm_isdst = -1; \/\/ Unknown daylight saving time\n\n time_start = mktime(&tmp_tm);\n\n \/\/ first param is the filter flag: \n \/\/ -3: Connected user resources\n \/\/ -2: All resources\n \/\/ -1: Connected user and his group resources \n \/\/ 0: UID User Resources\n \n \/\/client->call(\"one.vmpool.accounting\", \"iii\", &result, 0, time_start, time_end); \/\/ how to use this info? TODO with Sara\n\n\n map<int, VirtualMachine*>::const_iterator vm_it;\n\n oss << \"Scheduling Results:\" << endl;\n\n for (vm_it=pending_vms.begin(); vm_it != pending_vms.end(); vm_it++) {\n\n vm = static_cast<VirtualMachine*>(vm_it->second);\n \n vm->get_requirements(vm_cpu, vm_memory);\n oid = vm->get_oid(); \n vm->get_uid();\n vm->get_gid();\n\/\/ vm->get_state(); \n\/\/ \/\/ I think that this is not relevant \n\/\/ \/\/ vm->get_rank(); \n \t \n \/\/oss << *vm;\n oss << oid << \" \";\n \/\/FassLog::log(\"PM\", Log::INFO, oss);\n }\n FassLog::log(\"PM\", Log::INFO, oss);\n\n \n\/\/ oss << \"\\tNumber of VMs: \"\n\/\/ << pending_vms.size() << endl;\n\n\/\/ FassLog::log(\"PM\", Log::INFO, oss);\n\n\n\/\/ \/\/shares retrieved in Fass class and passed into pm \n\n\n\/\/ PluginBasic::update_prio(oid, uid, gid, vm_cpu, vm_memory, list_of_users, &vm_prio); \/\/ TODO we miss historical usage U\n\n return;\n}\n*\/\n\nbool PriorityManager::calculate_initial_shares() {\n FassLog::log(\"PM\", Log::INFO, \"Evaluating initial shares...\");\n\n \/\/ TODO(svallero or valzacc):\n \/\/ for the time being only user shares are considered\n vector<string> norm_shares;\n int sum = 0;\n for (vector<string>::const_iterator i= shares.begin();\n i != shares.end(); i++) {\n vector<string> tokens;\n boost::split(tokens, *i, boost::is_any_of(\":\"));\n sum += boost::lexical_cast<int16_t>(tokens[3]);\n }\n\n for (vector<string>::const_iterator i= shares.begin();\n i != shares.end(); i++) {\n user_list.push_back(make_user(*i , sum));\n }\n\n ostringstream oss;\n oss << \"\" << endl;\n for (list<user*>::const_iterator i = user_list.begin();\n i != user_list.end(); ++i) {\n oss << (*i)->userID << \" \"\n << (*i)->groupID << \" \"\n << (*i)->share << endl;\n }\n\n FassLog::log(\"SARA\", Log::INFO, oss);\n\n return true;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n*****************************************************************************\n* ___ _ _ _ _\n* \/ _ \\ __ _| |_| |__(_) |_ ___\n* | (_) \/ _` | \/ \/ '_ \\ | _(_-<\n* \\___\/\\__,_|_\\_\\_.__\/_|\\__\/__\/\n* Copyright (c) 2011\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*****************************************************************************\/\n\/**\n* @author R. Picard\n* @date 2011\/12\/19\n*\n*****************************************************************************\/\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"String.h\"\n\n\/**\n* @date 2011\/12\/19\n*\n* Constructor.\n*\n******************************************************************************\/\nString::String(void):\n InitStatus(0), Area(NULL), AreaSize(0)\n{\n}\n\n\n\/**\n* @date 2011\/12\/21\n*\n* Copy Constructor.\n*\n******************************************************************************\/\nString::String(const String &BaseString):\n InitStatus(-1), Area(NULL), AreaSize(0)\n{\n InitStatus = SetTo(BaseString);\n}\n\n\n\/**\n* @date 2012\/01\/11\n*\n* Constructor.\n*\n******************************************************************************\/\nString::String(const char *BaseString, uint32_t i_Length):\n InitStatus(-1), Area(NULL), AreaSize(0)\n{\n InitStatus = SetTo(BaseString, i_Length);\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Destructor.\n*\n******************************************************************************\/\nString::~String(void)\n{\n DelArea();\n}\n\n\n\/**\n* @date 2012\/01\/08\n*\n* Equality operator.\n*\n******************************************************************************\/\nbool String::operator==(const String &Rhs) const\n{\n if(strcmp(GetString(), Rhs.GetString()) == 0)\n return(true);\n return(false);\n}\n\n\/**\n* @date 2012\/01\/08\n*\n* Equality operator.\n*\n******************************************************************************\/\nbool String::operator!=(const String &Rhs) const\n{\n return(!operator==(Rhs));\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(int Rhs)\n{\n char Num[32];\n int32_t i_Length = snprintf(Num, sizeof(Num), \"%d\", Rhs);\n\n AppendString(Num, i_Length);\n return(*this);\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(const char* Rhs)\n{\n AppendString(Rhs, strlen(Rhs));\n return(*this);\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(const String &Rhs)\n{\n AppendString(Rhs.GetString(), Rhs.GetSize());\n return(*this);\n}\n\n\n\/**\n* @date 2012\/01\/08\n*\n* Sets the value of the string.\n*\n******************************************************************************\/\nint32_t String::SetTo(const String &Value)\n{\n return(SetTo(Value.GetString(), 0));\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Sets the value of the string.\n*\n******************************************************************************\/\nint32_t String::SetTo(const char *Value, uint32_t i_Length)\n{\n if(Value == NULL)\n return(-1);\n\n DelArea();\n uint32_t ValueLength;\n if(i_Length == 0)\n ValueLength = strlen(Value);\n else\n ValueLength = i_Length;\n Area = static_cast<char*>(malloc(ValueLength+1));\n if(Area == NULL)\n return(-1);\n AreaSize = ValueLength+1;\n memcpy(Area, Value, strlen(Value));\n Area[ValueLength] = '\\0';\n return(0);\n}\n\n\n\/**\n* @date 2011\/12\/21\n*\n* Search SearchString inside the string object.\n*\n* @param SearchString (in): String to search for.\n* @return SearchString offset is success.\n* @return -1 otherwise.\n******************************************************************************\/\nint32_t String::FindFirst(const String &SearchString) const\n{\n const char *SearchCString = SearchString.GetString();\n char *Result;\n\n if(SearchCString != NULL)\n {\n Result = strstr(Area, SearchCString);\n if(Result != NULL)\n {\n return(Result-Area);\n }\n }\n return(-1);\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Frees the Area storage space.\n*\n******************************************************************************\/\nvoid String::DelArea(void)\n{\n if(Area != NULL)\n {\n free(Area);\n Area = NULL;\n AreaSize = 0;\n }\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Appends a string.\n* \/\/\/@todo : prealloc space to avoid multiple reallocs\n*\n******************************************************************************\/\nint32_t String::AppendString(const char* sz_String, uint32_t i_Length)\n{\n if( (sz_String == NULL) || (i_Length == 0) )\n return(-1);\n\n bool b_Duplicate = sz_String == Area ? true : false;\n uint32_t i_Offset = 0;\n if(Area != NULL)\n i_Offset = strlen(Area);\n\n uint32_t i_NewSize = i_Length+1;\n if(Area != NULL)\n i_NewSize += strlen(Area);\n\n if(i_NewSize > AreaSize)\n {\n Area = static_cast<char*>(realloc(Area, i_NewSize));\n if(Area != NULL)\n AreaSize = i_NewSize;\n }\n if(Area == NULL)\n return(-1);\n if(b_Duplicate == true)\n memcpy(Area+i_Offset, Area, i_Length);\n else\n memcpy(Area+i_Offset, sz_String, i_Length);\n Area[i_Offset+i_Length] = '\\0';\n return(0);\n}\n<commit_msg>Fix overflows in String<commit_after>\/*\n*****************************************************************************\n* ___ _ _ _ _\n* \/ _ \\ __ _| |_| |__(_) |_ ___\n* | (_) \/ _` | \/ \/ '_ \\ | _(_-<\n* \\___\/\\__,_|_\\_\\_.__\/_|\\__\/__\/\n* Copyright (c) 2011\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*****************************************************************************\/\n\/**\n* @author R. Picard\n* @date 2011\/12\/19\n*\n*****************************************************************************\/\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n\n#include \"String.h\"\n\n\/**\n* @date 2011\/12\/19\n*\n* Constructor.\n*\n******************************************************************************\/\nString::String(void):\n InitStatus(0), Area(NULL), AreaSize(0)\n{\n}\n\n\n\/**\n* @date 2011\/12\/21\n*\n* Copy Constructor.\n*\n******************************************************************************\/\nString::String(const String &BaseString):\n InitStatus(-1), Area(NULL), AreaSize(0)\n{\n InitStatus = SetTo(BaseString);\n}\n\n\n\/**\n* @date 2012\/01\/11\n*\n* Constructor.\n*\n******************************************************************************\/\nString::String(const char *BaseString, uint32_t i_Length):\n InitStatus(-1), Area(NULL), AreaSize(0)\n{\n InitStatus = SetTo(BaseString, i_Length);\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Destructor.\n*\n******************************************************************************\/\nString::~String(void)\n{\n DelArea();\n}\n\n\n\/**\n* @date 2012\/01\/08\n*\n* Equality operator.\n*\n******************************************************************************\/\nbool String::operator==(const String &Rhs) const\n{\n if(strcmp(GetString(), Rhs.GetString()) == 0)\n return(true);\n return(false);\n}\n\n\/**\n* @date 2012\/01\/08\n*\n* Equality operator.\n*\n******************************************************************************\/\nbool String::operator!=(const String &Rhs) const\n{\n return(!operator==(Rhs));\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(int Rhs)\n{\n char Num[32];\n int32_t i_Length = snprintf(Num, sizeof(Num), \"%d\", Rhs);\n\n Num[sizeof(Num) -1] = '\\0';\n AppendString(Num, i_Length);\n return(*this);\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(const char* Rhs)\n{\n AppendString(Rhs, strlen(Rhs));\n return(*this);\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Append operator.\n*\n******************************************************************************\/\nString& String::operator<<(const String &Rhs)\n{\n AppendString(Rhs.GetString(), Rhs.GetSize());\n return(*this);\n}\n\n\n\/**\n* @date 2012\/01\/08\n*\n* Sets the value of the string.\n*\n******************************************************************************\/\nint32_t String::SetTo(const String &Value)\n{\n return(SetTo(Value.GetString(), 0));\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Sets the value of the string.\n*\n******************************************************************************\/\nint32_t String::SetTo(const char *Value, uint32_t i_Length)\n{\n if(Value == NULL)\n return(-1);\n\n DelArea();\n uint32_t ValueLength;\n if(i_Length == 0)\n ValueLength = strlen(Value);\n else\n ValueLength = i_Length;\n Area = static_cast<char*>(malloc(ValueLength+1));\n if(Area == NULL)\n return(-1);\n AreaSize = ValueLength+1;\n memcpy(Area, Value, ValueLength);\n Area[ValueLength] = '\\0';\n return(0);\n}\n\n\n\/**\n* @date 2011\/12\/21\n*\n* Search SearchString inside the string object.\n*\n* @param SearchString (in): String to search for.\n* @return SearchString offset is success.\n* @return -1 otherwise.\n******************************************************************************\/\nint32_t String::FindFirst(const String &SearchString) const\n{\n const char *SearchCString = SearchString.GetString();\n char *Result;\n\n if(SearchCString != NULL)\n {\n Result = strstr(Area, SearchCString);\n if(Result != NULL)\n {\n return(Result-Area);\n }\n }\n return(-1);\n}\n\n\n\/**\n* @date 2011\/12\/19\n*\n* Frees the Area storage space.\n*\n******************************************************************************\/\nvoid String::DelArea(void)\n{\n if(Area != NULL)\n {\n free(Area);\n Area = NULL;\n AreaSize = 0;\n }\n}\n\n\n\/**\n* @date 2012\/02\/14\n*\n* Appends a string.\n* \/\/\/@todo : prealloc space to avoid multiple reallocs\n*\n******************************************************************************\/\nint32_t String::AppendString(const char* sz_String, uint32_t i_Length)\n{\n if( (sz_String == NULL) || (i_Length == 0) )\n return(-1);\n\n bool b_Duplicate = sz_String == Area ? true : false;\n uint32_t i_Offset = 0;\n if(Area != NULL)\n i_Offset = strlen(Area);\n\n uint32_t i_NewSize = i_Length+1;\n if(Area != NULL)\n i_NewSize += strlen(Area);\n\n if(i_NewSize > AreaSize)\n {\n Area = static_cast<char*>(realloc(Area, i_NewSize));\n if(Area != NULL)\n AreaSize = i_NewSize;\n }\n if(Area == NULL)\n return(-1);\n if(b_Duplicate == true)\n memcpy(Area+i_Offset, Area, i_Length);\n else\n memcpy(Area+i_Offset, sz_String, i_Length);\n Area[i_Offset+i_Length] = '\\0';\n return(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the Topologic\/GL project.\n*\/\n\n\/*\n * Copyright (c) 2012-2013, ef.gy Project Members\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n*\/\n\n#ifdef __APPLE__\n#include <OpenGL\/gl3.h>\n#include <GLUT\/glut.h> \/* Open GL Util APPLE *\/\n#else\n#include <GL\/glew.h>\n#include <GL\/glut.h> \/* FreeGLUT (hopefully) *\/\n#endif\n\n#include <topologic\/gl.h>\n\n#if !defined(MAXDEPTH)\n#define MAXDEPTH 7\n#endif\n\nGLfloat mouseX, mouseY;\nGLfloat lastMouseX, lastMouseY;\n\nbool mouseLeft, mouseRight;\n\ntopologic::state<topologic::GLFP,MAXDEPTH> topologicState;\n\nvoid displayCall(void)\n{\n if (topologicState.model)\n {\n topologicState.model->render(true);\n }\n\n glutSwapBuffers();\n glutPostRedisplay();\n}\n\nvoid reshape(GLint width, GLint height)\n{\n glViewport(0, 0, width, height);\n glClearDepth(1.0f);\n\n glEnable (GL_BLEND);\n\n glEnable(GL_CULL_FACE);\n\n topologicState.width = width;\n topologicState.height = height;\n}\n\nvoid idle(void)\n{\n if (mouseLeft || mouseRight)\n {\n glutPostRedisplay();\n }\n}\n\nbool shiftActive;\n\nvoid processMouse(int x, int y)\n{\n mouseX = x;\n mouseY = y;\n\n if (mouseLeft || mouseRight)\n {\n double xd = (mouseX - lastMouseX);\n double yd = (mouseY - lastMouseY);\n\n if (shiftActive)\n {\n topologicState.interpretDrag(0,0,xd+-yd);\n }\n else\n {\n topologicState.interpretDrag(xd,yd,0);\n }\n\n lastMouseX = mouseX;\n lastMouseY = mouseY;\n }\n}\n\nvoid processMouseButton(int button, int state, int x, int y)\n{\n shiftActive = (glutGetModifiers() & GLUT_ACTIVE_SHIFT);\n\n processMouse(x,y);\n\n switch (button)\n {\n case 0:\n mouseLeft = (state == 0);\n break;\n case 2:\n mouseRight = (state == 0);\n break;\n case 3:\n if (state == 0)\n {\n topologicState.interpretDrag(0,0,30);\n }\n break;\n case 4:\n if (state == 0)\n {\n topologicState.interpretDrag(0,0,-30);\n }\n break;\n }\n\n if (mouseLeft || mouseRight)\n {\n lastMouseX = mouseX;\n lastMouseY = mouseY;\n }\n}\n\nvoid processKeyboard(unsigned char key, int x, int y)\n{\n switch (key)\n {\n case '1': topologicState.setActive ( 3); break;\n case '2': topologicState.setActive ( 4); break;\n case '3': topologicState.setActive ( 5); break;\n case '4': topologicState.setActive ( 6); break;\n case '5': topologicState.setActive ( 7); break;\n case '6': topologicState.setActive ( 8); break;\n case '7': topologicState.setActive ( 9); break;\n case '8': topologicState.setActive (10); break;\n case '9': topologicState.setActive (11); break;\n case '0': topologicState.setActive (12); break;\n case 'r':\n topologicState.realign();\n glutPostRedisplay();\n break;\n }\n}\n\nint main (int argc, char* argv[])\n{\n try\n {\n if (!topologic::parseArguments (topologicState, argc, argv, topologic::outGL))\n {\n return 1;\n }\n\n if (!topologicState.model)\n {\n std::cerr << \"error: no model to render\\n\";\n }\n else\n {\n glutInit(&argc, argv);\n glutInitWindowSize(1280, 720);\n\n#ifdef __APPLE__\n\t glutInitDisplayMode(GLUT_3_2_CORE_PROFILE | GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n#else\n#if defined(GLUT_CORE_PROFILE)\n\t glutInitContextVersion(3, 2);\n\t glutInitContextProfile(GLUT_CORE_PROFILE);\n#endif\n\t glutInitDisplayMode(GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n#endif\n glutCreateWindow(\"Topologic\/GLUT\");\n#ifndef __APPLE__\n glewInit();\n#endif\n\n glutDisplayFunc (displayCall);\n glutIdleFunc(idle);\n glutReshapeFunc (reshape);\n glutMouseFunc(processMouseButton);\n glutMotionFunc(processMouse);\n glutPassiveMotionFunc(processMouse);\n glutKeyboardFunc(processKeyboard);\n glutFullScreen();\n\n glutMainLoop();\n }\n }\n catch (std::exception &e)\n {\n std::cerr << \"Exception: \" << e.what() << \"\\n\";\n return 1;\n }\n catch (...)\n {\n std::cerr << \"Unknown Exception\\n\";\n return 1;\n }\n\n return 0;\n}\n<commit_msg>ditch the quite unnecessary idle function; seems to help a lot with the generated webgl code and it decreases the CPU load when there's nothing to update<commit_after>\/*\n * This file is part of the Topologic\/GL project.\n*\/\n\n\/*\n * Copyright (c) 2012-2013, ef.gy Project Members\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n*\/\n\n#ifdef __APPLE__\n#include <OpenGL\/gl3.h>\n#include <GLUT\/glut.h> \/* Open GL Util APPLE *\/\n#else\n#include <GL\/glew.h>\n#include <GL\/glut.h> \/* FreeGLUT (hopefully) *\/\n#endif\n\n#include <topologic\/gl.h>\n\n#if !defined(MAXDEPTH)\n#define MAXDEPTH 7\n#endif\n\nGLfloat mouseX, mouseY;\nGLfloat lastMouseX, lastMouseY;\n\nbool mouseLeft, mouseRight;\n\ntopologic::state<topologic::GLFP,MAXDEPTH> topologicState;\n\nvoid displayCall(void)\n{\n if (topologicState.model)\n {\n topologicState.model->render(true);\n }\n\n glutSwapBuffers();\n glutPostRedisplay();\n}\n\nvoid reshape(GLint width, GLint height)\n{\n glViewport(0, 0, width, height);\n glClearDepth(1.0f);\n\n glEnable (GL_BLEND);\n\n glEnable(GL_CULL_FACE);\n\n topologicState.width = width;\n topologicState.height = height;\n}\n\nbool shiftActive;\n\nvoid processMouse(int x, int y)\n{\n mouseX = x;\n mouseY = y;\n\n if (mouseLeft || mouseRight)\n {\n double xd = (mouseX - lastMouseX);\n double yd = (mouseY - lastMouseY);\n\n if (shiftActive)\n {\n topologicState.interpretDrag(0,0,xd+-yd);\n }\n else\n {\n topologicState.interpretDrag(xd,yd,0);\n }\n\n lastMouseX = mouseX;\n lastMouseY = mouseY;\n\n glutPostRedisplay();\n }\n}\n\nvoid processMouseButton(int button, int state, int x, int y)\n{\n shiftActive = (glutGetModifiers() & GLUT_ACTIVE_SHIFT);\n\n processMouse(x,y);\n\n switch (button)\n {\n case 0:\n mouseLeft = (state == 0);\n break;\n case 2:\n mouseRight = (state == 0);\n break;\n case 3:\n if (state == 0)\n {\n topologicState.interpretDrag(0,0,30);\n }\n break;\n case 4:\n if (state == 0)\n {\n topologicState.interpretDrag(0,0,-30);\n }\n break;\n }\n\n if (mouseLeft || mouseRight)\n {\n lastMouseX = mouseX;\n lastMouseY = mouseY;\n\n glutPostRedisplay();\n }\n}\n\nvoid processKeyboard(unsigned char key, int x, int y)\n{\n switch (key)\n {\n case '1': topologicState.setActive ( 3); break;\n case '2': topologicState.setActive ( 4); break;\n case '3': topologicState.setActive ( 5); break;\n case '4': topologicState.setActive ( 6); break;\n case '5': topologicState.setActive ( 7); break;\n case '6': topologicState.setActive ( 8); break;\n case '7': topologicState.setActive ( 9); break;\n case '8': topologicState.setActive (10); break;\n case '9': topologicState.setActive (11); break;\n case '0': topologicState.setActive (12); break;\n case 'r':\n topologicState.realign();\n glutPostRedisplay();\n break;\n }\n\n glutPostRedisplay();\n}\n\nint main (int argc, char* argv[])\n{\n try\n {\n if (!topologic::parseArguments (topologicState, argc, argv, topologic::outGL))\n {\n return 1;\n }\n\n if (!topologicState.model)\n {\n std::cerr << \"error: no model to render\\n\";\n }\n else\n {\n glutInit(&argc, argv);\n glutInitWindowSize(1280, 720);\n\n#ifdef __APPLE__\n\t glutInitDisplayMode(GLUT_3_2_CORE_PROFILE | GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n#else\n#if defined(GLUT_CORE_PROFILE)\n\t glutInitContextVersion(3, 2);\n\t glutInitContextProfile(GLUT_CORE_PROFILE);\n#endif\n\t glutInitDisplayMode(GLUT_RGBA | GLUT_DOUBLE | GLUT_DEPTH);\n#endif\n glutCreateWindow(\"Topologic\/GLUT\");\n#ifndef __APPLE__\n glewInit();\n#endif\n\n glutDisplayFunc (displayCall);\n glutReshapeFunc (reshape);\n glutMouseFunc(processMouseButton);\n glutMotionFunc(processMouse);\n glutPassiveMotionFunc(processMouse);\n glutKeyboardFunc(processKeyboard);\n glutFullScreen();\n\n glutMainLoop();\n }\n }\n catch (std::exception &e)\n {\n std::cerr << \"Exception: \" << e.what() << \"\\n\";\n return 1;\n }\n catch (...)\n {\n std::cerr << \"Unknown Exception\\n\";\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Application.hpp\"\n#include \"log.hpp\"\n#include \"lua\/State.hpp\"\n#include \"Build.hpp\"\n#include \"bind.hpp\"\n#include \"quote.hpp\"\n\n#include \"generators\/Shell.hpp\"\n#include \"generators\/Makefile.hpp\"\n#include \"generators\/NMakefile.hpp\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <algorithm>\n#include <iostream>\n#include <map>\n\nnamespace fs = boost::filesystem;\n\nnamespace configure {\n\n\tnamespace {\n\n\t\tstd::vector<std::string> args_to_vector(int ac, char ** av)\n\t\t{\n\t\t\tstd::vector<std::string> res;\n\t\t\tfor (int i = 0; i < ac; ++i)\n\t\t\t\tres.push_back(av[i]);\n\t\t\treturn res;\n\t\t}\n\n\t\tbool is_project_directory(fs::path const& dir)\n\t\t{\n\t\t\tfor (auto&& p: Build::possible_configure_files())\n\t\t\t\tif (fs::is_regular_file(dir \/ p))\n\t\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool is_build_directory(fs::path const& dir)\n\t\t{\n\t\t\treturn fs::is_regular_file(dir \/ \".configure.env\");\n\t\t}\n\n\t}\n\n\tstruct Application::Impl\n\t{\n\t\tstd::string program_name;\n\t\tstd::vector<std::string> args;\n\t\tpath_t current_directory;\n\t\tstd::vector<path_t> build_directories;\n\t\tpath_t project_directory;\n\t\tstd::map<std::string, std::string> build_variables;\n\t\tbool dump_graph_mode;\n\t\tstd::string generator;\n\t\tbool build_mode;\n\t\tstd::string build_target;\n\t\tImpl(std::vector<std::string> args)\n\t\t\t: program_name(args.at(0))\n\t\t\t, args(std::move(args))\n\t\t\t, current_directory(fs::current_path())\n\t\t\t, build_directories()\n\t\t\t, project_directory()\n\t\t\t, build_variables()\n\t\t\t, dump_graph_mode(false)\n\t\t\t, generator()\n\t\t\t, build_mode(false)\n\t\t\t, build_target()\n\t\t{ this->args.erase(this->args.begin()); }\n\t};\n\n\tApplication::Application(int ac, char** av)\n\t\t: Application(args_to_vector(ac, av))\n\t{}\n\n\tApplication::Application(std::vector<std::string> args)\n\t\t: _this(new Impl(std::move(args)))\n\t{ _parse_args(); }\n\n\tApplication::~Application() {}\n\n\tvoid Application::run()\n\t{\n\t\tlog::debug(\"Current directory:\", _this->current_directory);\n\t\tlog::debug(\"Program name:\", _this->program_name);\n\t\tif (_this->build_directories.empty())\n\t\t\tthrow std::runtime_error(\"No build directory specified\");\n\t\tfs::path project_file = Build::find_project_file(_this->project_directory);\n\t\tfs::path package;\n\t\tchar const* lib = ::getenv(\"CONFIGURE_LIBRARY_DIR\");\n\t\tif (lib != nullptr)\n\t\t\tpackage = lib;\n\t\telse\n\t\t\tpackage = fs::canonical(\n\t\t\t\tfs::absolute(_this->program_name).parent_path().parent_path()\n\t\t\t\t\/ \"share\" \/ \"configure\" \/ \"lib\"\n\t\t\t);\n\t\tpackage \/= \"?.lua\";\n\t\tlua::State lua;\n\t\tbind(lua);\n\t\tlua.global(\"configure_library_dir\", package.string());\n\t\tlua.load(\n\t\t\t\"require 'package'\\n\"\n\t\t\t\"package.path = configure_library_dir\\n\"\n\t\t);\n\t\tfor (auto const& directory: _this->build_directories)\n\t\t{\n\t\t\tBuild build(lua, directory, _this->build_variables);\n\t\t\tbuild.configure(_this->project_directory);\n\t\t\tif (_this->dump_graph_mode)\n\t\t\t\tbuild.dump_graphviz(std::cout);\n\t\t\tlog::debug(\"Generating the build files in\", build.directory());\n\t\t\tauto& generator = this->_generator(build);\n\t\t\tgenerator.generate(build);\n\t\t\tlog::status(\"Build files generated successfully in\",\n\t\t\t\t\t\tbuild.directory(), \"(\", generator.name(), \")\");\n\t\t\tif (_this->build_mode)\n\t\t\t{\n\t\t\t\tlog::status(\"Starting build in\", build.directory());\n\t\t\t\tauto cmd = generator.build_command(build, _this->build_target);\n\t\t\t\tint res = ::system(\n#ifdef _WIN32\n\t\t\t\t quote<CommandParser::windows_shell>(cmd).c_str()\n#else\n\t\t\t\t quote<CommandParser::unix_shell>(cmd).c_str()\n#endif\n\t\t\t\t);\n\t\t\t\tif (res != 0)\n\t\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\t\terror::BuildError(\"Build failed with exit code \" + std::to_string(res))\n\t\t\t\t\t\t<< error::path(build.directory())\n\t\t\t\t\t\t<< error::command(cmd)\n\t\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstd::string const& Application::program_name() const\n\t{ return _this->program_name; }\n\n\tfs::path const& Application::project_directory() const\n\t{ return _this->project_directory; }\n\n\tstd::vector<fs::path> const& Application::build_directories() const\n\t{ return _this->build_directories; }\n\n\tGenerator const& Application::_generator(Build& build) const\n\t{\n\t\tstatic std::vector<std::unique_ptr<Generator>> generators;\n\t\tif (generators.empty())\n\t\t{\n#define ADD_GENERATOR(T) \\\n\t\t\t{ \\\n\t\t\t\tstd::unique_ptr<Generator> g(new T()); \\\n\t\t\t\tlog::debug( \\\n\t\t\t\t\t\"Generator\", g->name(), \"is\", \\\n\t\t\t\t\t(g->is_available(build) ? \"available\" : \"not available\")); \\\n\t\t\t\tgenerators.push_back(std::move(g));\\\n\t\t\t} \\\n\/**\/\n\t\t\tADD_GENERATOR(generators::Makefile);\n\t\t\tADD_GENERATOR(generators::NMakefile);\n\t\t\tADD_GENERATOR(generators::Shell);\n#undef ADD_GENERATOR\n\t\t}\n\n\t\tstd::string generator_name = _this->generator;\n\t\tif (generator_name.empty())\n\t\t{\n\t\t\tlog::debug(\"No generator specified on command line, searching for one that is available as default\");\n\t\t\tfor (auto& gen: generators)\n\t\t\t\tif (gen->is_available(build))\n\t\t\t\t{\n\t\t\t\t\tgenerator_name = gen->name();\n\t\t\t\t\tlog::debug(\"Found generator\", generator_name, \"as default\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (generator_name.empty())\n\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\terror::InvalidGenerator(\n\t\t\t\t\t\t\"No generator available for your platform\"\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tgenerator_name = build.option<std::string>(\n\t\t\t\"GENERATOR\",\n\t\t\t\"Generator to use\",\n\t\t\tgenerator_name\n\t\t);\n\t\tlog::debug(\"Choosen generator is\", generator_name);\n\n\n\t\tboost::algorithm::to_lower(generator_name);\n\t\tfor (auto& gen: generators)\n\t\t\tif (boost::algorithm::to_lower_copy(gen->name()) == generator_name)\n\t\t\t{\n\t\t\t\tif (!gen->is_available(build))\n\t\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\t\terror::InvalidGenerator(\n\t\t\t\t\t\t\t\"Generator '\" + generator_name + \"' is not available\"\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\treturn *gen;\n\t\t\t}\n\t\tCONFIGURE_THROW(\n\t\t\terror::InvalidGenerator(\"Unknown generator '\" + generator_name + \"'\")\n\t\t);\n\t}\n\tvoid Application::print_help()\n\t{\n\t\tstd::cout\n\t\t\t<< \"Usage: \" << _this->program_name\n\t\t\t<< \" [OPTION]... [BUILD_DIR]... [KEY=VALUE]...\\n\"\n\t\t\t<< \"\\n\"\n\t\t\t<< \" Configure your project's builds in one or more directories.\\n\"\n\t\t\t<< \"\\n\"\n\t\t\t<< \"Positional arguments:\\n\"\n\n\t\t\t<< \" BUILD_DIR\" << \" \"\n\t\t\t<< \"Build directory to configure\\n\"\n\n\t\t\t<< \" KEY=VALUE\" << \" \"\n\t\t\t<< \"Set a variable for selected build directories\\n\"\n\n\t\t\t<< \"\\n\"\n\n\t\t\t<< \"Optional arguments:\\n\"\n\n\t\t\t<< \" -G, --generator NAME\" << \" \"\n\t\t\t<< \"Specify the generator to use (alternative to variable GENERATOR)\\n\"\n\n\t\t\t<< \" -p, --project PATH\" << \" \"\n\t\t\t<< \"Specify the project to configure instead of detecting it\\n\"\n\n\t\t\t<< \" --dump-graph\" << \" \"\n\t\t\t<< \"Dump the build graph\\n\"\n\n\t\t\t<< \" -d, --debug\" << \" \"\n\t\t\t<< \"Enable debug output\\n\"\n\n\t\t\t<< \" -v, --verbose\" << \" \"\n\t\t\t<< \"Enable verbose output\\n\"\n\n\t\t\t<< \" --version\" << \" \"\n\t\t\t<< \"Print version\\n\"\n\n\t\t\t<< \" -h, --help\" << \" \"\n\t\t\t<< \"Show this help and exit\\n\"\n\n\t\t\t<< \" -b,--build[=target]\" << \" \"\n\t\t\t<< \"Start a build in specified directories\\n\"\n\n\t\t;\n\t}\n\n\tvoid Application::exit()\n\t{\n\t\t::exit(0);\n\t}\n\n\tvoid Application::_parse_args()\n\t{\n\t\t\/\/ Searching help and version flags first (ignoring command line errors\n\t\t\/\/ if any).\n\t\tfor (auto const& arg: _this->args)\n\t\t{\n\t\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\t{\n\t\t\t\tthis->print_help();\n\t\t\t\tthis->exit();\n\t\t\t}\n\t\t\tif (arg == \"--version\")\n\t\t\t{\n#ifndef CONFIGURE_VERSION_STRING\n# define CONFIGURE_VERSION_STRING \"unknown\"\n#endif\n\t\t\t\tlog::print(\"configure version\", CONFIGURE_VERSION_STRING);\n\t\t\t\tthis->exit();\n\t\t\t}\n\t\t}\n\n\t\tbool has_project = false;\n\t\tenum class NextArg { project, generator, other };\n\t\tNextArg next_arg = NextArg::other;\n\t\tfor (auto const& arg: _this->args)\n\t\t{\n\t\t\tif (next_arg == NextArg::project)\n\t\t\t{\n\t\t\t\tif (!is_project_directory(arg))\n\t\t\t\t\tthrow std::runtime_error{\"Invalid project directory\"};\n\t\t\t\tif (!has_project)\n\t\t\t\t{\n\t\t\t\t\t_this->project_directory = fs::canonical(arg);\n\t\t\t\t\thas_project = true;\n\t\t\t\t}\n\t\t\t\telse if (_this->project_directory == fs::canonical(arg))\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"Warning: Project directory specified more than once.\\n\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tthrow std::runtime_error{\"Cannot operate on multiple projects\"};\n\t\t\t\t}\n\t\t\t\tnext_arg = NextArg::other;\n\t\t\t}\n\t\t\telse if (next_arg == NextArg::generator)\n\t\t\t{\n\t\t\t\t_this->generator = arg;\n\t\t\t\tnext_arg = NextArg::other;\n\t\t\t}\n\t\t\telse if (arg == \"-p\" || arg == \"--project\")\n\t\t\t{\n\t\t\t\tnext_arg = NextArg::project;\n\t\t\t}\n\t\t\telse if (arg == \"--dump-graph\")\n\t\t\t{\n\t\t\t\t_this->dump_graph_mode = true;\n\t\t\t}\n\t\t\telse if (arg == \"-G\" || arg == \"--generator\")\n\t\t\t{\n\t\t\t\tnext_arg = NextArg::generator;\n\t\t\t}\n\t\t\telse if (arg == \"-d\" || arg == \"--debug\")\n\t\t\t{\n\t\t\t\tlog::level() = log::Level::debug;\n\t\t\t}\n\t\t\telse if (arg == \"-v\" || arg == \"--verbose\")\n\t\t\t{\n\t\t\t\tlog::level() = log::Level::verbose;\n\t\t\t}\n\t\t\telse if (boost::starts_with(arg, \"--build=\") ||\n\t\t\t boost::starts_with(arg, \"-b=\"))\n\t\t\t{\n\t\t\t\tauto it = arg.find('=');\n\t\t\t\t_this->build_target = arg.substr(it + 1, std::string::npos);\n\t\t\t\t_this->build_mode = true;\n\t\t\t}\n\t\t\telse if (arg == \"--build\" || arg == \"-b\")\n\t\t\t{\n\t\t\t\t_this->build_mode = true;\n\t\t\t}\n\t\t\telse if (arg.find('=') != std::string::npos)\n\t\t\t{\n\t\t\t\tauto it = arg.find('=');\n\t\t\t\tif (it != std::string::npos)\n\t\t\t\t{\n\t\t\t\t\t_this->build_variables[arg.substr(0, it)] =\n\t\t\t\t\t\targ.substr(it + 1, std::string::npos);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (is_build_directory(arg) ||\n\t\t\t !fs::exists(arg) ||\n\t\t\t (fs::is_directory(arg) && fs::is_empty(arg)))\n\t\t\t{\n\t\t\t\t_this->build_directories.push_back(fs::absolute(arg));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\terror::InvalidArgument(\"Unknown argument '\" + arg + \"'\")\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tif (next_arg != NextArg::other)\n\t\t{\n\t\t\tCONFIGURE_THROW(\n\t\t\t\terror::InvalidArgument(\n\t\t\t\t\t\"Missing argument for flag '\" + _this->args.back() + \"'\"\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t\tif (!has_project)\n\t\t{\n\t\t\tif (is_project_directory(_this->current_directory))\n\t\t\t\t_this->project_directory = _this->current_directory;\n\t\t\telse\n\t\t\t\tthrow std::runtime_error{\"No project to configure\"};\n\t\t}\n\t}\n\n}\n<commit_msg>Check for NMake first (make does not work on windows yet).<commit_after>#include \"Application.hpp\"\n#include \"log.hpp\"\n#include \"lua\/State.hpp\"\n#include \"Build.hpp\"\n#include \"bind.hpp\"\n#include \"quote.hpp\"\n\n#include \"generators\/Shell.hpp\"\n#include \"generators\/Makefile.hpp\"\n#include \"generators\/NMakefile.hpp\"\n\n#include <boost\/algorithm\/string.hpp>\n#include <algorithm>\n#include <iostream>\n#include <map>\n\nnamespace fs = boost::filesystem;\n\nnamespace configure {\n\n\tnamespace {\n\n\t\tstd::vector<std::string> args_to_vector(int ac, char ** av)\n\t\t{\n\t\t\tstd::vector<std::string> res;\n\t\t\tfor (int i = 0; i < ac; ++i)\n\t\t\t\tres.push_back(av[i]);\n\t\t\treturn res;\n\t\t}\n\n\t\tbool is_project_directory(fs::path const& dir)\n\t\t{\n\t\t\tfor (auto&& p: Build::possible_configure_files())\n\t\t\t\tif (fs::is_regular_file(dir \/ p))\n\t\t\t\t\treturn true;\n\t\t\treturn false;\n\t\t}\n\n\t\tbool is_build_directory(fs::path const& dir)\n\t\t{\n\t\t\treturn fs::is_regular_file(dir \/ \".configure.env\");\n\t\t}\n\n\t}\n\n\tstruct Application::Impl\n\t{\n\t\tstd::string program_name;\n\t\tstd::vector<std::string> args;\n\t\tpath_t current_directory;\n\t\tstd::vector<path_t> build_directories;\n\t\tpath_t project_directory;\n\t\tstd::map<std::string, std::string> build_variables;\n\t\tbool dump_graph_mode;\n\t\tstd::string generator;\n\t\tbool build_mode;\n\t\tstd::string build_target;\n\t\tImpl(std::vector<std::string> args)\n\t\t\t: program_name(args.at(0))\n\t\t\t, args(std::move(args))\n\t\t\t, current_directory(fs::current_path())\n\t\t\t, build_directories()\n\t\t\t, project_directory()\n\t\t\t, build_variables()\n\t\t\t, dump_graph_mode(false)\n\t\t\t, generator()\n\t\t\t, build_mode(false)\n\t\t\t, build_target()\n\t\t{ this->args.erase(this->args.begin()); }\n\t};\n\n\tApplication::Application(int ac, char** av)\n\t\t: Application(args_to_vector(ac, av))\n\t{}\n\n\tApplication::Application(std::vector<std::string> args)\n\t\t: _this(new Impl(std::move(args)))\n\t{ _parse_args(); }\n\n\tApplication::~Application() {}\n\n\tvoid Application::run()\n\t{\n\t\tlog::debug(\"Current directory:\", _this->current_directory);\n\t\tlog::debug(\"Program name:\", _this->program_name);\n\t\tif (_this->build_directories.empty())\n\t\t\tthrow std::runtime_error(\"No build directory specified\");\n\t\tfs::path project_file = Build::find_project_file(_this->project_directory);\n\t\tfs::path package;\n\t\tchar const* lib = ::getenv(\"CONFIGURE_LIBRARY_DIR\");\n\t\tif (lib != nullptr)\n\t\t\tpackage = lib;\n\t\telse\n\t\t\tpackage = fs::canonical(\n\t\t\t\tfs::absolute(_this->program_name).parent_path().parent_path()\n\t\t\t\t\/ \"share\" \/ \"configure\" \/ \"lib\"\n\t\t\t);\n\t\tpackage \/= \"?.lua\";\n\t\tlua::State lua;\n\t\tbind(lua);\n\t\tlua.global(\"configure_library_dir\", package.string());\n\t\tlua.load(\n\t\t\t\"require 'package'\\n\"\n\t\t\t\"package.path = configure_library_dir\\n\"\n\t\t);\n\t\tfor (auto const& directory: _this->build_directories)\n\t\t{\n\t\t\tBuild build(lua, directory, _this->build_variables);\n\t\t\tbuild.configure(_this->project_directory);\n\t\t\tif (_this->dump_graph_mode)\n\t\t\t\tbuild.dump_graphviz(std::cout);\n\t\t\tlog::debug(\"Generating the build files in\", build.directory());\n\t\t\tauto& generator = this->_generator(build);\n\t\t\tgenerator.generate(build);\n\t\t\tlog::status(\"Build files generated successfully in\",\n\t\t\t\t\t\tbuild.directory(), \"(\", generator.name(), \")\");\n\t\t\tif (_this->build_mode)\n\t\t\t{\n\t\t\t\tlog::status(\"Starting build in\", build.directory());\n\t\t\t\tauto cmd = generator.build_command(build, _this->build_target);\n\t\t\t\tint res = ::system(\n#ifdef _WIN32\n\t\t\t\t quote<CommandParser::windows_shell>(cmd).c_str()\n#else\n\t\t\t\t quote<CommandParser::unix_shell>(cmd).c_str()\n#endif\n\t\t\t\t);\n\t\t\t\tif (res != 0)\n\t\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\t\terror::BuildError(\"Build failed with exit code \" + std::to_string(res))\n\t\t\t\t\t\t<< error::path(build.directory())\n\t\t\t\t\t\t<< error::command(cmd)\n\t\t\t\t\t);\n\t\t\t}\n\t\t}\n\n\t}\n\n\tstd::string const& Application::program_name() const\n\t{ return _this->program_name; }\n\n\tfs::path const& Application::project_directory() const\n\t{ return _this->project_directory; }\n\n\tstd::vector<fs::path> const& Application::build_directories() const\n\t{ return _this->build_directories; }\n\n\tGenerator const& Application::_generator(Build& build) const\n\t{\n\t\tstatic std::vector<std::unique_ptr<Generator>> generators;\n\t\tif (generators.empty())\n\t\t{\n#define ADD_GENERATOR(T) \\\n\t\t\t{ \\\n\t\t\t\tstd::unique_ptr<Generator> g(new T()); \\\n\t\t\t\tlog::debug( \\\n\t\t\t\t\t\"Generator\", g->name(), \"is\", \\\n\t\t\t\t\t(g->is_available(build) ? \"available\" : \"not available\")); \\\n\t\t\t\tgenerators.push_back(std::move(g));\\\n\t\t\t} \\\n\/**\/\n\t\t\tADD_GENERATOR(generators::NMakefile);\n\t\t\tADD_GENERATOR(generators::Makefile);\n\t\t\tADD_GENERATOR(generators::Shell);\n#undef ADD_GENERATOR\n\t\t}\n\n\t\tstd::string generator_name = _this->generator;\n\t\tif (generator_name.empty())\n\t\t{\n\t\t\tlog::debug(\"No generator specified on command line, searching for one that is available as default\");\n\t\t\tfor (auto& gen: generators)\n\t\t\t\tif (gen->is_available(build))\n\t\t\t\t{\n\t\t\t\t\tgenerator_name = gen->name();\n\t\t\t\t\tlog::debug(\"Found generator\", generator_name, \"as default\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\tif (generator_name.empty())\n\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\terror::InvalidGenerator(\n\t\t\t\t\t\t\"No generator available for your platform\"\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t}\n\n\t\tgenerator_name = build.option<std::string>(\n\t\t\t\"GENERATOR\",\n\t\t\t\"Generator to use\",\n\t\t\tgenerator_name\n\t\t);\n\t\tlog::debug(\"Choosen generator is\", generator_name);\n\n\n\t\tboost::algorithm::to_lower(generator_name);\n\t\tfor (auto& gen: generators)\n\t\t\tif (boost::algorithm::to_lower_copy(gen->name()) == generator_name)\n\t\t\t{\n\t\t\t\tif (!gen->is_available(build))\n\t\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\t\terror::InvalidGenerator(\n\t\t\t\t\t\t\t\"Generator '\" + generator_name + \"' is not available\"\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\treturn *gen;\n\t\t\t}\n\t\tCONFIGURE_THROW(\n\t\t\terror::InvalidGenerator(\"Unknown generator '\" + generator_name + \"'\")\n\t\t);\n\t}\n\tvoid Application::print_help()\n\t{\n\t\tstd::cout\n\t\t\t<< \"Usage: \" << _this->program_name\n\t\t\t<< \" [OPTION]... [BUILD_DIR]... [KEY=VALUE]...\\n\"\n\t\t\t<< \"\\n\"\n\t\t\t<< \" Configure your project's builds in one or more directories.\\n\"\n\t\t\t<< \"\\n\"\n\t\t\t<< \"Positional arguments:\\n\"\n\n\t\t\t<< \" BUILD_DIR\" << \" \"\n\t\t\t<< \"Build directory to configure\\n\"\n\n\t\t\t<< \" KEY=VALUE\" << \" \"\n\t\t\t<< \"Set a variable for selected build directories\\n\"\n\n\t\t\t<< \"\\n\"\n\n\t\t\t<< \"Optional arguments:\\n\"\n\n\t\t\t<< \" -G, --generator NAME\" << \" \"\n\t\t\t<< \"Specify the generator to use (alternative to variable GENERATOR)\\n\"\n\n\t\t\t<< \" -p, --project PATH\" << \" \"\n\t\t\t<< \"Specify the project to configure instead of detecting it\\n\"\n\n\t\t\t<< \" --dump-graph\" << \" \"\n\t\t\t<< \"Dump the build graph\\n\"\n\n\t\t\t<< \" -d, --debug\" << \" \"\n\t\t\t<< \"Enable debug output\\n\"\n\n\t\t\t<< \" -v, --verbose\" << \" \"\n\t\t\t<< \"Enable verbose output\\n\"\n\n\t\t\t<< \" --version\" << \" \"\n\t\t\t<< \"Print version\\n\"\n\n\t\t\t<< \" -h, --help\" << \" \"\n\t\t\t<< \"Show this help and exit\\n\"\n\n\t\t\t<< \" -b,--build[=target]\" << \" \"\n\t\t\t<< \"Start a build in specified directories\\n\"\n\n\t\t;\n\t}\n\n\tvoid Application::exit()\n\t{\n\t\t::exit(0);\n\t}\n\n\tvoid Application::_parse_args()\n\t{\n\t\t\/\/ Searching help and version flags first (ignoring command line errors\n\t\t\/\/ if any).\n\t\tfor (auto const& arg: _this->args)\n\t\t{\n\t\t\tif (arg == \"-h\" || arg == \"--help\")\n\t\t\t{\n\t\t\t\tthis->print_help();\n\t\t\t\tthis->exit();\n\t\t\t}\n\t\t\tif (arg == \"--version\")\n\t\t\t{\n#ifndef CONFIGURE_VERSION_STRING\n# define CONFIGURE_VERSION_STRING \"unknown\"\n#endif\n\t\t\t\tlog::print(\"configure version\", CONFIGURE_VERSION_STRING);\n\t\t\t\tthis->exit();\n\t\t\t}\n\t\t}\n\n\t\tbool has_project = false;\n\t\tenum class NextArg { project, generator, other };\n\t\tNextArg next_arg = NextArg::other;\n\t\tfor (auto const& arg: _this->args)\n\t\t{\n\t\t\tif (next_arg == NextArg::project)\n\t\t\t{\n\t\t\t\tif (!is_project_directory(arg))\n\t\t\t\t\tthrow std::runtime_error{\"Invalid project directory\"};\n\t\t\t\tif (!has_project)\n\t\t\t\t{\n\t\t\t\t\t_this->project_directory = fs::canonical(arg);\n\t\t\t\t\thas_project = true;\n\t\t\t\t}\n\t\t\t\telse if (_this->project_directory == fs::canonical(arg))\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"Warning: Project directory specified more than once.\\n\";\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tthrow std::runtime_error{\"Cannot operate on multiple projects\"};\n\t\t\t\t}\n\t\t\t\tnext_arg = NextArg::other;\n\t\t\t}\n\t\t\telse if (next_arg == NextArg::generator)\n\t\t\t{\n\t\t\t\t_this->generator = arg;\n\t\t\t\tnext_arg = NextArg::other;\n\t\t\t}\n\t\t\telse if (arg == \"-p\" || arg == \"--project\")\n\t\t\t{\n\t\t\t\tnext_arg = NextArg::project;\n\t\t\t}\n\t\t\telse if (arg == \"--dump-graph\")\n\t\t\t{\n\t\t\t\t_this->dump_graph_mode = true;\n\t\t\t}\n\t\t\telse if (arg == \"-G\" || arg == \"--generator\")\n\t\t\t{\n\t\t\t\tnext_arg = NextArg::generator;\n\t\t\t}\n\t\t\telse if (arg == \"-d\" || arg == \"--debug\")\n\t\t\t{\n\t\t\t\tlog::level() = log::Level::debug;\n\t\t\t}\n\t\t\telse if (arg == \"-v\" || arg == \"--verbose\")\n\t\t\t{\n\t\t\t\tlog::level() = log::Level::verbose;\n\t\t\t}\n\t\t\telse if (boost::starts_with(arg, \"--build=\") ||\n\t\t\t boost::starts_with(arg, \"-b=\"))\n\t\t\t{\n\t\t\t\tauto it = arg.find('=');\n\t\t\t\t_this->build_target = arg.substr(it + 1, std::string::npos);\n\t\t\t\t_this->build_mode = true;\n\t\t\t}\n\t\t\telse if (arg == \"--build\" || arg == \"-b\")\n\t\t\t{\n\t\t\t\t_this->build_mode = true;\n\t\t\t}\n\t\t\telse if (arg.find('=') != std::string::npos)\n\t\t\t{\n\t\t\t\tauto it = arg.find('=');\n\t\t\t\tif (it != std::string::npos)\n\t\t\t\t{\n\t\t\t\t\t_this->build_variables[arg.substr(0, it)] =\n\t\t\t\t\t\targ.substr(it + 1, std::string::npos);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (is_build_directory(arg) ||\n\t\t\t !fs::exists(arg) ||\n\t\t\t (fs::is_directory(arg) && fs::is_empty(arg)))\n\t\t\t{\n\t\t\t\t_this->build_directories.push_back(fs::absolute(arg));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tCONFIGURE_THROW(\n\t\t\t\t\terror::InvalidArgument(\"Unknown argument '\" + arg + \"'\")\n\t\t\t\t);\n\t\t\t}\n\t\t}\n\t\tif (next_arg != NextArg::other)\n\t\t{\n\t\t\tCONFIGURE_THROW(\n\t\t\t\terror::InvalidArgument(\n\t\t\t\t\t\"Missing argument for flag '\" + _this->args.back() + \"'\"\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t\tif (!has_project)\n\t\t{\n\t\t\tif (is_project_directory(_this->current_directory))\n\t\t\t\t_this->project_directory = _this->current_directory;\n\t\t\telse\n\t\t\t\tthrow std::runtime_error{\"No project to configure\"};\n\t\t}\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2006-2009 the V8 project authors. All rights reserved.\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"v8.h\"\n\n#include \"bootstrapper.h\"\n#include \"debug.h\"\n#include \"serialize.h\"\n#include \"simulator.h\"\n#include \"stub-cache.h\"\n#include \"oprofile-agent.h\"\n#include \"log.h\"\n\nnamespace v8 {\nnamespace internal {\n\nbool V8::is_running_ = false;\nbool V8::has_been_setup_ = false;\nbool V8::has_been_disposed_ = false;\nbool V8::has_fatal_error_ = false;\n\nbool V8::Initialize(Deserializer* des) {\n bool create_heap_objects = des == NULL;\n if (has_been_disposed_ || has_fatal_error_) return false;\n if (IsRunning()) return true;\n\n is_running_ = true;\n has_been_setup_ = true;\n has_fatal_error_ = false;\n has_been_disposed_ = false;\n#ifdef DEBUG\n \/\/ The initialization process does not handle memory exhaustion.\n DisallowAllocationFailure disallow_allocation_failure;\n#endif\n\n \/\/ Enable logging before setting up the heap\n Logger::Setup();\n\n CpuProfiler::Setup();\n\n \/\/ Setup the platform OS support.\n OS::Setup();\n\n \/\/ Initialize other runtime facilities\n#if !V8_HOST_ARCH_ARM && V8_TARGET_ARCH_ARM\n ::assembler::arm::Simulator::Initialize();\n#endif\n\n { \/\/ NOLINT\n \/\/ Ensure that the thread has a valid stack guard. The v8::Locker object\n \/\/ will ensure this too, but we don't have to use lockers if we are only\n \/\/ using one thread.\n ExecutionAccess lock;\n StackGuard::InitThread(lock);\n }\n\n \/\/ Setup the object heap\n ASSERT(!Heap::HasBeenSetup());\n if (!Heap::Setup(create_heap_objects)) {\n SetFatalError();\n return false;\n }\n\n Bootstrapper::Initialize(create_heap_objects);\n Builtins::Setup(create_heap_objects);\n Top::Initialize();\n\n if (FLAG_preemption) {\n v8::Locker locker;\n v8::Locker::StartPreemption(100);\n }\n\n#ifdef ENABLE_DEBUGGER_SUPPORT\n Debug::Setup(create_heap_objects);\n#endif\n StubCache::Initialize(create_heap_objects);\n\n \/\/ If we are deserializing, read the state into the now-empty heap.\n if (des != NULL) {\n des->Deserialize();\n StubCache::Clear();\n }\n\n \/\/ Deserializing may put strange things in the root array's copy of the\n \/\/ stack guard.\n Heap::SetStackLimits();\n\n \/\/ Setup the CPU support. Must be done after heap setup and after\n \/\/ any deserialization because we have to have the initial heap\n \/\/ objects in place for creating the code object used for probing.\n CPU::Setup();\n\n OProfileAgent::Initialize();\n\n \/\/ If we are deserializing, log non-function code objects and compiled\n \/\/ functions found in the snapshot.\n if (des != NULL && FLAG_log_code) {\n HandleScope scope;\n LOG(LogCodeObjects());\n LOG(LogCompiledFunctions());\n }\n\n return true;\n}\n\n\nvoid V8::SetFatalError() {\n is_running_ = false;\n has_fatal_error_ = true;\n}\n\n\nvoid V8::TearDown() {\n if (!has_been_setup_ || has_been_disposed_) return;\n\n OProfileAgent::TearDown();\n\n if (FLAG_preemption) {\n v8::Locker locker;\n v8::Locker::StopPreemption();\n }\n\n Builtins::TearDown();\n Bootstrapper::TearDown();\n\n Top::TearDown();\n\n Heap::TearDown();\n\n CpuProfiler::TearDown();\n\n Logger::TearDown();\n\n is_running_ = false;\n has_been_disposed_ = true;\n}\n\n\nstatic uint32_t random_seed() {\n if (FLAG_random_seed == 0) {\n return random();\n }\n return FLAG_random_seed;\n}\n\n\nuint32_t V8::Random() {\n \/\/ Random number generator using George Marsaglia's MWC algorithm.\n static uint32_t hi = 0;\n static uint32_t lo = 0;\n\n \/\/ Initialize seed using the system random(). If one of the seeds\n \/\/ should ever become zero again, or if random() returns zero, we\n \/\/ avoid getting stuck with zero bits in hi or lo by re-initializing\n \/\/ them on demand.\n if (hi == 0) hi = random_seed();\n if (lo == 0) lo = random_seed();\n\n \/\/ Mix the bits.\n hi = 36969 * (hi & 0xFFFF) + (hi >> 16);\n lo = 18273 * (lo & 0xFFFF) + (lo >> 16);\n return (hi << 16) + (lo & 0xFFFF);\n}\n\n\nbool V8::IdleNotification() {\n \/\/ Returning true tells the caller that there is no need to call\n \/\/ IdleNotification again.\n if (!FLAG_use_idle_notification) return true;\n\n \/\/ Tell the heap that it may want to adjust.\n return Heap::IdleNotification();\n}\n\n\n\/\/ Use a union type to avoid type-aliasing optimizations in GCC.\ntypedef union {\n double double_value;\n uint64_t uint64_t_value;\n} double_int_union;\n\n\nObject* V8::FillHeapNumberWithRandom(Object* heap_number) {\n uint64_t random_bits = Random();\n \/\/ Make a double* from address (heap_number + sizeof(double)).\n double_int_union* r = reinterpret_cast<double_int_union*>(\n reinterpret_cast<char*>(heap_number) +\n HeapNumber::kValueOffset - kHeapObjectTag);\n \/\/ Convert 32 random bits to 0.(32 random bits) in a double\n \/\/ by computing:\n \/\/ ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).\n const double binary_million = 1048576.0;\n r->double_value = binary_million;\n r->uint64_t_value |= random_bits;\n r->double_value -= binary_million;\n\n return heap_number;\n}\n\n} } \/\/ namespace v8::internal\n<commit_msg>Fix teardown order.<commit_after>\/\/ Copyright 2006-2009 the V8 project authors. All rights reserved.\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"v8.h\"\n\n#include \"bootstrapper.h\"\n#include \"debug.h\"\n#include \"serialize.h\"\n#include \"simulator.h\"\n#include \"stub-cache.h\"\n#include \"oprofile-agent.h\"\n#include \"log.h\"\n\nnamespace v8 {\nnamespace internal {\n\nbool V8::is_running_ = false;\nbool V8::has_been_setup_ = false;\nbool V8::has_been_disposed_ = false;\nbool V8::has_fatal_error_ = false;\n\nbool V8::Initialize(Deserializer* des) {\n bool create_heap_objects = des == NULL;\n if (has_been_disposed_ || has_fatal_error_) return false;\n if (IsRunning()) return true;\n\n is_running_ = true;\n has_been_setup_ = true;\n has_fatal_error_ = false;\n has_been_disposed_ = false;\n#ifdef DEBUG\n \/\/ The initialization process does not handle memory exhaustion.\n DisallowAllocationFailure disallow_allocation_failure;\n#endif\n\n \/\/ Enable logging before setting up the heap\n Logger::Setup();\n\n CpuProfiler::Setup();\n\n \/\/ Setup the platform OS support.\n OS::Setup();\n\n \/\/ Initialize other runtime facilities\n#if !V8_HOST_ARCH_ARM && V8_TARGET_ARCH_ARM\n ::assembler::arm::Simulator::Initialize();\n#endif\n\n { \/\/ NOLINT\n \/\/ Ensure that the thread has a valid stack guard. The v8::Locker object\n \/\/ will ensure this too, but we don't have to use lockers if we are only\n \/\/ using one thread.\n ExecutionAccess lock;\n StackGuard::InitThread(lock);\n }\n\n \/\/ Setup the object heap\n ASSERT(!Heap::HasBeenSetup());\n if (!Heap::Setup(create_heap_objects)) {\n SetFatalError();\n return false;\n }\n\n Bootstrapper::Initialize(create_heap_objects);\n Builtins::Setup(create_heap_objects);\n Top::Initialize();\n\n if (FLAG_preemption) {\n v8::Locker locker;\n v8::Locker::StartPreemption(100);\n }\n\n#ifdef ENABLE_DEBUGGER_SUPPORT\n Debug::Setup(create_heap_objects);\n#endif\n StubCache::Initialize(create_heap_objects);\n\n \/\/ If we are deserializing, read the state into the now-empty heap.\n if (des != NULL) {\n des->Deserialize();\n StubCache::Clear();\n }\n\n \/\/ Deserializing may put strange things in the root array's copy of the\n \/\/ stack guard.\n Heap::SetStackLimits();\n\n \/\/ Setup the CPU support. Must be done after heap setup and after\n \/\/ any deserialization because we have to have the initial heap\n \/\/ objects in place for creating the code object used for probing.\n CPU::Setup();\n\n OProfileAgent::Initialize();\n\n \/\/ If we are deserializing, log non-function code objects and compiled\n \/\/ functions found in the snapshot.\n if (des != NULL && FLAG_log_code) {\n HandleScope scope;\n LOG(LogCodeObjects());\n LOG(LogCompiledFunctions());\n }\n\n return true;\n}\n\n\nvoid V8::SetFatalError() {\n is_running_ = false;\n has_fatal_error_ = true;\n}\n\n\nvoid V8::TearDown() {\n if (!has_been_setup_ || has_been_disposed_) return;\n\n OProfileAgent::TearDown();\n\n if (FLAG_preemption) {\n v8::Locker locker;\n v8::Locker::StopPreemption();\n }\n\n Builtins::TearDown();\n Bootstrapper::TearDown();\n\n Top::TearDown();\n\n CpuProfiler::TearDown();\n\n Heap::TearDown();\n\n Logger::TearDown();\n\n is_running_ = false;\n has_been_disposed_ = true;\n}\n\n\nstatic uint32_t random_seed() {\n if (FLAG_random_seed == 0) {\n return random();\n }\n return FLAG_random_seed;\n}\n\n\nuint32_t V8::Random() {\n \/\/ Random number generator using George Marsaglia's MWC algorithm.\n static uint32_t hi = 0;\n static uint32_t lo = 0;\n\n \/\/ Initialize seed using the system random(). If one of the seeds\n \/\/ should ever become zero again, or if random() returns zero, we\n \/\/ avoid getting stuck with zero bits in hi or lo by re-initializing\n \/\/ them on demand.\n if (hi == 0) hi = random_seed();\n if (lo == 0) lo = random_seed();\n\n \/\/ Mix the bits.\n hi = 36969 * (hi & 0xFFFF) + (hi >> 16);\n lo = 18273 * (lo & 0xFFFF) + (lo >> 16);\n return (hi << 16) + (lo & 0xFFFF);\n}\n\n\nbool V8::IdleNotification() {\n \/\/ Returning true tells the caller that there is no need to call\n \/\/ IdleNotification again.\n if (!FLAG_use_idle_notification) return true;\n\n \/\/ Tell the heap that it may want to adjust.\n return Heap::IdleNotification();\n}\n\n\n\/\/ Use a union type to avoid type-aliasing optimizations in GCC.\ntypedef union {\n double double_value;\n uint64_t uint64_t_value;\n} double_int_union;\n\n\nObject* V8::FillHeapNumberWithRandom(Object* heap_number) {\n uint64_t random_bits = Random();\n \/\/ Make a double* from address (heap_number + sizeof(double)).\n double_int_union* r = reinterpret_cast<double_int_union*>(\n reinterpret_cast<char*>(heap_number) +\n HeapNumber::kValueOffset - kHeapObjectTag);\n \/\/ Convert 32 random bits to 0.(32 random bits) in a double\n \/\/ by computing:\n \/\/ ( 1.(20 0s)(32 random bits) x 2^20 ) - (1.0 x 2^20)).\n const double binary_million = 1048576.0;\n r->double_value = binary_million;\n r->uint64_t_value |= random_bits;\n r->double_value -= binary_million;\n\n return heap_number;\n}\n\n} } \/\/ namespace v8::internal\n<|endoftext|>"} {"text":"<commit_before>\/\/ System Dependencies\n#include <sys\/time.h>\n\n\/\/ Local Dependencies\n#include \"..\/include\/datetime.h\"\n#include \"..\/include\/exception.h\"\n\n\/** Divisors: The number of milliseconds per item. *\/\n#define DAY_DIVISOR\t\t86400000\n#define HOUR_DIVISOR\t3600000\n#define MINUTE_DIVISOR\t60000\n#define SECOND_DIVISOR\t1000\n\nnamespace native\n{\n\tDateTime::DateTime()\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tDateTime::DateTime(int year, int month, int day)\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tDateTime::DateTime(const DateTime& other) : _value(other._value), _offset(other._offset)\n\t{\n\t}\n\n\tvoid DateTime::addDays(int days)\n\t{\n\t\t_value += int64_t(days) * DAY_DIVISOR;\n\t}\n\n\tvoid DateTime::addHours(int hours)\n\t{\n\t\t_value += int64_t(hours) * HOUR_DIVISOR;\n\t}\n\n\tvoid DateTime::addMinutes(int minutes)\n\t{\n\t\t_value += int64_t(minutes) * MINUTE_DIVISOR;\n\t}\n\n\tvoid DateTime::addSeconds(int seconds)\n\t{\n\t\t_value += int64_t(seconds) * SECOND_DIVISOR;\n\t}\n\n\tvoid DateTime::addMilliSeconds(int milliseconds)\n\t{\n\t\t_value += milliseconds;\n\t}\n\n\tshort DateTime::getDay() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tWeekDay DateTime::getWeekDay() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tMonth DateTime::getMonth() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tint DateTime::getYear() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getHour() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getMinute() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getSecond() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getMilliSecond() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tString DateTime::toString() const\n\t{\n\t\tconst wchar_t* format;\n\n\t\tif (getTimeZoneOffset() == 0)\n\t\t\tformat = L\"{0:04}-{1:02}-{2:02}T{3:02}:{4:02}:{5:02}.{6:03}Z\";\n\t\telse\n\t\t\tformat = L\"{0:04}-{1:02}-{2:02}T{3:02}:{4:02}:{5:02}.{6:03}+{7:02}:{8:02}\";\n\n\t\treturn String::format(format, getYear(), getMonth(), getDay(), getHour(), getMinute(),\n\t\t\tgetSecond(), getMilliSecond(), getTimeZoneOffset() \/ 60, getTimeZoneOffset() % 60);\n\t}\n}\n<commit_msg>Get started on Android DateTime stuff.<commit_after>\/\/ System Dependencies\n#include <sys\/time.h>\n\n\/\/ Local Dependencies\n#include \"..\/include\/datetime.h\"\n#include \"..\/include\/exception.h\"\n\n\/** Divisors: The number of milliseconds per item. *\/\n#define DAY_DIVISOR\t\t86400000\n#define HOUR_DIVISOR\t3600000\n#define MINUTE_DIVISOR\t60000\n#define SECOND_DIVISOR\t1000\n\nnamespace native\n{\n\tDateTime::DateTime()\n\t{\n\t\tstruct timeval tv;\n\t\tstruct timezone tz;\n\n\t\t::gettimeofday(&tv, &tz);\n\n\t\t_value = (tv.tv_sec * 1000) + (tv.tv_usec \/ 1000);\n\t\t_offset = tz.tz_minuteswest;\n\t}\n\n\tDateTime::DateTime(int year, int month, int day)\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tDateTime::DateTime(const DateTime& other) : _value(other._value), _offset(other._offset)\n\t{\n\t}\n\n\tvoid DateTime::addDays(int days)\n\t{\n\t\t_value += int64_t(days) * DAY_DIVISOR;\n\t}\n\n\tvoid DateTime::addHours(int hours)\n\t{\n\t\t_value += int64_t(hours) * HOUR_DIVISOR;\n\t}\n\n\tvoid DateTime::addMinutes(int minutes)\n\t{\n\t\t_value += int64_t(minutes) * MINUTE_DIVISOR;\n\t}\n\n\tvoid DateTime::addSeconds(int seconds)\n\t{\n\t\t_value += int64_t(seconds) * SECOND_DIVISOR;\n\t}\n\n\tvoid DateTime::addMilliSeconds(int milliseconds)\n\t{\n\t\t_value += milliseconds;\n\t}\n\n\tshort DateTime::getDay() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tWeekDay DateTime::getWeekDay() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tMonth DateTime::getMonth() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tint DateTime::getYear() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getHour() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getMinute() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getSecond() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tshort DateTime::getMilliSecond() const\n\t{\n\t\tthrow NotImplementedException();\n\t}\n\n\tString DateTime::toString() const\n\t{\n\t\tconst wchar_t* format;\n\n\t\tif (getTimeZoneOffset() == 0)\n\t\t\tformat = L\"{0:04}-{1:02}-{2:02}T{3:02}:{4:02}:{5:02}.{6:03}Z\";\n\t\telse\n\t\t\tformat = L\"{0:04}-{1:02}-{2:02}T{3:02}:{4:02}:{5:02}.{6:03}+{7:02}:{8:02}\";\n\n\t\treturn String::format(format, getYear(), getMonth(), getDay(), getHour(), getMinute(),\n\t\t\tgetSecond(), getMilliSecond(), getTimeZoneOffset() \/ 60, getTimeZoneOffset() % 60);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 Tanel Lebedev\n\n#include \".\/main.h\"\n\n#include <sstream>\n\n#include \"Poco\/Message.h\"\n#include \"Poco\/Util\/Application.h\"\n\n#define ERRLEN 1024\n\nnamespace command_line_client {\n\n void Main::usage() {\n std::cout << \"Recognized commands are: \"\n \"sync, start, stop, status, pushable, list, continue, listen\"\n << std::endl;\n }\n\n void Main::defineOptions(Poco::Util::OptionSet& options) {\n Poco::Util::Application::defineOptions(options);\n options.addOption(Poco::Util::Option(\n \"verbose\", \"v\", \"verbose logging, to the console\"));\n }\n\n std::string KopsikModelChangeToString(\n KopsikModelChange &change) {\n std::stringstream ss;\n ss << \"model_type=\" << change.ModelType\n << \", change_type=\" << change.ChangeType\n << \", model_id=\" << change.ModelID\n << \", GUID=\" << change.GUID;\n return ss.str();\n }\n\n std::string KopsikTimeEntryViewItemToString(\n KopsikTimeEntryViewItem *item) {\n std::stringstream ss;\n ss << \"description: \" << item->Description;\n if (item->Project) {\n ss << \" project: \" << item->Project;\n }\n if (item->Duration) {\n ss << \" duration: \" << item->Duration;\n }\n return ss.str();\n }\n\n void on_model_change(kopsik_api_result result,\n char *err_string,\n int unsigned err_len,\n KopsikModelChange *change) {\n if (KOPSIK_API_SUCCESS != result) {\n std::string err(\"\");\n err.append(err_string, err_len);\n std::cerr << \"on_model_change error! \"\n << err << std::endl;\n free(err_string);\n return;\n }\n std::cout << \"on_view_item_change \"\n << KopsikModelChangeToString(*change)\n << std::endl;\n }\n\n int Main::main(const std::vector<std::string>& args) {\n if (args.empty()) {\n usage();\n return Poco::Util::Application::EXIT_USAGE;\n }\n\n char* apiToken = getenv(\"TOGGL_API_TOKEN\");\n if (!apiToken) {\n std::cerr << \"Please set TOGGL_API_TOKEN in environment\" <<\n std::endl;\n return Poco::Util::Application::EXIT_USAGE;\n }\n\n kopsik_set_db_path(ctx, \"kopsik.db\");\n kopsik_set_log_path(ctx, \"kopsik.log\");\n\n Poco::ErrorHandler::set(this);\n\n \/\/ Start session in lib\n char err[ERRLEN];\n std::fill(err, err + ERRLEN, 0);\n if (KOPSIK_API_SUCCESS != kopsik_set_api_token(\n ctx, err, ERRLEN, apiToken)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n \/\/ Load user that is referenced by the session\n KopsikUser *user = kopsik_user_init();\n if (KOPSIK_API_SUCCESS != kopsik_current_user(\n ctx, err, ERRLEN, user)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n kopsik_user_clear(user);\n\n if (\"sync\" == args[0]) {\n if (KOPSIK_API_SUCCESS != kopsik_sync(ctx, err, ERRLEN, 1)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n std::cout << \"Synced.\" << std::endl;\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"status\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n int found(0);\n if (KOPSIK_API_SUCCESS != kopsik_running_time_entry_view_item(\n ctx, err, ERRLEN, te, &found)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (found) {\n std::cout << \"Tracking: \" << te->Description << std::endl;\n } else {\n std::cout << \"Not tracking.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"pushable\" == args[0]) {\n KopsikPushableModelStats stats;\n if (KOPSIK_API_SUCCESS != kopsik_pushable_models(\n ctx, err, ERRLEN, &stats)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n std::cout << stats.TimeEntries << \" pushable time entries.\" << std::endl;\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"start\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_start(\n ctx, err, ERRLEN, \"New time entry\", te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n if (te->Description) {\n std::cout << \"Started: \" << te->Description << std::endl;\n } else {\n std::cout << \"Started.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"stop\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_stop(\n ctx, err, ERRLEN, te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n if (te->Description) {\n std::cout << \"Stopped: \" << te->Description << std::endl;\n } else {\n std::cout << \"Stopped.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"list\" == args[0]) {\n KopsikTimeEntryViewItemList *list =\n kopsik_time_entry_view_item_list_init();\n if (KOPSIK_API_SUCCESS != kopsik_time_entry_view_items(\n ctx, err, ERRLEN, list)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n for (unsigned int i = 0; i < list->Length; i++) {\n KopsikTimeEntryViewItem *item = list->ViewItems[i];\n std::cout << KopsikTimeEntryViewItemToString(item) << std::endl;\n }\n std::cout << \"Got \" << list->Length << \" time entry view items.\"\n << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"listen\" == args[0]) {\n std::cout << \"Listening to websocket.. \" << std::endl;\n kopsik_set_change_callback(ctx, on_model_change);\n if (KOPSIK_API_SUCCESS != kopsik_websocket_start(ctx, err, ERRLEN)) {\n std::cerr << \"Error starting websocket: \"\n << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n while (true) {\n Poco::Thread::sleep(1000);\n }\n if (KOPSIK_API_SUCCESS != kopsik_websocket_stop(ctx, err, ERRLEN)) {\n std::cerr << \"Error stopping websocket: \"\n << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"continue\" == args[0]) {\n KopsikTimeEntryViewItemList *list =\n kopsik_time_entry_view_item_list_init();\n\n if (KOPSIK_API_SUCCESS != kopsik_time_entry_view_items(\n ctx, err, ERRLEN, list)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n if (!list->Length) {\n std::cout << \"No time entry found to continue.\" << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_OK;\n }\n\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_continue(\n ctx, err, ERRLEN, list->ViewItems[0]->GUID, te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n\n if (te->Description) {\n std::cout << \"Started: \" << te->Description << std::endl;\n } else {\n std::cout << \"Started.\" << std::endl;\n }\n\n kopsik_time_entry_view_item_list_clear(list);\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n usage();\n return Poco::Util::Application::EXIT_USAGE;\n }\n} \/\/ namespace command_line_client\n<commit_msg>changed err format in cmd line app<commit_after>\/\/ Copyright 2013 Tanel Lebedev\n\n#include \".\/main.h\"\n\n#include <sstream>\n\n#include \"Poco\/Message.h\"\n#include \"Poco\/Util\/Application.h\"\n\n#define ERRLEN 1024\n\nnamespace command_line_client {\n\n void Main::usage() {\n std::cout << \"Recognized commands are: \"\n \"sync, start, stop, status, pushable, list, continue, listen\"\n << std::endl;\n }\n\n void Main::defineOptions(Poco::Util::OptionSet& options) {\n Poco::Util::Application::defineOptions(options);\n options.addOption(Poco::Util::Option(\n \"verbose\", \"v\", \"verbose logging, to the console\"));\n }\n\n std::string KopsikModelChangeToString(\n KopsikModelChange &change) {\n std::stringstream ss;\n ss << \"model_type=\" << change.ModelType\n << \", change_type=\" << change.ChangeType\n << \", model_id=\" << change.ModelID\n << \", GUID=\" << change.GUID;\n return ss.str();\n }\n\n std::string KopsikTimeEntryViewItemToString(\n KopsikTimeEntryViewItem *item) {\n std::stringstream ss;\n ss << \"description: \" << item->Description;\n if (item->Project) {\n ss << \" project: \" << item->Project;\n }\n if (item->Duration) {\n ss << \" duration: \" << item->Duration;\n }\n return ss.str();\n }\n\n void on_model_change(kopsik_api_result result,\n const char *err_string,\n KopsikModelChange *change) {\n if (KOPSIK_API_SUCCESS != result) {\n std::string err(err_string);\n std::cerr << \"on_model_change error! \"\n << err << std::endl;\n return;\n }\n std::cout << \"on_view_item_change \"\n << KopsikModelChangeToString(*change)\n << std::endl;\n }\n\n int Main::main(const std::vector<std::string>& args) {\n if (args.empty()) {\n usage();\n return Poco::Util::Application::EXIT_USAGE;\n }\n\n char* apiToken = getenv(\"TOGGL_API_TOKEN\");\n if (!apiToken) {\n std::cerr << \"Please set TOGGL_API_TOKEN in environment\" <<\n std::endl;\n return Poco::Util::Application::EXIT_USAGE;\n }\n\n kopsik_set_db_path(ctx, \"kopsik.db\");\n kopsik_set_log_path(ctx, \"kopsik.log\");\n\n Poco::ErrorHandler::set(this);\n\n \/\/ Start session in lib\n char err[ERRLEN];\n std::fill(err, err + ERRLEN, 0);\n if (KOPSIK_API_SUCCESS != kopsik_set_api_token(\n ctx, err, ERRLEN, apiToken)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n \/\/ Load user that is referenced by the session\n KopsikUser *user = kopsik_user_init();\n if (KOPSIK_API_SUCCESS != kopsik_current_user(\n ctx, err, ERRLEN, user)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n kopsik_user_clear(user);\n\n if (\"sync\" == args[0]) {\n if (KOPSIK_API_SUCCESS != kopsik_sync(ctx, err, ERRLEN, 1)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n std::cout << \"Synced.\" << std::endl;\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"status\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n int found(0);\n if (KOPSIK_API_SUCCESS != kopsik_running_time_entry_view_item(\n ctx, err, ERRLEN, te, &found)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (found) {\n std::cout << \"Tracking: \" << te->Description << std::endl;\n } else {\n std::cout << \"Not tracking.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"pushable\" == args[0]) {\n KopsikPushableModelStats stats;\n if (KOPSIK_API_SUCCESS != kopsik_pushable_models(\n ctx, err, ERRLEN, &stats)) {\n std::cerr << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n std::cout << stats.TimeEntries << \" pushable time entries.\" << std::endl;\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"start\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_start(\n ctx, err, ERRLEN, \"New time entry\", te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n if (te->Description) {\n std::cout << \"Started: \" << te->Description << std::endl;\n } else {\n std::cout << \"Started.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"stop\" == args[0]) {\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_stop(\n ctx, err, ERRLEN, te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n if (te->Description) {\n std::cout << \"Stopped: \" << te->Description << std::endl;\n } else {\n std::cout << \"Stopped.\" << std::endl;\n }\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"list\" == args[0]) {\n KopsikTimeEntryViewItemList *list =\n kopsik_time_entry_view_item_list_init();\n if (KOPSIK_API_SUCCESS != kopsik_time_entry_view_items(\n ctx, err, ERRLEN, list)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n for (unsigned int i = 0; i < list->Length; i++) {\n KopsikTimeEntryViewItem *item = list->ViewItems[i];\n std::cout << KopsikTimeEntryViewItemToString(item) << std::endl;\n }\n std::cout << \"Got \" << list->Length << \" time entry view items.\"\n << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"listen\" == args[0]) {\n std::cout << \"Listening to websocket.. \" << std::endl;\n kopsik_set_change_callback(ctx, on_model_change);\n if (KOPSIK_API_SUCCESS != kopsik_websocket_start(ctx, err, ERRLEN)) {\n std::cerr << \"Error starting websocket: \"\n << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n while (true) {\n Poco::Thread::sleep(1000);\n }\n if (KOPSIK_API_SUCCESS != kopsik_websocket_stop(ctx, err, ERRLEN)) {\n std::cerr << \"Error stopping websocket: \"\n << err << std::endl;\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n return Poco::Util::Application::EXIT_OK;\n }\n\n if (\"continue\" == args[0]) {\n KopsikTimeEntryViewItemList *list =\n kopsik_time_entry_view_item_list_init();\n\n if (KOPSIK_API_SUCCESS != kopsik_time_entry_view_items(\n ctx, err, ERRLEN, list)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n if (!list->Length) {\n std::cout << \"No time entry found to continue.\" << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n return Poco::Util::Application::EXIT_OK;\n }\n\n KopsikTimeEntryViewItem *te = kopsik_time_entry_view_item_init();\n if (KOPSIK_API_SUCCESS != kopsik_continue(\n ctx, err, ERRLEN, list->ViewItems[0]->GUID, te)) {\n std::cerr << err << std::endl;\n kopsik_time_entry_view_item_list_clear(list);\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_SOFTWARE;\n }\n\n if (KOPSIK_API_SUCCESS != kopsik_push(ctx, err, ERRLEN)) {\n std::cerr << err << std::endl;\n }\n\n if (te->Description) {\n std::cout << \"Started: \" << te->Description << std::endl;\n } else {\n std::cout << \"Started.\" << std::endl;\n }\n\n kopsik_time_entry_view_item_list_clear(list);\n kopsik_time_entry_view_item_clear(te);\n return Poco::Util::Application::EXIT_OK;\n }\n\n usage();\n return Poco::Util::Application::EXIT_USAGE;\n }\n} \/\/ namespace command_line_client\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2006-2008 The FLWOR Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef ZORBA_UTF8_UTIL_TCC\n#define ZORBA_UTF8_UTIL_TCC\n\n#ifndef ZORBA_UTF8_UTIL_H\n#error \"This file is not meant to be included directly.\"\n#endif \/* ZORBA_UTF8_UTIL_H *\/\n\n#include <cctype>\n\n#include \"util\/string\/string_traits.h\"\n\nnamespace zorba {\nnamespace utf8 {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class StringType> back_html_uri_insert_iterator<StringType>&\nback_html_uri_insert_iterator<StringType>::operator=( value_type c ) {\n char const dec2hex[] = \"0123456789ABCDEF\";\n unsigned u = c & 0xFF;\n if ( !isprint( u ) ) {\n utf8::encoded_char_type ec;\n utf8::size_type const bytes = utf8::encode( c, ec );\n for ( size_type i = 0; i < bytes; ++i ) {\n u = ec[i] & 0xFF;\n buf_[1] = dec2hex[ u >> 4 ];\n buf_[2] = dec2hex[ u & 0x0F ];\n this->container->append( buf_, 3 );\n }\n } else {\n this->container->push_back( c );\n }\n return *this;\n}\n\ntemplate<class StringType> back_iri_insert_iterator<StringType>&\nback_iri_insert_iterator<StringType>::operator=( value_type c ) {\n char const dec2hex[] = \"0123456789ABCDEF\";\n unsigned u = c & 0xFF;\n if ( unicode::is_ucschar( c ) || unicode::is_iprivate( c ) ||\n unicode::is_invalid_in_iri( c ) ) {\n utf8::encoded_char_type ec;\n utf8::size_type const bytes = utf8::encode( c, ec );\n for ( size_type i = 0; i < bytes; ++i ) {\n u = ec[i] & 0xFF;;\n buf_[1] = dec2hex[ u >> 4 ];\n buf_[2] = dec2hex[ u & 0x0F ];\n this->container->append( buf_, 3 );\n }\n } else {\n this->container->push_back( c );\n }\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class OctetIterator>\nunicode::code_point next_char( OctetIterator &i ) {\n unicode::code_point c = *i & 0xFFu; \/\/ prevents sign-extension\n if ( c < 0x80 ) \/\/ special-case ASCII\n ++i;\n else {\n size_type const len = char_length( c );\n unsigned m = (0x7F >> len) & 0x1F; \/\/ mask\n c = unicode::code_point( 0 );\n switch ( len ) {\n case 6: c |= ((*i & m ) << 30); ++i; m = 0x3F;\n case 5: c |= ((*i & m ) << 24); ++i; m = 0x3F;\n case 4: c |= ((*i & m ) << 18); ++i; m = 0x3F;\n case 3: c |= ((*i & m ) << 12); ++i; m = 0x3F;\n case 2: c |= ((*i & m ) << 6); ++i;\n c |= (*i & 0x3F) ; ++i;\n }\n }\n return c;\n}\n\ntemplate<class OctetIterator>\nunicode::code_point prev_char( OctetIterator &oi ) {\n while ( !is_start_byte( *--oi ) ) ;\n OctetIterator temp( oi );\n return next_char( temp );\n}\n\n#ifndef ZORBA_NO_ICU\n\ntemplate<class InputStringType,class OutputStringType>\nbool normalize( InputStringType const &in, unicode::normalization::type n,\n OutputStringType *out ) {\n unicode::string u_in;\n if ( !unicode::to_string( in, &u_in ) )\n return false;\n unicode::string u_out;\n if ( !unicode::normalize( u_in, n, &u_out ) )\n return false;\n storage_type *temp;\n size_type temp_len;\n if ( !utf8::to_string( u_out.getBuffer(), u_out.length(), &temp, &temp_len ) )\n return false;\n out->assign( temp, temp_len );\n if ( !string_traits<OutputStringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n}\n\n#endif \/* ZORBA_NO_ICU *\/\n\ntemplate<class InputStringType,class OutputStringType>\nvoid strip_diacritics( InputStringType const &in, OutputStringType *out ) {\n InputStringType in_normalized;\n#ifndef ZORBA_NO_ICU\n normalize( in, unicode::normalization::NFKD, &in_normalized );\n#else\n in_normalized = in.c_str();\n#endif \/* ZORBA_NO_ICU *\/\n out->clear();\n out->reserve( in_normalized.size() );\n std::copy(\n in_normalized.begin(), in_normalized.end(),\n ascii::back_ascii_inserter( *out )\n );\n}\n\n#ifndef ZORBA_NO_ICU\n\ntemplate<class StringType>\nbool to_string( unicode::char_type const *in, size_type in_len,\n StringType *out ) {\n storage_type *temp;\n size_type temp_len;\n if ( to_string( in, in_len, &temp, &temp_len ) ) {\n out->assign( temp, temp_len );\n if ( !string_traits<StringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n }\n return false;\n}\n\n#ifndef WIN32\ntemplate<class StringType>\nbool to_string( wchar_t const *in, size_type in_len, StringType *out ) {\n storage_type *temp;\n size_type temp_len;\n if ( utf8::to_string( in, in_len, &temp, &temp_len ) ) {\n out->assign( temp, temp_len );\n if ( !string_traits<StringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n }\n return false;\n}\n#endif \/* WIN32 *\/\n\n#endif \/* ZORBA_NO_ICU *\/\n\ntemplate<class InputStringType,class OutputStringType>\nvoid to_lower( InputStringType const &in, OutputStringType *out ) {\n typename utf8_stringify<InputStringType const>::type const u_in( in );\n typename utf8_stringify<OutputStringType>::type u_out( *out );\n out->clear(); \/\/ TODO: should this be here?\n std::transform(\n u_in.begin(), u_in.end(), std::back_inserter( u_out ), unicode::to_lower\n );\n}\n\ntemplate<class InputStringType,class OutputStringType>\nvoid to_upper( InputStringType const &in, OutputStringType *out ) {\n typename utf8_stringify<InputStringType const>::type const u_in( in );\n typename utf8_stringify<OutputStringType>::type u_out( *out );\n out->clear(); \/\/ TODO: should this be here?\n std::transform(\n u_in.begin(), u_in.end(), std::back_inserter( u_out ), unicode::to_upper\n );\n}\n\n} \/\/ namespace utf8\n} \/\/ namespace zorba\n\n#endif \/* ZORBA_UTF8_UTIL_TCC *\/\n\/*\n * Local variables:\n * mode: c++\n * End:\n *\/\n\/* vim:set et sw=2 ts=2: *\/\n<commit_msg>Now using better diacritics-stripping algorithm.<commit_after>\/*\n * Copyright 2006-2008 The FLWOR Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef ZORBA_UTF8_UTIL_TCC\n#define ZORBA_UTF8_UTIL_TCC\n\n#ifndef ZORBA_UTF8_UTIL_H\n#error \"This file is not meant to be included directly.\"\n#endif \/* ZORBA_UTF8_UTIL_H *\/\n\n#include <cctype>\n\n#include \"util\/string\/string_traits.h\"\n\nnamespace zorba {\nnamespace utf8 {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class StringType> back_html_uri_insert_iterator<StringType>&\nback_html_uri_insert_iterator<StringType>::operator=( value_type c ) {\n char const dec2hex[] = \"0123456789ABCDEF\";\n unsigned u = c & 0xFF;\n if ( !isprint( u ) ) {\n utf8::encoded_char_type ec;\n utf8::size_type const bytes = utf8::encode( c, ec );\n for ( size_type i = 0; i < bytes; ++i ) {\n u = ec[i] & 0xFF;\n buf_[1] = dec2hex[ u >> 4 ];\n buf_[2] = dec2hex[ u & 0x0F ];\n this->container->append( buf_, 3 );\n }\n } else {\n this->container->push_back( c );\n }\n return *this;\n}\n\ntemplate<class StringType> back_iri_insert_iterator<StringType>&\nback_iri_insert_iterator<StringType>::operator=( value_type c ) {\n char const dec2hex[] = \"0123456789ABCDEF\";\n unsigned u = c & 0xFF;\n if ( unicode::is_ucschar( c ) || unicode::is_iprivate( c ) ||\n unicode::is_invalid_in_iri( c ) ) {\n utf8::encoded_char_type ec;\n utf8::size_type const bytes = utf8::encode( c, ec );\n for ( size_type i = 0; i < bytes; ++i ) {\n u = ec[i] & 0xFF;;\n buf_[1] = dec2hex[ u >> 4 ];\n buf_[2] = dec2hex[ u & 0x0F ];\n this->container->append( buf_, 3 );\n }\n } else {\n this->container->push_back( c );\n }\n return *this;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntemplate<class OctetIterator>\nunicode::code_point next_char( OctetIterator &i ) {\n unicode::code_point c = *i & 0xFFu; \/\/ prevents sign-extension\n if ( c < 0x80 ) \/\/ special-case ASCII\n ++i;\n else {\n size_type const len = char_length( c );\n unsigned m = (0x7F >> len) & 0x1F; \/\/ mask\n c = unicode::code_point( 0 );\n switch ( len ) {\n case 6: c |= ((*i & m ) << 30); ++i; m = 0x3F;\n case 5: c |= ((*i & m ) << 24); ++i; m = 0x3F;\n case 4: c |= ((*i & m ) << 18); ++i; m = 0x3F;\n case 3: c |= ((*i & m ) << 12); ++i; m = 0x3F;\n case 2: c |= ((*i & m ) << 6); ++i;\n c |= (*i & 0x3F) ; ++i;\n }\n }\n return c;\n}\n\ntemplate<class OctetIterator>\nunicode::code_point prev_char( OctetIterator &oi ) {\n while ( !is_start_byte( *--oi ) ) ;\n OctetIterator temp( oi );\n return next_char( temp );\n}\n\n#ifndef ZORBA_NO_ICU\n\ntemplate<class InputStringType,class OutputStringType>\nbool normalize( InputStringType const &in, unicode::normalization::type n,\n OutputStringType *out ) {\n unicode::string u_in;\n if ( !unicode::to_string( in, &u_in ) )\n return false;\n unicode::string u_out;\n if ( !unicode::normalize( u_in, n, &u_out ) )\n return false;\n storage_type *temp;\n size_type temp_len;\n if ( !utf8::to_string( u_out.getBuffer(), u_out.length(), &temp, &temp_len ) )\n return false;\n out->assign( temp, temp_len );\n if ( !string_traits<OutputStringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n}\n\n#endif \/* ZORBA_NO_ICU *\/\n\ntemplate<class InputStringType,class OutputStringType>\nbool strip_diacritics( InputStringType const &in, OutputStringType *out ) {\n#ifndef ZORBA_NO_ICU\n unicode::string u_in;\n if ( !unicode::to_string( in, &u_in ) )\n return false;\n unicode::string u_out;\n unicode::strip_diacritics( u_in, &u_out );\n storage_type *temp;\n size_type temp_len;\n if ( !utf8::to_string( u_out.getBuffer(), u_out.length(), &temp, &temp_len ) )\n return false;\n out->assign( temp, temp_len );\n if ( !string_traits<OutputStringType>::takes_pointer_ownership )\n delete[] temp;\n#else\n out->clear();\n out->reserve( in.size() );\n std::copy( in.begin(), in.end(), ascii::back_ascii_inserter( *out ) );\n#endif \/* ZORBA_NO_ICU *\/\n return true;\n}\n\n#ifndef ZORBA_NO_ICU\n\ntemplate<class StringType>\nbool to_string( unicode::char_type const *in, size_type in_len,\n StringType *out ) {\n storage_type *temp;\n size_type temp_len;\n if ( to_string( in, in_len, &temp, &temp_len ) ) {\n out->assign( temp, temp_len );\n if ( !string_traits<StringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n }\n return false;\n}\n\n#ifndef WIN32\ntemplate<class StringType>\nbool to_string( wchar_t const *in, size_type in_len, StringType *out ) {\n storage_type *temp;\n size_type temp_len;\n if ( utf8::to_string( in, in_len, &temp, &temp_len ) ) {\n out->assign( temp, temp_len );\n if ( !string_traits<StringType>::takes_pointer_ownership )\n delete[] temp;\n return true;\n }\n return false;\n}\n#endif \/* WIN32 *\/\n\n#endif \/* ZORBA_NO_ICU *\/\n\ntemplate<class InputStringType,class OutputStringType>\nvoid to_lower( InputStringType const &in, OutputStringType *out ) {\n typename utf8_stringify<InputStringType const>::type const u_in( in );\n typename utf8_stringify<OutputStringType>::type u_out( *out );\n out->clear(); \/\/ TODO: should this be here?\n std::transform(\n u_in.begin(), u_in.end(), std::back_inserter( u_out ), unicode::to_lower\n );\n}\n\ntemplate<class InputStringType,class OutputStringType>\nvoid to_upper( InputStringType const &in, OutputStringType *out ) {\n typename utf8_stringify<InputStringType const>::type const u_in( in );\n typename utf8_stringify<OutputStringType>::type u_out( *out );\n out->clear(); \/\/ TODO: should this be here?\n std::transform(\n u_in.begin(), u_in.end(), std::back_inserter( u_out ), unicode::to_upper\n );\n}\n\n} \/\/ namespace utf8\n} \/\/ namespace zorba\n\n#endif \/* ZORBA_UTF8_UTIL_TCC *\/\n\/*\n * Local variables:\n * mode: c++\n * End:\n *\/\n\/* vim:set et sw=2 ts=2: *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2021 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <interfaces\/init.h>\n#include <interfaces\/node.h>\n#include <qt\/bitcoin.h>\n#include <qt\/test\/apptests.h>\n#include <qt\/test\/optiontests.h>\n#include <qt\/test\/rpcnestedtests.h>\n#include <qt\/test\/uritests.h>\n#include <test\/util\/setup_common.h>\n\n#ifdef ENABLE_WALLET\n#include <qt\/test\/addressbooktests.h>\n#include <qt\/test\/wallettests.h>\n#endif \/\/ ENABLE_WALLET\n\n#include <QApplication>\n#include <QObject>\n#include <QTest>\n#include <functional>\n\n#if defined(QT_STATICPLUGIN)\n#include <QtPlugin>\n#if defined(QT_QPA_PLATFORM_MINIMAL)\nQ_IMPORT_PLUGIN(QMinimalIntegrationPlugin);\n#endif\n#if defined(QT_QPA_PLATFORM_XCB)\nQ_IMPORT_PLUGIN(QXcbIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_WINDOWS)\nQ_IMPORT_PLUGIN(QWindowsIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_COCOA)\nQ_IMPORT_PLUGIN(QCocoaIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_ANDROID)\nQ_IMPORT_PLUGIN(QAndroidPlatformIntegrationPlugin)\n#endif\n#endif\n\nusing node::NodeContext;\n\nconst std::function<void(const std::string&)> G_TEST_LOG_FUN{};\n\nconst std::function<std::vector<const char*>()> G_TEST_COMMAND_LINE_ARGUMENTS{};\n\n\/\/ This is all you need to run all the tests\nint main(int argc, char* argv[])\n{\n \/\/ Initialize persistent globals with the testing setup state for sanity.\n \/\/ E.g. -datadir in gArgs is set to a temp directory dummy value (instead\n \/\/ of defaulting to the default datadir), or globalChainParams is set to\n \/\/ regtest params.\n \/\/\n \/\/ All tests must use their own testing setup (if needed).\n {\n BasicTestingSetup dummy{CBaseChainParams::REGTEST};\n }\n\n std::unique_ptr<interfaces::Init> init = interfaces::MakeGuiInit(argc, argv);\n gArgs.ForceSetArg(\"-listen\", \"0\");\n gArgs.ForceSetArg(\"-listenonion\", \"0\");\n gArgs.ForceSetArg(\"-discover\", \"0\");\n gArgs.ForceSetArg(\"-dnsseed\", \"0\");\n gArgs.ForceSetArg(\"-fixedseeds\", \"0\");\n gArgs.ForceSetArg(\"-upnp\", \"0\");\n gArgs.ForceSetArg(\"-natpmp\", \"0\");\n\n bool fInvalid = false;\n\n \/\/ Prefer the \"minimal\" platform for the test instead of the normal default\n \/\/ platform (\"xcb\", \"windows\", or \"cocoa\") so tests can't unintentionally\n \/\/ interfere with any background GUIs and don't require extra resources.\n #if defined(WIN32)\n if (getenv(\"QT_QPA_PLATFORM\") == nullptr) _putenv_s(\"QT_QPA_PLATFORM\", \"minimal\");\n #else\n setenv(\"QT_QPA_PLATFORM\", \"minimal\", 0 \/* overwrite *\/);\n #endif\n\n \/\/ Don't remove this, it's needed to access\n \/\/ QApplication:: and QCoreApplication:: in the tests\n BitcoinApplication app;\n app.setApplicationName(\"Bitcoin-Qt-test\");\n app.createNode(*init);\n\n AppTests app_tests(app);\n if (QTest::qExec(&app_tests) != 0) {\n fInvalid = true;\n }\n OptionTests options_tests(app.node());\n if (QTest::qExec(&options_tests) != 0) {\n fInvalid = true;\n }\n URITests test1;\n if (QTest::qExec(&test1) != 0) {\n fInvalid = true;\n }\n RPCNestedTests test3(app.node());\n if (QTest::qExec(&test3) != 0) {\n fInvalid = true;\n }\n#ifdef ENABLE_WALLET\n WalletTests test5(app.node());\n if (QTest::qExec(&test5) != 0) {\n fInvalid = true;\n }\n AddressBookTests test6(app.node());\n if (QTest::qExec(&test6) != 0) {\n fInvalid = true;\n }\n#endif\n\n return fInvalid;\n}\n<commit_msg>gui: add test runner summary<commit_after>\/\/ Copyright (c) 2009-2021 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#if defined(HAVE_CONFIG_H)\n#include <config\/bitcoin-config.h>\n#endif\n\n#include <interfaces\/init.h>\n#include <interfaces\/node.h>\n#include <qt\/bitcoin.h>\n#include <qt\/test\/apptests.h>\n#include <qt\/test\/optiontests.h>\n#include <qt\/test\/rpcnestedtests.h>\n#include <qt\/test\/uritests.h>\n#include <test\/util\/setup_common.h>\n\n#ifdef ENABLE_WALLET\n#include <qt\/test\/addressbooktests.h>\n#include <qt\/test\/wallettests.h>\n#endif \/\/ ENABLE_WALLET\n\n#include <QApplication>\n#include <QDebug>\n#include <QObject>\n#include <QTest>\n\n#include <functional>\n\n#if defined(QT_STATICPLUGIN)\n#include <QtPlugin>\n#if defined(QT_QPA_PLATFORM_MINIMAL)\nQ_IMPORT_PLUGIN(QMinimalIntegrationPlugin);\n#endif\n#if defined(QT_QPA_PLATFORM_XCB)\nQ_IMPORT_PLUGIN(QXcbIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_WINDOWS)\nQ_IMPORT_PLUGIN(QWindowsIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_COCOA)\nQ_IMPORT_PLUGIN(QCocoaIntegrationPlugin);\n#elif defined(QT_QPA_PLATFORM_ANDROID)\nQ_IMPORT_PLUGIN(QAndroidPlatformIntegrationPlugin)\n#endif\n#endif\n\nusing node::NodeContext;\n\nconst std::function<void(const std::string&)> G_TEST_LOG_FUN{};\n\nconst std::function<std::vector<const char*>()> G_TEST_COMMAND_LINE_ARGUMENTS{};\n\n\/\/ This is all you need to run all the tests\nint main(int argc, char* argv[])\n{\n \/\/ Initialize persistent globals with the testing setup state for sanity.\n \/\/ E.g. -datadir in gArgs is set to a temp directory dummy value (instead\n \/\/ of defaulting to the default datadir), or globalChainParams is set to\n \/\/ regtest params.\n \/\/\n \/\/ All tests must use their own testing setup (if needed).\n {\n BasicTestingSetup dummy{CBaseChainParams::REGTEST};\n }\n\n std::unique_ptr<interfaces::Init> init = interfaces::MakeGuiInit(argc, argv);\n gArgs.ForceSetArg(\"-listen\", \"0\");\n gArgs.ForceSetArg(\"-listenonion\", \"0\");\n gArgs.ForceSetArg(\"-discover\", \"0\");\n gArgs.ForceSetArg(\"-dnsseed\", \"0\");\n gArgs.ForceSetArg(\"-fixedseeds\", \"0\");\n gArgs.ForceSetArg(\"-upnp\", \"0\");\n gArgs.ForceSetArg(\"-natpmp\", \"0\");\n\n bool fInvalid = false;\n\n \/\/ Prefer the \"minimal\" platform for the test instead of the normal default\n \/\/ platform (\"xcb\", \"windows\", or \"cocoa\") so tests can't unintentionally\n \/\/ interfere with any background GUIs and don't require extra resources.\n #if defined(WIN32)\n if (getenv(\"QT_QPA_PLATFORM\") == nullptr) _putenv_s(\"QT_QPA_PLATFORM\", \"minimal\");\n #else\n setenv(\"QT_QPA_PLATFORM\", \"minimal\", 0 \/* overwrite *\/);\n #endif\n\n \/\/ Don't remove this, it's needed to access\n \/\/ QApplication:: and QCoreApplication:: in the tests\n BitcoinApplication app;\n app.setApplicationName(\"Bitcoin-Qt-test\");\n app.createNode(*init);\n\n AppTests app_tests(app);\n if (QTest::qExec(&app_tests) != 0) {\n fInvalid = true;\n }\n OptionTests options_tests(app.node());\n if (QTest::qExec(&options_tests) != 0) {\n fInvalid = true;\n }\n URITests test1;\n if (QTest::qExec(&test1) != 0) {\n fInvalid = true;\n }\n RPCNestedTests test3(app.node());\n if (QTest::qExec(&test3) != 0) {\n fInvalid = true;\n }\n#ifdef ENABLE_WALLET\n WalletTests test5(app.node());\n if (QTest::qExec(&test5) != 0) {\n fInvalid = true;\n }\n AddressBookTests test6(app.node());\n if (QTest::qExec(&test6) != 0) {\n fInvalid = true;\n }\n#endif\n\n if (fInvalid) {\n qWarning(\"\\nThere were errors in some of the tests above.\\n\");\n } else {\n qDebug(\"\\nAll tests passed.\\n\");\n }\n return fInvalid;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n\n#include <boost\/filesystem.hpp>\n\n#include <QMessageBox>\n#include <QFileDialog>\n\n#include \"fish_annotator\/db_uploader\/database_info.h\"\n#include \"fish_annotator\/db_uploader\/mainwindow.h\"\n#include \"ui_mainwindow.h\"\n\nnamespace fish_annotator { namespace db_uploader {\n\nnamespace fs = boost::filesystem;\n\nnamespace { \/\/anonymous\n\nstatic const std::vector<std::string> kDirExtensions = {\n \".jpg\", \".png\", \".bmp\", \".tif\", \".jpeg\",\n \".JPG\", \".PNG\", \".BMP\", \".TIF\", \".JPEG\"};\n\n} \/\/ anonymous namespace\n\nMainWindow::MainWindow(QWidget *parent)\n : ui_(new Ui::MainWindow) \n , input_db_(new QSqlDatabase())\n , output_db_(new QSqlDatabase()) {\n ui_->setupUi(this);\n setWindowTitle(\"Database Uploader\");\n#ifdef _WIN32\n setWindowIcon(QIcon(\":\/icons\/cvision\/cvision_no_text.ico\"));\n#endif\n fs::path current_path(QDir::currentPath().toStdString());\n fs::path default_input = current_path \/ fs::path(\"default.input_database\");\n fs::path default_output = current_path \/ fs::path(\"default.output_database\");\n if(fs::exists(default_input)) {\n DatabaseInfo input;\n deserialize(input, default_input.string());\n ui_->inputServer->setText(input.getServer().c_str());\n ui_->inputDatabase->setText(input.getDatabase().c_str());\n ui_->inputUsername->setText(input.getUsername().c_str());\n }\n if(fs::exists(default_output)) {\n DatabaseInfo output;\n deserialize(output, default_output.string());\n ui_->outputServer->setText(output.getServer().c_str());\n ui_->outputDatabase->setText(output.getDatabase().c_str());\n ui_->outputUsername->setText(output.getUsername().c_str());\n }\n}\n\nvoid MainWindow::on_connectInputDb_clicked() {\n ui_->inputDbStatus->setText(\"Attempting to connect...\");\n ui_->inputDbStatus->repaint();\n *input_db_ = QSqlDatabase::addDatabase(\"QODBC3\", \"input\");\n if(input_db_->isDriverAvailable(\"QODBC\") == false) {\n QMessageBox err;\n err.critical(0, \"Error\", \"ODBC driver is not available!\");\n }\n input_db_->setDatabaseName(\n \"DRIVER={SQL Server};SERVER={\" + ui_->inputServer->text() + \n \"};DATABASE=\" + ui_->inputDatabase->text() + \n \";Trusted_Connection=no;user_id=\" + ui_->inputUsername->text() + \n \";password=\" + ui_->inputPassword->text() + \";WSID=.\");\n if(input_db_->isValid() == false) {\n ui_->inputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", \"Not a valid database!\");\n }\n if(input_db_->open() == false) {\n ui_->inputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", input_db_->lastError().text());\n }\n else {\n ui_->inputDbStatus->setText(\"Connected\");\n }\n if(output_db_->isOpen() == true && input_db_->isOpen() == true) {\n ui_->upload->setEnabled(true);\n }\n}\n\nvoid MainWindow::on_connectOutputDb_clicked() {\n ui_->outputDbStatus->setText(\"Attempting to connect...\");\n ui_->outputDbStatus->repaint();\n *output_db_ = QSqlDatabase::addDatabase(\"QODBC3\", \"output\");\n if(output_db_->isDriverAvailable(\"QODBC\") == false) {\n QMessageBox err;\n err.critical(0, \"Error\", \"ODBC driver is not available!\");\n }\n output_db_->setDatabaseName(\n \"DRIVER={SQL Server};SERVER={\" + ui_->outputServer->text() + \n \"};DATABASE=\" + ui_->outputDatabase->text() + \n \";Trusted_Connection=no;user_id=\" + ui_->outputUsername->text() + \n \";password=\" + ui_->outputPassword->text() + \";WSID=.\");\n if(output_db_->isValid() == false) {\n ui_->outputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", \"Not a valid database!\");\n }\n if(output_db_->open() == false) {\n ui_->outputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", output_db_->lastError().text());\n }\n else {\n ui_->outputDbStatus->setText(\"Connected\");\n }\n if(output_db_->isOpen() == true && input_db_->isOpen() == true) {\n ui_->upload->setEnabled(true);\n }\n}\n\nvoid MainWindow::on_browseImageDir_clicked() {\n ui_->imageDirectory->setText(QFileDialog::getExistingDirectory(\n this, \"Select annotated image directory\"));\n}\n\nvoid MainWindow::on_cancel_clicked() {\n QApplication::quit();\n}\n\nvoid MainWindow::on_upload_clicked() {\n QString image_dir = ui_->imageDirectory->text();\n std::vector<boost::filesystem::path> image_files;\n fs::directory_iterator dir_it(image_dir.toStdString());\n fs::directory_iterator dir_end;\n for(; dir_it != dir_end; ++dir_it) {\n fs::path ext(dir_it->path().extension());\n for(auto &ok_ext : kDirExtensions) {\n if(ext == ok_ext) {\n image_files.push_back(dir_it->path());\n }\n }\n }\n std::sort(image_files.begin(), image_files.end());\n}\n\n#include \"..\/..\/include\/fish_annotator\/db_uploader\/moc_mainwindow.cpp\"\n\n}} \/\/ namespace fish_annotator::db_uploader\n\n<commit_msg>Finish implementation of upload<commit_after>#include <algorithm>\n\n#include <boost\/filesystem.hpp>\n\n#include <QMessageBox>\n#include <QFileDialog>\n#include <QSqlTableModel>\n#include <QProgressDialog>\n\n#include \"fish_annotator\/image_annotator\/image_annotation.h\"\n#include \"fish_annotator\/db_uploader\/database_info.h\"\n#include \"fish_annotator\/db_uploader\/mainwindow.h\"\n#include \"ui_mainwindow.h\"\n\nnamespace fish_annotator { namespace db_uploader {\n\nnamespace fs = boost::filesystem;\n\nnamespace { \/\/anonymous\n\nstatic const std::vector<std::string> kDirExtensions = {\n \".jpg\", \".png\", \".bmp\", \".tif\", \".jpeg\",\n \".JPG\", \".PNG\", \".BMP\", \".TIF\", \".JPEG\"};\n\n} \/\/ anonymous namespace\n\nMainWindow::MainWindow(QWidget *parent)\n : ui_(new Ui::MainWindow) \n , input_db_(new QSqlDatabase())\n , output_db_(new QSqlDatabase()) {\n ui_->setupUi(this);\n setWindowTitle(\"Database Uploader\");\n#ifdef _WIN32\n setWindowIcon(QIcon(\":\/icons\/cvision\/cvision_no_text.ico\"));\n#endif\n fs::path current_path(QDir::currentPath().toStdString());\n fs::path default_input = current_path \/ fs::path(\"default.input_database\");\n fs::path default_output = current_path \/ fs::path(\"default.output_database\");\n if(fs::exists(default_input)) {\n DatabaseInfo input;\n deserialize(input, default_input.string());\n ui_->inputServer->setText(input.getServer().c_str());\n ui_->inputDatabase->setText(input.getDatabase().c_str());\n ui_->inputUsername->setText(input.getUsername().c_str());\n }\n if(fs::exists(default_output)) {\n DatabaseInfo output;\n deserialize(output, default_output.string());\n ui_->outputServer->setText(output.getServer().c_str());\n ui_->outputDatabase->setText(output.getDatabase().c_str());\n ui_->outputUsername->setText(output.getUsername().c_str());\n }\n}\n\nvoid MainWindow::on_connectInputDb_clicked() {\n ui_->inputDbStatus->setText(\"Attempting to connect...\");\n ui_->inputDbStatus->repaint();\n *input_db_ = QSqlDatabase::addDatabase(\"QODBC3\", \"input\");\n if(input_db_->isDriverAvailable(\"QODBC\") == false) {\n QMessageBox err;\n err.critical(0, \"Error\", \"ODBC driver is not available!\");\n }\n input_db_->setDatabaseName(\n \"DRIVER={SQL Server};SERVER={\" + ui_->inputServer->text() + \n \"};DATABASE=\" + ui_->inputDatabase->text() + \n \";Trusted_Connection=no;user_id=\" + ui_->inputUsername->text() + \n \";password=\" + ui_->inputPassword->text() + \";WSID=.\");\n if(input_db_->isValid() == false) {\n ui_->inputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", \"Not a valid database!\");\n }\n if(input_db_->open() == false) {\n ui_->inputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", input_db_->lastError().text());\n }\n else {\n ui_->inputDbStatus->setText(\"Connected\");\n }\n if(output_db_->isOpen() == true && input_db_->isOpen() == true) {\n ui_->upload->setEnabled(true);\n }\n}\n\nvoid MainWindow::on_connectOutputDb_clicked() {\n ui_->outputDbStatus->setText(\"Attempting to connect...\");\n ui_->outputDbStatus->repaint();\n *output_db_ = QSqlDatabase::addDatabase(\"QODBC3\", \"output\");\n if(output_db_->isDriverAvailable(\"QODBC\") == false) {\n QMessageBox err;\n err.critical(0, \"Error\", \"ODBC driver is not available!\");\n }\n output_db_->setDatabaseName(\n \"DRIVER={SQL Server};SERVER={\" + ui_->outputServer->text() + \n \"};DATABASE=\" + ui_->outputDatabase->text() + \n \";Trusted_Connection=no;user_id=\" + ui_->outputUsername->text() + \n \";password=\" + ui_->outputPassword->text() + \";WSID=.\");\n if(output_db_->isValid() == false) {\n ui_->outputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", \"Not a valid database!\");\n }\n if(output_db_->open() == false) {\n ui_->outputDbStatus->setText(\"Not connected\");\n QMessageBox err;\n err.critical(0, \"Error\", output_db_->lastError().text());\n }\n else {\n ui_->outputDbStatus->setText(\"Connected\");\n }\n if(output_db_->isOpen() == true && input_db_->isOpen() == true) {\n ui_->upload->setEnabled(true);\n }\n}\n\nvoid MainWindow::on_browseImageDir_clicked() {\n ui_->imageDirectory->setText(QFileDialog::getExistingDirectory(\n this, \"Select annotated image directory\"));\n}\n\nvoid MainWindow::on_cancel_clicked() {\n QApplication::quit();\n}\n\nvoid MainWindow::on_upload_clicked() {\n QString image_dir = ui_->imageDirectory->text();\n std::vector<boost::filesystem::path> image_files;\n fs::directory_iterator dir_it(image_dir.toStdString());\n fs::directory_iterator dir_end;\n for(; dir_it != dir_end; ++dir_it) {\n fs::path ext(dir_it->path().extension());\n for(auto &ok_ext : kDirExtensions) {\n if(ext == ok_ext) {\n image_files.push_back(dir_it->path());\n }\n }\n }\n std::sort(image_files.begin(), image_files.end());\n image_annotator::ImageAnnotationList annotations;\n annotations.read(image_files);\n int num_img = static_cast<int>(image_files.size());\n QSqlTableModel input_model(this, *input_db_);\n QSqlTableModel output_model(this, *output_db_);\n \/\/\/ @TODO Parse metadata from input database.\n output_model.setTable(\"dbo.measurements_data\");\n output_model.setEditStrategy(QSqlTableModel::OnManualSubmit);\n output_model.select();\n QProgressDialog progress(\n \"Uploading annotations...\",\n \"Abort\",\n 0,\n num_img,\n this);\n for(int img_index = 0; img_index < num_img; ++img_index) {\n progress.setValue(img_index);\n if(progress.wasCanceled()) {\n break;\n }\n auto ann = annotations.getImageAnnotations(image_files[img_index]);\n int num_ann = static_cast<int>(ann.size());\n for(int ai = 0; ai < num_ann; ++ai) {\n auto row_count = output_model.rowCount();\n if(output_model.insertRows(row_count, 1) == false) {\n progress.close();\n QMessageBox err;\n err.critical(0, \"Error\", \"Unable to insert row into table.\");\n break;\n }\n \/\/ surveyyear\n output_model.setData(output_model.index(row_count, 0), \"\");\n \/\/ areashortname\n output_model.setData(output_model.index(row_count, 1), \"\");\n \/\/ areacontrolpk\n output_model.setData(output_model.index(row_count, 2), \"\");\n \/\/ cameraControlIPK\n output_model.setData(output_model.index(row_count, 3), \"\");\n \/\/ station\n output_model.setData(output_model.index(row_count, 4), \"\");\n \/\/ quadrat\n output_model.setData(output_model.index(row_count, 5), \"\");\n \/\/ measurement\n double meas = 0.0;\n if(ann[ai]->type_ == kLine) {\n double xdiff = ann[ai]->area_.x - ann[ai]->area_.w;\n double ydiff = ann[ai]->area_.y - ann[ai]->area_.h;\n meas = std::sqrt(xdiff * xdiff + ydiff * ydiff);\n }\n output_model.setData(output_model.index(row_count, 6), \n std::to_string(meas).c_str());\n \/\/ latitude\n output_model.setData(output_model.index(row_count, 7), \"\");\n \/\/ longitude\n output_model.setData(output_model.index(row_count, 8), \"\");\n }\n if(output_model.submitAll() == true) {\n output_model.database().commit();\n }\n else {\n output_model.database().rollback();\n progress.close();\n QMessageBox err;\n err.critical(0, \"Error\", output_model.lastError().text());\n break;\n }\n }\n progress.setValue(num_img);\n}\n\n#include \"..\/..\/include\/fish_annotator\/db_uploader\/moc_mainwindow.cpp\"\n\n}} \/\/ namespace fish_annotator::db_uploader\n\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- PlatformDarwin.cpp --------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"PlatformDarwin.h\"\n\n\/\/ C Includes\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n\/\/ Project includes\n#include \"lldb\/Breakpoint\/BreakpointLocation.h\"\n#include \"lldb\/Core\/Debugger.h\"\n#include \"lldb\/Core\/Error.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Target\/Target.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n \n\n\/\/------------------------------------------------------------------\n\/\/\/ Default Constructor\n\/\/------------------------------------------------------------------\nPlatformDarwin::PlatformDarwin (bool is_host) :\n Platform(is_host), \/\/ This is the local host platform\n m_remote_platform_sp ()\n{\n}\n\n\/\/------------------------------------------------------------------\n\/\/\/ Destructor.\n\/\/\/\n\/\/\/ The destructor is virtual since this class is designed to be\n\/\/\/ inherited from by the plug-in instance.\n\/\/------------------------------------------------------------------\nPlatformDarwin::~PlatformDarwin()\n{\n}\n\n\nError\nPlatformDarwin::ResolveExecutable (const FileSpec &exe_file,\n const ArchSpec &exe_arch,\n lldb::ModuleSP &exe_module_sp)\n{\n Error error;\n \/\/ Nothing special to do here, just use the actual file and architecture\n\n char exe_path[PATH_MAX];\n FileSpec resolved_exe_file (exe_file);\n \n if (IsHost())\n {\n \/\/ If we have \"ls\" as the exe_file, resolve the executable loation based on\n \/\/ the current path variables\n if (!resolved_exe_file.Exists())\n {\n exe_file.GetPath (exe_path, sizeof(exe_path));\n resolved_exe_file.SetFile(exe_path, true);\n }\n\n if (!resolved_exe_file.Exists())\n resolved_exe_file.ResolveExecutableLocation ();\n\n \/\/ Resolve any executable within a bundle on MacOSX\n Host::ResolveExecutableInBundle (resolved_exe_file);\n \n if (resolved_exe_file.Exists())\n error.Clear();\n else\n {\n exe_file.GetPath (exe_path, sizeof(exe_path));\n error.SetErrorStringWithFormat (\"enable to find executable for '%s'\", exe_path);\n }\n }\n else\n {\n if (m_remote_platform_sp)\n {\n error = m_remote_platform_sp->ResolveExecutable (exe_file, \n exe_arch,\n exe_module_sp);\n }\n else\n {\n \/\/ We may connect to a process and use the provided executable (Don't use local $PATH).\n\n \/\/ Resolve any executable within a bundle on MacOSX\n Host::ResolveExecutableInBundle (resolved_exe_file);\n\n if (resolved_exe_file.Exists())\n error.Clear();\n else\n error.SetErrorStringWithFormat(\"the platform is not currently connected, and '%s' doesn't exist in the system root.\", resolved_exe_file.GetFilename().AsCString(\"\"));\n }\n }\n \n\n if (error.Success())\n {\n if (exe_arch.IsValid())\n {\n error = ModuleList::GetSharedModule (resolved_exe_file, \n exe_arch, \n NULL,\n NULL, \n 0, \n exe_module_sp, \n NULL, \n NULL);\n \n if (exe_module_sp->GetObjectFile() == NULL)\n {\n exe_module_sp.reset();\n error.SetErrorStringWithFormat (\"'%s%s%s' doesn't contain the architecture %s\",\n exe_file.GetDirectory().AsCString(\"\"),\n exe_file.GetDirectory() ? \"\/\" : \"\",\n exe_file.GetFilename().AsCString(\"\"),\n exe_arch.GetArchitectureName());\n }\n }\n else\n {\n \/\/ No valid architecture was specified, ask the platform for\n \/\/ the architectures that we should be using (in the correct order)\n \/\/ and see if we can find a match that way\n StreamString arch_names;\n ArchSpec platform_arch;\n for (uint32_t idx = 0; GetSupportedArchitectureAtIndex (idx, platform_arch); ++idx)\n {\n error = ModuleList::GetSharedModule (resolved_exe_file, \n platform_arch, \n NULL,\n NULL, \n 0, \n exe_module_sp, \n NULL, \n NULL);\n \/\/ Did we find an executable using one of the \n if (error.Success())\n {\n if (exe_module_sp && exe_module_sp->GetObjectFile())\n break;\n else\n error.SetErrorToGenericError();\n }\n \n if (idx > 0)\n arch_names.PutCString (\", \");\n arch_names.PutCString (platform_arch.GetArchitectureName());\n }\n \n if (error.Fail() || !exe_module_sp)\n {\n error.SetErrorStringWithFormat (\"'%s%s%s' doesn't contain any '%s' platform architectures: %s\",\n exe_file.GetDirectory().AsCString(\"\"),\n exe_file.GetDirectory() ? \"\/\" : \"\",\n exe_file.GetFilename().AsCString(\"\"),\n GetShortPluginName(),\n arch_names.GetString().c_str());\n }\n }\n }\n\n return error;\n}\n\n\nsize_t\nPlatformDarwin::GetSoftwareBreakpointTrapOpcode (Target &target, BreakpointSite *bp_site)\n{\n const uint8_t *trap_opcode = NULL;\n uint32_t trap_opcode_size = 0;\n bool bp_is_thumb = false;\n \n llvm::Triple::ArchType machine = target.GetArchitecture().GetMachine();\n switch (machine)\n {\n case llvm::Triple::x86:\n case llvm::Triple::x86_64:\n {\n static const uint8_t g_i386_breakpoint_opcode[] = { 0xCC };\n trap_opcode = g_i386_breakpoint_opcode;\n trap_opcode_size = sizeof(g_i386_breakpoint_opcode);\n }\n break;\n\n case llvm::Triple::thumb:\n bp_is_thumb = true; \/\/ Fall through...\n case llvm::Triple::arm:\n {\n static const uint8_t g_arm_breakpoint_opcode[] = { 0xFE, 0xDE, 0xFF, 0xE7 };\n static const uint8_t g_thumb_breakpooint_opcode[] = { 0xFE, 0xDE };\n\n \/\/ Auto detect arm\/thumb if it wasn't explicitly specified\n if (!bp_is_thumb)\n {\n lldb::BreakpointLocationSP bp_loc_sp (bp_site->GetOwnerAtIndex (0));\n if (bp_loc_sp)\n bp_is_thumb = bp_loc_sp->GetAddress().GetAddressClass () == eAddressClassCodeAlternateISA;\n }\n if (bp_is_thumb)\n {\n trap_opcode = g_thumb_breakpooint_opcode;\n trap_opcode_size = sizeof(g_thumb_breakpooint_opcode);\n break;\n }\n trap_opcode = g_arm_breakpoint_opcode;\n trap_opcode_size = sizeof(g_arm_breakpoint_opcode);\n }\n break;\n \n case llvm::Triple::ppc:\n case llvm::Triple::ppc64:\n {\n static const uint8_t g_ppc_breakpoint_opcode[] = { 0x7F, 0xC0, 0x00, 0x08 };\n trap_opcode = g_ppc_breakpoint_opcode;\n trap_opcode_size = sizeof(g_ppc_breakpoint_opcode);\n }\n break;\n \n default:\n assert(!\"Unhandled architecture in PlatformDarwin::GetSoftwareBreakpointTrapOpcode()\");\n break;\n }\n \n if (trap_opcode && trap_opcode_size)\n {\n if (bp_site->SetTrapOpcode(trap_opcode, trap_opcode_size))\n return trap_opcode_size;\n }\n return 0;\n\n}\n\nbool\nPlatformDarwin::GetRemoteOSVersion ()\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetOSVersion (m_major_os_version, \n m_minor_os_version, \n m_update_os_version);\n return false;\n}\n\nbool\nPlatformDarwin::GetRemoteOSBuildString (std::string &s)\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteOSBuildString (s);\n s.clear();\n return false;\n}\n\nbool\nPlatformDarwin::GetRemoteOSKernelDescription (std::string &s)\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteOSKernelDescription (s);\n s.clear();\n return false;\n}\n\n\/\/ Remote Platform subclasses need to override this function\nArchSpec\nPlatformDarwin::GetRemoteSystemArchitecture ()\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteSystemArchitecture ();\n return ArchSpec();\n}\n\n\nconst char *\nPlatformDarwin::GetHostname ()\n{\n if (IsHost())\n return Platform::GetHostname();\n\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetHostname ();\n return NULL;\n}\n\nbool\nPlatformDarwin::IsConnected () const\n{\n if (IsHost())\n return true;\n else if (m_remote_platform_sp)\n return m_remote_platform_sp->IsConnected();\n return false;\n}\n\nError\nPlatformDarwin::ConnectRemote (Args& args)\n{\n Error error;\n if (IsHost())\n {\n error.SetErrorStringWithFormat (\"can't connect to the host platform '%s', always connected\", GetShortPluginName());\n }\n else\n {\n if (!m_remote_platform_sp)\n m_remote_platform_sp = Platform::Create (\"remote-gdb-server\", error);\n\n if (m_remote_platform_sp)\n {\n if (error.Success())\n {\n if (m_remote_platform_sp)\n {\n error = m_remote_platform_sp->ConnectRemote (args);\n }\n else\n {\n error.SetErrorString (\"\\\"platform connect\\\" takes a single argument: <connect-url>\");\n }\n }\n }\n else\n error.SetErrorString (\"failed to create a 'remote-gdb-server' platform\");\n \n if (error.Fail())\n m_remote_platform_sp.reset();\n }\n\n return error;\n}\n\nError\nPlatformDarwin::DisconnectRemote ()\n{\n Error error;\n \n if (IsHost())\n {\n error.SetErrorStringWithFormat (\"can't disconnect from the host platform '%s', always connected\", GetShortPluginName());\n }\n else\n {\n if (m_remote_platform_sp)\n error = m_remote_platform_sp->DisconnectRemote ();\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return error;\n}\n\n\nbool\nPlatformDarwin::GetProcessInfo (lldb::pid_t pid, ProcessInstanceInfo &process_info)\n{\n bool sucess = false;\n if (IsHost())\n {\n sucess = Platform::GetProcessInfo (pid, process_info);\n }\n else\n {\n if (m_remote_platform_sp)\n sucess = m_remote_platform_sp->GetProcessInfo (pid, process_info);\n }\n return sucess;\n}\n\n\n\nuint32_t\nPlatformDarwin::FindProcesses (const ProcessInstanceInfoMatch &match_info,\n ProcessInstanceInfoList &process_infos)\n{\n uint32_t match_count = 0;\n if (IsHost())\n {\n \/\/ Let the base class figure out the host details\n match_count = Platform::FindProcesses (match_info, process_infos);\n }\n else\n {\n \/\/ If we are remote, we can only return results if we are connected\n if (m_remote_platform_sp)\n match_count = m_remote_platform_sp->FindProcesses (match_info, process_infos);\n }\n return match_count; \n}\n\nError\nPlatformDarwin::LaunchProcess (ProcessLaunchInfo &launch_info)\n{\n Error error;\n \n if (IsHost())\n {\n if (launch_info.GetFlags().Test (eLaunchFlagLaunchInShell))\n {\n const bool is_localhost = true;\n if (!launch_info.ConvertArgumentsForLaunchingInShell (error, is_localhost))\n return error;\n }\n error = Platform::LaunchProcess (launch_info);\n }\n else\n {\n if (m_remote_platform_sp)\n error = m_remote_platform_sp->LaunchProcess (launch_info);\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return error;\n}\n\nlldb::ProcessSP\nPlatformDarwin::Attach (ProcessAttachInfo &attach_info,\n Debugger &debugger,\n Target *target,\n Listener &listener, \n Error &error)\n{\n lldb::ProcessSP process_sp;\n \n if (IsHost())\n {\n if (target == NULL)\n {\n TargetSP new_target_sp;\n FileSpec emptyFileSpec;\n \n error = debugger.GetTargetList().CreateTarget (debugger,\n emptyFileSpec,\n NULL, \n false,\n NULL,\n new_target_sp);\n target = new_target_sp.get();\n }\n else\n error.Clear();\n \n if (target && error.Success())\n {\n debugger.GetTargetList().SetSelectedTarget(target);\n\n process_sp = target->CreateProcess (listener, attach_info.GetProcessPluginName());\n \n if (process_sp)\n error = process_sp->Attach (attach_info);\n }\n }\n else\n {\n if (m_remote_platform_sp)\n process_sp = m_remote_platform_sp->Attach (attach_info, debugger, target, listener, error);\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return process_sp;\n}\n\nconst char *\nPlatformDarwin::GetUserName (uint32_t uid)\n{\n \/\/ Check the cache in Platform in case we have already looked this uid up\n const char *user_name = Platform::GetUserName(uid);\n if (user_name)\n return user_name;\n\n if (IsRemote() && m_remote_platform_sp)\n return m_remote_platform_sp->GetUserName(uid);\n return NULL;\n}\n\nconst char *\nPlatformDarwin::GetGroupName (uint32_t gid)\n{\n const char *group_name = Platform::GetGroupName(gid);\n if (group_name)\n return group_name;\n\n if (IsRemote() && m_remote_platform_sp)\n return m_remote_platform_sp->GetGroupName(gid);\n return NULL;\n}\n\nbool\nPlatformDarwin::ModuleIsExcludedForNonModuleSpecificSearches (lldb_private::Target &target, const lldb::ModuleSP &module_sp)\n{\n ObjectFile *obj_file = module_sp->GetObjectFile();\n if (!obj_file)\n return false;\n \n ObjectFile::Type obj_type = obj_file->GetType();\n if (obj_type == ObjectFile::eTypeDynamicLinker)\n return true;\n else\n return false;\n}\n<commit_msg>Typo in error string.<commit_after>\/\/===-- PlatformDarwin.cpp --------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"PlatformDarwin.h\"\n\n\/\/ C Includes\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n\/\/ Project includes\n#include \"lldb\/Breakpoint\/BreakpointLocation.h\"\n#include \"lldb\/Core\/Debugger.h\"\n#include \"lldb\/Core\/Error.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Target\/Target.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n \n\n\/\/------------------------------------------------------------------\n\/\/\/ Default Constructor\n\/\/------------------------------------------------------------------\nPlatformDarwin::PlatformDarwin (bool is_host) :\n Platform(is_host), \/\/ This is the local host platform\n m_remote_platform_sp ()\n{\n}\n\n\/\/------------------------------------------------------------------\n\/\/\/ Destructor.\n\/\/\/\n\/\/\/ The destructor is virtual since this class is designed to be\n\/\/\/ inherited from by the plug-in instance.\n\/\/------------------------------------------------------------------\nPlatformDarwin::~PlatformDarwin()\n{\n}\n\n\nError\nPlatformDarwin::ResolveExecutable (const FileSpec &exe_file,\n const ArchSpec &exe_arch,\n lldb::ModuleSP &exe_module_sp)\n{\n Error error;\n \/\/ Nothing special to do here, just use the actual file and architecture\n\n char exe_path[PATH_MAX];\n FileSpec resolved_exe_file (exe_file);\n \n if (IsHost())\n {\n \/\/ If we have \"ls\" as the exe_file, resolve the executable loation based on\n \/\/ the current path variables\n if (!resolved_exe_file.Exists())\n {\n exe_file.GetPath (exe_path, sizeof(exe_path));\n resolved_exe_file.SetFile(exe_path, true);\n }\n\n if (!resolved_exe_file.Exists())\n resolved_exe_file.ResolveExecutableLocation ();\n\n \/\/ Resolve any executable within a bundle on MacOSX\n Host::ResolveExecutableInBundle (resolved_exe_file);\n \n if (resolved_exe_file.Exists())\n error.Clear();\n else\n {\n exe_file.GetPath (exe_path, sizeof(exe_path));\n error.SetErrorStringWithFormat (\"unable to find executable for '%s'\", exe_path);\n }\n }\n else\n {\n if (m_remote_platform_sp)\n {\n error = m_remote_platform_sp->ResolveExecutable (exe_file, \n exe_arch,\n exe_module_sp);\n }\n else\n {\n \/\/ We may connect to a process and use the provided executable (Don't use local $PATH).\n\n \/\/ Resolve any executable within a bundle on MacOSX\n Host::ResolveExecutableInBundle (resolved_exe_file);\n\n if (resolved_exe_file.Exists())\n error.Clear();\n else\n error.SetErrorStringWithFormat(\"the platform is not currently connected, and '%s' doesn't exist in the system root.\", resolved_exe_file.GetFilename().AsCString(\"\"));\n }\n }\n \n\n if (error.Success())\n {\n if (exe_arch.IsValid())\n {\n error = ModuleList::GetSharedModule (resolved_exe_file, \n exe_arch, \n NULL,\n NULL, \n 0, \n exe_module_sp, \n NULL, \n NULL);\n \n if (exe_module_sp->GetObjectFile() == NULL)\n {\n exe_module_sp.reset();\n error.SetErrorStringWithFormat (\"'%s%s%s' doesn't contain the architecture %s\",\n exe_file.GetDirectory().AsCString(\"\"),\n exe_file.GetDirectory() ? \"\/\" : \"\",\n exe_file.GetFilename().AsCString(\"\"),\n exe_arch.GetArchitectureName());\n }\n }\n else\n {\n \/\/ No valid architecture was specified, ask the platform for\n \/\/ the architectures that we should be using (in the correct order)\n \/\/ and see if we can find a match that way\n StreamString arch_names;\n ArchSpec platform_arch;\n for (uint32_t idx = 0; GetSupportedArchitectureAtIndex (idx, platform_arch); ++idx)\n {\n error = ModuleList::GetSharedModule (resolved_exe_file, \n platform_arch, \n NULL,\n NULL, \n 0, \n exe_module_sp, \n NULL, \n NULL);\n \/\/ Did we find an executable using one of the \n if (error.Success())\n {\n if (exe_module_sp && exe_module_sp->GetObjectFile())\n break;\n else\n error.SetErrorToGenericError();\n }\n \n if (idx > 0)\n arch_names.PutCString (\", \");\n arch_names.PutCString (platform_arch.GetArchitectureName());\n }\n \n if (error.Fail() || !exe_module_sp)\n {\n error.SetErrorStringWithFormat (\"'%s%s%s' doesn't contain any '%s' platform architectures: %s\",\n exe_file.GetDirectory().AsCString(\"\"),\n exe_file.GetDirectory() ? \"\/\" : \"\",\n exe_file.GetFilename().AsCString(\"\"),\n GetShortPluginName(),\n arch_names.GetString().c_str());\n }\n }\n }\n\n return error;\n}\n\n\nsize_t\nPlatformDarwin::GetSoftwareBreakpointTrapOpcode (Target &target, BreakpointSite *bp_site)\n{\n const uint8_t *trap_opcode = NULL;\n uint32_t trap_opcode_size = 0;\n bool bp_is_thumb = false;\n \n llvm::Triple::ArchType machine = target.GetArchitecture().GetMachine();\n switch (machine)\n {\n case llvm::Triple::x86:\n case llvm::Triple::x86_64:\n {\n static const uint8_t g_i386_breakpoint_opcode[] = { 0xCC };\n trap_opcode = g_i386_breakpoint_opcode;\n trap_opcode_size = sizeof(g_i386_breakpoint_opcode);\n }\n break;\n\n case llvm::Triple::thumb:\n bp_is_thumb = true; \/\/ Fall through...\n case llvm::Triple::arm:\n {\n static const uint8_t g_arm_breakpoint_opcode[] = { 0xFE, 0xDE, 0xFF, 0xE7 };\n static const uint8_t g_thumb_breakpooint_opcode[] = { 0xFE, 0xDE };\n\n \/\/ Auto detect arm\/thumb if it wasn't explicitly specified\n if (!bp_is_thumb)\n {\n lldb::BreakpointLocationSP bp_loc_sp (bp_site->GetOwnerAtIndex (0));\n if (bp_loc_sp)\n bp_is_thumb = bp_loc_sp->GetAddress().GetAddressClass () == eAddressClassCodeAlternateISA;\n }\n if (bp_is_thumb)\n {\n trap_opcode = g_thumb_breakpooint_opcode;\n trap_opcode_size = sizeof(g_thumb_breakpooint_opcode);\n break;\n }\n trap_opcode = g_arm_breakpoint_opcode;\n trap_opcode_size = sizeof(g_arm_breakpoint_opcode);\n }\n break;\n \n case llvm::Triple::ppc:\n case llvm::Triple::ppc64:\n {\n static const uint8_t g_ppc_breakpoint_opcode[] = { 0x7F, 0xC0, 0x00, 0x08 };\n trap_opcode = g_ppc_breakpoint_opcode;\n trap_opcode_size = sizeof(g_ppc_breakpoint_opcode);\n }\n break;\n \n default:\n assert(!\"Unhandled architecture in PlatformDarwin::GetSoftwareBreakpointTrapOpcode()\");\n break;\n }\n \n if (trap_opcode && trap_opcode_size)\n {\n if (bp_site->SetTrapOpcode(trap_opcode, trap_opcode_size))\n return trap_opcode_size;\n }\n return 0;\n\n}\n\nbool\nPlatformDarwin::GetRemoteOSVersion ()\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetOSVersion (m_major_os_version, \n m_minor_os_version, \n m_update_os_version);\n return false;\n}\n\nbool\nPlatformDarwin::GetRemoteOSBuildString (std::string &s)\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteOSBuildString (s);\n s.clear();\n return false;\n}\n\nbool\nPlatformDarwin::GetRemoteOSKernelDescription (std::string &s)\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteOSKernelDescription (s);\n s.clear();\n return false;\n}\n\n\/\/ Remote Platform subclasses need to override this function\nArchSpec\nPlatformDarwin::GetRemoteSystemArchitecture ()\n{\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetRemoteSystemArchitecture ();\n return ArchSpec();\n}\n\n\nconst char *\nPlatformDarwin::GetHostname ()\n{\n if (IsHost())\n return Platform::GetHostname();\n\n if (m_remote_platform_sp)\n return m_remote_platform_sp->GetHostname ();\n return NULL;\n}\n\nbool\nPlatformDarwin::IsConnected () const\n{\n if (IsHost())\n return true;\n else if (m_remote_platform_sp)\n return m_remote_platform_sp->IsConnected();\n return false;\n}\n\nError\nPlatformDarwin::ConnectRemote (Args& args)\n{\n Error error;\n if (IsHost())\n {\n error.SetErrorStringWithFormat (\"can't connect to the host platform '%s', always connected\", GetShortPluginName());\n }\n else\n {\n if (!m_remote_platform_sp)\n m_remote_platform_sp = Platform::Create (\"remote-gdb-server\", error);\n\n if (m_remote_platform_sp)\n {\n if (error.Success())\n {\n if (m_remote_platform_sp)\n {\n error = m_remote_platform_sp->ConnectRemote (args);\n }\n else\n {\n error.SetErrorString (\"\\\"platform connect\\\" takes a single argument: <connect-url>\");\n }\n }\n }\n else\n error.SetErrorString (\"failed to create a 'remote-gdb-server' platform\");\n \n if (error.Fail())\n m_remote_platform_sp.reset();\n }\n\n return error;\n}\n\nError\nPlatformDarwin::DisconnectRemote ()\n{\n Error error;\n \n if (IsHost())\n {\n error.SetErrorStringWithFormat (\"can't disconnect from the host platform '%s', always connected\", GetShortPluginName());\n }\n else\n {\n if (m_remote_platform_sp)\n error = m_remote_platform_sp->DisconnectRemote ();\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return error;\n}\n\n\nbool\nPlatformDarwin::GetProcessInfo (lldb::pid_t pid, ProcessInstanceInfo &process_info)\n{\n bool sucess = false;\n if (IsHost())\n {\n sucess = Platform::GetProcessInfo (pid, process_info);\n }\n else\n {\n if (m_remote_platform_sp)\n sucess = m_remote_platform_sp->GetProcessInfo (pid, process_info);\n }\n return sucess;\n}\n\n\n\nuint32_t\nPlatformDarwin::FindProcesses (const ProcessInstanceInfoMatch &match_info,\n ProcessInstanceInfoList &process_infos)\n{\n uint32_t match_count = 0;\n if (IsHost())\n {\n \/\/ Let the base class figure out the host details\n match_count = Platform::FindProcesses (match_info, process_infos);\n }\n else\n {\n \/\/ If we are remote, we can only return results if we are connected\n if (m_remote_platform_sp)\n match_count = m_remote_platform_sp->FindProcesses (match_info, process_infos);\n }\n return match_count; \n}\n\nError\nPlatformDarwin::LaunchProcess (ProcessLaunchInfo &launch_info)\n{\n Error error;\n \n if (IsHost())\n {\n if (launch_info.GetFlags().Test (eLaunchFlagLaunchInShell))\n {\n const bool is_localhost = true;\n if (!launch_info.ConvertArgumentsForLaunchingInShell (error, is_localhost))\n return error;\n }\n error = Platform::LaunchProcess (launch_info);\n }\n else\n {\n if (m_remote_platform_sp)\n error = m_remote_platform_sp->LaunchProcess (launch_info);\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return error;\n}\n\nlldb::ProcessSP\nPlatformDarwin::Attach (ProcessAttachInfo &attach_info,\n Debugger &debugger,\n Target *target,\n Listener &listener, \n Error &error)\n{\n lldb::ProcessSP process_sp;\n \n if (IsHost())\n {\n if (target == NULL)\n {\n TargetSP new_target_sp;\n FileSpec emptyFileSpec;\n \n error = debugger.GetTargetList().CreateTarget (debugger,\n emptyFileSpec,\n NULL, \n false,\n NULL,\n new_target_sp);\n target = new_target_sp.get();\n }\n else\n error.Clear();\n \n if (target && error.Success())\n {\n debugger.GetTargetList().SetSelectedTarget(target);\n\n process_sp = target->CreateProcess (listener, attach_info.GetProcessPluginName());\n \n if (process_sp)\n error = process_sp->Attach (attach_info);\n }\n }\n else\n {\n if (m_remote_platform_sp)\n process_sp = m_remote_platform_sp->Attach (attach_info, debugger, target, listener, error);\n else\n error.SetErrorString (\"the platform is not currently connected\");\n }\n return process_sp;\n}\n\nconst char *\nPlatformDarwin::GetUserName (uint32_t uid)\n{\n \/\/ Check the cache in Platform in case we have already looked this uid up\n const char *user_name = Platform::GetUserName(uid);\n if (user_name)\n return user_name;\n\n if (IsRemote() && m_remote_platform_sp)\n return m_remote_platform_sp->GetUserName(uid);\n return NULL;\n}\n\nconst char *\nPlatformDarwin::GetGroupName (uint32_t gid)\n{\n const char *group_name = Platform::GetGroupName(gid);\n if (group_name)\n return group_name;\n\n if (IsRemote() && m_remote_platform_sp)\n return m_remote_platform_sp->GetGroupName(gid);\n return NULL;\n}\n\nbool\nPlatformDarwin::ModuleIsExcludedForNonModuleSpecificSearches (lldb_private::Target &target, const lldb::ModuleSP &module_sp)\n{\n ObjectFile *obj_file = module_sp->GetObjectFile();\n if (!obj_file)\n return false;\n \n ObjectFile::Type obj_type = obj_file->GetType();\n if (obj_type == ObjectFile::eTypeDynamicLinker)\n return true;\n else\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- ProcessFreeBSD.cpp ----------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ C Includes\n#include <errno.h>\n\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Core\/State.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Symbol\/ObjectFile.h\"\n#include \"lldb\/Target\/DynamicLoader.h\"\n#include \"lldb\/Target\/Target.h\"\n\n#include \"ProcessFreeBSD.h\"\n#include \"ProcessPOSIXLog.h\"\n#include \"Plugins\/Process\/Utility\/InferiorCallPOSIX.h\"\n#include \"ProcessMonitor.h\"\n#include \"FreeBSDThread.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\/\/------------------------------------------------------------------------------\n\/\/ Static functions.\n\nlldb::ProcessSP\nProcessFreeBSD::CreateInstance(Target& target,\n Listener &listener,\n const FileSpec *crash_file_path)\n{\n lldb::ProcessSP process_sp;\n if (crash_file_path == NULL)\n process_sp.reset(new ProcessFreeBSD (target, listener));\n return process_sp;\n}\n\nvoid\nProcessFreeBSD::Initialize()\n{\n static bool g_initialized = false;\n\n if (!g_initialized)\n {\n PluginManager::RegisterPlugin(GetPluginNameStatic(),\n GetPluginDescriptionStatic(),\n CreateInstance);\n Log::Callbacks log_callbacks = {\n ProcessPOSIXLog::DisableLog,\n ProcessPOSIXLog::EnableLog,\n ProcessPOSIXLog::ListLogCategories\n };\n\n Log::RegisterLogChannel (ProcessFreeBSD::GetPluginNameStatic(), log_callbacks);\n ProcessPOSIXLog::RegisterPluginName(GetPluginNameStatic());\n g_initialized = true;\n }\n}\n\nlldb_private::ConstString\nProcessFreeBSD::GetPluginNameStatic()\n{\n static ConstString g_name(\"freebsd\");\n return g_name;\n}\n\nconst char *\nProcessFreeBSD::GetPluginDescriptionStatic()\n{\n return \"Process plugin for FreeBSD\";\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ ProcessInterface protocol.\n\nlldb_private::ConstString\nProcessFreeBSD::GetPluginName()\n{\n return GetPluginNameStatic();\n}\n\nuint32_t\nProcessFreeBSD::GetPluginVersion()\n{\n return 1;\n}\n\nvoid\nProcessFreeBSD::GetPluginCommandHelp(const char *command, Stream *strm)\n{\n}\n\nError\nProcessFreeBSD::ExecutePluginCommand(Args &command, Stream *strm)\n{\n return Error(1, eErrorTypeGeneric);\n}\n\nLog *\nProcessFreeBSD::EnablePluginLogging(Stream *strm, Args &command)\n{\n return NULL;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ Constructors and destructors.\n\nProcessFreeBSD::ProcessFreeBSD(Target& target, Listener &listener)\n : ProcessPOSIX(target, listener),\n m_resume_signo(0)\n{\n}\n\nvoid\nProcessFreeBSD::Terminate()\n{\n}\n\nError\nProcessFreeBSD::DoDetach(bool keep_stopped)\n{\n Error error;\n if (keep_stopped)\n {\n error.SetErrorString(\"Detaching with keep_stopped true is not currently supported on FreeBSD.\");\n return error;\n }\n\n error = m_monitor->Detach(GetID());\n\n if (error.Success())\n SetPrivateState(eStateDetached);\n\n return error;\n}\n\nError\nProcessFreeBSD::DoResume()\n{\n Log *log (ProcessPOSIXLog::GetLogIfAllCategoriesSet (POSIX_LOG_PROCESS));\n\n SetPrivateState(eStateRunning);\n\n Mutex::Locker lock(m_thread_list.GetMutex());\n bool do_step = false;\n\n for (tid_collection::const_iterator t_pos = m_run_tids.begin(), t_end = m_run_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, false);\n }\n for (tid_collection::const_iterator t_pos = m_step_tids.begin(), t_end = m_step_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, false);\n do_step = true;\n }\n for (tid_collection::const_iterator t_pos = m_suspend_tids.begin(), t_end = m_suspend_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, true);\n \/\/ XXX Cannot PT_CONTINUE properly with suspended threads.\n do_step = true;\n }\n\n if (log)\n log->Printf(\"process %lu resuming (%s)\", GetID(), do_step ? \"step\" : \"continue\");\n if (do_step)\n m_monitor->SingleStep(GetID(), m_resume_signo);\n else\n m_monitor->Resume(GetID(), m_resume_signo);\n\n return Error();\n}\n\nbool\nProcessFreeBSD::UpdateThreadList(ThreadList &old_thread_list, ThreadList &new_thread_list)\n{\n Log *log (ProcessPOSIXLog::GetLogIfAllCategoriesSet (POSIX_LOG_PROCESS));\n if (log)\n log->Printf(\"ProcessFreeBSD::%s (pid = %\" PRIu64 \")\", __FUNCTION__, GetID());\n\n std::vector<lldb::pid_t> tds;\n if (!GetMonitor().GetCurrentThreadIDs(tds))\n {\n return false;\n }\n\n ThreadList old_thread_list_copy(old_thread_list);\n for (size_t i = 0; i < tds.size(); ++i)\n {\n tid_t tid = tds[i];\n ThreadSP thread_sp (old_thread_list_copy.RemoveThreadByID(tid, false));\n if (!thread_sp)\n {\n thread_sp.reset(new FreeBSDThread(*this, tid));\n if (log)\n log->Printf(\"ProcessFreeBSD::%s new tid = %\" PRIu64, __FUNCTION__, tid);\n }\n else\n {\n if (log)\n log->Printf(\"ProcessFreeBSD::%s existing tid = %\" PRIu64, __FUNCTION__, tid);\n }\n new_thread_list.AddThread(thread_sp);\n }\n for (size_t i = 0; i < old_thread_list_copy.GetSize(false); ++i)\n {\n ThreadSP old_thread_sp(old_thread_list_copy.GetThreadAtIndex(i, false));\n if (old_thread_sp)\n {\n if (log)\n log->Printf(\"ProcessFreeBSD::%s remove tid\", __FUNCTION__);\n }\n }\n\n return true;\n}\n\nError\nProcessFreeBSD::WillResume()\n{\n m_resume_signo = 0;\n m_suspend_tids.clear();\n m_run_tids.clear();\n m_step_tids.clear();\n return ProcessPOSIX::WillResume();\n}\n\nvoid\nProcessFreeBSD::SendMessage(const ProcessMessage &message)\n{\n Mutex::Locker lock(m_message_mutex);\n\n switch (message.GetKind())\n {\n case ProcessMessage::eInvalidMessage:\n return;\n\n case ProcessMessage::eAttachMessage:\n SetPrivateState(eStateStopped);\n return;\n\n case ProcessMessage::eLimboMessage:\n case ProcessMessage::eExitMessage:\n m_exit_status = message.GetExitStatus();\n SetExitStatus(m_exit_status, NULL);\n break;\n\n case ProcessMessage::eSignalMessage:\n case ProcessMessage::eSignalDeliveredMessage:\n case ProcessMessage::eBreakpointMessage:\n case ProcessMessage::eTraceMessage:\n case ProcessMessage::eWatchpointMessage:\n case ProcessMessage::eCrashMessage:\n SetPrivateState(eStateStopped);\n break;\n\n case ProcessMessage::eNewThreadMessage:\n assert(0 && \"eNewThreadMessage unexpected on FreeBSD\");\n break;\n\n case ProcessMessage::eExecMessage:\n SetPrivateState(eStateStopped);\n break;\n }\n\n m_message_queue.push(message);\n}\n\n<commit_msg>Fix format string for 32bit systems.<commit_after>\/\/===-- ProcessFreeBSD.cpp ----------------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ C Includes\n#include <errno.h>\n\n\/\/ C++ Includes\n\/\/ Other libraries and framework includes\n#include \"lldb\/Core\/PluginManager.h\"\n#include \"lldb\/Core\/State.h\"\n#include \"lldb\/Host\/Host.h\"\n#include \"lldb\/Symbol\/ObjectFile.h\"\n#include \"lldb\/Target\/DynamicLoader.h\"\n#include \"lldb\/Target\/Target.h\"\n\n#include \"ProcessFreeBSD.h\"\n#include \"ProcessPOSIXLog.h\"\n#include \"Plugins\/Process\/Utility\/InferiorCallPOSIX.h\"\n#include \"ProcessMonitor.h\"\n#include \"FreeBSDThread.h\"\n\nusing namespace lldb;\nusing namespace lldb_private;\n\n\/\/------------------------------------------------------------------------------\n\/\/ Static functions.\n\nlldb::ProcessSP\nProcessFreeBSD::CreateInstance(Target& target,\n Listener &listener,\n const FileSpec *crash_file_path)\n{\n lldb::ProcessSP process_sp;\n if (crash_file_path == NULL)\n process_sp.reset(new ProcessFreeBSD (target, listener));\n return process_sp;\n}\n\nvoid\nProcessFreeBSD::Initialize()\n{\n static bool g_initialized = false;\n\n if (!g_initialized)\n {\n PluginManager::RegisterPlugin(GetPluginNameStatic(),\n GetPluginDescriptionStatic(),\n CreateInstance);\n Log::Callbacks log_callbacks = {\n ProcessPOSIXLog::DisableLog,\n ProcessPOSIXLog::EnableLog,\n ProcessPOSIXLog::ListLogCategories\n };\n\n Log::RegisterLogChannel (ProcessFreeBSD::GetPluginNameStatic(), log_callbacks);\n ProcessPOSIXLog::RegisterPluginName(GetPluginNameStatic());\n g_initialized = true;\n }\n}\n\nlldb_private::ConstString\nProcessFreeBSD::GetPluginNameStatic()\n{\n static ConstString g_name(\"freebsd\");\n return g_name;\n}\n\nconst char *\nProcessFreeBSD::GetPluginDescriptionStatic()\n{\n return \"Process plugin for FreeBSD\";\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ ProcessInterface protocol.\n\nlldb_private::ConstString\nProcessFreeBSD::GetPluginName()\n{\n return GetPluginNameStatic();\n}\n\nuint32_t\nProcessFreeBSD::GetPluginVersion()\n{\n return 1;\n}\n\nvoid\nProcessFreeBSD::GetPluginCommandHelp(const char *command, Stream *strm)\n{\n}\n\nError\nProcessFreeBSD::ExecutePluginCommand(Args &command, Stream *strm)\n{\n return Error(1, eErrorTypeGeneric);\n}\n\nLog *\nProcessFreeBSD::EnablePluginLogging(Stream *strm, Args &command)\n{\n return NULL;\n}\n\n\/\/------------------------------------------------------------------------------\n\/\/ Constructors and destructors.\n\nProcessFreeBSD::ProcessFreeBSD(Target& target, Listener &listener)\n : ProcessPOSIX(target, listener),\n m_resume_signo(0)\n{\n}\n\nvoid\nProcessFreeBSD::Terminate()\n{\n}\n\nError\nProcessFreeBSD::DoDetach(bool keep_stopped)\n{\n Error error;\n if (keep_stopped)\n {\n error.SetErrorString(\"Detaching with keep_stopped true is not currently supported on FreeBSD.\");\n return error;\n }\n\n error = m_monitor->Detach(GetID());\n\n if (error.Success())\n SetPrivateState(eStateDetached);\n\n return error;\n}\n\nError\nProcessFreeBSD::DoResume()\n{\n Log *log (ProcessPOSIXLog::GetLogIfAllCategoriesSet (POSIX_LOG_PROCESS));\n\n SetPrivateState(eStateRunning);\n\n Mutex::Locker lock(m_thread_list.GetMutex());\n bool do_step = false;\n\n for (tid_collection::const_iterator t_pos = m_run_tids.begin(), t_end = m_run_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, false);\n }\n for (tid_collection::const_iterator t_pos = m_step_tids.begin(), t_end = m_step_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, false);\n do_step = true;\n }\n for (tid_collection::const_iterator t_pos = m_suspend_tids.begin(), t_end = m_suspend_tids.end(); t_pos != t_end; ++t_pos)\n {\n m_monitor->ThreadSuspend(*t_pos, true);\n \/\/ XXX Cannot PT_CONTINUE properly with suspended threads.\n do_step = true;\n }\n\n if (log)\n log->Printf(\"process %\" PRIu64 \" resuming (%s)\", GetID(), do_step ? \"step\" : \"continue\");\n if (do_step)\n m_monitor->SingleStep(GetID(), m_resume_signo);\n else\n m_monitor->Resume(GetID(), m_resume_signo);\n\n return Error();\n}\n\nbool\nProcessFreeBSD::UpdateThreadList(ThreadList &old_thread_list, ThreadList &new_thread_list)\n{\n Log *log (ProcessPOSIXLog::GetLogIfAllCategoriesSet (POSIX_LOG_PROCESS));\n if (log)\n log->Printf(\"ProcessFreeBSD::%s (pid = %\" PRIu64 \")\", __FUNCTION__, GetID());\n\n std::vector<lldb::pid_t> tds;\n if (!GetMonitor().GetCurrentThreadIDs(tds))\n {\n return false;\n }\n\n ThreadList old_thread_list_copy(old_thread_list);\n for (size_t i = 0; i < tds.size(); ++i)\n {\n tid_t tid = tds[i];\n ThreadSP thread_sp (old_thread_list_copy.RemoveThreadByID(tid, false));\n if (!thread_sp)\n {\n thread_sp.reset(new FreeBSDThread(*this, tid));\n if (log)\n log->Printf(\"ProcessFreeBSD::%s new tid = %\" PRIu64, __FUNCTION__, tid);\n }\n else\n {\n if (log)\n log->Printf(\"ProcessFreeBSD::%s existing tid = %\" PRIu64, __FUNCTION__, tid);\n }\n new_thread_list.AddThread(thread_sp);\n }\n for (size_t i = 0; i < old_thread_list_copy.GetSize(false); ++i)\n {\n ThreadSP old_thread_sp(old_thread_list_copy.GetThreadAtIndex(i, false));\n if (old_thread_sp)\n {\n if (log)\n log->Printf(\"ProcessFreeBSD::%s remove tid\", __FUNCTION__);\n }\n }\n\n return true;\n}\n\nError\nProcessFreeBSD::WillResume()\n{\n m_resume_signo = 0;\n m_suspend_tids.clear();\n m_run_tids.clear();\n m_step_tids.clear();\n return ProcessPOSIX::WillResume();\n}\n\nvoid\nProcessFreeBSD::SendMessage(const ProcessMessage &message)\n{\n Mutex::Locker lock(m_message_mutex);\n\n switch (message.GetKind())\n {\n case ProcessMessage::eInvalidMessage:\n return;\n\n case ProcessMessage::eAttachMessage:\n SetPrivateState(eStateStopped);\n return;\n\n case ProcessMessage::eLimboMessage:\n case ProcessMessage::eExitMessage:\n m_exit_status = message.GetExitStatus();\n SetExitStatus(m_exit_status, NULL);\n break;\n\n case ProcessMessage::eSignalMessage:\n case ProcessMessage::eSignalDeliveredMessage:\n case ProcessMessage::eBreakpointMessage:\n case ProcessMessage::eTraceMessage:\n case ProcessMessage::eWatchpointMessage:\n case ProcessMessage::eCrashMessage:\n SetPrivateState(eStateStopped);\n break;\n\n case ProcessMessage::eNewThreadMessage:\n assert(0 && \"eNewThreadMessage unexpected on FreeBSD\");\n break;\n\n case ProcessMessage::eExecMessage:\n SetPrivateState(eStateStopped);\n break;\n }\n\n m_message_queue.push(message);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Video.cpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 04\/10\/2019.\n\/\/ Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"Video.hpp\"\n\n#include \"..\/..\/Outputs\/Log.hpp\"\n\n#include <algorithm>\n\nusing namespace Atari::ST;\n\nnamespace {\n\nstruct ModeParams {\n\tconst int lines_per_frame;\n\n\tconst int first_video_line;\n\tconst int final_video_line;\n\n\tconst int line_length;\n\n\tconst int end_of_blank;\n\n\tconst int start_of_display_enable;\n\tconst int end_of_display_enable;\n\n\tconst int start_of_output;\n\tconst int end_of_output;\n\n\tconst int start_of_blank;\n\n\tconst int start_of_hsync;\n\tconst int end_of_hsync;\n} modes[3] = {\n\t{313,\t56, 256,\t1024,\t\t64,\t\t116, 116+640,\t116+48, 116+48+640,\t\t904,\t928, 1008\t},\n\t{},\n\t{}\n};\n\nconst ModeParams &mode_params_for_mode() {\n\t\/\/ TODO: rest of potential combinations, and accept mode as a paramter.\n\treturn modes[0];\n}\n\n}\n\nVideo::Video() :\n\tcrt_(1024, 1, Outputs::Display::Type::PAL50, Outputs::Display::InputDataType::Red4Green4Blue4) {\n}\n\nvoid Video::set_ram(uint16_t *ram) {\n\tram_ = ram;\n}\n\nvoid Video::set_scan_target(Outputs::Display::ScanTarget *scan_target) {\n\tcrt_.set_scan_target(scan_target);\n}\n\nvoid Video::run_for(HalfCycles duration) {\n\tint integer_duration = duration.as_int();\n\tconst auto mode_params = mode_params_for_mode();\n\n#define Period(lower, upper, type)\t\\\n\tif(x >= lower && x < upper) {\t\\\n\t\tconst auto target = std::min(upper, final_x);\t\\\n\t\ttype(target - x);\t\\\n\t\tx = target;\t\\\n\t}\n\n\t\/\/ TODO: the below is **way off**. The real hardware does what you'd expect with ongoing state and\n\t\/\/ exact equality tests. Fixes to come.\n\n\twhile(integer_duration) {\n\t\tconst int final_x = std::min(x + integer_duration, mode_params.line_length);\n\t\tinteger_duration -= (final_x - x);\n\n\t\tif(y >= mode_params.first_video_line && y < mode_params.final_video_line) {\n\t\t\t\/\/ TODO: Prior to output: collect all necessary data, obeying start_of_display_enable and end_of_display_enable.\n\n\t\t\tPeriod(0, \t\t\t\t\t\t\tmode_params.end_of_blank, \t\tcrt_.output_blank);\n\t\t\tPeriod(mode_params.end_of_blank, \tmode_params.start_of_output, \toutput_border);\n\n\t\t\tif(x >= mode_params.start_of_output && x < mode_params.end_of_output) {\n\t\t\t\tif(x == mode_params.start_of_output) {\n\t\t\t\t\t\/\/ TODO: resolutions other than 320.\n\t\t\t\t\tpixel_pointer_ = reinterpret_cast<uint16_t *>(crt_.begin_data(320));\n\t\t\t\t}\n\n\t\t\t\tconst auto target = std::min(mode_params.end_of_output, final_x);\n\t\t\t\twhile(x < target) {\n\t\t\t\t\tif(!(x&31) && pixel_pointer_) {\n\t\t\t\t\t\tuint16_t source[4] = {\n\t\t\t\t\t\t\tram_[current_address_ + 0],\n\t\t\t\t\t\t\tram_[current_address_ + 1],\n\t\t\t\t\t\t\tram_[current_address_ + 2],\n\t\t\t\t\t\t\tram_[current_address_ + 3],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcurrent_address_ += 4;\n\n\t\t\t\t\t\tfor(int c = 0; c < 16; ++c) {\n\t\t\t\t\t\t\t*pixel_pointer_ = palette_[\n\t\t\t\t\t\t\t\t((source[0] >> 12) & 0x8)\t|\n\t\t\t\t\t\t\t\t((source[1] >> 13) & 0x4)\t|\n\t\t\t\t\t\t\t\t((source[2] >> 14) & 0x2)\t|\n\t\t\t\t\t\t\t\t((source[3] >> 15) & 0x1)\n\t\t\t\t\t\t\t];\n\t\t\t\t\t\t\tsource[0] <<= 1;\n\t\t\t\t\t\t\tsource[1] <<= 1;\n\t\t\t\t\t\t\tsource[2] <<= 1;\n\t\t\t\t\t\t\tsource[3] <<= 1;\n\t\t\t\t\t\t\t++pixel_pointer_;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t++x;\n\t\t\t\t}\n\n\t\t\t\tif(x == mode_params.end_of_output) {\n\t\t\t\t\tcrt_.output_data(mode_params.end_of_output - mode_params.start_of_output, 320);\n\t\t\t\t\tpixel_pointer_ = nullptr;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tPeriod(mode_params.end_of_output, \tmode_params.start_of_blank, \toutput_border);\n\t\t\tPeriod(mode_params.start_of_blank, \tmode_params.start_of_hsync,\t\tcrt_.output_blank);\n\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\t\tcrt_.output_sync);\n\t\t\tPeriod(mode_params.end_of_hsync, \tmode_params.line_length,\t\tcrt_.output_blank);\n\t\t} else {\n\t\t\t\/\/ Hard code the first three lines as vertical sync.\n\t\t\tif(y < 3) {\n\t\t\t\tPeriod(0,\t\t\t\t\t\t\tmode_params.start_of_hsync,\tcrt_.output_sync);\n\t\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.end_of_hsync,\tmode_params.line_length,\tcrt_.output_sync);\n\t\t\t} else {\n\t\t\t\tPeriod(0, \t\t\t\t\t\t\tmode_params.end_of_blank, \t\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.end_of_blank, \tmode_params.start_of_blank, \toutput_border);\n\t\t\t\tPeriod(mode_params.start_of_blank, \tmode_params.start_of_hsync,\t\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\t\tcrt_.output_sync);\n\t\t\t\tPeriod(mode_params.end_of_hsync, \tmode_params.line_length,\t\tcrt_.output_blank);\n\t\t\t}\n\t\t}\n\n\t\tif(x == mode_params.line_length) {\n\t\t\tx = 0;\n\t\t\ty = (y + 1) % mode_params.lines_per_frame;\n\t\t\tif(!y) current_address_ = base_address_;\n\t\t}\n\t}\n\n#undef Period\n}\n\nvoid Video::output_border(int duration) {\n\tuint16_t *colour_pointer = reinterpret_cast<uint16_t *>(crt_.begin_data(1));\n\tif(colour_pointer) *colour_pointer = palette_[0];\n\tcrt_.output_level(duration);\n}\n\nbool Video::hsync() {\n\tconst auto mode_params = mode_params_for_mode();\n\treturn x >= mode_params.start_of_hsync && x < mode_params.end_of_hsync;\n}\n\nbool Video::vsync() {\n\treturn y < 3;\n}\n\nbool Video::display_enabled() {\n\tconst auto mode_params = mode_params_for_mode();\n\treturn y >= mode_params.first_video_line && y < mode_params.final_video_line && x >= mode_params.start_of_display_enable && x < mode_params.end_of_display_enable;\n}\n\nHalfCycles Video::get_next_sequence_point() {\n\t\/\/ The next hsync transition will occur either this line or the next.\n\tconst auto mode_params = mode_params_for_mode();\n\tHalfCycles cycles_until_hsync;\n\tif(x < mode_params.start_of_hsync) {\n\t\tcycles_until_hsync = HalfCycles(mode_params.start_of_hsync - x);\n\t} else if(x < mode_params.end_of_hsync) {\n\t\tcycles_until_hsync = HalfCycles(mode_params.end_of_hsync - x);\n\t} else {\n\t\tcycles_until_hsync = HalfCycles(mode_params.start_of_hsync + mode_params.line_length - x);\n\t}\n\n\t\/\/ The next vsync transition depends purely on the current y.\n\tHalfCycles cycles_until_vsync;\n\tif(y < 3) {\n\t\tcycles_until_vsync = HalfCycles(mode_params.line_length - x + (2 - y)*mode_params.line_length);\n\t} else {\n\t\tcycles_until_vsync = HalfCycles(mode_params.line_length - x + (mode_params.lines_per_frame - 1 - y)*mode_params.line_length);\n\t}\n\n\t\/\/ The next display enable transition will occur only in the visible area.\n\tHalfCycles cycles_until_display_enable;\n\tif(display_enabled()) {\n\t\tcycles_until_display_enable = HalfCycles(mode_params.end_of_display_enable - x);\n\t} else {\n\t\tconst auto horizontal_cycles = mode_params.start_of_display_enable - x;\n\t\tint vertical_lines = 0;\n\t\tif(y < mode_params.first_video_line) {\n\t\t\tvertical_lines = mode_params.first_video_line - y;\n\t\t} else if(y >= mode_params.final_video_line ) {\n\t\t\tvertical_lines = mode_params.first_video_line + mode_params.lines_per_frame - y;\n\t\t}\n\t\tif(horizontal_cycles < 0) ++vertical_lines;\n\t\tcycles_until_display_enable = HalfCycles(horizontal_cycles + vertical_lines * mode_params.line_length);\n\t}\n\n\t\/\/ Determine the minimum of the three\n\tif(cycles_until_hsync < cycles_until_vsync && cycles_until_hsync < cycles_until_display_enable) {\n\t\treturn cycles_until_hsync;\n\t} else {\n\t\treturn (cycles_until_vsync < cycles_until_display_enable) ? cycles_until_vsync : cycles_until_display_enable;\n\t}\n}\n\n\/\/ MARK: - IO dispatch\n\nuint8_t Video::read(int address) {\n\tLOG(\"[Video] read \" << (address & 0x3f));\n\taddress &= 0x3f;\n\tswitch(address) {\n\t\tcase 0x00:\treturn uint8_t(base_address_ >> 16);\n\t\tcase 0x01:\treturn uint8_t(base_address_ >> 8);\n\t\tcase 0x02:\treturn uint8_t(current_address_ >> 16);\n\t\tcase 0x03:\treturn uint8_t(current_address_ >> 8);\n\t\tcase 0x04:\treturn uint8_t(current_address_);\n\t}\n\treturn 0xff;\n}\n\nvoid Video::write(int address, uint16_t value) {\n\tLOG(\"[Video] write \" << PADHEX(2) << int(value) << \" to \" << PADHEX(2) << (address & 0x3f));\n\taddress &= 0x3f;\n\tswitch(address) {\n\t\tdefault: break;\n\n\t\t\/\/ Start address.\n\t\tcase 0x00:\tbase_address_ = (base_address_ & 0x00ffff) | (value << 16);\tbreak;\n\t\tcase 0x01:\tbase_address_ = (base_address_ & 0xff00ff) | (value << 8);\tbreak;\n\n\t\t\/\/ Palette.\n\t\tcase 0x20:\tcase 0x21:\tcase 0x22:\tcase 0x23:\n\t\tcase 0x24:\tcase 0x25:\tcase 0x26:\tcase 0x27:\n\t\tcase 0x28:\tcase 0x29:\tcase 0x2a:\tcase 0x2b:\n\t\tcase 0x2c:\tcase 0x2d:\tcase 0x2e:\tcase 0x2f: {\n\t\t\tuint8_t *const entry = reinterpret_cast<uint8_t *>(&palette_[address - 0x20]);\n\t\t\tentry[0] = uint8_t((value & 0x700) >> 7);\n\t\t\tentry[1] = uint8_t((value & 0x77) << 1);\n\t\t} break;\n\t}\n}\n<commit_msg>Silences temporarily.<commit_after>\/\/\n\/\/ Video.cpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 04\/10\/2019.\n\/\/ Copyright © 2019 Thomas Harte. All rights reserved.\n\/\/\n\n#include \"Video.hpp\"\n\n#define NDEBUG\n#include \"..\/..\/Outputs\/Log.hpp\"\n\n#include <algorithm>\n\nusing namespace Atari::ST;\n\nnamespace {\n\nstruct ModeParams {\n\tconst int lines_per_frame;\n\n\tconst int first_video_line;\n\tconst int final_video_line;\n\n\tconst int line_length;\n\n\tconst int end_of_blank;\n\n\tconst int start_of_display_enable;\n\tconst int end_of_display_enable;\n\n\tconst int start_of_output;\n\tconst int end_of_output;\n\n\tconst int start_of_blank;\n\n\tconst int start_of_hsync;\n\tconst int end_of_hsync;\n} modes[3] = {\n\t{313,\t56, 256,\t1024,\t\t64,\t\t116, 116+640,\t116+48, 116+48+640,\t\t904,\t928, 1008\t},\n\t{},\n\t{}\n};\n\nconst ModeParams &mode_params_for_mode() {\n\t\/\/ TODO: rest of potential combinations, and accept mode as a paramter.\n\treturn modes[0];\n}\n\n}\n\nVideo::Video() :\n\tcrt_(1024, 1, Outputs::Display::Type::PAL50, Outputs::Display::InputDataType::Red4Green4Blue4) {\n}\n\nvoid Video::set_ram(uint16_t *ram) {\n\tram_ = ram;\n}\n\nvoid Video::set_scan_target(Outputs::Display::ScanTarget *scan_target) {\n\tcrt_.set_scan_target(scan_target);\n}\n\nvoid Video::run_for(HalfCycles duration) {\n\tint integer_duration = duration.as_int();\n\tconst auto mode_params = mode_params_for_mode();\n\n#define Period(lower, upper, type)\t\\\n\tif(x >= lower && x < upper) {\t\\\n\t\tconst auto target = std::min(upper, final_x);\t\\\n\t\ttype(target - x);\t\\\n\t\tx = target;\t\\\n\t}\n\n\t\/\/ TODO: the below is **way off**. The real hardware does what you'd expect with ongoing state and\n\t\/\/ exact equality tests. Fixes to come.\n\n\twhile(integer_duration) {\n\t\tconst int final_x = std::min(x + integer_duration, mode_params.line_length);\n\t\tinteger_duration -= (final_x - x);\n\n\t\tif(y >= mode_params.first_video_line && y < mode_params.final_video_line) {\n\t\t\t\/\/ TODO: Prior to output: collect all necessary data, obeying start_of_display_enable and end_of_display_enable.\n\n\t\t\tPeriod(0, \t\t\t\t\t\t\tmode_params.end_of_blank, \t\tcrt_.output_blank);\n\t\t\tPeriod(mode_params.end_of_blank, \tmode_params.start_of_output, \toutput_border);\n\n\t\t\tif(x >= mode_params.start_of_output && x < mode_params.end_of_output) {\n\t\t\t\tif(x == mode_params.start_of_output) {\n\t\t\t\t\t\/\/ TODO: resolutions other than 320.\n\t\t\t\t\tpixel_pointer_ = reinterpret_cast<uint16_t *>(crt_.begin_data(320));\n\t\t\t\t}\n\n\t\t\t\tconst auto target = std::min(mode_params.end_of_output, final_x);\n\t\t\t\twhile(x < target) {\n\t\t\t\t\tif(!(x&31) && pixel_pointer_) {\n\t\t\t\t\t\tuint16_t source[4] = {\n\t\t\t\t\t\t\tram_[current_address_ + 0],\n\t\t\t\t\t\t\tram_[current_address_ + 1],\n\t\t\t\t\t\t\tram_[current_address_ + 2],\n\t\t\t\t\t\t\tram_[current_address_ + 3],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcurrent_address_ += 4;\n\n\t\t\t\t\t\tfor(int c = 0; c < 16; ++c) {\n\t\t\t\t\t\t\t*pixel_pointer_ = palette_[\n\t\t\t\t\t\t\t\t((source[0] >> 12) & 0x8)\t|\n\t\t\t\t\t\t\t\t((source[1] >> 13) & 0x4)\t|\n\t\t\t\t\t\t\t\t((source[2] >> 14) & 0x2)\t|\n\t\t\t\t\t\t\t\t((source[3] >> 15) & 0x1)\n\t\t\t\t\t\t\t];\n\t\t\t\t\t\t\tsource[0] <<= 1;\n\t\t\t\t\t\t\tsource[1] <<= 1;\n\t\t\t\t\t\t\tsource[2] <<= 1;\n\t\t\t\t\t\t\tsource[3] <<= 1;\n\t\t\t\t\t\t\t++pixel_pointer_;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t++x;\n\t\t\t\t}\n\n\t\t\t\tif(x == mode_params.end_of_output) {\n\t\t\t\t\tcrt_.output_data(mode_params.end_of_output - mode_params.start_of_output, 320);\n\t\t\t\t\tpixel_pointer_ = nullptr;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tPeriod(mode_params.end_of_output, \tmode_params.start_of_blank, \toutput_border);\n\t\t\tPeriod(mode_params.start_of_blank, \tmode_params.start_of_hsync,\t\tcrt_.output_blank);\n\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\t\tcrt_.output_sync);\n\t\t\tPeriod(mode_params.end_of_hsync, \tmode_params.line_length,\t\tcrt_.output_blank);\n\t\t} else {\n\t\t\t\/\/ Hard code the first three lines as vertical sync.\n\t\t\tif(y < 3) {\n\t\t\t\tPeriod(0,\t\t\t\t\t\t\tmode_params.start_of_hsync,\tcrt_.output_sync);\n\t\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.end_of_hsync,\tmode_params.line_length,\tcrt_.output_sync);\n\t\t\t} else {\n\t\t\t\tPeriod(0, \t\t\t\t\t\t\tmode_params.end_of_blank, \t\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.end_of_blank, \tmode_params.start_of_blank, \toutput_border);\n\t\t\t\tPeriod(mode_params.start_of_blank, \tmode_params.start_of_hsync,\t\tcrt_.output_blank);\n\t\t\t\tPeriod(mode_params.start_of_hsync,\tmode_params.end_of_hsync,\t\tcrt_.output_sync);\n\t\t\t\tPeriod(mode_params.end_of_hsync, \tmode_params.line_length,\t\tcrt_.output_blank);\n\t\t\t}\n\t\t}\n\n\t\tif(x == mode_params.line_length) {\n\t\t\tx = 0;\n\t\t\ty = (y + 1) % mode_params.lines_per_frame;\n\t\t\tif(!y) current_address_ = base_address_;\n\t\t}\n\t}\n\n#undef Period\n}\n\nvoid Video::output_border(int duration) {\n\tuint16_t *colour_pointer = reinterpret_cast<uint16_t *>(crt_.begin_data(1));\n\tif(colour_pointer) *colour_pointer = palette_[0];\n\tcrt_.output_level(duration);\n}\n\nbool Video::hsync() {\n\tconst auto mode_params = mode_params_for_mode();\n\treturn x >= mode_params.start_of_hsync && x < mode_params.end_of_hsync;\n}\n\nbool Video::vsync() {\n\treturn y < 3;\n}\n\nbool Video::display_enabled() {\n\tconst auto mode_params = mode_params_for_mode();\n\treturn y >= mode_params.first_video_line && y < mode_params.final_video_line && x >= mode_params.start_of_display_enable && x < mode_params.end_of_display_enable;\n}\n\nHalfCycles Video::get_next_sequence_point() {\n\t\/\/ The next hsync transition will occur either this line or the next.\n\tconst auto mode_params = mode_params_for_mode();\n\tHalfCycles cycles_until_hsync;\n\tif(x < mode_params.start_of_hsync) {\n\t\tcycles_until_hsync = HalfCycles(mode_params.start_of_hsync - x);\n\t} else if(x < mode_params.end_of_hsync) {\n\t\tcycles_until_hsync = HalfCycles(mode_params.end_of_hsync - x);\n\t} else {\n\t\tcycles_until_hsync = HalfCycles(mode_params.start_of_hsync + mode_params.line_length - x);\n\t}\n\n\t\/\/ The next vsync transition depends purely on the current y.\n\tHalfCycles cycles_until_vsync;\n\tif(y < 3) {\n\t\tcycles_until_vsync = HalfCycles(mode_params.line_length - x + (2 - y)*mode_params.line_length);\n\t} else {\n\t\tcycles_until_vsync = HalfCycles(mode_params.line_length - x + (mode_params.lines_per_frame - 1 - y)*mode_params.line_length);\n\t}\n\n\t\/\/ The next display enable transition will occur only in the visible area.\n\tHalfCycles cycles_until_display_enable;\n\tif(display_enabled()) {\n\t\tcycles_until_display_enable = HalfCycles(mode_params.end_of_display_enable - x);\n\t} else {\n\t\tconst auto horizontal_cycles = mode_params.start_of_display_enable - x;\n\t\tint vertical_lines = 0;\n\t\tif(y < mode_params.first_video_line) {\n\t\t\tvertical_lines = mode_params.first_video_line - y;\n\t\t} else if(y >= mode_params.final_video_line ) {\n\t\t\tvertical_lines = mode_params.first_video_line + mode_params.lines_per_frame - y;\n\t\t}\n\t\tif(horizontal_cycles < 0) ++vertical_lines;\n\t\tcycles_until_display_enable = HalfCycles(horizontal_cycles + vertical_lines * mode_params.line_length);\n\t}\n\n\t\/\/ Determine the minimum of the three\n\tif(cycles_until_hsync < cycles_until_vsync && cycles_until_hsync < cycles_until_display_enable) {\n\t\treturn cycles_until_hsync;\n\t} else {\n\t\treturn (cycles_until_vsync < cycles_until_display_enable) ? cycles_until_vsync : cycles_until_display_enable;\n\t}\n}\n\n\/\/ MARK: - IO dispatch\n\nuint8_t Video::read(int address) {\n\tLOG(\"[Video] read \" << (address & 0x3f));\n\taddress &= 0x3f;\n\tswitch(address) {\n\t\tcase 0x00:\treturn uint8_t(base_address_ >> 16);\n\t\tcase 0x01:\treturn uint8_t(base_address_ >> 8);\n\t\tcase 0x02:\treturn uint8_t(current_address_ >> 16);\n\t\tcase 0x03:\treturn uint8_t(current_address_ >> 8);\n\t\tcase 0x04:\treturn uint8_t(current_address_);\n\t}\n\treturn 0xff;\n}\n\nvoid Video::write(int address, uint16_t value) {\n\tLOG(\"[Video] write \" << PADHEX(2) << int(value) << \" to \" << PADHEX(2) << (address & 0x3f));\n\taddress &= 0x3f;\n\tswitch(address) {\n\t\tdefault: break;\n\n\t\t\/\/ Start address.\n\t\tcase 0x00:\tbase_address_ = (base_address_ & 0x00ffff) | (value << 16);\tbreak;\n\t\tcase 0x01:\tbase_address_ = (base_address_ & 0xff00ff) | (value << 8);\tbreak;\n\n\t\t\/\/ Palette.\n\t\tcase 0x20:\tcase 0x21:\tcase 0x22:\tcase 0x23:\n\t\tcase 0x24:\tcase 0x25:\tcase 0x26:\tcase 0x27:\n\t\tcase 0x28:\tcase 0x29:\tcase 0x2a:\tcase 0x2b:\n\t\tcase 0x2c:\tcase 0x2d:\tcase 0x2e:\tcase 0x2f: {\n\t\t\tuint8_t *const entry = reinterpret_cast<uint8_t *>(&palette_[address - 0x20]);\n\t\t\tentry[0] = uint8_t((value & 0x700) >> 7);\n\t\t\tentry[1] = uint8_t((value & 0x77) << 1);\n\t\t} break;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef RDB_PROTOCOL_FUNC_HPP_\n#define RDB_PROTOCOL_FUNC_HPP_\n\n#include <map>\n#include <utility>\n#include <vector>\n\n#include \"utils.hpp\"\n\n#include \"containers\/ptr_bag.hpp\"\n#include \"containers\/scoped.hpp\"\n#include \"protob\/protob.hpp\"\n#include \"rdb_protocol\/js.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rpc\/serialize_macros.hpp\"\n\nnamespace ql {\n\nclass func_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n func_t(env_t *env, js::id_t id, term_t *parent);\n func_t(env_t *env, const Term *_source);\n \/\/ Some queries, like filter, can take a shortcut object instead of a\n \/\/ function as their argument.\n static func_t *new_filter_func(env_t *env, const datum_t *obj,\n const pb_rcheckable_t *root);\n static func_t *new_identity_func(env_t *env, const datum_t *obj,\n const pb_rcheckable_t *root);\n val_t *call(const std::vector<const datum_t *> &args);\n \/\/ Prefer these two version of call.\n val_t *call(const datum_t *arg);\n val_t *call(const datum_t *arg1, const datum_t *arg2);\n bool filter_call(env_t *env, const datum_t *arg);\n\n void dump_scope(std::map<int, Datum> *out) const;\n bool is_deterministic() const;\n\nprivate:\n \/\/ Pointers to this function's arguments.\n std::vector<const datum_t *> argptrs;\n term_t *body; \/\/ body to evaluate with functions bound\n\n \/\/ This is what's serialized over the wire.\n friend class wire_func_t;\n const Term *source;\n bool implicit_bound;\n\n \/\/ TODO: make this smarter (it's sort of slow and shitty as-is)\n std::map<int, const datum_t **> scope;\n\n term_t *js_parent;\n env_t *js_env;\n js::id_t js_id;\n};\n\nclass js_result_visitor_t : public boost::static_visitor<val_t *> {\npublic:\n typedef val_t *result_type;\n\n js_result_visitor_t(env_t *_env, term_t *_parent) : env(_env), parent(_parent) { }\n\n \/\/ This JS evaluation resulted in an error\n result_type operator()(const std::string err_val) const {\n rfail_target(parent, \"%s\", err_val.c_str());\n unreachable();\n }\n\n \/\/ This JS call resulted in a JSON value\n result_type operator()(const boost::shared_ptr<scoped_cJSON_t> json_val) const {\n return parent->new_val(new datum_t(json_val, env));\n }\n\n \/\/ This JS evaluation resulted in an id for a js function\n result_type operator()(const id_t id_val) const {\n return parent->new_val(new func_t(env, id_val, parent));\n }\n\nprivate:\n env_t *env;\n term_t *parent;\n};\n\nRDB_MAKE_PROTOB_SERIALIZABLE(Term);\nRDB_MAKE_PROTOB_SERIALIZABLE(Datum);\n\n\n\/\/ Used to serialize a function (or gmr) over the wire.\nclass wire_func_t {\npublic:\n wire_func_t();\n virtual ~wire_func_t() { }\n wire_func_t(env_t *env, func_t *_func);\n wire_func_t(const Term &_source, std::map<int, Datum> *_scope);\n\nprotected:\n func_t *compile(env_t *env);\n\n \/\/ We cache a separate function for every environment.\n std::map<env_t *, func_t *> cached_funcs;\n\n Term source;\n std::map<int, Datum> scope;\n};\n\nclass map_wire_func_t : private wire_func_t {\npublic:\n template <class... Args>\n map_wire_func_t(Args... args) : wire_func_t(args...) { }\n\n using wire_func_t::compile;\n RDB_MAKE_ME_SERIALIZABLE_2(source, scope);\n};\n\nclass filter_wire_func_t : private wire_func_t {\npublic:\n template <class... Args>\n filter_wire_func_t(Args... args) : wire_func_t(args...) { }\n\n using wire_func_t::compile;\n RDB_MAKE_ME_SERIALIZABLE_2(source, scope);\n};\n\nclass reduce_wire_func_t : private wire_func_t {\npublic:\n template <class... Args>\n reduce_wire_func_t(Args... args) : wire_func_t(args...) { }\n\n using wire_func_t::compile;\n RDB_MAKE_ME_SERIALIZABLE_2(source, scope);\n};\n\nclass concatmap_wire_func_t : private wire_func_t {\npublic:\n template <class... Args>\n concatmap_wire_func_t(Args... args) : wire_func_t(args...) { }\n\n using wire_func_t::compile;\n RDB_MAKE_ME_SERIALIZABLE_2(source, scope);\n};\n\n\/\/ Count is a fake function because we don't need to send anything.\nstruct count_wire_func_t { RDB_MAKE_ME_SERIALIZABLE_0() };\n\n\/\/ Grouped Map Reduce\nclass gmr_wire_func_t {\npublic:\n gmr_wire_func_t() { }\n gmr_wire_func_t(env_t *env, func_t *_group, func_t *_map, func_t *_reduce)\n : group(env, _group), map(env, _map), reduce(env, _reduce) { }\n func_t *compile_group(env_t *env) { return group.compile(env); }\n func_t *compile_map(env_t *env) { return map.compile(env); }\n func_t *compile_reduce(env_t *env) { return reduce.compile(env); }\nprivate:\n map_wire_func_t group;\n map_wire_func_t map;\n reduce_wire_func_t reduce;\npublic:\n RDB_MAKE_ME_SERIALIZABLE_3(group, map, reduce);\n};\n\n\/\/ Evaluating this returns a `func_t` wrapped in a `val_t`.\nclass func_term_t : public term_t {\npublic:\n func_term_t(env_t *env, const Term *term);\nprivate:\n virtual bool is_deterministic_impl() const;\n virtual val_t *eval_impl();\n virtual const char *name() const { return \"func\"; }\n func_t *func;\n};\n\n} \/\/ namespace ql\n#endif \/\/ RDB_PROTOCOL_FUNC_HPP_\n<commit_msg>Just made map_wire_func_t, etc, inherit publicly from wire_func_t.<commit_after>#ifndef RDB_PROTOCOL_FUNC_HPP_\n#define RDB_PROTOCOL_FUNC_HPP_\n\n#include <map>\n#include <utility>\n#include <vector>\n\n#include \"utils.hpp\"\n\n#include \"containers\/ptr_bag.hpp\"\n#include \"containers\/scoped.hpp\"\n#include \"protob\/protob.hpp\"\n#include \"rdb_protocol\/js.hpp\"\n#include \"rdb_protocol\/term.hpp\"\n#include \"rpc\/serialize_macros.hpp\"\n\nnamespace ql {\n\nclass func_t : public ptr_baggable_t, public pb_rcheckable_t {\npublic:\n func_t(env_t *env, js::id_t id, term_t *parent);\n func_t(env_t *env, const Term *_source);\n \/\/ Some queries, like filter, can take a shortcut object instead of a\n \/\/ function as their argument.\n static func_t *new_filter_func(env_t *env, const datum_t *obj,\n const pb_rcheckable_t *root);\n static func_t *new_identity_func(env_t *env, const datum_t *obj,\n const pb_rcheckable_t *root);\n val_t *call(const std::vector<const datum_t *> &args);\n \/\/ Prefer these two version of call.\n val_t *call(const datum_t *arg);\n val_t *call(const datum_t *arg1, const datum_t *arg2);\n bool filter_call(env_t *env, const datum_t *arg);\n\n void dump_scope(std::map<int, Datum> *out) const;\n bool is_deterministic() const;\n\nprivate:\n \/\/ Pointers to this function's arguments.\n std::vector<const datum_t *> argptrs;\n term_t *body; \/\/ body to evaluate with functions bound\n\n \/\/ This is what's serialized over the wire.\n friend class wire_func_t;\n const Term *source;\n bool implicit_bound;\n\n \/\/ TODO: make this smarter (it's sort of slow and shitty as-is)\n std::map<int, const datum_t **> scope;\n\n term_t *js_parent;\n env_t *js_env;\n js::id_t js_id;\n};\n\nclass js_result_visitor_t : public boost::static_visitor<val_t *> {\npublic:\n typedef val_t *result_type;\n\n js_result_visitor_t(env_t *_env, term_t *_parent) : env(_env), parent(_parent) { }\n\n \/\/ This JS evaluation resulted in an error\n result_type operator()(const std::string err_val) const {\n rfail_target(parent, \"%s\", err_val.c_str());\n unreachable();\n }\n\n \/\/ This JS call resulted in a JSON value\n result_type operator()(const boost::shared_ptr<scoped_cJSON_t> json_val) const {\n return parent->new_val(new datum_t(json_val, env));\n }\n\n \/\/ This JS evaluation resulted in an id for a js function\n result_type operator()(const id_t id_val) const {\n return parent->new_val(new func_t(env, id_val, parent));\n }\n\nprivate:\n env_t *env;\n term_t *parent;\n};\n\nRDB_MAKE_PROTOB_SERIALIZABLE(Term);\nRDB_MAKE_PROTOB_SERIALIZABLE(Datum);\n\n\n\/\/ Used to serialize a function (or gmr) over the wire.\nclass wire_func_t {\npublic:\n wire_func_t();\n wire_func_t(env_t *env, func_t *_func);\n wire_func_t(const Term &_source, std::map<int, Datum> *_scope);\n\n func_t *compile(env_t *env);\n\n RDB_MAKE_ME_SERIALIZABLE_2(source, scope);\n\nprivate:\n \/\/ We cache a separate function for every environment.\n std::map<env_t *, func_t *> cached_funcs;\n\n Term source;\n std::map<int, Datum> scope;\n};\n\nclass map_wire_func_t : public wire_func_t {\npublic:\n template <class... Args>\n map_wire_func_t(Args... args) : wire_func_t(args...) { }\n};\n\nclass filter_wire_func_t : public wire_func_t {\npublic:\n template <class... Args>\n filter_wire_func_t(Args... args) : wire_func_t(args...) { }\n};\n\nclass reduce_wire_func_t : public wire_func_t {\npublic:\n template <class... Args>\n reduce_wire_func_t(Args... args) : wire_func_t(args...) { }\n};\n\nclass concatmap_wire_func_t : public wire_func_t {\npublic:\n template <class... Args>\n concatmap_wire_func_t(Args... args) : wire_func_t(args...) { }\n};\n\n\/\/ Count is a fake function because we don't need to send anything.\nstruct count_wire_func_t { RDB_MAKE_ME_SERIALIZABLE_0() };\n\n\/\/ Grouped Map Reduce\nclass gmr_wire_func_t {\npublic:\n gmr_wire_func_t() { }\n gmr_wire_func_t(env_t *env, func_t *_group, func_t *_map, func_t *_reduce)\n : group(env, _group), map(env, _map), reduce(env, _reduce) { }\n func_t *compile_group(env_t *env) { return group.compile(env); }\n func_t *compile_map(env_t *env) { return map.compile(env); }\n func_t *compile_reduce(env_t *env) { return reduce.compile(env); }\nprivate:\n map_wire_func_t group;\n map_wire_func_t map;\n reduce_wire_func_t reduce;\npublic:\n RDB_MAKE_ME_SERIALIZABLE_3(group, map, reduce);\n};\n\n\/\/ Evaluating this returns a `func_t` wrapped in a `val_t`.\nclass func_term_t : public term_t {\npublic:\n func_term_t(env_t *env, const Term *term);\nprivate:\n virtual bool is_deterministic_impl() const;\n virtual val_t *eval_impl();\n virtual const char *name() const { return \"func\"; }\n func_t *func;\n};\n\n} \/\/ namespace ql\n#endif \/\/ RDB_PROTOCOL_FUNC_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id:\n\n#include \"ballviewDemo.h\"\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/common.h>\n#include <BALL\/KERNEL\/system.h>\n#include <BALL\/VIEW\/DIALOGS\/displayProperties.h>\n#include <BALL\/VIEW\/WIDGETS\/molecularStructure.h>\n#include <BALL\/VIEW\/DIALOGS\/FDPBDialog.h>\n#include <BALL\/FORMAT\/PDBFile.h>\n#include <BALL\/FORMAT\/HINFile.h>\n#include <BALL\/DATATYPE\/contourSurface.h>\n#include <BALL\/VIEW\/PRIMITIVES\/mesh.h>\n#include <BALL\/STRUCTURE\/HBondProcessor.h>\n#include <BALL\/VIEW\/WIDGETS\/scene.h>\n#include <BALL\/VIEW\/DATATYPE\/colorTable.h>\n#include <BALL\/VIEW\/DIALOGS\/colorMeshDialog.h>\n#include <BALL\/VIEW\/DIALOGS\/molecularFileDialog.h>\n\n#include <qlabel.h>\n#include <qpushbutton.h>\n#include <qwidgetstack.h>\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\nBALLViewDemo::BALLViewDemo(QWidget* parent, const char* name)\n\tthrow()\n\t:\tBALLViewDemoData(parent, name),\n\t\tModularWidget(name)\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"new BALLViewDemo \" << this << std::endl;\n#endif\n\t\/\/ register the widget with the MainControl\n \tModularWidget::registerWidget(this);\n\thide();\n}\n\nBALLViewDemo::~BALLViewDemo()\n\tthrow()\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"deleting BALLViewDemo \" << this << std::endl;\n#endif\n}\n\nvoid BALLViewDemo::show()\n{\n\twidget_stack->raiseWidget(0);\n\tbuttonOk->setEnabled(true);\n\tDisplayProperties* dp = DisplayProperties::getInstance(0);\n\tdp->setDrawingPrecision(DRAWING_PRECISION_HIGH);\n\tdp->setSurfaceDrawingPrecision(6.5);\n\tdp->enableCreationForNewMolecules(false);\n\tsystem_ = new System();\n\n\ttry\n\t{\n\t\tPath path;\n\t\tString file_name(path.getDataPath());\n\t\tfile_name = file_name.before(\"data\");\n\t\tfile_name += \"data\";\n\t\tfile_name += FileSystem::PATH_SEPARATOR;\n\t\tfile_name += String(\"structures\");\n\t\tfile_name += FileSystem::PATH_SEPARATOR;\n\t\tfile_name += \"bpti.pdb\";\n\t\tMolecularFileDialog* dialog = MolecularFileDialog::getInstance(0);\n\t\tsystem_ = dialog->openFile(file_name);\n\t\t\n\t\tsystem_->apply(getFragmentDB().add_hydrogens);\n\t\tsystem_->apply(getFragmentDB().build_bonds);\n\t\tgetMainControl()->update(*system_, true);\n\t}\n\tcatch(Exception::FileNotFound e)\n\t{\n\t\tLog.error() << \"Could not open \" << e.getFilename() << std::endl;\n\t\treturn;\n\t}\n\n\tcomposites_.clear();\n\tcomposites_.push_back(system_);\n\tQDialog::show();\n\traise();\n}\n\nvoid BALLViewDemo::onNotify(Message *message)\n\tthrow()\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"BALLViewDemo \" << this << \" onNotify \" << message << std::endl;\n#endif\n\n\tif (!isVisible()) return;\n\n\tRepresentationMessage* rmsg = RTTI::castTo<RepresentationMessage>(*message);\n\n\tIndex id = widget_stack->id(widget_stack->visibleWidget());\n\n\tif (id == 12)\n\t{\n\t\tif (RTTI::isKindOf<FinishedSimulationMessage>(*message))\n\t\t{\n\t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (id == 13)\n\t{\n\t\tRegularData3DMessage* msg = RTTI::castTo<RegularData3DMessage>(*message);\n\t\tif (msg != 0 &&\n\t\t\t ((RegularData3DMessage::RegularDataMessageType)msg->getType()) == RegularDataMessage::NEW)\n\t\t{\n\t\t\tgrid_ = msg->getData();\n\t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (id == 14)\n\t{\n\t\tSceneMessage* msg = RTTI::castTo<SceneMessage>(*message);\n\t\tif (msg != 0 && msg->getType() == SceneMessage::REBUILD_DISPLAY_LISTS)\n\t\t{\n \t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (rmsg != 0 && \n\t\t\t\t\t rmsg->getType() == RepresentationMessage::UPDATE)\n\t{\n\t\tnextStep_();\n\t}\n}\n\n\nvoid BALLViewDemo::nextStep_()\n{\n\twidget_stack->raiseWidget(widget_stack->id(widget_stack->visibleWidget()) + 1);\n\tbuttonOk->setEnabled(true);\n}\n\nvoid BALLViewDemo::accept()\n{\n\tIndex id = widget_stack->id(widget_stack->visibleWidget());\n\n\tif (id == 16) \/\/ last page\n\t{\n\t\thide();\n\t\treturn;\n\t}\n\n\tMolecularStructure* ms = MolecularStructure::getInstance(0);\n\tbool disable_button = true;\n\n\t\/\/ remove representations\n\tPrimitiveManager& pm = getMainControl()->getPrimitiveManager();\n\tSize nr = pm.getNumberOfRepresentations();\n\tlist<Representation*> reps = pm.getRepresentations();\n\tfor (Position p = 0; p < nr; p++)\n\t{\n\t\tgetMainControl()->remove(**reps.begin());\n\t\treps.pop_front();\n\t}\n\n\tif (id < 7)\n\t{\n\t\tModelType type = (ModelType) id;\n\t\tif (type >= MODEL_SA_SURFACE)\n\t\t{\n\t\t\ttype = (ModelType)((Index)type + 1);\n\t\t}\n \t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, type, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 7)\n\t{\n\t\tgetMainControl()->getMolecularControlSelection().clear();\n\t\tgetMainControl()->getMolecularControlSelection().push_back(system_);\n\t\tms->calculateHBonds();\n \tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n \tnotify_(crmsg);\n \t\tcrmsg = new CreateRepresentationMessage(composites_, MODEL_HBONDS, COLORING_ELEMENT);\n \t\tnotify_(crmsg);\n\t}\n\telse if (id == 8)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_VDW, COLORING_TEMPERATURE_FACTOR);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 9)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_CARTOON, COLORING_SECONDARY_STRUCTURE);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 10)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_CARTOON, COLORING_RESIDUE_INDEX);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 11)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_RESIDUE_NAME);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 12)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\n\t\tms->chooseAmberFF();\n\t\tms->getMDSimulationDialog().setTimeStep(0.001);\n \t\tms->getMDSimulationDialog().setNumberOfSteps(30);\n\t\tms->MDSimulation(false);\n\t}\n\telse if (id == 13) \/\/FDPB\n\t{\n\t\tms->calculateFDPB();\n\t\tms->getFDPBDialog()->okPressed();\n\t\tdisable_button = false;\n\t}\n\telse if (id == 14) \/\/ SES colored \n\t{\n\t\tgetMainControl()->getPrimitiveManager().setMultithreadingMode(false);\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_SE_SURFACE, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\t\tgetMainControl()->getPrimitiveManager().setMultithreadingMode(false);\n\n\t\tRepresentation* rep = *getMainControl()->getPrimitiveManager().begin();\n\t\tMesh* mesh = dynamic_cast<Mesh*> (*rep->getGeometricObjects().begin());\n\n\t\tColorMeshDialog* cdialog = ColorMeshDialog::getInstance(0);\n\t\tcdialog->setMesh(mesh, rep);\n\t\tcdialog->setGrid(grid_);\n\t\tcdialog->setMinValue(-0.7);\n\t\tcdialog->setMaxValue(3.0);\n\t\tcdialog->applyPressed();\n\n\t\trep->setColorProcessor(0);\n\n \t\tSceneMessage smsg(SceneMessage::REBUILD_DISPLAY_LISTS);\n \t\tgetMainControl()->sendMessage(smsg);\n\t\tdisable_button = false;\n\t}\n\telse if (id == 15)\n\t{\n\t\tContourSurface cs(*grid_, 0.01);\n\t\tMesh* mesh = new Mesh;\n\t\tmesh->Surface::operator = (static_cast<Surface&>(cs));\n\n\t\tVector3 center;\n\t\tfor (Position i = 0; i < mesh->vertex.size(); i++)\n\t\t{\n\t\t\tcenter += mesh->vertex[i];\n\t\t}\n\n\t\tcenter \/= mesh->vertex.size();\n\n\t\tSize nr_of_strange_normals = 0;\n\t\tfor (Position i = 0; i < mesh->normal.size(); i++)\n\t\t{\n\t\t\tif ((mesh->vertex[i] + mesh->normal[i]).getDistance(center) < (mesh->vertex[i] - mesh->normal[i]).getDistance(center))\n\t\t\t{\n\t\t\t\tnr_of_strange_normals ++;\n\t\t\t}\n\t\t}\n\n\t\tif (nr_of_strange_normals < mesh->normal.size() \/ 2.0)\n\t\t{\n\t\t\tfor (Position i = 0; i < mesh->normal.size(); i++)\n\t\t\t{\n\t\t\t\tmesh->normal[i] *= -1;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Create a new representation containing the contour surface.\n\t\tRepresentation* rep = getMainControl()->getPrimitiveManager().createRepresentation();\n\t\trep->insert(*mesh);\n\t\trep->setModelType(MODEL_CONTOUR_SURFACE); \n\n\t\tRepresentationMessage* message = new RepresentationMessage(*rep, RepresentationMessage::ADD);\n\t\tnotify_(message);\n\n \tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n \tnotify_(crmsg);\n\t}\n\n\tbuttonOk->setEnabled(!disable_button);\n}\n\n\n} } \/\/ namespaces\n<commit_msg>no message<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id:\n\n#include \"ballviewDemo.h\"\n#include <BALL\/VIEW\/KERNEL\/mainControl.h>\n#include <BALL\/VIEW\/KERNEL\/common.h>\n#include <BALL\/KERNEL\/system.h>\n#include <BALL\/VIEW\/DIALOGS\/displayProperties.h>\n#include <BALL\/VIEW\/WIDGETS\/molecularStructure.h>\n#include <BALL\/VIEW\/DIALOGS\/FDPBDialog.h>\n#include <BALL\/FORMAT\/PDBFile.h>\n#include <BALL\/FORMAT\/HINFile.h>\n#include <BALL\/DATATYPE\/contourSurface.h>\n#include <BALL\/VIEW\/PRIMITIVES\/mesh.h>\n#include <BALL\/STRUCTURE\/HBondProcessor.h>\n#include <BALL\/VIEW\/WIDGETS\/scene.h>\n#include <BALL\/VIEW\/DATATYPE\/colorTable.h>\n#include <BALL\/VIEW\/DIALOGS\/modifySurfaceDialog.h>\n#include <BALL\/VIEW\/DIALOGS\/molecularFileDialog.h>\n\n#include <qlabel.h>\n#include <qpushbutton.h>\n#include <qwidgetstack.h>\n\nnamespace BALL\n{\n\tnamespace VIEW\n\t{\n\nBALLViewDemo::BALLViewDemo(QWidget* parent, const char* name)\n\tthrow()\n\t:\tBALLViewDemoData(parent, name),\n\t\tModularWidget(name)\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"new BALLViewDemo \" << this << std::endl;\n#endif\n\t\/\/ register the widget with the MainControl\n \tModularWidget::registerWidget(this);\n\thide();\n}\n\nBALLViewDemo::~BALLViewDemo()\n\tthrow()\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"deleting BALLViewDemo \" << this << std::endl;\n#endif\n}\n\nvoid BALLViewDemo::show()\n{\n\twidget_stack->raiseWidget(0);\n\tbuttonOk->setEnabled(true);\n\tDisplayProperties* dp = DisplayProperties::getInstance(0);\n\tdp->setDrawingPrecision(DRAWING_PRECISION_HIGH);\n\tdp->setSurfaceDrawingPrecision(6.5);\n\tdp->enableCreationForNewMolecules(false);\n\tsystem_ = new System();\n\n\ttry\n\t{\n\t\tPath path;\n\t\tString file_name(path.getDataPath());\n\t\tfile_name = file_name.before(\"data\");\n\t\tfile_name += \"data\";\n\t\tfile_name += FileSystem::PATH_SEPARATOR;\n\t\tfile_name += String(\"structures\");\n\t\tfile_name += FileSystem::PATH_SEPARATOR;\n\t\tfile_name += \"bpti.pdb\";\n\t\tMolecularFileDialog* dialog = MolecularFileDialog::getInstance(0);\n\t\tsystem_ = dialog->openFile(file_name);\n\t\t\n\t\tsystem_->apply(getFragmentDB().add_hydrogens);\n\t\tsystem_->apply(getFragmentDB().build_bonds);\n\t\tgetMainControl()->update(*system_, true);\n\t}\n\tcatch(Exception::FileNotFound e)\n\t{\n\t\tLog.error() << \"Could not open \" << e.getFilename() << std::endl;\n\t\treturn;\n\t}\n\n\tcomposites_.clear();\n\tcomposites_.push_back(system_);\n\tQDialog::show();\n\traise();\n}\n\nvoid BALLViewDemo::onNotify(Message *message)\n\tthrow()\n{\n#ifdef BALL_VIEW_DEBUG\n\tLog.error() << \"BALLViewDemo \" << this << \" onNotify \" << message << std::endl;\n#endif\n\n\tif (!isVisible()) return;\n\n\tRepresentationMessage* rmsg = RTTI::castTo<RepresentationMessage>(*message);\n\n\tIndex id = widget_stack->id(widget_stack->visibleWidget());\n\n\tif (id == 12)\n\t{\n\t\tif (RTTI::isKindOf<FinishedSimulationMessage>(*message))\n\t\t{\n\t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (id == 13)\n\t{\n\t\tRegularData3DMessage* msg = RTTI::castTo<RegularData3DMessage>(*message);\n\t\tif (msg != 0 &&\n\t\t\t ((RegularData3DMessage::RegularDataMessageType)msg->getType()) == RegularDataMessage::NEW)\n\t\t{\n\t\t\tgrid_ = msg->getData();\n\t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (id == 14)\n\t{\n\t\tSceneMessage* msg = RTTI::castTo<SceneMessage>(*message);\n\t\tif (msg != 0 && msg->getType() == SceneMessage::REBUILD_DISPLAY_LISTS)\n\t\t{\n \t\t\tnextStep_();\n\t\t}\n\t}\n\telse if (rmsg != 0 && \n\t\t\t\t\t rmsg->getType() == RepresentationMessage::UPDATE)\n\t{\n\t\tnextStep_();\n\t}\n}\n\n\nvoid BALLViewDemo::nextStep_()\n{\n\twidget_stack->raiseWidget(widget_stack->id(widget_stack->visibleWidget()) + 1);\n\tbuttonOk->setEnabled(true);\n}\n\nvoid BALLViewDemo::accept()\n{\n\tIndex id = widget_stack->id(widget_stack->visibleWidget());\n\n\tif (id == 16) \/\/ last page\n\t{\n\t\thide();\n\t\treturn;\n\t}\n\n\tMolecularStructure* ms = MolecularStructure::getInstance(0);\n\tbool disable_button = true;\n\n\t\/\/ remove representations\n\tPrimitiveManager& pm = getMainControl()->getPrimitiveManager();\n\tSize nr = pm.getNumberOfRepresentations();\n\tlist<Representation*> reps = pm.getRepresentations();\n\tfor (Position p = 0; p < nr; p++)\n\t{\n\t\tgetMainControl()->remove(**reps.begin());\n\t\treps.pop_front();\n\t}\n\n\tif (id < 7)\n\t{\n\t\tModelType type = (ModelType) id;\n\t\tif (type >= MODEL_SA_SURFACE)\n\t\t{\n\t\t\ttype = (ModelType)((Index)type + 1);\n\t\t}\n \t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, type, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 7)\n\t{\n\t\tgetMainControl()->getMolecularControlSelection().clear();\n\t\tgetMainControl()->getMolecularControlSelection().push_back(system_);\n\t\tms->calculateHBonds();\n \tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n \tnotify_(crmsg);\n \t\tcrmsg = new CreateRepresentationMessage(composites_, MODEL_HBONDS, COLORING_ELEMENT);\n \t\tnotify_(crmsg);\n\t}\n\telse if (id == 8)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_VDW, COLORING_TEMPERATURE_FACTOR);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 9)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_CARTOON, COLORING_SECONDARY_STRUCTURE);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 10)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_CARTOON, COLORING_RESIDUE_INDEX);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 11)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_RESIDUE_NAME);\n\t\tnotify_(crmsg);\n\t}\n\telse if (id == 12)\n\t{\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\n\t\tms->chooseAmberFF();\n\t\tms->getMDSimulationDialog().setTimeStep(0.001);\n \t\tms->getMDSimulationDialog().setNumberOfSteps(30);\n\t\tms->MDSimulation(false);\n\t}\n\telse if (id == 13) \/\/FDPB\n\t{\n\t\tms->calculateFDPB();\n\t\tms->getFDPBDialog()->okPressed();\n\t\tdisable_button = false;\n\t}\n\telse if (id == 14) \/\/ SES colored \n\t{\n\t\tgetMainControl()->getPrimitiveManager().setMultithreadingMode(false);\n\t\tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_SE_SURFACE, COLORING_ELEMENT);\n\t\tnotify_(crmsg);\n\t\tgetMainControl()->getPrimitiveManager().setMultithreadingMode(false);\n\n\t\tRepresentation* rep = *getMainControl()->getPrimitiveManager().begin();\n\t\tModifySurfaceDialog* cdialog = ModifySurfaceDialog::getInstance(0);\n\t\tcdialog->setRepresentation(rep);\n\t\tcdialog->setGrid(grid_);\n\t\tcdialog->setMinValue(-0.7);\n\t\tcdialog->setMaxValue(3.0);\n\t\tcdialog->applyPressed();\n\n\t\trep->setColorProcessor(0);\n\n \t\tSceneMessage smsg(SceneMessage::REBUILD_DISPLAY_LISTS);\n \t\tgetMainControl()->sendMessage(smsg);\n\t\tdisable_button = false;\n\t}\n\telse if (id == 15)\n\t{\n\t\tContourSurface cs(*grid_, 0.01);\n\t\tMesh* mesh = new Mesh;\n\t\tmesh->Surface::operator = (static_cast<Surface&>(cs));\n\n\t\tVector3 center;\n\t\tfor (Position i = 0; i < mesh->vertex.size(); i++)\n\t\t{\n\t\t\tcenter += mesh->vertex[i];\n\t\t}\n\n\t\tcenter \/= mesh->vertex.size();\n\n\t\tSize nr_of_strange_normals = 0;\n\t\tfor (Position i = 0; i < mesh->normal.size(); i++)\n\t\t{\n\t\t\tif ((mesh->vertex[i] + mesh->normal[i]).getDistance(center) < (mesh->vertex[i] - mesh->normal[i]).getDistance(center))\n\t\t\t{\n\t\t\t\tnr_of_strange_normals ++;\n\t\t\t}\n\t\t}\n\n\t\tif (nr_of_strange_normals < mesh->normal.size() \/ 2.0)\n\t\t{\n\t\t\tfor (Position i = 0; i < mesh->normal.size(); i++)\n\t\t\t{\n\t\t\t\tmesh->normal[i] *= -1;\n\t\t\t}\n\t\t}\n\n\t\t\/\/ Create a new representation containing the contour surface.\n\t\tRepresentation* rep = getMainControl()->getPrimitiveManager().createRepresentation();\n\t\trep->insert(*mesh);\n\t\trep->setModelType(MODEL_CONTOUR_SURFACE); \n\n\t\tRepresentationMessage* message = new RepresentationMessage(*rep, RepresentationMessage::ADD);\n\t\tnotify_(message);\n\n \tCreateRepresentationMessage* crmsg = new CreateRepresentationMessage(composites_, MODEL_STICK, COLORING_ELEMENT);\n \tnotify_(crmsg);\n\t}\n\n\tbuttonOk->setEnabled(!disable_button);\n}\n\n\n} } \/\/ namespaces\n<|endoftext|>"} {"text":"<commit_before>\/\/ Begin CVS Header\n\/\/ $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/function\/CEvaluationNodeObject.cpp,v $\n\/\/ $Revision: 1.29 $\n\/\/ $Name: $\n\/\/ $Author: shoops $\n\/\/ $Date: 2007\/10\/02 18:18:03 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n#include \"CEvaluationNode.h\"\n#include \"CEvaluationTree.h\"\n#include \"CExpression.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"report\/CCopasiObject.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CModel.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n\n#include \"sbml\/math\/ASTNode.h\"\n#include \"sbml\/SBase.h\"\n#include \"sbml\/SBMLTypeCodes.h\"\n#include \"sbml\/Compartment.h\"\n#include \"sbml\/Species.h\"\n#include \"sbml\/Parameter.h\"\n#include \"sbml\/Reaction.h\"\n\nCEvaluationNodeObject::CEvaluationNodeObject():\n CEvaluationNode(CEvaluationNode::INVALID, \"\"),\n mpValue(NULL),\n mRegisteredObjectCN(\"\")\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const SubType & subType,\n const Data & data):\n CEvaluationNode((Type) (CEvaluationNode::OBJECT | subType), data),\n mpValue(NULL),\n mRegisteredObjectCN(data.substr(1, data.length() - 2))\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const CEvaluationNodeObject & src):\n CEvaluationNode(src),\n mpValue(src.mpValue),\n mRegisteredObjectCN(src.mRegisteredObjectCN)\n{}\n\nCEvaluationNodeObject::~CEvaluationNodeObject() {}\n\nbool CEvaluationNodeObject::compile(const CEvaluationTree * pTree)\n{\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n pExpression->getNodeObject(mRegisteredObjectCN);\n\n if (pObject)\n mpValue = (C_FLOAT64 *) pObject->getValuePointer();\n else\n mpValue = NULL;\n\n if (mpValue == NULL) return false;\n if (!pObject->isValueDbl()) return false;\n\n mData = \"<\" + mRegisteredObjectCN + \">\";\n\n return (getChild() == NULL); \/\/ We must not have any children.\n}\n\nCEvaluationNode::Data CEvaluationNodeObject::getData() const\n{return \"<\" + mRegisteredObjectCN + \">\";}\n\nbool CEvaluationNodeObject::setData(const Data & data)\n{\n mData = data;\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n\n return true;\n}\n\nstd::string CEvaluationNodeObject::getInfix() const\n {return \"<\" + mRegisteredObjectCN + \">\";}\n\n#if 0\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * pTree) const\n {\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n\n if (pObject == NULL) return \"<\" + mRegisteredObjectCN + \">\";\n\n return \"<\" + pObject->getObjectDisplayName() + \">\";\n }\n#endif\n\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * \/* pTree *\/) const\n {\n return \"<\" + mRegisteredObjectCN + \">\";\n }\n\nstd::string CEvaluationNodeObject::getDisplay_C_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return \"<\" + mRegisteredObjectCN + \">\";\n }\n\nstd::string CEvaluationNodeObject::getDisplay_MMD_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return \"<\" + mRegisteredObjectCN + \">\";\n }\n\nstd::string CEvaluationNodeObject::getDisplay_XPP_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return \"<\" + mRegisteredObjectCN + \">\";\n }\n\nCEvaluationNode* CEvaluationNodeObject::createNodeFromASTTree(const ASTNode& node)\n{\n CEvaluationNodeObject* pNode = NULL;\n ASTNodeType_t type = node.getType();\n switch (type)\n {\n case AST_NAME_TIME:\n case AST_NAME:\n pNode = new CEvaluationNodeObject(ANY, CCopasiObjectName(std::string(\"<\") + node.getName() + std::string(\">\")));\n break;\n default:\n break;\n }\n return pNode;\n}\n\nASTNode* CEvaluationNodeObject::toAST() const\n {\n ASTNode* node = new ASTNode();\n node->setType(AST_NAME);\n \/\/ since I can not get the model in which this node is located, I just\n \/\/ assume that it will always be the current global model.\n CCopasiObject* object = CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n assert(object);\n \/\/ if it is a reference, we get the parent of the reference\n if (object->isReference())\n {\n object = object->getObjectParent();\n }\n \/\/ actually we need to get the name from the key of the copasi object\n SBase* pSBase = CCopasiDataModel::Global->getCopasi2SBMLMap()[object];\n CModel* pModel = NULL;\n if (pSBase)\n {\n switch (pSBase->getTypeCode())\n {\n case SBML_COMPARTMENT:\n node->setName(dynamic_cast<Compartment*>(pSBase)->getId().c_str());\n break;\n case SBML_SPECIES:\n node->setName(dynamic_cast<Species*>(pSBase)->getId().c_str());\n break;\n case SBML_PARAMETER:\n node->setName(dynamic_cast<Parameter*>(pSBase)->getId().c_str());\n break;\n case SBML_REACTION:\n node->setName(dynamic_cast<Reaction*>(pSBase)->getId().c_str());\n break;\n case SBML_MODEL:\n node->setType(AST_NAME_TIME);\n node->setName(\"time\");\n pModel = dynamic_cast<CModel*>(object);\n if (pModel == NULL)\n {\n fatalError();\n }\n if (pModel->getInitialTime() != 0.0)\n {\n CCopasiMessage(CCopasiMessage::WARNING, MCSBML + 1);\n }\n break;\n default:\n CCopasiMessage(CCopasiMessage::EXCEPTION, MCEvaluationNodeObject + 1);\n break;\n }\n }\n else\n {\n \/\/ it must be a local parameter\n node->setName(object->getObjectName().c_str());\n }\n return node;\n }\n\nconst CRegisteredObjectName & CEvaluationNodeObject::getObjectCN() const\n {return mRegisteredObjectCN;}\n\n#include \"utilities\/copasimathml.h\"\n\nvoid CEvaluationNodeObject::writeMathML(std::ostream & out,\n const std::vector<std::vector<std::string> > & \/* env *\/,\n bool \/* expand *\/,\n unsigned C_INT32 l) const\n {\n const CCopasiObject* obj = CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n out << SPC(l) << CMathMl::getMMLName(obj) << std::endl;\n \/\/or use mValue instead?\n }\n<commit_msg>bug fixed: the changes (from 23.11.2007) in getDisplay_C\/MMD\/XPPAUT_String are incorrect<commit_after>\/\/ Begin CVS Header\n\/\/ $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/function\/CEvaluationNodeObject.cpp,v $\n\/\/ $Revision: 1.30 $\n\/\/ $Name: $\n\/\/ $Author: nsimus $\n\/\/ $Date: 2007\/11\/27 10:40:33 $\n\/\/ End CVS Header\n\n\/\/ Copyright (C) 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n#include \"CEvaluationNode.h\"\n#include \"CEvaluationTree.h\"\n#include \"CExpression.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"report\/CCopasiObject.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CModel.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n\n#include \"sbml\/math\/ASTNode.h\"\n#include \"sbml\/SBase.h\"\n#include \"sbml\/SBMLTypeCodes.h\"\n#include \"sbml\/Compartment.h\"\n#include \"sbml\/Species.h\"\n#include \"sbml\/Parameter.h\"\n#include \"sbml\/Reaction.h\"\n\nCEvaluationNodeObject::CEvaluationNodeObject():\n CEvaluationNode(CEvaluationNode::INVALID, \"\"),\n mpValue(NULL),\n mRegisteredObjectCN(\"\")\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const SubType & subType,\n const Data & data):\n CEvaluationNode((Type) (CEvaluationNode::OBJECT | subType), data),\n mpValue(NULL),\n mRegisteredObjectCN(data.substr(1, data.length() - 2))\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const CEvaluationNodeObject & src):\n CEvaluationNode(src),\n mpValue(src.mpValue),\n mRegisteredObjectCN(src.mRegisteredObjectCN)\n{}\n\nCEvaluationNodeObject::~CEvaluationNodeObject() {}\n\nbool CEvaluationNodeObject::compile(const CEvaluationTree * pTree)\n{\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n pExpression->getNodeObject(mRegisteredObjectCN);\n\n if (pObject)\n mpValue = (C_FLOAT64 *) pObject->getValuePointer();\n else\n mpValue = NULL;\n\n if (mpValue == NULL) return false;\n if (!pObject->isValueDbl()) return false;\n\n mData = \"<\" + mRegisteredObjectCN + \">\";\n\n return (getChild() == NULL); \/\/ We must not have any children.\n}\n\nCEvaluationNode::Data CEvaluationNodeObject::getData() const\n{return \"<\" + mRegisteredObjectCN + \">\";}\n\nbool CEvaluationNodeObject::setData(const Data & data)\n{\n mData = data;\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n\n return true;\n}\n\nstd::string CEvaluationNodeObject::getInfix() const\n {return \"<\" + mRegisteredObjectCN + \">\";}\n\n#if 0\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * pTree) const\n {\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n\n if (pObject == NULL) return \"<\" + mRegisteredObjectCN + \">\";\n\n return \"<\" + pObject->getObjectDisplayName() + \">\";\n }\n#endif\n\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * \/* pTree *\/) const\n {\n return \"<\" + mRegisteredObjectCN + \">\";\n }\n\nstd::string CEvaluationNodeObject::getDisplay_C_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return mData;\n }\n\nstd::string CEvaluationNodeObject::getDisplay_MMD_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return mData;\n }\n\nstd::string CEvaluationNodeObject::getDisplay_XPP_String(const CEvaluationTree * \/* pTree *\/) const\n {\n return mData;\n }\n\nCEvaluationNode* CEvaluationNodeObject::createNodeFromASTTree(const ASTNode& node)\n{\n CEvaluationNodeObject* pNode = NULL;\n ASTNodeType_t type = node.getType();\n switch (type)\n {\n case AST_NAME_TIME:\n case AST_NAME:\n pNode = new CEvaluationNodeObject(ANY, CCopasiObjectName(std::string(\"<\") + node.getName() + std::string(\">\")));\n break;\n default:\n break;\n }\n return pNode;\n}\n\nASTNode* CEvaluationNodeObject::toAST() const\n {\n ASTNode* node = new ASTNode();\n node->setType(AST_NAME);\n \/\/ since I can not get the model in which this node is located, I just\n \/\/ assume that it will always be the current global model.\n CCopasiObject* object = CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n assert(object);\n \/\/ if it is a reference, we get the parent of the reference\n if (object->isReference())\n {\n object = object->getObjectParent();\n }\n \/\/ actually we need to get the name from the key of the copasi object\n SBase* pSBase = CCopasiDataModel::Global->getCopasi2SBMLMap()[object];\n CModel* pModel = NULL;\n if (pSBase)\n {\n switch (pSBase->getTypeCode())\n {\n case SBML_COMPARTMENT:\n node->setName(dynamic_cast<Compartment*>(pSBase)->getId().c_str());\n break;\n case SBML_SPECIES:\n node->setName(dynamic_cast<Species*>(pSBase)->getId().c_str());\n break;\n case SBML_PARAMETER:\n node->setName(dynamic_cast<Parameter*>(pSBase)->getId().c_str());\n break;\n case SBML_REACTION:\n node->setName(dynamic_cast<Reaction*>(pSBase)->getId().c_str());\n break;\n case SBML_MODEL:\n node->setType(AST_NAME_TIME);\n node->setName(\"time\");\n pModel = dynamic_cast<CModel*>(object);\n if (pModel == NULL)\n {\n fatalError();\n }\n if (pModel->getInitialTime() != 0.0)\n {\n CCopasiMessage(CCopasiMessage::WARNING, MCSBML + 1);\n }\n break;\n default:\n CCopasiMessage(CCopasiMessage::EXCEPTION, MCEvaluationNodeObject + 1);\n break;\n }\n }\n else\n {\n \/\/ it must be a local parameter\n node->setName(object->getObjectName().c_str());\n }\n return node;\n }\n\nconst CRegisteredObjectName & CEvaluationNodeObject::getObjectCN() const\n {return mRegisteredObjectCN;}\n\n#include \"utilities\/copasimathml.h\"\n\nvoid CEvaluationNodeObject::writeMathML(std::ostream & out,\n const std::vector<std::vector<std::string> > & \/* env *\/,\n bool \/* expand *\/,\n unsigned C_INT32 l) const\n {\n const CCopasiObject* obj = CCopasiContainer::ObjectFromName(mRegisteredObjectCN);\n out << SPC(l) << CMathMl::getMMLName(obj) << std::endl;\n \/\/or use mValue instead?\n }\n<|endoftext|>"} {"text":"<commit_before><commit_msg>explicitly configuring the viewport to not draw a background<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2005 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n#include \"CEvaluationNode.h\"\n#include \"CEvaluationTree.h\"\n#include \"CExpression.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"report\/CCopasiObject.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CModel.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"math\/CMathObject.h\"\n#include \"math\/CMathContainer.h\"\n#include \"utilities\/CValidatedUnit.h\"\n\n#include \"sbml\/math\/ASTNode.h\"\n#include \"sbml\/SBase.h\"\n#include \"sbml\/SBMLTypeCodes.h\"\n#include \"sbml\/Compartment.h\"\n#include \"sbml\/Species.h\"\n#include \"sbml\/Parameter.h\"\n#include \"sbml\/Reaction.h\"\n\nCEvaluationNodeObject::CEvaluationNodeObject():\n CEvaluationNode(CEvaluationNode::INVALID, \"\"),\n mpObject(NULL),\n mRegisteredObjectCN(\"\")\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const SubType & subType,\n const Data & data):\n CEvaluationNode((Type)(CEvaluationNode::OBJECT | subType), data),\n mpObject(NULL),\n mRegisteredObjectCN()\n{\n switch (subType)\n {\n case INVALID:\n break;\n\n case CN:\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n break;\n\n case POINTER:\n mpValue = (const C_FLOAT64 *) stringToPointer(data);\n break;\n }\n\n mPrecedence = PRECEDENCE_NUMBER;\n}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const C_FLOAT64 * pValue):\n CEvaluationNode((Type)(CEvaluationNode::OBJECT | POINTER), \"pointer\"),\n mpObject(NULL),\n mRegisteredObjectCN(\"\")\n{\n mPrecedence = PRECEDENCE_NUMBER;\n mpValue = pValue;\n mData = pointerToString(pValue);\n}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const CEvaluationNodeObject & src):\n CEvaluationNode(src),\n mpObject(src.mpObject),\n mRegisteredObjectCN(src.mRegisteredObjectCN)\n{\n mpValue = src.mpValue;\n}\n\nCEvaluationNodeObject::~CEvaluationNodeObject() {}\n\nbool CEvaluationNodeObject::compile(const CEvaluationTree * pTree)\n{\n mpObject = NULL;\n mpValue = NULL;\n\n switch ((int) subType(mType))\n {\n case CN:\n {\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n\n if (!pExpression) return false;\n\n mpObject =\n pExpression->getNodeObject(mRegisteredObjectCN);\n\n const CCopasiObject * pDataObject = dynamic_cast< const CCopasiObject * >(mpObject);\n\n if (pDataObject != NULL)\n {\n \/\/ We may have some container objects for which the value is an included\n \/\/ reference. For the math model to work this needs to be corrected.\n const CObjectInterface * pObject = pDataObject->getValueObject();\n\n if (!pObject)\n return false;\n\n if (mpObject != pObject && pObject != NULL)\n {\n mpObject = pObject;\n mRegisteredObjectCN = mpObject->getCN();\n mData = getData();\n }\n\n if (pDataObject->isValueDbl())\n {\n mpValue = (C_FLOAT64 *) mpObject->getValuePointer();\n }\n }\n else if (mpObject != NULL)\n {\n mpValue = (C_FLOAT64 *) mpObject->getValuePointer();\n }\n\n if (mpValue == NULL)\n {\n mValue = std::numeric_limits<C_FLOAT64>::quiet_NaN();\n mpValue = &mValue;\n return false;\n }\n\n mData = \"<\" + mRegisteredObjectCN + \">\";\n }\n break;\n\n case POINTER:\n \/\/ We need to convert the data into a pointer\n mpValue = (const C_FLOAT64 *) stringToPointer(mData);\n\n if (pTree != NULL)\n {\n CMathContainer * pContainer = dynamic_cast< CMathContainer * >(pTree->getObjectAncestor(\"CMathContainer\"));\n\n if (pContainer != NULL)\n {\n mpObject = pContainer->getMathObject(mpValue);\n }\n }\n\n break;\n\n case INVALID:\n break;\n }\n\n return (getChild() == NULL); \/\/ We must not have any children.\n}\n\nconst CEvaluationNode::Data & CEvaluationNodeObject::getData() const\n{\n static std::string data;\n\n switch ((int) subType(mType))\n {\n case CN:\n return data = \"<\" + mRegisteredObjectCN + \">\";\n break;\n\n case POINTER:\n return mData;\n break;\n }\n\n return mData;\n}\n\nbool CEvaluationNodeObject::setData(const Data & data)\n{\n mData = data;\n\n if ((int) subType(mType) == (int) CN)\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n\n return true;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getInfix(const std::vector< std::string > & \/* children *\/) const\n{\n switch ((int) subType(mType))\n {\n case CN:\n return \"<\" + mRegisteredObjectCN + \">\";\n break;\n\n case POINTER:\n return mData;\n break;\n }\n\n return mData;\n}\n\n#if 0\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * pTree) const\n{\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n CCopasiContainer::ObjectFromCN(mRegisteredObjectCN);\n\n if (pObject == NULL) return \"<\" + mRegisteredObjectCN + \">\";\n\n return \"<\" + pObject->getObjectDisplayName() + \">\";\n}\n#endif\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getDisplayString(const std::vector< std::string > & \/* children *\/) const\n{\n const CCopasiObject* object = dynamic_cast<const CCopasiObject*>(mpObject);\n\n if (object != NULL)\n return object->getObjectDisplayName();\n\n return \"<\" + mRegisteredObjectCN + \">\";\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getCCodeString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getBerkeleyMadonnaString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getXPPString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ static\nCEvaluationNode * CEvaluationNodeObject::fromAST(const ASTNode * pASTNode, const std::vector< CEvaluationNode * > & children)\n{\n assert(pASTNode->getNumChildren() == children.size());\n\n CEvaluationNodeObject* pNode = NULL;\n\n switch (pASTNode->getType())\n {\n case AST_NAME_AVOGADRO:\n case AST_NAME_TIME:\n case AST_NAME:\n pNode = new CEvaluationNodeObject(CN, CCopasiObjectName(std::string(\"<\") + pASTNode->getName() + std::string(\">\")));\n break;\n\n default:\n break;\n }\n\n return pNode;\n}\n\nASTNode* CEvaluationNodeObject::toAST(const CCopasiDataModel* pDataModel) const\n{\n ASTNode* node = new ASTNode();\n node->setType(AST_NAME);\n\n if (mRegisteredObjectCN == \"rateOf\")\n {\n node->setType(AST_FUNCTION);\n const CEvaluationNode* child = dynamic_cast<const CEvaluationNode*>(this->getChild());\n\n if (child == NULL) fatalError();\n\n const CEvaluationNodeObject* sibling = dynamic_cast<const CEvaluationNodeObject*>(this->getChild()->getSibling());\n\n if (sibling == NULL) fatalError();\n\n node->setName(sibling->getObjectCN().c_str());\n node->addChild(child->toAST(pDataModel));\n return node;\n }\n\n \/\/ since I can not get the model in which this node is located, I just\n \/\/ assume that it will always be the current global model.\n const CCopasiObject* pOrigObject = CObjectInterface::DataObject(pDataModel->getObjectFromCN(mRegisteredObjectCN));\n\n if (pOrigObject == NULL)\n {\n node->setName(mRegisteredObjectCN.c_str());\n return node;\n }\n\n const CCopasiObject* pObject = pOrigObject;\n\n \/\/ if it is a reference, we get the parent of the reference\n if (pObject->isReference())\n {\n pObject = pObject->getObjectParent();\n }\n\n const CModelEntity* pME = dynamic_cast<const CModelEntity*>(pObject);\n\n if (pME != NULL)\n {\n const CModel* pModel = dynamic_cast<const CModel*>(pME);\n\n if (pModel != NULL)\n {\n#if LIBSBML_VERSION >= 40100\n\n if (pOrigObject->getObjectName() == \"Avogadro Constant\")\n {\n node->setType(AST_NAME_AVOGADRO);\n node->setName(\"avogadro\");\n }\n else\n {\n#endif \/\/ LIBSBML_VERSION >= 40100\n node->setType(AST_NAME_TIME);\n node->setName(\"time\");\n\n if (pModel->getInitialTime() != 0.0)\n {\n CCopasiMessage(CCopasiMessage::WARNING, MCSBML + 1);\n }\n\n#if LIBSBML_VERSION >= 40100\n }\n\n#endif \/\/ LIBSBML_VERSION >= 40100\n }\n else\n {\n node->setName(pME->getSBMLId().c_str());\n }\n }\n else\n {\n const CCopasiParameter* pPara = dynamic_cast<const CCopasiParameter*>(pObject);\n\n if (pPara != NULL)\n {\n \/\/ now we have to use the common name as the name for the\n \/\/ node since we need to be able to identify local parameters\n \/\/ in arbitrary expressions for the export\n node->setName(pPara->getCN().c_str());\n }\n else\n {\n const CReaction* pReaction = dynamic_cast<const CReaction*>(pObject);\n\n if (pReaction)\n {\n node->setName(pReaction->getSBMLId().c_str());\n }\n else\n {\n fatalError();\n }\n }\n }\n\n return node;\n}\n\nconst CRegisteredObjectName & CEvaluationNodeObject::getObjectCN() const\n{return mRegisteredObjectCN;}\n\nconst CObjectInterface * CEvaluationNodeObject::getObjectInterfacePtr() const\n{\n return mpObject;\n}\n\nconst C_FLOAT64 * CEvaluationNodeObject::getObjectValuePtr() const\n{\n return mpValue;\n}\n\nvoid CEvaluationNodeObject::setObjectValuePtr(C_FLOAT64 * pObjectValue)\n{\n assert(pObjectValue);\n\n switch ((int) subType(mType))\n {\n case CN:\n break;\n\n case POINTER:\n\n if (mpValue != pObjectValue)\n {\n mpValue = pObjectValue;\n mData = pointerToString(mpValue);\n }\n\n break;\n }\n\n return;\n}\n\n#include \"utilities\/copasimathml.h\"\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getMMLString(const std::vector< std::string > & \/* children *\/ ,\n bool \/* expand *\/,\n const std::vector< std::vector< std::string > > & \/* variables *\/) const\n{\n std::ostringstream out;\n\n const CCopasiObject * pDataObject = CObjectInterface::DataObject(mpObject);\n\n out << CMathMl::getMMLName(pDataObject) << std::endl;\n\n return out.str();\n}\n\n\/\/ virtual\nCValidatedUnit CEvaluationNodeObject::getUnit(const CMathContainer & container,\n const std::vector< CValidatedUnit > & units) const\n{\n const CObjectInterface * pObject = container.getMathObject(mpValue);\n const CCopasiObject * pDataObject = (pObject != NULL) ? pObject->getDataObject() : NULL;\n\n if (pDataObject != NULL)\n {\n return CValidatedUnit::merge(units[0], CValidatedUnit(pDataObject->getUnits(), false));\n }\n\n return CValidatedUnit::merge(units[0], CValidatedUnit());\n}\n<commit_msg>Fixed assertion failure CEvaluationNodeObject::setObjectValuePtr.<commit_after>\/\/ Copyright (C) 2010 - 2016 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., University of Heidelberg, and The University\n\/\/ of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2008 - 2009 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc., EML Research, gGmbH, University of Heidelberg,\n\/\/ and The University of Manchester.\n\/\/ All rights reserved.\n\n\/\/ Copyright (C) 2005 - 2007 by Pedro Mendes, Virginia Tech Intellectual\n\/\/ Properties, Inc. and EML Research, gGmbH.\n\/\/ All rights reserved.\n\n#include \"copasi.h\"\n#include \"CEvaluationNode.h\"\n#include \"CEvaluationTree.h\"\n#include \"CExpression.h\"\n#include \"report\/CCopasiObjectName.h\"\n#include \"report\/CCopasiObject.h\"\n#include \"report\/CCopasiContainer.h\"\n#include \"model\/CModel.h\"\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n#include \"math\/CMathObject.h\"\n#include \"math\/CMathContainer.h\"\n#include \"utilities\/CValidatedUnit.h\"\n\n#include \"sbml\/math\/ASTNode.h\"\n#include \"sbml\/SBase.h\"\n#include \"sbml\/SBMLTypeCodes.h\"\n#include \"sbml\/Compartment.h\"\n#include \"sbml\/Species.h\"\n#include \"sbml\/Parameter.h\"\n#include \"sbml\/Reaction.h\"\n\nCEvaluationNodeObject::CEvaluationNodeObject():\n CEvaluationNode(CEvaluationNode::INVALID, \"\"),\n mpObject(NULL),\n mRegisteredObjectCN(\"\")\n{mPrecedence = PRECEDENCE_NUMBER;}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const SubType & subType,\n const Data & data):\n CEvaluationNode((Type)(CEvaluationNode::OBJECT | subType), data),\n mpObject(NULL),\n mRegisteredObjectCN()\n{\n switch (subType)\n {\n case INVALID:\n break;\n\n case CN:\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n break;\n\n case POINTER:\n mpValue = (const C_FLOAT64 *) stringToPointer(data);\n break;\n }\n\n mPrecedence = PRECEDENCE_NUMBER;\n}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const C_FLOAT64 * pValue):\n CEvaluationNode((Type)(CEvaluationNode::OBJECT | POINTER), \"pointer\"),\n mpObject(NULL),\n mRegisteredObjectCN(\"\")\n{\n mPrecedence = PRECEDENCE_NUMBER;\n mpValue = pValue;\n mData = pointerToString(pValue);\n}\n\nCEvaluationNodeObject::CEvaluationNodeObject(const CEvaluationNodeObject & src):\n CEvaluationNode(src),\n mpObject(src.mpObject),\n mRegisteredObjectCN(src.mRegisteredObjectCN)\n{\n mpValue = src.mpValue;\n}\n\nCEvaluationNodeObject::~CEvaluationNodeObject() {}\n\nbool CEvaluationNodeObject::compile(const CEvaluationTree * pTree)\n{\n mpObject = NULL;\n mpValue = NULL;\n\n switch ((int) subType(mType))\n {\n case CN:\n {\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n\n if (!pExpression) return false;\n\n mpObject =\n pExpression->getNodeObject(mRegisteredObjectCN);\n\n const CCopasiObject * pDataObject = dynamic_cast< const CCopasiObject * >(mpObject);\n\n if (pDataObject != NULL)\n {\n \/\/ We may have some container objects for which the value is an included\n \/\/ reference. For the math model to work this needs to be corrected.\n const CObjectInterface * pObject = pDataObject->getValueObject();\n\n if (!pObject)\n return false;\n\n if (mpObject != pObject && pObject != NULL)\n {\n mpObject = pObject;\n mRegisteredObjectCN = mpObject->getCN();\n mData = getData();\n }\n\n if (pDataObject->isValueDbl())\n {\n mpValue = (C_FLOAT64 *) mpObject->getValuePointer();\n }\n }\n else if (mpObject != NULL)\n {\n mpValue = (C_FLOAT64 *) mpObject->getValuePointer();\n }\n\n if (mpValue == NULL)\n {\n mValue = std::numeric_limits<C_FLOAT64>::quiet_NaN();\n mpValue = &mValue;\n return false;\n }\n\n mData = \"<\" + mRegisteredObjectCN + \">\";\n }\n break;\n\n case POINTER:\n \/\/ We need to convert the data into a pointer\n mpValue = (const C_FLOAT64 *) stringToPointer(mData);\n\n if (pTree != NULL)\n {\n CMathContainer * pContainer = dynamic_cast< CMathContainer * >(pTree->getObjectAncestor(\"CMathContainer\"));\n\n if (pContainer != NULL)\n {\n mpObject = pContainer->getMathObject(mpValue);\n }\n }\n\n if (mpValue == NULL)\n {\n mValue = std::numeric_limits<C_FLOAT64>::quiet_NaN();\n mpValue = &mValue;\n return false;\n }\n\n break;\n\n case INVALID:\n break;\n }\n\n return (getChild() == NULL); \/\/ We must not have any children.\n}\n\nconst CEvaluationNode::Data & CEvaluationNodeObject::getData() const\n{\n static std::string data;\n\n switch ((int) subType(mType))\n {\n case CN:\n return data = \"<\" + mRegisteredObjectCN + \">\";\n break;\n\n case POINTER:\n return mData;\n break;\n }\n\n return mData;\n}\n\nbool CEvaluationNodeObject::setData(const Data & data)\n{\n mData = data;\n\n if ((int) subType(mType) == (int) CN)\n mRegisteredObjectCN = data.substr(1, data.length() - 2);\n\n return true;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getInfix(const std::vector< std::string > & \/* children *\/) const\n{\n switch ((int) subType(mType))\n {\n case CN:\n return \"<\" + mRegisteredObjectCN + \">\";\n break;\n\n case POINTER:\n return mData;\n break;\n }\n\n return mData;\n}\n\n#if 0\nstd::string CEvaluationNodeObject::getDisplayString(const CEvaluationTree * pTree) const\n{\n const CExpression * pExpression = dynamic_cast< const CExpression * >(pTree);\n\n if (!pExpression) return false;\n\n const CCopasiObject * pObject =\n CCopasiContainer::ObjectFromCN(mRegisteredObjectCN);\n\n if (pObject == NULL) return \"<\" + mRegisteredObjectCN + \">\";\n\n return \"<\" + pObject->getObjectDisplayName() + \">\";\n}\n#endif\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getDisplayString(const std::vector< std::string > & \/* children *\/) const\n{\n const CCopasiObject* object = dynamic_cast<const CCopasiObject*>(mpObject);\n\n if (object != NULL)\n return object->getObjectDisplayName();\n\n return \"<\" + mRegisteredObjectCN + \">\";\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getCCodeString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getBerkeleyMadonnaString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getXPPString(const std::vector< std::string > & \/* children *\/) const\n{\n return mData;\n}\n\n\/\/ static\nCEvaluationNode * CEvaluationNodeObject::fromAST(const ASTNode * pASTNode, const std::vector< CEvaluationNode * > & children)\n{\n assert(pASTNode->getNumChildren() == children.size());\n\n CEvaluationNodeObject* pNode = NULL;\n\n switch (pASTNode->getType())\n {\n case AST_NAME_AVOGADRO:\n case AST_NAME_TIME:\n case AST_NAME:\n pNode = new CEvaluationNodeObject(CN, CCopasiObjectName(std::string(\"<\") + pASTNode->getName() + std::string(\">\")));\n break;\n\n default:\n break;\n }\n\n return pNode;\n}\n\nASTNode* CEvaluationNodeObject::toAST(const CCopasiDataModel* pDataModel) const\n{\n ASTNode* node = new ASTNode();\n node->setType(AST_NAME);\n\n if (mRegisteredObjectCN == \"rateOf\")\n {\n node->setType(AST_FUNCTION);\n const CEvaluationNode* child = dynamic_cast<const CEvaluationNode*>(this->getChild());\n\n if (child == NULL) fatalError();\n\n const CEvaluationNodeObject* sibling = dynamic_cast<const CEvaluationNodeObject*>(this->getChild()->getSibling());\n\n if (sibling == NULL) fatalError();\n\n node->setName(sibling->getObjectCN().c_str());\n node->addChild(child->toAST(pDataModel));\n return node;\n }\n\n \/\/ since I can not get the model in which this node is located, I just\n \/\/ assume that it will always be the current global model.\n const CCopasiObject* pOrigObject = CObjectInterface::DataObject(pDataModel->getObjectFromCN(mRegisteredObjectCN));\n\n if (pOrigObject == NULL)\n {\n node->setName(mRegisteredObjectCN.c_str());\n return node;\n }\n\n const CCopasiObject* pObject = pOrigObject;\n\n \/\/ if it is a reference, we get the parent of the reference\n if (pObject->isReference())\n {\n pObject = pObject->getObjectParent();\n }\n\n const CModelEntity* pME = dynamic_cast<const CModelEntity*>(pObject);\n\n if (pME != NULL)\n {\n const CModel* pModel = dynamic_cast<const CModel*>(pME);\n\n if (pModel != NULL)\n {\n#if LIBSBML_VERSION >= 40100\n\n if (pOrigObject->getObjectName() == \"Avogadro Constant\")\n {\n node->setType(AST_NAME_AVOGADRO);\n node->setName(\"avogadro\");\n }\n else\n {\n#endif \/\/ LIBSBML_VERSION >= 40100\n node->setType(AST_NAME_TIME);\n node->setName(\"time\");\n\n if (pModel->getInitialTime() != 0.0)\n {\n CCopasiMessage(CCopasiMessage::WARNING, MCSBML + 1);\n }\n\n#if LIBSBML_VERSION >= 40100\n }\n\n#endif \/\/ LIBSBML_VERSION >= 40100\n }\n else\n {\n node->setName(pME->getSBMLId().c_str());\n }\n }\n else\n {\n const CCopasiParameter* pPara = dynamic_cast<const CCopasiParameter*>(pObject);\n\n if (pPara != NULL)\n {\n \/\/ now we have to use the common name as the name for the\n \/\/ node since we need to be able to identify local parameters\n \/\/ in arbitrary expressions for the export\n node->setName(pPara->getCN().c_str());\n }\n else\n {\n const CReaction* pReaction = dynamic_cast<const CReaction*>(pObject);\n\n if (pReaction)\n {\n node->setName(pReaction->getSBMLId().c_str());\n }\n else\n {\n fatalError();\n }\n }\n }\n\n return node;\n}\n\nconst CRegisteredObjectName & CEvaluationNodeObject::getObjectCN() const\n{return mRegisteredObjectCN;}\n\nconst CObjectInterface * CEvaluationNodeObject::getObjectInterfacePtr() const\n{\n return mpObject;\n}\n\nconst C_FLOAT64 * CEvaluationNodeObject::getObjectValuePtr() const\n{\n return mpValue;\n}\n\nvoid CEvaluationNodeObject::setObjectValuePtr(C_FLOAT64 * pObjectValue)\n{\n switch ((int) subType(mType))\n {\n case CN:\n break;\n\n case POINTER:\n\n if (mpValue != pObjectValue)\n {\n mpValue = pObjectValue;\n mData = pointerToString(mpValue);\n\n if (mpValue == NULL)\n {\n mpValue = &mValue;\n }\n }\n\n break;\n }\n\n return;\n}\n\n#include \"utilities\/copasimathml.h\"\n\n\/\/ virtual\nstd::string CEvaluationNodeObject::getMMLString(const std::vector< std::string > & \/* children *\/ ,\n bool \/* expand *\/,\n const std::vector< std::vector< std::string > > & \/* variables *\/) const\n{\n std::ostringstream out;\n\n const CCopasiObject * pDataObject = CObjectInterface::DataObject(mpObject);\n\n out << CMathMl::getMMLName(pDataObject) << std::endl;\n\n return out.str();\n}\n\n\/\/ virtual\nCValidatedUnit CEvaluationNodeObject::getUnit(const CMathContainer & container,\n const std::vector< CValidatedUnit > & units) const\n{\n const CObjectInterface * pObject = container.getMathObject(mpValue);\n const CCopasiObject * pDataObject = (pObject != NULL) ? pObject->getDataObject() : NULL;\n\n if (pDataObject != NULL)\n {\n return CValidatedUnit::merge(units[0], CValidatedUnit(pDataObject->getUnits(), false));\n }\n\n return CValidatedUnit::merge(units[0], CValidatedUnit());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013, Moving Pixel Labs (http:\/\/www.mp-labs.net)\n * All rights reserved.\n\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Moving Pixel Labs nor the names of its\n * contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL MOVING PIXEL LABS BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <QtCore\/QBuffer>\n#include <QtCore\/QByteArray>\n\n#include <gtest\/gtest.h>\n\n#include <data\/MetaBlock.hpp>\n\n#include <serialization\/KoreSerializer.hpp>\n\n#include \"..\/data\/MyBlock.hpp\"\n#include \"..\/data\/MyBlock1.hpp\"\n#include \"..\/data\/MyBlock2.hpp\"\n#include \"..\/data\/MyLibrary.hpp\"\n\nusing namespace DataTestModule;\nusing namespace Kore::data;\nusing namespace Kore::serialization;\n\nTEST( SerializationTest, SerializeBlock )\n{\n MyBlock1* block = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block->setLeInt( 123456 );\n block->setLaString( \"Hello World!\" );\n\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, block, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n ASSERT_TRUE( K_NULL != inflatedBlock );\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyBlock1 >() );\n\n EXPECT_TRUE( block->leInt() == inflatedBlock->to< MyBlock1 >()->leInt() );\n\n EXPECT_TRUE( block->laString() ==\n inflatedBlock->to< MyBlock1 >()->laString() );\n\n delete block;\n delete inflatedBlock;\n}\n\nTEST( SerializationTest, SerializeTree )\n{\n MyLibrary* lib1 = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n\n MyBlock1* block1 = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block1->setLeInt( 123 );\n block1->setLaString( \"Blabla\" );\n block1->leCustomType().laString = \"Ahahah\";\n block1->leCustomType().leInt32 = 254;\n\n lib1->addBlock( block1 );\n\n MyLibrary* lib2 = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n lib1->addBlock( lib2 );\n\n MyBlock1* block2 = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block2->setLeInt( 456 );\n block2->setLaString( \"Tududu\" );\n lib2->addBlock( block2 );\n\n \/\/ This type is not serializable !\n MyBlock2* block3 = K_BLOCK_CREATE_INSTANCE( MyBlock2 );\n lib2->addBlock( block3 );\n\n ASSERT_TRUE( lib1->size() == 2 );\n ASSERT_TRUE( lib1->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leInt() == 123 );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->laString() == \"Blabla\" );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leCustomType().laString ==\n \"Ahahah\" );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leCustomType().leInt32 == 254 );\n\n ASSERT_TRUE( lib1->at( 1 )->fastInherits< MyLibrary >() );\n ASSERT_TRUE( lib1->at< MyLibrary >( 1 )->size() == 2 );\n ASSERT_TRUE(\n lib1->at< MyLibrary >( 1 )->at( 0 )->fastInherits< MyBlock1 >() );\n ASSERT_TRUE(\n lib1->at< MyLibrary >( 1 )->at( 1 )->fastInherits< MyBlock2 >() );\n EXPECT_TRUE(\n lib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->leInt() == 456 );\n EXPECT_TRUE( lib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->laString() ==\n \"Tududu\" );\n\n \/\/ Now serialize\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, lib1, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyLibrary >() );\n\n MyLibrary* iLib1 = inflatedBlock->to< MyLibrary >();\n\n ASSERT_TRUE( iLib1->size() == 2 ) << iLib1->size() << \" child block(s)\";\n ASSERT_TRUE( iLib1->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leInt() == 123 );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->laString() == \"Blabla\" );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leCustomType().laString ==\n \"Ahahah\" );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leCustomType().leInt32 == 254 );\n\n ASSERT_TRUE( iLib1->at( 1 )->fastInherits< MyLibrary >() );\n EXPECT_TRUE( iLib1->at< MyLibrary >( 1 )->size() == 1 );\n ASSERT_TRUE(\n iLib1->at< MyLibrary >( 1 )->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE(\n iLib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->leInt() == 456 );\n EXPECT_TRUE( iLib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->laString() ==\n \"Tududu\" );\n\n delete lib1;\n delete iLib1;\n}\n<commit_msg>Adding bigger serialization tests.<commit_after>\/*\n * Copyright (c) 2013, Moving Pixel Labs (http:\/\/www.mp-labs.net)\n * All rights reserved.\n\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Moving Pixel Labs nor the names of its\n * contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL MOVING PIXEL LABS BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <QtCore\/QBuffer>\n#include <QtCore\/QByteArray>\n\n#include <gtest\/gtest.h>\n\n#include <data\/MetaBlock.hpp>\n\n#include <serialization\/KoreSerializer.hpp>\n\n#include \"..\/data\/MyBlock.hpp\"\n#include \"..\/data\/MyBlock1.hpp\"\n#include \"..\/data\/MyBlock2.hpp\"\n#include \"..\/data\/MyLibrary.hpp\"\n\nusing namespace DataTestModule;\nusing namespace Kore::data;\nusing namespace Kore::serialization;\n\nTEST( SerializationTest, SerializeBlock )\n{\n MyBlock1* block = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block->setLeInt( 123456 );\n block->setLaString( \"Hello World!\" );\n\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, block, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n ASSERT_TRUE( K_NULL != inflatedBlock );\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyBlock1 >() );\n\n EXPECT_TRUE( block->leInt() == inflatedBlock->to< MyBlock1 >()->leInt() );\n\n EXPECT_TRUE( block->laString() ==\n inflatedBlock->to< MyBlock1 >()->laString() );\n\n delete block;\n delete inflatedBlock;\n}\n\nTEST( SerializationTest, SerializeTree )\n{\n MyLibrary* lib1 = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n\n MyBlock1* block1 = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block1->setLeInt( 123 );\n block1->setLaString( \"Blabla\" );\n block1->leCustomType().laString = \"Ahahah\";\n block1->leCustomType().leInt32 = 254;\n\n lib1->addBlock( block1 );\n\n MyLibrary* lib2 = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n lib1->addBlock( lib2 );\n\n MyBlock1* block2 = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n block2->setLeInt( 456 );\n block2->setLaString( \"Tududu\" );\n lib2->addBlock( block2 );\n\n \/\/ This type is not serializable !\n MyBlock2* block3 = K_BLOCK_CREATE_INSTANCE( MyBlock2 );\n lib2->addBlock( block3 );\n\n ASSERT_TRUE( lib1->size() == 2 );\n ASSERT_TRUE( lib1->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leInt() == 123 );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->laString() == \"Blabla\" );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leCustomType().laString ==\n \"Ahahah\" );\n EXPECT_TRUE( lib1->at< MyBlock1 >( 0 )->leCustomType().leInt32 == 254 );\n\n ASSERT_TRUE( lib1->at( 1 )->fastInherits< MyLibrary >() );\n ASSERT_TRUE( lib1->at< MyLibrary >( 1 )->size() == 2 );\n ASSERT_TRUE(\n lib1->at< MyLibrary >( 1 )->at( 0 )->fastInherits< MyBlock1 >() );\n ASSERT_TRUE(\n lib1->at< MyLibrary >( 1 )->at( 1 )->fastInherits< MyBlock2 >() );\n EXPECT_TRUE(\n lib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->leInt() == 456 );\n EXPECT_TRUE( lib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->laString() ==\n \"Tududu\" );\n\n \/\/ Now serialize\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, lib1, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyLibrary >() );\n\n MyLibrary* iLib1 = inflatedBlock->to< MyLibrary >();\n\n ASSERT_TRUE( iLib1->size() == 2 ) << iLib1->size() << \" child block(s)\";\n ASSERT_TRUE( iLib1->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leInt() == 123 );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->laString() == \"Blabla\" );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leCustomType().laString ==\n \"Ahahah\" );\n EXPECT_TRUE( iLib1->at< MyBlock1 >( 0 )->leCustomType().leInt32 == 254 );\n\n ASSERT_TRUE( iLib1->at( 1 )->fastInherits< MyLibrary >() );\n EXPECT_TRUE( iLib1->at< MyLibrary >( 1 )->size() == 1 );\n ASSERT_TRUE(\n iLib1->at< MyLibrary >( 1 )->at( 0 )->fastInherits< MyBlock1 >() );\n EXPECT_TRUE(\n iLib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->leInt() == 456 );\n EXPECT_TRUE( iLib1->at< MyLibrary >( 1 )->at< MyBlock1 >( 0 )->laString() ==\n \"Tududu\" );\n\n delete lib1;\n delete iLib1;\n}\n\nTEST( SerializationTest, SerializeBigTree128 )\n{\n const int childrenNb = 128;\n\n MyLibrary* lib = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n\n for( int i = 0; i < childrenNb; ++i )\n {\n MyBlock1* block = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n lib->addBlock( block );\n }\n\n ASSERT_TRUE( lib->size() == childrenNb );\n\n \/\/ Now serialize\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, lib, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyLibrary >() );\n\n MyLibrary* iLib = inflatedBlock->to< MyLibrary >();\n\n ASSERT_TRUE( iLib->size() == childrenNb ) << iLib->size()\n << \" child block(s)\";\n\n delete lib;\n delete iLib;\n}\n\nTEST( SerializationTest, SerializeBigTree512 )\n{\n const int childrenNb = 512;\n\n MyLibrary* lib = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n\n for( int i = 0; i < childrenNb; ++i )\n {\n MyBlock1* block = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n lib->addBlock( block );\n }\n\n ASSERT_TRUE( lib->size() == childrenNb );\n\n \/\/ Now serialize\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, lib, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyLibrary >() );\n\n MyLibrary* iLib = inflatedBlock->to< MyLibrary >();\n\n ASSERT_TRUE( iLib->size() == childrenNb ) << iLib->size()\n << \" child block(s)\";\n\n delete lib;\n delete iLib;\n}\n\n\nTEST( SerializationTest, SerializeBigTree70000 )\n{\n const int childrenNb = 70000;\n\n MyLibrary* lib = K_BLOCK_CREATE_INSTANCE( MyLibrary );\n\n for( int i = 0; i < childrenNb; ++i )\n {\n MyBlock1* block = K_BLOCK_CREATE_INSTANCE( MyBlock1 );\n lib->addBlock( block );\n }\n\n ASSERT_TRUE( lib->size() == childrenNb );\n\n \/\/ Now serialize\n QByteArray buffer;\n QBuffer device( & buffer );\n device.open( QIODevice::ReadWrite );\n\n int err;\n\n KoreSerializer serializer;\n err = serializer.deflate( & device, lib, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n \/\/ Reset...\n device.seek( 0 );\n\n Block* inflatedBlock;\n err = serializer.inflate( & device, & inflatedBlock, K_NULL );\n ASSERT_TRUE( KoreSerializer::NoError == err ) << \"Error code: \" << err;\n\n ASSERT_TRUE( inflatedBlock->fastInherits< MyLibrary >() );\n\n MyLibrary* iLib = inflatedBlock->to< MyLibrary >();\n\n ASSERT_TRUE( iLib->size() == childrenNb ) << iLib->size()\n << \" child block(s)\";\n\n delete lib;\n delete iLib;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <numeric>\n#include <string>\n#include <sstream>\n\n#include <cmath>\n\n#include \"filtrations\/Data.hh\"\n\n#include \"geometry\/RipsExpander.hh\"\n\n#include \"persistenceDiagrams\/Norms.hh\"\n#include \"persistenceDiagrams\/PersistenceDiagram.hh\"\n\n#include \"persistentHomology\/ConnectedComponents.hh\"\n\n#include \"topology\/CliqueGraph.hh\"\n#include \"topology\/ConnectedComponents.hh\"\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include \"topology\/io\/EdgeLists.hh\"\n#include \"topology\/io\/GML.hh\"\n#include \"topology\/io\/Pajek.hh\"\n\n#include \"utilities\/Filesystem.hh\"\n\nusing DataType = double;\nusing VertexType = unsigned;\nusing Simplex = aleph::topology::Simplex<DataType, VertexType>;\nusing SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\nusing PersistenceDiagram = aleph::PersistenceDiagram<DataType>;\n\nstd::string formatOutput( const std::string& prefix, unsigned k, unsigned K )\n{\n std::ostringstream stream;\n stream << prefix;\n stream << std::setw( int( std::log10( K ) + 1 ) ) << std::setfill( '0' ) << k;\n stream << \".txt\";\n\n return stream.str();\n}\n\nvoid usage()\n{\n std::cerr << \"Usage: clique-persistence-diagram FILE K\\n\"\n << \"\\n\"\n << \"Calculates the clique persistence diagram for FILE, which is\\n\"\n << \"supposed to be a weighted graph. The K parameter denotes the\\n\"\n << \"maximum dimension of a simplex for extracting a clique graph\\n\"\n << \"and tracking persistence of clique communities.\\n\\n\";\n}\n\nint main( int argc, char** argv )\n{\n if( argc <= 2 )\n {\n usage();\n return -1;\n }\n\n std::string filename = argv[1];\n unsigned maxK = static_cast<unsigned>( std::stoul( argv[2] ) );\n\n SimplicialComplex K;\n\n \/\/ Input -------------------------------------------------------------\n\n std::cerr << \"* Reading '\" << filename << \"'...\";\n\n \/\/ Optional map of node labels. If the graph contains node labels and\n \/\/ I am able to read them, this map will be filled.\n std::map<VertexType, std::string> labels;\n\n if( aleph::utilities::extension( filename ) == \".gml\" )\n {\n aleph::topology::io::GMLReader reader;\n reader( filename, K );\n\n auto labelMap = reader.getNodeAttribute( \"label\" );\n\n \/\/ Note that this assumes that the labels are convertible to\n \/\/ numbers.\n \/\/\n \/\/ TODO: Solve this generically?\n for( auto&& pair : labelMap )\n if( !pair.second.empty() )\n labels[ static_cast<VertexType>( std::stoul( pair.first ) ) ] = pair.second;\n\n if( labels.empty() )\n labels.clear();\n }\n else if( aleph::utilities::extension( filename ) == \".net\" )\n {\n aleph::topology::io::PajekReader reader;\n reader( filename, K );\n\n auto labelMap = reader.getLabelMap();\n\n \/\/ Note that this assumes that the labels are convertible to\n \/\/ numbers.\n \/\/\n \/\/ TODO: Solve this generically?\n for( auto&& pair : labelMap )\n if( !pair.second.empty() )\n labels[ static_cast<VertexType>( std::stoul( pair.first ) ) ] = pair.second;\n\n if( labels.empty() )\n labels.clear();\n\n }\n else\n {\n aleph::io::EdgeListReader reader;\n reader.setReadWeights( true );\n reader.setTrimLines( true );\n\n reader( filename, K );\n }\n\n std::cerr << \"finished\\n\";\n\n DataType maxWeight = std::numeric_limits<DataType>::lowest();\n for( auto&& simplex : K )\n maxWeight = std::max( maxWeight, simplex.data() );\n\n \/\/ TODO: Make weight inversion configurable. It is not required for all data\n \/\/ sets but should be used on an as-needed basis.\n\n std::cerr << \"* Inverting filtration weights...\";\n\n for( auto it = K.begin(); it != K.end(); ++it )\n {\n if( K.dimension() == 0 )\n continue;\n\n auto s = *it;\n s.setData( maxWeight - s.data() );\n\n K.replace( it, s );\n }\n\n std::cerr << \"finished\\n\";\n\n \/\/ Expansion ---------------------------------------------------------\n\n std::cerr << \"* Expanding simplicial complex to k=\" << maxK << \"...\";\n\n aleph::geometry::RipsExpander<SimplicialComplex> ripsExpander;\n K = ripsExpander( K, maxK );\n K = ripsExpander.assignMaximumWeight( K );\n\n std::cerr << \"finished\\n\"\n << \"* Expanded simplicial complex has \" << K.size() << \" simplices\\n\";\n\n K.sort( aleph::filtrations::Data<Simplex>() );\n\n \/\/ Stores the accumulated persistence of vertices. Persistence\n \/\/ accumulates if a vertex participates in a clique community.\n std::map<VertexType, double> accumulatedPersistenceMap;\n\n \/\/ Stores the number of clique communities a vertex is a part of.\n \/\/ I am using this only for debugging the algorithm.\n std::map<VertexType, unsigned> numberOfCliqueCommunities;\n\n std::vector<double> totalPersistenceValues;\n totalPersistenceValues.reserve( maxK );\n\n for( unsigned k = 1; k <= maxK; k++ )\n {\n std::cerr << \"* Extracting \" << k << \"-cliques graph...\";\n\n auto C\n = aleph::topology::getCliqueGraph( K, k );\n\n C.sort( aleph::filtrations::Data<Simplex>() );\n\n std::cerr << \"finished\\n\";\n\n std::cerr << \"* \" << k << \"-cliques graph has \" << C.size() << \" simplices\\n\";\n\n if( C.empty() )\n {\n std::cerr << \"* Stopping here because no further cliques for processing exist\\n\";\n break;\n }\n\n auto&& tuple = aleph::calculateZeroDimensionalPersistenceDiagram( C );\n auto&& pd = std::get<0>( tuple );\n auto&& pp = std::get<1>( tuple );\n\n auto itPoint = pd.begin();\n for( auto itPair = pp.begin(); itPair != pp.end(); ++itPair )\n {\n \/\/ Skip zero-dimensional persistence pairs\n if( itPoint->x() == itPoint->y() )\n {\n ++itPoint;\n continue;\n }\n\n SimplicialComplex filteredComplex;\n\n {\n std::vector<Simplex> simplices;\n if( itPair->second < C.size() )\n {\n simplices.reserve( itPair->second );\n\n std::copy( C.begin() + itPair->first, C.begin() + itPair->second, std::back_inserter( simplices ) );\n filteredComplex = SimplicialComplex( simplices.begin(), simplices.end() );\n }\n else\n filteredComplex = C;\n }\n\n auto uf = calculateConnectedComponents( filteredComplex );\n auto desiredRoot = *C.at( itPair->first ).begin();\n auto root = uf.find( desiredRoot ); \/\/ Normally, this should be a self-assignment,\n \/\/ but in some cases the order of traversal is\n \/\/ slightly different, resulting in unexpected\n \/\/ roots.\n\n std::set<VertexType> cliqueVertices;\n std::vector<VertexType> vertices;\n uf.get( root, std::back_inserter( vertices ) );\n\n for( auto&& vertex : vertices )\n {\n \/\/ Notice that the vertex identifier represents the index\n \/\/ within the filtration of the _original_ complex, hence\n \/\/ I can just access the corresponding simplex that way.\n auto s = K.at( vertex );\n\n cliqueVertices.insert( s.begin(), s.end() );\n }\n\n for( auto&& cliqueVertex : cliqueVertices )\n {\n accumulatedPersistenceMap[cliqueVertex] += std::isfinite( itPoint->persistence() ) ? itPoint->persistence() : maxWeight - itPoint->x();\n numberOfCliqueCommunities[cliqueVertex] += 1;\n }\n\n ++itPoint;\n }\n\n {\n using namespace aleph::utilities;\n auto outputFilename = formatOutput( \"\/tmp\/\" + stem( basename( filename ) ) + \"_k\", k, maxK );\n\n std::cerr << \"* Storing output in '\" << outputFilename << \"'...\\n\";\n\n pd.removeDiagonal();\n\n std::transform( pd.begin(), pd.end(), pd.begin(),\n [&maxWeight] ( const PersistenceDiagram::Point& p )\n {\n if( !std::isfinite( p.y() ) )\n return PersistenceDiagram::Point( p.x(), maxWeight );\n else\n return PersistenceDiagram::Point( p );\n } );\n\n totalPersistenceValues.push_back( aleph::totalPersistence( pd, 1.0 ) );\n\n std::ofstream out( outputFilename );\n out << \"# Original filename: \" << filename << \"\\n\";\n out << \"# k : \" << k << \"\\n\";\n out << pd << \"\\n\";\n }\n }\n\n {\n using namespace aleph::utilities;\n auto outputFilename = \"\/tmp\/\" + stem( basename( filename ) ) + \".txt\";\n\n std::cerr << \"* Storing accumulated persistence values in '\" << outputFilename << \"'...\\n\";\n\n std::ofstream out( outputFilename );\n\n auto normalizationFactor\n = std::accumulate( totalPersistenceValues.begin(), totalPersistenceValues.end(), 0.0 );\n\n for( auto&& pair : accumulatedPersistenceMap )\n out << pair.first << \"\\t\" << pair.second \/ normalizationFactor << \"\\t\" << numberOfCliqueCommunities.at(pair.first) << ( labels.empty() ? \"\" : \"\\t\" + labels.at( pair.first ) ) << \"\\n\";\n }\n}\n<commit_msg>Fiddling with different weights for accumulated vertex persistence<commit_after>#include <algorithm>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <numeric>\n#include <string>\n#include <sstream>\n\n#include <cmath>\n\n#include \"filtrations\/Data.hh\"\n\n#include \"geometry\/RipsExpander.hh\"\n\n#include \"persistenceDiagrams\/Norms.hh\"\n#include \"persistenceDiagrams\/PersistenceDiagram.hh\"\n\n#include \"persistentHomology\/ConnectedComponents.hh\"\n\n#include \"topology\/CliqueGraph.hh\"\n#include \"topology\/ConnectedComponents.hh\"\n#include \"topology\/Simplex.hh\"\n#include \"topology\/SimplicialComplex.hh\"\n\n#include \"topology\/io\/EdgeLists.hh\"\n#include \"topology\/io\/GML.hh\"\n#include \"topology\/io\/Pajek.hh\"\n\n#include \"utilities\/Filesystem.hh\"\n\nusing DataType = double;\nusing VertexType = unsigned;\nusing Simplex = aleph::topology::Simplex<DataType, VertexType>;\nusing SimplicialComplex = aleph::topology::SimplicialComplex<Simplex>;\nusing PersistenceDiagram = aleph::PersistenceDiagram<DataType>;\n\nstd::string formatOutput( const std::string& prefix, unsigned k, unsigned K )\n{\n std::ostringstream stream;\n stream << prefix;\n stream << std::setw( int( std::log10( K ) + 1 ) ) << std::setfill( '0' ) << k;\n stream << \".txt\";\n\n return stream.str();\n}\n\nvoid usage()\n{\n std::cerr << \"Usage: clique-persistence-diagram FILE K\\n\"\n << \"\\n\"\n << \"Calculates the clique persistence diagram for FILE, which is\\n\"\n << \"supposed to be a weighted graph. The K parameter denotes the\\n\"\n << \"maximum dimension of a simplex for extracting a clique graph\\n\"\n << \"and tracking persistence of clique communities.\\n\\n\";\n}\n\nint main( int argc, char** argv )\n{\n if( argc <= 2 )\n {\n usage();\n return -1;\n }\n\n std::string filename = argv[1];\n unsigned maxK = static_cast<unsigned>( std::stoul( argv[2] ) );\n\n SimplicialComplex K;\n\n \/\/ Input -------------------------------------------------------------\n\n std::cerr << \"* Reading '\" << filename << \"'...\";\n\n \/\/ Optional map of node labels. If the graph contains node labels and\n \/\/ I am able to read them, this map will be filled.\n std::map<VertexType, std::string> labels;\n\n if( aleph::utilities::extension( filename ) == \".gml\" )\n {\n aleph::topology::io::GMLReader reader;\n reader( filename, K );\n\n auto labelMap = reader.getNodeAttribute( \"label\" );\n\n \/\/ Note that this assumes that the labels are convertible to\n \/\/ numbers.\n \/\/\n \/\/ TODO: Solve this generically?\n for( auto&& pair : labelMap )\n if( !pair.second.empty() )\n labels[ static_cast<VertexType>( std::stoul( pair.first ) ) ] = pair.second;\n\n if( labels.empty() )\n labels.clear();\n }\n else if( aleph::utilities::extension( filename ) == \".net\" )\n {\n aleph::topology::io::PajekReader reader;\n reader( filename, K );\n\n auto labelMap = reader.getLabelMap();\n\n \/\/ Note that this assumes that the labels are convertible to\n \/\/ numbers.\n \/\/\n \/\/ TODO: Solve this generically?\n for( auto&& pair : labelMap )\n if( !pair.second.empty() )\n labels[ static_cast<VertexType>( std::stoul( pair.first ) ) ] = pair.second;\n\n if( labels.empty() )\n labels.clear();\n\n }\n else\n {\n aleph::io::EdgeListReader reader;\n reader.setReadWeights( true );\n reader.setTrimLines( true );\n\n reader( filename, K );\n }\n\n std::cerr << \"finished\\n\";\n\n DataType maxWeight = std::numeric_limits<DataType>::lowest();\n for( auto&& simplex : K )\n maxWeight = std::max( maxWeight, simplex.data() );\n\n \/\/ TODO: Make weight inversion configurable. It is not required for all data\n \/\/ sets but should be used on an as-needed basis.\n\n std::cerr << \"* Inverting filtration weights...\";\n\n for( auto it = K.begin(); it != K.end(); ++it )\n {\n if( K.dimension() == 0 )\n continue;\n\n auto s = *it;\n s.setData( maxWeight - s.data() );\n\n K.replace( it, s );\n }\n\n std::cerr << \"finished\\n\";\n\n \/\/ Expansion ---------------------------------------------------------\n\n std::cerr << \"* Expanding simplicial complex to k=\" << maxK << \"...\";\n\n aleph::geometry::RipsExpander<SimplicialComplex> ripsExpander;\n K = ripsExpander( K, maxK );\n K = ripsExpander.assignMaximumWeight( K );\n\n std::cerr << \"finished\\n\"\n << \"* Expanded simplicial complex has \" << K.size() << \" simplices\\n\";\n\n K.sort( aleph::filtrations::Data<Simplex>() );\n\n \/\/ Stores the accumulated persistence of vertices. Persistence\n \/\/ accumulates if a vertex participates in a clique community.\n std::map<VertexType, double> accumulatedPersistenceMap;\n\n \/\/ Stores the number of clique communities a vertex is a part of.\n \/\/ I am using this only for debugging the algorithm.\n std::map<VertexType, unsigned> numberOfCliqueCommunities;\n\n std::vector<double> totalPersistenceValues;\n totalPersistenceValues.reserve( maxK );\n\n for( unsigned k = 1; k <= maxK; k++ )\n {\n std::cerr << \"* Extracting \" << k << \"-cliques graph...\";\n\n auto C\n = aleph::topology::getCliqueGraph( K, k );\n\n C.sort( aleph::filtrations::Data<Simplex>() );\n\n std::cerr << \"finished\\n\";\n\n std::cerr << \"* \" << k << \"-cliques graph has \" << C.size() << \" simplices\\n\";\n\n if( C.empty() )\n {\n std::cerr << \"* Stopping here because no further cliques for processing exist\\n\";\n break;\n }\n\n auto&& tuple = aleph::calculateZeroDimensionalPersistenceDiagram( C );\n auto&& pd = std::get<0>( tuple );\n auto&& pp = std::get<1>( tuple );\n\n auto itPoint = pd.begin();\n for( auto itPair = pp.begin(); itPair != pp.end(); ++itPair )\n {\n \/\/ Skip zero-dimensional persistence pairs\n if( itPoint->x() == itPoint->y() )\n {\n ++itPoint;\n continue;\n }\n\n SimplicialComplex filteredComplex;\n\n {\n std::vector<Simplex> simplices;\n if( itPair->second < C.size() )\n {\n simplices.reserve( itPair->second );\n\n std::copy( C.begin() + itPair->first, C.begin() + itPair->second, std::back_inserter( simplices ) );\n filteredComplex = SimplicialComplex( simplices.begin(), simplices.end() );\n }\n else\n filteredComplex = C;\n }\n\n auto uf = calculateConnectedComponents( filteredComplex );\n auto desiredRoot = *C.at( itPair->first ).begin();\n auto root = uf.find( desiredRoot ); \/\/ Normally, this should be a self-assignment,\n \/\/ but in some cases the order of traversal is\n \/\/ slightly different, resulting in unexpected\n \/\/ roots.\n\n std::set<VertexType> cliqueVertices;\n std::vector<VertexType> vertices;\n uf.get( root, std::back_inserter( vertices ) );\n\n for( auto&& vertex : vertices )\n {\n \/\/ Notice that the vertex identifier represents the index\n \/\/ within the filtration of the _original_ complex, hence\n \/\/ I can just access the corresponding simplex that way.\n auto s = K.at( vertex );\n\n cliqueVertices.insert( s.begin(), s.end() );\n }\n\n for( auto&& cliqueVertex : cliqueVertices )\n {\n auto persistence = std::isfinite( itPoint->persistence() ) ? std::pow( itPoint->persistence(), 2 ) : std::pow( 2*maxWeight - itPoint->x(), 2 );\n\n accumulatedPersistenceMap[cliqueVertex] += persistence;\n numberOfCliqueCommunities[cliqueVertex] += 1;\n }\n\n ++itPoint;\n }\n\n {\n using namespace aleph::utilities;\n auto outputFilename = formatOutput( \"\/tmp\/\" + stem( basename( filename ) ) + \"_k\", k, maxK );\n\n std::cerr << \"* Storing output in '\" << outputFilename << \"'...\\n\";\n\n pd.removeDiagonal();\n\n std::transform( pd.begin(), pd.end(), pd.begin(),\n [&maxWeight] ( const PersistenceDiagram::Point& p )\n {\n if( !std::isfinite( p.y() ) )\n return PersistenceDiagram::Point( p.x(), maxWeight );\n else\n return PersistenceDiagram::Point( p );\n } );\n\n totalPersistenceValues.push_back( aleph::totalPersistence( pd, 1.0 ) );\n\n std::ofstream out( outputFilename );\n out << \"# Original filename: \" << filename << \"\\n\";\n out << \"# k : \" << k << \"\\n\";\n out << pd << \"\\n\";\n }\n }\n\n {\n using namespace aleph::utilities;\n auto outputFilename = \"\/tmp\/\" + stem( basename( filename ) ) + \".txt\";\n\n std::cerr << \"* Storing accumulated persistence values in '\" << outputFilename << \"'...\\n\";\n\n std::ofstream out( outputFilename );\n\n auto normalizationFactor\n = std::accumulate( totalPersistenceValues.begin(), totalPersistenceValues.end(), 0.0 );\n\n for( auto&& pair : accumulatedPersistenceMap )\n out << pair.first << \"\\t\" << pair.second \/ normalizationFactor << \"\\t\" << numberOfCliqueCommunities.at(pair.first) << ( labels.empty() ? \"\" : \"\\t\" + labels.at( pair.first ) ) << \"\\n\";\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) Wiesław Šoltés. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n#include \"StdAfx.h\"\n#include \"utilities\\UnicodeUtf8.h\"\n#include \"utilities\\Utf8String.h\"\n#include \"XmlConfigurationBase.h\"\n#include \"XmlConfiguration.h\"\n\nXmlConfiguration::XmlConfiguration()\n{\n\n}\n\nXmlConfiguration::~XmlConfiguration()\n{\n\n}\n\nvoid XmlConfiguration::GetOptions(tinyxml2::XMLElement *pOptionsElem, COptions &m_Options)\n{\n tinyxml2::XMLElement *pOptionElem;\n\n pOptionElem = pOptionsElem->FirstChildElement(\"SelectedLanguage\");\n if (pOptionElem)\n m_Options.szSelectedLanguage = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"SelectedFormat\");\n if (pOptionElem)\n m_Options.nSelectedFormat = ToInt(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"OutputPath\");\n if (pOptionElem)\n m_Options.szOutputPath = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"DeleteSourceFiles\");\n if (pOptionElem)\n m_Options.bDeleteSourceFiles = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"RecurseChecked\");\n if (pOptionElem)\n m_Options.bRecurseChecked = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"ShutdownWhenFinished\");\n if (pOptionElem)\n m_Options.bShutdownWhenFinished = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"DoNotSaveConfiguration\");\n if (pOptionElem)\n m_Options.bDoNotSaveConfiguration = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"DeleteOnErrors\");\n if (pOptionElem)\n m_Options.bDeleteOnErrors = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"StopOnErrors\");\n if (pOptionElem)\n m_Options.bStopOnErrors = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"HideConsoleWindow\");\n if (pOptionElem)\n m_Options.bHideConsoleWindow = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"TryToFindDecoder\");\n if (pOptionElem)\n m_Options.bTryToFindDecoder = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"EnsureItemIsVisible\");\n if (pOptionElem)\n m_Options.bEnsureItemIsVisible = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"ValidateInputFiles\");\n if (pOptionElem)\n m_Options.bValidateInputFiles = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"OverwriteExistingFiles\");\n if (pOptionElem)\n m_Options.bOverwriteExistingFiles = ToBool(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"ThreadCount\");\n if (pOptionElem)\n m_Options.nThreadCount = ToInt(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"MainWindowResize\");\n if (pOptionElem)\n m_Options.szMainWindowResize = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"FileListColumns\");\n if (pOptionElem)\n m_Options.szFileListColumns = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"PresetsDialogResize\");\n if (pOptionElem)\n m_Options.szPresetsDialogResize = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"PresetsListColumns\");\n if (pOptionElem)\n m_Options.szPresetsListColumns = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"FormatsDialogResize\");\n if (pOptionElem)\n m_Options.szFormatsDialogResize = ToCString(pOptionElem->GetText());\n\n pOptionElem = pOptionsElem->FirstChildElement(\"FormatsListColumns\");\n if (pOptionElem)\n m_Options.szFormatsListColumns = ToCString(pOptionElem->GetText());\n}\n\nvoid XmlConfiguration::SetOptions(tinyxml2::XMLElement *pOptionsElem, COptions &m_Options)\n{\n tinyxml2::XMLElement *pOptionElem;\n\n pOptionElem = this->NewElement(\"SelectedLanguage\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szSelectedLanguage).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"SelectedFormat\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.nSelectedFormat)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"OutputPath\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szOutputPath).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"DeleteSourceFiles\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bDeleteSourceFiles)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"RecurseChecked\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bRecurseChecked)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"ShutdownWhenFinished\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bShutdownWhenFinished)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"DoNotSaveConfiguration\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bDoNotSaveConfiguration)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"DeleteOnErrors\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bDeleteOnErrors)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"StopOnErrors\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bStopOnErrors)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"HideConsoleWindow\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bHideConsoleWindow)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"TryToFindDecoder\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bTryToFindDecoder)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"EnsureItemIsVisible\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bEnsureItemIsVisible)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"ValidateInputFiles\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bValidateInputFiles)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"OverwriteExistingFiles\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.bOverwriteExistingFiles)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"ThreadCount\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(ToCString(m_Options.nThreadCount)).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"MainWindowResize\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szMainWindowResize).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"FileListColumns\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szFileListColumns).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"PresetsDialogResize\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szPresetsDialogResize).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"PresetsListColumns\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szPresetsListColumns).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"FormatsDialogResize\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szFormatsDialogResize).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n\n pOptionElem = this->NewElement(\"FormatsListColumns\");\n pOptionElem->LinkEndChild(this->NewText(CUtf8String(m_Options.szFormatsListColumns).m_Result));\n pOptionsElem->LinkEndChild(pOptionElem);\n}\n\nvoid XmlConfiguration::GetPresets(tinyxml2::XMLElement *pPresetsElem, CPresetsList &m_Presets)\n{\n tinyxml2::XMLElement *pPresetElem = pPresetsElem->FirstChildElement(\"Preset\");\n for (pPresetElem; pPresetElem; pPresetElem = pPresetElem->NextSiblingElement())\n {\n const char *pszName = pPresetElem->Attribute(\"name\");\n const char *pszOptions = pPresetElem->Attribute(\"options\");\n if (pszName != NULL && pszOptions != NULL)\n {\n CPreset preset;\n preset.szName = ToCString(pszName);\n preset.szOptions = ToCString(pszOptions);\n m_Presets.Insert(preset);\n }\n }\n}\n\nvoid XmlConfiguration::SetPresets(tinyxml2::XMLElement *pPresetsElem, CPresetsList &m_Presets)\n{\n tinyxml2::XMLElement *pPresetElem;\n\n int nPresets = m_Presets.Count();\n for (int i = 0; i < nPresets; i++)\n {\n CPreset& preset = m_Presets.Get(i);\n pPresetElem = this->NewElement(\"Preset\");\n pPresetElem->SetAttribute(\"name\", CUtf8String(preset.szName).m_Result);\n pPresetElem->SetAttribute(\"options\", CUtf8String(preset.szOptions).m_Result);\n pPresetsElem->LinkEndChild(pPresetElem);\n }\n}\n\nvoid XmlConfiguration::GetFormat(tinyxml2::XMLElement *pFormatElem, CFormat &m_Format)\n{\n const char *pszId = pFormatElem->Attribute(\"id\");\n if (pszId != NULL)\n m_Format.szId = ToCString(pszId);\n\n const char *pszName = pFormatElem->Attribute(\"name\");\n if (pszName != NULL)\n m_Format.szName = ToCString(pszName);\n\n const char *pszTemplate = pFormatElem->Attribute(\"template\");\n if (pszTemplate != NULL)\n m_Format.szTemplate = ToCString(pszTemplate);\n\n const char *pszPipesInput = pFormatElem->Attribute(\"input\");\n if (pszPipesInput != NULL)\n m_Format.bPipeInput = ToBool(pszPipesInput);\n\n const char *pszPipesOutput = pFormatElem->Attribute(\"output\");\n if (pszPipesOutput != NULL)\n m_Format.bPipeOutput = ToBool(pszPipesOutput);\n\n const char *pszFunction = pFormatElem->Attribute(\"function\");\n if (pszFunction != NULL)\n m_Format.szFunction = ToCString(pszFunction);\n\n const char *pszPath = pFormatElem->Attribute(\"path\");\n if (pszPath != NULL)\n m_Format.szPath = ToCString(pszPath);\n\n const char *pszExitCodeSuccess = pFormatElem->Attribute(\"success\");\n if (pszExitCodeSuccess != NULL)\n m_Format.nExitCodeSuccess = ToInt(pszExitCodeSuccess);\n\n const char *pszType = pFormatElem->Attribute(\"type\");\n if (pszType != NULL)\n m_Format.nType = ToInt(pszType);\n\n const char *pszFormats = pFormatElem->Attribute(\"formats\");\n if (pszFormats != NULL)\n m_Format.szInputExtensions = ToCString(pszFormats);\n\n const char *pszExtension = pFormatElem->Attribute(\"extension\");\n if (pszExtension != NULL)\n m_Format.szOutputExtension = ToCString(pszExtension);\n\n const char *pszDefaultPreset = pFormatElem->Attribute(\"default\");\n if (pszDefaultPreset != NULL)\n m_Format.nDefaultPreset = ToInt(pszDefaultPreset);\n\n tinyxml2::XMLElement *pPresetsElem = pFormatElem->FirstChildElement(\"Presets\");\n this->GetPresets(pPresetsElem, m_Format.m_Presets);\n}\n\nvoid XmlConfiguration::SetFormat(tinyxml2::XMLElement *pFormatElem, CFormat &m_Format)\n{\n pFormatElem->SetAttribute(\"id\", CUtf8String(m_Format.szId).m_Result);\n pFormatElem->SetAttribute(\"name\", CUtf8String(m_Format.szName).m_Result);\n pFormatElem->SetAttribute(\"template\", CUtf8String(m_Format.szTemplate).m_Result);\n pFormatElem->SetAttribute(\"input\", CUtf8String(ToCString(m_Format.bPipeInput)).m_Result);\n pFormatElem->SetAttribute(\"output\", CUtf8String(ToCString(m_Format.bPipeOutput)).m_Result);\n pFormatElem->SetAttribute(\"function\", CUtf8String(m_Format.szFunction).m_Result);\n pFormatElem->SetAttribute(\"path\", CUtf8String(m_Format.szPath).m_Result);\n pFormatElem->SetAttribute(\"success\", CUtf8String(ToCString(m_Format.nExitCodeSuccess)).m_Result);\n pFormatElem->SetAttribute(\"type\", CUtf8String(ToCString(m_Format.nType)).m_Result);\n pFormatElem->SetAttribute(\"formats\", CUtf8String(m_Format.szInputExtensions).m_Result);\n pFormatElem->SetAttribute(\"extension\", CUtf8String(m_Format.szOutputExtension).m_Result);\n pFormatElem->SetAttribute(\"default\", CUtf8String(ToCString(m_Format.nDefaultPreset)).m_Result);\n\n tinyxml2::XMLElement *pPresetsElem = this->NewElement(\"Presets\");\n pFormatElem->LinkEndChild(pPresetsElem);\n this->SetPresets(pPresetsElem, m_Format.m_Presets);\n}\n\nvoid XmlConfiguration::GetFormats(tinyxml2::XMLElement *pFormatsElem, CFormatsList &m_Formats)\n{\n tinyxml2::XMLElement *pFormatElem = pFormatsElem->FirstChildElement(\"Format\");\n for (pFormatElem; pFormatElem; pFormatElem = pFormatElem->NextSiblingElement())\n {\n CFormat format;\n this->GetFormat(pFormatElem, format);\n m_Formats.Insert(format);\n }\n}\n\nvoid XmlConfiguration::SetFormats(tinyxml2::XMLElement *pFormatsElem, CFormatsList &m_Formats)\n{\n int nFormats = m_Formats.Count();\n for (int i = 0; i < nFormats; i++)\n {\n CFormat& format = m_Formats.Get(i);\n tinyxml2::XMLElement *pFormatElem = this->NewElement(\"Format\");\n this->SetFormat(pFormatElem, format);\n pFormatsElem->LinkEndChild(pFormatElem);\n }\n}\n\nvoid XmlConfiguration::GetItems(tinyxml2::XMLElement *pItemsElem, CItemsList &m_Items)\n{\n tinyxml2::XMLElement *pItemElem = pItemsElem->FirstChildElement(\"Item\");\n for (pItemElem; pItemElem; pItemElem = pItemElem->NextSiblingElement())\n {\n CItem item;\n\n const char *pszId = pItemElem->Attribute(\"id\");\n if (pszId != NULL)\n item.nId = _tstoi(ToCString(pszId));\n\n const char *pszPath = pItemElem->Attribute(\"path\");\n if (pszPath != NULL)\n item.szPath = ToCString(pszPath);\n\n const char *pszSize = pItemElem->Attribute(\"size\");\n if (pszSize != NULL)\n item.szSize = ToCString(pszSize);\n\n const char *pszName = pItemElem->Attribute(\"name\");\n if (pszName != NULL)\n item.szName = ToCString(pszName);\n\n const char *pszExtension = pItemElem->Attribute(\"extension\");\n if (pszExtension != NULL)\n item.szExtension = ToCString(pszExtension);\n\n const char *pszFormatId = pItemElem->Attribute(\"format\");\n if (pszFormatId != NULL)\n item.szFormatId = ToCString(pszFormatId);\n\n const char *pszPreset = pItemElem->Attribute(\"preset\");\n if (pszPreset != NULL)\n item.nPreset = ToInt(pszPreset);\n\n const char *pszChecked = pItemElem->Attribute(\"checked\");\n if (pszChecked != NULL)\n item.bChecked = ToBool(pszChecked);\n\n const char *pszTime = pItemElem->Attribute(\"time\");\n if (pszTime != NULL)\n item.szTime = ToCString(pszTime);\n\n const char *pszStatus = pItemElem->Attribute(\"status\");\n if (pszStatus != NULL)\n item.szStatus = ToCString(pszStatus);\n\n m_Items.Insert(item);\n }\n}\n\nvoid XmlConfiguration::SetItems(tinyxml2::XMLElement *pItemsElem, CItemsList &m_Items)\n{\n tinyxml2::XMLElement *pItemElem;\n int nItems = m_Items.Count();\n for (int i = 0; i < nItems; i++)\n {\n CItem& item = m_Items.Get(i);\n pItemElem = this->NewElement(\"Item\");\n pItemElem->SetAttribute(\"id\", CUtf8String(ToCString(i)).m_Result);\n pItemElem->SetAttribute(\"path\", CUtf8String(item.szPath).m_Result);\n pItemElem->SetAttribute(\"size\", CUtf8String(item.szSize).m_Result);\n pItemElem->SetAttribute(\"name\", CUtf8String(item.szName).m_Result);\n pItemElem->SetAttribute(\"extension\", CUtf8String(item.szExtension).m_Result);\n pItemElem->SetAttribute(\"format\", CUtf8String(item.szFormatId).m_Result);\n pItemElem->SetAttribute(\"preset\", CUtf8String(ToCString(item.nPreset)).m_Result);\n pItemElem->SetAttribute(\"checked\", CUtf8String(ToCString(item.bChecked)).m_Result);\n pItemElem->SetAttribute(\"time\", CUtf8String(item.szTime).m_Result);\n pItemElem->SetAttribute(\"status\", CUtf8String(item.szStatus).m_Result);\n pItemsElem->LinkEndChild(pItemElem);\n }\n}\n\nvoid XmlConfiguration::GetLanguage(tinyxml2::XMLElement *pLanguageElem, CLanguage &m_Language)\n{\n const char *pszId = pLanguageElem->Attribute(\"id\");\n if (pszId != NULL)\n m_Language.szId = ToCString(pszId);\n\n const char *pszOriginal = pLanguageElem->Attribute(\"original\");\n if (pszOriginal != NULL)\n m_Language.szOriginalName = ToCString(pszOriginal);\n\n const char *pszTranslated = pLanguageElem->Attribute(\"translated\");\n if (pszTranslated != NULL)\n m_Language.szTranslatedName = ToCString(pszTranslated);\n\n tinyxml2::XMLElement *pStringElem = pLanguageElem->FirstChildElement(\"String\");\n for (pStringElem; pStringElem; pStringElem = pStringElem->NextSiblingElement())\n {\n const char *pszKey = pStringElem->Attribute(\"key\");\n const char *pszValue = pStringElem->Attribute(\"value\");\n if (pszKey != NULL && pszValue != NULL)\n {\n int nKey;\n CString szValue;\n _stscanf(ToCString(pszKey), _T(\"%x\"), &nKey);\n szValue = ToCString(pszValue);\n m_Language.m_Strings.Insert(nKey, szValue);\n }\n }\n}\n\nvoid XmlConfiguration::SetLanguage(tinyxml2::XMLElement *pLanguageElem, CLanguage &m_Language)\n{\n pLanguageElem->SetAttribute(\"id\", CUtf8String(m_Language.szId).m_Result);\n pLanguageElem->SetAttribute(\"original\", CUtf8String(m_Language.szOriginalName).m_Result);\n pLanguageElem->SetAttribute(\"translated\", CUtf8String(m_Language.szTranslatedName).m_Result);\n\n tinyxml2::XMLElement *pStringElem;\n POSITION pos = m_Language.m_Strings.m_Map.GetStartPosition();\n while (pos != NULL)\n {\n CString rValue;\n CString szKey;\n int nKey;\n m_Language.m_Strings.m_Map.GetNextAssoc(pos, nKey, rValue);\n szKey.Format(_T(\"%X\"), nKey);\n pStringElem = this->NewElement(\"String\");\n pStringElem->SetAttribute(\"key\", CUtf8String(szKey).m_Result);\n pStringElem->SetAttribute(\"value\", CUtf8String(rValue).m_Result);\n pLanguageElem->LinkEndChild(pStringElem);\n }\n}\n\nvoid XmlConfiguration::GetLanguages(tinyxml2::XMLElement *pLanguagesElem, CLanguagesList &m_Languages)\n{\n tinyxml2::XMLElement *pLanguageElem = pLanguagesElem->FirstChildElement(\"Language\");\n for (pLanguageElem; pLanguageElem; pLanguageElem = pLanguageElem->NextSiblingElement())\n {\n CLanguage language;\n this->GetLanguage(pLanguageElem, language);\n m_Languages.Insert(language);\n }\n}\n\nvoid XmlConfiguration::SetLanguages(tinyxml2::XMLElement *pLanguagesElem, CLanguagesList &m_Languages)\n{\n int nLanguages = m_Languages.Count();\n for (int i = 0; i < nLanguages; i++)\n {\n CLanguage& language = m_Languages.Get(i);\n tinyxml2::XMLElement *pLanguageElem = this->NewElement(\"Language\");\n this->SetLanguage(pLanguageElem, language);\n pLanguagesElem->LinkEndChild(pLanguageElem);\n }\n}\n\nvoid XmlConfiguration::GetOptions(COptions &m_Options)\n{\n tinyxml2::XMLElement *pOptionsElem = this->FirstChildElement(\"Options\");\n if (pOptionsElem != NULL)\n this->GetOptions(pOptionsElem, m_Options);\n}\n\nvoid XmlConfiguration::SetOptions(COptions &m_Options)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pOptionsElem = this->NewElement(\"Options\");\n this->LinkEndChild(pOptionsElem);\n\n this->SetOptions(pOptionsElem, m_Options);\n}\n\nvoid XmlConfiguration::GetPresets(CPresetsList &m_Presets)\n{\n tinyxml2::XMLElement *pPresetsElem = this->FirstChildElement(\"Presets\");\n if (pPresetsElem != NULL)\n this->GetPresets(pPresetsElem, m_Presets);\n}\n\nvoid XmlConfiguration::SetPresets(CPresetsList &m_Presets)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pPresetsElem = this->NewElement(\"Presets\");\n this->LinkEndChild(pPresetsElem);\n\n this->SetPresets(pPresetsElem, m_Presets);\n}\n\nvoid XmlConfiguration::GetFormat(CFormat &m_Format)\n{\n tinyxml2::XMLElement *pFormatElem = this->FirstChildElement(\"Format\");\n if (pFormatElem != NULL)\n this->GetFormat(pFormatElem, m_Format);\n}\n\nvoid XmlConfiguration::SetFormat(CFormat &m_Format)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pFormatElem = this->NewElement(\"Format\");\n this->LinkEndChild(pFormatElem);\n\n this->SetFormat(pFormatElem, m_Format);\n}\n\nvoid XmlConfiguration::GetFormats(CFormatsList &m_Formats)\n{\n tinyxml2::XMLElement *pFormatsElem = this->FirstChildElement(\"Formats\");\n if (pFormatsElem != NULL)\n this->GetFormats(pFormatsElem, m_Formats);\n}\n\nvoid XmlConfiguration::SetFormats(CFormatsList &m_Formats)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pFormatsElem = this->NewElement(\"Formats\");\n this->LinkEndChild(pFormatsElem);\n\n this->SetFormats(pFormatsElem, m_Formats);\n}\n\nvoid XmlConfiguration::GetItems(CItemsList &m_Items)\n{\n tinyxml2::XMLElement *pItemsElem = this->FirstChildElement(\"Items\");\n if (pItemsElem != NULL)\n this->GetItems(pItemsElem, m_Items);\n}\n\nvoid XmlConfiguration::SetItems(CItemsList &m_Items)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pItemsElem = this->NewElement(\"Items\");\n this->LinkEndChild(pItemsElem);\n\n this->SetItems(pItemsElem, m_Items);\n}\n\nvoid XmlConfiguration::GetLanguage(CLanguage &m_Language)\n{\n tinyxml2::XMLElement *pLanguageElem = this->FirstChildElement(\"Language\");\n if (pLanguageElem != NULL)\n this->GetLanguage(pLanguageElem, m_Language);\n}\n\nvoid XmlConfiguration::SetLanguage(CLanguage &m_Language)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pLanguageElem = this->NewElement(\"Language\");\n this->LinkEndChild(pLanguageElem);\n\n this->SetLanguage(pLanguageElem, m_Language);\n}\n\nvoid XmlConfiguration::GetLanguages(CLanguagesList &m_Languages)\n{\n tinyxml2::XMLElement *pLanguagesElem = this->FirstChildElement(\"Languages\");\n if (pLanguagesElem != NULL)\n this->GetLanguages(pLanguagesElem, m_Languages);\n}\n\nvoid XmlConfiguration::SetLanguages(CLanguagesList &m_Languages)\n{\n tinyxml2::XMLDeclaration* decl = this->NewDeclaration(m_Utf8DocumentDeclaration);\n this->LinkEndChild(decl);\n\n tinyxml2::XMLElement *pLanguagesElem = this->NewElement(\"Languages\");\n this->LinkEndChild(pLanguagesElem);\n\n this->SetLanguages(pLanguagesElem, m_Languages);\n}\n<commit_msg>Delete XmlConfiguration.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cstddef>\n#include <queue>\n#include <utility>\n#include <vector>\n\n#include \"aim.hpp\"\n\n\/\/ Algorithm to be tested\n\/\/ Test based on BFS which is not a right idea at all for this kind of problem\n\nusing Location = std::pair<std::size_t, std::size_t>;\n\nbool is_local_min(std::vector<std::vector<int>> const& matrix, std::size_t i, std::size_t j)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n const int& current = matrix[j][i];\n return (i == 0 || current <= matrix[j][i-1])\n && (j == 0 || current <= matrix[j-1][i])\n && (i == W-1 || current <= matrix[j][i+1])\n && (j == H-1 || current <= matrix[j][i+1]);\n}\n\nbool is_better(std::vector<std::vector<int>> const& matrix, std::size_t nx, std::size_t ny, std::size_t x, std::size_t y)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n return (nx < W && ny < H && matrix[y][x] < matrix[ny][nx]);\n}\n\nstd::size_t longest_incr(std::vector<std::vector<int>> const& matrix)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n \n std::size_t remain_at_depth = 0;\n std::size_t next_depth = 0;\n std::size_t longest = 0;\n std::queue<Location> locations;\n \n \/\/ Push initial starting point\n \/\/ It is possible to take every point of the matrix\n \/\/ as starting locations\n \/\/ An optimized approch consist in starting by local minima\n for (std::size_t j {} ; j != H ; ++j)\n {\n for (std::size_t i {} ; i != W ; ++i)\n {\n if (is_local_min(matrix, i, j))\n {\n ++next_depth;\n locations.emplace(i, j);\n }\n }\n }\n \n while (! locations.empty())\n {\n if (! remain_at_depth)\n {\n remain_at_depth = next_depth;\n next_depth = 0;\n ++longest;\n }\n auto x = locations.front().first;\n auto y = locations.front().second;\n locations.pop();\n --remain_at_depth;\n \n \/\/ push possible paths from this point\n if (is_better(matrix, x-1, y, x, y))\n {\n ++next_depth;\n locations.emplace(x-1, y);\n }\n if (is_better(matrix, x+1, y, x, y))\n {\n ++next_depth;\n locations.emplace(x+1, y);\n }\n if (is_better(matrix, x, y-1, x, y))\n {\n ++next_depth;\n locations.emplace(x, y-1);\n }\n if (is_better(matrix, x, y+1, x, y))\n {\n ++next_depth;\n locations.emplace(x, y+1);\n }\n }\n \n return longest;\n}\n\n<commit_msg>[longest-incrpath-matrix] Fix typos<commit_after>#include <cstddef>\n#include <queue>\n#include <utility>\n#include <vector>\n\n#include \"aim.hpp\"\n\n\/\/ Algorithm to be tested\n\/\/ Test based on BFS which is not a right idea at all for this kind of problem\n\nusing Location = std::pair<std::size_t, std::size_t>;\n\nbool is_local_min(std::vector<std::vector<int>> const& matrix, std::size_t i, std::size_t j)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n const int& current = matrix[j][i];\n return (i == 0 || current <= matrix[j][i-1])\n && (j == 0 || current <= matrix[j-1][i])\n && (i == W-1 || current <= matrix[j][i+1])\n && (j == H-1 || current <= matrix[j+1][i]);\n}\n\nbool is_better(std::vector<std::vector<int>> const& matrix, std::size_t nx, std::size_t ny, std::size_t x, std::size_t y)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n return (nx < W && ny < H && matrix[y][x] < matrix[ny][nx]);\n}\n\nstd::size_t longest_incr(std::vector<std::vector<int>> const& matrix)\n{\n const auto H = matrix.size();\n const auto W = matrix[0].size();\n \n std::size_t remain_at_depth = 0;\n std::size_t next_depth = 0;\n std::size_t longest = 0;\n std::queue<Location> locations;\n \n \/\/ Push initial starting point\n \/\/ It is possible to take every point of the matrix\n \/\/ as starting locations\n \/\/ An optimized approch consist in starting by local minima\n for (std::size_t j {} ; j != H ; ++j)\n {\n for (std::size_t i {} ; i != W ; ++i)\n {\n if (is_local_min(matrix, i, j))\n {\n ++next_depth;\n locations.emplace(i, j);\n }\n }\n }\n \n while (! locations.empty())\n {\n if (! remain_at_depth)\n {\n remain_at_depth = next_depth;\n next_depth = 0;\n ++longest;\n }\n auto x = locations.front().first;\n auto y = locations.front().second;\n locations.pop();\n --remain_at_depth;\n \n \/\/ push possible paths from this point\n if (is_better(matrix, x-1, y, x, y))\n {\n ++next_depth;\n locations.emplace(x-1, y);\n }\n if (is_better(matrix, x+1, y, x, y))\n {\n ++next_depth;\n locations.emplace(x+1, y);\n }\n if (is_better(matrix, x, y-1, x, y))\n {\n ++next_depth;\n locations.emplace(x, y-1);\n }\n if (is_better(matrix, x, y+1, x, y))\n {\n ++next_depth;\n locations.emplace(x, y+1);\n }\n }\n \n return longest;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"hash.h\"\n#include <vector>\n\/\/ #include <cout>\n#include <iostream>\n#include <emmintrin.h>\n\nint main(int** args) {\n Hash* hash = new Hash();\n int a[4] = {1, 67, 800, 1212123};\n\n std::vector<uint32_t> foo = {1, 67, 800, 1212123};\n \/\/ __m128i foo_SSE = _mm_setzero_si128();\n __m128i foo_SSE = _mm_load_epi32(a);\n \n __m128i seed_SSE = _mm_set_epi32(1, 1, 1, 1);\n __m128i foo_result_SSE = hash->hash_SSE(foo_SSE, seed_SSE);\n \n for(size_t i = 0; i < 4; ++i) {\n std::cout << \"\\n\\nNumber \" << i << \": \\t\" << foo[i] << std::endl;\n std::cout << \"NumberSSE \" << i << \": \\t\" << foo_SSE[i] << std::endl;\n \n \/\/ std::cout << \"\\n\\nTraditional: \" << hash->hash(foo[i], 1, MAX_VALUE) << std::endl;\n \/\/ std::cout << \"SSE: \" << foo_result_SSE[i] % MAX_VALUE << std::endl;\n }\n \n delete hash;\n}<commit_msg>playing around<commit_after>#include \"hash.h\"\n#include <vector>\n\/\/ #include <cout>\n#include <iostream>\n#include <emmintrin.h>\n\nint main(int** args) {\n Hash* hash = new Hash();\n int a[4] = {1, 67, 800, 1212123};\n\n std::vector<uint32_t> foo = {1, 67, 800, 1212123};\n \/\/ __m128i foo_SSE = _mm_setzero_si128();\n __m128i foo_SSE = _mm_setr_epi32(1, 67, 800, 1212123);\n \n __m128i seed_SSE = _mm_set_epi32(2, 2, 2, 2);\n __m128i foo_result_SSE = hash->hash_SSE(foo_SSE, seed_SSE);\n \/\/ std::cout << \"Size: \" << foo_SSE->size() << std::endl;\n for(size_t i = 0; i < 4; ++i) {\n \/\/ std::cout << \"\\n\\nNumber \" << i << \": \\t\" << foo[i] << std::endl;\n \n std::cout << \"Traditional: \" << hash->hash(foo[i], 2, MAX_VALUE) << std::endl;\n \/\/ std::cout << \"SSE: \" << foo_result_SSE[i] % MAX_VALUE << std::endl;\n }\n std::cout << \"\\n\\nNumberSSE \" << 0 << \": \\t\" << _mm_extract_epi32(foo_result_SSE, 0) << std::endl;\n std::cout << \"NumberSSE \" << 1 << \": \\t\" << _mm_extract_epi32(foo_result_SSE, 1) << std::endl;\n std::cout << \"NumberSSE \" << 2 << \": \\t\" << _mm_extract_epi32(foo_result_SSE, 2) << std::endl;\n std::cout << \"NumberSSE \" << 3 << \": \\t\" << _mm_extract_epi32(foo_result_SSE, 3) << std::endl;\n \n delete hash;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2022 by Apex.AI Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"iceoryx_posh\/popo\/publisher.hpp\"\n\n#include \"iceoryx_hoofs\/cxx\/unique_ptr.hpp\"\n#include \"iceoryx_posh\/internal\/popo\/smart_chunk.hpp\"\n#include \"iceoryx_posh\/popo\/publisher.hpp\"\n#include \"iceoryx_posh\/popo\/request.hpp\"\n#include \"iceoryx_posh\/popo\/response.hpp\"\n#include \"iceoryx_posh\/popo\/sample.hpp\"\n#include \"iceoryx_posh\/testing\/mocks\/chunk_mock.hpp\"\n\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\nusing ::testing::_;\n\nstruct DummyData\n{\n DummyData() = default;\n uint32_t val = 42;\n};\nstruct DummyHeader\n{\n DummyHeader() = default;\n uint64_t counter = 0;\n};\n\ntemplate <template <typename, typename> class BaseType, typename T, typename H = iox::mepoo::NoUserHeader>\nclass MockInterface : public BaseType<T, H>\n{\n public:\n using SampleType = iox::popo::Sample<T, H>;\n\n void publish(iox::popo::Sample<T, H>&& sample) noexcept override\n {\n auto s = std::move(sample); \/\/ this step is necessary since the mock method doesn't execute the move\n return publishMock(std::move(s));\n }\n MOCK_METHOD(void, publishMock, ((iox::popo::Sample<T, H> &&)), (noexcept));\n};\n\ntemplate <typename T, typename H = iox::mepoo::NoUserHeader>\nusing MockPublisherInterface = MockInterface<iox::popo::PublisherInterface, T, H>;\n\ntemplate <typename T>\nclass SmartChunkTest : public Test\n{\n public:\n using DataType = typename T::DataType;\n using HeaderType = typename T::HeaderType;\n template <typename Data, typename Header>\n using SutType = typename T::template SutType<Data, Header>;\n using InterfaceType = typename T::InterfaceType;\n\n template <typename SutType>\n void send(SutType& sut)\n {\n T::send(sut);\n }\n\n template <typename SutType>\n HeaderType& getHeader(SutType& sut)\n {\n return T::getHeader(sut);\n }\n\n template <typename SutType>\n const HeaderType& getConstHeader(const SutType& sut)\n {\n return T::getHeader(sut);\n }\n\n template <typename T1>\n const T1& makeConst(T1& t)\n {\n return const_cast<const T1&>(t);\n }\n\n template <typename T1>\n void verifyNotEmpty(T1& sut)\n {\n ASSERT_TRUE(sut);\n ASSERT_THAT(sut.get(), Ne(nullptr));\n ASSERT_THAT(sut.operator->(), Ne(nullptr));\n ASSERT_THAT(makeConst(sut).get(), Ne(nullptr));\n ASSERT_THAT(makeConst(sut).operator->(), Ne(nullptr));\n ASSERT_THAT(sut.getChunkHeader(), Ne(nullptr));\n ASSERT_THAT(makeConst(sut).getChunkHeader(), Ne(nullptr));\n }\n\n template <typename T1>\n void verifyContent(T1& helper, const uint32_t dataValue, const uint64_t headerValue)\n {\n verifyNotEmpty(helper.sut);\n\n EXPECT_THAT(helper.sut.get()->val, Eq(dataValue));\n EXPECT_THAT(makeConst(helper.sut).get()->val, Eq(dataValue));\n EXPECT_THAT(helper.sut->val, Eq(dataValue));\n EXPECT_THAT(makeConst(helper.sut)->val, Eq(dataValue));\n EXPECT_THAT((*helper.sut).val, Eq(dataValue));\n EXPECT_THAT((*makeConst(helper.sut)).val, Eq(dataValue));\n\n EXPECT_THAT(getHeader(helper.sut).counter, Eq(headerValue));\n EXPECT_THAT(getConstHeader(helper.sut).counter, Eq(headerValue));\n }\n\n template <typename T1>\n void verifyEmpty(T1& helper)\n {\n EXPECT_FALSE(helper.sut);\n EXPECT_THAT(helper.sut.get(), Eq(nullptr));\n EXPECT_THAT(helper.sut.operator->(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).get(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).operator->(), Eq(nullptr));\n EXPECT_THAT(helper.sut.getChunkHeader(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).getChunkHeader(), Eq(nullptr));\n }\n\n template <typename T1>\n void setUnderlyingData(const T1& sut, const uint32_t dataValue, const uint64_t headerValue)\n {\n const_cast<uint32_t&>(sut.chunk.sample()->val) = dataValue;\n const_cast<uint64_t&>(sut.chunk.userHeader()->counter) = headerValue;\n }\n\n protected:\n InterfaceType mockInterface{};\n\n template <typename Data, typename Header>\n struct SutHelper\n {\n SutHelper()\n : sut{iox::cxx::unique_ptr<Data>(this->chunk.sample(), [](Data*) {})}\n {\n }\n\n SutHelper(InterfaceType& interface)\n : sut{iox::cxx::unique_ptr<Data>(this->chunk.sample(), [](Data*) {}), interface}\n {\n }\n\n ChunkMock<Data, Header> chunk;\n SutType<Data, Header> sut;\n };\n\n using ProducerHelper = SutHelper<DataType, HeaderType>;\n using ConsumerHelper = SutHelper<const DataType, const HeaderType>;\n\n ProducerHelper producer{this->mockInterface};\n ConsumerHelper consumer;\n};\n\nstruct SampleTestCase\n{\n using DataType = DummyData;\n using HeaderType = DummyHeader;\n using InterfaceType = MockInterface<iox::popo::PublisherInterface, DummyData, HeaderType>;\n\n template <typename Data, typename Header>\n using SutType = iox::popo::Sample<Data, Header>;\n\n template <typename SutType>\n static void send(SutType& sut)\n {\n sut.publish();\n }\n\n template <typename SutType>\n static HeaderType& getHeader(SutType& sut)\n {\n return sut.getUserHeader();\n }\n\n template <typename SutType>\n static const HeaderType& getHeader(const SutType& sut)\n {\n return sut.getUserHeader();\n }\n};\n\n\nusing Implementations = Types<SampleTestCase>;\n\nTYPED_TEST_SUITE(SmartChunkTest, Implementations);\n\nTYPED_TEST(SmartChunkTest, ProducerConstructedSmartChunkIsValid)\n{\n this->setUnderlyingData(this->producer, 123, 456);\n\n this->verifyContent(this->producer, 123, 456);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerConstructedSmartChunkIsValid)\n{\n this->setUnderlyingData(this->consumer, 789, 1337);\n\n this->verifyNotEmpty(this->consumer.sut);\n}\n\n#if 0\nTYPED_TEST(SmartChunkTest, ProducerSmartChunkIsInvalidatedAfterMoveConstruction)\n{\n this->producer.sut->val = 1337;\n this->getHeader(this->producer.sut).counter = 73;\n\n auto moved{std::move(this->producer.sut)};\n\n verifyContent(moved, 1337, 73);\n\n verifyEmpty(this->producer.sut);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerSmartChunkIsInvalidatedAfterMoveConstruction)\n{\n auto moved{std::move(this->consumer.sut)};\n\n verifyNotEmpty(moved);\n\n verifyEmpty(this->consumer.sut);\n}\n\nTYPED_TEST(SmartChunkTest, ProducerSmartChunkIsInvalidatedAfterMoveAssignment)\n{\n typename TestFixture::ProducerHelper destination(this->mockInterface);\n this->producer.sut->val = 81921;\n this->getHeader(this->producer.sut).counter = 55551;\n\n destination.sut = std::move(this->producer.sut);\n\n EXPECT_TRUE(destination.sut);\n ASSERT_THAT(destination.sut.get(), Ne(nullptr));\n EXPECT_THAT(destination.sut.get()->val, Eq(81921));\n EXPECT_THAT(this->getHeader(destination.sut).counter, Eq(55551));\n\n verifyEmpty(this->producer.sut);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerSmartChunkIsInvalidatedAfterMoveAssignment)\n{\n typename TestFixture::ConsumerHelper destination;\n destination.sut = std::move(this->consumer.sut);\n\n EXPECT_TRUE(destination.sut);\n\n verifyEmpty(this->consumer.sut);\n}\n\nTYPED_TEST(SmartChunkTest, PublishesSmartChunkViaPublisherInterfaceWorks)\n{\n ::testing::Test::RecordProperty(\"TEST_ID\", \"0b13578c-d654-4802-80a4-f45e5fd73268\");\n\n this->sut.emplace(std::move(this->smartChunkPtr), this->mockInterface);\n\n EXPECT_CALL(this->mockInterface, publishMock).Times(1);\n\n this->send();\n}\n\n\nTYPED_TEST(SmartChunkTest, PublishingEmptySmartChunkCallsErrorHandler)\n{\n ::testing::Test::RecordProperty(\"TEST_ID\", \"b49bdcb3-6f8a-42c1-bb6c-a745f1a49b0e\");\n this->sut.emplace(std::move(this->smartChunkPtr), this->mockInterface);\n\n EXPECT_CALL(this->mockInterface, publishMock).Times(1);\n this->send();\n\n iox::cxx::optional<iox::Error> detectedError;\n auto errorHandlerGuard = iox::ErrorHandler::setTemporaryErrorHandler(\n [&detectedError](const iox::Error error, const std::function<void()>&, const iox::ErrorLevel errorLevel) {\n detectedError.emplace(error);\n EXPECT_THAT(errorLevel, Eq(iox::ErrorLevel::MODERATE));\n });\n this->send();\n\n ASSERT_TRUE(detectedError.has_value());\n ASSERT_THAT(detectedError.value(), Eq(iox::Error::kPOSH__PUBLISHING_EMPTY_SAMPLE));\n}\n\nTYPED_TEST(SmartChunkTest, CallingGetUserHeaderFromNonConstTypeReturnsCorrectAddress)\n{\n ::testing::Test::RecordProperty(\"TEST_ID\", \"d26dd24c-0c84-4c3d-96ab-bf51e52c9e9f\");\n this->sut.emplace(std::move(this->smartChunkPtr), this->mockInterface);\n\n auto& header = this->getHeader();\n\n ASSERT_EQ(&header, this->chunk.userHeader());\n}\n\nTYPED_TEST(SmartChunkTest, CallingGetUserHeaderFromConstTypeReturnsCorrectAddress)\n{\n ::testing::Test::RecordProperty(\"TEST_ID\", \"fb6b6706-7a15-4ae2-a77a-d4b21431ca57\");\n\n this->sut.emplace(std::move(this->smartChunkPtr), this->mockInterface);\n\n const auto& header = this->getConstHeader();\n\n ASSERT_EQ(&header, this->chunk.userHeader());\n}\n#endif\n} \/\/ namespace\n<commit_msg>iox-#27 Finalize smart chunk tests<commit_after>\/\/ Copyright (c) 2022 by Apex.AI Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"iceoryx_posh\/popo\/publisher.hpp\"\n\n#include \"iceoryx_hoofs\/cxx\/unique_ptr.hpp\"\n#include \"iceoryx_posh\/internal\/popo\/smart_chunk.hpp\"\n#include \"iceoryx_posh\/popo\/publisher.hpp\"\n#include \"iceoryx_posh\/popo\/request.hpp\"\n#include \"iceoryx_posh\/popo\/response.hpp\"\n#include \"iceoryx_posh\/popo\/sample.hpp\"\n#include \"iceoryx_posh\/testing\/mocks\/chunk_mock.hpp\"\n\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\nusing ::testing::_;\n\nstruct DummyData\n{\n DummyData() = default;\n uint32_t val = 42;\n};\nstruct DummyHeader\n{\n DummyHeader() = default;\n uint64_t counter = 0;\n};\n\ntemplate <template <typename, typename> class BaseType, typename T, typename H = iox::mepoo::NoUserHeader>\nclass MockInterface : public BaseType<T, H>\n{\n public:\n using SampleType = iox::popo::Sample<T, H>;\n\n void publish(iox::popo::Sample<T, H>&& sample) noexcept override\n {\n auto s = std::move(sample); \/\/ this step is necessary since the mock method doesn't execute the move\n return publishMock(std::move(s));\n }\n MOCK_METHOD(void, publishMock, ((iox::popo::Sample<T, H> &&)), (noexcept));\n};\n\ntemplate <typename T>\nclass SmartChunkTest : public Test\n{\n public:\n using DataType = typename T::DataType;\n using HeaderType = typename T::HeaderType;\n template <typename Data, typename Header>\n using SutType = typename T::template SutType<Data, Header>;\n using InterfaceType = typename T::InterfaceType;\n\n template <typename SutType>\n void send(SutType& sut)\n {\n T::send(sut);\n }\n\n template <typename SutType>\n auto& getHeader(SutType& sut)\n {\n return T::getHeader(sut);\n }\n\n template <typename SutType>\n auto& getConstHeader(const SutType& sut)\n {\n return T::getHeader(sut);\n }\n\n template <typename T1>\n const T1& makeConst(T1& t)\n {\n return const_cast<const T1&>(t);\n }\n\n template <typename T1>\n void verifyNotEmpty(T1& helper)\n {\n ASSERT_TRUE(helper.sut);\n ASSERT_THAT(helper.sut.get(), Ne(nullptr));\n ASSERT_THAT(helper.sut.operator->(), Ne(nullptr));\n ASSERT_THAT(makeConst(helper.sut).get(), Ne(nullptr));\n ASSERT_THAT(makeConst(helper.sut).operator->(), Ne(nullptr));\n ASSERT_THAT(helper.sut.getChunkHeader(), Ne(nullptr));\n ASSERT_THAT(makeConst(helper.sut).getChunkHeader(), Ne(nullptr));\n }\n\n template <typename T1>\n void verifyContent(T1& helper, const uint32_t dataValue, const uint64_t headerValue)\n {\n verifyNotEmpty(helper);\n\n EXPECT_THAT(helper.sut.get()->val, Eq(dataValue));\n EXPECT_THAT(makeConst(helper.sut).get()->val, Eq(dataValue));\n EXPECT_THAT(helper.sut->val, Eq(dataValue));\n EXPECT_THAT(makeConst(helper.sut)->val, Eq(dataValue));\n EXPECT_THAT((*helper.sut).val, Eq(dataValue));\n EXPECT_THAT((*makeConst(helper.sut)).val, Eq(dataValue));\n\n EXPECT_THAT(getHeader(helper.sut).counter, Eq(headerValue));\n EXPECT_THAT(getConstHeader(helper.sut).counter, Eq(headerValue));\n }\n\n template <typename T1>\n void verifyEmpty(T1& helper)\n {\n EXPECT_FALSE(helper.sut);\n EXPECT_THAT(helper.sut.get(), Eq(nullptr));\n EXPECT_THAT(helper.sut.operator->(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).get(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).operator->(), Eq(nullptr));\n EXPECT_THAT(helper.sut.getChunkHeader(), Eq(nullptr));\n EXPECT_THAT(makeConst(helper.sut).getChunkHeader(), Eq(nullptr));\n }\n\n template <typename T1>\n void setUnderlyingData(const T1& sut, const uint32_t dataValue, const uint64_t headerValue)\n {\n const_cast<uint32_t&>(sut.chunk.sample()->val) = dataValue;\n const_cast<uint64_t&>(sut.chunk.userHeader()->counter) = headerValue;\n }\n\n protected:\n InterfaceType mockInterface{};\n\n template <typename Data, typename Header>\n struct SutHelper\n {\n SutHelper()\n : sut{iox::cxx::unique_ptr<Data>(this->chunk.sample(), [](Data*) {})}\n {\n }\n\n SutHelper(InterfaceType& interface)\n : sut{iox::cxx::unique_ptr<Data>(this->chunk.sample(), [](Data*) {}), interface}\n {\n }\n\n SutHelper(SutType<Data, Header>&& origin)\n : sut{std::move(origin)}\n {\n }\n\n ChunkMock<Data, Header> chunk;\n SutType<Data, Header> sut;\n };\n\n using ProducerHelper = SutHelper<DataType, HeaderType>;\n using ConsumerHelper = SutHelper<const DataType, const HeaderType>;\n\n ProducerHelper producer{this->mockInterface};\n ConsumerHelper consumer;\n};\n\nstruct SampleTestCase\n{\n using DataType = DummyData;\n using HeaderType = DummyHeader;\n using InterfaceType = MockInterface<iox::popo::PublisherInterface, DataType, HeaderType>;\n\n template <typename Data, typename Header>\n using SutType = iox::popo::Sample<Data, Header>;\n\n template <typename SutType>\n static void send(SutType& sut)\n {\n sut.publish();\n }\n\n template <typename SutType>\n static auto& getHeader(SutType& sut)\n {\n return sut.getUserHeader();\n }\n\n template <typename SutType>\n static auto& getHeader(const SutType& sut)\n {\n return sut.getUserHeader();\n }\n};\n\n\nusing Implementations = Types<SampleTestCase>;\n\nTYPED_TEST_SUITE(SmartChunkTest, Implementations);\n\nTYPED_TEST(SmartChunkTest, ProducerConstructedSmartChunkIsValid)\n{\n constexpr uint32_t DATA_VALUE = 123;\n constexpr uint64_t HEADER_VALUE = 456;\n\n this->setUnderlyingData(this->producer, DATA_VALUE, HEADER_VALUE);\n this->verifyContent(this->producer, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerConstructedSmartChunkIsValid)\n{\n constexpr uint32_t DATA_VALUE = 789;\n constexpr uint64_t HEADER_VALUE = 1337;\n\n this->setUnderlyingData(this->consumer, DATA_VALUE, HEADER_VALUE);\n this->verifyContent(this->consumer, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, ProducerSmartChunkIsInvalidatedAfterMoveConstruction)\n{\n constexpr uint32_t DATA_VALUE = 12301;\n constexpr uint64_t HEADER_VALUE = 9817238;\n\n this->setUnderlyingData(this->producer, DATA_VALUE, HEADER_VALUE);\n\n typename TestFixture::ProducerHelper destination(std::move(this->producer.sut));\n\n this->verifyEmpty(this->producer);\n this->verifyContent(destination, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerSmartChunkIsInvalidatedAfterMoveConstruction)\n{\n constexpr uint32_t DATA_VALUE = 88121;\n constexpr uint64_t HEADER_VALUE = 55123;\n\n this->setUnderlyingData(this->consumer, DATA_VALUE, HEADER_VALUE);\n\n typename TestFixture::ConsumerHelper destination(std::move(this->consumer.sut));\n\n this->verifyEmpty(this->consumer);\n this->verifyContent(destination, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, ProducerSmartChunkIsInvalidatedAfterMoveAssignment)\n{\n constexpr uint32_t DATA_VALUE = 8812165;\n constexpr uint64_t HEADER_VALUE = 55123123;\n\n this->setUnderlyingData(this->producer, DATA_VALUE, HEADER_VALUE);\n\n typename TestFixture::ProducerHelper destination(this->mockInterface);\n\n destination.sut = std::move(this->producer.sut);\n\n this->verifyEmpty(this->producer);\n this->verifyContent(destination, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, ConsumerSmartChunkIsInvalidatedAfterMoveAssignment)\n{\n constexpr uint32_t DATA_VALUE = 8165;\n constexpr uint64_t HEADER_VALUE = 1123;\n\n this->setUnderlyingData(this->consumer, DATA_VALUE, HEADER_VALUE);\n\n typename TestFixture::ConsumerHelper destination;\n\n destination.sut = std::move(this->consumer.sut);\n\n this->verifyEmpty(this->consumer);\n this->verifyContent(destination, DATA_VALUE, HEADER_VALUE);\n}\n\nTYPED_TEST(SmartChunkTest, SendingSmartChunkSucceeds)\n{\n EXPECT_CALL(this->mockInterface, publishMock).Times(1);\n\n this->send(this->producer.sut);\n this->verifyEmpty(this->producer);\n}\n\nTYPED_TEST(SmartChunkTest, SendingSmartChunkMultipleTimesFails)\n{\n EXPECT_CALL(this->mockInterface, publishMock).Times(1);\n\n this->send(this->producer.sut);\n\n iox::cxx::optional<iox::Error> detectedError;\n auto errorHandlerGuard = iox::ErrorHandler::setTemporaryErrorHandler(\n [&detectedError](const iox::Error error, const std::function<void()>&, const iox::ErrorLevel errorLevel) {\n detectedError.emplace(error);\n EXPECT_THAT(errorLevel, Eq(iox::ErrorLevel::MODERATE));\n });\n this->send(this->producer.sut);\n\n ASSERT_TRUE(detectedError.has_value());\n ASSERT_THAT(detectedError.value(), Eq(iox::Error::kPOSH__PUBLISHING_EMPTY_SAMPLE));\n}\n\nTYPED_TEST(SmartChunkTest, SendingMovedSmartChunkFails)\n{\n typename TestFixture::ProducerHelper destination(this->mockInterface);\n\n destination.sut = std::move(this->producer.sut);\n\n iox::cxx::optional<iox::Error> detectedError;\n auto errorHandlerGuard = iox::ErrorHandler::setTemporaryErrorHandler(\n [&detectedError](const iox::Error error, const std::function<void()>&, const iox::ErrorLevel errorLevel) {\n detectedError.emplace(error);\n EXPECT_THAT(errorLevel, Eq(iox::ErrorLevel::MODERATE));\n });\n this->send(this->producer.sut);\n\n ASSERT_TRUE(detectedError.has_value());\n ASSERT_THAT(detectedError.value(), Eq(iox::Error::kPOSH__PUBLISHING_EMPTY_SAMPLE));\n}\n\nTYPED_TEST(SmartChunkTest, SendingDestinationOfValidMoveOriginSucceeds)\n{\n typename TestFixture::ProducerHelper destination(this->mockInterface);\n\n destination.sut = std::move(this->producer.sut);\n\n EXPECT_CALL(this->mockInterface, publishMock).Times(1);\n this->send(destination.sut);\n}\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n#include <envire_maps\/GridBase.hpp>\n\n#include <chrono>\n\nusing namespace envire::maps;\n\nBOOST_AUTO_TEST_CASE(test_grid_index)\n{\n GridBase::Index index;\n BOOST_CHECK_EQUAL(index.x, 0);\n BOOST_CHECK_EQUAL(index.y, 0);\n\n GridBase::Index index2(2, 4);\n BOOST_CHECK_EQUAL(index2.x, 2);\n BOOST_CHECK_EQUAL(index2.y, 4); \n\n BOOST_CHECK_EQUAL((index2 < GridBase::Index(3, 5)), true); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 5)), true); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 4)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 3)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(1, 5)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(1, 3)), false); \n\n BOOST_CHECK_EQUAL((index2 == GridBase::Index(2, 4)), true);\n BOOST_CHECK_EQUAL((index2 == GridBase::Index(3, 4)), false); \n BOOST_CHECK_EQUAL((index2 == GridBase::Index(2, 5)), false); \n BOOST_CHECK_EQUAL((index2 == GridBase::Index(3, 5)), false); \n\n BOOST_CHECK_EQUAL((index2 != GridBase::Index(2, 4)), false);\n BOOST_CHECK_EQUAL((index2 != GridBase::Index(3, 4)), true); \n BOOST_CHECK_EQUAL((index2 != GridBase::Index(2, 5)), true); \n BOOST_CHECK_EQUAL((index2 != GridBase::Index(3, 5)), true); \n\n BOOST_CHECK((index2 + GridBase::Index(3, 5)) == GridBase::Index(5, 9)); \n\n \/\/ TODO: check otherwise => it will not be 3,5\n BOOST_CHECK((GridBase::Index(5, 9) - index2) == GridBase::Index(3, 5)); \n}\n\n\nBOOST_AUTO_TEST_CASE(test_gridbase)\n{\n \/\/ the grid 100 x 200 (10m x 100m)\n size_t cellSizeX = 100;\n size_t cellSizeY = 200;\n\n \/\/ cell size 0.1m x 0.5m\n double scaleX = 0.1;\n double scaleY = 0.5;\n\n \/\/ the grid center is -5m x -50m\n double offsetX = -5;\n double offsetY = -50;\n\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n\n GridBase grid_base(config);\n\n BOOST_CHECK_EQUAL(grid_base.getCellSizeX(), cellSizeX);\n BOOST_CHECK_EQUAL(grid_base.getCellSizeY(), cellSizeY);\n BOOST_CHECK_EQUAL(grid_base.getScaleX(), scaleX);\n BOOST_CHECK_EQUAL(grid_base.getScaleY(), scaleY);\n BOOST_CHECK_EQUAL(grid_base.getOffsetX(), offsetX);\n BOOST_CHECK_EQUAL(grid_base.getOffsetY(), offsetY); \n BOOST_CHECK_EQUAL(grid_base.getSizeX(), 10);\n BOOST_CHECK_EQUAL(grid_base.getSizeY(), 100);\n\n \/\/ ---- Index 2 Position ---- \n\n Eigen::Vector2d pos;\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(0, 0), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), -4.95, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), -49.75, 0.0001); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(99, 199), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), 4.95, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 49.75, 0.0001); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(50, 100), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 0.25, 0.0001);\n\n \/\/ outside\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(100, 200), pos), false); \n\n\n \/\/ ---- Position 2 Index ---- \n\n GridBase::Index idx;\n Eigen::Vector2d pos_diff;\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(-4.95, -49.75), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 0);\n BOOST_CHECK_EQUAL(idx.y, 0);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.25, 0.0001);\n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(4.95, 49.75), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 99);\n BOOST_CHECK_EQUAL(idx.y, 199);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.25, 0.0001); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(0, 0), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.0, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.0, 0.0001); \n\n \/\/ outside\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(5, 50), idx, pos_diff), false);\n}\n\n<commit_msg>unit test for GridBase<commit_after>#include <boost\/test\/unit_test.hpp>\n#include <envire_maps\/GridBase.hpp>\n\n#include <chrono>\n\nusing namespace envire::maps;\n\nBOOST_AUTO_TEST_CASE(test_grid_index)\n{\n GridBase::Index index;\n BOOST_CHECK_EQUAL(index.x, 0);\n BOOST_CHECK_EQUAL(index.y, 0);\n\n GridBase::Index index2(2, 4);\n BOOST_CHECK_EQUAL(index2.x, 2);\n BOOST_CHECK_EQUAL(index2.y, 4); \n\n BOOST_CHECK_EQUAL((index2 < GridBase::Index(3, 5)), true); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 5)), true); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 4)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(2, 3)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(1, 5)), false); \n BOOST_CHECK_EQUAL((index2 < GridBase::Index(1, 3)), false); \n\n BOOST_CHECK_EQUAL((index2 == GridBase::Index(2, 4)), true);\n BOOST_CHECK_EQUAL((index2 == GridBase::Index(3, 4)), false); \n BOOST_CHECK_EQUAL((index2 == GridBase::Index(2, 5)), false); \n BOOST_CHECK_EQUAL((index2 == GridBase::Index(3, 5)), false); \n\n BOOST_CHECK_EQUAL((index2 != GridBase::Index(2, 4)), false);\n BOOST_CHECK_EQUAL((index2 != GridBase::Index(3, 4)), true); \n BOOST_CHECK_EQUAL((index2 != GridBase::Index(2, 5)), true); \n BOOST_CHECK_EQUAL((index2 != GridBase::Index(3, 5)), true); \n\n BOOST_CHECK((index2 + GridBase::Index(3, 5)) == GridBase::Index(5, 9)); \n\n \/\/ TODO: check otherwise => it will not be 3,5\n BOOST_CHECK((GridBase::Index(5, 9) - index2) == GridBase::Index(3, 5)); \n}\n\n\/\/ the grid 100 x 200 (10m x 100m)\nsize_t cellSizeX = 100;\nsize_t cellSizeY = 200;\n\n\/\/ cell size 0.1m x 0.5m\ndouble scaleX = 0.1;\ndouble scaleY = 0.5;\n\n\/\/ the grid center is -5m x -50m\ndouble offsetX = -5;\ndouble offsetY = -50;\n\nBOOST_AUTO_TEST_CASE(test_gridbase_constructor)\n{\n GridBase grid_base_empty;\n BOOST_CHECK_EQUAL(grid_base_empty.getCellSizeX(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getCellSizeY(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getScaleX(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getScaleY(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getOffsetX(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getOffsetY(), 0); \n BOOST_CHECK_EQUAL(grid_base_empty.getSizeX(), 0);\n BOOST_CHECK_EQUAL(grid_base_empty.getSizeY(), 0); \n\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config);\n\n BOOST_CHECK_EQUAL(grid_base.getCellSizeX(), cellSizeX);\n BOOST_CHECK_EQUAL(grid_base.getCellSizeY(), cellSizeY);\n BOOST_CHECK_EQUAL(grid_base.getScaleX(), scaleX);\n BOOST_CHECK_EQUAL(grid_base.getScaleY(), scaleY);\n BOOST_CHECK_EQUAL(grid_base.getOffsetX(), offsetX);\n BOOST_CHECK_EQUAL(grid_base.getOffsetY(), offsetY); \n BOOST_CHECK_EQUAL(grid_base.getSizeX(), 10);\n BOOST_CHECK_EQUAL(grid_base.getSizeY(), 100);\n\n const GridConfig &config_t = grid_base.getGridConfig();\n BOOST_CHECK_EQUAL(config.cellSizeX, config_t.cellSizeX);\n BOOST_CHECK_EQUAL(config.cellSizeY, config_t.cellSizeY);\n BOOST_CHECK_EQUAL(config.scaleX, config_t.scaleX);\n BOOST_CHECK_EQUAL(config.scaleY, config_t.scaleY);\n BOOST_CHECK_EQUAL(config.offsetX, config_t.offsetX);\n BOOST_CHECK_EQUAL(config.offsetY, config_t.offsetY); \n}\n\nBOOST_AUTO_TEST_CASE(test_gridbase_in_grid)\n{\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config); \n\n \/\/ ---- Index In Grid ---- \n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.inGrid(GridBase::Index(0, 0)), true); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.inGrid(GridBase::Index(99, 199)), true); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.inGrid(GridBase::Index(50, 100)), true); \n\n \/\/ outside\n BOOST_CHECK_EQUAL(grid_base.inGrid(GridBase::Index(100, 200)), false); \n}\n\nBOOST_AUTO_TEST_CASE(test_gridbase_index2pos)\n{\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config); \n\n \/\/ ---- Index 2 Position ---- \n\n Eigen::Vector2d pos;\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(0, 0), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), -4.95, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), -49.75, 0.0001); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(99, 199), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), 4.95, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 49.75, 0.0001); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(50, 100), pos), true);\n BOOST_CHECK_CLOSE(pos.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 0.25, 0.0001);\n\n \/\/ outside: pos should be unchanged\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(100, 200), pos), false); \n BOOST_CHECK_CLOSE(pos.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 0.25, 0.0001); \n}\n\nBOOST_AUTO_TEST_CASE(test_gridbase_index2pos_in_frame)\n{\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config); \n\n \/\/ ---- Index 2 Position ---- \n\n Eigen::Vector3d pos;\n\n Eigen::Affine3d frame_in_grid(Eigen::Translation3d( 0.5, 1.7, -0.5 ));\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(0, 0), pos, frame_in_grid), true);\n BOOST_CHECK_CLOSE(pos.x(), -5.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), -51.45, 0.0001); \n BOOST_CHECK_CLOSE(pos.z(), 0.5, 0.0001); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(99, 199), pos, frame_in_grid), true);\n BOOST_CHECK_CLOSE(pos.x(), 4.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), 48.05, 0.0001); \n BOOST_CHECK_CLOSE(pos.z(), 0.5, 0.0001); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(50, 100), pos, frame_in_grid), true);\n BOOST_CHECK_CLOSE(pos.x(), -0.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), -1.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.z(), 0.5, 0.0001); \n\n \/\/ outside: pos should be unchanged\n BOOST_CHECK_EQUAL(grid_base.fromGrid(GridBase::Index(100, 200), pos, frame_in_grid), false); \n BOOST_CHECK_CLOSE(pos.x(), -0.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.y(), -1.45, 0.0001);\n BOOST_CHECK_CLOSE(pos.z(), 0.5, 0.0001); \n}\n\nBOOST_AUTO_TEST_CASE(test_gridbase_pos2index)\n{\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config); \n\n \/\/ ---- Position 2 Index ---- \n\n GridBase::Index idx;\n Eigen::Vector2d pos_diff;\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(-4.95, -49.75), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 0);\n BOOST_CHECK_EQUAL(idx.y, 0);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.25, 0.0001);\n\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(-4.95, -49.75), idx), true);\n BOOST_CHECK_EQUAL(idx.x, 0);\n BOOST_CHECK_EQUAL(idx.y, 0); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(4.95, 49.75), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 99);\n BOOST_CHECK_EQUAL(idx.y, 199);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.05, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.25, 0.0001); \n\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(4.95, 49.75), idx), true);\n BOOST_CHECK_EQUAL(idx.x, 99);\n BOOST_CHECK_EQUAL(idx.y, 199); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(0, 0), idx, pos_diff), true);\n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100);\n BOOST_CHECK_CLOSE(pos_diff.x(), 0.0, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.0, 0.0001); \n\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(0, 0), idx), true);\n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100); \n\n \/\/ outside: the index and pos_diff should be unchanged\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(5, 50), idx, pos_diff), false);\n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100); \n BOOST_CHECK_CLOSE(pos_diff.x(), 0.0, 0.0001);\n BOOST_CHECK_CLOSE(pos_diff.y(), 0.0, 0.0001); \n\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector2d(5, 50), idx), false); \n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100); \n}\n\nBOOST_AUTO_TEST_CASE(test_gridbase_pos2index_in_frame)\n{\n GridConfig config(cellSizeX, cellSizeY, scaleX, scaleY, offsetX, offsetY); \n GridBase grid_base(config); \n\n \/\/ ---- Position 2 Index ---- \n\n GridBase::Index idx;\n Eigen::Vector2d pos_diff;\n\n \/\/ 30, 45, -30\n \/\/Eigen::Quaterniond orientation(0.8876262680160252, -0.13529902503654923, -0.3266407412190941, 0.2951603095403302);\n \/\/Eigen::Translation3d translation(0.5, 1.7, -0.5);\n \/\/Eigen::Affine3d frame_in_grid(translation * orientation); \n\n Eigen::Affine3d frame_in_grid(Eigen::Translation3d( 0.5, 1.7, -0.5 ));\n\n \/\/ bottom right\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector3d(-5.45, -51.45, 0.5), idx, frame_in_grid), true);\n BOOST_CHECK_EQUAL(idx.x, 0);\n BOOST_CHECK_EQUAL(idx.y, 0); \n\n \/\/ top left\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector3d(4.45, 48.05, 0.5), idx, frame_in_grid), true);\n BOOST_CHECK_EQUAL(idx.x, 99);\n BOOST_CHECK_EQUAL(idx.y, 199); \n\n \/\/ middle\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector3d(-0.45, -1.45, 0.5), idx, frame_in_grid), true);\n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100); \n\n \/\/ outside: the index should be unchanged\n BOOST_CHECK_EQUAL(grid_base.toGrid(Eigen::Vector3d(20, 150, 0.5), idx, frame_in_grid), false); \n BOOST_CHECK_EQUAL(idx.x, 50);\n BOOST_CHECK_EQUAL(idx.y, 100); \n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/Copyright (c) 2022 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include <limits>\n#include <queue> \/\/Priority queue to prioritise removing unimportant vertices.\n\n#include \"Simplify.h\"\n\nnamespace cura\n{\n\nSimplify::Simplify(const coord_t max_resolution, const coord_t max_deviation, const coord_t max_area_deviation)\n : max_resolution(max_resolution)\n , max_deviation(max_deviation)\n , max_area_deviation(max_area_deviation)\n{}\n\nSimplify::Simplify(const Settings& settings)\n : max_resolution(settings.get<coord_t>(\"meshfix_maximum_resolution\"))\n , max_deviation(settings.get<coord_t>(\"meshfix_maximum_deviation\"))\n , max_area_deviation(settings.get<coord_t>(\"meshfix_maximum_area_deviation\"))\n{}\n\nPolygons Simplify::polygon(const Polygons& polygons)\n{\n Polygons result;\n for(const PolygonRef& subpoly : polygons)\n {\n result.add(polygon(subpoly));\n }\n return result;\n}\n\nPolygon Simplify::polygon(const Polygon& polygon)\n{\n constexpr bool is_closed = true;\n return simplify(polygon, is_closed);\n}\n\nExtrusionLine Simplify::polygon(const ExtrusionLine& polygon)\n{\n constexpr bool is_closed = true;\n return simplify(polygon, is_closed);\n}\n\nPolygons Simplify::polyline(const Polygons& polylines)\n{\n Polygons result;\n for(const PolygonRef& subpoly : polylines)\n {\n result.add(polyline(subpoly));\n }\n return result;\n}\n\nPolygon Simplify::polyline(const Polygon& polyline)\n{\n constexpr bool is_closed = false;\n return simplify(polyline, is_closed);\n}\n\nExtrusionLine Simplify::polyline(const ExtrusionLine& polyline)\n{\n constexpr bool is_closed = false;\n return simplify(polyline, is_closed);\n}\n\nsize_t Simplify::nextNotDeleted(size_t index, const std::vector<bool>& to_delete) const\n{\n const size_t size = to_delete.size();\n for(index = (index + 1) % size; to_delete[index]; index = (index + 1) % size); \/\/Changes the index variable in-place until we found one that is not deleted.\n return index;\n}\n\nsize_t Simplify::previousNotDeleted(size_t index, const std::vector<bool>& to_delete) const\n{\n const size_t size = to_delete.size();\n for(index = (index + size - 1) % size; to_delete[index]; index = (index + size - 1) % size); \/\/Changes the index variable in-place until we found one that is not deleted.\n return index;\n}\n\nvoid Simplify::appendVertex(Polygon& polygon, const Point& vertex) const\n{\n polygon.add(vertex);\n}\n\nvoid Simplify::appendVertex(ExtrusionLine& extrusion_line, const ExtrusionJunction& vertex) const\n{\n extrusion_line.junctions.push_back(vertex);\n}\n\nPoint Simplify::getPosition(const Point& vertex) const\n{\n return vertex;\n}\n\nPoint Simplify::getPosition(const ExtrusionJunction& vertex) const\n{\n return vertex.p;\n}\n\nPoint Simplify::createIntersection(const Point& before, const Point intersection, const Point& after) const\n{\n return intersection;\n}\n\nExtrusionJunction Simplify::createIntersection(const ExtrusionJunction& before, const Point intersection, const ExtrusionJunction& after) const\n{\n \/\/Average the extrusion width of the line.\n \/\/More correct would be to see where along the line the intersection occurs with a projection or something.\n \/\/But these details are so small, and this solution is so much quicker and simpler.\n return ExtrusionJunction(intersection, (before.w + after.w) \/ 2, before.perimeter_index);\n}\n\ncoord_t Simplify::getAreaDeviation(const Point& before, const Point& vertex, const Point& after) const\n{\n return 0; \/\/Fixed-width polygons don't have any deviation.\n}\n\ncoord_t Simplify::getAreaDeviation(const ExtrusionJunction& before, const ExtrusionJunction& vertex, const ExtrusionJunction& after) const\n{\n \/*\n * A B C A C\n * --------------- **************\n * | | ------------------------------------------\n * | |--------------------------| B removed | |***************************|\n * | | | ---------> | | |\n * | |--------------------------| | |***************************|\n * | | ------------------------------------------\n * --------------- ^ **************\n * ^ B.w + C.w \/ 2 ^\n * A.w + B.w \/ 2 new_width = weighted_average_width\n *\n *\n * ******** denote the total extrusion area deviation error in the consecutive segments as a result of using the\n * weighted-average width for the entire extrusion line.\n *\n * *\/\n const coord_t ab_length = vSize(vertex - before);\n const coord_t bc_length = vSize(after - vertex);\n const coord_t ac_length = vSize(after - before);\n if(ab_length == 0 || ac_length == 0 || bc_length == 0)\n {\n return 0; \/\/Either of the line segments is zero, so the deviation of one of the line segments doesn't matter (not printed). So effectively there is no deviation.\n }\n const coord_t width_diff = std::max(std::abs(vertex.w - before.w), std::abs(after.w - vertex.w));\n if (width_diff > 1)\n {\n \/\/ Adjust the width only if there is a difference, or else the rounding errors may produce the wrong\n \/\/ weighted average value.\n const coord_t ab_weight = (before.w + vertex.w) \/ 2;\n const coord_t bc_weight = (vertex.w + after.w) \/ 2;\n const coord_t weighted_average_width = (ab_length * ab_weight + bc_length * bc_weight) \/ ac_length;\n return std::abs(ab_weight - weighted_average_width) * ab_length + std::abs(bc_weight - weighted_average_width) * bc_length;\n }\n else\n {\n \/\/ If the width difference is very small, then select the width of the segment that is longer\n return ab_length > bc_length ? width_diff * bc_length : width_diff * ab_length;\n }\n}\n\n}<commit_msg>Access subpolys via index rather than for-each loop<commit_after>\/\/Copyright (c) 2022 Ultimaker B.V.\n\/\/CuraEngine is released under the terms of the AGPLv3 or higher.\n\n#include <limits>\n#include <queue> \/\/Priority queue to prioritise removing unimportant vertices.\n\n#include \"Simplify.h\"\n\nnamespace cura\n{\n\nSimplify::Simplify(const coord_t max_resolution, const coord_t max_deviation, const coord_t max_area_deviation)\n : max_resolution(max_resolution)\n , max_deviation(max_deviation)\n , max_area_deviation(max_area_deviation)\n{}\n\nSimplify::Simplify(const Settings& settings)\n : max_resolution(settings.get<coord_t>(\"meshfix_maximum_resolution\"))\n , max_deviation(settings.get<coord_t>(\"meshfix_maximum_deviation\"))\n , max_area_deviation(settings.get<coord_t>(\"meshfix_maximum_area_deviation\"))\n{}\n\nPolygons Simplify::polygon(const Polygons& polygons)\n{\n Polygons result;\n for(size_t i = 0; i < polygons.size(); ++i)\n {\n result.add(polygon(polygons[i]));\n }\n return result;\n}\n\nPolygon Simplify::polygon(const Polygon& polygon)\n{\n constexpr bool is_closed = true;\n return simplify(polygon, is_closed);\n}\n\nExtrusionLine Simplify::polygon(const ExtrusionLine& polygon)\n{\n constexpr bool is_closed = true;\n return simplify(polygon, is_closed);\n}\n\nPolygons Simplify::polyline(const Polygons& polylines)\n{\n Polygons result;\n for(size_t i = 0; i < polylines.size(); ++i)\n {\n result.add(polyline(polylines[i]));\n }\n return result;\n}\n\nPolygon Simplify::polyline(const Polygon& polyline)\n{\n constexpr bool is_closed = false;\n return simplify(polyline, is_closed);\n}\n\nExtrusionLine Simplify::polyline(const ExtrusionLine& polyline)\n{\n constexpr bool is_closed = false;\n return simplify(polyline, is_closed);\n}\n\nsize_t Simplify::nextNotDeleted(size_t index, const std::vector<bool>& to_delete) const\n{\n const size_t size = to_delete.size();\n for(index = (index + 1) % size; to_delete[index]; index = (index + 1) % size); \/\/Changes the index variable in-place until we found one that is not deleted.\n return index;\n}\n\nsize_t Simplify::previousNotDeleted(size_t index, const std::vector<bool>& to_delete) const\n{\n const size_t size = to_delete.size();\n for(index = (index + size - 1) % size; to_delete[index]; index = (index + size - 1) % size); \/\/Changes the index variable in-place until we found one that is not deleted.\n return index;\n}\n\nvoid Simplify::appendVertex(Polygon& polygon, const Point& vertex) const\n{\n polygon.add(vertex);\n}\n\nvoid Simplify::appendVertex(ExtrusionLine& extrusion_line, const ExtrusionJunction& vertex) const\n{\n extrusion_line.junctions.push_back(vertex);\n}\n\nPoint Simplify::getPosition(const Point& vertex) const\n{\n return vertex;\n}\n\nPoint Simplify::getPosition(const ExtrusionJunction& vertex) const\n{\n return vertex.p;\n}\n\nPoint Simplify::createIntersection(const Point& before, const Point intersection, const Point& after) const\n{\n return intersection;\n}\n\nExtrusionJunction Simplify::createIntersection(const ExtrusionJunction& before, const Point intersection, const ExtrusionJunction& after) const\n{\n \/\/Average the extrusion width of the line.\n \/\/More correct would be to see where along the line the intersection occurs with a projection or something.\n \/\/But these details are so small, and this solution is so much quicker and simpler.\n return ExtrusionJunction(intersection, (before.w + after.w) \/ 2, before.perimeter_index);\n}\n\ncoord_t Simplify::getAreaDeviation(const Point& before, const Point& vertex, const Point& after) const\n{\n return 0; \/\/Fixed-width polygons don't have any deviation.\n}\n\ncoord_t Simplify::getAreaDeviation(const ExtrusionJunction& before, const ExtrusionJunction& vertex, const ExtrusionJunction& after) const\n{\n \/*\n * A B C A C\n * --------------- **************\n * | | ------------------------------------------\n * | |--------------------------| B removed | |***************************|\n * | | | ---------> | | |\n * | |--------------------------| | |***************************|\n * | | ------------------------------------------\n * --------------- ^ **************\n * ^ B.w + C.w \/ 2 ^\n * A.w + B.w \/ 2 new_width = weighted_average_width\n *\n *\n * ******** denote the total extrusion area deviation error in the consecutive segments as a result of using the\n * weighted-average width for the entire extrusion line.\n *\n * *\/\n const coord_t ab_length = vSize(vertex - before);\n const coord_t bc_length = vSize(after - vertex);\n const coord_t ac_length = vSize(after - before);\n if(ab_length == 0 || ac_length == 0 || bc_length == 0)\n {\n return 0; \/\/Either of the line segments is zero, so the deviation of one of the line segments doesn't matter (not printed). So effectively there is no deviation.\n }\n const coord_t width_diff = std::max(std::abs(vertex.w - before.w), std::abs(after.w - vertex.w));\n if (width_diff > 1)\n {\n \/\/ Adjust the width only if there is a difference, or else the rounding errors may produce the wrong\n \/\/ weighted average value.\n const coord_t ab_weight = (before.w + vertex.w) \/ 2;\n const coord_t bc_weight = (vertex.w + after.w) \/ 2;\n const coord_t weighted_average_width = (ab_length * ab_weight + bc_length * bc_weight) \/ ac_length;\n return std::abs(ab_weight - weighted_average_width) * ab_length + std::abs(bc_weight - weighted_average_width) * bc_length;\n }\n else\n {\n \/\/ If the width difference is very small, then select the width of the segment that is longer\n return ab_length > bc_length ? width_diff * bc_length : width_diff * ab_length;\n }\n}\n\n}<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <array>\n\nnamespace yunomi {\n namespace core {\n class Select8Bit {\n public:\n constexpr\n Select8Bit() {}\n\n constexpr\n uint8_t operator()(uint8_t value, uint8_t i) const {\n return select_impl(value, i, 0, 0);\n }\n\n private:\n constexpr\n uint8_t select_impl(uint8_t value, size_t i, uint8_t done, uint8_t popcount) const {\n return done >= 8?\n done + popcount\n : (((value >> done) & 0x1ULL) == 1?\n (i == 0? done : select_impl(value, i - 1, done + 1, popcount + 1))\n : select_impl(value, i, done + 1, popcount));\n }\n };\n\n class SelectDictImplValue {\n public:\n constexpr\n SelectDictImplValue(uint8_t value)\n : dict_{\n Select8Bit()(value, 0),\n Select8Bit()(value, 1),\n Select8Bit()(value, 2),\n Select8Bit()(value, 3),\n Select8Bit()(value, 4),\n Select8Bit()(value, 5),\n Select8Bit()(value, 6),\n Select8Bit()(value, 7)\n }\n\n {}\n\n constexpr uint8_t operator[](uint8_t i) const {\n return dict_[i];\n }\n\n private:\n const uint8_t dict_[8];\n };\n\n class SelectDictImpl {\n public:\n constexpr\n SelectDictImpl():\n dict_{\n SelectDictImplValue(0),\n SelectDictImplValue(1),\n SelectDictImplValue(2),\n SelectDictImplValue(3),\n SelectDictImplValue(4),\n SelectDictImplValue(5),\n SelectDictImplValue(6),\n SelectDictImplValue(7),\n SelectDictImplValue(8),\n SelectDictImplValue(9),\n SelectDictImplValue(10),\n SelectDictImplValue(11),\n SelectDictImplValue(12),\n SelectDictImplValue(13),\n SelectDictImplValue(14),\n SelectDictImplValue(15),\n SelectDictImplValue(16),\n SelectDictImplValue(17),\n SelectDictImplValue(18),\n SelectDictImplValue(19),\n SelectDictImplValue(20),\n SelectDictImplValue(21),\n SelectDictImplValue(22),\n SelectDictImplValue(23),\n SelectDictImplValue(24),\n SelectDictImplValue(25),\n SelectDictImplValue(26),\n SelectDictImplValue(27),\n SelectDictImplValue(28),\n SelectDictImplValue(29),\n SelectDictImplValue(30),\n SelectDictImplValue(31),\n SelectDictImplValue(32),\n SelectDictImplValue(33),\n SelectDictImplValue(34),\n SelectDictImplValue(35),\n SelectDictImplValue(36),\n SelectDictImplValue(37),\n SelectDictImplValue(38),\n SelectDictImplValue(39),\n SelectDictImplValue(40),\n SelectDictImplValue(41),\n SelectDictImplValue(42),\n SelectDictImplValue(43),\n SelectDictImplValue(44),\n SelectDictImplValue(45),\n SelectDictImplValue(46),\n SelectDictImplValue(47),\n SelectDictImplValue(48),\n SelectDictImplValue(49),\n SelectDictImplValue(50),\n SelectDictImplValue(51),\n SelectDictImplValue(52),\n SelectDictImplValue(53),\n SelectDictImplValue(54),\n SelectDictImplValue(55),\n SelectDictImplValue(56),\n SelectDictImplValue(57),\n SelectDictImplValue(58),\n SelectDictImplValue(59),\n SelectDictImplValue(60),\n SelectDictImplValue(61),\n SelectDictImplValue(62),\n SelectDictImplValue(63),\n SelectDictImplValue(64),\n SelectDictImplValue(65),\n SelectDictImplValue(66),\n SelectDictImplValue(67),\n SelectDictImplValue(68),\n SelectDictImplValue(69),\n SelectDictImplValue(70),\n SelectDictImplValue(71),\n SelectDictImplValue(72),\n SelectDictImplValue(73),\n SelectDictImplValue(74),\n SelectDictImplValue(75),\n SelectDictImplValue(76),\n SelectDictImplValue(77),\n SelectDictImplValue(78),\n SelectDictImplValue(79),\n SelectDictImplValue(80),\n SelectDictImplValue(81),\n SelectDictImplValue(82),\n SelectDictImplValue(83),\n SelectDictImplValue(84),\n SelectDictImplValue(85),\n SelectDictImplValue(86),\n SelectDictImplValue(87),\n SelectDictImplValue(88),\n SelectDictImplValue(89),\n SelectDictImplValue(90),\n SelectDictImplValue(91),\n SelectDictImplValue(92),\n SelectDictImplValue(93),\n SelectDictImplValue(94),\n SelectDictImplValue(95),\n SelectDictImplValue(96),\n SelectDictImplValue(97),\n SelectDictImplValue(98),\n SelectDictImplValue(99),\n SelectDictImplValue(100),\n SelectDictImplValue(101),\n SelectDictImplValue(102),\n SelectDictImplValue(103),\n SelectDictImplValue(104),\n SelectDictImplValue(105),\n SelectDictImplValue(106),\n SelectDictImplValue(107),\n SelectDictImplValue(108),\n SelectDictImplValue(109),\n SelectDictImplValue(110),\n SelectDictImplValue(111),\n SelectDictImplValue(112),\n SelectDictImplValue(113),\n SelectDictImplValue(114),\n SelectDictImplValue(115),\n SelectDictImplValue(116),\n SelectDictImplValue(117),\n SelectDictImplValue(118),\n SelectDictImplValue(119),\n SelectDictImplValue(120),\n SelectDictImplValue(121),\n SelectDictImplValue(122),\n SelectDictImplValue(123),\n SelectDictImplValue(124),\n SelectDictImplValue(125),\n SelectDictImplValue(126),\n SelectDictImplValue(127),\n SelectDictImplValue(128),\n SelectDictImplValue(129),\n SelectDictImplValue(130),\n SelectDictImplValue(131),\n SelectDictImplValue(132),\n SelectDictImplValue(133),\n SelectDictImplValue(134),\n SelectDictImplValue(135),\n SelectDictImplValue(136),\n SelectDictImplValue(137),\n SelectDictImplValue(138),\n SelectDictImplValue(139),\n SelectDictImplValue(140),\n SelectDictImplValue(141),\n SelectDictImplValue(142),\n SelectDictImplValue(143),\n SelectDictImplValue(144),\n SelectDictImplValue(145),\n SelectDictImplValue(146),\n SelectDictImplValue(147),\n SelectDictImplValue(148),\n SelectDictImplValue(149),\n SelectDictImplValue(150),\n SelectDictImplValue(151),\n SelectDictImplValue(152),\n SelectDictImplValue(153),\n SelectDictImplValue(154),\n SelectDictImplValue(155),\n SelectDictImplValue(156),\n SelectDictImplValue(157),\n SelectDictImplValue(158),\n SelectDictImplValue(159),\n SelectDictImplValue(160),\n SelectDictImplValue(161),\n SelectDictImplValue(162),\n SelectDictImplValue(163),\n SelectDictImplValue(164),\n SelectDictImplValue(165),\n SelectDictImplValue(166),\n SelectDictImplValue(167),\n SelectDictImplValue(168),\n SelectDictImplValue(169),\n SelectDictImplValue(170),\n SelectDictImplValue(171),\n SelectDictImplValue(172),\n SelectDictImplValue(173),\n SelectDictImplValue(174),\n SelectDictImplValue(175),\n SelectDictImplValue(176),\n SelectDictImplValue(177),\n SelectDictImplValue(178),\n SelectDictImplValue(179),\n SelectDictImplValue(180),\n SelectDictImplValue(181),\n SelectDictImplValue(182),\n SelectDictImplValue(183),\n SelectDictImplValue(184),\n SelectDictImplValue(185),\n SelectDictImplValue(186),\n SelectDictImplValue(187),\n SelectDictImplValue(188),\n SelectDictImplValue(189),\n SelectDictImplValue(190),\n SelectDictImplValue(191),\n SelectDictImplValue(192),\n SelectDictImplValue(193),\n SelectDictImplValue(194),\n SelectDictImplValue(195),\n SelectDictImplValue(196),\n SelectDictImplValue(197),\n SelectDictImplValue(198),\n SelectDictImplValue(199),\n SelectDictImplValue(200),\n SelectDictImplValue(201),\n SelectDictImplValue(202),\n SelectDictImplValue(203),\n SelectDictImplValue(204),\n SelectDictImplValue(205),\n SelectDictImplValue(206),\n SelectDictImplValue(207),\n SelectDictImplValue(208),\n SelectDictImplValue(209),\n SelectDictImplValue(210),\n SelectDictImplValue(211),\n SelectDictImplValue(212),\n SelectDictImplValue(213),\n SelectDictImplValue(214),\n SelectDictImplValue(215),\n SelectDictImplValue(216),\n SelectDictImplValue(217),\n SelectDictImplValue(218),\n SelectDictImplValue(219),\n SelectDictImplValue(220),\n SelectDictImplValue(221),\n SelectDictImplValue(222),\n SelectDictImplValue(223),\n SelectDictImplValue(224),\n SelectDictImplValue(225),\n SelectDictImplValue(226),\n SelectDictImplValue(227),\n SelectDictImplValue(228),\n SelectDictImplValue(229),\n SelectDictImplValue(230),\n SelectDictImplValue(231),\n SelectDictImplValue(232),\n SelectDictImplValue(233),\n SelectDictImplValue(234),\n SelectDictImplValue(235),\n SelectDictImplValue(236),\n SelectDictImplValue(237),\n SelectDictImplValue(238),\n SelectDictImplValue(239),\n SelectDictImplValue(240),\n SelectDictImplValue(241),\n SelectDictImplValue(242),\n SelectDictImplValue(243),\n SelectDictImplValue(244),\n SelectDictImplValue(245),\n SelectDictImplValue(246),\n SelectDictImplValue(247),\n SelectDictImplValue(248),\n SelectDictImplValue(249),\n SelectDictImplValue(250),\n SelectDictImplValue(251),\n SelectDictImplValue(252),\n SelectDictImplValue(253),\n SelectDictImplValue(254),\n SelectDictImplValue(255)\n } {}\n\n constexpr\n const SelectDictImplValue &operator[](uint8_t value) const {\n return dict_[value];\n }\n\n private:\n const SelectDictImplValue dict_[256];\n };\n\n class SelectDict{\n public:\n constexpr\n SelectDict(){}\n\n constexpr\n uint8_t operator()(uint8_t value, uint8_t i) const {\n return dict_[value][i];\n }\n\n private:\n SelectDictImpl dict_;\n };\n\n class RegisterSuccinct {\n public:\n RegisterSuccinct(uint64_t value): value_(value){}\n\n uint8_t select(uint8_t i) const {\n constexpr SelectDict select;\n uint64_t value = value_;\n uint8_t sel = 0;\n for(uint8_t j = 0; j < 8; j++){\n uint8_t byte = (uint8_t)value;\n uint8_t byte_sel = select(byte, i);\n if(byte_sel < 8){\n \/\/ found i-th 1.\n return sel + byte_sel;\n }else{\n i = i - (byte_sel - 8);\n sel += 8;\n value = value >> 8;\n }\n }\n \/\/ not found\n return not_found();\n }\n\n constexpr static\n uint8_t not_found() {\n return 64;\n }\n\n private:\n uint64_t value_;\n };\n\n }\n}\n<commit_msg>Add documents for succinct.hpp.<commit_after>#pragma once\n\n#include <array>\n\nnamespace yunomi {\n namespace core {\n\n \/**\n * @brief an implementation of a select function for 8bits value\n * @details\n * This class is an implementation of a select function.\n * `select` is one of the well known function, especially in the field \"succinct data structure\".\n * \n * function `select(value, i)` is defined as:\n * \n * select(value, i) = \\argmax_k rank(k) == i,\n * \n * where:\n * \n * rank(value, i) = \\sum_{j = 0}^{i - 1} value[j:j + 1].\n * \n * On this implementation, `value` is restricted up to 8bits value (0 <= `value` < 256)\n * \n *\/\n class Select8Bit {\n public:\n constexpr\n Select8Bit() {}\n\n \/**\n * @brief execute the select operation for given input values\n * @param[in] value any unsigned value up to 8bits\n * @param[in] i specify the number that you want to get the index of i-th 1\n * @return uint8_t \n * Index of digits that the given i-th one is found.\n * If i-th one is not found, it returns larger than 8.\n *\/\n constexpr\n uint8_t operator()(uint8_t value, uint8_t i) const {\n return select_impl(value, i, 0, 0);\n }\n\n private:\n constexpr\n uint8_t select_impl(uint8_t value, size_t i, uint8_t done, uint8_t popcount) const {\n return done >= 8?\n done + popcount\n : (((value >> done) & 0x1ULL) == 1?\n (i == 0? done : select_impl(value, i - 1, done + 1, popcount + 1))\n : select_impl(value, i, done + 1, popcount));\n }\n };\n\n \/**\n * @brief precomputed cache of `Select8Bit` results for a given value.\n *\/\n class SelectDictImplValue {\n public:\n \/**\n * @brief constructor. calculate all patterns for the given `value`\n * @param value target value that need to be precomputed\n *\/\n constexpr\n SelectDictImplValue(uint8_t value)\n : dict_{\n Select8Bit()(value, 0),\n Select8Bit()(value, 1),\n Select8Bit()(value, 2),\n Select8Bit()(value, 3),\n Select8Bit()(value, 4),\n Select8Bit()(value, 5),\n Select8Bit()(value, 6),\n Select8Bit()(value, 7)\n }\n {}\n\n \/**\n * @brief get a precomputed `select(value, i)` value\n * @param[in] i specify the number that you want to get the index of i-th 1\n * @return uint8_t index of digits that the given i-th one is found.\n * if i-th one is not found, it returns larger than 8.\n *\/\n constexpr uint8_t operator[](uint8_t i) const {\n return dict_[i];\n }\n\n private:\n const uint8_t dict_[8];\n };\n\n \/**\n * @brief precomputed cache of `Select8Bit` results for any 8bits value\n *\/\n class SelectDictImpl {\n public:\n constexpr\n SelectDictImpl():\n dict_{\n SelectDictImplValue(0),\n SelectDictImplValue(1),\n SelectDictImplValue(2),\n SelectDictImplValue(3),\n SelectDictImplValue(4),\n SelectDictImplValue(5),\n SelectDictImplValue(6),\n SelectDictImplValue(7),\n SelectDictImplValue(8),\n SelectDictImplValue(9),\n SelectDictImplValue(10),\n SelectDictImplValue(11),\n SelectDictImplValue(12),\n SelectDictImplValue(13),\n SelectDictImplValue(14),\n SelectDictImplValue(15),\n SelectDictImplValue(16),\n SelectDictImplValue(17),\n SelectDictImplValue(18),\n SelectDictImplValue(19),\n SelectDictImplValue(20),\n SelectDictImplValue(21),\n SelectDictImplValue(22),\n SelectDictImplValue(23),\n SelectDictImplValue(24),\n SelectDictImplValue(25),\n SelectDictImplValue(26),\n SelectDictImplValue(27),\n SelectDictImplValue(28),\n SelectDictImplValue(29),\n SelectDictImplValue(30),\n SelectDictImplValue(31),\n SelectDictImplValue(32),\n SelectDictImplValue(33),\n SelectDictImplValue(34),\n SelectDictImplValue(35),\n SelectDictImplValue(36),\n SelectDictImplValue(37),\n SelectDictImplValue(38),\n SelectDictImplValue(39),\n SelectDictImplValue(40),\n SelectDictImplValue(41),\n SelectDictImplValue(42),\n SelectDictImplValue(43),\n SelectDictImplValue(44),\n SelectDictImplValue(45),\n SelectDictImplValue(46),\n SelectDictImplValue(47),\n SelectDictImplValue(48),\n SelectDictImplValue(49),\n SelectDictImplValue(50),\n SelectDictImplValue(51),\n SelectDictImplValue(52),\n SelectDictImplValue(53),\n SelectDictImplValue(54),\n SelectDictImplValue(55),\n SelectDictImplValue(56),\n SelectDictImplValue(57),\n SelectDictImplValue(58),\n SelectDictImplValue(59),\n SelectDictImplValue(60),\n SelectDictImplValue(61),\n SelectDictImplValue(62),\n SelectDictImplValue(63),\n SelectDictImplValue(64),\n SelectDictImplValue(65),\n SelectDictImplValue(66),\n SelectDictImplValue(67),\n SelectDictImplValue(68),\n SelectDictImplValue(69),\n SelectDictImplValue(70),\n SelectDictImplValue(71),\n SelectDictImplValue(72),\n SelectDictImplValue(73),\n SelectDictImplValue(74),\n SelectDictImplValue(75),\n SelectDictImplValue(76),\n SelectDictImplValue(77),\n SelectDictImplValue(78),\n SelectDictImplValue(79),\n SelectDictImplValue(80),\n SelectDictImplValue(81),\n SelectDictImplValue(82),\n SelectDictImplValue(83),\n SelectDictImplValue(84),\n SelectDictImplValue(85),\n SelectDictImplValue(86),\n SelectDictImplValue(87),\n SelectDictImplValue(88),\n SelectDictImplValue(89),\n SelectDictImplValue(90),\n SelectDictImplValue(91),\n SelectDictImplValue(92),\n SelectDictImplValue(93),\n SelectDictImplValue(94),\n SelectDictImplValue(95),\n SelectDictImplValue(96),\n SelectDictImplValue(97),\n SelectDictImplValue(98),\n SelectDictImplValue(99),\n SelectDictImplValue(100),\n SelectDictImplValue(101),\n SelectDictImplValue(102),\n SelectDictImplValue(103),\n SelectDictImplValue(104),\n SelectDictImplValue(105),\n SelectDictImplValue(106),\n SelectDictImplValue(107),\n SelectDictImplValue(108),\n SelectDictImplValue(109),\n SelectDictImplValue(110),\n SelectDictImplValue(111),\n SelectDictImplValue(112),\n SelectDictImplValue(113),\n SelectDictImplValue(114),\n SelectDictImplValue(115),\n SelectDictImplValue(116),\n SelectDictImplValue(117),\n SelectDictImplValue(118),\n SelectDictImplValue(119),\n SelectDictImplValue(120),\n SelectDictImplValue(121),\n SelectDictImplValue(122),\n SelectDictImplValue(123),\n SelectDictImplValue(124),\n SelectDictImplValue(125),\n SelectDictImplValue(126),\n SelectDictImplValue(127),\n SelectDictImplValue(128),\n SelectDictImplValue(129),\n SelectDictImplValue(130),\n SelectDictImplValue(131),\n SelectDictImplValue(132),\n SelectDictImplValue(133),\n SelectDictImplValue(134),\n SelectDictImplValue(135),\n SelectDictImplValue(136),\n SelectDictImplValue(137),\n SelectDictImplValue(138),\n SelectDictImplValue(139),\n SelectDictImplValue(140),\n SelectDictImplValue(141),\n SelectDictImplValue(142),\n SelectDictImplValue(143),\n SelectDictImplValue(144),\n SelectDictImplValue(145),\n SelectDictImplValue(146),\n SelectDictImplValue(147),\n SelectDictImplValue(148),\n SelectDictImplValue(149),\n SelectDictImplValue(150),\n SelectDictImplValue(151),\n SelectDictImplValue(152),\n SelectDictImplValue(153),\n SelectDictImplValue(154),\n SelectDictImplValue(155),\n SelectDictImplValue(156),\n SelectDictImplValue(157),\n SelectDictImplValue(158),\n SelectDictImplValue(159),\n SelectDictImplValue(160),\n SelectDictImplValue(161),\n SelectDictImplValue(162),\n SelectDictImplValue(163),\n SelectDictImplValue(164),\n SelectDictImplValue(165),\n SelectDictImplValue(166),\n SelectDictImplValue(167),\n SelectDictImplValue(168),\n SelectDictImplValue(169),\n SelectDictImplValue(170),\n SelectDictImplValue(171),\n SelectDictImplValue(172),\n SelectDictImplValue(173),\n SelectDictImplValue(174),\n SelectDictImplValue(175),\n SelectDictImplValue(176),\n SelectDictImplValue(177),\n SelectDictImplValue(178),\n SelectDictImplValue(179),\n SelectDictImplValue(180),\n SelectDictImplValue(181),\n SelectDictImplValue(182),\n SelectDictImplValue(183),\n SelectDictImplValue(184),\n SelectDictImplValue(185),\n SelectDictImplValue(186),\n SelectDictImplValue(187),\n SelectDictImplValue(188),\n SelectDictImplValue(189),\n SelectDictImplValue(190),\n SelectDictImplValue(191),\n SelectDictImplValue(192),\n SelectDictImplValue(193),\n SelectDictImplValue(194),\n SelectDictImplValue(195),\n SelectDictImplValue(196),\n SelectDictImplValue(197),\n SelectDictImplValue(198),\n SelectDictImplValue(199),\n SelectDictImplValue(200),\n SelectDictImplValue(201),\n SelectDictImplValue(202),\n SelectDictImplValue(203),\n SelectDictImplValue(204),\n SelectDictImplValue(205),\n SelectDictImplValue(206),\n SelectDictImplValue(207),\n SelectDictImplValue(208),\n SelectDictImplValue(209),\n SelectDictImplValue(210),\n SelectDictImplValue(211),\n SelectDictImplValue(212),\n SelectDictImplValue(213),\n SelectDictImplValue(214),\n SelectDictImplValue(215),\n SelectDictImplValue(216),\n SelectDictImplValue(217),\n SelectDictImplValue(218),\n SelectDictImplValue(219),\n SelectDictImplValue(220),\n SelectDictImplValue(221),\n SelectDictImplValue(222),\n SelectDictImplValue(223),\n SelectDictImplValue(224),\n SelectDictImplValue(225),\n SelectDictImplValue(226),\n SelectDictImplValue(227),\n SelectDictImplValue(228),\n SelectDictImplValue(229),\n SelectDictImplValue(230),\n SelectDictImplValue(231),\n SelectDictImplValue(232),\n SelectDictImplValue(233),\n SelectDictImplValue(234),\n SelectDictImplValue(235),\n SelectDictImplValue(236),\n SelectDictImplValue(237),\n SelectDictImplValue(238),\n SelectDictImplValue(239),\n SelectDictImplValue(240),\n SelectDictImplValue(241),\n SelectDictImplValue(242),\n SelectDictImplValue(243),\n SelectDictImplValue(244),\n SelectDictImplValue(245),\n SelectDictImplValue(246),\n SelectDictImplValue(247),\n SelectDictImplValue(248),\n SelectDictImplValue(249),\n SelectDictImplValue(250),\n SelectDictImplValue(251),\n SelectDictImplValue(252),\n SelectDictImplValue(253),\n SelectDictImplValue(254),\n SelectDictImplValue(255)\n } {}\n\n \/**\n * @brief get a precomputed cache for given `value`\n * @param[in] value specify any unsigned value up to 8bits.\n * @return `SelectDictImpleValue&`\n * Precomputed cache for the given `value`. \n *\/\n constexpr\n const SelectDictImplValue &operator[](uint8_t value) const {\n return dict_[value];\n }\n\n private:\n const SelectDictImplValue dict_[256];\n };\n\n \/**\n * @brief Precomputed cache for `Select8Bit`.\n *\/\n class SelectDict{\n public:\n constexpr\n SelectDict(){}\n\n \/**\n * @brief lookup precomputed value.\n * @param[in] value any unsigned value up to 8bits\n * @param[in] i specify the number that you want to get the index of i-th 1\n * @return uint8_t \n * precomputed results of `Select8Bit()(value, i)`.\n * This is useful when `Select8Bit` seems to be slow.\n *\/\n constexpr\n uint8_t operator()(uint8_t value, uint8_t i) const {\n return dict_[value][i];\n }\n\n private:\n SelectDictImpl dict_;\n };\n\n \/**\n * @brief utility class for calculating select function for uint64_t value\n *\/\n class RegisterSuccinct {\n public:\n RegisterSuccinct(uint64_t value): value_(value){}\n\n \/**\n * @brief calculate select function for `value_`\n *\/\n uint8_t select(uint8_t i) const {\n constexpr SelectDict select;\n uint64_t value = value_;\n uint8_t sel = 0;\n for(uint8_t j = 0; j < 8; j++){\n uint8_t byte = (uint8_t)value;\n uint8_t byte_sel = select(byte, i);\n if(byte_sel < 8){\n \/\/ found i-th 1.\n return sel + byte_sel;\n }else{\n i = i - (byte_sel - 8);\n sel += 8;\n value = value >> 8;\n }\n }\n \/\/ not found\n return not_found();\n }\n\n constexpr static\n uint8_t not_found() {\n return 64;\n }\n\n private:\n uint64_t value_;\n };\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include <typeindex>\n#include <typeinfo>\n#include <unordered_map>\n\n#include \"units.h\"\n\nusing namespace distance_literals;\n\nusing testing::Test;\nusing testing::Types;\nusing testing::Values;\nusing testing::WithParamInterface;\n\nnamespace TestDistanceUnits\n{\n\ttemplate<typename T>\n\tclass UnitCastTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(UnitCastTest);\n\n#define UNITS_TYPE_COMBINE(T) std::tuple<T, units::nanometres>, \\\nstd::tuple<T, units::micrometres>, \\\nstd::tuple<T, units::millimetres>, \\\nstd::tuple<T, units::centimetres>, \\\nstd::tuple<T, units::decimetres>, \\\nstd::tuple<T, units::metres>, \\\nstd::tuple<T, units::kilometres>, \\\nstd::tuple<T, units::thous>, \\\nstd::tuple<T, units::inches>, \\\nstd::tuple<T, units::links>, \\\nstd::tuple<T, units::feet>, \\\nstd::tuple<T, units::yards>, \\\nstd::tuple<T, units::rods>, \\\nstd::tuple<T, units::chains>, \\\nstd::tuple<T, units::furlongs>, \\\nstd::tuple<T, units::miles>, \\\nstd::tuple<T, units::leagues>, \\\nstd::tuple<T, units::fathoms>, \\\nstd::tuple<T, units::cables>, \\\nstd::tuple<T, units::nautical_miles>\n\n\tTYPED_TEST_P(UnitCastTest, UnitCast_WhenConvertedToCompatibleType_WillConvertBackWithoutPrecisionLoss)\n\t{\n\t\tusing test_type = typename std::tuple_element_t<0, TypeParam>;\n\t\tusing convertible_type = typename std::tuple_element_t<1, TypeParam>;\n\n\t\tconvertible_type conversion = units::unit_cast<convertible_type>(test_type{ 1 });\n\t\ttest_type result = units::unit_cast<test_type>(conversion);\n\n\t\tEXPECT_EQ(test_type{ 1 }, result);\n\t}\n\n\t\/\/ Metric\n\tusing NanometresTuple = Types<UNITS_TYPE_COMBINE(units::nanometres)>;\n\tusing MicrometresTuple = Types<UNITS_TYPE_COMBINE(units::micrometres)>;\n\tusing MillimetresTuple = Types<UNITS_TYPE_COMBINE(units::millimetres)>;\n\tusing CentimetresTuple = Types<UNITS_TYPE_COMBINE(units::centimetres)>;\n\tusing DecimetresTuple = Types<UNITS_TYPE_COMBINE(units::decimetres)>;\n\tusing MetresTuple = Types<UNITS_TYPE_COMBINE(units::metres)>;\n\tusing KilometresTuple = Types<UNITS_TYPE_COMBINE(units::kilometres)>;\n\n\t\/\/ Imperial\n\tusing ThousTuple = Types<UNITS_TYPE_COMBINE(units::thous)>;\n\tusing InchesTuple = Types<UNITS_TYPE_COMBINE(units::inches)>;\n\tusing LinksTuple = Types<UNITS_TYPE_COMBINE(units::links)>;\n\tusing FeetTuple = Types<UNITS_TYPE_COMBINE(units::feet)>;\n\tusing YardsTuple = Types<UNITS_TYPE_COMBINE(units::yards)>;\n\tusing RodsTuple = Types<UNITS_TYPE_COMBINE(units::rods)>;\n\tusing ChainsTuple = Types<UNITS_TYPE_COMBINE(units::chains)>;\n\tusing FurlongsTuple = Types<UNITS_TYPE_COMBINE(units::furlongs)>;\n\tusing MilesTuple = Types<UNITS_TYPE_COMBINE(units::miles)>;\n\tusing LeaguesTuple = Types<UNITS_TYPE_COMBINE(units::leagues)>;\n\n\t\/\/ Maritime\n\tusing FathomsTuple = Types<UNITS_TYPE_COMBINE(units::fathoms)>;\n\tusing CablesTuple = Types<UNITS_TYPE_COMBINE(units::cables)>;\n\tusing NauticalMilesTuple = Types<UNITS_TYPE_COMBINE(units::nautical_miles)>;\n\n#undef UNITS_TYPE_COMBINE\n\n\tREGISTER_TYPED_TEST_CASE_P(UnitCastTest,\n\t\t\t\t\t\t\t UnitCast_WhenConvertedToCompatibleType_WillConvertBackWithoutPrecisionLoss);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(Nanometres, UnitCastTest, NanometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Micrometres, UnitCastTest, MicrometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Millimetres, UnitCastTest, MillimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Centimetres, UnitCastTest, CentimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(DeciMetres, UnitCastTest, DecimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Metres, UnitCastTest, MetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Kilometres, UnitCastTest, KilometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Thous, UnitCastTest, ThousTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Inches, UnitCastTest, InchesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Links, UnitCastTest, LinksTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Feet, UnitCastTest, FeetTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Yards, UnitCastTest, YardsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Rods, UnitCastTest, RodsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Chains, UnitCastTest, ChainsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Furlongs, UnitCastTest, FurlongsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Miles, UnitCastTest, MilesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Leagues, UnitCastTest, LeaguesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Fathoms, UnitCastTest, FathomsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Cables, UnitCastTest, CablesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(NauticalMiles, UnitCastTest, NauticalMilesTuple);\n\n\ttemplate <typename T>\n\tclass BritishVsAmericanSpellingTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(BritishVsAmericanSpellingTest);\n\n\tTYPED_TEST_P(BritishVsAmericanSpellingTest, EitherSpellingYieldsSameType)\n\t{\n\t\tconstexpr bool is_same = std::is_same<typename std::tuple_element<0, TypeParam>::type,\n\t\t typename std::tuple_element<1, TypeParam>::type>::value;\n\t\tEXPECT_TRUE(is_same);\n\t}\n\n\tusing BritishVsAmericanSpellingTuple = Types<std::tuple<units::nanometres, units::nanometers>,\n\t std::tuple<units::micrometres, units::micrometers>,\n\t std::tuple<units::millimetres, units::millimeters>,\n\t std::tuple<units::centimetres, units::centimeters>,\n\t std::tuple<units::decimetres, units::decimeters>,\n\t std::tuple<units::metres, units::meters>,\n\t std::tuple<units::kilometres, units::kilometers>>;\n\n\tREGISTER_TYPED_TEST_CASE_P(BritishVsAmericanSpellingTest, EitherSpellingYieldsSameType);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(BritishVsAmericanSpelling,\n\t BritishVsAmericanSpellingTest,\n\t BritishVsAmericanSpellingTuple);\n\n\ttemplate <typename T>\n\tclass LiteralsTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(LiteralsTest);\n\n\tTYPED_TEST_P(LiteralsTest, LiteralGeneratesCorrectType)\n\t{\n\t\tusing expected_type = typename std::tuple_element<0, TypeParam>::type;\n\t\tusing actual_type = typename std::tuple_element<1, TypeParam>::type;\n\t\tconstexpr auto is_same = std::is_same<expected_type, actual_type>::value;\n\t\tEXPECT_TRUE(is_same) << \"Incompatible types\";\n\t}\n\n\tusing MetricDistanceLiteralsTuple = Types<std::tuple<units::nanometres, decltype(1_nm)>,\n\t std::tuple<units::micrometres, decltype(1_um)>,\n\t std::tuple<units::millimetres, decltype(1_mm)>,\n\t std::tuple<units::centimetres, decltype(1_cm)>,\n\t std::tuple<units::metres, decltype(1_m)>,\n\t std::tuple<units::kilometres, decltype(1_km)>>;\n\n\tusing ImperialDistanceLiteralsTuple = Types<std::tuple<units::inches, decltype(1_in)>,\n\t std::tuple<units::feet, decltype(1_ft)>,\n\t std::tuple<units::yards, decltype(1_yd)>,\n\t std::tuple<units::chains, decltype(1_ch)>,\n\t std::tuple<units::furlongs, decltype(1_fur)>,\n\t std::tuple<units::miles, decltype(1_mi)>,\n\t std::tuple<units::leagues, decltype(1_lea)>,\n\t std::tuple<units::thous, decltype(1_th)>>;\n\n\tusing MaritimeDistanceLiteralsTuple = Types<std::tuple<units::fathoms, decltype(1_ftm)>,\n\t std::tuple<units::cables, decltype(1_cb)>,\n\t std::tuple<units::nautical_miles, decltype(1_NM)>,\n\t std::tuple<units::nautical_miles, decltype(1_nmi)>>;\n\n\tusing AstronomicalUnitsDistanceLiteralsTuple = Types<std::tuple<units::earth_radii, decltype(1_R)>,\n\t std::tuple<units::lunar_distances, decltype(1_LD)>,\n\t std::tuple<units::astronimical_units, decltype(1_AU)>,\n\t std::tuple<units::light_years, decltype(1_ly)>,\n\t std::tuple<units::parsecs, decltype(1_pc)>>;\n\n\tREGISTER_TYPED_TEST_CASE_P(LiteralsTest, LiteralGeneratesCorrectType);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(MetricDistance, LiteralsTest, MetricDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(ImperialDistance, LiteralsTest, ImperialDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(MaritimeDistance, LiteralsTest, MaritimeDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(AstronomicalUnitsDistance, LiteralsTest, AstronomicalUnitsDistanceLiteralsTuple);\n}\n<commit_msg>Fix formatting...<commit_after>#include <gtest\/gtest.h>\n\n#include <typeindex>\n#include <typeinfo>\n#include <unordered_map>\n\n#include \"units.h\"\n\nusing namespace distance_literals;\n\nusing testing::Test;\nusing testing::Types;\nusing testing::Values;\nusing testing::WithParamInterface;\n\nnamespace TestDistanceUnits\n{\n\ttemplate<typename T>\n\tclass UnitCastTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(UnitCastTest);\n\n#define UNITS_TYPE_COMBINE(T) \\\nstd::tuple<T, units::nanometres>, \\\nstd::tuple<T, units::micrometres>, \\\nstd::tuple<T, units::millimetres>, \\\nstd::tuple<T, units::centimetres>, \\\nstd::tuple<T, units::decimetres>, \\\nstd::tuple<T, units::metres>, \\\nstd::tuple<T, units::kilometres>, \\\nstd::tuple<T, units::thous>, \\\nstd::tuple<T, units::inches>, \\\nstd::tuple<T, units::links>, \\\nstd::tuple<T, units::feet>, \\\nstd::tuple<T, units::yards>, \\\nstd::tuple<T, units::rods>, \\\nstd::tuple<T, units::chains>, \\\nstd::tuple<T, units::furlongs>, \\\nstd::tuple<T, units::miles>, \\\nstd::tuple<T, units::leagues>, \\\nstd::tuple<T, units::fathoms>, \\\nstd::tuple<T, units::cables>, \\\nstd::tuple<T, units::nautical_miles>\n\n\tTYPED_TEST_P(UnitCastTest, UnitCast_WhenConvertedToCompatibleType_WillConvertBackWithoutPrecisionLoss)\n\t{\n\t\tusing test_type = typename std::tuple_element_t<0, TypeParam>;\n\t\tusing convertible_type = typename std::tuple_element_t<1, TypeParam>;\n\n\t\tconvertible_type conversion = units::unit_cast<convertible_type>(test_type{ 1 });\n\t\ttest_type result = units::unit_cast<test_type>(conversion);\n\n\t\tEXPECT_EQ(test_type{ 1 }, result);\n\t}\n\n\t\/\/ Metric\n\tusing NanometresTuple = Types<UNITS_TYPE_COMBINE(units::nanometres)>;\n\tusing MicrometresTuple = Types<UNITS_TYPE_COMBINE(units::micrometres)>;\n\tusing MillimetresTuple = Types<UNITS_TYPE_COMBINE(units::millimetres)>;\n\tusing CentimetresTuple = Types<UNITS_TYPE_COMBINE(units::centimetres)>;\n\tusing DecimetresTuple = Types<UNITS_TYPE_COMBINE(units::decimetres)>;\n\tusing MetresTuple = Types<UNITS_TYPE_COMBINE(units::metres)>;\n\tusing KilometresTuple = Types<UNITS_TYPE_COMBINE(units::kilometres)>;\n\n\t\/\/ Imperial\n\tusing ThousTuple = Types<UNITS_TYPE_COMBINE(units::thous)>;\n\tusing InchesTuple = Types<UNITS_TYPE_COMBINE(units::inches)>;\n\tusing LinksTuple = Types<UNITS_TYPE_COMBINE(units::links)>;\n\tusing FeetTuple = Types<UNITS_TYPE_COMBINE(units::feet)>;\n\tusing YardsTuple = Types<UNITS_TYPE_COMBINE(units::yards)>;\n\tusing RodsTuple = Types<UNITS_TYPE_COMBINE(units::rods)>;\n\tusing ChainsTuple = Types<UNITS_TYPE_COMBINE(units::chains)>;\n\tusing FurlongsTuple = Types<UNITS_TYPE_COMBINE(units::furlongs)>;\n\tusing MilesTuple = Types<UNITS_TYPE_COMBINE(units::miles)>;\n\tusing LeaguesTuple = Types<UNITS_TYPE_COMBINE(units::leagues)>;\n\n\t\/\/ Maritime\n\tusing FathomsTuple = Types<UNITS_TYPE_COMBINE(units::fathoms)>;\n\tusing CablesTuple = Types<UNITS_TYPE_COMBINE(units::cables)>;\n\tusing NauticalMilesTuple = Types<UNITS_TYPE_COMBINE(units::nautical_miles)>;\n\n#undef UNITS_TYPE_COMBINE\n\n\tREGISTER_TYPED_TEST_CASE_P(UnitCastTest,\n\t\t\t\t\t\t\t UnitCast_WhenConvertedToCompatibleType_WillConvertBackWithoutPrecisionLoss);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(Nanometres, UnitCastTest, NanometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Micrometres, UnitCastTest, MicrometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Millimetres, UnitCastTest, MillimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Centimetres, UnitCastTest, CentimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(DeciMetres, UnitCastTest, DecimetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Metres, UnitCastTest, MetresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Kilometres, UnitCastTest, KilometresTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Thous, UnitCastTest, ThousTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Inches, UnitCastTest, InchesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Links, UnitCastTest, LinksTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Feet, UnitCastTest, FeetTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Yards, UnitCastTest, YardsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Rods, UnitCastTest, RodsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Chains, UnitCastTest, ChainsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Furlongs, UnitCastTest, FurlongsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Miles, UnitCastTest, MilesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Leagues, UnitCastTest, LeaguesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Fathoms, UnitCastTest, FathomsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(Cables, UnitCastTest, CablesTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(NauticalMiles, UnitCastTest, NauticalMilesTuple);\n\n\ttemplate <typename T>\n\tclass BritishVsAmericanSpellingTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(BritishVsAmericanSpellingTest);\n\n\tTYPED_TEST_P(BritishVsAmericanSpellingTest, EitherSpellingYieldsSameType)\n\t{\n\t\tconstexpr bool is_same = std::is_same<typename std::tuple_element<0, TypeParam>::type,\n\t\t typename std::tuple_element<1, TypeParam>::type>::value;\n\t\tEXPECT_TRUE(is_same);\n\t}\n\n\tusing BritishVsAmericanSpellingTuple = Types<std::tuple<units::nanometres, units::nanometers>,\n\t std::tuple<units::micrometres, units::micrometers>,\n\t std::tuple<units::millimetres, units::millimeters>,\n\t std::tuple<units::centimetres, units::centimeters>,\n\t std::tuple<units::decimetres, units::decimeters>,\n\t std::tuple<units::metres, units::meters>,\n\t std::tuple<units::kilometres, units::kilometers>>;\n\n\tREGISTER_TYPED_TEST_CASE_P(BritishVsAmericanSpellingTest, EitherSpellingYieldsSameType);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(BritishVsAmericanSpelling,\n\t BritishVsAmericanSpellingTest,\n\t BritishVsAmericanSpellingTuple);\n\n\ttemplate <typename T>\n\tclass LiteralsTest : public Test\n\t{\n\t};\n\n\tTYPED_TEST_CASE_P(LiteralsTest);\n\n\tTYPED_TEST_P(LiteralsTest, LiteralGeneratesCorrectType)\n\t{\n\t\tusing expected_type = typename std::tuple_element<0, TypeParam>::type;\n\t\tusing actual_type = typename std::tuple_element<1, TypeParam>::type;\n\t\tconstexpr auto is_same = std::is_same<expected_type, actual_type>::value;\n\t\tEXPECT_TRUE(is_same) << \"Incompatible types\";\n\t}\n\n\tusing MetricDistanceLiteralsTuple = Types<std::tuple<units::nanometres, decltype(1_nm)>,\n\t std::tuple<units::micrometres, decltype(1_um)>,\n\t std::tuple<units::millimetres, decltype(1_mm)>,\n\t std::tuple<units::centimetres, decltype(1_cm)>,\n\t std::tuple<units::metres, decltype(1_m)>,\n\t std::tuple<units::kilometres, decltype(1_km)>>;\n\n\tusing ImperialDistanceLiteralsTuple = Types<std::tuple<units::inches, decltype(1_in)>,\n\t std::tuple<units::feet, decltype(1_ft)>,\n\t std::tuple<units::yards, decltype(1_yd)>,\n\t std::tuple<units::chains, decltype(1_ch)>,\n\t std::tuple<units::furlongs, decltype(1_fur)>,\n\t std::tuple<units::miles, decltype(1_mi)>,\n\t std::tuple<units::leagues, decltype(1_lea)>,\n\t std::tuple<units::thous, decltype(1_th)>>;\n\n\tusing MaritimeDistanceLiteralsTuple = Types<std::tuple<units::fathoms, decltype(1_ftm)>,\n\t std::tuple<units::cables, decltype(1_cb)>,\n\t std::tuple<units::nautical_miles, decltype(1_NM)>,\n\t std::tuple<units::nautical_miles, decltype(1_nmi)>>;\n\n\tusing AstronomicalUnitsDistanceLiteralsTuple = Types<std::tuple<units::earth_radii, decltype(1_R)>,\n\t std::tuple<units::lunar_distances, decltype(1_LD)>,\n\t std::tuple<units::astronimical_units, decltype(1_AU)>,\n\t std::tuple<units::light_years, decltype(1_ly)>,\n\t std::tuple<units::parsecs, decltype(1_pc)>>;\n\n\tREGISTER_TYPED_TEST_CASE_P(LiteralsTest, LiteralGeneratesCorrectType);\n\n\tINSTANTIATE_TYPED_TEST_CASE_P(MetricDistance, LiteralsTest, MetricDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(ImperialDistance, LiteralsTest, ImperialDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(MaritimeDistance, LiteralsTest, MaritimeDistanceLiteralsTuple);\n\tINSTANTIATE_TYPED_TEST_CASE_P(AstronomicalUnitsDistance, LiteralsTest, AstronomicalUnitsDistanceLiteralsTuple);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once \nnamespace std {\nnamespace experimental {\nnamespace parallel {\ninline namespace v1 {\n\ntemplate<int i, int... js>\nstruct __constexpr_max\n{\n static const int value = i < __constexpr_max<js...>::value ? __constexpr_max<js...>::value : i;\n};\n\n\ntemplate<int i>\nstruct __constexpr_max<i>\n{\n static const int value = i;\n};\n\n\ntemplate<class DefaultPolicy, class... Policies>\nclass __dynamic_execution_policy\n{\n private:\n typedef typename std::aligned_storage<\n __constexpr_max<sizeof(DefaultPolicy), sizeof(Policies)...>::value\n >::type policy_storage_type;\n policy_storage_type policy_storage_;\n const type_info *policy_type_;\n\n template<class ExecutionPolicy>\n bool is_policy() const { return typeid(ExecutionPolicy) == *policy_type_; }\n\n public: \n\n template<typename ExecutionPolicy>\n __dynamic_execution_policy(const ExecutionPolicy& exec) \n {\n auto ptr = reinterpret_cast<ExecutionPolicy*>(&policy_storage_);\n new (ptr) ExecutionPolicy(exec);\n policy_type_ = &typeid(ExecutionPolicy);\n }\n \/* eg: use default copy\/move ctors, dtors, and assignment ops , should be okay*\/\n\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value, ExecutionPolicy*>::type\n get() __NOEXCEPT\n {\n if (!is_policy<ExecutionPolicy>())\n {\n return nullptr;\n }\n return reinterpret_cast<ExecutionPolicy*>(&policy_storage_);\n }\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value, const ExecutionPolicy*>::type\n get() const __NOEXCEPT\n {\n if (!is_policy<ExecutionPolicy>())\n {\n return nullptr;\n }\n return reinterpret_cast<const ExecutionPolicy*>(&policy_storage_);\n }\n\n const type_info& type() const __NOEXCEPT\n {\n return *policy_type_;\n }\n\n private:\n\n \/\/ algorithm dispatch : loop over policies to detect the one that needs to be dispatched\n \/\/\n template<class...>\n struct policies_placeholder{};\n\n template<class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(policies_placeholder<>&&, Args&&... args) const \n {\n return get<DefaultPolicy>()->dispatch(forward<Args>(args)...);\n }\n\n template<class ExecutionPolicy, class... Execs, class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(policies_placeholder<ExecutionPolicy,Execs...>&&, Args&&... args) const \n {\n if (is_policy<ExecutionPolicy>())\n {\n return get<ExecutionPolicy>()->dispatch(forward<Args>(args)...);\n }\n else\n {\n return dispatch(policies_placeholder<Execs...>{}, forward<Args>(args)...);\n }\n }\n\n public:\n \n \/\/ algorithm dispatch\n \/\/\n template<class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(Args&&... args) const \n {\n return dispatch(policies_placeholder<DefaultPolicy, Policies...>{}, forward<Args>(args)...);\n }\n};\n\nstruct execution_policy\n{\n private:\n __dynamic_execution_policy<\n sequential_execution_policy,\n parallel_execution_policy\n > policy_;\n public:\n \/\/ 2.7.1, execution_policy construct\/assign\n template<class ExecutionPolicy> \n execution_policy(const ExecutionPolicy& policy,\n typename enable_if<is_execution_policy<ExecutionPolicy>::value>::type * = 0) : policy_(policy)\n {}\n\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value,execution_policy&>::type\n operator=(const ExecutionPolicy& policy)\n {\n policy_ = policy;\n return *this;\n }\n\n \/\/ 2.7.2, execution_policy object access\n const type_info& type() const __NOEXCEPT\n {\n return policy_.type();\n }\n\n template<class ExecutionPolicy>\n ExecutionPolicy* get() __NOEXCEPT\n {\n return policy_.get<ExecutionPolicy>();\n }\n template<class ExecutionPolicy>\n const ExecutionPolicy* get() const __NOEXCEPT\n {\n return policy_.get<ExecutionPolicy>();\n }\n\n \/\/ algorithm dispatch\n \/\/\n template<class... Args>\n auto dispatch(Args&&... args) const ->\n decltype(policy_.dispatch(forward<Args>(args)...))\n {\n return policy_.dispatch(forward<Args>(args)...);\n }\n};\n\n\n}\n}\n}\n}\n\n<commit_msg>fix typeid comparison<commit_after>#pragma once \nnamespace std {\nnamespace experimental {\nnamespace parallel {\ninline namespace v1 {\n\ntemplate<int i, int... js>\nstruct __constexpr_max\n{\n static const int value = i < __constexpr_max<js...>::value ? __constexpr_max<js...>::value : i;\n};\n\n\ntemplate<int i>\nstruct __constexpr_max<i>\n{\n static const int value = i;\n};\n\n\ntemplate<class DefaultPolicy, class... Policies>\nclass __dynamic_execution_policy\n{\n private:\n typedef typename std::aligned_storage<\n __constexpr_max<sizeof(DefaultPolicy), sizeof(Policies)...>::value\n >::type policy_storage_type;\n policy_storage_type policy_storage_;\n const type_info *policy_type_;\n\n template<class ExecutionPolicy>\n bool is_policy() const { return typeid(ExecutionPolicy).hash_code() == policy_type_->hash_code(); }\n\n public: \n\n template<typename ExecutionPolicy>\n __dynamic_execution_policy(const ExecutionPolicy& exec) \n {\n auto ptr = reinterpret_cast<ExecutionPolicy*>(&policy_storage_);\n new (ptr) ExecutionPolicy(exec);\n policy_type_ = &typeid(ExecutionPolicy);\n }\n \/* eg: use default copy\/move ctors, dtors, and assignment ops , should be okay*\/\n\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value, ExecutionPolicy*>::type\n get() __NOEXCEPT\n {\n if (!is_policy<ExecutionPolicy>())\n {\n return nullptr;\n }\n return reinterpret_cast<ExecutionPolicy*>(&policy_storage_);\n }\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value, const ExecutionPolicy*>::type\n get() const __NOEXCEPT\n {\n if (!is_policy<ExecutionPolicy>())\n {\n return nullptr;\n }\n return reinterpret_cast<const ExecutionPolicy*>(&policy_storage_);\n }\n\n const type_info& type() const __NOEXCEPT\n {\n return *policy_type_;\n }\n\n private:\n\n \/\/ algorithm dispatch : loop over policies to detect the one that needs to be dispatched\n \/\/\n template<class...>\n struct policies_placeholder{};\n\n template<class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(policies_placeholder<>&&, Args&&... args) const \n {\n return get<DefaultPolicy>()->dispatch(forward<Args>(args)...);\n }\n\n template<class ExecutionPolicy, class... Execs, class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(policies_placeholder<ExecutionPolicy,Execs...>&&, Args&&... args) const \n {\n if (is_policy<ExecutionPolicy>())\n {\n return get<ExecutionPolicy>()->dispatch(forward<Args>(args)...);\n }\n else\n {\n return dispatch(policies_placeholder<Execs...>{}, forward<Args>(args)...);\n }\n }\n\n public:\n \n \/\/ algorithm dispatch\n \/\/\n template<class... Args>\n decltype(declval<DefaultPolicy>().dispatch(declval<Args>()...))\n dispatch(Args&&... args) const \n {\n return dispatch(policies_placeholder<DefaultPolicy, Policies...>{}, forward<Args>(args)...);\n }\n};\n\nstruct execution_policy\n{\n private:\n __dynamic_execution_policy<\n sequential_execution_policy,\n parallel_execution_policy\n > policy_;\n public:\n \/\/ 2.7.1, execution_policy construct\/assign\n template<class ExecutionPolicy> \n execution_policy(const ExecutionPolicy& policy,\n typename enable_if<is_execution_policy<ExecutionPolicy>::value>::type * = 0) : policy_(policy)\n {}\n\n template<class ExecutionPolicy>\n typename enable_if<is_execution_policy<ExecutionPolicy>::value,execution_policy&>::type\n operator=(const ExecutionPolicy& policy)\n {\n policy_ = policy;\n return *this;\n }\n\n \/\/ 2.7.2, execution_policy object access\n const type_info& type() const __NOEXCEPT\n {\n return policy_.type();\n }\n\n template<class ExecutionPolicy>\n ExecutionPolicy* get() __NOEXCEPT\n {\n return policy_.get<ExecutionPolicy>();\n }\n template<class ExecutionPolicy>\n const ExecutionPolicy* get() const __NOEXCEPT\n {\n return policy_.get<ExecutionPolicy>();\n }\n\n \/\/ algorithm dispatch\n \/\/\n template<class... Args>\n auto dispatch(Args&&... args) const ->\n decltype(policy_.dispatch(forward<Args>(args)...))\n {\n return policy_.dispatch(forward<Args>(args)...);\n }\n};\n\n\n}\n}\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2012-2014 The SSDB Authors. All rights reserved.\nUse of this source code is governed by a BSD-style license that can be\nfound in the LICENSE file.\n*\/\n\/\/ todo r2m adaptation : remove this\n#include \"t_kv.h\"\n#include \"codec\/encode.h\"\n#include \"codec\/decode.h\"\n\nint SSDBImpl::SetGeneric(const std::string &key, const std::string &val, int flags, const int64_t expire, char log_type){\n\tif (expire < 0){\n\t\treturn -1;\n\t}\n\n\tstd::string key_type;\n\tif (type(key, &key_type) == -1){\n\t\treturn -1;\n\t}\n\n\tif ((flags & OBJ_SET_NX) && (key_type != \"none\")){\n\t\treturn -1;\n\t} else if ((flags & OBJ_SET_XX) && (key_type == \"none\")){\n\t\treturn -1;\n\t}\n\n\tTransaction trans(binlogs);\n\n\tif (key_type != \"none\"){\n\t\tDelKeyByType(key, key_type);\n\t}\n\n\tif (expire > 0){\n expiration->set_ttl_internal(key, expire);\n\t}\n\n\tstd::string meta_key = encode_meta_key(key);\n\tstd::string meta_val = encode_kv_val(val);\n\tbinlogs->Put(meta_key, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, meta_key);\n\tleveldb::Status s = binlogs->commit();\n\tif (!s.ok()){\n \/\/todo 时间戳排序回滚fast_keys first_timeout\n\t\treturn -1;\n\t}\n return 0;\n}\n\nint SSDBImpl::multi_set(const std::vector<Bytes> &kvs, int offset, char log_type){\n\tTransaction trans(binlogs);\n\n\tstd::vector<Bytes>::const_iterator it;\n\tit = kvs.begin() + offset;\n\tfor(; it != kvs.end(); it += 2){\n\t\tconst Bytes &key = *it;\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if (ret == 1){\n DelKeyByType(key, key_type);\n }\n\n\t\tconst Bytes &val = *(it + 1);\n\t\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(val.String());\n\t\tbinlogs->Put(buf, meta_val);\n\t\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\t}\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"multi_set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn (kvs.size() - offset)\/2;\n}\n\nint SSDBImpl::multi_del(const std::vector<Bytes> &keys, int offset, char log_type){ \/\/注：redis中不支持该接口\n\tTransaction trans(binlogs);\n\n\tstd::vector<Bytes>::const_iterator it;\n\tit = keys.begin() + offset;\n\tfor(; it != keys.end(); it++){\n\t\tconst Bytes &key = *it;\n\/\/ todo r2m adaptation\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if(ret == 1){\n DelKeyByType(key, key_type);\n }\n\t}\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"multi_del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn keys.size() - offset;\n}\n\nint SSDBImpl::set(const Bytes &key, const Bytes &val, char log_type){\n return SetGeneric(key.String(), val.String(), OBJ_SET_NO_FLAGS, 0);\n}\n\nint SSDBImpl::setnx(const Bytes &key, const Bytes &val, char log_type){\n return SetGeneric(key.String(), val.String(), OBJ_SET_NX, 0);\n}\n\nint SSDBImpl::getset(const Bytes &key, std::string *val, const Bytes &newval, char log_type){\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if (ret == 1 && key_type != \"string\"){\n return -1;\n } else if (ret == 1 && key_type == \"string\"){\n get(key, val);\n }\n\n\tTransaction trans(binlogs);\n\n\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(newval.String());\n\tbinlogs->Put(buf, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn ret;\n}\n\n\nint SSDBImpl::del(const Bytes &key, char log_type){\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n }\n if (key_type == \"string\"){\n KDel(key);\n } else if (key_type == \"hash\"){\n hclear(key);\n } else if (key_type == \"set\"){\n \/\/todo\n } else if (key_type == \"zset\"){\n \/\/todo\n } else if (key_type == \"list\"){\n \/\/todo\n }\n\n\/*\tTransaction trans(binlogs);\n\n\/\/ todo r2m adaptation\n\tstd::string buf = encode_kv_key(key);\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}*\/\n\treturn 1;\n}\n\nint SSDBImpl::incr(const Bytes &key, int64_t by, int64_t *new_val, char log_type){\n\tTransaction trans(binlogs);\n\n\tstd::string old;\n\tint ret = this->get(key, &old);\n\tif(ret == -1){\n\t\treturn -1;\n\t}else if(ret == 0){\n\t\t*new_val = by;\n\t}else{\n int64_t oldvalue = str_to_int64(old);\n if(errno != 0){\n return 0;\n }\n if ((by < 0 && oldvalue < 0 && by < (LLONG_MIN-oldvalue)) ||\n (by > 0 && oldvalue > 0 && by > (LLONG_MAX-oldvalue))) {\n return 0;\n }\n\t\t*new_val = oldvalue + by;\n\t}\n\n\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(str(*new_val));\n\tbinlogs->Put(buf, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn 1;\n}\n\nint SSDBImpl::get(const Bytes &key, std::string *val){\n\tstd::string buf = encode_meta_key(key.String());\n std::string en_val;\n\n\tleveldb::Status s = ldb->Get(leveldb::ReadOptions(), buf, &en_val);\n\tif(s.IsNotFound()){\n\t\treturn 0;\n\t}\n\tif(!s.ok()){\n\t\tlog_error(\"get error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n KvMetaVal kv;\n if (kv.DecodeMetaVal(en_val) == -1){\n return -1;\n } else{\n *val = kv.value;\n }\n\treturn 1;\n}\n\n\/\/ todo r2m adaptation\nKIterator* SSDBImpl::scan(const Bytes &start, const Bytes &end, uint64_t limit){\n\tstd::string key_start, key_end;\n\tkey_start = encode_kv_key(start);\n\tif(end.empty()){\n\t\tkey_end = \"\";\n\t}else{\n\t\tkey_end = encode_kv_key(end);\n\t}\n\t\/\/dump(key_start.data(), key_start.size(), \"scan.start\");\n\t\/\/dump(key_end.data(), key_end.size(), \"scan.end\");\n\n\treturn new KIterator(this->iterator(key_start, key_end, limit));\n}\n\n\/\/ todo r2m adaptation\nKIterator* SSDBImpl::rscan(const Bytes &start, const Bytes &end, uint64_t limit){\n\tstd::string key_start, key_end;\n\n\tkey_start = encode_kv_key(start);\n\tif(start.empty()){\n\t\tkey_start.append(1, 255);\n\t}\n\tif(!end.empty()){\n\t\tkey_end = encode_kv_key(end);\n\t}\n\t\/\/dump(key_start.data(), key_start.size(), \"scan.start\");\n\t\/\/dump(key_end.data(), key_end.size(), \"scan.end\");\n\n\treturn new KIterator(this->rev_iterator(key_start, key_end, limit));\n}\n\nint SSDBImpl::setbit(const Bytes &key, int bitoffset, int on, char log_type){\n\tif(key.empty()){\n\t\tlog_error(\"empty key!\");\n\t\treturn 0;\n\t}\n\tTransaction trans(binlogs);\n\t\n\tstd::string val;\n\tint ret = this->get(key, &val);\n\tif(ret == -1){\n\t\treturn -1;\n\t}\n\t\n\tint len = bitoffset \/ 8;\n\tint bit = bitoffset % 8;\n\tif(len >= val.size()){\n\t\tval.resize(len + 1, 0);\n\t}\n\tint orig = val[len] & (1 << bit);\n\tif(on == 1){\n\t\tval[len] |= (1 << bit);\n\t}else{\n\t\tval[len] &= ~(1 << bit);\n\t}\n\n\/\/ todo r2m adaptation\n\tstd::string buf = encode_kv_key(key);\n\tbinlogs->Put(buf, val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn orig;\n}\n\nint SSDBImpl::getbit(const Bytes &key, int bitoffset){\n\tstd::string val;\n\tint ret = this->get(key, &val);\n\tif(ret == -1){\n\t\treturn -1;\n\t}\n\t\n\tint len = bitoffset \/ 8;\n\tint bit = bitoffset % 8;\n\tif(len >= val.size()){\n\t\treturn 0;\n\t}\n\treturn (val[len] & (1 << bit)) == 0? 0 : 1;\n}\n\n\/*\n * private API\n *\/\nint SSDBImpl::DelKeyByType(const Bytes &key, const std::string &type){\n\t\/\/todo 内部接口，保证操作的原子性，调用No Commit接口\n\tint ret = 0;\n\tif (\"string\" == type){\n\t\tret = KDelNoLock(key);\n\t} else if (\"hash\" == type){\n\/\/\t\ts = HDelKeyNoLock(key, &res);\n\t} else if (\"list\" == type){\n\/\/\t\ts = LDelKeyNoLock(key, &res);\n\t} else if (\"set\" == type){\n\/\/\t\ts = SDelKeyNoLock(key, &res);\n\t} else if (\"zset\" == type){\n\/\/\t\ts = ZDelKeyNoLock(key, &res);\n\t}\n\n\treturn 0;\n}\n\nint SSDBImpl::KDel(const Bytes &key, char log_type){\n Transaction trans(binlogs);\n\n std::string buf = encode_meta_key(key.String());\n binlogs->Delete(buf);\n binlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\n leveldb::Status s = binlogs->commit();\n if(!s.ok()){\n log_error(\"set error: %s\", s.ToString().c_str());\n return -1;\n }\n return 1;\n}\n\nint SSDBImpl::KDelNoLock(const Bytes &key, char log_type){\n\tstd::string buf = encode_meta_key(key.String());\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\treturn 0;\n}\n\n\/*\n * General API\n *\/\nint SSDBImpl::type(const Bytes &key, std::string *type){\n\t*type = \"none\";\n int ret = 0;\n\tstd::string val;\n\tstd::string meta_key = encode_meta_key(key.String());\n\tleveldb::Status s = ldb->Get(leveldb::ReadOptions(), meta_key, &val);\n\tif(s.IsNotFound()){\n\t\treturn 0;\n\t}\n\tif(!s.ok()){\n\t\tlog_error(\"get error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\n\tif (val[0] == DataType::KV){\n\t\t*type = \"string\";\n ret = 1;\n\t} else if (val[0] == DataType::HSIZE){\n\t\tHashMetaVal hv;\n\t\tif (hv.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (hv.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"hash\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::SSIZE){\n\t\tSetMetaVal sv;\n\t\tif (sv.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (sv.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"set\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::ZSIZE){\n\t\tZSetMetaVal zs;\n\t\tif (zs.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (zs.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"zset\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::LSZIE){\n\t\tListMetaVal ls;\n\t\tif (ls.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (ls.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"list\";\n ret = 1;\n\t\t}\n\t} else{\n\t\treturn -1;\n\t}\n\n\treturn ret;\n}\n<commit_msg>实现kv setbit\/getbit API<commit_after>\/*\nCopyright (c) 2012-2014 The SSDB Authors. All rights reserved.\nUse of this source code is governed by a BSD-style license that can be\nfound in the LICENSE file.\n*\/\n\/\/ todo r2m adaptation : remove this\n#include \"t_kv.h\"\n#include \"codec\/encode.h\"\n#include \"codec\/decode.h\"\n\nint SSDBImpl::SetGeneric(const std::string &key, const std::string &val, int flags, const int64_t expire, char log_type){\n\tif (expire < 0){\n\t\treturn -1;\n\t}\n\n\tstd::string key_type;\n\tif (type(key, &key_type) == -1){\n\t\treturn -1;\n\t}\n\n\tif ((flags & OBJ_SET_NX) && (key_type != \"none\")){\n\t\treturn -1;\n\t} else if ((flags & OBJ_SET_XX) && (key_type == \"none\")){\n\t\treturn -1;\n\t}\n\n\tTransaction trans(binlogs);\n\n\tif (key_type != \"none\"){\n\t\tDelKeyByType(key, key_type);\n\t}\n\n\tif (expire > 0){\n expiration->set_ttl_internal(key, expire);\n\t}\n\n\tstd::string meta_key = encode_meta_key(key);\n\tstd::string meta_val = encode_kv_val(val);\n\tbinlogs->Put(meta_key, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, meta_key);\n\tleveldb::Status s = binlogs->commit();\n\tif (!s.ok()){\n \/\/todo 时间戳排序回滚fast_keys first_timeout\n\t\treturn -1;\n\t}\n return 0;\n}\n\nint SSDBImpl::multi_set(const std::vector<Bytes> &kvs, int offset, char log_type){\n\tTransaction trans(binlogs);\n\n\tstd::vector<Bytes>::const_iterator it;\n\tit = kvs.begin() + offset;\n\tfor(; it != kvs.end(); it += 2){\n\t\tconst Bytes &key = *it;\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if (ret == 1){\n DelKeyByType(key, key_type);\n }\n\n\t\tconst Bytes &val = *(it + 1);\n\t\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(val.String());\n\t\tbinlogs->Put(buf, meta_val);\n\t\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\t}\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"multi_set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn (kvs.size() - offset)\/2;\n}\n\nint SSDBImpl::multi_del(const std::vector<Bytes> &keys, int offset, char log_type){ \/\/注：redis中不支持该接口\n\tTransaction trans(binlogs);\n\n\tstd::vector<Bytes>::const_iterator it;\n\tit = keys.begin() + offset;\n\tfor(; it != keys.end(); it++){\n\t\tconst Bytes &key = *it;\n\/\/ todo r2m adaptation\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if(ret == 1){\n DelKeyByType(key, key_type);\n }\n\t}\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"multi_del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn keys.size() - offset;\n}\n\nint SSDBImpl::set(const Bytes &key, const Bytes &val, char log_type){\n return SetGeneric(key.String(), val.String(), OBJ_SET_NO_FLAGS, 0);\n}\n\nint SSDBImpl::setnx(const Bytes &key, const Bytes &val, char log_type){\n return SetGeneric(key.String(), val.String(), OBJ_SET_NX, 0);\n}\n\nint SSDBImpl::getset(const Bytes &key, std::string *val, const Bytes &newval, char log_type){\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n } else if (ret == 1 && key_type != \"string\"){\n return -1;\n } else if (ret == 1 && key_type == \"string\"){\n get(key, val);\n }\n\n\tTransaction trans(binlogs);\n\n\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(newval.String());\n\tbinlogs->Put(buf, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn ret;\n}\n\n\nint SSDBImpl::del(const Bytes &key, char log_type){\n std::string key_type;\n int ret = type(key, &key_type);\n if (ret == -1){\n return -1;\n }\n if (key_type == \"string\"){\n KDel(key);\n } else if (key_type == \"hash\"){\n hclear(key);\n } else if (key_type == \"set\"){\n \/\/todo\n } else if (key_type == \"zset\"){\n \/\/todo\n } else if (key_type == \"list\"){\n \/\/todo\n }\n\n\/*\tTransaction trans(binlogs);\n\n\/\/ todo r2m adaptation\n\tstd::string buf = encode_kv_key(key);\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}*\/\n\treturn 1;\n}\n\nint SSDBImpl::incr(const Bytes &key, int64_t by, int64_t *new_val, char log_type){\n\tTransaction trans(binlogs);\n\n\tstd::string old;\n\tint ret = this->get(key, &old);\n\tif(ret == -1){\n\t\treturn -1;\n\t}else if(ret == 0){\n\t\t*new_val = by;\n\t}else{\n int64_t oldvalue = str_to_int64(old);\n if(errno != 0){\n return 0;\n }\n if ((by < 0 && oldvalue < 0 && by < (LLONG_MIN-oldvalue)) ||\n (by > 0 && oldvalue > 0 && by > (LLONG_MAX-oldvalue))) {\n return 0;\n }\n\t\t*new_val = oldvalue + by;\n\t}\n\n\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(str(*new_val));\n\tbinlogs->Put(buf, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"del error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn 1;\n}\n\nint SSDBImpl::get(const Bytes &key, std::string *val){\n\tstd::string buf = encode_meta_key(key.String());\n std::string en_val;\n\n\tleveldb::Status s = ldb->Get(leveldb::ReadOptions(), buf, &en_val);\n\tif(s.IsNotFound()){\n\t\treturn 0;\n\t}\n\tif(!s.ok()){\n\t\tlog_error(\"get error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n KvMetaVal kv;\n if (kv.DecodeMetaVal(en_val) == -1){\n return -1;\n } else{\n *val = kv.value;\n }\n\treturn 1;\n}\n\n\/\/ todo r2m adaptation\nKIterator* SSDBImpl::scan(const Bytes &start, const Bytes &end, uint64_t limit){\n\tstd::string key_start, key_end;\n\tkey_start = encode_kv_key(start);\n\tif(end.empty()){\n\t\tkey_end = \"\";\n\t}else{\n\t\tkey_end = encode_kv_key(end);\n\t}\n\t\/\/dump(key_start.data(), key_start.size(), \"scan.start\");\n\t\/\/dump(key_end.data(), key_end.size(), \"scan.end\");\n\n\treturn new KIterator(this->iterator(key_start, key_end, limit));\n}\n\n\/\/ todo r2m adaptation\nKIterator* SSDBImpl::rscan(const Bytes &start, const Bytes &end, uint64_t limit){\n\tstd::string key_start, key_end;\n\n\tkey_start = encode_kv_key(start);\n\tif(start.empty()){\n\t\tkey_start.append(1, 255);\n\t}\n\tif(!end.empty()){\n\t\tkey_end = encode_kv_key(end);\n\t}\n\t\/\/dump(key_start.data(), key_start.size(), \"scan.start\");\n\t\/\/dump(key_end.data(), key_end.size(), \"scan.end\");\n\n\treturn new KIterator(this->rev_iterator(key_start, key_end, limit));\n}\n\nint SSDBImpl::setbit(const Bytes &key, int bitoffset, int on, char log_type){\n\tif(key.empty()){\n\t\tlog_error(\"empty key!\");\n\t\treturn 0;\n\t}\n\tTransaction trans(binlogs);\n\t\n\tstd::string val;\n\tint ret = this->get(key, &val);\n\tif(ret == -1){\n\t\treturn -1;\n\t}\n\n int len = bitoffset >> 3;\n int bit = 7 - (bitoffset & 0x7);\n\tif(len >= val.size()){\n\t\tval.resize(len + 1, 0);\n\t}\n\tint orig = val[len] & (1 << bit);\n\tif(on == 1){\n\t\tval[len] |= (1 << bit);\n\t}else{\n\t\tval[len] &= ~(1 << bit);\n\t}\n\n\tstd::string buf = encode_meta_key(key.String());\n std::string meta_val = encode_kv_val(val);\n\tbinlogs->Put(buf, meta_val);\n\tbinlogs->add_log(log_type, BinlogCommand::KSET, buf);\n\tleveldb::Status s = binlogs->commit();\n\tif(!s.ok()){\n\t\tlog_error(\"set error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\treturn orig;\n}\n\nint SSDBImpl::getbit(const Bytes &key, int bitoffset){\n\tstd::string val;\n\tint ret = this->get(key, &val);\n\tif(ret == -1){\n\t\treturn -1;\n\t}\n\n int len = bitoffset >> 3;\n int bit = 7 - (bitoffset & 0x7);\n\tif(len >= val.size()){\n\t\treturn 0;\n\t}\n\treturn (val[len] & (1 << bit)) == 0? 0 : 1;\n}\n\n\/*\n * private API\n *\/\nint SSDBImpl::DelKeyByType(const Bytes &key, const std::string &type){\n\t\/\/todo 内部接口，保证操作的原子性，调用No Commit接口\n\tint ret = 0;\n\tif (\"string\" == type){\n\t\tret = KDelNoLock(key);\n\t} else if (\"hash\" == type){\n\/\/\t\ts = HDelKeyNoLock(key, &res);\n\t} else if (\"list\" == type){\n\/\/\t\ts = LDelKeyNoLock(key, &res);\n\t} else if (\"set\" == type){\n\/\/\t\ts = SDelKeyNoLock(key, &res);\n\t} else if (\"zset\" == type){\n\/\/\t\ts = ZDelKeyNoLock(key, &res);\n\t}\n\n\treturn 0;\n}\n\nint SSDBImpl::KDel(const Bytes &key, char log_type){\n Transaction trans(binlogs);\n\n std::string buf = encode_meta_key(key.String());\n binlogs->Delete(buf);\n binlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\n leveldb::Status s = binlogs->commit();\n if(!s.ok()){\n log_error(\"set error: %s\", s.ToString().c_str());\n return -1;\n }\n return 1;\n}\n\nint SSDBImpl::KDelNoLock(const Bytes &key, char log_type){\n\tstd::string buf = encode_meta_key(key.String());\n\tbinlogs->Delete(buf);\n\tbinlogs->add_log(log_type, BinlogCommand::KDEL, buf);\n\treturn 0;\n}\n\n\/*\n * General API\n *\/\nint SSDBImpl::type(const Bytes &key, std::string *type){\n\t*type = \"none\";\n int ret = 0;\n\tstd::string val;\n\tstd::string meta_key = encode_meta_key(key.String());\n\tleveldb::Status s = ldb->Get(leveldb::ReadOptions(), meta_key, &val);\n\tif(s.IsNotFound()){\n\t\treturn 0;\n\t}\n\tif(!s.ok()){\n\t\tlog_error(\"get error: %s\", s.ToString().c_str());\n\t\treturn -1;\n\t}\n\n\tif (val[0] == DataType::KV){\n\t\t*type = \"string\";\n ret = 1;\n\t} else if (val[0] == DataType::HSIZE){\n\t\tHashMetaVal hv;\n\t\tif (hv.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (hv.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"hash\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::SSIZE){\n\t\tSetMetaVal sv;\n\t\tif (sv.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (sv.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"set\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::ZSIZE){\n\t\tZSetMetaVal zs;\n\t\tif (zs.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (zs.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"zset\";\n ret = 1;\n\t\t}\n\t} else if (val[0] == DataType::LSZIE){\n\t\tListMetaVal ls;\n\t\tif (ls.DecodeMetaVal(val) == -1){\n\t\t\treturn -1;\n\t\t}\n\t\tif (ls.del == KEY_ENABLED_MASK){\n\t\t\t*type = \"list\";\n ret = 1;\n\t\t}\n\t} else{\n\t\treturn -1;\n\t}\n\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"maths.hpp\"\n\nnamespace stats\n{\n\t\/\/ normal distribution\n\n\ttemplate <typename float_t> class norm\n\t{\n\t\tfloat_t mu, sigma, unit;\n\t\t\n\t public:\n\t \n\t \tnorm(float_t mu=0, float_t sigma=1)\n\t \t{\n\t \t \tunit = maths::sqrt2pi*sigma;\n\t \t \tthis->sigma = sigma;\n\t \t\tthis->mu = mu;\n\t \t}\n\t \t\n\t \tfloat_t pdf(float_t x)\n\t \t{\n\t \t\tfloat_t z = (x - mu)\/sigma;\n\t \t\treturn maths::exp(-z*z\/2)\/unit;\n\t \t}\n\t \t\n\t \tfloat_t cdf(float_t x)\n\t \t{\n\t \t\tfloat_t z = (x - mu)\/sigma;\n\t \t\treturn (1 + maths::erf(z\/maths::sqrt2))\/2\/sigma;\n\t \t}\n\t};\n\n\ttemplate <typename float_t> float_t dnorm(float_t x, float_t mu=0, float_t sigma=1)\n\t{\n\t\treturn norm<float_t>(mu, sigma).pdf(x);\n\t}\n\n\ttemplate <typename float_t> float_t pnorm(float_t x, float_t mu=0, float_t sigma=1)\n\t{\n\t\treturn norm<float_t>(mu, sigma).cdf(x);\n\t}\n\n}; \/\/ namespace stats\n\n<commit_msg>Added gamma distribution pdf and cdf<commit_after>#include \"maths.hpp\"\n\nnamespace stats\n{\n\t\/\/ normal distribution\n\n\ttemplate <typename float_t>\n\tfloat_t dnorm(float_t x, float_t mu=0, float_t sigma=1)\n\t{\n\t\tfloat_t z = (x - mu)\/sigma;\n\t\treturn maths::exp(-z*z\/2)\/maths::sqrt2pi\/sigma;\n\t}\n\n\ttemplate <typename float_t>\n\tfloat_t pnorm(float_t x, float_t mu=0, float_t sigma=1)\n\t{\n\t\tfloat_t z = (x - mu)\/sigma;\n\t\treturn (1 + maths::erf(z\/maths::sqrt2))\/2\/sigma;\n\t}\n\n\t\/\/ gamma distribution\n\n\ttemplate <typename float_t>\n\tfloat_t dgamma(float_t x, float_t a, float_t b)\n\t{\n\t\treturn maths::pow(x*b, a)*maths::exp(-x*b)\/maths::tgamma(a)\/x;\n\t}\n\n\ttemplate <typename float_t>\n\tfloat_t pgamma(float_t x, float_t a, float_t b)\n\t{\n\t\treturn maths::igamma(a, x*b)\/maths::tgamma(a);\n\t}\n\n}; \/\/ namespace stats\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_FUN_ATANH_HPP\n#define STAN_MATH_PRIM_FUN_ATANH_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/is_nan.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the inverse hyperbolic tangent of the specified value.\n * An argument of -1 returns negative infinity and an argument of 1\n * returns infinity.\n * Returns nan for nan argument.\n *\n * @param[in] x Argument.\n * @return Inverse hyperbolic tangent of the argument.\n * @throw std::domain_error If argument is not in [-1, 1].\n *\/\ninline double atanh(double x) {\n if (is_nan(x)) {\n return x;\n } else {\n check_bounded(\"atanh\", \"x\", x, -1.0, 1.0);\n return std::atanh(x);\n }\n}\n\n\/**\n * Integer version of atanh.\n *\n * @param[in] x Argument.\n * @return Inverse hyperbolic tangent of the argument.\n * @throw std::domain_error If argument is less than 1.\n *\/\ninline double atanh(int x) {\n if (is_nan(x)) {\n return x;\n } else {\n check_bounded(\"atanh\", \"x\", x, -1, 1);\n return std::atanh(x);\n }\n}\n\n\/**\n * Structure to wrap atanh() so it can be vectorized.\n *\/\nstruct atanh_fun {\n \/**\n * Return the inverse hyperbolic tangent of the specified argument.\n *\n * @tparam T type of argument\n * @param x argument\n * @return Inverse hyperbolic tangent of the argument.\n *\/\n template <typename T>\n static inline T fun(const T& x) {\n return atanh(x);\n }\n};\n\n\/**\n * Return the elementwise application of <code>atanh()<\/code> to\n * specified argument container. The return type promotes the\n * underlying scalar argument type to double if it is an integer,\n * and otherwise is the argument type.\n *\n * @tparam T type of container\n * @param x container\n * @return Elementwise atanh of members of container.\n *\/\ntemplate <typename T>\ninline auto atanh(const T& x) {\n return apply_scalar_unary<atanh_fun, T>::apply(x);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<commit_msg>remove nan check for atanh(int)<commit_after>#ifndef STAN_MATH_PRIM_FUN_ATANH_HPP\n#define STAN_MATH_PRIM_FUN_ATANH_HPP\n\n#include <stan\/math\/prim\/meta.hpp>\n#include <stan\/math\/prim\/err.hpp>\n#include <stan\/math\/prim\/fun\/is_nan.hpp>\n#include <cmath>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Return the inverse hyperbolic tangent of the specified value.\n * An argument of -1 returns negative infinity and an argument of 1\n * returns infinity.\n * Returns nan for nan argument.\n *\n * @param[in] x Argument.\n * @return Inverse hyperbolic tangent of the argument.\n * @throw std::domain_error If argument is not in [-1, 1].\n *\/\ninline double atanh(double x) {\n if (is_nan(x)) {\n return x;\n } else {\n check_bounded(\"atanh\", \"x\", x, -1.0, 1.0);\n return std::atanh(x);\n }\n}\n\n\/**\n * Integer version of atanh.\n *\n * @param[in] x Argument.\n * @return Inverse hyperbolic tangent of the argument.\n * @throw std::domain_error If argument is less than 1.\n *\/\ninline double atanh(int x) {\n check_bounded(\"atanh\", \"x\", x, -1, 1);\n return std::atanh(x);\n}\n\n\/**\n * Structure to wrap atanh() so it can be vectorized.\n *\/\nstruct atanh_fun {\n \/**\n * Return the inverse hyperbolic tangent of the specified argument.\n *\n * @tparam T type of argument\n * @param x argument\n * @return Inverse hyperbolic tangent of the argument.\n *\/\n template <typename T>\n static inline T fun(const T& x) {\n return atanh(x);\n }\n};\n\n\/**\n * Return the elementwise application of <code>atanh()<\/code> to\n * specified argument container. The return type promotes the\n * underlying scalar argument type to double if it is an integer,\n * and otherwise is the argument type.\n *\n * @tparam T type of container\n * @param x container\n * @return Elementwise atanh of members of container.\n *\/\ntemplate <typename T>\ninline auto atanh(const T& x) {\n return apply_scalar_unary<atanh_fun, T>::apply(x);\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Some more fixes<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"common\/network\/listen_socket_impl.h\"\n\n#include <sys\/socket.h>\n#include <sys\/types.h>\n\n#include <string>\n\n#include \"envoy\/common\/exception.h\"\n\n#include \"common\/common\/assert.h\"\n#include \"common\/common\/fmt.h\"\n#include \"common\/network\/address_impl.h\"\n#include \"common\/network\/utility.h\"\n\nnamespace Envoy {\nnamespace Network {\n\nvoid ListenSocketImpl::doBind() {\n const Api::SysCallIntResult result = local_address_->bind(fd_);\n if (result.rc_ == -1) {\n close();\n throw EnvoyException(\n fmt::format(\"cannot bind '{}': {}\", local_address_->asString(), strerror(result.errno_)));\n }\n if (local_address_->type() == Address::Type::Ip && local_address_->ip()->port() == 0) {\n \/\/ If the port we bind is zero, then the OS will pick a free port for us (assuming there are\n \/\/ any), and we need to find out the port number that the OS picked.\n local_address_ = Address::addressFromFd(fd_);\n }\n}\n\nvoid ListenSocketImpl::setListenSocketOptions(const Network::Socket::OptionsSharedPtr& options) {\n if (!Network::Socket::applyOptions(options, *this,\n envoy::api::v2::core::SocketOption::STATE_PREBIND)) {\n throw EnvoyException(\"ListenSocket: Setting socket options failed\");\n }\n}\n\nvoid ListenSocketImpl::setupSocket(const Network::Socket::OptionsSharedPtr& options,\n bool bind_to_port) {\n setListenSocketOptions(options);\n\n if (bind_to_port) {\n doBind();\n }\n}\n\ntemplate <>\nvoid NetworkListenSocket<\n NetworkSocketTrait<Address::SocketType::Stream>>::setPrebindSocketOptions() {\n \/\/ TODO(htuch): This might benefit from moving to SocketOptionImpl.\n int on = 1;\n int rc = setsockopt(fd_, SOL_SOCKET, SO_REUSEADDR, &on, sizeof(on));\n RELEASE_ASSERT(rc != -1, \"\");\n}\n\ntemplate <>\nvoid NetworkListenSocket<\n NetworkSocketTrait<Address::SocketType::Datagram>>::setPrebindSocketOptions() {}\n\nUdsListenSocket::UdsListenSocket(const Address::InstanceConstSharedPtr& address)\n : ListenSocketImpl(address->socket(Address::SocketType::Stream), address) {\n RELEASE_ASSERT(fd_ != -1, \"\");\n doBind();\n}\n\nUdsListenSocket::UdsListenSocket(int fd, const Address::InstanceConstSharedPtr& address)\n : ListenSocketImpl(fd, address) {}\n\n} \/\/ namespace Network\n} \/\/ namespace Envoy\n<commit_msg>Use os_sys_calls_impl for setting TCP socket options (#5149)<commit_after>#include \"common\/network\/listen_socket_impl.h\"\n\n#include <sys\/socket.h>\n#include <sys\/types.h>\n\n#include <string>\n\n#include \"envoy\/common\/exception.h\"\n\n#include \"common\/api\/os_sys_calls_impl.h\"\n#include \"common\/common\/assert.h\"\n#include \"common\/common\/fmt.h\"\n#include \"common\/network\/address_impl.h\"\n#include \"common\/network\/utility.h\"\n\nnamespace Envoy {\nnamespace Network {\n\nvoid ListenSocketImpl::doBind() {\n const Api::SysCallIntResult result = local_address_->bind(fd_);\n if (result.rc_ == -1) {\n close();\n throw EnvoyException(\n fmt::format(\"cannot bind '{}': {}\", local_address_->asString(), strerror(result.errno_)));\n }\n if (local_address_->type() == Address::Type::Ip && local_address_->ip()->port() == 0) {\n \/\/ If the port we bind is zero, then the OS will pick a free port for us (assuming there are\n \/\/ any), and we need to find out the port number that the OS picked.\n local_address_ = Address::addressFromFd(fd_);\n }\n}\n\nvoid ListenSocketImpl::setListenSocketOptions(const Network::Socket::OptionsSharedPtr& options) {\n if (!Network::Socket::applyOptions(options, *this,\n envoy::api::v2::core::SocketOption::STATE_PREBIND)) {\n throw EnvoyException(\"ListenSocket: Setting socket options failed\");\n }\n}\n\nvoid ListenSocketImpl::setupSocket(const Network::Socket::OptionsSharedPtr& options,\n bool bind_to_port) {\n setListenSocketOptions(options);\n\n if (bind_to_port) {\n doBind();\n }\n}\n\ntemplate <>\nvoid NetworkListenSocket<\n NetworkSocketTrait<Address::SocketType::Stream>>::setPrebindSocketOptions() {\n\n int on = 1;\n auto& os_syscalls = Api::OsSysCallsSingleton::get();\n Api::SysCallIntResult status =\n os_syscalls.setsockopt(fd_, SOL_SOCKET, SO_REUSEADDR, &on, sizeof(on));\n RELEASE_ASSERT(status.rc_ != -1, \"failed to set SO_REUSEADDR socket option\");\n}\n\ntemplate <>\nvoid NetworkListenSocket<\n NetworkSocketTrait<Address::SocketType::Datagram>>::setPrebindSocketOptions() {}\n\nUdsListenSocket::UdsListenSocket(const Address::InstanceConstSharedPtr& address)\n : ListenSocketImpl(address->socket(Address::SocketType::Stream), address) {\n RELEASE_ASSERT(fd_ != -1, \"\");\n doBind();\n}\n\nUdsListenSocket::UdsListenSocket(int fd, const Address::InstanceConstSharedPtr& address)\n : ListenSocketImpl(fd, address) {}\n\n} \/\/ namespace Network\n} \/\/ namespace Envoy\n<|endoftext|>"} {"text":"<commit_before>\n#include <general\/nmspc_iter.h>\n#include <tools\/common\/log.h>\n#include <tools\/common\/prof.h>\n#include <tools\/finite\/opt-internal\/report.h>\n#include <tools\/finite\/opt_mps.h>\n\n\/* clang-format off *\/\nvoid tools::finite::opt::internal::reports::print_bfgs_report(){\n if (tools::log->level() > spdlog::level::debug) return;\n if (bfgs_log.empty()) return;\n std::string format_hdr = \"{:<52} {:<7} {:<7} {:<20} {:<12} {:<18} {:<18} {:<5} {:<7} {:<8} {:<8} {:<18} {:<18}\";\n std::string format_num = \"- {:<50} {:<7} {:<7} {:<20.15f} {:<12.8f} {:<18.15f} {:<18.15f} {:<5} {:<7} {:<8.2e} {:<8.2e} {:<18.3f} {:<18.3f}\";\n tools::log->debug(format_hdr.c_str(),\n \"Optimization report\",\n \"size\",\n \"space\",\n \"energy\/L\",\n \"log₁₀ var\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"overlap\",\n \"norm\",\n \"iter\",\n \"counter\",\n \"|Δf|\",\n \"|∇f|∞\",\n \"Elapsed time [ms]\",\n \"Time per count [ms]\");\n\n for(auto &entry : bfgs_log){\n tools::log->debug(format_num.c_str(),\n entry.description, entry.size,\n entry.space, entry.energy,\n std::log10(entry.variance),\n entry.overlap,entry.norm,\n entry.iter, entry.counter,\n entry.delta_f, entry.grad_max_norm,\n entry.time*1000,\n entry.time*1000.0\/std::max(1.0,static_cast<double>(entry.counter)));\n }\n bfgs_log.clear();\n}\n\nvoid tools::finite::opt::internal::reports::print_eigs_report(){\n if (tools::log->level() > spdlog::level::debug) return;\n if (eigs_log.empty()) return;\n std::string format_hdr = \"- {:<5} {:<20} {:<20} {:<20} {:<12} {:<12} {:<12} {:<6}\";\n std::string format_num = \"- {:<5} {:<20.15f} {:<20.15f} {:<20.8f} {:<12.3f} {:<12.3f} {:<12.3f} {:<6}\";\n tools::log->debug(format_hdr.c_str(),\n \"nev\",\n \"max <θ_i|θ>\",\n \"min <θ_i|θ>\",\n \"log₁₀(1-Σ|<θ_i|θ>|²)\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"Eig Time[ms]\",\n \"Ham Time[ms]\",\n \"LU Time[ms]\",\n \"Steps\" );\n\n for(auto &entry : eigs_log){\n tools::log->debug(format_num.c_str(),\n entry.nev,\n entry.max_olap,\n entry.min_olap,\n entry.eps ,\n entry.eig_time * 1000,\n entry.ham_time * 1000,\n entry.lu_time * 1000,\n entry.steps\n );\n }\n eigs_log.clear();\n}\n\n\n\n\nvoid tools::finite::opt::internal::reports::print_time_report(){\n if (tools::log->level() > spdlog::level::trace) return;\n if(time_log.empty()) return;\n std::string format_hdr = \"LBFGS Time report [ms] {:<10} {:<10} {:<10} {:<10} {:<10} {:<10} {:<10}\";\n std::string format_num = \" {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f}\";\n tools::log->trace(format_hdr.c_str(),\n \"<ψ|H²|ψ>\",\n \"<ψ|H|ψ>\",\n \"H²|ψ>\",\n \"H|ψ>\",\n \"sum\",\n \"step\",\n \"l-bfgs\");\n for(auto &entry : time_log){\n tools::log->trace(format_num.c_str(),\n 1000 * entry.vH2v,\n 1000 * entry.vHv,\n 1000 * entry.vH2,\n 1000 * entry.vH,\n 1000 *(entry.vH2v\n + entry.vHv\n + entry.vH2\n + entry.vH),\n 1000 * entry.step,\n 1000 * entry.bfgs);\n }\n time_log.clear();\n}\n\nvoid tools::finite::opt::internal::reports::print_krylov_report(std::optional<size_t> max_entries){\n if (tools::log->level() > spdlog::level::debug) return;\n if (krylov_log.empty()) return;\n std::string format_hdr = \"{:<52} {:<7} {:<4} {:<4} {:<8} {:<22} {:<22} {:<12} {:<18} {:<18} {:<5} {:<7} {:<18} {:<18}\";\n std::string format_num = \"- {:<50} {:<7} {:<4} {:<4} {:<8.2e} {:<22.15f} {:<22.15f} {:<12.8f} {:<18.15f} {:<18.15f} {:<5} {:<7} {:<18.3f} {:<18.3f}\";\n tools::log->debug(format_hdr.c_str(),\n \"Optimization report\",\n \"size\",\n \"nev\",\n \"ncv\",\n \"tol\",\n \"energy\/L\",\n \"eigval\",\n \"log₁₀ var\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"overlap\",\n \"norm\",\n \"iter\",\n \"counter\",\n \"Elapsed time [ms]\",\n \"Time per count [ms]\");\n\n for(const auto &[idx,entry] : iter::enumerate(krylov_log)){\n if(max_entries and max_entries.value() <= idx) break;\n tools::log->debug(format_num.c_str(),\n entry.description,\n entry.size, entry.nev, entry.ncv, entry.tol,\n entry.energy,entry.eigval,\n std::log10(entry.variance),\n entry.overlap,entry.norm,\n entry.iter, entry.counter,\n entry.time*1000,\n entry.time*1000.0\/std::max(1.0,static_cast<double>(entry.counter)));\n }\n krylov_log.clear();\n}\n\n\/* clang-format on *\/\nvoid tools::finite::opt::internal::reports::bfgs_add_entry(const std::string &description, long size, long space, double energy, double variance,\n double overlap, double norm, double delta_f, double grad_norm, size_t iter, size_t counter,\n double time) {\n if(tools::log->level() > spdlog::level::debug) return;\n bfgs_log.push_back({description, size, space, energy, variance, overlap, norm, delta_f, grad_norm, iter, counter, time});\n}\nvoid tools::finite::opt::internal::reports::bfgs_add_entry(const std::string &mode, const std::string &tag, const opt_mps &mps, std::optional<long> space) {\n if(tools::log->level() > spdlog::level::debug) return;\n if(not space) space = mps.get_tensor().size();\n std::string description = fmt::format(\"{:<8} {:<16} {}\", mode, mps.get_name(), tag);\n bfgs_log.push_back(bfgs_entry{description, mps.get_tensor().size(), space.value(), mps.get_energy_per_site(), mps.get_variance(), mps.get_overlap(),\n mps.get_norm(), mps.get_delta_f(), mps.get_grad_norm(), mps.get_iter(), mps.get_counter(), mps.get_time()});\n}\n\nvoid tools::finite::opt::internal::reports::time_add_dir_entry() {\n if(tools::log->level() > spdlog::level::trace) return;\n time_log.push_back({tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH2v\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vHv\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH2\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_bfgs\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_step\"]->get_last_interval()});\n}\nvoid tools::finite::opt::internal::reports::time_add_sub_entry() {\n if(tools::log->level() > spdlog::level::trace) return;\n time_log.push_back({tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH2v\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vHv\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH2\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_bfgs\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_step\"]->get_last_interval()});\n}\nvoid tools::finite::opt::internal::reports::eigs_add_entry(long nev, double max_olap, double min_olap, double eps, double eig_time, double ham_time,\n double lu_time, size_t steps) {\n if(tools::log->level() > spdlog::level::debug) return;\n eigs_log.push_back({nev, max_olap, min_olap, eps, eig_time, ham_time, lu_time, steps});\n}\n\nvoid tools::finite::opt::internal::reports::krylov_add_entry(const opt_mps &mps) {\n if(tools::log->level() > spdlog::level::debug) return;\n std::string description = fmt::format(\"{:<8} {:<24}\", \"krylov\", mps.get_name());\n krylov_log.push_back(krylov_entry{description, mps.get_krylov_ritz(), mps.get_tensor().size(), mps.get_krylov_nev(), mps.get_krylov_ncv(), mps.get_energy_per_site(), mps.get_krylov_eigval(),\n mps.get_variance(), mps.get_overlap(), mps.get_norm(),mps.get_krylov_tol(), mps.get_iter(), mps.get_counter(), mps.get_time()});\n}\n<commit_msg>Add ritz to krylov report<commit_after>\n#include <general\/nmspc_iter.h>\n#include <tools\/common\/log.h>\n#include <tools\/common\/prof.h>\n#include <tools\/finite\/opt-internal\/report.h>\n#include <tools\/finite\/opt_mps.h>\n\n\/* clang-format off *\/\nvoid tools::finite::opt::internal::reports::print_bfgs_report(){\n if (tools::log->level() > spdlog::level::debug) return;\n if (bfgs_log.empty()) return;\n std::string format_hdr = \"{:<52} {:<7} {:<7} {:<20} {:<12} {:<18} {:<18} {:<5} {:<7} {:<8} {:<8} {:<18} {:<18}\";\n std::string format_num = \"- {:<50} {:<7} {:<7} {:<20.15f} {:<12.8f} {:<18.15f} {:<18.15f} {:<5} {:<7} {:<8.2e} {:<8.2e} {:<18.3f} {:<18.3f}\";\n tools::log->debug(format_hdr.c_str(),\n \"Optimization report\",\n \"size\",\n \"space\",\n \"energy\/L\",\n \"log₁₀ var\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"overlap\",\n \"norm\",\n \"iter\",\n \"counter\",\n \"|Δf|\",\n \"|∇f|∞\",\n \"Elapsed time [ms]\",\n \"Time per count [ms]\");\n\n for(auto &entry : bfgs_log){\n tools::log->debug(format_num.c_str(),\n entry.description, entry.size,\n entry.space, entry.energy,\n std::log10(entry.variance),\n entry.overlap,entry.norm,\n entry.iter, entry.counter,\n entry.delta_f, entry.grad_max_norm,\n entry.time*1000,\n entry.time*1000.0\/std::max(1.0,static_cast<double>(entry.counter)));\n }\n bfgs_log.clear();\n}\n\nvoid tools::finite::opt::internal::reports::print_eigs_report(){\n if (tools::log->level() > spdlog::level::debug) return;\n if (eigs_log.empty()) return;\n std::string format_hdr = \"- {:<5} {:<20} {:<20} {:<20} {:<12} {:<12} {:<12} {:<6}\";\n std::string format_num = \"- {:<5} {:<20.15f} {:<20.15f} {:<20.8f} {:<12.3f} {:<12.3f} {:<12.3f} {:<6}\";\n tools::log->debug(format_hdr.c_str(),\n \"nev\",\n \"max <θ_i|θ>\",\n \"min <θ_i|θ>\",\n \"log₁₀(1-Σ|<θ_i|θ>|²)\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"Eig Time[ms]\",\n \"Ham Time[ms]\",\n \"LU Time[ms]\",\n \"Steps\" );\n\n for(auto &entry : eigs_log){\n tools::log->debug(format_num.c_str(),\n entry.nev,\n entry.max_olap,\n entry.min_olap,\n entry.eps ,\n entry.eig_time * 1000,\n entry.ham_time * 1000,\n entry.lu_time * 1000,\n entry.steps\n );\n }\n eigs_log.clear();\n}\n\n\n\n\nvoid tools::finite::opt::internal::reports::print_time_report(){\n if (tools::log->level() > spdlog::level::trace) return;\n if(time_log.empty()) return;\n std::string format_hdr = \"LBFGS Time report [ms] {:<10} {:<10} {:<10} {:<10} {:<10} {:<10} {:<10}\";\n std::string format_num = \" {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f} {:<10.3f}\";\n tools::log->trace(format_hdr.c_str(),\n \"<ψ|H²|ψ>\",\n \"<ψ|H|ψ>\",\n \"H²|ψ>\",\n \"H|ψ>\",\n \"sum\",\n \"step\",\n \"l-bfgs\");\n for(auto &entry : time_log){\n tools::log->trace(format_num.c_str(),\n 1000 * entry.vH2v,\n 1000 * entry.vHv,\n 1000 * entry.vH2,\n 1000 * entry.vH,\n 1000 *(entry.vH2v\n + entry.vHv\n + entry.vH2\n + entry.vH),\n 1000 * entry.step,\n 1000 * entry.bfgs);\n }\n time_log.clear();\n}\n\nvoid tools::finite::opt::internal::reports::print_krylov_report(std::optional<size_t> max_entries){\n if (tools::log->level() > spdlog::level::debug) return;\n if (krylov_log.empty()) return;\n std::string format_hdr = \"{:<52} {:<7} {:<4} {:<4} {:<4} {:<8} {:<22} {:<22} {:<12} {:<18} {:<18} {:<5} {:<7} {:<18} {:<18}\";\n std::string format_num = \"- {:<50} {:<7} {:<4} {:<4} {:<4} {:<8.2e} {:<22.15f} {:<22.15f} {:<12.8f} {:<18.15f} {:<18.15f} {:<5} {:<7} {:<18.3f} {:<18.3f}\";\n tools::log->debug(format_hdr.c_str(),\n \"Optimization report\",\n \"size\",\n \"ritz\"\n \"nev\",\n \"ncv\",\n \"tol\",\n \"energy\/L\",\n \"eigval\",\n \"log₁₀ var\", \/\/ Special characters are counted properly in fmt 1.7.0\n \"overlap\",\n \"norm\",\n \"iter\",\n \"counter\",\n \"Elapsed time [ms]\",\n \"Time per count [ms]\");\n\n for(const auto &[idx,entry] : iter::enumerate(krylov_log)){\n if(max_entries and max_entries.value() <= idx) break;\n tools::log->debug(format_num.c_str(),\n entry.description,\n entry.size, entry.ritz,entry.nev, entry.ncv, entry.tol,\n entry.energy,entry.eigval,\n std::log10(entry.variance),\n entry.overlap,entry.norm,\n entry.iter, entry.counter,\n entry.time*1000,\n entry.time*1000.0\/std::max(1.0,static_cast<double>(entry.counter)));\n }\n krylov_log.clear();\n}\n\n\/* clang-format on *\/\nvoid tools::finite::opt::internal::reports::bfgs_add_entry(const std::string &description, long size, long space, double energy, double variance,\n double overlap, double norm, double delta_f, double grad_norm, size_t iter, size_t counter,\n double time) {\n if(tools::log->level() > spdlog::level::debug) return;\n bfgs_log.push_back({description, size, space, energy, variance, overlap, norm, delta_f, grad_norm, iter, counter, time});\n}\nvoid tools::finite::opt::internal::reports::bfgs_add_entry(const std::string &mode, const std::string &tag, const opt_mps &mps, std::optional<long> space) {\n if(tools::log->level() > spdlog::level::debug) return;\n if(not space) space = mps.get_tensor().size();\n std::string description = fmt::format(\"{:<8} {:<16} {}\", mode, mps.get_name(), tag);\n bfgs_log.push_back(bfgs_entry{description, mps.get_tensor().size(), space.value(), mps.get_energy_per_site(), mps.get_variance(), mps.get_overlap(),\n mps.get_norm(), mps.get_delta_f(), mps.get_grad_norm(), mps.get_iter(), mps.get_counter(), mps.get_time()});\n}\n\nvoid tools::finite::opt::internal::reports::time_add_dir_entry() {\n if(tools::log->level() > spdlog::level::trace) return;\n time_log.push_back({tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH2v\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vHv\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH2\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_vH\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_bfgs\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_dir_step\"]->get_last_interval()});\n}\nvoid tools::finite::opt::internal::reports::time_add_sub_entry() {\n if(tools::log->level() > spdlog::level::trace) return;\n time_log.push_back({tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH2v\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vHv\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH2\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_vH\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_bfgs\"]->get_last_interval(),\n tools::common::profile::prof[AlgorithmType::xDMRG][\"t_opt_sub_step\"]->get_last_interval()});\n}\nvoid tools::finite::opt::internal::reports::eigs_add_entry(long nev, double max_olap, double min_olap, double eps, double eig_time, double ham_time,\n double lu_time, size_t steps) {\n if(tools::log->level() > spdlog::level::debug) return;\n eigs_log.push_back({nev, max_olap, min_olap, eps, eig_time, ham_time, lu_time, steps});\n}\n\nvoid tools::finite::opt::internal::reports::krylov_add_entry(const opt_mps &mps) {\n if(tools::log->level() > spdlog::level::debug) return;\n std::string description = fmt::format(\"{:<8} {:<24}\", \"krylov\", mps.get_name());\n krylov_log.push_back(krylov_entry{description, mps.get_krylov_ritz(), mps.get_tensor().size(), mps.get_krylov_nev(), mps.get_krylov_ncv(), mps.get_energy_per_site(), mps.get_krylov_eigval(),\n mps.get_variance(), mps.get_overlap(), mps.get_norm(),mps.get_krylov_tol(), mps.get_iter(), mps.get_counter(), mps.get_time()});\n}\n<|endoftext|>"} {"text":"<commit_before>#include <powerset.hpp>\n\n#include \"helpers.hpp\"\n\n#include <vector>\n#include <string>\n#include <iterator>\n\n#include \"catch.hpp\"\n\nusing iter::powerset;\nusing IntPermSet = std::multiset<std::multiset<int>>;\n\nTEST_CASE(\"powerset: basic test, [1, 2, 3]\", \"[powerset]\") {\n const std::vector<int> ns = {1, 2, 3};\n IntPermSet v;\n SECTION(\"Normal call\") {\n for (auto&& st : powerset(ns)) {\n v.emplace(std::begin(st), std::end(st));\n }\n }\n SECTION(\"Pipe\") {\n for (auto&& st : ns | powerset) {\n v.emplace(std::begin(st), std::end(st));\n }\n }\n\n const IntPermSet vc = {\n std::multiset<int>{}, {1}, {2}, {3},\n {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}};\n REQUIRE(v == vc);\n}\n\nTEST_CASE(\"powerset: empty sequence gives only empty set\", \"[powerset]\") {\n const std::vector<int> ns = {};\n auto ps = powerset(ns);\n auto it = std::begin(ps);\n REQUIRE(std::begin(*it) == std::end(*it)); \/\/ it's empty\n ++it;\n REQUIRE(it == std::end(ps));\n}\n\nTEST_CASE(\"powerset: iterators can be compared\", \"[powerset]\") {\n std::vector<int> ns = {1, 2};\n auto p = powerset(ns);\n {\n auto it = std::begin(p);\n REQUIRE(it == std::begin(p));\n REQUIRE_FALSE(it != std::begin(p));\n REQUIRE(it != std::end(p));\n REQUIRE_FALSE(it == std::end(p));\n ++it;\n REQUIRE_FALSE(it == std::begin(p));\n REQUIRE(it != std::begin(p));\n REQUIRE_FALSE(it == std::end(p));\n REQUIRE(it != std::end(p));\n ++it;\n ++it;\n ++it;\n REQUIRE(it == std::end(p));\n }\n\n ns.push_back(3);\n {\n auto it = std::begin(p);\n auto it2 = std::begin(p);\n std::advance(it, 4);\n std::advance(it2, 4);\n REQUIRE(it == it2);\n ++it2;\n REQUIRE(it != it2);\n }\n}\n\nTEST_CASE(\"powerset: iterator copy ctor is correct\", \"[powerset]\") {\n \/\/ { {}, {1}, {2}, {1, 2} }\n std::vector<int> ns = {1, 2};\n auto p = powerset(ns);\n auto it = std::begin(p);\n auto it2(it);\n REQUIRE(it == it2);\n ++it2;\n REQUIRE(it != it2);\n REQUIRE(std::begin(*it) == std::end(*it));\n}\n\nTEST_CASE(\"powerset: binds to lvalues, moves rvalues\", \"[powerset]\") {\n itertest::BasicIterable<int> bi{1, 2};\n SECTION(\"binds to lvalues\") {\n powerset(bi);\n REQUIRE_FALSE(bi.was_moved_from());\n }\n SECTION(\"moves rvalues\") {\n powerset(std::move(bi));\n REQUIRE(bi.was_moved_from());\n }\n}\n\nTEST_CASE(\"powerset: doesn't move or copy elements of iterable\", \"[powerset]\") {\n constexpr itertest::SolidInt arr[] = {{1}, {0}, {2}};\n for (auto&& st : powerset(arr)) {\n for (auto&& i : st) {\n (void)i;\n }\n }\n}\n\nTEST_CASE(\"powerset: iterator meets requirements\", \"[powerset]\") {\n std::string s{\"abc\"};\n auto c = powerset(s);\n REQUIRE(itertest::IsIterator<decltype(std::begin(c))>::value);\n auto&& row = *std::begin(c);\n REQUIRE(itertest::IsIterator<decltype(std::begin(row))>::value);\n}\n\ntemplate <typename T>\nusing ImpT = decltype(powerset(std::declval<T>()));\nTEST_CASE(\"powerset: has correct ctor and assign ops\", \"[powerset]\") {\n REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string&>>::value);\n REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string>>::value);\n}\n<commit_msg>Tests powerset with different begin and end<commit_after>#include <powerset.hpp>\n\n#define CHAR_RANGE_DEFAULT_CONSTRUCTIBLE\n#include \"helpers.hpp\"\n#undef CHAR_RANGE_DEFAULT_CONSTRUCTIBLE\n\n#include <vector>\n#include <string>\n#include <iterator>\n\n#include \"catch.hpp\"\n\nusing iter::powerset;\nusing IntPermSet = std::multiset<std::multiset<int>>;\n\nTEST_CASE(\"powerset: basic test, [1, 2, 3]\", \"[powerset]\") {\n const std::vector<int> ns = {1, 2, 3};\n IntPermSet v;\n SECTION(\"Normal call\") {\n for (auto&& st : powerset(ns)) {\n v.emplace(std::begin(st), std::end(st));\n }\n }\n SECTION(\"Pipe\") {\n for (auto&& st : ns | powerset) {\n v.emplace(std::begin(st), std::end(st));\n }\n }\n\n const IntPermSet vc = {\n std::multiset<int>{}, {1}, {2}, {3},\n {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}};\n REQUIRE(v == vc);\n}\n\nTEST_CASE(\"powerset: Works with different begin and end types\",\n \"[powerset]\") {\n CharRange cr{'d'};\n using CharPermSet = std::multiset<std::vector<char>>;\n CharPermSet sc;\n for (auto&& v : powerset(cr)) {\n sc.emplace(std::begin(v), std::end(v));\n }\n const CharPermSet ans = {\n {},\n {'a'}, {'b'}, {'c'},\n {'a', 'b'}, {'a', 'c'}, {'b', 'c'},\n {'a', 'b', 'c'}};\n \n REQUIRE(ans == sc);\n}\n\nTEST_CASE(\"powerset: empty sequence gives only empty set\", \"[powerset]\") {\n const std::vector<int> ns = {};\n auto ps = powerset(ns);\n auto it = std::begin(ps);\n REQUIRE(std::begin(*it) == std::end(*it)); \/\/ it's empty\n ++it;\n REQUIRE(it == std::end(ps));\n}\n\nTEST_CASE(\"powerset: iterators can be compared\", \"[powerset]\") {\n std::vector<int> ns = {1, 2};\n auto p = powerset(ns);\n {\n auto it = std::begin(p);\n REQUIRE(it == std::begin(p));\n REQUIRE_FALSE(it != std::begin(p));\n REQUIRE(it != std::end(p));\n REQUIRE_FALSE(it == std::end(p));\n ++it;\n REQUIRE_FALSE(it == std::begin(p));\n REQUIRE(it != std::begin(p));\n REQUIRE_FALSE(it == std::end(p));\n REQUIRE(it != std::end(p));\n ++it;\n ++it;\n ++it;\n REQUIRE(it == std::end(p));\n }\n\n ns.push_back(3);\n {\n auto it = std::begin(p);\n auto it2 = std::begin(p);\n std::advance(it, 4);\n std::advance(it2, 4);\n REQUIRE(it == it2);\n ++it2;\n REQUIRE(it != it2);\n }\n}\n\nTEST_CASE(\"powerset: iterator copy ctor is correct\", \"[powerset]\") {\n \/\/ { {}, {1}, {2}, {1, 2} }\n std::vector<int> ns = {1, 2};\n auto p = powerset(ns);\n auto it = std::begin(p);\n auto it2(it);\n REQUIRE(it == it2);\n ++it2;\n REQUIRE(it != it2);\n REQUIRE(std::begin(*it) == std::end(*it));\n}\n\nTEST_CASE(\"powerset: binds to lvalues, moves rvalues\", \"[powerset]\") {\n itertest::BasicIterable<int> bi{1, 2};\n SECTION(\"binds to lvalues\") {\n powerset(bi);\n REQUIRE_FALSE(bi.was_moved_from());\n }\n SECTION(\"moves rvalues\") {\n powerset(std::move(bi));\n REQUIRE(bi.was_moved_from());\n }\n}\n\nTEST_CASE(\"powerset: doesn't move or copy elements of iterable\", \"[powerset]\") {\n constexpr itertest::SolidInt arr[] = {{1}, {0}, {2}};\n for (auto&& st : powerset(arr)) {\n for (auto&& i : st) {\n (void)i;\n }\n }\n}\n\nTEST_CASE(\"powerset: iterator meets requirements\", \"[powerset]\") {\n std::string s{\"abc\"};\n auto c = powerset(s);\n REQUIRE(itertest::IsIterator<decltype(std::begin(c))>::value);\n auto&& row = *std::begin(c);\n REQUIRE(itertest::IsIterator<decltype(std::begin(row))>::value);\n}\n\ntemplate <typename T>\nusing ImpT = decltype(powerset(std::declval<T>()));\nTEST_CASE(\"powerset: has correct ctor and assign ops\", \"[powerset]\") {\n REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string&>>::value);\n REQUIRE(itertest::IsMoveConstructibleOnly<ImpT<std::string>>::value);\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\nstruct noncopyable {\n noncopyable() = default;\n noncopyable(const noncopyable&) = delete;\n noncopyable & operator=(const noncopyable&) = delete;\n};\n<commit_msg>Making noncopyable movable<commit_after>#pragma once\n\nstruct noncopyable {\n noncopyable() = default;\n noncopyable(noncopyable&&) = default;\n noncopyable& operator=(noncopyable&&) = default;\n\n noncopyable(const noncopyable&) = delete;\n noncopyable& operator=(const noncopyable&) = delete;\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright RIME Developers\n\/\/ Distributed under the BSD License\n\/\/\n\/\/ 2011-09-11 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <rime\/common.h>\n#include <rime\/composition.h>\n#include <rime\/context.h>\n#include <rime\/engine.h>\n#include <rime\/key_event.h>\n#include <rime\/key_table.h>\n#include <rime\/menu.h>\n#include <rime\/schema.h>\n#include <rime\/gear\/selector.h>\n\nnamespace rime {\n\nSelector::Selector(const Ticket& ticket) : Processor(ticket) {\n}\n\nProcessResult Selector::ProcessKeyEvent(const KeyEvent& key_event) {\n if (key_event.release() || key_event.alt())\n return kNoop;\n Context* ctx = engine_->context();\n if (ctx->composition().empty())\n return kNoop;\n Segment& current_segment(ctx->composition().back());\n if (!current_segment.menu || current_segment.HasTag(\"raw\"))\n return kNoop;\n int ch = key_event.keycode();\n if (ch == XK_Prior || ch == XK_KP_Prior) {\n PageUp(ctx);\n return kAccepted;\n }\n if (ch == XK_Next || ch == XK_KP_Next) {\n PageDown(ctx);\n return kAccepted;\n }\n if (ch == XK_Up || ch == XK_KP_Up) {\n if (ctx->get_option(\"_horizontal\")) {\n PageUp(ctx);\n } else {\n CursorUp(ctx);\n }\n return kAccepted;\n }\n if (ch == XK_Down || ch == XK_KP_Down) {\n if (ctx->get_option(\"_horizontal\")) {\n PageDown(ctx);\n } else {\n CursorDown(ctx);\n }\n return kAccepted;\n }\n if (ch == XK_Left || ch == XK_KP_Left) {\n if (!key_event.ctrl() &&\n !key_event.shift() &&\n ctx->caret_pos() == ctx->input().length() &&\n ctx->get_option(\"_horizontal\") &&\n CursorUp(ctx)) {\n return kAccepted;\n }\n return kNoop;\n }\n if (ch == XK_Right || ch == XK_KP_Right) {\n if (!key_event.ctrl() &&\n !key_event.shift() &&\n ctx->caret_pos() == ctx->input().length() &&\n ctx->get_option(\"_horizontal\")) {\n CursorDown(ctx);\n return kAccepted;\n }\n return kNoop;\n }\n if (ch == XK_Home || ch == XK_KP_Home) {\n return Home(ctx) ? kAccepted : kNoop;\n }\n if (ch == XK_End || ch == XK_KP_End) {\n return End(ctx) ? kAccepted : kNoop;\n }\n int index = -1;\n const string& select_keys(engine_->schema()->select_keys());\n if (!select_keys.empty() &&\n !key_event.ctrl() &&\n ch >= 0x20 && ch < 0x7f) {\n size_t pos = select_keys.find((char)ch);\n if (pos != string::npos) {\n index = static_cast<int>(pos);\n }\n }\n else if (ch >= XK_0 && ch <= XK_9)\n index = ((ch - XK_0) + 9) % 10;\n else if (ch >= XK_KP_0 && ch <= XK_KP_9)\n index = ((ch - XK_KP_0) + 9) % 10;\n if (index >= 0) {\n SelectCandidateAt(ctx, index);\n return kAccepted;\n }\n \/\/ not handled\n return kNoop;\n}\n\nbool Selector::PageUp(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int page_size = engine_->schema()->page_size();\n int selected_index = comp.back().selected_index;\n int index = selected_index < page_size ? 0 : selected_index - page_size;\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::PageDown(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty() || !comp.back().menu)\n return false;\n int page_size = engine_->schema()->page_size();\n int index = comp.back().selected_index + page_size;\n int page_start = (index \/ page_size) * page_size;\n int candidate_count = comp.back().menu->Prepare(page_start + page_size);\n if (candidate_count <= page_start) {\n bool page_down_cycle = engine_->schema()->page_down_cycle();\n if (page_down_cycle) {\/\/ Cycle back to page 1 if true\n index = 0;\n } else {\n return false;\n }\n } else if (index >= candidate_count) {\n index = candidate_count - 1;\n }\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n\n}\n\nbool Selector::CursorUp(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int index = comp.back().selected_index;\n if (index <= 0)\n return false;\n comp.back().selected_index = index - 1;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::CursorDown(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty() || !comp.back().menu)\n return false;\n int index = comp.back().selected_index + 1;\n int candidate_count = comp.back().menu->Prepare(index + 1);\n if (candidate_count <= index)\n return false;\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::Home(Context* ctx) {\n if (ctx->composition().empty())\n return false;\n Segment& seg(ctx->composition().back());\n if (seg.selected_index > 0) {\n seg.selected_index = 0;\n return true;\n }\n return false;\n}\n\nbool Selector::End(Context* ctx) {\n if (ctx->caret_pos() < ctx->input().length()) {\n \/\/ navigator should handle this\n return false;\n }\n \/\/ this is cool:\n return Home(ctx);\n}\n\n\nbool Selector::SelectCandidateAt(Context* ctx, int index) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int page_size = engine_->schema()->page_size();\n if (index >= page_size)\n return false;\n int selected_index = comp.back().selected_index;\n int page_start = (selected_index \/ page_size) * page_size;\n return ctx->Select(page_start + index);\n}\n\n} \/\/ namespace rime\n<commit_msg>feat(selector): support vertical UI<commit_after>\/\/\n\/\/ Copyright RIME Developers\n\/\/ Distributed under the BSD License\n\/\/\n\/\/ 2011-09-11 GONG Chen <chen.sst@gmail.com>\n\/\/\n#include <rime\/common.h>\n#include <rime\/composition.h>\n#include <rime\/context.h>\n#include <rime\/engine.h>\n#include <rime\/key_event.h>\n#include <rime\/key_table.h>\n#include <rime\/menu.h>\n#include <rime\/schema.h>\n#include <rime\/gear\/selector.h>\n\nnamespace rime {\n\nSelector::Selector(const Ticket& ticket) : Processor(ticket) {\n}\n\nProcessResult Selector::ProcessKeyEvent(const KeyEvent& key_event) {\n if (key_event.release() || key_event.alt())\n return kNoop;\n Context* ctx = engine_->context();\n if (ctx->composition().empty())\n return kNoop;\n Segment& current_segment(ctx->composition().back());\n if (!current_segment.menu || current_segment.HasTag(\"raw\"))\n return kNoop;\n int ch = key_event.keycode();\n if (ch == XK_Prior || ch == XK_KP_Prior) {\n PageUp(ctx);\n return kAccepted;\n }\n if (ch == XK_Next || ch == XK_KP_Next) {\n PageDown(ctx);\n return kAccepted;\n }\n if (ch == XK_Up || ch == XK_KP_Up) {\n if (ctx->get_option(\"_horizontal\")) {\n PageUp(ctx);\n } else {\n CursorUp(ctx);\n }\n return kAccepted;\n }\n if (ch == XK_Down || ch == XK_KP_Down) {\n if (ctx->get_option(\"_horizontal\")) {\n PageDown(ctx);\n } else {\n CursorDown(ctx);\n }\n return kAccepted;\n }\n if (ch == XK_Left || ch == XK_KP_Left) {\n if (!key_event.ctrl() &&\n !key_event.shift() &&\n ctx->caret_pos() == ctx->input().length()) {\n if (ctx->get_option(\"_horizontal\") &&\n CursorUp(ctx)) {\n return kAccepted;\n }\n if (ctx->get_option(\"_vertical\")) {\n CursorDown(ctx);\n return kAccepted;\n }\n }\n return kNoop;\n }\n if (ch == XK_Right || ch == XK_KP_Right) {\n if (!key_event.ctrl() &&\n !key_event.shift() &&\n ctx->caret_pos() == ctx->input().length()) {\n if (ctx->get_option(\"_horizontal\")) {\n CursorDown(ctx);\n return kAccepted;\n }\n if (ctx->get_option(\"_vertical\") &&\n CursorUp(ctx)) {\n return kAccepted;\n }\n }\n return kNoop;\n }\n if (ch == XK_Home || ch == XK_KP_Home) {\n return Home(ctx) ? kAccepted : kNoop;\n }\n if (ch == XK_End || ch == XK_KP_End) {\n return End(ctx) ? kAccepted : kNoop;\n }\n int index = -1;\n const string& select_keys(engine_->schema()->select_keys());\n if (!select_keys.empty() &&\n !key_event.ctrl() &&\n ch >= 0x20 && ch < 0x7f) {\n size_t pos = select_keys.find((char)ch);\n if (pos != string::npos) {\n index = static_cast<int>(pos);\n }\n }\n else if (ch >= XK_0 && ch <= XK_9)\n index = ((ch - XK_0) + 9) % 10;\n else if (ch >= XK_KP_0 && ch <= XK_KP_9)\n index = ((ch - XK_KP_0) + 9) % 10;\n if (index >= 0) {\n SelectCandidateAt(ctx, index);\n return kAccepted;\n }\n \/\/ not handled\n return kNoop;\n}\n\nbool Selector::PageUp(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int page_size = engine_->schema()->page_size();\n int selected_index = comp.back().selected_index;\n int index = selected_index < page_size ? 0 : selected_index - page_size;\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::PageDown(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty() || !comp.back().menu)\n return false;\n int page_size = engine_->schema()->page_size();\n int index = comp.back().selected_index + page_size;\n int page_start = (index \/ page_size) * page_size;\n int candidate_count = comp.back().menu->Prepare(page_start + page_size);\n if (candidate_count <= page_start) {\n bool page_down_cycle = engine_->schema()->page_down_cycle();\n if (page_down_cycle) {\/\/ Cycle back to page 1 if true\n index = 0;\n } else {\n return false;\n }\n } else if (index >= candidate_count) {\n index = candidate_count - 1;\n }\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n\n}\n\nbool Selector::CursorUp(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int index = comp.back().selected_index;\n if (index <= 0)\n return false;\n comp.back().selected_index = index - 1;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::CursorDown(Context* ctx) {\n Composition& comp = ctx->composition();\n if (comp.empty() || !comp.back().menu)\n return false;\n int index = comp.back().selected_index + 1;\n int candidate_count = comp.back().menu->Prepare(index + 1);\n if (candidate_count <= index)\n return false;\n comp.back().selected_index = index;\n comp.back().tags.insert(\"paging\");\n return true;\n}\n\nbool Selector::Home(Context* ctx) {\n if (ctx->composition().empty())\n return false;\n Segment& seg(ctx->composition().back());\n if (seg.selected_index > 0) {\n seg.selected_index = 0;\n return true;\n }\n return false;\n}\n\nbool Selector::End(Context* ctx) {\n if (ctx->caret_pos() < ctx->input().length()) {\n \/\/ navigator should handle this\n return false;\n }\n \/\/ this is cool:\n return Home(ctx);\n}\n\n\nbool Selector::SelectCandidateAt(Context* ctx, int index) {\n Composition& comp = ctx->composition();\n if (comp.empty())\n return false;\n int page_size = engine_->schema()->page_size();\n if (index >= page_size)\n return false;\n int selected_index = comp.back().selected_index;\n int page_start = (selected_index \/ page_size) * page_size;\n return ctx->Select(page_start + index);\n}\n\n} \/\/ namespace rime\n<|endoftext|>"} {"text":"<commit_before>\/*\n * MarketControl.cpp\n *\n * Created on: Jun 11, 2017\n * Author: ondra\n *\/\n\n#include \"marketControl.h\"\n\n#include <couchit\/couchDB.h>\n#include <couchit\/exception.h>\n#include <couchit\/query.h>\n#include <imtjson\/rpc.h>\n#include \"..\/common\/config.h\"\n\nnamespace quark {\n\nMarketControl::MarketControl(Value cfg, StrViewA dbname)\n\t:ordersDb(initCouchDBConfig(cfg,dbname,\"-orders\"))\n\t,tradesDb(initCouchDBConfig(cfg,dbname,\"-trades\"))\n\t,posDb(initCouchDBConfig(cfg,dbname,\"-positions\"))\n\t,orderControl(ordersDb)\n{\n\n\n}\n\n\nstatic void notImpl(RpcRequest req) {\n\treq.setError(501,\"Not implemented yet!\");\n}\n\n\nbool MarketControl::testDatabase() {\n\tCouchDB::PConnection conn = ordersDb.getConnection(\"\");\n\ttry {\n\t\tordersDb.requestGET(conn,nullptr,0);\n\t\treturn true;\n\t} catch (const couchit::RequestError &e) {\n\t\tif (e.getCode() == 404) return false;\n\t\tthrow;\n\t}\n}\n\nValue MarketControl::getMarketStatus() {\n\n\tValue err = ordersDb.get(\"error\",CouchDB::flgNullIfMissing);\n\tif (err == nullptr) {\n\t\treturn Object(\"marketStatus\",\"ok\");\n\t} else {\n\t\treturn Object(\"marketStatus\",\"stopped\")\n\t\t\t\t(\"reason\",err);\n\t}\n\n}\n\n\nValue MarketControl::initRpc(RpcServer& rpcServer) {\n\n\tPMarketControl me = this;\n\trpcServer.add(\"Order.create\", me, &MarketControl::rpcOrderCreate);\n\trpcServer.add(\"Order.modify\", me, &MarketControl::rpcOrderUpdate);\n\trpcServer.add(\"Order.cancel\", me, &MarketControl::rpcOrderCancel);\n\trpcServer.add(\"Order.get\", me, &MarketControl::rpcOrderGet);\n\trpcServer.add(\"Stream.orders\", me, &MarketControl::rpcStreamOrders);\n\trpcServer.add(\"Stream.trades\", me, &MarketControl::rpcStreamTrades);\n\trpcServer.add(\"Stream.orderbook\", me, &MarketControl::rpcStreamOrderbook);\n\trpcServer.add(\"Stream.positions\", me, &MarketControl::rpcStreamPositions);\n\trpcServer.add(\"Stream.lastId\", me, &MarketControl::rpcStreamLastId);\n\trpcServer.add(\"Status.get\", me, &MarketControl::rpcStatusGet);\n\trpcServer.add(\"Status.clear\", me, &MarketControl::rpcStatusClear);\n\trpcServer.add(\"Orderbook.get\",me, &MarketControl::rpcOrderbookGet);\n\n\treturn getMarketStatus();\n\n}\n\n\nvoid MarketControl::rpcOrderCreate(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{Object(\"%\",\"any\")});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.create(args[0]));\n\t} catch (ValidatonError &e) {\n\t\trq.setError(400,\"Validation failed\", e.getError());\n\t}\n}\n\nvoid MarketControl::rpcOrderUpdate(RpcRequest rq) {\n\tstatic Value chkargs1 = {\"string\",Object(\"%\",\"any\")};\n\tstatic Value chkargs2 = {\"string\",Object(\"%\",\"any\"), \"string\"};\n\tValue args = rq.getArgs();\n\ttry {\n\t\tif (rq.checkArgs(chkargs1)) {\n\t\t\trq.setResult(orderControl.modify(args[0],args[1],json::undefined));\n\t\t} else if (rq.checkArgs(chkargs2)) {\n\t\t\trq.setResult(orderControl.modify(args[0],args[1],args[2]));\n\t\t} else {\n\t\t\trq.setArgError();\n\t\t}\n\t} catch (ValidatonError &e) {\n\t\trq.setError(400,\"Validation failed\", e.getError());\n\t} catch (OrderNotFoundError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t} catch (ConflictError &e) {\n\t\trq.setError(409,\"Conflict\",e.getActualDoc());\n\t}\n}\n\nvoid MarketControl::rpcOrderCancel(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{\"string\"});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.cancel(args[0]));\n\t} catch (OrderNotFoundError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t}\n}\n\nvoid MarketControl::rpcOrderGet(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{\"string\"});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.getOrder(args[0]));\n\t} catch (const couchit::RequestError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t}\n}\n\nclass MarketControl::BasicFeed: public FeedControl {\npublic:\n\tBasicFeed(couchit::CouchDB &db,\n\t\t\t Value since,\n\t\t\t RpcRequest rq,\n\t\t\t String streamName)\n\t\t\t\t:FeedControl(db,since),rq(rq),streamName(streamName) {\n\n\t}\n\tvirtual void init() override {\n\t}\n\t~BasicFeed() {\n\t\tstop();\n\t}\n\nprotected:\n\tRpcRequest rq;\n\tString streamName;\n};\n\nclass MarketControl::OrderFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tstatic couchit::View initView(\"_design\/index\/_view\/queue\",couchit::View::includeDocs|couchit::View::update);\n\t\tinitialView = &initView;\n\t\tfeed.setFilter(couchit::Filter(\"index\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"id\",doc[\"_id\"])\n\t\t\t\t(\"_id\",undefined)});\n\t}\n\n};\n\nclass MarketControl::TradesFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tfeed.setFilter(couchit::Filter(\"trades\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"id\",doc[\"_id\"])\n\t\t\t\t(\"_id\",undefined)\n\t\t\t\t(\"_rev\",undefined)\n\t\t});\n\t}\n\n};\n\nclass MarketControl::PosFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tfeed.setFilter(couchit::Filter(\"positions\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"user\",doc[\"_id\"].getString().substr(2))\n\t\t\t\t(\"_id\",undefined)\n\t\t\t\t(\"_rev\",undefined)\n\t\t});\n\t}\n};\n\nclass MarketControl::OrderbookFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tstatic couchit::View initView(\"_design\/index\/_view\/orderbook\",couchit::View::includeDocs|couchit::View::update);\n\t\tthis->initialView = &initView;\n\t\tfeed.setFilter(couchit::Filter(\"index\/orders\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\tsendNotify(rq, streamName, doc, seqNum.toString());\n\t}\n\tstatic void sendNotify(RpcRequest &rq, StrViewA streamName, Value doc, Value seq) {\n\t\tObject ntf;\n\t\tbool finished = doc[\"finished\"].getBool();\n\t\trq.sendNotify(streamName,{seq,{doc[\"_id\"],doc[\"dir\"],doc[\"limitPrice\"],finished?Value(0):doc[\"size\"]}});\n\t}\n\n};\n\nvoid MarketControl::rpcStreamOrders(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\tordersFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\tordersFeed = new OrderFeed(ordersDb, since, rq, \"order\");\n\t\tordersFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamTrades(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\ttradesFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\ttradesFeed = new TradesFeed(tradesDb, since, rq, \"trade\");\n\t\ttradesFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamPositions(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\tposFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\tposFeed = new PosFeed(posDb, since, rq, \"position\");\n\t\tposFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamOrderbook(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\torderbookFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\torderbookFeed = new OrderbookFeed(ordersDb, since, rq, \"orderbook\");\n\t\torderbookFeed->start();\n\t\trq.setResult(true);\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\n\nvoid MarketControl::FeedControl::stop() {\n\n\tif (!stopped) {\n\t\tfeed.cancelWait();\n\t\tthr.join();\n\t\tstopped = true;\n\t}\n}\n\nvoid MarketControl::FeedControl::start() {\n\tbool initWait = false;\n\tusing namespace couchit;\n\tstd::condition_variable initWaitCond;\n\tstd::mutex lock;\n\n\tthr = std::thread([&]{\n\n\t\tinit();\n\n\t\t{\n\t\tstd::unique_lock<std::mutex> _(lock);\n\t\tinitWait = true;\n\t\tinitWaitCond.notify_all();\n\t\t}\n\n\t\tValue lastDoc;\n\t\tif (!since.defined() && initialView != nullptr)\n\t\t{\n\t\t\tQuery q = db.createQuery(*initialView);\n\t\t\tResult r = q.exec();\n\t\t\tfor (Row rw : r) {\n\t\t\t\tonEvent(r.getUpdateSeq(),rw.doc);\n\t\t\t\tlastDoc = rw.doc;\n\t\t\t}\n\t\t\tsince = r.getUpdateSeq();\n\t\t}\n\n\t\tif (since.defined())\n\t\t\tfeed.since(since);\n\t\ttry {\n\t\t\tfeed >> [&](ChangedDoc x) {\n\t\t\t\tif (x.doc == lastDoc) return true;\n\t\t\t\tlastDoc = json::undefined;\n\t\t\t\tonEvent(x.seqId, x.doc);\n\t\t\t\treturn true;\n\t\t\t};\n\t\t} catch (couchit::CanceledException &) {\n\n\t\t}\n\t});\n\n\tstd::unique_lock<std::mutex> _(lock);\n\tinitWaitCond.wait(_,[&]{return initWait;});\n\tstopped = false;\n}\n\nMarketControl::FeedControl::FeedControl(CouchDB& db, Value since)\n\t:feed(db.createChangesFeed()), since(since), db(db), stopped(true)\n{\n\tfeed.setTimeout(-1);\n\tfeed.includeDocs(true);\n}\n\nvoid MarketControl::rpcStreamLastId(RpcRequest rq) {\n\tif (!rq.checkArgs(json::array)) return rq.setArgError();\n\n\trq.setResult(Object(\"orders\",ordersDb.getLastSeqNumber())\n\t\t\t\t\t (\"trades\",tradesDb.getLastSeqNumber())\n\t\t\t\t\t (\"positions\",posDb.getLastSeqNumber())\n\t\t\t);\n\n}\n\nvoid quark::MarketControl::rpcStatusGet(RpcRequest rq) {\n\trq.setResult(getMarketStatus());\n}\n\nvoid quark::MarketControl::rpcStatusClear(RpcRequest rq) {\n\tcouchit::Document doc = ordersDb.get(\"error\");\n\tdoc.setDeleted();\n\tordersDb.put(doc);\n\trq.setResult(getMarketStatus());\n}\n\nvoid quark::MarketControl::rpcOrderbookGet(RpcRequest rq) {\n\tcouchit::View orderbookView(\"_design\/index\/_view\/orderbook\",couchit::View::update);\n\tcouchit::Result res = ordersDb.createQuery(orderbookView).exec();\n\tArray out;\n\tfor (couchit::Row rw : res) {\n\t\tout.push_back({rw[\"id\"],rw.key[0], rw.key[1], rw.value});\n\t}\n\trq.setResult(out);\n}\n\n\n}\n\n\/* namespace quark *\/\n\n\n<commit_msg>fix filter name<commit_after>\/*\n * MarketControl.cpp\n *\n * Created on: Jun 11, 2017\n * Author: ondra\n *\/\n\n#include \"marketControl.h\"\n\n#include <couchit\/couchDB.h>\n#include <couchit\/exception.h>\n#include <couchit\/query.h>\n#include <imtjson\/rpc.h>\n#include \"..\/common\/config.h\"\n\nnamespace quark {\n\nMarketControl::MarketControl(Value cfg, StrViewA dbname)\n\t:ordersDb(initCouchDBConfig(cfg,dbname,\"-orders\"))\n\t,tradesDb(initCouchDBConfig(cfg,dbname,\"-trades\"))\n\t,posDb(initCouchDBConfig(cfg,dbname,\"-positions\"))\n\t,orderControl(ordersDb)\n{\n\n\n}\n\n\nstatic void notImpl(RpcRequest req) {\n\treq.setError(501,\"Not implemented yet!\");\n}\n\n\nbool MarketControl::testDatabase() {\n\tCouchDB::PConnection conn = ordersDb.getConnection(\"\");\n\ttry {\n\t\tordersDb.requestGET(conn,nullptr,0);\n\t\treturn true;\n\t} catch (const couchit::RequestError &e) {\n\t\tif (e.getCode() == 404) return false;\n\t\tthrow;\n\t}\n}\n\nValue MarketControl::getMarketStatus() {\n\n\tValue err = ordersDb.get(\"error\",CouchDB::flgNullIfMissing);\n\tif (err == nullptr) {\n\t\treturn Object(\"marketStatus\",\"ok\");\n\t} else {\n\t\treturn Object(\"marketStatus\",\"stopped\")\n\t\t\t\t(\"reason\",err);\n\t}\n\n}\n\n\nValue MarketControl::initRpc(RpcServer& rpcServer) {\n\n\tPMarketControl me = this;\n\trpcServer.add(\"Order.create\", me, &MarketControl::rpcOrderCreate);\n\trpcServer.add(\"Order.modify\", me, &MarketControl::rpcOrderUpdate);\n\trpcServer.add(\"Order.cancel\", me, &MarketControl::rpcOrderCancel);\n\trpcServer.add(\"Order.get\", me, &MarketControl::rpcOrderGet);\n\trpcServer.add(\"Stream.orders\", me, &MarketControl::rpcStreamOrders);\n\trpcServer.add(\"Stream.trades\", me, &MarketControl::rpcStreamTrades);\n\trpcServer.add(\"Stream.orderbook\", me, &MarketControl::rpcStreamOrderbook);\n\trpcServer.add(\"Stream.positions\", me, &MarketControl::rpcStreamPositions);\n\trpcServer.add(\"Stream.lastId\", me, &MarketControl::rpcStreamLastId);\n\trpcServer.add(\"Status.get\", me, &MarketControl::rpcStatusGet);\n\trpcServer.add(\"Status.clear\", me, &MarketControl::rpcStatusClear);\n\trpcServer.add(\"Orderbook.get\",me, &MarketControl::rpcOrderbookGet);\n\n\treturn getMarketStatus();\n\n}\n\n\nvoid MarketControl::rpcOrderCreate(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{Object(\"%\",\"any\")});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.create(args[0]));\n\t} catch (ValidatonError &e) {\n\t\trq.setError(400,\"Validation failed\", e.getError());\n\t}\n}\n\nvoid MarketControl::rpcOrderUpdate(RpcRequest rq) {\n\tstatic Value chkargs1 = {\"string\",Object(\"%\",\"any\")};\n\tstatic Value chkargs2 = {\"string\",Object(\"%\",\"any\"), \"string\"};\n\tValue args = rq.getArgs();\n\ttry {\n\t\tif (rq.checkArgs(chkargs1)) {\n\t\t\trq.setResult(orderControl.modify(args[0],args[1],json::undefined));\n\t\t} else if (rq.checkArgs(chkargs2)) {\n\t\t\trq.setResult(orderControl.modify(args[0],args[1],args[2]));\n\t\t} else {\n\t\t\trq.setArgError();\n\t\t}\n\t} catch (ValidatonError &e) {\n\t\trq.setError(400,\"Validation failed\", e.getError());\n\t} catch (OrderNotFoundError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t} catch (ConflictError &e) {\n\t\trq.setError(409,\"Conflict\",e.getActualDoc());\n\t}\n}\n\nvoid MarketControl::rpcOrderCancel(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{\"string\"});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.cancel(args[0]));\n\t} catch (OrderNotFoundError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t}\n}\n\nvoid MarketControl::rpcOrderGet(RpcRequest rq) {\n\tstatic Value chkargs (json::array,{\"string\"});\n\tif (!rq.checkArgs(chkargs)) return rq.setArgError();\n\tValue args = rq.getArgs();\n\ttry {\n\t\trq.setResult(orderControl.getOrder(args[0]));\n\t} catch (const couchit::RequestError &e) {\n\t\trq.setError(404,\"Order not found\");\n\t}\n}\n\nclass MarketControl::BasicFeed: public FeedControl {\npublic:\n\tBasicFeed(couchit::CouchDB &db,\n\t\t\t Value since,\n\t\t\t RpcRequest rq,\n\t\t\t String streamName)\n\t\t\t\t:FeedControl(db,since),rq(rq),streamName(streamName) {\n\n\t}\n\tvirtual void init() override {\n\t}\n\t~BasicFeed() {\n\t\tstop();\n\t}\n\nprotected:\n\tRpcRequest rq;\n\tString streamName;\n};\n\nclass MarketControl::OrderFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tstatic couchit::View initView(\"_design\/index\/_view\/queue\",couchit::View::includeDocs|couchit::View::update);\n\t\tinitialView = &initView;\n\t\tfeed.setFilter(couchit::Filter(\"index\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"id\",doc[\"_id\"])\n\t\t\t\t(\"_id\",undefined)});\n\t}\n\n};\n\nclass MarketControl::TradesFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tfeed.setFilter(couchit::Filter(\"trades\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"id\",doc[\"_id\"])\n\t\t\t\t(\"_id\",undefined)\n\t\t\t\t(\"_rev\",undefined)\n\t\t});\n\t}\n\n};\n\nclass MarketControl::PosFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tfeed.setFilter(couchit::Filter(\"positions\/stream\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\trq.sendNotify(streamName,{seqNum.toString(),\n\t\t\t\tObject(doc)\n\t\t\t\t(\"user\",doc[\"_id\"].getString().substr(2))\n\t\t\t\t(\"_id\",undefined)\n\t\t\t\t(\"_rev\",undefined)\n\t\t});\n\t}\n};\n\nclass MarketControl::OrderbookFeed: public BasicFeed {\npublic:\n\tusing BasicFeed::BasicFeed;\n\tvirtual void init() override {\n\t\tstatic couchit::View initView(\"_design\/index\/_view\/orderbook\",couchit::View::includeDocs|couchit::View::update);\n\t\tthis->initialView = &initView;\n\t\tfeed.setFilter(couchit::Filter(\"index\/orderbook\",couchit::Filter::includeDocs));\n\t}\n\tvirtual void onEvent(Value seqNum, Value doc) override {\n\t\tsendNotify(rq, streamName, doc, seqNum.toString());\n\t}\n\tstatic void sendNotify(RpcRequest &rq, StrViewA streamName, Value doc, Value seq) {\n\t\tObject ntf;\n\t\tbool finished = doc[\"finished\"].getBool();\n\t\trq.sendNotify(streamName,{seq,{doc[\"_id\"],doc[\"dir\"],doc[\"limitPrice\"],finished?Value(0):doc[\"size\"]}});\n\t}\n\n};\n\nvoid MarketControl::rpcStreamOrders(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\tordersFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\tordersFeed = new OrderFeed(ordersDb, since, rq, \"order\");\n\t\tordersFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamTrades(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\ttradesFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\ttradesFeed = new TradesFeed(tradesDb, since, rq, \"trade\");\n\t\ttradesFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamPositions(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\tposFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\tposFeed = new PosFeed(posDb, since, rq, \"position\");\n\t\tposFeed->start();\n\t\trq.setResult(true);\n\n\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\nvoid MarketControl::rpcStreamOrderbook(RpcRequest rq) {\n\tstatic Value turnOffArgs = Value(json::array,{false});\n\tstatic Value turnOnArgs = {true,{\"string\",\"optional\"} };\n\tif (rq.checkArgs(turnOffArgs)) {\n\n\t\torderbookFeed = nullptr;\n\t\trq.setResult(true);\n\n\n\t} else if (rq.checkArgs(turnOnArgs)) {\n\t\tValue since = rq.getArgs()[1];\n\t\torderbookFeed = new OrderbookFeed(ordersDb, since, rq, \"orderbook\");\n\t\torderbookFeed->start();\n\t\trq.setResult(true);\n\t} else {\n\t\trq.setArgError();\n\t}\n}\n\n\nvoid MarketControl::FeedControl::stop() {\n\n\tif (!stopped) {\n\t\tfeed.cancelWait();\n\t\tthr.join();\n\t\tstopped = true;\n\t}\n}\n\nvoid MarketControl::FeedControl::start() {\n\tbool initWait = false;\n\tusing namespace couchit;\n\tstd::condition_variable initWaitCond;\n\tstd::mutex lock;\n\n\tthr = std::thread([&]{\n\n\t\tinit();\n\n\t\t{\n\t\tstd::unique_lock<std::mutex> _(lock);\n\t\tinitWait = true;\n\t\tinitWaitCond.notify_all();\n\t\t}\n\n\t\tValue lastDoc;\n\t\tif (!since.defined() && initialView != nullptr)\n\t\t{\n\t\t\tQuery q = db.createQuery(*initialView);\n\t\t\tResult r = q.exec();\n\t\t\tfor (Row rw : r) {\n\t\t\t\tonEvent(r.getUpdateSeq(),rw.doc);\n\t\t\t\tlastDoc = rw.doc;\n\t\t\t}\n\t\t\tsince = r.getUpdateSeq();\n\t\t}\n\n\t\tif (since.defined())\n\t\t\tfeed.since(since);\n\t\ttry {\n\t\t\tfeed >> [&](ChangedDoc x) {\n\t\t\t\tif (x.doc == lastDoc) return true;\n\t\t\t\tlastDoc = json::undefined;\n\t\t\t\tonEvent(x.seqId, x.doc);\n\t\t\t\treturn true;\n\t\t\t};\n\t\t} catch (couchit::CanceledException &) {\n\n\t\t}\n\t});\n\n\tstd::unique_lock<std::mutex> _(lock);\n\tinitWaitCond.wait(_,[&]{return initWait;});\n\tstopped = false;\n}\n\nMarketControl::FeedControl::FeedControl(CouchDB& db, Value since)\n\t:feed(db.createChangesFeed()), since(since), db(db), stopped(true)\n{\n\tfeed.setTimeout(-1);\n\tfeed.includeDocs(true);\n}\n\nvoid MarketControl::rpcStreamLastId(RpcRequest rq) {\n\tif (!rq.checkArgs(json::array)) return rq.setArgError();\n\n\trq.setResult(Object(\"orders\",ordersDb.getLastSeqNumber())\n\t\t\t\t\t (\"trades\",tradesDb.getLastSeqNumber())\n\t\t\t\t\t (\"positions\",posDb.getLastSeqNumber())\n\t\t\t);\n\n}\n\nvoid quark::MarketControl::rpcStatusGet(RpcRequest rq) {\n\trq.setResult(getMarketStatus());\n}\n\nvoid quark::MarketControl::rpcStatusClear(RpcRequest rq) {\n\tcouchit::Document doc = ordersDb.get(\"error\");\n\tdoc.setDeleted();\n\tordersDb.put(doc);\n\trq.setResult(getMarketStatus());\n}\n\nvoid quark::MarketControl::rpcOrderbookGet(RpcRequest rq) {\n\tcouchit::View orderbookView(\"_design\/index\/_view\/orderbook\",couchit::View::update);\n\tcouchit::Result res = ordersDb.createQuery(orderbookView).exec();\n\tArray out;\n\tfor (couchit::Row rw : res) {\n\t\tout.push_back({rw[\"id\"],rw.key[0], rw.key[1], rw.value});\n\t}\n\trq.setResult(out);\n}\n\n\n}\n\n\/* namespace quark *\/\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Localization: update raw ptr to shared_ptr<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * ModSecurity, http:\/\/www.modsecurity.org\/\n * Copyright (c) 2015 Trustwave Holdings, Inc. (http:\/\/www.trustwave.com\/)\n *\n * You may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * If any of the files related to licensing are missing or if you have any\n * other questions related to licensing please contact Trustwave Holdings, Inc.\n * directly using the email address security@modsecurity.org.\n *\n *\/\n\n#include \"unit\/unit_test.h\"\n\n#include <string.h>\n\n#include <sstream>\n#include <string>\n\n#include \"common\/colors.h\"\n#include \"src\/utils.h\"\n\nnamespace modsecurity_test {\n\n\nstd::string string_to_hex(const std::string& input) {\n static const char* const lut = \"0123456789ABCDEF\";\n size_t len = input.length();\n\n std::string output;\n output.reserve(2 * len);\n for (size_t i = 0; i < len; ++i) {\n const unsigned char c = input[i];\n output.push_back(lut[c >> 4]);\n output.push_back(lut[c & 15]);\n }\n return output;\n}\n\n\nvoid replaceAll(std::string *s, const std::string &search,\n const char replace) {\n for (size_t pos = 0; ; pos += 0) {\n pos = s->find(search, pos);\n if (pos == std::string::npos) {\n break;\n }\n s->erase(pos, search.length());\n s->insert(pos, &replace, 1);\n }\n}\n\n\nstd::string UnitTest::print() {\n std::stringstream i;\n\n i << KRED << \"Test failed.\" << RESET;\n i << \" From: \" << this->filename << std::endl;\n i << \"{\" << std::endl;\n i << \" \\\"ret\\\": \\\"\" << this->ret << \"\\\"\" << std::endl;\n i << \" \\\"type\\\": \\\"\" << this->type << \"\\\"\" << std::endl;\n i << \" \\\"name\\\": \\\"\" << this->name << \"\\\"\" << std::endl;\n i << \" \\\"input\\\": \\\"\" << this->input << \"\\\"\" << std::endl;\n i << \" \\\"param\\\": \\\"\" << this->param << \"\\\"\" << std::endl;\n i << \" \\\"output\\\": \\\"\" << this->output << \"\\\"\" << std::endl;\n i << \"}\" << std::endl;\n if (this->ret != this->obtained) {\n i << \"Expecting: \\\"\" << this->ret << \"\\\" - returned: \\\"\";\n i << this->obtained << \"\\\"\" << std::endl;\n }\n if (this->output != this->obtainedOutput) {\n i << \"Expecting: \\\"\" << modsecurity::toHexIfNeeded(this->output);\n i << \"\\\" - returned: \\\"\";\n i << modsecurity::toHexIfNeeded(this->obtainedOutput) << \"\\\"\";\n i << std::endl;\n }\n\n return i.str();\n}\n\n\nUnitTest *UnitTest::from_yajl_node(yajl_val &node) {\n size_t num_tests = node->u.object.len;\n UnitTest *u = new UnitTest();\n\n for (int i = 0; i < num_tests; i++) {\n const char *key = node->u.object.keys[ i ];\n yajl_val val = node->u.object.values[ i ];\n\n\n if (strcmp(key, \"param\") == 0) {\n u->param = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"input\") == 0) {\n u->input = YAJL_GET_STRING(val);\n \/*\n * Converting \\\\u0000 to \\0 due to the following gcc bug:\n * https:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=53690\n *\n *\/\n replaceAll(&(u->input), \"\\\\0\", '\\0');\n replaceAll(&(u->input), \"\\\\xe4\", '\\xe4');\n replaceAll(&(u->input), \"\\\\x03\", '\\x03');\n replaceAll(&(u->input), \"\\\\xbf\", '\\xbf');\n replaceAll(&(u->input), \"\\\\xc9\", '\\xc9');\n replaceAll(&(u->input), \"\\\\x3b\", '\\x3b');\n replaceAll(&(u->input), \"\\\\xFF\", '\\xff');\n replaceAll(&(u->input), \"\\\\u0000\", '\\0');\n replaceAll(&(u->input), \"\\\\u0001\", '\\u0001');\n replaceAll(&(u->input), \"\\\\u0002\", '\\u0002');\n replaceAll(&(u->input), \"\\\\u0003\", '\\u0003');\n replaceAll(&(u->input), \"\\\\u0004\", '\\u0004');\n replaceAll(&(u->input), \"\\\\u0005\", '\\u0005');\n replaceAll(&(u->input), \"\\\\u0006\", '\\u0006');\n replaceAll(&(u->input), \"\\\\u0007\", '\\u0007');\n replaceAll(&(u->input), \"\\\\b\", '\\b');\n } else if (strcmp(key, \"name\") == 0) {\n u->name = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"type\") == 0) {\n u->type = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"ret\") == 0) {\n u->ret = YAJL_GET_INTEGER(val);\n } else if (strcmp(key, \"output\") == 0) {\n u->output = std::string(YAJL_GET_STRING(val));\n \/*\n * Converting \\\\u0000 to \\0 due to the following gcc bug:\n * https:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=53690\n *\n *\/\n \/\/ FIXME: Really? replace the hex chars in a smart fashion.\n replaceAll(&(u->output), \"\\\\x00\", '\\0');\n replaceAll(&(u->output), \"\\\\u0000\", '\\0');\n replaceAll(&(u->output), \"\\\\xe4\", '\\xe4');\n replaceAll(&(u->output), \"\\\\x03\", '\\x03');\n replaceAll(&(u->output), \"\\\\x04\", '\\x04');\n replaceAll(&(u->output), \"\\\\x07\", '\\x07');\n replaceAll(&(u->output), \"\\\\x09\", '\\x09');\n replaceAll(&(u->output), \"\\\\xbf\", '\\xbf');\n replaceAll(&(u->output), \"\\\\xc9\", '\\xc9');\n replaceAll(&(u->output), \"\\\\x3b\", '\\x3b');\n replaceAll(&(u->output), \"\\\\xFF\", '\\xff');\n replaceAll(&(u->output), \"\\\\0\", '\\0');\n replaceAll(&(u->output), \"\\\\x90\", '\\x90');\n replaceAll(&(u->output), \"\\\\x14\", '\\x14');\n replaceAll(&(u->output), \"\\\\x82\", '\\x82');\n replaceAll(&(u->output), \"\\\\x9a\", '\\x9a');\n replaceAll(&(u->output), \"\\\\xbc\", '\\xbc');\n replaceAll(&(u->output), \"\\\\xfe\", '\\xfe');\n replaceAll(&(u->output), \"\\\\x89\", '\\x89');\n replaceAll(&(u->output), \"\\\\xa0\", '\\xa0');\n replaceAll(&(u->output), \"\\\\xa2\", '\\xa2');\n replaceAll(&(u->output), \"\\\\xa6\", '\\xa6');\n replaceAll(&(u->output), \"\\\\xab\", '\\xab');\n replaceAll(&(u->output), \"\\\\xd4\", '\\xd4');\n replaceAll(&(u->output), \"\\\\x1d\", '\\x1d');\n replaceAll(&(u->output), \"\\\\x8c\", '\\x8c');\n replaceAll(&(u->output), \"\\\\xd9\", '\\xd9');\n replaceAll(&(u->output), \"\\\\x8f\", '\\x8f');\n replaceAll(&(u->output), \"\\\\xb2\", '\\xb2');\n replaceAll(&(u->output), \"\\\\xe9\", '\\xe9');\n replaceAll(&(u->output), \"\\\\x9e\", '\\x9e');\n replaceAll(&(u->output), \"\\\\x80\", '\\x80');\n replaceAll(&(u->output), \"\\\\x98\", '\\x98');\n replaceAll(&(u->output), \"\\\\xec\", '\\xec');\n replaceAll(&(u->output), \"\\\\xf8\", '\\xf8');\n replaceAll(&(u->output), \"\\\\xc1\", '\\xc1');\n replaceAll(&(u->output), \"\\\\xc3\", '\\xc3');\n replaceAll(&(u->output), \"\\\\x83\", '\\x83');\n replaceAll(&(u->output), \"\\\\xaa\", '\\xaa');\n replaceAll(&(u->output), \"\\\\xa5\", '\\xa5');\n replaceAll(&(u->output), \"\\\\xb5\", '\\xb5');\n replaceAll(&(u->output), \"\\\\xd1\", '\\xd1');\n replaceAll(&(u->output), \"\\\\xde\", '\\xde');\n replaceAll(&(u->output), \"\\\\xea\", '\\xea');\n replaceAll(&(u->output), \"\\\\xe6\", '\\xe6');\n replaceAll(&(u->output), \"\\\\xe7\", '\\xe7');\n replaceAll(&(u->output), \"\\\\xd3\", '\\xd3');\n replaceAll(&(u->output), \"\\\\xb4\", '\\xb4');\n replaceAll(&(u->output), \"\\\\xdf\", '\\xdf');\n replaceAll(&(u->output), \"\\\\xaf\", '\\xaf');\n replaceAll(&(u->output), \"\\\\x01\", '\\x01');\n replaceAll(&(u->output), \"\\\\x16\", '\\x16');\n replaceAll(&(u->output), \"\\\\x0b\", '\\x0b');\n replaceAll(&(u->output), \"\\\\x1f\", '\\x1f');\n replaceAll(&(u->output), \"\\\\x83\", '\\x83');\n replaceAll(&(u->output), \"\\\\xd2\", '\\xd2');\n }\n }\n\n return u;\n}\n\n} \/\/ namespace modsecurity_test\n<commit_msg>test: Using regexp to transform binary representation into binary blobs<commit_after>\/*\n * ModSecurity, http:\/\/www.modsecurity.org\/\n * Copyright (c) 2015 Trustwave Holdings, Inc. (http:\/\/www.trustwave.com\/)\n *\n * You may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * If any of the files related to licensing are missing or if you have any\n * other questions related to licensing please contact Trustwave Holdings, Inc.\n * directly using the email address security@modsecurity.org.\n *\n *\/\n\n#include \"unit\/unit_test.h\"\n\n#include <string.h>\n\n#include <sstream>\n#include <string>\n#include <iostream>\n#include <iterator>\n#include <regex>\n#include <string>\n\n#include \"common\/colors.h\"\n#include \"src\/utils.h\"\n\nnamespace modsecurity_test {\n\n\nstd::string string_to_hex(const std::string& input) {\n static const char* const lut = \"0123456789ABCDEF\";\n size_t len = input.length();\n\n std::string output;\n output.reserve(2 * len);\n for (size_t i = 0; i < len; ++i) {\n const unsigned char c = input[i];\n output.push_back(lut[c >> 4]);\n output.push_back(lut[c & 15]);\n }\n return output;\n}\n\n\nvoid replaceAll(std::string *s, const std::string &search,\n const char replace) {\n for (size_t pos = 0; ; pos += 0) {\n pos = s->find(search, pos);\n if (pos == std::string::npos) {\n break;\n }\n s->erase(pos, search.length());\n s->insert(pos, &replace, 1);\n }\n}\n\n\nstd::string UnitTest::print() {\n std::stringstream i;\n\n i << KRED << \"Test failed.\" << RESET;\n i << \" From: \" << this->filename << std::endl;\n i << \"{\" << std::endl;\n i << \" \\\"ret\\\": \\\"\" << this->ret << \"\\\"\" << std::endl;\n i << \" \\\"type\\\": \\\"\" << this->type << \"\\\"\" << std::endl;\n i << \" \\\"name\\\": \\\"\" << this->name << \"\\\"\" << std::endl;\n i << \" \\\"input\\\": \\\"\" << this->input << \"\\\"\" << std::endl;\n i << \" \\\"param\\\": \\\"\" << this->param << \"\\\"\" << std::endl;\n i << \" \\\"output\\\": \\\"\" << this->output << \"\\\"\" << std::endl;\n i << \"}\" << std::endl;\n if (this->ret != this->obtained) {\n i << \"Expecting: \\\"\" << this->ret << \"\\\" - returned: \\\"\";\n i << this->obtained << \"\\\"\" << std::endl;\n }\n if (this->output != this->obtainedOutput) {\n i << \"Expecting: \\\"\" << modsecurity::toHexIfNeeded(this->output);\n i << \"\\\" - returned: \\\"\";\n i << modsecurity::toHexIfNeeded(this->obtainedOutput) << \"\\\"\";\n i << std::endl;\n }\n\n return i.str();\n}\n\n\nUnitTest *UnitTest::from_yajl_node(yajl_val &node) {\n size_t num_tests = node->u.object.len;\n UnitTest *u = new UnitTest();\n\n for (int i = 0; i < num_tests; i++) {\n const char *key = node->u.object.keys[ i ];\n yajl_val val = node->u.object.values[ i ];\n\n\n if (strcmp(key, \"param\") == 0) {\n u->param = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"input\") == 0) {\n u->input = YAJL_GET_STRING(val);\n \/*\n * Converting \\\\u0000 to \\0 due to the following gcc bug:\n * https:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=53690\n *\n *\/\n replaceAll(&(u->input), \"\\\\0\", '\\0');\n replaceAll(&(u->input), \"\\\\xe4\", '\\xe4');\n replaceAll(&(u->input), \"\\\\x03\", '\\x03');\n replaceAll(&(u->input), \"\\\\xbf\", '\\xbf');\n replaceAll(&(u->input), \"\\\\xc9\", '\\xc9');\n replaceAll(&(u->input), \"\\\\x3b\", '\\x3b');\n replaceAll(&(u->input), \"\\\\xFF\", '\\xff');\n replaceAll(&(u->input), \"\\\\u0000\", '\\0');\n replaceAll(&(u->input), \"\\\\u0001\", '\\u0001');\n replaceAll(&(u->input), \"\\\\u0002\", '\\u0002');\n replaceAll(&(u->input), \"\\\\u0003\", '\\u0003');\n replaceAll(&(u->input), \"\\\\u0004\", '\\u0004');\n replaceAll(&(u->input), \"\\\\u0005\", '\\u0005');\n replaceAll(&(u->input), \"\\\\u0006\", '\\u0006');\n replaceAll(&(u->input), \"\\\\u0007\", '\\u0007');\n replaceAll(&(u->input), \"\\\\b\", '\\b');\n } else if (strcmp(key, \"name\") == 0) {\n u->name = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"type\") == 0) {\n u->type = YAJL_GET_STRING(val);\n } else if (strcmp(key, \"ret\") == 0) {\n u->ret = YAJL_GET_INTEGER(val);\n } else if (strcmp(key, \"output\") == 0) {\n u->output = std::string(YAJL_GET_STRING(val));\n std::string *in = &u->output;\n \/*\n * Converting \\\\u0000 to \\0 due to the following gcc bug:\n * https:\/\/gcc.gnu.org\/bugzilla\/show_bug.cgi?id=53690\n *\n *\/\n std::regex re(\"\\\\\\\\x([a-z0-9A-Z]{2})\");\n std::smatch match;\n while (std::regex_search(*in, match, re) && match.size() > 1) {\n unsigned int p;\n std::string toBeReplaced = match.str();\n toBeReplaced.erase(0, 2);\n sscanf(toBeReplaced.c_str(), \"%x\", &p);\n replaceAll(in, match.str(), p);\n }\n replaceAll(&(u->output), \"\\\\u0000\", '\\0');\n replaceAll(&(u->output), \"\\\\0\", '\\0');\n }\n }\n\n return u;\n}\n\n} \/\/ namespace modsecurity_test\n<|endoftext|>"} {"text":"<commit_before>#include \"view\/SceneView.h\"\n\n#include <OgreRoot.h>\n#include <OgreViewport.h>\n#include <OgreConfigFile.h>\n#include <OgreEntity.h>\n#include <OgreWindowEventUtilities.h>\n\nSceneView::SceneView()\n : camera(NULL),\n sceneManager(NULL),\n renderWindow(NULL) {\n}\n\nSceneView::~SceneView(void) {\n Ogre::Root* root = Ogre::Root::getSingletonPtr();\n delete root;\n}\n\nbool SceneView::initialize(std::string resourceConfigPath, std::string pluginConfigPath) {\n Ogre::Root* root = new Ogre::Root(pluginConfigPath);\n\n this->loadResourceConfig(resourceConfigPath);\n Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\n\n if(!root->restoreConfig() && !root->showConfigDialog()) {\n return false;\n }\n\n renderWindow = root->initialise(\n true, \/\/ auto-create the render window now\n \"Rally Sport Racing Game\");\n\n sceneManager = root->createSceneManager(Ogre::ST_GENERIC); \/\/ Todo: Research a good scene manager\n\n\n camera = this->addCamera(\"MainCamera\");\n Ogre::Viewport* viewport = this->addViewport(camera);\n camera->setAspectRatio(Ogre::Real(viewport->getActualWidth()) \/ Ogre::Real(viewport->getActualHeight()));\n\n \/\/ TODO: Fix this to follow car...\n camera->setPosition(Ogre::Vector3(0, 0, 80));\n camera->lookAt(Ogre::Vector3(0, 0, -300));\n\n \/\/ TODO: Implement separate scene loading (how do we do with lights?)\n Ogre::Entity* ogreHead = sceneManager->createEntity(\"Head\", \"ogrehead.mesh\");\n Ogre::SceneNode* headNode = sceneManager->getRootSceneNode()->createChildSceneNode();\n headNode->attachObject(ogreHead);\n sceneManager->setAmbientLight(Ogre::ColourValue(0.5, 0.5, 0.5));\n Ogre::Light* light = sceneManager->createLight(\"MainLight\");\n light->setPosition(20, 80, 50);\n}\n\nOgre::Viewport* SceneView::addViewport(Ogre::Camera* followedCamera) {\n Ogre::Viewport* viewport = renderWindow->addViewport(camera);\n viewport->setBackgroundColour(Ogre::ColourValue(0, 0, 0));\n\n return viewport;\n}\n\nOgre::Camera* SceneView::addCamera(Ogre::String cameraName) {\n \/\/ Setup camera to match viewport\n Ogre::Camera* camera = sceneManager->createCamera(cameraName);\n camera->setNearClipDistance(5);\n\n return camera;\n}\n\nvoid SceneView::loadResourceConfig(Ogre::String resourceConfigPath) {\n Ogre::ResourceGroupManager& resourceGroupManager = Ogre::ResourceGroupManager::getSingleton();\n\n Ogre::ConfigFile resourceConfig;\n resourceConfig.load(resourceConfigPath);\n\n for(Ogre::ConfigFile::SectionIterator sectionIterator = resourceConfig.getSectionIterator();\n sectionIterator.hasMoreElements();\n sectionIterator.moveNext()) {\n Ogre::ConfigFile::SettingsMultiMap* settings = sectionIterator.peekNextValue();\n\n \/\/ Now load all the resources for this resource group\n for(Ogre::ConfigFile::SettingsMultiMap::iterator resource = settings->begin();\n resource != settings->end();\n ++resource) {\n resourceGroupManager.addResourceLocation(\n resource->second, \/\/ filename of directory\n resource->first, \/\/ resource type\n sectionIterator.peekNextKey()); \/\/ resource group\n }\n }\n}\n\nbool SceneView::renderFrame() {\n Ogre::WindowEventUtilities::messagePump();\n\n if(renderWindow->isClosed()) {\n return false;\n } else {\n Ogre::Root& root = Ogre::Root::getSingleton();\n if(!root.renderOneFrame()) {\n return false;\n }\n }\n return true;\n}\n<commit_msg>Fixed potential bug where resources were loaded before a render context should have existed.<commit_after>#include \"view\/SceneView.h\"\n\n#include <OgreRoot.h>\n#include <OgreViewport.h>\n#include <OgreConfigFile.h>\n#include <OgreEntity.h>\n#include <OgreWindowEventUtilities.h>\n\nSceneView::SceneView()\n : camera(NULL),\n sceneManager(NULL),\n renderWindow(NULL) {\n}\n\nSceneView::~SceneView(void) {\n Ogre::Root* root = Ogre::Root::getSingletonPtr();\n delete root;\n}\n\nbool SceneView::initialize(std::string resourceConfigPath, std::string pluginConfigPath) {\n Ogre::Root* root = new Ogre::Root(pluginConfigPath);\n\n this->loadResourceConfig(resourceConfigPath);\n \/\/ (The actual precaching is done below, once there is a render context)\n\n if(!root->restoreConfig() && !root->showConfigDialog()) {\n return false;\n }\n\n renderWindow = root->initialise(\n true, \/\/ auto-create the render window now\n \"Rally Sport Racing Game\");\n\n sceneManager = root->createSceneManager(Ogre::ST_GENERIC); \/\/ Todo: Research a good scene manager\n\n \/\/ This should be done after creating a scene manager, so that there is a render context (GL\/D3D)\n Ogre::ResourceGroupManager::getSingleton().initialiseAllResourceGroups();\n\n camera = this->addCamera(\"MainCamera\");\n Ogre::Viewport* viewport = this->addViewport(camera);\n camera->setAspectRatio(Ogre::Real(viewport->getActualWidth()) \/ Ogre::Real(viewport->getActualHeight()));\n\n \/\/ TODO: Fix this to follow car...\n camera->setPosition(Ogre::Vector3(0, 0, 80));\n camera->lookAt(Ogre::Vector3(0, 0, -300));\n\n \/\/ TODO: Implement separate scene loading (how do we do with lights?)\n Ogre::Entity* ogreHead = sceneManager->createEntity(\"Head\", \"ogrehead.mesh\");\n Ogre::SceneNode* headNode = sceneManager->getRootSceneNode()->createChildSceneNode();\n headNode->attachObject(ogreHead);\n sceneManager->setAmbientLight(Ogre::ColourValue(0.5, 0.5, 0.5));\n Ogre::Light* light = sceneManager->createLight(\"MainLight\");\n light->setPosition(20, 80, 50);\n}\n\nOgre::Viewport* SceneView::addViewport(Ogre::Camera* followedCamera) {\n Ogre::Viewport* viewport = renderWindow->addViewport(camera);\n viewport->setBackgroundColour(Ogre::ColourValue(0, 0, 0));\n\n return viewport;\n}\n\nOgre::Camera* SceneView::addCamera(Ogre::String cameraName) {\n \/\/ Setup camera to match viewport\n Ogre::Camera* camera = sceneManager->createCamera(cameraName);\n camera->setNearClipDistance(5);\n\n return camera;\n}\n\nvoid SceneView::loadResourceConfig(Ogre::String resourceConfigPath) {\n Ogre::ResourceGroupManager& resourceGroupManager = Ogre::ResourceGroupManager::getSingleton();\n\n Ogre::ConfigFile resourceConfig;\n resourceConfig.load(resourceConfigPath);\n\n for(Ogre::ConfigFile::SectionIterator sectionIterator = resourceConfig.getSectionIterator();\n sectionIterator.hasMoreElements();\n sectionIterator.moveNext()) {\n Ogre::ConfigFile::SettingsMultiMap* settings = sectionIterator.peekNextValue();\n\n \/\/ Now load all the resources for this resource group\n for(Ogre::ConfigFile::SettingsMultiMap::iterator resource = settings->begin();\n resource != settings->end();\n ++resource) {\n resourceGroupManager.addResourceLocation(\n resource->second, \/\/ filename of directory\n resource->first, \/\/ resource type\n sectionIterator.peekNextKey()); \/\/ resource group\n }\n }\n}\n\nbool SceneView::renderFrame() {\n Ogre::WindowEventUtilities::messagePump();\n\n if(renderWindow->isClosed()) {\n return false;\n } else {\n Ogre::Root& root = Ogre::Root::getSingleton();\n if(!root.renderOneFrame()) {\n return false;\n }\n }\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"StateCollision.h\"\n#include \"Graphics.h\"\n#include \"input\/Input.h\"\n#include \"render\/Text.h\"\n\nusing WalrusRPG::Box;\nusing WalrusRPG::States::StateCollision;\nusing WalrusRPG::Utils::Rect;\nusing namespace WalrusRPG::Graphics;\nusing namespace WalrusRPG::Input;\n\nnamespace AABB\n{\n\t\t\/\/ returns true if the boxes are colliding (velocities are not used)\n\tbool AABBCheck(Box b1, Box b2)\n\t{\n\t return !(b1.x + b1.w <= b2.x || b1.x >= b2.x + b2.w || b1.y + b1.h <= b2.y || b1.y >= b2.y + b2.h);\n\t}\n\n}\n\nStateCollision::StateCollision()\n:p(40, 40, 8, 8, 0, 0), target(p), map{0}, cam(0,0)\n{\n\tsrand(4);\n\tfor (int i = 0; i < 10; ++i)\n\t{\n\t\tmap[rand()%20][rand()%20] = 1;\n\t\tmap[rand()%20][rand()%20] = 2;\n\t\tmap[rand()%20][rand()%20] = 3;\n\t\tmap[rand()%20][rand()%20] = 4;\n\t\tmap[rand()%20][rand()%20] = 5;\n\t}\n}\n\nStateCollision::~StateCollision()\n{\n\n}\n\nnamespace\n{\n\tbool tilemap_collision(char map[20][20], const Box&& object)\n\t{\n\t\tint left_tile = object.x \/ 16;\n\t\tint right_tile = (object.x+object.w-1) \/ 16;\n\t\tint top_tile = object.y \/ 16;\n\t\tint bottom_tile = (object.y + object.h-1) \/ 16;\n\n\t\tif(left_tile < 0) left_tile = 0;\n\t\tif(right_tile > 19) right_tile = 19;\n\t\tif(top_tile < 0) top_tile = 0;\n\t\tif(bottom_tile > 19) bottom_tile = 19;\n\n\t\tfor(int i=left_tile; i<=right_tile; i++)\n\t\t{\n\t\t for(int j=top_tile; j<=bottom_tile; j++)\n\t\t {\n\t\t char t = map[j][i];\n\t\t if(t)\n\t\t {\n\t\t \tif(t == 1 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 16., 16., 0, 0)))\n\t\t \treturn true;\n\t\t \tif(t == 2 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 16., 8., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 3 && AABB::AABBCheck(object, Box(16.*i, 16.*j+8, 16., 8., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 4 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 8., 16., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 5 && AABB::AABBCheck(object, Box(16.*i+8, 16.*j, 8., 16., 0, 0)))\n\t\t \t\treturn true;\n\t\t }\n\t\t }\n\t\t}\n\t\treturn false;\n\t}\n}\n\nvoid StateCollision::update(unsigned dt)\n{\n\tcollided_top = false;\n\tcollided_left = false;\n\tcollided_bottom = false;\n\tcollided_right = false;\n\tp.vx = 0;\n\tp.vy = 0;\n\tif(key_down(Key::K_LEFT))\n\t\tp.vx = -2. * dt;\n\tif(key_down(Key::K_RIGHT))\n\t\tp.vx = 2. * dt;\n\tif(key_down(Key::K_UP))\n\t\tp.vy = -2. * dt;\n\tif(key_down(Key::K_DOWN))\n\t\tp.vy = 2. * dt;\n\n\n\tfloat x_sigma = p.vx < 0. ? -1. : 1.;\n\tfloat vx = 0.;\n\twhile(vx != p.vx)\n\t{\n\t\tfloat add = (std::fabs(vx + x_sigma) > std::fabs(p.vx)) ? (x_sigma * std::fabs(p.vx - vx)) : x_sigma;\n\t\tif(tilemap_collision(map, Box(p.x + vx + add, p.y, p.w, p.h, 0, 0)))\n\t\t\tbreak;\n\t\tvx += add;\n\t}\n\tp.x += vx;\n\n\tfloat y_sigma = p.vy < 0. ? -1. : 1.;\n\tfloat vy = 0;\n\twhile(vy != p.vy)\n\t{\n\t\tfloat add = (std::fabs(vy + y_sigma) > std::fabs(p.vy)) ? (y_sigma * std::fabs(p.vy - vy)) : y_sigma;\n\t\tif(tilemap_collision(map, Box(p.x, p.y + vy + add, p.w, p.h, 0, 0)))\n\t\t\tbreak;\n\t\tvy += add;\n\t}\n\tp.y += vy;\n\n\tcam.set_center_x(p.x + p.w\/2);\n\tcam.set_center_y(p.y + p.h\/2);\n}\n\nvoid StateCollision::render(unsigned dt)\n{\n\tfill(Black);\n\tPixel a(Red);\n\n\tput_rectangle({static_cast<signed>(p.x)-cam.get_x(), static_cast<signed>(p.y)-cam.get_y(), static_cast<unsigned>(p.w), static_cast<unsigned>(p.h)}, a);\n\tfor (int y = 0; y < 20; ++y)\n\t{\n\t\tfor (int x = 0; x < 20; ++x)\n\t\t{\n\t\t\tif(map[y][x])\n\t\t\t{\n\t\t\t\tswitch(map[y][x])\n\t\t\t\t{\n\t\t\t\t\tcase 1:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 16, 16}, LightGray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 16, 8}, Gray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 3:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y()+8, 16, 8}, DarkGray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 4:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 8, 16}, Cyan);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 5:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x()+8, y*16-cam.get_y(), 8, 16}, Blue);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\tText::print_format(0, 8, \"x = %f\", p.x);\n\tText::print_format(0, 16, \"y = %f\", p.y);\n\tText::print_format(0, 24, \"vx = %f\", p.vx);\n\tText::print_format(0, 32, \"vy = %f\", p.vy);\n\n}<commit_msg>Nspire : math functions not included<commit_after>#include \"StateCollision.h\"\n#include \"Graphics.h\"\n#include \"input\/Input.h\"\n#include \"render\/Text.h\"\n#include <cmath>\n\nusing WalrusRPG::Box;\nusing WalrusRPG::States::StateCollision;\nusing WalrusRPG::Utils::Rect;\nusing namespace WalrusRPG::Graphics;\nusing namespace WalrusRPG::Input;\n\nnamespace AABB\n{\n\t\t\/\/ returns true if the boxes are colliding (velocities are not used)\n\tbool AABBCheck(Box b1, Box b2)\n\t{\n\t return !(b1.x + b1.w <= b2.x || b1.x >= b2.x + b2.w || b1.y + b1.h <= b2.y || b1.y >= b2.y + b2.h);\n\t}\n\n}\n\nStateCollision::StateCollision()\n:p(40, 40, 8, 8, 0, 0), target(p), map{0}, cam(0,0)\n{\n\tsrand(4);\n\tfor (int i = 0; i < 10; ++i)\n\t{\n\t\tmap[rand()%20][rand()%20] = 1;\n\t\tmap[rand()%20][rand()%20] = 2;\n\t\tmap[rand()%20][rand()%20] = 3;\n\t\tmap[rand()%20][rand()%20] = 4;\n\t\tmap[rand()%20][rand()%20] = 5;\n\t}\n}\n\nStateCollision::~StateCollision()\n{\n\n}\n\nnamespace\n{\n\tbool tilemap_collision(char map[20][20], const Box&& object)\n\t{\n\t\tint left_tile = object.x \/ 16;\n\t\tint right_tile = (object.x+object.w-1) \/ 16;\n\t\tint top_tile = object.y \/ 16;\n\t\tint bottom_tile = (object.y + object.h-1) \/ 16;\n\n\t\tif(left_tile < 0) left_tile = 0;\n\t\tif(right_tile > 19) right_tile = 19;\n\t\tif(top_tile < 0) top_tile = 0;\n\t\tif(bottom_tile > 19) bottom_tile = 19;\n\n\t\tfor(int i=left_tile; i<=right_tile; i++)\n\t\t{\n\t\t for(int j=top_tile; j<=bottom_tile; j++)\n\t\t {\n\t\t char t = map[j][i];\n\t\t if(t)\n\t\t {\n\t\t \tif(t == 1 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 16., 16., 0, 0)))\n\t\t \treturn true;\n\t\t \tif(t == 2 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 16., 8., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 3 && AABB::AABBCheck(object, Box(16.*i, 16.*j+8, 16., 8., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 4 && AABB::AABBCheck(object, Box(16.*i, 16.*j, 8., 16., 0, 0)))\n\t\t \t\treturn true;\n\t\t \tif(t == 5 && AABB::AABBCheck(object, Box(16.*i+8, 16.*j, 8., 16., 0, 0)))\n\t\t \t\treturn true;\n\t\t }\n\t\t }\n\t\t}\n\t\treturn false;\n\t}\n}\n\nvoid StateCollision::update(unsigned dt)\n{\n\tcollided_top = false;\n\tcollided_left = false;\n\tcollided_bottom = false;\n\tcollided_right = false;\n\tp.vx = 0;\n\tp.vy = 0;\n\tif(key_down(Key::K_LEFT))\n\t\tp.vx = -2. * dt;\n\tif(key_down(Key::K_RIGHT))\n\t\tp.vx = 2. * dt;\n\tif(key_down(Key::K_UP))\n\t\tp.vy = -2. * dt;\n\tif(key_down(Key::K_DOWN))\n\t\tp.vy = 2. * dt;\n\n\n\tfloat x_sigma = p.vx < 0. ? -1. : 1.;\n\tfloat vx = 0.;\n\twhile(vx != p.vx)\n\t{\n\t\tfloat add = (std::fabs(vx + x_sigma) > std::fabs(p.vx)) ? (x_sigma * std::fabs(p.vx - vx)) : x_sigma;\n\t\tif(tilemap_collision(map, Box(p.x + vx + add, p.y, p.w, p.h, 0, 0)))\n\t\t\tbreak;\n\t\tvx += add;\n\t}\n\tp.x += vx;\n\n\tfloat y_sigma = p.vy < 0. ? -1. : 1.;\n\tfloat vy = 0;\n\twhile(vy != p.vy)\n\t{\n\t\tfloat add = (std::fabs(vy + y_sigma) > std::fabs(p.vy)) ? (y_sigma * std::fabs(p.vy - vy)) : y_sigma;\n\t\tif(tilemap_collision(map, Box(p.x, p.y + vy + add, p.w, p.h, 0, 0)))\n\t\t\tbreak;\n\t\tvy += add;\n\t}\n\tp.y += vy;\n\n\tcam.set_center_x(p.x + p.w\/2);\n\tcam.set_center_y(p.y + p.h\/2);\n}\n\nvoid StateCollision::render(unsigned dt)\n{\n\tfill(Black);\n\tPixel a(Red);\n\n\tput_rectangle({static_cast<signed>(p.x)-cam.get_x(), static_cast<signed>(p.y)-cam.get_y(), static_cast<unsigned>(p.w), static_cast<unsigned>(p.h)}, a);\n\tfor (int y = 0; y < 20; ++y)\n\t{\n\t\tfor (int x = 0; x < 20; ++x)\n\t\t{\n\t\t\tif(map[y][x])\n\t\t\t{\n\t\t\t\tswitch(map[y][x])\n\t\t\t\t{\n\t\t\t\t\tcase 1:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 16, 16}, LightGray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 16, 8}, Gray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 3:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y()+8, 16, 8}, DarkGray);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 4:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x(), y*16-cam.get_y(), 8, 16}, Cyan);\n\t\t\t\t\tbreak;\n\t\t\t\t\tcase 5:\n\t\t\t\t\tput_rectangle({x*16-cam.get_x()+8, y*16-cam.get_y(), 8, 16}, Blue);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\t}\n\n\tText::print_format(0, 8, \"x = %f\", p.x);\n\tText::print_format(0, 16, \"y = %f\", p.y);\n\tText::print_format(0, 24, \"vx = %f\", p.vx);\n\tText::print_format(0, 32, \"vy = %f\", p.vy);\n\n}<|endoftext|>"} {"text":"<commit_before>#include \"space.h\"\n#include \"display.h\"\n#include \"window.h\"\n#include \"tree.h\"\n#include \"border.h\"\n\nextern kwm_screen KWMScreen;\nextern kwm_focus KWMFocus;\nextern kwm_toggles KWMToggles;\n\nbool GetTagForCurrentSpace(std::string &Tag)\n{\n if(KWMScreen.Current && IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n if(Space->Mode == SpaceModeBSP)\n {\n Tag = \"[bsp]\";\n return true;\n }\n else if(Space->Mode == SpaceModeFloating)\n {\n Tag = \"[float]\";\n return true;\n }\n\n tree_node *Node = Space->RootNode; \n bool FoundFocusedWindow = false;\n int FocusedIndex = 0;\n int NumberOfWindows = 0;\n\n if(Node && KWMFocus.Window)\n {\n FocusedIndex = 1;\n NumberOfWindows = 1;\n\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n\n while(Node->RightChild)\n {\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n\n if(!FoundFocusedWindow)\n ++FocusedIndex;\n\n ++NumberOfWindows;\n\n Node = Node->RightChild;\n }\n\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n }\n\n if(FoundFocusedWindow)\n Tag = \"[\" + std::to_string(FocusedIndex) + \"\/\" + std::to_string(NumberOfWindows) + \"]\";\n else\n Tag = \"[\" + std::to_string(NumberOfWindows) + \"]\";\n\n return true;\n }\n\n return false;\n}\n\nbool IsActiveSpaceFloating()\n{\n return KWMScreen.Current && IsSpaceFloating(KWMScreen.Current->ActiveSpace);\n}\n\nbool IsSpaceFloating(int SpaceID)\n{\n bool Result = false;\n\n if(IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n std::map<int, space_info>::iterator It = KWMScreen.Current->Space.find(SpaceID);\n if(It != KWMScreen.Current->Space.end())\n Result = KWMScreen.Current->Space[SpaceID].Mode == SpaceModeFloating;\n }\n\n return Result;\n}\n\nbool IsSpaceInitializedForScreen(screen_info *Screen)\n{\n std::map<int, space_info>::iterator It = Screen->Space.find(Screen->ActiveSpace);\n if(It == Screen->Space.end())\n return false;\n else\n return It->second.Initialized;\n}\n\nbool DoesSpaceExistInMapOfScreen(screen_info *Screen)\n{\n std::map<int, space_info>::iterator It = Screen->Space.find(Screen->ActiveSpace);\n if(It == Screen->Space.end())\n return false;\n else\n return It->second.RootNode != NULL && It->second.Initialized;\n}\n\nbool IsSpaceTransitionInProgress()\n{\n int CurrentSpace = CGSGetActiveSpace(CGSDefaultConnection);\n CFStringRef Identifier = CGSCopyManagedDisplayForSpace(CGSDefaultConnection, CurrentSpace);\n bool Result = CGSManagedDisplayIsAnimating(CGSDefaultConnection, (CFStringRef)Identifier);\n if(Result)\n {\n DEBUG(\"IsSpaceTransitionInProgress() Space transition detected\")\n KWMScreen.UpdateSpace = true;\n ClearFocusedWindow();\n ClearMarkedWindow();\n }\n\n return Result;\n}\n\nbool IsSpaceSystemOrFullscreen()\n{\n bool Result = false;\n\n if(IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n bool Result = CGSSpaceGetType(CGSDefaultConnection, KWMScreen.Current->ActiveSpace) != CGSSpaceTypeUser;\n if(Result)\n DEBUG(\"IsSpaceSystemOrFullscreen() Space is not user created\")\n }\n\n return Result;\n}\n\nvoid FloatFocusedSpace()\n{\n if(KWMScreen.Current &&\n IsSpaceInitializedForScreen(KWMScreen.Current) &&\n KWMToggles.EnableTilingMode &&\n !IsSpaceTransitionInProgress() &&\n !IsSpaceSystemOrFullscreen() &&\n FilterWindowList(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n DestroyNodeTree(Space->RootNode, Space->Mode);\n Space->RootNode = NULL;\n Space->Mode = SpaceModeFloating;\n ClearFocusedWindow();\n }\n}\n\nvoid TileFocusedSpace(space_tiling_option Mode)\n{\n if(KWMScreen.Current &&\n IsSpaceInitializedForScreen(KWMScreen.Current) &&\n KWMToggles.EnableTilingMode &&\n !IsSpaceTransitionInProgress() &&\n !IsSpaceSystemOrFullscreen() &&\n FilterWindowList(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n if(Space->Mode == Mode)\n return;\n\n DestroyNodeTree(Space->RootNode, Space->Mode);\n Space->RootNode = NULL;\n\n Space->Mode = Mode;\n std::vector<window_info*> WindowsOnDisplay = GetAllWindowsOnDisplay(KWMScreen.Current->ID);\n CreateWindowNodeTree(KWMScreen.Current, &WindowsOnDisplay);\n }\n}\n\nvoid ToggleFocusedSpaceFloating()\n{\n if(KWMScreen.Current && IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n if(!IsSpaceFloating(KWMScreen.Current->ActiveSpace))\n FloatFocusedSpace();\n else\n TileFocusedSpace(SpaceModeBSP);\n }\n}\n<commit_msg>#fixed #121 - properly assign tag of newly created spaces<commit_after>#include \"space.h\"\n#include \"display.h\"\n#include \"window.h\"\n#include \"tree.h\"\n#include \"border.h\"\n\nextern kwm_screen KWMScreen;\nextern kwm_focus KWMFocus;\nextern kwm_toggles KWMToggles;\nextern kwm_mode KWMMode;\n\nbool GetTagForCurrentSpace(std::string &Tag)\n{\n if(KWMScreen.Current && IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n if(Space->Mode == SpaceModeBSP)\n {\n Tag = \"[bsp]\";\n return true;\n }\n else if(Space->Mode == SpaceModeFloating)\n {\n Tag = \"[float]\";\n return true;\n }\n\n tree_node *Node = Space->RootNode; \n bool FoundFocusedWindow = false;\n int FocusedIndex = 0;\n int NumberOfWindows = 0;\n\n if(Node && KWMFocus.Window)\n {\n FocusedIndex = 1;\n NumberOfWindows = 1;\n\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n\n while(Node->RightChild)\n {\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n\n if(!FoundFocusedWindow)\n ++FocusedIndex;\n\n ++NumberOfWindows;\n\n Node = Node->RightChild;\n }\n\n if(Node->WindowID == KWMFocus.Window->WID)\n FoundFocusedWindow = true;\n }\n\n if(FoundFocusedWindow)\n Tag = \"[\" + std::to_string(FocusedIndex) + \"\/\" + std::to_string(NumberOfWindows) + \"]\";\n else\n Tag = \"[\" + std::to_string(NumberOfWindows) + \"]\";\n\n return true;\n }\n else\n {\n if(KWMMode.Space == SpaceModeBSP)\n Tag = \"[bsp]\";\n else if(KWMMode.Space == SpaceModeFloating)\n Tag = \"[float]\";\n else if(KWMMode.Space == SpaceModeMonocle)\n Tag = \"[monocle]\";\n\n return true;\n }\n\n return false;\n}\n\nbool IsActiveSpaceFloating()\n{\n return KWMScreen.Current && IsSpaceFloating(KWMScreen.Current->ActiveSpace);\n}\n\nbool IsSpaceFloating(int SpaceID)\n{\n bool Result = false;\n\n if(IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n std::map<int, space_info>::iterator It = KWMScreen.Current->Space.find(SpaceID);\n if(It != KWMScreen.Current->Space.end())\n Result = KWMScreen.Current->Space[SpaceID].Mode == SpaceModeFloating;\n }\n\n return Result;\n}\n\nbool IsSpaceInitializedForScreen(screen_info *Screen)\n{\n std::map<int, space_info>::iterator It = Screen->Space.find(Screen->ActiveSpace);\n if(It == Screen->Space.end())\n return false;\n else\n return It->second.Initialized;\n}\n\nbool DoesSpaceExistInMapOfScreen(screen_info *Screen)\n{\n std::map<int, space_info>::iterator It = Screen->Space.find(Screen->ActiveSpace);\n if(It == Screen->Space.end())\n return false;\n else\n return It->second.RootNode != NULL && It->second.Initialized;\n}\n\nbool IsSpaceTransitionInProgress()\n{\n int CurrentSpace = CGSGetActiveSpace(CGSDefaultConnection);\n CFStringRef Identifier = CGSCopyManagedDisplayForSpace(CGSDefaultConnection, CurrentSpace);\n bool Result = CGSManagedDisplayIsAnimating(CGSDefaultConnection, (CFStringRef)Identifier);\n if(Result)\n {\n DEBUG(\"IsSpaceTransitionInProgress() Space transition detected\")\n KWMScreen.UpdateSpace = true;\n ClearFocusedWindow();\n ClearMarkedWindow();\n }\n\n return Result;\n}\n\nbool IsSpaceSystemOrFullscreen()\n{\n bool Result = false;\n\n if(IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n bool Result = CGSSpaceGetType(CGSDefaultConnection, KWMScreen.Current->ActiveSpace) != CGSSpaceTypeUser;\n if(Result)\n DEBUG(\"IsSpaceSystemOrFullscreen() Space is not user created\")\n }\n\n return Result;\n}\n\nvoid FloatFocusedSpace()\n{\n if(KWMScreen.Current &&\n IsSpaceInitializedForScreen(KWMScreen.Current) &&\n KWMToggles.EnableTilingMode &&\n !IsSpaceTransitionInProgress() &&\n !IsSpaceSystemOrFullscreen() &&\n FilterWindowList(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n DestroyNodeTree(Space->RootNode, Space->Mode);\n Space->RootNode = NULL;\n Space->Mode = SpaceModeFloating;\n ClearFocusedWindow();\n }\n}\n\nvoid TileFocusedSpace(space_tiling_option Mode)\n{\n if(KWMScreen.Current &&\n IsSpaceInitializedForScreen(KWMScreen.Current) &&\n KWMToggles.EnableTilingMode &&\n !IsSpaceTransitionInProgress() &&\n !IsSpaceSystemOrFullscreen() &&\n FilterWindowList(KWMScreen.Current))\n {\n space_info *Space = &KWMScreen.Current->Space[KWMScreen.Current->ActiveSpace];\n if(Space->Mode == Mode)\n return;\n\n DestroyNodeTree(Space->RootNode, Space->Mode);\n Space->RootNode = NULL;\n\n Space->Mode = Mode;\n std::vector<window_info*> WindowsOnDisplay = GetAllWindowsOnDisplay(KWMScreen.Current->ID);\n CreateWindowNodeTree(KWMScreen.Current, &WindowsOnDisplay);\n }\n}\n\nvoid ToggleFocusedSpaceFloating()\n{\n if(KWMScreen.Current && IsSpaceInitializedForScreen(KWMScreen.Current))\n {\n if(!IsSpaceFloating(KWMScreen.Current->ActiveSpace))\n FloatFocusedSpace();\n else\n TileFocusedSpace(SpaceModeBSP);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <filesystem\/ringbuffer.hpp>\n\n#include \"util\/time.hpp\"\n#include \"ch.hpp\"\n#include \"hal.h\"\n#include <chprintf.h>\n\nstatic uint16_t overflowCount = 0;\n\nvoid rb_init(rb_t *buf, std::size_t size, uint8_t *elems)\n{\n buf->size = size;\n buf->count = 0;\n buf->head = 0;\n buf->elems = elems;\n}\n\nstd::size_t rb_add(rb_t *buf, std::size_t num_bytes, uint8_t *input)\n{\n BaseSequentialStream *chp = (BaseSequentialStream*)&SD4;\n \/* Check if buffer is too full. *\/\n if (buf->size - buf->count < num_bytes) {\n overflowCount++;\n chprintf(chp, \"RB %d %d %d %d ###\\r\\n\", ST2MS(chibios_rt::System::getTime()), overflowCount, num_bytes, buf->count);\n\n \/\/ Drop a few bytes\n int dropCount = 10000;\n buf->head = (buf->head + dropCount) % buf->size;\n buf->count -= dropCount;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n static uint32_t tail;\n tail = (buf->head + buf->count) % buf->size;\n for (i=0; i<num_bytes; i++) {\n buf->elems[tail++] = input[i];\n if (tail == buf->size) tail = 0;\n }\n\n buf->count += num_bytes;\n\n return num_bytes;\n}\n\nstd::size_t rb_remove(rb_t *buf, std::size_t num_bytes, uint8_t *output)\n{\n BaseSequentialStream *chp = (BaseSequentialStream*)&SD4;\n \/* Check if buffer does not contain enough data. *\/\n if (buf->count < num_bytes) {\n num_bytes = buf->count;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n for (i=0; i<num_bytes; i++) {\n output[i] = buf->elems[buf->head++];\n if (buf->head == buf->size) buf->head = 0;\n }\n\n \/\/ Crudely calculate average throughput\n static uint32_t avgBps = 0;\n static systime_t lastTime = 0;\n avgBps = 0.01*num_bytes*1000\/(ST2MS(chibios_rt::System::getTime()-lastTime)) + 0.99*avgBps;\n lastTime = chibios_rt::System::getTime();\n chprintf(chp, \"RB<%d> %d %d %d\\r\\n\", ST2MS(chibios_rt::System::getTime()), overflowCount, avgBps, buf->count);\n\n\n buf->count -= num_bytes;\n\n return num_bytes;\n}\n\nstd::size_t rb_peek(rb_t *buf, std::size_t num_bytes, uint8_t *output)\n{\n \/* Check if buffer does not contain enough data. *\/\n if (buf->count < num_bytes) {\n num_bytes = buf->count;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n uint32_t idx = buf->head;\n for (i=0; i<num_bytes; i++) {\n output[i] = buf->elems[idx++];\n if (idx == buf->size) idx = 0;\n }\n\n return num_bytes;\n}\n\n<commit_msg>Disable filesystem debug prints.<commit_after>#include <filesystem\/ringbuffer.hpp>\n\n#include \"util\/time.hpp\"\n#include \"ch.hpp\"\n#include \"hal.h\"\n#include <chprintf.h>\n\nstatic uint16_t overflowCount = 0;\n\nvoid rb_init(rb_t *buf, std::size_t size, uint8_t *elems)\n{\n buf->size = size;\n buf->count = 0;\n buf->head = 0;\n buf->elems = elems;\n}\n\nstd::size_t rb_add(rb_t *buf, std::size_t num_bytes, uint8_t *input)\n{\n BaseSequentialStream *chp = (BaseSequentialStream*)&SD4;\n \/* Check if buffer is too full. *\/\n if (buf->size - buf->count < num_bytes) {\n overflowCount++;\n \/\/chprintf(chp, \"RB %d %d %d %d ###\\r\\n\", ST2MS(chibios_rt::System::getTime()), overflowCount, num_bytes, buf->count);\n\n \/\/ Drop a few bytes\n int dropCount = 10000;\n buf->head = (buf->head + dropCount) % buf->size;\n buf->count -= dropCount;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n static uint32_t tail;\n tail = (buf->head + buf->count) % buf->size;\n for (i=0; i<num_bytes; i++) {\n buf->elems[tail++] = input[i];\n if (tail == buf->size) tail = 0;\n }\n\n buf->count += num_bytes;\n\n return num_bytes;\n}\n\nstd::size_t rb_remove(rb_t *buf, std::size_t num_bytes, uint8_t *output)\n{\n BaseSequentialStream *chp = (BaseSequentialStream*)&SD4;\n \/* Check if buffer does not contain enough data. *\/\n if (buf->count < num_bytes) {\n num_bytes = buf->count;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n for (i=0; i<num_bytes; i++) {\n output[i] = buf->elems[buf->head++];\n if (buf->head == buf->size) buf->head = 0;\n }\n\n \/\/ Crudely calculate average throughput\n static uint32_t avgBps = 0;\n static systime_t lastTime = 0;\n avgBps = 0.01*num_bytes*1000\/(ST2MS(chibios_rt::System::getTime()-lastTime)) + 0.99*avgBps;\n lastTime = chibios_rt::System::getTime();\n \/\/chprintf(chp, \"RB<%d> %d %d %d\\r\\n\", ST2MS(chibios_rt::System::getTime()), overflowCount, avgBps, buf->count);\n\n\n buf->count -= num_bytes;\n\n return num_bytes;\n}\n\nstd::size_t rb_peek(rb_t *buf, std::size_t num_bytes, uint8_t *output)\n{\n \/* Check if buffer does not contain enough data. *\/\n if (buf->count < num_bytes) {\n num_bytes = buf->count;\n }\n\n \/* Copy data. *\/\n static uint16_t i;\n uint32_t idx = buf->head;\n for (i=0; i<num_bytes; i++) {\n output[i] = buf->elems[idx++];\n if (idx == buf->size) idx = 0;\n }\n\n return num_bytes;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2010-2014, MIT Probabilistic Computing Project\n*\n* Lead Developers: Dan Lovell and Jay Baxter\n* Authors: Dan Lovell, Baxter Eaves, Jay Baxter, Vikash Mansinghka\n* Research Leads: Vikash Mansinghka, Patrick Shafto\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n#include \"ContinuousComponentModel.h\"\n#include <boost\/math\/distributions\/students_t.hpp>\n#include <boost\/random\/student_t_distribution.hpp>\nusing namespace std;\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers) {\n count = 0;\n score = 0;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n init_suffstats();\n set_log_Z_0();\n}\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers,\n int COUNT, double SUM_X, double SUM_X_SQ) {\n count = COUNT;\n sum_x = SUM_X;\n sum_x_squared = SUM_X_SQ;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n set_log_Z_0();\n score = calc_marginal_logp();\n}\n\nvoid ContinuousComponentModel::get_hyper_doubles(double& r, double& nu,\n double& s, double& mu) const {\n r = hyper_r;\n nu = hyper_nu;\n s = hyper_s;\n mu = hyper_mu;\n}\n\ndouble ContinuousComponentModel::calc_marginal_logp() const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n return numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp(\n double element) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n\n double logp_prime = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n return logp_prime - score;\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp_constrained(\n double element, const vector<double>& constraints) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double baseline = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n \/\/\n get_hyper_doubles(r, nu, s, mu);\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double updated = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n double predictive_logp = updated - baseline;\n return predictive_logp;\n}\n\nvector<double> ContinuousComponentModel::calc_hyper_conditionals(\n const string& which_hyper, const vector<double>& hyper_grid) const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n\n if (which_hyper == \"r\") {\n return numerics::calc_continuous_r_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, nu, s, mu);\n } else if (which_hyper == \"nu\") {\n return numerics::calc_continuous_nu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, s, mu);\n } else if (which_hyper == \"s\") {\n return numerics::calc_continuous_s_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, mu);\n } else if (which_hyper == \"mu\") {\n return numerics::calc_continuous_mu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, s);\n } else {\n \/\/ error condition\n vector<double> error;\n return error;\n }\n}\n\ndouble ContinuousComponentModel::insert_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::remove_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::remove_from_continuous_suffstats(count, sum_x, sum_x_squared,\n element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::incorporate_hyper_update() {\n hyper_r = get(*p_hypers, (string) \"r\");\n hyper_nu = get(*p_hypers, (string) \"nu\");\n hyper_s = get(*p_hypers, (string) \"s\");\n hyper_mu = get(*p_hypers, (string) \"mu\");\n double score_0 = score;\n \/\/ hypers[which_hyper] = value; \/\/ set by owner of hypers object\n set_log_Z_0();\n score = calc_marginal_logp();\n double score_delta = score - score_0;\n return score_delta;\n}\n\nvoid ContinuousComponentModel::set_log_Z_0() {\n double r, nu, s, mu;\n get_hyper_doubles(r, nu, s, mu);\n log_Z_0 = numerics::calc_continuous_logp(0, r, nu, s, 0);\n}\n\nvoid ContinuousComponentModel::init_suffstats() {\n sum_x = 0.;\n sum_x_squared = 0.;\n}\n\nvoid ContinuousComponentModel::get_suffstats(int& count_out, double& sum_x_out,\n double& sum_x_squared_out) const {\n count_out = count;\n sum_x_out = sum_x;\n sum_x_squared_out = sum_x_squared;\n}\n\ndouble ContinuousComponentModel::get_draw(int random_seed) const {\n vector<double> constraints;\n return get_draw_constrained(random_seed, constraints);\n}\n\ndouble ContinuousComponentModel::get_draw_constrained(int random_seed,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n \/\/ s must be divided by two to work in the T-distribution (see Kevin Murphy's 2007 cheat sheet)\n \/\/ http:\/\/www.cs.ubc.ca\/~murphyk\/Teaching\/CS340-Fall07\/reading\/NG.pdf\n \/\/ http:\/\/www.stats.ox.ac.uk\/~teh\/research\/notes\/GaussianInverseGamma.pdf\n s \/= 2;\n \/\/\n boost::mt19937 _engine(random_seed);\n boost::uniform_01<boost::mt19937> _dist(_engine);\n boost::random::student_t_distribution<double> student_t(nu);\n double student_t_draw = student_t(_dist);\n double coeff = sqrt((s * (r + 1)) \/ (nu \/ 2. * r));\n double draw = student_t_draw * coeff + mu;\n return draw;\n}\n\n\/\/ For simple predictive probability\ndouble ContinuousComponentModel::get_predictive_cdf(double element,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n \/\/ s must be divided by two to work in the T-distribution (see Kevin Murphy's 2007 cheat sheet)\n s \/= 2;\n\n boost::math::students_t dist(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu \/ 2. * r));\n\n \/\/ manipulate the number so it will fit in the standard t (reverse of the draw proceedure)\n double rev_draw = (element - mu) \/ coeff ;\n\n double cdfval = boost::math::cdf(dist, rev_draw);\n\n return cdfval;\n}\n\nmap<string, double> ContinuousComponentModel::_get_suffstats() const {\n map<string, double> suffstats;\n suffstats[\"sum_x\"] = sum_x;\n suffstats[\"sum_x_squared\"] = sum_x_squared;\n return suffstats;\n}\n\nmap<string, double> ContinuousComponentModel::get_hypers() const {\n map<string, double> hypers;\n hypers[\"r\"] = hyper_r;\n hypers[\"s\"] = hyper_s;\n hypers[\"nu\"] = hyper_nu;\n hypers[\"mu\"] = hyper_mu;\n return hypers;\n}\n\n<commit_msg>Omit cancelling pairs of divisions by two.<commit_after>\/*\n* Copyright (c) 2010-2014, MIT Probabilistic Computing Project\n*\n* Lead Developers: Dan Lovell and Jay Baxter\n* Authors: Dan Lovell, Baxter Eaves, Jay Baxter, Vikash Mansinghka\n* Research Leads: Vikash Mansinghka, Patrick Shafto\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n#include \"ContinuousComponentModel.h\"\n#include <boost\/math\/distributions\/students_t.hpp>\n#include <boost\/random\/student_t_distribution.hpp>\nusing namespace std;\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers) {\n count = 0;\n score = 0;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n init_suffstats();\n set_log_Z_0();\n}\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers,\n int COUNT, double SUM_X, double SUM_X_SQ) {\n count = COUNT;\n sum_x = SUM_X;\n sum_x_squared = SUM_X_SQ;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n set_log_Z_0();\n score = calc_marginal_logp();\n}\n\nvoid ContinuousComponentModel::get_hyper_doubles(double& r, double& nu,\n double& s, double& mu) const {\n r = hyper_r;\n nu = hyper_nu;\n s = hyper_s;\n mu = hyper_mu;\n}\n\ndouble ContinuousComponentModel::calc_marginal_logp() const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n return numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp(\n double element) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n\n double logp_prime = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n return logp_prime - score;\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp_constrained(\n double element, const vector<double>& constraints) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double baseline = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n \/\/\n get_hyper_doubles(r, nu, s, mu);\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double updated = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n double predictive_logp = updated - baseline;\n return predictive_logp;\n}\n\nvector<double> ContinuousComponentModel::calc_hyper_conditionals(\n const string& which_hyper, const vector<double>& hyper_grid) const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n\n if (which_hyper == \"r\") {\n return numerics::calc_continuous_r_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, nu, s, mu);\n } else if (which_hyper == \"nu\") {\n return numerics::calc_continuous_nu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, s, mu);\n } else if (which_hyper == \"s\") {\n return numerics::calc_continuous_s_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, mu);\n } else if (which_hyper == \"mu\") {\n return numerics::calc_continuous_mu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, s);\n } else {\n \/\/ error condition\n vector<double> error;\n return error;\n }\n}\n\ndouble ContinuousComponentModel::insert_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::remove_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::remove_from_continuous_suffstats(count, sum_x, sum_x_squared,\n element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::incorporate_hyper_update() {\n hyper_r = get(*p_hypers, (string) \"r\");\n hyper_nu = get(*p_hypers, (string) \"nu\");\n hyper_s = get(*p_hypers, (string) \"s\");\n hyper_mu = get(*p_hypers, (string) \"mu\");\n double score_0 = score;\n \/\/ hypers[which_hyper] = value; \/\/ set by owner of hypers object\n set_log_Z_0();\n score = calc_marginal_logp();\n double score_delta = score - score_0;\n return score_delta;\n}\n\nvoid ContinuousComponentModel::set_log_Z_0() {\n double r, nu, s, mu;\n get_hyper_doubles(r, nu, s, mu);\n log_Z_0 = numerics::calc_continuous_logp(0, r, nu, s, 0);\n}\n\nvoid ContinuousComponentModel::init_suffstats() {\n sum_x = 0.;\n sum_x_squared = 0.;\n}\n\nvoid ContinuousComponentModel::get_suffstats(int& count_out, double& sum_x_out,\n double& sum_x_squared_out) const {\n count_out = count;\n sum_x_out = sum_x;\n sum_x_squared_out = sum_x_squared;\n}\n\ndouble ContinuousComponentModel::get_draw(int random_seed) const {\n vector<double> constraints;\n return get_draw_constrained(random_seed, constraints);\n}\n\ndouble ContinuousComponentModel::get_draw_constrained(int random_seed,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n \/\/ http:\/\/www.cs.ubc.ca\/~murphyk\/Teaching\/CS340-Fall07\/reading\/NG.pdf\n \/\/ http:\/\/www.stats.ox.ac.uk\/~teh\/research\/notes\/GaussianInverseGamma.pdf\n \/\/\n boost::mt19937 _engine(random_seed);\n boost::uniform_01<boost::mt19937> _dist(_engine);\n boost::random::student_t_distribution<double> student_t(nu);\n double student_t_draw = student_t(_dist);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n double draw = student_t_draw * coeff + mu;\n return draw;\n}\n\n\/\/ For simple predictive probability\ndouble ContinuousComponentModel::get_predictive_cdf(double element,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n boost::math::students_t dist(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n\n \/\/ manipulate the number so it will fit in the standard t (reverse of the draw proceedure)\n double rev_draw = (element - mu) \/ coeff ;\n\n double cdfval = boost::math::cdf(dist, rev_draw);\n\n return cdfval;\n}\n\nmap<string, double> ContinuousComponentModel::_get_suffstats() const {\n map<string, double> suffstats;\n suffstats[\"sum_x\"] = sum_x;\n suffstats[\"sum_x_squared\"] = sum_x_squared;\n return suffstats;\n}\n\nmap<string, double> ContinuousComponentModel::get_hypers() const {\n map<string, double> hypers;\n hypers[\"r\"] = hyper_r;\n hypers[\"s\"] = hyper_s;\n hypers[\"nu\"] = hyper_nu;\n hypers[\"mu\"] = hyper_mu;\n return hypers;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Copyright (c) 2010-2016, MIT Probabilistic Computing Project\n*\n* Lead Developers: Dan Lovell and Jay Baxter\n* Authors: Dan Lovell, Baxter Eaves, Jay Baxter, Vikash Mansinghka\n* Research Leads: Vikash Mansinghka, Patrick Shafto\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n#include \"ContinuousComponentModel.h\"\n#include <boost\/math\/distributions\/students_t.hpp>\nusing namespace std;\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers) {\n count = 0;\n score = 0;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n init_suffstats();\n set_log_Z_0();\n}\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers,\n int COUNT, double SUM_X, double SUM_X_SQ) {\n count = COUNT;\n sum_x = SUM_X;\n sum_x_squared = SUM_X_SQ;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n set_log_Z_0();\n score = calc_marginal_logp();\n}\n\nvoid ContinuousComponentModel::get_hyper_doubles(double& r, double& nu,\n double& s, double& mu) const {\n r = hyper_r;\n nu = hyper_nu;\n s = hyper_s;\n mu = hyper_mu;\n}\n\ndouble ContinuousComponentModel::calc_marginal_logp() const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n return numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp(\n double element) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n\n double logp_prime = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n return logp_prime - score;\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp_constrained(\n double element, const vector<double>& constraints) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double baseline = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n \/\/\n get_hyper_doubles(r, nu, s, mu);\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double updated = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n double predictive_logp = updated - baseline;\n return predictive_logp;\n}\n\nvector<double> ContinuousComponentModel::calc_hyper_conditionals(\n const string& which_hyper, const vector<double>& hyper_grid) const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n\n if (which_hyper == \"r\") {\n return numerics::calc_continuous_r_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, nu, s, mu);\n } else if (which_hyper == \"nu\") {\n return numerics::calc_continuous_nu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, s, mu);\n } else if (which_hyper == \"s\") {\n return numerics::calc_continuous_s_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, mu);\n } else if (which_hyper == \"mu\") {\n return numerics::calc_continuous_mu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, s);\n } else {\n \/\/ error condition\n vector<double> error;\n return error;\n }\n}\n\ndouble ContinuousComponentModel::insert_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::remove_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::remove_from_continuous_suffstats(count, sum_x, sum_x_squared,\n element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::incorporate_hyper_update() {\n hyper_r = get(*p_hypers, (string) \"r\");\n hyper_nu = get(*p_hypers, (string) \"nu\");\n hyper_s = get(*p_hypers, (string) \"s\");\n hyper_mu = get(*p_hypers, (string) \"mu\");\n double score_0 = score;\n \/\/ hypers[which_hyper] = value; \/\/ set by owner of hypers object\n set_log_Z_0();\n score = calc_marginal_logp();\n double score_delta = score - score_0;\n return score_delta;\n}\n\nvoid ContinuousComponentModel::set_log_Z_0() {\n double r, nu, s, mu;\n get_hyper_doubles(r, nu, s, mu);\n log_Z_0 = numerics::calc_continuous_logp(0, r, nu, s, 0);\n}\n\nvoid ContinuousComponentModel::init_suffstats() {\n sum_x = 0.;\n sum_x_squared = 0.;\n}\n\nvoid ContinuousComponentModel::get_suffstats(int& count_out, double& sum_x_out,\n double& sum_x_squared_out) const {\n count_out = count;\n sum_x_out = sum_x;\n sum_x_squared_out = sum_x_squared;\n}\n\ndouble ContinuousComponentModel::get_draw(int random_seed) const {\n vector<double> constraints;\n return get_draw_constrained(random_seed, constraints);\n}\n\ndouble ContinuousComponentModel::get_draw_constrained(int random_seed,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n \/\/ http:\/\/www.cs.ubc.ca\/~murphyk\/Teaching\/CS340-Fall07\/reading\/NG.pdf\n \/\/ http:\/\/www.stats.ox.ac.uk\/~teh\/research\/notes\/GaussianInverseGamma.pdf\n \/\/\n double student_t_draw = RandomNumberGenerator(random_seed).student_t(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n double draw = student_t_draw * coeff + mu;\n return draw;\n}\n\n\/\/ For simple predictive probability\ndouble ContinuousComponentModel::get_predictive_cdf(double element,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n boost::math::students_t dist(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n\n \/\/ manipulate the number so it will fit in the standard t (reverse of the draw proceedure)\n double rev_draw = (element - mu) \/ coeff ;\n\n double cdfval = boost::math::cdf(dist, rev_draw);\n\n return cdfval;\n}\n\nmap<string, double> ContinuousComponentModel::_get_suffstats() const {\n map<string, double> suffstats;\n suffstats[\"sum_x\"] = sum_x;\n suffstats[\"sum_x_squared\"] = sum_x_squared;\n return suffstats;\n}\n\nmap<string, double> ContinuousComponentModel::get_hypers() const {\n map<string, double> hypers;\n hypers[\"r\"] = hyper_r;\n hypers[\"s\"] = hyper_s;\n hypers[\"nu\"] = hyper_nu;\n hypers[\"mu\"] = hyper_mu;\n return hypers;\n}\n\n<commit_msg>Disable continuous get_predictive_cdf.<commit_after>\/*\n* Copyright (c) 2010-2016, MIT Probabilistic Computing Project\n*\n* Lead Developers: Dan Lovell and Jay Baxter\n* Authors: Dan Lovell, Baxter Eaves, Jay Baxter, Vikash Mansinghka\n* Research Leads: Vikash Mansinghka, Patrick Shafto\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\/\n#include \"ContinuousComponentModel.h\"\nusing namespace std;\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers) {\n count = 0;\n score = 0;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n init_suffstats();\n set_log_Z_0();\n}\n\nContinuousComponentModel::ContinuousComponentModel(const CM_Hypers& in_hypers,\n int COUNT, double SUM_X, double SUM_X_SQ) {\n count = COUNT;\n sum_x = SUM_X;\n sum_x_squared = SUM_X_SQ;\n p_hypers = &in_hypers;\n hyper_r = get(*p_hypers, string(\"r\"));\n hyper_nu = get(*p_hypers, string(\"nu\"));\n hyper_s = get(*p_hypers, string(\"s\"));\n hyper_mu = get(*p_hypers, string(\"mu\"));\n set_log_Z_0();\n score = calc_marginal_logp();\n}\n\nvoid ContinuousComponentModel::get_hyper_doubles(double& r, double& nu,\n double& s, double& mu) const {\n r = hyper_r;\n nu = hyper_nu;\n s = hyper_s;\n mu = hyper_mu;\n}\n\ndouble ContinuousComponentModel::calc_marginal_logp() const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n return numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp(\n double element) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n\n double logp_prime = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n return logp_prime - score;\n}\n\ndouble ContinuousComponentModel::calc_element_predictive_logp_constrained(\n double element, const vector<double>& constraints) const {\n if (isnan(element)) {\n return 0;\n }\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n \/\/\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double baseline = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n \/\/\n get_hyper_doubles(r, nu, s, mu);\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n double updated = numerics::calc_continuous_logp(count, r, nu, s, log_Z_0);\n double predictive_logp = updated - baseline;\n return predictive_logp;\n}\n\nvector<double> ContinuousComponentModel::calc_hyper_conditionals(\n const string& which_hyper, const vector<double>& hyper_grid) const {\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n\n if (which_hyper == \"r\") {\n return numerics::calc_continuous_r_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, nu, s, mu);\n } else if (which_hyper == \"nu\") {\n return numerics::calc_continuous_nu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, s, mu);\n } else if (which_hyper == \"s\") {\n return numerics::calc_continuous_s_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, mu);\n } else if (which_hyper == \"mu\") {\n return numerics::calc_continuous_mu_conditionals(hyper_grid, count, sum_x,\n sum_x_squared, r, nu, s);\n } else {\n \/\/ error condition\n vector<double> error;\n return error;\n }\n}\n\ndouble ContinuousComponentModel::insert_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared, element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::remove_element(double element) {\n if (isnan(element)) {\n return 0;\n }\n double score_0 = score;\n numerics::remove_from_continuous_suffstats(count, sum_x, sum_x_squared,\n element);\n score = calc_marginal_logp();\n double delta_score = score - score_0;\n return delta_score;\n}\n\ndouble ContinuousComponentModel::incorporate_hyper_update() {\n hyper_r = get(*p_hypers, (string) \"r\");\n hyper_nu = get(*p_hypers, (string) \"nu\");\n hyper_s = get(*p_hypers, (string) \"s\");\n hyper_mu = get(*p_hypers, (string) \"mu\");\n double score_0 = score;\n \/\/ hypers[which_hyper] = value; \/\/ set by owner of hypers object\n set_log_Z_0();\n score = calc_marginal_logp();\n double score_delta = score - score_0;\n return score_delta;\n}\n\nvoid ContinuousComponentModel::set_log_Z_0() {\n double r, nu, s, mu;\n get_hyper_doubles(r, nu, s, mu);\n log_Z_0 = numerics::calc_continuous_logp(0, r, nu, s, 0);\n}\n\nvoid ContinuousComponentModel::init_suffstats() {\n sum_x = 0.;\n sum_x_squared = 0.;\n}\n\nvoid ContinuousComponentModel::get_suffstats(int& count_out, double& sum_x_out,\n double& sum_x_squared_out) const {\n count_out = count;\n sum_x_out = sum_x;\n sum_x_squared_out = sum_x_squared;\n}\n\ndouble ContinuousComponentModel::get_draw(int random_seed) const {\n vector<double> constraints;\n return get_draw_constrained(random_seed, constraints);\n}\n\ndouble ContinuousComponentModel::get_draw_constrained(int random_seed,\n const vector<double>& constraints) const {\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n \/\/ http:\/\/www.cs.ubc.ca\/~murphyk\/Teaching\/CS340-Fall07\/reading\/NG.pdf\n \/\/ http:\/\/www.stats.ox.ac.uk\/~teh\/research\/notes\/GaussianInverseGamma.pdf\n \/\/\n double student_t_draw = RandomNumberGenerator(random_seed).student_t(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n double draw = student_t_draw * coeff + mu;\n return draw;\n}\n\n\/\/ For simple predictive probability\ndouble ContinuousComponentModel::get_predictive_cdf(double element,\n const vector<double>& constraints) const {\n#if 1\n return -HUGE_VAL;\n#else\n \/\/ get modified suffstats\n double r, nu, s, mu;\n int count;\n double sum_x, sum_x_squared;\n get_hyper_doubles(r, nu, s, mu);\n get_suffstats(count, sum_x, sum_x_squared);\n int num_constraints = (int) constraints.size();\n for (int constraint_idx = 0; constraint_idx < num_constraints;\n constraint_idx++) {\n double constraint = constraints[constraint_idx];\n numerics::insert_to_continuous_suffstats(count, sum_x, sum_x_squared,\n constraint);\n }\n numerics::update_continuous_hypers(count, sum_x, sum_x_squared, r, nu, s, mu);\n\n boost::math::students_t dist(nu);\n double coeff = sqrt((s * (r + 1)) \/ (nu * r));\n\n \/\/ manipulate the number so it will fit in the standard t (reverse of the draw proceedure)\n double rev_draw = (element - mu) \/ coeff ;\n\n double cdfval = boost::math::cdf(dist, rev_draw);\n\n return cdfval;\n#endif\n}\n\nmap<string, double> ContinuousComponentModel::_get_suffstats() const {\n map<string, double> suffstats;\n suffstats[\"sum_x\"] = sum_x;\n suffstats[\"sum_x_squared\"] = sum_x_squared;\n return suffstats;\n}\n\nmap<string, double> ContinuousComponentModel::get_hypers() const {\n map<string, double> hypers;\n hypers[\"r\"] = hyper_r;\n hypers[\"s\"] = hyper_s;\n hypers[\"nu\"] = hyper_nu;\n hypers[\"mu\"] = hyper_mu;\n return hypers;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014 Samsung Electronics Co., Ltd.\n\/\/\n\/\/ Licensed under the Flora License, Version 1.0 (the License);\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/floralicense.org\/license\/\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an AS IS BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\/\/ CLASS HEADER\n#include <dali\/internal\/event\/images\/image-impl.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/public-api\/common\/dali-common.h>\n\n#include <dali\/integration-api\/platform-abstraction.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/internal\/event\/resources\/resource-ticket.h>\n#include <dali\/internal\/event\/common\/thread-local-storage.h>\n#include <dali\/internal\/event\/resources\/resource-client.h>\n#include <dali\/internal\/event\/images\/image-factory.h>\n#include <dali\/internal\/event\/images\/nine-patch-image-impl.h>\n#include <dali\/internal\/event\/common\/stage-impl.h>\n\nusing namespace Dali::Integration;\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\nImage::Image( LoadPolicy loadPol, ReleasePolicy releasePol )\n: mWidth(0),\n mHeight(0),\n mLoadPolicy(loadPol),\n mReleasePolicy(releasePol),\n mConnectionCount(0),\n mImageFactory(ThreadLocalStorage::Get().GetImageFactory())\n{\n}\n\nImage* Image::New()\n{\n return new Image;\n}\n\nImage* Image::New( const std::string& filename, const Dali::ImageAttributes& attributes, LoadPolicy loadPol, ReleasePolicy releasePol )\n{\n if( IsNinePatchFileName(filename) )\n {\n NinePatchImage* image = new NinePatchImage( filename, attributes, loadPol, releasePol );\n return image;\n }\n else\n {\n Image* image = new Image( loadPol, releasePol );\n\n if( ! filename.empty() )\n {\n Vector2 closestSize;\n\n Internal::ThreadLocalStorage::Get().GetPlatformAbstraction().GetClosestImageSize( filename, attributes, closestSize );\n image->mWidth = closestSize.width;\n image->mHeight = closestSize.height;\n }\n\n image->mRequest = image->mImageFactory.RegisterRequest( filename, &attributes );\n\n if( Dali::Image::Immediate == loadPol )\n {\n \/\/ Trigger loading of the image on a seperate resource thread as soon as it\n \/\/ can be scheduled:\n image->mTicket = image->mImageFactory.Load( image->mRequest.Get() );\n image->mTicket->AddObserver( *image );\n }\n \/\/ else lazily load image data later, only when it is needed to draw something:\n\n DALI_LOG_SET_OBJECT_STRING( image, filename );\n\n return image;\n }\n}\n\nImage* Image::New( NativeImage& nativeImg, LoadPolicy loadPol, ReleasePolicy releasePol )\n{\n Image* image = new Image;\n ResourceClient &resourceClient = ThreadLocalStorage::Get().GetResourceClient();\n\n\n image->mWidth = nativeImg.GetWidth();\n image->mHeight = nativeImg.GetHeight();\n\n const ResourceTicketPtr& ticket = resourceClient.AddNativeImage( nativeImg );\n DALI_ASSERT_DEBUG( dynamic_cast<ImageTicket*>( ticket.Get() ) && \"Resource ticket not ImageTicket subclass for image resource.\\n\" );\n image->mTicket = static_cast<ImageTicket*>(ticket.Get());\n image->mTicket->AddObserver( *image );\n\n return image;\n}\n\nImage::~Image()\n{\n if( mTicket )\n {\n mTicket->RemoveObserver( *this );\n if( Stage::IsInstalled() )\n {\n mImageFactory.ReleaseTicket( mTicket.Get() );\n }\n }\n}\n\nbool Image::DoConnectSignal( BaseObject* object, ConnectionTrackerInterface* tracker, const std::string& signalName, FunctorDelegate* functor )\n{\n bool connected( true );\n DALI_ASSERT_DEBUG( dynamic_cast<Image*>( object ) && \"Resource ticket not ImageTicket subclass for image resource.\\n\" );\n Image* image = static_cast<Image*>(object);\n\n if( Dali::Image::SIGNAL_IMAGE_LOADING_FINISHED == signalName )\n {\n image->LoadingFinishedSignal().Connect( tracker, functor );\n }\n else if(Dali::Image::SIGNAL_IMAGE_UPLOADED == signalName)\n {\n image->UploadedSignal().Connect( tracker, functor );\n }\n else\n {\n \/\/ signalName does not match any signal\n connected = false;\n }\n\n return connected;\n}\n\nResourceId Image::GetResourceId() const\n{\n ResourceId ret = mTicket ? mTicket->GetId() : 0;\n\n return ret;\n}\n\nconst Dali::ImageAttributes& Image::GetAttributes() const\n{\n if( mTicket )\n {\n return mImageFactory.GetActualAttributes( mTicket->GetId() );\n }\n else\n {\n return mImageFactory.GetRequestAttributes( mRequest.Get() );\n }\n}\n\nconst std::string& Image::GetFilename() const\n{\n return mImageFactory.GetRequestPath( mRequest.Get() );\n}\n\nvoid Image::Reload()\n{\n if ( mRequest )\n {\n ResourceTicketPtr ticket = mImageFactory.Reload( mRequest.Get() );\n SetTicket( ticket.Get() );\n }\n}\n\nvoid Image::ResourceLoadingFailed(const ResourceTicket& ticket)\n{\n mLoadingFinishedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceLoadingSucceeded(const ResourceTicket& ticket)\n{\n \/\/ Update size with actual loaded size\n const ImageTicket* imageTicket = static_cast<const ImageTicket*>(&ticket);\n mWidth = imageTicket->GetWidth();\n mHeight = imageTicket->GetHeight();\n mLoadingFinishedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceUploaded(const ResourceTicket& ticket)\n{\n mUploadedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceSavingSucceeded( const ResourceTicket& ticket )\n{\n \/\/ do nothing\n}\n\nvoid Image::ResourceSavingFailed( const ResourceTicket& ticket )\n{\n \/\/ do nothing\n}\n\nunsigned int Image::GetWidth() const\n{\n if( mTicket )\n {\n const ImageAttributes& attr = mImageFactory.GetActualAttributes( mTicket->GetId() );\n return attr.GetWidth();\n }\n else if( mRequest )\n {\n const ImageAttributes& attr = mImageFactory.GetRequestAttributes( mRequest.Get() );\n return attr.GetWidth();\n }\n else\n {\n return mWidth;\n }\n}\n\nunsigned int Image::GetHeight() const\n{\n if( mTicket )\n {\n const ImageAttributes& attr = mImageFactory.GetActualAttributes( mTicket->GetId() );\n return attr.GetHeight();\n }\n else if( mRequest )\n {\n const ImageAttributes& attr = mImageFactory.GetRequestAttributes( mRequest.Get() );\n return attr.GetHeight();\n }\n else\n {\n return mHeight;\n }\n}\n\nVector2 Image::GetNaturalSize() const\n{\n return Vector2( mWidth, mHeight );\n}\n\nvoid Image::Connect()\n{\n ++mConnectionCount;\n\n if( mConnectionCount == 1 )\n {\n \/\/ ticket was thrown away when related actors went offstage or image loading on demand\n if( !mTicket )\n {\n ResourceTicketPtr newTicket = mImageFactory.Load( mRequest.Get() );\n SetTicket( newTicket.Get() );\n }\n }\n}\n\nvoid Image::Disconnect()\n{\n if( !mTicket )\n {\n return;\n }\n\n DALI_ASSERT_DEBUG( mConnectionCount > 0 );\n --mConnectionCount;\n if( mConnectionCount == 0 && mReleasePolicy == Dali::Image::Unused )\n {\n \/\/ release image memory when it's not visible anymore (decrease ref. count of texture)\n SetTicket( NULL );\n }\n}\n\nvoid Image::SetTicket( ResourceTicket* ticket )\n{\n if( ticket == mTicket.Get() )\n {\n return;\n }\n\n if( mTicket )\n {\n mTicket->RemoveObserver( *this );\n mImageFactory.ReleaseTicket( mTicket.Get() );\n }\n\n if( ticket )\n {\n mTicket.Reset( ticket );\n mTicket->AddObserver( *this );\n }\n else\n {\n mTicket.Reset();\n }\n}\n\nbool Image::IsNinePatchFileName( std::string filename )\n{\n bool match = false;\n\n std::string::const_iterator iter = filename.end();\n iter--;\n enum { SUFFIX, HASH, HASH_DOT, DONE } state = SUFFIX;\n while(iter >= filename.begin() && state != DONE)\n {\n switch(state)\n {\n case SUFFIX:\n {\n if(*iter == '.')\n {\n state = HASH;\n }\n else if(!isalnum(*iter))\n {\n state = DONE;\n }\n }\n break;\n case HASH:\n {\n if( *iter == '#' || *iter == '9' )\n {\n state = HASH_DOT;\n }\n else\n {\n state = DONE;\n }\n }\n break;\n case HASH_DOT:\n {\n if(*iter == '.')\n {\n state = DONE;\n match = true;\n }\n }\n break;\n case DONE:\n {\n }\n break;\n }\n iter--;\n }\n return match;\n}\n\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Dali\n<commit_msg>Fixed issue with filename parser for 9 patch images<commit_after>\/\/\n\/\/ Copyright (c) 2014 Samsung Electronics Co., Ltd.\n\/\/\n\/\/ Licensed under the Flora License, Version 1.0 (the License);\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/floralicense.org\/license\/\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an AS IS BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\/\/ CLASS HEADER\n#include <dali\/internal\/event\/images\/image-impl.h>\n\n\/\/ INTERNAL INCLUDES\n#include <dali\/public-api\/common\/dali-common.h>\n\n#include <dali\/integration-api\/platform-abstraction.h>\n#include <dali\/integration-api\/debug.h>\n#include <dali\/internal\/event\/resources\/resource-ticket.h>\n#include <dali\/internal\/event\/common\/thread-local-storage.h>\n#include <dali\/internal\/event\/resources\/resource-client.h>\n#include <dali\/internal\/event\/images\/image-factory.h>\n#include <dali\/internal\/event\/images\/nine-patch-image-impl.h>\n#include <dali\/internal\/event\/common\/stage-impl.h>\n\nusing namespace Dali::Integration;\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\nImage::Image( LoadPolicy loadPol, ReleasePolicy releasePol )\n: mWidth(0),\n mHeight(0),\n mLoadPolicy(loadPol),\n mReleasePolicy(releasePol),\n mConnectionCount(0),\n mImageFactory(ThreadLocalStorage::Get().GetImageFactory())\n{\n}\n\nImage* Image::New()\n{\n return new Image;\n}\n\nImage* Image::New( const std::string& filename, const Dali::ImageAttributes& attributes, LoadPolicy loadPol, ReleasePolicy releasePol )\n{\n if( IsNinePatchFileName(filename) )\n {\n NinePatchImage* image = new NinePatchImage( filename, attributes, loadPol, releasePol );\n return image;\n }\n else\n {\n Image* image = new Image( loadPol, releasePol );\n\n if( ! filename.empty() )\n {\n Vector2 closestSize;\n\n Internal::ThreadLocalStorage::Get().GetPlatformAbstraction().GetClosestImageSize( filename, attributes, closestSize );\n image->mWidth = closestSize.width;\n image->mHeight = closestSize.height;\n }\n\n image->mRequest = image->mImageFactory.RegisterRequest( filename, &attributes );\n\n if( Dali::Image::Immediate == loadPol )\n {\n \/\/ Trigger loading of the image on a seperate resource thread as soon as it\n \/\/ can be scheduled:\n image->mTicket = image->mImageFactory.Load( image->mRequest.Get() );\n image->mTicket->AddObserver( *image );\n }\n \/\/ else lazily load image data later, only when it is needed to draw something:\n\n DALI_LOG_SET_OBJECT_STRING( image, filename );\n\n return image;\n }\n}\n\nImage* Image::New( NativeImage& nativeImg, LoadPolicy loadPol, ReleasePolicy releasePol )\n{\n Image* image = new Image;\n ResourceClient &resourceClient = ThreadLocalStorage::Get().GetResourceClient();\n\n\n image->mWidth = nativeImg.GetWidth();\n image->mHeight = nativeImg.GetHeight();\n\n const ResourceTicketPtr& ticket = resourceClient.AddNativeImage( nativeImg );\n DALI_ASSERT_DEBUG( dynamic_cast<ImageTicket*>( ticket.Get() ) && \"Resource ticket not ImageTicket subclass for image resource.\\n\" );\n image->mTicket = static_cast<ImageTicket*>(ticket.Get());\n image->mTicket->AddObserver( *image );\n\n return image;\n}\n\nImage::~Image()\n{\n if( mTicket )\n {\n mTicket->RemoveObserver( *this );\n if( Stage::IsInstalled() )\n {\n mImageFactory.ReleaseTicket( mTicket.Get() );\n }\n }\n}\n\nbool Image::DoConnectSignal( BaseObject* object, ConnectionTrackerInterface* tracker, const std::string& signalName, FunctorDelegate* functor )\n{\n bool connected( true );\n DALI_ASSERT_DEBUG( dynamic_cast<Image*>( object ) && \"Resource ticket not ImageTicket subclass for image resource.\\n\" );\n Image* image = static_cast<Image*>(object);\n\n if( Dali::Image::SIGNAL_IMAGE_LOADING_FINISHED == signalName )\n {\n image->LoadingFinishedSignal().Connect( tracker, functor );\n }\n else if(Dali::Image::SIGNAL_IMAGE_UPLOADED == signalName)\n {\n image->UploadedSignal().Connect( tracker, functor );\n }\n else\n {\n \/\/ signalName does not match any signal\n connected = false;\n }\n\n return connected;\n}\n\nResourceId Image::GetResourceId() const\n{\n ResourceId ret = mTicket ? mTicket->GetId() : 0;\n\n return ret;\n}\n\nconst Dali::ImageAttributes& Image::GetAttributes() const\n{\n if( mTicket )\n {\n return mImageFactory.GetActualAttributes( mTicket->GetId() );\n }\n else\n {\n return mImageFactory.GetRequestAttributes( mRequest.Get() );\n }\n}\n\nconst std::string& Image::GetFilename() const\n{\n return mImageFactory.GetRequestPath( mRequest.Get() );\n}\n\nvoid Image::Reload()\n{\n if ( mRequest )\n {\n ResourceTicketPtr ticket = mImageFactory.Reload( mRequest.Get() );\n SetTicket( ticket.Get() );\n }\n}\n\nvoid Image::ResourceLoadingFailed(const ResourceTicket& ticket)\n{\n mLoadingFinishedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceLoadingSucceeded(const ResourceTicket& ticket)\n{\n \/\/ Update size with actual loaded size\n const ImageTicket* imageTicket = static_cast<const ImageTicket*>(&ticket);\n mWidth = imageTicket->GetWidth();\n mHeight = imageTicket->GetHeight();\n mLoadingFinishedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceUploaded(const ResourceTicket& ticket)\n{\n mUploadedV2.Emit( Dali::Image( this ) );\n}\n\nvoid Image::ResourceSavingSucceeded( const ResourceTicket& ticket )\n{\n \/\/ do nothing\n}\n\nvoid Image::ResourceSavingFailed( const ResourceTicket& ticket )\n{\n \/\/ do nothing\n}\n\nunsigned int Image::GetWidth() const\n{\n if( mTicket )\n {\n const ImageAttributes& attr = mImageFactory.GetActualAttributes( mTicket->GetId() );\n return attr.GetWidth();\n }\n else if( mRequest )\n {\n const ImageAttributes& attr = mImageFactory.GetRequestAttributes( mRequest.Get() );\n return attr.GetWidth();\n }\n else\n {\n return mWidth;\n }\n}\n\nunsigned int Image::GetHeight() const\n{\n if( mTicket )\n {\n const ImageAttributes& attr = mImageFactory.GetActualAttributes( mTicket->GetId() );\n return attr.GetHeight();\n }\n else if( mRequest )\n {\n const ImageAttributes& attr = mImageFactory.GetRequestAttributes( mRequest.Get() );\n return attr.GetHeight();\n }\n else\n {\n return mHeight;\n }\n}\n\nVector2 Image::GetNaturalSize() const\n{\n return Vector2( mWidth, mHeight );\n}\n\nvoid Image::Connect()\n{\n ++mConnectionCount;\n\n if( mConnectionCount == 1 )\n {\n \/\/ ticket was thrown away when related actors went offstage or image loading on demand\n if( !mTicket )\n {\n ResourceTicketPtr newTicket = mImageFactory.Load( mRequest.Get() );\n SetTicket( newTicket.Get() );\n }\n }\n}\n\nvoid Image::Disconnect()\n{\n if( !mTicket )\n {\n return;\n }\n\n DALI_ASSERT_DEBUG( mConnectionCount > 0 );\n --mConnectionCount;\n if( mConnectionCount == 0 && mReleasePolicy == Dali::Image::Unused )\n {\n \/\/ release image memory when it's not visible anymore (decrease ref. count of texture)\n SetTicket( NULL );\n }\n}\n\nvoid Image::SetTicket( ResourceTicket* ticket )\n{\n if( ticket == mTicket.Get() )\n {\n return;\n }\n\n if( mTicket )\n {\n mTicket->RemoveObserver( *this );\n mImageFactory.ReleaseTicket( mTicket.Get() );\n }\n\n if( ticket )\n {\n mTicket.Reset( ticket );\n mTicket->AddObserver( *this );\n }\n else\n {\n mTicket.Reset();\n }\n}\n\nbool Image::IsNinePatchFileName( std::string filename )\n{\n bool match = false;\n\n std::string::const_reverse_iterator iter = filename.rbegin();\n iter--;\n enum { SUFFIX, HASH, HASH_DOT, DONE } state = SUFFIX;\n while(iter < filename.rend() && state != DONE)\n {\n switch(state)\n {\n case SUFFIX:\n {\n if(*iter == '.')\n {\n state = HASH;\n }\n else if(!isalnum(*iter))\n {\n state = DONE;\n }\n }\n break;\n case HASH:\n {\n if( *iter == '#' || *iter == '9' )\n {\n state = HASH_DOT;\n }\n else\n {\n state = DONE;\n }\n }\n break;\n case HASH_DOT:\n {\n if(*iter == '.')\n {\n match = true;\n }\n state = DONE; \/\/ Stop testing characters\n }\n break;\n case DONE:\n {\n }\n break;\n }\n iter++;\n }\n return match;\n}\n\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Dali\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 1998-2004, Index Data.\n * See the file LICENSE for details.\n * \n * $Id: yaz-proxy-main.cpp,v 1.34 2004-02-16 10:47:37 adam Exp $\n *\/\n\n#include <signal.h>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdarg.h>\n\n#if HAVE_GETRLIMIT\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#endif\n\n#include <yaz\/log.h>\n#include <yaz\/options.h>\n\n#include <yaz++\/socket-manager.h>\n#include <yaz++\/pdu-assoc.h>\n#include <yaz++\/proxy.h>\n\nvoid usage(char *prog)\n{\n fprintf (stderr, \"%s: [-c config] [-l log] [-a log] [-v level] [-t target] \"\n \"[-u uid] [-p pidfile] @:port\\n\", prog);\n exit (1);\n}\n\nstatic char *pid_fname = 0;\nstatic char *uid = 0;\nstatic char *log_file = 0;\nstatic int debug = 0;\nstatic int no_limit_files = 0;\n\nint args(Yaz_Proxy *proxy, int argc, char **argv)\n{\n char *addr = 0;\n char *arg;\n char *prog = argv[0];\n int ret;\n\n while ((ret = options(\"o:a:t:v:c:u:i:m:l:T:p:U:n:X\",\n\t\t\t argv, argc, &arg)) != -2)\n {\n\tint err;\n switch (ret)\n {\n case 0:\n if (addr)\n\t {\n\t\tusage(prog);\n\t\treturn 1;\n\t }\n\t addr = arg;\n break;\n\tcase 'c':\n\t err = proxy->set_config(arg);\n\t if (err == -2)\n\t {\n\t\tfprintf(stderr, \"Config file support not enabled (proxy not compiled with libxml2 support)\\n\");\n\t\texit(1);\n\t }\n\t else if (err == -1)\n\t {\n\t\tfprintf(stderr, \"Bad or missing file %s\\n\", arg);\n\t\texit(1);\n\t }\n\t break;\n\tcase 'a':\n\t proxy->set_APDU_log(arg);\n\t break;\n case 't':\n\t proxy->set_default_target(arg);\n\t break;\n case 'U':\n proxy->set_proxy_authentication(arg);\n break;\n case 'o':\n\t proxy->option(\"optimize\", arg);\n\t break;\n\tcase 'v':\n\t yaz_log_init_level (yaz_log_mask_str(arg));\n\t break;\n\tcase 'l':\n\t yaz_log_init_file (arg);\n\t log_file = xstrdup(arg);\n\t break;\n\tcase 'm':\n\t proxy->set_max_clients(atoi(arg));\n\t break;\n case 'i':\n\t proxy->set_client_idletime(atoi(arg));\n\t break;\n case 'T':\n\t proxy->set_target_idletime(atoi(arg));\n\t break;\n\tcase 'n':\n\t no_limit_files = atoi(arg);\n\t break;\n\tcase 'X':\n\t debug = 1;\n\t break;\n\tcase 'p':\n\t if (!pid_fname)\n\t\tpid_fname = xstrdup(arg);\n\t break;\n\tcase 'u':\n\t if (!uid)\n\t\tuid = xstrdup(arg);\n\t break;\n default:\n\t usage(prog);\n\t return 1;\n }\n }\n if (addr)\n {\n\tif (proxy->server(addr))\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"listen %s\", addr);\n\t exit(1);\n\t}\n }\n else\n {\n\tusage(prog);\n\treturn 1;\n }\n return 0;\n}\n\nstatic Yaz_Proxy *static_yaz_proxy = 0;\nstatic void sighup_handler(int num)\n{\n signal(SIGHUP, sighup_handler);\n if (static_yaz_proxy)\n\tstatic_yaz_proxy->reconfig();\n}\n\n#if HAVE_XSLT\nstatic void proxy_xml_error_handler(void *ctx, const char *fmt, ...)\n{\n char buf[1024];\n\n va_list ap;\n va_start(ap, fmt);\n\n vsnprintf(buf, sizeof(buf), fmt, ap);\n\n yaz_log(LOG_WARN, \"%s\", buf);\n\n va_end (ap);\n}\n#endif\n\nstatic void child_run(Yaz_SocketManager *m, int run)\n{\n signal(SIGHUP, sighup_handler);\n\n#if HAVE_XSLT\n xmlSetGenericErrorFunc(0, proxy_xml_error_handler);\n#endif\n yaz_log(LOG_LOG, \"0 proxy run=%d pid=%ld\", run, (long) getpid());\n\n if (no_limit_files)\n {\n#if HAVE_SETRLIMIT\n\tstruct rlimit limit_data;\n\tlimit_data.rlim_cur = no_limit_files;\n\tlimit_data.rlim_max = no_limit_files;\n\t\n\tyaz_log(LOG_LOG, \"0 setrlimit NOFILE cur=%d max=%d\",\n\t\tlimit_data.rlim_cur, limit_data.rlim_max);\n\tif (setrlimit(RLIMIT_NOFILE, &limit_data))\n\t yaz_log(LOG_ERRNO|LOG_WARN, \"setrlimit\");\n#else\n\tyaz_log(LOG_WARN, \"setrlimit unavablable. Option -n ignored\");\n#endif\n }\n if (pid_fname)\n {\n\tFILE *f = fopen(pid_fname, \"w\");\n\tif (!f)\n\t{\n\t yaz_log(LOG_ERRNO|LOG_FATAL, \"Couldn't create %s\", pid_fname);\n\t exit(0);\n\t}\n\tfprintf(f, \"%ld\", (long) getpid());\n\tfclose(f);\n\txfree(pid_fname);\n }\n if (uid)\n {\n \tstruct passwd *pw;\n\n\tif (!(pw = getpwnam(uid)))\n\t{\n\t yaz_log(LOG_FATAL, \"%s: Unknown user\", uid);\n\t exit(3);\n\t}\n\tif (log_file)\n\t{\n\t chown(log_file, pw->pw_uid, pw->pw_gid);\n\t xfree(log_file);\n\t}\n\tif (setuid(pw->pw_uid) < 0)\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"setuid\");\n\t exit(4);\n\t}\n\txfree(uid);\n }\n#if HAVE_GETRLIMIT\n struct rlimit limit_data;\n getrlimit(RLIMIT_NOFILE, &limit_data);\n yaz_log(LOG_LOG, \"0 getrlimit NOFILE cur=%d max=%d\",\n\t limit_data.rlim_cur, limit_data.rlim_max);\n#endif\n \n while (m->processEvent() > 0)\n\t;\n\n exit (0);\n}\n\nint main(int argc, char **argv)\n{\n#if HAVE_XSLT\n xmlInitMemory();\n \n LIBXML_TEST_VERSION\n#endif\n int cont = 1;\n int run = 1;\n Yaz_SocketManager mySocketManager;\n Yaz_Proxy proxy(new Yaz_PDU_Assoc(&mySocketManager));\n\n static_yaz_proxy = &proxy;\n\n args(&proxy, argc, argv);\n\n if (debug)\n {\n\tchild_run(&mySocketManager, run);\n\texit(0);\n }\n while (cont)\n {\n\tpid_t p = fork();\n\tif (p == (pid_t) -1)\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"fork\");\n\t exit(1);\n\t}\n\telse if (p == 0)\n\t{\n\t child_run(&mySocketManager, run);\n\t}\n\tpid_t p1;\n\tint status;\n\tp1 = wait(&status);\n\n\tyaz_log_reopen();\n\n\tif (p1 != p)\n\t{\n\t yaz_log(LOG_FATAL, \"p1=%d != p=%d\", p1, p);\n\t exit(1);\n\t}\n\tif (WIFSIGNALED(status))\n\t{\n\t switch(WTERMSIG(status)) {\n\t case SIGILL:\n\t\tyaz_log(LOG_WARN, \"Received SIGILL from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGABRT:\n\t\tyaz_log(LOG_WARN, \"Received SIGABRT from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak ;\n\t case SIGSEGV:\n\t\tyaz_log(LOG_WARN, \"Received SIGSEGV from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGBUS:\t\n\t\tyaz_log(LOG_WARN, \"Received SIGBUS from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGTERM:\n\t\tyaz_log(LOG_LOG, \"Received SIGTERM from child %ld\",\n\t\t\t(long) p);\n\t\tcont = 0;\n\t\tbreak;\n\t default:\n\t\tyaz_log(LOG_WARN, \"Received SIG %d from child %ld\",\n\t\t\tWTERMSIG(status), (long) p);\n\t\tcont = 0;\n\t }\n\t}\n\telse if (status == 0)\n\t cont = 0;\n\telse\n\t{\n\t yaz_log(LOG_LOG, \"Exit %d from child %ld\", status, (long) p);\n\t cont = 1;\n\t}\n\tif (cont)\n\t sleep(1 + run\/5);\n\trun++;\n }\n exit (0);\n return 0;\n}\n<commit_msg>Log XSLT errors to log<commit_after>\/*\n * Copyright (c) 1998-2004, Index Data.\n * See the file LICENSE for details.\n * \n * $Id: yaz-proxy-main.cpp,v 1.35 2004-03-17 10:49:58 adam Exp $\n *\/\n\n#include <signal.h>\n#include <unistd.h>\n#include <pwd.h>\n#include <sys\/types.h>\n#include <stdarg.h>\n\n#if HAVE_GETRLIMIT\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#endif\n\n#include <yaz\/log.h>\n#include <yaz\/options.h>\n\n#include <yaz++\/socket-manager.h>\n#include <yaz++\/pdu-assoc.h>\n#include <yaz++\/proxy.h>\n\nvoid usage(char *prog)\n{\n fprintf (stderr, \"%s: [-c config] [-l log] [-a log] [-v level] [-t target] \"\n \"[-u uid] [-p pidfile] @:port\\n\", prog);\n exit (1);\n}\n\nstatic char *pid_fname = 0;\nstatic char *uid = 0;\nstatic char *log_file = 0;\nstatic int debug = 0;\nstatic int no_limit_files = 0;\n\nint args(Yaz_Proxy *proxy, int argc, char **argv)\n{\n char *addr = 0;\n char *arg;\n char *prog = argv[0];\n int ret;\n\n while ((ret = options(\"o:a:t:v:c:u:i:m:l:T:p:U:n:X\",\n\t\t\t argv, argc, &arg)) != -2)\n {\n\tint err;\n switch (ret)\n {\n case 0:\n if (addr)\n\t {\n\t\tusage(prog);\n\t\treturn 1;\n\t }\n\t addr = arg;\n break;\n\tcase 'c':\n\t err = proxy->set_config(arg);\n\t if (err == -2)\n\t {\n\t\tfprintf(stderr, \"Config file support not enabled (proxy not compiled with libxml2 support)\\n\");\n\t\texit(1);\n\t }\n\t else if (err == -1)\n\t {\n\t\tfprintf(stderr, \"Bad or missing file %s\\n\", arg);\n\t\texit(1);\n\t }\n\t break;\n\tcase 'a':\n\t proxy->set_APDU_log(arg);\n\t break;\n case 't':\n\t proxy->set_default_target(arg);\n\t break;\n case 'U':\n proxy->set_proxy_authentication(arg);\n break;\n case 'o':\n\t proxy->option(\"optimize\", arg);\n\t break;\n\tcase 'v':\n\t yaz_log_init_level (yaz_log_mask_str(arg));\n\t break;\n\tcase 'l':\n\t yaz_log_init_file (arg);\n\t log_file = xstrdup(arg);\n\t break;\n\tcase 'm':\n\t proxy->set_max_clients(atoi(arg));\n\t break;\n case 'i':\n\t proxy->set_client_idletime(atoi(arg));\n\t break;\n case 'T':\n\t proxy->set_target_idletime(atoi(arg));\n\t break;\n\tcase 'n':\n\t no_limit_files = atoi(arg);\n\t break;\n\tcase 'X':\n\t debug = 1;\n\t break;\n\tcase 'p':\n\t if (!pid_fname)\n\t\tpid_fname = xstrdup(arg);\n\t break;\n\tcase 'u':\n\t if (!uid)\n\t\tuid = xstrdup(arg);\n\t break;\n default:\n\t usage(prog);\n\t return 1;\n }\n }\n if (addr)\n {\n\tif (proxy->server(addr))\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"listen %s\", addr);\n\t exit(1);\n\t}\n }\n else\n {\n\tusage(prog);\n\treturn 1;\n }\n return 0;\n}\n\nstatic Yaz_Proxy *static_yaz_proxy = 0;\nstatic void sighup_handler(int num)\n{\n signal(SIGHUP, sighup_handler);\n if (static_yaz_proxy)\n\tstatic_yaz_proxy->reconfig();\n}\n\n#if HAVE_XSLT\nstatic void proxy_xml_error_handler(void *ctx, const char *fmt, ...)\n{\n char buf[1024];\n\n va_list ap;\n va_start(ap, fmt);\n\n vsnprintf(buf, sizeof(buf), fmt, ap);\n\n yaz_log(LOG_WARN, \"%s: %s\", (char*) ctx, buf);\n\n va_end (ap);\n}\n#endif\n\nstatic void child_run(Yaz_SocketManager *m, int run)\n{\n signal(SIGHUP, sighup_handler);\n\n#if HAVE_XSLT\n xmlSetGenericErrorFunc((void *) \"XML\", proxy_xml_error_handler);\n xsltSetGenericErrorFunc((void *) \"XSLT\", proxy_xml_error_handler);\n#endif\n yaz_log(LOG_LOG, \"0 proxy run=%d pid=%ld\", run, (long) getpid());\n\n if (no_limit_files)\n {\n#if HAVE_SETRLIMIT\n\tstruct rlimit limit_data;\n\tlimit_data.rlim_cur = no_limit_files;\n\tlimit_data.rlim_max = no_limit_files;\n\t\n\tyaz_log(LOG_LOG, \"0 setrlimit NOFILE cur=%d max=%d\",\n\t\tlimit_data.rlim_cur, limit_data.rlim_max);\n\tif (setrlimit(RLIMIT_NOFILE, &limit_data))\n\t yaz_log(LOG_ERRNO|LOG_WARN, \"setrlimit\");\n#else\n\tyaz_log(LOG_WARN, \"setrlimit unavablable. Option -n ignored\");\n#endif\n }\n if (pid_fname)\n {\n\tFILE *f = fopen(pid_fname, \"w\");\n\tif (!f)\n\t{\n\t yaz_log(LOG_ERRNO|LOG_FATAL, \"Couldn't create %s\", pid_fname);\n\t exit(0);\n\t}\n\tfprintf(f, \"%ld\", (long) getpid());\n\tfclose(f);\n\txfree(pid_fname);\n }\n if (uid)\n {\n \tstruct passwd *pw;\n\n\tif (!(pw = getpwnam(uid)))\n\t{\n\t yaz_log(LOG_FATAL, \"%s: Unknown user\", uid);\n\t exit(3);\n\t}\n\tif (log_file)\n\t{\n\t chown(log_file, pw->pw_uid, pw->pw_gid);\n\t xfree(log_file);\n\t}\n\tif (setuid(pw->pw_uid) < 0)\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"setuid\");\n\t exit(4);\n\t}\n\txfree(uid);\n }\n#if HAVE_GETRLIMIT\n struct rlimit limit_data;\n getrlimit(RLIMIT_NOFILE, &limit_data);\n yaz_log(LOG_LOG, \"0 getrlimit NOFILE cur=%d max=%d\",\n\t limit_data.rlim_cur, limit_data.rlim_max);\n#endif\n \n while (m->processEvent() > 0)\n\t;\n\n exit (0);\n}\n\nint main(int argc, char **argv)\n{\n#if HAVE_XSLT\n xmlInitMemory();\n \n LIBXML_TEST_VERSION\n#endif\n int cont = 1;\n int run = 1;\n Yaz_SocketManager mySocketManager;\n Yaz_Proxy proxy(new Yaz_PDU_Assoc(&mySocketManager));\n\n static_yaz_proxy = &proxy;\n\n args(&proxy, argc, argv);\n\n if (debug)\n {\n\tchild_run(&mySocketManager, run);\n\texit(0);\n }\n while (cont)\n {\n\tpid_t p = fork();\n\tif (p == (pid_t) -1)\n\t{\n\t yaz_log(LOG_FATAL|LOG_ERRNO, \"fork\");\n\t exit(1);\n\t}\n\telse if (p == 0)\n\t{\n\t child_run(&mySocketManager, run);\n\t}\n\tpid_t p1;\n\tint status;\n\tp1 = wait(&status);\n\n\tyaz_log_reopen();\n\n\tif (p1 != p)\n\t{\n\t yaz_log(LOG_FATAL, \"p1=%d != p=%d\", p1, p);\n\t exit(1);\n\t}\n\tif (WIFSIGNALED(status))\n\t{\n\t switch(WTERMSIG(status)) {\n\t case SIGILL:\n\t\tyaz_log(LOG_WARN, \"Received SIGILL from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGABRT:\n\t\tyaz_log(LOG_WARN, \"Received SIGABRT from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak ;\n\t case SIGSEGV:\n\t\tyaz_log(LOG_WARN, \"Received SIGSEGV from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGBUS:\t\n\t\tyaz_log(LOG_WARN, \"Received SIGBUS from child %ld\", (long) p);\n\t\tcont = 1;\n\t\tbreak;\n\t case SIGTERM:\n\t\tyaz_log(LOG_LOG, \"Received SIGTERM from child %ld\",\n\t\t\t(long) p);\n\t\tcont = 0;\n\t\tbreak;\n\t default:\n\t\tyaz_log(LOG_WARN, \"Received SIG %d from child %ld\",\n\t\t\tWTERMSIG(status), (long) p);\n\t\tcont = 0;\n\t }\n\t}\n\telse if (status == 0)\n\t cont = 0;\n\telse\n\t{\n\t yaz_log(LOG_LOG, \"Exit %d from child %ld\", status, (long) p);\n\t cont = 1;\n\t}\n\tif (cont)\n\t sleep(1 + run\/5);\n\trun++;\n }\n exit (0);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Beacon.h>\n#include \"HCIDumpParser.h\"\n#include \"BeaconEventConsumer.h\"\n\n\/\/ Uncomment to publish the raw byte[] for the beacon, otherwise, properties are sent\n\/\/#define SEND_BINARY_DATA\n\nextern \"C\" bool stop_scan_frames;\n\nstatic void generateTestEvents(EventExchanger *exchanger) {\n printf(\"generateTestEvents, starting...\\n\");\n beacon_info event;\n int count = 0;\n try {\n bool running = true;\n while (running) {\n count++;\n int32_t minor = count % 150;\n sprintf(event.uuid, \"UUID-%.12d\", minor);\n event.minor = minor;\n event.rssi = -50 - count % 7;\n event.time = EventsWindow::currentMilliseconds();\n bool stop = beacon_event_callback(&event);\n running = !stop;\n this_thread::sleep_for(chrono::milliseconds(10));\n }\n } catch(exception& e) {\n printf(\"generateTestEvents failure, %s\\n\", e.what());\n }\n stop_scan_frames = true;\n printf(\"generateTestEvents, exiting\\n\");\n}\n\nvoid HCIDumpParser::processHCI(HCIDumpCommand &parseCommand) {\n HCIDumpParser::parseCommand = parseCommand;\n eventConsumer.setParseCommand(parseCommand);\n string clientID(parseCommand.getClientID());\n if (clientID.empty())\n clientID = parseCommand.getScannerID();\n publisher.reset(MsgPublisher::create(parseCommand.getPubType(), parseCommand.getBrokerURL(), clientID, \"\", \"\"));\n timeWindow.reset(parseCommand.getAnalyzeWindow());\n \/\/ Setup the status information\n statusInformation->setScannerID(parseCommand.getScannerID());\n statusInformation->setStatusInterval(parseCommand.getStatusInterval());\n statusInformation->setStatusQueue(parseCommand.getStatusQueue());\n\n if (parseCommand.isAnalyzeMode()) {\n printf(\"Running in analyze mode, window=%d seconds, begin=%lld\\n\", parseCommand.getAnalyzeWindow(),\n timeWindow.getBegin());\n }\n else if (!parseCommand.isSkipPublish()) {\n publisher->setUseTopics(!parseCommand.isUseQueues());\n publisher->setDestinationName(parseCommand.getDestinationName());\n if (batchCount > 0) {\n publisher->setUseTransactions(true);\n printf(\"Enabled transactions\\n\");\n }\n publisher->start(parseCommand.isAsyncMode());\n\n \/\/ Create a thread for the consumer\n eventExchanger.reset(new EventExchanger);\n eventConsumer.init(eventExchanger, publisher, statusInformation);\n consumerThread.reset(new thread(&BeaconEventConsumer::publishEvents, &eventConsumer));\n printf(\"Started event consumer thread\\n\");\n\n \/\/ If the status interval is > 0, start the health status monitor\n if(parseCommand.getStatusInterval() > 0) {\n statusMonitor.start(publisher, statusInformation);\n }\n }\n else {\n printf(\"Skipping publish of parsed beacons\\n\");\n }\n\n if(parseCommand.isGenerateTestData()) {\n \/\/ Generate test data\n thread testThread(generateTestEvents, eventExchanger.get());\n testThread.detach();\n }\n\n \/\/ Scan\n char cdev = parseCommand.getHciDev().at(parseCommand.getHciDev().size() - 1);\n int device = cdev - '0';\n scan_frames(device, beacon_event_callback);\n\n \/\/ Join the consumerThread if it was\n eventConsumer.setRunning(false);\n if(consumerThread && consumerThread->joinable()) {\n printf(\"Joining the consumer thread...\\n\");\n consumerThread->join();\n printf(\"done\\n\");\n }\n\n \/\/ Stop the status monitor\n statusMonitor.stop();\n}\n\nvoid HCIDumpParser::beaconEvent(const beacon_info &info) {\n \/\/ Check for heartbeat\n bool isHeartbeat = scannerUUID.compare(info.uuid) == 0;\n \/\/ Merge the event into the current time window\n shared_ptr<EventsBucket> bucket = timeWindow.addEvent(info, isHeartbeat);\n statusInformation->addEvent(info, isHeartbeat);\n \/\/ Now handle the bucket if a new one has been created\n if (bucket) {\n if (!parseCommand.isSkipPublish()) {\n eventExchanger->putEvent(bucket);\n }\n else {\n if (parseCommand.isAnalyzeMode()) {\n printBeaconCounts(bucket);\n } else {\n Beacon beacon(parseCommand.getScannerID(), info.uuid, info.code, info.manufacturer, info.major,\n info.minor, info.power, info.calibrated_power, info.rssi, info.time);\n const char *info = isHeartbeat ? \"heartbeat\" : \"event\";\n if (!isHeartbeat || (isHeartbeat && !parseCommand.isSkipHeartbeat()))\n printBeaconCounts(beacon, bucket);\n }\n }\n \/\/ Display the closest beacon\n if(beaconViewer) {\n map<int32_t, beacon_info>::const_iterator iter = bucket->begin();\n int32_t maxRSSI = -100;\n const beacon_info *closest = nullptr;\n while (iter != bucket->end()) {\n \/\/ Skip the heartbeast beacon...\n if(iter->second.rssi > maxRSSI) {\n maxRSSI = iter->second.rssi;\n closest = &iter->second;\n }\n iter++;\n }\n Beacon closestBeacon(parseCommand.getScannerID(), closest->uuid, closest->code, closest->manufacturer,\n closest->major, closest->minor, closest->power, closest->calibrated_power,\n closest->rssi, closest->time);\n beaconViewer->displayBeacon(closestBeacon);\n }\n }\n}\n\nvoid HCIDumpParser::cleanup() {\n if (publisher)\n publisher->stop();\n}\n\nvoid HCIDumpParser::printBeaconCounts(Beacon beacon, const shared_ptr<EventsBucket> &bucket) {\n printf(\"Window: parsed(%s):\\n\", beacon.toString().c_str());\n printBeaconCounts(bucket);\n}\n\nvoid HCIDumpParser::printBeaconCounts(const shared_ptr<EventsBucket> &bucket) {\n vector<char> tmp;\n bucket->toString(tmp);\n printf(\"%s\\n\", tmp.data());\n}\n<commit_msg>Validate that a closest beacon was found<commit_after>#include <Beacon.h>\n#include \"HCIDumpParser.h\"\n#include \"BeaconEventConsumer.h\"\n\n\/\/ Uncomment to publish the raw byte[] for the beacon, otherwise, properties are sent\n\/\/#define SEND_BINARY_DATA\n\nextern \"C\" bool stop_scan_frames;\n\nstatic void generateTestEvents(EventExchanger *exchanger) {\n printf(\"generateTestEvents, starting...\\n\");\n beacon_info event;\n int count = 0;\n try {\n bool running = true;\n while (running) {\n count++;\n int32_t minor = count % 150;\n sprintf(event.uuid, \"UUID-%.12d\", minor);\n event.minor = minor;\n event.rssi = -50 - count % 7;\n event.time = EventsWindow::currentMilliseconds();\n bool stop = beacon_event_callback(&event);\n running = !stop;\n this_thread::sleep_for(chrono::milliseconds(10));\n }\n } catch(exception& e) {\n printf(\"generateTestEvents failure, %s\\n\", e.what());\n }\n stop_scan_frames = true;\n printf(\"generateTestEvents, exiting\\n\");\n}\n\nvoid HCIDumpParser::processHCI(HCIDumpCommand &parseCommand) {\n HCIDumpParser::parseCommand = parseCommand;\n eventConsumer.setParseCommand(parseCommand);\n string clientID(parseCommand.getClientID());\n if (clientID.empty())\n clientID = parseCommand.getScannerID();\n publisher.reset(MsgPublisher::create(parseCommand.getPubType(), parseCommand.getBrokerURL(), clientID, \"\", \"\"));\n timeWindow.reset(parseCommand.getAnalyzeWindow());\n \/\/ Setup the status information\n statusInformation->setScannerID(parseCommand.getScannerID());\n statusInformation->setStatusInterval(parseCommand.getStatusInterval());\n statusInformation->setStatusQueue(parseCommand.getStatusQueue());\n\n if (parseCommand.isAnalyzeMode()) {\n printf(\"Running in analyze mode, window=%d seconds, begin=%lld\\n\", parseCommand.getAnalyzeWindow(),\n timeWindow.getBegin());\n }\n else if (!parseCommand.isSkipPublish()) {\n publisher->setUseTopics(!parseCommand.isUseQueues());\n publisher->setDestinationName(parseCommand.getDestinationName());\n if (batchCount > 0) {\n publisher->setUseTransactions(true);\n printf(\"Enabled transactions\\n\");\n }\n publisher->start(parseCommand.isAsyncMode());\n\n \/\/ Create a thread for the consumer\n eventExchanger.reset(new EventExchanger);\n eventConsumer.init(eventExchanger, publisher, statusInformation);\n consumerThread.reset(new thread(&BeaconEventConsumer::publishEvents, &eventConsumer));\n printf(\"Started event consumer thread\\n\");\n\n \/\/ If the status interval is > 0, start the health status monitor\n if(parseCommand.getStatusInterval() > 0) {\n statusMonitor.start(publisher, statusInformation);\n }\n }\n else {\n printf(\"Skipping publish of parsed beacons\\n\");\n }\n\n if(parseCommand.isGenerateTestData()) {\n \/\/ Generate test data\n thread testThread(generateTestEvents, eventExchanger.get());\n testThread.detach();\n }\n\n \/\/ Scan\n char cdev = parseCommand.getHciDev().at(parseCommand.getHciDev().size() - 1);\n int device = cdev - '0';\n scan_frames(device, beacon_event_callback);\n\n \/\/ Join the consumerThread if it was\n eventConsumer.setRunning(false);\n if(consumerThread && consumerThread->joinable()) {\n printf(\"Joining the consumer thread...\\n\");\n consumerThread->join();\n printf(\"done\\n\");\n }\n\n \/\/ Stop the status monitor\n statusMonitor.stop();\n}\n\nvoid HCIDumpParser::beaconEvent(const beacon_info &info) {\n \/\/ Check for heartbeat\n bool isHeartbeat = scannerUUID.compare(info.uuid) == 0;\n \/\/ Merge the event into the current time window\n shared_ptr<EventsBucket> bucket = timeWindow.addEvent(info, isHeartbeat);\n statusInformation->addEvent(info, isHeartbeat);\n \/\/ Now handle the bucket if a new one has been created\n if (bucket) {\n if (!parseCommand.isSkipPublish()) {\n eventExchanger->putEvent(bucket);\n }\n else {\n if (parseCommand.isAnalyzeMode()) {\n printBeaconCounts(bucket);\n } else {\n Beacon beacon(parseCommand.getScannerID(), info.uuid, info.code, info.manufacturer, info.major,\n info.minor, info.power, info.calibrated_power, info.rssi, info.time);\n const char *info = isHeartbeat ? \"heartbeat\" : \"event\";\n if (!isHeartbeat || (isHeartbeat && !parseCommand.isSkipHeartbeat()))\n printBeaconCounts(beacon, bucket);\n }\n }\n \/\/ Display the closest beacon\n if(beaconViewer) {\n map<int32_t, beacon_info>::const_iterator iter = bucket->begin();\n int32_t maxRSSI = -100;\n const beacon_info *closest = nullptr;\n while (iter != bucket->end()) {\n \/\/ Skip the heartbeast beacon...\n if(iter->second.rssi > maxRSSI) {\n maxRSSI = iter->second.rssi;\n closest = &iter->second;\n }\n iter++;\n }\n if(closest != nullptr) {\n Beacon closestBeacon(parseCommand.getScannerID(), closest->uuid, closest->code, closest->manufacturer,\n closest->major, closest->minor, closest->power, closest->calibrated_power,\n closest->rssi, closest->time);\n beaconViewer->displayBeacon(closestBeacon);\n }\n }\n }\n}\n\nvoid HCIDumpParser::cleanup() {\n if (publisher)\n publisher->stop();\n}\n\nvoid HCIDumpParser::printBeaconCounts(Beacon beacon, const shared_ptr<EventsBucket> &bucket) {\n printf(\"Window: parsed(%s):\\n\", beacon.toString().c_str());\n printBeaconCounts(bucket);\n}\n\nvoid HCIDumpParser::printBeaconCounts(const shared_ptr<EventsBucket> &bucket) {\n vector<char> tmp;\n bucket->toString(tmp);\n printf(\"%s\\n\", tmp.data());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AppElementType.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2007-09-26 14:49:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef DBAUI_APPELEMENTTYPE_HXX\n#define DBAUI_APPELEMENTTYPE_HXX\n#include <com\/sun\/star\/sdb\/application\/DatabaseObject.hpp>\n\/\/........................................................................\nnamespace dbaui\n{\n\/\/........................................................................\n\n enum ElementType\n {\n E_TABLE = ::com::sun::star::sdb::application::DatabaseObject::TABLE,\n E_QUERY = ::com::sun::star::sdb::application::DatabaseObject::QUERY,\n E_FORM = ::com::sun::star::sdb::application::DatabaseObject::FORM,\n E_REPORT = ::com::sun::star::sdb::application::DatabaseObject::REPORT,\n\n E_NONE = 4,\n E_ELEMENT_TYPE_COUNT = E_NONE\n };\n\n enum PreviewMode\n {\n E_PREVIEWNONE = 0,\n E_DOCUMENT = 1,\n E_DOCUMENTINFO = 2\n };\n\/\/........................................................................\n} \/\/ namespace dbaui\n\/\/........................................................................\n#endif \/\/ DBAUI_APPELEMENTTYPE_HXX\n\n<commit_msg>INTEGRATION: CWS titles02 (1.5.18); FILE MERGED 2008\/03\/13 10:45:31 oj 1.5.18.1: #i45909# #i45617# #i71469# title changes<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: AppElementType.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: kz $ $Date: 2008-04-04 14:01:31 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef DBAUI_APPELEMENTTYPE_HXX\n#define DBAUI_APPELEMENTTYPE_HXX\n#include <com\/sun\/star\/sdb\/application\/DatabaseObject.hpp>\n\/\/........................................................................\nnamespace dbaui\n{\n\/\/........................................................................\n\n enum ElementType\n {\n E_TABLE = ::com::sun::star::sdb::application::DatabaseObject::TABLE,\n E_QUERY = ::com::sun::star::sdb::application::DatabaseObject::QUERY,\n E_FORM = ::com::sun::star::sdb::application::DatabaseObject::FORM,\n E_REPORT = ::com::sun::star::sdb::application::DatabaseObject::REPORT,\n\n E_NONE = 4,\n E_ELEMENT_TYPE_COUNT = E_NONE\n };\n\n enum PreviewMode\n {\n E_PREVIEWNONE = 0,\n E_DOCUMENT = 1,\n E_DOCUMENTINFO = 2\n };\n\/\/........................................................................\n} \/\/ namespace dbaui\n\/\/........................................................................\n#endif \/\/ DBAUI_APPELEMENTTYPE_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/---------------------------- grid_tools.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$\n\/\/\n\/\/ Copyright (C) 2001, 2002 by the deal.II authors\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------- grid_tools.cc ---------------------------\n\n\n\n#include <grid\/grid_tools.h>\n#include <grid\/tria.h>\n#include <grid\/tria_accessor.h>\n#include <grid\/tria_iterator.h>\n\n#include <cmath>\n#include <functional>\n\n#if deal_II_dimension != 1\n\ntemplate <int dim>\ndouble\nGridTools::diameter (const Triangulation<dim> &tria)\n{\n\t\t\t\t \/\/ the algorithm used simply\n\t\t\t\t \/\/ traverses all cells and picks\n\t\t\t\t \/\/ out the boundary vertices. it\n\t\t\t\t \/\/ may or may not be faster to\n\t\t\t\t \/\/ simply get all vectors, don't\n\t\t\t\t \/\/ mark boundary vertices, and\n\t\t\t\t \/\/ compute the distances thereof,\n\t\t\t\t \/\/ but at least as the mesh is\n\t\t\t\t \/\/ refined, it seems better to\n\t\t\t\t \/\/ first mark boundary nodes, as\n\t\t\t\t \/\/ marking is O(N) in the number of\n\t\t\t\t \/\/ cells\/vertices, while computing\n\t\t\t\t \/\/ the maximal distance is O(N*N)\n const std::vector<Point<dim> > &vertices = tria.get_vertices ();\n std::vector<bool> boundary_vertices (vertices.size(), false);\n\n typename Triangulation<dim>::active_cell_iterator\n cell = tria.begin_active();\n const typename Triangulation<dim>::active_cell_iterator\n endc = tria.end();\n for (; cell!=endc; ++cell)\n for (unsigned int face=0; face<GeometryInfo<dim>::faces_per_cell; ++face)\n if (cell->face(face)->at_boundary ())\n\tfor (unsigned int i=0; i<GeometryInfo<dim>::vertices_per_face; ++i)\n\t boundary_vertices[cell->face(face)->vertex_index(i)] = true;\n\n\t\t\t\t \/\/ now traverse the list of\n\t\t\t\t \/\/ boundary vertices and check\n\t\t\t\t \/\/ distances. since distances are\n\t\t\t\t \/\/ symmetric, we only have to check\n\t\t\t\t \/\/ one half\n double max_distance_sqr = 0;\n std::vector<bool>::const_iterator pi = boundary_vertices.begin();\n const unsigned int N = boundary_vertices.size();\n for (unsigned int i=0; i<N; ++i, ++pi)\n {\n std::vector<bool>::const_iterator pj = pi+1;\n for (unsigned int j=i+1; j<N; ++j, ++pj)\n\tif ((*pi==true) && (*pj==true) &&\n\t ((vertices[i]-vertices[j]).square() > max_distance_sqr))\n\t max_distance_sqr = (vertices[i]-vertices[j]).square();\n };\n\n return std::sqrt(max_distance_sqr);\n};\n\n\n#else\n\ndouble\nGridTools::diameter (const Triangulation<1> &tria)\n{\n\t\t\t\t \/\/ for 1d, simply check the\n\t\t\t\t \/\/ vertices of the left- and\n\t\t\t\t \/\/ rightmost coarse grid cell\n Triangulation<1>::cell_iterator leftmost = tria.begin(0);\n Triangulation<1>::cell_iterator rightmost = tria.begin(0);\n\n while (!leftmost->at_boundary(0)) leftmost = leftmost->neighbor(0);\n while (!rightmost->at_boundary(1)) rightmost = rightmost->neighbor(1);\n\n return std::sqrt((leftmost->vertex(0) - rightmost->vertex(1)).square());\n};\n\n#endif\n\n\n\n\/\/ define some transformations in an anonymous namespace\nnamespace \n{\n template <int dim>\n inline\n Point<dim> shift_point (const Point<dim> p,\n\t\t\t const Point<dim> shift)\n {\n return p+shift;\n };\n\n\n\n inline\n Point<2> rotate2d (const Point<2> p,\n\t\t const double angle)\n {\n return Point<2> (std::cos(angle)*p(0) - std::sin(angle) * p(1),\n\t\t std::sin(angle)*p(0) + std::cos(angle) * p(1));\n };\n\n\n\n template <int dim>\n inline\n Point<dim> scale_point (const Point<dim> p,\n\t\t\t const double factor)\n {\n return p*factor;\n };\n};\n\n\ntemplate <int dim>\nvoid\nGridTools::shift (const Point<dim> &shift_vector,\n\t\t Triangulation<dim> &triangulation)\n{\n transform (std::bind2nd(std::ptr_fun(&shift_point<dim>),\n\t\t\t shift_vector),\n\t triangulation);\n};\n\n\n#if deal_II_dimension == 2\n\nvoid\nGridTools::rotate (const double angle,\n\t\t Triangulation<2> &triangulation)\n{\n transform (std::bind2nd(std::ptr_fun(&rotate2d),\n\t\t\t angle),\n\t triangulation);\n};\n\n#endif\n\n\ntemplate <int dim>\nvoid\nGridTools::scale (const double scaling_factor,\n\t\t Triangulation<dim> &triangulation)\n{\n Assert (scaling_factor>0, ExcScalingFactorNotPositive (scaling_factor));\n \n transform (std::bind2nd(std::ptr_fun(&scale_point<dim>),\n\t\t\t scaling_factor),\n\t triangulation);\n};\n\n\n\n#if deal_II_dimension != 1\ntemplate\ndouble\nGridTools::diameter<deal_II_dimension> (const Triangulation<deal_II_dimension> &);\n#endif\n\ntemplate\nvoid GridTools::shift<deal_II_dimension> (const Point<deal_II_dimension> &,\n\t\t\t\t\t Triangulation<deal_II_dimension> &);\n\ntemplate\nvoid GridTools::scale<deal_II_dimension> (const double,\n\t\t\t\t\t Triangulation<deal_II_dimension> &);\n<commit_msg>Work around a bug in icc's handling of addresses of function templates.<commit_after>\/\/---------------------------- grid_tools.cc ---------------------------\n\/\/ $Id$\n\/\/ Version: $Name$\n\/\/\n\/\/ Copyright (C) 2001, 2002 by the deal.II authors\n\/\/\n\/\/ This file is subject to QPL and may not be distributed\n\/\/ without copyright and license information. Please refer\n\/\/ to the file deal.II\/doc\/license.html for the text and\n\/\/ further information on this license.\n\/\/\n\/\/---------------------------- grid_tools.cc ---------------------------\n\n\n\n#include <grid\/grid_tools.h>\n#include <grid\/tria.h>\n#include <grid\/tria_accessor.h>\n#include <grid\/tria_iterator.h>\n\n#include <cmath>\n#include <functional>\n\n#if deal_II_dimension != 1\n\ntemplate <int dim>\ndouble\nGridTools::diameter (const Triangulation<dim> &tria)\n{\n\t\t\t\t \/\/ the algorithm used simply\n\t\t\t\t \/\/ traverses all cells and picks\n\t\t\t\t \/\/ out the boundary vertices. it\n\t\t\t\t \/\/ may or may not be faster to\n\t\t\t\t \/\/ simply get all vectors, don't\n\t\t\t\t \/\/ mark boundary vertices, and\n\t\t\t\t \/\/ compute the distances thereof,\n\t\t\t\t \/\/ but at least as the mesh is\n\t\t\t\t \/\/ refined, it seems better to\n\t\t\t\t \/\/ first mark boundary nodes, as\n\t\t\t\t \/\/ marking is O(N) in the number of\n\t\t\t\t \/\/ cells\/vertices, while computing\n\t\t\t\t \/\/ the maximal distance is O(N*N)\n const std::vector<Point<dim> > &vertices = tria.get_vertices ();\n std::vector<bool> boundary_vertices (vertices.size(), false);\n\n typename Triangulation<dim>::active_cell_iterator\n cell = tria.begin_active();\n const typename Triangulation<dim>::active_cell_iterator\n endc = tria.end();\n for (; cell!=endc; ++cell)\n for (unsigned int face=0; face<GeometryInfo<dim>::faces_per_cell; ++face)\n if (cell->face(face)->at_boundary ())\n\tfor (unsigned int i=0; i<GeometryInfo<dim>::vertices_per_face; ++i)\n\t boundary_vertices[cell->face(face)->vertex_index(i)] = true;\n\n\t\t\t\t \/\/ now traverse the list of\n\t\t\t\t \/\/ boundary vertices and check\n\t\t\t\t \/\/ distances. since distances are\n\t\t\t\t \/\/ symmetric, we only have to check\n\t\t\t\t \/\/ one half\n double max_distance_sqr = 0;\n std::vector<bool>::const_iterator pi = boundary_vertices.begin();\n const unsigned int N = boundary_vertices.size();\n for (unsigned int i=0; i<N; ++i, ++pi)\n {\n std::vector<bool>::const_iterator pj = pi+1;\n for (unsigned int j=i+1; j<N; ++j, ++pj)\n\tif ((*pi==true) && (*pj==true) &&\n\t ((vertices[i]-vertices[j]).square() > max_distance_sqr))\n\t max_distance_sqr = (vertices[i]-vertices[j]).square();\n };\n\n return std::sqrt(max_distance_sqr);\n};\n\n\n#else\n\ndouble\nGridTools::diameter (const Triangulation<1> &tria)\n{\n\t\t\t\t \/\/ for 1d, simply check the\n\t\t\t\t \/\/ vertices of the left- and\n\t\t\t\t \/\/ rightmost coarse grid cell\n Triangulation<1>::cell_iterator leftmost = tria.begin(0);\n Triangulation<1>::cell_iterator rightmost = tria.begin(0);\n\n while (!leftmost->at_boundary(0)) leftmost = leftmost->neighbor(0);\n while (!rightmost->at_boundary(1)) rightmost = rightmost->neighbor(1);\n\n return std::sqrt((leftmost->vertex(0) - rightmost->vertex(1)).square());\n};\n\n#endif\n\n\n\n\/\/ define some transformations in an anonymous namespace\nnamespace \n{\n template <int dim>\n inline\n Point<dim> shift_point (const Point<dim> p,\n\t\t\t const Point<dim> shift)\n {\n return p+shift;\n };\n\n\n\n inline\n Point<2> rotate2d (const Point<2> p,\n\t\t const double angle)\n {\n return Point<2> (std::cos(angle)*p(0) - std::sin(angle) * p(1),\n\t\t std::sin(angle)*p(0) + std::cos(angle) * p(1));\n };\n\n\n\n template <int dim>\n inline\n Point<dim> scale_point (const Point<dim> p,\n\t\t\t const double factor)\n {\n return p*factor;\n };\n};\n\n\ntemplate <int dim>\nvoid\nGridTools::shift (const Point<dim> &shift_vector,\n\t\t Triangulation<dim> &triangulation)\n{\n\t\t\t\t \/\/ use a temporary variable to work\n\t\t\t\t \/\/ around a bug in icc, which does\n\t\t\t\t \/\/ not like it if we take the\n\t\t\t\t \/\/ address of the function right\n\t\t\t\t \/\/ within the call to std::ptr_fun\n Point<dim> (*p) (const Point<dim>, const Point<dim>)\n = &shift_point<dim>;\n transform (std::bind2nd(std::ptr_fun(p), shift_vector),\n\t triangulation);\n};\n\n\n#if deal_II_dimension == 2\n\nvoid\nGridTools::rotate (const double angle,\n\t\t Triangulation<2> &triangulation)\n{\n transform (std::bind2nd(std::ptr_fun(&rotate2d),\n\t\t\t angle),\n\t triangulation);\n};\n\n#endif\n\n\ntemplate <int dim>\nvoid\nGridTools::scale (const double scaling_factor,\n\t\t Triangulation<dim> &triangulation)\n{\n Assert (scaling_factor>0, ExcScalingFactorNotPositive (scaling_factor));\n \n\t\t\t\t \/\/ use a temporary variable to work\n\t\t\t\t \/\/ around a bug in icc, which does\n\t\t\t\t \/\/ not like it if we take the\n\t\t\t\t \/\/ address of the function right\n\t\t\t\t \/\/ within the call to std::ptr_fun\n Point<dim> (*p) (const Point<dim>, const double)\n = &scale_point<dim>;\n transform (std::bind2nd(std::ptr_fun(p), scaling_factor),\n\t triangulation);\n};\n\n\n\n#if deal_II_dimension != 1\ntemplate\ndouble\nGridTools::diameter<deal_II_dimension> (const Triangulation<deal_II_dimension> &);\n#endif\n\ntemplate\nvoid GridTools::shift<deal_II_dimension> (const Point<deal_II_dimension> &,\n\t\t\t\t\t Triangulation<deal_II_dimension> &);\n\ntemplate\nvoid GridTools::scale<deal_II_dimension> (const double,\n\t\t\t\t\t Triangulation<deal_II_dimension> &);\n<|endoftext|>"} {"text":"<commit_before>#include \"openmc\/secondary_thermal.h\"\n\n#include \"openmc\/hdf5_interface.h\"\n#include \"openmc\/random_lcg.h\"\n#include \"openmc\/search.h\"\n\n#include \"xtensor\/xview.hpp\"\n\n#include <cmath> \/\/ for log, exp\n\nnamespace openmc {\n\n\/\/ Helper function to get index on incident energy grid\nvoid\nget_energy_index(const std::vector<double>& energies, double E, int& i, double& f)\n{\n \/\/ Get index and interpolation factor for elastic grid\n i = 0;\n f = 0.0;\n if (E >= energies.front()) {\n i = lower_bound_index(energies.begin(), energies.end(), E);\n f = (E - energies[i]) \/ (energies[i+1] - energies[i]);\n }\n}\n\n\/\/==============================================================================\n\/\/ CoherentElasticAE implementation\n\/\/==============================================================================\n\nCoherentElasticAE::CoherentElasticAE(const CoherentElasticXS& xs)\n : xs_{xs}\n{ }\n\nvoid\nCoherentElasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for elastic grid\n int i;\n double f;\n const auto& energies {xs_.bragg_edges()};\n get_energy_index(energies, E_in, i, f);\n\n \/\/ Sample a Bragg edge between 1 and i\n const auto& factors = xs_.factors();\n double prob = prn() * factors[i+1];\n int k = 0;\n if (prob >= factors.front()) {\n k = lower_bound_index(factors.begin(), factors.begin() + (i+1), prob);\n }\n\n \/\/ Characteristic scattering cosine for this Bragg edge (ENDF-102, Eq. 7-2)\n mu = 1.0 - 2.0*energies[k] \/ E_in;\n\n \/\/ Energy doesn't change in elastic scattering (ENDF-102, Eq. 7-1)\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentElasticAE implementation\n\/\/==============================================================================\n\nIncoherentElasticAE::IncoherentElasticAE(hid_t group)\n{\n read_dataset(group, \"debye_waller\", debye_waller_);\n}\n\nvoid\nIncoherentElasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Sample angle by inverting the distribution in ENDF-102, Eq. 7.4\n double c = 2 * E_in * debye_waller_;\n mu = std::log(1.0 + prn()*(std::exp(2.0*c) - 1))\/c - 1.0;\n\n \/\/ Energy doesn't change in elastic scattering (ENDF-102, Eq. 7.4)\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentElasticAEDiscrete implementation\n\/\/==============================================================================\n\nIncoherentElasticAEDiscrete::IncoherentElasticAEDiscrete(hid_t group,\n const std::vector<double>& energy)\n : energy_{energy}\n{\n read_dataset(group, \"mu_out\", mu_out_);\n}\n\nvoid\nIncoherentElasticAEDiscrete::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for elastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Interpolate between two discrete cosines corresponding to neighboring\n \/\/ incoming energies.\n\n \/\/ Sample outgoing cosine bin\n int n_mu = mu_out_.shape()[1];\n int k = prn() * n_mu;\n\n \/\/ Rather than use the sampled discrete mu directly, it is smeared over\n \/\/ a bin of width 0.5*min(mu[k] - mu[k-1], mu[k+1] - mu[k]) centered on the\n \/\/ discrete mu value itself.\n\n \/\/ Interpolate kth mu value between distributions at energies i and i+1\n mu = mu_out_(i, k) + f*(mu_out_(i+1, k) - mu_out_(i, k));\n\n \/\/ Inteprolate (k-1)th mu value between distributions at energies i and i+1.\n \/\/ When k==0, pick a value that will smear the cosine out to a minimum of -1.\n double mu_left = (k == 0) ?\n -1.0 - (mu + 1.0) :\n mu_out_(i, k-1) + f*(mu_out_(i+1, k-1) - mu_out_(i, k-1));\n\n \/\/ Inteprolate (k+1)th mu value between distributions at energies i and i+1.\n \/\/ When k is the last discrete value, pick a value that will smear the cosine\n \/\/ out to a maximum of 1.\n double mu_right = (k == n_mu - 1) ?\n 1.0 + (1.0 - mu) :\n mu_out_(i, k+1) + f*(mu_out_(i+1, k+1) - mu_out_(i, k+1));\n\n \/\/ Smear cosine\n mu += std::min(mu - mu_left, mu_right - mu)*(prn() - 0.5);\n\n \/\/ Energy doesn't change in elastic scattering\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentInelasticAEDiscrete implementation\n\/\/==============================================================================\n\nIncoherentInelasticAEDiscrete::IncoherentInelasticAEDiscrete(hid_t group,\n const std::vector<double>& energy)\n : energy_{energy}\n{\n read_dataset(group, \"energy_out\", energy_out_);\n read_dataset(group, \"mu_out\", mu_out_);\n read_dataset(group, \"skewed\", skewed_);\n}\n\nvoid\nIncoherentInelasticAEDiscrete::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for inelastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Now that we have an incoming energy bin, we need to determine the outgoing\n \/\/ energy bin. This will depend on whether the outgoing energy distribution is\n \/\/ skewed. If it is skewed, then the first two and last two bins have lower\n \/\/ probabilities than the other bins (0.1 for the first and last bins and 0.4\n \/\/ for the second and second to last bins, relative to a normal bin\n \/\/ probability of 1). Otherwise, each bin is equally probable.\n\n int j;\n int n = energy_out_.shape()[1];\n if (!skewed_) {\n \/\/ All bins equally likely\n j = prn() * n;\n } else {\n \/\/ Distribution skewed away from edge points\n double r = prn() * (n - 3);\n if (r > 1.0) {\n \/\/ equally likely N-4 middle bins\n j = r + 1;\n } else if (r > 0.6) {\n \/\/ second to last bin has relative probability of 0.4\n j = n - 2;\n } else if (r > 0.5) {\n \/\/ last bin has relative probability of 0.1\n j = n - 1;\n } else if (r > 0.1) {\n \/\/ second bin has relative probability of 0.4\n j = 1;\n } else {\n \/\/ first bin has relative probability of 0.1\n j = 0;\n }\n }\n\n \/\/ Determine outgoing energy corresponding to E_in[i] and E_in[i+1]\n double E_ij = energy_out_(i, j);\n double E_i1j = energy_out_(i+1, j);\n\n \/\/ Outgoing energy\n E_out = (1 - f)*E_ij + f*E_i1j;\n\n \/\/ Sample outgoing cosine bin\n int m = mu_out_.shape()[2];\n int k = prn() * m;\n\n \/\/ Determine outgoing cosine corresponding to E_in[i] and E_in[i+1]\n double mu_ijk = mu_out_(i, j, k);\n double mu_i1jk = mu_out_(i+1, j, k);\n\n \/\/ Cosine of angle between incoming and outgoing neutron\n mu = (1 - f)*mu_ijk + f*mu_i1jk;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentInelasticAE implementation\n\/\/==============================================================================\n\nIncoherentInelasticAE::IncoherentInelasticAE(hid_t group)\n{\n \/\/ Read correlated angle-energy distribution\n CorrelatedAngleEnergy dist {group};\n\n \/\/ Copy incident energies\n energy_ = dist.energy();\n\n \/\/ Convert to S(a,b) native format\n for (const auto& edist : dist.distribution()) {\n \/\/ Create temporary distribution\n DistEnergySab d;\n\n \/\/ Copy outgoing energy distribution\n d.n_e_out = edist.e_out.size();\n d.e_out = edist.e_out;\n d.e_out_pdf = edist.p;\n d.e_out_cdf = edist.c;\n\n for (int j = 0; j < d.n_e_out; ++j) {\n auto adist = dynamic_cast<Tabular*>(edist.angle[j].get());\n if (adist) {\n \/\/ On first pass, allocate space for angles\n if (j == 0) {\n auto n_mu = adist->x().size();\n d.mu = xt::empty<double>({d.n_e_out, n_mu});\n }\n\n \/\/ Copy outgoing angles\n auto mu_j = xt::view(d.mu, j);\n std::copy(adist->x().begin(), adist->x().end(), mu_j.begin());\n }\n }\n\n distribution_.emplace_back(std::move(d));\n }\n\n}\n\nvoid\nIncoherentInelasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for inelastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Sample between ith and [i+1]th bin\n int l = f > prn() ? i + 1 : i;\n\n \/\/ Determine endpoints on grid i\n auto n = distribution_[i].e_out.size();\n double E_i_1 = distribution_[i].e_out[0];\n double E_i_J = distribution_[i].e_out[n - 1];\n\n \/\/ Determine endpoints on grid i + 1\n n = distribution_[i + 1].e_out.size();\n double E_i1_1 = distribution_[i + 1].e_out[0];\n double E_i1_J = distribution_[i + 1].e_out[n - 1];\n\n double E_1 = E_i_1 + f * (E_i1_1 - E_i_1);\n double E_J = E_i_J + f * (E_i1_J - E_i_J);\n\n \/\/ Determine outgoing energy bin\n \/\/ (First reset n_energy_out to the right value)\n n = distribution_[l].n_e_out;\n double r1 = prn();\n double c_j = distribution_[l].e_out_cdf[0];\n double c_j1;\n std::size_t j;\n for (j = 0; j < n - 1; ++j) {\n c_j1 = distribution_[l].e_out_cdf[j + 1];\n if (r1 < c_j1) break;\n c_j = c_j1;\n }\n\n \/\/ check to make sure j is <= n_energy_out - 2\n j = std::min(j, n - 2);\n\n \/\/ Get the data to interpolate between\n double E_l_j = distribution_[l].e_out[j];\n double p_l_j = distribution_[l].e_out_pdf[j];\n\n \/\/ Next part assumes linear-linear interpolation in standard\n double E_l_j1 = distribution_[l].e_out[j + 1];\n double p_l_j1 = distribution_[l].e_out_pdf[j + 1];\n\n \/\/ Find secondary energy (variable E)\n double frac = (p_l_j1 - p_l_j) \/ (E_l_j1 - E_l_j);\n if (frac == 0.0) {\n E_out = E_l_j + (r1 - c_j) \/ p_l_j;\n } else {\n E_out = E_l_j + (std::sqrt(std::max(0.0, p_l_j*p_l_j +\n 2.0*frac*(r1 - c_j))) - p_l_j) \/ frac;\n }\n\n \/\/ Now interpolate between incident energy bins i and i + 1\n if (l == i) {\n E_out = E_1 + (E_out - E_i_1) * (E_J - E_1) \/ (E_i_J - E_i_1);\n } else {\n E_out = E_1 + (E_out - E_i1_1) * (E_J - E_1) \/ (E_i1_J - E_i1_1);\n }\n\n \/\/ Sample outgoing cosine bin\n int n_mu = distribution_[l].mu.shape()[1];\n std::size_t k = prn() * n_mu;\n\n \/\/ Rather than use the sampled discrete mu directly, it is smeared over\n \/\/ a bin of width 0.5*min(mu[k] - mu[k-1], mu[k+1] - mu[k]) centered on the\n \/\/ discrete mu value itself.\n const auto& mu_l = distribution_[l].mu;\n f = (r1 - c_j)\/(c_j1 - c_j);\n\n \/\/ Interpolate kth mu value between distributions at energies j and j+1\n mu = mu_l(j, k) + f*(mu_l(j+1, k) - mu_l(j, k));\n\n \/\/ Inteprolate (k-1)th mu value between distributions at energies j and j+1.\n \/\/ When k==0, pick a value that will smear the cosine out to a minimum of -1.\n double mu_left = (k == 0) ?\n mu_left = -1.0 - (mu + 1.0) :\n mu_left = mu_l(j, k-1) + f*(mu_l(j+1, k-1) - mu_l(j, k-1));\n\n \/\/ Inteprolate (k+1)th mu value between distributions at energies j and j+1.\n \/\/ When k is the last discrete value, pick a value that will smear the cosine\n \/\/ out to a maximum of 1.\n double mu_right = (k == n_mu - 1) ?\n mu_right = 1.0 + (1.0 - mu) :\n mu_right = mu_l(j, k+1) + f*(mu_l(j+1, k+1) - mu_l(j, k+1));\n\n \/\/ Smear cosine\n mu += std::min(mu - mu_left, mu_right - mu)*(prn() - 0.5);\n}\n\n} \/\/ namespace openmc\n<commit_msg>Change outgoing energy adjustment for incoherent inelastic to match MCNP6<commit_after>#include \"openmc\/secondary_thermal.h\"\n\n#include \"openmc\/hdf5_interface.h\"\n#include \"openmc\/random_lcg.h\"\n#include \"openmc\/search.h\"\n\n#include \"xtensor\/xview.hpp\"\n\n#include <cmath> \/\/ for log, exp\n\nnamespace openmc {\n\n\/\/ Helper function to get index on incident energy grid\nvoid\nget_energy_index(const std::vector<double>& energies, double E, int& i, double& f)\n{\n \/\/ Get index and interpolation factor for elastic grid\n i = 0;\n f = 0.0;\n if (E >= energies.front()) {\n i = lower_bound_index(energies.begin(), energies.end(), E);\n f = (E - energies[i]) \/ (energies[i+1] - energies[i]);\n }\n}\n\n\/\/==============================================================================\n\/\/ CoherentElasticAE implementation\n\/\/==============================================================================\n\nCoherentElasticAE::CoherentElasticAE(const CoherentElasticXS& xs)\n : xs_{xs}\n{ }\n\nvoid\nCoherentElasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for elastic grid\n int i;\n double f;\n const auto& energies {xs_.bragg_edges()};\n get_energy_index(energies, E_in, i, f);\n\n \/\/ Sample a Bragg edge between 1 and i\n const auto& factors = xs_.factors();\n double prob = prn() * factors[i+1];\n int k = 0;\n if (prob >= factors.front()) {\n k = lower_bound_index(factors.begin(), factors.begin() + (i+1), prob);\n }\n\n \/\/ Characteristic scattering cosine for this Bragg edge (ENDF-102, Eq. 7-2)\n mu = 1.0 - 2.0*energies[k] \/ E_in;\n\n \/\/ Energy doesn't change in elastic scattering (ENDF-102, Eq. 7-1)\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentElasticAE implementation\n\/\/==============================================================================\n\nIncoherentElasticAE::IncoherentElasticAE(hid_t group)\n{\n read_dataset(group, \"debye_waller\", debye_waller_);\n}\n\nvoid\nIncoherentElasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Sample angle by inverting the distribution in ENDF-102, Eq. 7.4\n double c = 2 * E_in * debye_waller_;\n mu = std::log(1.0 + prn()*(std::exp(2.0*c) - 1))\/c - 1.0;\n\n \/\/ Energy doesn't change in elastic scattering (ENDF-102, Eq. 7.4)\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentElasticAEDiscrete implementation\n\/\/==============================================================================\n\nIncoherentElasticAEDiscrete::IncoherentElasticAEDiscrete(hid_t group,\n const std::vector<double>& energy)\n : energy_{energy}\n{\n read_dataset(group, \"mu_out\", mu_out_);\n}\n\nvoid\nIncoherentElasticAEDiscrete::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for elastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Interpolate between two discrete cosines corresponding to neighboring\n \/\/ incoming energies.\n\n \/\/ Sample outgoing cosine bin\n int n_mu = mu_out_.shape()[1];\n int k = prn() * n_mu;\n\n \/\/ Rather than use the sampled discrete mu directly, it is smeared over\n \/\/ a bin of width 0.5*min(mu[k] - mu[k-1], mu[k+1] - mu[k]) centered on the\n \/\/ discrete mu value itself.\n\n \/\/ Interpolate kth mu value between distributions at energies i and i+1\n mu = mu_out_(i, k) + f*(mu_out_(i+1, k) - mu_out_(i, k));\n\n \/\/ Inteprolate (k-1)th mu value between distributions at energies i and i+1.\n \/\/ When k==0, pick a value that will smear the cosine out to a minimum of -1.\n double mu_left = (k == 0) ?\n -1.0 - (mu + 1.0) :\n mu_out_(i, k-1) + f*(mu_out_(i+1, k-1) - mu_out_(i, k-1));\n\n \/\/ Inteprolate (k+1)th mu value between distributions at energies i and i+1.\n \/\/ When k is the last discrete value, pick a value that will smear the cosine\n \/\/ out to a maximum of 1.\n double mu_right = (k == n_mu - 1) ?\n 1.0 + (1.0 - mu) :\n mu_out_(i, k+1) + f*(mu_out_(i+1, k+1) - mu_out_(i, k+1));\n\n \/\/ Smear cosine\n mu += std::min(mu - mu_left, mu_right - mu)*(prn() - 0.5);\n\n \/\/ Energy doesn't change in elastic scattering\n E_out = E_in;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentInelasticAEDiscrete implementation\n\/\/==============================================================================\n\nIncoherentInelasticAEDiscrete::IncoherentInelasticAEDiscrete(hid_t group,\n const std::vector<double>& energy)\n : energy_{energy}\n{\n read_dataset(group, \"energy_out\", energy_out_);\n read_dataset(group, \"mu_out\", mu_out_);\n read_dataset(group, \"skewed\", skewed_);\n}\n\nvoid\nIncoherentInelasticAEDiscrete::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for inelastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Now that we have an incoming energy bin, we need to determine the outgoing\n \/\/ energy bin. This will depend on whether the outgoing energy distribution is\n \/\/ skewed. If it is skewed, then the first two and last two bins have lower\n \/\/ probabilities than the other bins (0.1 for the first and last bins and 0.4\n \/\/ for the second and second to last bins, relative to a normal bin\n \/\/ probability of 1). Otherwise, each bin is equally probable.\n\n int j;\n int n = energy_out_.shape()[1];\n if (!skewed_) {\n \/\/ All bins equally likely\n j = prn() * n;\n } else {\n \/\/ Distribution skewed away from edge points\n double r = prn() * (n - 3);\n if (r > 1.0) {\n \/\/ equally likely N-4 middle bins\n j = r + 1;\n } else if (r > 0.6) {\n \/\/ second to last bin has relative probability of 0.4\n j = n - 2;\n } else if (r > 0.5) {\n \/\/ last bin has relative probability of 0.1\n j = n - 1;\n } else if (r > 0.1) {\n \/\/ second bin has relative probability of 0.4\n j = 1;\n } else {\n \/\/ first bin has relative probability of 0.1\n j = 0;\n }\n }\n\n \/\/ Determine outgoing energy corresponding to E_in[i] and E_in[i+1]\n double E_ij = energy_out_(i, j);\n double E_i1j = energy_out_(i+1, j);\n\n \/\/ Outgoing energy\n E_out = (1 - f)*E_ij + f*E_i1j;\n\n \/\/ Sample outgoing cosine bin\n int m = mu_out_.shape()[2];\n int k = prn() * m;\n\n \/\/ Determine outgoing cosine corresponding to E_in[i] and E_in[i+1]\n double mu_ijk = mu_out_(i, j, k);\n double mu_i1jk = mu_out_(i+1, j, k);\n\n \/\/ Cosine of angle between incoming and outgoing neutron\n mu = (1 - f)*mu_ijk + f*mu_i1jk;\n}\n\n\/\/==============================================================================\n\/\/ IncoherentInelasticAE implementation\n\/\/==============================================================================\n\nIncoherentInelasticAE::IncoherentInelasticAE(hid_t group)\n{\n \/\/ Read correlated angle-energy distribution\n CorrelatedAngleEnergy dist {group};\n\n \/\/ Copy incident energies\n energy_ = dist.energy();\n\n \/\/ Convert to S(a,b) native format\n for (const auto& edist : dist.distribution()) {\n \/\/ Create temporary distribution\n DistEnergySab d;\n\n \/\/ Copy outgoing energy distribution\n d.n_e_out = edist.e_out.size();\n d.e_out = edist.e_out;\n d.e_out_pdf = edist.p;\n d.e_out_cdf = edist.c;\n\n for (int j = 0; j < d.n_e_out; ++j) {\n auto adist = dynamic_cast<Tabular*>(edist.angle[j].get());\n if (adist) {\n \/\/ On first pass, allocate space for angles\n if (j == 0) {\n auto n_mu = adist->x().size();\n d.mu = xt::empty<double>({d.n_e_out, n_mu});\n }\n\n \/\/ Copy outgoing angles\n auto mu_j = xt::view(d.mu, j);\n std::copy(adist->x().begin(), adist->x().end(), mu_j.begin());\n }\n }\n\n distribution_.emplace_back(std::move(d));\n }\n\n}\n\nvoid\nIncoherentInelasticAE::sample(double E_in, double& E_out, double& mu) const\n{\n \/\/ Get index and interpolation factor for inelastic grid\n int i;\n double f;\n get_energy_index(energy_, E_in, i, f);\n\n \/\/ Pick closer energy based on interpolation factor\n int l = f > 0.5 ? i + 1 : i;\n\n \/\/ Determine endpoints on grid i\n auto n = distribution_[i].e_out.size();\n double E_i_1 = distribution_[i].e_out[0];\n double E_i_J = distribution_[i].e_out[n - 1];\n\n \/\/ Determine endpoints on grid i + 1\n n = distribution_[i + 1].e_out.size();\n double E_i1_1 = distribution_[i + 1].e_out[0];\n double E_i1_J = distribution_[i + 1].e_out[n - 1];\n\n double E_1 = E_i_1 + f * (E_i1_1 - E_i_1);\n double E_J = E_i_J + f * (E_i1_J - E_i_J);\n\n \/\/ Determine outgoing energy bin\n \/\/ (First reset n_energy_out to the right value)\n n = distribution_[l].n_e_out;\n double r1 = prn();\n double c_j = distribution_[l].e_out_cdf[0];\n double c_j1;\n std::size_t j;\n for (j = 0; j < n - 1; ++j) {\n c_j1 = distribution_[l].e_out_cdf[j + 1];\n if (r1 < c_j1) break;\n c_j = c_j1;\n }\n\n \/\/ check to make sure j is <= n_energy_out - 2\n j = std::min(j, n - 2);\n\n \/\/ Get the data to interpolate between\n double E_l_j = distribution_[l].e_out[j];\n double p_l_j = distribution_[l].e_out_pdf[j];\n\n \/\/ Next part assumes linear-linear interpolation in standard\n double E_l_j1 = distribution_[l].e_out[j + 1];\n double p_l_j1 = distribution_[l].e_out_pdf[j + 1];\n\n \/\/ Find secondary energy (variable E)\n double frac = (p_l_j1 - p_l_j) \/ (E_l_j1 - E_l_j);\n if (frac == 0.0) {\n E_out = E_l_j + (r1 - c_j) \/ p_l_j;\n } else {\n E_out = E_l_j + (std::sqrt(std::max(0.0, p_l_j*p_l_j +\n 2.0*frac*(r1 - c_j))) - p_l_j) \/ frac;\n }\n\n \/\/ Adjustment of outgoing energy\n double E_l = energy_[l];\n if (E_out < 0.5*E_l) {\n E_out *= 2.0*E_in\/E_l - 1.0;\n } else {\n E_out += E_in - E_l;\n }\n\n \/\/ Sample outgoing cosine bin\n int n_mu = distribution_[l].mu.shape()[1];\n std::size_t k = prn() * n_mu;\n\n \/\/ Rather than use the sampled discrete mu directly, it is smeared over\n \/\/ a bin of width 0.5*min(mu[k] - mu[k-1], mu[k+1] - mu[k]) centered on the\n \/\/ discrete mu value itself.\n const auto& mu_l = distribution_[l].mu;\n f = (r1 - c_j)\/(c_j1 - c_j);\n\n \/\/ Interpolate kth mu value between distributions at energies j and j+1\n mu = mu_l(j, k) + f*(mu_l(j+1, k) - mu_l(j, k));\n\n \/\/ Inteprolate (k-1)th mu value between distributions at energies j and j+1.\n \/\/ When k==0, pick a value that will smear the cosine out to a minimum of -1.\n double mu_left = (k == 0) ?\n mu_left = -1.0 - (mu + 1.0) :\n mu_left = mu_l(j, k-1) + f*(mu_l(j+1, k-1) - mu_l(j, k-1));\n\n \/\/ Inteprolate (k+1)th mu value between distributions at energies j and j+1.\n \/\/ When k is the last discrete value, pick a value that will smear the cosine\n \/\/ out to a maximum of 1.\n double mu_right = (k == n_mu - 1) ?\n mu_right = 1.0 + (1.0 - mu) :\n mu_right = mu_l(j, k+1) + f*(mu_l(j+1, k+1) - mu_l(j, k+1));\n\n \/\/ Smear cosine\n mu += std::min(mu - mu_left, mu_right - mu)*(prn() - 0.5);\n}\n\n} \/\/ namespace openmc\n<|endoftext|>"} {"text":"<commit_before>\/* libs\/graphics\/images\/SkImageDecoder.cpp\n**\n** Copyright 2006, The Android Open Source Project\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n** See the License for the specific language governing permissions and\n** limitations under the License.\n*\/\n\n#include \"SkImageDecoder.h\"\n#include \"SkBitmap.h\"\n#include \"SkPixelRef.h\"\n#include \"SkStream.h\"\n#include \"SkTemplates.h\"\n\nstatic SkBitmap::Config gDeviceConfig = SkBitmap::kNo_Config;\n\nSkBitmap::Config SkImageDecoder::GetDeviceConfig()\n{\n return gDeviceConfig;\n}\n\nvoid SkImageDecoder::SetDeviceConfig(SkBitmap::Config config)\n{\n gDeviceConfig = config;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder::SkImageDecoder()\n : fPeeker(NULL), fChooser(NULL), fAllocator(NULL), fSampleSize(1),\n fDefaultPref(SkBitmap::kNo_Config), fDitherImage(true),\n fUsePrefTable(false) {\n SkDebugf(\"--------- sizeof(fPrefTable) = %d\\n\", sizeof(fPrefTable));\n}\n\nSkImageDecoder::~SkImageDecoder() {\n fPeeker->safeUnref();\n fChooser->safeUnref();\n fAllocator->safeUnref();\n}\n\nSkImageDecoder::Format SkImageDecoder::getFormat() const {\n return kUnknown_Format;\n}\n\nSkImageDecoder::Peeker* SkImageDecoder::setPeeker(Peeker* peeker) {\n SkRefCnt_SafeAssign(fPeeker, peeker);\n return peeker;\n}\n\nSkImageDecoder::Chooser* SkImageDecoder::setChooser(Chooser* chooser) {\n SkRefCnt_SafeAssign(fChooser, chooser);\n return chooser;\n}\n\nSkBitmap::Allocator* SkImageDecoder::setAllocator(SkBitmap::Allocator* alloc) {\n SkRefCnt_SafeAssign(fAllocator, alloc);\n return alloc;\n}\n\nvoid SkImageDecoder::setSampleSize(int size) {\n if (size < 1) {\n size = 1;\n }\n fSampleSize = size;\n}\n\nbool SkImageDecoder::chooseFromOneChoice(SkBitmap::Config config, int width,\n int height) const {\n Chooser* chooser = fChooser;\n\n if (NULL == chooser) { \/\/ no chooser, we just say YES to decoding :)\n return true;\n }\n chooser->begin(1);\n chooser->inspect(0, config, width, height);\n return chooser->choose() == 0;\n}\n\nbool SkImageDecoder::allocPixelRef(SkBitmap* bitmap,\n SkColorTable* ctable) const {\n return bitmap->allocPixels(fAllocator, ctable);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkImageDecoder::setPrefConfigTable(const SkBitmap::Config pref[6]) {\n if (NULL == pref) {\n fUsePrefTable = false;\n } else {\n fUsePrefTable = true;\n memcpy(fPrefTable, pref, sizeof(fPrefTable));\n }\n}\n\nSkBitmap::Config SkImageDecoder::getPrefConfig(SrcDepth srcDepth,\n bool srcHasAlpha) const {\n SkBitmap::Config config;\n\n if (fUsePrefTable) {\n int index = 0;\n switch (srcDepth) {\n case kIndex_SrcDepth:\n index = 0;\n break;\n case k16Bit_SrcDepth:\n index = 2;\n break;\n case k32Bit_SrcDepth:\n index = 4;\n break;\n }\n if (srcHasAlpha) {\n index += 1;\n }\n config = fPrefTable[index];\n } else {\n config = fDefaultPref;\n }\n\n if (SkBitmap::kNo_Config == config) {\n config = SkImageDecoder::GetDeviceConfig();\n }\n return config;\n}\n\nbool SkImageDecoder::decode(SkStream* stream, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode) {\n \/\/ pass a temporary bitmap, so that if we return false, we are assured of\n \/\/ leaving the caller's bitmap untouched.\n SkBitmap tmp;\n\n \/\/ we reset this to false before calling onDecode\n fShouldCancelDecode = false;\n \/\/ assign this, for use by getPrefConfig(), in case fUsePrefTable is false\n fDefaultPref = pref;\n\n if (!this->onDecode(stream, &tmp, mode)) {\n return false;\n }\n bm->swap(tmp);\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool SkImageDecoder::DecodeFile(const char file[], SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n SkASSERT(file);\n SkASSERT(bm);\n\n SkFILEStream stream(file);\n if (stream.isValid()) {\n if (SkImageDecoder::DecodeStream(&stream, bm, pref, mode, format)) {\n bm->pixelRef()->setURI(file);\n }\n return true;\n }\n return false;\n}\n\nbool SkImageDecoder::DecodeMemory(const void* buffer, size_t size, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n if (0 == size) {\n return false;\n }\n SkASSERT(buffer);\n\n SkMemoryStream stream(buffer, size);\n return SkImageDecoder::DecodeStream(&stream, bm, pref, mode, format);\n}\n\nbool SkImageDecoder::DecodeStream(SkStream* stream, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n SkASSERT(stream);\n SkASSERT(bm);\n\n bool success = false;\n SkImageDecoder* codec = SkImageDecoder::Factory(stream);\n\n if (NULL != codec) {\n success = codec->decode(stream, bm, pref, mode);\n if (success && format) {\n *format = codec->getFormat();\n }\n delete codec;\n }\n return success;\n}\n\n<commit_msg>remove debugging printf<commit_after>\/* libs\/graphics\/images\/SkImageDecoder.cpp\n**\n** Copyright 2006, The Android Open Source Project\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n** See the License for the specific language governing permissions and\n** limitations under the License.\n*\/\n\n#include \"SkImageDecoder.h\"\n#include \"SkBitmap.h\"\n#include \"SkPixelRef.h\"\n#include \"SkStream.h\"\n#include \"SkTemplates.h\"\n\nstatic SkBitmap::Config gDeviceConfig = SkBitmap::kNo_Config;\n\nSkBitmap::Config SkImageDecoder::GetDeviceConfig()\n{\n return gDeviceConfig;\n}\n\nvoid SkImageDecoder::SetDeviceConfig(SkBitmap::Config config)\n{\n gDeviceConfig = config;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nSkImageDecoder::SkImageDecoder()\n : fPeeker(NULL), fChooser(NULL), fAllocator(NULL), fSampleSize(1),\n fDefaultPref(SkBitmap::kNo_Config), fDitherImage(true),\n fUsePrefTable(false) {\n}\n\nSkImageDecoder::~SkImageDecoder() {\n fPeeker->safeUnref();\n fChooser->safeUnref();\n fAllocator->safeUnref();\n}\n\nSkImageDecoder::Format SkImageDecoder::getFormat() const {\n return kUnknown_Format;\n}\n\nSkImageDecoder::Peeker* SkImageDecoder::setPeeker(Peeker* peeker) {\n SkRefCnt_SafeAssign(fPeeker, peeker);\n return peeker;\n}\n\nSkImageDecoder::Chooser* SkImageDecoder::setChooser(Chooser* chooser) {\n SkRefCnt_SafeAssign(fChooser, chooser);\n return chooser;\n}\n\nSkBitmap::Allocator* SkImageDecoder::setAllocator(SkBitmap::Allocator* alloc) {\n SkRefCnt_SafeAssign(fAllocator, alloc);\n return alloc;\n}\n\nvoid SkImageDecoder::setSampleSize(int size) {\n if (size < 1) {\n size = 1;\n }\n fSampleSize = size;\n}\n\nbool SkImageDecoder::chooseFromOneChoice(SkBitmap::Config config, int width,\n int height) const {\n Chooser* chooser = fChooser;\n\n if (NULL == chooser) { \/\/ no chooser, we just say YES to decoding :)\n return true;\n }\n chooser->begin(1);\n chooser->inspect(0, config, width, height);\n return chooser->choose() == 0;\n}\n\nbool SkImageDecoder::allocPixelRef(SkBitmap* bitmap,\n SkColorTable* ctable) const {\n return bitmap->allocPixels(fAllocator, ctable);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid SkImageDecoder::setPrefConfigTable(const SkBitmap::Config pref[6]) {\n if (NULL == pref) {\n fUsePrefTable = false;\n } else {\n fUsePrefTable = true;\n memcpy(fPrefTable, pref, sizeof(fPrefTable));\n }\n}\n\nSkBitmap::Config SkImageDecoder::getPrefConfig(SrcDepth srcDepth,\n bool srcHasAlpha) const {\n SkBitmap::Config config;\n\n if (fUsePrefTable) {\n int index = 0;\n switch (srcDepth) {\n case kIndex_SrcDepth:\n index = 0;\n break;\n case k16Bit_SrcDepth:\n index = 2;\n break;\n case k32Bit_SrcDepth:\n index = 4;\n break;\n }\n if (srcHasAlpha) {\n index += 1;\n }\n config = fPrefTable[index];\n } else {\n config = fDefaultPref;\n }\n\n if (SkBitmap::kNo_Config == config) {\n config = SkImageDecoder::GetDeviceConfig();\n }\n return config;\n}\n\nbool SkImageDecoder::decode(SkStream* stream, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode) {\n \/\/ pass a temporary bitmap, so that if we return false, we are assured of\n \/\/ leaving the caller's bitmap untouched.\n SkBitmap tmp;\n\n \/\/ we reset this to false before calling onDecode\n fShouldCancelDecode = false;\n \/\/ assign this, for use by getPrefConfig(), in case fUsePrefTable is false\n fDefaultPref = pref;\n\n if (!this->onDecode(stream, &tmp, mode)) {\n return false;\n }\n bm->swap(tmp);\n return true;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool SkImageDecoder::DecodeFile(const char file[], SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n SkASSERT(file);\n SkASSERT(bm);\n\n SkFILEStream stream(file);\n if (stream.isValid()) {\n if (SkImageDecoder::DecodeStream(&stream, bm, pref, mode, format)) {\n bm->pixelRef()->setURI(file);\n }\n return true;\n }\n return false;\n}\n\nbool SkImageDecoder::DecodeMemory(const void* buffer, size_t size, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n if (0 == size) {\n return false;\n }\n SkASSERT(buffer);\n\n SkMemoryStream stream(buffer, size);\n return SkImageDecoder::DecodeStream(&stream, bm, pref, mode, format);\n}\n\nbool SkImageDecoder::DecodeStream(SkStream* stream, SkBitmap* bm,\n SkBitmap::Config pref, Mode mode, Format* format) {\n SkASSERT(stream);\n SkASSERT(bm);\n\n bool success = false;\n SkImageDecoder* codec = SkImageDecoder::Factory(stream);\n\n if (NULL != codec) {\n success = codec->decode(stream, bm, pref, mode);\n if (success && format) {\n *format = codec->getFormat();\n }\n delete codec;\n }\n return success;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>typo: equantion -> equation<commit_after><|endoftext|>"} {"text":"<commit_before>\/* indivudal.cpp - CS 472 Project #2: Genetic Programming\n * Copyright 2014 Andrew Schwartzmeyer\n *\n * Source file for Individual\n *\/\n\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <memory>\n#include <tuple>\n#include <vector>\n\n#include \"individual.hpp\"\n#include \"..\/problem\/problem.hpp\"\n#include \"..\/random_generator\/random_generator.hpp\"\n\n\nnamespace individual {\n using std::vector;\n using std::string;\n using problem::Problem;\n using namespace random_generator;\n\n \/\/ vectors of same-arity function enums\n vector<Function> terminals {constant, input};\n vector<Function> unaries {sqrt, sin, cos, log, exp};\n vector<Function> binaries {add, subtract, multiply, divide, pow};\n vector<Function> quadnaries {lesser, greater};\n vector<Function> internals {add, subtract, multiply, divide, lesser, greater};\n\n template<typename I, typename S> bool contains(const I & item, const S & set) {\n return std::find(set.begin(), set.end(), item) != set.end();\n }\n\n Node::Node(const Problem & problem, const int & depth) {\n if (depth < problem.max_depth) {\n \/\/ assign random internal function\n int_dist dist(0, internals.size() - 1); \/\/ closed interval\n function = Function(internals[dist(rg.engine)]);\n assert(contains(function, internals));\n \/\/ determine node's arity\n if (contains(function, unaries)) arity = 1;\n else if (contains(function, binaries)) arity = 2;\n else if (contains(function, quadnaries)) arity = 4;\n assert(arity != 0);\n \/\/ recursively create subtrees\n for (int i = 0; i < arity; i++)\n\tchildren.emplace_back(Node(problem, depth + 1));\n } else {\n \/\/ reached max depth, assign random terminal function\n int_dist dist(0, terminals.size() - 1); \/\/ closed interval\n function = Function(terminals[dist(rg.engine)]);\n assert(arity == 0);\n \/\/ setup constant function; input is provided on evaluation\n if (function == constant) {\n\t\/\/ choose a random value between the problem's min and max\n\treal_dist dist(problem.constant_min, problem.constant_max);\n\tk = dist(rg.engine);\n }\n }\n assert(function != null); \/\/ do not create null types\n }\n\n string Node::represent() const {\n switch(function) {\n case null:\n assert(false); \/\/ never represent empty node\n case constant:\n return std::to_string(k);\n case input:\n return \"x\";\n case sqrt:\n return \" sqrt\";\n case sin:\n return \" sin\";\n case cos:\n return \" cos\";\n case log:\n return \" log\";\n case exp:\n return \" exp\";\n case add:\n return \" +\";\n case subtract:\n return \" -\";\n case multiply:\n return \" *\";\n case divide:\n return \" \/\";\n case pow:\n return \" ^\";\n case lesser:\n return \" a < b ? c : d\";\n case greater:\n return \" a > b ? c : d\";\n }\n }\n\n string Node::print() const {\n \/\/ Post-order traversal print of expression in RPN\/postfix notation\n string formula = \"(\";\n for (auto child : children)\n formula += child.print();\n return formula + represent() + \")\";\n }\n\n double Node::evaluate(const double & x) const {\n \/\/ depth-first post-order recursive evaluation tree\n double a, b, c, d;\n if (arity == 1)\n a = children[0].evaluate(x);\n else if (arity == 2) {\n a = children[0].evaluate(x);\n b = children[1].evaluate(x);\n }\n else if (arity == 4) {\n a = children[0].evaluate(x);\n b = children[1].evaluate(x);\n c = children[2].evaluate(x);\n d = children[3].evaluate(x);\n }\n \/\/ calculate the result\n switch(function) {\n case null:\n assert(false); \/\/ never calculate empty node\n case constant:\n return k;\n case input:\n return x;\n case sqrt:\n return std::sqrt(std::abs(a)); \/\/ protected\n case sin:\n return std::sin(a);\n case cos:\n return std::cos(a);\n case log:\n return (a == 0) ? 0 : std::log(std::abs(a)); \/\/ protected\n case exp:\n return std::exp(a);\n case add:\n return a + b;\n case subtract:\n return a - b;\n case multiply:\n return a * b;\n case divide:\n return (b == 0) ? 1 : a \/ b; \/\/ protected\n case pow:\n return std::pow(std::abs(a), std::abs(b)); \/\/ protected\n case lesser:\n return (a < b) ? c : d;\n case greater:\n return (a > b) ? c : d;\n }\n }\n\n const Size Node::size() const {\n \/\/ recursively count children via post-order traversal\n \/\/ keep track of internals and leafs via Size struct\n Size size;\n for (const Node & child : children) {\n Size temp = child.size(); \/\/ is this micro-optimizing?\n size.internals += temp.internals;\n size.leafs += temp.leafs;\n }\n if (children.size() == 0) ++size.leafs;\n else ++size.internals;\n return size;\n }\n\n Node empty;\n\n Node & Node::visit(const Size & i, Size & visiting) {\n \/\/ depth-first search for taget node, either internal or leaf\n for (Node & child : children) {\n \/\/ increase relevant count\n if (child.children.size() == 0) ++visiting.leafs;\n else ++visiting.internals;\n \/\/ return node reference if found\n if (visiting.internals == i.internals or visiting.leafs == i.leafs)\n\treturn child;\n Node & temp = child.visit(i, visiting); \/\/ mark each node\n if (temp.function != null) return temp; \/\/ return found node\n }\n return empty; \/\/ need to indicate \"not-found\"\n }\n\n void Node::mutate_self(const double & min, const double & max) {\n \/\/ single node mutation to different function of same arity\n if (arity == 0) {\n \/\/ mutate constant to a value in its neighborhood, don't switch functions\n if (function == constant) {\n\tnormal_dist dist{0, 1};\n\tk *= 1 + dist(rg.engine);\n }\n }\n else if (arity == 1) {\n int_dist dist{0, int(unaries.size()) - 1};\n Function prior = function;\n \/\/ ensure we're using a specified available function\n while (function == prior or not contains(function, internals))\n\tfunction = Function(unaries[dist(rg.engine)]);\n }\n else if (arity == 2) {\n int_dist dist{0, int(binaries.size()) - 1};\n Function prior = function;\n while (function == prior or not contains(function, internals))\n\tfunction = Function(binaries[dist(rg.engine)]);\n }\n else if (arity == 4) {\n int_dist dist{0, int(quadnaries.size()) - 1};\n Function prior = function;\n while (function == prior or not contains(function, internals))\n\tfunction = Function(quadnaries[dist(rg.engine)]);\n }\n assert(function != null);\n }\n\n void Node::mutate_tree(const double & chance, const double & min, const double & max) {\n \/\/ recursively mutate nodes with problem.mutate_chance probability\n real_dist dist{0, 1};\n for (Node & child : children) {\n child.mutate_tree(chance, min, max);\n if (dist(rg.engine) < chance) child.mutate_self();\n }\n }\n\n Individual::Individual(const Problem & problem): root{Node{problem}} {\n update_size();\n evaluate(problem.values);\n }\n\n string Individual::print_formula() const {\n using std::to_string;\n string formula = \"Expression tree of size \" + to_string(get_total())\n + \" with \" + to_string(get_internals()) + \" internals\"\n + \" and \" + to_string(get_leafs()) + \" leafs\"\n + \" has the following formula: \" + \"\\n\"\n + root.print() + \"\\n\";\n return formula;\n }\n\n string Individual::print_calculation(const problem::pairs & values) const {\n using std::to_string;\n using std::get;\n double fitness = 0;\n string calculation;\n for (auto pair : values) {\n double output = root.evaluate(get<0>(pair));\n double error = std::pow(output - get<1>(pair), 2);\n fitness += error;\n calculation += + \"f(\" + to_string(get<0>(pair))\n\t+ \") = \" + to_string(output)\n\t+ \", expected \" + to_string(get<1>(pair))\n\t+ \", error = \" + to_string(error) + \"\\n\";\n }\n calculation += \"Total fitness: \" + to_string(std::sqrt(fitness)) + \".\\n\";\n return calculation;\n }\n\n void Individual::update_size() {\n size = root.size();\n }\n\n void Individual::evaluate(const problem::pairs & values) {\n double error = 0;\n for (auto pair : values) {\n double output = root.evaluate(std::get<0>(pair));\n assert(not std::isnan(output) and not std::isinf(output));\n error += std::pow(output - std::get<1>(pair), 2);\n }\n fitness = error;\n \/\/ update size on evaluation because it's incredibly convenient\n update_size();\n }\n\n void Individual::mutate(const double & chance, const double & min, const double & max) {\n \/\/ mutate each node with a problem.mutate_chance probability\n root.mutate_tree(chance, min, max);\n }\n\n Node & Individual::operator[](const Size & i) {\n assert(i.internals <= get_internals());\n assert(i.leafs <= get_leafs());\n Size visiting;\n return root.visit(i, visiting);\n }\n\n void crossover(const double & chance, Individual & a, Individual & b) {\n real_dist probability{0, 1};\n Size target_a, target_b;\n if (probability(rg.engine) < chance) {\n \/\/ choose an internal node\n int_dist dist{0, a.get_internals() - 1};\n target_a.internals = dist(rg.engine);\n } else {\n \/\/ otherwise we choose a leaf node\n int_dist dist{0, a.get_leafs() - 1};\n target_a.leafs = dist(rg.engine);\n }\n \/\/ do the same thing for the second individual\n if (probability(rg.engine) < chance) {\n int_dist dist{0, b.get_internals() - 1};\n target_b.internals = dist(rg.engine);\n } else {\n int_dist dist{0, b.get_leafs() - 1};\n target_b.leafs = dist(rg.engine);\n }\n \/\/ replace nodes\n std::swap(a[target_a], b[target_b]);\n }\n}\n<commit_msg>Refactoring to add get_function methods<commit_after>\/* indivudal.cpp - CS 472 Project #2: Genetic Programming\n * Copyright 2014 Andrew Schwartzmeyer\n *\n * Source file for Individual\n *\/\n\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <iostream>\n#include <memory>\n#include <tuple>\n#include <vector>\n\n#include \"individual.hpp\"\n#include \"..\/problem\/problem.hpp\"\n#include \"..\/random_generator\/random_generator.hpp\"\n\n\nnamespace individual {\n using std::vector;\n using std::string;\n using problem::Problem;\n using namespace random_generator;\n\n \/\/ vectors of same-arity function enums\n vector<Function> nullaries{constant, input};\n vector<Function> unaries{sqrt, sin, cos, log, exp};\n vector<Function> binaries{add, subtract, multiply, divide, pow};\n vector<Function> quadnaries{lesser, greater};\n vector<Function> internals{add, subtract, multiply, divide, lesser, greater};\n\n template<typename I, typename S> bool contains(const I & item, const S & set) {\n return std::find(set.begin(), set.end(), item) != set.end();\n }\n\n Function get_internal() {\n int_dist dist{0, int(internals.size()) - 1}; \/\/ closed interval\n return Function(internals[dist(rg.engine)]);\n }\n\n Function get_leaf() {\n int_dist dist{0, int(nullaries.size()) - 1}; \/\/ closed interval\n return Function(nullaries[dist(rg.engine)]);\n }\n\n double get_constant(const double & min, const double & max) {\n real_dist dist{min, max};\n return dist(rg.engine);\n }\n\n int get_arity(const Function & function) {\n if (contains(function, nullaries)) return 0;\n else if (contains(function, unaries)) return 1;\n else if (contains(function, binaries)) return 2;\n else if (contains(function, quadnaries)) return 4;\n assert(false);\n }\n\n Node::Node(const Problem & problem, const int & depth) {\n if (depth < problem.max_depth) {\n \/\/ assign random internal function\n int_dist dist(0, internals.size() - 1); \/\/ closed interval\n function = Function(internals[dist(rg.engine)]);\n assert(contains(function, internals));\n \/\/ determine node's arity\n if (contains(function, unaries)) arity = 1;\n else if (contains(function, binaries)) arity = 2;\n else if (contains(function, quadnaries)) arity = 4;\n assert(arity != 0);\n \/\/ recursively create subtrees\n for (int i = 0; i < arity; i++)\n\tchildren.emplace_back(Node(problem, depth + 1));\n } else {\n \/\/ reached max depth, assign random terminal function\n int_dist dist(0, terminals.size() - 1); \/\/ closed interval\n function = Function(terminals[dist(rg.engine)]);\n assert(arity == 0);\n \/\/ setup constant function; input is provided on evaluation\n if (function == constant) {\n\t\/\/ choose a random value between the problem's min and max\n\treal_dist dist(problem.constant_min, problem.constant_max);\n\tk = dist(rg.engine);\n }\n }\n assert(function != null); \/\/ do not create null types\n }\n\n string Node::represent() const {\n switch(function) {\n case null:\n assert(false); \/\/ never represent empty node\n case constant:\n return std::to_string(k);\n case input:\n return \"x\";\n case sqrt:\n return \" sqrt\";\n case sin:\n return \" sin\";\n case cos:\n return \" cos\";\n case log:\n return \" log\";\n case exp:\n return \" exp\";\n case add:\n return \" +\";\n case subtract:\n return \" -\";\n case multiply:\n return \" *\";\n case divide:\n return \" \/\";\n case pow:\n return \" ^\";\n case lesser:\n return \" a < b ? c : d\";\n case greater:\n return \" a > b ? c : d\";\n }\n }\n\n string Node::print() const {\n \/\/ Post-order traversal print of expression in RPN\/postfix notation\n string formula = \"(\";\n for (auto child : children)\n formula += child.print();\n return formula + represent() + \")\";\n }\n\n double Node::evaluate(const double & x) const {\n \/\/ depth-first post-order recursive evaluation tree\n double a, b, c, d;\n if (arity == 1)\n a = children[0].evaluate(x);\n else if (arity == 2) {\n a = children[0].evaluate(x);\n b = children[1].evaluate(x);\n }\n else if (arity == 4) {\n a = children[0].evaluate(x);\n b = children[1].evaluate(x);\n c = children[2].evaluate(x);\n d = children[3].evaluate(x);\n }\n \/\/ calculate the result\n switch(function) {\n case null:\n assert(false); \/\/ never calculate empty node\n case constant:\n return k;\n case input:\n return x;\n case sqrt:\n return std::sqrt(std::abs(a)); \/\/ protected\n case sin:\n return std::sin(a);\n case cos:\n return std::cos(a);\n case log:\n return (a == 0) ? 0 : std::log(std::abs(a)); \/\/ protected\n case exp:\n return std::exp(a);\n case add:\n return a + b;\n case subtract:\n return a - b;\n case multiply:\n return a * b;\n case divide:\n return (b == 0) ? 1 : a \/ b; \/\/ protected\n case pow:\n return std::pow(std::abs(a), std::abs(b)); \/\/ protected\n case lesser:\n return (a < b) ? c : d;\n case greater:\n return (a > b) ? c : d;\n }\n }\n\n const Size Node::size() const {\n \/\/ recursively count children via post-order traversal\n \/\/ keep track of internals and leafs via Size struct\n Size size;\n for (const Node & child : children) {\n Size temp = child.size(); \/\/ is this micro-optimizing?\n size.internals += temp.internals;\n size.leafs += temp.leafs;\n }\n if (children.size() == 0) ++size.leafs;\n else ++size.internals;\n return size;\n }\n\n Node empty;\n\n Node & Node::visit(const Size & i, Size & visiting) {\n \/\/ depth-first search for taget node, either internal or leaf\n for (Node & child : children) {\n \/\/ increase relevant count\n if (child.children.size() == 0) ++visiting.leafs;\n else ++visiting.internals;\n \/\/ return node reference if found\n if (visiting.internals == i.internals or visiting.leafs == i.leafs)\n\treturn child;\n Node & temp = child.visit(i, visiting); \/\/ mark each node\n if (temp.function != null) return temp; \/\/ return found node\n }\n return empty; \/\/ need to indicate \"not-found\"\n }\n\n void Node::mutate_self(const double & min, const double & max) {\n \/\/ single node mutation to different function of same arity\n if (arity == 0) {\n \/\/ mutate constant to a value in its neighborhood, don't switch functions\n if (function == constant) {\n\tnormal_dist dist{0, 1};\n\tk *= 1 + dist(rg.engine);\n }\n }\n else if (arity == 1) {\n int_dist dist{0, int(unaries.size()) - 1};\n Function prior = function;\n \/\/ ensure we're using a specified available function\n while (function == prior or not contains(function, internals))\n\tfunction = Function(unaries[dist(rg.engine)]);\n }\n else if (arity == 2) {\n int_dist dist{0, int(binaries.size()) - 1};\n Function prior = function;\n while (function == prior or not contains(function, internals))\n\tfunction = Function(binaries[dist(rg.engine)]);\n }\n else if (arity == 4) {\n int_dist dist{0, int(quadnaries.size()) - 1};\n Function prior = function;\n while (function == prior or not contains(function, internals))\n\tfunction = Function(quadnaries[dist(rg.engine)]);\n }\n assert(function != null);\n }\n\n void Node::mutate_tree(const double & chance, const double & min, const double & max) {\n \/\/ recursively mutate nodes with problem.mutate_chance probability\n real_dist dist{0, 1};\n for (Node & child : children) {\n child.mutate_tree(chance, min, max);\n if (dist(rg.engine) < chance) child.mutate_self();\n }\n }\n\n Individual::Individual(const Problem & problem): root{Node{problem}} {\n update_size();\n evaluate(problem.values);\n }\n\n string Individual::print_formula() const {\n using std::to_string;\n string formula = \"Expression tree of size \" + to_string(get_total())\n + \" with \" + to_string(get_internals()) + \" internals\"\n + \" and \" + to_string(get_leafs()) + \" leafs\"\n + \" has the following formula: \" + \"\\n\"\n + root.print() + \"\\n\";\n return formula;\n }\n\n string Individual::print_calculation(const problem::pairs & values) const {\n using std::to_string;\n using std::get;\n double fitness = 0;\n string calculation;\n for (auto pair : values) {\n double output = root.evaluate(get<0>(pair));\n double error = std::pow(output - get<1>(pair), 2);\n fitness += error;\n calculation += + \"f(\" + to_string(get<0>(pair))\n\t+ \") = \" + to_string(output)\n\t+ \", expected \" + to_string(get<1>(pair))\n\t+ \", error = \" + to_string(error) + \"\\n\";\n }\n calculation += \"Total fitness: \" + to_string(std::sqrt(fitness)) + \".\\n\";\n return calculation;\n }\n\n void Individual::update_size() {\n size = root.size();\n }\n\n void Individual::evaluate(const problem::pairs & values) {\n double error = 0;\n for (auto pair : values) {\n double output = root.evaluate(std::get<0>(pair));\n assert(not std::isnan(output) and not std::isinf(output));\n error += std::pow(output - std::get<1>(pair), 2);\n }\n fitness = error;\n \/\/ update size on evaluation because it's incredibly convenient\n update_size();\n }\n\n void Individual::mutate(const double & chance, const double & min, const double & max) {\n \/\/ mutate each node with a problem.mutate_chance probability\n root.mutate_tree(chance, min, max);\n }\n\n Node & Individual::operator[](const Size & i) {\n assert(i.internals <= get_internals());\n assert(i.leafs <= get_leafs());\n Size visiting;\n return root.visit(i, visiting);\n }\n\n void crossover(const double & chance, Individual & a, Individual & b) {\n real_dist probability{0, 1};\n Size target_a, target_b;\n if (probability(rg.engine) < chance) {\n \/\/ choose an internal node\n int_dist dist{0, a.get_internals() - 1};\n target_a.internals = dist(rg.engine);\n } else {\n \/\/ otherwise we choose a leaf node\n int_dist dist{0, a.get_leafs() - 1};\n target_a.leafs = dist(rg.engine);\n }\n \/\/ do the same thing for the second individual\n if (probability(rg.engine) < chance) {\n int_dist dist{0, b.get_internals() - 1};\n target_b.internals = dist(rg.engine);\n } else {\n int_dist dist{0, b.get_leafs() - 1};\n target_b.leafs = dist(rg.engine);\n }\n \/\/ replace nodes\n std::swap(a[target_a], b[target_b]);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#if _WIN32\n#pragma warning(disable : 4267 4996)\n#endif\n\n#include \".\/labelling_coordinator.h\"\n#include <QtOpenGLExtensions>\n#include <QLoggingCategory>\n#include <map>\n#include <vector>\n#include <memory>\n#include \".\/labelling\/clustering.h\"\n#include \".\/labelling\/labels.h\"\n#include \".\/placement\/occlusion_calculator.h\"\n#include \".\/placement\/constraint_updater.h\"\n#include \".\/placement\/persistent_constraint_updater.h\"\n#include \".\/placement\/cuda_texture_mapper.h\"\n#include \".\/placement\/integral_costs_calculator.h\"\n#include \".\/placement\/saliency.h\"\n#include \".\/placement\/labels_arranger.h\"\n#include \".\/placement\/insertion_order_labels_arranger.h\"\n#include \".\/placement\/randomized_labels_arranger.h\"\n#include \".\/placement\/apollonius_labels_arranger.h\"\n#include \".\/placement\/anchor_constraint_drawer.h\"\n#include \".\/placement\/shadow_constraint_drawer.h\"\n#include \".\/graphics\/buffer_drawer.h\"\n#include \".\/nodes.h\"\n#include \".\/math\/eigen.h\"\n#include \".\/label_node.h\"\n#include \".\/texture_mapper_manager.h\"\n#include \".\/utils\/profiler.h\"\n#include \".\/utils\/profiling_statistics.h\"\n#include \".\/graphics\/managers.h\"\n\nQLoggingCategory lcChan(\"LabellingCoordinator\");\n\nLabellingCoordinator::LabellingCoordinator(\n int layerCount, std::shared_ptr<Forces::Labeller> forcesLabeller,\n std::shared_ptr<Labels> labels, std::shared_ptr<Nodes> nodes)\n : layerCount(layerCount), forcesLabeller(forcesLabeller), labels(labels),\n nodes(nodes), clustering(labels, layerCount - 1),\n profilingStatistics(\"LabellingCoordinator\", lcChan)\n{\n occlusionCalculator =\n std::make_shared<Placement::OcclusionCalculator>(layerCount);\n}\n\nvoid LabellingCoordinator::initialize(\n Graphics::Gl *gl, int bufferSize,\n std::shared_ptr<Graphics::Managers> managers,\n std::shared_ptr<TextureMapperManager> textureMapperManager, int width,\n int height)\n{\n qCInfo(lcChan) << \"Initialize\";\n this->bufferSize = Eigen::Vector2f(bufferSize, bufferSize);\n saliency = std::make_shared<Placement::Saliency>(\n textureMapperManager->getAccumulatedLayersTextureMapper(),\n textureMapperManager->getSaliencyTextureMapper());\n\n occlusionCalculator->initialize(textureMapperManager);\n integralCostsCalculator =\n std::make_shared<Placement::IntegralCostsCalculator>(\n textureMapperManager->getOcclusionTextureMapper(),\n textureMapperManager->getSaliencyTextureMapper(),\n textureMapperManager->getIntegralCostsTextureMapper());\n\n auto shaderManager = managers->getShaderManager();\n auto anchorConstraintDrawer =\n std::make_shared<AnchorConstraintDrawer>(bufferSize, bufferSize);\n anchorConstraintDrawer->initialize(gl, shaderManager);\n\n auto connectorShadowDrawer =\n std::make_shared<ShadowConstraintDrawer>(bufferSize, bufferSize);\n connectorShadowDrawer->initialize(gl, shaderManager);\n\n auto shadowConstraintDrawer =\n std::make_shared<ShadowConstraintDrawer>(bufferSize, bufferSize);\n shadowConstraintDrawer->initialize(gl, shaderManager);\n\n float scaleFactor = bufferSize \/ width;\n auto constraintUpdater = std::make_shared<ConstraintUpdater>(\n bufferSize, bufferSize, anchorConstraintDrawer, connectorShadowDrawer,\n shadowConstraintDrawer, scaleFactor);\n persistentConstraintUpdater =\n std::make_shared<PersistentConstraintUpdater>(constraintUpdater);\n\n insertionOrderLabelsArranger =\n std::make_shared<Placement::InsertionOrderLabelsArranger>();\n randomizedLabelsArranger =\n std::make_shared<Placement::RandomizedLabelsArranger>();\n\n for (int layerIndex = 0; layerIndex < layerCount; ++layerIndex)\n {\n auto labelsContainer = std::make_shared<LabelsContainer>();\n labelsInLayer.push_back(labelsContainer);\n auto labeller = std::make_shared<Placement::Labeller>(labelsContainer);\n labeller->resize(width, height);\n labeller->initialize(textureMapperManager->getIntegralCostsTextureMapper(),\n textureMapperManager->getConstraintTextureMapper(),\n persistentConstraintUpdater);\n\n auto apolloniusLabelsArranger =\n std::make_shared<Placement::ApolloniusLabelsArranger>();\n apolloniusLabelsArranger->initialize(\n textureMapperManager->getDistanceTransformTextureMapper(layerIndex),\n textureMapperManager->getOcclusionTextureMapper(),\n textureMapperManager->getApolloniusTextureMapper(layerIndex));\n apolloniusLabelsArrangers.push_back(apolloniusLabelsArranger);\n\n labeller->setLabelsArranger(useApollonius ? apolloniusLabelsArranger\n : insertionOrderLabelsArranger);\n\n placementLabellers.push_back(labeller);\n }\n}\n\nvoid LabellingCoordinator::cleanup()\n{\n occlusionCalculator.reset();\n saliency.reset();\n integralCostsCalculator.reset();\n\n for (auto apolloniusLabelsArranger : apolloniusLabelsArrangers)\n apolloniusLabelsArranger->cleanup();\n\n for (auto placementLabeller : placementLabellers)\n placementLabeller->cleanup();\n}\n\nvoid LabellingCoordinator::setEnabled(bool enabled)\n{\n labellingEnabled = enabled;\n for (auto &labelNode : nodes->getLabelNodes())\n {\n labelNode->setIsVisible(!enabled);\n }\n}\n\nbool LabellingCoordinator::update(double frameTime, bool isIdle,\n Eigen::Matrix4f projection,\n Eigen::Matrix4f view, int activeLayerNumber)\n{\n Profiler profiler(\"update\", lcChan, &profilingStatistics);\n\n\n if (!labellingEnabled)\n return false;\n\n this->isIdle = isIdle;\n labellerFrameData = LabellerFrameData(frameTime, projection, view);\n\n if (internalLabellingEnabled)\n {\n LabelPositions labelPositions;\n for (auto label : labels->getLabels())\n {\n auto ndc = labellerFrameData.project(label.anchorPosition);\n labelPositions.update(label.id, ndc, label.anchorPosition);\n }\n\n updateLabelPositionsInLabelNodes(labelPositions);\n return false;\n }\n\n saliency->runKernel();\n\n auto positionsNDC2d = getPlacementPositions(activeLayerNumber);\n auto positionsNDC = addDepthValueNDC(positionsNDC2d);\n LabelPositions labelPositions(positionsNDC, ndcPositionsTo3d(positionsNDC));\n\n if (forcesEnabled)\n labelPositions = getForcesPositions(labelPositions);\n\n distributeLabelsToLayers();\n\n updateLabelPositionsInLabelNodes(labelPositions);\n\n return hasChanges;\n}\n\nvoid LabellingCoordinator::updatePlacement()\n{\n Profiler profiler(\"updatePlacement\", lcChan, &profilingStatistics);\n\n if (!labellingEnabled)\n return;\n\n bool optimize = isIdle && optimizeOnIdle;\n bool ignoreOldPosition = !isIdle;\n\n float newSumOfCosts = 0.0f;\n persistentConstraintUpdater->clear();\n if (saveConstraintsInNextFrame)\n {\n persistentConstraintUpdater->save();\n saveConstraintsInNextFrame = false;\n }\n\n std::vector<Eigen::Vector2f> anchorPositions(labels->count());\n auto labelVector = labels->getLabels();\n for (int index = 0; index < labels->count(); index++)\n {\n auto anchor2D =\n labellerFrameData.project(labelVector[index].anchorPosition);\n anchorPositions[index] = toPixel(anchor2D.head<2>(), bufferSize);\n }\n\n persistentConstraintUpdater->setAnchorPositions(anchorPositions);\n\n for (int layerIndex = 0; layerIndex < layerCount; ++layerIndex)\n {\n occlusionCalculator->calculateFor(layerIndex);\n integralCostsCalculator->runKernel();\n\n auto labeller = placementLabellers[layerIndex];\n auto defaultArranger = useApollonius ? apolloniusLabelsArrangers[layerIndex]\n : insertionOrderLabelsArranger;\n labeller->setLabelsArranger(optimize ? randomizedLabelsArranger\n : defaultArranger);\n labeller->update(labellerFrameData, ignoreOldPosition);\n newSumOfCosts += labeller->getLastSumOfCosts();\n }\n\n if (optimize)\n {\n std::cout << \"Old costs: \" << sumOfCosts << \"\\tnew costs:\" << newSumOfCosts\n << std::endl;\n }\n\n if (optimize && newSumOfCosts > sumOfCosts)\n {\n preserveLastResult = true;\n }\n else\n {\n preserveLastResult = false;\n sumOfCosts = newSumOfCosts;\n }\n}\n\nstd::vector<float> LabellingCoordinator::updateClusters()\n{\n if (!labellingEnabled)\n return std::vector<float>{ 1.0f };\n\n clustering.update(labellerFrameData.viewProjection);\n return clustering.getMedianClusterMembers();\n}\n\nbool LabellingCoordinator::haveLabelPositionsChanged()\n{\n return labellingEnabled && hasChanges;\n}\n\nvoid LabellingCoordinator::resize(int width, int height)\n{\n for (auto placementLabeller : placementLabellers)\n placementLabeller->resize(width, height);\n\n forcesLabeller->resize(width, height);\n}\n\nvoid LabellingCoordinator::toggleAnchorVisibility()\n{\n for (auto node : nodes->getLabelNodes())\n node->isAnchorVisible = !node->isAnchorVisible;\n}\n\nvoid LabellingCoordinator::saveOcclusion()\n{\n occlusionCalculator->saveOcclusion();\n}\n\nvoid LabellingCoordinator::saveConstraints()\n{\n saveConstraintsInNextFrame = true;\n}\n\nvoid LabellingCoordinator::setCostFunctionWeights(\n Placement::CostFunctionWeights weights)\n{\n for (auto placementLabeller : placementLabellers)\n placementLabeller->setCostFunctionWeights(weights);\n}\n\nstd::map<int, Eigen::Vector2f>\nLabellingCoordinator::getPlacementPositions(int activeLayerNumber)\n{\n if (preserveLastResult)\n return lastPlacementResult;\n\n std::map<int, Eigen::Vector2f> placementPositions;\n int layerIndex = 0;\n for (auto placementLabeller : placementLabellers)\n {\n if (activeLayerNumber == 0 || activeLayerNumber - 1 == layerIndex)\n {\n auto newPositionsForLayer = placementLabeller->getLastPlacementResult();\n placementPositions.insert(newPositionsForLayer.begin(),\n newPositionsForLayer.end());\n }\n\n layerIndex++;\n }\n\n lastPlacementResult = placementPositions;\n\n return placementPositions;\n}\n\nLabelPositions\nLabellingCoordinator::getForcesPositions(LabelPositions placementPositions)\n{\n if (placementPositions.size() == 0)\n return LabelPositions();\n\n if (firstFramesWithoutPlacement && placementPositions.size())\n {\n firstFramesWithoutPlacement = false;\n forcesLabeller->overallForceFactor = isIdle ? 6.0f : 3.0f;\n forcesLabeller->setPositions(labellerFrameData, placementPositions);\n }\n\n return forcesLabeller->update(labellerFrameData, placementPositions);\n}\n\nvoid LabellingCoordinator::distributeLabelsToLayers()\n{\n auto centerWithLabelIds = clustering.getMedianClusterMembersWithLabelIds();\n labelIdToLayerIndex.clear();\n labelIdToZValue.clear();\n\n for (auto& layerLabels : labelsInLayer)\n layerLabels->clear();\n\n int layerIndex = 0;\n for (auto &pair : centerWithLabelIds)\n {\n auto &container = labelsInLayer[layerIndex];\n\n for (int labelId : pair.second)\n {\n container->add(labels->getById(labelId));\n labelIdToLayerIndex[labelId] = layerIndex;\n labelIdToZValue[labelId] = pair.first;\n }\n\n layerIndex++;\n }\n\n if (lcChan.isDebugEnabled())\n {\n std::stringstream output;\n int layerIndex = 0;\n for (auto layerLabels : labelsInLayer)\n {\n output << std::endl << \"Layer \" << layerIndex++ << \"\\t\";\n for (auto &label : layerLabels->getLabels())\n output << \"\\\"\" << label.text << \"\\\" (\" << label.id << \"), \";\n }\n qCDebug(lcChan) << \"distributeLabelsToLayers: \" << output.str().c_str();\n }\n}\n\nvoid LabellingCoordinator::updateLabelPositionsInLabelNodes(\n LabelPositions labelPositions)\n{\n hasChanges = false;\n for (auto &labelNode : nodes->getLabelNodes())\n {\n int labelId = labelNode->label.id;\n if (labelPositions.count(labelId))\n {\n auto newPosition = labelPositions.get3dFor(labelId);\n if (!hasChanges && (labelNode->labelPosition - newPosition).norm() > 1e-7)\n {\n hasChanges = true;\n }\n\n labelNode->setIsVisible(true);\n labelNode->labelPosition = labelPositions.get3dFor(labelId);\n labelNode->labelPositionNDC = labelPositions.getNDCFor(labelId);\n labelNode->layerIndex = labelIdToLayerIndex[labelId];\n }\n else\n {\n labelNode->setIsVisible(false);\n }\n }\n}\n\nstd::map<int, Eigen::Vector3f> LabellingCoordinator::addDepthValueNDC(\n std::map<int, Eigen::Vector2f> positionsNDC)\n{\n std::map<int, Eigen::Vector3f> positions;\n for (auto positionNDCPair : positionsNDC)\n {\n int labelId = positionNDCPair.first;\n auto position2d = positionNDCPair.second;\n positions[labelId] = Eigen::Vector3f(position2d.x(), position2d.y(),\n labelIdToZValue[labelId]);\n }\n\n return positions;\n}\n\nstd::map<int, Eigen::Vector3f> LabellingCoordinator::ndcPositionsTo3d(\n std::map<int, Eigen::Vector3f> positionsNDC)\n{\n Eigen::Matrix4f inverseViewProjection =\n labellerFrameData.viewProjection.inverse();\n\n std::map<int, Eigen::Vector3f> positions;\n for (auto positionNDCPair : positionsNDC)\n {\n int labelId = positionNDCPair.first;\n positions[labelId] = project(inverseViewProjection, positionNDCPair.second);\n }\n\n return positions;\n}\n\n<commit_msg>Ensure that all labels are in the first layer for internal labelling mode.<commit_after>#if _WIN32\n#pragma warning(disable : 4267 4996)\n#endif\n\n#include \".\/labelling_coordinator.h\"\n#include <QtOpenGLExtensions>\n#include <QLoggingCategory>\n#include <map>\n#include <vector>\n#include <memory>\n#include \".\/labelling\/clustering.h\"\n#include \".\/labelling\/labels.h\"\n#include \".\/placement\/occlusion_calculator.h\"\n#include \".\/placement\/constraint_updater.h\"\n#include \".\/placement\/persistent_constraint_updater.h\"\n#include \".\/placement\/cuda_texture_mapper.h\"\n#include \".\/placement\/integral_costs_calculator.h\"\n#include \".\/placement\/saliency.h\"\n#include \".\/placement\/labels_arranger.h\"\n#include \".\/placement\/insertion_order_labels_arranger.h\"\n#include \".\/placement\/randomized_labels_arranger.h\"\n#include \".\/placement\/apollonius_labels_arranger.h\"\n#include \".\/placement\/anchor_constraint_drawer.h\"\n#include \".\/placement\/shadow_constraint_drawer.h\"\n#include \".\/graphics\/buffer_drawer.h\"\n#include \".\/nodes.h\"\n#include \".\/math\/eigen.h\"\n#include \".\/label_node.h\"\n#include \".\/texture_mapper_manager.h\"\n#include \".\/utils\/profiler.h\"\n#include \".\/utils\/profiling_statistics.h\"\n#include \".\/graphics\/managers.h\"\n\nQLoggingCategory lcChan(\"LabellingCoordinator\");\n\nLabellingCoordinator::LabellingCoordinator(\n int layerCount, std::shared_ptr<Forces::Labeller> forcesLabeller,\n std::shared_ptr<Labels> labels, std::shared_ptr<Nodes> nodes)\n : layerCount(layerCount), forcesLabeller(forcesLabeller), labels(labels),\n nodes(nodes), clustering(labels, layerCount - 1),\n profilingStatistics(\"LabellingCoordinator\", lcChan)\n{\n occlusionCalculator =\n std::make_shared<Placement::OcclusionCalculator>(layerCount);\n}\n\nvoid LabellingCoordinator::initialize(\n Graphics::Gl *gl, int bufferSize,\n std::shared_ptr<Graphics::Managers> managers,\n std::shared_ptr<TextureMapperManager> textureMapperManager, int width,\n int height)\n{\n qCInfo(lcChan) << \"Initialize\";\n this->bufferSize = Eigen::Vector2f(bufferSize, bufferSize);\n saliency = std::make_shared<Placement::Saliency>(\n textureMapperManager->getAccumulatedLayersTextureMapper(),\n textureMapperManager->getSaliencyTextureMapper());\n\n occlusionCalculator->initialize(textureMapperManager);\n integralCostsCalculator =\n std::make_shared<Placement::IntegralCostsCalculator>(\n textureMapperManager->getOcclusionTextureMapper(),\n textureMapperManager->getSaliencyTextureMapper(),\n textureMapperManager->getIntegralCostsTextureMapper());\n\n auto shaderManager = managers->getShaderManager();\n auto anchorConstraintDrawer =\n std::make_shared<AnchorConstraintDrawer>(bufferSize, bufferSize);\n anchorConstraintDrawer->initialize(gl, shaderManager);\n\n auto connectorShadowDrawer =\n std::make_shared<ShadowConstraintDrawer>(bufferSize, bufferSize);\n connectorShadowDrawer->initialize(gl, shaderManager);\n\n auto shadowConstraintDrawer =\n std::make_shared<ShadowConstraintDrawer>(bufferSize, bufferSize);\n shadowConstraintDrawer->initialize(gl, shaderManager);\n\n float scaleFactor = bufferSize \/ width;\n auto constraintUpdater = std::make_shared<ConstraintUpdater>(\n bufferSize, bufferSize, anchorConstraintDrawer, connectorShadowDrawer,\n shadowConstraintDrawer, scaleFactor);\n persistentConstraintUpdater =\n std::make_shared<PersistentConstraintUpdater>(constraintUpdater);\n\n insertionOrderLabelsArranger =\n std::make_shared<Placement::InsertionOrderLabelsArranger>();\n randomizedLabelsArranger =\n std::make_shared<Placement::RandomizedLabelsArranger>();\n\n for (int layerIndex = 0; layerIndex < layerCount; ++layerIndex)\n {\n auto labelsContainer = std::make_shared<LabelsContainer>();\n labelsInLayer.push_back(labelsContainer);\n auto labeller = std::make_shared<Placement::Labeller>(labelsContainer);\n labeller->resize(width, height);\n labeller->initialize(textureMapperManager->getIntegralCostsTextureMapper(),\n textureMapperManager->getConstraintTextureMapper(),\n persistentConstraintUpdater);\n\n auto apolloniusLabelsArranger =\n std::make_shared<Placement::ApolloniusLabelsArranger>();\n apolloniusLabelsArranger->initialize(\n textureMapperManager->getDistanceTransformTextureMapper(layerIndex),\n textureMapperManager->getOcclusionTextureMapper(),\n textureMapperManager->getApolloniusTextureMapper(layerIndex));\n apolloniusLabelsArrangers.push_back(apolloniusLabelsArranger);\n\n labeller->setLabelsArranger(useApollonius ? apolloniusLabelsArranger\n : insertionOrderLabelsArranger);\n\n placementLabellers.push_back(labeller);\n }\n}\n\nvoid LabellingCoordinator::cleanup()\n{\n occlusionCalculator.reset();\n saliency.reset();\n integralCostsCalculator.reset();\n\n for (auto apolloniusLabelsArranger : apolloniusLabelsArrangers)\n apolloniusLabelsArranger->cleanup();\n\n for (auto placementLabeller : placementLabellers)\n placementLabeller->cleanup();\n}\n\nvoid LabellingCoordinator::setEnabled(bool enabled)\n{\n labellingEnabled = enabled;\n for (auto &labelNode : nodes->getLabelNodes())\n {\n labelNode->setIsVisible(!enabled);\n }\n}\n\nbool LabellingCoordinator::update(double frameTime, bool isIdle,\n Eigen::Matrix4f projection,\n Eigen::Matrix4f view, int activeLayerNumber)\n{\n Profiler profiler(\"update\", lcChan, &profilingStatistics);\n\n\n if (!labellingEnabled)\n return false;\n\n this->isIdle = isIdle;\n labellerFrameData = LabellerFrameData(frameTime, projection, view);\n\n if (internalLabellingEnabled)\n {\n for (int layerIndex = 0; layerIndex < layerCount; layerIndex++)\n labelsInLayer[layerIndex]->clear();\n\n LabelPositions labelPositions;\n auto container = labelsInLayer[0];\n for (auto label : labels->getLabels())\n {\n auto ndc = labellerFrameData.project(label.anchorPosition);\n labelPositions.update(label.id, ndc, label.anchorPosition);\n\n container->add(label);\n labelIdToLayerIndex[label.id] = 0;\n labelIdToZValue[label.id] = 1.0f;\n }\n\n updateLabelPositionsInLabelNodes(labelPositions);\n return false;\n }\n\n saliency->runKernel();\n\n auto positionsNDC2d = getPlacementPositions(activeLayerNumber);\n auto positionsNDC = addDepthValueNDC(positionsNDC2d);\n LabelPositions labelPositions(positionsNDC, ndcPositionsTo3d(positionsNDC));\n\n if (forcesEnabled)\n labelPositions = getForcesPositions(labelPositions);\n\n distributeLabelsToLayers();\n\n updateLabelPositionsInLabelNodes(labelPositions);\n\n return hasChanges;\n}\n\nvoid LabellingCoordinator::updatePlacement()\n{\n Profiler profiler(\"updatePlacement\", lcChan, &profilingStatistics);\n\n if (!labellingEnabled)\n return;\n\n bool optimize = isIdle && optimizeOnIdle;\n bool ignoreOldPosition = !isIdle;\n\n float newSumOfCosts = 0.0f;\n persistentConstraintUpdater->clear();\n if (saveConstraintsInNextFrame)\n {\n persistentConstraintUpdater->save();\n saveConstraintsInNextFrame = false;\n }\n\n std::vector<Eigen::Vector2f> anchorPositions(labels->count());\n auto labelVector = labels->getLabels();\n for (int index = 0; index < labels->count(); index++)\n {\n auto anchor2D =\n labellerFrameData.project(labelVector[index].anchorPosition);\n anchorPositions[index] = toPixel(anchor2D.head<2>(), bufferSize);\n }\n\n persistentConstraintUpdater->setAnchorPositions(anchorPositions);\n\n for (int layerIndex = 0; layerIndex < layerCount; ++layerIndex)\n {\n occlusionCalculator->calculateFor(layerIndex);\n integralCostsCalculator->runKernel();\n\n auto labeller = placementLabellers[layerIndex];\n auto defaultArranger = useApollonius ? apolloniusLabelsArrangers[layerIndex]\n : insertionOrderLabelsArranger;\n labeller->setLabelsArranger(optimize ? randomizedLabelsArranger\n : defaultArranger);\n labeller->update(labellerFrameData, ignoreOldPosition);\n newSumOfCosts += labeller->getLastSumOfCosts();\n }\n\n if (optimize)\n {\n std::cout << \"Old costs: \" << sumOfCosts << \"\\tnew costs:\" << newSumOfCosts\n << std::endl;\n }\n\n if (optimize && newSumOfCosts > sumOfCosts)\n {\n preserveLastResult = true;\n }\n else\n {\n preserveLastResult = false;\n sumOfCosts = newSumOfCosts;\n }\n}\n\nstd::vector<float> LabellingCoordinator::updateClusters()\n{\n if (!labellingEnabled || internalLabellingEnabled)\n return std::vector<float>{ 1.0f };\n\n clustering.update(labellerFrameData.viewProjection);\n return clustering.getMedianClusterMembers();\n}\n\nbool LabellingCoordinator::haveLabelPositionsChanged()\n{\n return labellingEnabled && hasChanges;\n}\n\nvoid LabellingCoordinator::resize(int width, int height)\n{\n for (auto placementLabeller : placementLabellers)\n placementLabeller->resize(width, height);\n\n forcesLabeller->resize(width, height);\n}\n\nvoid LabellingCoordinator::toggleAnchorVisibility()\n{\n for (auto node : nodes->getLabelNodes())\n node->isAnchorVisible = !node->isAnchorVisible;\n}\n\nvoid LabellingCoordinator::saveOcclusion()\n{\n occlusionCalculator->saveOcclusion();\n}\n\nvoid LabellingCoordinator::saveConstraints()\n{\n saveConstraintsInNextFrame = true;\n}\n\nvoid LabellingCoordinator::setCostFunctionWeights(\n Placement::CostFunctionWeights weights)\n{\n for (auto placementLabeller : placementLabellers)\n placementLabeller->setCostFunctionWeights(weights);\n}\n\nstd::map<int, Eigen::Vector2f>\nLabellingCoordinator::getPlacementPositions(int activeLayerNumber)\n{\n if (preserveLastResult)\n return lastPlacementResult;\n\n std::map<int, Eigen::Vector2f> placementPositions;\n int layerIndex = 0;\n for (auto placementLabeller : placementLabellers)\n {\n if (activeLayerNumber == 0 || activeLayerNumber - 1 == layerIndex)\n {\n auto newPositionsForLayer = placementLabeller->getLastPlacementResult();\n placementPositions.insert(newPositionsForLayer.begin(),\n newPositionsForLayer.end());\n }\n\n layerIndex++;\n }\n\n lastPlacementResult = placementPositions;\n\n return placementPositions;\n}\n\nLabelPositions\nLabellingCoordinator::getForcesPositions(LabelPositions placementPositions)\n{\n if (placementPositions.size() == 0)\n return LabelPositions();\n\n if (firstFramesWithoutPlacement && placementPositions.size())\n {\n firstFramesWithoutPlacement = false;\n forcesLabeller->overallForceFactor = isIdle ? 6.0f : 3.0f;\n forcesLabeller->setPositions(labellerFrameData, placementPositions);\n }\n\n return forcesLabeller->update(labellerFrameData, placementPositions);\n}\n\nvoid LabellingCoordinator::distributeLabelsToLayers()\n{\n auto centerWithLabelIds = clustering.getMedianClusterMembersWithLabelIds();\n labelIdToLayerIndex.clear();\n labelIdToZValue.clear();\n\n for (auto& layerLabels : labelsInLayer)\n layerLabels->clear();\n\n int layerIndex = 0;\n for (auto &pair : centerWithLabelIds)\n {\n auto &container = labelsInLayer[layerIndex];\n\n for (int labelId : pair.second)\n {\n container->add(labels->getById(labelId));\n labelIdToLayerIndex[labelId] = layerIndex;\n labelIdToZValue[labelId] = pair.first;\n }\n\n layerIndex++;\n }\n\n if (lcChan.isDebugEnabled())\n {\n std::stringstream output;\n int layerIndex = 0;\n for (auto layerLabels : labelsInLayer)\n {\n output << std::endl << \"Layer \" << layerIndex++ << \"\\t\";\n for (auto &label : layerLabels->getLabels())\n output << \"\\\"\" << label.text << \"\\\" (\" << label.id << \"), \";\n }\n qCDebug(lcChan) << \"distributeLabelsToLayers: \" << output.str().c_str();\n }\n}\n\nvoid LabellingCoordinator::updateLabelPositionsInLabelNodes(\n LabelPositions labelPositions)\n{\n hasChanges = false;\n for (auto &labelNode : nodes->getLabelNodes())\n {\n int labelId = labelNode->label.id;\n if (labelPositions.count(labelId))\n {\n auto newPosition = labelPositions.get3dFor(labelId);\n if (!hasChanges && (labelNode->labelPosition - newPosition).norm() > 1e-7)\n {\n hasChanges = true;\n }\n\n labelNode->setIsVisible(true);\n labelNode->labelPosition = labelPositions.get3dFor(labelId);\n labelNode->labelPositionNDC = labelPositions.getNDCFor(labelId);\n labelNode->layerIndex = labelIdToLayerIndex[labelId];\n }\n else\n {\n labelNode->setIsVisible(false);\n }\n }\n}\n\nstd::map<int, Eigen::Vector3f> LabellingCoordinator::addDepthValueNDC(\n std::map<int, Eigen::Vector2f> positionsNDC)\n{\n std::map<int, Eigen::Vector3f> positions;\n for (auto positionNDCPair : positionsNDC)\n {\n int labelId = positionNDCPair.first;\n auto position2d = positionNDCPair.second;\n positions[labelId] = Eigen::Vector3f(position2d.x(), position2d.y(),\n labelIdToZValue[labelId]);\n }\n\n return positions;\n}\n\nstd::map<int, Eigen::Vector3f> LabellingCoordinator::ndcPositionsTo3d(\n std::map<int, Eigen::Vector3f> positionsNDC)\n{\n Eigen::Matrix4f inverseViewProjection =\n labellerFrameData.viewProjection.inverse();\n\n std::map<int, Eigen::Vector3f> positions;\n for (auto positionNDCPair : positionsNDC)\n {\n int labelId = positionNDCPair.first;\n positions[labelId] = project(inverseViewProjection, positionNDCPair.second);\n }\n\n return positions;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"model_ops.h\"\n#include <set>\n#include <deque>\n#include <vector>\n\nvoid makeVerticallySymmetric(std::shared_ptr<figures::Curve> curve) {\n for (Point &p : curve->points) {\n std::swap(p.x, p.y);\n }\n makeHorizontallySymmetric(curve);\n for (Point &p : curve->points) {\n std::swap(p.x, p.y);\n }\n}\n\nbool getVerticalIntersection(Point a, Point b, double x, Point &result) {\n if (fabs(b.x - a.x) < 1e-8) {\n return false;\n }\n result = Point(x, a.y + (b.y - a.y) * (x - a.x) \/ (b.x - a.x));\n return true;\n}\n\nvoid makeHorizontallySymmetric(std::shared_ptr<figures::Curve> curve) {\n BoundingBox box = curve->getBoundingBox();\n auto &points = curve->points;\n double midX = box.center().x;\n if (points.at(0).x > midX) {\n for (Point &p : points) {\n p.x = -p.x;\n }\n makeHorizontallySymmetric(curve);\n for (Point &p : points) {\n p.x = -p.x;\n }\n return;\n }\n size_t cnt = 0;\n while (cnt < points.size() && points[cnt].x <= midX) {\n cnt++;\n }\n assert(cnt >= 1);\n assert(cnt < points.size());\n\n Point midPoint;\n bool hasMidPoint = getVerticalIntersection(points.at(cnt - 1), points.at(cnt), midX, midPoint);\n points.erase(points.begin() + cnt, points.end());\n bool midArrowBegin = curve->arrowBegin.at(cnt - 1);\n bool midArrowEnd = curve->arrowEnd.at(cnt - 1);\n\n curve->arrowBegin.erase(curve->arrowBegin.begin() + cnt - 1, curve->arrowBegin.end());\n curve->arrowEnd.erase(curve->arrowEnd.begin() + cnt - 1, curve->arrowEnd.end());\n\n curve->arrowBegin.push_back(midArrowBegin);\n if (hasMidPoint) {\n curve->arrowEnd.push_back(midArrowEnd);\n points.push_back(midPoint);\n curve->arrowBegin.push_back(midArrowEnd);\n }\n curve->arrowEnd.push_back(midArrowBegin);\n for (int i = cnt - 1; i >= 0; i--) {\n points.push_back(Point(2 * midX - points[i].x, points[i].y));\n if (i > 0) {\n curve->arrowBegin.push_back(curve->arrowEnd[i - 1]);\n curve->arrowEnd.push_back(curve->arrowBegin[i - 1]);\n }\n }\n curve->selfCheck();\n}\n\nvoid makeTopBottomTree(Model &model, figures::PBoundedFigure root) {\n typedef figures::PBoundedFigure Node;\n std::map<Node, std::vector<Node>> edges;\n \/\/ building graph\n for (PFigure figure : model) {\n auto connection = std::dynamic_pointer_cast<figures::SegmentConnection>(figure);\n if (connection) {\n bool dirAB = connection->getArrowedB();\n bool dirBA = connection->getArrowedA();\n if (!dirAB && !dirBA) {\n dirAB = dirBA = true;\n }\n if (dirAB) {\n edges[connection->getFigureA()].push_back(connection->getFigureB());\n }\n if (dirBA) {\n edges[connection->getFigureB()].push_back(connection->getFigureA());\n }\n }\n }\n\n const double NODES_GAP_K = 0.5; \/\/ 0.5 of node's height\n\n std::map<Node, std::vector<Node>> children;\n std::vector<Node> order;\n\n \/\/ breadth-first-search, building tree itself\n {\n std::set<Node> visited;\n std::deque<Node> q;\n\n q.push_back(root);\n visited.insert(root);\n while (!q.empty()) {\n Node v = q.front();\n q.pop_front();\n order.push_back(v);\n for (Node child : edges[v]) {\n if (visited.count(child)) { continue; }\n visited.insert(child);\n children[v].push_back(child);\n q.push_back(child);\n }\n }\n }\n\n std::map<Node, BoundingBox> boxes;\n \/\/ traversing nodes from the bottom to the top\n for (int i = order.size() - 1; i >= 0; i--) {\n Node v = order[i];\n BoundingBox &box = boxes[v] = v->getBoundingBox();\n const double NODES_GAP = box.height() * NODES_GAP_K;\n\n if (!children[v].empty()) {\n double sumChildrenWidth = 0;\n double maxChildHeight = 0;\n for (Node child : children[v]) {\n sumChildrenWidth += boxes[child].width();\n maxChildHeight = std::max(maxChildHeight, boxes[child].height());\n }\n if (children[v].size() >= 2) {\n sumChildrenWidth += (children[v].size() - 1) * NODES_GAP;\n }\n box.rightDown.x = std::max(box.rightDown.x, box.leftUp.x + sumChildrenWidth);\n box.rightDown.y += NODES_GAP + maxChildHeight;\n }\n }\n\n \/\/ returns offset by which node should be translated to be 'root node' with corresponding sumBox\n const auto getNodeOffset = [](const BoundingBox &vBox, const BoundingBox &sumBox) {\n Point offset;\n offset.x = sumBox.center().x - vBox.center().x;\n offset.y = sumBox.leftUp.y - vBox.leftUp.y;\n return offset;\n };\n\n \/\/ traversing tree from the top to the bottom and arranging nodes\n \/\/ invariant: when visiting node X, its bounding box is correct\n\n { \/\/ first, we need to keep the root in its original place\n Node v = order[0];\n BoundingBox vBox = v->getBoundingBox();\n BoundingBox &sumBox = boxes[v];\n sumBox.translate(Point() - getNodeOffset(vBox, sumBox));\n }\n for (size_t i = 0; i < order.size(); i++) {\n Node v = order[i];\n BoundingBox vBox = v->getBoundingBox();\n const double NODES_GAP = vBox.height() * NODES_GAP_K;\n\n BoundingBox sumBox = boxes[v];\n v->translate(getNodeOffset(vBox, sumBox));\n Point currentCorner = sumBox.leftUp;\n currentCorner.y += vBox.height() + NODES_GAP;\n for (Node child : children[v]) {\n BoundingBox &childBox = boxes[child];\n childBox.translate(currentCorner - childBox.leftUp);\n currentCorner.x += childBox.width() + NODES_GAP;\n }\n }\n model.recalculate();\n}\n<commit_msg>model_ops: makeSymmetric now processes curve->isStop correctly<commit_after>#include \"model_ops.h\"\n#include <set>\n#include <deque>\n#include <vector>\n\nvoid makeVerticallySymmetric(std::shared_ptr<figures::Curve> curve) {\n for (Point &p : curve->points) {\n std::swap(p.x, p.y);\n }\n makeHorizontallySymmetric(curve);\n for (Point &p : curve->points) {\n std::swap(p.x, p.y);\n }\n}\n\nbool getVerticalIntersection(Point a, Point b, double x, Point &result) {\n if (fabs(b.x - a.x) < 1e-8) {\n return false;\n }\n result = Point(x, a.y + (b.y - a.y) * (x - a.x) \/ (b.x - a.x));\n return true;\n}\n\nvoid makeHorizontallySymmetric(std::shared_ptr<figures::Curve> curve) {\n BoundingBox box = curve->getBoundingBox();\n auto &points = curve->points;\n double midX = box.center().x;\n if (points.at(0).x > midX) {\n for (Point &p : points) {\n p.x = -p.x;\n }\n makeHorizontallySymmetric(curve);\n for (Point &p : points) {\n p.x = -p.x;\n }\n return;\n }\n size_t cnt = 0;\n while (cnt < points.size() && points[cnt].x <= midX) {\n cnt++;\n }\n assert(cnt >= 1);\n assert(cnt < points.size());\n\n Point midPoint;\n bool hasMidPoint = getVerticalIntersection(points.at(cnt - 1), points.at(cnt), midX, midPoint);\n points.erase(points.begin() + cnt, points.end());\n curve->isStop.erase(curve->isStop.begin() + cnt, curve->isStop.end());\n\n bool midArrowBegin = curve->arrowBegin.at(cnt - 1);\n bool midArrowEnd = curve->arrowEnd.at(cnt - 1);\n\n curve->arrowBegin.erase(curve->arrowBegin.begin() + cnt - 1, curve->arrowBegin.end());\n curve->arrowEnd.erase(curve->arrowEnd.begin() + cnt - 1, curve->arrowEnd.end());\n\n curve->arrowBegin.push_back(midArrowBegin);\n if (hasMidPoint) {\n curve->arrowEnd.push_back(midArrowEnd);\n points.push_back(midPoint);\n curve->isStop.push_back(false);\n curve->arrowBegin.push_back(midArrowEnd);\n }\n curve->arrowEnd.push_back(midArrowBegin);\n for (int i = cnt - 1; i >= 0; i--) {\n points.push_back(Point(2 * midX - points[i].x, points[i].y));\n curve->isStop.push_back(curve->isStop[i]);\n if (i > 0) {\n curve->arrowBegin.push_back(curve->arrowEnd[i - 1]);\n curve->arrowEnd.push_back(curve->arrowBegin[i - 1]);\n }\n }\n curve->selfCheck();\n}\n\nvoid makeTopBottomTree(Model &model, figures::PBoundedFigure root) {\n typedef figures::PBoundedFigure Node;\n std::map<Node, std::vector<Node>> edges;\n \/\/ building graph\n for (PFigure figure : model) {\n auto connection = std::dynamic_pointer_cast<figures::SegmentConnection>(figure);\n if (connection) {\n bool dirAB = connection->getArrowedB();\n bool dirBA = connection->getArrowedA();\n if (!dirAB && !dirBA) {\n dirAB = dirBA = true;\n }\n if (dirAB) {\n edges[connection->getFigureA()].push_back(connection->getFigureB());\n }\n if (dirBA) {\n edges[connection->getFigureB()].push_back(connection->getFigureA());\n }\n }\n }\n\n const double NODES_GAP_K = 0.5; \/\/ 0.5 of node's height\n\n std::map<Node, std::vector<Node>> children;\n std::vector<Node> order;\n\n \/\/ breadth-first-search, building tree itself\n {\n std::set<Node> visited;\n std::deque<Node> q;\n\n q.push_back(root);\n visited.insert(root);\n while (!q.empty()) {\n Node v = q.front();\n q.pop_front();\n order.push_back(v);\n for (Node child : edges[v]) {\n if (visited.count(child)) { continue; }\n visited.insert(child);\n children[v].push_back(child);\n q.push_back(child);\n }\n }\n }\n\n std::map<Node, BoundingBox> boxes;\n \/\/ traversing nodes from the bottom to the top\n for (int i = order.size() - 1; i >= 0; i--) {\n Node v = order[i];\n BoundingBox &box = boxes[v] = v->getBoundingBox();\n const double NODES_GAP = box.height() * NODES_GAP_K;\n\n if (!children[v].empty()) {\n double sumChildrenWidth = 0;\n double maxChildHeight = 0;\n for (Node child : children[v]) {\n sumChildrenWidth += boxes[child].width();\n maxChildHeight = std::max(maxChildHeight, boxes[child].height());\n }\n if (children[v].size() >= 2) {\n sumChildrenWidth += (children[v].size() - 1) * NODES_GAP;\n }\n box.rightDown.x = std::max(box.rightDown.x, box.leftUp.x + sumChildrenWidth);\n box.rightDown.y += NODES_GAP + maxChildHeight;\n }\n }\n\n \/\/ returns offset by which node should be translated to be 'root node' with corresponding sumBox\n const auto getNodeOffset = [](const BoundingBox &vBox, const BoundingBox &sumBox) {\n Point offset;\n offset.x = sumBox.center().x - vBox.center().x;\n offset.y = sumBox.leftUp.y - vBox.leftUp.y;\n return offset;\n };\n\n \/\/ traversing tree from the top to the bottom and arranging nodes\n \/\/ invariant: when visiting node X, its bounding box is correct\n\n { \/\/ first, we need to keep the root in its original place\n Node v = order[0];\n BoundingBox vBox = v->getBoundingBox();\n BoundingBox &sumBox = boxes[v];\n sumBox.translate(Point() - getNodeOffset(vBox, sumBox));\n }\n for (size_t i = 0; i < order.size(); i++) {\n Node v = order[i];\n BoundingBox vBox = v->getBoundingBox();\n const double NODES_GAP = vBox.height() * NODES_GAP_K;\n\n BoundingBox sumBox = boxes[v];\n v->translate(getNodeOffset(vBox, sumBox));\n Point currentCorner = sumBox.leftUp;\n currentCorner.y += vBox.height() + NODES_GAP;\n for (Node child : children[v]) {\n BoundingBox &childBox = boxes[child];\n childBox.translate(currentCorner - childBox.leftUp);\n currentCorner.x += childBox.width() + NODES_GAP;\n }\n }\n model.recalculate();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright 2018 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ signal_utils:\n\/\/ Implements the Observer pattern for sending state change notifications\n\/\/ from Subject objects to dependent Observer objects.\n\/\/\n\/\/ See design document:\n\/\/ https:\/\/docs.google.com\/document\/d\/15Edfotqg6_l1skTEL8ADQudF_oIdNa7i8Po43k6jMd4\/\n\n#include \"libANGLE\/signal_utils.h\"\n\n#include \"common\/debug.h\"\n\nnamespace angle\n{\n\/\/ Observer implementation.\nObserverInterface::~ObserverInterface() = default;\n\n\/\/ Subject implementation.\nSubject::Subject()\n{\n}\n\nSubject::~Subject()\n{\n resetObservers();\n}\n\nbool Subject::hasObservers() const\n{\n return !mObservers.empty();\n}\n\nvoid Subject::addObserver(ObserverBinding *observer)\n{\n ASSERT(std::find(mObservers.begin(), mObservers.end(), observer) == mObservers.end());\n mObservers.push_back(observer);\n}\n\nvoid Subject::removeObserver(ObserverBinding *observer)\n{\n auto iter = std::find(mObservers.begin(), mObservers.end(), observer);\n ASSERT(iter != mObservers.end());\n mObservers.erase(iter);\n}\n\nvoid Subject::onStateChange(const gl::Context *context, SubjectMessage message) const\n{\n if (mObservers.empty())\n return;\n\n for (const angle::ObserverBinding *receiver : mObservers)\n {\n receiver->onStateChange(context, message);\n }\n}\n\nvoid Subject::resetObservers()\n{\n for (angle::ObserverBinding *observer : mObservers)\n {\n observer->onSubjectReset();\n }\n mObservers.clear();\n}\n\n\/\/ ObserverBinding implementation.\nObserverBinding::ObserverBinding(ObserverInterface *observer, SubjectIndex index)\n : mSubject(nullptr), mObserver(observer), mIndex(index)\n{\n ASSERT(observer);\n}\n\nObserverBinding::~ObserverBinding()\n{\n reset();\n}\n\nObserverBinding::ObserverBinding(const ObserverBinding &other) = default;\n\nObserverBinding &ObserverBinding::operator=(const ObserverBinding &other) = default;\n\nvoid ObserverBinding::bind(Subject *subject)\n{\n ASSERT(mObserver);\n if (mSubject)\n {\n mSubject->removeObserver(this);\n }\n\n mSubject = subject;\n\n if (mSubject)\n {\n mSubject->addObserver(this);\n }\n}\n\nvoid ObserverBinding::reset()\n{\n bind(nullptr);\n}\n\nvoid ObserverBinding::onStateChange(const gl::Context *context, SubjectMessage message) const\n{\n mObserver->onSubjectStateChange(context, mIndex, message);\n}\n\nvoid ObserverBinding::onSubjectReset()\n{\n mSubject = nullptr;\n}\n} \/\/ namespace angle\n<commit_msg>Add missing #include.<commit_after>\/\/\n\/\/ Copyright 2018 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ signal_utils:\n\/\/ Implements the Observer pattern for sending state change notifications\n\/\/ from Subject objects to dependent Observer objects.\n\/\/\n\/\/ See design document:\n\/\/ https:\/\/docs.google.com\/document\/d\/15Edfotqg6_l1skTEL8ADQudF_oIdNa7i8Po43k6jMd4\/\n\n#include \"libANGLE\/signal_utils.h\"\n\n#include <algorithm>\n\n#include \"common\/debug.h\"\n\nnamespace angle\n{\n\/\/ Observer implementation.\nObserverInterface::~ObserverInterface() = default;\n\n\/\/ Subject implementation.\nSubject::Subject()\n{\n}\n\nSubject::~Subject()\n{\n resetObservers();\n}\n\nbool Subject::hasObservers() const\n{\n return !mObservers.empty();\n}\n\nvoid Subject::addObserver(ObserverBinding *observer)\n{\n ASSERT(std::find(mObservers.begin(), mObservers.end(), observer) == mObservers.end());\n mObservers.push_back(observer);\n}\n\nvoid Subject::removeObserver(ObserverBinding *observer)\n{\n auto iter = std::find(mObservers.begin(), mObservers.end(), observer);\n ASSERT(iter != mObservers.end());\n mObservers.erase(iter);\n}\n\nvoid Subject::onStateChange(const gl::Context *context, SubjectMessage message) const\n{\n if (mObservers.empty())\n return;\n\n for (const angle::ObserverBinding *receiver : mObservers)\n {\n receiver->onStateChange(context, message);\n }\n}\n\nvoid Subject::resetObservers()\n{\n for (angle::ObserverBinding *observer : mObservers)\n {\n observer->onSubjectReset();\n }\n mObservers.clear();\n}\n\n\/\/ ObserverBinding implementation.\nObserverBinding::ObserverBinding(ObserverInterface *observer, SubjectIndex index)\n : mSubject(nullptr), mObserver(observer), mIndex(index)\n{\n ASSERT(observer);\n}\n\nObserverBinding::~ObserverBinding()\n{\n reset();\n}\n\nObserverBinding::ObserverBinding(const ObserverBinding &other) = default;\n\nObserverBinding &ObserverBinding::operator=(const ObserverBinding &other) = default;\n\nvoid ObserverBinding::bind(Subject *subject)\n{\n ASSERT(mObserver);\n if (mSubject)\n {\n mSubject->removeObserver(this);\n }\n\n mSubject = subject;\n\n if (mSubject)\n {\n mSubject->addObserver(this);\n }\n}\n\nvoid ObserverBinding::reset()\n{\n bind(nullptr);\n}\n\nvoid ObserverBinding::onStateChange(const gl::Context *context, SubjectMessage message) const\n{\n mObserver->onSubjectStateChange(context, mIndex, message);\n}\n\nvoid ObserverBinding::onSubjectReset()\n{\n mSubject = nullptr;\n}\n} \/\/ namespace angle\n<|endoftext|>"} {"text":"<commit_before>#include <string.h>\n#include \"renderer\/film.h\"\n\nnamespace aten\n{\n Film::Film(int w, int h)\n {\n init(w, h);\n }\n\n void Film::init(int w, int h)\n {\n m_width = w;\n m_height = h;\n m_image.resize(m_width * m_height);\n }\n\n void Film::clear()\n {\n memset(&m_image[0], 0, m_image.size() * sizeof(vec4));\n }\n\n void Film::put(int x, int y, const vec3& v)\n {\n put(x, y, vec4(v, 1));\n }\n\n void Film::put(int i, const vec3& v)\n {\n put(i, vec4(v, 1));\n }\n\n void Film::put(int x, int y, const vec4& v)\n {\n x = aten::clamp<int>(x, 0, m_width - 1);\n y = aten::clamp<int>(y, 0, m_height - 1);\n\n auto pos = y * m_width + x;\n put(pos, v);\n }\n\n void Film::put(int i, const vec4& v)\n {\n m_image[i] = v;\n }\n\n void Film::add(int i, const vec4& v)\n {\n m_image[i] += v;\n }\n\n const vec4& Film::at(int x, int y) const\n {\n auto pos = y * m_width + x;\n return m_image[pos];\n }\n\n \/\/ NOTE\n \/\/ http:\/\/www.flint.jp\/blog\/?entry=86\n\n void FilmProgressive::put(int i, const vec4& v)\n {\n auto& curValue = m_image[i];\n\n \/\/ First curValue.w is 1, so -1.\n int n = curValue.w;\n int attn = n - 1;\n\n curValue = attn * curValue + v;\n curValue \/= (attn + 1);\n\n curValue.w = n + 1;\n }\n}\n<commit_msg>Fix progressive accumulation bug<commit_after>#include <string.h>\n#include \"renderer\/film.h\"\n\nnamespace aten\n{\n Film::Film(int w, int h)\n {\n init(w, h);\n }\n\n void Film::init(int w, int h)\n {\n m_width = w;\n m_height = h;\n m_image.resize(m_width * m_height);\n }\n\n void Film::clear()\n {\n memset(&m_image[0], 0, m_image.size() * sizeof(vec4));\n }\n\n void Film::put(int x, int y, const vec3& v)\n {\n put(x, y, vec4(v, 1));\n }\n\n void Film::put(int i, const vec3& v)\n {\n put(i, vec4(v, 1));\n }\n\n void Film::put(int x, int y, const vec4& v)\n {\n x = aten::clamp<int>(x, 0, m_width - 1);\n y = aten::clamp<int>(y, 0, m_height - 1);\n\n auto pos = y * m_width + x;\n put(pos, v);\n }\n\n void Film::put(int i, const vec4& v)\n {\n m_image[i] = v;\n }\n\n void Film::add(int i, const vec4& v)\n {\n m_image[i] += v;\n }\n\n const vec4& Film::at(int x, int y) const\n {\n auto pos = y * m_width + x;\n return m_image[pos];\n }\n\n \/\/ NOTE\n \/\/ http:\/\/www.flint.jp\/blog\/?entry=86\n\n void FilmProgressive::put(int i, const vec4& v)\n {\n auto& curValue = m_image[i];\n\n int n = curValue.w;\n\n curValue = n * curValue + v;\n curValue \/= (n + 1);\n\n curValue.w = n + 1;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"text\/table.h\"\n#include \"text\/cmdline.h\"\n#include \"cortex\/class.h\"\n#include \"cortex\/cortex.h\"\n#include \"math\/clamp.hpp\"\n#include \"thread\/thread.h\"\n#include \"math\/random.hpp\"\n#include \"math\/numeric.hpp\"\n#include \"tensor\/numeric.hpp\"\n#include \"cortex\/measure.hpp\"\n#include \"cortex\/accumulator.h\"\n#include \"text\/table_row_mark.h\"\n#include \"cortex\/measure_and_log.hpp\"\n#include \"cortex\/layers\/make_layers.h\"\n#include \"cortex\/tasks\/task_charset.h\"\n\nint main(int argc, const char *argv[])\n{\n using namespace nano;\n\n \/\/ parse the command line\n nano::cmdline_t cmdline(\"benchmark models\");\n cmdline.add(\"s\", \"samples\", \"number of samples to use [100, 100000]\", \"10000\");\n cmdline.add(\"\", \"mlps\", \"benchmark MLP models\");\n cmdline.add(\"\", \"convnets\", \"benchmark convolution networks\");\n cmdline.add(\"\", \"forward\", \"evaluate the \\'forward\\' pass (output)\");\n cmdline.add(\"\", \"backward\", \"evaluate the \\'backward' pass (gradient)\");\n\n cmdline.process(argc, argv);\n\n \/\/ check arguments and options\n const auto cmd_samples = nano::clamp(cmdline.get<size_t>(\"samples\"), 100, 100 * 1000);\n const auto cmd_forward = cmdline.has(\"forward\");\n const auto cmd_backward = cmdline.has(\"backward\");\n const auto cmd_mlps = cmdline.has(\"mlps\");\n const auto cmd_convnets = cmdline.has(\"convnets\");\n\n if (!cmd_forward && !cmd_backward)\n {\n cmdline.usage();\n }\n\n if (!cmd_mlps && !cmd_convnets)\n {\n cmdline.usage();\n }\n\n const tensor_size_t cmd_rows = 28;\n const tensor_size_t cmd_cols = 28;\n const color_mode cmd_color = color_mode::luma;\n\n const size_t cmd_min_nthreads = 1;\n const size_t cmd_max_nthreads = thread::concurrency();\n\n \/\/ generate synthetic task\n charset_task_t task(charset::digit, cmd_color, cmd_rows, cmd_cols, cmd_samples);\n task.load();\n\n \/\/ construct models\n const string_t mlp0;\n const string_t mlp1 = mlp0 + make_affine_layer(100);\n const string_t mlp2 = mlp1 + make_affine_layer(100);\n const string_t mlp3 = mlp2 + make_affine_layer(100);\n const string_t mlp4 = mlp3 + make_affine_layer(100);\n const string_t mlp5 = mlp4 + make_affine_layer(100);\n\n const string_t convnetk2d_9x9p_5x5p_3x3 =\n make_conv_pool_layer(\"conv-k2d\", 16, 9, 9, 1) +\n make_conv_pool_layer(\"conv-k2d\", 32, 5, 5, 2) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 4);\n\n const string_t convnettoe_9x9p_5x5p_3x3 =\n nano::replace(convnetk2d_9x9p_5x5p_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_11x11_9x9_7x7_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 11, 11, 1) +\n make_conv_layer(\"conv-k2d\", 32, 9, 9, 2) +\n make_conv_layer(\"conv-k2d\", 64, 7, 7, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_11x11_9x9_7x7_3x3 =\n nano::replace(convnetk2d_11x11_9x9_7x7_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_9x9_7x7_7x7_5x5_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 9, 9, 1) +\n make_conv_layer(\"conv-k2d\", 32, 7, 7, 2) +\n make_conv_layer(\"conv-k2d\", 32, 7, 7, 4) +\n make_conv_layer(\"conv-k2d\", 64, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_9x9_7x7_7x7_5x5_3x3 =\n nano::replace(convnetk2d_9x9_7x7_7x7_5x5_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 7, 7, 1) +\n make_conv_layer(\"conv-k2d\", 16, 7, 7, 2) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 2) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 4);\n\n const string_t convnettoe_7x7_7x7_5x5_5x5_5x5_3x3 =\n nano::replace(convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t outlayer = make_output_layer(task.osize());\n\n std::vector<std::pair<string_t, string_t>> networks;\n #define DEFINE(config) networks.emplace_back(config + outlayer, NANO_STRINGIFY(config))\n\n if (cmd_mlps)\n {\n DEFINE(mlp0);\n DEFINE(mlp1);\n DEFINE(mlp2);\n DEFINE(mlp3);\n DEFINE(mlp4);\n DEFINE(mlp5);\n }\n if (cmd_convnets)\n {\n DEFINE(convnetk2d_9x9p_5x5p_3x3);\n DEFINE(convnettoe_9x9p_5x5p_3x3);\n DEFINE(convnetk2d_11x11_9x9_7x7_3x3);\n DEFINE(convnettoe_11x11_9x9_7x7_3x3);\n DEFINE(convnetk2d_9x9_7x7_7x7_5x5_3x3);\n DEFINE(convnettoe_9x9_7x7_7x7_5x5_3x3);\n DEFINE(convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3);\n DEFINE(convnettoe_7x7_7x7_5x5_5x5_5x5_3x3);\n }\n\n #undef DEFINE\n\n const auto loss = nano::get_losses().get(\"logistic\");\n const auto criterion = nano::get_criteria().get(\"l2n-reg\");\n\n \/\/ construct tables to compare models\n nano::table_t ftable(\"model-forward [ms] \/ 1000 samples\");\n nano::table_t btable(\"model-backward [ms] \/ 1000 samples\");\n\n for (size_t nthreads = cmd_min_nthreads; nthreads <= cmd_max_nthreads; ++ nthreads)\n {\n ftable.header() << (nano::to_string(nthreads) + \"xCPU\");\n btable.header() << (nano::to_string(nthreads) + \"xCPU\");\n }\n\n \/\/ evaluate models\n for (const auto& config : networks)\n {\n const string_t cmd_network = config.first;\n const string_t cmd_name = config.second;\n\n log_info() << \"<<< running network [\" << cmd_network << \"] ...\";\n\n \/\/ create feed-forward network\n const auto model = nano::get_models().get(\"forward-network\", cmd_network);\n model->resize(task, true);\n model->random_params();\n\n nano::table_row_t& frow = ftable.append(cmd_name + \" (\" + nano::to_string(model->psize()) + \")\");\n nano::table_row_t& brow = btable.append(cmd_name + \" (\" + nano::to_string(model->psize()) + \")\");\n\n const auto fold = fold_t{0, protocol::train};\n\n \/\/ process the samples\n for (size_t nthreads = cmd_min_nthreads; nthreads <= cmd_max_nthreads; ++ nthreads)\n {\n if (cmd_forward)\n {\n accumulator_t lacc(*model, *loss, *criterion, criterion_t::type::value, scalar_t(0.1));\n lacc.set_threads(nthreads);\n\n const auto milis = nano::measure_robustly_msec([&] ()\n {\n lacc.reset();\n lacc.update(task, fold);\n }, 1);\n\n log_info() << \"<<< processed [\" << lacc.count()\n << \"] forward samples in \" << milis.count() << \" ms.\";\n\n frow << idiv(static_cast<size_t>(milis.count()) * 1000, lacc.count());\n }\n\n if (cmd_backward)\n {\n accumulator_t gacc(*model, *loss, *criterion, criterion_t::type::vgrad, scalar_t(0.1));\n gacc.set_threads(nthreads);\n\n const auto milis = nano::measure_robustly_msec([&] ()\n {\n gacc.reset();\n gacc.update(task, fold);\n }, 1);\n\n log_info() << \"<<< processed [\" << gacc.count()\n << \"] backward samples in \" << milis.count() << \" ms.\";\n\n brow << idiv(static_cast<size_t>(milis.count()) * 1000, gacc.count());\n }\n }\n\n log_info();\n }\n\n \/\/ print results\n if (cmd_forward)\n {\n ftable.mark(nano::make_table_mark_minimum_percentage_cols<size_t>(5));\n ftable.print(std::cout);\n }\n log_info();\n if (cmd_backward)\n {\n btable.mark(nano::make_table_mark_minimum_percentage_cols<size_t>(5));\n btable.print(std::cout);\n }\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\n<commit_msg>extend benchmark with very deep convolution networks<commit_after>#include \"text\/table.h\"\n#include \"text\/cmdline.h\"\n#include \"cortex\/class.h\"\n#include \"cortex\/cortex.h\"\n#include \"math\/clamp.hpp\"\n#include \"thread\/thread.h\"\n#include \"math\/random.hpp\"\n#include \"math\/numeric.hpp\"\n#include \"tensor\/numeric.hpp\"\n#include \"cortex\/measure.hpp\"\n#include \"cortex\/accumulator.h\"\n#include \"text\/table_row_mark.h\"\n#include \"cortex\/measure_and_log.hpp\"\n#include \"cortex\/layers\/make_layers.h\"\n#include \"cortex\/tasks\/task_charset.h\"\n\nint main(int argc, const char *argv[])\n{\n using namespace nano;\n\n \/\/ parse the command line\n nano::cmdline_t cmdline(\"benchmark models\");\n cmdline.add(\"s\", \"samples\", \"number of samples to use [100, 100000]\", \"10000\");\n cmdline.add(\"\", \"mlps\", \"benchmark MLP models\");\n cmdline.add(\"\", \"convnets\", \"benchmark convolution networks\");\n cmdline.add(\"\", \"forward\", \"evaluate the \\'forward\\' pass (output)\");\n cmdline.add(\"\", \"backward\", \"evaluate the \\'backward' pass (gradient)\");\n\n cmdline.process(argc, argv);\n\n \/\/ check arguments and options\n const auto cmd_samples = nano::clamp(cmdline.get<size_t>(\"samples\"), 100, 100 * 1000);\n const auto cmd_forward = cmdline.has(\"forward\");\n const auto cmd_backward = cmdline.has(\"backward\");\n const auto cmd_mlps = cmdline.has(\"mlps\");\n const auto cmd_convnets = cmdline.has(\"convnets\");\n\n if (!cmd_forward && !cmd_backward)\n {\n cmdline.usage();\n }\n\n if (!cmd_mlps && !cmd_convnets)\n {\n cmdline.usage();\n }\n\n const tensor_size_t cmd_rows = 28;\n const tensor_size_t cmd_cols = 28;\n const color_mode cmd_color = color_mode::luma;\n\n const size_t cmd_min_nthreads = 1;\n const size_t cmd_max_nthreads = thread::concurrency();\n\n \/\/ generate synthetic task\n charset_task_t task(charset::digit, cmd_color, cmd_rows, cmd_cols, cmd_samples);\n task.load();\n\n \/\/ construct models\n const string_t mlp0;\n const string_t mlp1 = mlp0 + make_affine_layer(100);\n const string_t mlp2 = mlp1 + make_affine_layer(100);\n const string_t mlp3 = mlp2 + make_affine_layer(100);\n const string_t mlp4 = mlp3 + make_affine_layer(100);\n const string_t mlp5 = mlp4 + make_affine_layer(100);\n\n const string_t convnetk2d_9x9p_5x5p_3x3 =\n make_conv_pool_layer(\"conv-k2d\", 16, 9, 9, 1) +\n make_conv_pool_layer(\"conv-k2d\", 32, 5, 5, 2) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 4);\n\n const string_t convnettoe_9x9p_5x5p_3x3 =\n nano::replace(convnetk2d_9x9p_5x5p_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_11x11_9x9_7x7_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 11, 11, 1) +\n make_conv_layer(\"conv-k2d\", 32, 9, 9, 2) +\n make_conv_layer(\"conv-k2d\", 64, 7, 7, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_11x11_9x9_7x7_3x3 =\n nano::replace(convnetk2d_11x11_9x9_7x7_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_9x9_7x7_7x7_5x5_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 9, 9, 1) +\n make_conv_layer(\"conv-k2d\", 32, 7, 7, 2) +\n make_conv_layer(\"conv-k2d\", 32, 7, 7, 4) +\n make_conv_layer(\"conv-k2d\", 64, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_9x9_7x7_7x7_5x5_3x3 =\n nano::replace(convnetk2d_9x9_7x7_7x7_5x5_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 7, 7, 1) +\n make_conv_layer(\"conv-k2d\", 16, 7, 7, 2) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 2) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 4);\n\n const string_t convnettoe_7x7_7x7_5x5_5x5_5x5_3x3 =\n nano::replace(convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_5x5_5x5_5x5_5x5_5x5_5x5_5x5 =\n make_conv_layer(\"conv-k2d\", 16, 5, 5, 1) +\n make_conv_layer(\"conv-k2d\", 32, 5, 5, 2) +\n make_conv_layer(\"conv-k2d\", 64, 5, 5, 4) +\n make_conv_layer(\"conv-k2d\", 64, 5, 5, 8) +\n make_conv_layer(\"conv-k2d\", 64, 5, 5, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_5x5_5x5_5x5_5x5_5x5_5x5_5x5 =\n nano::replace(convnetk2d_5x5_5x5_5x5_5x5_5x5_5x5_5x5, \"conv-k2d\", \"conv-toe\");\n\n const string_t convnetk2d_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3 =\n make_conv_layer(\"conv-k2d\", 16, 3, 3, 1) +\n make_conv_layer(\"conv-k2d\", 32, 3, 3, 2) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 4) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8) +\n make_conv_layer(\"conv-k2d\", 64, 3, 3, 8);\n\n const string_t convnettoe_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3 =\n nano::replace(convnetk2d_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3, \"conv-k2d\", \"conv-toe\");\n\n const string_t outlayer = make_output_layer(task.osize());\n\n std::vector<std::pair<string_t, string_t>> networks;\n #define DEFINE(config) networks.emplace_back(config + outlayer, NANO_STRINGIFY(config))\n\n if (cmd_mlps)\n {\n DEFINE(mlp0);\n DEFINE(mlp1);\n DEFINE(mlp2);\n DEFINE(mlp3);\n DEFINE(mlp4);\n DEFINE(mlp5);\n }\n if (cmd_convnets)\n {\n DEFINE(convnetk2d_9x9p_5x5p_3x3);\n DEFINE(convnettoe_9x9p_5x5p_3x3);\n DEFINE(convnetk2d_11x11_9x9_7x7_3x3);\n DEFINE(convnettoe_11x11_9x9_7x7_3x3);\n DEFINE(convnetk2d_9x9_7x7_7x7_5x5_3x3);\n DEFINE(convnettoe_9x9_7x7_7x7_5x5_3x3);\n DEFINE(convnetk2d_7x7_7x7_5x5_5x5_5x5_3x3);\n DEFINE(convnettoe_7x7_7x7_5x5_5x5_5x5_3x3);\n DEFINE(convnetk2d_5x5_5x5_5x5_5x5_5x5_5x5_5x5);\n DEFINE(convnettoe_5x5_5x5_5x5_5x5_5x5_5x5_5x5);\n DEFINE(convnetk2d_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3);\n DEFINE(convnettoe_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3_3x3);\n }\n\n #undef DEFINE\n\n const auto loss = nano::get_losses().get(\"logistic\");\n const auto criterion = nano::get_criteria().get(\"l2n-reg\");\n\n \/\/ construct tables to compare models\n nano::table_t ftable(\"model-forward [ms] \/ 1000 samples\");\n nano::table_t btable(\"model-backward [ms] \/ 1000 samples\");\n\n for (size_t nthreads = cmd_min_nthreads; nthreads <= cmd_max_nthreads; ++ nthreads)\n {\n ftable.header() << (nano::to_string(nthreads) + \"xCPU\");\n btable.header() << (nano::to_string(nthreads) + \"xCPU\");\n }\n\n \/\/ evaluate models\n for (const auto& config : networks)\n {\n const string_t cmd_network = config.first;\n const string_t cmd_name = config.second;\n\n log_info() << \"<<< running network [\" << cmd_network << \"] ...\";\n\n \/\/ create feed-forward network\n const auto model = nano::get_models().get(\"forward-network\", cmd_network);\n model->resize(task, true);\n model->random_params();\n\n nano::table_row_t& frow = ftable.append(cmd_name + \" (\" + nano::to_string(model->psize()) + \")\");\n nano::table_row_t& brow = btable.append(cmd_name + \" (\" + nano::to_string(model->psize()) + \")\");\n\n const auto fold = fold_t{0, protocol::train};\n\n \/\/ process the samples\n for (size_t nthreads = cmd_min_nthreads; nthreads <= cmd_max_nthreads; ++ nthreads)\n {\n if (cmd_forward)\n {\n accumulator_t lacc(*model, *loss, *criterion, criterion_t::type::value, scalar_t(0.1));\n lacc.set_threads(nthreads);\n\n const auto milis = nano::measure_robustly_msec([&] ()\n {\n lacc.reset();\n lacc.update(task, fold);\n }, 1);\n\n log_info() << \"<<< processed [\" << lacc.count()\n << \"] forward samples in \" << milis.count() << \" ms.\";\n\n frow << idiv(static_cast<size_t>(milis.count()) * 1000, lacc.count());\n }\n\n if (cmd_backward)\n {\n accumulator_t gacc(*model, *loss, *criterion, criterion_t::type::vgrad, scalar_t(0.1));\n gacc.set_threads(nthreads);\n\n const auto milis = nano::measure_robustly_msec([&] ()\n {\n gacc.reset();\n gacc.update(task, fold);\n }, 1);\n\n log_info() << \"<<< processed [\" << gacc.count()\n << \"] backward samples in \" << milis.count() << \" ms.\";\n\n brow << idiv(static_cast<size_t>(milis.count()) * 1000, gacc.count());\n }\n }\n\n log_info();\n }\n\n \/\/ print results\n if (cmd_forward)\n {\n ftable.mark(nano::make_table_mark_minimum_percentage_cols<size_t>(5));\n ftable.print(std::cout);\n }\n log_info();\n if (cmd_backward)\n {\n btable.mark(nano::make_table_mark_minimum_percentage_cols<size_t>(5));\n btable.print(std::cout);\n }\n\n \/\/ OK\n log_info() << done;\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"crib_hand_helper\/card.h\"\n#include \"crib_hand_helper\/hand_counter.h\"\n\nint main()\n{\n\n}\n<commit_msg>Started writing main function.<commit_after>#include <algorithm>\n#include <cctype>\n#include <iostream>\n#include <string>\n\n#include \"crib_hand_helper\/card.h\"\n#include \"crib_hand_helper\/hand_counter.h\"\n\nconst std::string CARD_NAMES = \"A23456789TJQK\";\n\nbool validate_input(const std::string& hand_string)\n{\n if (hand_string.size() != 6)\n {\n return false;\n }\n\n for (const auto& card_char : hand_string)\n {\n \/\/ Must not be in hand more than four times\n if (std::count(hand_string.begin(), hand_string.end(), card_char) > 4)\n {\n return false;\n }\n\n \/\/ Capitalize letters\n auto card = card_char;\n if (!std::isdigit(card))\n {\n card = std::toupper(card);\n }\n\n \/\/ Must be in CARD_NAMES\n if (std::find(CARD_NAMES.begin(), CARD_NAMES.end(), card) ==\n CARD_NAMES.end())\n {\n return false;\n }\n }\n\n return true;\n}\n\nHand parse_hand(const std::string& hand_string)\n{\n const std::string suits = \"cdhscd\";\n\n Hand hand;\n for (std::string::size_type i = 0; i < hand_string.size(); ++i)\n {\n \/\/ Capitalize letters\n auto card = hand_string[i];\n if (!std::isdigit(card))\n {\n card = std::toupper(card);\n }\n \n hand.emplace_back(card, suits[i]);\n }\n\n return hand;\n}\n\nint main()\n{\n bool input_is_valid = false;\n std::string hand_string;\n\n while (!input_is_valid)\n {\n std::cout << \"Enter hand: \";\n std::cin >> hand_string;\n input_is_valid = validate_input(hand_string);\n if (!input_is_valid)\n {\n std::cout << \"Invalid hand. Try again.\\n\";\n }\n }\n\n auto hand = parse_hand(hand_string);\n \n input_is_valid = false;\n char yes_or_no;\n while (!input_is_valid)\n {\n std::cout << \"Are at least fours card the same suit? [y\/n]: \";\n std::cin >> yes_or_no;\n input_is_valid = yes_or_no == 'y' || yes_or_no == 'n';\n if (!input_is_valid)\n {\n std::cout << \"Invalid selection. Please enter y or n.\\n\";\n }\n }\n\n if (yes_or_no == 'y')\n {\n\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief infrastructure for query optimizer\n\/\/\/\n\/\/\/ @file arangod\/Aql\/Optimizer.cpp\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2010-2014 triagens GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Max Neunhoeffer\n\/\/\/ @author Copyright 2014, triagens GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Aql\/Optimizer.h\"\n#include \"Aql\/OptimizerRules.h\"\n\nusing namespace triagens::aql;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- the optimizer class\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief constructor, this will initialize the rules database\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOptimizer::Optimizer () {\n \/\/ List all the rules in the system here:\n\n \/\/ try to find sort blocks which are superseeded by indexes\n registerRule (useIndexForSort, 2000);\n\n\n \/\/ try to find a filter after an enumerate collection and find an index . . . \n registerRule(useIndexRange, 999);\n\n \/\/ remove filters from the query that are not necessary at all\n \/\/ filters that are always true will be removed entirely\n \/\/ filters that are always false will be replaced with a NoResults node\n registerRule(removeUnnecessaryFiltersRule, 100);\n \n \/\/ move calculations up the dependency chain (to pull them out of inner loops etc.)\n registerRule(moveCalculationsUpRule, 1000);\n\n \/\/ move filters up the dependency chain (to make result sets as small as possible\n \/\/ as early as possible)\n registerRule(moveFiltersUpRule, 1010);\n\n \/\/ remove calculations that are never necessary\n registerRule(removeUnnecessaryCalculationsRule, 1020);\n\n \/\/ Now sort them by level:\n std::stable_sort(_rules.begin(), _rules.end());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief the actual optimization\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Optimizer::createPlans (ExecutionPlan* plan) {\n int res;\n int leastDoneLevel = 0;\n int maxRuleLevel = _rules.back().level;\n\n \/\/ _plans contains the previous optimisation result\n _plans.clear();\n _plans.push_back(plan, 0);\n\n int pass = 1;\n while (leastDoneLevel < maxRuleLevel) {\n std::cout << \"Entering pass \" << pass << \" of query optimization...\" \n << std::endl;\n \n \/\/ This vector holds the plans we have created in this pass:\n PlanList newPlans;\n\n \/\/ Find variable usage for all old plans now:\n for (auto p : _plans.list) {\n if (! p->varUsageComputed()) {\n p->findVarUsage();\n }\n }\n\n std::cout << \"Have \" << _plans.size() << \" plans.\" << std::endl;\n\n int count = 0;\n\n \/\/ For all current plans:\n while (_plans.size() > 0) {\n int level;\n auto p = _plans.pop_front(level);\n if (level == maxRuleLevel) {\n newPlans.push_back(p, level); \/\/ nothing to do, just keep it\n }\n else { \/\/ some rule needs applying\n Rule r(dummyRule, level);\n auto it = std::upper_bound(_rules.begin(), _rules.end(), r);\n TRI_ASSERT(it != _rules.end());\n std::cout << \"Trying rule \" << &(it->func) << \" with level \"\n << it->level << \" to plan \" << count++\n << std::endl;\n try {\n \/\/ keep should have a default value so rules that forget to set it\n \/\/ have a deterministic behavior\n res = it->func(this, p, it->level, newPlans);\n }\n catch (...) {\n delete p;\n throw;\n }\n if (res != TRI_ERROR_NO_ERROR) {\n return res;\n }\n }\n }\n _plans.steal(newPlans);\n leastDoneLevel = maxRuleLevel;\n for (auto l : _plans.levelDone) {\n if (l < leastDoneLevel) {\n leastDoneLevel = l;\n }\n }\n std::cout << \"Least done level is \" << leastDoneLevel << std::endl;\n\n \/\/ Stop if the result gets out of hand:\n if (_plans.size() >= maxNumberOfPlans) {\n break;\n }\n }\n\n estimatePlans();\n sortPlans();\n std::cout << \"Optimisation ends with \" << _plans.size() << \" plans.\"\n << std::endl;\n std::cout << \"Costs:\" << std::endl;\n for (auto p : _plans.list) {\n std::cout << p->getCost() << std::endl;\n }\n \n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief estimatePlans\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::estimatePlans () {\n for (auto p : _plans.list) {\n p->getCost();\n \/\/ this value is cached in the plan, so formally this step is\n \/\/ unnecessary, but for the sake of cleanliness...\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief sortPlans\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::sortPlans () {\n std::sort(_plans.list.begin(), _plans.list.end(), [](ExecutionPlan* const& a, ExecutionPlan* const& b) -> bool {\n return a->getCost() < b->getCost();\n });\n}\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n\n\n<commit_msg>Adjust a cout message.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief infrastructure for query optimizer\n\/\/\/\n\/\/\/ @file arangod\/Aql\/Optimizer.cpp\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2010-2014 triagens GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Max Neunhoeffer\n\/\/\/ @author Copyright 2014, triagens GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Aql\/Optimizer.h\"\n#include \"Aql\/OptimizerRules.h\"\n\nusing namespace triagens::aql;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- the optimizer class\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief constructor, this will initialize the rules database\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nOptimizer::Optimizer () {\n \/\/ List all the rules in the system here:\n\n \/\/ try to find sort blocks which are superseeded by indexes\n registerRule (useIndexForSort, 2000);\n\n\n \/\/ try to find a filter after an enumerate collection and find an index . . . \n registerRule(useIndexRange, 999);\n\n \/\/ remove filters from the query that are not necessary at all\n \/\/ filters that are always true will be removed entirely\n \/\/ filters that are always false will be replaced with a NoResults node\n registerRule(removeUnnecessaryFiltersRule, 100);\n \n \/\/ move calculations up the dependency chain (to pull them out of inner loops etc.)\n registerRule(moveCalculationsUpRule, 1000);\n\n \/\/ move filters up the dependency chain (to make result sets as small as possible\n \/\/ as early as possible)\n registerRule(moveFiltersUpRule, 1010);\n\n \/\/ remove calculations that are never necessary\n registerRule(removeUnnecessaryCalculationsRule, 1020);\n\n \/\/ Now sort them by level:\n std::stable_sort(_rules.begin(), _rules.end());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ @brief the actual optimization\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint Optimizer::createPlans (ExecutionPlan* plan) {\n int res;\n int leastDoneLevel = 0;\n int maxRuleLevel = _rules.back().level;\n\n \/\/ _plans contains the previous optimisation result\n _plans.clear();\n _plans.push_back(plan, 0);\n\n int pass = 1;\n while (leastDoneLevel < maxRuleLevel) {\n std::cout << \"Entering pass \" << pass << \" of query optimization...\" \n << std::endl;\n \n \/\/ This vector holds the plans we have created in this pass:\n PlanList newPlans;\n\n \/\/ Find variable usage for all old plans now:\n for (auto p : _plans.list) {\n if (! p->varUsageComputed()) {\n p->findVarUsage();\n }\n }\n\n std::cout << \"Have \" << _plans.size() << \" plans.\" << std::endl;\n\n int count = 0;\n\n \/\/ For all current plans:\n while (_plans.size() > 0) {\n int level;\n auto p = _plans.pop_front(level);\n if (level == maxRuleLevel) {\n newPlans.push_back(p, level); \/\/ nothing to do, just keep it\n }\n else { \/\/ some rule needs applying\n Rule r(dummyRule, level);\n auto it = std::upper_bound(_rules.begin(), _rules.end(), r);\n TRI_ASSERT(it != _rules.end());\n std::cout << \"Trying rule \" << &(it->func) << \" with level \"\n << it->level << \" on plan \" << count++\n << std::endl;\n try {\n \/\/ keep should have a default value so rules that forget to set it\n \/\/ have a deterministic behavior\n res = it->func(this, p, it->level, newPlans);\n }\n catch (...) {\n delete p;\n throw;\n }\n if (res != TRI_ERROR_NO_ERROR) {\n return res;\n }\n }\n }\n _plans.steal(newPlans);\n leastDoneLevel = maxRuleLevel;\n for (auto l : _plans.levelDone) {\n if (l < leastDoneLevel) {\n leastDoneLevel = l;\n }\n }\n std::cout << \"Least done level is \" << leastDoneLevel << std::endl;\n\n \/\/ Stop if the result gets out of hand:\n if (_plans.size() >= maxNumberOfPlans) {\n break;\n }\n }\n\n estimatePlans();\n sortPlans();\n std::cout << \"Optimisation ends with \" << _plans.size() << \" plans.\"\n << std::endl;\n std::cout << \"Costs:\" << std::endl;\n for (auto p : _plans.list) {\n std::cout << p->getCost() << std::endl;\n }\n \n return TRI_ERROR_NO_ERROR;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief estimatePlans\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::estimatePlans () {\n for (auto p : _plans.list) {\n p->getCost();\n \/\/ this value is cached in the plan, so formally this step is\n \/\/ unnecessary, but for the sake of cleanliness...\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief sortPlans\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid Optimizer::sortPlans () {\n std::sort(_plans.list.begin(), _plans.list.end(), [](ExecutionPlan* const& a, ExecutionPlan* const& b) -> bool {\n return a->getCost() < b->getCost();\n });\n}\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"^\\\\(\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @addtogroup\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\\\\)\"\n\/\/ End:\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"mywindows.h\"\n\nmyWindows::myWindows(QWidget *parent) :QWidget(parent)\n{ \n \/\/Getting size of the screen\n QList<QScreen*> screenObj = QGuiApplication::screens();\n screen = screenObj.at(0);\n int sizeCol;\n screenH = screen->geometry().height();\n screenW = screen->geometry().width();\n sizeCol = 150;\n\n sizePreviewH = 512;\n sizePreviewW = 512;\n\n int minPrev = screenH-sizeCol;\n if(minPrev < sizePreviewH) {\n sizePreviewH = minPrev;\n sizePreviewW = minPrev;\n }\n\n isShiftOn = false;\n \/\/Globale layout\n \/\/ _____Vlayout______\n \/\/ | |\n \/\/ | ___HLayout___ |\n \/\/ | | | |\n \/\/ | | preview | |\n \/\/ | | | |\n \/\/ | | file info| |\n \/\/ | |____________| |\n \/\/ | |\n \/\/ | column view |\n \/\/ |________________|\n \/\/\n layoutGlobal = new QVBoxLayout;\n layoutGlobal->setAlignment(Qt::AlignCenter);\n\n \/\/Gloval preview\n\n preview = new imagePreview(this);\n\n \/\/Preview file part\n\n layoutPreview = new QHBoxLayout;\n\n lab = new QLabel(\"image ici\");\n lab->setMaximumHeight(sizePreviewH-110);\n imDef = QPixmap(\":\/images\/test.png\");\n lab->setPixmap(imDef);\n\n info = new fileInfo;\n\n \/\/Column view part\n model = new QFileSystemModel(this);\n model->setRootPath(QDir::rootPath());\n\n model->setReadOnly(false);\n\n \/\/Loading preferences\n loadSettings();\n\n columnView = new QColumnView(this);\n columnView->setMinimumHeight(sizeCol);\n columnView->setModel(model);\n \/\/tree->setRootIndex(model->index(QDir::currentPath()));\n columnView->setCurrentIndex(model->index(lastPath));\n \/\/columnView->setRootIndex());\n QItemSelectionModel* itSel = columnView->selectionModel();\n\n \/\/Adding rename\n\n QPushButton *rename = new QPushButton(\"Rename\");\n\n \/\/Keyboard\n\n \/\/global space shortcut\n shortcutSpace = new QShortcut(QKeySequence(Qt::Key_Space), this);\n shortcutSpace->setContext(Qt::ApplicationShortcut);\n\n \/\/global enter shortcut\n shortcutEnter = new QShortcut(QKeySequence(Qt::Key_Return), this);\n \/\/shortcutEnter->setContext(Qt::ApplicationShortcut);\n\n \/\/Global Supr Shortcut\n shortcutDel = new QShortcut(QKeySequence(Qt::Key_Delete), this);\n shortcutDel->setContext(Qt::ApplicationShortcut);\n\n \/\/Qconnect\n QObject::connect(shortcutSpace,SIGNAL(activated()),this, SLOT(keyboardEvent()));\n QObject::connect(shortcutEnter,SIGNAL(activated()),this, SLOT(keyboardEnter()));\n QObject::connect(shortcutDel,SIGNAL(activated()),this, SLOT(keyboardDel()));\n \/\/Listen to qColumnView click\n \/\/Selection of a file\n QObject::connect(itSel,SIGNAL(currentChanged(QModelIndex,QModelIndex)),this,SLOT(clickedNew(QModelIndex,QModelIndex)));\n QObject::connect(rename,SIGNAL(clicked()),this,SLOT(rename()));\n\n \/\/Adding\n layoutPreview->addWidget(lab);\n layoutPreview->addWidget(info);\n layoutGlobal->addLayout(layoutPreview);\n layoutGlobal->addWidget(columnView);\n layoutGlobal->addWidget(rename);\n\n \/\/Get event even if not in front\n eater = new KeyPressEater(this);\n preview->installEventFilter(eater);\n\n this->setLayout(layoutGlobal);\n this->resize(1024,900);\n this->show();\n}\n\n\/\/Update variable last*Path AND if shift is on remember all selected files\nvoid myWindows::updatePath(QModelIndex index){\n lastFilePath = model->filePath(index);\n QFileInfo infoFile(lastFilePath);\n lastPath = infoFile.canonicalPath();\n if (isShiftOn) {\n shiftList.append(lastFilePath);\n }else{\n shiftList.clear();\n shiftList.append(lastFilePath);\n }\n}\n\n\/\/The actionb called by the column view when the user do something\nvoid myWindows::clickedNew(QModelIndex index,QModelIndex){\n updatePath(index);\n QString fileName = model->fileName(index);\n QFileInfo infoFile(lastFilePath);\n QString ext = fileName.split(\".\").back(); \/\/We could use here QFileInfo::completeSuffix()\n int SIZE_NAME_MAX = 50;\n if (fileName.length() > SIZE_NAME_MAX) {\n info->setName(fileName.mid(0,SIZE_NAME_MAX));\n }else{\n info->setName(fileName);\n }\n if (ext.length() == 1 or ext.length() >= 5) {\n info->setType(\"Not a standard file\");\n } else {\n info->setType(ext.toLower());\n }\n info->setSize(model->size(index));\n info->setResolution(0,0);\n \/\/If it's an image we update the previews and the informations\n QString lowExt = ext.toLower();\n if (infoFile.isFile() && isImage(lowExt)) {\n updateImage();\n }else if(infoFile.isDir()) {\n \/\/ If there is an image inside we try to show it\n QDir dir = QDir(lastFilePath);\n dir.setFilter(QDir::Files);\n QFileInfoList list = dir.entryInfoList();\n bool found = false;\n for (int i = 0; i < list.size(); ++i) {\n QFileInfo fileInfo = list.at(i);\n lowExt = fileInfo.suffix().toLower();\n if (fileInfo.isFile() && isImage(lowExt)) {\n updateImage(fileInfo.absoluteFilePath());\n found = true;\n break;\n }\n }\n \/\/else we show the default image if no file is an image\n if (!found) {\n lab->setPixmap(imDef);\n }\n } else {\n \/\/else we show the default image\n lab->setPixmap(imDef);\n }\n}\n\nbool myWindows::isImage(QString suffix) {\n return (suffix == \"jpg\" || suffix == \"jpeg\" || suffix == \"png\");\n}\n\nvoid myWindows::updateImage(){\n updateImage(lastFilePath);\n}\n\nvoid myWindows::updateImage(QString image){\n lastImagePath = QString(image); \/\/ For later in case of fullscreen\n QPixmap imtmp(image);\n QPixmap imtmp2 = imtmp.scaledToHeight(sizePreviewH, Qt::SmoothTransformation);\n if (imtmp2.width() > sizePreviewW) {\n lab->setPixmap(imtmp2.copy(0,0,sizePreviewW,sizePreviewH));\n }else{\n lab->setPixmap(imtmp2);\n }\n info->setResolution(imtmp.width(),imtmp.height());\n preview->updateImage(imtmp);\n}\n\n\/\/Function to watch the global shortcut SPACE that is for showing preview\nvoid myWindows::keyboardEvent(){\n \/\/qDebug() << \"SPACE \";\n if (preview->showing) {\n preview->hidePreview();\n } else {\n if (lastImagePath != NULL) {\n preview->showImage(lastImagePath);\n preview->activateWindow();\n }\n }\n}\n\n\/\/Function to watch the global shortcut SPACE that is for opening the file with default app\nvoid myWindows::keyboardEnter(){\n \/\/qDebug() << \"ENTER \";\n QDesktopServices::openUrl(QUrl::fromLocalFile(lastFilePath));\n}\n\n\/\/Debug funtion to show all keyboard event\nvoid myWindows::keyPressEvent(QKeyEvent* event) {\n if (event->key() == Qt::Key_Shift) {\n \/\/qDebug() << \"Key Shift\";\n isShiftOn = true;\n }\n}\n\nvoid myWindows::rename(){\n bool ok;\n QString text = QInputDialog::getText(this, tr(\"Renamming\"), tr(\"base name:\"), QLineEdit::Normal,\"\", &ok);\n int num = 0;\n if (ok){\n for (int var = 0; var < shiftList.length(); ++var) {\n _rename(shiftList.at(var),text,&num);\n }\n }\n}\n\nvoid myWindows::_rename(QString path, QString newName,int *num){\n QFileInfo tmp(path);\n if (tmp.isFile()) {\n QFile file(path);\n QString newConstructedName = tmp.canonicalPath()+QDir::separator()+newName;\n \/\/If the name if something XXX-01 else 01\n if (newName != \"\") {\n newConstructedName += \"-\";\n }\n if (*num >= 10) {\n if (*num < 100) {\n newConstructedName += QString(\"0\");\n }\n } else {\n newConstructedName += QString(\"00\");\n }\n newConstructedName += QString::number(*num);\n \/\/if the file had an extension we keep it else nothing\n \/\/ prev.jpg -> XXX-01.jpg\n if (tmp.completeSuffix() != \"\") {\n newConstructedName += \".\"+tmp.completeSuffix();\n }\n file.rename(newConstructedName);\n *num = *num + 1;\n } else if (tmp.isDir()){\n \/\/If we have a dir we get folders and files inside and try to rename them\n QDir fold(path);\n QStringList elmts = fold.entryList(QDir::NoDotAndDotDot | QDir::Dirs | QDir::Files);\n for (int var = 0; var < elmts.length(); ++var) {\n _rename(path+QDir::separator()+elmts.at(var), newName ,num);\n }\n }\n}\n\nvoid myWindows::keyReleaseEvent(QKeyEvent* event)\n{\n if (event->key() == Qt::Key_Shift) {\n \/\/qDebug() <<\"You Release Key \" <<event->text();\n isShiftOn = false;\n }\n}\n\nvoid myWindows::loadSettings(){\n QSettings settings(\"IntCorpLightAssociation\", \"FileViewer\");\n lastPath = settings.value(\"lastPath\").toString();\n}\nvoid myWindows::saveSettings(){\n QSettings settings(\"IntCorpLightAssociation\", \"FileViewer\");\n settings.setValue(\"lastPath\", lastPath);\n}\n\nvoid myWindows::keyboardDel(){\n QMessageBox box;\n box.setText(\"Selected files\/folders will be eternally deleted !!\");\n box.setStandardButtons(QMessageBox::Ok | QMessageBox::Cancel);\n box.setWindowFlags(Qt::WindowStaysOnTopHint);\n box.setDefaultButton(QMessageBox::Ok);\n int ret = box.exec();\n if (ret == QMessageBox::Ok) {\n \/\/qDebug() << \"BIM \";\n for (int i = 0; i < shiftList.length(); ++i) {\n \/\/qDebug() << \"DELETE\" << shiftList.at(i);\n QFileInfo tmp(shiftList.at(i));\n if (tmp.isFile()) {\n QFile file(shiftList.at(i));\n if (!file.remove()) {\n qDebug()<<\"File not deleted: \"<<file.fileName();\n }\n } else {\n QDir folder(shiftList.at(i));\n if (!folder.removeRecursively()) {\n qDebug()<<\"Not all was deleted: \"<<folder.absolutePath();\n }\n }\n }\n \/\/qDebug() << \"\";\n }\n}\n\n\/\/To add coloration to folders\/files\n\/\/http:\/\/stackoverflow.com\/questions\/1397484\/custom-text-color-for-certain-indexes-in-qtreeview\n\n\/\/When the app is closed we saved what is necessary to save\nvoid myWindows::closeEvent(QCloseEvent*){\n saveSettings();\n}\n\nmyWindows::~myWindows(){\n delete eater;\n}\n<commit_msg>Little fix<commit_after>#include \"mywindows.h\"\n\nmyWindows::myWindows(QWidget *parent) :QWidget(parent)\n{ \n \/\/Getting size of the screen\n QList<QScreen*> screenObj = QGuiApplication::screens();\n screen = screenObj.at(0);\n int sizeCol;\n screenH = screen->geometry().height();\n screenW = screen->geometry().width();\n sizeCol = 150;\n\n sizePreviewH = 512;\n sizePreviewW = 512;\n\n int minPrev = screenH-sizeCol;\n if(minPrev < sizePreviewH) {\n sizePreviewH = minPrev;\n sizePreviewW = minPrev;\n }\n\n isShiftOn = false;\n \/\/Globale layout\n \/\/ _____Vlayout______\n \/\/ | |\n \/\/ | ___HLayout___ |\n \/\/ | | | |\n \/\/ | | preview | |\n \/\/ | | | |\n \/\/ | | file info| |\n \/\/ | |____________| |\n \/\/ | |\n \/\/ | column view |\n \/\/ |________________|\n \/\/\n layoutGlobal = new QVBoxLayout;\n layoutGlobal->setAlignment(Qt::AlignCenter);\n\n \/\/Gloval preview\n\n preview = new imagePreview(this);\n\n \/\/Preview file part\n\n layoutPreview = new QHBoxLayout;\n\n lab = new QLabel(\"image ici\");\n lab->setMaximumHeight(sizePreviewH-110);\n imDef = QPixmap(\":\/images\/test.png\");\n lab->setPixmap(imDef);\n\n info = new fileInfo;\n\n \/\/Column view part\n model = new QFileSystemModel(this);\n model->setRootPath(QDir::rootPath());\n\n model->setReadOnly(false);\n\n \/\/Loading preferences\n loadSettings();\n\n columnView = new QColumnView(this);\n columnView->setMinimumHeight(sizeCol);\n columnView->setModel(model);\n \/\/tree->setRootIndex(model->index(QDir::currentPath()));\n columnView->setCurrentIndex(model->index(lastPath));\n \/\/columnView->setRootIndex());\n QItemSelectionModel* itSel = columnView->selectionModel();\n\n \/\/Adding rename\n\n QPushButton *rename = new QPushButton(\"Rename\");\n\n \/\/Keyboard\n\n \/\/global space shortcut\n shortcutSpace = new QShortcut(QKeySequence(Qt::Key_Space), this);\n shortcutSpace->setContext(Qt::ApplicationShortcut);\n\n \/\/global enter shortcut\n shortcutEnter = new QShortcut(QKeySequence(Qt::Key_Return), this);\n \/\/shortcutEnter->setContext(Qt::ApplicationShortcut);\n\n \/\/Global Supr Shortcut\n shortcutDel = new QShortcut(QKeySequence(Qt::Key_Delete), this);\n shortcutDel->setContext(Qt::ApplicationShortcut);\n\n \/\/Qconnect\n QObject::connect(shortcutSpace,SIGNAL(activated()),this, SLOT(keyboardEvent()));\n QObject::connect(shortcutEnter,SIGNAL(activated()),this, SLOT(keyboardEnter()));\n QObject::connect(shortcutDel,SIGNAL(activated()),this, SLOT(keyboardDel()));\n \/\/Listen to qColumnView click\n \/\/Selection of a file\n QObject::connect(itSel,SIGNAL(currentChanged(QModelIndex,QModelIndex)),this,SLOT(clickedNew(QModelIndex,QModelIndex)));\n QObject::connect(rename,SIGNAL(clicked()),this,SLOT(rename()));\n\n \/\/Adding\n layoutPreview->addWidget(lab);\n layoutPreview->addWidget(info);\n layoutGlobal->addLayout(layoutPreview);\n layoutGlobal->addWidget(columnView);\n layoutGlobal->addWidget(rename);\n\n \/\/Get event even if not in front\n eater = new KeyPressEater(this);\n preview->installEventFilter(eater);\n\n this->setLayout(layoutGlobal);\n this->resize(1024,900);\n this->show();\n}\n\n\/\/Update variable last*Path AND if shift is on remember all selected files\nvoid myWindows::updatePath(QModelIndex index){\n lastFilePath = model->filePath(index);\n QFileInfo infoFile(lastFilePath);\n lastPath = infoFile.canonicalPath();\n if (isShiftOn) {\n shiftList.append(lastFilePath);\n }else{\n shiftList.clear();\n shiftList.append(lastFilePath);\n }\n}\n\n\/\/The actionb called by the column view when the user do something\nvoid myWindows::clickedNew(QModelIndex index,QModelIndex){\n updatePath(index);\n QString fileName = model->fileName(index);\n QFileInfo infoFile(lastFilePath);\n QString ext = fileName.split(\".\").back(); \/\/We could use here QFileInfo::completeSuffix()\n int SIZE_NAME_MAX = 50;\n if (fileName.length() > SIZE_NAME_MAX) {\n info->setName(fileName.mid(0,SIZE_NAME_MAX));\n }else{\n info->setName(fileName);\n }\n if (ext.length() == 1 or ext.length() >= 5) {\n info->setType(\"Not a standard file\");\n } else {\n info->setType(ext.toLower());\n }\n info->setSize(model->size(index));\n info->setResolution(0,0);\n \/\/If it's an image we update the previews and the informations\n QString lowExt = ext.toLower();\n if (infoFile.isFile() && isImage(lowExt)) {\n updateImage();\n }else if(infoFile.isDir()) {\n \/\/ If there is an image inside we try to show it\n QDir dir = QDir(lastFilePath);\n dir.setFilter(QDir::Files);\n QFileInfoList list = dir.entryInfoList();\n bool found = false;\n for (int i = 0; i < list.size(); ++i) {\n QFileInfo fileInfo = list.at(i);\n lowExt = fileInfo.suffix().toLower();\n if (fileInfo.isFile() && isImage(lowExt)) {\n updateImage(fileInfo.absoluteFilePath());\n found = true;\n break;\n }\n }\n \/\/else we show the default image if no file is an image\n if (!found) {\n lab->setPixmap(imDef);\n }\n } else {\n \/\/else we show the default image\n lab->setPixmap(imDef);\n }\n}\n\nbool myWindows::isImage(QString suffix) {\n return (suffix == \"jpg\" || suffix == \"jpeg\" || suffix == \"png\");\n}\n\nvoid myWindows::updateImage(){\n updateImage(lastFilePath);\n}\n\nvoid myWindows::updateImage(QString image){\n lastImagePath = QString(image); \/\/ For later in case of fullscreen\n QPixmap imtmp(image);\n if (imtmp.isNull()) { \/\/ in the case someone give a bad extension (png instead of jpg)...\n imtmp = imDef;\n }\n QPixmap imtmp2 = imtmp.scaledToHeight(sizePreviewH, Qt::SmoothTransformation);\n\n if (imtmp2.width() > sizePreviewW) {\n lab->setPixmap(imtmp2.copy(0,0,sizePreviewW,sizePreviewH));\n }else{\n lab->setPixmap(imtmp2);\n }\n info->setResolution(imtmp.width(),imtmp.height());\n preview->updateImage(imtmp);\n}\n\n\/\/Function to watch the global shortcut SPACE that is for showing preview\nvoid myWindows::keyboardEvent(){\n \/\/qDebug() << \"SPACE \";\n if (preview->showing) {\n preview->hidePreview();\n } else {\n if (lastImagePath != NULL) {\n preview->showImage(lastImagePath);\n preview->activateWindow();\n }\n }\n}\n\n\/\/Function to watch the global shortcut SPACE that is for opening the file with default app\nvoid myWindows::keyboardEnter(){\n \/\/qDebug() << \"ENTER \";\n QDesktopServices::openUrl(QUrl::fromLocalFile(lastFilePath));\n}\n\n\/\/Debug funtion to show all keyboard event\nvoid myWindows::keyPressEvent(QKeyEvent* event) {\n if (event->key() == Qt::Key_Shift) {\n \/\/qDebug() << \"Key Shift\";\n isShiftOn = true;\n }\n}\n\nvoid myWindows::rename(){\n bool ok;\n QString text = QInputDialog::getText(this, tr(\"Renamming\"), tr(\"base name:\"), QLineEdit::Normal,\"\", &ok);\n int num = 0;\n if (ok){\n for (int var = 0; var < shiftList.length(); ++var) {\n _rename(shiftList.at(var),text,&num);\n }\n }\n}\n\nvoid myWindows::_rename(QString path, QString newName,int *num){\n QFileInfo tmp(path);\n if (tmp.isFile()) {\n QFile file(path);\n QString newConstructedName = tmp.canonicalPath()+QDir::separator()+newName;\n \/\/If the name if something XXX-01 else 01\n if (newName != \"\") {\n newConstructedName += \"-\";\n }\n if (*num >= 10) {\n if (*num < 100) {\n newConstructedName += QString(\"0\");\n }\n } else {\n newConstructedName += QString(\"00\");\n }\n newConstructedName += QString::number(*num);\n \/\/if the file had an extension we keep it else nothing\n \/\/ prev.jpg -> XXX-01.jpg\n if (tmp.completeSuffix() != \"\") {\n newConstructedName += \".\"+tmp.completeSuffix();\n }\n file.rename(newConstructedName);\n *num = *num + 1;\n } else if (tmp.isDir()){\n \/\/If we have a dir we get folders and files inside and try to rename them\n QDir fold(path);\n QStringList elmts = fold.entryList(QDir::NoDotAndDotDot | QDir::Dirs | QDir::Files);\n for (int var = 0; var < elmts.length(); ++var) {\n _rename(path+QDir::separator()+elmts.at(var), newName ,num);\n }\n }\n}\n\nvoid myWindows::keyReleaseEvent(QKeyEvent* event)\n{\n if (event->key() == Qt::Key_Shift) {\n \/\/qDebug() <<\"You Release Key \" <<event->text();\n isShiftOn = false;\n }\n}\n\nvoid myWindows::loadSettings(){\n QSettings settings(\"IntCorpLightAssociation\", \"FileViewer\");\n lastPath = settings.value(\"lastPath\").toString();\n}\nvoid myWindows::saveSettings(){\n QSettings settings(\"IntCorpLightAssociation\", \"FileViewer\");\n settings.setValue(\"lastPath\", lastPath);\n}\n\nvoid myWindows::keyboardDel(){\n QMessageBox box;\n box.setText(\"Selected files\/folders will be eternally deleted !!\");\n box.setStandardButtons(QMessageBox::Ok | QMessageBox::Cancel);\n box.setWindowFlags(Qt::WindowStaysOnTopHint);\n box.setDefaultButton(QMessageBox::Ok);\n int ret = box.exec();\n if (ret == QMessageBox::Ok) {\n \/\/qDebug() << \"BIM \";\n for (int i = 0; i < shiftList.length(); ++i) {\n \/\/qDebug() << \"DELETE\" << shiftList.at(i);\n QFileInfo tmp(shiftList.at(i));\n if (tmp.isFile()) {\n QFile file(shiftList.at(i));\n if (!file.remove()) {\n qDebug()<<\"File not deleted: \"<<file.fileName();\n }\n } else {\n QDir folder(shiftList.at(i));\n if (!folder.removeRecursively()) {\n qDebug()<<\"Not all was deleted: \"<<folder.absolutePath();\n }\n }\n }\n \/\/qDebug() << \"\";\n }\n}\n\n\/\/To add coloration to folders\/files\n\/\/http:\/\/stackoverflow.com\/questions\/1397484\/custom-text-color-for-certain-indexes-in-qtreeview\n\n\/\/When the app is closed we saved what is necessary to save\nvoid myWindows::closeEvent(QCloseEvent*){\n saveSettings();\n}\n\nmyWindows::~myWindows(){\n delete eater;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <string> \n#include \"src\/Options.hpp\"\n#include \"src\/Cluster.hpp\"\n\n\n\nusing namespace std;\nint main(int argc, char *argv[]){\n\n \/* data printed into *\/\n string path2data = \"..\/data\/\";\n \/* material constants *\/\n double young_modulus = 10000;\n double poissons_ratio = 0.3;\n \/* linear solver *\/\n double pardiso_0_dissection_1 = 0;\n int print_matrices = 0;\n int typeBc = 0; \/\/ 0 - corners, 2 - all (1 reserved for 'null-space case')\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\n cout << argv[0] << endl;\n Options options;\n options.set_values(path2data, argc, argv,\n young_modulus, poissons_ratio,\n pardiso_0_dissection_1,print_matrices,typeBc);\n Cluster cluster(options);\n cout << \"----------------- done -----------------\\n\" ;\n return 0;\n}\n<commit_msg>dissection preset as tool for factorization<commit_after>#include <iostream>\n#include <string> \n#include \"src\/Options.hpp\"\n#include \"src\/Cluster.hpp\"\n\n\n\nusing namespace std;\nint main(int argc, char *argv[]){\n\n \/* data printed into *\/\n string path2data = \"..\/data\/\";\n \/* material constants *\/\n double young_modulus = 10000;\n double poissons_ratio = 0.3;\n \/* linear solver *\/\n double pardiso_0_dissection_1 = 1;\n int print_matrices = 0;\n int typeBc = 0; \/\/ 0 - corners, 2 - all (1 reserved for 'null-space case')\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\n cout << argv[0] << endl;\n Options options;\n options.set_values(path2data, argc, argv,\n young_modulus, poissons_ratio,\n pardiso_0_dissection_1,print_matrices,typeBc);\n Cluster cluster(options);\n cout << \"----------------- done -----------------\\n\" ;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"main.h\"\n#include \"Robot.h\"\n#include <QApplication>\n\nint main(int argc, char **argv)\n{\n\n\t(void)argc; \/\/ avoid unused variable warnings\n\n\t\/*\n\t * Our display window\n\t * This has a trackbar at the top to select views\n\t *\/\n\tcvNamedWindow(\"display\", 0);\n\n\t\/*\n\t * Start robot main loop in a thread\n\t * (do vision processing, sensors, and drive control)\n\t *\/\n\tchar* input = (argc > 1) ? argv[1] : NULL;\n\tRobot r(input);\n\tr.startRobotThread(&r); \/\/ this doesn't return\n\n\treturn 0;\n}\n\n<commit_msg><commit_after>#include \"main.h\"\n#include \"Robot.h\"\n#include <QApplication>\n\nint main(int argc, char **argv)\n{\n\n\t(void)argc; \/\/ avoid unused variable warnings\n\n\t\/*\n\t * Our display window\n\t * This has a trackbar at the top to select views\n\t *\/\n\tcvNamedWindow(\"display\", 0);\n\n\t\/*\n\t * Start robot main loop in a thread\n\t * (do vision processing, sensors, and drive control)\n\t *\/\n\t\/\/char* input = (argc > 1) ? argv[1] : NULL\n\tRobot r(argv[1]);\n\tr.startRobotThread(&r); \/\/ this doesn't return\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: CompositeIteratorTraits_test.C,v 1.1 2003\/06\/19 10:45:51 oliver Exp $\n\/\/\n\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <BALL\/CONCEPT\/composite.h>\n#include <BALL\/KERNEL\/iterator.h>\n#include <BALL\/CONCEPT\/predicate.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\nclass MyPred\n\t:\tpublic UnaryPredicate<Composite>\n{\n\tpublic:\n\tMyPred(const Composite& my_comp)\n\t\t:\tcomposite_(&my_comp)\n\t{\n\t}\n\n\tvirtual bool operator () (const Composite& composite) const throw()\n\t{\n\t\treturn (&composite == composite_);\n\t}\n\t\n\tconst Composite* composite_;\n};\n\nclass True\n\t:\tpublic UnaryPredicate<Composite>\n{\n\tpublic:\n\tvirtual bool operator () (const Composite&) const throw() { return true; }\n};\n\nSTART_TEST(CompositeIteratorTraits, \"$Id: CompositeIteratorTraits_test.C,v 1.1 2003\/06\/19 10:45:51 oliver Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCompositeIteratorTraits* cit_ptr = 0;\nCHECK(CompositeIteratorTraits() throw())\n\tcit_ptr = new CompositeIteratorTraits;\n\tTEST_NOT_EQUAL(cit_ptr, 0)\nRESULT\n\nCHECK(~CompositeIteratorTraits() throw())\n\tdelete cit_ptr;\nRESULT\n\nCHECK(Composite* getContainer() throw())\n\tCompositeIteratorTraits t;\n\tTEST_EQUAL(t.getContainer(), 0)\nRESULT\n\nComposite a;\nComposite b;\nComposite c;\nComposite d;\nComposite e;\nComposite f;\na.appendChild(b);\na.appendChild(c);\na.appendChild(d);\nc.appendChild(e);\nc.appendChild(f);\n\n\n\nCHECK(CompositeIteratorTraits(const Composite& composite) throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\n\tTEST_EQUAL(p(a), false)\n\tTEST_EQUAL(p(b), false)\n\tTEST_EQUAL(p(c), true)\n\tTEST_EQUAL(p(d), false)\n\tTEST_EQUAL(p(e), false)\n\tTEST_EQUAL(p(f), false)\n\n\tSTATUS(\" &a = \" << (void*)&a)\n\tSTATUS(\" &b = \" << (void*)&b)\n\tSTATUS(\" &c = \" << (void*)&c)\n\tSTATUS(\" &d = \" << (void*)&d)\n\tSTATUS(\" &e = \" << (void*)&e)\n\tSTATUS(\" &f = \" << (void*)&f)\n\t\n\tt.setPredicate(p);\n\tt.toBegin();\n\tTEST_EQUAL(t.isValid(), true)\n\tTEST_EQUAL(&t.getData(), &c)\n\tt.forward();\n\tTEST_EQUAL(t.isValid(), false)\n\tTEST_EQUAL(&t.getData(), 0)\n\tTEST_EQUAL(t.getPredicate(), &p)\n\tTEST_EQUAL(t.isEnd(), true)\nRESULT\n\nCHECK(Composite& getData() throw())\n \/\/ ???\nRESULT\n\nCHECK(Composite::SubcompositeIterator& getPosition() throw())\n \/\/ ???\nRESULT\n\nCHECK(CompositeIteratorTraits& operator = (const CompositeIteratorTraits& traits) throw())\n \/\/ ???\nRESULT\n\nCHECK(CompositeIteratorTraits(const CompositeIteratorTraits& traits) throw())\n \/\/ ???\nRESULT\n\nCHECK(void toBegin() throw(Exception::Precondition))\n \/\/ ???\nRESULT\n\nCHECK(void toEnd() throw(Exception::Precondition))\n \/\/ ???\nRESULT\n\nCHECK(bool isBegin() const throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\tt.setPredicate(p);\n\n\tt.toBegin();\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.forward();\n\tTEST_EQUAL(t.isBegin(), false)\nRESULT\n\nCHECK(bool isEnd() const throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\tt.setPredicate(p);\n\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.toEnd();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\n\tTrue my_true;\n\tt.setPredicate(my_true);\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.toEnd();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\n\tComposite empty;\n\tt = CompositeIteratorTraits(empty);\n\tt.setPredicate(my_true);\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.forward();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\tt.backward();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\nRESULT\n\nCHECK(bool isRBegin() const throw())\n \/\/ ???\nRESULT\n\nCHECK(bool isREnd() const throw())\n \/\/ ???\nRESULT\n\nCHECK(bool isSingular() const throw())\n \/\/ ???\nRESULT\n\nCHECK(bool isValid() const throw())\n \/\/ ???\nRESULT\n\nCHECK(bool operator != (const CompositeIteratorTraits& traits) const throw())\n \/\/ ???\nRESULT\n\nCHECK(bool operator == (const CompositeIteratorTraits& traits) const throw())\n \/\/ ???\nRESULT\n\nCHECK(const Composite& getData() const throw())\n \/\/ ???\nRESULT\n\nCHECK(const Composite* getContainer() const throw())\n \/\/ ???\nRESULT\n\nCHECK(const Composite::SubcompositeIterator& getPosition() const throw())\n \/\/ ???\nRESULT\n\nCHECK(const UnaryPredicate<Composite>* getPredicate() const throw())\n \/\/ ???\nRESULT\n\nCHECK(void backward() throw())\n \/\/ ???\nRESULT\n\nCHECK(void forward() throw())\n \/\/ ???\nRESULT\n\nCHECK(void invalidate() throw())\n \/\/ ???\nRESULT\n\nCHECK(void setPredicate(const UnaryPredicate<Composite>& predicate) throw())\n \/\/ ???\nRESULT\n\nCHECK(void toRBegin() throw(Exception::Precondition))\n \/\/ ???\nRESULT\n\nCHECK(void toREnd() throw(Exception::Precondition))\n \/\/ ???\nRESULT\n\n\nCHECK([EXTRA] Iteration)\n\tComposite ac1;\n\tComposite ac2;\n\tac1.appendChild(ac2);\n\tComposite a1;\n\tComposite a2;\n\tac2.appendChild(a1);\n\tac1.appendChild(a2);\n\tTrue my_true;\n\n\tSTATUS(\" ac1 = \" << &ac1)\n\tSTATUS(\" ac2 = \" << &ac2)\n\tSTATUS(\" a1 = \" << &a1)\n\tSTATUS(\" a2 = \" << &a2)\n\t\n\tCompositeIteratorTraits t1(ac1);\n\tt1.setPredicate(my_true);\n\tt1.toBegin();\n\twhile (!t1.isEnd())\n\t{\n\t\tTEST_EQUAL((ac1.isAncestorOf(t1.getData()) || (&t1.getData() == &ac1)), true)\n\t\tSTATUS(\" - \" << &t1.getData())\n\t\tt1.forward();\n\t}\n\n\tCompositeIteratorTraits t2(ac2);\n\tt2.setPredicate(my_true);\n\tt2.toBegin();\n\twhile (!t2.isEnd())\n\t{\n\t\tSTATUS(\" - \" << &t2.getData())\n\t\tTEST_EQUAL((ac2.isAncestorOf(t2.getData()) || (&t2.getData() == &ac2)), true)\n\t\tt2.forward();\n\t}\n\n\tComposite single;\n\tCompositeIteratorTraits t3(single);\n\tt3.setPredicate(my_true);\n\tt3.toBegin();\n\tTEST_EQUAL(t3.isBegin(), true)\n\tTEST_EQUAL(t3.isEnd(), false)\n\tTEST_EQUAL(t3.isValid(), true)\n\tTEST_EQUAL(t3.isSingular(), false)\n\tTEST_EQUAL(&t3.getData(), &single)\n\tt3.forward();\n\tTEST_EQUAL(t3.isEnd(), true)\n\tTEST_EQUAL(t3.isBegin(), false)\n\tTEST_EQUAL(t3.isValid(), false)\n\tTEST_EQUAL(t3.isSingular(), false)\n\tTEST_EQUAL(&t3.getData(), 0)\n\t\n\tComposite root;\n\troot.appendChild(single);\n\tCompositeIteratorTraits t4(single);\n\tt4.setPredicate(my_true);\n\tt4.toBegin();\n\tTEST_EQUAL(t4.isBegin(), true)\n\tTEST_EQUAL(t4.isEnd(), false)\n\tTEST_EQUAL(t4.isValid(), true)\n\tTEST_EQUAL(t4.isSingular(), false)\n\tTEST_EQUAL(&t4.getData(), &single)\n\tt4.forward();\n\tTEST_EQUAL(t4.isEnd(), true)\n\tTEST_EQUAL(t4.isBegin(), false)\n\tTEST_EQUAL(t4.isValid(), false)\n\tTEST_EQUAL(t4.isSingular(), false)\n\tTEST_EQUAL(&t4.getData(), 0)\t\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nEND_TEST\n\n<commit_msg>added tests<commit_after>\/\/ -*- Mode: C++; tab-width: 2; -*-\n\/\/ vi: set ts=2:\n\/\/\n\/\/ $Id: CompositeIteratorTraits_test.C,v 1.2 2004\/02\/24 18:37:39 anker Exp $\n\/\/\n\n#include <BALL\/CONCEPT\/classTest.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <BALL\/CONCEPT\/composite.h>\n#include <BALL\/KERNEL\/iterator.h>\n#include <BALL\/CONCEPT\/predicate.h>\n#include <BALL\/KERNEL\/standardPredicates.h>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nusing namespace BALL;\n\nclass MyPred\n\t:\tpublic UnaryPredicate<Composite>\n{\n\tpublic:\n\tMyPred(const Composite& my_comp)\n\t\t:\tcomposite_(&my_comp)\n\t{\n\t}\n\n\tvirtual bool operator () (const Composite& composite) const throw()\n\t{\n\t\treturn (&composite == composite_);\n\t}\n\t\n\tconst Composite* composite_;\n};\n\nclass True\n\t:\tpublic UnaryPredicate<Composite>\n{\n\tpublic:\n\tvirtual bool operator () (const Composite&) const throw() { return true; }\n};\n\nSTART_TEST(CompositeIteratorTraits, \"$Id: CompositeIteratorTraits_test.C,v 1.2 2004\/02\/24 18:37:39 anker Exp $\")\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCompositeIteratorTraits* cit_ptr = 0;\nCHECK(CompositeIteratorTraits() throw())\n\tcit_ptr = new CompositeIteratorTraits;\n\tTEST_NOT_EQUAL(cit_ptr, 0)\nRESULT\n\nCHECK(~CompositeIteratorTraits() throw())\n\tdelete cit_ptr;\nRESULT\n\nCHECK(Composite* getContainer() throw())\n\tCompositeIteratorTraits t;\n\tTEST_EQUAL(t.getContainer(), 0)\nRESULT\n\nComposite a;\nComposite b;\nComposite c;\nComposite d;\nComposite e;\nComposite f;\na.appendChild(b);\na.appendChild(c);\na.appendChild(d);\nc.appendChild(e);\nc.appendChild(f);\n\nCHECK(CompositeIteratorTraits(const Composite& composite) throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\n\tTEST_EQUAL(p(a), false)\n\tTEST_EQUAL(p(b), false)\n\tTEST_EQUAL(p(c), true)\n\tTEST_EQUAL(p(d), false)\n\tTEST_EQUAL(p(e), false)\n\tTEST_EQUAL(p(f), false)\n\n\tSTATUS(\" &a = \" << (void*)&a)\n\tSTATUS(\" &b = \" << (void*)&b)\n\tSTATUS(\" &c = \" << (void*)&c)\n\tSTATUS(\" &d = \" << (void*)&d)\n\tSTATUS(\" &e = \" << (void*)&e)\n\tSTATUS(\" &f = \" << (void*)&f)\n\t\n\tt.setPredicate(p);\n\tt.toBegin();\n\tTEST_EQUAL(t.isValid(), true)\n\tTEST_EQUAL(&t.getData(), &c)\n\tt.forward();\n\tTEST_EQUAL(t.isValid(), false)\n\tTEST_EQUAL(&t.getData(), 0)\n\tTEST_EQUAL(t.getPredicate(), &p)\n\tTEST_EQUAL(t.isEnd(), true)\nRESULT\n\nCHECK(Composite& getData() throw())\n\tCompositeIteratorTraits cit(a);\n\tComposite* composite = &cit.getData();\n\tTEST_EQUAL((composite == &a), true)\nRESULT\n\nCHECK(Composite::CompositeIterator& getPosition() throw())\n\tCompositeIteratorTraits cit(a);\n\tComposite* composite = &cit.getData();\n\tTEST_EQUAL((composite == &a), true)\nRESULT\n\nCHECK(CompositeIteratorTraits& operator = (const CompositeIteratorTraits& traits) throw())\n\tCompositeIteratorTraits cit1(a);\n\tCompositeIteratorTraits cit2;\n\tcit2 = cit1;\n\tTEST_EQUAL((cit1 == cit2), true)\nRESULT\n\nCHECK(CompositeIteratorTraits(const CompositeIteratorTraits& traits) throw())\n\tCompositeIteratorTraits cit1(a);\n\tCompositeIteratorTraits cit2(cit1);\n\tTEST_EQUAL((cit1 == cit2), true)\nRESULT\n\nCHECK(void toBegin() throw(Exception::Precondition))\n\tCompositeIteratorTraits cit(a);\n\tMyPred p(c);\n\tcit.setPredicate(p);\n\tcit.forward();\n\tTEST_EQUAL((&cit.getData() == &c), true)\n\tcit.toBegin();\n\tTEST_EQUAL((&cit.getData() == &c), true)\nRESULT\n\nCHECK(void toEnd() throw(Exception::Precondition))\n\tCompositeIteratorTraits cit(a);\n\tcit.toEnd();\n\t\/\/ TEST_EQUAL((BLUBB == &f), true)\nRESULT\n\nCHECK(bool isBegin() const throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\tt.setPredicate(p);\n\n\tt.toBegin();\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.forward();\n\tTEST_EQUAL(t.isBegin(), false)\nRESULT\n\nCHECK(bool isEnd() const throw())\n\tCompositeIteratorTraits t(a);\n\tTEST_EQUAL(t.getContainer(), &a)\n\tMyPred p(c);\n\tt.setPredicate(p);\n\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.toEnd();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\n\tTrue my_true;\n\tt.setPredicate(my_true);\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.toEnd();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\n\tComposite empty;\n\tt = CompositeIteratorTraits(empty);\n\tt.setPredicate(my_true);\n\tt.toBegin();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\n\tt.forward();\n\tTEST_EQUAL(t.isEnd(), true)\n\tTEST_EQUAL(t.isBegin(), false)\n\tt.backward();\n\tTEST_EQUAL(t.isEnd(), false)\n\tTEST_EQUAL(t.isBegin(), true)\nRESULT\n\nCHECK(bool isRBegin() const throw())\n\tCompositeIteratorTraits cit(a);\n\tMyPred p(c);\n\tcit.setPredicate(p);\n\tTEST_EQUAL(cit.isRBegin(), false)\n\tcit.toRBegin();\n\tTEST_EQUAL(cit.isRBegin(), true)\nRESULT\n\nCHECK(bool isREnd() const throw())\n\tCompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tcit.forward();\n\tTEST_EQUAL(cit.isREnd(), false)\n\tcit.toREnd();\n\tTEST_EQUAL(cit.isREnd(), true)\nRESULT\n\nCHECK(bool isSingular() const throw())\n\tCompositeIteratorTraits cit1;\n\tTEST_EQUAL(cit1.isSingular(), true)\n\tCompositeIteratorTraits cit2(a);\n\tTEST_EQUAL(cit2.isSingular(), false)\nRESULT\n\nCHECK(bool isValid() const throw())\n\tCompositeIteratorTraits cit1;\n\tTEST_EQUAL(cit1.isValid(), false)\n\tCompositeIteratorTraits cit2(a);\n\tTEST_EQUAL(cit2.isValid(), true)\nRESULT\n\nCHECK(bool operator != (const CompositeIteratorTraits& traits) const throw())\n\tCompositeIteratorTraits cit1(a);\n\tTrue tp;\n\tcit1.setPredicate(tp);\n\tCompositeIteratorTraits cit2;\n\tcit2.setPredicate(tp);\n\tTEST_EQUAL((cit1 != cit2), true)\n\tCompositeIteratorTraits cit3(a);\n\tcit3.setPredicate(tp);\n\tTEST_EQUAL((cit1 != cit3), false)\nRESULT\n\nCHECK(bool operator == (const CompositeIteratorTraits& traits) const throw())\n\tCompositeIteratorTraits cit1(a);\n\tTrue tp;\n\tcit1.setPredicate(tp);\n\tCompositeIteratorTraits cit2;\n\tcit2.setPredicate(tp);\n\tTEST_EQUAL((cit1 == cit2), false)\n\tCompositeIteratorTraits cit3(a);\n\tcit3.setPredicate(tp);\n\tTEST_EQUAL((cit1 == cit3), true)\nRESULT\n\nCHECK(const Composite& getData() const throw())\n\tCompositeIteratorTraits cit(a);\n\tconst Composite& composite = cit.getData();\n\tTEST_EQUAL((&composite == &a), true)\nRESULT\n\nCHECK(const Composite* getContainer() const throw())\n\tCompositeIteratorTraits t;\n\tconst Composite* composite_const_ptr = t.getContainer();\n\tTEST_EQUAL(composite_const_ptr, 0)\nRESULT\n\nCHECK(const Composite::CompositeIterator& getPosition() const throw())\n\tCompositeIteratorTraits cit(a);\n\tconst Composite* composite_const_ptr = &cit.getData();\n\tTEST_EQUAL((composite_const_ptr == &a), true)\nRESULT\n\nCHECK(const UnaryPredicate<Composite>* getPredicate() const throw())\n\tCompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tconst UnaryPredicate<Composite>* predicate_const_ptr = cit.getPredicate();\n\tTEST_EQUAL(predicate_const_ptr, &tp)\nRESULT\n\nCHECK(void backward() throw())\n\tCompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tTEST_EQUAL((&cit.getData() == &a), true)\n\tcit.toRBegin();\n\tcit.backward();\n\tTEST_EQUAL((&cit.getData() == &f), true)\nRESULT\n\nCHECK(void forward() throw())\n\tCompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tTEST_EQUAL((&cit.getData() == &a), true)\n\tcit.forward();\n\tTEST_EQUAL((&cit.getData() == &b), true)\n\tMyPred f_predicate(f);\n\tcit.setPredicate(f_predicate);\n\tcit.forward();\n\tTEST_EQUAL((&cit.getData() == &f), true)\nRESULT\n\nCHECK(void invalidate() throw())\n\tCompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tTEST_EQUAL(cit.isValid(), true)\n\tcit.invalidate();\n\tTEST_EQUAL(cit.isValid(), false)\nRESULT\n\nCHECK(void setPredicate(const UnaryPredicate<Composite>& predicate) throw())\n\tCompositeIteratorTraits cit(a);\n\tMyPred c_predicate(c);\n\tcit.setPredicate(c_predicate);\n\tTEST_EQUAL(cit.getPredicate(), &c_predicate)\nRESULT\n\nCHECK(void toRBegin() throw(Exception::Precondition))\n CompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tTEST_EQUAL(cit.isRBegin(), false)\n\tcit.toRBegin();\n\tTEST_EQUAL(cit.isRBegin(), true)\nRESULT\n\nCHECK(void toREnd() throw(Exception::Precondition))\n CompositeIteratorTraits cit(a);\n\tTrue tp;\n\tcit.setPredicate(tp);\n\tTEST_EQUAL(cit.isREnd(), true)\n\tcit.forward();\n\tTEST_EQUAL(cit.isREnd(), false)\n\tcit.toREnd();\n\tTEST_EQUAL(cit.isREnd(), true)\nRESULT\n\n\nCHECK([EXTRA] Iteration)\n\tComposite ac1;\n\tComposite ac2;\n\tac1.appendChild(ac2);\n\tComposite a1;\n\tComposite a2;\n\tac2.appendChild(a1);\n\tac1.appendChild(a2);\n\tTrue my_true;\n\n\tSTATUS(\" ac1 = \" << &ac1)\n\tSTATUS(\" ac2 = \" << &ac2)\n\tSTATUS(\" a1 = \" << &a1)\n\tSTATUS(\" a2 = \" << &a2)\n\t\n\tCompositeIteratorTraits t1(ac1);\n\tt1.setPredicate(my_true);\n\tt1.toBegin();\n\twhile (!t1.isEnd())\n\t{\n\t\tTEST_EQUAL((ac1.isAncestorOf(t1.getData()) || (&t1.getData() == &ac1)), true)\n\t\tSTATUS(\" - \" << &t1.getData())\n\t\tt1.forward();\n\t}\n\n\tCompositeIteratorTraits t2(ac2);\n\tt2.setPredicate(my_true);\n\tt2.toBegin();\n\twhile (!t2.isEnd())\n\t{\n\t\tSTATUS(\" - \" << &t2.getData())\n\t\tTEST_EQUAL((ac2.isAncestorOf(t2.getData()) || (&t2.getData() == &ac2)), true)\n\t\tt2.forward();\n\t}\n\n\tComposite single;\n\tCompositeIteratorTraits t3(single);\n\tt3.setPredicate(my_true);\n\tt3.toBegin();\n\tTEST_EQUAL(t3.isBegin(), true)\n\tTEST_EQUAL(t3.isEnd(), false)\n\tTEST_EQUAL(t3.isValid(), true)\n\tTEST_EQUAL(t3.isSingular(), false)\n\tTEST_EQUAL(&t3.getData(), &single)\n\tt3.forward();\n\tTEST_EQUAL(t3.isEnd(), true)\n\tTEST_EQUAL(t3.isBegin(), false)\n\tTEST_EQUAL(t3.isValid(), false)\n\tTEST_EQUAL(t3.isSingular(), false)\n\tTEST_EQUAL(&t3.getData(), 0)\n\t\n\tComposite root;\n\troot.appendChild(single);\n\tCompositeIteratorTraits t4(single);\n\tt4.setPredicate(my_true);\n\tt4.toBegin();\n\tTEST_EQUAL(t4.isBegin(), true)\n\tTEST_EQUAL(t4.isEnd(), false)\n\tTEST_EQUAL(t4.isValid(), true)\n\tTEST_EQUAL(t4.isSingular(), false)\n\tTEST_EQUAL(&t4.getData(), &single)\n\tt4.forward();\n\tTEST_EQUAL(t4.isEnd(), true)\n\tTEST_EQUAL(t4.isBegin(), false)\n\tTEST_EQUAL(t4.isValid(), false)\n\tTEST_EQUAL(t4.isSingular(), false)\n\tTEST_EQUAL(&t4.getData(), 0)\t\nRESULT\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nEND_TEST\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * BPBase.cpp\n *\n * Created on: Sep 5, 2019\n * Author: William F Godoy godoywf@ornl.gov\n *\/\n\n#include \"BPBase.h\"\n#include \"BPBase.tcc\"\n\n#include \"adios2\/helper\/adiosFunctions.h\"\n\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPBZIP2.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPBlosc.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPMGARD.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPPNG.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPSZ.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPZFP.h\"\n\nnamespace adios2\n{\nnamespace format\n{\n\n\/\/ PUBLIC\nBPBase::SerialElementIndex::SerialElementIndex(const uint32_t memberID,\n const size_t bufferSize)\n: MemberID(memberID)\n{\n Buffer.reserve(bufferSize);\n}\n\nBPBase::Minifooter::Minifooter(const int8_t version) : Version(version) {}\n\nBPBase::BPBase(helper::Comm const &comm, const bool debugMode)\n: m_Comm(comm), m_DebugMode(debugMode)\n{\n m_RankMPI = m_Comm.Rank();\n m_SizeMPI = m_Comm.Size();\n m_Profiler.m_IsActive = true; \/\/ default\n}\n\nvoid BPBase::Init(const Params ¶meters, const std::string hint)\n{\n \/\/ Parse Parameters\n for (const auto ¶meter : parameters)\n {\n const std::string key = helper::LowerCase(parameter.first);\n const std::string value = helper::LowerCase(parameter.second);\n\n if (key == \"profile\")\n {\n m_Profiler.m_IsActive = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=Profile \" + hint);\n }\n else if (key == \"profileunits\")\n {\n m_Parameters.ProfileUnit =\n helper::StringToTimeUnit(value, m_DebugMode, hint);\n }\n else if (key == \"opentimeoutsecs\")\n {\n m_Parameters.OpenTimeoutSecs = helper::StringTo<float>(\n value, m_DebugMode,\n \" in Parameter key=OpenTimeOutSecs \" + hint);\n\n if (m_Parameters.OpenTimeoutSecs < 0.0)\n {\n m_Parameters.OpenTimeoutSecs =\n std::numeric_limits<float>::max() \/ 10000;\n }\n }\n else if (key == \"beginsteppollingfrequencysecs\")\n {\n m_Parameters.BeginStepPollingFrequencySecs =\n helper::StringTo<float>(value, m_DebugMode,\n \" in Parameter key=OpenTimeOutSecs \" +\n hint);\n\n if (m_Parameters.BeginStepPollingFrequencySecs < 0.0)\n {\n m_Parameters.BeginStepPollingFrequencySecs = 1.0; \/\/ a second\n }\n m_Parameters.BeginStepPollingFrequencyIsSet = true;\n }\n else if (key == \"buffergrowthfactor\")\n {\n m_Parameters.GrowthFactor = helper::StringTo<float>(\n value, m_DebugMode,\n \" in Parameter key=BufferGrowthFactor \" + hint);\n }\n else if (key == \"initialbuffersize\")\n {\n \/\/ it will resize m_Data\n m_Parameters.InitialBufferSize = helper::StringToByteUnits(\n value, m_DebugMode,\n \"for Parameter key=InitialBufferSize, in call to Open\");\n\n if (m_DebugMode && m_Parameters.InitialBufferSize <\n DefaultInitialBufferSize) \/\/ 16384b\n {\n throw std::invalid_argument(\n \"ERROR: wrong value for Parameter key=InitialBufferSize, \"\n \"it must be larger than 16Kb (minimum default), \" +\n hint);\n }\n }\n else if (key == \"maxbuffersize\")\n {\n m_Parameters.MaxBufferSize = helper::StringToByteUnits(\n value, m_DebugMode,\n \"for Parameter key=MaxBufferSize, in call to Open\");\n }\n else if (key == \"threads\")\n {\n m_Parameters.Threads =\n static_cast<unsigned int>(helper::StringTo<uint32_t>(\n value, m_DebugMode, \" in Parameter key=Threads \" + hint));\n }\n else if (key == \"asynctasks\")\n {\n m_Parameters.AsyncTasks = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=AsyncTasks \" + hint);\n }\n else if (key == \"statslevel\")\n {\n m_Parameters.StatsLevel =\n static_cast<unsigned int>(helper::StringTo<uint32_t>(\n value, m_DebugMode,\n \" in Parameter key=StatsLevel \" + hint));\n if (m_DebugMode &&\n m_Parameters.StatsLevel > 5)\n {\n throw std::invalid_argument(\n \"ERROR: value for Parameter key=StatsLevel must be \"\n \"an integer in the range [0,5], \" +\n hint);\n }\n }\n else if (key == \"statsblocksize\")\n {\n m_Parameters.StatsBlockSize = helper::StringToSizeT(\n value, m_DebugMode, \" in Parameter key=StatsBlockSize \" + hint);\n }\n else if (key == \"collectivemetadata\")\n {\n m_Parameters.CollectiveMetadata = helper::StringTo<bool>(\n value, m_DebugMode,\n \" in Parameter key=CollectiveMetadata \" + hint);\n }\n else if (key == \"flushstepscount\")\n {\n m_Parameters.FlushStepsCount = helper::StringToSizeT(\n value, m_DebugMode,\n \" in Parameter key=FlushStepsCount \" + hint);\n }\n else if (key == \"substreams\")\n {\n int subStreams = static_cast<int>(helper::StringTo<int32_t>(\n value, m_DebugMode, \" in Parameter key=SubStreams \" + hint));\n\n if (subStreams < 1)\n {\n subStreams = 1;\n }\n else if (subStreams > m_SizeMPI)\n {\n subStreams = m_SizeMPI;\n }\n\n if (subStreams < m_SizeMPI)\n {\n m_Aggregator.Init(subStreams, m_Comm);\n }\n }\n else if (key == \"node-local\")\n {\n m_Parameters.NodeLocal = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=node-local \" + hint);\n }\n }\n\n \/\/ set timers if active\n if (m_Profiler.m_IsActive)\n {\n const TimeUnit timeUnit = m_Parameters.ProfileUnit;\n m_Profiler.m_Timers.emplace(\n \"buffering\", profiling::Timer(\"buffering\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"memcpy\", profiling::Timer(\"memcpy\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"minmax\", profiling::Timer(\"minmax\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"meta_sort_merge\",\n profiling::Timer(\"meta_sort_merge\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"aggregation\",\n profiling::Timer(\"aggregation\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"mkdir\", profiling::Timer(\"mkdir\", timeUnit, m_DebugMode));\n m_Profiler.m_Bytes.emplace(\"buffering\", 0);\n }\n\n \/\/ set initial buffer size\n m_Profiler.Start(\"buffering\");\n m_Data.Resize(m_Parameters.InitialBufferSize, hint);\n m_Profiler.Stop(\"buffering\");\n}\n\nBPBase::ResizeResult BPBase::ResizeBuffer(const size_t dataIn,\n const std::string hint)\n{\n m_Profiler.Start(\"buffering\");\n const size_t currentSize = m_Data.m_Buffer.size();\n const size_t requiredSize = dataIn + m_Data.m_Position;\n const size_t maxBufferSize = m_Parameters.MaxBufferSize;\n\n ResizeResult result = ResizeResult::Unchanged;\n\n if (dataIn > maxBufferSize)\n {\n throw std::runtime_error(\n \"ERROR: data size: \" +\n std::to_string(static_cast<float>(dataIn) \/ (1024. * 1024.)) +\n \" Mb is too large for adios2 bp MaxBufferSize=\" +\n std::to_string(static_cast<float>(maxBufferSize) \/\n (1024. * 1024.)) +\n \"Mb, try increasing MaxBufferSize in call to IO SetParameters \" +\n hint + \"\\n\");\n }\n\n if (requiredSize <= currentSize)\n {\n \/\/ do nothing, unchanged is default\n }\n else if (requiredSize > maxBufferSize)\n {\n if (currentSize < maxBufferSize)\n {\n m_Data.Resize(maxBufferSize, \" when resizing buffer to \" +\n std::to_string(maxBufferSize) +\n \"bytes, \" + hint + \"\\n\");\n }\n result = ResizeResult::Flush;\n }\n else \/\/ buffer must grow\n {\n if (currentSize < maxBufferSize)\n {\n const float growthFactor = m_Parameters.GrowthFactor;\n const size_t nextSize = std::min(\n maxBufferSize, helper::NextExponentialSize(\n requiredSize, currentSize, growthFactor));\n m_Data.Resize(nextSize, \" when resizing buffer to \" +\n std::to_string(nextSize) + \"bytes, \" +\n hint);\n result = ResizeResult::Success;\n }\n }\n\n m_Profiler.Stop(\"buffering\");\n return result;\n}\n\nvoid BPBase::ResetBuffer(Buffer &buffer, const bool resetAbsolutePosition,\n const bool zeroInitialize)\n{\n m_Profiler.Start(\"buffering\");\n buffer.Reset(resetAbsolutePosition, zeroInitialize);\n m_Profiler.Stop(\"buffering\");\n}\n\n\/\/ PROTECTED\nstd::vector<uint8_t>\nBPBase::GetTransportIDs(const std::vector<std::string> &transportsTypes) const\n noexcept\n{\n auto lf_GetTransportID = [](const std::string method) -> uint8_t {\n int id = METHOD_UNKNOWN;\n if (method == \"File_NULL\")\n {\n id = METHOD_NULL;\n }\n else if (method == \"File_POSIX\")\n {\n id = METHOD_POSIX;\n }\n else if (method == \"File_fstream\")\n {\n id = METHOD_FSTREAM;\n }\n else if (method == \"File_stdio\")\n {\n id = METHOD_FILE;\n }\n else if (method == \"WAN_zmq\")\n {\n id = METHOD_ZMQ;\n }\n\n return static_cast<uint8_t>(id);\n };\n\n std::vector<uint8_t> transportsIDs;\n transportsIDs.reserve(transportsTypes.size());\n\n for (const std::string transportType : transportsTypes)\n {\n transportsIDs.push_back(lf_GetTransportID(transportType));\n }\n\n return transportsIDs;\n}\n\nsize_t BPBase::GetProcessGroupIndexSize(const std::string name,\n const std::string timeStepName,\n const size_t transportsSize) const\n noexcept\n{\n \/\/ pgIndex + list of methods (transports)\n const size_t pgSize =\n (name.length() + timeStepName.length() + 23) + (3 + transportsSize);\n return pgSize;\n}\n\nBPBase::ProcessGroupIndex\nBPBase::ReadProcessGroupIndexHeader(const std::vector<char> &buffer,\n size_t &position,\n const bool isLittleEndian) const noexcept\n{\n ProcessGroupIndex index;\n index.Length =\n helper::ReadValue<uint16_t>(buffer, position, isLittleEndian);\n index.Name = ReadBPString(buffer, position, isLittleEndian);\n index.IsColumnMajor =\n helper::ReadValue<char>(buffer, position, isLittleEndian);\n index.ProcessID =\n helper::ReadValue<int32_t>(buffer, position, isLittleEndian);\n index.StepName = ReadBPString(buffer, position, isLittleEndian);\n index.Step = helper::ReadValue<uint32_t>(buffer, position, isLittleEndian);\n index.Offset =\n helper::ReadValue<uint64_t>(buffer, position, isLittleEndian);\n return index;\n}\n\nstd::string BPBase::ReadBPString(const std::vector<char> &buffer,\n size_t &position,\n const bool isLittleEndian) const noexcept\n{\n const size_t size = static_cast<size_t>(\n helper::ReadValue<uint16_t>(buffer, position, isLittleEndian));\n\n if (size == 0)\n {\n return \"\";\n }\n\n const std::string values(&buffer[position], size);\n position += size;\n return values;\n}\n\n\/\/ static members\nconst std::set<std::string> BPBase::m_TransformTypes = {\n {\"unknown\", \"none\", \"identity\", \"bzip2\", \"sz\", \"zfp\", \"mgard\", \"png\",\n \"blosc\"}};\n\nconst std::map<int, std::string> BPBase::m_TransformTypesToNames = {\n {transform_unknown, \"unknown\"}, {transform_none, \"none\"},\n {transform_identity, \"identity\"}, {transform_sz, \"sz\"},\n {transform_zfp, \"zfp\"}, {transform_mgard, \"mgard\"},\n {transform_png, \"png\"}, {transform_bzip2, \"bzip2\"},\n {transform_blosc, \"blosc\"}};\n\nBPBase::TransformTypes\nBPBase::TransformTypeEnum(const std::string transformType) const noexcept\n{\n TransformTypes transformEnum = transform_unknown;\n\n for (const auto &pair : m_TransformTypesToNames)\n {\n if (pair.second == transformType)\n {\n transformEnum = static_cast<TransformTypes>(pair.first);\n break;\n }\n }\n return transformEnum;\n}\n\nstd::shared_ptr<BPOperation>\nBPBase::SetBPOperation(const std::string type) const noexcept\n{\n std::shared_ptr<BPOperation> bpOp;\n if (type == \"sz\")\n {\n bpOp = std::make_shared<BPSZ>();\n }\n else if (type == \"zfp\")\n {\n bpOp = std::make_shared<BPZFP>();\n }\n else if (type == \"mgard\")\n {\n bpOp = std::make_shared<BPMGARD>();\n }\n else if (type == \"bzip2\")\n {\n bpOp = std::make_shared<BPBZIP2>();\n }\n else if (type == \"png\")\n {\n bpOp = std::make_shared<BPPNG>();\n }\n else if (type == \"blosc\")\n {\n bpOp = std::make_shared<BPBlosc>();\n }\n\n return bpOp;\n}\n\nstd::map<size_t, std::shared_ptr<BPOperation>> BPBase::SetBPOperations(\n const std::vector<core::VariableBase::Operation> &operations) const\n{\n std::map<size_t, std::shared_ptr<BPOperation>> bpOperations;\n\n for (size_t i = 0; i < operations.size(); ++i)\n {\n const std::string type = operations[i].Op->m_Type;\n std::shared_ptr<BPOperation> bpOperation = SetBPOperation(type);\n\n if (bpOperation) \/\/ if the result is a supported type\n {\n bpOperations.emplace(i, bpOperation);\n }\n }\n return bpOperations;\n}\n\n#define declare_template_instantiation(T) \\\n template BPBase::Characteristics<T> \\\n BPBase::ReadElementIndexCharacteristics(const std::vector<char> &, \\\n size_t &, const BPBase::DataTypes, \\\n const bool, const bool) const;\n\nADIOS2_FOREACH_STDTYPE_1ARG(declare_template_instantiation)\n#undef declare_template_instantiation\n\n} \/\/ end namespace format\n} \/\/ end namespace adios2\n<commit_msg>fix clang-format<commit_after>\/*\n * Distributed under the OSI-approved Apache License, Version 2.0. See\n * accompanying file Copyright.txt for details.\n *\n * BPBase.cpp\n *\n * Created on: Sep 5, 2019\n * Author: William F Godoy godoywf@ornl.gov\n *\/\n\n#include \"BPBase.h\"\n#include \"BPBase.tcc\"\n\n#include \"adios2\/helper\/adiosFunctions.h\"\n\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPBZIP2.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPBlosc.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPMGARD.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPPNG.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPSZ.h\"\n#include \"adios2\/toolkit\/format\/bp\/bpOperation\/compress\/BPZFP.h\"\n\nnamespace adios2\n{\nnamespace format\n{\n\n\/\/ PUBLIC\nBPBase::SerialElementIndex::SerialElementIndex(const uint32_t memberID,\n const size_t bufferSize)\n: MemberID(memberID)\n{\n Buffer.reserve(bufferSize);\n}\n\nBPBase::Minifooter::Minifooter(const int8_t version) : Version(version) {}\n\nBPBase::BPBase(helper::Comm const &comm, const bool debugMode)\n: m_Comm(comm), m_DebugMode(debugMode)\n{\n m_RankMPI = m_Comm.Rank();\n m_SizeMPI = m_Comm.Size();\n m_Profiler.m_IsActive = true; \/\/ default\n}\n\nvoid BPBase::Init(const Params ¶meters, const std::string hint)\n{\n \/\/ Parse Parameters\n for (const auto ¶meter : parameters)\n {\n const std::string key = helper::LowerCase(parameter.first);\n const std::string value = helper::LowerCase(parameter.second);\n\n if (key == \"profile\")\n {\n m_Profiler.m_IsActive = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=Profile \" + hint);\n }\n else if (key == \"profileunits\")\n {\n m_Parameters.ProfileUnit =\n helper::StringToTimeUnit(value, m_DebugMode, hint);\n }\n else if (key == \"opentimeoutsecs\")\n {\n m_Parameters.OpenTimeoutSecs = helper::StringTo<float>(\n value, m_DebugMode,\n \" in Parameter key=OpenTimeOutSecs \" + hint);\n\n if (m_Parameters.OpenTimeoutSecs < 0.0)\n {\n m_Parameters.OpenTimeoutSecs =\n std::numeric_limits<float>::max() \/ 10000;\n }\n }\n else if (key == \"beginsteppollingfrequencysecs\")\n {\n m_Parameters.BeginStepPollingFrequencySecs =\n helper::StringTo<float>(value, m_DebugMode,\n \" in Parameter key=OpenTimeOutSecs \" +\n hint);\n\n if (m_Parameters.BeginStepPollingFrequencySecs < 0.0)\n {\n m_Parameters.BeginStepPollingFrequencySecs = 1.0; \/\/ a second\n }\n m_Parameters.BeginStepPollingFrequencyIsSet = true;\n }\n else if (key == \"buffergrowthfactor\")\n {\n m_Parameters.GrowthFactor = helper::StringTo<float>(\n value, m_DebugMode,\n \" in Parameter key=BufferGrowthFactor \" + hint);\n }\n else if (key == \"initialbuffersize\")\n {\n \/\/ it will resize m_Data\n m_Parameters.InitialBufferSize = helper::StringToByteUnits(\n value, m_DebugMode,\n \"for Parameter key=InitialBufferSize, in call to Open\");\n\n if (m_DebugMode && m_Parameters.InitialBufferSize <\n DefaultInitialBufferSize) \/\/ 16384b\n {\n throw std::invalid_argument(\n \"ERROR: wrong value for Parameter key=InitialBufferSize, \"\n \"it must be larger than 16Kb (minimum default), \" +\n hint);\n }\n }\n else if (key == \"maxbuffersize\")\n {\n m_Parameters.MaxBufferSize = helper::StringToByteUnits(\n value, m_DebugMode,\n \"for Parameter key=MaxBufferSize, in call to Open\");\n }\n else if (key == \"threads\")\n {\n m_Parameters.Threads =\n static_cast<unsigned int>(helper::StringTo<uint32_t>(\n value, m_DebugMode, \" in Parameter key=Threads \" + hint));\n }\n else if (key == \"asynctasks\")\n {\n m_Parameters.AsyncTasks = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=AsyncTasks \" + hint);\n }\n else if (key == \"statslevel\")\n {\n m_Parameters.StatsLevel =\n static_cast<unsigned int>(helper::StringTo<uint32_t>(\n value, m_DebugMode,\n \" in Parameter key=StatsLevel \" + hint));\n if (m_DebugMode && m_Parameters.StatsLevel > 5)\n {\n throw std::invalid_argument(\n \"ERROR: value for Parameter key=StatsLevel must be \"\n \"an integer in the range [0,5], \" +\n hint);\n }\n }\n else if (key == \"statsblocksize\")\n {\n m_Parameters.StatsBlockSize = helper::StringToSizeT(\n value, m_DebugMode, \" in Parameter key=StatsBlockSize \" + hint);\n }\n else if (key == \"collectivemetadata\")\n {\n m_Parameters.CollectiveMetadata = helper::StringTo<bool>(\n value, m_DebugMode,\n \" in Parameter key=CollectiveMetadata \" + hint);\n }\n else if (key == \"flushstepscount\")\n {\n m_Parameters.FlushStepsCount = helper::StringToSizeT(\n value, m_DebugMode,\n \" in Parameter key=FlushStepsCount \" + hint);\n }\n else if (key == \"substreams\")\n {\n int subStreams = static_cast<int>(helper::StringTo<int32_t>(\n value, m_DebugMode, \" in Parameter key=SubStreams \" + hint));\n\n if (subStreams < 1)\n {\n subStreams = 1;\n }\n else if (subStreams > m_SizeMPI)\n {\n subStreams = m_SizeMPI;\n }\n\n if (subStreams < m_SizeMPI)\n {\n m_Aggregator.Init(subStreams, m_Comm);\n }\n }\n else if (key == \"node-local\")\n {\n m_Parameters.NodeLocal = helper::StringTo<bool>(\n value, m_DebugMode, \" in Parameter key=node-local \" + hint);\n }\n }\n\n \/\/ set timers if active\n if (m_Profiler.m_IsActive)\n {\n const TimeUnit timeUnit = m_Parameters.ProfileUnit;\n m_Profiler.m_Timers.emplace(\n \"buffering\", profiling::Timer(\"buffering\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"memcpy\", profiling::Timer(\"memcpy\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"minmax\", profiling::Timer(\"minmax\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"meta_sort_merge\",\n profiling::Timer(\"meta_sort_merge\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"aggregation\",\n profiling::Timer(\"aggregation\", timeUnit, m_DebugMode));\n m_Profiler.m_Timers.emplace(\n \"mkdir\", profiling::Timer(\"mkdir\", timeUnit, m_DebugMode));\n m_Profiler.m_Bytes.emplace(\"buffering\", 0);\n }\n\n \/\/ set initial buffer size\n m_Profiler.Start(\"buffering\");\n m_Data.Resize(m_Parameters.InitialBufferSize, hint);\n m_Profiler.Stop(\"buffering\");\n}\n\nBPBase::ResizeResult BPBase::ResizeBuffer(const size_t dataIn,\n const std::string hint)\n{\n m_Profiler.Start(\"buffering\");\n const size_t currentSize = m_Data.m_Buffer.size();\n const size_t requiredSize = dataIn + m_Data.m_Position;\n const size_t maxBufferSize = m_Parameters.MaxBufferSize;\n\n ResizeResult result = ResizeResult::Unchanged;\n\n if (dataIn > maxBufferSize)\n {\n throw std::runtime_error(\n \"ERROR: data size: \" +\n std::to_string(static_cast<float>(dataIn) \/ (1024. * 1024.)) +\n \" Mb is too large for adios2 bp MaxBufferSize=\" +\n std::to_string(static_cast<float>(maxBufferSize) \/\n (1024. * 1024.)) +\n \"Mb, try increasing MaxBufferSize in call to IO SetParameters \" +\n hint + \"\\n\");\n }\n\n if (requiredSize <= currentSize)\n {\n \/\/ do nothing, unchanged is default\n }\n else if (requiredSize > maxBufferSize)\n {\n if (currentSize < maxBufferSize)\n {\n m_Data.Resize(maxBufferSize, \" when resizing buffer to \" +\n std::to_string(maxBufferSize) +\n \"bytes, \" + hint + \"\\n\");\n }\n result = ResizeResult::Flush;\n }\n else \/\/ buffer must grow\n {\n if (currentSize < maxBufferSize)\n {\n const float growthFactor = m_Parameters.GrowthFactor;\n const size_t nextSize = std::min(\n maxBufferSize, helper::NextExponentialSize(\n requiredSize, currentSize, growthFactor));\n m_Data.Resize(nextSize, \" when resizing buffer to \" +\n std::to_string(nextSize) + \"bytes, \" +\n hint);\n result = ResizeResult::Success;\n }\n }\n\n m_Profiler.Stop(\"buffering\");\n return result;\n}\n\nvoid BPBase::ResetBuffer(Buffer &buffer, const bool resetAbsolutePosition,\n const bool zeroInitialize)\n{\n m_Profiler.Start(\"buffering\");\n buffer.Reset(resetAbsolutePosition, zeroInitialize);\n m_Profiler.Stop(\"buffering\");\n}\n\n\/\/ PROTECTED\nstd::vector<uint8_t>\nBPBase::GetTransportIDs(const std::vector<std::string> &transportsTypes) const\n noexcept\n{\n auto lf_GetTransportID = [](const std::string method) -> uint8_t {\n int id = METHOD_UNKNOWN;\n if (method == \"File_NULL\")\n {\n id = METHOD_NULL;\n }\n else if (method == \"File_POSIX\")\n {\n id = METHOD_POSIX;\n }\n else if (method == \"File_fstream\")\n {\n id = METHOD_FSTREAM;\n }\n else if (method == \"File_stdio\")\n {\n id = METHOD_FILE;\n }\n else if (method == \"WAN_zmq\")\n {\n id = METHOD_ZMQ;\n }\n\n return static_cast<uint8_t>(id);\n };\n\n std::vector<uint8_t> transportsIDs;\n transportsIDs.reserve(transportsTypes.size());\n\n for (const std::string transportType : transportsTypes)\n {\n transportsIDs.push_back(lf_GetTransportID(transportType));\n }\n\n return transportsIDs;\n}\n\nsize_t BPBase::GetProcessGroupIndexSize(const std::string name,\n const std::string timeStepName,\n const size_t transportsSize) const\n noexcept\n{\n \/\/ pgIndex + list of methods (transports)\n const size_t pgSize =\n (name.length() + timeStepName.length() + 23) + (3 + transportsSize);\n return pgSize;\n}\n\nBPBase::ProcessGroupIndex\nBPBase::ReadProcessGroupIndexHeader(const std::vector<char> &buffer,\n size_t &position,\n const bool isLittleEndian) const noexcept\n{\n ProcessGroupIndex index;\n index.Length =\n helper::ReadValue<uint16_t>(buffer, position, isLittleEndian);\n index.Name = ReadBPString(buffer, position, isLittleEndian);\n index.IsColumnMajor =\n helper::ReadValue<char>(buffer, position, isLittleEndian);\n index.ProcessID =\n helper::ReadValue<int32_t>(buffer, position, isLittleEndian);\n index.StepName = ReadBPString(buffer, position, isLittleEndian);\n index.Step = helper::ReadValue<uint32_t>(buffer, position, isLittleEndian);\n index.Offset =\n helper::ReadValue<uint64_t>(buffer, position, isLittleEndian);\n return index;\n}\n\nstd::string BPBase::ReadBPString(const std::vector<char> &buffer,\n size_t &position,\n const bool isLittleEndian) const noexcept\n{\n const size_t size = static_cast<size_t>(\n helper::ReadValue<uint16_t>(buffer, position, isLittleEndian));\n\n if (size == 0)\n {\n return \"\";\n }\n\n const std::string values(&buffer[position], size);\n position += size;\n return values;\n}\n\n\/\/ static members\nconst std::set<std::string> BPBase::m_TransformTypes = {\n {\"unknown\", \"none\", \"identity\", \"bzip2\", \"sz\", \"zfp\", \"mgard\", \"png\",\n \"blosc\"}};\n\nconst std::map<int, std::string> BPBase::m_TransformTypesToNames = {\n {transform_unknown, \"unknown\"}, {transform_none, \"none\"},\n {transform_identity, \"identity\"}, {transform_sz, \"sz\"},\n {transform_zfp, \"zfp\"}, {transform_mgard, \"mgard\"},\n {transform_png, \"png\"}, {transform_bzip2, \"bzip2\"},\n {transform_blosc, \"blosc\"}};\n\nBPBase::TransformTypes\nBPBase::TransformTypeEnum(const std::string transformType) const noexcept\n{\n TransformTypes transformEnum = transform_unknown;\n\n for (const auto &pair : m_TransformTypesToNames)\n {\n if (pair.second == transformType)\n {\n transformEnum = static_cast<TransformTypes>(pair.first);\n break;\n }\n }\n return transformEnum;\n}\n\nstd::shared_ptr<BPOperation>\nBPBase::SetBPOperation(const std::string type) const noexcept\n{\n std::shared_ptr<BPOperation> bpOp;\n if (type == \"sz\")\n {\n bpOp = std::make_shared<BPSZ>();\n }\n else if (type == \"zfp\")\n {\n bpOp = std::make_shared<BPZFP>();\n }\n else if (type == \"mgard\")\n {\n bpOp = std::make_shared<BPMGARD>();\n }\n else if (type == \"bzip2\")\n {\n bpOp = std::make_shared<BPBZIP2>();\n }\n else if (type == \"png\")\n {\n bpOp = std::make_shared<BPPNG>();\n }\n else if (type == \"blosc\")\n {\n bpOp = std::make_shared<BPBlosc>();\n }\n\n return bpOp;\n}\n\nstd::map<size_t, std::shared_ptr<BPOperation>> BPBase::SetBPOperations(\n const std::vector<core::VariableBase::Operation> &operations) const\n{\n std::map<size_t, std::shared_ptr<BPOperation>> bpOperations;\n\n for (size_t i = 0; i < operations.size(); ++i)\n {\n const std::string type = operations[i].Op->m_Type;\n std::shared_ptr<BPOperation> bpOperation = SetBPOperation(type);\n\n if (bpOperation) \/\/ if the result is a supported type\n {\n bpOperations.emplace(i, bpOperation);\n }\n }\n return bpOperations;\n}\n\n#define declare_template_instantiation(T) \\\n template BPBase::Characteristics<T> \\\n BPBase::ReadElementIndexCharacteristics(const std::vector<char> &, \\\n size_t &, const BPBase::DataTypes, \\\n const bool, const bool) const;\n\nADIOS2_FOREACH_STDTYPE_1ARG(declare_template_instantiation)\n#undef declare_template_instantiation\n\n} \/\/ end namespace format\n} \/\/ end namespace adios2\n<|endoftext|>"} {"text":"<commit_before><commit_msg>ENG-16026 do not migrate migrated tuples<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>memory_resource still needs init_priority when built with GCC 4.9<commit_after><|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include \"lineplotprocessor.h\"\n\n#include <inviwo\/core\/datastructures\/geometry\/basicmesh.h>\n#include <inviwo\/core\/datastructures\/buffer\/bufferramprecision.h>\n#include <modules\/animation\/datastructures\/interpolation.h>\n\nnamespace inviwo {\n\nusing plot::DataFrame;\nusing plot::Column;\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo lineplotprocessor::processorInfo_{\n \"org.inviwo.lineplotprocessor\", \/\/ Class identifier\n \"lineplotprocessor\", \/\/ Display name\n \"Undefined\", \/\/ Category\n CodeState::Experimental, \/\/ Code state\n Tags::None, \/\/ Tags\n};\nconst ProcessorInfo lineplotprocessor::getProcessorInfo() const {\n return processorInfo_;\n}\n\nlineplotprocessor::lineplotprocessor()\n : Processor()\n , dataFrameInport_(\"dataFrameInport\")\n , meshOutport_(\"outport\")\n , position_(\"position\", \"Position\", vec3(0.0f), vec3(-100.0f), vec3(100.0f)) {\n\n addPort(dataFrameInport_);\n addPort(meshOutport_);\n addProperty(position_);\n}\n\nvoid lineplotprocessor::process() {\n std::shared_ptr<BasicMesh> mesh = std::make_shared<BasicMesh>();\n IndexBufferRAM* indices = mesh->addIndexBuffer(DrawType::Lines, ConnectivityType::None);\n\n \/\/auto p = Interpolation<vec3, float>::linear(vec3(0, 0, 0), , percent);\n\n\n std::shared_ptr<const DataFrame> inputFrame = dataFrameInport_.getData();\n\n \/\/ We want at least two columns. One named X and one named Y.\n if (inputFrame->getNumberOfColumns() >= 2) {\n std::shared_ptr<const Column> x = nullptr;\n std::shared_ptr<const Column> y = nullptr;\n\n \/\/ Find the columns named X and Y.\n for (size_t i = 0; i < inputFrame->getNumberOfColumns(); i++) {\n if (inputFrame->getHeader(i) == \"X\") {\n x = inputFrame->getColumn(i);\n } else if (inputFrame->getHeader(i) == \"Y\") {\n y = inputFrame->getColumn(i);\n }\n }\n\n if (!x) {\n LogError(\"Could not find any column named X in the DataFrame!\");\n return;\n }\n\n if (!y) {\n LogError(\"Could not fin dany column named Y in the DataFrame!\");\n return;\n }\n\n size_t y_size = y->getSize();\n size_t x_size = x->getSize();\n\n if (y_size != x_size) {\n LogError(\"The X and Y columns need to contain the same number\"\n \" of values!\");\n }\n\n if (y_size == 0 || x_size == 0) {\n return;\n }\n\n \/\/ Find the maximum and minimum values, respectively, and\n \/\/ normalise the data ranges to [0, 1].\n double x_min = x->getAsDouble(0);\n double y_min = y->getAsDouble(0);\n double x_max = x->getAsDouble(0);\n double y_max = y->getAsDouble(0);\n\n \/\/ x_size = y_size at this point, only need to check one.\n if (x_size > 1) {\n for (size_t i = 1; i < x_size; i++) {\n double x_val = x->getAsDouble(i);\n double y_val = y->getAsDouble(i);\n\n x_min = x_val < x_min ? x_val : x_min;\n y_min = y_val < y_min ? y_val : y_min;\n\n x_max = x_val > x_max ? x_val : x_max;\n y_max = y_val > y_max ? y_val : y_max;\n }\n }\n\n \/\/ Each line segment should start on the current point and end\n \/\/ at the next point. Subtract one from the end criteria,\n \/\/ since the last point is included when the segment is drawn\n \/\/ from the next-to-last point.\n for (size_t i = 0; i < x_size - 1; i++) {\n \/\/ Get coordinates and normalise to [0, 1].\n double x_start = (x->getAsDouble(i) - x_min) \/ (x_max - x_min);\n double y_start = (y->getAsDouble(i) - y_min) \/ (y_max - y_min);\n double x_end = (x->getAsDouble(i + 1) - x_min) \/ (x_max - x_min);\n double y_end = (y->getAsDouble(i + 1) - y_min) \/ (y_max - y_min);\n\n vec3 start_point = vec3(x_start, y_start, 0);\n indices->add(mesh->addVertex(start_point, start_point,\n start_point, vec4(255, 255, 255, 0)));\n\n vec3 end_point = vec3(x_end, y_end, 0);\n indices->add(mesh->addVertex(end_point, end_point,\n end_point, vec4(255, 255, 255, 0)));\n }\n } else {\n LogInfo(\"This processor needs two columns to exist in the DataFrame.\"\n \" One named X and one named Y.\")\n return;\n }\n\n meshOutport_.setData(mesh);\n}\n\n} \/\/ namespace\n\n<commit_msg>Prevent division by zero if all points are equal in one dimension.<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include \"lineplotprocessor.h\"\n\n#include <inviwo\/core\/datastructures\/geometry\/basicmesh.h>\n#include <inviwo\/core\/datastructures\/buffer\/bufferramprecision.h>\n#include <modules\/animation\/datastructures\/interpolation.h>\n\nnamespace inviwo {\n\nusing plot::DataFrame;\nusing plot::Column;\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo lineplotprocessor::processorInfo_{\n \"org.inviwo.lineplotprocessor\", \/\/ Class identifier\n \"lineplotprocessor\", \/\/ Display name\n \"Undefined\", \/\/ Category\n CodeState::Experimental, \/\/ Code state\n Tags::None, \/\/ Tags\n};\nconst ProcessorInfo lineplotprocessor::getProcessorInfo() const {\n return processorInfo_;\n}\n\nlineplotprocessor::lineplotprocessor()\n : Processor()\n , dataFrameInport_(\"dataFrameInport\")\n , meshOutport_(\"outport\")\n , position_(\"position\", \"Position\", vec3(0.0f), vec3(-100.0f), vec3(100.0f)) {\n\n addPort(dataFrameInport_);\n addPort(meshOutport_);\n addProperty(position_);\n}\n\nvoid lineplotprocessor::process() {\n std::shared_ptr<BasicMesh> mesh = std::make_shared<BasicMesh>();\n IndexBufferRAM* indices = mesh->addIndexBuffer(DrawType::Lines, ConnectivityType::None);\n\n \/\/auto p = Interpolation<vec3, float>::linear(vec3(0, 0, 0), , percent);\n\n\n std::shared_ptr<const DataFrame> inputFrame = dataFrameInport_.getData();\n\n \/\/ We want at least two columns. One named X and one named Y.\n if (inputFrame->getNumberOfColumns() >= 2) {\n std::shared_ptr<const Column> x = nullptr;\n std::shared_ptr<const Column> y = nullptr;\n\n \/\/ Find the columns named X and Y.\n for (size_t i = 0; i < inputFrame->getNumberOfColumns(); i++) {\n if (inputFrame->getHeader(i) == \"X\") {\n x = inputFrame->getColumn(i);\n } else if (inputFrame->getHeader(i) == \"Y\") {\n y = inputFrame->getColumn(i);\n }\n }\n\n if (!x) {\n LogError(\"Could not find any column named X in the DataFrame!\");\n return;\n }\n\n if (!y) {\n LogError(\"Could not fin dany column named Y in the DataFrame!\");\n return;\n }\n\n size_t y_size = y->getSize();\n size_t x_size = x->getSize();\n\n if (y_size != x_size) {\n LogError(\"The X and Y columns need to contain the same number\"\n \" of values!\");\n }\n\n if (y_size == 0 || x_size == 0) {\n return;\n }\n\n \/\/ Find the maximum and minimum values, respectively, and\n \/\/ normalise the data ranges to [0, 1].\n double x_min = x->getAsDouble(0);\n double y_min = y->getAsDouble(0);\n double x_max = x->getAsDouble(0);\n double y_max = y->getAsDouble(0);\n\n \/\/ x_size = y_size at this point, only need to check one.\n if (x_size > 1) {\n for (size_t i = 1; i < x_size; i++) {\n double x_val = x->getAsDouble(i);\n double y_val = y->getAsDouble(i);\n\n x_min = x_val < x_min ? x_val : x_min;\n y_min = y_val < y_min ? y_val : y_min;\n\n x_max = x_val > x_max ? x_val : x_max;\n y_max = y_val > y_max ? y_val : y_max;\n }\n }\n\n \/\/ If all values in one dimension have the same value we let\n \/\/ them normalise to one by setting the min values to zero.\n if (y_max == y_min) {\n y_min = 0;\n }\n\n if (x_max == x_min) {\n x_min = 0;\n }\n\n \/\/ Each line segment should start on the current point and end\n \/\/ at the next point. Subtract one from the end criteria,\n \/\/ since the last point is included when the segment is drawn\n \/\/ from the next-to-last point.\n for (size_t i = 0; i < x_size - 1; i++) {\n \/\/ Get coordinates and normalise to [0, 1].\n double x_start = (x->getAsDouble(i) - x_min) \/ (x_max - x_min);\n double y_start = (y->getAsDouble(i) - y_min) \/ (y_max - y_min);\n double x_end = (x->getAsDouble(i + 1) - x_min) \/ (x_max - x_min);\n double y_end = (y->getAsDouble(i + 1) - y_min) \/ (y_max - y_min);\n\n vec3 start_point = vec3(x_start, y_start, 0);\n indices->add(mesh->addVertex(start_point, start_point,\n start_point, vec4(255, 255, 255, 0)));\n\n vec3 end_point = vec3(x_end, y_end, 0);\n indices->add(mesh->addVertex(end_point, end_point,\n end_point, vec4(255, 255, 255, 0)));\n }\n } else {\n LogInfo(\"This processor needs two columns to exist in the DataFrame.\"\n \" One named X and one named Y.\")\n return;\n }\n\n meshOutport_.setData(mesh);\n}\n\n} \/\/ namespace\n\n<|endoftext|>"} {"text":"<commit_before>#include \"ClassWrapper.h\"\n#include \"JavaClassUtils.h\"\n#include \"JavaExceptionUtils.h\"\n#include \"JniWeakGlobalRef.h\"\n#include <string.h>\n\nnamespace spotify {\nnamespace jni {\n\nClassWrapper::~ClassWrapper() {\n \/\/ TODO: Delete mappings\n}\n\nbool ClassWrapper::isInitialized() const {\n return _clazz.get() != NULL;\n}\n\nconst char* ClassWrapper::getSimpleName() const {\n const char* lastSlash = strrchr(getCanonicalName(), '\/');\n return lastSlash != NULL ? lastSlash + 1 : getCanonicalName();\n}\n\nvoid ClassWrapper::merge(const ClassWrapper *globalInstance) {\n _clazz = globalInstance->_clazz;\n _methods = globalInstance->_methods;\n _fields = globalInstance->_fields;\n _constructor = globalInstance->_constructor;\n}\n\nbool ClassWrapper::persist(JNIEnv *env, jobject javaThis) {\n if (isPersisted()) {\n if (javaThis == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalArgumentException,\n \"Cannot persist object without corresponding Java instance\");\n return false;\n }\n jlong resultPtr = reinterpret_cast<jlong>(this);\n env->SetLongField(javaThis, getField(PERSIST_FIELD_NAME), resultPtr);\n return true;\n }\n return false;\n}\n\nbool ClassWrapper::isPersisted() const {\n \/\/ TODO: Need test for this\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call isPersisted without class info (forgot to merge?)\");\n return false;\n }\n\n \/\/ We expect the persisted field to be cached, otherwise searching for persisted\n \/\/ fields in non-persisted classes will throw java.lang.NoSuchField exception. :(\n const std::string key(PERSIST_FIELD_NAME);\n FieldMap::const_iterator mapFindIter = _fields.find(key);\n return mapFindIter != _fields.end();\n}\n\nClassWrapper* ClassWrapper::getPersistedInstance(JNIEnv *env, jobject javaThis) const {\n if (isPersisted()) {\n jlong resultPtr = env->GetLongField(javaThis, getField(PERSIST_FIELD_NAME));\n return reinterpret_cast<ClassWrapper*>(resultPtr);\n } else {\n return NULL;\n }\n}\n\nvoid ClassWrapper::destroy(JNIEnv *env, jobject javaThis) {\n if (isPersisted()) {\n if (javaThis == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalArgumentException,\n \"Cannot destroy persisted object without corresponding Java instance\");\n return;\n }\n\n jfieldID persistField = getField(PERSIST_FIELD_NAME);\n if (persistField == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot destroy, object lacks persist field\");\n return;\n }\n\n jlong resultPtr = env->GetLongField(javaThis, persistField);\n ClassWrapper *instance = reinterpret_cast<ClassWrapper*>(resultPtr);\n if (instance != NULL) {\n delete instance;\n env->SetLongField(javaThis, persistField, 0);\n }\n }\n}\n\nvoid ClassWrapper::setJavaObject(JNIEnv *env, jobject javaThis) {\n \/\/ Set up field mappings, if this has not already been done\n if (_field_mappings.empty()) {\n mapFields();\n }\n\n FieldMap::iterator iter;\n for (iter = _fields.begin(); iter != _fields.end(); ++iter) {\n std::string key = iter->first;\n jfieldID field = iter->second;\n FieldMapping *mapping = getFieldMapping(key.c_str());\n if (field != NULL && mapping != NULL) {\n if (TYPE_EQUALS(mapping->type, kTypeInt)) {\n int *address = static_cast<int*>(mapping->address);\n *address = env->GetIntField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeShort)) {\n short *address = static_cast<short*>(mapping->address);\n *address = env->GetShortField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeBool)) {\n bool *address = static_cast<bool*>(mapping->address);\n *address = env->GetBooleanField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeFloat)) {\n float *address = static_cast<float*>(mapping->address);\n *address = env->GetFloatField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeDouble)) {\n double *address = static_cast<double*>(mapping->address);\n *address = env->GetDoubleField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeString)) {\n jstring string = (jstring)env->GetObjectField(javaThis, field);\n JavaString *address = static_cast<JavaString*>(mapping->address);\n address->setValue(env, string);\n } else if (TYPE_EQUALS(mapping->type, kTypeByte)) {\n unsigned char *address = static_cast<unsigned char*>(mapping->address);\n *address = env->GetByteField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeChar)) {\n wchar_t *address = static_cast<wchar_t*>(mapping->address);\n *address = env->GetCharField(javaThis, field);\n } else {\n \/\/ TODO throw\n }\n }\n }\n}\n\njobject ClassWrapper::toJavaObject(JNIEnv *env) {\n if (_constructor == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot call toJavaObject without a constructor (did you forget to call cacheConstructor() in initialize()?\");\n return NULL;\n } else if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot call toJavaObject without registering class info\");\n return NULL;\n }\n\n \/\/ Set up field mappings, if this has not already been done\n if (_field_mappings.empty()) {\n mapFields();\n }\n\n \/\/ Create a new Java argument with the default constructor\n \/\/ TODO: It would be nice to remove the requirement for a no-arg ctor\n \/\/ However, I'm not really sure how to do that without cluttering the interface.\n \/\/ Maybe provide an extra argument to setClass()? However, then we would lack\n \/\/ the corresponding arguments we'd want to pass in here.\n JniLocalRef<jobject> result;\n result.set(env->NewObject(_clazz.get(), _constructor));\n\n FieldMap::iterator iter;\n for (iter = _fields.begin(); iter != _fields.end(); ++iter) {\n std::string key = iter->first;\n jfieldID field = iter->second;\n FieldMapping *mapping = getFieldMapping(key.c_str());\n if (field != NULL && mapping != NULL) {\n if (TYPE_EQUALS(mapping->type, kTypeInt)) {\n int *address = static_cast<int*>(mapping->address);\n env->SetIntField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeShort)) {\n short *address = static_cast<short*>(mapping->address);\n env->SetShortField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeBool)) {\n bool *address = static_cast<bool*>(mapping->address);\n env->SetBooleanField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeFloat)) {\n float *address = static_cast<float*>(mapping->address);\n env->SetFloatField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeDouble)) {\n double *address = static_cast<double*>(mapping->address);\n env->SetDoubleField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeString)) {\n JavaString *address = static_cast<JavaString*>(mapping->address);\n JniLocalRef<jstring> string = address->getJavaString(env);\n env->SetObjectField(result, field, string.get());\n } else if (TYPE_EQUALS(mapping->type, kTypeByte)) {\n unsigned char *address = static_cast<unsigned char*>(mapping->address);\n env->SetByteField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeChar)) {\n wchar_t *address = static_cast<wchar_t*>(mapping->address);\n env->SetCharField(result, field, *address);\n } else {\n \/\/ TODO throw\n }\n }\n }\n\n \/\/ Persist the current object address to the Java instance\n persist(env, result);\n return result.leak();\n}\n\nJniGlobalRef<jclass> ClassWrapper::getClass() const {\n return _clazz;\n}\n\njmethodID ClassWrapper::getMethod(const char *method_name) const {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call getMethod without class info (forgot to merge?)\");\n return NULL;\n }\n\n const std::string key(method_name);\n MethodMap::const_iterator mapFindIter = _methods.find(key);\n if (mapFindIter == _methods.end()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalArgumentException,\n \"Method '%s' is not cached in class '%s'\", method_name, getCanonicalName());\n return NULL;\n }\n\n return mapFindIter->second;\n}\n\njfieldID ClassWrapper::getField(const char* field_name) const {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call getField without class info (forgot to merge?)\");\n return NULL;\n }\n\n const std::string key(field_name);\n FieldMap::const_iterator mapFindIter = _fields.find(key);\n if (mapFindIter == _fields.end()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalArgumentException,\n \"Field '%s' is not cached in class '%s'\", field_name, getCanonicalName());\n return NULL;\n }\n\n return mapFindIter->second;\n}\n\nvoid ClassWrapper::setClass(JNIEnv *env) {\n _clazz.set(env->FindClass(getCanonicalName()));\n JavaExceptionUtils::checkException(env);\n}\n\nvoid ClassWrapper::cacheConstructor(JNIEnv *env) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheMethod without having set class info\");\n return;\n }\n\n std::string signature;\n JavaClassUtils::makeSignature(signature, kTypeVoid, NULL);\n _constructor = env->GetMethodID(_clazz.get(), \"<init>\", signature.c_str());\n \/\/ TODO: Check if ctor was found\n}\n\nvoid ClassWrapper::cacheMethod(JNIEnv *env, const char* method_name, const char* return_type, ...) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheMethod without having set class info\");\n return;\n }\n\n va_list arguments;\n va_start(arguments, return_type);\n std::string signature;\n JavaClassUtils::makeSignatureWithList(signature, return_type, arguments);\n va_end(arguments);\n\n jmethodID method = env->GetMethodID(_clazz.get(), method_name, signature.c_str());\n JavaExceptionUtils::checkException(env);\n if (method != NULL) {\n _methods[method_name] = method;\n }\n}\n\nvoid ClassWrapper::cacheField(JNIEnv *env, const char *field_name, const char *field_type) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheField without having set class info\");\n return;\n }\n\n jfieldID field = env->GetFieldID(_clazz.get(), field_name, field_type);\n JavaExceptionUtils::checkException(env);\n if (field != NULL) {\n _fields[field_name] = field;\n }\n}\n\nvoid ClassWrapper::mapField(const char *field_name, const char *field_type, void *field_ptr) {\n FieldMapping *mapping = new FieldMapping;\n mapping->type = field_type;\n mapping->address = field_ptr;\n _field_mappings[field_name] = mapping;\n}\n\nFieldMapping* ClassWrapper::getFieldMapping(const char *key) const {\n std::string keyString(key);\n std::map<std::string, FieldMapping*>::const_iterator findMapIter = _field_mappings.find(keyString);\n return findMapIter != _field_mappings.end() ? findMapIter->second : NULL;\n}\n\nvoid ClassWrapper::addNativeMethod(const char *method_name, void *function, const char *return_type, ...) {\n JNINativeMethod nativeMethod;\n nativeMethod.name = const_cast<char*>(method_name);\n nativeMethod.fnPtr = function;\n\n va_list arguments;\n va_start(arguments, return_type);\n std::string signature;\n JavaClassUtils::makeSignatureWithList(signature, return_type, arguments);\n nativeMethod.signature = const_cast<char*>(strdup(signature.c_str()));\n va_end(arguments);\n\n _jni_methods.push_back(nativeMethod);\n}\n\nbool ClassWrapper::registerNativeMethods(JNIEnv *env) {\n if (_jni_methods.empty()) {\n return false;\n }\n\n if (!isInitialized()) {\n JavaExceptionUtils::throwRuntimeException(env, \"Could not find cached class for %s\", getCanonicalName());\n return false;\n }\n\n return (env->RegisterNatives(_clazz.get(), &_jni_methods[0], (jint)_jni_methods.size()) < 0);\n}\n\n} \/\/ namespace jni\n} \/\/ namespace spotify\n<commit_msg>Fix performance warning on Windows<commit_after>#include \"ClassWrapper.h\"\n#include \"JavaClassUtils.h\"\n#include \"JavaExceptionUtils.h\"\n#include \"JniWeakGlobalRef.h\"\n#include <string.h>\n\nnamespace spotify {\nnamespace jni {\n\nClassWrapper::~ClassWrapper() {\n \/\/ TODO: Delete mappings\n}\n\nbool ClassWrapper::isInitialized() const {\n return _clazz.get() != NULL;\n}\n\nconst char* ClassWrapper::getSimpleName() const {\n const char* lastSlash = strrchr(getCanonicalName(), '\/');\n return lastSlash != NULL ? lastSlash + 1 : getCanonicalName();\n}\n\nvoid ClassWrapper::merge(const ClassWrapper *globalInstance) {\n _clazz = globalInstance->_clazz;\n _methods = globalInstance->_methods;\n _fields = globalInstance->_fields;\n _constructor = globalInstance->_constructor;\n}\n\nbool ClassWrapper::persist(JNIEnv *env, jobject javaThis) {\n if (isPersisted()) {\n if (javaThis == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalArgumentException,\n \"Cannot persist object without corresponding Java instance\");\n return false;\n }\n jlong resultPtr = reinterpret_cast<jlong>(this);\n env->SetLongField(javaThis, getField(PERSIST_FIELD_NAME), resultPtr);\n return true;\n }\n return false;\n}\n\nbool ClassWrapper::isPersisted() const {\n \/\/ TODO: Need test for this\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call isPersisted without class info (forgot to merge?)\");\n return false;\n }\n\n \/\/ We expect the persisted field to be cached, otherwise searching for persisted\n \/\/ fields in non-persisted classes will throw java.lang.NoSuchField exception. :(\n const std::string key(PERSIST_FIELD_NAME);\n FieldMap::const_iterator mapFindIter = _fields.find(key);\n return mapFindIter != _fields.end();\n}\n\nClassWrapper* ClassWrapper::getPersistedInstance(JNIEnv *env, jobject javaThis) const {\n if (isPersisted()) {\n jlong resultPtr = env->GetLongField(javaThis, getField(PERSIST_FIELD_NAME));\n return reinterpret_cast<ClassWrapper*>(resultPtr);\n } else {\n return NULL;\n }\n}\n\nvoid ClassWrapper::destroy(JNIEnv *env, jobject javaThis) {\n if (isPersisted()) {\n if (javaThis == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalArgumentException,\n \"Cannot destroy persisted object without corresponding Java instance\");\n return;\n }\n\n jfieldID persistField = getField(PERSIST_FIELD_NAME);\n if (persistField == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot destroy, object lacks persist field\");\n return;\n }\n\n jlong resultPtr = env->GetLongField(javaThis, persistField);\n ClassWrapper *instance = reinterpret_cast<ClassWrapper*>(resultPtr);\n if (instance != NULL) {\n delete instance;\n env->SetLongField(javaThis, persistField, 0);\n }\n }\n}\n\nvoid ClassWrapper::setJavaObject(JNIEnv *env, jobject javaThis) {\n \/\/ Set up field mappings, if this has not already been done\n if (_field_mappings.empty()) {\n mapFields();\n }\n\n FieldMap::iterator iter;\n for (iter = _fields.begin(); iter != _fields.end(); ++iter) {\n std::string key = iter->first;\n jfieldID field = iter->second;\n FieldMapping *mapping = getFieldMapping(key.c_str());\n if (field != NULL && mapping != NULL) {\n if (TYPE_EQUALS(mapping->type, kTypeInt)) {\n int *address = static_cast<int*>(mapping->address);\n *address = env->GetIntField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeShort)) {\n short *address = static_cast<short*>(mapping->address);\n *address = env->GetShortField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeBool)) {\n bool *address = static_cast<bool*>(mapping->address);\n \/\/ The somewhat odd \"? true : false\" fixes a performance warning on windows,\n \/\/ since GetBooleanField actually returns jboolean, not bool.\n *address = env->GetBooleanField(javaThis, field) ? true : false;\n } else if (TYPE_EQUALS(mapping->type, kTypeFloat)) {\n float *address = static_cast<float*>(mapping->address);\n *address = env->GetFloatField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeDouble)) {\n double *address = static_cast<double*>(mapping->address);\n *address = env->GetDoubleField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeString)) {\n jstring string = (jstring)env->GetObjectField(javaThis, field);\n JavaString *address = static_cast<JavaString*>(mapping->address);\n address->setValue(env, string);\n } else if (TYPE_EQUALS(mapping->type, kTypeByte)) {\n unsigned char *address = static_cast<unsigned char*>(mapping->address);\n *address = env->GetByteField(javaThis, field);\n } else if (TYPE_EQUALS(mapping->type, kTypeChar)) {\n wchar_t *address = static_cast<wchar_t*>(mapping->address);\n *address = env->GetCharField(javaThis, field);\n } else {\n \/\/ TODO throw\n }\n }\n }\n}\n\njobject ClassWrapper::toJavaObject(JNIEnv *env) {\n if (_constructor == NULL) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot call toJavaObject without a constructor (did you forget to call cacheConstructor() in initialize()?\");\n return NULL;\n } else if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Cannot call toJavaObject without registering class info\");\n return NULL;\n }\n\n \/\/ Set up field mappings, if this has not already been done\n if (_field_mappings.empty()) {\n mapFields();\n }\n\n \/\/ Create a new Java argument with the default constructor\n \/\/ TODO: It would be nice to remove the requirement for a no-arg ctor\n \/\/ However, I'm not really sure how to do that without cluttering the interface.\n \/\/ Maybe provide an extra argument to setClass()? However, then we would lack\n \/\/ the corresponding arguments we'd want to pass in here.\n JniLocalRef<jobject> result;\n result.set(env->NewObject(_clazz.get(), _constructor));\n\n FieldMap::iterator iter;\n for (iter = _fields.begin(); iter != _fields.end(); ++iter) {\n std::string key = iter->first;\n jfieldID field = iter->second;\n FieldMapping *mapping = getFieldMapping(key.c_str());\n if (field != NULL && mapping != NULL) {\n if (TYPE_EQUALS(mapping->type, kTypeInt)) {\n int *address = static_cast<int*>(mapping->address);\n env->SetIntField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeShort)) {\n short *address = static_cast<short*>(mapping->address);\n env->SetShortField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeBool)) {\n bool *address = static_cast<bool*>(mapping->address);\n env->SetBooleanField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeFloat)) {\n float *address = static_cast<float*>(mapping->address);\n env->SetFloatField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeDouble)) {\n double *address = static_cast<double*>(mapping->address);\n env->SetDoubleField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeString)) {\n JavaString *address = static_cast<JavaString*>(mapping->address);\n JniLocalRef<jstring> string = address->getJavaString(env);\n env->SetObjectField(result, field, string.get());\n } else if (TYPE_EQUALS(mapping->type, kTypeByte)) {\n unsigned char *address = static_cast<unsigned char*>(mapping->address);\n env->SetByteField(result, field, *address);\n } else if (TYPE_EQUALS(mapping->type, kTypeChar)) {\n wchar_t *address = static_cast<wchar_t*>(mapping->address);\n env->SetCharField(result, field, *address);\n } else {\n \/\/ TODO throw\n }\n }\n }\n\n \/\/ Persist the current object address to the Java instance\n persist(env, result);\n return result.leak();\n}\n\nJniGlobalRef<jclass> ClassWrapper::getClass() const {\n return _clazz;\n}\n\njmethodID ClassWrapper::getMethod(const char *method_name) const {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call getMethod without class info (forgot to merge?)\");\n return NULL;\n }\n\n const std::string key(method_name);\n MethodMap::const_iterator mapFindIter = _methods.find(key);\n if (mapFindIter == _methods.end()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalArgumentException,\n \"Method '%s' is not cached in class '%s'\", method_name, getCanonicalName());\n return NULL;\n }\n\n return mapFindIter->second;\n}\n\njfieldID ClassWrapper::getField(const char* field_name) const {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalStateException,\n \"Cannot call getField without class info (forgot to merge?)\");\n return NULL;\n }\n\n const std::string key(field_name);\n FieldMap::const_iterator mapFindIter = _fields.find(key);\n if (mapFindIter == _fields.end()) {\n JavaExceptionUtils::throwExceptionOfType(JavaThreadUtils::getEnvForCurrentThread(),\n kTypeIllegalArgumentException,\n \"Field '%s' is not cached in class '%s'\", field_name, getCanonicalName());\n return NULL;\n }\n\n return mapFindIter->second;\n}\n\nvoid ClassWrapper::setClass(JNIEnv *env) {\n _clazz.set(env->FindClass(getCanonicalName()));\n JavaExceptionUtils::checkException(env);\n}\n\nvoid ClassWrapper::cacheConstructor(JNIEnv *env) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheMethod without having set class info\");\n return;\n }\n\n std::string signature;\n JavaClassUtils::makeSignature(signature, kTypeVoid, NULL);\n _constructor = env->GetMethodID(_clazz.get(), \"<init>\", signature.c_str());\n \/\/ TODO: Check if ctor was found\n}\n\nvoid ClassWrapper::cacheMethod(JNIEnv *env, const char* method_name, const char* return_type, ...) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheMethod without having set class info\");\n return;\n }\n\n va_list arguments;\n va_start(arguments, return_type);\n std::string signature;\n JavaClassUtils::makeSignatureWithList(signature, return_type, arguments);\n va_end(arguments);\n\n jmethodID method = env->GetMethodID(_clazz.get(), method_name, signature.c_str());\n JavaExceptionUtils::checkException(env);\n if (method != NULL) {\n _methods[method_name] = method;\n }\n}\n\nvoid ClassWrapper::cacheField(JNIEnv *env, const char *field_name, const char *field_type) {\n if (!isInitialized()) {\n JavaExceptionUtils::throwExceptionOfType(env, kTypeIllegalStateException,\n \"Attempt to call cacheField without having set class info\");\n return;\n }\n\n jfieldID field = env->GetFieldID(_clazz.get(), field_name, field_type);\n JavaExceptionUtils::checkException(env);\n if (field != NULL) {\n _fields[field_name] = field;\n }\n}\n\nvoid ClassWrapper::mapField(const char *field_name, const char *field_type, void *field_ptr) {\n FieldMapping *mapping = new FieldMapping;\n mapping->type = field_type;\n mapping->address = field_ptr;\n _field_mappings[field_name] = mapping;\n}\n\nFieldMapping* ClassWrapper::getFieldMapping(const char *key) const {\n std::string keyString(key);\n std::map<std::string, FieldMapping*>::const_iterator findMapIter = _field_mappings.find(keyString);\n return findMapIter != _field_mappings.end() ? findMapIter->second : NULL;\n}\n\nvoid ClassWrapper::addNativeMethod(const char *method_name, void *function, const char *return_type, ...) {\n JNINativeMethod nativeMethod;\n nativeMethod.name = const_cast<char*>(method_name);\n nativeMethod.fnPtr = function;\n\n va_list arguments;\n va_start(arguments, return_type);\n std::string signature;\n JavaClassUtils::makeSignatureWithList(signature, return_type, arguments);\n nativeMethod.signature = const_cast<char*>(strdup(signature.c_str()));\n va_end(arguments);\n\n _jni_methods.push_back(nativeMethod);\n}\n\nbool ClassWrapper::registerNativeMethods(JNIEnv *env) {\n if (_jni_methods.empty()) {\n return false;\n }\n\n if (!isInitialized()) {\n JavaExceptionUtils::throwRuntimeException(env, \"Could not find cached class for %s\", getCanonicalName());\n return false;\n }\n\n return (env->RegisterNatives(_clazz.get(), &_jni_methods[0], (jint)_jni_methods.size()) < 0);\n}\n\n} \/\/ namespace jni\n} \/\/ namespace spotify\n<|endoftext|>"} {"text":"<commit_before>\/\/#include <pch.h>\r\n#include \"GameObject.h\"\r\n\r\n#include <Component\/AABB.h>\r\n#include <Component\/Mesh.h>\r\n#include <Component\/Renderer.h>\r\n#include <Component\/Transform.h>\r\n#include <Component\/ObjectInput.h>\r\n#include <GPU\/Shader.h>\r\n\r\n#include <Manager\/DebugInfo.h>\r\n#include <Manager\/Manager.h>\r\n#include <Manager\/ColorPicking.h>\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\t#include <Component\/Physics.h>\r\n\t#include <Manager\/PhysicsManager.h>\r\n#endif\r\n\r\nGameObject::GameObject(const char *name)\r\n{\r\n\tInit();\r\n\tif (name) {\r\n\t\trefID = new char[strlen(name)];\r\n\t\trefID = strcpy(refID, name);\r\n\t}\r\n\trenderer = new Renderer();\r\n\ttransform = new Transform();\r\n}\r\n\r\nGameObject::GameObject(const GameObject &obj) {\r\n\tInit();\r\n\trefID = obj.refID;\r\n\tmesh\t= obj.mesh;\r\n\tshader\t= obj.shader;\r\n\tinput\t= obj.input;\r\n\trenderer = obj.renderer;\r\n\ttransform = new Transform(*obj.transform);\r\n\tSetupAABB();\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\tif (obj.physics) {\r\n\t\tphysics = new Physics(this);\r\n\t\tphysics->body = Manager::Physics->GetCopyOf(obj.physics->body);\r\n\t}\r\n#endif\r\n}\r\n\r\nGameObject::~GameObject() {\r\n\tManager::Debug->Remove(this);\r\n}\r\n\r\nvoid GameObject::Init()\r\n{\r\n\taabb = nullptr;\r\n\tmesh = nullptr;\r\n\tshader = nullptr;\r\n\trenderer = nullptr;\r\n\ttransform = nullptr;\r\n\tinput = nullptr;\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\tphysics = nullptr;\r\n#endif\r\n\r\n\tcolorID = Manager::ColorPick->GetColorUID();\r\n\tSetDebugView(true);\r\n}\r\n\r\nvoid GameObject::SetupAABB() {\r\n\tif (mesh) {\r\n\t\taabb = new AABB(this);\r\n\t\taabb->Update();\r\n\t}\r\n}\r\n\r\nvoid GameObject::Update() {\r\n\t#ifdef PHYSICS_ENGINE\r\n\tif (physics) {\r\n\t\tphysics->Update();\r\n\t}\r\n\t#endif\r\n}\r\n\r\nbool GameObject::ColidesWith(GameObject *object) {\r\n\tif (!object->aabb)\r\n\t\treturn false;\r\n\treturn aabb->Overlaps(object->aabb);\r\n}\r\n\r\nvoid GameObject::Render() const {\r\n\tif (!mesh || !shader) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->Render(shader);\r\n}\r\n\r\nvoid GameObject::Render(const Shader *shader) const {\r\n\tif (!mesh) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->Render(shader);\r\n}\r\n\r\nvoid GameObject::RenderInstanced(const Shader *shader, unsigned int instances) const\r\n{\r\n\tif (!mesh) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->RenderInstanced(instances);\r\n}\r\n\r\nvoid GameObject::UseShader(Shader *shader) {\r\n\tthis->shader = shader;\r\n}\r\n\r\nvoid GameObject::SetDebugView(bool value) {\r\n\tdebugView = value;\r\n\tdebugView ? Manager::Debug->Add(this) : Manager::Debug->Remove(this);\r\n}\r\n\r\nfloat GameObject::DistTo(GameObject *object)\r\n{\r\n\tglm::vec3 d = transform->position - object->transform->position;\r\n\tfloat d2 = (d.x * d.x) + (d.y * d.y) + (d.z * d.z);\r\n\treturn sqrt(d2);\r\n}\r\n<commit_msg>code re-factoring<commit_after>\/\/#include <pch.h>\r\n#include \"GameObject.h\"\r\n\r\n#include <Component\/AABB.h>\r\n#include <Component\/Mesh.h>\r\n#include <Component\/Renderer.h>\r\n#include <Component\/Transform.h>\r\n#include <Component\/ObjectInput.h>\r\n#include <GPU\/Shader.h>\r\n\r\n#include <Manager\/DebugInfo.h>\r\n#include <Manager\/Manager.h>\r\n#include <Manager\/ColorPicking.h>\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\t#include <Component\/Physics.h>\r\n\t#include <Manager\/PhysicsManager.h>\r\n#endif\r\n\r\nGameObject::GameObject(const char *name)\r\n{\r\n\tInit();\r\n\tif (name) {\r\n\t\trefID = new char[strlen(name)];\r\n\t\trefID = strcpy(refID, name);\r\n\t}\r\n\trenderer = new Renderer();\r\n\ttransform = new Transform();\r\n}\r\n\r\nGameObject::GameObject(const GameObject &obj) {\r\n\tInit();\r\n\trefID\t= obj.refID;\r\n\tmesh\t= obj.mesh;\r\n\tshader\t= obj.shader;\r\n\tinput\t= obj.input;\r\n\trenderer = obj.renderer;\r\n\ttransform = new Transform(*obj.transform);\r\n\tSetupAABB();\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\tif (obj.physics) {\r\n\t\tphysics = new Physics(this);\r\n\t\tphysics->body = Manager::Physics->GetCopyOf(obj.physics->body);\r\n\t}\r\n#endif\r\n}\r\n\r\nGameObject::~GameObject() {\r\n\tManager::Debug->Remove(this);\r\n}\r\n\r\nvoid GameObject::Init()\r\n{\r\n\taabb = nullptr;\r\n\tmesh = nullptr;\r\n\tshader = nullptr;\r\n\trenderer = nullptr;\r\n\ttransform = nullptr;\r\n\tinput = nullptr;\r\n\r\n#ifdef PHYSICS_ENGINE\r\n\tphysics = nullptr;\r\n#endif\r\n\r\n\tcolorID = Manager::ColorPick->GetColorUID();\r\n\tSetDebugView(true);\r\n}\r\n\r\nvoid GameObject::SetupAABB() {\r\n\tif (mesh) {\r\n\t\taabb = new AABB(this);\r\n\t\taabb->Update();\r\n\t}\r\n}\r\n\r\nvoid GameObject::Update() {\r\n\t#ifdef PHYSICS_ENGINE\r\n\tif (physics) {\r\n\t\tphysics->Update();\r\n\t}\r\n\t#endif\r\n}\r\n\r\nbool GameObject::ColidesWith(GameObject *object) {\r\n\tif (!object->aabb)\r\n\t\treturn false;\r\n\treturn aabb->Overlaps(object->aabb);\r\n}\r\n\r\nvoid GameObject::Render() const {\r\n\tif (!mesh || !shader) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->Render(shader);\r\n}\r\n\r\nvoid GameObject::Render(const Shader *shader) const {\r\n\tif (!mesh) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->Render(shader);\r\n}\r\n\r\nvoid GameObject::RenderInstanced(const Shader *shader, unsigned int instances) const\r\n{\r\n\tif (!mesh) return;\r\n\tglUniformMatrix4fv(shader->loc_model_matrix, 1, GL_FALSE, glm::value_ptr(transform->model));\r\n\tmesh->RenderInstanced(instances);\r\n}\r\n\r\nvoid GameObject::UseShader(Shader *shader) {\r\n\tthis->shader = shader;\r\n}\r\n\r\nvoid GameObject::SetDebugView(bool value) {\r\n\tdebugView = value;\r\n\tdebugView ? Manager::Debug->Add(this) : Manager::Debug->Remove(this);\r\n}\r\n\r\nfloat GameObject::DistTo(GameObject *object)\r\n{\r\n\tglm::vec3 d = transform->position - object->transform->position;\r\n\tfloat d2 = (d.x * d.x) + (d.y * d.y) + (d.z * d.z);\r\n\treturn sqrt(d2);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <ncurses.h>\n#include <unistd.h>\n#include <string.h>\n#include <string>\nusing namespace std;\n\nint main()\n{\n\tinitscr();\n\tcbreak();\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@ THE BUNNY GAME @@@\\n\");\n\tprintw(\"@@@ This is a simple program i wipped up, you could @@@\\n\");\n\tprintw(\"@@@ call it a game, i suppose. No its not a game. @@@\\n\");\n\tprintw(\"@@@ don't call it that, EVER. Oh well this not game @@@\\n\");\n\tprintw(\"@@@ has 5 err i mean 4 commands, its pretty self @@@\\n\");\n\tprintw(\"@@@ explanitory. just play it. If this program closes, @@@\\n\");\n\tprintw(\"@@@ you lose @@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\n\tprintw( \"Press enter to continue ...\");\n\trefresh();\n\tgetch();\n\tclear();\n\n\n\n\n\tint loop = 0;\n\twhile (loop < 1)\n\t{\n\t\tclear();\n\t\tprintw( \" (\\\\__\/)\\n\");\n\t\tprintw( \" ( -.-)\\n\");\n\t\tprintw( \" C(\\\")(\\\")\\n\");\n\t\tprintw( \"What do you want to do with it?\\n\");\n\t\tprintw( \" 1) Pet\\n\");\n\t\tprintw( \" 2) Poke\\n\");\n\t\tprintw( \" 3) Tell Joke\\n\");\n\t\tprintw( \" 4) Steal nose\\n\");\n\t\trefresh();\n\t\tchar choice;\n\t\tchoice = getch();\t\n\n\n\t\tif (choice == '1')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw( \" (\\\\__\/) Bunny like pets. Now let me sleep.\\n\");\n\t\t\tprintw( \" ( -.-) That means leave. \\n\");\n\t\t\tprintw( \" C(\\\")(\\\") \\n\");\n\t\t\tprintw( \" umm, I think its best to do what it says.... \\n\\n\");\n\t\t\tprintw( \"Press enter to continue ...\");\n\t\t\trefresh();\n\t\t\tgetch();\n\n\t\t}\n\t\telse if (choice == '2')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( -.-)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tclear();\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( 0.0)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tprintw(\" WHO STOLE MY CARROTS???\\n\");\n\t\t\tprintw(\" I WILL DESTROY THE WOLRD\\n\");\n\t\t\tprintw(\" MWAHAHA\\n\");\n\t\t\trefresh();\n\t\t\tsleep(2);\n\t\t\tint count = 10;\n\t\t\twhile (count >= 0)\n\t\t\t{\n\t\t\t\tclear();\n\t\t\t\tprintw(\"%d\\n\", count);\n\t\t\t\tcount -= 2;\n\t\t\t\tsleep(1);\n\t\t\t\trefresh();\n\t\t\t}\n\t\t\trefresh();\n\t\t\tprintw(\"SOMEONE POKED THE BUNNY. THE WORLD IS OVER.\\n\");\n\t\t\tprintw(\"Guess the bunny beat those terrorists to it...\\n\");\n\t\t\tgetch();\n\t\t}\n\t\telse if (choice == '3')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( -.-)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tsleep(1);\n\t\t\tprintw(\" random joke im to lazy to think of\\n\");\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) gasp\\n\");\n\t\t\tprintw(\" ( 0.0)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\trefresh();\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) Giggle, lol\\n\");\n\t\t\tprintw(\" ( *.*)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\trefresh();\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" You made the bunny laugh, awwww cute.\\n\");\n\t\t\tprintw(\"Press enter to continue ...\\n\");\n\t\t\tgetch();\n\t\t\tclear();\n\t\t\trefresh();\n\t\t}\n\t\telse if (choice == '4')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\");\n\t\t\tprintw(\" ( -.-)\");\n\t\t\tprintw(\" C(\\\")(\\\")\");\n\t\t\tprintw(\" hey bunny\");\n\t\t\trefresh();\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) ?\");\n\t\t\tprintw(\" ( o.o)\");\n\t\t\tprintw(\" C(\\\")(\\\")\");\n\t\t\tsleep(3);\n\t\t\trefresh();\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) ?\");\n\t\t\tprintw(\" ( o o)\");\n\t\t\tprintw(\" C(\\\")(\\\")\");\n\t\t\tprintw(\" I got your nose\");\n\t\t\tsleep(3);\n\t\t\trefresh();\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) AHHHHH!!\");\n\t\t\tprintw(\" ( o o)\");\n\t\t\tprintw(\" C(\\\")(\\\")\");\n\t\t\tsleep(4);\n\t\t\tprintw(\"You stole the bunny's nose. why, why did you do that??? \\nWhy??\");\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tprintw(\"Press enter\\n\");\n\t\t\tgetch();\n\t\t\tclear();\n\t\t}\n\t\telse if (choice == '5')\n\t\t{\n\t\t\tclear();\n\t\t\tstd::string name;\n\t\t\tstd::string answer (\"bunny\");\n\t\t\trefresh();\n\t\t\t\n\t\t\twhile (name != answer)\n\t\t\t{\n\t\t\t\tprintw(\"name: \");\n\t\t\t\trefresh();\n\t\t\t\t\/\/std::getline (std::cin,name);\n\t\t\t\tgetline(std::cin >> name);\n\t\t\t\tprintw(\"name is %s \\n\",name);\n\t\t\t\tprintw(\"answer is %s \\n\",answer);\n\t\t\t\trefresh();\n\t\t\t\tgetch();\n\t\t\t\tif (name.compare(answer) != 0)\n\t\t\t\t{\n\t\t\t\t\tclear();\n\t\t\t\t\tprintw(\"Congratulations! you have won the game!\\n\");\n\t\t\t\t\tprintw(\"When i first made the game a song played at this part\\n\");\n\t\t\t\t\tprintw(\"I did not include it for copyright reasons. Thanks for playing\\n\\n\");\n\t\t\t\t\tprintw(\"Press enter\\n\");\n\t\t\t\t\tgetch();\n\t\t\t\t\tclear();\n\t\t\t\t\tloop = 2;\n\t\t\t\t\tendwin();\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tclear();\n\t\t\t\t\tprintw(\"EXTERMANATE!!!, wait sorry WRONG USER\\n\");\n\t\t\t\t\trefresh();\n\t\t\t\t\tsleep(1);\n\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\t\n\n\tendwin();\n\treturn 0;\n}\n\n<commit_msg>fixed bunnygame.cpp, should all work now<commit_after>#include <iostream>\n#include <ncurses.h>\n#include <unistd.h>\n#include <string.h>\nusing namespace std;\n\nint main()\n{\n\tinitscr();\n\tcbreak();\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@ THE BUNNY GAME @@@\\n\");\n\tprintw(\"@@@ This is a simple program i wipped up, you could @@@\\n\");\n\tprintw(\"@@@ call it a game, i suppose. No its not a game. @@@\\n\");\n\tprintw(\"@@@ don't call it that, EVER. Oh well this not game @@@\\n\");\n\tprintw(\"@@@ has 5 err i mean 4 commands, its pretty self @@@\\n\");\n\tprintw(\"@@@ explanitory. just play it. If this program closes, @@@\\n\");\n\tprintw(\"@@@ you lose @@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\tprintw(\"@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\\n\");\n\n\tprintw( \"Press enter to continue ...\");\n\trefresh();\n\tgetch();\n\tclear();\n\n\n\n\n\twhile (true)\n\t{\n\t\tclear();\n\t\tprintw( \" (\\\\__\/)\\n\");\n\t\tprintw( \" ( -.-)\\n\");\n\t\tprintw( \" C(\\\")(\\\")\\n\");\n\t\tprintw( \"What do you want to do with it?\\n\");\n\t\tprintw( \" 1) Pet\\n\");\n\t\tprintw( \" 2) Poke\\n\");\n\t\tprintw( \" 3) Tell Joke\\n\");\n\t\tprintw( \" 4) Steal nose\\n\");\n\t\trefresh();\n\t\tchar choice;\n\t\tchoice = getch();\t\n\n\n\t\tif (choice == '1')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw( \" (\\\\__\/) Bunny like pets. Now let me sleep.\\n\");\n\t\t\tprintw( \" ( -.-) That means leave. \\n\");\n\t\t\tprintw( \" C(\\\")(\\\") \\n\");\n\t\t\tprintw( \" umm, I think its best to do what it says.... \\n\\n\");\n\t\t\tprintw( \"Press enter to continue ...\");\n\t\t\trefresh();\n\t\t\tgetch();\n\n\t\t}\n\t\telse if (choice == '2')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( -.-)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tclear();\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( 0.0)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tprintw(\" WHO STOLE MY CARROTS???\\n\");\n\t\t\tprintw(\" I WILL DESTROY THE WOLRD\\n\");\n\t\t\tprintw(\" MWAHAHA\\n\");\n\t\t\trefresh();\n\t\t\tsleep(2);\n\t\t\tint count = 10;\n\t\t\twhile (count > 0)\n\t\t\t{\n\t\t\t\tclear();\n\t\t\t\tprintw(\"%d\\n\", count);\n\t\t\t\tcount -= 2;\n\t\t\t\tsleep(1);\n\t\t\t\trefresh();\n\t\t\t}\n\t\t\tclear();\n\t\t\trefresh();\n\t\t\tprintw(\"SOMEONE POKED THE BUNNY. THE WORLD IS OVER.\\n\");\n\t\t\tprintw(\"Guess the bunny beat those terrorists to it...\\n\");\n\t\t\trefresh();\n\t\t\tgetch();\n\t\t\tbreak;\n\t\t}\n\t\telse if (choice == '3')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( -.-)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tprintw(\"random joke im to lazy to think of\\n\");\n\t\t\trefresh();\n\t\t\tsleep(2);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) gasp\\n\");\n\t\t\tprintw(\" ( 0.0)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\trefresh();\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) Giggle, lol\\n\");\n\t\t\tprintw(\" ( *.*)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\trefresh();\n\t\t\tsleep(3);\n\t\t\tclear();\n\t\t\tprintw(\" You made the bunny laugh, awwww cute.\\n\");\n\t\t\tprintw(\"Press enter to continue ...\\n\");\n\t\t\tgetch();\n\t\t\tclear();\n\t\t\trefresh();\n\t\t}\n\t\telse if (choice == '4')\n\t\t{\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/)\\n\");\n\t\t\tprintw(\" ( -.-)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tprintw(\" hey bunny\\n\");\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) ?\\n\");\n\t\t\tprintw(\" ( o.o)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tsleep(3);\n\t\t\trefresh();\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) ?\\n\");\n\t\t\tprintw(\" ( o o)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tprintw(\" I got your nose\\n\");\n\t\t\tsleep(3);\n\t\t\trefresh();\n\t\t\tclear();\n\t\t\tprintw(\" (\\\\__\/) AHHHHH!!\\n\");\n\t\t\tprintw(\" ( o o)\\n\");\n\t\t\tprintw(\" C(\\\")(\\\")\\n\");\n\t\t\tsleep(4);\n\t\t\tprintw(\"You stole the bunny's nose. why, why did you do that??? \\nWhy??\\n\");\n\t\t\trefresh();\n\t\t\tsleep(1);\n\t\t\tprintw(\"Press enter\\n\");\n\t\t\tgetch();\n\t\t\tclear();\n\t\t\tbreak;\n\t\t}\n\t\telse if (choice == '5')\n\t\t{\n\t\t\tclear();\n\t\t\tchar name[21];\n\t\t\tchar answer[7] = \"bunny\";\n\t\t\trefresh();\n\t\t\t\n\t\t\twhile (name != answer)\n\t\t\t{\n\t\t\t\tprintw(\"name: \");\n\t\t\t\trefresh();\n\t\t\t\tscanw(\"%20s\", name);\n\t\t\t\trefresh();\n\t\t\t\tsleep(1);\n\t\t\t\tif (strcmp(name, \"bunny\") == 0)\n\t\t\t\t{\n\t\t\t\t\tclear();\n\t\t\t\t\tprintw(\"Congratulations! you have won the game!\\n\");\n\t\t\t\t\tprintw(\"When i first made the game a song played at this part\\n\");\n\t\t\t\t\tprintw(\"I did not include it for copyright reasons. Thanks for playing\\n\\n\");\n\t\t\t\t\tprintw(\"Press enter\\n\");\n\t\t\t\t\tgetch();\n\t\t\t\t\tclear();\n\t\t\t\t\tendwin();\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tclear();\n\t\t\t\t\tprintw(\"EXTERMANATE!!!, wait sorry WRONG USER\\n\");\n\t\t\t\t\trefresh();\n\t\t\t\t\tsleep(1);\n\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n\t\n\n\tendwin();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <memory>\n#include <string>\n\n#include \"SurgSim\/Blocks\/BasicSceneElement.h\"\n#include \"SurgSim\/Blocks\/TransferInputPoseBehavior.h\"\n#include \"SurgSim\/Blocks\/TransferPoseBehavior.h\"\n#include \"SurgSim\/Devices\/MultiAxis\/MultiAxisDevice.h\"\n#include \"Examples\/ExampleStapling\/StaplerBehavior.h\"\n#include \"SurgSim\/Framework\/BehaviorManager.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Scene.h\"\n#include \"SurgSim\/Graphics\/OsgBoxRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgCapsuleRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgManager.h\"\n#include \"SurgSim\/Graphics\/OsgSceneryRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgView.h\"\n#include \"SurgSim\/Graphics\/OsgViewElement.h\"\n#include \"SurgSim\/Input\/InputComponent.h\"\n#include \"SurgSim\/Input\/InputManager.h\"\n#include \"SurgSim\/Math\/BoxShape.h\"\n#include \"SurgSim\/Math\/CapsuleShape.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Physics\/FixedRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentationParameters.h\"\n#include \"SurgSim\/Physics\/PhysicsManager.h\"\n#include \"SurgSim\/Physics\/VirtualToolCoupler.h\"\n\nusing SurgSim::Blocks::TransferInputPoseBehavior;\nusing SurgSim::Blocks::TransferPoseBehavior;\nusing SurgSim::Blocks::BasicSceneElement;\nusing SurgSim::Framework::BehaviorManager;\nusing SurgSim::Framework::Scene;\nusing SurgSim::Framework::SceneElement;\nusing SurgSim::Framework::Runtime;\nusing SurgSim::Device::MultiAxisDevice;\nusing SurgSim::Graphics::BoxRepresentation;\nusing SurgSim::Graphics::CapsuleRepresentation;\nusing SurgSim::Graphics::OsgBoxRepresentation;\nusing SurgSim::Graphics::OsgCapsuleRepresentation;\nusing SurgSim::Graphics::OsgManager;\nusing SurgSim::Graphics::OsgSceneryRepresentation;\nusing SurgSim::Graphics::OsgViewElement;\nusing SurgSim::Graphics::SceneryRepresentation;\nusing SurgSim::Graphics::ViewElement;\nusing SurgSim::Math::BoxShape;\nusing SurgSim::Math::CapsuleShape;\nusing SurgSim::Math::makeRigidTransform;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Input::DeviceInterface;\nusing SurgSim::Input::InputComponent;\nusing SurgSim::Input::InputManager;\nusing SurgSim::Physics::FixedRepresentation;\nusing SurgSim::Physics::PhysicsManager;\nusing SurgSim::Physics::RigidRepresentationParameters;\nusing SurgSim::Physics::RigidCollisionRepresentation;\nusing SurgSim::Physics::RigidRepresentation;\nusing SurgSim::Physics::VirtualToolCoupler;\n\n\/\/\/ Load scenery object from file.\n\/\/\/ \\param name Name of this scenery representation.\n\/\/\/ \\param fileName Name of the file from which the scenery representation is loaded.\n\/\/\/ \\param pose The pose of the loaded scenery representation.\n\/\/\/ \\return A SceneElement containing the scenery representation.\nstd::shared_ptr<SceneElement> createSceneryObject(const std::string& name,\n\t\t\t\t\t\t\t\t\t\t\t\t const std::string& fileName,\n\t\t\t\t\t\t\t\t\t\t\t\t const RigidTransform3d& pose)\n{\n\tstd::shared_ptr<SceneryRepresentation> sceneryRepresentation =\n\t\tstd::make_shared<OsgSceneryRepresentation>(name + \"SceneryRepresentation\");\n\tsceneryRepresentation->setFileName(fileName);\n\tsceneryRepresentation->setInitialPose(pose);\n\n\tstd::shared_ptr<BasicSceneElement> sceneElement = std::make_shared<BasicSceneElement>(name + \"SceneElement\");\n\tsceneElement->addComponent(sceneryRepresentation);\n\n\treturn sceneElement;\n}\n\nstd::shared_ptr<ViewElement> createView()\n{\n\tstd::shared_ptr<OsgViewElement> view = std::make_shared<OsgViewElement>(\"StaplingDemoView\");\n\n\tview->enableManipulator(true);\n\tview->setManipulatorParameters(Vector3d(0.0, 0.5, 0.5), Vector3d::Zero());\n\n\treturn view;\n}\n\nstd::shared_ptr<SceneElement> createStapler(const std::string& name)\n{\n\t\/\/ Since there is no collision mesh loader yet, use a capsule shape as the collision representation of the stapler.\n\tstd::shared_ptr<CapsuleShape> capsuleShape = std::make_shared<CapsuleShape>(0.1, 0.02); \/\/ Unit: meter\n\tRigidRepresentationParameters params;\n\tparams.setDensity(8050); \/\/ Stainless steel (in Kg.m-3)\n\tparams.setShapeUsedForMassInertia(capsuleShape);\n\tstd::shared_ptr<RigidRepresentation> physicsRepresentation =\n\t\tstd::make_shared<RigidRepresentation>(name + \"Physics\");\n\tphysicsRepresentation->setInitialParameters(params);\n\n\tstd::shared_ptr<RigidCollisionRepresentation> collisionRepresentation =\n\t\tstd::make_shared<RigidCollisionRepresentation>(name + \"Collision\");\n\tcollisionRepresentation->setRigidRepresentation(physicsRepresentation);\n\n\tstd::shared_ptr<InputComponent> inputComponent = std::make_shared<InputComponent>(\"InputComponent\");\n\tinputComponent->setDeviceName(\"MultiAxisDevice\");\n\n\tstd::shared_ptr<VirtualToolCoupler> inputVTC = std::make_shared<VirtualToolCoupler>(\"VTC\");\n\tinputVTC->setInput(inputComponent);\n\tinputVTC->setRepresentation(physicsRepresentation);\n\tinputVTC->setAngularDamping(params.getMass() * 10e-2);\n\tinputVTC->setAngularStiffness(params.getMass() * 50.0);\n\tinputVTC->setLinearDamping(params.getMass() * 10.0);\n\tinputVTC->setLinearStiffness(params.getMass() * 200.0);\n\n\t\/\/ A stapler behavior controls the release of stale when a button is pushed on the device.\n\t\/\/ Also, it is aware of collisions of the stapler.\n\tstd::shared_ptr<StaplerBehavior> staplerBehavior = std::make_shared<StaplerBehavior>(name + \"StaplerBehavior\");\n\tstaplerBehavior->setInputComponent(inputComponent);\n\tstaplerBehavior->setStaplerRepresentation(collisionRepresentation);\n\n\tstd::shared_ptr<SceneryRepresentation> staplerSceneryRepresentation =\n\t\tstd::make_shared<OsgSceneryRepresentation>(name + \"SceneryRepresentation\");\n\tstaplerSceneryRepresentation->setFileName(\"Geometry\/stapler.obj\");\n\t\/\/ Connect inputComponent to graphical representation.\n\tstd::shared_ptr<TransferInputPoseBehavior> transferInputPose =\n\t\tstd::make_shared<TransferInputPoseBehavior>(name + \"Input to Graphics\");\n\ttransferInputPose->setPoseSender(inputComponent);\n\ttransferInputPose->setPoseReceiver(staplerSceneryRepresentation);\n\n\t\/\/ Visualization of the collision representation.\n\tstd::shared_ptr<CapsuleRepresentation> osgCapsuleRepresentation =\n\t\tstd::make_shared<OsgCapsuleRepresentation>(\"capsule representation\");\n\tosgCapsuleRepresentation->setHeight(capsuleShape->getLength());\n\tosgCapsuleRepresentation->setRadius(capsuleShape->getRadius());\n\t\/\/ Connect physical representation to graphical representation.\n\tstd::shared_ptr<TransferPoseBehavior> transferPose =\n\t\tstd::make_shared<TransferPoseBehavior>(name + \"Physics to Graphics\");\n\ttransferPose->setPoseSender(physicsRepresentation);\n\ttransferPose->setPoseReceiver(osgCapsuleRepresentation);\n\n\tstd::shared_ptr<SceneElement> staplerSceneElement = std::make_shared<BasicSceneElement>(name + \"SceneElement\");\n\tstaplerSceneElement->addComponent(physicsRepresentation);\n\tstaplerSceneElement->addComponent(collisionRepresentation);\n\tstaplerSceneElement->addComponent(osgCapsuleRepresentation);\n\tstaplerSceneElement->addComponent(staplerSceneryRepresentation);\n\tstaplerSceneElement->addComponent(inputComponent);\n\tstaplerSceneElement->addComponent(inputVTC);\n\tstaplerSceneElement->addComponent(staplerBehavior);\n\tstaplerSceneElement->addComponent(transferInputPose);\n\tstaplerSceneElement->addComponent(transferPose);\n\n\treturn staplerSceneElement;\n}\n\nstd::shared_ptr<SceneElement> createArm(const std::string& name, const RigidTransform3d& pose)\n{\n\t\/\/ Load graphic representation for armSceneElement\n\tstd::shared_ptr<SceneElement> armSceneElement = createSceneryObject(name, \"Geometry\/forearm.osgb\", pose);\n\n\tstd::shared_ptr<BoxRepresentation> boxRepresentation =\n\t\tstd::make_shared<OsgBoxRepresentation>(\"capsule representation\");\n\tboxRepresentation->setSize(0.635, 0.05, 0.05); \/\/ Unit: meter\n\tboxRepresentation->setInitialPose(pose);\n\n\t\/\/ Since there is no collision mesh loader yet, use a box shape as the collision representation of the arm.\n\tstd::shared_ptr<BoxShape> boxShape = std::make_shared<BoxShape>(boxRepresentation->getSizeX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tboxRepresentation->getSizeY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tboxRepresentation->getSizeZ());\n\n\tRigidRepresentationParameters params;\n\tparams.setDensity(1062); \/\/ Average human body density (in Kg.m-3)\n\tparams.setShapeUsedForMassInertia(boxShape);\n\n\tstd::shared_ptr<FixedRepresentation> physicsRepresentation =\n\t\tstd::make_shared<FixedRepresentation>(name + \"Physics\");\n\tphysicsRepresentation->setInitialParameters(params);\n\tphysicsRepresentation->setInitialPose(pose);\n\n\tstd::shared_ptr<RigidCollisionRepresentation> collisionRepresentation =\n\t\tstd::make_shared<RigidCollisionRepresentation>(name + \"Collision\");\n\tcollisionRepresentation->setRigidRepresentation(physicsRepresentation);\n\n\tstd::shared_ptr<TransferPoseBehavior> transferPose =\n\t\tstd::make_shared<TransferPoseBehavior>(\"Physics to Graphics Pose\");\n\ttransferPose->setPoseSender(physicsRepresentation);\n\ttransferPose->setPoseReceiver(boxRepresentation);\n\n\tarmSceneElement->addComponent(boxRepresentation);\n\tarmSceneElement->addComponent(physicsRepresentation);\n\tarmSceneElement->addComponent(collisionRepresentation);\n\tarmSceneElement->addComponent(transferPose);\n\n\treturn armSceneElement;\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::shared_ptr<BehaviorManager> behaviorManager = std::make_shared<BehaviorManager>();\n\tstd::shared_ptr<OsgManager> graphicsManager = std::make_shared<OsgManager>();\n\tstd::shared_ptr<InputManager> inputManager = std::make_shared<InputManager>();\n\tstd::shared_ptr<PhysicsManager> physicsManager = std::make_shared<PhysicsManager>();\n\n\tstd::shared_ptr<Runtime> runtime = std::make_shared<Runtime>(\"config.txt\");\n\truntime->addManager(behaviorManager);\n\truntime->addManager(graphicsManager);\n\truntime->addManager(inputManager);\n\truntime->addManager(physicsManager);\n\n\tstd::shared_ptr<DeviceInterface> device = std::make_shared<MultiAxisDevice>(\"MultiAxisDevice\");\n\tSURGSIM_ASSERT(device->initialize() == true) <<\n\t\t\"Could not initialize device \" << device->getName() << \" for the tool.\\n\";\n\tinputManager->addDevice(device);\n\n\tstd::shared_ptr<SceneElement> staplerSceneElement = createStapler(\"stapler\");\n\tstd::shared_ptr<SceneElement> armSceneElement = createArm(\"arm\",\n\t\tmakeRigidTransform(Quaterniond::Identity(), SurgSim::Math::Vector3d(0.0, -0.2, 0.0)));\n\n\tstd::shared_ptr<Scene> scene = runtime->getScene();\n\tscene->addSceneElement(createView());\n\tscene->addSceneElement(staplerSceneElement);\n\tscene->addSceneElement(armSceneElement);\n\n\truntime->execute();\n\n\treturn 0;\n}\n<commit_msg>Rotate the box representation for arm and fix name typo.<commit_after>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <memory>\n#include <string>\n\n#include \"SurgSim\/Blocks\/BasicSceneElement.h\"\n#include \"SurgSim\/Blocks\/TransferInputPoseBehavior.h\"\n#include \"SurgSim\/Blocks\/TransferPoseBehavior.h\"\n#include \"SurgSim\/Devices\/MultiAxis\/MultiAxisDevice.h\"\n#include \"Examples\/ExampleStapling\/StaplerBehavior.h\"\n#include \"SurgSim\/Framework\/BehaviorManager.h\"\n#include \"SurgSim\/Framework\/Runtime.h\"\n#include \"SurgSim\/Framework\/Scene.h\"\n#include \"SurgSim\/Graphics\/OsgBoxRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgCapsuleRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgManager.h\"\n#include \"SurgSim\/Graphics\/OsgSceneryRepresentation.h\"\n#include \"SurgSim\/Graphics\/OsgView.h\"\n#include \"SurgSim\/Graphics\/OsgViewElement.h\"\n#include \"SurgSim\/Input\/InputComponent.h\"\n#include \"SurgSim\/Input\/InputManager.h\"\n#include \"SurgSim\/Math\/BoxShape.h\"\n#include \"SurgSim\/Math\/CapsuleShape.h\"\n#include \"SurgSim\/Math\/RigidTransform.h\"\n#include \"SurgSim\/Physics\/FixedRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidCollisionRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentation.h\"\n#include \"SurgSim\/Physics\/RigidRepresentationParameters.h\"\n#include \"SurgSim\/Physics\/PhysicsManager.h\"\n#include \"SurgSim\/Physics\/VirtualToolCoupler.h\"\n\nusing SurgSim::Blocks::TransferInputPoseBehavior;\nusing SurgSim::Blocks::TransferPoseBehavior;\nusing SurgSim::Blocks::BasicSceneElement;\nusing SurgSim::Framework::BehaviorManager;\nusing SurgSim::Framework::Scene;\nusing SurgSim::Framework::SceneElement;\nusing SurgSim::Framework::Runtime;\nusing SurgSim::Device::MultiAxisDevice;\nusing SurgSim::Graphics::BoxRepresentation;\nusing SurgSim::Graphics::CapsuleRepresentation;\nusing SurgSim::Graphics::OsgBoxRepresentation;\nusing SurgSim::Graphics::OsgCapsuleRepresentation;\nusing SurgSim::Graphics::OsgManager;\nusing SurgSim::Graphics::OsgSceneryRepresentation;\nusing SurgSim::Graphics::OsgViewElement;\nusing SurgSim::Graphics::SceneryRepresentation;\nusing SurgSim::Graphics::ViewElement;\nusing SurgSim::Math::BoxShape;\nusing SurgSim::Math::CapsuleShape;\nusing SurgSim::Math::makeRigidTransform;\nusing SurgSim::Math::Quaterniond;\nusing SurgSim::Math::RigidTransform3d;\nusing SurgSim::Math::Vector3d;\nusing SurgSim::Input::DeviceInterface;\nusing SurgSim::Input::InputComponent;\nusing SurgSim::Input::InputManager;\nusing SurgSim::Physics::FixedRepresentation;\nusing SurgSim::Physics::PhysicsManager;\nusing SurgSim::Physics::RigidRepresentationParameters;\nusing SurgSim::Physics::RigidCollisionRepresentation;\nusing SurgSim::Physics::RigidRepresentation;\nusing SurgSim::Physics::VirtualToolCoupler;\n\n\/\/\/ Load scenery object from file.\n\/\/\/ \\param name Name of this scenery representation.\n\/\/\/ \\param fileName Name of the file from which the scenery representation is loaded.\n\/\/\/ \\param pose The pose of the loaded scenery representation.\n\/\/\/ \\return A SceneElement containing the scenery representation.\nstd::shared_ptr<SceneElement> createSceneryObject(const std::string& name,\n\t\t\t\t\t\t\t\t\t\t\t\t const std::string& fileName,\n\t\t\t\t\t\t\t\t\t\t\t\t const RigidTransform3d& pose)\n{\n\tstd::shared_ptr<SceneryRepresentation> sceneryRepresentation =\n\t\tstd::make_shared<OsgSceneryRepresentation>(name + \"SceneryRepresentation\");\n\tsceneryRepresentation->setFileName(fileName);\n\tsceneryRepresentation->setInitialPose(pose);\n\n\tstd::shared_ptr<BasicSceneElement> sceneElement = std::make_shared<BasicSceneElement>(name + \"SceneElement\");\n\tsceneElement->addComponent(sceneryRepresentation);\n\n\treturn sceneElement;\n}\n\nstd::shared_ptr<ViewElement> createView()\n{\n\tstd::shared_ptr<OsgViewElement> view = std::make_shared<OsgViewElement>(\"StaplingDemoView\");\n\n\tview->enableManipulator(true);\n\tview->setManipulatorParameters(Vector3d(0.0, 0.5, 0.5), Vector3d::Zero());\n\n\treturn view;\n}\n\nstd::shared_ptr<SceneElement> createStapler(const std::string& name)\n{\n\t\/\/ Since there is no collision mesh loader yet, use a capsule shape as the collision representation of the stapler.\n\tstd::shared_ptr<CapsuleShape> capsuleShape = std::make_shared<CapsuleShape>(0.1, 0.02); \/\/ Unit: meter\n\tRigidRepresentationParameters params;\n\tparams.setDensity(8050); \/\/ Stainless steel (in Kg.m-3)\n\tparams.setShapeUsedForMassInertia(capsuleShape);\n\tstd::shared_ptr<RigidRepresentation> physicsRepresentation =\n\t\tstd::make_shared<RigidRepresentation>(name + \"Physics\");\n\tphysicsRepresentation->setInitialParameters(params);\n\n\tstd::shared_ptr<RigidCollisionRepresentation> collisionRepresentation =\n\t\tstd::make_shared<RigidCollisionRepresentation>(name + \"Collision\");\n\tcollisionRepresentation->setRigidRepresentation(physicsRepresentation);\n\n\tstd::shared_ptr<InputComponent> inputComponent = std::make_shared<InputComponent>(\"InputComponent\");\n\tinputComponent->setDeviceName(\"MultiAxisDevice\");\n\n\tstd::shared_ptr<VirtualToolCoupler> inputVTC = std::make_shared<VirtualToolCoupler>(\"VTC\");\n\tinputVTC->setInput(inputComponent);\n\tinputVTC->setRepresentation(physicsRepresentation);\n\tinputVTC->setAngularDamping(params.getMass() * 10e-2);\n\tinputVTC->setAngularStiffness(params.getMass() * 50.0);\n\tinputVTC->setLinearDamping(params.getMass() * 10.0);\n\tinputVTC->setLinearStiffness(params.getMass() * 200.0);\n\n\t\/\/ A stapler behavior controls the release of stale when a button is pushed on the device.\n\t\/\/ Also, it is aware of collisions of the stapler.\n\tstd::shared_ptr<StaplerBehavior> staplerBehavior = std::make_shared<StaplerBehavior>(name + \"StaplerBehavior\");\n\tstaplerBehavior->setInputComponent(inputComponent);\n\tstaplerBehavior->setStaplerRepresentation(collisionRepresentation);\n\n\tstd::shared_ptr<SceneryRepresentation> staplerSceneryRepresentation =\n\t\tstd::make_shared<OsgSceneryRepresentation>(name + \"SceneryRepresentation\");\n\tstaplerSceneryRepresentation->setFileName(\"Geometry\/stapler.obj\");\n\t\/\/ Connect inputComponent to graphical representation.\n\tstd::shared_ptr<TransferInputPoseBehavior> transferInputPose =\n\t\tstd::make_shared<TransferInputPoseBehavior>(name + \"Input to Graphics\");\n\ttransferInputPose->setPoseSender(inputComponent);\n\ttransferInputPose->setPoseReceiver(staplerSceneryRepresentation);\n\n\t\/\/ Visualization of the collision representation.\n\tstd::shared_ptr<CapsuleRepresentation> osgCapsuleRepresentation =\n\t\tstd::make_shared<OsgCapsuleRepresentation>(\"capsule representation\");\n\tosgCapsuleRepresentation->setHeight(capsuleShape->getLength());\n\tosgCapsuleRepresentation->setRadius(capsuleShape->getRadius());\n\t\/\/ Connect physical representation to graphical representation.\n\tstd::shared_ptr<TransferPoseBehavior> transferPose =\n\t\tstd::make_shared<TransferPoseBehavior>(name + \"Physics to Graphics\");\n\ttransferPose->setPoseSender(physicsRepresentation);\n\ttransferPose->setPoseReceiver(osgCapsuleRepresentation);\n\n\tstd::shared_ptr<SceneElement> staplerSceneElement = std::make_shared<BasicSceneElement>(name + \"SceneElement\");\n\tstaplerSceneElement->addComponent(physicsRepresentation);\n\tstaplerSceneElement->addComponent(collisionRepresentation);\n\tstaplerSceneElement->addComponent(osgCapsuleRepresentation);\n\tstaplerSceneElement->addComponent(staplerSceneryRepresentation);\n\tstaplerSceneElement->addComponent(inputComponent);\n\tstaplerSceneElement->addComponent(inputVTC);\n\tstaplerSceneElement->addComponent(staplerBehavior);\n\tstaplerSceneElement->addComponent(transferInputPose);\n\tstaplerSceneElement->addComponent(transferPose);\n\n\treturn staplerSceneElement;\n}\n\nstd::shared_ptr<SceneElement> createArm(const std::string& name, const Vector3d& trans)\n{\n\t\/\/ Load graphic representation for armSceneElement\n\tauto pose = makeRigidTransform(Quaterniond::Identity(), trans);\n\tstd::shared_ptr<SceneElement> armSceneElement = createSceneryObject(name, \"Geometry\/forearm.osgb\", pose);\n\n\tstd::shared_ptr<BoxRepresentation> boxRepresentation =\n\t\tstd::make_shared<OsgBoxRepresentation>(\"box representation\");\n\tauto boxQuat = SurgSim::Math::makeRotationQuaternion(-M_PI \/ 4, SurgSim::Math::Vector3d(0.0, 1.0, 0.0));\n\tauto poseRepresentation = makeRigidTransform(boxQuat, trans);\n\tboxRepresentation->setSize(0.335, 0.05, 0.05); \/\/ Unit: meter\n\tboxRepresentation->setInitialPose(poseRepresentation);\n\n\t\/\/ Since there is no collision mesh loader yet, use a box shape as the collision representation of the arm.\n\tstd::shared_ptr<BoxShape> boxShape = std::make_shared<BoxShape>(boxRepresentation->getSizeX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tboxRepresentation->getSizeY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tboxRepresentation->getSizeZ());\n\n\tRigidRepresentationParameters params;\n\tparams.setDensity(1062); \/\/ Average human body density (in Kg.m-3)\n\tparams.setShapeUsedForMassInertia(boxShape);\n\n\tstd::shared_ptr<FixedRepresentation> physicsRepresentation =\n\t\tstd::make_shared<FixedRepresentation>(name + \"Physics\");\n\tphysicsRepresentation->setInitialParameters(params);\n\tphysicsRepresentation->setInitialPose(poseRepresentation);\n\n\tstd::shared_ptr<RigidCollisionRepresentation> collisionRepresentation =\n\t\tstd::make_shared<RigidCollisionRepresentation>(name + \"Collision\");\n\tcollisionRepresentation->setRigidRepresentation(physicsRepresentation);\n\n\tstd::shared_ptr<TransferPoseBehavior> transferPose =\n\t\tstd::make_shared<TransferPoseBehavior>(\"Physics to Graphics Pose\");\n\ttransferPose->setPoseSender(physicsRepresentation);\n\ttransferPose->setPoseReceiver(boxRepresentation);\n\n\tarmSceneElement->addComponent(boxRepresentation);\n\tarmSceneElement->addComponent(physicsRepresentation);\n\tarmSceneElement->addComponent(collisionRepresentation);\n\tarmSceneElement->addComponent(transferPose);\n\n\treturn armSceneElement;\n}\n\nint main(int argc, char* argv[])\n{\n\tstd::shared_ptr<BehaviorManager> behaviorManager = std::make_shared<BehaviorManager>();\n\tstd::shared_ptr<OsgManager> graphicsManager = std::make_shared<OsgManager>();\n\tstd::shared_ptr<InputManager> inputManager = std::make_shared<InputManager>();\n\tstd::shared_ptr<PhysicsManager> physicsManager = std::make_shared<PhysicsManager>();\n\n\tstd::shared_ptr<Runtime> runtime = std::make_shared<Runtime>(\"config.txt\");\n\truntime->addManager(behaviorManager);\n\truntime->addManager(graphicsManager);\n\truntime->addManager(inputManager);\n\truntime->addManager(physicsManager);\n\n\tstd::shared_ptr<DeviceInterface> device = std::make_shared<MultiAxisDevice>(\"MultiAxisDevice\");\n\tSURGSIM_ASSERT(device->initialize() == true) <<\n\t\t\"Could not initialize device \" << device->getName() << \" for the tool.\\n\";\n\tinputManager->addDevice(device);\n\n\tstd::shared_ptr<SceneElement> staplerSceneElement = createStapler(\"stapler\");\n\tauto armTrans = Vector3d(0.0, -0.2, 0.0);\n\tstd::shared_ptr<SceneElement> armSceneElement = createArm(\"arm\", armTrans);\n\n\tstd::shared_ptr<Scene> scene = runtime->getScene();\n\tscene->addSceneElement(createView());\n\tscene->addSceneElement(staplerSceneElement);\n\tscene->addSceneElement(armSceneElement);\n\n\truntime->execute();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/#define __HAS_TESTPROP__\n\/\/#define __HAS_TESTFIT__\n#define __HAS_AMS_OFFICE_LIBS__\n#include <CPPLibs\/CPPLibs.h>\n#include <ROOTLibs\/ROOTLibs.h>\n#include <TRACKLibs\/TRACKLibs.h>\n\n#include \"\/ams_home\/hchou\/AMSCore\/prod\/18Feb13\/src\/ClassDef.h\"\n#include \"\/ams_home\/hchou\/AMSCore\/prod\/18Feb13\/src\/ClassDef.C\"\n\nusing namespace std;\n\nint main(int argc, char * argv[]) {\n using namespace MGROOT;\n using namespace TrackSys;\n MGROOT::LoadDefaultEnvironment();\n Hist::AddDirectory();\n\n \/\/google::InitGoogleLogging(argv[0]);\n \/\/google::ParseCommandLineFlags(&argc, &argv, true);\n \/\/google::SetStderrLogging(google::GLOG_FATAL);\n\n MGConfig::JobOpt opt(argc, argv);\n\n TChain * dst = new TChain(\"data\");\n for (auto&& file : opt.flist()) dst->Add(file.c_str());\n\n LIST * fList = new LIST;\n G4MC * fG4mc = (opt.mode() == MGConfig::JobOpt::MODE::MC ) ? new G4MC : nullptr;\n RTI * fRti = (opt.mode() == MGConfig::JobOpt::MODE::ISS) ? new RTI : nullptr;\n TRG * fTrg = new TRG ;\n TOF * fTof = new TOF ;\n ACC * fAcc = new ACC ;\n TRK * fTrk = new TRK ;\n TRD * fTrd = new TRD ;\n RICH * fRich = new RICH;\n ECAL * fEcal = new ECAL;\n\n dst->SetBranchAddress(\"list\", &fList);\n if (opt.mode() == MGConfig::JobOpt::MODE::MC)\n dst->SetBranchAddress(\"g4mc\", &fG4mc);\n if (opt.mode() == MGConfig::JobOpt::MODE::ISS)\n dst->SetBranchAddress(\"rti\", &fRti);\n dst->SetBranchAddress(\"trg\", &fTrg);\n dst->SetBranchAddress(\"tof\", &fTof);\n dst->SetBranchAddress(\"acc\", &fAcc);\n dst->SetBranchAddress(\"trk\", &fTrk);\n dst->SetBranchAddress(\"trd\", &fTrd);\n dst->SetBranchAddress(\"rich\", &fRich);\n dst->SetBranchAddress(\"ecal\", &fEcal);\n \n \/\/---------------------------------------------------------------\/\/\n \/\/---------------------------------------------------------------\/\/\n \/\/---------------------------------------------------------------\/\/\n TFile * ofle = new TFile(Form(\"%s\/app_fill%05ld.root\", opt.opath().c_str(), opt.gi()), \"RECREATE\");\n \n Axis AXrig(\"Rigidity [GV]\", 100, 0.5, 4000., AxisScale::kLog);\n Axis AXirig(\"1\/Rigidity [1\/GV]\", AXrig, 1, true);\n \n \n Axis AXtrd(\"TRD Estimator\", 200, 0.0, 1.6);\n Hist * hTRDllr_PR = Hist::New(\"hTRDllr_PR\", HistAxis(AXrig, AXtrd, \"Events\/Bin\"));\n Hist * hTRDllr_NR = Hist::New(\"hTRDllr_NR\", HistAxis(AXrig, AXtrd, \"Events\/Bin\"));\n \n Axis AXchi(\"Log Chi-square X\", 400, -4.0, 8.0);\n Hist * hTRKchix_PR = Hist::New(\"hTRKchix_PR\", HistAxis(AXrig, AXchi, \"Events\/Bin\"));\n Hist * hTRKchix_NR = Hist::New(\"hTRKchix_NR\", HistAxis(AXrig, AXchi, \"Events\/Bin\"));\n Hist * hTRKchiy_PR = Hist::New(\"hTRKchiy_PR\", HistAxis(AXrig, AXchi, \"Events\/Bin\"));\n Hist * hTRKchiy_NR = Hist::New(\"hTRKchiy_NR\", HistAxis(AXrig, AXchi, \"Events\/Bin\"));\n \n Hist * hCKIRflux = Hist::New(\"hCKIRflux\", HistAxis(AXirig, \"Events\/Bin\"));\n Hist * hCNIRflux = Hist::New(\"hCNIRflux\", HistAxis(AXirig, \"Events\/Bin\"));\n Hist * hKFIRflux = Hist::New(\"hKFIRflux\", HistAxis(AXirig, \"Events\/Bin\"));\n Hist * hHCIRflux = Hist::New(\"hHCIRflux\", HistAxis(AXirig, \"Events\/Bin\"));\n \n Hist * hCKPRflux = Hist::New(\"hCKPRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hCNPRflux = Hist::New(\"hCNPRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hKFPRflux = Hist::New(\"hKFPRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hHCPRflux = Hist::New(\"hHCPRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n \n Hist * hCKNRflux = Hist::New(\"hCKNRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hCNNRflux = Hist::New(\"hCNNRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hKFNRflux = Hist::New(\"hKFNRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n Hist * hHCNRflux = Hist::New(\"hHCNRflux\", HistAxis(AXrig, \"Events\/Bin\"));\n \n Long64_t printRate = dst->GetEntries();\n std::cout << Form(\"\\n==== Totally Entries %lld ====\\n\", dst->GetEntries());\n for (Long64_t entry = 0; entry < dst->GetEntries(); ++entry) {\n if (entry%printRate==0) COUT(\"Entry %lld\/%lld\\n\", entry, dst->GetEntries());\n dst->GetEntry(entry);\n \n TrackInfo& track = fTrk->track;\n \n \/\/ Geometry (TOF)\n if (fTof->numOfBetaH != 1) continue;\n if (!fTof->statusBetaH) continue;\n if (fTof->betaHPatt != 15) continue;\n \n \/\/ Geometry (TRD)\n if (fTrd->numOfTrack != 1 && fTrd->numOfHTrack != 1) continue;\n if (!fTrd->statusKCls[0]) continue;\n if (fTrd->LLRnhit[0] < 10) continue;\n \n \/\/ Geometry (ACC)\n if (fAcc->clusters.size() != 0) continue;\n \n \/\/ Down-going\n if (fTof->betaH < 0.) continue;\n\n \/\/ Charge\n if (fTof->Qall < 0.8 || fTof->Qall > 1.3) continue;\n if (track.QIn < 0.8 || track.QIn > 1.3) continue;\n\n \/\/ TOF\n if (fTof->normChisqT > 10.) continue;\n if (fTof->normChisqC > 10.) continue;\n \n if (fTof->numOfInTimeCls > 4) continue;\n if ((fTof->extClsN[0]+fTof->extClsN[1]) > 0 || \n (fTof->extClsN[2]+fTof->extClsN[3]) > 1) continue;\n \n \/\/ TRD\n if (fTrd->LLRph[0] > 0.3) continue;\n \n \/\/ IGRF RTI\n if (opt.mode() == MGConfig::JobOpt::MODE::ISS && track.status[0][0]) {\n if (std::fabs(track.rig[0][0]) < 1.2 * fRti->cfIGRF[0]) continue;\n }\n \n Int_t patt = 0;\n\n Bool_t ck_succ = track.status[0][patt];\n Bool_t cn_succ = track.status[1][patt];\n Bool_t kf_succ = track.status[2][patt];\n Bool_t hc_succ = track.status[3][patt];\n \n Double_t ck_irig = (ck_succ ? MGMath::ONE\/track.rig[0][patt] : 0.);\n Double_t cn_irig = (cn_succ ? MGMath::ONE\/track.rig[1][patt] : 0.);\n Double_t kf_irig = (kf_succ ? MGMath::ONE\/track.rig[2][patt] : 0.);\n Double_t hc_irig = (hc_succ ? MGMath::ONE\/track.rig[3][patt] : 0.);\n \n Short_t ck_sign = (ck_succ ? (ck_irig>0?1:-1) : 0);\n Short_t cn_sign = (cn_succ ? (cn_irig>0?1:-1) : 0);\n Short_t kf_sign = (kf_succ ? (kf_irig>0?1:-1) : 0);\n Short_t hc_sign = (hc_succ ? (hc_irig>0?1:-1) : 0);\n \n Double_t ck_rig = (ck_succ ? std::fabs(1.0\/ck_irig) : 0.);\n Double_t cn_rig = (cn_succ ? std::fabs(1.0\/cn_irig) : 0.);\n Double_t kf_rig = (kf_succ ? std::fabs(1.0\/kf_irig) : 0.);\n Double_t hc_rig = (hc_succ ? std::fabs(1.0\/hc_irig) : 0.);\n \n Double_t ck_chix = (ck_succ ? std::log(track.chisq[0][patt][0]) : 0.); \n Double_t cn_chix = (cn_succ ? std::log(track.chisq[1][patt][0]) : 0.); \n Double_t kf_chix = (kf_succ ? std::log(track.chisq[2][patt][0]) : 0.); \n Double_t hc_chix = (hc_succ ? std::log(track.chisq[3][patt][0]) : 0.); \n \n Double_t ck_chiy = (ck_succ ? std::log(track.chisq[0][patt][1]) : 0.); \n Double_t cn_chiy = (cn_succ ? std::log(track.chisq[1][patt][1]) : 0.); \n Double_t kf_chiy = (kf_succ ? std::log(track.chisq[2][patt][1]) : 0.); \n Double_t hc_chiy = (hc_succ ? std::log(track.chisq[3][patt][1]) : 0.); \n \n if (ck_succ && ck_sign > 0) hTRDllr_PR->fillH2D(ck_rig, fTrd->LLRep[0], fList->weight);\n if (ck_succ && ck_sign < 0) hTRDllr_NR->fillH2D(ck_rig, fTrd->LLRep[0], fList->weight);\n if (ck_succ && ck_sign > 0) hTRKchix_PR->fillH2D(ck_rig, ck_chix, fList->weight);\n if (ck_succ && ck_sign < 0) hTRKchix_NR->fillH2D(ck_rig, ck_chix, fList->weight);\n if (ck_succ && ck_sign > 0) hTRKchiy_PR->fillH2D(ck_rig, ck_chiy, fList->weight);\n if (ck_succ && ck_sign < 0) hTRKchiy_NR->fillH2D(ck_rig, ck_chiy, fList->weight);\n\n if (ck_succ) hCKIRflux->fillH1D(ck_irig, fList->weight);\n if (cn_succ) hCNIRflux->fillH1D(cn_irig, fList->weight);\n if (kf_succ) hKFIRflux->fillH1D(kf_irig, fList->weight);\n if (hc_succ) hHCIRflux->fillH1D(hc_irig, fList->weight);\n \n if (ck_succ && ck_sign > 0) hCKPRflux->fillH1D(ck_rig, fList->weight);\n if (cn_succ && cn_sign > 0) hCNPRflux->fillH1D(cn_rig, fList->weight);\n if (kf_succ && kf_sign > 0) hKFPRflux->fillH1D(kf_rig, fList->weight);\n if (hc_succ && hc_sign > 0) hHCPRflux->fillH1D(hc_rig, fList->weight);\n \n if (ck_succ && ck_sign < 0) hCKNRflux->fillH1D(ck_rig, fList->weight);\n if (cn_succ && cn_sign < 0) hCNNRflux->fillH1D(cn_rig, fList->weight);\n if (kf_succ && kf_sign < 0) hKFNRflux->fillH1D(kf_rig, fList->weight);\n if (hc_succ && hc_sign < 0) hHCNRflux->fillH1D(hc_rig, fList->weight);\n }\n ofle->Write();\n ofle->Close();\n\n \/\/---------------------------------------------------------------\/\/\n \/\/---------------------------------------------------------------\/\/\n \/\/---------------------------------------------------------------\/\/\n if (fList) { delete fList; fList = nullptr; }\n if (fG4mc) { delete fG4mc; fG4mc = nullptr; }\n if (fRti ) { delete fRti ; fRti = nullptr; }\n if (fTrg ) { delete fTrg ; fTrg = nullptr; }\n if (fTof ) { delete fTof ; fTof = nullptr; }\n if (fAcc ) { delete fAcc ; fAcc = nullptr; }\n if (fTrk ) { delete fTrk ; fTrk = nullptr; }\n if (fTrd ) { delete fTrd ; fTrd = nullptr; }\n if (fRich) { delete fRich; fRich = nullptr; }\n if (fEcal) { delete fEcal; fEcal = nullptr; }\n\n return 0;\n}\n<commit_msg>update<commit_after><|endoftext|>"} {"text":"<commit_before>MatrixXd ones = MatrixXd::Ones(3,3);\nEigenSolver<MatrixXd> es(ones);\ncout << \"The first eigenvector of the 3x3 matrix of ones is:\" \n << endl << es.eigenvectors().col(1) << endl;\n<commit_msg>Typo in the example for Eigen::SelfAdjointEigenSolver::eigenvectors, the first eigenvector should be col(0) not col(1)<commit_after>MatrixXd ones = MatrixXd::Ones(3,3);\nEigenSolver<MatrixXd> es(ones);\ncout << \"The first eigenvector of the 3x3 matrix of ones is:\"\n << endl << es.eigenvectors().col(0) << endl;\n<|endoftext|>"} {"text":"<commit_before>\/*--------------------------------------------------------------------------\nFile : PTHSensorTag.cpp\n\nAuthor : Hoang Nguyen Hoan May 8, 2017\n\nDesc : Environmental Sensor BLE demo\n\t\t This application demo shows BLE connectionless using EHAL library\n\t\t It advertises Barometric Pressure, Temperature & Humidity data\n\t\t in manufacturer specific data\n\nCopyright (c) 2017, I-SYST inc., all rights reserved\n\nPermission to use, copy, modify, and distribute this software for any purpose\nwith or without fee is hereby granted, provided that the above copyright\nnotice and this permission notice appear in all copies, and none of the\nnames : I-SYST or its contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nFor info or contributing contact : hnhoan at i-syst dot com\n\nTHIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY\nEXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\nTHIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n----------------------------------------------------------------------------\nModified by Date Description\n\n----------------------------------------------------------------------------*\/\n#include <string.h>\n\n#include \"istddef.h\"\n#include \"ble_app.h\"\n#include \"ble_service.h\"\n#include \"blueio_board.h\"\n#include \"uart.h\"\n#include \"i2c.h\"\n#include \"spi.h\"\n#include \"custom_board.h\"\n#include \"iopincfg.h\"\n#include \"app_util_platform.h\"\n#include \"app_scheduler.h\"\n#include \"pth_bme280.h\"\n#include \"pth_ms8607.h\"\n#include \"timer_nrf5x.h\"\n\n\n#define DEVICE_NAME \"PTHSensorTag\" \/**< Name of device. Will be included in the advertising data. *\/\n\n#define PTH_BME280\n\n\/\/ Use timer to update data\n\/\/ NOTE :\tRTC timer 0 used by radio, RTC Timer 1 used by SDK\n\/\/\t\t\tOnly RTC timer 2 is usable with Softdevice for nRF52, not avail on nRF51\n\/\/\n#ifdef NRF52\n#define USE_TIMER_UPDATE\n#define NEBLINA_MODULE\n#endif\n\n\/\/ NOTE : Min advertisement interval for S130 v2 is 100 ms\n#define APP_ADV_INTERVAL MSEC_TO_UNITS(100, UNIT_0_625_MS) \/**< The advertising interval (in units of 0.625 ms. This value corresponds to 40 ms). *\/\n#ifdef USE_TIMER_UPDATE\n\/\/ Use timer to update date\n#define APP_ADV_TIMEOUT_IN_SECONDS 0 \/**< The advertising timeout (in units of seconds). *\/\n#else\n\/\/ Use advertisement timeout to update data\n#define APP_ADV_TIMEOUT_IN_SECONDS 1 \/**< The advertising timeout (in units of seconds). *\/\n#endif\n\nvoid TimerHandler(Timer *pTimer, uint32_t Evt);\n\n\nuint8_t g_AdvDataBuff[sizeof(PTHSENSOR_DATA) + 1] = {\n\tBLEAPP_ADV_MANDATA_TYPE_PTH,\n};\n\nBLEAPP_ADV_MANDATA &g_AdvData = *(BLEAPP_ADV_MANDATA*)g_AdvDataBuff;\n\n\n\/\/ Evironmental Sensor Data to advertise\nPTHSENSOR_DATA &g_PTHData = *(PTHSENSOR_DATA *)g_AdvData.Data;\n\nconst static TIMER_CFG s_TimerCfg = {\n .DevNo = 2,\n\t.ClkSrc = TIMER_CLKSRC_DEFAULT,\n\t.Freq = 0,\t\t\t\/\/ 0 => Default highest frequency\n\t.IntPrio = APP_IRQ_PRIORITY_LOW,\n\t.EvtHandler = TimerHandler\n};\n\nTimerLFnRF5x g_Timer;\n\nconst BLEAPP_CFG s_BleAppCfg = {\n\t{ \/\/ Clock config nrf_clock_lf_cfg_t\n#ifdef IMM_NRF51822\n\t\tNRF_CLOCK_LF_SRC_RC,\t\/\/ Source RC\n\t\t1, 1, 0\n#else\n\t\tNRF_CLOCK_LF_SRC_XTAL,\t\/\/ Source 32KHz XTAL\n\t\t0, 0, NRF_CLOCK_LF_ACCURACY_20_PPM\/\/ NRF_CLOCK_LF_XTAL_ACCURACY_20_PPM\n#endif\n\n\t},\n\t0, \t\t\t\t\t\t\/\/ Number of central link\n\t0, \t\t\t\t\t\t\/\/ Number of peripheral link\n\tBLEAPP_MODE_NOCONNECT, \/\/ Connectionless beacon type\n\tDEVICE_NAME, \/\/ Device name\n\tISYST_BLUETOOTH_ID, \/\/ PnP Bluetooth\/USB vendor id\n\t1, \/\/ PnP Product ID\n\t0,\t\t\t\t\t\t\/\/ Pnp prod version\n\tfalse,\t\t\t\t\t\/\/ Enable device information service (DIS)\n\tNULL,\n\t(uint8_t*)&g_AdvDataBuff, \/\/ Manufacture specific data to advertise\n\tsizeof(g_AdvDataBuff), \/\/ Length of manufacture specific data\n\tBLEAPP_SECTYPE_NONE, \/\/ Secure connection type\n\tBLEAPP_SECEXCHG_NONE, \/\/ Security key exchange\n\tNULL, \t\t\t\t\/\/ Service uuids to advertise\n\t0, \t\t\t\t\t\t\/\/ Total number of uuids\n\tAPP_ADV_INTERVAL, \/\/ Advertising interval in msec\n\tAPP_ADV_TIMEOUT_IN_SECONDS,\t\/\/ Advertising timeout in sec\n\t100, \/\/ Slow advertising interval, if > 0, fallback to\n\t\t\t\t\t\t\t\t\/\/ slow interval on adv timeout and advertise until connected\n\t0,\n\t0,\n\t-1, \/\/ Led port nuber\n\t-1, \/\/ Led pin number\n\tNULL\t\t\t\t\t\t\/\/ RTOS Softdevice handler\n};\n\n\/\/ Motsai Neblina V2 module uses SPI interface\n\n#define NEBLINA_SPI_BOSCH_DEVNO 2\n#define NEBLINA_SPI_BOSCH_MISO_PORT 0\n#define NEBLINA_SPI_BOSCH_MISO_PIN 13\n#define NEBLINA_SPI_BOSCH_MISO_PINOP 1\n#define NEBLINA_SPI_BOSCH_MOSI_PORT 0\n#define NEBLINA_SPI_BOSCH_MOSI_PIN 12\n#define NEBLINA_SPI_BOSCH_MOSI_PINOP 1\n#define NEBLINA_SPI_BOSCH_SCK_PORT 0\n#define NEBLINA_SPI_BOSCH_SCK_PIN 11\n#define NEBLINA_SPI_BOSCH_SCK_PINOP 1\n#define NEBLINA_SPI_BME280_CS_IDX 1\n#define NEBLINA_SPI_BME280_CS_PORT 0\n#define NEBLINA_SPI_BME280_CS_PIN 26\n#define NEBLINA_SPI_BME280_CS_PINOP 1\n\nstatic const IOPINCFG gsSpiBoschPin[] = {\n {NEBLINA_SPI_BOSCH_SCK_PORT, NEBLINA_SPI_BOSCH_SCK_PIN, NEBLINA_SPI_BOSCH_SCK_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BOSCH_MISO_PORT, NEBLINA_SPI_BOSCH_MISO_PIN, NEBLINA_SPI_BOSCH_MISO_PINOP,\n IOPINDIR_INPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BOSCH_MOSI_PORT, NEBLINA_SPI_BOSCH_MOSI_PIN, NEBLINA_SPI_BOSCH_MOSI_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BME280_CS_PORT, NEBLINA_SPI_BME280_CS_PIN, NEBLINA_SPI_BME280_CS_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_PULLUP, IOPINTYPE_NORMAL},\n};\n\nstatic const SPICFG s_SpiCfg = {\n NEBLINA_SPI_BOSCH_DEVNO,\n SPIMODE_MASTER,\n gsSpiBoschPin,\n sizeof( gsSpiBoschPin ) \/ sizeof( IOPINCFG ),\n 8000000, \/\/ Speed in Hz\n 8, \/\/ Data Size\n 5, \/\/ Max retries\n SPIDATABIT_MSB,\n SPIDATAPHASE_SECOND_CLK, \/\/ Data phase\n SPICLKPOL_LOW, \/\/ clock polarity\n SPICSEL_AUTO,\n 6, \/\/APP_IRQ_PRIORITY_LOW, \/\/ Interrupt priority\n nullptr\n};\n\nSPI g_Spi;\n\n\/\/ Configure I2C interface\nstatic const I2CCFG s_I2cCfg = {\n\t0,\t\t\t\/\/ I2C device number\n\t{\n\n#ifdef PTH_BME280\n\n\t\t{BLUEIO_TAG_BME280_I2C_SDA_PORT, BLUEIO_TAG_BME280_I2C_SDA_PIN, BLUEIO_TAG_BME280_I2C_SDA_PINOP, IOPINDIR_BI, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ RX\n\t\t{BLUEIO_TAG_BME280_I2C_SCL_PORT, BLUEIO_TAG_BME280_I2C_SCL_PIN, BLUEIO_TAG_BME280_I2C_SCL_PINOP, IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ TX\n#else\n\t\t{0, 4, 0, IOPINDIR_BI, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ RX\n\t\t{0, 3, 0, IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ TX\n#endif\n\t},\n\t100000,\t\/\/ Rate\n\tI2CMODE_MASTER,\n\t0,\t\t\t\/\/ Slave address\n\t5,\t\t\t\/\/ Retry\n\t7,\t\t\t\/\/ Interrupt prio\n\tNULL\t\t\/\/ Event callback\n};\n\n\/\/ I2C interface instance\nI2C g_I2c;\n\n#ifdef NEBLINA_MODULE\nDeviceIntrf *g_pIntrf = &g_Spi;\n#else\nDeviceIntrf *g_pIntrf = &g_I2c;\n#endif\n\n\/\/ Configure environmental sensor\nstatic PTHSENSOR_CFG s_PthSensorCfg = {\n#ifdef NEBLINA_MODULE\n 0, \/\/ SPI CS index 0\n#else\n\tBME280_I2C_DEV_ADDR0, \/\/ I2C device address\n#endif\n\tPTHSENSOR_OPMODE_SINGLE,\n\t0\n};\n\n\/\/ Environmental sensor instance\nPthBme280 g_Bme280Sensor;\nPthMS8607 g_MS8607Sensor;\n\n\n#ifdef PTH_BME280\nPTHSensor &g_PthSensor = g_Bme280Sensor;\n#else\nPTHSensor &g_PthSensor = g_MS8607Sensor;\n#endif\n\nvoid ReadPTHData()\n{\n g_pIntrf->Enable();\n\n\tPTHSENSOR_DATA data;\n\n\tg_PthSensor.ReadPTH(data);\n\n\t\/\/ NOTE : M0 does not access unaligned data\n\t\/\/ use local 4 bytes align stack variable then mem copy\n\tmemcpy(&g_PTHData, &data, sizeof(PTHSENSOR_DATA));\n\n\t\/\/ Update advertisement data\n\tBleAppAdvManDataSet(g_AdvDataBuff, sizeof(g_AdvDataBuff));\n\n\tg_pIntrf->Disable();\n}\n\nvoid TimerHandler(Timer *pTimer, uint32_t Evt)\n{\n if (Evt & TIMER_EVT_TRIGGER(0))\n {\n \tReadPTHData();\n }\n}\n\nvoid BlePeriphEvtUserHandler(ble_evt_t * p_ble_evt)\n{\n#ifndef USE_TIMER_UPDATE\n if (p_ble_evt->header.evt_id == BLE_GAP_EVT_TIMEOUT)\n {\n \t\/\/ Update environmental sensor data everytime advertisement timeout\n \t\/\/ for re-advertisement\n \tReadPTHData();\n }\n#endif\n}\n\nvoid HardwareInit()\n{\n\t\/\/ Initialize I2C\n#ifdef NEBLINA_MODULE\n g_Spi.Init(s_SpiCfg);\n#else\n g_I2c.Init(s_I2cCfg);\n#endif\n\n\t\/\/ Inititalize sensor\n g_PthSensor.Init(s_PthSensorCfg, g_pIntrf);\n\n \/\/ Update sensor data\n PTHSENSOR_DATA pthdata;\n\tg_PthSensor.ReadPTH(pthdata);\n\n\t\/\/ Do memcpy to adv data. Due to byte alignment, cannot read directly into\n\t\/\/ adv data\n\tmemcpy(g_AdvData.Data, &pthdata, sizeof(PTHSENSOR_DATA));\n\n\tg_pIntrf->Disable();\n\n#ifdef USE_TIMER_UPDATE\n g_Timer.Init(s_TimerCfg);\n\tuint64_t period = g_Timer.EnableTimerTrigger(0, 500UL, TIMER_TRIG_TYPE_CONTINUOUS);\n#endif\n}\n\nint main()\n{\n HardwareInit();\n\n BleAppInit((const BLEAPP_CFG *)&s_BleAppCfg, true);\n\n BleAppRun();\n\n\treturn 0;\n}\n\n<commit_msg>Add DC\/DC enable<commit_after>\/*--------------------------------------------------------------------------\nFile : PTHSensorTag.cpp\n\nAuthor : Hoang Nguyen Hoan May 8, 2017\n\nDesc : Environmental Sensor BLE demo\n\t\t This application demo shows BLE connectionless using EHAL library\n\t\t It advertises Barometric Pressure, Temperature & Humidity data\n\t\t in manufacturer specific data\n\nCopyright (c) 2017, I-SYST inc., all rights reserved\n\nPermission to use, copy, modify, and distribute this software for any purpose\nwith or without fee is hereby granted, provided that the above copyright\nnotice and this permission notice appear in all copies, and none of the\nnames : I-SYST or its contributors may be used to endorse or\npromote products derived from this software without specific prior written\npermission.\n\nFor info or contributing contact : hnhoan at i-syst dot com\n\nTHIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY\nEXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\nWARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY\nDIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\nLOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\nON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\nTHIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n----------------------------------------------------------------------------\nModified by Date Description\n\n----------------------------------------------------------------------------*\/\n#include <string.h>\n\n#include \"istddef.h\"\n#include \"ble_app.h\"\n#include \"ble_service.h\"\n#include \"nrf_power.h\"\n\n#include \"blueio_board.h\"\n#include \"uart.h\"\n#include \"i2c.h\"\n#include \"spi.h\"\n#include \"custom_board.h\"\n#include \"iopincfg.h\"\n#include \"app_util_platform.h\"\n#include \"app_scheduler.h\"\n#include \"pth_bme280.h\"\n#include \"pth_ms8607.h\"\n#include \"timer_nrf5x.h\"\n\n\n#define DEVICE_NAME \"PTHSensorTag\" \/**< Name of device. Will be included in the advertising data. *\/\n\n#define PTH_BME280\n\n\/\/ Use timer to update data\n\/\/ NOTE :\tRTC timer 0 used by radio, RTC Timer 1 used by SDK\n\/\/\t\t\tOnly RTC timer 2 is usable with Softdevice for nRF52, not avail on nRF51\n\/\/\n#ifdef NRF52\n#define USE_TIMER_UPDATE\n#define NEBLINA_MODULE\n#endif\n\n\/\/ NOTE : Min advertisement interval for S130 v2 is 100 ms\n#define APP_ADV_INTERVAL MSEC_TO_UNITS(100, UNIT_0_625_MS) \/**< The advertising interval (in units of 0.625 ms. This value corresponds to 40 ms). *\/\n#ifdef USE_TIMER_UPDATE\n\/\/ Use timer to update date\n#define APP_ADV_TIMEOUT_IN_SECONDS 0 \/**< The advertising timeout (in units of seconds). *\/\n#else\n\/\/ Use advertisement timeout to update data\n#define APP_ADV_TIMEOUT_IN_SECONDS 1 \/**< The advertising timeout (in units of seconds). *\/\n#endif\n\nvoid TimerHandler(Timer *pTimer, uint32_t Evt);\n\n\nuint8_t g_AdvDataBuff[sizeof(PTHSENSOR_DATA) + 1] = {\n\tBLEAPP_ADV_MANDATA_TYPE_PTH,\n};\n\nBLEAPP_ADV_MANDATA &g_AdvData = *(BLEAPP_ADV_MANDATA*)g_AdvDataBuff;\n\n\n\/\/ Evironmental Sensor Data to advertise\nPTHSENSOR_DATA &g_PTHData = *(PTHSENSOR_DATA *)g_AdvData.Data;\n\nconst static TIMER_CFG s_TimerCfg = {\n .DevNo = 2,\n\t.ClkSrc = TIMER_CLKSRC_DEFAULT,\n\t.Freq = 0,\t\t\t\/\/ 0 => Default highest frequency\n\t.IntPrio = APP_IRQ_PRIORITY_LOW,\n\t.EvtHandler = TimerHandler\n};\n\nTimerLFnRF5x g_Timer;\n\nconst BLEAPP_CFG s_BleAppCfg = {\n\t{ \/\/ Clock config nrf_clock_lf_cfg_t\n#ifdef IMM_NRF51822\n\t\tNRF_CLOCK_LF_SRC_RC,\t\/\/ Source RC\n\t\t1, 1, 0\n#else\n\t\tNRF_CLOCK_LF_SRC_XTAL,\t\/\/ Source 32KHz XTAL\n\t\t0, 0, NRF_CLOCK_LF_ACCURACY_20_PPM\/\/ NRF_CLOCK_LF_XTAL_ACCURACY_20_PPM\n#endif\n\n\t},\n\t0, \t\t\t\t\t\t\/\/ Number of central link\n\t0, \t\t\t\t\t\t\/\/ Number of peripheral link\n\tBLEAPP_MODE_NOCONNECT, \/\/ Connectionless beacon type\n\tDEVICE_NAME, \/\/ Device name\n\tISYST_BLUETOOTH_ID, \/\/ PnP Bluetooth\/USB vendor id\n\t1, \/\/ PnP Product ID\n\t0,\t\t\t\t\t\t\/\/ Pnp prod version\n\tfalse,\t\t\t\t\t\/\/ Enable device information service (DIS)\n\tNULL,\n\t(uint8_t*)&g_AdvDataBuff, \/\/ Manufacture specific data to advertise\n\tsizeof(g_AdvDataBuff), \/\/ Length of manufacture specific data\n\tBLEAPP_SECTYPE_NONE, \/\/ Secure connection type\n\tBLEAPP_SECEXCHG_NONE, \/\/ Security key exchange\n\tNULL, \t\t\t\t\/\/ Service uuids to advertise\n\t0, \t\t\t\t\t\t\/\/ Total number of uuids\n\tAPP_ADV_INTERVAL, \/\/ Advertising interval in msec\n\tAPP_ADV_TIMEOUT_IN_SECONDS,\t\/\/ Advertising timeout in sec\n\t100, \/\/ Slow advertising interval, if > 0, fallback to\n\t\t\t\t\t\t\t\t\/\/ slow interval on adv timeout and advertise until connected\n\t0,\n\t0,\n\t-1, \/\/ Led port nuber\n\t-1, \/\/ Led pin number\n\tNULL\t\t\t\t\t\t\/\/ RTOS Softdevice handler\n};\n\n\/\/ Motsai Neblina V2 module uses SPI interface\n\n#define NEBLINA_SPI_BOSCH_DEVNO 2\n#define NEBLINA_SPI_BOSCH_MISO_PORT 0\n#define NEBLINA_SPI_BOSCH_MISO_PIN 13\n#define NEBLINA_SPI_BOSCH_MISO_PINOP 1\n#define NEBLINA_SPI_BOSCH_MOSI_PORT 0\n#define NEBLINA_SPI_BOSCH_MOSI_PIN 12\n#define NEBLINA_SPI_BOSCH_MOSI_PINOP 1\n#define NEBLINA_SPI_BOSCH_SCK_PORT 0\n#define NEBLINA_SPI_BOSCH_SCK_PIN 11\n#define NEBLINA_SPI_BOSCH_SCK_PINOP 1\n#define NEBLINA_SPI_BME280_CS_IDX 1\n#define NEBLINA_SPI_BME280_CS_PORT 0\n#define NEBLINA_SPI_BME280_CS_PIN 26\n#define NEBLINA_SPI_BME280_CS_PINOP 1\n\nstatic const IOPINCFG gsSpiBoschPin[] = {\n {NEBLINA_SPI_BOSCH_SCK_PORT, NEBLINA_SPI_BOSCH_SCK_PIN, NEBLINA_SPI_BOSCH_SCK_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BOSCH_MISO_PORT, NEBLINA_SPI_BOSCH_MISO_PIN, NEBLINA_SPI_BOSCH_MISO_PINOP,\n IOPINDIR_INPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BOSCH_MOSI_PORT, NEBLINA_SPI_BOSCH_MOSI_PIN, NEBLINA_SPI_BOSCH_MOSI_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\n {NEBLINA_SPI_BME280_CS_PORT, NEBLINA_SPI_BME280_CS_PIN, NEBLINA_SPI_BME280_CS_PINOP,\n IOPINDIR_OUTPUT, IOPINRES_PULLUP, IOPINTYPE_NORMAL},\n};\n\nstatic const SPICFG s_SpiCfg = {\n NEBLINA_SPI_BOSCH_DEVNO,\n SPIMODE_MASTER,\n gsSpiBoschPin,\n sizeof( gsSpiBoschPin ) \/ sizeof( IOPINCFG ),\n 8000000, \/\/ Speed in Hz\n 8, \/\/ Data Size\n 5, \/\/ Max retries\n SPIDATABIT_MSB,\n SPIDATAPHASE_SECOND_CLK, \/\/ Data phase\n SPICLKPOL_LOW, \/\/ clock polarity\n SPICSEL_AUTO,\n 6, \/\/APP_IRQ_PRIORITY_LOW, \/\/ Interrupt priority\n nullptr\n};\n\nSPI g_Spi;\n\n\/\/ Configure I2C interface\nstatic const I2CCFG s_I2cCfg = {\n\t0,\t\t\t\/\/ I2C device number\n\t{\n\n#ifdef PTH_BME280\n\n\t\t{BLUEIO_TAG_BME280_I2C_SDA_PORT, BLUEIO_TAG_BME280_I2C_SDA_PIN, BLUEIO_TAG_BME280_I2C_SDA_PINOP, IOPINDIR_BI, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ RX\n\t\t{BLUEIO_TAG_BME280_I2C_SCL_PORT, BLUEIO_TAG_BME280_I2C_SCL_PIN, BLUEIO_TAG_BME280_I2C_SCL_PINOP, IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ TX\n#else\n\t\t{0, 4, 0, IOPINDIR_BI, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ RX\n\t\t{0, 3, 0, IOPINDIR_OUTPUT, IOPINRES_NONE, IOPINTYPE_NORMAL},\t\/\/ TX\n#endif\n\t},\n\t100000,\t\/\/ Rate\n\tI2CMODE_MASTER,\n\t0,\t\t\t\/\/ Slave address\n\t5,\t\t\t\/\/ Retry\n\t7,\t\t\t\/\/ Interrupt prio\n\tNULL\t\t\/\/ Event callback\n};\n\n\/\/ I2C interface instance\nI2C g_I2c;\n\n#ifdef NEBLINA_MODULE\nDeviceIntrf *g_pIntrf = &g_Spi;\n#else\nDeviceIntrf *g_pIntrf = &g_I2c;\n#endif\n\n\/\/ Configure environmental sensor\nstatic PTHSENSOR_CFG s_PthSensorCfg = {\n#ifdef NEBLINA_MODULE\n 0, \/\/ SPI CS index 0\n#else\n\tBME280_I2C_DEV_ADDR0, \/\/ I2C device address\n#endif\n\tPTHSENSOR_OPMODE_SINGLE,\n\t0\n};\n\n\/\/ Environmental sensor instance\nPthBme280 g_Bme280Sensor;\nPthMS8607 g_MS8607Sensor;\n\n\n#ifdef PTH_BME280\nPTHSensor &g_PthSensor = g_Bme280Sensor;\n#else\nPTHSensor &g_PthSensor = g_MS8607Sensor;\n#endif\n\nvoid ReadPTHData()\n{\n g_pIntrf->Enable();\n\n\tPTHSENSOR_DATA data;\n\n\tg_PthSensor.ReadPTH(data);\n\n\t\/\/ NOTE : M0 does not access unaligned data\n\t\/\/ use local 4 bytes align stack variable then mem copy\n\tmemcpy(&g_PTHData, &data, sizeof(PTHSENSOR_DATA));\n\n\t\/\/ Update advertisement data\n\tBleAppAdvManDataSet(g_AdvDataBuff, sizeof(g_AdvDataBuff));\n\n\tg_pIntrf->Disable();\n}\n\nvoid TimerHandler(Timer *pTimer, uint32_t Evt)\n{\n if (Evt & TIMER_EVT_TRIGGER(0))\n {\n \tReadPTHData();\n }\n}\n\nvoid BlePeriphEvtUserHandler(ble_evt_t * p_ble_evt)\n{\n#ifndef USE_TIMER_UPDATE\n if (p_ble_evt->header.evt_id == BLE_GAP_EVT_TIMEOUT)\n {\n \t\/\/ Update environmental sensor data everytime advertisement timeout\n \t\/\/ for re-advertisement\n \tReadPTHData();\n }\n#endif\n}\n\nvoid HardwareInit()\n{\n\t\/\/ Set this only if nRF is power at 2V or more\n\tnrf_power_dcdcen_set(true);\n\n\t\/\/ Initialize I2C\n#ifdef NEBLINA_MODULE\n g_Spi.Init(s_SpiCfg);\n#else\n g_I2c.Init(s_I2cCfg);\n#endif\n\n\t\/\/ Inititalize sensor\n g_PthSensor.Init(s_PthSensorCfg, g_pIntrf);\n\n \/\/ Update sensor data\n PTHSENSOR_DATA pthdata;\n\tg_PthSensor.ReadPTH(pthdata);\n\n\t\/\/ Do memcpy to adv data. Due to byte alignment, cannot read directly into\n\t\/\/ adv data\n\tmemcpy(g_AdvData.Data, &pthdata, sizeof(PTHSENSOR_DATA));\n\n\tg_pIntrf->Disable();\n\n#ifdef USE_TIMER_UPDATE\n g_Timer.Init(s_TimerCfg);\n\tuint64_t period = g_Timer.EnableTimerTrigger(0, 500UL, TIMER_TRIG_TYPE_CONTINUOUS);\n#endif\n}\n\nint main()\n{\n HardwareInit();\n\n BleAppInit((const BLEAPP_CFG *)&s_BleAppCfg, true);\n\n BleAppRun();\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <gmock\/gmock.h>\n\n#include <liblocate\/utils.h>\n\n\nclass utils_test : public testing::Test\n{\npublic:\n utils_test()\n {\n }\n};\n\n\nTEST_F(utils_test, unifiedPath_NoPath)\n{\n char * str1 = \"A-string\";\n\n unifiedPath(str1, strlen(str1));\n\n EXPECT_STREQ(str1, \"A-string\");\n}\n\nTEST_F(utils_test, unifiedPath_UnixPath)\n{\n char * str1 = \"\/usr\/include\/c++\/v1\/tuple\";\n\n unifiedPath(str1, strlen(str1));\n\n EXPECT_STREQ(str1, \"\/usr\/include\/c++\/v1\/tuple\");\n}\n\nTEST_F(utils_test, unifiedPath_WindowsPath)\n{\n char * str1 = \"C:\\\\dev\\\\include\\\\c++\\\\v1\\\\tuple\";\n\n unifiedPath(str1, strlen(str1));\n\n EXPECT_STREQ(str1, \"C:\/dev\/include\/c++\/v1\/tuple\");\n}\n<commit_msg>First C tests<commit_after>\n#include <gmock\/gmock.h>\n\n#include <liblocate\/utils.h>\n\n\nclass utils_test : public testing::Test\n{\npublic:\n utils_test()\n {\n }\n};\n\n\nTEST_F(utils_test, unifiedPath_NoPath)\n{\n const char * source = \"A-string\";\n const char * expected = \"A-string\";\n\n const unsigned int length = strlen(source);\n char * actual = reinterpret_cast<char*>(malloc(sizeof(char) * length+1));\n memcpy(actual, source, length+1);\n\n unifiedPath(actual, length);\n\n EXPECT_STREQ(expected, actual);\n}\n\nTEST_F(utils_test, unifiedPath_UnixPath)\n{\n const char * source = \"\/usr\/include\/c++\/v1\/tuple\";\n const char * expected = \"\/usr\/include\/c++\/v1\/tuple\";\n\n const unsigned int length = strlen(source);\n char * actual = reinterpret_cast<char*>(malloc(sizeof(char) * length+1));\n memcpy(actual, source, length+1);\n\n unifiedPath(actual, length);\n\n EXPECT_STREQ(expected, actual);\n}\n\nTEST_F(utils_test, unifiedPath_WindowsPath)\n{\n const char * source = \"C:\\\\dev\\\\include\\\\c++\\\\v1\\\\tuple\";\n const char * expected = \"C:\/dev\/include\/c++\/v1\/tuple\";\n\n const unsigned int length = strlen(source);\n char * actual = reinterpret_cast<char*>(malloc(sizeof(char) * length+1));\n memcpy(actual, source, length+1);\n\n unifiedPath(actual, length);\n\n EXPECT_STREQ(expected, actual);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\n#include <stack>\nusing namespace std;\n\n\/\/#define BOOST_THREAD_PROVIDES_VARIADIC_THREAD\n\/\/#define BOOST_THREAD_PROVIDES_FUTURE\n#define BOOST_THREAD_VERSION 4\n#include <boost\/bind.hpp>\n#include <boost\/atomic.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/thread\/lock_factories.hpp>\nusing namespace boost;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <boost\/chrono.hpp>\nusing namespace boost::chrono;\nseconds operator\"\" _s(unsigned long long n)\n{\n return seconds(n);\n}\n\nmilliseconds operator\"\" _ms(unsigned long long n)\n{\n return milliseconds(n);\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass buffer\n{\n private:\n mutex mu;\n condition_variable_any cond_put;\n condition_variable_any cond_get;\n\n stack<int> stk;\n int un_read,capacity;\n\n bool is_full()\n { return un_read == capacity; }\n\n bool is_empty()\n { return un_read == 0 ; }\n public:\n buffer(size_t n):un_read(0),capacity(n){}\n\n void put(int x)\n {\n {\n auto lock = make_unique_lock(mu);\n cond_put.wait(lock,\n [this]{return un_read < capacity;});\n \/\/for(;is_full();)\n \/\/{\n \/\/ cout << \"full waiting... \" << endl;\n \/\/ cond_put.wait(lock);\n \/\/}\n stk.push(x);\n ++un_read;\n }\n cond_get.notify_one();\n }\n\n void get(int *x)\n {\n {\n auto lock = make_unique_lock(mu);\n cond_get.wait(lock,\n [this]{return un_read > 0;});\n \/\/for(;is_empty();)\n \/\/{\n \/\/ cout << \"empty waiting... \" << endl;\n \/\/ cond_get.wait(lock);\n \/\/}\n --un_read;\n *x = stk.top();\n stk.pop();\n }\n cond_put.notify_one();\n }\n};\n\nbuffer buf(5);\n\nvoid producer(int n)\n{\n for (int i = 0;i < n; ++i)\n {\n cout << \"put \" << i << endl;\n buf.put(i);\n }\n}\n\nvoid consumer( int n)\n{\n int x;\n for (int i = 0;i < n; ++i)\n {\n buf.get(&x);\n cout << \"get \" << x << endl;\n }\n}\n\n\nvoid case1()\n{\n thread_group tg;\n\n tg.create_thread(bind(producer, 20));\n tg.create_thread(bind(consumer, 10));\n tg.create_thread(bind(consumer, 10));\n\n tg.join_all();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/#include <future>\nvoid dummy(int n)\n{\n for(int i = 0;i < n; ++i);\n cout << n << endl;\n}\nvoid case2()\n{\n \/\/auto x = async(&dummy, 10);\n \/\/x.wait();\n\n boost::async(bind(dummy, 10));\n\n auto f = boost::async([]{cout << \"hello\" << endl;});\n f.wait();\n\n async(launch::async, dummy, 100);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint fab(int n)\n{\n if (n == 0 || n == 1)\n { return 1; }\n return fab(n-1) + fab(n-2);\n}\n\nvoid case3()\n{\n auto f5 = async(fab, 5);\n auto f7 = async(launch::async, fab, 7);\n\n cout << f5.get() + f7.get() << endl;\n assert(!f5.valid() && !f7.valid());\n\n auto f10 = async(fab, 10);\n auto s = f10.wait_for(100_ms);\n\n if(f10.valid())\n {\n assert(s == future_status::ready);\n cout << f10.get() << endl;\n }\n\n vector<boost::future<int>> vec;\n for(int i = 0;i < 5; ++i)\n {\n vec.push_back(async(fab, i + 10));\n }\n\n wait_for_any(vec[3], vec[4], vec[2]);\n for(auto& x : vec)\n {\n if(x.valid())\n { cout << x.get() << endl; }\n }\n\n \/\/wait_for_all(vec.begin(), vec.end());\n\n \/\/for(auto& x : vec)\n \/\/{\n \/\/ cout << x.get() << ',';\n \/\/}\n cout << endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n \/\/shared_future<int> f5 = async(fab, 5);\n auto f5 = async(fab, 5).share();\n \/\/cout << f5.get() << endl;\n\n auto func = [](decltype(f5) f){\n cout << \"[\" << f.get() << \"]\";\n };\n\n async(func, f5);\n async(func, f5);\n\n this_thread::sleep_for(100_ms);\n\n assert(f5.valid());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n auto func = [](int n, promise<int>& p){\n p.set_value(fab(n));\n };\n\n promise<int> p;\n\n thread(func, 10, boost::ref(p)).detach();\n\n auto f = p.get_future();\n cout << f.get() << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n atomic<int> x;\n barrier br(5);\n\n auto func = [&](){\n cout << \"thread\"<< ++x <<\" arrived barrier.\" << endl;\n br.wait();\n cout << \"thread run.\" << endl;\n };\n\n thread_group tg;\n for (int i = 0;i < 5;++i)\n {\n tg.create_thread(func);\n }\n tg.join_all();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid case7()\n{\n thread_specific_ptr<int> pi;\n\n auto func = [&]{\n pi.reset(new int());\n\n ++(*pi);\n cout << \"thread v=\" << *pi << endl;\n };\n async(func);\n async(func);\n\n this_thread::sleep_for(100_ms);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main()\n{\n cout << \"thread v=\" << BOOST_THREAD_VERSION << endl;\n \/\/case1();\n case2();\n case3();\n case4();\n case5();\n case6();\n case7();\n \/\/case8();\n}\n\n<commit_msg>fix boost::atomic<commit_after>\/\/ Copyright (c) 2015\n\/\/ Author: Chrono Law\n#include <std.hpp>\n#include <stack>\nusing namespace std;\n\n\/\/#define BOOST_THREAD_PROVIDES_VARIADIC_THREAD\n\/\/#define BOOST_THREAD_PROVIDES_FUTURE\n#define BOOST_THREAD_VERSION 4\n#include <boost\/bind.hpp>\n#include <boost\/atomic.hpp>\n#include <boost\/thread.hpp>\n#include <boost\/thread\/lock_factories.hpp>\nusing namespace boost;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <boost\/chrono.hpp>\nusing namespace boost::chrono;\nseconds operator\"\" _s(unsigned long long n)\n{\n return seconds(n);\n}\n\nmilliseconds operator\"\" _ms(unsigned long long n)\n{\n return milliseconds(n);\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nclass buffer\n{\n private:\n mutex mu;\n condition_variable_any cond_put;\n condition_variable_any cond_get;\n\n stack<int> stk;\n int un_read,capacity;\n\n bool is_full()\n { return un_read == capacity; }\n\n bool is_empty()\n { return un_read == 0 ; }\n public:\n buffer(size_t n):un_read(0),capacity(n){}\n\n void put(int x)\n {\n {\n auto lock = make_unique_lock(mu);\n cond_put.wait(lock,\n [this]{return un_read < capacity;});\n \/\/for(;is_full();)\n \/\/{\n \/\/ cout << \"full waiting... \" << endl;\n \/\/ cond_put.wait(lock);\n \/\/}\n stk.push(x);\n ++un_read;\n }\n cond_get.notify_one();\n }\n\n void get(int *x)\n {\n {\n auto lock = make_unique_lock(mu);\n cond_get.wait(lock,\n [this]{return un_read > 0;});\n \/\/for(;is_empty();)\n \/\/{\n \/\/ cout << \"empty waiting... \" << endl;\n \/\/ cond_get.wait(lock);\n \/\/}\n --un_read;\n *x = stk.top();\n stk.pop();\n }\n cond_put.notify_one();\n }\n};\n\nbuffer buf(5);\n\nvoid producer(int n)\n{\n for (int i = 0;i < n; ++i)\n {\n cout << \"put \" << i << endl;\n buf.put(i);\n }\n}\n\nvoid consumer( int n)\n{\n int x;\n for (int i = 0;i < n; ++i)\n {\n buf.get(&x);\n cout << \"get \" << x << endl;\n }\n}\n\n\nvoid case1()\n{\n thread_group tg;\n\n tg.create_thread(bind(producer, 20));\n tg.create_thread(bind(consumer, 10));\n tg.create_thread(bind(consumer, 10));\n\n tg.join_all();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/#include <future>\nvoid dummy(int n)\n{\n for(int i = 0;i < n; ++i);\n cout << n << endl;\n}\nvoid case2()\n{\n \/\/auto x = async(&dummy, 10);\n \/\/x.wait();\n\n boost::async(bind(dummy, 10));\n\n auto f = boost::async([]{cout << \"hello\" << endl;});\n f.wait();\n\n async(launch::async, dummy, 100);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint fab(int n)\n{\n if (n == 0 || n == 1)\n { return 1; }\n return fab(n-1) + fab(n-2);\n}\n\nvoid case3()\n{\n auto f5 = async(fab, 5);\n auto f7 = async(launch::async, fab, 7);\n\n cout << f5.get() + f7.get() << endl;\n assert(!f5.valid() && !f7.valid());\n\n auto f10 = async(fab, 10);\n auto s = f10.wait_for(100_ms);\n\n if(f10.valid())\n {\n assert(s == future_status::ready);\n cout << f10.get() << endl;\n }\n\n vector<boost::future<int>> vec;\n for(int i = 0;i < 5; ++i)\n {\n vec.push_back(async(fab, i + 10));\n }\n\n wait_for_any(vec[3], vec[4], vec[2]);\n for(auto& x : vec)\n {\n if(x.valid())\n { cout << x.get() << endl; }\n }\n\n \/\/wait_for_all(vec.begin(), vec.end());\n\n \/\/for(auto& x : vec)\n \/\/{\n \/\/ cout << x.get() << ',';\n \/\/}\n cout << endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case4()\n{\n \/\/shared_future<int> f5 = async(fab, 5);\n auto f5 = async(fab, 5).share();\n \/\/cout << f5.get() << endl;\n\n auto func = [](decltype(f5) f){\n cout << \"[\" << f.get() << \"]\";\n };\n\n async(func, f5);\n async(func, f5);\n\n this_thread::sleep_for(100_ms);\n\n assert(f5.valid());\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case5()\n{\n auto func = [](int n, promise<int>& p){\n p.set_value(fab(n));\n };\n\n promise<int> p;\n\n thread(func, 10, boost::ref(p)).detach();\n\n auto f = p.get_future();\n cout << f.get() << endl;\n\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid case6()\n{\n boost::atomic<int> x;\n barrier br(5);\n\n auto func = [&](){\n cout << \"thread\"<< ++x <<\" arrived barrier.\" << endl;\n br.wait();\n cout << \"thread run.\" << endl;\n };\n\n thread_group tg;\n for (int i = 0;i < 5;++i)\n {\n tg.create_thread(func);\n }\n tg.join_all();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid case7()\n{\n thread_specific_ptr<int> pi;\n\n auto func = [&]{\n pi.reset(new int());\n\n ++(*pi);\n cout << \"thread v=\" << *pi << endl;\n };\n async(func);\n async(func);\n\n this_thread::sleep_for(100_ms);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main()\n{\n cout << \"thread v=\" << BOOST_THREAD_VERSION << endl;\n \/\/case1();\n case2();\n case3();\n case4();\n case5();\n case6();\n case7();\n \/\/case8();\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>VRC7 modulator disabled for testing -- doesn't sound right. Will have to check O-scope to see where the wave is going wrong.<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright since 2016 : Evgenii Shatunov (github.com\/FrankStain\/jnipp-test)\r\n\/\/ Apache 2.0 License\r\n#include <main.h>\r\n#include <gtest\/gtest.h>\r\n\r\n\r\n#define DECLARE_MEMBER_FIELD_TEST_ENV( TYPE, NAME )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestFieldStorage\" };\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FieldHandle<TYPE>\tfield{ class_handle, \"m_\" NAME \"_field\" };\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ObjectHandle\t\ttest_object{ Jni::ObjectHandle::NewObject( class_handle ) };\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( field );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( test_object )\r\n\r\n#define DECLARE_STATIC_FIELD_TEST_ENV( TYPE, NAME )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestStaticFieldStorage\" };\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFieldHandle<TYPE>\tfield{ class_handle, NAME \"_field\" };\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( field )\r\n\r\n#define DECLARE_MEMBER_FUNCTION_TEST_ENV( NAME, RET, ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle derived_class{ \"com\/pfs\/jnipptest\/TestFunctionDerivedContainer\" };\t\t\t\t\t\t\\\r\n\tJni::ClassHandle basic_class{ derived_class.GetParentClassHandle() };\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FunctionHandle<RET, ##__VA_ARGS__>\tfunc{ basic_class, NAME };\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FieldHandle<bool>\t\t\t\t\tcall_check{ basic_class, \"m_is_called\" };\t\t\t\t\t\t\\\r\n\tJni::ObjectHandle\t\t\t\t\t\ttest_object{ Jni::ObjectHandle::NewObject( derived_class ) };\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( func );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( test_object )\r\n\r\n#define EXAMINE_MEMBER_FUNCTION_CALL_FLAG( ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tbool is_called = false;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( call_check.GetValue( test_object, is_called ) );\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( is_called );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t}\r\n\r\n#define DECLARE_STATIC_FUNCTION_TEST_ENV( NAME, RET, ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestStaticFunctionContainer\" };\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFunctionHandle<RET, ##__VA_ARGS__>\tfunc{ class_handle, NAME };\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFieldHandle<bool>\t\t\t\t\tcall_check{ class_handle, \"is_called\" };\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( func );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check.SetValue( false ) )\r\n\r\n#define EXAMINE_STATIC_FUNCTION_CALL_FLAG( ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tbool is_called = false;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( call_check.GetValue( is_called ) );\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( is_called );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t}\r\n\r\n\r\nTEST( TestEnvironment, Allocation )\r\n{\r\n\tJni::JniEnv\tlocal_env;\r\n\r\n\tEXPECT_TRUE( local_env.IsValid() );\r\n\tEXPECT_TRUE( local_env );\r\n};\r\n\r\nTEST( TestEnvironment, MemberFieldGetValue )\r\n{\r\n\tDECLARE_MEMBER_FIELD_TEST_ENV( bool, \"bool\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tbool field_value;\r\n\tEXPECT_TRUE( local_env.GetValue( field, test_object, field_value ) );\r\n\r\n\tEXPECT_TRUE( field_value );\r\n};\r\n\r\nTEST( TestEnvironment, StaticFieldGetValue )\r\n{\r\n\tDECLARE_STATIC_FIELD_TEST_ENV( bool, \"bool\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tbool field_value;\r\n\tEXPECT_TRUE( local_env.GetValue( field, field_value ) );\r\n\r\n\tEXPECT_TRUE( field_value );\r\n};\r\n\r\nTEST( TestEnvironment, MemberFieldSetValue )\r\n{\r\n\tDECLARE_MEMBER_FIELD_TEST_ENV( std::string, \"string\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tconst char* field_value = \"Hello Jni++\";\r\n\tEXPECT_TRUE( local_env.SetValue( field, test_object, { field_value } ) );\r\n\r\n\tstd::string field_check;\r\n\tEXPECT_TRUE( local_env.GetValue( field, test_object, field_check ) );\r\n\r\n\tEXPECT_STREQ( field_value, field_check.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, StaticFieldSetValue )\r\n{\r\n\tDECLARE_STATIC_FIELD_TEST_ENV( std::string, \"string\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tconst char* field_value = \"Hello Jni++\";\r\n\tEXPECT_TRUE( local_env.SetValue( field, { field_value } ) );\r\n\r\n\tstd::string field_check;\r\n\tEXPECT_TRUE( local_env.GetValue( field, field_check ) );\r\n\r\n\tEXPECT_STREQ( field_value, field_check.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, CallMemberFunction )\r\n{\r\n\tDECLARE_MEMBER_FUNCTION_TEST_ENV( \"StringTwoArguments\", std::string, std::string, std::string );\r\n\r\n\tJni::JniEnv local_env;\r\n\r\n\tauto ret = local_env.Call( func, test_object, { \"1\" }, { \"2\" } );\r\n\tEXAMINE_MEMBER_FUNCTION_CALL_FLAG();\r\n\r\n\tEXPECT_STREQ( \"1 2\", ret.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, CallStaticFunction )\r\n{\r\n\tDECLARE_STATIC_FUNCTION_TEST_ENV( \"StringTwoArguments\", std::string, std::string, std::string );\r\n\r\n\tJni::JniEnv local_env;\r\n\r\n\tauto ret = local_env.Call( func, { \"1\" }, { \"2\" } );\r\n\tEXAMINE_STATIC_FUNCTION_CALL_FLAG();\r\n\r\n\tEXPECT_STREQ( \"1 2\", ret.c_str() );\r\n};\r\n<commit_msg>Full tests for Jni++ Environment.<commit_after>\/\/ Copyright since 2016 : Evgenii Shatunov (github.com\/FrankStain\/jnipp-test)\r\n\/\/ Apache 2.0 License\r\n#include <main.h>\r\n#include <gtest\/gtest.h>\r\n\r\n\r\n#define DECLARE_MEMBER_FIELD_TEST_ENV( TYPE, NAME )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestFieldStorage\" };\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FieldHandle<TYPE>\tfield{ class_handle, \"m_\" NAME \"_field\" };\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ObjectHandle\t\ttest_object{ Jni::ObjectHandle::NewObject( class_handle ) };\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( field );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( test_object )\r\n\r\n#define DECLARE_STATIC_FIELD_TEST_ENV( TYPE, NAME )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestStaticFieldStorage\" };\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFieldHandle<TYPE>\tfield{ class_handle, NAME \"_field\" };\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( field );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFunctionHandle<void> reset_func{ class_handle, \"Reset\" };\t\t\t\t\t\t\t\t\t\\\r\n\treset_func.Call()\r\n\r\n#define DECLARE_MEMBER_FUNCTION_TEST_ENV( NAME, RET, ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle basic_class{ \"com\/pfs\/jnipptest\/TestFunctionContainer\" };\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FunctionHandle<RET, ##__VA_ARGS__>\tfunc{ basic_class, NAME };\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FieldHandle<bool>\t\t\t\t\tcall_check{ basic_class, \"m_is_called\" };\t\t\t\t\t\t\\\r\n\tJni::ObjectHandle\t\t\t\t\t\ttest_object{ Jni::ObjectHandle::NewObject( basic_class ) };\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( func );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( test_object )\r\n\r\n#define DECLARE_MEMBER_NONVIRTUAL_FUNCTION_TEST_ENV( NAME, RET, ... )\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle derived_class{ \"com\/pfs\/jnipptest\/TestFunctionDerivedContainer\" };\t\t\t\t\t\t\\\r\n\tJni::ClassHandle basic_class{ derived_class.GetParentClassHandle() };\t\t\t\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FunctionHandle<RET, ##__VA_ARGS__>\tfunc{ basic_class, NAME };\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::FieldHandle<bool>\t\t\t\t\tcall_check{ basic_class, \"m_is_called\" };\t\t\t\t\t\t\\\r\n\tJni::ObjectHandle\t\t\t\t\t\ttest_object{ Jni::ObjectHandle::NewObject( derived_class ) };\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( func );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( test_object )\r\n\r\n#define EXAMINE_MEMBER_FUNCTION_CALL_FLAG( ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tbool is_called = false;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( call_check.GetValue( test_object, is_called ) );\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( is_called );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t}\r\n\r\n#define DECLARE_STATIC_FUNCTION_TEST_ENV( NAME, RET, ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::ClassHandle class_handle{ \"com\/pfs\/jnipptest\/TestStaticFunctionContainer\" };\t\t\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFunctionHandle<RET, ##__VA_ARGS__>\tfunc{ class_handle, NAME };\t\t\t\t\t\t\t\t\\\r\n\tJni::StaticFieldHandle<bool>\t\t\t\t\tcall_check{ class_handle, \"is_called\" };\t\t\t\t\\\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( func );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\tEXPECT_TRUE( call_check.SetValue( false ) )\r\n\r\n#define EXAMINE_STATIC_FUNCTION_CALL_FLAG( ... )\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t{\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tbool is_called = false;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( call_check.GetValue( is_called ) );\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t\tEXPECT_TRUE( is_called );\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\\\r\n\t}\r\n\r\n\r\nTEST( TestEnvironment, Allocation )\r\n{\r\n\tJni::JniEnv\tlocal_env;\r\n\r\n\tEXPECT_TRUE( local_env.IsValid() );\r\n\tEXPECT_TRUE( local_env );\r\n};\r\n\r\nTEST( TestEnvironment, MemberFieldGetValue )\r\n{\r\n\tDECLARE_MEMBER_FIELD_TEST_ENV( bool, \"bool\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tbool field_value;\r\n\tEXPECT_TRUE( local_env.GetValue( field, test_object, field_value ) );\r\n\r\n\tEXPECT_TRUE( field_value );\r\n};\r\n\r\nTEST( TestEnvironment, StaticFieldGetValue )\r\n{\r\n\tDECLARE_STATIC_FIELD_TEST_ENV( bool, \"bool\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tbool field_value;\r\n\tEXPECT_TRUE( local_env.GetValue( field, field_value ) );\r\n\r\n\tEXPECT_TRUE( field_value );\r\n};\r\n\r\nTEST( TestEnvironment, MemberFieldSetValue )\r\n{\r\n\tDECLARE_MEMBER_FIELD_TEST_ENV( std::string, \"string\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tconst char* field_value = \"Hello Jni++\";\r\n\tEXPECT_TRUE( local_env.SetValue( field, test_object, field_value ) );\r\n\r\n\tstd::string field_check;\r\n\tEXPECT_TRUE( local_env.GetValue( field, test_object, field_check ) );\r\n\r\n\tEXPECT_STREQ( field_value, field_check.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, StaticFieldSetValue )\r\n{\r\n\tDECLARE_STATIC_FIELD_TEST_ENV( std::string, \"string\" );\r\n\r\n\tJni::JniEnv local_env;\r\n\tconst char* field_value = \"Hello Jni++\";\r\n\tEXPECT_TRUE( local_env.SetValue( field, field_value ) );\r\n\r\n\tstd::string field_check;\r\n\tEXPECT_TRUE( local_env.GetValue( field, field_check ) );\r\n\r\n\tEXPECT_STREQ( field_value, field_check.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, CallMemberFunction )\r\n{\r\n\tDECLARE_MEMBER_FUNCTION_TEST_ENV( \"StringTwoArguments\", std::string, std::string, std::string );\r\n\r\n\tJni::JniEnv local_env;\r\n\r\n\tauto ret = local_env.Call( func, test_object, \"1\", \"2\" );\r\n\tEXAMINE_MEMBER_FUNCTION_CALL_FLAG();\r\n\r\n\tEXPECT_STREQ( \"1 2\", ret.c_str() );\r\n};\r\n\r\nTEST( TestEnvironment, CallStaticFunction )\r\n{\r\n\tDECLARE_STATIC_FUNCTION_TEST_ENV( \"StringTwoArguments\", std::string, std::string, std::string );\r\n\r\n\tJni::JniEnv local_env;\r\n\r\n\tauto ret = local_env.Call( func, \"1\", \"2\" );\r\n\tEXAMINE_STATIC_FUNCTION_CALL_FLAG();\r\n\r\n\tEXPECT_STREQ( \"1 2\", ret.c_str() );\r\n};\r\n<|endoftext|>"} {"text":"<commit_before>\/* This software is distributed under BSD 3-clause license (see LICENSE file).\n *\n * Copyright (c) 2012-2013 Sergey Lisitsyn\n *\/\n\n#ifndef TAPKEE_MDS_H_\n#define TAPKEE_MDS_H_\n\n\/* Tapkee includes *\/\n#include <shogun\/lib\/tapkee\/tapkee_defines.hpp>\n#include <shogun\/lib\/tapkee\/utils\/time.hpp>\n\/* End of Tapkee includes *\/\n\n#include <algorithm>\n\nusing std::random_shuffle;\nusing std::fill;\n\nnamespace tapkee\n{\nnamespace tapkee_internal\n{\n\ntemplate <class RandomAccessIterator>\nLandmarks select_landmarks_random(RandomAccessIterator begin, RandomAccessIterator end, ScalarType ratio)\n{\n\tLandmarks landmarks;\n\tlandmarks.reserve(end-begin);\n\tfor (RandomAccessIterator iter=begin; iter!=end; ++iter)\n\t\tlandmarks.push_back(iter-begin);\n\trandom_shuffle(landmarks.begin(),landmarks.end());\n\tlandmarks.erase(landmarks.begin() + static_cast<IndexType>(landmarks.size()*ratio),landmarks.end());\n\treturn landmarks;\n}\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nDenseSymmetricMatrix compute_distance_matrix(RandomAccessIterator begin, RandomAccessIterator \/*end*\/,\n const Landmarks& landmarks, PairwiseCallback callback)\n{\n\ttimed_context context(\"Multidimensional scaling distance matrix computation\");\n\n\tconst IndexType n_landmarks = landmarks.size();\n\tDenseSymmetricMatrix distance_matrix(n_landmarks,n_landmarks);\n\n#pragma omp parallel shared(begin,landmarks,distance_matrix,callback) default(none)\n\t{\n\t\tIndexType i_index_iter,j_index_iter;\n#pragma omp for nowait\n\t\tfor (i_index_iter=0; i_index_iter<n_landmarks; ++i_index_iter)\n\t\t{\n\t\t\tfor (j_index_iter=i_index_iter; j_index_iter<n_landmarks; ++j_index_iter)\n\t\t\t{\n\t\t\t\tScalarType d = callback(begin[landmarks[i_index_iter]],begin[landmarks[j_index_iter]]);\n\t\t\t\td *= d;\n\t\t\t\tdistance_matrix(i_index_iter,j_index_iter) = d;\n\t\t\t\tdistance_matrix(j_index_iter,i_index_iter) = d;\n\t\t\t}\n\t\t}\n\t}\n\treturn distance_matrix;\n};\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nEmbeddingResult triangulate(RandomAccessIterator begin, RandomAccessIterator end, PairwiseCallback distance_callback,\n const Landmarks& landmarks, const DenseVector& landmark_distances_squared, \n EmbeddingResult& landmarks_embedding, IndexType target_dimension)\n{\n\ttimed_context context(\"Landmark triangulation\");\n\t\n\tbool* to_process = new bool[end-begin];\n\tfill(to_process,to_process+(end-begin),true);\n\t\n\tDenseMatrix embedding((end-begin),target_dimension);\n\n\tfor (Landmarks::const_iterator iter=landmarks.begin(); \n\t\t\titer!=landmarks.end(); ++iter)\n\t{\n\t\tto_process[*iter] = false;\n\t\tembedding.row(*iter).noalias() = landmarks_embedding.first.row(iter-landmarks.begin());\n\t}\n\n\tfor (IndexType i=0; i<target_dimension; ++i)\n\t\tlandmarks_embedding.first.col(i).array() \/= landmarks_embedding.second(i);\n\n#pragma omp parallel shared(begin,end,to_process,distance_callback,landmarks, \\\n\t\tlandmarks_embedding,landmark_distances_squared,embedding) default(none)\n\t{\n\t\tDenseVector distances_to_landmarks = DenseVector(landmarks.size());\n\t\tIndexType index_iter;\n#pragma omp for nowait\n\t\tfor (index_iter=0; index_iter<IndexType(end-begin); ++index_iter)\n\t\t{\n\t\t\tif (!to_process[index_iter])\n\t\t\t\tcontinue;\n\n\t\t\tfor (IndexType i=0; i<distances_to_landmarks.size(); ++i)\n\t\t\t{\n\t\t\t\tScalarType d = distance_callback(begin[index_iter],begin[landmarks[i]]);\n\t\t\t\tdistances_to_landmarks(i) = d*d;\n\t\t\t}\n\t\t\t\/\/distances_to_landmarks.array().square();\n\n\t\t\tdistances_to_landmarks -= landmark_distances_squared;\n\t\t\tembedding.row(index_iter).noalias() = -0.5*landmarks_embedding.first.transpose()*distances_to_landmarks;\n\t\t}\n\t}\n\n\tdelete[] to_process;\n\n\treturn EmbeddingResult(embedding,DenseVector());\n}\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nDenseSymmetricMatrix compute_distance_matrix(RandomAccessIterator begin, RandomAccessIterator end, \n PairwiseCallback callback)\n{\n\ttimed_context context(\"Multidimensional scaling distance matrix computation\");\n\n\tconst IndexType n_vectors = end-begin;\n\tDenseSymmetricMatrix distance_matrix(n_vectors,n_vectors);\n\n#pragma omp parallel shared(begin,distance_matrix,callback) default(none)\n\t{\n\t\tIndexType i_index_iter,j_index_iter;\n#pragma omp for nowait\n\t\tfor (i_index_iter=0; i_index_iter<n_vectors; ++i_index_iter)\n\t\t{\n\t\t\tfor (j_index_iter=i_index_iter; j_index_iter<n_vectors; ++j_index_iter)\n\t\t\t{\n\t\t\t\tScalarType d = callback(begin[i_index_iter],begin[j_index_iter]);\n\t\t\t\td *= d;\n\t\t\t\tdistance_matrix(i_index_iter,j_index_iter) = d;\n\t\t\t\tdistance_matrix(j_index_iter,i_index_iter) = d;\n\t\t\t}\n\t\t}\n\t}\n\treturn distance_matrix;\n};\n\n}\n}\n\n#endif\n<commit_msg>Hopefully last update of tapkee before release<commit_after>\/* This software is distributed under BSD 3-clause license (see LICENSE file).\n *\n * Copyright (c) 2012-2013 Sergey Lisitsyn\n *\/\n\n#ifndef TAPKEE_MDS_H_\n#define TAPKEE_MDS_H_\n\n\/* Tapkee includes *\/\n#include <shogun\/lib\/tapkee\/tapkee_defines.hpp>\n#include <shogun\/lib\/tapkee\/utils\/time.hpp>\n\/* End of Tapkee includes *\/\n\n#include <algorithm>\n\nusing std::random_shuffle;\nusing std::fill;\n\nnamespace tapkee\n{\nnamespace tapkee_internal\n{\n\ntemplate <class RandomAccessIterator>\nLandmarks select_landmarks_random(RandomAccessIterator begin, RandomAccessIterator end, ScalarType ratio)\n{\n\tLandmarks landmarks;\n\tlandmarks.reserve(end-begin);\n\tfor (RandomAccessIterator iter=begin; iter!=end; ++iter)\n\t\tlandmarks.push_back(iter-begin);\n\trandom_shuffle(landmarks.begin(),landmarks.end());\n\tlandmarks.erase(landmarks.begin() + static_cast<IndexType>(landmarks.size()*ratio),landmarks.end());\n\treturn landmarks;\n}\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nDenseSymmetricMatrix compute_distance_matrix(RandomAccessIterator begin, RandomAccessIterator \/*end*\/,\n const Landmarks& landmarks, PairwiseCallback callback)\n{\n\ttimed_context context(\"Multidimensional scaling distance matrix computation\");\n\n\tconst IndexType n_landmarks = landmarks.size();\n\tDenseSymmetricMatrix distance_matrix(n_landmarks,n_landmarks);\n\n#pragma omp parallel shared(begin,landmarks,distance_matrix,callback) default(none)\n\t{\n\t\tIndexType i_index_iter,j_index_iter;\n#pragma omp for nowait\n\t\tfor (i_index_iter=0; i_index_iter<n_landmarks; ++i_index_iter)\n\t\t{\n\t\t\tfor (j_index_iter=i_index_iter; j_index_iter<n_landmarks; ++j_index_iter)\n\t\t\t{\n\t\t\t\tScalarType d = callback(begin[landmarks[i_index_iter]],begin[landmarks[j_index_iter]]);\n\t\t\t\td *= d;\n\t\t\t\tdistance_matrix(i_index_iter,j_index_iter) = d;\n\t\t\t\tdistance_matrix(j_index_iter,i_index_iter) = d;\n\t\t\t}\n\t\t}\n\t}\n\treturn distance_matrix;\n};\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nEmbeddingResult triangulate(RandomAccessIterator begin, RandomAccessIterator end, PairwiseCallback distance_callback,\n const Landmarks& landmarks, const DenseVector& landmark_distances_squared, \n EmbeddingResult& landmarks_embedding, IndexType target_dimension)\n{\n\ttimed_context context(\"Landmark triangulation\");\n\t\n\tconst IndexType n_vectors = end-begin;\n\tconst IndexType n_landmarks = landmarks.size();\n\n\tbool* to_process = new bool[n_vectors];\n\tfill(to_process,to_process+n_vectors,true);\n\t\n\tDenseMatrix embedding(n_vectors,target_dimension);\n\n\tfor (IndexType index_iter=0; index_iter<n_landmarks; ++index_iter)\n\t{\n\t\tto_process[landmarks[index_iter]] = false;\n\t\tembedding.row(landmarks[index_iter]).noalias() = landmarks_embedding.first.row(index_iter);\n\t}\n\n\tfor (IndexType i=0; i<target_dimension; ++i)\n\t\tlandmarks_embedding.first.col(i).array() \/= landmarks_embedding.second(i);\n\n#pragma omp parallel shared(begin,end,to_process,distance_callback,landmarks, \\\n\t\tlandmarks_embedding,landmark_distances_squared,embedding) default(none)\n\t{\n\t\tDenseVector distances_to_landmarks(n_landmarks);\n\t\tIndexType index_iter;\n#pragma omp for nowait\n\t\tfor (index_iter=0; index_iter<n_vectors; ++index_iter)\n\t\t{\n\t\t\tif (!to_process[index_iter])\n\t\t\t\tcontinue;\n\n\t\t\tfor (IndexType i=0; i<n_landmarks; ++i)\n\t\t\t{\n\t\t\t\tScalarType d = distance_callback(begin[index_iter],begin[landmarks[i]]);\n\t\t\t\tdistances_to_landmarks(i) = d*d;\n\t\t\t}\n\t\t\t\/\/distances_to_landmarks.array().square();\n\n\t\t\tdistances_to_landmarks -= landmark_distances_squared;\n\t\t\tembedding.row(index_iter).noalias() = -0.5*landmarks_embedding.first.transpose()*distances_to_landmarks;\n\t\t}\n\t}\n\n\tdelete[] to_process;\n\n\treturn EmbeddingResult(embedding,DenseVector());\n}\n\ntemplate <class RandomAccessIterator, class PairwiseCallback>\nDenseSymmetricMatrix compute_distance_matrix(RandomAccessIterator begin, RandomAccessIterator end, \n PairwiseCallback callback)\n{\n\ttimed_context context(\"Multidimensional scaling distance matrix computation\");\n\n\tconst IndexType n_vectors = end-begin;\n\tDenseSymmetricMatrix distance_matrix(n_vectors,n_vectors);\n\n#pragma omp parallel shared(begin,distance_matrix,callback) default(none)\n\t{\n\t\tIndexType i_index_iter,j_index_iter;\n#pragma omp for nowait\n\t\tfor (i_index_iter=0; i_index_iter<n_vectors; ++i_index_iter)\n\t\t{\n\t\t\tfor (j_index_iter=i_index_iter; j_index_iter<n_vectors; ++j_index_iter)\n\t\t\t{\n\t\t\t\tScalarType d = callback(begin[i_index_iter],begin[j_index_iter]);\n\t\t\t\td *= d;\n\t\t\t\tdistance_matrix(i_index_iter,j_index_iter) = d;\n\t\t\t\tdistance_matrix(j_index_iter,i_index_iter) = d;\n\t\t\t}\n\t\t}\n\t}\n\treturn distance_matrix;\n};\n\n}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 Peter Georg\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"memoryregion.hpp\"\n#include <stdexcept>\n\n#ifdef VERBS_ODP\n#include \"odp.hpp\"\n#endif \/\/ VERBS_ODP\n\npMR::verbs::MemoryRegion::MemoryRegion(Context &context,\n ProtectionDomain &protectionDomain, void *buffer, std::uint32_t size,\n int access)\n{\n#ifdef VERBS_ODP\n access = updateMemoryRegionAccessODP(context, access);\n#endif \/\/ VERBS_ODP\n\n if(size > context.getMaxMemoryRegionSize() ||\n size > context.getMaxMessageSize())\n {\n throw std::length_error(\"pMR: Message size overflow.\");\n }\n\n registerMemoryRegion(protectionDomain, buffer, size, access);\n}\n\npMR::verbs::MemoryRegion::~MemoryRegion()\n{\n if(getLength() > 0)\n {\n ibv_dereg_mr(mMemoryRegion);\n }\n else\n {\n delete mMemoryRegion;\n }\n}\n\nibv_mr *pMR::verbs::MemoryRegion::get()\n{\n return mMemoryRegion;\n}\n\nibv_mr const *pMR::verbs::MemoryRegion::get() const\n{\n return mMemoryRegion;\n}\n\nstd::uint64_t pMR::verbs::MemoryRegion::getAddress() const\n{\n return {reinterpret_cast<std::uintptr_t>(mMemoryRegion->addr)};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getLKey() const\n{\n return {mMemoryRegion->lkey};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getRKey() const\n{\n return {mMemoryRegion->rkey};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getLength() const\n{\n return {static_cast<std::uint32_t>(mMemoryRegion->length)};\n}\n\nvoid pMR::verbs::MemoryRegion::registerMemoryRegion(\n ProtectionDomain &protectionDomain, void *buffer, std::uint32_t const size,\n int const access)\n{\n if(size > 0)\n {\n mMemoryRegion =\n ibv_reg_mr(protectionDomain.get(), buffer, {size}, {access});\n\n if(!mMemoryRegion)\n {\n throw std::runtime_error(\"pMR: Could not register Memory Region.\");\n }\n }\n else\n {\n mMemoryRegion = new ibv_mr;\n mMemoryRegion->addr = buffer;\n mMemoryRegion->lkey = 0;\n mMemoryRegion->rkey = 0;\n mMemoryRegion->length = 0;\n }\n}\n<commit_msg>Better handle zero-sized memory regions<commit_after>\/\/ Copyright 2016 Peter Georg\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"memoryregion.hpp\"\n#include <stdexcept>\n\n#ifdef VERBS_ODP\n#include \"odp.hpp\"\n#endif \/\/ VERBS_ODP\n\npMR::verbs::MemoryRegion::MemoryRegion(Context &context,\n ProtectionDomain &protectionDomain, void *buffer, std::uint32_t size,\n int access)\n{\n#ifdef VERBS_ODP\n access = updateMemoryRegionAccessODP(context, access);\n#endif \/\/ VERBS_ODP\n\n if(size > context.getMaxMemoryRegionSize() ||\n size > context.getMaxMessageSize())\n {\n throw std::length_error(\"pMR: Message size overflow.\");\n }\n\n registerMemoryRegion(protectionDomain, buffer, size, access);\n}\n\npMR::verbs::MemoryRegion::~MemoryRegion()\n{\n ibv_dereg_mr(mMemoryRegion);\n}\n\nibv_mr *pMR::verbs::MemoryRegion::get()\n{\n return mMemoryRegion;\n}\n\nibv_mr const *pMR::verbs::MemoryRegion::get() const\n{\n return mMemoryRegion;\n}\n\nstd::uint64_t pMR::verbs::MemoryRegion::getAddress() const\n{\n return {reinterpret_cast<std::uintptr_t>(mMemoryRegion->addr)};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getLKey() const\n{\n return {mMemoryRegion->lkey};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getRKey() const\n{\n return {mMemoryRegion->rkey};\n}\n\nstd::uint32_t pMR::verbs::MemoryRegion::getLength() const\n{\n return {static_cast<std::uint32_t>(mMemoryRegion->length)};\n}\n\nvoid pMR::verbs::MemoryRegion::registerMemoryRegion(\n ProtectionDomain &protectionDomain, void *buffer, std::uint32_t const size,\n int const access)\n{\n if(size == 0 && buffer == nullptr)\n {\n buffer = &mMemoryRegion;\n }\n mMemoryRegion =\n ibv_reg_mr(protectionDomain.get(), buffer, {size}, {access});\n\n if(!mMemoryRegion)\n {\n throw std::runtime_error(\"pMR: Could not register Memory Region.\");\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ sha3.cpp\n\/\/ Copyright (c) 2014 Stephan Brumme. All rights reserved.\n\/\/ see http:\/\/create.stephan-brumme.com\/disclaimer.html\n\/\/\n\n#include \"susi\/util\/sha3.h\"\n\n\/\/ big endian architectures need #define __BYTE_ORDER __BIG_ENDIAN\n#ifndef _MSC_VER\n#include <endian.h>\n#endif\n\n\n\/\/\/ same as reset()\nSHA3::SHA3( Bits bits )\n : m_blockSize( 200 - 2 * ( bits \/ 8 ) ),\n m_bits( bits )\n{\n reset();\n}\n\n\n\/\/\/ restart\nvoid SHA3::reset()\n{\n for( size_t i = 0; i < StateSize; i++ )\n m_hash[i] = 0;\n\n m_numBytes = 0;\n m_bufferSize = 0;\n}\n\n\n\/\/\/ constants and local helper functions\nnamespace\n{\n const unsigned int Rounds = 24;\n const uint64_t XorMasks[Rounds] =\n {\n 0x0000000000000001ULL, 0x0000000000008082ULL, 0x800000000000808aULL,\n 0x8000000080008000ULL, 0x000000000000808bULL, 0x0000000080000001ULL,\n 0x8000000080008081ULL, 0x8000000000008009ULL, 0x000000000000008aULL,\n 0x0000000000000088ULL, 0x0000000080008009ULL, 0x000000008000000aULL,\n 0x000000008000808bULL, 0x800000000000008bULL, 0x8000000000008089ULL,\n 0x8000000000008003ULL, 0x8000000000008002ULL, 0x8000000000000080ULL,\n 0x000000000000800aULL, 0x800000008000000aULL, 0x8000000080008081ULL,\n 0x8000000000008080ULL, 0x0000000080000001ULL, 0x8000000080008008ULL\n };\n\n \/\/\/ rotate left and wrap around to the right\n inline uint64_t rotateLeft( uint64_t x, uint8_t numBits )\n {\n return ( x << numBits ) | ( x >> ( 64 - numBits ) );\n }\n\n \/\/\/ convert litte vs big endian\n inline uint64_t swap( uint64_t x )\n {\n#if defined(__GNUC__) || defined(__clang__)\n return __builtin_bswap64( x );\n#endif\n#ifdef MSC_VER\n return _byteswap_uint64( x );\n#endif\n\n return ( x >> 56 ) |\n ( ( x >> 40 ) & 0x000000000000FF00ULL ) |\n ( ( x >> 24 ) & 0x0000000000FF0000ULL ) |\n ( ( x >> 8 ) & 0x00000000FF000000ULL ) |\n ( ( x << 8 ) & 0x000000FF00000000ULL ) |\n ( ( x << 24 ) & 0x0000FF0000000000ULL ) |\n ( ( x << 40 ) & 0x00FF000000000000ULL ) |\n ( x << 56 );\n }\n\n\n \/\/\/ return x % 5 for 0 <= x <= 9\n unsigned int mod5( unsigned int x )\n {\n if( x < 5 )\n return x;\n\n return x - 5;\n }\n}\n\n\n\/\/\/ process a full block\nvoid SHA3::processBlock( const void* data )\n{\n#if defined(__BYTE_ORDER) && (__BYTE_ORDER != 0) && (__BYTE_ORDER == __BIG_ENDIAN)\n#define LITTLEENDIAN(x) swap(x)\n#else\n#define LITTLEENDIAN(x) (x)\n#endif\n\n const uint64_t* data64 = ( const uint64_t* ) data;\n \/\/ mix data into state\n for( unsigned int i = 0; i < m_blockSize \/ 8; i++ )\n m_hash[i] ^= LITTLEENDIAN( data64[i] );\n\n \/\/ re-compute state\n for( unsigned int round = 0; round < Rounds; round++ )\n {\n \/\/ Theta\n uint64_t coefficients[5];\n for( unsigned int i = 0; i < 5; i++ )\n coefficients[i] = m_hash[i] ^ m_hash[i + 5] ^ m_hash[i + 10] ^ m_hash[i + 15] ^ m_hash[i + 20];\n\n for( unsigned int i = 0; i < 5; i++ )\n {\n uint64_t one = coefficients[mod5( i + 4 )] ^ rotateLeft( coefficients[mod5( i + 1 )], 1 );\n m_hash[i ] ^= one;\n m_hash[i + 5] ^= one;\n m_hash[i + 10] ^= one;\n m_hash[i + 15] ^= one;\n m_hash[i + 20] ^= one;\n }\n\n \/\/ temporary\n uint64_t one;\n\n \/\/ Rho Pi\n uint64_t last = m_hash[1];\n one = m_hash[10];\n m_hash[10] = rotateLeft( last, 1 );\n last = one;\n one = m_hash[ 7];\n m_hash[ 7] = rotateLeft( last, 3 );\n last = one;\n one = m_hash[11];\n m_hash[11] = rotateLeft( last, 6 );\n last = one;\n one = m_hash[17];\n m_hash[17] = rotateLeft( last, 10 );\n last = one;\n one = m_hash[18];\n m_hash[18] = rotateLeft( last, 15 );\n last = one;\n one = m_hash[ 3];\n m_hash[ 3] = rotateLeft( last, 21 );\n last = one;\n one = m_hash[ 5];\n m_hash[ 5] = rotateLeft( last, 28 );\n last = one;\n one = m_hash[16];\n m_hash[16] = rotateLeft( last, 36 );\n last = one;\n one = m_hash[ 8];\n m_hash[ 8] = rotateLeft( last, 45 );\n last = one;\n one = m_hash[21];\n m_hash[21] = rotateLeft( last, 55 );\n last = one;\n one = m_hash[24];\n m_hash[24] = rotateLeft( last, 2 );\n last = one;\n one = m_hash[ 4];\n m_hash[ 4] = rotateLeft( last, 14 );\n last = one;\n one = m_hash[15];\n m_hash[15] = rotateLeft( last, 27 );\n last = one;\n one = m_hash[23];\n m_hash[23] = rotateLeft( last, 41 );\n last = one;\n one = m_hash[19];\n m_hash[19] = rotateLeft( last, 56 );\n last = one;\n one = m_hash[13];\n m_hash[13] = rotateLeft( last, 8 );\n last = one;\n one = m_hash[12];\n m_hash[12] = rotateLeft( last, 25 );\n last = one;\n one = m_hash[ 2];\n m_hash[ 2] = rotateLeft( last, 43 );\n last = one;\n one = m_hash[20];\n m_hash[20] = rotateLeft( last, 62 );\n last = one;\n one = m_hash[14];\n m_hash[14] = rotateLeft( last, 18 );\n last = one;\n one = m_hash[22];\n m_hash[22] = rotateLeft( last, 39 );\n last = one;\n one = m_hash[ 9];\n m_hash[ 9] = rotateLeft( last, 61 );\n last = one;\n one = m_hash[ 6];\n m_hash[ 6] = rotateLeft( last, 20 );\n last = one;\n m_hash[ 1] = rotateLeft( last, 44 );\n\n \/\/ Chi\n for( unsigned int j = 0; j < 25; j += 5 )\n {\n \/\/ temporaries\n uint64_t one = m_hash[j];\n uint64_t two = m_hash[j + 1];\n\n m_hash[j] ^= m_hash[j + 2] & ~two;\n m_hash[j + 1] ^= m_hash[j + 3] & ~m_hash[j + 2];\n m_hash[j + 2] ^= m_hash[j + 4] & ~m_hash[j + 3];\n m_hash[j + 3] ^= one & ~m_hash[j + 4];\n m_hash[j + 4] ^= two & ~one;\n }\n\n \/\/ Iota\n m_hash[0] ^= XorMasks[round];\n }\n}\n\n\n\/\/\/ add arbitrary number of bytes\nvoid SHA3::add( const void* data, size_t numBytes )\n{\n const uint8_t* current = ( const uint8_t* ) data;\n\n if( m_bufferSize > 0 )\n {\n while( numBytes > 0 && m_bufferSize < m_blockSize )\n {\n m_buffer[m_bufferSize++] = *current++;\n numBytes--;\n }\n }\n\n \/\/ full buffer\n if( m_bufferSize == m_blockSize )\n {\n processBlock( ( void* )m_buffer );\n m_numBytes += m_blockSize;\n m_bufferSize = 0;\n }\n\n \/\/ no more data ?\n if( numBytes == 0 )\n return;\n\n \/\/ process full blocks\n while( numBytes >= m_blockSize )\n {\n processBlock( current );\n current += m_blockSize;\n m_numBytes += m_blockSize;\n numBytes -= m_blockSize;\n }\n\n \/\/ keep remaining bytes in buffer\n while( numBytes > 0 )\n {\n m_buffer[m_bufferSize++] = *current++;\n numBytes--;\n }\n}\n\n\n\/\/\/ process everything left in the internal buffer\nvoid SHA3::processBuffer()\n{\n unsigned int blockSize = 200 - 2 * ( m_bits \/ 8 );\n\n \/\/ add padding\n size_t offset = m_bufferSize;\n \/\/ add a \"1\" byte\n m_buffer[offset++] = 0x06;\n \/\/ fill with zeros\n while( offset < blockSize - 1 )\n m_buffer[offset++] = 0;\n\n \/\/ and add a single set bit\n m_buffer[blockSize - 1] = 0x80;\n\n processBlock( m_buffer );\n}\n\n\n\/\/\/ return latest hash as 16 hex characters\nstd::string SHA3::getHash()\n{\n \/\/ process remaining bytes\n processBuffer();\n\n \/\/ convert hash to string\n static const char dec2hex[16 + 1] = \"0123456789abcdef\";\n\n \/\/ number of significant elements in hash (uint64_t)\n unsigned int hashLength = m_bits \/ 64;\n\n std::string result;\n for( unsigned int i = 0; i < hashLength; i++ )\n for( unsigned int j = 0; j < 8; j++ ) \/\/ 64 bits => 8 bytes\n {\n \/\/ convert a byte to hex\n unsigned char oneByte = ( unsigned char )( m_hash[i] >> ( 8 * j ) );\n result += dec2hex[oneByte >> 4];\n result += dec2hex[oneByte & 15];\n }\n\n return result;\n}\n\n\n\/\/\/ compute SHA3 of a memory block\nstd::string SHA3::operator()( const void* data, size_t numBytes )\n{\n reset();\n add( data, numBytes );\n return getHash();\n}\n\n\n\/\/\/ compute SHA3 of a string, excluding final zero\nstd::string SHA3::operator()( const std::string& text )\n{\n reset();\n add( text.c_str(), text.size() );\n return getHash();\n}\n<commit_msg>[susi-common] fixed wrong include path in sha3.cpp;<commit_after>\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ sha3.cpp\n\/\/ Copyright (c) 2014 Stephan Brumme. All rights reserved.\n\/\/ see http:\/\/create.stephan-brumme.com\/disclaimer.html\n\/\/\n\n#include \"susi\/sha3.h\"\n\n\/\/ big endian architectures need #define __BYTE_ORDER __BIG_ENDIAN\n#ifndef _MSC_VER\n#include <endian.h>\n#endif\n\n\n\/\/\/ same as reset()\nSHA3::SHA3( Bits bits )\n : m_blockSize( 200 - 2 * ( bits \/ 8 ) ),\n m_bits( bits )\n{\n reset();\n}\n\n\n\/\/\/ restart\nvoid SHA3::reset()\n{\n for( size_t i = 0; i < StateSize; i++ )\n m_hash[i] = 0;\n\n m_numBytes = 0;\n m_bufferSize = 0;\n}\n\n\n\/\/\/ constants and local helper functions\nnamespace\n{\n const unsigned int Rounds = 24;\n const uint64_t XorMasks[Rounds] =\n {\n 0x0000000000000001ULL, 0x0000000000008082ULL, 0x800000000000808aULL,\n 0x8000000080008000ULL, 0x000000000000808bULL, 0x0000000080000001ULL,\n 0x8000000080008081ULL, 0x8000000000008009ULL, 0x000000000000008aULL,\n 0x0000000000000088ULL, 0x0000000080008009ULL, 0x000000008000000aULL,\n 0x000000008000808bULL, 0x800000000000008bULL, 0x8000000000008089ULL,\n 0x8000000000008003ULL, 0x8000000000008002ULL, 0x8000000000000080ULL,\n 0x000000000000800aULL, 0x800000008000000aULL, 0x8000000080008081ULL,\n 0x8000000000008080ULL, 0x0000000080000001ULL, 0x8000000080008008ULL\n };\n\n \/\/\/ rotate left and wrap around to the right\n inline uint64_t rotateLeft( uint64_t x, uint8_t numBits )\n {\n return ( x << numBits ) | ( x >> ( 64 - numBits ) );\n }\n\n \/\/\/ convert litte vs big endian\n inline uint64_t swap( uint64_t x )\n {\n#if defined(__GNUC__) || defined(__clang__)\n return __builtin_bswap64( x );\n#endif\n#ifdef MSC_VER\n return _byteswap_uint64( x );\n#endif\n\n return ( x >> 56 ) |\n ( ( x >> 40 ) & 0x000000000000FF00ULL ) |\n ( ( x >> 24 ) & 0x0000000000FF0000ULL ) |\n ( ( x >> 8 ) & 0x00000000FF000000ULL ) |\n ( ( x << 8 ) & 0x000000FF00000000ULL ) |\n ( ( x << 24 ) & 0x0000FF0000000000ULL ) |\n ( ( x << 40 ) & 0x00FF000000000000ULL ) |\n ( x << 56 );\n }\n\n\n \/\/\/ return x % 5 for 0 <= x <= 9\n unsigned int mod5( unsigned int x )\n {\n if( x < 5 )\n return x;\n\n return x - 5;\n }\n}\n\n\n\/\/\/ process a full block\nvoid SHA3::processBlock( const void* data )\n{\n#if defined(__BYTE_ORDER) && (__BYTE_ORDER != 0) && (__BYTE_ORDER == __BIG_ENDIAN)\n#define LITTLEENDIAN(x) swap(x)\n#else\n#define LITTLEENDIAN(x) (x)\n#endif\n\n const uint64_t* data64 = ( const uint64_t* ) data;\n \/\/ mix data into state\n for( unsigned int i = 0; i < m_blockSize \/ 8; i++ )\n m_hash[i] ^= LITTLEENDIAN( data64[i] );\n\n \/\/ re-compute state\n for( unsigned int round = 0; round < Rounds; round++ )\n {\n \/\/ Theta\n uint64_t coefficients[5];\n for( unsigned int i = 0; i < 5; i++ )\n coefficients[i] = m_hash[i] ^ m_hash[i + 5] ^ m_hash[i + 10] ^ m_hash[i + 15] ^ m_hash[i + 20];\n\n for( unsigned int i = 0; i < 5; i++ )\n {\n uint64_t one = coefficients[mod5( i + 4 )] ^ rotateLeft( coefficients[mod5( i + 1 )], 1 );\n m_hash[i ] ^= one;\n m_hash[i + 5] ^= one;\n m_hash[i + 10] ^= one;\n m_hash[i + 15] ^= one;\n m_hash[i + 20] ^= one;\n }\n\n \/\/ temporary\n uint64_t one;\n\n \/\/ Rho Pi\n uint64_t last = m_hash[1];\n one = m_hash[10];\n m_hash[10] = rotateLeft( last, 1 );\n last = one;\n one = m_hash[ 7];\n m_hash[ 7] = rotateLeft( last, 3 );\n last = one;\n one = m_hash[11];\n m_hash[11] = rotateLeft( last, 6 );\n last = one;\n one = m_hash[17];\n m_hash[17] = rotateLeft( last, 10 );\n last = one;\n one = m_hash[18];\n m_hash[18] = rotateLeft( last, 15 );\n last = one;\n one = m_hash[ 3];\n m_hash[ 3] = rotateLeft( last, 21 );\n last = one;\n one = m_hash[ 5];\n m_hash[ 5] = rotateLeft( last, 28 );\n last = one;\n one = m_hash[16];\n m_hash[16] = rotateLeft( last, 36 );\n last = one;\n one = m_hash[ 8];\n m_hash[ 8] = rotateLeft( last, 45 );\n last = one;\n one = m_hash[21];\n m_hash[21] = rotateLeft( last, 55 );\n last = one;\n one = m_hash[24];\n m_hash[24] = rotateLeft( last, 2 );\n last = one;\n one = m_hash[ 4];\n m_hash[ 4] = rotateLeft( last, 14 );\n last = one;\n one = m_hash[15];\n m_hash[15] = rotateLeft( last, 27 );\n last = one;\n one = m_hash[23];\n m_hash[23] = rotateLeft( last, 41 );\n last = one;\n one = m_hash[19];\n m_hash[19] = rotateLeft( last, 56 );\n last = one;\n one = m_hash[13];\n m_hash[13] = rotateLeft( last, 8 );\n last = one;\n one = m_hash[12];\n m_hash[12] = rotateLeft( last, 25 );\n last = one;\n one = m_hash[ 2];\n m_hash[ 2] = rotateLeft( last, 43 );\n last = one;\n one = m_hash[20];\n m_hash[20] = rotateLeft( last, 62 );\n last = one;\n one = m_hash[14];\n m_hash[14] = rotateLeft( last, 18 );\n last = one;\n one = m_hash[22];\n m_hash[22] = rotateLeft( last, 39 );\n last = one;\n one = m_hash[ 9];\n m_hash[ 9] = rotateLeft( last, 61 );\n last = one;\n one = m_hash[ 6];\n m_hash[ 6] = rotateLeft( last, 20 );\n last = one;\n m_hash[ 1] = rotateLeft( last, 44 );\n\n \/\/ Chi\n for( unsigned int j = 0; j < 25; j += 5 )\n {\n \/\/ temporaries\n uint64_t one = m_hash[j];\n uint64_t two = m_hash[j + 1];\n\n m_hash[j] ^= m_hash[j + 2] & ~two;\n m_hash[j + 1] ^= m_hash[j + 3] & ~m_hash[j + 2];\n m_hash[j + 2] ^= m_hash[j + 4] & ~m_hash[j + 3];\n m_hash[j + 3] ^= one & ~m_hash[j + 4];\n m_hash[j + 4] ^= two & ~one;\n }\n\n \/\/ Iota\n m_hash[0] ^= XorMasks[round];\n }\n}\n\n\n\/\/\/ add arbitrary number of bytes\nvoid SHA3::add( const void* data, size_t numBytes )\n{\n const uint8_t* current = ( const uint8_t* ) data;\n\n if( m_bufferSize > 0 )\n {\n while( numBytes > 0 && m_bufferSize < m_blockSize )\n {\n m_buffer[m_bufferSize++] = *current++;\n numBytes--;\n }\n }\n\n \/\/ full buffer\n if( m_bufferSize == m_blockSize )\n {\n processBlock( ( void* )m_buffer );\n m_numBytes += m_blockSize;\n m_bufferSize = 0;\n }\n\n \/\/ no more data ?\n if( numBytes == 0 )\n return;\n\n \/\/ process full blocks\n while( numBytes >= m_blockSize )\n {\n processBlock( current );\n current += m_blockSize;\n m_numBytes += m_blockSize;\n numBytes -= m_blockSize;\n }\n\n \/\/ keep remaining bytes in buffer\n while( numBytes > 0 )\n {\n m_buffer[m_bufferSize++] = *current++;\n numBytes--;\n }\n}\n\n\n\/\/\/ process everything left in the internal buffer\nvoid SHA3::processBuffer()\n{\n unsigned int blockSize = 200 - 2 * ( m_bits \/ 8 );\n\n \/\/ add padding\n size_t offset = m_bufferSize;\n \/\/ add a \"1\" byte\n m_buffer[offset++] = 0x06;\n \/\/ fill with zeros\n while( offset < blockSize - 1 )\n m_buffer[offset++] = 0;\n\n \/\/ and add a single set bit\n m_buffer[blockSize - 1] = 0x80;\n\n processBlock( m_buffer );\n}\n\n\n\/\/\/ return latest hash as 16 hex characters\nstd::string SHA3::getHash()\n{\n \/\/ process remaining bytes\n processBuffer();\n\n \/\/ convert hash to string\n static const char dec2hex[16 + 1] = \"0123456789abcdef\";\n\n \/\/ number of significant elements in hash (uint64_t)\n unsigned int hashLength = m_bits \/ 64;\n\n std::string result;\n for( unsigned int i = 0; i < hashLength; i++ )\n for( unsigned int j = 0; j < 8; j++ ) \/\/ 64 bits => 8 bytes\n {\n \/\/ convert a byte to hex\n unsigned char oneByte = ( unsigned char )( m_hash[i] >> ( 8 * j ) );\n result += dec2hex[oneByte >> 4];\n result += dec2hex[oneByte & 15];\n }\n\n return result;\n}\n\n\n\/\/\/ compute SHA3 of a memory block\nstd::string SHA3::operator()( const void* data, size_t numBytes )\n{\n reset();\n add( data, numBytes );\n return getHash();\n}\n\n\n\/\/\/ compute SHA3 of a string, excluding final zero\nstd::string SHA3::operator()( const std::string& text )\n{\n reset();\n add( text.c_str(), text.size() );\n return getHash();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#1242630 Untrusted loop bound<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#1158083 Unchecked dynamic_cast<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: itemdef.hxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 17:14:40 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef ITEMDEF_HXX\n#define ITEMDEF_HXX\n\n\n#ifndef _SFXMSG_HXX \/\/autogen\n#include <sfx2\/msg.hxx>\n#endif\n\nSFX_DECL_TYPE(10); \/\/SwElemItem\nSFX_DECL_TYPE(13); \/\/SwAddPrinterItem\nSFX_DECL_TYPE(16); \/\/SwDocDisplayItem\n\n#endif\n<commit_msg>INTEGRATION: CWS ooo19126 (1.1.1.1.1462); FILE MERGED 2005\/09\/05 13:45:19 rt 1.1.1.1.1462.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: itemdef.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 09:23:16 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef ITEMDEF_HXX\n#define ITEMDEF_HXX\n\n\n#ifndef _SFXMSG_HXX \/\/autogen\n#include <sfx2\/msg.hxx>\n#endif\n\nSFX_DECL_TYPE(10); \/\/SwElemItem\nSFX_DECL_TYPE(13); \/\/SwAddPrinterItem\nSFX_DECL_TYPE(16); \/\/SwDocDisplayItem\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: outline.hxx,v $\n * $Revision: 1.10 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _OUTLINE_HXX\n#define _OUTLINE_HXX\n\n#include <sfx2\/tabdlg.hxx>\n\n\n#include <vcl\/menu.hxx>\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#include <svtools\/stdctrl.hxx>\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n\n#include \"swtypes.hxx\" \/\/fuer MAXLEVEL\n#include <numprevw.hxx>\n#include <numberingtypelistbox.hxx>\n\nclass SwWrtShell;\nclass SwNumRule;\nclass SwChapterNumRules;\n\n\/* -----------------07.07.98 13:38-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineTabDialog : public SfxTabDialog\n{\n static USHORT nNumLevel;\n\n String aNullStr;\n String aCollNames[MAXLEVEL];\n PopupMenu aFormMenu;\n\n SwWrtShell& rWrtSh;\n SwNumRule* pNumRule;\n SwChapterNumRules* pChapterNumRules;\n\n BOOL bModified : 1;\n\n protected:\n DECL_LINK( CancelHdl, Button * );\n DECL_LINK( FormHdl, Button * );\n DECL_LINK( MenuSelectHdl, Menu * );\n\n virtual void PageCreated(USHORT nPageId, SfxTabPage& rPage);\n virtual short Ok();\n\n public:\n SwOutlineTabDialog(Window* pParent,\n const SfxItemSet* pSwItemSet,\n SwWrtShell &);\n ~SwOutlineTabDialog();\n\n SwNumRule* GetNumRule() {return pNumRule;}\n USHORT GetLevel(const String &rFmtName) const;\n String* GetCollNames() {return aCollNames;}\n\n static USHORT GetActNumLevel() {return nNumLevel;}\n static void SetActNumLevel(USHORT nSet) {nNumLevel = nSet;}\n};\n\/* -----------------07.07.98 13:47-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineSettingsTabPage : public SfxTabPage\n{\n ListBox aLevelLB;\n FixedLine aLevelFL;\n\n FixedText aCollLbl;\n ListBox aCollBox;\n FixedText aNumberLbl;\n SwNumberingTypeListBox aNumberBox;\n FixedText aCharFmtFT;\n ListBox aCharFmtLB;\n FixedText aAllLevelFT;\n NumericField aAllLevelNF;\n FixedText aDelim;\n FixedText aPrefixFT;\n Edit aPrefixED;\n FixedText aSuffixFT;\n Edit aSuffixED;\n FixedText aStartLbl;\n NumericField aStartEdit;\n FixedLine aNumberFL;\n NumberingPreview aPreviewWIN;\n\n String aNoFmtName;\n String aSaveCollNames[MAXLEVEL];\n SwWrtShell* pSh;\n SwNumRule* pNumRule;\n String* pCollNames;\n USHORT nActLevel;\n\n DECL_LINK( LevelHdl, ListBox * );\n DECL_LINK( ToggleComplete, NumericField * );\n DECL_LINK( CollSelect, ListBox * );\n DECL_LINK( CollSelectGetFocus, ListBox * );\n DECL_LINK( NumberSelect, SwNumberingTypeListBox * );\n DECL_LINK( DelimModify, Edit * );\n DECL_LINK( StartModified, NumericField * );\n DECL_LINK( CharFmtHdl, ListBox * );\n\n void Update();\n\n void SetModified(){aPreviewWIN.Invalidate();}\n void CheckForStartValue_Impl(sal_uInt16 nNumberingType);\n\n using TabPage::ActivatePage;\n using TabPage::DeactivatePage;\n\npublic:\n SwOutlineSettingsTabPage(Window* pParent, const SfxItemSet& rSet);\n ~SwOutlineSettingsTabPage();\n\n void SetWrtShell(SwWrtShell* pShell);\n\n virtual void ActivatePage(const SfxItemSet& rSet);\n virtual int DeactivatePage(SfxItemSet *pSet);\n\n virtual BOOL FillItemSet( SfxItemSet& rSet );\n virtual void Reset( const SfxItemSet& rSet );\n static SfxTabPage* Create( Window* pParent,\n const SfxItemSet& rAttrSet);\n};\n#endif\n<commit_msg>INTEGRATION: CWS lcwarnings2 (1.9.182); FILE MERGED 2008\/04\/17 12:35:09 tl 1.9.182.3: RESYNC: (1.9-1.10); FILE MERGED 2008\/03\/03 10:09:51 tl 1.9.182.2: #i83458# warning-free code wntmsci11 2008\/02\/29 14:55:47 tl 1.9.182.1: #i83458# warning free code for wntmsci11<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: outline.hxx,v $\n * $Revision: 1.11 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _OUTLINE_HXX\n#define _OUTLINE_HXX\n\n#include <sfx2\/tabdlg.hxx>\n\n\n#include <vcl\/menu.hxx>\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n#include <svtools\/stdctrl.hxx>\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n\n#include \"swtypes.hxx\" \/\/fuer MAXLEVEL\n#include <numprevw.hxx>\n#include <numberingtypelistbox.hxx>\n\nclass SwWrtShell;\nclass SwNumRule;\nclass SwChapterNumRules;\n\n\/* -----------------07.07.98 13:38-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineTabDialog : public SfxTabDialog\n{\n static USHORT nNumLevel;\n\n String aNullStr;\n String aCollNames[MAXLEVEL];\n PopupMenu aFormMenu;\n\n SwWrtShell& rWrtSh;\n SwNumRule* pNumRule;\n SwChapterNumRules* pChapterNumRules;\n\n BOOL bModified : 1;\n\n protected:\n DECL_LINK( CancelHdl, Button * );\n DECL_LINK( FormHdl, Button * );\n DECL_LINK( MenuSelectHdl, Menu * );\n\n virtual void PageCreated(USHORT nPageId, SfxTabPage& rPage);\n virtual short Ok();\n\n public:\n SwOutlineTabDialog(Window* pParent,\n const SfxItemSet* pSwItemSet,\n SwWrtShell &);\n ~SwOutlineTabDialog();\n\n SwNumRule* GetNumRule() {return pNumRule;}\n USHORT GetLevel(const String &rFmtName) const;\n String* GetCollNames() {return aCollNames;}\n\n static USHORT GetActNumLevel() {return nNumLevel;}\n static void SetActNumLevel(USHORT nSet) {nNumLevel = nSet;}\n};\n\/* -----------------07.07.98 13:47-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineSettingsTabPage : public SfxTabPage\n{\n ListBox aLevelLB;\n FixedLine aLevelFL;\n\n FixedText aCollLbl;\n ListBox aCollBox;\n FixedText aNumberLbl;\n SwNumberingTypeListBox aNumberBox;\n FixedText aCharFmtFT;\n ListBox aCharFmtLB;\n FixedText aAllLevelFT;\n NumericField aAllLevelNF;\n FixedText aDelim;\n FixedText aPrefixFT;\n Edit aPrefixED;\n FixedText aSuffixFT;\n Edit aSuffixED;\n FixedText aStartLbl;\n NumericField aStartEdit;\n FixedLine aNumberFL;\n NumberingPreview aPreviewWIN;\n\n String aNoFmtName;\n String aSaveCollNames[MAXLEVEL];\n SwWrtShell* pSh;\n SwNumRule* pNumRule;\n String* pCollNames;\n USHORT nActLevel;\n\n DECL_LINK( LevelHdl, ListBox * );\n DECL_LINK( ToggleComplete, NumericField * );\n DECL_LINK( CollSelect, ListBox * );\n DECL_LINK( CollSelectGetFocus, ListBox * );\n DECL_LINK( NumberSelect, SwNumberingTypeListBox * );\n DECL_LINK( DelimModify, Edit * );\n DECL_LINK( StartModified, NumericField * );\n DECL_LINK( CharFmtHdl, ListBox * );\n\n void Update();\n\n void SetModified(){aPreviewWIN.Invalidate();}\n void CheckForStartValue_Impl(sal_uInt16 nNumberingType);\n\n using SfxTabPage::ActivatePage;\n using SfxTabPage::DeactivatePage;\n\npublic:\n SwOutlineSettingsTabPage(Window* pParent, const SfxItemSet& rSet);\n ~SwOutlineSettingsTabPage();\n\n void SetWrtShell(SwWrtShell* pShell);\n\n virtual void ActivatePage(const SfxItemSet& rSet);\n virtual int DeactivatePage(SfxItemSet *pSet);\n\n virtual BOOL FillItemSet( SfxItemSet& rSet );\n virtual void Reset( const SfxItemSet& rSet );\n static SfxTabPage* Create( Window* pParent,\n const SfxItemSet& rAttrSet);\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: outline.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: os $ $Date: 2002-11-07 14:42:42 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _OUTLINE_HXX\n#define _OUTLINE_HXX\n\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n\n\n#ifndef _SV_MENU_HXX \/\/autogen\n#include <vcl\/menu.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _STDCTRL_HXX \/\/autogen\n#include <svtools\/stdctrl.hxx>\n#endif\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n\n#include \"swtypes.hxx\" \/\/fuer MAXLEVEL\n#ifndef _NUMPREVW_HXX\n#include <numprevw.hxx>\n#endif\n#ifndef _NUMBERINGTYPELISTBOX_HXX\n#include <numberingtypelistbox.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwTxtFmtColl;\nclass SwNumRule;\nclass SwChapterNumRules;\n\n\/* -----------------07.07.98 13:38-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineTabDialog : public SfxTabDialog\n{\n String aNullStr;\n String aCollNames[MAXLEVEL];\n PopupMenu aFormMenu;\n\n SwWrtShell& rWrtSh;\n SwNumRule* pNumRule;\n SwChapterNumRules* pChapterNumRules;\n\n USHORT nNumLevel;\n BOOL bModified : 1;\n\n protected:\n DECL_LINK( CancelHdl, Button * );\n DECL_LINK( FormHdl, Button * );\n DECL_LINK( MenuSelectHdl, Menu * );\n\n virtual void PageCreated(USHORT nPageId, SfxTabPage& rPage);\n virtual short Ok();\n\n public:\n SwOutlineTabDialog(Window* pParent,\n const SfxItemSet* pSwItemSet,\n SwWrtShell &);\n ~SwOutlineTabDialog();\n\n SwNumRule* GetNumRule() {return pNumRule;}\n USHORT GetLevel(const String &rFmtName) const;\n String* GetCollNames() {return aCollNames;}\n USHORT GetActNumLevel() {return nNumLevel;}\n void SetActNumLevel(USHORT nSet) {nNumLevel = nSet;}\n};\n\/* -----------------07.07.98 13:47-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineSettingsTabPage : public SfxTabPage\n{\n ListBox aLevelLB;\n FixedLine aLevelFL;\n\n FixedText aCollLbl;\n ListBox aCollBox;\n FixedText aNumberLbl;\n SwNumberingTypeListBox aNumberBox;\n FixedText aCharFmtFT;\n ListBox aCharFmtLB;\n FixedText aAllLevelFT;\n NumericField aAllLevelNF;\n FixedText aDelim;\n FixedText aPrefixFT;\n Edit aPrefixED;\n FixedText aSuffixFT;\n Edit aSuffixED;\n FixedText aStartLbl;\n NumericField aStartEdit;\n FixedLine aNumberFL;\n NumberingPreview aPreviewWIN;\n\n String aNoFmtName;\n String aSaveCollNames[MAXLEVEL];\n SwWrtShell* pSh;\n SwNumRule* pNumRule;\n String* pCollNames;\n USHORT nActLevel;\n\n DECL_LINK( LevelHdl, ListBox * );\n DECL_LINK( ToggleComplete, NumericField * );\n DECL_LINK( CollSelect, ListBox * );\n DECL_LINK( CollSelectGetFocus, ListBox * );\n DECL_LINK( NumberSelect, SwNumberingTypeListBox * );\n DECL_LINK( DelimModify, Edit * );\n DECL_LINK( StartModified, NumericField * );\n DECL_LINK( CharFmtHdl, ListBox * );\n\n void Update();\n\n void SetModified(){aPreviewWIN.Invalidate();}\n void CheckForStartValue_Impl(sal_uInt16 nNumberingType);\n\npublic:\n SwOutlineSettingsTabPage(Window* pParent, const SfxItemSet& rSet);\n ~SwOutlineSettingsTabPage();\n\n void SetWrtShell(SwWrtShell* pShell);\n\n virtual void ActivatePage(const SfxItemSet& rSet);\n virtual int DeactivatePage(SfxItemSet *pSet);\n virtual BOOL FillItemSet( SfxItemSet& rSet );\n virtual void Reset( const SfxItemSet& rSet );\n static SfxTabPage* Create( Window* pParent,\n const SfxItemSet& rAttrSet);\n};\n#endif\n<commit_msg>INTEGRATION: CWS os52 (1.4.1068); FILE MERGED 2005\/02\/01 11:13:26 os 1.4.1068.1: #i41387# outline dialog: store current numbering level at runtime<commit_after>\/*************************************************************************\n *\n * $RCSfile: outline.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2005-03-01 15:28:14 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _OUTLINE_HXX\n#define _OUTLINE_HXX\n\n\n#ifndef _SFXTABDLG_HXX \/\/autogen\n#include <sfx2\/tabdlg.hxx>\n#endif\n\n\n#ifndef _SV_MENU_HXX \/\/autogen\n#include <vcl\/menu.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _STDCTRL_HXX \/\/autogen\n#include <svtools\/stdctrl.hxx>\n#endif\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _LSTBOX_HXX \/\/autogen\n#include <vcl\/lstbox.hxx>\n#endif\n\n#ifndef _EDIT_HXX \/\/autogen\n#include <vcl\/edit.hxx>\n#endif\n\n#ifndef _FIELD_HXX \/\/autogen\n#include <vcl\/field.hxx>\n#endif\n\n#include \"swtypes.hxx\" \/\/fuer MAXLEVEL\n#ifndef _NUMPREVW_HXX\n#include <numprevw.hxx>\n#endif\n#ifndef _NUMBERINGTYPELISTBOX_HXX\n#include <numberingtypelistbox.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwTxtFmtColl;\nclass SwNumRule;\nclass SwChapterNumRules;\n\n\/* -----------------07.07.98 13:38-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineTabDialog : public SfxTabDialog\n{\n static USHORT nNumLevel;\n\n String aNullStr;\n String aCollNames[MAXLEVEL];\n PopupMenu aFormMenu;\n\n SwWrtShell& rWrtSh;\n SwNumRule* pNumRule;\n SwChapterNumRules* pChapterNumRules;\n\n BOOL bModified : 1;\n\n protected:\n DECL_LINK( CancelHdl, Button * );\n DECL_LINK( FormHdl, Button * );\n DECL_LINK( MenuSelectHdl, Menu * );\n\n virtual void PageCreated(USHORT nPageId, SfxTabPage& rPage);\n virtual short Ok();\n\n public:\n SwOutlineTabDialog(Window* pParent,\n const SfxItemSet* pSwItemSet,\n SwWrtShell &);\n ~SwOutlineTabDialog();\n\n SwNumRule* GetNumRule() {return pNumRule;}\n USHORT GetLevel(const String &rFmtName) const;\n String* GetCollNames() {return aCollNames;}\n\n static USHORT GetActNumLevel() {return nNumLevel;}\n static void SetActNumLevel(USHORT nSet) {nNumLevel = nSet;}\n};\n\/* -----------------07.07.98 13:47-------------------\n *\n * --------------------------------------------------*\/\nclass SwOutlineSettingsTabPage : public SfxTabPage\n{\n ListBox aLevelLB;\n FixedLine aLevelFL;\n\n FixedText aCollLbl;\n ListBox aCollBox;\n FixedText aNumberLbl;\n SwNumberingTypeListBox aNumberBox;\n FixedText aCharFmtFT;\n ListBox aCharFmtLB;\n FixedText aAllLevelFT;\n NumericField aAllLevelNF;\n FixedText aDelim;\n FixedText aPrefixFT;\n Edit aPrefixED;\n FixedText aSuffixFT;\n Edit aSuffixED;\n FixedText aStartLbl;\n NumericField aStartEdit;\n FixedLine aNumberFL;\n NumberingPreview aPreviewWIN;\n\n String aNoFmtName;\n String aSaveCollNames[MAXLEVEL];\n SwWrtShell* pSh;\n SwNumRule* pNumRule;\n String* pCollNames;\n USHORT nActLevel;\n\n DECL_LINK( LevelHdl, ListBox * );\n DECL_LINK( ToggleComplete, NumericField * );\n DECL_LINK( CollSelect, ListBox * );\n DECL_LINK( CollSelectGetFocus, ListBox * );\n DECL_LINK( NumberSelect, SwNumberingTypeListBox * );\n DECL_LINK( DelimModify, Edit * );\n DECL_LINK( StartModified, NumericField * );\n DECL_LINK( CharFmtHdl, ListBox * );\n\n void Update();\n\n void SetModified(){aPreviewWIN.Invalidate();}\n void CheckForStartValue_Impl(sal_uInt16 nNumberingType);\n\npublic:\n SwOutlineSettingsTabPage(Window* pParent, const SfxItemSet& rSet);\n ~SwOutlineSettingsTabPage();\n\n void SetWrtShell(SwWrtShell* pShell);\n\n virtual void ActivatePage(const SfxItemSet& rSet);\n virtual int DeactivatePage(SfxItemSet *pSet);\n virtual BOOL FillItemSet( SfxItemSet& rSet );\n virtual void Reset( const SfxItemSet& rSet );\n static SfxTabPage* Create( Window* pParent,\n const SfxItemSet& rAttrSet);\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015-2016 Andrew Sutton\n\/\/ All rights reserved\n\n#include \"constraint.hpp\"\n#include \"ast.hpp\"\n#include \"context.hpp\"\n#include \"call.hpp\"\n#include \"initialization.hpp\"\n#include \"substitution.hpp\"\n#include \"normalization.hpp\"\n#include \"hash.hpp\"\n#include \"print.hpp\"\n#include \"inspection.hpp\"\n\n#include <iostream>\n\n\nnamespace banjo\n{\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Concept expansion\n\nCons&\nexpand_expr(Context& cxt, Expression_def& def, Substitution& sub)\n{\n Expr& e = substitute(cxt, def.expression(), sub);\n return normalize(cxt, e);\n}\n\n\n\/\/ This is backwards from the previous case where we substitute\n\/\/ first and normalize second. I believe that these operations are\n\/\/ interchangeable.\nCons&\nexpand_def(Context& cxt, Concept_def& def, Substitution& sub)\n{\n Cons& c1 = normalize(cxt, def);\n return substitute(cxt, c1, sub);\n}\n\n\n\/\/ Expand the concept by substituting the template arguments\n\/\/ throughthe concept's definition and normalizing the result.\n\/\/\n\/\/ TODO: Memoize the expansions.\nCons&\nexpand(Context& cxt, Concept_cons& c)\n{\n Concept_decl& d = c.declaration();\n Decl_list& tparms = d.parameters();\n Term_list& targs = c.arguments();\n\n \/\/ NOTE: Template arguments must have been checked (in kind?)\n \/\/ prior to the formation of the constraint. It's should be\n \/\/ a semantic requirement of the original check expression.\n Substitution sub(tparms, targs);\n\n Def& def = d.definition();\n if (Expression_def* expr = as<Expression_def>(&def))\n return expand_expr(cxt, *expr, sub);\n if (Concept_def* body = as<Concept_def>(&def))\n return expand_def(cxt, *body, sub);\n banjo_unhandled_case(def);\n}\n\n\nCons const&\nexpand(Context& cxt, Concept_cons const& c)\n{\n return expand(cxt, const_cast<Concept_cons&>(c));\n}\n\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Admissibility of expressions\n\/\/\n\/\/ Determine the admissibility of an expression within a dependent\n\/\/ context. Note that this is the slow way of doing it since we\n\/\/ are doing a full recursion over the constraint in order to find\n\/\/ a proof of admissibility.\n\n\ninline Expr*\nadmit_concept_expr(Context& cxt, Concept_cons& c, Expr& e)\n{\n return admit_expression(cxt, expand(cxt, c), e);\n}\n\n\n\/\/ This is plain weird, and I should probably never be here. When\n\/\/ does a reference-expression appear as a constraint?\ntemplate<typename Usage>\nExpr*\nadmit_reference_expr(Context& cxt, Usage& c, Reference_expr& e)\n{\n return &e;\n}\n\n\n\/\/ For both basic and conversion constraints. Determine if the operands\n\/\/ of e can be converted to the declared types of the required expression.\n\/\/ If so, return e with its result type adjusted to that of the required\n\/\/ expression.\n\/\/\n\/\/ Note that for a conversion constraint, the result type of the matched\n\/\/ expression is *not* the destinatio type. It is the expression type.\ntemplate<typename Usage>\nExpr*\nadmit_binary_expr(Context& cxt, Usage& c, Binary_expr& e)\n{\n \/\/ Determine if the operands can be converted to the\n \/\/ declared type of the required expressin.\n Binary_expr& a = cast<Binary_expr>(c.expression());\n Type& t1 = declared_type(a.left());\n Type& t2 = declared_type(a.right());\n try {\n copy_initialize(cxt, t1, e.left());\n copy_initialize(cxt, t2, e.right());\n } catch(Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type of the expression under test to that of\n \/\/ the required expression.\n \/\/\n \/\/ FIXME: See the notes on admit_binary_conv. We may want\n \/\/ to preserve the conversions for the purpose of ordering.\n e.ty = &a.type();\n return &e;\n}\n\n\n\/\/ Determine if a basic or conversion constraint admit the call\n\/\/ expression e.\ntemplate<typename Usage>\nExpr*\nadmit_call_expr(Context& cxt, Usage& c, Call_expr& e)\n{\n Call_expr& a = cast<Call_expr>(c.expression());\n\n \/\/ Build the list of parameter types from the declared types\n \/\/ of operands in the constraint.\n Type_list ts {&declared_type(a.function())};\n for (Expr& e0 : a.arguments())\n ts.push_back(declared_type(e0));\n\n \/\/ Build the list of arguments from e. Note that the first\n \/\/ argument is actually the function.\n Expr_list es {&e.function()};\n for (Expr& e0 : e.arguments())\n es.push_back(e0);\n\n \/\/ If conversion fails, this is not accessible.\n try {\n initialize_parameters(cxt, ts, es);\n } catch (Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type and admit the expression.\n e.ty = &a.type();\n return &e;\n}\n\n\n\/\/ For both basic and conversion constraints, determine if the constraints\n\/\/ admits the expression. In general, this is the case when the operands\n\/\/ of the e are dependently convertible to the types of the expression in c.\ntemplate<typename Usage>\nExpr*\nadmit_usage_expr(Context& cxt, Usage& c, Expr& e)\n{\n struct fn\n {\n Context& cxt;\n Usage& c;\n Expr* operator()(Expr& e) { banjo_unhandled_case(e); }\n Expr* operator()(Reference_expr& e) { return admit_reference_expr(cxt, c, e); }\n Expr* operator()(Binary_expr& e) { return admit_binary_expr(cxt, c, e); }\n Expr* operator()(Call_expr& e) { return admit_call_expr(cxt, c, e); }\n };\n\n \/\/ An expression of a different kind prove admissibility.\n if (typeid(c.expression()) != typeid(e))\n return nullptr;\n\n return apply(e, fn{cxt, c});\n}\n\n\n\/\/ Just look through to the nested constraint.\ninline Expr*\nadmit_parametric_expr(Context& cxt, Parameterized_cons& c, Expr& e)\n{\n return admit_expression(cxt, c.constraint(), e);\n}\n\n\n\/\/ An expression is admissible for a conjunction of assumptions if\n\/\/ support is found in either the left or right operand.\nExpr*\nadmit_conjunction_expr(Context& cxt, Conjunction_cons& c, Expr& e)\n{\n if (Expr* e1 = admit_expression(cxt, c.left(), e))\n return e1;\n else\n return admit_expression(cxt, c.right(), e);\n}\n\n\n\/\/ An expression is admissible for a disjinction of assumptions if\n\/\/ support is found both the left and right operand.\ninline Expr*\nadmit_disjunction_expr(Context& cxt, Disjunction_cons& c, Expr& e)\n{\n if (Expr* e1 = admit_expression(cxt, c.left(), e)) {\n if (Expr* e2 = admit_expression(cxt, c.right(), e)) {\n if (!is_equivalent(e1->type(), e2->type()))\n throw Translation_error(cxt, \"multiple types deduced for '{}'\", e);\n return e1;\n }\n }\n return nullptr;\n}\n\n\n\/\/ Determine if the expression `e` is admissible under the given\n\/\/ constraint set. Returns a fully typed expression if admissible\n\/\/ and nullptr if not.\n\/\/\n\/\/ Note that a predicate constraint does not admit any expressions.\n\/\/ That will change when we add axioms.\n\/\/\n\/\/ FIXME: This needs to be a deduction algorithm. That is, we\n\/\/ want find a substitution form `e` to some assumed expression.\n\/\/\n\/\/ FIXME: What happens if we have requirements like these:\n\/\/\n\/\/ |e : t1| \/\\ |e : t2|\n\/\/\n\/\/ This only seems illogical to assume contradictory things. However,\n\/\/ from the perspective of checking it doesn't actually matter since\n\/\/ any proof requires only that e have type t1 or t2. Not both.\n\/\/\n\/\/ Then there's this:\n\/\/\n\/\/ |e : t1| \\\/ |e : t2|\n\/\/\n\/\/ Here, we have to show that both are satisfied. I would think that t\n\/\/ his is never satisfiable since e could never have different types.\n\/\/ However, we *could* defer that resolution by creating an intersection\n\/\/ type. But that might not fly.\nExpr*\nadmit_expression(Context& cxt, Cons& c, Expr& e)\n{\n struct fn\n {\n Context& cxt;\n Expr& e;\n Expr* operator()(Cons& c) { banjo_unhandled_case(c); }\n Expr* operator()(Concept_cons& c) { return admit_concept_expr(cxt, c, e); }\n Expr* operator()(Predicate_cons& c) { return nullptr; }\n Expr* operator()(Expression_cons& c) { return admit_usage_expr(cxt, c, e); }\n Expr* operator()(Conversion_cons& c) { return admit_usage_expr(cxt, c, e); }\n Expr* operator()(Parameterized_cons& c) { return admit_parametric_expr(cxt, c, e); }\n Expr* operator()(Conjunction_cons& c) { return admit_conjunction_expr(cxt, c, e); }\n Expr* operator()(Disjunction_cons& c) { return admit_disjunction_expr(cxt, c, e); }\n };\n \/\/ note(\"admit expr '{}' in '{}'\", e, c);\n return apply(c, fn{cxt, e});\n}\n\n\nExpr*\nadmit_expression(Context& cxt, Expr& c, Expr& e)\n{\n return admit_expression(cxt, normalize(cxt, c), e);\n}\n\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Availability of conversions\n\nExpr*\nadmit_concept_conv(Context& cxt, Concept_cons& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, expand(cxt, c), e, t);\n}\n\n\n\/\/ Note that, within this function, the the conversion's type\n\/\/ is equivalent to the destination type.\n\/\/\n\/\/ FIXME: Factor out the \"conformance checking\" code.\nExpr*\nadmit_binary_conv(Context& cxt, Conversion_cons& c, Binary_expr& e)\n{\n \/\/ Determine if the operands can be converted to the\n \/\/ declared type of the required expressin.\n Expr *c1, *c2;\n Binary_expr& a = cast<Binary_expr>(c.expression());\n Type& t1 = declared_type(a.left());\n Type& t2 = declared_type(a.right());\n try {\n c1 = ©_initialize(cxt, t1, e.left());\n c2 = ©_initialize(cxt, t2, e.right());\n } catch(Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type of the expression under test to that of\n \/\/ the required expression.\n \/\/\n \/\/ FIXME: It's possible that we need to preserve the original\n \/\/ conversions in order to sort candidates. Consider:\n \/\/\n \/\/ requires (T a, T const b) {\n \/\/ f(a) -> T; \/\/ #1\n \/\/ f(b) -> T const; \/\/ #2\n \/\/ }\n \/\/\n \/\/ In an algorithm that uses a f(x) where x is const, we would\n \/\/ prefer #1. Perhaps we should collect viable conversion\n \/\/ and then sort at the end. Note that this is true for simple\n \/\/ typings also.\n \/\/\n \/\/ FIXME: Add constructors to the builder. This is just plain dumb.\n return new Dependent_conv(c.type(), e);\n}\n\n\nExpr*\nadmit_usage_conv(Context& cxt, Conversion_cons& c, Expr& e, Type& t)\n{\n struct fn\n {\n Context& cxt;\n Conversion_cons& c;\n Expr* operator()(Expr& e) { banjo_unhandled_case(e); }\n Expr* operator()(Binary_expr& e) { return admit_binary_conv(cxt, c, e); }\n };\n\n \/\/ An expression of a different kind prove admissibility.\n Expr& e2 = c.expression();\n if (typeid(e2) != typeid(e))\n return nullptr;\n\n \/\/ If the expression's type is not equivalent to t, this constraint\n \/\/ does not prove admissibility.\n if (!is_equivalent(c.type(), t))\n return nullptr;\n\n return apply(e, fn{cxt, c});\n}\n\n\nExpr*\nadmit_parametric_conv(Context& cxt, Parameterized_cons& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, c.constraint(), e, t);\n}\n\n\nExpr*\nadmit_conjunction_conv(Context& cxt, Conjunction_cons& c, Expr& e, Type& t)\n{\n if (Expr* c1 = admit_conversion(cxt, c.left(), e, t))\n return c1;\n else\n return admit_conversion(cxt, c.right(), e, t);\n}\n\n\nExpr*\nadmit_disjunction_conv(Context& cxt, Disjunction_cons& c, Expr& e, Type& t)\n{\n \/\/ Note that if we find evidence for a conversion in both branches\n \/\/ then it is guaranteed that they are equivalent.\n if (Expr* c1 = admit_conversion(cxt, c.left(), e, t)) {\n if (admit_conversion(cxt, c.right(), e, t))\n return c1;\n }\n return nullptr;\n}\n\n\n\/\/ TODO: Factor out the traversal of constraints in order to avoid\n\/\/ repeating all this bolier plate?\nExpr*\nadmit_conversion(Context& cxt, Cons& c, Expr& e, Type& t)\n{\n struct fn\n {\n Context& cxt;\n Expr& e;\n Type& t;\n Expr* operator()(Cons& c) { banjo_unhandled_case(c); }\n Expr* operator()(Concept_cons& c) { return admit_concept_conv(cxt, c, e, t); }\n Expr* operator()(Expression_cons& c) { return nullptr; }\n Expr* operator()(Conversion_cons& c) { return admit_usage_conv(cxt, c, e, t); }\n Expr* operator()(Parameterized_cons& c) { return admit_parametric_conv(cxt, c, e, t); }\n Expr* operator()(Conjunction_cons& c) { return admit_conjunction_conv(cxt, c, e, t); }\n Expr* operator()(Disjunction_cons& c) { return admit_disjunction_conv(cxt, c, e, t); }\n };\n \/\/ note(\"admit conv '{}' to '{}' in '{}'\", e, t, c);\n return apply(c, fn{cxt, e, t});\n}\n\n\nExpr*\nadmit_conversion(Context& cxt, Expr& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, normalize(cxt, c), e, t);\n}\n\n\n} \/\/ namespace banjo\n<commit_msg>Remove unused variables.<commit_after>\/\/ Copyright (c) 2015-2016 Andrew Sutton\n\/\/ All rights reserved\n\n#include \"constraint.hpp\"\n#include \"ast.hpp\"\n#include \"context.hpp\"\n#include \"call.hpp\"\n#include \"initialization.hpp\"\n#include \"substitution.hpp\"\n#include \"normalization.hpp\"\n#include \"hash.hpp\"\n#include \"print.hpp\"\n#include \"inspection.hpp\"\n\n#include <iostream>\n\n\nnamespace banjo\n{\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Concept expansion\n\nCons&\nexpand_expr(Context& cxt, Expression_def& def, Substitution& sub)\n{\n Expr& e = substitute(cxt, def.expression(), sub);\n return normalize(cxt, e);\n}\n\n\n\/\/ This is backwards from the previous case where we substitute\n\/\/ first and normalize second. I believe that these operations are\n\/\/ interchangeable.\nCons&\nexpand_def(Context& cxt, Concept_def& def, Substitution& sub)\n{\n Cons& c1 = normalize(cxt, def);\n return substitute(cxt, c1, sub);\n}\n\n\n\/\/ Expand the concept by substituting the template arguments\n\/\/ throughthe concept's definition and normalizing the result.\n\/\/\n\/\/ TODO: Memoize the expansions.\nCons&\nexpand(Context& cxt, Concept_cons& c)\n{\n Concept_decl& d = c.declaration();\n Decl_list& tparms = d.parameters();\n Term_list& targs = c.arguments();\n\n \/\/ NOTE: Template arguments must have been checked (in kind?)\n \/\/ prior to the formation of the constraint. It's should be\n \/\/ a semantic requirement of the original check expression.\n Substitution sub(tparms, targs);\n\n Def& def = d.definition();\n if (Expression_def* expr = as<Expression_def>(&def))\n return expand_expr(cxt, *expr, sub);\n if (Concept_def* body = as<Concept_def>(&def))\n return expand_def(cxt, *body, sub);\n banjo_unhandled_case(def);\n}\n\n\nCons const&\nexpand(Context& cxt, Concept_cons const& c)\n{\n return expand(cxt, const_cast<Concept_cons&>(c));\n}\n\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Admissibility of expressions\n\/\/\n\/\/ Determine the admissibility of an expression within a dependent\n\/\/ context. Note that this is the slow way of doing it since we\n\/\/ are doing a full recursion over the constraint in order to find\n\/\/ a proof of admissibility.\n\n\ninline Expr*\nadmit_concept_expr(Context& cxt, Concept_cons& c, Expr& e)\n{\n return admit_expression(cxt, expand(cxt, c), e);\n}\n\n\n\/\/ This is plain weird, and I should probably never be here. When\n\/\/ does a reference-expression appear as a constraint?\ntemplate<typename Usage>\nExpr*\nadmit_reference_expr(Context& cxt, Usage& c, Reference_expr& e)\n{\n return &e;\n}\n\n\n\/\/ For both basic and conversion constraints. Determine if the operands\n\/\/ of e can be converted to the declared types of the required expression.\n\/\/ If so, return e with its result type adjusted to that of the required\n\/\/ expression.\n\/\/\n\/\/ Note that for a conversion constraint, the result type of the matched\n\/\/ expression is *not* the destinatio type. It is the expression type.\ntemplate<typename Usage>\nExpr*\nadmit_binary_expr(Context& cxt, Usage& c, Binary_expr& e)\n{\n \/\/ Determine if the operands can be converted to the\n \/\/ declared type of the required expressin.\n Binary_expr& a = cast<Binary_expr>(c.expression());\n Type& t1 = declared_type(a.left());\n Type& t2 = declared_type(a.right());\n try {\n copy_initialize(cxt, t1, e.left());\n copy_initialize(cxt, t2, e.right());\n } catch(Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type of the expression under test to that of\n \/\/ the required expression.\n \/\/\n \/\/ FIXME: See the notes on admit_binary_conv. We may want\n \/\/ to preserve the conversions for the purpose of ordering.\n e.ty = &a.type();\n return &e;\n}\n\n\n\/\/ Determine if a basic or conversion constraint admit the call\n\/\/ expression e.\ntemplate<typename Usage>\nExpr*\nadmit_call_expr(Context& cxt, Usage& c, Call_expr& e)\n{\n Call_expr& a = cast<Call_expr>(c.expression());\n\n \/\/ Build the list of parameter types from the declared types\n \/\/ of operands in the constraint.\n Type_list ts {&declared_type(a.function())};\n for (Expr& e0 : a.arguments())\n ts.push_back(declared_type(e0));\n\n \/\/ Build the list of arguments from e. Note that the first\n \/\/ argument is actually the function.\n Expr_list es {&e.function()};\n for (Expr& e0 : e.arguments())\n es.push_back(e0);\n\n \/\/ If conversion fails, this is not accessible.\n try {\n initialize_parameters(cxt, ts, es);\n } catch (Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type and admit the expression.\n e.ty = &a.type();\n return &e;\n}\n\n\n\/\/ For both basic and conversion constraints, determine if the constraints\n\/\/ admits the expression. In general, this is the case when the operands\n\/\/ of the e are dependently convertible to the types of the expression in c.\ntemplate<typename Usage>\nExpr*\nadmit_usage_expr(Context& cxt, Usage& c, Expr& e)\n{\n struct fn\n {\n Context& cxt;\n Usage& c;\n Expr* operator()(Expr& e) { banjo_unhandled_case(e); }\n Expr* operator()(Reference_expr& e) { return admit_reference_expr(cxt, c, e); }\n Expr* operator()(Binary_expr& e) { return admit_binary_expr(cxt, c, e); }\n Expr* operator()(Call_expr& e) { return admit_call_expr(cxt, c, e); }\n };\n\n \/\/ An expression of a different kind prove admissibility.\n if (typeid(c.expression()) != typeid(e))\n return nullptr;\n\n return apply(e, fn{cxt, c});\n}\n\n\n\/\/ Just look through to the nested constraint.\ninline Expr*\nadmit_parametric_expr(Context& cxt, Parameterized_cons& c, Expr& e)\n{\n return admit_expression(cxt, c.constraint(), e);\n}\n\n\n\/\/ An expression is admissible for a conjunction of assumptions if\n\/\/ support is found in either the left or right operand.\nExpr*\nadmit_conjunction_expr(Context& cxt, Conjunction_cons& c, Expr& e)\n{\n if (Expr* e1 = admit_expression(cxt, c.left(), e))\n return e1;\n else\n return admit_expression(cxt, c.right(), e);\n}\n\n\n\/\/ An expression is admissible for a disjinction of assumptions if\n\/\/ support is found both the left and right operand.\ninline Expr*\nadmit_disjunction_expr(Context& cxt, Disjunction_cons& c, Expr& e)\n{\n if (Expr* e1 = admit_expression(cxt, c.left(), e)) {\n if (Expr* e2 = admit_expression(cxt, c.right(), e)) {\n if (!is_equivalent(e1->type(), e2->type()))\n throw Translation_error(cxt, \"multiple types deduced for '{}'\", e);\n return e1;\n }\n }\n return nullptr;\n}\n\n\n\/\/ Determine if the expression `e` is admissible under the given\n\/\/ constraint set. Returns a fully typed expression if admissible\n\/\/ and nullptr if not.\n\/\/\n\/\/ Note that a predicate constraint does not admit any expressions.\n\/\/ That will change when we add axioms.\n\/\/\n\/\/ FIXME: This needs to be a deduction algorithm. That is, we\n\/\/ want find a substitution form `e` to some assumed expression.\n\/\/\n\/\/ FIXME: What happens if we have requirements like these:\n\/\/\n\/\/ |e : t1| \/\\ |e : t2|\n\/\/\n\/\/ This only seems illogical to assume contradictory things. However,\n\/\/ from the perspective of checking it doesn't actually matter since\n\/\/ any proof requires only that e have type t1 or t2. Not both.\n\/\/\n\/\/ Then there's this:\n\/\/\n\/\/ |e : t1| \\\/ |e : t2|\n\/\/\n\/\/ Here, we have to show that both are satisfied. I would think that t\n\/\/ his is never satisfiable since e could never have different types.\n\/\/ However, we *could* defer that resolution by creating an intersection\n\/\/ type. But that might not fly.\nExpr*\nadmit_expression(Context& cxt, Cons& c, Expr& e)\n{\n struct fn\n {\n Context& cxt;\n Expr& e;\n Expr* operator()(Cons& c) { banjo_unhandled_case(c); }\n Expr* operator()(Concept_cons& c) { return admit_concept_expr(cxt, c, e); }\n Expr* operator()(Predicate_cons& c) { return nullptr; }\n Expr* operator()(Expression_cons& c) { return admit_usage_expr(cxt, c, e); }\n Expr* operator()(Conversion_cons& c) { return admit_usage_expr(cxt, c, e); }\n Expr* operator()(Parameterized_cons& c) { return admit_parametric_expr(cxt, c, e); }\n Expr* operator()(Conjunction_cons& c) { return admit_conjunction_expr(cxt, c, e); }\n Expr* operator()(Disjunction_cons& c) { return admit_disjunction_expr(cxt, c, e); }\n };\n \/\/ note(\"admit expr '{}' in '{}'\", e, c);\n return apply(c, fn{cxt, e});\n}\n\n\nExpr*\nadmit_expression(Context& cxt, Expr& c, Expr& e)\n{\n return admit_expression(cxt, normalize(cxt, c), e);\n}\n\n\n\/\/ -------------------------------------------------------------------------- \/\/\n\/\/ Availability of conversions\n\nExpr*\nadmit_concept_conv(Context& cxt, Concept_cons& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, expand(cxt, c), e, t);\n}\n\n\n\/\/ Note that, within this function, the the conversion's type\n\/\/ is equivalent to the destination type.\n\/\/\n\/\/ FIXME: Factor out the \"conformance checking\" code.\nExpr*\nadmit_binary_conv(Context& cxt, Conversion_cons& c, Binary_expr& e)\n{\n \/\/ Determine if the operands can be converted to the\n \/\/ declared type of the required expressin.\n Binary_expr& a = cast<Binary_expr>(c.expression());\n Type& t1 = declared_type(a.left());\n Type& t2 = declared_type(a.right());\n try {\n copy_initialize(cxt, t1, e.left());\n copy_initialize(cxt, t2, e.right());\n } catch(Translation_error&) {\n return nullptr;\n }\n\n \/\/ Adjust the type of the expression under test to that of\n \/\/ the required expression.\n \/\/\n \/\/ FIXME: It's possible that we need to preserve the original\n \/\/ conversions in order to sort candidates. Consider:\n \/\/\n \/\/ requires (T a, T const b) {\n \/\/ f(a) -> T; \/\/ #1\n \/\/ f(b) -> T const; \/\/ #2\n \/\/ }\n \/\/\n \/\/ In an algorithm that uses a f(x) where x is const, we would\n \/\/ prefer #1. Perhaps we should collect viable conversion\n \/\/ and then sort at the end. Note that this is true for simple\n \/\/ typings also.\n \/\/\n \/\/ FIXME: Add constructors to the builder. This is just plain dumb.\n return new Dependent_conv(c.type(), e);\n}\n\n\nExpr*\nadmit_usage_conv(Context& cxt, Conversion_cons& c, Expr& e, Type& t)\n{\n struct fn\n {\n Context& cxt;\n Conversion_cons& c;\n Expr* operator()(Expr& e) { banjo_unhandled_case(e); }\n Expr* operator()(Binary_expr& e) { return admit_binary_conv(cxt, c, e); }\n };\n\n \/\/ An expression of a different kind prove admissibility.\n Expr& e2 = c.expression();\n if (typeid(e2) != typeid(e))\n return nullptr;\n\n \/\/ If the expression's type is not equivalent to t, this constraint\n \/\/ does not prove admissibility.\n if (!is_equivalent(c.type(), t))\n return nullptr;\n\n return apply(e, fn{cxt, c});\n}\n\n\nExpr*\nadmit_parametric_conv(Context& cxt, Parameterized_cons& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, c.constraint(), e, t);\n}\n\n\nExpr*\nadmit_conjunction_conv(Context& cxt, Conjunction_cons& c, Expr& e, Type& t)\n{\n if (Expr* c1 = admit_conversion(cxt, c.left(), e, t))\n return c1;\n else\n return admit_conversion(cxt, c.right(), e, t);\n}\n\n\nExpr*\nadmit_disjunction_conv(Context& cxt, Disjunction_cons& c, Expr& e, Type& t)\n{\n \/\/ Note that if we find evidence for a conversion in both branches\n \/\/ then it is guaranteed that they are equivalent.\n if (Expr* c1 = admit_conversion(cxt, c.left(), e, t)) {\n if (admit_conversion(cxt, c.right(), e, t))\n return c1;\n }\n return nullptr;\n}\n\n\n\/\/ TODO: Factor out the traversal of constraints in order to avoid\n\/\/ repeating all this bolier plate?\nExpr*\nadmit_conversion(Context& cxt, Cons& c, Expr& e, Type& t)\n{\n struct fn\n {\n Context& cxt;\n Expr& e;\n Type& t;\n Expr* operator()(Cons& c) { banjo_unhandled_case(c); }\n Expr* operator()(Concept_cons& c) { return admit_concept_conv(cxt, c, e, t); }\n Expr* operator()(Expression_cons& c) { return nullptr; }\n Expr* operator()(Conversion_cons& c) { return admit_usage_conv(cxt, c, e, t); }\n Expr* operator()(Parameterized_cons& c) { return admit_parametric_conv(cxt, c, e, t); }\n Expr* operator()(Conjunction_cons& c) { return admit_conjunction_conv(cxt, c, e, t); }\n Expr* operator()(Disjunction_cons& c) { return admit_disjunction_conv(cxt, c, e, t); }\n };\n \/\/ note(\"admit conv '{}' to '{}' in '{}'\", e, t, c);\n return apply(c, fn{cxt, e, t});\n}\n\n\nExpr*\nadmit_conversion(Context& cxt, Expr& c, Expr& e, Type& t)\n{\n return admit_conversion(cxt, normalize(cxt, c), e, t);\n}\n\n\n} \/\/ namespace banjo\n<|endoftext|>"} {"text":"<commit_before>#include <cassert>\n#include <var>\n#include <map>\n#include <fstream>\n\nusing namespace std;\n\nvar getString()\n{\n cout << \"In getString()\" << endl;\n var str;\n str = \"An example string with spaces.\";\n return str;\n}\n\nvoid useString(var s)\n{\n \/\/ The ampersand suppresses the double quotes by passing the raw\n \/\/ char* to the format operator.\n cout << \"Using: \" << &s << endl;\n}\n\nint main(int argc, char** argv)\n{\n \/\/ Copy the command line\n var arg(argc, argv);\n\n \/\/ Check that one and two level indexing works\n cout << \"Arg: \" << arg << endl;\n cout << \"Arg[0]: \" << arg[0] << endl;\n cout << \"Arg[0][0]: \" << arg[0][0] << endl;\n\n \/\/ Check that operator == works\n if (arg[0][0] == '.')\n cout << \"It's a dot\" << endl;\n else\n cout << \"It's not a dot\" << endl;\n\n \/\/ Check that index() finds (or not) an element\n if (arg.index(\"-f\"))\n cout << \"There's a -f\" << endl;\n else\n cout << \"There's no -f\" << endl;\n\n \/\/ Basic numerical tests\n var s, w, x, y, z, dummy;\n cout << (s ? \"true\" : \"false\") << endl;\n cout << (!s ? \"true\" : \"false\") << endl;\n w = 'w';\n x = 2;\n y = 3.14;\n z = y.cos();\n s = \"Hello!\";\n cout << (s ? \"true\" : \"false\") << endl;\n cout << (!s ? \"true\" : \"false\") << endl;\n\n cout << \"Var size is \" << sizeof(var) << endl;\n cout << w << endl;\n cout << x << endl;\n cout << y << endl;\n cout << z << endl;\n cout << s << endl;\n cout << s.at(0) << endl;\n cout << s[0] << endl;\n\n \/\/ Numerical overloads\n x += 2;\n y += 3.14f;\n x.push(2);\n y -= 1;\n cout << x << endl;\n cout << y << endl;\n\n \/\/ Reference the same object & reference counting\n var a = s;\n cout << \"a is: \" << a << endl;\n a = \"New string\";\n\n \/\/ String comparison\n var n = \"New string\";\n if (a == n)\n cout << \"equal\" << endl;\n else\n cout << \"not equal\" << endl;\n\n \/\/ Pass a string into a function, it's still valid outside\n cout << \"Calling getString()\" << endl;\n var b = getString();\n cout << \"b is: \" << b << endl;\n useString(b);\n cout << \"b is: \" << b << endl;\n\n \/\/ Basic string split\n var sp;\n sp = b.split(\"n\");\n cout << \"sp is: \" << sp << endl;\n\n \/\/ String strip\n var ss = \" Hello \";\n cout << ss;\n cout << \" strips to \";\n cout << ss.strip() << endl;\n\n \/\/ Basic string insert\n a.insert(\"ddd\", 1);\n cout << \"a is: \" << a << endl;\n a.append(\"aaa\");\n cout << \"a is: \" << a << endl;\n\n \/\/ String sprintf\n var str;\n cout << \"sprintf: \" << str.sprintf(\"This string is %d %f\", 1, 0.1) << endl;\n\n \/\/ Shifting of command line\n arg.insert(\"insert\", 1);\n cout << \"arg is: \" << arg << endl;\n arg.remove(0);\n cout << \"arg is: \" << arg << endl;\n var as = arg.shift();\n cout << \"arg is: \" << arg << \" shifted: \" << as << endl;\n\n \/\/ Join the command line args\n cout << \"Joining: \" << arg << endl;\n cout << \"Joined: \" << arg.join(\"-\") << endl;\n\n \/\/ Sort the command line args\n cout << arg.sort() << endl;\n\n \/\/ Check that we can act as a std::map key (just needs operator<)\n map<var, int> map;\n map[\"One\"] = 1;\n map[\"Two\"] = 2;\n map[\"Three\"] = 3;\n cout << map.count(\"Zero\") << endl;\n cout << map.count(\"One\") << endl;\n\n \/\/ Read a small file\n var f;\n var t;\n ifstream is(\"tests.txt\", ifstream::in);\n if (is.fail())\n cout << \"Open failed\" << endl;\n while (f.getline(is))\n {\n cout << f << endl;\n t.push(f.copy());\n }\n cout << t << endl;\n\n \/\/ Shallow copy\n var c1 = arg;\n c1.push(\"extra\");\n cout << c1 << endl;\n cout << arg << endl;\n var c2 = arg.copy();\n c2.pop();\n cout << c2 << endl;\n cout << arg << endl;\n\n \/\/ Modify an array using operator[]\n int xxa[] = {1,2,3,4,5};\n var xa(5, xxa);\n cout << \"xa is \" << xa << endl;\n xa[1] = xa[0];\n xa[2] += xa[1];\n xa[3] = 7;\n xa[4] += 7;\n cout << \"xa is \" << xa << endl;\n\n \/\/ Array of vars by pushing\n var arr1;\n arr1.push(\"Hi!\");\n cout << arr1 << endl;\n\n \/\/ Array of vars just by assigning indeces\n var arr2;\n arr2[1] = \"Hi!\";\n cout << arr2 << endl;\n\n \/\/ Array indexed by var\n var vmap;\n vmap[\"one\"] = 1;\n vmap[\"two\"] = 2;\n vmap[\"three\"] = 3;\n cout << \"vmap[0] is \" << vmap[0] << endl;\n cout << \"vmap[1] is \" << vmap[1] << endl;\n cout << \"vmap[\\\"three\\\"] is \" << vmap[\"three\"] << endl;\n cout << \"vmap is \" << vmap << endl;\n cout << \"vmap.copy() is \" << vmap.copy() << endl;\n\n \/\/ Multi-dimensional array\n var iarr;\n iarr[1][2] = 3;\n iarr[1][4] = 5;\n cout << \"iarr is \" << iarr << endl;\n\n \/\/ Multi-dimensional map\n var wmap;\n wmap[\"one\"][\"two\"] = \"three\";\n wmap[\"one\"][\"four\"] = \"five\";\n cout << \"wmap is \" << wmap << endl;\n\n \/\/ Init from variable argument list\n var ai(5, 5,4,3,2,1);\n cout << \"ai is: \" << ai << endl;\n\n \/\/ Read a text file via a dynamic library\n vfile txtf(\"txt\");\n var txt = txtf.read(\"tests.txt\");\n cout << \"Loaded: \" << txt << endl;\n\n \/\/ Read a .ini file via a dynamic library\n vfile inif(\"ini\");\n var ini = inif.read(\"tests.ini\");\n cout << \"Loaded: \" << ini << endl;\n\n \/\/ Plot something with gnuplot\n var gnu;\n gnu.push(\"plot sin(x), \\\"-\\\"\");\n gnu.push(ai);\n vfile gnuf(\"gnuplot\");\n gnuf.write(\"tests.eps\", gnu);\n\n \/\/ Tensors\n var ts = 0.0f;\n ts.resize(16);\n for (int i=0; i<16; i++)\n ts[i] = (float)i;\n var t1 = ts.view(2, 4, 4);\n var t2 = ts.view(3, 2, 2, 4);\n cout << ts << endl;\n cout << t1 << endl;\n cout << t2 << endl;\n cout << \"t1(1,2): \" << t1(1,2) << endl;\n cout << \"t2(1,1,2): \" << t2(1,1,2) << endl;\n t1(1,2) = 2.3f;\n cout << t1 << endl;\n\n \/\/ BLAS\n var bt(4, 1.0f, 1.2, 0.8, -2.0);\n cout << bt << \" sums to \" << bt.sum() << endl;\n cout << bt << \" asums to \" << bt.asum() << endl;\n\n \/\/ Stream\n vstream vstr;\n float fl = 23e-1f;\n vstr << \"H\";\n cout << vstr.var() << endl;\n vstr << \"ello: \" << fl;\n cout << vstr.var() << endl;\n\n \/\/ gedcom\n vfile gedf(\"ged\");\n var ged = gedf.read(\"tests.ged\");\n cout << \"Loaded: \" << ged << endl;\n\n \/\/ XML\n vfile xmlf(\"xml\");\n var xml = xmlf.read(\"tests.xml\");\n cout << \"Loaded: \" << xml << endl;\n\n \/\/ wav\n vfile wavf(\"snd\");\n var wav = wavf.read(\"tests.wav\");\n cout << \"Loaded wav file:\" << endl;\n cout << \" rate: \" << wav[\"rate\"] << endl;\n cout << \" channels: \" << wav[\"channels\"] << endl;\n cout << \" size: \" << wav[\"data\"].size() << endl;\n\n \/\/ Exception\n try {\n throw vruntime_error(bt);\n }\n catch (vruntime_error e) {\n cout << \"Caught: \" << e.what() << endl;\n };\n\n \/\/ Init by overloading operator,()\n var comma;\n comma = 1.2, 2.0, 4, 5;\n cout << \"Comma is: \" << comma << endl;\n\n \/\/ Regular expressions\n cout << \"Searching ello: \" << ss << endl;\n if (ss.search(\"ello\"))\n cout << \"Matches\" << endl;\n else\n cout << \"Matches not\" << endl;\n cout << \"Matching \\\\S+ell\\\\S: \" << ss << endl;\n if (ss.search(\"\\\\S+ell\\\\S\"))\n cout << \"Matches\" << endl;\n else\n cout << \"Matches not\" << endl;\n var rep = ss.replace(\"lo\", \"ls bells\");\n cout << \"Replaced to: \" << rep << endl;\n return 0;\n}\n<commit_msg>Wrap the tests that leak memory in a flag so valgrind runs clean<commit_after>#include <cassert>\n#include <var>\n#include <map>\n#include <fstream>\n\nusing namespace std;\n\nvar getString()\n{\n cout << \"In getString()\" << endl;\n var str;\n str = \"An example string with spaces.\";\n return str;\n}\n\nvoid useString(var s)\n{\n \/\/ The ampersand suppresses the double quotes by passing the raw\n \/\/ char* to the format operator.\n cout << \"Using: \" << &s << endl;\n}\n\nint main(int argc, char** argv)\n{\n \/\/ Copy the command line\n var arg(argc, argv);\n\n \/\/ Check that one and two level indexing works\n cout << \"Arg: \" << arg << endl;\n cout << \"Arg[0]: \" << arg[0] << endl;\n cout << \"Arg[0][0]: \" << arg[0][0] << endl;\n\n \/\/ Check that operator == works\n if (arg[0][0] == '.')\n cout << \"It's a dot\" << endl;\n else\n cout << \"It's not a dot\" << endl;\n\n \/\/ Check that index() finds (or not) an element\n if (arg.index(\"-f\"))\n cout << \"There's a -f\" << endl;\n else\n cout << \"There's no -f\" << endl;\n\n \/\/ Given command line working, set a flag for valgrind\n bool vg = true;\n if (arg.index(\"-vg\"))\n vg = false;\n\n \/\/ Basic numerical tests\n var s, w, x, y, z, dummy;\n cout << (s ? \"true\" : \"false\") << endl;\n cout << (!s ? \"true\" : \"false\") << endl;\n w = 'w';\n x = 2;\n y = 3.14;\n z = y.cos();\n s = \"Hello!\";\n cout << (s ? \"true\" : \"false\") << endl;\n cout << (!s ? \"true\" : \"false\") << endl;\n\n cout << \"Var size is \" << sizeof(var) << endl;\n cout << w << endl;\n cout << x << endl;\n cout << y << endl;\n cout << z << endl;\n cout << s << endl;\n cout << s.at(0) << endl;\n cout << s[0] << endl;\n\n \/\/ Numerical overloads\n x += 2;\n y += 3.14f;\n x.push(2);\n y -= 1;\n cout << x << endl;\n cout << y << endl;\n\n \/\/ Reference the same object & reference counting\n var a = s;\n cout << \"a is: \" << a << endl;\n a = \"New string\";\n\n \/\/ String comparison\n var n = \"New string\";\n if (a == n)\n cout << \"equal\" << endl;\n else\n cout << \"not equal\" << endl;\n\n \/\/ Pass a string into a function, it's still valid outside\n cout << \"Calling getString()\" << endl;\n var b = getString();\n cout << \"b is: \" << b << endl;\n useString(b);\n cout << \"b is: \" << b << endl;\n\n \/\/ Basic string split\n var sp;\n sp = b.split(\"n\");\n cout << \"sp is: \" << sp << endl;\n\n \/\/ String strip\n var ss = \" Hello \";\n cout << ss;\n cout << \" strips to \";\n cout << ss.strip() << endl;\n\n \/\/ Basic string insert\n a.insert(\"ddd\", 1);\n cout << \"a is: \" << a << endl;\n a.append(\"aaa\");\n cout << \"a is: \" << a << endl;\n\n \/\/ String sprintf\n var str;\n cout << \"sprintf: \" << str.sprintf(\"This string is %d %f\", 1, 0.1) << endl;\n\n \/\/ Shifting of command line\n arg.insert(\"insert\", 1);\n cout << \"arg is: \" << arg << endl;\n arg.remove(0);\n cout << \"arg is: \" << arg << endl;\n var as = arg.shift();\n cout << \"arg is: \" << arg << \" shifted: \" << as << endl;\n\n \/\/ Join the command line args\n cout << \"Joining: \" << arg << endl;\n cout << \"Joined: \" << arg.join(\"-\") << endl;\n\n \/\/ Sort the command line args\n cout << arg.sort() << endl;\n\n \/\/ Check that we can act as a std::map key (just needs operator<)\n map<var, int> map;\n map[\"One\"] = 1;\n map[\"Two\"] = 2;\n map[\"Three\"] = 3;\n cout << map.count(\"Zero\") << endl;\n cout << map.count(\"One\") << endl;\n\n \/\/ Read a small file\n var f;\n var t;\n ifstream is(\"tests.txt\", ifstream::in);\n if (is.fail())\n cout << \"Open failed\" << endl;\n while (f.getline(is))\n {\n cout << f << endl;\n t.push(f.copy());\n }\n cout << t << endl;\n\n \/\/ Shallow copy\n var c1 = arg;\n c1.push(\"extra\");\n cout << c1 << endl;\n cout << arg << endl;\n var c2 = arg.copy();\n c2.pop();\n cout << c2 << endl;\n cout << arg << endl;\n\n \/\/ Modify an array using operator[]\n int xxa[] = {1,2,3,4,5};\n var xa(5, xxa);\n cout << \"xa is \" << xa << endl;\n xa[1] = xa[0];\n xa[2] += xa[1];\n xa[3] = 7;\n xa[4] += 7;\n cout << \"xa is \" << xa << endl;\n\n \/\/ Array of vars by pushing\n var arr1;\n arr1.push(\"Hi!\");\n cout << arr1 << endl;\n\n \/\/ Array of vars just by assigning indeces\n var arr2;\n arr2[1] = \"Hi!\";\n cout << arr2 << endl;\n\n \/\/ Array indexed by var\n var vmap;\n vmap[\"one\"] = 1;\n vmap[\"two\"] = 2;\n vmap[\"three\"] = 3;\n cout << \"vmap[0] is \" << vmap[0] << endl;\n cout << \"vmap[1] is \" << vmap[1] << endl;\n cout << \"vmap[\\\"three\\\"] is \" << vmap[\"three\"] << endl;\n cout << \"vmap is \" << vmap << endl;\n cout << \"vmap.copy() is \" << vmap.copy() << endl;\n\n \/\/ Multi-dimensional array\n var iarr;\n iarr[1][2] = 3;\n iarr[1][4] = 5;\n cout << \"iarr is \" << iarr << endl;\n\n \/\/ Multi-dimensional map\n var wmap;\n wmap[\"one\"][\"two\"] = \"three\";\n wmap[\"one\"][\"four\"] = \"five\";\n cout << \"wmap is \" << wmap << endl;\n\n \/\/ Init from variable argument list\n var ai(5, 5,4,3,2,1);\n cout << \"ai is: \" << ai << endl;\n\n \/\/ Read a text file via a dynamic library\n if (vg)\n {\n vfile txtf(\"txt\");\n var txt = txtf.read(\"tests.txt\");\n cout << \"Loaded: \" << txt << endl;\n }\n\n \/\/ Read a .ini file via a dynamic library\n if (vg)\n {\n vfile inif(\"ini\");\n var ini = inif.read(\"tests.ini\");\n cout << \"Loaded: \" << ini << endl;\n }\n\n \/\/ Plot something with gnuplot\n if (vg)\n {\n var gnu;\n gnu.push(\"plot sin(x), \\\"-\\\"\");\n gnu.push(ai);\n vfile gnuf(\"gnuplot\");\n gnuf.write(\"tests.eps\", gnu);\n }\n\n \/\/ Tensors\n var ts = 0.0f;\n ts.resize(16);\n for (int i=0; i<16; i++)\n ts[i] = (float)i;\n var t1 = ts.view(2, 4, 4);\n var t2 = ts.view(3, 2, 2, 4);\n cout << ts << endl;\n cout << t1 << endl;\n cout << t2 << endl;\n cout << \"t1(1,2): \" << t1(1,2) << endl;\n cout << \"t2(1,1,2): \" << t2(1,1,2) << endl;\n t1(1,2) = 2.3f;\n cout << t1 << endl;\n\n \/\/ BLAS\n var bt(4, 1.0f, 1.2, 0.8, -2.0);\n if (vg)\n {\n cout << bt << \" sums to \" << bt.sum() << endl;\n cout << bt << \" asums to \" << bt.asum() << endl;\n }\n\n \/\/ Stream\n vstream vstr;\n float fl = 23e-1f;\n vstr << \"H\";\n cout << vstr.var() << endl;\n vstr << \"ello: \" << fl;\n cout << vstr.var() << endl;\n\n \/\/ gedcom\n if (vg)\n {\n vfile gedf(\"ged\");\n var ged = gedf.read(\"tests.ged\");\n cout << \"Loaded: \" << ged << endl;\n }\n\n \/\/ XML\n if (vg)\n {\n vfile xmlf(\"xml\");\n var xml = xmlf.read(\"tests.xml\");\n cout << \"Loaded: \" << xml << endl;\n }\n\n \/\/ wav\n if (vg)\n {\n vfile wavf(\"snd\");\n var wav = wavf.read(\"tests.wav\");\n cout << \"Loaded wav file:\" << endl;\n cout << \" rate: \" << wav[\"rate\"] << endl;\n cout << \" channels: \" << wav[\"channels\"] << endl;\n cout << \" size: \" << wav[\"data\"].size() << endl;\n }\n\n \/\/ Exception\n try {\n throw vruntime_error(bt);\n }\n catch (vruntime_error e) {\n cout << \"Caught: \" << e.what() << endl;\n };\n\n \/\/ Init by overloading operator,()\n var comma;\n comma = 1.2, 2.0, 4, 5;\n cout << \"Comma is: \" << comma << endl;\n\n \/\/ Regular expressions\n cout << \"Searching ello: \" << ss << endl;\n if (ss.search(\"ello\"))\n cout << \"Matches\" << endl;\n else\n cout << \"Matches not\" << endl;\n cout << \"Matching \\\\S+ell\\\\S: \" << ss << endl;\n if (ss.search(\"\\\\S+ell\\\\S\"))\n cout << \"Matches\" << endl;\n else\n cout << \"Matches not\" << endl;\n var rep = ss.replace(\"lo\", \"ls bells\");\n cout << \"Replaced to: \" << rep << endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/g++ -std=c++14 tests.cpp -o tests && .\/tests\n\n#include \"LinkedList.h\"\n#include <assert.h> \n#include <iostream>\n\nvoid GivenNothingInList_WhenSizeCalled_Returns0()\n{\n LinkedList<int> list = LinkedList<int>();\n assert(list.size() == 0);\n}\n\nvoid GivenNothingInList_WhenAddNodeAtPlace0_ReturnsTrue()\n{\n LinkedList<int> list = LinkedList<int>();\n assert(list.add(0, 1) == true);\n}\n\nvoid GivenOneNodeInList_WhenAddNodeIndexLargerThanListSize_ThenNodeAddedToEndOfList()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n\n \/\/Act\n list.add(5, 2);\n list.add(4, 3);\n\n \/\/Assert\n assert(list.get(0) == 1);\n assert(list.get(1) == 2);\n assert(list.get(2) == 3);\n}\n\nvoid GivenThreeNodesInList_WhenSizeCalled_Returns3()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n list.add(2);\n list.add(3);\n\n \/\/Act Assert\n assert(list.size() == 3);\n}\n\nvoid GivenNothingInList_WhenUnshiftCalled_ThenListSize1()\n{\n LinkedList<int> list = LinkedList<int>();\n list.unshift(1);\n\n assert(list.size() == 1);\n}\n\nvoid GivenOneNodeInList_WhenUnshiftCalled_ThenListSize2()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n list.unshift(2);\n\n assert(list.size() == 2);\n}\n\nvoid GivenOneNodeInList_WhenUnshiftCalled_ThenExistingNodeLast()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n list.unshift(2);\n\n assert(list.get(0) == 2);\n assert(list.get(1) == 1);\n}\n\nvoid GivenNothingInList_WhenSetIsCalled_ThenReturnsFalse()\n{\n LinkedList<int> list = LinkedList<int>();\n\n assert(list.set(-1, 1) == false);\n assert(list.set(0, 1) == false);\n assert(list.set(1, 1) == false);\n}\n\nvoid GivenThreeNodesInList_WhenSetIsCalledAtPlace1_ThenSecondNodeIsSet()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n list.set(1, 10);\n\n assert(list.get(0) == 0);\n assert(list.get(1) == 10);\n assert(list.get(2) == 2);\n}\n\nvoid GivenNothingInList_WhenPopIsCalled_ThenReturnsFalse()\n{\n LinkedList<int> list = LinkedList<int>();\n assert(list.pop() == false);\n}\n\nvoid GivenTwoNodesInList_WhenPopIsCalled_ThenReturnsLastNode()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n\n assert(list.pop() == 1);\n}\n\nvoid GivenTwoNodesInList_WhenPopIsCalled_ThenListIsShorter()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n\n assert(list.size() == 2);\n list.pop();\n assert(list.size() == 1);\n}\n\nvoid GivenNothingInList_WhenShiftIsCalled_ThenReturnsFalse()\n{\n LinkedList<int> list = LinkedList<int>();\n assert(list.shift() == false);\n}\n\nvoid GivenOneNodeInList_WhenShiftIsCalled_ThenReturnsData()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(5);\n\n assert(list.shift() == 5);\n}\n\nvoid GivenOneNodeInList_WhenShiftIsCalled_ThenListEmpty()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(5);\n\n assert(list.size() == 1);\n list.shift();\n assert(list.size() == 0);\n}\n\nvoid GivenThreeNodesInList_WhenShiftIsCalled_ThenReturnsFirstData()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.shift() == 0);\n}\n\nvoid GivenThreeNodesInList_WhenShiftIsCalled_ThenListIsShorter()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.size() == 3);\n list.shift();\n assert(list.size() == 2);\n}\n\nvoid GivenNothingInList_WhenRemoveIsCalled_ThenFalseIsReturned()\n{\n LinkedList<int> list = LinkedList<int>();\n\n assert(list.remove(0) == false);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalledAtPlace0_ThenFirstNodeDataIsReturned()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.remove(0) == 0);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalledAtPlace2_ThenLastNodeDataIsReturned()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.remove(2) == 2);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalled_ThenListIsShorter()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.size() == 3);\n list.remove(1);\n assert(list.size() == 2);\n}\n\nvoid GivenNothingInList_WhenGetIsCalled_ThenReturnsFalse()\n{\n LinkedList<int> list = LinkedList<int>();\n\n assert(list.get(0) == false);\n}\n\nvoid GivenThreeNodesInList_WhenGetIsCalled_ThenReturnsData()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n assert(list.get(1) == 1);\n}\n\nvoid GivenNothingInList_WhenClearIsCalled_ThenSizeUnchanged()\n{\n LinkedList<int> list = LinkedList<int>();\n\n assert(list.size() == 0);\n list.clear();\n assert(list.size() == 0);\n}\n\nvoid GivenThreeInList_WhenClearIsCalled_ThenListEmpty()\n{\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n list.clear();\n\n assert(list.size() == 0);\n}\n\nint main()\n{\n GivenNothingInList_WhenSizeCalled_Returns0();\n GivenNothingInList_WhenAddNodeAtPlace0_ReturnsTrue();\n GivenOneNodeInList_WhenAddNodeIndexLargerThanListSize_ThenNodeAddedToEndOfList();\n GivenThreeNodesInList_WhenSizeCalled_Returns3();\n GivenNothingInList_WhenUnshiftCalled_ThenListSize1();\n GivenOneNodeInList_WhenUnshiftCalled_ThenListSize2();\n GivenOneNodeInList_WhenUnshiftCalled_ThenExistingNodeLast();\n GivenNothingInList_WhenSetIsCalled_ThenReturnsFalse();\n GivenThreeNodesInList_WhenSetIsCalledAtPlace1_ThenSecondNodeIsSet();\n GivenNothingInList_WhenPopIsCalled_ThenReturnsFalse();\n GivenTwoNodesInList_WhenPopIsCalled_ThenReturnsLastNode();\n GivenTwoNodesInList_WhenPopIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenShiftIsCalled_ThenReturnsFalse();\n GivenOneNodeInList_WhenShiftIsCalled_ThenReturnsData();\n GivenOneNodeInList_WhenShiftIsCalled_ThenListEmpty();\n GivenThreeNodesInList_WhenShiftIsCalled_ThenReturnsFirstData();\n GivenThreeNodesInList_WhenShiftIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenRemoveIsCalled_ThenFalseIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalledAtPlace0_ThenFirstNodeDataIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalledAtPlace2_ThenLastNodeDataIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenGetIsCalled_ThenReturnsFalse();\n GivenThreeNodesInList_WhenGetIsCalled_ThenReturnsData();\n GivenNothingInList_WhenClearIsCalled_ThenSizeUnchanged();\n GivenThreeInList_WhenClearIsCalled_ThenListEmpty();\n\n std::cout<< \"Tests pass\"<< std::endl;\n}\n<commit_msg>More consistent test structure<commit_after>\/\/g++ -std=c++14 tests.cpp -o tests && .\/tests\n\n#include \"LinkedList.h\"\n#include <assert.h> \n#include <iostream>\n\nvoid GivenNothingInList_WhenSizeCalled_Returns0()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.size() == 0);\n}\n\nvoid GivenNothingInList_WhenAddNodeAtPlace0_ReturnsTrue()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.add(0, 1) == true);\n}\n\nvoid GivenOneNodeInList_WhenAddNodeIndexLargerThanListSize_ThenNodeAddedToEndOfList()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n\n \/\/Act\n list.add(5, 2);\n list.add(4, 3);\n\n \/\/Assert\n assert(list.get(0) == 1);\n assert(list.get(1) == 2);\n assert(list.get(2) == 3);\n}\n\nvoid GivenThreeNodesInList_WhenSizeCalled_Returns3()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n list.add(2);\n list.add(3);\n\n \/\/Act Assert\n assert(list.size() == 3);\n}\n\nvoid GivenNothingInList_WhenUnshiftCalled_ThenListSize1()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act\n list.unshift(1);\n\n \/\/Assert\n assert(list.size() == 1);\n}\n\nvoid GivenOneNodeInList_WhenUnshiftCalled_ThenListSize2()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n\n \/\/Act\n list.unshift(2);\n\n \/\/Assert\n assert(list.size() == 2);\n}\n\nvoid GivenOneNodeInList_WhenUnshiftCalled_ThenExistingNodeLast()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(1);\n\n \/\/Act\n list.unshift(2);\n\n \/\/Assert\n assert(list.get(0) == 2);\n assert(list.get(1) == 1);\n}\n\nvoid GivenNothingInList_WhenSetIsCalled_ThenReturnsFalse()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.set(-1, 1) == false);\n assert(list.set(0, 1) == false);\n assert(list.set(1, 1) == false);\n}\n\nvoid GivenThreeNodesInList_WhenSetIsCalledAtPlace1_ThenSecondNodeIsSet()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act \n list.set(1, 10);\n\n \/\/Assert\n assert(list.get(0) == 0);\n assert(list.get(1) == 10);\n assert(list.get(2) == 2);\n}\n\nvoid GivenNothingInList_WhenPopIsCalled_ThenReturnsFalse()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.pop() == false);\n}\n\nvoid GivenTwoNodesInList_WhenPopIsCalled_ThenReturnsLastNode()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n\n \/\/Act Assert\n assert(list.pop() == 1);\n}\n\nvoid GivenTwoNodesInList_WhenPopIsCalled_ThenListIsShorter()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n\n \/\/Act Assert\n assert(list.size() == 2);\n list.pop();\n assert(list.size() == 1);\n}\n\nvoid GivenNothingInList_WhenShiftIsCalled_ThenReturnsFalse()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.shift() == false);\n}\n\nvoid GivenOneNodeInList_WhenShiftIsCalled_ThenReturnsData()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(5);\n\n \/\/Act Assert\n assert(list.shift() == 5);\n}\n\nvoid GivenOneNodeInList_WhenShiftIsCalled_ThenListEmpty()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(5);\n\n \/\/Act Assert\n assert(list.size() == 1);\n list.shift();\n assert(list.size() == 0);\n}\n\nvoid GivenThreeNodesInList_WhenShiftIsCalled_ThenReturnsFirstData()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.shift() == 0);\n}\n\nvoid GivenThreeNodesInList_WhenShiftIsCalled_ThenListIsShorter()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.size() == 3);\n list.shift();\n assert(list.size() == 2);\n}\n\nvoid GivenNothingInList_WhenRemoveIsCalled_ThenFalseIsReturned()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.remove(0) == false);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalledAtPlace0_ThenFirstNodeDataIsReturned()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.remove(0) == 0);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalledAtPlace2_ThenLastNodeDataIsReturned()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.remove(2) == 2);\n}\n\nvoid GivenThreeNodesInList_WhenRemoveIsCalled_ThenListIsShorter()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.size() == 3);\n list.remove(1);\n assert(list.size() == 2);\n}\n\nvoid GivenNothingInList_WhenGetIsCalled_ThenReturnsFalse()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.get(0) == false);\n}\n\nvoid GivenThreeNodesInList_WhenGetIsCalled_ThenReturnsData()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act Assert\n assert(list.get(1) == 1);\n}\n\nvoid GivenNothingInList_WhenClearIsCalled_ThenSizeUnchanged()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n\n \/\/Act Assert\n assert(list.size() == 0);\n list.clear();\n assert(list.size() == 0);\n}\n\nvoid GivenThreeInList_WhenClearIsCalled_ThenListEmpty()\n{\n \/\/Arrange\n LinkedList<int> list = LinkedList<int>();\n list.add(0);\n list.add(1);\n list.add(2);\n\n \/\/Act\n list.clear();\n\n \/\/Assert\n assert(list.size() == 0);\n}\n\nint main()\n{\n GivenNothingInList_WhenSizeCalled_Returns0();\n GivenNothingInList_WhenAddNodeAtPlace0_ReturnsTrue();\n GivenOneNodeInList_WhenAddNodeIndexLargerThanListSize_ThenNodeAddedToEndOfList();\n GivenThreeNodesInList_WhenSizeCalled_Returns3();\n GivenNothingInList_WhenUnshiftCalled_ThenListSize1();\n GivenOneNodeInList_WhenUnshiftCalled_ThenListSize2();\n GivenOneNodeInList_WhenUnshiftCalled_ThenExistingNodeLast();\n GivenNothingInList_WhenSetIsCalled_ThenReturnsFalse();\n GivenThreeNodesInList_WhenSetIsCalledAtPlace1_ThenSecondNodeIsSet();\n GivenNothingInList_WhenPopIsCalled_ThenReturnsFalse();\n GivenTwoNodesInList_WhenPopIsCalled_ThenReturnsLastNode();\n GivenTwoNodesInList_WhenPopIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenShiftIsCalled_ThenReturnsFalse();\n GivenOneNodeInList_WhenShiftIsCalled_ThenReturnsData();\n GivenOneNodeInList_WhenShiftIsCalled_ThenListEmpty();\n GivenThreeNodesInList_WhenShiftIsCalled_ThenReturnsFirstData();\n GivenThreeNodesInList_WhenShiftIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenRemoveIsCalled_ThenFalseIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalledAtPlace0_ThenFirstNodeDataIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalledAtPlace2_ThenLastNodeDataIsReturned();\n GivenThreeNodesInList_WhenRemoveIsCalled_ThenListIsShorter();\n GivenNothingInList_WhenGetIsCalled_ThenReturnsFalse();\n GivenThreeNodesInList_WhenGetIsCalled_ThenReturnsData();\n GivenNothingInList_WhenClearIsCalled_ThenSizeUnchanged();\n GivenThreeInList_WhenClearIsCalled_ThenListEmpty();\n\n std::cout<< \"Tests pass\"<< std::endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file tests.cpp\n *\n * \\author Matt Hammerly\n *\/\n\n#include <postgresql\/libpq-fe.h>\n#include <string>\n#include <fstream>\n#include <stdio.h>\n#include <iostream>\n#include <curl\/curl.h>\n#include <plist\/plist++.h>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <cctype>\n#include <cstring>\n#include <cassert>\n#include \"ma.h\"\n#include \"db.h\"\n#include \"tests.h\"\n\n\/**\n * \\brief Entry point into test program\n *\/\nint main() {\n\n PGconn* conn = connectToDatabase();\n\n dropTables(conn);\n\n createTables(conn);\n\n PList::Dictionary* library = openLibrary();\n\n \/\/ test caseSensitiveFilePath()\n test_caseSensitiveFilePath();\n\n \/\/ test adding track to database\n test_addTrackToDatabase(conn);\n\n \/\/ test adding playlist to database\n test_addPlaylistToDatabase(conn);\n\n \/\/ test fractional inserts into playlists\n test_track_inserts(conn);\n\n \/\/ test track removal from playlists\n test_removal(conn);\n\n puts( PQerrorMessage(conn) );\n\n return 0;\n}\n\n\/**\n * \\brief Test caseSensitiveFilePath() function\n *\/\nvoid test_caseSensitiveFilePath() {\n std::string new_library_path = \"\/home\/matt\/hdd\/dev\/yamm\/test_data\/\";\n std::string wrong = new_library_path + \"beirut\/THe Rip tiDe\/01 A candle's Fire.mp3\";\n std::string right = new_library_path + \"Beirut\/The Rip Tide\/01 A Candle's Fire.mp3\";\n\n assert( caseSensitiveFilePath(wrong) == right );\n puts( \"caseSensitiveFilePath() works correctly!\" );\n}\n\n\/**\n * \\brief Test addTrackToDatabase(...)\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_addTrackToDatabase(PGconn* conn) {\n std::string new_library_path = \"\/home\/matt\/hdd\/dev\/yamm\/test_data\/\";\n\n PGresult* res = addTrackToDatabase( conn, \"\", new_library_path + \"Beirut\/The Rip Tide\/01 A Candle's Fire.mp3\", 0 );\n char* track_id = PQgetvalue( res, 0, 0 );\n char const *expected_id = \"1\";\n\n assert ( strcmp(track_id, expected_id) == 0 );\n puts (\"addTrackToDatabase(...) works correctly!\" );\n\n PQclear(res);\n}\n\n\/**\n * \\brief Test addPlaylistToDatabase(...)\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_addPlaylistToDatabase(PGconn* conn) {\n PGresult* res = addPlaylistToDatabase( conn, \"\", \"Test Playlist\", 0 );\n char *playlist_id = PQgetvalue( res, 0, 0 );\n char const *expected_id = \"1\";\n\n assert( strcmp( playlist_id, expected_id) == 0 );\n puts (\"addPlaylistToDatabase(...) works correctly!\" );\n\n PQclear(res);\n}\n\n\/**\n * \\brief Test appendTrackToPlaylist(...) and addTrackToPlaylist(...) functions\n *\n * \\param conn Pointer to database connection struct\n *\n * Todo: check to make sure the fractional insert is ordered correctly\n *\/\nvoid test_track_inserts(PGconn* conn) {\n \/\/ SELECT * FROM tracks_playlists Link LEFT JOIN playlists Playlist ON Link.playlist_id = Playlist.id WHERE Playlist.title = 'testing fractional inserts' ORDER BY position;\n PGresult* playlist_insert_test_res = addPlaylistToDatabase( conn, \"\", \"testing fractional inserts\", 0);\n char* playlist_id = PQgetvalue( playlist_insert_test_res, 0, 0 );\n PGresult* track_insert_res = appendTrackToPlaylist( conn, \"1\", playlist_id );\n char* association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp( association_id, \"1\") == 0 );\n track_insert_res = appendTrackToPlaylist( conn, \"2\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"4\", playlist_id );\n association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp(association_id, \"3\") == 0 );\n puts (\"appendTrackToPlaylist(...) works correctly!\");\n track_insert_res = addTrackToPlaylist( conn, \"3\", playlist_id, 2.5 );\n association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp(association_id, \"4\") == 0 );\n puts (\"addTrackToPlaylist(...) works correctly!\");\n PQclear( playlist_insert_test_res );\n PQclear( track_insert_res );\n}\n\n\/**\n * \\brief Test removeTrackFromPlaylist(...) assuming appendTrackToPlaylist works fine\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_removal(PGconn* conn) {\n \/\/ SELECT * FROM tracks_playlists Link LEFT JOIN playlists Playlist ON Link.playlist_id = Playlist.id WHERE Playlist.title = 'testing track removal' ORDER BY position;\n PGresult* playlist_insert_test_res = addPlaylistToDatabase( conn, \"\", \"testing track removal\", 0);\n char* playlist_id = PQgetvalue( playlist_insert_test_res, 0, 0 );\n PGresult* track_insert_res = appendTrackToPlaylist( conn, \"1\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"2\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"4\", playlist_id );\n char* track_playlist_id = PQgetvalue( track_insert_res, 0, 0 );\n track_insert_res = removeTrackFromPlaylist( conn, track_playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"3\", playlist_id );\n PQclear( playlist_insert_test_res );\n PQclear( track_insert_res );\n}\n<commit_msg>finished up another test<commit_after>\/**\n * \\file tests.cpp\n *\n * \\author Matt Hammerly\n *\/\n\n#include <postgresql\/libpq-fe.h>\n#include <string>\n#include <fstream>\n#include <stdio.h>\n#include <iostream>\n#include <curl\/curl.h>\n#include <plist\/plist++.h>\n#include <dirent.h>\n#include <sys\/types.h>\n#include <cctype>\n#include <cstring>\n#include <cassert>\n#include \"ma.h\"\n#include \"db.h\"\n#include \"tests.h\"\n\n\/**\n * \\brief Entry point into test program\n *\/\nint main() {\n\n PGconn* conn = connectToDatabase();\n\n dropTables(conn);\n\n createTables(conn);\n\n PList::Dictionary* library = openLibrary();\n\n \/\/ test caseSensitiveFilePath()\n test_caseSensitiveFilePath();\n\n \/\/ test adding track to database\n test_addTrackToDatabase(conn);\n\n \/\/ test adding playlist to database\n test_addPlaylistToDatabase(conn);\n\n \/\/ test fractional inserts into playlists\n test_track_inserts(conn);\n\n \/\/ test track removal from playlists\n test_removal(conn);\n\n puts( PQerrorMessage(conn) );\n\n return 0;\n}\n\n\/**\n * \\brief Test caseSensitiveFilePath() function\n *\/\nvoid test_caseSensitiveFilePath() {\n std::string new_library_path = \"\/home\/matt\/hdd\/dev\/yamm\/test_data\/\";\n std::string wrong = new_library_path + \"beirut\/THe Rip tiDe\/01 A candle's Fire.mp3\";\n std::string right = new_library_path + \"Beirut\/The Rip Tide\/01 A Candle's Fire.mp3\";\n\n assert( caseSensitiveFilePath(wrong) == right );\n puts( \"caseSensitiveFilePath() works correctly!\" );\n}\n\n\/**\n * \\brief Test addTrackToDatabase(...)\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_addTrackToDatabase(PGconn* conn) {\n std::string new_library_path = \"\/home\/matt\/hdd\/dev\/yamm\/test_data\/\";\n\n PGresult* res = addTrackToDatabase( conn, \"\", new_library_path + \"Beirut\/The Rip Tide\/01 A Candle's Fire.mp3\", 0 );\n char* track_id = PQgetvalue( res, 0, 0 );\n char const *expected_id = \"1\";\n\n assert ( strcmp(track_id, expected_id) == 0 );\n puts (\"addTrackToDatabase(...) works correctly!\" );\n\n PQclear(res);\n}\n\n\/**\n * \\brief Test addPlaylistToDatabase(...)\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_addPlaylistToDatabase(PGconn* conn) {\n PGresult* res = addPlaylistToDatabase( conn, \"\", \"Test Playlist\", 0 );\n char *playlist_id = PQgetvalue( res, 0, 0 );\n char const *expected_id = \"1\";\n\n assert( strcmp( playlist_id, expected_id) == 0 );\n puts (\"addPlaylistToDatabase(...) works correctly!\" );\n\n PQclear(res);\n}\n\n\/**\n * \\brief Test appendTrackToPlaylist(...) and addTrackToPlaylist(...) functions\n *\n * \\param conn Pointer to database connection struct\n *\n * Todo: check to make sure the fractional insert is ordered correctly\n *\/\nvoid test_track_inserts(PGconn* conn) {\n \/\/ SELECT * FROM tracks_playlists Link LEFT JOIN playlists Playlist ON Link.playlist_id = Playlist.id WHERE Playlist.title = 'testing fractional inserts' ORDER BY position;\n PGresult* playlist_insert_test_res = addPlaylistToDatabase( conn, \"\", \"testing fractional inserts\", 0);\n char* playlist_id = PQgetvalue( playlist_insert_test_res, 0, 0 );\n PGresult* track_insert_res = appendTrackToPlaylist( conn, \"1\", playlist_id );\n char* association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp( association_id, \"1\") == 0 );\n track_insert_res = appendTrackToPlaylist( conn, \"2\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"4\", playlist_id );\n association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp(association_id, \"3\") == 0 );\n puts (\"appendTrackToPlaylist(...) works correctly!\");\n track_insert_res = addTrackToPlaylist( conn, \"3\", playlist_id, 2.5 );\n association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp(association_id, \"4\") == 0 );\n puts (\"addTrackToPlaylist(...) works correctly!\");\n PQclear( playlist_insert_test_res );\n PQclear( track_insert_res );\n}\n\n\/**\n * \\brief Test removeTrackFromPlaylist(...) assuming appendTrackToPlaylist works fine\n *\n * \\param conn Pointer to database connection struct\n *\/\nvoid test_removal(PGconn* conn) {\n \/\/ SELECT * FROM tracks_playlists Link LEFT JOIN playlists Playlist ON Link.playlist_id = Playlist.id WHERE Playlist.title = 'testing track removal' ORDER BY position;\n PGresult* playlist_insert_test_res = addPlaylistToDatabase( conn, \"\", \"testing track removal\", 0);\n char* playlist_id = PQgetvalue( playlist_insert_test_res, 0, 0 );\n PGresult* track_insert_res = appendTrackToPlaylist( conn, \"1\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"2\", playlist_id );\n track_insert_res = appendTrackToPlaylist( conn, \"4\", playlist_id );\n char* association_id = PQgetvalue( track_insert_res, 0, 0 );\n track_insert_res = removeTrackFromPlaylist( conn, association_id );\n association_id = PQgetvalue( track_insert_res, 0, 0 );\n assert( strcmp(association_id, \"7\") == 0 );\n puts(\"removeTrackFromPlaylist(...) works correctly!\");\n track_insert_res = appendTrackToPlaylist( conn, \"3\", playlist_id );\n PQclear( playlist_insert_test_res );\n PQclear( track_insert_res );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013 Nicholas Corgan (n.corgan@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n\n#include <cstdlib>\n#include <fstream>\n#include <stdexcept>\n#include <cstdlib>\n#include <string>\n\n#include <boost\/filesystem.hpp>\n\n#include <pkmn\/paths.hpp>\n\n#include \"SQLiteCpp\/src\/SQLiteC++.h\"\n\nnamespace fs = boost::filesystem;\n\nnamespace pkmn\n{\n \/\/Get location of APPDATA\n std::string get_appdata_path()\n {\n \/\/Windows\n #ifdef _MSC_VER\n char* appdata_dir;\n size_t len;\n _dupenv_s(&appdata_dir, &len, \"APPDATA\");\n #else\n const char* appdata_dir = getenv(\"APPDATA\");\n #endif\n if(appdata_dir and fs::exists(fs::path(appdata_dir))) return std::string(appdata_dir);\n \n \/\/Linux\n #ifdef _MSC_VER\n _dupenv_s(&appdata_dir, &len, \"APPDATA\");\n #else\n appdata_dir = getenv(\"HOME\");\n #endif\n if(appdata_dir and fs::exists(fs::path(appdata_dir))) return std::string(appdata_dir);\n \n \/\/If it's gotten to this point, fall back to the temp directory\n return get_tmp_dir();\n }\n\n \/\/Get location of database\n std::string get_database_path()\n {\n #ifdef _MSC_VER\n char* database_dir;\n size_t len;\n _dupenv_s(&database_dir, &len, \"LIBPKMN_DATABASE_DIR\");\n #else\n const char* database_dir = getenv(\"LIBPKMN_DATABASE_DIR\"); \/\/Environment variable\n #endif\n if(database_dir == NULL) database_dir = \"@LIBPKMN_DATABASE_DIR@\"; \/\/CMake variable\n\n fs::path database_path = fs::path(database_dir) \/ \"libpkmn.db\";\n if(not fs::exists(database_path)) throw std::runtime_error(\"Could not find database!\");\n else\n {\n \/*\n * Use SQLiteCpp to check to see if database is valid.\n * The SQLite::Database constructor will throw an exception if\n * the given filename is not a valid SQLite database.\n *\/\n try {SQLite::Database db(database_path.string().c_str());}\n catch(std::exception &e) {return \":memory:\";}\n }\n\n return database_path.string();\n }\n \n \/\/Get images directory\n std::string get_images_dir()\n {\n #ifdef _MSC_VER\n char* images_dir;\n size_t len;\n _dupenv_s(&images_dir, &len, \"LIBPKMN_IMAGES_DIR\");\n #else\n const char* images_dir = getenv(\"LIBPKMN_IMAGES_DIR\"); \/\/Environment variable\n #endif\n if(images_dir == NULL) images_dir = \"@LIBPKMN_IMAGES_DIR@\"; \/\/CMake variable\n \n if(not fs::exists(fs::path(images_dir))) throw std::runtime_error(\"Could not find images directory!\");\n \n return std::string(images_dir);\n }\n\n \/\/Get path for system's temporary directory\n std::string get_tmp_dir()\n {\n #ifdef _MSC_VER\n char* tmp_dir;\n size_t len;\n _dupenv_s(&tmp_dir, &len, \"TMP\");\n #else\n const char* tmp_dir = getenv(\"TMP\");\n #endif\n\n if(tmp_dir and fs::exists(fs::path(tmp_dir))) return std::string(tmp_dir);\n else return \"\/tmp\";\n }\n} \/* namespace pkmn *\/\n<commit_msg>paths: removed duplicate code and removed Windows memory leaks<commit_after>\/*\n * Copyright (c) 2013-2014 Nicholas Corgan (n.corgan@gmail.com)\n *\n * Distributed under the MIT License (MIT) (See accompanying file LICENSE.txt\n * or copy at http:\/\/opensource.org\/licenses\/MIT)\n *\/\n\n#include <cstdlib>\n#include <fstream>\n#include <stdexcept>\n#include <cstdlib>\n#include <string>\n\n#include <boost\/filesystem.hpp>\n\n#include <pkmn\/paths.hpp>\n\n#include \"SQLiteCpp\/src\/SQLiteC++.h\"\n\nnamespace fs = boost::filesystem;\n\nnamespace pkmn\n{\n static std::string _getenv(const char* var)\n {\n std::string value;\n\n #ifdef PKMN_PLATFORM_WIN32\n char* arr;\n size_t len;\n _dupenv_s(&arr, &len, var);\n if(!arr) return std::string(\"\");\n else\n {\n value = std::string(arr);\n free(arr);\n return value;\n }\n #else\n const char* arr = getenv(var);\n return (arr) ? std::string(arr) : std::string(\"\");\n #endif\n }\n\n \/\/Get location of APPDATA\n std::string get_appdata_path()\n {\n #ifdef PKMN_PLATFORM_WIN32\n std::string appdata = _getenv(\"APPDATA\");\n if(appdata != \"\" and fs::exists(fs::path(appdata))) return appdata;\n #else\n std::string home = _getenv(\"HOME\");\n if(home != \"\" and fs::exists(fs::path(home))) return home;\n #endif\n\n \/\/It should never get to this point, this is a last resort\n return get_tmp_dir();\n }\n\n \/\/Get location of database\n std::string get_database_path()\n {\n std::string database_dir = _getenv(\"LIBPKMN_DATABASE_DIR\");\n if(database_dir == \"\") database_dir = \"@LIBPKMN_DATABASE_DIR@\"; \/\/Generated by CMake\n\n \/\/At this point, we should have a database directory, so throw an error otherwise\n if(database_dir == \"\") throw std::runtime_error(\"Could not find database!\");\n\n fs::path database_path = fs::path(database_dir) \/ \"libpkmn.db\";\n if(fs::exists(database_path)) return database_path.string();\n else throw std::runtime_error(\"Could not find database!\");\n }\n \n \/\/Get images directory\n std::string get_images_dir()\n {\n std::string images_dir = _getenv(\"LIBPKMN_IMAGES_DIR\");\n if(images_dir == \"\") images_dir = \"@LIBPKMN_IMAGES_DIR@\";\n\n \/\/At this point, we should have an images directory, so throw an error otherwise\n if(images_dir == \"\" or not fs::exists(fs::path(images_dir)))\n throw std::runtime_error(\"Could not find images directory!\");\n else return images_dir;\n }\n\n \/\/Get path for system's temporary directory\n std::string get_tmp_dir()\n {\n std::string tmp = _getenv(\"TMP\");\n return (tmp != \"\" and fs::exists(fs::path(tmp))) ? tmp : \"\/tmp\";\n }\n} \/* namespace pkmn *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ PelotonDB\n\/\/\n\/\/ materialization_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/materialization_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"backend\/executor\/materialization_executor.h\"\n\n#include <cassert>\n#include <memory>\n#include <utility>\n\n#include \"backend\/planner\/materialization_plan.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/data_table.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/\/ Row-oriented materialization\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/\/ Column-oriented materialization\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n const planner::AbstractPlan *node, ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DInit() {\n assert(children_.size() == 1);\n\n return true;\n}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n * base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n * base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns tile by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n LogicalTile *source_tile,\n std::unordered_map<storage::Tile *, std::vector<oid_t>> &\n cols_in_physical_tile) {\n for (const auto &kv : old_to_new_cols) {\n oid_t col = kv.first;\n\n \/\/ figure out base physical tile for column in logical tile\n storage::Tile *base_tile = source_tile->GetBaseTile(col);\n\n std::vector<oid_t> &cols_from_tile = cols_in_physical_tile[base_tile];\n cols_from_tile.push_back(col);\n }\n}\n\n\/**\n * @brief Does the actual copying of data into the new physical tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n * to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n auto dest_tile_column_count = dest_tile->GetColumnCount();\n \/\/ TODO: Make this a parameter\n oid_t column_count_threshold = 20;\n bool row_wise_materialization = true;\n\n if(peloton_layout == LAYOUT_HYBRID &&\n dest_tile_column_count < column_count_threshold)\n row_wise_materialization = false;\n\n \/\/ Materialize as needed\n if(row_wise_materialization == true) {\n MaterializeRowAtAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n else {\n MaterializeColumnAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n\n}\n\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n auto &schema = source_tile->GetSchema();\n oid_t new_tuple_id = 0;\n\n auto& column_position_lists = source_tile->GetPositionLists();\n\n \/\/ Get old column information\n std::vector<oid_t> old_column_position_idxs;\n std::vector<size_t> old_column_offsets;\n std::vector<ValueType> old_column_types;\n std::vector<bool> old_is_inlineds;\n std::vector<storage::Tile*> old_tiles;\n\n \/\/ Get new column information\n std::vector<size_t> new_column_offsets;\n std::vector<bool> new_is_inlineds;\n std::vector<size_t> new_column_lengths;\n\n \/\/ Amortize schema lookups once per column\n for (oid_t old_col_id : old_column_ids) {\n auto& column_info = schema[old_col_id];\n\n \/\/ Get the position list\n old_column_position_idxs.push_back(column_info.position_list_idx);\n\n \/\/ Get old column information\n storage::Tile *old_tile = column_info.base_tile;\n old_tiles.push_back(old_tile);\n auto old_schema = old_tile->GetSchema();\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n old_column_offsets.push_back(old_column_offset);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n old_column_types.push_back(old_column_type);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n old_is_inlineds.push_back(old_is_inlined);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n new_column_offsets.push_back(new_column_offset);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n new_is_inlineds.push_back(new_is_inlined);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n new_column_lengths.push_back(new_column_length);\n }\n\n assert(new_column_offsets.size() == old_column_ids.size());\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy all values in the tuple to the physical tile\n \/\/ This uses fast getter and setter functions\n for (oid_t old_tuple_id : *source_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n oid_t col_itr = 0;\n\n for (oid_t old_col_id : old_column_position_idxs) {\n\n auto& column_position_list = column_position_lists[old_col_id];\n\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n\n auto value = old_tiles[col_itr]->GetValueFast(base_tuple_id,\n old_column_offsets[col_itr],\n old_column_types[col_itr],\n old_is_inlineds[col_itr]);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offsets[col_itr],\n new_is_inlineds[col_itr],\n new_column_lengths[col_itr]);\n\n \/\/ Go to next column\n col_itr++;\n }\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n}\n\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n for (oid_t old_col_id : old_column_ids) {\n auto &column_info = source_tile->GetColumnInfo(old_col_id);\n\n \/\/ Amortize schema lookups once per column\n storage::Tile *old_tile = column_info.base_tile;\n auto old_schema = old_tile->GetSchema();\n\n \/\/ Get old column information\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n\n \/\/ Get the position list\n auto& column_position_list = source_tile->GetPositionList(column_info.position_list_idx);\n oid_t new_tuple_id = 0;\n\n \/\/ Copy all values in the column to the physical tile\n \/\/ This uses fast getter and setter functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (oid_t old_tuple_id : *source_tile) {\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n auto value = old_tile->GetValueFast(base_tuple_id,\n old_column_offset,\n old_column_type,\n old_is_inlined);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offset,\n new_is_inlined,\n new_column_length);\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n }\n\n}\n\nstd::unordered_map<oid_t, oid_t> MaterializationExecutor::BuildIdentityMapping(\n const catalog::Schema *schema) {\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n oid_t column_count = schema->GetColumnCount();\n for (oid_t col = 0; col < column_count; col++) {\n old_to_new_cols[col] = col;\n }\n\n return old_to_new_cols;\n}\n\n\/**\n * @brief Create a physical tile for the given logical tile\n * @param source_tile Source tile from which the physical tile is created\n * @return a logical tile wrapper for the created physical tile\n *\/\nLogicalTile *MaterializationExecutor::Physify(LogicalTile *source_tile) {\n std::unique_ptr<catalog::Schema> source_tile_schema(\n source_tile->GetPhysicalSchema());\n const int num_tuples = source_tile->GetTupleCount();\n const catalog::Schema *output_schema;\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n auto node = GetRawNode();\n\n \/\/ Create a default identity mapping node if we did not get one\n if (node == nullptr) {\n assert(source_tile_schema.get());\n output_schema = source_tile_schema.get();\n\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n \/\/ Else use the mapping in the given plan node\n else {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n if (node.GetSchema()) {\n output_schema = node.GetSchema();\n old_to_new_cols = node.old_to_new_cols();\n } else {\n output_schema = source_tile_schema.get();\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n }\n\n \/\/ Generate mappings.\n std::unordered_map<storage::Tile *, std::vector<oid_t>> tile_to_cols;\n GenerateTileToColMap(old_to_new_cols, source_tile, tile_to_cols);\n\n \/\/ Create new physical tile.\n std::unique_ptr<storage::Tile> dest_tile(\n storage::TileFactory::GetTempTile(*output_schema, num_tuples));\n\n \/\/ Proceed to materialize logical tile by physical tile at a time.\n MaterializeByTiles(source_tile, old_to_new_cols, tile_to_cols,\n dest_tile.get());\n\n \/\/ Wrap physical tile in logical tile.\n return LogicalTileFactory::WrapTiles({dest_tile.release()});\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n * in a new logical tile.\n *\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DExecute() {\n \/\/ Retrieve child tile.\n const bool success = children_[0]->Execute();\n if (!success) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> source_tile(children_[0]->GetOutput());\n LogicalTile *output_tile = nullptr;\n\n \/\/ Check the number of tuples in input logical tile\n \/\/ If none, then just return false\n const int num_tuples = source_tile->GetTupleCount();\n if (num_tuples == 0) {\n return false;\n }\n\n auto node = GetRawNode();\n bool physify_flag = true; \/\/ by default, we create a physical tile\n\n if (node != nullptr) {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n physify_flag = node.GetPhysifyFlag();\n }\n\n if (physify_flag) {\n \/* create a physical tile and a logical tile wrapper to be the output *\/\n output_tile = Physify(source_tile.get());\n } else {\n \/* just pass thru the underlying logical tile *\/\n output_tile = source_tile.release();\n }\n\n SetOutput(output_tile);\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<commit_msg>Restore mat<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ PelotonDB\n\/\/\n\/\/ materialization_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/materialization_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"backend\/executor\/materialization_executor.h\"\n\n#include <cassert>\n#include <memory>\n#include <utility>\n\n#include \"backend\/planner\/materialization_plan.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/data_table.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/\/ Row-oriented materialization\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/\/ Column-oriented materialization\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n const planner::AbstractPlan *node, ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DInit() {\n assert(children_.size() == 1);\n\n return true;\n}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n * base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n * base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns tile by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n LogicalTile *source_tile,\n std::unordered_map<storage::Tile *, std::vector<oid_t>> &\n cols_in_physical_tile) {\n for (const auto &kv : old_to_new_cols) {\n oid_t col = kv.first;\n\n \/\/ figure out base physical tile for column in logical tile\n storage::Tile *base_tile = source_tile->GetBaseTile(col);\n\n std::vector<oid_t> &cols_from_tile = cols_in_physical_tile[base_tile];\n cols_from_tile.push_back(col);\n }\n}\n\n\/**\n * @brief Does the actual copying of data into the new physical tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n * to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n auto dest_tile_column_count = dest_tile->GetColumnCount();\n \/\/ TODO: Make this a parameter\n oid_t column_count_threshold = 20;\n bool row_wise_materialization = true;\n\n if(peloton_layout == LAYOUT_COLUMN)\n row_wise_materialization = false;\n\n if(peloton_layout == LAYOUT_HYBRID &&\n dest_tile_column_count < column_count_threshold)\n row_wise_materialization = false;\n\n \/\/ Materialize as needed\n if(row_wise_materialization == true) {\n MaterializeRowAtAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n else {\n MaterializeColumnAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n\n}\n\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n auto &schema = source_tile->GetSchema();\n oid_t new_tuple_id = 0;\n\n auto& column_position_lists = source_tile->GetPositionLists();\n\n \/\/ Get old column information\n std::vector<oid_t> old_column_position_idxs;\n std::vector<size_t> old_column_offsets;\n std::vector<ValueType> old_column_types;\n std::vector<bool> old_is_inlineds;\n std::vector<storage::Tile*> old_tiles;\n\n \/\/ Get new column information\n std::vector<size_t> new_column_offsets;\n std::vector<bool> new_is_inlineds;\n std::vector<size_t> new_column_lengths;\n\n \/\/ Amortize schema lookups once per column\n for (oid_t old_col_id : old_column_ids) {\n auto& column_info = schema[old_col_id];\n\n \/\/ Get the position list\n old_column_position_idxs.push_back(column_info.position_list_idx);\n\n \/\/ Get old column information\n storage::Tile *old_tile = column_info.base_tile;\n old_tiles.push_back(old_tile);\n auto old_schema = old_tile->GetSchema();\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n old_column_offsets.push_back(old_column_offset);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n old_column_types.push_back(old_column_type);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n old_is_inlineds.push_back(old_is_inlined);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n new_column_offsets.push_back(new_column_offset);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n new_is_inlineds.push_back(new_is_inlined);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n new_column_lengths.push_back(new_column_length);\n }\n\n assert(new_column_offsets.size() == old_column_ids.size());\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy all values in the tuple to the physical tile\n \/\/ This uses fast getter and setter functions\n for (oid_t old_tuple_id : *source_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n oid_t col_itr = 0;\n\n for (oid_t old_col_id : old_column_position_idxs) {\n\n auto& column_position_list = column_position_lists[old_col_id];\n\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n\n auto value = old_tiles[col_itr]->GetValueFast(base_tuple_id,\n old_column_offsets[col_itr],\n old_column_types[col_itr],\n old_is_inlineds[col_itr]);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offsets[col_itr],\n new_is_inlineds[col_itr],\n new_column_lengths[col_itr]);\n\n \/\/ Go to next column\n col_itr++;\n }\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n}\n\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n for (oid_t old_col_id : old_column_ids) {\n auto &column_info = source_tile->GetColumnInfo(old_col_id);\n\n \/\/ Amortize schema lookups once per column\n storage::Tile *old_tile = column_info.base_tile;\n auto old_schema = old_tile->GetSchema();\n\n \/\/ Get old column information\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n\n \/\/ Get the position list\n auto& column_position_list = source_tile->GetPositionList(column_info.position_list_idx);\n oid_t new_tuple_id = 0;\n\n \/\/ Copy all values in the column to the physical tile\n \/\/ This uses fast getter and setter functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (oid_t old_tuple_id : *source_tile) {\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n auto value = old_tile->GetValueFast(base_tuple_id,\n old_column_offset,\n old_column_type,\n old_is_inlined);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offset,\n new_is_inlined,\n new_column_length);\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n }\n\n}\n\nstd::unordered_map<oid_t, oid_t> MaterializationExecutor::BuildIdentityMapping(\n const catalog::Schema *schema) {\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n oid_t column_count = schema->GetColumnCount();\n for (oid_t col = 0; col < column_count; col++) {\n old_to_new_cols[col] = col;\n }\n\n return old_to_new_cols;\n}\n\n\/**\n * @brief Create a physical tile for the given logical tile\n * @param source_tile Source tile from which the physical tile is created\n * @return a logical tile wrapper for the created physical tile\n *\/\nLogicalTile *MaterializationExecutor::Physify(LogicalTile *source_tile) {\n std::unique_ptr<catalog::Schema> source_tile_schema(\n source_tile->GetPhysicalSchema());\n const int num_tuples = source_tile->GetTupleCount();\n const catalog::Schema *output_schema;\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n auto node = GetRawNode();\n\n \/\/ Create a default identity mapping node if we did not get one\n if (node == nullptr) {\n assert(source_tile_schema.get());\n output_schema = source_tile_schema.get();\n\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n \/\/ Else use the mapping in the given plan node\n else {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n if (node.GetSchema()) {\n output_schema = node.GetSchema();\n old_to_new_cols = node.old_to_new_cols();\n } else {\n output_schema = source_tile_schema.get();\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n }\n\n \/\/ Generate mappings.\n std::unordered_map<storage::Tile *, std::vector<oid_t>> tile_to_cols;\n GenerateTileToColMap(old_to_new_cols, source_tile, tile_to_cols);\n\n \/\/ Create new physical tile.\n std::unique_ptr<storage::Tile> dest_tile(\n storage::TileFactory::GetTempTile(*output_schema, num_tuples));\n\n \/\/ Proceed to materialize logical tile by physical tile at a time.\n MaterializeByTiles(source_tile, old_to_new_cols, tile_to_cols,\n dest_tile.get());\n\n \/\/ Wrap physical tile in logical tile.\n return LogicalTileFactory::WrapTiles({dest_tile.release()});\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n * in a new logical tile.\n *\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DExecute() {\n \/\/ Retrieve child tile.\n const bool success = children_[0]->Execute();\n if (!success) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> source_tile(children_[0]->GetOutput());\n LogicalTile *output_tile = nullptr;\n\n \/\/ Check the number of tuples in input logical tile\n \/\/ If none, then just return false\n const int num_tuples = source_tile->GetTupleCount();\n if (num_tuples == 0) {\n return false;\n }\n\n auto node = GetRawNode();\n bool physify_flag = true; \/\/ by default, we create a physical tile\n\n if (node != nullptr) {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n physify_flag = node.GetPhysifyFlag();\n }\n\n if (physify_flag) {\n \/* create a physical tile and a logical tile wrapper to be the output *\/\n output_tile = Physify(source_tile.get());\n } else {\n \/* just pass thru the underlying logical tile *\/\n output_tile = source_tile.release();\n }\n\n SetOutput(output_tile);\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"<commit_before>\n#ifndef __BUFFER_CACHE_WRITEBACK_HPP__\n#define __BUFFER_CACHE_WRITEBACK_HPP__\n\n#include \"concurrency\/rwi_lock.hpp\"\n#include \"utils.hpp\"\n\ntemplate<class mc_config_t>\nstruct writeback_tmpl_t :\n public lock_available_callback_t,\n public mc_config_t::serializer_t::write_txn_callback_t\n{\n typedef mc_cache_t<mc_config_t> cache_t;\n typedef mc_buf_t<mc_config_t> buf_t;\n typedef mc_transaction_t<mc_config_t> transaction_t;\n typedef mc_transaction_begin_callback_t<mc_config_t> transaction_begin_callback_t;\n typedef mc_transaction_commit_callback_t<mc_config_t> transaction_commit_callback_t;\n \npublic:\n writeback_tmpl_t(\n cache_t *cache,\n bool wait_for_flush,\n unsigned int flush_timer_ms,\n unsigned int flush_threshold);\n virtual ~writeback_tmpl_t();\n \n struct sync_callback_t : public intrusive_list_node_t<sync_callback_t> {\n virtual ~sync_callback_t() {}\n virtual void on_sync() = 0;\n };\n \n void start();\n \n \/* Forces a writeback to happen soon. If there is nothing to write, return 'true'; otherwise,\n returns 'false' and calls 'callback' as soon as the next writeback cycle is over. *\/\n bool sync(sync_callback_t *callback);\n \n \/* Same as sync(), but doesn't hurry up the writeback in any way. *\/\n bool sync_patiently(sync_callback_t *callback);\n\n bool begin_transaction(transaction_t *txn, transaction_begin_callback_t *cb);\n void on_transaction_commit(transaction_t *txn);\n \n \/\/ This is called by buf_t when the OS informs the buf that a write operation completed\n void buf_was_written(buf_t *buf);\n \n unsigned int num_dirty_blocks();\n \n class local_buf_t : public intrusive_list_node_t<local_buf_t> {\n \n friend class writeback_tmpl_t;\n \n public:\n explicit local_buf_t(buf_t *gbuf)\n : gbuf(gbuf), dirty(false) {}\n \n void set_dirty(bool _dirty = true);\n \n bool safe_to_unload() const { return !dirty; }\n\n private:\n buf_t *gbuf;\n#ifndef NDEBUG\n public:\n#endif\n bool dirty;\n };\n \n \/* User-controlled settings. *\/\n \n bool wait_for_flush;\n int flush_timer_ms;\n unsigned int flush_threshold; \/\/ Number of blocks, not percentage\n \nprivate: \n \/\/ The writeback system has a mechanism to keep data safe if the server crashes. If modified\n \/\/ data sits in memory for longer than flush_timer_ms milliseconds, a writeback will be\n \/\/ automatically started to store it on disk. flush_timer is the timer to keep track of how\n \/\/ much longer the data can sit in memory.\n event_queue_t::timer_t *flush_timer;\n static void flush_timer_callback(void *ctx);\n\n virtual void on_lock_available();\n void on_serializer_write_txn();\n \n \/\/ Start or continue a writeback. Should only be called by the writeback itself. Returns 'true'\n \/\/ if the writeback completes, or 'false' if it is waiting for something and will complete\n \/\/ later.\n bool next_writeback_step();\n \n \/* Internal variables used at all times. *\/\n \n enum state_t {\n state_unstarted,\n state_ready,\n state_locking,\n state_locked,\n state_write_bufs,\n state_cleanup\n } state;\n \n cache_t *cache;\n\n \/* The flush lock is necessary because if we acquire dirty blocks\n * in random order during the flush, there might be a deadlock\n * with set_fsm. When the flush is initiated, the flush_lock is\n * grabbed, all write transactions are drained, and no new write transactions\n * are allowed in the meantime. Once all transactions are drained,\n * the writeback code locks all dirty blocks for reading and\n * releases the flush lock. *\/\n \n \/* Note that the write transactions lock the flush lock for reading, because there can be more\n than one write transaction proceeding at the same time (not on the same bufs, but the bufs'\n locks will take care of that) while the writeback locks the flush lock for writing, because it\n must exclude all of the transactions.\n *\/\n \n rwi_lock_t *flush_lock;\n \n \/\/ List of things waiting for their data to be written to disk. They will be called back after\n \/\/ the next complete writeback cycle completes.\n intrusive_list_t<sync_callback_t> sync_callbacks;\n \n \/\/ If something requests a sync but a sync is already in progress, then\n \/\/ start_next_sync_immediately is set so that a new sync operation is started as soon as the\n \/\/ old one finishes. Note that start_next_sync_immediately being true is not equivalent to\n \/\/ sync_callbacks being nonempty, because when wait_for_flush is set, transactions will sit\n \/\/ patiently in sync_callbacks without setting start_next_sync_immediately.\n bool start_next_sync_immediately;\n \n \/\/ List of bufs that are currenty dirty\n intrusive_list_t<local_buf_t> dirty_bufs;\n\n \/* Internal variables used only during a flush operation. *\/\n \n \/\/ Transaction that the writeback is using to grab buffers\n transaction_t *transaction;\n \n \/\/ List of things to call back as soon as the writeback currently in progress is over.\n intrusive_list_t<sync_callback_t> current_sync_callbacks;\n};\n\n#include \"writeback.tcc\"\n\n#endif \/\/ __BUFFER_CACHE_WRITEBACK_HPP__\n\n<commit_msg>Fix compiling in release mode *sheepish look.<commit_after>\n#ifndef __BUFFER_CACHE_WRITEBACK_HPP__\n#define __BUFFER_CACHE_WRITEBACK_HPP__\n\n#include \"concurrency\/rwi_lock.hpp\"\n#include \"utils.hpp\"\n\ntemplate<class mc_config_t>\nstruct writeback_tmpl_t :\n public lock_available_callback_t,\n public mc_config_t::serializer_t::write_txn_callback_t\n{\n typedef mc_cache_t<mc_config_t> cache_t;\n typedef mc_buf_t<mc_config_t> buf_t;\n typedef mc_transaction_t<mc_config_t> transaction_t;\n typedef mc_transaction_begin_callback_t<mc_config_t> transaction_begin_callback_t;\n typedef mc_transaction_commit_callback_t<mc_config_t> transaction_commit_callback_t;\n \npublic:\n writeback_tmpl_t(\n cache_t *cache,\n bool wait_for_flush,\n unsigned int flush_timer_ms,\n unsigned int flush_threshold);\n virtual ~writeback_tmpl_t();\n \n struct sync_callback_t : public intrusive_list_node_t<sync_callback_t> {\n virtual ~sync_callback_t() {}\n virtual void on_sync() = 0;\n };\n \n void start();\n \n \/* Forces a writeback to happen soon. If there is nothing to write, return 'true'; otherwise,\n returns 'false' and calls 'callback' as soon as the next writeback cycle is over. *\/\n bool sync(sync_callback_t *callback);\n \n \/* Same as sync(), but doesn't hurry up the writeback in any way. *\/\n bool sync_patiently(sync_callback_t *callback);\n\n bool begin_transaction(transaction_t *txn, transaction_begin_callback_t *cb);\n void on_transaction_commit(transaction_t *txn);\n \n \/\/ This is called by buf_t when the OS informs the buf that a write operation completed\n void buf_was_written(buf_t *buf);\n \n unsigned int num_dirty_blocks();\n \n class local_buf_t : public intrusive_list_node_t<local_buf_t> {\n \n friend class writeback_tmpl_t;\n \n public:\n explicit local_buf_t(buf_t *gbuf)\n : gbuf(gbuf), dirty(false) {}\n \n void set_dirty(bool _dirty = true);\n \n bool safe_to_unload() const { return !dirty; }\n\n private:\n buf_t *gbuf;\n public: \/\/TODO make this private again @jdoliner\n bool dirty;\n };\n \n \/* User-controlled settings. *\/\n \n bool wait_for_flush;\n int flush_timer_ms;\n unsigned int flush_threshold; \/\/ Number of blocks, not percentage\n \nprivate: \n \/\/ The writeback system has a mechanism to keep data safe if the server crashes. If modified\n \/\/ data sits in memory for longer than flush_timer_ms milliseconds, a writeback will be\n \/\/ automatically started to store it on disk. flush_timer is the timer to keep track of how\n \/\/ much longer the data can sit in memory.\n event_queue_t::timer_t *flush_timer;\n static void flush_timer_callback(void *ctx);\n\n virtual void on_lock_available();\n void on_serializer_write_txn();\n \n \/\/ Start or continue a writeback. Should only be called by the writeback itself. Returns 'true'\n \/\/ if the writeback completes, or 'false' if it is waiting for something and will complete\n \/\/ later.\n bool next_writeback_step();\n \n \/* Internal variables used at all times. *\/\n \n enum state_t {\n state_unstarted,\n state_ready,\n state_locking,\n state_locked,\n state_write_bufs,\n state_cleanup\n } state;\n \n cache_t *cache;\n\n \/* The flush lock is necessary because if we acquire dirty blocks\n * in random order during the flush, there might be a deadlock\n * with set_fsm. When the flush is initiated, the flush_lock is\n * grabbed, all write transactions are drained, and no new write transactions\n * are allowed in the meantime. Once all transactions are drained,\n * the writeback code locks all dirty blocks for reading and\n * releases the flush lock. *\/\n \n \/* Note that the write transactions lock the flush lock for reading, because there can be more\n than one write transaction proceeding at the same time (not on the same bufs, but the bufs'\n locks will take care of that) while the writeback locks the flush lock for writing, because it\n must exclude all of the transactions.\n *\/\n \n rwi_lock_t *flush_lock;\n \n \/\/ List of things waiting for their data to be written to disk. They will be called back after\n \/\/ the next complete writeback cycle completes.\n intrusive_list_t<sync_callback_t> sync_callbacks;\n \n \/\/ If something requests a sync but a sync is already in progress, then\n \/\/ start_next_sync_immediately is set so that a new sync operation is started as soon as the\n \/\/ old one finishes. Note that start_next_sync_immediately being true is not equivalent to\n \/\/ sync_callbacks being nonempty, because when wait_for_flush is set, transactions will sit\n \/\/ patiently in sync_callbacks without setting start_next_sync_immediately.\n bool start_next_sync_immediately;\n \n \/\/ List of bufs that are currenty dirty\n intrusive_list_t<local_buf_t> dirty_bufs;\n\n \/* Internal variables used only during a flush operation. *\/\n \n \/\/ Transaction that the writeback is using to grab buffers\n transaction_t *transaction;\n \n \/\/ List of things to call back as soon as the writeback currently in progress is over.\n intrusive_list_t<sync_callback_t> current_sync_callbacks;\n};\n\n#include \"writeback.tcc\"\n\n#endif \/\/ __BUFFER_CACHE_WRITEBACK_HPP__\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/autofill\/autofill_download.h\"\n\n#include <algorithm>\n#include <ostream>\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"base\/rand_util.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/autofill\/autofill_metrics.h\"\n#include \"chrome\/browser\/autofill\/autofill_xml_parser.h\"\n#include \"chrome\/browser\/autofill\/form_structure.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/common\/url_fetcher.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"third_party\/libjingle\/source\/talk\/xmllite\/xmlparser.h\"\n\nnamespace {\nconst char kAutofillQueryServerRequestUrl[] =\n \"https:\/\/toolbarqueries.google.com\/tbproxy\/af\/query\";\nconst char kAutofillUploadServerRequestUrl[] =\n \"https:\/\/toolbarqueries.google.com\/tbproxy\/af\/upload\";\nconst char kAutofillQueryServerNameStartInHeader[] = \"GFE\/\";\n\nconst size_t kMaxFormCacheSize = 16;\n};\n\nstruct AutofillDownloadManager::FormRequestData {\n std::vector<std::string> form_signatures;\n AutofillRequestType request_type;\n};\n\nAutofillDownloadManager::AutofillDownloadManager(Profile* profile,\n Observer* observer)\n : profile_(profile),\n observer_(observer),\n max_form_cache_size_(kMaxFormCacheSize),\n next_query_request_(base::Time::Now()),\n next_upload_request_(base::Time::Now()),\n positive_upload_rate_(0),\n negative_upload_rate_(0),\n fetcher_id_for_unittest_(0) {\n DCHECK(observer_);\n PrefService* preferences = profile_->GetPrefs();\n positive_upload_rate_ =\n preferences->GetDouble(prefs::kAutofillPositiveUploadRate);\n negative_upload_rate_ =\n preferences->GetDouble(prefs::kAutofillNegativeUploadRate);\n}\n\nAutofillDownloadManager::~AutofillDownloadManager() {\n STLDeleteContainerPairFirstPointers(url_fetchers_.begin(),\n url_fetchers_.end());\n}\n\nbool AutofillDownloadManager::StartQueryRequest(\n const std::vector<FormStructure*>& forms,\n const AutofillMetrics& metric_logger) {\n if (next_query_request_ > base::Time::Now()) {\n \/\/ We are in back-off mode: do not do the request.\n return false;\n }\n std::string form_xml;\n FormRequestData request_data;\n if (!FormStructure::EncodeQueryRequest(forms, &request_data.form_signatures,\n &form_xml)) {\n return false;\n }\n\n request_data.request_type = AutofillDownloadManager::REQUEST_QUERY;\n metric_logger.LogServerQueryMetric(AutofillMetrics::QUERY_SENT);\n\n std::string query_data;\n if (CheckCacheForQueryRequest(request_data.form_signatures, &query_data)) {\n DVLOG(1) << \"AutofillDownloadManager: query request has been retrieved from\"\n << \"the cache\";\n observer_->OnLoadedServerPredictions(query_data);\n return true;\n }\n\n return StartRequest(form_xml, request_data);\n}\n\nbool AutofillDownloadManager::StartUploadRequest(\n const FormStructure& form,\n bool form_was_autofilled,\n const FieldTypeSet& available_field_types) {\n if (next_upload_request_ > base::Time::Now()) {\n \/\/ We are in back-off mode: do not do the request.\n DVLOG(1) << \"AutofillDownloadManager: Upload request is throttled.\";\n return false;\n }\n\n \/\/ Flip a coin to see if we should upload this form.\n double upload_rate = form_was_autofilled ? GetPositiveUploadRate() :\n GetNegativeUploadRate();\n if (form.upload_required() == UPLOAD_NOT_REQUIRED ||\n (form.upload_required() == USE_UPLOAD_RATES &&\n base::RandDouble() > upload_rate)) {\n DVLOG(1) << \"AutofillDownloadManager: Upload request is ignored.\";\n \/\/ If we ever need notification that upload was skipped, add it here.\n return false;\n }\n\n std::string form_xml;\n if (!form.EncodeUploadRequest(available_field_types, form_was_autofilled,\n &form_xml))\n return false;\n\n FormRequestData request_data;\n request_data.form_signatures.push_back(form.FormSignature());\n request_data.request_type = AutofillDownloadManager::REQUEST_UPLOAD;\n\n return StartRequest(form_xml, request_data);\n}\n\ndouble AutofillDownloadManager::GetPositiveUploadRate() const {\n return positive_upload_rate_;\n}\n\ndouble AutofillDownloadManager::GetNegativeUploadRate() const {\n return negative_upload_rate_;\n}\n\nvoid AutofillDownloadManager::SetPositiveUploadRate(double rate) {\n if (rate == positive_upload_rate_)\n return;\n positive_upload_rate_ = rate;\n DCHECK_GE(rate, 0.0);\n DCHECK_LE(rate, 1.0);\n PrefService* preferences = profile_->GetPrefs();\n preferences->SetDouble(prefs::kAutofillPositiveUploadRate, rate);\n}\n\nvoid AutofillDownloadManager::SetNegativeUploadRate(double rate) {\n if (rate == negative_upload_rate_)\n return;\n negative_upload_rate_ = rate;\n DCHECK_GE(rate, 0.0);\n DCHECK_LE(rate, 1.0);\n PrefService* preferences = profile_->GetPrefs();\n preferences->SetDouble(prefs::kAutofillNegativeUploadRate, rate);\n}\n\nbool AutofillDownloadManager::StartRequest(\n const std::string& form_xml,\n const FormRequestData& request_data) {\n net::URLRequestContextGetter* request_context = profile_->GetRequestContext();\n DCHECK(request_context);\n std::string request_url;\n if (request_data.request_type == AutofillDownloadManager::REQUEST_QUERY)\n request_url = kAutofillQueryServerRequestUrl;\n else\n request_url = kAutofillUploadServerRequestUrl;\n\n \/\/ Id is ignored for regular chrome, in unit test id's for fake fetcher\n \/\/ factory will be 0, 1, 2, ...\n content::URLFetcher* fetcher = content::URLFetcher::Create(\n fetcher_id_for_unittest_++, GURL(request_url), content::URLFetcher::POST,\n this);\n url_fetchers_[fetcher] = request_data;\n fetcher->SetAutomaticallyRetryOn5xx(false);\n fetcher->SetRequestContext(request_context);\n fetcher->SetUploadData(\"text\/plain\", form_xml);\n fetcher->Start();\n return true;\n}\n\nvoid AutofillDownloadManager::CacheQueryRequest(\n const std::vector<std::string>& forms_in_query,\n const std::string& query_data) {\n std::string signature = GetCombinedSignature(forms_in_query);\n for (QueryRequestCache::iterator it = cached_forms_.begin();\n it != cached_forms_.end(); ++it) {\n if (it->first == signature) {\n \/\/ We hit the cache, move to the first position and return.\n std::pair<std::string, std::string> data = *it;\n cached_forms_.erase(it);\n cached_forms_.push_front(data);\n return;\n }\n }\n std::pair<std::string, std::string> data;\n data.first = signature;\n data.second = query_data;\n cached_forms_.push_front(data);\n while (cached_forms_.size() > max_form_cache_size_)\n cached_forms_.pop_back();\n}\n\nbool AutofillDownloadManager::CheckCacheForQueryRequest(\n const std::vector<std::string>& forms_in_query,\n std::string* query_data) const {\n std::string signature = GetCombinedSignature(forms_in_query);\n for (QueryRequestCache::const_iterator it = cached_forms_.begin();\n it != cached_forms_.end(); ++it) {\n if (it->first == signature) {\n \/\/ We hit the cache, fill the data and return.\n *query_data = it->second;\n return true;\n }\n }\n return false;\n}\n\nstd::string AutofillDownloadManager::GetCombinedSignature(\n const std::vector<std::string>& forms_in_query) const {\n size_t total_size = forms_in_query.size();\n for (size_t i = 0; i < forms_in_query.size(); ++i)\n total_size += forms_in_query[i].length();\n std::string signature;\n\n signature.reserve(total_size);\n\n for (size_t i = 0; i < forms_in_query.size(); ++i) {\n if (i)\n signature.append(\",\");\n signature.append(forms_in_query[i]);\n }\n return signature;\n}\n\nvoid AutofillDownloadManager::OnURLFetchComplete(\n const content::URLFetcher* source) {\n std::map<content::URLFetcher *, FormRequestData>::iterator it =\n url_fetchers_.find(const_cast<content::URLFetcher*>(source));\n if (it == url_fetchers_.end()) {\n \/\/ Looks like crash on Mac is possibly caused with callback entering here\n \/\/ with unknown fetcher when network is refreshed.\n return;\n }\n std::string type_of_request(\n it->second.request_type == AutofillDownloadManager::REQUEST_QUERY ?\n \"query\" : \"upload\");\n const int kHttpResponseOk = 200;\n const int kHttpInternalServerError = 500;\n const int kHttpBadGateway = 502;\n const int kHttpServiceUnavailable = 503;\n\n CHECK(it->second.form_signatures.size());\n if (source->GetResponseCode() != kHttpResponseOk) {\n bool back_off = false;\n std::string server_header;\n switch (source->GetResponseCode()) {\n case kHttpBadGateway:\n if (!source->GetResponseHeaders()->EnumerateHeader(NULL, \"server\",\n &server_header) ||\n StartsWithASCII(server_header.c_str(),\n kAutofillQueryServerNameStartInHeader,\n false) != 0)\n break;\n \/\/ Bad gateway was received from Autofill servers. Fall through to back\n \/\/ off.\n case kHttpInternalServerError:\n case kHttpServiceUnavailable:\n back_off = true;\n break;\n }\n\n if (back_off) {\n base::Time back_off_time(base::Time::Now() + source->GetBackoffDelay());\n if (it->second.request_type == AutofillDownloadManager::REQUEST_QUERY) {\n next_query_request_ = back_off_time;\n } else {\n next_upload_request_ = back_off_time;\n }\n }\n\n DVLOG(1) << \"AutofillDownloadManager: \" << type_of_request\n << \" request has failed with response \"\n << source->GetResponseCode();\n observer_->OnServerRequestError(it->second.form_signatures[0],\n it->second.request_type,\n source->GetResponseCode());\n } else {\n DVLOG(1) << \"AutofillDownloadManager: \" << type_of_request\n << \" request has succeeded\";\n std::string response_body;\n source->GetResponseAsString(&response_body);\n if (it->second.request_type == AutofillDownloadManager::REQUEST_QUERY) {\n CacheQueryRequest(it->second.form_signatures, response_body);\n observer_->OnLoadedServerPredictions(response_body);\n } else {\n double new_positive_upload_rate = 0;\n double new_negative_upload_rate = 0;\n AutofillUploadXmlParser parse_handler(&new_positive_upload_rate,\n &new_negative_upload_rate);\n buzz::XmlParser parser(&parse_handler);\n parser.Parse(response_body.data(), response_body.length(), true);\n if (parse_handler.succeeded()) {\n SetPositiveUploadRate(new_positive_upload_rate);\n SetNegativeUploadRate(new_negative_upload_rate);\n }\n\n observer_->OnUploadedPossibleFieldTypes();\n }\n }\n delete it->first;\n url_fetchers_.erase(it);\n}\n<commit_msg>Update Autofill server URL to https:\/\/clients1.google.com<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/autofill\/autofill_download.h\"\n\n#include <algorithm>\n#include <ostream>\n#include <vector>\n\n#include \"base\/logging.h\"\n#include \"base\/rand_util.h\"\n#include \"base\/stl_util.h\"\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/autofill\/autofill_metrics.h\"\n#include \"chrome\/browser\/autofill\/autofill_xml_parser.h\"\n#include \"chrome\/browser\/autofill\/form_structure.h\"\n#include \"chrome\/browser\/prefs\/pref_service.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"content\/public\/common\/url_fetcher.h\"\n#include \"googleurl\/src\/gurl.h\"\n#include \"net\/http\/http_response_headers.h\"\n#include \"third_party\/libjingle\/source\/talk\/xmllite\/xmlparser.h\"\n\nnamespace {\nconst char kAutofillQueryServerRequestUrl[] =\n \"https:\/\/clients1.google.com\/tbproxy\/af\/query\";\nconst char kAutofillUploadServerRequestUrl[] =\n \"https:\/\/clients1.google.com\/tbproxy\/af\/upload\";\nconst char kAutofillQueryServerNameStartInHeader[] = \"GFE\/\";\n\nconst size_t kMaxFormCacheSize = 16;\n};\n\nstruct AutofillDownloadManager::FormRequestData {\n std::vector<std::string> form_signatures;\n AutofillRequestType request_type;\n};\n\nAutofillDownloadManager::AutofillDownloadManager(Profile* profile,\n Observer* observer)\n : profile_(profile),\n observer_(observer),\n max_form_cache_size_(kMaxFormCacheSize),\n next_query_request_(base::Time::Now()),\n next_upload_request_(base::Time::Now()),\n positive_upload_rate_(0),\n negative_upload_rate_(0),\n fetcher_id_for_unittest_(0) {\n DCHECK(observer_);\n PrefService* preferences = profile_->GetPrefs();\n positive_upload_rate_ =\n preferences->GetDouble(prefs::kAutofillPositiveUploadRate);\n negative_upload_rate_ =\n preferences->GetDouble(prefs::kAutofillNegativeUploadRate);\n}\n\nAutofillDownloadManager::~AutofillDownloadManager() {\n STLDeleteContainerPairFirstPointers(url_fetchers_.begin(),\n url_fetchers_.end());\n}\n\nbool AutofillDownloadManager::StartQueryRequest(\n const std::vector<FormStructure*>& forms,\n const AutofillMetrics& metric_logger) {\n if (next_query_request_ > base::Time::Now()) {\n \/\/ We are in back-off mode: do not do the request.\n return false;\n }\n std::string form_xml;\n FormRequestData request_data;\n if (!FormStructure::EncodeQueryRequest(forms, &request_data.form_signatures,\n &form_xml)) {\n return false;\n }\n\n request_data.request_type = AutofillDownloadManager::REQUEST_QUERY;\n metric_logger.LogServerQueryMetric(AutofillMetrics::QUERY_SENT);\n\n std::string query_data;\n if (CheckCacheForQueryRequest(request_data.form_signatures, &query_data)) {\n DVLOG(1) << \"AutofillDownloadManager: query request has been retrieved from\"\n << \"the cache\";\n observer_->OnLoadedServerPredictions(query_data);\n return true;\n }\n\n return StartRequest(form_xml, request_data);\n}\n\nbool AutofillDownloadManager::StartUploadRequest(\n const FormStructure& form,\n bool form_was_autofilled,\n const FieldTypeSet& available_field_types) {\n if (next_upload_request_ > base::Time::Now()) {\n \/\/ We are in back-off mode: do not do the request.\n DVLOG(1) << \"AutofillDownloadManager: Upload request is throttled.\";\n return false;\n }\n\n \/\/ Flip a coin to see if we should upload this form.\n double upload_rate = form_was_autofilled ? GetPositiveUploadRate() :\n GetNegativeUploadRate();\n if (form.upload_required() == UPLOAD_NOT_REQUIRED ||\n (form.upload_required() == USE_UPLOAD_RATES &&\n base::RandDouble() > upload_rate)) {\n DVLOG(1) << \"AutofillDownloadManager: Upload request is ignored.\";\n \/\/ If we ever need notification that upload was skipped, add it here.\n return false;\n }\n\n std::string form_xml;\n if (!form.EncodeUploadRequest(available_field_types, form_was_autofilled,\n &form_xml))\n return false;\n\n FormRequestData request_data;\n request_data.form_signatures.push_back(form.FormSignature());\n request_data.request_type = AutofillDownloadManager::REQUEST_UPLOAD;\n\n return StartRequest(form_xml, request_data);\n}\n\ndouble AutofillDownloadManager::GetPositiveUploadRate() const {\n return positive_upload_rate_;\n}\n\ndouble AutofillDownloadManager::GetNegativeUploadRate() const {\n return negative_upload_rate_;\n}\n\nvoid AutofillDownloadManager::SetPositiveUploadRate(double rate) {\n if (rate == positive_upload_rate_)\n return;\n positive_upload_rate_ = rate;\n DCHECK_GE(rate, 0.0);\n DCHECK_LE(rate, 1.0);\n PrefService* preferences = profile_->GetPrefs();\n preferences->SetDouble(prefs::kAutofillPositiveUploadRate, rate);\n}\n\nvoid AutofillDownloadManager::SetNegativeUploadRate(double rate) {\n if (rate == negative_upload_rate_)\n return;\n negative_upload_rate_ = rate;\n DCHECK_GE(rate, 0.0);\n DCHECK_LE(rate, 1.0);\n PrefService* preferences = profile_->GetPrefs();\n preferences->SetDouble(prefs::kAutofillNegativeUploadRate, rate);\n}\n\nbool AutofillDownloadManager::StartRequest(\n const std::string& form_xml,\n const FormRequestData& request_data) {\n net::URLRequestContextGetter* request_context = profile_->GetRequestContext();\n DCHECK(request_context);\n std::string request_url;\n if (request_data.request_type == AutofillDownloadManager::REQUEST_QUERY)\n request_url = kAutofillQueryServerRequestUrl;\n else\n request_url = kAutofillUploadServerRequestUrl;\n\n \/\/ Id is ignored for regular chrome, in unit test id's for fake fetcher\n \/\/ factory will be 0, 1, 2, ...\n content::URLFetcher* fetcher = content::URLFetcher::Create(\n fetcher_id_for_unittest_++, GURL(request_url), content::URLFetcher::POST,\n this);\n url_fetchers_[fetcher] = request_data;\n fetcher->SetAutomaticallyRetryOn5xx(false);\n fetcher->SetRequestContext(request_context);\n fetcher->SetUploadData(\"text\/plain\", form_xml);\n fetcher->Start();\n return true;\n}\n\nvoid AutofillDownloadManager::CacheQueryRequest(\n const std::vector<std::string>& forms_in_query,\n const std::string& query_data) {\n std::string signature = GetCombinedSignature(forms_in_query);\n for (QueryRequestCache::iterator it = cached_forms_.begin();\n it != cached_forms_.end(); ++it) {\n if (it->first == signature) {\n \/\/ We hit the cache, move to the first position and return.\n std::pair<std::string, std::string> data = *it;\n cached_forms_.erase(it);\n cached_forms_.push_front(data);\n return;\n }\n }\n std::pair<std::string, std::string> data;\n data.first = signature;\n data.second = query_data;\n cached_forms_.push_front(data);\n while (cached_forms_.size() > max_form_cache_size_)\n cached_forms_.pop_back();\n}\n\nbool AutofillDownloadManager::CheckCacheForQueryRequest(\n const std::vector<std::string>& forms_in_query,\n std::string* query_data) const {\n std::string signature = GetCombinedSignature(forms_in_query);\n for (QueryRequestCache::const_iterator it = cached_forms_.begin();\n it != cached_forms_.end(); ++it) {\n if (it->first == signature) {\n \/\/ We hit the cache, fill the data and return.\n *query_data = it->second;\n return true;\n }\n }\n return false;\n}\n\nstd::string AutofillDownloadManager::GetCombinedSignature(\n const std::vector<std::string>& forms_in_query) const {\n size_t total_size = forms_in_query.size();\n for (size_t i = 0; i < forms_in_query.size(); ++i)\n total_size += forms_in_query[i].length();\n std::string signature;\n\n signature.reserve(total_size);\n\n for (size_t i = 0; i < forms_in_query.size(); ++i) {\n if (i)\n signature.append(\",\");\n signature.append(forms_in_query[i]);\n }\n return signature;\n}\n\nvoid AutofillDownloadManager::OnURLFetchComplete(\n const content::URLFetcher* source) {\n std::map<content::URLFetcher *, FormRequestData>::iterator it =\n url_fetchers_.find(const_cast<content::URLFetcher*>(source));\n if (it == url_fetchers_.end()) {\n \/\/ Looks like crash on Mac is possibly caused with callback entering here\n \/\/ with unknown fetcher when network is refreshed.\n return;\n }\n std::string type_of_request(\n it->second.request_type == AutofillDownloadManager::REQUEST_QUERY ?\n \"query\" : \"upload\");\n const int kHttpResponseOk = 200;\n const int kHttpInternalServerError = 500;\n const int kHttpBadGateway = 502;\n const int kHttpServiceUnavailable = 503;\n\n CHECK(it->second.form_signatures.size());\n if (source->GetResponseCode() != kHttpResponseOk) {\n bool back_off = false;\n std::string server_header;\n switch (source->GetResponseCode()) {\n case kHttpBadGateway:\n if (!source->GetResponseHeaders()->EnumerateHeader(NULL, \"server\",\n &server_header) ||\n StartsWithASCII(server_header.c_str(),\n kAutofillQueryServerNameStartInHeader,\n false) != 0)\n break;\n \/\/ Bad gateway was received from Autofill servers. Fall through to back\n \/\/ off.\n case kHttpInternalServerError:\n case kHttpServiceUnavailable:\n back_off = true;\n break;\n }\n\n if (back_off) {\n base::Time back_off_time(base::Time::Now() + source->GetBackoffDelay());\n if (it->second.request_type == AutofillDownloadManager::REQUEST_QUERY) {\n next_query_request_ = back_off_time;\n } else {\n next_upload_request_ = back_off_time;\n }\n }\n\n DVLOG(1) << \"AutofillDownloadManager: \" << type_of_request\n << \" request has failed with response \"\n << source->GetResponseCode();\n observer_->OnServerRequestError(it->second.form_signatures[0],\n it->second.request_type,\n source->GetResponseCode());\n } else {\n DVLOG(1) << \"AutofillDownloadManager: \" << type_of_request\n << \" request has succeeded\";\n std::string response_body;\n source->GetResponseAsString(&response_body);\n if (it->second.request_type == AutofillDownloadManager::REQUEST_QUERY) {\n CacheQueryRequest(it->second.form_signatures, response_body);\n observer_->OnLoadedServerPredictions(response_body);\n } else {\n double new_positive_upload_rate = 0;\n double new_negative_upload_rate = 0;\n AutofillUploadXmlParser parse_handler(&new_positive_upload_rate,\n &new_negative_upload_rate);\n buzz::XmlParser parser(&parse_handler);\n parser.Parse(response_body.data(), response_body.length(), true);\n if (parse_handler.succeeded()) {\n SetPositiveUploadRate(new_positive_upload_rate);\n SetNegativeUploadRate(new_negative_upload_rate);\n }\n\n observer_->OnUploadedPossibleFieldTypes();\n }\n }\n delete it->first;\n url_fetchers_.erase(it);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <algorithm>\n\n#include \"app\/menus\/simple_menu_model.h\"\n#include \"app\/theme_provider.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/chromeos\/compact_location_bar.h\"\n#include \"chrome\/browser\/chromeos\/compact_navigation_bar.h\"\n#include \"chrome\/browser\/chromeos\/main_menu.h\"\n#include \"chrome\/browser\/chromeos\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/panel_controller.h\"\n#include \"chrome\/browser\/views\/frame\/browser_extender.h\"\n#include \"chrome\/browser\/views\/frame\/browser_frame_gtk.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/tabs\/tab_overview_types.h\"\n#include \"chrome\/browser\/views\/tabs\/tab_strip.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/x11_util.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/controls\/button\/button.h\"\n#include \"views\/controls\/button\/image_button.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nconst char* kChromeOsWindowManagerName = \"chromeos-wm\";\n\n\/\/ NormalExtender adds ChromeOS specific controls and menus to a BrowserView\n\/\/ created with Browser::TYPE_NORMAL. This extender adds controls to\n\/\/ the title bar as follows:\n\/\/ ____ __ __\n\/\/ [MainMenu] \/ \\ \\ \\ [StatusArea]\n\/\/\n\/\/ and adds the system context menu to the remaining arae of the titlebar.\n\/\/\n\/\/ For Browser::TYPE_POPUP type of BrowserView, see PopupExtender class below.\nclass NormalExtender : public BrowserExtender,\n public views::ButtonListener,\n public views::ContextMenuController {\n public:\n explicit NormalExtender(BrowserView* browser_view)\n : BrowserExtender(browser_view),\n main_menu_(NULL),\n status_area_(NULL),\n compact_navigation_bar_(NULL),\n \/\/ CompactNavigationBar is disabled by default.\n \/\/ TODO(oshima): Get this info from preference.\n compact_navigation_bar_enabled_(false),\n force_maximized_window_(false) {\n }\n virtual ~NormalExtender() {}\n\n protected:\n \/\/ BrowserExtender overrides.\n virtual void Init() {\n main_menu_ = new views::ImageButton(this);\n ThemeProvider* theme_provider =\n browser_view()->frame()->GetThemeProviderForFrame();\n SkBitmap* image = theme_provider->GetBitmapNamed(IDR_MAIN_MENU_BUTTON);\n main_menu_->SetImage(views::CustomButton::BS_NORMAL, image);\n main_menu_->SetImage(views::CustomButton::BS_HOT, image);\n main_menu_->SetImage(views::CustomButton::BS_PUSHED, image);\n browser_view()->AddChildView(main_menu_);\n\n Browser* browser = browser_view()->browser();\n compact_location_bar_.reset(\n new chromeos::CompactLocationBar(browser_view()));\n compact_navigation_bar_ = new chromeos::CompactNavigationBar(browser);\n browser_view()->AddChildView(compact_navigation_bar_);\n compact_navigation_bar_->Init();\n status_area_ = new chromeos::StatusAreaView(\n browser,\n browser_view()->GetWindow()->GetNativeWindow());\n browser_view()->AddChildView(status_area_);\n status_area_->Init();\n\n InitSystemMenu();\n chromeos::MainMenu::ScheduleCreation();\n\n \/\/ The ContextMenuController has to be set to a NonClientView but\n \/\/ not to a NonClientFrameView because a TabStrip is not a child of\n \/\/ a NonClientFrameView even though visually a TabStrip is over a\n \/\/ NonClientFrameView.\n BrowserFrameGtk* gtk_frame =\n static_cast<BrowserFrameGtk*>(browser_view()->frame());\n gtk_frame->GetNonClientView()->SetContextMenuController(this);\n\n if (browser->type() == Browser::TYPE_NORMAL) {\n std::string wm_name;\n bool wm_name_valid = x11_util::GetWindowManagerName(&wm_name);\n \/\/ NOTE: On Chrome OS the wm and Chrome are started in parallel. This\n \/\/ means it's possible for us not to be able to get the name of the window\n \/\/ manager. We assume that when this happens we're on Chrome OS.\n force_maximized_window_ = (!wm_name_valid ||\n wm_name == kChromeOsWindowManagerName ||\n CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kChromeosFrame));\n }\n }\n\n virtual gfx::Rect Layout(const gfx::Rect& bounds) {\n \/\/ Skip if there is no space to layout, or if the browser is in\n \/\/ fullscreen mode.\n if (bounds.IsEmpty() || browser_view()->IsFullscreen()) {\n main_menu_->SetVisible(false);\n compact_navigation_bar_->SetVisible(false);\n status_area_->SetVisible(false);\n return bounds;\n } else {\n main_menu_->SetVisible(true);\n compact_navigation_bar_->SetVisible(compact_navigation_bar_enabled_);\n status_area_->SetVisible(true);\n }\n\n \/* TODO(oshima):\n * Disabling the ability to update location bar on re-layout bacause\n * tabstrip state may not be in sync with the browser's state when\n * new tab is added. We should decide when we know more about this\n * feature. May be we should simply hide the location?\n * Filed a bug: http:\/\/crbug.com\/30612.\n if (compact_navigation_bar_->IsVisible()) {\n \/\/ Update the size and location of the compact location bar.\n compact_location_bar_->UpdateBounds(\n browser_view()->tabstrip()->GetSelectedTab());\n }\n *\/\n\n \/\/ Layout main menu before tab strip.\n gfx::Size main_menu_size = main_menu_->GetPreferredSize();\n main_menu_->SetBounds(bounds.x(), bounds.y(),\n main_menu_size.width(), bounds.height());\n\n \/\/ Layout status area after tab strip.\n gfx::Size status_size = status_area_->GetPreferredSize();\n status_area_->SetBounds(bounds.x() + bounds.width() - status_size.width(),\n bounds.y(), status_size.width(),\n status_size.height());\n int curx = bounds.x() + main_menu_size.width();\n int width = bounds.width() - main_menu_size.width() - status_size.width();\n\n if (compact_navigation_bar_->IsVisible()) {\n gfx::Size cnb_bounds = compact_navigation_bar_->GetPreferredSize();\n \/\/ This (+1\/-1) is a quick hack for the bug\n \/\/ http:\/\/code.google.com\/p\/chromium-os\/issues\/detail?id=1010\n \/\/ while investigating the issue. It could be in gtk or around\n \/\/ NativeViewHostGtk::CreateFixed, but it will take some time.\n compact_navigation_bar_->SetBounds(curx, bounds.y() + 1,\n cnb_bounds.width(),\n bounds.height() - 1);\n curx += cnb_bounds.width();\n width -= cnb_bounds.width();\n }\n width = std::max(0, width); \/\/ In case there is no space left.\n return gfx::Rect(curx, bounds.y(), width, bounds.height());\n }\n\n virtual bool NonClientHitTest(const gfx::Point& point) {\n gfx::Point point_in_main_menu_coords(point);\n views::View::ConvertPointToView(browser_view(), main_menu_,\n &point_in_main_menu_coords);\n if (main_menu_->HitTest(point_in_main_menu_coords))\n return true;\n\n gfx::Point point_in_status_area_coords(point);\n views::View::ConvertPointToView(browser_view(), status_area_,\n &point_in_status_area_coords);\n if (status_area_->HitTest(point_in_status_area_coords))\n return true;\n\n if (compact_navigation_bar_->IsVisible()) {\n gfx::Point point_in_cnb_coords(point);\n views::View::ConvertPointToView(browser_view(),\n compact_navigation_bar_,\n &point_in_cnb_coords);\n return compact_navigation_bar_->HitTest(point_in_cnb_coords);\n }\n return false;\n }\n\n virtual void UpdateTitleBar() {}\n\n virtual void Show() {\n TabOverviewTypes::instance()->SetWindowType(\n GTK_WIDGET(GetBrowserWindow()->GetNativeWindow()),\n TabOverviewTypes::WINDOW_TYPE_CHROME_TOPLEVEL,\n NULL);\n }\n\n virtual void Close() {}\n\n virtual void ActivationChanged() {}\n\n virtual bool ShouldForceHideToolbar() {\n return compact_navigation_bar_enabled_;\n }\n\n virtual bool SetFocusToCompactNavigationBar() {\n if (compact_navigation_bar_->IsFocusable()) {\n compact_navigation_bar_->FocusLocation();\n return true;\n } else {\n return false;\n }\n }\n\n virtual void ToggleCompactNavigationBar() {\n compact_navigation_bar_enabled_ = !compact_navigation_bar_enabled_;\n compact_navigation_bar_->SetFocusable(compact_navigation_bar_enabled_);\n status_area_->Update();\n }\n\n virtual void OnMouseEnteredToTab(Tab* tab) {\n ShowCompactLocationBarUnderSelectedTab();\n }\n\n virtual void OnMouseMovedOnTab(Tab* tab) {\n ShowCompactLocationBarUnderSelectedTab();\n }\n\n virtual void OnMouseExitedFromTab(Tab* tab) {\n compact_location_bar_->StartPopupTimer();\n }\n\n virtual bool ShouldForceMaximizedWindow() {\n return force_maximized_window_;\n }\n\n private:\n \/\/ Shows the compact location bar under the selected tab.\n void ShowCompactLocationBarUnderSelectedTab() {\n if (!compact_navigation_bar_enabled_)\n return;\n compact_location_bar_->Update(\n browser_view()->tabstrip()->GetSelectedTab(),\n browser_view()->browser()->GetSelectedTabContents());\n }\n\n \/\/ Creates system menu.\n void InitSystemMenu() {\n system_menu_contents_.reset(new menus::SimpleMenuModel(browser_view()));\n system_menu_contents_->AddItemWithStringId(IDC_RESTORE_TAB,\n IDS_RESTORE_TAB);\n system_menu_contents_->AddItemWithStringId(IDC_NEW_TAB, IDS_NEW_TAB);\n system_menu_contents_->AddSeparator();\n system_menu_contents_->AddItemWithStringId(IDC_TASK_MANAGER,\n IDS_TASK_MANAGER);\n system_menu_menu_.reset(new views::Menu2(system_menu_contents_.get()));\n }\n\n \/\/ views::ButtonListener overrides.\n virtual void ButtonPressed(views::Button* sender, const views::Event& event) {\n chromeos::MainMenu::Show(browser_view()->browser());\n }\n\n \/\/ views::ContextMenuController overrides.\n virtual void ShowContextMenu(views::View* source,\n int x,\n int y,\n bool is_mouse_gesture) {\n system_menu_menu_->RunMenuAt(gfx::Point(x, y), views::Menu2::ALIGN_TOPLEFT);\n }\n\n \/\/ Main menu button.\n views::ImageButton* main_menu_;\n\n \/\/ Status Area view.\n chromeos::StatusAreaView* status_area_;\n\n \/\/ System menus.\n scoped_ptr<menus::SimpleMenuModel> system_menu_contents_;\n scoped_ptr<views::Menu2> system_menu_menu_;\n\n \/\/ CompactNavigationBar view.\n chromeos::CompactNavigationBar* compact_navigation_bar_;\n\n \/\/ A toggle flag to show\/hide the compact navigation bar.\n bool compact_navigation_bar_enabled_;\n\n \/\/ CompactLocationBar view.\n scoped_ptr<chromeos::CompactLocationBar> compact_location_bar_;\n\n \/\/ A flag to specify if the browser window should be maximized.\n bool force_maximized_window_;\n\n DISALLOW_COPY_AND_ASSIGN(NormalExtender);\n};\n\n\/\/ PopupExtender class creates dedicated title window for popup window.\n\/\/ The size and location of the created title window is controlled by\n\/\/ by window manager.\nclass PopupExtender : public BrowserExtender {\n public:\n explicit PopupExtender(BrowserView* browser_view)\n : BrowserExtender(browser_view) {\n }\n virtual ~PopupExtender() {}\n\n private:\n \/\/ BrowserExtender overrides.\n virtual void Init() {\n \/\/ The visibility of toolbar is controlled in\n \/\/ the BrowserView::IsToolbarVisible method.\n\n views::Window* window = GetBrowserWindow();\n gfx::NativeWindow native_window = window->GetNativeWindow();\n \/\/ The window manager needs the min size for popups.\n gfx::Rect bounds = window->GetBounds();\n gtk_widget_set_size_request(\n GTK_WIDGET(native_window), bounds.width(), bounds.height());\n \/\/ If we don't explicitly resize here there is a race condition between\n \/\/ the X Server and the window manager. Windows will appear with a default\n \/\/ size of 200x200 if this happens.\n gtk_window_resize(native_window, bounds.width(), bounds.height());\n }\n\n virtual gfx::Rect Layout(const gfx::Rect& bounds) {\n return bounds;\n }\n\n virtual bool NonClientHitTest(const gfx::Point& point) {\n return false;\n }\n\n virtual void Show() {\n panel_controller_.reset(new chromeos::PanelController(browser_view()));\n }\n\n virtual void Close() {\n if (panel_controller_.get())\n panel_controller_->Close();\n }\n\n virtual void UpdateTitleBar() {\n if (panel_controller_.get())\n panel_controller_->UpdateTitleBar();\n }\n\n virtual void ActivationChanged() {\n if (panel_controller_.get()) {\n if (GetBrowserWindow()->IsActive())\n panel_controller_->OnFocusIn();\n else\n panel_controller_->OnFocusOut();\n }\n }\n\n virtual bool ShouldForceHideToolbar() {\n \/\/ Always hide toolbar for popups.\n return true;\n }\n\n virtual bool SetFocusToCompactNavigationBar() {\n return false;\n }\n\n virtual void ToggleCompactNavigationBar() {}\n\n virtual void OnMouseEnteredToTab(Tab* tab) {}\n\n virtual void OnMouseMovedOnTab(Tab* tab) {}\n\n virtual void OnMouseExitedFromTab(Tab* tab) {}\n\n virtual bool ShouldForceMaximizedWindow() {\n return false;\n }\n\n \/\/ Controls interactions with the window manager for popup panels.\n scoped_ptr<chromeos::PanelController> panel_controller_;\n\n DISALLOW_COPY_AND_ASSIGN(PopupExtender);\n};\n\n} \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserExtender, public:\n\n\/\/ static\nBrowserExtender* BrowserExtender::Create(BrowserView* browser_view) {\n BrowserExtender* extender;\n if (browser_view->browser()->type() & Browser::TYPE_POPUP)\n extender = new PopupExtender(browser_view);\n else\n extender = new NormalExtender(browser_view);\n extender->Init();\n return extender;\n}\n<commit_msg>Don't show app menu when wrench menu is shown at startup.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <algorithm>\n\n#include \"app\/menus\/simple_menu_model.h\"\n#include \"app\/theme_provider.h\"\n#include \"base\/command_line.h\"\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/chromeos\/compact_location_bar.h\"\n#include \"chrome\/browser\/chromeos\/compact_navigation_bar.h\"\n#include \"chrome\/browser\/chromeos\/main_menu.h\"\n#include \"chrome\/browser\/chromeos\/status_area_view.h\"\n#include \"chrome\/browser\/chromeos\/panel_controller.h\"\n#include \"chrome\/browser\/views\/frame\/browser_extender.h\"\n#include \"chrome\/browser\/views\/frame\/browser_frame_gtk.h\"\n#include \"chrome\/browser\/views\/frame\/browser_view.h\"\n#include \"chrome\/browser\/views\/tabs\/tab_overview_types.h\"\n#include \"chrome\/browser\/views\/tabs\/tab_strip.h\"\n#include \"chrome\/browser\/views\/toolbar_view.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/x11_util.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"views\/controls\/button\/button.h\"\n#include \"views\/controls\/button\/image_button.h\"\n#include \"views\/controls\/menu\/menu_2.h\"\n#include \"views\/window\/window.h\"\n\nnamespace {\n\nconst char* kChromeOsWindowManagerName = \"chromeos-wm\";\n\n\/\/ NormalExtender adds ChromeOS specific controls and menus to a BrowserView\n\/\/ created with Browser::TYPE_NORMAL. This extender adds controls to\n\/\/ the title bar as follows:\n\/\/ ____ __ __\n\/\/ [MainMenu] \/ \\ \\ \\ [StatusArea]\n\/\/\n\/\/ and adds the system context menu to the remaining arae of the titlebar.\n\/\/\n\/\/ For Browser::TYPE_POPUP type of BrowserView, see PopupExtender class below.\nclass NormalExtender : public BrowserExtender,\n public views::ButtonListener,\n public views::ContextMenuController {\n public:\n explicit NormalExtender(BrowserView* browser_view)\n : BrowserExtender(browser_view),\n main_menu_(NULL),\n status_area_(NULL),\n compact_navigation_bar_(NULL),\n \/\/ CompactNavigationBar is disabled by default.\n \/\/ TODO(oshima): Get this info from preference.\n compact_navigation_bar_enabled_(false),\n force_maximized_window_(false) {\n }\n virtual ~NormalExtender() {}\n\n protected:\n \/\/ BrowserExtender overrides.\n virtual void Init() {\n main_menu_ = new views::ImageButton(this);\n ThemeProvider* theme_provider =\n browser_view()->frame()->GetThemeProviderForFrame();\n SkBitmap* image = theme_provider->GetBitmapNamed(IDR_MAIN_MENU_BUTTON);\n main_menu_->SetImage(views::CustomButton::BS_NORMAL, image);\n main_menu_->SetImage(views::CustomButton::BS_HOT, image);\n main_menu_->SetImage(views::CustomButton::BS_PUSHED, image);\n browser_view()->AddChildView(main_menu_);\n\n Browser* browser = browser_view()->browser();\n compact_location_bar_.reset(\n new chromeos::CompactLocationBar(browser_view()));\n compact_navigation_bar_ = new chromeos::CompactNavigationBar(browser);\n browser_view()->AddChildView(compact_navigation_bar_);\n compact_navigation_bar_->Init();\n status_area_ = new chromeos::StatusAreaView(\n browser,\n browser_view()->GetWindow()->GetNativeWindow());\n browser_view()->AddChildView(status_area_);\n status_area_->Init();\n\n InitSystemMenu();\n chromeos::MainMenu::ScheduleCreation();\n\n \/\/ The ContextMenuController has to be set to a NonClientView but\n \/\/ not to a NonClientFrameView because a TabStrip is not a child of\n \/\/ a NonClientFrameView even though visually a TabStrip is over a\n \/\/ NonClientFrameView.\n BrowserFrameGtk* gtk_frame =\n static_cast<BrowserFrameGtk*>(browser_view()->frame());\n gtk_frame->GetNonClientView()->SetContextMenuController(this);\n\n if (browser->type() == Browser::TYPE_NORMAL) {\n std::string wm_name;\n bool wm_name_valid = x11_util::GetWindowManagerName(&wm_name);\n \/\/ NOTE: On Chrome OS the wm and Chrome are started in parallel. This\n \/\/ means it's possible for us not to be able to get the name of the window\n \/\/ manager. We assume that when this happens we're on Chrome OS.\n force_maximized_window_ = (!wm_name_valid ||\n wm_name == kChromeOsWindowManagerName ||\n CommandLine::ForCurrentProcess()->HasSwitch(\n switches::kChromeosFrame));\n }\n }\n\n virtual gfx::Rect Layout(const gfx::Rect& bounds) {\n \/\/ Skip if there is no space to layout, or if the browser is in\n \/\/ fullscreen mode.\n if (bounds.IsEmpty() || browser_view()->IsFullscreen()) {\n main_menu_->SetVisible(false);\n compact_navigation_bar_->SetVisible(false);\n status_area_->SetVisible(false);\n return bounds;\n } else {\n main_menu_->SetVisible(true);\n compact_navigation_bar_->SetVisible(compact_navigation_bar_enabled_);\n status_area_->SetVisible(true);\n }\n\n \/* TODO(oshima):\n * Disabling the ability to update location bar on re-layout bacause\n * tabstrip state may not be in sync with the browser's state when\n * new tab is added. We should decide when we know more about this\n * feature. May be we should simply hide the location?\n * Filed a bug: http:\/\/crbug.com\/30612.\n if (compact_navigation_bar_->IsVisible()) {\n \/\/ Update the size and location of the compact location bar.\n compact_location_bar_->UpdateBounds(\n browser_view()->tabstrip()->GetSelectedTab());\n }\n *\/\n\n \/\/ Layout main menu before tab strip.\n gfx::Size main_menu_size = main_menu_->GetPreferredSize();\n main_menu_->SetBounds(bounds.x(), bounds.y(),\n main_menu_size.width(), bounds.height());\n\n \/\/ Layout status area after tab strip.\n status_area_->Update();\n gfx::Size status_size = status_area_->GetPreferredSize();\n status_area_->SetBounds(bounds.x() + bounds.width() - status_size.width(),\n bounds.y(), status_size.width(),\n status_size.height());\n int curx = bounds.x() + main_menu_size.width();\n int width = bounds.width() - main_menu_size.width() - status_size.width();\n\n if (compact_navigation_bar_->IsVisible()) {\n gfx::Size cnb_bounds = compact_navigation_bar_->GetPreferredSize();\n \/\/ This (+1\/-1) is a quick hack for the bug\n \/\/ http:\/\/code.google.com\/p\/chromium-os\/issues\/detail?id=1010\n \/\/ while investigating the issue. It could be in gtk or around\n \/\/ NativeViewHostGtk::CreateFixed, but it will take some time.\n compact_navigation_bar_->SetBounds(curx, bounds.y() + 1,\n cnb_bounds.width(),\n bounds.height() - 1);\n curx += cnb_bounds.width();\n width -= cnb_bounds.width();\n }\n width = std::max(0, width); \/\/ In case there is no space left.\n return gfx::Rect(curx, bounds.y(), width, bounds.height());\n }\n\n virtual bool NonClientHitTest(const gfx::Point& point) {\n gfx::Point point_in_main_menu_coords(point);\n views::View::ConvertPointToView(browser_view(), main_menu_,\n &point_in_main_menu_coords);\n if (main_menu_->HitTest(point_in_main_menu_coords))\n return true;\n\n gfx::Point point_in_status_area_coords(point);\n views::View::ConvertPointToView(browser_view(), status_area_,\n &point_in_status_area_coords);\n if (status_area_->HitTest(point_in_status_area_coords))\n return true;\n\n if (compact_navigation_bar_->IsVisible()) {\n gfx::Point point_in_cnb_coords(point);\n views::View::ConvertPointToView(browser_view(),\n compact_navigation_bar_,\n &point_in_cnb_coords);\n return compact_navigation_bar_->HitTest(point_in_cnb_coords);\n }\n return false;\n }\n\n virtual void UpdateTitleBar() {}\n\n virtual void Show() {\n TabOverviewTypes::instance()->SetWindowType(\n GTK_WIDGET(GetBrowserWindow()->GetNativeWindow()),\n TabOverviewTypes::WINDOW_TYPE_CHROME_TOPLEVEL,\n NULL);\n }\n\n virtual void Close() {}\n\n virtual void ActivationChanged() {}\n\n virtual bool ShouldForceHideToolbar() {\n return compact_navigation_bar_enabled_;\n }\n\n virtual bool SetFocusToCompactNavigationBar() {\n if (compact_navigation_bar_->IsFocusable()) {\n compact_navigation_bar_->FocusLocation();\n return true;\n } else {\n return false;\n }\n }\n\n virtual void ToggleCompactNavigationBar() {\n compact_navigation_bar_enabled_ = !compact_navigation_bar_enabled_;\n compact_navigation_bar_->SetFocusable(compact_navigation_bar_enabled_);\n }\n\n virtual void OnMouseEnteredToTab(Tab* tab) {\n ShowCompactLocationBarUnderSelectedTab();\n }\n\n virtual void OnMouseMovedOnTab(Tab* tab) {\n ShowCompactLocationBarUnderSelectedTab();\n }\n\n virtual void OnMouseExitedFromTab(Tab* tab) {\n compact_location_bar_->StartPopupTimer();\n }\n\n virtual bool ShouldForceMaximizedWindow() {\n return force_maximized_window_;\n }\n\n private:\n \/\/ Shows the compact location bar under the selected tab.\n void ShowCompactLocationBarUnderSelectedTab() {\n if (!compact_navigation_bar_enabled_)\n return;\n compact_location_bar_->Update(\n browser_view()->tabstrip()->GetSelectedTab(),\n browser_view()->browser()->GetSelectedTabContents());\n }\n\n \/\/ Creates system menu.\n void InitSystemMenu() {\n system_menu_contents_.reset(new menus::SimpleMenuModel(browser_view()));\n system_menu_contents_->AddItemWithStringId(IDC_RESTORE_TAB,\n IDS_RESTORE_TAB);\n system_menu_contents_->AddItemWithStringId(IDC_NEW_TAB, IDS_NEW_TAB);\n system_menu_contents_->AddSeparator();\n system_menu_contents_->AddItemWithStringId(IDC_TASK_MANAGER,\n IDS_TASK_MANAGER);\n system_menu_menu_.reset(new views::Menu2(system_menu_contents_.get()));\n }\n\n \/\/ views::ButtonListener overrides.\n virtual void ButtonPressed(views::Button* sender, const views::Event& event) {\n chromeos::MainMenu::Show(browser_view()->browser());\n }\n\n \/\/ views::ContextMenuController overrides.\n virtual void ShowContextMenu(views::View* source,\n int x,\n int y,\n bool is_mouse_gesture) {\n system_menu_menu_->RunMenuAt(gfx::Point(x, y), views::Menu2::ALIGN_TOPLEFT);\n }\n\n \/\/ Main menu button.\n views::ImageButton* main_menu_;\n\n \/\/ Status Area view.\n chromeos::StatusAreaView* status_area_;\n\n \/\/ System menus.\n scoped_ptr<menus::SimpleMenuModel> system_menu_contents_;\n scoped_ptr<views::Menu2> system_menu_menu_;\n\n \/\/ CompactNavigationBar view.\n chromeos::CompactNavigationBar* compact_navigation_bar_;\n\n \/\/ A toggle flag to show\/hide the compact navigation bar.\n bool compact_navigation_bar_enabled_;\n\n \/\/ CompactLocationBar view.\n scoped_ptr<chromeos::CompactLocationBar> compact_location_bar_;\n\n \/\/ A flag to specify if the browser window should be maximized.\n bool force_maximized_window_;\n\n DISALLOW_COPY_AND_ASSIGN(NormalExtender);\n};\n\n\/\/ PopupExtender class creates dedicated title window for popup window.\n\/\/ The size and location of the created title window is controlled by\n\/\/ by window manager.\nclass PopupExtender : public BrowserExtender {\n public:\n explicit PopupExtender(BrowserView* browser_view)\n : BrowserExtender(browser_view) {\n }\n virtual ~PopupExtender() {}\n\n private:\n \/\/ BrowserExtender overrides.\n virtual void Init() {\n \/\/ The visibility of toolbar is controlled in\n \/\/ the BrowserView::IsToolbarVisible method.\n\n views::Window* window = GetBrowserWindow();\n gfx::NativeWindow native_window = window->GetNativeWindow();\n \/\/ The window manager needs the min size for popups.\n gfx::Rect bounds = window->GetBounds();\n gtk_widget_set_size_request(\n GTK_WIDGET(native_window), bounds.width(), bounds.height());\n \/\/ If we don't explicitly resize here there is a race condition between\n \/\/ the X Server and the window manager. Windows will appear with a default\n \/\/ size of 200x200 if this happens.\n gtk_window_resize(native_window, bounds.width(), bounds.height());\n }\n\n virtual gfx::Rect Layout(const gfx::Rect& bounds) {\n return bounds;\n }\n\n virtual bool NonClientHitTest(const gfx::Point& point) {\n return false;\n }\n\n virtual void Show() {\n panel_controller_.reset(new chromeos::PanelController(browser_view()));\n }\n\n virtual void Close() {\n if (panel_controller_.get())\n panel_controller_->Close();\n }\n\n virtual void UpdateTitleBar() {\n if (panel_controller_.get())\n panel_controller_->UpdateTitleBar();\n }\n\n virtual void ActivationChanged() {\n if (panel_controller_.get()) {\n if (GetBrowserWindow()->IsActive())\n panel_controller_->OnFocusIn();\n else\n panel_controller_->OnFocusOut();\n }\n }\n\n virtual bool ShouldForceHideToolbar() {\n \/\/ Always hide toolbar for popups.\n return true;\n }\n\n virtual bool SetFocusToCompactNavigationBar() {\n return false;\n }\n\n virtual void ToggleCompactNavigationBar() {}\n\n virtual void OnMouseEnteredToTab(Tab* tab) {}\n\n virtual void OnMouseMovedOnTab(Tab* tab) {}\n\n virtual void OnMouseExitedFromTab(Tab* tab) {}\n\n virtual bool ShouldForceMaximizedWindow() {\n return false;\n }\n\n \/\/ Controls interactions with the window manager for popup panels.\n scoped_ptr<chromeos::PanelController> panel_controller_;\n\n DISALLOW_COPY_AND_ASSIGN(PopupExtender);\n};\n\n} \/\/ namespace\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ BrowserExtender, public:\n\n\/\/ static\nBrowserExtender* BrowserExtender::Create(BrowserView* browser_view) {\n BrowserExtender* extender;\n if (browser_view->browser()->type() & Browser::TYPE_POPUP)\n extender = new PopupExtender(browser_view);\n else\n extender = new NormalExtender(browser_view);\n extender->Init();\n return extender;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_path.h\"\n#include \"chrome\/browser\/tab_contents\/navigation_entry.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"chrome\/common\/page_transition_types.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nvoid SimulateRendererCrash(Browser* browser) {\n browser->OpenURL(GURL(chrome::kAboutCrashURL), GURL(), CURRENT_TAB,\n PageTransition::TYPED);\n ui_test_utils::WaitForNotification(\n NotificationType::TAB_CONTENTS_DISCONNECTED);\n}\n\n} \/\/ namespace\n\nclass CrashRecoveryBrowserTest : public InProcessBrowserTest {\n};\n\n\/\/ http:\/\/crbug.com\/29331 - Causes an OS crash dialog in release mode, needs to\n\/\/ be fixed before it can be enabled to not cause the bots issues.\n#if defined(OS_MACOSX)\n#define MAYBE_Reload DISABLED_Reload\n#else\n#define MAYBE_Reload Reload\n#endif\n\n\/\/ Test that reload works after a crash.\nIN_PROC_BROWSER_TEST_F(CrashRecoveryBrowserTest, MAYBE_Reload) {\n \/\/ The title of the active tab should change each time this URL is loaded.\n GURL url(\n \"data:text\/html,<script>document.title=new Date().valueOf()<\/script>\");\n ui_test_utils::NavigateToURL(browser(), url);\n\n string16 title_before_crash;\n string16 title_after_crash;\n\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_before_crash));\n SimulateRendererCrash(browser());\n browser()->Reload(CURRENT_TAB);\n ASSERT_TRUE(ui_test_utils::WaitForNavigationInCurrentTab(browser()));\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_after_crash));\n EXPECT_NE(title_before_crash, title_after_crash);\n}\n\n\/\/ Tests that loading a crashed page in a new tab correctly updates the title.\n\/\/ There was an earlier bug (1270510) in process-per-site in which the max page\n\/\/ ID of the RenderProcessHost was stale, so the NavigationEntry in the new tab\n\/\/ was not committed. This prevents regression of that bug.\n\/\/ http:\/\/crbug.com\/57158 - Times out sometimes on all platforms.\nIN_PROC_BROWSER_TEST_F(CrashRecoveryBrowserTest, DISABLED_LoadInNewTab) {\n const FilePath::CharType* kTitle2File = FILE_PATH_LITERAL(\"title2.html\");\n\n ui_test_utils::NavigateToURL(browser(),\n ui_test_utils::GetTestUrl(FilePath(FilePath::kCurrentDirectory),\n FilePath(kTitle2File)));\n\n string16 title_before_crash;\n string16 title_after_crash;\n\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_before_crash));\n SimulateRendererCrash(browser());\n browser()->Reload(CURRENT_TAB);\n ASSERT_TRUE(ui_test_utils::WaitForNavigationInCurrentTab(browser()));\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_after_crash));\n EXPECT_EQ(title_before_crash, title_after_crash);\n}\n<commit_msg>Disable CrashRecoveryBrowserTest.Reload, flakily times out<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_path.h\"\n#include \"chrome\/browser\/tab_contents\/navigation_entry.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"chrome\/common\/page_transition_types.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nvoid SimulateRendererCrash(Browser* browser) {\n browser->OpenURL(GURL(chrome::kAboutCrashURL), GURL(), CURRENT_TAB,\n PageTransition::TYPED);\n ui_test_utils::WaitForNotification(\n NotificationType::TAB_CONTENTS_DISCONNECTED);\n}\n\n} \/\/ namespace\n\nclass CrashRecoveryBrowserTest : public InProcessBrowserTest {\n};\n\n\/\/ Test that reload works after a crash.\n\/\/ Disabled, http:\/\/crbug.com\/29331, http:\/\/crbug.com\/69637.\nIN_PROC_BROWSER_TEST_F(CrashRecoveryBrowserTest, DISABLED_Reload) {\n \/\/ The title of the active tab should change each time this URL is loaded.\n GURL url(\n \"data:text\/html,<script>document.title=new Date().valueOf()<\/script>\");\n ui_test_utils::NavigateToURL(browser(), url);\n\n string16 title_before_crash;\n string16 title_after_crash;\n\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_before_crash));\n SimulateRendererCrash(browser());\n browser()->Reload(CURRENT_TAB);\n ASSERT_TRUE(ui_test_utils::WaitForNavigationInCurrentTab(browser()));\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_after_crash));\n EXPECT_NE(title_before_crash, title_after_crash);\n}\n\n\/\/ Tests that loading a crashed page in a new tab correctly updates the title.\n\/\/ There was an earlier bug (1270510) in process-per-site in which the max page\n\/\/ ID of the RenderProcessHost was stale, so the NavigationEntry in the new tab\n\/\/ was not committed. This prevents regression of that bug.\n\/\/ http:\/\/crbug.com\/57158 - Times out sometimes on all platforms.\nIN_PROC_BROWSER_TEST_F(CrashRecoveryBrowserTest, DISABLED_LoadInNewTab) {\n const FilePath::CharType* kTitle2File = FILE_PATH_LITERAL(\"title2.html\");\n\n ui_test_utils::NavigateToURL(browser(),\n ui_test_utils::GetTestUrl(FilePath(FilePath::kCurrentDirectory),\n FilePath(kTitle2File)));\n\n string16 title_before_crash;\n string16 title_after_crash;\n\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_before_crash));\n SimulateRendererCrash(browser());\n browser()->Reload(CURRENT_TAB);\n ASSERT_TRUE(ui_test_utils::WaitForNavigationInCurrentTab(browser()));\n ASSERT_TRUE(ui_test_utils::GetCurrentTabTitle(browser(),\n &title_after_crash));\n EXPECT_EQ(title_before_crash, title_after_crash);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/constrained_window_gtk.h\"\n\n#include <gdk\/gdkkeysyms.h>\n\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/gtk\/gtk_util.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_view_gtk.h\"\n\nConstrainedWindowGtk::ConstrainedWindowGtk(\n TabContents* owner, ConstrainedWindowGtkDelegate* delegate)\n : owner_(owner),\n delegate_(delegate),\n visible_(false),\n accel_group_(gtk_accel_group_new()) {\n DCHECK(owner);\n DCHECK(delegate);\n GtkWidget* dialog = delegate->GetWidgetRoot();\n\n \/\/ Unlike other users of CreateBorderBin, we need a dedicated frame around\n \/\/ our \"window\".\n GtkWidget* ebox = gtk_event_box_new();\n GtkWidget* frame = gtk_frame_new(NULL);\n gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(alignment),\n gtk_util::kContentAreaBorder, gtk_util::kContentAreaBorder,\n gtk_util::kContentAreaBorder, gtk_util::kContentAreaBorder);\n gtk_container_add(GTK_CONTAINER(alignment), dialog);\n gtk_container_add(GTK_CONTAINER(frame), alignment);\n gtk_container_add(GTK_CONTAINER(ebox), frame);\n border_.Own(ebox);\n ConnectAccelerators();\n}\n\nConstrainedWindowGtk::~ConstrainedWindowGtk() {\n border_.Destroy();\n\n gtk_accel_group_disconnect_key(accel_group_, GDK_Escape,\n static_cast<GdkModifierType>(0));\n gtk_window_remove_accel_group(\n GTK_WINDOW(ContainingView()->GetTopLevelNativeWindow()),\n accel_group_);\n g_object_unref(accel_group_);\n}\n\nvoid ConstrainedWindowGtk::ShowConstrainedWindow() {\n gtk_widget_show_all(border_.get());\n\n \/\/ We collaborate with TabContentsViewGtk and stick ourselves in the\n \/\/ TabContentsViewGtk's floating container.\n ContainingView()->AttachConstrainedWindow(this);\n\n visible_ = true;\n}\n\nvoid ConstrainedWindowGtk::CloseConstrainedWindow() {\n if (visible_)\n ContainingView()->RemoveConstrainedWindow(this);\n delegate_->DeleteDelegate();\n owner_->WillClose(this);\n\n delete this;\n}\n\nTabContentsViewGtk* ConstrainedWindowGtk::ContainingView() {\n return static_cast<TabContentsViewGtk*>(owner_->view());\n}\n\nvoid ConstrainedWindowGtk::ConnectAccelerators() {\n gtk_accel_group_connect(accel_group_,\n GDK_Escape, static_cast<GdkModifierType>(0),\n static_cast<GtkAccelFlags>(0),\n g_cclosure_new(G_CALLBACK(OnEscapeThunk),\n this, NULL));\n gtk_window_add_accel_group(\n GTK_WINDOW(ContainingView()->GetTopLevelNativeWindow()),\n accel_group_);\n}\n\n\ngboolean ConstrainedWindowGtk::OnEscape() {\n \/\/ Handle this accelerator only if this is on the currently selected tab.\n Browser* browser = BrowserList::GetLastActive();\n if (!browser || browser->GetSelectedTabContents() != owner_)\n return FALSE;\n\n CloseConstrainedWindow();\n return TRUE;\n}\n\n\/\/ static\nConstrainedWindow* ConstrainedWindow::CreateConstrainedDialog(\n TabContents* parent,\n ConstrainedWindowGtkDelegate* delegate) {\n return new ConstrainedWindowGtk(parent, delegate);\n}\n\n<commit_msg>Fix for LoginPromptTesti.CancelRedundantAuths and related tests on linux views.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/gtk\/constrained_window_gtk.h\"\n\n#include <gdk\/gdkkeysyms.h>\n\n#include \"chrome\/browser\/browser_list.h\"\n#include \"chrome\/browser\/gtk\/gtk_util.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents.h\"\n#include \"chrome\/browser\/tab_contents\/tab_contents_view_gtk.h\"\n\nConstrainedWindowGtk::ConstrainedWindowGtk(\n TabContents* owner, ConstrainedWindowGtkDelegate* delegate)\n : owner_(owner),\n delegate_(delegate),\n visible_(false),\n accel_group_(gtk_accel_group_new()) {\n DCHECK(owner);\n DCHECK(delegate);\n GtkWidget* dialog = delegate->GetWidgetRoot();\n\n \/\/ Unlike other users of CreateBorderBin, we need a dedicated frame around\n \/\/ our \"window\".\n GtkWidget* ebox = gtk_event_box_new();\n GtkWidget* frame = gtk_frame_new(NULL);\n gtk_frame_set_shadow_type(GTK_FRAME(frame), GTK_SHADOW_OUT);\n GtkWidget* alignment = gtk_alignment_new(0.0, 0.0, 1.0, 1.0);\n gtk_alignment_set_padding(GTK_ALIGNMENT(alignment),\n gtk_util::kContentAreaBorder, gtk_util::kContentAreaBorder,\n gtk_util::kContentAreaBorder, gtk_util::kContentAreaBorder);\n gtk_container_add(GTK_CONTAINER(alignment), dialog);\n gtk_container_add(GTK_CONTAINER(frame), alignment);\n gtk_container_add(GTK_CONTAINER(ebox), frame);\n border_.Own(ebox);\n ConnectAccelerators();\n}\n\nConstrainedWindowGtk::~ConstrainedWindowGtk() {\n border_.Destroy();\n\n gtk_accel_group_disconnect_key(accel_group_, GDK_Escape,\n static_cast<GdkModifierType>(0));\n if (ContainingView() && ContainingView()->GetTopLevelNativeWindow()) {\n gtk_window_remove_accel_group(\n GTK_WINDOW(ContainingView()->GetTopLevelNativeWindow()),\n accel_group_);\n }\n g_object_unref(accel_group_);\n}\n\nvoid ConstrainedWindowGtk::ShowConstrainedWindow() {\n gtk_widget_show_all(border_.get());\n\n \/\/ We collaborate with TabContentsViewGtk and stick ourselves in the\n \/\/ TabContentsViewGtk's floating container.\n ContainingView()->AttachConstrainedWindow(this);\n\n visible_ = true;\n}\n\nvoid ConstrainedWindowGtk::CloseConstrainedWindow() {\n if (visible_)\n ContainingView()->RemoveConstrainedWindow(this);\n delegate_->DeleteDelegate();\n owner_->WillClose(this);\n\n delete this;\n}\n\nTabContentsViewGtk* ConstrainedWindowGtk::ContainingView() {\n return static_cast<TabContentsViewGtk*>(owner_->view());\n}\n\nvoid ConstrainedWindowGtk::ConnectAccelerators() {\n gtk_accel_group_connect(accel_group_,\n GDK_Escape, static_cast<GdkModifierType>(0),\n static_cast<GtkAccelFlags>(0),\n g_cclosure_new(G_CALLBACK(OnEscapeThunk),\n this, NULL));\n gtk_window_add_accel_group(\n GTK_WINDOW(ContainingView()->GetTopLevelNativeWindow()),\n accel_group_);\n}\n\n\ngboolean ConstrainedWindowGtk::OnEscape() {\n \/\/ Handle this accelerator only if this is on the currently selected tab.\n Browser* browser = BrowserList::GetLastActive();\n if (!browser || browser->GetSelectedTabContents() != owner_)\n return FALSE;\n\n CloseConstrainedWindow();\n return TRUE;\n}\n\n\/\/ static\nConstrainedWindow* ConstrainedWindow::CreateConstrainedDialog(\n TabContents* parent,\n ConstrainedWindowGtkDelegate* delegate) {\n return new ConstrainedWindowGtk(parent, delegate);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* exception_handler.cc\n Jeremy Barnes, 26 February 2008\n Copyright (c) 2009 Jeremy Barnes. All rights reserved.\n\n*\/\n\n#include <cxxabi.h>\n#include <cstring>\n#include <fstream>\n\n#include \"jml\/compiler\/compiler.h\"\n#include \"jml\/utils\/environment.h\"\n\n#include \"backtrace.h\"\n#include \"demangle.h\"\n#include \"exception.h\"\n#include \"exception_hook.h\"\n#include \"format.h\"\n#include \"threads.h\"\n\n\nusing namespace std;\n\n\nnamespace ML {\n\nvoid (*exception_tracer) (void *, const std::type_info *) JML_WEAK_FN = 0;\n\nEnv_Option<bool> TRACE_EXCEPTIONS(\"JML_TRACE_EXCEPTIONS\", true);\n\n__thread bool trace_exceptions = false;\n__thread bool trace_exceptions_initialized = false;\n\nvoid set_default_trace_exceptions(bool val)\n{\n TRACE_EXCEPTIONS.set(val);\n}\n\nbool get_default_trace_exceptions()\n{\n return TRACE_EXCEPTIONS;\n}\n\nvoid set_trace_exceptions(bool trace)\n{\n \/\/cerr << \"set_trace_exceptions to \" << trace << \" at \" << &trace_exceptions\n \/\/ << endl;\n trace_exceptions = trace;\n trace_exceptions_initialized = true;\n}\n\nbool get_trace_exceptions()\n{\n if (!trace_exceptions_initialized) {\n \/\/cerr << \"trace_exceptions initialized to = \"\n \/\/ << trace_exceptions << \" at \" << &trace_exceptions << endl;\n set_trace_exceptions(TRACE_EXCEPTIONS);\n trace_exceptions_initialized = true;\n }\n \n \/\/cerr << \"get_trace_exceptions returned \" << trace_exceptions\n \/\/ << \" at \" << &trace_exceptions << endl;\n\n return trace_exceptions;\n}\n\n\nstatic const std::exception *\nto_std_exception(void* object, const std::type_info * tinfo)\n{\n \/* Check if its a class. If not, we can't see if it's a std::exception.\n The abi::__class_type_info is the base class of all types of type\n info for types that are classes (of which std::exception is one).\n *\/\n const abi::__class_type_info * ctinfo\n = dynamic_cast<const abi::__class_type_info *>(tinfo);\n\n if (!ctinfo) return 0;\n\n \/* The thing thrown was an object. Now, check if it is derived from\n std::exception. *\/\n const std::type_info * etinfo = &typeid(std::exception);\n\n \/* See if the exception could catch this. This is the mechanism\n used internally by the compiler in catch {} blocks to see if\n the exception matches the catch type.\n\n In the case of success, the object will be adjusted to point to\n the start of the std::exception object.\n *\/\n void * obj_ptr = object;\n bool can_catch = etinfo->__do_catch(tinfo, &obj_ptr, 0);\n\n if (!can_catch) return 0;\n\n \/* obj_ptr points to a std::exception; extract it and get the\n exception message.\n *\/\n return (const std::exception *)obj_ptr;\n}\n\n\/** We install this handler for when an exception is thrown. *\/\n\nvoid trace_exception(void * object, const std::type_info * tinfo)\n{\n \/\/cerr << \"trace_exception: trace_exceptions = \" << get_trace_exceptions()\n \/\/ << \" at \" << &trace_exceptions << endl;\n\n if (!get_trace_exceptions()) return;\n\n const std::exception * exc = to_std_exception(object, tinfo);\n\n \/\/ We don't want these exceptions to be printed out.\n if (dynamic_cast<const ML::SilentException *>(exc)) return;\n\n \/* avoid allocations when std::bad_alloc is thrown *\/\n bool noAlloc = dynamic_cast<const std::bad_alloc *>(exc);\n\n size_t bufferSize(1024*1024);\n char buffer[bufferSize];\n char datetime[128];\n size_t totalWritten(0), written, remaining(bufferSize);\n\n time_t now;\n time(&now);\n strftime(datetime, sizeof(datetime), \"%FT%H:%M:%S\", localtime(&now));\n\n const char * demangled;\n char * heapDemangled;\n if (noAlloc) {\n heapDemangled = nullptr;\n demangled = \"std::bad_alloc\";\n }\n else {\n heapDemangled = char_demangle(tinfo->name());\n demangled = heapDemangled;\n }\n auto pid = getpid();\n auto tid = gettid();\n\n written = ::snprintf(buffer, remaining,\n \"\\n\"\n \"--------------------------[Exception thrown]\"\n \"---------------------------\\n\"\n \"time: %s\\n\"\n \"type: %s\\n\"\n \"pid: %d; tid: %d\\n\",\n datetime, demangled, pid, tid);\n if (heapDemangled) {\n free(heapDemangled);\n }\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n\n if (exc) {\n written = snprintf(buffer + totalWritten, remaining,\n \"what: %s\\n\", exc->what());\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n }\n\n if (noAlloc) {\n goto end;\n }\n\n written = snprintf(buffer + totalWritten, remaining, \"stack:\\n\");\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n\n written = backtrace(buffer + totalWritten, remaining, 3);\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n\n if (totalWritten < bufferSize - 1) {\n strcpy(buffer + totalWritten, \"\\n\");\n }\n\nend:\n cerr << buffer;\n\n char const * reports = getenv(\"ENABLE_EXCEPTION_REPORTS\");\n if (!noAlloc && reports) {\n std::string path = ML::format(\"%s\/exception-report-%s-%d-%d.log\",\n reports, datetime, pid, tid);\n\n std::ofstream file(path, std::ios_base::app);\n if(file) {\n file << getenv(\"_\") << endl;\n backtrace(file, 3);\n file.close();\n }\n }\n}\n\nnamespace {\nstruct Install_Handler {\n Install_Handler()\n {\n \/\/cerr << \"installing exception tracer\" << endl;\n exception_tracer = trace_exception;\n }\n ~Install_Handler()\n {\n if (exception_tracer == trace_exception)\n exception_tracer = 0;\n }\n} install_handler;\n\n} \/\/ file scope\n\n} \/\/ namespace ML\n<commit_msg>PLAT-605: make use of \"localtime_r\" rather than \"localtime\", which is not thread safe and can cause deadlocks within the libc<commit_after>\/* exception_handler.cc\n Jeremy Barnes, 26 February 2008\n Copyright (c) 2009 Jeremy Barnes. All rights reserved.\n\n*\/\n\n#include <cxxabi.h>\n#include <cstring>\n#include <fstream>\n\n#include \"jml\/compiler\/compiler.h\"\n#include \"jml\/utils\/environment.h\"\n\n#include \"backtrace.h\"\n#include \"demangle.h\"\n#include \"exception.h\"\n#include \"exception_hook.h\"\n#include \"format.h\"\n#include \"threads.h\"\n\n\nusing namespace std;\n\n\nnamespace ML {\n\nvoid (*exception_tracer) (void *, const std::type_info *) JML_WEAK_FN = 0;\n\nEnv_Option<bool> TRACE_EXCEPTIONS(\"JML_TRACE_EXCEPTIONS\", true);\n\n__thread bool trace_exceptions = false;\n__thread bool trace_exceptions_initialized = false;\n\nvoid set_default_trace_exceptions(bool val)\n{\n TRACE_EXCEPTIONS.set(val);\n}\n\nbool get_default_trace_exceptions()\n{\n return TRACE_EXCEPTIONS;\n}\n\nvoid set_trace_exceptions(bool trace)\n{\n \/\/cerr << \"set_trace_exceptions to \" << trace << \" at \" << &trace_exceptions\n \/\/ << endl;\n trace_exceptions = trace;\n trace_exceptions_initialized = true;\n}\n\nbool get_trace_exceptions()\n{\n if (!trace_exceptions_initialized) {\n \/\/cerr << \"trace_exceptions initialized to = \"\n \/\/ << trace_exceptions << \" at \" << &trace_exceptions << endl;\n set_trace_exceptions(TRACE_EXCEPTIONS);\n trace_exceptions_initialized = true;\n }\n \n \/\/cerr << \"get_trace_exceptions returned \" << trace_exceptions\n \/\/ << \" at \" << &trace_exceptions << endl;\n\n return trace_exceptions;\n}\n\n\nstatic const std::exception *\nto_std_exception(void* object, const std::type_info * tinfo)\n{\n \/* Check if its a class. If not, we can't see if it's a std::exception.\n The abi::__class_type_info is the base class of all types of type\n info for types that are classes (of which std::exception is one).\n *\/\n const abi::__class_type_info * ctinfo\n = dynamic_cast<const abi::__class_type_info *>(tinfo);\n\n if (!ctinfo) return 0;\n\n \/* The thing thrown was an object. Now, check if it is derived from\n std::exception. *\/\n const std::type_info * etinfo = &typeid(std::exception);\n\n \/* See if the exception could catch this. This is the mechanism\n used internally by the compiler in catch {} blocks to see if\n the exception matches the catch type.\n\n In the case of success, the object will be adjusted to point to\n the start of the std::exception object.\n *\/\n void * obj_ptr = object;\n bool can_catch = etinfo->__do_catch(tinfo, &obj_ptr, 0);\n\n if (!can_catch) return 0;\n\n \/* obj_ptr points to a std::exception; extract it and get the\n exception message.\n *\/\n return (const std::exception *)obj_ptr;\n}\n\n\/** We install this handler for when an exception is thrown. *\/\n\nvoid trace_exception(void * object, const std::type_info * tinfo)\n{\n \/\/cerr << \"trace_exception: trace_exceptions = \" << get_trace_exceptions()\n \/\/ << \" at \" << &trace_exceptions << endl;\n\n if (!get_trace_exceptions()) return;\n\n const std::exception * exc = to_std_exception(object, tinfo);\n\n \/\/ We don't want these exceptions to be printed out.\n if (dynamic_cast<const ML::SilentException *>(exc)) return;\n\n \/* avoid allocations when std::bad_alloc is thrown *\/\n bool noAlloc = dynamic_cast<const std::bad_alloc *>(exc);\n\n size_t bufferSize(1024*1024);\n char buffer[bufferSize];\n char datetime[128];\n size_t totalWritten(0), written, remaining(bufferSize);\n\n time_t now;\n time(&now);\n\n struct tm lt_tm;\n strftime(datetime, sizeof(datetime), \"%FT%H:%M:%S\",\n localtime_r(&now, <_tm));\n\n const char * demangled;\n char * heapDemangled;\n if (noAlloc) {\n heapDemangled = nullptr;\n demangled = \"std::bad_alloc\";\n }\n else {\n heapDemangled = char_demangle(tinfo->name());\n demangled = heapDemangled;\n }\n auto pid = getpid();\n auto tid = gettid();\n\n written = ::snprintf(buffer, remaining,\n \"\\n\"\n \"--------------------------[Exception thrown]\"\n \"---------------------------\\n\"\n \"time: %s\\n\"\n \"type: %s\\n\"\n \"pid: %d; tid: %d\\n\",\n datetime, demangled, pid, tid);\n if (heapDemangled) {\n free(heapDemangled);\n }\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n\n if (exc) {\n written = snprintf(buffer + totalWritten, remaining,\n \"what: %s\\n\", exc->what());\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n }\n\n if (noAlloc) {\n goto end;\n }\n\n written = snprintf(buffer + totalWritten, remaining, \"stack:\\n\");\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n remaining -= written;\n\n written = backtrace(buffer + totalWritten, remaining, 3);\n if (written >= remaining) {\n goto end;\n }\n totalWritten += written;\n\n if (totalWritten < bufferSize - 1) {\n strcpy(buffer + totalWritten, \"\\n\");\n }\n\nend:\n cerr << buffer;\n\n char const * reports = getenv(\"ENABLE_EXCEPTION_REPORTS\");\n if (!noAlloc && reports) {\n std::string path = ML::format(\"%s\/exception-report-%s-%d-%d.log\",\n reports, datetime, pid, tid);\n\n std::ofstream file(path, std::ios_base::app);\n if(file) {\n file << getenv(\"_\") << endl;\n backtrace(file, 3);\n file.close();\n }\n }\n}\n\nnamespace {\nstruct Install_Handler {\n Install_Handler()\n {\n \/\/cerr << \"installing exception tracer\" << endl;\n exception_tracer = trace_exception;\n }\n ~Install_Handler()\n {\n if (exception_tracer == trace_exception)\n exception_tracer = 0;\n }\n} install_handler;\n\n} \/\/ file scope\n\n} \/\/ namespace ML\n<|endoftext|>"} {"text":"<commit_before>#ifndef __ENCODER_HPP\n#define __ENCODER_HPP\n\n#ifndef __ODRIVE_MAIN_H\n#error \"This file should not be included directly. Include odrive_main.h instead.\"\n#endif\n\nclass Encoder {\npublic:\n enum Error_t {\n ERROR_NONE = 0,\n ERROR_UNSTABLE_GAIN = 0x01,\n ERROR_CPR_OUT_OF_RANGE = 0x02,\n ERROR_NO_RESPONSE = 0x04,\n ERROR_UNSUPPORTED_ENCODER_MODE = 0x08,\n ERROR_ILLEGAL_HALL_STATE = 0x10,\n ERROR_INDEX_NOT_FOUND_YET = 0x20,\n };\n\n enum Mode_t {\n MODE_INCREMENTAL,\n MODE_HALL,\n MODE_SINCOS\n };\n\n struct Config_t {\n Encoder::Mode_t mode = Encoder::MODE_INCREMENTAL;\n bool use_index = false;\n bool pre_calibrated = false; \/\/ If true, this means the offset stored in\n \/\/ configuration is valid and does not need\n \/\/ be determined by run_offset_calibration.\n \/\/ In this case the encoder will enter ready\n \/\/ state as soon as the index is found.\n bool zero_count_on_find_idx = true;\n int32_t cpr = (2048 * 4); \/\/ Default resolution of CUI-AMT102 encoder,\n int32_t offset = 0; \/\/ Offset between encoder count and rotor electrical phase\n float offset_float = 0.0f; \/\/ Sub-count phase alignment offset\n bool enable_phase_interpolation = true; \/\/ Use velocity to interpolate inside the count state\n float calib_range = 0.02f; \/\/ Accuracy required to pass encoder cpr check\n float calib_scan_distance = 16.0f * M_PI; \/\/ rad electrical\n float calib_scan_omega = 4.0f * M_PI; \/\/ rad\/s electrical\n float bandwidth = 1000.0f;\n bool find_idx_on_lockin_only = false; \/\/ Only be sensitive during lockin scan constant vel state\n bool idx_search_unidirectional = false; \/\/ Only allow index search in known direction\n bool ignore_illegal_hall_state = false; \/\/ dont error on bad states like 000 or 111\n };\n\n Encoder(const EncoderHardwareConfig_t& hw_config,\n Config_t& config);\n \n void setup();\n void set_error(Error_t error);\n bool do_checks();\n\n void enc_index_cb();\n void set_idx_subscribe(bool override_enable = false);\n void update_pll_gains();\n void check_pre_calibrated();\n\n void set_linear_count(int32_t count);\n void set_circular_count(int32_t count, bool update_offset);\n bool calib_enc_offset(float voltage_magnitude);\n\n bool run_index_search();\n bool run_direction_find();\n bool run_offset_calibration();\n void sample_now();\n bool update();\n\n\n\n const EncoderHardwareConfig_t& hw_config_;\n Config_t& config_;\n Axis* axis_ = nullptr; \/\/ set by Axis constructor\n\n Error_t error_ = ERROR_NONE;\n bool index_found_ = false;\n bool is_ready_ = false;\n int32_t shadow_count_ = 0;\n int32_t count_in_cpr_ = 0;\n float interpolation_ = 0.0f;\n float phase_ = 0.0f; \/\/ [count]\n float pos_estimate_ = 0.0f; \/\/ [count]\n float pos_cpr_ = 0.0f; \/\/ [count]\n float vel_estimate_ = 0.0f; \/\/ [count\/s]\n float pll_kp_ = 0.0f; \/\/ [count\/s \/ count]\n float pll_ki_ = 0.0f; \/\/ [(count\/s^2) \/ count]\n float calib_scan_response_ = 0.0f; \/\/ debug report from offset calib\n\n int16_t tim_cnt_sample_ = 0; \/\/ \n \/\/ Updated by low_level pwm_adc_cb\n uint8_t hall_state_ = 0x0; \/\/ bit[0] = HallA, .., bit[2] = HallC\n float sincos_sample_s_ = 0.0f;\n float sincos_sample_c_ = 0.0f;\n\n \/\/ Communication protocol definitions\n auto make_protocol_definitions() {\n return make_protocol_member_list(\n make_protocol_property(\"error\", &error_),\n make_protocol_property(\"is_ready\", &is_ready_),\n make_protocol_property(\"index_found\", const_cast<bool*>(&index_found_)),\n make_protocol_property(\"shadow_count\", &shadow_count_),\n make_protocol_property(\"count_in_cpr\", &count_in_cpr_),\n make_protocol_property(\"interpolation\", &interpolation_),\n make_protocol_ro_property(\"phase\", &phase_),\n make_protocol_property(\"pos_estimate\", &pos_estimate_),\n make_protocol_property(\"pos_cpr\", &pos_cpr_),\n make_protocol_ro_property(\"hall_state\", &hall_state_),\n make_protocol_property(\"vel_estimate\", &vel_estimate_),\n make_protocol_ro_property(\"calib_scan_response\", &calib_scan_response_),\n \/\/ make_protocol_property(\"pll_kp\", &pll_kp_),\n \/\/ make_protocol_property(\"pll_ki\", &pll_ki_),\n make_protocol_object(\"config\",\n make_protocol_property(\"mode\", &config_.mode),\n make_protocol_property(\"use_index\", &config_.use_index,\n [](void* ctx) { static_cast<Encoder*>(ctx)->set_idx_subscribe(); }, this),\n make_protocol_property(\"find_idx_on_lockin_only\", &config_.find_idx_on_lockin_only,\n [](void* ctx) { static_cast<Encoder*>(ctx)->set_idx_subscribe(); }, this),\n make_protocol_property(\"pre_calibrated\", &config_.pre_calibrated,\n [](void* ctx) { static_cast<Encoder*>(ctx)->check_pre_calibrated(); }, this),\n make_protocol_property(\"zero_count_on_find_idx\", &config_.zero_count_on_find_idx),\n make_protocol_property(\"cpr\", &config_.cpr),\n make_protocol_property(\"offset\", &config_.offset),\n make_protocol_property(\"offset_float\", &config_.offset_float),\n make_protocol_property(\"enable_phase_interpolation\", &config_.enable_phase_interpolation),\n make_protocol_property(\"bandwidth\", &config_.bandwidth,\n [](void* ctx) { static_cast<Encoder*>(ctx)->update_pll_gains(); }, this),\n make_protocol_property(\"calib_range\", &config_.calib_range),\n make_protocol_property(\"calib_scan_distance\", &config_.calib_scan_distance),\n make_protocol_property(\"calib_scan_omega\", &config_.calib_scan_omega),\n make_protocol_property(\"idx_search_unidirectional\", &config_.idx_search_unidirectional),\n make_protocol_property(\"ignore_illegal_hall_state\", &config_.ignore_illegal_hall_state)\n ),\n make_protocol_function(\"set_linear_count\", *this, &Encoder::set_linear_count, \"count\")\n );\n }\n};\n\nDEFINE_ENUM_FLAG_OPERATORS(Encoder::Error_t)\n\n#endif \/\/ __ENCODER_HPP\n<commit_msg>Make encoder properties read-only<commit_after>#ifndef __ENCODER_HPP\n#define __ENCODER_HPP\n\n#ifndef __ODRIVE_MAIN_H\n#error \"This file should not be included directly. Include odrive_main.h instead.\"\n#endif\n\nclass Encoder {\npublic:\n enum Error_t {\n ERROR_NONE = 0,\n ERROR_UNSTABLE_GAIN = 0x01,\n ERROR_CPR_OUT_OF_RANGE = 0x02,\n ERROR_NO_RESPONSE = 0x04,\n ERROR_UNSUPPORTED_ENCODER_MODE = 0x08,\n ERROR_ILLEGAL_HALL_STATE = 0x10,\n ERROR_INDEX_NOT_FOUND_YET = 0x20,\n };\n\n enum Mode_t {\n MODE_INCREMENTAL,\n MODE_HALL,\n MODE_SINCOS\n };\n\n struct Config_t {\n Encoder::Mode_t mode = Encoder::MODE_INCREMENTAL;\n bool use_index = false;\n bool pre_calibrated = false; \/\/ If true, this means the offset stored in\n \/\/ configuration is valid and does not need\n \/\/ be determined by run_offset_calibration.\n \/\/ In this case the encoder will enter ready\n \/\/ state as soon as the index is found.\n bool zero_count_on_find_idx = true;\n int32_t cpr = (2048 * 4); \/\/ Default resolution of CUI-AMT102 encoder,\n int32_t offset = 0; \/\/ Offset between encoder count and rotor electrical phase\n float offset_float = 0.0f; \/\/ Sub-count phase alignment offset\n bool enable_phase_interpolation = true; \/\/ Use velocity to interpolate inside the count state\n float calib_range = 0.02f; \/\/ Accuracy required to pass encoder cpr check\n float calib_scan_distance = 16.0f * M_PI; \/\/ rad electrical\n float calib_scan_omega = 4.0f * M_PI; \/\/ rad\/s electrical\n float bandwidth = 1000.0f;\n bool find_idx_on_lockin_only = false; \/\/ Only be sensitive during lockin scan constant vel state\n bool idx_search_unidirectional = false; \/\/ Only allow index search in known direction\n bool ignore_illegal_hall_state = false; \/\/ dont error on bad states like 000 or 111\n };\n\n Encoder(const EncoderHardwareConfig_t& hw_config,\n Config_t& config);\n \n void setup();\n void set_error(Error_t error);\n bool do_checks();\n\n void enc_index_cb();\n void set_idx_subscribe(bool override_enable = false);\n void update_pll_gains();\n void check_pre_calibrated();\n\n void set_linear_count(int32_t count);\n void set_circular_count(int32_t count, bool update_offset);\n bool calib_enc_offset(float voltage_magnitude);\n\n bool run_index_search();\n bool run_direction_find();\n bool run_offset_calibration();\n void sample_now();\n bool update();\n\n\n\n const EncoderHardwareConfig_t& hw_config_;\n Config_t& config_;\n Axis* axis_ = nullptr; \/\/ set by Axis constructor\n\n Error_t error_ = ERROR_NONE;\n bool index_found_ = false;\n bool is_ready_ = false;\n int32_t shadow_count_ = 0;\n int32_t count_in_cpr_ = 0;\n float interpolation_ = 0.0f;\n float phase_ = 0.0f; \/\/ [count]\n float pos_estimate_ = 0.0f; \/\/ [count]\n float pos_cpr_ = 0.0f; \/\/ [count]\n float vel_estimate_ = 0.0f; \/\/ [count\/s]\n float pll_kp_ = 0.0f; \/\/ [count\/s \/ count]\n float pll_ki_ = 0.0f; \/\/ [(count\/s^2) \/ count]\n float calib_scan_response_ = 0.0f; \/\/ debug report from offset calib\n\n int16_t tim_cnt_sample_ = 0; \/\/ \n \/\/ Updated by low_level pwm_adc_cb\n uint8_t hall_state_ = 0x0; \/\/ bit[0] = HallA, .., bit[2] = HallC\n float sincos_sample_s_ = 0.0f;\n float sincos_sample_c_ = 0.0f;\n\n \/\/ Communication protocol definitions\n auto make_protocol_definitions() {\n return make_protocol_member_list(\n make_protocol_property(\"error\", &error_),\n make_protocol_ro_property(\"is_ready\", &is_ready_),\n make_protocol_ro_property(\"index_found\", const_cast<bool*>(&index_found_)),\n make_protocol_ro_property(\"shadow_count\", &shadow_count_),\n make_protocol_ro_property(\"count_in_cpr\", &count_in_cpr_),\n make_protocol_ro_property(\"interpolation\", &interpolation_),\n make_protocol_ro_property(\"phase\", &phase_),\n make_protocol_ro_property(\"pos_estimate\", &pos_estimate_),\n make_protocol_ro_property(\"pos_cpr\", &pos_cpr_),\n make_protocol_ro_property(\"hall_state\", &hall_state_),\n make_protocol_ro_property(\"vel_estimate\", &vel_estimate_),\n make_protocol_ro_property(\"calib_scan_response\", &calib_scan_response_),\n \/\/ make_protocol_property(\"pll_kp\", &pll_kp_),\n \/\/ make_protocol_property(\"pll_ki\", &pll_ki_),\n make_protocol_object(\"config\",\n make_protocol_property(\"mode\", &config_.mode),\n make_protocol_property(\"use_index\", &config_.use_index,\n [](void* ctx) { static_cast<Encoder*>(ctx)->set_idx_subscribe(); }, this),\n make_protocol_property(\"find_idx_on_lockin_only\", &config_.find_idx_on_lockin_only,\n [](void* ctx) { static_cast<Encoder*>(ctx)->set_idx_subscribe(); }, this),\n make_protocol_property(\"pre_calibrated\", &config_.pre_calibrated,\n [](void* ctx) { static_cast<Encoder*>(ctx)->check_pre_calibrated(); }, this),\n make_protocol_property(\"zero_count_on_find_idx\", &config_.zero_count_on_find_idx),\n make_protocol_property(\"cpr\", &config_.cpr),\n make_protocol_property(\"offset\", &config_.offset),\n make_protocol_property(\"offset_float\", &config_.offset_float),\n make_protocol_property(\"enable_phase_interpolation\", &config_.enable_phase_interpolation),\n make_protocol_property(\"bandwidth\", &config_.bandwidth,\n [](void* ctx) { static_cast<Encoder*>(ctx)->update_pll_gains(); }, this),\n make_protocol_property(\"calib_range\", &config_.calib_range),\n make_protocol_property(\"calib_scan_distance\", &config_.calib_scan_distance),\n make_protocol_property(\"calib_scan_omega\", &config_.calib_scan_omega),\n make_protocol_property(\"idx_search_unidirectional\", &config_.idx_search_unidirectional),\n make_protocol_property(\"ignore_illegal_hall_state\", &config_.ignore_illegal_hall_state)\n ),\n make_protocol_function(\"set_linear_count\", *this, &Encoder::set_linear_count, \"count\")\n );\n }\n};\n\nDEFINE_ENUM_FLAG_OPERATORS(Encoder::Error_t)\n\n#endif \/\/ __ENCODER_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\n\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/net\/url_fixer_upper.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\nconst FilePath::CharType kDocRoot[] = FILE_PATH_LITERAL(\"chrome\/test\/data\");\n\n} \/\/ namespace\n\ntypedef UITest RepostFormWarningTest;\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/47228\n#define MAYBE_TestDoubleReload FLAKY_TestDoubleReload\n#else\n#define MAYBE_TestDoubleReload TestDoubleReload\n#endif\n\nTEST_F(RepostFormWarningTest, MAYBE_TestDoubleReload) {\n net::TestServer test_server(net::TestServer::TYPE_HTTP, FilePath(kDocRoot));\n ASSERT_TRUE(test_server.Start());\n\n scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n ASSERT_TRUE(browser.get());\n\n scoped_refptr<TabProxy> tab(browser->GetTab(0));\n ASSERT_TRUE(tab.get());\n\n \/\/ Load a form.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"files\/form.html\")));\n \/\/ Submit it.\n ASSERT_TRUE(tab->NavigateToURL(GURL(\n \"javascript:document.getElementById('form').submit()\")));\n\n \/\/ Try to reload it twice, checking for repost.\n tab->ReloadAsync();\n tab->ReloadAsync();\n\n \/\/ Navigate away from the page (this is when the test usually crashes).\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"bar\")));\n}\n\n#if defined(OS_WIN) || defined(OS_LINUX)\n\/\/ http:\/\/crbug.com\/47228 && http:\/\/crbug.com\/56401\n#define MAYBE_TestLoginAfterRepost FLAKY_TestLoginAfterRepost\n#else\n#define MAYBE_TestLoginAfterRepost TestLoginAfterRepost\n#endif\n\nTEST_F(RepostFormWarningTest, MAYBE_TestLoginAfterRepost) {\n net::TestServer test_server(net::TestServer::TYPE_HTTP, FilePath(kDocRoot));\n ASSERT_TRUE(test_server.Start());\n\n scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n ASSERT_TRUE(browser.get());\n\n scoped_refptr<TabProxy> tab(browser->GetTab(0));\n ASSERT_TRUE(tab.get());\n\n \/\/ Load a form.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"files\/form.html\")));\n \/\/ Submit it.\n ASSERT_TRUE(tab->NavigateToURL(GURL(\n \"javascript:document.getElementById('form').submit()\")));\n\n \/\/ Try to reload it, checking for repost.\n tab->ReloadAsync();\n\n \/\/ Navigate to a page that requires authentication, bringing up another\n \/\/ tab-modal sheet.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"auth-basic\")));\n\n \/\/ Try to reload it again.\n tab->ReloadAsync();\n\n \/\/ Navigate away from the page.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"bar\")));\n}\n<commit_msg>Remove the FLAKY mark from RepostFormWarningTest.TestLoginAfterRepost on Linux.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <string>\n\n#include \"chrome\/app\/chrome_dll_resource.h\"\n#include \"chrome\/browser\/net\/url_fixer_upper.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/url_constants.h\"\n#include \"chrome\/test\/automation\/tab_proxy.h\"\n#include \"chrome\/test\/automation\/browser_proxy.h\"\n#include \"chrome\/test\/ui\/ui_test.h\"\n#include \"net\/test\/test_server.h\"\n\nnamespace {\n\nconst FilePath::CharType kDocRoot[] = FILE_PATH_LITERAL(\"chrome\/test\/data\");\n\n} \/\/ namespace\n\ntypedef UITest RepostFormWarningTest;\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/47228\n#define MAYBE_TestDoubleReload FLAKY_TestDoubleReload\n#else\n#define MAYBE_TestDoubleReload TestDoubleReload\n#endif\n\nTEST_F(RepostFormWarningTest, MAYBE_TestDoubleReload) {\n net::TestServer test_server(net::TestServer::TYPE_HTTP, FilePath(kDocRoot));\n ASSERT_TRUE(test_server.Start());\n\n scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n ASSERT_TRUE(browser.get());\n\n scoped_refptr<TabProxy> tab(browser->GetTab(0));\n ASSERT_TRUE(tab.get());\n\n \/\/ Load a form.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"files\/form.html\")));\n \/\/ Submit it.\n ASSERT_TRUE(tab->NavigateToURL(GURL(\n \"javascript:document.getElementById('form').submit()\")));\n\n \/\/ Try to reload it twice, checking for repost.\n tab->ReloadAsync();\n tab->ReloadAsync();\n\n \/\/ Navigate away from the page (this is when the test usually crashes).\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"bar\")));\n}\n\n#if defined(OS_WIN)\n\/\/ http:\/\/crbug.com\/47228\n#define MAYBE_TestLoginAfterRepost FLAKY_TestLoginAfterRepost\n#else\n#define MAYBE_TestLoginAfterRepost TestLoginAfterRepost\n#endif\n\nTEST_F(RepostFormWarningTest, MAYBE_TestLoginAfterRepost) {\n net::TestServer test_server(net::TestServer::TYPE_HTTP, FilePath(kDocRoot));\n ASSERT_TRUE(test_server.Start());\n\n scoped_refptr<BrowserProxy> browser(automation()->GetBrowserWindow(0));\n ASSERT_TRUE(browser.get());\n\n scoped_refptr<TabProxy> tab(browser->GetTab(0));\n ASSERT_TRUE(tab.get());\n\n \/\/ Load a form.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"files\/form.html\")));\n \/\/ Submit it.\n ASSERT_TRUE(tab->NavigateToURL(GURL(\n \"javascript:document.getElementById('form').submit()\")));\n\n \/\/ Try to reload it, checking for repost.\n tab->ReloadAsync();\n\n \/\/ Navigate to a page that requires authentication, bringing up another\n \/\/ tab-modal sheet.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"auth-basic\")));\n\n \/\/ Try to reload it again.\n tab->ReloadAsync();\n\n \/\/ Navigate away from the page.\n ASSERT_TRUE(tab->NavigateToURL(test_server.GetURL(\"bar\")));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/input_window_dialog.h\"\n\n#include <gtk\/gtk.h>\n\n#include \"app\/gtk_signal.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/gtk\/gtk_util.h\"\n\nclass InputWindowDialogGtk : public InputWindowDialog {\n public:\n \/\/ Creates a dialog. Takes ownership of |delegate|.\n InputWindowDialogGtk(GtkWindow* parent,\n const std::string& window_title,\n const std::string& label,\n const std::string& contents,\n Delegate* delegate);\n virtual ~InputWindowDialogGtk();\n\n virtual void Show();\n virtual void Close();\n\n private:\n CHROMEG_CALLBACK_0(InputWindowDialogGtk, void, OnEntryChanged, GtkEditable*);\n CHROMEGTK_CALLBACK_1(InputWindowDialogGtk, void, OnResponse, int);\n CHROMEGTK_CALLBACK_1(InputWindowDialogGtk, gboolean,\n OnWindowDeleteEvent, GdkEvent*);\n CHROMEGTK_CALLBACK_0(InputWindowDialogGtk, void, OnWindowDestroy);\n\n \/\/ The underlying gtk dialog window.\n GtkWidget* dialog_;\n\n \/\/ The GtkEntry in this form.\n GtkWidget* input_;\n\n \/\/ Our delegate. Consumes the window's output.\n scoped_ptr<InputWindowDialog::Delegate> delegate_;\n};\n\n\nInputWindowDialogGtk::InputWindowDialogGtk(GtkWindow* parent,\n const std::string& window_title,\n const std::string& label,\n const std::string& contents,\n Delegate* delegate)\n : dialog_(gtk_dialog_new_with_buttons(\n window_title.c_str(),\n parent,\n GTK_DIALOG_MODAL,\n GTK_STOCK_CANCEL, GTK_RESPONSE_REJECT,\n GTK_STOCK_OK, GTK_RESPONSE_ACCEPT,\n NULL)),\n delegate_(delegate) {\n gtk_dialog_set_default_response(GTK_DIALOG(dialog_), GTK_RESPONSE_ACCEPT);\n gtk_dialog_set_has_separator(GTK_DIALOG(dialog_), FALSE);\n\n GtkWidget* content_area = GTK_DIALOG(dialog_)->vbox;\n gtk_box_set_spacing(GTK_BOX(content_area), 18);\n\n GtkWidget* hbox = gtk_hbox_new(FALSE, 6);\n GtkWidget* label_widget = gtk_label_new(label.c_str());\n gtk_box_pack_start(GTK_BOX(hbox), label_widget, FALSE, FALSE, 0);\n\n input_ = gtk_entry_new();\n gtk_entry_set_text(GTK_ENTRY(input_), contents.c_str());\n g_signal_connect(input_, \"changed\",\n G_CALLBACK(OnEntryChangedThunk), this);\n g_object_set(G_OBJECT(input_), \"activates-default\", TRUE, NULL);\n gtk_box_pack_start(GTK_BOX(hbox), input_, TRUE, TRUE, 0);\n\n gtk_widget_show_all(hbox);\n\n gtk_box_pack_start(GTK_BOX(content_area), hbox, FALSE, FALSE, 0);\n\n g_signal_connect(dialog_, \"response\",\n G_CALLBACK(OnResponseThunk), this);\n g_signal_connect(dialog_, \"delete-event\",\n G_CALLBACK(OnWindowDeleteEventThunk), this);\n g_signal_connect(dialog_, \"destroy\",\n G_CALLBACK(OnWindowDestroyThunk), this);\n}\n\nInputWindowDialogGtk::~InputWindowDialogGtk() {\n}\n\nvoid InputWindowDialogGtk::Show() {\n gtk_util::ShowDialog(dialog_);\n}\n\nvoid InputWindowDialogGtk::Close() {\n \/\/ Under the model that we've inherited from Windows, dialogs can receive\n \/\/ more than one Close() call inside the current message loop event.\n if (dialog_) {\n gtk_widget_destroy(GTK_WIDGET(dialog_));\n dialog_ = NULL;\n }\n}\n\nvoid InputWindowDialogGtk::OnEntryChanged(GtkEditable* entry) {\n std::wstring value(UTF8ToWide(gtk_entry_get_text(GTK_ENTRY(entry))));\n gtk_dialog_set_response_sensitive(GTK_DIALOG(dialog_),\n GTK_RESPONSE_ACCEPT,\n delegate_->IsValid(value));\n}\n\nvoid InputWindowDialogGtk::OnResponse(GtkWidget* dialog, int response_id) {\n if (response_id == GTK_RESPONSE_ACCEPT) {\n std::wstring value(UTF8ToWide(gtk_entry_get_text(GTK_ENTRY(input_))));\n delegate_->InputAccepted(value);\n } else {\n delegate_->InputCanceled();\n }\n Close();\n}\n\ngboolean InputWindowDialogGtk::OnWindowDeleteEvent(GtkWidget* widget,\n GdkEvent* event) {\n Close();\n\n \/\/ Return true to prevent the gtk dialog from being destroyed. Close will\n \/\/ destroy it for us and the default gtk_dialog_delete_event_handler() will\n \/\/ force the destruction without us being able to stop it.\n return TRUE;\n}\n\nvoid InputWindowDialogGtk::OnWindowDestroy(GtkWidget* widget) {\n MessageLoop::current()->DeleteSoon(FROM_HERE, this);\n}\n\nInputWindowDialog* InputWindowDialog::Create(gfx::NativeWindow parent,\n const std::wstring& window_title,\n const std::wstring& label,\n const std::wstring& contents,\n Delegate* delegate) {\n return new InputWindowDialogGtk(parent,\n WideToUTF8(window_title),\n WideToUTF8(label),\n WideToUTF8(contents),\n delegate);\n}\n<commit_msg>gtk: Do not make folder editor dialog resizable.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/ui\/input_window_dialog.h\"\n\n#include <gtk\/gtk.h>\n\n#include \"app\/gtk_signal.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/scoped_ptr.h\"\n#include \"base\/string_piece.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/gtk\/gtk_util.h\"\n\nclass InputWindowDialogGtk : public InputWindowDialog {\n public:\n \/\/ Creates a dialog. Takes ownership of |delegate|.\n InputWindowDialogGtk(GtkWindow* parent,\n const std::string& window_title,\n const std::string& label,\n const std::string& contents,\n Delegate* delegate);\n virtual ~InputWindowDialogGtk();\n\n virtual void Show();\n virtual void Close();\n\n private:\n CHROMEG_CALLBACK_0(InputWindowDialogGtk, void, OnEntryChanged, GtkEditable*);\n CHROMEGTK_CALLBACK_1(InputWindowDialogGtk, void, OnResponse, int);\n CHROMEGTK_CALLBACK_1(InputWindowDialogGtk, gboolean,\n OnWindowDeleteEvent, GdkEvent*);\n CHROMEGTK_CALLBACK_0(InputWindowDialogGtk, void, OnWindowDestroy);\n\n \/\/ The underlying gtk dialog window.\n GtkWidget* dialog_;\n\n \/\/ The GtkEntry in this form.\n GtkWidget* input_;\n\n \/\/ Our delegate. Consumes the window's output.\n scoped_ptr<InputWindowDialog::Delegate> delegate_;\n};\n\n\nInputWindowDialogGtk::InputWindowDialogGtk(GtkWindow* parent,\n const std::string& window_title,\n const std::string& label,\n const std::string& contents,\n Delegate* delegate)\n : dialog_(gtk_dialog_new_with_buttons(\n window_title.c_str(),\n parent,\n GTK_DIALOG_MODAL,\n GTK_STOCK_CANCEL, GTK_RESPONSE_REJECT,\n GTK_STOCK_OK, GTK_RESPONSE_ACCEPT,\n NULL)),\n delegate_(delegate) {\n gtk_dialog_set_default_response(GTK_DIALOG(dialog_), GTK_RESPONSE_ACCEPT);\n gtk_dialog_set_has_separator(GTK_DIALOG(dialog_), FALSE);\n gtk_window_set_resizable(GTK_WINDOW(dialog_), FALSE);\n\n GtkWidget* content_area = GTK_DIALOG(dialog_)->vbox;\n gtk_box_set_spacing(GTK_BOX(content_area), 18);\n\n GtkWidget* hbox = gtk_hbox_new(FALSE, 6);\n GtkWidget* label_widget = gtk_label_new(label.c_str());\n gtk_box_pack_start(GTK_BOX(hbox), label_widget, FALSE, FALSE, 0);\n\n input_ = gtk_entry_new();\n gtk_entry_set_text(GTK_ENTRY(input_), contents.c_str());\n g_signal_connect(input_, \"changed\",\n G_CALLBACK(OnEntryChangedThunk), this);\n g_object_set(G_OBJECT(input_), \"activates-default\", TRUE, NULL);\n gtk_box_pack_start(GTK_BOX(hbox), input_, TRUE, TRUE, 0);\n\n gtk_widget_show_all(hbox);\n\n gtk_box_pack_start(GTK_BOX(content_area), hbox, FALSE, FALSE, 0);\n\n g_signal_connect(dialog_, \"response\",\n G_CALLBACK(OnResponseThunk), this);\n g_signal_connect(dialog_, \"delete-event\",\n G_CALLBACK(OnWindowDeleteEventThunk), this);\n g_signal_connect(dialog_, \"destroy\",\n G_CALLBACK(OnWindowDestroyThunk), this);\n}\n\nInputWindowDialogGtk::~InputWindowDialogGtk() {\n}\n\nvoid InputWindowDialogGtk::Show() {\n gtk_util::ShowDialog(dialog_);\n}\n\nvoid InputWindowDialogGtk::Close() {\n \/\/ Under the model that we've inherited from Windows, dialogs can receive\n \/\/ more than one Close() call inside the current message loop event.\n if (dialog_) {\n gtk_widget_destroy(GTK_WIDGET(dialog_));\n dialog_ = NULL;\n }\n}\n\nvoid InputWindowDialogGtk::OnEntryChanged(GtkEditable* entry) {\n std::wstring value(UTF8ToWide(gtk_entry_get_text(GTK_ENTRY(entry))));\n gtk_dialog_set_response_sensitive(GTK_DIALOG(dialog_),\n GTK_RESPONSE_ACCEPT,\n delegate_->IsValid(value));\n}\n\nvoid InputWindowDialogGtk::OnResponse(GtkWidget* dialog, int response_id) {\n if (response_id == GTK_RESPONSE_ACCEPT) {\n std::wstring value(UTF8ToWide(gtk_entry_get_text(GTK_ENTRY(input_))));\n delegate_->InputAccepted(value);\n } else {\n delegate_->InputCanceled();\n }\n Close();\n}\n\ngboolean InputWindowDialogGtk::OnWindowDeleteEvent(GtkWidget* widget,\n GdkEvent* event) {\n Close();\n\n \/\/ Return true to prevent the gtk dialog from being destroyed. Close will\n \/\/ destroy it for us and the default gtk_dialog_delete_event_handler() will\n \/\/ force the destruction without us being able to stop it.\n return TRUE;\n}\n\nvoid InputWindowDialogGtk::OnWindowDestroy(GtkWidget* widget) {\n MessageLoop::current()->DeleteSoon(FROM_HERE, this);\n}\n\nInputWindowDialog* InputWindowDialog::Create(gfx::NativeWindow parent,\n const std::wstring& window_title,\n const std::wstring& label,\n const std::wstring& contents,\n Delegate* delegate) {\n return new InputWindowDialogGtk(parent,\n WideToUTF8(window_title),\n WideToUTF8(label),\n WideToUTF8(contents),\n delegate);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"AConfig.h\"\n#if(HAS_STD_PILOT)\n#include \"Device.h\"\n#include \"Pin.h\"\n#include \"Pilot.h\"\n#include \"Timer.h\"\n\nTimer pilotTimer;\nbool _headingHoldEnabled = false;\nint _headingHoldTarget = 0;\nint hdg = 0;\nint hdg_Error;\nint raw_Left, raw_Right;\nint left, right; \/\/ motor outputs in microseconds, +\/-500\nint loop_Gain = 1;\nint integral_Divisor = 100;\nlong hdg_Error_Integral = 0;\nint tgt_Hdg = 0;\nbool _depthHoldEnabled = false;\nint _depthHoldTarget = 0;\nint depth = 0;\nint depth_Error = 0;\nint raw_lift =0;\nint lift = 0;\nint target_depth;\nint raw_yaw, yaw;\n\n\n\nvoid Pilot::device_setup(){\n pilotTimer.reset();\n Serial.println(F(\"log:pilot setup complete;\"));\n}\n\n\n\nvoid Pilot::device_loop(Command command){\n\/\/intended to respond to fly by wire commands: MaintainHeading(); TurnTo(compassheading); DiveTo(depth);\n if( command.cmp(\"holdHeading_toggle\")){\n if (_headingHoldEnabled) {\n _headingHoldEnabled = false;\n raw_Left = 0;\n raw_Right = 0;\n hdg_Error_Integral = 0; \/\/ Reset error integrator\n tgt_Hdg = 0; \/\/ 500 = system not in hdg hold\n\n int argsToSend[] = {1,00}; \/\/include number of parms as last parm\n command.pushCommand(\"yaw\",argsToSend);\n Serial.println(F(\"log:heading_hold_disabled;\"));\n\n } else {\n _headingHoldEnabled = true;\n if(command.args[0]==0){\n _headingHoldTarget = navdata::HDGD;\n } else {\n _headingHoldTarget = command.args[1];\n }\n tgt_Hdg = _headingHoldTarget;\n Serial.print(F(\"log:heading_hold_enabled on=\"));\n Serial.print(tgt_Hdg);\n Serial.println(';');\n }\n Serial.print(F(\"targetHeading:\"));\n Serial.print(tgt_Hdg);\n Serial.println(';');\n }\n\n\n if( command.cmp(\"holdDepth_toggle\")){\n if (_depthHoldEnabled) {\n _depthHoldEnabled = false;\n raw_lift = 0;\n target_depth = -500; \/\/ -500 = system not in hdg hold\n\n int argsToSend[] = {1,0}; \/\/include number of parms as last parm\n command.pushCommand(\"lift\",argsToSend);\n Serial.println(F(\"log:depth_hold_disabled;\"));\n\n } else {\n _depthHoldEnabled = true;\n if(command.args[0]==0){\n _depthHoldTarget = navdata::DEAP*100; \/\/casting to cm\n } else {\n _depthHoldTarget = command.args[1];\n }\n target_depth = _depthHoldTarget;\n Serial.print(F(\"log:depth_hold_enabled on=\"));\n Serial.print(target_depth);\n Serial.println(';');\n }\n Serial.print(F(\"targetDepth:\"));\n Serial.print(target_depth);\n Serial.println(';');\n }\n\n\n if (pilotTimer.elapsed (50)) {\n\n \/\/ Autopilot Test #3 6 Jan 2014\n \/\/ Hold vehicle at arbitrary heading\n \/\/ Integer math; proportional control plus basic integrator\n \/\/ No hysteresis around 180 degree error\n\n \/\/ Check whether hold mode is on\n\n if (_depthHoldEnabled)\n {\n depth = navdata::DEAP*100;\n depth_Error = target_depth-depth; \/\/positive error = positive lift = go deaper.\n\n raw_lift = depth_Error * loop_Gain;\n lift = constrain(raw_lift, -50, 50);\n\n Serial.println(F(\"log:dhold pushing command;\"));\n Serial.print(F(\"dp_er:\"));\n Serial.print(depth_Error);\n Serial.println(';');\n int argsToSend[] = {1,lift}; \/\/include number of parms as last parm\n command.pushCommand(\"lift\",argsToSend);\n\n }\n\n if (_headingHoldEnabled)\n {\n\n \/\/ Code for hold mode here\n hdg = navdata::HDGD;\n\n \/\/ Calculate heading error\n\n hdg_Error = hdg - tgt_Hdg;\n\n if (hdg_Error > 180)\n {\n hdg_Error = hdg_Error - 360;\n }\n\n if (hdg_Error < -179)\n {\n hdg_Error = hdg_Error + 360;\n }\n\n \/\/ Run error accumulator (integrator)\n hdg_Error_Integral = hdg_Error_Integral + hdg_Error;\n\n \/\/ Calculator motor outputs\n raw_yaw = -1 * hdg_Error * loop_Gain;\n\n \/\/ raw_Left = raw_Left - (hdg_Error_Integral \/ integral_Divisor);\n \/\/ raw_Right = raw_Right + (hdg_Error_Integral \/ integral_Divisor);\n\n \/\/ Constrain and output to motors\n\n yaw = constrain(raw_yaw, -50, 50);\n Serial.println(F(\"log:hold pushing command;\"));\n Serial.print(F(\"p_er:\"));\n Serial.print(hdg_Error);\n Serial.println(';');\n\n int argsToSend[] = {1,yaw}; \/\/include number of parms as last parm\n command.pushCommand(\"yaw\",argsToSend);\n }\n\n\n }\n}\n#endif\n\n\n\n<commit_msg>Revert \"Revert \"Fixing heading hold disable\"\"<commit_after>\n#include \"AConfig.h\"\n#if(HAS_STD_PILOT)\n#include \"Device.h\"\n#include \"Pin.h\"\n#include \"Pilot.h\"\n#include \"Timer.h\"\n\nTimer pilotTimer;\nbool _headingHoldEnabled = false;\nint _headingHoldTarget = 0;\nint hdg = 0;\nint hdg_Error;\nint raw_Left, raw_Right;\nint left, right; \/\/ motor outputs in microseconds, +\/-500\nint loop_Gain = 1;\nint integral_Divisor = 100;\nlong hdg_Error_Integral = 0;\nint tgt_Hdg = 0;\nbool _depthHoldEnabled = false;\nint _depthHoldTarget = 0;\nint depth = 0;\nint depth_Error = 0;\nint raw_lift =0;\nint lift = 0;\nint target_depth;\nint raw_yaw, yaw;\n\n\n\nvoid Pilot::device_setup(){\n pilotTimer.reset();\n Serial.println(F(\"log:pilot setup complete;\"));\n}\n\n\n\nvoid Pilot::device_loop(Command command){\n\/\/intended to respond to fly by wire commands: MaintainHeading(); TurnTo(compassheading); DiveTo(depth);\n if( command.cmp(\"holdHeading_toggle\")){\n if (_headingHoldEnabled) {\n _headingHoldEnabled = false;\n raw_Left = 0;\n raw_Right = 0;\n hdg_Error_Integral = 0; \/\/ Reset error integrator\n tgt_Hdg = -500; \/\/ -500 = system not in hdg hold\n\n int argsToSend[] = {1,00}; \/\/include number of parms as last parm\n command.pushCommand(\"yaw\",argsToSend);\n Serial.println(F(\"log:heading_hold_disabled;\"));\n\n } else {\n _headingHoldEnabled = true;\n if(command.args[0]==0){\n _headingHoldTarget = navdata::HDGD;\n } else {\n _headingHoldTarget = command.args[1];\n }\n tgt_Hdg = _headingHoldTarget;\n Serial.print(F(\"log:heading_hold_enabled on=\"));\n Serial.print(tgt_Hdg);\n Serial.println(';');\n }\n Serial.print(F(\"targetHeading:\"));\n Serial.print(tgt_Hdg);\n Serial.println(';');\n }\n\n\n if( command.cmp(\"holdDepth_toggle\")){\n if (_depthHoldEnabled) {\n _depthHoldEnabled = false;\n raw_lift = 0;\n target_depth = -500; \/\/ -500 = system not in hdg hold\n\n int argsToSend[] = {1,0}; \/\/include number of parms as last parm\n command.pushCommand(\"lift\",argsToSend);\n Serial.println(F(\"log:depth_hold_disabled;\"));\n\n } else {\n _depthHoldEnabled = true;\n if(command.args[0]==0){\n _depthHoldTarget = navdata::DEAP*100; \/\/casting to cm\n } else {\n _depthHoldTarget = command.args[1];\n }\n target_depth = _depthHoldTarget;\n Serial.print(F(\"log:depth_hold_enabled on=\"));\n Serial.print(target_depth);\n Serial.println(';');\n }\n Serial.print(F(\"targetDepth:\"));\n Serial.print(target_depth);\n Serial.println(';');\n }\n\n\n if (pilotTimer.elapsed (50)) {\n\n \/\/ Autopilot Test #3 6 Jan 2014\n \/\/ Hold vehicle at arbitrary heading\n \/\/ Integer math; proportional control plus basic integrator\n \/\/ No hysteresis around 180 degree error\n\n \/\/ Check whether hold mode is on\n\n if (_depthHoldEnabled)\n {\n depth = navdata::DEAP*100;\n depth_Error = target_depth-depth; \/\/positive error = positive lift = go deaper.\n\n raw_lift = depth_Error * loop_Gain;\n lift = constrain(raw_lift, -50, 50);\n\n Serial.println(F(\"log:dhold pushing command;\"));\n Serial.print(F(\"dp_er:\"));\n Serial.print(depth_Error);\n Serial.println(';');\n int argsToSend[] = {1,lift}; \/\/include number of parms as last parm\n command.pushCommand(\"lift\",argsToSend);\n\n }\n\n if (_headingHoldEnabled)\n {\n\n \/\/ Code for hold mode here\n hdg = navdata::HDGD;\n\n \/\/ Calculate heading error\n\n hdg_Error = hdg - tgt_Hdg;\n\n if (hdg_Error > 180)\n {\n hdg_Error = hdg_Error - 360;\n }\n\n if (hdg_Error < -179)\n {\n hdg_Error = hdg_Error + 360;\n }\n\n \/\/ Run error accumulator (integrator)\n hdg_Error_Integral = hdg_Error_Integral + hdg_Error;\n\n \/\/ Calculator motor outputs\n raw_yaw = -1 * hdg_Error * loop_Gain;\n\n \/\/ raw_Left = raw_Left - (hdg_Error_Integral \/ integral_Divisor);\n \/\/ raw_Right = raw_Right + (hdg_Error_Integral \/ integral_Divisor);\n\n \/\/ Constrain and output to motors\n\n yaw = constrain(raw_yaw, -50, 50);\n Serial.println(F(\"log:hold pushing command;\"));\n Serial.print(F(\"p_er:\"));\n Serial.print(hdg_Error);\n Serial.println(';');\n\n int argsToSend[] = {1,yaw}; \/\/include number of parms as last parm\n command.pushCommand(\"yaw\",argsToSend);\n }\n\n\n }\n}\n#endif\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_PIXMAP_HH__\n#define __RAPICORN_PIXMAP_HH__\n\n#include <rcore\/blobres.hh>\n\nnamespace Rapicorn {\n\n\/** Pixmap (PixmapT) is a Pixbuf wrapper template which provides various pixel operations.\n * A Pixmap really is defined as PixmapT<Pixbuf>, a template class around Pixbuf which\n * provides automatic memory management, pixel operations and IO functions.\n * This class stores ARGB pixels of size @a width * @a height. The pixels are stored as unsigned\n * 32-bit values in native endian format with premultiplied alpha (compatible with libcairo).\n * The @a comment attribute is preserved during saving and loading by some file formats, such as PNG.\n *\/\ntemplate<class Pixbuf>\nclass PixmapT {\n std::shared_ptr<Pixbuf> m_pixbuf;\npublic:\n explicit PixmapT (); \/\/\/< Construct Pixmap with 0x0 pixesl.\n explicit PixmapT (uint w, uint h); \/\/\/< Construct Pixmap at given width and height.\n explicit PixmapT (const Pixbuf &source); \/\/\/< Copy-construct Pixmap from a Pixbuf structure.\n explicit PixmapT (Blob &png_blob); \/\/\/< Construct Pixmap from a PNG resource blob.\n explicit PixmapT (const String &res_png); \/\/\/< Construct Pixmap from a PNG resource blob.\n PixmapT& operator= (const Pixbuf &source); \/\/\/< Re-initialize the Pixmap from a Pixbuf structure.\n int width () const { return m_pixbuf->width(); } \/\/\/< Get the width of the Pixmap.\n int height () const { return m_pixbuf->height(); } \/\/\/< Get the height of the Pixmap.\n void resize (uint w, uint h); \/\/\/< Reset width and height and resize pixel sequence.\n bool try_resize (uint w, uint h); \/\/\/< Resize unless width and height are too big.\n const uint32* row (uint y) const { return m_pixbuf->row (y); } \/\/\/< Access row read-only.\n uint32* row (uint y) { return m_pixbuf->row (y); } \/\/\/< Access row as endian dependant ARGB integers.\n uint32& pixel (uint x, uint y) { return m_pixbuf->row (y)[x]; } \/\/\/< Retrieve an ARGB pixel value reference.\n uint32 pixel (uint x, uint y) const { return m_pixbuf->row (y)[x]; } \/\/\/< Retrieve an ARGB pixel value.\n bool load_png (const String &filename, bool tryrepair = false); \/\/\/< Load from PNG file, assigns errno on failure.\n bool load_png (size_t nbytes, const char *bytes, bool tryrepair = false); \/\/\/< Load PNG data, sets errno.\n bool save_png (const String &filename); \/\/\/< Save to PNG, assigns errno on failure.\n bool load_pixstream (const uint8 *pixstream); \/\/\/< Decode and load from pixel stream, assigns errno on failure.\n void set_attribute (const String &name, const String &value); \/\/\/< Set string attribute, e.g. \"comment\".\n String get_attribute (const String &name) const; \/\/\/< Get string attribute, e.g. \"comment\".\n void copy (const Pixbuf &source, uint sx, uint sy,\n int swidth, int sheight, uint tx, uint ty); \/\/\/< Copy a Pixbuf area into this pximap.\n bool compare (const Pixbuf &source, uint sx, uint sy, int swidth, int sheight,\n uint tx, uint ty, double *averrp = NULL, double *maxerrp = NULL, double *nerrp = NULL,\n double *npixp = NULL) const; \/\/\/< Compare area and calculate difference metrics.\n operator const Pixbuf& () const { return *m_pixbuf; } \/\/\/< Allow automatic conversion of a Pixmap into a Pixbuf.\n};\n\n\/\/ RAPICORN_PIXBUF_TYPE is defined in <rcore\/clientapi.hh> and <rcore\/serverapi.hh>\ntypedef PixmapT<RAPICORN_PIXBUF_TYPE> Pixmap; \/\/\/< Pixmap is a convenience alias for PixmapT<Pixbuf>.\n\n} \/\/ Rapicorn\n\n#endif \/* __RAPICORN_PIXMAP_HH__ *\/\n<commit_msg>UI: fixed file references in a comment<commit_after>\/\/ Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#ifndef __RAPICORN_PIXMAP_HH__\n#define __RAPICORN_PIXMAP_HH__\n\n#include <rcore\/blobres.hh>\n\nnamespace Rapicorn {\n\n\/** Pixmap (PixmapT) is a Pixbuf wrapper template which provides various pixel operations.\n * A Pixmap really is defined as PixmapT<Pixbuf>, a template class around Pixbuf which\n * provides automatic memory management, pixel operations and IO functions.\n * This class stores ARGB pixels of size @a width * @a height. The pixels are stored as unsigned\n * 32-bit values in native endian format with premultiplied alpha (compatible with libcairo).\n * The @a comment attribute is preserved during saving and loading by some file formats, such as PNG.\n *\/\ntemplate<class Pixbuf>\nclass PixmapT {\n std::shared_ptr<Pixbuf> m_pixbuf;\npublic:\n explicit PixmapT (); \/\/\/< Construct Pixmap with 0x0 pixesl.\n explicit PixmapT (uint w, uint h); \/\/\/< Construct Pixmap at given width and height.\n explicit PixmapT (const Pixbuf &source); \/\/\/< Copy-construct Pixmap from a Pixbuf structure.\n explicit PixmapT (Blob &png_blob); \/\/\/< Construct Pixmap from a PNG resource blob.\n explicit PixmapT (const String &res_png); \/\/\/< Construct Pixmap from a PNG resource blob.\n PixmapT& operator= (const Pixbuf &source); \/\/\/< Re-initialize the Pixmap from a Pixbuf structure.\n int width () const { return m_pixbuf->width(); } \/\/\/< Get the width of the Pixmap.\n int height () const { return m_pixbuf->height(); } \/\/\/< Get the height of the Pixmap.\n void resize (uint w, uint h); \/\/\/< Reset width and height and resize pixel sequence.\n bool try_resize (uint w, uint h); \/\/\/< Resize unless width and height are too big.\n const uint32* row (uint y) const { return m_pixbuf->row (y); } \/\/\/< Access row read-only.\n uint32* row (uint y) { return m_pixbuf->row (y); } \/\/\/< Access row as endian dependant ARGB integers.\n uint32& pixel (uint x, uint y) { return m_pixbuf->row (y)[x]; } \/\/\/< Retrieve an ARGB pixel value reference.\n uint32 pixel (uint x, uint y) const { return m_pixbuf->row (y)[x]; } \/\/\/< Retrieve an ARGB pixel value.\n bool load_png (const String &filename, bool tryrepair = false); \/\/\/< Load from PNG file, assigns errno on failure.\n bool load_png (size_t nbytes, const char *bytes, bool tryrepair = false); \/\/\/< Load PNG data, sets errno.\n bool save_png (const String &filename); \/\/\/< Save to PNG, assigns errno on failure.\n bool load_pixstream (const uint8 *pixstream); \/\/\/< Decode and load from pixel stream, assigns errno on failure.\n void set_attribute (const String &name, const String &value); \/\/\/< Set string attribute, e.g. \"comment\".\n String get_attribute (const String &name) const; \/\/\/< Get string attribute, e.g. \"comment\".\n void copy (const Pixbuf &source, uint sx, uint sy,\n int swidth, int sheight, uint tx, uint ty); \/\/\/< Copy a Pixbuf area into this pximap.\n bool compare (const Pixbuf &source, uint sx, uint sy, int swidth, int sheight,\n uint tx, uint ty, double *averrp = NULL, double *maxerrp = NULL, double *nerrp = NULL,\n double *npixp = NULL) const; \/\/\/< Compare area and calculate difference metrics.\n operator const Pixbuf& () const { return *m_pixbuf; } \/\/\/< Allow automatic conversion of a Pixmap into a Pixbuf.\n};\n\n\/\/ RAPICORN_PIXBUF_TYPE is defined in <clientapi.hh> and <serverapi.hh>\ntypedef PixmapT<RAPICORN_PIXBUF_TYPE> Pixmap; \/\/\/< Pixmap is a convenience alias for PixmapT<Pixbuf>.\n\n} \/\/ Rapicorn\n\n#endif \/* __RAPICORN_PIXMAP_HH__ *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n#include \"window.hh\"\n#include \"factory.hh\"\n#include \"application.hh\"\n#include \"uithread.hh\"\n#include <algorithm>\n\nnamespace Rapicorn {\n\nWindowImpl&\nWindowIface::impl ()\n{\n WindowImpl *wimpl = dynamic_cast<WindowImpl*> (this);\n if (!wimpl)\n throw std::bad_cast();\n return *wimpl;\n}\n\nnamespace WindowTrail {\nstatic Mutex wmutex;\nstatic vector<WindowImpl*> windows;\nstatic vector<WindowImpl*> wlist () { ScopedLock<Mutex> slock (wmutex); return windows; }\nstatic void wenter (WindowImpl *wi) { ScopedLock<Mutex> slock (wmutex); windows.push_back (wi); }\nstatic void wleave (WindowImpl *wi)\n{\n ScopedLock<Mutex> slock (wmutex);\n auto it = find (windows.begin(), windows.end(), wi);\n assert_return (it != windows.end());\n windows.erase (it);\n};\n} \/\/ WindowTrail\n\n\nWindowImpl::WindowImpl () :\n loop_ (uithread_main_loop()->create_slave()),\n commands_emission_ (NULL)\n{\n \/\/ create event loop (auto-starts)\n loop_->exec_dispatcher (Aida::slot (*this, &WindowImpl::command_dispatcher), EventLoop::PRIORITY_NOW);\n loop_->flag_primary (false);\n}\n\nvoid\nWindowImpl::construct()\n{\n ViewportImpl::construct();\n assert_return (has_children() == false); \/\/ must be anchored before becoming parent\n assert_return (get_window() && get_viewport());\n WindowTrail::wenter (this);\n ApplicationImpl::WindowImplFriend::add_window (*this);\n assert_return (anchored() == false);\n sig_hierarchy_changed.emit (NULL);\n assert_return (anchored() == true);\n}\n\nvoid\nWindowImpl::dispose()\n{\n assert_return (anchored() == true);\n const bool was_listed = ApplicationImpl::WindowImplFriend::remove_window (*this);\n assert_return (was_listed);\n sig_hierarchy_changed.emit (this);\n assert_return (anchored() == false);\n}\n\nWindowImpl::~WindowImpl ()\n{\n WindowTrail::wleave (this);\n assert_return (anchored() == false);\n \/\/ shutdown event loop\n loop_->destroy_loop();\n \/* make sure all children are removed while this is still of type ViewportImpl.\n * necessary because C++ alters the object type during constructors and destructors\n *\/\n if (has_children())\n remove (get_child());\n AncestryCache *ancestry_cache = const_cast<AncestryCache*> (ViewportImpl::fetch_ancestry_cache());\n ancestry_cache->window = NULL;\n}\n\nconst WidgetImpl::AncestryCache*\nWindowImpl::fetch_ancestry_cache ()\n{\n AncestryCache *ancestry_cache = const_cast<AncestryCache*> (ViewportImpl::fetch_ancestry_cache());\n ancestry_cache->window = this;\n return ancestry_cache;\n}\n\nvoid\nWindowImpl::set_parent (ContainerImpl *parent)\n{\n if (parent)\n critical (\"setting parent on toplevel Window widget to: %p (%s)\", parent, parent->typeid_name().c_str());\n return ContainerImpl::set_parent (parent);\n}\n\nvoid\nWindowImpl::create_display_window ()\n{\n ViewportImpl::create_display_window();\n if (has_display_window())\n loop_->flag_primary (true);\n}\n\nvoid\nWindowImpl::destroy_display_window ()\n{\n ViewportImpl::destroy_display_window();\n loop_->flag_primary (false);\n}\n\nvoid\nWindowImpl::forcefully_close_all()\n{\n vector<WindowImpl*> wl = WindowTrail::wlist();\n for (auto it : wl)\n it->close();\n}\n\nbool\nWindowImpl::widget_is_anchored (WidgetImpl &widget, Internal)\n{\n if (widget.parent() && widget.parent()->anchored())\n return true;\n WindowImpl *window = widget.as_window_impl(); \/\/ fast cast\n if (window && ApplicationImpl::WindowImplFriend::has_window (*window))\n return true;\n return false;\n}\n\nbool\nWindowImpl::custom_command (const String &command_name, const StringSeq &command_args)\n{\n assert_return (commands_emission_ == NULL, false);\n last_command_ = command_name;\n commands_emission_ = sig_commands.emission (command_name, command_args);\n return true;\n}\n\nbool\nWindowImpl::command_dispatcher (const LoopState &state)\n{\n if (state.phase == state.PREPARE || state.phase == state.CHECK)\n return commands_emission_ && commands_emission_->pending();\n else if (state.phase == state.DISPATCH)\n {\n WindowImplP guard_this = shared_ptr_cast<WindowImpl> (this);\n commands_emission_->dispatch(); \/\/ invoke signal handlers\n bool handled = false;\n if (commands_emission_->has_value())\n handled = commands_emission_->get_value(); \/\/ value returned from signal handler\n if (handled || commands_emission_->done())\n {\n if (!handled) \/\/ all handlers returned false\n critical (\"Command unhandled: %s\", last_command_.c_str());\n Signal_commands::Emission *emi = commands_emission_;\n commands_emission_ = NULL;\n delete emi;\n last_command_ = \"\";\n }\n return true;\n }\n else if (state.phase == state.DESTROY)\n {\n if (commands_emission_)\n {\n Signal_commands::Emission *emi = commands_emission_;\n commands_emission_ = NULL;\n delete emi;\n last_command_ = \"\";\n }\n }\n return false;\n}\n\nbool\nWindowImpl::synthesize_enter (double xalign, double yalign)\n{\n if (!has_display_window())\n return false;\n const Allocation &area = allocation();\n Point p (area.x + xalign * (max (1, area.width) - 1),\n area.y + yalign * (max (1, area.height) - 1));\n p = point_to_viewport (p);\n EventContext ec;\n ec.x = p.x;\n ec.y = p.y;\n push_immediate_event (create_event_mouse (MOUSE_ENTER, ec));\n return true;\n}\n\nbool\nWindowImpl::synthesize_leave ()\n{\n if (!has_display_window())\n return false;\n EventContext ec;\n push_immediate_event (create_event_mouse (MOUSE_LEAVE, ec));\n return true;\n}\n\nbool\nWindowImpl::synthesize_click (WidgetIface &widgeti, int button, double xalign, double yalign)\n{\n WidgetImpl &widget = *dynamic_cast<WidgetImpl*> (&widgeti);\n if (!has_display_window() || !&widget)\n return false;\n const Allocation &area = widget.allocation();\n Point p (area.x + xalign * (max (1, area.width) - 1),\n area.y + yalign * (max (1, area.height) - 1));\n p = widget.point_to_viewport (p);\n EventContext ec;\n ec.x = p.x;\n ec.y = p.y;\n push_immediate_event (create_event_button (BUTTON_RELEASE, ec, button));\n push_immediate_event (create_event_button (BUTTON_PRESS, ec, button));\n return true;\n}\n\nbool\nWindowImpl::synthesize_delete ()\n{\n if (!has_display_window())\n return false;\n EventContext ec;\n push_immediate_event (create_event_win_delete (ec));\n return true;\n}\n\nstatic const WidgetFactory<WindowImpl> window_factory (\"Rapicorn::Window\");\n\n} \/\/ Rapicorn\n<commit_msg>UI: WindowImpl: properly chain from dispose()<commit_after>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n#include \"window.hh\"\n#include \"factory.hh\"\n#include \"application.hh\"\n#include \"uithread.hh\"\n#include <algorithm>\n\nnamespace Rapicorn {\n\nWindowImpl&\nWindowIface::impl ()\n{\n WindowImpl *wimpl = dynamic_cast<WindowImpl*> (this);\n if (!wimpl)\n throw std::bad_cast();\n return *wimpl;\n}\n\nnamespace WindowTrail {\nstatic Mutex wmutex;\nstatic vector<WindowImpl*> windows;\nstatic vector<WindowImpl*> wlist () { ScopedLock<Mutex> slock (wmutex); return windows; }\nstatic void wenter (WindowImpl *wi) { ScopedLock<Mutex> slock (wmutex); windows.push_back (wi); }\nstatic void wleave (WindowImpl *wi)\n{\n ScopedLock<Mutex> slock (wmutex);\n auto it = find (windows.begin(), windows.end(), wi);\n assert_return (it != windows.end());\n windows.erase (it);\n};\n} \/\/ WindowTrail\n\n\nWindowImpl::WindowImpl () :\n loop_ (uithread_main_loop()->create_slave()),\n commands_emission_ (NULL)\n{\n \/\/ create event loop (auto-starts)\n loop_->exec_dispatcher (Aida::slot (*this, &WindowImpl::command_dispatcher), EventLoop::PRIORITY_NOW);\n loop_->flag_primary (false);\n}\n\nvoid\nWindowImpl::construct()\n{\n ViewportImpl::construct();\n assert_return (has_children() == false); \/\/ must be anchored before becoming parent\n assert_return (get_window() && get_viewport());\n WindowTrail::wenter (this);\n ApplicationImpl::WindowImplFriend::add_window (*this);\n assert_return (anchored() == false);\n sig_hierarchy_changed.emit (NULL);\n assert_return (anchored() == true);\n}\n\nvoid\nWindowImpl::dispose()\n{\n assert_return (anchored() == true);\n const bool was_listed = ApplicationImpl::WindowImplFriend::remove_window (*this);\n assert_return (was_listed);\n sig_hierarchy_changed.emit (this);\n assert_return (anchored() == false);\n ViewportImpl::dispose();\n}\n\nWindowImpl::~WindowImpl ()\n{\n WindowTrail::wleave (this);\n assert_return (anchored() == false);\n \/\/ shutdown event loop\n loop_->destroy_loop();\n \/* make sure all children are removed while this is still of type ViewportImpl.\n * necessary because C++ alters the object type during constructors and destructors\n *\/\n if (has_children())\n remove (get_child());\n AncestryCache *ancestry_cache = const_cast<AncestryCache*> (ViewportImpl::fetch_ancestry_cache());\n ancestry_cache->window = NULL;\n}\n\nconst WidgetImpl::AncestryCache*\nWindowImpl::fetch_ancestry_cache ()\n{\n AncestryCache *ancestry_cache = const_cast<AncestryCache*> (ViewportImpl::fetch_ancestry_cache());\n ancestry_cache->window = this;\n return ancestry_cache;\n}\n\nvoid\nWindowImpl::set_parent (ContainerImpl *parent)\n{\n if (parent)\n critical (\"setting parent on toplevel Window widget to: %p (%s)\", parent, parent->typeid_name().c_str());\n return ContainerImpl::set_parent (parent);\n}\n\nvoid\nWindowImpl::create_display_window ()\n{\n ViewportImpl::create_display_window();\n if (has_display_window())\n loop_->flag_primary (true);\n}\n\nvoid\nWindowImpl::destroy_display_window ()\n{\n ViewportImpl::destroy_display_window();\n loop_->flag_primary (false);\n}\n\nvoid\nWindowImpl::forcefully_close_all()\n{\n vector<WindowImpl*> wl = WindowTrail::wlist();\n for (auto it : wl)\n it->close();\n}\n\nbool\nWindowImpl::widget_is_anchored (WidgetImpl &widget, Internal)\n{\n if (widget.parent() && widget.parent()->anchored())\n return true;\n WindowImpl *window = widget.as_window_impl(); \/\/ fast cast\n if (window && ApplicationImpl::WindowImplFriend::has_window (*window))\n return true;\n return false;\n}\n\nbool\nWindowImpl::custom_command (const String &command_name, const StringSeq &command_args)\n{\n assert_return (commands_emission_ == NULL, false);\n last_command_ = command_name;\n commands_emission_ = sig_commands.emission (command_name, command_args);\n return true;\n}\n\nbool\nWindowImpl::command_dispatcher (const LoopState &state)\n{\n if (state.phase == state.PREPARE || state.phase == state.CHECK)\n return commands_emission_ && commands_emission_->pending();\n else if (state.phase == state.DISPATCH)\n {\n WindowImplP guard_this = shared_ptr_cast<WindowImpl> (this);\n commands_emission_->dispatch(); \/\/ invoke signal handlers\n bool handled = false;\n if (commands_emission_->has_value())\n handled = commands_emission_->get_value(); \/\/ value returned from signal handler\n if (handled || commands_emission_->done())\n {\n if (!handled) \/\/ all handlers returned false\n critical (\"Command unhandled: %s\", last_command_.c_str());\n Signal_commands::Emission *emi = commands_emission_;\n commands_emission_ = NULL;\n delete emi;\n last_command_ = \"\";\n }\n return true;\n }\n else if (state.phase == state.DESTROY)\n {\n if (commands_emission_)\n {\n Signal_commands::Emission *emi = commands_emission_;\n commands_emission_ = NULL;\n delete emi;\n last_command_ = \"\";\n }\n }\n return false;\n}\n\nbool\nWindowImpl::synthesize_enter (double xalign, double yalign)\n{\n if (!has_display_window())\n return false;\n const Allocation &area = allocation();\n Point p (area.x + xalign * (max (1, area.width) - 1),\n area.y + yalign * (max (1, area.height) - 1));\n p = point_to_viewport (p);\n EventContext ec;\n ec.x = p.x;\n ec.y = p.y;\n push_immediate_event (create_event_mouse (MOUSE_ENTER, ec));\n return true;\n}\n\nbool\nWindowImpl::synthesize_leave ()\n{\n if (!has_display_window())\n return false;\n EventContext ec;\n push_immediate_event (create_event_mouse (MOUSE_LEAVE, ec));\n return true;\n}\n\nbool\nWindowImpl::synthesize_click (WidgetIface &widgeti, int button, double xalign, double yalign)\n{\n WidgetImpl &widget = *dynamic_cast<WidgetImpl*> (&widgeti);\n if (!has_display_window() || !&widget)\n return false;\n const Allocation &area = widget.allocation();\n Point p (area.x + xalign * (max (1, area.width) - 1),\n area.y + yalign * (max (1, area.height) - 1));\n p = widget.point_to_viewport (p);\n EventContext ec;\n ec.x = p.x;\n ec.y = p.y;\n push_immediate_event (create_event_button (BUTTON_RELEASE, ec, button));\n push_immediate_event (create_event_button (BUTTON_PRESS, ec, button));\n return true;\n}\n\nbool\nWindowImpl::synthesize_delete ()\n{\n if (!has_display_window())\n return false;\n EventContext ec;\n push_immediate_event (create_event_win_delete (ec));\n return true;\n}\n\nstatic const WidgetFactory<WindowImpl> window_factory (\"Rapicorn::Window\");\n\n} \/\/ Rapicorn\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Pieter Wuille\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <bech32.h>\n#include <test\/util\/setup_common.h>\n#include <test\/util\/str.h>\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(bech32_tests, BasicTestingSetup)\n\nBOOST_AUTO_TEST_CASE(bip173_testvectors_valid)\n{\n static const std::string CASES[] = {\n \"A12UEL5L\",\n \"a12uel5l\",\n \"an83characterlonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1tt5tgs\",\n \"abcdef1qpzry9x8gf2tvdw0s3jn54khce6mua7lmqqqxw\",\n \"11qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqc8247j\",\n \"split1checkupstagehandshakeupstreamerranterredcaperred2y9e3w\",\n \"?1ezyfcl\",\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding == bech32::Encoding::BECH32);\n std::string recode = bech32::Encode(bech32::Encoding::BECH32, dec.hrp, dec.data);\n BOOST_CHECK(!recode.empty());\n BOOST_CHECK(CaseInsensitiveEqual(str, recode));\n }\n}\n\nBOOST_AUTO_TEST_CASE(bip173_testvectors_invalid)\n{\n static const std::string CASES[] = {\n \" 1nwldj5\",\n \"\\x7f\"\"1axkwrx\",\n \"\\x80\"\"1eym55h\",\n \"an84characterslonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1569pvx\",\n \"pzry9x0s0muk\",\n \"1pzry9x0s0muk\",\n \"x1b4n0q5v\",\n \"li1dgmt3\",\n \"de1lg7wt\\xff\",\n \"A1G7SGD8\",\n \"10a06t8\",\n \"1qzzfhee\",\n \"a12UEL5L\",\n \"A12uEL5L\",\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding != bech32::Encoding::BECH32);\n }\n}\n\nBOOST_AUTO_TEST_CASE(bech32_polymod_sanity)\n{\n std::vector<unsigned char> data(40);\n \/\/ GetRandBytes only allows 32 bytes at a time\n GetRandBytes(data.data(), 32);\n GetRandBytes(data.data() + 32, data.size() - 32);\n\n std::vector<unsigned char> base32;\n ConvertBits<8, 5, true>([&](unsigned char c) { base32.push_back(c); }, data.begin(), data.end());\n uint64_t plm1 = bech32::PolyMod(base32);\n\n \/\/ Now add 1023 zeros.\n for (auto i = 0; i < 1023; i++) {\n base32.push_back(0);\n }\n uint64_t plm2 = bech32::PolyMod(base32);\n\n BOOST_CHECK_EQUAL(plm1, plm2);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Add Bech32m test vectors<commit_after>\/\/ Copyright (c) 2017 Pieter Wuille\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <bech32.h>\n#include <test\/util\/setup_common.h>\n#include <test\/util\/str.h>\n\n#include <boost\/test\/unit_test.hpp>\n\nBOOST_FIXTURE_TEST_SUITE(bech32_tests, BasicTestingSetup)\n\nBOOST_AUTO_TEST_CASE(bech32_testvectors_valid)\n{\n static const std::string CASES[] = {\n \"A12UEL5L\",\n \"a12uel5l\",\n \"an83characterlonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1tt5tgs\",\n \"abcdef1qpzry9x8gf2tvdw0s3jn54khce6mua7lmqqqxw\",\n \"11qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqc8247j\",\n \"split1checkupstagehandshakeupstreamerranterredcaperred2y9e3w\",\n \"?1ezyfcl\",\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding == bech32::Encoding::BECH32);\n std::string recode = bech32::Encode(bech32::Encoding::BECH32, dec.hrp, dec.data);\n BOOST_CHECK(!recode.empty());\n BOOST_CHECK(CaseInsensitiveEqual(str, recode));\n }\n}\n\nBOOST_AUTO_TEST_CASE(bech32m_testvectors_valid)\n{\n static const std::string CASES[] = {\n \"A1LQFN3A\",\n \"a1lqfn3a\",\n \"an83characterlonghumanreadablepartthatcontainsthetheexcludedcharactersbioandnumber11sg7hg6\",\n \"abcdef1l7aum6echk45nj3s0wdvt2fg8x9yrzpqzd3ryx\",\n \"11llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllludsr8\",\n \"split1checkupstagehandshakeupstreamerranterredcaperredlc445v\",\n \"?1v759aa\"\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding == bech32::Encoding::BECH32M);\n std::string recode = bech32::Encode(bech32::Encoding::BECH32M, dec.hrp, dec.data);\n BOOST_CHECK(!recode.empty());\n BOOST_CHECK(CaseInsensitiveEqual(str, recode));\n }\n}\n\nBOOST_AUTO_TEST_CASE(bech32_testvectors_invalid)\n{\n static const std::string CASES[] = {\n \" 1nwldj5\",\n \"\\x7f\"\"1axkwrx\",\n \"\\x80\"\"1eym55h\",\n \"an84characterslonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1569pvx\",\n \"pzry9x0s0muk\",\n \"1pzry9x0s0muk\",\n \"x1b4n0q5v\",\n \"li1dgmt3\",\n \"de1lg7wt\\xff\",\n \"A1G7SGD8\",\n \"10a06t8\",\n \"1qzzfhee\",\n \"a12UEL5L\",\n \"A12uEL5L\",\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding == bech32::Encoding::INVALID);\n }\n}\n\nBOOST_AUTO_TEST_CASE(bech32m_testvectors_invalid)\n{\n static const std::string CASES[] = {\n \" 1xj0phk\",\n \"\\x7f\"\"1g6xzxy\",\n \"\\x80\"\"1vctc34\",\n \"an84characterslonghumanreadablepartthatcontainsthetheexcludedcharactersbioandnumber11d6pts4\",\n \"qyrz8wqd2c9m\",\n \"1qyrz8wqd2c9m\",\n \"y1b0jsk6g\",\n \"lt1igcx5c0\",\n \"in1muywd\",\n \"mm1crxm3i\",\n \"au1s5cgom\",\n \"M1VUXWEZ\",\n \"16plkw9\",\n \"1p2gdwpf\"\n };\n for (const std::string& str : CASES) {\n const auto dec = bech32::Decode(str);\n BOOST_CHECK(dec.encoding == bech32::Encoding::INVALID);\n }\n}\n\nBOOST_AUTO_TEST_CASE(bech32_polymod_sanity)\n{\n std::vector<unsigned char> data(40);\n \/\/ GetRandBytes only allows 32 bytes at a time\n GetRandBytes(data.data(), 32);\n GetRandBytes(data.data() + 32, data.size() - 32);\n\n std::vector<unsigned char> base32;\n ConvertBits<8, 5, true>([&](unsigned char c) { base32.push_back(c); }, data.begin(), data.end());\n uint64_t plm1 = bech32::PolyMod(base32);\n\n \/\/ Now add 1023 zeros.\n for (auto i = 0; i < 1023; i++) {\n base32.push_back(0);\n }\n uint64_t plm2 = bech32::PolyMod(base32);\n\n BOOST_CHECK_EQUAL(plm1, plm2);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>#include <amino.h>\n#include <amino\/rx.h>\n\n#include \"amino\/rx\/scene_win.h\"\n#include \"amino\/rx\/scene_gl.h\"\n#include \"amino\/rx\/octree_geom.hpp\"\n#include \"amino\/rx\/scene_plugin.h\"\n\n#include <stdio.h>\n\nstatic const int SCREEN_WIDTH = 1000;\nstatic const int SCREEN_HEIGHT = 1000;\n\nint\nmain (int argc, char **argv)\n{\n\n\n struct aa_rx_octree* oCloud = aa_rx_geom_read_octree_from_file(\"\/home\/mschack\/simple_tree.bt.ot\");\n\n std::cout << \"Octree created\" << std::endl;\n\n struct aa_rx_sg *sg = aa_rx_sg_create();\n\n std::cout << \"scenegraph created\" << std::endl;\n\n static const double q[4] = {0, 0, 0, 1};\n static const double v[3] = {0, 0, 0};\n\n\n \/\/ aa_rx_sg_add_frame_fixed(sg, \"\", \"oct\", q, v);\n\n \/\/ std::cout << \"frame added\" << std::endl;\n\n \/\/ struct aa_rx_geom *geom;\n struct aa_rx_geom_opt *opt = aa_rx_geom_opt_create();\n std::cout << \"options created\" << std::endl;\n aa_rx_geom_opt_set_color3(opt, 0.0, 0.0, 1.0);\n aa_rx_geom_opt_set_alpha(opt, 1.0);\n aa_rx_geom_opt_set_specular3(opt, 0, 0, 0);\n aa_rx_geom_opt_set_visual(opt, 1);\n aa_rx_geom_opt_set_collision(opt, 1);\n aa_rx_geom_opt_set_no_shadow(opt, 0);\n\n \/\/ geom = aa_rx_geom_octree(opt, oCloud);\n aa_rx_sg_add_octree(sg, \"\", oCloud, opt);\n std::cout << \"octree added\" << std::endl;\n \/\/ aa_rx_geom_attach(sg, \"oct\", geom);\n aa_rx_geom_opt_destroy(opt);\n\n struct aa_rx_win * win =\n aa_rx_win_default_create ( \"Octree\", SCREEN_WIDTH, SCREEN_HEIGHT );\n\n printf(\"OpenGL Version: %s\\n\", glGetString(GL_VERSION));\n\n \/\/ setup scene graph\n aa_rx_sg_init(sg); \/* initialize scene graph internal structures *\/\n aa_rx_win_sg_gl_init(win, sg); \/* Initialize scene graph GL-rendering objects *\/\n aa_rx_win_set_sg(win, sg); \/* Set the scenegraph for the window *\/\n\n \/\/ start display\n aa_rx_win_run();\n\n \/\/ Cleanup\n aa_rx_sg_destroy(sg);\n aa_rx_win_destroy(win);\n SDL_Quit();\n\n return (0);\n}\n<commit_msg>Removed local test<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\nThis file is part of the ORK library.\nFull copyright and license terms can be found in the LICENSE.txt file.\n*\/\n#pragma once\n#include \"ork\/ork.hpp\"\n\n#define ORK_STL_INC_FILE <type_traits>\n#include \"ork\/core\/stl_include.inl\"\n\n\nnamespace ork {\n\n\n\n\n} \/\/ namespace ork\n<commit_msg>Added signature traits<commit_after>\/*\nThis file is part of the ORK library.\nFull copyright and license terms can be found in the LICENSE.txt file.\n*\/\n#pragma once\n#include \"ork\/ork.hpp\"\n\n#define ORK_STL_INC_FILE <type_traits>\n#include \"ork\/core\/stl_include.inl\"\n\n\nnamespace ork {\n\n\n\/*\nThese are optimal types for function signatures\n*\/\ntemplate<typename T>\nstruct signature_traits {\nprivate:\n static_assert(\n std::is_enum<T>::value || std::is_arithmetic<T>::value || std::is_class<T>::value,\n \"Yeah, this trait is not general\");\n using non_cv_type = typename std::remove_cv<T>::type;\n using val_t = non_cv_type;\n using cval_t = typename std::add_const<val_t>::type;\n using ref_t = typename std::add_lvalue_reference<val_t>::type;\n using cref_t = typename std::add_lvalue_reference<cval_t>::type;\n static const auto fund_t = std::is_enum<T>::value || std::is_arithmetic<T>::value;\n\npublic:\n \/\/ Trivial given the limitations above\n using value_type = val_t;\n \/\/ Trivial given the limitations above\n using reference_type = ref_t;\n \/\/ Parameter to a function\n using const_param_type = typename std::conditional<fund_t, cval_t, cref_t>::type;\n \/\/ Wrapper return type\n using const_wrap_type = typename std::conditional<fund_t, val_t, cref_t>::type;\n};\n\n\/\/ For use in templates\n#define ORK_VAL_T typename ork::signature_traits<T>::value_type\n#define ORK_REF_T typename ork::signature_traits<T>::reference_type\n#define ORK_CPARAM_T typename ork::signature_traits<T>::const_param_type\n#define ORK_CWRAP_T typename ork::signature_traits<T>::const_wrap_type\n\n\/\/ For use in macros\n#define ORK_VAL(TYPE) ork::signature_traits<TYPE>::value_type\n#define ORK_REF(TYPE) ork::signature_traits<TYPE>::reference_type\n#define ORK_CPARAM(TYPE) ork::signature_traits<TYPE>::const_param_type\n#define ORK_CWRAP(TYPE) ork::signature_traits<TYPE>::const_wrap_type\n\n\n} \/\/ namespace ork\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Magnum.\n\n Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n Vladimír Vondruš <mosra@centrum.cz>\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"CombineIndexedArrays.h\"\n\n#include <cstring>\n#include <unordered_map>\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/Utility\/MurmurHash2.h>\n\n#include \"Magnum\/Magnum.h\"\n\nnamespace Magnum { namespace MeshTools {\n\nnamespace Implementation {\n\nstd::pair<std::vector<UnsignedInt>, std::vector<UnsignedInt>> interleaveAndCombineIndexArrays(const std::reference_wrapper<const std::vector<UnsignedInt>>* begin, const std::reference_wrapper<const std::vector<UnsignedInt>>* end) {\n \/* Array stride and size *\/\n const UnsignedInt stride = end - begin;\n const UnsignedInt inputSize = begin->get().size();\n #ifndef CORRADE_NO_ASSERT\n for(auto it = begin; it != end; ++it)\n CORRADE_ASSERT(it->get().size() == inputSize, \"MeshTools::combineIndexArrays(): the arrays don't have the same size\", {});\n #endif\n\n \/* Interleave the arrays *\/\n std::vector<UnsignedInt> interleavedArrays;\n interleavedArrays.resize(inputSize*stride);\n for(UnsignedInt offset = 0; offset != stride; ++offset) {\n const auto& array = (begin+offset)->get();\n for(UnsignedInt i = 0; i != inputSize; ++i)\n interleavedArrays[offset + i*stride] = array[i];\n }\n\n \/* Combine them *\/\n std::vector<UnsignedInt> combinedIndices;\n std::tie(combinedIndices, interleavedArrays) = MeshTools::combineIndexArrays(interleavedArrays, stride);\n return {combinedIndices, interleavedArrays};\n}\n\nstd::vector<UnsignedInt> combineIndexArrays(const std::reference_wrapper<std::vector<UnsignedInt>>* const begin, const std::reference_wrapper<std::vector<UnsignedInt>>* const end) {\n \/* Interleave and combine the arrays *\/\n std::vector<UnsignedInt> combinedIndices;\n std::vector<UnsignedInt> interleavedCombinedArrays;\n std::tie(combinedIndices, interleavedCombinedArrays) = Implementation::interleaveAndCombineIndexArrays(\n \/* This will bite me hard once. *\/\n reinterpret_cast<const std::reference_wrapper<const std::vector<UnsignedInt>>*>(begin),\n reinterpret_cast<const std::reference_wrapper<const std::vector<UnsignedInt>>*>(end));\n\n \/* Update the original indices *\/\n const UnsignedInt stride = end - begin;\n const UnsignedInt outputSize = interleavedCombinedArrays.size()\/stride;\n for(UnsignedInt offset = 0; offset != stride; ++offset) {\n auto& array = (begin+offset)->get();\n CORRADE_INTERNAL_ASSERT(array.size() >= outputSize);\n array.resize(outputSize);\n for(UnsignedInt i = 0; i != outputSize; ++i)\n array[i] = interleavedCombinedArrays[offset + i*stride];\n }\n\n return combinedIndices;\n}\n\n}\n\nnamespace {\n\nclass IndexHash {\n public:\n explicit IndexHash(const std::vector<UnsignedInt>& indices, UnsignedInt stride): indices(indices), stride(stride) {}\n\n std::size_t operator()(UnsignedInt key) const {\n return *reinterpret_cast<const std::size_t*>(Utility::MurmurHash2()(reinterpret_cast<const char*>(indices.data()+key*stride), sizeof(UnsignedInt)*stride).byteArray());\n }\n\n private:\n const std::vector<UnsignedInt>& indices;\n UnsignedInt stride;\n};\n\nclass IndexEqual {\n public:\n explicit IndexEqual(const std::vector<UnsignedInt>& indices, UnsignedInt stride): indices(indices), stride(stride) {}\n\n bool operator()(UnsignedInt a, UnsignedInt b) const {\n return std::memcmp(indices.data()+a*stride, indices.data()+b*stride, sizeof(UnsignedInt)*stride) == 0;\n }\n\n private:\n const std::vector<UnsignedInt>& indices;\n UnsignedInt stride;\n};\n\n}\n\nstd::pair<std::vector<UnsignedInt>, std::vector<UnsignedInt>> combineIndexArrays(const std::vector<UnsignedInt>& interleavedArrays, const UnsignedInt stride) {\n CORRADE_ASSERT(stride != 0, \"MeshTools::combineIndexArrays(): stride can't be zero\", {});\n CORRADE_ASSERT(interleavedArrays.size() % stride == 0, \"MeshTools::combineIndexArrays(): array size is not divisible by stride\", {});\n\n \/* Hash map with index combinations, containing just indices into\n interleavedArrays vector, hashing and comparison is done using IndexHash\n and IndexEqual functors. Reserving more buckets than necessary (i.e. as\n if each combination was unique). *\/\n std::unordered_map<UnsignedInt, UnsignedInt, IndexHash, IndexEqual> indexCombinations(\n interleavedArrays.size()\/stride,\n IndexHash(interleavedArrays, stride),\n IndexEqual(interleavedArrays, stride));\n\n \/* Make the index combinations unique. Original indices into original\n `interleavedArrays` array were 0, 1, 2, 3, ..., `combinedIndices`\n contains new ones into new (shorter) `newInterleavedArrays` array. *\/\n std::vector<UnsignedInt> combinedIndices;\n combinedIndices.reserve(interleavedArrays.size()\/stride);\n std::vector<UnsignedInt> newInterleavedArrays;\n for(std::size_t oldIndex = 0, end = interleavedArrays.size()\/stride; oldIndex != end; ++oldIndex) {\n \/* Try to insert new index combination to the map *\/\n const auto result = indexCombinations.emplace(oldIndex, indexCombinations.size());\n\n \/* Add the (either new or already existing) index to resulting index array *\/\n combinedIndices.push_back(result.first->second);\n\n \/* If this is new combination, copy it to new interleaved arrays *\/\n if(result.second) newInterleavedArrays.insert(newInterleavedArrays.end(),\n interleavedArrays.begin()+oldIndex*stride,\n interleavedArrays.begin()+(oldIndex+1)*stride);\n }\n\n CORRADE_INTERNAL_ASSERT(combinedIndices.size() == interleavedArrays.size()\/stride &&\n newInterleavedArrays.size() <= interleavedArrays.size());\n\n return {std::move(combinedIndices), std::move(newInterleavedArrays)};\n}\n\n}}\n<commit_msg>MeshTools: fix test on build without assertions.<commit_after>\/*\n This file is part of Magnum.\n\n Copyright © 2010, 2011, 2012, 2013, 2014, 2015\n Vladimír Vondruš <mosra@centrum.cz>\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"CombineIndexedArrays.h\"\n\n#include <cstring>\n#include <unordered_map>\n#include <Corrade\/Utility\/Assert.h>\n#include <Corrade\/Utility\/MurmurHash2.h>\n\n#include \"Magnum\/Magnum.h\"\n\nnamespace Magnum { namespace MeshTools {\n\nnamespace Implementation {\n\nstd::pair<std::vector<UnsignedInt>, std::vector<UnsignedInt>> interleaveAndCombineIndexArrays(const std::reference_wrapper<const std::vector<UnsignedInt>>* begin, const std::reference_wrapper<const std::vector<UnsignedInt>>* end) {\n \/* Array stride and size *\/\n const UnsignedInt stride = end - begin;\n const UnsignedInt inputSize = begin->get().size();\n #if !defined(CORRADE_NO_ASSERT) || defined(CORRADE_GRACEFUL_ASSERT)\n for(auto it = begin; it != end; ++it)\n CORRADE_ASSERT(it->get().size() == inputSize, \"MeshTools::combineIndexArrays(): the arrays don't have the same size\", {});\n #endif\n\n \/* Interleave the arrays *\/\n std::vector<UnsignedInt> interleavedArrays;\n interleavedArrays.resize(inputSize*stride);\n for(UnsignedInt offset = 0; offset != stride; ++offset) {\n const auto& array = (begin+offset)->get();\n for(UnsignedInt i = 0; i != inputSize; ++i)\n interleavedArrays[offset + i*stride] = array[i];\n }\n\n \/* Combine them *\/\n std::vector<UnsignedInt> combinedIndices;\n std::tie(combinedIndices, interleavedArrays) = MeshTools::combineIndexArrays(interleavedArrays, stride);\n return {combinedIndices, interleavedArrays};\n}\n\nstd::vector<UnsignedInt> combineIndexArrays(const std::reference_wrapper<std::vector<UnsignedInt>>* const begin, const std::reference_wrapper<std::vector<UnsignedInt>>* const end) {\n \/* Interleave and combine the arrays *\/\n std::vector<UnsignedInt> combinedIndices;\n std::vector<UnsignedInt> interleavedCombinedArrays;\n std::tie(combinedIndices, interleavedCombinedArrays) = Implementation::interleaveAndCombineIndexArrays(\n \/* This will bite me hard once. *\/\n reinterpret_cast<const std::reference_wrapper<const std::vector<UnsignedInt>>*>(begin),\n reinterpret_cast<const std::reference_wrapper<const std::vector<UnsignedInt>>*>(end));\n\n \/* Update the original indices *\/\n const UnsignedInt stride = end - begin;\n const UnsignedInt outputSize = interleavedCombinedArrays.size()\/stride;\n for(UnsignedInt offset = 0; offset != stride; ++offset) {\n auto& array = (begin+offset)->get();\n CORRADE_INTERNAL_ASSERT(array.size() >= outputSize);\n array.resize(outputSize);\n for(UnsignedInt i = 0; i != outputSize; ++i)\n array[i] = interleavedCombinedArrays[offset + i*stride];\n }\n\n return combinedIndices;\n}\n\n}\n\nnamespace {\n\nclass IndexHash {\n public:\n explicit IndexHash(const std::vector<UnsignedInt>& indices, UnsignedInt stride): indices(indices), stride(stride) {}\n\n std::size_t operator()(UnsignedInt key) const {\n return *reinterpret_cast<const std::size_t*>(Utility::MurmurHash2()(reinterpret_cast<const char*>(indices.data()+key*stride), sizeof(UnsignedInt)*stride).byteArray());\n }\n\n private:\n const std::vector<UnsignedInt>& indices;\n UnsignedInt stride;\n};\n\nclass IndexEqual {\n public:\n explicit IndexEqual(const std::vector<UnsignedInt>& indices, UnsignedInt stride): indices(indices), stride(stride) {}\n\n bool operator()(UnsignedInt a, UnsignedInt b) const {\n return std::memcmp(indices.data()+a*stride, indices.data()+b*stride, sizeof(UnsignedInt)*stride) == 0;\n }\n\n private:\n const std::vector<UnsignedInt>& indices;\n UnsignedInt stride;\n};\n\n}\n\nstd::pair<std::vector<UnsignedInt>, std::vector<UnsignedInt>> combineIndexArrays(const std::vector<UnsignedInt>& interleavedArrays, const UnsignedInt stride) {\n CORRADE_ASSERT(stride != 0, \"MeshTools::combineIndexArrays(): stride can't be zero\", {});\n CORRADE_ASSERT(interleavedArrays.size() % stride == 0, \"MeshTools::combineIndexArrays(): array size is not divisible by stride\", {});\n\n \/* Hash map with index combinations, containing just indices into\n interleavedArrays vector, hashing and comparison is done using IndexHash\n and IndexEqual functors. Reserving more buckets than necessary (i.e. as\n if each combination was unique). *\/\n std::unordered_map<UnsignedInt, UnsignedInt, IndexHash, IndexEqual> indexCombinations(\n interleavedArrays.size()\/stride,\n IndexHash(interleavedArrays, stride),\n IndexEqual(interleavedArrays, stride));\n\n \/* Make the index combinations unique. Original indices into original\n `interleavedArrays` array were 0, 1, 2, 3, ..., `combinedIndices`\n contains new ones into new (shorter) `newInterleavedArrays` array. *\/\n std::vector<UnsignedInt> combinedIndices;\n combinedIndices.reserve(interleavedArrays.size()\/stride);\n std::vector<UnsignedInt> newInterleavedArrays;\n for(std::size_t oldIndex = 0, end = interleavedArrays.size()\/stride; oldIndex != end; ++oldIndex) {\n \/* Try to insert new index combination to the map *\/\n const auto result = indexCombinations.emplace(oldIndex, indexCombinations.size());\n\n \/* Add the (either new or already existing) index to resulting index array *\/\n combinedIndices.push_back(result.first->second);\n\n \/* If this is new combination, copy it to new interleaved arrays *\/\n if(result.second) newInterleavedArrays.insert(newInterleavedArrays.end(),\n interleavedArrays.begin()+oldIndex*stride,\n interleavedArrays.begin()+(oldIndex+1)*stride);\n }\n\n CORRADE_INTERNAL_ASSERT(combinedIndices.size() == interleavedArrays.size()\/stride &&\n newInterleavedArrays.size() <= interleavedArrays.size());\n\n return {std::move(combinedIndices), std::move(newInterleavedArrays)};\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/\/ NullFacility.cpp\n\/\/ Implements the NullFacility class\n\n#include <iostream>\n#include <sstream>\n\n#include \"NullFacility.h\"\n\n#include \"GenericResource.h\"\n#include \"Logger.h\"\n#include \"MarketModel.h\"\n#include \"CycException.h\"\n#include \"InputXML.h\"\n\nusing namespace std;\n\n\/**\n TICK\n send a request for your capacity minus your stocks.\n offer stocks + capacity\n \n TOCK\n process as much in stocks as your capacity will allow.\n send appropriate materials to fill ordersWaiting.\n \n RECIEVE MATERIAL\n put it in stocks\n \n SEND MATERIAL\n pull it from inventory, fill the transaction\n *\/\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::init(xmlNodePtr cur) { \n FacilityModel::init(cur);\n \n \/\/ move XML pointer to current model\n cur = XMLinput->get_xpath_element(cur,\"model\/NullFacility\");\n\n \/\/ all facilities require commodities - possibly many\n in_commod_ = XMLinput->get_xpath_content(cur,\"incommodity\");\n out_commod_ = XMLinput->get_xpath_content(cur,\"outcommodity\");\n\n inventory_.setCapacity(strtod(XMLinput->get_xpath_content(cur,\"inventorysize\"), NULL));\n stocks_.setCapacity(strtod(XMLinput->get_xpath_content(cur,\"inventorysize\"), NULL));\n capacity_ = strtod(XMLinput->get_xpath_content(cur,\"capacity\"), NULL);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::copy(NullFacility* src) {\n\n FacilityModel::copy(src);\n\n in_commod_ = src->in_commod_;\n out_commod_ = src->out_commod_;\n inventory_.setCapacity(src->inventory_.capacity());\n stocks_.setCapacity(src->stocks_.capacity());\n capacity_ = src->capacity_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::copyFreshModel(Model* src) {\n copy(dynamic_cast<NullFacility*>(src));\n}\n\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nstd::string NullFacility::str() { \n std::stringstream ss;\n ss << FacilityModel::str()\n << \" converts commodity '\"\n << in_commod_\n << \"' into commodity '\"\n << out_commod_\n << \"', with inventory holding \" \n << inventory_.capacity() << \" materials\"\n << \", and stock holding \" \n << stocks_.capacity() << \" materials\";\n return ss.str();\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::receiveMessage(msg_ptr msg) {\n \/\/ is this a message from on high? \n if (msg->supplier()==this) {\n \/\/ file the order\n ordersWaiting_.push_front(msg);\n } else {\n throw CycException(\"NullFacility is not the supplier of this msg.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvector<rsrc_ptr> NullFacility::removeResource(msg_ptr order) {\n Transaction trans = order->trans();\n if (trans.commod != out_commod_) {\n string err_msg = \"NullFacility can only send '\" + out_commod_ ;\n err_msg += + \"' materials.\";\n throw CycException(err_msg);\n }\n\n MatManifest mats;\n try {\n mats = inventory_.popQty(trans.resource->quantity());\n } catch(CycNegQtyException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"extraction of \" << trans.resource->quantity()\n << \" kg failed. Inventory is only \"\n << inventory_.quantity() << \" kg.\";\n }\n\n return ResourceBuff::toRes(mats);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::addResource(msg_ptr msg, std::vector<rsrc_ptr> manifest) {\n try {\n stocks_.pushAll(ResourceBuff::toMat(manifest));\n } catch(CycOverCapException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"addition of resources\"\n << \" to stocks failed. Stocks only has\"\n << stocks_.space() << \" kg of space.\";\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::handleTick(int time) {\n makeRequests();\n makeOffers();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::makeRequests() {\n double cantake = capacity_;\n if (cantake > inventory_.space()) {\n cantake = inventory_.space();\n } else if (cantake <= 0) {\n return;\n }\n LOG(LEV_INFO3, \"NulFac\") << name() << \" ID=\" << ID() << \" requesting \"\n << cantake << \"kg of \" << in_commod_ <<\".\";\n\n \/\/ build the transaction and message\n MarketModel* market = MarketModel::marketForCommod(in_commod_);\n Communicator* recipient = dynamic_cast<Communicator*>(market);\n Transaction trans = buildRequestTrans(cantake);\n msg_ptr request(new Message(this, recipient, trans)); \n request->setNextDest(facInst());\n request->sendOn();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nTransaction NullFacility::buildRequestTrans(double amt) {\n Transaction trans;\n gen_rsrc_ptr res = gen_rsrc_ptr(new GenericResource(in_commod_,\"kg\",amt));\n trans.commod = in_commod_;\n trans.minfrac = 0;\n trans.is_offer = false;\n trans.price = 0;\n trans.resource = res;\n return trans;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::makeOffers() {\n \/\/ decide how much to offer\n double offer_amt = inventory_.quantity() + stocks_.quantity();\n if (capacity_ < stocks_.quantity()) {\n offer_amt = inventory_.quantity() + capacity_;\n }\n if (offer_amt >= inventory_.capacity()) {\n offer_amt = inventory_.capacity(); \n }\n\n \/\/ there is no minimum amount a null facility may send\n double min_amt = 0;\n \/\/ and it's free\n double commod_price = 0;\n\n \/\/ create a Resource and build transaction\n gen_rsrc_ptr res = gen_rsrc_ptr(new GenericResource(out_commod_, \"kg\", offer_amt));\n Transaction trans;\n trans.commod = out_commod_;\n trans.minfrac = min_amt\/offer_amt;\n trans.is_offer = true;\n trans.price = commod_price;\n trans.resource = res;\n\n \/\/ build and send the message\n MarketModel* market = MarketModel::marketForCommod(out_commod_);\n Communicator* recipient = dynamic_cast<Communicator*>(market);\n msg_ptr msg(new Message(this, recipient, trans)); \n msg->setNextDest(facInst());\n msg->sendOn();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::handleTock(int time) {\n \/\/ at rate allowed by capacity, convert material in Stocks to out_commod_ type\n \/\/ move converted material into Inventory\n\n double tomake = capacity_;\n if (inventory_.space() < tomake) {\n tomake = inventory_.space();\n }\n if (stocks_.quantity() < tomake) {\n tomake = stocks_.quantity();\n }\n\n LOG(LEV_DEBUG1, \"NulFac\") << \"Transferring \" << tomake << \" kg of material from \"\n << \"stocks to inventory.\";\n try {\n inventory_.pushAll(stocks_.popQty(tomake));\n } catch(CycNegQtyException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"extraction of \" << tomake\n << \" kg from stocks failed. Stocks is only \"\n << stocks_.quantity() << \" kg.\";\n } catch(CycOverCapException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"addition of \" << tomake\n << \" kg from stocks to inventory failed. Inventory only has\"\n << inventory_.space() << \" kg of space.\";\n }\n\n \/\/ check what orders are waiting, \n while(!ordersWaiting_.empty()) {\n msg_ptr order = ordersWaiting_.front();\n order->approveTransfer();\n ordersWaiting_.pop_front();\n }\n}\n\n\/* --------------------\n * all MODEL classes have these members\n * --------------------\n *\/\n\nextern \"C\" Model* constructNullFacility() {\n return new NullFacility();\n}\n\n\/* ------------------- *\/ \n\n<commit_msg>null facility generates no offers if stocks+inventory are empty.<commit_after>\/\/ NullFacility.cpp\n\/\/ Implements the NullFacility class\n\n#include <iostream>\n#include <sstream>\n\n#include \"NullFacility.h\"\n\n#include \"GenericResource.h\"\n#include \"Logger.h\"\n#include \"MarketModel.h\"\n#include \"CycException.h\"\n#include \"InputXML.h\"\n\nusing namespace std;\n\n\/**\n TICK\n send a request for your capacity minus your stocks.\n offer stocks + capacity\n \n TOCK\n process as much in stocks as your capacity will allow.\n send appropriate materials to fill ordersWaiting.\n \n RECIEVE MATERIAL\n put it in stocks\n \n SEND MATERIAL\n pull it from inventory, fill the transaction\n *\/\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::init(xmlNodePtr cur) { \n FacilityModel::init(cur);\n \n \/\/ move XML pointer to current model\n cur = XMLinput->get_xpath_element(cur,\"model\/NullFacility\");\n\n \/\/ all facilities require commodities - possibly many\n in_commod_ = XMLinput->get_xpath_content(cur,\"incommodity\");\n out_commod_ = XMLinput->get_xpath_content(cur,\"outcommodity\");\n\n inventory_.setCapacity(strtod(XMLinput->get_xpath_content(cur,\"inventorysize\"), NULL));\n stocks_.setCapacity(strtod(XMLinput->get_xpath_content(cur,\"inventorysize\"), NULL));\n capacity_ = strtod(XMLinput->get_xpath_content(cur,\"capacity\"), NULL);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::copy(NullFacility* src) {\n\n FacilityModel::copy(src);\n\n in_commod_ = src->in_commod_;\n out_commod_ = src->out_commod_;\n inventory_.setCapacity(src->inventory_.capacity());\n stocks_.setCapacity(src->stocks_.capacity());\n capacity_ = src->capacity_;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::copyFreshModel(Model* src) {\n copy(dynamic_cast<NullFacility*>(src));\n}\n\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nstd::string NullFacility::str() { \n std::stringstream ss;\n ss << FacilityModel::str()\n << \" converts commodity '\"\n << in_commod_\n << \"' into commodity '\"\n << out_commod_\n << \"', with inventory holding \" \n << inventory_.capacity() << \" materials\"\n << \", and stock holding \" \n << stocks_.capacity() << \" materials\";\n return ss.str();\n};\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::receiveMessage(msg_ptr msg) {\n \/\/ is this a message from on high? \n if (msg->supplier()==this) {\n \/\/ file the order\n ordersWaiting_.push_front(msg);\n } else {\n throw CycException(\"NullFacility is not the supplier of this msg.\");\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvector<rsrc_ptr> NullFacility::removeResource(msg_ptr order) {\n Transaction trans = order->trans();\n if (trans.commod != out_commod_) {\n string err_msg = \"NullFacility can only send '\" + out_commod_ ;\n err_msg += + \"' materials.\";\n throw CycException(err_msg);\n }\n\n MatManifest mats;\n try {\n mats = inventory_.popQty(trans.resource->quantity());\n } catch(CycNegQtyException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"extraction of \" << trans.resource->quantity()\n << \" kg failed. Inventory is only \"\n << inventory_.quantity() << \" kg.\";\n }\n\n return ResourceBuff::toRes(mats);\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::addResource(msg_ptr msg, std::vector<rsrc_ptr> manifest) {\n try {\n stocks_.pushAll(ResourceBuff::toMat(manifest));\n } catch(CycOverCapException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"addition of resources\"\n << \" to stocks failed. Stocks only has\"\n << stocks_.space() << \" kg of space.\";\n }\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::handleTick(int time) {\n makeRequests();\n makeOffers();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::makeRequests() {\n double cantake = capacity_;\n if (cantake > inventory_.space()) {\n cantake = inventory_.space();\n } else if (cantake <= 0) {\n return;\n }\n LOG(LEV_INFO3, \"NulFac\") << name() << \" ID=\" << ID() << \" requesting \"\n << cantake << \"kg of \" << in_commod_ <<\".\";\n\n \/\/ build the transaction and message\n MarketModel* market = MarketModel::marketForCommod(in_commod_);\n Communicator* recipient = dynamic_cast<Communicator*>(market);\n Transaction trans = buildRequestTrans(cantake);\n msg_ptr request(new Message(this, recipient, trans)); \n request->setNextDest(facInst());\n request->sendOn();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nTransaction NullFacility::buildRequestTrans(double amt) {\n Transaction trans;\n gen_rsrc_ptr res = gen_rsrc_ptr(new GenericResource(in_commod_,\"kg\",amt));\n trans.commod = in_commod_;\n trans.minfrac = 0;\n trans.is_offer = false;\n trans.price = 0;\n trans.resource = res;\n return trans;\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::makeOffers() {\n \/\/ decide how much to offer\n double offer_amt = inventory_.quantity() + stocks_.quantity();\n if (capacity_ < stocks_.quantity()) {\n offer_amt = inventory_.quantity() + capacity_;\n }\n if (offer_amt >= inventory_.capacity()) {\n offer_amt = inventory_.capacity(); \n }\n\n if (offer_amt < EPS_KG) {\n return;\n }\n\n \/\/ there is no minimum amount a null facility may send\n double min_amt = 0;\n \/\/ and it's free\n double commod_price = 0;\n\n \/\/ create a Resource and build transaction\n gen_rsrc_ptr res = gen_rsrc_ptr(new GenericResource(out_commod_, \"kg\", offer_amt));\n Transaction trans;\n trans.commod = out_commod_;\n trans.minfrac = min_amt\/offer_amt;\n trans.is_offer = true;\n trans.price = commod_price;\n trans.resource = res;\n\n \/\/ build and send the message\n MarketModel* market = MarketModel::marketForCommod(out_commod_);\n Communicator* recipient = dynamic_cast<Communicator*>(market);\n msg_ptr msg(new Message(this, recipient, trans)); \n msg->setNextDest(facInst());\n msg->sendOn();\n}\n\n\/\/- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - \nvoid NullFacility::handleTock(int time) {\n \/\/ at rate allowed by capacity, convert material in Stocks to out_commod_ type\n \/\/ move converted material into Inventory\n\n double tomake = capacity_;\n if (inventory_.space() < tomake) {\n tomake = inventory_.space();\n }\n if (stocks_.quantity() < tomake) {\n tomake = stocks_.quantity();\n }\n\n LOG(LEV_DEBUG1, \"NulFac\") << \"Transferring \" << tomake << \" kg of material from \"\n << \"stocks to inventory.\";\n try {\n inventory_.pushAll(stocks_.popQty(tomake));\n } catch(CycNegQtyException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"extraction of \" << tomake\n << \" kg from stocks failed. Stocks is only \"\n << stocks_.quantity() << \" kg.\";\n } catch(CycOverCapException err) {\n LOG(LEV_ERROR, \"NulFac\") << \"addition of \" << tomake\n << \" kg from stocks to inventory failed. Inventory only has\"\n << inventory_.space() << \" kg of space.\";\n }\n\n \/\/ check what orders are waiting, \n while(!ordersWaiting_.empty()) {\n msg_ptr order = ordersWaiting_.front();\n order->approveTransfer();\n ordersWaiting_.pop_front();\n }\n}\n\n\/* --------------------\n * all MODEL classes have these members\n * --------------------\n *\/\n\nextern \"C\" Model* constructNullFacility() {\n return new NullFacility();\n}\n\n\/* ------------------- *\/ \n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2016> <Stephan Gatzka>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE state\/method access tests\n\n#include <boost\/test\/unit_test.hpp>\n#include <list>\n\n#include \"authenticate.h\"\n#include \"eventloop.h\"\n#include \"fetch.h\"\n#include \"json\/cJSON.h\"\n#include \"parse.h\"\n#include \"state.h\"\n#include \"table.h\"\n\n#define ARRAY_SIZE(x) (sizeof(x) \/ sizeof(*(x)))\n\nenum event {\n\tUNKNOWN_EVENT,\n\tADD_EVENT,\n\tCHANGE_EVENT,\n\tREMOVE_EVENT\n};\n\nstatic struct io_event *timer_ev;\nstatic struct eventloop loop;\n\nstatic const char users[] = \"users\";\nstatic const char admins[] = \"admin\";\n\nstatic cJSON *user_auth;\n\nstatic struct peer fetch_peer;\n\nstatic std::list<cJSON*> fetch_events;\n\nextern \"C\" {\n\tconst cJSON *credentials_ok(const char *user_name, char *passwd)\n\t{\n\t\t(void)passwd;\n\n\t\tif (::strcmp(user_name, \"user\") == 0) {\n\t\t\treturn user_auth;\n\t\t}\n\n\t\treturn NULL;\n\t}\n\n\tssize_t socket_read(socket_type sock, void *buf, size_t count)\n\t{\n\t\t(void)sock;\n\t\t(void)count;\n\t\tuint64_t number_of_timeouts = 1;\n\t\t::memcpy(buf, &number_of_timeouts, sizeof(number_of_timeouts));\n\t\treturn 8;\n\t}\n\n\tint socket_close(socket_type sock)\n\t{\n\t\t(void)sock;\n\t\treturn 0;\n\t}\n}\n\nstatic cJSON *parse_send_buffer(const char *json)\n{\n\tconst char *end_parse;\n\tcJSON *root = cJSON_ParseWithOpts(json, &end_parse, 0);\n\treturn root;\n}\n\nstatic int send_message(const struct peer *p, char *rendered, size_t len)\n{\n\t(void)len;\n\tif (p == &fetch_peer) {\n\t\tcJSON *fetch_event = parse_send_buffer(rendered);\n\t\tfetch_events.push_back(fetch_event);\n\t}\n\n\treturn 0;\n}\n\nstatic enum eventloop_return fake_add(const void *this_ptr, const struct io_event *ev)\n{\n\t(void)this_ptr;\n\ttimer_ev = (struct io_event *)ev;\n\treturn EL_CONTINUE_LOOP;\n}\n\nstatic void fake_remove(const void *this_ptr, const struct io_event *ev)\n{\n\t(void)this_ptr;\n\t(void)ev;\n\ttimer_ev = NULL;\n\treturn;\n}\n\nstatic cJSON *create_fetch_params(const char *path_equals_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"id\", \"fetch_id_1\");\n\tcJSON *path = cJSON_CreateObject();\n\tBOOST_REQUIRE(path != NULL);\n\tcJSON_AddItemToObject(root, \"path\", path);\n\tif (strlen(path_equals_string)) {\n\t\tcJSON_AddStringToObject(path, \"equals\", path_equals_string);\n\t}\n\treturn root;\n}\n\nstatic enum event get_event_from_json(cJSON *json)\n{\n\tcJSON *params = cJSON_GetObjectItem(json, \"params\");\n\tif (params == NULL) return UNKNOWN_EVENT;\n\tcJSON *event = cJSON_GetObjectItem(params, \"event\");\n\tif (event == NULL) return UNKNOWN_EVENT;\n\tif (event->type != cJSON_String) return UNKNOWN_EVENT;\n\tif (strcmp(event->valuestring, \"add\") == 0) return ADD_EVENT;\n\tif (strcmp(event->valuestring, \"change\") == 0) return CHANGE_EVENT;\n\tif (strcmp(event->valuestring, \"remove\") == 0) return REMOVE_EVENT;\n\treturn UNKNOWN_EVENT;\n}\n\nstruct F {\n\tF()\n\t{\n\t\ttimer_ev = NULL;\n\t\tloop.this_ptr = NULL;\n\t\tloop.init = NULL;\n\t\tloop.destroy = NULL;\n\t\tloop.run = NULL;\n\t\tloop.add = fake_add;\n\t\tloop.remove = fake_remove;\n\n\t\tinit_parser();\n\t\tstate_hashtable_create();\n\t\tinit_peer(&owner_peer, false, &loop);\n\t\towner_peer.send_message = send_message;\n\t\tinit_peer(&set_peer, false, &loop);\n\t\tset_peer.send_message = send_message;\n\t\tinit_peer(&fetch_peer, false, &loop);\n\t\tfetch_peer.send_message = send_message;\n\n\t\tcJSON *groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(admins));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(\"operators\"));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(\"viewers\"));\n\t\tcreate_groups();\n\t\tadd_groups(groups);\n\t\tcJSON_Delete(groups);\n\n\t\tuser_auth = cJSON_CreateObject();\n\t\tcJSON *fetch_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"fetchGroups\", fetch_groups);\n\t\tcJSON *set_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(set_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"setGroups\", set_groups);\n\t\tcJSON *call_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(call_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"callGroups\", call_groups);\n\t}\n\n\t~F()\n\t{\n\t\twhile (!fetch_events.empty()) {\n\t\t\tcJSON *ptr = fetch_events.front();\n\t\t\tfetch_events.pop_front();\n\t\t\tcJSON_Delete(ptr);\n\t\t}\n\t\tcJSON_Delete(user_auth);\n\t\tfree_groups();\n\t\tfree_peer_resources(&fetch_peer);\n\t\tfree_peer_resources(&set_peer);\n\t\tfree_peer_resources(&owner_peer);\n\t\tstate_hashtable_delete();\n\t}\n\n\tstruct peer owner_peer;\n\tstruct peer set_peer;\n};\n\nBOOST_FIXTURE_TEST_CASE(fetch_state_allowed, F)\n{\n\tconst char path[] = \"\/foo\/bar\/\";\n\tcJSON *value = cJSON_CreateNumber(1234);\n\tcJSON *access = cJSON_CreateObject();\n\tcJSON *fetch_groups = cJSON_CreateArray();\n\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(admins));\n\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(users));\n\tcJSON_AddItemToObject(access, \"fetchGroups\", fetch_groups);\n\tcJSON *set_groups = cJSON_CreateArray();\n\tcJSON_AddItemToArray(set_groups, cJSON_CreateString(admins));\n\tcJSON_AddItemToObject(access, \"setGroups\", set_groups);\n\n\tcJSON *error = add_state_or_method_to_peer(&owner_peer, path, value, access, 0x00, CONFIG_ROUTED_MESSAGES_TIMEOUT);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_state_or_method_to_peer() failed!\");\n\n\tcJSON_Delete(value);\n\tcJSON_Delete(access);\n\n\tchar password[] = \"user_passwd\";\n\terror = handle_authentication(&fetch_peer, \"user\", password);\n\tBOOST_CHECK_MESSAGE(error == NULL, \"fetch peer authentication failed!\");\n\n\n\tstruct fetch *f = NULL;\n\tcJSON *params = create_fetch_params(path);\n\terror = add_fetch_to_peer(&fetch_peer, params, &f);\n\tcJSON_Delete(params);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_fetch_to_peer() failed!\");\n\terror = add_fetch_to_states(f);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_fetch_to_states() failed!\");\n\n\tBOOST_REQUIRE_MESSAGE(fetch_events.size() == 1, \"Number of emitted events != 1!\");\n\tcJSON *json = fetch_events.front();\n\tfetch_events.pop_front();\n\tevent event = get_event_from_json(json);\n\tBOOST_CHECK_MESSAGE(event == ADD_EVENT, \"Emitted event is not an ADD event!\");\n\tcJSON_Delete(json);\n\tremove_all_fetchers_from_peer(&fetch_peer);\n\n\tint ret = remove_state_or_method_from_peer(&owner_peer, path);\n\tBOOST_CHECK_MESSAGE(ret == 0, \"remove_state_or_method_from_peer() failed!\");\n}\n<commit_msg>Ensure that fetch without access rights will not get an add event.<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2016> <Stephan Gatzka>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE state\/method access tests\n\n#include <boost\/test\/unit_test.hpp>\n#include <list>\n\n#include \"authenticate.h\"\n#include \"eventloop.h\"\n#include \"fetch.h\"\n#include \"json\/cJSON.h\"\n#include \"parse.h\"\n#include \"state.h\"\n#include \"table.h\"\n\n#define ARRAY_SIZE(x) (sizeof(x) \/ sizeof(*(x)))\n\nenum event {\n\tUNKNOWN_EVENT,\n\tADD_EVENT,\n\tCHANGE_EVENT,\n\tREMOVE_EVENT\n};\n\nstatic struct io_event *timer_ev;\nstatic struct eventloop loop;\n\nconst char path[] = \"\/foo\/bar\/\";\n\nstatic const char users[] = \"users\";\nstatic const char admins[] = \"admin\";\n\nstatic cJSON *user_auth;\n\nstatic struct peer fetch_peer;\n\nstatic std::list<cJSON*> fetch_events;\n\nextern \"C\" {\n\tconst cJSON *credentials_ok(const char *user_name, char *passwd)\n\t{\n\t\t(void)passwd;\n\n\t\tif (::strcmp(user_name, \"user\") == 0) {\n\t\t\treturn user_auth;\n\t\t}\n\n\t\treturn NULL;\n\t}\n\n\tssize_t socket_read(socket_type sock, void *buf, size_t count)\n\t{\n\t\t(void)sock;\n\t\t(void)count;\n\t\tuint64_t number_of_timeouts = 1;\n\t\t::memcpy(buf, &number_of_timeouts, sizeof(number_of_timeouts));\n\t\treturn 8;\n\t}\n\n\tint socket_close(socket_type sock)\n\t{\n\t\t(void)sock;\n\t\treturn 0;\n\t}\n}\n\nstatic cJSON *parse_send_buffer(const char *json)\n{\n\tconst char *end_parse;\n\tcJSON *root = cJSON_ParseWithOpts(json, &end_parse, 0);\n\treturn root;\n}\n\nstatic int send_message(const struct peer *p, char *rendered, size_t len)\n{\n\t(void)len;\n\tif (p == &fetch_peer) {\n\t\tcJSON *fetch_event = parse_send_buffer(rendered);\n\t\tfetch_events.push_back(fetch_event);\n\t}\n\n\treturn 0;\n}\n\nstatic enum eventloop_return fake_add(const void *this_ptr, const struct io_event *ev)\n{\n\t(void)this_ptr;\n\ttimer_ev = (struct io_event *)ev;\n\treturn EL_CONTINUE_LOOP;\n}\n\nstatic void fake_remove(const void *this_ptr, const struct io_event *ev)\n{\n\t(void)this_ptr;\n\t(void)ev;\n\ttimer_ev = NULL;\n\treturn;\n}\n\nstatic cJSON *create_fetch_params(const char *path_equals_string)\n{\n\tcJSON *root = cJSON_CreateObject();\n\tBOOST_REQUIRE(root != NULL);\n\tcJSON_AddStringToObject(root, \"id\", \"fetch_id_1\");\n\tcJSON *path = cJSON_CreateObject();\n\tBOOST_REQUIRE(path != NULL);\n\tcJSON_AddItemToObject(root, \"path\", path);\n\tif (strlen(path_equals_string)) {\n\t\tcJSON_AddStringToObject(path, \"equals\", path_equals_string);\n\t}\n\treturn root;\n}\n\nstatic enum event get_event_from_json(cJSON *json)\n{\n\tcJSON *params = cJSON_GetObjectItem(json, \"params\");\n\tif (params == NULL) return UNKNOWN_EVENT;\n\tcJSON *event = cJSON_GetObjectItem(params, \"event\");\n\tif (event == NULL) return UNKNOWN_EVENT;\n\tif (event->type != cJSON_String) return UNKNOWN_EVENT;\n\tif (strcmp(event->valuestring, \"add\") == 0) return ADD_EVENT;\n\tif (strcmp(event->valuestring, \"change\") == 0) return CHANGE_EVENT;\n\tif (strcmp(event->valuestring, \"remove\") == 0) return REMOVE_EVENT;\n\treturn UNKNOWN_EVENT;\n}\n\nstatic void perform_fetch(const char *path)\n{\n\tstruct fetch *f = NULL;\n\tcJSON *params = create_fetch_params(path);\n\tcJSON *error = add_fetch_to_peer(&fetch_peer, params, &f);\n\tcJSON_Delete(params);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_fetch_to_peer() failed!\");\n\terror = add_fetch_to_states(f);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_fetch_to_states() failed!\");\n}\n\nstruct F {\n\tF()\n\t{\n\t\ttimer_ev = NULL;\n\t\tloop.this_ptr = NULL;\n\t\tloop.init = NULL;\n\t\tloop.destroy = NULL;\n\t\tloop.run = NULL;\n\t\tloop.add = fake_add;\n\t\tloop.remove = fake_remove;\n\n\t\tinit_parser();\n\t\tstate_hashtable_create();\n\t\tinit_peer(&owner_peer, false, &loop);\n\t\towner_peer.send_message = send_message;\n\t\tinit_peer(&set_peer, false, &loop);\n\t\tset_peer.send_message = send_message;\n\t\tinit_peer(&fetch_peer, false, &loop);\n\t\tfetch_peer.send_message = send_message;\n\n\t\tcJSON *groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(admins));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(\"operators\"));\n\t\tcJSON_AddItemToArray(groups, cJSON_CreateString(\"viewers\"));\n\t\tcreate_groups();\n\t\tadd_groups(groups);\n\t\tcJSON_Delete(groups);\n\n\t\tuser_auth = cJSON_CreateObject();\n\t\tcJSON *fetch_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"fetchGroups\", fetch_groups);\n\t\tcJSON *set_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(set_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"setGroups\", set_groups);\n\t\tcJSON *call_groups = cJSON_CreateArray();\n\t\tcJSON_AddItemToArray(call_groups, cJSON_CreateString(users));\n\t\tcJSON_AddItemToObject(user_auth, \"callGroups\", call_groups);\n\n\t\tvalue = cJSON_CreateNumber(1234);\n\t\tpassword = ::strdup(\"password\");\n\t}\n\n\t~F()\n\t{\n\t\t::free(password);\n\t\tcJSON_Delete(value);\n\n\t\twhile (!fetch_events.empty()) {\n\t\t\tcJSON *ptr = fetch_events.front();\n\t\t\tfetch_events.pop_front();\n\t\t\tcJSON_Delete(ptr);\n\t\t}\n\t\tcJSON_Delete(user_auth);\n\t\tfree_groups();\n\t\tfree_peer_resources(&fetch_peer);\n\t\tfree_peer_resources(&set_peer);\n\t\tfree_peer_resources(&owner_peer);\n\t\tstate_hashtable_delete();\n\t}\n\n\tcJSON *value;\n\tchar *password;\n\tstruct peer owner_peer;\n\tstruct peer set_peer;\n};\n\nBOOST_FIXTURE_TEST_CASE(fetch_state_allowed, F)\n{\n\tcJSON *access = cJSON_CreateObject();\n\tcJSON *fetch_groups = cJSON_CreateArray();\n\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(users));\n\tcJSON_AddItemToObject(access, \"fetchGroups\", fetch_groups);\n\n\tcJSON *error = add_state_or_method_to_peer(&owner_peer, path, value, access, 0x00, CONFIG_ROUTED_MESSAGES_TIMEOUT);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_state_or_method_to_peer() failed!\");\n\tcJSON_Delete(access);\n\n\terror = handle_authentication(&fetch_peer, \"user\", password);\n\tBOOST_CHECK_MESSAGE(error == NULL, \"fetch peer authentication failed!\");\n\n\tperform_fetch(path);\n\tBOOST_REQUIRE_MESSAGE(fetch_events.size() == 1, \"Number of emitted events != 1!\");\n\tcJSON *json = fetch_events.front();\n\tfetch_events.pop_front();\n\tevent event = get_event_from_json(json);\n\tBOOST_CHECK_MESSAGE(event == ADD_EVENT, \"Emitted event is not an ADD event!\");\n\tcJSON_Delete(json);\n\tremove_all_fetchers_from_peer(&fetch_peer);\n}\n\nBOOST_FIXTURE_TEST_CASE(fetch_state_not_allowed, F)\n{\n\tcJSON *access = cJSON_CreateObject();\n\tcJSON *fetch_groups = cJSON_CreateArray();\n\tcJSON_AddItemToArray(fetch_groups, cJSON_CreateString(admins));\n\tcJSON_AddItemToObject(access, \"fetchGroups\", fetch_groups);\n\n\tcJSON *error = add_state_or_method_to_peer(&owner_peer, path, value, access, 0x00, CONFIG_ROUTED_MESSAGES_TIMEOUT);\n\tBOOST_REQUIRE_MESSAGE(error == NULL, \"add_state_or_method_to_peer() failed!\");\n\tcJSON_Delete(access);\n\n\terror = handle_authentication(&fetch_peer, \"user\", password);\n\tBOOST_CHECK_MESSAGE(error == NULL, \"fetch peer authentication failed!\");\n\n\tperform_fetch(path);\n\tBOOST_REQUIRE_MESSAGE(fetch_events.size() == 0, \"Number of emitted events != 0!\");\n\tremove_all_fetchers_from_peer(&fetch_peer);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2012 Scientific Computing and Imaging Institute,\n University of Utah.\n\n License for the specific language governing rights and limitations under\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Testing\/ModuleTestBase\/ModuleTestBase.h>\n#include <Modules\/Visualization\/ShowField.h>\n#include <Core\/Datatypes\/Legacy\/Field\/Field.h>\n#include <Core\/Algorithms\/Base\/AlgorithmVariableNames.h>\n#include <Core\/Utils\/Exception.h>\n#include <Core\/Logging\/Log.h>\n\nusing namespace SCIRun::Testing;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core;\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Logging;\nusing ::testing::Values;\nusing ::testing::Combine;\nusing ::testing::Range;\n\nclass ShowFieldScalingTest : public ParameterizedModuleTest<int>\n{\nprotected:\n virtual void SetUp()\n {\n Log::get().setVerbose(false);\n showField = makeModule(\"ShowField\");\n showField->setStateDefaults();\n auto size = GetParam();\n latVol = CreateEmptyLatVol(size, size, size);\n stubPortNWithThisData(showField, 0, latVol);\n Log::get() << INFO << \"Setting up ShowField with size \" << size << \"^3 latvol\" << std::endl;\n }\n\n UseRealModuleStateFactory f;\n ModuleHandle showField;\n FieldHandle latVol;\n};\n\nTEST_P(ShowFieldScalingTest, ConstructLatVolGeometry)\n{\n Log::get() << INFO << \"Start ShowField::execute\" << std::endl;\n showField->execute();\n Log::get() << INFO << \"End ShowField::execute\" << std::endl;\n}\n\nINSTANTIATE_TEST_CASE_P(\n ConstructLatVolGeometry,\n ShowFieldScalingTest,\n Values(20, 40, 60, 80\n \/\/, 100, 120, 150 \/\/too slow already\n )\n );<commit_msg>Extend test for Mac<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2012 Scientific Computing and Imaging Institute,\n University of Utah.\n\n License for the specific language governing rights and limitations under\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Testing\/ModuleTestBase\/ModuleTestBase.h>\n#include <Modules\/Visualization\/ShowField.h>\n#include <Core\/Datatypes\/Legacy\/Field\/Field.h>\n#include <Core\/Algorithms\/Base\/AlgorithmVariableNames.h>\n#include <Core\/Utils\/Exception.h>\n#include <Core\/Logging\/Log.h>\n\nusing namespace SCIRun::Testing;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Core::Algorithms;\nusing namespace SCIRun::Core;\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Logging;\nusing ::testing::Values;\nusing ::testing::Combine;\nusing ::testing::Range;\n\nclass ShowFieldScalingTest : public ParameterizedModuleTest<int>\n{\nprotected:\n virtual void SetUp()\n {\n Log::get().setVerbose(false);\n showField = makeModule(\"ShowField\");\n showField->setStateDefaults();\n auto size = GetParam();\n latVol = CreateEmptyLatVol(size, size, size);\n stubPortNWithThisData(showField, 0, latVol);\n Log::get() << INFO << \"Setting up ShowField with size \" << size << \"^3 latvol\" << std::endl;\n }\n\n UseRealModuleStateFactory f;\n ModuleHandle showField;\n FieldHandle latVol;\n};\n\nTEST_P(ShowFieldScalingTest, ConstructLatVolGeometry)\n{\n Log::get() << INFO << \"Start ShowField::execute\" << std::endl;\n showField->execute();\n Log::get() << INFO << \"End ShowField::execute\" << std::endl;\n}\n\nINSTANTIATE_TEST_CASE_P(\n ConstructLatVolGeometry,\n ShowFieldScalingTest,\n Values(20, 40, 60, 80\n #ifndef WIN32 \/\/too slow already\n , 100, 120, 150, 200, 256\n #endif\n )\n );\n<|endoftext|>"} {"text":"<commit_before>#include <climits>\n#include \"splitter.hpp\"\n\n\nquestion_data splitter::operator() (question_raw_data const& raw)\n{\n question_data formed = {\n raw.split_num,\n raw.selectable_num,\n raw.cost.first,\n raw.cost.second,\n std::vector<std::vector<int>>(raw.split_num.second, std::vector<int>(raw.split_num.first, INT_MAX) )\n };\n\n auto& block = formed.block;\n\n \/\/\n \/\/ Sub Algorithm\n \/\/ 正しい位置に並べた時に左上から，1~nまでの番号をふり，それが今どこにあるのかという情報をblockに格納\n \/\/\n\n\n\n \/\/ Sub Algorithm End\n\n return formed;\n}\n<commit_msg>split_image function impled.<commit_after>#include <climits>\n#include \"splitter.hpp\"\n\n\/\/ 気持ち悪いが，[i][j]の位置に分割された画像が入っている．更に[j][k]へのアクセスによって画素にアクセス\ntypedef std::vector<std::vector<std::vector<std::vector<std::tuple<char,char,char>>>>> split_image_type;\n\nvoid recursive_operation(std::pair<int,int> const now, split_image_type const& split_image, std::vector<std::vector<int>>& output)\n{\n \/\/\/\/ nowの上下左右に隣接するブロックを探して，それに再帰する\n \/\/{\n \/\/ auto const target = std::make_pair(now.first + 1, now.second);\n \/\/ for(\n \/\/}\n\n\n return;\n}\n\nsplit_image_type split_image(question_raw_data const& raw)\n{\n int const parts_width = raw.size.first \/ raw.split_num.first;\n int const parts_height = raw.size.second \/ raw.split_num.second;\n\n std::vector<std::vector<std::vector<std::vector<std::tuple<char,char,char>>>>> split_pixels(\n raw.split_num.second,\n std::vector<std::vector<std::vector<std::tuple<char,char,char>>>>(\n raw.split_num.first,\n std::vector<std::vector<std::tuple<char,char,char>>>(\n parts_height,\n std::vector<std::tuple<char,char,char>>(\n parts_width,\n std::make_tuple(0,0,0)\n )\n )\n )\n );\n\n for(int i=0; i<raw.split_num.second; ++i) for(int j=0; j<raw.split_num.first; ++j)\n {\n int const splitting_pos = i * raw.split_num.first + j;\n for(int k=0; k<parts_height; ++k) for(int l=0; l<parts_width; ++l)\n {\n split_pixels[i][j][k][l] = raw.pixels[parts_height * i + k][parts_width * j + l];\n }\n }\n\n return split_pixels;\n}\n\nquestion_data splitter::operator() (question_raw_data const& raw)\n{\n question_data formed = {\n raw.split_num,\n raw.selectable_num,\n raw.cost.first,\n raw.cost.second,\n std::vector<std::vector<int>>(raw.split_num.second, std::vector<int>(raw.split_num.first, INT_MAX) )\n };\n\n auto& block = formed.block;\n\n \/\/\n \/\/ Sub Algorithm\n \/\/ 正しい位置に並べた時に左上から，1~nまでの番号をふり，それが今どこにあるのかという情報をblockに格納\n \/\/\n\n auto const split_pixels = split_image(raw);\n\n\n\n \/\/ Sub Algorithm End\n\n return formed;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\n\/\/ Copyright 2014 Celtoys Ltd\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\n#include <string>\n#include <vector>\n\n#include \"ComputeParser.h\"\n\n\n\/\/ stdout configuration\nbool g_PrintHeader = true;\nbool g_PrintHelp = false;\nbool g_Verbose = false;\n\nstd::string g_InputFilename;\nstd::string g_OutputFilename;\n\n\n#define LOG if (g_Verbose) printf\n\n#ifndef _MSC_VER\n#include <cstring>\n#include <strings.h>\n#include <cstdio>\n#define strcmpi strcasecmp\n#endif\n\nconst char* ParseArguments(int argc, const char* argv[])\n{\n\tint i;\n\n\tfor (i = 1; i < argc; i++)\n\t{\n\t\tconst char* arg = argv[i];\n\n\t\t\/\/ Is this an option?\n\t\tif (arg[0] == '-')\n\t\t{\n\t\t\tif (!strcmpi(arg, \"-h\"))\n\t\t\t{\n\t\t\t\tg_PrintHelp = true;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-noheader\"))\n\t\t\t{\n\t\t\t\tg_PrintHeader = false;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-verbose\"))\n\t\t\t{\n\t\t\t\tg_Verbose = true;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-output\") && i < argc - 1)\n\t\t\t{\n\t\t\t\tg_OutputFilename = argv[i + 1];\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\t\/\/ Must be a filename\n\t\t\tg_InputFilename = arg;\n\t\t}\n\t}\n\n\tif (g_InputFilename[0] == 0)\n\t\treturn \"No input filename specified\";\n\n\treturn 0;\n}\n\n\nvoid PrintHeader()\n{\n\tprintf(\"cbpp Compute Bridge Preprocessor Copyright 2014 Celtoys Ltd\\n\");\n\tprintf(\"Licensed under the Apache License, Version 2.0 \\n\");\n}\n\n\nvoid PrintUsage()\n{\n\tprintf(\"Usage: cbpp [options] filename\\n\");\n\n\tif (g_PrintHelp)\n\t{\n\t\tprintf(\"\\nOptions are:\\n\\n\");\n\t\tprintf(\" -noheader Supress header\\n\");\n\t\tprintf(\" -verbose Print logs detailing what cbpp is doing behind the scenes\\n\");\n\t}\n}\n\n\nclass ComputeProcessor\n{\npublic:\n\tComputeProcessor()\n\t\t: m_MemoryFile(0)\n\t\t, m_LexerCursor(0)\n\t\t, m_ParserCursor(0)\n\t{\n\t}\n\n\tbool Parse(const char* filename)\n\t{\n\t\t\/\/ Open the input file\n\t\tLOG(\"Opening file '%s'\\n\", filename);\n\t\tif (cmpError error = cmpMemoryFile_Create(&m_MemoryFile, filename))\n\t\t{\n\t\t\tprintf(\"Error opening input file: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Build a list of tokens\n\t\tLOG(\"Running lexer\\n\");\n\t\tif (cmpError error = cmpLexerCursor_Create(&m_LexerCursor, cmpMemoryFile_Data(m_MemoryFile), cmpMemoryFile_Size(m_MemoryFile)))\n\t\t{\n\t\t\tprintf(\"Error creating lexer cursor: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\t\twhile (cmpToken token = cmpLexer_ConsumeToken(m_LexerCursor))\n\t\t{\n\t\t\tm_Tokens.push_back(token);\n\t\t\tLOG(\"[0x%2x] %s %d\\n\", token.type, cmpTokenType_Name(token.type), token.length);\n\t\t}\n\n\t\t\/\/ Print any lexer errors\n\t\tif (cmpError error = cmpLexerCursor_Error(m_LexerCursor))\n\t\t{\n\t\t\tprintf(\"%s(%d): %s\\n\", filename, cmpLexerCursor_Line(m_LexerCursor), cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Build a list of parser nodes\n\t\tLOG(\"Running parser\\n\");\n\t\tif (cmpError error = cmpParserCursor_Create(&m_ParserCursor, m_Tokens.data(), m_Tokens.size()))\n\t\t{\n\t\t\tprintf(\"Error creating parser cursor: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\t\twhile (cmpNode* node = cmpParser_ConsumeNode(m_ParserCursor))\n\t\t\tm_Nodes.push_back(node);\n\n\t\tif (g_Verbose)\n\t\t{\n\t\t\tfor (size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\t\tcmpParser_LogNodes(m_Nodes[i], 0);\n\t\t}\n\n\t\t\/\/ Print any parser errors\n\t\tif (cmpError error = cmpParserCursor_Error(m_ParserCursor))\n\t\t{\n\t\t\tprintf(\"%s(%d): %s\\n\",filename, cmpParserCursor_Line(m_ParserCursor), cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool EmitFile(const char* filename)\n\t{\n\t\tFILE* fp = fopen(filename, \"wb\");\n\t\tif (fp == NULL)\n\t\t\treturn false;\n\n\t\tfor (size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\tEmitNode(fp, m_Nodes[i]);\n\n\t\tfclose(fp);\n\t\treturn true;\n\t}\n\n\t~ComputeProcessor()\n\t{\n\t\tfor (std::size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\tcmpNode_Destroy(m_Nodes[i]);\n\n\t\tif (m_ParserCursor != 0)\n\t\t\tcmpParserCursor_Destroy(m_ParserCursor);\n\n\t\tif (m_LexerCursor != 0)\n\t\t\tcmpLexerCursor_Destroy(m_LexerCursor);\n\n\t\tif (m_MemoryFile != 0)\n\t\t\tcmpMemoryFile_Destroy(m_MemoryFile);\n\t}\n\nprivate:\n\tvoid EmitNode(FILE* fp, const cmpNode* node)\n\t{\n\t\tfor (cmpU32 i = 0; i < node->nb_tokens; i++)\n\t\t{\n\t\t\tconst cmpToken& token = node->start_token[i];\n\t\t\tfprintf(fp, \"%.*s\", token.length, token.start);\n\t\t}\n\n\t\tfor (const cmpNode* child = node->first_child; child != 0; child = child->next_sibling)\n\t\t\tEmitNode(fp, child);\n\t}\n\n\t\/\/ Parser runtime\n\tcmpMemoryFile* m_MemoryFile;\n\tcmpLexerCursor* m_LexerCursor;\n\tcmpParserCursor* m_ParserCursor;\n\n\t\/\/ Generated tokens and AST\n\tstd::vector<cmpToken> m_Tokens;\n\tstd::vector<cmpNode*> m_Nodes;\n};\n\n\nint main(int argc, const char* argv[])\n{\n\t\/\/ Attempt to parse arguments\n\tif (const char* error = ParseArguments(argc, argv))\n\t{\n\t\tPrintHeader();\n\t\tprintf(\"\\nError parsing arguments: %s\\n\\n\", error);\n\t\tPrintUsage();\n\t\treturn 1;\n\t}\n\n\t\/\/ Print program information\n\tif (g_PrintHeader)\n\t\tPrintHeader();\n\tif (g_PrintHelp)\n\t\tPrintUsage();\n\n\tComputeProcessor processor;\n\tif (!processor.Parse(g_InputFilename.c_str()))\n\t\treturn 1;\n\n\tif (!g_OutputFilename.empty())\n\t{\n\t\tif (!processor.EmitFile(g_OutputFilename.c_str()))\n\t\t{\n\t\t\tprintf(\"Couldn't write to output file %s\\n\", g_OutputFilename.c_str());\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Add node visiting to the compute processor.<commit_after>\n\/\/\n\/\/ Copyright 2014 Celtoys Ltd\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\n\n#include <string>\n#include <vector>\n#include <cassert>\n\n#include \"ComputeParser.h\"\n\n\n\/\/ stdout configuration\nbool g_PrintHeader = true;\nbool g_PrintHelp = false;\nbool g_Verbose = false;\n\nstd::string g_InputFilename;\nstd::string g_OutputFilename;\n\n\n#define LOG if (g_Verbose) printf\n\n#ifndef _MSC_VER\n#include <cstring>\n#include <strings.h>\n#include <cstdio>\n#define strcmpi strcasecmp\n#endif\n\nconst char* ParseArguments(int argc, const char* argv[])\n{\n\tint i;\n\n\tfor (i = 1; i < argc; i++)\n\t{\n\t\tconst char* arg = argv[i];\n\n\t\t\/\/ Is this an option?\n\t\tif (arg[0] == '-')\n\t\t{\n\t\t\tif (!strcmpi(arg, \"-h\"))\n\t\t\t{\n\t\t\t\tg_PrintHelp = true;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-noheader\"))\n\t\t\t{\n\t\t\t\tg_PrintHeader = false;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-verbose\"))\n\t\t\t{\n\t\t\t\tg_Verbose = true;\n\t\t\t}\n\n\t\t\telse if (!strcmpi(arg, \"-output\") && i < argc - 1)\n\t\t\t{\n\t\t\t\tg_OutputFilename = argv[i + 1];\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\n\t\telse\n\t\t{\n\t\t\t\/\/ Must be a filename\n\t\t\tg_InputFilename = arg;\n\t\t}\n\t}\n\n\tif (g_InputFilename[0] == 0)\n\t\treturn \"No input filename specified\";\n\n\treturn 0;\n}\n\n\nvoid PrintHeader()\n{\n\tprintf(\"cbpp Compute Bridge Preprocessor Copyright 2014 Celtoys Ltd\\n\");\n\tprintf(\"Licensed under the Apache License, Version 2.0 \\n\");\n}\n\n\nvoid PrintUsage()\n{\n\tprintf(\"Usage: cbpp [options] filename\\n\");\n\n\tif (g_PrintHelp)\n\t{\n\t\tprintf(\"\\nOptions are:\\n\\n\");\n\t\tprintf(\" -noheader Supress header\\n\");\n\t\tprintf(\" -verbose Print logs detailing what cbpp is doing behind the scenes\\n\");\n\t}\n}\n\n\nstruct INodeVisitor\n{\n\tvirtual void Visit(cmpNode& node) = 0;\n};\n\n\nstruct EmitFile : public INodeVisitor\n{\n\tEmitFile(const char* filename)\n\t\t: fp(0)\n\t{\n\t\tfp = fopen(filename, \"wb\");\n\t}\n\n\t~EmitFile()\n\t{\n\t\tif (fp != 0)\n\t\t\tfclose(fp);\n\t}\n\n\tvoid Visit(cmpNode& node)\n\t{\n\t\tfor (cmpU32 i = 0; i < node.nb_tokens; i++)\n\t\t{\n\t\t\tconst cmpToken& token = node.start_token[i];\n\t\t\tfprintf(fp, \"%.*s\", token.length, token.start);\n\t\t}\n\t}\n\n\tFILE* fp;\n};\n\n\nclass ComputeProcessor\n{\npublic:\n\tComputeProcessor()\n\t\t: m_MemoryFile(0)\n\t\t, m_LexerCursor(0)\n\t\t, m_ParserCursor(0)\n\t{\n\t}\n\n\t~ComputeProcessor()\n\t{\n\t\tfor (std::size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\tcmpNode_Destroy(m_Nodes[i]);\n\n\t\tif (m_ParserCursor != 0)\n\t\t\tcmpParserCursor_Destroy(m_ParserCursor);\n\n\t\tif (m_LexerCursor != 0)\n\t\t\tcmpLexerCursor_Destroy(m_LexerCursor);\n\n\t\tif (m_MemoryFile != 0)\n\t\t\tcmpMemoryFile_Destroy(m_MemoryFile);\n\t}\n\n\tbool Parse(const char* filename)\n\t{\n\t\t\/\/ Open the input file\n\t\tLOG(\"Opening file '%s'\\n\", filename);\n\t\tif (cmpError error = cmpMemoryFile_Create(&m_MemoryFile, filename))\n\t\t{\n\t\t\tprintf(\"Error opening input file: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Build a list of tokens\n\t\tLOG(\"Running lexer\\n\");\n\t\tif (cmpError error = cmpLexerCursor_Create(&m_LexerCursor, cmpMemoryFile_Data(m_MemoryFile), cmpMemoryFile_Size(m_MemoryFile)))\n\t\t{\n\t\t\tprintf(\"Error creating lexer cursor: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\t\twhile (cmpToken token = cmpLexer_ConsumeToken(m_LexerCursor))\n\t\t{\n\t\t\tm_Tokens.push_back(token);\n\t\t\tLOG(\"[0x%2x] %s %d\\n\", token.type, cmpTokenType_Name(token.type), token.length);\n\t\t}\n\n\t\t\/\/ Print any lexer errors\n\t\tif (cmpError error = cmpLexerCursor_Error(m_LexerCursor))\n\t\t{\n\t\t\tprintf(\"%s(%d): %s\\n\", filename, cmpLexerCursor_Line(m_LexerCursor), cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ Build a list of parser nodes\n\t\tLOG(\"Running parser\\n\");\n\t\tif (cmpError error = cmpParserCursor_Create(&m_ParserCursor, m_Tokens.data(), m_Tokens.size()))\n\t\t{\n\t\t\tprintf(\"Error creating parser cursor: %s\\n\\n\", cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\t\twhile (cmpNode* node = cmpParser_ConsumeNode(m_ParserCursor))\n\t\t\tm_Nodes.push_back(node);\n\n\t\tif (g_Verbose)\n\t\t{\n\t\t\tfor (size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\t\tcmpParser_LogNodes(m_Nodes[i], 0);\n\t\t}\n\n\t\t\/\/ Print any parser errors\n\t\tif (cmpError error = cmpParserCursor_Error(m_ParserCursor))\n\t\t{\n\t\t\tprintf(\"%s(%d): %s\\n\",filename, cmpParserCursor_Line(m_ParserCursor), cmpError_Text(&error));\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tvoid VisitNodes(INodeVisitor* visitor)\n\t{\n\t\tassert(visitor != 0);\n\t\tfor (size_t i = 0; i < m_Nodes.size(); i++)\n\t\t\tVisitNode(m_Nodes[i], visitor);\n\t}\n\nprivate:\n\tvoid VisitNode(cmpNode* node, INodeVisitor* visitor)\n\t{\n\t\tassert(visitor != 0);\n\t\tassert(node != 0);\n\t\tvisitor->Visit(*node);\n\n\t\tfor (cmpNode* child = node->first_child; child != 0; child = child->next_sibling)\n\t\t\tVisitNode(child, visitor);\n\t}\n\n\t\/\/ Parser runtime\n\tcmpMemoryFile* m_MemoryFile;\n\tcmpLexerCursor* m_LexerCursor;\n\tcmpParserCursor* m_ParserCursor;\n\n\t\/\/ Generated tokens and AST\n\tstd::vector<cmpToken> m_Tokens;\n\tstd::vector<cmpNode*> m_Nodes;\n};\n\n\nint main(int argc, const char* argv[])\n{\n\t\/\/ Attempt to parse arguments\n\tif (const char* error = ParseArguments(argc, argv))\n\t{\n\t\tPrintHeader();\n\t\tprintf(\"\\nError parsing arguments: %s\\n\\n\", error);\n\t\tPrintUsage();\n\t\treturn 1;\n\t}\n\n\t\/\/ Print program information\n\tif (g_PrintHeader)\n\t\tPrintHeader();\n\tif (g_PrintHelp)\n\t\tPrintUsage();\n\n\tComputeProcessor processor;\n\tif (!processor.Parse(g_InputFilename.c_str()))\n\t\treturn 1;\n\n\tif (!g_OutputFilename.empty())\n\t{\n\t\tEmitFile emitter(g_OutputFilename.c_str());\n\t\tif (emitter.fp == 0)\n\t\t{\n\t\t\tprintf(\"Couldn't write to output file %s\\n\", g_OutputFilename.c_str());\n\t\t\treturn 1;\n\t\t}\n\t\tprocessor.VisitNodes(&emitter);\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"rapidjson\/writer.h\"\n#include \"rapidjson\/prettywriter.h\"\n#include \"rapidjson\/error\/en.h\"\n#include \"rapidjson\/stringbuffer.h\"\n\n#include \"acmacs-base\/read-file.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> class JsonWriterT : public RW\n{\n public:\n inline JsonWriterT(std::string aKeyword) : RW(mBuffer), mKeyword(aKeyword) {}\n inline operator std::string() const { return mBuffer.GetString(); }\n inline std::string keyword() const { return mKeyword; }\n\n private:\n rapidjson::StringBuffer mBuffer;\n std::string mKeyword;\n};\n\n\/\/ template <> inline JsonWriterT<rapidjson::PrettyWriter<rapidjson::StringBuffer>>::JsonWriterT(std::string aKeyword)\n\/\/ : rapidjson::PrettyWriter<rapidjson::StringBuffer>(mBuffer), mKeyword(aKeyword)\n\/\/ {\n\/\/ SetIndent(' ', 1);\n\/\/ }\n\ntypedef JsonWriterT<rapidjson::Writer<rapidjson::StringBuffer>> JsonWriter;\ntypedef JsonWriterT<rapidjson::PrettyWriter<rapidjson::StringBuffer>> JsonPrettyWriter;\n\n\/\/ ----------------------------------------------------------------------\n\nenum _StartArray { StartArray };\nenum _EndArray { EndArray };\nenum _StartObject { StartObject };\nenum _EndObject { EndObject };\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _StartArray) { writer.StartArray(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _EndArray) { writer.EndArray(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _StartObject) { writer.StartObject(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _EndObject) { writer.EndObject(); return writer; }\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const char* s) { writer.String(s, static_cast<unsigned>(strlen(s))); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, std::string s) { writer.String(s.c_str(), static_cast<unsigned>(s.size())); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, int value) { writer.Int(value); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, bool value) { writer.Bool(value); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, double value) { writer.Double(value); return writer; }\n\nclass JsonObjectKey\n{\n public:\n inline JsonObjectKey(const char* v) : value(v) {}\n inline JsonObjectKey(std::string v) : value(v.c_str()) {}\n inline operator const char*() const { return value; }\n\n private:\n const char* value;\n};\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, JsonObjectKey value) { writer.Key(value); return writer; }\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW, typename T> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::vector<T>& list)\n{\n writer << StartArray;\n for (const auto& e: list)\n writer << e;\n return writer << EndArray;\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::vector<std::vector<std::string>>& list_list_strings)\n{\n writer << StartArray;\n for (const auto& e: list_list_strings)\n writer << e;\n return writer << EndArray;\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::map<std::string, std::vector<std::string>>& map_list_strings)\n{\n writer << StartObject;\n for (const auto& e: map_list_strings)\n writer << JsonObjectKey(e.first) << e.second;\n return writer << EndObject;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace json_writer { namespace _internal\n{\n \/\/ void_t is a C++17 feature\n template<class ...> using void_t = void; \/\/ http:\/\/stackoverflow.com\/questions\/26513095\/void-t-can-implement-concepts\n template <typename T, typename = void> struct castable_to_char : public std::false_type {};\n template <typename T> struct castable_to_char<T, void_t<decltype(static_cast<char>(std::declval<T>()))>> : public std::true_type {};\n}}\n\ntemplate <typename RW, typename Key, typename std::enable_if<json_writer::_internal::castable_to_char<Key>{}>::type* = nullptr>\n inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, Key key)\n{\n const char k = static_cast<char>(key);\n writer.Key(&k, 1, false);\n return writer;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename Key, typename Value> class _if_not_empty\n{\n public:\n inline _if_not_empty(Key&& key, Value&& value) : mKey(key), mValue(value) {}\n\n template <typename RW> friend inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const _if_not_empty<Key, Value>& data)\n {\n if (!data.mValue.empty())\n writer << data.mKey << data.mValue;\n return writer;\n }\n\n private:\n Key mKey;\n Value mValue;\n};\n\ntemplate <typename Key, typename Value> inline auto if_not_empty(Key&& key, Value&& value) { return _if_not_empty<Key, Value>(std::forward<Key>(key), std::forward<Value>(value)); }\ntemplate <typename Value> inline auto if_not_empty(const char* key, Value&& value) { return _if_not_empty<JsonObjectKey, Value>(JsonObjectKey(key), std::forward<Value>(value)); }\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename Key, typename Value> class _if_non_negative\n{\n public:\n inline _if_non_negative(Key&& key, Value&& value) : mKey(key), mValue(value) {}\n\n template <typename RW> friend inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const _if_non_negative<Key, Value>& data)\n {\n if (data.mValue >= 0.0)\n writer << data.mKey << data.mValue;\n return writer;\n }\n\n private:\n Key mKey;\n Value mValue;\n};\n\ntemplate <typename Key, typename Value> inline auto if_non_negative(Key&& key, Value&& value) { return _if_non_negative<Key, Value>(std::forward<Key>(key), std::forward<Value>(value)); }\ntemplate <typename Value> inline auto if_non_negative(const char* key, Value&& value) { return _if_non_negative<JsonObjectKey, Value>(JsonObjectKey(key), std::forward<Value>(value)); }\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename V> inline std::string pretty_json(const V& value, std::string keyword, size_t indent, bool insert_emacs_indent_hint)\n{\n JsonPrettyWriter writer(keyword);\n writer.SetIndent(' ', static_cast<unsigned int>(indent));\n writer << value;\n std::string result = writer;\n if (insert_emacs_indent_hint && result[0] == '{') {\n const std::string ind(indent - 1, ' ');\n result.insert(1, ind + \"\\\"_\\\": \\\"-*- js-indent-level: \" + std::to_string(indent) + \" -*-\\\",\");\n }\n return result;\n}\n\ntemplate <typename V> inline std::string compact_json(const V& value, std::string keyword)\n{\n JsonWriter writer(keyword);\n return writer << value;\n}\n\ntemplate <typename V> inline std::string json(const V& value, std::string keyword, size_t indent, bool insert_emacs_indent_hint = true)\n{\n if (indent)\n return pretty_json(value, keyword, indent, insert_emacs_indent_hint);\n else\n return compact_json(value, keyword);\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename V> inline void export_to_json(const V& value, std::string keyword, std::string filename, size_t indent, bool insert_emacs_indent_hint = true)\n{\n acmacs_base::write_file(filename, json(value, keyword, indent, insert_emacs_indent_hint));\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>writing size_t to json<commit_after>#pragma once\n\n#include <string>\n#include <vector>\n#include <map>\n\n#include \"rapidjson\/writer.h\"\n#include \"rapidjson\/prettywriter.h\"\n#include \"rapidjson\/error\/en.h\"\n#include \"rapidjson\/stringbuffer.h\"\n\n#include \"acmacs-base\/read-file.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> class JsonWriterT : public RW\n{\n public:\n inline JsonWriterT(std::string aKeyword) : RW(mBuffer), mKeyword(aKeyword) {}\n inline operator std::string() const { return mBuffer.GetString(); }\n inline std::string keyword() const { return mKeyword; }\n\n private:\n rapidjson::StringBuffer mBuffer;\n std::string mKeyword;\n};\n\n\/\/ template <> inline JsonWriterT<rapidjson::PrettyWriter<rapidjson::StringBuffer>>::JsonWriterT(std::string aKeyword)\n\/\/ : rapidjson::PrettyWriter<rapidjson::StringBuffer>(mBuffer), mKeyword(aKeyword)\n\/\/ {\n\/\/ SetIndent(' ', 1);\n\/\/ }\n\ntypedef JsonWriterT<rapidjson::Writer<rapidjson::StringBuffer>> JsonWriter;\ntypedef JsonWriterT<rapidjson::PrettyWriter<rapidjson::StringBuffer>> JsonPrettyWriter;\n\n\/\/ ----------------------------------------------------------------------\n\nenum _StartArray { StartArray };\nenum _EndArray { EndArray };\nenum _StartObject { StartObject };\nenum _EndObject { EndObject };\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _StartArray) { writer.StartArray(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _EndArray) { writer.EndArray(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _StartObject) { writer.StartObject(); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, _EndObject) { writer.EndObject(); return writer; }\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const char* s) { writer.String(s, static_cast<unsigned>(strlen(s))); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, std::string s) { writer.String(s.c_str(), static_cast<unsigned>(s.size())); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, int value) { writer.Int(value); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, size_t value) { writer.Uint64(value); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, bool value) { writer.Bool(value); return writer; }\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, double value) { writer.Double(value); return writer; }\n\nclass JsonObjectKey\n{\n public:\n inline JsonObjectKey(const char* v) : value(v) {}\n inline JsonObjectKey(std::string v) : value(v.c_str()) {}\n inline operator const char*() const { return value; }\n\n private:\n const char* value;\n};\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, JsonObjectKey value) { writer.Key(value); return writer; }\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW, typename T> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::vector<T>& list)\n{\n writer << StartArray;\n for (const auto& e: list)\n writer << e;\n return writer << EndArray;\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::vector<std::vector<std::string>>& list_list_strings)\n{\n writer << StartArray;\n for (const auto& e: list_list_strings)\n writer << e;\n return writer << EndArray;\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename RW> inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const std::map<std::string, std::vector<std::string>>& map_list_strings)\n{\n writer << StartObject;\n for (const auto& e: map_list_strings)\n writer << JsonObjectKey(e.first) << e.second;\n return writer << EndObject;\n}\n\n\/\/ ----------------------------------------------------------------------\n\nnamespace json_writer { namespace _internal\n{\n \/\/ void_t is a C++17 feature\n template<class ...> using void_t = void; \/\/ http:\/\/stackoverflow.com\/questions\/26513095\/void-t-can-implement-concepts\n template <typename T, typename = void> struct castable_to_char : public std::false_type {};\n template <typename T> struct castable_to_char<T, void_t<decltype(static_cast<char>(std::declval<T>()))>> : public std::true_type {};\n}}\n\ntemplate <typename RW, typename Key, typename std::enable_if<json_writer::_internal::castable_to_char<Key>{}>::type* = nullptr>\n inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, Key key)\n{\n const char k = static_cast<char>(key);\n writer.Key(&k, 1, false);\n return writer;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename Key, typename Value> class _if_not_empty\n{\n public:\n inline _if_not_empty(Key&& key, Value&& value) : mKey(key), mValue(value) {}\n\n template <typename RW> friend inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const _if_not_empty<Key, Value>& data)\n {\n if (!data.mValue.empty())\n writer << data.mKey << data.mValue;\n return writer;\n }\n\n private:\n Key mKey;\n Value mValue;\n};\n\ntemplate <typename Key, typename Value> inline auto if_not_empty(Key&& key, Value&& value) { return _if_not_empty<Key, Value>(std::forward<Key>(key), std::forward<Value>(value)); }\ntemplate <typename Value> inline auto if_not_empty(const char* key, Value&& value) { return _if_not_empty<JsonObjectKey, Value>(JsonObjectKey(key), std::forward<Value>(value)); }\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename Key, typename Value> class _if_non_negative\n{\n public:\n inline _if_non_negative(Key&& key, Value&& value) : mKey(key), mValue(value) {}\n\n template <typename RW> friend inline JsonWriterT<RW>& operator <<(JsonWriterT<RW>& writer, const _if_non_negative<Key, Value>& data)\n {\n if (data.mValue >= 0.0)\n writer << data.mKey << data.mValue;\n return writer;\n }\n\n private:\n Key mKey;\n Value mValue;\n};\n\ntemplate <typename Key, typename Value> inline auto if_non_negative(Key&& key, Value&& value) { return _if_non_negative<Key, Value>(std::forward<Key>(key), std::forward<Value>(value)); }\ntemplate <typename Value> inline auto if_non_negative(const char* key, Value&& value) { return _if_non_negative<JsonObjectKey, Value>(JsonObjectKey(key), std::forward<Value>(value)); }\n\n\/\/ ----------------------------------------------------------------------\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename V> inline std::string pretty_json(const V& value, std::string keyword, size_t indent, bool insert_emacs_indent_hint)\n{\n JsonPrettyWriter writer(keyword);\n writer.SetIndent(' ', static_cast<unsigned int>(indent));\n writer << value;\n std::string result = writer;\n if (insert_emacs_indent_hint && result[0] == '{') {\n const std::string ind(indent - 1, ' ');\n result.insert(1, ind + \"\\\"_\\\": \\\"-*- js-indent-level: \" + std::to_string(indent) + \" -*-\\\",\");\n }\n return result;\n}\n\ntemplate <typename V> inline std::string compact_json(const V& value, std::string keyword)\n{\n JsonWriter writer(keyword);\n return writer << value;\n}\n\ntemplate <typename V> inline std::string json(const V& value, std::string keyword, size_t indent, bool insert_emacs_indent_hint = true)\n{\n if (indent)\n return pretty_json(value, keyword, indent, insert_emacs_indent_hint);\n else\n return compact_json(value, keyword);\n}\n\n\/\/ ----------------------------------------------------------------------\n\ntemplate <typename V> inline void export_to_json(const V& value, std::string keyword, std::string filename, size_t indent, bool insert_emacs_indent_hint = true)\n{\n acmacs_base::write_file(filename, json(value, keyword, indent, insert_emacs_indent_hint));\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------\n\/\/ Copyright Pierric Gimmig 2013-2017\n\/\/-----------------------------------\n\n#include \"TimerManager.h\"\n#include \"Threading.h\"\n#include \"Message.h\"\n#include \"TcpForward.h\"\n#include \"TcpClient.h\"\n#include \"Params.h\"\n#include \"OrbitLib.h\"\n\n#ifdef _WIN32\n#include <direct.h>\n#endif\n\nstd::unique_ptr<TimerManager> GTimerManager;\n\n\/\/-----------------------------------------------------------------------------\nTimerManager::TimerManager( bool a_IsClient ) : m_LockFreeQueue(65534), m_IsClient(a_IsClient)\n{\n m_Paused = false;\n m_IsFull = false;\n m_IsRecording = false;\n m_ExitRequested = false;\n m_FlushRequested = false;\n m_NumQueuedEntries = 0;\n m_NumQueuedTimers = 0;\n m_NumQueuedMessages = 0;\n m_TimerIndex = 0;\n m_NumTimersFromPreviousSession = 0;\n m_NumFlushedTimers = 0;\n \n InitProfiling();\n\n if( m_IsClient )\n {\n GTcpClient->Start();\n m_ConsumerThread = new std::thread([&](){ SendTimers(); });\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nTimerManager::~TimerManager()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StartRecording()\n{\n if( m_IsRecording )\n {\n return;\n }\n\n if( !m_ConsumerThread )\n {\n m_ConsumerThread = new std::thread([&](){ ConsumeTimers(); });\n }\n\n m_IsRecording = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StopRecording()\n{\n m_IsRecording = false;\n FlushQueue();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StartClient()\n{\n m_IsRecording = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StopClient()\n{\n m_IsRecording = false;\n GTimerManager->FlushQueue();\n \n if( GTcpClient )\n {\n GTcpClient->FlushSendQueue();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::FlushQueue()\n{\n m_FlushRequested = true;\n\n const size_t numTimers = 4096;\n Timer Timers[numTimers];\n m_NumFlushedTimers = 0;\n\n while (!m_ExitRequested)\n {\n size_t numDequeued = m_LockFreeQueue.try_dequeue_bulk(Timers, numTimers);\n\n if (numDequeued == 0)\n break;\n\n m_NumQueuedEntries -= (int)numDequeued;\n m_NumFlushedTimers += (int)numDequeued;\n\n if( m_IsClient )\n {\n int numEntries = m_NumFlushedTimers;\n GTcpClient->Send( Msg_NumFlushedEntries, numEntries );\n }\n }\n\n m_FlushRequested = false;\n m_ConditionVariable.signal();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Stop()\n{\n m_IsRecording = false;\n m_ExitRequested = true;\n m_ConditionVariable.signal();\n \n if( m_ConsumerThread )\n {\n m_ConsumerThread->join();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::ConsumeTimers()\n{\n SetCurrentThreadName( L\"OrbitConsumeTimers\" );\n#ifdef _WIN32\n SetThreadPriority( GetCurrentThread(), THREAD_PRIORITY_TIME_CRITICAL );\n#endif\n\n Timer Timer;\n\n while( !m_ExitRequested )\n {\n m_ConditionVariable.wait();\n\n while( !m_ExitRequested && !m_FlushRequested && m_LockFreeQueue.try_dequeue( Timer ) )\n {\n --m_NumQueuedEntries;\n --m_NumQueuedTimers;\n \n if( Timer.m_SessionID == Message::GSessionID )\n {\n for (TimerAddedCallback & Callback : m_TimerAddedCallbacks)\n {\n Callback(Timer);\n }\n }\n else\n {\n ++m_NumTimersFromPreviousSession;\n }\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::SendTimers()\n{\n SetCurrentThreadName( L\"OrbitSendTimers\" );\n\n const size_t numTimers = 4096;\n Timer Timers[numTimers];\n\n while( !m_ExitRequested )\n {\n Message Msg(Msg_Timer);\n\n \/\/ Wait for non-empty queue\n while( m_NumQueuedEntries <= 0 && !m_ExitRequested )\n {\n m_ConditionVariable.wait();\n }\n\n size_t numDequeued = m_LockFreeQueue.try_dequeue_bulk(Timers, numTimers);\n m_NumQueuedEntries -= (int)numDequeued;\n m_NumQueuedTimers -= (int)numDequeued;\n Msg.m_Size = (int)numDequeued*sizeof(Timer);\n\n\t\tGTcpClient->Send(Msg, (void*)Timers);\n\n int numEntries = m_NumQueuedEntries;\n GTcpClient->Send( Msg_NumQueuedEntries, numEntries );\n\n while (m_LockFreeMessageQueue.try_dequeue(Msg) && !m_ExitRequested)\n {\n --m_NumQueuedEntries;\n --m_NumQueuedMessages;\n GTcpClient->Send(Msg);\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const Timer& a_Timer )\n{\n if( m_IsRecording )\n {\n m_LockFreeQueue.enqueue(a_Timer);\n m_ConditionVariable.signal();\n ++m_NumQueuedEntries;\n ++m_NumQueuedTimers;\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const Message& a_Message )\n{\n if( m_IsRecording || m_IsClient )\n {\n m_LockFreeMessageQueue.enqueue(a_Message);\n m_ConditionVariable.signal();\n ++m_NumQueuedEntries;\n ++m_NumQueuedMessages;\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const ContextSwitch & a_CS )\n{\n m_ContextSwitchAddedCallback( a_CS );\n}\n<commit_msg>Temporarily disable session check when receiving remote timers. Need to fix for remote captures.<commit_after>\/\/-----------------------------------\n\/\/ Copyright Pierric Gimmig 2013-2017\n\/\/-----------------------------------\n\n#include \"TimerManager.h\"\n#include \"Threading.h\"\n#include \"Message.h\"\n#include \"TcpForward.h\"\n#include \"TcpClient.h\"\n#include \"Params.h\"\n#include \"OrbitLib.h\"\n\n#ifdef _WIN32\n#include <direct.h>\n#endif\n\nstd::unique_ptr<TimerManager> GTimerManager;\n\n\/\/-----------------------------------------------------------------------------\nTimerManager::TimerManager( bool a_IsClient ) : m_LockFreeQueue(65534), m_IsClient(a_IsClient)\n{\n m_Paused = false;\n m_IsFull = false;\n m_IsRecording = false;\n m_ExitRequested = false;\n m_FlushRequested = false;\n m_NumQueuedEntries = 0;\n m_NumQueuedTimers = 0;\n m_NumQueuedMessages = 0;\n m_TimerIndex = 0;\n m_NumTimersFromPreviousSession = 0;\n m_NumFlushedTimers = 0;\n \n InitProfiling();\n\n if( m_IsClient )\n {\n GTcpClient->Start();\n m_ConsumerThread = new std::thread([&](){ SendTimers(); });\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nTimerManager::~TimerManager()\n{\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StartRecording()\n{\n if( m_IsRecording )\n {\n return;\n }\n\n if( !m_ConsumerThread )\n {\n m_ConsumerThread = new std::thread([&](){ ConsumeTimers(); });\n }\n\n m_IsRecording = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StopRecording()\n{\n m_IsRecording = false;\n FlushQueue();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StartClient()\n{\n m_IsRecording = true;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::StopClient()\n{\n m_IsRecording = false;\n GTimerManager->FlushQueue();\n \n if( GTcpClient )\n {\n GTcpClient->FlushSendQueue();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::FlushQueue()\n{\n m_FlushRequested = true;\n\n const size_t numTimers = 4096;\n Timer Timers[numTimers];\n m_NumFlushedTimers = 0;\n\n while (!m_ExitRequested)\n {\n size_t numDequeued = m_LockFreeQueue.try_dequeue_bulk(Timers, numTimers);\n\n if (numDequeued == 0)\n break;\n\n m_NumQueuedEntries -= (int)numDequeued;\n m_NumFlushedTimers += (int)numDequeued;\n\n if( m_IsClient )\n {\n int numEntries = m_NumFlushedTimers;\n GTcpClient->Send( Msg_NumFlushedEntries, numEntries );\n }\n }\n\n m_FlushRequested = false;\n m_ConditionVariable.signal();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Stop()\n{\n m_IsRecording = false;\n m_ExitRequested = true;\n m_ConditionVariable.signal();\n \n if( m_ConsumerThread )\n {\n m_ConsumerThread->join();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::ConsumeTimers()\n{\n SetCurrentThreadName( L\"OrbitConsumeTimers\" );\n#ifdef _WIN32\n SetThreadPriority( GetCurrentThread(), THREAD_PRIORITY_TIME_CRITICAL );\n#endif\n\n Timer Timer;\n\n while( !m_ExitRequested )\n {\n m_ConditionVariable.wait();\n\n while( !m_ExitRequested && !m_FlushRequested && m_LockFreeQueue.try_dequeue( Timer ) )\n {\n --m_NumQueuedEntries;\n --m_NumQueuedTimers;\n \n \/\/if( Timer.m_SessionID == Message::GSessionID ) \/\/ TODO: re-enable check.\n {\n for (TimerAddedCallback & Callback : m_TimerAddedCallbacks)\n {\n Callback(Timer);\n }\n }\n \/*else\n {\n ++m_NumTimersFromPreviousSession;\n }*\/\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::SendTimers()\n{\n SetCurrentThreadName( L\"OrbitSendTimers\" );\n\n const size_t numTimers = 4096;\n Timer Timers[numTimers];\n\n while( !m_ExitRequested )\n {\n Message Msg(Msg_Timer);\n\n \/\/ Wait for non-empty queue\n while( m_NumQueuedEntries <= 0 && !m_ExitRequested )\n {\n m_ConditionVariable.wait();\n }\n\n size_t numDequeued = m_LockFreeQueue.try_dequeue_bulk(Timers, numTimers);\n m_NumQueuedEntries -= (int)numDequeued;\n m_NumQueuedTimers -= (int)numDequeued;\n Msg.m_Size = (int)numDequeued*sizeof(Timer);\n\n\t\tGTcpClient->Send(Msg, (void*)Timers);\n\n int numEntries = m_NumQueuedEntries;\n GTcpClient->Send( Msg_NumQueuedEntries, numEntries );\n\n while (m_LockFreeMessageQueue.try_dequeue(Msg) && !m_ExitRequested)\n {\n --m_NumQueuedEntries;\n --m_NumQueuedMessages;\n GTcpClient->Send(Msg);\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const Timer& a_Timer )\n{\n if( m_IsRecording )\n {\n m_LockFreeQueue.enqueue(a_Timer);\n m_ConditionVariable.signal();\n ++m_NumQueuedEntries;\n ++m_NumQueuedTimers;\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const Message& a_Message )\n{\n if( m_IsRecording || m_IsClient )\n {\n m_LockFreeMessageQueue.enqueue(a_Message);\n m_ConditionVariable.signal();\n ++m_NumQueuedEntries;\n ++m_NumQueuedMessages;\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid TimerManager::Add( const ContextSwitch & a_CS )\n{\n m_ContextSwitchAddedCallback( a_CS );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*ckwg +5\n * Copyright 2012 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"helpers\/pipeline_builder.h\"\n#include \"helpers\/tool_main.h\"\n#include \"helpers\/tool_usage.h\"\n\n#include <vistk\/pipeline_util\/pipe_declaration_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/modules.h>\n#include <vistk\/pipeline\/pipeline.h>\n#include <vistk\/pipeline\/types.h>\n\n#include <vistk\/utilities\/path.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/variant.hpp>\n\n#include <iostream>\n\n#include <cstdlib>\n\nclass config_printer\n : public boost::static_visitor<>\n{\n public:\n config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf);\n ~config_printer();\n\n void operator () (vistk::config_pipe_block const& config_block) const;\n void operator () (vistk::process_pipe_block const& process_block) const;\n void operator () (vistk::connect_pipe_block const& connect_block) const;\n private:\n void print_config_value(vistk::config_value_t const& config_value) const;\n\n std::ostream& m_ostr;\n vistk::pipeline_t const m_pipe;\n vistk::config_t const m_config;\n};\n\nint\ntool_main(int argc, char* argv[])\n{\n vistk::load_known_modules();\n\n boost::program_options::options_description desc;\n desc\n .add(tool_common_options())\n .add(pipeline_common_options())\n .add(pipeline_input_options())\n .add(pipeline_output_options());\n\n boost::program_options::variables_map const vm = tool_parse(argc, argv, desc);\n\n pipeline_builder const builder(vm, desc);\n\n vistk::pipeline_t const pipe = builder.pipeline();\n vistk::config_t const config = builder.config();\n vistk::pipe_blocks const blocks = builder.blocks();\n\n if (!pipe)\n {\n std::cerr << \"Error: Unable to bake pipeline\" << std::endl;\n\n return EXIT_FAILURE;\n }\n\n std::ostream* postr;\n boost::filesystem::ofstream fout;\n\n vistk::path_t const opath = vm[\"output\"].as<vistk::path_t>();\n\n if (opath == vistk::path_t(\"-\"))\n {\n postr = &std::cout;\n }\n else\n {\n fout.open(opath);\n\n if (fout.bad())\n {\n std::cerr << \"Error: Unable to open output file\" << std::endl;\n\n return EXIT_FAILURE;\n }\n\n postr = &fout;\n }\n\n std::ostream& ostr = *postr;\n\n config_printer const printer(ostr, pipe, config);\n\n std::for_each(blocks.begin(), blocks.end(), boost::apply_visitor(printer));\n\n return EXIT_SUCCESS;\n}\n\nconfig_printer\n::config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf)\n : m_ostr(ostr)\n , m_pipe(pipe)\n , m_config(conf)\n{\n}\n\nconfig_printer\n::~config_printer()\n{\n}\n\nclass key_printer\n{\n public:\n key_printer(std::ostream& ostr);\n ~key_printer();\n\n void operator () (vistk::config_value_t const& config_value) const;\n private:\n std::ostream& m_ostr;\n};\n\nvoid\nconfig_printer\n::operator () (vistk::config_pipe_block const& config_block) const\n{\n vistk::config::keys_t const& keys = config_block.key;\n vistk::config_values_t const& values = config_block.values;\n\n vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n m_ostr << \"config \" << key_path << std::endl;\n\n key_printer const printer(m_ostr);\n\n std::for_each(values.begin(), values.end(), printer);\n\n m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::operator () (vistk::process_pipe_block const& process_block) const\n{\n vistk::process::name_t const& name = process_block.name;\n vistk::process::type_t const& type = process_block.type;\n vistk::config_values_t const& values = process_block.config_values;\n\n m_ostr << \"process \" << name << std::endl;\n m_ostr << \" :: \" << type << std::endl;\n\n key_printer const printer(m_ostr);\n\n std::for_each(values.begin(), values.end(), printer);\n\n vistk::process_t const proc = m_pipe->process_by_name(name);\n\n vistk::config::keys_t const keys = proc->available_config();\n\n BOOST_FOREACH (vistk::config::key_t const& key, keys)\n {\n if (boost::starts_with(key, \"_\"))\n {\n continue;\n }\n\n m_ostr << std::endl;\n\n vistk::process::conf_info_t const& info = proc->config_info(key);\n\n vistk::config::description_t const desc = boost::replace_all_copy(info->description, \"\\n\", \"\\n # \");\n\n m_ostr << \" # Key: \" << key << std::endl;\n\n m_ostr << \" # Description: \" << desc << std::endl;\n\n vistk::config::value_t const& def = info->def;\n\n if (def.empty())\n {\n m_ostr << \" # No default value\" << std::endl;\n }\n else\n {\n m_ostr << \" # Default value: \" << def << std::endl;\n }\n\n vistk::config::key_t const resolved_key = name + vistk::config::block_sep + key;\n\n if (m_config->has_value(resolved_key))\n {\n vistk::config::value_t const cur_value = m_config->get_value<vistk::config::value_t>(resolved_key);\n\n m_ostr << \" # Current value: \" << cur_value << std::endl;\n }\n else\n {\n m_ostr << \" # No current value\" << std::endl;\n }\n }\n\n m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::operator () (vistk::connect_pipe_block const& connect_block) const\n{\n vistk::process::port_addr_t const& upstream_addr = connect_block.from;\n vistk::process::port_addr_t const& downstream_addr = connect_block.to;\n\n vistk::process::name_t const& upstream_name = upstream_addr.first;\n vistk::process::port_t const& upstream_port = upstream_addr.second;\n vistk::process::name_t const& downstream_name = downstream_addr.first;\n vistk::process::port_t const& downstream_port = downstream_addr.second;\n\n m_ostr << \"connect from \" << upstream_name << \".\" << upstream_port << std::endl;\n m_ostr << \" to \" << downstream_name << \".\" << downstream_port << std::endl;\n\n m_ostr << std::endl;\n}\n\nkey_printer\n::key_printer(std::ostream& ostr)\n : m_ostr(ostr)\n{\n}\n\nkey_printer\n::~key_printer()\n{\n}\n\nvoid\nkey_printer\n::operator () (vistk::config_value_t const& config_value) const\n{\n vistk::config_key_t const& key = config_value.key;\n vistk::config::value_t const& value = config_value.value;\n\n vistk::config::keys_t const& keys = key.key_path;\n vistk::config_key_options_t const& options = key.options;\n\n vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n boost::optional<vistk::config_flags_t> const& flags = options.flags;\n boost::optional<vistk::config_provider_t> const& provider = options.provider;\n\n m_ostr << \" \" << vistk::config::block_sep << key_path;\n\n if (flags)\n {\n vistk::config_flag_t const flag_list = boost::join(*flags, \",\");\n\n m_ostr << \"[\" << flag_list << \"]\";\n }\n\n if (provider)\n {\n m_ostr << \"{\" << *provider << \"}\";\n }\n\n m_ostr << \" \" << value << std::endl;\n}\n<commit_msg>Support clusters declared as process blocks<commit_after>\/*ckwg +5\n * Copyright 2012-2013 by Kitware, Inc. All Rights Reserved. Please refer to\n * KITWARE_LICENSE.TXT for licensing information, or contact General Counsel,\n * Kitware, Inc., 28 Corporate Drive, Clifton Park, NY 12065.\n *\/\n\n#include \"helpers\/pipeline_builder.h\"\n#include \"helpers\/tool_main.h\"\n#include \"helpers\/tool_usage.h\"\n\n#include <vistk\/pipeline_util\/pipe_declaration_types.h>\n\n#include <vistk\/pipeline\/config.h>\n#include <vistk\/pipeline\/modules.h>\n#include <vistk\/pipeline\/pipeline.h>\n#include <vistk\/pipeline\/pipeline_exception.h>\n#include <vistk\/pipeline\/process.h>\n#include <vistk\/pipeline\/process_cluster.h>\n#include <vistk\/pipeline\/types.h>\n\n#include <vistk\/utilities\/path.h>\n\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/algorithm\/string\/predicate.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/variant.hpp>\n\n#include <iostream>\n#include <stdexcept>\n\n#include <cstdlib>\n\nclass config_printer\n : public boost::static_visitor<>\n{\n public:\n config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf);\n ~config_printer();\n\n void operator () (vistk::config_pipe_block const& config_block) const;\n void operator () (vistk::process_pipe_block const& process_block) const;\n void operator () (vistk::connect_pipe_block const& connect_block) const;\n private:\n void print_config_value(vistk::config_value_t const& config_value) const;\n\n std::ostream& m_ostr;\n vistk::pipeline_t const m_pipe;\n vistk::config_t const m_config;\n};\n\nint\ntool_main(int argc, char* argv[])\n{\n vistk::load_known_modules();\n\n boost::program_options::options_description desc;\n desc\n .add(tool_common_options())\n .add(pipeline_common_options())\n .add(pipeline_input_options())\n .add(pipeline_output_options());\n\n boost::program_options::variables_map const vm = tool_parse(argc, argv, desc);\n\n pipeline_builder const builder(vm, desc);\n\n vistk::pipeline_t const pipe = builder.pipeline();\n vistk::config_t const config = builder.config();\n vistk::pipe_blocks const blocks = builder.blocks();\n\n if (!pipe)\n {\n std::cerr << \"Error: Unable to bake pipeline\" << std::endl;\n\n return EXIT_FAILURE;\n }\n\n std::ostream* postr;\n boost::filesystem::ofstream fout;\n\n vistk::path_t const opath = vm[\"output\"].as<vistk::path_t>();\n\n if (opath == vistk::path_t(\"-\"))\n {\n postr = &std::cout;\n }\n else\n {\n fout.open(opath);\n\n if (fout.bad())\n {\n std::cerr << \"Error: Unable to open output file\" << std::endl;\n\n return EXIT_FAILURE;\n }\n\n postr = &fout;\n }\n\n std::ostream& ostr = *postr;\n\n config_printer const printer(ostr, pipe, config);\n\n std::for_each(blocks.begin(), blocks.end(), boost::apply_visitor(printer));\n\n return EXIT_SUCCESS;\n}\n\nconfig_printer\n::config_printer(std::ostream& ostr, vistk::pipeline_t const& pipe, vistk::config_t const& conf)\n : m_ostr(ostr)\n , m_pipe(pipe)\n , m_config(conf)\n{\n}\n\nconfig_printer\n::~config_printer()\n{\n}\n\nclass key_printer\n{\n public:\n key_printer(std::ostream& ostr);\n ~key_printer();\n\n void operator () (vistk::config_value_t const& config_value) const;\n private:\n std::ostream& m_ostr;\n};\n\nvoid\nconfig_printer\n::operator () (vistk::config_pipe_block const& config_block) const\n{\n vistk::config::keys_t const& keys = config_block.key;\n vistk::config_values_t const& values = config_block.values;\n\n vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n m_ostr << \"config \" << key_path << std::endl;\n\n key_printer const printer(m_ostr);\n\n std::for_each(values.begin(), values.end(), printer);\n\n m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::operator () (vistk::process_pipe_block const& process_block) const\n{\n vistk::process::name_t const& name = process_block.name;\n vistk::process::type_t const& type = process_block.type;\n vistk::config_values_t const& values = process_block.config_values;\n\n m_ostr << \"process \" << name << std::endl;\n m_ostr << \" :: \" << type << std::endl;\n\n key_printer const printer(m_ostr);\n\n std::for_each(values.begin(), values.end(), printer);\n\n vistk::process_t proc;\n\n try\n {\n proc = m_pipe->process_by_name(name);\n }\n catch (vistk::no_such_process_exception const& \/*e*\/)\n {\n try\n {\n vistk::process_cluster_t const cluster = m_pipe->cluster_by_name(name);\n\n proc = boost::static_pointer_cast<vistk::process>(cluster);\n }\n catch (vistk::no_such_process_exception const& \/*e*\/)\n {\n std::string const reason = \"A process block did not result in a process being \"\n \"added to the pipeline: \" + name;\n\n throw std::logic_error(reason);\n }\n }\n\n vistk::config::keys_t const keys = proc->available_config();\n\n BOOST_FOREACH (vistk::config::key_t const& key, keys)\n {\n if (boost::starts_with(key, \"_\"))\n {\n continue;\n }\n\n m_ostr << std::endl;\n\n vistk::process::conf_info_t const& info = proc->config_info(key);\n\n vistk::config::description_t const desc = boost::replace_all_copy(info->description, \"\\n\", \"\\n # \");\n\n m_ostr << \" # Key: \" << key << std::endl;\n\n m_ostr << \" # Description: \" << desc << std::endl;\n\n vistk::config::value_t const& def = info->def;\n\n if (def.empty())\n {\n m_ostr << \" # No default value\" << std::endl;\n }\n else\n {\n m_ostr << \" # Default value: \" << def << std::endl;\n }\n\n vistk::config::key_t const resolved_key = name + vistk::config::block_sep + key;\n\n if (m_config->has_value(resolved_key))\n {\n vistk::config::value_t const cur_value = m_config->get_value<vistk::config::value_t>(resolved_key);\n\n m_ostr << \" # Current value: \" << cur_value << std::endl;\n }\n else\n {\n m_ostr << \" # No current value\" << std::endl;\n }\n }\n\n m_ostr << std::endl;\n}\n\nvoid\nconfig_printer\n::operator () (vistk::connect_pipe_block const& connect_block) const\n{\n vistk::process::port_addr_t const& upstream_addr = connect_block.from;\n vistk::process::port_addr_t const& downstream_addr = connect_block.to;\n\n vistk::process::name_t const& upstream_name = upstream_addr.first;\n vistk::process::port_t const& upstream_port = upstream_addr.second;\n vistk::process::name_t const& downstream_name = downstream_addr.first;\n vistk::process::port_t const& downstream_port = downstream_addr.second;\n\n m_ostr << \"connect from \" << upstream_name << \".\" << upstream_port << std::endl;\n m_ostr << \" to \" << downstream_name << \".\" << downstream_port << std::endl;\n\n m_ostr << std::endl;\n}\n\nkey_printer\n::key_printer(std::ostream& ostr)\n : m_ostr(ostr)\n{\n}\n\nkey_printer\n::~key_printer()\n{\n}\n\nvoid\nkey_printer\n::operator () (vistk::config_value_t const& config_value) const\n{\n vistk::config_key_t const& key = config_value.key;\n vistk::config::value_t const& value = config_value.value;\n\n vistk::config::keys_t const& keys = key.key_path;\n vistk::config_key_options_t const& options = key.options;\n\n vistk::config::key_t const key_path = boost::join(keys, vistk::config::block_sep);\n\n boost::optional<vistk::config_flags_t> const& flags = options.flags;\n boost::optional<vistk::config_provider_t> const& provider = options.provider;\n\n m_ostr << \" \" << vistk::config::block_sep << key_path;\n\n if (flags)\n {\n vistk::config_flag_t const flag_list = boost::join(*flags, \",\");\n\n m_ostr << \"[\" << flag_list << \"]\";\n }\n\n if (provider)\n {\n m_ostr << \"{\" << *provider << \"}\";\n }\n\n m_ostr << \" \" << value << std::endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=== NoReturnFunctionChecker.cpp -------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This defines NoReturnFunctionChecker, which evaluates functions that do not\n\/\/ return to the caller.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/CheckerContext.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include \"llvm\/Support\/DataTypes.h\"\n\nusing namespace clang;\nusing namespace ento;\n\nnamespace {\n\nclass NoReturnFunctionChecker : public Checker< check::PostStmt<CallExpr>,\n check::PostObjCMessage > {\npublic:\n void checkPostStmt(const CallExpr *CE, CheckerContext &C) const;\n void checkPostObjCMessage(const ObjCMessage &msg, CheckerContext &C) const;\n};\n\n}\n\nvoid NoReturnFunctionChecker::checkPostStmt(const CallExpr *CE,\n CheckerContext &C) const {\n const ProgramState *state = C.getState();\n const Expr *Callee = CE->getCallee();\n\n bool BuildSinks = getFunctionExtInfo(Callee->getType()).getNoReturn();\n\n if (!BuildSinks) {\n SVal L = state->getSVal(Callee);\n const FunctionDecl *FD = L.getAsFunctionDecl();\n if (!FD)\n return;\n\n if (FD->getAttr<AnalyzerNoReturnAttr>())\n BuildSinks = true;\n else if (const IdentifierInfo *II = FD->getIdentifier()) {\n \/\/ HACK: Some functions are not marked noreturn, and don't return.\n \/\/ Here are a few hardwired ones. If this takes too long, we can\n \/\/ potentially cache these results.\n BuildSinks\n = llvm::StringSwitch<bool>(StringRef(II->getName()))\n .Case(\"exit\", true)\n .Case(\"panic\", true)\n .Case(\"error\", true)\n .Case(\"Assert\", true)\n \/\/ FIXME: This is just a wrapper around throwing an exception.\n \/\/ Eventually inter-procedural analysis should handle this easily.\n .Case(\"ziperr\", true)\n .Case(\"assfail\", true)\n .Case(\"db_error\", true)\n .Case(\"__assert\", true)\n .Case(\"__assert_rtn\", true)\n .Case(\"__assert_fail\", true)\n .Case(\"dtrace_assfail\", true)\n .Case(\"yy_fatal_error\", true)\n .Case(\"_XCAssertionFailureHandler\", true)\n .Case(\"_DTAssertionFailureHandler\", true)\n .Case(\"_TSAssertionFailureHandler\", true)\n .Default(false);\n }\n }\n\n if (BuildSinks)\n C.generateSink(CE);\n}\n\nstatic bool END_WITH_NULL isMultiArgSelector(Selector Sel, ...) {\n va_list argp;\n va_start(argp, Sel);\n\n unsigned Slot = 0;\n const char *Arg;\n while ((Arg = va_arg(argp, const char *))) {\n if (!Sel.getNameForSlot(Slot).equals(Arg))\n break; \/\/ still need to va_end!\n ++Slot;\n }\n\n va_end(argp);\n\n \/\/ We only succeeded if we made it to the end of the argument list.\n return (Arg == NULL);\n}\n\nvoid NoReturnFunctionChecker::checkPostObjCMessage(const ObjCMessage &Msg,\n CheckerContext &C) const {\n \/\/ HACK: This entire check is to handle two messages in the Cocoa frameworks:\n \/\/ -[NSAssertionHandler\n \/\/ handleFailureInMethod:object:file:lineNumber:description:]\n \/\/ -[NSAssertionHandler\n \/\/ handleFailureInFunction:file:lineNumber:description:]\n \/\/ Eventually these should be annotated with __attribute__((noreturn)).\n \/\/ Because ObjC messages use dynamic dispatch, it is not generally safe to\n \/\/ assume certain methods can't return. In cases where it is definitely valid,\n \/\/ see if you can mark the methods noreturn or analyzer_noreturn instead of\n \/\/ adding more explicit checks to this method.\n\n if (!Msg.isInstanceMessage())\n return;\n\n const ObjCInterfaceDecl *Receiver = Msg.getReceiverInterface();\n if (!Receiver)\n return;\n if (!Receiver->getIdentifier()->isStr(\"NSAssertionHandler\"))\n return;\n\n Selector Sel = Msg.getSelector();\n switch (Sel.getNumArgs()) {\n default:\n return;\n case 4:\n if (!isMultiArgSelector(Sel, \"handleFailureInFunction\", \"file\",\n \"lineNumber\", \"description\", NULL))\n return;\n break;\n case 5:\n if (!isMultiArgSelector(Sel, \"handleFailureInMethod\", \"object\", \"file\",\n \"lineNumber\", \"description\", NULL))\n return;\n break;\n }\n\n \/\/ If we got here, it's one of the messages we care about.\n C.generateSink();\n}\n\n\nvoid ento::registerNoReturnFunctionChecker(CheckerManager &mgr) {\n mgr.registerChecker<NoReturnFunctionChecker>();\n}\n<commit_msg>Fix compile on platforms that don't implicitly include stdarg.h here.<commit_after>\/\/=== NoReturnFunctionChecker.cpp -------------------------------*- C++ -*-===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This defines NoReturnFunctionChecker, which evaluates functions that do not\n\/\/ return to the caller.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"ClangSACheckers.h\"\n#include \"clang\/StaticAnalyzer\/Core\/Checker.h\"\n#include \"clang\/StaticAnalyzer\/Core\/CheckerManager.h\"\n#include \"clang\/StaticAnalyzer\/Core\/PathSensitive\/CheckerContext.h\"\n#include \"llvm\/ADT\/StringSwitch.h\"\n#include <cstdarg>\n\nusing namespace clang;\nusing namespace ento;\n\nnamespace {\n\nclass NoReturnFunctionChecker : public Checker< check::PostStmt<CallExpr>,\n check::PostObjCMessage > {\npublic:\n void checkPostStmt(const CallExpr *CE, CheckerContext &C) const;\n void checkPostObjCMessage(const ObjCMessage &msg, CheckerContext &C) const;\n};\n\n}\n\nvoid NoReturnFunctionChecker::checkPostStmt(const CallExpr *CE,\n CheckerContext &C) const {\n const ProgramState *state = C.getState();\n const Expr *Callee = CE->getCallee();\n\n bool BuildSinks = getFunctionExtInfo(Callee->getType()).getNoReturn();\n\n if (!BuildSinks) {\n SVal L = state->getSVal(Callee);\n const FunctionDecl *FD = L.getAsFunctionDecl();\n if (!FD)\n return;\n\n if (FD->getAttr<AnalyzerNoReturnAttr>())\n BuildSinks = true;\n else if (const IdentifierInfo *II = FD->getIdentifier()) {\n \/\/ HACK: Some functions are not marked noreturn, and don't return.\n \/\/ Here are a few hardwired ones. If this takes too long, we can\n \/\/ potentially cache these results.\n BuildSinks\n = llvm::StringSwitch<bool>(StringRef(II->getName()))\n .Case(\"exit\", true)\n .Case(\"panic\", true)\n .Case(\"error\", true)\n .Case(\"Assert\", true)\n \/\/ FIXME: This is just a wrapper around throwing an exception.\n \/\/ Eventually inter-procedural analysis should handle this easily.\n .Case(\"ziperr\", true)\n .Case(\"assfail\", true)\n .Case(\"db_error\", true)\n .Case(\"__assert\", true)\n .Case(\"__assert_rtn\", true)\n .Case(\"__assert_fail\", true)\n .Case(\"dtrace_assfail\", true)\n .Case(\"yy_fatal_error\", true)\n .Case(\"_XCAssertionFailureHandler\", true)\n .Case(\"_DTAssertionFailureHandler\", true)\n .Case(\"_TSAssertionFailureHandler\", true)\n .Default(false);\n }\n }\n\n if (BuildSinks)\n C.generateSink(CE);\n}\n\nstatic bool END_WITH_NULL isMultiArgSelector(Selector Sel, ...) {\n va_list argp;\n va_start(argp, Sel);\n\n unsigned Slot = 0;\n const char *Arg;\n while ((Arg = va_arg(argp, const char *))) {\n if (!Sel.getNameForSlot(Slot).equals(Arg))\n break; \/\/ still need to va_end!\n ++Slot;\n }\n\n va_end(argp);\n\n \/\/ We only succeeded if we made it to the end of the argument list.\n return (Arg == NULL);\n}\n\nvoid NoReturnFunctionChecker::checkPostObjCMessage(const ObjCMessage &Msg,\n CheckerContext &C) const {\n \/\/ HACK: This entire check is to handle two messages in the Cocoa frameworks:\n \/\/ -[NSAssertionHandler\n \/\/ handleFailureInMethod:object:file:lineNumber:description:]\n \/\/ -[NSAssertionHandler\n \/\/ handleFailureInFunction:file:lineNumber:description:]\n \/\/ Eventually these should be annotated with __attribute__((noreturn)).\n \/\/ Because ObjC messages use dynamic dispatch, it is not generally safe to\n \/\/ assume certain methods can't return. In cases where it is definitely valid,\n \/\/ see if you can mark the methods noreturn or analyzer_noreturn instead of\n \/\/ adding more explicit checks to this method.\n\n if (!Msg.isInstanceMessage())\n return;\n\n const ObjCInterfaceDecl *Receiver = Msg.getReceiverInterface();\n if (!Receiver)\n return;\n if (!Receiver->getIdentifier()->isStr(\"NSAssertionHandler\"))\n return;\n\n Selector Sel = Msg.getSelector();\n switch (Sel.getNumArgs()) {\n default:\n return;\n case 4:\n if (!isMultiArgSelector(Sel, \"handleFailureInFunction\", \"file\",\n \"lineNumber\", \"description\", NULL))\n return;\n break;\n case 5:\n if (!isMultiArgSelector(Sel, \"handleFailureInMethod\", \"object\", \"file\",\n \"lineNumber\", \"description\", NULL))\n return;\n break;\n }\n\n \/\/ If we got here, it's one of the messages we care about.\n C.generateSink();\n}\n\n\nvoid ento::registerNoReturnFunctionChecker(CheckerManager &mgr) {\n mgr.registerChecker<NoReturnFunctionChecker>();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n\n\n\t\n\nbool XInputController::Init(DWORD index)\n{\n\t_lastState = _currentState;\n\t\/*memcpy(&_lastState, &_currentState, sizeof(_currentState));*\/\n\tDWORD dwResult;\n\tZeroMemory(&_currentState, sizeof(XINPUT_STATE));\n\tdwResult = XInputGetState(index, &_currentState);\n\n\treturn dwResult == ERROR_SUCCESS;\n}\n\n\n\tbool XInputController::ButtonDown(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) == btnMask && (_lastState.Gamepad.wButtons & btnMask) != btnMask;\n\t\n\t}\n\n\tbool XInputController::ButtonUp(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) != btnMask && (_lastState.Gamepad.wButtons & btnMask) == btnMask;\n\n\t}\n\n\tbool XInputController::Button(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) == btnMask;\n\n\t}\n\n\tbool XInputController::LeftTriggerDown()\n\t{\n\t\tfloat t1, t2;\n\t\tLeftTrigger(t1,_currentState);\n\t\tLeftTrigger(t2, _lastState);\n\t\treturn t1 != -2 && t2 == -2;\n\t}\n\n\tbool XInputController::RightTriggerDown()\n\t{\n\t\tfloat t1, t2;\n\t\tRightTrigger(t1, _currentState);\n\t\tRightTrigger(t2, _lastState);\n\t\treturn t1 != -2 && t2 == -2;\n\t}\n\n\tbool XInputController::LeftTriggerUp()\n\t{\n\t\tfloat t1, t2;\n\t\tLeftTrigger(t1, _currentState);\n\t\tLeftTrigger(t2, _lastState);\n\t\treturn t1 == -2 && t2 != -2;\n\t}\n\n\tbool XInputController::RightTriggerUp()\n\t{\n\t\tfloat t1, t2;\n\t\tRightTrigger(t1, _currentState);\n\t\tRightTrigger(t2, _lastState);\n\t\treturn t1 == -2 && t2 != -2;\n\t}\n\n\tbool XInputController::LeftTrigger()\n\t{\n\t\tfloat t = 0;\n\t\tLeftTrigger(t);\n\t\treturn t != -2;\n\t}\n\n\tbool XInputController::RightTrigger()\n\t{\n\t\tfloat t = 0;\n\t\tRightTrigger(t);\n\t\treturn t != -2;\n\t}\n\n\tvoid XInputController::LeftTrigger(float &t)\n\t{\n\t\tLeftTrigger(t, _currentState);\n\t}\n\n\tvoid XInputController::RightTrigger(float &t)\n\t{\n\t\tRightTrigger(t, _currentState);\n\t}\n\n\tvoid XInputController::LeftTrigger(float &t, XINPUT_STATE state)\n\t{\n\t\tif (state.Gamepad.bLeftTrigger > XINPUT_GAMEPAD_TRIGGER_THRESHOLD)\n\t\t{\n\t\t\tt = state.Gamepad.bLeftTrigger;\n\t\t}\n\t\telse\n\t\t\tt = -2; \/\/ Since -1 is a valid value, -2 means false\n\t}\n\n\tvoid XInputController::RightTrigger(float &t, XINPUT_STATE state)\n\t{\n\t\tif (state.Gamepad.bRightTrigger > XINPUT_GAMEPAD_TRIGGER_THRESHOLD)\n\t\t{\n\t\t\tt = state.Gamepad.bRightTrigger;\n\t\t}\n\t\telse\n\t\t\tt = -2;\n\t}\n\n\tvoid XInputController::ThumbStickLeft(float &x, float &y)\n\t{\n\t\n\t\tThumbStick(_currentState.Gamepad.sThumbLX, _currentState.Gamepad.sThumbLY, XINPUT_GAMEPAD_LEFT_THUMB_DEADZONE, x, y);\n\t\n\t}\n\n\tvoid XInputController::ThumbStickRight(float &x, float &y)\n\t{\n\t\t\n\t\t ThumbStick(_currentState.Gamepad.sThumbRX, _currentState.Gamepad.sThumbRY, XINPUT_GAMEPAD_RIGHT_THUMB_DEADZONE,x,y);\n\t\n\t\n\t}\n\n\n\tvoid XInputController::ThumbStick(SHORT lx, SHORT ly, SHORT ld, float &x, float &y)\n\t{\n\t\n\n\t\n\t\n\t\t\/\/determine the direction the controller is pushed\n\t\tfloat normalizedLX = (1 \/ (float)32767) * lx;\n\t\tfloat normalizedLY = (1 \/ (float)32767) * ly;\n\t\tfloat normalizedLD = (1 \/ (float)32767) * ld;\n\t\t\n\n\t\t\/\/cout << normalizedLY << endl;\n\n\t\tif (normalizedLX > 0 && normalizedLX < normalizedLD\n\t\t\t|| normalizedLX < 0 && normalizedLX > -normalizedLD)\n\t\t\t\n\t\t{\n\t\t\t\/\/ Since -2 isnt a legit value, this means its inside deadzone.\n\t\t\tx = -2;\n\t\t\n\t\t}\n\t\telse x = normalizedLX;\n\n\t\tif (normalizedLY > 0 && normalizedLY < normalizedLD\n\t\t\t|| normalizedLY < 0 && normalizedLY > -normalizedLD)\n\n\t\t{\n\t\t\n\t\t\ty = -2;\n\t\t\n\t\t}\n\t\telse\n\t\t{\n\t\t\ty = normalizedLY;\n\t\t\t\/\/cout << y << endl;\n\t\t}\n\n\n\t\n\t\n\t}\n<commit_msg>Fixed includings<commit_after>#include <Windows.h>\n#include <Xinput.h>\n#include \"XInputController.h\"\n\n\t\n\nbool XInputController::Init(DWORD index)\n{\n\t_lastState = _currentState;\n\t\/*memcpy(&_lastState, &_currentState, sizeof(_currentState));*\/\n\tDWORD dwResult;\n\tZeroMemory(&_currentState, sizeof(XINPUT_STATE));\n\tdwResult = XInputGetState(index, &_currentState);\n\n\treturn dwResult == ERROR_SUCCESS;\n}\n\n\n\tbool XInputController::ButtonDown(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) == btnMask && (_lastState.Gamepad.wButtons & btnMask) != btnMask;\n\t\n\t}\n\n\tbool XInputController::ButtonUp(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) != btnMask && (_lastState.Gamepad.wButtons & btnMask) == btnMask;\n\n\t}\n\n\tbool XInputController::Button(WORD btnMask)\n\t{\n\t\treturn (_currentState.Gamepad.wButtons & btnMask) == btnMask;\n\n\t}\n\n\tbool XInputController::LeftTriggerDown()\n\t{\n\t\tfloat t1, t2;\n\t\tLeftTrigger(t1,_currentState);\n\t\tLeftTrigger(t2, _lastState);\n\t\treturn t1 != -2 && t2 == -2;\n\t}\n\n\tbool XInputController::RightTriggerDown()\n\t{\n\t\tfloat t1, t2;\n\t\tRightTrigger(t1, _currentState);\n\t\tRightTrigger(t2, _lastState);\n\t\treturn t1 != -2 && t2 == -2;\n\t}\n\n\tbool XInputController::LeftTriggerUp()\n\t{\n\t\tfloat t1, t2;\n\t\tLeftTrigger(t1, _currentState);\n\t\tLeftTrigger(t2, _lastState);\n\t\treturn t1 == -2 && t2 != -2;\n\t}\n\n\tbool XInputController::RightTriggerUp()\n\t{\n\t\tfloat t1, t2;\n\t\tRightTrigger(t1, _currentState);\n\t\tRightTrigger(t2, _lastState);\n\t\treturn t1 == -2 && t2 != -2;\n\t}\n\n\tbool XInputController::LeftTrigger()\n\t{\n\t\tfloat t = 0;\n\t\tLeftTrigger(t);\n\t\treturn t != -2;\n\t}\n\n\tbool XInputController::RightTrigger()\n\t{\n\t\tfloat t = 0;\n\t\tRightTrigger(t);\n\t\treturn t != -2;\n\t}\n\n\tvoid XInputController::LeftTrigger(float &t)\n\t{\n\t\tLeftTrigger(t, _currentState);\n\t}\n\n\tvoid XInputController::RightTrigger(float &t)\n\t{\n\t\tRightTrigger(t, _currentState);\n\t}\n\n\tvoid XInputController::LeftTrigger(float &t, XINPUT_STATE state)\n\t{\n\t\tif (state.Gamepad.bLeftTrigger > XINPUT_GAMEPAD_TRIGGER_THRESHOLD)\n\t\t{\n\t\t\tt = state.Gamepad.bLeftTrigger;\n\t\t}\n\t\telse\n\t\t\tt = -2; \/\/ Since -1 is a valid value, -2 means false\n\t}\n\n\tvoid XInputController::RightTrigger(float &t, XINPUT_STATE state)\n\t{\n\t\tif (state.Gamepad.bRightTrigger > XINPUT_GAMEPAD_TRIGGER_THRESHOLD)\n\t\t{\n\t\t\tt = state.Gamepad.bRightTrigger;\n\t\t}\n\t\telse\n\t\t\tt = -2;\n\t}\n\n\tvoid XInputController::ThumbStickLeft(float &x, float &y)\n\t{\n\t\n\t\tThumbStick(_currentState.Gamepad.sThumbLX, _currentState.Gamepad.sThumbLY, XINPUT_GAMEPAD_LEFT_THUMB_DEADZONE, x, y);\n\t\n\t}\n\n\tvoid XInputController::ThumbStickRight(float &x, float &y)\n\t{\n\t\t\n\t\t ThumbStick(_currentState.Gamepad.sThumbRX, _currentState.Gamepad.sThumbRY, XINPUT_GAMEPAD_RIGHT_THUMB_DEADZONE,x,y);\n\t\n\t\n\t}\n\n\n\tvoid XInputController::ThumbStick(SHORT lx, SHORT ly, SHORT ld, float &x, float &y)\n\t{\n\t\n\n\t\n\t\n\t\t\/\/determine the direction the controller is pushed\n\t\tfloat normalizedLX = (1 \/ (float)32767) * lx;\n\t\tfloat normalizedLY = (1 \/ (float)32767) * ly;\n\t\tfloat normalizedLD = (1 \/ (float)32767) * ld;\n\t\t\n\n\t\t\/\/cout << normalizedLY << endl;\n\n\t\tif (normalizedLX > 0 && normalizedLX < normalizedLD\n\t\t\t|| normalizedLX < 0 && normalizedLX > -normalizedLD)\n\t\t\t\n\t\t{\n\t\t\t\/\/ Since -2 isnt a legit value, this means its inside deadzone.\n\t\t\tx = -2;\n\t\t\n\t\t}\n\t\telse x = normalizedLX;\n\n\t\tif (normalizedLY > 0 && normalizedLY < normalizedLD\n\t\t\t|| normalizedLY < 0 && normalizedLY > -normalizedLD)\n\n\t\t{\n\t\t\n\t\t\ty = -2;\n\t\t\n\t\t}\n\t\telse\n\t\t{\n\t\t\ty = normalizedLY;\n\t\t\t\/\/cout << y << endl;\n\t\t}\n\n\n\t\n\t\n\t}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2008-2009\n *\n * Copyright (c) 2015 Tiago Cogumbreiro\n *\n * School of Computing, University of Utah,\n * Salt Lake City, UT 84112, USA\n *\n * and the Gauss Group\n * http:\/\/www.cs.utah.edu\/formal_verification\n *\n * See LICENSE.ISP for licensing information\n *\/\n\n#ifndef _CALL_HPP\n#define _CALL_HPP\n\n#include <vector>\n#include <map>\n#include <set>\n#include <utility>\n\n#include \"name2id.hpp\"\n\nusing std::set;\nusing std::vector;\nusing std::map;\n\nstruct WInt {\n WInt() : wildcard(true), value(0) {}\n WInt(int v) : wildcard(false), value(v) {}\n WInt(const WInt &c) : wildcard(c.wildcard), value(c.value) {}\n bool operator== (const WInt &r) const {\n return wildcard == r.wildcard && value == r.value;\n }\n\n WInt & operator=(const WInt & other) {\n wildcard = other.wildcard;\n value = other.value;\n return *this;\n }\n\n bool isWildcard() const {\n return wildcard;\n }\n int get() const {\n return value;\n }\n bool matches(const WInt &other) const {\n return isWildcard() || *this == other;\n }\nprivate:\n bool wildcard;\n int value;\n};\n\nstatic WInt WILDCARD = WInt();\n\nstruct Recv {\n Recv() : src(0), tag(0) {}\n Recv(const Recv &r) : src(r.src), tag(r.tag) {}\n\n WInt src;\n WInt tag;\n inline bool completesBefore(const Recv &rhs) const {\n return src.matches(rhs.src) && tag.matches(rhs.tag);\n }\n bool operator== (const Recv &r) const {\n return src == r.src && tag == r.tag;\n }\n};\n\nstruct Send {\n Send() : dest(0), tag(0) {}\n Send(const Send &s) : dest(s.dest), tag(s.tag) {}\n\n int dest;\n int tag;\n inline bool completesBefore(const Send &rhs) const {\n return dest == rhs.dest && rhs.tag == tag;\n }\n\n bool canSend(const Recv & recv) const {\n return recv.src.matches(dest) && recv.tag.matches(tag);\n }\n\n bool operator== (const Send &s) const {\n return dest == s.dest && tag == s.tag;\n }\n\n};\n\nstruct Wait {\n Wait(): requests() {}\n Wait(const Wait &w) : requests(w.requests) {}\n\n inline bool requested(int handle) const {\n return requests.find(handle) != requests.end();\n }\n void addRequest(int handle) {\n requests.insert(handle);\n }\n bool operator== (const Wait &w) const {\n return requests == w.requests;\n }\nprivate:\n std::set<int> requests;\n};\n\nenum class Field {\n Source,\n Destination,\n Datatype,\n Root,\n Communicator,\n Op,\n Sendcount,\n Recvcount,\n};\n\n\/*\n * Represents an MPI call issued by a certain process with a `pid`.\n * Each process has a logical closs to uniquely identify its issuing calls,\n * here it is defined as field `cid`.\n * The `envelope` holds information about the MPI call.\n *\/\nstruct Call {\n \/** The process id of the issuer. *\/\n int pid;\n \/** The logical time at which this call has been issued (monotonic). *\/\n int handle;\n \/** The op type defines which payload to use *\/\n OpType call_type;\n \/** The payload of the MPI call *\/\n Recv recv;\n Send send;\n Wait wait;\n map<Field, int> metadata;\n \/** Defines each field of this object. *\/\n Call(int p, int i);\n \/** Copy ctor as one would expect. *\/\n Call(const Call & c);\n \/** Default ctor. *\/\n Call();\n \/** Checks if this call precedes another with the completes-before rel *\/\n bool completesBefore(Call const&) const;\n \/** Checks if pid and cid are the same. *\/\n bool operator== (const Call &c) const;\n \/** Default. *\/\n bool operator!= (const Call &c) const;\n \/** Checks if this call can send to the given receive *\/\n bool canSend(const Call & recv) const;\n \/**\n * pre-condition: all members of `call` must have the same `pid` as this\n * instance.\n *\/\n bool hasAncestors(const set<Call> & call) const;\n \/** Holds if the pids are smaller or, when they match if the cid is smaller. *\/\n friend bool operator< (const Call &a, const Call &b) {\n return a.pid < b.pid || (a.pid == b.pid && a.handle < b.handle);\n }\n};\n\nstruct Process {\n int pid;\n int curr_handle;\n Process(int pid) : pid(pid), curr_handle(0) {}\n\n Call create() {\n return Call(pid, curr_handle++);\n }\n\n \/\/ REMOVE THIS FROM HERE:\n\n Call ISend(int dest) {\n Call c = create();\n c.send.dest = dest;\n c.call_type = OpType::ISEND;\n return c;\n }\n\n Call Barrier() {\n Call c = create();\n c.call_type = OpType::BARRIER;\n return c;\n }\n\n Call IRecv(int src) {\n return IRecv(src, WILDCARD);\n }\n\n Call IRecv(WInt src, WInt rtag) {\n Call c = create();\n c.recv.src = src;\n c.call_type = OpType::IRECV;\n c.recv.tag = rtag;\n \/\/ XXX: e.count\n \/\/ XXX: e.comm\n return c;\n }\n Call IRecv(WInt src) {\n return IRecv(src, WILDCARD);\n }\n\n Call Wait(int req) {\n Call c = create();\n c.call_type = OpType::WAIT;\n c.wait.addRequest(req);\n \/\/ XXX: e.count\n return c;\n }\n};\n#endif\n<commit_msg>Added support for all p-t-p instructions.<commit_after>\/*\n * Copyright (c) 2008-2009\n *\n * Copyright (c) 2015 Tiago Cogumbreiro\n *\n * School of Computing, University of Utah,\n * Salt Lake City, UT 84112, USA\n *\n * and the Gauss Group\n * http:\/\/www.cs.utah.edu\/formal_verification\n *\n * See LICENSE.ISP for licensing information\n *\/\n\n#ifndef _CALL_HPP\n#define _CALL_HPP\n\n#include <vector>\n#include <map>\n#include <set>\n#include <utility>\n\n#include \"name2id.hpp\"\n\nusing std::set;\nusing std::vector;\nusing std::map;\n\nstruct WInt {\n WInt() : wildcard(true), value(0) {}\n WInt(int v) : wildcard(false), value(v) {}\n WInt(const WInt &c) : wildcard(c.wildcard), value(c.value) {}\n bool operator== (const WInt &r) const {\n return wildcard == r.wildcard && value == r.value;\n }\n\n WInt & operator=(const WInt & other) {\n wildcard = other.wildcard;\n value = other.value;\n return *this;\n }\n\n bool isWildcard() const {\n return wildcard;\n }\n int get() const {\n return value;\n }\n bool matches(const WInt &other) const {\n return isWildcard() || *this == other;\n }\nprivate:\n bool wildcard;\n int value;\n};\n\nstatic WInt WILDCARD = WInt();\n\nstruct Recv {\n Recv() : src(0), tag(0) {}\n Recv(const Recv &r) : src(r.src), tag(r.tag) {}\n\n WInt src;\n WInt tag;\n inline bool completesBefore(const Recv &rhs) const {\n return src.matches(rhs.src) && tag.matches(rhs.tag);\n }\n bool operator== (const Recv &r) const {\n return src == r.src && tag == r.tag;\n }\n};\n\nstruct Send {\n Send() : dest(0), tag(0) {}\n Send(const Send &s) : dest(s.dest), tag(s.tag) {}\n\n int dest;\n int tag;\n inline bool completesBefore(const Send &rhs) const {\n return dest == rhs.dest && rhs.tag == tag;\n }\n\n bool canSend(const Recv & recv) const {\n return recv.src.matches(dest) && recv.tag.matches(tag);\n }\n\n bool operator== (const Send &s) const {\n return dest == s.dest && tag == s.tag;\n }\n\n};\n\nstruct Wait {\n Wait(): requests() {}\n Wait(const Wait &w) : requests(w.requests) {}\n\n inline bool requested(int handle) const {\n return requests.find(handle) != requests.end();\n }\n void addRequest(int handle) {\n requests.insert(handle);\n }\n bool operator== (const Wait &w) const {\n return requests == w.requests;\n }\nprivate:\n std::set<int> requests;\n};\n\nenum class Field {\n Source,\n Destination,\n Datatype,\n Root,\n Communicator,\n Op,\n Count,\n Sendcount,\n Recvcount,\n};\n\n\/*\n * Represents an MPI call issued by a certain process with a `pid`.\n * Each process has a logical closs to uniquely identify its issuing calls,\n * here it is defined as field `cid`.\n * The `envelope` holds information about the MPI call.\n *\/\nstruct Call {\n \/** The process id of the issuer. *\/\n int pid;\n \/** The logical time at which this call has been issued (monotonic). *\/\n int handle;\n \/** The op type defines which payload to use *\/\n OpType call_type;\n \/** The payload of the MPI call *\/\n Recv recv;\n Send send;\n Wait wait;\n map<Field, int> metadata;\n \/** Defines each field of this object. *\/\n Call(int p, int i);\n \/** Copy ctor as one would expect. *\/\n Call(const Call & c);\n \/** Default ctor. *\/\n Call();\n \/** Checks if this call precedes another with the completes-before rel *\/\n bool completesBefore(Call const&) const;\n \/** Checks if pid and cid are the same. *\/\n bool operator== (const Call &c) const;\n \/** Default. *\/\n bool operator!= (const Call &c) const;\n \/** Checks if this call can send to the given receive *\/\n bool canSend(const Call & recv) const;\n \/**\n * pre-condition: all members of `call` must have the same `pid` as this\n * instance.\n *\/\n bool hasAncestors(const set<Call> & call) const;\n \/** Holds if the pids are smaller or, when they match if the cid is smaller. *\/\n friend bool operator< (const Call &a, const Call &b) {\n return a.pid < b.pid || (a.pid == b.pid && a.handle < b.handle);\n }\n};\n\nstruct Process {\n int pid;\n int curr_handle;\n Process(int pid) : pid(pid), curr_handle(0) {}\n\n Call create() {\n return Call(pid, curr_handle++);\n }\n\n \/\/ REMOVE THIS FROM HERE:\n\n Call ISend(int dest) {\n Call c = create();\n c.send.dest = dest;\n c.call_type = OpType::ISEND;\n return c;\n }\n\n Call Barrier() {\n Call c = create();\n c.call_type = OpType::BARRIER;\n return c;\n }\n\n Call IRecv(int src) {\n return IRecv(WInt(src));\n }\n\n Call IRecv(WInt src) {\n return IRecv(0, 0, src, WILDCARD, 0);\n }\n\n Call IRecv(int count, int datatype, WInt src, WInt rtag, int comm) {\n Call c = create();\n c.recv.src = src;\n c.call_type = OpType::IRECV;\n c.recv.tag = rtag;\n c.metadata[Field::Count] = count;\n c.metadata[Field::Datatype] = datatype;\n c.metadata[Field::Communicator] = comm;\n return c;\n }\n\n Call Recv(int count, int datatype, WInt src, WInt rtag, int comm) {\n Call c = create();\n c.recv.src = src;\n c.call_type = OpType::RECV;\n c.recv.tag = rtag;\n c.metadata[Field::Count] = count;\n c.metadata[Field::Datatype] = datatype;\n c.metadata[Field::Communicator] = comm;\n return c;\n }\n\n Call Send(int count, int datatype, int dest, int tag, int comm) {\n Call c = create();\n c.call_type = OpType::SEND;\n c.send.dest = dest;\n c.send.tag = tag;\n c.metadata[Field::Count] = count;\n c.metadata[Field::Datatype] = datatype;\n c.metadata[Field::Communicator] = comm;\n return c;\n }\n\n Call Ssend(int count, int datatype, int dest, int tag, int comm) {\n Call c = create();\n c.call_type = OpType::SSEND;\n c.send.dest = dest;\n c.send.tag = tag;\n c.metadata[Field::Count] = count;\n c.metadata[Field::Datatype] = datatype;\n c.metadata[Field::Communicator] = comm;\n return c;\n }\n\n Call Isend(int count, int datatype, int dest, int tag, int comm) {\n Call c = create();\n c.call_type = OpType::ISEND;\n c.send.dest = dest;\n c.send.tag = tag;\n c.metadata[Field::Count] = count;\n c.metadata[Field::Datatype] = datatype;\n c.metadata[Field::Communicator] = comm;\n return c;\n }\n\n Call Wait(int req) {\n Call c = create();\n c.call_type = OpType::WAIT;\n c.wait.addRequest(req);\n \/\/ XXX: e.count\n return c;\n }\n};\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n#include <libclientserver.h>\n\nint Caps::HasCap(int cap)\n{\n\tcap_t caps;\n\tcap_flag_value_t value = CAP_CLEAR;\n\n\tcaps = cap_get_proc();\n\n\tif (cap_get_flag(caps, cap, CAP_EFFECTIVE, &value) < 0)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tcap_free(caps);\n\treturn value;\n}\n\nint Caps::SetCap(int cap)\n{\n\tcap_t caps;\n\tcap_value_t cap_list[1] { cap };\n\n\tcaps = cap_get_proc();\n\tif (caps == NULL)\n\t\treturn -errno;\n\n\tif (cap_set_flag(caps, CAP_EFFECTIVE, 1, cap_list, CAP_SET) == -1)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tif (cap_set_flag(caps, CAP_PERMITTED, 1, cap_list, CAP_SET) == -1)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tif (cap_set_proc(caps) < 0)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tcap_free(caps);\n\treturn 0;\n}\n\nint Caps::Keep()\n{\n\tif (prctl(PR_SET_KEEPCAPS, 1, 0, 0) < 0)\n\t\treturn -errno;\n\treturn 0;\n}\n\nint Caps::UnKeep()\n{\n\tif (prctl(PR_SET_KEEPCAPS, 0, 0, 0) < 0)\n\t\treturn -errno;\n\treturn 0;\n}\n\n\n\n<commit_msg>Fixed syntax problem with array<commit_after>\n#include <libclientserver.h>\n\nint Caps::HasCap(int cap)\n{\n\tcap_t caps;\n\tcap_flag_value_t value = CAP_CLEAR;\n\n\tcaps = cap_get_proc();\n\n\tif (cap_get_flag(caps, cap, CAP_EFFECTIVE, &value) < 0)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tcap_free(caps);\n\treturn value;\n}\n\nint Caps::SetCap(int cap)\n{\n\tcap_t caps;\n\tcap_value_t cap_list[1] = { cap };\n\n\tcaps = cap_get_proc();\n\tif (caps == NULL)\n\t\treturn -errno;\n\n\tif (cap_set_flag(caps, CAP_EFFECTIVE, 1, cap_list, CAP_SET) == -1)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tif (cap_set_flag(caps, CAP_PERMITTED, 1, cap_list, CAP_SET) == -1)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tif (cap_set_proc(caps) < 0)\n\t{\n\t\tint err = errno;\n\t\tcap_free(caps);\n\t\treturn -err;\n\t}\n\n\tcap_free(caps);\n\treturn 0;\n}\n\nint Caps::Keep()\n{\n\tif (prctl(PR_SET_KEEPCAPS, 1, 0, 0) < 0)\n\t\treturn -errno;\n\treturn 0;\n}\n\nint Caps::UnKeep()\n{\n\tif (prctl(PR_SET_KEEPCAPS, 0, 0, 0) < 0)\n\t\treturn -errno;\n\treturn 0;\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef CARD_HPP\n#define CARD_HPP\nclass IDeck;\nenum class Suit\n{\n\tCLUBS,\n\tDIAMONDS,\n\tHEARTS,\n\tSPADES\n};\n\nenum class Rank\n{\n\tTWO,\n\tTHREE,\n\tFOUR,\n\tFIVE,\n\tSIX,\n\tSEVEN,\n\tEIGHT,\n\tNINE,\n\tTEN,\n\tJACK,\n\tQUEEN,\n\tKING,\n\tACE\n};\n\nstruct Card\n{\n\tpublic:\n\tSuit suit;\n\tRank rank;\n\tCard(Suit, Rank);\n};\n\n#endif\n<commit_msg>Card :(<commit_after>#ifndef CARD_HPP\n#define CARD_HPP\n\nenum class Suit\n{\n\tCLUBS,\n\tDIAMONDS,\n\tHEARTS,\n\tSPADES\n};\n\nenum class Rank\n{\n\tTWO,\n\tTHREE,\n\tFOUR,\n\tFIVE,\n\tSIX,\n\tSEVEN,\n\tEIGHT,\n\tNINE,\n\tTEN,\n\tJACK,\n\tQUEEN,\n\tKING,\n\tACE\n};\n\nstruct Card\n{\n\tpublic:\n\tSuit suit;\n\tRank rank;\n\tCard(Suit, Rank);\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2017, Image Engine. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided with\n\/\/ the distribution.\n\/\/\n\/\/ * Neither the name of John Haddon nor the names of\n\/\/ any other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/container\/flat_map.hpp\"\n#include \"boost\/algorithm\/string\/predicate.hpp\"\n#include \"boost\/algorithm\/string.hpp\"\n\n#include \"IECore\/Light.h\"\n#include \"IECore\/Shader.h\"\n\n#include \"IECoreGL\/Group.h\"\n#include \"IECoreGL\/Primitive.h\"\n\n#include \"GafferSceneUI\/LightFilterVisualiser.h\"\n#include \"GafferSceneUI\/AttributeVisualiser.h\"\n\nusing namespace std;\nusing namespace Imath;\nusing namespace GafferSceneUI;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Internal implementation details\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n\ntypedef std::pair<IECore::InternedString, IECore::InternedString> AttributeAndShaderNames;\n\ntypedef boost::container::flat_map<AttributeAndShaderNames, ConstLightFilterVisualiserPtr> LightFilterVisualisers;\nLightFilterVisualisers &lightFilterVisualisers()\n{\n\tstatic LightFilterVisualisers l;\n\treturn l;\n}\n\n\/\/\/ Class for visualisation of light filters. All light filters in Gaffer are represented\n\/\/\/ as IECore::Shader objects, but we need to visualise them differently\n\/\/\/ depending on their shader name (accessed using `IECore::Shader::getName()`). A\n\/\/\/ factory mechanism is provided to map from this type to a specialised\n\/\/\/ LightFilterVisualiser.\nclass AttributeVisualiserForLightFilters : public AttributeVisualiser\n{\n\n\tpublic :\n\n\t\tIE_CORE_DECLAREMEMBERPTR( AttributeVisualiserForLightFilters )\n\n\t\t\/\/\/ Uses a custom visualisation registered via `registerLightFilterVisualiser()` if one\n\t\t\/\/\/ is available, if not falls back to a basic visualisation.\n\t\tvirtual IECoreGL::ConstRenderablePtr visualise( const IECore::CompoundObject *attributes, IECoreGL::ConstStatePtr &state ) const;\n\n\tprotected :\n\n\t\tstatic AttributeVisualiser::AttributeVisualiserDescription<AttributeVisualiserForLightFilters> g_visualiserDescription;\n\n};\n\n} \/\/ namespace\n\nIECoreGL::ConstRenderablePtr AttributeVisualiserForLightFilters::visualise( const IECore::CompoundObject *attributes, IECoreGL::ConstStatePtr &state ) const\n{\n\tif( !attributes )\n\t{\n\t\treturn nullptr;\n\t}\n\n\tIECoreGL::GroupPtr resultGroup = nullptr;\n\tIECoreGL::StatePtr resultState = nullptr;\n\n\t\/\/\/ This seems pretty expensive to do everywhere.\n\t\/\/\/ The alternative would be to register attribute visualisers to specific attributes.\n\t\/\/\/ But then we wouldn't be able to have a visualiser that is influenced by multiple attributes simultaneously\n\tfor( const auto& it : attributes->members() )\n\t{\n\t\tconst std::string &attributeName = it.first.string();\n\t\tif( attributeName.find( \":lightFilter\" ) == std::string::npos )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst IECore::ObjectVector *filterShaderVector = IECore::runTimeCast<const IECore::ObjectVector>( it.second.get() );\n\t\tif( !filterShaderVector || filterShaderVector->members().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tIECore::InternedString filterShaderName;\n\t\tif( const IECore::Shader *filterShader = IECore::runTimeCast<const IECore::Shader>( filterShaderVector->members().back().get() ) )\n\t\t{\n\t\t\tfilterShaderName = filterShader->getName();\n\t\t}\n\n\t\tif( filterShaderName.string().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ find the light shader influenced by the filter\n\n\t\tstd::vector<std::string> tokens;\n\t\tboost::split( tokens, attributeName, boost::is_any_of(\":\") );\n\t\tauto lightIt = attributes->members().find( tokens.front() + \":light\" );\n\n\t\tif( lightIt == attributes->members().end() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst IECore::ObjectVector *lightShaderVector = IECore::runTimeCast<const IECore::ObjectVector>( lightIt->second.get() );\n\t\tif( !lightShaderVector || lightShaderVector->members().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst LightFilterVisualisers &l = lightFilterVisualisers();\n\n\t\t\/\/ light filters are stored in attributes following this syntax:\n\t\t\/\/ renderer:lightFilter:optionalName. Visualisers get registered to\n\t\t\/\/ renderer:lightFilter only, though. It's therefore necessary to strip off\n\t\t\/\/ the optional part\n\t\tstd::string attrLookup = tokens[0] + \":\" + tokens[1];\n\n\t\tconst LightFilterVisualiser *visualiser = nullptr;\n\t\tauto visIt = l.find( AttributeAndShaderNames( attrLookup, filterShaderName ) );\n\t\tif( visIt != l.end() )\n\t\t{\n\t\t\tvisualiser = visIt->second.get();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tIECoreGL::ConstStatePtr curState = nullptr;\n\t\tIECoreGL::ConstRenderablePtr curVis = visualiser->visualise( attributeName, filterShaderVector, lightShaderVector, curState );\n\n\t\tif( curVis )\n\t\t{\n\t\t\tif( !resultGroup )\n\t\t\t{\n\t\t\t\tresultGroup = new IECoreGL::Group();\n\t\t\t}\n\t\t\t\/\/ resultGroup will be returned as const, so const-casting the children in order to add them is safe\n\t\t\tresultGroup->addChild( const_cast<IECoreGL::Renderable*>( curVis.get() ) );\n\t\t}\n\n\t\tif( curState )\n\t\t{\n\t\t\tif( !resultState )\n\t\t\t{\n\t\t\t\tresultState = new IECoreGL::State( false );\n\t\t\t}\n\t\t\tresultState->add( const_cast<IECoreGL::State*>( curState.get() ) );\n\t\t}\n\t}\n\n\tstate = resultState;\n\treturn resultGroup;\n}\n\nAttributeVisualiser::AttributeVisualiserDescription<AttributeVisualiserForLightFilters> AttributeVisualiserForLightFilters::g_visualiserDescription;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ LightVisualiser class\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nLightFilterVisualiser::LightFilterVisualiser()\n{\n}\n\nLightFilterVisualiser::~LightFilterVisualiser()\n{\n}\n\nvoid LightFilterVisualiser::registerLightFilterVisualiser( const IECore::InternedString &attributeName, const IECore::InternedString &shaderName, ConstLightFilterVisualiserPtr visualiser )\n{\n\tlightFilterVisualisers()[AttributeAndShaderNames( attributeName, shaderName )] = visualiser;\n}\n<commit_msg>LightFilterVisualiser : Remove unused include<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2017, Image Engine. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided with\n\/\/ the distribution.\n\/\/\n\/\/ * Neither the name of John Haddon nor the names of\n\/\/ any other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"boost\/container\/flat_map.hpp\"\n#include \"boost\/algorithm\/string\/predicate.hpp\"\n#include \"boost\/algorithm\/string.hpp\"\n\n#include \"IECore\/Shader.h\"\n\n#include \"IECoreGL\/Group.h\"\n#include \"IECoreGL\/Primitive.h\"\n\n#include \"GafferSceneUI\/LightFilterVisualiser.h\"\n#include \"GafferSceneUI\/AttributeVisualiser.h\"\n\nusing namespace std;\nusing namespace Imath;\nusing namespace GafferSceneUI;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Internal implementation details\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace\n{\n\ntypedef std::pair<IECore::InternedString, IECore::InternedString> AttributeAndShaderNames;\n\ntypedef boost::container::flat_map<AttributeAndShaderNames, ConstLightFilterVisualiserPtr> LightFilterVisualisers;\nLightFilterVisualisers &lightFilterVisualisers()\n{\n\tstatic LightFilterVisualisers l;\n\treturn l;\n}\n\n\/\/\/ Class for visualisation of light filters. All light filters in Gaffer are represented\n\/\/\/ as IECore::Shader objects, but we need to visualise them differently\n\/\/\/ depending on their shader name (accessed using `IECore::Shader::getName()`). A\n\/\/\/ factory mechanism is provided to map from this type to a specialised\n\/\/\/ LightFilterVisualiser.\nclass AttributeVisualiserForLightFilters : public AttributeVisualiser\n{\n\n\tpublic :\n\n\t\tIE_CORE_DECLAREMEMBERPTR( AttributeVisualiserForLightFilters )\n\n\t\t\/\/\/ Uses a custom visualisation registered via `registerLightFilterVisualiser()` if one\n\t\t\/\/\/ is available, if not falls back to a basic visualisation.\n\t\tvirtual IECoreGL::ConstRenderablePtr visualise( const IECore::CompoundObject *attributes, IECoreGL::ConstStatePtr &state ) const;\n\n\tprotected :\n\n\t\tstatic AttributeVisualiser::AttributeVisualiserDescription<AttributeVisualiserForLightFilters> g_visualiserDescription;\n\n};\n\n} \/\/ namespace\n\nIECoreGL::ConstRenderablePtr AttributeVisualiserForLightFilters::visualise( const IECore::CompoundObject *attributes, IECoreGL::ConstStatePtr &state ) const\n{\n\tif( !attributes )\n\t{\n\t\treturn nullptr;\n\t}\n\n\tIECoreGL::GroupPtr resultGroup = nullptr;\n\tIECoreGL::StatePtr resultState = nullptr;\n\n\t\/\/\/ This seems pretty expensive to do everywhere.\n\t\/\/\/ The alternative would be to register attribute visualisers to specific attributes.\n\t\/\/\/ But then we wouldn't be able to have a visualiser that is influenced by multiple attributes simultaneously\n\tfor( const auto& it : attributes->members() )\n\t{\n\t\tconst std::string &attributeName = it.first.string();\n\t\tif( attributeName.find( \":lightFilter\" ) == std::string::npos )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst IECore::ObjectVector *filterShaderVector = IECore::runTimeCast<const IECore::ObjectVector>( it.second.get() );\n\t\tif( !filterShaderVector || filterShaderVector->members().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tIECore::InternedString filterShaderName;\n\t\tif( const IECore::Shader *filterShader = IECore::runTimeCast<const IECore::Shader>( filterShaderVector->members().back().get() ) )\n\t\t{\n\t\t\tfilterShaderName = filterShader->getName();\n\t\t}\n\n\t\tif( filterShaderName.string().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\t\/\/ find the light shader influenced by the filter\n\n\t\tstd::vector<std::string> tokens;\n\t\tboost::split( tokens, attributeName, boost::is_any_of(\":\") );\n\t\tauto lightIt = attributes->members().find( tokens.front() + \":light\" );\n\n\t\tif( lightIt == attributes->members().end() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst IECore::ObjectVector *lightShaderVector = IECore::runTimeCast<const IECore::ObjectVector>( lightIt->second.get() );\n\t\tif( !lightShaderVector || lightShaderVector->members().empty() )\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tconst LightFilterVisualisers &l = lightFilterVisualisers();\n\n\t\t\/\/ light filters are stored in attributes following this syntax:\n\t\t\/\/ renderer:lightFilter:optionalName. Visualisers get registered to\n\t\t\/\/ renderer:lightFilter only, though. It's therefore necessary to strip off\n\t\t\/\/ the optional part\n\t\tstd::string attrLookup = tokens[0] + \":\" + tokens[1];\n\n\t\tconst LightFilterVisualiser *visualiser = nullptr;\n\t\tauto visIt = l.find( AttributeAndShaderNames( attrLookup, filterShaderName ) );\n\t\tif( visIt != l.end() )\n\t\t{\n\t\t\tvisualiser = visIt->second.get();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\n\t\tIECoreGL::ConstStatePtr curState = nullptr;\n\t\tIECoreGL::ConstRenderablePtr curVis = visualiser->visualise( attributeName, filterShaderVector, lightShaderVector, curState );\n\n\t\tif( curVis )\n\t\t{\n\t\t\tif( !resultGroup )\n\t\t\t{\n\t\t\t\tresultGroup = new IECoreGL::Group();\n\t\t\t}\n\t\t\t\/\/ resultGroup will be returned as const, so const-casting the children in order to add them is safe\n\t\t\tresultGroup->addChild( const_cast<IECoreGL::Renderable*>( curVis.get() ) );\n\t\t}\n\n\t\tif( curState )\n\t\t{\n\t\t\tif( !resultState )\n\t\t\t{\n\t\t\t\tresultState = new IECoreGL::State( false );\n\t\t\t}\n\t\t\tresultState->add( const_cast<IECoreGL::State*>( curState.get() ) );\n\t\t}\n\t}\n\n\tstate = resultState;\n\treturn resultGroup;\n}\n\nAttributeVisualiser::AttributeVisualiserDescription<AttributeVisualiserForLightFilters> AttributeVisualiserForLightFilters::g_visualiserDescription;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ LightVisualiser class\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nLightFilterVisualiser::LightFilterVisualiser()\n{\n}\n\nLightFilterVisualiser::~LightFilterVisualiser()\n{\n}\n\nvoid LightFilterVisualiser::registerLightFilterVisualiser( const IECore::InternedString &attributeName, const IECore::InternedString &shaderName, ConstLightFilterVisualiserPtr visualiser )\n{\n\tlightFilterVisualisers()[AttributeAndShaderNames( attributeName, shaderName )] = visualiser;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2013, Luke Goddard. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Luke Goddard nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <iostream>\n#include <cstdlib>\n\n#include \"GanderImage\/ChannelBrothers.h\"\n#include \"GanderImageTest\/ChannelBrothersTest.h\"\n\n#include \"boost\/test\/floating_point_comparison.hpp\"\n#include \"boost\/test\/test_tools.hpp\"\n\nusing namespace Gander;\nusing namespace Gander::Image;\nusing namespace Gander::ImageTest;\nusing namespace boost;\nusing namespace boost::unit_test;\n\nnamespace Gander\n{\n\nnamespace ImageTest\n{\n\nstruct ChannelBrothersTest\n{\n\tvoid testBrothersTraitsRegistry()\n\t{\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_RGB ) ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_RGBA ) ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_BGR ) ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_BGRA ) ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_UV ) ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_VU ) ), 2 );\n\t\t\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_RGB ) ), int( BrotherTraits< Brothers_RGB >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_RGBA ) ), int( BrotherTraits< Brothers_RGBA >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_BGR ) ), int( BrotherTraits< Brothers_BGR >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_BGRA ) ), int( BrotherTraits< Brothers_BGRA >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_UV ) ), int( BrotherTraits< Brothers_UV >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_VU ) ), int( BrotherTraits< Brothers_VU >::BrothersMask ) );\n\t}\n\n\tvoid testBrotherTraitsSpecialization()\n\t{\n\t\t\/\/\/ Check that we can decalare a specialization of the ChannelBrothers class.\n\t\t\/\/\/ If there was no specialization, a compilation error would occur.\n\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_RGB > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 7 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 36 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Red ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_RGBA > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 15 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 228 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Red ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_BGR > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 7 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 6 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Blue ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Blue ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_BGRA > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 15 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 198 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Blue ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Blue ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_UV > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 96 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 4096 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_U ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_VU > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 96 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 1024 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_V ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_V ) );\n\t\t}\n\t}\n};\n\nstruct ChannelBrothersTestSuite : public boost::unit_test::test_suite\n{\n\tChannelBrothersTestSuite() : boost::unit_test::test_suite( \"ChannelBrothersTestSuite\" )\n\t{\n\t\tboost::shared_ptr<ChannelBrothersTest> instance( new ChannelBrothersTest() );\n\t\tadd( BOOST_CLASS_TEST_CASE( &ChannelBrothersTest::testBrotherTraitsSpecialization, instance ) );\n\t\tadd( BOOST_CLASS_TEST_CASE( &ChannelBrothersTest::testBrothersTraitsRegistry, instance ) );\n\t}\n};\n\nvoid addChannelBrothersTest( boost::unit_test::test_suite *test )\n{\n\ttest->add( new ChannelBrothersTestSuite( ) );\n}\n\n} \/\/ namespace ImageTest\n\n} \/\/ namespace Gander\n\n<commit_msg>Fixed a typo.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2013-2014, Luke Goddard. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Luke Goddard nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#include <iostream>\n#include <cstdlib>\n\n#include \"GanderImage\/ChannelBrothers.h\"\n#include \"GanderImageTest\/ChannelBrothersTest.h\"\n\n#include \"boost\/test\/floating_point_comparison.hpp\"\n#include \"boost\/test\/test_tools.hpp\"\n\nusing namespace Gander;\nusing namespace Gander::Image;\nusing namespace Gander::ImageTest;\nusing namespace boost;\nusing namespace boost::unit_test;\n\nnamespace Gander\n{\n\nnamespace ImageTest\n{\n\nstruct ChannelBrothersTest\n{\n\tvoid testBrothersTraitsRegistry()\n\t{\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_RGB ) ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_RGBA ) ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_BGR ) ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_BGRA ) ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_UV ) ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::numberOfBrothers( Brothers_VU ) ), 2 );\n\t\t\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_RGB ) ), int( BrotherTraits< Brothers_RGB >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_RGBA ) ), int( BrotherTraits< Brothers_RGBA >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_BGR ) ), int( BrotherTraits< Brothers_BGR >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_BGRA ) ), int( BrotherTraits< Brothers_BGRA >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_UV ) ), int( BrotherTraits< Brothers_UV >::BrothersMask ) );\n\t\tBOOST_CHECK_EQUAL( int( BrotherTraits<>::brotherMask( Brothers_VU ) ), int( BrotherTraits< Brothers_VU >::BrothersMask ) );\n\t}\n\n\tvoid testBrotherTraitsSpecialization()\n\t{\n\t\t\/\/\/ Check that we can declare a specialization of the ChannelBrothers class.\n\t\t\/\/\/ If there was no specialization, a compilation error would occur.\n\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_RGB > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 7 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 36 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Red ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_RGBA > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 15 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 228 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Red ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_BGR > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 7 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 6 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Blue ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Blue ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_BGRA > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 4 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 15 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 3 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 198 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_Red ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_Blue ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_Blue ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_UV > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 96 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 4096 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_U ) );\n\t\t}\n\t\t\n\t\t{\n\t\ttypedef BrotherTraits< Brothers_VU > Traits;\n\t\tBOOST_CHECK_EQUAL( int( Traits::NumberOfBrothers ), 2 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrothersMask ), 96 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder1 ), 1 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder2 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder3 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOrder4 ), 0 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::OffsetsShiftedByChannelValue ), 1024 );\n\t\tBOOST_CHECK_EQUAL( int( Traits::BrotherOfLowestValue ), int( Chan_U ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothers ), int( Chan_V ) );\n\t\tBOOST_CHECK_EQUAL( int( Traits::FirstBrotherInBrothersMask ), int( Mask_V ) );\n\t\t}\n\t}\n};\n\nstruct ChannelBrothersTestSuite : public boost::unit_test::test_suite\n{\n\tChannelBrothersTestSuite() : boost::unit_test::test_suite( \"ChannelBrothersTestSuite\" )\n\t{\n\t\tboost::shared_ptr<ChannelBrothersTest> instance( new ChannelBrothersTest() );\n\t\tadd( BOOST_CLASS_TEST_CASE( &ChannelBrothersTest::testBrotherTraitsSpecialization, instance ) );\n\t\tadd( BOOST_CLASS_TEST_CASE( &ChannelBrothersTest::testBrothersTraitsRegistry, instance ) );\n\t}\n};\n\nvoid addChannelBrothersTest( boost::unit_test::test_suite *test )\n{\n\ttest->add( new ChannelBrothersTestSuite( ) );\n}\n\n} \/\/ namespace ImageTest\n\n} \/\/ namespace Gander\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Genes\/Opponent_Pieces_Targeted_Gene.h\"\n\n#include <array>\n#include <memory>\n\n#include \"Game\/Board.h\"\n#include \"Pieces\/Piece.h\"\n#include \"Pieces\/Piece_Types.h\"\n#include \"Moves\/Move.h\"\n#include \"Genes\/Gene.h\"\n#include \"Genes\/Piece_Strength_Gene.h\"\n\nOpponent_Pieces_Targeted_Gene::Opponent_Pieces_Targeted_Gene(const Piece_Strength_Gene* piece_strength_gene) :\n piece_strenth_source(piece_strength_gene)\n{\n}\n\ndouble Opponent_Pieces_Targeted_Gene::score_board(const Board& board, const Board&) const\n{\n double score = 0.0;\n std::array<bool, 64> already_counted{};\n\n for(const auto& move : board.legal_moves())\n {\n if(move->is_en_passant())\n {\n score += piece_strenth_source->piece_value(board.get_piece(PAWN, opposite(board.whose_turn())));\n continue;\n }\n\n if( ! move->can_capture())\n {\n continue;\n }\n\n auto end_file = move->end_file();\n auto end_rank = move->end_rank();\n auto target_piece = board.piece_on_square(end_file, end_rank);\n auto target_index = Board::board_index(end_file, end_rank);\n if(target_piece && ! already_counted[target_index])\n {\n score += piece_strenth_source->piece_value(target_piece);\n already_counted[target_index] = true;\n }\n }\n\n return score;\n}\n\nstd::unique_ptr<Gene> Opponent_Pieces_Targeted_Gene::duplicate() const\n{\n return std::make_unique<Opponent_Pieces_Targeted_Gene>(*this);\n}\n\nstd::string Opponent_Pieces_Targeted_Gene::name() const\n{\n return \"Opponent Pieces Targeted Gene\";\n}\n\nvoid Opponent_Pieces_Targeted_Gene::reset_piece_strength_gene(const Piece_Strength_Gene* psg)\n{\n piece_strenth_source = psg;\n}\n<commit_msg>Opponent Pieces Targeted Gene improvement<commit_after>#include \"Genes\/Opponent_Pieces_Targeted_Gene.h\"\n\n#include <array>\n#include <memory>\n\n#include \"Game\/Board.h\"\n#include \"Pieces\/Piece.h\"\n#include \"Pieces\/Piece_Types.h\"\n#include \"Moves\/Move.h\"\n#include \"Genes\/Gene.h\"\n#include \"Genes\/Piece_Strength_Gene.h\"\n\nOpponent_Pieces_Targeted_Gene::Opponent_Pieces_Targeted_Gene(const Piece_Strength_Gene* piece_strength_gene) :\n piece_strenth_source(piece_strength_gene)\n{\n}\n\ndouble Opponent_Pieces_Targeted_Gene::score_board(const Board& board, const Board&) const\n{\n double score = 0.0;\n auto squares_attacked = board.all_square_indices_attacked();\n\n for(char file = 'a'; file <= 'h'; ++file)\n {\n for(int rank = 1; rank <= 8; ++rank)\n {\n if(squares_attacked[board.board_index(file, rank)])\n {\n score += piece_strenth_source->piece_value(board.piece_on_square(file, rank));\n }\n }\n }\n\n return score;\n}\n\nstd::unique_ptr<Gene> Opponent_Pieces_Targeted_Gene::duplicate() const\n{\n return std::make_unique<Opponent_Pieces_Targeted_Gene>(*this);\n}\n\nstd::string Opponent_Pieces_Targeted_Gene::name() const\n{\n return \"Opponent Pieces Targeted Gene\";\n}\n\nvoid Opponent_Pieces_Targeted_Gene::reset_piece_strength_gene(const Piece_Strength_Gene* psg)\n{\n piece_strenth_source = psg;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ PelotonDB\n\/\/\n\/\/ materialization_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/materialization_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"backend\/executor\/materialization_executor.h\"\n\n#include <cassert>\n#include <memory>\n#include <utility>\n\n#include \"backend\/planner\/materialization_plan.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/data_table.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/\/ Row-oriented materialization\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/\/ Column-oriented materialization\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n planner::AbstractPlan *node, ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DInit() {\n assert(children_.size() == 1);\n\n return true;\n}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n * base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n * base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns tile by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n LogicalTile *source_tile,\n std::unordered_map<storage::Tile *, std::vector<oid_t>> &\n cols_in_physical_tile) {\n for (const auto &kv : old_to_new_cols) {\n oid_t col = kv.first;\n\n \/\/ figure out base physical tile for column in logical tile\n storage::Tile *base_tile = source_tile->GetBaseTile(col);\n\n std::vector<oid_t> &cols_from_tile = cols_in_physical_tile[base_tile];\n cols_from_tile.push_back(col);\n }\n}\n\n\/**\n * @brief Does the actual copying of data into the new physical tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n * to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n auto dest_tile_column_count = dest_tile->GetColumnCount();\n \/\/ TODO: Make this a parameter\n oid_t column_count_threshold = 20;\n bool row_wise_materialization = false;\n\n if(peloton_layout == LAYOUT_COLUMN)\n row_wise_materialization = true;\n\n if(peloton_layout == LAYOUT_HYBRID &&\n dest_tile_column_count > column_count_threshold)\n row_wise_materialization = true;\n\n \/\/ Materialize as needed\n if(row_wise_materialization == true) {\n MaterializeRowAtAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n else {\n MaterializeColumnAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n\n}\n\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n auto &schema = source_tile->GetSchema();\n oid_t new_tuple_id = 0;\n\n auto& column_position_lists = source_tile->GetPositionLists();\n\n \/\/ Get old column information\n std::vector<oid_t> old_column_position_idxs;\n std::vector<size_t> old_column_offsets;\n std::vector<ValueType> old_column_types;\n std::vector<bool> old_is_inlineds;\n std::vector<storage::Tile*> old_tiles;\n\n \/\/ Get new column information\n std::vector<size_t> new_column_offsets;\n std::vector<bool> new_is_inlineds;\n std::vector<size_t> new_column_lengths;\n\n \/\/ Amortize schema lookups once per column\n for (oid_t old_col_id : old_column_ids) {\n auto& column_info = schema[old_col_id];\n\n \/\/ Get the position list\n old_column_position_idxs.push_back(column_info.position_list_idx);\n\n \/\/ Get old column information\n storage::Tile *old_tile = column_info.base_tile;\n old_tiles.push_back(old_tile);\n auto old_schema = old_tile->GetSchema();\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n old_column_offsets.push_back(old_column_offset);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n old_column_types.push_back(old_column_type);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n old_is_inlineds.push_back(old_is_inlined);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n new_column_offsets.push_back(new_column_offset);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n new_is_inlineds.push_back(new_is_inlined);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n new_column_lengths.push_back(new_column_length);\n }\n\n assert(new_column_offsets.size() == old_column_ids.size());\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy all values in the tuple to the physical tile\n \/\/ This uses fast getter and setter functions\n for (oid_t old_tuple_id : *source_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n oid_t col_itr = 0;\n\n for (oid_t old_col_id : old_column_position_idxs) {\n\n auto& column_position_list = column_position_lists[old_col_id];\n\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n\n auto value = old_tiles[col_itr]->GetValueFast(base_tuple_id,\n old_column_offsets[col_itr],\n old_column_types[col_itr],\n old_is_inlineds[col_itr]);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offsets[col_itr],\n new_is_inlineds[col_itr],\n new_column_lengths[col_itr]);\n\n \/\/ Go to next column\n col_itr++;\n }\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n}\n\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n for (oid_t old_col_id : old_column_ids) {\n auto &column_info = source_tile->GetColumnInfo(old_col_id);\n\n \/\/ Amortize schema lookups once per column\n storage::Tile *old_tile = column_info.base_tile;\n auto old_schema = old_tile->GetSchema();\n\n \/\/ Get old column information\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n\n \/\/ Get the position list\n auto& column_position_list = source_tile->GetPositionList(column_info.position_list_idx);\n oid_t new_tuple_id = 0;\n\n \/\/ Copy all values in the column to the physical tile\n \/\/ This uses fast getter and setter functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (oid_t old_tuple_id : *source_tile) {\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n auto value = old_tile->GetValueFast(base_tuple_id,\n old_column_offset,\n old_column_type,\n old_is_inlined);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offset,\n new_is_inlined,\n new_column_length);\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n }\n\n}\n\nstd::unordered_map<oid_t, oid_t> MaterializationExecutor::BuildIdentityMapping(\n const catalog::Schema *schema) {\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n oid_t column_count = schema->GetColumnCount();\n for (oid_t col = 0; col < column_count; col++) {\n old_to_new_cols[col] = col;\n }\n\n return old_to_new_cols;\n}\n\n\/**\n * @brief Create a physical tile for the given logical tile\n * @param source_tile Source tile from which the physical tile is created\n * @return a logical tile wrapper for the created physical tile\n *\/\nLogicalTile *MaterializationExecutor::Physify(LogicalTile *source_tile) {\n std::unique_ptr<catalog::Schema> source_tile_schema(\n source_tile->GetPhysicalSchema());\n const int num_tuples = source_tile->GetTupleCount();\n const catalog::Schema *output_schema;\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n auto node = GetRawNode();\n\n \/\/ Create a default identity mapping node if we did not get one\n if (node == nullptr) {\n assert(source_tile_schema.get());\n output_schema = source_tile_schema.get();\n\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n \/\/ Else use the mapping in the given plan node\n else {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n if (node.GetSchema()) {\n output_schema = node.GetSchema();\n old_to_new_cols = node.old_to_new_cols();\n } else {\n output_schema = source_tile_schema.get();\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n }\n\n \/\/ Generate mappings.\n std::unordered_map<storage::Tile *, std::vector<oid_t>> tile_to_cols;\n GenerateTileToColMap(old_to_new_cols, source_tile, tile_to_cols);\n\n \/\/ Create new physical tile.\n std::unique_ptr<storage::Tile> dest_tile(\n storage::TileFactory::GetTempTile(*output_schema, num_tuples));\n\n \/\/ Proceed to materialize logical tile by physical tile at a time.\n MaterializeByTiles(source_tile, old_to_new_cols, tile_to_cols,\n dest_tile.get());\n\n bool own_base_tile = true;\n\n \/\/ Wrap physical tile in logical tile.\n return LogicalTileFactory::WrapTiles({dest_tile.release()}, own_base_tile);\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n * in a new logical tile.\n *\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DExecute() {\n \/\/ Retrieve child tile.\n const bool success = children_[0]->Execute();\n if (!success) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> source_tile(children_[0]->GetOutput());\n LogicalTile *output_tile = nullptr;\n\n \/\/ Check the number of tuples in input logical tile\n \/\/ If none, then just return false\n const int num_tuples = source_tile->GetTupleCount();\n if (num_tuples == 0) {\n return false;\n }\n\n auto node = GetRawNode();\n bool physify_flag = true; \/\/ by default, we create a physical tile\n\n if (node != nullptr) {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n physify_flag = node.GetPhysifyFlag();\n }\n\n if (physify_flag) {\n \/* create a physical tile and a logical tile wrapper to be the output *\/\n output_tile = Physify(source_tile.get());\n } else {\n \/* just pass thru the underlying logical tile *\/\n output_tile = source_tile.release();\n }\n\n SetOutput(output_tile);\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<commit_msg>Checkpoint<commit_after>\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ PelotonDB\n\/\/\n\/\/ materialization_executor.cpp\n\/\/\n\/\/ Identification: src\/backend\/executor\/materialization_executor.cpp\n\/\/\n\/\/ Copyright (c) 2015, Carnegie Mellon University Database Group\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"backend\/executor\/materialization_executor.h\"\n\n#include <cassert>\n#include <memory>\n#include <utility>\n\n#include \"backend\/planner\/materialization_plan.h\"\n#include \"backend\/executor\/logical_tile.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/storage\/tile.h\"\n#include \"backend\/storage\/data_table.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/\/ Row-oriented materialization\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/\/ Column-oriented materialization\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile);\n\n\/**\n * @brief Constructor for the materialization executor.\n * @param node Materialization node corresponding to this executor.\n *\/\nMaterializationExecutor::MaterializationExecutor(\n planner::AbstractPlan *node, ExecutorContext *executor_context)\n: AbstractExecutor(node, executor_context) {}\n\n\/**\n * @brief Nothing to init at the moment.\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DInit() {\n assert(children_.size() == 1);\n\n return true;\n}\n\n\/**\n * @brief Generates map from each base tile to columns originally from that\n * base tile to be materialized.\n * @param column_ids Ids of columns to be materialized.\n * @param source_tile Logical tile that contains mapping from columns to\n * base tiles.\n * @param tile_to_cols Map to be populated with mappings from tile to columns.\n *\n * We generate this mapping so that we can materialize columns tile by tile for\n * efficiency reasons.\n *\/\nvoid MaterializationExecutor::GenerateTileToColMap(\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n LogicalTile *source_tile,\n std::unordered_map<storage::Tile *, std::vector<oid_t>> &\n cols_in_physical_tile) {\n for (const auto &kv : old_to_new_cols) {\n oid_t col = kv.first;\n\n \/\/ figure out base physical tile for column in logical tile\n storage::Tile *base_tile = source_tile->GetBaseTile(col);\n\n std::vector<oid_t> &cols_from_tile = cols_in_physical_tile[base_tile];\n cols_from_tile.push_back(col);\n }\n}\n\n\/**\n * @brief Does the actual copying of data into the new physical tile.\n * @param source_tile Source tile to copy data from.\n * @param tile_to_cols Map from base tile to columns in that tile\n * to be materialized.\n * @param dest_tile New tile to copy data into.\n *\/\nvoid MaterializationExecutor::MaterializeByTiles(\n LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n auto dest_tile_column_count = dest_tile->GetColumnCount();\n \/\/ TODO: Make this a parameter\n oid_t column_count_threshold = 20;\n bool row_wise_materialization = true;\n\n if(peloton_layout == LAYOUT_COLUMN)\n row_wise_materialization = false;\n\n if(peloton_layout == LAYOUT_HYBRID &&\n dest_tile_column_count < column_count_threshold)\n row_wise_materialization = false;\n\n \/\/ Materialize as needed\n if(row_wise_materialization == true) {\n MaterializeRowAtAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n else {\n MaterializeColumnAtATime(source_tile, old_to_new_cols, tile_to_cols, dest_tile);\n }\n\n}\n\nvoid MaterializeRowAtAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n auto &schema = source_tile->GetSchema();\n oid_t new_tuple_id = 0;\n\n auto& column_position_lists = source_tile->GetPositionLists();\n\n \/\/ Get old column information\n std::vector<oid_t> old_column_position_idxs;\n std::vector<size_t> old_column_offsets;\n std::vector<ValueType> old_column_types;\n std::vector<bool> old_is_inlineds;\n std::vector<storage::Tile*> old_tiles;\n\n \/\/ Get new column information\n std::vector<size_t> new_column_offsets;\n std::vector<bool> new_is_inlineds;\n std::vector<size_t> new_column_lengths;\n\n \/\/ Amortize schema lookups once per column\n for (oid_t old_col_id : old_column_ids) {\n auto& column_info = schema[old_col_id];\n\n \/\/ Get the position list\n old_column_position_idxs.push_back(column_info.position_list_idx);\n\n \/\/ Get old column information\n storage::Tile *old_tile = column_info.base_tile;\n old_tiles.push_back(old_tile);\n auto old_schema = old_tile->GetSchema();\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n old_column_offsets.push_back(old_column_offset);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n old_column_types.push_back(old_column_type);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n old_is_inlineds.push_back(old_is_inlined);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n new_column_offsets.push_back(new_column_offset);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n new_is_inlineds.push_back(new_is_inlined);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n new_column_lengths.push_back(new_column_length);\n }\n\n assert(new_column_offsets.size() == old_column_ids.size());\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy all values in the tuple to the physical tile\n \/\/ This uses fast getter and setter functions\n for (oid_t old_tuple_id : *source_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n oid_t col_itr = 0;\n\n for (oid_t old_col_id : old_column_position_idxs) {\n\n auto& column_position_list = column_position_lists[old_col_id];\n\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n\n auto value = old_tiles[col_itr]->GetValueFast(base_tuple_id,\n old_column_offsets[col_itr],\n old_column_types[col_itr],\n old_is_inlineds[col_itr]);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offsets[col_itr],\n new_is_inlineds[col_itr],\n new_column_lengths[col_itr]);\n\n \/\/ Go to next column\n col_itr++;\n }\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n}\n\nvoid MaterializeColumnAtATime(LogicalTile *source_tile,\n const std::unordered_map<oid_t, oid_t> &old_to_new_cols,\n const std::unordered_map<storage::Tile *, std::vector<oid_t>> &tile_to_cols,\n storage::Tile *dest_tile) {\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH PHYSICAL TILE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Copy over all data from each base tile.\n for (const auto &kv : tile_to_cols) {\n const std::vector<oid_t> &old_column_ids = kv.second;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH COLUMN\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Go over each column in given base physical tile\n for (oid_t old_col_id : old_column_ids) {\n auto &column_info = source_tile->GetColumnInfo(old_col_id);\n\n \/\/ Amortize schema lookups once per column\n storage::Tile *old_tile = column_info.base_tile;\n auto old_schema = old_tile->GetSchema();\n\n \/\/ Get old column information\n oid_t old_column_id = column_info.origin_column_id;\n const size_t old_column_offset = old_schema->GetOffset(old_column_id);\n const ValueType old_column_type = old_schema->GetType(old_column_id);\n const bool old_is_inlined = old_schema->IsInlined(old_column_id);\n\n \/\/ Old to new column mapping\n auto it = old_to_new_cols.find(old_col_id);\n assert(it != old_to_new_cols.end());\n\n \/\/ Get new column information\n oid_t new_column_id = it->second;\n auto new_schema = dest_tile->GetSchema();\n const size_t new_column_offset = new_schema->GetOffset(new_column_id);\n const bool new_is_inlined = new_schema->IsInlined(new_column_id);\n const size_t new_column_length = new_schema->GetAppropriateLength(new_column_id);\n\n \/\/ Get the position list\n auto& column_position_list = source_tile->GetPositionList(column_info.position_list_idx);\n oid_t new_tuple_id = 0;\n\n \/\/ Copy all values in the column to the physical tile\n \/\/ This uses fast getter and setter functions\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ EACH TUPLE\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (oid_t old_tuple_id : *source_tile) {\n oid_t base_tuple_id = column_position_list[old_tuple_id];\n auto value = old_tile->GetValueFast(base_tuple_id,\n old_column_offset,\n old_column_type,\n old_is_inlined);\n\n LOG_TRACE(\"Old Tuple : %u Column : %u \\n\", old_tuple_id, old_col_id);\n LOG_TRACE(\"New Tuple : %u Column : %u \\n\", new_tuple_id, new_column_id);\n\n dest_tile->SetValueFast(value, new_tuple_id,\n new_column_offset,\n new_is_inlined,\n new_column_length);\n\n \/\/ Go to next tuple\n new_tuple_id++;\n }\n\n }\n\n }\n\n}\n\nstd::unordered_map<oid_t, oid_t> MaterializationExecutor::BuildIdentityMapping(\n const catalog::Schema *schema) {\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n oid_t column_count = schema->GetColumnCount();\n for (oid_t col = 0; col < column_count; col++) {\n old_to_new_cols[col] = col;\n }\n\n return old_to_new_cols;\n}\n\n\/**\n * @brief Create a physical tile for the given logical tile\n * @param source_tile Source tile from which the physical tile is created\n * @return a logical tile wrapper for the created physical tile\n *\/\nLogicalTile *MaterializationExecutor::Physify(LogicalTile *source_tile) {\n std::unique_ptr<catalog::Schema> source_tile_schema(\n source_tile->GetPhysicalSchema());\n const int num_tuples = source_tile->GetTupleCount();\n const catalog::Schema *output_schema;\n std::unordered_map<oid_t, oid_t> old_to_new_cols;\n auto node = GetRawNode();\n\n \/\/ Create a default identity mapping node if we did not get one\n if (node == nullptr) {\n assert(source_tile_schema.get());\n output_schema = source_tile_schema.get();\n\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n \/\/ Else use the mapping in the given plan node\n else {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n if (node.GetSchema()) {\n output_schema = node.GetSchema();\n old_to_new_cols = node.old_to_new_cols();\n } else {\n output_schema = source_tile_schema.get();\n old_to_new_cols = BuildIdentityMapping(output_schema);\n }\n }\n\n \/\/ Generate mappings.\n std::unordered_map<storage::Tile *, std::vector<oid_t>> tile_to_cols;\n GenerateTileToColMap(old_to_new_cols, source_tile, tile_to_cols);\n\n \/\/ Create new physical tile.\n std::unique_ptr<storage::Tile> dest_tile(\n storage::TileFactory::GetTempTile(*output_schema, num_tuples));\n\n \/\/ Proceed to materialize logical tile by physical tile at a time.\n MaterializeByTiles(source_tile, old_to_new_cols, tile_to_cols,\n dest_tile.get());\n\n bool own_base_tile = true;\n\n \/\/ Wrap physical tile in logical tile.\n return LogicalTileFactory::WrapTiles({dest_tile.release()}, own_base_tile);\n}\n\n\/**\n * @brief Creates materialized physical tile from logical tile and wraps it\n * in a new logical tile.\n *\n * @return true on success, false otherwise.\n *\/\nbool MaterializationExecutor::DExecute() {\n \/\/ Retrieve child tile.\n const bool success = children_[0]->Execute();\n if (!success) {\n return false;\n }\n\n std::unique_ptr<LogicalTile> source_tile(children_[0]->GetOutput());\n LogicalTile *output_tile = nullptr;\n\n \/\/ Check the number of tuples in input logical tile\n \/\/ If none, then just return false\n const int num_tuples = source_tile->GetTupleCount();\n if (num_tuples == 0) {\n return false;\n }\n\n auto node = GetRawNode();\n bool physify_flag = true; \/\/ by default, we create a physical tile\n\n if (node != nullptr) {\n const planner::MaterializationPlan &node =\n GetPlanNode<planner::MaterializationPlan>();\n physify_flag = node.GetPhysifyFlag();\n }\n\n if (physify_flag) {\n \/* create a physical tile and a logical tile wrapper to be the output *\/\n output_tile = Physify(source_tile.get());\n } else {\n \/* just pass thru the underlying logical tile *\/\n output_tile = source_tile.release();\n }\n\n SetOutput(output_tile);\n\n return true;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GlosmViewer.hh\"\n\n#include <SDL\/SDL.h>\n#include <SDL\/SDL_keysym.h>\n\n#if defined(WITH_GLES)\n#\tinclude <GLES\/gl.h>\n#\tinclude <SDL_gles.h>\n#else\n#\tif defined(__APPLE__)\n#\t\tinclude <OpenGL\/gl.h>\n#\telse\n#\t\tinclude <GL\/gl.h>\n#\tendif\n#\tinclude <SDL\/SDL_opengl.h>\n#endif\n\n#include <cstdio>\n\nclass GlosmViewerImpl : public GlosmViewer {\nprotected:\n\tbool ignoremouse_;\n\npublic:\n\tGlosmViewerImpl() : ignoremouse_(true) {\n\t}\n\n\tvirtual void MouseMove(int x, int y) {\n\t\tif (!ignoremouse_)\n\t\t\tGlosmViewer::MouseMove(x, y);\n\t}\n\nprotected:\n\tvirtual void WarpCursor(int x, int y) {\n\t\tignoremouse_ = true;\n\t\tSDL_WarpMouse(x, y);\n\t\tignoremouse_ = false;\n\t}\n\n\tvirtual void Flip() {\n#if defined(WITH_GLES)\n\t\tSDL_GLES_SwapBuffers();\n#else\n\t\tSDL_GL_SwapBuffers();\n#endif\n\t}\n};\n\n#if defined(WITH_GLES)\nSDL_GLES_Context* gles_context = 0;\n#endif\n\nGlosmViewerImpl app;\n\nvoid Reshape(int w, int h) {\n#if !defined(WITH_GLES)\n\tSDL_SetVideoMode(w, h, 0, SDL_OPENGL | SDL_RESIZABLE | SDL_HWSURFACE);\n#endif\n\n\tapp.Resize(w, h);\n}\n\nvoid KeyDown(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyDown(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyDown(GlosmViewer::UP); break;\n\t\tcase SDLK_DOWN: app.KeyDown(GlosmViewer::DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyDown(GlosmViewer::LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyDown(GlosmViewer::RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyDown('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyDown('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyDown(GlosmViewer::SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyDown(GlosmViewer::CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid KeyUp(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyUp(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyUp(GlosmViewer::UP); break;\n\t\tcase SDLK_DOWN: app.KeyUp(GlosmViewer::DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyUp(GlosmViewer::LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyUp(GlosmViewer::RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyUp('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyUp('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyUp(GlosmViewer::SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyUp(GlosmViewer::CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid Cleanup() {\n#if defined(WITH_GLES)\n\tif (gles_context)\n\t\tSDL_GLES_DeleteContext(gles_context);\n#endif\n\tSDL_Quit();\n}\n\nint GetEvents() {\n\tSDL_Event event;\n\n\twhile (SDL_PollEvent(&event)) {\n\t\tint ret = 1;\n\t\tswitch(event.type) {\n\t\tcase SDL_QUIT:\n\t\t\treturn 0;\n\t\tcase SDL_KEYDOWN:\n\t\t\tKeyDown(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_KEYUP:\n\t\t\tKeyUp(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEMOTION:\n\t\t\tapp.MouseMove(event.motion.x, event.motion.y);\n\t\t\tbreak;\n\t\tcase SDL_VIDEORESIZE:\n\t\t\tReshape(event.resize.w, event.resize.h);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (ret == 0)\n\t\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\nint real_main(int argc, char** argv) {\n\tapp.Init(argc, argv);\n\n\t\/* glut init *\/\n\tif (SDL_Init(SDL_INIT_VIDEO) != 0)\n\t\tthrow Exception() << \"Couldn't initialize SDL: \" << (const char*)SDL_GetError();\n\n\tatexit(Cleanup);\n\n#if !defined(WITH_GLES)\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 1);\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4);\n\tSDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n\tReshape(800, 600);\n#else\n\t\/* Using fixed resolution for N900\n\t * it should be detected on the fly instead *\/\n\tSDL_SetVideoMode(800, 480, 0, SDL_SWSURFACE | SDL_FULLSCREEN);\n\n\tSDL_GLES_Init(SDL_GLES_VERSION_1_1);\n\n\tgles_context = SDL_GLES_CreateContext();\n\n\tSDL_GLES_MakeCurrent(gles_context);\n\n\tReshape(800, 480);\n#endif\n\n\tSDL_ShowCursor(SDL_DISABLE);\n\tSDL_EnableKeyRepeat(0, 0);\n\n\tapp.InitGL();\n\n\t\/* main loop *\/\n\twhile (GetEvents())\n\t\tapp.Render();\n\n\treturn 0;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\treturn real_main(argc, argv);\n\t} catch (std::exception &e) {\n\t\tfprintf(stderr, \"Exception: %s\\n\", e.what());\n\t} catch (...) {\n\t\tfprintf(stderr, \"Unknown exception\\n\");\n\t}\n\n\treturn 1;\n}\n<commit_msg>Enable depth buffer<commit_after>\/*\n * Copyright (C) 2010-2011 Dmitry Marakasov\n *\n * This file is part of glosm.\n *\n * glosm is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * glosm is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with glosm. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GlosmViewer.hh\"\n\n#include <SDL\/SDL.h>\n#include <SDL\/SDL_keysym.h>\n\n#if defined(WITH_GLES)\n#\tinclude <GLES\/gl.h>\n#\tinclude <SDL_gles.h>\n#else\n#\tif defined(__APPLE__)\n#\t\tinclude <OpenGL\/gl.h>\n#\telse\n#\t\tinclude <GL\/gl.h>\n#\tendif\n#\tinclude <SDL\/SDL_opengl.h>\n#endif\n\n#include <cstdio>\n\nclass GlosmViewerImpl : public GlosmViewer {\nprotected:\n\tbool ignoremouse_;\n\npublic:\n\tGlosmViewerImpl() : ignoremouse_(true) {\n\t}\n\n\tvirtual void MouseMove(int x, int y) {\n\t\tif (!ignoremouse_)\n\t\t\tGlosmViewer::MouseMove(x, y);\n\t}\n\nprotected:\n\tvirtual void WarpCursor(int x, int y) {\n\t\tignoremouse_ = true;\n\t\tSDL_WarpMouse(x, y);\n\t\tignoremouse_ = false;\n\t}\n\n\tvirtual void Flip() {\n#if defined(WITH_GLES)\n\t\tSDL_GLES_SwapBuffers();\n#else\n\t\tSDL_GL_SwapBuffers();\n#endif\n\t}\n};\n\n#if defined(WITH_GLES)\nSDL_GLES_Context* gles_context = 0;\n#endif\n\nGlosmViewerImpl app;\n\nvoid Reshape(int w, int h) {\n#if !defined(WITH_GLES)\n\tSDL_SetVideoMode(w, h, 0, SDL_OPENGL | SDL_RESIZABLE | SDL_HWSURFACE);\n#endif\n\n\tapp.Resize(w, h);\n}\n\nvoid KeyDown(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyDown(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyDown(GlosmViewer::UP); break;\n\t\tcase SDLK_DOWN: app.KeyDown(GlosmViewer::DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyDown(GlosmViewer::LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyDown(GlosmViewer::RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyDown('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyDown('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyDown(GlosmViewer::SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyDown(GlosmViewer::CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid KeyUp(SDLKey key) {\n\tif (key < 0x100)\n\t\tapp.KeyUp(key);\n\telse\n\t\tswitch(key) {\n\t\tcase SDLK_UP: app.KeyUp(GlosmViewer::UP); break;\n\t\tcase SDLK_DOWN: app.KeyUp(GlosmViewer::DOWN); break;\n\t\tcase SDLK_LEFT: app.KeyUp(GlosmViewer::LEFT); break;\n\t\tcase SDLK_RIGHT: app.KeyUp(GlosmViewer::RIGHT); break;\n\t\tcase SDLK_KP_PLUS: app.KeyUp('+'); break;\n\t\tcase SDLK_KP_MINUS: app.KeyUp('-'); break;\n\t\tcase SDLK_LSHIFT: case SDLK_RSHIFT: app.KeyUp(GlosmViewer::SHIFT); break;\n\t\tcase SDLK_LCTRL: case SDLK_RCTRL: app.KeyUp(GlosmViewer::CTRL); break;\n\t\tdefault: break;\n\t\t}\n}\n\nvoid Cleanup() {\n#if defined(WITH_GLES)\n\tif (gles_context)\n\t\tSDL_GLES_DeleteContext(gles_context);\n#endif\n\tSDL_Quit();\n}\n\nint GetEvents() {\n\tSDL_Event event;\n\n\twhile (SDL_PollEvent(&event)) {\n\t\tint ret = 1;\n\t\tswitch(event.type) {\n\t\tcase SDL_QUIT:\n\t\t\treturn 0;\n\t\tcase SDL_KEYDOWN:\n\t\t\tKeyDown(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_KEYUP:\n\t\t\tKeyUp(event.key.keysym.sym);\n\t\t\tbreak;\n\t\tcase SDL_MOUSEMOTION:\n\t\t\tapp.MouseMove(event.motion.x, event.motion.y);\n\t\t\tbreak;\n\t\tcase SDL_VIDEORESIZE:\n\t\t\tReshape(event.resize.w, event.resize.h);\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\n\t\tif (ret == 0)\n\t\t\treturn 0;\n\t}\n\n\treturn 1;\n}\n\nint real_main(int argc, char** argv) {\n\tapp.Init(argc, argv);\n\n\t\/* glut init *\/\n\tif (SDL_Init(SDL_INIT_VIDEO) != 0)\n\t\tthrow Exception() << \"Couldn't initialize SDL: \" << (const char*)SDL_GetError();\n\n\tatexit(Cleanup);\n\n#if !defined(WITH_GLES)\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLEBUFFERS, 1);\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 4);\n\tSDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);\n\n\tReshape(800, 600);\n#else\n\t\/* Using fixed resolution for N900\n\t * it should be detected on the fly instead *\/\n\tSDL_SetVideoMode(800, 480, 0, SDL_SWSURFACE | SDL_FULLSCREEN);\n\n\tSDL_GLES_Init(SDL_GLES_VERSION_1_1);\n\t\n\tSDL_GLES_SetAttribute(SDL_GLES_DEPTH_SIZE, 24);\n\n\tgles_context = SDL_GLES_CreateContext();\n\n\tSDL_GLES_MakeCurrent(gles_context);\n\n\tReshape(800, 480);\n#endif\n\n\tSDL_ShowCursor(SDL_DISABLE);\n\tSDL_EnableKeyRepeat(0, 0);\n\n\tapp.InitGL();\n\n\t\/* main loop *\/\n\twhile (GetEvents())\n\t\tapp.Render();\n\n\treturn 0;\n}\n\nint main(int argc, char** argv) {\n\ttry {\n\t\treturn real_main(argc, argv);\n\t} catch (std::exception &e) {\n\t\tfprintf(stderr, \"Exception: %s\\n\", e.what());\n\t} catch (...) {\n\t\tfprintf(stderr, \"Unknown exception\\n\");\n\t}\n\n\treturn 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014, The Monero Project\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without modification, are\n\/\/ permitted provided that the following conditions are met:\n\/\/ \n\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of\n\/\/ conditions and the following disclaimer.\n\/\/ \n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list\n\/\/ of conditions and the following disclaimer in the documentation and\/or other\n\/\/ materials provided with the distribution.\n\/\/ \n\/\/ 3. Neither the name of the copyright holder nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without specific\n\/\/ prior written permission.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY\n\/\/ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n\/\/ THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n\/\/ THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"include_base_utils.h\"\n#include \"common\/util.h\"\n#include \"warnings.h\"\n#include \"crypto\/crypto.h\"\n#include \"cryptonote_config.h\"\n#include \"cryptonote_core\/cryptonote_format_utils.h\"\n#include \"misc_language.h\"\n#include \"cryptonote_core\/blockchain_storage.h\"\n#include \"cryptonote_core\/blockchain_db.h\"\n#include \"cryptonote_core\/blockchain.h\"\n#include \"cryptonote_core\/BlockchainDB_impl\/db_lmdb.h\"\n#include \"cryptonote_core\/tx_pool.h\"\n#include <iostream>\n\nusing namespace cryptonote;\n\nstruct fake_core\n{\n tx_memory_pool m_pool;\n Blockchain dummy;\n\n blockchain_storage m_storage;\n\n\n fake_core() : m_pool(dummy), dummy(m_pool), m_storage(&m_pool)\n {\n boost::filesystem::path default_data_path {tools::get_default_data_dir()};\n m_pool.init(default_data_path.string());\n m_storage.init(default_data_path.string(), false);\n }\n};\n\nint main(int argc, char* argv[])\n{\n fake_core c;\n boost::filesystem::path default_data_path {tools::get_default_data_dir()};\n\n BlockchainDB *blockchain;\n\n blockchain = new BlockchainLMDB();\n\n blockchain->open(default_data_path.string());\n\n for (uint64_t i = 0; i < c.m_storage.get_current_blockchain_height(); ++i)\n {\n if (i % 10 == 0) std::cout << \"block \" << i << std::endl;\n block b = c.m_storage.get_block(i);\n size_t bsize = c.m_storage.get_block_size(i);\n difficulty_type bdiff = c.m_storage.get_block_cumulative_difficulty(i);\n uint64_t bcoins = c.m_storage.get_block_coins_generated(i);\n std::vector<transaction> txs;\n std::vector<crypto::hash> missed;\n\n c.m_storage.get_transactions(b.tx_hashes, txs, missed);\n if (missed.size())\n {\n std::cerr << \"Missed transaction(s) for block at height \" << i << \", exiting\" << std::endl;\n delete blockchain;\n return 1;\n }\n\n try\n {\n blockchain->add_block(b, bsize, bdiff, bcoins, txs);\n }\n catch (const std::exception& e)\n {\n std::cerr << \"Error adding block to new blockchain: \" << e.what() << std::endl;\n delete blockchain;\n return 2;\n }\n }\n\n return 0;\n}\n<commit_msg>blockchain_converter: delete blockchain on succesful exit<commit_after>\/\/ Copyright (c) 2014, The Monero Project\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without modification, are\n\/\/ permitted provided that the following conditions are met:\n\/\/ \n\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of\n\/\/ conditions and the following disclaimer.\n\/\/ \n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list\n\/\/ of conditions and the following disclaimer in the documentation and\/or other\n\/\/ materials provided with the distribution.\n\/\/ \n\/\/ 3. Neither the name of the copyright holder nor the names of its contributors may be\n\/\/ used to endorse or promote products derived from this software without specific\n\/\/ prior written permission.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY\n\/\/ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\/\/ MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL\n\/\/ THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF\n\/\/ THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"include_base_utils.h\"\n#include \"common\/util.h\"\n#include \"warnings.h\"\n#include \"crypto\/crypto.h\"\n#include \"cryptonote_config.h\"\n#include \"cryptonote_core\/cryptonote_format_utils.h\"\n#include \"misc_language.h\"\n#include \"cryptonote_core\/blockchain_storage.h\"\n#include \"cryptonote_core\/blockchain_db.h\"\n#include \"cryptonote_core\/blockchain.h\"\n#include \"cryptonote_core\/BlockchainDB_impl\/db_lmdb.h\"\n#include \"cryptonote_core\/tx_pool.h\"\n#include <iostream>\n\nusing namespace cryptonote;\n\nstruct fake_core\n{\n tx_memory_pool m_pool;\n Blockchain dummy;\n\n blockchain_storage m_storage;\n\n\n fake_core() : m_pool(dummy), dummy(m_pool), m_storage(&m_pool)\n {\n boost::filesystem::path default_data_path {tools::get_default_data_dir()};\n m_pool.init(default_data_path.string());\n m_storage.init(default_data_path.string(), false);\n }\n};\n\nint main(int argc, char* argv[])\n{\n fake_core c;\n boost::filesystem::path default_data_path {tools::get_default_data_dir()};\n\n BlockchainDB *blockchain;\n\n blockchain = new BlockchainLMDB();\n\n blockchain->open(default_data_path.string());\n\n for (uint64_t i = 0; i < c.m_storage.get_current_blockchain_height(); ++i)\n {\n if (i % 10 == 0) std::cout << \"block \" << i << std::endl;\n block b = c.m_storage.get_block(i);\n size_t bsize = c.m_storage.get_block_size(i);\n difficulty_type bdiff = c.m_storage.get_block_cumulative_difficulty(i);\n uint64_t bcoins = c.m_storage.get_block_coins_generated(i);\n std::vector<transaction> txs;\n std::vector<crypto::hash> missed;\n\n c.m_storage.get_transactions(b.tx_hashes, txs, missed);\n if (missed.size())\n {\n std::cerr << \"Missed transaction(s) for block at height \" << i << \", exiting\" << std::endl;\n delete blockchain;\n return 1;\n }\n\n try\n {\n blockchain->add_block(b, bsize, bdiff, bcoins, txs);\n }\n catch (const std::exception& e)\n {\n std::cerr << \"Error adding block to new blockchain: \" << e.what() << std::endl;\n delete blockchain;\n return 2;\n }\n }\n\n delete blockchain;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Game.hpp\"\n\nnamespace swift\n{\n\tconst std::string errorLog = \".\/data\/log.txt\";\n\tconst std::string defaultFontFile = \".\/data\/fonts\/DejaVuSansMono.ttf\";\n\t\n\tenum class GameState\n\t{\n\t\tPlay,\n\t\tMainMenu\n\t};\n\t\n\tGame::Game()\n\t\t:\tlogger(\"Alpha\", errorLog),\n\t\t\tconsole(500, 200, defaultFont, \"[swift2]:\")\n\t{\n\t\tgraphics = Quality::Medium;\n\t\tsmoothing = false;\n\t\tverticalSync = true;\n\t\tfullScreen = false;\n\t\tresolution.x = 800;\n\t\tresolution.y = 600;\n\t\trunning = false;\n\n\t\t\/\/ engine integral settings\n\t\tticksPerSecond = 60;\n\n\t\tdefaultFont.loadFromFile(defaultFontFile);\n\t}\n\n\tGame::~Game()\n\t{\n\t\tdelete currentState;\n\t\tcurrentState = nullptr;\n\t}\n\n\t\/\/ Do any pre-game data loading\n\t\/\/ Such as setting up the scripting virtual machine\n\t\/\/ and setting game quality settings.\n\t\/\/ That's about it\n\tvoid Game::Start(int c, char** args)\n\t{\n\t\t\/\/ c is the total arguments\n\t\t\/\/ args is the arguments\n\n\t\t\/\/ loads settings from the settings file\n\t\tloadSettings(\".\/data\/settings\/settings.ini\");\n\n\t\thandleLaunchOps(c, args);\n\n\t\t\/\/ Window set up.\n\t\tif(fullScreen)\n\t\t\twindow.create(sf::VideoMode(resolution.x, resolution.y, 32), \"Swift Engine\", sf::Style::Fullscreen, contextSettings);\n\t\telse\n\t\t\twindow.create(sf::VideoMode(resolution.x, resolution.y, 32), \"Swift Engine\", sf::Style::Titlebar | sf::Style::Close, contextSettings);\n\n\t\t\/\/window.setIcon(SwiftEngineIcon.width, SwiftEngineIcon.height, SwiftEngineIcon.pixel_data);\n\t\twindow.setVerticalSyncEnabled(verticalSync);\n\t\twindow.setKeyRepeatEnabled(false);\n\t\t\n\t\tassets.setSmooth(smoothing);\n\t\tassets.loadResourceFolder(\".\/data\/fonts\");\n\t\tassets.loadResourceFolder(\".\/data\/textures\");\n\t\tassets.loadResourceFolder(\".\/data\/music\");\n\t\tassets.loadResourceFolder(\".\/data\/scripts\");\n\t\tassets.loadResourceFolder(\".\/data\/skeletons\");\n\t\tassets.loadResourceFolder(\".\/data\/sounds\");\n\t\t\n\t\tmods.loadMods(\".\/data\/mods\");\n\t\t\n\t\tfor(auto &m : mods.getMods())\n\t\t{\n\t\t\tassets.loadMod(m.second.mod);\n\t\t}\n\n\t\t\/\/ add some default keybindings\n\t\tkeyboard.newBinding(\"toggleTerminal\", sf::Keyboard::BackSlash, [&]()\n\t\t{\n\t\t\tconsole.activate(!console.isActivated());\n\t\t});\n\n\t\tkeyboard.newBinding(\"exit\", sf::Keyboard::Escape, [&]()\n\t\t{\n\t\t\trunning = false;\n\t\t});\n\n\t\t\/\/ add some console commands\n\t\tconsole.addCommand(\"hello\", [](ArgVec args)\n\t\t{\n\t\t\treturn \"Hello to you too!\";\n\t\t});\n\t\t\n\t\tconsole.addCommand(\"exit\", [&](ArgVec args)\n\t\t{\n\t\t\trunning = false;\n\t\t\treturn \"Exiting\";\n\t\t});\n\n\t\trunning = true;\n\n\t\t\/\/ fps display\n\t\tif(debug)\n\t\t{\n\t\t\tFPS.setFont(defaultFont);\n\t\t\tFPS.setScale(0.7, 0.7);\n\t\t\tFPS.setString(\"00\");\n\t\t\tFPS.setPosition(window.getSize().x - (FPS.getGlobalBounds().width + 2), 0);\n\t\t}\n\t\t\n\t\t\/\/ setup Script static variables\n\t\tScript::setWindow(window);\n\t\t\n\t\t\/\/ state setup\t\t\n\t\tcurrentState = new MainMenu(window, assets, defaultFont);\n\t\tcurrentState->setup();\n\t\tcurrentState->switchTo();\n\t}\n\n\tvoid Game::GameLoop()\n\t{\n\t\tconst sf::Time dt = sf::seconds(1 \/ ticksPerSecond);\n\n\t\tsf::Time currentTime = GameTime.getElapsedTime();\n\t\tsf::Time lag = sf::seconds(0);\n\n\t\twhile(running)\n\t\t{\n\t\t\tsf::Time newTime = GameTime.getElapsedTime();\n\t\t\tsf::Time frameTime = newTime - currentTime;\n\n\t\t\tif(frameTime > sf::seconds(0.25))\n\t\t\t\tframeTime = sf::seconds(0.25);\n\n\t\t\tcurrentTime = newTime;\n\n\t\t\tlag += frameTime;\n\n\t\t\twhile(lag >= dt)\n\t\t\t{\n\t\t\t\tUpdate(dt);\n\t\t\t\tlag -= dt;\n\t\t\t}\n\n\t\t\tDraw(lag.asSeconds() \/ dt.asSeconds());\n\t\t}\n\t}\n\n\tvoid Game::Update(sf::Time dt)\n\t{\n\t\tsf::Event event;\n\t\twhile(window.pollEvent(event))\n\t\t{\n\t\t\tkeyboard(event);\n\t\t\tmouse(event);\n\n\t\t\t\/\/ avoid having the console type the key that toggles it\n\t\t\tif(event.type == sf::Event::TextEntered && event.text.unicode != '\\\\')\n\t\t\t\tconsole.update(event);\n\n\t\t\tif(event.type == sf::Event::Closed)\n\t\t\t\trunning = false;\n\t\t\t\t\n\t\t\tcurrentState->handleEvent(event);\n\t\t}\n\t\t\t\n\t\tif(debug)\n\t\t\tFPS.setString(std::to_string(1 \/ dt.asSeconds()).substr(0, 2));\n\t\t\n\t\tcurrentState->update(dt);\n\t}\n\t\n\tvoid Game::manageStates()\n\t{\n\t\t\n\t}\n\n\tvoid Game::Draw(float e)\n\t{\n\t\t\/* clear display *\/\n\t\twindow.clear();\n\n\t\t\/* state drawing *\/\n\t\tcurrentState->draw(e);\n\n\t\t\/* other drawing *\/\n\t\twindow.draw(console);\n\t\tif(debug)\n\t\t\twindow.draw(FPS);\n\n\t\t\/* display drawing *\/\n\t\twindow.display();\n\t}\n\n\t\/\/ Finish cleaning up memory, close cleanly, etc\n\tvoid Game::Finish()\n\t{\n\t\twindow.close();\n\t}\n\n\tvoid Game::handleLaunchOps(int c, char** args)\n\t{\n\t\t\/\/ launch options\n\t\teditor = false;\n\t\tdebug = false;\n\t\tfullScreen = false;\n\n\t\t\/\/ loop through options\n\t\tint arg = 1;\t\/\/ we skip arg 0 because arg 0 is the executable\n\t\twhile(arg < c)\n\t\t{\n\t\t\tif(args[arg] == std::string(\"editor\"))\n\t\t\t{\n\t\t\t\teditor = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"debug\"))\n\t\t\t{\n\t\t\t\tdebug = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"fullscreen\"))\n\t\t\t{\n\t\t\t\tfullScreen = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"res\"))\n\t\t\t{\n\t\t\t\tresolution.x = std::stoi(args[arg + 1]);\n\t\t\t\tresolution.y = std::stoi(args[arg + 1]);\n\t\t\t\targ += 2;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"videoModes\"))\n\t\t\t{\n\t\t\t\tlogger << Logger::LogType::INFO << \"Supported Fullscreen Video Modes:\";\n\n\t\t\t\tstd::vector<sf::VideoMode> modes = sf::VideoMode::getFullscreenModes();\n\t\t\t\tfor(std::size_t i = 0; i < modes.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tsf::VideoMode mode = modes[i];\n\t\t\t\t\tlogger \t<< Logger::LogType::INFO\n\t\t\t\t\t << \"Mode #\" + std::to_string(i) + \": \" + std::to_string(mode.width) + \"x\" + std::to_string(mode.height)\n\t\t\t\t\t + \" - \" + std::to_string(mode.bitsPerPixel) + \" bpp\";\n\t\t\t\t\t\/\/ ex: \"Mode #0: 1920x1080 - 32 bbp\"\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlogger << \"\\nUnknown launch option: \" + std::string(args[arg]) + '\\n';\n\t\t\t}\n\n\t\t\targ++;\n\t\t}\n\t}\n\n\tvoid Game::loadSettings(const std::string& file)\n\t{\n\t\t\/\/ settings file settings\n\t\tif(!settings.loadFile(file))\n\t\t\tlogger << Logger::LogType::WARNING << \"Could not open settings file, default settings will be used\\n\";\n\n\t\tsettings.get(\"quality\", graphics);\n\t\tsettings.get(\"fullScreen\", fullScreen);\n\t\tsettings.get(\"vertSync\", verticalSync);\n\t\tsettings.get(\"res.x\", resolution.x);\n\t\tsettings.get(\"res.y\", resolution.y);\n\t\tsettings.get(\"sound\", soundLevel);\n\t\tsettings.get(\"music\", musicLevel);\n\t}\n}\n<commit_msg>General Cleaning<commit_after>#include \"Game.hpp\"\n\nnamespace swift\n{\n\tconst std::string errorLog = \".\/data\/log.txt\";\n\tconst std::string defaultFontFile = \".\/data\/fonts\/DejaVuSansMono.ttf\";\n\n\tenum class GameState\n\t{\n\t Play,\n\t MainMenu\n\t};\n\n\tGame::Game()\n\t\t:\tlogger(\"Alpha\", errorLog),\n\t\t console(500, 200, defaultFont, \"[swift2]:\")\n\t{\n\t\tgraphics = Quality::Medium;\n\t\tsmoothing = false;\n\t\tverticalSync = true;\n\t\tfullScreen = false;\n\t\tresolution.x = 800;\n\t\tresolution.y = 600;\n\t\trunning = false;\n\n\t\t\/\/ engine integral settings\n\t\tticksPerSecond = 60;\n\n\t\tdefaultFont.loadFromFile(defaultFontFile);\n\t}\n\n\tGame::~Game()\n\t{\n\t\tif(currentState)\n\t\t\tdelete currentState;\n\t}\n\n\t\/\/ Do any pre-game data loading\n\t\/\/ Such as setting up the scripting virtual machine\n\t\/\/ and setting game quality settings.\n\t\/\/ That's about it\n\tvoid Game::Start(int c, char** args)\n\t{\n\t\t\/\/ c is the total arguments\n\t\t\/\/ args is the arguments\n\n\t\t\/\/ loads settings from the settings file\n\t\tloadSettings(\".\/data\/settings\/settings.ini\");\n\n\t\thandleLaunchOps(c, args);\n\n\t\t\/\/ Window set up.\n\t\tif(fullScreen)\n\t\t\twindow.create(sf::VideoMode(resolution.x, resolution.y, 32), \"Swift Engine\", sf::Style::Fullscreen, contextSettings);\n\t\telse\n\t\t\twindow.create(sf::VideoMode(resolution.x, resolution.y, 32), \"Swift Engine\", sf::Style::Titlebar | sf::Style::Close, contextSettings);\n\n\t\t\/\/window.setIcon(SwiftEngineIcon.width, SwiftEngineIcon.height, SwiftEngineIcon.pixel_data);\n\t\twindow.setVerticalSyncEnabled(verticalSync);\n\t\twindow.setKeyRepeatEnabled(false);\n\n\t\tassets.setSmooth(smoothing);\n\t\tassets.loadResourceFolder(\".\/data\/fonts\");\n\t\tassets.loadResourceFolder(\".\/data\/textures\");\n\t\tassets.loadResourceFolder(\".\/data\/music\");\n\t\tassets.loadResourceFolder(\".\/data\/scripts\");\n\t\tassets.loadResourceFolder(\".\/data\/skeletons\");\n\t\tassets.loadResourceFolder(\".\/data\/sounds\");\n\n\t\tmods.loadMods(\".\/data\/mods\");\n\n\t\tfor(auto &m : mods.getMods())\n\t\t{\n\t\t\tassets.loadMod(m.second.mod);\n\t\t}\n\n\t\t\/\/ add some default keybindings\n\t\tkeyboard.newBinding(\"toggleTerminal\", sf::Keyboard::BackSlash, [&]()\n\t\t{\n\t\t\tconsole.activate(!console.isActivated());\n\t\t});\n\n\t\tkeyboard.newBinding(\"exit\", sf::Keyboard::Escape, [&]()\n\t\t{\n\t\t\trunning = false;\n\t\t});\n\n\t\t\/\/ add some console commands\n\t\tconsole.addCommand(\"hello\", [](ArgVec args)\n\t\t{\n\t\t\treturn \"Hello to you too!\";\n\t\t});\n\n\t\tconsole.addCommand(\"exit\", [&](ArgVec args)\n\t\t{\n\t\t\trunning = false;\n\t\t\treturn \"Exiting\";\n\t\t});\n\n\t\trunning = true;\n\n\t\t\/\/ fps display\n\t\tif(debug)\n\t\t{\n\t\t\tFPS.setFont(defaultFont);\n\t\t\tFPS.setScale(0.7, 0.7);\n\t\t\tFPS.setString(\"00\");\n\t\t\tFPS.setPosition(window.getSize().x - (FPS.getGlobalBounds().width + 2), 0);\n\t\t}\n\n\t\t\/\/ setup Script static variables\n\t\tScript::setWindow(window);\n\n\t\t\/\/ state setup\n\t\tcurrentState = new MainMenu(window, assets);\n\t\tcurrentState->setup();\n\t}\n\n\tvoid Game::GameLoop()\n\t{\n\t\tconst sf::Time dt = sf::seconds(1 \/ ticksPerSecond);\n\n\t\tsf::Time currentTime = GameTime.getElapsedTime();\n\t\tsf::Time lag = sf::seconds(0);\n\n\t\twhile(running)\n\t\t{\n\t\t\tsf::Time newTime = GameTime.getElapsedTime();\n\t\t\tsf::Time frameTime = newTime - currentTime;\n\n\t\t\tif(frameTime > sf::seconds(0.25))\n\t\t\t\tframeTime = sf::seconds(0.25);\n\n\t\t\tcurrentTime = newTime;\n\n\t\t\tlag += frameTime;\n\n\t\t\twhile(lag >= dt)\n\t\t\t{\n\t\t\t\tUpdate(dt);\n\t\t\t\tlag -= dt;\n\t\t\t}\n\n\t\t\tDraw(lag.asSeconds() \/ dt.asSeconds());\n\t\t}\n\t}\n\n\tvoid Game::Update(sf::Time dt)\n\t{\n\t\tsf::Event event;\n\t\twhile(window.pollEvent(event))\n\t\t{\n\t\t\tkeyboard(event);\n\t\t\tmouse(event);\n\n\t\t\t\/\/ avoid having the console type the key that toggles it\n\t\t\tif(event.type == sf::Event::TextEntered && event.text.unicode != '\\\\')\n\t\t\t\tconsole.update(event);\n\n\t\t\tif(event.type == sf::Event::Closed)\n\t\t\t\trunning = false;\n\n\t\t\tcurrentState->handleEvent(event);\n\t\t}\n\n\t\tif(debug)\n\t\t\tFPS.setString(std::to_string(1 \/ dt.asSeconds()).substr(0, 2));\n\n\t\tcurrentState->update(dt);\n\t\tmanageStates();\n\t}\n\n\tvoid Game::manageStates()\n\t{\n\t\tif(currentState->switchFrom())\n\t\t{\n\t\t\tState::Type nextState = currentState->finish();\n\t\t\tdelete currentState;\n\t\t\tcurrentState = nullptr;\n\n\t\t\tswitch(nextState)\n\t\t\t{\n\t\t\t\tcase State::Type::MainMenu:\n\t\t\t\t\tcurrentState = new MainMenu(window, assets);\n\t\t\t\t\tcurrentState->setup();\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Play:\n\t\t\t\t\tcurrentState = new Play(window, assets);\n\t\t\t\t\tcurrentState->setup();\n\t\t\t\t\tbreak;\n\t\t\t\tcase State::Type::Exit:\n\t\t\t\t\trunning = false;\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tvoid Game::Draw(float e)\n\t{\n\t\tif(running)\n\t\t{\n\t\t\t\/* clear display *\/\n\t\t\twindow.clear();\n\n\t\t\t\/* state drawing *\/\n\t\t\tcurrentState->draw(e);\n\n\t\t\t\/* other drawing *\/\n\t\t\twindow.draw(console);\n\t\t\tif(debug)\n\t\t\t\twindow.draw(FPS);\n\n\t\t\t\/* display drawing *\/\n\t\t\twindow.display();\n\t\t}\n\t}\n\n\t\/\/ Finish cleaning up memory, close cleanly, etc\n\tvoid Game::Finish()\n\t{\n\t\twindow.close();\n\t}\n\n\tvoid Game::handleLaunchOps(int c, char** args)\n\t{\n\t\t\/\/ launch options\n\t\teditor = false;\n\t\tdebug = false;\n\t\tfullScreen = false;\n\n\t\t\/\/ loop through options\n\t\tint arg = 1;\t\/\/ we skip arg 0 because arg 0 is the executable\n\t\twhile(arg < c)\n\t\t{\n\t\t\tif(args[arg] == std::string(\"editor\"))\n\t\t\t{\n\t\t\t\teditor = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"debug\"))\n\t\t\t{\n\t\t\t\tdebug = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"fullscreen\"))\n\t\t\t{\n\t\t\t\tfullScreen = true;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"res\"))\n\t\t\t{\n\t\t\t\tresolution.x = std::stoi(args[arg + 1]);\n\t\t\t\tresolution.y = std::stoi(args[arg + 1]);\n\t\t\t\targ += 2;\n\t\t\t}\n\t\t\telse if(args[arg] == std::string(\"videoModes\"))\n\t\t\t{\n\t\t\t\tlogger << Logger::LogType::INFO << \"Supported Fullscreen Video Modes:\";\n\n\t\t\t\tstd::vector<sf::VideoMode> modes = sf::VideoMode::getFullscreenModes();\n\t\t\t\tfor(std::size_t i = 0; i < modes.size(); ++i)\n\t\t\t\t{\n\t\t\t\t\tsf::VideoMode mode = modes[i];\n\t\t\t\t\tlogger \t<< Logger::LogType::INFO\n\t\t\t\t\t << \"Mode #\" + std::to_string(i) + \": \" + std::to_string(mode.width) + \"x\" + std::to_string(mode.height)\n\t\t\t\t\t + \" - \" + std::to_string(mode.bitsPerPixel) + \" bpp\";\n\t\t\t\t\t\/\/ ex: \"Mode #0: 1920x1080 - 32 bbp\"\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tlogger << \"\\nUnknown launch option: \" + std::string(args[arg]) + '\\n';\n\t\t\t}\n\n\t\t\targ++;\n\t\t}\n\t}\n\n\tvoid Game::loadSettings(const std::string& file)\n\t{\n\t\t\/\/ settings file settings\n\t\tif(!settings.loadFile(file))\n\t\t\tlogger << Logger::LogType::WARNING << \"Could not open settings file, default settings will be used\\n\";\n\n\t\tsettings.get(\"quality\", graphics);\n\t\tsettings.get(\"fullScreen\", fullScreen);\n\t\tsettings.get(\"vertSync\", verticalSync);\n\t\tsettings.get(\"res.x\", resolution.x);\n\t\tsettings.get(\"res.y\", resolution.y);\n\t\tsettings.get(\"sound\", soundLevel);\n\t\tsettings.get(\"music\", musicLevel);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ ***************************************************************************\n\/\/ FastaIndex.cpp (c) 2010 Erik Garrison <erik.garrison@bc.edu>\n\/\/ Marth Lab, Department of Biology, Boston College\n\/\/ All rights reserved.\n\/\/ ---------------------------------------------------------------------------\n\/\/ Last modified: 9 February 2010 (EG)\n\/\/ ---------------------------------------------------------------------------\n\n#include \"Fasta.h\"\n\nFastaIndexEntry::FastaIndexEntry(string name, int length, long long offset, int line_blen, int line_len)\n : name(name)\n , length(length)\n , offset(offset)\n , line_blen(line_blen)\n , line_len(line_len)\n{}\n\nFastaIndexEntry::FastaIndexEntry(void) \/\/ empty constructor\n{ clear(); }\n\nFastaIndexEntry::~FastaIndexEntry(void)\n{}\n\nvoid FastaIndexEntry::clear(void)\n{\n name = \"\";\n length = NULL;\n offset = -1; \/\/ no real offset will ever be below 0, so this allows us to\n \/\/ check if we have already recorded a real offset\n line_blen = NULL;\n line_len = NULL;\n}\n\nostream& operator<<(ostream& output, const FastaIndexEntry& e) {\n \/\/ just write the first component of the name, for compliance with other tools\n output << split(e.name, ' ').at(0) << \"\\t\" << e.length << \"\\t\" << e.offset << \"\\t\" <<\n e.line_blen << \"\\t\" << e.line_len;\n return output; \/\/ for multiple << operators.\n}\n\nFastaIndex::FastaIndex(void) \n{}\n\nvoid FastaIndex::readIndexFile(string fname) {\n string line;\n long long linenum = 0;\n indexFile.open(fname.c_str(), ifstream::in);\n if (indexFile.is_open()) {\n while (getline (indexFile, line)) {\n ++linenum;\n \/\/ the fai format defined in samtools is tab-delimited, every line being:\n \/\/ fai->name[i], (int)x.len, (long long)x.offset, (int)x.line_blen, (int)x.line_len\n vector<string> fields = split(line, '\\t');\n if (fields.size() == 5) { \/\/ if we don't get enough fields then there is a problem with the file\n \/\/ note that fields[0] is the sequence name\n char* end;\n string name = split(fields[0], \" \\t\").at(0); \/\/ key by first token of name\n sequenceNames.push_back(name);\n this->insert(make_pair(name, FastaIndexEntry(fields[0], atoi(fields[1].c_str()),\n strtoll(fields[2].c_str(), &end, 10),\n atoi(fields[3].c_str()),\n atoi(fields[4].c_str()))));\n } else {\n cerr << \"Warning: malformed fasta index file \" << fname << \n \"does not have enough fields @ line \" << linenum << endl;\n cerr << line << endl;\n exit(1);\n }\n }\n } else {\n cerr << \"could not open index file \" << fname << endl;\n exit(1);\n }\n}\n\n\/\/ for consistency this should be a class method\nbool fastaIndexEntryCompare ( FastaIndexEntry a, FastaIndexEntry b) { return (a.offset<b.offset); }\n\nostream& operator<<(ostream& output, FastaIndex& fastaIndex) {\n vector<FastaIndexEntry> sortedIndex;\n for(vector<string>::const_iterator it = fastaIndex.sequenceNames.begin(); it != fastaIndex.sequenceNames.end(); ++it)\n {\n sortedIndex.push_back(fastaIndex[*it]);\n }\n sort(sortedIndex.begin(), sortedIndex.end(), fastaIndexEntryCompare);\n for( vector<FastaIndexEntry>::iterator fit = sortedIndex.begin(); fit != sortedIndex.end(); ++fit) {\n output << *fit << endl;\n }\n return output;\n}\n\nvoid FastaIndex::indexReference(string refname) {\n \/\/ overview:\n \/\/ for line in the reference fasta file\n \/\/ track byte offset from the start of the file\n \/\/ if line is a fasta header, take the name and dump the last sequnece to the index\n \/\/ if line is a sequence, add it to the current sequence\n \/\/cerr << \"indexing fasta reference \" << refname << endl;\n string line;\n FastaIndexEntry entry; \/\/ an entry buffer used in processing\n entry.clear();\n int line_length = 0;\n long long offset = 0; \/\/ byte offset from start of file\n long long line_number = 0; \/\/ current line number\n bool mismatchedLineLengths = false; \/\/ flag to indicate if our line length changes mid-file\n \/\/ this will be used to raise an error\n \/\/ if we have a line length change at\n \/\/ any line other than the last line in\n \/\/ the sequence\n bool emptyLine = false; \/\/ flag to catch empty lines, which we allow for\n \/\/ index generation only on the last line of the sequence\n ifstream refFile;\n refFile.open(refname.c_str());\n if (refFile.is_open()) {\n while (getline(refFile, line)) {\n ++line_number;\n line_length = line.length();\n if (line[0] == ';') {\n \/\/ fasta comment, skip\n } else if (line[0] == '+') {\n \/\/ fastq quality header\n getline(refFile, line);\n line_length = line.length();\n offset += line_length + 1;\n \/\/ get and don't handle the quality line\n getline(refFile, line);\n line_length = line.length();\n } else if (line[0] == '>' || line[0] == '@') { \/\/ fasta \/fastq header\n \/\/ if we aren't on the first entry, push the last sequence into the index\n if (entry.name != \"\") {\n mismatchedLineLengths = false; \/\/ reset line length error tracker for every new sequence\n emptyLine = false;\n flushEntryToIndex(entry);\n entry.clear();\n }\n entry.name = line.substr(1, line_length - 1);\n } else { \/\/ we assume we have found a sequence line\n if (entry.offset == -1) \/\/ NB initially the offset is -1\n entry.offset = offset;\n entry.length += line_length;\n if (entry.line_len) {\n \/\/entry.line_len = entry.line_len ? entry.line_len : line_length + 1;\n if (mismatchedLineLengths || emptyLine) {\n if (line_length == 0) {\n emptyLine = true; \/\/ flag empty lines, raise error only if this is embedded in the sequence\n } else {\n if (emptyLine) {\n cerr << \"ERROR: embedded newline\";\n } else {\n cerr << \"ERROR: mismatched line lengths\";\n }\n cerr << \" at line \" << line_number << \" within sequence \" << entry.name <<\n endl << \"File not suitable for fasta index generation.\" << endl;\n exit(1);\n }\n }\n \/\/ this flag is set here and checked on the next line\n \/\/ because we may have reached the end of the sequence, in\n \/\/ which case a mismatched line length is OK\n if (entry.line_len != line_length + 1) {\n mismatchedLineLengths = true;\n if (line_length == 0) {\n emptyLine = true; \/\/ flag empty lines, raise error only if this is embedded in the sequence\n }\n }\n } else {\n entry.line_len = line_length + 1; \/\/ first line\n }\n entry.line_blen = entry.line_len - 1;\n }\n offset += line_length + 1;\n }\n \/\/ we've hit the end of the fasta file!\n \/\/ flush the last entry\n flushEntryToIndex(entry);\n } else {\n cerr << \"could not open reference file \" << refname << \" for indexing!\" << endl;\n exit(1);\n }\n}\n\nvoid FastaIndex::flushEntryToIndex(FastaIndexEntry& entry) {\n string name = split(entry.name, \" \\t\").at(0); \/\/ key by first token of name\n sequenceNames.push_back(name);\n this->insert(make_pair(name, FastaIndexEntry(entry.name, entry.length,\n entry.offset, entry.line_blen,\n entry.line_len)));\n\n}\n\nvoid FastaIndex::writeIndexFile(string fname) {\n \/\/cerr << \"writing fasta index file \" << fname << endl;\n ofstream file;\n file.open(fname.c_str()); \n if (file.is_open()) {\n file << *this;\n } else { \n cerr << \"could not open index file \" << fname << \" for writing!\" << endl;\n exit(1);\n }\n}\n\nFastaIndex::~FastaIndex(void) {\n indexFile.close();\n}\n\nFastaIndexEntry FastaIndex::entry(string name) {\n FastaIndex::iterator e = this->find(name);\n if (e == this->end()) {\n cerr << \"unable to find FASTA index entry for '\" << name << \"'\" << endl;\n exit(1);\n } else {\n return e->second;\n }\n}\n\nstring FastaIndex::indexFileExtension() { return \".fai\"; }\n\nvoid FastaReference::open(string reffilename, bool usemmap) {\n filename = reffilename;\n if (!(file = fopen(filename.c_str(), \"r\"))) {\n cerr << \"could not open \" << filename << endl;\n exit(1);\n }\n index = new FastaIndex();\n struct stat stFileInfo; \n string indexFileName = filename + index->indexFileExtension(); \n \/\/ if we can find an index file, use it\n if(stat(indexFileName.c_str(), &stFileInfo) == 0) { \n index->readIndexFile(indexFileName);\n } else { \/\/ otherwise, read the reference and generate the index file in the cwd\n cerr << \"index file \" << indexFileName << \" not found, generating...\" << endl;\n index->indexReference(filename);\n index->writeIndexFile(indexFileName);\n }\n if (usemmap) {\n usingmmap = true;\n int fd = fileno(file);\n struct stat sb;\n if (fstat(fd, &sb) == -1)\n cerr << \"could not stat file\" << filename << endl;\n filesize = sb.st_size;\n \/\/ map the whole file\n filemm = mmap(NULL, filesize, PROT_READ, MAP_SHARED, fd, 0);\n }\n}\n\nFastaReference::~FastaReference(void) {\n fclose(file);\n if (usingmmap) {\n munmap(filemm, filesize);\n }\n delete index;\n}\n\nstring FastaReference::getSequence(string seqname) {\n FastaIndexEntry entry = index->entry(seqname);\n int newlines_in_sequence = entry.length \/ entry.line_blen;\n int seqlen = newlines_in_sequence + entry.length;\n char* seq = (char*) calloc (seqlen + 1, sizeof(char));\n if (usingmmap) {\n memcpy(seq, (char*) filemm + entry.offset, seqlen);\n } else {\n fseek64(file, entry.offset, SEEK_SET);\n fread(seq, sizeof(char), seqlen, file);\n }\n seq[seqlen] = '\\0';\n char* pbegin = seq;\n char* pend = seq + (seqlen\/sizeof(char));\n pend = remove(pbegin, pend, '\\n');\n pend = remove(pbegin, pend, '\\0');\n string s = seq;\n free(seq);\n s.resize((pend - pbegin)\/sizeof(char));\n return s;\n}\n\n\/\/ TODO cleanup; odd function. use a map\nstring FastaReference::sequenceNameStartingWith(string seqnameStart) {\n try {\n return (*index)[seqnameStart].name;\n } catch (exception& e) {\n cerr << e.what() << \": unable to find index entry for \" << seqnameStart << endl;\n exit(1);\n }\n}\n\nstring FastaReference::getSubSequence(string seqname, int start, int length) {\n FastaIndexEntry entry = index->entry(seqname);\n if (start < 0 || length < 1) {\n cerr << \"Error: cannot construct subsequence with negative offset or length < 1\" << endl;\n exit(1);\n }\n \/\/ we have to handle newlines\n \/\/ approach: count newlines before start\n \/\/ count newlines by end of read\n \/\/ subtracting newlines before start find count of embedded newlines\n int newlines_before = start > 0 ? (start - 1) \/ entry.line_blen : 0;\n int newlines_by_end = (start + length - 1) \/ entry.line_blen;\n int newlines_inside = newlines_by_end - newlines_before;\n int seqlen = length + newlines_inside;\n char* seq = (char*) calloc (seqlen + 1, sizeof(char));\n if (usingmmap) {\n memcpy(seq, (char*) filemm + entry.offset + newlines_before + start, seqlen);\n } else {\n fseek64(file, (off_t) (entry.offset + newlines_before + start), SEEK_SET);\n fread(seq, sizeof(char), (off_t) seqlen, file);\n }\n seq[seqlen] = '\\0';\n char* pbegin = seq;\n char* pend = seq + (seqlen\/sizeof(char));\n pend = remove(pbegin, pend, '\\n');\n pend = remove(pbegin, pend, '\\0');\n string s = seq;\n free(seq);\n s.resize((pend - pbegin)\/sizeof(char));\n return s;\n}\n\nlong unsigned int FastaReference::sequenceLength(string seqname) {\n FastaIndexEntry entry = index->entry(seqname);\n return entry.length;\n}\n\n<commit_msg>tweak to Fasta.cpp<commit_after>\/\/ ***************************************************************************\n\/\/ FastaIndex.cpp (c) 2010 Erik Garrison <erik.garrison@bc.edu>\n\/\/ Marth Lab, Department of Biology, Boston College\n\/\/ All rights reserved.\n\/\/ ---------------------------------------------------------------------------\n\/\/ Last modified: 9 February 2010 (EG)\n\/\/ ---------------------------------------------------------------------------\n\n#include \"Fasta.h\"\n\nFastaIndexEntry::FastaIndexEntry(string name, int length, long long offset, int line_blen, int line_len)\n : name(name)\n , length(length)\n , offset(offset)\n , line_blen(line_blen)\n , line_len(line_len)\n{}\n\nFastaIndexEntry::FastaIndexEntry(void) \/\/ empty constructor\n{ clear(); }\n\nFastaIndexEntry::~FastaIndexEntry(void)\n{}\n\nvoid FastaIndexEntry::clear(void)\n{\n name = \"\";\n length = NULL;\n offset = -1; \/\/ no real offset will ever be below 0, so this allows us to\n \/\/ check if we have already recorded a real offset\n line_blen = NULL;\n line_len = NULL;\n}\n\nostream& operator<<(ostream& output, const FastaIndexEntry& e) {\n \/\/ just write the first component of the name, for compliance with other tools\n output << split(e.name, ' ').at(0) << \"\\t\" << e.length << \"\\t\" << e.offset << \"\\t\" <<\n e.line_blen << \"\\t\" << e.line_len;\n return output; \/\/ for multiple << operators.\n}\n\nFastaIndex::FastaIndex(void) \n{}\n\nvoid FastaIndex::readIndexFile(string fname) {\n string line;\n long long linenum = 0;\n indexFile.open(fname.c_str(), ifstream::in);\n if (indexFile.is_open()) {\n while (getline (indexFile, line)) {\n ++linenum;\n \/\/ the fai format defined in samtools is tab-delimited, every line being:\n \/\/ fai->name[i], (int)x.len, (long long)x.offset, (int)x.line_blen, (int)x.line_len\n vector<string> fields = split(line, '\\t');\n if (fields.size() == 5) { \/\/ if we don't get enough fields then there is a problem with the file\n \/\/ note that fields[0] is the sequence name\n char* end;\n string name = split(fields[0], \" \\t\").at(0); \/\/ key by first token of name\n sequenceNames.push_back(name);\n this->insert(make_pair(name, FastaIndexEntry(fields[0], atoi(fields[1].c_str()),\n strtoll(fields[2].c_str(), &end, 10),\n atoi(fields[3].c_str()),\n atoi(fields[4].c_str()))));\n } else {\n cerr << \"Warning: malformed fasta index file \" << fname << \n \"does not have enough fields @ line \" << linenum << endl;\n cerr << line << endl;\n exit(1);\n }\n }\n } else {\n cerr << \"could not open index file \" << fname << endl;\n exit(1);\n }\n}\n\n\/\/ for consistency this should be a class method\nbool fastaIndexEntryCompare ( FastaIndexEntry a, FastaIndexEntry b) { return (a.offset<b.offset); }\n\nostream& operator<<(ostream& output, FastaIndex& fastaIndex) {\n vector<FastaIndexEntry> sortedIndex;\n for(vector<string>::const_iterator it = fastaIndex.sequenceNames.begin(); it != fastaIndex.sequenceNames.end(); ++it)\n {\n sortedIndex.push_back(fastaIndex[*it]);\n }\n sort(sortedIndex.begin(), sortedIndex.end(), fastaIndexEntryCompare);\n for( vector<FastaIndexEntry>::iterator fit = sortedIndex.begin(); fit != sortedIndex.end(); ++fit) {\n output << *fit << endl;\n }\n return output;\n}\n\nvoid FastaIndex::indexReference(string refname) {\n \/\/ overview:\n \/\/ for line in the reference fasta file\n \/\/ track byte offset from the start of the file\n \/\/ if line is a fasta header, take the name and dump the last sequnece to the index\n \/\/ if line is a sequence, add it to the current sequence\n \/\/cerr << \"indexing fasta reference \" << refname << endl;\n string line;\n FastaIndexEntry entry; \/\/ an entry buffer used in processing\n entry.clear();\n int line_length = 0;\n long long offset = 0; \/\/ byte offset from start of file\n long long line_number = 0; \/\/ current line number\n bool mismatchedLineLengths = false; \/\/ flag to indicate if our line length changes mid-file\n \/\/ this will be used to raise an error\n \/\/ if we have a line length change at\n \/\/ any line other than the last line in\n \/\/ the sequence\n bool emptyLine = false; \/\/ flag to catch empty lines, which we allow for\n \/\/ index generation only on the last line of the sequence\n ifstream refFile;\n refFile.open(refname.c_str());\n if (refFile.is_open()) {\n while (getline(refFile, line)) {\n ++line_number;\n line_length = line.length();\n if (line[0] == ';') {\n \/\/ fasta comment, skip\n } else if (line[0] == '+') {\n \/\/ fastq quality header\n getline(refFile, line);\n line_length = line.length();\n offset += line_length + 1;\n \/\/ get and don't handle the quality line\n getline(refFile, line);\n line_length = line.length();\n } else if (line[0] == '>' || line[0] == '@') { \/\/ fasta \/fastq header\n \/\/ if we aren't on the first entry, push the last sequence into the index\n if (entry.name != \"\") {\n mismatchedLineLengths = false; \/\/ reset line length error tracker for every new sequence\n emptyLine = false;\n flushEntryToIndex(entry);\n entry.clear();\n }\n entry.name = line.substr(1, line_length - 1);\n } else { \/\/ we assume we have found a sequence line\n if (entry.offset == -1) \/\/ NB initially the offset is -1\n entry.offset = offset;\n entry.length += line_length;\n if (entry.line_len) {\n \/\/entry.line_len = entry.line_len ? entry.line_len : line_length + 1;\n if (mismatchedLineLengths || emptyLine) {\n if (line_length == 0) {\n emptyLine = true; \/\/ flag empty lines, raise error only if this is embedded in the sequence\n } else {\n if (emptyLine) {\n cerr << \"ERROR: embedded newline\";\n } else {\n cerr << \"ERROR: mismatched line lengths\";\n }\n cerr << \" at line \" << line_number << \" within sequence \" << entry.name <<\n endl << \"File not suitable for fasta index generation.\" << endl;\n exit(1);\n }\n }\n \/\/ this flag is set here and checked on the next line\n \/\/ because we may have reached the end of the sequence, in\n \/\/ which case a mismatched line length is OK\n if (entry.line_len != line_length + 1) {\n mismatchedLineLengths = true;\n if (line_length == 0) {\n emptyLine = true; \/\/ flag empty lines, raise error only if this is embedded in the sequence\n }\n }\n } else {\n entry.line_len = line_length + 1; \/\/ first line\n }\n entry.line_blen = entry.line_len - 1;\n }\n offset += line_length + 1;\n }\n \/\/ we've hit the end of the fasta file!\n \/\/ flush the last entry\n flushEntryToIndex(entry);\n } else {\n cerr << \"could not open reference file \" << refname << \" for indexing!\" << endl;\n exit(1);\n }\n}\n\nvoid FastaIndex::flushEntryToIndex(FastaIndexEntry& entry) {\n string name = split(entry.name, \" \\t\").at(0); \/\/ key by first token of name\n sequenceNames.push_back(name);\n this->insert(make_pair(name, FastaIndexEntry(entry.name, entry.length,\n entry.offset, entry.line_blen,\n entry.line_len)));\n\n}\n\nvoid FastaIndex::writeIndexFile(string fname) {\n \/\/cerr << \"writing fasta index file \" << fname << endl;\n ofstream file;\n file.open(fname.c_str()); \n if (file.is_open()) {\n file << *this;\n } else { \n cerr << \"could not open index file \" << fname << \" for writing!\" << endl;\n exit(1);\n }\n}\n\nFastaIndex::~FastaIndex(void) {\n indexFile.close();\n}\n\nFastaIndexEntry FastaIndex::entry(string name) {\n FastaIndex::iterator e = this->find(name);\n if (e == this->end()) {\n cerr << \"unable to find FASTA index entry for '\" << name << \"'\" << endl;\n exit(1);\n } else {\n return e->second;\n }\n}\n\nstring FastaIndex::indexFileExtension() { return \".fai\"; }\n\nvoid FastaReference::open(string reffilename, bool usemmap) {\n filename = reffilename;\n if (!(file = fopen(filename.c_str(), \"r\"))) {\n cerr << \"could not open \" << filename << endl;\n exit(1);\n }\n index = new FastaIndex();\n struct stat stFileInfo; \n string indexFileName = filename + index->indexFileExtension(); \n \/\/ if we can find an index file, use it\n if(stat(indexFileName.c_str(), &stFileInfo) == 0) { \n index->readIndexFile(indexFileName);\n } else { \/\/ otherwise, read the reference and generate the index file in the cwd\n cerr << \"index file \" << indexFileName << \" not found, generating...\" << endl;\n index->indexReference(filename);\n index->writeIndexFile(indexFileName);\n }\n if (usemmap) {\n usingmmap = true;\n int fd = fileno(file);\n struct stat sb;\n if (fstat(fd, &sb) == -1)\n cerr << \"could not stat file\" << filename << endl;\n filesize = sb.st_size;\n \/\/ map the whole file\n filemm = mmap(NULL, filesize, PROT_READ, MAP_SHARED, fd, 0);\n }\n}\n\nFastaReference::~FastaReference(void) {\n fclose(file);\n if (usingmmap) {\n munmap(filemm, filesize);\n }\n delete index;\n}\n\nstring FastaReference::getSequence(string seqname) {\n FastaIndexEntry entry = index->entry(seqname);\n int newlines_in_sequence = entry.length \/ entry.line_blen;\n int seqlen = newlines_in_sequence + entry.length;\n char* seq = (char*) calloc (seqlen + 1, sizeof(char));\n if (usingmmap) {\n memcpy(seq, (char*) filemm + entry.offset, seqlen);\n } else {\n fseek64(file, entry.offset, SEEK_SET);\n fread(seq, sizeof(char), seqlen, file);\n }\n seq[seqlen] = '\\0';\n char* pbegin = seq;\n char* pend = seq + (seqlen\/sizeof(char));\n pend = remove(pbegin, pend, '\\n');\n pend = remove(pbegin, pend, '\\0');\n string s = seq;\n free(seq);\n s.resize((pend - pbegin)\/sizeof(char));\n return s;\n}\n\n\/\/ TODO cleanup; odd function. use a map\nstring FastaReference::sequenceNameStartingWith(string seqnameStart) {\n try {\n return (*index)[seqnameStart].name;\n } catch (exception& e) {\n cerr << e.what() << \": unable to find index entry for \" << seqnameStart << endl;\n exit(1);\n }\n}\n\nstring FastaReference::getSubSequence(string seqname, int start, int length) {\n FastaIndexEntry entry = index->entry(seqname);\n if (start < 0 || length < 1) {\n cerr << \"Error: cannot construct subsequence with negative offset or length < 1\" << endl;\n exit(1);\n }\n \/\/ we have to handle newlines\n \/\/ approach: count newlines before start\n \/\/ count newlines by end of read\n \/\/ subtracting newlines before start find count of embedded newlines\n int newlines_before = start > 0 ? (start - 1) \/ entry.line_blen : 0;\n int newlines_by_end = (start + length - 1) \/ entry.line_blen;\n int newlines_inside = newlines_by_end - newlines_before;\n int seqlen = length + newlines_inside;\n char* seq = (char*) calloc (seqlen + 1, sizeof(char));\n if (usingmmap) {\n memcpy(seq, (char*) filemm + entry.offset + newlines_before + start, seqlen);\n } else {\n fseek64(file, (off_t) (entry.offset + newlines_before + start), SEEK_SET);\n fread(seq, sizeof(char), (off_t) seqlen, file);\n }\n seq[seqlen] = '\\0';\n char* pbegin = seq;\n char* pend = seq + (seqlen\/sizeof(char));\n pend = remove(pbegin, pend, '\\n');\n pend = remove(pbegin, pend, '\\0');\n string s = seq;\n free(seq);\n s.resize((pend - pbegin)\/sizeof(char));\n return s;\n}\n\nlong unsigned int FastaReference::sequenceLength(string seqname) {\n FastaIndexEntry entry = index->entry(seqname);\n return entry.length;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"config.h\"\n\n#include \"util.h\"\n#include <errno.h>\n#include <string>\n#include <cstdlib>\n#include <time.h>\n#include <librdkafka\/rdkafkacpp.h>\n#include \"BroString.h\"\n#include \"threading\/SerialTypes.h\"\n#include \"Kafka.h\"\n#include \"kafkawriter.bif.h\"\n\nusing namespace logging;\nusing namespace writer;\nusing threading::Value;\nusing threading::Field;\nusing namespace RdKafka;\n\n\nclass RandomPartitionerCallback : public RdKafka::PartitionerCb {\nprivate:\n\tunsigned int seed;\n\npublic:\n\tint32_t partitioner_cb(const RdKafka::Topic *topic, const std::string *key,\n\t\t\t\t\t\t\tint32_t partition_count, void *msg_opaque)\n\t{\n\t\treturn (int32_t)rand_r(&seed) % partition_count;\n\t}\n\n\tRandomPartitionerCallback(){\n\t\tseed = time(NULL);\n\t}\n};\n\n\nKafkaWriter::KafkaWriter(WriterFrontend* frontend) : WriterBackend(frontend) \n{\n\n\tjson_formatter = 0;\n\t\/\/srand(time(NULL));\n\tproducer = NULL;\n\ttopic = NULL;\n\n\t\n\t\/\/ initialize kafka variables...\n\tbroker_name_len = BifConst::KafkaLogger::broker_name->Len();\n\tbroker_name = new char[broker_name_len + 1];\n\tmemcpy(broker_name, BifConst::KafkaLogger::broker_name->Bytes(), broker_name_len);\n\tbroker_name[broker_name_len] = 0;\n\n topic_name_len = BifConst::KafkaLogger::topic_name->Len();\n topic_name = new char[topic_name_len + 1];\n memcpy(topic_name, BifConst::KafkaLogger::topic_name->Bytes(), topic_name_len);\n topic_name[topic_name_len] = 0;\n\n compression_codec_len = BifConst::KafkaLogger::compression_codec->Len();\n compression_codec = new char[compression_codec_len + 1];\n memcpy(compression_codec, BifConst::KafkaLogger::compression_codec->Bytes(), compression_codec_len);\n compression_codec[compression_codec_len] = 0;\n \n \/\/ initialize varibles used to store extra data appended to every message\n \/\/ (sensor name and log type)\n int sensor_name_len = BifConst::KafkaLogger::sensor_name->Len();\n char* sensor_name = new char[sensor_name_len + 1];\n memcpy(sensor_name, BifConst::KafkaLogger::sensor_name->Bytes(), sensor_name_len);\n sensor_name[sensor_name_len] = 0;\n\n int type_name_len = strlen(Info().path);\n char* type_name = new char[type_name_len + 1];\n memcpy(type_name, Info().path, type_name_len);\n type_name[type_name_len] = 0;\n\n client_id_len = BifConst::KafkaLogger::client_id->Len() + strlen(Info().path) + 1;\n client_id = new char[client_id_len + 1];\n memcpy(client_id, BifConst::KafkaLogger::client_id->Bytes(), client_id_len);\n strcat(client_id, \"-\");\n strcat(client_id, type_name);\n client_id[client_id_len] = 0;\n\n json_formatter = new threading::formatter::AddingJSON(this,\n \t\t\t\t\t\t\t\tthreading::formatter::AddingJSON::TS_MILLIS,\n \t\t\t\t\t\t\t\tsensor_name,\n \t\t\t\t\t\t\t\ttype_name,\n \t\t\t\t\t\t\t\tBifConst::KafkaLogger::logstash_style_timestamp\n \t\t\t\t\t\t\t );\n}\n\nKafkaWriter::~KafkaWriter()\n{\n delete [] broker_name;\n delete [] topic_name;\n delete [] client_id;\n delete [] compression_codec;\n delete [] fixed_fields;\n \/\/ I think I need to shut down the connection to the producer before deleting\n \/\/ these variables. Also, if I just blindly delete these two, bro segfaults when\n \/\/ shutting down. Confess I don't understand what's happening here.\n \/\/delete producer;\n \/\/delete topic;\n delete json_formatter;\n}\n\n\nthreading::Field** KafkaWriter::MakeFields(const threading::Field* const* fields, int num_fields, std::string path){\n\t\/\/ create the renamed fields, based on user-supplied config.\n\tthreading::Field** newFields = (threading::Field**)malloc(sizeof(threading::Field*) * (num_fields));\n\n\t\/\/ what I'd like to do is\n\t\/\/ first, grab the rename table for just this log\n\t\/\/ The config will have a table of table of strings.\n\t\/\/ the first table key is the name of the log (dns, http, etc)\n\t\/\/ the internal table key is the column name, the internal table value\n\t\/\/ will be the name to change that to.\n\t\/\/ loop over the existing fields, look up the field name in the rename table.\n\t\/\/ if it exists, create a new field entry with the new name, otherwise,\n\t\/\/ copy the existing field name in to the new field list.\n\t\/\/\n\t\/\/ However, I can't get the bro TableVar Lookup to return anything\n\t\/\/ even for tables that I know have data in them. I'm clearly doing\n\t\/\/ something wrong. So, hardcode the renames in the interest of\n\t\/\/ getting something done.\n\tfor (int i = 0; i < num_fields; i++){\n\t\tstd::string newName;\n\n\t\tif (strcmp(fields[i]->name, \"ts\") == 0)\n\t\t{\n\t\t\tnewName = \"timestamp\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.orig_h\") == 0)\n\t\t{\n\t\t\tnewName = \"source_ip\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.orig_p\") == 0)\n\t\t{\n\t\t\tnewName = \"source_port\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.resp_h\") == 0)\n\t\t{\n\t\t\tnewName = \"dest_ip\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name,\"id.resp_p\") == 0)\n\t\t{\n\t\t\tnewName = \"dest_port\";\n\t\t}\n\n\t\tif (newName.empty()){\n\t\t\tnewFields[i] = new threading::Field(fields[i]->name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->secondary_name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->type,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->subtype,\n\t\t\t\t\t\t\t\t\t\t\t\ttrue);\n\t\t}\n\t\telse {\n\t\t\tnewFields[i]= new threading::Field(newName.c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->secondary_name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->type,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->subtype,\n\t\t\t\t\t\t\t\t\t\t\t\ttrue);\n\t\t}\n\n\t}\n\n\treturn newFields;\n}\n\nbool KafkaWriter::DoInit(const WriterInfo& info, int num_fields, const threading::Field* const* fields)\n{\n\tconf = RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL);\n\ttconf = RdKafka::Conf::create(RdKafka::Conf::CONF_TOPIC);\n\t\/\/ note: hard-coding to use the random partitioner right now...\n\tRandomPartitionerCallback* part_cb = new RandomPartitionerCallback();\n\tstd::string errstr;\n\n\t\/\/ set up kafka connection (get brokers, set partitioner, etc)\n\tif (conf->set(\"metadata.broker.list\", broker_name, errstr) != RdKafka::Conf::CONF_OK){\n\t\treporter->Error(\"Failed to set metatdata.broker.list: %s\", errstr.c_str());\n\t\treturn false;\n\t}\n int default_batch_size_len = BifConst::KafkaLogger::default_batch_size->Len();\n char* default_batch_size = new char[default_batch_size_len + 1];\n memcpy(default_batch_size, BifConst::KafkaLogger::default_batch_size->Bytes(), default_batch_size_len);\n default_batch_size[default_batch_size_len] = 0;\n\n int max_batch_size_len = BifConst::KafkaLogger::max_batch_size->Len();\n char* max_batch_size = new char[max_batch_size_len + 1];\n memcpy(max_batch_size, BifConst::KafkaLogger::max_batch_size->Bytes(), max_batch_size_len);\n max_batch_size[max_batch_size_len] = 0;\n\n int max_batch_interval_len = BifConst::KafkaLogger::max_batch_interval->Len();\n char* max_batch_interval = new char[max_batch_interval_len + 1];\n memcpy(max_batch_interval, BifConst::KafkaLogger::max_batch_interval->Bytes(), max_batch_interval_len);\n max_batch_interval[max_batch_interval_len] = 0;\n\n\tconf->set(\"compression.codec\", compression_codec, errstr);\n\tconf->set(\"client.id\", client_id, errstr);\n\tconf->set(\"batch.num.messages\", default_batch_size, errstr);\n\tconf->set(\"queue.buffering.max.messages\", max_batch_size, errstr);\n\tconf->set(\"queue.buffering.max.ms\", max_batch_interval, errstr);\n\tconf->set(\"producer.type\", \"async\", errstr);\n\tif (tconf->set(\"partitioner_cb\", part_cb, errstr) != RdKafka::Conf::CONF_OK){\n\t\treporter->Error(\"failed to set partitioner for Kafka. %s\", errstr.c_str());\n\t}\n\n\tproducer = RdKafka::Producer::create(conf, errstr);\n\tif (!producer) {\n\t\treporter->Error(\"Failed to create producer\");\n\t\treturn false;\n\t}\n\ttopic = RdKafka::Topic::create(producer, topic_name, tconf, errstr);\n\n\tif (!topic) {\n\t\treporter->Error(\"Failed to create topic.\");\n\t\treturn false;\n\t}\n\t\n\t\/\/ set up lookups and renamed fields.\n\tfixed_fields = MakeFields(fields, num_fields, Info().path);\n\n\treturn true;\n}\n\n\nbool KafkaWriter::DoWrite(int num_fields, const Field* const * fields, Value** vals)\n {\n\tODesc buffer;\n\n \/\/ this may look silly, but as of this writing, Kafka's default\n \/\/ partitioning is poor. if you do not supply a key, kafka will never\n \/\/ call your partition function, even if one is specified in the config.\n \/\/ What it will do instead is choose a partition at random when it starts\n \/\/ up, and send everything to that partition. So, you need to supply a\n \/\/ partition key if you want your partitioner to be used\n const std::string partition_key = \"this is a key to trigger partitioning.\";\n\n\n\tbuffer.Clear();\n\n json_formatter->Describe(&buffer, num_fields, fixed_fields, vals);\n const char* bytes = (const char*)buffer.Bytes();\n std::string errstr;\n \n\t\/\/ actually send the data to Kafka.\n RdKafka::ErrorCode resp = producer->produce(topic,\n \t\t\t\t\t\t\t\t\t\t\tRdKafka::Topic::PARTITION_UA,\n \t\t\t\t\t\t\t\t\t\t\tRdKafka::Producer::MSG_COPY \/* Copy payload *\/,\n \t\t\t\t\t\t\t\t\t\t\tconst_cast<char *>(bytes),\n \t\t\t\t\t\t\t\t\t\t\tstrlen(bytes),\n \t\t\t\t\t\t\t\t\t\t\t&partition_key,\n \t\t\t\t\t\t\t\t\t\t\tNULL);\n if (resp != RdKafka::ERR_NO_ERROR) {\n errstr = RdKafka::err2str(resp);\n reporter->Error(\"Produce failed: %s\", errstr.c_str());\n reporter->Error(\"failed line: %s\", bytes);\n }\n\n \/\/ Note: this bit here means that even if the send to kafka fails, we're just going to\n \/\/ drop the messages. Such is life.\n producer->poll(0);\n\n return true;\n }\n\n\n\nbool KafkaWriter::DoSetBuf(bool enabled)\n {\n \/\/ Nothing to do.\n return true;\n }\n\nbool KafkaWriter::DoFlush(double network_time)\n {\n \/\/ Nothing to do.\n return true;\n }\n\nbool KafkaWriter::DoFinish(double network_time)\n {\n RdKafka::wait_destroyed(5000);\n return true;\n }\n\nbool KafkaWriter::DoHeartbeat(double network_time, double current_time)\n {\n\t\/\/nothing to do...all timing handled inside Kafka.\n return true;\n }\n\nbool KafkaWriter::DoRotate(const char* rotated_path, double open, double close, bool terminating)\n {\n \/\/ Nothing to do.\n FinishedRotation();\n return true;\n }\n<commit_msg>Adding new field renames.<commit_after>#include \"config.h\"\n\n#include \"util.h\"\n#include <errno.h>\n#include <string>\n#include <cstdlib>\n#include <time.h>\n#include <librdkafka\/rdkafkacpp.h>\n#include \"BroString.h\"\n#include \"threading\/SerialTypes.h\"\n#include \"Kafka.h\"\n#include \"kafkawriter.bif.h\"\n\nusing namespace logging;\nusing namespace writer;\nusing threading::Value;\nusing threading::Field;\nusing namespace RdKafka;\n\n\nclass RandomPartitionerCallback : public RdKafka::PartitionerCb {\nprivate:\n\tunsigned int seed;\n\npublic:\n\tint32_t partitioner_cb(const RdKafka::Topic *topic, const std::string *key,\n\t\t\t\t\t\t\tint32_t partition_count, void *msg_opaque)\n\t{\n\t\treturn (int32_t)rand_r(&seed) % partition_count;\n\t}\n\n\tRandomPartitionerCallback(){\n\t\tseed = time(NULL);\n\t}\n};\n\n\nKafkaWriter::KafkaWriter(WriterFrontend* frontend) : WriterBackend(frontend) \n{\n\n\tjson_formatter = 0;\n\t\/\/srand(time(NULL));\n\tproducer = NULL;\n\ttopic = NULL;\n\n\t\n\t\/\/ initialize kafka variables...\n\tbroker_name_len = BifConst::KafkaLogger::broker_name->Len();\n\tbroker_name = new char[broker_name_len + 1];\n\tmemcpy(broker_name, BifConst::KafkaLogger::broker_name->Bytes(), broker_name_len);\n\tbroker_name[broker_name_len] = 0;\n\n topic_name_len = BifConst::KafkaLogger::topic_name->Len();\n topic_name = new char[topic_name_len + 1];\n memcpy(topic_name, BifConst::KafkaLogger::topic_name->Bytes(), topic_name_len);\n topic_name[topic_name_len] = 0;\n\n compression_codec_len = BifConst::KafkaLogger::compression_codec->Len();\n compression_codec = new char[compression_codec_len + 1];\n memcpy(compression_codec, BifConst::KafkaLogger::compression_codec->Bytes(), compression_codec_len);\n compression_codec[compression_codec_len] = 0;\n \n \/\/ initialize varibles used to store extra data appended to every message\n \/\/ (sensor name and log type)\n int sensor_name_len = BifConst::KafkaLogger::sensor_name->Len();\n char* sensor_name = new char[sensor_name_len + 1];\n memcpy(sensor_name, BifConst::KafkaLogger::sensor_name->Bytes(), sensor_name_len);\n sensor_name[sensor_name_len] = 0;\n\n int type_name_len = strlen(Info().path);\n char* type_name = new char[type_name_len + 1];\n memcpy(type_name, Info().path, type_name_len);\n type_name[type_name_len] = 0;\n\n client_id_len = BifConst::KafkaLogger::client_id->Len() + strlen(Info().path) + 1;\n client_id = new char[client_id_len + 1];\n memcpy(client_id, BifConst::KafkaLogger::client_id->Bytes(), client_id_len);\n strcat(client_id, \"-\");\n strcat(client_id, type_name);\n client_id[client_id_len] = 0;\n\n json_formatter = new threading::formatter::AddingJSON(this,\n \t\t\t\t\t\t\t\tthreading::formatter::AddingJSON::TS_MILLIS,\n \t\t\t\t\t\t\t\tsensor_name,\n \t\t\t\t\t\t\t\ttype_name,\n \t\t\t\t\t\t\t\tBifConst::KafkaLogger::logstash_style_timestamp\n \t\t\t\t\t\t\t );\n}\n\nKafkaWriter::~KafkaWriter()\n{\n delete [] broker_name;\n delete [] topic_name;\n delete [] client_id;\n delete [] compression_codec;\n delete [] fixed_fields;\n \/\/ I think I need to shut down the connection to the producer before deleting\n \/\/ these variables. Also, if I just blindly delete these two, bro segfaults when\n \/\/ shutting down. Confess I don't understand what's happening here.\n \/\/delete producer;\n \/\/delete topic;\n delete json_formatter;\n}\n\n\nthreading::Field** KafkaWriter::MakeFields(const threading::Field* const* fields, int num_fields, std::string path){\n\t\/\/ create the renamed fields, based on user-supplied config.\n\tthreading::Field** newFields = (threading::Field**)malloc(sizeof(threading::Field*) * (num_fields));\n\n\t\/\/ what I'd like to do is\n\t\/\/ first, grab the rename table for just this log\n\t\/\/ The config will have a table of table of strings.\n\t\/\/ the first table key is the name of the log (dns, http, etc)\n\t\/\/ the internal table key is the column name, the internal table value\n\t\/\/ will be the name to change that to.\n\t\/\/ loop over the existing fields, look up the field name in the rename table.\n\t\/\/ if it exists, create a new field entry with the new name, otherwise,\n\t\/\/ copy the existing field name in to the new field list.\n\t\/\/\n\t\/\/ However, I can't get the bro TableVar Lookup to return anything\n\t\/\/ even for tables that I know have data in them. I'm clearly doing\n\t\/\/ something wrong. So, hardcode the renames in the interest of\n\t\/\/ getting something done.\n\t\/\/\n\t\/\/ Also, need to remove \".\"s from names for ElasticSearch.\n\t\/\/\n\tfor (int i = 0; i < num_fields; i++){\n\t\tstd::string newName;\n\n\t\tif (strcmp(fields[i]->name, \"ts\") == 0)\n\t\t{\n\t\t\tnewName = \"timestamp\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.orig_h\") == 0)\n\t\t{\n\t\t\tnewName = \"source_ip\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.orig_p\") == 0)\n\t\t{\n\t\t\tnewName = \"source_port\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"id.resp_h\") == 0)\n\t\t{\n\t\t\tnewName = \"dest_ip\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name,\"id.resp_p\") == 0)\n\t\t{\n\t\t\tnewName = \"dest_port\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"seen.indicator\") == 0)\n\t\t{\n\t\t\tnewName = \"indicator\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"seen.indicator_type\") == 0)\n\t\t{\n\t\t\tnewName = \"indicator_type\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"seen.where\") == 0)\n\t\t{\n\t\t\tnewName = \"seen_where\";\n\t\t}\n\t\telse if (strcmp(fields[i]->name, \"seen.node\") == 0)\n\t\t{\n\t\t\tnewName = \"seen_node\";\n\t\t}\n\n\n\t\tif (newName.empty()){\n\t\t\tnewFields[i] = new threading::Field(fields[i]->name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->secondary_name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->type,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->subtype,\n\t\t\t\t\t\t\t\t\t\t\t\ttrue);\n\t\t}\n\t\telse {\n\t\t\tnewFields[i]= new threading::Field(newName.c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->secondary_name,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->type,\n\t\t\t\t\t\t\t\t\t\t\t\tfields[i]->subtype,\n\t\t\t\t\t\t\t\t\t\t\t\ttrue);\n\t\t}\n\n\t}\n\n\treturn newFields;\n}\n\nbool KafkaWriter::DoInit(const WriterInfo& info, int num_fields, const threading::Field* const* fields)\n{\n\tconf = RdKafka::Conf::create(RdKafka::Conf::CONF_GLOBAL);\n\ttconf = RdKafka::Conf::create(RdKafka::Conf::CONF_TOPIC);\n\t\/\/ note: hard-coding to use the random partitioner right now...\n\tRandomPartitionerCallback* part_cb = new RandomPartitionerCallback();\n\tstd::string errstr;\n\n\t\/\/ set up kafka connection (get brokers, set partitioner, etc)\n\tif (conf->set(\"metadata.broker.list\", broker_name, errstr) != RdKafka::Conf::CONF_OK){\n\t\treporter->Error(\"Failed to set metatdata.broker.list: %s\", errstr.c_str());\n\t\treturn false;\n\t}\n int default_batch_size_len = BifConst::KafkaLogger::default_batch_size->Len();\n char* default_batch_size = new char[default_batch_size_len + 1];\n memcpy(default_batch_size, BifConst::KafkaLogger::default_batch_size->Bytes(), default_batch_size_len);\n default_batch_size[default_batch_size_len] = 0;\n\n int max_batch_size_len = BifConst::KafkaLogger::max_batch_size->Len();\n char* max_batch_size = new char[max_batch_size_len + 1];\n memcpy(max_batch_size, BifConst::KafkaLogger::max_batch_size->Bytes(), max_batch_size_len);\n max_batch_size[max_batch_size_len] = 0;\n\n int max_batch_interval_len = BifConst::KafkaLogger::max_batch_interval->Len();\n char* max_batch_interval = new char[max_batch_interval_len + 1];\n memcpy(max_batch_interval, BifConst::KafkaLogger::max_batch_interval->Bytes(), max_batch_interval_len);\n max_batch_interval[max_batch_interval_len] = 0;\n\n\tconf->set(\"compression.codec\", compression_codec, errstr);\n\tconf->set(\"client.id\", client_id, errstr);\n\tconf->set(\"batch.num.messages\", default_batch_size, errstr);\n\tconf->set(\"queue.buffering.max.messages\", max_batch_size, errstr);\n\tconf->set(\"queue.buffering.max.ms\", max_batch_interval, errstr);\n\tconf->set(\"producer.type\", \"async\", errstr);\n\tif (tconf->set(\"partitioner_cb\", part_cb, errstr) != RdKafka::Conf::CONF_OK){\n\t\treporter->Error(\"failed to set partitioner for Kafka. %s\", errstr.c_str());\n\t}\n\n\tproducer = RdKafka::Producer::create(conf, errstr);\n\tif (!producer) {\n\t\treporter->Error(\"Failed to create producer\");\n\t\treturn false;\n\t}\n\ttopic = RdKafka::Topic::create(producer, topic_name, tconf, errstr);\n\n\tif (!topic) {\n\t\treporter->Error(\"Failed to create topic.\");\n\t\treturn false;\n\t}\n\t\n\t\/\/ set up lookups and renamed fields.\n\tfixed_fields = MakeFields(fields, num_fields, Info().path);\n\n\treturn true;\n}\n\n\nbool KafkaWriter::DoWrite(int num_fields, const Field* const * fields, Value** vals)\n {\n\tODesc buffer;\n\n \/\/ this may look silly, but as of this writing, Kafka's default\n \/\/ partitioning is poor. if you do not supply a key, kafka will never\n \/\/ call your partition function, even if one is specified in the config.\n \/\/ What it will do instead is choose a partition at random when it starts\n \/\/ up, and send everything to that partition. So, you need to supply a\n \/\/ partition key if you want your partitioner to be used\n const std::string partition_key = \"this is a key to trigger partitioning.\";\n\n\n\tbuffer.Clear();\n\n json_formatter->Describe(&buffer, num_fields, fixed_fields, vals);\n const char* bytes = (const char*)buffer.Bytes();\n std::string errstr;\n \n\t\/\/ actually send the data to Kafka.\n RdKafka::ErrorCode resp = producer->produce(topic,\n \t\t\t\t\t\t\t\t\t\t\tRdKafka::Topic::PARTITION_UA,\n \t\t\t\t\t\t\t\t\t\t\tRdKafka::Producer::MSG_COPY \/* Copy payload *\/,\n \t\t\t\t\t\t\t\t\t\t\tconst_cast<char *>(bytes),\n \t\t\t\t\t\t\t\t\t\t\tstrlen(bytes),\n \t\t\t\t\t\t\t\t\t\t\t&partition_key,\n \t\t\t\t\t\t\t\t\t\t\tNULL);\n if (resp != RdKafka::ERR_NO_ERROR) {\n errstr = RdKafka::err2str(resp);\n reporter->Error(\"Produce failed: %s\", errstr.c_str());\n reporter->Error(\"failed line: %s\", bytes);\n }\n\n \/\/ Note: this bit here means that even if the send to kafka fails, we're just going to\n \/\/ drop the messages. Such is life.\n producer->poll(0);\n\n return true;\n }\n\n\n\nbool KafkaWriter::DoSetBuf(bool enabled)\n {\n \/\/ Nothing to do.\n return true;\n }\n\nbool KafkaWriter::DoFlush(double network_time)\n {\n \/\/ Nothing to do.\n return true;\n }\n\nbool KafkaWriter::DoFinish(double network_time)\n {\n RdKafka::wait_destroyed(5000);\n return true;\n }\n\nbool KafkaWriter::DoHeartbeat(double network_time, double current_time)\n {\n\t\/\/nothing to do...all timing handled inside Kafka.\n return true;\n }\n\nbool KafkaWriter::DoRotate(const char* rotated_path, double open, double close, bool terminating)\n {\n \/\/ Nothing to do.\n FinishedRotation();\n return true;\n }\n<|endoftext|>"} {"text":"<commit_before>#include \"log.h\"\n#include <iostream>\n\nnamespace share_me_utils {\n\nLog::Log() {\n memset(m_prefixSwitchs, -1, sizeof(m_prefixSwitchs));\n m_prefixSymbols[eDate] = 'd';\n m_prefixSymbols[eTime] = 't';\n m_prefixSymbols[eFile] = 'F';\n m_prefixSymbols[eFunc] = 'f';\n m_prefixSymbols[eLine] = 'l';\n\n m_levelString[S_TRACE] = \"TRACE\";\n m_levelString[S_DEBUG] = \"DEBUG\";\n m_levelString[S_INFO] = \"INFO\";\n m_levelString[S_WARN] = \"WARN\";\n m_levelString[S_ERROR] = \"ERROR\";\n m_levelString[S_FATAL] = \"FATAL\";\n SetPrefix(\"%d %t %F %f %l\");\n initColor();\n#ifdef _WIN32\n m_logEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n#endif\n}\n\nbool Log::initColor() {\n memset(m_levelColor, 0, sizeof(m_levelColor));\n HANDLE stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n CONSOLE_SCREEN_BUFFER_INFO csbiInfo;\n GetConsoleScreenBufferInfo(stdHandle, &csbiInfo);\n m_oldColorAttr = csbiInfo.wAttributes;\n m_levelColor[S_TRACE] = FOREGROUND_BLUE | FOREGROUND_INTENSITY;\n m_levelColor[S_DEBUG] = m_oldColorAttr | FOREGROUND_INTENSITY;\n m_levelColor[S_INFO] = FOREGROUND_GREEN | FOREGROUND_INTENSITY;\n m_levelColor[S_WARN] =\n FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY;\n m_levelColor[S_ERROR] = FOREGROUND_RED | FOREGROUND_INTENSITY;\n m_levelColor[S_FATAL] =\n FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY;\n return true;\n}\n\nvoid Log::setColor(int level) {\n static HANDLE stdHandle = NULL;\n if (level >= S_TRACE && level < S_INVALID) {\n if (!stdHandle) {\n stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n }\n SetConsoleTextAttribute(stdHandle, m_levelColor[level]);\n }\n}\n\nvoid Log::resetColor() {\n static HANDLE stdHandle = NULL;\n if (!stdHandle) {\n stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n }\n SetConsoleTextAttribute(stdHandle, m_oldColorAttr);\n}\n\nLog *Log::Instance() {\n static Log *inst = NULL;\n if (!inst)\n inst = new Log();\n return inst;\n}\n\nbool Log::Start() {\n DWORD threadID;\n HANDLE threadHandle;\n threadHandle =\n CreateThread(NULL, 0, Log::Instance()->loop, nullptr, 0, &threadID);\n return threadHandle != NULL;\n}\n\nbool Log::SetPrefix(const char *prefix) {\n if (!prefix)\n return false;\n if (*prefix == '\\0')\n return false;\n\n const char *s = prefix;\n bool switchConfiged[eTop] = {false};\n memset(m_prefixSwitchs, -1, sizeof(m_prefixSwitchs));\n for (int i = 0; s[i] != '\\0'; ++i) {\n if (s[i] == '%') {\n if (i >= 1 && s[i - 1] == '\\\\')\n continue;\n for (int j = eDate; j < eTop; ++j) {\n if (m_prefixSymbols[j] == s[i + 1]) {\n if (!switchConfiged[j]) {\n for (int k = eDate; k < eTop; ++k) {\n if (m_prefixSwitchs[k] == -1) {\n m_prefixSwitchs[k] = j;\n break;\n }\n }\n }\n break;\n }\n }\n }\n }\n return true;\n}\n\nvoid Log::LogContent(const char *filename, const int lineno,\n const char *funcname, int level, const char *format, ...) {\n int offset = 0;\n int prefixLen = 0;\n prefixLen = generatePrefix(filename, funcname, lineno, level);\n if (prefixLen > 0) {\n \/\/ m_prefixBuffer[offset] = '\\0';\n memcpy(m_logBuffer, m_prefixBuffer, prefixLen);\n } else\n prefixLen = 0;\n va_list args; \/\/定义一个va_list类型的变量，用来储存单个参数\n va_start(args, format); \/\/使args指向可变参数的第一个参数\n offset = vsnprintf(m_logBuffer + prefixLen, 2 * LOG_BUFFER_LENGTH - prefixLen,\n format, args); \/\/必须用vprintf等带V的\n va_end(args);\n if (offset > 0) {\n offset = offset + prefixLen >= 2 * LOG_BUFFER_LENGTH - 2\n ? (2 * LOG_BUFFER_LENGTH - 2)\n : offset + prefixLen;\n } else {\n offset = 0;\n }\n m_logBuffer[offset] = '\\n';\n m_logBuffer[offset + 1] = '\\0';\n setColor(level);\n fprintf(stdout, \"%s\", m_logBuffer);\n resetColor();\n}\n\nint Log::generatePrefix(const char *filename, const char *funcname,\n const int lineno, int level) {\n memset(m_prefixBuffer, 0, LOG_BUFFER_LENGTH);\n size_t offset = 0;\n for (int i = eDate; i < eTop; ++i) {\n if (m_prefixSwitchs[i] == -1)\n break;\n switch (m_prefixSwitchs[i]) {\n case eDate: {\n time_t rawtime;\n struct tm timeinfo;\n time(&rawtime);\n localtime(&timeinfo, &rawtime);\n offset += strftime(m_prefixBuffer + offset, LOG_BUFFER_LENGTH - offset,\n \"[%Y-%m-%d]\", &timeinfo);\n \/\/ offset += sprintf(m_prefixBuffer + offset, \"%s\", date);\n break;\n }\n case eTime: {\n time_t rawtime;\n struct tm timeinfo;\n time(&rawtime);\n localtime(&timeinfo, &rawtime);\n offset += strftime(m_prefixBuffer + offset, LOG_BUFFER_LENGTH - offset,\n \"[%H:%M:%S]\", &timeinfo);\n \/\/ offset += sprintf(m_prefixBuffer + offset, \"%s\", time);\n break;\n }\n case eFile: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%s]\", filename);\n break;\n }\n case eFunc: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%s]\", funcname);\n break;\n }\n case eLine: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%d]\", lineno);\n break;\n }\n default: { break; }\n }\n }\n offset += snprintf(m_prefixBuffer + offset, 2 * LOG_BUFFER_LENGTH - offset,\n \"[%s]\", m_levelString[level]);\n return (offset > 0 && offset < LOG_BUFFER_LENGTH) ? (int)offset : -1;\n}\n\nvoid Log::loop(THREAD_PARAM parma) {\n MsgNode* msgs = nullptr;\n MsgNode* msg = nullptr;\n while (true) {\n msgs = m_msgQueue.get();\n if (!msgs) {\n DWORD dReturn = WaitForSingleObject(m_logEvent, 100)\n switch (dReturn) {\n case WAIT_TIMEOUT:\n case WAIT_OBJECT_0: continue;\n case WAIT_ABANDONED: break;\n case WAIT_FAILED: break;\n }\n }\n while(msgs) {\n msg = msgs;\n out(msg->msg);\n msgs = msgs->next;\n DESTROY_MSG_NODE(msg);\n }\n }\n}\n\nbool Log::AppendMsg(LogMsg *msg) { return MsgQueue.Append(msg); }\n\nvoid Log::out(LogMsg* msg) {\n int offset = 0;\n offset = generatePrefix(msg->fileName, msg->funcName, msg->lineno, msg->logLevel);\n if (offset > 0) {\n memcpy(m_logBuffer, m_prefixBuffer, offset);\n } else\n offset = 0;\n offset += sprintf(m_logBuffer+offset, 2 * LOG_BUFFER_LENGTH-offset, \"%s\", msg->msg);\n if (offset > 0) {\n offset = offset >= 2 * LOG_BUFFER_LENGTH - 2\n ? (2 * LOG_BUFFER_LENGTH - 2)\n : offset;\n } else {\n offset = 0;\n }\n m_logBuffer[offset] = '\\n';\n m_logBuffer[offset + 1] = '\\0';\n setColor(msg->logLevel);\n fprintf(stdout, \"%s\", m_logBuffer);\n resetColor();\n}\n\nvoid Log::Notify() {\n if (m_isRunning) return;\n int res = SetEvent(m_logEvent);\n}\n\nLog::MsgQueue::MsgQueue() : m_head(nullptr), m_tail(nullptr), m_count(0) {}\nLog::MsgQueue::~MsgQueue() {\n MsgNode* node = nullptr;\n while(m_head) {\n node = m_head;\n m_head = m_head->next;\n delete node->msg;\n delete node;\n }\n m_count = 0;\n}\nbool Log::MsgQueue::Append(LogMsg *msg) {\n if (m_count > MAX_COUNT) {\n return false;\n }\n MsgNode *node = new MsgNode;\n node->msg = msg;\n node->next = nullptr;\n if (!m_head) {\n m_head = node;\n } else {\n m_tail->next = node;\n }\n m_tail = node;\n ++m_count;\n return true;\n}\nMsgNode *Log::MsgQueue::get() {\n MsgNode *node = m_head;\n m_head = nullptr;\n m_tail = nullptr;\n m_count = 0;\n return node;\n}\n\nvoid Log::MsgQueue::Stop() {\n m_count = MAX_COUNT + 1;\n}\n\n\nvoid Log::formatString(const char *format, ...) { ; }\n\n\/\/ Logger implement\n\nLogger::Logger() {}\nLogger::~Logger() {}\nvoid Logger::SendLog(const char *filename, const int lineno,\n const char *funcname, int level, const char *format, ...) {\n int offset = 0;\n char *logBuffer = new char[LOG_BUFFER_LENGTH];\n va_list args; \/\/定义一个va_list类型的变量，用来储存单个参数\n va_start(args, format); \/\/使args指向可变参数的第一个参数\n offset = vsnprintf(logBuffer, LOG_BUFFER_LENGTH, format,\n args); \/\/必须用vprintf等带V的\n va_end(args);\n if (offset > 0) {\n offset = offset + prefixLen >= LOG_BUFFER_LENGTH - 2\n ? (LOG_BUFFER_LENGTH - 2)\n : offset;\n } else {\n offset = 0;\n }\n logBuffer[offset] = '\\n';\n logBuffer[offset + 1] = '\\0';\n LogMsg msg = new LogMsg(filename, lineno, funcname, level, logBuffer);\n Log::Instance()->AppendMsg(msg);\n}\n} \/\/ namespace share_me_utils<commit_msg>event<commit_after>#include \"log.h\"\n#include <iostream>\n\nnamespace share_me_utils {\n\nLog::Log() {\n memset(m_prefixSwitchs, -1, sizeof(m_prefixSwitchs));\n m_prefixSymbols[eDate] = 'd';\n m_prefixSymbols[eTime] = 't';\n m_prefixSymbols[eFile] = 'F';\n m_prefixSymbols[eFunc] = 'f';\n m_prefixSymbols[eLine] = 'l';\n\n m_levelString[S_TRACE] = \"TRACE\";\n m_levelString[S_DEBUG] = \"DEBUG\";\n m_levelString[S_INFO] = \"INFO\";\n m_levelString[S_WARN] = \"WARN\";\n m_levelString[S_ERROR] = \"ERROR\";\n m_levelString[S_FATAL] = \"FATAL\";\n SetPrefix(\"%d %t %F %f %l\");\n initColor();\n#ifdef _WIN32\n m_logEvent = CreateEvent(NULL, FALSE, FALSE, NULL);\n#endif\n}\n\nbool Log::initColor() {\n memset(m_levelColor, 0, sizeof(m_levelColor));\n HANDLE stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n CONSOLE_SCREEN_BUFFER_INFO csbiInfo;\n GetConsoleScreenBufferInfo(stdHandle, &csbiInfo);\n m_oldColorAttr = csbiInfo.wAttributes;\n m_levelColor[S_TRACE] = FOREGROUND_BLUE | FOREGROUND_INTENSITY;\n m_levelColor[S_DEBUG] = m_oldColorAttr | FOREGROUND_INTENSITY;\n m_levelColor[S_INFO] = FOREGROUND_GREEN | FOREGROUND_INTENSITY;\n m_levelColor[S_WARN] =\n FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_INTENSITY;\n m_levelColor[S_ERROR] = FOREGROUND_RED | FOREGROUND_INTENSITY;\n m_levelColor[S_FATAL] =\n FOREGROUND_RED | FOREGROUND_BLUE | FOREGROUND_INTENSITY;\n return true;\n}\n\nvoid Log::setColor(int level) {\n static HANDLE stdHandle = NULL;\n if (level >= S_TRACE && level < S_INVALID) {\n if (!stdHandle) {\n stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n }\n SetConsoleTextAttribute(stdHandle, m_levelColor[level]);\n }\n}\n\nvoid Log::resetColor() {\n static HANDLE stdHandle = NULL;\n if (!stdHandle) {\n stdHandle = GetStdHandle(STD_OUTPUT_HANDLE);\n }\n SetConsoleTextAttribute(stdHandle, m_oldColorAttr);\n}\n\nLog *Log::Instance() {\n static Log *inst = NULL;\n if (!inst)\n inst = new Log();\n return inst;\n}\n\nbool Log::Start() {\n DWORD threadID;\n HANDLE threadHandle;\n threadHandle =\n CreateThread(NULL, 0, Log::Instance()->loop, nullptr, 0, &threadID);\n return threadHandle != NULL;\n}\n\nbool Log::SetPrefix(const char *prefix) {\n if (!prefix)\n return false;\n if (*prefix == '\\0')\n return false;\n\n const char *s = prefix;\n bool switchConfiged[eTop] = {false};\n memset(m_prefixSwitchs, -1, sizeof(m_prefixSwitchs));\n for (int i = 0; s[i] != '\\0'; ++i) {\n if (s[i] == '%') {\n if (i >= 1 && s[i - 1] == '\\\\')\n continue;\n for (int j = eDate; j < eTop; ++j) {\n if (m_prefixSymbols[j] == s[i + 1]) {\n if (!switchConfiged[j]) {\n for (int k = eDate; k < eTop; ++k) {\n if (m_prefixSwitchs[k] == -1) {\n m_prefixSwitchs[k] = j;\n break;\n }\n }\n }\n break;\n }\n }\n }\n }\n return true;\n}\n\nvoid Log::LogContent(const char *filename, const int lineno,\n const char *funcname, int level, const char *format, ...) {\n int offset = 0;\n int prefixLen = 0;\n prefixLen = generatePrefix(filename, funcname, lineno, level);\n if (prefixLen > 0) {\n \/\/ m_prefixBuffer[offset] = '\\0';\n memcpy(m_logBuffer, m_prefixBuffer, prefixLen);\n } else\n prefixLen = 0;\n va_list args; \/\/定义一个va_list类型的变量，用来储存单个参数\n va_start(args, format); \/\/使args指向可变参数的第一个参数\n offset = vsnprintf(m_logBuffer + prefixLen, 2 * LOG_BUFFER_LENGTH - prefixLen,\n format, args); \/\/必须用vprintf等带V的\n va_end(args);\n if (offset > 0) {\n offset = offset + prefixLen >= 2 * LOG_BUFFER_LENGTH - 2\n ? (2 * LOG_BUFFER_LENGTH - 2)\n : offset + prefixLen;\n } else {\n offset = 0;\n }\n m_logBuffer[offset] = '\\n';\n m_logBuffer[offset + 1] = '\\0';\n setColor(level);\n fprintf(stdout, \"%s\", m_logBuffer);\n resetColor();\n}\n\nint Log::generatePrefix(const char *filename, const char *funcname,\n const int lineno, int level) {\n memset(m_prefixBuffer, 0, LOG_BUFFER_LENGTH);\n size_t offset = 0;\n for (int i = eDate; i < eTop; ++i) {\n if (m_prefixSwitchs[i] == -1)\n break;\n switch (m_prefixSwitchs[i]) {\n case eDate: {\n time_t rawtime;\n struct tm timeinfo;\n time(&rawtime);\n localtime(&timeinfo, &rawtime);\n offset += strftime(m_prefixBuffer + offset, LOG_BUFFER_LENGTH - offset,\n \"[%Y-%m-%d]\", &timeinfo);\n \/\/ offset += sprintf(m_prefixBuffer + offset, \"%s\", date);\n break;\n }\n case eTime: {\n time_t rawtime;\n struct tm timeinfo;\n time(&rawtime);\n localtime(&timeinfo, &rawtime);\n offset += strftime(m_prefixBuffer + offset, LOG_BUFFER_LENGTH - offset,\n \"[%H:%M:%S]\", &timeinfo);\n \/\/ offset += sprintf(m_prefixBuffer + offset, \"%s\", time);\n break;\n }\n case eFile: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%s]\", filename);\n break;\n }\n case eFunc: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%s]\", funcname);\n break;\n }\n case eLine: {\n offset += snprintf(m_prefixBuffer + offset,\n 2 * LOG_BUFFER_LENGTH - offset, \"[%d]\", lineno);\n break;\n }\n default: { break; }\n }\n }\n offset += snprintf(m_prefixBuffer + offset, 2 * LOG_BUFFER_LENGTH - offset,\n \"[%s]\", m_levelString[level]);\n return (offset > 0 && offset < LOG_BUFFER_LENGTH) ? (int)offset : -1;\n}\n\nvoid Log::loop(THREAD_PARAM parma) {\n MsgNode* msgs = nullptr;\n MsgNode* msg = nullptr;\n while (true) {\n msgs = m_msgQueue.get();\n if (!msgs) {\n DWORD dReturn = WaitForSingleObject(m_logEvent, 100)\n switch (dReturn) {\n case WAIT_TIMEOUT:\n case WAIT_OBJECT_0: continue;\n case WAIT_ABANDONED: break;\n case WAIT_FAILED: break;\n }\n }\n while(msgs) {\n msg = msgs;\n out(msg->msg);\n msgs = msgs->next;\n DESTROY_MSG_NODE(msg);\n }\n }\n}\n\nbool Log::AppendMsg(LogMsg *msg) { return MsgQueue.Append(msg); }\n\nvoid Log::out(LogMsg* msg) {\n int offset = 0;\n offset = generatePrefix(msg->fileName, msg->funcName, msg->lineno, msg->logLevel);\n if (offset > 0) {\n memcpy(m_logBuffer, m_prefixBuffer, offset);\n } else\n offset = 0;\n offset += sprintf(m_logBuffer+offset, 2 * LOG_BUFFER_LENGTH-offset, \"%s\", msg->msg);\n if (offset > 0) {\n offset = offset >= 2 * LOG_BUFFER_LENGTH - 2\n ? (2 * LOG_BUFFER_LENGTH - 2)\n : offset;\n } else {\n offset = 0;\n }\n m_logBuffer[offset] = '\\n';\n m_logBuffer[offset + 1] = '\\0';\n setColor(msg->logLevel);\n fprintf(stdout, \"%s\", m_logBuffer);\n resetColor();\n}\n\nvoid Log::Notify() {\n if (m_isRunning) return;\n SetEvent(m_logEvent);\n}\n\nLog::MsgQueue::MsgQueue() : m_head(nullptr), m_tail(nullptr), m_count(0) {}\nLog::MsgQueue::~MsgQueue() {\n MsgNode* node = nullptr;\n while(m_head) {\n node = m_head;\n m_head = m_head->next;\n delete node->msg;\n delete node;\n }\n m_count = 0;\n}\nbool Log::MsgQueue::Append(LogMsg *msg) {\n if (m_count > MAX_COUNT) {\n return false;\n }\n MsgNode *node = new MsgNode;\n node->msg = msg;\n node->next = nullptr;\n if (!m_head) {\n m_head = node;\n } else {\n m_tail->next = node;\n }\n m_tail = node;\n ++m_count;\n return true;\n}\nMsgNode *Log::MsgQueue::get() {\n MsgNode *node = m_head;\n m_head = nullptr;\n m_tail = nullptr;\n m_count = 0;\n return node;\n}\n\nvoid Log::MsgQueue::Stop() {\n m_count = MAX_COUNT + 1;\n}\n\n\nvoid Log::formatString(const char *format, ...) { ; }\n\n\/\/ Logger implement\n\nLogger::Logger() {}\nLogger::~Logger() {}\nvoid Logger::SendLog(const char *filename, const int lineno,\n const char *funcname, int level, const char *format, ...) {\n int offset = 0;\n char *logBuffer = new char[LOG_BUFFER_LENGTH];\n va_list args; \/\/定义一个va_list类型的变量，用来储存单个参数\n va_start(args, format); \/\/使args指向可变参数的第一个参数\n offset = vsnprintf(logBuffer, LOG_BUFFER_LENGTH, format,\n args); \/\/必须用vprintf等带V的\n va_end(args);\n if (offset > 0) {\n offset = offset + prefixLen >= LOG_BUFFER_LENGTH - 2\n ? (LOG_BUFFER_LENGTH - 2)\n : offset;\n } else {\n offset = 0;\n }\n logBuffer[offset] = '\\n';\n logBuffer[offset + 1] = '\\0';\n LogMsg msg = new LogMsg(filename, lineno, funcname, level, logBuffer);\n Log::Instance()->AppendMsg(msg);\n}\n} \/\/ namespace share_me_utils<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <unordered_map>\n\n#include \"global.hpp\"\n#include \"operators.hpp\"\n#include \"tokens.hpp\"\n#include \"nodes.hpp\"\n#include \"builtins.hpp\"\n\nnamespace lang {\n \n class Parser {\n private:\n std::vector<Token> tokens {};\n inline void skipCharacters(unsigned int& i, int by) {i += by;}\n \/\/ If we're already at the next character, but the loop will increment i by 1\n inline void preventIncrement(unsigned int& i) {i--;}\n \n std::vector<Token> variables {};\n std::vector<std::string> keywords {\"define\", \"if\", \"while\"};\n std::vector<std::string> constructKeywords {\"do\", \"end\", \"else\"};\n public:\n AST tree = AST();\n \n Parser(std::string code) {\n if (PARSER_PRINT_INPUT) print(code, \"\\n\");\n try {\n tokenize(code);\n if (PARSER_PRINT_TOKENS) for (auto tok : tokens) print(tok, \"\\n\");\n if (PARSER_PRINT_AS_EXPR) for (auto tok : ExpressionNode(tokens).getRPNOutput()) print(tok.data, \" \");\n buildTree(tokens);\n } catch (SyntaxError &e) {\n print(e.toString(), \"\\n\");\n }\n }\n \n void tokenize(std::string code) {\n unsigned int lines = 0;\n for (unsigned int i = 0; i < code.length(); ++i) {\n if (code[i] == '\\n') lines++;\n \n \/\/ Ignore whitespace\n if (isspace(code[i])) continue;\n \n \/\/ Block begin\/end\n \/\/ Parenthesis\n \/\/ Semicolons\n if (code[i] == '{' || code[i] == '}' ||\n code[i] == '(' || code[i] == ')' ||\n code[i] == ';') {\n tokens.push_back(Token(std::string(1, code[i]), CONSTRUCT, lines));\n continue;\n }\n \n \/\/ Operators\n auto initTokSize = tokens.size();\n std::for_each(opList.begin(), opList.end(), [this, initTokSize, code, i, lines](Operator& op) {\n if (initTokSize < tokens.size()) return; \/\/ If there are more tokens than before for_each, the operator was already added, so return.\n if (op.toString().length() + i > code.length()) return; \/\/ If the operator is longer than the source string, ignore it.\n if (op.toString() == code.substr(i, op.toString().length())) {\n Operator* tmp = &op;\n \/\/ TODO: apply DRY on these ifs\n if (tmp->toString() == \"++\" || tmp->toString() == \"--\") {\n \/\/ Prefix version\n if (tokens.back().type == OPERATOR || tokens.back().type == CONSTRUCT) tmp = new Operator(tmp->toString(), 12, ASSOCIATE_FROM_RIGHT, UNARY);\n \/\/ Postfix version\n else tmp = new Operator(tmp->toString(), 13, ASSOCIATE_FROM_RIGHT, UNARY);\n }\n if (tmp->toString() == \"+\" || tmp->toString() == \"-\") {\n \/\/ Unary version\n if (tokens.back().type == OPERATOR || tokens.back().type == CONSTRUCT) tmp = new Operator(tmp->toString(), 12, ASSOCIATE_FROM_RIGHT, UNARY);\n \/\/ Binary version\n else tmp = new Operator(tmp->toString(), 10);\n }\n if (PARSER_PRINT_OPERATOR_TOKENS) print(\"Parser found Token with Operator \", *tmp, \", at address \", tmp, \"\\n\");\n tokens.push_back(Token(tmp, OPERATOR, lines));\n }\n });\n \n if (initTokSize < tokens.size()) {\n skipCharacters(i, tokens.back().data.length() - 1);\n continue; \/\/ Token added, continue.\n }\n \n \/\/ Numbers\n if (isdigit(code[i])) {\n int base = 10;\n std::string current = \"\";\n if (code[i] == '0') {\n switch (code[i + 1]) {\n case 'x': base = 16; skipCharacters(i, 2); break;\n case 'b': base = 2; skipCharacters(i, 2); break;\n case 'o': base = 8; skipCharacters(i, 2); break;\n default: break;\n }\n }\n bool isFloat = false;\n while (isdigit(code[i]) || code[i] == '.') {\n current += code[i];\n if (code[i] == '.') {\n if (isFloat) throw SyntaxError(\"Malformed float, multiple decimal points: \\\"\" + current + \"\\\"\", lines);\n isFloat = true;\n }\n skipCharacters(i, 1);\n }\n preventIncrement(i);\n if (current[current.length() - 1] == '.') throw SyntaxError(\"Malformed float, missing digits after decimal point: \\\"\" + current + \"\\\"\", lines);\n if (base != 10 && isFloat) throw SyntaxError(\"Floating point numbers must be used with base 10 numbers: \\\"\" + current + \"\\\"\", lines);\n Token t;\n if (isFloat) t = Token(new Float(current), FLOAT, lines);\n else t = Token(new Integer(current, base), INTEGER, lines);\n tokens.push_back(t);\n continue;\n }\n \n \/\/ String literals\n if (code[i] == '\"') {\n skipCharacters(i, 1); \/\/ Skip the double quote\n std::string current = \"\";\n while (code[i] != '\"') {\n \/\/ TODO: add escape sequences\n current += code[i];\n skipCharacters(i, 1);\n }\n \/\/ Don't call preventIncrement here so the other double quote is skipped\n tokens.push_back(Token(new String(current), STRING, lines));\n continue;\n }\n \n \/\/ Others\n Token token = Token();\n while (!isspace(code[i])) {\n if (isReservedChar(code[i]) || code[i] == '\\0') break;\n token.data += code[i];\n skipCharacters(i, 1);\n }\n \/\/ Check if the thing is a Boolean\n if (token.data == \"true\" || token.data == \"false\") {\n token.type = BOOLEAN;\n token.typeData = new Boolean(token.data);\n }\n \/\/ Check if the thing references a variable\n for (auto tok : variables)\n if (tok.data == token.data) {\n token = tok;\n break;\n }\n \/\/ Check if the thing is a new variable\n if (tokens.size() > 0 && ((tokens.back().type == KEYWORD && tokens.back().data == \"define\") || tokens.back().type == TYPE)) {\n token.type = VARIABLE;\n token.typeData = new Variable();\n variables.push_back(token);\n }\n \/\/ Check if the thing is a keyword\n if (contains(token.data, keywords)) token.type = KEYWORD;\n if (contains(token.data, constructKeywords)) token.type = CONSTRUCT;\n \n \/\/ Push token\n preventIncrement(i);\n token.line = lines;\n tokens.push_back(token);\n }\n }\n \n ExpressionNode* evaluateCondition(std::vector<Token>& toks) {\n std::vector<Token> exprToks = std::vector<Token>(toks.begin() + 1, toks.end() - 1);\n ExpressionNode* condition = new ExpressionNode(exprToks);\n condition->buildSubtree();\n return condition;\n }\n \n void buildTree(std::vector<Token> tokens) {\n static std::vector<BlockNode*> blockStack {};\n auto addToBlock = [this](ASTNode* child) {\n if (blockStack.size() == 0) tree.addRootChild(child);\n else blockStack.back()->addChild(child);\n };\n auto logicalLines = splitVector(tokens, isNewLine);\n for (uint64 i = 0; i < logicalLines.size(); i++) {\n std::vector<Token>& toks = logicalLines[i];\n if (toks.size() == 0) continue;\n \/\/ TODO: check for solid types here as well\n if (toks[0].data == \"define\" && toks[0].type == KEYWORD) {\n DeclarationNode* decl = new DeclarationNode(\"define\", toks[1]);\n decl->setLineNumber(toks[1].line);\n if (toks[2].data != \";\" || toks[2].type != CONSTRUCT) {\n std::vector<Token> exprToks(toks.begin() + 1, toks.end());\n ExpressionNode* expr = new ExpressionNode(exprToks);\n expr->buildSubtree();\n decl->addChild(expr);\n }\n if (PARSER_PRINT_DECL_TREE) decl->printTree(blockStack.size());\n addToBlock(decl);\n } else if (toks[0].data == \"while\" && toks[0].type == KEYWORD) {\n auto wBlock = new WhileNode(evaluateCondition(toks), new BlockNode());\n if (PARSER_PRINT_WHILE_TREE) wBlock->printTree(blockStack.size());\n addToBlock(wBlock);\n blockStack.push_back(wBlock);\n } else if (toks[0].data == \"if\" && toks[0].type == KEYWORD) {\n auto cBlock = new ConditionalNode(evaluateCondition(toks), new BlockNode(), new BlockNode());\n if (PARSER_PRINT_COND_TREE) cBlock->printTree(blockStack.size());\n addToBlock(cBlock);\n blockStack.push_back(cBlock);\n } else if (toks[0].data == \"else\" && toks[0].type == CONSTRUCT) {\n auto cNode = dynamic_cast<ConditionalNode*>(blockStack.back());\n if (cNode == nullptr) throw SyntaxError(\"Cannot find conditional structure for token `else`.\\n\", blockStack.back()->getLineNumber());\n cNode->nextBlock();\n } else if (toks[0].data == \"end\" && toks[0].type == CONSTRUCT) {\n blockStack.pop_back();\n } else {\n ExpressionNode* expr = new ExpressionNode(toks);\n expr->buildSubtree();\n expr->setLineNumber(dynamic_cast<ExpressionChildNode*>(expr->getChildren()[0])->t.line);\n if (PARSER_PRINT_EXPR_TREE) expr->printTree(blockStack.size());\n addToBlock(expr);\n }\n }\n }\n \n std::vector<Token> getTokens() {\n return tokens;\n }\n \n };\n \n class Interpreter {\n private:\n AST tree;\n \/\/ TODO: implement some scope\n std::unordered_map<std::string, Variable*> globalVars {};\n public:\n Interpreter(AST tree): tree(tree) {\n interpret(tree.getRootChildren());\n }\n private:\n void interpret(ChildrenNodes nodes) {\n for (uint64 i = 0; i < nodes.size(); ++i) {\n auto nodeType = nodes[i]->getNodeType();\n if (nodeType == \"ExpressionNode\") {\n interpretExpression(dynamic_cast<ExpressionChildNode*>(nodes[i]->getChildren()[0]))->printTree(0);\n } else if (nodeType == \"DeclarationNode\") {\n registerDeclaration(dynamic_cast<DeclarationNode*>(nodes[i]));\n } else if (nodeType == \"ConditionalNode\") {\n resolveCondition(dynamic_cast<ConditionalNode*>(nodes[i]));\n } else if (nodeType == \"WhileNode\") {\n doWhileLoop(dynamic_cast<WhileNode*>(nodes[i]));\n }\n }\n }\n \n void doWhileLoop(WhileNode* node) {\n while (true) {\n auto condition = interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getCondition()->getChild()));\n if (!static_cast<Object*>(condition->t.typeData)->isTruthy()) break;\n interpret(node->getLoopNode()->getChildren());\n }\n }\n \n void resolveCondition(ConditionalNode* node) {\n auto condRes = interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getCondition()->getChild()));\n if (static_cast<Object*>(condRes->t.typeData)->isTruthy()) {\n interpret(node->getTrueBlock()->getChildren());\n } else {\n interpret(node->getFalseBlock()->getChildren());\n }\n }\n \n void registerDeclaration(DeclarationNode* node) {\n globalVars.insert({node->identifier.data, static_cast<Variable*>(node->identifier.typeData)});\n if (node->getChildren().size() == 1) {\n globalVars[node->identifier.data]->assign(\n static_cast<Object*>(interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getChild()->getChildren()[0]))->t.typeData)\n );\n }\n }\n \n ExpressionChildNode* interpretExpression(ExpressionChildNode* node) {\n if (node->getChildren().size() == 0) return node;\n if (node->t.type == OPERATOR) {\n Operator* op = static_cast<Operator*>(node->t.typeData);\n auto ch = node->getChildren();\n std::for_each(ch.begin(), ch.end(), [this](ASTNode*& n) {\n auto node = dynamic_cast<ExpressionChildNode*>(n);\n if (node->getChildren().size() != 0) n = interpretExpression(node);\n });\n auto arity = op->getArity();\n Object* result;\n if (arity == UNARY) {\n Object* operand = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operand);\n } else if (arity == BINARY) {\n Object* operandLeft = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[1])->t.typeData);\n Object* operandRight = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operandLeft, operandRight);\n } else if (arity == TERNARY) {\n Object* operand1 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[2])->t.typeData);\n Object* operand2 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[1])->t.typeData);\n Object* operand3 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operand1, operand2, operand3);\n }\n return new ExpressionChildNode(Token(result, UNPROCESSED, -2));\n }\n return nullptr;\n }\n \n };\n \n} \/* namespace lang *\/\n\nvoid printHelp() {\n print(\n \"Use -c to read from constants.data and inputs.data, -e [CODE] to evaluate code and -f [PATH] to load code from a file.\\n\",\n \"Examples:\\n\",\n \" lang -c\\n\",\n \" lang -e \\\"if true != false do 1 + 1; end\\\"\\n\",\n \" lang -f \\\"\/path\/to\/file.txt\\\"\\n\"\n );\n}\n\nint main(int argc, char** argv) {\n if (argc == 1) {\n printHelp();\n return 1;\n }\n else if (std::string(argv[1]) == \"-c\") getConstants();\n else if (std::string(argv[1]) == \"-e\") INPUT = argv[2];\n else if (std::string(argv[1]) == \"-f\") {\n std::ifstream in(argv[2]);\n std::string contents((std::istreambuf_iterator<char>(in)), std::istreambuf_iterator<char>());\n INPUT = contents;\n } else {\n printHelp();\n return 1;\n }\n try {\n lang::Parser a(INPUT);\n lang::Interpreter in(a.tree);\n } catch(SyntaxError& se) {\n print(se.toString(), \"\\n\");\n } catch(TypeError& te) {\n print(te.toString(), \"\\n\");\n }\n return 0;\n}\n<commit_msg>Added line comments with \/\/<commit_after>#include <iostream>\n#include <fstream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <functional>\n#include <unordered_map>\n\n#include \"global.hpp\"\n#include \"operators.hpp\"\n#include \"tokens.hpp\"\n#include \"nodes.hpp\"\n#include \"builtins.hpp\"\n\nnamespace lang {\n \n class Parser {\n private:\n std::vector<Token> tokens {};\n inline void skipCharacters(unsigned int& i, int by) {i += by;}\n \/\/ If we're already at the next character, but the loop will increment i by 1\n inline void preventIncrement(unsigned int& i) {i--;}\n \n std::vector<Token> variables {};\n std::vector<std::string> keywords {\"define\", \"if\", \"while\"};\n std::vector<std::string> constructKeywords {\"do\", \"end\", \"else\"};\n public:\n AST tree = AST();\n \n Parser(std::string code) {\n if (PARSER_PRINT_INPUT) print(code, \"\\n\");\n try {\n tokenize(code);\n if (PARSER_PRINT_TOKENS) for (auto tok : tokens) print(tok, \"\\n\");\n if (PARSER_PRINT_AS_EXPR) for (auto tok : ExpressionNode(tokens).getRPNOutput()) print(tok.data, \" \");\n buildTree(tokens);\n } catch (SyntaxError &e) {\n print(e.toString(), \"\\n\");\n }\n }\n \n void tokenize(std::string code) {\n unsigned int lines = 0;\n for (unsigned int i = 0; i < code.length(); ++i) {\n if (code[i] == '\/' && code[i + 1] == '\/') while(code[i] != '\\n' && code[i] != '\\0') skipCharacters(i, 1);\n if (code[i] == '\\n') lines++;\n \n \/\/ Ignore whitespace\n if (isspace(code[i])) continue;\n \n \/\/ Block begin\/end\n \/\/ Parenthesis\n \/\/ Semicolons\n if (code[i] == '{' || code[i] == '}' ||\n code[i] == '(' || code[i] == ')' ||\n code[i] == ';') {\n tokens.push_back(Token(std::string(1, code[i]), CONSTRUCT, lines));\n continue;\n }\n \n \/\/ Operators\n auto initTokSize = tokens.size();\n std::for_each(opList.begin(), opList.end(), [this, initTokSize, code, i, lines](Operator& op) {\n if (initTokSize < tokens.size()) return; \/\/ If there are more tokens than before for_each, the operator was already added, so return.\n if (op.toString().length() + i > code.length()) return; \/\/ If the operator is longer than the source string, ignore it.\n if (op.toString() == code.substr(i, op.toString().length())) {\n Operator* tmp = &op;\n \/\/ TODO: apply DRY on these ifs\n if (tmp->toString() == \"++\" || tmp->toString() == \"--\") {\n \/\/ Prefix version\n if (tokens.back().type == OPERATOR || tokens.back().type == CONSTRUCT) tmp = new Operator(tmp->toString(), 12, ASSOCIATE_FROM_RIGHT, UNARY);\n \/\/ Postfix version\n else tmp = new Operator(tmp->toString(), 13, ASSOCIATE_FROM_RIGHT, UNARY);\n }\n if (tmp->toString() == \"+\" || tmp->toString() == \"-\") {\n \/\/ Unary version\n if (tokens.back().type == OPERATOR || tokens.back().type == CONSTRUCT) tmp = new Operator(tmp->toString(), 12, ASSOCIATE_FROM_RIGHT, UNARY);\n \/\/ Binary version\n else tmp = new Operator(tmp->toString(), 10);\n }\n if (PARSER_PRINT_OPERATOR_TOKENS) print(\"Parser found Token with Operator \", *tmp, \", at address \", tmp, \"\\n\");\n tokens.push_back(Token(tmp, OPERATOR, lines));\n }\n });\n \n if (initTokSize < tokens.size()) {\n skipCharacters(i, tokens.back().data.length() - 1);\n continue; \/\/ Token added, continue.\n }\n \n \/\/ Numbers\n if (isdigit(code[i])) {\n int base = 10;\n std::string current = \"\";\n if (code[i] == '0') {\n switch (code[i + 1]) {\n case 'x': base = 16; skipCharacters(i, 2); break;\n case 'b': base = 2; skipCharacters(i, 2); break;\n case 'o': base = 8; skipCharacters(i, 2); break;\n default: break;\n }\n }\n bool isFloat = false;\n while (isdigit(code[i]) || code[i] == '.') {\n current += code[i];\n if (code[i] == '.') {\n if (isFloat) throw SyntaxError(\"Malformed float, multiple decimal points: \\\"\" + current + \"\\\"\", lines);\n isFloat = true;\n }\n skipCharacters(i, 1);\n }\n preventIncrement(i);\n if (current[current.length() - 1] == '.') throw SyntaxError(\"Malformed float, missing digits after decimal point: \\\"\" + current + \"\\\"\", lines);\n if (base != 10 && isFloat) throw SyntaxError(\"Floating point numbers must be used with base 10 numbers: \\\"\" + current + \"\\\"\", lines);\n Token t;\n if (isFloat) t = Token(new Float(current), FLOAT, lines);\n else t = Token(new Integer(current, base), INTEGER, lines);\n tokens.push_back(t);\n continue;\n }\n \n \/\/ String literals\n if (code[i] == '\"') {\n skipCharacters(i, 1); \/\/ Skip the double quote\n std::string current = \"\";\n while (code[i] != '\"') {\n \/\/ TODO: add escape sequences\n current += code[i];\n skipCharacters(i, 1);\n }\n \/\/ Don't call preventIncrement here so the other double quote is skipped\n tokens.push_back(Token(new String(current), STRING, lines));\n continue;\n }\n \n \/\/ Others\n Token token = Token();\n while (!isspace(code[i])) {\n if (isReservedChar(code[i]) || code[i] == '\\0') break;\n token.data += code[i];\n skipCharacters(i, 1);\n }\n \/\/ Check if the thing is a Boolean\n if (token.data == \"true\" || token.data == \"false\") {\n token.type = BOOLEAN;\n token.typeData = new Boolean(token.data);\n }\n \/\/ Check if the thing references a variable\n for (auto tok : variables)\n if (tok.data == token.data) {\n token = tok;\n break;\n }\n \/\/ Check if the thing is a new variable\n if (tokens.size() > 0 && ((tokens.back().type == KEYWORD && tokens.back().data == \"define\") || tokens.back().type == TYPE)) {\n token.type = VARIABLE;\n token.typeData = new Variable();\n variables.push_back(token);\n }\n \/\/ Check if the thing is a keyword\n if (contains(token.data, keywords)) token.type = KEYWORD;\n if (contains(token.data, constructKeywords)) token.type = CONSTRUCT;\n \n \/\/ Push token\n preventIncrement(i);\n token.line = lines;\n tokens.push_back(token);\n }\n }\n \n ExpressionNode* evaluateCondition(std::vector<Token>& toks) {\n std::vector<Token> exprToks = std::vector<Token>(toks.begin() + 1, toks.end() - 1);\n ExpressionNode* condition = new ExpressionNode(exprToks);\n condition->buildSubtree();\n return condition;\n }\n \n void buildTree(std::vector<Token> tokens) {\n static std::vector<BlockNode*> blockStack {};\n auto addToBlock = [this](ASTNode* child) {\n if (blockStack.size() == 0) tree.addRootChild(child);\n else blockStack.back()->addChild(child);\n };\n auto logicalLines = splitVector(tokens, isNewLine);\n for (uint64 i = 0; i < logicalLines.size(); i++) {\n std::vector<Token>& toks = logicalLines[i];\n if (toks.size() == 0) continue;\n \/\/ TODO: check for solid types here as well\n if (toks[0].data == \"define\" && toks[0].type == KEYWORD) {\n DeclarationNode* decl = new DeclarationNode(\"define\", toks[1]);\n decl->setLineNumber(toks[1].line);\n if (toks[2].data != \";\" || toks[2].type != CONSTRUCT) {\n std::vector<Token> exprToks(toks.begin() + 1, toks.end());\n ExpressionNode* expr = new ExpressionNode(exprToks);\n expr->buildSubtree();\n decl->addChild(expr);\n }\n if (PARSER_PRINT_DECL_TREE) decl->printTree(blockStack.size());\n addToBlock(decl);\n } else if (toks[0].data == \"while\" && toks[0].type == KEYWORD) {\n auto wBlock = new WhileNode(evaluateCondition(toks), new BlockNode());\n if (PARSER_PRINT_WHILE_TREE) wBlock->printTree(blockStack.size());\n addToBlock(wBlock);\n blockStack.push_back(wBlock);\n } else if (toks[0].data == \"if\" && toks[0].type == KEYWORD) {\n auto cBlock = new ConditionalNode(evaluateCondition(toks), new BlockNode(), new BlockNode());\n if (PARSER_PRINT_COND_TREE) cBlock->printTree(blockStack.size());\n addToBlock(cBlock);\n blockStack.push_back(cBlock);\n } else if (toks[0].data == \"else\" && toks[0].type == CONSTRUCT) {\n auto cNode = dynamic_cast<ConditionalNode*>(blockStack.back());\n if (cNode == nullptr) throw SyntaxError(\"Cannot find conditional structure for token `else`.\\n\", blockStack.back()->getLineNumber());\n cNode->nextBlock();\n } else if (toks[0].data == \"end\" && toks[0].type == CONSTRUCT) {\n blockStack.pop_back();\n } else {\n ExpressionNode* expr = new ExpressionNode(toks);\n expr->buildSubtree();\n expr->setLineNumber(dynamic_cast<ExpressionChildNode*>(expr->getChildren()[0])->t.line);\n if (PARSER_PRINT_EXPR_TREE) expr->printTree(blockStack.size());\n addToBlock(expr);\n }\n }\n }\n \n std::vector<Token> getTokens() {\n return tokens;\n }\n \n };\n \n class Interpreter {\n private:\n AST tree;\n \/\/ TODO: implement some scope\n std::unordered_map<std::string, Variable*> globalVars {};\n public:\n Interpreter(AST tree): tree(tree) {\n interpret(tree.getRootChildren());\n }\n private:\n void interpret(ChildrenNodes nodes) {\n for (uint64 i = 0; i < nodes.size(); ++i) {\n auto nodeType = nodes[i]->getNodeType();\n if (nodeType == \"ExpressionNode\") {\n interpretExpression(dynamic_cast<ExpressionChildNode*>(nodes[i]->getChildren()[0]))->printTree(0);\n } else if (nodeType == \"DeclarationNode\") {\n registerDeclaration(dynamic_cast<DeclarationNode*>(nodes[i]));\n } else if (nodeType == \"ConditionalNode\") {\n resolveCondition(dynamic_cast<ConditionalNode*>(nodes[i]));\n } else if (nodeType == \"WhileNode\") {\n doWhileLoop(dynamic_cast<WhileNode*>(nodes[i]));\n }\n }\n }\n \n void doWhileLoop(WhileNode* node) {\n while (true) {\n auto condition = interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getCondition()->getChild()));\n if (!static_cast<Object*>(condition->t.typeData)->isTruthy()) break;\n interpret(node->getLoopNode()->getChildren());\n }\n }\n \n void resolveCondition(ConditionalNode* node) {\n auto condRes = interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getCondition()->getChild()));\n if (static_cast<Object*>(condRes->t.typeData)->isTruthy()) {\n interpret(node->getTrueBlock()->getChildren());\n } else {\n interpret(node->getFalseBlock()->getChildren());\n }\n }\n \n void registerDeclaration(DeclarationNode* node) {\n globalVars.insert({node->identifier.data, static_cast<Variable*>(node->identifier.typeData)});\n if (node->getChildren().size() == 1) {\n globalVars[node->identifier.data]->assign(\n static_cast<Object*>(interpretExpression(dynamic_cast<ExpressionChildNode*>(node->getChild()->getChildren()[0]))->t.typeData)\n );\n }\n }\n \n ExpressionChildNode* interpretExpression(ExpressionChildNode* node) {\n if (node->getChildren().size() == 0) return node;\n if (node->t.type == OPERATOR) {\n Operator* op = static_cast<Operator*>(node->t.typeData);\n auto ch = node->getChildren();\n std::for_each(ch.begin(), ch.end(), [this](ASTNode*& n) {\n auto node = dynamic_cast<ExpressionChildNode*>(n);\n if (node->getChildren().size() != 0) n = interpretExpression(node);\n });\n auto arity = op->getArity();\n Object* result;\n if (arity == UNARY) {\n Object* operand = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operand);\n } else if (arity == BINARY) {\n Object* operandLeft = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[1])->t.typeData);\n Object* operandRight = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operandLeft, operandRight);\n } else if (arity == TERNARY) {\n Object* operand1 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[2])->t.typeData);\n Object* operand2 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[1])->t.typeData);\n Object* operand3 = static_cast<Object*>(dynamic_cast<ExpressionChildNode*>(ch[0])->t.typeData);\n result = runOperator(op, operand1, operand2, operand3);\n }\n return new ExpressionChildNode(Token(result, UNPROCESSED, -2));\n }\n return nullptr;\n }\n \n };\n \n} \/* namespace lang *\/\n\nvoid printHelp() {\n print(\n \"Use -c to read from constants.data and inputs.data, -e [CODE] to evaluate code and -f [PATH] to load code from a file.\\n\",\n \"Examples:\\n\",\n \" lang -c\\n\",\n \" lang -e \\\"if true != false do 1 + 1; end\\\"\\n\",\n \" lang -f \\\"\/path\/to\/file.txt\\\"\\n\"\n );\n}\n\nint main(int argc, char** argv) {\n if (argc == 1) {\n printHelp();\n return 1;\n }\n else if (std::string(argv[1]) == \"-c\") getConstants();\n else if (std::string(argv[1]) == \"-e\") INPUT = argv[2];\n else if (std::string(argv[1]) == \"-f\") {\n std::ifstream in(argv[2]);\n std::string contents((std::istreambuf_iterator<char>(in)), std::istreambuf_iterator<char>());\n INPUT = contents;\n } else {\n printHelp();\n return 1;\n }\n try {\n lang::Parser a(INPUT);\n lang::Interpreter in(a.tree);\n } catch(SyntaxError& se) {\n print(se.toString(), \"\\n\");\n } catch(TypeError& te) {\n print(te.toString(), \"\\n\");\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <opencv2\/opencv.hpp>\n\n#include \"DB.hpp\"\n#include \"Image.hpp\"\n#include \"Mosaic.hpp\"\n\nint main()\n{\n\t\/\/ Setup directory and folder paths, no recursive solution yet\n\tstring image_name = \"zlatan_blue_background_1920x1080.jpg\";\n\n\t\/\/ ----> Directory for: KRISTOFER <-----\n\t\/\/string mainDirectory = \"C:\/Users\/StoffesBok\/Bilddatabaser_TNM025\/dataset\/\";\n\t\/\/cv::Mat image_temp = imread(\"C:\/Users\/StoffesBok\/Bilddatabaser_TNM025\/dataset\/zlatan\/zlatan_blue_background_1920x1080.jpg\", 1);\n\n\t\/\/ ----> Directory for: GABRIEL <-----\n\t\/\/string mainDirectory = \"C:\/Users\/Gabriel\/Desktop\/Bildatabaser\/Bilddatabaser_TNM025\/dataset\/\";\n\t\/\/cv::Mat image_temp = imread(\"C:\/Users\/Gabriel\/Desktop\/Bildatabaser\/Bilddatabaser_TNM025\/dataset\/zlatan\/\" + image_name, 1);\n\n\tif (!image_temp.data){\n\t\tcout << \"Zlatan is too big!\" << endl; return -1;\n\t}\n\t\n\tvector<string> inputFolders = { \"animal2\", \"beach2\", \"cat2\", \"colorful2\",\n\t\t\t\t\t\t\t\t \"doll2\", \"elegant2\", \"flower2\", \"food2\", \"formal2\", \"garden2\" };\n\tvector<string> animalFolder = { \"animal2\" };\n\n\t\/\/ Initilize the database\n\tDB database = DB();\n\tdatabase.loadImages(mainDirectory, inputFolders);\n\t\n\t\/\/DB zlatan_DB = DB(image_temp, 32);\n\t\/\/zlatan_DB.reconstructImageFromDB(zlatan_DB, image_name);\n\t\n\t\/\/ A test for color histogram\n\t\/*Mat src = imread(\"test.png\", 1)\n\tcout << \"Total: \" << src.total() << endl;\n\n\tint r_bins = 2;\n\tint g_bins = 2;\n\tint b_bins = 2;\n\tconst int hist_size[] = { r_bins, g_bins, b_bins };\n\n\tfloat r_range[] = { 0, 255 };\n\tfloat g_range[] = { 0, 255 };\n\tfloat b_range[] = { 0, 255 };\n\tconst float *hist_range[] = { r_range, g_range, b_range };\n\n\tcv::Mat histos;\n\n\tbool uniform = true;\n\tbool accumulate = false;\n\tint channels[] = { 0, 1, 2 };\n\t\/\/ Check if channels and dims is correct\n\tcalcHist(&src, 1, channels, Mat(), histos, 3, hist_size, hist_range, uniform, accumulate);\n\t\n\t\/\/cout << \"size\" << histos.size[0] << endl;\n\t\/\/cout << \" x \" << histos.size[1] << endl;\n\t\/\/cout << \" x \" << histos.size[2] << endl;\n\n\tfor (int i = 0; i < 2; i++)\n\t{\n\t\tfor (int j = 0; j < 2; j++)\n\t\t{\n\t\t\tfor (int k = 0; k < 2; k++)\n\t\t\t{\t\n\t\t\t\tcout << \"B: \" << i << endl;\n\t\t\t\tcout << \"G: \" << j << endl;\n\t\t\t\tcout << \"R: \" << k << endl;\n\t\t\t\tcout << histos.at<Vec3b>(i, j, k) << \" \" << endl;\n\t\t\t}\n\t\t}\t\t\n\n\n\t}\n\t*\/\n\n\tsystem(\"pause\");\n\treturn 0;\n}<commit_msg>Removed old code<commit_after>#include <iostream>\n#include <opencv2\/opencv.hpp>\n\n#include \"DB.hpp\"\n#include \"Image.hpp\"\n#include \"Mosaic.hpp\"\n\nint main()\n{\n\t\/\/ Setup directory and folder paths, no recursive solution yet\n\tstring image_name = \"zlatan_blue_background_1920x1080.jpg\";\n\n\t\/\/ ----> Directory for: KRISTOFER <-----\n\t\/\/string mainDirectory = \"C:\/Users\/StoffesBok\/Bilddatabaser_TNM025\/dataset\/\";\n\t\/\/cv::Mat image_temp = imread(\"C:\/Users\/StoffesBok\/Bilddatabaser_TNM025\/dataset\/zlatan\/zlatan_blue_background_1920x1080.jpg\", 1);\n\n\t\/\/ ----> Directory for: GABRIEL <-----\n\tstring mainDirectory = \"C:\/Users\/Gabriel\/Desktop\/Bildatabaser\/Bilddatabaser_TNM025\/dataset\/\";\n\tcv::Mat image_temp = imread(\"C:\/Users\/Gabriel\/Desktop\/Bildatabaser\/Bilddatabaser_TNM025\/dataset\/zlatan\/\" + image_name, 1);\n\n\tif (!image_temp.data){\n\t\tcout << \"Zlatan is too big!\" << endl; return -1;\n\t}\n\t\n\tvector<string> inputFolders = { \"animal2\", \"beach2\", \"cat2\", \"colorful2\",\n\t\t\t\t\t\t\t\t \"doll2\", \"elegant2\", \"flower2\", \"food2\", \"formal2\", \"garden2\" };\n\tvector<string> animalFolder = { \"animal2\" };\n\n\t\/\/ Initilize the database\n\tDB database = DB();\n\tdatabase.loadImages(mainDirectory, inputFolders);\n\t\n\t\/\/DB zlatan_DB = DB(image_temp, 32);\n\t\/\/zlatan_DB.reconstructImageFromDB(zlatan_DB, image_name);\n\n\n\tsystem(\"pause\");\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"Compiler.h\"\n#include <fstream>\n#include <cstring>\n\nusing namespace std;\nusing namespace compiler;\n\nint main(int argc, char *argv[])\n{\n Backend backend = Backend::PPRINTER;\n vector<string> input;\n string output(\"a.out\");\n string header_output(\"a.h\");\n\n for (int i = 1; i < argc; i++)\n {\n if (strcmp(argv[i],\"--help\") == 0)\n {\n cout << \"Usage: \" << argv[0] << \"[options] [@input-file] [@output-file]\" << endl;\n cout << \"Options:\" << endl;\n#ifdef CCPP\n cout << \"\\t--cpp\\t\\t\\tC++ backend\" << endl;\n#endif\n#ifdef CGNUASM\n cout << \"\\t--gnuasm\\t\\tGNU Assembly backend\" << endl;\n#endif\n#ifdef CHASKELL\n cout << \"\\t--haskell\\t\\tHaskell backend\" << endl;\n#endif\n#ifdef CLLVM\n cout << \"\\t--llvm\\t\\t\\tLLVM backend\" << endl;\n#endif\n cout << \"\\t--pprinter\\t\\tPretty printer backend\" << endl;\n return 0;\n }\n#ifdef CCPP\n else if (strcmp(argv[i],\"--cpp\") == 0)\n backend = Backend::CPP;\n#endif\n#ifdef CGNUASM\n else if (strcmp(argv[i],\"--gnuasm\") == 0)\n backend = Backend::GNUASM;\n#endif\n#ifdef CHASKELL\n else if (strcmp(argv[i],\"--haskell\") == 0)\n backend = Backend::GNUASM;\n#endif\n#ifdef CLLVM\n else if (strcmp(argv[i],\"--llvm\") == 0)\n backend = Backend::LLVM;\n#endif\n else if (strcmp(argv[i],\"--pprinter\") == 0)\n backend = Backend::PPRINTER;\n else if (strcmp(argv[i],\"--output\") == 0 || strcmp(argv[i],\"-o\") == 0)\n output = argv[++i];\n else if (strcmp(argv[i],\"--header-output\") == 0 || strcmp(argv[i],\"-ho\") == 0)\n header_output = argv[++i];\n else\n input.push_back(argv[i]);\n }\n\n if (input.size() == 0)\n {\n cerr << \"No input files\" << endl;\n return 1;\n }\n\n ifstream in(input[0]);\n ofstream out(output);\n ofstream hout(header_output);\n\n compiler::Compiler compiler(&in, &out, &hout);\n compiler.set_backend(backend);\n\n compiler.compile();\n\n return 0;\n}\n<commit_msg>compiler: added error handling for file input<commit_after>#include \"Compiler.h\"\n#include <fstream>\n#include <cstring>\n\nusing namespace std;\nusing namespace compiler;\n\nint main(int argc, char *argv[])\n{\n Backend backend = Backend::PPRINTER;\n vector<string> input;\n string output(\"a.out\");\n string header_output(\"a.h\");\n\n for (int i = 1; i < argc; i++)\n {\n if (strcmp(argv[i],\"--help\") == 0)\n {\n cout << \"Usage: \" << argv[0] << \"[options] [@input-file] [@output-file]\" << endl;\n cout << \"Options:\" << endl;\n#ifdef CCPP\n cout << \"\\t--cpp\\t\\t\\tC++ backend\" << endl;\n#endif\n#ifdef CGNUASM\n cout << \"\\t--gnuasm\\t\\tGNU Assembly backend\" << endl;\n#endif\n#ifdef CHASKELL\n cout << \"\\t--haskell\\t\\tHaskell backend\" << endl;\n#endif\n#ifdef CLLVM\n cout << \"\\t--llvm\\t\\t\\tLLVM backend\" << endl;\n#endif\n cout << \"\\t--pprinter\\t\\tPretty printer backend\" << endl;\n return 0;\n }\n#ifdef CCPP\n else if (strcmp(argv[i],\"--cpp\") == 0)\n backend = Backend::CPP;\n#endif\n#ifdef CGNUASM\n else if (strcmp(argv[i],\"--gnuasm\") == 0)\n backend = Backend::GNUASM;\n#endif\n#ifdef CHASKELL\n else if (strcmp(argv[i],\"--haskell\") == 0)\n backend = Backend::GNUASM;\n#endif\n#ifdef CLLVM\n else if (strcmp(argv[i],\"--llvm\") == 0)\n backend = Backend::LLVM;\n#endif\n else if (strcmp(argv[i],\"--pprinter\") == 0)\n backend = Backend::PPRINTER;\n else if (strcmp(argv[i],\"--output\") == 0 || strcmp(argv[i],\"-o\") == 0)\n if (i < argc - 1)\n output = argv[++i];\n else {\n cerr << \"No output file specified\" << endl;\n return 2;\n }\n else if (strcmp(argv[i],\"--header-output\") == 0 || strcmp(argv[i],\"-ho\") == 0)\n if (i < argc - 1)\n header_output = argv[++i];\n else {\n cerr << \"No output header specified\" << endl;\n return 3;\n }\n else\n input.push_back(argv[i]);\n }\n\n if (input.size() == 0)\n {\n cerr << \"No input files\" << endl;\n return 1;\n }\n\n ifstream in(input[0]);\n ofstream out(output);\n ofstream hout(header_output);\n\n compiler::Compiler compiler(&in, &out, &hout);\n compiler.set_backend(backend);\n\n compiler.compile();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\r\n#include \"Engine.h\"\r\n#include \"GLSLGenerator.h\"\r\n#include \"HLSLParser.h\"\r\n#include \"HLSLTree.h\"\r\n\r\n#include <fstream>\r\n#include <sstream>\r\n#include <iostream>\r\n\r\nM4::Allocator allocator;\r\n\r\nstd::string ReadFile(const char* fileName)\r\n{\r\n std::ifstream ifs(fileName);\r\n std::stringstream buffer;\r\n buffer << ifs.rdbuf();\r\n return buffer.str();\r\n}\r\n\r\nvoid PrintUsage()\r\n{\r\n std::cerr << \"usage: hlslparser [-h] [-fs | -vs] FILENAME ENTRYNAME\\n\"\r\n << \"\\n\"\r\n << \"Translate HLSL shader to GLSL shader.\\n\"\r\n << \"\\n\"\r\n << \"positional arguments:\\n\"\r\n << \" FILENAME input file name\\n\"\r\n << \" ENTRYNAME entry point of the shader\\n\"\r\n << \"\\n\"\r\n << \"optional arguments:\\n\"\r\n << \" -h, --help show this help message and exit\\n\"\r\n << \" -fs generate fragment shader (default)\\n\"\r\n << \" -vs generate vertex shader\\n\";\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n using namespace M4;\r\n\r\n \/\/ Parse arguments\r\n const char* fileName = NULL;\r\n const char* entryName = NULL;\r\n GLSLGenerator::Target target = GLSLGenerator::Target_FragmentShader;\r\n\r\n for (int argn = 1; argn < argc; ++argn)\r\n {\r\n const char* const arg = argv[argn];\r\n\r\n if (String_Equal(arg, \"-h\") || String_Equal(arg, \"--help\"))\r\n {\r\n PrintUsage();\r\n return 0;\r\n }\r\n else if (String_Equal(arg, \"-fs\"))\r\n {\r\n target = GLSLGenerator::Target_FragmentShader;\r\n }\r\n else if (String_Equal(arg, \"-vs\"))\r\n {\r\n target = GLSLGenerator::Target_VertexShader;\r\n }\r\n else if (fileName == NULL)\r\n {\r\n fileName = arg;\r\n }\r\n else if (entryName == NULL)\r\n {\r\n entryName = arg;\r\n }\r\n else\r\n {\r\n Log_Error(\"Too many arguments\");\r\n PrintUsage();\r\n return 1;\r\n }\r\n }\r\n\r\n if (fileName == NULL || entryName == NULL)\r\n {\r\n Log_Error(\"Missing arguments\");\r\n PrintUsage();\r\n return 1;\r\n }\r\n\r\n \/\/ Read input file\r\n const std::string source = ReadFile(fileName);\r\n\r\n \/\/ Parse input file\r\n Allocator allocator;\r\n HLSLParser parser(&allocator, fileName, source.data(), source.size());\r\n HLSLTree tree(&allocator);\r\n if (!parser.Parse(&tree))\r\n {\r\n Log_Error(\"Parsing failed, aborting\");\r\n return 1;\r\n }\r\n\r\n \/\/ Generate output\r\n GLSLGenerator generator(&allocator);\r\n generator.Generate(&tree, target, entryName);\r\n std::cout << generator.GetResult();\r\n\r\n return 0;\r\n}\r\n\r\n<commit_msg>Initial extern function for emscripten to be called by JS<commit_after>\r\n#include \"Engine.h\"\r\n#include \"GLSLGenerator.h\"\r\n#include \"HLSLParser.h\"\r\n#include \"HLSLTree.h\"\r\n\r\n\/*\r\nTODO\r\n- type\r\n- filename\r\n- file contents\r\n- entry name\r\n\r\nparseHLSL2GLSL\r\n*\/\r\n\r\nextern \"C\" {\r\n\r\n int parse(char* source, char* fileName, char* entryName)\r\n {\r\n using namespace M4;\r\n\r\n Log_Error(source);\r\n Log_Error(\"..fileName...\\n\");\r\n\r\n GLSLGenerator::Target target = GLSLGenerator::Target_FragmentShader;\r\n\r\n \/\/ Parse input file\r\n Allocator allocator;\r\n HLSLParser parser(&allocator, fileName, source, strlen(source));\r\n HLSLTree tree(&allocator);\r\n if (!parser.Parse(&tree))\r\n {\r\n Log_Error(\"Parsing failed, aborting\");\r\n return 1;\r\n }\r\n\r\n \/\/ Generate output\r\n GLSLGenerator generator(&allocator);\r\n if (!generator.Generate(&tree, target, entryName)) {\r\n Log_Error(\"Generation error.\\n\");\r\n return EXIT_FAILURE;\r\n }\r\n Log_Error(generator.GetResult());\r\n\r\n return 0;\r\n }\r\n\r\n}\r\n\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2013, Ford Motor Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided with the\n * distribution.\n *\n * Neither the name of the Ford Motor Company nor the names of its contributors\n * may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"application_manager\/message.h\"\n\nnamespace {\nbool BinaryDataPredicate(uint8_t i, uint8_t j) {\n return (i == j);\n}\n}\n\nnamespace application_manager {\n\nMessageType MessageTypeFromRpcType(protocol_handler::RpcType rpc_type) {\n switch (rpc_type) {\n case protocol_handler::kRpcTypeRequest:\n return kRequest;\n case protocol_handler::kRpcTypeResponse:\n return kResponse;\n case protocol_handler::kRpcTypeNotification:\n return kNotification;\n case protocol_handler::kRpcTypeReserved:\n default:\n DCHECK(false);\n return kUnknownType;\n }\n}\n\nMessage::Message(protocol_handler::MessagePriority priority)\n : function_id_(0),\n correlation_id_(0),\n type_(kUnknownType),\n priority_(priority),\n connection_key_(0),\n binary_data_(NULL),\n data_size_(0),\n payload_size_(0),\n version_(kUnknownProtocol) {\n}\n\nMessage::Message(const Message& message)\n : priority_(message.priority_) {\n *this = message;\n}\n\nMessage& Message::operator=(const Message& message) {\n set_function_id(message.function_id_);\n set_correlation_id(message.correlation_id_);\n set_connection_key(message.connection_key_);\n set_message_type(message.type_);\n set_data_size(message.data_size_);\n set_payload_size(message.payload_size_);\n if (message.binary_data_) {\n set_binary_data(message.binary_data_);\n }\n set_json_message(message.json_message_);\n set_protocol_version(message.protocol_version());\n priority_ = message.priority_;\n\n return *this;\n}\n\nbool Message::operator==(const Message& message) {\n bool function_id = function_id_ == message.function_id_;\n bool correlation_id = correlation_id_ == message.correlation_id_;\n bool connection_key = connection_key_ == message.connection_key_;\n bool type = type_ == message.type_;\n bool json_message = json_message_ == message.json_message_;\n bool version = version_ == message.version_;\n bool data_size = data_size_ == message.data_size_;\n bool payload_size = payload_size_ == message.payload_size_;\n\n\n bool binary_data = std::equal(binary_data_->begin(), binary_data_->end(),\n message.binary_data_->begin(),\n BinaryDataPredicate);\n\n return function_id && correlation_id && connection_key && type && binary_data\n && json_message && version && data_size && payload_size;\n}\n\nMessage::~Message() {\n if (binary_data_) {\n delete binary_data_;\n }\n}\n\nint32_t Message::function_id() const {\n return function_id_;\n}\n\nint32_t Message::correlation_id() const {\n return correlation_id_;\n}\n\nint32_t Message::connection_key() const {\n return connection_key_;\n}\n\nMessageType Message::type() const {\n return type_;\n}\n\nProtocolVersion Message::protocol_version() const {\n return version_;\n}\n\nconst std::string& Message::json_message() const {\n return json_message_;\n}\n\nconst BinaryData* Message::binary_data() const {\n return binary_data_;\n}\n\nbool Message::has_binary_data() const {\n return (binary_data_ != NULL);\n}\n\nsize_t Message::data_size() const {\n return data_size_;\n}\n\nsize_t Message::payload_size() const {\n return payload_size_;\n}\n\nvoid Message::set_function_id(int32_t id) {\n function_id_ = id;\n}\n\nvoid Message::set_correlation_id(int32_t id) {\n correlation_id_ = id;\n}\n\nvoid Message::set_connection_key(int32_t key) {\n connection_key_ = key;\n}\n\nvoid Message::set_message_type(MessageType type) {\n type_ = type;\n}\n\nvoid Message::set_binary_data(BinaryData* data) {\n if (NULL == data) {\n NOTREACHED();\n return;\n }\n\n if (binary_data_) {\n delete binary_data_;\n }\n\n binary_data_ = data;\n}\n\nvoid Message::set_json_message(const std::string& json_message) {\n json_message_ = json_message;\n}\n\nvoid Message::set_protocol_version(ProtocolVersion version) {\n version_ = version;\n}\n\nconst smart_objects::SmartObject &Message::smart_object() const {\n return smart_object_;\n}\n\nvoid Message::set_smart_object(const smart_objects::SmartObject& object) {\n smart_object_ = object;\n}\n\nvoid Message::set_data_size(size_t data_size) {\n data_size_ = data_size;\n}\n\nvoid Message::set_payload_size(size_t payload_size) {\n payload_size_ = payload_size;\n}\n} \/\/ namespace application_manager\n<commit_msg>Initialize binary_data_ to NULL (CID 80088)<commit_after>\/*\n * Copyright (c) 2013, Ford Motor Company\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided with the\n * distribution.\n *\n * Neither the name of the Ford Motor Company nor the names of its contributors\n * may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"application_manager\/message.h\"\n\nnamespace {\nbool BinaryDataPredicate(uint8_t i, uint8_t j) {\n return (i == j);\n}\n}\n\nnamespace application_manager {\n\nMessageType MessageTypeFromRpcType(protocol_handler::RpcType rpc_type) {\n switch (rpc_type) {\n case protocol_handler::kRpcTypeRequest:\n return kRequest;\n case protocol_handler::kRpcTypeResponse:\n return kResponse;\n case protocol_handler::kRpcTypeNotification:\n return kNotification;\n case protocol_handler::kRpcTypeReserved:\n default:\n DCHECK(false);\n return kUnknownType;\n }\n}\n\nMessage::Message(protocol_handler::MessagePriority priority)\n : function_id_(0),\n correlation_id_(0),\n type_(kUnknownType),\n priority_(priority),\n connection_key_(0),\n binary_data_(NULL),\n data_size_(0),\n payload_size_(0),\n version_(kUnknownProtocol) {\n}\n\nMessage::Message(const Message& message)\n : priority_(message.priority_),\n binary_data_(NULL) {\n *this = message;\n}\n\nMessage& Message::operator=(const Message& message) {\n set_function_id(message.function_id_);\n set_correlation_id(message.correlation_id_);\n set_connection_key(message.connection_key_);\n set_message_type(message.type_);\n set_data_size(message.data_size_);\n set_payload_size(message.payload_size_);\n if (message.binary_data_) {\n set_binary_data(message.binary_data_);\n }\n set_json_message(message.json_message_);\n set_protocol_version(message.protocol_version());\n priority_ = message.priority_;\n\n return *this;\n}\n\nbool Message::operator==(const Message& message) {\n bool function_id = function_id_ == message.function_id_;\n bool correlation_id = correlation_id_ == message.correlation_id_;\n bool connection_key = connection_key_ == message.connection_key_;\n bool type = type_ == message.type_;\n bool json_message = json_message_ == message.json_message_;\n bool version = version_ == message.version_;\n bool data_size = data_size_ == message.data_size_;\n bool payload_size = payload_size_ == message.payload_size_;\n\n\n bool binary_data = std::equal(binary_data_->begin(), binary_data_->end(),\n message.binary_data_->begin(),\n BinaryDataPredicate);\n\n return function_id && correlation_id && connection_key && type && binary_data\n && json_message && version && data_size && payload_size;\n}\n\nMessage::~Message() {\n if (binary_data_) {\n delete binary_data_;\n }\n}\n\nint32_t Message::function_id() const {\n return function_id_;\n}\n\nint32_t Message::correlation_id() const {\n return correlation_id_;\n}\n\nint32_t Message::connection_key() const {\n return connection_key_;\n}\n\nMessageType Message::type() const {\n return type_;\n}\n\nProtocolVersion Message::protocol_version() const {\n return version_;\n}\n\nconst std::string& Message::json_message() const {\n return json_message_;\n}\n\nconst BinaryData* Message::binary_data() const {\n return binary_data_;\n}\n\nbool Message::has_binary_data() const {\n return (binary_data_ != NULL);\n}\n\nsize_t Message::data_size() const {\n return data_size_;\n}\n\nsize_t Message::payload_size() const {\n return payload_size_;\n}\n\nvoid Message::set_function_id(int32_t id) {\n function_id_ = id;\n}\n\nvoid Message::set_correlation_id(int32_t id) {\n correlation_id_ = id;\n}\n\nvoid Message::set_connection_key(int32_t key) {\n connection_key_ = key;\n}\n\nvoid Message::set_message_type(MessageType type) {\n type_ = type;\n}\n\nvoid Message::set_binary_data(BinaryData* data) {\n if (NULL == data) {\n NOTREACHED();\n return;\n }\n\n if (binary_data_) {\n delete binary_data_;\n }\n\n binary_data_ = data;\n}\n\nvoid Message::set_json_message(const std::string& json_message) {\n json_message_ = json_message;\n}\n\nvoid Message::set_protocol_version(ProtocolVersion version) {\n version_ = version;\n}\n\nconst smart_objects::SmartObject &Message::smart_object() const {\n return smart_object_;\n}\n\nvoid Message::set_smart_object(const smart_objects::SmartObject& object) {\n smart_object_ = object;\n}\n\nvoid Message::set_data_size(size_t data_size) {\n data_size_ = data_size;\n}\n\nvoid Message::set_payload_size(size_t payload_size) {\n payload_size_ = payload_size;\n}\n} \/\/ namespace application_manager\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <algorithm>\n#include <cstring>\n#include <exception>\n#include <fstream>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <sstream>\n#include <utility>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/utility\/string_ref.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/optional.hpp>\n\n#include <visionaray\/detail\/macros.h>\n#include <visionaray\/math\/math.h>\n#include <visionaray\/texture\/texture.h>\n\n#include \"image.h\"\n#include \"obj_loader.h\"\n\nnamespace qi = boost::spirit::qi;\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ boost::fusion-adapt some structs for parsing\n\/\/\n\nnamespace visionaray\n{\nnamespace detail\n{\n\nstruct face_index_t\n{\n int vertex_index;\n boost::optional<int> tex_coord_index;\n boost::optional<int> normal_index;\n};\n\n} \/\/ detail\n} \/\/ visionaray\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::detail::face_index_t,\n (int, vertex_index)\n (boost::optional<int>, tex_coord_index)\n (boost::optional<int>, normal_index)\n)\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::vec2,\n (float, x)\n (float, y)\n)\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::vec3,\n (float, x)\n (float, y)\n (float, z)\n)\n\n\nusing boost::string_ref;\n\nnamespace boost\n{\nnamespace spirit\n{\nnamespace traits\n{\n\ntemplate <typename Iterator, typename Enable>\nstruct assign_to_attribute_from_iterators<string_ref, Iterator, Enable>\n{\n static void call(Iterator const& first, Iterator const& last, string_ref& attr)\n {\n attr = { first, static_cast<size_t>(last - first) };\n }\n};\n\n} \/\/ traits\n} \/\/ spirit\n}\n\n\nnamespace visionaray\n{\n\ntypedef basic_triangle<3, float> triangle_type;\n\nnamespace detail\n{\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a list of triangles\n\/\/\n\naabb bounds(detail::triangle_list const& tris)\n{\n aabb result( vec3(std::numeric_limits<float>::max()), -vec3(std::numeric_limits<float>::max()) );\n\n for (auto const& tri : tris)\n {\n auto v1 = tri.v1;\n auto v2 = tri.v1 + tri.e1;\n auto v3 = tri.v1 + tri.e2;\n\n result = combine(result, aabb(v1, v1));\n result = combine(result, aabb(v2, v2));\n result = combine(result, aabb(v3, v3));\n }\n\n return result;\n}\n\n\n} \/\/ detail\n\nstruct mtl\n{\n vec3 ka;\n vec3 kd;\n vec3 ks;\n float ns;\n std::string map_kd;\n};\n\n\nvoid parse_mtl(std::string const& filename, std::map<std::string, mtl>* matlib)\n{\n std::ifstream ifstr(filename.c_str(), std::ifstream::in);\n std::string line;\n std::map<std::string, mtl>::iterator it;\n\n while (ifstr.good() && !ifstr.eof() && std::getline(ifstr, line))\n {\n boost::algorithm::trim(line);\n std::string identifier;\n std::istringstream str(line);\n str >> identifier >> std::ws;\n\n if (identifier == \"newmtl\")\n {\n std::string name;\n str >> name;\n auto mtl_pair = std::make_pair(name, mtl());\n matlib->insert(mtl_pair);\n it = matlib->find(name);\n }\n else if (identifier == \"Ka\")\n {\n str >> (*it).second.ka.x >> std::ws >> (*it).second.ka.y >> std::ws >> (*it).second.ka.z >> std::ws;\n }\n else if (identifier == \"Kd\")\n {\n str >> (*it).second.kd.x >> std::ws >> (*it).second.kd.y >> std::ws >> (*it).second.kd.z >> std::ws;\n }\n else if (identifier == \"Ks\")\n {\n str >> (*it).second.ks.x >> std::ws >> (*it).second.ks.y >> std::ws >> (*it).second.ks.z >> std::ws;\n }\n else if (identifier == \"Ns\")\n {\n str >> (*it).second.ns >> std::ws;\n }\n else if (identifier == \"map_Kd\")\n {\n str >> (*it).second.map_kd;\n }\n }\n}\n\n\ndetail::obj_scene load_obj(std::string const& filename)\n{\n std::map<std::string, mtl> matlib;\n\n std::ifstream ifstr(filename.c_str(), std::ifstream::in);\n boost::iostreams::mapped_file_source file(filename);\n\n unsigned geom_id = 0;\n\n using namespace detail;\n\n obj_scene result;\n\n using vertex_vector = aligned_vector<vec3>;\n using tex_coord_vector = aligned_vector<vec2>;\n using normal_vector = aligned_vector<vec3>;\n using face_vector = aligned_vector<face_index_t>;\n\n vertex_vector vertices;\n tex_coord_vector tex_coords;\n normal_vector normals;\n face_vector faces;\n\n\n \/\/ intermediate containers\n\n string_ref comment;\n string_ref mtl_file;\n string_ref mtl_name;\n\n\n \/\/ helper functions\n\n auto remap_index = [](int idx, int size) -> int\n {\n return idx < 0 ? static_cast<int>(size) + idx : idx - 1;\n };\n\n auto store_triangle = [&](int i1, int i2, int i3)\n {\n triangle_type tri;\n tri.prim_id = static_cast<unsigned>(result.primitives.size());\n tri.geom_id = geom_id;\n tri.v1 = vertices[i1];\n tri.e1 = vertices[i2] - tri.v1;\n tri.e2 = vertices[i3] - tri.v1;\n result.primitives.push_back(tri);\n };\n\n auto store_faces = [&](int vertices_size, int tex_coords_size, int normals_size)\n {\n size_t last = 2;\n auto i1 = remap_index(faces[0].vertex_index, vertices_size);\n\n while (last != faces.size())\n {\n \/\/ triangle\n auto i2 = remap_index(faces[last - 1].vertex_index, vertices_size);\n auto i3 = remap_index(faces[last].vertex_index, vertices_size);\n store_triangle(i1, i2, i3);\n\n \/\/ texture coordinates\n if (faces[0].tex_coord_index && faces[last - 1].tex_coord_index && faces[last].tex_coord_index)\n {\n auto ti1 = remap_index(*faces[0].tex_coord_index, tex_coords_size);\n auto ti2 = remap_index(*faces[last - 1].tex_coord_index, tex_coords_size);\n auto ti3 = remap_index(*faces[last].tex_coord_index, tex_coords_size);\n\n result.tex_coords.push_back( tex_coords[ti1] );\n result.tex_coords.push_back( tex_coords[ti2] );\n result.tex_coords.push_back( tex_coords[ti3] );\n }\n\n \/\/ normals\n if (faces[0].normal_index && faces[last - 1].normal_index && faces[last].normal_index)\n {\n auto ni1 = remap_index(*faces[0].normal_index, normals_size);\n auto ni2 = remap_index(*faces[last - 1].normal_index, normals_size);\n auto ni3 = remap_index(*faces[last].normal_index, normals_size);\n\n result.normals.push_back( normals[ni1] );\n result.normals.push_back( normals[ni2] );\n result.normals.push_back( normals[ni3] );\n }\n\n ++last;\n }\n };\n\n\n \/\/ obj grammar\n\n using It = string_ref::const_iterator;\n using space_type = decltype(qi::blank);\n\n qi::rule<It> r_unhandled = *(qi::char_ - qi::eol) >> qi::eol;\n qi::rule<It, string_ref()> r_text_to_eol = qi::raw[*(qi::char_ - qi::eol)];\n\n qi::rule<It, string_ref()> r_comment = \"#\" >> r_text_to_eol >> qi::eol;\n qi::rule<It, string_ref(), space_type> r_mtllib = \"mtllib\" >> r_text_to_eol >> qi::eol;\n qi::rule<It, string_ref(), space_type> r_usemtl = \"usemtl\" >> r_text_to_eol >> qi::eol;\n\n qi::rule<It, vec3(), space_type> r_v = \"v\" >> qi::float_ >> qi::float_ >> qi::float_ >> qi::eol;\n qi::rule<It, vec2(), space_type> r_vt = \"vt\" >> qi::float_ >> qi::float_ >> -qi::float_ >> qi::eol;\/\/ TODO: parse optional 3rd (w)\n qi::rule<It, vec3(), space_type> r_vn = \"vn\" >> qi::float_ >> qi::float_ >> qi::float_ >> qi::eol;\n\n qi::rule<It, vertex_vector(), space_type> r_vertices = r_v >> *r_v;\n qi::rule<It, tex_coord_vector(), space_type> r_tex_coords = r_vt >> *r_vt;\n qi::rule<It, normal_vector(), space_type> r_normals = r_vn >> *r_vn;\n\n qi::rule<It, detail::face_index_t()> r_face_vertex = qi::int_ >> -qi::lit(\"\/\") >> -qi::int_ >> -qi::lit(\"\/\") >> -qi::int_;\n qi::rule<It, face_vector(), space_type> r_face = \"f\" >> r_face_vertex >> r_face_vertex >> r_face_vertex >> *r_face_vertex >> qi::eol;\n\n\n string_ref text(file.data(), file.size());\n auto it = text.cbegin();\n\n while (it != text.cend())\n {\n faces.clear();\n\n if ( qi::phrase_parse(it, text.cend(), r_comment, qi::blank, comment) )\n {\n VSNRAY_UNUSED(comment);\n continue;\n }\n else if ( qi::phrase_parse(it, text.cend(), r_mtllib, qi::blank, mtl_file) )\n {\n boost::filesystem::path p(filename);\n std::string mtl_dir = p.parent_path().string();\n\n std::string mtl_path = mtl_dir + \"\/\" + std::string(mtl_file);\n\n parse_mtl(mtl_path, &matlib);\n }\n else if ( qi::phrase_parse(it, text.cend(), r_usemtl, qi::blank, mtl_name) )\n {\n auto mat_it = matlib.find(std::string(mtl_name));\n if (mat_it != matlib.end())\n {\n phong<float> mat;\n mat.set_cd( mat_it->second.kd );\n mat.set_kd( 1.0f );\n mat.set_ks( 1.0f );\n mat.set_specular_exp( mat_it->second.ns );\n result.materials.push_back(mat);\n\n typedef tex_list::value_type tex_type;\n boost::filesystem::path p(filename);\n std::string tex_filename = p.parent_path().string() + \"\/\" + mat_it->second.map_kd;\n\n static const std::string extensions[] = { \".jpg\", \".jpeg\", \".JPG\", \".JPEG\" };\n auto tex_path = boost::filesystem::path(tex_filename);\n auto has_jpg_ext = ( std::find(extensions, extensions + 4, tex_path.extension()) != extensions + 4 );\n\n if (!mat_it->second.map_kd.empty() && boost::filesystem::exists(tex_filename) && has_jpg_ext)\n {\n#if defined(VSNRAY_HAVE_JPEG)\n jpeg_image jpg(tex_filename);\n\n tex_type tex(jpg.width(), jpg.height());\n tex.set_address_mode( Clamp );\n tex.set_filter_mode( Linear );\n\n auto data_ptr = reinterpret_cast<tex_type::value_type const*>(jpg.data());\n tex.set_data(data_ptr);\n\n result.textures.push_back(std::move(tex));\n#endif\n }\n else\n {\n result.textures.push_back(tex_type(0, 0));\n }\n }\n geom_id = result.materials.size() == 0 ? 0 : static_cast<unsigned>(result.materials.size() - 1);\n }\n else if ( qi::phrase_parse(it, text.cend(), r_vertices, qi::blank, vertices) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_tex_coords, qi::blank, tex_coords) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_normals, qi::blank, normals) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_face, qi::blank, faces) )\n {\n store_faces(static_cast<int>(vertices.size()), static_cast<int>(tex_coords.size()), static_cast<int>(normals.size()));\n }\n else if ( qi::phrase_parse(it, text.cend(), r_unhandled, qi::blank) )\n {\n continue;\n }\n }\n\n\/\/ TODO\n\n result.normals.resize(0); \/\/ TODO: support for vertex normals\n if (result.normals.size() == 0) \/\/ have no default normals\n {\n for (auto const& tri : result.primitives)\n {\n vec3 n = normalize( cross(tri.e1, tri.e2) );\n result.normals.push_back(n);\n }\n }\n\n if (result.materials.size() == 0)\n {\n for (unsigned i = 0; i <= geom_id; ++i)\n {\n phong<float> m;\n m.set_cd( vec3(0.8f, 0.8f, 0.8f) );\n m.set_kd( 1.0f );\n m.set_ks( 1.0f );\n m.set_specular_exp( 32.0f );\n result.materials.push_back(m);\n }\n }\n\/\/ TODO\n\n result.bbox = bounds(result.primitives);\n return result;\n}\n\n} \/\/ visionaray\n<commit_msg>Obj allows vec4 vertices<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <algorithm>\n#include <cstring>\n#include <exception>\n#include <fstream>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <sstream>\n#include <utility>\n\n#include <boost\/algorithm\/string.hpp>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/iostreams\/device\/mapped_file.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/utility\/string_ref.hpp>\n#include <boost\/filesystem.hpp>\n#include <boost\/optional.hpp>\n\n#include <visionaray\/detail\/macros.h>\n#include <visionaray\/math\/math.h>\n#include <visionaray\/texture\/texture.h>\n\n#include \"image.h\"\n#include \"obj_loader.h\"\n\nnamespace qi = boost::spirit::qi;\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ boost::fusion-adapt some structs for parsing\n\/\/\n\nnamespace visionaray\n{\nnamespace detail\n{\n\nstruct face_index_t\n{\n int vertex_index;\n boost::optional<int> tex_coord_index;\n boost::optional<int> normal_index;\n};\n\n} \/\/ detail\n} \/\/ visionaray\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::detail::face_index_t,\n (int, vertex_index)\n (boost::optional<int>, tex_coord_index)\n (boost::optional<int>, normal_index)\n)\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::vec2,\n (float, x)\n (float, y)\n)\n\nBOOST_FUSION_ADAPT_STRUCT\n(\n visionaray::vec3,\n (float, x)\n (float, y)\n (float, z)\n)\n\n\nusing boost::string_ref;\n\nnamespace boost\n{\nnamespace spirit\n{\nnamespace traits\n{\n\ntemplate <typename Iterator, typename Enable>\nstruct assign_to_attribute_from_iterators<string_ref, Iterator, Enable>\n{\n static void call(Iterator const& first, Iterator const& last, string_ref& attr)\n {\n attr = { first, static_cast<size_t>(last - first) };\n }\n};\n\n} \/\/ traits\n} \/\/ spirit\n}\n\n\nnamespace visionaray\n{\n\ntypedef basic_triangle<3, float> triangle_type;\n\nnamespace detail\n{\n\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ aabb of a list of triangles\n\/\/\n\naabb bounds(detail::triangle_list const& tris)\n{\n aabb result( vec3(std::numeric_limits<float>::max()), -vec3(std::numeric_limits<float>::max()) );\n\n for (auto const& tri : tris)\n {\n auto v1 = tri.v1;\n auto v2 = tri.v1 + tri.e1;\n auto v3 = tri.v1 + tri.e2;\n\n result = combine(result, aabb(v1, v1));\n result = combine(result, aabb(v2, v2));\n result = combine(result, aabb(v3, v3));\n }\n\n return result;\n}\n\n\n} \/\/ detail\n\nstruct mtl\n{\n vec3 ka;\n vec3 kd;\n vec3 ks;\n float ns;\n std::string map_kd;\n};\n\n\nvoid parse_mtl(std::string const& filename, std::map<std::string, mtl>* matlib)\n{\n std::ifstream ifstr(filename.c_str(), std::ifstream::in);\n std::string line;\n std::map<std::string, mtl>::iterator it;\n\n while (ifstr.good() && !ifstr.eof() && std::getline(ifstr, line))\n {\n boost::algorithm::trim(line);\n std::string identifier;\n std::istringstream str(line);\n str >> identifier >> std::ws;\n\n if (identifier == \"newmtl\")\n {\n std::string name;\n str >> name;\n auto mtl_pair = std::make_pair(name, mtl());\n matlib->insert(mtl_pair);\n it = matlib->find(name);\n }\n else if (identifier == \"Ka\")\n {\n str >> (*it).second.ka.x >> std::ws >> (*it).second.ka.y >> std::ws >> (*it).second.ka.z >> std::ws;\n }\n else if (identifier == \"Kd\")\n {\n str >> (*it).second.kd.x >> std::ws >> (*it).second.kd.y >> std::ws >> (*it).second.kd.z >> std::ws;\n }\n else if (identifier == \"Ks\")\n {\n str >> (*it).second.ks.x >> std::ws >> (*it).second.ks.y >> std::ws >> (*it).second.ks.z >> std::ws;\n }\n else if (identifier == \"Ns\")\n {\n str >> (*it).second.ns >> std::ws;\n }\n else if (identifier == \"map_Kd\")\n {\n str >> (*it).second.map_kd;\n }\n }\n}\n\n\ndetail::obj_scene load_obj(std::string const& filename)\n{\n std::map<std::string, mtl> matlib;\n\n std::ifstream ifstr(filename.c_str(), std::ifstream::in);\n boost::iostreams::mapped_file_source file(filename);\n\n unsigned geom_id = 0;\n\n using namespace detail;\n\n obj_scene result;\n\n using vertex_vector = aligned_vector<vec3>;\n using tex_coord_vector = aligned_vector<vec2>;\n using normal_vector = aligned_vector<vec3>;\n using face_vector = aligned_vector<face_index_t>;\n\n vertex_vector vertices;\n tex_coord_vector tex_coords;\n normal_vector normals;\n face_vector faces;\n\n\n \/\/ intermediate containers\n\n string_ref comment;\n string_ref mtl_file;\n string_ref mtl_name;\n\n\n \/\/ helper functions\n\n auto remap_index = [](int idx, int size) -> int\n {\n return idx < 0 ? static_cast<int>(size) + idx : idx - 1;\n };\n\n auto store_triangle = [&](int i1, int i2, int i3)\n {\n triangle_type tri;\n tri.prim_id = static_cast<unsigned>(result.primitives.size());\n tri.geom_id = geom_id;\n tri.v1 = vertices[i1];\n tri.e1 = vertices[i2] - tri.v1;\n tri.e2 = vertices[i3] - tri.v1;\n result.primitives.push_back(tri);\n };\n\n auto store_faces = [&](int vertices_size, int tex_coords_size, int normals_size)\n {\n size_t last = 2;\n auto i1 = remap_index(faces[0].vertex_index, vertices_size);\n\n while (last != faces.size())\n {\n \/\/ triangle\n auto i2 = remap_index(faces[last - 1].vertex_index, vertices_size);\n auto i3 = remap_index(faces[last].vertex_index, vertices_size);\n store_triangle(i1, i2, i3);\n\n \/\/ texture coordinates\n if (faces[0].tex_coord_index && faces[last - 1].tex_coord_index && faces[last].tex_coord_index)\n {\n auto ti1 = remap_index(*faces[0].tex_coord_index, tex_coords_size);\n auto ti2 = remap_index(*faces[last - 1].tex_coord_index, tex_coords_size);\n auto ti3 = remap_index(*faces[last].tex_coord_index, tex_coords_size);\n\n result.tex_coords.push_back( tex_coords[ti1] );\n result.tex_coords.push_back( tex_coords[ti2] );\n result.tex_coords.push_back( tex_coords[ti3] );\n }\n\n \/\/ normals\n if (faces[0].normal_index && faces[last - 1].normal_index && faces[last].normal_index)\n {\n auto ni1 = remap_index(*faces[0].normal_index, normals_size);\n auto ni2 = remap_index(*faces[last - 1].normal_index, normals_size);\n auto ni3 = remap_index(*faces[last].normal_index, normals_size);\n\n result.normals.push_back( normals[ni1] );\n result.normals.push_back( normals[ni2] );\n result.normals.push_back( normals[ni3] );\n }\n\n ++last;\n }\n };\n\n\n \/\/ obj grammar\n\n using It = string_ref::const_iterator;\n using space_type = decltype(qi::blank);\n\n qi::rule<It> r_unhandled = *(qi::char_ - qi::eol) >> qi::eol;\n qi::rule<It, string_ref()> r_text_to_eol = qi::raw[*(qi::char_ - qi::eol)];\n\n qi::rule<It, string_ref()> r_comment = \"#\" >> r_text_to_eol >> qi::eol;\n qi::rule<It, string_ref(), space_type> r_mtllib = \"mtllib\" >> r_text_to_eol >> qi::eol;\n qi::rule<It, string_ref(), space_type> r_usemtl = \"usemtl\" >> r_text_to_eol >> qi::eol;\n\n qi::rule<It, vec3(), space_type> r_v = \"v\" >> qi::float_ >> qi::float_ >> qi::float_ >> -qi::float_ >> qi::eol; \/\/ TODO: mind w\n qi::rule<It, vec2(), space_type> r_vt = \"vt\" >> qi::float_ >> qi::float_ >> -qi::float_ >> qi::eol; \/\/ TODO: mind w\n qi::rule<It, vec3(), space_type> r_vn = \"vn\" >> qi::float_ >> qi::float_ >> qi::float_ >> qi::eol;\n\n qi::rule<It, vertex_vector(), space_type> r_vertices = r_v >> *r_v;\n qi::rule<It, tex_coord_vector(), space_type> r_tex_coords = r_vt >> *r_vt;\n qi::rule<It, normal_vector(), space_type> r_normals = r_vn >> *r_vn;\n\n qi::rule<It, detail::face_index_t()> r_face_vertex = qi::int_ >> -qi::lit(\"\/\") >> -qi::int_ >> -qi::lit(\"\/\") >> -qi::int_;\n qi::rule<It, face_vector(), space_type> r_face = \"f\" >> r_face_vertex >> r_face_vertex >> r_face_vertex >> *r_face_vertex >> qi::eol;\n\n\n string_ref text(file.data(), file.size());\n auto it = text.cbegin();\n\n while (it != text.cend())\n {\n faces.clear();\n\n if ( qi::phrase_parse(it, text.cend(), r_comment, qi::blank, comment) )\n {\n VSNRAY_UNUSED(comment);\n continue;\n }\n else if ( qi::phrase_parse(it, text.cend(), r_mtllib, qi::blank, mtl_file) )\n {\n boost::filesystem::path p(filename);\n std::string mtl_dir = p.parent_path().string();\n\n std::string mtl_path = mtl_dir + \"\/\" + std::string(mtl_file);\n\n parse_mtl(mtl_path, &matlib);\n }\n else if ( qi::phrase_parse(it, text.cend(), r_usemtl, qi::blank, mtl_name) )\n {\n auto mat_it = matlib.find(std::string(mtl_name));\n if (mat_it != matlib.end())\n {\n phong<float> mat;\n mat.set_cd( mat_it->second.kd );\n mat.set_kd( 1.0f );\n mat.set_ks( 1.0f );\n mat.set_specular_exp( mat_it->second.ns );\n result.materials.push_back(mat);\n\n typedef tex_list::value_type tex_type;\n boost::filesystem::path p(filename);\n std::string tex_filename = p.parent_path().string() + \"\/\" + mat_it->second.map_kd;\n\n static const std::string extensions[] = { \".jpg\", \".jpeg\", \".JPG\", \".JPEG\" };\n auto tex_path = boost::filesystem::path(tex_filename);\n auto has_jpg_ext = ( std::find(extensions, extensions + 4, tex_path.extension()) != extensions + 4 );\n\n if (!mat_it->second.map_kd.empty() && boost::filesystem::exists(tex_filename) && has_jpg_ext)\n {\n#if defined(VSNRAY_HAVE_JPEG)\n jpeg_image jpg(tex_filename);\n\n tex_type tex(jpg.width(), jpg.height());\n tex.set_address_mode( Clamp );\n tex.set_filter_mode( Linear );\n\n auto data_ptr = reinterpret_cast<tex_type::value_type const*>(jpg.data());\n tex.set_data(data_ptr);\n\n result.textures.push_back(std::move(tex));\n#endif\n }\n else\n {\n result.textures.push_back(tex_type(0, 0));\n }\n }\n geom_id = result.materials.size() == 0 ? 0 : static_cast<unsigned>(result.materials.size() - 1);\n }\n else if ( qi::phrase_parse(it, text.cend(), r_vertices, qi::blank, vertices) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_tex_coords, qi::blank, tex_coords) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_normals, qi::blank, normals) )\n {\n }\n else if ( qi::phrase_parse(it, text.cend(), r_face, qi::blank, faces) )\n {\n store_faces(static_cast<int>(vertices.size()), static_cast<int>(tex_coords.size()), static_cast<int>(normals.size()));\n }\n else if ( qi::phrase_parse(it, text.cend(), r_unhandled, qi::blank) )\n {\n continue;\n }\n }\n\n\/\/ TODO\n\n result.normals.resize(0); \/\/ TODO: support for vertex normals\n if (result.normals.size() == 0) \/\/ have no default normals\n {\n for (auto const& tri : result.primitives)\n {\n vec3 n = normalize( cross(tri.e1, tri.e2) );\n result.normals.push_back(n);\n }\n }\n\n if (result.materials.size() == 0)\n {\n for (unsigned i = 0; i <= geom_id; ++i)\n {\n phong<float> m;\n m.set_cd( vec3(0.8f, 0.8f, 0.8f) );\n m.set_kd( 1.0f );\n m.set_ks( 1.0f );\n m.set_specular_exp( 32.0f );\n result.materials.push_back(m);\n }\n }\n\/\/ TODO\n\n result.bbox = bounds(result.primitives);\n return result;\n}\n\n} \/\/ visionaray\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"console_user_server_client.hpp\"\n#include \"constants.hpp\"\n#include \"input_source_manager.hpp\"\n#include \"local_datagram\/server_manager.hpp\"\n#include \"shell_utility.hpp\"\n#include \"types.hpp\"\n#include <vector>\n\nnamespace krbn {\nclass receiver final {\npublic:\n \/\/ Signals\n\n boost::signals2::signal<void(void)> bound;\n boost::signals2::signal<void(const boost::system::error_code&)> bind_failed;\n boost::signals2::signal<void(void)> closed;\n\n \/\/ Methods\n\n receiver(const receiver&) = delete;\n\n receiver(void) : last_select_input_source_time_stamp_(0) {\n }\n\n void start(void) {\n auto uid = getuid();\n auto socket_file_path = console_user_server_client::make_console_user_server_socket_file_path(uid);\n\n unlink(socket_file_path.c_str());\n\n size_t buffer_size = 32 * 1024;\n std::chrono::milliseconds server_check_interval(3000);\n std::chrono::milliseconds reconnect_interval(1000);\n\n server_manager_ = std::make_unique<local_datagram::server_manager>(socket_file_path,\n buffer_size,\n server_check_interval,\n reconnect_interval);\n\n server_manager_->bound.connect([this] {\n bound();\n });\n\n server_manager_->bind_failed.connect([this](auto&& error_code) {\n bind_failed(error_code);\n });\n\n server_manager_->closed.connect([this] {\n closed();\n });\n\n server_manager_->received.connect([this](auto&& buffer) {\n if (auto type = types::find_operation_type(buffer.data(), buffer.size())) {\n switch (*type) {\n case operation_type::shell_command_execution:\n if (buffer.size() != sizeof(operation_type_shell_command_execution_struct)) {\n logger::get_logger().error(\"invalid size for operation_type::shell_command_execution\");\n } else {\n auto p = reinterpret_cast<operation_type_shell_command_execution_struct*>(buffer.data());\n\n \/\/ Ensure shell_command is null-terminated string even if corrupted data is sent.\n p->shell_command[sizeof(p->shell_command) - 1] = '\\0';\n\n std::string background_shell_command = shell_utility::make_background_command(p->shell_command);\n dispatch_async(dispatch_get_main_queue(), ^{\n system(background_shell_command.c_str());\n });\n }\n break;\n\n case operation_type::select_input_source:\n if (buffer.size() != sizeof(operation_type_select_input_source_struct)) {\n logger::get_logger().error(\"invalid size for operation_type::select_input_source\");\n } else {\n auto p = reinterpret_cast<operation_type_select_input_source_struct*>(buffer.data());\n\n \/\/ Ensure input_source_selector's strings are null-terminated string even if corrupted data is sent.\n p->language[sizeof(p->language) - 1] = '\\0';\n p->input_source_id[sizeof(p->input_source_id) - 1] = '\\0';\n p->input_mode_id[sizeof(p->input_mode_id) - 1] = '\\0';\n\n uint64_t time_stamp = p->time_stamp;\n boost::optional<std::string> language(std::string(p->language));\n boost::optional<std::string> input_source_id(std::string(p->input_source_id));\n boost::optional<std::string> input_mode_id(std::string(p->input_mode_id));\n if (language && language->empty()) {\n language = boost::none;\n }\n if (input_source_id && input_source_id->empty()) {\n input_source_id = boost::none;\n }\n if (input_mode_id && input_mode_id->empty()) {\n input_mode_id = boost::none;\n }\n\n input_source_selector input_source_selector(language,\n input_source_id,\n input_mode_id);\n\n dispatch_async(dispatch_get_main_queue(), ^{\n if (last_select_input_source_time_stamp_ == time_stamp) {\n return;\n }\n if (input_source_manager_.select(input_source_selector)) {\n last_select_input_source_time_stamp_ = time_stamp;\n }\n });\n }\n break;\n\n default:\n break;\n }\n }\n });\n\n server_manager_->start();\n\n logger::get_logger().info(\"receiver is initialized\");\n }\n\n ~receiver(void) {\n server_manager_ = nullptr;\n\n logger::get_logger().info(\"receiver is terminated\");\n }\n\nprivate:\n std::unique_ptr<local_datagram::server_manager> server_manager_;\n\n input_source_manager input_source_manager_;\n uint64_t last_select_input_source_time_stamp_;\n};\n} \/\/ namespace krbn\n<commit_msg>update for received changes<commit_after>#pragma once\n\n#include \"console_user_server_client.hpp\"\n#include \"constants.hpp\"\n#include \"input_source_manager.hpp\"\n#include \"local_datagram\/server_manager.hpp\"\n#include \"shell_utility.hpp\"\n#include \"types.hpp\"\n#include <vector>\n\nnamespace krbn {\nclass receiver final {\npublic:\n \/\/ Signals\n\n boost::signals2::signal<void(void)> bound;\n boost::signals2::signal<void(const boost::system::error_code&)> bind_failed;\n boost::signals2::signal<void(void)> closed;\n\n \/\/ Methods\n\n receiver(const receiver&) = delete;\n\n receiver(void) : last_select_input_source_time_stamp_(0) {\n }\n\n void start(void) {\n auto uid = getuid();\n auto socket_file_path = console_user_server_client::make_console_user_server_socket_file_path(uid);\n\n unlink(socket_file_path.c_str());\n\n size_t buffer_size = 32 * 1024;\n std::chrono::milliseconds server_check_interval(3000);\n std::chrono::milliseconds reconnect_interval(1000);\n\n server_manager_ = std::make_unique<local_datagram::server_manager>(socket_file_path,\n buffer_size,\n server_check_interval,\n reconnect_interval);\n\n server_manager_->bound.connect([this] {\n bound();\n });\n\n server_manager_->bind_failed.connect([this](auto&& error_code) {\n bind_failed(error_code);\n });\n\n server_manager_->closed.connect([this] {\n closed();\n });\n\n server_manager_->received.connect([this](auto&& buffer) {\n if (auto type = types::find_operation_type(*buffer)) {\n switch (*type) {\n case operation_type::shell_command_execution:\n if (buffer->size() != sizeof(operation_type_shell_command_execution_struct)) {\n logger::get_logger().error(\"invalid size for operation_type::shell_command_execution\");\n } else {\n auto p = reinterpret_cast<operation_type_shell_command_execution_struct*>(&((*buffer)[0]));\n\n \/\/ Ensure shell_command is null-terminated string even if corrupted data is sent.\n p->shell_command[sizeof(p->shell_command) - 1] = '\\0';\n\n std::string background_shell_command = shell_utility::make_background_command(p->shell_command);\n dispatch_async(dispatch_get_main_queue(), ^{\n system(background_shell_command.c_str());\n });\n }\n break;\n\n case operation_type::select_input_source:\n if (buffer->size() != sizeof(operation_type_select_input_source_struct)) {\n logger::get_logger().error(\"invalid size for operation_type::select_input_source\");\n } else {\n auto p = reinterpret_cast<operation_type_select_input_source_struct*>(&((*buffer)[0]));\n\n \/\/ Ensure input_source_selector's strings are null-terminated string even if corrupted data is sent.\n p->language[sizeof(p->language) - 1] = '\\0';\n p->input_source_id[sizeof(p->input_source_id) - 1] = '\\0';\n p->input_mode_id[sizeof(p->input_mode_id) - 1] = '\\0';\n\n uint64_t time_stamp = p->time_stamp;\n boost::optional<std::string> language(std::string(p->language));\n boost::optional<std::string> input_source_id(std::string(p->input_source_id));\n boost::optional<std::string> input_mode_id(std::string(p->input_mode_id));\n if (language && language->empty()) {\n language = boost::none;\n }\n if (input_source_id && input_source_id->empty()) {\n input_source_id = boost::none;\n }\n if (input_mode_id && input_mode_id->empty()) {\n input_mode_id = boost::none;\n }\n\n input_source_selector input_source_selector(language,\n input_source_id,\n input_mode_id);\n\n dispatch_async(dispatch_get_main_queue(), ^{\n if (last_select_input_source_time_stamp_ == time_stamp) {\n return;\n }\n if (input_source_manager_.select(input_source_selector)) {\n last_select_input_source_time_stamp_ = time_stamp;\n }\n });\n }\n break;\n\n default:\n break;\n }\n }\n });\n\n server_manager_->start();\n\n logger::get_logger().info(\"receiver is initialized\");\n }\n\n ~receiver(void) {\n server_manager_ = nullptr;\n\n logger::get_logger().info(\"receiver is terminated\");\n }\n\nprivate:\n std::unique_ptr<local_datagram::server_manager> server_manager_;\n\n input_source_manager input_source_manager_;\n uint64_t last_select_input_source_time_stamp_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Library General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n *\n * Port.cpp\n * Base implementation of the Port class.\n * Copyright (C) 2005-2009 Simon Newton\n *\n * Unfortunately this file contains a lot of code duplication.\n *\/\n\n#include <string>\n#include \"ola\/Logging.h\"\n#include \"olad\/Device.h\"\n#include \"olad\/Port.h\"\n\nnamespace ola {\n\n\/*\n * Create a new basic input port\n *\/\nBasicInputPort::BasicInputPort(AbstractDevice *parent,\n unsigned int port_id,\n const TimeStamp *wake_time):\n m_port_id(port_id),\n m_priority(DmxSource::PRIORITY_DEFAULT),\n m_priority_mode(PRIORITY_MODE_INHERIT),\n m_port_string(\"\"),\n m_universe(NULL),\n m_device(parent),\n m_wakeup_time(wake_time) {\n}\n\n\nbool BasicInputPort::SetUniverse(Universe *new_universe) {\n Universe *old_universe = GetUniverse();\n if (old_universe == new_universe)\n return true;\n\n if (PreSetUniverse(old_universe, new_universe)) {\n m_universe = new_universe;\n PostSetUniverse(old_universe, new_universe);\n return true;\n }\n return false;\n}\n\n\nstring BasicInputPort::UniqueId() const {\n if (m_port_string.empty()) {\n std::stringstream str;\n if (m_device)\n str << m_device->UniqueId() << \"-I-\" << m_port_id;\n m_port_string = str.str();\n }\n return m_port_string;\n}\n\n\n\nbool BasicInputPort::SetPriority(uint8_t priority) {\n if (priority > DmxSource::PRIORITY_MAX)\n return false;\n\n m_priority = priority;\n return true;\n}\n\n\n\/*\n * Called when there is new data for this port\n *\/\nvoid BasicInputPort::DmxChanged() {\n if (GetUniverse()) {\n const DmxBuffer &buffer = ReadDMX();\n uint8_t priority = (PriorityCapability() == CAPABILITY_FULL &&\n GetPriorityMode() == PRIORITY_MODE_INHERIT ?\n InheritedPriority() :\n GetPriority());\n m_dmx_source.UpdateData(buffer, *m_wakeup_time, priority);\n GetUniverse()->PortDataChanged(this);\n }\n}\n\n\n\/*\n * Handle an RDM Request on this port.\n * @param request the RDMRequest object, ownership is transferred to us\n *\/\nbool BasicInputPort::HandleRDMRequest(const ola::rdm::RDMRequest *request) {\n if (m_universe)\n return m_universe->HandleRDMRequest(this, request);\n else\n delete request;\n return false;\n}\n\n\n\/*\n * Handle a response message\n * @param response, the RDMResponse object, ownership is transferred to us\n *\/\nbool BasicInputPort::HandleRDMResponse(\n const ola::rdm::RDMResponse *response) {\n OLA_WARN << \"In base HandleRDMResponse, something has gone wrong with RDM\" <<\n \" request routing\";\n delete response;\n return true;\n}\n\n\n\/*\n * Trigger the RDM Discovery procedure for this universe\n *\/\nvoid BasicInputPort::TriggerRDMDiscovery() {\n if (m_universe)\n m_universe->RunRDMDiscovery();\n}\n\n\nvoid BasicOutputPort::NewUIDList(const ola::rdm::UIDSet &uids) {\n if (m_universe)\n m_universe->NewUIDList(uids, this);\n}\n\n\n\/*\n * Create a new BasicOutputPort\n *\/\nBasicOutputPort::BasicOutputPort(AbstractDevice *parent,\n unsigned int port_id,\n bool start_rdm_discovery_on_patch):\n m_port_id(port_id),\n m_discover_on_patch(start_rdm_discovery_on_patch),\n m_priority(DmxSource::PRIORITY_DEFAULT),\n m_priority_mode(PRIORITY_MODE_INHERIT),\n m_port_string(\"\"),\n m_universe(NULL),\n m_device(parent) {\n}\n\n\nbool BasicOutputPort::SetUniverse(Universe *new_universe) {\n Universe *old_universe = GetUniverse();\n if (old_universe == new_universe)\n return true;\n\n if (PreSetUniverse(old_universe, new_universe)) {\n m_universe = new_universe;\n PostSetUniverse(old_universe, new_universe);\n if (m_discover_on_patch)\n RunRDMDiscovery();\n return true;\n }\n return false;\n}\n\n\nstring BasicOutputPort::UniqueId() const {\n if (m_port_string.empty()) {\n std::stringstream str;\n if (m_device)\n str << m_device->UniqueId() << \"-O-\" << m_port_id;\n m_port_string = str.str();\n }\n return m_port_string;\n}\n\n\nbool BasicOutputPort::SetPriority(uint8_t priority) {\n if (priority > DmxSource::PRIORITY_MAX)\n return false;\n\n m_priority = priority;\n return true;\n}\n\n\n\/*\n * Handle an RDMRequest, subclasses can implement this to support RDM\n *\/\nbool BasicOutputPort::HandleRDMRequest(const ola::rdm::RDMRequest *request) {\n OLA_WARN << \"In base HandleRDMRequest, something has gone wrong with RDM\" <<\n \" request routing\";\n delete request;\n return true;\n}\n\n\n\/*\n * Handle a response message\n *\/\nbool BasicOutputPort::HandleRDMResponse(\n const ola::rdm::RDMResponse *response) {\n if (m_universe)\n return m_universe->HandleRDMResponse(this, response);\n else\n delete response;\n return false;\n}\n\n\n\/*\n * This is a noop for ports that don't support RDM\n *\/\nvoid BasicOutputPort::RunRDMDiscovery() {\n}\n\n\n\/*\n * This allows switching based on Port type.\n *\/\ntemplate<class PortClass>\nbool IsInputPort() {\n return true;\n}\n\ntemplate<>\nbool IsInputPort<OutputPort>() {\n return false;\n}\n\ntemplate<>\nbool IsInputPort<InputPort>() {\n return true;\n}\n} \/\/ ola\n<commit_msg> * remove the warning for bcast messages<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Library General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n *\n * Port.cpp\n * Base implementation of the Port class.\n * Copyright (C) 2005-2009 Simon Newton\n *\n * Unfortunately this file contains a lot of code duplication.\n *\/\n\n#include <string>\n#include \"ola\/Logging.h\"\n#include \"olad\/Device.h\"\n#include \"olad\/Port.h\"\n\nnamespace ola {\n\n\/*\n * Create a new basic input port\n *\/\nBasicInputPort::BasicInputPort(AbstractDevice *parent,\n unsigned int port_id,\n const TimeStamp *wake_time):\n m_port_id(port_id),\n m_priority(DmxSource::PRIORITY_DEFAULT),\n m_priority_mode(PRIORITY_MODE_INHERIT),\n m_port_string(\"\"),\n m_universe(NULL),\n m_device(parent),\n m_wakeup_time(wake_time) {\n}\n\n\nbool BasicInputPort::SetUniverse(Universe *new_universe) {\n Universe *old_universe = GetUniverse();\n if (old_universe == new_universe)\n return true;\n\n if (PreSetUniverse(old_universe, new_universe)) {\n m_universe = new_universe;\n PostSetUniverse(old_universe, new_universe);\n return true;\n }\n return false;\n}\n\n\nstring BasicInputPort::UniqueId() const {\n if (m_port_string.empty()) {\n std::stringstream str;\n if (m_device)\n str << m_device->UniqueId() << \"-I-\" << m_port_id;\n m_port_string = str.str();\n }\n return m_port_string;\n}\n\n\n\nbool BasicInputPort::SetPriority(uint8_t priority) {\n if (priority > DmxSource::PRIORITY_MAX)\n return false;\n\n m_priority = priority;\n return true;\n}\n\n\n\/*\n * Called when there is new data for this port\n *\/\nvoid BasicInputPort::DmxChanged() {\n if (GetUniverse()) {\n const DmxBuffer &buffer = ReadDMX();\n uint8_t priority = (PriorityCapability() == CAPABILITY_FULL &&\n GetPriorityMode() == PRIORITY_MODE_INHERIT ?\n InheritedPriority() :\n GetPriority());\n m_dmx_source.UpdateData(buffer, *m_wakeup_time, priority);\n GetUniverse()->PortDataChanged(this);\n }\n}\n\n\n\/*\n * Handle an RDM Request on this port.\n * @param request the RDMRequest object, ownership is transferred to us\n *\/\nbool BasicInputPort::HandleRDMRequest(const ola::rdm::RDMRequest *request) {\n if (m_universe)\n return m_universe->HandleRDMRequest(this, request);\n else\n delete request;\n return false;\n}\n\n\n\/*\n * Handle a response message\n * @param response, the RDMResponse object, ownership is transferred to us\n *\/\nbool BasicInputPort::HandleRDMResponse(\n const ola::rdm::RDMResponse *response) {\n OLA_WARN << \"In base HandleRDMResponse, something has gone wrong with RDM\" <<\n \" request routing\";\n delete response;\n return true;\n}\n\n\n\/*\n * Trigger the RDM Discovery procedure for this universe\n *\/\nvoid BasicInputPort::TriggerRDMDiscovery() {\n if (m_universe)\n m_universe->RunRDMDiscovery();\n}\n\n\nvoid BasicOutputPort::NewUIDList(const ola::rdm::UIDSet &uids) {\n if (m_universe)\n m_universe->NewUIDList(uids, this);\n}\n\n\n\/*\n * Create a new BasicOutputPort\n *\/\nBasicOutputPort::BasicOutputPort(AbstractDevice *parent,\n unsigned int port_id,\n bool start_rdm_discovery_on_patch):\n m_port_id(port_id),\n m_discover_on_patch(start_rdm_discovery_on_patch),\n m_priority(DmxSource::PRIORITY_DEFAULT),\n m_priority_mode(PRIORITY_MODE_INHERIT),\n m_port_string(\"\"),\n m_universe(NULL),\n m_device(parent) {\n}\n\n\nbool BasicOutputPort::SetUniverse(Universe *new_universe) {\n Universe *old_universe = GetUniverse();\n if (old_universe == new_universe)\n return true;\n\n if (PreSetUniverse(old_universe, new_universe)) {\n m_universe = new_universe;\n PostSetUniverse(old_universe, new_universe);\n if (m_discover_on_patch)\n RunRDMDiscovery();\n return true;\n }\n return false;\n}\n\n\nstring BasicOutputPort::UniqueId() const {\n if (m_port_string.empty()) {\n std::stringstream str;\n if (m_device)\n str << m_device->UniqueId() << \"-O-\" << m_port_id;\n m_port_string = str.str();\n }\n return m_port_string;\n}\n\n\nbool BasicOutputPort::SetPriority(uint8_t priority) {\n if (priority > DmxSource::PRIORITY_MAX)\n return false;\n\n m_priority = priority;\n return true;\n}\n\n\n\/*\n * Handle an RDMRequest, subclasses can implement this to support RDM\n *\/\nbool BasicOutputPort::HandleRDMRequest(const ola::rdm::RDMRequest *request) {\n \/\/ broadcasts go to every port\n if (!request->DestinationUID().IsBroadcast())\n OLA_WARN << \"In base HandleRDMRequest, something has gone wrong with RDM\"\n << \" request routing\";\n delete request;\n return true;\n}\n\n\n\/*\n * Handle a response message\n *\/\nbool BasicOutputPort::HandleRDMResponse(\n const ola::rdm::RDMResponse *response) {\n if (m_universe)\n return m_universe->HandleRDMResponse(this, response);\n else\n delete response;\n return false;\n}\n\n\n\/*\n * This is a noop for ports that don't support RDM\n *\/\nvoid BasicOutputPort::RunRDMDiscovery() {\n}\n\n\n\/*\n * This allows switching based on Port type.\n *\/\ntemplate<class PortClass>\nbool IsInputPort() {\n return true;\n}\n\ntemplate<>\nbool IsInputPort<OutputPort>() {\n return false;\n}\n\ntemplate<>\nbool IsInputPort<InputPort>() {\n return true;\n}\n} \/\/ ola\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/\n**\n** This file is part of the QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** GNU Lesser General Public License Usage\n** This file may be used under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation and\n** appearing in the file LICENSE.LGPL included in the packaging of this\n** file. Please review the following information to ensure the GNU Lesser\n** General Public License version 2.1 requirements will be met:\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU General\n** Public License version 3.0 as published by the Free Software Foundation\n** and appearing in the file LICENSE.GPL included in the packaging of this\n** file. Please review the following information to ensure the GNU General\n** Public License version 3.0 requirements will be met:\n** http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** Other Usage\n** Alternatively, this file may be used in accordance with the terms and\n** conditions contained in a signed written agreement between you and Nokia.\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qdebugmessageservice_p.h\"\n#include \"qdeclarativedebugservice_p_p.h\"\n\nQT_BEGIN_NAMESPACE\n\nQ_GLOBAL_STATIC(QDebugMessageService, declarativeDebugMessageService)\n\nvoid DebugMessageHandler(QtMsgType type, const QMessageLogContext &ctxt,\n const char *buf)\n{\n QDebugMessageService::instance()->sendDebugMessage(type, ctxt, buf);\n}\n\nclass QDebugMessageServicePrivate : public QDeclarativeDebugServicePrivate\n{\npublic:\n QDebugMessageServicePrivate()\n : oldMsgHandler(0)\n , prevState(QDeclarativeDebugService::NotConnected)\n {\n }\n\n QMessageHandler oldMsgHandler;\n QDeclarativeDebugService::State prevState;\n};\n\nQDebugMessageService::QDebugMessageService(QObject *parent) :\n QDeclarativeDebugService(*(new QDebugMessageServicePrivate()),\n QLatin1String(\"DebugMessages\"), 2, parent)\n{\n Q_D(QDebugMessageService);\n\n registerService();\n if (state() == Enabled) {\n d->oldMsgHandler = qInstallMessageHandler(DebugMessageHandler);\n d->prevState = Enabled;\n }\n}\n\nQDebugMessageService *QDebugMessageService::instance()\n{\n return declarativeDebugMessageService();\n}\n\nvoid QDebugMessageService::sendDebugMessage(QtMsgType type,\n const QMessageLogContext &ctxt,\n const char *buf)\n{\n Q_D(QDebugMessageService);\n\n \/\/We do not want to alter the message handling mechanism\n \/\/We just eavesdrop and forward the messages to a port\n \/\/only if a client is connected to it.\n QByteArray message;\n QDataStream ws(&message, QIODevice::WriteOnly);\n ws << QByteArray(\"MESSAGE\") << type << QString::fromLocal8Bit(buf).toUtf8();\n ws << QString::fromLatin1(ctxt.file).toUtf8();\n ws << ctxt.line << QString::fromLatin1(ctxt.function).toUtf8();\n\n sendMessage(message);\n if (d->oldMsgHandler)\n (*d->oldMsgHandler)(type, ctxt, buf);\n}\n\nvoid QDebugMessageService::stateChanged(State state)\n{\n Q_D(QDebugMessageService);\n\n if (state != Enabled && d->prevState == Enabled) {\n QMessageHandler handler = qInstallMessageHandler(d->oldMsgHandler);\n \/\/ has our handler been overwritten in between?\n if (handler != DebugMessageHandler)\n qInstallMessageHandler(handler);\n\n } else if (state == Enabled && d->prevState != Enabled) {\n d->oldMsgHandler = qInstallMessageHandler(DebugMessageHandler);\n\n }\n\n d->prevState = state;\n}\n\nQT_END_NAMESPACE\n<commit_msg>Add missing include<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2012 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/\n**\n** This file is part of the QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** GNU Lesser General Public License Usage\n** This file may be used under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation and\n** appearing in the file LICENSE.LGPL included in the packaging of this\n** file. Please review the following information to ensure the GNU Lesser\n** General Public License version 2.1 requirements will be met:\n** http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU General\n** Public License version 3.0 as published by the Free Software Foundation\n** and appearing in the file LICENSE.GPL included in the packaging of this\n** file. Please review the following information to ensure the GNU General\n** Public License version 3.0 requirements will be met:\n** http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** Other Usage\n** Alternatively, this file may be used in accordance with the terms and\n** conditions contained in a signed written agreement between you and Nokia.\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qdebugmessageservice_p.h\"\n#include \"qdeclarativedebugservice_p_p.h\"\n\n#include <QDataStream>\n\nQT_BEGIN_NAMESPACE\n\nQ_GLOBAL_STATIC(QDebugMessageService, declarativeDebugMessageService)\n\nvoid DebugMessageHandler(QtMsgType type, const QMessageLogContext &ctxt,\n const char *buf)\n{\n QDebugMessageService::instance()->sendDebugMessage(type, ctxt, buf);\n}\n\nclass QDebugMessageServicePrivate : public QDeclarativeDebugServicePrivate\n{\npublic:\n QDebugMessageServicePrivate()\n : oldMsgHandler(0)\n , prevState(QDeclarativeDebugService::NotConnected)\n {\n }\n\n QMessageHandler oldMsgHandler;\n QDeclarativeDebugService::State prevState;\n};\n\nQDebugMessageService::QDebugMessageService(QObject *parent) :\n QDeclarativeDebugService(*(new QDebugMessageServicePrivate()),\n QLatin1String(\"DebugMessages\"), 2, parent)\n{\n Q_D(QDebugMessageService);\n\n registerService();\n if (state() == Enabled) {\n d->oldMsgHandler = qInstallMessageHandler(DebugMessageHandler);\n d->prevState = Enabled;\n }\n}\n\nQDebugMessageService *QDebugMessageService::instance()\n{\n return declarativeDebugMessageService();\n}\n\nvoid QDebugMessageService::sendDebugMessage(QtMsgType type,\n const QMessageLogContext &ctxt,\n const char *buf)\n{\n Q_D(QDebugMessageService);\n\n \/\/We do not want to alter the message handling mechanism\n \/\/We just eavesdrop and forward the messages to a port\n \/\/only if a client is connected to it.\n QByteArray message;\n QDataStream ws(&message, QIODevice::WriteOnly);\n ws << QByteArray(\"MESSAGE\") << type << QString::fromLocal8Bit(buf).toUtf8();\n ws << QString::fromLatin1(ctxt.file).toUtf8();\n ws << ctxt.line << QString::fromLatin1(ctxt.function).toUtf8();\n\n sendMessage(message);\n if (d->oldMsgHandler)\n (*d->oldMsgHandler)(type, ctxt, buf);\n}\n\nvoid QDebugMessageService::stateChanged(State state)\n{\n Q_D(QDebugMessageService);\n\n if (state != Enabled && d->prevState == Enabled) {\n QMessageHandler handler = qInstallMessageHandler(d->oldMsgHandler);\n \/\/ has our handler been overwritten in between?\n if (handler != DebugMessageHandler)\n qInstallMessageHandler(handler);\n\n } else if (state == Enabled && d->prevState != Enabled) {\n d->oldMsgHandler = qInstallMessageHandler(DebugMessageHandler);\n\n }\n\n d->prevState = state;\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Node.cpp\n *\n * Created on: Mar 16, 2015\n * Author: jonno\n *\/\n\n#include \"Node.h\"\n#include \"Chord.h\"\n#include <iomanip>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include \"utils\/csapp.h\"\n#include <iostream>\n#include <sstream>\n#include <assert.h>\n#include <tuple>\n\nusing namespace std;\n\n\/\/\tstruct sockaddr_in address;\n\/\/\tsocklen_t length;\n\/\/\tgetpeername(file_descriptor, (sockaddr*)&address, &length);\n\nNode::Node(std::string ip_addr, int port) :\n\t\tNode(0, ip_addr, port) {\n}\n\nNode::Node(int file_descriptor, std::string ip_addr, int port) {\n\tmyFD = file_descriptor;\n\tif (myFD > 0) {\n\t\tmyRIOBuffer = shared_ptr<RIOBuffered>(new RIOBuffered(myFD));\n\t}\n\n\tmyIPAddress = ip_addr;\n\tmyPort = port;\n\tmyKey = Chord::hashKey(myIPAddress + \":\" + to_string(myPort));\n}\n\nNode::~Node() {\n\tif (myFD > 0) {\n\t\t\/\/ let them know we are done.\n\t\t\/\/ myRIOBuffer->writeLine(&(Node::EXIT_MSG));\n\t\tshutdown(myFD, 0);\n\t\tClose(myFD);\n\t}\n}\n\nbool Node::Connect() {\n\tmyFD = Open_clientfd(myIPAddress.c_str(), myPort);\n\tif (myFD > 0) {\n\t\tmyRIOBuffer = shared_ptr<RIOBuffered>(new RIOBuffered(myFD));\n\n\t\t\/\/ other node sends hello message\n\t\tmyRIOBuffer->readLine();\n\t\t\/\/ node's identity\n\t\tstring message = myRIOBuffer->readLine();\n\n\t\tmessage = \"Node \" + this->toString();\n\t\tthis->send(&message);\n\t\tmessage = myRIOBuffer->readLine();\n\n\t\treturn message.find(\"Hello\") == 0;\n\t}\n\treturn false;\n}\n\nunsigned int Node::getKey() {\n\treturn myKey;\n}\n\nstd::string Node::readLine() {\n\treturn myRIOBuffer->readLine();\n}\n\nsize_t Node::send(const std::string* message) {\n\tassert(myFD > 0);\n\treturn RIO::writeString(myFD, message);\n}\n\nvoid Node::processCommunication(std::shared_ptr<RIOBuffered> rio) {\n\tmyRIOBuffer = rio;\n\tmyFD = myRIOBuffer->getFD();\n\n\tauto chord = Chord::getInstance();\n\n\tstringstream stream;\n\tstream << \"Hello \" << std::hex << myKey << \"\\n\";\n\tstring message(stream.str());\n\tthis->send(&message);\n\n\twhile (true) {\n\t\t\/\/ block until it reads a line.\n\t\tmessage = this->readLine();\n\t\tcout << message;\n\n\t\tif (message.length() == 0) {\n\t\t\t\/\/ we have been shutdown by the other side. Bye!\n\t\t\treturn;\n\t\t}\n\t\tstringstream str(message);\n\t\tstring command;\n\t\tstr >> command;\n\n\t\t\/\/ SET Queries - all specific to the instance of Chord\n\t\tif (command.compare(\"GET\") == 0) {\n\t\t\t\/\/ get next part of get request\n\t\t\tstr >> command;\n\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tsize_t index = -1;\n\t\t\t\tstr >> index;\n\t\t\t\tstring response;\n\n\t\t\t\tif (chord->Successors.size() > index - 1) {\n\t\t\t\t\tresponse = chord->Successors[index - 1]->toString();\n\t\t\t\t} else {\n\t\t\t\t\tif (index == 1) {\n\t\t\t\t\t\t\/\/ this happens when there are no successors because it's the only one.\n\t\t\t\t\t\tresponse = chord->NodeInfo->toString();\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresponse = Node::NOT_FOUND;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis->send(&response);\n\t\t\t} else if (command.compare(\"PREDECESSOR\") == 0) {\n\t\t\t\tsize_t index;\n\t\t\t\tstr >> index;\n\t\t\t\tstring response;\n\n\t\t\t\tif (chord->Predecessors.size() > index - 1) {\n\t\t\t\t\tresponse = chord->Predecessors[index - 1]->toString();\n\t\t\t\t} else {\n\t\t\t\t\tif (index == 1) {\n\t\t\t\t\t\t\/\/ this happens when there are no successors because it's the only one.\n\t\t\t\t\t\tresponse = chord->NodeInfo->toString();\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresponse = Node::NOT_FOUND;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis->send(&response);\n\t\t\t} else if (command.compare(\"SUCCESSORS\") == 0) {\n\t\t\t\tstringstream s;\n\n\t\t\t\tfor (size_t i = 0; i < chord->Successors.size(); ++i) {\n\t\t\t\t\ts << i + 1<< \": \" << chord->Successors[i]->toString();\n\t\t\t\t}\n\n\t\t\t\tstring msg = s.str();\n\t\t\t\tthis->send(&msg);\n\t\t\t} else if (command.compare(\"PREDECESSORS\") == 0) {\n\t\t\t\tstringstream s;\n\n\t\t\t\tfor (size_t i = 0; i < chord->Predecessors.size(); ++i) {\n\t\t\t\t\ts << i + 1 << \": \" << chord->Predecessors[i]->toString();\n\t\t\t\t}\n\n\t\t\t\tstring msg = s.str();\n\t\t\t\tthis->send(&msg);\n\t\t\t} else if (command.compare(\"INFO\") == 0) {\n\t\t\t\tstring s = chord->toString();\n\t\t\t\tthis->send(&s);\n\t\t\t} else if (command.compare(\"RANGE\") == 0) {\n\t\t\t\tauto range = chord->getRange();\n\t\t\t\tstringstream msg_s;\n\t\t\t\tmsg_s << hex << get<0>(range) << \" \" << hex << get<1>(range) << endl;\n\t\t\t\tstring msg(msg_s.str());\n\t\t\t\tthis->send(&msg);\n\t\t\t}\n\n\t\t}\n\t\t\/\/ Get Queries - all specific to the instance of Chord\n\t\telse if (command.compare(\"SET\") == 0) {\n\t\t\tstr >> command;\n\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0 || command.compare(\"PREDECESSOR\") == 0) {\n\t\t\t\tint index;\n\t\t\t\tstr >> index;\n\n\t\t\t\tstring info;\n\t\t\t\t\/\/ get the Node info\n\t\t\t\tgetline(str, info);\n\t\t\t\tauto node = Node::createFromInfo(info);\n\t\t\t\tif (node->getKey() == myKey) {\n\t\t\t\t\t\/\/ it is this node trying to make us point to it\n\t\t\t\t\tnode = shared_ptr<Node>(this);\n\t\t\t\t}\n\t\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\t\t\/\/ we don't want to reset up a link to the node.\n\t\t\t\t\t\/\/ they just told us to set it up.\n\t\t\t\t\tchord->setSuccessor(index, node, false);\n\t\t\t\t} else {\n\t\t\t\t\tchord->setPredecessor(index, node, false);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"FIND\") == 0) {\n\t\t\tstr >> command;\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tunsigned int key;\n\t\t\t\tstr >> hex >> key;\n\t\t\t\t\/\/ find the closest predecessor\n\t\t\t\t\/\/ return successor of that\n\t\t\t\tauto node = chord->findSuccessor(key);\n\t\t\t\tstring msg = node->toString();\n\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"SEARCH\") == 0) {\n\t\t\tstr >> command;\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tunsigned int key;\n\t\t\t\tstr >> hex >> key;\n\t\t\t\t\/\/ get best option we know of\n\t\t\t\tauto node = chord->findSuccessor(key);\n\n\t\t\t\twhile (true) {\n\t\t\t\t\t\/\/ check this entry for validity\n\t\t\t\t\t\/\/ pred is less than key\n\t\t\t\t\tauto pred = node->getPredecessor();\n\t\t\t\t\tcout << \"Key Range (\" << hex << pred->getKey() << \", \" << hex << node->getKey() << \"]\" << endl;\n\n\t\t\t\t\t\/\/ check if key between predecessor and provided successor\n\t\t\t\t\tif (Chord::inRange(pred->getKey(), node->getKey(), key)) {\n\t\t\t\t\t\t\/\/ if so, then this is the successor!\n\t\t\t\t\t\tstring msg = node->toString();\n\t\t\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcout << \"We have \" << hex << node->getKey() << \". We are looking for \" << hex << key << endl;\n\t\t\t\t\t\t\/\/ get the next best attempt\n\t\t\t\t\t\tnode = node->FindSuccessor(key);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\/\/\t\t\t\tif (node->getKey() == Chord::getInstance()->NodeInfo->getKey()) {\n\/\/\t\t\t\t\t\/\/ we just return ourselves\n\/\/\t\t\t\t\tstring msg = node->toString();\n\/\/\t\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\/\/\t\t\t\t}\n\n\t\t\t\t\/\/ perform iterative lookup of successor for a key\n\t\t\t\t\/\/ use FIND SUCCESSOR on nodes to get the actual value\n\t\t\t\t\/\/ find predecessor to the id\n\t\t\t\t\/\/ return successor of that\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"REQUEST\") == 0) {\n\t\t\t\/\/ Join\n\t\t} else {\n\t\t\tif (command.compare(Node::EXIT_MSG) == 0) {\n\t\t\t\t\/\/ quit and close\n\t\t\t\tstring goodbye = \"Goodbye Friend!\\n\";\n\t\t\t\tmyRIOBuffer->writeLine(&goodbye);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (command.compare(\"LEAVE\") == 0) {\n\t\t\t\tchord->LeaveRing();\n\t\t\t}\n\t\t\tcout << \"Unknown Request: \" << message;\n\t\t}\n\t}\n}\n\nstd::string Node::toString() {\n\tstringstream result;\n\tresult << hex << myKey << \" \" << myIPAddress << \":\" << dec << myPort << endl;\n\treturn result.str();\n}\n\nstd::shared_ptr<Node> Node::getSuccessor(int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET SUCCESSOR \" << index << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nstd::shared_ptr<Node> Node::getPredecessor(int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET PREDECESSOR \" << index << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nbool Node::isConnected() {\n\treturn (myFD > 0);\n}\n\nstd::shared_ptr<Node> Node::SearchSuccessor(unsigned int key) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SEARCH SUCCESSOR \" << hex << key << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nstd::shared_ptr<Node> Node::FindSuccessor(unsigned int key) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"FIND SUCCESSOR \" << hex << key << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nvoid Node::setSuccessor(Node* node, int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SET SUCCESSOR \" << index << \" \" << node->toString();\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n}\n\nvoid Node::setPredecessor(Node* node, int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SET PREDECESSOR \" << index << \" \" << node->toString();\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n}\n\nstd::tuple<unsigned int, unsigned int> Node::getRange() {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET RANGE\" << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\n\tstringstream response(msg);\n\n\tunsigned int lower;\n\tunsigned int upper;\n\n\tresponse >> lower >> upper;\n\treturn tuple<int, int>(lower, upper);\n}\n\nstd::shared_ptr<Node> Node::createFromInfo(std::string info) {\n\t\/\/ this is in the same format as toString\n\tunsigned int key;\n\tstd::string ip;\n\tint port;\n\n\tstringstream result(info);\n\tresult >> hex >> key >> ip;\n\n\t\/\/ validate key and ip:port\n\t\/\/ TODO: remove && false\n\tif (key != Chord::hashKey(ip) && false) {\n\t\t\/\/ invalid key\n\t\tcout << \"Node \" << hex << key << \" had an invalid key.\" << endl;\n\t\treturn nullptr;\n\t}\n\n\tChord::parseIPPort(ip, &ip, &port);\n\n\treturn shared_ptr<Node>(new Node(ip, port));\n}\n<commit_msg>Enabled MP<commit_after>\/*\n * Node.cpp\n *\n * Created on: Mar 16, 2015\n * Author: jonno\n *\/\n\n#include \"Node.h\"\n#include \"Chord.h\"\n#include <iomanip>\n#include <sys\/socket.h>\n#include <netdb.h>\n#include <netinet\/in.h>\n#include <arpa\/inet.h>\n#include \"utils\/csapp.h\"\n#include <iostream>\n#include <sstream>\n#include <assert.h>\n#include \"MessageProcessor.h\"\n#include <tuple>\n\nusing namespace std;\n\n\/\/\tstruct sockaddr_in address;\n\/\/\tsocklen_t length;\n\/\/\tgetpeername(file_descriptor, (sockaddr*)&address, &length);\n\nNode::Node(std::string ip_addr, int port) :\n\t\tNode(0, ip_addr, port) {\n}\n\nNode::Node(int file_descriptor, std::string ip_addr, int port) {\n\tmyFD = file_descriptor;\n\tif (myFD > 0) {\n\t\tmyRIOBuffer = shared_ptr<RIOBuffered>(new RIOBuffered(myFD));\n\t}\n\n\tmyIPAddress = ip_addr;\n\tmyPort = port;\n\tmyKey = Chord::hashKey(myIPAddress + \":\" + to_string(myPort));\n}\n\nNode::~Node() {\n\tif (myFD > 0) {\n\t\t\/\/ let them know we are done.\n\t\t\/\/ myRIOBuffer->writeLine(&(Node::EXIT_MSG));\n\t\tshutdown(myFD, 0);\n\t\tClose(myFD);\n\t}\n}\n\nbool Node::Connect() {\n\tmyFD = Open_clientfd(myIPAddress.c_str(), myPort);\n\tif (myFD > 0) {\n\t\tmyRIOBuffer = shared_ptr<RIOBuffered>(new RIOBuffered(myFD));\n\n\t\t\/\/ other node sends hello message\n\t\tmyRIOBuffer->readLine();\n\t\t\/\/ node's identity\n\t\tstring message = myRIOBuffer->readLine();\n\n\t\tmessage = \"Node \" + this->toString();\n\t\tthis->send(&message);\n\t\tmessage = myRIOBuffer->readLine();\n\n\t\treturn message.find(\"Hello\") == 0;\n\t}\n\treturn false;\n}\n\nunsigned int Node::getKey() {\n\treturn myKey;\n}\n\nstd::string Node::readLine() {\n\treturn myRIOBuffer->readLine();\n}\n\nsize_t Node::send(const std::string* message) {\n\tassert(myFD > 0);\n\treturn RIO::writeString(myFD, message);\n}\n\nvoid Node::processCommunication(std::shared_ptr<RIOBuffered> rio) {\n\tmyRIOBuffer = rio;\n\tmyFD = myRIOBuffer->getFD();\n\n\tauto chord = Chord::getInstance();\n\n\tstringstream stream;\n\tstream << \"Hello \" << std::hex << myKey << \"\\n\";\n\tstring message(stream.str());\n\tthis->send(&message);\n\n\tMessageProcessor processor(this);\n\n\twhile (true) {\n\t\t\/\/ block until it reads a line.\n\t\tmessage = this->readLine();\n\t\tcout << message;\n\n\t\tif (message.length() == 0) {\n\t\t\t\/\/ we have been shutdown by the other side. Bye!\n\t\t\treturn;\n\t\t}\n\n\t\tprocessor.handleMessage(message);\n\n\n\t\tstringstream str(message);\n\t\tstring command;\n\t\tstr >> command;\n\n\t\t\/\/ SET Queries - all specific to the instance of Chord\n\t\tif (command.compare(\"GET\") == 0) {\n\t\t\t\/\/ get next part of get request\n\t\t\tstr >> command;\n\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tsize_t index = -1;\n\t\t\t\tstr >> index;\n\t\t\t\tstring response;\n\n\t\t\t\tif (chord->Successors.size() > index - 1) {\n\t\t\t\t\tresponse = chord->Successors[index - 1]->toString();\n\t\t\t\t} else {\n\t\t\t\t\tif (index == 1) {\n\t\t\t\t\t\t\/\/ this happens when there are no successors because it's the only one.\n\t\t\t\t\t\tresponse = chord->NodeInfo->toString();\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresponse = Node::NOT_FOUND;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis->send(&response);\n\t\t\t} else if (command.compare(\"PREDECESSOR\") == 0) {\n\t\t\t\tsize_t index;\n\t\t\t\tstr >> index;\n\t\t\t\tstring response;\n\n\t\t\t\tif (chord->Predecessors.size() > index - 1) {\n\t\t\t\t\tresponse = chord->Predecessors[index - 1]->toString();\n\t\t\t\t} else {\n\t\t\t\t\tif (index == 1) {\n\t\t\t\t\t\t\/\/ this happens when there are no successors because it's the only one.\n\t\t\t\t\t\tresponse = chord->NodeInfo->toString();\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresponse = Node::NOT_FOUND;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis->send(&response);\n\t\t\t} else if (command.compare(\"SUCCESSORS\") == 0) {\n\t\t\t\tstringstream s;\n\n\t\t\t\tfor (size_t i = 0; i < chord->Successors.size(); ++i) {\n\t\t\t\t\ts << i + 1<< \": \" << chord->Successors[i]->toString();\n\t\t\t\t}\n\n\t\t\t\tstring msg = s.str();\n\t\t\t\tthis->send(&msg);\n\t\t\t} else if (command.compare(\"PREDECESSORS\") == 0) {\n\t\t\t\tstringstream s;\n\n\t\t\t\tfor (size_t i = 0; i < chord->Predecessors.size(); ++i) {\n\t\t\t\t\ts << i + 1 << \": \" << chord->Predecessors[i]->toString();\n\t\t\t\t}\n\n\t\t\t\tstring msg = s.str();\n\t\t\t\tthis->send(&msg);\n\t\t\t} else if (command.compare(\"INFO\") == 0) {\n\t\t\t\tstring s = chord->toString();\n\t\t\t\tthis->send(&s);\n\t\t\t} else if (command.compare(\"RANGE\") == 0) {\n\t\t\t\tauto range = chord->getRange();\n\t\t\t\tstringstream msg_s;\n\t\t\t\tmsg_s << hex << get<0>(range) << \" \" << hex << get<1>(range) << endl;\n\t\t\t\tstring msg(msg_s.str());\n\t\t\t\tthis->send(&msg);\n\t\t\t}\n\n\t\t}\n\t\t\/\/ Get Queries - all specific to the instance of Chord\n\t\telse if (command.compare(\"SET\") == 0) {\n\t\t\tstr >> command;\n\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0 || command.compare(\"PREDECESSOR\") == 0) {\n\t\t\t\tint index;\n\t\t\t\tstr >> index;\n\n\t\t\t\tstring info;\n\t\t\t\t\/\/ get the Node info\n\t\t\t\tgetline(str, info);\n\t\t\t\tauto node = Node::createFromInfo(info);\n\t\t\t\tif (node->getKey() == myKey) {\n\t\t\t\t\t\/\/ it is this node trying to make us point to it\n\t\t\t\t\tnode = shared_ptr<Node>(this);\n\t\t\t\t}\n\t\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\t\t\/\/ we don't want to reset up a link to the node.\n\t\t\t\t\t\/\/ they just told us to set it up.\n\t\t\t\t\tchord->setSuccessor(index, node, false);\n\t\t\t\t} else {\n\t\t\t\t\tchord->setPredecessor(index, node, false);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"FIND\") == 0) {\n\t\t\tstr >> command;\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tunsigned int key;\n\t\t\t\tstr >> hex >> key;\n\t\t\t\t\/\/ find the closest predecessor\n\t\t\t\t\/\/ return successor of that\n\t\t\t\tauto node = chord->findSuccessor(key);\n\t\t\t\tstring msg = node->toString();\n\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"SEARCH\") == 0) {\n\t\t\tstr >> command;\n\t\t\tif (command.compare(\"SUCCESSOR\") == 0) {\n\t\t\t\tunsigned int key;\n\t\t\t\tstr >> hex >> key;\n\t\t\t\t\/\/ get best option we know of\n\t\t\t\tauto node = chord->findSuccessor(key);\n\n\t\t\t\twhile (true) {\n\t\t\t\t\t\/\/ check this entry for validity\n\t\t\t\t\t\/\/ pred is less than key\n\t\t\t\t\tauto pred = node->getPredecessor();\n\t\t\t\t\tcout << \"Key Range (\" << hex << pred->getKey() << \", \" << hex << node->getKey() << \"]\" << endl;\n\n\t\t\t\t\t\/\/ check if key between predecessor and provided successor\n\t\t\t\t\tif (Chord::inRange(pred->getKey(), node->getKey(), key)) {\n\t\t\t\t\t\t\/\/ if so, then this is the successor!\n\t\t\t\t\t\tstring msg = node->toString();\n\t\t\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcout << \"We have \" << hex << node->getKey() << \". We are looking for \" << hex << key << endl;\n\t\t\t\t\t\t\/\/ get the next best attempt\n\t\t\t\t\t\tnode = node->FindSuccessor(key);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\/\/\t\t\t\tif (node->getKey() == Chord::getInstance()->NodeInfo->getKey()) {\n\/\/\t\t\t\t\t\/\/ we just return ourselves\n\/\/\t\t\t\t\tstring msg = node->toString();\n\/\/\t\t\t\t\tmyRIOBuffer->writeLine(&msg);\n\/\/\t\t\t\t}\n\n\t\t\t\t\/\/ perform iterative lookup of successor for a key\n\t\t\t\t\/\/ use FIND SUCCESSOR on nodes to get the actual value\n\t\t\t\t\/\/ find predecessor to the id\n\t\t\t\t\/\/ return successor of that\n\t\t\t}\n\t\t}\n\t\t\/\/ Find queries\n\t\telse if (command.compare(\"REQUEST\") == 0) {\n\t\t\t\/\/ Join\n\t\t} else {\n\t\t\tif (command.compare(Node::EXIT_MSG) == 0) {\n\t\t\t\t\/\/ quit and close\n\t\t\t\tstring goodbye = \"Goodbye Friend!\\n\";\n\t\t\t\tmyRIOBuffer->writeLine(&goodbye);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif (command.compare(\"LEAVE\") == 0) {\n\t\t\t\tchord->LeaveRing();\n\t\t\t}\n\t\t\tcout << \"Unknown Request: \" << message;\n\t\t}\n\t}\n}\n\nstd::string Node::toString() {\n\tstringstream result;\n\tresult << hex << myKey << \" \" << myIPAddress << \":\" << dec << myPort << endl;\n\treturn result.str();\n}\n\nstd::shared_ptr<Node> Node::getSuccessor(int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET SUCCESSOR \" << index << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nstd::shared_ptr<Node> Node::getPredecessor(int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET PREDECESSOR \" << index << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nbool Node::isConnected() {\n\treturn (myFD > 0);\n}\n\nstd::shared_ptr<Node> Node::SearchSuccessor(unsigned int key) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SEARCH SUCCESSOR \" << hex << key << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nstd::shared_ptr<Node> Node::FindSuccessor(unsigned int key) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"FIND SUCCESSOR \" << hex << key << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\tif (msg.compare(Node::NOT_FOUND) == 0) {\n\t\treturn nullptr;\n\t}\n\treturn Node::createFromInfo(msg);\n}\n\nvoid Node::setSuccessor(Node* node, int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SET SUCCESSOR \" << index << \" \" << node->toString();\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n}\n\nvoid Node::setPredecessor(Node* node, int index) {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"SET PREDECESSOR \" << index << \" \" << node->toString();\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n}\n\nstd::tuple<unsigned int, unsigned int> Node::getRange() {\n\tif (!this->isConnected()) {\n\t\tthis->Connect();\n\t}\n\tstringstream s;\n\ts << \"GET RANGE\" << endl;\n\tstring msg = s.str();\n\tmyRIOBuffer->writeLine(&msg);\n\tmsg = myRIOBuffer->readLine();\n\n\tstringstream response(msg);\n\n\tunsigned int lower;\n\tunsigned int upper;\n\n\tresponse >> lower >> upper;\n\treturn tuple<int, int>(lower, upper);\n}\n\nstd::shared_ptr<Node> Node::createFromInfo(std::string info) {\n\t\/\/ this is in the same format as toString\n\tunsigned int key;\n\tstd::string ip;\n\tint port;\n\n\tstringstream result(info);\n\tresult >> hex >> key >> ip;\n\n\t\/\/ validate key and ip:port\n\t\/\/ TODO: remove && false\n\tif (key != Chord::hashKey(ip) && false) {\n\t\t\/\/ invalid key\n\t\tcout << \"Node \" << hex << key << \" had an invalid key.\" << endl;\n\t\treturn nullptr;\n\t}\n\n\tChord::parseIPPort(ip, &ip, &port);\n\n\treturn shared_ptr<Node>(new Node(ip, port));\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"positiontracker.h\"\n#include <cmath>\n#include <common\/config\/configmanager.h>\n\nPositionTracker::PositionTracker()\n : LOnGPSData(this),\n LOnMotionCommand(this),\n LOnIMUData(this)\n{\n}\n\nPosition PositionTracker::GetPosition()\n{\n return _current_estimate;\n}\n\nPosition PositionTracker::UpdateWithMeasurement(Position S, Position Measurement)\n{\n Position result;\n result.Latitude = ( S.Latitude*Measurement.Latitude.Variance + Measurement.Latitude*S.Latitude.Variance ) \/ (S.Latitude.Variance+Measurement.Latitude.Variance);\n result.Longitude = ( S.Longitude*Measurement.Longitude.Variance + Measurement.Longitude*S.Longitude.Variance ) \/ (S.Longitude.Variance+Measurement.Longitude.Variance);\n result.Heading = ( S.Heading*Measurement.Heading.Variance + Measurement.Heading*S.Heading.Variance ) \/ (S.Heading.Variance+Measurement.Heading.Variance);\n\n result.Latitude.Variance = ( 1.0 \/ (1.0\/S.Latitude.Variance + 1.0 \/ Measurement.Latitude.Variance) );\n result.Longitude.Variance = ( 1.0 \/ (1.0\/S.Longitude.Variance + 1.0 \/ Measurement.Longitude.Variance) );\n result.Heading.Variance = ( 1.0 \/ (1.0\/S.Heading.Variance + 1.0 \/ Measurement.Heading.Variance) );\n return result;\n}\n\nPosition PositionTracker::UpdateWithMotion(Position S, Position Delta)\n{\n Position result;\n result.Latitude = S.Latitude + Delta.Latitude;\n result.Longitude = S.Longitude + Delta.Longitude;\n result.Heading = S.Heading + Delta.Heading;\n\n result.Latitude.Variance = S.Latitude.Variance + Delta.Latitude.Variance;\n result.Longitude.Variance = S.Longitude.Variance + Delta.Longitude.Variance;\n result.Heading.Variance = S.Heading.Variance + Delta.Heading.Variance;\n return result;\n}\n\nPosition PositionTracker::DeltaFromMotionCommand(MotorCommand cmd)\n{\n using namespace std;\n double V = ( cmd.rightVel + cmd.leftVel ) \/ 2.0;\n double W = ( cmd.rightVel - cmd.leftVel ) \/ ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 1.0);\n double t = cmd.millis \/ 1000.0;\n double R = V\/W;\n Position delta;\n double theta = _current_estimate.Heading * M_PI\/180.0;\n double thetaPrime = (_current_estimate.Heading + W*t) * M_PI\/180.0;\n delta.Heading = W*t;\n delta.Latitude = R*(cos(theta) - cos(thetaPrime));\n delta.Longitude = R*(sin(thetaPrime) - sin(theta));\n \/\/ TODO - handle variances\n return delta;\n}\n\nPosition PositionTracker::MeasurementFromIMUData(IMUData data)\n{\n \/\/ Uses the \"Destination point given distance and bearing from start point\" described here:\n \/\/ http:\/\/www.movable-type.co.uk\/scripts\/latlong.html#destPoint\n Position measurement;\n double lat1 = _current_estimate.Latitude;\n double lon1 = _current_estimate.Latitude;\n double hed1 = _current_estimate.Heading;\n double dx = data.X \/* * time*time *\/;\n double dy = data.Y \/* * time*time *\/;\n double d = sqrt(dx*dx + dy*dy); \/\/ Distance travelled\n double R = 6378137; \/\/ radius of Earth\n measurement.Latitude = asin(sin(lat1)*cos(d\/R)+cos(lat1)*sin(d\/R)*cos(hed1));\n measurement.Longitude = (lon1 + atan2(sin(hed1)*sin(d\/R)*cos(lat1),cos(d\/R)-sin(lat1)*sin(measurement.Latitude)));\n measurement.Heading = (atan2((measurement.Longitude-lon1)*sin(lat1), cos(measurement.Latitude)*sin(lat1)-sin(measurement.Latitude)*cos(lat1)*cos(measurement.Longitude-lon1)));\n measurement.Heading = (measurement.Heading+180);\n while(measurement.Heading >= 360)\n measurement.Heading = (measurement.Heading - 360);\n while(measurement.Heading < 0)\n measurement.Heading = (measurement.Heading + 360);\n \/\/ TODO - handle variances\n return measurement;\n}\n\nvoid PositionTracker::OnGPSData(GPSData data)\n{\n Position measurement;\n measurement.Latitude = data.Lat();\n measurement.Longitude = data.Long();\n \/\/ TODO - make sure the GPS actually outputs heading data\n measurement.Heading = data.Heading();\n \/\/ TODO - handle variances\n _current_estimate = UpdateWithMeasurement(_current_estimate, measurement);\n}\n\nvoid PositionTracker::OnIMUData(IMUData data)\n{\n _current_estimate = UpdateWithMeasurement(_current_estimate, MeasurementFromIMUData(data));\n}\n\nvoid PositionTracker::OnMotionCommand(MotorCommand cmd)\n{\n _current_estimate = UpdateWithMotion(_current_estimate, DeltaFromMotionCommand(cmd));\n}\n<commit_msg>Adds some TODO comments to PositionTracker.<commit_after>#include \"positiontracker.h\"\n#include <cmath>\n#include <common\/config\/configmanager.h>\n\nPositionTracker::PositionTracker()\n : LOnGPSData(this),\n LOnMotionCommand(this),\n LOnIMUData(this)\n{\n}\n\nPosition PositionTracker::GetPosition()\n{\n return _current_estimate;\n}\n\nPosition PositionTracker::UpdateWithMeasurement(Position S, Position Measurement)\n{\n Position result;\n result.Latitude = ( S.Latitude*Measurement.Latitude.Variance + Measurement.Latitude*S.Latitude.Variance ) \/ (S.Latitude.Variance+Measurement.Latitude.Variance);\n result.Longitude = ( S.Longitude*Measurement.Longitude.Variance + Measurement.Longitude*S.Longitude.Variance ) \/ (S.Longitude.Variance+Measurement.Longitude.Variance);\n result.Heading = ( S.Heading*Measurement.Heading.Variance + Measurement.Heading*S.Heading.Variance ) \/ (S.Heading.Variance+Measurement.Heading.Variance);\n\n result.Latitude.Variance = ( 1.0 \/ (1.0\/S.Latitude.Variance + 1.0 \/ Measurement.Latitude.Variance) );\n result.Longitude.Variance = ( 1.0 \/ (1.0\/S.Longitude.Variance + 1.0 \/ Measurement.Longitude.Variance) );\n result.Heading.Variance = ( 1.0 \/ (1.0\/S.Heading.Variance + 1.0 \/ Measurement.Heading.Variance) );\n return result;\n}\n\nPosition PositionTracker::UpdateWithMotion(Position S, Position Delta)\n{\n Position result;\n result.Latitude = S.Latitude + Delta.Latitude;\n result.Longitude = S.Longitude + Delta.Longitude;\n result.Heading = S.Heading + Delta.Heading;\n\n result.Latitude.Variance = S.Latitude.Variance + Delta.Latitude.Variance;\n result.Longitude.Variance = S.Longitude.Variance + Delta.Longitude.Variance;\n result.Heading.Variance = S.Heading.Variance + Delta.Heading.Variance;\n return result;\n}\n\nPosition PositionTracker::DeltaFromMotionCommand(MotorCommand cmd)\n{\n \/*\n * TODO - Need to make sure this accounts for the time it takes to actually get to where we're going.\n * Perhaps fire this after the motion command is done.\n *\/\n using namespace std;\n double V = ( cmd.rightVel + cmd.leftVel ) \/ 2.0;\n double W = ( cmd.rightVel - cmd.leftVel ) \/ ConfigManager::Instance().getValue(\"Robot\", \"Baseline\", 1.0);\n double t = cmd.millis \/ 1000.0;\n double R = V\/W;\n Position delta;\n double theta = _current_estimate.Heading * M_PI\/180.0;\n double thetaPrime = (_current_estimate.Heading + W*t) * M_PI\/180.0;\n delta.Heading = W*t;\n delta.Latitude = R*(cos(theta) - cos(thetaPrime));\n delta.Longitude = R*(sin(thetaPrime) - sin(theta));\n \/\/ TODO - handle variances\n return delta;\n}\n\nPosition PositionTracker::MeasurementFromIMUData(IMUData data)\n{\n \/\/ Uses the \"Destination point given distance and bearing from start point\" described here:\n \/\/ http:\/\/www.movable-type.co.uk\/scripts\/latlong.html#destPoint\n Position measurement;\n double lat1 = _current_estimate.Latitude;\n double lon1 = _current_estimate.Latitude;\n double hed1 = _current_estimate.Heading;\n double dx = data.X \/* * time*time *\/;\n double dy = data.Y \/* * time*time *\/;\n double d = sqrt(dx*dx + dy*dy); \/\/ Distance travelled\n double R = 6378137; \/\/ radius of Earth\n measurement.Latitude = asin(sin(lat1)*cos(d\/R)+cos(lat1)*sin(d\/R)*cos(hed1));\n measurement.Longitude = (lon1 + atan2(sin(hed1)*sin(d\/R)*cos(lat1),cos(d\/R)-sin(lat1)*sin(measurement.Latitude)));\n measurement.Heading = (atan2((measurement.Longitude-lon1)*sin(lat1), cos(measurement.Latitude)*sin(lat1)-sin(measurement.Latitude)*cos(lat1)*cos(measurement.Longitude-lon1)));\n measurement.Heading = (measurement.Heading+180);\n while(measurement.Heading >= 360)\n measurement.Heading = (measurement.Heading - 360);\n while(measurement.Heading < 0)\n measurement.Heading = (measurement.Heading + 360);\n \/\/ TODO - handle variances\n return measurement;\n}\n\nvoid PositionTracker::OnGPSData(GPSData data)\n{\n Position measurement;\n measurement.Latitude = data.Lat();\n measurement.Longitude = data.Long();\n \/\/ TODO - make sure the GPS actually outputs heading data\n measurement.Heading = data.Heading();\n \/\/ TODO - handle variances\n _current_estimate = UpdateWithMeasurement(_current_estimate, measurement);\n}\n\nvoid PositionTracker::OnIMUData(IMUData data)\n{\n _current_estimate = UpdateWithMeasurement(_current_estimate, MeasurementFromIMUData(data));\n}\n\nvoid PositionTracker::OnMotionCommand(MotorCommand cmd)\n{\n \/*\n * TODO - Need to make sure this accounts for the time it takes to actually get to where we're going.\n * Perhaps fire this after the motion command is done.\n *\/\n _current_estimate = UpdateWithMotion(_current_estimate, DeltaFromMotionCommand(cmd));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/profiler.h\"\n#include \"base\/string_util.h\"\n\n#if defined(USE_TCMALLOC)\n#include \"third_party\/tcmalloc\/chromium\/src\/google\/profiler.h\"\n#endif\n\n\/\/ When actually using quantify, uncomment the following line.\n\/\/ #define QUANTIFY\n\n#ifdef QUANTIFY\n\/\/ this #define is used to prevent people from directly using pure.h\n\/\/ instead of profiler.h\n#define PURIFY_PRIVATE_INCLUDE\n#include \"base\/third_party\/purify\/pure.h\"\n#endif \/\/ QUANTIFY\n\nnamespace base {\n\nvoid Profiler::StartRecording() {\n#ifdef QUANTIFY\n QuantifyStartRecordingData();\n#elif defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerStart(\"chrome-profile\");\n#endif\n}\n\nvoid Profiler::StopRecording() {\n#ifdef QUANTIFY\n QuantifyStopRecordingData();\n#elif defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerStop();\n#endif\n}\n\nvoid Profiler::Flush() {\n#if defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerFlush();\n#endif\n}\n\nvoid Profiler::ClearData() {\n#ifdef QUANTIFY\n QuantifyClearData();\n#endif\n}\n\nvoid Profiler::SetThreadName(const char *name) {\n#ifdef QUANTIFY\n \/\/ make a copy since the Quantify function takes a char*, not const char*\n char buffer[512];\n base::snprintf(buffer, sizeof(buffer)-1, \"%s\", name);\n QuantifySetThreadName(buffer);\n#endif\n}\n\n} \/\/ namespace base\n<commit_msg>Add a defined(OS_LINUX) guard for the include of tcmalloc's profiler.h<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/profiler.h\"\n#include \"base\/string_util.h\"\n\n#if defined(USE_TCMALLOC) && defined(OS_LINUX)\n#include \"third_party\/tcmalloc\/chromium\/src\/google\/profiler.h\"\n#endif\n\n\/\/ When actually using quantify, uncomment the following line.\n\/\/ #define QUANTIFY\n\n#ifdef QUANTIFY\n\/\/ this #define is used to prevent people from directly using pure.h\n\/\/ instead of profiler.h\n#define PURIFY_PRIVATE_INCLUDE\n#include \"base\/third_party\/purify\/pure.h\"\n#endif \/\/ QUANTIFY\n\nnamespace base {\n\nvoid Profiler::StartRecording() {\n#ifdef QUANTIFY\n QuantifyStartRecordingData();\n#elif defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerStart(\"chrome-profile\");\n#endif\n}\n\nvoid Profiler::StopRecording() {\n#ifdef QUANTIFY\n QuantifyStopRecordingData();\n#elif defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerStop();\n#endif\n}\n\nvoid Profiler::Flush() {\n#if defined(USE_TCMALLOC) && defined(OS_LINUX)\n ProfilerFlush();\n#endif\n}\n\nvoid Profiler::ClearData() {\n#ifdef QUANTIFY\n QuantifyClearData();\n#endif\n}\n\nvoid Profiler::SetThreadName(const char *name) {\n#ifdef QUANTIFY\n \/\/ make a copy since the Quantify function takes a char*, not const char*\n char buffer[512];\n base::snprintf(buffer, sizeof(buffer)-1, \"%s\", name);\n QuantifySetThreadName(buffer);\n#endif\n}\n\n} \/\/ namespace base\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/win_util.h\"\n\n#include <sddl.h>\n\n#include \"base\/logging.h\"\n#include \"base\/registry.h\"\n#include \"base\/scoped_handle.h\"\n#include \"base\/string_util.h\"\n\nnamespace win_util {\n\n#define SIZEOF_STRUCT_WITH_SPECIFIED_LAST_MEMBER(struct_name, member) \\\n offsetof(struct_name, member) + \\\n (sizeof static_cast<struct_name*>(NULL)->member)\n#define NONCLIENTMETRICS_SIZE_PRE_VISTA \\\n SIZEOF_STRUCT_WITH_SPECIFIED_LAST_MEMBER(NONCLIENTMETRICS, lfMessageFont)\n\nvoid GetNonClientMetrics(NONCLIENTMETRICS* metrics) {\n DCHECK(metrics);\n\n static const UINT SIZEOF_NONCLIENTMETRICS =\n (GetWinVersion() == WINVERSION_VISTA) ?\n sizeof(NONCLIENTMETRICS) : NONCLIENTMETRICS_SIZE_PRE_VISTA;\n metrics->cbSize = SIZEOF_NONCLIENTMETRICS;\n const bool success = !!SystemParametersInfo(SPI_GETNONCLIENTMETRICS,\n SIZEOF_NONCLIENTMETRICS, metrics,\n 0);\n DCHECK(success);\n}\n\nWinVersion GetWinVersion() {\n static bool checked_version = false;\n static WinVersion win_version = WINVERSION_PRE_2000;\n if (!checked_version) {\n OSVERSIONINFO version_info;\n version_info.dwOSVersionInfoSize = sizeof version_info;\n GetVersionEx(&version_info);\n if (version_info.dwMajorVersion == 5) {\n switch (version_info.dwMinorVersion) {\n case 0:\n win_version = WINVERSION_2000;\n break;\n case 1:\n win_version = WINVERSION_XP;\n break;\n case 2:\n default:\n win_version = WINVERSION_SERVER_2003;\n break;\n }\n } else if (version_info.dwMajorVersion >= 6) {\n win_version = WINVERSION_VISTA;\n }\n checked_version = true;\n }\n return win_version;\n}\n\nvoid GetServicePackLevel(int* major, int* minor) {\n DCHECK(major && minor);\n static bool checked_version = false;\n static int service_pack_major = -1;\n static int service_pack_minor = -1;\n if (!checked_version) {\n OSVERSIONINFOEX version_info = {0};\n version_info.dwOSVersionInfoSize = sizeof(version_info);\n GetVersionEx(reinterpret_cast<OSVERSIONINFOW*>(&version_info));\n service_pack_major = version_info.wServicePackMajor;\n service_pack_minor = version_info.wServicePackMinor;\n checked_version = true;\n }\n\n *major = service_pack_major;\n *minor = service_pack_minor;\n}\n\nbool AddAccessToKernelObject(HANDLE handle, WELL_KNOWN_SID_TYPE known_sid,\n ACCESS_MASK access) {\n PSECURITY_DESCRIPTOR descriptor = NULL;\n PACL old_dacl = NULL;\n PACL new_dacl = NULL;\n\n if (ERROR_SUCCESS != GetSecurityInfo(handle, SE_KERNEL_OBJECT,\n DACL_SECURITY_INFORMATION, NULL, NULL, &old_dacl, NULL,\n &descriptor))\n return false;\n\n BYTE sid[SECURITY_MAX_SID_SIZE] = {0};\n DWORD size_sid = SECURITY_MAX_SID_SIZE;\n\n if (known_sid == WinSelfSid) {\n \/\/ We hijack WinSelfSid when we want to add the current user instead of\n \/\/ a known sid.\n HANDLE token = NULL;\n if (!OpenProcessToken(GetCurrentProcess(), TOKEN_ALL_ACCESS, &token)) {\n LocalFree(descriptor);\n return false;\n }\n\n DWORD size = sizeof(TOKEN_USER) + size_sid;\n TOKEN_USER* token_user = reinterpret_cast<TOKEN_USER*>(new BYTE[size]);\n scoped_ptr<TOKEN_USER> token_user_ptr(token_user);\n BOOL ret = GetTokenInformation(token, TokenUser, token_user, size, &size);\n\n CloseHandle(token);\n\n if (!ret) {\n LocalFree(descriptor);\n return false;\n }\n memcpy(sid, token_user->User.Sid, size_sid);\n } else {\n if (!CreateWellKnownSid(known_sid , NULL, sid, &size_sid)) {\n LocalFree(descriptor);\n return false;\n }\n }\n\n EXPLICIT_ACCESS new_access = {0};\n new_access.grfAccessMode = GRANT_ACCESS;\n new_access.grfAccessPermissions = access;\n new_access.grfInheritance = NO_INHERITANCE;\n\n new_access.Trustee.pMultipleTrustee = NULL;\n new_access.Trustee.MultipleTrusteeOperation = NO_MULTIPLE_TRUSTEE;\n new_access.Trustee.TrusteeForm = TRUSTEE_IS_SID;\n new_access.Trustee.ptstrName = reinterpret_cast<LPWSTR>(&sid);\n\n if (ERROR_SUCCESS != SetEntriesInAcl(1, &new_access, old_dacl, &new_dacl)) {\n LocalFree(descriptor);\n return false;\n }\n\n DWORD result = SetSecurityInfo(handle, SE_KERNEL_OBJECT,\n DACL_SECURITY_INFORMATION, NULL, NULL,\n new_dacl, NULL);\n\n LocalFree(new_dacl);\n LocalFree(descriptor);\n\n if (ERROR_SUCCESS != result)\n return false;\n\n return true;\n}\n\nbool GetUserSidString(std::wstring* user_sid) {\n \/\/ Get the current token.\n HANDLE token = NULL;\n if (!::OpenProcessToken(::GetCurrentProcess(), TOKEN_QUERY, &token))\n return false;\n ScopedHandle token_scoped(token);\n\n DWORD size = sizeof(TOKEN_USER) + SECURITY_MAX_SID_SIZE;\n scoped_ptr<TOKEN_USER> user(reinterpret_cast<TOKEN_USER*>(new BYTE[size]));\n\n if (!::GetTokenInformation(token, TokenUser, user.get(), size, &size))\n return false;\n\n if (!user->User.Sid)\n return false;\n\n \/\/ Convert the data to a string.\n wchar_t* sid_string;\n if (!::ConvertSidToStringSid(user->User.Sid, &sid_string))\n return false;\n\n *user_sid = sid_string;\n\n ::LocalFree(sid_string);\n\n return true;\n}\n\nbool GetLogonSessionOnlyDACL(SECURITY_DESCRIPTOR** security_descriptor) {\n \/\/ Get the current token.\n HANDLE token = NULL;\n if (!OpenProcessToken(::GetCurrentProcess(), TOKEN_QUERY, &token))\n return false;\n ScopedHandle token_scoped(token);\n\n \/\/ Get the size of the TokenGroups structure.\n DWORD size = 0;\n BOOL result = GetTokenInformation(token, TokenGroups, NULL, 0, &size);\n if (result != FALSE && GetLastError() != ERROR_INSUFFICIENT_BUFFER)\n return false;\n\n \/\/ Get the data.\n scoped_ptr<TOKEN_GROUPS> token_groups;\n token_groups.reset(reinterpret_cast<TOKEN_GROUPS*>(new char[size]));\n\n if (!GetTokenInformation(token, TokenGroups, token_groups.get(), size, &size))\n return false;\n\n \/\/ Look for the logon sid.\n SID* logon_sid = NULL;\n for (unsigned int i = 0; i < token_groups->GroupCount ; ++i) {\n if ((token_groups->Groups[i].Attributes & SE_GROUP_LOGON_ID) != 0) {\n logon_sid = static_cast<SID*>(token_groups->Groups[i].Sid);\n break;\n }\n }\n\n if (!logon_sid)\n return false;\n\n \/\/ Convert the data to a string.\n wchar_t* sid_string;\n if (!ConvertSidToStringSid(logon_sid, &sid_string))\n return false;\n\n static const wchar_t dacl_format[] = L\"D:(A;OICI;GA;;;%ls)\";\n wchar_t dacl[SECURITY_MAX_SID_SIZE + arraysize(dacl_format) + 1] = {0};\n wsprintf(dacl, dacl_format, sid_string);\n\n LocalFree(sid_string);\n\n \/\/ Convert the string to a security descriptor\n if (!ConvertStringSecurityDescriptorToSecurityDescriptor(\n dacl,\n SDDL_REVISION_1,\n reinterpret_cast<PSECURITY_DESCRIPTOR*>(security_descriptor),\n NULL)) {\n return false;\n }\n\n return true;\n}\n\n#pragma warning(push)\n#pragma warning(disable:4312 4244)\nWNDPROC SetWindowProc(HWND hwnd, WNDPROC proc) {\n \/\/ The reason we don't return the SetwindowLongPtr() value is that it returns\n \/\/ the orignal window procedure and not the current one. I don't know if it is\n \/\/ a bug or an intended feature.\n WNDPROC oldwindow_proc =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(hwnd, GWLP_WNDPROC));\n SetWindowLongPtr(hwnd, GWLP_WNDPROC, reinterpret_cast<LONG_PTR>(proc));\n return oldwindow_proc;\n}\n\nvoid* SetWindowUserData(HWND hwnd, void* user_data) {\n return\n reinterpret_cast<void*>(SetWindowLongPtr(hwnd, GWLP_USERDATA,\n reinterpret_cast<LONG_PTR>(user_data)));\n}\n\nvoid* GetWindowUserData(HWND hwnd) {\n return reinterpret_cast<void*>(GetWindowLongPtr(hwnd, GWLP_USERDATA));\n}\n\n\/\/ Maps to the WNDPROC for a window that was active before the subclass was\n\/\/ installed.\nstatic const wchar_t* const kHandlerKey = L\"__ORIGINAL_MESSAGE_HANDLER__\";\n\nbool Subclass(HWND window, WNDPROC subclass_proc) {\n WNDPROC original_handler =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(window, GWLP_WNDPROC));\n if (original_handler != subclass_proc) {\n win_util::SetWindowProc(window, subclass_proc);\n SetProp(window, kHandlerKey, original_handler);\n return true;\n }\n return false;\n}\n\nbool Unsubclass(HWND window, WNDPROC subclass_proc) {\n WNDPROC current_handler =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(window, GWLP_WNDPROC));\n if (current_handler == subclass_proc) {\n HANDLE original_handler = GetProp(window, kHandlerKey);\n if (original_handler) {\n RemoveProp(window, kHandlerKey);\n win_util::SetWindowProc(window,\n reinterpret_cast<WNDPROC>(original_handler));\n return true;\n }\n }\n return false;\n}\n\nWNDPROC GetSuperclassWNDPROC(HWND window) {\n return reinterpret_cast<WNDPROC>(GetProp(window, kHandlerKey));\n}\n\n#pragma warning(pop)\n\nbool IsShiftPressed() {\n return (::GetKeyState(VK_SHIFT) & 0x80) == 0x80;\n}\n\nbool IsCtrlPressed() {\n return (::GetKeyState(VK_CONTROL) & 0x80) == 0x80;\n}\n\nbool IsAltPressed() {\n return (::GetKeyState(VK_MENU) & 0x80) == 0x80;\n}\n\nstd::wstring GetClassName(HWND window) {\n \/\/ GetClassNameW will return a truncated result (properly null terminated) if\n \/\/ the given buffer is not large enough. So, it is not possible to determine\n \/\/ that we got the entire class name if the result is exactly equal to the\n \/\/ size of the buffer minus one.\n DWORD buffer_size = MAX_PATH;\n while (true) {\n std::wstring output;\n DWORD size_ret =\n GetClassNameW(window, WriteInto(&output, buffer_size), buffer_size);\n if (size_ret == 0)\n break;\n if (size_ret < (buffer_size - 1)) {\n output.resize(size_ret);\n return output;\n }\n buffer_size *= 2;\n }\n return std::wstring(); \/\/ error\n}\n\nbool UserAccountControlIsEnabled() {\n RegKey key(HKEY_LOCAL_MACHINE,\n L\"SOFTWARE\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Policies\\\\System\");\n DWORD uac_enabled;\n if (!key.ReadValueDW(L\"EnableLUA\", &uac_enabled))\n return true;\n return (uac_enabled == 1);\n}\n\nstd::wstring FormatMessage(unsigned messageid) {\n wchar_t* string_buffer = NULL;\n unsigned string_length = ::FormatMessage(\n FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM |\n FORMAT_MESSAGE_IGNORE_INSERTS, NULL, messageid, 0,\n reinterpret_cast<wchar_t *>(&string_buffer), 0, NULL);\n\n std::wstring formatted_string;\n if (string_buffer) {\n formatted_string = string_buffer;\n LocalFree(reinterpret_cast<HLOCAL>(string_buffer));\n } else {\n \/\/ The formating failed. simply convert the message value into a string.\n SStringPrintf(&formatted_string, L\"message number %d\", messageid);\n }\n return formatted_string;\n}\n\nstd::wstring FormatLastWin32Error() {\n return FormatMessage(GetLastError());\n}\n\n} \/\/ namespace win_util\n\n#ifdef _MSC_VER\n\/\/\n\/\/ If the ASSERT below fails, please install Visual Studio 2005 Service Pack 1.\n\/\/\nextern char VisualStudio2005ServicePack1Detection[10];\nCOMPILE_ASSERT(sizeof(&VisualStudio2005ServicePack1Detection) == sizeof(void*),\n VS2005SP1Detect);\n\/\/\n\/\/ Chrome requires at least Service Pack 1 for Visual Studio 2005.\n\/\/\n#endif \/\/ _MSC_VER\n\n#ifndef COPY_FILE_COPY_SYMLINK\n#error You must install the Windows 2008 or Vista Software Development Kit and \\\nset it as your default include path to build this library. You can grab it by \\\nsearching for \"download windows sdk 2008\" in your favorite web search engine. \\\nAlso make sure you register the SDK with Visual Studio, by selecting \\\n\"Integrate Windows SDK with Visual Studio 2005\" from the Windows SDK \\\nmenu (see Start - All Programs - Microsoft Windows SDK - \\\nVisual Studio Registration).\n#endif\n<commit_msg>More fun with detecting UAC. Reports in the field indicate that some computers have EnableLUA set to 2, which Vista treats as UAC 'on' but since our check checks for uac == 1 we think UAC is 'off'.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/win_util.h\"\n\n#include <sddl.h>\n\n#include \"base\/logging.h\"\n#include \"base\/registry.h\"\n#include \"base\/scoped_handle.h\"\n#include \"base\/string_util.h\"\n\nnamespace win_util {\n\n#define SIZEOF_STRUCT_WITH_SPECIFIED_LAST_MEMBER(struct_name, member) \\\n offsetof(struct_name, member) + \\\n (sizeof static_cast<struct_name*>(NULL)->member)\n#define NONCLIENTMETRICS_SIZE_PRE_VISTA \\\n SIZEOF_STRUCT_WITH_SPECIFIED_LAST_MEMBER(NONCLIENTMETRICS, lfMessageFont)\n\nvoid GetNonClientMetrics(NONCLIENTMETRICS* metrics) {\n DCHECK(metrics);\n\n static const UINT SIZEOF_NONCLIENTMETRICS =\n (GetWinVersion() == WINVERSION_VISTA) ?\n sizeof(NONCLIENTMETRICS) : NONCLIENTMETRICS_SIZE_PRE_VISTA;\n metrics->cbSize = SIZEOF_NONCLIENTMETRICS;\n const bool success = !!SystemParametersInfo(SPI_GETNONCLIENTMETRICS,\n SIZEOF_NONCLIENTMETRICS, metrics,\n 0);\n DCHECK(success);\n}\n\nWinVersion GetWinVersion() {\n static bool checked_version = false;\n static WinVersion win_version = WINVERSION_PRE_2000;\n if (!checked_version) {\n OSVERSIONINFO version_info;\n version_info.dwOSVersionInfoSize = sizeof version_info;\n GetVersionEx(&version_info);\n if (version_info.dwMajorVersion == 5) {\n switch (version_info.dwMinorVersion) {\n case 0:\n win_version = WINVERSION_2000;\n break;\n case 1:\n win_version = WINVERSION_XP;\n break;\n case 2:\n default:\n win_version = WINVERSION_SERVER_2003;\n break;\n }\n } else if (version_info.dwMajorVersion >= 6) {\n win_version = WINVERSION_VISTA;\n }\n checked_version = true;\n }\n return win_version;\n}\n\nvoid GetServicePackLevel(int* major, int* minor) {\n DCHECK(major && minor);\n static bool checked_version = false;\n static int service_pack_major = -1;\n static int service_pack_minor = -1;\n if (!checked_version) {\n OSVERSIONINFOEX version_info = {0};\n version_info.dwOSVersionInfoSize = sizeof(version_info);\n GetVersionEx(reinterpret_cast<OSVERSIONINFOW*>(&version_info));\n service_pack_major = version_info.wServicePackMajor;\n service_pack_minor = version_info.wServicePackMinor;\n checked_version = true;\n }\n\n *major = service_pack_major;\n *minor = service_pack_minor;\n}\n\nbool AddAccessToKernelObject(HANDLE handle, WELL_KNOWN_SID_TYPE known_sid,\n ACCESS_MASK access) {\n PSECURITY_DESCRIPTOR descriptor = NULL;\n PACL old_dacl = NULL;\n PACL new_dacl = NULL;\n\n if (ERROR_SUCCESS != GetSecurityInfo(handle, SE_KERNEL_OBJECT,\n DACL_SECURITY_INFORMATION, NULL, NULL, &old_dacl, NULL,\n &descriptor))\n return false;\n\n BYTE sid[SECURITY_MAX_SID_SIZE] = {0};\n DWORD size_sid = SECURITY_MAX_SID_SIZE;\n\n if (known_sid == WinSelfSid) {\n \/\/ We hijack WinSelfSid when we want to add the current user instead of\n \/\/ a known sid.\n HANDLE token = NULL;\n if (!OpenProcessToken(GetCurrentProcess(), TOKEN_ALL_ACCESS, &token)) {\n LocalFree(descriptor);\n return false;\n }\n\n DWORD size = sizeof(TOKEN_USER) + size_sid;\n TOKEN_USER* token_user = reinterpret_cast<TOKEN_USER*>(new BYTE[size]);\n scoped_ptr<TOKEN_USER> token_user_ptr(token_user);\n BOOL ret = GetTokenInformation(token, TokenUser, token_user, size, &size);\n\n CloseHandle(token);\n\n if (!ret) {\n LocalFree(descriptor);\n return false;\n }\n memcpy(sid, token_user->User.Sid, size_sid);\n } else {\n if (!CreateWellKnownSid(known_sid , NULL, sid, &size_sid)) {\n LocalFree(descriptor);\n return false;\n }\n }\n\n EXPLICIT_ACCESS new_access = {0};\n new_access.grfAccessMode = GRANT_ACCESS;\n new_access.grfAccessPermissions = access;\n new_access.grfInheritance = NO_INHERITANCE;\n\n new_access.Trustee.pMultipleTrustee = NULL;\n new_access.Trustee.MultipleTrusteeOperation = NO_MULTIPLE_TRUSTEE;\n new_access.Trustee.TrusteeForm = TRUSTEE_IS_SID;\n new_access.Trustee.ptstrName = reinterpret_cast<LPWSTR>(&sid);\n\n if (ERROR_SUCCESS != SetEntriesInAcl(1, &new_access, old_dacl, &new_dacl)) {\n LocalFree(descriptor);\n return false;\n }\n\n DWORD result = SetSecurityInfo(handle, SE_KERNEL_OBJECT,\n DACL_SECURITY_INFORMATION, NULL, NULL,\n new_dacl, NULL);\n\n LocalFree(new_dacl);\n LocalFree(descriptor);\n\n if (ERROR_SUCCESS != result)\n return false;\n\n return true;\n}\n\nbool GetUserSidString(std::wstring* user_sid) {\n \/\/ Get the current token.\n HANDLE token = NULL;\n if (!::OpenProcessToken(::GetCurrentProcess(), TOKEN_QUERY, &token))\n return false;\n ScopedHandle token_scoped(token);\n\n DWORD size = sizeof(TOKEN_USER) + SECURITY_MAX_SID_SIZE;\n scoped_ptr<TOKEN_USER> user(reinterpret_cast<TOKEN_USER*>(new BYTE[size]));\n\n if (!::GetTokenInformation(token, TokenUser, user.get(), size, &size))\n return false;\n\n if (!user->User.Sid)\n return false;\n\n \/\/ Convert the data to a string.\n wchar_t* sid_string;\n if (!::ConvertSidToStringSid(user->User.Sid, &sid_string))\n return false;\n\n *user_sid = sid_string;\n\n ::LocalFree(sid_string);\n\n return true;\n}\n\nbool GetLogonSessionOnlyDACL(SECURITY_DESCRIPTOR** security_descriptor) {\n \/\/ Get the current token.\n HANDLE token = NULL;\n if (!OpenProcessToken(::GetCurrentProcess(), TOKEN_QUERY, &token))\n return false;\n ScopedHandle token_scoped(token);\n\n \/\/ Get the size of the TokenGroups structure.\n DWORD size = 0;\n BOOL result = GetTokenInformation(token, TokenGroups, NULL, 0, &size);\n if (result != FALSE && GetLastError() != ERROR_INSUFFICIENT_BUFFER)\n return false;\n\n \/\/ Get the data.\n scoped_ptr<TOKEN_GROUPS> token_groups;\n token_groups.reset(reinterpret_cast<TOKEN_GROUPS*>(new char[size]));\n\n if (!GetTokenInformation(token, TokenGroups, token_groups.get(), size, &size))\n return false;\n\n \/\/ Look for the logon sid.\n SID* logon_sid = NULL;\n for (unsigned int i = 0; i < token_groups->GroupCount ; ++i) {\n if ((token_groups->Groups[i].Attributes & SE_GROUP_LOGON_ID) != 0) {\n logon_sid = static_cast<SID*>(token_groups->Groups[i].Sid);\n break;\n }\n }\n\n if (!logon_sid)\n return false;\n\n \/\/ Convert the data to a string.\n wchar_t* sid_string;\n if (!ConvertSidToStringSid(logon_sid, &sid_string))\n return false;\n\n static const wchar_t dacl_format[] = L\"D:(A;OICI;GA;;;%ls)\";\n wchar_t dacl[SECURITY_MAX_SID_SIZE + arraysize(dacl_format) + 1] = {0};\n wsprintf(dacl, dacl_format, sid_string);\n\n LocalFree(sid_string);\n\n \/\/ Convert the string to a security descriptor\n if (!ConvertStringSecurityDescriptorToSecurityDescriptor(\n dacl,\n SDDL_REVISION_1,\n reinterpret_cast<PSECURITY_DESCRIPTOR*>(security_descriptor),\n NULL)) {\n return false;\n }\n\n return true;\n}\n\n#pragma warning(push)\n#pragma warning(disable:4312 4244)\nWNDPROC SetWindowProc(HWND hwnd, WNDPROC proc) {\n \/\/ The reason we don't return the SetwindowLongPtr() value is that it returns\n \/\/ the orignal window procedure and not the current one. I don't know if it is\n \/\/ a bug or an intended feature.\n WNDPROC oldwindow_proc =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(hwnd, GWLP_WNDPROC));\n SetWindowLongPtr(hwnd, GWLP_WNDPROC, reinterpret_cast<LONG_PTR>(proc));\n return oldwindow_proc;\n}\n\nvoid* SetWindowUserData(HWND hwnd, void* user_data) {\n return\n reinterpret_cast<void*>(SetWindowLongPtr(hwnd, GWLP_USERDATA,\n reinterpret_cast<LONG_PTR>(user_data)));\n}\n\nvoid* GetWindowUserData(HWND hwnd) {\n return reinterpret_cast<void*>(GetWindowLongPtr(hwnd, GWLP_USERDATA));\n}\n\n\/\/ Maps to the WNDPROC for a window that was active before the subclass was\n\/\/ installed.\nstatic const wchar_t* const kHandlerKey = L\"__ORIGINAL_MESSAGE_HANDLER__\";\n\nbool Subclass(HWND window, WNDPROC subclass_proc) {\n WNDPROC original_handler =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(window, GWLP_WNDPROC));\n if (original_handler != subclass_proc) {\n win_util::SetWindowProc(window, subclass_proc);\n SetProp(window, kHandlerKey, original_handler);\n return true;\n }\n return false;\n}\n\nbool Unsubclass(HWND window, WNDPROC subclass_proc) {\n WNDPROC current_handler =\n reinterpret_cast<WNDPROC>(GetWindowLongPtr(window, GWLP_WNDPROC));\n if (current_handler == subclass_proc) {\n HANDLE original_handler = GetProp(window, kHandlerKey);\n if (original_handler) {\n RemoveProp(window, kHandlerKey);\n win_util::SetWindowProc(window,\n reinterpret_cast<WNDPROC>(original_handler));\n return true;\n }\n }\n return false;\n}\n\nWNDPROC GetSuperclassWNDPROC(HWND window) {\n return reinterpret_cast<WNDPROC>(GetProp(window, kHandlerKey));\n}\n\n#pragma warning(pop)\n\nbool IsShiftPressed() {\n return (::GetKeyState(VK_SHIFT) & 0x80) == 0x80;\n}\n\nbool IsCtrlPressed() {\n return (::GetKeyState(VK_CONTROL) & 0x80) == 0x80;\n}\n\nbool IsAltPressed() {\n return (::GetKeyState(VK_MENU) & 0x80) == 0x80;\n}\n\nstd::wstring GetClassName(HWND window) {\n \/\/ GetClassNameW will return a truncated result (properly null terminated) if\n \/\/ the given buffer is not large enough. So, it is not possible to determine\n \/\/ that we got the entire class name if the result is exactly equal to the\n \/\/ size of the buffer minus one.\n DWORD buffer_size = MAX_PATH;\n while (true) {\n std::wstring output;\n DWORD size_ret =\n GetClassNameW(window, WriteInto(&output, buffer_size), buffer_size);\n if (size_ret == 0)\n break;\n if (size_ret < (buffer_size - 1)) {\n output.resize(size_ret);\n return output;\n }\n buffer_size *= 2;\n }\n return std::wstring(); \/\/ error\n}\n\nbool UserAccountControlIsEnabled() {\n RegKey key(HKEY_LOCAL_MACHINE,\n L\"SOFTWARE\\\\Microsoft\\\\Windows\\\\CurrentVersion\\\\Policies\\\\System\");\n DWORD uac_enabled;\n if (!key.ReadValueDW(L\"EnableLUA\", &uac_enabled))\n return true;\n \/\/ Users can set the EnableLUA value to something arbitrary, like 2, which\n \/\/ Vista will treat as UAC enabled, so we make sure it is not set to 0.\n return (uac_enabled != 0);\n}\n\nstd::wstring FormatMessage(unsigned messageid) {\n wchar_t* string_buffer = NULL;\n unsigned string_length = ::FormatMessage(\n FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM |\n FORMAT_MESSAGE_IGNORE_INSERTS, NULL, messageid, 0,\n reinterpret_cast<wchar_t *>(&string_buffer), 0, NULL);\n\n std::wstring formatted_string;\n if (string_buffer) {\n formatted_string = string_buffer;\n LocalFree(reinterpret_cast<HLOCAL>(string_buffer));\n } else {\n \/\/ The formating failed. simply convert the message value into a string.\n SStringPrintf(&formatted_string, L\"message number %d\", messageid);\n }\n return formatted_string;\n}\n\nstd::wstring FormatLastWin32Error() {\n return FormatMessage(GetLastError());\n}\n\n} \/\/ namespace win_util\n\n#ifdef _MSC_VER\n\/\/\n\/\/ If the ASSERT below fails, please install Visual Studio 2005 Service Pack 1.\n\/\/\nextern char VisualStudio2005ServicePack1Detection[10];\nCOMPILE_ASSERT(sizeof(&VisualStudio2005ServicePack1Detection) == sizeof(void*),\n VS2005SP1Detect);\n\/\/\n\/\/ Chrome requires at least Service Pack 1 for Visual Studio 2005.\n\/\/\n#endif \/\/ _MSC_VER\n\n#ifndef COPY_FILE_COPY_SYMLINK\n#error You must install the Windows 2008 or Vista Software Development Kit and \\\nset it as your default include path to build this library. You can grab it by \\\nsearching for \"download windows sdk 2008\" in your favorite web search engine. \\\nAlso make sure you register the SDK with Visual Studio, by selecting \\\n\"Integrate Windows SDK with Visual Studio 2005\" from the Windows SDK \\\nmenu (see Start - All Programs - Microsoft Windows SDK - \\\nVisual Studio Registration).\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Protocol Buffers - Google's data interchange format\n\/\/ Copyright 2008 Google Inc. All rights reserved.\n\/\/ https:\/\/developers.google.com\/protocol-buffers\/\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <google\/protobuf\/compiler\/cpp\/cpp_map_field.h>\n\n#include <google\/protobuf\/compiler\/cpp\/cpp_helpers.h>\n#include <google\/protobuf\/io\/printer.h>\n#include <google\/protobuf\/wire_format.h>\n#include <google\/protobuf\/stubs\/strutil.h>\n\n\nnamespace google {\nnamespace protobuf {\nnamespace compiler {\nnamespace cpp {\n\nbool IsProto3Field(const FieldDescriptor* field_descriptor) {\n const FileDescriptor* file_descriptor = field_descriptor->file();\n return file_descriptor->syntax() == FileDescriptor::SYNTAX_PROTO3;\n}\n\nvoid SetMessageVariables(const FieldDescriptor* descriptor,\n std::map<std::string, std::string>* variables,\n const Options& options) {\n SetCommonFieldVariables(descriptor, variables, options);\n (*variables)[\"type\"] = ClassName(descriptor->message_type(), false);\n (*variables)[\"full_name\"] = descriptor->full_name();\n\n const FieldDescriptor* key =\n descriptor->message_type()->FindFieldByName(\"key\");\n const FieldDescriptor* val =\n descriptor->message_type()->FindFieldByName(\"value\");\n (*variables)[\"key_cpp\"] = PrimitiveTypeName(options, key->cpp_type());\n switch (val->cpp_type()) {\n case FieldDescriptor::CPPTYPE_MESSAGE:\n (*variables)[\"val_cpp\"] = FieldMessageTypeName(val, options);\n break;\n case FieldDescriptor::CPPTYPE_ENUM:\n (*variables)[\"val_cpp\"] = ClassName(val->enum_type(), true);\n break;\n default:\n (*variables)[\"val_cpp\"] = PrimitiveTypeName(options, val->cpp_type());\n }\n (*variables)[\"key_wire_type\"] =\n \"TYPE_\" + ToUpper(DeclaredTypeMethodName(key->type()));\n (*variables)[\"val_wire_type\"] =\n \"TYPE_\" + ToUpper(DeclaredTypeMethodName(val->type()));\n (*variables)[\"map_classname\"] = ClassName(descriptor->message_type(), false);\n (*variables)[\"number\"] = StrCat(descriptor->number());\n (*variables)[\"tag\"] = StrCat(internal::WireFormat::MakeTag(descriptor));\n\n if (HasDescriptorMethods(descriptor->file(), options)) {\n (*variables)[\"lite\"] = \"\";\n } else {\n (*variables)[\"lite\"] = \"Lite\";\n }\n}\n\nMapFieldGenerator::MapFieldGenerator(const FieldDescriptor* descriptor,\n const Options& options)\n : FieldGenerator(descriptor, options) {\n SetMessageVariables(descriptor, &variables_, options);\n}\n\nMapFieldGenerator::~MapFieldGenerator() {}\n\nvoid MapFieldGenerator::GeneratePrivateMembers(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"::$proto_ns$::internal::MapField$lite$<\\n\"\n \" $map_classname$,\\n\"\n \" $key_cpp$, $val_cpp$,\\n\"\n \" ::$proto_ns$::internal::WireFormatLite::$key_wire_type$,\\n\"\n \" ::$proto_ns$::internal::WireFormatLite::$val_wire_type$> \"\n \"$name$_;\\n\");\n}\n\nvoid MapFieldGenerator::GenerateAccessorDeclarations(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"private:\\n\"\n \"const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \" ${1$_internal_$name$$}$() const;\\n\"\n \"::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \" ${1$_internal_mutable_$name$$}$();\\n\"\n \"public:\\n\"\n \"$deprecated_attr$const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \" ${1$$name$$}$() const;\\n\"\n \"$deprecated_attr$::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \" ${1$mutable_$name$$}$();\\n\",\n descriptor_);\n}\n\nvoid MapFieldGenerator::GenerateInlineAccessorDefinitions(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"inline const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \"$classname$::_internal_$name$() const {\\n\"\n \" return $name$_.GetMap();\\n\"\n \"}\\n\"\n \"inline const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \"$classname$::$name$() const {\\n\"\n \"$annotate_accessor$\"\n \" \/\/ @@protoc_insertion_point(field_map:$full_name$)\\n\"\n \" return _internal_$name$();\\n\"\n \"}\\n\"\n \"inline ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \"$classname$::_internal_mutable_$name$() {\\n\"\n \" return $name$_.MutableMap();\\n\"\n \"}\\n\"\n \"inline ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \"$classname$::mutable_$name$() {\\n\"\n \"$annotate_accessor$\"\n \" \/\/ @@protoc_insertion_point(field_mutable_map:$full_name$)\\n\"\n \" return _internal_mutable_$name$();\\n\"\n \"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateClearingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.Clear();\\n\");\n}\n\nvoid MapFieldGenerator::GenerateMergingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.MergeFrom(from.$name$_);\\n\");\n}\n\nvoid MapFieldGenerator::GenerateSwappingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.InternalSwap(&other->$name$_);\\n\");\n}\n\nvoid MapFieldGenerator::GenerateCopyConstructorCode(\n io::Printer* printer) const {\n GenerateConstructorCode(printer);\n GenerateMergingCode(printer);\n}\n\nstatic void GenerateSerializationLoop(const Formatter& format, bool string_key,\n bool string_value,\n bool is_deterministic) {\n std::string ptr;\n if (is_deterministic) {\n format(\"for (size_type i = 0; i < n; i++) {\\n\");\n ptr = string_key ? \"items[static_cast<ptrdiff_t>(i)]\"\n : \"items[static_cast<ptrdiff_t>(i)].second\";\n } else {\n format(\n \"for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it) {\\n\");\n ptr = \"it\";\n }\n format.Indent();\n\n format(\n \"target = $map_classname$::Funcs::InternalSerialize($number$, \"\n \"$1$->first, $1$->second, target, stream);\\n\",\n ptr);\n\n if (string_key || string_value) {\n \/\/ ptr is either an actual pointer or an iterator, either way we can\n \/\/ create a pointer by taking the address after de-referencing it.\n format(\"Utf8Check::Check(&(*$1$));\\n\", ptr);\n }\n\n format.Outdent();\n format(\"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateSerializeWithCachedSizesToArray(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"if (!this->_internal_$name$().empty()) {\\n\");\n format.Indent();\n const FieldDescriptor* key_field =\n descriptor_->message_type()->FindFieldByName(\"key\");\n const FieldDescriptor* value_field =\n descriptor_->message_type()->FindFieldByName(\"value\");\n const bool string_key = key_field->type() == FieldDescriptor::TYPE_STRING;\n const bool string_value = value_field->type() == FieldDescriptor::TYPE_STRING;\n\n format(\n \"typedef ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_pointer\\n\"\n \" ConstPtr;\\n\");\n if (string_key) {\n format(\n \"typedef ConstPtr SortItem;\\n\"\n \"typedef ::$proto_ns$::internal::\"\n \"CompareByDerefFirst<SortItem> Less;\\n\");\n } else {\n format(\n \"typedef ::$proto_ns$::internal::SortItem< $key_cpp$, ConstPtr > \"\n \"SortItem;\\n\"\n \"typedef ::$proto_ns$::internal::CompareByFirstField<SortItem> \"\n \"Less;\\n\");\n }\n bool utf8_check = string_key || string_value;\n if (utf8_check) {\n format(\n \"struct Utf8Check {\\n\"\n \" static void Check(ConstPtr p) {\\n\");\n format.Indent();\n format.Indent();\n if (string_key) {\n GenerateUtf8CheckCodeForString(\n key_field, options_, false,\n \"p->first.data(), static_cast<int>(p->first.length()),\\n\", format);\n }\n if (string_value) {\n GenerateUtf8CheckCodeForString(\n value_field, options_, false,\n \"p->second.data(), static_cast<int>(p->second.length()),\\n\", format);\n }\n format.Outdent();\n format.Outdent();\n format(\n \" }\\n\"\n \"};\\n\");\n }\n\n format(\n \"\\n\"\n \"if (stream->IsSerializationDeterministic() &&\\n\"\n \" this->_internal_$name$().size() > 1) {\\n\"\n \" ::std::unique_ptr<SortItem[]> items(\\n\"\n \" new SortItem[this->_internal_$name$().size()]);\\n\"\n \" typedef ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::size_type \"\n \"size_type;\\n\"\n \" size_type n = 0;\\n\"\n \" for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it, ++n) {\\n\"\n \" items[static_cast<ptrdiff_t>(n)] = SortItem(&*it);\\n\"\n \" }\\n\"\n \" ::std::sort(&items[0], &items[static_cast<ptrdiff_t>(n)], Less());\\n\");\n format.Indent();\n GenerateSerializationLoop(format, string_key, string_value, true);\n format.Outdent();\n format(\"} else {\\n\");\n format.Indent();\n GenerateSerializationLoop(format, string_key, string_value, false);\n format.Outdent();\n format(\"}\\n\");\n format.Outdent();\n format(\"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateByteSize(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"total_size += $tag_size$ *\\n\"\n \" \"\n \"::$proto_ns$::internal::FromIntSize(this->_internal_$name$_size());\\n\"\n \"for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it) {\\n\"\n \" total_size += $map_classname$::Funcs::ByteSizeLong(it->first, \"\n \"it->second);\\n\"\n \"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateConstinitInitializer(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n if (HasDescriptorMethods(descriptor_->file(), options_)) {\n format(\"$name$_(::$proto_ns$::internal::ConstantInitialized{})\");\n } else {\n format(\"$name$_()\");\n }\n}\n\n} \/\/ namespace cpp\n} \/\/ namespace compiler\n} \/\/ namespace protobuf\n} \/\/ namespace google\n<commit_msg>Fix -Wunused-parameter in map<string, int> fields (fixes #8494) (#8500)<commit_after>\/\/ Protocol Buffers - Google's data interchange format\n\/\/ Copyright 2008 Google Inc. All rights reserved.\n\/\/ https:\/\/developers.google.com\/protocol-buffers\/\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <google\/protobuf\/compiler\/cpp\/cpp_map_field.h>\n\n#include <google\/protobuf\/compiler\/cpp\/cpp_helpers.h>\n#include <google\/protobuf\/io\/printer.h>\n#include <google\/protobuf\/wire_format.h>\n#include <google\/protobuf\/stubs\/strutil.h>\n\n\nnamespace google {\nnamespace protobuf {\nnamespace compiler {\nnamespace cpp {\n\nbool IsProto3Field(const FieldDescriptor* field_descriptor) {\n const FileDescriptor* file_descriptor = field_descriptor->file();\n return file_descriptor->syntax() == FileDescriptor::SYNTAX_PROTO3;\n}\n\nvoid SetMessageVariables(const FieldDescriptor* descriptor,\n std::map<std::string, std::string>* variables,\n const Options& options) {\n SetCommonFieldVariables(descriptor, variables, options);\n (*variables)[\"type\"] = ClassName(descriptor->message_type(), false);\n (*variables)[\"full_name\"] = descriptor->full_name();\n\n const FieldDescriptor* key =\n descriptor->message_type()->FindFieldByName(\"key\");\n const FieldDescriptor* val =\n descriptor->message_type()->FindFieldByName(\"value\");\n (*variables)[\"key_cpp\"] = PrimitiveTypeName(options, key->cpp_type());\n switch (val->cpp_type()) {\n case FieldDescriptor::CPPTYPE_MESSAGE:\n (*variables)[\"val_cpp\"] = FieldMessageTypeName(val, options);\n break;\n case FieldDescriptor::CPPTYPE_ENUM:\n (*variables)[\"val_cpp\"] = ClassName(val->enum_type(), true);\n break;\n default:\n (*variables)[\"val_cpp\"] = PrimitiveTypeName(options, val->cpp_type());\n }\n (*variables)[\"key_wire_type\"] =\n \"TYPE_\" + ToUpper(DeclaredTypeMethodName(key->type()));\n (*variables)[\"val_wire_type\"] =\n \"TYPE_\" + ToUpper(DeclaredTypeMethodName(val->type()));\n (*variables)[\"map_classname\"] = ClassName(descriptor->message_type(), false);\n (*variables)[\"number\"] = StrCat(descriptor->number());\n (*variables)[\"tag\"] = StrCat(internal::WireFormat::MakeTag(descriptor));\n\n if (HasDescriptorMethods(descriptor->file(), options)) {\n (*variables)[\"lite\"] = \"\";\n } else {\n (*variables)[\"lite\"] = \"Lite\";\n }\n}\n\nMapFieldGenerator::MapFieldGenerator(const FieldDescriptor* descriptor,\n const Options& options)\n : FieldGenerator(descriptor, options) {\n SetMessageVariables(descriptor, &variables_, options);\n}\n\nMapFieldGenerator::~MapFieldGenerator() {}\n\nvoid MapFieldGenerator::GeneratePrivateMembers(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"::$proto_ns$::internal::MapField$lite$<\\n\"\n \" $map_classname$,\\n\"\n \" $key_cpp$, $val_cpp$,\\n\"\n \" ::$proto_ns$::internal::WireFormatLite::$key_wire_type$,\\n\"\n \" ::$proto_ns$::internal::WireFormatLite::$val_wire_type$> \"\n \"$name$_;\\n\");\n}\n\nvoid MapFieldGenerator::GenerateAccessorDeclarations(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"private:\\n\"\n \"const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \" ${1$_internal_$name$$}$() const;\\n\"\n \"::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \" ${1$_internal_mutable_$name$$}$();\\n\"\n \"public:\\n\"\n \"$deprecated_attr$const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \" ${1$$name$$}$() const;\\n\"\n \"$deprecated_attr$::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \" ${1$mutable_$name$$}$();\\n\",\n descriptor_);\n}\n\nvoid MapFieldGenerator::GenerateInlineAccessorDefinitions(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"inline const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \"$classname$::_internal_$name$() const {\\n\"\n \" return $name$_.GetMap();\\n\"\n \"}\\n\"\n \"inline const ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >&\\n\"\n \"$classname$::$name$() const {\\n\"\n \"$annotate_accessor$\"\n \" \/\/ @@protoc_insertion_point(field_map:$full_name$)\\n\"\n \" return _internal_$name$();\\n\"\n \"}\\n\"\n \"inline ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \"$classname$::_internal_mutable_$name$() {\\n\"\n \" return $name$_.MutableMap();\\n\"\n \"}\\n\"\n \"inline ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >*\\n\"\n \"$classname$::mutable_$name$() {\\n\"\n \"$annotate_accessor$\"\n \" \/\/ @@protoc_insertion_point(field_mutable_map:$full_name$)\\n\"\n \" return _internal_mutable_$name$();\\n\"\n \"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateClearingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.Clear();\\n\");\n}\n\nvoid MapFieldGenerator::GenerateMergingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.MergeFrom(from.$name$_);\\n\");\n}\n\nvoid MapFieldGenerator::GenerateSwappingCode(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"$name$_.InternalSwap(&other->$name$_);\\n\");\n}\n\nvoid MapFieldGenerator::GenerateCopyConstructorCode(\n io::Printer* printer) const {\n GenerateConstructorCode(printer);\n GenerateMergingCode(printer);\n}\n\nstatic void GenerateSerializationLoop(const Formatter& format, bool string_key,\n bool string_value,\n bool is_deterministic) {\n std::string ptr;\n if (is_deterministic) {\n format(\"for (size_type i = 0; i < n; i++) {\\n\");\n ptr = string_key ? \"items[static_cast<ptrdiff_t>(i)]\"\n : \"items[static_cast<ptrdiff_t>(i)].second\";\n } else {\n format(\n \"for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it) {\\n\");\n ptr = \"it\";\n }\n format.Indent();\n\n format(\n \"target = $map_classname$::Funcs::InternalSerialize($number$, \"\n \"$1$->first, $1$->second, target, stream);\\n\",\n ptr);\n\n if (string_key || string_value) {\n \/\/ ptr is either an actual pointer or an iterator, either way we can\n \/\/ create a pointer by taking the address after de-referencing it.\n format(\"Utf8Check::Check(&(*$1$));\\n\", ptr);\n }\n\n format.Outdent();\n format(\"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateSerializeWithCachedSizesToArray(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\"if (!this->_internal_$name$().empty()) {\\n\");\n format.Indent();\n const FieldDescriptor* key_field =\n descriptor_->message_type()->FindFieldByName(\"key\");\n const FieldDescriptor* value_field =\n descriptor_->message_type()->FindFieldByName(\"value\");\n const bool string_key = key_field->type() == FieldDescriptor::TYPE_STRING;\n const bool string_value = value_field->type() == FieldDescriptor::TYPE_STRING;\n\n format(\n \"typedef ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_pointer\\n\"\n \" ConstPtr;\\n\");\n if (string_key) {\n format(\n \"typedef ConstPtr SortItem;\\n\"\n \"typedef ::$proto_ns$::internal::\"\n \"CompareByDerefFirst<SortItem> Less;\\n\");\n } else {\n format(\n \"typedef ::$proto_ns$::internal::SortItem< $key_cpp$, ConstPtr > \"\n \"SortItem;\\n\"\n \"typedef ::$proto_ns$::internal::CompareByFirstField<SortItem> \"\n \"Less;\\n\");\n }\n bool utf8_check = string_key || string_value;\n if (utf8_check) {\n format(\n \"struct Utf8Check {\\n\"\n \" static void Check(ConstPtr p) {\\n\"\n \/\/ p may be unused when GetUtf8CheckMode evaluates to kNone,\n \/\/ thus disabling the validation.\n \" (void)p;\\n\");\n format.Indent();\n format.Indent();\n if (string_key) {\n GenerateUtf8CheckCodeForString(\n key_field, options_, false,\n \"p->first.data(), static_cast<int>(p->first.length()),\\n\", format);\n }\n if (string_value) {\n GenerateUtf8CheckCodeForString(\n value_field, options_, false,\n \"p->second.data(), static_cast<int>(p->second.length()),\\n\", format);\n }\n format.Outdent();\n format.Outdent();\n format(\n \" }\\n\"\n \"};\\n\");\n }\n\n format(\n \"\\n\"\n \"if (stream->IsSerializationDeterministic() &&\\n\"\n \" this->_internal_$name$().size() > 1) {\\n\"\n \" ::std::unique_ptr<SortItem[]> items(\\n\"\n \" new SortItem[this->_internal_$name$().size()]);\\n\"\n \" typedef ::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::size_type \"\n \"size_type;\\n\"\n \" size_type n = 0;\\n\"\n \" for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it, ++n) {\\n\"\n \" items[static_cast<ptrdiff_t>(n)] = SortItem(&*it);\\n\"\n \" }\\n\"\n \" ::std::sort(&items[0], &items[static_cast<ptrdiff_t>(n)], Less());\\n\");\n format.Indent();\n GenerateSerializationLoop(format, string_key, string_value, true);\n format.Outdent();\n format(\"} else {\\n\");\n format.Indent();\n GenerateSerializationLoop(format, string_key, string_value, false);\n format.Outdent();\n format(\"}\\n\");\n format.Outdent();\n format(\"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateByteSize(io::Printer* printer) const {\n Formatter format(printer, variables_);\n format(\n \"total_size += $tag_size$ *\\n\"\n \" \"\n \"::$proto_ns$::internal::FromIntSize(this->_internal_$name$_size());\\n\"\n \"for (::$proto_ns$::Map< $key_cpp$, $val_cpp$ >::const_iterator\\n\"\n \" it = this->_internal_$name$().begin();\\n\"\n \" it != this->_internal_$name$().end(); ++it) {\\n\"\n \" total_size += $map_classname$::Funcs::ByteSizeLong(it->first, \"\n \"it->second);\\n\"\n \"}\\n\");\n}\n\nvoid MapFieldGenerator::GenerateConstinitInitializer(\n io::Printer* printer) const {\n Formatter format(printer, variables_);\n if (HasDescriptorMethods(descriptor_->file(), options_)) {\n format(\"$name$_(::$proto_ns$::internal::ConstantInitialized{})\");\n } else {\n format(\"$name$_()\");\n }\n}\n\n} \/\/ namespace cpp\n} \/\/ namespace compiler\n} \/\/ namespace protobuf\n} \/\/ namespace google\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stx\/protobuf\/msg.h>\n#include <stx\/json\/json.h>\n#include <zbase\/WebUIServlet.h>\n#include <zbase\/WebUIModuleConfig.pb.h>\n#include <zbase\/HTTPAuth.h>\n#include <zbase\/buildconfig.h>\n\nnamespace zbase {\n\nWebUIServlet::WebUIServlet(\n AnalyticsAuth* auth) :\n auth_(auth) {}\n\nvoid WebUIServlet::handleHTTPRequest(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n URI uri(request->uri());\n try {\n handle(request, response);\n } catch (const StandardException& e) {\n logError(\"zbase\", e, \"error while handling HTTP request\");\n response->setStatus(http::kStatusInternalServerError);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(Assets::getAsset(\"zbase\/webui\/500.html\"));\n }\n}\n\nvoid WebUIServlet::handle(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n URI uri(request->uri());\n\n auto session = HTTPAuth::authenticateRequest(*request, auth_);\n\n static const String kAssetsPathPrefix = \"\/a\/_\/a\/\";\n if (StringUtil::beginsWith(uri.path(), kAssetsPathPrefix)) {\n auto asset_path = uri.path().substr(kAssetsPathPrefix.size());\n\n \/\/ FIXME validate path\n\n \/\/\"css\" => \"text\/css; charset=utf-8\",\n \/\/\"png\" => \"image\/png\",\n \/\/\"html\" => \"text\/html; charset=utf-8\",\n \/\/\"js\" => \"application\/javascript; charset=utf-8\"\n response->setStatus(http::kStatusOK);\n \/\/response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(loadFile(\"assets\/\" + asset_path)); \/\/ FIXME\n return;\n }\n\n static const String kConfigPath = \"\/a\/_\/c\";\n if (uri.path() == kConfigPath) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n\n renderConfig(request, session, &json);\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"application\/json; charset=utf-8\");\n response->addBody(buf);\n return;\n }\n\n static const String kModulesPathPrefix = \"\/a\/_\/m\/\";\n if (StringUtil::beginsWith(uri.path(), kModulesPathPrefix)) {\n auto module_name = uri.path().substr(kModulesPathPrefix.size());\n\n \/\/ FIXME cache module config\n auto module_cfg = msg::parseText<WebUIModuleConfig>(\n loadFile(StringUtil::format(\"$0\/MANIFEST\", module_name)));\n\n if (session.isEmpty() && !module_cfg.is_public()) {\n response->setStatus(http::kStatusForbidden);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(Assets::getAsset(\"zbase\/webui\/403.html\"));\n return;\n }\n\n String module_html;\n\n for (const auto& file : module_cfg.html_file()) {\n module_html +=\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file));\n }\n\n for (const auto& file : module_cfg.css_file()) {\n module_html += StringUtil::format(\n \"<style type='text\/css'>$0<\/style>\",\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file)));\n }\n\n for (const auto& file : module_cfg.js_file()) {\n module_html += StringUtil::format(\n \"<script type='text\/javascript'>$0<\/script>\",\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file)));\n }\n\n module_html += StringUtil::format(\n \"<script type='text\/javascript'>ZBase.moduleReady('$0');<\/script>\",\n module_name);\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(module_html);\n return;\n }\n\n Buffer app_config;\n json::JSONOutputStream app_config_json(\n BufferOutputStream::fromBuffer(&app_config));\n renderConfig(request, session, &app_config_json);\n\n auto app_html = loadFile(\"app.html\");\n StringUtil::replaceAll(&app_html, \"{{app_css}}\", loadFile(\"app.css\"));\n StringUtil::replaceAll(&app_html, \"{{app_js}}\", loadFile(\"app.js\"));\n StringUtil::replaceAll(&app_html, \"{{config_json}}\", app_config.toString());\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(app_html);\n}\n\nString WebUIServlet::loadFile(const String& filename) {\n return Assets::getAsset(\"zbase\/webui\/\" + filename);\n}\n\nvoid WebUIServlet::renderConfig(\n http::HTTPRequest* request,\n const Option<AnalyticsSession>& session,\n json::JSONOutputStream* json) {\n auto app_cfg = msg::parseText<WebUIAppConfig>(loadFile(\"MANIFEST\"));\n\n json->beginObject();\n\n \/\/ routes\n json->addObjectEntry(\"routes\");\n json->beginArray();\n\n size_t nroute = 0;\n for (const auto& route : app_cfg.route()) {\n if (!route.is_public() && session.isEmpty()) {\n continue;\n }\n\n Vector<String> modules(\n route.require_module().begin(),\n route.require_module().end());\n\n if (++nroute > 1) {\n json->addComma();\n }\n\n json->beginObject();\n\n json->addObjectEntry(\"view\");\n json->addString(route.view());\n\n if (route.has_path_prefix()) {\n json->addComma();\n json->addObjectEntry(\"path_prefix\");\n json->addString(route.path_prefix());\n }\n\n if (route.has_path_match()) {\n json->addComma();\n json->addObjectEntry(\"path_match\");\n json->addString(route.path_match());\n }\n\n json->addComma();\n json->addObjectEntry(\"modules\");\n json::toJSON(modules, json);\n\n json->endObject();\n }\n\n json->endArray();\n\n \/\/ current user\n if (!session.isEmpty()) {\n json->addComma();\n json->addObjectEntry(\"current_user\");\n json->beginObject();\n\n json->addObjectEntry(\"userid\");\n json->addString(session.get().userid());\n json->addComma();\n\n json->addObjectEntry(\"namespace\");\n json->addString(session.get().customer());\n\n json->endObject();\n }\n\n \/\/ default route\n json->addComma();\n json->addObjectEntry(\"default_route\");\n json->addString(session.isEmpty() ? \"\/a\/login\" : \"\/a\/\");\n json->addComma();\n\n json->addObjectEntry(\"zbase_domain\");\n json->addString(getDomain(*request));\n json->addComma();\n\n json->addObjectEntry(\"zbase_build_id\");\n json->addString(ZBASE_BUILD_ID);\n\n json->endObject();\n}\n\n}\n<commit_msg>hacky documentation backend<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stx\/protobuf\/msg.h>\n#include <stx\/json\/json.h>\n#include <zbase\/WebUIServlet.h>\n#include <zbase\/WebUIModuleConfig.pb.h>\n#include <zbase\/HTTPAuth.h>\n#include <zbase\/buildconfig.h>\n\nnamespace zbase {\n\nWebUIServlet::WebUIServlet(\n AnalyticsAuth* auth) :\n auth_(auth) {}\n\nvoid WebUIServlet::handleHTTPRequest(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n URI uri(request->uri());\n try {\n handle(request, response);\n } catch (const StandardException& e) {\n logError(\"zbase\", e, \"error while handling HTTP request\");\n response->setStatus(http::kStatusInternalServerError);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(Assets::getAsset(\"zbase\/webui\/500.html\"));\n }\n}\n\nvoid WebUIServlet::handle(\n http::HTTPRequest* request,\n http::HTTPResponse* response) {\n URI uri(request->uri());\n\n auto session = HTTPAuth::authenticateRequest(*request, auth_);\n\n static const String kAssetsPathPrefix = \"\/a\/_\/a\/\";\n if (StringUtil::beginsWith(uri.path(), kAssetsPathPrefix)) {\n auto asset_path = uri.path().substr(kAssetsPathPrefix.size());\n\n \/\/ FIXME validate path\n\n \/\/\"css\" => \"text\/css; charset=utf-8\",\n \/\/\"png\" => \"image\/png\",\n \/\/\"html\" => \"text\/html; charset=utf-8\",\n \/\/\"js\" => \"application\/javascript; charset=utf-8\"\n response->setStatus(http::kStatusOK);\n \/\/response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(loadFile(\"assets\/\" + asset_path)); \/\/ FIXME\n return;\n }\n\n static const String kConfigPath = \"\/a\/_\/c\";\n if (uri.path() == kConfigPath) {\n Buffer buf;\n json::JSONOutputStream json(BufferOutputStream::fromBuffer(&buf));\n\n renderConfig(request, session, &json);\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"application\/json; charset=utf-8\");\n response->addBody(buf);\n return;\n }\n\n static const String kDocumentationPathPrefix = \"\/a\/_\/d\/\";\n if (StringUtil::beginsWith(uri.path(), kDocumentationPathPrefix)) {\n auto asset_path = uri.path().substr(kDocumentationPathPrefix.size());\n\n \/\/ FIXME validate path\n response->setStatus(http::kStatusOK);\n \/\/response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(Assets::getAsset(\"zbase\/docs\/\" + asset_path)); \/\/ FIXME\n return;\n }\n\n static const String kModulesPathPrefix = \"\/a\/_\/m\/\";\n if (StringUtil::beginsWith(uri.path(), kModulesPathPrefix)) {\n auto module_name = uri.path().substr(kModulesPathPrefix.size());\n\n \/\/ FIXME cache module config\n auto module_cfg = msg::parseText<WebUIModuleConfig>(\n loadFile(StringUtil::format(\"$0\/MANIFEST\", module_name)));\n\n if (session.isEmpty() && !module_cfg.is_public()) {\n response->setStatus(http::kStatusForbidden);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(Assets::getAsset(\"zbase\/webui\/403.html\"));\n return;\n }\n\n String module_html;\n\n for (const auto& file : module_cfg.html_file()) {\n module_html +=\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file));\n }\n\n for (const auto& file : module_cfg.css_file()) {\n module_html += StringUtil::format(\n \"<style type='text\/css'>$0<\/style>\",\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file)));\n }\n\n for (const auto& file : module_cfg.js_file()) {\n module_html += StringUtil::format(\n \"<script type='text\/javascript'>$0<\/script>\",\n loadFile(StringUtil::format(\"$0\/$1\", module_name, file)));\n }\n\n module_html += StringUtil::format(\n \"<script type='text\/javascript'>ZBase.moduleReady('$0');<\/script>\",\n module_name);\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(module_html);\n return;\n }\n\n Buffer app_config;\n json::JSONOutputStream app_config_json(\n BufferOutputStream::fromBuffer(&app_config));\n renderConfig(request, session, &app_config_json);\n\n auto app_html = loadFile(\"app.html\");\n StringUtil::replaceAll(&app_html, \"{{app_css}}\", loadFile(\"app.css\"));\n StringUtil::replaceAll(&app_html, \"{{app_js}}\", loadFile(\"app.js\"));\n StringUtil::replaceAll(&app_html, \"{{config_json}}\", app_config.toString());\n\n response->setStatus(http::kStatusOK);\n response->addHeader(\"Content-Type\", \"text\/html; charset=utf-8\");\n response->addBody(app_html);\n}\n\nString WebUIServlet::loadFile(const String& filename) {\n return Assets::getAsset(\"zbase\/webui\/\" + filename);\n}\n\nvoid WebUIServlet::renderConfig(\n http::HTTPRequest* request,\n const Option<AnalyticsSession>& session,\n json::JSONOutputStream* json) {\n auto app_cfg = msg::parseText<WebUIAppConfig>(loadFile(\"MANIFEST\"));\n\n json->beginObject();\n\n \/\/ routes\n json->addObjectEntry(\"routes\");\n json->beginArray();\n\n size_t nroute = 0;\n for (const auto& route : app_cfg.route()) {\n if (!route.is_public() && session.isEmpty()) {\n continue;\n }\n\n Vector<String> modules(\n route.require_module().begin(),\n route.require_module().end());\n\n if (++nroute > 1) {\n json->addComma();\n }\n\n json->beginObject();\n\n json->addObjectEntry(\"view\");\n json->addString(route.view());\n\n if (route.has_path_prefix()) {\n json->addComma();\n json->addObjectEntry(\"path_prefix\");\n json->addString(route.path_prefix());\n }\n\n if (route.has_path_match()) {\n json->addComma();\n json->addObjectEntry(\"path_match\");\n json->addString(route.path_match());\n }\n\n json->addComma();\n json->addObjectEntry(\"modules\");\n json::toJSON(modules, json);\n\n json->endObject();\n }\n\n json->endArray();\n\n \/\/ current user\n if (!session.isEmpty()) {\n json->addComma();\n json->addObjectEntry(\"current_user\");\n json->beginObject();\n\n json->addObjectEntry(\"userid\");\n json->addString(session.get().userid());\n json->addComma();\n\n json->addObjectEntry(\"namespace\");\n json->addString(session.get().customer());\n\n json->endObject();\n }\n\n \/\/ default route\n json->addComma();\n json->addObjectEntry(\"default_route\");\n json->addString(session.isEmpty() ? \"\/a\/login\" : \"\/a\/\");\n json->addComma();\n\n json->addObjectEntry(\"zbase_domain\");\n json->addString(getDomain(*request));\n json->addComma();\n\n json->addObjectEntry(\"zbase_build_id\");\n json->addString(ZBASE_BUILD_ID);\n\n json->endObject();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2016 The Qt Company Ltd.\n** Copyright (C) 2015 Jake Petroules.\n** Contact: https:\/\/www.qt.io\/licensing\/\n**\n** This file is part of Qbs.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company. For licensing terms\n** and conditions see https:\/\/www.qt.io\/terms-conditions. For further\n** information use the contact form at https:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 3 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL3 included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 3 requirements\n** will be met: https:\/\/www.gnu.org\/licenses\/lgpl-3.0.html.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 2.0 or (at your option) the GNU General\n** Public license version 3 or any later version approved by the KDE Free\n** Qt Foundation. The licenses are as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3\n** included in the packaging of this file. Please review the following\n** information to ensure the GNU General Public License requirements will\n** be met: https:\/\/www.gnu.org\/licenses\/gpl-2.0.html and\n** https:\/\/www.gnu.org\/licenses\/gpl-3.0.html.\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"visualstudioversioninfo.h\"\n#include <tools\/qbsassert.h>\n#include <QtCore\/qdebug.h>\n#include <QtCore\/qglobal.h>\n\nnamespace qbs {\nnamespace Internal {\n\nVisualStudioVersionInfo::VisualStudioVersionInfo()\n{\n}\n\nVisualStudioVersionInfo::VisualStudioVersionInfo(const Version &version)\n : m_version(version)\n{\n QBS_CHECK(version.minorVersion() == 0 || version == Version(7, 1));\n}\n\nSet<VisualStudioVersionInfo> VisualStudioVersionInfo::knownVersions()\n{\n Set<VisualStudioVersionInfo> known;\n known << Version(14) << Version(12) << Version(11)\n << Version(10) << Version(9) << Version(8)\n << Version(7, 1) << Version(7) << Version(6);\n return known;\n}\n\nbool VisualStudioVersionInfo::operator<(const VisualStudioVersionInfo &other) const\n{\n return m_version < other.m_version;\n}\n\nbool VisualStudioVersionInfo::operator==(const VisualStudioVersionInfo &other) const\n{\n return m_version == other.m_version;\n}\n\nbool VisualStudioVersionInfo::usesMsBuild() const\n{\n return m_version.majorVersion() >= 10;\n}\n\nbool VisualStudioVersionInfo::usesVcBuild() const\n{\n return m_version.majorVersion() <= 9;\n}\n\nbool VisualStudioVersionInfo::usesSolutions() const\n{\n return m_version.majorVersion() >= 7;\n}\n\nVersion VisualStudioVersionInfo::version() const\n{\n return m_version;\n}\n\nint VisualStudioVersionInfo::marketingVersion() const\n{\n switch (m_version.majorVersion()) {\n case 6:\n return 6;\n case 7:\n switch (m_version.minorVersion()) {\n case 0:\n return 2002;\n case 1:\n return 2003;\n default:\n Q_UNREACHABLE();\n }\n break;\n case 8:\n return 2005;\n case 9:\n return 2008;\n case 10:\n return 2010;\n case 11:\n return 2012;\n case 12:\n return 2013;\n case 14:\n return 2015;\n case 15:\n return 2017;\n default:\n qWarning() << QStringLiteral(\"unrecognized Visual Studio version: \")\n << m_version.toString();\n return 0;\n }\n}\n\nQString VisualStudioVersionInfo::solutionVersion() const\n{\n \/\/ Visual Studio 2012 finally stabilized the solution version\n if (m_version >= Version(11))\n return QStringLiteral(\"12.00\");\n\n if (m_version >= Version(8))\n return QStringLiteral(\"%1.00\").arg(m_version.majorVersion() + 1);\n\n if (m_version >= Version(7, 1))\n return QStringLiteral(\"8.00\");\n\n if (m_version >= Version(7))\n return QStringLiteral(\"7.00\");\n\n \/\/ these versions do not use solution files\n \/\/ Visual Studio 6 uses .dsw files which are format version 6.00 but these are different\n Q_ASSERT(!usesSolutions());\n Q_UNREACHABLE();\n}\n\nQString VisualStudioVersionInfo::toolsVersion() const\n{\n \/\/ \"https:\/\/msdn.microsoft.com\/en-us\/library\/bb383796.aspx\"\n \/\/ Starting in Visual Studio 2013, the MSBuild Toolset version is the same as the Visual Studio\n \/\/ version number\"... again\n if (m_version >= Version(12))\n return QStringLiteral(\"%1.0\").arg(m_version.majorVersion());\n\n if (m_version >= Version(10))\n return QStringLiteral(\"4.0\");\n\n \/\/ pre-MSBuild\n return QStringLiteral(\"%1,00\").arg(m_version.majorVersion());\n}\n\nQString VisualStudioVersionInfo::platformToolsetVersion() const\n{\n return QStringLiteral(\"v%1\").arg(m_version.majorVersion() * 10);\n}\n\nquint32 qHash(const VisualStudioVersionInfo &info)\n{\n return qHash(info.version().toString());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n<commit_msg>Recognize Visual Studio 2017<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2016 The Qt Company Ltd.\n** Copyright (C) 2015 Jake Petroules.\n** Contact: https:\/\/www.qt.io\/licensing\/\n**\n** This file is part of Qbs.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and The Qt Company. For licensing terms\n** and conditions see https:\/\/www.qt.io\/terms-conditions. For further\n** information use the contact form at https:\/\/www.qt.io\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 3 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL3 included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 3 requirements\n** will be met: https:\/\/www.gnu.org\/licenses\/lgpl-3.0.html.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 2.0 or (at your option) the GNU General\n** Public license version 3 or any later version approved by the KDE Free\n** Qt Foundation. The licenses are as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3\n** included in the packaging of this file. Please review the following\n** information to ensure the GNU General Public License requirements will\n** be met: https:\/\/www.gnu.org\/licenses\/gpl-2.0.html and\n** https:\/\/www.gnu.org\/licenses\/gpl-3.0.html.\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"visualstudioversioninfo.h\"\n#include <tools\/qbsassert.h>\n#include <QtCore\/qdebug.h>\n#include <QtCore\/qglobal.h>\n\nnamespace qbs {\nnamespace Internal {\n\nVisualStudioVersionInfo::VisualStudioVersionInfo()\n{\n}\n\nVisualStudioVersionInfo::VisualStudioVersionInfo(const Version &version)\n : m_version(version)\n{\n QBS_CHECK(version.minorVersion() == 0 || version == Version(7, 1));\n}\n\nSet<VisualStudioVersionInfo> VisualStudioVersionInfo::knownVersions()\n{\n Set<VisualStudioVersionInfo> known;\n known << Version(15) << Version(14) << Version(12) << Version(11)\n << Version(10) << Version(9) << Version(8)\n << Version(7, 1) << Version(7) << Version(6);\n return known;\n}\n\nbool VisualStudioVersionInfo::operator<(const VisualStudioVersionInfo &other) const\n{\n return m_version < other.m_version;\n}\n\nbool VisualStudioVersionInfo::operator==(const VisualStudioVersionInfo &other) const\n{\n return m_version == other.m_version;\n}\n\nbool VisualStudioVersionInfo::usesMsBuild() const\n{\n return m_version.majorVersion() >= 10;\n}\n\nbool VisualStudioVersionInfo::usesVcBuild() const\n{\n return m_version.majorVersion() <= 9;\n}\n\nbool VisualStudioVersionInfo::usesSolutions() const\n{\n return m_version.majorVersion() >= 7;\n}\n\nVersion VisualStudioVersionInfo::version() const\n{\n return m_version;\n}\n\nint VisualStudioVersionInfo::marketingVersion() const\n{\n switch (m_version.majorVersion()) {\n case 6:\n return 6;\n case 7:\n switch (m_version.minorVersion()) {\n case 0:\n return 2002;\n case 1:\n return 2003;\n default:\n Q_UNREACHABLE();\n }\n break;\n case 8:\n return 2005;\n case 9:\n return 2008;\n case 10:\n return 2010;\n case 11:\n return 2012;\n case 12:\n return 2013;\n case 14:\n return 2015;\n case 15:\n return 2017;\n default:\n qWarning() << QStringLiteral(\"unrecognized Visual Studio version: \")\n << m_version.toString();\n return 0;\n }\n}\n\nQString VisualStudioVersionInfo::solutionVersion() const\n{\n \/\/ Visual Studio 2012 finally stabilized the solution version\n if (m_version >= Version(11))\n return QStringLiteral(\"12.00\");\n\n if (m_version >= Version(8))\n return QStringLiteral(\"%1.00\").arg(m_version.majorVersion() + 1);\n\n if (m_version >= Version(7, 1))\n return QStringLiteral(\"8.00\");\n\n if (m_version >= Version(7))\n return QStringLiteral(\"7.00\");\n\n \/\/ these versions do not use solution files\n \/\/ Visual Studio 6 uses .dsw files which are format version 6.00 but these are different\n Q_ASSERT(!usesSolutions());\n Q_UNREACHABLE();\n}\n\nQString VisualStudioVersionInfo::toolsVersion() const\n{\n \/\/ \"https:\/\/msdn.microsoft.com\/en-us\/library\/bb383796.aspx\"\n \/\/ Starting in Visual Studio 2013, the MSBuild Toolset version is the same as the Visual Studio\n \/\/ version number\"... again\n if (m_version >= Version(12))\n return QStringLiteral(\"%1.0\").arg(m_version.majorVersion());\n\n if (m_version >= Version(10))\n return QStringLiteral(\"4.0\");\n\n \/\/ pre-MSBuild\n return QStringLiteral(\"%1,00\").arg(m_version.majorVersion());\n}\n\nQString VisualStudioVersionInfo::platformToolsetVersion() const\n{\n return QStringLiteral(\"v%1\").arg(m_version.majorVersion() * 10);\n}\n\nquint32 qHash(const VisualStudioVersionInfo &info)\n{\n return qHash(info.version().toString());\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace qbs\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2017 Thomas Krause <thomaskrause@posteo.de>\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"exactannovaluesearch.h\"\n\n#include <google\/btree.h> \/\/ for btree_iterator\n#include <google\/btree_map.h> \/\/ for btree_map\n#include <boost\/container\/flat_map.hpp> \/\/ for flat_multimap\n#include <boost\/container\/vector.hpp> \/\/ for vec_iterator, operator!=\n#include <cstdint> \/\/ for uint32_t, int64_t\n#include \"annis\/db.h\" \/\/ for DB\n#include \"annis\/stringstorage.h\" \/\/ for StringStorage\n#include \"annis\/annostorage.h\" \/\/ for AnnoStorage\n#include \"annis\/types.h\" \/\/ for Annotation, AnnotationKey\n\n\nusing namespace annis;\nusing namespace std;\n\nExactAnnoValueSearch::ExactAnnoValueSearch(const DB &db, const string &annoNamspace, const string &annoName, const string &annoValue)\n :db(db),validAnnotationInitialized(false), debugDescription(annoNamspace + \":\" + annoName + \"=\\\"\" + annoValue + \"\\\"\")\n{\n std::pair<bool, uint32_t> nameID = db.strings.findID(annoName);\n std::pair<bool, uint32_t> namspaceID = db.strings.findID(annoNamspace);\n std::pair<bool, uint32_t> valueID = db.strings.findID(annoValue);\n\n if(nameID.first && namspaceID.first && valueID.first)\n {\n Annotation key;\n key.name = nameID.second;\n key.ns = namspaceID.second;\n key.val = valueID.second;\n\n searchRanges.push_back(Range(db.nodeAnnos.inverseAnnotations.equal_range(key)));\n it = searchRanges.begin()->first;\n }\n currentRange = searchRanges.begin();\n}\n\nExactAnnoValueSearch::ExactAnnoValueSearch(const DB &db, const std::string &annoName, const std::string &annoValue)\n :db(db), validAnnotationInitialized(false), debugDescription(annoName + \"=\\\"\" + annoValue + \"\\\"\")\n{\n std::pair<bool, uint32_t> nameID = db.strings.findID(annoName);\n std::pair<bool, uint32_t> valueID = db.strings.findID(annoValue);\n\n if(nameID.first && valueID.first)\n {\n auto keysLower = db.nodeAnnos.annoKeys.lower_bound({nameID.second, 0});\n auto keysUpper = db.nodeAnnos.annoKeys.upper_bound({nameID.second, uintmax});\n for(auto itKey = keysLower; itKey != keysUpper; itKey++)\n {\n searchRanges.push_back(Range(db.nodeAnnos.inverseAnnotations.equal_range(\n {itKey->first.name, itKey->first.ns, valueID.second})));\n }\n }\n currentRange = searchRanges.begin();\n\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n}\n\nbool ExactAnnoValueSearch::next(Match& result)\n{\n while(currentRange != searchRanges.end() && it != currentRange->second)\n {\n result.node = it->second; \/\/ node ID\n result.anno = it->first; \/\/ annotation itself\n\n it++;\n if(it == currentRange->second)\n {\n currentRange++;\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n }\n\n if(getConstAnnoValue())\n {\n \/*\n * When we replace the resulting annotation with a constant value it is possible that duplicates\n * can occur. Therfore we must check that each node is only included once as a result\n *\/\n if(uniqueResultFilter.find(result.node) == uniqueResultFilter.end())\n {\n uniqueResultFilter.insert(result.node);\n\n result.anno = *getConstAnnoValue();\n\n return true;\n }\n }\n else\n {\n return true;\n }\n }\n\n return false;\n\n}\n\nvoid ExactAnnoValueSearch::reset()\n{\n uniqueResultFilter.clear();\n\n currentRange = searchRanges.begin();\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n}\n\nvoid ExactAnnoValueSearch::initializeValidAnnotations()\n{\n for(auto range : searchRanges)\n {\n for(ItType annoIt = range.first; annoIt != range.second; annoIt++)\n {\n validAnnotations.insert(annoIt->first);\n }\n }\n\n validAnnotationInitialized = true;\n}\n\nstd::int64_t ExactAnnoValueSearch::guessMaxCount() const\n{\n std::int64_t sum = 0;\n\n for(auto range : searchRanges)\n {\n if(range.first != range.second)\n {\n const Annotation& anno = range.first->first;\n\n if(anno.ns == db.getNamespaceStringID() && anno.name == db.getNodeNameStringID())\n {\n \/\/ we know that node names are typically unique\n sum += 1;\n }\n else\n {\n const std::string val = db.strings.str(anno.val);\n sum += db.nodeAnnos.guessMaxCount(anno.ns, anno.name, val, val);\n }\n }\n }\n \n return sum;\n}\n\nExactAnnoValueSearch::~ExactAnnoValueSearch()\n{\n\n}\n\n\n<commit_msg>Do not put invalid search ranges into the search range list.<commit_after>\/*\n Copyright 2017 Thomas Krause <thomaskrause@posteo.de>\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"exactannovaluesearch.h\"\n\n#include <google\/btree.h> \/\/ for btree_iterator\n#include <google\/btree_map.h> \/\/ for btree_map\n#include <boost\/container\/flat_map.hpp> \/\/ for flat_multimap\n#include <boost\/container\/vector.hpp> \/\/ for vec_iterator, operator!=\n#include <cstdint> \/\/ for uint32_t, int64_t\n#include \"annis\/db.h\" \/\/ for DB\n#include \"annis\/stringstorage.h\" \/\/ for StringStorage\n#include \"annis\/annostorage.h\" \/\/ for AnnoStorage\n#include \"annis\/types.h\" \/\/ for Annotation, AnnotationKey\n\n\nusing namespace annis;\nusing namespace std;\n\nExactAnnoValueSearch::ExactAnnoValueSearch(const DB &db, const string &annoNamspace, const string &annoName, const string &annoValue)\n :db(db),validAnnotationInitialized(false), debugDescription(annoNamspace + \":\" + annoName + \"=\\\"\" + annoValue + \"\\\"\")\n{\n std::pair<bool, uint32_t> nameID = db.strings.findID(annoName);\n std::pair<bool, uint32_t> namspaceID = db.strings.findID(annoNamspace);\n std::pair<bool, uint32_t> valueID = db.strings.findID(annoValue);\n\n if(nameID.first && namspaceID.first && valueID.first)\n {\n Annotation key;\n key.name = nameID.second;\n key.ns = namspaceID.second;\n key.val = valueID.second;\n\n searchRanges.push_back(Range(db.nodeAnnos.inverseAnnotations.equal_range(key)));\n it = searchRanges.begin()->first;\n }\n currentRange = searchRanges.begin();\n}\n\nExactAnnoValueSearch::ExactAnnoValueSearch(const DB &db, const std::string &annoName, const std::string &annoValue)\n :db(db), validAnnotationInitialized(false), debugDescription(annoName + \"=\\\"\" + annoValue + \"\\\"\")\n{\n std::pair<bool, uint32_t> nameID = db.strings.findID(annoName);\n std::pair<bool, uint32_t> valueID = db.strings.findID(annoValue);\n\n if(nameID.first && valueID.first)\n {\n auto keysLower = db.nodeAnnos.annoKeys.lower_bound({nameID.second, 0});\n auto keysUpper = db.nodeAnnos.annoKeys.upper_bound({nameID.second, uintmax});\n for(auto itKey = keysLower; itKey != keysUpper; itKey++)\n {\n Range r = db.nodeAnnos.inverseAnnotations.equal_range(\n {itKey->first.name, itKey->first.ns, valueID.second});\n\n \/\/ only remember ranges that actually have valid iterator pairs\n if(r.first != r.second)\n {\n searchRanges.push_back(std::move(r));\n }\n }\n }\n currentRange = searchRanges.begin();\n\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n}\n\nbool ExactAnnoValueSearch::next(Match& result)\n{\n while(currentRange != searchRanges.end() && it != currentRange->second)\n {\n result.node = it->second; \/\/ node ID\n result.anno = it->first; \/\/ annotation itself\n\n it++;\n if(it == currentRange->second)\n {\n currentRange++;\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n }\n\n if(getConstAnnoValue())\n {\n \/*\n * When we replace the resulting annotation with a constant value it is possible that duplicates\n * can occur. Therfore we must check that each node is only included once as a result\n *\/\n if(uniqueResultFilter.find(result.node) == uniqueResultFilter.end())\n {\n uniqueResultFilter.insert(result.node);\n\n result.anno = *getConstAnnoValue();\n\n return true;\n }\n }\n else\n {\n return true;\n }\n }\n\n return false;\n\n}\n\nvoid ExactAnnoValueSearch::reset()\n{\n uniqueResultFilter.clear();\n\n currentRange = searchRanges.begin();\n if(currentRange != searchRanges.end())\n {\n it = currentRange->first;\n }\n}\n\nvoid ExactAnnoValueSearch::initializeValidAnnotations()\n{\n for(auto range : searchRanges)\n {\n for(ItType annoIt = range.first; annoIt != range.second; annoIt++)\n {\n validAnnotations.insert(annoIt->first);\n }\n }\n\n validAnnotationInitialized = true;\n}\n\nstd::int64_t ExactAnnoValueSearch::guessMaxCount() const\n{\n std::int64_t sum = 0;\n\n for(auto range : searchRanges)\n {\n if(range.first != range.second)\n {\n const Annotation& anno = range.first->first;\n\n if(anno.ns == db.getNamespaceStringID() && anno.name == db.getNodeNameStringID())\n {\n \/\/ we know that node names are typically unique\n sum += 1;\n }\n else\n {\n const std::string val = db.strings.str(anno.val);\n sum += db.nodeAnnos.guessMaxCount(anno.ns, anno.name, val, val);\n }\n }\n }\n \n return sum;\n}\n\nExactAnnoValueSearch::~ExactAnnoValueSearch()\n{\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (c) 2017-2020 Hans-Kristian Arntzen\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#pragma once\n\n#include \"vulkan_headers.hpp\"\n#include \"texture_format.hpp\"\n\nnamespace Vulkan\n{\nstatic inline bool format_is_srgb(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_A8B8G8R8_SRGB_PACK32:\n\tcase VK_FORMAT_R8G8B8A8_SRGB:\n\tcase VK_FORMAT_B8G8R8A8_SRGB:\n\tcase VK_FORMAT_R8_SRGB:\n\tcase VK_FORMAT_R8G8_SRGB:\n\tcase VK_FORMAT_R8G8B8_SRGB:\n\tcase VK_FORMAT_B8G8R8_SRGB:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_depth_aspect(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_D16_UNORM:\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT:\n\tcase VK_FORMAT_X8_D24_UNORM_PACK32:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_stencil_aspect(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\tcase VK_FORMAT_S8_UINT:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_depth_or_stencil_aspect(VkFormat format)\n{\n\treturn format_has_depth_aspect(format) || format_has_stencil_aspect(format);\n}\n\nstatic inline VkImageAspectFlags format_to_aspect_mask(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_UNDEFINED:\n\t\treturn 0;\n\n\tcase VK_FORMAT_S8_UINT:\n\t\treturn VK_IMAGE_ASPECT_STENCIL_BIT;\n\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\t\treturn VK_IMAGE_ASPECT_STENCIL_BIT | VK_IMAGE_ASPECT_DEPTH_BIT;\n\n\tcase VK_FORMAT_D16_UNORM:\n\tcase VK_FORMAT_D32_SFLOAT:\n\tcase VK_FORMAT_X8_D24_UNORM_PACK32:\n\t\treturn VK_IMAGE_ASPECT_DEPTH_BIT;\n\n\tdefault:\n\t\treturn VK_IMAGE_ASPECT_COLOR_BIT;\n\t}\n}\n\nstatic inline void format_align_dim(VkFormat format, uint32_t &width, uint32_t &height)\n{\n\tuint32_t align_width, align_height;\n\tTextureFormatLayout::format_block_dim(format, align_width, align_height);\n\twidth = ((width + align_width - 1) \/ align_width) * align_width;\n\theight = ((height + align_height - 1) \/ align_height) * align_height;\n}\n\nstatic inline void format_num_blocks(VkFormat format, uint32_t &width, uint32_t &height)\n{\n\tuint32_t align_width, align_height;\n\tTextureFormatLayout::format_block_dim(format, align_width, align_height);\n\twidth = (width + align_width - 1) \/ align_width;\n\theight = (height + align_height - 1) \/ align_height;\n}\n\nstatic inline VkDeviceSize format_get_layer_size(VkFormat format, VkImageAspectFlags aspect, unsigned width, unsigned height, unsigned depth)\n{\n\tuint32_t blocks_x = width;\n\tuint32_t blocks_y = height;\n\tformat_num_blocks(format, blocks_x, blocks_y);\n\tformat_align_dim(format, width, height);\n\n\tVkDeviceSize size = TextureFormatLayout::format_block_size(format, aspect) * depth * blocks_x * blocks_y;\n\treturn size;\n}\n\nenum class YCbCrFormat\n{\n\tYUV420P_3PLANE,\n\tYUV444P_3PLANE,\n\tYUV422P_3PLANE,\n\tCount\n};\n\nstatic inline unsigned format_ycbcr_num_planes(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_420_UNORM:\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_422_UNORM:\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_444_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_420_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_422_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_444_UNORM:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_444_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_444_UNORM_3PACK16:\n\t\treturn 3;\n\n\tcase VK_FORMAT_G8_B8R8_2PLANE_420_UNORM:\n\tcase VK_FORMAT_G8_B8R8_2PLANE_422_UNORM:\n\tcase VK_FORMAT_G16_B16R16_2PLANE_420_UNORM:\n\tcase VK_FORMAT_G16_B16R16_2PLANE_422_UNORM:\n\tcase VK_FORMAT_G10X6_B10X6R10X6_2PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6R10X6_2PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4R12X4_2PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4R12X4_2PLANE_422_UNORM_3PACK16:\n\t\treturn 2;\n\n\tdefault:\n\t\treturn 1;\n\t}\n}\n\nstatic inline unsigned format_ycbcr_num_planes(YCbCrFormat format)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn 3;\n\n\tdefault:\n\t\treturn 0;\n\t}\n}\n\nstatic inline void format_ycbcr_downsample_dimensions(VkFormat format, VkImageAspectFlags aspect, uint32_t &width, uint32_t &height)\n{\n\tif (aspect == VK_IMAGE_ASPECT_PLANE_0_BIT)\n\t\treturn;\n\n\tswitch (format)\n\t{\n#define fmt(x, sub0, sub1) \\\n\tcase VK_FORMAT_##x: \\\n\t\twidth >>= sub0; \\\n\t\theight >>= sub1; \\\n\t\tbreak\n\n\t\tfmt(G8_B8_R8_3PLANE_420_UNORM, 1, 1);\n\t\tfmt(G8_B8R8_2PLANE_420_UNORM, 1, 1);\n\t\tfmt(G8_B8_R8_3PLANE_422_UNORM, 1, 0);\n\t\tfmt(G8_B8R8_2PLANE_422_UNORM, 1, 0);\n\t\tfmt(G8_B8_R8_3PLANE_444_UNORM, 0, 0);\n\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_422_UNORM_3PACK16, 1, 0);\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_444_UNORM_3PACK16, 0, 0);\n\t\tfmt(G10X6_B10X6R10X6_2PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G10X6_B10X6R10X6_2PLANE_422_UNORM_3PACK16, 1, 0);\n\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_422_UNORM_3PACK16, 1, 0);\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_444_UNORM_3PACK16, 0, 0);\n\t\tfmt(G12X4_B12X4R12X4_2PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G12X4_B12X4R12X4_2PLANE_422_UNORM_3PACK16, 1, 0);\n\n\t\tfmt(G16_B16_R16_3PLANE_420_UNORM, 1, 1);\n\t\tfmt(G16_B16_R16_3PLANE_422_UNORM, 1, 0);\n\t\tfmt(G16_B16_R16_3PLANE_444_UNORM, 0, 0);\n\t\tfmt(G16_B16R16_2PLANE_420_UNORM, 1, 1);\n\t\tfmt(G16_B16R16_2PLANE_422_UNORM, 1, 0);\n\n\tdefault:\n\t\tbreak;\n\t}\n#undef fmt\n}\n\nstatic inline unsigned format_ycbcr_downsample_ratio_log2(YCbCrFormat format, unsigned dim, unsigned plane)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn plane > 0 ? 1 : 0;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn plane > 0 && dim == 0 ? 1 : 0;\n\n\tdefault:\n\t\treturn 0;\n\t}\n}\n\nstatic inline VkFormat format_ycbcr_plane_vk_format(YCbCrFormat format, unsigned plane)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn VK_FORMAT_R8_UNORM;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn plane > 0 ? VK_FORMAT_R8G8_UNORM : VK_FORMAT_R8_UNORM;\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn VK_FORMAT_R8_UNORM;\n\n\tdefault:\n\t\treturn VK_FORMAT_UNDEFINED;\n\t}\n}\n\nstatic inline VkFormat format_ycbcr_planar_vk_format(YCbCrFormat format)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_420_UNORM;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_422_UNORM;\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_444_UNORM;\n\n\tdefault:\n\t\treturn VK_FORMAT_UNDEFINED;\n\t}\n}\n\n}\n<commit_msg>Add compressed sRGB formats to sRGB query helper.<commit_after>\/* Copyright (c) 2017-2020 Hans-Kristian Arntzen\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\n * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\n * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#pragma once\n\n#include \"vulkan_headers.hpp\"\n#include \"texture_format.hpp\"\n\nnamespace Vulkan\n{\nstatic inline bool format_is_srgb(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_A8B8G8R8_SRGB_PACK32:\n\tcase VK_FORMAT_R8G8B8A8_SRGB:\n\tcase VK_FORMAT_B8G8R8A8_SRGB:\n\tcase VK_FORMAT_R8_SRGB:\n\tcase VK_FORMAT_R8G8_SRGB:\n\tcase VK_FORMAT_R8G8B8_SRGB:\n\tcase VK_FORMAT_B8G8R8_SRGB:\n\tcase VK_FORMAT_BC1_RGB_SRGB_BLOCK:\n\tcase VK_FORMAT_BC1_RGBA_SRGB_BLOCK:\n\tcase VK_FORMAT_BC2_SRGB_BLOCK:\n\tcase VK_FORMAT_BC3_SRGB_BLOCK:\n\tcase VK_FORMAT_BC7_SRGB_BLOCK:\n\tcase VK_FORMAT_ETC2_R8G8B8_SRGB_BLOCK:\n\tcase VK_FORMAT_ETC2_R8G8B8A1_SRGB_BLOCK:\n\tcase VK_FORMAT_ETC2_R8G8B8A8_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_4x4_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_5x4_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_5x5_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_6x5_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_6x6_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_8x5_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_8x6_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_8x8_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_10x5_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_10x6_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_10x8_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_10x10_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_12x10_SRGB_BLOCK:\n\tcase VK_FORMAT_ASTC_12x12_SRGB_BLOCK:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_depth_aspect(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_D16_UNORM:\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT:\n\tcase VK_FORMAT_X8_D24_UNORM_PACK32:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_stencil_aspect(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\tcase VK_FORMAT_S8_UINT:\n\t\treturn true;\n\n\tdefault:\n\t\treturn false;\n\t}\n}\n\nstatic inline bool format_has_depth_or_stencil_aspect(VkFormat format)\n{\n\treturn format_has_depth_aspect(format) || format_has_stencil_aspect(format);\n}\n\nstatic inline VkImageAspectFlags format_to_aspect_mask(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_UNDEFINED:\n\t\treturn 0;\n\n\tcase VK_FORMAT_S8_UINT:\n\t\treturn VK_IMAGE_ASPECT_STENCIL_BIT;\n\n\tcase VK_FORMAT_D16_UNORM_S8_UINT:\n\tcase VK_FORMAT_D24_UNORM_S8_UINT:\n\tcase VK_FORMAT_D32_SFLOAT_S8_UINT:\n\t\treturn VK_IMAGE_ASPECT_STENCIL_BIT | VK_IMAGE_ASPECT_DEPTH_BIT;\n\n\tcase VK_FORMAT_D16_UNORM:\n\tcase VK_FORMAT_D32_SFLOAT:\n\tcase VK_FORMAT_X8_D24_UNORM_PACK32:\n\t\treturn VK_IMAGE_ASPECT_DEPTH_BIT;\n\n\tdefault:\n\t\treturn VK_IMAGE_ASPECT_COLOR_BIT;\n\t}\n}\n\nstatic inline void format_align_dim(VkFormat format, uint32_t &width, uint32_t &height)\n{\n\tuint32_t align_width, align_height;\n\tTextureFormatLayout::format_block_dim(format, align_width, align_height);\n\twidth = ((width + align_width - 1) \/ align_width) * align_width;\n\theight = ((height + align_height - 1) \/ align_height) * align_height;\n}\n\nstatic inline void format_num_blocks(VkFormat format, uint32_t &width, uint32_t &height)\n{\n\tuint32_t align_width, align_height;\n\tTextureFormatLayout::format_block_dim(format, align_width, align_height);\n\twidth = (width + align_width - 1) \/ align_width;\n\theight = (height + align_height - 1) \/ align_height;\n}\n\nstatic inline VkDeviceSize format_get_layer_size(VkFormat format, VkImageAspectFlags aspect, unsigned width, unsigned height, unsigned depth)\n{\n\tuint32_t blocks_x = width;\n\tuint32_t blocks_y = height;\n\tformat_num_blocks(format, blocks_x, blocks_y);\n\tformat_align_dim(format, width, height);\n\n\tVkDeviceSize size = TextureFormatLayout::format_block_size(format, aspect) * depth * blocks_x * blocks_y;\n\treturn size;\n}\n\nenum class YCbCrFormat\n{\n\tYUV420P_3PLANE,\n\tYUV444P_3PLANE,\n\tYUV422P_3PLANE,\n\tCount\n};\n\nstatic inline unsigned format_ycbcr_num_planes(VkFormat format)\n{\n\tswitch (format)\n\t{\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_420_UNORM:\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_422_UNORM:\n\tcase VK_FORMAT_G8_B8_R8_3PLANE_444_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_420_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_422_UNORM:\n\tcase VK_FORMAT_G16_B16_R16_3PLANE_444_UNORM:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6_R10X6_3PLANE_444_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4_R12X4_3PLANE_444_UNORM_3PACK16:\n\t\treturn 3;\n\n\tcase VK_FORMAT_G8_B8R8_2PLANE_420_UNORM:\n\tcase VK_FORMAT_G8_B8R8_2PLANE_422_UNORM:\n\tcase VK_FORMAT_G16_B16R16_2PLANE_420_UNORM:\n\tcase VK_FORMAT_G16_B16R16_2PLANE_422_UNORM:\n\tcase VK_FORMAT_G10X6_B10X6R10X6_2PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G10X6_B10X6R10X6_2PLANE_422_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4R12X4_2PLANE_420_UNORM_3PACK16:\n\tcase VK_FORMAT_G12X4_B12X4R12X4_2PLANE_422_UNORM_3PACK16:\n\t\treturn 2;\n\n\tdefault:\n\t\treturn 1;\n\t}\n}\n\nstatic inline unsigned format_ycbcr_num_planes(YCbCrFormat format)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn 3;\n\n\tdefault:\n\t\treturn 0;\n\t}\n}\n\nstatic inline void format_ycbcr_downsample_dimensions(VkFormat format, VkImageAspectFlags aspect, uint32_t &width, uint32_t &height)\n{\n\tif (aspect == VK_IMAGE_ASPECT_PLANE_0_BIT)\n\t\treturn;\n\n\tswitch (format)\n\t{\n#define fmt(x, sub0, sub1) \\\n\tcase VK_FORMAT_##x: \\\n\t\twidth >>= sub0; \\\n\t\theight >>= sub1; \\\n\t\tbreak\n\n\t\tfmt(G8_B8_R8_3PLANE_420_UNORM, 1, 1);\n\t\tfmt(G8_B8R8_2PLANE_420_UNORM, 1, 1);\n\t\tfmt(G8_B8_R8_3PLANE_422_UNORM, 1, 0);\n\t\tfmt(G8_B8R8_2PLANE_422_UNORM, 1, 0);\n\t\tfmt(G8_B8_R8_3PLANE_444_UNORM, 0, 0);\n\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_422_UNORM_3PACK16, 1, 0);\n\t\tfmt(G10X6_B10X6_R10X6_3PLANE_444_UNORM_3PACK16, 0, 0);\n\t\tfmt(G10X6_B10X6R10X6_2PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G10X6_B10X6R10X6_2PLANE_422_UNORM_3PACK16, 1, 0);\n\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_422_UNORM_3PACK16, 1, 0);\n\t\tfmt(G12X4_B12X4_R12X4_3PLANE_444_UNORM_3PACK16, 0, 0);\n\t\tfmt(G12X4_B12X4R12X4_2PLANE_420_UNORM_3PACK16, 1, 1);\n\t\tfmt(G12X4_B12X4R12X4_2PLANE_422_UNORM_3PACK16, 1, 0);\n\n\t\tfmt(G16_B16_R16_3PLANE_420_UNORM, 1, 1);\n\t\tfmt(G16_B16_R16_3PLANE_422_UNORM, 1, 0);\n\t\tfmt(G16_B16_R16_3PLANE_444_UNORM, 0, 0);\n\t\tfmt(G16_B16R16_2PLANE_420_UNORM, 1, 1);\n\t\tfmt(G16_B16R16_2PLANE_422_UNORM, 1, 0);\n\n\tdefault:\n\t\tbreak;\n\t}\n#undef fmt\n}\n\nstatic inline unsigned format_ycbcr_downsample_ratio_log2(YCbCrFormat format, unsigned dim, unsigned plane)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn plane > 0 ? 1 : 0;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn plane > 0 && dim == 0 ? 1 : 0;\n\n\tdefault:\n\t\treturn 0;\n\t}\n}\n\nstatic inline VkFormat format_ycbcr_plane_vk_format(YCbCrFormat format, unsigned plane)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn VK_FORMAT_R8_UNORM;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn plane > 0 ? VK_FORMAT_R8G8_UNORM : VK_FORMAT_R8_UNORM;\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn VK_FORMAT_R8_UNORM;\n\n\tdefault:\n\t\treturn VK_FORMAT_UNDEFINED;\n\t}\n}\n\nstatic inline VkFormat format_ycbcr_planar_vk_format(YCbCrFormat format)\n{\n\tswitch (format)\n\t{\n\tcase YCbCrFormat::YUV420P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_420_UNORM;\n\tcase YCbCrFormat::YUV422P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_422_UNORM;\n\tcase YCbCrFormat::YUV444P_3PLANE:\n\t\treturn VK_FORMAT_G8_B8_R8_3PLANE_444_UNORM;\n\n\tdefault:\n\t\treturn VK_FORMAT_UNDEFINED;\n\t}\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2012 Torus Knot Software Ltd\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreShaderExTriplanarTexturing.h\"\n#ifdef RTSHADER_SYSTEM_BUILD_EXT_SHADERS\n#include \"OgreShaderFFPRenderState.h\"\n#include \"OgreShaderProgram.h\"\n#include \"OgreShaderParameter.h\"\n#include \"OgreShaderProgramSet.h\"\n\nnamespace Ogre {\nnamespace RTShader {\n\n String TriplanarTexturing::type = \"SGX_TriplanarTexturing\";\n\n \/\/-----------------------------------------------------------------------\n\n bool TriplanarTexturing::resolveParameters(ProgramSet* programSet)\n {\n Program* vsProgram = programSet->getCpuVertexProgram();\n Program* psProgram = programSet->getCpuFragmentProgram();\n Function* vsMain = vsProgram->getEntryPointFunction();\n Function* psMain = psProgram->getEntryPointFunction();\n \n \/\/ Resolve pixel shader output diffuse color.\n mPSInDiffuse = vsMain->resolveInputParameter(Parameter::SPS_COLOR, 0, Parameter::SPC_COLOR_DIFFUSE, GCT_FLOAT4);\n\n \/\/ Resolve input vertex shader normal.\n mVSInNormal = vsMain->resolveInputParameter(Parameter::SPS_NORMAL, 0, Parameter::SPC_NORMAL_OBJECT_SPACE, GCT_FLOAT3);\n\n \/\/ Resolve output vertex shader normal.\n mVSOutNormal = vsMain->resolveOutputParameter(Parameter::SPS_TEXTURE_COORDINATES, -1, Parameter::SPC_NORMAL_VIEW_SPACE, GCT_FLOAT3);\n\n \/\/ Resolve input pixel shader normal.\n mPSInNormal = psMain->resolveInputParameter(Parameter::SPS_TEXTURE_COORDINATES, \n mVSOutNormal->getIndex(), \n mVSOutNormal->getContent(),\n GCT_FLOAT3);\n\n \/\/ Resolve input vertex shader normal.\n mVSInPosition = vsMain->resolveInputParameter(Parameter::SPS_POSITION, 0, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n\n mVSInPosition = vsMain->resolveInputParameter(Parameter::SPS_POSITION, 0, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n mVSOutPosition = vsMain->resolveOutputParameter(Parameter::SPS_TEXTURE_COORDINATES, -1, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n mPSInPosition = psMain->resolveInputParameter(Parameter::SPS_TEXTURE_COORDINATES, \n mVSOutPosition->getIndex(), \n mVSOutPosition->getContent(),\n GCT_FLOAT4);\n\n mSamplerFromX = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromX, (uint16)GPV_GLOBAL, \"tp_sampler_from_x\");\n if (mSamplerFromX.get() == NULL)\n return false;\n mSamplerFromY = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromY, (uint16)GPV_GLOBAL, \"tp_sampler_from_y\");\n if (mSamplerFromY.get() == NULL)\n return false;\n mSamplerFromZ = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromZ, (uint16)GPV_GLOBAL, \"tp_sampler_from_z\");\n if (mSamplerFromZ.get() == NULL)\n return false;\n \n mPSOutDiffuse = psMain->resolveOutputParameter(Parameter::SPS_COLOR, 0, Parameter::SPC_COLOR_DIFFUSE, GCT_FLOAT4);\n if (mPSOutDiffuse.get() == NULL)\t\n return false;\n \n mPSTPParams = psProgram->resolveParameter(GCT_FLOAT3, -1, (uint16)GPV_GLOBAL, \"gTPParams\");\n if (mPSTPParams.get() == NULL)\n return false;\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::resolveDependencies(ProgramSet* programSet)\n {\n Program* psProgram = programSet->getCpuFragmentProgram();\n Program* vsProgram = programSet->getCpuVertexProgram();\n psProgram->addDependency(\"SGXLib_TriplanarTexturing\");\n vsProgram->addDependency(FFP_LIB_COMMON);\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::addFunctionInvocations(ProgramSet* programSet)\n {\n Program* psProgram = programSet->getCpuFragmentProgram();\n Function* psMain = psProgram->getEntryPointFunction();\n Program* vsProgram = programSet->getCpuVertexProgram();\n Function* vsMain = vsProgram->getEntryPointFunction();\n\n size_t internalCounter = 0;\n \n FunctionInvocation *curFuncInvocation = OGRE_NEW FunctionInvocation(FFP_FUNC_ASSIGN, FFP_VS_TEXTURING, internalCounter++); \n curFuncInvocation->pushOperand(mVSInNormal, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mVSOutNormal, Operand::OPS_OUT);\t\n vsMain->addAtomInstance(curFuncInvocation);\n \n curFuncInvocation = OGRE_NEW FunctionInvocation(FFP_FUNC_ASSIGN, FFP_VS_TEXTURING, internalCounter++); \n curFuncInvocation->pushOperand(mVSInPosition, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mVSOutPosition, Operand::OPS_OUT);\t\n vsMain->addAtomInstance(curFuncInvocation);\n \n curFuncInvocation = OGRE_NEW FunctionInvocation(SGX_FUNC_TRIPLANAR_TEXTURING, FFP_PS_TEXTURING, internalCounter++);\n curFuncInvocation->pushOperand(mPSInDiffuse, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSInNormal, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSInPosition, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromX, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromY, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromZ, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSTPParams, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSOutDiffuse, Operand::OPS_OUT);\n psMain->addAtomInstance(curFuncInvocation);\t\n\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n const String& TriplanarTexturing::getType() const\n {\n return type;\n }\n\n \/\/-----------------------------------------------------------------------\n int\tTriplanarTexturing::getExecutionOrder() const\n {\n return FFP_TEXTURING;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::preAddToRenderState(const RenderState* renderState, Pass* srcPass, Pass* dstPass )\n {\n TextureUnitState* textureUnit;\n \n \/\/ Create the mapping textures\n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromX);\t\t\n mTextureSamplerIndexFromX = dstPass->getNumTextureUnitStates() - 1;\n \n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromY);\t\t\n mTextureSamplerIndexFromY = dstPass->getNumTextureUnitStates() - 1;\n \n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromZ);\t\t\n mTextureSamplerIndexFromZ = dstPass->getNumTextureUnitStates() - 1;\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::copyFrom(const SubRenderState& rhs)\n {\n const TriplanarTexturing& rhsTP = static_cast<const TriplanarTexturing&>(rhs);\n mPSOutDiffuse = rhsTP.mPSOutDiffuse;\n mPSInDiffuse = rhsTP.mPSInDiffuse;\n\n mVSInPosition = rhsTP.mVSInPosition;\n mVSOutPosition = rhsTP.mVSOutPosition;\n\n mVSOutNormal = rhsTP.mVSOutNormal;\n mVSInNormal = rhsTP.mVSInNormal;\n mPSInNormal = rhsTP.mPSInNormal;\n\n mVSOutPosition = rhsTP.mVSOutPosition;\n mVSInPosition = rhsTP.mVSInPosition;\n mPSInPosition = rhsTP.mPSInPosition;\n\n mSamplerFromX = rhsTP.mSamplerFromX;\n mSamplerFromY = rhsTP.mSamplerFromY;\n mSamplerFromZ = rhsTP.mSamplerFromZ;\n\n mPSTPParams = rhsTP.mPSTPParams;\n mParameters = rhsTP.mParameters;\n\n mTextureNameFromX = rhsTP.mTextureNameFromX;\n mTextureNameFromY = rhsTP.mTextureNameFromY;\n mTextureNameFromZ = rhsTP.mTextureNameFromZ;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::updateGpuProgramsParams(Renderable* rend, Pass* pass, const AutoParamDataSource* source, \n const LightList* pLightList)\n {\n mPSTPParams->setGpuParameter(mParameters);\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::setParameters(const Vector3 ¶meters)\n {\n mParameters = parameters;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::setTextureNames(const String &textureNameFromX, const String &textureNameFromY, const String &textureNameFromZ)\n {\n mTextureNameFromX = textureNameFromX;\n mTextureNameFromY = textureNameFromY;\n mTextureNameFromZ = textureNameFromZ;\n }\n\n \/\/-----------------------------------------------------------------------\n const String& TriplanarTexturingFactory::getType() const\n {\n return TriplanarTexturing::type;\n }\n\n \/\/-----------------------------------------------------------------------\n SubRenderState*\tTriplanarTexturingFactory::createInstance(ScriptCompiler* compiler, \n PropertyAbstractNode* prop, Pass* pass, SGScriptTranslator* translator)\n {\n\n if (prop->name == \"triplanarTexturing\")\n {\n if (prop->values.size() == 6)\n {\n SubRenderState* subRenderState = createOrRetrieveInstance(translator);\n TriplanarTexturing* tpSubRenderState = static_cast<TriplanarTexturing*>(subRenderState);\n float parameters[3];\n ColourValue cValue;\n AbstractNodeList::const_iterator it = prop->values.begin();\n if (false == SGScriptTranslator::getFloat(*it, parameters))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getFloat(*it, parameters + 1))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getFloat(*it, parameters + 2))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n Vector3 vParameters(parameters[0], parameters[1], parameters[2]);\n tpSubRenderState->setParameters(vParameters);\n\n String textureNameFromX, textureNameFromY, textureNameFromZ;\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromX))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromY))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromZ))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n tpSubRenderState->setTextureNames(textureNameFromX, textureNameFromY, textureNameFromZ);\n\n return subRenderState;\n }\n else\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n }\n }\n\n return NULL;\n }\n\n \/\/-----------------------------------------------------------------------\n SubRenderState*\tTriplanarTexturingFactory::createInstanceImpl()\n {\n return OGRE_NEW TriplanarTexturing;\n }\n\n\n}\n}\n\n#endif\n<commit_msg>RTSS: removed unused var<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2012 Torus Knot Software Ltd\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreShaderExTriplanarTexturing.h\"\n#ifdef RTSHADER_SYSTEM_BUILD_EXT_SHADERS\n#include \"OgreShaderFFPRenderState.h\"\n#include \"OgreShaderProgram.h\"\n#include \"OgreShaderParameter.h\"\n#include \"OgreShaderProgramSet.h\"\n\nnamespace Ogre {\nnamespace RTShader {\n\n String TriplanarTexturing::type = \"SGX_TriplanarTexturing\";\n\n \/\/-----------------------------------------------------------------------\n\n bool TriplanarTexturing::resolveParameters(ProgramSet* programSet)\n {\n Program* vsProgram = programSet->getCpuVertexProgram();\n Program* psProgram = programSet->getCpuFragmentProgram();\n Function* vsMain = vsProgram->getEntryPointFunction();\n Function* psMain = psProgram->getEntryPointFunction();\n \n \/\/ Resolve pixel shader output diffuse color.\n mPSInDiffuse = vsMain->resolveInputParameter(Parameter::SPS_COLOR, 0, Parameter::SPC_COLOR_DIFFUSE, GCT_FLOAT4);\n\n \/\/ Resolve input vertex shader normal.\n mVSInNormal = vsMain->resolveInputParameter(Parameter::SPS_NORMAL, 0, Parameter::SPC_NORMAL_OBJECT_SPACE, GCT_FLOAT3);\n\n \/\/ Resolve output vertex shader normal.\n mVSOutNormal = vsMain->resolveOutputParameter(Parameter::SPS_TEXTURE_COORDINATES, -1, Parameter::SPC_NORMAL_VIEW_SPACE, GCT_FLOAT3);\n\n \/\/ Resolve input pixel shader normal.\n mPSInNormal = psMain->resolveInputParameter(Parameter::SPS_TEXTURE_COORDINATES, \n mVSOutNormal->getIndex(), \n mVSOutNormal->getContent(),\n GCT_FLOAT3);\n\n \/\/ Resolve input vertex shader normal.\n mVSInPosition = vsMain->resolveInputParameter(Parameter::SPS_POSITION, 0, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n\n mVSInPosition = vsMain->resolveInputParameter(Parameter::SPS_POSITION, 0, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n mVSOutPosition = vsMain->resolveOutputParameter(Parameter::SPS_TEXTURE_COORDINATES, -1, Parameter::SPC_POSITION_OBJECT_SPACE, GCT_FLOAT4);\n mPSInPosition = psMain->resolveInputParameter(Parameter::SPS_TEXTURE_COORDINATES, \n mVSOutPosition->getIndex(), \n mVSOutPosition->getContent(),\n GCT_FLOAT4);\n\n mSamplerFromX = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromX, (uint16)GPV_GLOBAL, \"tp_sampler_from_x\");\n if (mSamplerFromX.get() == NULL)\n return false;\n mSamplerFromY = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromY, (uint16)GPV_GLOBAL, \"tp_sampler_from_y\");\n if (mSamplerFromY.get() == NULL)\n return false;\n mSamplerFromZ = psProgram->resolveParameter(GCT_SAMPLER2D, mTextureSamplerIndexFromZ, (uint16)GPV_GLOBAL, \"tp_sampler_from_z\");\n if (mSamplerFromZ.get() == NULL)\n return false;\n \n mPSOutDiffuse = psMain->resolveOutputParameter(Parameter::SPS_COLOR, 0, Parameter::SPC_COLOR_DIFFUSE, GCT_FLOAT4);\n if (mPSOutDiffuse.get() == NULL)\t\n return false;\n \n mPSTPParams = psProgram->resolveParameter(GCT_FLOAT3, -1, (uint16)GPV_GLOBAL, \"gTPParams\");\n if (mPSTPParams.get() == NULL)\n return false;\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::resolveDependencies(ProgramSet* programSet)\n {\n Program* psProgram = programSet->getCpuFragmentProgram();\n Program* vsProgram = programSet->getCpuVertexProgram();\n psProgram->addDependency(\"SGXLib_TriplanarTexturing\");\n vsProgram->addDependency(FFP_LIB_COMMON);\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::addFunctionInvocations(ProgramSet* programSet)\n {\n Program* psProgram = programSet->getCpuFragmentProgram();\n Function* psMain = psProgram->getEntryPointFunction();\n Program* vsProgram = programSet->getCpuVertexProgram();\n Function* vsMain = vsProgram->getEntryPointFunction();\n\n size_t internalCounter = 0;\n \n FunctionInvocation *curFuncInvocation = OGRE_NEW FunctionInvocation(FFP_FUNC_ASSIGN, FFP_VS_TEXTURING, internalCounter++); \n curFuncInvocation->pushOperand(mVSInNormal, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mVSOutNormal, Operand::OPS_OUT);\t\n vsMain->addAtomInstance(curFuncInvocation);\n \n curFuncInvocation = OGRE_NEW FunctionInvocation(FFP_FUNC_ASSIGN, FFP_VS_TEXTURING, internalCounter++); \n curFuncInvocation->pushOperand(mVSInPosition, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mVSOutPosition, Operand::OPS_OUT);\t\n vsMain->addAtomInstance(curFuncInvocation);\n \n curFuncInvocation = OGRE_NEW FunctionInvocation(SGX_FUNC_TRIPLANAR_TEXTURING, FFP_PS_TEXTURING, internalCounter++);\n curFuncInvocation->pushOperand(mPSInDiffuse, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSInNormal, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSInPosition, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromX, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromY, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mSamplerFromZ, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSTPParams, Operand::OPS_IN);\n curFuncInvocation->pushOperand(mPSOutDiffuse, Operand::OPS_OUT);\n psMain->addAtomInstance(curFuncInvocation);\t\n\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n const String& TriplanarTexturing::getType() const\n {\n return type;\n }\n\n \/\/-----------------------------------------------------------------------\n int\tTriplanarTexturing::getExecutionOrder() const\n {\n return FFP_TEXTURING;\n }\n\n \/\/-----------------------------------------------------------------------\n bool TriplanarTexturing::preAddToRenderState(const RenderState* renderState, Pass* srcPass, Pass* dstPass )\n {\n TextureUnitState* textureUnit;\n \n \/\/ Create the mapping textures\n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromX);\t\t\n mTextureSamplerIndexFromX = dstPass->getNumTextureUnitStates() - 1;\n \n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromY);\t\t\n mTextureSamplerIndexFromY = dstPass->getNumTextureUnitStates() - 1;\n \n textureUnit = dstPass->createTextureUnitState();\n textureUnit->setTextureName(mTextureNameFromZ);\t\t\n mTextureSamplerIndexFromZ = dstPass->getNumTextureUnitStates() - 1;\n return true;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::copyFrom(const SubRenderState& rhs)\n {\n const TriplanarTexturing& rhsTP = static_cast<const TriplanarTexturing&>(rhs);\n mPSOutDiffuse = rhsTP.mPSOutDiffuse;\n mPSInDiffuse = rhsTP.mPSInDiffuse;\n\n mVSInPosition = rhsTP.mVSInPosition;\n mVSOutPosition = rhsTP.mVSOutPosition;\n\n mVSOutNormal = rhsTP.mVSOutNormal;\n mVSInNormal = rhsTP.mVSInNormal;\n mPSInNormal = rhsTP.mPSInNormal;\n\n mVSOutPosition = rhsTP.mVSOutPosition;\n mVSInPosition = rhsTP.mVSInPosition;\n mPSInPosition = rhsTP.mPSInPosition;\n\n mSamplerFromX = rhsTP.mSamplerFromX;\n mSamplerFromY = rhsTP.mSamplerFromY;\n mSamplerFromZ = rhsTP.mSamplerFromZ;\n\n mPSTPParams = rhsTP.mPSTPParams;\n mParameters = rhsTP.mParameters;\n\n mTextureNameFromX = rhsTP.mTextureNameFromX;\n mTextureNameFromY = rhsTP.mTextureNameFromY;\n mTextureNameFromZ = rhsTP.mTextureNameFromZ;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::updateGpuProgramsParams(Renderable* rend, Pass* pass, const AutoParamDataSource* source, \n const LightList* pLightList)\n {\n mPSTPParams->setGpuParameter(mParameters);\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::setParameters(const Vector3 ¶meters)\n {\n mParameters = parameters;\n }\n\n \/\/-----------------------------------------------------------------------\n void TriplanarTexturing::setTextureNames(const String &textureNameFromX, const String &textureNameFromY, const String &textureNameFromZ)\n {\n mTextureNameFromX = textureNameFromX;\n mTextureNameFromY = textureNameFromY;\n mTextureNameFromZ = textureNameFromZ;\n }\n\n \/\/-----------------------------------------------------------------------\n const String& TriplanarTexturingFactory::getType() const\n {\n return TriplanarTexturing::type;\n }\n\n \/\/-----------------------------------------------------------------------\n SubRenderState*\tTriplanarTexturingFactory::createInstance(ScriptCompiler* compiler, \n PropertyAbstractNode* prop, Pass* pass, SGScriptTranslator* translator)\n {\n\n if (prop->name == \"triplanarTexturing\")\n {\n if (prop->values.size() == 6)\n {\n SubRenderState* subRenderState = createOrRetrieveInstance(translator);\n TriplanarTexturing* tpSubRenderState = static_cast<TriplanarTexturing*>(subRenderState);\n float parameters[3];\n AbstractNodeList::const_iterator it = prop->values.begin();\n if (false == SGScriptTranslator::getFloat(*it, parameters))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getFloat(*it, parameters + 1))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getFloat(*it, parameters + 2))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n Vector3 vParameters(parameters[0], parameters[1], parameters[2]);\n tpSubRenderState->setParameters(vParameters);\n\n String textureNameFromX, textureNameFromY, textureNameFromZ;\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromX))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromY))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n it++;\n if (false == SGScriptTranslator::getString(*it, &textureNameFromZ))\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n return NULL;\n }\n tpSubRenderState->setTextureNames(textureNameFromX, textureNameFromY, textureNameFromZ);\n\n return subRenderState;\n }\n else\n {\n compiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n }\n }\n\n return NULL;\n }\n\n \/\/-----------------------------------------------------------------------\n SubRenderState*\tTriplanarTexturingFactory::createInstanceImpl()\n {\n return OGRE_NEW TriplanarTexturing;\n }\n\n\n}\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\n *\/\n\n#include \"ip.hh\"\n#include \"core\/print.hh\"\n\nnamespace net {\n\nstd::ostream& operator<<(std::ostream& os, ipv4_address a) {\n auto ip = a.ip;\n return fprint(os, \"%d.%d.%d.%d\",\n (ip >> 24) & 0xff,\n (ip >> 16) & 0xff,\n (ip >> 8) & 0xff,\n (ip >> 0) & 0xff);\n}\n\nuint16_t ip_checksum(const void* data, size_t len) {\n uint64_t csum = 0;\n auto p64 = reinterpret_cast<const packed<uint64_t>*>(data);\n while (len >= 8) {\n auto old = csum;\n csum += ntohq(*p64++);\n csum += (csum < old);\n len -= 8;\n }\n auto p16 = reinterpret_cast<const packed<uint16_t>*>(p64);\n while (len >= 2) {\n auto old = csum;\n csum += ntohs(*p16++);\n csum += (csum < old);\n len -= 2;\n }\n auto p8 = reinterpret_cast<const uint8_t*>(p16);\n if (len) {\n auto old = csum;\n csum += *p8++ << 8;\n csum += (csum < old);\n len -= 1;\n }\n csum = (csum & 0xffff) + ((csum >> 16) & 0xffff) + ((csum >> 32) & 0xffff) + (csum >> 48);\n csum += csum >> 16;\n return htons(~csum);\n}\n\nipv4::ipv4(interface* netif)\n : _netif(netif)\n , _global_arp(netif)\n , _arp(_global_arp)\n , _l3(netif, 0x0800)\n , _l4({}) {\n run();\n}\n\nbool ipv4::in_my_netmask(ipv4_address a) const {\n return !((a.ip ^ _host_address.ip) & _netmask.ip);\n}\n\n\nvoid ipv4::run() {\n _l3.receive().then([this] (packet p, ethernet_address from) {\n handle_received_packet(std::move(p), from);\n run();\n });\n}\n\nvoid ipv4::handle_received_packet(packet p, ethernet_address from) {\n auto iph = p.get_header<ip_hdr>(0);\n if (!iph) {\n return;\n }\n ntoh(*iph);\n \/\/ FIXME: process options\n if (in_my_netmask(iph->src_ip) && iph->src_ip != _host_address) {\n _arp.learn(from, iph->src_ip);\n }\n if (iph->frag & 0x3fff) {\n \/\/ FIXME: defragment\n return;\n }\n if (iph->dst_ip != _host_address) {\n \/\/ FIXME: forward\n return;\n }\n auto l4 = _l4[iph->ip_proto];\n if (l4) {\n p.trim_front(iph->ihl * 4);\n l4->received(std::move(p), iph->src_ip, iph->dst_ip);\n }\n}\n\nvoid ipv4::send(ipv4_address to, uint8_t proto_num, packet p) {\n \/\/ FIXME: fragment\n ip_hdr iph;\n iph.ihl = sizeof(iph) \/ 4;\n iph.ver = 4;\n iph.dscp = 0;\n iph.ecn = 0;\n iph.len = p.len;\n iph.id = 0;\n iph.frag = 0;\n iph.ttl = 64;\n iph.ip_proto = proto_num;\n iph.csum = 0;\n iph.src_ip = _host_address;\n \/\/ FIXME: routing\n auto gw = to;\n iph.dst_ip = to;\n checksummer csum;\n csum.sum(reinterpret_cast<char*>(&iph), sizeof(iph));\n csum.sum(p);\n auto q = packet(fragment{reinterpret_cast<char*>(&iph), sizeof(iph)}, std::move(p));\n _arp.lookup(gw).then([this, p = std::move(q)] (ethernet_address e_dst) mutable {\n _send_sem.wait().then([this, e_dst, p = std::move(p)] () mutable {\n return _l3.send(e_dst, std::move(p));\n }).then([this] {\n _send_sem.signal();\n });\n });\n}\n\nvoid ipv4::set_host_address(ipv4_address ip) {\n _host_address = ip;\n _arp.set_self_addr(ip);\n}\n\nvoid checksummer::sum(const char* data, size_t len) {\n auto orig_len = len;\n if (odd) {\n partial += uint8_t(*data++);\n --len;\n }\n partial += ip_checksum(data, len);\n odd ^= orig_len & 1;\n}\n\nvoid checksummer::sum(const packet& p) {\n for (auto&& f : p.fragments) {\n sum(f.base, f.size);\n }\n}\n\nuint16_t checksummer::get() const {\n return partial + (partial >> 16);\n}\n\n}\n<commit_msg>net: fix ip tx<commit_after>\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\n *\/\n\n#include \"ip.hh\"\n#include \"core\/print.hh\"\n\nnamespace net {\n\nstd::ostream& operator<<(std::ostream& os, ipv4_address a) {\n auto ip = a.ip;\n return fprint(os, \"%d.%d.%d.%d\",\n (ip >> 24) & 0xff,\n (ip >> 16) & 0xff,\n (ip >> 8) & 0xff,\n (ip >> 0) & 0xff);\n}\n\nuint16_t ip_checksum(const void* data, size_t len) {\n uint64_t csum = 0;\n auto p64 = reinterpret_cast<const packed<uint64_t>*>(data);\n while (len >= 8) {\n auto old = csum;\n csum += ntohq(*p64++);\n csum += (csum < old);\n len -= 8;\n }\n auto p16 = reinterpret_cast<const packed<uint16_t>*>(p64);\n while (len >= 2) {\n auto old = csum;\n csum += ntohs(*p16++);\n csum += (csum < old);\n len -= 2;\n }\n auto p8 = reinterpret_cast<const uint8_t*>(p16);\n if (len) {\n auto old = csum;\n csum += *p8++ << 8;\n csum += (csum < old);\n len -= 1;\n }\n csum = (csum & 0xffff) + ((csum >> 16) & 0xffff) + ((csum >> 32) & 0xffff) + (csum >> 48);\n csum += csum >> 16;\n return htons(~csum);\n}\n\nipv4::ipv4(interface* netif)\n : _netif(netif)\n , _global_arp(netif)\n , _arp(_global_arp)\n , _l3(netif, 0x0800)\n , _l4({}) {\n run();\n}\n\nbool ipv4::in_my_netmask(ipv4_address a) const {\n return !((a.ip ^ _host_address.ip) & _netmask.ip);\n}\n\n\nvoid ipv4::run() {\n _l3.receive().then([this] (packet p, ethernet_address from) {\n handle_received_packet(std::move(p), from);\n run();\n });\n}\n\nvoid ipv4::handle_received_packet(packet p, ethernet_address from) {\n auto iph = p.get_header<ip_hdr>(0);\n if (!iph) {\n return;\n }\n ntoh(*iph);\n \/\/ FIXME: process options\n if (in_my_netmask(iph->src_ip) && iph->src_ip != _host_address) {\n _arp.learn(from, iph->src_ip);\n }\n if (iph->frag & 0x3fff) {\n \/\/ FIXME: defragment\n return;\n }\n if (iph->dst_ip != _host_address) {\n \/\/ FIXME: forward\n return;\n }\n auto l4 = _l4[iph->ip_proto];\n if (l4) {\n p.trim_front(iph->ihl * 4);\n l4->received(std::move(p), iph->src_ip, iph->dst_ip);\n }\n}\n\nvoid ipv4::send(ipv4_address to, uint8_t proto_num, packet p) {\n \/\/ FIXME: fragment\n ip_hdr iph;\n iph.ihl = sizeof(iph) \/ 4;\n iph.ver = 4;\n iph.dscp = 0;\n iph.ecn = 0;\n iph.len = sizeof(iph) + p.len;\n iph.id = 0;\n iph.frag = 0;\n iph.ttl = 64;\n iph.ip_proto = proto_num;\n iph.csum = 0;\n iph.src_ip = _host_address;\n \/\/ FIXME: routing\n auto gw = to;\n iph.dst_ip = to;\n hton(iph);\n checksummer csum;\n csum.sum(reinterpret_cast<char*>(&iph), sizeof(iph));\n iph.csum = csum.get();\n auto q = packet(fragment{reinterpret_cast<char*>(&iph), sizeof(iph)}, std::move(p));\n _arp.lookup(gw).then([this, p = std::move(q)] (ethernet_address e_dst) mutable {\n _send_sem.wait().then([this, e_dst, p = std::move(p)] () mutable {\n return _l3.send(e_dst, std::move(p));\n }).then([this] {\n _send_sem.signal();\n });\n });\n}\n\nvoid ipv4::set_host_address(ipv4_address ip) {\n _host_address = ip;\n _arp.set_self_addr(ip);\n}\n\nvoid checksummer::sum(const char* data, size_t len) {\n auto orig_len = len;\n if (odd) {\n partial += uint8_t(*data++);\n --len;\n }\n partial += ip_checksum(data, len);\n odd ^= orig_len & 1;\n}\n\nvoid checksummer::sum(const packet& p) {\n for (auto&& f : p.fragments) {\n sum(f.base, f.size);\n }\n}\n\nuint16_t checksummer::get() const {\n return partial + (partial >> 16);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016 GitHub, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include <dlfcn.h>\n#include <stdint.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"bcc_elf.h\"\n#include \"bcc_proc.h\"\n#include \"bcc_syms.h\"\n\n#include \"catch.hpp\"\n\nusing namespace std;\n\nTEST_CASE(\"shared object resolution\", \"[c_api]\") {\n const char *libm = bcc_procutils_which_so(\"m\");\n REQUIRE(libm);\n REQUIRE(libm[0] == '\/');\n REQUIRE(string(libm).find(\"libm.so\") != string::npos);\n}\n\nTEST_CASE(\"binary resolution with `which`\", \"[c_api]\") {\n char *ld = bcc_procutils_which(\"ld\");\n REQUIRE(ld);\n REQUIRE(ld[0] == '\/');\n free(ld);\n}\n\nstatic void _test_ksym(const char *sym, uint64_t addr, void *_) {\n if (!strcmp(sym, \"startup_64\")) {\n REQUIRE(addr == 0xffffffff81000000ull);\n } else if (!strcmp(sym, \"__per_cpu_start\"))\n REQUIRE(addr == 0x0);\n}\n\nTEST_CASE(\"list all kernel symbols\", \"[c_api]\") {\n if (geteuid() != 0)\n return;\n bcc_procutils_each_ksym(_test_ksym, NULL);\n}\n\nTEST_CASE(\"resolve symbol name in external library\", \"[c_api]\") {\n struct bcc_symbol sym;\n\n REQUIRE(bcc_resolve_symname(\"c\", \"malloc\", 0x0, &sym) == 0);\n REQUIRE(string(sym.module).find(\"libc.so\") != string::npos);\n REQUIRE(sym.module[0] == '\/');\n REQUIRE(sym.offset != 0);\n}\n\nextern \"C\" int _a_test_function(const char *a_string) {\n int i;\n for (i = 0; a_string[i]; ++i)\n ;\n return i;\n}\n\nTEST_CASE(\"resolve symbol addresses for a given PID\", \"[c_api]\") {\n struct bcc_symbol sym;\n void *resolver = bcc_symcache_new(getpid());\n\n REQUIRE(resolver);\n\n SECTION(\"resolve in our own binary memory space\") {\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)&_a_test_function, &sym) ==\n 0);\n\n char *this_exe = realpath(\"\/proc\/self\/exe\", NULL);\n REQUIRE(string(this_exe) == sym.module);\n free(this_exe);\n\n REQUIRE(string(\"_a_test_function\") == sym.name);\n }\n\n SECTION(\"resolve in libbcc.so\") {\n void *libbcc = dlopen(\"libbcc.so\", RTLD_LAZY | RTLD_NOLOAD);\n REQUIRE(libbcc);\n\n void *libbcc_fptr = dlsym(libbcc, \"bcc_resolve_symname\");\n REQUIRE(libbcc_fptr);\n\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)libbcc_fptr, &sym) == 0);\n REQUIRE(string(sym.module).find(\"libbcc.so\") != string::npos);\n REQUIRE(string(\"bcc_resolve_symname\") == sym.name);\n }\n\n SECTION(\"resolve in libc\") {\n void *libc_fptr = dlsym(NULL, \"strtok\");\n REQUIRE(libc_fptr);\n\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)libc_fptr, &sym) == 0);\n REQUIRE(sym.module);\n REQUIRE(sym.module[0] == '\/');\n REQUIRE(string(sym.module).find(\"libc\") != string::npos);\n REQUIRE(string(\"strtok\") == sym.name);\n }\n}\n<commit_msg>tests: only test arch-specific symbols<commit_after>\/*\n * Copyright (c) 2016 GitHub, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include <dlfcn.h>\n#include <stdint.h>\n#include <string.h>\n#include <unistd.h>\n\n#include \"bcc_elf.h\"\n#include \"bcc_proc.h\"\n#include \"bcc_syms.h\"\n\n#include \"catch.hpp\"\n\nusing namespace std;\n\nTEST_CASE(\"shared object resolution\", \"[c_api]\") {\n const char *libm = bcc_procutils_which_so(\"m\");\n REQUIRE(libm);\n REQUIRE(libm[0] == '\/');\n REQUIRE(string(libm).find(\"libm.so\") != string::npos);\n}\n\nTEST_CASE(\"binary resolution with `which`\", \"[c_api]\") {\n char *ld = bcc_procutils_which(\"ld\");\n REQUIRE(ld);\n REQUIRE(ld[0] == '\/');\n free(ld);\n}\n\nstatic void _test_ksym(const char *sym, uint64_t addr, void *_) {\n if (!strcmp(sym, \"startup_64\")) {\n REQUIRE(addr == 0xffffffff81000000ull);\n } else if (!strcmp(sym, \"system_reset_pSeries\"))\n REQUIRE(addr == 0xc000000000000100ull);\n}\n\nTEST_CASE(\"list all kernel symbols\", \"[c_api]\") {\n if (geteuid() != 0)\n return;\n bcc_procutils_each_ksym(_test_ksym, NULL);\n}\n\nTEST_CASE(\"resolve symbol name in external library\", \"[c_api]\") {\n struct bcc_symbol sym;\n\n REQUIRE(bcc_resolve_symname(\"c\", \"malloc\", 0x0, &sym) == 0);\n REQUIRE(string(sym.module).find(\"libc.so\") != string::npos);\n REQUIRE(sym.module[0] == '\/');\n REQUIRE(sym.offset != 0);\n}\n\nextern \"C\" int _a_test_function(const char *a_string) {\n int i;\n for (i = 0; a_string[i]; ++i)\n ;\n return i;\n}\n\nTEST_CASE(\"resolve symbol addresses for a given PID\", \"[c_api]\") {\n struct bcc_symbol sym;\n void *resolver = bcc_symcache_new(getpid());\n\n REQUIRE(resolver);\n\n SECTION(\"resolve in our own binary memory space\") {\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)&_a_test_function, &sym) ==\n 0);\n\n char *this_exe = realpath(\"\/proc\/self\/exe\", NULL);\n REQUIRE(string(this_exe) == sym.module);\n free(this_exe);\n\n REQUIRE(string(\"_a_test_function\") == sym.name);\n }\n\n SECTION(\"resolve in libbcc.so\") {\n void *libbcc = dlopen(\"libbcc.so\", RTLD_LAZY | RTLD_NOLOAD);\n REQUIRE(libbcc);\n\n void *libbcc_fptr = dlsym(libbcc, \"bcc_resolve_symname\");\n REQUIRE(libbcc_fptr);\n\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)libbcc_fptr, &sym) == 0);\n REQUIRE(string(sym.module).find(\"libbcc.so\") != string::npos);\n REQUIRE(string(\"bcc_resolve_symname\") == sym.name);\n }\n\n SECTION(\"resolve in libc\") {\n void *libc_fptr = dlsym(NULL, \"strtok\");\n REQUIRE(libc_fptr);\n\n REQUIRE(bcc_symcache_resolve(resolver, (uint64_t)libc_fptr, &sym) == 0);\n REQUIRE(sym.module);\n REQUIRE(sym.module[0] == '\/');\n REQUIRE(string(sym.module).find(\"libc\") != string::npos);\n REQUIRE(string(\"strtok\") == sym.name);\n }\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>COMP-8312: Fixed start_container_sync() method so that it invokes acsutilAwaitContainerStart instead of acsStartContainer<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cstring>\n\n#if defined _OPENMP\n#include <omp.h>\n#else\n#define omp_get_thread_num() 0\n#endif\n\n#ifdef _MSC_VER\n#pragma warning(disable:4127)\n#endif\n#define __DYN_GRID_SIZE\n#include \"common.h\"\n#include \"metrix.h\"\n#include \"OskarBinReader.h\"\n#include \"aligned_malloc.h\"\n\n#define as256p(p) (reinterpret_cast<__m256d*>(p))\n#define as256pc(p) (reinterpret_cast<const __m256d*>(p))\n\ninline\nvoid addGrids(\n complexd dst[]\n , const complexd srcs[]\n , int nthreads\n , int grid_pitch\n , int grid_size\n )\n{\n int siz = grid_size*grid_pitch;\n#pragma omp parallel for\n for (unsigned int i = 0; i < siz*sizeof(complexd)\/(256\/8); i++) {\n __m256d sum = as256pc(srcs)[i];\n \/\/ __m256d sum = _mm256_loadu_pd(reinterpret_cast<const double*>(as256pc(srcs)+i));\n\n for (int g = 1; g < nthreads; g ++)\n sum = _mm256_add_pd(sum, as256pc(srcs + g * siz)[i]);\n\n as256p(dst)[i] = sum;\n }\n}\n\n\/\/ We could simply use pointer-to-function template\n\/\/ but most C++ compilers seem to produce worse code\n\/\/ in such a case. Thus we wrap it in a class.\ntemplate <\n int over\n , bool do_mirror\n , typename Inp\n > struct cvt {};\n\ntemplate <\n int over\n , bool do_mirror\n > struct cvt<over, do_mirror, Pregridded> {\n static void pre(double, double, Pregridded inp, Pregridded & outpr, int) {outpr = inp;}\n};\n\ntemplate <\n int over\n , bool do_mirror\n > struct cvt<over, do_mirror, Double3> {\n static void pre(double scale, double wstep, Double3 inp, Pregridded & outpr, int grid_size) {\n pregridPoint<over, do_mirror>(scale, wstep, inp, outpr, grid_size);\n }\n};\n\ntemplate <\n int over\n , bool is_half_gcf\n , bool use_permutations\n\n , typename Inp\n >\n\/\/ grid must be initialized to 0s.\nvoid gridKernel_scatter(\n double scale\n , double wstep\n , int baselines\n , const BlWMap permutations[\/* baselines *\/]\n , complexd grids[]\n \/\/ We have a [w_planes][over][over]-shaped array of pointers to\n \/\/ variable-sized gcf layers, but we precompute (in pregrid)\n \/\/ exact index into this array, thus we use plain pointer here\n , const complexd * gcf[]\n , const Inp _uvw[]\n , const complexd _vis[]\n , int ts_ch\n , int grid_pitch\n , int grid_size\n ) {\n int siz = grid_size*grid_pitch;\n#pragma omp parallel\n {\n complexd * _grid = grids + omp_get_thread_num() * siz;\n memset(_grid, 0, sizeof(complexd) * siz);\n __ACC(complexd, grid, grid_pitch);\n\n#pragma omp for schedule(dynamic)\n for(int bl0 = 0; bl0 < baselines; bl0++) {\n int bl;\n if (use_permutations) bl = permutations[bl0].bl;\n else bl = bl0;\n int max_supp_here;\n max_supp_here = get_supp(permutations[bl].wp);\n\n \/\/ Rotation\n \/\/ VLA requires \"--std=gnu...\" extension\n complexd vis[ts_ch];\n int off;\n off = bl*ts_ch;\n const Inp * uvw;\n uvw = _uvw + off;\n for(int n=0; n<ts_ch; n++){\n vis[n] = rotw(_vis[off + n], uvw[n].w);\n }\n \n for (int su = 0; su < max_supp_here; su++) { \/\/ Moved from 2-levels below according to Romein\n for (int i = 0; i < ts_ch; i++) {\n Pregridded p;\n cvt<over, is_half_gcf, Inp>::pre(scale, wstep, uvw[i], p, grid_size);\n\n for (int sv = 0; sv < max_supp_here; sv++) {\n \/\/ Don't forget our u v are already translated by -max_supp_here\/2\n int gsu, gsv;\n gsu = p.u + su;\n gsv = p.v + sv;\n\n complexd supportPixel;\n #define __layeroff su * max_supp_here + sv\n if (is_half_gcf) {\n int index;\n index = p.gcf_layer_index;\n \/\/ Negative index indicates that original w was mirrored\n \/\/ and we shall negate the index to obtain correct\n \/\/ offset *and* conjugate the result.\n if (index < 0) {\n supportPixel = conj(gcf[-index][__layeroff]);\n } else {\n supportPixel = gcf[index][__layeroff];\n }\n } else {\n supportPixel = gcf[p.gcf_layer_index][__layeroff];\n }\n\n grid[gsu][gsv] += vis[i] * supportPixel;\n }\n }\n }\n }\n }\n}\n\n\ntemplate <\n int over\n , bool is_half_gcf\n , bool use_permutations\n\n , typename Inp\n >\n\/\/ grid must be initialized to 0s.\nvoid gridKernel_scatter_full(\n double scale\n , double wstep\n , int baselines\n , const BlWMap permutations[\/* baselines *\/]\n , complexd grid[]\n \/\/ We have a [w_planes][over][over]-shaped array of pointers to\n \/\/ variable-sized gcf layers, but we precompute (in pregrid)\n \/\/ exact index into this array, thus we use plain pointer here\n , const complexd * gcf[]\n , const Inp uvw[]\n , const complexd vis[]\n , int ts_ch\n , int grid_pitch\n , int grid_size\n ) {\n#if defined _OPENMP\n int siz = grid_size*grid_pitch;\n int nthreads;\n\n#pragma omp parallel\n#pragma omp single\n nthreads = omp_get_num_threads();\n\n \/\/ Nullify incoming grid, allocate thread-local grids\n memset(grid, 0, sizeof(complexd) * siz);\n complexd * tmpgrids = alignedMallocArray<complexd>(siz * nthreads, 32);\n \n gridKernel_scatter<\n over\n , is_half_gcf\n , use_permutations\n\n , Inp\n >(scale, wstep, baselines, permutations, tmpgrids, gcf, uvw, vis, ts_ch, grid_pitch, grid_size);\n addGrids(grid, tmpgrids, nthreads, grid_pitch, grid_size);\n free(tmpgrids);\n#else\n gridKernel_scatter<\n over\n , is_half_gcf\n , use_permutations\n\n , Inp\n >(scale, wstep, baselines, permutations, grid, gcf, uvw, vis, ts_ch, grid_pitch, grid_size);\n#endif\n}\n\n#define gridKernelCPU(hgcfSuff, isHgcf, permSuff, isPerm) \\\nextern \"C\" \\\nvoid gridKernelCPU##hgcfSuff##permSuff( \\\n double scale \\\n , double wstep \\\n , int baselines \\\n , const BlWMap permutations[\/* baselines *\/] \\\n , complexd grid[] \\\n , const complexd * gcf[] \\\n , const Double3 uvw[] \\\n , const complexd vis[] \\\n , int ts_ch \\\n , int grid_pitch \\\n , int grid_size \\\n ){ \\\n gridKernel_scatter_full<OVER, isHgcf, isPerm> \\\n ( scale, wstep, baselines, permutations \\\n , grid, gcf, uvw, vis, ts_ch, grid_pitch, grid_size); \\\n}\n\ngridKernelCPU(HalfGCF, true, Perm, true)\ngridKernelCPU(HalfGCF, true, , false)\ngridKernelCPU(FullGCF, false, Perm, true)\ngridKernelCPU(FullGCF, false, , false)\n\n\/\/ Normalization is done inplace!\nextern \"C\"\nvoid normalize(\n int n\n , complexd src[]\n , int grid_pitch\n , int grid_size\n )\n{\n int siz = grid_size*grid_pitch;\n double norm = 1.0\/double(siz);\n#pragma omp parallel for\n for (int i = 0; i < siz; i++) {\n src[i] *= norm;\n }\n}\n<commit_msg>Added CPU degridder. Didn't bother to write much new code, basically swapped grid and viz data in existing gridder code.<commit_after>#include <cstring>\n\n#if defined _OPENMP\n#include <omp.h>\n#else\n#define omp_get_thread_num() 0\n#endif\n\n#ifdef _MSC_VER\n#pragma warning(disable:4127)\n#endif\n#define __DYN_GRID_SIZE\n#include \"common.h\"\n#include \"metrix.h\"\n#include \"OskarBinReader.h\"\n#include \"aligned_malloc.h\"\n\n#define as256p(p) (reinterpret_cast<__m256d*>(p))\n#define as256pc(p) (reinterpret_cast<const __m256d*>(p))\n\n#ifndef __DEGRID\n#define GRID_MOD\n#define VIS_MOD const\ninline\nvoid addGrids(\n complexd dst[]\n , const complexd srcs[]\n , int nthreads\n , int grid_pitch\n , int grid_size\n )\n{\n int siz = grid_size*grid_pitch;\n#pragma omp parallel for\n for (unsigned int i = 0; i < siz*sizeof(complexd)\/(256\/8); i++) {\n __m256d sum = as256pc(srcs)[i];\n \/\/ __m256d sum = _mm256_loadu_pd(reinterpret_cast<const double*>(as256pc(srcs)+i));\n\n for (int g = 1; g < nthreads; g ++)\n sum = _mm256_add_pd(sum, as256pc(srcs + g * siz)[i]);\n\n as256p(dst)[i] = sum;\n }\n}\n#else\n#define GRID_MOD const\n#define VIS_MOD\n#endif\n\n\/\/ We could simply use pointer-to-function template\n\/\/ but most C++ compilers seem to produce worse code\n\/\/ in such a case. Thus we wrap it in a class.\ntemplate <\n int over\n , bool do_mirror\n , typename Inp\n > struct cvt {};\n\ntemplate <\n int over\n , bool do_mirror\n > struct cvt<over, do_mirror, Pregridded> {\n static void pre(double, double, Pregridded inp, Pregridded & outpr, int) {outpr = inp;}\n};\n\ntemplate <\n int over\n , bool do_mirror\n > struct cvt<over, do_mirror, Double3> {\n static void pre(double scale, double wstep, Double3 inp, Pregridded & outpr, int grid_size) {\n pregridPoint<over, do_mirror>(scale, wstep, inp, outpr, grid_size);\n }\n};\n\ntemplate <\n int over\n , bool is_half_gcf\n , bool use_permutations\n\n , typename Inp\n >\n\/\/ grid must be initialized to 0s.\nvoid gridKernel_scatter(\n double scale\n , double wstep\n , int baselines\n , const BlWMap permutations[\/* baselines *\/]\n , GRID_MOD complexd grids[]\n \/\/ We have a [w_planes][over][over]-shaped array of pointers to\n \/\/ variable-sized gcf layers, but we precompute (in pregrid)\n \/\/ exact index into this array, thus we use plain pointer here\n , const complexd * gcf[]\n , const Inp _uvw[]\n , VIS_MOD complexd _vis[]\n , int ts_ch\n , int grid_pitch\n , int grid_size\n ) {\n int siz = grid_size*grid_pitch;\n#pragma omp parallel\n {\n GRID_MOD complexd * _grid = grids + omp_get_thread_num() * siz;\n#ifndef __DEGRID\n memset(_grid, 0, sizeof(complexd) * siz);\n#else\n memset(_vis, 0, sizeof(complexd) * baselines * ts_ch);\n#endif\n __ACC(complexd, grid, grid_pitch);\n\n#pragma omp for schedule(dynamic)\n for(int bl0 = 0; bl0 < baselines; bl0++) {\n int bl;\n if (use_permutations) bl = permutations[bl0].bl;\n else bl = bl0;\n int max_supp_here;\n max_supp_here = get_supp(permutations[bl].wp);\n\n int off;\n off = bl*ts_ch;\n const Inp * uvw;\n uvw = _uvw + off;\n#ifndef __DEGRID\n \/\/ Rotation\n \/\/ VLA requires \"--std=gnu...\" extension\n complexd vis[ts_ch];\n for(int n=0; n<ts_ch; n++){\n vis[n] = rotw(_vis[off + n], uvw[n].w);\n }\n#else\n complexd * vis;\n vis = _vis + off;\n#endif\n for (int su = 0; su < max_supp_here; su++) { \/\/ Moved from 2-levels below according to Romein\n for (int i = 0; i < ts_ch; i++) {\n Pregridded p;\n cvt<over, is_half_gcf, Inp>::pre(scale, wstep, uvw[i], p, grid_size);\n\n for (int sv = 0; sv < max_supp_here; sv++) {\n \/\/ Don't forget our u v are already translated by -max_supp_here\/2\n int gsu, gsv;\n gsu = p.u + su;\n gsv = p.v + sv;\n\n complexd supportPixel;\n #define __layeroff su * max_supp_here + sv\n if (is_half_gcf) {\n int index;\n index = p.gcf_layer_index;\n \/\/ Negative index indicates that original w was mirrored\n \/\/ and we shall negate the index to obtain correct\n \/\/ offset *and* conjugate the result.\n if (index < 0) {\n supportPixel = conj(gcf[-index][__layeroff]);\n } else {\n supportPixel = gcf[index][__layeroff];\n }\n } else {\n supportPixel = gcf[p.gcf_layer_index][__layeroff];\n }\n#ifndef __DEGRID\n grid[gsu][gsv] += vis[i] * supportPixel;\n#else\n vis[i] += rotw(grid[gsu][gsv] * supportPixel, uvw[i].w);\n#endif\n }\n }\n }\n }\n }\n}\n\n#ifndef __DEGRID\ntemplate <\n int over\n , bool is_half_gcf\n , bool use_permutations\n\n , typename Inp\n >\n\/\/ grid must be initialized to 0s.\nvoid gridKernel_scatter_full(\n double scale\n , double wstep\n , int baselines\n , const BlWMap permutations[\/* baselines *\/]\n , complexd grid[]\n \/\/ We have a [w_planes][over][over]-shaped array of pointers to\n \/\/ variable-sized gcf layers, but we precompute (in pregrid)\n \/\/ exact index into this array, thus we use plain pointer here\n , const complexd * gcf[]\n , const Inp uvw[]\n , const complexd vis[]\n , int ts_ch\n , int grid_pitch\n , int grid_size\n ) {\n#if defined _OPENMP\n int siz = grid_size*grid_pitch;\n int nthreads;\n\n#pragma omp parallel\n#pragma omp single\n nthreads = omp_get_num_threads();\n\n \/\/ Nullify incoming grid, allocate thread-local grids\n memset(grid, 0, sizeof(complexd) * siz);\n complexd * tmpgrids = alignedMallocArray<complexd>(siz * nthreads, 32);\n \n gridKernel_scatter<\n over\n , is_half_gcf\n , use_permutations\n\n , Inp\n >(scale, wstep, baselines, permutations, tmpgrids, gcf, uvw, vis, ts_ch, grid_pitch, grid_size);\n addGrids(grid, tmpgrids, nthreads, grid_pitch, grid_size);\n free(tmpgrids);\n#else\n gridKernel_scatter<\n over\n , is_half_gcf\n , use_permutations\n\n , Inp\n >(scale, wstep, baselines, permutations, grid, gcf, uvw, vis, ts_ch, grid_pitch, grid_size);\n#endif\n}\n\n#define gridKernelCPU(hgcfSuff, isHgcf, permSuff, isPerm) \\\nextern \"C\" \\\nvoid gridKernelCPU##hgcfSuff##permSuff( \\\n double scale \\\n , double wstep \\\n , int baselines \\\n , const BlWMap permutations[\/* baselines *\/] \\\n , complexd grid[] \\\n , const complexd * gcf[] \\\n , const Double3 uvw[] \\\n , const complexd vis[] \\\n , int ts_ch \\\n , int grid_pitch \\\n , int grid_size \\\n ){ \\\n gridKernel_scatter_full<OVER, isHgcf, isPerm> \\\n ( scale, wstep, baselines, permutations \\\n , grid, gcf, uvw, vis, ts_ch, grid_pitch, grid_size); \\\n}\n\ngridKernelCPU(HalfGCF, true, Perm, true)\ngridKernelCPU(HalfGCF, true, , false)\ngridKernelCPU(FullGCF, false, Perm, true)\ngridKernelCPU(FullGCF, false, , false)\n\n\/\/ Normalization is done inplace!\nextern \"C\"\nvoid normalize(\n int n\n , complexd src[]\n , int grid_pitch\n , int grid_size\n )\n{\n int siz = grid_size*grid_pitch;\n double norm = 1.0\/double(siz);\n#pragma omp parallel for\n for (int i = 0; i < siz; i++) {\n src[i] *= norm;\n }\n}\n\n#else\n\n#define deGridKernelCPU(hgcfSuff, isHgcf, permSuff, isPerm) \\\nextern \"C\" \\\nvoid deGridKernelCPU##hgcfSuff##permSuff( \\\n double scale \\\n , double wstep \\\n , int baselines \\\n , const BlWMap permutations[\/* baselines *\/] \\\n , const complexd grid[] \\\n , const complexd * gcf[] \\\n , const Double3 uvw[] \\\n , complexd vis[] \\\n , int ts_ch \\\n , int grid_pitch \\\n , int grid_size \\\n ){ \\\n gridKernel_scatter<OVER, isHgcf, isPerm> \\\n ( scale, wstep, baselines, permutations \\\n , grid, gcf, uvw, vis, ts_ch, grid_pitch, grid_size); \\\n}\n\ndeGridKernelCPU(HalfGCF, true, Perm, true)\ndeGridKernelCPU(HalfGCF, true, , false)\ndeGridKernelCPU(FullGCF, false, Perm, true)\ndeGridKernelCPU(FullGCF, false, , false)\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed the issue with the varibles of the function not being initalised in the contructor with both Progenetor fraction as well as the other missing varibles. Additionally Moved some initlisation of later varibles in the run loop, to fix a bug that was cropping up with labling the pdg codes of empty jets<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"..\/..\/src\/svgdom\/dom.hpp\"\n\n#include <clocale>\n\n#include <utki\/debug.hpp>\n\n#include <papki\/fs_file.hpp>\n\nint main(int argc, char** argv){\n\tstd::string filename;\n\tswitch(argc){\n\t\tcase 0:\n\t\tcase 1:\n\t\t\tstd::cout << \"Warning: expected 1 argument: <svg-file>\" << std::endl;\n\t\t\tstd::cout << \"\\tGot 0 arguments, assuming <svg-file>=tiger.svg\" << std::endl;\n\t\t\tfilename = \"tiger.svg\";\n\t\t\tbreak;\n\t\tdefault:\n\t\tcase 2:\n\t\t\tfilename = argv[1];\n\t\t\tbreak;\n\t}\n\n\t\/\/ make sure the locale does not affect parsing (decimal delimiter can be \".\" or \",\" in different locales)\n\t\/\/ so, set DE locale which has \",\" to make sure it does not affect the parsing\n\tstd::setlocale(LC_ALL, \"de_DE.UTF-8\");\n\t\n\tauto dom = svgdom::load(papki::fs_file(filename));\n\t\n\/\/\tTRACE_ALWAYS(<< \"file read\" << std::endl)\n\t\n\tASSERT_ALWAYS(dom)\n\t\n\tauto str = dom->to_string();\n\/\/\tTRACE_ALWAYS(<< str << std::endl)\n\t\n\tpapki::fs_file out_file(\"out.svg\");\n\tpapki::file::guard file_guard(out_file, papki::file::mode::create);\n\tout_file.write(utki::make_span(str));\n}\n<commit_msg>set test locale but and print warning in case of error<commit_after>#include \"..\/..\/src\/svgdom\/dom.hpp\"\n\n#include <clocale>\n\n#include <utki\/debug.hpp>\n\n#include <papki\/fs_file.hpp>\n\nint main(int argc, char** argv){\n\tstd::string filename;\n\tswitch(argc){\n\t\tcase 0:\n\t\tcase 1:\n\t\t\tstd::cout << \"Warning: expected 1 argument: <svg-file>\" << std::endl;\n\t\t\tstd::cout << \"\\tGot 0 arguments, assuming <svg-file>=tiger.svg\" << std::endl;\n\t\t\tfilename = \"tiger.svg\";\n\t\t\tbreak;\n\t\tdefault:\n\t\tcase 2:\n\t\t\tfilename = argv[1];\n\t\t\tbreak;\n\t}\n\n\t\/\/ make sure the locale does not affect parsing (decimal delimiter can be \".\" or \",\" in different locales)\n\t\/\/ so, set DE locale which has \",\" to make sure it does not affect the parsing\n\tif(!std::setlocale(LC_ALL, \"de_DE.UTF-8\")){\n\t\tutki::log([](auto& o){o << \"WARNING: failed to set locale de_DE.UTF-8, perhaps the locale is not installed. Testing that locale does not affect parsing will not be done.\";});\n\t}\n\t\n\tauto dom = svgdom::load(papki::fs_file(filename));\n\t\n\/\/\tTRACE_ALWAYS(<< \"file read\" << std::endl)\n\t\n\tASSERT_ALWAYS(dom)\n\t\n\tauto str = dom->to_string();\n\/\/\tTRACE_ALWAYS(<< str << std::endl)\n\t\n\tpapki::fs_file out_file(\"out.svg\");\n\tpapki::file::guard file_guard(out_file, papki::file::mode::create);\n\tout_file.write(utki::make_span(str));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Bitsend developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"core.h\"\n#include \"util.h\"\n#include \"main.h\"\n#include \"uint256.h\"\n\nstd::string COutPoint::ToString() const\n{\n return strprintf(\"COutPoint(%s, %u)\", hash.ToString().substr(0,64), n);\n}\n\nvoid COutPoint::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nCTxIn::CTxIn(COutPoint prevoutIn, CScript scriptSigIn, unsigned int nSequenceIn)\n{\n prevout = prevoutIn;\n scriptSig = scriptSigIn;\n nSequence = nSequenceIn;\n}\n\nCTxIn::CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn, unsigned int nSequenceIn)\n{\n prevout = COutPoint(hashPrevTx, nOut);\n scriptSig = scriptSigIn;\n nSequence = nSequenceIn;\n}\n\nstd::string CTxIn::ToString() const\n{\n std::string str;\n str += \"CTxIn(\";\n str += prevout.ToString();\n if (prevout.IsNull())\n str += strprintf(\", coinbase %s\", HexStr(scriptSig));\n else\n str += strprintf(\", scriptSig=%s\", scriptSig.ToString().substr(0,24));\n if (nSequence != std::numeric_limits<unsigned int>::max())\n str += strprintf(\", nSequence=%u\", nSequence);\n str += \")\";\n return str;\n}\n\nvoid CTxIn::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nCTxOut::CTxOut(int64_t nValueIn, CScript scriptPubKeyIn)\n{\n nValue = nValueIn;\n nRounds = -10; \/\/ an initial value, should be no way to get this by calculations\n scriptPubKey = scriptPubKeyIn;\n}\n\nuint256 CTxOut::GetHash() const\n{\n return SerializeHash(*this);\n}\n\nstd::string CTxOut::ToString() const\n{\n return strprintf(\"CTxOut(nValue=%d.%08d, scriptPubKey=%s)\", nValue \/ COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30));\n}\n\nvoid CTxOut::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nuint256 CTransaction::GetHash() const\n{\n return SerializeHash(*this);\n}\n\nbool CTransaction::IsNewerThan(const CTransaction& old) const\n{\n if (vin.size() != old.vin.size())\n return false;\n for (unsigned int i = 0; i < vin.size(); i++)\n if (vin[i].prevout != old.vin[i].prevout)\n return false;\n\n bool fNewer = false;\n unsigned int nLowest = std::numeric_limits<unsigned int>::max();\n for (unsigned int i = 0; i < vin.size(); i++)\n {\n if (vin[i].nSequence != old.vin[i].nSequence)\n {\n if (vin[i].nSequence <= nLowest)\n {\n fNewer = false;\n nLowest = vin[i].nSequence;\n }\n if (old.vin[i].nSequence < nLowest)\n {\n fNewer = true;\n nLowest = old.vin[i].nSequence;\n }\n }\n }\n return fNewer;\n}\n\nint64_t CTransaction::GetValueOut() const\n{\n int64_t nValueOut = 0;\n BOOST_FOREACH(const CTxOut& txout, vout)\n {\n nValueOut += txout.nValue;\n if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))\n throw std::runtime_error(\"CTransaction::GetValueOut() : value out of range\");\n }\n return nValueOut;\n}\n\ndouble CTransaction::ComputePriority(double dPriorityInputs, unsigned int nTxSize) const\n{\n \/\/ In order to avoid disincentivizing cleaning up the UTXO set we don't count\n \/\/ the constant overhead for each txin and up to 110 bytes of scriptSig (which\n \/\/ is enough to cover a compressed pubkey p2sh redemption) for priority.\n \/\/ Providing any more cleanup incentive than making additional inputs free would\n \/\/ risk encouraging people to create junk outputs to redeem later.\n if (nTxSize == 0)\n nTxSize = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);\n BOOST_FOREACH(const CTxIn& txin, vin)\n {\n unsigned int offset = 41U + std::min(110U, (unsigned int)txin.scriptSig.size());\n if (nTxSize > offset)\n nTxSize -= offset;\n }\n if (nTxSize == 0) return 0.0;\n return dPriorityInputs \/ nTxSize;\n}\n\nstd::string CTransaction::ToString() const\n{\n std::string str;\n str += strprintf(\"CTransaction(hash=%s, ver=%d, vin.size=%u, vout.size=%u, nLockTime=%u)\\n\",\n GetHash().ToString().substr(0,10),\n nVersion,\n vin.size(),\n vout.size(),\n nLockTime);\n for (unsigned int i = 0; i < vin.size(); i++)\n str += \" \" + vin[i].ToString() + \"\\n\";\n for (unsigned int i = 0; i < vout.size(); i++)\n str += \" \" + vout[i].ToString() + \"\\n\";\n return str;\n}\n\nvoid CTransaction::print() const\n{\n LogPrintf(\"%s\", ToString());\n}\n\n\/\/ Amount compression:\n\/\/ * If the amount is 0, output 0\n\/\/ * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)\n\/\/ * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)\n\/\/ * call the result n\n\/\/ * output 1 + 10*(9*n + d - 1) + e\n\/\/ * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9\n\/\/ (this is decodable, as d is in [1-9] and e is in [0-9])\n\nuint64_t CTxOutCompressor::CompressAmount(uint64_t n)\n{\n if (n == 0)\n return 0;\n int e = 0;\n while (((n % 10) == 0) && e < 9) {\n n \/= 10;\n e++;\n }\n if (e < 9) {\n int d = (n % 10);\n assert(d >= 1 && d <= 9);\n n \/= 10;\n return 1 + (n*9 + d - 1)*10 + e;\n } else {\n return 1 + (n - 1)*10 + 9;\n }\n}\n\nuint64_t CTxOutCompressor::DecompressAmount(uint64_t x)\n{\n \/\/ x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9\n if (x == 0)\n return 0;\n x--;\n \/\/ x = 10*(9*n + d - 1) + e\n int e = x % 10;\n x \/= 10;\n uint64_t n = 0;\n if (e < 9) {\n \/\/ x = 9*n + d - 1\n int d = (x % 9) + 1;\n x \/= 9;\n \/\/ x = n\n n = x*10 + d;\n } else {\n n = x+1;\n }\n while (e) {\n n *= 10;\n e--;\n }\n return n;\n}\n\/*uint256 CBlockHeader::GetHash() const\n{\n\tCChain a1;\n\tint nHeight= a1.Height();\n\t\/\/pblock->LastHeight = pindexPrev->nHeight;\n\tif (nHeight <=10){\n return HashX11(BEGIN(nVersion), END(nNonce));\n\t}\n else {\n\t return HashX17(BEGIN(nVersion), END(nNonce));\n\t}\n}*\/\n\nuint256 CBlockHeader::GetHashX11() const \n{\n return HashX11(BEGIN(nVersion), END(nNonce));\n}\n\nuint256 CBlock::BuildMerkleTree() const\n{\n vMerkleTree.clear();\n BOOST_FOREACH(const CTransaction& tx, vtx)\n vMerkleTree.push_back(tx.GetHash());\n int j = 0;\n for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) \/ 2)\n {\n for (int i = 0; i < nSize; i += 2)\n {\n int i2 = std::min(i+1, nSize-1);\n vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),\n BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));\n }\n j += nSize;\n }\n return (vMerkleTree.empty() ? 0 : vMerkleTree.back());\n}\n\nstd::vector<uint256> CBlock::GetMerkleBranch(int nIndex) const\n{\n if (vMerkleTree.empty())\n BuildMerkleTree();\n std::vector<uint256> vMerkleBranch;\n int j = 0;\n for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) \/ 2)\n {\n int i = std::min(nIndex^1, nSize-1);\n vMerkleBranch.push_back(vMerkleTree[j+i]);\n nIndex >>= 1;\n j += nSize;\n }\n return vMerkleBranch;\n}\n\nuint256 CBlock::CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)\n{\n if (nIndex == -1)\n return 0;\n BOOST_FOREACH(const uint256& otherside, vMerkleBranch)\n {\n if (nIndex & 1)\n hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));\n else\n hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));\n nIndex >>= 1;\n }\n return hash;\n}\n\nvoid CBlock::print() const\n{\n\t\/\/GetHashX11().ToString(),\n LogPrintf(\"CBlock(hash=disable, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%u)\\n\",\n nVersion,\n hashPrevBlock.ToString(),\n hashMerkleRoot.ToString(),\n nTime, nBits, nNonce,\n vtx.size());\n for (unsigned int i = 0; i < vtx.size(); i++)\n {\n LogPrintf(\" \");\n vtx[i].print();\n }\n LogPrintf(\" vMerkleTree: \");\n for (unsigned int i = 0; i < vMerkleTree.size(); i++)\n LogPrintf(\"%s \", vMerkleTree[i].ToString());\n LogPrintf(\"\\n\");\n}\n<commit_msg>New way from line 229 to 36<commit_after>\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Bitsend developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"core.h\"\n#include \"util.h\"\n#include \"main.h\"\n#include \"uint256.h\"\n\nstd::string COutPoint::ToString() const\n{\n return strprintf(\"COutPoint(%s, %u)\", hash.ToString().substr(0,64), n);\n}\n\nvoid COutPoint::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nCTxIn::CTxIn(COutPoint prevoutIn, CScript scriptSigIn, unsigned int nSequenceIn)\n{\n prevout = prevoutIn;\n scriptSig = scriptSigIn;\n nSequence = nSequenceIn;\n}\n\nCTxIn::CTxIn(uint256 hashPrevTx, unsigned int nOut, CScript scriptSigIn, unsigned int nSequenceIn)\n{\n prevout = COutPoint(hashPrevTx, nOut);\n scriptSig = scriptSigIn;\n nSequence = nSequenceIn;\n}\n\nstd::string CTxIn::ToString() const\n{\n std::string str;\n str += \"CTxIn(\";\n str += prevout.ToString();\n if (prevout.IsNull())\n str += strprintf(\", coinbase %s\", HexStr(scriptSig));\n else\n str += strprintf(\", scriptSig=%s\", scriptSig.ToString().substr(0,24));\n if (nSequence != std::numeric_limits<unsigned int>::max())\n str += strprintf(\", nSequence=%u\", nSequence);\n str += \")\";\n return str;\n}\n\nvoid CTxIn::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nCTxOut::CTxOut(int64_t nValueIn, CScript scriptPubKeyIn)\n{\n nValue = nValueIn;\n nRounds = -10; \/\/ an initial value, should be no way to get this by calculations\n scriptPubKey = scriptPubKeyIn;\n}\n\nuint256 CTxOut::GetHash() const\n{\n return SerializeHash(*this);\n}\n\nstd::string CTxOut::ToString() const\n{\n return strprintf(\"CTxOut(nValue=%d.%08d, scriptPubKey=%s)\", nValue \/ COIN, nValue % COIN, scriptPubKey.ToString().substr(0,30));\n}\n\nvoid CTxOut::print() const\n{\n LogPrintf(\"%s\\n\", ToString());\n}\n\nuint256 CTransaction::GetHash() const\n{\n return SerializeHash(*this);\n}\n\nbool CTransaction::IsNewerThan(const CTransaction& old) const\n{\n if (vin.size() != old.vin.size())\n return false;\n for (unsigned int i = 0; i < vin.size(); i++)\n if (vin[i].prevout != old.vin[i].prevout)\n return false;\n\n bool fNewer = false;\n unsigned int nLowest = std::numeric_limits<unsigned int>::max();\n for (unsigned int i = 0; i < vin.size(); i++)\n {\n if (vin[i].nSequence != old.vin[i].nSequence)\n {\n if (vin[i].nSequence <= nLowest)\n {\n fNewer = false;\n nLowest = vin[i].nSequence;\n }\n if (old.vin[i].nSequence < nLowest)\n {\n fNewer = true;\n nLowest = old.vin[i].nSequence;\n }\n }\n }\n return fNewer;\n}\n\nint64_t CTransaction::GetValueOut() const\n{\n int64_t nValueOut = 0;\n BOOST_FOREACH(const CTxOut& txout, vout)\n {\n nValueOut += txout.nValue;\n if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))\n throw std::runtime_error(\"CTransaction::GetValueOut() : value out of range\");\n }\n return nValueOut;\n}\n\ndouble CTransaction::ComputePriority(double dPriorityInputs, unsigned int nTxSize) const\n{\n \/\/ In order to avoid disincentivizing cleaning up the UTXO set we don't count\n \/\/ the constant overhead for each txin and up to 110 bytes of scriptSig (which\n \/\/ is enough to cover a compressed pubkey p2sh redemption) for priority.\n \/\/ Providing any more cleanup incentive than making additional inputs free would\n \/\/ risk encouraging people to create junk outputs to redeem later.\n if (nTxSize == 0)\n nTxSize = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);\n BOOST_FOREACH(const CTxIn& txin, vin)\n {\n unsigned int offset = 41U + std::min(110U, (unsigned int)txin.scriptSig.size());\n if (nTxSize > offset)\n nTxSize -= offset;\n }\n if (nTxSize == 0) return 0.0;\n return dPriorityInputs \/ nTxSize;\n}\n\nstd::string CTransaction::ToString() const\n{\n std::string str;\n str += strprintf(\"CTransaction(hash=%s, ver=%d, vin.size=%u, vout.size=%u, nLockTime=%u)\\n\",\n GetHash().ToString().substr(0,10),\n nVersion,\n vin.size(),\n vout.size(),\n nLockTime);\n for (unsigned int i = 0; i < vin.size(); i++)\n str += \" \" + vin[i].ToString() + \"\\n\";\n for (unsigned int i = 0; i < vout.size(); i++)\n str += \" \" + vout[i].ToString() + \"\\n\";\n return str;\n}\n\nvoid CTransaction::print() const\n{\n LogPrintf(\"%s\", ToString());\n}\n\n\/\/ Amount compression:\n\/\/ * If the amount is 0, output 0\n\/\/ * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)\n\/\/ * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)\n\/\/ * call the result n\n\/\/ * output 1 + 10*(9*n + d - 1) + e\n\/\/ * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9\n\/\/ (this is decodable, as d is in [1-9] and e is in [0-9])\n\nuint64_t CTxOutCompressor::CompressAmount(uint64_t n)\n{\n if (n == 0)\n return 0;\n int e = 0;\n while (((n % 10) == 0) && e < 9) {\n n \/= 10;\n e++;\n }\n if (e < 9) {\n int d = (n % 10);\n assert(d >= 1 && d <= 9);\n n \/= 10;\n return 1 + (n*9 + d - 1)*10 + e;\n } else {\n return 1 + (n - 1)*10 + 9;\n }\n}\n\nuint64_t CTxOutCompressor::DecompressAmount(uint64_t x)\n{\n \/\/ x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9\n if (x == 0)\n return 0;\n x--;\n \/\/ x = 10*(9*n + d - 1) + e\n int e = x % 10;\n x \/= 10;\n uint64_t n = 0;\n if (e < 9) {\n \/\/ x = 9*n + d - 1\n int d = (x % 9) + 1;\n x \/= 9;\n \/\/ x = n\n n = x*10 + d;\n } else {\n n = x+1;\n }\n while (e) {\n n *= 10;\n e--;\n }\n return n;\n}\n\/*uint256 CBlockHeader::GetHash() const\n{\n\tCChain a1;\n\tint nHeight= a1.Height();\n\t\/\/pblock->LastHeight = pindexPrev->nHeight;\n\tif (nHeight <=10){\n return HashX11(BEGIN(nVersion), END(nNonce));\n\t}\n else {\n\t return HashX17(BEGIN(nVersion), END(nNonce));\n\t}\n}*\/\n\/*uint256 CBlockHeader::GetHash() const{ \n\tif (LastHeight>=15){\n return HashX11(BEGIN(nVersion), END(nNonce));\n\t}\n else {\n\t return HashX17(BEGIN(nVersion), END(nNonce));\n\t}\n }*\/\n\nuint256 CBlockHeader::GetHashX11() const \n{\n return HashX11(BEGIN(nVersion), END(nNonce));\n}\n\nuint256 CBlock::BuildMerkleTree() const\n{\n vMerkleTree.clear();\n BOOST_FOREACH(const CTransaction& tx, vtx)\n vMerkleTree.push_back(tx.GetHash());\n int j = 0;\n for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) \/ 2)\n {\n for (int i = 0; i < nSize; i += 2)\n {\n int i2 = std::min(i+1, nSize-1);\n vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),\n BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));\n }\n j += nSize;\n }\n return (vMerkleTree.empty() ? 0 : vMerkleTree.back());\n}\n\nstd::vector<uint256> CBlock::GetMerkleBranch(int nIndex) const\n{\n if (vMerkleTree.empty())\n BuildMerkleTree();\n std::vector<uint256> vMerkleBranch;\n int j = 0;\n for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) \/ 2)\n {\n int i = std::min(nIndex^1, nSize-1);\n vMerkleBranch.push_back(vMerkleTree[j+i]);\n nIndex >>= 1;\n j += nSize;\n }\n return vMerkleBranch;\n}\n\nuint256 CBlock::CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)\n{\n if (nIndex == -1)\n return 0;\n BOOST_FOREACH(const uint256& otherside, vMerkleBranch)\n {\n if (nIndex & 1)\n hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));\n else\n hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));\n nIndex >>= 1;\n }\n return hash;\n}\n\nvoid CBlock::print() const\n{\n\t\/\/GetHashX11().ToString(),\n LogPrintf(\"CBlock(hash=disable, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%u)\\n\",\n nVersion,\n hashPrevBlock.ToString(),\n hashMerkleRoot.ToString(),\n nTime, nBits, nNonce,\n vtx.size());\n for (unsigned int i = 0; i < vtx.size(); i++)\n {\n LogPrintf(\" \");\n vtx[i].print();\n }\n LogPrintf(\" vMerkleTree: \");\n for (unsigned int i = 0; i < vMerkleTree.size(); i++)\n LogPrintf(\"%s \", vMerkleTree[i].ToString());\n LogPrintf(\"\\n\");\n}\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE Main\n#include <boost\/test\/unit_test.hpp>\n\n#include <meas.h>\n#include <storage.h>\n#include <string>\n#include <thread>\n\nconst size_t copies_count = 100;\nvoid checkAll(memseries::Meas::MeasList res, std::string msg, memseries::Time from, memseries::Time to, memseries::Time step) {\n\tfor (auto i = from; i < to; i += step) {\n\t\tsize_t count = 0;\n\t\tfor (auto &m : res) {\n\t\t\tif ((m.id == i) && (m.flag == i) && (m.time == i)) {\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\tif (count != copies_count) {\n\t\t\tBOOST_CHECK_EQUAL(copies_count, count);\n\t\t}\n\t}\n}\n\nvoid storage_test_check(memseries::storage::AbstractStorage *as, memseries::Time from, memseries::Time to, memseries::Time step) {\n\tauto m = memseries::Meas::empty();\n\tsize_t total_count = 0;\n\n\tfor (auto i = from; i < to; i += step) {\n\t\tm.id = i;\n\t\tm.flag = i;\n\t\tm.time = i;\n\t\tm.value = 0;\n\t\tfor (size_t j = 0; j < copies_count; j++) {\n\t\t\tBOOST_CHECK(as->append(m).writed == 1);\n\t\t\ttotal_count++;\n\t\t\tm.value = j;\n\t\t}\n\t}\n\n\tmemseries::Meas::MeasList all{};\n\tas->readInterval(from, to)->readAll(&all);\n\tBOOST_CHECK_EQUAL(all.size(), total_count);\n\n\tcheckAll(all, \"readAll error: \", from, to, step);\n\n\tmemseries::IdArray ids{};\n\tall.clear();\n\tas->readInterval(ids, 0, from, to)->readAll(&all);\n\tBOOST_CHECK_EQUAL(all.size(), total_count);\n\n\tcheckAll(all, \"read error: \", from, to, step);\n\n\tids.push_back(from + step);\n\tmemseries::Meas::MeasList fltr_res{};\n\tas->readInterval(ids, 0, from, to)->readAll(&fltr_res);\n\n\tBOOST_CHECK_EQUAL(fltr_res.size(), copies_count);\n\n\tBOOST_CHECK_EQUAL(fltr_res.front().id, ids[0]);\n\n\tfltr_res.clear();\n\tas->readInterval(ids, to + 1, from, to)->readAll(&fltr_res);\n\tBOOST_CHECK_EQUAL(fltr_res.size(), size_t(0));\n\n\tall.clear();\n\tas->readInTimePoint(to)->readAll(&all);\n\t\/\/TODO ==(to-from)\/step\n\tBOOST_CHECK_EQUAL(all.size(), total_count);\n\n\tcheckAll(all, \"TimePoint error: \", from, to, step);\n\n\n\tmemseries::IdArray emptyIDs{};\n\tfltr_res.clear();\n\tas->readInTimePoint(to)->readAll(&fltr_res);\n\tBOOST_CHECK_EQUAL(fltr_res.size(), total_count);\n\n\tcheckAll(all, \"TimePointFltr error: \", from, to, step);\n\n\tauto magicFlag = memseries::Flag(from + step);\n\tfltr_res.clear();\n\tas->readInTimePoint(emptyIDs, magicFlag, to)->readAll(&fltr_res);\n\tBOOST_CHECK_EQUAL(fltr_res.size(), copies_count);\n\n\tBOOST_CHECK_EQUAL(fltr_res.front().flag, magicFlag);\n}\n\n\nBOOST_AUTO_TEST_CASE(inFilter) {\n\t{\n\t\tBOOST_CHECK(memseries::in_filter(0, 100));\n\t\tBOOST_CHECK(!memseries::in_filter(1, 100));\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(MemoryStorage) {\n\t{\n\t\tauto ms = new memseries::storage::MemoryStorage{ 500 };\n\t\tconst memseries::Time from = 0;\n\t\tconst memseries::Time to = 100;\n\t\tconst memseries::Time step = 2;\n\t\tstorage_test_check(ms, from, to, step);\n\t\tBOOST_CHECK_EQUAL(ms->chinks_size(), (to - from) \/ step); \/\/ id per chunk.\n\t\tdelete ms;\n\t}\n}\n\nvoid thread_writer(memseries::Id id, memseries::Time from, memseries::Time to, memseries::Time step, memseries::storage::MemoryStorage *ms)\n{\n\tauto m = memseries::Meas::empty();\n\tfor (auto i = from; i < to; i += step) {\n\t\tm.id = id;\n\t\tm.flag = i;\n\t\tm.time = i;\n\t\tm.value = 0;\n\t\tfor (size_t j = 0; j < copies_count; j++) {\n\t\t\tms->append(m);\n\t\t\tm.value = j;\n\t\t}\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(MultiThread)\n{\n\tauto ms = new memseries::storage::MemoryStorage{ 500 };\n\tstd::thread t1(thread_writer, 0, 0, 100, 2, ms);\n\tstd::thread t2(thread_writer, 1, 0, 100, 2, ms);\n\tstd::thread t3(thread_writer, 2, 0, 100, 2, ms);\n\tstd::thread t4(thread_writer, 3, 0, 100, 2, ms);\n\n\tt1.join();\n\tt2.join();\n\tt3.join();\n\tt4.join();\n\tdelete ms;\n}\n\nBOOST_AUTO_TEST_CASE(ReadInterval)\n{\n\tauto ds = new memseries::storage::MemoryStorage{ 500 };\n\tmemseries::Meas m;\n\t{\n\t\tm.id = 1; m.time = 1;\n\t\tds->append(m);\n\t\tm.id = 2; m.time = 2;\n\t\tds->append(m);\n\n\t\tm.id = 4; m.time = 4;\n\t\tds->append(m);\n\t\tm.id = 5; m.time = 5;\n\t\tds->append(m);\n\t\tm.id = 55; m.time = 5;\n\t\tds->append(m);\n\n\t\t{\n\t\t\tauto tp_reader = ds->readInTimePoint(6);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(5));\n\t\t}\n\t\t{\n\n\t\t\tauto tp_reader = ds->readInTimePoint(3);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(2));\n\t\t\tfor (auto v : output_in_point) {\n\t\t\t\tBOOST_CHECK(v.time <= 3);\n\t\t\t}\n\t\t}\n\t\tauto reader = ds->readInterval(3, 5);\n\t\tmemseries::Meas::MeasList output{};\n\t\treader->readAll(&output);\n\t\tBOOST_CHECK_EQUAL(output.size(), size_t(5));\n\t}\n\t{\n\t\tm.id = 1; m.time = 6;\n\t\tds->append(m);\n\t\tm.id = 2; m.time = 7;\n\t\tds->append(m);\n\n\t\tm.id = 4; m.time = 9;\n\t\tds->append(m);\n\t\tm.id = 5; m.time = 10;\n\t\tds->append(m);\n\t\tm.id = 6; m.time = 10;\n\t\tds->append(m);\n\t\t{\n\n\t\t\tauto tp_reader = ds->readInTimePoint(8);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(5));\n\t\t\tfor (auto v : output_in_point) {\n\t\t\t\tBOOST_CHECK(v.time <= 8);\n\t\t\t}\n\t\t}\n\n\t\tauto reader = ds->readInterval(memseries::IdArray{ 1,2,4,5,55 }, 0, 8, 10);\n\t\tmemseries::Meas::MeasList output{};\n\t\treader->readAll(&output);\n\t\tBOOST_CHECK_EQUAL(output.size(), size_t(7));\n\t}\n\tdelete ds;\n}<commit_msg>tests.<commit_after>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE Main\n#include <boost\/test\/unit_test.hpp>\n\n#include <meas.h>\n#include <storage.h>\n#include <string>\n#include <thread>\n\nconst size_t copies_count = 100;\n\nvoid checkAll(memseries::Meas::MeasList res, std::string msg, memseries::Time from, memseries::Time to, memseries::Time step) {\n\tfor (auto i = from; i < to; i += step) {\n\t\tsize_t count = 0;\n\t\tfor (auto &m : res) {\n\t\t\tif ((m.id == i) && (m.flag == i) && (m.time == i)) {\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t}\n\t\tif (count < copies_count) {\n\t\t\tBOOST_CHECK_EQUAL(copies_count, count);\n\t\t}\n\t}\n}\n\nvoid storage_test_check(memseries::storage::AbstractStorage *as, memseries::Time from, memseries::Time to, memseries::Time step) {\n\tauto m = memseries::Meas::empty();\n\tsize_t total_count = 0;\n\n\tfor (auto i = from; i < to; i += step) {\n\t\tm.id = i;\n\t\tm.flag = i;\n\t\tm.time = i;\n\t\tm.value = 0;\n\t\tfor (size_t j = 1; j < copies_count+1; j++) {\n\t\t\tBOOST_CHECK(as->append(m).writed == 1);\n\t\t\ttotal_count++;\n\t\t\tm.value = j;\n\t\t}\n\t}\n\n\tmemseries::Meas::MeasList all{};\n\tas->readInterval(from, to)->readAll(&all);\n\tBOOST_CHECK_EQUAL(all.size(), total_count+1); \/\/ [_from,to, by step] + 1 from timePoint=0 (meas with time=0.).\n\n\tcheckAll(all, \"readAll error: \", from, to, step);\n\n\tmemseries::IdArray ids{};\n\tall.clear();\n\tas->readInterval(ids, 0, from, to)->readAll(&all);\n\tBOOST_CHECK_EQUAL(all.size(), total_count+1);\n\n\tcheckAll(all, \"read error: \", from, to, step);\n\n\tids.push_back(from + step);\n\tmemseries::Meas::MeasList fltr_res{};\n\tas->readInterval(ids, 0, from, to)->readAll(&fltr_res);\n\n\tBOOST_CHECK_EQUAL(fltr_res.size(), copies_count);\n\n\tBOOST_CHECK_EQUAL(fltr_res.front().id, ids[0]);\n\n\tfltr_res.clear();\n\tas->readInterval(ids, to + 1, from, to)->readAll(&fltr_res);\n\tBOOST_CHECK_EQUAL(fltr_res.size(), size_t(0));\n\n\tall.clear();\n\tas->readInTimePoint(to)->readAll(&all);\n\tsize_t ids_count = (to - from) \/ step;\n\t\/\/TODO ==(to-from)\/step\n\tBOOST_CHECK_EQUAL(all.size(), ids_count);\n\n\tmemseries::IdArray emptyIDs{};\n\tfltr_res.clear();\n\tas->readInTimePoint(to)->readAll(&fltr_res);\n\tBOOST_CHECK_EQUAL(fltr_res.size(), ids_count);\n}\n\n\nBOOST_AUTO_TEST_CASE(inFilter) {\n\t{\n\t\tBOOST_CHECK(memseries::in_filter(0, 100));\n\t\tBOOST_CHECK(!memseries::in_filter(1, 100));\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(MemoryStorage) {\n\t{\n\t\tauto ms = new memseries::storage::MemoryStorage{ 500 };\n\t\tconst memseries::Time from = 0;\n\t\tconst memseries::Time to = 100;\n\t\tconst memseries::Time step = 2;\n\t\tstorage_test_check(ms, from, to, step);\n\t\tBOOST_CHECK_EQUAL(ms->chinks_size(), (to - from) \/ step); \/\/ id per chunk.\n\t\tdelete ms;\n\t}\n}\n\nvoid thread_writer(memseries::Id id, memseries::Time from, memseries::Time to, memseries::Time step, memseries::storage::MemoryStorage *ms)\n{\n\tauto m = memseries::Meas::empty();\n\tfor (auto i = from; i < to; i += step) {\n\t\tm.id = id;\n\t\tm.flag = i;\n\t\tm.time = i;\n\t\tm.value = 0;\n\t\tfor (size_t j = 0; j < copies_count; j++) {\n\t\t\tms->append(m);\n\t\t\tm.value = j;\n\t\t}\n\t}\n}\n\nBOOST_AUTO_TEST_CASE(MultiThread)\n{\n\tauto ms = new memseries::storage::MemoryStorage{ 500 };\n\tstd::thread t1(thread_writer, 0, 0, 100, 2, ms);\n\tstd::thread t2(thread_writer, 1, 0, 100, 2, ms);\n\tstd::thread t3(thread_writer, 2, 0, 100, 2, ms);\n\tstd::thread t4(thread_writer, 3, 0, 100, 2, ms);\n\n\tt1.join();\n\tt2.join();\n\tt3.join();\n\tt4.join();\n\tdelete ms;\n}\n\nBOOST_AUTO_TEST_CASE(ReadInterval)\n{\n\tauto ds = new memseries::storage::MemoryStorage{ 500 };\n\tmemseries::Meas m;\n\t{\n\t\tm.id = 1; m.time = 1;\n\t\tds->append(m);\n\t\tm.id = 2; m.time = 2;\n\t\tds->append(m);\n\n\t\tm.id = 4; m.time = 4;\n\t\tds->append(m);\n\t\tm.id = 5; m.time = 5;\n\t\tds->append(m);\n\t\tm.id = 55; m.time = 5;\n\t\tds->append(m);\n\n\t\t{\n\t\t\tauto tp_reader = ds->readInTimePoint(6);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(5));\n\t\t}\n\t\t{\n\n\t\t\tauto tp_reader = ds->readInTimePoint(3);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(2));\n\t\t\tfor (auto v : output_in_point) {\n\t\t\t\tBOOST_CHECK(v.time <= 3);\n\t\t\t}\n\t\t}\n\t\tauto reader = ds->readInterval(3, 5);\n\t\tmemseries::Meas::MeasList output{};\n\t\treader->readAll(&output);\n\t\tBOOST_CHECK_EQUAL(output.size(), size_t(5));\n\t}\n\t{\n\t\tm.id = 1; m.time = 6;\n\t\tds->append(m);\n\t\tm.id = 2; m.time = 7;\n\t\tds->append(m);\n\n\t\tm.id = 4; m.time = 9;\n\t\tds->append(m);\n\t\tm.id = 5; m.time = 10;\n\t\tds->append(m);\n\t\tm.id = 6; m.time = 10;\n\t\tds->append(m);\n\t\t{\n\n\t\t\tauto tp_reader = ds->readInTimePoint(8);\n\t\t\tmemseries::Meas::MeasList output_in_point{};\n\t\t\ttp_reader->readAll(&output_in_point);\n\n\t\t\tBOOST_CHECK_EQUAL(output_in_point.size(), size_t(5));\n\t\t\tfor (auto v : output_in_point) {\n\t\t\t\tBOOST_CHECK(v.time <= 8);\n\t\t\t}\n\t\t}\n\n\t\tauto reader = ds->readInterval(memseries::IdArray{ 1,2,4,5,55 }, 0, 8, 10);\n\t\tmemseries::Meas::MeasList output{};\n\t\treader->readAll(&output);\n\t\tBOOST_CHECK_EQUAL(output.size(), size_t(7));\n\t}\n\tdelete ds;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/message_pump_glib.h\"\n\n#include <fcntl.h>\n#include <math.h>\n\n#include <gtk\/gtk.h>\n#include <glib.h>\n\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/logging.h\"\n#include \"base\/platform_thread.h\"\n\nnamespace {\n\n\/\/ We send a byte across a pipe to wakeup the event loop.\nconst char kWorkScheduled = '\\0';\n\n\/\/ Return a timeout suitable for the glib loop, -1 to block forever,\n\/\/ 0 to return right away, or a timeout in milliseconds from now.\nint GetTimeIntervalMilliseconds(base::Time from) {\n if (from.is_null())\n return -1;\n\n \/\/ Be careful here. TimeDelta has a precision of microseconds, but we want a\n \/\/ value in milliseconds. If there are 5.5ms left, should the delay be 5 or\n \/\/ 6? It should be 6 to avoid executing delayed work too early.\n int delay = static_cast<int>(\n ceil((from - base::Time::Now()).InMillisecondsF()));\n\n \/\/ If this value is negative, then we need to run delayed work soon.\n return delay < 0 ? 0 : delay;\n}\n\n\/\/ A brief refresher on GLib:\n\/\/ GLib sources have four callbacks: Prepare, Check, Dispatch and Finalize.\n\/\/ On each iteration of the GLib pump, it calls each source's Prepare function.\n\/\/ This function should return TRUE if it wants GLib to call its Dispatch, and\n\/\/ FALSE otherwise. It can also set a timeout in this case for the next time\n\/\/ Prepare should be called again (it may be called sooner).\n\/\/ After the Prepare calls, GLib does a poll to check for events from the\n\/\/ system. File descriptors can be attached to the sources. The poll may block\n\/\/ if none of the Prepare calls returned TRUE. It will block indefinitely, or\n\/\/ by the minimum time returned by a source in Prepare.\n\/\/ After the poll, GLib calls Check for each source that returned FALSE\n\/\/ from Prepare. The return value of Check has the same meaning as for Prepare,\n\/\/ making Check a second chance to tell GLib we are ready for Dispatch.\n\/\/ Finally, GLib calls Dispatch for each source that is ready. If Dispatch\n\/\/ returns FALSE, GLib will destroy the source. Dispatch calls may be recursive\n\/\/ (i.e., you can call Run from them), but Prepare and Check cannot.\n\/\/ Finalize is called when the source is destroyed.\n\/\/ NOTE: It is common for subsytems to want to process pending events while\n\/\/ doing intensive work, for example the flash plugin. They usually use the\n\/\/ following pattern (recommended by the GTK docs):\n\/\/ while (gtk_events_pending()) {\n\/\/ gtk_main_iteration();\n\/\/ }\n\/\/\n\/\/ gtk_events_pending just calls g_main_context_pending, which does the\n\/\/ following:\n\/\/ - Call prepare on all the sources.\n\/\/ - Do the poll with a timeout of 0 (not blocking).\n\/\/ - Call check on all the sources.\n\/\/ - *Does not* call dispatch on the sources.\n\/\/ - Return true if any of prepare() or check() returned true.\n\/\/\n\/\/ gtk_main_iteration just calls g_main_context_iteration, which does the whole\n\/\/ thing, respecting the timeout for the poll (and block, although it is\n\/\/ expected not to if gtk_events_pending returned true), and call dispatch.\n\/\/\n\/\/ Thus it is important to only return true from prepare or check if we\n\/\/ actually have events or work to do. We also need to make sure we keep\n\/\/ internal state consistent so that if prepare\/check return true when called\n\/\/ from gtk_events_pending, they will still return true when called right\n\/\/ after, from gtk_main_iteration.\n\/\/\n\/\/ For the GLib pump we try to follow the Windows UI pump model:\n\/\/ - Whenever we receive a wakeup event or the timer for delayed work expires,\n\/\/ we run DoWork and\/or DoDelayedWork. That part will also run in the other\n\/\/ event pumps.\n\/\/ - We also run DoWork, DoDelayedWork, and possibly DoIdleWork in the main\n\/\/ loop, around event handling.\n\nstruct WorkSource : public GSource {\n base::MessagePumpForUI* pump;\n};\n\ngboolean WorkSourcePrepare(GSource* source,\n gint* timeout_ms) {\n *timeout_ms = static_cast<WorkSource*>(source)->pump->HandlePrepare();\n \/\/ We always return FALSE, so that our timeout is honored. If we were\n \/\/ to return TRUE, the timeout would be considered to be 0 and the poll\n \/\/ would never block. Once the poll is finished, Check will be called.\n return FALSE;\n}\n\ngboolean WorkSourceCheck(GSource* source) {\n \/\/ Only return TRUE if Dispatch should be called.\n return static_cast<WorkSource*>(source)->pump->HandleCheck();\n}\n\ngboolean WorkSourceDispatch(GSource* source,\n GSourceFunc unused_func,\n gpointer unused_data) {\n\n static_cast<WorkSource*>(source)->pump->HandleDispatch();\n \/\/ Always return TRUE so our source stays registered.\n return TRUE;\n}\n\n\/\/ I wish these could be const, but g_source_new wants non-const.\nGSourceFuncs WorkSourceFuncs = {\n WorkSourcePrepare,\n WorkSourceCheck,\n WorkSourceDispatch,\n NULL\n};\n\n} \/\/ namespace\n\n\nnamespace base {\n\nMessagePumpForUI::MessagePumpForUI()\n : state_(NULL),\n context_(g_main_context_default()),\n wakeup_gpollfd_(new GPollFD) {\n \/\/ Create our wakeup pipe, which is used to flag when work was scheduled.\n int fds[2];\n CHECK(pipe(fds) == 0);\n wakeup_pipe_read_ = fds[0];\n wakeup_pipe_write_ = fds[1];\n wakeup_gpollfd_->fd = wakeup_pipe_read_;\n wakeup_gpollfd_->events = G_IO_IN;\n\n work_source_ = g_source_new(&WorkSourceFuncs, sizeof(WorkSource));\n static_cast<WorkSource*>(work_source_)->pump = this;\n g_source_add_poll(work_source_, wakeup_gpollfd_.get());\n \/\/ Use a low priority so that we let other events in the queue go first.\n g_source_set_priority(work_source_, G_PRIORITY_DEFAULT_IDLE);\n \/\/ This is needed to allow Run calls inside Dispatch.\n g_source_set_can_recurse(work_source_, TRUE);\n g_source_attach(work_source_, context_);\n gdk_event_handler_set(&EventDispatcher, this, NULL);\n}\n\nMessagePumpForUI::~MessagePumpForUI() {\n gdk_event_handler_set(reinterpret_cast<GdkEventFunc>(gtk_main_do_event),\n this, NULL);\n g_source_destroy(work_source_);\n g_source_unref(work_source_);\n close(wakeup_pipe_read_);\n close(wakeup_pipe_write_);\n}\n\nvoid MessagePumpForUI::RunWithDispatcher(Delegate* delegate,\n Dispatcher* dispatcher) {\n#ifndef NDEBUG\n \/\/ Make sure we only run this on one thread. GTK only has one message pump\n \/\/ so we can only have one UI loop per process.\n static PlatformThreadId thread_id = PlatformThread::CurrentId();\n DCHECK(thread_id == PlatformThread::CurrentId()) <<\n \"Running MessagePumpForUI on two different threads; \"\n \"this is unsupported by GLib!\";\n#endif\n\n RunState state;\n state.delegate = delegate;\n state.dispatcher = dispatcher;\n state.should_quit = false;\n state.run_depth = state_ ? state_->run_depth + 1 : 1;\n state.has_work = false;\n\n RunState* previous_state = state_;\n state_ = &state;\n\n \/\/ We really only do a single task for each iteration of the loop. If we\n \/\/ have done something, assume there is likely something more to do. This\n \/\/ will mean that we don't block on the message pump until there was nothing\n \/\/ more to do. We also set this to true to make sure not to block on the\n \/\/ first iteration of the loop, so RunAllPending() works correctly.\n bool more_work_is_plausible = true;\n\n \/\/ We run our own loop instead of using g_main_loop_quit in one of the\n \/\/ callbacks. This is so we only quit our own loops, and we don't quit\n \/\/ nested loops run by others. TODO(deanm): Is this what we want?\n for (;;) {\n \/\/ Don't block if we think we have more work to do.\n bool block = !more_work_is_plausible;\n\n \/\/ g_main_context_iteration returns true if events have been dispatched.\n more_work_is_plausible = g_main_context_iteration(context_, block);\n if (state_->should_quit)\n break;\n\n more_work_is_plausible |= state_->delegate->DoWork();\n if (state_->should_quit)\n break;\n\n more_work_is_plausible |=\n state_->delegate->DoDelayedWork(&delayed_work_time_);\n if (state_->should_quit)\n break;\n\n if (more_work_is_plausible)\n continue;\n\n more_work_is_plausible = state_->delegate->DoIdleWork();\n if (state_->should_quit)\n break;\n }\n\n state_ = previous_state;\n}\n\n\/\/ Return the timeout we want passed to poll.\nint MessagePumpForUI::HandlePrepare() {\n \/\/ We know we have work, but we haven't called HandleDispatch yet. Don't let\n \/\/ the pump block so that we can do some processing.\n if (state_->has_work)\n return 0;\n\n \/\/ We don't think we have work to do, but make sure not to block\n \/\/ longer than the next time we need to run delayed work.\n return GetTimeIntervalMilliseconds(delayed_work_time_);\n}\n\nbool MessagePumpForUI::HandleCheck() {\n \/\/ We should only ever have a single message on the wakeup pipe, since we\n \/\/ are only signaled when the queue went from empty to non-empty. The glib\n \/\/ poll will tell us whether there was data, so this read shouldn't block.\n if (wakeup_gpollfd_->revents & G_IO_IN) {\n char msg;\n if (HANDLE_EINTR(read(wakeup_pipe_read_, &msg, 1)) != 1 || msg != '!') {\n NOTREACHED() << \"Error reading from the wakeup pipe.\";\n }\n \/\/ Since we ate the message, we need to record that we have more work,\n \/\/ because HandleCheck() may be called without HandleDispatch being called\n \/\/ afterwards.\n state_->has_work = true;\n }\n\n if (state_->has_work)\n return true;\n\n if (GetTimeIntervalMilliseconds(delayed_work_time_) == 0) {\n \/\/ The timer has expired. That condition will stay true until we process\n \/\/ that delayed work, so we don't need to record this differently.\n return true;\n }\n\n return false;\n}\n\nvoid MessagePumpForUI::HandleDispatch() {\n state_->has_work = false;\n if (state_->delegate->DoWork()) {\n \/\/ NOTE: on Windows at this point we would call ScheduleWork (see\n \/\/ MessagePumpForUI::HandleWorkMessage in message_pump_win.cc). But here,\n \/\/ instead of posting a message on the wakeup pipe, we can avoid the\n \/\/ syscalls and just signal that we have more work.\n state_->has_work = true;\n }\n\n if (state_->should_quit)\n return;\n\n state_->delegate->DoDelayedWork(&delayed_work_time_);\n}\n\nvoid MessagePumpForUI::AddObserver(Observer* observer) {\n observers_.AddObserver(observer);\n}\n\nvoid MessagePumpForUI::RemoveObserver(Observer* observer) {\n observers_.RemoveObserver(observer);\n}\n\nvoid MessagePumpForUI::WillProcessEvent(GdkEvent* event) {\n FOR_EACH_OBSERVER(Observer, observers_, WillProcessEvent(event));\n}\n\nvoid MessagePumpForUI::DidProcessEvent(GdkEvent* event) {\n FOR_EACH_OBSERVER(Observer, observers_, DidProcessEvent(event));\n}\n\nvoid MessagePumpForUI::Quit() {\n if (state_) {\n state_->should_quit = true;\n } else {\n NOTREACHED() << \"Quit called outside Run!\";\n }\n}\n\nvoid MessagePumpForUI::ScheduleWork() {\n \/\/ This can be called on any thread, so we don't want to touch any state\n \/\/ variables as we would then need locks all over. This ensures that if\n \/\/ we are sleeping in a poll that we will wake up.\n char msg = '!';\n if (HANDLE_EINTR(write(wakeup_pipe_write_, &msg, 1)) != 1) {\n NOTREACHED() << \"Could not write to the UI message loop wakeup pipe!\";\n }\n}\n\nvoid MessagePumpForUI::ScheduleDelayedWork(const Time& delayed_work_time) {\n \/\/ We need to wake up the loop in case the poll timeout needs to be\n \/\/ adjusted. This will cause us to try to do work, but that's ok.\n delayed_work_time_ = delayed_work_time;\n ScheduleWork();\n}\n\n\/\/ static\nvoid MessagePumpForUI::EventDispatcher(GdkEvent* event, gpointer data) {\n MessagePumpForUI* message_pump = reinterpret_cast<MessagePumpForUI*>(data);\n\n message_pump->WillProcessEvent(event);\n if (message_pump->state_->dispatcher) {\n if (!message_pump->state_->dispatcher->Dispatch(event))\n message_pump->state_->should_quit = true;\n } else {\n gtk_main_do_event(event);\n }\n message_pump->DidProcessEvent(event);\n}\n\n} \/\/ namespace base\n<commit_msg>Changes message_pump_glib not to crash if run without corresponding run, or rather if run completes and another message comes through. This can happen during tests and the windows side explicitly allows this case to work.<commit_after>\/\/ Copyright (c) 2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/message_pump_glib.h\"\n\n#include <fcntl.h>\n#include <math.h>\n\n#include <gtk\/gtk.h>\n#include <glib.h>\n\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/logging.h\"\n#include \"base\/platform_thread.h\"\n\nnamespace {\n\n\/\/ We send a byte across a pipe to wakeup the event loop.\nconst char kWorkScheduled = '\\0';\n\n\/\/ Return a timeout suitable for the glib loop, -1 to block forever,\n\/\/ 0 to return right away, or a timeout in milliseconds from now.\nint GetTimeIntervalMilliseconds(base::Time from) {\n if (from.is_null())\n return -1;\n\n \/\/ Be careful here. TimeDelta has a precision of microseconds, but we want a\n \/\/ value in milliseconds. If there are 5.5ms left, should the delay be 5 or\n \/\/ 6? It should be 6 to avoid executing delayed work too early.\n int delay = static_cast<int>(\n ceil((from - base::Time::Now()).InMillisecondsF()));\n\n \/\/ If this value is negative, then we need to run delayed work soon.\n return delay < 0 ? 0 : delay;\n}\n\n\/\/ A brief refresher on GLib:\n\/\/ GLib sources have four callbacks: Prepare, Check, Dispatch and Finalize.\n\/\/ On each iteration of the GLib pump, it calls each source's Prepare function.\n\/\/ This function should return TRUE if it wants GLib to call its Dispatch, and\n\/\/ FALSE otherwise. It can also set a timeout in this case for the next time\n\/\/ Prepare should be called again (it may be called sooner).\n\/\/ After the Prepare calls, GLib does a poll to check for events from the\n\/\/ system. File descriptors can be attached to the sources. The poll may block\n\/\/ if none of the Prepare calls returned TRUE. It will block indefinitely, or\n\/\/ by the minimum time returned by a source in Prepare.\n\/\/ After the poll, GLib calls Check for each source that returned FALSE\n\/\/ from Prepare. The return value of Check has the same meaning as for Prepare,\n\/\/ making Check a second chance to tell GLib we are ready for Dispatch.\n\/\/ Finally, GLib calls Dispatch for each source that is ready. If Dispatch\n\/\/ returns FALSE, GLib will destroy the source. Dispatch calls may be recursive\n\/\/ (i.e., you can call Run from them), but Prepare and Check cannot.\n\/\/ Finalize is called when the source is destroyed.\n\/\/ NOTE: It is common for subsytems to want to process pending events while\n\/\/ doing intensive work, for example the flash plugin. They usually use the\n\/\/ following pattern (recommended by the GTK docs):\n\/\/ while (gtk_events_pending()) {\n\/\/ gtk_main_iteration();\n\/\/ }\n\/\/\n\/\/ gtk_events_pending just calls g_main_context_pending, which does the\n\/\/ following:\n\/\/ - Call prepare on all the sources.\n\/\/ - Do the poll with a timeout of 0 (not blocking).\n\/\/ - Call check on all the sources.\n\/\/ - *Does not* call dispatch on the sources.\n\/\/ - Return true if any of prepare() or check() returned true.\n\/\/\n\/\/ gtk_main_iteration just calls g_main_context_iteration, which does the whole\n\/\/ thing, respecting the timeout for the poll (and block, although it is\n\/\/ expected not to if gtk_events_pending returned true), and call dispatch.\n\/\/\n\/\/ Thus it is important to only return true from prepare or check if we\n\/\/ actually have events or work to do. We also need to make sure we keep\n\/\/ internal state consistent so that if prepare\/check return true when called\n\/\/ from gtk_events_pending, they will still return true when called right\n\/\/ after, from gtk_main_iteration.\n\/\/\n\/\/ For the GLib pump we try to follow the Windows UI pump model:\n\/\/ - Whenever we receive a wakeup event or the timer for delayed work expires,\n\/\/ we run DoWork and\/or DoDelayedWork. That part will also run in the other\n\/\/ event pumps.\n\/\/ - We also run DoWork, DoDelayedWork, and possibly DoIdleWork in the main\n\/\/ loop, around event handling.\n\nstruct WorkSource : public GSource {\n base::MessagePumpForUI* pump;\n};\n\ngboolean WorkSourcePrepare(GSource* source,\n gint* timeout_ms) {\n *timeout_ms = static_cast<WorkSource*>(source)->pump->HandlePrepare();\n \/\/ We always return FALSE, so that our timeout is honored. If we were\n \/\/ to return TRUE, the timeout would be considered to be 0 and the poll\n \/\/ would never block. Once the poll is finished, Check will be called.\n return FALSE;\n}\n\ngboolean WorkSourceCheck(GSource* source) {\n \/\/ Only return TRUE if Dispatch should be called.\n return static_cast<WorkSource*>(source)->pump->HandleCheck();\n}\n\ngboolean WorkSourceDispatch(GSource* source,\n GSourceFunc unused_func,\n gpointer unused_data) {\n\n static_cast<WorkSource*>(source)->pump->HandleDispatch();\n \/\/ Always return TRUE so our source stays registered.\n return TRUE;\n}\n\n\/\/ I wish these could be const, but g_source_new wants non-const.\nGSourceFuncs WorkSourceFuncs = {\n WorkSourcePrepare,\n WorkSourceCheck,\n WorkSourceDispatch,\n NULL\n};\n\n} \/\/ namespace\n\n\nnamespace base {\n\nMessagePumpForUI::MessagePumpForUI()\n : state_(NULL),\n context_(g_main_context_default()),\n wakeup_gpollfd_(new GPollFD) {\n \/\/ Create our wakeup pipe, which is used to flag when work was scheduled.\n int fds[2];\n CHECK(pipe(fds) == 0);\n wakeup_pipe_read_ = fds[0];\n wakeup_pipe_write_ = fds[1];\n wakeup_gpollfd_->fd = wakeup_pipe_read_;\n wakeup_gpollfd_->events = G_IO_IN;\n\n work_source_ = g_source_new(&WorkSourceFuncs, sizeof(WorkSource));\n static_cast<WorkSource*>(work_source_)->pump = this;\n g_source_add_poll(work_source_, wakeup_gpollfd_.get());\n \/\/ Use a low priority so that we let other events in the queue go first.\n g_source_set_priority(work_source_, G_PRIORITY_DEFAULT_IDLE);\n \/\/ This is needed to allow Run calls inside Dispatch.\n g_source_set_can_recurse(work_source_, TRUE);\n g_source_attach(work_source_, context_);\n gdk_event_handler_set(&EventDispatcher, this, NULL);\n}\n\nMessagePumpForUI::~MessagePumpForUI() {\n gdk_event_handler_set(reinterpret_cast<GdkEventFunc>(gtk_main_do_event),\n this, NULL);\n g_source_destroy(work_source_);\n g_source_unref(work_source_);\n close(wakeup_pipe_read_);\n close(wakeup_pipe_write_);\n}\n\nvoid MessagePumpForUI::RunWithDispatcher(Delegate* delegate,\n Dispatcher* dispatcher) {\n#ifndef NDEBUG\n \/\/ Make sure we only run this on one thread. GTK only has one message pump\n \/\/ so we can only have one UI loop per process.\n static PlatformThreadId thread_id = PlatformThread::CurrentId();\n DCHECK(thread_id == PlatformThread::CurrentId()) <<\n \"Running MessagePumpForUI on two different threads; \"\n \"this is unsupported by GLib!\";\n#endif\n\n RunState state;\n state.delegate = delegate;\n state.dispatcher = dispatcher;\n state.should_quit = false;\n state.run_depth = state_ ? state_->run_depth + 1 : 1;\n state.has_work = false;\n\n RunState* previous_state = state_;\n state_ = &state;\n\n \/\/ We really only do a single task for each iteration of the loop. If we\n \/\/ have done something, assume there is likely something more to do. This\n \/\/ will mean that we don't block on the message pump until there was nothing\n \/\/ more to do. We also set this to true to make sure not to block on the\n \/\/ first iteration of the loop, so RunAllPending() works correctly.\n bool more_work_is_plausible = true;\n\n \/\/ We run our own loop instead of using g_main_loop_quit in one of the\n \/\/ callbacks. This is so we only quit our own loops, and we don't quit\n \/\/ nested loops run by others. TODO(deanm): Is this what we want?\n for (;;) {\n \/\/ Don't block if we think we have more work to do.\n bool block = !more_work_is_plausible;\n\n \/\/ g_main_context_iteration returns true if events have been dispatched.\n more_work_is_plausible = g_main_context_iteration(context_, block);\n if (state_->should_quit)\n break;\n\n more_work_is_plausible |= state_->delegate->DoWork();\n if (state_->should_quit)\n break;\n\n more_work_is_plausible |=\n state_->delegate->DoDelayedWork(&delayed_work_time_);\n if (state_->should_quit)\n break;\n\n if (more_work_is_plausible)\n continue;\n\n more_work_is_plausible = state_->delegate->DoIdleWork();\n if (state_->should_quit)\n break;\n }\n\n state_ = previous_state;\n}\n\n\/\/ Return the timeout we want passed to poll.\nint MessagePumpForUI::HandlePrepare() {\n \/\/ We know we have work, but we haven't called HandleDispatch yet. Don't let\n \/\/ the pump block so that we can do some processing.\n if (state_ && \/\/ state_ may be null during tests.\n state_->has_work)\n return 0;\n\n \/\/ We don't think we have work to do, but make sure not to block\n \/\/ longer than the next time we need to run delayed work.\n return GetTimeIntervalMilliseconds(delayed_work_time_);\n}\n\nbool MessagePumpForUI::HandleCheck() {\n if (!state_) \/\/ state_ may be null during tests.\n return false;\n\n \/\/ We should only ever have a single message on the wakeup pipe, since we\n \/\/ are only signaled when the queue went from empty to non-empty. The glib\n \/\/ poll will tell us whether there was data, so this read shouldn't block.\n if (wakeup_gpollfd_->revents & G_IO_IN) {\n char msg;\n if (HANDLE_EINTR(read(wakeup_pipe_read_, &msg, 1)) != 1 || msg != '!') {\n NOTREACHED() << \"Error reading from the wakeup pipe.\";\n }\n \/\/ Since we ate the message, we need to record that we have more work,\n \/\/ because HandleCheck() may be called without HandleDispatch being called\n \/\/ afterwards.\n state_->has_work = true;\n }\n\n if (state_->has_work)\n return true;\n\n if (GetTimeIntervalMilliseconds(delayed_work_time_) == 0) {\n \/\/ The timer has expired. That condition will stay true until we process\n \/\/ that delayed work, so we don't need to record this differently.\n return true;\n }\n\n return false;\n}\n\nvoid MessagePumpForUI::HandleDispatch() {\n state_->has_work = false;\n if (state_->delegate->DoWork()) {\n \/\/ NOTE: on Windows at this point we would call ScheduleWork (see\n \/\/ MessagePumpForUI::HandleWorkMessage in message_pump_win.cc). But here,\n \/\/ instead of posting a message on the wakeup pipe, we can avoid the\n \/\/ syscalls and just signal that we have more work.\n state_->has_work = true;\n }\n\n if (state_->should_quit)\n return;\n\n state_->delegate->DoDelayedWork(&delayed_work_time_);\n}\n\nvoid MessagePumpForUI::AddObserver(Observer* observer) {\n observers_.AddObserver(observer);\n}\n\nvoid MessagePumpForUI::RemoveObserver(Observer* observer) {\n observers_.RemoveObserver(observer);\n}\n\nvoid MessagePumpForUI::WillProcessEvent(GdkEvent* event) {\n FOR_EACH_OBSERVER(Observer, observers_, WillProcessEvent(event));\n}\n\nvoid MessagePumpForUI::DidProcessEvent(GdkEvent* event) {\n FOR_EACH_OBSERVER(Observer, observers_, DidProcessEvent(event));\n}\n\nvoid MessagePumpForUI::Quit() {\n if (state_) {\n state_->should_quit = true;\n } else {\n NOTREACHED() << \"Quit called outside Run!\";\n }\n}\n\nvoid MessagePumpForUI::ScheduleWork() {\n \/\/ This can be called on any thread, so we don't want to touch any state\n \/\/ variables as we would then need locks all over. This ensures that if\n \/\/ we are sleeping in a poll that we will wake up.\n char msg = '!';\n if (HANDLE_EINTR(write(wakeup_pipe_write_, &msg, 1)) != 1) {\n NOTREACHED() << \"Could not write to the UI message loop wakeup pipe!\";\n }\n}\n\nvoid MessagePumpForUI::ScheduleDelayedWork(const Time& delayed_work_time) {\n \/\/ We need to wake up the loop in case the poll timeout needs to be\n \/\/ adjusted. This will cause us to try to do work, but that's ok.\n delayed_work_time_ = delayed_work_time;\n ScheduleWork();\n}\n\n\/\/ static\nvoid MessagePumpForUI::EventDispatcher(GdkEvent* event, gpointer data) {\n MessagePumpForUI* message_pump = reinterpret_cast<MessagePumpForUI*>(data);\n\n message_pump->WillProcessEvent(event);\n if (message_pump->state_ && \/\/ state_ may be null during tests.\n message_pump->state_->dispatcher) {\n if (!message_pump->state_->dispatcher->Dispatch(event))\n message_pump->state_->should_quit = true;\n } else {\n gtk_main_do_event(event);\n }\n message_pump->DidProcessEvent(event);\n}\n\n} \/\/ namespace base\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <math.h>\n#include <string>\n#include <vector>\n#include \"mex.h\"\n\n#include <nix.hpp>\n\n#include \"handle.h\"\n#include \"arguments.h\"\n\n\/\/ *** datatype converter\n\ntemplate<typename T>\nstruct to_mx_class_id {\n\n static std::pair<mxClassID, mxComplexity> value() {\n nix::DataType dtype = nix::to_data_type<T>::value;\n switch (dtype) {\n case nix::DataType::Double:\n return std::make_pair(mxDOUBLE_CLASS, mxREAL);\n\n default:\n mexErrMsgIdAndTxt(\"nix:toclassid:notimplemented\", \"Implement me!\");\n return std::make_pair(mxVOID_CLASS, mxREAL);\n }\n }\n\n};\n\n\nmxArray* make_mx_array(const std::string &s)\n{\n return mxCreateString(s.c_str());\n}\n\ntemplate<typename T>\nmxArray* make_mx_array(const std::vector<T> &v) {\n std::pair<mxClassID, mxComplexity> klass = to_mx_class_id<T>::value();\n mxArray *data = mxCreateNumericMatrix(1, v.size(), klass.first, klass.second);\n double *ptr = mxGetPr(data);\n memcpy(ptr, v.data(), sizeof(T) * v.size());\n return data;\n}\n\ntemplate<>\nmxArray* make_mx_array(const std::vector<std::string> &v) {\n mxArray *data = mxCreateCellMatrix(1, v.size());\n for (size_t i = 0; i < v.size(); i++) {\n mxSetCell(data, i, mxCreateString(v[i].c_str()));\n }\n\n return data;\n}\n\n\/\/ *** functions ***\n\nstatic void entity_destory(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] entity_destory\\n\");\n handle h = input.hdl(1);\n h.destroy();\n}\n\nstatic void open_file(const extractor &input, infusor &output)\n{\n input.require_arguments({mxCHAR_CLASS, mxCHAR_CLASS}, true);\n mexPrintf(\"[+] open_file\\n\");\n\n std::string name = input.str(1);\n\n nix::File fn = nix::File::open(name, nix::FileMode::ReadWrite);\n handle h = handle(fn);\n\n output.set(0, h);\n}\n\nstatic void list_blocks(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_blocks\\n\");\n nix::File fd = input.entity<nix::File>(1);\n\n std::vector<nix::Block> blocks = fd.blocks();\n\n std::vector<const char *> fields = { \"name\", \"id\", \"type\" };\n\n mxArray *sa = mxCreateStructMatrix(blocks.size(), 1, fields.size(), fields.data());\n\n for (size_t n = 0; n < blocks.size(); n++) {\n mxSetFieldByNumber(sa, n, 0, make_mx_array(blocks[n].name()));\n mxSetFieldByNumber(sa, n, 1, make_mx_array(blocks[n].id()));\n mxSetFieldByNumber(sa, n, 2, make_mx_array(blocks[n].type()));\n }\n\n output.set(0, sa);\n}\n\nstatic void open_block(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n nix::File nf = input.entity<nix::File>(1);\n nix::Block block = nf.getBlock(input.str(2));\n handle bb = handle(block);\n output.set(0, bb);\n}\n\nstatic void open_data_array(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n nix::Block block = input.entity<nix::Block>(1);\n nix::DataArray da = block.getDataArray(input.str(2));\n handle bd = handle(da);\n output.set(0, bd);\n}\n\nstatic void block_list_data_arrays(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n\n nix::Block block = input.entity<nix::Block>(1);\n std::vector<nix::DataArray> arr = block.dataArrays();\n \n std::vector<const char *> fields = { \"name\", \"id\", \"type\" };\n\n mxArray *sa = mxCreateStructMatrix(arr.size(), 1, fields.size(), fields.data());\n\n for (size_t n = 0; n < arr.size(); n++) {\n mxSetFieldByNumber(sa, n, 0, make_mx_array(arr[n].name()));\n mxSetFieldByNumber(sa, n, 1, make_mx_array(arr[n].id()));\n mxSetFieldByNumber(sa, n, 2, make_mx_array(arr[n].type()));\n }\n\n output.set(0, sa);\n}\n\n\n\nstatic mxArray * ndsize_to_mxarray(const nix::NDSize &size)\n{\n mxArray *res = mxCreateNumericMatrix(1, size.size(), mxUINT64_CLASS, mxREAL);\n void *ptr = mxGetData(res);\n uint64_t *data = static_cast<uint64_t *>(ptr);\n\n for (size_t i = 0; i < size.size(); i++) {\n data[i] = static_cast<uint64_t>(size[i]);\n }\n\n return res;\n}\n\nstatic nix::NDSize mx_array_to_ndsize(const mxArray *arr) {\n\n size_t m = mxGetM(arr);\n size_t n = mxGetN(arr);\n\n \/\/if (m != 1 && n != 1)\n\n size_t k = std::max(n, m);\n nix::NDSize size(k);\n\n double *data = mxGetPr(arr);\n for (size_t i = 0; i < size.size(); i++) {\n size[i] = static_cast<nix::NDSize::value_type>(data[i]);\n }\n\n return size;\n}\n\nstatic mxArray *nmCreateScalar(uint32_t val) {\n mxArray *arr = mxCreateNumericMatrix(1, 1, mxUINT32_CLASS, mxREAL);\n void *data = mxGetData(arr);\n memcpy(data, &val, sizeof(uint32_t));\n return arr;\n}\n\nstatic mxArray *dim_to_struct(nix::SetDimension dim) {\n\n std::vector<const char *> fields = { \"type\", \"type_id\", \"labels\" };\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(\"set\"));\n mxSetFieldByNumber(sa, 0, 1, nmCreateScalar(1));\n\n std::vector<std::string> labels = dim.labels();\n mxSetFieldByNumber(sa, 0, 2, make_mx_array(labels));\n\n return sa;\n}\n\n\nstatic mxArray *dim_to_struct(nix::SampledDimension dim) {\n\n std::vector<const char *> fields = { \"type\", \"type_id\", \"interval\", \"label\", \"unit\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(\"sampled\"));\n mxSetFieldByNumber(sa, 0, 1, nmCreateScalar(2));\n mxSetFieldByNumber(sa, 0, 2, mxCreateDoubleScalar(dim.samplingInterval()));\n\n boost::optional<std::string> label = dim.label();\n if (label) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(label->c_str()));\n }\n\n boost::optional<std::string> unit = dim.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 4, mxCreateString(unit->c_str()));\n }\n\n return sa;\n}\n\nstatic mxArray *dim_to_struct(nix::RangeDimension dim) {\n\n std::vector<const char *> fields = { \"type\", \"type_id\", \"ticks\", \"unit\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(\"range\"));\n mxSetFieldByNumber(sa, 0, 1, nmCreateScalar(3));\n\n std::vector<double> ticks = dim.ticks();\n mxSetFieldByNumber(sa, 0, 2, make_mx_array(ticks));\n\n boost::optional<std::string> unit = dim.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(unit->c_str()));\n }\n\n return sa;\n}\n\nstatic void data_array_describe(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] block_describe_data_array\\n\");\n nix::DataArray da = input.entity<nix::DataArray>(1);\n\n std::vector<const char *> fields = { \"name\", \"id\", \"shape\", \"unit\", \"dimensions\", \"label\",\n \"polynom_coefficients\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(da.name().c_str()));\n mxSetFieldByNumber(sa, 0, 1, mxCreateString(da.id().c_str()));\n mxSetFieldByNumber(sa, 0, 2, ndsize_to_mxarray(da.dataExtent()));\n\n boost::optional<std::string> unit = da.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(unit->c_str()));\n }\n\n size_t ndims = da.dimensionCount();\n\n mxArray *dims = mxCreateCellMatrix(1, ndims);\n std::vector<nix::Dimension> da_dims = da.dimensions();\n\n for(size_t i = 0; i < ndims; i++) {\n mxArray *ca;\n\n switch(da_dims[i].dimensionType()) {\n case nix::DimensionType::Set:\n ca = dim_to_struct(da_dims[i].asSetDimension());\n break;\n case nix::DimensionType::Range:\n ca = dim_to_struct(da_dims[i].asRangeDimension());\n break;\n case nix::DimensionType::Sample:\n ca = dim_to_struct(da_dims[i].asSampledDimension());\n break;\n }\n\n\n mxSetCell(dims, i, ca);\n }\n\n mxSetFieldByNumber(sa, 0, 4, dims);\n\n\n boost::optional<std::string> label = da.label();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 5, mxCreateString(label->c_str()));\n }\n\n std::vector<double> pc = da.polynomCoefficients();\n\n if (!pc.empty()) {\n mxSetFieldByNumber(sa, 0, 6, make_mx_array(pc));\n }\n\n output.set(0, sa);\n}\n\nstatic void data_array_read_all(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] block_describe_data_array\\n\");\n nix::DataArray da = input.entity<nix::DataArray>(1);\n\n nix::NDSize size = da.dataExtent();\n std::vector<mwSize> dims(size.size());\n\n for (size_t i = 0; i < size.size(); i++) {\n dims[i] = static_cast<mwSize>(size[i]);\n }\n\n mxArray *data = mxCreateNumericArray(size.size(), dims.data(), mxDOUBLE_CLASS, mxREAL);\n double *ptr = mxGetPr(data);\n\n nix::NDSize offset(size.size(), 0);\n da.getData(nix::DataType::Double , ptr, size, offset);\n\n output.set(0, data);\n}\n\n\/\/ *** ***\n\ntypedef void (*fn_t)(const extractor &input, infusor &output);\n\nstruct fendpoint {\n\nfendpoint(std::string name, fn_t fn) : name(name), fn(fn) {}\n\n std::string name;\n fn_t fn;\n};\n\nconst std::vector<fendpoint> funcs = {\n {\"Entity::destroy\", entity_destory},\n {\"File::open\", open_file},\n {\"File::listBlocks\", list_blocks},\n {\"File::openBlock\", open_block},\n {\"Block::openDataArray\", open_data_array},\n {\"Block::listDataArrays\", block_list_data_arrays},\n {\"DataArray::describe\", data_array_describe},\n {\"DataArray::readAll\", data_array_read_all}\n};\n\n\/\/ main entry point\nvoid mexFunction(int nlhs,\n mxArray *lhs[],\n int nrhs,\n const mxArray *rhs[])\n{\n extractor input(rhs, nrhs);\n infusor output(lhs, nlhs);\n\n std::string cmd = input.str(0);\n\n mexPrintf(\"[F] %s\\n\", cmd.c_str());\n\n bool processed = false;\n for (const auto &fn : funcs) {\n if (fn.name == cmd) {\n try {\n fn.fn(input, output);\n } catch (std::exception &e) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", e.what());\n } catch (...) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", \"unkown exception\");\n }\n processed = true;\n break;\n }\n }\n\n if (!processed) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", \"Unkown command\");\n }\n}\n\n<commit_msg>Add struct_builder helper and start using it<commit_after>#include <iostream>\n#include <math.h>\n#include <string>\n#include <vector>\n#include \"mex.h\"\n\n#include <nix.hpp>\n\n#include \"handle.h\"\n#include \"arguments.h\"\n\n\/\/ *** datatype converter\n\ntemplate<typename T>\nstruct to_mx_class_id {\n\n static std::pair<mxClassID, mxComplexity> value() {\n nix::DataType dtype = nix::to_data_type<T>::value;\n switch (dtype) {\n case nix::DataType::Double:\n return std::make_pair(mxDOUBLE_CLASS, mxREAL);\n\n default:\n mexErrMsgIdAndTxt(\"nix:toclassid:notimplemented\", \"Implement me!\");\n return std::make_pair(mxVOID_CLASS, mxREAL);\n }\n }\n\n};\n\n\nmxArray* make_mx_array(const std::string &s)\n{\n return mxCreateString(s.c_str());\n}\n\n\nmxArray* make_mx_array(uint32_t val)\n{\n mxArray *arr = mxCreateNumericMatrix(1, 1, mxUINT32_CLASS, mxREAL);\n void *data = mxGetData(arr);\n memcpy(data, &val, sizeof(uint32_t));\n return arr;\n}\n\ntemplate<typename T>\nmxArray* make_mx_array(const std::vector<T> &v) {\n std::pair<mxClassID, mxComplexity> klass = to_mx_class_id<T>::value();\n mxArray *data = mxCreateNumericMatrix(1, v.size(), klass.first, klass.second);\n double *ptr = mxGetPr(data);\n memcpy(ptr, v.data(), sizeof(T) * v.size());\n return data;\n}\n\ntemplate<>\nmxArray* make_mx_array(const std::vector<std::string> &v) {\n mxArray *data = mxCreateCellMatrix(1, v.size());\n for (size_t i = 0; i < v.size(); i++) {\n mxSetCell(data, i, mxCreateString(v[i].c_str()));\n }\n\n return data;\n}\n\nstruct struct_builder {\n\n struct_builder(std::vector<size_t> dims, std::vector<const char *> f)\n : n(0), pos(0), fields(f) {\n sa = mxCreateStructArray(dims.size(), dims.data(), fields.size(), fields.data());\n }\n\n template<typename T>\n void set(T&& value) {\n set(pos++, std::forward<T>(value));\n }\n\n template<typename T>\n void set(const std::string &key, T&& value) {\n mxSetFieldByNumber(sa, n, pos++, std::forward<T>(value));\n }\n\n template<typename T>\n void set(const int field_idx, T&& value) {\n set(n, field_idx, std::forward<T>(value));\n }\n\n template<typename T>\n void set(const mwIndex struct_idx, const int field_idx, T&& value) {\n mxSetFieldByNumber(sa, struct_idx, field_idx, make_mx_array(std::forward<T>(value)));\n }\n\n mwIndex next() {\n pos = 0;\n return ++n;\n }\n\n int skip() {\n return ++pos;\n }\n\n mxArray *array() {\n return sa;\n }\n\nprivate:\n mxArray *sa;\n mwIndex n;\n int pos;\n\n std::vector<const char *> fields;\n};\n\n\/\/ *** functions ***\n\nstatic void entity_destory(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] entity_destory\\n\");\n handle h = input.hdl(1);\n h.destroy();\n}\n\nstatic void open_file(const extractor &input, infusor &output)\n{\n input.require_arguments({mxCHAR_CLASS, mxCHAR_CLASS}, true);\n mexPrintf(\"[+] open_file\\n\");\n\n std::string name = input.str(1);\n\n nix::File fn = nix::File::open(name, nix::FileMode::ReadWrite);\n handle h = handle(fn);\n\n output.set(0, h);\n}\n\nstatic void list_blocks(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_blocks\\n\");\n nix::File fd = input.entity<nix::File>(1);\n\n std::vector<nix::Block> blocks = fd.blocks();\n\n struct_builder sb({blocks.size()}, {\"name\", \"id\", \"type\"});\n\n for (const auto &b : blocks) {\n sb.set(b.name());\n sb.set(b.id());\n sb.set(b.type());\n\n sb.next();\n }\n\n output.set(0, sb.array());\n}\n\nstatic void open_block(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n nix::File nf = input.entity<nix::File>(1);\n nix::Block block = nf.getBlock(input.str(2));\n handle bb = handle(block);\n output.set(0, bb);\n}\n\nstatic void open_data_array(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n nix::Block block = input.entity<nix::Block>(1);\n nix::DataArray da = block.getDataArray(input.str(2));\n handle bd = handle(da);\n output.set(0, bd);\n}\n\nstatic void block_list_data_arrays(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] list_data_arrays\\n\");\n\n nix::Block block = input.entity<nix::Block>(1);\n std::vector<nix::DataArray> arr = block.dataArrays();\n\n struct_builder sb({arr.size()}, {\"name\", \"id\", \"type\"});\n\n for (const auto &da : arr) {\n sb.set(da.name());\n sb.set(da.id());\n sb.set(da.type());\n\n sb.next();\n }\n\n output.set(0, sb.array());\n}\n\n\n\nstatic mxArray * ndsize_to_mxarray(const nix::NDSize &size)\n{\n mxArray *res = mxCreateNumericMatrix(1, size.size(), mxUINT64_CLASS, mxREAL);\n void *ptr = mxGetData(res);\n uint64_t *data = static_cast<uint64_t *>(ptr);\n\n for (size_t i = 0; i < size.size(); i++) {\n data[i] = static_cast<uint64_t>(size[i]);\n }\n\n return res;\n}\n\nstatic nix::NDSize mx_array_to_ndsize(const mxArray *arr) {\n\n size_t m = mxGetM(arr);\n size_t n = mxGetN(arr);\n\n \/\/if (m != 1 && n != 1)\n\n size_t k = std::max(n, m);\n nix::NDSize size(k);\n\n double *data = mxGetPr(arr);\n for (size_t i = 0; i < size.size(); i++) {\n size[i] = static_cast<nix::NDSize::value_type>(data[i]);\n }\n\n return size;\n}\n\nstatic mxArray *nmCreateScalar(uint32_t val) {\n mxArray *arr = mxCreateNumericMatrix(1, 1, mxUINT32_CLASS, mxREAL);\n void *data = mxGetData(arr);\n memcpy(data, &val, sizeof(uint32_t));\n return arr;\n}\n\nstatic mxArray *dim_to_struct(nix::SetDimension dim) {\n\n struct_builder sb({1}, { \"type\", \"type_id\", \"labels\" });\n\n sb.set(\"set\");\n sb.set(1);\n sb.set(dim.labels());\n\n return sb.array();\n}\n\n\nstatic mxArray *dim_to_struct(nix::SampledDimension dim) {\n\n std::vector<const char *> fields = { \"type\", \"type_id\", \"interval\", \"label\", \"unit\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(\"sampled\"));\n mxSetFieldByNumber(sa, 0, 1, nmCreateScalar(2));\n mxSetFieldByNumber(sa, 0, 2, mxCreateDoubleScalar(dim.samplingInterval()));\n\n boost::optional<std::string> label = dim.label();\n if (label) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(label->c_str()));\n }\n\n boost::optional<std::string> unit = dim.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 4, mxCreateString(unit->c_str()));\n }\n\n return sa;\n}\n\nstatic mxArray *dim_to_struct(nix::RangeDimension dim) {\n\n std::vector<const char *> fields = { \"type\", \"type_id\", \"ticks\", \"unit\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(\"range\"));\n mxSetFieldByNumber(sa, 0, 1, nmCreateScalar(3));\n\n std::vector<double> ticks = dim.ticks();\n mxSetFieldByNumber(sa, 0, 2, make_mx_array(ticks));\n\n boost::optional<std::string> unit = dim.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(unit->c_str()));\n }\n\n return sa;\n}\n\nstatic void data_array_describe(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] block_describe_data_array\\n\");\n nix::DataArray da = input.entity<nix::DataArray>(1);\n\n std::vector<const char *> fields = { \"name\", \"id\", \"shape\", \"unit\", \"dimensions\", \"label\",\n \"polynom_coefficients\"};\n mxArray *sa = mxCreateStructMatrix(1, 1, fields.size(), fields.data());\n\n mxSetFieldByNumber(sa, 0, 0, mxCreateString(da.name().c_str()));\n mxSetFieldByNumber(sa, 0, 1, mxCreateString(da.id().c_str()));\n mxSetFieldByNumber(sa, 0, 2, ndsize_to_mxarray(da.dataExtent()));\n\n boost::optional<std::string> unit = da.unit();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 3, mxCreateString(unit->c_str()));\n }\n\n size_t ndims = da.dimensionCount();\n\n mxArray *dims = mxCreateCellMatrix(1, ndims);\n std::vector<nix::Dimension> da_dims = da.dimensions();\n\n for(size_t i = 0; i < ndims; i++) {\n mxArray *ca;\n\n switch(da_dims[i].dimensionType()) {\n case nix::DimensionType::Set:\n ca = dim_to_struct(da_dims[i].asSetDimension());\n break;\n case nix::DimensionType::Range:\n ca = dim_to_struct(da_dims[i].asRangeDimension());\n break;\n case nix::DimensionType::Sample:\n ca = dim_to_struct(da_dims[i].asSampledDimension());\n break;\n }\n\n\n mxSetCell(dims, i, ca);\n }\n\n mxSetFieldByNumber(sa, 0, 4, dims);\n\n\n boost::optional<std::string> label = da.label();\n if (unit) {\n mxSetFieldByNumber(sa, 0, 5, mxCreateString(label->c_str()));\n }\n\n std::vector<double> pc = da.polynomCoefficients();\n\n if (!pc.empty()) {\n mxSetFieldByNumber(sa, 0, 6, make_mx_array(pc));\n }\n\n output.set(0, sa);\n}\n\nstatic void data_array_read_all(const extractor &input, infusor &output)\n{\n mexPrintf(\"[+] block_describe_data_array\\n\");\n nix::DataArray da = input.entity<nix::DataArray>(1);\n\n nix::NDSize size = da.dataExtent();\n std::vector<mwSize> dims(size.size());\n\n for (size_t i = 0; i < size.size(); i++) {\n dims[i] = static_cast<mwSize>(size[i]);\n }\n\n mxArray *data = mxCreateNumericArray(size.size(), dims.data(), mxDOUBLE_CLASS, mxREAL);\n double *ptr = mxGetPr(data);\n\n nix::NDSize offset(size.size(), 0);\n da.getData(nix::DataType::Double , ptr, size, offset);\n\n output.set(0, data);\n}\n\n\/\/ *** ***\n\ntypedef void (*fn_t)(const extractor &input, infusor &output);\n\nstruct fendpoint {\n\nfendpoint(std::string name, fn_t fn) : name(name), fn(fn) {}\n\n std::string name;\n fn_t fn;\n};\n\nconst std::vector<fendpoint> funcs = {\n {\"Entity::destroy\", entity_destory},\n {\"File::open\", open_file},\n {\"File::listBlocks\", list_blocks},\n {\"File::openBlock\", open_block},\n {\"Block::openDataArray\", open_data_array},\n {\"Block::listDataArrays\", block_list_data_arrays},\n {\"DataArray::describe\", data_array_describe},\n {\"DataArray::readAll\", data_array_read_all}\n};\n\n\/\/ main entry point\nvoid mexFunction(int nlhs,\n mxArray *lhs[],\n int nrhs,\n const mxArray *rhs[])\n{\n extractor input(rhs, nrhs);\n infusor output(lhs, nlhs);\n\n std::string cmd = input.str(0);\n\n mexPrintf(\"[F] %s\\n\", cmd.c_str());\n\n bool processed = false;\n for (const auto &fn : funcs) {\n if (fn.name == cmd) {\n try {\n fn.fn(input, output);\n } catch (std::exception &e) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", e.what());\n } catch (...) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", \"unkown exception\");\n }\n processed = true;\n break;\n }\n }\n\n if (!processed) {\n mexErrMsgIdAndTxt(\"nix:arg:dispatch\", \"Unkown command\");\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <fplll\/fplll.h>\n\nusing namespace fplll;\n\ntemplate <class FT> int test_enum(size_t d)\n{\n RandGen::init_with_seed(0x1337);\n ZZ_mat<mpz_t> A = ZZ_mat<mpz_t>(100, 100);\n A.gen_qary_withq(50, 7681);\n lll_reduction(A);\n ZZ_mat<mpz_t> U;\n MatGSO<Z_NR<mpz_t>, FP_NR<FT>> M(A, U, U, 0);\n M.update_gso();\n\n FastEvaluator<FP_NR<FT>> evaluator;\n Enumeration<Z_NR<mpz_t>, FP_NR<FT>> enum_obj(M, evaluator);\n FP_NR<FT> max_dist;\n M.get_r(max_dist, 0, 0);\n max_dist *= 0.99;\n enum_obj.enumerate(0, d, max_dist, 0);\n int status = 0;\n \/\/ Check that we haven't overwritten beyond our bounds\n status |= (enum_obj.get_nodes(d + 1) != 0);\n \/\/ Check that we haven't screwed up the sum\n const auto a = enum_obj.get_nodes_array();\n uint64_t total = 0;\n for (unsigned int i = 0; i < a.size(); i++)\n {\n total += a[i];\n }\n\n status |= (total != enum_obj.get_nodes());\n return status;\n}\n\nint main()\n{\n int status = 0;\n \/\/ Different, so that we may delegate to either the local enumerator or the\n \/\/ external one.\n status |= test_enum<double>(10);\n status |= test_enum<double>(30);\n return status;\n}\n<commit_msg>Even stronger test on the rest of the array<commit_after>#include <fplll\/fplll.h>\n\nusing namespace fplll;\n\ntemplate <class FT> int test_enum(size_t d)\n{\n RandGen::init_with_seed(0x1337);\n ZZ_mat<mpz_t> A = ZZ_mat<mpz_t>(100, 100);\n A.gen_qary_withq(50, 7681);\n lll_reduction(A);\n ZZ_mat<mpz_t> U;\n MatGSO<Z_NR<mpz_t>, FP_NR<FT>> M(A, U, U, 0);\n M.update_gso();\n\n FastEvaluator<FP_NR<FT>> evaluator;\n Enumeration<Z_NR<mpz_t>, FP_NR<FT>> enum_obj(M, evaluator);\n FP_NR<FT> max_dist;\n M.get_r(max_dist, 0, 0);\n max_dist *= 0.99;\n enum_obj.enumerate(0, d, max_dist, 0);\n int status = 0;\n\n \/\/ Check that we haven't screwed up the sum\n const auto a = enum_obj.get_nodes_array();\n uint64_t total = 0;\n for (unsigned int i = 0; i < a.size(); i++)\n {\n total += a[i];\n }\n\n status |= (total != enum_obj.get_nodes());\n\n \/\/ Check that we haven't overwritten beyond our bounds\n for (unsigned int i = d + 1; i < a.size(); i++)\n {\n status |= (enum_obj.get_nodes(i) != 0);\n }\n\n return status;\n}\n\nint main()\n{\n int status = 0;\n \/\/ Different, so that we may delegate to either the local enumerator or the\n \/\/ external one.\n status |= test_enum<double>(10);\n status |= test_enum<double>(30);\n return status;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Check that one coroutine can create another coroutine.\n *\/\n#include <stdint.h>\n#include \"test.h\"\n#include \"colib.h\"\n\n#define test_assert(X) if (!(X)) {return -1;}\n\nstatic const uint32_t num_threads = 128;\n\nstruct args_t {\n co_thread_t * thread_[num_threads];\n uint32_t head_ = 0;\n};\n\nstatic\nvoid thread(co_thread_t * self) {\n assert(co_get_user(self));\n args_t & args = * (args_t*) co_get_user(self);\n\n if (args.head_ >= num_threads) {\n co_yield_to_main(self);\n }\n else {\n co_thread_t * & next = args.thread_[args.head_++];\n next = co_create(self, thread, 1024 * 512, nullptr, &args);\n co_yield(self, next);\n }\n\n \/\/ CANT USE ASSERTS HERE, IN RELEASE BUILD\n assert(!\"Should not get here\");\n}\n\nint32_t test_nesting() {\n\n args_t args;\n\n co_thread_t * host = co_init(nullptr);\n\n co_thread_t * t = co_create (host, thread, 1024 * 512, nullptr, &args);\n\n co_yield(host, t);\n test_assert(args.head_ == num_threads);\n\n for (uint32_t i = 0; i < num_threads; ++i)\n co_delete(args.thread_[i]);\n co_delete(host);\n\n return 0;\n}\n<commit_msg>fix visual studio 11 build.<commit_after>\/*\n * Check that one coroutine can create another coroutine.\n *\/\n#include <stdint.h>\n#include \"test.h\"\n#include \"colib.h\"\n\n#define test_assert(X) if (!(X)) {return -1;}\n\nstatic const uint32_t num_threads = 128;\n\nstruct args_t {\n uint32_t head_;\n co_thread_t * thread_[num_threads];\n};\n\nstatic\nvoid thread(co_thread_t * self) {\n assert(co_get_user(self));\n args_t & args = * (args_t*) co_get_user(self);\n\n if (args.head_ >= num_threads) {\n co_yield_to_main(self);\n }\n else {\n co_thread_t * & next = args.thread_[args.head_++];\n next = co_create(self, thread, 1024 * 512, nullptr, &args);\n co_yield(self, next);\n }\n\n \/\/ CANT USE ASSERTS HERE, IN RELEASE BUILD\n assert(!\"Should not get here\");\n}\n\nint32_t test_nesting() {\n\n args_t args = {0};\n\n co_thread_t * host = co_init(nullptr);\n\n co_thread_t * t = co_create (host, thread, 1024 * 512, nullptr, &args);\n\n co_yield(host, t);\n test_assert(args.head_ == num_threads);\n\n for (uint32_t i = 0; i < num_threads; ++i)\n co_delete(args.thread_[i]);\n co_delete(host);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <assert.h>\n#include <dirent.h>\n#include <pthread.h>\n#include <pty.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n#include \"sandbox_impl.h\"\n\n\n\/\/ This is basically a marker to grep for.\n#define TEST(name) void name()\n\nTEST(test_dup) {\n StartSeccompSandbox();\n \/\/ Test a simple syscall that is marked as UNRESTRICTED_SYSCALL.\n int fd = dup(1);\n assert(fd >= 0);\n int rc = close(fd);\n assert(rc == 0);\n}\n\n\/\/ This has an off-by-three error because it counts \".\", \"..\", and the\n\/\/ FD for the \/proc\/self\/fd directory. This doesn't matter because it\n\/\/ is only used to check for differences in the number of open FDs.\nint count_fds() {\n DIR *dir = opendir(\"\/proc\/self\/fd\");\n assert(dir != NULL);\n int count = 0;\n while (1) {\n struct dirent *d = readdir(dir);\n if (d == NULL)\n break;\n count++;\n }\n int rc = closedir(dir);\n assert(rc == 0);\n return count;\n}\n\nvoid *thread_func(void *x) {\n int *ptr = (int *) x;\n *ptr = 123;\n printf(\"In new thread\\n\");\n return (void *) 456;\n}\n\nTEST(test_thread) {\n StartSeccompSandbox();\n int fd_count1 = count_fds();\n pthread_t tid;\n int x = 999;\n void *result;\n pthread_create(&tid, NULL, thread_func, &x);\n printf(\"Waiting for thread\\n\");\n pthread_join(tid, &result);\n assert(result == (void *) 456);\n assert(x == 123);\n \/\/ Check that the process has not leaked FDs.\n int fd_count2 = count_fds();\n assert(fd_count2 == fd_count1);\n}\n\nint clone_func(void *x) {\n int *ptr = (int *) x;\n *ptr = 124;\n printf(\"In thread\\n\");\n \/\/ On x86-64, returning from this function calls the __NR_exit_group\n \/\/ syscall instead of __NR_exit.\n syscall(__NR_exit, 100);\n \/\/ Not reached.\n return 200;\n}\n\n#if defined(__i386__)\nint get_gs() {\n int gs;\n asm volatile(\"mov %%gs, %0\" : \"=r\"(gs));\n return gs;\n}\n#endif\n\nvoid *get_tls_base() {\n void *base;\n#if defined(__x86_64__)\n asm volatile(\"mov %%fs:0, %0\" : \"=r\"(base));\n#elif defined(__i386__)\n asm volatile(\"mov %%gs:0, %0\" : \"=r\"(base));\n#else\n#error Unsupported target platform\n#endif\n return base;\n}\n\nTEST(test_clone) {\n StartSeccompSandbox();\n int fd_count1 = count_fds();\n int stack_size = 0x1000;\n char *stack = (char *) malloc(stack_size);\n assert(stack != NULL);\n int flags = CLONE_VM | CLONE_FS | CLONE_FILES |\n CLONE_SIGHAND | CLONE_THREAD | CLONE_SYSVSEM |\n CLONE_SETTLS | CLONE_PARENT_SETTID | CLONE_CHILD_CLEARTID;\n int tid = -1;\n int x = 999;\n\n \/\/ The sandbox requires us to pass CLONE_TLS. Pass settings that\n \/\/ are enough to copy the parent thread's TLS setup. This allows us\n \/\/ to invoke libc in the child thread.\n#if defined(__x86_64__)\n void *tls = get_tls_base();\n#elif defined(__i386__)\n struct user_desc tls_desc, *tls = &tls_desc;\n tls_desc.entry_number = get_gs() >> 3;\n tls_desc.base_addr = (long) get_tls_base();\n tls_desc.limit = 0xfffff;\n tls_desc.seg_32bit = 1;\n tls_desc.contents = 0;\n tls_desc.read_exec_only = 0;\n tls_desc.limit_in_pages = 1;\n tls_desc.seg_not_present = 0;\n tls_desc.useable = 1;\n#else\n#error Unsupported target platform\n#endif\n\n int rc = clone(clone_func, (void *) (stack + stack_size), flags, &x,\n &tid, tls, &tid);\n assert(rc > 0);\n while (tid == rc) {\n syscall(__NR_futex, &tid, FUTEX_WAIT, rc, NULL);\n }\n assert(tid == 0);\n assert(x == 124);\n \/\/ Check that the process has not leaked FDs.\n int fd_count2 = count_fds();\n assert(fd_count2 == fd_count1);\n}\n\nint uncalled_clone_func(void *x) {\n printf(\"In thread func, which shouldn't happen\\n\");\n return 1;\n}\n\nTEST(test_clone_disallowed_flags) {\n StartSeccompSandbox();\n int stack_size = 4096;\n char *stack = (char *) malloc(stack_size);\n assert(stack != NULL);\n \/* We omit the flags CLONE_SETTLS, CLONE_PARENT_SETTID and\n CLONE_CHILD_CLEARTID, which is disallowed by the sandbox. *\/\n int flags = CLONE_VM | CLONE_FS | CLONE_FILES |\n CLONE_SIGHAND | CLONE_THREAD | CLONE_SYSVSEM;\n int rc = clone(uncalled_clone_func, (void *) (stack + stack_size),\n flags, NULL, NULL, NULL, NULL);\n assert(rc == -1);\n assert(errno == EPERM);\n}\n\nlong long read_tsc() {\n long long rc;\n asm volatile(\n \"rdtsc\\n\"\n \"mov %%eax, (%0)\\n\"\n \"mov %%edx, 4(%0)\\n\"\n :\n : \"c\"(&rc), \"a\"(-1), \"d\"(-1));\n return rc;\n}\n\nTEST(test_rdtsc) {\n StartSeccompSandbox();\n \/\/ Just check that we can do the instruction.\n read_tsc();\n}\n\nTEST(test_getpid) {\n int pid1 = getpid();\n StartSeccompSandbox();\n int pid2 = getpid();\n assert(pid1 == pid2);\n \/\/ Bypass any caching that glibc's getpid() wrapper might do.\n int pid3 = syscall(__NR_getpid);\n assert(pid1 == pid3);\n}\n\nTEST(test_gettid) {\n \/\/ glibc doesn't provide a gettid() wrapper.\n int tid1 = syscall(__NR_gettid);\n assert(tid1 > 0);\n StartSeccompSandbox();\n int tid2 = syscall(__NR_gettid);\n assert(tid1 == tid2);\n}\n\nvoid *map_something() {\n void *addr = mmap(NULL, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);\n assert(addr != MAP_FAILED);\n return addr;\n}\n\nTEST(test_mmap_disallows_remapping) {\n void *addr = map_something();\n StartSeccompSandbox();\n \/\/ Overwriting a mapping that was created before the sandbox was\n \/\/ enabled is not allowed.\n void *result = mmap(addr, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED, -1, 0);\n assert(result == MAP_FAILED);\n assert(errno == EINVAL);\n}\n\nTEST(test_mmap_disallows_low_address) {\n StartSeccompSandbox();\n \/\/ Mapping pages at low addresses is not allowed because this helps\n \/\/ with exploiting buggy kernels.\n void *result = mmap(NULL, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED, -1, 0);\n assert(result == MAP_FAILED);\n assert(errno == EINVAL);\n}\n\nTEST(test_munmap_allowed) {\n StartSeccompSandbox();\n void *addr = map_something();\n int result = munmap(addr, 0x1000);\n assert(result == 0);\n}\n\nTEST(test_munmap_disallowed) {\n void *addr = map_something();\n StartSeccompSandbox();\n int result = munmap(addr, 0x1000);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nTEST(test_mprotect_allowed) {\n StartSeccompSandbox();\n void *addr = map_something();\n int result = mprotect(addr, 0x1000, PROT_READ | PROT_WRITE);\n assert(result == 0);\n}\n\nTEST(test_mprotect_disallowed) {\n void *addr = map_something();\n StartSeccompSandbox();\n int result = mprotect(addr, 0x1000, PROT_READ | PROT_WRITE);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nint get_tty_fd() {\n int master_fd, tty_fd;\n int rc = openpty(&master_fd, &tty_fd, NULL, NULL, NULL);\n assert(rc == 0);\n return tty_fd;\n}\n\nTEST(test_ioctl_tiocgwinsz_allowed) {\n int tty_fd = get_tty_fd();\n StartSeccompSandbox();\n int size[2];\n \/\/ Get terminal width and height.\n int result = ioctl(tty_fd, TIOCGWINSZ, size);\n assert(result == 0);\n}\n\nTEST(test_ioctl_disallowed) {\n int tty_fd = get_tty_fd();\n StartSeccompSandbox();\n \/\/ This ioctl call inserts a character into the tty's input queue,\n \/\/ which provides a way to send commands to an interactive shell.\n char c = 'x';\n int result = ioctl(tty_fd, TIOCSTI, &c);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nTEST(test_socket) {\n StartSeccompSandbox();\n int fd = socket(AF_UNIX, SOCK_STREAM, 0);\n assert(fd == -1);\n \/\/ TODO: Make it consistent between i386 and x86-64.\n assert(errno == EINVAL || errno == ENOSYS);\n}\n\nTEST(test_open) {\n StartSeccompSandbox();\n int fd = open(\"\/dev\/null\", O_RDONLY);\n assert(fd >= 0);\n int rc = close(fd);\n assert(rc == 0);\n fd = open(\"\/dev\/null\", O_WRONLY);\n assert(fd == -1);\n assert(errno == EACCES);\n}\n\nTEST(test_access) {\n StartSeccompSandbox();\n int rc = access(\"\/dev\/null\", R_OK);\n assert(rc == 0);\n rc = access(\"path-that-does-not-exist\", R_OK);\n assert(rc == -1);\n assert(errno == ENOENT);\n}\n\nTEST(test_stat) {\n StartSeccompSandbox();\n struct stat st;\n int rc = stat(\"\/dev\/null\", &st);\n assert(rc == 0);\n rc = stat(\"path-that-does-not-exist\", &st);\n assert(rc == -1);\n assert(errno == ENOENT);\n}\n\n\nstruct testcase {\n const char *test_name;\n void (*test_func)();\n};\n\nstruct testcase all_tests[] = {\n#include \"test-list.h\"\n { NULL, NULL },\n};\n\nint run_test_forked(struct testcase *test) {\n printf(\"** %s\\n\", test->test_name);\n int pid = fork();\n if (pid == 0) {\n test->test_func();\n _exit(0);\n }\n int status;\n waitpid(pid, &status, 0);\n if (status != 0) {\n printf(\"Test failed with exit status %i\\n\", status);\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint run_test_by_name(const char *name) {\n struct testcase *test;\n for (test = all_tests; test->test_name != NULL; test++) {\n if (strcmp(name, test->test_name) == 0) {\n test->test_func();\n return 0;\n }\n }\n fprintf(stderr, \"Test '%s' not found\\n\", name);\n return 1;\n}\n\nint main(int argc, char **argv) {\n if (argc == 2) {\n \/\/ Run one test without forking, to aid debugging.\n return run_test_by_name(argv[1]);\n }\n else if (argc > 2) {\n \/\/ TODO: run multiple tests.\n fprintf(stderr, \"Too many arguments\\n\");\n return 1;\n }\n else {\n \/\/ Run all tests.\n struct testcase *test;\n int failures = 0;\n for (test = all_tests; test->test_name != NULL; test++) {\n failures += run_test_forked(test);\n }\n if (failures == 0) {\n printf(\"OK\\n\");\n return 0;\n }\n else {\n printf(\"%i FAILURE(S)\\n\", failures);\n return 1;\n }\n }\n}\n<commit_msg>Add tests for signal handling<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <assert.h>\n#include <dirent.h>\n#include <pthread.h>\n#include <pty.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n\n#include \"sandbox_impl.h\"\n\n\nint g_intended_status_fd = -1;\n\n\/\/ Declares the wait() status that the test subprocess intends to exit with.\nvoid intend_exit_status(int val) {\n if (g_intended_status_fd != -1) {\n int sent = write(g_intended_status_fd, &val, sizeof(val));\n assert(sent == sizeof(val));\n }\n else {\n printf(\"Intending to exit with status %i...\\n\", val);\n }\n}\n\n\n\/\/ This is basically a marker to grep for.\n#define TEST(name) void name()\n\nTEST(test_dup) {\n StartSeccompSandbox();\n \/\/ Test a simple syscall that is marked as UNRESTRICTED_SYSCALL.\n int fd = dup(1);\n assert(fd >= 0);\n int rc = close(fd);\n assert(rc == 0);\n}\n\nTEST(test_segfault) {\n \/\/ Check that the sandbox's SIGSEGV handler does not stop the\n \/\/ process from dying cleanly in the event of a real segfault.\n intend_exit_status(SIGSEGV);\n asm(\"hlt\");\n}\n\nTEST(test_exit) {\n intend_exit_status(123 << 8);\n _exit(123);\n}\n\n\/\/ This has an off-by-three error because it counts \".\", \"..\", and the\n\/\/ FD for the \/proc\/self\/fd directory. This doesn't matter because it\n\/\/ is only used to check for differences in the number of open FDs.\nint count_fds() {\n DIR *dir = opendir(\"\/proc\/self\/fd\");\n assert(dir != NULL);\n int count = 0;\n while (1) {\n struct dirent *d = readdir(dir);\n if (d == NULL)\n break;\n count++;\n }\n int rc = closedir(dir);\n assert(rc == 0);\n return count;\n}\n\nvoid *thread_func(void *x) {\n int *ptr = (int *) x;\n *ptr = 123;\n printf(\"In new thread\\n\");\n return (void *) 456;\n}\n\nTEST(test_thread) {\n StartSeccompSandbox();\n int fd_count1 = count_fds();\n pthread_t tid;\n int x = 999;\n void *result;\n pthread_create(&tid, NULL, thread_func, &x);\n printf(\"Waiting for thread\\n\");\n pthread_join(tid, &result);\n assert(result == (void *) 456);\n assert(x == 123);\n \/\/ Check that the process has not leaked FDs.\n int fd_count2 = count_fds();\n assert(fd_count2 == fd_count1);\n}\n\nint clone_func(void *x) {\n int *ptr = (int *) x;\n *ptr = 124;\n printf(\"In thread\\n\");\n \/\/ On x86-64, returning from this function calls the __NR_exit_group\n \/\/ syscall instead of __NR_exit.\n syscall(__NR_exit, 100);\n \/\/ Not reached.\n return 200;\n}\n\n#if defined(__i386__)\nint get_gs() {\n int gs;\n asm volatile(\"mov %%gs, %0\" : \"=r\"(gs));\n return gs;\n}\n#endif\n\nvoid *get_tls_base() {\n void *base;\n#if defined(__x86_64__)\n asm volatile(\"mov %%fs:0, %0\" : \"=r\"(base));\n#elif defined(__i386__)\n asm volatile(\"mov %%gs:0, %0\" : \"=r\"(base));\n#else\n#error Unsupported target platform\n#endif\n return base;\n}\n\nTEST(test_clone) {\n StartSeccompSandbox();\n int fd_count1 = count_fds();\n int stack_size = 0x1000;\n char *stack = (char *) malloc(stack_size);\n assert(stack != NULL);\n int flags = CLONE_VM | CLONE_FS | CLONE_FILES |\n CLONE_SIGHAND | CLONE_THREAD | CLONE_SYSVSEM |\n CLONE_SETTLS | CLONE_PARENT_SETTID | CLONE_CHILD_CLEARTID;\n int tid = -1;\n int x = 999;\n\n \/\/ The sandbox requires us to pass CLONE_TLS. Pass settings that\n \/\/ are enough to copy the parent thread's TLS setup. This allows us\n \/\/ to invoke libc in the child thread.\n#if defined(__x86_64__)\n void *tls = get_tls_base();\n#elif defined(__i386__)\n struct user_desc tls_desc, *tls = &tls_desc;\n tls_desc.entry_number = get_gs() >> 3;\n tls_desc.base_addr = (long) get_tls_base();\n tls_desc.limit = 0xfffff;\n tls_desc.seg_32bit = 1;\n tls_desc.contents = 0;\n tls_desc.read_exec_only = 0;\n tls_desc.limit_in_pages = 1;\n tls_desc.seg_not_present = 0;\n tls_desc.useable = 1;\n#else\n#error Unsupported target platform\n#endif\n\n int rc = clone(clone_func, (void *) (stack + stack_size), flags, &x,\n &tid, tls, &tid);\n assert(rc > 0);\n while (tid == rc) {\n syscall(__NR_futex, &tid, FUTEX_WAIT, rc, NULL);\n }\n assert(tid == 0);\n assert(x == 124);\n \/\/ Check that the process has not leaked FDs.\n int fd_count2 = count_fds();\n assert(fd_count2 == fd_count1);\n}\n\nint uncalled_clone_func(void *x) {\n printf(\"In thread func, which shouldn't happen\\n\");\n return 1;\n}\n\nTEST(test_clone_disallowed_flags) {\n StartSeccompSandbox();\n int stack_size = 4096;\n char *stack = (char *) malloc(stack_size);\n assert(stack != NULL);\n \/* We omit the flags CLONE_SETTLS, CLONE_PARENT_SETTID and\n CLONE_CHILD_CLEARTID, which is disallowed by the sandbox. *\/\n int flags = CLONE_VM | CLONE_FS | CLONE_FILES |\n CLONE_SIGHAND | CLONE_THREAD | CLONE_SYSVSEM;\n int rc = clone(uncalled_clone_func, (void *) (stack + stack_size),\n flags, NULL, NULL, NULL, NULL);\n assert(rc == -1);\n assert(errno == EPERM);\n}\n\nlong long read_tsc() {\n long long rc;\n asm volatile(\n \"rdtsc\\n\"\n \"mov %%eax, (%0)\\n\"\n \"mov %%edx, 4(%0)\\n\"\n :\n : \"c\"(&rc), \"a\"(-1), \"d\"(-1));\n return rc;\n}\n\nTEST(test_rdtsc) {\n StartSeccompSandbox();\n \/\/ Just check that we can do the instruction.\n read_tsc();\n}\n\nTEST(test_getpid) {\n int pid1 = getpid();\n StartSeccompSandbox();\n int pid2 = getpid();\n assert(pid1 == pid2);\n \/\/ Bypass any caching that glibc's getpid() wrapper might do.\n int pid3 = syscall(__NR_getpid);\n assert(pid1 == pid3);\n}\n\nTEST(test_gettid) {\n \/\/ glibc doesn't provide a gettid() wrapper.\n int tid1 = syscall(__NR_gettid);\n assert(tid1 > 0);\n StartSeccompSandbox();\n int tid2 = syscall(__NR_gettid);\n assert(tid1 == tid2);\n}\n\nvoid *map_something() {\n void *addr = mmap(NULL, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);\n assert(addr != MAP_FAILED);\n return addr;\n}\n\nTEST(test_mmap_disallows_remapping) {\n void *addr = map_something();\n StartSeccompSandbox();\n \/\/ Overwriting a mapping that was created before the sandbox was\n \/\/ enabled is not allowed.\n void *result = mmap(addr, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED, -1, 0);\n assert(result == MAP_FAILED);\n assert(errno == EINVAL);\n}\n\nTEST(test_mmap_disallows_low_address) {\n StartSeccompSandbox();\n \/\/ Mapping pages at low addresses is not allowed because this helps\n \/\/ with exploiting buggy kernels.\n void *result = mmap(NULL, 0x1000, PROT_READ,\n MAP_PRIVATE | MAP_ANONYMOUS | MAP_FIXED, -1, 0);\n assert(result == MAP_FAILED);\n assert(errno == EINVAL);\n}\n\nTEST(test_munmap_allowed) {\n StartSeccompSandbox();\n void *addr = map_something();\n int result = munmap(addr, 0x1000);\n assert(result == 0);\n}\n\nTEST(test_munmap_disallowed) {\n void *addr = map_something();\n StartSeccompSandbox();\n int result = munmap(addr, 0x1000);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nTEST(test_mprotect_allowed) {\n StartSeccompSandbox();\n void *addr = map_something();\n int result = mprotect(addr, 0x1000, PROT_READ | PROT_WRITE);\n assert(result == 0);\n}\n\nTEST(test_mprotect_disallowed) {\n void *addr = map_something();\n StartSeccompSandbox();\n int result = mprotect(addr, 0x1000, PROT_READ | PROT_WRITE);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nint get_tty_fd() {\n int master_fd, tty_fd;\n int rc = openpty(&master_fd, &tty_fd, NULL, NULL, NULL);\n assert(rc == 0);\n return tty_fd;\n}\n\nTEST(test_ioctl_tiocgwinsz_allowed) {\n int tty_fd = get_tty_fd();\n StartSeccompSandbox();\n int size[2];\n \/\/ Get terminal width and height.\n int result = ioctl(tty_fd, TIOCGWINSZ, size);\n assert(result == 0);\n}\n\nTEST(test_ioctl_disallowed) {\n int tty_fd = get_tty_fd();\n StartSeccompSandbox();\n \/\/ This ioctl call inserts a character into the tty's input queue,\n \/\/ which provides a way to send commands to an interactive shell.\n char c = 'x';\n int result = ioctl(tty_fd, TIOCSTI, &c);\n assert(result == -1);\n assert(errno == EINVAL);\n}\n\nTEST(test_socket) {\n StartSeccompSandbox();\n int fd = socket(AF_UNIX, SOCK_STREAM, 0);\n assert(fd == -1);\n \/\/ TODO: Make it consistent between i386 and x86-64.\n assert(errno == EINVAL || errno == ENOSYS);\n}\n\nTEST(test_open) {\n StartSeccompSandbox();\n int fd = open(\"\/dev\/null\", O_RDONLY);\n assert(fd >= 0);\n int rc = close(fd);\n assert(rc == 0);\n fd = open(\"\/dev\/null\", O_WRONLY);\n assert(fd == -1);\n assert(errno == EACCES);\n}\n\nTEST(test_access) {\n StartSeccompSandbox();\n int rc = access(\"\/dev\/null\", R_OK);\n assert(rc == 0);\n rc = access(\"path-that-does-not-exist\", R_OK);\n assert(rc == -1);\n assert(errno == ENOENT);\n}\n\nTEST(test_stat) {\n StartSeccompSandbox();\n struct stat st;\n int rc = stat(\"\/dev\/null\", &st);\n assert(rc == 0);\n rc = stat(\"path-that-does-not-exist\", &st);\n assert(rc == -1);\n assert(errno == ENOENT);\n}\n\nint g_value;\n\nvoid signal_handler(int sig) {\n g_value = 300;\n printf(\"In signal handler\\n\");\n}\n\nvoid sigaction_handler(int sig, siginfo_t *a, void *b) {\n g_value = 300;\n printf(\"In sigaction handler\\n\");\n}\n\nTEST(test_signal_handler) {\n sighandler_t result = signal(SIGTRAP, signal_handler);\n assert(result != SIG_ERR);\n\n StartSeccompSandbox();\n\n \/\/ signal() is not allowed inside the sandbox yet.\n result = signal(SIGTRAP, signal_handler);\n assert(result == SIG_ERR);\n assert(errno == ENOSYS);\n\n g_value = 200;\n asm(\"int3\");\n assert(g_value == 300);\n}\n\nTEST(test_sigaction_handler) {\n struct sigaction act;\n act.sa_sigaction = sigaction_handler;\n sigemptyset(&act.sa_mask);\n act.sa_flags = SA_SIGINFO;\n int rc = sigaction(SIGTRAP, &act, NULL);\n assert(rc == 0);\n\n StartSeccompSandbox();\n\n \/\/ sigaction() is not allowed inside the sandbox yet.\n rc = sigaction(SIGTRAP, &act, NULL);\n assert(rc == -1);\n assert(errno == ENOSYS);\n\n g_value = 200;\n asm(\"int3\");\n assert(g_value == 300);\n}\n\nTEST(test_blocked_signal) {\n sighandler_t result = signal(SIGTRAP, signal_handler);\n assert(result != SIG_ERR);\n StartSeccompSandbox();\n\n \/\/ Initially the signal should not be blocked.\n sigset_t sigs;\n sigfillset(&sigs);\n int rc = sigprocmask(0, NULL, &sigs);\n assert(rc == 0);\n assert(!sigismember(&sigs, SIGTRAP));\n\n sigemptyset(&sigs);\n sigaddset(&sigs, SIGTRAP);\n rc = sigprocmask(SIG_BLOCK, &sigs, NULL);\n assert(rc == 0);\n\n \/\/ Check that we can read back the blocked status.\n sigemptyset(&sigs);\n rc = sigprocmask(0, NULL, &sigs);\n assert(rc == 0);\n assert(sigismember(&sigs, SIGTRAP));\n\n \/\/ Check that the signal handler really is blocked.\n intend_exit_status(SIGTRAP);\n asm(\"int3\");\n}\n\nTEST(test_sigaltstack) {\n \/\/ The sandbox does not support sigaltstack() yet. Just test that\n \/\/ it returns an error.\n StartSeccompSandbox();\n stack_t st;\n st.ss_size = 0x4000;\n st.ss_sp = malloc(st.ss_size);\n assert(st.ss_sp != NULL);\n st.ss_flags = 0;\n int rc = sigaltstack(&st, NULL);\n assert(rc == -1);\n assert(errno == ENOSYS);\n}\n\n\nstruct testcase {\n const char *test_name;\n void (*test_func)();\n};\n\nstruct testcase all_tests[] = {\n#include \"test-list.h\"\n { NULL, NULL },\n};\n\nint run_test_forked(struct testcase *test) {\n printf(\"** %s\\n\", test->test_name);\n int pipe_fds[2];\n int rc = pipe(pipe_fds);\n assert(rc == 0);\n int pid = fork();\n if (pid == 0) {\n rc = close(pipe_fds[0]);\n assert(rc == 0);\n g_intended_status_fd = pipe_fds[1];\n\n test->test_func();\n intend_exit_status(0);\n _exit(0);\n }\n rc = close(pipe_fds[1]);\n assert(rc == 0);\n\n int intended_status;\n int got = read(pipe_fds[0], &intended_status, sizeof(intended_status));\n bool got_intended_status = got == sizeof(intended_status);\n if (!got_intended_status) {\n printf(\"Test runner: Did not receive intended status\\n\");\n }\n\n int status;\n int pid2 = waitpid(pid, &status, 0);\n assert(pid2 == pid);\n if (!got_intended_status) {\n printf(\"Test returned exit status %i\\n\", status);\n return 1;\n }\n else if (status != intended_status) {\n printf(\"Test failed with exit status %i, expected %i\\n\",\n status, intended_status);\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint run_test_by_name(const char *name) {\n struct testcase *test;\n for (test = all_tests; test->test_name != NULL; test++) {\n if (strcmp(name, test->test_name) == 0) {\n printf(\"Running test %s...\\n\", name);\n test->test_func();\n printf(\"OK\\n\");\n return 0;\n }\n }\n fprintf(stderr, \"Test '%s' not found\\n\", name);\n return 1;\n}\n\nint main(int argc, char **argv) {\n if (argc == 2) {\n \/\/ Run one test without forking, to aid debugging.\n return run_test_by_name(argv[1]);\n }\n else if (argc > 2) {\n \/\/ TODO: run multiple tests.\n fprintf(stderr, \"Too many arguments\\n\");\n return 1;\n }\n else {\n \/\/ Run all tests.\n struct testcase *test;\n int failures = 0;\n for (test = all_tests; test->test_name != NULL; test++) {\n failures += run_test_forked(test);\n }\n if (failures == 0) {\n printf(\"OK\\n\");\n return 0;\n }\n else {\n printf(\"%i FAILURE(S)\\n\", failures);\n return 1;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifdef __linux__\n\n#include <errno.h> \/\/ errno\n#include <pthread.h>\n#include <stdio.h> \/\/ TODO - Remove\n#include <string.h> \/\/ strerror\n#include <sys\/epoll.h>\n#include <unistd.h>\n#include <map>\n#include <list>\n\n#include <uv.h>\n#include <v8.h>\n#include <node.h>\n#include <node_object_wrap.h>\n\n#include <nan.h>\n\n#include \"epoll.h\"\n\nusing namespace v8;\n\n\/\/ TODO - strerror isn't threadsafe, use strerror_r instead\n\/\/ TODO - use uv_strerror rather than strerror_t for libuv errors\n\/\/ TODO - Tidy up thread stuff and global vars\n\n\/*\n * Watcher thread\n *\/\n\n\/\/ TODO - The variable names here look terrible\nstatic int watcher_epfd_g;\n\nstatic uv_sem_t watcher_sem_g;\nstatic uv_async_t watcher_async_g;\n\nstatic struct epoll_event watcher_event_g;\nstatic int watcher_errno_g;\n\nstatic void *watcher(void *arg) {\n while (true) {\n \/\/ Wait till the event loop says it's ok to poll.\n uv_sem_wait(&watcher_sem_g);\n\n int count = epoll_wait(watcher_epfd_g, &watcher_event_g, 1, -1);\n watcher_errno_g = count == -1 ? errno : 0;\n\n \/\/ Errors returned from uv_async_send are silently ignored.\n uv_async_send(&watcher_async_g);\n }\n\n return 0;\n}\n\n\/\/ TODO - start_watcher looks terrible.\nstatic void start_watcher() {\n pthread_t theread_id;\n\n \/\/ TODO - Create a method callable from JS for starting the thread so that\n \/\/ it's possible to pass arguments to epoll_create1 and pass errors back to\n \/\/ JS.\n watcher_epfd_g = epoll_create1(0);\n if (watcher_epfd_g == -1) {\n printf(\"%s\\n\", strerror(errno));\n return;\n }\n\n int err = uv_sem_init(&watcher_sem_g, 1);\n if (err < 0) {\n close(watcher_epfd_g);\n printf(\"%s\\n\", strerror(-err));\n return;\n }\n\n err = uv_async_init(uv_default_loop(), &watcher_async_g, Epoll::DispatchEvent);\n if (err < 0) {\n close(watcher_epfd_g);\n uv_sem_destroy(&watcher_sem_g);\n printf(\"%s\\n\", strerror(-err));\n return;\n }\n\n \/\/ Prevent watcher_async_g from keeping the event loop alive.\n uv_unref((uv_handle_t *) &watcher_async_g);\n\n err = pthread_create(&theread_id, 0, watcher, 0);\n if (err != 0) {\n close(watcher_epfd_g);\n uv_sem_destroy(&watcher_sem_g);\n uv_close((uv_handle_t *) &watcher_async_g, 0);\n printf(\"%s\\n\", strerror(err));\n return;\n }\n}\n\n\n\/*\n * Epoll\n *\/\nPersistent<FunctionTemplate> Epoll::constructor;\nstd::map<int, Epoll*> Epoll::fd2epoll;\n\n\nEpoll::Epoll(NanCallback *callback)\n : callback_(callback), closed_(false) {\n};\n\n\nEpoll::~Epoll() {\n \/\/ v8 decides when and if destructors are called. In particular, if the\n \/\/ process is about to terminate, it's highly likely that destructors will\n \/\/ not be called. This is therefore not the place for calling the likes of\n \/\/ uv_unref, which, in general, must be called to terminate a process\n \/\/ gracefully!\n NanScope();\n\n if (callback_) delete callback_;\n};\n\n\nvoid Epoll::Init(Handle<Object> exports) {\n NanScope();\n\n \/\/ Constructor\n Local<FunctionTemplate> ctor = FunctionTemplate::New(Epoll::New);\n NanAssignPersistent(FunctionTemplate, constructor, ctor);\n ctor->SetClassName(NanSymbol(\"Epoll\"));\n ctor->InstanceTemplate()->SetInternalFieldCount(1);\n\n \/\/ Prototype\n NODE_SET_PROTOTYPE_METHOD(ctor, \"add\", Add);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"modify\", Modify);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"remove\", Remove);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"close\", Close);\n\n NODE_DEFINE_CONSTANT(ctor, EPOLLIN);\n NODE_DEFINE_CONSTANT(ctor, EPOLLOUT);\n NODE_DEFINE_CONSTANT(ctor, EPOLLRDHUP);\n NODE_DEFINE_CONSTANT(ctor, EPOLLPRI); \/\/ The reason this addon exists!\n NODE_DEFINE_CONSTANT(ctor, EPOLLERR);\n NODE_DEFINE_CONSTANT(ctor, EPOLLHUP);\n NODE_DEFINE_CONSTANT(ctor, EPOLLET);\n NODE_DEFINE_CONSTANT(ctor, EPOLLONESHOT);\n\n exports->Set(NanSymbol(\"Epoll\"), ctor->GetFunction());\n}\n\n\nNAN_METHOD(Epoll::New) {\n NanScope();\n\n \/\/ TODO - Can throw be avoided here? Maybe with a default empty handler?\n if (args.Length() < 1 || !args[0]->IsFunction())\n return NanThrowError(\"First argument to construtor must be a callback\");\n\n NanCallback *callback = new NanCallback(Local<Function>::Cast(args[0]));\n\n Epoll *epoll = new Epoll(callback);\n epoll->Wrap(args.This());\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Add) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"add can't be called after close has been called\");\n\n if (args.Length() < 2 || !args[0]->IsInt32() || !args[1]->IsUint32())\n return NanThrowError(\"incorrect arguments passed to add(int fd, uint32_t events)\");\n\n int err = epoll->Add(args[0]->Int32Value(), args[1]->Uint32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Modify) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"modify can't be called after close has been called\");\n\n if (args.Length() < 2 || !args[0]->IsInt32() || !args[1]->IsUint32())\n return NanThrowError(\"incorrect arguments passed to maodify(int fd, uint32_t events)\");\n\n int err = epoll->Modify(args[0]->Int32Value(), args[1]->Uint32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Remove) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"remove can't be called after close has been called\");\n\n if (args.Length() < 1 || !args[0]->IsInt32())\n return NanThrowError(\"incorrect arguments passed to remove(int fd)\");\n\n int err = epoll->Remove(args[0]->Int32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Close) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"close can't be called more than once\");\n\n int err = epoll->Close();\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnNull();\n}\n\n\nint Epoll::Add(int fd, uint32_t events) {\n struct epoll_event event;\n event.events = events; \/\/ EPOLLIN; \/\/ EPOLLPRI;\n event.data.fd = fd;\n\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_ADD, fd, &event) == -1)\n return errno;\n\n fd2epoll.insert(std::pair<int, Epoll*>(fd, this)); \/\/ TODO - Error handling, fd may not be there.\n fds_.push_back(fd); \/\/ TODO - Error handling, fd may not be there.\n\n \/\/ Keep event loop alive. uv_unref called in Remove.\n uv_ref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Modify(int fd, uint32_t events) {\n struct epoll_event event;\n event.events = events;\n event.data.fd = fd;\n\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_MOD, fd, &event) == -1)\n return errno;\n\n fd2epoll.insert(std::pair<int, Epoll*>(fd, this)); \/\/ TODO - Error handling, fd may not be there.\n fds_.push_back(fd); \/\/ TODO - Error handling, fd may not be there.\n\n \/\/ Keep event loop alive. uv_unref called in Remove.\n uv_ref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Remove(int fd) {\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_DEL, fd, 0) == -1)\n return errno;\n\n fd2epoll.erase(fd); \/\/ TODO - Error handling, fd may not be there.\n fds_.remove(fd); \/\/ TODO - Error handling, fd may not be there.\n\n if (fd2epoll.empty())\n uv_unref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Close() {\n closed_ = true;\n\n delete callback_;\n callback_ = 0;\n \n std::list<int>::iterator it = fds_.begin();\n while (it != fds_.end()) {\n int err = Remove(*it);\n if (err != 0)\n return err; \/\/ TODO - Returning here leaves things messed up.\n it = fds_.begin();\n }\n\n return 0;\n}\n\n\nvoid Epoll::DispatchEvent(uv_async_t* handle, int status) {\n \/\/ This method is executed in the event loop thread.\n \/\/ By the time flow of control arrives here the original Epoll instance that\n \/\/ registered interest in the event may no longer have this interest. If\n \/\/ this is the case, the event will be silently ignored.\n\n std::map<int, Epoll*>::iterator it = fd2epoll.find(watcher_event_g.data.fd);\n if (it != fd2epoll.end()) {\n it->second->DispatchEvent(watcher_errno_g, &watcher_event_g);\n }\n\n uv_sem_post(&watcher_sem_g);\n}\n\n\nvoid Epoll::DispatchEvent(int err, struct epoll_event *event) {\n NanScope();\n\n if (err) {\n Local<Value> args[1] = {\n Exception::Error(String::New(strerror(err)))\n };\n callback_->Call(1, args);\n } else {\n Local<Value> args[3] = {\n Local<Value>::New(Null()),\n Integer::New(event->data.fd),\n Integer::New(event->events)\n };\n callback_->Call(3, args);\n }\n}\n\n\nextern \"C\" void Init(Handle<Object> exports) {\n NanScope();\n\n Epoll::Init(exports);\n\n \/\/ TODO - Allow JavaScript to start the thread\n start_watcher();\n}\n\nNODE_MODULE(epoll, Init)\n\n#endif\n\n<commit_msg>don't add fd to list and map in modify, cleanup<commit_after>#ifdef __linux__\n\n#include <errno.h> \/\/ errno\n#include <pthread.h>\n#include <stdio.h> \/\/ TODO - Remove\n#include <string.h> \/\/ strerror\n#include <sys\/epoll.h>\n#include <unistd.h>\n#include <map>\n#include <list>\n\n#include <uv.h>\n#include <v8.h>\n#include <node.h>\n#include <node_object_wrap.h>\n\n#include <nan.h>\n\n#include \"epoll.h\"\n\nusing namespace v8;\n\n\/\/ TODO - strerror isn't threadsafe, use strerror_r instead\n\/\/ TODO - use uv_strerror rather than strerror_t for libuv errors\n\/\/ TODO - Tidy up thread stuff and global vars\n\n\/*\n * Watcher thread\n *\/\n\n\/\/ TODO - The variable names here look terrible\nstatic int watcher_epfd_g;\n\nstatic uv_sem_t watcher_sem_g;\nstatic uv_async_t watcher_async_g;\n\nstatic struct epoll_event watcher_event_g;\nstatic int watcher_errno_g;\n\nstatic void *watcher(void *arg) {\n while (true) {\n \/\/ Wait till the event loop says it's ok to poll.\n uv_sem_wait(&watcher_sem_g);\n\n int count = epoll_wait(watcher_epfd_g, &watcher_event_g, 1, -1);\n watcher_errno_g = count == -1 ? errno : 0;\n\n \/\/ Errors returned from uv_async_send are silently ignored.\n uv_async_send(&watcher_async_g);\n }\n\n return 0;\n}\n\n\/\/ TODO - start_watcher looks terrible.\nstatic void start_watcher() {\n pthread_t theread_id;\n\n \/\/ TODO - Create a method callable from JS for starting the thread so that\n \/\/ it's possible to pass arguments to epoll_create1 and pass errors back to\n \/\/ JS.\n watcher_epfd_g = epoll_create1(0);\n if (watcher_epfd_g == -1) {\n printf(\"%s\\n\", strerror(errno));\n return;\n }\n\n int err = uv_sem_init(&watcher_sem_g, 1);\n if (err < 0) {\n close(watcher_epfd_g);\n printf(\"%s\\n\", strerror(-err));\n return;\n }\n\n err = uv_async_init(uv_default_loop(), &watcher_async_g,\n Epoll::DispatchEvent);\n if (err < 0) {\n close(watcher_epfd_g);\n uv_sem_destroy(&watcher_sem_g);\n printf(\"%s\\n\", strerror(-err));\n return;\n }\n\n \/\/ Prevent watcher_async_g from keeping event loop alive, for the time being.\n uv_unref((uv_handle_t *) &watcher_async_g);\n\n err = pthread_create(&theread_id, 0, watcher, 0);\n if (err != 0) {\n close(watcher_epfd_g);\n uv_sem_destroy(&watcher_sem_g);\n uv_close((uv_handle_t *) &watcher_async_g, 0);\n printf(\"%s\\n\", strerror(err));\n return;\n }\n}\n\n\n\/*\n * Epoll\n *\/\nPersistent<FunctionTemplate> Epoll::constructor;\nstd::map<int, Epoll*> Epoll::fd2epoll;\n\n\nEpoll::Epoll(NanCallback *callback)\n : callback_(callback), closed_(false) {\n};\n\n\nEpoll::~Epoll() {\n \/\/ v8 decides when and if destructors are called. In particular, if the\n \/\/ process is about to terminate, it's highly likely that destructors will\n \/\/ not be called. This is therefore not the place for calling the likes of\n \/\/ uv_unref, which, in general, must be called to terminate a process\n \/\/ gracefully!\n NanScope();\n\n if (callback_) delete callback_;\n};\n\n\nvoid Epoll::Init(Handle<Object> exports) {\n NanScope();\n\n \/\/ Constructor\n Local<FunctionTemplate> ctor = FunctionTemplate::New(Epoll::New);\n NanAssignPersistent(FunctionTemplate, constructor, ctor);\n ctor->SetClassName(NanSymbol(\"Epoll\"));\n ctor->InstanceTemplate()->SetInternalFieldCount(1);\n\n \/\/ Prototype\n NODE_SET_PROTOTYPE_METHOD(ctor, \"add\", Add);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"modify\", Modify);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"remove\", Remove);\n NODE_SET_PROTOTYPE_METHOD(ctor, \"close\", Close);\n\n NODE_DEFINE_CONSTANT(ctor, EPOLLIN);\n NODE_DEFINE_CONSTANT(ctor, EPOLLOUT);\n NODE_DEFINE_CONSTANT(ctor, EPOLLRDHUP);\n NODE_DEFINE_CONSTANT(ctor, EPOLLPRI); \/\/ The reason this addon exists!\n NODE_DEFINE_CONSTANT(ctor, EPOLLERR);\n NODE_DEFINE_CONSTANT(ctor, EPOLLHUP);\n NODE_DEFINE_CONSTANT(ctor, EPOLLET);\n NODE_DEFINE_CONSTANT(ctor, EPOLLONESHOT);\n\n exports->Set(NanSymbol(\"Epoll\"), ctor->GetFunction());\n}\n\n\nNAN_METHOD(Epoll::New) {\n NanScope();\n\n \/\/ TODO - Can throw be avoided here? Maybe with a default empty handler?\n if (args.Length() < 1 || !args[0]->IsFunction())\n return NanThrowError(\"First argument to construtor must be a callback\");\n\n NanCallback *callback = new NanCallback(Local<Function>::Cast(args[0]));\n\n Epoll *epoll = new Epoll(callback);\n epoll->Wrap(args.This());\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Add) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"add can't be called after calling close\");\n\n if (args.Length() < 2 || !args[0]->IsInt32() || !args[1]->IsUint32())\n return NanThrowError(\"incorrect arguments passed to add\"\n \"(int fd, uint32_t events)\");\n\n int err = epoll->Add(args[0]->Int32Value(), args[1]->Uint32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Modify) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"modify can't be called after calling close\");\n\n if (args.Length() < 2 || !args[0]->IsInt32() || !args[1]->IsUint32())\n return NanThrowError(\"incorrect arguments passed to maodify\"\n \"(int fd, uint32_t events)\");\n\n int err = epoll->Modify(args[0]->Int32Value(), args[1]->Uint32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Remove) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"remove can't be called after calling close\");\n\n if (args.Length() < 1 || !args[0]->IsInt32())\n return NanThrowError(\"incorrect arguments passed to remove(int fd)\");\n\n int err = epoll->Remove(args[0]->Int32Value());\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnValue(args.This());\n}\n\n\nNAN_METHOD(Epoll::Close) {\n NanScope();\n\n Epoll *epoll = ObjectWrap::Unwrap<Epoll>(args.This());\n\n if (epoll->closed_)\n return NanThrowError(\"close can't be called more than once\");\n\n int err = epoll->Close();\n if (err != 0)\n return NanThrowError(strerror(err), err);\n\n NanReturnNull();\n}\n\n\nint Epoll::Add(int fd, uint32_t events) {\n struct epoll_event event;\n event.events = events;\n event.data.fd = fd;\n\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_ADD, fd, &event) == -1)\n return errno;\n\n fd2epoll.insert(std::pair<int, Epoll*>(fd, this));\n fds_.push_back(fd);\n\n \/\/ Keep event loop alive. uv_unref called in Remove.\n uv_ref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Modify(int fd, uint32_t events) {\n struct epoll_event event;\n event.events = events;\n event.data.fd = fd;\n\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_MOD, fd, &event) == -1)\n return errno;\n\n \/\/ Keep event loop alive. uv_unref called in Remove.\n uv_ref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Remove(int fd) {\n if (epoll_ctl(watcher_epfd_g, EPOLL_CTL_DEL, fd, 0) == -1)\n return errno;\n\n fd2epoll.erase(fd);\n fds_.remove(fd);\n\n if (fd2epoll.empty())\n uv_unref((uv_handle_t *) &watcher_async_g);\n\n return 0;\n}\n\n\nint Epoll::Close() {\n closed_ = true;\n\n delete callback_;\n callback_ = 0;\n \n std::list<int>::iterator it = fds_.begin();\n for (; it != fds_.end(); it = fds_.begin()) {\n int err = Remove(*it);\n if (err != 0)\n return err; \/\/ TODO - Returning here leaves things messed up.\n }\n\n return 0;\n}\n\n\nvoid Epoll::DispatchEvent(uv_async_t* handle, int status) {\n \/\/ This method is executed in the event loop thread.\n \/\/ By the time flow of control arrives here the original Epoll instance that\n \/\/ registered interest in the event may no longer have this interest. If\n \/\/ this is the case, the event will be silently ignored.\n\n std::map<int, Epoll*>::iterator it = fd2epoll.find(watcher_event_g.data.fd);\n if (it != fd2epoll.end()) {\n it->second->DispatchEvent(watcher_errno_g, &watcher_event_g);\n }\n\n uv_sem_post(&watcher_sem_g);\n}\n\n\nvoid Epoll::DispatchEvent(int err, struct epoll_event *event) {\n NanScope();\n\n if (err) {\n Local<Value> args[1] = {\n Exception::Error(String::New(strerror(err)))\n };\n callback_->Call(1, args);\n } else {\n Local<Value> args[3] = {\n Local<Value>::New(Null()),\n Integer::New(event->data.fd),\n Integer::New(event->events)\n };\n callback_->Call(3, args);\n }\n}\n\n\nextern \"C\" void Init(Handle<Object> exports) {\n NanScope();\n\n Epoll::Init(exports);\n\n \/\/ TODO - Allow JavaScript to start the thread\n start_watcher();\n}\n\nNODE_MODULE(epoll, Init)\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_MODULE BlockchainTests2\n#include <boost\/test\/unit_test.hpp>\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/wallet\/wallet.hpp>\n#include <bts\/blockchain\/config.hpp>\n#include <bts\/blockchain\/time.hpp>\n#include <fc\/exception\/exception.hpp>\n#include <fc\/log\/logger.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <iostream>\n\nusing namespace bts::blockchain;\nusing namespace bts::wallet;\n\nconst char* test_keys = R\"([\n \"dce167e01dfd6904015a8106e0e1470110ef2d5b0b18ba7a83cb8204e25c6b5f\",\n \"7fee1dc3110ba4abe134822c257c9db5beadbe557763cc54e3dc59b699978a50\",\n \"4e42e82970d3307d26634572cddbf8424c10cee1c8c7fcebdd9417942a08a1bd\",\n \"e44baa4f693f1bd71ba8f6b8509c56dd41206e2cff07efcf7b42fc79464a1c59\",\n \"18fd5207b1a0d72465b8f3ed06b44232a366a76f559c5da3aec9f306e179278f\",\n \"6dc61837b51d0bb80143c1a7ba5c957f122faa96e0a6ff76ba25f9ff42ef69fd\",\n \"45b0a66b5016618700b4d4fbfa85efd1b0724e8ae95b09a6c9ec850a05254f48\",\n \"602751d179b75da5432c64a3360a7309609636056c31deae37b8441230c968eb\",\n \"8ced7ac956e1755e87c21b1b265979c848c79b3bea3b855bb5b819d3baa72ed2\",\n \"90ef5e50773c90368597e46eaf1b563f76f879aa8969c2e7a2198847f93324c4\"\n])\";\n\nBOOST_AUTO_TEST_CASE( wallet_tests )\n{\n try {\n fc::temp_directory my_dir;\n fc::temp_directory your_dir;\n chain_database_ptr my_blockchain = std::make_shared<chain_database>();\n my_blockchain->open( my_dir.path(), \"genesis.json\" );\n chain_database_ptr your_blockchain = std::make_shared<chain_database>();\n your_blockchain->open( your_dir.path(), \"genesis.json\" );\n std::string password = \"123456789\";\n\n wallet my_wallet( my_blockchain );\n my_wallet.set_data_directory( my_dir.path() );\n my_wallet.create( \"my_wallet\", password );\n my_wallet.unlock( password );\n wlog( \" closing wallet \" );\n my_wallet.close();\n my_wallet.open( \"my_wallet\" );\n my_wallet.unlock( password );\n\n auto result = my_wallet.create_account( \"my1\" );\n auto result2 = my_wallet.create_account( \"my2\" );\n ilog( \"my1: ${a}\", (\"a\",result) );\n ilog( \"my2: ${a}\", (\"a\",result2) );\n\n\n wallet your_wallet( your_blockchain );\n your_wallet.set_data_directory( your_dir.path() );\n your_wallet.create( \"your_wallet\", password );\n your_wallet.unlock( password );\n\n auto your_account2 = your_wallet.create_account( \"your1\" );\n auto your_account3 = your_wallet.create_account( \"your2\" );\n auto your_account4 = your_wallet.create_account( \"your4\" );\n ilog( \"your1: ${a}\", (\"a\",result) );\n ilog( \"your2: ${a}\", (\"a\",result2) );\n\n auto keys = fc::json::from_string( test_keys ).as<std::vector<fc::ecc::private_key> >();\n for( auto key: keys )\n {\n my_wallet.import_private_key( key, \"my1\" );\n }\n\n my_wallet.scan_state();\n\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n my_wallet.close();\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n my_wallet.open( \"my_wallet\" );\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n\n ilog( \"balance: * ${b}\", (\"b\",my_wallet.get_balance() ) );\n ilog( \"balance: my1 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"my1\") ) );\n ilog( \"balance: my2 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"my2\") ) );\n\n wlog( \"adding your4..\\n\\n\" );\n my_wallet.add_contact_account( \"your4\", your_account4 );\n ilog( \"balance: your4 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"your4\") ) );\n\n \/\/my_wallet.scan_state();\n\n } catch ( const fc::exception& e )\n {\n elog( \"${e}\", (\"e\",e.to_detail_string() ) );\n throw;\n }\n\n}\n<commit_msg>updating unit test<commit_after>#define BOOST_TEST_MODULE BlockchainTests2\n#include <boost\/test\/unit_test.hpp>\n#include <bts\/blockchain\/chain_database.hpp>\n#include <bts\/wallet\/wallet.hpp>\n#include <bts\/blockchain\/config.hpp>\n#include <bts\/blockchain\/time.hpp>\n#include <fc\/exception\/exception.hpp>\n#include <fc\/log\/logger.hpp>\n#include <fc\/io\/json.hpp>\n#include <fc\/thread\/thread.hpp>\n#include <iostream>\n\nusing namespace bts::blockchain;\nusing namespace bts::wallet;\n\nconst char* test_keys = R\"([\n \"dce167e01dfd6904015a8106e0e1470110ef2d5b0b18ba7a83cb8204e25c6b5f\",\n \"7fee1dc3110ba4abe134822c257c9db5beadbe557763cc54e3dc59b699978a50\",\n \"4e42e82970d3307d26634572cddbf8424c10cee1c8c7fcebdd9417942a08a1bd\",\n \"e44baa4f693f1bd71ba8f6b8509c56dd41206e2cff07efcf7b42fc79464a1c59\",\n \"18fd5207b1a0d72465b8f3ed06b44232a366a76f559c5da3aec9f306e179278f\",\n \"6dc61837b51d0bb80143c1a7ba5c957f122faa96e0a6ff76ba25f9ff42ef69fd\",\n \"45b0a66b5016618700b4d4fbfa85efd1b0724e8ae95b09a6c9ec850a05254f48\",\n \"602751d179b75da5432c64a3360a7309609636056c31deae37b8441230c968eb\",\n \"8ced7ac956e1755e87c21b1b265979c848c79b3bea3b855bb5b819d3baa72ed2\",\n \"90ef5e50773c90368597e46eaf1b563f76f879aa8969c2e7a2198847f93324c4\"\n])\";\n\nBOOST_AUTO_TEST_CASE( public_key_type_test )\n{\n try { \n auto k1 = fc::ecc::private_key::generate().get_public_key();\n auto k2 = fc::ecc::private_key::generate().get_public_key();\n auto k3 = fc::ecc::private_key::generate().get_public_key();\n\n FC_ASSERT( public_key_type( std::string( public_key_type(k1) ) ) == k1);\n FC_ASSERT( public_key_type( std::string( public_key_type(k2) ) ) == k2);\n FC_ASSERT( public_key_type( std::string( public_key_type(k3) ) ) == k3);\n } catch ( const fc::exception& e )\n {\n elog( \"${e}\", (\"e\",e.to_detail_string()) );\n throw;\n }\n}\n\nBOOST_AUTO_TEST_CASE( wallet_tests )\n{\n try {\n fc::temp_directory my_dir;\n fc::temp_directory your_dir;\n chain_database_ptr my_blockchain = std::make_shared<chain_database>();\n my_blockchain->open( my_dir.path(), \"genesis.json\" );\n chain_database_ptr your_blockchain = std::make_shared<chain_database>();\n your_blockchain->open( your_dir.path(), \"genesis.json\" );\n std::string password = \"123456789\";\n\n wallet my_wallet( my_blockchain );\n my_wallet.set_data_directory( my_dir.path() );\n my_wallet.create( \"my_wallet\", password );\n my_wallet.unlock( password );\n wlog( \" closing wallet \" );\n my_wallet.close();\n my_wallet.open( \"my_wallet\" );\n my_wallet.unlock( password );\n\n auto result = my_wallet.create_account( \"my1\" );\n auto result2 = my_wallet.create_account( \"my2\" );\n ilog( \"my1: ${a}\", (\"a\",result) );\n ilog( \"my2: ${a}\", (\"a\",result2) );\n\n\n wallet your_wallet( your_blockchain );\n your_wallet.set_data_directory( your_dir.path() );\n your_wallet.create( \"your_wallet\", password );\n your_wallet.unlock( password );\n\n auto your_account2 = your_wallet.create_account( \"your1\" );\n auto your_account3 = your_wallet.create_account( \"your2\" );\n auto your_account4 = your_wallet.create_account( \"your4\" );\n ilog( \"your1: ${a}\", (\"a\",result) );\n ilog( \"your2: ${a}\", (\"a\",result2) );\n\n auto keys = fc::json::from_string( test_keys ).as<std::vector<fc::ecc::private_key> >();\n for( auto key: keys )\n {\n my_wallet.import_private_key( key, \"my1\" );\n }\n\n my_wallet.scan_state();\n\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n my_wallet.close();\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n my_wallet.open( \"my_wallet\" );\n ilog( \"Produce Next Block at: ${b}\", (\"b\",my_wallet.next_block_production_time() ) );\n\n ilog( \"balance: * ${b}\", (\"b\",my_wallet.get_balance() ) );\n ilog( \"balance: my1 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"my1\") ) );\n ilog( \"balance: my2 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"my2\") ) );\n\n wlog( \"adding your4..\\n\\n\" );\n my_wallet.add_contact_account( \"your4\", your_account4 );\n ilog( \"balance: your4 ${b}\", (\"b\",my_wallet.get_balance(\"XTS\", \"your4\") ) );\n\n \/\/my_wallet.scan_state();\n\n } catch ( const fc::exception& e )\n {\n elog( \"${e}\", (\"e\",e.to_detail_string() ) );\n throw;\n }\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"eval.h\"\n\nstd::tuple<std::vector<int>, std::vector<float>, unsigned>\npzg_wrapper(const bch &code, const std::vector<float> &b) {\n std::vector<int> hard;\n hard.reserve(b.size());\n std::transform(std::cbegin(b), std::cend(b), std::back_inserter(hard),\n [](const auto &bit) { return bit < 0; });\n auto b_corr = code.correct_peterson(hard);\n return std::make_tuple(b_corr, std::vector<float>(), 0);\n}\n\nstd::tuple<std::vector<int>, std::vector<float>, unsigned>\nbm_wrapper(const bch &code, const std::vector<float> &b) {\n std::vector<int> hard;\n hard.reserve(b.size());\n std::transform(std::cbegin(b), std::cend(b), std::back_inserter(hard),\n [](const auto &bit) { return bit < 0; });\n auto b_corr = code.correct_bm(hard);\n return std::make_tuple(b_corr, std::vector<float>(), 0);\n}\n\nstd::ostream &operator<<(std::ostream &os, const eval_object &e) {\n os << std::scientific;\n const double samples_ = e.samples;\n os << std::setprecision(12) << e.reconstruction_failures \/ samples_ << \" \";\n os << std::setprecision(12) << e.reconstruction_errors \/ samples_ << \" \";\n const auto wrong_words = e.reconstruction_failures + e.reconstruction_errors;\n os << std::setprecision(12) << wrong_words \/ samples_ << \" \";\n os << std::setprecision(12) << e.fk_corr \/ samples_ << \" \";\n os << std::setprecision(12) << e.bit_errors \/ (samples_ * e.n);\n return os;\n}\n\ndouble eval_object::ber() const { return bit_errors \/ (double)(samples * n); }\n\neval_object evaluate(std::mt19937 &generator, const decoder_t &decoder,\n const size_t samples, const float eb_n0, const unsigned n,\n const unsigned l, const unsigned fk) {\n const float R = (float)l \/ n;\n\n unsigned reconstruction_failures = 0;\n unsigned reconstruction_errors = 0;\n unsigned fk_corr = 0;\n unsigned bit_errors = 0;\n\n std::vector<float> b(n);\n std::normal_distribution<float> random(1.0, sigma(eb_n0, R));\n auto noise_gen = std::bind(std::ref(random), std::ref(generator));\n\n for (size_t sample = 0; sample < samples; sample++) {\n std::generate(std::begin(b), std::end(b), noise_gen);\n try {\n auto result = decoder(b);\n const auto &b_corr = std::get<0>(result);\n auto wrong_bits = std::count_if(std::cbegin(b_corr), std::cend(b_corr),\n [](const auto &bit) { return bit != 0; });\n if (wrong_bits) {\n reconstruction_errors++;\n bit_errors += wrong_bits;\n } else {\n auto d = std::count_if(std::cbegin(b), std::cend(b),\n [](const auto &bit) { return bit < 0; });\n if (d > fk)\n fk_corr++;\n }\n }\n catch (...) {\n reconstruction_failures++;\n bit_errors += n;\n }\n }\n\n return { eb_n0, reconstruction_failures, reconstruction_errors, fk_corr,\n bit_errors, samples, n };\n}\n\n<commit_msg>Catch decoding_failure instead of everything<commit_after>#include \"eval.h\"\n\nstd::tuple<std::vector<int>, std::vector<float>, unsigned>\npzg_wrapper(const bch &code, const std::vector<float> &b) {\n std::vector<int> hard;\n hard.reserve(b.size());\n std::transform(std::cbegin(b), std::cend(b), std::back_inserter(hard),\n [](const auto &bit) { return bit < 0; });\n auto b_corr = code.correct_peterson(hard);\n return std::make_tuple(b_corr, std::vector<float>(), 0);\n}\n\nstd::tuple<std::vector<int>, std::vector<float>, unsigned>\nbm_wrapper(const bch &code, const std::vector<float> &b) {\n std::vector<int> hard;\n hard.reserve(b.size());\n std::transform(std::cbegin(b), std::cend(b), std::back_inserter(hard),\n [](const auto &bit) { return bit < 0; });\n auto b_corr = code.correct_bm(hard);\n return std::make_tuple(b_corr, std::vector<float>(), 0);\n}\n\nstd::ostream &operator<<(std::ostream &os, const eval_object &e) {\n os << std::scientific;\n const double samples_ = e.samples;\n os << std::setprecision(12) << e.reconstruction_failures \/ samples_ << \" \";\n os << std::setprecision(12) << e.reconstruction_errors \/ samples_ << \" \";\n const auto wrong_words = e.reconstruction_failures + e.reconstruction_errors;\n os << std::setprecision(12) << wrong_words \/ samples_ << \" \";\n os << std::setprecision(12) << e.fk_corr \/ samples_ << \" \";\n os << std::setprecision(12) << e.bit_errors \/ (samples_ * e.n);\n return os;\n}\n\ndouble eval_object::ber() const { return bit_errors \/ (double)(samples * n); }\n\neval_object evaluate(std::mt19937 &generator, const decoder_t &decoder,\n const size_t samples, const float eb_n0, const unsigned n,\n const unsigned l, const unsigned fk) {\n const float R = (float)l \/ n;\n\n unsigned reconstruction_failures = 0;\n unsigned reconstruction_errors = 0;\n unsigned fk_corr = 0;\n unsigned bit_errors = 0;\n\n std::vector<float> b(n);\n std::normal_distribution<float> random(1.0, sigma(eb_n0, R));\n auto noise_gen = std::bind(std::ref(random), std::ref(generator));\n\n for (size_t sample = 0; sample < samples; sample++) {\n std::generate(std::begin(b), std::end(b), noise_gen);\n try {\n auto result = decoder(b);\n const auto &b_corr = std::get<0>(result);\n auto wrong_bits = std::count_if(std::cbegin(b_corr), std::cend(b_corr),\n [](const auto &bit) { return bit != 0; });\n if (wrong_bits) {\n reconstruction_errors++;\n bit_errors += wrong_bits;\n } else {\n auto d = std::count_if(std::cbegin(b), std::cend(b),\n [](const auto &bit) { return bit < 0; });\n if (d > fk)\n fk_corr++;\n }\n }\n catch (decoding_failure) {\n reconstruction_failures++;\n bit_errors += n;\n }\n }\n\n return { eb_n0, reconstruction_failures, reconstruction_errors, fk_corr,\n bit_errors, samples, n };\n}\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef __SNOW__EVENT_HH__\n#define __SNOW__EVENT_HH__\n\n#include \"config.hh\"\n#include \"renderer\/sgl.hh\"\n#include <snow\/math\/vec2.hh>\n#include <iomanip>\n#include <iostream>\n\n\nnamespace snow {\n\n\nenum event_flag_t : int\n{\n NULL_EVENTS = 0,\n KEY_EVENTS = 0x1 << 0,\n CHAR_EVENTS = 0x1 << 1,\n MOUSE_EVENTS = 0x1 << 2,\n MOUSE_MOVE_EVENTS = 0x1 << 3,\n MOUSE_SCROLL_EVENTS = 0x1 << 4,\n MOUSE_ENTER_EVENTS = 0x1 << 5,\n WINDOW_CLOSE_EVENTS = 0x1 << 6,\n WINDOW_FOCUS_EVENTS = 0x1 << 7,\n WINDOW_ICONIFY_EVENTS = 0x1 << 8,\n WINDOW_SIZE_EVENTS = 0x1 << 9,\n WINDOW_MOVE_EVENTS = 0x1 << 10,\n OPAQUE_EVENTS = 0x1 << 11,\n ALL_KEY_EVENTS = (KEY_EVENTS | CHAR_EVENTS),\n ALL_MOUSE_EVENTS = (MOUSE_EVENTS |\n MOUSE_MOVE_EVENTS |\n MOUSE_SCROLL_EVENTS |\n MOUSE_ENTER_EVENTS),\n ALL_WINDOW_EVENTS = (WINDOW_CLOSE_EVENTS |\n WINDOW_FOCUS_EVENTS |\n WINDOW_ICONIFY_EVENTS |\n WINDOW_SIZE_EVENTS |\n WINDOW_MOVE_EVENTS),\n ALL_EVENT_KINDS = (~NULL_EVENTS)\n};\n\n\nenum event_kind_t : int\n{\n NULL_EVENT = 0,\n KEY_EVENT,\n CHAR_EVENT,\n MOUSE_EVENT,\n MOUSE_MOVE_EVENT,\n MOUSE_SCROLL_EVENT,\n MOUSE_ENTER_EVENT,\n WINDOW_CLOSE_EVENT,\n WINDOW_FOCUS_EVENT,\n WINDOW_ICONIFY_EVENT,\n WINDOW_SIZE_EVENT,\n WINDOW_MOVE_EVENT,\n OPAQUE_EVENT,\n NET_EVENT,\n};\n\n\nS_EXPORT const string &event_kind_string(int kind);\n\n\nenum : int\n{\n EVENT_SENDER_WINDOW = -1,\n EVENT_SENDER_UNKNOWN = 0,\n EVENT_SENDER_NET = 1,\n};\n\n\n\nstruct S_EXPORT button_event_t {\n int button;\n int action;\n int mods;\n};\n\n\n\nstruct netevent_t;\n\nstruct S_EXPORT event_t\n{\n int sender_id;\n union {\n void *sender;\n GLFWwindow *window;\n };\n int kind;\n double time;\n union {\n button_event_t key; \/\/ KEY_EVENT\n int character; \/\/ CHAR_EVENT\n button_event_t mouse; \/\/ MOUSE_EVENT\n vec2d_t mouse_pos; \/\/ MOUSE_MOVE_EVENT\n vec2d_t scroll; \/\/ MOUSE_SCROLL_EVENT\n bool entered; \/\/ MOUSE_ENTER_EVENT\n bool focused; \/\/ WINDOW_FOCUS_EVENT\n bool iconified; \/\/ WINDOW_ICONIFY_EVENT\n vec2_t<int> window_size; \/\/ WINDOW_SIZE_EVENT\n vec2_t<int> window_pos; \/\/ WINDOW_MOVE_EVENT\n void * opaque; \/\/ OPAQUE_EVENT\n netevent_t * net;\n };\n\n \/\/ If you know the sender_id is valid for this\n template <typename T, int ID>\n constexpr T *cast_sender() const;\n};\n\n\n\ntemplate <typename T, int ID>\nconstexpr T *event_t::cast_sender() const\n{\n return (sender_id == ID ? (T *)sender : nullptr);\n}\n\n\n\ninline\nstd::ostream &operator << (std::ostream &out, const button_event_t &in)\n{\n return\n (out << \"{ button: \" << in.button\n << \", action: \" << (in.action == GLFW_PRESS\n ? \"GLFW_PRESS }\"\n : (in.action == GLFW_RELEASE\n ? \"GLFW_RELEASE }\"\n : \"GLFW_REPEAT }\")));\n}\n\n\n\ninline\nstd::ostream &operator << (std::ostream &out, const event_t &in)\n{\n out << \"{ window: \" << std::showbase << std::hex << (void*)in.window\n << \", kind: \" << event_kind_string(in.kind)\n << std::resetiosflags(~0);\n switch (in.kind) {\n case KEY_EVENT:\n out << \", key: \" << in.key;\n break;\n case MOUSE_EVENT:\n out << \", mouse: \" << in.mouse;\n break;\n case CHAR_EVENT:\n out << \", character: \" << in.character;\n break;\n case MOUSE_MOVE_EVENT:\n out << \", mouse_pos: \" << in.mouse_pos;\n break;\n case MOUSE_SCROLL_EVENT:\n out << \", scroll: \" << in.scroll;\n break;\n case MOUSE_ENTER_EVENT:\n out << \", entered: \" << std::boolalpha << in.entered;\n break;\n case WINDOW_FOCUS_EVENT:\n out << \", focused: \" << std::boolalpha << in.focused;\n break;\n case WINDOW_ICONIFY_EVENT:\n out << \", iconified: \" << std::boolalpha << in.iconified;\n break;\n case WINDOW_SIZE_EVENT:\n out << \", window_size: \" << in.window_size;\n break;\n case WINDOW_MOVE_EVENT:\n out << \", window_pos: \" << in.window_pos;\n break;\n case OPAQUE_EVENT:\n out << \", opaque: \" << std::showbase << std::hex << in.opaque;\n break;\n default: break;\n }\n return (out << \" }\");\n}\n\n\nGLFWwindow *main_window();\nvoid set_main_window(GLFWwindow *window);\n\n\n} \/\/ namespace snow\n\n#endif \/* end __SNOW__EVENT_HH__ include guard *\/\n<commit_msg>Add export tags. Need to do this for more stuff.<commit_after>#ifndef __SNOW__EVENT_HH__\n#define __SNOW__EVENT_HH__\n\n#include \"config.hh\"\n#include \"renderer\/sgl.hh\"\n#include <snow\/math\/vec2.hh>\n#include <iomanip>\n#include <iostream>\n\n\nnamespace snow {\n\n\nenum event_flag_t : int\n{\n NULL_EVENTS = 0,\n KEY_EVENTS = 0x1 << 0,\n CHAR_EVENTS = 0x1 << 1,\n MOUSE_EVENTS = 0x1 << 2,\n MOUSE_MOVE_EVENTS = 0x1 << 3,\n MOUSE_SCROLL_EVENTS = 0x1 << 4,\n MOUSE_ENTER_EVENTS = 0x1 << 5,\n WINDOW_CLOSE_EVENTS = 0x1 << 6,\n WINDOW_FOCUS_EVENTS = 0x1 << 7,\n WINDOW_ICONIFY_EVENTS = 0x1 << 8,\n WINDOW_SIZE_EVENTS = 0x1 << 9,\n WINDOW_MOVE_EVENTS = 0x1 << 10,\n OPAQUE_EVENTS = 0x1 << 11,\n ALL_KEY_EVENTS = (KEY_EVENTS | CHAR_EVENTS),\n ALL_MOUSE_EVENTS = (MOUSE_EVENTS |\n MOUSE_MOVE_EVENTS |\n MOUSE_SCROLL_EVENTS |\n MOUSE_ENTER_EVENTS),\n ALL_WINDOW_EVENTS = (WINDOW_CLOSE_EVENTS |\n WINDOW_FOCUS_EVENTS |\n WINDOW_ICONIFY_EVENTS |\n WINDOW_SIZE_EVENTS |\n WINDOW_MOVE_EVENTS),\n ALL_EVENT_KINDS = (~NULL_EVENTS)\n};\n\n\nenum event_kind_t : int\n{\n NULL_EVENT = 0,\n KEY_EVENT,\n CHAR_EVENT,\n MOUSE_EVENT,\n MOUSE_MOVE_EVENT,\n MOUSE_SCROLL_EVENT,\n MOUSE_ENTER_EVENT,\n WINDOW_CLOSE_EVENT,\n WINDOW_FOCUS_EVENT,\n WINDOW_ICONIFY_EVENT,\n WINDOW_SIZE_EVENT,\n WINDOW_MOVE_EVENT,\n OPAQUE_EVENT,\n NET_EVENT,\n};\n\n\nS_EXPORT const string &event_kind_string(int kind);\n\n\nenum : int\n{\n EVENT_SENDER_WINDOW = -1,\n EVENT_SENDER_UNKNOWN = 0,\n EVENT_SENDER_NET = 1,\n};\n\n\n\nstruct S_EXPORT button_event_t {\n int button;\n int action;\n int mods;\n};\n\n\n\nstruct netevent_t;\n\nstruct S_EXPORT event_t\n{\n int sender_id;\n union {\n void *sender;\n GLFWwindow *window;\n };\n int kind;\n double time;\n union {\n button_event_t key; \/\/ KEY_EVENT\n int character; \/\/ CHAR_EVENT\n button_event_t mouse; \/\/ MOUSE_EVENT\n vec2d_t mouse_pos; \/\/ MOUSE_MOVE_EVENT\n vec2d_t scroll; \/\/ MOUSE_SCROLL_EVENT\n bool entered; \/\/ MOUSE_ENTER_EVENT\n bool focused; \/\/ WINDOW_FOCUS_EVENT\n bool iconified; \/\/ WINDOW_ICONIFY_EVENT\n vec2_t<int> window_size; \/\/ WINDOW_SIZE_EVENT\n vec2_t<int> window_pos; \/\/ WINDOW_MOVE_EVENT\n void * opaque; \/\/ OPAQUE_EVENT\n netevent_t * net;\n };\n\n \/\/ If you know the sender_id is valid for this\n template <typename T, int ID>\n constexpr T *cast_sender() const;\n};\n\n\n\ntemplate <typename T, int ID>\nconstexpr T *event_t::cast_sender() const\n{\n return (sender_id == ID ? (T *)sender : nullptr);\n}\n\n\n\ninline\nstd::ostream &operator << (std::ostream &out, const button_event_t &in)\n{\n return\n (out << \"{ button: \" << in.button\n << \", action: \" << (in.action == GLFW_PRESS\n ? \"GLFW_PRESS }\"\n : (in.action == GLFW_RELEASE\n ? \"GLFW_RELEASE }\"\n : \"GLFW_REPEAT }\")));\n}\n\n\n\ninline\nstd::ostream &operator << (std::ostream &out, const event_t &in)\n{\n out << \"{ window: \" << std::showbase << std::hex << (void*)in.window\n << \", kind: \" << event_kind_string(in.kind)\n << std::resetiosflags(~0);\n switch (in.kind) {\n case KEY_EVENT:\n out << \", key: \" << in.key;\n break;\n case MOUSE_EVENT:\n out << \", mouse: \" << in.mouse;\n break;\n case CHAR_EVENT:\n out << \", character: \" << in.character;\n break;\n case MOUSE_MOVE_EVENT:\n out << \", mouse_pos: \" << in.mouse_pos;\n break;\n case MOUSE_SCROLL_EVENT:\n out << \", scroll: \" << in.scroll;\n break;\n case MOUSE_ENTER_EVENT:\n out << \", entered: \" << std::boolalpha << in.entered;\n break;\n case WINDOW_FOCUS_EVENT:\n out << \", focused: \" << std::boolalpha << in.focused;\n break;\n case WINDOW_ICONIFY_EVENT:\n out << \", iconified: \" << std::boolalpha << in.iconified;\n break;\n case WINDOW_SIZE_EVENT:\n out << \", window_size: \" << in.window_size;\n break;\n case WINDOW_MOVE_EVENT:\n out << \", window_pos: \" << in.window_pos;\n break;\n case OPAQUE_EVENT:\n out << \", opaque: \" << std::showbase << std::hex << in.opaque;\n break;\n default: break;\n }\n return (out << \" }\");\n}\n\n\nS_EXPORT GLFWwindow *main_window();\nS_EXPORT void set_main_window(GLFWwindow *window);\n\n\n} \/\/ namespace snow\n\n#endif \/* end __SNOW__EVENT_HH__ include guard *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace fs = boost::filesystem;\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(num_bytes > 0);\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1 || ret == 0)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(boost::filesystem::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(boost::filesystem::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<commit_msg>reverted last check-in<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/pch.hpp\"\n\n#ifdef _WIN32\n\/\/ windows part\n#include \"libtorrent\/utf8.hpp\"\n\n#include <io.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n\n#ifndef _MODE_T_\ntypedef int mode_t;\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n#else\n\/\/ unix part\n#define _FILE_OFFSET_BITS 64\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <errno.h>\n\n#include <boost\/static_assert.hpp>\n\/\/ make sure the _FILE_OFFSET_BITS define worked\n\/\/ on this platform\nBOOST_STATIC_ASSERT(sizeof(lseek(0, 0, 0)) >= 8);\n\n#endif\n\n#include <boost\/filesystem\/operations.hpp>\n#include \"libtorrent\/file.hpp\"\n#include <sstream>\n\n#ifndef O_BINARY\n#define O_BINARY 0\n#endif\n\n#ifndef O_RANDOM\n#define O_RANDOM 0\n#endif\n\n#ifdef UNICODE\n#include \"libtorrent\/storage.hpp\"\n#endif\n\n\nnamespace fs = boost::filesystem;\n\nnamespace\n{\n\tenum { mode_in = 1, mode_out = 2 };\n\n\tmode_t map_open_mode(int m)\n\t{\n\t\tif (m == (mode_in | mode_out)) return O_RDWR | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_out) return O_WRONLY | O_CREAT | O_BINARY | O_RANDOM;\n\t\tif (m == mode_in) return O_RDONLY | O_BINARY | O_RANDOM;\n\t\tassert(false);\n\t\treturn 0;\n\t}\n\n#ifdef WIN32\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\ttry\n\t\t{\n\t\t\tstd::wstring ws;\n\t\t\tlibtorrent::utf8_wchar(s, ws);\n\t\t\tstd::size_t size = wcstombs(0, ws.c_str(), 0);\n\t\t\tif (size == std::size_t(-1)) return s;\n\t\t\tstd::string ret;\n\t\t\tret.resize(size);\n\t\t\tsize = wcstombs(&ret[0], ws.c_str(), size + 1);\n\t\t\tif (size == wchar_t(-1)) return s;\n\t\t\tret.resize(size);\n\t\t\treturn ret;\n\t\t}\n\t\tcatch(std::exception)\n\t\t{\n\t\t\treturn s;\n\t\t}\n\t}\n#else\n\tstd::string utf8_native(std::string const& s)\n\t{\n\t\treturn s;\n\t}\n#endif\n\n}\n\nnamespace libtorrent\n{\n\n\tconst file::open_mode file::in(mode_in);\n\tconst file::open_mode file::out(mode_out);\n\n\tconst file::seek_mode file::begin(1);\n\tconst file::seek_mode file::end(2);\n\n\tstruct file::impl\n\t{\n\t\timpl()\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{}\n\n\t\timpl(fs::path const& path, int mode)\n\t\t\t: m_fd(-1)\n\t\t\t, m_open_mode(0)\n\t\t{\n\t\t\topen(path, mode);\n\t\t}\n\n\t\t~impl()\n\t\t{\n\t\t\tclose();\n\t\t}\n\n\t\tvoid open(fs::path const& path, int mode)\n\t\t{\n\t\t\tassert(path.is_complete());\n\t\t\tclose();\n#if defined(_WIN32) && defined(UNICODE)\n\t\t\tstd::wstring wpath(safe_convert(path.native_file_string()));\n\t\t\tm_fd = ::_wopen(\n\t\t\t\twpath.c_str()\n\t\t\t\t, map_open_mode(mode)\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n#ifdef _WIN32\n\t\t\tm_fd = ::_open(\n#else\n\t\t\tm_fd = ::open(\n#endif\n\t\t\t\tutf8_native(path.native_file_string()).c_str()\n\t\t\t\t, map_open_mode(mode)\n#ifdef _WIN32\n\t\t\t\t, S_IREAD | S_IWRITE);\n#else\n\t\t\t\t, S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH);\n#endif\n#endif\n\t\t\tif (m_fd == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"open failed: '\" << path.native_file_string() << \"'. \"\n\t\t\t\t\t<< strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\tm_open_mode = mode;\n\t\t}\n\n\t\tvoid close()\n\t\t{\n\t\t\tif (m_fd == -1) return;\n\n#ifdef _WIN32\n\t\t\t::_close(m_fd);\n#else\n\t\t\t::close(m_fd);\n#endif\n\t\t\tm_fd = -1;\n\t\t\tm_open_mode = 0;\n\t\t}\n\n\t\tsize_type read(char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_in);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_read(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::read(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"read failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type write(const char* buf, size_type num_bytes)\n\t\t{\n\t\t\tassert(m_open_mode & mode_out);\n\t\t\tassert(m_fd != -1);\n\n\t\t\t\/\/ TODO: Test this a bit more, what happens with random failures in\n\t\t\t\/\/ the files?\n\/\/\t\t\tif ((rand() % 100) > 80)\n\/\/\t\t\t\tthrow file_error(\"debug\");\n\n#ifdef _WIN32\n\t\t\tsize_type ret = ::_write(m_fd, buf, num_bytes);\n#else\n\t\t\tsize_type ret = ::write(m_fd, buf, num_bytes);\n#endif\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"write failed: \" << strerror(errno);\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type seek(size_type offset, int m)\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n\t\t\tint seekdir = (m == 1)?SEEK_SET:SEEK_END;\n#ifdef _WIN32\n\t\t\tsize_type ret = _lseeki64(m_fd, offset, seekdir);\n#else\n\t\t\tsize_type ret = lseek(m_fd, offset, seekdir);\n#endif\n\n\t\t\t\/\/ For some strange reason this fails\n\t\t\t\/\/ on win32. Use windows specific file\n\t\t\t\/\/ wrapper instead.\n\t\t\tif (ret == -1)\n\t\t\t{\n\t\t\t\tstd::stringstream msg;\n\t\t\t\tmsg << \"seek failed: '\" << strerror(errno)\n\t\t\t\t\t<< \"' fd: \" << m_fd\n\t\t\t\t\t<< \" offset: \" << offset\n\t\t\t\t\t<< \" seekdir: \" << seekdir;\n\t\t\t\tthrow file_error(msg.str());\n\t\t\t}\n\t\t\treturn ret;\n\t\t}\n\n\t\tsize_type tell()\n\t\t{\n\t\t\tassert(m_open_mode);\n\t\t\tassert(m_fd != -1);\n\n#ifdef _WIN32\n\t\t\treturn _telli64(m_fd);\n#else\n\t\t\treturn lseek(m_fd, 0, SEEK_CUR);\n#endif\n\t\t}\n\n\t\tint m_fd;\n\t\tint m_open_mode;\n\t};\n\n\t\/\/ pimpl forwardings\n\n\tfile::file() : m_impl(new impl()) {}\n\n\tfile::file(boost::filesystem::path const& p, file::open_mode m)\n\t\t: m_impl(new impl(p, m.m_mask))\n\t{}\n\n\tfile::~file() {}\n\n\tvoid file::open(boost::filesystem::path const& p, file::open_mode m)\n\t{\n\t\tm_impl->open(p, m.m_mask);\n\t}\n\n\tvoid file::close()\n\t{\n\t\tm_impl->close();\n\t}\n\n\tsize_type file::write(const char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->write(buf, num_bytes);\n\t}\n\n\tsize_type file::read(char* buf, size_type num_bytes)\n\t{\n\t\treturn m_impl->read(buf, num_bytes);\n\t}\n\n\tsize_type file::seek(size_type pos, file::seek_mode m)\n\t{\n\t\treturn m_impl->seek(pos, m.m_val);\n\t}\n\n\tsize_type file::tell()\n\t{\n\t\treturn m_impl->tell();\n\t}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <mruby.h>\n\n#include <Fl\/Fl.h>\n#include <Fl\/Fl_draw.h>\n\n#include \"macros.h\"\n#include \"helpers.h\"\n\n\/\/ FLTK.font_name\n\/\/ mrb_value\n\/\/ mrb_fltk_font_name_module_method( mrb_state *mrb, mrb_value self ) {\n\/\/ mrb_value i;\n\/\/ mrb_get_args( mrb, \"i\", &i );\n\/\/\n\/\/ int font_type = 0;\n\/\/\n\/\/ const char *name = Fl::get_font_name( (Fl::Font)mrb_fixnum( i ), &font_type );\n\/\/\n\/\/ return name ? mrb_str_new_cstr( mrb, name ) : mrb_nil_value();\n\/\/ }\n\n\/\/ FLTK.fl_height\n\/\/ mrb_value mrb_fltk_fl_height_module_method( mrb_state *mrb, mrb_value self ) {\n\/\/ mrb_value font_name, font_size;\n\/\/ mrb_get_args( mrb, \"ii\", &font_name, &font_size );\n\/\/\n\/\/ int result = fl_font( mrb_fixnum( font_name ), mrb_fixnum( font_size ) );\n\/\/\n\/\/ return mrb_fixnum_value( result );\n\/\/ }\n\n\/\/ FLTK.run\nmrb_value mrb_fltk_run_module_method( mrb_state *mrb, mrb_value self ) {\n return mrb_fixnum_value( Fl::run() );\n}\n\nvoid mrb_fltk_module_init( mrb_state *mrb ) {\n ARENA_SAVE;\n\n struct RClass *mrb_fltk_module = mrb_define_module( mrb, \"FLTK\" );\n\n \/\/ Fl_Align\n DEFINE_FIXNUM_CONSTANT( ALIGN_CENTER, FL_ALIGN_CENTER, mrb_fltk_module ); \/\/ Align the label horizontally in the middle.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP, FL_ALIGN_TOP, mrb_fltk_module ); \/\/ Align the label at the top of the widget. Inside labels appear below the top, outside labels are drawn on top of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM, FL_ALIGN_BOTTOM, mrb_fltk_module ); \/\/ Align the label at the bottom of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT, FL_ALIGN_LEFT, mrb_fltk_module ); \/\/ Align the label at the left of the widget. Inside labels appear left-justified starting at the left side of the widget, outside labels are right-justified and drawn to the left of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT, FL_ALIGN_RIGHT, mrb_fltk_module ); \/\/ Align the label to the right of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_INSIDE, FL_ALIGN_INSIDE, mrb_fltk_module ); \/\/ Draw the label inside of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TEXT_OVER_IMAGE, FL_ALIGN_TEXT_OVER_IMAGE, mrb_fltk_module ); \/\/ If the label contains an image, draw the text on top of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_OVER_TEXT, FL_ALIGN_IMAGE_OVER_TEXT, mrb_fltk_module ); \/\/ If the label contains an image, draw the text below the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_CLIP, FL_ALIGN_CLIP, mrb_fltk_module ); \/\/ All parts of the label that are lager than the widget will not be drawn .\n DEFINE_FIXNUM_CONSTANT( ALIGN_WRAP, FL_ALIGN_WRAP, mrb_fltk_module ); \/\/ Wrap text that does not fit the width of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_NEXT_TO_TEXT, FL_ALIGN_IMAGE_NEXT_TO_TEXT, mrb_fltk_module ); \/\/ If the label contains an image, draw the text to the right of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TEXT_NEXT_TO_IMAGE, FL_ALIGN_TEXT_NEXT_TO_IMAGE, mrb_fltk_module ); \/\/ If the label contains an image, draw the text to the left of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_BACKDROP, FL_ALIGN_IMAGE_BACKDROP, mrb_fltk_module ); \/\/ If the label contains an image, draw the image or deimage in the background.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP_LEFT, FL_ALIGN_TOP_LEFT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP_RIGHT, FL_ALIGN_TOP_RIGHT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM_LEFT, FL_ALIGN_BOTTOM_LEFT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM_RIGHT, FL_ALIGN_BOTTOM_RIGHT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT_TOP, FL_ALIGN_LEFT_TOP, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT_TOP, FL_ALIGN_RIGHT_TOP, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT_BOTTOM, FL_ALIGN_LEFT_BOTTOM, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT_BOTTOM, FL_ALIGN_RIGHT_BOTTOM, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_NOWRAP, FL_ALIGN_NOWRAP, mrb_fltk_module ); \/\/ for back compatibility\n DEFINE_FIXNUM_CONSTANT( ALIGN_POSITION_MASK, FL_ALIGN_POSITION_MASK, mrb_fltk_module ); \/\/ left, right, top, bottom\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_MASK, FL_ALIGN_IMAGE_MASK, mrb_fltk_module ); \/\/ l\/r, t\/b, backdrop\n\n \/\/ Fl_Font\n DEFINE_FIXNUM_CONSTANT( HELVETICA, FL_HELVETICA, mrb_fltk_module ); \/\/ Helvetica (or Arial) normal (0)\n DEFINE_FIXNUM_CONSTANT( HELVETICA_BOLD, FL_HELVETICA_BOLD, mrb_fltk_module ); \/\/ Helvetica (or Arial) bold\n DEFINE_FIXNUM_CONSTANT( HELVETICA_ITALIC, FL_HELVETICA_ITALIC, mrb_fltk_module ); \/\/ Helvetica (or Arial) oblique\n DEFINE_FIXNUM_CONSTANT( HELVETICA_BOLD_ITALIC, FL_HELVETICA_BOLD_ITALIC, mrb_fltk_module ); \/\/ Helvetica (or Arial) bold-oblique\n DEFINE_FIXNUM_CONSTANT( COURIER, FL_COURIER, mrb_fltk_module ); \/\/ Courier normal\n DEFINE_FIXNUM_CONSTANT( COURIER_BOLD, FL_COURIER_BOLD, mrb_fltk_module ); \/\/ Courier bold\n DEFINE_FIXNUM_CONSTANT( COURIER_ITALIC, FL_COURIER_ITALIC, mrb_fltk_module ); \/\/ Courier italic\n DEFINE_FIXNUM_CONSTANT( COURIER_BOLD_ITALIC, FL_COURIER_BOLD_ITALIC, mrb_fltk_module ); \/\/ Courier bold-italic\n DEFINE_FIXNUM_CONSTANT( TIMES, FL_TIMES, mrb_fltk_module ); \/\/ Times roman\n DEFINE_FIXNUM_CONSTANT( TIMES_BOLD, FL_TIMES_BOLD, mrb_fltk_module ); \/\/ Times roman bold\n DEFINE_FIXNUM_CONSTANT( TIMES_ITALIC, FL_TIMES_ITALIC, mrb_fltk_module ); \/\/ Times roman italic\n DEFINE_FIXNUM_CONSTANT( TIMES_BOLD_ITALIC, FL_TIMES_BOLD_ITALIC, mrb_fltk_module ); \/\/ Times roman bold-italic\n DEFINE_FIXNUM_CONSTANT( SYMBOL, FL_SYMBOL, mrb_fltk_module ); \/\/ Standard symbol font\n DEFINE_FIXNUM_CONSTANT( SCREEN, FL_SCREEN, mrb_fltk_module ); \/\/ Default monospaced screen font\n DEFINE_FIXNUM_CONSTANT( SCREEN_BOLD, FL_SCREEN_BOLD, mrb_fltk_module ); \/\/ Default monospaced bold screen font\n DEFINE_FIXNUM_CONSTANT( ZAPF_DINGBATS, FL_ZAPF_DINGBATS, mrb_fltk_module ); \/\/ Zapf-dingbats font\n DEFINE_FIXNUM_CONSTANT( FREE_FONT, FL_FREE_FONT, mrb_fltk_module ); \/\/ first one to allocate\n DEFINE_FIXNUM_CONSTANT( BOLD, FL_BOLD, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n DEFINE_FIXNUM_CONSTANT( ITALIC, FL_ITALIC, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n DEFINE_FIXNUM_CONSTANT( BOLD_ITALIC, FL_BOLD_ITALIC, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n\n \/\/ Fl_When\n DEFINE_FIXNUM_CONSTANT( WHEN_NEVER, FL_WHEN_NEVER, mrb_fltk_module ); \/\/ Never call the callback.\n DEFINE_FIXNUM_CONSTANT( WHEN_CHANGED, FL_WHEN_CHANGED, mrb_fltk_module ); \/\/ Do the callback only when the widget value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_NOT_CHANGED, FL_WHEN_NOT_CHANGED, mrb_fltk_module ); \/\/ Do the callback whenever the user interacts with the widget.\n DEFINE_FIXNUM_CONSTANT( WHEN_RELEASE, FL_WHEN_RELEASE, mrb_fltk_module ); \/\/ Do the callback when the button or key is released and the value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_RELEASE_ALWAYS, FL_WHEN_RELEASE_ALWAYS, mrb_fltk_module ); \/\/ Do the callback when the button or key is released, even if the value doesn't change.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY, FL_WHEN_ENTER_KEY, mrb_fltk_module ); \/\/ Do the callback when the user presses the ENTER key and the value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY_ALWAYS, FL_WHEN_ENTER_KEY_ALWAYS, mrb_fltk_module ); \/\/ Do the callback when the user presses the ENTER key, even if the value doesn't change.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY_CHANGED, FL_WHEN_ENTER_KEY_CHANGED, mrb_fltk_module ); \/\/ ?\n\n \/\/ Fl_Event\n DEFINE_FIXNUM_CONSTANT( NO_EVENT, FL_NO_EVENT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( PUSH, FL_PUSH, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( RELEASE, FL_RELEASE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ENTER, FL_ENTER, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( LEAVE, FL_LEAVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DRAG, FL_DRAG, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( FOCUS, FL_FOCUS, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( UNFOCUS, FL_UNFOCUS, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYDOWN, FL_KEYDOWN, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYBOARD, FL_KEYBOARD, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYUP, FL_KEYUP, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( CLOSE, FL_CLOSE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( MOVE, FL_MOVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SHORTCUT, FL_SHORTCUT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DEACTIVATE, FL_DEACTIVATE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ACTIVATE, FL_ACTIVATE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( HIDE, FL_HIDE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SHOW, FL_SHOW, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( PASTE, FL_PASTE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SELECTIONCLEAR, FL_SELECTIONCLEAR, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( MOUSEWHEEL, FL_MOUSEWHEEL, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_ENTER, FL_DND_ENTER, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_DRAG, FL_DND_DRAG, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_LEAVE, FL_DND_LEAVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_RELEASE, FL_DND_RELEASE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SCREEN_CONFIGURATION_CHANGED, FL_SCREEN_CONFIGURATION_CHANGED, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( FULLSCREEN, FL_FULLSCREEN, mrb_fltk_module );\n\n \/\/ DEFINE_MODULE_METHOD( root, font_name, MRB_ARGS_REQ( 1 ) );\n mrb_define_module_function( mrb, mrb_fltk_module, \"run\", mrb_fltk_run_module_method, MRB_ARGS_NONE() );\n \/\/ DEFINE_MODULE_METHOD( root, set_fonts, MRB_ARGS_REQ( 1 ) );\n\n ARENA_RESTORE;\n}\n<commit_msg>FLTK.event_key<commit_after>#include <mruby.h>\n\n#include <Fl\/Fl.h>\n#include <Fl\/Fl_draw.h>\n\n#include \"macros.h\"\n#include \"helpers.h\"\n\n\/\/ FLTK.event_key(key=nil)\n\/\/ Gets which key on the keyboard was last pushed.\n\/\/ If a key is given, returns true if the given key was held down (or pressed) during the last event.\nmrb_value mrb_fltk_event_key_module_method( mrb_state *mrb, mrb_value self ) {\n mrb_value key;\n mrb_get_args( mrb, \"i\", &key );\n\n if( mrb_nil_p( key ) ) {\n return mrb_fixnum_value( Fl::event_key() );\n } else {\n if( Fl::event_key( mrb_fixnum( key ) ) ) {\n return mrb_true_value();\n } else {\n return mrb_false_value();\n }\n }\n}\n\n\/\/ FLTK.run\nmrb_value mrb_fltk_run_module_method( mrb_state *mrb, mrb_value self ) {\n return mrb_fixnum_value( Fl::run() );\n}\n\nvoid mrb_fltk_module_init( mrb_state *mrb ) {\n ARENA_SAVE;\n\n struct RClass *mrb_fltk_module = mrb_define_module( mrb, \"FLTK\" );\n\n \/\/ Fl_Align\n DEFINE_FIXNUM_CONSTANT( ALIGN_CENTER, FL_ALIGN_CENTER, mrb_fltk_module ); \/\/ Align the label horizontally in the middle.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP, FL_ALIGN_TOP, mrb_fltk_module ); \/\/ Align the label at the top of the widget. Inside labels appear below the top, outside labels are drawn on top of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM, FL_ALIGN_BOTTOM, mrb_fltk_module ); \/\/ Align the label at the bottom of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT, FL_ALIGN_LEFT, mrb_fltk_module ); \/\/ Align the label at the left of the widget. Inside labels appear left-justified starting at the left side of the widget, outside labels are right-justified and drawn to the left of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT, FL_ALIGN_RIGHT, mrb_fltk_module ); \/\/ Align the label to the right of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_INSIDE, FL_ALIGN_INSIDE, mrb_fltk_module ); \/\/ Draw the label inside of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TEXT_OVER_IMAGE, FL_ALIGN_TEXT_OVER_IMAGE, mrb_fltk_module ); \/\/ If the label contains an image, draw the text on top of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_OVER_TEXT, FL_ALIGN_IMAGE_OVER_TEXT, mrb_fltk_module ); \/\/ If the label contains an image, draw the text below the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_CLIP, FL_ALIGN_CLIP, mrb_fltk_module ); \/\/ All parts of the label that are lager than the widget will not be drawn .\n DEFINE_FIXNUM_CONSTANT( ALIGN_WRAP, FL_ALIGN_WRAP, mrb_fltk_module ); \/\/ Wrap text that does not fit the width of the widget.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_NEXT_TO_TEXT, FL_ALIGN_IMAGE_NEXT_TO_TEXT, mrb_fltk_module ); \/\/ If the label contains an image, draw the text to the right of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TEXT_NEXT_TO_IMAGE, FL_ALIGN_TEXT_NEXT_TO_IMAGE, mrb_fltk_module ); \/\/ If the label contains an image, draw the text to the left of the image.\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_BACKDROP, FL_ALIGN_IMAGE_BACKDROP, mrb_fltk_module ); \/\/ If the label contains an image, draw the image or deimage in the background.\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP_LEFT, FL_ALIGN_TOP_LEFT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_TOP_RIGHT, FL_ALIGN_TOP_RIGHT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM_LEFT, FL_ALIGN_BOTTOM_LEFT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_BOTTOM_RIGHT, FL_ALIGN_BOTTOM_RIGHT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT_TOP, FL_ALIGN_LEFT_TOP, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT_TOP, FL_ALIGN_RIGHT_TOP, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_LEFT_BOTTOM, FL_ALIGN_LEFT_BOTTOM, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_RIGHT_BOTTOM, FL_ALIGN_RIGHT_BOTTOM, mrb_fltk_module ); \/\/ magic value\n DEFINE_FIXNUM_CONSTANT( ALIGN_NOWRAP, FL_ALIGN_NOWRAP, mrb_fltk_module ); \/\/ for back compatibility\n DEFINE_FIXNUM_CONSTANT( ALIGN_POSITION_MASK, FL_ALIGN_POSITION_MASK, mrb_fltk_module ); \/\/ left, right, top, bottom\n DEFINE_FIXNUM_CONSTANT( ALIGN_IMAGE_MASK, FL_ALIGN_IMAGE_MASK, mrb_fltk_module ); \/\/ l\/r, t\/b, backdrop\n\n \/\/ Fl_Font\n DEFINE_FIXNUM_CONSTANT( HELVETICA, FL_HELVETICA, mrb_fltk_module ); \/\/ Helvetica (or Arial) normal (0)\n DEFINE_FIXNUM_CONSTANT( HELVETICA_BOLD, FL_HELVETICA_BOLD, mrb_fltk_module ); \/\/ Helvetica (or Arial) bold\n DEFINE_FIXNUM_CONSTANT( HELVETICA_ITALIC, FL_HELVETICA_ITALIC, mrb_fltk_module ); \/\/ Helvetica (or Arial) oblique\n DEFINE_FIXNUM_CONSTANT( HELVETICA_BOLD_ITALIC, FL_HELVETICA_BOLD_ITALIC, mrb_fltk_module ); \/\/ Helvetica (or Arial) bold-oblique\n DEFINE_FIXNUM_CONSTANT( COURIER, FL_COURIER, mrb_fltk_module ); \/\/ Courier normal\n DEFINE_FIXNUM_CONSTANT( COURIER_BOLD, FL_COURIER_BOLD, mrb_fltk_module ); \/\/ Courier bold\n DEFINE_FIXNUM_CONSTANT( COURIER_ITALIC, FL_COURIER_ITALIC, mrb_fltk_module ); \/\/ Courier italic\n DEFINE_FIXNUM_CONSTANT( COURIER_BOLD_ITALIC, FL_COURIER_BOLD_ITALIC, mrb_fltk_module ); \/\/ Courier bold-italic\n DEFINE_FIXNUM_CONSTANT( TIMES, FL_TIMES, mrb_fltk_module ); \/\/ Times roman\n DEFINE_FIXNUM_CONSTANT( TIMES_BOLD, FL_TIMES_BOLD, mrb_fltk_module ); \/\/ Times roman bold\n DEFINE_FIXNUM_CONSTANT( TIMES_ITALIC, FL_TIMES_ITALIC, mrb_fltk_module ); \/\/ Times roman italic\n DEFINE_FIXNUM_CONSTANT( TIMES_BOLD_ITALIC, FL_TIMES_BOLD_ITALIC, mrb_fltk_module ); \/\/ Times roman bold-italic\n DEFINE_FIXNUM_CONSTANT( SYMBOL, FL_SYMBOL, mrb_fltk_module ); \/\/ Standard symbol font\n DEFINE_FIXNUM_CONSTANT( SCREEN, FL_SCREEN, mrb_fltk_module ); \/\/ Default monospaced screen font\n DEFINE_FIXNUM_CONSTANT( SCREEN_BOLD, FL_SCREEN_BOLD, mrb_fltk_module ); \/\/ Default monospaced bold screen font\n DEFINE_FIXNUM_CONSTANT( ZAPF_DINGBATS, FL_ZAPF_DINGBATS, mrb_fltk_module ); \/\/ Zapf-dingbats font\n DEFINE_FIXNUM_CONSTANT( FREE_FONT, FL_FREE_FONT, mrb_fltk_module ); \/\/ first one to allocate\n DEFINE_FIXNUM_CONSTANT( BOLD, FL_BOLD, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n DEFINE_FIXNUM_CONSTANT( ITALIC, FL_ITALIC, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n DEFINE_FIXNUM_CONSTANT( BOLD_ITALIC, FL_BOLD_ITALIC, mrb_fltk_module ); \/\/ add this to helvetica, courier, or times\n\n \/\/ Fl_When\n DEFINE_FIXNUM_CONSTANT( WHEN_NEVER, FL_WHEN_NEVER, mrb_fltk_module ); \/\/ Never call the callback.\n DEFINE_FIXNUM_CONSTANT( WHEN_CHANGED, FL_WHEN_CHANGED, mrb_fltk_module ); \/\/ Do the callback only when the widget value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_NOT_CHANGED, FL_WHEN_NOT_CHANGED, mrb_fltk_module ); \/\/ Do the callback whenever the user interacts with the widget.\n DEFINE_FIXNUM_CONSTANT( WHEN_RELEASE, FL_WHEN_RELEASE, mrb_fltk_module ); \/\/ Do the callback when the button or key is released and the value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_RELEASE_ALWAYS, FL_WHEN_RELEASE_ALWAYS, mrb_fltk_module ); \/\/ Do the callback when the button or key is released, even if the value doesn't change.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY, FL_WHEN_ENTER_KEY, mrb_fltk_module ); \/\/ Do the callback when the user presses the ENTER key and the value changes.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY_ALWAYS, FL_WHEN_ENTER_KEY_ALWAYS, mrb_fltk_module ); \/\/ Do the callback when the user presses the ENTER key, even if the value doesn't change.\n DEFINE_FIXNUM_CONSTANT( WHEN_ENTER_KEY_CHANGED, FL_WHEN_ENTER_KEY_CHANGED, mrb_fltk_module ); \/\/ ?\n\n \/\/ Fl_Event\n DEFINE_FIXNUM_CONSTANT( NO_EVENT, FL_NO_EVENT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( PUSH, FL_PUSH, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( RELEASE, FL_RELEASE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ENTER, FL_ENTER, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( LEAVE, FL_LEAVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DRAG, FL_DRAG, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( FOCUS, FL_FOCUS, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( UNFOCUS, FL_UNFOCUS, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYDOWN, FL_KEYDOWN, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYBOARD, FL_KEYBOARD, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( KEYUP, FL_KEYUP, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( CLOSE, FL_CLOSE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( MOVE, FL_MOVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SHORTCUT, FL_SHORTCUT, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DEACTIVATE, FL_DEACTIVATE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( ACTIVATE, FL_ACTIVATE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( HIDE, FL_HIDE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SHOW, FL_SHOW, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( PASTE, FL_PASTE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SELECTIONCLEAR, FL_SELECTIONCLEAR, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( MOUSEWHEEL, FL_MOUSEWHEEL, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_ENTER, FL_DND_ENTER, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_DRAG, FL_DND_DRAG, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_LEAVE, FL_DND_LEAVE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( DND_RELEASE, FL_DND_RELEASE, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( SCREEN_CONFIGURATION_CHANGED, FL_SCREEN_CONFIGURATION_CHANGED, mrb_fltk_module );\n DEFINE_FIXNUM_CONSTANT( FULLSCREEN, FL_FULLSCREEN, mrb_fltk_module );\n\n \/\/ DEFINE_MODULE_METHOD( root, font_name, MRB_ARGS_REQ( 1 ) );\n mrb_define_module_function( mrb, mrb_fltk_module, \"run\", mrb_fltk_run_module_method, MRB_ARGS_NONE() );\n \/\/ DEFINE_MODULE_METHOD( root, set_fonts, MRB_ARGS_REQ( 1 ) );\n\n ARENA_RESTORE;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"game.h\"\n#include \"util.h\"\n#include <iostream>\n#include <string>\n#include \"macros.h\"\n#include \"perlin.h\"\n#include <sstream>\nusing namespace std;\n\nint floeIndex = 0;\nset<pair<int, int> > addedPositions;\nvoid addFloes(Game* game);\n\nvoid Game::init(sf::RenderWindow* window){\n\tthis->window = window;\n\tcenter = V2f(0, 0);\n\tscreenCenter = V2f(400, 300);\n\n\tplayer = new Player(0);\n\tover = 0;\n\tfloeIndex = 0;\n\tscore = 0;\n\n\tloadTexture(waterTexture, \"res\/img\/water.png\");\n\twaterTexture.setRepeated(true);\n\twater.setTexture(waterTexture);\n\t\/\/water.setTextureRect(sf::IntRect(0, 0, 800, 600));\n\n\tloadSoundBuffer(penguinDeathBuffer, \"res\/sound\/bird.ogg\");\n\tpenguinDeath.setBuffer(penguinDeathBuffer);\n\n\tloadSoundBuffer(chompBuffer, \"res\/sound\/chomp.ogg\");\n\tchomp.setBuffer(chompBuffer);\n\n\taddedPositions.insert({0, 0});\n\ticefloes[floeIndex] = new Icefloe(sf::Vector2f(0.0f, 0.0f), floeIndex);\n\tfloeIndex++;\n}\n\nvoid Game::cleanup() {\n\tdelete player;\n\n\tfor (Penguin* penguin : penguins)\n\t\tdelete penguin;\n\tpenguins.clear();\n\n\tfor (auto floe : icefloes)\n\t\tdelete floe.second;\n\ticefloes.clear();\n\n\tfor (auto bloodSplash : bloodSplashes)\n\t\tdelete bloodSplash;\n\tbloodSplashes.clear();\n\n\taddedPositions.clear();\n}\n\nPerlin perlin;\nfloat perlinh = 0;\n\nvoid Game::update(float dt){\n\tperlinh += dt;\n\tthis->dt = dt;\n\n\n\taddFloes(this);\n\n\tfor (int i = 0; i < (int)penguins.size(); i++) {\n\t\tif (icefloes.find(penguins[i]->icefloe) == icefloes.end()){\n\t\t\tpenguins.erase(penguins.begin() + i);\n\t\t\ti--;\n\t\t\tcontinue;\n\t\t}\n\t\tpenguins[i]->update(this);\n\n\t\tfloat eatingDistance = 50.0f;\n\n\t\tif (dist(player->getRealMouthPos(this), penguins[i]->getRealPos(this)) < eatingDistance * 1.5f && chomp.getStatus() != sf::SoundSource::Status::Playing) {\n\t\t\tchomp.play();\n\t\t}\n\t\tif (dist(player->getRealMouthPos(this), penguins[i]->getRealPos(this)) < eatingDistance) {\n\t\t\taddBloodAt(penguins[i]->getRealPos(this));\t\t\t\n\t\t\tdelete penguins[i];\n\t\t\tpenguins.erase(penguins.begin() + i);\n\t\t\ti--;\n\t\t\tpenguinDeath.play();\n\t\t\t\n\t\t\tscore ++;\n\t\t}\n\t}\n\n\tfor (size_t i = 0; i < bloodSplashes.size(); i++) {\n\t\tbloodSplashes[i]->update(dt);\n\t\tif (!bloodSplashes[i]->stillAlive) {\n\t\t\tdelete bloodSplashes[i];\n\t\t\tbloodSplashes.erase(bloodSplashes.begin() + i);\n\t\t\t--i;\n\t\t}\n\t}\n\n\tplayer->update(this);\n\tfor (auto icefloe : icefloes)\n\t\ticefloe.second->update(this);\n\n\tcenter = player->getRealPos(this);\n}\n\nbool fontloaded = 0;\nsf::Font font;\nvoid loadFont(){\n\tif (fontloaded)\n\t\treturn;\n\tfontloaded = 1;\n\tfont.loadFromFile(\"res\/fonts\/arial.ttf\");\n}\n\nvoid Game::render(){\n\t\/*float wstep = 10;\n\tperlin.scale = 0.1;\n\tfor(float x = 0; x < 800; x += wstep)\n\t\tfor(float y = 0; y < 600; y += wstep) {\n\t\t\tsf::Color col(0, 0, 120+perlin.perlAt(V3f(x, y, perlinh))*50);\n\t\t\tsf::RectangleShape shape;\n\t\t\tshape.setSize(V2f(wstep, wstep));\n\t\t\tshape.setPosition(V2f(x, y));\n\t\t\tshape.setFillColor(col);\n\t\t\twindow->draw(shape);\n\t\t}*\/\n\n\tint w_width = waterTexture.getSize().x, w_height = waterTexture.getSize().y;\n\tint wx = ((int(center.x)\/w_width)*w_width-int(center.x))%w_width-w_width;\n\tint wy = ((int(center.y)\/w_height)*w_height-int(center.y))%w_height-w_height;\n\tfor(int x = wx; x <= wx+800*2+w_width; x += w_width)\n\t\tfor(int y = wy; y <= wy+600*2+w_height; y += w_height)\n\t\t\twater.setPosition(V2f(x, y)), window->draw(water);\n\n\tfor (auto icefloe : icefloes)\n\t\ticefloe.second->render(this);\n\tfor (auto penguin : penguins)\n\t\tpenguin->render(this);\n\tfor (auto bloodSplash : bloodSplashes) {\n\t\tbloodSplash->setPosition(-center + screenCenter);\n\t\twindow->draw(*bloodSplash);\n\t}\n\n\tplayer->render(this);\n\n\tif (score != 0){\n\t\tstringstream ss;\n\t\tss << \" \" << score << \" penguins eaten.\";\n\t\tloadFont();\n\t\tsf::Text text(ss.str(), font, 30);\n\t\ttext.setPosition(V2f(1, 1));\n\t\ttext.setColor(sf::Color::Black);\n\t\twindow->draw(text);\n\t\ttext.setPosition(V2f(0, 0));\n\t\ttext.setColor(sf::Color::White);\n\t\twindow->draw(text);\n\t}\n}\n\nvoid Game::addPenguinOnFloe(int floe) {\n\tPenguin* penguin = new Penguin(floe);\n\tpenguins.push_back(penguin);\n}\n\nvoid Game::addBloodAt(sf::Vector2f pos) {\n\tbloodSplashes.push_back(new ParticleSystem(100, ParticleMode::Explosion, \"res\/img\/blood.png\", pos));\n}\n\n\n\nfloat sectionSize = 150;\nfloat minDist = 1000, maxDist = 2000;\n\nvoid addFloes(Game* game){\n\tV2f ppos = game->player->getRealPos(game);\n\tint rx = int(ppos.x\/sectionSize), ry = int(ppos.y\/sectionSize), margin = 10;\n\trep(x, rx-margin, rx+margin) {\n\t\trep(y, ry-margin, ry+margin) {\n\t\t\tpair<int, int> pos = {x, y};\n\t\t\tif (addedPositions.find(pos) != addedPositions.end())\n\t\t\t\tcontinue;\n\t\t\tV2f rpos = V2f((x+rnd())*sectionSize, (y+rnd())*sectionSize);\n\t\t\tif (len(game->center-rpos) > minDist)\n\t\t\t\tcontinue;\n\t\t\taddedPositions.insert(pos);\n\n\t\t\tgame->icefloes[floeIndex] = new Icefloe(rpos, floeIndex);\n\t\t\tfloeIndex++;\n\n\t\t\tif (rnd() < 0.1f) {\n\t\t\t\tgame->addPenguinOnFloe(floeIndex - 1);\n\t\t\t}\n\t\t}\n\t}\n\tvector<int> toBeDeleted;\n\tfor (auto floe : game->icefloes){\n\t\tif (len(game->center-floe.second->pos) > maxDist)\n\t\t\ttoBeDeleted.push_back(floe.first);\n\t}\n\tfor (int i : toBeDeleted){\n\t\tgame->icefloes.erase(i);\n\t}\n}\n<commit_msg>tweak death animation again<commit_after>#include \"game.h\"\n#include \"util.h\"\n#include <iostream>\n#include <string>\n#include \"macros.h\"\n#include \"perlin.h\"\n#include <sstream>\nusing namespace std;\n\nint floeIndex = 0;\nset<pair<int, int> > addedPositions;\nvoid addFloes(Game* game);\n\nvoid Game::init(sf::RenderWindow* window){\n\tthis->window = window;\n\tcenter = V2f(0, 0);\n\tscreenCenter = V2f(400, 300);\n\n\tplayer = new Player(0);\n\tover = 0;\n\tfloeIndex = 0;\n\tscore = 0;\n\n\tloadTexture(waterTexture, \"res\/img\/water.png\");\n\twaterTexture.setRepeated(true);\n\twater.setTexture(waterTexture);\n\t\/\/water.setTextureRect(sf::IntRect(0, 0, 800, 600));\n\n\tloadSoundBuffer(penguinDeathBuffer, \"res\/sound\/bird.ogg\");\n\tpenguinDeath.setBuffer(penguinDeathBuffer);\n\n\tloadSoundBuffer(chompBuffer, \"res\/sound\/chomp.ogg\");\n\tchomp.setBuffer(chompBuffer);\n\n\taddedPositions.insert({0, 0});\n\ticefloes[floeIndex] = new Icefloe(sf::Vector2f(0.0f, 0.0f), floeIndex);\n\tfloeIndex++;\n}\n\nvoid Game::cleanup() {\n\tdelete player;\n\n\tfor (Penguin* penguin : penguins)\n\t\tdelete penguin;\n\tpenguins.clear();\n\n\tfor (auto floe : icefloes)\n\t\tdelete floe.second;\n\ticefloes.clear();\n\n\tfor (auto bloodSplash : bloodSplashes)\n\t\tdelete bloodSplash;\n\tbloodSplashes.clear();\n\n\taddedPositions.clear();\n}\n\nPerlin perlin;\nfloat perlinh = 0;\n\nvoid Game::update(float dt){\n\tperlinh += dt;\n\tthis->dt = dt;\n\n\n\taddFloes(this);\n\n\tfor (int i = 0; i < (int)penguins.size(); i++) {\n\t\tif (icefloes.find(penguins[i]->icefloe) == icefloes.end()){\n\t\t\tpenguins.erase(penguins.begin() + i);\n\t\t\ti--;\n\t\t\tcontinue;\n\t\t}\n\t\tpenguins[i]->update(this);\n\n\t\tfloat eatingDistance = 50.0f;\n\n\t\tif (dist(player->getRealMouthPos(this), penguins[i]->getRealPos(this)) < eatingDistance * 1.5f && chomp.getStatus() != sf::SoundSource::Status::Playing) {\n\t\t\tchomp.play();\n\t\t}\n\t\tif (dist(player->getRealMouthPos(this), penguins[i]->getRealPos(this)) < eatingDistance) {\n\t\t\taddBloodAt(penguins[i]->getRealPos(this));\t\t\t\n\t\t\tdelete penguins[i];\n\t\t\tpenguins.erase(penguins.begin() + i);\n\t\t\ti--;\n\t\t\tpenguinDeath.play();\n\t\t\t\n\t\t\tscore ++;\n\t\t}\n\t}\n\n\tfor (size_t i = 0; i < bloodSplashes.size(); i++) {\n\t\tbloodSplashes[i]->update(dt);\n\t\tif (!bloodSplashes[i]->stillAlive) {\n\t\t\tdelete bloodSplashes[i];\n\t\t\tbloodSplashes.erase(bloodSplashes.begin() + i);\n\t\t\t--i;\n\t\t}\n\t}\n\n\tplayer->update(this);\n\tfor (auto icefloe : icefloes)\n\t\ticefloe.second->update(this);\n\n\tcenter = player->getRealPos(this);\n}\n\nbool fontloaded = 0;\nsf::Font font;\nvoid loadFont(){\n\tif (fontloaded)\n\t\treturn;\n\tfontloaded = 1;\n\tfont.loadFromFile(\"res\/fonts\/arial.ttf\");\n}\n\nvoid Game::render(){\n\t\/*float wstep = 10;\n\tperlin.scale = 0.1;\n\tfor(float x = 0; x < 800; x += wstep)\n\t\tfor(float y = 0; y < 600; y += wstep) {\n\t\t\tsf::Color col(0, 0, 120+perlin.perlAt(V3f(x, y, perlinh))*50);\n\t\t\tsf::RectangleShape shape;\n\t\t\tshape.setSize(V2f(wstep, wstep));\n\t\t\tshape.setPosition(V2f(x, y));\n\t\t\tshape.setFillColor(col);\n\t\t\twindow->draw(shape);\n\t\t}*\/\n\n\tint w_width = waterTexture.getSize().x, w_height = waterTexture.getSize().y;\n\tint wx = ((int(center.x)\/w_width)*w_width-int(center.x))%w_width-w_width;\n\tint wy = ((int(center.y)\/w_height)*w_height-int(center.y))%w_height-w_height;\n\tfor(int x = wx; x <= wx+800*2+w_width; x += w_width)\n\t\tfor(int y = wy; y <= wy+600*2+w_height; y += w_height)\n\t\t\twater.setPosition(V2f(x, y)), window->draw(water);\n\n\tif (player->dying)\n\t\tplayer->render(this);\n\n\tfor (auto icefloe : icefloes)\n\t\ticefloe.second->render(this);\n\tfor (auto penguin : penguins)\n\t\tpenguin->render(this);\n\tfor (auto bloodSplash : bloodSplashes) {\n\t\tbloodSplash->setPosition(-center + screenCenter);\n\t\twindow->draw(*bloodSplash);\n\t}\n\tif (!player->dying)\n\t\tplayer->render(this);\n\n\tif (score != 0){\n\t\tstringstream ss;\n\t\tss << \" \" << score << \" penguins eaten.\";\n\t\tloadFont();\n\t\tsf::Text text(ss.str(), font, 30);\n\t\ttext.setPosition(V2f(1, 1));\n\t\ttext.setColor(sf::Color::Black);\n\t\twindow->draw(text);\n\t\ttext.setPosition(V2f(0, 0));\n\t\ttext.setColor(sf::Color::White);\n\t\twindow->draw(text);\n\t}\n}\n\nvoid Game::addPenguinOnFloe(int floe) {\n\tPenguin* penguin = new Penguin(floe);\n\tpenguins.push_back(penguin);\n}\n\nvoid Game::addBloodAt(sf::Vector2f pos) {\n\tbloodSplashes.push_back(new ParticleSystem(100, ParticleMode::Explosion, \"res\/img\/blood.png\", pos));\n}\n\n\n\nfloat sectionSize = 150;\nfloat minDist = 1000, maxDist = 2000;\n\nvoid addFloes(Game* game){\n\tV2f ppos = game->player->getRealPos(game);\n\tint rx = int(ppos.x\/sectionSize), ry = int(ppos.y\/sectionSize), margin = 10;\n\trep(x, rx-margin, rx+margin) {\n\t\trep(y, ry-margin, ry+margin) {\n\t\t\tpair<int, int> pos = {x, y};\n\t\t\tif (addedPositions.find(pos) != addedPositions.end())\n\t\t\t\tcontinue;\n\t\t\tV2f rpos = V2f((x+rnd())*sectionSize, (y+rnd())*sectionSize);\n\t\t\tif (len(game->center-rpos) > minDist)\n\t\t\t\tcontinue;\n\t\t\taddedPositions.insert(pos);\n\n\t\t\tgame->icefloes[floeIndex] = new Icefloe(rpos, floeIndex);\n\t\t\tfloeIndex++;\n\n\t\t\tif (rnd() < 0.1f) {\n\t\t\t\tgame->addPenguinOnFloe(floeIndex - 1);\n\t\t\t}\n\t\t}\n\t}\n\tvector<int> toBeDeleted;\n\tfor (auto floe : game->icefloes){\n\t\tif (len(game->center-floe.second->pos) > maxDist)\n\t\t\ttoBeDeleted.push_back(floe.first);\n\t}\n\tfor (int i : toBeDeleted){\n\t\tgame->icefloes.erase(i);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef HACK_H_\n#define HACK_H_\n\n#include <algorithm>\n#include <alloca.h>\n#include <limits.h>\n#include <math.h>\n\n\n\/**\n * Our rendering context\n *\/\nstruct HACK_Context\n{\n int width, height;\n};\n\n\/**\n * Output of a fragment shader, \n * contains the color and z depth of our pixel\n *\/\nstruct HACK_pixel {\n float r, g, b, a, z;\n};\n\n\/**\n * Output of a vertex shader\n * contains the vertex position and an associated varying object with our vertex\n *\/\ntemplate <typename VARY_TYPE>\nstruct HACK_vertex {\n float x, y, z;\n VARY_TYPE varying;\n};\n\n\/**\n * Scanline representation\n * Holds left\/right positions and associated varying objects\n *\/\ntemplate <typename VARY_TYPE>\nstruct __HACK_Scanline {\n int leftX, rightX;\n float leftZ, rightZ;\n VARY_TYPE leftVarying, rightVarying;\n};\n\n\/**\n * lerp function template\n * Anything that is used as a VARY_TYPE must have lerp implemented for it\n *\/\ntemplate <typename T>\nvoid lerp(const T &v1, const T &v2, float lerp, T &output);\n\n\/**\n * Rasterize a set of triangles\n * polygonAttributes - <ATTR_TYPE>[] - this array holds all of the per vertex information for all of our triangles\n * uniforms - <UNIF_TYPE> - this object holds things that are uniform to all vertices in all of our triangles\n * vertexCount - int - the number of vertices, should be the length of polygonAttributes\n * vertexShader - fn(const ATTR_TYPE & attribute, const UNIF_TYPE & uniform, HACK_vertex<VARY_TYPE> & output)\n * - function that transforms the triangles' vertices and sets up the varying data for further pipeline steps\n * - your shader function should populate the output parameter\n * fragmentShader - fn(const VARY_TYPE & varying, const UNIF_TYPE & uniform, HACK_pixel & output)\n * - function that determines the color of a pixel based on varyings and uniforms\n * - your shader function should populate the output parameter\n *\/\ntemplate <typename ATTR_TYPE, typename VARY_TYPE, typename UNIF_TYPE>\ninline void HACK_rasterize_triangles(const HACK_Context &ctx,\n const ATTR_TYPE *polygonAttributes,\n const UNIF_TYPE &uniforms,\n const int vertexCount,\n void (*vertexShader) (const ATTR_TYPE &attribute, const UNIF_TYPE &uniform, HACK_vertex<VARY_TYPE> &output),\n void (*fragmentShader) (const VARY_TYPE &varying, const UNIF_TYPE &uniform, HACK_pixel &output))\n{\n \/\/ every three vertexes is a triangle we should rasterize\n for (int v = 0; v < vertexCount;) {\n \/\/ do this in a new function so we can get fancy auto stack allocation semantics\n \/\/ this could be slow :\/ not sure at the moment...\n __HACK_rasterize_triangle(ctx, v, polygonAttributes, uniforms, vertexShader, fragmentShader);\n v += 3;\n }\n}\n\n\/**\n * INTERNAL - Rasterize a single triangle\n * triangleId - int - the ID of the triangle we're rendering, this is used to calc which polygon attributes we will use for our vertexes\n * polygonAttributes - <ATTR_TYPE>[] -\n * uniforms - <UNIF_TYPE> -\n * vertexShader - fn\n * fragmentShader - fn\n *\/\ntemplate <typename ATTR_TYPE, typename VARY_TYPE, typename UNIF_TYPE>\ninline void __HACK_rasterize_triangle(const HACK_Context &ctx,\n const int triangleId,\n const ATTR_TYPE *polygonAttributes,\n const UNIF_TYPE &uniforms,\n void (*vertexShader) (const ATTR_TYPE &attribute, const UNIF_TYPE &uniform, HACK_vertex<VARY_TYPE> &output),\n void (*fragmentShader) (const VARY_TYPE &varying, const UNIF_TYPE &uniform, HACK_pixel &output))\n{\n \/\/ allocate 3 outputs, one for each vertex\n HACK_vertex<VARY_TYPE> vertexShaderOutput[3];\n vertexShader(polygonAttributes[triangleId], uniforms, vertexShaderOutput[0]);\n vertexShader(polygonAttributes[triangleId + 1], uniforms, vertexShaderOutput[1]);\n vertexShader(polygonAttributes[triangleId + 2], uniforms, vertexShaderOutput[2]);\n \n int halfHeight = ctx.height \/ 2;\n int halfWidth = ctx.width \/ 2;\n \n \/\/ calc polygon normal and short circuit if needed\n \n \/\/ calculate number of scanlines needed for triangle\n \/\/ TODO(karl): clip to ctx y coords\n int bottomScanY = ceil(std::min(std::min(vertexShaderOutput[0].y * halfHeight, vertexShaderOutput[1].y * halfHeight), vertexShaderOutput[2].y * halfHeight));\n int topScanY = ceil(std::max(std::max(vertexShaderOutput[0].y * halfHeight, vertexShaderOutput[1].y * halfHeight), vertexShaderOutput[2].y * halfHeight));\n int scanlineNum = topScanY - bottomScanY;\n \n \/\/ alloc the scanline memory from the stack because we don't know how many scanlines we'll need per tri\n __HACK_Scanline<VARY_TYPE> *scanlines = (__HACK_Scanline<VARY_TYPE> *) alloca(sizeof(__HACK_Scanline<VARY_TYPE>) * scanlineNum);\n for (int i = 0; i < scanlineNum; ++i) {\n scanlines[i].leftX = INT_MAX;\n scanlines[i].rightX = INT_MIN;\n }\n \n \/\/ populate scanlines with values\n \/\/ this is where actual scanline conversion is done\n \/\/ TODO(karl): actually do it\n for (int i = 0; i < 3; ++i) {\n HACK_vertex<VARY_TYPE> *v1 = &vertexShaderOutput[i];\n HACK_vertex<VARY_TYPE> *v2;\n if (i == 2) {\n v2 = &vertexShaderOutput[0];\n } else {\n v2 = &vertexShaderOutput[i + 1];\n }\n \n if (v1->y > v2->y) {\n \/\/ if our y is decreasing instead of increasing we need to flip ordering\n HACK_vertex<VARY_TYPE> *temp = v1;\n v1 = v2;\n v2 = temp;\n }\n \n float dy = (v2->y - v1->y) * halfHeight;\n float dx = (v2->x - v2->y) * halfWidth;\n int bottomY = ceil(v1->y * halfHeight);\n int topY = ceil(v2->y * halfHeight);\n \n if (dy == 0) {\n \/\/ we skip horizontal lines because they'll be filled by diagonals later\n \/\/ also horizontal lines will fill things with NaNs because of division by zero...\n continue;\n }\n \n if (dx == 0) {\n \/\/ have to do special case for vertical line\n int x = ceil(v2->x) * halfWidth;\n for (int y = bottomY; y <= topY; ++y) {\n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[y - bottomScanY];\n scanline->leftX = std::min(scanline->leftX, x);\n scanline->rightX = std::max(scanline->rightX, x);\n float lerpVal = (y - v1->y * halfHeight) \/ (v2->y * halfHeight - v1->y * halfHeight);\n lerp(v1->varying, v2->varying, lerpVal, scanline->leftVarying);\n lerp(v1->varying, v2->varying, lerpVal, scanline->rightVarying);\n }\n } else {\n \n \/\/ this is slow, should be optimized\n float gradient = dx \/ dy;\n \n for (int y = bottomY; y <= topY; ++y) {\n \/\/ line equation\n int x = ceil(v1->x * halfWidth + (y - v1->y * halfHeight) * gradient);\n \n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[y - bottomScanY];\n scanline->leftX = std::min(scanline->leftX, x);\n scanline->rightX = std::max(scanline->rightX, x);\n float lerpVal = (y - v1->y * halfHeight) \/ (v2->y * halfHeight - v1->y * halfHeight);\n if (x == scanline->leftX) {\n lerp(v1->varying, v2->varying, lerpVal, scanline->leftVarying);\n }\n if (x == scanline->rightX) {\n lerp(v1->varying, v2->varying, lerpVal, scanline->rightVarying);\n }\n }\n }\n }\n \n\n \/\/ we have all of our scanlines setup, now just loop through shading each pixel in the scanline\n VARY_TYPE lerpedVarying;\n HACK_pixel pixelOutput;\n for (int i = 0; i < scanlineNum; ++i) {\n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[i];\n \n \/\/ clip scanline to ctx space\n \/\/ TODO(karl): check against ctx x coords\n \/\/ TODO(karl): maybe check flag to see if we should respect pixel z value changes? if not do depth buffer optimization here\n \n for (int j = scanline->leftX; j <= scanline->rightX; ++j) {\n \/\/ lerp the left and right of the scanline into\n float lerpVal = (float)(j - scanline->leftX) \/ (float)(scanline->rightX - scanline->leftX);\n lerp<VARY_TYPE>(scanline->leftVarying, scanline->rightVarying, lerpVal, lerpedVarying);\n int pixelX = j;\n int pixelY = i + bottomScanY;\n \n NSLog(@\"shading pixel {%d, %d}\", pixelX, pixelY);\n fragmentShader(lerpedVarying, uniforms, pixelOutput);\n \n \/\/ update depth and color buffers with our rendering context\n \n }\n }\n}\n\n\n#endif\n<commit_msg>Add z interpolation to scan convertor<commit_after>#ifndef HACK_H_\n#define HACK_H_\n\n#include <algorithm>\n#include <alloca.h>\n#include <limits.h>\n#include <math.h>\n\n\n\/**\n * Our rendering context\n *\/\nstruct HACK_Context\n{\n int width, height;\n};\n\n\/**\n * Output of a fragment shader, \n * contains the color and z depth of our pixel\n *\/\nstruct HACK_pixel {\n float r, g, b, a, z;\n};\n\n\/**\n * Output of a vertex shader\n * contains the vertex position and an associated varying object with our vertex\n *\/\ntemplate <typename VARY_TYPE>\nstruct HACK_vertex {\n float x, y, z;\n VARY_TYPE varying;\n};\n\n\/**\n * Scanline representation\n * Holds left\/right positions and associated varying objects\n *\/\ntemplate <typename VARY_TYPE>\nstruct __HACK_Scanline {\n int leftX, rightX;\n float leftZ, rightZ;\n VARY_TYPE leftVarying, rightVarying;\n};\n\n\/**\n * lerp function template\n * Anything that is used as a VARY_TYPE must have lerp implemented for it\n *\/\ntemplate <typename T>\nvoid lerp(const T &v1, const T &v2, float lerp, T &output);\n\ntemplate<>\nvoid lerp<float>(const float &f1, const float &f2, float lerp, float &output)\n{\n output = (f2 - f1) * lerp + f1;\n}\n\n\/**\n * Rasterize a set of triangles\n * polygonAttributes - <ATTR_TYPE>[] - this array holds all of the per vertex information for all of our triangles\n * uniforms - <UNIF_TYPE> - this object holds things that are uniform to all vertices in all of our triangles\n * vertexCount - int - the number of vertices, should be the length of polygonAttributes\n * vertexShader - fn(const ATTR_TYPE & attribute, const UNIF_TYPE & uniform, HACK_vertex<VARY_TYPE> & output)\n * - function that transforms the triangles' vertices and sets up the varying data for further pipeline steps\n * - your shader function should populate the output parameter\n * fragmentShader - fn(const VARY_TYPE & varying, const UNIF_TYPE & uniform, HACK_pixel & output)\n * - function that determines the color of a pixel based on varyings and uniforms\n * - your shader function should populate the output parameter\n *\/\ntemplate <typename ATTR_TYPE, typename VARY_TYPE, typename UNIF_TYPE>\ninline void HACK_rasterize_triangles(const HACK_Context &ctx,\n const ATTR_TYPE *polygonAttributes,\n const UNIF_TYPE &uniforms,\n const int vertexCount,\n void (*vertexShader) (const ATTR_TYPE &attribute, const UNIF_TYPE &uniform, HACK_vertex<VARY_TYPE> &output),\n void (*fragmentShader) (const VARY_TYPE &varying, const UNIF_TYPE &uniform, HACK_pixel &output))\n{\n \/\/ every three vertexes is a triangle we should rasterize\n for (int v = 0; v < vertexCount;) {\n \/\/ do this in a new function so we can get fancy auto stack allocation semantics\n \/\/ this could be slow :\/ not sure at the moment...\n __HACK_rasterize_triangle(ctx, v, polygonAttributes, uniforms, vertexShader, fragmentShader);\n v += 3;\n }\n}\n\n\/**\n * INTERNAL - Rasterize a single triangle\n * triangleId - int - the ID of the triangle we're rendering, this is used to calc which polygon attributes we will use for our vertexes\n * polygonAttributes - <ATTR_TYPE>[] -\n * uniforms - <UNIF_TYPE> -\n * vertexShader - fn\n * fragmentShader - fn\n *\/\ntemplate <typename ATTR_TYPE, typename VARY_TYPE, typename UNIF_TYPE>\ninline void __HACK_rasterize_triangle(const HACK_Context &ctx,\n const int triangleId,\n const ATTR_TYPE *polygonAttributes,\n const UNIF_TYPE &uniforms,\n void (*vertexShader) (const ATTR_TYPE &attribute, const UNIF_TYPE &uniform, HACK_vertex<VARY_TYPE> &output),\n void (*fragmentShader) (const VARY_TYPE &varying, const UNIF_TYPE &uniform, HACK_pixel &output))\n{\n \/\/ allocate 3 outputs, one for each vertex\n HACK_vertex<VARY_TYPE> vertexShaderOutput[3];\n vertexShader(polygonAttributes[triangleId], uniforms, vertexShaderOutput[0]);\n vertexShader(polygonAttributes[triangleId + 1], uniforms, vertexShaderOutput[1]);\n vertexShader(polygonAttributes[triangleId + 2], uniforms, vertexShaderOutput[2]);\n \n int halfHeight = ctx.height \/ 2;\n int halfWidth = ctx.width \/ 2;\n \n \/\/ calc polygon normal and short circuit if needed\n \n \/\/ calculate number of scanlines needed for triangle\n \/\/ TODO(karl): clip to ctx y coords\n int bottomScanY = ceil(std::min(std::min(vertexShaderOutput[0].y * halfHeight, vertexShaderOutput[1].y * halfHeight), vertexShaderOutput[2].y * halfHeight));\n int topScanY = ceil(std::max(std::max(vertexShaderOutput[0].y * halfHeight, vertexShaderOutput[1].y * halfHeight), vertexShaderOutput[2].y * halfHeight));\n int scanlineNum = topScanY - bottomScanY;\n \n \/\/ alloc the scanline memory from the stack because we don't know how many scanlines we'll need per tri\n __HACK_Scanline<VARY_TYPE> *scanlines = (__HACK_Scanline<VARY_TYPE> *) alloca(sizeof(__HACK_Scanline<VARY_TYPE>) * scanlineNum);\n for (int i = 0; i < scanlineNum; ++i) {\n scanlines[i].leftX = INT_MAX;\n scanlines[i].rightX = INT_MIN;\n }\n \n \/\/ populate scanlines with values\n \/\/ this is where actual scanline conversion is done\n \/\/ TODO(karl): actually do it\n for (int i = 0; i < 3; ++i) {\n HACK_vertex<VARY_TYPE> *v1 = &vertexShaderOutput[i];\n HACK_vertex<VARY_TYPE> *v2;\n if (i == 2) {\n v2 = &vertexShaderOutput[0];\n } else {\n v2 = &vertexShaderOutput[i + 1];\n }\n \n if (v1->y > v2->y) {\n \/\/ if our y is decreasing instead of increasing we need to flip ordering\n HACK_vertex<VARY_TYPE> *temp = v1;\n v1 = v2;\n v2 = temp;\n }\n \n float dy = (v2->y - v1->y) * halfHeight;\n float dx = (v2->x - v2->y) * halfWidth;\n int bottomY = ceil(v1->y * halfHeight);\n int topY = ceil(v2->y * halfHeight);\n \n if (dy == 0) {\n \/\/ we skip horizontal lines because they'll be filled by diagonals later\n \/\/ also horizontal lines will fill things with NaNs because of division by zero...\n continue;\n }\n \n if (dx == 0) {\n \/\/ have to do special case for vertical line\n int x = ceil(v2->x) * halfWidth;\n for (int y = bottomY; y <= topY; ++y) {\n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[y - bottomScanY];\n scanline->leftX = std::min(scanline->leftX, x);\n scanline->rightX = std::max(scanline->rightX, x);\n float lerpVal = (y - v1->y * halfHeight) \/ (v2->y * halfHeight - v1->y * halfHeight);\n lerp(v1->varying, v2->varying, lerpVal, scanline->leftVarying);\n lerp(v1->varying, v2->varying, lerpVal, scanline->rightVarying);\n lerp(v1->z, v2->z, lerpVal, scanline->leftZ);\n lerp(v1->z, v2->z, lerpVal, scanline->rightZ);\n }\n } else {\n \n \/\/ this is slow, should be optimized\n float gradient = dx \/ dy;\n \n for (int y = bottomY; y <= topY; ++y) {\n \/\/ line equation\n int x = ceil(v1->x * halfWidth + (y - v1->y * halfHeight) * gradient);\n \n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[y - bottomScanY];\n scanline->leftX = std::min(scanline->leftX, x);\n scanline->rightX = std::max(scanline->rightX, x);\n float lerpVal = (y - v1->y * halfHeight) \/ (v2->y * halfHeight - v1->y * halfHeight);\n if (x == scanline->leftX) {\n lerp(v1->varying, v2->varying, lerpVal, scanline->leftVarying);\n lerp(v1->z, v2->z, lerpVal, scanline->leftZ);\n }\n if (x == scanline->rightX) {\n lerp(v1->varying, v2->varying, lerpVal, scanline->rightVarying);\n lerp(v1->z, v2->z, lerpVal, scanline->rightZ);\n }\n }\n }\n }\n \n\n \/\/ we have all of our scanlines setup, now just loop through shading each pixel in the scanline\n VARY_TYPE lerpedVarying;\n HACK_pixel pixelOutput;\n for (int i = 0; i < scanlineNum; ++i) {\n __HACK_Scanline<VARY_TYPE> *scanline = &scanlines[i];\n \n \/\/ clip scanline to ctx space\n \/\/ TODO(karl): check against ctx x coords\n \/\/ TODO(karl): maybe check flag to see if we should respect pixel z value changes? if not do depth buffer optimization here\n \n for (int j = scanline->leftX; j <= scanline->rightX; ++j) {\n \/\/ lerp the left and right of the scanline into\n float lerpVal = (float)(j - scanline->leftX) \/ (float)(scanline->rightX - scanline->leftX);\n lerp<VARY_TYPE>(scanline->leftVarying, scanline->rightVarying, lerpVal, lerpedVarying);\n float pixelZ = -1;\n lerp(scanline->leftZ, scanline->rightZ, lerpVal, pixelZ);\n int pixelX = j;\n int pixelY = i + bottomScanY;\n \n NSLog(@\"shading pixel {%d, %d, %f}\", pixelX, pixelY, pixelZ);\n fragmentShader(lerpedVarying, uniforms, pixelOutput);\n \n \/\/ update depth and color buffers with our rendering context\n \n }\n }\n}\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef HELP_HPP_\n#define HELP_HPP_\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <sys\/ioctl.h>\n#include <unistd.h>\n#include \"errors.hpp\"\n\n\/\/TODO make sure this doesn't get messed up if we run on a machine that doesn't\n\/\/have less installed\n#define HELP_VIEWER \"less -R\"\n\n\/* !< \\brief Class to create pageable help messages instead of print them to\n * stderr\n *\/\n\n#define MAX_HELP_MSG_LEN (1024*1024)\n\nclass help_pager_t {\nprivate:\n \/* !< \\brief the number of lines in the terminal\n *\/\n int term_lines() {\n#ifdef TIOCGSIZE\n struct ttysize ts;\n ioctl(STDIN_FILENO, TIOCGSIZE, &ts);\n return ts.ts_lines;\n#elif defined(TIOCGWINSZ)\n struct winsize ts;\n ioctl(STDIN_FILENO, TIOCGWINSZ, &ts);\n return ts.ws_row;\n#endif \/* TIOCGSIZE *\/\n }\n\n int msg_lines() {\n char *c = msg;\n int nlines = 0;\n\n while (c != msg_hd) {\n if (*c++ == '\\n') {\n nlines++;\n }\n }\n\n return nlines;\n }\n\npublic:\n help_pager_t() {\n msg[0] = '\\0';\n msg_hd = msg;\n }\n\n ~help_pager_t() {\n FILE *print_to;\n if (msg_lines() > term_lines()) {\n print_to = popen(HELP_VIEWER, \"w\");\n } else {\n print_to = stderr;\n }\n\n msg_hd = '\\0'; \/\/Null terminate it;\n fprintf(print_to, \"%s\", msg);\n\n if (print_to != stderr) {\n pclose(print_to);\n }\n }\n\n static help_pager_t* instance() {\n static help_pager_t help;\n return &help;\n }\n int pagef(const char *format, ...) __attribute__ ((format (printf, 2, 3))) {\n int res;\n va_list arg;\n va_start(arg, format);\n\n if (msg_hd < msg + MAX_HELP_MSG_LEN - 1) {\n res = vsnprintf(msg_hd, (msg + MAX_HELP_MSG_LEN - 1) - msg_hd, format, arg);\n } else {\n unreachable(\"Help message is too big, increase MAX_HELP_MSG_LEN\");\n }\n\n msg_hd += res;\n va_end(arg);\n return res;\n }\n\nprivate:\n char msg[MAX_HELP_MSG_LEN];\n char *msg_hd;\n\n DISABLE_COPYING(help_pager_t);\n};\n\n#endif \/\/ HELP_HPP_\n<commit_msg>fixing help_pager_t to use heap-allocation internally so it's not so dangerous to allocate on the stack<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef HELP_HPP_\n#define HELP_HPP_\n\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdarg.h>\n#include <sys\/ioctl.h>\n#include <unistd.h>\n#include \"errors.hpp\"\n\n\/\/TODO make sure this doesn't get messed up if we run on a machine that doesn't\n\/\/have less installed\n#define HELP_VIEWER \"less -R\"\n\n\/* !< \\brief Class to create pageable help messages instead of printing them to\n * stderr\n *\/\n\nclass help_pager_t {\nprivate:\n \/* !< \\brief the number of lines in the terminal\n *\/\n int term_lines() {\n#ifdef TIOCGSIZE\n struct ttysize ts;\n ioctl(STDIN_FILENO, TIOCGSIZE, &ts);\n return ts.ts_lines;\n#elif defined(TIOCGWINSZ)\n struct winsize ts;\n ioctl(STDIN_FILENO, TIOCGWINSZ, &ts);\n return ts.ws_row;\n#endif \/* TIOCGSIZE *\/\n }\n\n int msg_lines() {\n int nlines = 0;\n\n for (size_t i = 0; i < msg.length(); ++i) {\n if (msg[i] == '\\n') {\n ++nlines;\n }\n }\n\n return nlines;\n }\n\npublic:\n help_pager_t() {\n \/\/ Do nothing\n }\n\n ~help_pager_t() {\n FILE *print_to;\n if (msg_lines() > term_lines()) {\n print_to = popen(HELP_VIEWER, \"w\");\n } else {\n print_to = stderr;\n }\n\n fprintf(print_to, \"%s\", msg.c_str());\n\n if (print_to != stderr) {\n pclose(print_to);\n }\n }\n\n static help_pager_t* instance() {\n static help_pager_t help;\n return &help;\n }\n int pagef(const char *format, ...) __attribute__ ((format (printf, 2, 3))) {\n va_list arg;\n va_start(arg, format);\n\n std::string delta = vstrprintf(format, arg);\n msg.append(delta);\n\n va_end(arg);\n return delta.length();\n }\n\nprivate:\n std::string msg;\n\n DISABLE_COPYING(help_pager_t);\n};\n\n#endif \/\/ HELP_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include\"ics3\/ics3.hpp\"\n\n#include\"core.hpp\"\n#include\"ics3\/eeprom.hpp\"\n#include\"ics3\/parameter.hpp\"\n#include\"ics3\/id.hpp\"\n\n#include<stdexcept>\n#include<array>\n#include<cassert>\n\nics::Angle getReceiveAngle(std::vector<unsigned char> rx, ics::Angle unit) {\n assert(rx.size() == 6);\n uint16_t receive {static_cast<uint16_t>((rx[4] << 7) | rx[5])};\n try {\n unit.setRaw(receive);\n } catch (...) {\n throw std::runtime_error {\"Receive angle error\"};\n }\n return unit;\n}\n\nics::ICS3::ICS3(const char* path, ICSBaudrate baudrate)\n : core {Core::getReference(path, static_cast<speed_t>(baudrate))}\n{}\n\nics::Angle ics::ICS3::free(const ID& id, const Angle& unit) const {\n static std::vector<unsigned char> tx(3), rx(6);\n tx[0] = 0x80 | id.get();\n tx[1] = 0;\n tx[2] = 0;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n return getReceiveAngle(rx, unit);\n}\n\nics::Angle ics::ICS3::move(const ID& id, const Angle& angle) const {\n static std::vector<unsigned char> tx(3), rx(6);\n uint16_t send {angle.getRaw()};\n tx[0] = 0x80 | id.get();\n tx[1] = 0x7F & (send >> 7);\n tx[2] = 0x7F & send;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n return getReceiveAngle(rx, angle);\n}\n\nics::Parameter ics::ICS3::get(const ID& id, Parameter param) const {\n static std::vector<unsigned char> tx(2), rx(5);\n tx[0] = 0xA0 | id.get();\n tx[1] = param.getSc();\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n param.set(rx[4]);\n return param;\n}\n\nvoid ics::ICS3::set(const ID& id, const Parameter& param) const {\n static std::vector<unsigned char> tx(3), rx(6);\n tx[0] = 0xC0 | id.get();\n tx[1] = param.getSc();\n tx[2] = param.get();\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n}\n\nics::Eeprom ics::ICS3::getRom(const ID& id) const {\n static std::vector<unsigned char> tx(2), rx(68);\n tx[0] = 0xA0 | id.get();\n tx[1] = 0;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n std::array<unsigned char, 64> rom;\n std::copy(rx.begin() + 2, rx.end(), rom.begin());\n return Eeprom {rom};\n}\n\nvoid ics::ICS3::setRom(const ID& id, const Eeprom& rom) const {\n static std::vector<unsigned char> tx(66), rx(68);\n tx[0] = 0xC0 | id.get();\n tx[2] = 0;\n rom.write(tx.begin() + 2);\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n}\n<commit_msg>Reformat code<commit_after>#include\"ics3\/ics3.hpp\"\n\n#include\"core.hpp\"\n#include\"ics3\/eeprom.hpp\"\n#include\"ics3\/parameter.hpp\"\n#include\"ics3\/id.hpp\"\n\n#include<stdexcept>\n#include<array>\n#include<cassert>\n\nics::Angle getReceiveAngle(std::vector<unsigned char> rx, ics::Angle unit) {\n assert(rx.size() == 6);\n uint16_t receive {static_cast<uint16_t>((rx[4] << 7) | rx[5])};\n try {\n unit.setRaw(receive);\n } catch (...) {\n throw std::runtime_error {\"Receive angle error\"};\n }\n return unit;\n}\n\nics::ICS3::ICS3(const char* path, ICSBaudrate baudrate)\n: core {Core::getReference(path, static_cast<speed_t>(baudrate))}\n{}\n\nics::Angle ics::ICS3::free(const ID& id, const Angle& unit) const {\n static std::vector<unsigned char> tx(3), rx(6);\n tx[0] = 0x80 | id.get();\n tx[1] = 0;\n tx[2] = 0;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n return getReceiveAngle(rx, unit);\n}\n\nics::Angle ics::ICS3::move(const ID& id, const Angle& angle) const {\n static std::vector<unsigned char> tx(3), rx(6);\n uint16_t send {angle.getRaw()};\n tx[0] = 0x80 | id.get();\n tx[1] = 0x7F & (send >> 7);\n tx[2] = 0x7F & send;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n return getReceiveAngle(rx, angle);\n}\n\nics::Parameter ics::ICS3::get(const ID& id, Parameter param) const {\n static std::vector<unsigned char> tx(2), rx(5);\n tx[0] = 0xA0 | id.get();\n tx[1] = param.getSc();\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n param.set(rx[4]);\n return param;\n}\n\nvoid ics::ICS3::set(const ID& id, const Parameter& param) const {\n static std::vector<unsigned char> tx(3), rx(6);\n tx[0] = 0xC0 | id.get();\n tx[1] = param.getSc();\n tx[2] = param.get();\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n}\n\nics::Eeprom ics::ICS3::getRom(const ID& id) const {\n static std::vector<unsigned char> tx(2), rx(68);\n tx[0] = 0xA0 | id.get();\n tx[1] = 0;\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n std::array<unsigned char, 64> rom;\n std::copy(rx.begin() + 2, rx.end(), rom.begin());\n return Eeprom {rom};\n}\n\nvoid ics::ICS3::setRom(const ID& id, const Eeprom& rom) const {\n static std::vector<unsigned char> tx(66), rx(68);\n tx[0] = 0xC0 | id.get();\n tx[2] = 0;\n rom.write(tx.begin() + 2);\n core.communicate(tx, rx); \/\/ throw std::runtime_error\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2017 Tmplt <tmplt@dragons.rocks>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <array>\n\n#include \"fuzzywuzzy.hpp\"\n\n#include \"item.hpp\"\n#include \"utils.hpp\"\n#include \"common.hpp\"\n#include \"algorithm.hpp\"\n\nstatic constexpr int fuzzy_min = 75;\n\n\/*\n * Returns true if all specified exact values are equal\n * and if all specified non-exact values passes the fuzzy ratio.\n *\/\nbool bookwyrm::item::matches(const item &wanted)\n{\n \/* Return false if any exact value doesn't match what's wanted. *\/\n for (int i = 0; i <= wanted.exacts.size; i++) {\n if (wanted.exacts[i] && wanted.exacts[i] != this->exacts[i])\n return false;\n }\n\n \/* Does the item contain a wanted ISBN? *\/\n if (!wanted.misc.isbns.empty() &&\n !utils::any_intersection(wanted.misc.isbns, this->misc.isbns))\n return false;\n\n \/* Are we copying the strings here? *\/\n const std::array<string, 3> in_result = {this->nonexacts.title,\n this->nonexacts.serie,\n this->nonexacts.publisher},\n requested = {wanted.nonexacts.title,\n wanted.nonexacts.serie,\n wanted.nonexacts.publisher};\n\n for (size_t i = 0; i <= in_result.size(); i++) {\n if (!requested[i].empty()) {\n \/*\n * partial: useful for course literature that can have some\n * crazy long titles. Also useful for publishers, because\n * some entries may not use the full name.\n *\/\n if (fuzz::partial_ratio(in_result[i], requested[i]) < fuzzy_min)\n return false;\n }\n }\n\n if (!wanted.nonexacts.authors.empty()) {\n int max_ratio = 0;\n for (const auto &comb : algorithm::product(this->nonexacts.authors,\n wanted.nonexacts.authors)) {\n \/*\n * From some quick testing, it feels like token_set_ratio\n * works best here.\n *\/\n int ratio = fuzz::token_set_ratio(comb.first, comb.second);\n max_ratio = std::max(ratio, max_ratio);\n }\n\n if (max_ratio < fuzzy_min)\n return false;\n }\n\n return true;\n}\n<commit_msg>item: break out of author-loop early if able<commit_after>\/*\n * Copyright (C) 2017 Tmplt <tmplt@dragons.rocks>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <array>\n\n#include \"fuzzywuzzy.hpp\"\n\n#include \"item.hpp\"\n#include \"utils.hpp\"\n#include \"common.hpp\"\n#include \"algorithm.hpp\"\n\nstatic constexpr int fuzzy_min = 75;\n\n\/*\n * Returns true if all specified exact values are equal\n * and if all specified non-exact values passes the fuzzy ratio.\n *\/\nbool bookwyrm::item::matches(const item &wanted)\n{\n \/* Return false if any exact value doesn't match what's wanted. *\/\n for (int i = 0; i <= wanted.exacts.size; i++) {\n if (wanted.exacts[i] && wanted.exacts[i] != this->exacts[i])\n return false;\n }\n\n \/* Does the item contain a wanted ISBN? *\/\n if (!wanted.misc.isbns.empty() &&\n !utils::any_intersection(wanted.misc.isbns, this->misc.isbns))\n return false;\n\n \/* Are we copying the strings here? *\/\n const std::array<string, 3> in_result = {this->nonexacts.title,\n this->nonexacts.serie,\n this->nonexacts.publisher},\n requested = {wanted.nonexacts.title,\n wanted.nonexacts.serie,\n wanted.nonexacts.publisher};\n\n for (size_t i = 0; i <= in_result.size(); i++) {\n if (!requested[i].empty()) {\n \/*\n * partial: useful for course literature that can have some\n * crazy long titles. Also useful for publishers, because\n * some entries may not use the full name.\n *\/\n if (fuzz::partial_ratio(in_result[i], requested[i]) < fuzzy_min)\n return false;\n }\n }\n\n if (!wanted.nonexacts.authors.empty()) {\n int max_ratio = 0;\n for (const auto &comb : algorithm::product(this->nonexacts.authors,\n wanted.nonexacts.authors)) {\n \/*\n * From some quick testing, it feels like token_set_ratio\n * works best here.\n *\/\n int ratio = fuzz::token_set_ratio(comb.first, comb.second);\n max_ratio = std::max(ratio, max_ratio);\n\n if (max_ratio >= fuzzy_min)\n break;\n }\n\n if (max_ratio < fuzzy_min)\n return false;\n }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <fstream>\n#include <cstdint>\n#include <algorithm>\n#include <memory>\n#include <thread>\n\n#include <stdio.h>\n#include <unistd.h>\n#include <chrono>\n\n#include \"dcpu.hpp\"\n#include \"disassembler.hpp\"\n\n#include \"gclock.hpp\"\n#include \"fake_lem1802.hpp\"\n#include \"lem1802.hpp\"\n#include \"lem1803.hpp\"\n\nusing namespace cpu;\n\nconst long TOTALCPUS = 215*16;\nconst long PERTHREAD = 16; \/\/ At 16 looks that is the ideal for the FX-4100\n#define THREADS (TOTALCPUS\/PERTHREAD)\nconst long CYCLES = 1000*1000;\n\nconst int BATCH = 10;\n\n\nstd::vector<std::vector<std::shared_ptr<DCPU>>> threads;\nuint16_t* data;\nsize_t size = 0;\n\nvoid benchmark();\nvoid step();\nvoid one_bench();\nvoid run100k();\n\nvoid cpu_in_thread(int n);\n\n\nint main (int argc, char **argv)\n{\n\n char* filename;\n std::ifstream binfile;\n \n \/* std::cout << \"cpu \" << sizeof(DCPU) << \" IHardware \" << sizeof(IHardware);\n std::cout << \" fake_LEM1802 \" << sizeof(Fake_Lem1802) << std::endl;*\/\n \n if (argc <= 1) {\n std::cerr << \"Missing input file\\n\";\n return 0;\n }\n \n filename = argv[1];\n std::cout << \"Input BIN File : \" << filename << \"\\n\";\n \n binfile.open (filename, std::ios::in | std::ios::binary );\n \n if (!binfile) {\n std::cerr << \"ERROR: I can open file\\n\";\n exit (1);\n }\n \n \/\/ get length of file:\n binfile.seekg (0, binfile.end);\n size = binfile.tellg();\n binfile.seekg (0, binfile.beg);\n \n data = new uint16_t[size \/ 2 + 1]();\n std::fill_n (data, size \/ 2, 0); \/\/ Clean it\n \n int i = 0;\n \n while (! binfile.eof() ) {\n uint16_t word = 0;\n binfile.read ( (char*) &word, 2);\n unsigned char tmp = ( (word & 0xFF00) >> 8) & 0x00FF;\n word = ( (word & 0x00FF) << 8) | tmp;\n data[i] = word;\n i++;\n }\n \n binfile.close();\n \n std::cout << \"Readed \" << size << \" bytes - \" << size \/ 2 << \" words\\n\";\n size \/= 2;\n \nbadchar:\n std::cout << \"Select what to do :\" << std::endl;\n std::cout << \"\\tb -> benchmark s -> step execution o-> benchmark one VM r-> run 8888888800k cycles\";\n std::cout << std::endl << std::endl;\n char choose;\n std::cin >> choose;\n \n if (choose == 'b' || choose == 'B') {\n benchmark();\n } else if ( choose == 's' || choose == 'S') {\n step();\n } else if ( choose == 'o' || choose == 'O') {\n one_bench();\n } else if ( choose == 'r' || choose == 'R') {\n run100k();\n } else {\n goto badchar; \/\/\/ HATE ME!!!!\n }\n\n delete[] data;\n\n return 0;\n}\n\n\nvoid benchmark() \n{\n \/\/ Load program to all CPUs\n for (int u=0; u< THREADS; u++) {\n std::vector<std::shared_ptr<DCPU>> cpus;\n cpus.reserve (PERTHREAD);\n for (int i = 0; i< PERTHREAD; i++) {\n auto cpu = std::make_shared<DCPU>(); \n \/\/auto screen = std::make_shared<Fake_Lem1802>();\n \/\/screen->setEnable(false); \/\/ We not desire to write to stdout\n \/\/cpu->attachHardware (screen);\n cpu->reset();\n cpu->loadProgram (data, size);\n \n cpus.push_back(cpu);\n }\n\n threads.push_back(cpus);\n \n }\n \n std::thread tds[THREADS];\n\n printf(\"Threads %ld\\t CPU PerThread %ld\\t\", THREADS, PERTHREAD);\n printf(\"N cpus %ld\\n\", PERTHREAD * THREADS);\n printf(\"Cycles %ld\\n\", CYCLES);\n \n auto start = std::chrono::high_resolution_clock::now(); \n \n for (int i=0; i< THREADS; i++) {\n tds[i] = std::thread(cpu_in_thread, i);\n }\n \n for (int i=0; i< THREADS; i++) {\n tds[i].join();\n }\n\n\tauto end = std::chrono::high_resolution_clock::now();\n auto dur = std::chrono::duration_cast<std::chrono::milliseconds>(end - start); \n\tstd::cout << \"Measured time: \" << dur.count() << \"ms\" << std::endl;\n \n}\n\nvoid step() {\n using namespace std;\n auto cpu = make_shared<DCPU>();\n \n auto screen1 = std::make_shared<Lem1802>();\n cpu->attachHardware (screen1);\n auto screen2 = std::make_shared<Lem1803>();\n cpu->attachHardware (screen2);\n \n cpu->reset();\n cpu->loadProgram (data, size);\n \n \n char c = getchar();\n while (1) {\n c = getchar();\n if (c == 'f' || c == 'q' || c == '\\n' )\n break;\n }\n \n while (c != 'q') {\n \n cout << cpu->dumpRegisters() << endl;\n cout << \"T cycles \" << dec << cpu->getTotCycles() << endl;\n cout << \"> \" << cpu->dumpRam() << \" - \";\n string s = disassembly(cpu->getMem() + cpu->GetPC(), 3);\n cout << s << endl;\n \n if (cpu->GetSP() != 0x0000)\n cout << \"STACK : \"<< cpu->dumpRam(cpu->GetSP(), 0xFFFF) << endl;\n \n if (c == 'f') {\n for (int i = 0; i < 100; i++)\n cpu->tick();\n } else {\n if (cpu->tick())\n cout << \"Execute! \";\n }\n cout << endl;\n \n \n \n while (1) {\n c = getchar();\n if (c == 'f' || c == 'q' || c == '\\n' )\n break;\n }\n \n }\n \n}\n\n\nvoid one_bench() {\n using namespace std;\n using namespace std::chrono;\n \n const int times = 200;\n\n high_resolution_clock::time_point starts[times];\n high_resolution_clock::time_point creates[times];\n high_resolution_clock::time_point loadstarts[times];\n high_resolution_clock::time_point loads[times];\n high_resolution_clock::time_point finishs[times];\n \n for (int x=0; x < times; x++) {\n using namespace std::chrono;\n starts[x] = high_resolution_clock::now(); \n auto cpu = make_shared<DCPU>();\n\n creates[x] = high_resolution_clock::now(); \n \n auto screen = make_shared<Fake_Lem1802>();\n screen->setEnable(false); \/\/ We not desire to write to stdout\n cpu->attachHardware (screen);\n \n loadstarts[x] = high_resolution_clock::now(); \n \n cpu->reset();\n cpu->loadProgram (data, size);\n \n loads[x] = high_resolution_clock::now(); \n \n for (int i=0; i < 10000; i++) {\n cpu->tick();\n }\n finishs[x] = high_resolution_clock::now(); \n }\n\n\n double d_create, d_load, d_execute;\n d_create = d_load = d_execute = 0;\n \n for (int x=0; x < times; x++) {\n\n auto tmp = duration_cast<chrono::microseconds> \n (creates[x] - starts[x]);\n d_create += tmp.count();\n \n tmp = duration_cast<chrono::microseconds> \n (loads[x] - loadstarts[x]); \n d_load += tmp.count();\n \n tmp = duration_cast<chrono::microseconds> \n (finishs[x] - loads[x]); \n \n d_execute += tmp.count();\n \n }\n d_create \/= times;\n d_load \/= times;\n d_execute \/= times;\n\n cout << \"Measured time: \" << endl;\n cout << \"\\tCreating time \"<< d_create << \"us\" << endl;\n cout << \"\\tLoad time \"<< d_load << \"us\" << endl;\n cout << \"\\tExecute 10k cycles time \"<< d_execute << \"us\" << endl;\n\n}\n\nvoid run100k() {\n\n using namespace std;\n using namespace std::chrono;\n \n auto cpu = make_shared<DCPU>();\n auto screen1 = std::make_shared<Lem1803>();\n cpu->attachHardware (screen1);\n \n auto screen2 = make_shared<Lem1802>();\n cpu->attachHardware (screen2);\n \n \/\/ FIXME See what fails with clock\n auto clock = make_shared<Generic_Clock>();\n cpu->attachHardware (clock);\n\n cpu->reset();\n cpu->loadProgram (data, size);\n \n high_resolution_clock::time_point b, e; \n for (int i=0; i < 800000; i++) {\n b = high_resolution_clock::now(); \n cpu->tick();\n e = high_resolution_clock::now(); \n \n auto delta = duration_cast<chrono::nanoseconds>(e - b);\n auto rest = nanoseconds(1000000000\/cpu->cpu_clock)-delta; \n\n if ((i % 50000) == 0) { \/\/ Not show running speed every clock tick \n double p = nanoseconds(1000000000\/cpu->cpu_clock).count() \/\n (double)(delta.count() + rest.count());\n cerr << \"Delta :\" << delta.count() << \" ns \";\n cerr << \"Rest :\" << rest.count() << \" ns \";\n cerr << \" Running at \"<< p*100.0 << \" % speed.\" << endl;\n }\n this_thread::sleep_for(duration_cast<chrono::nanoseconds>(rest)); \n }\n\n cout << \"Finished\" << std::endl;\n char c;\n cin >> c;\n\n}\n\n\n\n\/\/ Runs PERTHREAD cpus, doing CYCLES cycles\nvoid cpu_in_thread(int n) {\n auto cpus = threads[n];\n for (long i=0; i < CYCLES; i+= BATCH) {\n for (auto c = cpus.begin(); c != cpus.end(); c++) {\n for ( int j=0; j < BATCH; j++)\n (*c)->tick();\n }\n }\n}\n\n\n\n<commit_msg>Commented delay code, because some weird things that does the clock<commit_after>#include <iostream>\n#include <fstream>\n#include <cstdint>\n#include <algorithm>\n#include <memory>\n#include <thread>\n\n#include <stdio.h>\n#include <chrono>\n\n#include \"dcpu.hpp\"\n#include \"disassembler.hpp\"\n\n#include \"gclock.hpp\"\n#include \"fake_lem1802.hpp\"\n#include \"lem1802.hpp\"\n#include \"lem1803.hpp\"\n\nusing namespace cpu;\n\nconst long TOTALCPUS = 215*16;\nconst long PERTHREAD = 16; \/\/ At 16 looks that is the ideal for the FX-4100\n#define THREADS (TOTALCPUS\/PERTHREAD)\nconst long CYCLES = 1000*1000;\n\nconst int BATCH = 10;\n\n\nstd::vector<std::vector<std::shared_ptr<DCPU>>> threads;\nuint16_t* data;\nsize_t size = 0;\n\nvoid benchmark();\nvoid step();\nvoid one_bench();\nvoid run100k();\n\nvoid cpu_in_thread(int n);\n\n\nint main (int argc, char **argv)\n{\n\n char* filename;\n std::ifstream binfile;\n \n \/* std::cout << \"cpu \" << sizeof(DCPU) << \" IHardware \" << sizeof(IHardware);\n std::cout << \" fake_LEM1802 \" << sizeof(Fake_Lem1802) << std::endl;*\/\n \n if (argc <= 1) {\n std::cerr << \"Missing input file\\n\";\n return 0;\n }\n \n filename = argv[1];\n std::cout << \"Input BIN File : \" << filename << \"\\n\";\n \n binfile.open (filename, std::ios::in | std::ios::binary );\n \n if (!binfile) {\n std::cerr << \"ERROR: I can open file\\n\";\n exit (1);\n }\n \n \/\/ get length of file:\n binfile.seekg (0, binfile.end);\n size = binfile.tellg();\n binfile.seekg (0, binfile.beg);\n \n data = new uint16_t[size \/ 2 + 1]();\n std::fill_n (data, size \/ 2, 0); \/\/ Clean it\n \n int i = 0;\n \n while (! binfile.eof() ) {\n uint16_t word = 0;\n binfile.read ( (char*) &word, 2);\n unsigned char tmp = ( (word & 0xFF00) >> 8) & 0x00FF;\n word = ( (word & 0x00FF) << 8) | tmp;\n data[i] = word;\n i++;\n }\n \n binfile.close();\n \n std::cout << \"Readed \" << size << \" bytes - \" << size \/ 2 << \" words\\n\";\n size \/= 2;\n \nbadchar:\n std::cout << \"Select what to do :\" << std::endl;\n std::cout << \"\\tb -> benchmark s -> step execution o-> benchmark one VM r-> run 800k cycles\";\n std::cout << std::endl << std::endl;\n char choose;\n std::cin >> choose;\n \n if (choose == 'b' || choose == 'B') {\n benchmark();\n } else if ( choose == 's' || choose == 'S') {\n step();\n } else if ( choose == 'o' || choose == 'O') {\n one_bench();\n } else if ( choose == 'r' || choose == 'R') {\n run100k();\n } else {\n goto badchar; \/\/\/ HATE ME!!!!\n }\n\n delete[] data;\n\n return 0;\n}\n\n\nvoid benchmark() \n{\n \/\/ Load program to all CPUs\n for (int u=0; u< THREADS; u++) {\n std::vector<std::shared_ptr<DCPU>> cpus;\n cpus.reserve (PERTHREAD);\n for (int i = 0; i< PERTHREAD; i++) {\n auto cpu = std::make_shared<DCPU>(); \n \/\/auto screen = std::make_shared<Fake_Lem1802>();\n \/\/screen->setEnable(false); \/\/ We not desire to write to stdout\n \/\/cpu->attachHardware (screen);\n cpu->reset();\n cpu->loadProgram (data, size);\n \n cpus.push_back(cpu);\n }\n\n threads.push_back(cpus);\n \n }\n \n std::thread tds[THREADS];\n\n printf(\"Threads %ld\\t CPU PerThread %ld\\t\", THREADS, PERTHREAD);\n printf(\"N cpus %ld\\n\", PERTHREAD * THREADS);\n printf(\"Cycles %ld\\n\", CYCLES);\n \n auto start = std::chrono::high_resolution_clock::now(); \n \n for (int i=0; i< THREADS; i++) {\n tds[i] = std::thread(cpu_in_thread, i);\n }\n \n for (int i=0; i< THREADS; i++) {\n tds[i].join();\n }\n\n\tauto end = std::chrono::high_resolution_clock::now();\n auto dur = std::chrono::duration_cast<std::chrono::milliseconds>(end - start); \n\tstd::cout << \"Measured time: \" << dur.count() << \"ms\" << std::endl;\n \n}\n\nvoid step() {\n using namespace std;\n auto cpu = make_shared<DCPU>();\n \n auto screen1 = std::make_shared<Lem1802>();\n cpu->attachHardware (screen1);\n auto screen2 = std::make_shared<Lem1803>();\n cpu->attachHardware (screen2);\n \n cpu->reset();\n cpu->loadProgram (data, size);\n \n \n char c = getchar();\n while (1) {\n c = getchar();\n if (c == 'f' || c == 'q' || c == '\\n' )\n break;\n }\n \n while (c != 'q') {\n \n cout << cpu->dumpRegisters() << endl;\n cout << \"T cycles \" << dec << cpu->getTotCycles() << endl;\n cout << \"> \" << cpu->dumpRam() << \" - \";\n string s = disassembly(cpu->getMem() + cpu->GetPC(), 3);\n cout << s << endl;\n \n if (cpu->GetSP() != 0x0000)\n cout << \"STACK : \"<< cpu->dumpRam(cpu->GetSP(), 0xFFFF) << endl;\n \n if (c == 'f') {\n for (int i = 0; i < 100; i++)\n cpu->tick();\n } else {\n if (cpu->tick())\n cout << \"Execute! \";\n }\n cout << endl;\n \n \n \n while (1) {\n c = getchar();\n if (c == 'f' || c == 'q' || c == '\\n' )\n break;\n }\n \n }\n \n}\n\n\nvoid one_bench() {\n using namespace std;\n using namespace std::chrono;\n \n const int times = 200;\n\n high_resolution_clock::time_point starts[times];\n high_resolution_clock::time_point creates[times];\n high_resolution_clock::time_point loadstarts[times];\n high_resolution_clock::time_point loads[times];\n high_resolution_clock::time_point finishs[times];\n \n for (int x=0; x < times; x++) {\n using namespace std::chrono;\n starts[x] = high_resolution_clock::now(); \n auto cpu = make_shared<DCPU>();\n\n creates[x] = high_resolution_clock::now(); \n \n auto screen = make_shared<Fake_Lem1802>();\n screen->setEnable(false); \/\/ We not desire to write to stdout\n cpu->attachHardware (screen);\n \n loadstarts[x] = high_resolution_clock::now(); \n \n cpu->reset();\n cpu->loadProgram (data, size);\n \n loads[x] = high_resolution_clock::now(); \n \n for (int i=0; i < 10000; i++) {\n cpu->tick();\n }\n finishs[x] = high_resolution_clock::now(); \n }\n\n\n double d_create, d_load, d_execute;\n d_create = d_load = d_execute = 0;\n \n for (int x=0; x < times; x++) {\n\n auto tmp = duration_cast<chrono::microseconds> \n (creates[x] - starts[x]);\n d_create += tmp.count();\n \n tmp = duration_cast<chrono::microseconds> \n (loads[x] - loadstarts[x]); \n d_load += tmp.count();\n \n tmp = duration_cast<chrono::microseconds> \n (finishs[x] - loads[x]); \n \n d_execute += tmp.count();\n \n }\n d_create \/= times;\n d_load \/= times;\n d_execute \/= times;\n\n cout << \"Measured time: \" << endl;\n cout << \"\\tCreating time \"<< d_create << \"us\" << endl;\n cout << \"\\tLoad time \"<< d_load << \"us\" << endl;\n cout << \"\\tExecute 10k cycles time \"<< d_execute << \"us\" << endl;\n\n}\n\nvoid run100k() {\n\n using namespace std;\n using namespace std::chrono;\n \n auto cpu = make_shared<DCPU>();\n auto screen1 = std::make_shared<Lem1803>();\n cpu->attachHardware (screen1);\n \n auto screen2 = make_shared<Lem1802>();\n cpu->attachHardware (screen2);\n \n \/\/ FIXME See what fails with clock\n auto clock = make_shared<Generic_Clock>();\n cpu->attachHardware (clock);\n\n cpu->reset();\n cpu->loadProgram (data, size);\n \n high_resolution_clock::time_point b, e;\n char c;\n do {\n for (int i=0; i < 800000; i++) {\n b = high_resolution_clock::now(); \n cpu->tick();\n e = high_resolution_clock::now(); \n \n auto delta = duration_cast<chrono::nanoseconds>(e - b);\n auto rest = nanoseconds(1000000000\/cpu->cpu_clock)-delta; \n\n if ((i % 50000) == 0) { \/\/ Not show running speed every clock tick \n double p = nanoseconds(1000000000\/cpu->cpu_clock).count() \/\n (double)(delta.count() + rest.count());\n cerr << \"Delta :\" << delta.count() << \" ns \";\n cerr << \"Rest :\" << rest.count() << \" ns \";\n cerr << \" Running at \"<< p*100.0 << \" % speed.\" << endl;\n }\n \/\/this_thread::sleep_for(duration_cast<chrono::nanoseconds>(rest)); \n }\n cout << \"Press q to exit. Other key to run more.\" << std::endl;\n cin >> c;\n } while (c != 'q' && c!= 'Q');\n\n}\n\n\n\n\/\/ Runs PERTHREAD cpus, doing CYCLES cycles\nvoid cpu_in_thread(int n) {\n auto cpus = threads[n];\n for (long i=0; i < CYCLES; i+= BATCH) {\n for (auto c = cpus.begin(); c != cpus.end(); c++) {\n for ( int j=0; j < BATCH; j++)\n (*c)->tick();\n }\n }\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"Socket.h\"\n\n#include \"Common.h\"\n\n#include <cstring>\n#include <errno.h>\n#include <unistd.h>\n#include <iostream>\n#include <fstream>\n#include \"proxy\/ProxyServer.h\"\n\nusing namespace std;\n\nstruct Config\n{\n\tConfig() : port(1080) { }\n\tint port;\n};\n\n\/\/ Print an error message, usage, and then exit.\nvoid Usage(string errorMessage)\n{\n\tcerr << errorMessage << \"\\n\"\n\"Usage: oddsocks [-config <oddsocks.cfg (default)>] [-port <port, default 1080>]\\n\"\n\"Command line options supersedes options in the config file.\\n\"\n\"Config file is simply the port.\\n\";\n\texit(1);\n}\n\nConfig ReadConfigFromFile(string filename)\n{\n\tConfig cfg;\n\tifstream input(filename.c_str());\n\tinput >> cfg.port;\n\treturn cfg;\n}\n\nConfig ParseCommandLine(int argc, char* argv[])\n{\n\tConfig cfg;\n\tcfg.port = -1;\n\n\tstring configFile = \"oddsocks.cfg\";\n\n\tif (argc % 2 != 1)\n\t{\n\t\tUsage(\"Expected an even number of arguments.\");\n\t}\n\tfor (int i = 0; i < argc\/2; ++i)\n\t{\n\t\tstring key = argv[i*2+1];\n\t\tstring value = argv[i*2+2];\n\t\tif (key == \"-config\")\n\t\t{\n\t\t\tconfigFile = value;\n\t\t}\n\t\telse if (key == \"-port\")\n\t\t{\n\t\t\tcfg.port = StoI(value, -1);\n\t\t\tif (cfg.port < 1 || cfg.port > 65535)\n\t\t\t\tUsage(\"Port must be between 1 and 65535. Read value \" + value + \" understood as \" + ItoS(cfg.port));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tUsage(\"Unknown option: \" + key);\n\t\t}\n\t}\n\n\t\/\/ Try to read config file. Slightly dubious logic here!\n\t\/\/ I should make this more clear.\n\tConfig cfgFromFile = ReadConfigFromFile(configFile);\n\tif (cfg.port == -1)\n\t\tcfg.port = cfgFromFile.port;\n\tif (cfg.port == -1)\n\t\tcfg.port = 1080;\n\n\treturn cfg;\n}\n\nint main(int argc, char* argv[])\n{\n\t\/\/ Command line options will be:\n\t\/\/ -config <file>\n\t\/\/ -password <pw>\n\t\/\/ -port <port>\n\tConfig cfg = ParseCommandLine(argc, argv);\n\n\tint port = cfg.port;\n\tProxyServer proxy = ProxyServer(port);\n\n\tproxy.Listen();\n\n\treturn 0;\n}\n<commit_msg>Made two threads for main program - runs proxy + relay<commit_after>#include \"Socket.h\"\n\n#include \"Common.h\"\n\n#include <cstring>\n#include <errno.h>\n#include <unistd.h>\n#include <iostream>\n#include <fstream>\n#include <relay\/RelayServer.h>\n#include \"proxy\/ProxyServer.h\"\n\nusing namespace std;\n\nstruct Config\n{\n\tConfig() : port(1080) { }\n\tint port;\n};\n\n\/\/ Print an error message, usage, and then exit.\nvoid Usage(string errorMessage)\n{\n\tcerr << errorMessage << \"\\n\"\n\"Usage: oddsocks [-config <oddsocks.cfg (default)>] [-port <port, default 1080>]\\n\"\n\"Command line options supersedes options in the config file.\\n\"\n\"Config file is simply the port.\\n\";\n\texit(1);\n}\n\nConfig ReadConfigFromFile(string filename)\n{\n\tConfig cfg;\n\tifstream input(filename.c_str());\n\tinput >> cfg.port;\n\treturn cfg;\n}\n\nConfig ParseCommandLine(int argc, char* argv[])\n{\n\tConfig cfg;\n\tcfg.port = -1;\n\n\tstring configFile = \"oddsocks.cfg\";\n\n\tif (argc % 2 != 1)\n\t{\n\t\tUsage(\"Expected an even number of arguments.\");\n\t}\n\tfor (int i = 0; i < argc\/2; ++i)\n\t{\n\t\tstring key = argv[i*2+1];\n\t\tstring value = argv[i*2+2];\n\t\tif (key == \"-config\")\n\t\t{\n\t\t\tconfigFile = value;\n\t\t}\n\t\telse if (key == \"-port\")\n\t\t{\n\t\t\tcfg.port = StoI(value, -1);\n\t\t\tif (cfg.port < 1 || cfg.port > 65535)\n\t\t\t\tUsage(\"Port must be between 1 and 65535. Read value \" + value + \" understood as \" + ItoS(cfg.port));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tUsage(\"Unknown option: \" + key);\n\t\t}\n\t}\n\n\t\/\/ Try to read config file. Slightly dubious logic here!\n\t\/\/ I should make this more clear.\n\tConfig cfgFromFile = ReadConfigFromFile(configFile);\n\tif (cfg.port == -1)\n\t\tcfg.port = cfgFromFile.port;\n\tif (cfg.port == -1)\n\t\tcfg.port = 1080;\n\n\treturn cfg;\n}\n\nint main(int argc, char* argv[])\n{\n\t\/\/ Command line options will be:\n\t\/\/ -config <file>\n\t\/\/ -password <pw>\n\t\/\/ -port <port>\n\tConfig cfg = ParseCommandLine(argc, argv);\n\n\tint port = cfg.port;\n\t;\n\tthread p([&] {\n\t\tProxyServer proxy = ProxyServer(port);\n\t\tproxy.Listen();\n\t});\n\n\tthread r([&] {\n\t\tRelayServer relay = RelayServer(1090);\n\t\trelay.Listen();\n\t});\n\n\tp.join();\n\tr.join();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell)\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\t\n\n\t\t\/\/execute the following code ONLY IF STRING IS NOT EMPTY\n\t\tif (!rawinput.empty())\n\t\t{\n\t\t\t\t\n\t\t\t\/\/variables to keep track of whitespaces\n\t\t\tint wspos = 0;\n\t\t\tstring parsedinput = rawinput;\n\n\n\t\t\t\/\/first remove leading whitespaces at the very beginning of the string\n\t\t\twhile (parsedinput.at(wspos) == ' ') wspos++;\n\t\t\tparsedinput = parsedinput.substr(wspos, parsedinput.size());\n\t\t\t\/\/then reinit wsend for removing inner whitespaces\n\t\t\twspos = 0;\n\n\t\t\t\/\/next remove trailing whitespaces at the end of the string\n\t\t\tparsedinput += ' '; \/\/add space at the end to make removal easier.\n\t\t\twspos = parsedinput.size()-1;\n\t\t\tif(parsedinput.at(wspos) == ' ')\n\t\t\t{\n\t\t\t\twhile (parsedinput.at(wspos) == ' ')\n\t\t\t\t{\n\t\t\t\t\t--wspos;\n\t\t\t\t}\n\t\t\t\n\t\t\t\tparsedinput = parsedinput.substr(0, wspos+1);\n\t\t\t}\n\n\t\t\t\/\/add semicolon to the end of the string to make parsing easier\n\t\t\tparsedinput += ';';\n\t\t\tcout << \"new formatted input:\" << parsedinput << endl;\n\t\t\t\n\t\t\t\/\/initial scan for syntax errors\n\t\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\t\/\/bool variable to tell when the inner for loop is done\n\t\t\tbool seploopdone = false;\n\n\t\t\t\/\/iterate through string and separate into commands and connectors\n\t\t\twhile (synerror != true && seploopdone == false)\n\t\t\t{\n\t\t\t\tstring parsecmd;\n\t\t\t\tfor (int i=0; i<parsedinput.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\t\/\/checks for & and |\n\t\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/if 3 &&& ||| -- syntax error\n\t\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i) != ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(synerror = true) break;\n\t\t\t\tseploopdone = true;\n\t\t\t}\n\t\t}\n\t\tcmds.push_back(\";\");\n\n\t\t\/\/PARSING TEST OUTPUT\n\t\tfor (int i=0; i<cmds.size(); i++)\n\t\t\tcout << cmds.at(i) << endl;\n\n\n\t\t\n\t\tvector<string> newvec;\n\t\tfor (int i = 0; i < cmds.size(); i++)\n\t\t{\n\t\t\t\/\/TODO: sort through vector, stop when &&, ||, or ; is found.\n\t\t\tif (cmds.at(i) == \"&&\" || cmds.at(i) == \"||\" || cmds.at(i) == \";\")\n\t\t\t{\n\t\t\t\tcout << \"Executing... \" << endl;\n\t\t\t\tchar** newargv = new char*[newvec.size()];\n\t\t\t\tint pid = fork();\n\t\t\t\tif (pid == -1) perror(\"fork\");\n\t\t\t\tif (-1 == execvp(newargv[0], newargv))\n\t\t\t\t{\n\t\t\t\t\tperror(*newargv);\n\t\t\t\t\texit(1);\n\t\t\t\t}\n\t\t\t\twait(0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnewvec.push_back(cmds.at(i));\n\t\t\t\tcout << \"newvec: \";\n\t\t\t\tfor (int i=0; i < newvec.size(); i++)\n\t\t\t\t\tcout << newvec.at(i) << endl;\n\t\t\t}\n\t\t}\n\n\t}\n\n\treturn 0;\n} \n<commit_msg>Execvp calls debugged.<commit_after>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell && cin.good())\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\t\n\n\t\t\/\/execute the following code ONLY IF STRING IS NOT EMPTY\n\t\tif (!rawinput.empty())\n\t\t{\n\t\t\t\t\n\t\t\t\/\/variables to keep track of whitespaces\n\t\t\tint wspos = 0;\n\t\t\tstring parsedinput = rawinput;\n\n\n\t\t\t\/\/first remove leading whitespaces at the very beginning of the string\n\t\t\twhile (parsedinput.at(wspos) == ' ') wspos++;\n\t\t\tparsedinput = parsedinput.substr(wspos, parsedinput.size());\n\t\t\t\/\/then reinit wsend for removing inner whitespaces\n\t\t\twspos = 0;\n\n\t\t\t\/\/next remove trailing whitespaces at the end of the string\n\t\t\tparsedinput += ' '; \/\/add space at the end to make removal easier.\n\t\t\twspos = parsedinput.size()-1;\n\t\t\tif(parsedinput.at(wspos) == ' ')\n\t\t\t{\n\t\t\t\twhile (parsedinput.at(wspos) == ' ')\n\t\t\t\t{\n\t\t\t\t\t--wspos;\n\t\t\t\t}\n\t\t\t\n\t\t\t\tparsedinput = parsedinput.substr(0, wspos+1);\n\t\t\t}\n\n\t\t\t\/\/add semicolon to the end of the string to make parsing easier\n\t\t\tparsedinput += ';';\n\t\t\t\n\t\t\t\/\/initial scan for syntax errors\n\t\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\t\/\/bool variable to tell when the inner for loop is done\n\t\t\tbool seploopdone = false;\n\n\t\t\t\/\/iterate through string and separate into commands and connectors\n\t\t\twhile (synerror != true && seploopdone == false)\n\t\t\t{\n\t\t\t\tstring parsecmd;\n\t\t\t\tfor (int i=0; i<parsedinput.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\t\/\/checks for & and |\n\t\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/if 3 &&& ||| -- syntax error\n\t\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i) != ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(synerror = true) break;\n\t\t\t\tseploopdone = true;\n\t\t\t}\n\t\t}\n\t\tcmds.push_back(string(\";\"));\n\n\t\tvector<string> newvec;\n\t\tfor (int i = 0; i < cmds.size(); i++)\n\t\t{\n\t\t\t\/\/TODO: sort through vector, stop when &&, ||, or ; is found.\n\t\t\tif (cmds.at(i) == \"&&\" || cmds.at(i) == \"||\" || cmds.at(i) == \";\")\n\t\t\t{\n\t\t\t\tcout << \"Executing... \" << endl;\n\n\t\t\t\tchar** newargv = new char*[newvec.size()];\n\t\t\t\tfor (int j = 0; j < newvec.size(); j++)\n\t\t\t\t{\n\t\t\t\t\tnewargv[j] = new char[newvec.at(j).size()+1]; \n\t\t\t\t\tstrcpy(newargv[j], newvec.at(j).c_str());\n\t\t\t\t}\n\n\t\t\t\tint pid = fork();\n\t\t\t\tif (pid == -1) perror(\"fork\");\n\t\t\t\tif (pid == 0)\n\t\t\t\t{\t\n\t\t\t\t\tif (-1 == execvp(newargv[0], newargv))\n\t\t\t\t\t{\n\t\t\t\t\t\tperror(*newargv);\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\twait(0);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnewvec.push_back(cmds.at(i));\n\t\t\t}\n\t\t}\n\n\t}\n\n\treturn 0;\n} \n<|endoftext|>"} {"text":"<commit_before>#include \"..\/inc\/main.hpp\"\n#include \"..\/inc\/control.hpp\"\n#include \"..\/inc\/model.hpp\"\n#include \"..\/inc\/view.hpp\"\n\n#include <X11\/Xlib.h>\n#include <thread>\n#include <iostream>\n\n#include <SFML\/System\/Time.hpp>\n#include <SFML\/System\/Sleep.hpp>\n\nint main(int argc, const char **argv) {\n\tXInitThreads();\n\tView::view display(512, 512, \"View\");\n\t\n\tdisplay.win.setActive(false);\n\tauto runFrame = []{\n\t\t\/\/ One view frame\n\t};\n\tauto runModel = [&display]{\n\t\tdisplay.win.setActive(false);\n\t\tstatic int t = 0;\n\t\twhile(!display.done) {\n\t\t\tstd::cout << \"Model: t = \" << t++ << std::endl;\n\t\t\tsf::sleep(sf::milliseconds(1000));\n\t\t}\n\t};\n\tauto runView = [&display, &runFrame]{\n\t\tdisplay.run(runFrame, 1);\n\t};\n\n\tstd::thread viewThread(runView), \n\t\tmodelThread(runModel);\n\n\tviewThread.join();\n\tmodelThread.join();\n\n\treturn 0;\n}\n<commit_msg>Replaced frame limit 1 FPS (troubleshooting) with 60 (target)<commit_after>#include \"..\/inc\/main.hpp\"\n#include \"..\/inc\/model.hpp\"\n#include \"..\/inc\/view.hpp\"\n\n#include <X11\/Xlib.h>\n#include <thread>\n#include <iostream>\n\n#include <SFML\/System\/Time.hpp>\n#include <SFML\/System\/Sleep.hpp>\n\nint main(int argc, const char **argv) {\n\tXInitThreads();\n\tView::view display(512, 512, \"View\");\n\t\n\tdisplay.win.setActive(false);\n\tauto runFrame = []{\n\t\t\/\/ One view frame\n\t};\n\tauto runModel = [&display]{\n\t\tdisplay.win.setActive(false);\n\t\tstatic int t = 0;\n\t\twhile(!display.done) {\n\t\t\tstd::cout << \"Model: t = \" << t++ << std::endl;\n\t\t\tsf::sleep(sf::milliseconds(1000));\n\t\t}\n\t};\n\tauto runView = [&display, &runFrame]{\n\t\tdisplay.run(runFrame, 60);\n\t};\n\n\tstd::thread viewThread(runView), \n\t\tmodelThread(runModel);\n\n\tviewThread.join();\n\tmodelThread.join();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <SFML\/Audio.hpp>\n#include <SFML\/Graphics.hpp>\n#include \"game.h\"\n#include \"util.h\"\n\nint main()\n{\n \/\/ Create the main window\n sf::RenderWindow window(sf::VideoMode(800, 600), \"Icebearino\");\n Game game;\n game.init(&window);\n\n \/\/ Create a graphical text to display\n sf::Font font;\n if (!font.loadFromFile(\"res\/fonts\/arial.ttf\"))\n return EXIT_FAILURE;\n\n \/\/ Death sound\n sf::SoundBuffer deathSoundBuffer;\n loadSoundBuffer(deathSoundBuffer, \"res\/sound\/death.ogg\");\n sf::Sound deathSound;\n deathSound.setBuffer(deathSoundBuffer);\n\n bool gamerunning = false;\n\n \/\/ Start the game loop\n sf::Clock deltaClock;\n float dt = 0.0f;\n while (window.isOpen())\n {\n \/\/ Process events\n sf::Event event;\n while (window.pollEvent(event))\n {\n \/\/ Close window: exit\n if (event.type == sf::Event::Closed)\n window.close();\n }\n\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Key::Escape))\n window.close();\n\n\n\n \/\/ Update game\n if (gamerunning) {\n game.update(dt);\n if (game.over) {\n gamerunning = false;\n deathSound.play();\n game.cleanup();\n }\n } else {\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Key::Return)){\n game.init(&window);\n gamerunning = true;\n }\n }\n\n \/\/ Clear screen\n window.clear();\n\n \/\/ Render game\n if (gamerunning) {\n game.render();\n } else if (!gamerunning) {\n sf::Text title(\"ICEBEARINO\", font, 100.0f);\n sf::FloatRect textRect = title.getLocalBounds();\n title.setOrigin(textRect.left + textRect.width\/2.0f, textRect.top + textRect.height\/2.0f);\n title.setPosition(sf::Vector2f(400, 300));\n window.draw(title);\n\n \/\/sf::Text startText(\"press space to start\", font, 30.0f);\n }\n\n \/\/ Update the window\n window.display();\n\n dt = deltaClock.restart().asSeconds();\n }\n return EXIT_SUCCESS;\n}\n<commit_msg>Press enter to start<commit_after>#include <SFML\/Audio.hpp>\n#include <SFML\/Graphics.hpp>\n#include \"game.h\"\n#include \"util.h\"\n\nint main()\n{\n \/\/ Create the main window\n sf::RenderWindow window(sf::VideoMode(800, 600), \"Icebearino\");\n Game game;\n game.init(&window);\n\n \/\/ Create a graphical text to display\n sf::Font font;\n if (!font.loadFromFile(\"res\/fonts\/arial.ttf\"))\n return EXIT_FAILURE;\n\n \/\/ Death sound\n sf::SoundBuffer deathSoundBuffer;\n loadSoundBuffer(deathSoundBuffer, \"res\/sound\/death.ogg\");\n sf::Sound deathSound;\n deathSound.setBuffer(deathSoundBuffer);\n\n bool gamerunning = false;\n\n \/\/ Start the game loop\n sf::Clock deltaClock;\n float dt = 0.0f;\n while (window.isOpen())\n {\n \/\/ Process events\n sf::Event event;\n while (window.pollEvent(event))\n {\n \/\/ Close window: exit\n if (event.type == sf::Event::Closed)\n window.close();\n }\n\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Key::Escape))\n window.close();\n\n\n\n \/\/ Update game\n if (gamerunning) {\n game.update(dt);\n if (game.over) {\n gamerunning = false;\n deathSound.play();\n game.cleanup();\n }\n } else {\n if (sf::Keyboard::isKeyPressed(sf::Keyboard::Key::Return)){\n game.init(&window);\n gamerunning = true;\n }\n }\n\n \/\/ Clear screen\n window.clear();\n\n \/\/ Render game\n if (gamerunning) {\n game.render();\n } else if (!gamerunning) {\n sf::Text title(\"ICEBEARINO\", font, 100.0f);\n sf::Text pressEnter(\"Press enter to start the game\", font, 20.0f);\n\n sf::FloatRect textRect = title.getLocalBounds();\n title.setOrigin(textRect.left + textRect.width\/2.0f, textRect.top + textRect.height\/2.0f);\n title.setPosition(sf::Vector2f(400, 250));\n\n textRect = pressEnter.getLocalBounds();\n pressEnter.setOrigin(textRect.left + textRect.width\/2.0f, textRect.top + textRect.height\/2.0f);\n pressEnter.setPosition(sf::Vector2f(400, 320));\n\n window.draw(title);\n window.draw(pressEnter);\n\n \/\/sf::Text startText(\"press space to start\", font, 30.0f);\n }\n\n \/\/ Update the window\n window.display();\n\n dt = deltaClock.restart().asSeconds();\n }\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <QApplication>\n#include <QDeclarativeView>\n#include <QDeclarativeContext>\n#include <QDeclarativeEngine>\n#include <QtDeclarative>\n#include <QGLWidget>\n#include <X11\/Xlib.h>\n\n#include \"imports\/plugin.h\"\n\n#include \"settings.h\"\n#include \"filenaming.h\"\n#include \"quillitem.h\"\n\nQ_DECL_EXPORT int main(int argc, char *argv[]) {\n XInitThreads();\n\n QApplication app(argc, argv);\n\n QDeclarativeView view;\n view.setViewport(new QGLWidget);\n view.setResizeMode(QDeclarativeView::SizeRootObjectToView);\n view.setViewportUpdateMode(QGraphicsView::FullViewportUpdate);\n\n Plugin::registerTypes(view.engine());\n qmlRegisterType<Settings>(\"CameraPlus\", 1, 0, \"Settings\");\n qmlRegisterType<FileNaming>(\"CameraPlus\", 1, 0, \"FileNaming\");\n qmlRegisterType<QuillItem>(\"CameraPlus\", 1, 0, \"QuillItem\");\n\n QUrl sourceUrl = QUrl::fromLocalFile(QDir::currentPath() + \"\/main.qml\");\n view.setSource(sourceUrl);\n\n view.showFullScreen();\n\n int ret = app.exec();\n return ret;\n};\n<commit_msg>Qt can call XInitThreads() if we set the AA_X11InitThreads attribute<commit_after>#include <QApplication>\n#include <QDeclarativeView>\n#include <QDeclarativeContext>\n#include <QDeclarativeEngine>\n#include <QtDeclarative>\n#include <QGLWidget>\n\n#include \"imports\/plugin.h\"\n\n#include \"settings.h\"\n#include \"filenaming.h\"\n#include \"quillitem.h\"\n\nQ_DECL_EXPORT int main(int argc, char *argv[]) {\n QApplication::setAttribute(Qt::AA_X11InitThreads, true);\n QApplication app(argc, argv);\n\n QDeclarativeView view;\n view.setViewport(new QGLWidget);\n view.setResizeMode(QDeclarativeView::SizeRootObjectToView);\n view.setViewportUpdateMode(QGraphicsView::FullViewportUpdate);\n\n Plugin::registerTypes(view.engine());\n qmlRegisterType<Settings>(\"CameraPlus\", 1, 0, \"Settings\");\n qmlRegisterType<FileNaming>(\"CameraPlus\", 1, 0, \"FileNaming\");\n qmlRegisterType<QuillItem>(\"CameraPlus\", 1, 0, \"QuillItem\");\n\n QUrl sourceUrl = QUrl::fromLocalFile(QDir::currentPath() + \"\/main.qml\");\n view.setSource(sourceUrl);\n\n view.showFullScreen();\n\n int ret = app.exec();\n return ret;\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 timercrack\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include <iostream>\n#include <thread>\n#include \"TraderSpi.h\"\n#include \"MdSpi.h\"\n#include \"global.h\"\n#if defined(__linux__)\n#include <unistd.h>\n#elif defined(_WIN32)\n#include <filesystem>\n#include <windows.h>\n#endif\nINITIALIZE_EASYLOGGINGPP \/\/ NOLINT\n\nusing namespace std;\nusing namespace sw::redis;\n\nint main(int argc, char **argv) {\n#ifdef _WIN32\n std::filesystem::path config_file = std::filesystem::current_path() \/ \"config.ini\";\n std::string config_path(std::filesystem::current_path().string());\n cout << \"config-file: \" << config_path + \"\\\\config.ini\"<< endl;\n std::string& log_path = config_path;\n std::string& md_path = config_path;\n std::string& trade_path = config_path;\n std::ifstream \tifs(config_file.string());\n#else\n std::string home_str(getenv(\"HOME\"));\n std::string config_path = home_str + \"\/.config\/backend-ctp\/config.ini\";\n std::string log_path = home_str + \"\/.cache\/backend-ctp\/log\";\n std::string md_path = home_str + \"\/.cache\/backend-ctp\/md\/\";\n std::string trade_path = home_str + \"\/.cache\/backend-ctp\/trade\/\";\n mkdir( log_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n mkdir( md_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n mkdir( trade_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n cout << \"config-file: \" << config_path << endl;\n std::ifstream \tifs(config_path);\n#endif\n std::string \tline, key, split, val;\n std::map<std::string, std::string> config;\n while ( std::getline(ifs, line) )\n if (std::stringstream(line) >> key >> split >> val && key[0] != ';' && split == \"=\")\n config[key] = val;\n\n #if defined(__linux__)\n \/\/if ( daemon(0, 0) ) return 1;\n #endif\n\n el::Configurations defaultConf;\n defaultConf.setToDefault();\n defaultConf.setGlobally( el::ConfigurationType::Format,\n\/\/ \"%datetime{%Y-%M-%d %H:%m:%s.%g} [%level] %msg\" );\n \"%datetime{%Y-%M-%d %H:%m:%s.%g} (%thread) [%level] %msg\" );\n defaultConf.setGlobally( el::ConfigurationType::Filename, log_path + \"\/backend-ctp.log\" );\n defaultConf.setGlobally( el::ConfigurationType::MaxLogFileSize, \"2097152\" );\n defaultConf.setGlobally( el::ConfigurationType::ToStandardOutput, \"0\" );\n el::Loggers::reconfigureLogger(\"default\", defaultConf);\n logger = el::Loggers::getLogger(\"default\");\n el::Helpers::setThreadName(\"main\");\n logger->info(\"服务重新启动，连接 redis %v:%v\", config[\"host\"], std::stoi( config[\"port\"] ));\n ConnectionOptions connection_options;\n connection_options.host = config[\"host\"];\n connection_options.port = std::stoi( config[\"port\"] );\n connection_options.db = std::stoi( config[\"db\"] );\n cout << \"connecting...\" << endl;\n Redis new_pub = Redis(connection_options);\n publisher = &new_pub;\n Subscriber subscriber = publisher->subscriber();\n\n BROKER_ID = config[\"broker\"];\n INVESTOR_ID = config[\"investor\"];\n PASSWORD = config[\"passwd\"];\n APPID = config[\"appid\"];\n AUTHCODE = config[\"authcode\"];\n USERINFO = config[\"userinfo\"];\n IP_ADDRESS = config[\"ip\"];\n MAC_ADDRESS = config[\"mac\"];\n logger->info(\"连接交易服务器..\");\n auto tt = std::chrono::system_clock::to_time_t(std::chrono::system_clock::now());\n auto tm = *localtime(&tt);\n auto now = tm.tm_hour * 100 + tm.tm_min;\n pTraderApi = CThostFtdcTraderApi::CreateFtdcTraderApi( trade_path.c_str() ); \/\/ 创建TradeApi\n auto *pTraderSpi = new CTraderSpi();\n pTraderApi->RegisterSpi(pTraderSpi); \/\/ 注册事件类\n pTraderApi->SubscribePublicTopic(THOST_TERT_QUICK); \/\/ 注册公有流\n pTraderApi->SubscribePrivateTopic(THOST_TERT_QUICK); \/\/ 注册私有流\n if ( (now >= 845 && now <= 1520) || (now >= 2045 && now <= 2359) ) {\n pTraderApi->RegisterFront( (char *) config[\"trade\"].c_str() ); \/\/ connect\n logger->info(\"当前时间：%v-%v-%v %v:%v:%v 连接正常交易网关\",\n tm.tm_year+1900, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec);\n }\n else {\n pTraderApi->RegisterFront( (char *) config[\"trade_off\"].c_str() ); \/\/ connect\n logger->info(\"当前时间：%v-%v-%v %v:%v:%v 连接离线查询网关\",\n tm.tm_year+1900, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec);\n }\n\/\/ logger->info(\"连接行情服务器..\");\n\/\/ pMdApi = CThostFtdcMdApi::CreateFtdcMdApi( md_path.c_str() ); \/\/ 创建MdApi\n\/\/ CThostFtdcMdSpi *pMdSpi = new CMdSpi();\n\/\/ pMdApi->RegisterSpi(pMdSpi); \/\/ 注册事件类\n\/\/ if ( now >= 845 && now <= 1520 || now >= 2045 && now <= 2359 )\n\/\/ pMdApi->RegisterFront( (char *) config[\"market\"].c_str() ); \/\/ connect\n\/\/ else\n\/\/ pMdApi->RegisterFront( (char *) config[\"market_off\"].c_str() ); \/\/ connect\n\n logger->info(\"开启命令处理线程..\");\n std::thread command_handler(handle_command);\n subscriber.psubscribe(CHANNEL_REQ_PATTERN);\n subscriber.on_pmessage(handle_req_request);\n\n pTraderApi->Init();\n\/\/ pMdApi->Init();\n\n std::thread([connection_options] {\n Redis beater = Redis(connection_options);\n while ( keep_running ) {\n beater.setex(\"HEARTBEAT:BACKEND_CTP\", 61, \"1\");\n std::this_thread::sleep_for(std::chrono::seconds(60));\n }\n }).detach();\n std::thread([&subscriber] {\n el::Helpers::setThreadName(\"redis\");\n while (keep_running) subscriber.consume();\n }).detach();\n logger->info(\"服务已启动.\");\n pTraderApi->Join();\n\/\/ pMdApi->Join();\n keep_running = false;\n command_handler.join();\n logger->info(\"服务已退出.\");\n return 0;\n}\n<commit_msg>Update main.cpp<commit_after>\/*\n * Copyright 2016 timercrack\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n#include <iostream>\n#include <thread>\n#include \"TraderSpi.h\"\n#include \"MdSpi.h\"\n#include \"global.h\"\n#if defined(__linux__)\n#include <unistd.h>\n#elif defined(_WIN32)\n#include <filesystem>\n#include <windows.h>\n#endif\nINITIALIZE_EASYLOGGINGPP \/\/ NOLINT\n\nusing namespace std;\nusing namespace sw::redis;\n\nint main(int argc, char **argv) {\n#ifdef _WIN32\n std::filesystem::path config_file = std::filesystem::current_path() \/ \"config.ini\";\n std::string config_path(std::filesystem::current_path().string());\n cout << \"config-file: \" << config_path + \"\\\\config.ini\"<< endl;\n std::string& log_path = config_path;\n std::string& md_path = config_path;\n std::string& trade_path = config_path;\n std::ifstream \tifs(config_file.string());\n#else\n std::string home_str(getenv(\"HOME\"));\n std::string config_path = home_str + \"\/.config\/backend-ctp\/config.ini\";\n std::string log_path = home_str + \"\/.cache\/backend-ctp\/log\";\n std::string md_path = home_str + \"\/.cache\/backend-ctp\/md\/\";\n std::string trade_path = home_str + \"\/.cache\/backend-ctp\/trade\/\";\n mkdir( log_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n mkdir( md_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n mkdir( trade_path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH );\n cout << \"config-file: \" << config_path << endl;\n std::ifstream \tifs(config_path);\n#endif\n std::string \tline, key, split, val;\n std::map<std::string, std::string> config;\n while ( std::getline(ifs, line) )\n if (std::stringstream(line) >> key >> split >> val && key[0] != ';' && split == \"=\")\n config[key] = val;\n\n #if defined(__linux__)\n if ( daemon(0, 0) ) return 1;\n #endif\n\n el::Configurations defaultConf;\n defaultConf.setToDefault();\n defaultConf.setGlobally( el::ConfigurationType::Format,\n\/\/ \"%datetime{%Y-%M-%d %H:%m:%s.%g} [%level] %msg\" );\n \"%datetime{%Y-%M-%d %H:%m:%s.%g} (%thread) [%level] %msg\" );\n defaultConf.setGlobally( el::ConfigurationType::Filename, log_path + \"\/backend-ctp.log\" );\n defaultConf.setGlobally( el::ConfigurationType::MaxLogFileSize, \"2097152\" );\n defaultConf.setGlobally( el::ConfigurationType::ToStandardOutput, \"0\" );\n el::Loggers::reconfigureLogger(\"default\", defaultConf);\n logger = el::Loggers::getLogger(\"default\");\n el::Helpers::setThreadName(\"main\");\n logger->info(\"服务重新启动，连接 redis %v:%v\", config[\"host\"], std::stoi( config[\"port\"] ));\n ConnectionOptions connection_options;\n connection_options.host = config[\"host\"];\n connection_options.port = std::stoi( config[\"port\"] );\n connection_options.db = std::stoi( config[\"db\"] );\n cout << \"connecting...\" << endl;\n Redis new_pub = Redis(connection_options);\n publisher = &new_pub;\n Subscriber subscriber = publisher->subscriber();\n\n BROKER_ID = config[\"broker\"];\n INVESTOR_ID = config[\"investor\"];\n PASSWORD = config[\"passwd\"];\n APPID = config[\"appid\"];\n AUTHCODE = config[\"authcode\"];\n USERINFO = config[\"userinfo\"];\n IP_ADDRESS = config[\"ip\"];\n MAC_ADDRESS = config[\"mac\"];\n logger->info(\"连接交易服务器..\");\n auto tt = std::chrono::system_clock::to_time_t(std::chrono::system_clock::now());\n auto tm = *localtime(&tt);\n auto now = tm.tm_hour * 100 + tm.tm_min;\n pTraderApi = CThostFtdcTraderApi::CreateFtdcTraderApi( trade_path.c_str() ); \/\/ 创建TradeApi\n auto *pTraderSpi = new CTraderSpi();\n pTraderApi->RegisterSpi(pTraderSpi); \/\/ 注册事件类\n pTraderApi->SubscribePublicTopic(THOST_TERT_QUICK); \/\/ 注册公有流\n pTraderApi->SubscribePrivateTopic(THOST_TERT_QUICK); \/\/ 注册私有流\n if ( (now >= 845 && now <= 1520) || (now >= 2045 && now <= 2359) ) {\n pTraderApi->RegisterFront( (char *) config[\"trade\"].c_str() ); \/\/ connect\n logger->info(\"当前时间：%v-%v-%v %v:%v:%v 连接正常交易网关\",\n tm.tm_year+1900, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec);\n }\n else {\n pTraderApi->RegisterFront( (char *) config[\"trade_off\"].c_str() ); \/\/ connect\n logger->info(\"当前时间：%v-%v-%v %v:%v:%v 连接离线查询网关\",\n tm.tm_year+1900, tm.tm_mon+1, tm.tm_mday, tm.tm_hour, tm.tm_min, tm.tm_sec);\n }\n\/\/ logger->info(\"连接行情服务器..\");\n\/\/ pMdApi = CThostFtdcMdApi::CreateFtdcMdApi( md_path.c_str() ); \/\/ 创建MdApi\n\/\/ CThostFtdcMdSpi *pMdSpi = new CMdSpi();\n\/\/ pMdApi->RegisterSpi(pMdSpi); \/\/ 注册事件类\n\/\/ if ( now >= 845 && now <= 1520 || now >= 2045 && now <= 2359 )\n\/\/ pMdApi->RegisterFront( (char *) config[\"market\"].c_str() ); \/\/ connect\n\/\/ else\n\/\/ pMdApi->RegisterFront( (char *) config[\"market_off\"].c_str() ); \/\/ connect\n\n logger->info(\"开启命令处理线程..\");\n std::thread command_handler(handle_command);\n subscriber.psubscribe(CHANNEL_REQ_PATTERN);\n subscriber.on_pmessage(handle_req_request);\n\n pTraderApi->Init();\n\/\/ pMdApi->Init();\n\n std::thread([connection_options] {\n Redis beater = Redis(connection_options);\n while ( keep_running ) {\n beater.setex(\"HEARTBEAT:BACKEND_CTP\", 61, \"1\");\n std::this_thread::sleep_for(std::chrono::seconds(60));\n }\n }).detach();\n std::thread([&subscriber] {\n el::Helpers::setThreadName(\"redis\");\n while (keep_running) subscriber.consume();\n }).detach();\n logger->info(\"服务已启动.\");\n pTraderApi->Join();\n\/\/ pMdApi->Join();\n keep_running = false;\n command_handler.join();\n logger->info(\"服务已退出.\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\topendatacon\n *\n *\tCopyright (c) 2014:\n *\n *\t\tDCrip3fJguWgVCLrZFfA7sIGgvx1Ou3fHfCxnrz4svAi\n *\t\tyxeOtDhDCXf1Z4ApgXvX5ahqQmzRfJ2DoX8S05SqHA==\n *\t\n *\tLicensed under the Apache License, Version 2.0 (the \"License\");\n *\tyou may not use this file except in compliance with the License.\n *\tYou may obtain a copy of the License at\n *\t\n *\t\thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *\tUnless required by applicable law or agreed to in writing, software\n *\tdistributed under the License is distributed on an \"AS IS\" BASIS,\n *\tWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *\tSee the License for the specific language governing permissions and\n *\tlimitations under the License.\n *\/ \n\/*\n * main.cpp\n *\n * Created on: 14\/07\/2014\n * Author: Neil Stephens <dearknarl@gmail.com>\n *\/\n\n\/*TODO:\n * \t-fix logging:\n * \t\t-cmd to change log level on the fly (part of config cmds: see below)\n * \t-add config change commands\n * \t\t-implement BuildOrRebuild properly for changed configs\n * \t\t-cmd to apply config item from command line\n * \t\t-cmd to load config from file\n * \t\t-save config to file\n * \t-add maintenance commands:\n * \t\t-enable\/disable\/restart ports\/connectors\/connections\n * \t-remove the need for DNP3Manager and two threadpools?\n * \t\t-DataConcentrator class can do it all\n * \t-implement plugin architecture - the following should be plugins:\n * \t\t-DataPort implementations - DONE\n * \t\t-Transform implementations\n * \t-add a network interface to the console\n *\t-network logging\n *\t-daemon mode\n *\t-more dataports to implement:\n *\t\t-EventGenPort (random events ala old test_slaves util)\n *\t\t-C37.118\n *\t\t-NMEA 2k \/ CANv2\n *\t\t-NMEA 0183\n *\t\t-XMLoHTML (inc. Gridlab-D)\n *\t\t-JSONoHTML\n *\/\n\n#include \"DataConcentrator.h\"\n#include <tclap\/CmdLine.h>\n#include <opendatacon\/Platform.h>\n#include <opendatacon\/Version.h>\n#include <errno.h>\n\nint main(int argc, char* argv[])\n{\n\tstd::unique_ptr<DataConcentrator> TheDataConcentrator(nullptr);\n\n\t\/\/ Wrap everything in a try block. Do this every time, \n\t\/\/ because exceptions will be thrown for problems.\n\ttry { \n\t\tTCLAP::CmdLine cmd(\"High performance asynchronous data concentrator\", ' ', ODC_VERSION_STRING);\n\t\tTCLAP::ValueArg<std::string> ConfigFileArg(\"c\", \"config\", \"Configuration file, specified as an absolute path or relative to the working directory.\", false, \"opendatacon.conf\", \"string\");\n\t\tcmd.add(ConfigFileArg);\n\t\tTCLAP::ValueArg<std::string> PathArg(\"p\", \"path\", \"Working directory path, all configuration files and log files are relative to this path.\", false, \"\", \"string\");\n\t\tcmd.add(PathArg);\n\n\t\tcmd.parse(argc, argv);\n\n\t\tstd::string ConfFileName = ConfigFileArg.getValue();\n\t\t\n\t\tif (PathArg.isSet())\n\t\t{\n\t\t\t\/\/ Try to change working directory\n\t\t\tstd::string PathName = PathArg.getValue();\n\t\t\tif (CHDIR(PathName.c_str()))\n\t\t\t{\n\t\t\t\tconst size_t strmax = 80;\n\t\t\t\tchar buf[strmax];\n\t\t\t\tstrerror_r(errno, buf, strmax);\n\t\t\t\tthrow std::runtime_error(buf);\n\t\t\t}\n\t\t}\n\n\t\tstd::cout << \"This is opendatacon version \" << ODC_VERSION_STRING << std::endl;\n\t\tstd::cout << \"Loading configuration... \";\n\t\tTheDataConcentrator.reset(new DataConcentrator(ConfFileName));\n\t\tstd::cout << \"done\" << std::endl << \"Initialising objects... \";\n\t\tTheDataConcentrator->BuildOrRebuild();\n\t\tstd::cout << \"done\" << std::endl << \"Starting up opendatacon...\" << std::endl;\n\t\tTheDataConcentrator->Run();\n\t\tstd::cout << \"opendatacon version \" << ODC_VERSION_STRING << \" shutdown cleanly.\" << std::endl;\n\t}\n\tcatch (TCLAP::ArgException &e) \/\/ catch any exceptions\n\t{\n\t\tstd::cerr << \"Command line error: \" << e.error() << \" for arg \" << e.argId() << std::endl;\n\t\treturn 1;\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << \"Caught exception: \" << e.what() << std::endl;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<commit_msg>Change scope of DataConcentrator object to catch destructor exceptions<commit_after>\/*\topendatacon\n *\n *\tCopyright (c) 2014:\n *\n *\t\tDCrip3fJguWgVCLrZFfA7sIGgvx1Ou3fHfCxnrz4svAi\n *\t\tyxeOtDhDCXf1Z4ApgXvX5ahqQmzRfJ2DoX8S05SqHA==\n *\t\n *\tLicensed under the Apache License, Version 2.0 (the \"License\");\n *\tyou may not use this file except in compliance with the License.\n *\tYou may obtain a copy of the License at\n *\t\n *\t\thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *\tUnless required by applicable law or agreed to in writing, software\n *\tdistributed under the License is distributed on an \"AS IS\" BASIS,\n *\tWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *\tSee the License for the specific language governing permissions and\n *\tlimitations under the License.\n *\/ \n\/*\n * main.cpp\n *\n * Created on: 14\/07\/2014\n * Author: Neil Stephens <dearknarl@gmail.com>\n *\/\n\n\/*TODO:\n * \t-fix logging:\n * \t\t-cmd to change log level on the fly (part of config cmds: see below)\n * \t-add config change commands\n * \t\t-implement BuildOrRebuild properly for changed configs\n * \t\t-cmd to apply config item from command line\n * \t\t-cmd to load config from file\n * \t\t-save config to file\n * \t-add maintenance commands:\n * \t\t-enable\/disable\/restart ports\/connectors\/connections\n * \t-remove the need for DNP3Manager and two threadpools?\n * \t\t-DataConcentrator class can do it all\n * \t-implement plugin architecture - the following should be plugins:\n * \t\t-DataPort implementations - DONE\n * \t\t-Transform implementations\n * \t-add a network interface to the console\n *\t-network logging\n *\t-daemon mode\n *\t-more dataports to implement:\n *\t\t-EventGenPort (random events ala old test_slaves util)\n *\t\t-C37.118\n *\t\t-NMEA 2k \/ CANv2\n *\t\t-NMEA 0183\n *\t\t-XMLoHTML (inc. Gridlab-D)\n *\t\t-JSONoHTML\n *\/\n\n#include \"DataConcentrator.h\"\n#include <tclap\/CmdLine.h>\n#include <opendatacon\/Platform.h>\n#include <opendatacon\/Version.h>\n#include <errno.h>\n\nint main(int argc, char* argv[])\n{\n\t\/\/ Wrap everything in a try block. Do this every time, \n\t\/\/ because exceptions will be thrown for problems.\n\ttry {\n\t\tstd::unique_ptr<DataConcentrator> TheDataConcentrator(nullptr);\n\n\t\tTCLAP::CmdLine cmd(\"High performance asynchronous data concentrator\", ' ', ODC_VERSION_STRING);\n\t\tTCLAP::ValueArg<std::string> ConfigFileArg(\"c\", \"config\", \"Configuration file, specified as an absolute path or relative to the working directory.\", false, \"opendatacon.conf\", \"string\");\n\t\tcmd.add(ConfigFileArg);\n\t\tTCLAP::ValueArg<std::string> PathArg(\"p\", \"path\", \"Working directory path, all configuration files and log files are relative to this path.\", false, \"\", \"string\");\n\t\tcmd.add(PathArg);\n\n\t\tcmd.parse(argc, argv);\n\n\t\tstd::string ConfFileName = ConfigFileArg.getValue();\n\t\t\n\t\tif (PathArg.isSet())\n\t\t{\n\t\t\t\/\/ Try to change working directory\n\t\t\tstd::string PathName = PathArg.getValue();\n\t\t\tif (CHDIR(PathName.c_str()))\n\t\t\t{\n\t\t\t\tconst size_t strmax = 80;\n\t\t\t\tchar buf[strmax];\n\t\t\t\tstrerror_r(errno, buf, strmax);\n\t\t\t\tthrow std::runtime_error(buf);\n\t\t\t}\n\t\t}\n\n\t\tstd::cout << \"This is opendatacon version \" << ODC_VERSION_STRING << std::endl;\n\t\tstd::cout << \"Loading configuration... \";\n\t\tTheDataConcentrator.reset(new DataConcentrator(ConfFileName));\n\t\tstd::cout << \"done\" << std::endl << \"Initialising objects... \";\n\t\tTheDataConcentrator->BuildOrRebuild();\n\t\tstd::cout << \"done\" << std::endl << \"Starting up opendatacon...\" << std::endl;\n\t\tTheDataConcentrator->Run();\n\t\tstd::cout << \"opendatacon version \" << ODC_VERSION_STRING << \" shutdown cleanly.\" << std::endl;\n\t}\n\tcatch (TCLAP::ArgException &e) \/\/ catch any exceptions\n\t{\n\t\tstd::cerr << \"Command line error: \" << e.error() << \" for arg \" << e.argId() << std::endl;\n\t\treturn 1;\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << \"Caught exception: \" << e.what() << std::endl;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <irrlicht.h>\n#ifdef _IRR_WINDOWS_\n#include <windows.h>\n#endif\n\n#include <stdio.h>\n\n#include \"CPOFMeshFileLoader.h\"\n\nusing namespace irr;\n\n#ifdef _WIN32\n\n#pragma comment(lib, \"Irrlicht.lib\")\nINT WINAPI WinMain( HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT )\n#else\nint main(int argc, char* argv[])\n#endif\n{\n\tscene::CPOFMeshFileLoader pof_loader(NULL, NULL);\n\n\treturn 0;\n}\n<commit_msg>first window<commit_after>#include <irrlicht.h>\n#ifdef _IRR_WINDOWS_\n#include <windows.h>\n#endif\n\n#include <stdio.h>\n\n#include \"CPOFMeshFileLoader.h\"\n\nusing namespace irr;\n\n#ifdef _WIN32\n\n#pragma comment(lib, \"Irrlicht.lib\")\nINT WINAPI WinMain( HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT )\n#else\nint main(int argc, char* argv[])\n#endif\n{\n\tscene::CPOFMeshFileLoader pof_loader(NULL, NULL);\n\n\tIrrlichtDevice *device;\n\n\tdevice = createDevice(video::EDT_OPENGL, core::dimension2d<u32>(640, 480), 32);\n\tif (!device) return 1;\n\tdevice->setWindowCaption(L\"POF Viewer\");\n\n\tvideo::IVideoDriver* driver = device->getVideoDriver();\n\tscene::ISceneManager* smgr = device->getSceneManager();\n\tgui::IGUIEnvironment* guienv = device->getGUIEnvironment();\n\n\twhile(device->run())\n\t{\n\t\tdriver->beginScene(true, true, video::SColor(255, 22, 22, 29));\n\n\t\tsmgr->drawAll();\n\t\tguienv->drawAll();\n\n\t\tdriver->endScene();\n\t}\n\n\tdevice->drop();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/\n\/\/ Copyright (c) 2013 MacGeneration. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification, are\n\/\/ permitted provided that the following conditions are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of\n\/\/ conditions and the following disclaimer.\n\/\/\n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list\n\/\/ of conditions and the following disclaimer in the documentation and\/or other materials\n\/\/ provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n\/\/ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n\/\/ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n\n#include \"global.hpp\"\n#include \"MMGAPNSConnection.hpp\"\n#include \"MMGDevice.hpp\"\n#include \"MMGIOSPayload.hpp\"\n#include \"MMGTools.hpp\"\n#include <vector>\n#include <cstdlib>\n\n\n#ifdef __APPLE__\n#pragma clang diagnostic ignored \"-Wdeprecated-declarations\"\n#pragma gcc diagnostic ignored \"-Wdeprecated-declarations\"\n#endif\n\n\nstatic size_t get_devices_list(std::vector<MMGDevice*>& vec)\n{\n\t\/\/ Implement your code logic to grab a list of devices\n\tconst unsigned int badge = 1;\n\tMMGDevice* device = new MMGDevice(\"token\", badge);\n\tvec.push_back(device);\n\treturn vec.size();\n#if 0\n\t\/* MySQL bridging example\n\t \n\t need to link with libmysqlclient or libmysqclient_r (multithread)\n\t also #include <mysql\/mysql.h>\n\n\t let's assume we have a simple table like that\n\t --------------\n\t | devices |\n\t |------------|\n\t |token |\n\t |unread_count|\n\t --------------\n\t *\/\n\n\tmysql_library_init(0, NULL, NULL);\n\n\t\/\/ Connect to db\n\tMYSQL* conn = mysql_init(NULL);\n\tif (NULL == conn)\n\t{\n\t\tMMG_ERRLOG(\"[!] Not enough memory to allocate the MySQL connection\\n\");\n\t\treturn 0;\n\t}\n\tmysql_options(conn, MYSQL_SET_CHARSET_NAME, \"utf8\");\n\tif (!mysql_real_connect(conn, \"host-or-ip\", \"user\", \"password\", \"database\", 0, NULL, 0))\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_real_connect: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\t\n\t\/\/ SELECT devices list\n\tconst char* query = \"SELECT token, unread_count FROM devices\";\n\tif (mysql_query(conn, query) != 0)\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_query: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\tMYSQL_RES* res = mysql_use_result(conn);\n\tif (NULL == res)\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_use_result: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\t\n\t\/\/ Build the list of MMGDevices\n\tMYSQL_ROW row = NULL;\n\twhile ((row = mysql_fetch_row(res)))\n\t{\n\t\tMMGDevice* device = new MMGDevice(row[0], MMGTools::StringToUnsignedInteger(row[1]));\n\t\tvec.push_back(device);\n }\n\t\n\tmysql_free_result(res);\n\tmysql_close(conn);\n\t\n\treturn vec.size();\n#endif\n}\n\nint main(void)\n{\n\t\/\/ SLL init only once\n\tSSL_load_error_strings();\n\tSSL_library_init();\n\n\t\/\/ Get a list of devices\n\tstd::vector<MMGDevice*> devices;\n\tget_devices_list(devices);\n\n\t\/\/ Create a payload object\n\tMMGIOSPayload payload(\"Push message\", \"Slider label\", 1, \"sound.caf\");\n\n\t\/\/ Create the APNS connection, empty string if no password for the private key\n\tMMGAPNSConnection connection(MMG_APNS_CA_PATH, MMG_APNS_CERT_PATH, MMG_APNS_PRIVATEKEY_PATH, \"private-key-password\", true);\n\t\/\/ Open the connection\n\tif (connection.OpenConnection() != MMGConnectionError::MMGNoError)\n\t\treturn EXIT_FAILURE;\n\n\t\/\/ Send the payload\n\tuint32_t notifId = 1;\n\tfor (MMGDevice* device : devices)\n\t{\n\t\t\/\/ Update payload badge number to reflect device's one\n\t\tpayload.SetBadgeNumber(device->GetBadge());\n\t\t\/\/ Send payload to the device\n\t\tconnection.SendPayloadToDevice_new(payload, *device, notifId++);\n\t}\n\n\t\/\/ Free up memory\n\tfor (MMGDevice* device : devices)\n\t\tdelete device;\n\n\t\/\/ Close the connection\n\tconnection.CloseConnection();\n\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>remove pragma<commit_after>\/\/\n\/\/ main.cpp\n\/\/\n\/\/ Copyright (c) 2013 MacGeneration. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification, are\n\/\/ permitted provided that the following conditions are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of\n\/\/ conditions and the following disclaimer.\n\/\/\n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list\n\/\/ of conditions and the following disclaimer in the documentation and\/or other materials\n\/\/ provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n\/\/ WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND\n\/\/ FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n\/\/ ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF\n\/\/ ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n\n#include \"global.hpp\"\n#include \"MMGAPNSConnection.hpp\"\n#include \"MMGDevice.hpp\"\n#include \"MMGIOSPayload.hpp\"\n#include \"MMGTools.hpp\"\n#include <vector>\n#include <cstdlib>\n\n\n#ifdef __APPLE__\n#pragma clang diagnostic ignored \"-Wdeprecated-declarations\"\n#endif\n\n\nstatic size_t get_devices_list(std::vector<MMGDevice*>& vec)\n{\n\t\/\/ Implement your code logic to grab a list of devices\n\tconst unsigned int badge = 1;\n\tMMGDevice* device = new MMGDevice(\"token\", badge);\n\tvec.push_back(device);\n\treturn vec.size();\n#if 0\n\t\/* MySQL bridging example\n\t \n\t need to link with libmysqlclient or libmysqclient_r (multithread)\n\t also #include <mysql\/mysql.h>\n\n\t let's assume we have a simple table like that\n\t --------------\n\t | devices |\n\t |------------|\n\t |token |\n\t |unread_count|\n\t --------------\n\t *\/\n\n\tmysql_library_init(0, NULL, NULL);\n\n\t\/\/ Connect to db\n\tMYSQL* conn = mysql_init(NULL);\n\tif (NULL == conn)\n\t{\n\t\tMMG_ERRLOG(\"[!] Not enough memory to allocate the MySQL connection\\n\");\n\t\treturn 0;\n\t}\n\tmysql_options(conn, MYSQL_SET_CHARSET_NAME, \"utf8\");\n\tif (!mysql_real_connect(conn, \"host-or-ip\", \"user\", \"password\", \"database\", 0, NULL, 0))\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_real_connect: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\t\n\t\/\/ SELECT devices list\n\tconst char* query = \"SELECT token, unread_count FROM devices\";\n\tif (mysql_query(conn, query) != 0)\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_query: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\tMYSQL_RES* res = mysql_use_result(conn);\n\tif (NULL == res)\n\t{\n\t\tMMG_ERRLOG(\"[!] mysql_use_result: %s\\n\", mysql_error(conn));\n\t\tmysql_close(conn);\n\t\treturn 0;\n\t}\n\t\n\t\/\/ Build the list of MMGDevices\n\tMYSQL_ROW row = NULL;\n\twhile ((row = mysql_fetch_row(res)))\n\t{\n\t\tMMGDevice* device = new MMGDevice(row[0], MMGTools::StringToUnsignedInteger(row[1]));\n\t\tvec.push_back(device);\n }\n\t\n\tmysql_free_result(res);\n\tmysql_close(conn);\n\t\n\treturn vec.size();\n#endif\n}\n\nint main(void)\n{\n\t\/\/ SLL init only once\n\tSSL_load_error_strings();\n\tSSL_library_init();\n\n\t\/\/ Get a list of devices\n\tstd::vector<MMGDevice*> devices;\n\tget_devices_list(devices);\n\n\t\/\/ Create a payload object\n\tMMGIOSPayload payload(\"Push message\", \"Slider label\", 1, \"sound.caf\");\n\n\t\/\/ Create the APNS connection, empty string if no password for the private key\n\tMMGAPNSConnection connection(MMG_APNS_CA_PATH, MMG_APNS_CERT_PATH, MMG_APNS_PRIVATEKEY_PATH, \"private-key-password\", true);\n\t\/\/ Open the connection\n\tif (connection.OpenConnection() != MMGConnectionError::MMGNoError)\n\t\treturn EXIT_FAILURE;\n\n\t\/\/ Send the payload\n\tuint32_t notifId = 1;\n\tfor (MMGDevice* device : devices)\n\t{\n\t\t\/\/ Update payload badge number to reflect device's one\n\t\tpayload.SetBadgeNumber(device->GetBadge());\n\t\t\/\/ Send payload to the device\n\t\tconnection.SendPayloadToDevice_new(payload, *device, notifId++);\n\t}\n\n\t\/\/ Free up memory\n\tfor (MMGDevice* device : devices)\n\t\tdelete device;\n\n\t\/\/ Close the connection\n\tconnection.CloseConnection();\n\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* my own headers *\/\n#include \"landscape.h\"\n#include \"error_handling.h\"\n#include \"command_line.h\"\n#include \"popsim.h\"\n#include \"stats.h\"\n#include \"sequence.h\"\n\n\/* system headers *\/\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nvoid usage(void);\n\nint main(int argc, char *argv[]) { try {\n Args ar;\n if (argc == 1) {\n usage();\n return 0;\n }\n\n \/* read in the command line arguments and print them out *\/\n ar.populate(argc, argv);\n cout << \"args: \" << ar << endl;\n\n \/* create the random number generator *\/\n RandomNumberGenerator *rng = 0;\n rng = new RandomNumberGenerator(ar.rand_seed);\n\n \/* create the landscape *\/\n Landscape *l = 0;\n switch (ar.model) {\n case block:\n l = new LandscapeBlockModel(ar.num_blocks, \n ar.seq_length\/ar.num_blocks, ar.distr_mean, ar.distr_sd, rng);\n break;\n case segal:\n if (ar.autofit) {\n cerr << \"autofitting\" << endl;\n l = new LandscapeSegalModelFitted(ar.num_tfs, ar.pwm_filename,\n ar.segal_conditions, (unsigned int)19, ar.steps, rng, \n ar.segal_obs_expr, ar.segal_sd_lambda, ar.segal_sd_alpha, \n ar.segal_sd_gamma, ar.sequences, ar.num_slots, ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n } else {\n if (ar.sampling_method == importance) {\n cerr << \"using importance sampling method\" << endl;\n \/* we use the IS_* parameters as the importance distribution \n * from which we'll sample. And then we pass the segal_* parameters\n * as the target distribution parameters that is then used to \n * calculate the importance weights *\/\n l = new LandscapeSegalModelSpecifiedIS(ar.num_tfs, ar.pwm_filename,\n ar.segal_lambda, ar.IS_segal_alpha, ar.segal_conditions,\n ar.IS_segal_gamma, ar.steps, ar.segal_expr_fit_func, 19, rng, \n ar.segal_gamma, ar.segal_alpha, ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n } else { \/* regular iid sampling *\/\n l = new LandscapeSegalModelSpecifiedIID(ar.num_tfs, ar.pwm_filename,\n ar.segal_lambda, ar.segal_alpha, ar.segal_conditions, \n ar.segal_gamma, ar.steps, ar.segal_expr_fit_func, 19, rng,\n ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n }\n }\n break;\n case neutral:\n l = new LandscapeNeutralModel(rng);\n break;\n default:\n throw SimError(\"invalid landscape type\");\n }\n\n if (ar.autofit) {\n \/* We're trying to fit fit the model to the provided expression data *\/\n\n LandscapeSegalModelFitted *lpt = (LandscapeSegalModelFitted*)l;\n lpt->create_chains(ar.num_chains, *ar.segal_chain_temps);\n cerr << \"auto fit created \" << lpt->parallel_tempered.num_chains() << \n \" chains\" << endl;\n lpt->precompute_lookup_tables(ar.sequences, ar.steps);\n cerr << \"initing energies\" << endl;\n lpt->parallel_tempered.init_energies();\n cerr << \"running chains\" << endl;\n lpt->parallel_tempered.run_chains(ar.segal_chain_steps);\n \n } else if (ar.do_popsim) {\n \/* we're doing a population simulation *\/\n\n PopState ps(ar.pop_size, ar.mu_rate, ar.rec_rate, l, ar.deletion_params,\n ar.duplication_params);\n\n \/* give the popstats access to the popstate and set stats marked print\n * at end, to print at the end. *\/\n for (vector<PopStat>::iterator i = ar.popstats.begin(); \n i != ar.popstats.end(); i++) {\n i->set_popstate(&ps);\n if (i->modulo == PRINT_STAT_AT_END)\n i->modulo = ar.generations;\n }\n\n \/* create an allele unless we have ones from the command line *\/\n if (ar.sequences.size() < 1) {\n string empty(ar.seq_length, l->alphabet[0]);\n Sequence s(empty, l->alphabet);\n l->rng->uniform_dna(s, ar.seq_length, l);\n ps.alleles[s] = new Allele(s, ps.N, ps.generation, l);\n }\n for (vector<string>::iterator i = ar.sequences.begin(); \n i != ar.sequences.end(); i++) {\n Sequence s(*i, l->alphabet);\n ps.alleles[s] = new Allele(s, ps.N\/ar.sequences.size(), \n ps.generation, l);\n }\n\n \/* run the simulation *\/\n ps.run(ar.popstats, ar.generations);\n\n } else {\n \/* characterization of landscape part *\/\n\n \/* make sure we're not asked for popstats if not doing a popsim *\/\n if (ar.popstats.size() > 0) {\n cerr << \"pop stats require --popsim option\" << endl;\n usage();\n }\n\n \/* give the scapetats access to the landscape *\/\n for (vector<ScapeStat>::iterator i = ar.scapestats.begin(); \n i != ar.scapestats.end(); i++) \n i->set_landscape(l);\n\n \/* loop, sampling nodes in the landscape uniformly until we do enough *\/\n set<Sequence> draws;\n for (vector<string>::iterator i = ar.sequences.begin(); \n i != ar.sequences.end(); i++) {\n Sequence s(*i, l->alphabet);\n draws.insert(s);\n }\n sort(ar.scapestats.rbegin(), ar.scapestats.rend());\n for (l->cur_rep = 0; l->cur_rep < ar.max_reps; l->cur_rep++) {\n if (draws.size() == 0) {\n Sequence draw = l->sample(ar.seq_length);\n draws.insert(draw);\n }\n unsigned int ns = ar.neighbor_steps;\n while (ns-- > 0) {\n \/* add neighbors *\/\n l->insert_neighbors(draws);\n }\n for (set<Sequence>::iterator dr=draws.begin(); dr!=draws.end(); dr++) {\n for (vector<ScapeStat>::iterator i = ar.scapestats.begin();\n i != ar.scapestats.end(); i++) {\n if (l->cur_rep < i->reps) {\n i->calc_and_show(cout, *dr);\n } else {\n \/* since we've sorted the stats by reps required, when we\n * encounter a stat that's already done enough reps we know\n * the rest have also done enough reps *\/\n break;\n }\n }\n }\n draws.clear();\n }\n }\n\n if (rng != 0) delete rng;\n if (l!=0) delete l;\n\n\/* deal with various possible errors *\/\n} catch (SimUsageError e) {\n cerr << endl << \"detected usage error: \" << e.detail << endl << endl;\n usage();\n return 1;\n} catch(SimError &e) {\n cerr << \"uncaught exception: \" << e.detail << endl;\n\n\/* exit *\/\n} return 0; }\n\n\/* print out usage information *\/\nvoid usage(void) {\n cerr << \n\"usage: scapestats [options]\\n\"\n\"\\n\"\n\" general options:\\n\"\n\" -m\/--model (block|segal|neutral)\\n\" \n\" --popsim - run a population simulation\\n\"\n\" --seed <int> - random number generator seed\\n\"\n\" --seq <string> - a sequence to queue\\n\"\n\"\\n\"\n\" model-specific options: \\n\"\n\" block model:\\n\"\n\" --mean <float> - mean of within-block distr.\\n\"\n\" --sd <float> - sd of within-block distr.\\n\"\n\" --blocks <int> - number of blocks\\n\"\n\" --length <int> - length of sequence\\n\"\n\"\\n\"\n\" segal model, general:\\n\"\n\" --length <int> - length of sequence\\n\"\n\" --tfs <int> - number of transcription factors\\n\"\n\" --pwm <filename> - filename containing PWM definitions\\n\"\n\" --condition=c1,c2,... - list of floats specifying TF levels\\n\"\n\" multiple of conditions may be specified\\n\"\n\" --steps <int> - number of iid samples for estimating expr.\\n\"\n\"\\n\"\n\" segal model automatic parameter estimation:\\n\"\n\" --autofit - when specified, will try and fit params\\n\"\n\" --chains <int> - number of parallel tempering chains\\n\"\n\" --chain_steps <int> - number of steps to run the chain\\n\"\n\" --expression=e1,e2,... - observed expression. One entry per seq.\\n\"\n\" --psd_lambda <float> - proposal variance for lambda updates\\n\"\n\" --psd_alpha <float> - proposal variance for alpha updates\\n\"\n\" --psd_gamma <float> - proposal variance for gamma updates\\n\"\n\/\/\" --alpha_lattice=a1,a2, - grid of alpha (expr scalar) values for IS\\n\"\n\"\\n\"\n\" segal model paremeters\\n\"\n\" --lambda=l0,l1,l2,... - list of floats for baseline and TF lambda\\n\"\n\" --gamma=g11,g21,g12,g22 - cooperativity matrix by column\\n\"\n\" --alpha=s1,s2,... - expression scaling parameters\\n\"\n\" --logistic_param=d - use 1\/(1+exp(-x\/d))\\n\"\n\" --tfsep <int> - minimum spacing between TFs in a config\\n\"\n\"\\n\"\n\" segal expression-fitness function\\n\"\n\" --ffunc <choice> - here are the fitness function choices.\\n\"\n\" --coef must bi given with the correct\\n\"\n\" number of coefficients.\\n\" \n\" linear : f = <x> dot <c> where x is the expr. vec., c coef vec.\\n\"\n\" nop : f = 1\\n\"\n\" f1 : f = a * (x1-b)^2 + c * (x2-d)^2 + e\\n\"\n\" f2 : f = a^(-b*(x1-c)^2) * d^(-e*(x2-f)^2)\\n\"\n\" f3 : f = prod(a^(-b*(xi-ci)^2))^(1\/C) : i in (1..C) for C cond.\\n\"\n\" f4 : f = exp((-1)*sum((xi-bi)^2\/a)) : i in (1...C) for C cond.\\n\"\n\" --coef=a,b,c,.. - list of coefficients for chosen fit. func.\\n\"\n\"\\n\"\n\" segal model sampling parameters:\\n\"\n\" --sampling=<iid|importance> - which sampling method to employ\\n\"\n\" --IS_gamma=g11,g21,g12,g22 - IS distr. cooperativity matrix\\n\"\n\" --IS_alpha=s1,s2,... - list of expr. scalars, one per TF\\n\"\n\"\\n\"\n\" population simulation options:\\n\"\n\" -g\/--generations <int> - number of gen to run\\n\"\n\" -u\/--mutation <float> - per bp mutation rate\\n\"\n\" -N\/--popsize <int> - effective population size\\n\"\n\" --deletion=u,n,p - rate, and negative binomial dup params\\n\" \n\" --duplication=u,n,p - rate, and negative binomial dup params\\n\" \n\"\\n\"\n\" population statistics options (only valid in the presence\\n\"\n\" of --popsim. May use multiple pstat options. Of the form\\n\"\n\" --pstat=statname to print at the end or --pstat=statname,2\\n\"\n\" if one wants statname printed every 2 generations. Default is\\n\"\n\" each generation).\\n\"\n\" --pstat=most_freq_seq - most frequent allele\\n\"\n\" --pstat=most_freq_noseq - most frequent allele minus the sequence\\n\"\n\" --pstat=mean_fitness - population mean fitness\\n\"\n\" --pstat=all_alleles - details of each allele, sorted by # copies\\n\"\n\" --pstat=allele_counter - number of alleles queried so far\\n\"\n\/\/\" --pstat=site_frequencies - positions and frequencies of seg. sites\\n\"\n\"\\n\"\n\" population real-time statistics:\\n\"\n\" --pstat=mutational_effects - print fitness info for new mutants\\n\"\n\" --pstat=allele_loss - print the generation and allele id for\\n\"\n\" alleles when they're lost\\n\"\n\"\\n\"\n\" landscape sampling\/traversal options:\\n\"\n\" --neighbors <int> - for each sample, include neighbors within\\n\"\n\" the specified number of steps\\n\"\n\"\\n\"\n\" landscape statistic options (only valid in the absence of --popsim.\\n\"\n\" May use multiple lstat options. In all cases, reps is the number\\n\"\n\" of nodes for which the statistic will be printed, all uniformly\\n\"\n\" sampled from the landscape. If multiple statistics are requested\\n\"\n\" the same starting points will be used up until the number of reps\\n\"\n\" for each particular statistic is reached. All parameters are\\n\"\n\" always required for each statistic.)\\n\"\n\" --lstat=fitness,reps - node fitness\\n\"\n\" --lstat=n_step_mean,reps,n,s - mean fitness (s samples) n steps away\\n\"\n\" --lstat=banding,reps,x - band statistics for tried size x\\n\"\n\" --lstat=sequence,reps - print out sequence per rep\\n\"\n\"\\n\"\n\" landscape statistics specifically for Segal model\\n\"\n\" --lstat=expression,reps - print vector of expression levels\\n\"\n\" --lstat=tf_occupancy,reps - print list of TF occupancy levels for\\n\"\n\" each condition and TF combination\\n\"\n\" --lstat=wsum,reps - the sum of all configuration weights\\n\"\n\" --lstat=configs,1 - print out configurations\\n\"\n\"\\n\";\n return;\n}\n<commit_msg>Changed the program name from scapestats to regevscape<commit_after>\/* my own headers *\/\n#include \"landscape.h\"\n#include \"error_handling.h\"\n#include \"command_line.h\"\n#include \"popsim.h\"\n#include \"stats.h\"\n#include \"sequence.h\"\n\n\/* system headers *\/\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nvoid usage(void);\n\nint main(int argc, char *argv[]) { try {\n Args ar;\n if (argc == 1) {\n usage();\n return 0;\n }\n\n \/* read in the command line arguments and print them out *\/\n ar.populate(argc, argv);\n cout << \"args: \" << ar << endl;\n\n \/* create the random number generator *\/\n RandomNumberGenerator *rng = 0;\n rng = new RandomNumberGenerator(ar.rand_seed);\n\n \/* create the landscape *\/\n Landscape *l = 0;\n switch (ar.model) {\n case block:\n l = new LandscapeBlockModel(ar.num_blocks, \n ar.seq_length\/ar.num_blocks, ar.distr_mean, ar.distr_sd, rng);\n break;\n case segal:\n if (ar.autofit) {\n cerr << \"autofitting\" << endl;\n l = new LandscapeSegalModelFitted(ar.num_tfs, ar.pwm_filename,\n ar.segal_conditions, (unsigned int)19, ar.steps, rng, \n ar.segal_obs_expr, ar.segal_sd_lambda, ar.segal_sd_alpha, \n ar.segal_sd_gamma, ar.sequences, ar.num_slots, ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n } else {\n if (ar.sampling_method == importance) {\n cerr << \"using importance sampling method\" << endl;\n \/* we use the IS_* parameters as the importance distribution \n * from which we'll sample. And then we pass the segal_* parameters\n * as the target distribution parameters that is then used to \n * calculate the importance weights *\/\n l = new LandscapeSegalModelSpecifiedIS(ar.num_tfs, ar.pwm_filename,\n ar.segal_lambda, ar.IS_segal_alpha, ar.segal_conditions,\n ar.IS_segal_gamma, ar.steps, ar.segal_expr_fit_func, 19, rng, \n ar.segal_gamma, ar.segal_alpha, ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n } else { \/* regular iid sampling *\/\n l = new LandscapeSegalModelSpecifiedIID(ar.num_tfs, ar.pwm_filename,\n ar.segal_lambda, ar.segal_alpha, ar.segal_conditions, \n ar.segal_gamma, ar.steps, ar.segal_expr_fit_func, 19, rng,\n ar.segal_logistic_parameter, ar.segal_min_tf_sep);\n }\n }\n break;\n case neutral:\n l = new LandscapeNeutralModel(rng);\n break;\n default:\n throw SimError(\"invalid landscape type\");\n }\n\n if (ar.autofit) {\n \/* We're trying to fit fit the model to the provided expression data *\/\n\n LandscapeSegalModelFitted *lpt = (LandscapeSegalModelFitted*)l;\n lpt->create_chains(ar.num_chains, *ar.segal_chain_temps);\n cerr << \"auto fit created \" << lpt->parallel_tempered.num_chains() << \n \" chains\" << endl;\n lpt->precompute_lookup_tables(ar.sequences, ar.steps);\n cerr << \"initing energies\" << endl;\n lpt->parallel_tempered.init_energies();\n cerr << \"running chains\" << endl;\n lpt->parallel_tempered.run_chains(ar.segal_chain_steps);\n \n } else if (ar.do_popsim) {\n \/* we're doing a population simulation *\/\n\n PopState ps(ar.pop_size, ar.mu_rate, ar.rec_rate, l, ar.deletion_params,\n ar.duplication_params);\n\n \/* give the popstats access to the popstate and set stats marked print\n * at end, to print at the end. *\/\n for (vector<PopStat>::iterator i = ar.popstats.begin(); \n i != ar.popstats.end(); i++) {\n i->set_popstate(&ps);\n if (i->modulo == PRINT_STAT_AT_END)\n i->modulo = ar.generations;\n }\n\n \/* create an allele unless we have ones from the command line *\/\n if (ar.sequences.size() < 1) {\n string empty(ar.seq_length, l->alphabet[0]);\n Sequence s(empty, l->alphabet);\n l->rng->uniform_dna(s, ar.seq_length, l);\n ps.alleles[s] = new Allele(s, ps.N, ps.generation, l);\n }\n for (vector<string>::iterator i = ar.sequences.begin(); \n i != ar.sequences.end(); i++) {\n Sequence s(*i, l->alphabet);\n ps.alleles[s] = new Allele(s, ps.N\/ar.sequences.size(), \n ps.generation, l);\n }\n\n \/* run the simulation *\/\n ps.run(ar.popstats, ar.generations);\n\n } else {\n \/* characterization of landscape part *\/\n\n \/* make sure we're not asked for popstats if not doing a popsim *\/\n if (ar.popstats.size() > 0) {\n cerr << \"pop stats require --popsim option\" << endl;\n usage();\n }\n\n \/* give the scapetats access to the landscape *\/\n for (vector<ScapeStat>::iterator i = ar.scapestats.begin(); \n i != ar.scapestats.end(); i++) \n i->set_landscape(l);\n\n \/* loop, sampling nodes in the landscape uniformly until we do enough *\/\n set<Sequence> draws;\n for (vector<string>::iterator i = ar.sequences.begin(); \n i != ar.sequences.end(); i++) {\n Sequence s(*i, l->alphabet);\n draws.insert(s);\n }\n sort(ar.scapestats.rbegin(), ar.scapestats.rend());\n for (l->cur_rep = 0; l->cur_rep < ar.max_reps; l->cur_rep++) {\n if (draws.size() == 0) {\n Sequence draw = l->sample(ar.seq_length);\n draws.insert(draw);\n }\n unsigned int ns = ar.neighbor_steps;\n while (ns-- > 0) {\n \/* add neighbors *\/\n l->insert_neighbors(draws);\n }\n for (set<Sequence>::iterator dr=draws.begin(); dr!=draws.end(); dr++) {\n for (vector<ScapeStat>::iterator i = ar.scapestats.begin();\n i != ar.scapestats.end(); i++) {\n if (l->cur_rep < i->reps) {\n i->calc_and_show(cout, *dr);\n } else {\n \/* since we've sorted the stats by reps required, when we\n * encounter a stat that's already done enough reps we know\n * the rest have also done enough reps *\/\n break;\n }\n }\n }\n draws.clear();\n }\n }\n\n if (rng != 0) delete rng;\n if (l!=0) delete l;\n\n\/* deal with various possible errors *\/\n} catch (SimUsageError e) {\n cerr << endl << \"detected usage error: \" << e.detail << endl << endl;\n usage();\n return 1;\n} catch(SimError &e) {\n cerr << \"uncaught exception: \" << e.detail << endl;\n\n\/* exit *\/\n} return 0; }\n\n\/* print out usage information *\/\nvoid usage(void) {\n cerr << \n\"usage: regevscape [options]\\n\"\n\"\\n\"\n\" general options:\\n\"\n\" -m\/--model (block|segal|neutral)\\n\" \n\" --popsim - run a population simulation\\n\"\n\" --seed <int> - random number generator seed\\n\"\n\" --seq <string> - a sequence to queue\\n\"\n\"\\n\"\n\" model-specific options: \\n\"\n\" block model:\\n\"\n\" --mean <float> - mean of within-block distr.\\n\"\n\" --sd <float> - sd of within-block distr.\\n\"\n\" --blocks <int> - number of blocks\\n\"\n\" --length <int> - length of sequence\\n\"\n\"\\n\"\n\" segal model, general:\\n\"\n\" --length <int> - length of sequence\\n\"\n\" --tfs <int> - number of transcription factors\\n\"\n\" --pwm <filename> - filename containing PWM definitions\\n\"\n\" --condition=c1,c2,... - list of floats specifying TF levels\\n\"\n\" multiple of conditions may be specified\\n\"\n\" --steps <int> - number of iid samples for estimating expr.\\n\"\n\"\\n\"\n\" segal model automatic parameter estimation:\\n\"\n\" --autofit - when specified, will try and fit params\\n\"\n\" --chains <int> - number of parallel tempering chains\\n\"\n\" --chain_steps <int> - number of steps to run the chain\\n\"\n\" --expression=e1,e2,... - observed expression. One entry per seq.\\n\"\n\" --psd_lambda <float> - proposal variance for lambda updates\\n\"\n\" --psd_alpha <float> - proposal variance for alpha updates\\n\"\n\" --psd_gamma <float> - proposal variance for gamma updates\\n\"\n\/\/\" --alpha_lattice=a1,a2, - grid of alpha (expr scalar) values for IS\\n\"\n\"\\n\"\n\" segal model paremeters\\n\"\n\" --lambda=l0,l1,l2,... - list of floats for baseline and TF lambda\\n\"\n\" --gamma=g11,g21,g12,g22 - cooperativity matrix by column\\n\"\n\" --alpha=s1,s2,... - expression scaling parameters\\n\"\n\" --logistic_param=d - use 1\/(1+exp(-x\/d))\\n\"\n\" --tfsep <int> - minimum spacing between TFs in a config\\n\"\n\"\\n\"\n\" segal expression-fitness function\\n\"\n\" --ffunc <choice> - here are the fitness function choices.\\n\"\n\" --coef must bi given with the correct\\n\"\n\" number of coefficients.\\n\" \n\" linear : f = <x> dot <c> where x is the expr. vec., c coef vec.\\n\"\n\" nop : f = 1\\n\"\n\" f1 : f = a * (x1-b)^2 + c * (x2-d)^2 + e\\n\"\n\" f2 : f = a^(-b*(x1-c)^2) * d^(-e*(x2-f)^2)\\n\"\n\" f3 : f = prod(a^(-b*(xi-ci)^2))^(1\/C) : i in (1..C) for C cond.\\n\"\n\" f4 : f = exp((-1)*sum((xi-bi)^2\/a)) : i in (1...C) for C cond.\\n\"\n\" --coef=a,b,c,.. - list of coefficients for chosen fit. func.\\n\"\n\"\\n\"\n\" segal model sampling parameters:\\n\"\n\" --sampling=<iid|importance> - which sampling method to employ\\n\"\n\" --IS_gamma=g11,g21,g12,g22 - IS distr. cooperativity matrix\\n\"\n\" --IS_alpha=s1,s2,... - list of expr. scalars, one per TF\\n\"\n\"\\n\"\n\" population simulation options:\\n\"\n\" -g\/--generations <int> - number of gen to run\\n\"\n\" -u\/--mutation <float> - per bp mutation rate\\n\"\n\" -N\/--popsize <int> - effective population size\\n\"\n\" --deletion=u,n,p - rate, and negative binomial dup params\\n\" \n\" --duplication=u,n,p - rate, and negative binomial dup params\\n\" \n\"\\n\"\n\" population statistics options (only valid in the presence\\n\"\n\" of --popsim. May use multiple pstat options. Of the form\\n\"\n\" --pstat=statname to print at the end or --pstat=statname,2\\n\"\n\" if one wants statname printed every 2 generations. Default is\\n\"\n\" each generation).\\n\"\n\" --pstat=most_freq_seq - most frequent allele\\n\"\n\" --pstat=most_freq_noseq - most frequent allele minus the sequence\\n\"\n\" --pstat=mean_fitness - population mean fitness\\n\"\n\" --pstat=all_alleles - details of each allele, sorted by # copies\\n\"\n\" --pstat=allele_counter - number of alleles queried so far\\n\"\n\/\/\" --pstat=site_frequencies - positions and frequencies of seg. sites\\n\"\n\"\\n\"\n\" population real-time statistics:\\n\"\n\" --pstat=mutational_effects - print fitness info for new mutants\\n\"\n\" --pstat=allele_loss - print the generation and allele id for\\n\"\n\" alleles when they're lost\\n\"\n\"\\n\"\n\" landscape sampling\/traversal options:\\n\"\n\" --neighbors <int> - for each sample, include neighbors within\\n\"\n\" the specified number of steps\\n\"\n\"\\n\"\n\" landscape statistic options (only valid in the absence of --popsim.\\n\"\n\" May use multiple lstat options. In all cases, reps is the number\\n\"\n\" of nodes for which the statistic will be printed, all uniformly\\n\"\n\" sampled from the landscape. If multiple statistics are requested\\n\"\n\" the same starting points will be used up until the number of reps\\n\"\n\" for each particular statistic is reached. All parameters are\\n\"\n\" always required for each statistic.)\\n\"\n\" --lstat=fitness,reps - node fitness\\n\"\n\" --lstat=n_step_mean,reps,n,s - mean fitness (s samples) n steps away\\n\"\n\" --lstat=banding,reps,x - band statistics for tried size x\\n\"\n\" --lstat=sequence,reps - print out sequence per rep\\n\"\n\"\\n\"\n\" landscape statistics specifically for Segal model\\n\"\n\" --lstat=expression,reps - print vector of expression levels\\n\"\n\" --lstat=tf_occupancy,reps - print list of TF occupancy levels for\\n\"\n\" each condition and TF combination\\n\"\n\" --lstat=wsum,reps - the sum of all configuration weights\\n\"\n\" --lstat=configs,1 - print out configurations\\n\"\n\"\\n\";\n return;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2018 Sven Willner <sven.willner@pik-potsdam.de>\n * Free software under GNU Affero General Public License v3, see LICENSE\n *\/\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include \"Hector.h\"\n#include \"Observable.h\"\n#include \"h_exception.hpp\"\n#include \"h_util.hpp\"\n\nnamespace py = pybind11;\n\nnamespace pyhector {\n\nPYBIND11_MODULE(_binding, m) {\n m.doc() = R\"pbdoc(\n pyhector._binding\n -----------------\n\n `pyhector` is a Python wrapper for the simple global climate\n carbon-cycle model Hector (https:\/\/github.com\/JGCRI\/hector).\n\n See README.rst and repository for details:\n https:\/\/github.com\/openclimatedata\/pyhector\n )pbdoc\";\n\n static py::exception<h_exception> hector_exception(m, \"HectorException\");\n py::register_exception_translator([](std::exception_ptr p) {\n try {\n if (p) {\n std::rethrow_exception(p);\n }\n } catch (const h_exception& e) {\n hector_exception(e.what());\n }\n });\n\n py::class_<Hector>(m, \"_Hector\", \"Class providing an interface to Hector\")\n .def(py::init())\n .def_property_readonly(\"run_size\", &Hector::run_size, \"Number of steps to run\")\n .def_property_readonly(\"spinup_size\", &Hector::spinup_size, \"Number of spinup steps run\")\n .def_property_readonly(\"start_date\", &Hector::start_date, \"Start date\")\n .def_property_readonly(\"end_date\", &Hector::end_date, \"End date\")\n .def(\"add_observable\", &Hector::add_observable,\n R\"doc(\n Set a variable that can be read later.\n See :mod:`pyhector.output` for available components and variables.\n\n Parameters\n ----------\n component : str\n Name of Hector component\n name : string\n Name of variable in component\n needs_date : bool, default ``False``\n Whether variable needs a date\n in_spinup : bool, default ``False``\n True to return from spinup phase, else from run phase\n )doc\",\n py::arg(\"component\"), py::arg(\"name\"), py::arg(\"needs_date\") = false, py::arg(\"in_spinup\") = false)\n .def(\"get_observable\", &Hector::get_observable,\n R\"doc(\n Returns output variable.\n See :mod:`pyhector.output` for available variables.\n\n Parameters\n ----------\n component : str\n Name of Hector component\n name : string\n Name of variable in component\n in_spinup : bool, default ``False``\n True to return from spinup phase, else from run phase. Must have\n been set in :py:meth:`add_observable` accordingly\n )doc\",\n py::arg(\"component\"), py::arg(\"name\"), py::arg(\"in_spinup\") = false)\n .def(\"clear_observables\", &Hector::clear_observables, \"Clear observables registered so far.\")\n .def(\"reset\", &Hector::reset, \"Reset Hector.\")\n .def(\"run\", &Hector::run, \"Run Hector.\", py::arg(\"until\") = py::none())\n .def(\"shutdown\", &Hector::shutdown, \"Shutdown Hector.\")\n .def(\"_set_string\", (void (Hector::*)(const std::string&, const std::string&, const std::string&)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_double\", (void (Hector::*)(const std::string&, const std::string&, double)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_double_unit\", (void (Hector::*)(const std::string&, const std::string&, double, const std::string&)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_timed_double\", (void (Hector::*)(const std::string&, const std::string&, std::size_t, double)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_timed_double_unit\", (void (Hector::*)(const std::string&, const std::string&, std::size_t, double, const std::string&)) & Hector::set,\n \"Set Parameters.\")\n .def(\"_set_timed_array\",\n (void (Hector::*)(const std::string&, const std::string&, const std::vector<std::size_t>&, const std::vector<double>&)) & Hector::set,\n \"Set Parameters.\")\n .def(\"_set_timed_array_unit\",\n (void (Hector::*)(const std::string&, const std::string&, const std::vector<std::size_t>&, const std::vector<double>&, const std::string&))\n & Hector::set,\n \"Set Parameters.\");\n\n m.attr(\"__hector_version__\") = MODEL_VERSION;\n}\n\n} \/\/ namespace pyhector\n<commit_msg>Add documentation for until parameter<commit_after>\/*\n * Copyright (c) 2018 Sven Willner <sven.willner@pik-potsdam.de>\n * Free software under GNU Affero General Public License v3, see LICENSE\n *\/\n\n#include <pybind11\/pybind11.h>\n#include <pybind11\/stl.h>\n#include \"Hector.h\"\n#include \"Observable.h\"\n#include \"h_exception.hpp\"\n#include \"h_util.hpp\"\n\nnamespace py = pybind11;\n\nnamespace pyhector {\n\nPYBIND11_MODULE(_binding, m) {\n m.doc() = R\"pbdoc(\n pyhector._binding\n -----------------\n\n `pyhector` is a Python wrapper for the simple global climate\n carbon-cycle model Hector (https:\/\/github.com\/JGCRI\/hector).\n\n See README.rst and repository for details:\n https:\/\/github.com\/openclimatedata\/pyhector\n )pbdoc\";\n\n static py::exception<h_exception> hector_exception(m, \"HectorException\");\n py::register_exception_translator([](std::exception_ptr p) {\n try {\n if (p) {\n std::rethrow_exception(p);\n }\n } catch (const h_exception& e) {\n hector_exception(e.what());\n }\n });\n\n py::class_<Hector>(m, \"_Hector\", \"Class providing an interface to Hector\")\n .def(py::init())\n .def_property_readonly(\"run_size\", &Hector::run_size, \"Number of steps to run by default\")\n .def_property_readonly(\"spinup_size\", &Hector::spinup_size, \"Number of spinup steps run\")\n .def_property_readonly(\"start_date\", &Hector::start_date, \"Start date\")\n .def_property_readonly(\"end_date\", &Hector::end_date, \"End date\")\n .def(\"add_observable\", &Hector::add_observable,\n R\"doc(\n Set a variable that can be read later.\n See :mod:`pyhector.output` for available components and variables.\n\n Parameters\n ----------\n component : str\n Name of Hector component\n name : string\n Name of variable in component\n needs_date : bool, default ``False``\n Whether variable needs a date\n in_spinup : bool, default ``False``\n True to return from spinup phase, else from run phase\n )doc\",\n py::arg(\"component\"), py::arg(\"name\"), py::arg(\"needs_date\") = false, py::arg(\"in_spinup\") = false)\n .def(\"get_observable\", &Hector::get_observable,\n R\"doc(\n Returns output variable.\n See :mod:`pyhector.output` for available variables.\n\n Parameters\n ----------\n component : str\n Name of Hector component\n name : string\n Name of variable in component\n in_spinup : bool, default ``False``\n True to return from spinup phase, else from run phase. Must have\n been set in :py:meth:`add_observable` accordingly\n )doc\",\n py::arg(\"component\"), py::arg(\"name\"), py::arg(\"in_spinup\") = false)\n .def(\"clear_observables\", &Hector::clear_observables, \"Clear observables registered so far.\")\n .def(\"reset\", &Hector::reset, \"(Hard) reset Hector.\")\n .def(\"run\", &Hector::run,\n R\"doc(\n Run Hector.\n\n Parameters\n ----------\n until : double, default ``None``\n Year to run until (including) or run till end date as given by\n configuration if None\n )doc\",\n py::arg(\"until\") = py::none())\n .def(\"shutdown\", &Hector::shutdown, \"Shutdown Hector.\")\n .def(\"_set_string\", (void (Hector::*)(const std::string&, const std::string&, const std::string&)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_double\", (void (Hector::*)(const std::string&, const std::string&, double)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_double_unit\", (void (Hector::*)(const std::string&, const std::string&, double, const std::string&)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_timed_double\", (void (Hector::*)(const std::string&, const std::string&, std::size_t, double)) & Hector::set, \"Set Parameters.\")\n .def(\"_set_timed_double_unit\", (void (Hector::*)(const std::string&, const std::string&, std::size_t, double, const std::string&)) & Hector::set,\n \"Set Parameters.\")\n .def(\"_set_timed_array\",\n (void (Hector::*)(const std::string&, const std::string&, const std::vector<std::size_t>&, const std::vector<double>&)) & Hector::set,\n \"Set Parameters.\")\n .def(\"_set_timed_array_unit\",\n (void (Hector::*)(const std::string&, const std::string&, const std::vector<std::size_t>&, const std::vector<double>&, const std::string&))\n & Hector::set,\n \"Set Parameters.\");\n\n m.attr(\"__hector_version__\") = MODEL_VERSION;\n}\n\n} \/\/ namespace pyhector\n<|endoftext|>"} {"text":"<commit_before>#include <SFML\/Window.hpp>\n#include <cmath>\n#include <iostream>\n\n#include \"renderer.h\"\n#include \"input.h\"\n#include \"octree.h\"\n\nusing namespace std;\n\nOctree<bool> makeTerrain(int level)\n{\n cout << \"At level \" << level << endl;\n vector<Octree<bool> >blocks;\n for(int i = 0; i < 8; i++)\n {\n bool leaf = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n if(level < 2)\n {\n\n if(leaf)\n {\n bool type = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n blocks.push_back(Octree<bool>(type));\n } \n else\n {\n cout << \"Going deeper!\" << endl;\n blocks.push_back(makeTerrain(level + 1));\n }\n }\n else if(level == 2)\n {\n bool type = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n blocks.push_back(Octree<bool>(type));\n }\n cout << \"Block \" << i << \"at level \" << level << \": \" << (leaf ? \"leaf\" : \"node\") << endl;\n }\n Octree<bool> terrain(blocks);\n return terrain;\n}\n\n\nint main()\n{\n \/\/ Create the main window\n sf::Window App(sf::VideoMode(800, 600, 32), \"MineCube\");\n\n Octree<bool> terrain = makeTerrain(0);\n \n \/\/ Create a renderer and input handler\n Renderer renderer(terrain);\n InputHandler input_handler(&App);\n \n \/\/App.UseVerticalSync(true);\n\n \/\/ Create a clock for measuring time elapsed\n sf::Clock Clock;\n \n const float PI = 3.14159265358979323846264338329750288419716939937510582;\n\n const float Speed = 5.f;\n float Left = 5.f;\n float Top = 20.f;\n float Up = 5.f;\n \n float rotation = 0.f;\n float zRotation = 180.f;\n \n App.ShowMouseCursor(false);\n \n \/\/ Start game loop\n while (App.IsOpened())\n {\n float ElapsedTime = Clock.GetElapsedTime();\n Clock.Reset();\n \n bool moving = false;\n float xStep = Speed * sin((PI * zRotation) \/ 180) * ElapsedTime; \n float yStep = Speed * cos((PI * zRotation) \/ 180) * ElapsedTime; \n float zStep = -Speed * sin((PI * rotation) \/ 180) * ElapsedTime; \n \n if ((App.GetInput().IsKeyDown(sf::Key::S))) \/\/ W = forwards \n { \n moving = true; \n Left -= (xStep * cos((PI * rotation) \/ 180)); \n Top -= (yStep * cos((PI * rotation) \/ 180)); \n Up -= zStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::W))) \/\/ S = backwards \n { \n moving = true; \n Left += (xStep * cos((PI * rotation) \/ 180)); \n Top += (yStep * cos((PI * rotation) \/ 180)); \n Up += zStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::D))) \/\/A = strafe left \n { \n if ((moving = true)) \n { \n xStep *= 0.707106; \n yStep *= 0.707106; \n } \n Left += yStep; \n Top -= xStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::A))) \/\/D = strafe right \n { \n if ((moving = true)) \n { \n xStep *= 0.707106; \n yStep *= 0.707106; \n } \n Left -= yStep; \n Top += xStep; \n } \n \n if (App.GetInput().IsKeyDown(sf::Key::Q)) Up -= Speed * ElapsedTime;\n if (App.GetInput().IsKeyDown(sf::Key::E)) Up += Speed * ElapsedTime;\n \n if (App.GetInput().IsKeyDown(sf::Key::Space)) renderer.terrain = makeTerrain(0);\n \n \/\/ Rotate view based on mouse movement \n float mouseDeltaX = App.GetInput().GetMouseX() - 100; \n float mouseDeltaY = App.GetInput().GetMouseY() - 100;\n App.SetCursorPosition(100, 100);\n if (!(mouseDeltaX == -100 && mouseDeltaY == -100)) {\n zRotation += (mouseDeltaX \/ 10); \n rotation += (mouseDeltaY \/ 10); \n \/\/cout << \"DeltaX: \" << mouseDeltaX << \" DeltaY: \" << mouseDeltaY << endl; \n\n \/\/ Z rotation normalisation - between 0 and 360 \n if (zRotation >= 360) \n { \n zRotation -= 360; \n } \n\n if (zRotation < 0) \n { \n zRotation += 360; \n } \n\n \/\/ X\/Y rotation limits \n if (rotation < -90) \n { \n rotation = -90; \n } \n if (rotation >= 90) \n { \n rotation = 90; \n } \n }\n \n input_handler.handleEvents();\n\n \/\/ Set the active window before using OpenGL commands\n \/\/ It's useless here because active window is always the same,\n \/\/ but don't forget it if you use multiple windows or controls\n App.SetActive();\n\n renderer.render(Left, Top, Up, rotation, zRotation);\n\n \/\/ Finally, display rendered frame on screen\n App.Display();\n }\n\n return EXIT_SUCCESS;\n}\n\n<commit_msg>KILL WITH FIRE<commit_after>#include <SFML\/Window.hpp>\n#include <cmath>\n#include <iostream>\n\n#include \"renderer.h\"\n#include \"input.h\"\n#include \"octree.h\"\n\nusing namespace std;\n\nOctree<bool> makeTerrain(int level)\n{\n vector<Octree<bool> >blocks;\n for(int i = 0; i < 8; i++)\n {\n bool leaf = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n if(level < 2)\n {\n\n if(leaf)\n {\n bool type = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n blocks.push_back(Octree<bool>(type));\n } \n else\n {\n blocks.push_back(makeTerrain(level + 1));\n }\n }\n else if(level == 2)\n {\n bool type = (sf::Randomizer::Random(-1.f, 1.f) <= 0.0f ? true : false);\n blocks.push_back(Octree<bool>(type));\n }\n }\n Octree<bool> terrain(blocks);\n return terrain;\n}\n\n\nint main()\n{\n \/\/ Create the main window\n sf::Window App(sf::VideoMode(800, 600, 32), \"MineCube\");\n\n Octree<bool> terrain = makeTerrain(0);\n \n \/\/ Create a renderer and input handler\n Renderer renderer(terrain);\n InputHandler input_handler(&App);\n \n \/\/App.UseVerticalSync(true);\n\n \/\/ Create a clock for measuring time elapsed\n sf::Clock Clock;\n \n const float PI = 3.14159265358979323846264338329750288419716939937510582;\n\n const float Speed = 5.f;\n float Left = 5.f;\n float Top = 20.f;\n float Up = 5.f;\n \n float rotation = 0.f;\n float zRotation = 180.f;\n \n App.ShowMouseCursor(false);\n \n \/\/ Start game loop\n while (App.IsOpened())\n {\n float ElapsedTime = Clock.GetElapsedTime();\n Clock.Reset();\n \n bool moving = false;\n float xStep = Speed * sin((PI * zRotation) \/ 180) * ElapsedTime; \n float yStep = Speed * cos((PI * zRotation) \/ 180) * ElapsedTime; \n float zStep = -Speed * sin((PI * rotation) \/ 180) * ElapsedTime; \n \n if ((App.GetInput().IsKeyDown(sf::Key::S))) \/\/ W = forwards \n { \n moving = true; \n Left -= (xStep * cos((PI * rotation) \/ 180)); \n Top -= (yStep * cos((PI * rotation) \/ 180)); \n Up -= zStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::W))) \/\/ S = backwards \n { \n moving = true; \n Left += (xStep * cos((PI * rotation) \/ 180)); \n Top += (yStep * cos((PI * rotation) \/ 180)); \n Up += zStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::D))) \/\/A = strafe left \n { \n if ((moving = true)) \n { \n xStep *= 0.707106; \n yStep *= 0.707106; \n } \n Left += yStep; \n Top -= xStep; \n } \n\n if ((App.GetInput().IsKeyDown(sf::Key::A))) \/\/D = strafe right \n { \n if ((moving = true)) \n { \n xStep *= 0.707106; \n yStep *= 0.707106; \n } \n Left -= yStep; \n Top += xStep; \n } \n \n if (App.GetInput().IsKeyDown(sf::Key::Q)) Up -= Speed * ElapsedTime;\n if (App.GetInput().IsKeyDown(sf::Key::E)) Up += Speed * ElapsedTime;\n \n if (App.GetInput().IsKeyDown(sf::Key::Space)) renderer.terrain = makeTerrain(0);\n \n \/\/ Rotate view based on mouse movement \n float mouseDeltaX = App.GetInput().GetMouseX() - 100; \n float mouseDeltaY = App.GetInput().GetMouseY() - 100;\n App.SetCursorPosition(100, 100);\n if (!(mouseDeltaX == -100 && mouseDeltaY == -100)) {\n zRotation += (mouseDeltaX \/ 10); \n rotation += (mouseDeltaY \/ 10); \n \/\/cout << \"DeltaX: \" << mouseDeltaX << \" DeltaY: \" << mouseDeltaY << endl; \n\n \/\/ Z rotation normalisation - between 0 and 360 \n if (zRotation >= 360) \n { \n zRotation -= 360; \n } \n\n if (zRotation < 0) \n { \n zRotation += 360; \n } \n\n \/\/ X\/Y rotation limits \n if (rotation < -90) \n { \n rotation = -90; \n } \n if (rotation >= 90) \n { \n rotation = 90; \n } \n }\n \n input_handler.handleEvents();\n\n \/\/ Set the active window before using OpenGL commands\n \/\/ It's useless here because active window is always the same,\n \/\/ but don't forget it if you use multiple windows or controls\n App.SetActive();\n\n renderer.render(Left, Top, Up, rotation, zRotation);\n\n \/\/ Finally, display rendered frame on screen\n App.Display();\n }\n\n return EXIT_SUCCESS;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"main.h\"\n\n#include <math.h>\n#include <stdio.h>\n\n#include \"drivers\/Driver.h\"\n#include \"drivers\/TeleopDriver.h\"\n#include \"drivers\/BaselockDriver.h\"\n#include \"subsystems\/Drive.h\"\n#include \"subsystems\/Shooter.h\"\n#include \"subsystems\/OperatorControl.h\"\n#include \"subsystems\/Pid.h\"\n#include \"subsystems\/PidCommander.h\"\n#include \"util\/Functions.h\"\n#include \"util\/Logger.h\"\n#include \"util\/PidTuner.h\"\n#include \"vision\/BackboardFinder.h\"\n\nMainRobot::MainRobot() {\n \/\/ Constants\n constants_ = Constants::GetInstance();\n\n \/\/ Motors\n leftDriveMotorA_ = new Victor((int)constants_->leftDrivePwmA);\n leftDriveMotorB_ = new Victor((int)constants_->leftDrivePwmB);\n rightDriveMotorA_ = new Victor((int)constants_->rightDrivePwmA);\n rightDriveMotorB_ = new Victor((int)constants_->rightDrivePwmB);\n intakeMotor_ = new Victor((int)constants_->intakePwm);\n conveyorMotor_ = new Victor((int)constants_->conveyorPwm);\n leftShooterMotor_ = new Victor((int)constants_->leftShooterPwm);\n rightShooterMotor_ = new Victor((int)constants_->rightShooterPwm);\n\n \/\/ Sensors\n leftEncoder_ = new Encoder((int)constants_->leftEncoderPortA, (int)constants_->leftEncoderPortB);\n leftEncoder_->Start();\n rightEncoder_ = new Encoder((int)constants_->rightEncoderPortA, (int)constants_->rightEncoderPortB);\n rightEncoder_->Start();\n shooterEncoder_ = new Encoder((int)constants_->shooterEncoderPortA, (int)constants_->shooterEncoderPortB);\n shooterEncoder_->Start();\n gyro_ = new Gyro((int)constants_->gyroPort);\n gyro_->SetSensitivity(1.0);\n\n double accelerometerSensitivity = 1.0;\n accelerometerX_ = new Accelerometer((int)constants_->accelerometerXPort);\n accelerometerY_ = new Accelerometer((int)constants_->accelerometerYPort);\n accelerometerZ_ = new Accelerometer((int)constants_->accelerometerZPort);\n \/\/accelerometerX_->SetSensitivity(accelerometerSensitivity);\n \/\/ accelerometerY_->SetSensitivity(accelerometerSensitivity);\n \/\/ accelerometerZ_->SetSensitivity(accelerometerSensitivity);\n bumpSensor_ = new DigitalInput((int)constants_->bumpSensorPort);\n\n \/\/ Pneumatics\n compressor_ = new Compressor((int)constants_->compressorPressureSwitchPort,(int)constants_->compressorRelayPort);\n compressor_->Start();\n shiftSolenoid_ = new Solenoid((int)constants_->shiftSolenoidPort);\n\/\/ hoodSolenoid_ = new Solenoid((int)constants_->hoodSolenoidPort);\n pizzaWheelSolenoid_ = new DoubleSolenoid((int)constants_->pizzaWheelSolenoidDownPort, (int)constants_->pizzaWheelSolenoidUpPort);\n\/\/ intakeSolenoid_ = new DoubleSolenoid((int)constants_->intakeSolenoidHighPort,(int)constants_->intakeSolenoidLowPort);\n brakeSolenoid_ = new DoubleSolenoid((int)constants_->brakeSolenoidHighPort, (int)constants_->brakeSolenoidLowPort);\n\n \/\/ Subsystems\n drivebase_ = new Drive(leftDriveMotorA_, leftDriveMotorB_, rightDriveMotorA_, rightDriveMotorB_,\n shiftSolenoid_, pizzaWheelSolenoid_, brakeSolenoid_, leftEncoder_,\n rightEncoder_, gyro_, accelerometerX_, accelerometerY_,\n accelerometerZ_, bumpSensor_);\n\/\/ shooter_ = new Shooter(intakeMotor_, conveyorMotor_, leftShooterMotor_, rightShooterMotor_,\n\/\/ shooterEncoder_, hoodSolenoid_, intakeSolenoid_);\n\n \/\/ Drivers\n teleopDriver_ = new TeleopDriver(drivebase_, leftJoystick_, rightJoystick_, operatorControl_);\n baselockDriver_ = new BaselockDriver(drivebase_, leftJoystick_);\n \/\/ Set the current Driver to teleop, though this will change later\n currDriver_ = teleopDriver_;\n\n \/\/ Control Board\n leftJoystick_ = new Joystick((int)constants_->leftJoystickPort);\n rightJoystick_ = new Joystick((int)constants_->rightJoystickPort);\n operatorControl_ = new OperatorControl((int)constants_->operatorControlPort);\n\n testPid_ = new Pid(constants_->driveKP, constants_->driveKI, constants_->driveKD);\n testTimer_ = new Timer();\n testLogger_ = new Logger(\"\/test.log\", 2);\n\n \/\/ Watchdog\n GetWatchdog().SetExpiration(100);\n\n \/\/ Get a local instance of the Driver Station LCD\n lcd_ = DriverStationLCD::GetInstance();\n lcd_->PrintfLine(DriverStationLCD::kUser_Line1,\"***Teleop Ready!***\");\n\n oldBaseLockSwitch_ = operatorControl_->GetBaseLockSwitch();\n}\n\nvoid MainRobot::DisabledInit() {\n}\n\nvoid MainRobot::AutonomousInit() {\n constants_->LoadFile();\n delete testPid_;\n testPid_ = new Pid(constants_->driveKP, constants_->driveKI, constants_->driveKD);\n drivebase_->ResetGyro();\n drivebase_->ResetEncoders();\n testPid_->ResetError();\n testTimer_->Reset();\n testTimer_->Start();\n GetWatchdog().SetEnabled(false);\n}\n\nvoid MainRobot::TeleopInit() {\n constants_->LoadFile();\n drivebase_->ResetGyro();\n drivebase_->ResetEncoders();\n \/\/baseLockPosition_ = drivebase_->GetLeftEncoderDistance();\n \/\/baseLockPid_->ResetError();\n\n \/\/ Start off with the TeleopDriver\n currDriver_ = teleopDriver_;\n currDriver_->Reset();\n GetWatchdog().SetEnabled(true);\n}\n\nvoid MainRobot::DisabledPeriodic() {\n drivebase_->SetPizzaWheelDown(false);\n lcd_->UpdateLCD();\n}\n\nvoid MainRobot::AutonomousPeriodic() {\n double time = testTimer_->Get();\n double inputValue = Functions::SineWave(time, 5, 2);\n double position = drivebase_->GetLeftEncoderDistance();\n double signal = testPid_->Update(inputValue, position);\n drivebase_->SetLinearPower(signal, signal);\n testLogger_->Log(\"%f,%f,%f,%f\\n\", time, inputValue, signal, position);\n PidTuner::PushData(inputValue, position);\n}\n\nvoid MainRobot::TeleopPeriodic() {\n GetWatchdog().Feed();\n\n \/\/ Only have Teleop and Baselock Drivers right now\n if (operatorControl_->GetBaseLockSwitch() && !oldBaseLockSwitch_) {\n \/\/ If the baselock switch has been flipped on, switch to baselock\n currDriver_ = baselockDriver_;\n currDriver_->Reset();\n } else if (!operatorControl_->GetBaseLockSwitch() && oldBaseLockSwitch_) {\n \/\/ If the baselock switch has been flipped off, switch back to teleop\n currDriver_ = teleopDriver_;\n currDriver_->Reset();\n }\n\n \/\/ Update the driver and the baselock switch status\n currDriver_->UpdateDriver();\n oldBaseLockSwitch_ = operatorControl_->GetBaseLockSwitch();\n\n static int i = 0;\n lcd_->PrintfLine(DriverStationLCD::kUser_Line3, \"%d, %f, %f, %f\\n\", i,(float) drivebase_->GetXAcceleration(),(float)drivebase_->GetXAcceleration(),(float) drivebase_->GetXAcceleration());\n lcd_->UpdateLCD();\n\n Logger::GetSysLog()->Log(\"%d, %f, %f, %f\\n\", i,(float) drivebase_->GetXAcceleration(),(float)drivebase_->GetXAcceleration(),(float) drivebase_->GetXAcceleration());\n \n i++;\n}\n\n<commit_msg>Added temp support for xbox controller<commit_after>#include \"main.h\"\n\n#include <math.h>\n#include <stdio.h>\n\n#include \"drivers\/Driver.h\"\n#include \"drivers\/TeleopDriver.h\"\n#include \"drivers\/BaselockDriver.h\"\n#include \"subsystems\/Drive.h\"\n#include \"subsystems\/Shooter.h\"\n#include \"subsystems\/OperatorControl.h\"\n#include \"subsystems\/Pid.h\"\n#include \"subsystems\/PidCommander.h\"\n#include \"util\/Functions.h\"\n#include \"util\/Logger.h\"\n#include \"util\/PidTuner.h\"\n#include \"vision\/BackboardFinder.h\"\n\nJoystick* xbox = new Joystick(3);\n\nMainRobot::MainRobot() {\n \/\/ Constants\n constants_ = Constants::GetInstance();\n\n \/\/ Motors\n leftDriveMotorA_ = new Victor((int)constants_->leftDrivePwmA);\n leftDriveMotorB_ = new Victor((int)constants_->leftDrivePwmB);\n rightDriveMotorA_ = new Victor((int)constants_->rightDrivePwmA);\n rightDriveMotorB_ = new Victor((int)constants_->rightDrivePwmB);\n intakeMotor_ = new Victor((int)constants_->intakePwm);\n conveyorMotor_ = new Victor((int)constants_->conveyorPwm);\n leftShooterMotor_ = new Victor((int)constants_->leftShooterPwm);\n rightShooterMotor_ = new Victor((int)constants_->rightShooterPwm);\n\n \/\/ Sensors\n leftEncoder_ = new Encoder((int)constants_->leftEncoderPortA, (int)constants_->leftEncoderPortB);\n leftEncoder_->Start();\n rightEncoder_ = new Encoder((int)constants_->rightEncoderPortA, (int)constants_->rightEncoderPortB);\n rightEncoder_->Start();\n shooterEncoder_ = new Encoder((int)constants_->shooterEncoderPortA, (int)constants_->shooterEncoderPortB);\n shooterEncoder_->Start();\n gyro_ = new Gyro((int)constants_->gyroPort);\n gyro_->SetSensitivity(1.0);\n\n double accelerometerSensitivity = 1.0;\n accelerometerX_ = new Accelerometer((int)constants_->accelerometerXPort);\n accelerometerY_ = new Accelerometer((int)constants_->accelerometerYPort);\n accelerometerZ_ = new Accelerometer((int)constants_->accelerometerZPort);\n \/\/accelerometerX_->SetSensitivity(accelerometerSensitivity);\n \/\/ accelerometerY_->SetSensitivity(accelerometerSensitivity);\n \/\/ accelerometerZ_->SetSensitivity(accelerometerSensitivity);\n bumpSensor_ = new DigitalInput((int)constants_->bumpSensorPort);\n\n \/\/ Pneumatics\n compressor_ = new Compressor((int)constants_->compressorPressureSwitchPort,(int)constants_->compressorRelayPort);\n compressor_->Start();\n shiftSolenoid_ = new Solenoid((int)constants_->shiftSolenoidPort);\n hoodSolenoid_ = new Solenoid((int)constants_->hoodSolenoidPort);\n pizzaWheelSolenoid_ = new DoubleSolenoid((int)constants_->pizzaWheelSolenoidDownPort, (int)constants_->pizzaWheelSolenoidUpPort);\n intakeSolenoid_ = new DoubleSolenoid((int)constants_->intakeSolenoidHighPort,(int)constants_->intakeSolenoidLowPort);\n brakeSolenoid_ = new DoubleSolenoid((int)constants_->brakeSolenoidHighPort, (int)constants_->brakeSolenoidLowPort);\n\n \/\/ Subsystems\n drivebase_ = new Drive(leftDriveMotorA_, leftDriveMotorB_, rightDriveMotorA_, rightDriveMotorB_,\n shiftSolenoid_, pizzaWheelSolenoid_, brakeSolenoid_, leftEncoder_,\n rightEncoder_, gyro_, accelerometerX_, accelerometerY_,\n accelerometerZ_, bumpSensor_);\n shooter_ = new Shooter(intakeMotor_, conveyorMotor_, leftShooterMotor_, rightShooterMotor_,\n shooterEncoder_, hoodSolenoid_, intakeSolenoid_);\n\n \/\/ Drivers\n teleopDriver_ = new TeleopDriver(drivebase_, leftJoystick_, rightJoystick_, operatorControl_);\n baselockDriver_ = new BaselockDriver(drivebase_, leftJoystick_);\n \/\/ Set the current Driver to teleop, though this will change later\n currDriver_ = teleopDriver_;\n\n \/\/ Control Board\n leftJoystick_ = new Joystick((int)constants_->leftJoystickPort);\n rightJoystick_ = new Joystick((int)constants_->rightJoystickPort);\n operatorControl_ = new OperatorControl((int)constants_->operatorControlPort);\n\n testPid_ = new Pid(constants_->driveKP, constants_->driveKI, constants_->driveKD);\n testTimer_ = new Timer();\n testLogger_ = new Logger(\"\/test.log\", 2);\n\n \/\/ Watchdog\n GetWatchdog().SetExpiration(100);\n\n \/\/ Get a local instance of the Driver Station LCD\n lcd_ = DriverStationLCD::GetInstance();\n lcd_->PrintfLine(DriverStationLCD::kUser_Line1,\"***Teleop Ready!***\");\n\n oldBaseLockSwitch_ = operatorControl_->GetBaseLockSwitch();\n}\n\nvoid MainRobot::DisabledInit() {\n}\n\nvoid MainRobot::AutonomousInit() {\n constants_->LoadFile();\n delete testPid_;\n testPid_ = new Pid(constants_->driveKP, constants_->driveKI, constants_->driveKD);\n drivebase_->ResetGyro();\n drivebase_->ResetEncoders();\n testPid_->ResetError();\n testTimer_->Reset();\n testTimer_->Start();\n GetWatchdog().SetEnabled(false);\n}\n\nvoid MainRobot::TeleopInit() {\n constants_->LoadFile();\n drivebase_->ResetGyro();\n drivebase_->ResetEncoders();\n \/\/baseLockPosition_ = drivebase_->GetLeftEncoderDistance();\n \/\/baseLockPid_->ResetError();\n\n \/\/ Start off with the TeleopDriver\n currDriver_ = teleopDriver_;\n currDriver_->Reset();\n GetWatchdog().SetEnabled(true);\n}\n\nvoid MainRobot::DisabledPeriodic() {\n drivebase_->SetPizzaWheelDown(false);\n lcd_->UpdateLCD();\n}\n\nvoid MainRobot::AutonomousPeriodic() {\n double time = testTimer_->Get();\n double inputValue = Functions::SineWave(time, 5, 2);\n double position = drivebase_->GetLeftEncoderDistance();\n double signal = testPid_->Update(inputValue, position);\n drivebase_->SetLinearPower(signal, signal);\n testLogger_->Log(\"%f,%f,%f,%f\\n\", time, inputValue, signal, position);\n PidTuner::PushData(inputValue, position);\n}\n\nvoid MainRobot::TeleopPeriodic() {\n GetWatchdog().Feed();\n\n double ljoy = xbox->GetY();\n double trigger = -xbox->GetRawAxis(3);\n double rjoy = -xbox->GetRawAxis(5);\n\n shooter_->SetLinearPower(ljoy);\n shooter_->SetConveyorPower(trigger);\n shooter_->SetIntakePower(rjoy);\n\n \/\/ Only have Teleop and Baselock Drivers right now\n if (operatorControl_->GetBaseLockSwitch() && !oldBaseLockSwitch_) {\n \/\/ If the baselock switch has been flipped on, switch to baselock\n currDriver_ = baselockDriver_;\n currDriver_->Reset();\n } else if (!operatorControl_->GetBaseLockSwitch() && oldBaseLockSwitch_) {\n \/\/ If the baselock switch has been flipped off, switch back to teleop\n currDriver_ = teleopDriver_;\n currDriver_->Reset();\n }\n\n \/\/ Update the driver and the baselock switch status\n currDriver_->UpdateDriver();\n oldBaseLockSwitch_ = operatorControl_->GetBaseLockSwitch();\n\n static int i = 0;\n lcd_->PrintfLine(DriverStationLCD::kUser_Line3, \"%d, %f, %f, %f\\n\", i,(float) drivebase_->GetXAcceleration(),(float)drivebase_->GetXAcceleration(),(float) drivebase_->GetXAcceleration());\n lcd_->UpdateLCD();\n\n Logger::GetSysLog()->Log(\"%d, %f, %f, %f\\n\", i,(float) drivebase_->GetXAcceleration(),(float)drivebase_->GetXAcceleration(),(float) drivebase_->GetXAcceleration());\n \n i++;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nsrc\/main.cpp\n\nCreated by Jon Stewart on 2010-01-04.\nCopyright (c) 2010 Lightbox Technologies, Inc.\n*\/\n\n#include <boost\/program_options.hpp>\n#include <boost\/bind.hpp>\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n\n#include \"tsk.h\"\n\nnamespace po = boost::program_options;\n\ntemplate<class T>\nconst T& j(const T& x) {\n return x;\n}\n\ntemplate<>\nconst string& j<string>(const string& x) {\n static string S; \/\/ so evil\n S = \"\\\"\";\n S += x;\n S += \"\\\"\";\n return S;\n}\n\ntemplate<class T>\nclass JsonPair {\npublic:\n JsonPair(const string& key, const T& val, bool first): Key(key), Value(val), First(first) {}\n\n const string& Key;\n const T& Value;\n bool First;\n};\n\ntemplate<class T>\nJsonPair<T> j(const string& key, const T& val, bool first = false) {\n return JsonPair<T>(key, val, first);\n}\n\ntemplate<class T>\nostream& operator<<(ostream& out, const JsonPair<T>& pair) {\n if (!pair.First) {\n out << \",\";\n }\n out << j(pair.Key) << \":\";\n out << j(pair.Value);\n return out;\n}\n\nvoid outputFS(ostream& buf, shared_ptr<Filesystem> fs) {\n buf << \",\" << j(string(\"filesystem\")) << \":{\"\n << j(\"numBlocks\", fs->numBlocks(), true)\n << j(\"blockSize\", fs->blockSize())\n << j(\"deviceBlockSize\", fs->deviceBlockSize())\n << j(\"blockName\", fs->blockName())\n << j(\"littleEndian\", fs->littleEndian())\n << j(\"firstBlock\", fs->firstBlock())\n << j(\"firstInum\", fs->firstInum())\n << j(\"flags\", fs->flags())\n << j(\"fsID\", fs->fsIDAsString())\n << j(\"type\", fs->fsType())\n << j(\"typeName\", fs->fsName())\n << j(\"isOrphanHunting\", fs->isOrphanHunting())\n << j(\"journalInum\", fs->journalInum())\n << j(\"numInums\", fs->numInums())\n << j(\"lastBlock\", fs->lastBlock())\n << j(\"lastBlockAct\", fs->lastBlockAct())\n << j(\"lastInum\", fs->lastInum())\n << j(\"byteOffset\", fs->byteOffset())\n << j(\"rootInum\", fs->rootInum())\n << \"}\";\n}\n\nstring j(const weak_ptr< Volume >& vol) {\n stringstream buf;\n if (shared_ptr< Volume > p = vol.lock()) {\n buf << \"{\"\n << j(\"description\", p->desc(), true)\n << j(\"flags\", p->flags())\n << j(\"numBlocks\", p->numBlocks())\n << j(\"slotNum\", p->slotNum())\n << j(\"startBlock\", p->startBlock())\n << j(\"tableNum\", p->tableNum());\n if (shared_ptr<Filesystem> fs = p->filesystem().lock()) {\n outputFS(buf, fs);\n }\n buf << \"}\";\n }\n return buf.str();\n}\n\ntemplate<class ItType>\nvoid writeSequence(ostream& out, ItType begin, ItType end, const string& delimiter) {\n if (begin != end) {\n ItType it(begin);\n out << j(*it);\n for (++it; it != end; ++it) {\n out << delimiter << j(*it);\n }\n }\n}\n\nvoid writeAttr(ostream& out, const TSK_FS_ATTR* a) {\n out << \"{\"\n << j(\"flags\", a->flags, true)\n << j(\"id\", a->id)\n << j(\"name\", a->name ? string(a->name): string(\"\"))\n << j(\"size\", a->size)\n << j(\"type\", a->type)\n << j(\"rd_buf_size\", a->rd.buf_size)\n << j(\"nrd_allocsize\", a->nrd.allocsize)\n << j(\"nrd_compsize\", a->nrd.compsize)\n << j(\"nrd_initsize\", a->nrd.initsize)\n << j(\"nrd_skiplen\", a->nrd.skiplen);\n if (a->flags & TSK_FS_ATTR_RES && a->rd.buf_size && a->rd.buf) {\n out << \", \" << j(string(\"rd_buf\")) << \":\\\"\";\n ios::fmtflags oldFlags = out.flags();\n out << hex << setfill('0');\n size_t numBytes = min(a->rd.buf_size, (size_t)a->size);\n for (size_t i = 0; i < numBytes; ++i) {\n out << setw(2) << (unsigned int)a->rd.buf[i];\n }\n out.flags(oldFlags);\n out << \"\\\"\";\n }\n if (a->flags & TSK_FS_ATTR_NONRES && a->nrd.run) {\n out << \", \\\"nrd_runs\\\":[\";\n for (TSK_FS_ATTR_RUN* curRun = a->nrd.run; curRun; curRun = curRun->next) {\n if (curRun != a->nrd.run) {\n out << \", \";\n }\n out << \"{\"\n << j(\"addr\", curRun->addr, true)\n << j(\"flags\", curRun->flags)\n << j(\"len\", curRun->len)\n << j(\"offset\", curRun->offset)\n << \"}\";\n }\n out << \"]\";\n }\n out << \"}\";\n}\n\nstring bytesAsString(const unsigned char* idBeg, const unsigned char* idEnd) {\n stringstream buf;\n buf << hex;\n for (const unsigned char* cur = idBeg; cur < idEnd; ++cur) {\n buf << hex << (unsigned int)*cur;\n }\n return buf.str();\n}\n\nclass LbtTskAuto: public TskAuto {\npublic:\n virtual void finishWalk() {}\n};\n\nclass FileCounter: public LbtTskAuto {\npublic:\n FileCounter(ostream& out): NumFiles(0), Out(out) {}\n\n virtual ~FileCounter() {}\n\n virtual TSK_RETVAL_ENUM processFile(TSK_FS_FILE*, const char*) {\n ++NumFiles;\n return TSK_OK;\n }\n\n virtual void finishWalk() {\n Out << NumFiles << endl;\n }\n\n unsigned int NumFiles;\n\nprotected:\n ostream& Out;\n};\n\nclass MetadataWriter: public FileCounter {\npublic:\n MetadataWriter(ostream& out);\n\n virtual ~MetadataWriter() {}\n\n virtual TSK_FILTER_ENUM filterFs(TSK_FS_INFO *fs_info);\n\n virtual TSK_RETVAL_ENUM processFile(TSK_FS_FILE *fs_file, const char *path);\n virtual void finishWalk() {}\n\nprivate:\n string FsInfo,\n Null,\n CurDir;\n\n TSK_FS_INFO* Fs;\n\n unsigned int CurDirIndex;\n};\n\nMetadataWriter::MetadataWriter(ostream& out):\n FileCounter(out), Fs(0), CurDirIndex(0) {}\n\nTSK_FILTER_ENUM MetadataWriter::filterFs(TSK_FS_INFO *fs) {\n stringstream buf;\n buf << j(string(\"fs\")) << \":{\"\n << j(\"byteOffset\", fs->offset, true)\n << j(\"blockSize\", fs->block_size)\n << j(\"fsID\", bytesAsString(fs->fs_id, &fs->fs_id[fs->fs_id_used]))\n << \"}\";\n FsInfo = buf.str();\n Fs = fs;\n return TSK_FILTER_CONT;\n}\n\nTSK_RETVAL_ENUM MetadataWriter::processFile(TSK_FS_FILE* file, const char* path) {\n ++CurDirIndex;\n if (0 != CurDir.compare(path)) {\n CurDirIndex = 0;\n CurDir.assign(path);\n }\n \/\/ cerr << \"beginning callback\" << endl;\n try {\n if (file) {\n Out << \"{\" << FsInfo;\n if (path) {\n Out << j(\"path\", string(path));\n }\n if (file->meta) {\n \/\/ need to come back for name2 and attrlist \n TSK_FS_META* i = file->meta;\n Out << \", \\\"meta\\\":{\"\n << j(\"addr\", i->addr, true)\n << j(\"atime\", i->atime)\n << j(\"content_len\", i->content_len)\n << j(\"crtime\", i->crtime)\n << j(\"ctime\", i->ctime)\n << j(\"flags\", i->flags)\n << j(\"gid\", i->gid);\n if (i->link) {\n Out << j(\"link\", string(i->link));\n }\n if (TSK_FS_TYPE_ISEXT(Fs->ftype)) {\n Out << j(\"dtime\", i->time2.ext2.dtime);\n }\n else if (TSK_FS_TYPE_ISHFS(Fs->ftype)) {\n Out << j(\"bkup_time\", i->time2.hfs.bkup_time);\n }\n Out << j(\"mode\", i->mode)\n << j(\"mtime\", i->mtime)\n << j(\"nlink\", i->nlink)\n << j(\"seq\", i->seq)\n << j(\"size\", i->size)\n << j(\"type\", i->type)\n << j(\"uid\", i->uid)\n << \"}\";\n }\n if (file->name) {\n TSK_FS_NAME* n = file->name;\n Out << \", \\\"name\\\":{\"\n << j(\"flags\", n->flags, true)\n << j(\"meta_addr\", n->meta_addr)\n << j(\"meta_seq\", n->meta_seq)\n << j(\"name\", (n->name && n->name_size ? string(n->name): Null))\n << j(\"shrt_name\", (n->shrt_name && n->shrt_name_size ? string(n->shrt_name): Null))\n << j(\"type\", n->type)\n << j(\"dirIndex\", CurDirIndex)\n << \"}\";\n\n }\n int numAttrs = tsk_fs_file_attr_getsize(file);\n if (numAttrs > 0) {\n Out << \", \\\"attrs\\\":[\";\n uint num = 0;\n for (int i = 0; i < numAttrs; ++i) {\n const TSK_FS_ATTR* a = tsk_fs_file_attr_get_idx(file, i);\n if (a) {\n if (num > 0) {\n Out << \", \";\n }\n writeAttr(Out, a);\n ++num;\n }\n }\n Out << \"]\";\n }\n Out << \"}\" << endl;\n }\n }\n catch (std::exception& e) {\n cerr << \"Error on \" << NumFiles << \": \" << e.what() << endl;\n }\n \/\/ cerr << \"finishing callback\" << endl;\n FileCounter::processFile(file, path);\n return TSK_OK;\n}\n\nbool printDeviceInfo(const shared_ptr< Image >& img) {\n std::cout << \"{\";\n\n std::cout << j(string(\"files\")) << \":[\";\n writeSequence(cout, img->files().begin(), img->files().end(), \", \");\n std::cout << \"]\"\n << j(\"description\", img->desc())\n << j(\"size\", img->size());\n\n if (shared_ptr<VolumeSystem> vs = img->volumeSystem().lock()) {\n std::cout << \",\" << j(\"volumeSystem\") << \":{\"\n << j(\"type\", vs->type(), true)\n << j(\"description\", vs->desc())\n << j(\"blockSize\", vs->blockSize())\n << j(\"numVolumes\", vs->numVolumes())\n << j(\"offset\", vs->offset());\n\n if (vs->numVolumes()) {\n std::cout << \",\" << j(string(\"volumes\")) << \":[\";\n writeSequence(std::cout, vs->volBegin(), vs->volEnd(), \",\");\n std::cout << \"]\";\n }\n else {\n cerr << \"Image has volume system, but no volumes\" << endl;\n }\n std::cout << \"}\";\n }\n else if (shared_ptr<Filesystem> fs = img->filesystem().lock()) {\n outputFS(std::cout, fs);\n }\n else {\n cerr << \"Image had neither a volume system nor a filesystem\" << endl;\n }\n std::cout << \"}\" << std::endl;\n return true;\n}\n\nvoid printHelp(const po::options_description& desc) {\n std::cout << \"fsrip, Copyright (c) 2010-2011, Lightbox Technologies, Inc.\" << std::endl;\n std::cout << \"TSK version is \" << tsk_version_get_str() << std::endl;\n std::cout << \"Boost program options version is \" << BOOST_PROGRAM_OPTIONS_VERSION << std::endl;\n std::cout << desc << std::endl;\n}\n\nshared_ptr<LbtTskAuto> createVisitor(const string& cmd, ostream& out) {\n\/* if (cmd == \"info\") {\n return shared_ptr<TskAuto>(new ImgInfo(out));\n }\n else*\/ if (cmd == \"dumpfs\") {\n return shared_ptr<LbtTskAuto>(new MetadataWriter(out));\n }\n else if (cmd == \"count\") {\n return shared_ptr<LbtTskAuto>(new FileCounter(out));\n }\n else {\n return shared_ptr<LbtTskAuto>();\n }\n}\n\nint main(int argc, char *argv[]) {\n po::options_description desc(\"Allowed Options\");\n po::positional_options_description posOpts;\n posOpts.add(\"command\", 1);\n posOpts.add(\"ev-files\", -1);\n desc.add_options()\n (\"help\", \"produce help message\")\n (\"command\", po::value< std::string >(), \"command to perform [info|dumpfs|count]\")\n (\"ev-files\", po::value< std::vector< std::string > >(), \"evidence files\");\n\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).options(desc).positional(posOpts).run(), vm);\n po::notify(vm);\n\n shared_ptr<LbtTskAuto> walker;\n\n if (vm.count(\"help\")) {\n printHelp(desc);\n }\n else if (vm.count(\"command\") && vm.count(\"ev-files\") && (walker = createVisitor(vm[\"command\"].as<string>(), cout))) {\n std::vector< string > imgSegs(vm[\"ev-files\"].as< vector< string > >());\n scoped_array< TSK_TCHAR* > segments(new TSK_TCHAR*[imgSegs.size()]);\n for (unsigned int i = 0; i < imgSegs.size(); ++i) {\n segments[i] = (TSK_TCHAR*)imgSegs[i].c_str();\n }\n if (0 == walker->openImage(imgSegs.size(), segments.get(), TSK_IMG_TYPE_DETECT, 0)) {\n if (0 == walker->findFilesInImg()) {\n walker->finishWalk();\n return 0;\n }\n else {\n cerr << \"Had an error parsing filesystem\" << endl;\n }\n }\n else {\n cerr << \"Had an error opening the evidence file\" << endl;\n return 1;\n }\n }\n else {\n std::cerr << \"did not understand arguments\" << std::endl;\n return 1;\n }\n }\n catch (std::exception& err) {\n std::cerr << \"Error: \" << err.what() << \"\\n\\n\";\n printHelp(desc);\n return 1;\n }\n return 0;\n}\n<commit_msg>Re-added the dumpimg command<commit_after>\/*\nsrc\/main.cpp\n\nCreated by Jon Stewart on 2010-01-04.\nCopyright (c) 2010 Lightbox Technologies, Inc.\n*\/\n\n#include <boost\/program_options.hpp>\n#include <boost\/bind.hpp>\n\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n\n#include \"tsk.h\"\n\nnamespace po = boost::program_options;\n\ntemplate<class T>\nconst T& j(const T& x) {\n return x;\n}\n\ntemplate<>\nconst string& j<string>(const string& x) {\n static string S; \/\/ so evil\n S = \"\\\"\";\n S += x;\n S += \"\\\"\";\n return S;\n}\n\ntemplate<class T>\nclass JsonPair {\npublic:\n JsonPair(const string& key, const T& val, bool first): Key(key), Value(val), First(first) {}\n\n const string& Key;\n const T& Value;\n bool First;\n};\n\ntemplate<class T>\nJsonPair<T> j(const string& key, const T& val, bool first = false) {\n return JsonPair<T>(key, val, first);\n}\n\ntemplate<class T>\nostream& operator<<(ostream& out, const JsonPair<T>& pair) {\n if (!pair.First) {\n out << \",\";\n }\n out << j(pair.Key) << \":\";\n out << j(pair.Value);\n return out;\n}\n\nvoid outputFS(ostream& buf, shared_ptr<Filesystem> fs) {\n buf << \",\" << j(string(\"filesystem\")) << \":{\"\n << j(\"numBlocks\", fs->numBlocks(), true)\n << j(\"blockSize\", fs->blockSize())\n << j(\"deviceBlockSize\", fs->deviceBlockSize())\n << j(\"blockName\", fs->blockName())\n << j(\"littleEndian\", fs->littleEndian())\n << j(\"firstBlock\", fs->firstBlock())\n << j(\"firstInum\", fs->firstInum())\n << j(\"flags\", fs->flags())\n << j(\"fsID\", fs->fsIDAsString())\n << j(\"type\", fs->fsType())\n << j(\"typeName\", fs->fsName())\n << j(\"isOrphanHunting\", fs->isOrphanHunting())\n << j(\"journalInum\", fs->journalInum())\n << j(\"numInums\", fs->numInums())\n << j(\"lastBlock\", fs->lastBlock())\n << j(\"lastBlockAct\", fs->lastBlockAct())\n << j(\"lastInum\", fs->lastInum())\n << j(\"byteOffset\", fs->byteOffset())\n << j(\"rootInum\", fs->rootInum())\n << \"}\";\n}\n\nstring j(const weak_ptr< Volume >& vol) {\n stringstream buf;\n if (shared_ptr< Volume > p = vol.lock()) {\n buf << \"{\"\n << j(\"description\", p->desc(), true)\n << j(\"flags\", p->flags())\n << j(\"numBlocks\", p->numBlocks())\n << j(\"slotNum\", p->slotNum())\n << j(\"startBlock\", p->startBlock())\n << j(\"tableNum\", p->tableNum());\n if (shared_ptr<Filesystem> fs = p->filesystem().lock()) {\n outputFS(buf, fs);\n }\n buf << \"}\";\n }\n return buf.str();\n}\n\ntemplate<class ItType>\nvoid writeSequence(ostream& out, ItType begin, ItType end, const string& delimiter) {\n if (begin != end) {\n ItType it(begin);\n out << j(*it);\n for (++it; it != end; ++it) {\n out << delimiter << j(*it);\n }\n }\n}\n\nvoid writeAttr(ostream& out, const TSK_FS_ATTR* a) {\n out << \"{\"\n << j(\"flags\", a->flags, true)\n << j(\"id\", a->id)\n << j(\"name\", a->name ? string(a->name): string(\"\"))\n << j(\"size\", a->size)\n << j(\"type\", a->type)\n << j(\"rd_buf_size\", a->rd.buf_size)\n << j(\"nrd_allocsize\", a->nrd.allocsize)\n << j(\"nrd_compsize\", a->nrd.compsize)\n << j(\"nrd_initsize\", a->nrd.initsize)\n << j(\"nrd_skiplen\", a->nrd.skiplen);\n if (a->flags & TSK_FS_ATTR_RES && a->rd.buf_size && a->rd.buf) {\n out << \", \" << j(string(\"rd_buf\")) << \":\\\"\";\n ios::fmtflags oldFlags = out.flags();\n out << hex << setfill('0');\n size_t numBytes = min(a->rd.buf_size, (size_t)a->size);\n for (size_t i = 0; i < numBytes; ++i) {\n out << setw(2) << (unsigned int)a->rd.buf[i];\n }\n out.flags(oldFlags);\n out << \"\\\"\";\n }\n if (a->flags & TSK_FS_ATTR_NONRES && a->nrd.run) {\n out << \", \\\"nrd_runs\\\":[\";\n for (TSK_FS_ATTR_RUN* curRun = a->nrd.run; curRun; curRun = curRun->next) {\n if (curRun != a->nrd.run) {\n out << \", \";\n }\n out << \"{\"\n << j(\"addr\", curRun->addr, true)\n << j(\"flags\", curRun->flags)\n << j(\"len\", curRun->len)\n << j(\"offset\", curRun->offset)\n << \"}\";\n }\n out << \"]\";\n }\n out << \"}\";\n}\n\nstring bytesAsString(const unsigned char* idBeg, const unsigned char* idEnd) {\n stringstream buf;\n buf << hex;\n for (const unsigned char* cur = idBeg; cur < idEnd; ++cur) {\n buf << hex << (unsigned int)*cur;\n }\n return buf.str();\n}\n\nclass LbtTskAuto: public TskAuto {\npublic:\n virtual ~LbtTskAuto() {}\n\n virtual uint8_t start() {\n return findFilesInImg();\n }\n\n virtual TSK_RETVAL_ENUM processFile(TSK_FS_FILE*, const char*) { return TSK_OK; }\n\n virtual void finishWalk() {}\n};\n\nclass ImageDumper: public LbtTskAuto {\npublic:\n ImageDumper(ostream& out): Out(out) {}\n\n virtual uint8_t start() {\n ssize_t rlen;\n char buf[4096];\n TSK_OFF_T off = 0;\n\n while (off < m_img_info->size) {\n rlen = tsk_img_read(m_img_info, off, buf, sizeof(buf));\n if (rlen == -1) {\n return -1;\n }\n off += rlen;\n Out.write(buf, rlen);\n if (!Out.good()) {\n return -1;\n }\n }\n return 0;\n }\n\nprivate:\n ostream& Out;\n};\n\nclass FileCounter: public LbtTskAuto {\npublic:\n FileCounter(ostream& out): NumFiles(0), Out(out) {}\n\n virtual ~FileCounter() {}\n\n virtual TSK_RETVAL_ENUM processFile(TSK_FS_FILE*, const char*) {\n ++NumFiles;\n return TSK_OK;\n }\n\n virtual void finishWalk() {\n Out << NumFiles << endl;\n }\n\n unsigned int NumFiles;\n\nprotected:\n ostream& Out;\n};\n\nclass MetadataWriter: public FileCounter {\npublic:\n MetadataWriter(ostream& out);\n\n virtual ~MetadataWriter() {}\n\n virtual TSK_FILTER_ENUM filterFs(TSK_FS_INFO *fs_info);\n\n virtual TSK_RETVAL_ENUM processFile(TSK_FS_FILE *fs_file, const char *path);\n virtual void finishWalk() {}\n\nprivate:\n string FsInfo,\n Null,\n CurDir;\n\n TSK_FS_INFO* Fs;\n\n unsigned int CurDirIndex;\n};\n\nMetadataWriter::MetadataWriter(ostream& out):\n FileCounter(out), Fs(0), CurDirIndex(0) {}\n\nTSK_FILTER_ENUM MetadataWriter::filterFs(TSK_FS_INFO *fs) {\n stringstream buf;\n buf << j(string(\"fs\")) << \":{\"\n << j(\"byteOffset\", fs->offset, true)\n << j(\"blockSize\", fs->block_size)\n << j(\"fsID\", bytesAsString(fs->fs_id, &fs->fs_id[fs->fs_id_used]))\n << \"}\";\n FsInfo = buf.str();\n Fs = fs;\n return TSK_FILTER_CONT;\n}\n\nTSK_RETVAL_ENUM MetadataWriter::processFile(TSK_FS_FILE* file, const char* path) {\n ++CurDirIndex;\n if (0 != CurDir.compare(path)) {\n CurDirIndex = 0;\n CurDir.assign(path);\n }\n \/\/ cerr << \"beginning callback\" << endl;\n try {\n if (file) {\n Out << \"{\" << FsInfo;\n if (path) {\n Out << j(\"path\", string(path));\n }\n if (file->meta) {\n \/\/ need to come back for name2 and attrlist \n TSK_FS_META* i = file->meta;\n Out << \", \\\"meta\\\":{\"\n << j(\"addr\", i->addr, true)\n << j(\"atime\", i->atime)\n << j(\"content_len\", i->content_len)\n << j(\"crtime\", i->crtime)\n << j(\"ctime\", i->ctime)\n << j(\"flags\", i->flags)\n << j(\"gid\", i->gid);\n if (i->link) {\n Out << j(\"link\", string(i->link));\n }\n if (TSK_FS_TYPE_ISEXT(Fs->ftype)) {\n Out << j(\"dtime\", i->time2.ext2.dtime);\n }\n else if (TSK_FS_TYPE_ISHFS(Fs->ftype)) {\n Out << j(\"bkup_time\", i->time2.hfs.bkup_time);\n }\n Out << j(\"mode\", i->mode)\n << j(\"mtime\", i->mtime)\n << j(\"nlink\", i->nlink)\n << j(\"seq\", i->seq)\n << j(\"size\", i->size)\n << j(\"type\", i->type)\n << j(\"uid\", i->uid)\n << \"}\";\n }\n if (file->name) {\n TSK_FS_NAME* n = file->name;\n Out << \", \\\"name\\\":{\"\n << j(\"flags\", n->flags, true)\n << j(\"meta_addr\", n->meta_addr)\n << j(\"meta_seq\", n->meta_seq)\n << j(\"name\", (n->name && n->name_size ? string(n->name): Null))\n << j(\"shrt_name\", (n->shrt_name && n->shrt_name_size ? string(n->shrt_name): Null))\n << j(\"type\", n->type)\n << j(\"dirIndex\", CurDirIndex)\n << \"}\";\n\n }\n int numAttrs = tsk_fs_file_attr_getsize(file);\n if (numAttrs > 0) {\n Out << \", \\\"attrs\\\":[\";\n uint num = 0;\n for (int i = 0; i < numAttrs; ++i) {\n const TSK_FS_ATTR* a = tsk_fs_file_attr_get_idx(file, i);\n if (a) {\n if (num > 0) {\n Out << \", \";\n }\n writeAttr(Out, a);\n ++num;\n }\n }\n Out << \"]\";\n }\n Out << \"}\" << endl;\n }\n }\n catch (std::exception& e) {\n cerr << \"Error on \" << NumFiles << \": \" << e.what() << endl;\n }\n \/\/ cerr << \"finishing callback\" << endl;\n FileCounter::processFile(file, path);\n return TSK_OK;\n}\n\nbool printImageDump(const shared_ptr< Image >& img) {\n return img->dump(std::cout) != -1;\n}\n\nbool printDeviceInfo(const shared_ptr< Image >& img) {\n std::cout << \"{\";\n\n std::cout << j(string(\"files\")) << \":[\";\n writeSequence(cout, img->files().begin(), img->files().end(), \", \");\n std::cout << \"]\"\n << j(\"description\", img->desc())\n << j(\"size\", img->size());\n\n if (shared_ptr<VolumeSystem> vs = img->volumeSystem().lock()) {\n std::cout << \",\" << j(\"volumeSystem\") << \":{\"\n << j(\"type\", vs->type(), true)\n << j(\"description\", vs->desc())\n << j(\"blockSize\", vs->blockSize())\n << j(\"numVolumes\", vs->numVolumes())\n << j(\"offset\", vs->offset());\n\n if (vs->numVolumes()) {\n std::cout << \",\" << j(string(\"volumes\")) << \":[\";\n writeSequence(std::cout, vs->volBegin(), vs->volEnd(), \",\");\n std::cout << \"]\";\n }\n else {\n cerr << \"Image has volume system, but no volumes\" << endl;\n }\n std::cout << \"}\";\n }\n else if (shared_ptr<Filesystem> fs = img->filesystem().lock()) {\n outputFS(std::cout, fs);\n }\n else {\n cerr << \"Image had neither a volume system nor a filesystem\" << endl;\n }\n std::cout << \"}\" << std::endl;\n return true;\n}\n\nvoid printHelp(const po::options_description& desc) {\n std::cout << \"fsrip, Copyright (c) 2010-2011, Lightbox Technologies, Inc.\" << std::endl;\n std::cout << \"TSK version is \" << tsk_version_get_str() << std::endl;\n std::cout << \"Boost program options version is \" << BOOST_PROGRAM_OPTIONS_VERSION << std::endl;\n std::cout << desc << std::endl;\n}\n\nshared_ptr<LbtTskAuto> createVisitor(const string& cmd, ostream& out) {\n\/* if (cmd == \"info\") {\n return shared_ptr<TskAuto>(new ImgInfo(out));\n }*\/\n if (cmd == \"dumpimg\") {\n return shared_ptr<LbtTskAuto>(new ImageDumper(out));\n }\n else if (cmd == \"dumpfs\") {\n return shared_ptr<LbtTskAuto>(new MetadataWriter(out));\n }\n else if (cmd == \"count\") {\n return shared_ptr<LbtTskAuto>(new FileCounter(out));\n }\n else {\n return shared_ptr<LbtTskAuto>();\n }\n}\n\nint main(int argc, char *argv[]) {\n po::options_description desc(\"Allowed Options\");\n po::positional_options_description posOpts;\n posOpts.add(\"command\", 1);\n posOpts.add(\"ev-files\", -1);\n desc.add_options()\n (\"help\", \"produce help message\")\n (\"command\", po::value< std::string >(), \"command to perform [info|dumpimg|dumpfs|count]\")\n (\"ev-files\", po::value< std::vector< std::string > >(), \"evidence files\");\n\n po::variables_map vm;\n try {\n po::store(po::command_line_parser(argc, argv).options(desc).positional(posOpts).run(), vm);\n po::notify(vm);\n\n shared_ptr<LbtTskAuto> walker;\n\n if (vm.count(\"help\")) {\n printHelp(desc);\n }\n else if (vm.count(\"command\") && vm.count(\"ev-files\") && (walker = createVisitor(vm[\"command\"].as<string>(), cout))) {\n std::vector< string > imgSegs(vm[\"ev-files\"].as< vector< string > >());\n scoped_array< TSK_TCHAR* > segments(new TSK_TCHAR*[imgSegs.size()]);\n for (unsigned int i = 0; i < imgSegs.size(); ++i) {\n segments[i] = (TSK_TCHAR*)imgSegs[i].c_str();\n }\n if (0 == walker->openImage(imgSegs.size(), segments.get(), TSK_IMG_TYPE_DETECT, 0)) {\n if (0 == walker->start()) {\n walker->finishWalk();\n return 0;\n }\n else {\n cerr << \"Had an error parsing filesystem\" << endl;\n }\n }\n else {\n cerr << \"Had an error opening the evidence file\" << endl;\n return 1;\n }\n }\n else {\n std::cerr << \"did not understand arguments\" << std::endl;\n return 1;\n }\n }\n catch (std::exception& err) {\n std::cerr << \"Error: \" << err.what() << \"\\n\\n\";\n printHelp(desc);\n return 1;\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Halide tutorial lesson 2.\n\n\/\/ This lesson demonstrates how to pass in input images.\n\n\/\/ On linux, you can compile and run it like so:\n\/\/ g++ lesson_02.cpp -I ..\/include -L ..\/bin -lHalide -lpthread -ldl -lpng -o lesson_02\n\/\/ LD_LIBRARY_PATH=..\/bin .\/lesson_02 \n\n\/\/ The only Halide header file you need is Halide.h. It includes all of Halide.\n#include <Halide.h>\n\n\/\/ We'll also include stdio for printf.\n#include <stdio.h>\n\n\/\/ Include some support code for loading pngs. It assumes there's an\n\/\/ Image type, so we'll pull the one from Halide namespace;\nusing Halide::Image;\n#include \"..\/apps\/support\/image_io.h\"\n\nint main(int argc, char **argv) {\n\n \/\/ This program defines a single-stage imaging pipeline that\n \/\/ brightens an image.\n\n \/\/ First we'll load the input image we wish to brighten.\n Halide::Image<uint8_t> input = load<uint8_t>(\"..\/apps\/images\/rgb.png\");\n\n \/\/ Next we define our Func object that represents our one pipeline\n \/\/ stage.\n Halide::Func brighter;\n\n \/\/ Our Func will have three arguments, representing the position\n \/\/ in the image and the color channel. Halide treats color\n \/\/ channels as an extra dimension of the image.\n Halide::Var x, y, c;\n\n \/\/ Normally we'd probably write the whole function definition on\n \/\/ one line. Here we'll break it apart so we can explain what\n \/\/ we're doing at every step.\n \n \/\/ For each pixel of the input image.\n Halide::Expr value = input(x, y, c);\n \n \/\/ Cast it to a floating point value.\n value = Halide::cast<float>(value);\n\n \/\/ Multiply it by 1.5 to brighten it. Halide represents real\n \/\/ numbers as floats, not doubles, so we stick an 'f' on the end\n \/\/ of our constant.\n value = value * 1.5f;\n\n \/\/ Clamp it to between zero and 255 so we don't get overflow when\n \/\/ we cast it back to an 8-bit unsigned int.\n value = Halide::clamp(value, 0.0f, 255.0f);\n\n \/\/ Cast it back to an 8-bit unsigned integer.\n value = Halide::cast<uint8_t>(value);\n\n \/\/ Define the function.\n brighter(x, y, c) = value;\n\n \/\/ The equivalent one-liner to all of the above is:\n \/\/ \n \/\/ brighter(x, y, c) = Halide::cast<uint8_t>(clamp(input(x, y, c) * 1.5f, 0, 255));\n \/\/ \n \/\/ In the shorter version: \n \/\/ - I skipped the cast to float, because multiplying by 1.5f does\n \/\/ that automatically.\n \/\/ - I also used integer constants in clamp, because they get cast\n \/\/ to match the type of the first argument.\n \/\/ - I left the Halide:: off clamp. It's unnecessary due to Koenig\n \/\/ lookup.\n\n \/\/ Remember. All we've done so far is build a representation of a\n \/\/ Halide program in memory. We haven't actually processed any\n \/\/ pixels yet. We haven't even compiled that Halide program yet.\n \n \/\/ So now we'll realize the Func. The size of the output image\n \/\/ should match the size of the input image. If we just wanted to\n \/\/ brighten a portion of the input image we could request a\n \/\/ smaller size. If we request a larger size Halide will throw an\n \/\/ error at runtime telling us we're trying to read out of bounds\n \/\/ on the input image.\n Halide::Image<uint8_t> output = brighter.realize(input.width(), input.height(), input.channels());\n\n \/\/ Save the output for inspection. It should look like a bright parrot.\n save(output, \"brighter.png\");\n \n return 0;\n}\n<commit_msg>Tweaks to tutorial lesson 2<commit_after>\/\/ Halide tutorial lesson 2.\n\n\/\/ This lesson demonstrates how to pass in input images.\n\n\/\/ On linux, you can compile and run it like so:\n\/\/ g++ lesson_02.cpp -I ..\/include -L ..\/bin -lHalide -lpthread -ldl -lpng -o lesson_02\n\/\/ LD_LIBRARY_PATH=..\/bin .\/lesson_02 \n\n\/\/ The only Halide header file you need is Halide.h. It includes all of Halide.\n#include <Halide.h>\n\n\/\/ Include some support code for loading pngs. It assumes there's an\n\/\/ Image type, so we'll pull the one from Halide namespace;\nusing Halide::Image;\n#include \"..\/apps\/support\/image_io.h\"\n\nint main(int argc, char **argv) {\n\n \/\/ This program defines a single-stage imaging pipeline that\n \/\/ brightens an image.\n\n \/\/ First we'll load the input image we wish to brighten.\n Halide::Image<uint8_t> input = load<uint8_t>(\"..\/apps\/images\/rgb.png\");\n\n \/\/ Next we define our Func object that represents our one pipeline\n \/\/ stage.\n Halide::Func brighter;\n\n \/\/ Our Func will have three arguments, representing the position\n \/\/ in the image and the color channel. Halide treats color\n \/\/ channels as an extra dimension of the image.\n Halide::Var x, y, c;\n\n \/\/ Normally we'd probably write the whole function definition on\n \/\/ one line. Here we'll break it apart so we can explain what\n \/\/ we're doing at every step.\n \n \/\/ For each pixel of the input image.\n Halide::Expr value = input(x, y, c);\n \n \/\/ Cast it to a floating point value.\n value = Halide::cast<float>(value);\n\n \/\/ Multiply it by 1.5 to brighten it. Halide represents real\n \/\/ numbers as floats, not doubles, so we stick an 'f' on the end\n \/\/ of our constant.\n value = value * 1.5f;\n\n \/\/ Clamp it to be less than 255, so we don't get overflow when we\n \/\/ cast it back to an 8-bit unsigned int.\n value = Halide::min(value, 255.0f);\n\n \/\/ Cast it back to an 8-bit unsigned integer.\n value = Halide::cast<uint8_t>(value);\n\n \/\/ Define the function.\n brighter(x, y, c) = value;\n\n \/\/ The equivalent one-liner to all of the above is:\n \/\/ \n \/\/ brighter(x, y, c) = Halide::cast<uint8_t>(min(input(x, y, c) * 1.5f, 255));\n \/\/ \n \/\/ In the shorter version: \n \/\/ - I skipped the cast to float, because multiplying by 1.5f does\n \/\/ that automatically.\n \/\/ - I also used integer constants in clamp, because they get cast\n \/\/ to match the type of the first argument.\n \/\/ - I left the Halide:: off clamp. It's unnecessary due to Koenig\n \/\/ lookup.\n\n \/\/ Remember. All we've done so far is build a representation of a\n \/\/ Halide program in memory. We haven't actually processed any\n \/\/ pixels yet. We haven't even compiled that Halide program yet.\n \n \/\/ So now we'll realize the Func. The size of the output image\n \/\/ should match the size of the input image. If we just wanted to\n \/\/ brighten a portion of the input image we could request a\n \/\/ smaller size. If we request a larger size Halide will throw an\n \/\/ error at runtime telling us we're trying to read out of bounds\n \/\/ on the input image.\n Halide::Image<uint8_t> output = brighter.realize(input.width(), input.height(), input.channels());\n\n \/\/ Save the output for inspection. It should look like a bright parrot.\n save(output, \"brighter.png\");\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cv.h>\n#include <highgui.h>\n#include <iostream>\n#include <gflags\/gflags.h>\n\nusing namespace std;\nusing namespace cv;\n\nDEFINE_bool(display, true, \"Display video in window.\");\nDEFINE_bool(verbose, false, \"Display video in window.\");\nDEFINE_string(save, \"\", \"Save output to file.\");\n\nint main(int argc, char **argv)\n{\n google::ParseCommandLineFlags(&argc, &argv, true);\n\n if (argc !=2) {\n cout << \"usage: \" << argv[0] << \" input-video\" << endl;\n return -1;\n }\n\n VideoCapture vc(argv[argc-1]);\n if(!vc.isOpened()) return -1;\n\n Mat frame_in;\n vc >> frame_in;\n Mat frame_out(frame_in.size(), frame_in.type()); \/\/ don't copy\n vc.set(CV_CAP_PROP_POS_FRAMES, 0);\n\n int width = vc.get(CV_CAP_PROP_FRAME_WIDTH);\n int height = vc.get(CV_CAP_PROP_FRAME_HEIGHT);\n int frame_count = vc.get(CV_CAP_PROP_FRAME_COUNT);\n \n frame_out.resize(frame_count);\n for (int i = 0; i < frame_count; i++) {\n frame_in.row(0).copyTo(frame_out.row(i));\n }\n\n if (FLAGS_display)\n namedWindow(argv[0],1);\n\n VideoWriter vw;\n if (!FLAGS_save.empty()) {\n int ex = CV_FOURCC('I', 'Y', 'U', 'V');\n Size s = Size(width, frame_count);\n vw.open(FLAGS_save, ex, vc.get(CV_CAP_PROP_FPS), s);\n }\n\n for (int j = 0; j < height; j++)\n {\n if (FLAGS_verbose)\n cout << \"Frame \" << j+1 << \" of \" << height << \".\" << endl;\n\n for (int i = 0; i < frame_count; i++) {\n vc >> frame_in;\n frame_in.row(j).copyTo(frame_out.row(i));\n }\n vc.set(CV_CAP_PROP_POS_FRAMES, 0);\n\n if (FLAGS_display) {\n imshow(argv[0], frame_out);\n if(waitKey(30) == 0x1B \/* ESC *\/ ) break;\n }\n\n if (!FLAGS_save.empty())\n vw.write(frame_out);\n\n }\n return 0;\n}\n<commit_msg>added y axis of rotation<commit_after>#include <cv.h>\n#include <highgui.h>\n#include <iostream>\n#include <gflags\/gflags.h>\n\nusing namespace std;\nusing namespace cv;\n\nDEFINE_bool(display, true, \"Display video in window.\");\nDEFINE_bool(quiet, false, \"Suppress terminal output.\");\nDEFINE_string(save, \"output.avi\", \"Save output to file.\");\nDEFINE_string(axis, \"y\", \"Axis of rotation.\");\n\nint main(int argc, char **argv)\n{\n google::ParseCommandLineFlags(&argc, &argv, true);\n\n if (argc !=2) {\n cout << \"usage: \" << argv[0] << \" input-video\" << endl;\n return -1;\n }\n\n VideoCapture vc(argv[argc-1]);\n if(!vc.isOpened()) return -1;\n\n Mat frame_in;\n vc >> frame_in;\n vc.set(CV_CAP_PROP_POS_FRAMES, 0);\n\n int width = vc.get(CV_CAP_PROP_FRAME_WIDTH);\n int height = vc.get(CV_CAP_PROP_FRAME_HEIGHT);\n int frame_count = vc.get(CV_CAP_PROP_FRAME_COUNT);\n\n Size s;\n if (FLAGS_axis == \"x\") {\n s = Size(width, frame_count);\n } else if (FLAGS_axis == \"y\") {\n s = Size(frame_count, height);\n } else {\n cout << \"Invalid axis of rotation.\";\n return 1;\n }\n\n Mat frame_out(s, frame_in.type());\n\n if (FLAGS_display)\n namedWindow(argv[0],1);\n\n VideoWriter vw;\n if (!FLAGS_save.empty()) {\n int ex = CV_FOURCC('I', 'Y', 'U', 'V');\n vw.open(FLAGS_save, ex, vc.get(CV_CAP_PROP_FPS), s);\n cout << \"Saving to \" << FLAGS_save << endl;\n }\n\n int frame_out_count = FLAGS_axis == \"x\" ? height : width;\n for (int j = 0; j < frame_out_count; j++)\n {\n if (!FLAGS_quiet)\n cout << \"Frame \" << j+1 << \" of \" << frame_out_count << \".\" << endl;\n\n for (int i = 0; i < frame_count; i++) {\n vc >> frame_in;\n if (FLAGS_axis == \"x\")\n frame_in.row(j).copyTo(frame_out.row(i));\n else\n frame_in.col(j).copyTo(frame_out.col(i));\n }\n vc.set(CV_CAP_PROP_POS_FRAMES, 0);\n\n if (FLAGS_display) {\n imshow(argv[0], frame_out);\n if(waitKey(30) == 0x1B \/* ESC *\/ ) break;\n }\n\n if (!FLAGS_save.empty())\n vw.write(frame_out);\n\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\n#include \"blifparse.hpp\"\n#include \"blif_pretty_print.hpp\"\n\nusing namespace blifparse;\n\nint exit_code = 0;\n\nclass NoOpCallback : public Callback {\n \/\/A No-op version of the callback\n public:\n void start_parse() override {}\n\n void filename(std::string \/*fname*\/) override {};\n void lineno(int \/*line_num*\/) override {};\n\n void begin_model(std::string \/*model_name*\/) override {}\n void inputs(std::vector<std::string> \/*inputs*\/) override {}\n void outputs(std::vector<std::string> \/*outputs*\/) override {}\n\n void names(std::vector<std::string> \/*nets*\/, std::vector<std::vector<LogicValue>> \/*so_cover*\/) override {}\n void latch(std::string \/*input*\/, std::string \/*output*\/, LatchType \/*type*\/, std::string \/*control*\/, LogicValue \/*init*\/) override {}\n void subckt(std::string \/*model*\/, std::vector<std::string> \/*ports*\/, std::vector<std::string> \/*nets*\/) override {}\n void blackbox() override {}\n\n void end_model() override {}\n\n void finish_parse() override {}\n\n void parse_error(const int curr_lineno, const std::string& near_text, const std::string& msg) override {\n fprintf(stderr, \"Custom Error at line %d near '%s': %s\\n\", curr_lineno, near_text.c_str(), msg.c_str());\n had_error_ = true;\n }\n\n bool had_error() { return had_error_ = true; }\n\n private:\n bool had_error_ = false;\n};\n\nint main(int argc, char **argv) {\n if(argc != 2) {\n fprintf(stderr, \"Usage: %s filename.blif\\n\", argv[0]);\n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Reads in an blif file into internal data structures\\n\");\n fprintf(stderr, \"and then prints it out\\n\");\n exit(1);\n }\n\n \/\/Parse the file\n blifparse::BlifPrettyPrinter callback(true);\n \/\/NoOpCallback callback;\n blif_parse_filename(argv[1], callback);\n\n if(callback.had_error()) {\n return 1;\n } else {\n return 0;\n }\n}\n<commit_msg>Fix more extra semicolons<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\n#include \"blifparse.hpp\"\n#include \"blif_pretty_print.hpp\"\n\nusing namespace blifparse;\n\nint exit_code = 0;\n\nclass NoOpCallback : public Callback {\n \/\/A No-op version of the callback\n public:\n void start_parse() override {}\n\n void filename(std::string \/*fname*\/) override {}\n void lineno(int \/*line_num*\/) override {}\n\n void begin_model(std::string \/*model_name*\/) override {}\n void inputs(std::vector<std::string> \/*inputs*\/) override {}\n void outputs(std::vector<std::string> \/*outputs*\/) override {}\n\n void names(std::vector<std::string> \/*nets*\/, std::vector<std::vector<LogicValue>> \/*so_cover*\/) override {}\n void latch(std::string \/*input*\/, std::string \/*output*\/, LatchType \/*type*\/, std::string \/*control*\/, LogicValue \/*init*\/) override {}\n void subckt(std::string \/*model*\/, std::vector<std::string> \/*ports*\/, std::vector<std::string> \/*nets*\/) override {}\n void blackbox() override {}\n\n void end_model() override {}\n\n void finish_parse() override {}\n\n void parse_error(const int curr_lineno, const std::string& near_text, const std::string& msg) override {\n fprintf(stderr, \"Custom Error at line %d near '%s': %s\\n\", curr_lineno, near_text.c_str(), msg.c_str());\n had_error_ = true;\n }\n\n bool had_error() { return had_error_ = true; }\n\n private:\n bool had_error_ = false;\n};\n\nint main(int argc, char **argv) {\n if(argc != 2) {\n fprintf(stderr, \"Usage: %s filename.blif\\n\", argv[0]);\n fprintf(stderr, \"\\n\");\n fprintf(stderr, \"Reads in an blif file into internal data structures\\n\");\n fprintf(stderr, \"and then prints it out\\n\");\n exit(1);\n }\n\n \/\/Parse the file\n blifparse::BlifPrettyPrinter callback(true);\n \/\/NoOpCallback callback;\n blif_parse_filename(argv[1], callback);\n\n if(callback.had_error()) {\n return 1;\n } else {\n return 0;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <chrono>\n#include \"nnlib.h\"\nusing namespace std;\nusing namespace nnlib;\n\nint main()\n{\n\tcout << \"========== Sanity Test ==========\" << endl;\n\t\n\tsize_t inps = 3;\n\tsize_t outs = 2;\n\tsize_t batch = 5;\n\t\n\tLinear<double> layer1(inps, outs, batch);\n\t\n\tVector<double> &bias = *(Vector<double> *)layer1.parameters()[0];\n\tMatrix<double> &weights = *(Matrix<double> *)layer1.parameters()[1];\n\t\n\tVector<double> parameters(layer1.parameters());\n\tfor(double &val : parameters)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> inputs(batch, inps);\n\tfor(double &val : inputs)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> blame(batch, outs);\n\tfor(double &val : blame)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> targets(batch, outs);\n\ttargets.fill(-0.25);\n\t\n\tMatrix<double> outputs(batch, outs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t{\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t{\n\t\t\toutputs(i, j) = bias(j);\n\t\t\tfor(size_t k = 0; k < inps; ++k)\n\t\t\t\toutputs(i, j) += inputs(i, k) * weights(j, k);\n\t\t}\n\t}\n\t\n\tlayer1.forward(inputs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t\tNNAssert(fabs(outputs(i, j) - layer1.output()(i, j)) < 1e-6, \"Linear::forward failed!\");\n\tcout << \"Linear::forward passed!\" << endl;\n\t\n\tMatrix<double> inputBlame(batch, inps, 0);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < inps; ++j)\n\t\t\tfor(size_t k = 0; k < outs; ++k)\n\t\t\t\tinputBlame(i, j) += blame(i, k) * weights(k, j);\n\t\n\tlayer1.backward(inputs, blame);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < inps; ++j)\n\t\t\tNNAssert(fabs(inputBlame(i, j) - layer1.inputBlame()(i, j)) < 1e-6, \"Linear::backword failed!\");\n\tcout << \"Linear::backward passed!\" << endl;\n\t\n\tTanH<double> layer2(outs, batch);\n\tSequential<double> nn;\n\tnn.add(new Linear<double>(layer1));\n\tnn.add(new TanH<double>(layer2));\n\t\n\tSSE<double> critic(outs, batch);\n\tSGD<Module<double>, SSE<double>> optimizer(nn, critic);\n\t\n\tnn.forward(inputs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t\tNNAssert(fabs(nn.output()(i, j) - tanh(layer1.output()(i, j))) < 1e-6, \"Sequential::forward failed!\");\n\tcout << \"Sequential::forward passed!\" << endl;\n\t\n\tfor(size_t i = 0; i < 10000; ++i)\n\t{\n\t\tMatrix<double>::shuffleRows(inputs, targets);\n\t\toptimizer.optimize(inputs, targets);\n\t}\n\tNNAssert(critic.forward(nn.forward(inputs), targets).sum() < 1.25, \"SGD::optimize failed!\");\n\tcout << \"SGD::optimize passed!\" << endl;\n\t\n\tcout << \"Sanity test passed!\" << endl << endl;\n\t\n\tusing clock = chrono::high_resolution_clock;\n\tchrono::time_point<clock> start;\n\t\n\t\/\/ MARK: Concat Test\n\t\n\t{\n\t\tcout << \"========== Simple Concat ==========\" << endl;\n\t\t\n\t\tSequential<> *one = new Sequential<>(new Linear<>(1, 1));\n\t\tSequential<> *two = new Sequential<>(new Linear<>(1, 1), new Sin<>());\n\t\tConcat<> *concat = new Concat<>(one, two);\n\t\tSequential<> nn(concat);\n\t\t\n\t\tdynamic_cast<Linear<> *>(one->component(0))->bias().fill(0);\n\t\tdynamic_cast<Linear<> *>(one->component(0))->weights().fill(1);\n\t\t\n\t\tdynamic_cast<Linear<> *>(two->component(0))->bias().fill(0);\n\t\tdynamic_cast<Linear<> *>(two->component(0))->weights().fill(1);\n\t\t\n\t\tMatrix<> input(1, 1);\n\t\tinput(0, 0) = 1;\n\t\t\n\t\tMatrix<> blame(1, 2);\n\t\tblame(0, 0) = 1;\n\t\tblame(0, 1) = 0.5;\n\t\t\n\t\tnn.forward(input);\n\t\tnn.backward(input, blame);\n\t\t\n\t\tNNHardAssert(nn.output()(0, 0) == 1, \"Linear forward in concat failed!\");\n\t\tNNHardAssert(nn.output()(0, 1) == sin(1), \"Sinusoid forward in concat failed!\");\n\t\tNNHardAssert(nn.inputBlame()(0, 0) == 1 + 0.5 * cos(1), \"Backward in concat failed!\");\n\t\t\n\t\tcout << \"Simple concat test passed!\" << endl << endl;\n\t}\n\t\n\t{\n\t\tcout << \"========== Concat Test ==========\" << endl;\n\t\t\n\t\tcout << \"Loading data...\" << flush;\n\t\tMatrix<> train = Loader<>::loadArff(\"..\/datasets\/mackey-glass\/train.arff\");\n\t\tMatrix<> test = Loader<>::loadArff(\"..\/datasets\/mackey-glass\/test.arff\");\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Preprocessing data...\" << flush;\n\t\tMatrix<> trainFeat\t= train.block(0, 0, train.rows(), 1);\n\t\tMatrix<> trainLab\t= train.block(0, 1, train.rows(), 1);\n\t\tMatrix<> testFeat\t= test.block(0, 0, test.rows(), 1);\n\t\tMatrix<> testLab\t= test.block(0, 1, test.rows(), 1);\n\t\t\n\t\tdouble biggest = trainLab(0, 0), smallest = trainLab(0, 0);\n\t\tfor(auto d : trainLab)\n\t\t\tbiggest = std::max(biggest, d), smallest = std::min(smallest, d);\n\t\tfor(auto &d : trainLab)\n\t\t\td = 10 * (d - smallest) \/ (biggest - smallest);\n\t\tfor(auto &d : testLab)\n\t\t\td = 10 * (d - smallest) \/ (biggest - smallest);\n\t\t\n\t\tSaver<>::saveArff(trainLab, \"newtrain.arff\");\n\t\t\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Creating network...\" << flush;\n\t\tLinear<> *sine = new Linear<>(1, train.rows()), *line = new Linear<>(1, 10), *out = new Linear<>(1);\n\t\tConcat<> *concat = new Concat<>(\n\t\t\tnew Sequential<>(sine, new Sin<>()),\n\t\t\tnew Sequential<>(line)\n\t\t);\n\t\tSequential<> nn(concat, out);\n\t\tSSE<double> critic(1);\n\t\tauto optimizer = MakeOptimizer<SGD>(nn, critic);\n\t\toptimizer.learningRate(0.001);\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Initializing weights...\" << flush;\n\t\t{\n\t\t\tauto &bias = sine->bias();\n\t\t\tauto &weights = sine->weights();\n\t\t\tfor(size_t i = 0; i < bias.size() \/ 2; ++i)\n\t\t\t{\n\t\t\t\tfor(size_t j = 0; j < weights.cols(); ++j)\n\t\t\t\t{\n\t\t\t\t\tweights(2 * i, j)\t\t= 2.0 * M_PI * (i + 1);\n\t\t\t\t\tweights(2 * i + 1, j)\t= 2.0 * M_PI * (i + 1);\n\t\t\t\t}\n\t\t\t\tbias(2 * i)\t\t= 0.5 * M_PI;\n\t\t\t\tbias(2 * i + 1)\t= M_PI;\n\t\t\t}\n\t\t}\n\t\tline->bias().fill(0);\n\t\tline->weights().fill(1);\n\t\tout->bias().scale(0.001);\n\t\tout->weights().scale(0.001);\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Initial SSE: \" << flush;\n\t\tnn.batch(testFeat.rows());\n\t\tcritic.batch(testFeat.rows());\n\t\tcout << critic.forward(nn.forward(testFeat), testLab).sum() << endl;\n\t\t\n\t\tsize_t epochs = 1000;\n\t\tsize_t batchesPerEpoch = train.rows();\n\t\tsize_t batchSize = 1;\n\t\t\n\t\tdouble l1 = 0.01;\n\t\t\n\t\tBatcher<double> batcher(trainFeat, trainLab, batchSize);\n\t\tnn.batch(batchSize);\n\t\tcritic.batch(batchSize);\n\t\t\n\t\tcout << \"Training...\" << endl;\n\t\t\n\t\tfor(size_t i = 0; i < epochs; ++i)\n\t\t{\n\t\t\tfor(size_t j = 0; j < batchesPerEpoch; ++j)\n\t\t\t{\n\t\t\t\tfor(auto &w : out->bias())\n\t\t\t\t\tw = w > 0 ? std::max(0.0, w - l1) : std::min(0.0, w + l1);\n\t\t\t\tfor(auto &w : out->weights())\n\t\t\t\t\tw = w > 0 ? std::max(0.0, w - l1) : std::min(0.0, w + l1);\n\t\t\t\toptimizer.optimize(batcher.features(), batcher.labels());\n\t\t\t\tbatcher.next(true);\n\t\t\t}\n\t\t\t\n\t\t\tProgress::display(i, epochs);\n\t\t\t\n\t\t\tnn.batch(testFeat.rows());\n\t\t\tcritic.batch(testFeat.rows());\n\t\t\tcout << \"\\t\" << critic.forward(nn.forward(testFeat), testLab).sum() << flush;\n\t\t\tnn.batch(batchSize);\n\t\t\tcritic.batch(batchSize);\n\t\t}\n\t\tProgress::display(epochs, epochs, '\\n');\n\t\t\n\t\tnn.batch(testFeat.rows());\n\t\tnn.forward(testFeat);\n\t\tfor(auto &d : nn.output())\n\t\t\td = d * (biggest - smallest) \/ 10.0 + smallest;\n\t\tSaver<>::saveArff(nn.output(), \"prediction.arff\");\n\t\t\n\t\tcout << endl;\n\t}\n\t\n\t\/\/ MARK: MNIST Test\n\t\n\t{\n\t\tcout << \"========== MNIST Test ==========\" << endl;\n\t\t\n\t\tcout << \"Loading data...\" << flush;\n\t\tstart = clock::now();\n\t\tMatrix<double> train = Loader<double>::loadArff(\"..\/datasets\/mnist\/train.arff\");\n\t\tMatrix<double> test = Loader<double>::loadArff(\"..\/datasets\/mnist\/test.arff\");\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Preprocessing data...\" << flush;\n\t\tstart = clock::now();\n\t\t\n\t\tMatrix<double> trainLab(train.rows(), 10, 0.0);\n\t\tMatrix<double> trainFeat = train.block(0, 0, train.rows(), train.cols() - 1);\n\t\ttrainFeat.scale(1.0 \/ 255.0);\n\t\t\n\t\tMatrix<double> testLab(test.rows(), 10, 0.0);\n\t\tMatrix<double> testFeat = test.block(0, 0, test.rows(), test.cols() - 1);\n\t\ttestFeat.scale(1.0 \/ 255.0);\n\t\t\n\t\tfor(size_t i = 0; i < train.rows(); ++i)\n\t\t\ttrainLab(i, train(i).back()) = 1.0;\n\t\t\n\t\tfor(size_t i = 0; i < test.rows(); ++i)\n\t\t\ttestLab(i, test(i).back()) = 1.0;\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Creating network...\" << flush;\n\t\tstart = clock::now();\n\t\t\n\t\tSequential<> nn;\n\t\tnn.add(\n\t\t\tnew Linear<>(trainFeat.cols(), 300), new TanH<>(),\n\t\t\tnew Linear<>(100), new TanH<>(),\n\t\t\tnew Linear<>(10), new TanH<>()\n\t\t);\n\t\t\n\t\tSSE<double> critic(10);\n\t\tauto optimizer = MakeOptimizer<RMSProp>(nn, critic);\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Initial SSE: \" << flush;\n\t\tnn.batch(testFeat.rows());\n\t\tcritic.batch(testFeat.rows());\n\t\tcout << critic.forward(nn.forward(testFeat), testLab).sum() << endl;\n\t\t\n\t\tsize_t epochs = 100;\n\t\tsize_t batchesPerEpoch = 100;\n\t\tsize_t batchSize = 10;\n\t\t\n\t\tBatcher<double> batcher(trainFeat, trainLab, batchSize);\n\t\tnn.batch(batchSize);\n\t\tcritic.batch(batchSize);\n\t\t\n\t\tcout << \"Training...\" << endl;\n\t\tstart = clock::now();\n\t\t\n\t\tfor(size_t i = 0; i < epochs; ++i)\n\t\t{\n\t\t\tfor(size_t j = 0; j < batchesPerEpoch; ++j)\n\t\t\t{\n\t\t\t\toptimizer.optimize(batcher.features(), batcher.labels());\n\t\t\t\tbatcher.next(true);\n\t\t\t}\n\t\t\t\n\t\t\tProgress::display(i, epochs);\n\t\t\t\n\t\t\tnn.batch(testFeat.rows());\n\t\t\tcritic.batch(testFeat.rows());\n\t\t\tcout << \"\\t\" << critic.forward(nn.forward(testFeat), testLab).sum() << flush;\n\t\t\tnn.batch(batchSize);\n\t\t\tcritic.batch(batchSize);\n\t\t}\n\t\tProgress::display(epochs, epochs, '\\n');\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t}\n\t\n\treturn 0;\n}\n<commit_msg>Missed a crucial detail; ND is working now.<commit_after>#include <iostream>\n#include <vector>\n#include <chrono>\n#include \"nnlib.h\"\nusing namespace std;\nusing namespace nnlib;\n\nint main()\n{\n\tcout << \"========== Sanity Test ==========\" << endl;\n\t\n\tsize_t inps = 3;\n\tsize_t outs = 2;\n\tsize_t batch = 5;\n\t\n\tLinear<double> layer1(inps, outs, batch);\n\t\n\tVector<double> &bias = *(Vector<double> *)layer1.parameters()[0];\n\tMatrix<double> &weights = *(Matrix<double> *)layer1.parameters()[1];\n\t\n\tVector<double> parameters(layer1.parameters());\n\tfor(double &val : parameters)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> inputs(batch, inps);\n\tfor(double &val : inputs)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> blame(batch, outs);\n\tfor(double &val : blame)\n\t\tval = Random<double>::normal(0, 1, 1);\n\t\n\tMatrix<double> targets(batch, outs);\n\ttargets.fill(-0.25);\n\t\n\tMatrix<double> outputs(batch, outs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t{\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t{\n\t\t\toutputs(i, j) = bias(j);\n\t\t\tfor(size_t k = 0; k < inps; ++k)\n\t\t\t\toutputs(i, j) += inputs(i, k) * weights(j, k);\n\t\t}\n\t}\n\t\n\tlayer1.forward(inputs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t\tNNAssert(fabs(outputs(i, j) - layer1.output()(i, j)) < 1e-6, \"Linear::forward failed!\");\n\tcout << \"Linear::forward passed!\" << endl;\n\t\n\tMatrix<double> inputBlame(batch, inps, 0);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < inps; ++j)\n\t\t\tfor(size_t k = 0; k < outs; ++k)\n\t\t\t\tinputBlame(i, j) += blame(i, k) * weights(k, j);\n\t\n\tlayer1.backward(inputs, blame);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < inps; ++j)\n\t\t\tNNAssert(fabs(inputBlame(i, j) - layer1.inputBlame()(i, j)) < 1e-6, \"Linear::backword failed!\");\n\tcout << \"Linear::backward passed!\" << endl;\n\t\n\tTanH<double> layer2(outs, batch);\n\tSequential<double> nn;\n\tnn.add(new Linear<double>(layer1));\n\tnn.add(new TanH<double>(layer2));\n\t\n\tSSE<double> critic(outs, batch);\n\tSGD<Module<double>, SSE<double>> optimizer(nn, critic);\n\t\n\tnn.forward(inputs);\n\tfor(size_t i = 0; i < batch; ++i)\n\t\tfor(size_t j = 0; j < outs; ++j)\n\t\t\tNNAssert(fabs(nn.output()(i, j) - tanh(layer1.output()(i, j))) < 1e-6, \"Sequential::forward failed!\");\n\tcout << \"Sequential::forward passed!\" << endl;\n\t\n\tfor(size_t i = 0; i < 10000; ++i)\n\t{\n\t\tMatrix<double>::shuffleRows(inputs, targets);\n\t\toptimizer.optimize(inputs, targets);\n\t}\n\tNNAssert(critic.forward(nn.forward(inputs), targets).sum() < 1.25, \"SGD::optimize failed!\");\n\tcout << \"SGD::optimize passed!\" << endl;\n\t\n\tcout << \"Sanity test passed!\" << endl << endl;\n\t\n\tusing clock = chrono::high_resolution_clock;\n\tchrono::time_point<clock> start;\n\t\n\t\/\/ MARK: Concat Test\n\t\n\t{\n\t\tcout << \"========== Simple Concat ==========\" << endl;\n\t\t\n\t\tSequential<> *one = new Sequential<>(new Linear<>(1, 1));\n\t\tSequential<> *two = new Sequential<>(new Linear<>(1, 1), new Sin<>());\n\t\tConcat<> *concat = new Concat<>(one, two);\n\t\tSequential<> nn(concat);\n\t\t\n\t\tdynamic_cast<Linear<> *>(one->component(0))->bias().fill(0);\n\t\tdynamic_cast<Linear<> *>(one->component(0))->weights().fill(1);\n\t\t\n\t\tdynamic_cast<Linear<> *>(two->component(0))->bias().fill(0);\n\t\tdynamic_cast<Linear<> *>(two->component(0))->weights().fill(1);\n\t\t\n\t\tMatrix<> input(1, 1);\n\t\tinput(0, 0) = 1;\n\t\t\n\t\tMatrix<> blame(1, 2);\n\t\tblame(0, 0) = 1;\n\t\tblame(0, 1) = 0.5;\n\t\t\n\t\tnn.forward(input);\n\t\tnn.backward(input, blame);\n\t\t\n\t\tNNHardAssert(nn.output()(0, 0) == 1, \"Linear forward in concat failed!\");\n\t\tNNHardAssert(nn.output()(0, 1) == sin(1), \"Sinusoid forward in concat failed!\");\n\t\tNNHardAssert(nn.inputBlame()(0, 0) == 1 + 0.5 * cos(1), \"Backward in concat failed!\");\n\t\t\n\t\tcout << \"Simple concat test passed!\" << endl << endl;\n\t}\n\t\n\t{\n\t\tcout << \"========== Concat Test ==========\" << endl;\n\t\t\n\t\tcout << \"Loading data...\" << flush;\n\t\tMatrix<> train = Loader<>::loadArff(\"..\/datasets\/mackey-glass\/train.arff\");\n\t\tMatrix<> test = Loader<>::loadArff(\"..\/datasets\/mackey-glass\/test.arff\");\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Preprocessing data...\" << flush;\n\t\tMatrix<> trainFeat\t= train.block(0, 0, train.rows(), 1);\n\t\tMatrix<> trainLab\t= train.block(0, 1, train.rows(), 1);\n\t\tMatrix<> testFeat\t= test.block(0, 0, test.rows(), 1);\n\t\tMatrix<> testLab\t= test.block(0, 1, test.rows(), 1);\n\t\t\n\t\tdouble biggest = trainLab(0, 0), smallest = trainLab(0, 0);\n\t\tfor(auto d : trainLab)\n\t\t\tbiggest = std::max(biggest, d), smallest = std::min(smallest, d);\n\t\tfor(auto &d : trainLab)\n\t\t\td = 10 * (d - smallest) \/ (biggest - smallest);\n\t\tfor(auto &d : testLab)\n\t\t\td = 10 * (d - smallest) \/ (biggest - smallest);\n\t\t\n\t\tSaver<>::saveArff(trainLab, \"newtrain.arff\");\n\t\t\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Creating network...\" << flush;\n\t\tLinear<> *sine = new Linear<>(1, train.rows()), *line = new Linear<>(1, 10), *out = new Linear<>(1);\n\t\tConcat<> *concat = new Concat<>(\n\t\t\tnew Sequential<>(sine, new Sin<>()),\n\t\t\tnew Sequential<>(line)\n\t\t);\n\t\tSequential<> nn(concat, out);\n\t\tSSE<double> critic(1);\n\t\tauto optimizer = MakeOptimizer<SGD>(nn, critic);\n\t\toptimizer.learningRate(0.001);\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Initializing weights...\" << flush;\n\t\t{\n\t\t\tauto &bias = sine->bias();\n\t\t\tauto &weights = sine->weights();\n\t\t\tfor(size_t i = 0; i < bias.size() \/ 2; ++i)\n\t\t\t{\n\t\t\t\tfor(size_t j = 0; j < weights.cols(); ++j)\n\t\t\t\t{\n\t\t\t\t\tweights(2 * i, j)\t\t= 2.0 * M_PI * (i + 1);\n\t\t\t\t\tweights(2 * i + 1, j)\t= 2.0 * M_PI * (i + 1);\n\t\t\t\t}\n\t\t\t\tbias(2 * i)\t\t= 0.5 * M_PI;\n\t\t\t\tbias(2 * i + 1)\t= M_PI;\n\t\t\t}\n\t\t}\n\t\tline->bias().fill(0);\n\t\tline->weights().fill(1);\n\t\tout->bias().scale(0.001);\n\t\tout->weights().scale(0.001);\n\t\tcout << \" Done.\" << endl;\n\t\t\n\t\tcout << \"Initial SSE: \" << flush;\n\t\tnn.batch(testFeat.rows());\n\t\tcritic.batch(testFeat.rows());\n\t\tcout << critic.forward(nn.forward(testFeat), testLab).sum() << endl;\n\t\t\n\t\tsize_t epochs = 1000;\n\t\tsize_t batchesPerEpoch = train.rows();\n\t\tsize_t batchSize = 1;\n\t\t\n\t\tdouble l1 = 0.01 * optimizer.learningRate();\n\t\t\n\t\tBatcher<double> batcher(trainFeat, trainLab, batchSize);\n\t\tnn.batch(batchSize);\n\t\tcritic.batch(batchSize);\n\t\t\n\t\tcout << \"Training...\" << endl;\n\t\t\n\t\tfor(size_t i = 0; i < epochs; ++i)\n\t\t{\n\t\t\tfor(size_t j = 0; j < batchesPerEpoch; ++j)\n\t\t\t{\n\t\t\t\tfor(auto &w : out->bias())\n\t\t\t\t\tw = w > 0 ? std::max(0.0, w - l1) : std::min(0.0, w + l1);\n\t\t\t\tfor(auto &w : out->weights())\n\t\t\t\t\tw = w > 0 ? std::max(0.0, w - l1) : std::min(0.0, w + l1);\n\t\t\t\toptimizer.optimize(batcher.features(), batcher.labels());\n\t\t\t\tbatcher.next(true);\n\t\t\t}\n\t\t\t\n\t\t\tProgress::display(i, epochs);\n\t\t\t\n\t\t\tnn.batch(testFeat.rows());\n\t\t\tcritic.batch(testFeat.rows());\n\t\t\tcout << \"\\t\" << critic.forward(nn.forward(testFeat), testLab).sum() << flush;\n\t\t\tnn.batch(batchSize);\n\t\t\tcritic.batch(batchSize);\n\t\t}\n\t\tProgress::display(epochs, epochs, '\\n');\n\t\t\n\t\tnn.batch(testFeat.rows());\n\t\tnn.forward(testFeat);\n\t\tfor(auto &d : nn.output())\n\t\t\td = d * (biggest - smallest) \/ 10.0 + smallest;\n\t\tSaver<>::saveArff(nn.output(), \"prediction.arff\");\n\t\t\n\t\tcout << endl;\n\t}\n\t\n\t\/\/ MARK: MNIST Test\n\t\n\t{\n\t\tcout << \"========== MNIST Test ==========\" << endl;\n\t\t\n\t\tcout << \"Loading data...\" << flush;\n\t\tstart = clock::now();\n\t\tMatrix<double> train = Loader<double>::loadArff(\"..\/datasets\/mnist\/train.arff\");\n\t\tMatrix<double> test = Loader<double>::loadArff(\"..\/datasets\/mnist\/test.arff\");\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Preprocessing data...\" << flush;\n\t\tstart = clock::now();\n\t\t\n\t\tMatrix<double> trainLab(train.rows(), 10, 0.0);\n\t\tMatrix<double> trainFeat = train.block(0, 0, train.rows(), train.cols() - 1);\n\t\ttrainFeat.scale(1.0 \/ 255.0);\n\t\t\n\t\tMatrix<double> testLab(test.rows(), 10, 0.0);\n\t\tMatrix<double> testFeat = test.block(0, 0, test.rows(), test.cols() - 1);\n\t\ttestFeat.scale(1.0 \/ 255.0);\n\t\t\n\t\tfor(size_t i = 0; i < train.rows(); ++i)\n\t\t\ttrainLab(i, train(i).back()) = 1.0;\n\t\t\n\t\tfor(size_t i = 0; i < test.rows(); ++i)\n\t\t\ttestLab(i, test(i).back()) = 1.0;\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Creating network...\" << flush;\n\t\tstart = clock::now();\n\t\t\n\t\tSequential<> nn;\n\t\tnn.add(\n\t\t\tnew Linear<>(trainFeat.cols(), 300), new TanH<>(),\n\t\t\tnew Linear<>(100), new TanH<>(),\n\t\t\tnew Linear<>(10), new TanH<>()\n\t\t);\n\t\t\n\t\tSSE<double> critic(10);\n\t\tauto optimizer = MakeOptimizer<RMSProp>(nn, critic);\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t\t\n\t\tcout << \"Initial SSE: \" << flush;\n\t\tnn.batch(testFeat.rows());\n\t\tcritic.batch(testFeat.rows());\n\t\tcout << critic.forward(nn.forward(testFeat), testLab).sum() << endl;\n\t\t\n\t\tsize_t epochs = 100;\n\t\tsize_t batchesPerEpoch = 100;\n\t\tsize_t batchSize = 10;\n\t\t\n\t\tBatcher<double> batcher(trainFeat, trainLab, batchSize);\n\t\tnn.batch(batchSize);\n\t\tcritic.batch(batchSize);\n\t\t\n\t\tcout << \"Training...\" << endl;\n\t\tstart = clock::now();\n\t\t\n\t\tfor(size_t i = 0; i < epochs; ++i)\n\t\t{\n\t\t\tfor(size_t j = 0; j < batchesPerEpoch; ++j)\n\t\t\t{\n\t\t\t\toptimizer.optimize(batcher.features(), batcher.labels());\n\t\t\t\tbatcher.next(true);\n\t\t\t}\n\t\t\t\n\t\t\tProgress::display(i, epochs);\n\t\t\t\n\t\t\tnn.batch(testFeat.rows());\n\t\t\tcritic.batch(testFeat.rows());\n\t\t\tcout << \"\\t\" << critic.forward(nn.forward(testFeat), testLab).sum() << flush;\n\t\t\tnn.batch(batchSize);\n\t\t\tcritic.batch(batchSize);\n\t\t}\n\t\tProgress::display(epochs, epochs, '\\n');\n\t\t\n\t\tcout << \" Done in \" << chrono::duration<double>(clock::now() - start).count() << endl;\n\t}\n\t\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing namespace std;\n\nint main(){\n return 0;\n}\n<commit_msg>Added Dec to Binary Algorithm<commit_after>#include <iostream>\n#include <stack>\nusing namespace std;\n\nvoid convertBinary(int val){\n\tstack<int> bstring;\n\tcout << val << \" in binary is: \";\n\tint count = 0;\n\twhile(val > 0){\n\t\tbstring.push(val % 2);\n\t\tval \/= 2; \n\t\t++count;\n\t\tif(count == 4)\n\t\t\tcount = 0;\n\t}\n\twhile(count != 0 && count < 4){\n\t\tbstring.push(0);\n\t\t++count;\n\t}\n\tcount = 0;\n\twhile(!bstring.empty()){\n\t\tcout << bstring.top();\n\t\tbstring.pop();\n\t\t++count;\n\t\tif(count == 4){\n\t\t\tcout << ' ';\n\t\t\tcount = 0;\n\t\t}\n\t}\n\tcout << endl;\n}\n\nint main(){\n\tint input, start;\n cout << \"Enter a Decimal number to be converted to Binary: \";\n cin >> input;\n\tconvertBinary(input);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <string.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/mman.h>\n\nusing namespace std;\n\nvoid prompt ()\n{\n\tuser = getlogin(); \/\/ get user name\n gethostname(host, 100); \/\/ get host name\n cout << *user << \"@\" << host << \"$\"; \/\/ prompt\n}\n\n\nint main(int argc, const char ** argv) {\n \n char host[100];\n char *user;\n\tprompt ();\n\t\n \n \n \n \n \n \n return 0;\n}\n<commit_msg>main.cpp completed<commit_after>\/\/ three flags\n\/\/ ls, ls -a, ls -l, ls -R, ls -lR, ls -l -R, ls -R -l,\n\/\/ ls filename filename cmd (cmd can be in any position)\n\/\/ begin with \"#\"\n\/\/ no input: \"\\n\" or \" \"\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <vector>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <errno.h>\n\nusing namespace std;\n\n#define MAXSIZE 1000\nchar command[MAXSIZE];\n\/\/ \"result\" stores the boolean value that whether the command execute\nbool result = false;\n\n\/\/ output prompt within each loop\nvoid prompt ()\n{\n\tchar hostname[MAXSIZE];\n char *username;\n\n\tbzero(hostname, MAXSIZE);\n\n\tif (NULL == (username = getlogin()))\n\t{\n\t\tperror(\"Error: get username failure!\");\n\t\texit(-1);\n\t}\n\tif (-1 == gethostname(hostname, MAXSIZE))\n\t{\n\t\tperror(\"gethostname\");\n\t\texit(-1);\n\t}\n\n cout << username << \"%\" << hostname << \">>\"; \/\/ prompt\n}\n\nvoid getInput (char str[])\n{\n\n\t\/\/ get input\n\tif (!fgets(str, MAXSIZE, stdin))\n\t{\n\t\treturn;\n\t}\n\n\tint len1 = strlen(str);\n\tif (str[len1 - 1] == '\\n')\n\t{\n\t\tstr[len1 - 1] = '\\0';\n\t}\n}\n\n\/\/ format the input with extra '\\t' and ' ' to standard form\nvoid format ()\n{\n\tstring temp;\n\n\tint len = strlen(command);\n\t\n\tfor (int i = 0; i < len; ++i)\n\t{\n\t\tif (command[i] == '#')\n\t\t{\n\t\t\tcommand[i] = '\\0';\n\t\t\tbreak;\n\t\t}\n\t}\n\n\n\t\/\/ replace tabs by spaces\n\tfor (int i = 0; i < len; ++i)\n\t{\n\t\tif (command[i] == '\\t')\n\t\t{\n\t\t\tcommand[i] = ' ';\n\t\t}\n\t}\t\n\t\n\t\/\/ add ' ' between characters and ';'. i.e. convert \"a;b\" to \"a, b\"\n\tfor (int i = 0; i < len; ++i)\n\t{\n\t\tif (command[i] == ';')\n\t\t{\n\t\t\t\/\/ add two spaces around ';'\n\t\t\tlen += 2;\n\t\t\tfor (int j = len - 1; j > i + 2; --j)\n\t\t\t{\n\t\t\t\tcommand[j] = command[j - 2];\n\t\t\t}\n\t\t\tcommand[i + 2] = ' ';\n\t\t\tcommand[i + 1] = command[i];\n\t\t\tcommand[i] = ' ';\n\t\t\ti += 2;\n\t\t}\n\t}\n\t\n\t\/\/ add ' ' between characters and '&&'\n\tfor (int i = 0; i < len - 1; ++i)\n\t{\n\t\tif (command[i] == '&' && command[i+1] == '&')\n\t\t{\n\t\t\tlen += 2;;\n\t\t\tfor (int j = len - 1; j > i + 3; --j)\n\t\t\t{\n\t\t\t\tcommand[j] = command[j - 2];\n\t\t\t}\n\t\t\tcommand[i + 3] = ' ';\n\t\t\tcommand[i + 2] = command[i + 1];\n\t\t\tcommand[i + 1] = command[i];\n\t\t\tcommand[i] = ' ';\n\t\t\ti += 3;\n\t\t}\n\t}\n\n\t\/\/ add ' ' between characters and '||'\n\tfor (int i = 0; i < len; ++i)\n\t{\n\t\tif (command[i] == '|' && command[i+1] == '|')\n\t\t{\n\t\t\tlen += 2;;\n\t\t\tfor (int j = len - 1; j > i + 3; --j)\n\t\t\t{\n\t\t\t\tcommand[j] = command[j - 2];\n\t\t\t}\n\t\t\tcommand[i + 3] = ' ';\n\t\t\tcommand[i + 2] = command[i + 1];\n\t\t\tcommand[i + 1] = command[i];\n\t\t\tcommand[i] = ' ';\n\t\t\ti += 3;\n\t\t}\n\t}\n\n\t\/\/remove all extra \" \". i.e. reduce two continuous ' ' to one\n\tfor (int i = 0; i < len; ++i)\n\t{\n\t\tif (command[i] == ' ')\n\t\t{\n\t\t\tif (command[i + 1] == ' ')\n\t\t\t{\n\t\t\t\tfor (int j = i; j < len; ++j)\n\t\t\t\t{\n\t\t\t\t\tcommand[j] = command[j + 1];\n\t\t\t\t}\n\t\t\t\t-- i;\n\t\t\t\t-- len;\n\t\t\t}\n\t\t}\n\t}\n\t\/\/ remove all the spaces at the begining.\n\twhile (command[0] == ' ')\n\t{\n\t\tfor (int i = 0; i < len; ++i)\n\t\t{\n\t\t\tcommand[i] = command[i + 1];\n\t\t}\n\t}\n}\n\n\/\/ execute one command and record the execution result\nvoid execute (char * cmd[])\n{\n\tpid_t pid;\n\tint status;\n\tif ((pid = fork()) < 0)\n\t{\n\t\tperror (\"ERROR: forking child process failed\\n\");\n\t\tresult = false;\n\t\texit(1);\n\t}\n\t\/\/ child process\n\telse if (pid == 0)\n\t{\n\t\tif (execvp(*cmd, cmd) < 0)\n\t\t{\n\t\t\tperror (\"ERROR: exec failed\\n\");\n\t\t\tresult = false;\n\t\t\texit(1);\n\t\t}\n\t}\n\telse \/\/ parent process\n\t{\n\t\t\/\/ result = true;\n\t\tif (-1 == waitpid(pid, &status, 0)) \/\/ wait for the child process to finish\n\t\t{\n\t\t\tperror(\"ERROR: wait error\\n\");\n\t\t\tresult = false;\n\t\t\texit (1);\n\t\t}\n\t\tif (WEXITSTATUS(status) == 0)\t\n\t\t{\n\t\t\tresult = true;\n\t\t}\n\t\telse if (WEXITSTATUS(status) == 1)\n\t\t{\n\t\t\tresult = false;\n\t\t}\n\t}\n}\n\n\/\/ parse the char array into string vector\n\/\/ state the logic of \"&&\", \"||\" and \";\"\nvoid parse(char * cmd[])\n{\n\tvector<string> str;\n\tchar * token;\n\tchar * saveptr; \/\/ value return parameter used by strtok_r() to record progress\n\tstring temp;\n\tchar * get[MAXSIZE];\n\tchar * current;\n\t\/\/ initialize the flag as false,\n\t\/\/ \"false\" means we should not jump the next command\n\t\/\/ \"true\" means we should ignore the next command\n\tbool jumpflag = false;\n\t\n\ttoken = strtok_r(command, \" \", &saveptr);\n\tint m = 0;\n\tget[m] = token;\n\ttemp = token;\n\t\n\twhile(token != NULL)\n\t{\n\t\t++ m;\n\t\ttemp = token; \/\/ convert token to string type\n\t\tstr.push_back(temp);\n\t\ttoken = strtok_r(NULL, \" \", &saveptr);\n\t\tget[m] = token;\n\t}\n\t\t\n\t\/\/ distinguish the connectors and commands\n\tfor (int i = 0; i < str.size(); ++i)\n\t{\n\t\t\/\/ connectors\n\t\tif (str.at(i) == \";\")\n\t\t{\n\t\t\tjumpflag = false;\n\t\t}\n\t\telse if (str.at(i) == \"&&\")\n\t\t{\n\t\t\tif (result)\n\t\t\t{\n\t\t\t\tjumpflag = false;\n\t\t\t}\n\t\t\telse \n\t\t\t{\n\t\t\t\tjumpflag = true;\n\t\t\t}\n\t\t}\n\t\telse if (str.at(i) == \"||\")\n\t\t{\n\t\t\tif (result)\n\t\t\t{\n\t\t\t\tjumpflag = true;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tjumpflag = false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcmd[0] = get[i];\n\t\t\tint j;\n\t\t\tfor (i = i + 1, j = 1; i < str.size(); ++i)\n\t\t\t{\n\t\t\t\tif (str.at(i) == \"&&\" || str.at(i) == \"||\" || str.at(i) == \";\")\n\t\t\t\t{\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tcmd[j] = get[i];\n\t\t\t\t\t++ j;\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!jumpflag)\n\t\t\t{\n\t\t\t\texecute(cmd);\n\t\t\t}\n\t\t\t-- i;\n\t\t\tfor (int i = 0; i < j; ++i)\n\t\t\t{\n\t\t\t\tcmd[i] = NULL;\n\t\t\t}\n\t\t}\n\t}\n\treturn;\n}\n\n\nint main(int argc, const char ** argv)\n{\n\tchar *cmd[MAXSIZE];\n\tchar str[MAXSIZE];\n\twhile (1)\n\t{\n\t\tprompt();\n\t\tgetInput(command);\n\t\tformat();\n\t\t\/\/ solve the segmentation fault\n\t\t\/\/ when there is no input or the input contains only spaces\n\t\t\/\/ the current while loop ends\n\t\t\/\/ and continues the next loop\n\t\tif (command[0] == '\\0')\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\t\/\/ when the user types \"exit\", the program exit\n\t\tif (strncmp(command, \"exit\", 4) == 0)\n\t\t{\n\t\t\tif (command[4] == '\\0' || command[4] == ' ')\n\t\t\t{\n\t\t\t\tcout << \"Process ended.\" << endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\n\t\tparse(cmd);\n\t} \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ main.cpp\n\/\/ thermaleraser\n\/\/\n\/\/ Created by Mark Larus on 9\/8\/12.\n\/\/ Copyright (c) 2012 Kenyon College. All rights reserved.\n\/\/ \n\n#include <iostream>\n#include <gsl\/gsl_randist.h>\n#include <gsl\/gsl_sf.h>\n#include <time.h>\n#include <semaphore.h>\n#include <algorithm>\n#include <math.h>\n#include <sqlite3.h>\n#include <assert.h>\n#include <set>\n#include <boost\/program_options.hpp>\n#include <boost\/timer\/timer.hpp>\n\n\n#include \"States.h\"\n#include \"System.h\"\n#include \"Utilities.h\"\n\n#define print(x) std::cout<<#x <<\": \" <<x<<std::endl;\n\nnamespace opt = boost::program_options;\n\nenum OutputType {\n CommaSeparated,\n PrettyPrint,\n Mathematica,\n NoOutput\n};\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type);\n\nint main(int argc, char * argv[]) {\n \/*! Initialize options list.\n *\/\n\n bool verbose = false;\n const int default_iterations = 1<<16;\n \n opt::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"iterations,n\",opt::value<int>(), \"Number of iterations\")\n (\"help\",\"Show help message\")\n (\"verbose,v\", \"Show extensive debugging info\") \n ;\n \n opt::variables_map vmap;\n opt::store(opt::parse_command_line(argc,argv,desc),vmap);\n opt::notify(vmap);\n \n if (vmap.count(\"help\")) {\n std::cout << desc << \"\\n\";\n return 1;\n }\n\n verbose = vmap.count(\"verbose\");\n \n int iterations = vmap.count(\"iterations\") ? vmap[\"iterations\"].as<int>() : default_iterations;\n \n if (verbose) {\n print(iterations);\n }\n\n \/*! This call sets up our state machine for the wheel. Each state (i.e. \"A0\", \"C1\") is\n represented by an object with pointers to the next states and the bit-flip states. *\/\n setupStates();\n \n Constants constants;\n \n \/*! The delta used here is NOT, at this point, the delta used in the paper. This is the \n ratio of ones to zeroes in the bit stream. Probably worth changing the name, but\n calculating this at runtime is just an invitation for bugs. *\/\n constants.delta = .5;\n constants.epsilon = .7;\n constants.tau = 1;\n int dimension = 50;\n for (int k=dimension*dimension; k>=0; k--) {\n constants.epsilon = (k % dimension)\/(double)(dimension);\n constants.delta = .5 + .5*(k \/ dimension)\/(double)(dimension);\n simulate_and_print(constants, iterations, CommaSeparated);\n }\n\n}\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type) {\n boost::timer::auto_cpu_timer t;\n \n \/*! Use this to change the length of the tape. *\/\n const int BIT_STREAM_LENGTH = 8;\n \n int first_pass_iterations = iterations;\n \n System *systems = new System[first_pass_iterations]();\n \n int *histogram = new int[1<<BIT_STREAM_LENGTH];\n std::fill_n(histogram, 1<<BIT_STREAM_LENGTH, 0);\n\n #pragma omp parallel default(shared)\n {\n \/\/TODO: Move this into a semaphore in the utility function\n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n int *localHistogram = new int[1<<BIT_STREAM_LENGTH];\n std::fill_n(histogram, 1<<BIT_STREAM_LENGTH, 0);\n \n #pragma omp for\n for (int k=0; k<first_pass_iterations; ++k) {\n System *currentSystem = systems+k;\n \n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystem(currentSystem, localRNG);\n ++localHistogram[currentSystem->endingBitString];\n \n }\n \n\n delete [] localHistogram;\n \n gsl_rng_free(localRNG);\n }\/\/End parallel\n \n for(int k=0; k<first_pass_iterations; k++) {\n histogram[systems[k].endingBitString]++;\n }\n \n \n delete [] systems;\n \n \/\/time_t stop_time = time(NULL);\n \n \/\/std::clog<<\"Time elapsed: \"<<(stop_time-start_time)<<std::endl;\n \n long double *p = new long double[1<<BIT_STREAM_LENGTH];\n long double *p_prime = new long double[1<<BIT_STREAM_LENGTH];\n\n for(int k=0; k<1<<BIT_STREAM_LENGTH; k++) {\n int setBits = bitCount(k,BIT_STREAM_LENGTH);\n p[k] = gsl_ran_binomial_pdf(setBits, constants.delta, BIT_STREAM_LENGTH)\/gsl_sf_choose(BIT_STREAM_LENGTH,setBits);\n p_prime[k]=static_cast<long double>(histogram[k])\/(first_pass_iterations);\n }\n \n delete [] histogram;\n \n long double sum = 0;\n \n const long double beta = log((1+constants.epsilon)\/(1-constants.epsilon));\n long double max_surprise = 0;\n long double min_surprise = LONG_MAX;\n \n #pragma omp parallel\n {\n \n \/\/Make sure we don't accidentally share a seed.\n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n #pragma omp for reduction(+ : sum)\n for(int k=0; k<iterations; k++) {\n System *currentSystem = new System();\n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystem(currentSystem, localRNG);\n \n long double surprise = exp(beta*currentSystem->mass)*p_prime[currentSystem->endingBitString]\/p[currentSystem->startingBitString];\n max_surprise = surprise > max_surprise ? surprise : max_surprise;\n min_surprise = surprise && surprise < min_surprise ? surprise : min_surprise;\n sum = sum + surprise;\n delete currentSystem;\n }\n gsl_rng_free(localRNG);\n }\n \n delete [] p_prime;\n delete [] p;\n \n if(type==CommaSeparated) {\n static int once = 0;\n if (!once) {\n std::cout<<\"delta,epsilon,avg,max_surprise\\n\";\n once=1;\n }\n std::cout<< constants.delta << \",\" << constants.epsilon << \",\" << sum\/iterations << \",\" << max_surprise << std::endl;\n }\n\n \n if(type==PrettyPrint) {\n print(beta);\n print(constants.delta);\n print(constants.epsilon);\n print(sum\/iterations);\n print(max_surprise);\n print(sum);\n std::cout<<std::endl;\n }\n \n if (type==Mathematica) {\n assert(0);\n }\n}\n<commit_msg>Stop wasting cycles during the first pass.<commit_after>\/\/\n\/\/ main.cpp\n\/\/ thermaleraser\n\/\/\n\/\/ Created by Mark Larus on 9\/8\/12.\n\/\/ Copyright (c) 2012 Kenyon College. All rights reserved.\n\/\/ \n\n#include <iostream>\n#include <gsl\/gsl_randist.h>\n#include <gsl\/gsl_sf.h>\n#include <time.h>\n#include <semaphore.h>\n#include <algorithm>\n#include <math.h>\n#include <sqlite3.h>\n#include <assert.h>\n#include <set>\n#include <boost\/program_options.hpp>\n#include <boost\/timer\/timer.hpp>\n\n\n#include \"States.h\"\n#include \"System.h\"\n#include \"Utilities.h\"\n\n#define print(x) std::cout<<#x <<\": \" <<x<<std::endl;\n\nnamespace opt = boost::program_options;\n\nenum OutputType {\n CommaSeparated,\n PrettyPrint,\n Mathematica,\n NoOutput\n};\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type);\n\nint main(int argc, char * argv[]) {\n \/*! Initialize options list.\n *\/\n\n bool verbose = false;\n const int default_iterations = 1<<16;\n \n opt::options_description desc(\"Allowed options\");\n desc.add_options()\n (\"iterations,n\",opt::value<int>(), \"Number of iterations\")\n (\"help\",\"Show help message\")\n (\"verbose,v\", \"Show extensive debugging info\") \n ;\n \n opt::variables_map vmap;\n opt::store(opt::parse_command_line(argc,argv,desc),vmap);\n opt::notify(vmap);\n \n if (vmap.count(\"help\")) {\n std::cout << desc << \"\\n\";\n return 1;\n }\n\n verbose = vmap.count(\"verbose\");\n \n int iterations = vmap.count(\"iterations\") ? vmap[\"iterations\"].as<int>() : default_iterations;\n \n if (verbose) {\n print(iterations);\n }\n\n \/*! This call sets up our state machine for the wheel. Each state (i.e. \"A0\", \"C1\") is\n represented by an object with pointers to the next states and the bit-flip states. *\/\n setupStates();\n \n Constants constants;\n \n \/*! The delta used here is NOT, at this point, the delta used in the paper. This is the \n ratio of ones to zeroes in the bit stream. Probably worth changing the name, but\n calculating this at runtime is just an invitation for bugs. *\/\n constants.delta = .5;\n constants.epsilon = .7;\n constants.tau = 1;\n int dimension = 50;\n for (int k=dimension*dimension; k>=0; k--) {\n constants.epsilon = (k % dimension)\/(double)(dimension);\n constants.delta = .5 + .5*(k \/ dimension)\/(double)(dimension);\n simulate_and_print(constants, iterations, CommaSeparated);\n }\n\n}\n\nvoid simulate_and_print(Constants constants, int iterations, OutputType type) {\n boost::timer::auto_cpu_timer t;\n \n \/*! Use this to change the length of the tape. *\/\n const int BIT_STREAM_LENGTH = 8;\n \n int first_pass_iterations = iterations;\n \n System *systems = new System[first_pass_iterations]();\n \n int *histogram = new int[1<<BIT_STREAM_LENGTH];\n std::fill_n(histogram, 1<<BIT_STREAM_LENGTH, 0);\n\n #pragma omp parallel default(shared)\n {\n \/\/TODO: Move this into a semaphore in the utility function\n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n #pragma omp for\n for (int k=0; k<first_pass_iterations; ++k) {\n System *currentSystem = systems+k;\n \n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystem(currentSystem, localRNG);\n \n }\n \n gsl_rng_free(localRNG);\n }\/\/End parallel\n \n for(int k=0; k<first_pass_iterations; k++) {\n histogram[systems[k].endingBitString]++;\n }\n \n \n delete [] systems;\n \n \/\/time_t stop_time = time(NULL);\n \n \/\/std::clog<<\"Time elapsed: \"<<(stop_time-start_time)<<std::endl;\n \n long double *p = new long double[1<<BIT_STREAM_LENGTH];\n long double *p_prime = new long double[1<<BIT_STREAM_LENGTH];\n\n for(int k=0; k<1<<BIT_STREAM_LENGTH; k++) {\n int setBits = bitCount(k,BIT_STREAM_LENGTH);\n p[k] = gsl_ran_binomial_pdf(setBits, constants.delta, BIT_STREAM_LENGTH)\/gsl_sf_choose(BIT_STREAM_LENGTH,setBits);\n p_prime[k]=static_cast<long double>(histogram[k])\/(first_pass_iterations);\n }\n \n delete [] histogram;\n \n long double sum = 0;\n \n const long double beta = log((1+constants.epsilon)\/(1-constants.epsilon));\n long double max_surprise = 0;\n long double min_surprise = LONG_MAX;\n \n #pragma omp parallel\n {\n \n \/\/Make sure we don't accidentally share a seed.\n gsl_rng *localRNG = GSLRandomNumberGenerator();\n \n #pragma omp for reduction(+ : sum)\n for(int k=0; k<iterations; k++) {\n System *currentSystem = new System();\n currentSystem->constants = constants;\n currentSystem->nbits = BIT_STREAM_LENGTH;\n \n evolveSystem(currentSystem, localRNG);\n \n long double surprise = exp(beta*currentSystem->mass)*p_prime[currentSystem->endingBitString]\/p[currentSystem->startingBitString];\n max_surprise = surprise > max_surprise ? surprise : max_surprise;\n min_surprise = surprise && surprise < min_surprise ? surprise : min_surprise;\n sum = sum + surprise;\n delete currentSystem;\n }\n gsl_rng_free(localRNG);\n }\n \n delete [] p_prime;\n delete [] p;\n \n if(type==CommaSeparated) {\n static int once = 0;\n if (!once) {\n std::cout<<\"delta,epsilon,avg,max_surprise\\n\";\n once=1;\n }\n std::cout<< constants.delta << \",\" << constants.epsilon << \",\" << sum\/iterations << \",\" << max_surprise << std::endl;\n }\n\n \n if(type==PrettyPrint) {\n print(beta);\n print(constants.delta);\n print(constants.epsilon);\n print(sum\/iterations);\n print(max_surprise);\n print(sum);\n std::cout<<std::endl;\n }\n \n if (type==Mathematica) {\n assert(0);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016 Alexandr Topilski. All rights reserved.\n\n#ifdef WIN32\n#else\n#include <netinet\/ip.h>\n#include <netinet\/if_ether.h>\n#include <netinet\/udp.h>\n#include <pcap.h>\n#endif\n\nextern \"C\" {\n#include <libavformat\/avformat.h>\n#include \"media\/media_stream_output.h\"\n#include \"media\/nal_units.h\"\n}\n\nconst char* outfilename = \"out.mp4\";\nconst char* infilename = \"full.pcap\";\nconst uint32_t height = 800;\nconst uint32_t width = 1024;\nconst uint32_t fps = 25;\nconst uint32_t bit_rate = 90000;\n\nstruct vgem_hdr {\n int8_t data[12];\n};\n\n#pragma pack(1)\nstruct rtp_hdr {\n#if __BYTE_ORDER == __BIG_ENDIAN\n \/\/For big endian\n unsigned char version:2; \/\/ Version, currently 2\n unsigned char padding:1; \/\/ Padding bit\n unsigned char extension:1; \/\/ Extension bit\n unsigned char cc:4; \/\/ CSRC count\n unsigned char marker:1; \/\/ Marker bit\n unsigned char payload:7; \/\/ Payload type\n#else\n \/\/For little endian\n unsigned char cc:4; \/\/ CSRC count\n unsigned char extension:1; \/\/ Extension bit\n unsigned char padding:1; \/\/ Padding bit\n unsigned char version:2; \/\/ Version, currently 2\n unsigned char payload:7; \/\/ Payload type\n unsigned char marker:1; \/\/ Marker bit\n#endif\n\n uint16_t sequence; \/\/ sequence number\n uint32_t timestamp; \/\/ timestamp\n uint32_t sources; \/\/ contributing sources\n};\n#pragma pack()\n\nstruct h264_hdr {\n uint8_t fu_iden;\n uint8_t fu_hdr;\n};\n\ntypedef struct {\n unsigned char type:5;\n unsigned char nri:2;\n unsigned char f:1;\n} nal_unit_header;\n\ntypedef struct {\n unsigned char type:5;\n unsigned char r:1;\n unsigned char e:1;\n unsigned char s:1;\n} fu_header;\n\nstruct fu_a_packet{\n nal_unit_header nh;\n fu_header fuh;\n unsigned char* payload;\n};\n\nconst uint8_t idr_header[] = { 0x00, 0x00, 0x01 };\n\nsize_t make_nal_frame(const uint8_t* data, size_t data_len, uint8_t** out_nal) {\n size_t size_nal = sizeof(idr_header) + data_len;\n uint8_t* nal_data = (uint8_t*)calloc(size_nal, sizeof(uint8_t));\n memcpy(nal_data, idr_header, sizeof(idr_header));\n memcpy(nal_data + sizeof(idr_header), data, data_len);\n *out_nal = nal_data;\n return size_nal;\n}\n\nint main(int argc, char *argv[]) {\n av_register_all();\n\n media_stream_params_t params;\n params.height_video = height;\n params.width_video = width;\n params.video_fps = fps;\n params.bit_stream = bit_rate;\n params.codec_id = AV_CODEC_ID_H264;\n\n media_stream_t* ostream = alloc_video_stream(outfilename, ¶ms, false);\n if(!ostream){\n return EXIT_FAILURE;\n }\n\n char errbuf[PCAP_ERRBUF_SIZE];\n pcap_t* pcap = pcap_open_offline_with_tstamp_precision(infilename, PCAP_TSTAMP_PRECISION_NANO, errbuf);\n if (!pcap) {\n fprintf(stderr, \"error reading pcap file: %s\\n\", errbuf);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct pcap_pkthdr header;\n const u_char *packet;\n while ((packet = pcap_next(pcap, &header)) != NULL) {\n packet += sizeof(vgem_hdr);\n bpf_u_int32 packet_len = header.caplen - sizeof(vgem_hdr);\n if (packet_len < sizeof(struct ether_header)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct ether_header* ethernet_header = (struct ether_header*)packet;\n uint16_t ht = ntohs(ethernet_header->ether_type);\n if (ht != ETHERTYPE_IP) {\n continue;\n }\n\n \/* Skip over the Ethernet header. (14)*\/\n packet += sizeof(struct ether_header);\n packet_len -= sizeof(struct ether_header);\n\n if (packet_len < sizeof(struct ip)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct iphdr* ip = (struct iphdr*) packet;\n if (ip->protocol != IPPROTO_UDP) {\n continue;\n }\n\n unsigned int IP_header_length = ip->ihl * 4; \/* ip_hl is in 4-byte words *\/\n if (packet_len < IP_header_length) { \/* didn't capture the full IP header including options *\/\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n packet += IP_header_length;\n packet_len -= IP_header_length;\n\n if (packet_len < sizeof(udphdr)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n packet += sizeof(udphdr);\n packet_len -= sizeof(udphdr);\n\n if (packet_len < sizeof(rtp_hdr)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n \/\/ rtp payload\n packet += sizeof(rtp_hdr);\n packet_len -= sizeof(rtp_hdr);\n if (packet_len <= 2) {\n continue;\n }\n\n size_t offset = 0;\n uint8_t nal = packet[0];\n int fragment_type = nal & 0x1F;\n uint8_t fu_header = packet[1];\n int nal_type = fu_header & 0x1F;\n int start_bit = fu_header >> 7;\n int end_bit = (fu_header & 0x40) >> 6;\n if (fragment_type == 28) {\n int fragment_size = packet_len - 2;\n if (fragment_size > 0) {\n \/\/If the start bit was set\n const uint8_t* payload = packet + 2;\n if (start_bit) {\n uint8_t fu_indicator = nal;\n uint8_t reconstructed_nal = fu_indicator & (0xE0);\n reconstructed_nal |= nal_type;\n\n size_t size_nal = sizeof(idr_header) + sizeof(nal) + fragment_size;\n uint8_t* nal_data = (uint8_t*)calloc(size_nal, sizeof(uint8_t));\n memcpy(nal_data, idr_header, sizeof(idr_header));\n nal_data[sizeof(idr_header)]= reconstructed_nal;\n memcpy(nal_data + sizeof(idr_header) + sizeof(nal), payload, fragment_size);\n media_stream_write_video_frame(ostream, nal_data, size_nal);\n free(nal_data);\n } else {\n media_stream_write_video_frame(ostream, payload, fragment_size);\n }\n } else {\n NOTREACHED();\n }\n } else if (fragment_type >= 1 && fragment_type <= 23) {\n if (fragment_type > 5) {\n if (fragment_type == NAL_UNIT_TYPE_SEI) { \/\/sei\n } else if (fragment_type == NAL_UNIT_TYPE_SPS) { \/\/ sps\n } else if (fragment_type == NAL_UNIT_TYPE_PPS) { \/\/ pps\n }\n }\n\n uint8_t* nal_data = NULL;\n size_t size_nal = make_nal_frame(packet, packet_len, &nal_data);\n media_stream_write_video_frame(ostream, nal_data, size_nal);\n free(nal_data);\n } else if(fragment_type == 24) {\n NOTREACHED();\n } else if(fragment_type == 29) {\n \/\/NOTREACHED();\n } else {\n NOTREACHED();\n }\n\n \/\/ http:\/\/stackoverflow.com\/questions\/3493742\/problem-to-decode-h264-video-over-rtp-with-ffmpeg-libavcodec\n \/\/ http:\/\/stackoverflow.com\/questions\/1957427\/detect-mpeg4-h264-i-frame-idr-in-rtp-stream\n }\n\n\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_SUCCESS;\n}\n<commit_msg>Start sps\/pps extracting<commit_after>\/\/ Copyright (c) 2016 Alexandr Topilski. All rights reserved.\n\n#ifdef WIN32\n#else\n#include <netinet\/ip.h>\n#include <netinet\/if_ether.h>\n#include <netinet\/udp.h>\n#include <netinet\/tcp.h>\n#include <pcap.h>\n#endif\n\nextern \"C\" {\n#include <libavformat\/avformat.h>\n#include <libavutil\/intreadwrite.h>\n#include \"media\/media_stream_output.h\"\n#include \"media\/nal_units.h\"\n}\n\nconst char* outfilename = \"out.mp4\";\nconst char* infilename = \"full.pcap\";\nconst uint32_t height = 800;\nconst uint32_t width = 1024;\nconst uint32_t fps = 25;\nconst uint32_t bit_rate = 90000;\n\nstruct vgem_hdr {\n int8_t data[12];\n};\n\n#pragma pack(1)\nstruct rtp_hdr {\n#if __BYTE_ORDER == __BIG_ENDIAN\n \/\/For big endian\n unsigned char version:2; \/\/ Version, currently 2\n unsigned char padding:1; \/\/ Padding bit\n unsigned char extension:1; \/\/ Extension bit\n unsigned char cc:4; \/\/ CSRC count\n unsigned char marker:1; \/\/ Marker bit\n unsigned char payload:7; \/\/ Payload type\n#else\n \/\/For little endian\n unsigned char cc:4; \/\/ CSRC count\n unsigned char extension:1; \/\/ Extension bit\n unsigned char padding:1; \/\/ Padding bit\n unsigned char version:2; \/\/ Version, currently 2\n unsigned char payload:7; \/\/ Payload type\n unsigned char marker:1; \/\/ Marker bit\n#endif\n\n uint16_t sequence; \/\/ sequence number\n uint32_t timestamp; \/\/ timestamp\n uint32_t sources; \/\/ contributing sources\n};\n#pragma pack()\n\nstruct h264_hdr {\n uint8_t fu_iden;\n uint8_t fu_hdr;\n};\n\ntypedef struct {\n unsigned char type:5;\n unsigned char nri:2;\n unsigned char f:1;\n} nal_unit_header;\n\ntypedef struct {\n unsigned char type:5;\n unsigned char r:1;\n unsigned char e:1;\n unsigned char s:1;\n} fu_header;\n\nstruct fu_a_packet{\n nal_unit_header nh;\n fu_header fuh;\n unsigned char* payload;\n};\n\nconst uint8_t nal_header[] = { 0x00, 0x00, 0x01 };\n\nsize_t make_nal_frame_header(const uint8_t* data, size_t data_len, const uint8_t* hdata, size_t hdata_len, uint8_t** out_nal) {\n size_t size_nal = sizeof(nal_header) + data_len;\n uint8_t* nal_data = (uint8_t*)calloc(size_nal, sizeof(uint8_t));\n memcpy(nal_data, hdata, hdata_len);\n memcpy(nal_data + hdata_len, data, data_len);\n *out_nal = nal_data;\n return size_nal;\n}\n\nint main(int argc, char *argv[]) {\n av_register_all();\n\n media_stream_params_t params;\n params.height_video = height;\n params.width_video = width;\n params.video_fps = fps;\n params.bit_stream = bit_rate;\n params.codec_id = AV_CODEC_ID_H264;\n\n media_stream_t* ostream = alloc_video_stream(outfilename, ¶ms, false);\n if(!ostream){\n return EXIT_FAILURE;\n }\n\n char errbuf[PCAP_ERRBUF_SIZE];\n pcap_t* pcap = pcap_open_offline_with_tstamp_precision(infilename, PCAP_TSTAMP_PRECISION_NANO, errbuf);\n if (!pcap) {\n fprintf(stderr, \"error reading pcap file: %s\\n\", errbuf);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct pcap_pkthdr header;\n const u_char *packet;\n while ((packet = pcap_next(pcap, &header)) != NULL) {\n packet += sizeof(vgem_hdr);\n bpf_u_int32 packet_len = header.caplen - sizeof(vgem_hdr);\n if (packet_len < sizeof(struct ether_header)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct ether_header* ethernet_header = (struct ether_header*)packet;\n uint16_t ht = ntohs(ethernet_header->ether_type);\n if (ht != ETHERTYPE_IP) {\n continue;\n }\n\n \/* Skip over the Ethernet header. (14)*\/\n packet += sizeof(struct ether_header);\n packet_len -= sizeof(struct ether_header);\n\n if (packet_len < sizeof(struct ip)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n struct iphdr* ip = (struct iphdr*) packet;\n if (!(ip->protocol != IPPROTO_UDP || ip->protocol != IPPROTO_TCP)) {\n continue;\n }\n\n unsigned int IP_header_length = ip->ihl * 4; \/* ip_hl is in 4-byte words *\/\n if (packet_len < IP_header_length) { \/* didn't capture the full IP header including options *\/\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n packet += IP_header_length;\n packet_len -= IP_header_length;\n\n if (ip->protocol == IPPROTO_UDP) {\n if (packet_len < sizeof(udphdr)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n packet += sizeof(udphdr);\n packet_len -= sizeof(udphdr);\n\n struct rtp_hdr* rtp = (struct rtp_hdr*)packet;\n if (packet_len < sizeof(rtp_hdr)) {\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_FAILURE;\n }\n\n \/\/ rtp payload\n packet += sizeof(rtp_hdr);\n packet_len -= sizeof(rtp_hdr);\n if (packet_len <= 2) {\n continue;\n }\n\n uint8_t nal = packet[0];\n uint8_t fragment_type = (nal & 0x1F);\n\n if (fragment_type >= 1 && fragment_type <= 23) {\n uint8_t* nal_data = NULL;\n size_t size_nal = make_nal_frame_header(packet, packet_len, nal_header, sizeof(nal_header), &nal_data);\n media_stream_write_video_frame(ostream, nal_data, size_nal);\n free(nal_data);\n } else if(fragment_type == 24) {\n packet++;\n packet_len--;\n \/\/ first we are going to figure out the total size....\n {\n int total_length= 0;\n uint8_t* dst = NULL;\n\n for(int pass = 0; pass < 2; pass++) {\n const uint8_t* src = packet;\n int src_len = packet_len;\n\n do {\n uint16_t nal_size = AV_RB16(src); \/\/ this going to be a problem if unaligned (can it be?)\n\n \/\/ consume the length of the aggregate...\n src += 2;\n src_len -= 2;\n\n if (nal_size <= src_len) {\n if(pass==0) {\n \/\/ counting...\n total_length+= sizeof(nal_header)+nal_size;\n } else {\n \/\/ copying\n assert(dst);\n memcpy(dst, nal_header, sizeof(nal_header));\n dst += sizeof(nal_header);\n memcpy(dst, src, nal_size);\n dst += nal_size;\n }\n } else {\n av_log(NULL, AV_LOG_ERROR,\n \"nal size exceeds length: %d %d\\n\", nal_size, src_len);\n }\n\n \/\/ eat what we handled...\n src += nal_size;\n src_len -= nal_size;\n\n if (src_len < 0)\n av_log(NULL, AV_LOG_ERROR,\n \"Consumed more bytes than we got! (%d)\\n\", src_len);\n } while (src_len > 2); \/\/ because there could be rtp padding..\n\n if (pass == 0) {\n dst = (uint8_t*)calloc(total_length, sizeof(uint8_t));\n } else {\n }\n }\n\n }\n } else if (fragment_type == 28 || fragment_type == 29) {\n packet++;\n packet_len--;\n\n uint8_t fu_indicator = nal;\n uint8_t fu_header = *packet; \/\/ read the fu_header.\n uint8_t start_bit = fu_header >> 7;\n uint8_t end_bit = (fu_header & 0x40) >> 6;\n uint8_t nal_type = (fu_header & 0x1f);\n uint8_t reconstructed_nal = fu_indicator & (0xe0); \/\/ the original nal forbidden bit and NRI are stored in this packet's nal;\n reconstructed_nal |= nal_type;\n\n packet++;\n packet_len--;\n\n if (fragment_type == 29) {\n packet = packet + 2;\n packet_len -= 2;\n }\n\n CHECK(packet_len > 0);\n\n if (start_bit) {\n size_t size_nal = sizeof(nal_header) + sizeof(nal) + packet_len;\n uint8_t* nal_data = (uint8_t*)calloc(size_nal, sizeof(uint8_t));\n memcpy(nal_data, nal_header, sizeof(nal_header));\n nal_data[sizeof(nal_header)]= reconstructed_nal;\n memcpy(nal_data + sizeof(nal_header) + sizeof(nal), packet, packet_len);\n media_stream_write_video_frame(ostream, nal_data, size_nal);\n free(nal_data);\n } else {\n media_stream_write_video_frame(ostream, packet, packet_len);\n }\n } else {\n NOTREACHED();\n }\n\n \/\/ http:\/\/stackoverflow.com\/questions\/3493742\/problem-to-decode-h264-video-over-rtp-with-ffmpeg-libavcodec\n \/\/ http:\/\/stackoverflow.com\/questions\/1957427\/detect-mpeg4-h264-i-frame-idr-in-rtp-stream\n } else if (ip->protocol == IPPROTO_TCP) {\n if (packet_len < sizeof(tcphdr)) {\n continue;\n }\n\n struct tcphdr *tcpheader = (struct tcphdr *)packet;\n packet += sizeof(tcphdr);\n packet_len -= sizeof(tcphdr);\n\n if (packet_len < sizeof(rtp_hdr)) {\n continue;\n }\n\n \/\/ parse RTSP packet\n }\n }\n\n\n pcap_close(pcap);\n free_video_stream(ostream);\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n}\t\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<commit_msg>Made the main app do something.<commit_after>\/*\n * main.cpp\n *\n * main file for derelict app\n *\n * starts GLUT and runs callbacks\n *\/\n\n#include <iostream>\n#include <GL\/glfw.h>\n\n#include \"Key.h\"\n#include \"Cam.h\"\n\nvoid Init() {\n\tglClearColor(1, 1, 1, 0);\n}\n\nvoid Display() {\n\tglClear(GL_COLOR_BUFFER_BIT|GL_DEPTH_BUFFER_BIT);\n\n\tglColor3f(0, 0, 0);\n\t\n\tglBegin(GL_TRIANGLE_STRIP);\n\t\tglVertex2f( 0, 0);\n\t\tglVertex2f(1, 0);\n\t\tglVertex2f( 0, 1);\n\tglEnd();\n}\n\nvoid Update() {\n\tif(Key::I().Pressed('D')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i += 0.1;\n\t\tCam::I().SetPos(pos);\n\t} else if(Key::I().Pressed('A')) {\n\t\tVector pos = Cam::I().GetPos();\n\t\tpos.i -= 0.1;\n\t\tCam::I().SetPos(pos);\n\t}\n}\n\nint main(int argc, char ** argv) {\n\tglfwInit();\n\n\tglfwOpenWindow(800, 600, 0, 0, 0, 0, 16, 0, GLFW_WINDOW);\n\n\tInit();\n\n\tglfwSetKeyCallback(Key::KeyEvent);\n\tglfwSetWindowSizeCallback(Cam::ResizeCallback);\n\n\tbool running = true;\n\n\twhile(running) {\n\t\tDisplay();\n\n\t\tUpdate();\n\t\tKey::I().Update();\n\n\t\tglfwSwapBuffers();\n\n\t\trunning = !glfwGetKey(GLFW_KEY_ESC) &&\n\t\t glfwGetWindowParam(GLFW_OPENED);\n\t\t\n\t\tglfwSleep(0.01);\n\t}\n\n\tglfwCloseWindow();\n\n\tglfwTerminate();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"consts.h\"\n#include \"circuits\/circuit.h\"\n#include \"circuits\/element.h\"\n#include \"matrix\/matrix.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdlib>\n\nusing namespace std;\n\n\nvoid exitPolitely(int exitCode) {\n\t#if defined (WIN32) || defined(_WIN32)\n\tcout << endl << \"Press any key to exit...\";\n\tcin.get();\n\tcin.get();\n\t#endif\n\texit(exitCode);\n}\n\n\nint readNetlistFile(int argc, char** argv, ifstream& netlistFile){\n string filepath;\n\n switch(argc) {\n case 1: {\n cout << \"Enter path to netlist file: \";\n cin >> filepath;\n break;\n }\n case 2: {\n filepath = argv[1];\n break;\n }\n default:\n cerr << \"FAILURE: Too much information!\" << endl;\n return EXIT_FAILURE;\n }\n\n netlistFile.open(filepath.c_str(), ifstream::in);\n if(!netlistFile.is_open()){\n cerr << \"FAILURE: Cannot open file \" << filepath << endl;\n\t\treturn EXIT_FAILURE;\n }\n return 0;\n}\n\nvoid printIntro(){\n cout << endl << \"Modified Nodal Analysis\"\n << endl << \"Originally by Antonio Carlos M. de Queiroz (acmq@coe.ufrj.br)\"\n << endl << \"Modified by Dhiana Deva, Felipe de Leo and Silvino Vieira\" << endl << endl;\n}\n\n\n\/* The program starts here *\/\nint main(int argc, char **argv){\n printIntro();\n\n\t\/* Creating a the variable \"netlistFile\" to use as input file to get the external data to the program *\/\n int numVariables=0,\n numElements=0,\n numNodes=0,\n rc=0;\n ifstream netlistFile;\n vector<string> lista(MAX_NAME+2); \/*Tem que caber jx antes do nome *\/\n vector<Element> netlist(MAX_ELEMS);\n double Yn[MAX_NODES+1][MAX_NODES+2];\n\n \/\/ XXX Magic! Really important!\n \/\/ If it goes after readElements everything mixes up!\n lista[0] = \"0\";\n\n\n rc = readNetlistFile(argc, argv, netlistFile);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n cout << \"Reading netlist:\" << endl;\n rc = readElementsFromNetlist(numElements,\n numVariables,\n netlistFile,\n lista,\n netlist);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n rc = addCurrentVariablesToNetlist(numElements,\n numVariables,\n numNodes,\n lista,\n netlist);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n #ifdef DEBUG\n cout << \"Internal variables:\" << endl;\n printVariables(numVariables, lista);\n\n cout << \"Summary:\" << endl;\n printSummary(numNodes, numVariables, numElements);\n #endif\n\n\n \/\/ Operations on the modified matrix...\n init(numVariables, Yn);\n applyStamps(numElements, numVariables, netlist, Yn);\n rc = solve(numVariables, Yn);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n #ifdef DEBUG\n cout << \"Final system:\" << endl;\n print(numVariables, Yn);\n\n cout << \"Solution:\" << endl;\n printSolution(numVariables, numNodes, Yn, lista);\n #endif\n\n\n \/* Save solution to File *\/\n string OutputFile;\n OutputFile = \"output.tab\";\n WriteSolutionToFile(OutputFile, numVariables, numNodes, Yn, lista);\n\n\n exitPolitely(EXIT_SUCCESS);\n}\n<commit_msg>Removes legacy comment (was mixing tabs and spaces anyways)<commit_after>#include \"consts.h\"\n#include \"circuits\/circuit.h\"\n#include \"circuits\/element.h\"\n#include \"matrix\/matrix.h\"\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <cstdlib>\n\nusing namespace std;\n\n\nvoid exitPolitely(int exitCode) {\n\t#if defined (WIN32) || defined(_WIN32)\n\tcout << endl << \"Press any key to exit...\";\n\tcin.get();\n\tcin.get();\n\t#endif\n\texit(exitCode);\n}\n\n\nint readNetlistFile(int argc, char** argv, ifstream& netlistFile){\n string filepath;\n\n switch(argc) {\n case 1: {\n cout << \"Enter path to netlist file: \";\n cin >> filepath;\n break;\n }\n case 2: {\n filepath = argv[1];\n break;\n }\n default:\n cerr << \"FAILURE: Too much information!\" << endl;\n return EXIT_FAILURE;\n }\n\n netlistFile.open(filepath.c_str(), ifstream::in);\n if(!netlistFile.is_open()){\n cerr << \"FAILURE: Cannot open file \" << filepath << endl;\n\t\treturn EXIT_FAILURE;\n }\n return 0;\n}\n\nvoid printIntro(){\n cout << endl << \"Modified Nodal Analysis\"\n << endl << \"Originally by Antonio Carlos M. de Queiroz (acmq@coe.ufrj.br)\"\n << endl << \"Modified by Dhiana Deva, Felipe de Leo and Silvino Vieira\" << endl << endl;\n}\n\n\n\/* The program starts here *\/\nint main(int argc, char **argv){\n printIntro();\n\n int numVariables=0,\n numElements=0,\n numNodes=0,\n rc=0;\n ifstream netlistFile;\n vector<string> lista(MAX_NAME+2); \/*Tem que caber jx antes do nome *\/\n vector<Element> netlist(MAX_ELEMS);\n double Yn[MAX_NODES+1][MAX_NODES+2];\n\n \/\/ XXX Magic! Really important!\n \/\/ If it goes after readElements everything mixes up!\n lista[0] = \"0\";\n\n\n rc = readNetlistFile(argc, argv, netlistFile);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n cout << \"Reading netlist:\" << endl;\n rc = readElementsFromNetlist(numElements,\n numVariables,\n netlistFile,\n lista,\n netlist);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n rc = addCurrentVariablesToNetlist(numElements,\n numVariables,\n numNodes,\n lista,\n netlist);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n #ifdef DEBUG\n cout << \"Internal variables:\" << endl;\n printVariables(numVariables, lista);\n\n cout << \"Summary:\" << endl;\n printSummary(numNodes, numVariables, numElements);\n #endif\n\n\n \/\/ Operations on the modified matrix...\n init(numVariables, Yn);\n applyStamps(numElements, numVariables, netlist, Yn);\n rc = solve(numVariables, Yn);\n if (rc) \/\/ if not return code 0 (success) \n exitPolitely(EXIT_FAILURE);\n\n\n #ifdef DEBUG\n cout << \"Final system:\" << endl;\n print(numVariables, Yn);\n\n cout << \"Solution:\" << endl;\n printSolution(numVariables, numNodes, Yn, lista);\n #endif\n\n\n \/* Save solution to File *\/\n string OutputFile;\n OutputFile = \"output.tab\";\n WriteSolutionToFile(OutputFile, numVariables, numNodes, Yn, lista);\n\n\n exitPolitely(EXIT_SUCCESS);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/! \\file main.cpp\n\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"Article.h\"\n#include \"ToGraphvizWriter.h\"\n#include \"WikiWalker.h\"\n#include \"version.h\"\n\n#include \"config.h\"\n\nusing CmdOpt = WikiWalker::CommandLineParserBase::CommandLineOptions;\n\nint main(int argc, char** argv)\n{\n#if defined(WW_USE_BOOST_PO)\n WikiWalker::BoostPoCommandLineParser cmdp;\n#elif defined(WW_USE_GETOPT)\n WikiWalker::GetoptCommandLineParser cmdp;\n#endif\n\n try {\n cmdp.parse(argc, argv);\n } catch(std::exception& e) {\n std::cerr << std::endl << e.what() << std::endl;\n cmdp.printHelp();\n return -1;\n }\n\n if(cmdp.hasSet(CmdOpt::Version)) {\n std::cout << \"WikiWalker, version \" << _WW_VERSION << std::endl;\n return 0;\n }\n\n if(cmdp.hasSet(CmdOpt::Help)) {\n cmdp.printHelp();\n return 0;\n }\n\n bool isUrlSet = cmdp.hasSet(CmdOpt::URL);\n bool isCacheSet = cmdp.hasSet(CmdOpt::JsonCache);\n bool isDotSet = cmdp.hasSet(CmdOpt::DotOut);\n bool validRunConfig = isUrlSet || (isDotSet && isCacheSet);\n\n if(!validRunConfig) {\n std::cerr << \"Must either specify at least URL, \"\n << \"or dot and cache file.\" << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n bool read_failed = false;\n WikiWalker::WikiWalker w;\n\n if(isCacheSet) {\n try {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n w.readCache(cachefile);\n } catch(std::exception& e) {\n std::cout << e.what() << std::endl;\n read_failed = true;\n }\n }\n\n if(isUrlSet) {\n try {\n std::string url = cmdp.getValue(CmdOpt::URL);\n w.startWalking(url);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n return -1;\n }\n }\n\n if(isCacheSet) {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n if(read_failed) {\n cachefile.append(\"_\");\n std::cout << \"Reading from cache failed, write to \" << cachefile\n << std::endl;\n }\n try {\n w.writeCache(cachefile);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n }\n }\n\n if(isDotSet) {\n const WikiWalker::ArticleCollection& ac = w.getCollection();\n std::string outfile = cmdp.getValue(CmdOpt::DotOut);\n WikiWalker::ToGraphvizWriter tgw;\n std::ofstream file(outfile, std::ios::trunc | std::ios::out);\n\n if(file.fail()) {\n std::cerr << \"Error opening dot out file for writing\" << std::endl;\n } else {\n tgw.output(ac, file);\n file.flush();\n\n if(file.bad() || file.fail()) {\n std::cerr << \"Error during writing dot out file.\" << std::endl;\n }\n\n file.close();\n }\n }\n\n for(auto& a : w.getCollection()) {\n auto& art = a.second;\n if(art->isAnalyzed()) {\n std::cout << \"Article \" << a.first << \" has \" << art->getNumLinks()\n << \" links\" << std::endl;\n }\n }\n\n return 0;\n}\n<commit_msg>Add option checking to main<commit_after>\/\/! \\file main.cpp\n\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"Article.h\"\n#include \"ToGraphvizWriter.h\"\n#include \"WikiWalker.h\"\n#include \"version.h\"\n\n#include \"config.h\"\n\nusing CmdOpt = WikiWalker::CommandLineParserBase::CommandLineOptions;\n\nint main(int argc, char** argv)\n{\n#if defined(WW_USE_BOOST_PO)\n WikiWalker::BoostPoCommandLineParser cmdp;\n#elif defined(WW_USE_GETOPT)\n WikiWalker::GetoptCommandLineParser cmdp;\n#endif\n\n try {\n cmdp.parse(argc, argv);\n } catch(std::exception& e) {\n std::cerr << std::endl << e.what() << std::endl;\n cmdp.printHelp();\n return -1;\n }\n\n if(cmdp.hasSet(CmdOpt::Version)) {\n std::cout << \"WikiWalker, version \" << _WW_VERSION << std::endl;\n return 0;\n }\n\n if(cmdp.hasSet(CmdOpt::Help)) {\n cmdp.printHelp();\n return 0;\n }\n\n bool isUrlSet = cmdp.hasSet(CmdOpt::URL);\n bool isCacheSet = cmdp.hasSet(CmdOpt::JsonCache);\n bool isDotSet = cmdp.hasSet(CmdOpt::DotOut);\n bool isDeepSet = cmdp.hasSet(CmdOpt::FetchDeep);\n bool validRunConfig = isUrlSet || (isDotSet && isCacheSet);\n\n if(!validRunConfig) {\n std::cerr << \"Must either specify at least URL, \"\n << \"or dot and cache file.\" << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n if(isUrlSet && isDeepSet && !isCacheSet) {\n std::cerr << \"Please specify a cache file when using \\\"deep\\\" option\"\n << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n bool read_failed = false;\n WikiWalker::WikiWalker w;\n\n if(isCacheSet) {\n try {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n w.readCache(cachefile);\n } catch(std::exception& e) {\n std::cout << e.what() << std::endl;\n read_failed = true;\n }\n }\n\n if(isUrlSet) {\n try {\n std::string url = cmdp.getValue(CmdOpt::URL);\n w.startWalking(url);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n return -1;\n }\n }\n\n if(isCacheSet) {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n if(read_failed) {\n cachefile.append(\"_\");\n std::cout << \"Reading from cache failed, write to \" << cachefile\n << std::endl;\n }\n try {\n w.writeCache(cachefile);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n }\n }\n\n if(isDotSet) {\n const WikiWalker::ArticleCollection& ac = w.getCollection();\n std::string outfile = cmdp.getValue(CmdOpt::DotOut);\n WikiWalker::ToGraphvizWriter tgw;\n std::ofstream file(outfile, std::ios::trunc | std::ios::out);\n\n if(file.fail()) {\n std::cerr << \"Error opening dot out file for writing\" << std::endl;\n } else {\n tgw.output(ac, file);\n file.flush();\n\n if(file.bad() || file.fail()) {\n std::cerr << \"Error during writing dot out file.\" << std::endl;\n }\n\n file.close();\n }\n }\n\n for(auto& a : w.getCollection()) {\n auto& art = a.second;\n if(art->isAnalyzed()) {\n std::cout << \"Article \" << a.first << \" has \" << art->getNumLinks()\n << \" links\" << std::endl;\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"main.hpp\"\r\n#include <iostream>\r\n#include <string>\r\n#include <fstream>\r\n#include <vector>\r\n#include <boost\/program_options.hpp>\r\nint main(int argc, char* argv[]) {\r\n\r\n\tnamespace po = boost::program_options;\r\n\tboost::program_options::options_description opt(\"Options\");\r\n\topt.add_options()(\"input-file\", boost::program_options::value<std::vector<std::string>>()->multitoken(), \"file name to convert\");\r\n\topt.add_options()(\"output-file,o\", boost::program_options::value<std::string>(), \"file name of the output(without extentions)\");\r\n\tpo::positional_options_description p;\r\n\tp.add(\"input-file\", -1);\r\n\r\n\tpo::variables_map vm;\r\n\tpo::store(po::command_line_parser(argc, argv).\r\n\t\t\t options(opt).positional(p).run(), vm);\r\n\tpo::notify(vm);\r\n\r\n\r\n\tif(!vm.count(\"input-file\")) {\r\n\t\tstd::cout << opt << std::endl;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\r\n\r\n\tdecltype(ALSL::parseFile(std::string(argv[1]))) ret;\r\n\r\n\tstd::string fname = (!vm.count(\"output-file\")) ? \"a\" : vm[\"output-file\"].as<std::string>();\r\n\tstd::ofstream ofsGL(fname + \".fs\", std::ofstream::out);\r\n\tstd::ofstream ofsHL(fname + \".fx\", std::ofstream::out);\r\n\tfor(std::string const& src : vm[\"input-file\"].as<std::vector<std::string>>()) {\r\n\t\ttry {\r\n\t\t\t\/\/ ret = ALSL::parseFile(std::string(argv[1]));\r\n\t\t\tret = ALSL::parseFile(src);\r\n\r\n\r\n\t\t} catch(...){\r\n\t\t\tstd::cout << \"unknown error was occured while parsing.\" << std::endl;\r\n\t\t}\r\n\t\t\tALSL::GeneratorGLSL genGL;\r\n\t\t\tALSL::GeneratorHLSL genHL;\r\n\r\n\t\t\t\/\/ auto const ret = ALSL::parseFile(vm[\"input-file\"].as<std::string>());\r\n\t\tif(ret) {\r\n\t\t\tstd::cout << \"Succeessfully translated.\" << std::endl;\r\n\t\t\t\r\n\t\t\tgenGL.generate(ofsGL, *ret);\r\n\t\t\tgenHL.generate(ofsHL, *ret);\r\n\t\t\t\r\n\r\n\t\t} else {\r\n\t\t\tstd::cout << \"Failed to translate.\" << std::endl;\r\n\r\n\t\t}\r\n\t}\r\n\tofsGL.close();\r\n\tofsHL.close();\r\n\r\n\t\/\/} catch(...) {\r\n\t\/\/\tstd::cout << \"unknown error was occured while parsing.\" << std::endl;\r\n\t\/\/}\r\n\r\n\treturn 0;\r\n}<commit_msg>check whether the input files exist.<commit_after>#include \"main.hpp\"\r\n#include <iostream>\r\n#include <string>\r\n#include <fstream>\r\n#include <vector>\r\n#include <boost\/filesystem.hpp>\r\n#include <boost\/program_options.hpp>\r\nint main(int argc, char* argv[]) {\r\n\r\n\tnamespace po = boost::program_options;\r\n\tboost::program_options::options_description opt(\"Options\");\r\n\topt.add_options()(\"input-file\", boost::program_options::value<std::vector<std::string>>()->multitoken(), \"file name to convert\");\r\n\topt.add_options()(\"output-file,o\", boost::program_options::value<std::string>(), \"file name of the output(without extentions)\");\r\n\tpo::positional_options_description p;\r\n\tp.add(\"input-file\", -1);\r\n\r\n\tpo::variables_map vm;\r\n\tpo::store(po::command_line_parser(argc, argv).\r\n\t\t\t options(opt).positional(p).run(), vm);\r\n\tpo::notify(vm);\r\n\r\n\r\n\tif(!vm.count(\"input-file\")) {\r\n\t\tstd::cout << opt << std::endl;\r\n\t\treturn 0;\r\n\t}\r\n\r\n\r\n\r\n\tdecltype(ALSL::parseFile(std::string(argv[1]))) ret;\r\n\r\n\tstd::string fname = (!vm.count(\"output-file\")) ? \"a\" : vm[\"output-file\"].as<std::string>();\r\n\r\n\tstd::ofstream ofsGL(fname + \".fs\", std::ofstream::out);\r\n\tstd::ofstream ofsHL(fname + \".fx\", std::ofstream::out);\r\n\tfor(std::string const& src : vm[\"input-file\"].as<std::vector<std::string>>()) {\r\n\r\n\t\tboost::system::error_code error;\r\n\t\tconst bool result = boost::filesystem::exists(boost::filesystem::path(src), error);\r\n\t\tif(!result || error) {\r\n\t\t\tstd::cerr << \"file \" << src << \" is not exist.\" << std::endl;\r\n\t\t\tcontinue;\r\n\t\t}\r\n\r\n\t\ttry {\r\n\t\t\t\/\/ ret = ALSL::parseFile(std::string(argv[1]));\r\n\t\t\tret = ALSL::parseFile(src);\r\n\r\n\r\n\t\t} catch(...){\r\n\t\t\tstd::cerr << src << \": unknown error was occured while parsing.\" << std::endl;\r\n\t\t}\r\n\t\t\tALSL::GeneratorGLSL genGL;\r\n\t\t\tALSL::GeneratorHLSL genHL;\r\n\r\n\t\t\t\/\/ auto const ret = ALSL::parseFile(vm[\"input-file\"].as<std::string>());\r\n\t\tif(ret) {\r\n\t\t\tstd::cout << src << \": succeessfully translated.\" << std::endl;\r\n\t\t\t\r\n\t\t\tgenGL.generate(ofsGL, *ret);\r\n\t\t\tgenHL.generate(ofsHL, *ret);\r\n\t\t\t\r\n\r\n\t\t} else {\r\n\t\t\tstd::cerr << src << \": failed to translate.\" << std::endl;\r\n\r\n\t\t}\r\n\t}\r\n\tofsGL.close();\r\n\tofsHL.close();\r\n\r\n\t\/\/} catch(...) {\r\n\t\/\/\tstd::cout << \"unknown error was occured while parsing.\" << std::endl;\r\n\t\/\/}\r\n\r\n\treturn 0;\r\n}<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <thread>\n\n#include \"AudioSubsystem.h\"\n#include \"AudioSubsystem_OpenAL.h\"\n#include \"Decoders\/iWaveDataProvider.h\"\n#include \"Decoders\/WAV\/WAVDataProvider.h\"\n#include \"Utils.h\"\n\nint main( int argc, char* argv[] )\n{\n\tconst char* FileName = ( argc > 1 ) ? argv[1] : \"test.wav\";\n\n\tauto AudioSubsystem = CreateAudioSubsystem_OpenAL();\n\n\tAudioSubsystem->Start();\n\n\tauto TestBlob = ReadFileAsBlob( FileName );\n\tauto Provider = CreateWaveDataProvider( FileName, TestBlob );\n\tauto Source = AudioSubsystem->CreateAudioSource();\n\tSource->BindDataProvider( Provider );\n\tSource->Play();\n\n\twhile ( Source->IsPlaying() && !IsKeyPressed() );\n\n\tstd::this_thread::sleep_for( std::chrono::milliseconds(300) );\n\n\tSource->Stop();\n\tSource = nullptr;\n\n\tAudioSubsystem->Stop();\n\n\treturn 0;\n};\n<commit_msg>Just sleep in the busy loop<commit_after>#include <chrono>\n#include <thread>\n\n#include \"AudioSubsystem.h\"\n#include \"AudioSubsystem_OpenAL.h\"\n#include \"Decoders\/iWaveDataProvider.h\"\n#include \"Decoders\/WAV\/WAVDataProvider.h\"\n#include \"Utils.h\"\n\nint main( int argc, char* argv[] )\n{\n\tconst char* FileName = ( argc > 1 ) ? argv[1] : \"test.wav\";\n\n\tauto AudioSubsystem = CreateAudioSubsystem_OpenAL();\n\n\tAudioSubsystem->Start();\n\n\tauto TestBlob = ReadFileAsBlob( FileName );\n\tauto Provider = CreateWaveDataProvider( FileName, TestBlob );\n\tauto Source = AudioSubsystem->CreateAudioSource();\n\tSource->BindDataProvider( Provider );\n\tSource->Play();\n\n\twhile ( Source->IsPlaying() && !IsKeyPressed() )\n\t{\n\t\tstd::this_thread::sleep_for( std::chrono::milliseconds(10) );\n\t};\n\n\tstd::this_thread::sleep_for( std::chrono::milliseconds(300) );\n\n\tSource->Stop();\n\tSource = nullptr;\n\n\tAudioSubsystem->Stop();\n\n\treturn 0;\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\nMIT License\n\nCopyright (c) 2017 CPirc\nCopyright (c) 2018 CPirc\nCopyright (c) 2019 CPirc\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*\/\n\n#include <iostream>\n#include <string>\n\n#include \"bitboard.h\"\n#include \"position.h\"\n#include \"uci.h\"\n\nint main()\n{\n seed_rng(17594872);\n init_keys();\n init_bitboards();\n\n std::setbuf(stdout, NULL);\n std::setbuf(stdin, NULL);\n\n std::string line;\n while (true) {\n std::getline(std::cin, line);\n if (line == \"uci\") {\n UCI::listen();\n } else if (line == \"xboard\") {\n std::cout << \"Protocol not supported\" << std::endl;\n } else if (line == \"quit\") {\n break;\n } else {\n std::cout << \"Unknown protocol\" << std::endl;\n }\n }\n\n return 0;\n}\n<commit_msg>Fix quit issue<commit_after>\/*\nMIT License\n\nCopyright (c) 2017 CPirc\nCopyright (c) 2018 CPirc\nCopyright (c) 2019 CPirc\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n*\/\n\n#include <iostream>\n#include <string>\n\n#include \"bitboard.h\"\n#include \"position.h\"\n#include \"uci.h\"\n\nint main()\n{\n seed_rng(17594872);\n init_keys();\n init_bitboards();\n\n std::setbuf(stdout, NULL);\n std::setbuf(stdin, NULL);\n\n std::string line;\n while (true) {\n std::getline(std::cin, line);\n if (line == \"uci\") {\n UCI::listen();\n break;\n } else if (line == \"xboard\") {\n std::cout << \"Protocol not supported\" << std::endl;\n } else if (line == \"quit\") {\n break;\n } else {\n std::cout << \"Unknown protocol\" << std::endl;\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <SDL2\/SDL.h>\n#include \"draw.hpp\"\n\nconst char * game_name = \"Game Of Life On Surface\";\nint screen_width = 640;\nint screen_height = 640;\nint R = 200;\nfield f(16, 32);\nbool quit_flag = false;\nSDL_Window * window = NULL;\nSDL_Renderer * render = NULL;\nSDL_Event event;\n\nvoid game_send_error( int code ) {\n printf( \"[error]: %s\\n\", SDL_GetError() );\n exit( code );\n}\n\nvoid game_event( SDL_Event * event ) {\n SDL_PollEvent( event );\n switch ( event->type ) {\n case SDL_QUIT:\n quit_flag = true;\n break;\n case SDL_WINDOWEVENT:\n if ( event->window.event == SDL_WINDOWEVENT_RESIZED ) {\n screen_width = event->window.data1;\n screen_height = event->window.data2;\n }\n break;\n case SDL_KEYDOWN:\n switch ( event->key.keysym.sym ) {\n case SDLK_ESCAPE:\n quit_flag = true;\n break;\n default:\n break;\n }\n default:\n break;\n }\n}\n\nvoid game_loop( void ) {\n \/\/ insert code\n}\n\nvoid draw_point( int x, int y, int size ) {\n SDL_Rect rect = { x, y, size, size };\n SDL_RenderFillRect( render, &rect );\n}\n\nvoid game_render( void ) {\n SDL_RenderClear( render );\n set_coloru( COLOR_WHITE );\n draw_sphere( { screen_width \/ 2, screen_height \/ 2 }, R, f );\n set_coloru( COLOR_BLACK );\n SDL_RenderPresent( render );\n}\n\nvoid game_destroy( void ) {\n SDL_DestroyRenderer( render );\n SDL_DestroyWindow( window );\n SDL_Quit();\n}\n\nvoid game_init( void ) {\n SDL_Init( SDL_INIT_VIDEO | SDL_INIT_EVENTS );\n window = SDL_CreateWindow( game_name, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED,\n screen_width, screen_height, SDL_WINDOW_SHOWN | SDL_WINDOW_RESIZABLE );\n if ( window == NULL ) {\n game_send_error( EXIT_FAILURE );\n }\n render = SDL_CreateRenderer( window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC |\n SDL_RENDERER_TARGETTEXTURE );\n if ( render == NULL ) {\n game_send_error( EXIT_FAILURE );\n }\n SDL_SetRenderDrawBlendMode( render, SDL_BLENDMODE_BLEND );\n draw_init( render );\n}\n\nint main() {\n Uint32 FPS_MAX = 1000 \/ 63; \/\/ ~ 60 fps\n\n game_init();\n while ( quit_flag == false ) {\n game_event( &event );\n game_loop();\n game_render();\n SDL_Delay( FPS_MAX );\n }\n game_destroy();\n return EXIT_SUCCESS;\n}\n<commit_msg>[del] unuse code; [fix] revert argc, argv for Windows compile<commit_after>#include <cstdio>\n#include <SDL2\/SDL.h>\n#include \"draw.hpp\"\n\nconst char * game_name = \"Game Of Life On Surface\";\nint screen_width = 640;\nint screen_height = 640;\nint R = 200;\nfield f(16, 32);\nbool quit_flag = false;\nSDL_Window * window = NULL;\nSDL_Renderer * render = NULL;\nSDL_Event event;\n\nvoid game_send_error( int code ) {\n printf( \"[error]: %s\\n\", SDL_GetError() );\n exit( code );\n}\n\nvoid game_event( SDL_Event * event ) {\n SDL_PollEvent( event );\n switch ( event->type ) {\n case SDL_QUIT:\n quit_flag = true;\n break;\n case SDL_WINDOWEVENT:\n if ( event->window.event == SDL_WINDOWEVENT_RESIZED ) {\n screen_width = event->window.data1;\n screen_height = event->window.data2;\n }\n break;\n case SDL_KEYDOWN:\n switch ( event->key.keysym.sym ) {\n case SDLK_ESCAPE:\n quit_flag = true;\n break;\n default:\n break;\n }\n default:\n break;\n }\n}\n\nvoid game_loop( void ) {\n \/\/ insert code\n}\n\nvoid game_render( void ) {\n SDL_RenderClear( render );\n set_coloru( COLOR_WHITE );\n draw_sphere( { screen_width \/ 2, screen_height \/ 2 }, R, f );\n set_coloru( COLOR_BLACK );\n SDL_RenderPresent( render );\n}\n\nvoid game_destroy( void ) {\n SDL_DestroyRenderer( render );\n SDL_DestroyWindow( window );\n SDL_Quit();\n}\n\nvoid game_init( void ) {\n SDL_Init( SDL_INIT_VIDEO | SDL_INIT_EVENTS );\n window = SDL_CreateWindow( game_name, SDL_WINDOWPOS_CENTERED, SDL_WINDOWPOS_CENTERED,\n screen_width, screen_height, SDL_WINDOW_SHOWN | SDL_WINDOW_RESIZABLE );\n if ( window == NULL ) {\n game_send_error( EXIT_FAILURE );\n }\n render = SDL_CreateRenderer( window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC |\n SDL_RENDERER_TARGETTEXTURE );\n if ( render == NULL ) {\n game_send_error( EXIT_FAILURE );\n }\n SDL_SetRenderDrawBlendMode( render, SDL_BLENDMODE_BLEND );\n draw_init( render );\n}\n\nint main( int argc, char * argv[] ) {\n Uint32 FPS_MAX = 1000 \/ 63; \/\/ ~ 60 fps\n\n game_init();\n while ( quit_flag == false ) {\n game_event( &event );\n game_loop();\n game_render();\n SDL_Delay( FPS_MAX );\n }\n game_destroy();\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <limits>\n#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n }\n }\n if (fs.good())\n {\n fs.close();\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n auto calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::shared_ptr<CURL *> phandle =\n std::make_shared<CURL *>(curl_easy_init());\n std::string url(patch_dir + name());\n curl_easy_setopt(*phandle, CURLOPT_URL, url.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &s);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n std::ofstream ofs(name());\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n std::cout << \"Finished downloading \" << name() << std::endl;\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n\n return calcsum.str();\n}\n\nnamespace Options\n{\n bool checksum(const std::string &val)\n {\n return val == \"checksum\";\n }\n};\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = tolower(c);\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\nclass EfuLauncher\n{\n public:\n explicit EfuLauncher(const std::string path, const std::string update_check):\n m_path(path), m_update_check(update_check), m_has_update(false)\n {}\n\n bool has_update()\n {\n std::string fetch;\n std::shared_ptr<CURL *> phandle(std::make_shared<CURL*>(curl_easy_init()));\n curl_easy_setopt(*phandle, CURLOPT_URL, m_update_check.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto keyvals(split(*beg, '='));\n if (keyvals.size() != 2)\n {\n std::cerr << \"Malformed option: \" + *beg +\n \", aborting launcher update check.\" << std::endl;\n return m_has_update = false;\n }\n if (Options::checksum(keyvals[0]))\n {\n const std::string checksum_test(keyvals[1]);\n m_has_update = checksum_test != file_checksum(path());\n }\n }\n return m_has_update;\n }\n \n private:\n const std::string path() const { return m_path; }\n\n const std::string m_path;\n const std::string m_update_check;\n bool m_has_update;\n};\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/updatecheck\/versioncheck\");\n const std::string update_check(\"https:\/\/raw.github.com\/commonquail\/efulauncher\/updatecheck\/versioncheck\");\n std::string fetch;\n std::shared_ptr<CURL *> phandle = std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, update_check.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto keyvals(split(*beg, '='));\n if (Options::checksum(keyvals[0]))\n {\n const std::string checksum_test(keyvals[keyvals.size() - 1]);\n if (checksum_test != file_checksum(argv[0]))\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use the latest launcher.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n std::cout << \"Done.\" << std::endl;\n }\n }\n }\n }\n\n phandle = std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, listing.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n\n lines = split(fetch, '\\n');\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n#ifndef DEBUG\n for (auto &t : new_targets)\n {\n t.fetch();\n }\n for (auto &t : old_targets)\n {\n t.fetch();\n }\n#endif\n\n return 0;\n}\n<commit_msg>Use has_update() and remove superfluous curl code.<commit_after>#include <limits>\n#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n }\n }\n if (fs.good())\n {\n fs.close();\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n auto calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::shared_ptr<CURL *> phandle =\n std::make_shared<CURL *>(curl_easy_init());\n std::string url(patch_dir + name());\n curl_easy_setopt(*phandle, CURLOPT_URL, url.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &s);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n std::ofstream ofs(name());\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n std::cout << \"Finished downloading \" << name() << std::endl;\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n\n return calcsum.str();\n}\n\nnamespace Options\n{\n bool checksum(const std::string &val)\n {\n return val == \"checksum\";\n }\n};\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = tolower(c);\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\nclass EfuLauncher\n{\n public:\n explicit EfuLauncher(const std::string path, const std::string update_check):\n m_path(path), m_update_check(update_check), m_has_update(false)\n {}\n\n bool has_update()\n {\n std::string fetch;\n std::shared_ptr<CURL *> phandle(std::make_shared<CURL*>(curl_easy_init()));\n curl_easy_setopt(*phandle, CURLOPT_URL, m_update_check.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto keyvals(split(*beg, '='));\n if (keyvals.size() != 2)\n {\n std::cerr << \"Malformed option: \" + *beg +\n \", aborting launcher update check.\" << std::endl;\n return m_has_update = false;\n }\n if (Options::checksum(keyvals[0]))\n {\n const std::string checksum_test(keyvals[1]);\n m_has_update = checksum_test != file_checksum(path());\n }\n }\n return m_has_update;\n }\n \n private:\n const std::string path() const { return m_path; }\n\n const std::string m_path;\n const std::string m_update_check;\n bool m_has_update;\n};\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"updatecheck\/versioncheck\");\n std::string fetch;\n auto phandle(std::make_shared<CURL *>(curl_easy_init()));\n curl_easy_cleanup(*phandle);\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n std::cout << \"Done.\" << std::endl;\n }\n }\n\n phandle = std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, listing.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n\n lines = split(fetch, '\\n');\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n#ifndef DEBUG\n for (auto &t : new_targets)\n {\n t.fetch();\n }\n for (auto &t : old_targets)\n {\n t.fetch();\n }\n#endif\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <fcgio.h>\n\/\/#include <stdlib.h>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <map>\n\n#include <mstch\/mstch.hpp>\n#include \"markdown.h\"\n\n#include \"Compositor.h\"\n\nstd::string webRoot = \"\/var\/www\/html\";\nstd::string dataRoot = \"\/var\/www\/html-data\";\nstd::string msgLogPath = \"\/var\/log\/simplestCMS\/message.log\";\n\n\/*\nint readPage(mstch::map& pageData, std::string filePath);\nvoid urldecode2(char *dst, const char *src);\nvoid formatGetData(StrMap &map, std::string query);\nvoid formatCookieData(StrMap &map, std::string query);\n*\/\nvoid logMessage(std::string message);\n\nint main(int argc, char** argv) {\n\tint counter = 0;\n\tstd::string templateString;\/\/ = \"<html><body>title = {{ title }} <br> {{ query }} <br> {{{ content }}} <br> hit #{{ counter }}<\/body><\/html>\";\n\tstd::streambuf* defaultCout = std::cout.rdbuf();\n\tstd::streambuf* defaultCin = std::cin.rdbuf();\n\tstd::ifstream templateFile;\n\t\n\tFCGX_Request request;\n\tFCGX_Init();\n\tFCGX_InitRequest(&request, 0, 0);\n\t\n\tlogMessage(\" ------ new run ------\");\n\t\n\ttemplateFile.open(dataRoot + \"\/themes\/default\/template.mstch\");\n\tif (!templateFile) {\n\t\tstd::cerr << \"Could not open the site template\" << std::endl;\n\t\treturn 1;\n\t}\n\t\n\twhile (templateFile.good()) {\n\t\tstd::string lineBuf;\n\t\tstd::getline(templateFile, lineBuf);\n\t\ttemplateString += lineBuf;\n\t\ttemplateString += \"\\n\";\n\t}\n\t\n\twhile (FCGX_Accept_r(&request) == 0) {\n\t\tCompositor response;\n\t\tStrMap _GET;\n\t\tStrMap _POST;\n\t\tStrMap _COOKIE;\n\t\tfcgi_streambuf fcgiCout(request.out);\n\t\tfcgi_streambuf fcgiCin(request.in);\n\t\tstd::cout.rdbuf(&fcgiCout);\n\t\tstd::cin.rdbuf(&fcgiCin);\n\/\/\t\tmstch::map context;\n\t\t\n\t\tresponse.page_template(templateString);\n\t\tresponse.content_path(dataRoot + \"index.md\");\n\t\t\n\/\/ ------------ get data\n\t\tresponse.get_data(std::string(FCGX_GetParam(\"QUERY_STRING\", request.envp)));\t\t\n\/*\t\tstd::string queryString = std::string(FCGX_GetParam(\"QUERY_STRING\", request.envp));\n\t\tformatGetData(_GET, queryString);\n*\/\t\t\n\/\/ ------------ post data\n\t\tint postLen = std::atoi(FCGX_GetParam(\"CONTENT_LENGTH\", request.envp));\n\t\tif (postLen) {\n\t\t\tstd::string postData;\n\t\t\tpostData.resize(postLen + 1);\n\t\t\tstd::cin.read(&postData[0], postLen);\n\/\/\t\t\tformatGetData(_POST, postData);\n\t\t\tresponse.post_data(postData);\n\t\t}\n\n\/\/ ------------ cookie data\n\t\tif (FCGX_GetParam(\"HTTP_COOKIE\", request.envp) != NULL) {\n\/*\t\t\tstd::string cookieData = FCGX_GetParam(\"HTTP_COOKIE\", request.envp);\n\t\t\tformatCookieData(_COOKIE, cookieData);\n*\/\t\t\tresponse.cookie_data(std::string(FCGX_GetParam(\"HTTP_COOKIE\", request.envp)));\n\t\t}\n\/*\n\t\tint readError = readPage(context, \"testFile.md\");\n\t\tif (readError != 0) {\n\t\t\tswitch(readError) {\n\t\t\tcase (1):\n\t\t\t\tcontext.emplace(\"content\", std::string(\"Error Opening target file<br>\"));\n\t\t\t\tbreak;\n\t\t\tcase (2):\n\t\t\t\tcontext.emplace(\"content\", std::string(\"Error parsing target file<br>\"));\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcontext.emplace(\"content\", std::string(\"Error loading page<br>\"));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n*\/\n\t\t\n\/\/\t\tcontext.emplace(\"counter\", counter);\n\t\tresponse.content_emplace(\"counter\", std::to_string(counter));\n\n\/\/\t\tstd::cout << \"HTTP\/1.0 200 OK\\r\\nContent-Type: text\/html\\r\\n\\r\\n\";\n\/\/\t\tstd::cout << mstch::render(templateString, context) << std::endl;\n\t\tcounter++;\n\t\tFCGX_Finish_r(&request);\n\t}\n\t\n\tstd::cin.rdbuf(defaultCin);\n\tstd::cout.rdbuf(defaultCout);\n\treturn 0;\n}\n\nvoid logMessage(std::string message) {\n\tstd::ofstream msgLog;\n\t\n\tmsgLog.open(msgLogPath.c_str(), std::ofstream::app);\n\t\n\tif (msgLog.good())\n\t\tmsgLog << message << std::endl;\n\t\t\n\tmsgLog.close();\n}\n\n\/*\n\nint readPage(mstch::map& pageData, std::string filePath) {\n\tmarkdown::Document mdData;\n\tstd::ifstream mdFile;\n\tstd::stringstream mdStream;\n\tstd::string htmlString;\n\tstd::string lineBuf;\n\tstd::string fileBuf;\n\tstd::string::size_type commentBegin;\n\tstd::string::size_type commentEnd;\n\t\t\n\tmdFile.open(filePath.c_str());\n\tif (!mdFile) { \n\t\treturn 1;\n\t}\n\t\n\tstd::getline(mdFile, lineBuf); \n\twhile (mdFile.good()) { \/\/ copy over mdFile\n\t\tfileBuf += \"\\n\";\n\t\tfileBuf += lineBuf;\t\t\n\t\t\n\t\tstd::getline(mdFile, lineBuf); \n\t}\n\t\n\tcommentBegin = fileBuf.find(\"<!--\", 0, 4);\n\twhile (commentBegin != std::string::npos) {\n\t\tcommentEnd = fileBuf.find(\"-->\", 0, 3);\n\t\tif (commentEnd == std::string::npos)\n\t\t\treturn 2;\n\t\t\/\/check the comment for values to pass through\n\t\tlineBuf = fileBuf.substr(commentBegin + 4, commentEnd - commentBegin - 4);\n\t\t\n\t\tstd::string::size_type eqMarker = lineBuf.find(\"=\", 0, 1);\n\t\twhile (eqMarker != std::string::npos) {\n\t\t\tstatic bool firstMatch = true; \n\t\t\tstd::string::size_type oStart = lineBuf.find_last_of(\" \\n\\t\", eqMarker); \/\/ find the word boundry of the option name\n\t\t\tstd::string::size_type vEnd = lineBuf.find_first_of(\"\\n\", eqMarker);\n\n\t\t\tif (oStart != std::string::npos) { \/\/looks like a valid option name\n\t\t\t\tstd::string option = lineBuf.substr(oStart + 1, eqMarker - oStart - 1);\n\t\t\t\tstd::string val = lineBuf.substr(eqMarker + 1, vEnd - eqMarker - 1);\n\t\t\t\t\n\t\t\t\tpageData.emplace(option, val);\n\t\t\t}\n\t\t\tif (vEnd == std::string::npos)\n\t\t\t\tbreak;\n\t\t\teqMarker = lineBuf.find(\"=\", vEnd, 1);\n\t\t\tfirstMatch = false;\n\t\t}\n\t\t\/\/clear out the comment\n\t\tfileBuf.replace(commentBegin, commentEnd - commentBegin + 3, \"\");\n\t\tcommentBegin = fileBuf.find(\"<!--\", commentBegin, 4);\n\t}\n\t\n\t\n\t\/\/process the md file\n\tmdData.read(fileBuf);\n\tmdData.write(mdStream);\n\t\n\t\/\/prep the data to be exposed to the view\n\tstd::getline(mdStream, fileBuf); \n\twhile (mdStream.good()) {\n\t\thtmlString += \"\\n\";\n\t\thtmlString += fileBuf;\n\t\tstd::getline(mdStream, fileBuf); \n\t}\n\t\n\t\/\/expose the html version of the md file\n\tpageData.emplace(\"content\", htmlString);\n\t\n\treturn 0;\n}\n\nvoid formatGetData(StrMap &map, std::string query)\n{\n\tif (query == \"\")\n\t\treturn;\n\n\tstd::string::size_type eqMarker = query.find(\"=\");\n\tdo {\n\t\tstd::string::size_type pairMarker = query.find(\"&\"); \n\t\tstd::string key = query.substr(0, eqMarker);\n\t\tstd::string val = query.substr(eqMarker + 1, pairMarker - eqMarker - 1);\n\t\t\n\t\tchar* keyFinal = new char[key.size() + 1];\n\t\tchar* valFinal = new char[val.size() + 1];\n\t\t\n\t\turldecode2(keyFinal, key.c_str());\n\t\turldecode2(valFinal, val.c_str());\n\n\t\tmap.emplace(keyFinal, valFinal);\n\t\t\n\t\tdelete [] keyFinal;\n\t\tdelete [] valFinal;\n\t\t\n\t\tif (pairMarker == std::string::npos)\n\t\t\tpairMarker = query.size() - 1;\n\t\tquery.replace(0, pairMarker + 1, \"\");\n\t\teqMarker = query.find(\"=\");\n\t} while (eqMarker != std::string::npos);\n}\n\nvoid formatCookieData(StrMap &map, std::string query)\n{\n\tif (query == \"\")\n\t\treturn;\n\n\tstd::string::size_type eqMarker = query.find(\"=\");\n\tdo {\n\t\tstd::string::size_type pairMarker = query.find(\"; \"); \n\t\tstd::string key = query.substr(0, eqMarker);\n\t\tstd::string val = query.substr(eqMarker + 1, pairMarker - eqMarker - 1);\n\t\t\n\t\tchar* keyFinal = new char[key.size() + 1];\n\t\tchar* valFinal = new char[val.size() + 1];\n\t\t\n\t\turldecode2(keyFinal, key.c_str());\n\t\turldecode2(valFinal, val.c_str());\n\n\t\tmap.emplace(keyFinal, valFinal);\n\t\t\n\t\tdelete [] keyFinal;\n\t\tdelete [] valFinal;\n\t\t\n\t\tif (pairMarker == std::string::npos)\n\t\t\tpairMarker = query.size() - 1;\n\t\tquery.replace(0, pairMarker + 2, \"\");\n\t\teqMarker = query.find(\"=\");\n\t} while (eqMarker != std::string::npos);\n}\n\n\/\/ adapted from http:\/\/stackoverflow.com\/a\/14530993\/3999005\nvoid urldecode2(char *dst, const char *src)\n{\n char a, b;\n while (*src) {\n if ((*src == '%') &&\n ((a = src[1]) && (b = src[2])) &&\n (isxdigit(a) && isxdigit(b))) {\n if (a >= 'a')\n a -= 'a'-'A';\n if (a >= 'A')\n a -= ('A' - 10);\n else\n a -= '0';\n if (b >= 'a')\n b -= 'a'-'A';\n if (b >= 'A')\n b -= ('A' - 10);\n else\n b -= '0';\n *dst++ = 16*a+b;\n src+=3;\n\t\t\t\t} else if (*src == '+') {\n\t\t\t\t\t*dst = ' ';\n\t\t\t\t\tdst++;\n\t\t\t\t\tsrc++;\n } else {\n *dst++ = *src++;\n }\n }\n *dst++ = '\\0';\n}\n*\/<commit_msg>got the refactor so it compiles and runs, still should tighten down the Compositor class<commit_after>#include <fcgio.h>\n\/\/#include <stdlib.h>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <map>\n\n#include <mstch\/mstch.hpp>\n#include \"markdown.h\"\n\n#include \"Compositor.h\"\n\nstd::string webRoot = \"\/var\/www\/html\";\nstd::string dataRoot = \"\/var\/www\/html-data\";\nstd::string msgLogPath = \"\/var\/log\/simplestCMS\/message.log\";\n\nvoid logMessage(std::string message);\n\nint main(int argc, char** argv) {\n\tint counter = 0;\n\tstd::string templateString;\n\tstd::streambuf* defaultCout = std::cout.rdbuf();\n\tstd::streambuf* defaultCin = std::cin.rdbuf();\n\tstd::ifstream templateFile;\n\t\n\tFCGX_Request request;\n\tFCGX_Init();\n\tFCGX_InitRequest(&request, 0, 0);\n\t\n\tlogMessage(\" ------ new run ------\");\n\t\n\ttemplateFile.open(dataRoot + \"\/themes\/default\/template.mstch\");\n\tif (!templateFile) {\n\t\tstd::cerr << \"Could not open the site template\" << std::endl;\n\t\treturn 1;\n\t}\n\t\n\twhile (templateFile.good()) {\n\t\tstd::string lineBuf;\n\t\tstd::getline(templateFile, lineBuf);\n\t\ttemplateString += lineBuf;\n\t\ttemplateString += \"\\n\";\n\t}\n\t\n\twhile (FCGX_Accept_r(&request) == 0) {\n\t\tCompositor response;\n\t\tStrMap _GET;\n\t\tStrMap _POST;\n\t\tStrMap _COOKIE;\n\t\tfcgi_streambuf fcgiCout(request.out);\n\t\tfcgi_streambuf fcgiCin(request.in);\n\t\tstd::cout.rdbuf(&fcgiCout);\n\t\tstd::cin.rdbuf(&fcgiCin);\n\t\t\n\t\tresponse.page_template(templateString);\n\t\tresponse.content_path(dataRoot + \"index.md\");\n\t\t\n\/\/ ------------ get data\n\t\tresponse.get_data(std::string(FCGX_GetParam(\"QUERY_STRING\", request.envp)));\n\/\/ ------------ post data\n\t\tint postLen = std::atoi(FCGX_GetParam(\"CONTENT_LENGTH\", request.envp));\n\t\tif (postLen) {\n\t\t\tstd::string postData;\n\t\t\tpostData.resize(postLen + 1);\n\t\t\tstd::cin.read(&postData[0], postLen);\n\t\t\tresponse.post_data(postData);\n\t\t}\n\n\/\/ ------------ cookie data\n\t\tif (FCGX_GetParam(\"HTTP_COOKIE\", request.envp) != NULL) {\n\t\t\tresponse.cookie_data(std::string(FCGX_GetParam(\"HTTP_COOKIE\", request.envp)));\n\t\t}\n\n\t\tresponse.content_emplace(\"counter\", std::to_string(counter));\n\t\t\n\t\tstd::cout << response.response();\n\t\tcounter++;\n\t\tFCGX_Finish_r(&request);\n\t}\n\t\n\tstd::cin.rdbuf(defaultCin);\n\tstd::cout.rdbuf(defaultCout);\n\treturn 0;\n}\n\nvoid logMessage(std::string message) {\n\tstd::ofstream msgLog;\n\t\n\tmsgLog.open(msgLogPath.c_str(), std::ofstream::app);\n\t\n\tif (msgLog.good())\n\t\tmsgLog << message << std::endl;\n\t\t\n\tmsgLog.close();\n}<|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n#include <LiquidCrystal_I2C.h>\n#include <Wire.h>\n#include <Motor.h>\n#include <Battery.h>\n#include <GasPedal.h>\n#include <Gear.h>\n#include <ExponentialSmoothing.h>\n#include \"settings.h\"\n\nMotor motor = Motor(PIN_ENABLE_R, PIN_PWM_R, PIN_ENABLE_L, PIN_PWM_L);\nGear gear = Gear(PIN_SWITCH_FORWARDS, PIN_SWITCH_BACKWARDS);\nGasPedal gas = GasPedal(PIN_GAS_PEDAL, GAS_VALUE_MIN, GAS_VALUE_MAX);\nBattery battery = Battery(PIN_BATTERY_VOLTAGE, BATTERY_READING_6V, BATTERY_READING_12V);\n\nExponentialSmoothing smoothGas = ExponentialSmoothing();\nExponentialSmoothing smoothBattery = ExponentialSmoothing();\n\nLiquidCrystal_I2C lcd(0x27, 16, 2);\n\nvoid setup() {\n\n Wire.begin();\n Serial.begin(115200);\n\n lcd.init();\n lcd.clear();\n lcd.backlight();\n\n lcd.setCursor(0, 0);\n}\n\nvoid updateDisplay() {\n lcd.setCursor(0, 0);\n lcd.print(\"Geschw: \");\n lcd.print(map(smoothGas.getValue(), 0, 255, 0, 100));\n lcd.print(\"% \");\n\n lcd.setCursor(0, 1);\n lcd.print(\"Bat: \");\n lcd.print(smoothBattery.getValue());\n lcd.print(\"V \");\n}\n\nvoid loop() {\n uint8_t speed = 0;\n uint8_t currentGas = gas.getValue();\n uint8_t currentBatteryVoltage = battery.getValue();\n\n \/\/ Different max speed, when driving backwards\n if (motor.isForwards()) {\n speed = map(smoothGas.getValue(), 0, 255, 0, SPEED_MAX_FORWARDS);\n } else {\n speed = map(smoothGas.getValue(), 0, 255, 0, SPEED_MAX_BACKWARDS);\n }\n\n Serial.print(\"Speed: \");\n Serial.println(speed);\n\n motor.setSpeed(speed);\n\n\n \/* TODO: Battery Protection\n while (smoothBattery.getValue() > 3 && smoothBattery.getValue() < 11.4) {\n motor.changeSpeed(0);\n delay(1000);\n }\n *\/\n\n \/\/ Does the gear doesn't match with the motor gear?\n if ((gear.isForwards() && !motor.isForwards()) ||\n (gear.isBackwards() && !motor.isBackwards())) {\n\n \/\/ Change gear only, if speed is below a configured speed\n if (speed < SPEED_MAX_DIRECTION_CHANGE) {\n motor.changeSpeed(0, SPEED_CHANGE_PACE_DEFAULT);\n motor.setDirection(gear.getGear());\n motor.changeSpeed(speed, SPEED_CHANGE_PACE_DEFAULT);\n }\n\n }\n\n gear.update();\n smoothGas.update(currentGas);\n smoothBattery.update(currentBatteryVoltage);\n\n updateDisplay();\n}\n<commit_msg>Change object initialization syntax<commit_after>#include <Arduino.h>\n#include <LiquidCrystal_I2C.h>\n#include <Wire.h>\n#include <Motor.h>\n#include <Battery.h>\n#include <GasPedal.h>\n#include <Gear.h>\n#include <ExponentialSmoothing.h>\n#include \"settings.h\"\n\nMotor motor(PIN_ENABLE_R, PIN_PWM_R, PIN_ENABLE_L, PIN_PWM_L);\nGear gear(PIN_SWITCH_FORWARDS, PIN_SWITCH_BACKWARDS);\nGasPedal gas(PIN_GAS_PEDAL, GAS_VALUE_MIN, GAS_VALUE_MAX);\nBattery battery(PIN_BATTERY_VOLTAGE, BATTERY_READING_6V, BATTERY_READING_12V);\n\nExponentialSmoothing smoothGas;\nExponentialSmoothing smoothBattery;\n\nLiquidCrystal_I2C lcd(0x27, 16, 2);\n\nvoid setup() {\n\n Wire.begin();\n Serial.begin(115200);\n\n lcd.init();\n lcd.clear();\n lcd.backlight();\n\n lcd.setCursor(0, 0);\n}\n\nvoid updateDisplay() {\n lcd.setCursor(0, 0);\n lcd.print(\"Geschw: \");\n lcd.print(map(smoothGas.getValue(), 0, 255, 0, 100));\n lcd.print(\"% \");\n\n lcd.setCursor(0, 1);\n lcd.print(\"Bat: \");\n lcd.print(smoothBattery.getValue());\n lcd.print(\"V \");\n}\n\nvoid loop() {\n uint8_t speed = 0;\n uint8_t currentGas = gas.getValue();\n uint8_t currentBatteryVoltage = battery.getValue();\n\n \/\/ Different max speed, when driving backwards\n if (motor.isForwards()) {\n speed = map(smoothGas.getValue(), 0, 255, 0, SPEED_MAX_FORWARDS);\n } else {\n speed = map(smoothGas.getValue(), 0, 255, 0, SPEED_MAX_BACKWARDS);\n }\n\n Serial.print(\"Speed: \");\n Serial.println(speed);\n\n motor.setSpeed(speed);\n\n\n \/* TODO: Battery Protection\n while (smoothBattery.getValue() > 3 && smoothBattery.getValue() < 11.4) {\n motor.changeSpeed(0);\n delay(1000);\n }\n *\/\n\n \/\/ Does the gear doesn't match with the motor gear?\n if ((gear.isForwards() && !motor.isForwards()) ||\n (gear.isBackwards() && !motor.isBackwards())) {\n\n \/\/ Change gear only, if speed is below a configured speed\n if (speed < SPEED_MAX_DIRECTION_CHANGE) {\n motor.changeSpeed(0, SPEED_CHANGE_PACE_DEFAULT);\n motor.setDirection(gear.getGear());\n motor.changeSpeed(speed, SPEED_CHANGE_PACE_DEFAULT);\n }\n\n }\n\n gear.update();\n smoothGas.update(currentGas);\n smoothBattery.update(currentBatteryVoltage);\n\n updateDisplay();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"math\/MatrixTransform.hpp\"\n#include \"math\/Ray.hpp\"\n#include \"math\/Sphere.hpp\"\n#include \"math\/TransformPair.hpp\"\n#include \"math\/mat.hpp\"\n#include \"math\/misc.hpp\"\n#include \"math\/vec.hpp\"\n#include \"Optional.hpp\"\n#include \"noncopyable.hpp\"\n\n#include \"materials\/Material.hpp\"\n#include \"materials\/TextureCheckerboard.hpp\"\n#include \"materials\/TextureSolid.hpp\"\n#include \"materials\/texture_mappings.hpp\"\n\n#include \"shapes\/SceneShape.hpp\"\n#include \"shapes\/ShapeSphere.hpp\"\n#include \"shapes\/ShapePlane.hpp\"\n\n#include \"output.hpp\"\n\n#include <algorithm>\n#include <limits>\n#include <memory>\n#include <vector>\n#include <random>\n#include <iostream>\n\nusing namespace yks;\n\nstruct Rng {\n\tstd::mt19937 engine;\n\tstd::uniform_real_distribution<float> canonical_distribution; \/\/ std::generate_canonical is broken in VS2013\n\n\tRng() {\n\t\tstatic const uint32_t seed_seq[] = {\n\t\t\t0x4587ba0e, 0xad01370f, 0xdd817882, 0xdc98c4aa,\n\t\t\t0x4cbf0235, 0x7dba82eb, 0xea593627, 0x597e5052\n\t\t};\n\t\tstd::seed_seq seq(std::begin(seed_seq), std::end(seed_seq));\n\t\tengine.seed(seq);\n\t}\n\n\tfloat canonical() {\n\t\treturn canonical_distribution(engine);\n\t}\n};\n\nstruct SceneObject {\n\tMaterial material;\n\tstd::unique_ptr<SceneShape> shape;\n\n\tSceneObject(Material material, std::unique_ptr<SceneShape>&& shape)\n\t\t: material(material), shape(std::move(shape))\n\t{}\n\n\tSceneObject(SceneObject&& o)\n\t\t: material(std::move(o.material)), shape(std::move(o.shape))\n\t{}\n\nprivate:\n\tNONCOPYABLE(SceneObject);\n};\n\nstruct LightSample {\n\tvec3 point;\n\tfloat pdf;\n};\n\nstruct SceneLight {\n\tvec3 origin;\n\tvec3 intensity;\n\tfloat radius;\n\n\t\/\/ Emittance = Power \/ Area = Power \/ (4*pi*radius^2)\n\t\/\/ Intensity = Emittance \/ (2*pi) = Power \/ (8*pi^2*radius^2)\n\tSceneLight(const vec3& origin, const vec3& total_power, float radius)\n\t\t: origin(origin), intensity(total_power * (1.0f \/ (8*pi*pi)) * (1.0f \/ sqr(radius))), radius(radius)\n\t{}\n\n\tLightSample samplePoint(Rng& rng) const {\n\t\tconst float a = rng.canonical();\n\t\tconst float b = rng.canonical();\n\t\treturn LightSample{\n\t\t\tuniform_point_on_sphere(a, b) * radius + origin,\n\t\t\t1.0f \/ (4.0f * pi * sqr(radius)),\n\t\t};\n\t}\n\n\tvec3 calcIntensity(const vec3& point, const vec3& direction) const {\n\t\treturn dot(point - origin, direction) >= 0.0f ? intensity : vec3_0;\n\t}\n};\n\nfloat focal_distance_from_fov(const float fov_degrees) {\n\tconst float half_fov = fov_degrees \/ 360.0f * pi;\n\treturn std::tan(0.5f*pi - half_fov);\n}\n\nstruct Camera {\n\tvec3 origin;\n\tmat3 orientation;\n\tfloat focal_length; \/\/ distance from image plane\n\n\tCamera(vec3 origin, mat3 orientation, float vertical_fov)\n\t\t: origin(origin), orientation(orientation), focal_length(focal_distance_from_fov(vertical_fov))\n\t{}\n\n\tRay createRay(const vec2 film_pos) const {\n\t\tconst vec3 cameraspace_ray = mvec3(film_pos[0], film_pos[1], focal_length);\n\t\treturn Ray{origin, orientation * cameraspace_ray};\n\t}\n};\n\nstruct Scene {\n\tCamera camera;\n\tstd::vector<SceneObject> objects;\n\tstd::vector<SceneLight> lights;\n\n\tScene(Camera camera)\n\t\t: camera(camera)\n\t{}\n\n\tScene(Scene&& o)\n\t\t: camera(std::move(o.camera)), objects(std::move(o.objects)), lights(std::move(o.lights))\n\t{}\n\nprivate:\n\tNONCOPYABLE(Scene);\n};\n\nScene setup_scene() {\n\tconst auto black = std::make_shared<TextureSolid>(vec3_0);\n\tconst auto white = std::make_shared<TextureSolid>(vec3_1);\n\tconst auto red = std::make_shared<TextureSolid>(vec3_x);\n\n\tScene s(Camera(vec3_y * 0.2, orient(vec3_y, -vec3_z), 75.0f));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(black, std::make_shared<TextureSolid>(1.0f, 0.4f, 0.4f)),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().translate(mvec3(0.0f, 0.0f, -5.0f)))\n\t\t));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(white, black),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().scale(0.25f).translate(mvec3(-0.5f, 1.5f, -3.0f)))\n\t\t));\n\n\tconst mat<2, 4> plane_tex_mapping = {{\n\t\t1, 0, 0, 0,\n\t\t0, 0, 1, 0\n\t}};\n\tconst auto checkerboard = std::make_shared<TextureCheckerboard>(white, red);\n\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(std::make_shared<TexMapFromPosition>(checkerboard, plane_tex_mapping), white),\n\t\tstd::make_unique<ShapePlane>(TransformPair().translate(vec3_y * -1.0f))\n\t\t));\n\n\ts.lights.push_back(SceneLight(mvec3(-2.0f, 4.0f, -4.0f), vec3_1 * 80, 0.25f));\n\n\treturn std::move(s);\n}\n\nstatic vec2 filmspace_from_screenspace(const vec2 screen_pos, const vec2 screen_size) {\n\treturn (screen_pos - (screen_size * 0.5f)) * 2.0f * (1.0f \/ screen_size[1]);\n}\n\nOptional<Intersection> find_nearest_intersection(const Scene& scene, const Ray ray) {\n\tOptional<Intersection> nearest_intersection;\n\n\tfor (const SceneObject& object : scene.objects) {\n\t\tconst Optional<Intersection> intersection = object.shape->intersect(ray);\n\t\tif (intersection && (!nearest_intersection || intersection->t < nearest_intersection->t)) {\n\t\t\tnearest_intersection = intersection;\n\t\t\tnearest_intersection->object = &object;\n\t\t\tnearest_intersection->shape = object.shape.get();\n\t\t}\n\t}\n\t\n\treturn nearest_intersection;\n}\n\nbool find_any_intersection(const Scene& scene, const Ray& ray, float max_t) {\n\tfor (const SceneObject& object : scene.objects) {\n\t\tif (object.shape->hasIntersection(ray, max_t)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nvec3 reflect(const vec3& l, const vec3& n) {\n\treturn l + 2*dot(n, -l) * n;\n}\n\nstatic const float RAY_EPSILON = 1e-6f;\n\nvec3 lambert_brdf(const vec3& albedo, const vec3& light_dir, const vec3& normal) {\n\treturn albedo * std::max(0.0f, dot(light_dir, normal));\n}\n\nvec3 calc_light_incidence(const Scene& scene, Rng& rng, const Ray& ray, int remaining_depth) {\n\tvec3 color = vec3_0;\n\n\tconst Optional<Intersection> surface_hit = find_nearest_intersection(scene, ray);\n\tif (surface_hit) {\n\t\tconst vec3 albedo = surface_hit->object->material.diffuse->getValue(*surface_hit);\n\n\t\tfor (const SceneLight& light : scene.lights) {\n\t\t\tconst int NUM_LIGHT_SAMPLES = 500;\n\t\t\tvec3 light_contribution = vec3_0;\n\n\t\t\tfor (int sample = 0; sample < NUM_LIGHT_SAMPLES; ++sample) {\n\t\t\t\tconst LightSample light_sample = light.samplePoint(rng);\n\t\t\t\tconst vec3 light_vec = light_sample.point - surface_hit->position;\n\n\t\t\t\tif (!find_any_intersection(scene, Ray{surface_hit->position + surface_hit->normal * RAY_EPSILON, light_vec}, 1.0f)) {\n\t\t\t\t\tconst vec3 reflectance = lambert_brdf(albedo, normalized(light_vec), surface_hit->normal);\n\t\t\t\t\tconst vec3 illuminance = light.calcIntensity(light_sample.point, -light_vec) * (1.0f \/ length_sqr(light_vec));\n\t\t\t\t\tlight_contribution += reflectance * illuminance * (1.0f \/ light_sample.pdf);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcolor += light_contribution * (1.0f \/ NUM_LIGHT_SAMPLES);\n\t\t}\n\n\t\tconst vec3 specular_reflectance = surface_hit->object->material.specular->getValue(*surface_hit);\n\t\tif (remaining_depth > 0 && specular_reflectance != vec3_0) {\n\t\t\tcolor += specular_reflectance * calc_light_incidence(scene, rng, Ray{surface_hit->position + surface_hit->normal * RAY_EPSILON, reflect(normalized(ray.direction), surface_hit->normal)}, remaining_depth-1);\n\t\t} else {\n\t\t\tcolor += specular_reflectance * 0.5f;\n\t\t}\n\t} else {\n\t\tcolor = vec3_0;\n\t}\n\n\treturn color;\n}\n\nint main(int, char* []) {\n\tstatic const int IMAGE_WIDTH = 640;\n\tstatic const int IMAGE_HEIGHT = 480;\n\tstd::vector<vec3> image_data(IMAGE_WIDTH * IMAGE_HEIGHT);\n\n\tconst Scene scene = setup_scene();\n\tRng rng;\n\n\tfor (int y = 0; y < IMAGE_HEIGHT; ++y) {\n\t\tfor (int x = 0; x < IMAGE_WIDTH; x++) {\n\t\t\tconst vec2 film_coord = filmspace_from_screenspace(mvec2(float(x), float(y)), mvec2(float(IMAGE_WIDTH), float(IMAGE_HEIGHT))) * mvec2(1.0f, -1.0f);\n\t\t\tconst Ray camera_ray = scene.camera.createRay(film_coord);\n\t\t\t\n\t\t\timage_data[y*IMAGE_WIDTH + x] = calc_light_incidence(scene, rng, camera_ray, 50);\n\t\t}\n\t\tstd::cout << (y * 100.0f \/ (IMAGE_HEIGHT-1)) << \"%\\n\";\n\t}\n\n\tsave_srgb_image(image_data, IMAGE_WIDTH, IMAGE_HEIGHT);\n}\n<commit_msg>Don't shoot shadow ray when reflectance is 0.<commit_after>#include \"math\/MatrixTransform.hpp\"\n#include \"math\/Ray.hpp\"\n#include \"math\/Sphere.hpp\"\n#include \"math\/TransformPair.hpp\"\n#include \"math\/mat.hpp\"\n#include \"math\/misc.hpp\"\n#include \"math\/vec.hpp\"\n#include \"Optional.hpp\"\n#include \"noncopyable.hpp\"\n\n#include \"materials\/Material.hpp\"\n#include \"materials\/TextureCheckerboard.hpp\"\n#include \"materials\/TextureSolid.hpp\"\n#include \"materials\/texture_mappings.hpp\"\n\n#include \"shapes\/SceneShape.hpp\"\n#include \"shapes\/ShapeSphere.hpp\"\n#include \"shapes\/ShapePlane.hpp\"\n\n#include \"output.hpp\"\n\n#include <algorithm>\n#include <limits>\n#include <memory>\n#include <vector>\n#include <random>\n#include <iostream>\n\nusing namespace yks;\n\nstruct Rng {\n\tstd::mt19937 engine;\n\tstd::uniform_real_distribution<float> canonical_distribution; \/\/ std::generate_canonical is broken in VS2013\n\n\tRng() {\n\t\tstatic const uint32_t seed_seq[] = {\n\t\t\t0x4587ba0e, 0xad01370f, 0xdd817882, 0xdc98c4aa,\n\t\t\t0x4cbf0235, 0x7dba82eb, 0xea593627, 0x597e5052\n\t\t};\n\t\tstd::seed_seq seq(std::begin(seed_seq), std::end(seed_seq));\n\t\tengine.seed(seq);\n\t}\n\n\tfloat canonical() {\n\t\treturn canonical_distribution(engine);\n\t}\n};\n\nstruct SceneObject {\n\tMaterial material;\n\tstd::unique_ptr<SceneShape> shape;\n\n\tSceneObject(Material material, std::unique_ptr<SceneShape>&& shape)\n\t\t: material(material), shape(std::move(shape))\n\t{}\n\n\tSceneObject(SceneObject&& o)\n\t\t: material(std::move(o.material)), shape(std::move(o.shape))\n\t{}\n\nprivate:\n\tNONCOPYABLE(SceneObject);\n};\n\nstruct LightSample {\n\tvec3 point;\n\tfloat pdf;\n};\n\nstruct SceneLight {\n\tvec3 origin;\n\tvec3 intensity;\n\tfloat radius;\n\n\t\/\/ Emittance = Power \/ Area = Power \/ (4*pi*radius^2)\n\t\/\/ Intensity = Emittance \/ (2*pi) = Power \/ (8*pi^2*radius^2)\n\tSceneLight(const vec3& origin, const vec3& total_power, float radius)\n\t\t: origin(origin), intensity(total_power * (1.0f \/ (8*pi*pi)) * (1.0f \/ sqr(radius))), radius(radius)\n\t{}\n\n\tLightSample samplePoint(Rng& rng) const {\n\t\tconst float a = rng.canonical();\n\t\tconst float b = rng.canonical();\n\t\treturn LightSample{\n\t\t\tuniform_point_on_sphere(a, b) * radius + origin,\n\t\t\t1.0f \/ (4.0f * pi * sqr(radius)),\n\t\t};\n\t}\n\n\tvec3 calcIntensity(const vec3& point, const vec3& direction) const {\n\t\treturn dot(point - origin, direction) >= 0.0f ? intensity : vec3_0;\n\t}\n};\n\nfloat focal_distance_from_fov(const float fov_degrees) {\n\tconst float half_fov = fov_degrees \/ 360.0f * pi;\n\treturn std::tan(0.5f*pi - half_fov);\n}\n\nstruct Camera {\n\tvec3 origin;\n\tmat3 orientation;\n\tfloat focal_length; \/\/ distance from image plane\n\n\tCamera(vec3 origin, mat3 orientation, float vertical_fov)\n\t\t: origin(origin), orientation(orientation), focal_length(focal_distance_from_fov(vertical_fov))\n\t{}\n\n\tRay createRay(const vec2 film_pos) const {\n\t\tconst vec3 cameraspace_ray = mvec3(film_pos[0], film_pos[1], focal_length);\n\t\treturn Ray{origin, orientation * cameraspace_ray};\n\t}\n};\n\nstruct Scene {\n\tCamera camera;\n\tstd::vector<SceneObject> objects;\n\tstd::vector<SceneLight> lights;\n\n\tScene(Camera camera)\n\t\t: camera(camera)\n\t{}\n\n\tScene(Scene&& o)\n\t\t: camera(std::move(o.camera)), objects(std::move(o.objects)), lights(std::move(o.lights))\n\t{}\n\nprivate:\n\tNONCOPYABLE(Scene);\n};\n\nScene setup_scene() {\n\tconst auto black = std::make_shared<TextureSolid>(vec3_0);\n\tconst auto white = std::make_shared<TextureSolid>(vec3_1);\n\tconst auto red = std::make_shared<TextureSolid>(vec3_x);\n\n\tScene s(Camera(vec3_y * 0.2, orient(vec3_y, -vec3_z), 75.0f));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(black, std::make_shared<TextureSolid>(1.0f, 0.4f, 0.4f)),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().translate(mvec3(0.0f, 0.0f, -5.0f)))\n\t\t));\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(white, black),\n\t\tstd::make_unique<ShapeSphere>(TransformPair().scale(0.25f).translate(mvec3(-0.5f, 1.5f, -3.0f)))\n\t\t));\n\n\tconst mat<2, 4> plane_tex_mapping = {{\n\t\t1, 0, 0, 0,\n\t\t0, 0, 1, 0\n\t}};\n\tconst auto checkerboard = std::make_shared<TextureCheckerboard>(white, red);\n\n\ts.objects.push_back(SceneObject(\n\t\tMaterial(std::make_shared<TexMapFromPosition>(checkerboard, plane_tex_mapping), white),\n\t\tstd::make_unique<ShapePlane>(TransformPair().translate(vec3_y * -1.0f))\n\t\t));\n\n\ts.lights.push_back(SceneLight(mvec3(-2.0f, 4.0f, -4.0f), vec3_1 * 80, 0.25f));\n\n\treturn std::move(s);\n}\n\nstatic vec2 filmspace_from_screenspace(const vec2 screen_pos, const vec2 screen_size) {\n\treturn (screen_pos - (screen_size * 0.5f)) * 2.0f * (1.0f \/ screen_size[1]);\n}\n\nOptional<Intersection> find_nearest_intersection(const Scene& scene, const Ray ray) {\n\tOptional<Intersection> nearest_intersection;\n\n\tfor (const SceneObject& object : scene.objects) {\n\t\tconst Optional<Intersection> intersection = object.shape->intersect(ray);\n\t\tif (intersection && (!nearest_intersection || intersection->t < nearest_intersection->t)) {\n\t\t\tnearest_intersection = intersection;\n\t\t\tnearest_intersection->object = &object;\n\t\t\tnearest_intersection->shape = object.shape.get();\n\t\t}\n\t}\n\t\n\treturn nearest_intersection;\n}\n\nbool find_any_intersection(const Scene& scene, const Ray& ray, float max_t) {\n\tfor (const SceneObject& object : scene.objects) {\n\t\tif (object.shape->hasIntersection(ray, max_t)) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nvec3 reflect(const vec3& l, const vec3& n) {\n\treturn l + 2*dot(n, -l) * n;\n}\n\nstatic const float RAY_EPSILON = 1e-6f;\n\nvec3 calc_light_incidence(const Scene& scene, Rng& rng, const Ray& ray, int remaining_depth) {\n\tvec3 color = vec3_0;\n\n\tconst Optional<Intersection> surface_hit = find_nearest_intersection(scene, ray);\n\tif (surface_hit) {\n\t\tconst vec3 albedo = surface_hit->object->material.diffuse->getValue(*surface_hit);\n\n\t\tfor (const SceneLight& light : scene.lights) {\n\t\t\tconst int NUM_LIGHT_SAMPLES = 500;\n\t\t\tvec3 light_contribution = vec3_0;\n\n\t\t\tfor (int sample = 0; sample < NUM_LIGHT_SAMPLES; ++sample) {\n\t\t\t\tconst LightSample light_sample = light.samplePoint(rng);\n\t\t\t\tconst vec3 light_vec = light_sample.point - surface_hit->position;\n\t\t\t\tconst vec3 light_dir = normalized(light_vec);\n\n\t\t\t\tconst vec3 reflectance = albedo;\n\n\t\t\t\tif (reflectance != vec3_0 && !find_any_intersection(scene, Ray{surface_hit->position + surface_hit->normal * RAY_EPSILON, light_vec}, 1.0f)) {\n\t\t\t\t\tconst vec3 illuminance = light.calcIntensity(light_sample.point, -light_vec) * (1.0f \/ length_sqr(light_vec));\n\t\t\t\t\tlight_contribution += reflectance * illuminance * std::max(0.0f, dot(light_dir, surface_hit->normal)) * (1.0f \/ light_sample.pdf);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcolor += light_contribution * (1.0f \/ NUM_LIGHT_SAMPLES);\n\t\t}\n\n\t\tconst vec3 specular_reflectance = surface_hit->object->material.specular->getValue(*surface_hit);\n\t\tif (remaining_depth > 0 && specular_reflectance != vec3_0) {\n\t\t\tcolor += specular_reflectance * calc_light_incidence(scene, rng, Ray{surface_hit->position + surface_hit->normal * RAY_EPSILON, reflect(normalized(ray.direction), surface_hit->normal)}, remaining_depth-1);\n\t\t} else {\n\t\t\tcolor += specular_reflectance * 0.5f;\n\t\t}\n\t} else {\n\t\tcolor = vec3_0;\n\t}\n\n\treturn color;\n}\n\nint main(int, char* []) {\n\tstatic const int IMAGE_WIDTH = 640;\n\tstatic const int IMAGE_HEIGHT = 480;\n\tstd::vector<vec3> image_data(IMAGE_WIDTH * IMAGE_HEIGHT);\n\n\tconst Scene scene = setup_scene();\n\tRng rng;\n\n\tfor (int y = 0; y < IMAGE_HEIGHT; ++y) {\n\t\tfor (int x = 0; x < IMAGE_WIDTH; x++) {\n\t\t\tconst vec2 film_coord = filmspace_from_screenspace(mvec2(float(x), float(y)), mvec2(float(IMAGE_WIDTH), float(IMAGE_HEIGHT))) * mvec2(1.0f, -1.0f);\n\t\t\tconst Ray camera_ray = scene.camera.createRay(film_coord);\n\t\t\t\n\t\t\timage_data[y*IMAGE_WIDTH + x] = calc_light_incidence(scene, rng, camera_ray, 50);\n\t\t}\n\t\tstd::cout << (y * 100.0f \/ (IMAGE_HEIGHT-1)) << \"%\\n\";\n\t}\n\n\tsave_srgb_image(image_data, IMAGE_WIDTH, IMAGE_HEIGHT);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/this is our main file\n\/\/ testing\n#include <unistd.h>\n#include <stdio.h>\n#include <vector>\n#include <iostream>\n#include <boost\/tokenizer.hpp>\n#include <string>\nusing namespace std;\nint main()\n{\n\tchar hostname[150];\n\tgethostname(hostname, sizeof hostname);\n\n\tvector<string> parse;\n\tstring str;\n\tcout << getlogin() << \"@\" << hostname << \"$ \";\n\t\/\/cout << \"$\";\n\tgetline(cin, str);\n\tcout << endl;\n\twhile(str != \"exit\")\n\t{\n\t\ttypedef boost::tokenizer<boost::char_separator<char> > Tok;\n\t\tboost::char_separator<char> sep(\"\", \"|&#;\");\n\t\tTok tok(str, sep);\n\t\tfor(Tok::iterator tok_iter = tok.begin(); tok_iter != tok.end(); ++tok_iter)\n\t\t{\n\t\t\tparse.push_back(*tok_iter);\n\t\t}\n\t\t\/\/do class work here\n\t\tparse.clear();\n\t\tcout << getlogin() << \"@\" << hostname << \"$ \";\n\t\t\/\/cout << \"$\";\n\t\tgetline(cin, str);\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>added the execute function<commit_after>\/\/this is our main file\n\/\/ testing\n#include <unistd.h>\n#include <stdio.h>\n#include <vector>\n#include <iostream>\n#include <boost\/tokenizer.hpp>\n#include <string>\nusing namespace std;\n\nvoid execute(string command, bool &pass) {\n\tint pos = command.find(\" \");\n\tstring c1 = command.substr(pos);\n\tstring c0 = command.substr(0, pos);\n\n\tvector<char *> v;\n\tv.push_back(c0);\n\tv.push_back(c1);\n\n\tchar **cmd = &v[0];\n\tint status = execvp( v[0], cmd);\n\tif (status == -1 ) {\n\t\tpass = false;\n\t}\n\telse {\n\t\tpass = true;\n\t}\n}\n\nint main()\n{\n\tchar hostname[150];\n\tgethostname(hostname, sizeof hostname);\n\n\tvector<string> parse;\n\tstring str;\n\tcout << getlogin() << \"@\" << hostname << \"$ \";\n\t\/\/cout << \"$\";\n\tgetline(cin, str);\n\tcout << endl;\n\twhile(str != \"exit\")\n\t{\n\t\ttypedef boost::tokenizer<boost::char_separator<char> > Tok;\n\t\tboost::char_separator<char> sep(\"\", \"|&#;\");\n\t\tTok tok(str, sep);\n\t\tfor(Tok::iterator tok_iter = tok.begin(); tok_iter != tok.end(); ++tok_iter)\n\t\t{\n\t\t\tparse.push_back(*tok_iter);\n\t\t}\n\t\t\/\/do class work here\n\t\tparse.clear();\n\t\tcout << getlogin() << \"@\" << hostname << \"$ \";\n\t\t\/\/cout << \"$\";\n\t\tgetline(cin, str);\n\t\tcout << endl;\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <Rcpp.h>\n#include \"misc.h\"\nusing namespace Rcpp;\n\n\/\/------------------------------------------------\n\/\/ define very small number for catching underflow problems\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ basic sum over elements in a vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ mean of vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ add two numbers together in log space. One number (but not both) is allowed to be -inf.\ndouble logSum(double logA, double logB) {\n if (logA-logB > 100) {\n return(logA);\n } else if (logB-logA > 100) {\n return(logB);\n }\n double output = (logA<logB) ? logB + log(1+exp(logA-logB)) : logA + log(1+exp(logB-logA));\n return(output);\n}\n\n\/\/------------------------------------------------\n\/\/ helper function for printing a single value (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a matrix (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a 3D array (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ force exits R, which has the advantage that windows will appear automatically on re-opening\n\/\/ [[Rcpp::export]]\nvoid exit_cpp() {\n exit(0);\n}<commit_msg>added lines at end of headers<commit_after>\n#include <Rcpp.h>\n#include \"misc.h\"\nusing namespace Rcpp;\n\n\/\/------------------------------------------------\n\/\/ define very small number for catching underflow problems\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ basic sum over elements in a vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ mean of vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ add two numbers together in log space. One number (but not both) is allowed to be -inf.\ndouble logSum(double logA, double logB) {\n if (logA-logB > 100) {\n return(logA);\n } else if (logB-logA > 100) {\n return(logB);\n }\n double output = (logA<logB) ? logB + log(1+exp(logA-logB)) : logA + log(1+exp(logB-logA));\n return(output);\n}\n\n\/\/------------------------------------------------\n\/\/ helper function for printing a single value (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a vector (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a matrix (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ helper function for printing contents of a 3D array (templated for different data types)\n\/\/ DEFINED IN HEADER\n\n\/\/------------------------------------------------\n\/\/ force exits R, which has the advantage that windows will appear automatically on re-opening\n\/\/ [[Rcpp::export]]\nvoid exit_cpp() {\n exit(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2003 Daniel Wallin and Arvid Norberg\n\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF\n\/\/ ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\n\/\/ TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\/\/ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR\n\/\/ ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n\/\/ OR OTHER DEALINGS IN THE SOFTWARE.\n\n#define LUABIND_BUILDING\n\n#include <luabind\/lua_include.hpp>\n\n#include <luabind\/class.hpp>\n#include <luabind\/get_main_thread.hpp>\n#include <luabind\/set_package_preload.hpp>\n#include <luabind\/function_introspection.hpp>\n#include <luabind\/detail\/garbage_collector.hpp>\n\nnamespace luabind {\n\nnamespace\n{\n\n int make_property(lua_State* L)\n {\n int args = lua_gettop(L);\n\n if (args == 0 || args > 2)\n {\n lua_pushstring(L, \"make_property() called with wrong number of arguments.\");\n lua_error(L);\n }\n\n if (args == 1)\n lua_pushnil(L);\n\n lua_pushcclosure(L, &detail::property_tag, 2);\n return 1;\n }\n\n int main_thread_tag;\n\n int deprecated_super(lua_State* L)\n {\n lua_pushstring(L,\n \"DEPRECATION: 'super' has been deprecated in favor of \"\n \"directly calling the base class __init() function. \"\n \"This error can be disabled by calling 'luabind::disable_super_deprecation()'.\"\n );\n lua_error(L);\n\n return 0;\n }\n\n} \/\/ namespace unnamed\n\n LUABIND_API lua_State* get_main_thread(lua_State* L)\n {\n lua_pushlightuserdata(L, &main_thread_tag);\n lua_rawget(L, LUA_REGISTRYINDEX);\n lua_State* result = static_cast<lua_State*>(lua_touserdata(L, -1));\n lua_pop(L, 1);\n\n if (!result)\n throw std::runtime_error(\"Unable to get main thread, luabind::open() not called?\");\n\n return result;\n }\n namespace {\n template<typename T>\n inline void * shared_create_userdata(lua_State* L, const char * name) {\n lua_pushstring(L, name);\n void* storage = lua_newuserdata(L, sizeof(T));\n\n \/\/ set gc metatable\n lua_newtable(L);\n lua_pushcclosure(L, &detail::garbage_collector<T>, 0);\n lua_setfield(L, -2, \"__gc\");\n lua_setmetatable(L, -2);\n\n lua_settable(L, LUA_REGISTRYINDEX);\n return storage;\n }\n\n template<typename T>\n inline void createGarbageCollectedRegistryUserdata(lua_State* L, const char * name) {\n void * storage = shared_create_userdata<T>(L, name);\n \/\/ placement \"new\"\n new (storage) T;\n }\n\n template<typename T, typename A1>\n inline void createGarbageCollectedRegistryUserdata(lua_State* L, const char * name, A1 constructorArg) {\n void * storage = shared_create_userdata<T>(L, name);\n\n \/\/ placement \"new\"\n new (storage) T(constructorArg);\n }\n }\n\n LUABIND_API void open(lua_State* L)\n {\n bool is_main_thread = lua_pushthread(L) == 1;\n lua_pop(L, 1);\n\n if (!is_main_thread)\n {\n throw std::runtime_error(\n \"luabind::open() must be called with the main thread \"\n \"lua_State*\"\n );\n }\n\n createGarbageCollectedRegistryUserdata<detail::class_registry>(L, \"__luabind_classes\", L);\n createGarbageCollectedRegistryUserdata<detail::class_id_map>(L, \"__luabind_class_id_map\");\n createGarbageCollectedRegistryUserdata<detail::cast_graph>(L, \"__luabind_cast_graph\");\n createGarbageCollectedRegistryUserdata<detail::class_map>(L, \"__luabind_class_map\");\n\n \/\/ add functions (class, cast etc...)\n lua_pushcclosure(L, detail::create_class::stage1, 0);\n lua_setglobal(L, \"class\");\n\n lua_pushcclosure(L, &make_property, 0);\n lua_setglobal(L, \"property\");\n\n lua_pushlightuserdata(L, &main_thread_tag);\n lua_pushlightuserdata(L, L);\n lua_rawset(L, LUA_REGISTRYINDEX);\n\n lua_pushcclosure(L, &deprecated_super, 0);\n lua_setglobal(L, \"super\");\n\n set_package_preload(L, \"luabind.function_introspection\", &bind_function_introspection);\n }\n\n} \/\/ namespace luabind\n\n<commit_msg>Update open.cpp<commit_after>\/\/ Copyright (c) 2003 Daniel Wallin and Arvid Norberg\n\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a\n\/\/ copy of this software and associated documentation files (the \"Software\"),\n\/\/ to deal in the Software without restriction, including without limitation\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense,\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the\n\/\/ Software is furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be included\n\/\/ in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF\n\/\/ ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED\n\/\/ TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A\n\/\/ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT\n\/\/ SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR\n\/\/ ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n\/\/ OR OTHER DEALINGS IN THE SOFTWARE.\n\n#define LUABIND_BUILDING\n\n#include <luabind\/lua_include.hpp>\n\n#include <luabind\/class.hpp>\n#include <luabind\/get_main_thread.hpp>\n#include <luabind\/set_package_preload.hpp>\n#include <luabind\/function_introspection.hpp>\n#include <luabind\/detail\/garbage_collector.hpp>\n\nnamespace luabind {\n\nnamespace\n{\n\n int make_property(lua_State* L)\n {\n int args = lua_gettop(L);\n\n if (args == 0 || args > 2)\n {\n lua_pushstring(L, \"make_property() called with wrong number of arguments.\");\n lua_error(L);\n }\n\n if (args == 1)\n lua_pushnil(L);\n\n lua_pushcclosure(L, &detail::property_tag, 2);\n return 1;\n }\n\n int main_thread_tag;\n\n int deprecated_super(lua_State* L)\n {\n lua_pushstring(L,\n \"DEPRECATION: 'super' has been deprecated in favor of \"\n \"directly calling the base class __init() function. \"\n \"This error can be disabled by calling 'luabind::disable_super_deprecation()'.\"\n );\n lua_error(L);\n\n return 0;\n }\n\n} \/\/ namespace unnamed\n\n LUABIND_API lua_State* get_main_thread(lua_State* L)\n {\n lua_pushlightuserdata(L, &main_thread_tag);\n lua_rawget(L, LUA_REGISTRYINDEX);\n lua_State* result = static_cast<lua_State*>(lua_touserdata(L, -1));\n lua_pop(L, 1);\n\n if (!result)\n throw std::runtime_error(\"Unable to get main thread, luabind::open() not called?\");\n\n return result;\n }\n namespace {\n template<typename T>\n inline void * shared_create_userdata(lua_State* L, const char * name) {\n lua_pushstring(L, name);\n void* storage = lua_newuserdata(L, sizeof(T));\n\n \/\/ set gc metatable\n lua_newtable(L);\n lua_pushcclosure(L, &detail::garbage_collector<T>, 0);\n lua_setfield(L, -2, \"__gc\");\n lua_setmetatable(L, -2);\n\n lua_settable(L, LUA_REGISTRYINDEX);\n return storage;\n }\n\n template<typename T>\n inline void createGarbageCollectedRegistryUserdata(lua_State* L, const char * name) {\n void * storage = shared_create_userdata<T>(L, name);\n \/\/ placement \"new\"\n new (storage) T;\n }\n\n template<typename T, typename A1>\n inline void createGarbageCollectedRegistryUserdata(lua_State* L, const char * name, A1 constructorArg) {\n void * storage = shared_create_userdata<T>(L, name);\n\n \/\/ placement \"new\"\n new (storage) T(constructorArg);\n }\n }\n\n LUABIND_API void open(lua_State* L)\n {\n bool is_main_thread = lua_pushthread(L) == 1;\n lua_pop(L, 1);\n\n if (!is_main_thread)\n {\n throw std::runtime_error(\n \"luabind::open() must be called with the main thread \"\n \"lua_State*\"\n );\n }\n\n createGarbageCollectedRegistryUserdata<detail::class_registry>(L, \"__luabind_classes\", L);\n createGarbageCollectedRegistryUserdata<detail::class_id_map>(L, \"__luabind_class_id_map\");\n createGarbageCollectedRegistryUserdata<detail::cast_graph>(L, \"__luabind_cast_graph\");\n createGarbageCollectedRegistryUserdata<detail::class_map>(L, \"__luabind_class_map\");\n\n \/\/ add functions (class, cast etc...)\n lua_pushcclosure(L, detail::create_class::stage1, 0);\n lua_setglobal(L, \"class\");\n\n lua_pushcclosure(L, &make_property, 0);\n lua_setglobal(L, \"property\");\n\n lua_pushlightuserdata(L, &main_thread_tag);\n lua_pushlightuserdata(L, L);\n lua_rawset(L, LUA_REGISTRYINDEX);\n\n lua_pushcclosure(L, &deprecated_super, 0);\n lua_setglobal(L, \"super\");\n\n \/\/set_package_preload(L, \"luabind.function_introspection\", &bind_function_introspection);\n }\n\n} \/\/ namespace luabind\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef CONFIG_HPP\r\n#define CONFIG_HPP\r\n\r\n#include \"string_tree.hpp\"\r\n#include \"stringify.hpp\"\r\n#include \"signal.hpp\"\r\n#include <sstream>\r\n\r\nnamespace config {\r\n namespace impl {\r\n template<typename T>\r\n using is_configurable = std::integral_constant<bool,\r\n ctl::has_left_shift<std::ostream, T>::value &&\r\n ctl::has_right_shift<std::istream, T>::value\r\n >;\r\n }\r\n\r\n \/\/\/ Holds all the configurable parameters of the game.\r\n \/** The configurable parameters are arranged in a tree, for clarity and (hopefully) faster\r\n traversal. For example :\r\n\r\n graphics\r\n resolution\r\n fullscreen\r\n vsync\r\n window\r\n dimensions\r\n position\r\n ui\r\n textsize\r\n locale\r\n\r\n In this tree, \"graphics\", \"window\" and \"ui\" are branches, in the sense that they do not\r\n contain any value by themselves, but lead to other parameters. All the other items are\r\n called \"leaves\" : they hold a single parameter value.\r\n\r\n Also note that, for a new parameter to be created, its associated C++ type T must be\r\n \"configurable\", that is there must exist a specialization of string::stringify for T. This\r\n specialization must provide two static functions :\r\n\r\n \\code{.cpp}\r\n bool string::stringify<T>::parse(T& t, const std::string& value);\r\n void string::stringify<T>::serialize(const T& t, std::string& value);\r\n \\endcode\r\n\r\n \"parse\" tries to read out a value from \"value\" (it must return false if it fails to do so)\r\n and store it in t, and \"parse\" does the opposite. There is a default implementation that\r\n uses string conversion via standard string streams, so if a type provides both the >> and <<\r\n iostream operators, it is \"configurable\" by default.\r\n **\/\r\n class state {\r\n public :\r\n \/\/\/ Default constructor.\r\n \/** Constructs an empty configuration state, no data is loaded.\r\n **\/\r\n state();\r\n\r\n state(const state&) = delete;\r\n state(state&&) = default;\r\n state& operator= (const state&) = delete;\r\n state& operator= (state&&) = default;\r\n\r\n \/\/\/ Read a plain text configuration file and load its values.\r\n \/** The configuration file is a succession of lines, each containing a single configuration\r\n value. A line is made of:\r\n - the name of the parameter (ex: \"graphics.resolution\")\r\n - the value of the parameter enclosed in parenthesis (ex: \"(800, 600)\")\r\n **\/\r\n void parse(const std::string& file);\r\n\r\n \/\/\/ Save the current configuration in a plain text file.\r\n \/** If any, all the content of this file is erased before the new configuration is written.\r\n For more information on the file format, see parse().\r\n **\/\r\n void save(const std::string& file) const;\r\n\r\n \/\/\/ Remove all configuration items and bonds.\r\n void clear();\r\n\r\n \/\/\/ Set the value of a parameter.\r\n \/** If the parameter already exists, then its value is updated and all bound objects are\r\n notified of the change (only if the value is different than the previous one). Else, the\r\n parameter is created. This function will throw if the current tree structure is not\r\n compatible with the provided parameter name.\r\n **\/\r\n template<typename T>\r\n void set_value(const std::string& name, const T& value) {\r\n config_node& node = tree_.reach(name);\r\n if (!node.is_empty) {\r\n std::string old_value = node.value;\r\n string::stringify<T>::serialize(value, node.value);\r\n if (node.value != old_value) {\r\n node.signal.dispatch(node.value);\r\n dirty_ = true;\r\n }\r\n } else {\r\n string::stringify<T>::serialize(value, node.value);\r\n node.is_empty = false;\r\n dirty_ = true;\r\n }\r\n }\r\n\r\n \/\/\/ Retrieve a the value from this configuration state.\r\n \/** If the parameter exists, then its value is written in \"value\", and 'true' is returned.\r\n Else 'false' is returned.\r\n **\/\r\n template<typename T>\r\n bool get_value(const std::string& name, T& value) const {\r\n const config_node* node = tree_.try_reach(name);\r\n if (!node || node->is_empty) {\r\n return false;\r\n }\r\n\r\n return string::stringify<T>::parse(value, node->value);\r\n }\r\n\r\n \/\/\/ Retrieve a the value from this configuration state with a default value.\r\n \/** If the parameter exists, then its value is written in \"value\", and 'true' is returned.\r\n Else, the default value is stored in the configuration tree, and deserialized into\r\n \"value\". This function will return 'false' only if the deserialization fails, and will\r\n throw if the tree structure is incompatible with the provided name.\r\n **\/\r\n template<typename T, typename N>\r\n bool get_value(const std::string& name, T& value, const N& def) {\r\n config_node& node = tree_.reach(name);\r\n if (node.is_empty) {\r\n string::stringify<N>::serialize(def, node.value);\r\n node.is_empty = false;\r\n dirty_ = true;\r\n }\r\n\r\n return string::stringify<T>::parse(value, node.value);\r\n }\r\n\r\n \/\/\/ Check if a parameter exists.\r\n bool value_exists(const std::string& name) const {\r\n return tree_.try_reach(name) != nullptr;\r\n }\r\n\r\n \/\/\/ Bind a variable to a configurable parameter.\r\n \/** Using this method, one can bind a C++ variable to a parameter in this configuration\r\n state. When the value of the parameter changes, this variable is automatically updated.\r\n This function will throw if the current tree structure is not compatible with the\r\n provided parameter name.\r\n **\/\r\n template<typename T>\r\n signal_connection_base& bind(const std::string& name, T& var) {\r\n static_assert(impl::is_configurable<T>::value,\r\n \"bound variable must be configurable\");\r\n\r\n config_node& node = tree_.reach(name);\r\n signal_connection_base& sc = node.signal.connect([&var](const std::string& value) {\r\n string::stringify<T>::parse(var, value);\r\n });\r\n\r\n if (node.is_empty) {\r\n string::stringify<T>::serialize(var, node.value);\r\n node.is_empty = false;\r\n dirty_ = true;\r\n } else {\r\n string::stringify<T>::parse(var, node.value);\r\n }\r\n\r\n return sc;\r\n }\r\n\r\n \/\/\/ Bind a callback function to a configurable parameter.\r\n \/** This method can be used to register a callback function that will be executed each time\r\n the bound parameter is modified. This callback function is a functor, and can only take\r\n a single configurable argument. This function will throw if the current tree structure\r\n is not compatible with the provided parameter name.\r\n **\/\r\n template<typename F, typename enable =\r\n typename std::enable_if<!impl::is_configurable<F>::value>::type>\r\n signal_connection_base& bind(const std::string& name, F&& func) {\r\n static_assert(ctl::argument_count<F>::value == 1,\r\n \"configuration callback can only take one argument\");\r\n using ArgType = typename std::decay<ctl::functor_argument<F>>::type;\r\n static_assert(impl::is_configurable<ArgType>::value,\r\n \"configuration callback argument must be configurable\");\r\n\r\n config_node& node = tree_.reach(name);\r\n signal_connection_base& sc = node.signal.connect([func](const std::string& value) {\r\n ArgType t;\r\n if (string::stringify<ArgType>::parse(t, value)) {\r\n func(t);\r\n }\r\n });\r\n\r\n if (!node.is_empty) {\r\n ArgType t;\r\n if (string::stringify<ArgType>::parse(t, node.value)) {\r\n func(t);\r\n }\r\n }\r\n\r\n return sc;\r\n }\r\n\r\n \/\/\/ Bind a callback function to a configurable parameter with a default value.\r\n \/** See the other bind() methods for a detailed description. This overloaded version also\r\n takes a default value that will be saved then fed to the callback function if the\r\n parameter does not yet exist.\r\n **\/\r\n template<typename F, typename N, typename enable =\r\n typename std::enable_if<!impl::is_configurable<F>::value>::type>\r\n signal_connection_base& bind(const std::string& name, F&& func, const N& def) {\r\n static_assert(ctl::argument_count<F>::value == 1,\r\n \"configuration callback can only take one argument\");\r\n using ArgType = typename std::decay<ctl::functor_argument<F>>::type;\r\n static_assert(impl::is_configurable<ArgType>::value,\r\n \"configuration callback argument must be configurable\");\r\n\r\n config_node& node = tree_.reach(name);\r\n signal_connection_base& sc = node.signal.connect([func](const std::string& value) {\r\n ArgType t;\r\n if (string::stringify<ArgType>::parse(t, value)) {\r\n func(t);\r\n }\r\n });\r\n\r\n if (node.is_empty) {\r\n string::stringify<N>::serialize(def, node.value);\r\n node.signal.dispatch(node.value);\r\n node.is_empty = false;\r\n dirty_ = true;\r\n } else {\r\n ArgType t;\r\n if (string::stringify<ArgType>::parse(t, node.value)) {\r\n func(t);\r\n }\r\n }\r\n\r\n return sc;\r\n }\r\n\r\n private :\r\n struct config_node {\r\n std::string value;\r\n bool is_empty = true;\r\n signal_t<void(const std::string&)> signal;\r\n };\r\n\r\n void save_node_(std::ofstream& f, const ctl::string_tree<config_node>::branch& node,\r\n const std::string& name) const;\r\n\r\n ctl::string_tree<config_node> tree_;\r\n mutable bool dirty_;\r\n };\r\n}\r\n\r\n#endif\r\n<commit_msg>Convert config.hpp to linux line endings.<commit_after>#ifndef CONFIG_HPP\n#define CONFIG_HPP\n\n#include \"string_tree.hpp\"\n#include \"stringify.hpp\"\n#include \"signal.hpp\"\n#include <sstream>\n\nnamespace config {\n namespace impl {\n template<typename T>\n using is_configurable = std::integral_constant<bool,\n ctl::has_left_shift<std::ostream, T>::value &&\n ctl::has_right_shift<std::istream, T>::value\n >;\n }\n\n \/\/\/ Holds all the configurable parameters of the game.\n \/** The configurable parameters are arranged in a tree, for clarity and (hopefully) faster\n traversal. For example :\n\n graphics\n resolution\n fullscreen\n vsync\n window\n dimensions\n position\n ui\n textsize\n locale\n\n In this tree, \"graphics\", \"window\" and \"ui\" are branches, in the sense that they do not\n contain any value by themselves, but lead to other parameters. All the other items are\n called \"leaves\" : they hold a single parameter value.\n\n Also note that, for a new parameter to be created, its associated C++ type T must be\n \"configurable\", that is there must exist a specialization of string::stringify for T. This\n specialization must provide two static functions :\n\n \\code{.cpp}\n bool string::stringify<T>::parse(T& t, const std::string& value);\n void string::stringify<T>::serialize(const T& t, std::string& value);\n \\endcode\n\n \"parse\" tries to read out a value from \"value\" (it must return false if it fails to do so)\n and store it in t, and \"parse\" does the opposite. There is a default implementation that\n uses string conversion via standard string streams, so if a type provides both the >> and <<\n iostream operators, it is \"configurable\" by default.\n **\/\n class state {\n public :\n \/\/\/ Default constructor.\n \/** Constructs an empty configuration state, no data is loaded.\n **\/\n state();\n\n state(const state&) = delete;\n state(state&&) = default;\n state& operator= (const state&) = delete;\n state& operator= (state&&) = default;\n\n \/\/\/ Read a plain text configuration file and load its values.\n \/** The configuration file is a succession of lines, each containing a single configuration\n value. A line is made of:\n - the name of the parameter (ex: \"graphics.resolution\")\n - the value of the parameter enclosed in parenthesis (ex: \"(800, 600)\")\n **\/\n void parse(const std::string& file);\n\n \/\/\/ Save the current configuration in a plain text file.\n \/** If any, all the content of this file is erased before the new configuration is written.\n For more information on the file format, see parse().\n **\/\n void save(const std::string& file) const;\n\n \/\/\/ Remove all configuration items and bonds.\n void clear();\n\n \/\/\/ Set the value of a parameter.\n \/** If the parameter already exists, then its value is updated and all bound objects are\n notified of the change (only if the value is different than the previous one). Else, the\n parameter is created. This function will throw if the current tree structure is not\n compatible with the provided parameter name.\n **\/\n template<typename T>\n void set_value(const std::string& name, const T& value) {\n config_node& node = tree_.reach(name);\n if (!node.is_empty) {\n std::string old_value = node.value;\n string::stringify<T>::serialize(value, node.value);\n if (node.value != old_value) {\n node.signal.dispatch(node.value);\n dirty_ = true;\n }\n } else {\n string::stringify<T>::serialize(value, node.value);\n node.is_empty = false;\n dirty_ = true;\n }\n }\n\n \/\/\/ Retrieve a the value from this configuration state.\n \/** If the parameter exists, then its value is written in \"value\", and 'true' is returned.\n Else 'false' is returned.\n **\/\n template<typename T>\n bool get_value(const std::string& name, T& value) const {\n const config_node* node = tree_.try_reach(name);\n if (!node || node->is_empty) {\n return false;\n }\n\n return string::stringify<T>::parse(value, node->value);\n }\n\n \/\/\/ Retrieve a the value from this configuration state with a default value.\n \/** If the parameter exists, then its value is written in \"value\", and 'true' is returned.\n Else, the default value is stored in the configuration tree, and deserialized into\n \"value\". This function will return 'false' only if the deserialization fails, and will\n throw if the tree structure is incompatible with the provided name.\n **\/\n template<typename T, typename N>\n bool get_value(const std::string& name, T& value, const N& def) {\n config_node& node = tree_.reach(name);\n if (node.is_empty) {\n string::stringify<N>::serialize(def, node.value);\n node.is_empty = false;\n dirty_ = true;\n }\n\n return string::stringify<T>::parse(value, node.value);\n }\n\n \/\/\/ Check if a parameter exists.\n bool value_exists(const std::string& name) const {\n return tree_.try_reach(name) != nullptr;\n }\n\n \/\/\/ Bind a variable to a configurable parameter.\n \/** Using this method, one can bind a C++ variable to a parameter in this configuration\n state. When the value of the parameter changes, this variable is automatically updated.\n This function will throw if the current tree structure is not compatible with the\n provided parameter name.\n **\/\n template<typename T>\n signal_connection_base& bind(const std::string& name, T& var) {\n static_assert(impl::is_configurable<T>::value,\n \"bound variable must be configurable\");\n\n config_node& node = tree_.reach(name);\n signal_connection_base& sc = node.signal.connect([&var](const std::string& value) {\n string::stringify<T>::parse(var, value);\n });\n\n if (node.is_empty) {\n string::stringify<T>::serialize(var, node.value);\n node.is_empty = false;\n dirty_ = true;\n } else {\n string::stringify<T>::parse(var, node.value);\n }\n\n return sc;\n }\n\n \/\/\/ Bind a callback function to a configurable parameter.\n \/** This method can be used to register a callback function that will be executed each time\n the bound parameter is modified. This callback function is a functor, and can only take\n a single configurable argument. This function will throw if the current tree structure\n is not compatible with the provided parameter name.\n **\/\n template<typename F, typename enable =\n typename std::enable_if<!impl::is_configurable<F>::value>::type>\n signal_connection_base& bind(const std::string& name, F&& func) {\n static_assert(ctl::argument_count<F>::value == 1,\n \"configuration callback can only take one argument\");\n using ArgType = typename std::decay<ctl::functor_argument<F>>::type;\n static_assert(impl::is_configurable<ArgType>::value,\n \"configuration callback argument must be configurable\");\n\n config_node& node = tree_.reach(name);\n signal_connection_base& sc = node.signal.connect([func](const std::string& value) {\n ArgType t;\n if (string::stringify<ArgType>::parse(t, value)) {\n func(t);\n }\n });\n\n if (!node.is_empty) {\n ArgType t;\n if (string::stringify<ArgType>::parse(t, node.value)) {\n func(t);\n }\n }\n\n return sc;\n }\n\n \/\/\/ Bind a callback function to a configurable parameter with a default value.\n \/** See the other bind() methods for a detailed description. This overloaded version also\n takes a default value that will be saved then fed to the callback function if the\n parameter does not yet exist.\n **\/\n template<typename F, typename N, typename enable =\n typename std::enable_if<!impl::is_configurable<F>::value>::type>\n signal_connection_base& bind(const std::string& name, F&& func, const N& def) {\n static_assert(ctl::argument_count<F>::value == 1,\n \"configuration callback can only take one argument\");\n using ArgType = typename std::decay<ctl::functor_argument<F>>::type;\n static_assert(impl::is_configurable<ArgType>::value,\n \"configuration callback argument must be configurable\");\n\n config_node& node = tree_.reach(name);\n signal_connection_base& sc = node.signal.connect([func](const std::string& value) {\n ArgType t;\n if (string::stringify<ArgType>::parse(t, value)) {\n func(t);\n }\n });\n\n if (node.is_empty) {\n string::stringify<N>::serialize(def, node.value);\n node.signal.dispatch(node.value);\n node.is_empty = false;\n dirty_ = true;\n } else {\n ArgType t;\n if (string::stringify<ArgType>::parse(t, node.value)) {\n func(t);\n }\n }\n\n return sc;\n }\n\n private :\n struct config_node {\n std::string value;\n bool is_empty = true;\n signal_t<void(const std::string&)> signal;\n };\n\n void save_node_(std::ofstream& f, const ctl::string_tree<config_node>::branch& node,\n const std::string& name) const;\n\n ctl::string_tree<config_node> tree_;\n mutable bool dirty_;\n };\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of nc_handler, a data handler for the OPeNDAP data\n\/\/ server.\n\n\/\/ Copyright (c) 2002,2003,2006 OPeNDAP, Inc.\n\/\/ Author: James Gallagher <jgallagher@opendap.org>\n\/\/\n\/\/ This is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the GNU Lesser General Public License as published by the Free\n\/\/ Software Foundation; either version 2.1 of the License, or (at your\n\/\/ option) any later version.\n\/\/\n\/\/ This software is distributed in the hope that it will be useful, but\n\/\/ WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\n\/\/ or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public\n\/\/ License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n#include \"config_nc.h\"\n\nstatic char not_used rcsid[] =\n { \"$Id$\" };\n\n#include <iostream>\n#include <string>\n\n#include <DODSFilter.h>\n#include <DDS.h>\n#include <DAS.h>\n#include <DataDDS.h>\n#include <ConstraintEvaluator.h>\n\n#include <ObjectType.h>\n#include <cgi_util.h>\n\nusing namespace libdap ;\n\nextern void nc_read_variables(DAS & das,\n const string & filename) throw(Error);\nextern void nc_read_descriptors(DDS & dds, const string & filename);\n\nconst string cgi_version = PACKAGE_VERSION;\n\n\/** Build a DDS which holds attributes.\n @param dds A DDS constructed with the correct factory.\n @param filter The DODSFilter built using the input arguments\n @return The built-up DDS *\/\nDDS & build_dds(DDS & dds, const DODSFilter & filter)\n{\n dds.filename(filter.get_dataset_name());\n nc_read_descriptors(dds, filter.get_dataset_name());\n filter.read_ancillary_dds(dds);\n\n DAS das;\n nc_read_variables(das, filter.get_dataset_name());\n filter.read_ancillary_das(das);\n\n dds.transfer_attributes(&das);\n\n return dds;\n}\n\nint main(int argc, char *argv[])\n{\n try {\n DODSFilter df(argc, argv);\n if (df.get_cgi_version() == \"\")\n df.set_cgi_version(cgi_version);\n\n switch (df.get_response()) {\n case DODSFilter::DAS_Response:{\n DAS das;\n\n nc_read_variables(das, df.get_dataset_name());\n df.read_ancillary_das(das);\n df.send_das(das);\n break;\n }\n\n case DODSFilter::DDS_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_dds(dds, ce, true);\n break;\n }\n\n case DODSFilter::DataDDS_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_data(dds, ce, cout);\n break;\n }\n\n case DODSFilter::DDX_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_ddx(dds, ce, cout);\n break;\n }\n\n case DODSFilter::Version_Response:{\n df.send_version_info();\n\n break;\n }\n\n default:\n df.print_usage(); \/\/ Throws Error\n }\n }\n catch(Error & e) {\n set_mime_text(stdout, dods_error, cgi_version);\n e.print(stdout);\n return 1;\n }\n\n return 0;\n}\n<commit_msg>Added a call to ErrMsgT() to the nc_handler.cc main() function. This replaces all the many calls to this function that were scattered throughout the handler code (but are only used by the now unsupported CGI version of the code).<commit_after>\n\/\/ -*- mode: c++; c-basic-offset:4 -*-\n\n\/\/ This file is part of nc_handler, a data handler for the OPeNDAP data\n\/\/ server.\n\n\/\/ Copyright (c) 2002,2003,2006 OPeNDAP, Inc.\n\/\/ Author: James Gallagher <jgallagher@opendap.org>\n\/\/\n\/\/ This is free software; you can redistribute it and\/or modify it under the\n\/\/ terms of the GNU Lesser General Public License as published by the Free\n\/\/ Software Foundation; either version 2.1 of the License, or (at your\n\/\/ option) any later version.\n\/\/\n\/\/ This software is distributed in the hope that it will be useful, but\n\/\/ WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\n\/\/ or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public\n\/\/ License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\/\/\n\/\/ You can contact OPeNDAP, Inc. at PO Box 112, Saunderstown, RI. 02874-0112.\n\n#include \"config_nc.h\"\n\nstatic char not_used rcsid[] =\n { \"$Id$\" };\n\n#include <iostream>\n#include <string>\n\n#include <DODSFilter.h>\n#include <DDS.h>\n#include <DAS.h>\n#include <DataDDS.h>\n#include <ConstraintEvaluator.h>\n\n#include <ObjectType.h>\n#include <cgi_util.h>\n\nusing namespace libdap ;\n\nextern void nc_read_variables(DAS & das, const string & filename);\nextern void nc_read_descriptors(DDS & dds, const string & filename);\n\nconst string cgi_version = PACKAGE_VERSION;\n\n\/** Build a DDS which holds attributes.\n @param dds A DDS constructed with the correct factory.\n @param filter The DODSFilter built using the input arguments\n @return The built-up DDS *\/\nDDS & build_dds(DDS & dds, const DODSFilter & filter)\n{\n dds.filename(filter.get_dataset_name());\n nc_read_descriptors(dds, filter.get_dataset_name());\n filter.read_ancillary_dds(dds);\n\n DAS das;\n nc_read_variables(das, filter.get_dataset_name());\n filter.read_ancillary_das(das);\n\n dds.transfer_attributes(&das);\n\n return dds;\n}\n\nint main(int argc, char *argv[])\n{\n try {\n DODSFilter df(argc, argv);\n if (df.get_cgi_version() == \"\")\n df.set_cgi_version(cgi_version);\n\n switch (df.get_response()) {\n case DODSFilter::DAS_Response:{\n DAS das;\n\n nc_read_variables(das, df.get_dataset_name());\n df.read_ancillary_das(das);\n df.send_das(das);\n break;\n }\n\n case DODSFilter::DDS_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_dds(dds, ce, true);\n break;\n }\n\n case DODSFilter::DataDDS_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_data(dds, ce, cout);\n break;\n }\n\n case DODSFilter::DDX_Response:{\n DDS dds(NULL);\n dds = build_dds(dds, df);\n ConstraintEvaluator ce;\n df.send_ddx(dds, ce, cout);\n break;\n }\n\n case DODSFilter::Version_Response:{\n df.send_version_info();\n\n break;\n }\n\n default:\n df.print_usage(); \/\/ Throws Error\n }\n }\n catch(Error & e) {\n \/\/ This call replaces many other calls inside the handler code that\n \/\/ have been removed since this is where all of the exceptions\n \/\/ ultimately wind up. 1\/23\/09 jhrg\n ErrMsgT(e.get_error_message());\n\n set_mime_text(stdout, dods_error, cgi_version);\n e.print(stdout);\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2017 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Network module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Network\/Win32\/SocketPollerImpl.hpp>\n#include <Nazara\/Network\/Debug.hpp>\n\nnamespace Nz\n{\n\tSocketPollerImpl::SocketPollerImpl()\n\t{\n\t\t#if !NAZARA_NETWORK_POLL_SUPPORT\n\t\tFD_ZERO(&m_readSockets);\n\t\tFD_ZERO(&m_readyToReadSockets);\n\t\tFD_ZERO(&m_readyToWriteSockets);\n\t\tFD_ZERO(&m_writeSockets);\n\t\t#endif\n\t}\n\n\tvoid SocketPollerImpl::Clear()\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tm_allSockets.clear();\n\t\tm_readyToReadSockets.clear();\n\t\tm_readyToWriteSockets.clear();\n\t\tm_sockets.clear();\n\t\t#else\n\t\tFD_ZERO(&m_readSockets);\n\t\tFD_ZERO(&m_readyToReadSockets);\n\t\tFD_ZERO(&m_readyToWriteSockets);\n\t\tFD_ZERO(&m_writeSockets);\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsReadyToRead(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_readyToReadSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readyToReadSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsReadyToWrite(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_readyToWriteSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readyToWriteSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsRegistered(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_allSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readSockets) != 0 ||\n\t\t FD_ISSET(socket, &m_writeSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::RegisterSocket(SocketHandle socket, SocketPollEventFlags eventFlags)\n\t{\n\t\tNazaraAssert(!IsRegistered(socket), \"Socket is already registered\");\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tPollSocket entry = {\n\t\t\tsocket,\n\t\t\t0,\n\t\t\t0\n\t\t};\n\n\t\tif (eventFlags & SocketPollEvent_Read)\n\t\t\tentry.events |= POLLRDNORM;\n\n\t\tif (eventFlags & SocketPollEvent_Write)\n\t\t\tentry.events |= POLLWRNORM;\n\n\t\tm_allSockets[socket] = m_sockets.size();\n\t\tm_sockets.emplace_back(entry);\n\t\t#else\n\t\tfor (std::size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tif ((eventFlags & ((i == 0) ? SocketPollEvent_Read : SocketPollEvent_Write)) == 0)\n\t\t\t\tcontinue;\n\n\t\t\tfd_set& targetSet = (i == 0) ? m_readSockets : m_writeSockets;\n\t\t\tif (targetSet.fd_count > FD_SETSIZE)\n\t\t\t{\n\t\t\t\tNazaraError(\"Socket count exceeding hard-coded FD_SETSIZE (\" + String::Number(FD_SETSIZE) + \")\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tFD_SET(socket, &targetSet);\n\t\t}\n\t\t#endif\n\n\t\treturn true;\n\t}\n\n\tvoid SocketPollerImpl::UnregisterSocket(SocketHandle socket)\n\t{\n\t\tNazaraAssert(IsRegistered(socket), \"Socket is not registered\");\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tif (m_sockets.size() > 1U)\n\t\t{\n\t\t\t\/\/ Instead of using vector::erase, let's move the last element to the now unoccupied position\n\t\t\tstd::size_t entry = m_allSockets[socket];\n\n\t\t\t\/\/ Get the last element and update it's position\n\t\t\tconst PollSocket& lastElement = m_sockets.back();\n\t\t\tm_allSockets[lastElement.fd] = entry;\n\n\t\t\t\/\/ Now move it properly (lastElement is invalid after the following line) and pop it\n\t\t\tm_sockets[entry] = std::move(m_sockets.back());\n\t\t}\n\t\tm_sockets.pop_back();\n\n\t\tm_allSockets.erase(socket);\n\t\tm_readyToReadSockets.erase(socket);\n\t\tm_readyToWriteSockets.erase(socket);\n\t\t#else\n\t\tFD_CLR(socket, &m_readSockets);\n\t\tFD_CLR(socket, &m_readyToReadSockets);\n\t\tFD_CLR(socket, &m_readyToWriteSockets);\n\t\tFD_CLR(socket, &m_writeSockets);\n\t\t#endif\n\t}\n\n\tint SocketPollerImpl::Wait(UInt64 msTimeout, SocketError* error)\n\t{\n\t\tint activeSockets;\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tactiveSockets = SocketImpl::Poll(m_sockets.data(), m_sockets.size(), static_cast<int>(msTimeout), error);\n\t\t#else\n\t\tm_readyToReadSockets = m_readSockets;\n\t\tm_readyToWriteSockets = m_writeSockets;\n\n\t\ttimeval tv;\n\t\ttv.tv_sec = static_cast<long>(msTimeout \/ 1000ULL);\n\t\ttv.tv_usec = static_cast<long>((msTimeout % 1000ULL) * 1000ULL);\n\n\t\tactiveSockets = ::select(0xDEADBEEF, &m_readyToReadSockets, &m_readyToWriteSockets, nullptr, (msTimeout > 0) ? &tv : nullptr); \/\/< The first argument is ignored on Windows\n\t\tif (activeSockets == SOCKET_ERROR)\n\t\t{\n\t\t\tif (error)\n\t\t\t\t*error = SocketImpl::TranslateWSAErrorToSocketError(WSAGetLastError());\n\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (error)\n\t\t\t*error = SocketError_NoError;\n\t\t#endif\n\n\t\treturn activeSockets;\n\t}\n}\n<commit_msg>Network\/SocketPollerImpl: Fix possible weird behavior with SocketPoller<commit_after>\/\/ Copyright (C) 2017 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Network module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Network\/Win32\/SocketPollerImpl.hpp>\n#include <Nazara\/Network\/Debug.hpp>\n\nnamespace Nz\n{\n\tSocketPollerImpl::SocketPollerImpl()\n\t{\n\t\t#if !NAZARA_NETWORK_POLL_SUPPORT\n\t\tFD_ZERO(&m_readSockets);\n\t\tFD_ZERO(&m_readyToReadSockets);\n\t\tFD_ZERO(&m_readyToWriteSockets);\n\t\tFD_ZERO(&m_writeSockets);\n\t\t#endif\n\t}\n\n\tvoid SocketPollerImpl::Clear()\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tm_allSockets.clear();\n\t\tm_readyToReadSockets.clear();\n\t\tm_readyToWriteSockets.clear();\n\t\tm_sockets.clear();\n\t\t#else\n\t\tFD_ZERO(&m_readSockets);\n\t\tFD_ZERO(&m_readyToReadSockets);\n\t\tFD_ZERO(&m_readyToWriteSockets);\n\t\tFD_ZERO(&m_writeSockets);\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsReadyToRead(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_readyToReadSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readyToReadSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsReadyToWrite(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_readyToWriteSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readyToWriteSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::IsRegistered(SocketHandle socket) const\n\t{\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\treturn m_allSockets.count(socket) != 0;\n\t\t#else\n\t\treturn FD_ISSET(socket, &m_readSockets) != 0 ||\n\t\t FD_ISSET(socket, &m_writeSockets) != 0;\n\t\t#endif\n\t}\n\n\tbool SocketPollerImpl::RegisterSocket(SocketHandle socket, SocketPollEventFlags eventFlags)\n\t{\n\t\tNazaraAssert(!IsRegistered(socket), \"Socket is already registered\");\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tPollSocket entry = {\n\t\t\tsocket,\n\t\t\t0,\n\t\t\t0\n\t\t};\n\n\t\tif (eventFlags & SocketPollEvent_Read)\n\t\t\tentry.events |= POLLRDNORM;\n\n\t\tif (eventFlags & SocketPollEvent_Write)\n\t\t\tentry.events |= POLLWRNORM;\n\n\t\tm_allSockets[socket] = m_sockets.size();\n\t\tm_sockets.emplace_back(entry);\n\t\t#else\n\t\tfor (std::size_t i = 0; i < 2; ++i)\n\t\t{\n\t\t\tif ((eventFlags & ((i == 0) ? SocketPollEvent_Read : SocketPollEvent_Write)) == 0)\n\t\t\t\tcontinue;\n\n\t\t\tfd_set& targetSet = (i == 0) ? m_readSockets : m_writeSockets;\n\t\t\tif (targetSet.fd_count > FD_SETSIZE)\n\t\t\t{\n\t\t\t\tNazaraError(\"Socket count exceeding hard-coded FD_SETSIZE (\" + String::Number(FD_SETSIZE) + \")\");\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tFD_SET(socket, &targetSet);\n\t\t}\n\t\t#endif\n\n\t\treturn true;\n\t}\n\n\tvoid SocketPollerImpl::UnregisterSocket(SocketHandle socket)\n\t{\n\t\tNazaraAssert(IsRegistered(socket), \"Socket is not registered\");\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tif (m_sockets.size() > 1U)\n\t\t{\n\t\t\t\/\/ Instead of using vector::erase, let's move the last element to the now unoccupied position\n\t\t\tstd::size_t entry = m_allSockets[socket];\n\n\t\t\t\/\/ Get the last element and update it's position\n\t\t\tconst PollSocket& lastElement = m_sockets.back();\n\t\t\tm_allSockets[lastElement.fd] = entry;\n\n\t\t\t\/\/ Now move it properly (lastElement is invalid after the following line) and pop it\n\t\t\tm_sockets[entry] = std::move(m_sockets.back());\n\t\t}\n\t\tm_sockets.pop_back();\n\n\t\tm_allSockets.erase(socket);\n\t\tm_readyToReadSockets.erase(socket);\n\t\tm_readyToWriteSockets.erase(socket);\n\t\t#else\n\t\tFD_CLR(socket, &m_readSockets);\n\t\tFD_CLR(socket, &m_readyToReadSockets);\n\t\tFD_CLR(socket, &m_readyToWriteSockets);\n\t\tFD_CLR(socket, &m_writeSockets);\n\t\t#endif\n\t}\n\n\tint SocketPollerImpl::Wait(UInt64 msTimeout, SocketError* error)\n\t{\n\t\tint activeSockets;\n\n\t\t#if NAZARA_NETWORK_POLL_SUPPORT\n\t\tactiveSockets = SocketImpl::Poll(m_sockets.data(), m_sockets.size(), static_cast<int>(msTimeout), error);\n\t\t#else\n\t\tfd_set* readSet = nullptr;\n\t\tfd_set* writeSet = nullptr;\n\n\t\tif (m_readSockets.fd_count > 0)\n\t\t{\n\t\t\tm_readyToReadSockets = m_readSockets;\n\t\t\treadSet = &m_readyToReadSockets;\n\t\t}\n\n\t\tif (m_writeSockets.fd_count > 0)\n\t\t{\n\t\t\tm_readyToWriteSockets = m_writeSockets;\n\t\t\treadSet = &m_readyToWriteSockets;\n\t\t}\n\n\t\ttimeval tv;\n\t\ttv.tv_sec = static_cast<long>(msTimeout \/ 1000ULL);\n\t\ttv.tv_usec = static_cast<long>((msTimeout % 1000ULL) * 1000ULL);\n\n\t\tactiveSockets = ::select(0xDEADBEEF, readSet, writeSet, nullptr, (msTimeout > 0) ? &tv : nullptr); \/\/< The first argument is ignored on Windows\n\t\tif (activeSockets == SOCKET_ERROR)\n\t\t{\n\t\t\tif (error)\n\t\t\t\t*error = SocketImpl::TranslateWSAErrorToSocketError(WSAGetLastError());\n\n\t\t\treturn 0;\n\t\t}\n\n\t\tif (error)\n\t\t\t*error = SocketError_NoError;\n\t\t#endif\n\n\t\treturn activeSockets;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"path.h\"\n\nnamespace shk {\n\nnamespace detail {\n\nstd::pair<StringPiece, StringPiece> basenameSplitPiece(const std::string &path) {\n const auto last_nonslash = path.find_last_not_of('\/');\n const auto slash_pos = path.find_last_of('\/', last_nonslash);\n\n if (slash_pos == std::string::npos) {\n return std::make_pair(StringPiece(\".\", 1), StringPiece(path));\n } else if (last_nonslash == std::string::npos) {\n return std::make_pair(StringPiece(\"\/\", 1), StringPiece(\"\/\", 1));\n } else {\n return std::make_pair(\n slash_pos == 0 ?\n StringPiece(\"\/\", 1) :\n StringPiece(path.data(), slash_pos),\n StringPiece(\n path.data() + slash_pos + 1,\n last_nonslash - slash_pos));\n }\n}\n\nvoid canonicalizePath(std::string *path) throw(PathError) {\n size_t len = path->size();\n char *str = 0;\n if (len > 0) {\n str = &(*path)[0];\n canonicalizePath(str, &len);\n path->resize(len);\n }\n if (len == 0) {\n *path = \".\";\n }\n}\n\nvoid canonicalizePath(\n char *path,\n size_t *len) throw(PathError) {\n \/\/ WARNING: this function is performance-critical; please benchmark\n \/\/ any changes you make to it.\n if (*len == 0) {\n return;\n }\n\n const int kMaxPathComponents = 62;\n char *components[kMaxPathComponents];\n int component_count = 0;\n\n char *start = path;\n char *dst = start;\n const char *src = start;\n const char *end = start + *len;\n\n if (*src == '\/') {\n#ifdef _WIN32\n \/\/ network path starts with \/\/\n if (*len > 1 && *(src + 1) == '\/') {\n src += 2;\n dst += 2;\n } else {\n ++src;\n ++dst;\n }\n#else\n ++src;\n ++dst;\n#endif\n }\n\n while (src < end) {\n if (*src == '.') {\n if (src + 1 == end || src[1] == '\/') {\n \/\/ '.' component; eliminate.\n src += 2;\n continue;\n } else if (src[1] == '.' && (src + 2 == end || src[2] == '\/')) {\n \/\/ '..' component. Back up if possible.\n if (component_count > 0) {\n dst = components[component_count - 1];\n src += 3;\n --component_count;\n } else {\n *dst++ = *src++;\n *dst++ = *src++;\n *dst++ = *src++;\n }\n continue;\n }\n }\n\n if (*src == '\/') {\n src++;\n continue;\n }\n \n if (component_count == kMaxPathComponents) {\n throw PathError(\"path has too many components\", path);\n }\n components[component_count] = dst;\n ++component_count;\n\n while (*src != '\/' && src != end) {\n *dst++ = *src++;\n }\n *dst++ = *src++; \/\/ Copy '\/' or final \\0 character as well.\n }\n\n if (dst == start) {\n *len = 0;\n } else {\n *len = dst - start - (component_count ? 1 : 0);\n }\n}\n\nnamespace {\n\n#ifdef _WIN32\ntemplate<typename Iter>\nvoid replaceBackslashes(const Iter begin, const Iter end) {\n for (auto c = begin; c < end; ++c) {\n if (*c == '\\\\') {\n *c = '\/';\n }\n }\n}\n#endif\n\nCanonicalizedPath makeCanonicalizedPath(\n FileSystem &file_system, std::string &&path) {\n if (path.empty()) {\n throw PathError(\"Empty path\", path);\n }\n\n#ifdef _WIN32\n replaceBackslashes(path.begin(), path.end());\n#endif\n\n \/\/ We have a path (say \/a\/b\/c) and want to find a prefix of this path that\n \/\/ exists on the file system (for example \/a).\n \/\/\n \/\/ pos points to the last character in the path that is about to be tested for\n \/\/ existence.\n auto pos = path.size() - 1; \/\/ The string is verified to not be empty above\n Stat stat;\n bool at_root = false;\n bool at_relative_root = false;\n for (;;) {\n \/\/ Discard any trailing slashes. They have no semantic meaning.\n while (path[pos] == '\/') {\n if (pos == 0) {\n \/\/ As a special case, don't discard a trailing slash if the path is only\n \/\/ \"\/\", since that would transform an absolute path into a relative one.\n at_root = true;\n break;\n }\n pos--;\n }\n\n StringPiece path_to_try(\n at_relative_root ? \".\" : path.c_str(),\n pos + 1);\n \/\/ Use stat, not lstat: the idea is to follow symlinks to the actual file to\n \/\/ directory where this will live. Comparing links for identity does no\n \/\/ good.\n stat = file_system.stat(path_to_try.asString());\n if (stat.result == 0) {\n \/\/ Found an existing file\n break;\n } else if (at_root || at_relative_root) {\n throw PathError(\n \"None of the path components can be accessed and exist\", path);\n } else {\n while (path[pos] != '\/') {\n if (pos == 0) {\n \/\/ The loop hit the beginning of the string. That means this is a\n \/\/ relative path and this none of the path components other than the\n \/\/ current working directory exist.\n at_relative_root = true;\n break;\n }\n pos--;\n }\n }\n }\n\n \/\/ At this point, the longest prefix of path that actually exists has been\n \/\/ found. Now extract the nonexisting part of the path and canonicalize it.\n do {\n pos++;\n } while (pos != path.size() && path[pos] == '\/');\n auto len = path.size() - pos;\n std::string nonexisting_part(&path[pos], len);\n if (len > 0) {\n canonicalizePath(&nonexisting_part[0], &len);\n nonexisting_part.resize(len);\n }\n\n canonicalizePath(&path);\n return CanonicalizedPath(\n stat.metadata.ino,\n stat.metadata.dev,\n std::move(nonexisting_part));\n}\n\n} \/\/ anonymous namespace\n} \/\/ namespace detail\n\nPaths::Paths(FileSystem &file_system)\n : _file_system(file_system) {}\n\nPath Paths::get(const std::string &path) throw(PathError) {\n return get(std::string(path));\n}\n\nPath Paths::get(std::string &&path) throw(PathError) {\n const auto original_result = _original_paths.emplace(path);\n const auto canonicalized_result = _canonicalized_paths.insert(\n detail::makeCanonicalizedPath(_file_system, std::move(path)));\n return Path(\n &*canonicalized_result.first,\n &*original_result.first);\n}\n\n} \/\/ namespace shk\n<commit_msg>fixup<commit_after>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"path.h\"\n\nnamespace shk {\n\nnamespace detail {\n\nstd::pair<StringPiece, StringPiece> basenameSplitPiece(const std::string &path) {\n const auto last_nonslash = path.find_last_not_of('\/');\n const auto slash_pos = path.find_last_of('\/', last_nonslash);\n\n if (slash_pos == std::string::npos) {\n return std::make_pair(StringPiece(\".\", 1), StringPiece(path));\n } else if (last_nonslash == std::string::npos) {\n return std::make_pair(StringPiece(\"\/\", 1), StringPiece(\"\/\", 1));\n } else {\n return std::make_pair(\n slash_pos == 0 ?\n StringPiece(\"\/\", 1) :\n StringPiece(path.data(), slash_pos),\n StringPiece(\n path.data() + slash_pos + 1,\n last_nonslash - slash_pos));\n }\n}\n\nvoid canonicalizePath(std::string *path) throw(PathError) {\n size_t len = path->size();\n char *str = 0;\n if (len > 0) {\n str = &(*path)[0];\n canonicalizePath(str, &len);\n path->resize(len);\n }\n if (len == 0) {\n *path = \".\";\n }\n}\n\nvoid canonicalizePath(\n char *path,\n size_t *len) throw(PathError) {\n \/\/ WARNING: this function is performance-critical; please benchmark\n \/\/ any changes you make to it.\n if (*len == 0) {\n return;\n }\n\n const int kMaxPathComponents = 62;\n char *components[kMaxPathComponents];\n int component_count = 0;\n\n char *start = path;\n char *dst = start;\n const char *src = start;\n const char *end = start + *len;\n\n if (*src == '\/') {\n#ifdef _WIN32\n \/\/ network path starts with \/\/\n if (*len > 1 && *(src + 1) == '\/') {\n src += 2;\n dst += 2;\n } else {\n ++src;\n ++dst;\n }\n#else\n ++src;\n ++dst;\n#endif\n }\n\n while (src < end) {\n if (*src == '.') {\n if (src + 1 == end || src[1] == '\/') {\n \/\/ '.' component; eliminate.\n src += 2;\n continue;\n } else if (src[1] == '.' && (src + 2 == end || src[2] == '\/')) {\n \/\/ '..' component. Back up if possible.\n if (component_count > 0) {\n dst = components[component_count - 1];\n src += 3;\n --component_count;\n } else {\n *dst++ = *src++;\n *dst++ = *src++;\n *dst++ = *src++;\n }\n continue;\n }\n }\n\n if (*src == '\/') {\n src++;\n continue;\n }\n \n if (component_count == kMaxPathComponents) {\n throw PathError(\"path has too many components\", path);\n }\n components[component_count] = dst;\n ++component_count;\n\n while (*src != '\/' && src != end) {\n *dst++ = *src++;\n }\n *dst++ = *src++; \/\/ Copy '\/' or final \\0 character as well.\n }\n\n if (dst == start) {\n *len = 0;\n } else {\n *len = dst - start - (component_count ? 1 : 0);\n }\n}\n\nnamespace {\n\n#ifdef _WIN32\ntemplate<typename Iter>\nvoid replaceBackslashes(const Iter begin, const Iter end) {\n for (auto c = begin; c < end; ++c) {\n if (*c == '\\\\') {\n *c = '\/';\n }\n }\n}\n#endif\n\nCanonicalizedPath makeCanonicalizedPath(\n FileSystem &file_system, std::string &&path) {\n if (path.empty()) {\n throw PathError(\"Empty path\", path);\n }\n\n#ifdef _WIN32\n replaceBackslashes(path.begin(), path.end());\n#endif\n\n \/\/ We have a path (say \/a\/b\/c) and want to find a prefix of this path that\n \/\/ exists on the file system (for example \/a).\n \/\/\n \/\/ pos points to the last character in the path that is about to be tested for\n \/\/ existence.\n auto pos = path.size() - 1; \/\/ The string is verified to not be empty above\n Stat stat;\n bool at_root = false;\n bool at_relative_root = false;\n for (;;) {\n \/\/ Discard any trailing slashes. They have no semantic meaning.\n while (path[pos] == '\/') {\n if (pos == 0) {\n \/\/ As a special case, don't discard a trailing slash if the path is only\n \/\/ \"\/\", since that would transform an absolute path into a relative one.\n at_root = true;\n break;\n }\n pos--;\n }\n\n StringPiece path_to_try(\n at_relative_root ? \".\" : path.c_str(),\n pos + 1);\n \/\/ Use stat, not lstat: the idea is to follow symlinks to the actual file to\n \/\/ directory where this will live. Comparing links for identity does no\n \/\/ good.\n stat = file_system.stat(path_to_try.asString());\n if (stat.result == 0) {\n \/\/ Found an existing file\n break;\n } else if (at_root || at_relative_root) {\n throw PathError(\n \"None of the path components can be accessed and exist\", path);\n } else {\n while (path[pos] != '\/') {\n if (pos == 0) {\n \/\/ The loop hit the beginning of the string. That means this is a\n \/\/ relative path and this none of the path components other than the\n \/\/ current working directory exist.\n at_relative_root = true;\n break;\n }\n pos--;\n }\n }\n }\n\n \/\/ At this point, the longest prefix of path that actually exists has been\n \/\/ found. Now extract the nonexisting part of the path and canonicalize it.\n do {\n pos++;\n } while (pos != path.size() && path[pos] == '\/');\n auto len = path.size() - pos;\n std::string nonexisting_part(&path[pos], len);\n if (len > 0) {\n canonicalizePath(&nonexisting_part[0], &len);\n nonexisting_part.resize(len);\n }\n\n return CanonicalizedPath(\n stat.metadata.ino,\n stat.metadata.dev,\n std::move(nonexisting_part));\n}\n\n} \/\/ anonymous namespace\n} \/\/ namespace detail\n\nPaths::Paths(FileSystem &file_system)\n : _file_system(file_system) {}\n\nPath Paths::get(const std::string &path) throw(PathError) {\n return get(std::string(path));\n}\n\nPath Paths::get(std::string &&path) throw(PathError) {\n const auto original_result = _original_paths.emplace(path);\n const auto canonicalized_result = _canonicalized_paths.insert(\n detail::makeCanonicalizedPath(_file_system, std::move(path)));\n return Path(\n &*canonicalized_result.first,\n &*original_result.first);\n}\n\n} \/\/ namespace shk\n<|endoftext|>"} {"text":"<commit_before>\/* Sirikata\n * QueryHandlerFactory.cpp\n *\n * Copyright (c) 2010, Ewen Cheslack-Postava\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sirikata\/core\/util\/Platform.hpp>\n#include <sirikata\/core\/options\/Options.hpp>\n\n#include <prox\/BruteForceQueryHandler.hpp>\n#include <prox\/RTreeQueryHandler.hpp>\n#include <prox\/RTreeCutQueryHandler.hpp>\n\nnamespace Sirikata {\n\n\/** Creates a Prox::QueryHandler of the specified type. Parses the arguments\n * specified and passes them to the query handler constructor.\n *\/\ntemplate<typename SimulationTraits>\nProx::QueryHandler<SimulationTraits>* QueryHandlerFactory(const String& type, const String& args) {\n static OptionValue* branching = NULL;\n if (branching == NULL) {\n branching = new OptionValue(\"branching\", \"10\", Sirikata::OptionValueType<uint32>(), \"Number of children each node should have.\");\n Sirikata::InitializeClassOptions ico(\"query_handler\", NULL,\n branching,\n NULL);\n }\n\n assert(branching != NULL);\n\n \/\/ Since these options end up being shared if you instantiate multiple\n \/\/ QueryHandlers, reset them each time.\n branching->unsafeAs<uint32>() = 10;\n\n OptionSet* optionsSet = OptionSet::getOptions(\"query_handler\", NULL);\n optionsSet->parse(args);\n\n if (type == \"brute\") {\n return new Prox::BruteForceQueryHandler<SimulationTraits>();\n }\n else if (type == \"dist\") { \/\/ We just use brute force and special case the\n \/\/ queries in Proximity\n return new Prox::BruteForceQueryHandler<SimulationTraits>();\n }\n else if (type == \"rtree\") {\n return new Prox::RTreeQueryHandler<SimulationTraits>(branching->unsafeAs<uint32>());\n }\n else if (type == \"rtreecut\") {\n return new Prox::RTreeCutQueryHandler<SimulationTraits>(branching->unsafeAs<uint32>(), false);\n }\n else if (type == \"rtreecutagg\") {\n return new Prox::RTreeCutQueryHandler<SimulationTraits>(branching->unsafeAs<uint32>(), true);\n }\n else {\n return NULL;\n }\n}\n\n} \/\/ namespace Sirikata\n<commit_msg>Make QueryHandlerFactory generate RebuildingQueryHandlers, add a parameter to control the batch size when transitioning queries to the new handler.<commit_after>\/* Sirikata\n * QueryHandlerFactory.cpp\n *\n * Copyright (c) 2010, Ewen Cheslack-Postava\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Sirikata nor the names of its contributors may\n * be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n * IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED\n * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER\n * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <sirikata\/core\/util\/Platform.hpp>\n#include <sirikata\/core\/options\/Options.hpp>\n\n#include <prox\/BruteForceQueryHandler.hpp>\n#include <prox\/RTreeQueryHandler.hpp>\n#include <prox\/RTreeCutQueryHandler.hpp>\n#include <prox\/RebuildingQueryHandler.hpp>\n\nnamespace Sirikata {\n\n\/** Creates a Prox::QueryHandler of the specified type. Parses the arguments\n * specified and passes them to the query handler constructor.\n *\/\ntemplate<typename SimulationTraits>\nProx::QueryHandler<SimulationTraits>* QueryHandlerFactory(const String& type, const String& args) {\n static OptionValue* branching = NULL;\n static OptionValue* rebuild_batch_size = NULL;\n if (branching == NULL) {\n branching = new OptionValue(\"branching\", \"10\", Sirikata::OptionValueType<uint32>(), \"Number of children each node should have.\");\n rebuild_batch_size = new OptionValue(\"rebuild-batch-size\", \"10\", Sirikata::OptionValueType<uint32>(), \"Number of queries to transition on each iteration when rebuilding. Keep this small to avoid long latencies between updates.\");\n Sirikata::InitializeClassOptions ico(\"query_handler\", NULL,\n branching,\n rebuild_batch_size,\n NULL);\n }\n\n assert(branching != NULL);\n\n \/\/ Since these options end up being shared if you instantiate multiple\n \/\/ QueryHandlers, reset them each time.\n branching->unsafeAs<uint32>() = 10;\n\n OptionSet* optionsSet = OptionSet::getOptions(\"query_handler\", NULL);\n optionsSet->parse(args);\n\n if (type == \"brute\") {\n return new Prox::RebuildingQueryHandler<SimulationTraits>(\n Prox::BruteForceQueryHandler<SimulationTraits>::Constructor(), rebuild_batch_size->unsafeAs<uint32>()\n );\n }\n else if (type == \"dist\") { \/\/ We just use brute force and special case the\n \/\/ queries in Proximity\n return new Prox::RebuildingQueryHandler<SimulationTraits>(\n Prox::BruteForceQueryHandler<SimulationTraits>::Constructor(), rebuild_batch_size->unsafeAs<uint32>()\n );\n }\n else if (type == \"rtree\") {\n return new Prox::RebuildingQueryHandler<SimulationTraits>(\n Prox::RTreeQueryHandler<SimulationTraits>::Constructor(branching->unsafeAs<uint32>()), rebuild_batch_size->unsafeAs<uint32>()\n );\n }\n else if (type == \"rtreecut\") {\n return new Prox::RebuildingQueryHandler<SimulationTraits>(\n Prox::RTreeCutQueryHandler<SimulationTraits>::Constructor(branching->unsafeAs<uint32>(), false), rebuild_batch_size->unsafeAs<uint32>()\n );\n }\n else if (type == \"rtreecutagg\") {\n return new Prox::RebuildingQueryHandler<SimulationTraits>(\n Prox::RTreeCutQueryHandler<SimulationTraits>::Constructor(branching->unsafeAs<uint32>(), true), rebuild_batch_size->unsafeAs<uint32>()\n );\n }\n else {\n return NULL;\n }\n}\n\n} \/\/ namespace Sirikata\n<|endoftext|>"} {"text":"<commit_before>#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <limits>\n\nusing uchar = unsigned char;\nconst double cx = -.6, cy = 0;\nconst uchar max_iter = std::numeric_limits<uchar>::max();\n\nstruct rgb_t { unsigned char r, g, b; };\n\nrgb_t **row_ptrs;\nrgb_t *img_data;\n\nvoid screen_dump(const int width, const int height)\n{\n FILE *fp = fopen(\"out_mandelbrot.ppm\", \"w\");\n fprintf(fp, \"P6\\n%d %d\\n255\\n\", width, height);\n for (int i = height - 1; i >= 0; i--)\n fwrite(row_ptrs[i], 1, width * sizeof(rgb_t), fp);\n fclose(fp);\n}\n\nvoid alloc_2d(const int width, const int height)\n{\n img_data = new rgb_t[width * height];\n row_ptrs = new rgb_t*[height];\n\n row_ptrs[0] = img_data;\n for (int i = 1; i < height; i++)\n row_ptrs[i] = row_ptrs[i - 1] + width;\n}\n\nvoid map_colour(rgb_t * const px)\n{\n const uchar num_shades = 16;\n const rgb_t mapping[num_shades] =\n { { 66,30,15 },{ 25,7,26 },{ 9,1,47 },{ 4,4,73 },{ 0,7,100 },\n { 12,44,138 },{ 24,82,177 },{ 57,125,209 },{ 134,181,229 },{ 211,236,248 },\n { 241,233,191 },{ 248,201,95 },{ 255,170,0 },{ 204,128,0 },{ 153,87,0 },\n { 106,52,3 } };\n\n if (px->r == max_iter || px->r == 0) {\n px->r = 0; px->g = 0; px->b = 0;\n }\n else {\n const uchar uc = px->r % num_shades;\n *px = mapping[uc];\n }\n}\n\nvoid calc_mandel(const int width, const int height, const double scale)\n{\n for (int i = 0; i < height; i++) {\n\n const double y = (i - height \/ 2) * scale + cy;\n\n rgb_t *px = row_ptrs[i];\n for (int j = 0; j < width; j++, px++) {\n\n const double x = (j - width \/ 2) * scale + cx;\n double zx, zy, zx2, zy2;\n uchar iter = 0;\n\n zx = hypot(x - .25, y);\n if (x < zx - 2 * zx * zx + .25) iter = max_iter;\n if ((x + 1)*(x + 1) + y * y < 1 \/ 16) iter = max_iter;\n\n zx = zy = zx2 = zy2 = 0;\n do {\n zy = 2 * zx * zy + y;\n zx = zx2 - zy2 + x;\n zx2 = zx * zx;\n zy2 = zy * zy;\n } while (iter++ < max_iter && zx2 + zy2 < 4);\n\n px->r = iter;\n px->g = iter;\n px->b = iter;\n }\n }\n\n for (int i = 0; i < height; i++) {\n rgb_t *px = row_ptrs[i];\n for (int j = 0; j < width; j++, px++) {\n map_colour(px);\n }\n }\n}\n\nint main(int argc, char *argv[])\n{\n const int width = (argc > 1) ? std::atoi(argv[1]) : 4096;\n const int height = (argc > 2) ? std::atoi(argv[2]) : 4096;\n const double scale = 1. \/ (width \/ 4);\n\n alloc_2d(width, height);\n calc_mandel(width, height, scale);\n screen_dump(width, height);\n\n delete[] img_data;\n delete[] row_ptrs;\n return 0;\n}\n<commit_msg>updating output filename<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <limits>\n\nusing uchar = unsigned char;\nconst double cx = -.6, cy = 0;\nconst uchar max_iter = std::numeric_limits<uchar>::max();\n\nstruct rgb_t { unsigned char r, g, b; };\n\nrgb_t **row_ptrs;\nrgb_t *img_data;\n\nvoid screen_dump(const int width, const int height)\n{\n FILE *fp = fopen(\"cpu-mandelbrot.ppm\", \"w\");\n fprintf(fp, \"P6\\n%d %d\\n255\\n\", width, height);\n for (int i = height - 1; i >= 0; i--)\n fwrite(row_ptrs[i], 1, width * sizeof(rgb_t), fp);\n fclose(fp);\n}\n\nvoid alloc_2d(const int width, const int height)\n{\n img_data = new rgb_t[width * height];\n row_ptrs = new rgb_t*[height];\n\n row_ptrs[0] = img_data;\n for (int i = 1; i < height; i++)\n row_ptrs[i] = row_ptrs[i - 1] + width;\n}\n\nvoid map_colour(rgb_t * const px)\n{\n const uchar num_shades = 16;\n const rgb_t mapping[num_shades] =\n { { 66,30,15 },{ 25,7,26 },{ 9,1,47 },{ 4,4,73 },{ 0,7,100 },\n { 12,44,138 },{ 24,82,177 },{ 57,125,209 },{ 134,181,229 },{ 211,236,248 },\n { 241,233,191 },{ 248,201,95 },{ 255,170,0 },{ 204,128,0 },{ 153,87,0 },\n { 106,52,3 } };\n\n if (px->r == max_iter || px->r == 0) {\n px->r = 0; px->g = 0; px->b = 0;\n }\n else {\n const uchar uc = px->r % num_shades;\n *px = mapping[uc];\n }\n}\n\nvoid calc_mandel(const int width, const int height, const double scale)\n{\n for (int i = 0; i < height; i++) {\n\n const double y = (i - height \/ 2) * scale + cy;\n\n rgb_t *px = row_ptrs[i];\n for (int j = 0; j < width; j++, px++) {\n\n const double x = (j - width \/ 2) * scale + cx;\n double zx, zy, zx2, zy2;\n uchar iter = 0;\n\n zx = hypot(x - .25, y);\n if (x < zx - 2 * zx * zx + .25) iter = max_iter;\n if ((x + 1)*(x + 1) + y * y < 1 \/ 16) iter = max_iter;\n\n zx = zy = zx2 = zy2 = 0;\n do {\n zy = 2 * zx * zy + y;\n zx = zx2 - zy2 + x;\n zx2 = zx * zx;\n zy2 = zy * zy;\n } while (iter++ < max_iter && zx2 + zy2 < 4);\n\n px->r = iter;\n px->g = iter;\n px->b = iter;\n }\n }\n\n for (int i = 0; i < height; i++) {\n rgb_t *px = row_ptrs[i];\n for (int j = 0; j < width; j++, px++) {\n map_colour(px);\n }\n }\n}\n\nint main(int argc, char *argv[])\n{\n const int width = (argc > 1) ? std::atoi(argv[1]) : 4096;\n const int height = (argc > 2) ? std::atoi(argv[2]) : 4096;\n const double scale = 1. \/ (width \/ 4);\n\n alloc_2d(width, height);\n calc_mandel(width, height, scale);\n screen_dump(width, height);\n\n delete[] img_data;\n delete[] row_ptrs;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string>\n#include <iostream>\n#include <SDL.h>\n#include <SDL_ttf.h>\n#include \"res_path.h\"\n#include \"cleanup.h\"\n\n\/*\n * Lesson 6: True Type Fonts with SDL_ttf\n *\/\n\/\/Screen attributes\nconst int SCREEN_WIDTH = 2560;\nconst int SCREEN_HEIGHT = 1440;\n\n\/*\n * Log an SDL error with some error message to the output stream of our choice\n * @param os The output stream to write the message too\n * @param msg The error message to write, format will be msg error: SDL_GetError()\n *\/\nvoid logSDLError(std::ostream &os, const std::string &msg){\n os << msg << \" error: \" << SDL_GetError() << std::endl;\n}\n\/*\n * Draw an SDL_Texture to an SDL_Renderer at some destination rect\n * taking a clip of the texture if desired\n * @param tex The source texture we want to draw\n * @param rend The renderer we want to draw too\n * @param dst The destination rectangle to render the texture too\n * @param clip The sub-section of the texture to draw (clipping rect)\n *\t\tdefault of nullptr draws the entire texture\n *\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, SDL_Rect dst, SDL_Rect *clip = nullptr){\n SDL_RenderCopy(ren, tex, clip, &dst);\n}\n\n\/*\n * Draw an SDL_Texture to an SDL_Renderer at position x, y, preserving\n * the texture's width and height and taking a clip of the texture if desired\n * If a clip is passed, the clip's width and height will be used instead of the texture's\n * @param tex The source texture we want to draw\n * @param rend The renderer we want to draw too\n * @param x The x coordinate to draw too\n * @param y The y coordinate to draw too\n * @param clip The sub-section of the texture to draw (clipping rect)\n *\t\tdefault of nullptr draws the entire texture\n *\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, int x, int y, SDL_Rect *clip = nullptr){\n SDL_Rect dst;\n dst.x = x;\n dst.y = y;\n if (clip != nullptr){\n dst.w = clip->w;\n dst.h = clip->h;\n }\n else {\n SDL_QueryTexture(tex, NULL, NULL, &dst.w, &dst.h);\n }\n renderTexture(tex, ren, dst, clip);\n}\n\/*\n * Render the message we want to display to a texture for drawing\n * @param message The message we want to display\n * @param fontFile The font we want to use to render the text\n * @param color The color we want the text to be\n * @param fontSize The size we want the font to be\n * @param renderer The renderer to load the texture in\n * @return An SDL_Texture containing the rendered message, or nullptr if something went wrong\n *\/\nSDL_Texture* renderText(const std::string &message, const std::string &fontFile, SDL_Color color,\n int fontSize, SDL_Renderer *renderer)\n{\n \/\/Open the font\n TTF_Font *font = TTF_OpenFont(fontFile.c_str(), fontSize);\n if (font == nullptr){\n logSDLError(std::cout, \"TTF_OpenFont\");\n return nullptr;\n }\n \/\/We need to first render to a surface as that's what TTF_RenderText returns, then\n \/\/load that surface into a texture\n SDL_Surface *surf = TTF_RenderText_Blended(font, message.c_str(), color);\n if (surf == nullptr){\n TTF_CloseFont(font);\n logSDLError(std::cout, \"TTF_RenderText\");\n return nullptr;\n }\n SDL_Texture *texture = SDL_CreateTextureFromSurface(renderer, surf);\n if (texture == nullptr){\n logSDLError(std::cout, \"CreateTexture\");\n }\n \/\/Clean up the surface and font\n SDL_FreeSurface(surf);\n TTF_CloseFont(font);\n return texture;\n}\nSDL_Texture* drawText(const std::string &message, const std::string &fontFile, SDL_Color color,\n int fontSize, SDL_Renderer *renderer, int x, int y) {\n SDL_Texture* t = renderText(message,getResourcePath(\"pinetree\")+fontFile, color, 64, renderer);\n renderTexture(t, renderer, x, y);\n return t;\n}\n\nauto timePrev = std::chrono::high_resolution_clock::now();\n\n\/\/ Returns time since last time this function was called in seconds with nanosecond precision\ndouble GetDelta()\n{\n \/\/ Gett current time as a std::chrono::time_point\n \/\/ which basically contains info about the current point in time\n auto timeCurrent = std::chrono::high_resolution_clock::now();\n \n \/\/ Compare the two to create time_point containing delta time in nanosecnds\n auto timeDiff = std::chrono::duration_cast< std::chrono::nanoseconds >( timeCurrent - timePrev );\n \n \/\/ Get the tics as a variable\n double delta = timeDiff.count();\n \n \/\/ Turn nanoseconds into seconds\n delta \/= 1000000000;\n \n timePrev = timeCurrent;\n return delta;\n}\n\nint main(int, char**){\n \/\/Start up SDL and make sure it went ok\n if (SDL_Init(SDL_INIT_VIDEO) != 0){\n logSDLError(std::cout, \"SDL_Init\");\n return 1;\n }\n \/\/Also need to init SDL_ttf\n if (TTF_Init() != 0){\n logSDLError(std::cout, \"TTF_Init\");\n SDL_Quit();\n return 1;\n }\n \n \/\/Setup our window and renderer\n SDL_Window *window = SDL_CreateWindow(\"Pinetree\", SDL_WINDOWPOS_CENTERED,\n SDL_WINDOWPOS_CENTERED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n SDL_SetWindowFullscreen(window, SDL_WINDOW_FULLSCREEN_DESKTOP);\n if (window == nullptr){\n logSDLError(std::cout, \"CreateWindow\");\n TTF_Quit();\n SDL_Quit();\n return 1;\n }\n SDL_Renderer *renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (renderer == nullptr){\n logSDLError(std::cout, \"CreateRenderer\");\n cleanup(window);\n TTF_Quit();\n SDL_Quit();\n return 1;\n }\n \n const std::string resPath = getResourcePath(\"pinetree\");\n std::cout << resPath << std::endl;\n \/\/We'll render the string \"TTF fonts are cool!\" in white\n \/\/Color is in RGB format\n \/\/ if (image == nullptr){\n \/\/ cleanup(image, renderer, window);\n \/\/ TTF_Quit();\n \/\/ SDL_Quit();\n \/\/ return 1;\n \/\/ }\n \n \/\/Get the texture w\/h so we can center it in the screen\n \n \n \n SDL_Event e;\n bool quit = false;\n \n SDL_Color color = {255,255,255,255};\n SDL_Texture* t = renderText(\"Pinetree\",getResourcePath(\"pinetree\")+\"Tuffy.ttf\", color, 64, renderer);\n int iW, iH;\n SDL_QueryTexture(t, NULL, NULL, &iW, &iH);\n int x = SCREEN_WIDTH \/ 2 - iW \/ 2;\n int y = SCREEN_HEIGHT \/ 2 - iH \/ 2;\n \n double last = 0;\n float deltaTime = 0.0;\n \n \n unsigned int bIndex = 0;\n \n SDL_Surface *image = SDL_LoadBMP(\"bg.bmp\");\n if (image == NULL)\n SDL_ShowSimpleMessageBox(0, \"Image init error\", SDL_GetError(),\n window);\n SDL_Texture * texture = SDL_CreateTextureFromSurface(renderer,\n image);\n if (texture == NULL)\n SDL_ShowSimpleMessageBox(0, \"Texture init error\",\n SDL_GetError(), window);\n \n while (!quit){\n \/\/Event Polling\n while (SDL_PollEvent(&e)){\n \n if (e.type == SDL_QUIT){\n quit = true;\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE){\n quit = true;\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_RIGHT) {\n \n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_DOWN) {\n if (bIndex!=1) {\n ++bIndex;\n }\n else {\n bIndex=0;\n }\n \n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_UP) {\n if (bIndex!=0) {\n --bIndex;\n }\n else {\n bIndex=0;\n }\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_LEFT) {\n \n }\n if(e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_RETURN) {\n switch(bIndex) {\n case 0:\n SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION,\n \"You clicked list\",\n \"NOT IMPLEMENTED YET\",\n NULL);\n break;\n \n case 1:\n quit=true;\n break;\n }\n \n }\n }\n double now = SDL_GetTicks();\n \/\/deltatime is in seconds\n if (now > last) {\n deltaTime = ((float)(now - last)) \/ 1000;\n last = now;\n }\n \n SDL_SetRenderDrawColor(renderer, 255, 0, 0, 255);\n SDL_RenderClear(renderer);\n \n \n renderTexture(texture, renderer, 0,0);\n \n \/\/We can draw our message as we do any other texture, since it's been\n \/\/rendered to a texture\n \n \n renderTexture(t, renderer, x, y);\n \n SDL_Texture* t2=renderText(\"(C)ForestCorp\"+std::to_string(bIndex), getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {255,255,255,255}, 40, renderer);\n renderTexture(t2, renderer, x-10, y+65);\n \n \/\/List button\n SDL_Rect listButtonRect = {100,100,400,100}; \/* Define button rectangle *\/\n SDL_Texture* listButtonText = renderText(\"List\", getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {0,0,0,255}, 100, renderer); \/* Define button text *\/\n int listButtonOn=bIndex-0; \/* Calculate if the button should be on *\/\n SDL_SetRenderDrawColor(renderer, 255*(bIndex-0)*listButtonOn\/* Calculate again *\/, 255, 255, 255); \/* Set rectangle color *\/\n SDL_RenderFillRect(renderer, &listButtonRect); \/* Draw the rect *\/\n renderTexture(listButtonText, renderer, 100,100); \/* Render the text's texture *\/\n \n \/\/Shutdown button\n SDL_Rect shutdownButtonRect = {100,200,400,100}; \/* Define button rectangle *\/\n SDL_Texture* shutdownButtonText = renderText(\"Shutdown\", getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {0,0,0,255}, 100, renderer); \/* Define button text *\/\n int shutdownButtonOn=bIndex-1; \/* Calculate if the button should be on *\/\n SDL_SetRenderDrawColor(renderer, 255*(bIndex-1)*shutdownButtonOn\/* Calculate again *\/, 255, 255, 255); \/* Set rectangle color *\/\n SDL_RenderFillRect(renderer, &shutdownButtonRect); \/* Draw the rect *\/\n renderTexture(shutdownButtonText, renderer, 100,200); \/* Render the text's texture *\/\n \n \n \n SDL_RenderPresent(renderer);\n \n \n \n }\n \/\/Clean up\n \/\/ cleanup(image, renderer, window);\n \/\/ TTF_Quit();\n \/\/ SDL_Quit();\n \n return 0;\n}\n<commit_msg>Added settings Button<commit_after>#include <string>\n#include <iostream>\n#include <SDL.h>\n#include <SDL_ttf.h>\n#include \"res_path.h\"\n#include \"cleanup.h\"\n\n\/*\n * Lesson 6: True Type Fonts with SDL_ttf\n *\/\n\/\/Screen attributes\nconst int SCREEN_WIDTH = 2560;\nconst int SCREEN_HEIGHT = 1440;\n\n\/*\n * Log an SDL error with some error message to the output stream of our choice\n * @param os The output stream to write the message too\n * @param msg The error message to write, format will be msg error: SDL_GetError()\n *\/\nvoid logSDLError(std::ostream &os, const std::string &msg){\n os << msg << \" error: \" << SDL_GetError() << std::endl;\n}\n\/*\n * Draw an SDL_Texture to an SDL_Renderer at some destination rect\n * taking a clip of the texture if desired\n * @param tex The source texture we want to draw\n * @param rend The renderer we want to draw too\n * @param dst The destination rectangle to render the texture too\n * @param clip The sub-section of the texture to draw (clipping rect)\n *\t\tdefault of nullptr draws the entire texture\n *\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, SDL_Rect dst, SDL_Rect *clip = nullptr){\n SDL_RenderCopy(ren, tex, clip, &dst);\n}\n\n\/*\n * Draw an SDL_Texture to an SDL_Renderer at position x, y, preserving\n * the texture's width and height and taking a clip of the texture if desired\n * If a clip is passed, the clip's width and height will be used instead of the texture's\n * @param tex The source texture we want to draw\n * @param rend The renderer we want to draw too\n * @param x The x coordinate to draw too\n * @param y The y coordinate to draw too\n * @param clip The sub-section of the texture to draw (clipping rect)\n *\t\tdefault of nullptr draws the entire texture\n *\/\nvoid renderTexture(SDL_Texture *tex, SDL_Renderer *ren, int x, int y, SDL_Rect *clip = nullptr){\n SDL_Rect dst;\n dst.x = x;\n dst.y = y;\n if (clip != nullptr){\n dst.w = clip->w;\n dst.h = clip->h;\n }\n else {\n SDL_QueryTexture(tex, NULL, NULL, &dst.w, &dst.h);\n }\n renderTexture(tex, ren, dst, clip);\n}\n\/*\n * Render the message we want to display to a texture for drawing\n * @param message The message we want to display\n * @param fontFile The font we want to use to render the text\n * @param color The color we want the text to be\n * @param fontSize The size we want the font to be\n * @param renderer The renderer to load the texture in\n * @return An SDL_Texture containing the rendered message, or nullptr if something went wrong\n *\/\nSDL_Texture* renderText(const std::string &message, const std::string &fontFile, SDL_Color color,\n int fontSize, SDL_Renderer *renderer)\n{\n \/\/Open the font\n TTF_Font *font = TTF_OpenFont(fontFile.c_str(), fontSize);\n if (font == nullptr){\n logSDLError(std::cout, \"TTF_OpenFont\");\n return nullptr;\n }\n \/\/We need to first render to a surface as that's what TTF_RenderText returns, then\n \/\/load that surface into a texture\n SDL_Surface *surf = TTF_RenderText_Blended(font, message.c_str(), color);\n if (surf == nullptr){\n TTF_CloseFont(font);\n logSDLError(std::cout, \"TTF_RenderText\");\n return nullptr;\n }\n SDL_Texture *texture = SDL_CreateTextureFromSurface(renderer, surf);\n if (texture == nullptr){\n logSDLError(std::cout, \"CreateTexture\");\n }\n \/\/Clean up the surface and font\n SDL_FreeSurface(surf);\n TTF_CloseFont(font);\n return texture;\n}\nSDL_Texture* drawText(const std::string &message, const std::string &fontFile, SDL_Color color,\n int fontSize, SDL_Renderer *renderer, int x, int y) {\n SDL_Texture* t = renderText(message,getResourcePath(\"pinetree\")+fontFile, color, 64, renderer);\n renderTexture(t, renderer, x, y);\n return t;\n}\n\nauto timePrev = std::chrono::high_resolution_clock::now();\n\n\/\/ Returns time since last time this function was called in seconds with nanosecond precision\ndouble GetDelta()\n{\n \/\/ Gett current time as a std::chrono::time_point\n \/\/ which basically contains info about the current point in time\n auto timeCurrent = std::chrono::high_resolution_clock::now();\n \n \/\/ Compare the two to create time_point containing delta time in nanosecnds\n auto timeDiff = std::chrono::duration_cast< std::chrono::nanoseconds >( timeCurrent - timePrev );\n \n \/\/ Get the tics as a variable\n double delta = timeDiff.count();\n \n \/\/ Turn nanoseconds into seconds\n delta \/= 1000000000;\n \n timePrev = timeCurrent;\n return delta;\n}\n\nint main(int, char**){\n \/\/Start up SDL and make sure it went ok\n if (SDL_Init(SDL_INIT_VIDEO) != 0){\n logSDLError(std::cout, \"SDL_Init\");\n return 1;\n }\n \/\/Also need to init SDL_ttf\n if (TTF_Init() != 0){\n logSDLError(std::cout, \"TTF_Init\");\n SDL_Quit();\n return 1;\n }\n \n \/\/Setup our window and renderer\n SDL_Window *window = SDL_CreateWindow(\"Pinetree\", SDL_WINDOWPOS_CENTERED,\n SDL_WINDOWPOS_CENTERED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n SDL_SetWindowFullscreen(window, SDL_WINDOW_FULLSCREEN_DESKTOP);\n if (window == nullptr){\n logSDLError(std::cout, \"CreateWindow\");\n TTF_Quit();\n SDL_Quit();\n return 1;\n }\n SDL_Renderer *renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (renderer == nullptr){\n logSDLError(std::cout, \"CreateRenderer\");\n cleanup(window);\n TTF_Quit();\n SDL_Quit();\n return 1;\n }\n \n const std::string resPath = getResourcePath(\"pinetree\");\n std::cout << resPath << std::endl;\n \/\/We'll render the string \"TTF fonts are cool!\" in white\n \/\/Color is in RGB format\n \/\/ if (image == nullptr){\n \/\/ cleanup(image, renderer, window);\n \/\/ TTF_Quit();\n \/\/ SDL_Quit();\n \/\/ return 1;\n \/\/ }\n \n \/\/Get the texture w\/h so we can center it in the screen\n \n \n \n SDL_Event e;\n bool quit = false;\n \n SDL_Color color = {255,255,255,255};\n SDL_Texture* t = renderText(\"Pinetree\",getResourcePath(\"pinetree\")+\"Tuffy.ttf\", color, 64, renderer);\n int iW, iH;\n SDL_QueryTexture(t, NULL, NULL, &iW, &iH);\n int x = SCREEN_WIDTH \/ 2 - iW \/ 2;\n int y = SCREEN_HEIGHT \/ 2 - iH \/ 2;\n \n double last = 0;\n float deltaTime = 0.0;\n \n \n unsigned int bIndex = 0;\n \n SDL_Surface *image = SDL_LoadBMP(\"bg.bmp\");\n if (image == NULL)\n SDL_ShowSimpleMessageBox(0, \"Image init error\", SDL_GetError(),\n window);\n SDL_Texture * texture = SDL_CreateTextureFromSurface(renderer,\n image);\n if (texture == NULL)\n SDL_ShowSimpleMessageBox(0, \"Texture init error\",\n SDL_GetError(), window);\n \n while (!quit){\n \/\/Event Polling\n while (SDL_PollEvent(&e)){\n \n if (e.type == SDL_QUIT){\n quit = true;\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE){\n quit = true;\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_RIGHT) {\n \n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_DOWN) {\n if (bIndex!=2) {\n ++bIndex;\n }\n else {\n bIndex=0;\n }\n \n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_UP) {\n if (bIndex!=0) {\n --bIndex;\n }\n else {\n bIndex=0;\n }\n }\n if (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_LEFT) {\n \n }\n if(e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_RETURN) {\n switch(bIndex) {\n case 0:\n SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION,\n \"You clicked list\",\n \"NOT IMPLEMENTED YET\",\n NULL);\n break;\n \n case 1:\n quit=true;\n break;\n case 2:\n SDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_INFORMATION,\n \"You clicked settings\",\n \"NOT IMPLEMENTED YET\",\n NULL);\n \n break;\n }\n \n }\n }\n double now = SDL_GetTicks();\n \/\/deltatime is in seconds\n if (now > last) {\n deltaTime = ((float)(now - last)) \/ 1000;\n last = now;\n }\n \n SDL_SetRenderDrawColor(renderer, 255, 0, 0, 255);\n SDL_RenderClear(renderer);\n \n \n renderTexture(texture, renderer, 0,0);\n \n \/\/We can draw our message as we do any other texture, since it's been\n \/\/rendered to a texture\n \n \n renderTexture(t, renderer, x, y);\n \n SDL_Texture* t2=renderText(\"(C)ForestCorp\"+std::to_string(bIndex), getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {255,255,255,255}, 40, renderer);\n renderTexture(t2, renderer, x-10, y+65);\n \n \/\/List button\n SDL_Rect listButtonRect = {100,100,400,100}; \/* Define button rectangle *\/\n SDL_Texture* listButtonText = renderText(\"List\", getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {0,0,0,255}, 100, renderer); \/* Define button text *\/\n int listButtonOn=bIndex-0; \/* Calculate if the button should be on *\/\n SDL_SetRenderDrawColor(renderer, 255*(bIndex-0)*listButtonOn\/* Calculate again *\/, 255, 255, 255); \/* Set rectangle color *\/\n SDL_RenderFillRect(renderer, &listButtonRect); \/* Draw the rect *\/\n renderTexture(listButtonText, renderer, 100,100); \/* Render the text's texture *\/\n \n \/\/Shutdown button\n SDL_Rect shutdownButtonRect = {100,200,400,100}; \/* Define button rectangle *\/\n SDL_Texture* shutdownButtonText = renderText(\"Shutdown\", getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {0,0,0,255}, 100, renderer); \/* Define button text *\/\n int shutdownButtonOn=bIndex-1; \/* Calculate if the button should be on *\/\n SDL_SetRenderDrawColor(renderer, 255*(bIndex-1)*shutdownButtonOn\/* Calculate again *\/, 255, 255, 255); \/* Set rectangle color *\/\n SDL_RenderFillRect(renderer, &shutdownButtonRect); \/* Draw the rect *\/\n renderTexture(shutdownButtonText, renderer, 100,200); \/* Render the text's texture *\/\n \n \n \/\/Settings Button\n SDL_Rect settingsButtonRect = {100,300,400,100}; \/* Define button rectangle *\/\n SDL_Texture* settingsButtonText = renderText(\"Settings\", getResourcePath(\"pinetree\")+\"Tuffy.ttf\", {0,0,0,255}, 100, renderer); \/* Define button text *\/\n int settingsButtonOn=bIndex-2; \/* Calculate if the button should be on *\/\n SDL_SetRenderDrawColor(renderer, 255*(bIndex-2)*settingsButtonOn\/* Calculate again *\/, 255, 255, 255); \/* Set rectangle color *\/\n SDL_RenderFillRect(renderer, &settingsButtonRect); \/* Draw the rect *\/\n renderTexture(settingsButtonText, renderer, 100,300); \/* Render the text's texture *\/\n\n \n SDL_RenderPresent(renderer);\n \n \n \n }\n \/\/Clean up\n \/\/ cleanup(image, renderer, window);\n \/\/ TTF_Quit();\n \/\/ SDL_Quit();\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <string.h>\n#include <iostream>\n\nint main() {\n#ifdef __APPLE__\n const char* name = \"DYLD_LIBRARY_PATH\";\n#else\n const char* name = \"LD_LIBRARY_PATH\";\n#endif\n\n const char* cetLDPathValue = getenv(\"CETD_LIBRARY_PATH\");\n int res = setenv(\"DYLD_LIBRARY_PATH\", cetLDPathValue, 1);\n\n const char* localLDPathValue = getenv(name);\n\n if(strcmp(localLDPathValue,cetLDPathValue) != 0) {\n return 1;\n }\n std::cout << localLDPathValue << std::endl;\n\n return 0;\n}\n<commit_msg>Fix errors reported by Travis on Linux<commit_after>#include <cstdlib>\n#include <string.h>\n#include <iostream>\n\nint main() {\n#ifdef __APPLE__\n const char* name = \"DYLD_LIBRARY_PATH\";\n#else\n const char* name = \"LD_LIBRARY_PATH\";\n#endif\n\n const char* cetLDPathValue = getenv(\"CETD_LIBRARY_PATH\");\n int res = setenv(name, cetLDPathValue, 1);\n\n if (res != 0) {\n std::cerr << \"could not set \" << name << std::endl;\n return 1;\n }\n\n const char* localLDPathValue = getenv(name);\n\n if(strcmp(localLDPathValue,cetLDPathValue) != 0) {\n return 1;\n }\n std::cout << localLDPathValue << std::endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* dro project\n *\/\n\n#include \"wtf.h\" \/\/breakpoint for unhandled conditions\n\n#include \"gpio.h\"\n#include \"nvic.h\"\n#include \"clocks.h\"\n\n#include \"systick.h\"\nusing namespace SystemTimer;\n#include \"polledtimer.h\"\n#include \"tableofpointers.h\"\n\n#include \"core_cmInstr.h\" \/\/wfe OR wfi\n#include \"cruntime.h\"\n\n#include \"p1343_board.h\"\n\nusing namespace LPC;\n\n\/\/the next line actually sets up the clocks before main and pretty much anything else gets called:\nClockStarter startup InitStep(InitHardware\/2) (true,0,1000);\/\/external wasn't working properly, need a test to check before switching to it.\nP1343devkit board InitStep(InitApplication);\/\/construction of this turns on internal peripherals and configures pins.\nIrq pushButton(board.button.pini);\n\nusing namespace LPC;\n\nHandleInterrupt(P1343ButtonIrqNum){\n board.toggleLed(4);\n board.button.irqAcknowledge();\n}\n\nHandleInterrupt(54){\n board.toggleLed(5);\n board.button.irqAcknowledge();\n}\n\n\/\/p0-4,p05 for qei.\nInputPin<0,4> primePhase;\nInputPin<0,5> otherPhase;\nIrq prime(primePhase.pini);\n#define myIrq 4\n\n\/\/should go up and down depending upon the input signals;\nstatic int axis(0);\n\nHandleInterrupt( myIrq ) {\n \/\/prime phase interrupt\n bool dirbit = otherPhase;\n if (dirbit) {\n --axis; \/\/ignoring quarter phase for now\n } else {\n ++axis; \/\/will be +\/-4 here\n }\n \/\/??lpc input clear\n}\n\n#include \"fifo.h\"\nstatic FifoBuffer<33> outgoing;\nstatic FifoBuffer<63> incoming;\n\n#include \"uart.h\"\n\/** called by isr on an input event.\n * negative values of @param are notifications of line errors, -1 for interrupts disabled *\/\nbool uartReceiver(int indata){\n if((incoming=u8(indata))){\n return true;\n } else {\n wtf(24);\n return false;\n }\n}\n\n\/** called by isr when transmission becomes possible.\n * @returns either an 8 bit unsigned character, or -1 to disable transmission events*\/\nint uartSender(){\n return outgoing;\/\/negative for fifo empty\n}\n\nvoid prepUart(){\n theUart.setFraming(\"N81\");\n theUart.setBaud(115200);\n theUart.setTransmitter(&uartSender);\n theUart.setReceiver(&uartReceiver);\n\n theUart.reception(true);\n theUart.irq(true);\n}\n\n#include \"minimath.h\"\n\nstatic CyclicTimer slowToggle; \/\/since action is polled might as well wait until main to declare the object.\nRegisterTimer(slowToggle);\n\nMakeRef(SystemTicker,PolledTimerServer);\n\nint main(void) {\n prepUart();\n slowToggle.restart(ticksForSeconds(1.333));\n \/\/soft stuff\n int events=0;\n\n prime.enable();\n pushButton.enable();\/\/@nvic\n board.button.setIrqStyle(GPIO::LowEdge,true);\n Irq gp2irq(gpioBankInterrupt(2));\n gp2irq.prepare();\n \/\/no longer doing this prophylactically in the loop as we now use atomics rather than interrupt gating to deal with concurrency.\n EnableInterrupts;\/\/master enable\n\/\/ events=sumObjs();\n while (1) {\n MNE(WFE);\/\/wait for event, expecting interrupts to also be events.\n ++events;\n board.led1 = board.button;\n if(slowToggle.hasFired()){\n board.toggleLed(0);\n if((outgoing='A'+(events&15))){\n theUart.beTransmitting();\n }\n }\n }\n return 0;\n}\n\n<commit_msg>input irq's working, mostly with templated i\/o<commit_after>\/* dro project\n *\/\n\n#include \"wtf.h\" \/\/breakpoint for unhandled conditions\n\n#include \"gpio.h\"\n#include \"nvic.h\"\n#include \"clocks.h\"\n\n#include \"systick.h\"\nusing namespace SystemTimer;\n#include \"polledtimer.h\"\n#include \"tableofpointers.h\"\n\n#include \"core_cmInstr.h\" \/\/wfe OR wfi\n#include \"cruntime.h\"\n\n#include \"p1343_board.h\"\n\nusing namespace LPC;\n\n\/\/the next line actually sets up the clocks before main and pretty much anything else gets called:\nClockStarter startup InitStep(InitHardware\/2) (true,0,1000);\/\/external wasn't working properly, need a test to check before switching to it.\nP1343devkit board InitStep(InitApplication);\/\/construction of this turns on internal peripherals and configures pins.\nIrq pushButton(board.button.pini);\n\nusing namespace LPC;\n\nHandleInterrupt(P1343ButtonIrqNum){\n board.toggleLed(4);\n board.button.irqAcknowledge();\n}\n\nHandleInterrupt(54){\/\/this gets the button irq\n board.toggleLed(5);\n board.button.irqAcknowledge();\n}\n\n\/\/p0-4,p05 for qei.\nInputPin<0,4> primePhase;\nInputPin<0,5> otherPhase;\nIrq prime(primePhase.pini);\n#define myIrq 4\n\n\/\/should go up and down depending upon the input signals;\nstatic int axis(0);\n\nHandleInterrupt( myIrq ) {\n \/\/prime phase interrupt\n bool dirbit = otherPhase;\n if (dirbit) {\n --axis; \/\/ignoring quarter phase for now\n } else {\n ++axis; \/\/will be +\/-4 here\n }\n \/\/??lpc input clear\n}\n\n#include \"fifo.h\"\nstatic FifoBuffer<33> outgoing;\nstatic FifoBuffer<63> incoming;\n\n#include \"uart.h\"\n\/** called by isr on an input event.\n * negative values of @param are notifications of line errors, -1 for interrupts disabled *\/\nbool uartReceiver(int indata){\n if((incoming=u8(indata))){\n return true;\n } else {\n wtf(24);\n return false;\n }\n}\n\n\/** called by isr when transmission becomes possible.\n * @returns either an 8 bit unsigned character, or -1 to disable transmission events*\/\nint uartSender(){\n return outgoing;\/\/negative for fifo empty\n}\n\nvoid prepUart(){\n theUart.setFraming(\"N81\");\n theUart.setBaud(115200);\n theUart.setTransmitter(&uartSender);\n theUart.setReceiver(&uartReceiver);\n\n theUart.reception(true);\n theUart.irq(true);\n}\n\n#include \"minimath.h\"\n\nstatic CyclicTimer slowToggle; \/\/since action is polled might as well wait until main to declare the object.\nRegisterTimer(slowToggle);\n\nMakeRef(SystemTicker,PolledTimerServer);\n\nint main(void) {\n prepUart();\n slowToggle.restart(ticksForSeconds(0.333));\n \/\/soft stuff\n int events=0;\n\n prime.enable();\n pushButton.enable();\/\/@nvic\n board.button.setIrqStyle(GPIO::AnyEdge,true);\n Irq gp2irq(gpioBankInterrupt(2));\n gp2irq.prepare();\n \/\/no longer doing this prophylactically in the loop as we now use atomics rather than interrupt gating to deal with concurrency.\n EnableInterrupts;\/\/master enable\n\/\/ events=sumObjs();\n while (1) {\n MNE(WFE);\/\/wait for event, expecting interrupts to also be events.\n ++events;\n\/\/works, now will do using isr board.led1 = board.button;\n if(slowToggle.hasFired()){\n board.toggleLed(0);\n if((outgoing='A'+(events&15))){\n theUart.beTransmitting();\n }\n }\n }\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Memory pool.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_PROXY_POOL_HXX\n#define BENG_PROXY_POOL_HXX\n\n#include \"trace.h\"\n\n#include <inline\/compiler.h>\n\n#include <utility>\n#include <new>\n\n#ifndef NDEBUG\n#include <assert.h>\n#endif\n\n#include <stddef.h>\n#include <stdbool.h>\n\nstruct pool;\nstruct SlicePool;\n\nstruct pool_mark_state {\n \/**\n * The area that was current when the mark was set.\n *\/\n struct linear_pool_area *area;\n\n \/**\n * The area before #area. This is used to dispose areas that were\n * inserted before the current area due to a large allocation.\n *\/\n struct linear_pool_area *prev;\n\n \/**\n * The position within the current area when the mark was set.\n *\/\n size_t position;\n\n#ifndef NDEBUG\n \/**\n * Used in an assertion: if the pool was empty before pool_mark(),\n * it must be empty again after pool_rewind().\n *\/\n bool was_empty;\n#endif\n};\n\nstruct StringView;\n\nvoid\npool_recycler_clear();\n\ngcc_malloc\nstruct pool *\npool_new_libc(struct pool *parent, const char *name);\n\ngcc_malloc\nstruct pool *\npool_new_linear(struct pool *parent, const char *name, size_t initial_size);\n\ngcc_malloc\nstruct pool *\npool_new_slice(struct pool *parent, const char *name,\n struct SlicePool *slice_pool);\n\n#ifdef NDEBUG\n\n#define pool_set_major(pool)\n#define pool_set_persistent(pool)\n\n#else\n\nvoid\npool_set_major(struct pool *pool);\n\nvoid\npool_set_persistent(struct pool *pool);\n\n#endif\n\nvoid\npool_ref_impl(struct pool *pool TRACE_ARGS_DECL);\n\n#define pool_ref(pool) pool_ref_impl(pool TRACE_ARGS)\n#define pool_ref_fwd(pool) pool_ref_impl(pool TRACE_ARGS_FWD)\n\nunsigned\npool_unref_impl(struct pool *pool TRACE_ARGS_DECL);\n\n#define pool_unref(pool) pool_unref_impl(pool TRACE_ARGS)\n#define pool_unref_fwd(pool) pool_unref_impl(pool TRACE_ARGS_FWD)\n\nclass LinearPool {\n struct pool &p;\n\npublic:\n LinearPool(struct pool &parent, const char *name, size_t initial_size)\n :p(*pool_new_linear(&parent, name, initial_size)) {}\n\n ~LinearPool() {\n gcc_unused auto ref = pool_unref(&p);\n#ifndef NDEBUG\n assert(ref == 0);\n#endif\n }\n\n struct pool &get() {\n return p;\n }\n\n operator struct pool &() {\n return p;\n }\n\n operator struct pool *() {\n return &p;\n }\n};\n\n\/**\n * Returns the total size of all allocations in this pool.\n *\/\ngcc_pure\nsize_t\npool_netto_size(const struct pool *pool);\n\n\/**\n * Returns the total amount of memory allocated by this pool.\n *\/\ngcc_pure\nsize_t\npool_brutto_size(const struct pool *pool);\n\n\/**\n * Returns the total size of this pool and all of its descendants\n * (recursively).\n *\/\ngcc_pure\nsize_t\npool_recursive_netto_size(const struct pool *pool);\n\ngcc_pure\nsize_t\npool_recursive_brutto_size(const struct pool *pool);\n\n\/**\n * Returns the total size of all descendants of this pool (recursively).\n *\/\ngcc_pure\nsize_t\npool_children_netto_size(const struct pool *pool);\n\ngcc_pure\nsize_t\npool_children_brutto_size(const struct pool *pool);\n\nvoid\npool_dump_tree(const struct pool *pool);\n\n#ifndef NDEBUG\n#include <inline\/list.h>\n\nstruct pool_notify_state {\n struct list_head siblings;\n\n struct pool *pool;\n\n const char *name;\n\n bool destroyed, registered;\n\n#ifdef TRACE\n const char *file;\n int line;\n\n const char *destroyed_file;\n int destroyed_line;\n#endif\n};\n\nvoid\npool_notify(struct pool *pool, struct pool_notify_state *notify);\n\nbool\npool_denotify(struct pool_notify_state *notify);\n\n\/**\n * Hands over control from an existing #pool_notify to a new one. The\n * old one is unregistered.\n *\/\nvoid\npool_notify_move(struct pool *pool, struct pool_notify_state *src,\n struct pool_notify_state *dest);\n\nclass PoolNotify {\n struct pool_notify_state state;\n\npublic:\n explicit PoolNotify(struct pool &pool) {\n pool_notify(&pool, &state);\n }\n\n PoolNotify(const PoolNotify &) = delete;\n\n#ifndef NDEBUG\n ~PoolNotify() {\n assert(!state.registered);\n }\n#endif\n\n bool Denotify() {\n return pool_denotify(&state);\n }\n};\n\n#endif\n\nclass ScopePoolRef {\n struct pool &pool;\n#ifndef NDEBUG\n PoolNotify notify;\n#endif\n\n#ifdef TRACE\n const char *const file;\n unsigned line;\n#endif\n\npublic:\n explicit ScopePoolRef(struct pool &_pool TRACE_ARGS_DECL_)\n :pool(_pool)\n#ifndef NDEBUG\n , notify(_pool)\n#endif\n TRACE_ARGS_INIT\n {\n pool_ref_fwd(&_pool);\n }\n\n ScopePoolRef(const ScopePoolRef &) = delete;\n\n ~ScopePoolRef() {\n#ifndef NDEBUG\n notify.Denotify();\n#endif\n pool_unref_fwd(&pool);\n }\n};\n\n#ifndef NDEBUG\n\nvoid\npool_ref_notify_impl(struct pool *pool, struct pool_notify_state *notify TRACE_ARGS_DECL);\n\nvoid\npool_unref_denotify_impl(struct pool *pool, struct pool_notify_state *notify\n TRACE_ARGS_DECL);\n\n\/**\n * Do a \"checked\" pool reference.\n *\/\n#define pool_ref_notify(pool, notify) \\\n pool_ref_notify_impl(pool, notify TRACE_ARGS)\n\n\/**\n * Do a \"checked\" pool unreference. If the pool has been destroyed,\n * an assertion will fail. Double frees are also caught.\n *\/\n#define pool_unref_denotify(pool, notify) \\\n pool_unref_denotify_impl(pool, notify TRACE_ARGS)\n\n#else\n#define pool_ref_notify(pool, notify) pool_ref(pool)\n#define pool_unref_denotify(pool, notify) pool_unref(pool)\n#endif\n\n#ifdef NDEBUG\n\nstatic inline void\npool_trash(gcc_unused struct pool *pool)\n{\n}\n\nstatic inline void\npool_commit()\n{\n}\n\nstatic inline void\npool_attach(gcc_unused struct pool *pool, gcc_unused const void *p,\n gcc_unused const char *name)\n{\n}\n\nstatic inline void\npool_attach_checked(gcc_unused struct pool *pool, gcc_unused const void *p,\n gcc_unused const char *name)\n{\n}\n\nstatic inline void\npool_detach(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n}\n\nstatic inline void\npool_detach_checked(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n}\n\nstatic inline const char *\npool_attachment_name(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n return NULL;\n}\n\n#else\n\nvoid\npool_trash(struct pool *pool);\n\nvoid\npool_commit();\n\nbool\npool_contains(struct pool *pool, const void *ptr, size_t size);\n\n\/**\n * Attach an opaque object to the pool. It must be detached before\n * the pool is destroyed. This is used in debugging mode to track\n * whether all external objects have been destroyed.\n *\/\nvoid\npool_attach(struct pool *pool, const void *p, const char *name);\n\n\/**\n * Same as pool_attach(), but checks if the object is already\n * registered.\n *\/\nvoid\npool_attach_checked(struct pool *pool, const void *p, const char *name);\n\nvoid\npool_detach(struct pool *pool, const void *p);\n\nvoid\npool_detach_checked(struct pool *pool, const void *p);\n\nconst char *\npool_attachment_name(struct pool *pool, const void *p);\n\n#endif\n\nvoid\npool_mark(struct pool *pool, struct pool_mark_state *mark);\n\nvoid\npool_rewind(struct pool *pool, const struct pool_mark_state *mark);\n\nclass AutoRewindPool {\n struct pool &pool;\n pool_mark_state mark;\n\npublic:\n AutoRewindPool(struct pool &_pool):pool(_pool) {\n pool_mark(&pool, &mark);\n }\n\n AutoRewindPool(const AutoRewindPool &) = delete;\n\n ~AutoRewindPool() {\n pool_rewind(&pool, &mark);\n }\n};\n\ngcc_malloc\nvoid *\np_malloc_impl(struct pool *pool, size_t size TRACE_ARGS_DECL);\n\n#define p_malloc(pool, size) p_malloc_impl(pool, size TRACE_ARGS)\n#define p_malloc_fwd(pool, size) p_malloc_impl(pool, size TRACE_ARGS_FWD)\n\nvoid\np_free(struct pool *pool, const void *ptr);\n\ngcc_malloc\nvoid *\np_calloc_impl(struct pool *pool, size_t size TRACE_ARGS_DECL);\n\n#define p_calloc(pool, size) p_calloc_impl(pool, size TRACE_ARGS)\n\ngcc_malloc\nvoid *\np_memdup_impl(struct pool *pool, const void *src, size_t length TRACE_ARGS_DECL);\n\n#define p_memdup(pool, src, length) p_memdup_impl(pool, src, length TRACE_ARGS)\n#define p_memdup_fwd(pool, src, length) p_memdup_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strdup_impl(struct pool *pool, const char *src TRACE_ARGS_DECL);\n\n#define p_strdup(pool, src) p_strdup_impl(pool, src TRACE_ARGS)\n#define p_strdup_fwd(pool, src) p_strdup_impl(pool, src TRACE_ARGS_FWD)\n\nstatic inline const char *\np_strdup_checked(struct pool *pool, const char *s)\n{\n return s == NULL ? NULL : p_strdup(pool, s);\n}\n\ngcc_malloc\nchar *\np_strdup_lower_impl(struct pool *pool, const char *src TRACE_ARGS_DECL);\n\n#define p_strdup_lower(pool, src) p_strdup_lower_impl(pool, src TRACE_ARGS)\n#define p_strdup_lower_fwd(pool, src) p_strdup_lower_impl(pool, src TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strndup_impl(struct pool *pool, const char *src, size_t length TRACE_ARGS_DECL);\n\n#define p_strndup(pool, src, length) p_strndup_impl(pool, src, length TRACE_ARGS)\n#define p_strndup_fwd(pool, src, length) p_strndup_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strndup_lower_impl(struct pool *pool, const char *src, size_t length TRACE_ARGS_DECL);\n\n#define p_strndup_lower(pool, src, length) p_strndup_lower_impl(pool, src, length TRACE_ARGS)\n#define p_strndup_lower_fwd(pool, src, length) p_strndup_lower_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc gcc_printf(2, 3)\nchar *\np_sprintf(struct pool *pool, const char *fmt, ...);\n\ngcc_malloc\nchar *\np_strcat(struct pool *pool, const char *s, ...);\n\ngcc_malloc\nchar *\np_strncat(struct pool *pool, const char *s, size_t length, ...);\n\ntemplate<typename T>\nT *\nPoolAlloc(pool &p)\n{\n return (T *)p_malloc(&p, sizeof(T));\n}\n\ntemplate<typename T>\nT *\nPoolAlloc(pool &p, size_t n)\n{\n return (T *)p_malloc(&p, sizeof(T) * n);\n}\n\ntemplate<>\ninline void *\nPoolAlloc<void>(pool &p, size_t n)\n{\n return p_malloc(&p, n);\n}\n\ntemplate<typename T, typename... Args>\nT *\nNewFromPool(pool &p, Args&&... args)\n{\n void *t = PoolAlloc<T>(p);\n return ::new(t) T(std::forward<Args>(args)...);\n}\n\ntemplate<typename T>\nvoid\nDeleteFromPool(struct pool &pool, T *t)\n{\n t->~T();\n p_free(&pool, t);\n}\n\n\/**\n * A disposer for boost::intrusive that invokes the DeleteFromPool()\n * on the given pointer.\n *\/\nclass PoolDisposer {\n struct pool &p;\n\npublic:\n explicit PoolDisposer(struct pool &_p):p(_p) {}\n\n template<typename T>\n void operator()(T *t) {\n DeleteFromPool(p, t);\n }\n};\n\ntemplate<typename T>\nvoid\nDeleteUnrefPool(struct pool &pool, T *t)\n{\n DeleteFromPool(pool, t);\n pool_unref(&pool);\n}\n\ntemplate<typename T>\nvoid\nDeleteUnrefTrashPool(struct pool &pool, T *t)\n{\n pool_trash(&pool);\n DeleteUnrefPool(pool, t);\n}\n\nclass PoolAllocator {\n struct pool &pool;\n\npublic:\n explicit constexpr PoolAllocator(struct pool &_pool):pool(_pool) {}\n\n void *Allocate(size_t size) {\n return p_malloc(&pool, size);\n }\n\n char *DupString(const char *p) {\n return p_strdup(&pool, p);\n }\n\n void Free(void *p) {\n p_free(&pool, p);\n }\n\n template<typename T, typename... Args>\n T *New(Args&&... args) {\n return NewFromPool<T>(pool, std::forward<Args>(args)...);\n }\n\n template<typename T>\n void Delete(T *t) {\n DeleteFromPool(pool, t);\n }\n};\n\ngcc_malloc\nchar *\np_strdup_impl(struct pool &pool, StringView src TRACE_ARGS_DECL);\n\ngcc_malloc\nchar *\np_strdup_lower_impl(struct pool &pool, StringView src TRACE_ARGS_DECL);\n\n#endif\n<commit_msg>pool: add cast operators to class ScopePoolRef<commit_after>\/*\n * Memory pool.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#ifndef BENG_PROXY_POOL_HXX\n#define BENG_PROXY_POOL_HXX\n\n#include \"trace.h\"\n\n#include <inline\/compiler.h>\n\n#include <utility>\n#include <new>\n\n#ifndef NDEBUG\n#include <assert.h>\n#endif\n\n#include <stddef.h>\n#include <stdbool.h>\n\nstruct pool;\nstruct SlicePool;\n\nstruct pool_mark_state {\n \/**\n * The area that was current when the mark was set.\n *\/\n struct linear_pool_area *area;\n\n \/**\n * The area before #area. This is used to dispose areas that were\n * inserted before the current area due to a large allocation.\n *\/\n struct linear_pool_area *prev;\n\n \/**\n * The position within the current area when the mark was set.\n *\/\n size_t position;\n\n#ifndef NDEBUG\n \/**\n * Used in an assertion: if the pool was empty before pool_mark(),\n * it must be empty again after pool_rewind().\n *\/\n bool was_empty;\n#endif\n};\n\nstruct StringView;\n\nvoid\npool_recycler_clear();\n\ngcc_malloc\nstruct pool *\npool_new_libc(struct pool *parent, const char *name);\n\ngcc_malloc\nstruct pool *\npool_new_linear(struct pool *parent, const char *name, size_t initial_size);\n\ngcc_malloc\nstruct pool *\npool_new_slice(struct pool *parent, const char *name,\n struct SlicePool *slice_pool);\n\n#ifdef NDEBUG\n\n#define pool_set_major(pool)\n#define pool_set_persistent(pool)\n\n#else\n\nvoid\npool_set_major(struct pool *pool);\n\nvoid\npool_set_persistent(struct pool *pool);\n\n#endif\n\nvoid\npool_ref_impl(struct pool *pool TRACE_ARGS_DECL);\n\n#define pool_ref(pool) pool_ref_impl(pool TRACE_ARGS)\n#define pool_ref_fwd(pool) pool_ref_impl(pool TRACE_ARGS_FWD)\n\nunsigned\npool_unref_impl(struct pool *pool TRACE_ARGS_DECL);\n\n#define pool_unref(pool) pool_unref_impl(pool TRACE_ARGS)\n#define pool_unref_fwd(pool) pool_unref_impl(pool TRACE_ARGS_FWD)\n\nclass LinearPool {\n struct pool &p;\n\npublic:\n LinearPool(struct pool &parent, const char *name, size_t initial_size)\n :p(*pool_new_linear(&parent, name, initial_size)) {}\n\n ~LinearPool() {\n gcc_unused auto ref = pool_unref(&p);\n#ifndef NDEBUG\n assert(ref == 0);\n#endif\n }\n\n struct pool &get() {\n return p;\n }\n\n operator struct pool &() {\n return p;\n }\n\n operator struct pool *() {\n return &p;\n }\n};\n\n\/**\n * Returns the total size of all allocations in this pool.\n *\/\ngcc_pure\nsize_t\npool_netto_size(const struct pool *pool);\n\n\/**\n * Returns the total amount of memory allocated by this pool.\n *\/\ngcc_pure\nsize_t\npool_brutto_size(const struct pool *pool);\n\n\/**\n * Returns the total size of this pool and all of its descendants\n * (recursively).\n *\/\ngcc_pure\nsize_t\npool_recursive_netto_size(const struct pool *pool);\n\ngcc_pure\nsize_t\npool_recursive_brutto_size(const struct pool *pool);\n\n\/**\n * Returns the total size of all descendants of this pool (recursively).\n *\/\ngcc_pure\nsize_t\npool_children_netto_size(const struct pool *pool);\n\ngcc_pure\nsize_t\npool_children_brutto_size(const struct pool *pool);\n\nvoid\npool_dump_tree(const struct pool *pool);\n\n#ifndef NDEBUG\n#include <inline\/list.h>\n\nstruct pool_notify_state {\n struct list_head siblings;\n\n struct pool *pool;\n\n const char *name;\n\n bool destroyed, registered;\n\n#ifdef TRACE\n const char *file;\n int line;\n\n const char *destroyed_file;\n int destroyed_line;\n#endif\n};\n\nvoid\npool_notify(struct pool *pool, struct pool_notify_state *notify);\n\nbool\npool_denotify(struct pool_notify_state *notify);\n\n\/**\n * Hands over control from an existing #pool_notify to a new one. The\n * old one is unregistered.\n *\/\nvoid\npool_notify_move(struct pool *pool, struct pool_notify_state *src,\n struct pool_notify_state *dest);\n\nclass PoolNotify {\n struct pool_notify_state state;\n\npublic:\n explicit PoolNotify(struct pool &pool) {\n pool_notify(&pool, &state);\n }\n\n PoolNotify(const PoolNotify &) = delete;\n\n#ifndef NDEBUG\n ~PoolNotify() {\n assert(!state.registered);\n }\n#endif\n\n bool Denotify() {\n return pool_denotify(&state);\n }\n};\n\n#endif\n\nclass ScopePoolRef {\n struct pool &pool;\n#ifndef NDEBUG\n PoolNotify notify;\n#endif\n\n#ifdef TRACE\n const char *const file;\n unsigned line;\n#endif\n\npublic:\n explicit ScopePoolRef(struct pool &_pool TRACE_ARGS_DECL_)\n :pool(_pool)\n#ifndef NDEBUG\n , notify(_pool)\n#endif\n TRACE_ARGS_INIT\n {\n pool_ref_fwd(&_pool);\n }\n\n ScopePoolRef(const ScopePoolRef &) = delete;\n\n ~ScopePoolRef() {\n#ifndef NDEBUG\n notify.Denotify();\n#endif\n pool_unref_fwd(&pool);\n }\n\n operator struct pool &() {\n return pool;\n }\n\n operator struct pool *() {\n return &pool;\n }\n};\n\n#ifndef NDEBUG\n\nvoid\npool_ref_notify_impl(struct pool *pool, struct pool_notify_state *notify TRACE_ARGS_DECL);\n\nvoid\npool_unref_denotify_impl(struct pool *pool, struct pool_notify_state *notify\n TRACE_ARGS_DECL);\n\n\/**\n * Do a \"checked\" pool reference.\n *\/\n#define pool_ref_notify(pool, notify) \\\n pool_ref_notify_impl(pool, notify TRACE_ARGS)\n\n\/**\n * Do a \"checked\" pool unreference. If the pool has been destroyed,\n * an assertion will fail. Double frees are also caught.\n *\/\n#define pool_unref_denotify(pool, notify) \\\n pool_unref_denotify_impl(pool, notify TRACE_ARGS)\n\n#else\n#define pool_ref_notify(pool, notify) pool_ref(pool)\n#define pool_unref_denotify(pool, notify) pool_unref(pool)\n#endif\n\n#ifdef NDEBUG\n\nstatic inline void\npool_trash(gcc_unused struct pool *pool)\n{\n}\n\nstatic inline void\npool_commit()\n{\n}\n\nstatic inline void\npool_attach(gcc_unused struct pool *pool, gcc_unused const void *p,\n gcc_unused const char *name)\n{\n}\n\nstatic inline void\npool_attach_checked(gcc_unused struct pool *pool, gcc_unused const void *p,\n gcc_unused const char *name)\n{\n}\n\nstatic inline void\npool_detach(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n}\n\nstatic inline void\npool_detach_checked(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n}\n\nstatic inline const char *\npool_attachment_name(gcc_unused struct pool *pool, gcc_unused const void *p)\n{\n return NULL;\n}\n\n#else\n\nvoid\npool_trash(struct pool *pool);\n\nvoid\npool_commit();\n\nbool\npool_contains(struct pool *pool, const void *ptr, size_t size);\n\n\/**\n * Attach an opaque object to the pool. It must be detached before\n * the pool is destroyed. This is used in debugging mode to track\n * whether all external objects have been destroyed.\n *\/\nvoid\npool_attach(struct pool *pool, const void *p, const char *name);\n\n\/**\n * Same as pool_attach(), but checks if the object is already\n * registered.\n *\/\nvoid\npool_attach_checked(struct pool *pool, const void *p, const char *name);\n\nvoid\npool_detach(struct pool *pool, const void *p);\n\nvoid\npool_detach_checked(struct pool *pool, const void *p);\n\nconst char *\npool_attachment_name(struct pool *pool, const void *p);\n\n#endif\n\nvoid\npool_mark(struct pool *pool, struct pool_mark_state *mark);\n\nvoid\npool_rewind(struct pool *pool, const struct pool_mark_state *mark);\n\nclass AutoRewindPool {\n struct pool &pool;\n pool_mark_state mark;\n\npublic:\n AutoRewindPool(struct pool &_pool):pool(_pool) {\n pool_mark(&pool, &mark);\n }\n\n AutoRewindPool(const AutoRewindPool &) = delete;\n\n ~AutoRewindPool() {\n pool_rewind(&pool, &mark);\n }\n};\n\ngcc_malloc\nvoid *\np_malloc_impl(struct pool *pool, size_t size TRACE_ARGS_DECL);\n\n#define p_malloc(pool, size) p_malloc_impl(pool, size TRACE_ARGS)\n#define p_malloc_fwd(pool, size) p_malloc_impl(pool, size TRACE_ARGS_FWD)\n\nvoid\np_free(struct pool *pool, const void *ptr);\n\ngcc_malloc\nvoid *\np_calloc_impl(struct pool *pool, size_t size TRACE_ARGS_DECL);\n\n#define p_calloc(pool, size) p_calloc_impl(pool, size TRACE_ARGS)\n\ngcc_malloc\nvoid *\np_memdup_impl(struct pool *pool, const void *src, size_t length TRACE_ARGS_DECL);\n\n#define p_memdup(pool, src, length) p_memdup_impl(pool, src, length TRACE_ARGS)\n#define p_memdup_fwd(pool, src, length) p_memdup_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strdup_impl(struct pool *pool, const char *src TRACE_ARGS_DECL);\n\n#define p_strdup(pool, src) p_strdup_impl(pool, src TRACE_ARGS)\n#define p_strdup_fwd(pool, src) p_strdup_impl(pool, src TRACE_ARGS_FWD)\n\nstatic inline const char *\np_strdup_checked(struct pool *pool, const char *s)\n{\n return s == NULL ? NULL : p_strdup(pool, s);\n}\n\ngcc_malloc\nchar *\np_strdup_lower_impl(struct pool *pool, const char *src TRACE_ARGS_DECL);\n\n#define p_strdup_lower(pool, src) p_strdup_lower_impl(pool, src TRACE_ARGS)\n#define p_strdup_lower_fwd(pool, src) p_strdup_lower_impl(pool, src TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strndup_impl(struct pool *pool, const char *src, size_t length TRACE_ARGS_DECL);\n\n#define p_strndup(pool, src, length) p_strndup_impl(pool, src, length TRACE_ARGS)\n#define p_strndup_fwd(pool, src, length) p_strndup_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc\nchar *\np_strndup_lower_impl(struct pool *pool, const char *src, size_t length TRACE_ARGS_DECL);\n\n#define p_strndup_lower(pool, src, length) p_strndup_lower_impl(pool, src, length TRACE_ARGS)\n#define p_strndup_lower_fwd(pool, src, length) p_strndup_lower_impl(pool, src, length TRACE_ARGS_FWD)\n\ngcc_malloc gcc_printf(2, 3)\nchar *\np_sprintf(struct pool *pool, const char *fmt, ...);\n\ngcc_malloc\nchar *\np_strcat(struct pool *pool, const char *s, ...);\n\ngcc_malloc\nchar *\np_strncat(struct pool *pool, const char *s, size_t length, ...);\n\ntemplate<typename T>\nT *\nPoolAlloc(pool &p)\n{\n return (T *)p_malloc(&p, sizeof(T));\n}\n\ntemplate<typename T>\nT *\nPoolAlloc(pool &p, size_t n)\n{\n return (T *)p_malloc(&p, sizeof(T) * n);\n}\n\ntemplate<>\ninline void *\nPoolAlloc<void>(pool &p, size_t n)\n{\n return p_malloc(&p, n);\n}\n\ntemplate<typename T, typename... Args>\nT *\nNewFromPool(pool &p, Args&&... args)\n{\n void *t = PoolAlloc<T>(p);\n return ::new(t) T(std::forward<Args>(args)...);\n}\n\ntemplate<typename T>\nvoid\nDeleteFromPool(struct pool &pool, T *t)\n{\n t->~T();\n p_free(&pool, t);\n}\n\n\/**\n * A disposer for boost::intrusive that invokes the DeleteFromPool()\n * on the given pointer.\n *\/\nclass PoolDisposer {\n struct pool &p;\n\npublic:\n explicit PoolDisposer(struct pool &_p):p(_p) {}\n\n template<typename T>\n void operator()(T *t) {\n DeleteFromPool(p, t);\n }\n};\n\ntemplate<typename T>\nvoid\nDeleteUnrefPool(struct pool &pool, T *t)\n{\n DeleteFromPool(pool, t);\n pool_unref(&pool);\n}\n\ntemplate<typename T>\nvoid\nDeleteUnrefTrashPool(struct pool &pool, T *t)\n{\n pool_trash(&pool);\n DeleteUnrefPool(pool, t);\n}\n\nclass PoolAllocator {\n struct pool &pool;\n\npublic:\n explicit constexpr PoolAllocator(struct pool &_pool):pool(_pool) {}\n\n void *Allocate(size_t size) {\n return p_malloc(&pool, size);\n }\n\n char *DupString(const char *p) {\n return p_strdup(&pool, p);\n }\n\n void Free(void *p) {\n p_free(&pool, p);\n }\n\n template<typename T, typename... Args>\n T *New(Args&&... args) {\n return NewFromPool<T>(pool, std::forward<Args>(args)...);\n }\n\n template<typename T>\n void Delete(T *t) {\n DeleteFromPool(pool, t);\n }\n};\n\ngcc_malloc\nchar *\np_strdup_impl(struct pool &pool, StringView src TRACE_ARGS_DECL);\n\ngcc_malloc\nchar *\np_strdup_lower_impl(struct pool &pool, StringView src TRACE_ARGS_DECL);\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\r\n\/\/ This code is based on the HTTP Server 3 boost example from:\r\n\/\/ http:\/\/www.boost.org\/doc\/libs\/1_53_0\/doc\/html\/boost_asio\/examples.html\r\n\/\/\r\n\/\/ Description:\r\n\/\/ HTTP Server 3\r\n\/\/ An HTTP server using a single io_service and a thread pool calling io_service::run().\r\n\/\/\r\n\/\/ Ideally we could use the example as-is, but it uses a file-based scheme that is not at all RESTful.\r\n\/\/ To update this code when a new example becomes available,\r\n\/\/ do a diff between the old and new example code and paste in the changes.\r\n\/\/\r\n\/\/\r\n\/\/ Original copyright notice:\r\n\/\/\r\n\/\/ request_handler.hpp\r\n\/\/ ~~~~~~~~~~~~~~~~~~~\r\n\/\/\r\n\/\/ Copyright (c) 2003-2012 Christopher M. Kohlhoff (chris at kohlhoff dot com)\r\n\/\/\r\n\/\/ Distributed under the Boost Software License, Version 1.0. (See accompanying\r\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\r\n\/\/\r\n\r\n#ifndef QUICK_HTTP_SERVER_HANDLER_HPP\r\n#define QUICK_HTTP_SERVER_HANDLER_HPP\r\n\r\n#include \"http_helpers.hpp\"\r\n#include \"quick_http_components\/mime_types.hpp\"\r\n#include \"quick_http_components\/reply.hpp\"\r\n#include \"quick_http_components\/request.hpp\"\r\n\r\n\r\nusing namespace QuickHttp;\r\n\r\n\/\/ This functor creates the server reply for the given request.\r\n\/\/ You must override it to provide custom server replies.\r\nclass base_server_handler\r\n : private boost::noncopyable\r\n{\r\npublic:\r\n\r\n\texplicit base_server_handler(\r\n\t const vector<string>& includes,\r\n const vector<API_call*>& vpAPI,\r\n int max_body_size = 100000\r\n\t) :\r\n \/\/ init vars\r\n\t vpAPI_(vpAPI),\r\n max_body_size_(max_body_size)\r\n\t{\r\n\t load_favicon();\r\n set_html_includes(includes);\r\n\t for (auto& pAPI : vpAPI_)\r\n\t {\r\n\t if (pAPI->load_static_html())\r\n\t inject_includes(*pAPI);\r\n\t }\r\n\t}\r\n\r\n\tvirtual ~base_server_handler()\r\n\t{\r\n\t for (auto& pcall : vpAPI_)\r\n\t {\r\n\t delete pcall;\r\n\t }\r\n\t}\r\n\r\n\tvirtual void operator() (const request& req, reply& rep)\r\n\t{\r\n\t \/\/ Let's see what type of request we got.\r\n\t \/\/ Slice up the URL and switch on the pieces.\r\n\t \/\/ Our tokenizer will validate that the url was in the correct format.\r\n\r\n\t std::string protocol, host, action, type;\r\n\t std::vector<std::string> path_tokens;\r\n\t vector<pair<string,string>> pair_tokens;\r\n\r\n\t \/\/ Mark the request bad until we validate.\r\n\t rep.status = reply::bad_request;\r\n\r\n\t \/\/ Tokenize, and ignore malformed requests.\r\n\t \/\/ That means we will have at least one path token and one action (or just the hostname).\r\n\t API_call ac;\r\n\t ac.method_ = req.method;\r\n\t if (tokenize_API_url(req.uri,protocol,host,ac))\r\n\t {\r\n\t if (process_API_call(ac,rep))\r\n\t {\r\n\t rep.status = reply::ok;\r\n\t if (!ac.types_.empty())\r\n\t type = ac.types_[0];\r\n\t }\r\n\t }\r\n\r\n\t if (rep.status == reply::bad_request)\r\n\t {\r\n\t \/\/ There is one hardcoded request that we handle by hand, the annoying favicon.ico.\r\n\t if (req.uri.substr(req.uri.size()-11,11) == \"favicon.ico\")\r\n\t {\r\n\t rep.content = favicon_;\r\n\t type = \"ico\";\r\n rep.status = reply::ok;\r\n\r\n\t } else\r\n\t {\r\n\t \/\/ We respond to all bad requests with the API html.\r\n\t \/\/ Note that this is no place to prevent DDOS - DDOS'ing to legit API calls is trivial.\r\n\t \/\/ Help the user out.\r\n log(LV_ERROR,string(\"Received unrecognized request: \") + req.method + \" \" + req.uri);\r\n rep.content = \"<p>A better Trader API<\/p>\";\r\n rep.content += get_API_html(\"<button>\",\"<\/button>\",\"<button>\",\"<\/button>\",\"<button>\",\"<\/button>\",\"<br \/>\");\r\n\t }\r\n\t }\r\n\r\n\t \/\/ Build the headers.\r\n\t rep.headers.resize(2);\r\n\t rep.headers[0].name = \"Content-Length\";\r\n\t rep.headers[0].value = boost::lexical_cast<std::string>(rep.content.size());\r\n\t rep.headers[1].name = \"Content-Type\";\r\n\t rep.headers[1].value = mime_types::extension_to_type(type);\r\n\r\n\t if (rep.status == reply::bad_request)\r\n\t {\r\n\t }\r\n\t}\r\n\r\n\tinline void load_favicon()\r\n\t{\r\n\t try\r\n\t {\r\n\t favicon_ = read_file(\"htdocs\/favicon.ico\");\r\n\t }\r\n\t catch(...)\r\n\t {\r\n log(LV_WARNING,\"WARNING: No favicon.ico file was found in [htdocs\/].\");\r\n\r\n \/\/ TODO add an encoded default\r\n\t }\r\n\t}\r\n\r\n\t\/\/ We provide a means to inject include files into html.\r\n \/\/ This should be done for all our preloaded html on startup.\r\n inline void set_html_includes(const vector<string>& includes)\r\n {\r\n \/\/ We receive a series of filenames.\r\n \/\/ We take the filename and preload it from the local file system.\r\n \/\/ We also save the search string that should be replaced by the preloaded data in load_static_html().\r\n \/\/ KISS: We support css and js, that's it for now.\r\n\r\n try\r\n {\r\n for (auto& filename : includes)\r\n {\r\n if (filename.substr(filename.size()-4,4) == \".css\")\r\n {\r\n includes_.push_back(\r\n pair<string,string>(\r\n string(\"<script src=\\\"\") + filename + \"\\\"><\/script>\",\r\n read_file(string(\"htdocs\/\") + filename)\r\n )\r\n );\r\n\r\n } else if (filename.substr(filename.size()-3,3) == \".js\")\r\n {\r\n includes_.push_back(\r\n pair<string,string>(\r\n string(\"<link href=\\\"\") + filename + \"\\\" rel=\\\"stylesheet\\\">\",\r\n read_file(string(\"htdocs\/\") + filename)\r\n )\r\n );\r\n\r\n } else\r\n {\r\n \/\/ A file was requested to be inline-included but the type is not understood yet.\r\n \/\/ Add another handler as needed!\r\n assert(false);\r\n }\r\n }\r\n }\r\n catch(...)\r\n {\r\n log(LV_ERROR,\"ERROR: Some HTML includes were not found.\");\r\n }\r\n }\r\n\r\n void inject_includes(API_call& ac)\r\n {\r\n \/\/ We may need to build the relative path back to the root, based on the depth of the ac path.\r\n string relative_path;\r\n int steps = ac.path_tokens_.size() - 1;\r\n for (int n=0; n < steps; ++n)\r\n relative_path += \"..\/\";\r\n\r\n for (auto& include : includes_)\r\n {\r\n \/\/ Update any path to include the proper relative path.\r\n string target = include.first;\r\n replace(target,\"href=\\\"\",string(\"href\\\"\") + relative_path);\r\n replace(target,\"src=\\\"\",string(\"src\\\"\") + relative_path);\r\n\r\n \/\/ NOTE that this uses \"replace\" from utilities.hpp.\r\n replace(ac.static_html_, target, include.second);\r\n }\r\n }\r\n\r\n bool b_API_call_matches(const API_call& acDefinition, const API_call& ac, bool bIncludeParamPairs = false)\r\n {\r\n if (!strings_are_equal(acDefinition.method_,ac.method_)) return false;\r\n if (acDefinition.path_tokens_.size() != ac.path_tokens_.size()) return false;\r\n\r\n for (int n = 0; n < ac.path_tokens_.size(); ++n)\r\n {\r\n if (acDefinition.path_tokens_[n][0] != ':')\r\n {\r\n if (!strings_are_equal(acDefinition.path_tokens_[n],ac.path_tokens_[n]))\r\n return false;\r\n }\r\n }\r\n\r\n if (acDefinition.b_param_pairs_are_mandatory_)\r\n {\r\n if (acDefinition.pair_tokens_.size() != ac.pair_tokens_.size())\r\n return false;\r\n\r\n for (int n = 0; n < ac.pair_tokens_.size(); ++n)\r\n {\r\n if (!strings_are_equal(acDefinition.pair_tokens_[n].first,ac.pair_tokens_[n].first))\r\n return false;\r\n }\r\n }\r\n\r\n return true;\r\n }\r\n\r\n\r\n bool process_API_call(API_call& ac, QuickHttp::reply& rep)\r\n {\r\n for (auto& acloop : vpAPI_)\r\n {\r\n if (b_API_call_matches(*acloop,ac))\r\n return acloop->handle_call(rep);\r\n }\r\n return false;\r\n }\r\n\r\n\r\n string get_API_html(const string& method1, const string& method2, const string& path1, const string& path2, const string& param1, const string& param2, const string& endline)\r\n {\r\n string html;\r\n for (auto& ac : vpAPI_)\r\n {\r\n html += method1 + ac->method_ + method2 + \" \/\";\r\n for (int n = 0; n < ac->path_tokens_.size(); ++n)\r\n {\r\n const string& path = ac->path_tokens_[n];\r\n if (!path.empty() && path[0] == ':')\r\n html += path1 + path + path2;\r\n else\r\n html += path;\r\n if (n < ac->path_tokens_.size() - 1)\r\n html += \"\/\";\r\n }\r\n \/\/ html += ac->action_ + \".\" + ac->type_;\r\n for (int n = 0; n < ac->pair_tokens_.size(); ++n)\r\n {\r\n const pair<string,string>& tokenpair = ac->pair_tokens_[n];\r\n if (n==0) html += \" ? \";\r\n else html += \" & \";\r\n html += tokenpair.first + \"=\";\r\n html += param1 + tokenpair.second + param2;\r\n }\r\n html += endline;\r\n }\r\n\r\n return html;\r\n }\r\n\r\n\r\n bool tokenize_API_url(const std::string& url, std::string& protocol, std::string& host, API_call& ac)\r\n {\r\n \/\/ This is not the ultimate URL parser (there are libraries for that when you need it - google-url, StrTk, etc.).\r\n \/\/ It only handles the formats we expect for our RESTful API.\r\n \/\/\r\n \/\/ These include the following type of urls:\r\n \/\/\r\n \/\/ http(s):\/\/server.com\/version\/action.type?param1=value1¶m2=value2\r\n \/\/ server.com\/version\/action.type?param1=value1¶m2=value2\r\n \/\/ \/version\/action.type?param1=value1¶m2=value2\r\n \/\/\r\n \/\/ If we do not find such a format, it does not fit our RESTful API model and we return false.\r\n \/\/ Specifically, we REQUIRE version and action.\r\n\r\n \/\/ We must at least have \/version\/action. No buffer overflow attempts please.\r\n if (url.length() < 4 || url.length() > 700)\r\n return false;\r\n\r\n protocol.clear();\r\n host.clear();\r\n ac.path_tokens_.clear();\r\n ac.pair_tokens_.clear();\r\n\r\n \/\/ ===================================\r\n \/\/ protocol\r\n size_t walk1 = url.find(\":\/\/\",0);\r\n size_t walk2;\r\n if (walk1 == std::string::npos)\r\n {\r\n walk1 = 0;\r\n\r\n } else\r\n {\r\n protocol = url.substr(0,walk1);\r\n walk1 = walk1 + 3;\r\n }\r\n\r\n \/\/ If all we got was the protocol, that's not enough.\r\n if (url.length() <= walk1)\r\n return false;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ host\r\n if (url[walk1] != '\/')\r\n {\r\n walk2 = url.find_first_of('\/',walk1);\r\n host = url.substr(walk1,walk2-walk1);\r\n\r\n \/\/ If all we got was the host, that's not enough.\r\n \/\/ Actually, we will allow it now, so we can provide a self-documenting API.\r\n \/\/ But we still need to return here.\r\n if (walk2 == std::string::npos || walk2 == url.length())\r\n return true;\r\n\r\n walk1 = walk2;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ paths\r\n\r\n \/\/ We should always be at the first '\/' here, skip over it.\r\n ++walk1;\r\n\r\n while (walk1 < url.length())\r\n {\r\n walk2 = url.find_first_of('\/',walk1);\r\n if (walk2 == std::string::npos)\r\n break;\r\n\r\n ac.path_tokens_.push_back(url.substr(walk1,walk2-walk1));\r\n walk1 = walk2 + 1;\r\n }\r\n\r\n \/\/ If we have anything beyond the hostname,\r\n \/\/ we need at least one path token for the API version,\r\n \/\/ and we also need an action.\r\n if (ac.path_tokens_.size() < 1 || url.length() < walk1 + 1)\r\n return false;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ action\r\n \/\/ ===================================\r\n\r\n \/\/ We need to look for both \".\" and \"?\".\r\n walk2 = url.find_first_of(\".?\",walk1);\r\n ac.path_tokens_.push_back(url.substr(walk1,walk2-walk1));\r\n\r\n \/\/ It's ok if we stopped at action.\r\n if (walk2 == std::string::npos)\r\n return true;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ type\r\n\r\n \/\/ We may be at a \".\" or a \"?\". We only have a type if we're at \".\".\r\n walk1 = walk2;\r\n if (url[walk1] == '.')\r\n {\r\n walk2 = url.find_first_of('?',walk1);\r\n ac.types_.push_back(url.substr(walk1+1,walk2-walk1-1));\r\n\r\n \/\/ If we DID have a \".\", we should have a type.\r\n if (ac.types_[0].empty())\r\n return false;\r\n\r\n \/\/ It's ok to finish with no name-value pairs.\r\n if (walk2 == std::string::npos)\r\n return true;\r\n\r\n walk1 = walk2;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ pairs\r\n \/\/ break apart \"param1=value1¶m2=value2\" name-value pairs\r\n\r\n \/\/ We should always be at the \"?\" here, skip over it.\r\n ++walk1;\r\n\r\n while (walk1 < url.length())\r\n {\r\n walk2 = url.find_first_of('=',walk1);\r\n\r\n \/\/ No good if we didn't have a full pair.\r\n if (walk2 == std::string::npos)\r\n return false;\r\n\r\n size_t walk3 = url.find_first_of('&',walk2);\r\n ac.pair_tokens_.push_back(\r\n std::pair<string,string>(\r\n url.substr(walk1,walk2-walk1),\r\n url.substr(walk2+1,walk3-walk2-1)\r\n )\r\n );\r\n\r\n \/\/ All done if we ran past the end.\r\n if (walk3 == std::string::npos)\r\n return true;\r\n\r\n walk1 = walk3 + 1;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ We actually shouldn't hit this.\r\n return false;\r\n }\r\n\r\n std::size_t max_body_size_;\r\n\r\nprotected:\r\n\r\n const vector<API_call*>& vpAPI_;\r\n vector<pair<string,string>> includes_;\r\n string favicon_;\r\n};\r\n\r\n\r\n#endif \/\/ QUICK_HTTP_SERVER_HANDLER_HPP\r\n<commit_msg>Javascript and CSS injection coded and working.<commit_after>\/\/\r\n\/\/ This code is based on the HTTP Server 3 boost example from:\r\n\/\/ http:\/\/www.boost.org\/doc\/libs\/1_53_0\/doc\/html\/boost_asio\/examples.html\r\n\/\/\r\n\/\/ Description:\r\n\/\/ HTTP Server 3\r\n\/\/ An HTTP server using a single io_service and a thread pool calling io_service::run().\r\n\/\/\r\n\/\/ Ideally we could use the example as-is, but it uses a file-based scheme that is not at all RESTful.\r\n\/\/ To update this code when a new example becomes available,\r\n\/\/ do a diff between the old and new example code and paste in the changes.\r\n\/\/\r\n\/\/\r\n\/\/ Original copyright notice:\r\n\/\/\r\n\/\/ request_handler.hpp\r\n\/\/ ~~~~~~~~~~~~~~~~~~~\r\n\/\/\r\n\/\/ Copyright (c) 2003-2012 Christopher M. Kohlhoff (chris at kohlhoff dot com)\r\n\/\/\r\n\/\/ Distributed under the Boost Software License, Version 1.0. (See accompanying\r\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\r\n\/\/\r\n\r\n#ifndef QUICK_HTTP_SERVER_HANDLER_HPP\r\n#define QUICK_HTTP_SERVER_HANDLER_HPP\r\n\r\n#include \"http_helpers.hpp\"\r\n#include \"quick_http_components\/mime_types.hpp\"\r\n#include \"quick_http_components\/reply.hpp\"\r\n#include \"quick_http_components\/request.hpp\"\r\n\r\n\r\nusing namespace QuickHttp;\r\n\r\n\/\/ This functor creates the server reply for the given request.\r\n\/\/ You must override it to provide custom server replies.\r\nclass base_server_handler\r\n : private boost::noncopyable\r\n{\r\npublic:\r\n\r\n\texplicit base_server_handler(\r\n\t const vector<string>& includes,\r\n const vector<API_call*>& vpAPI,\r\n int max_body_size = 100000\r\n\t) :\r\n \/\/ init vars\r\n\t vpAPI_(vpAPI),\r\n max_body_size_(max_body_size)\r\n\t{\r\n\t load_favicon();\r\n set_html_includes(includes);\r\n\t for (auto& pAPI : vpAPI_)\r\n\t {\r\n\t if (pAPI->load_static_html())\r\n\t inject_includes(*pAPI);\r\n\t }\r\n\t}\r\n\r\n\tvirtual ~base_server_handler()\r\n\t{\r\n\t for (auto& pcall : vpAPI_)\r\n\t {\r\n\t delete pcall;\r\n\t }\r\n\t}\r\n\r\n\tvirtual void operator() (const request& req, reply& rep)\r\n\t{\r\n\t \/\/ Let's see what type of request we got.\r\n\t \/\/ Slice up the URL and switch on the pieces.\r\n\t \/\/ Our tokenizer will validate that the url was in the correct format.\r\n\r\n\t std::string protocol, host, action, type;\r\n\t std::vector<std::string> path_tokens;\r\n\t vector<pair<string,string>> pair_tokens;\r\n\r\n\t \/\/ Mark the request bad until we validate.\r\n\t rep.status = reply::bad_request;\r\n\r\n\t \/\/ Tokenize, and ignore malformed requests.\r\n\t \/\/ That means we will have at least one path token and one action (or just the hostname).\r\n\t API_call ac;\r\n\t ac.method_ = req.method;\r\n\t if (tokenize_API_url(req.uri,protocol,host,ac))\r\n\t {\r\n\t if (process_API_call(ac,rep))\r\n\t {\r\n\t rep.status = reply::ok;\r\n\t if (!ac.types_.empty())\r\n\t type = ac.types_[0];\r\n\t }\r\n\t }\r\n\r\n\t if (rep.status == reply::bad_request)\r\n\t {\r\n\t \/\/ There is one hardcoded request that we handle by hand, the annoying favicon.ico.\r\n\t if (req.uri.substr(req.uri.size()-11,11) == \"favicon.ico\")\r\n\t {\r\n\t rep.content = favicon_;\r\n\t type = \"ico\";\r\n rep.status = reply::ok;\r\n\r\n\t } else\r\n\t {\r\n\t \/\/ We respond to all bad requests with the API html.\r\n\t \/\/ Note that this is no place to prevent DDOS - DDOS'ing to legit API calls is trivial.\r\n\t \/\/ Help the user out.\r\n log(LV_ERROR,string(\"Received unrecognized request: \") + req.method + \" \" + req.uri);\r\n rep.content = \"<p>A better Trader API<\/p>\";\r\n rep.content += get_API_html(\"<button>\",\"<\/button>\",\"<button>\",\"<\/button>\",\"<button>\",\"<\/button>\",\"<br \/>\");\r\n\t }\r\n\t }\r\n\r\n\t \/\/ Build the headers.\r\n\t rep.headers.resize(2);\r\n\t rep.headers[0].name = \"Content-Length\";\r\n\t rep.headers[0].value = boost::lexical_cast<std::string>(rep.content.size());\r\n\t rep.headers[1].name = \"Content-Type\";\r\n\t rep.headers[1].value = mime_types::extension_to_type(type);\r\n\r\n\t if (rep.status == reply::bad_request)\r\n\t {\r\n\t }\r\n\t}\r\n\r\n\tinline void load_favicon()\r\n\t{\r\n\t try\r\n\t {\r\n\t favicon_ = read_file(\"htdocs\/favicon.ico\");\r\n\t }\r\n\t catch(...)\r\n\t {\r\n log(LV_WARNING,\"WARNING: No favicon.ico file was found in [htdocs\/].\");\r\n\r\n \/\/ TODO add an encoded default\r\n\t }\r\n\t}\r\n\r\n\t\/\/ We provide a means to inject include files into html.\r\n \/\/ This should be done for all our preloaded html on startup.\r\n inline void set_html_includes(const vector<string>& includes)\r\n {\r\n \/\/ We receive a series of filenames.\r\n \/\/ We take the filename and preload it from the local file system.\r\n \/\/ We also save the search string that should be replaced by the preloaded data in load_static_html().\r\n \/\/ KISS: We support css and js, that's it for now.\r\n\r\n try\r\n {\r\n for (auto& filename : includes)\r\n {\r\n if (filename.substr(filename.size()-4,4) == \".css\")\r\n {\r\n includes_.push_back(\r\n pair<string,string>(\r\n string(\"<link href=\\\"\") + filename + \"\\\" rel=\\\"stylesheet\\\">\",\r\n string(\"<style type=\\\"text\/css\\\">\") + read_file(string(\"htdocs\/\") + filename) + \"<\/style>\"\r\n )\r\n );\r\n\r\n } else if (filename.substr(filename.size()-3,3) == \".js\")\r\n {\r\n includes_.push_back(\r\n pair<string,string>(\r\n string(\"<script src=\\\"\") + filename + \"\\\"><\/script>\",\r\n string(\"<script type=\\\"text\/javascript\\\">\") + read_file(string(\"htdocs\/\") + filename) + \"<\/script>\"\r\n )\r\n );\r\n\r\n } else\r\n {\r\n \/\/ A file was requested to be inline-included but the type is not understood yet.\r\n \/\/ Add another handler as needed!\r\n assert(false);\r\n }\r\n }\r\n }\r\n catch(...)\r\n {\r\n log(LV_ERROR,\"ERROR: Some HTML includes were not found.\");\r\n }\r\n }\r\n\r\n void inject_includes(API_call& ac)\r\n {\r\n \/\/ We may need to build the relative path back to the root, based on the depth of the ac path.\r\n string relative_path;\r\n int steps = ac.path_tokens_.size() - 1;\r\n for (int n=0; n < steps; ++n)\r\n relative_path += \"..\/\";\r\n\r\n for (auto& include : includes_)\r\n {\r\n \/\/ Update any path to include the proper relative path.\r\n string target = include.first;\r\n replace(target,\"href=\\\"\",string(\"href=\\\"\") + relative_path);\r\n replace(target,\"src=\\\"\",string(\"src=\\\"\") + relative_path);\r\n\r\n \/\/ NOTE that this uses \"replace\" from utilities.hpp.\r\n replace(ac.static_html_, target, include.second);\r\n }\r\n }\r\n\r\n bool b_API_call_matches(const API_call& acDefinition, const API_call& ac, bool bIncludeParamPairs = false)\r\n {\r\n if (!strings_are_equal(acDefinition.method_,ac.method_)) return false;\r\n if (acDefinition.path_tokens_.size() != ac.path_tokens_.size()) return false;\r\n\r\n for (int n = 0; n < ac.path_tokens_.size(); ++n)\r\n {\r\n if (acDefinition.path_tokens_[n][0] != ':')\r\n {\r\n if (!strings_are_equal(acDefinition.path_tokens_[n],ac.path_tokens_[n]))\r\n return false;\r\n }\r\n }\r\n\r\n if (acDefinition.b_param_pairs_are_mandatory_)\r\n {\r\n if (acDefinition.pair_tokens_.size() != ac.pair_tokens_.size())\r\n return false;\r\n\r\n for (int n = 0; n < ac.pair_tokens_.size(); ++n)\r\n {\r\n if (!strings_are_equal(acDefinition.pair_tokens_[n].first,ac.pair_tokens_[n].first))\r\n return false;\r\n }\r\n }\r\n\r\n return true;\r\n }\r\n\r\n\r\n bool process_API_call(API_call& ac, QuickHttp::reply& rep)\r\n {\r\n for (auto& acloop : vpAPI_)\r\n {\r\n if (b_API_call_matches(*acloop,ac))\r\n return acloop->handle_call(rep);\r\n }\r\n return false;\r\n }\r\n\r\n\r\n string get_API_html(const string& method1, const string& method2, const string& path1, const string& path2, const string& param1, const string& param2, const string& endline)\r\n {\r\n string html;\r\n for (auto& ac : vpAPI_)\r\n {\r\n html += method1 + ac->method_ + method2 + \" \/\";\r\n for (int n = 0; n < ac->path_tokens_.size(); ++n)\r\n {\r\n const string& path = ac->path_tokens_[n];\r\n if (!path.empty() && path[0] == ':')\r\n html += path1 + path + path2;\r\n else\r\n html += path;\r\n if (n < ac->path_tokens_.size() - 1)\r\n html += \"\/\";\r\n }\r\n \/\/ html += ac->action_ + \".\" + ac->type_;\r\n for (int n = 0; n < ac->pair_tokens_.size(); ++n)\r\n {\r\n const pair<string,string>& tokenpair = ac->pair_tokens_[n];\r\n if (n==0) html += \" ? \";\r\n else html += \" & \";\r\n html += tokenpair.first + \"=\";\r\n html += param1 + tokenpair.second + param2;\r\n }\r\n html += endline;\r\n }\r\n\r\n return html;\r\n }\r\n\r\n\r\n bool tokenize_API_url(const std::string& url, std::string& protocol, std::string& host, API_call& ac)\r\n {\r\n \/\/ This is not the ultimate URL parser (there are libraries for that when you need it - google-url, StrTk, etc.).\r\n \/\/ It only handles the formats we expect for our RESTful API.\r\n \/\/\r\n \/\/ These include the following type of urls:\r\n \/\/\r\n \/\/ http(s):\/\/server.com\/version\/action.type?param1=value1¶m2=value2\r\n \/\/ server.com\/version\/action.type?param1=value1¶m2=value2\r\n \/\/ \/version\/action.type?param1=value1¶m2=value2\r\n \/\/\r\n \/\/ If we do not find such a format, it does not fit our RESTful API model and we return false.\r\n \/\/ Specifically, we REQUIRE version and action.\r\n\r\n \/\/ We must at least have \/version\/action. No buffer overflow attempts please.\r\n if (url.length() < 4 || url.length() > 700)\r\n return false;\r\n\r\n protocol.clear();\r\n host.clear();\r\n ac.path_tokens_.clear();\r\n ac.pair_tokens_.clear();\r\n\r\n \/\/ ===================================\r\n \/\/ protocol\r\n size_t walk1 = url.find(\":\/\/\",0);\r\n size_t walk2;\r\n if (walk1 == std::string::npos)\r\n {\r\n walk1 = 0;\r\n\r\n } else\r\n {\r\n protocol = url.substr(0,walk1);\r\n walk1 = walk1 + 3;\r\n }\r\n\r\n \/\/ If all we got was the protocol, that's not enough.\r\n if (url.length() <= walk1)\r\n return false;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ host\r\n if (url[walk1] != '\/')\r\n {\r\n walk2 = url.find_first_of('\/',walk1);\r\n host = url.substr(walk1,walk2-walk1);\r\n\r\n \/\/ If all we got was the host, that's not enough.\r\n \/\/ Actually, we will allow it now, so we can provide a self-documenting API.\r\n \/\/ But we still need to return here.\r\n if (walk2 == std::string::npos || walk2 == url.length())\r\n return true;\r\n\r\n walk1 = walk2;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ paths\r\n\r\n \/\/ We should always be at the first '\/' here, skip over it.\r\n ++walk1;\r\n\r\n while (walk1 < url.length())\r\n {\r\n walk2 = url.find_first_of('\/',walk1);\r\n if (walk2 == std::string::npos)\r\n break;\r\n\r\n ac.path_tokens_.push_back(url.substr(walk1,walk2-walk1));\r\n walk1 = walk2 + 1;\r\n }\r\n\r\n \/\/ If we have anything beyond the hostname,\r\n \/\/ we need at least one path token for the API version,\r\n \/\/ and we also need an action.\r\n if (ac.path_tokens_.size() < 1 || url.length() < walk1 + 1)\r\n return false;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ action\r\n \/\/ ===================================\r\n\r\n \/\/ We need to look for both \".\" and \"?\".\r\n walk2 = url.find_first_of(\".?\",walk1);\r\n ac.path_tokens_.push_back(url.substr(walk1,walk2-walk1));\r\n\r\n \/\/ It's ok if we stopped at action.\r\n if (walk2 == std::string::npos)\r\n return true;\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ type\r\n\r\n \/\/ We may be at a \".\" or a \"?\". We only have a type if we're at \".\".\r\n walk1 = walk2;\r\n if (url[walk1] == '.')\r\n {\r\n walk2 = url.find_first_of('?',walk1);\r\n ac.types_.push_back(url.substr(walk1+1,walk2-walk1-1));\r\n\r\n \/\/ If we DID have a \".\", we should have a type.\r\n if (ac.types_[0].empty())\r\n return false;\r\n\r\n \/\/ It's ok to finish with no name-value pairs.\r\n if (walk2 == std::string::npos)\r\n return true;\r\n\r\n walk1 = walk2;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ ===================================\r\n \/\/ pairs\r\n \/\/ break apart \"param1=value1¶m2=value2\" name-value pairs\r\n\r\n \/\/ We should always be at the \"?\" here, skip over it.\r\n ++walk1;\r\n\r\n while (walk1 < url.length())\r\n {\r\n walk2 = url.find_first_of('=',walk1);\r\n\r\n \/\/ No good if we didn't have a full pair.\r\n if (walk2 == std::string::npos)\r\n return false;\r\n\r\n size_t walk3 = url.find_first_of('&',walk2);\r\n ac.pair_tokens_.push_back(\r\n std::pair<string,string>(\r\n url.substr(walk1,walk2-walk1),\r\n url.substr(walk2+1,walk3-walk2-1)\r\n )\r\n );\r\n\r\n \/\/ All done if we ran past the end.\r\n if (walk3 == std::string::npos)\r\n return true;\r\n\r\n walk1 = walk3 + 1;\r\n }\r\n \/\/ ===================================\r\n\r\n \/\/ We actually shouldn't hit this.\r\n return false;\r\n }\r\n\r\n std::size_t max_body_size_;\r\n\r\nprotected:\r\n\r\n const vector<API_call*>& vpAPI_;\r\n vector<pair<string,string>> includes_;\r\n string favicon_;\r\n};\r\n\r\n\r\n#endif \/\/ QUICK_HTTP_SERVER_HANDLER_HPP\r\n<|endoftext|>"} {"text":"<commit_before>\/\/===- llvm\/unittest\/Support\/MemoryBufferTest.cpp - MemoryBuffer tests ----===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements unit tests for the MemoryBuffer support class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nclass MemoryBufferTest : public testing::Test {\nprotected:\n MemoryBufferTest()\n : data(\"this is some data\")\n { }\n\n virtual void SetUp() { }\n\n typedef OwningPtr<MemoryBuffer> OwningBuffer;\n\n std::string data;\n};\n\nnamespace {\n\nTEST_F(MemoryBufferTest, get) {\n \/\/ Default name and null-terminator flag\n OwningBuffer MB1(MemoryBuffer::getMemBuffer(data));\n EXPECT_TRUE(0 != MB1.get());\n\n \/\/ RequiresNullTerminator = false\n OwningBuffer MB2(MemoryBuffer::getMemBuffer(data, \"one\", false));\n EXPECT_TRUE(0 != MB2.get());\n\n \/\/ RequiresNullTerminator = true\n OwningBuffer MB3(MemoryBuffer::getMemBuffer(data, \"two\", true));\n EXPECT_TRUE(0 != MB3.get());\n\n \/\/ verify all 3 buffers point to the same address\n EXPECT_EQ(MB1->getBufferStart(), MB2->getBufferStart());\n EXPECT_EQ(MB2->getBufferStart(), MB3->getBufferStart());\n\n \/\/ verify the original data is unmodified after deleting the buffers\n MB1.reset();\n MB2.reset();\n MB3.reset();\n EXPECT_EQ(\"this is some data\", data);\n}\n\nTEST_F(MemoryBufferTest, copy) {\n \/\/ copy with no name\n OwningBuffer MBC1(MemoryBuffer::getMemBufferCopy(data));\n EXPECT_TRUE(0 != MBC1.get());\n\n \/\/ copy with a name\n OwningBuffer MBC2(MemoryBuffer::getMemBufferCopy(data, \"copy\"));\n EXPECT_TRUE(0 != MBC2.get());\n\n \/\/ verify the two copies do not point to the same place\n EXPECT_NE(MBC1->getBufferStart(), MBC2->getBufferStart());\n}\n\nTEST_F(MemoryBufferTest, make_new) {\n \/\/ 0-sized buffer\n OwningBuffer Zero(MemoryBuffer::getNewUninitMemBuffer(0));\n EXPECT_TRUE(0 != Zero.get());\n\n \/\/ uninitialized buffer with no name\n OwningBuffer One(MemoryBuffer::getNewUninitMemBuffer(321));\n EXPECT_TRUE(0 != One.get());\n\n \/\/ uninitialized buffer with name\n OwningBuffer Two(MemoryBuffer::getNewUninitMemBuffer(123, \"bla\"));\n EXPECT_TRUE(0 != Two.get());\n\n \/\/ 0-initialized buffer with no name\n OwningBuffer Three(MemoryBuffer::getNewMemBuffer(321, data));\n EXPECT_TRUE(0 != Three.get());\n for (size_t i = 0; i < 321; ++i)\n EXPECT_EQ(0, Three->getBufferStart()[0]);\n\n \/\/ 0-initialized buffer with name\n OwningBuffer Four(MemoryBuffer::getNewMemBuffer(123, \"zeros\"));\n EXPECT_TRUE(0 != Four.get());\n for (size_t i = 0; i < 123; ++i)\n EXPECT_EQ(0, Four->getBufferStart()[0]);\n}\n\n}\n<commit_msg>Add a simple unit test for MemoryBuffer::getOpenFile<commit_after>\/\/===- llvm\/unittest\/Support\/MemoryBufferTest.cpp - MemoryBuffer tests ----===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements unit tests for the MemoryBuffer support class.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Support\/FileSystem.h\"\n#include \"llvm\/Support\/MemoryBuffer.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/OwningPtr.h\"\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nclass MemoryBufferTest : public testing::Test {\nprotected:\n MemoryBufferTest()\n : data(\"this is some data\")\n { }\n\n virtual void SetUp() { }\n\n typedef OwningPtr<MemoryBuffer> OwningBuffer;\n\n std::string data;\n};\n\nnamespace {\n\nTEST_F(MemoryBufferTest, get) {\n \/\/ Default name and null-terminator flag\n OwningBuffer MB1(MemoryBuffer::getMemBuffer(data));\n EXPECT_TRUE(0 != MB1.get());\n\n \/\/ RequiresNullTerminator = false\n OwningBuffer MB2(MemoryBuffer::getMemBuffer(data, \"one\", false));\n EXPECT_TRUE(0 != MB2.get());\n\n \/\/ RequiresNullTerminator = true\n OwningBuffer MB3(MemoryBuffer::getMemBuffer(data, \"two\", true));\n EXPECT_TRUE(0 != MB3.get());\n\n \/\/ verify all 3 buffers point to the same address\n EXPECT_EQ(MB1->getBufferStart(), MB2->getBufferStart());\n EXPECT_EQ(MB2->getBufferStart(), MB3->getBufferStart());\n\n \/\/ verify the original data is unmodified after deleting the buffers\n MB1.reset();\n MB2.reset();\n MB3.reset();\n EXPECT_EQ(\"this is some data\", data);\n}\n\nTEST_F(MemoryBufferTest, copy) {\n \/\/ copy with no name\n OwningBuffer MBC1(MemoryBuffer::getMemBufferCopy(data));\n EXPECT_TRUE(0 != MBC1.get());\n\n \/\/ copy with a name\n OwningBuffer MBC2(MemoryBuffer::getMemBufferCopy(data, \"copy\"));\n EXPECT_TRUE(0 != MBC2.get());\n\n \/\/ verify the two copies do not point to the same place\n EXPECT_NE(MBC1->getBufferStart(), MBC2->getBufferStart());\n}\n\nTEST_F(MemoryBufferTest, make_new) {\n \/\/ 0-sized buffer\n OwningBuffer Zero(MemoryBuffer::getNewUninitMemBuffer(0));\n EXPECT_TRUE(0 != Zero.get());\n\n \/\/ uninitialized buffer with no name\n OwningBuffer One(MemoryBuffer::getNewUninitMemBuffer(321));\n EXPECT_TRUE(0 != One.get());\n\n \/\/ uninitialized buffer with name\n OwningBuffer Two(MemoryBuffer::getNewUninitMemBuffer(123, \"bla\"));\n EXPECT_TRUE(0 != Two.get());\n\n \/\/ 0-initialized buffer with no name\n OwningBuffer Three(MemoryBuffer::getNewMemBuffer(321, data));\n EXPECT_TRUE(0 != Three.get());\n for (size_t i = 0; i < 321; ++i)\n EXPECT_EQ(0, Three->getBufferStart()[0]);\n\n \/\/ 0-initialized buffer with name\n OwningBuffer Four(MemoryBuffer::getNewMemBuffer(123, \"zeros\"));\n EXPECT_TRUE(0 != Four.get());\n for (size_t i = 0; i < 123; ++i)\n EXPECT_EQ(0, Four->getBufferStart()[0]);\n}\n\nTEST_F(MemoryBufferTest, getOpenFileNoNullTerminator) {\n \/\/ Test that MemoryBuffer::getOpenFile works properly when no null\n \/\/ terminator is requested and the size is large enough to trigger\n \/\/ the usage of memory mapping.\n int TestFD;\n SmallString<64> TestPath;\n \/\/ Create a temporary file and write data into it.\n sys::fs::createTemporaryFile(\"prefix\", \"temp\", TestFD, TestPath);\n \/\/ OF is responsible for closing the file, and is unbuffered so that\n \/\/ the results are immediately visible through the fd.\n raw_fd_ostream OF(TestFD, true, true);\n for (int i = 0; i < 60000; ++i) {\n OF << \"0123456789\";\n }\n\n OwningBuffer Buf;\n error_code EC = MemoryBuffer::getOpenFile(TestFD,\n TestPath.c_str(),\n Buf,\n 40000, \/\/ Size\n -1,\n 8000, \/\/ Offset\n false);\n EXPECT_FALSE(EC);\n\n StringRef BufData = Buf->getBuffer();\n EXPECT_EQ(BufData.size(), 40000U);\n EXPECT_EQ(BufData[0], '0');\n EXPECT_EQ(BufData[9], '9');\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n* *\n* Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *\n* All rights reserved. Email: russ@q12.org Web: www.q12.org *\n* *\n* This library is free software; you can redistribute it and\/or *\n* modify it under the terms of EITHER: *\n* (1) The GNU Lesser General Public License as published by the Free *\n* Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. The text of the GNU Lesser *\n* General Public License is included with this library in the *\n* file LICENSE.TXT. *\n* (2) The BSD-style license that is included with this library in *\n* the file LICENSE-BSD.TXT. *\n* *\n* This library is distributed in the hope that it will be useful, *\n* but WITHOUT ANY WARRANTY; without even the implied warranty of *\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *\n* LICENSE.TXT and LICENSE-BSD.TXT for more details. *\n* *\n*************************************************************************\/\n\n\/*\n\nODE initialization\/finalization code\n\n*\/\n\n#include <ode\/common.h>\n#include <ode\/odemath.h>\n#include <ode\/odeinit.h>\n\/\/ <ode\/objects.h> included for dWorldQuickStepCleanup()\n#include <ode\/objects.h>\n#include \"config.h\"\n#include \"collision_kernel.h\"\n#include \"collision_trimesh_internal.h\"\n#include \"odetls.h\"\n#include \"odeou.h\"\n#include \"util.h\"\n\n\n\/\/****************************************************************************\n\/\/ Initialization tracking variables\n\nstatic unsigned int g_uiODEInitCounter = 0;\nstatic unsigned int g_uiODEInitModes = 0;\n\nenum EODEINITMODE\n{\n\tOIM__MIN,\n\n\tOIM_AUTOTLSCLEANUP = OIM__MIN,\n\tOIM_MANUALTLSCLEANUP,\n\n\tOIM__MAX,\n};\n\n#if dTLS_ENABLED\nstatic const EODETLSKIND g_atkTLSKindsByInitMode[OIM__MAX] =\n{\n\tOTK_AUTOCLEANUP, \/\/ OIM_AUTOTLSCLEANUP,\n\tOTK_MANUALCLEANUP, \/\/ OIM_MANUALTLSCLEANUP,\n};\n#endif \/\/ #if dTLS_ENABLED\n\nstatic inline bool IsODEModeInitialized(EODEINITMODE imInitMode)\n{\n\treturn (g_uiODEInitModes & (1U << imInitMode)) != 0;\n}\n\nstatic inline void SetODEModeInitialized(EODEINITMODE imInitMode)\n{\n\tg_uiODEInitModes |= (1U << imInitMode);\n}\n\nstatic inline void ResetODEModeInitialized(EODEINITMODE imInitMode)\n{\n\tg_uiODEInitModes &= ~(1U << imInitMode);\n}\n\nstatic inline bool IsODEAnyModeInitialized()\n{\n\treturn g_uiODEInitModes != 0;\n}\n\n\nenum\n{\n\tTLD_INTERNAL_COLLISIONDATA_ALLOCATED = 0x00000001,\n};\n\nstatic bool AllocateThreadBasicDataIfNecessary(EODEINITMODE imInitMode)\n{\n\tbool bResult = false;\n\n\tdo\n\t{\n#if dTLS_ENABLED\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\t\/\/ If no flags are set it may mean that TLS slot is not allocated yet\n\t\tif (uDataAllocationFlags == 0)\n\t\t{\n\t\t\t\/\/ Assign zero flags to make sure that TLS slot has been allocated\n\t\t\tif (!COdeTls::AssignDataAllocationFlags(tkTlsKind, 0))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n#endif \/\/ #if dTLS_ENABLED\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void FreeThreadBasicDataOnFailureIfNecessary(EODEINITMODE imInitMode)\n{\n#if dTLS_ENABLED\n\n\tif (imInitMode == OIM_MANUALTLSCLEANUP)\n\t{\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\tif (uDataAllocationFlags == 0)\n\t\t{\n\t\t\t\/\/ So far, only free TLS slot, if no subsystems have data allocated\n\t\t\tCOdeTls::CleanupForThread();\n\t\t}\n\t}\n\n#endif \/\/ #if dTLS_ENABLED\n}\n\n#if dTLS_ENABLED\nstatic bool AllocateThreadCollisionData(EODETLSKIND tkTlsKind)\n{\n\tbool bResult = false;\n\n\tdo\n\t{\n\t\tdIASSERT(!(COdeTls::GetDataAllocationFlags(tkTlsKind) & TLD_INTERNAL_COLLISIONDATA_ALLOCATED));\n\n#if dTRIMESH_ENABLED \n\n\t\tTrimeshCollidersCache *pccColliderCache = new TrimeshCollidersCache();\n\t\tif (!COdeTls::AssignTrimeshCollidersCache(tkTlsKind, pccColliderCache))\n\t\t{\n\t\t\tdelete pccColliderCache;\n\t\t\tbreak;\n\t\t}\n\n#endif \/\/ dTRIMESH_ENABLED\n\n\t\tCOdeTls::SignalDataAllocationFlags(tkTlsKind, TLD_INTERNAL_COLLISIONDATA_ALLOCATED);\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n#endif \/\/ dTLS_ENABLED\n\nstatic bool AllocateThreadCollisionDataIfNecessary(EODEINITMODE imInitMode, bool &bOutDataAllocated)\n{\n\tbool bResult = false;\n\tbOutDataAllocated = false;\n\n\tdo \n\t{\n#if dTLS_ENABLED\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\tif ((uDataAllocationFlags & TLD_INTERNAL_COLLISIONDATA_ALLOCATED) == 0)\n\t\t{\n\t\t\tif (!AllocateThreadCollisionData(tkTlsKind))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbOutDataAllocated = true;\n\t\t}\n\n#endif \/\/ #if dTLS_ENABLED\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void FreeThreadCollisionData(EODEINITMODE imInitMode)\n{\n#if dTLS_ENABLED\n\n\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\tCOdeTls::DestroyTrimeshCollidersCache(tkTlsKind);\n\n\tCOdeTls::DropDataAllocationFlags(tkTlsKind, TLD_INTERNAL_COLLISIONDATA_ALLOCATED);\n\n#endif \/\/ dTLS_ENABLED\n}\n\n\nstatic bool InitODEForMode(EODEINITMODE imInitMode)\n{\n\tbool bResult = false;\n\n#if dOU_ENABLED\n\tbool bOUCustomizationsDone = false;\n#endif\n#if dATOMICS_ENABLED\n\tbool bAtomicsInitialized = false;\n#endif\n#if dTLS_ENABLED\n\tEODETLSKIND tkTLSKindToInit = g_atkTLSKindsByInitMode[imInitMode];\n\tbool bTlsInitialized = false;\n#endif\n\n\tdo\n\t{\n\t\tbool bAnyModeAlreadyInitialized = IsODEAnyModeInitialized();\n\n\t\tif (!bAnyModeAlreadyInitialized)\n\t\t{\n#if dOU_ENABLED\n\t\t\tif (!COdeOu::DoOUCustomizations())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbOUCustomizationsDone = true;\n#endif\n\n#if dATOMICS_ENABLED\n\t\t\tif (!COdeOu::InitializeAtomics())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbAtomicsInitialized = true;\n#endif\n\t\t}\n\n#if dTLS_ENABLED\n\t\tif (!COdeTls::Initialize(tkTLSKindToInit))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tbTlsInitialized = true;\n#endif\n\n\t\tif (!bAnyModeAlreadyInitialized)\n\t\t{\n#if dTRIMESH_ENABLED && dTRIMESH_OPCODE\n\t\t\tif (!Opcode::InitOpcode())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n#endif\n\n#if dTRIMESH_ENABLED && dTRIMESH_GIMPACT\n\t\t\tgimpact_init();\n#endif\n\n\t\t\tdInitColliders();\n\t\t}\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\tif (!bResult)\n\t{\n#if dTLS_ENABLED\n\t\tif (bTlsInitialized)\n\t\t{\n\t\t\tCOdeTls::Finalize(tkTLSKindToInit);\n\t\t}\n#endif\n\n#if dATOMICS_ENABLED\n\t\tif (bAtomicsInitialized)\n\t\t{\n\t\t\tCOdeOu::FinalizeAtomics();\n\t\t}\n#endif\n\n#if dOU_ENABLED\n\t\tif (bOUCustomizationsDone)\n\t\t{\n\t\t\tCOdeOu::UndoOUCustomizations();\n\t\t}\n#endif\n\t}\n\n\treturn bResult;\n}\n\n\nstatic bool AllocateODEDataForThreadForMode(EODEINITMODE imInitMode, unsigned int uiAllocateFlags)\n{\n\tbool bResult = false;\n\n\tbool bCollisionDataAllocated = false;\n\n\tdo\n\t{\n\t\tif (!AllocateThreadBasicDataIfNecessary(imInitMode))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tif (uiAllocateFlags & dAllocateFlagCollisionData)\n\t\t{\n\t\t\tif (!AllocateThreadCollisionDataIfNecessary(imInitMode, bCollisionDataAllocated))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\tif (!bResult)\n\t{\n\t\tif (bCollisionDataAllocated)\n\t\t{\n\t\t\tFreeThreadCollisionData(imInitMode);\n\t\t}\n\n\t\tFreeThreadBasicDataOnFailureIfNecessary(imInitMode);\n\t}\n\n\treturn bResult;\n}\n\n\nstatic void CloseODEForMode(EODEINITMODE imInitMode)\n{\n\tbool bAnyModeStillInitialized = IsODEAnyModeInitialized();\n\n\tif (!bAnyModeStillInitialized)\n\t{\n\t\tdClearPosrCache();\n\t\tdFinitUserClasses();\n\t\tdFinitColliders();\n\n#if dTRIMESH_ENABLED && dTRIMESH_GIMPACT\n\t\tgimpact_terminate();\n#endif\n\n#if dTRIMESH_ENABLED && dTRIMESH_OPCODE\n\t\textern void opcode_collider_cleanup();\n\t\t\/\/ Free up static allocations in opcode\n\t\topcode_collider_cleanup();\n\n\t\tOpcode::CloseOpcode();\n#endif\n\t}\n\n#if dTLS_ENABLED\n\tEODETLSKIND tkTLSKindToFinalize = g_atkTLSKindsByInitMode[imInitMode];\n\tCOdeTls::Finalize(tkTLSKindToFinalize);\n#endif\n\n\tif (!bAnyModeStillInitialized)\n\t{\n#if dATOMICS_ENABLED\n\t\tCOdeOu::FinalizeAtomics();\n#endif\n\n#if dOU_ENABLED\n\t\tCOdeOu::UndoOUCustomizations();\n#endif\n\t}\n}\n\n\n\/\/****************************************************************************\n\/\/ internal initialization and close routine implementations\n\nstatic bool InternalInitODE(unsigned int uiInitFlags)\n{\n\tbool bResult = false;\n\n\tdo \n\t{\n\t\tEODEINITMODE imInitMode = (uiInitFlags & dInitFlagManualThreadCleanup) ? OIM_MANUALTLSCLEANUP : OIM_AUTOTLSCLEANUP;\n\n\t\tif (!IsODEModeInitialized(imInitMode))\n\t\t{\n\t\t\tif (!InitODEForMode(imInitMode))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tSetODEModeInitialized(imInitMode);\n\t\t}\n\n\t\t++g_uiODEInitCounter;\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void InternalCloseODE()\n{\n\tunsigned int uiCurrentMode = (--g_uiODEInitCounter == 0) ? OIM__MIN : OIM__MAX;\n\tfor (; uiCurrentMode != OIM__MAX; ++uiCurrentMode)\n\t{\n\t\tif (IsODEModeInitialized((EODEINITMODE)uiCurrentMode))\n\t\t{\n\t\t\t\/\/ Must be called before CloseODEForMode()\n\t\t\tResetODEModeInitialized((EODEINITMODE)uiCurrentMode);\n\n\t\t\t\/\/ Must be called after ResetODEModeInitialized()\n\t\t\tCloseODEForMode((EODEINITMODE)uiCurrentMode);\n\t\t}\n\t}\n}\n\nstatic bool InternalAllocateODEDataForThread(unsigned int uiAllocateFlags)\n{\n\tbool bAnyFailure = false;\n\n\tfor (unsigned uiCurrentMode = OIM__MIN; uiCurrentMode != OIM__MAX; ++uiCurrentMode)\n\t{\n\t\tif (IsODEModeInitialized((EODEINITMODE)uiCurrentMode))\n\t\t{\n\t\t\tif (!AllocateODEDataForThreadForMode((EODEINITMODE)uiCurrentMode, uiAllocateFlags))\n\t\t\t{\n\t\t\t\tbAnyFailure = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool bResult = !bAnyFailure;\n\treturn bResult;\n}\n\nstatic void InternalCleanupODEAllDataForThread()\n{\n#if dTLS_ENABLED\n\tCOdeTls::CleanupForThread();\n#endif\n}\n\n\/\/****************************************************************************\n\/\/ initialization and shutdown routines - allocate and initialize data,\n\/\/ cleanup before exiting\n\nvoid dInitODE()\n{\n\tint bInitResult = InternalInitODE(0);\n\tdIVERIFY(bInitResult);\n\n\tint ibAllocResult = InternalAllocateODEDataForThread(dAllocateMaskAll);\n\tdIVERIFY(ibAllocResult);\n}\n\nint dInitODE2(unsigned int uiInitFlags\/*=0*\/)\n\t{\n\tbool bResult = false;\n\t\n\tbool bODEInitialized = false;\n\n\tdo\n\t\t{\n\t\tif (!InternalInitODE(uiInitFlags))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tbODEInitialized = true;\n\n\t\tif (!InternalAllocateODEDataForThread(dAllocateFlagBasicData))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\n\t\tbResult = true;\n\t}\n\twhile (false);\n\t\n\tif (!bResult)\n\t{\n\t\tif (bODEInitialized)\n\t\t{\n\t\t\tInternalCloseODE();\n}\n\t}\n\n\treturn bResult;\n}\n\n\nint dAllocateODEDataForThread(unsigned int uiAllocateFlags)\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"Call dInitODE2 first\");\n\n\tbool bResult = InternalAllocateODEDataForThread(uiAllocateFlags);\n\treturn bResult;\n}\n\n\nvoid dCleanupODEAllDataForThread()\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"Call dInitODE2 first or delay dCloseODE until all threads exit\");\n\n\tInternalCleanupODEAllDataForThread();\n}\n\n\nvoid dCloseODE()\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"dCloseODE must not be called without dInitODE2 or if dInitODE2 fails\"); \/\/ dCloseODE must not be called without dInitODE2 or if dInitODE2 fails\n\n\tInternalCloseODE();\n}\n\n<commit_msg>Cosmetic: Whitespace corrected<commit_after>\/*************************************************************************\n* *\n* Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *\n* All rights reserved. Email: russ@q12.org Web: www.q12.org *\n* *\n* This library is free software; you can redistribute it and\/or *\n* modify it under the terms of EITHER: *\n* (1) The GNU Lesser General Public License as published by the Free *\n* Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. The text of the GNU Lesser *\n* General Public License is included with this library in the *\n* file LICENSE.TXT. *\n* (2) The BSD-style license that is included with this library in *\n* the file LICENSE-BSD.TXT. *\n* *\n* This library is distributed in the hope that it will be useful, *\n* but WITHOUT ANY WARRANTY; without even the implied warranty of *\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *\n* LICENSE.TXT and LICENSE-BSD.TXT for more details. *\n* *\n*************************************************************************\/\n\n\/*\n\nODE initialization\/finalization code\n\n*\/\n\n#include <ode\/common.h>\n#include <ode\/odemath.h>\n#include <ode\/odeinit.h>\n\/\/ <ode\/objects.h> included for dWorldQuickStepCleanup()\n#include <ode\/objects.h>\n#include \"config.h\"\n#include \"collision_kernel.h\"\n#include \"collision_trimesh_internal.h\"\n#include \"odetls.h\"\n#include \"odeou.h\"\n#include \"util.h\"\n\n\n\/\/****************************************************************************\n\/\/ Initialization tracking variables\n\nstatic unsigned int g_uiODEInitCounter = 0;\nstatic unsigned int g_uiODEInitModes = 0;\n\nenum EODEINITMODE\n{\n\tOIM__MIN,\n\n\tOIM_AUTOTLSCLEANUP = OIM__MIN,\n\tOIM_MANUALTLSCLEANUP,\n\n\tOIM__MAX,\n};\n\n#if dTLS_ENABLED\nstatic const EODETLSKIND g_atkTLSKindsByInitMode[OIM__MAX] =\n{\n\tOTK_AUTOCLEANUP, \/\/ OIM_AUTOTLSCLEANUP,\n\tOTK_MANUALCLEANUP, \/\/ OIM_MANUALTLSCLEANUP,\n};\n#endif \/\/ #if dTLS_ENABLED\n\nstatic inline bool IsODEModeInitialized(EODEINITMODE imInitMode)\n{\n\treturn (g_uiODEInitModes & (1U << imInitMode)) != 0;\n}\n\nstatic inline void SetODEModeInitialized(EODEINITMODE imInitMode)\n{\n\tg_uiODEInitModes |= (1U << imInitMode);\n}\n\nstatic inline void ResetODEModeInitialized(EODEINITMODE imInitMode)\n{\n\tg_uiODEInitModes &= ~(1U << imInitMode);\n}\n\nstatic inline bool IsODEAnyModeInitialized()\n{\n\treturn g_uiODEInitModes != 0;\n}\n\n\nenum\n{\n\tTLD_INTERNAL_COLLISIONDATA_ALLOCATED = 0x00000001,\n};\n\nstatic bool AllocateThreadBasicDataIfNecessary(EODEINITMODE imInitMode)\n{\n\tbool bResult = false;\n\n\tdo\n\t{\n#if dTLS_ENABLED\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\t\/\/ If no flags are set it may mean that TLS slot is not allocated yet\n\t\tif (uDataAllocationFlags == 0)\n\t\t{\n\t\t\t\/\/ Assign zero flags to make sure that TLS slot has been allocated\n\t\t\tif (!COdeTls::AssignDataAllocationFlags(tkTlsKind, 0))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n#endif \/\/ #if dTLS_ENABLED\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void FreeThreadBasicDataOnFailureIfNecessary(EODEINITMODE imInitMode)\n{\n#if dTLS_ENABLED\n\n\tif (imInitMode == OIM_MANUALTLSCLEANUP)\n\t{\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\tif (uDataAllocationFlags == 0)\n\t\t{\n\t\t\t\/\/ So far, only free TLS slot, if no subsystems have data allocated\n\t\t\tCOdeTls::CleanupForThread();\n\t\t}\n\t}\n\n#endif \/\/ #if dTLS_ENABLED\n}\n\n#if dTLS_ENABLED\nstatic bool AllocateThreadCollisionData(EODETLSKIND tkTlsKind)\n{\n\tbool bResult = false;\n\n\tdo\n\t{\n\t\tdIASSERT(!(COdeTls::GetDataAllocationFlags(tkTlsKind) & TLD_INTERNAL_COLLISIONDATA_ALLOCATED));\n\n#if dTRIMESH_ENABLED \n\n\t\tTrimeshCollidersCache *pccColliderCache = new TrimeshCollidersCache();\n\t\tif (!COdeTls::AssignTrimeshCollidersCache(tkTlsKind, pccColliderCache))\n\t\t{\n\t\t\tdelete pccColliderCache;\n\t\t\tbreak;\n\t\t}\n\n#endif \/\/ dTRIMESH_ENABLED\n\n\t\tCOdeTls::SignalDataAllocationFlags(tkTlsKind, TLD_INTERNAL_COLLISIONDATA_ALLOCATED);\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n#endif \/\/ dTLS_ENABLED\n\nstatic bool AllocateThreadCollisionDataIfNecessary(EODEINITMODE imInitMode, bool &bOutDataAllocated)\n{\n\tbool bResult = false;\n\tbOutDataAllocated = false;\n\n\tdo \n\t{\n#if dTLS_ENABLED\n\t\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\t\tconst unsigned uDataAllocationFlags = COdeTls::GetDataAllocationFlags(tkTlsKind);\n\n\t\tif ((uDataAllocationFlags & TLD_INTERNAL_COLLISIONDATA_ALLOCATED) == 0)\n\t\t{\n\t\t\tif (!AllocateThreadCollisionData(tkTlsKind))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbOutDataAllocated = true;\n\t\t}\n\n#endif \/\/ #if dTLS_ENABLED\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void FreeThreadCollisionData(EODEINITMODE imInitMode)\n{\n#if dTLS_ENABLED\n\n\tEODETLSKIND tkTlsKind = g_atkTLSKindsByInitMode[imInitMode];\n\n\tCOdeTls::DestroyTrimeshCollidersCache(tkTlsKind);\n\n\tCOdeTls::DropDataAllocationFlags(tkTlsKind, TLD_INTERNAL_COLLISIONDATA_ALLOCATED);\n\n#endif \/\/ dTLS_ENABLED\n}\n\n\nstatic bool InitODEForMode(EODEINITMODE imInitMode)\n{\n\tbool bResult = false;\n\n#if dOU_ENABLED\n\tbool bOUCustomizationsDone = false;\n#endif\n#if dATOMICS_ENABLED\n\tbool bAtomicsInitialized = false;\n#endif\n#if dTLS_ENABLED\n\tEODETLSKIND tkTLSKindToInit = g_atkTLSKindsByInitMode[imInitMode];\n\tbool bTlsInitialized = false;\n#endif\n\n\tdo\n\t{\n\t\tbool bAnyModeAlreadyInitialized = IsODEAnyModeInitialized();\n\n\t\tif (!bAnyModeAlreadyInitialized)\n\t\t{\n#if dOU_ENABLED\n\t\t\tif (!COdeOu::DoOUCustomizations())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbOUCustomizationsDone = true;\n#endif\n\n#if dATOMICS_ENABLED\n\t\t\tif (!COdeOu::InitializeAtomics())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tbAtomicsInitialized = true;\n#endif\n\t\t}\n\n#if dTLS_ENABLED\n\t\tif (!COdeTls::Initialize(tkTLSKindToInit))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tbTlsInitialized = true;\n#endif\n\n\t\tif (!bAnyModeAlreadyInitialized)\n\t\t{\n#if dTRIMESH_ENABLED && dTRIMESH_OPCODE\n\t\t\tif (!Opcode::InitOpcode())\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n#endif\n\n#if dTRIMESH_ENABLED && dTRIMESH_GIMPACT\n\t\t\tgimpact_init();\n#endif\n\n\t\t\tdInitColliders();\n\t\t}\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\tif (!bResult)\n\t{\n#if dTLS_ENABLED\n\t\tif (bTlsInitialized)\n\t\t{\n\t\t\tCOdeTls::Finalize(tkTLSKindToInit);\n\t\t}\n#endif\n\n#if dATOMICS_ENABLED\n\t\tif (bAtomicsInitialized)\n\t\t{\n\t\t\tCOdeOu::FinalizeAtomics();\n\t\t}\n#endif\n\n#if dOU_ENABLED\n\t\tif (bOUCustomizationsDone)\n\t\t{\n\t\t\tCOdeOu::UndoOUCustomizations();\n\t\t}\n#endif\n\t}\n\n\treturn bResult;\n}\n\n\nstatic bool AllocateODEDataForThreadForMode(EODEINITMODE imInitMode, unsigned int uiAllocateFlags)\n{\n\tbool bResult = false;\n\n\tbool bCollisionDataAllocated = false;\n\n\tdo\n\t{\n\t\tif (!AllocateThreadBasicDataIfNecessary(imInitMode))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tif (uiAllocateFlags & dAllocateFlagCollisionData)\n\t\t{\n\t\t\tif (!AllocateThreadCollisionDataIfNecessary(imInitMode, bCollisionDataAllocated))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\tif (!bResult)\n\t{\n\t\tif (bCollisionDataAllocated)\n\t\t{\n\t\t\tFreeThreadCollisionData(imInitMode);\n\t\t}\n\n\t\tFreeThreadBasicDataOnFailureIfNecessary(imInitMode);\n\t}\n\n\treturn bResult;\n}\n\n\nstatic void CloseODEForMode(EODEINITMODE imInitMode)\n{\n\tbool bAnyModeStillInitialized = IsODEAnyModeInitialized();\n\n\tif (!bAnyModeStillInitialized)\n\t{\n\t\tdClearPosrCache();\n\t\tdFinitUserClasses();\n\t\tdFinitColliders();\n\n#if dTRIMESH_ENABLED && dTRIMESH_GIMPACT\n\t\tgimpact_terminate();\n#endif\n\n#if dTRIMESH_ENABLED && dTRIMESH_OPCODE\n\t\textern void opcode_collider_cleanup();\n\t\t\/\/ Free up static allocations in opcode\n\t\topcode_collider_cleanup();\n\n\t\tOpcode::CloseOpcode();\n#endif\n\t}\n\n#if dTLS_ENABLED\n\tEODETLSKIND tkTLSKindToFinalize = g_atkTLSKindsByInitMode[imInitMode];\n\tCOdeTls::Finalize(tkTLSKindToFinalize);\n#endif\n\n\tif (!bAnyModeStillInitialized)\n\t{\n#if dATOMICS_ENABLED\n\t\tCOdeOu::FinalizeAtomics();\n#endif\n\n#if dOU_ENABLED\n\t\tCOdeOu::UndoOUCustomizations();\n#endif\n\t}\n}\n\n\n\/\/****************************************************************************\n\/\/ internal initialization and close routine implementations\n\nstatic bool InternalInitODE(unsigned int uiInitFlags)\n{\n\tbool bResult = false;\n\n\tdo \n\t{\n\t\tEODEINITMODE imInitMode = (uiInitFlags & dInitFlagManualThreadCleanup) ? OIM_MANUALTLSCLEANUP : OIM_AUTOTLSCLEANUP;\n\n\t\tif (!IsODEModeInitialized(imInitMode))\n\t\t{\n\t\t\tif (!InitODEForMode(imInitMode))\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tSetODEModeInitialized(imInitMode);\n\t\t}\n\n\t\t++g_uiODEInitCounter;\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\treturn bResult;\n}\n\nstatic void InternalCloseODE()\n{\n\tunsigned int uiCurrentMode = (--g_uiODEInitCounter == 0) ? OIM__MIN : OIM__MAX;\n\tfor (; uiCurrentMode != OIM__MAX; ++uiCurrentMode)\n\t{\n\t\tif (IsODEModeInitialized((EODEINITMODE)uiCurrentMode))\n\t\t{\n\t\t\t\/\/ Must be called before CloseODEForMode()\n\t\t\tResetODEModeInitialized((EODEINITMODE)uiCurrentMode);\n\n\t\t\t\/\/ Must be called after ResetODEModeInitialized()\n\t\t\tCloseODEForMode((EODEINITMODE)uiCurrentMode);\n\t\t}\n\t}\n}\n\nstatic bool InternalAllocateODEDataForThread(unsigned int uiAllocateFlags)\n{\n\tbool bAnyFailure = false;\n\n\tfor (unsigned uiCurrentMode = OIM__MIN; uiCurrentMode != OIM__MAX; ++uiCurrentMode)\n\t{\n\t\tif (IsODEModeInitialized((EODEINITMODE)uiCurrentMode))\n\t\t{\n\t\t\tif (!AllocateODEDataForThreadForMode((EODEINITMODE)uiCurrentMode, uiAllocateFlags))\n\t\t\t{\n\t\t\t\tbAnyFailure = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\tbool bResult = !bAnyFailure;\n\treturn bResult;\n}\n\nstatic void InternalCleanupODEAllDataForThread()\n{\n#if dTLS_ENABLED\n\tCOdeTls::CleanupForThread();\n#endif\n}\n\n\/\/****************************************************************************\n\/\/ initialization and shutdown routines - allocate and initialize data,\n\/\/ cleanup before exiting\n\nvoid dInitODE()\n{\n\tint bInitResult = InternalInitODE(0);\n\tdIVERIFY(bInitResult);\n\n\tint ibAllocResult = InternalAllocateODEDataForThread(dAllocateMaskAll);\n\tdIVERIFY(ibAllocResult);\n}\n\nint dInitODE2(unsigned int uiInitFlags\/*=0*\/)\n{\n\tbool bResult = false;\n\n\tbool bODEInitialized = false;\n\n\tdo\n\t{\n\t\tif (!InternalInitODE(uiInitFlags))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tbODEInitialized = true;\n\n\t\tif (!InternalAllocateODEDataForThread(dAllocateFlagBasicData))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tbResult = true;\n\t}\n\twhile (false);\n\n\tif (!bResult)\n\t{\n\t\tif (bODEInitialized)\n\t\t{\n\t\t\tInternalCloseODE();\n\t\t}\n\t}\n\n\treturn bResult;\n}\n\n\nint dAllocateODEDataForThread(unsigned int uiAllocateFlags)\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"Call dInitODE2 first\");\n\n\tbool bResult = InternalAllocateODEDataForThread(uiAllocateFlags);\n\treturn bResult;\n}\n\n\nvoid dCleanupODEAllDataForThread()\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"Call dInitODE2 first or delay dCloseODE until all threads exit\");\n\n\tInternalCleanupODEAllDataForThread();\n}\n\n\nvoid dCloseODE()\n{\n\tdUASSERT(g_uiODEInitCounter != 0, \"dCloseODE must not be called without dInitODE2 or if dInitODE2 fails\"); \/\/ dCloseODE must not be called without dInitODE2 or if dInitODE2 fails\n\n\tInternalCloseODE();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkBinaryThresholdImageFilterTest2.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkStatisticsImageFilter.h\"\n#include \"itkBinaryThresholdImageFilter.h\"\n\n\nint itkBinaryThresholdImageFilterTest2(int ac, char* av[] ) \n{\n if(ac < 4)\n {\n std::cerr << \"Usage: \" << av[0] <<\" InputImage1 InputImage2 OutputImage\\n\";\n return -1;\n }\n\n \/\/ Threshold one image based on the statistics of another image\n \/\/\n \/\/\n \n \/\/ Define the dimension of the images\n const unsigned int ImageDimension = 2;\n\n \/\/ Declare the types of the images\n typedef itk::Image<unsigned char, ImageDimension> ImageType;\n typedef itk::Image<double, ImageDimension> FloatImageType;\n\n \/\/ File reader and writer\n typedef itk::ImageFileReader<FloatImageType> ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( av[1] );\n\n ReaderType::Pointer reader2 = ReaderType::New();\n reader2->SetFileName( av[2] );\n \n typedef itk::ImageFileWriter<ImageType> WriterType;\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName( av[3] );\n \n \/\/ Declare the filter types\n typedef itk::StatisticsImageFilter<FloatImageType> StatisticsType;\n typedef itk::BinaryThresholdImageFilter<FloatImageType, ImageType> ThresholdType;\n \n \/\/ Create the filters \n StatisticsType::Pointer statistics = StatisticsType::New();\n ThresholdType::Pointer threshold = ThresholdType::New();\n\n \/\/ connect the standard pipeline connections\n statistics->SetInput( reader2->GetOutput() );\n threshold->SetInput( reader->GetOutput() );\n\n \/\/ now connect the inputs and outputs that are decorated scalars\n threshold->SetUpperThresholdInput( statistics->GetMeanOutput() );\n threshold->SetLowerThresholdInput( statistics->GetMinimumOutput() );\n \n \/\/ connect the writer\n writer->SetInput( threshold->GetOutput() );\n \n \/\/ Execute the filter\n try\n {\n writer->Update();\n }\n catch(...)\n {\n std::cerr << \"Caught an unexpected exception. \" << std::endl;\n std::cerr << \"Test failed. \" << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\n\n\n\n<commit_msg>ENH: Print before lower\/upper is set.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkBinaryThresholdImageFilterTest2.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) Insight Software Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n\n\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include \"itkStatisticsImageFilter.h\"\n#include \"itkBinaryThresholdImageFilter.h\"\n\n\nint itkBinaryThresholdImageFilterTest2(int ac, char* av[] ) \n{\n if(ac < 4)\n {\n std::cerr << \"Usage: \" << av[0] <<\" InputImage1 InputImage2 OutputImage\\n\";\n return -1;\n }\n\n \/\/ Threshold one image based on the statistics of another image\n \/\/\n \/\/\n \n \/\/ Define the dimension of the images\n const unsigned int ImageDimension = 2;\n\n \/\/ Declare the types of the images\n typedef itk::Image<unsigned char, ImageDimension> ImageType;\n typedef itk::Image<double, ImageDimension> FloatImageType;\n\n \/\/ File reader and writer\n typedef itk::ImageFileReader<FloatImageType> ReaderType;\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName( av[1] );\n\n ReaderType::Pointer reader2 = ReaderType::New();\n reader2->SetFileName( av[2] );\n \n typedef itk::ImageFileWriter<ImageType> WriterType;\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName( av[3] );\n \n \/\/ Declare the filter types\n typedef itk::StatisticsImageFilter<FloatImageType> StatisticsType;\n typedef itk::BinaryThresholdImageFilter<FloatImageType, ImageType> ThresholdType;\n \n \/\/ Create the filters \n StatisticsType::Pointer statistics = StatisticsType::New();\n ThresholdType::Pointer threshold = ThresholdType::New();\n\n \/\/ connect the standard pipeline connections\n statistics->SetInput( reader2->GetOutput() );\n threshold->SetInput( reader->GetOutput() );\n\n \/\/ print before assigning thresholds\n threshold->Print(std::cout);\n\n \/\/ now connect the inputs and outputs that are decorated scalars\n threshold->SetUpperThresholdInput( statistics->GetMeanOutput() );\n threshold->SetLowerThresholdInput( statistics->GetMinimumOutput() );\n \n \/\/ connect the writer\n writer->SetInput( threshold->GetOutput() );\n \n \/\/ Execute the filter\n try\n {\n writer->Update();\n }\n catch(...)\n {\n std::cerr << \"Caught an unexpected exception. \" << std::endl;\n std::cerr << \"Test failed. \" << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * yosys -- Yosys Open SYnthesis Suite\n *\n * Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"kernel\/register.h\"\n#include \"kernel\/celltypes.h\"\n#include \"passes\/techmap\/libparse.h\"\n\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct statdata_t\n{\n\t#define STAT_INT_MEMBERS X(num_wires) X(num_wire_bits) X(num_pub_wires) X(num_pub_wire_bits) \\\n\t\t\tX(num_memories) X(num_memory_bits) X(num_cells) X(num_processes)\n\n\t#define STAT_NUMERIC_MEMBERS STAT_INT_MEMBERS X(area)\n\n\t#define X(_name) int _name;\n\tSTAT_INT_MEMBERS\n\t#undef X\n\tdouble area;\n\n\tstd::map<RTLIL::IdString, int, RTLIL::sort_by_id_str> num_cells_by_type;\n\tstd::set<RTLIL::IdString> unknown_cell_area;\n\n\tstatdata_t operator+(const statdata_t &other) const\n\t{\n\t\tstatdata_t sum = other;\n\t#define X(_name) sum._name += _name;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t\tfor (auto &it : num_cells_by_type)\n\t\t\tsum.num_cells_by_type[it.first] += it.second;\n\t\treturn sum;\n\t}\n\n\tstatdata_t operator*(int other) const\n\t{\n\t\tstatdata_t sum = *this;\n\t#define X(_name) sum._name *= other;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t\tfor (auto &it : sum.num_cells_by_type)\n\t\t\tit.second *= other;\n\t\treturn sum;\n\t}\n\n\tstatdata_t()\n\t{\n\t#define X(_name) _name = 0;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t}\n\n\tstatdata_t(RTLIL::Design *design, RTLIL::Module *mod, bool width_mode, const dict<IdString, double> &cell_area)\n\t{\n\t#define X(_name) _name = 0;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\n\t\tfor (auto &it : mod->wires_)\n\t\t{\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\n\t\t\tif (it.first[0] == '\\\\') {\n\t\t\t\tnum_pub_wires++;\n\t\t\t\tnum_pub_wire_bits += it.second->width;\n\t\t\t}\n\n\t\t\tnum_wires++;\n\t\t\tnum_wire_bits += it.second->width;\n\t\t}\n\n\t\tfor (auto &it : mod->memories) {\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\t\t\tnum_memories++;\n\t\t\tnum_memory_bits += it.second->width * it.second->size;\n\t\t}\n\n\t\tfor (auto &it : mod->cells_)\n\t\t{\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\n\t\t\tRTLIL::IdString cell_type = it.second->type;\n\n\t\t\tif (width_mode)\n\t\t\t{\n\t\t\t\tif (cell_type.in(\"$not\", \"$pos\", \"$neg\",\n\t\t\t\t\t\t\"$logic_not\", \"$logic_and\", \"$logic_or\",\n\t\t\t\t\t\t\"$reduce_and\", \"$reduce_or\", \"$reduce_xor\", \"$reduce_xnor\", \"$reduce_bool\",\n\t\t\t\t\t\t\"$lut\", \"$and\", \"$or\", \"$xor\", \"$xnor\",\n\t\t\t\t\t\t\"$shl\", \"$shr\", \"$sshl\", \"$sshr\", \"$shift\", \"$shiftx\",\n\t\t\t\t\t\t\"$lt\", \"$le\", \"$eq\", \"$ne\", \"$eqx\", \"$nex\", \"$ge\", \"$gt\",\n\t\t\t\t\t\t\"$add\", \"$sub\", \"$mul\", \"$div\", \"$mod\", \"$pow\")) {\n\t\t\t\t\tint width_a = it.second->hasPort(\"\\\\A\") ? GetSize(it.second->getPort(\"\\\\A\")) : 0;\n\t\t\t\t\tint width_b = it.second->hasPort(\"\\\\B\") ? GetSize(it.second->getPort(\"\\\\B\")) : 0;\n\t\t\t\t\tint width_y = it.second->hasPort(\"\\\\Y\") ? GetSize(it.second->getPort(\"\\\\Y\")) : 0;\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), max<int>({width_a, width_b, width_y}));\n\t\t\t\t}\n\t\t\t\telse if (cell_type.in(\"$mux\", \"$pmux\"))\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), GetSize(it.second->getPort(\"\\\\Y\")));\n\t\t\t\telse if (cell_type.in(\"$sr\", \"$dff\", \"$dffsr\", \"$adff\", \"$dlatch\", \"$dlatchsr\"))\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), GetSize(it.second->getPort(\"\\\\Q\")));\n\t\t\t}\n\n\t\t\tif (!cell_area.empty()) {\n\t\t\t\tif (cell_area.count(cell_type))\n\t\t\t\t\tarea += cell_area.at(cell_type);\n\t\t\t\telse\n\t\t\t\t\tunknown_cell_area.insert(cell_type);\n\t\t\t}\n\n\t\t\tnum_cells++;\n\t\t\tnum_cells_by_type[cell_type]++;\n\t\t}\n\n\t\tfor (auto &it : mod->processes) {\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\t\t\tnum_processes++;\n\t\t}\n\t}\n\n\tvoid log_data()\n\t{\n\t\tlog(\" Number of wires: %6d\\n\", num_wires);\n\t\tlog(\" Number of wire bits: %6d\\n\", num_wire_bits);\n\t\tlog(\" Number of public wires: %6d\\n\", num_pub_wires);\n\t\tlog(\" Number of public wire bits: %6d\\n\", num_pub_wire_bits);\n\t\tlog(\" Number of memories: %6d\\n\", num_memories);\n\t\tlog(\" Number of memory bits: %6d\\n\", num_memory_bits);\n\t\tlog(\" Number of processes: %6d\\n\", num_processes);\n\t\tlog(\" Number of cells: %6d\\n\", num_cells);\n\t\tfor (auto &it : num_cells_by_type)\n\t\t\tlog(\" %-26s %6d\\n\", RTLIL::id2cstr(it.first), it.second);\n\n\t\tif (!unknown_cell_area.empty()) {\n\t\t\tlog(\"\\n\");\n\t\t\tfor (auto cell_type : unknown_cell_area)\n\t\t\t\tlog(\" Area for cell type %s is unknown!\\n\", cell_type.c_str());\n\t\t}\n\n\t\tif (area != 0) {\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\" Chip area for this module: %f\\n\", area);\n\t\t}\n\t}\n};\n\nstatdata_t hierarchy_worker(std::map<RTLIL::IdString, statdata_t> &mod_stat, RTLIL::IdString mod, int level)\n{\n\tstatdata_t mod_data = mod_stat.at(mod);\n\tstd::map<RTLIL::IdString, int, RTLIL::sort_by_id_str> num_cells_by_type;\n\tnum_cells_by_type.swap(mod_data.num_cells_by_type);\n\n\tfor (auto &it : num_cells_by_type)\n\t\tif (mod_stat.count(it.first) > 0) {\n\t\t\tlog(\" %*s%-*s %6d\\n\", 2*level, \"\", 26-2*level, RTLIL::id2cstr(it.first), it.second);\n\t\t\tmod_data = mod_data + hierarchy_worker(mod_stat, it.first, level+1) * it.second;\n\t\t\tmod_data.num_cells -= it.second;\n\t\t} else {\n\t\t\tmod_data.num_cells_by_type[it.first] += it.second;\n\t\t}\n\n\treturn mod_data;\n}\n\nvoid read_liberty_cellarea(dict<IdString, double> &cell_area, string liberty_file)\n{\n\tstd::ifstream f;\n\tf.open(liberty_file.c_str());\n\tif (f.fail())\n\t\tlog_cmd_error(\"Can't open liberty file `%s': %s\\n\", liberty_file.c_str(), strerror(errno));\n\tLibertyParser libparser(f);\n\tf.close();\n\n\tfor (auto cell : libparser.ast->children)\n\t{\n\t\tif (cell->id != \"cell\" || cell->args.size() != 1)\n\t\t\tcontinue;\n\n\t\tLibertyAst *ar = cell->find(\"area\");\n\t\tif (ar != NULL && !ar->value.empty())\n\t\t\tcell_area[\"\\\\\" + cell->args[0]] = atof(ar->value.c_str());\n\t}\n}\n\nstruct StatPass : public Pass {\n\tStatPass() : Pass(\"stat\", \"print some statistics\") { }\n\tvirtual void help()\n\t{\n\t\t\/\/ |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\" stat [options] [selection]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"Print some statistics (number of objects) on the selected portion of the\\n\");\n\t\tlog(\"design.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -top <module>\\n\");\n\t\tlog(\" print design hierarchy with this module as top. if the design is fully\\n\");\n\t\tlog(\" selected and a module has the 'top' attribute set, this module is used\\n\");\n\t\tlog(\" default value for this option.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -liberty <liberty_file>\\n\");\n\t\tlog(\" use cell area information from the provided liberty file\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -width\\n\");\n\t\tlog(\" annotate internal cell types with their word width.\\n\");\n\t\tlog(\" e.g. $add_8 for an 8 bit wide $add cell.\\n\");\n\t\tlog(\"\\n\");\n\t}\n\tvirtual void execute(std::vector<std::string> args, RTLIL::Design *design)\n\t{\n\t\tlog_header(design, \"Printing statistics.\\n\");\n\n\t\tbool width_mode = false;\n\t\tRTLIL::Module *top_mod = NULL;\n\t\tstd::map<RTLIL::IdString, statdata_t> mod_stat;\n\t\tdict<IdString, double> cell_area;\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-width\") {\n\t\t\t\twidth_mode = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-liberty\" && argidx+1 < args.size()) {\n\t\t\t\tstring liberty_file = args[++argidx];\n\t\t\t\trewrite_filename(liberty_file);\n\t\t\t\tread_liberty_cellarea(cell_area, liberty_file);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\tif (design->modules_.count(RTLIL::escape_id(args[argidx+1])) == 0)\n\t\t\t\t\tlog_cmd_error(\"Can't find module %s.\\n\", args[argidx+1].c_str());\n\t\t\t\ttop_mod = design->modules_.at(RTLIL::escape_id(args[++argidx]));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\textra_args(args, argidx, design);\n\n\t\tfor (auto mod : design->selected_modules())\n\t\t{\n\t\t\tif (!top_mod && design->full_selection())\n\t\t\t\tif (mod->get_bool_attribute(\"\\\\top\"))\n\t\t\t\t\ttop_mod = mod;\n\n\t\t\tstatdata_t data(design, mod, width_mode, cell_area);\n\t\t\tmod_stat[mod->name] = data;\n\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\"=== %s%s ===\\n\", RTLIL::id2cstr(mod->name), design->selected_whole_module(mod->name) ? \"\" : \" (partially selected)\");\n\t\t\tlog(\"\\n\");\n\t\t\tdata.log_data();\n\t\t}\n\n\t\tif (top_mod != NULL && GetSize(mod_stat) > 1)\n\t\t{\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\"=== design hierarchy ===\\n\");\n\t\t\tlog(\"\\n\");\n\n\t\t\tlog(\" %-28s %6d\\n\", RTLIL::id2cstr(top_mod->name), 1);\n\t\t\tstatdata_t data = hierarchy_worker(mod_stat, top_mod->name, 0);\n\n\t\t\tlog(\"\\n\");\n\t\t\tdata.log_data();\n\t\t}\n\n\t\tlog(\"\\n\");\n\t}\n} StatPass;\n\nPRIVATE_NAMESPACE_END\n<commit_msg>Add $alu to list of supported cells for \"stat -width\"<commit_after>\/*\n * yosys -- Yosys Open SYnthesis Suite\n *\n * Copyright (C) 2012 Clifford Wolf <clifford@clifford.at>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"kernel\/register.h\"\n#include \"kernel\/celltypes.h\"\n#include \"passes\/techmap\/libparse.h\"\n\n#include \"kernel\/log.h\"\n\nUSING_YOSYS_NAMESPACE\nPRIVATE_NAMESPACE_BEGIN\n\nstruct statdata_t\n{\n\t#define STAT_INT_MEMBERS X(num_wires) X(num_wire_bits) X(num_pub_wires) X(num_pub_wire_bits) \\\n\t\t\tX(num_memories) X(num_memory_bits) X(num_cells) X(num_processes)\n\n\t#define STAT_NUMERIC_MEMBERS STAT_INT_MEMBERS X(area)\n\n\t#define X(_name) int _name;\n\tSTAT_INT_MEMBERS\n\t#undef X\n\tdouble area;\n\n\tstd::map<RTLIL::IdString, int, RTLIL::sort_by_id_str> num_cells_by_type;\n\tstd::set<RTLIL::IdString> unknown_cell_area;\n\n\tstatdata_t operator+(const statdata_t &other) const\n\t{\n\t\tstatdata_t sum = other;\n\t#define X(_name) sum._name += _name;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t\tfor (auto &it : num_cells_by_type)\n\t\t\tsum.num_cells_by_type[it.first] += it.second;\n\t\treturn sum;\n\t}\n\n\tstatdata_t operator*(int other) const\n\t{\n\t\tstatdata_t sum = *this;\n\t#define X(_name) sum._name *= other;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t\tfor (auto &it : sum.num_cells_by_type)\n\t\t\tit.second *= other;\n\t\treturn sum;\n\t}\n\n\tstatdata_t()\n\t{\n\t#define X(_name) _name = 0;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\t}\n\n\tstatdata_t(RTLIL::Design *design, RTLIL::Module *mod, bool width_mode, const dict<IdString, double> &cell_area)\n\t{\n\t#define X(_name) _name = 0;\n\t\tSTAT_NUMERIC_MEMBERS\n\t#undef X\n\n\t\tfor (auto &it : mod->wires_)\n\t\t{\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\n\t\t\tif (it.first[0] == '\\\\') {\n\t\t\t\tnum_pub_wires++;\n\t\t\t\tnum_pub_wire_bits += it.second->width;\n\t\t\t}\n\n\t\t\tnum_wires++;\n\t\t\tnum_wire_bits += it.second->width;\n\t\t}\n\n\t\tfor (auto &it : mod->memories) {\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\t\t\tnum_memories++;\n\t\t\tnum_memory_bits += it.second->width * it.second->size;\n\t\t}\n\n\t\tfor (auto &it : mod->cells_)\n\t\t{\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\n\t\t\tRTLIL::IdString cell_type = it.second->type;\n\n\t\t\tif (width_mode)\n\t\t\t{\n\t\t\t\tif (cell_type.in(\"$not\", \"$pos\", \"$neg\",\n\t\t\t\t\t\t\"$logic_not\", \"$logic_and\", \"$logic_or\",\n\t\t\t\t\t\t\"$reduce_and\", \"$reduce_or\", \"$reduce_xor\", \"$reduce_xnor\", \"$reduce_bool\",\n\t\t\t\t\t\t\"$lut\", \"$and\", \"$or\", \"$xor\", \"$xnor\",\n\t\t\t\t\t\t\"$shl\", \"$shr\", \"$sshl\", \"$sshr\", \"$shift\", \"$shiftx\",\n\t\t\t\t\t\t\"$lt\", \"$le\", \"$eq\", \"$ne\", \"$eqx\", \"$nex\", \"$ge\", \"$gt\",\n\t\t\t\t\t\t\"$add\", \"$sub\", \"$mul\", \"$div\", \"$mod\", \"$pow\", \"$alu\")) {\n\t\t\t\t\tint width_a = it.second->hasPort(\"\\\\A\") ? GetSize(it.second->getPort(\"\\\\A\")) : 0;\n\t\t\t\t\tint width_b = it.second->hasPort(\"\\\\B\") ? GetSize(it.second->getPort(\"\\\\B\")) : 0;\n\t\t\t\t\tint width_y = it.second->hasPort(\"\\\\Y\") ? GetSize(it.second->getPort(\"\\\\Y\")) : 0;\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), max<int>({width_a, width_b, width_y}));\n\t\t\t\t}\n\t\t\t\telse if (cell_type.in(\"$mux\", \"$pmux\"))\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), GetSize(it.second->getPort(\"\\\\Y\")));\n\t\t\t\telse if (cell_type.in(\"$sr\", \"$dff\", \"$dffsr\", \"$adff\", \"$dlatch\", \"$dlatchsr\"))\n\t\t\t\t\tcell_type = stringf(\"%s_%d\", cell_type.c_str(), GetSize(it.second->getPort(\"\\\\Q\")));\n\t\t\t}\n\n\t\t\tif (!cell_area.empty()) {\n\t\t\t\tif (cell_area.count(cell_type))\n\t\t\t\t\tarea += cell_area.at(cell_type);\n\t\t\t\telse\n\t\t\t\t\tunknown_cell_area.insert(cell_type);\n\t\t\t}\n\n\t\t\tnum_cells++;\n\t\t\tnum_cells_by_type[cell_type]++;\n\t\t}\n\n\t\tfor (auto &it : mod->processes) {\n\t\t\tif (!design->selected(mod, it.second))\n\t\t\t\tcontinue;\n\t\t\tnum_processes++;\n\t\t}\n\t}\n\n\tvoid log_data()\n\t{\n\t\tlog(\" Number of wires: %6d\\n\", num_wires);\n\t\tlog(\" Number of wire bits: %6d\\n\", num_wire_bits);\n\t\tlog(\" Number of public wires: %6d\\n\", num_pub_wires);\n\t\tlog(\" Number of public wire bits: %6d\\n\", num_pub_wire_bits);\n\t\tlog(\" Number of memories: %6d\\n\", num_memories);\n\t\tlog(\" Number of memory bits: %6d\\n\", num_memory_bits);\n\t\tlog(\" Number of processes: %6d\\n\", num_processes);\n\t\tlog(\" Number of cells: %6d\\n\", num_cells);\n\t\tfor (auto &it : num_cells_by_type)\n\t\t\tlog(\" %-26s %6d\\n\", RTLIL::id2cstr(it.first), it.second);\n\n\t\tif (!unknown_cell_area.empty()) {\n\t\t\tlog(\"\\n\");\n\t\t\tfor (auto cell_type : unknown_cell_area)\n\t\t\t\tlog(\" Area for cell type %s is unknown!\\n\", cell_type.c_str());\n\t\t}\n\n\t\tif (area != 0) {\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\" Chip area for this module: %f\\n\", area);\n\t\t}\n\t}\n};\n\nstatdata_t hierarchy_worker(std::map<RTLIL::IdString, statdata_t> &mod_stat, RTLIL::IdString mod, int level)\n{\n\tstatdata_t mod_data = mod_stat.at(mod);\n\tstd::map<RTLIL::IdString, int, RTLIL::sort_by_id_str> num_cells_by_type;\n\tnum_cells_by_type.swap(mod_data.num_cells_by_type);\n\n\tfor (auto &it : num_cells_by_type)\n\t\tif (mod_stat.count(it.first) > 0) {\n\t\t\tlog(\" %*s%-*s %6d\\n\", 2*level, \"\", 26-2*level, RTLIL::id2cstr(it.first), it.second);\n\t\t\tmod_data = mod_data + hierarchy_worker(mod_stat, it.first, level+1) * it.second;\n\t\t\tmod_data.num_cells -= it.second;\n\t\t} else {\n\t\t\tmod_data.num_cells_by_type[it.first] += it.second;\n\t\t}\n\n\treturn mod_data;\n}\n\nvoid read_liberty_cellarea(dict<IdString, double> &cell_area, string liberty_file)\n{\n\tstd::ifstream f;\n\tf.open(liberty_file.c_str());\n\tif (f.fail())\n\t\tlog_cmd_error(\"Can't open liberty file `%s': %s\\n\", liberty_file.c_str(), strerror(errno));\n\tLibertyParser libparser(f);\n\tf.close();\n\n\tfor (auto cell : libparser.ast->children)\n\t{\n\t\tif (cell->id != \"cell\" || cell->args.size() != 1)\n\t\t\tcontinue;\n\n\t\tLibertyAst *ar = cell->find(\"area\");\n\t\tif (ar != NULL && !ar->value.empty())\n\t\t\tcell_area[\"\\\\\" + cell->args[0]] = atof(ar->value.c_str());\n\t}\n}\n\nstruct StatPass : public Pass {\n\tStatPass() : Pass(\"stat\", \"print some statistics\") { }\n\tvirtual void help()\n\t{\n\t\t\/\/ |---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|---v---|\n\t\tlog(\"\\n\");\n\t\tlog(\" stat [options] [selection]\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\"Print some statistics (number of objects) on the selected portion of the\\n\");\n\t\tlog(\"design.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -top <module>\\n\");\n\t\tlog(\" print design hierarchy with this module as top. if the design is fully\\n\");\n\t\tlog(\" selected and a module has the 'top' attribute set, this module is used\\n\");\n\t\tlog(\" default value for this option.\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -liberty <liberty_file>\\n\");\n\t\tlog(\" use cell area information from the provided liberty file\\n\");\n\t\tlog(\"\\n\");\n\t\tlog(\" -width\\n\");\n\t\tlog(\" annotate internal cell types with their word width.\\n\");\n\t\tlog(\" e.g. $add_8 for an 8 bit wide $add cell.\\n\");\n\t\tlog(\"\\n\");\n\t}\n\tvirtual void execute(std::vector<std::string> args, RTLIL::Design *design)\n\t{\n\t\tlog_header(design, \"Printing statistics.\\n\");\n\n\t\tbool width_mode = false;\n\t\tRTLIL::Module *top_mod = NULL;\n\t\tstd::map<RTLIL::IdString, statdata_t> mod_stat;\n\t\tdict<IdString, double> cell_area;\n\n\t\tsize_t argidx;\n\t\tfor (argidx = 1; argidx < args.size(); argidx++)\n\t\t{\n\t\t\tif (args[argidx] == \"-width\") {\n\t\t\t\twidth_mode = true;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-liberty\" && argidx+1 < args.size()) {\n\t\t\t\tstring liberty_file = args[++argidx];\n\t\t\t\trewrite_filename(liberty_file);\n\t\t\t\tread_liberty_cellarea(cell_area, liberty_file);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (args[argidx] == \"-top\" && argidx+1 < args.size()) {\n\t\t\t\tif (design->modules_.count(RTLIL::escape_id(args[argidx+1])) == 0)\n\t\t\t\t\tlog_cmd_error(\"Can't find module %s.\\n\", args[argidx+1].c_str());\n\t\t\t\ttop_mod = design->modules_.at(RTLIL::escape_id(args[++argidx]));\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t\textra_args(args, argidx, design);\n\n\t\tfor (auto mod : design->selected_modules())\n\t\t{\n\t\t\tif (!top_mod && design->full_selection())\n\t\t\t\tif (mod->get_bool_attribute(\"\\\\top\"))\n\t\t\t\t\ttop_mod = mod;\n\n\t\t\tstatdata_t data(design, mod, width_mode, cell_area);\n\t\t\tmod_stat[mod->name] = data;\n\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\"=== %s%s ===\\n\", RTLIL::id2cstr(mod->name), design->selected_whole_module(mod->name) ? \"\" : \" (partially selected)\");\n\t\t\tlog(\"\\n\");\n\t\t\tdata.log_data();\n\t\t}\n\n\t\tif (top_mod != NULL && GetSize(mod_stat) > 1)\n\t\t{\n\t\t\tlog(\"\\n\");\n\t\t\tlog(\"=== design hierarchy ===\\n\");\n\t\t\tlog(\"\\n\");\n\n\t\t\tlog(\" %-28s %6d\\n\", RTLIL::id2cstr(top_mod->name), 1);\n\t\t\tstatdata_t data = hierarchy_worker(mod_stat, top_mod->name, 0);\n\n\t\t\tlog(\"\\n\");\n\t\t\tdata.log_data();\n\t\t}\n\n\t\tlog(\"\\n\");\n\t}\n} StatPass;\n\nPRIVATE_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Marek Biskup 07\/06\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2004, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ A Chain Index\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TChainIndex.h\"\n#include \"TChain.h\"\n#include \"TTreeFormula.h\"\n#include \"TTreeIndex.h\"\n#include \"TFile.h\"\n#include \"TError.h\"\n\nClassImp(TChainIndex)\n\n\/\/______________________________________________________________________________\nTChainIndex::TChainIndex(): TVirtualIndex()\n{\n\/\/ Default constructor for TChainIndex\n\n fTree = 0;\n fMajorFormulaParent = fMinorFormulaParent = 0;\n}\n\n\/\/______________________________________________________________________________\nTChainIndex::TChainIndex(const TTree *T, const char *majorname, const char *minorname)\n : TVirtualIndex()\n{\n \/\/ Normal constructor for TChainIndex. See TTreeIndex::TTreeIndex for the description of the\n \/\/ parameters.\n \/\/ The tree must be a TChain.\n \/\/ All the index values in the first tree of the chain must be\n \/\/ less then any index value in the second one, and so on.\n \/\/ If any of those requirements isn't met the object becomes a zombie.\n \/\/ If some subtrees don't have indices the indices are created and stored inside this\n \/\/ TChainIndex.\n\n fTree = 0;\n fMajorFormulaParent = fMinorFormulaParent = 0;\n\n TChain *chain = dynamic_cast<TChain*>(const_cast<TTree*>(T));\n if (!chain) {\n MakeZombie();\n Error(\"TChainIndex\", \"Cannot create a TChainIndex.\"\n \" The Tree passed as an argument is not a TChain\");\n return;\n }\n\n fTree = (TTree*)T;\n fMajorName = majorname;\n fMinorName = minorname;\n Int_t i = 0;\n\n \/\/ Go through all the trees and check if they have indeces. If not then build them.\n for (i = 0; i < chain->GetNtrees(); i++) {\n chain->LoadTree((chain->GetTreeOffset())[i]);\n TVirtualIndex *index = chain->GetTree()->GetTreeIndex();\n\n TChainIndexEntry entry;\n entry.fTreeIndex = 0;\n\n \/\/if an index already exists, we must check if major\/minorname correspond\n \/\/to the major\/minor names in this function call\n if (index) {\n if (strcmp(majorname,index->GetMajorName()) || strcmp(minorname,index->GetMinorName())) {\n MakeZombie();\n Error(\"TChainIndex\",\"Tree in file %s has an index built with majorname=%s and minorname=%s\",chain->GetTree()->GetCurrentFile()->GetName(),index->GetMajorName(),index->GetMinorName());\n return;\n }\n }\n if (!index) {\n chain->GetTree()->BuildIndex(majorname, minorname);\n index = chain->GetTree()->GetTreeIndex();\n chain->GetTree()->SetTreeIndex(0);\n entry.fTreeIndex = index;\n }\n if (!index || index->IsZombie() || index->GetN() == 0) {\n DeleteIndices();\n MakeZombie();\n Error(\"TChainIndex\", \"Error creating a tree index on a tree in the chain\");\n return;\n }\n\n TTreeIndex *ti_index = dynamic_cast<TTreeIndex*>(index);\n if (ti_index == 0) {\n Error(\"TChainIndex\", \"The underlying TTree must have a TTreeIndex but has a %s.\",\n index->IsA()->GetName());\n return;\n }\n\n entry.fMinIndexValue = ti_index->GetIndexValues()[0];\n entry.fMaxIndexValue = ti_index->GetIndexValues()[index->GetN() - 1];\n fEntries.push_back(entry);\n }\n\n \/\/ Check if the indices of different trees are in order. If not then return an error.\n for (i = 0; i < Int_t(fEntries.size() - 1); i++) {\n if (fEntries[i].fMaxIndexValue > fEntries[i+1].fMinIndexValue) {\n DeleteIndices();\n MakeZombie();\n Error(\"TChainIndex\", \"The indices in files of this chain aren't sorted.\");\n }\n }\n\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::Append(const TVirtualIndex *index, Bool_t delaySort )\n{\n \/\/ add an index to this chain\n \/\/ if delaySort is kFALSE (default) check if the indices of different trees are in order.\n if (index) {\n const TTreeIndex *ti_index = dynamic_cast<const TTreeIndex*>(index);\n if (ti_index == 0) {\n Error(\"Append\", \"The given index is not a TTreeIndex but a %s\",\n index->IsA()->GetName());\n }\n \n TChainIndexEntry entry;\n entry.fTreeIndex = 0;\n entry.fMinIndexValue = ti_index->GetIndexValues()[0];\n entry.fMaxIndexValue = ti_index->GetIndexValues()[index->GetN() - 1];\n fEntries.push_back(entry);\n }\n \n if (!delaySort) {\n \/\/ Check if the indices of different trees are in order. If not then return an error.\n for (Int_t i = 0; i < Int_t(fEntries.size() - 1); i++) {\n if (fEntries[i].fMaxIndexValue > fEntries[i+1].fMinIndexValue) {\n DeleteIndices();\n MakeZombie();\n Error(\"Append\", \"The indices in files of this chain aren't sorted.\");\n }\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::DeleteIndices()\n{\n \/\/ Delete all the indices which were built by this object\n for (unsigned int i = 0; i < fEntries.size(); i++) {\n if (fEntries[i].fTreeIndex) {\n if (fTree->GetTree() && fTree->GetTree()->GetTreeIndex() == fEntries[i].fTreeIndex) {\n fTree->GetTree()->SetTreeIndex(0);\n SafeDelete(fEntries[i].fTreeIndex);\n }\n SafeDelete(fEntries[i].fTreeIndex);\n }\n }\n}\n\n\/\/______________________________________________________________________________\nTChainIndex::~TChainIndex()\n{\n \/\/ The destructor.\n DeleteIndices();\n if (fTree && fTree->GetTreeIndex() == this)\n fTree->SetTreeIndex(0);\n}\n\n\/\/______________________________________________________________________________\nstd::pair<TVirtualIndex*, Int_t> TChainIndex::GetSubTreeIndex(Int_t major, Int_t minor) const\n{\n \/\/ Returns a TVirtualIndex for a tree which holds the entry with the specified\n \/\/ major and minor values and the number of that tree.\n \/\/ If the index for that tree was created by this object it's set to the tree.\n \/\/ The tree index should be later released using ReleaseSubTreeIndex();\n\n using namespace std;\n if (fEntries.size() == 0) {\n Warning(\"GetSubTreeIndex\", \"No subindices in the chain. The chain is probably empty\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n\n Long64_t indexValue = (Long64_t(major) << 31) + minor;\n\n if (indexValue < fEntries[0].fMinIndexValue) {\n Warning(\"GetSubTreeIndex\", \"The index value is less than the smallest index values in subtrees\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n\n Int_t treeNo = fEntries.size() - 1;\n for (unsigned int i = 0; i < fEntries.size() - 1; i++) {\n if (indexValue < fEntries[i+1].fMinIndexValue) {\n treeNo = i;\n break;\n }\n }\n \/\/ Double check we found the right range.\n if (indexValue > fEntries[treeNo].fMaxIndexValue) {\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n chain->LoadTree(chain->GetTreeOffset()[treeNo]);\n TVirtualIndex* index = fTree->GetTree()->GetTreeIndex();\n if (index)\n return make_pair(static_cast<TVirtualIndex*>(index), treeNo);\n else {\n index = fEntries[treeNo].fTreeIndex;\n if (!index) {\n Warning(\"GetSubTreeIndex\", \"The tree has no index and the chain index\"\n \" doesn't store an index for that tree\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n else {\n fTree->GetTree()->SetTreeIndex(index);\n return make_pair(static_cast<TVirtualIndex*>(index), treeNo);\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::ReleaseSubTreeIndex(TVirtualIndex* index, int treeNo) const\n{\n \/\/ Releases the tree index got using GetSubTreeIndex. If the index was\n \/\/ created by this object it is removed from the current tree, so that it isn't\n \/\/ deleted in its destructor.\n\n if (fEntries[treeNo].fTreeIndex == index) {\n R__ASSERT(fTree->GetTree()->GetTreeIndex() == index);\n fTree->GetTree()->SetTreeIndex(0);\n }\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberFriend(const TTree *parent)\n{\n \/\/ see TTreeIndex::GetEntryNumberFriend for description\n\n if (!parent) return -3;\n GetMajorFormulaParent(parent);\n GetMinorFormulaParent(parent);\n if (!fMajorFormulaParent || !fMinorFormulaParent) return -1;\n if (!fMajorFormulaParent->GetNdim() || !fMinorFormulaParent->GetNdim()) {\n \/\/ The Tree Index in the friend has a pair majorname,minorname\n \/\/ not available in the parent Tree T.\n \/\/ if the friend Tree has less entries than the parent, this is an error\n Long64_t pentry = parent->GetReadEntry();\n if (pentry >= fTree->GetEntries()) return -2;\n \/\/ otherwise we ignore the Tree Index and return the entry number\n \/\/ in the parent Tree.\n return pentry;\n }\n\n \/\/ majorname, minorname exist in the parent Tree\n \/\/ we find the current values pair majorv,minorv in the parent Tree\n Double_t majord = fMajorFormulaParent->EvalInstance();\n Double_t minord = fMinorFormulaParent->EvalInstance();\n Long64_t majorv = (Long64_t)majord;\n Long64_t minorv = (Long64_t)minord;\n \/\/ we check if this pair exist in the index.\n \/\/ if yes, we return the corresponding entry number\n \/\/ if not the function returns -1\n return fTree->GetEntryNumberWithIndex(majorv,minorv);\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberWithBestIndex(Int_t major, Int_t minor) const\n{\n \/\/ See TTreeIndex::GetEntryNumberWithBestIndex for details.\n\n std::pair<TVirtualIndex*, Int_t> indexAndNumber = GetSubTreeIndex(major, minor);\n if (!indexAndNumber.first) {\n \/\/ Error(\"GetEntryNumberWithBestIndex\",\"no index found\");\n return -1;\n }\n else {\n Long64_t rv = indexAndNumber.first->GetEntryNumberWithBestIndex(major, minor);\n ReleaseSubTreeIndex(indexAndNumber.first, indexAndNumber.second);\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n return rv + chain->GetTreeOffset()[indexAndNumber.second];\n }\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberWithIndex(Int_t major, Int_t minor) const\n{\n \/\/ Returns the entry number with given index values.\n \/\/ See TTreeIndex::GetEntryNumberWithIndex for details.\n\n std::pair<TVirtualIndex*, Int_t> indexAndNumber = GetSubTreeIndex(major, minor);\n if (!indexAndNumber.first) {\n \/\/ Error(\"GetEntryNumberWithIndex\",\"no index found\");\n return -1;\n }\n else {\n Long64_t rv = indexAndNumber.first->GetEntryNumberWithIndex(major, minor);\n ReleaseSubTreeIndex(indexAndNumber.first, indexAndNumber.second);\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n if (rv > 0) {\n return rv + chain->GetTreeOffset()[indexAndNumber.second];\n } else {\n return rv;\n }\n }\n}\n\n\/\/______________________________________________________________________________\nTTreeFormula *TChainIndex::GetMajorFormulaParent(const TTree *parent)\n{\n \/\/ return a pointer to the TreeFormula corresponding to the majorname in parent tree T\n\n if (!fMajorFormulaParent) {\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n fMajorFormulaParent = new TTreeFormula(\"MajorP\",fMajorName.Data(),const_cast<TTree*>(parent));\n fMajorFormulaParent->SetQuickLoad(kTRUE);\n }\n if (fMajorFormulaParent->GetTree() != parent) {\n fMajorFormulaParent->SetTree(const_cast<TTree*>(parent));\n fMajorFormulaParent->UpdateFormulaLeaves();\n }\n return fMajorFormulaParent;\n}\n\n\/\/______________________________________________________________________________\nTTreeFormula *TChainIndex::GetMinorFormulaParent(const TTree *parent)\n{\n \/\/ return a pointer to the TreeFormula corresponding to the minorname in parent tree T\n\n if (!fMinorFormulaParent) {\n \/\/ Prevent TTreeFormula from finding any of the branches in our TTree even if it\n \/\/ is a friend of the parent TTree.\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n fMinorFormulaParent = new TTreeFormula(\"MinorP\",fMinorName.Data(),const_cast<TTree*>(parent));\n fMinorFormulaParent->SetQuickLoad(kTRUE);\n }\n if (fMinorFormulaParent->GetTree() != parent) {\n fMinorFormulaParent->SetTree(const_cast<TTree*>(parent));\n fMinorFormulaParent->UpdateFormulaLeaves();\n }\n\n return fMinorFormulaParent;\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::UpdateFormulaLeaves(const TTree *parent)\n{\n \/\/ Updates the parent formulae.\n \/\/ Called by TChain::LoadTree when the parent chain changes it's tree.\n if (fMajorFormulaParent) { \n \/\/ Prevent TTreeFormula from finding any of the branches in our TTree even if it\n \/\/ is a friend of the parent TTree.\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n if (parent) fMajorFormulaParent->SetTree((TTree*)parent);\n fMajorFormulaParent->UpdateFormulaLeaves();\n }\n if (fMinorFormulaParent) { \n if (parent) fMinorFormulaParent->SetTree((TTree*)parent);\n fMinorFormulaParent->UpdateFormulaLeaves();\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::SetTree(const TTree *T)\n{\n \/\/ See TTreeIndex::SetTree.\n\n R__ASSERT(fTree == 0 || fTree == T || T==0);\n}\n\n<commit_msg>Import revision 44719 from the trunk: Fix off by one error introduced in revision 43390 ; this fixes <http:\/\/savannah.cern.ch\/bugs\/?94910> (TChained Tree index returns wrong entry on GetEntryNumberWithIndex)<commit_after>\/\/ @(#)root\/tree:$Id$\n\/\/ Author: Marek Biskup 07\/06\/2005\n\n\/*************************************************************************\n * Copyright (C) 1995-2004, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ A Chain Index\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TChainIndex.h\"\n#include \"TChain.h\"\n#include \"TTreeFormula.h\"\n#include \"TTreeIndex.h\"\n#include \"TFile.h\"\n#include \"TError.h\"\n\nClassImp(TChainIndex)\n\n\/\/______________________________________________________________________________\nTChainIndex::TChainIndex(): TVirtualIndex()\n{\n\/\/ Default constructor for TChainIndex\n\n fTree = 0;\n fMajorFormulaParent = fMinorFormulaParent = 0;\n}\n\n\/\/______________________________________________________________________________\nTChainIndex::TChainIndex(const TTree *T, const char *majorname, const char *minorname)\n : TVirtualIndex()\n{\n \/\/ Normal constructor for TChainIndex. See TTreeIndex::TTreeIndex for the description of the\n \/\/ parameters.\n \/\/ The tree must be a TChain.\n \/\/ All the index values in the first tree of the chain must be\n \/\/ less then any index value in the second one, and so on.\n \/\/ If any of those requirements isn't met the object becomes a zombie.\n \/\/ If some subtrees don't have indices the indices are created and stored inside this\n \/\/ TChainIndex.\n\n fTree = 0;\n fMajorFormulaParent = fMinorFormulaParent = 0;\n\n TChain *chain = dynamic_cast<TChain*>(const_cast<TTree*>(T));\n if (!chain) {\n MakeZombie();\n Error(\"TChainIndex\", \"Cannot create a TChainIndex.\"\n \" The Tree passed as an argument is not a TChain\");\n return;\n }\n\n fTree = (TTree*)T;\n fMajorName = majorname;\n fMinorName = minorname;\n Int_t i = 0;\n\n \/\/ Go through all the trees and check if they have indeces. If not then build them.\n for (i = 0; i < chain->GetNtrees(); i++) {\n chain->LoadTree((chain->GetTreeOffset())[i]);\n TVirtualIndex *index = chain->GetTree()->GetTreeIndex();\n\n TChainIndexEntry entry;\n entry.fTreeIndex = 0;\n\n \/\/if an index already exists, we must check if major\/minorname correspond\n \/\/to the major\/minor names in this function call\n if (index) {\n if (strcmp(majorname,index->GetMajorName()) || strcmp(minorname,index->GetMinorName())) {\n MakeZombie();\n Error(\"TChainIndex\",\"Tree in file %s has an index built with majorname=%s and minorname=%s\",chain->GetTree()->GetCurrentFile()->GetName(),index->GetMajorName(),index->GetMinorName());\n return;\n }\n }\n if (!index) {\n chain->GetTree()->BuildIndex(majorname, minorname);\n index = chain->GetTree()->GetTreeIndex();\n chain->GetTree()->SetTreeIndex(0);\n entry.fTreeIndex = index;\n }\n if (!index || index->IsZombie() || index->GetN() == 0) {\n DeleteIndices();\n MakeZombie();\n Error(\"TChainIndex\", \"Error creating a tree index on a tree in the chain\");\n return;\n }\n\n TTreeIndex *ti_index = dynamic_cast<TTreeIndex*>(index);\n if (ti_index == 0) {\n Error(\"TChainIndex\", \"The underlying TTree must have a TTreeIndex but has a %s.\",\n index->IsA()->GetName());\n return;\n }\n\n entry.fMinIndexValue = ti_index->GetIndexValues()[0];\n entry.fMaxIndexValue = ti_index->GetIndexValues()[index->GetN() - 1];\n fEntries.push_back(entry);\n }\n\n \/\/ Check if the indices of different trees are in order. If not then return an error.\n for (i = 0; i < Int_t(fEntries.size() - 1); i++) {\n if (fEntries[i].fMaxIndexValue > fEntries[i+1].fMinIndexValue) {\n DeleteIndices();\n MakeZombie();\n Error(\"TChainIndex\", \"The indices in files of this chain aren't sorted.\");\n }\n }\n\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::Append(const TVirtualIndex *index, Bool_t delaySort )\n{\n \/\/ add an index to this chain\n \/\/ if delaySort is kFALSE (default) check if the indices of different trees are in order.\n if (index) {\n const TTreeIndex *ti_index = dynamic_cast<const TTreeIndex*>(index);\n if (ti_index == 0) {\n Error(\"Append\", \"The given index is not a TTreeIndex but a %s\",\n index->IsA()->GetName());\n }\n \n TChainIndexEntry entry;\n entry.fTreeIndex = 0;\n entry.fMinIndexValue = ti_index->GetIndexValues()[0];\n entry.fMaxIndexValue = ti_index->GetIndexValues()[index->GetN() - 1];\n fEntries.push_back(entry);\n }\n \n if (!delaySort) {\n \/\/ Check if the indices of different trees are in order. If not then return an error.\n for (Int_t i = 0; i < Int_t(fEntries.size() - 1); i++) {\n if (fEntries[i].fMaxIndexValue > fEntries[i+1].fMinIndexValue) {\n DeleteIndices();\n MakeZombie();\n Error(\"Append\", \"The indices in files of this chain aren't sorted.\");\n }\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::DeleteIndices()\n{\n \/\/ Delete all the indices which were built by this object\n for (unsigned int i = 0; i < fEntries.size(); i++) {\n if (fEntries[i].fTreeIndex) {\n if (fTree->GetTree() && fTree->GetTree()->GetTreeIndex() == fEntries[i].fTreeIndex) {\n fTree->GetTree()->SetTreeIndex(0);\n SafeDelete(fEntries[i].fTreeIndex);\n }\n SafeDelete(fEntries[i].fTreeIndex);\n }\n }\n}\n\n\/\/______________________________________________________________________________\nTChainIndex::~TChainIndex()\n{\n \/\/ The destructor.\n DeleteIndices();\n if (fTree && fTree->GetTreeIndex() == this)\n fTree->SetTreeIndex(0);\n}\n\n\/\/______________________________________________________________________________\nstd::pair<TVirtualIndex*, Int_t> TChainIndex::GetSubTreeIndex(Int_t major, Int_t minor) const\n{\n \/\/ Returns a TVirtualIndex for a tree which holds the entry with the specified\n \/\/ major and minor values and the number of that tree.\n \/\/ If the index for that tree was created by this object it's set to the tree.\n \/\/ The tree index should be later released using ReleaseSubTreeIndex();\n\n using namespace std;\n if (fEntries.size() == 0) {\n Warning(\"GetSubTreeIndex\", \"No subindices in the chain. The chain is probably empty\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n\n Long64_t indexValue = (Long64_t(major) << 31) + minor;\n\n if (indexValue < fEntries[0].fMinIndexValue) {\n Warning(\"GetSubTreeIndex\", \"The index value is less than the smallest index values in subtrees\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n\n Int_t treeNo = fEntries.size() - 1;\n for (unsigned int i = 0; i < fEntries.size() - 1; i++) {\n if (indexValue < fEntries[i+1].fMinIndexValue) {\n treeNo = i;\n break;\n }\n }\n \/\/ Double check we found the right range.\n if (indexValue > fEntries[treeNo].fMaxIndexValue) {\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n chain->LoadTree(chain->GetTreeOffset()[treeNo]);\n TVirtualIndex* index = fTree->GetTree()->GetTreeIndex();\n if (index)\n return make_pair(static_cast<TVirtualIndex*>(index), treeNo);\n else {\n index = fEntries[treeNo].fTreeIndex;\n if (!index) {\n Warning(\"GetSubTreeIndex\", \"The tree has no index and the chain index\"\n \" doesn't store an index for that tree\");\n return make_pair(static_cast<TVirtualIndex*>(0), 0);\n }\n else {\n fTree->GetTree()->SetTreeIndex(index);\n return make_pair(static_cast<TVirtualIndex*>(index), treeNo);\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::ReleaseSubTreeIndex(TVirtualIndex* index, int treeNo) const\n{\n \/\/ Releases the tree index got using GetSubTreeIndex. If the index was\n \/\/ created by this object it is removed from the current tree, so that it isn't\n \/\/ deleted in its destructor.\n\n if (fEntries[treeNo].fTreeIndex == index) {\n R__ASSERT(fTree->GetTree()->GetTreeIndex() == index);\n fTree->GetTree()->SetTreeIndex(0);\n }\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberFriend(const TTree *parent)\n{\n \/\/ see TTreeIndex::GetEntryNumberFriend for description\n\n if (!parent) return -3;\n GetMajorFormulaParent(parent);\n GetMinorFormulaParent(parent);\n if (!fMajorFormulaParent || !fMinorFormulaParent) return -1;\n if (!fMajorFormulaParent->GetNdim() || !fMinorFormulaParent->GetNdim()) {\n \/\/ The Tree Index in the friend has a pair majorname,minorname\n \/\/ not available in the parent Tree T.\n \/\/ if the friend Tree has less entries than the parent, this is an error\n Long64_t pentry = parent->GetReadEntry();\n if (pentry >= fTree->GetEntries()) return -2;\n \/\/ otherwise we ignore the Tree Index and return the entry number\n \/\/ in the parent Tree.\n return pentry;\n }\n\n \/\/ majorname, minorname exist in the parent Tree\n \/\/ we find the current values pair majorv,minorv in the parent Tree\n Double_t majord = fMajorFormulaParent->EvalInstance();\n Double_t minord = fMinorFormulaParent->EvalInstance();\n Long64_t majorv = (Long64_t)majord;\n Long64_t minorv = (Long64_t)minord;\n \/\/ we check if this pair exist in the index.\n \/\/ if yes, we return the corresponding entry number\n \/\/ if not the function returns -1\n return fTree->GetEntryNumberWithIndex(majorv,minorv);\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberWithBestIndex(Int_t major, Int_t minor) const\n{\n \/\/ See TTreeIndex::GetEntryNumberWithBestIndex for details.\n\n std::pair<TVirtualIndex*, Int_t> indexAndNumber = GetSubTreeIndex(major, minor);\n if (!indexAndNumber.first) {\n \/\/ Error(\"GetEntryNumberWithBestIndex\",\"no index found\");\n return -1;\n }\n else {\n Long64_t rv = indexAndNumber.first->GetEntryNumberWithBestIndex(major, minor);\n ReleaseSubTreeIndex(indexAndNumber.first, indexAndNumber.second);\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n return rv + chain->GetTreeOffset()[indexAndNumber.second];\n }\n}\n\n\/\/______________________________________________________________________________\nLong64_t TChainIndex::GetEntryNumberWithIndex(Int_t major, Int_t minor) const\n{\n \/\/ Returns the entry number with given index values.\n \/\/ See TTreeIndex::GetEntryNumberWithIndex for details.\n\n std::pair<TVirtualIndex*, Int_t> indexAndNumber = GetSubTreeIndex(major, minor);\n if (!indexAndNumber.first) {\n \/\/ Error(\"GetEntryNumberWithIndex\",\"no index found\");\n return -1;\n }\n else {\n Long64_t rv = indexAndNumber.first->GetEntryNumberWithIndex(major, minor);\n ReleaseSubTreeIndex(indexAndNumber.first, indexAndNumber.second);\n TChain* chain = dynamic_cast<TChain*> (fTree);\n R__ASSERT(chain);\n if (rv >= 0) {\n return rv + chain->GetTreeOffset()[indexAndNumber.second];\n } else {\n return rv;\n }\n }\n}\n\n\/\/______________________________________________________________________________\nTTreeFormula *TChainIndex::GetMajorFormulaParent(const TTree *parent)\n{\n \/\/ return a pointer to the TreeFormula corresponding to the majorname in parent tree T\n\n if (!fMajorFormulaParent) {\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n fMajorFormulaParent = new TTreeFormula(\"MajorP\",fMajorName.Data(),const_cast<TTree*>(parent));\n fMajorFormulaParent->SetQuickLoad(kTRUE);\n }\n if (fMajorFormulaParent->GetTree() != parent) {\n fMajorFormulaParent->SetTree(const_cast<TTree*>(parent));\n fMajorFormulaParent->UpdateFormulaLeaves();\n }\n return fMajorFormulaParent;\n}\n\n\/\/______________________________________________________________________________\nTTreeFormula *TChainIndex::GetMinorFormulaParent(const TTree *parent)\n{\n \/\/ return a pointer to the TreeFormula corresponding to the minorname in parent tree T\n\n if (!fMinorFormulaParent) {\n \/\/ Prevent TTreeFormula from finding any of the branches in our TTree even if it\n \/\/ is a friend of the parent TTree.\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n fMinorFormulaParent = new TTreeFormula(\"MinorP\",fMinorName.Data(),const_cast<TTree*>(parent));\n fMinorFormulaParent->SetQuickLoad(kTRUE);\n }\n if (fMinorFormulaParent->GetTree() != parent) {\n fMinorFormulaParent->SetTree(const_cast<TTree*>(parent));\n fMinorFormulaParent->UpdateFormulaLeaves();\n }\n\n return fMinorFormulaParent;\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::UpdateFormulaLeaves(const TTree *parent)\n{\n \/\/ Updates the parent formulae.\n \/\/ Called by TChain::LoadTree when the parent chain changes it's tree.\n if (fMajorFormulaParent) { \n \/\/ Prevent TTreeFormula from finding any of the branches in our TTree even if it\n \/\/ is a friend of the parent TTree.\n TTree::TFriendLock friendlock(fTree, TTree::kFindLeaf | TTree::kFindBranch | TTree::kGetBranch | TTree::kGetLeaf);\n if (parent) fMajorFormulaParent->SetTree((TTree*)parent);\n fMajorFormulaParent->UpdateFormulaLeaves();\n }\n if (fMinorFormulaParent) { \n if (parent) fMinorFormulaParent->SetTree((TTree*)parent);\n fMinorFormulaParent->UpdateFormulaLeaves();\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TChainIndex::SetTree(const TTree *T)\n{\n \/\/ See TTreeIndex::SetTree.\n\n R__ASSERT(fTree == 0 || fTree == T || T==0);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: ORFEO Toolbox\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\n\nCopyright (c) Centre National d'Etudes Spatiales. All rights reserved.\nSee OTBCopyright.txt for details.\n\n\nThis software is distributed WITHOUT ANY WARRANTY; without even \nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbMorphologicalOpeningProfileFilter.h\"\n#include \"itkBinaryBallStructuringElement.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImage.h\"\n\n#include \"itkMacro.h\"\n\nint otbMorphologicalOpeningProfileFilter(int argc, char * argv[])\n{\n const char * inputFilename = argv[1];\n const char * outputFilenamePrefix = argv[2];\n const char * outputFilenameSuffix = argv[3];\n const unsigned int profileSize = atoi(argv[4]);\n const unsigned int initialValue = atoi(argv[5]);\n const unsigned int step = atoi(argv[5]);\n \n\n const unsigned int Dimension = 2;\n typedef double InputPixelType;\n typedef double OutputPixelType;\n\n typedef otb::Image<InputPixelType,Dimension> InputImageType;\n typedef otb::Image<OutputPixelType,Dimension> OutputImageType;\n\n typedef otb::ImageFileReader<InputImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<OutputImageType> WriterType;\n\n typedef itk::BinaryBallStructuringElement<InputPixelType,Dimension> StructuringElementType;\n typedef otb::MorphologicalOpeningProfileFilter<InputImageType,InputImageType,StructuringElementType>\n OpeningProfileFilterType;\n \n \/\/ Reading input image\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFilename);\n\n \/\/ Instantiation\n OpeningProfileFilterType::Pointer profileFilter = OpeningProfileFilterType::New();\n profileFilter->SetInput(reader->GetOutput());\n profileFilter->SetProfileSize(profileSize);\n profileFilter->SetInitialValue(initialValue);\n profileFilter->SetStep(step);\n profileFilter->Update();\n\n WriterType::Pointer writer;\n\n \/\/ std::stringstream oss;\n itk::OStringStream oss;\n \/\/ Writing the results images\n for(unsigned int i = 1;i<=profileSize;++i)\n {\n writer = WriterType::New();\n oss<<outputFilenamePrefix<<i<<\".\"<<outputFilenameSuffix;\n writer->SetInput(profileFilter->GetOutput()->GetNthElement(i-1));\n writer->SetFileName(oss.str().c_str());\t \n writer->Update();\n oss.str(\"\");\n }\n\n return EXIT_SUCCESS;\n}\n<commit_msg>Correction de l'argument 6<commit_after>\/*=========================================================================\n\nProgram: ORFEO Toolbox\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\n\nCopyright (c) Centre National d'Etudes Spatiales. All rights reserved.\nSee OTBCopyright.txt for details.\n\n\nThis software is distributed WITHOUT ANY WARRANTY; without even \nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbMorphologicalOpeningProfileFilter.h\"\n#include \"itkBinaryBallStructuringElement.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImage.h\"\n\n#include \"itkMacro.h\"\n\nint otbMorphologicalOpeningProfileFilter(int argc, char * argv[])\n{\n const char * inputFilename = argv[1];\n const char * outputFilenamePrefix = argv[2];\n const char * outputFilenameSuffix = argv[3];\n const unsigned int profileSize = atoi(argv[4]);\n const unsigned int initialValue = atoi(argv[5]);\n const unsigned int step = atoi(argv[6]);\n \n\n const unsigned int Dimension = 2;\n typedef double InputPixelType;\n typedef double OutputPixelType;\n\n typedef otb::Image<InputPixelType,Dimension> InputImageType;\n typedef otb::Image<OutputPixelType,Dimension> OutputImageType;\n\n typedef otb::ImageFileReader<InputImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<OutputImageType> WriterType;\n\n typedef itk::BinaryBallStructuringElement<InputPixelType,Dimension> StructuringElementType;\n typedef otb::MorphologicalOpeningProfileFilter<InputImageType,InputImageType,StructuringElementType>\n OpeningProfileFilterType;\n \n \/\/ Reading input image\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFilename);\n\n \/\/ Instantiation\n OpeningProfileFilterType::Pointer profileFilter = OpeningProfileFilterType::New();\n profileFilter->SetInput(reader->GetOutput());\n profileFilter->SetProfileSize(profileSize);\n profileFilter->SetInitialValue(initialValue);\n profileFilter->SetStep(step);\n profileFilter->Update();\n\n WriterType::Pointer writer;\n\n \/\/ std::stringstream oss;\n itk::OStringStream oss;\n \/\/ Writing the results images\n for(unsigned int i = 1;i<=profileSize;++i)\n {\n writer = WriterType::New();\n oss<<outputFilenamePrefix<<i<<\".\"<<outputFilenameSuffix;\n writer->SetInput(profileFilter->GetOutput()->GetNthElement(i-1));\n writer->SetFileName(oss.str().c_str());\t \n writer->Update();\n oss.str(\"\");\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n#define __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <string>\n\/\/ StdAir\n#include <stdair\/command\/CmdAbstract.hpp>\n\/\/ Airinv\n#include <airinv\/AIRINV_Types.hpp>\n#define BOOST_SPIRIT_DEBUG\n#include <airinv\/basic\/BasParserTypes.hpp>\n#include <airinv\/bom\/FlightDateStruct.hpp>\n\n\/\/ Forward declarations\nnamespace stdair {\n class BomRoot;\n}\n\nnamespace AIRINV {\n\n namespace InventoryParserHelper {\n \n \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Semantic actions\n \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/** Generic Semantic Action (Actor \/ Functor) for the Inventory Parser. *\/\n struct ParserSemanticAction {\n \/** Actor Constructor. *\/\n ParserSemanticAction (FlightDateStruct_T&);\n \/** Actor Context. *\/\n FlightDateStruct_T& _flightDate;\n };\n \n \/** Store the snapshot date. *\/\n struct storeSnapshotDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSnapshotDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed airline code. *\/\n struct storeAirlineCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeAirlineCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed flight number. *\/\n struct storeFlightNumber : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightNumber (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the flight date. *\/\n struct storeFlightDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the flight type code. *\/\n struct storeFlightTypeCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightTypeCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed leg boarding point. *\/\n struct storeLegBoardingPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegBoardingPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed leg off point. *\/\n struct storeLegOffPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegOffPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the boarding date. *\/\n struct storeBoardingDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBoardingDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the boarding time. *\/\n struct storeBoardingTime : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBoardingTime (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the off date. *\/\n struct storeOffDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOffDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the off time. *\/\n struct storeOffTime : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOffTime (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed leg cabin code. *\/\n struct storeLegCabinCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegCabinCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed saleable capacity. *\/\n struct storeSaleableCapacity : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSaleableCapacity (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Authorisation Level (AU). *\/\n struct storeAU : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeAU (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Unsold Protected (UPR). *\/\n struct storeUPR : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeUPR (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed booking counter. *\/\n struct storeBookingCounter : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBookingCounter (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Net Availability (NAV). *\/\n struct storeNAV : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNAV (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Gross Availability (GAV). *\/\n struct storeGAV : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeGAV (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Average Cancellation Percentage (ACP). *\/\n struct storeACP : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeACP (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Expected To Board (ETB) number. *\/\n struct storeETB : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeETB (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed Yield Upper Range value. *\/\n struct storeYieldUpperRange : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeYieldUpperRange (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed bucket availability. *\/\n struct storeBucketAvaibality : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBucketAvaibality (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed leg-cabin seat index. *\/\n struct storeSeatIndex : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSeatIndex (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed segment boarding point. *\/\n struct storeSegmentBoardingPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentBoardingPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed segment off point. *\/\n struct storeSegmentOffPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentOffPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed segment cabin code. *\/\n struct storeSegmentCabinCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentCabinCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed segment cabin number of bookings. *\/\n struct storeSegmentCabinBookingCounter : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentCabinBookingCounter (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed booking class code. *\/\n struct storeClassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeClassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed sub-class code. *\/\n struct storeSubclassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSubclassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the parsed class code of the parent sub-class. *\/\n struct storeParentClassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeParentClassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed sub-class code of the parent sub-class. *\/\n struct storeParentSubclassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeParentSubclassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the parsed cumulated protection (at booking class level). *\/\n struct storeCumulatedProtection : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeCumulatedProtection (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed protection (at booking class level). *\/\n struct storeProtection : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeProtection (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the negotiated allotment (at booking class level). *\/\n struct storeNego : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNego (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed No-Show percentage (at booking class level). *\/\n struct storeNoShow : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNoShow (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed Overbooking percentage (at booking class level). *\/\n struct storeOverbooking : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOverbooking (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed list of class codes. *\/\n struct storeClasses : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeClasses (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Mark the end of the inventory parsing. *\/\n struct doEndFlightDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n doEndFlightDate (stdair::BomRoot&, FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n \/** Actor Specific Context. *\/\n stdair::BomRoot& _bomRoot;\n };\n \n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\n \/\/ (Boost Spirit) Grammar Definition\n \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/**\n FlightDepDate;\n 2010-02-08; SIN; BKK; L; 10.0; 1.0;\n\n Grammar:\n FlightDate ::= FlightDepDate ';' Origin ';' Destination\n EndOfFlightDate\n FlightDepDate ::= date\n EndOfFlightDate ::= ';'\n *\/\n\n \/** Grammar for the inventory parser. *\/\n struct InventoryParser : \n public boost::spirit::classic::grammar<InventoryParser> {\n\n InventoryParser (stdair::BomRoot&, FlightDateStruct_T&);\n\n template <typename ScannerT>\n struct definition {\n definition (InventoryParser const& self);\n \n \/\/ Instantiation of rules\n boost::spirit::classic::rule<ScannerT> flight_date_list, flight_date,\n flight_date_end, flight_key, airline_code, flight_number,\n flight_type_code, date, leg_list, leg, leg_key, leg_details,\n full_leg_cabin_details, leg_cabin_details,\n bucket_list, bucket_details,\n time, segment_list, segment, segment_key, full_segment_cabin_details,\n segment_cabin_list, segment_cabin_key, segment_cabin_details,\n class_list, class_key, parent_subclass_code, class_protection, class_nego,\n class_details;\n\n \/** Entry point of the parser. *\/\n boost::spirit::classic::rule<ScannerT> const& start() const;\n };\n\n \/\/ Parser Context\n stdair::BomRoot& _bomRoot;\n FlightDateStruct_T& _flightDate;\n };\n\n }\n\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\n \/\/ Entry class for the file parser\n \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/** Class wrapping the initialisation and entry point of the parser.\n <br>The seemingly redundancy is used to force the instantiation of\n the actual parser, which is a templatised Boost Spirit grammar.\n Hence, the actual parser is instantiated within that class object\n code. *\/\n class InventoryFileParser : public stdair::CmdAbstract {\n public:\n \/** Constructor. *\/\n InventoryFileParser (stdair::BomRoot&,\n const stdair::Filename_T& iInventoryInputFilename);\n\n \/** Parse the inventory input file. *\/\n bool generateInventory ();\n \n private:\n \/** Initialise. *\/\n void init();\n \n private:\n \/\/ Attributes\n \/** File-name of the CSV-formatted inventory input file. *\/\n stdair::Filename_T _filename;\n\n \/** Start iterator for the parser. *\/\n iterator_t _startIterator;\n \n \/** End iterator for the parser. *\/\n iterator_t _endIterator;\n \n \/** Root of the BOM tree. *\/\n stdair::BomRoot& _bomRoot;\n\n \/** FlightDate Structure. *\/\n FlightDateStruct_T _flightDate;\n };\n \n}\n#endif \/\/ __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n<commit_msg>[Parser] The inventory dumps have a new subclass-related field.<commit_after>#ifndef __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n#define __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Import section\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ STL\n#include <string>\n\/\/ StdAir\n#include <stdair\/command\/CmdAbstract.hpp>\n\/\/ Airinv\n#include <airinv\/AIRINV_Types.hpp>\n\/\/#define BOOST_SPIRIT_DEBUG\n#include <airinv\/basic\/BasParserTypes.hpp>\n#include <airinv\/bom\/FlightDateStruct.hpp>\n\n\/\/ Forward declarations\nnamespace stdair {\n class BomRoot;\n}\n\nnamespace AIRINV {\n\n namespace InventoryParserHelper {\n \n \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ Semantic actions\n \/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/** Generic Semantic Action (Actor \/ Functor) for the Inventory Parser. *\/\n struct ParserSemanticAction {\n \/** Actor Constructor. *\/\n ParserSemanticAction (FlightDateStruct_T&);\n \/** Actor Context. *\/\n FlightDateStruct_T& _flightDate;\n };\n \n \/** Store the snapshot date. *\/\n struct storeSnapshotDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSnapshotDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed airline code. *\/\n struct storeAirlineCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeAirlineCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed flight number. *\/\n struct storeFlightNumber : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightNumber (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the flight date. *\/\n struct storeFlightDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the flight type code. *\/\n struct storeFlightTypeCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeFlightTypeCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed leg boarding point. *\/\n struct storeLegBoardingPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegBoardingPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed leg off point. *\/\n struct storeLegOffPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegOffPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the boarding date. *\/\n struct storeBoardingDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBoardingDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the boarding time. *\/\n struct storeBoardingTime : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBoardingTime (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the off date. *\/\n struct storeOffDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOffDate (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the off time. *\/\n struct storeOffTime : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOffTime (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed leg cabin code. *\/\n struct storeLegCabinCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeLegCabinCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed saleable capacity. *\/\n struct storeSaleableCapacity : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSaleableCapacity (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Authorisation Level (AU). *\/\n struct storeAU : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeAU (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Unsold Protected (UPR). *\/\n struct storeUPR : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeUPR (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed booking counter. *\/\n struct storeBookingCounter : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBookingCounter (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Net Availability (NAV). *\/\n struct storeNAV : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNAV (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Gross Availability (GAV). *\/\n struct storeGAV : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeGAV (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Average Cancellation Percentage (ACP). *\/\n struct storeACP : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeACP (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed Expected To Board (ETB) number. *\/\n struct storeETB : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeETB (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed Yield Upper Range value. *\/\n struct storeYieldUpperRange : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeYieldUpperRange (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed bucket availability. *\/\n struct storeBucketAvaibality : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeBucketAvaibality (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed leg-cabin seat index. *\/\n struct storeSeatIndex : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSeatIndex (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n \n \/** Store the parsed segment boarding point. *\/\n struct storeSegmentBoardingPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentBoardingPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n \n \/** Store the parsed segment off point. *\/\n struct storeSegmentOffPoint : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentOffPoint (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Store the parsed segment cabin code. *\/\n struct storeSegmentCabinCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentCabinCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed segment cabin number of bookings. *\/\n struct storeSegmentCabinBookingCounter : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSegmentCabinBookingCounter (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed booking class code. *\/\n struct storeClassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeClassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed sub-class code. *\/\n struct storeSubclassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeSubclassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the parsed class code of the parent sub-class. *\/\n struct storeParentClassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeParentClassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (char iChar) const;\n };\n \n \/** Store the parsed sub-class code of the parent sub-class. *\/\n struct storeParentSubclassCode : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeParentSubclassCode (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (unsigned int iNumber) const;\n };\n \n \/** Store the parsed cumulated protection (at booking class level). *\/\n struct storeCumulatedProtection : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeCumulatedProtection (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed protection (at booking class level). *\/\n struct storeProtection : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeProtection (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the negotiated allotment (at booking class level). *\/\n struct storeNego : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNego (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed No-Show percentage (at booking class level). *\/\n struct storeNoShow : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeNoShow (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed Overbooking percentage (at booking class level). *\/\n struct storeOverbooking : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeOverbooking (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (double iReal) const;\n };\n\n \/** Store the parsed list of class codes. *\/\n struct storeClasses : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n storeClasses (FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n };\n\n \/** Mark the end of the inventory parsing. *\/\n struct doEndFlightDate : public ParserSemanticAction {\n \/** Actor Constructor. *\/\n doEndFlightDate (stdair::BomRoot&, FlightDateStruct_T&);\n \/** Actor Function (functor). *\/\n void operator() (iterator_t iStr, iterator_t iStrEnd) const;\n \/** Actor Specific Context. *\/\n stdair::BomRoot& _bomRoot;\n };\n \n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\n \/\/ (Boost Spirit) Grammar Definition\n \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/**\n FlightDepDate;\n 2010-02-08; SIN; BKK; L; 10.0; 1.0;\n\n Grammar:\n FlightDate ::= FlightDepDate ';' Origin ';' Destination\n EndOfFlightDate\n FlightDepDate ::= date\n EndOfFlightDate ::= ';'\n *\/\n\n \/** Grammar for the inventory parser. *\/\n struct InventoryParser : \n public boost::spirit::classic::grammar<InventoryParser> {\n\n InventoryParser (stdair::BomRoot&, FlightDateStruct_T&);\n\n template <typename ScannerT>\n struct definition {\n definition (InventoryParser const& self);\n \n \/\/ Instantiation of rules\n boost::spirit::classic::rule<ScannerT> flight_date_list, flight_date,\n flight_date_end, flight_key, airline_code, flight_number,\n flight_type_code, date, leg_list, leg, leg_key, leg_details,\n full_leg_cabin_details, leg_cabin_details,\n bucket_list, bucket_details,\n time, segment_list, segment, segment_key, full_segment_cabin_details,\n segment_cabin_list, segment_cabin_key, segment_cabin_details,\n class_list, class_key, parent_subclass_code, class_protection, class_nego,\n class_details;\n\n \/** Entry point of the parser. *\/\n boost::spirit::classic::rule<ScannerT> const& start() const;\n };\n\n \/\/ Parser Context\n stdair::BomRoot& _bomRoot;\n FlightDateStruct_T& _flightDate;\n };\n\n }\n\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/\n \/\/ Entry class for the file parser\n \/\/\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/** Class wrapping the initialisation and entry point of the parser.\n <br>The seemingly redundancy is used to force the instantiation of\n the actual parser, which is a templatised Boost Spirit grammar.\n Hence, the actual parser is instantiated within that class object\n code. *\/\n class InventoryFileParser : public stdair::CmdAbstract {\n public:\n \/** Constructor. *\/\n InventoryFileParser (stdair::BomRoot&,\n const stdair::Filename_T& iInventoryInputFilename);\n\n \/** Parse the inventory input file. *\/\n bool generateInventory ();\n \n private:\n \/** Initialise. *\/\n void init();\n \n private:\n \/\/ Attributes\n \/** File-name of the CSV-formatted inventory input file. *\/\n stdair::Filename_T _filename;\n\n \/** Start iterator for the parser. *\/\n iterator_t _startIterator;\n \n \/** End iterator for the parser. *\/\n iterator_t _endIterator;\n \n \/** Root of the BOM tree. *\/\n stdair::BomRoot& _bomRoot;\n\n \/** FlightDate Structure. *\/\n FlightDateStruct_T _flightDate;\n };\n \n}\n#endif \/\/ __AIRINV_CMD_INVENTORYPARSERHELPER_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of Akregator.\n\n Copyright (C) 2005 Frank Osterfeld <osterfeld@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include \"storagefactoryregistry.h\"\n#include \"storagefactory.h\"\n\n#include <k3staticdeleter.h>\n\n#include <QHash>\n#include <QString>\n#include <QStringList>\n\nnamespace Akregator {\nnamespace Backend {\n\nclass StorageFactoryRegistry::StorageFactoryRegistryPrivate\n{\n public:\n QHash<QString, StorageFactory*> map;\n};\n\nStorageFactoryRegistry* StorageFactoryRegistry::m_instance = 0;\nstatic K3StaticDeleter<StorageFactoryRegistry> storagefactoryregistrysd;\n\nStorageFactoryRegistry* StorageFactoryRegistry::self()\n{\n if (!m_instance)\n m_instance = storagefactoryregistrysd.setObject(m_instance, new StorageFactoryRegistry);\n return m_instance;\n}\n\t\nbool StorageFactoryRegistry::registerFactory(StorageFactory* factory, const QString& typestr)\n{\n if (containsFactory(typestr))\n return false;\n d->map[typestr] = factory;\n return true; \n}\n\nvoid StorageFactoryRegistry::unregisterFactory(const QString& typestr)\n{\n d->map.remove(typestr);\n}\n\nStorageFactory* StorageFactoryRegistry::getFactory(const QString& typestr)\n{\n return d->map[typestr];\n}\n\nbool StorageFactoryRegistry::containsFactory(const QString& typestr) const\n{\n return d->map.contains(typestr);\n}\n\nQStringList StorageFactoryRegistry::list() const\n{\n return d->map.keys();\n}\n\nStorageFactoryRegistry::StorageFactoryRegistry() : d(new StorageFactoryRegistryPrivate)\n{\n}\n\nStorageFactoryRegistry::~StorageFactoryRegistry()\n{\n delete d; \n d = 0;\n}\n\n} \/\/ namespace Backend\n} \/\/ namespace Akregator\n<commit_msg>Fix memleak. Delete all registered factories when destroying the factory.<commit_after>\/*\n This file is part of Akregator.\n\n Copyright (C) 2005 Frank Osterfeld <osterfeld@kde.org>\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n\n As a special exception, permission is given to link this program\n with any edition of Qt, and distribute the resulting executable,\n without including the source code for Qt in the source distribution.\n*\/\n\n#include \"storagefactoryregistry.h\"\n#include \"storagefactory.h\"\n\n#include <k3staticdeleter.h>\n\n#include <QHash>\n#include <QString>\n#include <QStringList>\n\nnamespace Akregator {\nnamespace Backend {\n\nclass StorageFactoryRegistry::StorageFactoryRegistryPrivate\n{\n public:\n QHash<QString, StorageFactory*> map;\n};\n\nStorageFactoryRegistry* StorageFactoryRegistry::m_instance = 0;\nstatic K3StaticDeleter<StorageFactoryRegistry> storagefactoryregistrysd;\n\nStorageFactoryRegistry* StorageFactoryRegistry::self()\n{\n if (!m_instance)\n m_instance = storagefactoryregistrysd.setObject(m_instance, new StorageFactoryRegistry);\n return m_instance;\n}\n\t\nbool StorageFactoryRegistry::registerFactory(StorageFactory* factory, const QString& typestr)\n{\n if (containsFactory(typestr))\n return false;\n d->map[typestr] = factory;\n return true; \n}\n\nvoid StorageFactoryRegistry::unregisterFactory(const QString& typestr)\n{\n d->map.remove(typestr);\n}\n\nStorageFactory* StorageFactoryRegistry::getFactory(const QString& typestr)\n{\n return d->map[typestr];\n}\n\nbool StorageFactoryRegistry::containsFactory(const QString& typestr) const\n{\n return d->map.contains(typestr);\n}\n\nQStringList StorageFactoryRegistry::list() const\n{\n return d->map.keys();\n}\n\nStorageFactoryRegistry::StorageFactoryRegistry() : d(new StorageFactoryRegistryPrivate)\n{\n}\n\nStorageFactoryRegistry::~StorageFactoryRegistry()\n{\n qDeleteAll(d->map);\n delete d; \n d = 0;\n}\n\n} \/\/ namespace Backend\n} \/\/ namespace Akregator\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"bstbuseditor.hh\"\n#include \"bstparam.hh\"\n#include \"bstitemseqdialog.hh\" \/\/ FIXME\n#include \"bstsnifferscope.hh\" \/\/ FIXME\n#include \"bse\/internal.hh\"\n\n\/* --- prototypes --- *\/\nstatic void bus_editor_action_exec (gpointer data,\n size_t action);\nstatic gboolean bus_editor_action_check (gpointer data,\n size_t action,\n guint64 action_stamp);\n\n\/* --- bus actions --- *\/\nenum {\n ACTION_ADD_BUS,\n ACTION_DELETE_BUS,\n ACTION_EDIT_BUS\n};\nstatic const GxkStockAction bus_editor_actions[] = {\n { N_(\"Add\"), NULL, NULL, ACTION_ADD_BUS, BST_STOCK_PART },\n { N_(\"Delete\"), NULL, NULL, ACTION_DELETE_BUS, BST_STOCK_TRASHCAN },\n { N_(\"Editor\"), NULL, NULL, ACTION_EDIT_BUS, BST_STOCK_PART_EDITOR },\n};\n\n\n\/* --- functions --- *\/\nG_DEFINE_TYPE (BstBusEditor, bst_bus_editor, GTK_TYPE_ALIGNMENT);\n\nstatic void\nbst_bus_editor_init (BstBusEditor *self)\n{\n new (&self->source) Bse::SourceS();\n new (&self->lmonitor) Bse::SignalMonitorS();\n new (&self->rmonitor) Bse::SignalMonitorS();\n self->mon_handler = 0;\n \/* complete GUI *\/\n gxk_radget_complete (GTK_WIDGET (self), \"beast\", \"bus-editor\", NULL);\n \/* create tool actions *\/\n gxk_widget_publish_actions (self, \"bus-editor-actions\",\n G_N_ELEMENTS (bus_editor_actions), bus_editor_actions,\n NULL, bus_editor_action_check, bus_editor_action_exec);\n}\n\nstatic void\nbst_bus_editor_destroy (GtkObject *object)\n{\n BstBusEditor *self = BST_BUS_EDITOR (object);\n bst_bus_editor_set_bus (self, 0);\n GTK_OBJECT_CLASS (bst_bus_editor_parent_class)->destroy (object);\n}\n\nstatic void\nbst_bus_editor_finalize (GObject *object)\n{\n BstBusEditor *self = BST_BUS_EDITOR (object);\n bst_bus_editor_set_bus (self, 0);\n G_OBJECT_CLASS (bst_bus_editor_parent_class)->finalize (object);\n using namespace Bse;\n Bst::remove_handler (&self->mon_handler);\n self->source.~SourceS();\n self->lmonitor.~SignalMonitorS();\n self->rmonitor.~SignalMonitorS();\n}\n\nGtkWidget*\nbst_bus_editor_new (SfiProxy bus)\n{\n assert_return (BSE_IS_BUS (bus), NULL);\n GtkWidget *widget = (GtkWidget*) g_object_new (BST_TYPE_BUS_EDITOR, NULL);\n BstBusEditor *self = BST_BUS_EDITOR (widget);\n bst_bus_editor_set_bus (self, bus);\n return widget;\n}\n\nstatic void\nbus_editor_release_item (SfiProxy item,\n BstBusEditor *self)\n{\n assert_return (self->item == item);\n bst_bus_editor_set_bus (self, 0);\n}\n\nstatic GtkWidget*\nbus_build_param (BstBusEditor *self,\n const gchar *property,\n const gchar *area,\n const gchar *editor,\n const gchar *label)\n{\n GxkParam *gxk_param = nullptr;\n\n \/* aida property? *\/\n Bse::BusH bus = Bse::BusH::__cast__ (bse_server.from_proxy (self->item));\n const Bse::StringSeq meta = bus.find_prop (property);\n\n GParamSpec *cxxpspec = Bse::pspec_from_key_value_list (property, meta);\n if (cxxpspec)\n gxk_param = bst_param_new_property (cxxpspec, bus);\n\n if (!gxk_param)\n {\n \/* proxy property *\/\n auto pspec = bse_proxy_get_pspec (self->item, property);\n gxk_param = bst_param_new_proxy (pspec, self->item);\n }\n\n self->params = sfi_ring_prepend (self->params, gxk_param);\n GtkWidget *ewidget = gxk_param_create_editor ((GxkParam*) self->params->data, editor);\n gxk_radget_add (self, area, ewidget);\n if (label)\n g_object_set (gxk_parent_find_descendant (ewidget, GTK_TYPE_LABEL), \"label\", label, NULL);\n return ewidget;\n}\n\nstatic gboolean\ngrab_focus_and_false (GtkWidget *widget)\n{\n gtk_widget_grab_focus (widget);\n return FALSE;\n}\n\nvoid\nbst_bus_editor_set_bus (BstBusEditor *self,\n SfiProxy item)\n{\n if (item)\n assert_return (BSE_IS_BUS (item));\n if (self->item)\n {\n Bst::remove_handler (&self->mon_handler);\n self->lmonitor = NULL;\n self->rmonitor = NULL;\n Bse::SourceH source = Bse::SourceH::__cast__ (bse_server.from_proxy (self->item));\n bse_proxy_disconnect (self->item,\n \"any-signal\", bus_editor_release_item, self,\n NULL);\n self->source = NULL;\n while (self->params)\n gxk_param_destroy ((GxkParam*) sfi_ring_pop_head (&self->params));\n }\n self->item = item;\n if (self->item)\n {\n self->source = Bse::SourceH::__cast__ (bse_server.from_proxy (self->item));\n GParamSpec *pspec;\n SfiRing *ring;\n bse_proxy_connect (self->item,\n \"signal::release\", bus_editor_release_item, self,\n NULL);\n \/* create and hook up volume params & scopes *\/\n pspec = bse_proxy_get_pspec (self->item, \"left-volume\");\n GxkParam *lvolume = bst_param_new_proxy (pspec, self->item);\n GtkWidget *lspinner = gxk_param_create_editor (lvolume, \"spinner\");\n pspec = bse_proxy_get_pspec (self->item, \"right-volume\");\n GxkParam *rvolume = bst_param_new_proxy (pspec, self->item);\n GtkWidget *rspinner = gxk_param_create_editor (rvolume, \"spinner\");\n BstDBMeter *dbmeter = (BstDBMeter*) gxk_radget_find (self, \"db-meter\");\n if (dbmeter)\n {\n GtkRange *range = bst_db_meter_get_scale (dbmeter, 0);\n bst_db_scale_hook_up_param (range, lvolume);\n g_signal_connect_object (range, \"button-press-event\", G_CALLBACK (grab_focus_and_false), lspinner, G_CONNECT_SWAPPED);\n range = bst_db_meter_get_scale (dbmeter, 1);\n bst_db_scale_hook_up_param (range, rvolume);\n g_signal_connect_object (range, \"button-press-event\", G_CALLBACK (grab_focus_and_false), rspinner, G_CONNECT_SWAPPED);\n self->lbeam = bst_db_meter_get_beam (dbmeter, 0);\n if (self->lbeam)\n bst_db_beam_set_value (self->lbeam, -G_MAXDOUBLE);\n self->rbeam = bst_db_meter_get_beam (dbmeter, 1);\n if (self->rbeam)\n bst_db_beam_set_value (self->rbeam, -G_MAXDOUBLE);\n }\n gxk_radget_add (self, \"spinner-box\", lspinner);\n gxk_radget_add (self, \"spinner-box\", rspinner);\n self->params = sfi_ring_prepend (self->params, lvolume);\n self->params = sfi_ring_prepend (self->params, rvolume);\n \/* create remaining params *\/\n bus_build_param (self, \"uname\", \"name-box\", NULL, NULL);\n bus_build_param (self, \"inputs\", \"inputs-box\", NULL, NULL);\n bus_build_param (self, \"mute\", \"toggle-box\", \"toggle+label\", \"M\");\n bus_build_param (self, \"sync\", \"toggle-box\", \"toggle+label\", \"Y\");\n bus_build_param (self, \"solo\", \"toggle-box\", \"toggle+label\", \"S\");\n bus_build_param (self, \"outputs\", \"outputs-box\", NULL, NULL);\n \/* update params *\/\n for (ring = self->params; ring; ring = sfi_ring_walk (ring, self->params))\n gxk_param_update ((GxkParam*) ring->data);\n \/* setup scope *\/\n Bse::ProbeFeatures features;\n features.probe_energy = true;\n self->lmonitor = self->source.create_signal_monitor (0);\n self->rmonitor = self->source.create_signal_monitor (1);\n self->lmonitor.set_probe_features (features);\n self->rmonitor.set_probe_features (features);\n Bst::MonitorFieldU lfields = Bst::monitor_fields_from_shm (self->lmonitor.get_shm_id(), self->lmonitor.get_shm_offset());\n Bst::MonitorFieldU rfields = Bst::monitor_fields_from_shm (self->rmonitor.get_shm_id(), self->rmonitor.get_shm_offset());\n auto framecb = [self, lfields, rfields] () {\n bst_db_beam_set_value (self->lbeam, lfields.f32 (Bse::MonitorField::F32_DB_SPL));\n bst_db_beam_set_value (self->rbeam, rfields.f32 (Bse::MonitorField::F32_DB_SPL));\n if (0)\n printerr (\"BstBusEditor: (%x.%x\/%x %x.%x\/%x) ldb=%f rdb=%f\\n\",\n self->lmonitor.get_shm_id(), self->lmonitor.get_shm_offset(),\n lfields.f64 (Bse::MonitorField::F64_GENERATION),\n self->rmonitor.get_shm_id(), self->rmonitor.get_shm_offset(),\n rfields.f64 (Bse::MonitorField::F64_GENERATION),\n lfields.f32 (Bse::MonitorField::F32_DB_SPL),\n rfields.f32 (Bse::MonitorField::F32_DB_SPL));\n };\n self->mon_handler = Bst::add_frame_handler (framecb);\n }\n}\n\nstatic void\nbus_editor_action_exec (gpointer data,\n size_t action)\n{\n BstBusEditor *self = BST_BUS_EDITOR (data);\n switch (action)\n {\n case ACTION_ADD_BUS:\n break;\n case ACTION_DELETE_BUS:\n break;\n case ACTION_EDIT_BUS:\n break;\n }\n gxk_widget_update_actions_downwards (self);\n}\n\nstatic gboolean\nbus_editor_action_check (gpointer data,\n size_t action,\n guint64 action_stamp)\n{\n \/\/ BstBusEditor *self = BST_BUS_EDITOR (data);\n switch (action)\n {\n case ACTION_ADD_BUS:\n case ACTION_DELETE_BUS:\n case ACTION_EDIT_BUS:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\nstatic void\nbst_bus_editor_class_init (BstBusEditorClass *klass)\n{\n GObjectClass *gobject_class = G_OBJECT_CLASS (klass);\n GtkObjectClass *object_class = GTK_OBJECT_CLASS (klass);\n\n gobject_class->finalize = bst_bus_editor_finalize;\n object_class->destroy = bst_bus_editor_destroy;\n}\n<commit_msg>BEAST-GTK: bstbuseditor: use left_volume C++ property<commit_after>\/\/ Licensed GNU LGPL v2.1 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html\n#include \"bstbuseditor.hh\"\n#include \"bstparam.hh\"\n#include \"bstitemseqdialog.hh\" \/\/ FIXME\n#include \"bstsnifferscope.hh\" \/\/ FIXME\n#include \"bse\/internal.hh\"\n\n\/* --- prototypes --- *\/\nstatic void bus_editor_action_exec (gpointer data,\n size_t action);\nstatic gboolean bus_editor_action_check (gpointer data,\n size_t action,\n guint64 action_stamp);\n\n\/* --- bus actions --- *\/\nenum {\n ACTION_ADD_BUS,\n ACTION_DELETE_BUS,\n ACTION_EDIT_BUS\n};\nstatic const GxkStockAction bus_editor_actions[] = {\n { N_(\"Add\"), NULL, NULL, ACTION_ADD_BUS, BST_STOCK_PART },\n { N_(\"Delete\"), NULL, NULL, ACTION_DELETE_BUS, BST_STOCK_TRASHCAN },\n { N_(\"Editor\"), NULL, NULL, ACTION_EDIT_BUS, BST_STOCK_PART_EDITOR },\n};\n\n\n\/* --- functions --- *\/\nG_DEFINE_TYPE (BstBusEditor, bst_bus_editor, GTK_TYPE_ALIGNMENT);\n\nstatic void\nbst_bus_editor_init (BstBusEditor *self)\n{\n new (&self->source) Bse::SourceS();\n new (&self->lmonitor) Bse::SignalMonitorS();\n new (&self->rmonitor) Bse::SignalMonitorS();\n self->mon_handler = 0;\n \/* complete GUI *\/\n gxk_radget_complete (GTK_WIDGET (self), \"beast\", \"bus-editor\", NULL);\n \/* create tool actions *\/\n gxk_widget_publish_actions (self, \"bus-editor-actions\",\n G_N_ELEMENTS (bus_editor_actions), bus_editor_actions,\n NULL, bus_editor_action_check, bus_editor_action_exec);\n}\n\nstatic void\nbst_bus_editor_destroy (GtkObject *object)\n{\n BstBusEditor *self = BST_BUS_EDITOR (object);\n bst_bus_editor_set_bus (self, 0);\n GTK_OBJECT_CLASS (bst_bus_editor_parent_class)->destroy (object);\n}\n\nstatic void\nbst_bus_editor_finalize (GObject *object)\n{\n BstBusEditor *self = BST_BUS_EDITOR (object);\n bst_bus_editor_set_bus (self, 0);\n G_OBJECT_CLASS (bst_bus_editor_parent_class)->finalize (object);\n using namespace Bse;\n Bst::remove_handler (&self->mon_handler);\n self->source.~SourceS();\n self->lmonitor.~SignalMonitorS();\n self->rmonitor.~SignalMonitorS();\n}\n\nGtkWidget*\nbst_bus_editor_new (SfiProxy bus)\n{\n assert_return (BSE_IS_BUS (bus), NULL);\n GtkWidget *widget = (GtkWidget*) g_object_new (BST_TYPE_BUS_EDITOR, NULL);\n BstBusEditor *self = BST_BUS_EDITOR (widget);\n bst_bus_editor_set_bus (self, bus);\n return widget;\n}\n\nstatic void\nbus_editor_release_item (SfiProxy item,\n BstBusEditor *self)\n{\n assert_return (self->item == item);\n bst_bus_editor_set_bus (self, 0);\n}\n\nstatic GxkParam *\nget_property_param (BstBusEditor *self,\n const gchar *property)\n{\n Bse::BusH bus = Bse::BusH::__cast__ (bse_server.from_proxy (self->item));\n const Bse::StringSeq kvlist = bus.find_prop (property);\n\n GParamSpec *cxxpspec = Bse::pspec_from_key_value_list (property, kvlist);\n if (cxxpspec)\n return bst_param_new_property (cxxpspec, bus);\n\n return nullptr;\n}\n\nstatic GtkWidget*\nbus_build_param (BstBusEditor *self,\n const gchar *property,\n const gchar *area,\n const gchar *editor,\n const gchar *label)\n{\n GxkParam *gxk_param = get_property_param (self, property); \/* aida property? *\/\n\n if (!gxk_param)\n {\n \/* proxy property *\/\n auto pspec = bse_proxy_get_pspec (self->item, property);\n gxk_param = bst_param_new_proxy (pspec, self->item);\n }\n\n self->params = sfi_ring_prepend (self->params, gxk_param);\n GtkWidget *ewidget = gxk_param_create_editor ((GxkParam*) self->params->data, editor);\n gxk_radget_add (self, area, ewidget);\n if (label)\n g_object_set (gxk_parent_find_descendant (ewidget, GTK_TYPE_LABEL), \"label\", label, NULL);\n return ewidget;\n}\n\nstatic gboolean\ngrab_focus_and_false (GtkWidget *widget)\n{\n gtk_widget_grab_focus (widget);\n return FALSE;\n}\n\nvoid\nbst_bus_editor_set_bus (BstBusEditor *self,\n SfiProxy item)\n{\n if (item)\n assert_return (BSE_IS_BUS (item));\n if (self->item)\n {\n Bst::remove_handler (&self->mon_handler);\n self->lmonitor = NULL;\n self->rmonitor = NULL;\n Bse::SourceH source = Bse::SourceH::__cast__ (bse_server.from_proxy (self->item));\n bse_proxy_disconnect (self->item,\n \"any-signal\", bus_editor_release_item, self,\n NULL);\n self->source = NULL;\n while (self->params)\n gxk_param_destroy ((GxkParam*) sfi_ring_pop_head (&self->params));\n }\n self->item = item;\n if (self->item)\n {\n self->source = Bse::SourceH::__cast__ (bse_server.from_proxy (self->item));\n GParamSpec *pspec;\n SfiRing *ring;\n bse_proxy_connect (self->item,\n \"signal::release\", bus_editor_release_item, self,\n NULL);\n \/* create and hook up volume params & scopes *\/\n GxkParam *lvolume = get_property_param (self, \"left_volume\");\n GtkWidget *lspinner = gxk_param_create_editor (lvolume, \"spinner\");\n pspec = bse_proxy_get_pspec (self->item, \"right-volume\");\n GxkParam *rvolume = bst_param_new_proxy (pspec, self->item);\n GtkWidget *rspinner = gxk_param_create_editor (rvolume, \"spinner\");\n BstDBMeter *dbmeter = (BstDBMeter*) gxk_radget_find (self, \"db-meter\");\n if (dbmeter)\n {\n GtkRange *range = bst_db_meter_get_scale (dbmeter, 0);\n bst_db_scale_hook_up_param (range, lvolume);\n g_signal_connect_object (range, \"button-press-event\", G_CALLBACK (grab_focus_and_false), lspinner, G_CONNECT_SWAPPED);\n range = bst_db_meter_get_scale (dbmeter, 1);\n bst_db_scale_hook_up_param (range, rvolume);\n g_signal_connect_object (range, \"button-press-event\", G_CALLBACK (grab_focus_and_false), rspinner, G_CONNECT_SWAPPED);\n self->lbeam = bst_db_meter_get_beam (dbmeter, 0);\n if (self->lbeam)\n bst_db_beam_set_value (self->lbeam, -G_MAXDOUBLE);\n self->rbeam = bst_db_meter_get_beam (dbmeter, 1);\n if (self->rbeam)\n bst_db_beam_set_value (self->rbeam, -G_MAXDOUBLE);\n }\n gxk_radget_add (self, \"spinner-box\", lspinner);\n gxk_radget_add (self, \"spinner-box\", rspinner);\n self->params = sfi_ring_prepend (self->params, lvolume);\n self->params = sfi_ring_prepend (self->params, rvolume);\n \/* create remaining params *\/\n bus_build_param (self, \"uname\", \"name-box\", NULL, NULL);\n bus_build_param (self, \"inputs\", \"inputs-box\", NULL, NULL);\n bus_build_param (self, \"mute\", \"toggle-box\", \"toggle+label\", \"M\");\n bus_build_param (self, \"sync\", \"toggle-box\", \"toggle+label\", \"Y\");\n bus_build_param (self, \"solo\", \"toggle-box\", \"toggle+label\", \"S\");\n bus_build_param (self, \"outputs\", \"outputs-box\", NULL, NULL);\n \/* update params *\/\n for (ring = self->params; ring; ring = sfi_ring_walk (ring, self->params))\n gxk_param_update ((GxkParam*) ring->data);\n \/* setup scope *\/\n Bse::ProbeFeatures features;\n features.probe_energy = true;\n self->lmonitor = self->source.create_signal_monitor (0);\n self->rmonitor = self->source.create_signal_monitor (1);\n self->lmonitor.set_probe_features (features);\n self->rmonitor.set_probe_features (features);\n Bst::MonitorFieldU lfields = Bst::monitor_fields_from_shm (self->lmonitor.get_shm_id(), self->lmonitor.get_shm_offset());\n Bst::MonitorFieldU rfields = Bst::monitor_fields_from_shm (self->rmonitor.get_shm_id(), self->rmonitor.get_shm_offset());\n auto framecb = [self, lfields, rfields] () {\n bst_db_beam_set_value (self->lbeam, lfields.f32 (Bse::MonitorField::F32_DB_SPL));\n bst_db_beam_set_value (self->rbeam, rfields.f32 (Bse::MonitorField::F32_DB_SPL));\n if (0)\n printerr (\"BstBusEditor: (%x.%x\/%x %x.%x\/%x) ldb=%f rdb=%f\\n\",\n self->lmonitor.get_shm_id(), self->lmonitor.get_shm_offset(),\n lfields.f64 (Bse::MonitorField::F64_GENERATION),\n self->rmonitor.get_shm_id(), self->rmonitor.get_shm_offset(),\n rfields.f64 (Bse::MonitorField::F64_GENERATION),\n lfields.f32 (Bse::MonitorField::F32_DB_SPL),\n rfields.f32 (Bse::MonitorField::F32_DB_SPL));\n };\n self->mon_handler = Bst::add_frame_handler (framecb);\n }\n}\n\nstatic void\nbus_editor_action_exec (gpointer data,\n size_t action)\n{\n BstBusEditor *self = BST_BUS_EDITOR (data);\n switch (action)\n {\n case ACTION_ADD_BUS:\n break;\n case ACTION_DELETE_BUS:\n break;\n case ACTION_EDIT_BUS:\n break;\n }\n gxk_widget_update_actions_downwards (self);\n}\n\nstatic gboolean\nbus_editor_action_check (gpointer data,\n size_t action,\n guint64 action_stamp)\n{\n \/\/ BstBusEditor *self = BST_BUS_EDITOR (data);\n switch (action)\n {\n case ACTION_ADD_BUS:\n case ACTION_DELETE_BUS:\n case ACTION_EDIT_BUS:\n return TRUE;\n default:\n return FALSE;\n }\n}\n\nstatic void\nbst_bus_editor_class_init (BstBusEditorClass *klass)\n{\n GObjectClass *gobject_class = G_OBJECT_CLASS (klass);\n GtkObjectClass *object_class = GTK_OBJECT_CLASS (klass);\n\n gobject_class->finalize = bst_bus_editor_finalize;\n object_class->destroy = bst_bus_editor_destroy;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Basic camera class\n*\n* Copyright (C) 2016 by Sascha Willems - www.saschawillems.de\n*\n* This code is licensed under the MIT license (MIT) (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#define GLM_FORCE_RADIANS\n#define GLM_FORCE_DEPTH_ZERO_TO_ONE\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/quaternion.hpp>\n#include <glm\/gtx\/quaternion.hpp>\n\nclass Camera\n{\nprivate:\n\tfloat fov;\n\tfloat znear, zfar;\n\n\tvoid updateViewMatrix()\n\t{\n\t\tglm::mat4 rotM = glm::mat4();\n\t\tglm::mat4 transM;\n\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.x), glm::vec3(1.0f, 0.0f, 0.0f));\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.y), glm::vec3(0.0f, 1.0f, 0.0f));\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.z), glm::vec3(0.0f, 0.0f, 1.0f));\n\n\t\ttransM = glm::translate(glm::mat4(), position);\n\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\tmatrices.view = rotM * transM;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmatrices.view = transM * rotM;\n\t\t}\n\t};\npublic:\n\tenum CameraType { lookat, firstperson };\n\tCameraType type = CameraType::lookat;\n\n\tglm::vec3 rotation = glm::vec3();\n\tglm::vec3 position = glm::vec3();\n\n\tfloat rotationSpeed = 1.0f;\n\tfloat movementSpeed = 1.0f;\n\n\tstruct\n\t{\n\t\tglm::mat4 perspective;\n\t\tglm::mat4 view;\n\t} matrices;\n\n\tstruct\n\t{\n\t\tbool left = false;\n\t\tbool right = false;\n\t\tbool up = false;\n\t\tbool down = false;\n\t} keys;\n\n\tbool moving()\n\t{\n\t\treturn keys.left || keys.right || keys.up || keys.down;\n\t}\n\n\tvoid setPerspective(float fov, float aspect, float znear, float zfar)\n\t{\n\t\tthis->fov = fov;\n\t\tthis->znear = znear;\n\t\tthis->zfar = zfar;\n\t\tmatrices.perspective = glm::perspective(glm::radians(fov), aspect, znear, zfar);\n\t};\n\n\tvoid updateAspectRatio(float aspect)\n\t{\n\t\tmatrices.perspective = glm::perspective(glm::radians(fov), aspect, znear, zfar);\n\t}\n\n\tvoid setPosition(glm::vec3 position)\n\t{\n\t\tthis->position = position;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid setRotation(glm::vec3 rotation)\n\t{\n\t\tthis->rotation = rotation;\n\t\tupdateViewMatrix();\n\t};\n\n\tvoid rotate(glm::vec3 delta)\n\t{\n\t\tthis->rotation += delta;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid setTranslation(glm::vec3 translation)\n\t{\n\t\tthis->position = translation;\n\t\tupdateViewMatrix();\n\t};\n\n\tvoid translate(glm::vec3 delta)\n\t{\n\t\tthis->position += delta;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid update(float deltaTime)\n\t{\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\tif (moving())\n\t\t\t{\n\t\t\t\tglm::vec3 camFront;\n\t\t\t\tcamFront.x = -cos(glm::radians(rotation.x)) * sin(glm::radians(rotation.y));\n\t\t\t\tcamFront.y = sin(glm::radians(rotation.x));\n\t\t\t\tcamFront.z = cos(glm::radians(rotation.x)) * cos(glm::radians(rotation.y));\n\t\t\t\tcamFront = glm::normalize(camFront);\n\n\t\t\t\tfloat moveSpeed = deltaTime * movementSpeed;\n\n\t\t\t\tif (keys.up)\n\t\t\t\t\tposition += camFront * moveSpeed;\n\t\t\t\tif (keys.down)\n\t\t\t\t\tposition -= camFront * moveSpeed;\n\t\t\t\tif (keys.left)\n\t\t\t\t\tposition -= glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * moveSpeed;\n\t\t\t\tif (keys.right)\n\t\t\t\t\tposition += glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * moveSpeed;\n\n\t\t\t\tupdateViewMatrix();\n\t\t\t}\n\t\t}\n\t};\n\n\t\/\/ Update camera passing separate axis data (gamepad)\n\t\/\/ Returns true if view or position has been changed\n\tbool updatePad(glm::vec2 axisLeft, glm::vec2 axisRight, float deltaTime)\n\t{\n\t\tbool retVal = false;\n\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\t\/\/ Use the common console thumbstick layout\t\t\n\t\t\t\/\/ Left = view, right = move\n\n\t\t\tconst float deadZone = 0.0015f;\n\t\t\tconst float range = 1.0f - deadZone;\n\n\t\t\tglm::vec3 camFront;\n\t\t\tcamFront.x = -cos(glm::radians(rotation.x)) * sin(glm::radians(rotation.y));\n\t\t\tcamFront.y = sin(glm::radians(rotation.x));\n\t\t\tcamFront.z = cos(glm::radians(rotation.x)) * cos(glm::radians(rotation.y));\n\t\t\tcamFront = glm::normalize(camFront);\n\n\t\t\tfloat moveSpeed = deltaTime * movementSpeed * 2.0f;\n\t\t\tfloat rotSpeed = deltaTime * rotationSpeed * 50.0f;\n\t\t\t \n\t\t\t\/\/ Move\n\t\t\tif (fabsf(axisLeft.y) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisLeft.y) - deadZone) \/ range;\n\t\t\t\tposition -= camFront * pos * ((axisLeft.y < 0.0f) ? -1.0f : 1.0f) * moveSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t\tif (fabsf(axisLeft.x) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisLeft.x) - deadZone) \/ range;\n\t\t\t\tposition += glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * pos * ((axisLeft.x < 0.0f) ? -1.0f : 1.0f) * moveSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\n\t\t\t\/\/ Rotate\n\t\t\tif (fabsf(axisRight.x) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisRight.x) - deadZone) \/ range;\n\t\t\t\trotation.y += pos * ((axisRight.x < 0.0f) ? -1.0f : 1.0f) * rotSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t\tif (fabsf(axisRight.y) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisRight.y) - deadZone) \/ range;\n\t\t\t\trotation.x -= pos * ((axisRight.y < 0.0f) ? -1.0f : 1.0f) * rotSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ todo: move code from example base class for look-at\n\t\t}\n\n\t\tif (retVal)\n\t\t{\n\t\t\tupdateViewMatrix();\n\t\t}\n\n\t\treturn retVal;\n\t}\n\n};<commit_msg>Missing include<commit_after>\/*\n* Basic camera class\n*\n* Copyright (C) 2016 by Sascha Willems - www.saschawillems.de\n*\n* This code is licensed under the MIT license (MIT) (http:\/\/opensource.org\/licenses\/MIT)\n*\/\n\n#define GLM_FORCE_RADIANS\n#define GLM_FORCE_DEPTH_ZERO_TO_ONE\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/quaternion.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\nclass Camera\n{\nprivate:\n\tfloat fov;\n\tfloat znear, zfar;\n\n\tvoid updateViewMatrix()\n\t{\n\t\tglm::mat4 rotM = glm::mat4();\n\t\tglm::mat4 transM;\n\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.x), glm::vec3(1.0f, 0.0f, 0.0f));\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.y), glm::vec3(0.0f, 1.0f, 0.0f));\n\t\trotM = glm::rotate(rotM, glm::radians(rotation.z), glm::vec3(0.0f, 0.0f, 1.0f));\n\n\t\ttransM = glm::translate(glm::mat4(), position);\n\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\tmatrices.view = rotM * transM;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmatrices.view = transM * rotM;\n\t\t}\n\t};\npublic:\n\tenum CameraType { lookat, firstperson };\n\tCameraType type = CameraType::lookat;\n\n\tglm::vec3 rotation = glm::vec3();\n\tglm::vec3 position = glm::vec3();\n\n\tfloat rotationSpeed = 1.0f;\n\tfloat movementSpeed = 1.0f;\n\n\tstruct\n\t{\n\t\tglm::mat4 perspective;\n\t\tglm::mat4 view;\n\t} matrices;\n\n\tstruct\n\t{\n\t\tbool left = false;\n\t\tbool right = false;\n\t\tbool up = false;\n\t\tbool down = false;\n\t} keys;\n\n\tbool moving()\n\t{\n\t\treturn keys.left || keys.right || keys.up || keys.down;\n\t}\n\n\tvoid setPerspective(float fov, float aspect, float znear, float zfar)\n\t{\n\t\tthis->fov = fov;\n\t\tthis->znear = znear;\n\t\tthis->zfar = zfar;\n\t\tmatrices.perspective = glm::perspective(glm::radians(fov), aspect, znear, zfar);\n\t};\n\n\tvoid updateAspectRatio(float aspect)\n\t{\n\t\tmatrices.perspective = glm::perspective(glm::radians(fov), aspect, znear, zfar);\n\t}\n\n\tvoid setPosition(glm::vec3 position)\n\t{\n\t\tthis->position = position;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid setRotation(glm::vec3 rotation)\n\t{\n\t\tthis->rotation = rotation;\n\t\tupdateViewMatrix();\n\t};\n\n\tvoid rotate(glm::vec3 delta)\n\t{\n\t\tthis->rotation += delta;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid setTranslation(glm::vec3 translation)\n\t{\n\t\tthis->position = translation;\n\t\tupdateViewMatrix();\n\t};\n\n\tvoid translate(glm::vec3 delta)\n\t{\n\t\tthis->position += delta;\n\t\tupdateViewMatrix();\n\t}\n\n\tvoid update(float deltaTime)\n\t{\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\tif (moving())\n\t\t\t{\n\t\t\t\tglm::vec3 camFront;\n\t\t\t\tcamFront.x = -cos(glm::radians(rotation.x)) * sin(glm::radians(rotation.y));\n\t\t\t\tcamFront.y = sin(glm::radians(rotation.x));\n\t\t\t\tcamFront.z = cos(glm::radians(rotation.x)) * cos(glm::radians(rotation.y));\n\t\t\t\tcamFront = glm::normalize(camFront);\n\n\t\t\t\tfloat moveSpeed = deltaTime * movementSpeed;\n\n\t\t\t\tif (keys.up)\n\t\t\t\t\tposition += camFront * moveSpeed;\n\t\t\t\tif (keys.down)\n\t\t\t\t\tposition -= camFront * moveSpeed;\n\t\t\t\tif (keys.left)\n\t\t\t\t\tposition -= glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * moveSpeed;\n\t\t\t\tif (keys.right)\n\t\t\t\t\tposition += glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * moveSpeed;\n\n\t\t\t\tupdateViewMatrix();\n\t\t\t}\n\t\t}\n\t};\n\n\t\/\/ Update camera passing separate axis data (gamepad)\n\t\/\/ Returns true if view or position has been changed\n\tbool updatePad(glm::vec2 axisLeft, glm::vec2 axisRight, float deltaTime)\n\t{\n\t\tbool retVal = false;\n\n\t\tif (type == CameraType::firstperson)\n\t\t{\n\t\t\t\/\/ Use the common console thumbstick layout\t\t\n\t\t\t\/\/ Left = view, right = move\n\n\t\t\tconst float deadZone = 0.0015f;\n\t\t\tconst float range = 1.0f - deadZone;\n\n\t\t\tglm::vec3 camFront;\n\t\t\tcamFront.x = -cos(glm::radians(rotation.x)) * sin(glm::radians(rotation.y));\n\t\t\tcamFront.y = sin(glm::radians(rotation.x));\n\t\t\tcamFront.z = cos(glm::radians(rotation.x)) * cos(glm::radians(rotation.y));\n\t\t\tcamFront = glm::normalize(camFront);\n\n\t\t\tfloat moveSpeed = deltaTime * movementSpeed * 2.0f;\n\t\t\tfloat rotSpeed = deltaTime * rotationSpeed * 50.0f;\n\t\t\t \n\t\t\t\/\/ Move\n\t\t\tif (fabsf(axisLeft.y) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisLeft.y) - deadZone) \/ range;\n\t\t\t\tposition -= camFront * pos * ((axisLeft.y < 0.0f) ? -1.0f : 1.0f) * moveSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t\tif (fabsf(axisLeft.x) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisLeft.x) - deadZone) \/ range;\n\t\t\t\tposition += glm::normalize(glm::cross(camFront, glm::vec3(0.0f, 1.0f, 0.0f))) * pos * ((axisLeft.x < 0.0f) ? -1.0f : 1.0f) * moveSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\n\t\t\t\/\/ Rotate\n\t\t\tif (fabsf(axisRight.x) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisRight.x) - deadZone) \/ range;\n\t\t\t\trotation.y += pos * ((axisRight.x < 0.0f) ? -1.0f : 1.0f) * rotSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t\tif (fabsf(axisRight.y) > deadZone)\n\t\t\t{\n\t\t\t\tfloat pos = (fabsf(axisRight.y) - deadZone) \/ range;\n\t\t\t\trotation.x -= pos * ((axisRight.y < 0.0f) ? -1.0f : 1.0f) * rotSpeed;\n\t\t\t\tretVal = true;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ todo: move code from example base class for look-at\n\t\t}\n\n\t\tif (retVal)\n\t\t{\n\t\t\tupdateViewMatrix();\n\t\t}\n\n\t\treturn retVal;\n\t}\n\n};<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE JPetSinogramTest\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/numeric\/ublas\/matrix.hpp>\nusing namespace boost::numeric::ublas;\n\n#include \".\/JPetSinogram.h\"\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\nBOOST_AUTO_TEST_CASE( emissionMatrix_sinogram_0_degree )\n{\n matrix<int> m (2, 2);\n m(0, 0) = 2;\n m(0, 1) = 3;\n m(1, 0) = 4;\n m(1, 1) = 1;\n\n JPetSinogram sin;\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 0, m), 5ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 0, m), 5ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 90, m), 6ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 90, m), 4ll);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>Add 45theta tests with matrix 3x3<commit_after>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE JPetSinogramTest\n#include <boost\/test\/unit_test.hpp>\n#include <boost\/numeric\/ublas\/matrix.hpp>\nusing namespace boost::numeric::ublas;\n\n#include \".\/JPetSinogram.h\"\n\nBOOST_AUTO_TEST_SUITE(FirstSuite)\n\nBOOST_AUTO_TEST_CASE( emissionMatrix_projection )\n{\n matrix<int> m (2, 2);\n m(0, 0) = 2;\n m(0, 1) = 3;\n m(1, 0) = 4;\n m(1, 1) = 1;\n\n JPetSinogram sin;\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 0, m), 5ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 0, m), 5ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 90, m), 6ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 90, m), 4ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 45, m), 3ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 45, m), 3ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(2, 45, m), 4ll);\n}\n\nBOOST_AUTO_TEST_CASE( emissionMatrix_45theta )\n{\n matrix<int> m (3, 3);\n \/*\n 3 4 5\n 1 2 7\n 9 3 2\n s = 0 - 5\n s = 1 - 11\n s = 2 - 7\n s = 3 - 4\n s = 4 - 9\n *\/\n m(0, 0) = 3;\n m(0, 1) = 4;\n m(0, 2) = 5;\n\n m(1, 0) = 1;\n m(1, 1) = 2;\n m(1, 2) = 7;\n\n m(2, 0) = 9;\n m(2, 1) = 3;\n m(2, 2) = 2;\n\n JPetSinogram sin;\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(0, 45, m), 5ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(1, 45, m), 11ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(2, 45, m), 7ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(3, 45, m), 4ll);\n BOOST_REQUIRE_EQUAL(sin.forwardProjection(4, 45, m), 9ll);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <coins.h>\n#include <consensus\/tx_verify.h>\n#include <policy\/policy.h>\n#include <psbt.h>\n#include <util\/strencodings.h>\n\n#include <numeric>\n\nPartiallySignedTransaction::PartiallySignedTransaction(const CMutableTransaction& tx) : tx(tx)\n{\n inputs.resize(tx.vin.size());\n outputs.resize(tx.vout.size());\n}\n\nbool PartiallySignedTransaction::IsNull() const\n{\n return !tx && inputs.empty() && outputs.empty() && unknown.empty();\n}\n\nbool PartiallySignedTransaction::Merge(const PartiallySignedTransaction& psbt)\n{\n \/\/ Prohibited to merge two PSBTs over different transactions\n if (tx->GetHash() != psbt.tx->GetHash()) {\n return false;\n }\n\n for (unsigned int i = 0; i < inputs.size(); ++i) {\n inputs[i].Merge(psbt.inputs[i]);\n }\n for (unsigned int i = 0; i < outputs.size(); ++i) {\n outputs[i].Merge(psbt.outputs[i]);\n }\n unknown.insert(psbt.unknown.begin(), psbt.unknown.end());\n\n return true;\n}\n\nbool PartiallySignedTransaction::IsSane() const\n{\n for (PSBTInput input : inputs) {\n if (!input.IsSane()) return false;\n }\n return true;\n}\n\nbool PartiallySignedTransaction::AddInput(const CTxIn& txin, PSBTInput& psbtin)\n{\n if (std::find(tx->vin.begin(), tx->vin.end(), txin) != tx->vin.end()) {\n return false;\n }\n tx->vin.push_back(txin);\n psbtin.partial_sigs.clear();\n psbtin.final_script_sig.clear();\n psbtin.final_script_witness.SetNull();\n inputs.push_back(psbtin);\n return true;\n}\n\nbool PartiallySignedTransaction::AddOutput(const CTxOut& txout, const PSBTOutput& psbtout)\n{\n tx->vout.push_back(txout);\n outputs.push_back(psbtout);\n return true;\n}\n\nbool PartiallySignedTransaction::GetInputUTXO(CTxOut& utxo, int input_index) const\n{\n PSBTInput input = inputs[input_index];\n int prevout_index = tx->vin[input_index].prevout.n;\n if (input.non_witness_utxo) {\n utxo = input.non_witness_utxo->vout[prevout_index];\n } else if (!input.witness_utxo.IsNull()) {\n utxo = input.witness_utxo;\n } else {\n return false;\n }\n return true;\n}\n\nbool PSBTInput::IsNull() const\n{\n return !non_witness_utxo && witness_utxo.IsNull() && partial_sigs.empty() && unknown.empty() && hd_keypaths.empty() && redeem_script.empty() && witness_script.empty();\n}\n\nvoid PSBTInput::FillSignatureData(SignatureData& sigdata) const\n{\n if (!final_script_sig.empty()) {\n sigdata.scriptSig = final_script_sig;\n sigdata.complete = true;\n }\n if (!final_script_witness.IsNull()) {\n sigdata.scriptWitness = final_script_witness;\n sigdata.complete = true;\n }\n if (sigdata.complete) {\n return;\n }\n\n sigdata.signatures.insert(partial_sigs.begin(), partial_sigs.end());\n if (!redeem_script.empty()) {\n sigdata.redeem_script = redeem_script;\n }\n if (!witness_script.empty()) {\n sigdata.witness_script = witness_script;\n }\n for (const auto& key_pair : hd_keypaths) {\n sigdata.misc_pubkeys.emplace(key_pair.first.GetID(), key_pair);\n }\n}\n\nvoid PSBTInput::FromSignatureData(const SignatureData& sigdata)\n{\n if (sigdata.complete) {\n partial_sigs.clear();\n hd_keypaths.clear();\n redeem_script.clear();\n witness_script.clear();\n\n if (!sigdata.scriptSig.empty()) {\n final_script_sig = sigdata.scriptSig;\n }\n if (!sigdata.scriptWitness.IsNull()) {\n final_script_witness = sigdata.scriptWitness;\n }\n return;\n }\n\n partial_sigs.insert(sigdata.signatures.begin(), sigdata.signatures.end());\n if (redeem_script.empty() && !sigdata.redeem_script.empty()) {\n redeem_script = sigdata.redeem_script;\n }\n if (witness_script.empty() && !sigdata.witness_script.empty()) {\n witness_script = sigdata.witness_script;\n }\n for (const auto& entry : sigdata.misc_pubkeys) {\n hd_keypaths.emplace(entry.second);\n }\n}\n\nvoid PSBTInput::Merge(const PSBTInput& input)\n{\n if (!non_witness_utxo && input.non_witness_utxo) non_witness_utxo = input.non_witness_utxo;\n if (witness_utxo.IsNull() && !input.witness_utxo.IsNull()) {\n witness_utxo = input.witness_utxo;\n non_witness_utxo = nullptr; \/\/ Clear out any non-witness utxo when we set a witness one.\n }\n\n partial_sigs.insert(input.partial_sigs.begin(), input.partial_sigs.end());\n hd_keypaths.insert(input.hd_keypaths.begin(), input.hd_keypaths.end());\n unknown.insert(input.unknown.begin(), input.unknown.end());\n\n if (redeem_script.empty() && !input.redeem_script.empty()) redeem_script = input.redeem_script;\n if (witness_script.empty() && !input.witness_script.empty()) witness_script = input.witness_script;\n if (final_script_sig.empty() && !input.final_script_sig.empty()) final_script_sig = input.final_script_sig;\n if (final_script_witness.IsNull() && !input.final_script_witness.IsNull()) final_script_witness = input.final_script_witness;\n}\n\nbool PSBTInput::IsSane() const\n{\n \/\/ Cannot have both witness and non-witness utxos\n if (!witness_utxo.IsNull() && non_witness_utxo) return false;\n\n \/\/ If we have a witness_script or a scriptWitness, we must also have a witness utxo\n if (!witness_script.empty() && witness_utxo.IsNull()) return false;\n if (!final_script_witness.IsNull() && witness_utxo.IsNull()) return false;\n\n return true;\n}\n\nvoid PSBTOutput::FillSignatureData(SignatureData& sigdata) const\n{\n if (!redeem_script.empty()) {\n sigdata.redeem_script = redeem_script;\n }\n if (!witness_script.empty()) {\n sigdata.witness_script = witness_script;\n }\n for (const auto& key_pair : hd_keypaths) {\n sigdata.misc_pubkeys.emplace(key_pair.first.GetID(), key_pair);\n }\n}\n\nvoid PSBTOutput::FromSignatureData(const SignatureData& sigdata)\n{\n if (redeem_script.empty() && !sigdata.redeem_script.empty()) {\n redeem_script = sigdata.redeem_script;\n }\n if (witness_script.empty() && !sigdata.witness_script.empty()) {\n witness_script = sigdata.witness_script;\n }\n for (const auto& entry : sigdata.misc_pubkeys) {\n hd_keypaths.emplace(entry.second);\n }\n}\n\nbool PSBTOutput::IsNull() const\n{\n return redeem_script.empty() && witness_script.empty() && hd_keypaths.empty() && unknown.empty();\n}\n\nvoid PSBTOutput::Merge(const PSBTOutput& output)\n{\n hd_keypaths.insert(output.hd_keypaths.begin(), output.hd_keypaths.end());\n unknown.insert(output.unknown.begin(), output.unknown.end());\n\n if (redeem_script.empty() && !output.redeem_script.empty()) redeem_script = output.redeem_script;\n if (witness_script.empty() && !output.witness_script.empty()) witness_script = output.witness_script;\n}\n\nbool PSBTInputSigned(const PSBTInput& input)\n{\n return !input.final_script_sig.empty() || !input.final_script_witness.IsNull();\n}\n\nbool SignPSBTInput(const SigningProvider& provider, PartiallySignedTransaction& psbt, int index, int sighash, SignatureData* out_sigdata, bool use_dummy)\n{\n PSBTInput& input = psbt.inputs.at(index);\n const CMutableTransaction& tx = *psbt.tx;\n\n if (PSBTInputSigned(input)) {\n return true;\n }\n\n \/\/ Fill SignatureData with input info\n SignatureData sigdata;\n input.FillSignatureData(sigdata);\n\n \/\/ Get UTXO\n bool require_witness_sig = false;\n CTxOut utxo;\n\n \/\/ Verify input sanity, which checks that at most one of witness or non-witness utxos is provided.\n if (!input.IsSane()) {\n return false;\n }\n\n if (input.non_witness_utxo) {\n \/\/ If we're taking our information from a non-witness UTXO, verify that it matches the prevout.\n COutPoint prevout = tx.vin[index].prevout;\n if (input.non_witness_utxo->GetHash() != prevout.hash) {\n return false;\n }\n utxo = input.non_witness_utxo->vout[prevout.n];\n } else if (!input.witness_utxo.IsNull()) {\n utxo = input.witness_utxo;\n \/\/ When we're taking our information from a witness UTXO, we can't verify it is actually data from\n \/\/ the output being spent. This is safe in case a witness signature is produced (which includes this\n \/\/ information directly in the hash), but not for non-witness signatures. Remember that we require\n \/\/ a witness signature in this situation.\n require_witness_sig = true;\n } else {\n return false;\n }\n\n sigdata.witness = false;\n bool sig_complete;\n if (use_dummy) {\n sig_complete = ProduceSignature(provider, DUMMY_SIGNATURE_CREATOR, utxo.scriptPubKey, sigdata);\n } else {\n MutableTransactionSignatureCreator creator(&tx, index, utxo.nValue, sighash);\n sig_complete = ProduceSignature(provider, creator, utxo.scriptPubKey, sigdata);\n }\n \/\/ Verify that a witness signature was produced in case one was required.\n if (require_witness_sig && !sigdata.witness) return false;\n input.FromSignatureData(sigdata);\n\n \/\/ If we have a witness signature, use the smaller witness UTXO.\n if (sigdata.witness) {\n input.witness_utxo = utxo;\n input.non_witness_utxo = nullptr;\n }\n\n \/\/ Fill in the missing info\n if (out_sigdata) {\n out_sigdata->missing_pubkeys = sigdata.missing_pubkeys;\n out_sigdata->missing_sigs = sigdata.missing_sigs;\n out_sigdata->missing_redeem_script = sigdata.missing_redeem_script;\n out_sigdata->missing_witness_script = sigdata.missing_witness_script;\n }\n\n return sig_complete;\n}\n\nbool FinalizePSBT(PartiallySignedTransaction& psbtx)\n{\n \/\/ Finalize input signatures -- in case we have partial signatures that add up to a complete\n \/\/ signature, but have not combined them yet (e.g. because the combiner that created this\n \/\/ PartiallySignedTransaction did not understand them), this will combine them into a final\n \/\/ script.\n bool complete = true;\n for (unsigned int i = 0; i < psbtx.tx->vin.size(); ++i) {\n complete &= SignPSBTInput(DUMMY_SIGNING_PROVIDER, psbtx, i, SIGHASH_ALL);\n }\n\n return complete;\n}\n\nbool FinalizeAndExtractPSBT(PartiallySignedTransaction& psbtx, CMutableTransaction& result)\n{\n \/\/ It's not safe to extract a PSBT that isn't finalized, and there's no easy way to check\n \/\/ whether a PSBT is finalized without finalizing it, so we just do this.\n if (!FinalizePSBT(psbtx)) {\n return false;\n }\n\n result = *psbtx.tx;\n for (unsigned int i = 0; i < result.vin.size(); ++i) {\n result.vin[i].scriptSig = psbtx.inputs[i].final_script_sig;\n result.vin[i].scriptWitness = psbtx.inputs[i].final_script_witness;\n }\n return true;\n}\n\nTransactionError CombinePSBTs(PartiallySignedTransaction& out, const std::vector<PartiallySignedTransaction>& psbtxs)\n{\n out = psbtxs[0]; \/\/ Copy the first one\n\n \/\/ Merge\n for (auto it = std::next(psbtxs.begin()); it != psbtxs.end(); ++it) {\n if (!out.Merge(*it)) {\n return TransactionError::PSBT_MISMATCH;\n }\n }\n if (!out.IsSane()) {\n return TransactionError::INVALID_PSBT;\n }\n\n return TransactionError::OK;\n}\n\nstd::string PSBTRoleName(PSBTRole role) {\n switch (role) {\n case PSBTRole::UPDATER: return \"updater\";\n case PSBTRole::SIGNER: return \"signer\";\n case PSBTRole::FINALIZER: return \"finalizer\";\n case PSBTRole::EXTRACTOR: return \"extractor\";\n }\n}\n\nbool DecodeBase64PSBT(PartiallySignedTransaction& psbt, const std::string& base64_tx, std::string& error)\n{\n bool invalid;\n std::string tx_data = DecodeBase64(base64_tx, &invalid);\n if (invalid) {\n error = \"invalid base64\";\n return false;\n }\n return DecodeRawPSBT(psbt, tx_data, error);\n}\n\nbool DecodeRawPSBT(PartiallySignedTransaction& psbt, const std::string& tx_data, std::string& error)\n{\n CDataStream ss_data(tx_data.data(), tx_data.data() + tx_data.size(), SER_NETWORK, PROTOCOL_VERSION);\n try {\n ss_data >> psbt;\n if (!ss_data.empty()) {\n error = \"extra data after PSBT\";\n return false;\n }\n } catch (const std::exception& e) {\n error = e.what();\n return false;\n }\n return true;\n}<commit_msg>Bitcoin: beb42d71a0fd8ac75f3c889cb650b7d21fa9a740 (Silence GCC 7 warning 'control reaches end of non-void function' (-Wreturn-type) in psbt.cpp).<commit_after>\/\/ Copyright (c) 2009-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <coins.h>\n#include <consensus\/tx_verify.h>\n#include <policy\/policy.h>\n#include <psbt.h>\n#include <util\/strencodings.h>\n\n#include <numeric>\n\nPartiallySignedTransaction::PartiallySignedTransaction(const CMutableTransaction& tx) : tx(tx)\n{\n inputs.resize(tx.vin.size());\n outputs.resize(tx.vout.size());\n}\n\nbool PartiallySignedTransaction::IsNull() const\n{\n return !tx && inputs.empty() && outputs.empty() && unknown.empty();\n}\n\nbool PartiallySignedTransaction::Merge(const PartiallySignedTransaction& psbt)\n{\n \/\/ Prohibited to merge two PSBTs over different transactions\n if (tx->GetHash() != psbt.tx->GetHash()) {\n return false;\n }\n\n for (unsigned int i = 0; i < inputs.size(); ++i) {\n inputs[i].Merge(psbt.inputs[i]);\n }\n for (unsigned int i = 0; i < outputs.size(); ++i) {\n outputs[i].Merge(psbt.outputs[i]);\n }\n unknown.insert(psbt.unknown.begin(), psbt.unknown.end());\n\n return true;\n}\n\nbool PartiallySignedTransaction::IsSane() const\n{\n for (PSBTInput input : inputs) {\n if (!input.IsSane()) return false;\n }\n return true;\n}\n\nbool PartiallySignedTransaction::AddInput(const CTxIn& txin, PSBTInput& psbtin)\n{\n if (std::find(tx->vin.begin(), tx->vin.end(), txin) != tx->vin.end()) {\n return false;\n }\n tx->vin.push_back(txin);\n psbtin.partial_sigs.clear();\n psbtin.final_script_sig.clear();\n psbtin.final_script_witness.SetNull();\n inputs.push_back(psbtin);\n return true;\n}\n\nbool PartiallySignedTransaction::AddOutput(const CTxOut& txout, const PSBTOutput& psbtout)\n{\n tx->vout.push_back(txout);\n outputs.push_back(psbtout);\n return true;\n}\n\nbool PartiallySignedTransaction::GetInputUTXO(CTxOut& utxo, int input_index) const\n{\n PSBTInput input = inputs[input_index];\n int prevout_index = tx->vin[input_index].prevout.n;\n if (input.non_witness_utxo) {\n utxo = input.non_witness_utxo->vout[prevout_index];\n } else if (!input.witness_utxo.IsNull()) {\n utxo = input.witness_utxo;\n } else {\n return false;\n }\n return true;\n}\n\nbool PSBTInput::IsNull() const\n{\n return !non_witness_utxo && witness_utxo.IsNull() && partial_sigs.empty() && unknown.empty() && hd_keypaths.empty() && redeem_script.empty() && witness_script.empty();\n}\n\nvoid PSBTInput::FillSignatureData(SignatureData& sigdata) const\n{\n if (!final_script_sig.empty()) {\n sigdata.scriptSig = final_script_sig;\n sigdata.complete = true;\n }\n if (!final_script_witness.IsNull()) {\n sigdata.scriptWitness = final_script_witness;\n sigdata.complete = true;\n }\n if (sigdata.complete) {\n return;\n }\n\n sigdata.signatures.insert(partial_sigs.begin(), partial_sigs.end());\n if (!redeem_script.empty()) {\n sigdata.redeem_script = redeem_script;\n }\n if (!witness_script.empty()) {\n sigdata.witness_script = witness_script;\n }\n for (const auto& key_pair : hd_keypaths) {\n sigdata.misc_pubkeys.emplace(key_pair.first.GetID(), key_pair);\n }\n}\n\nvoid PSBTInput::FromSignatureData(const SignatureData& sigdata)\n{\n if (sigdata.complete) {\n partial_sigs.clear();\n hd_keypaths.clear();\n redeem_script.clear();\n witness_script.clear();\n\n if (!sigdata.scriptSig.empty()) {\n final_script_sig = sigdata.scriptSig;\n }\n if (!sigdata.scriptWitness.IsNull()) {\n final_script_witness = sigdata.scriptWitness;\n }\n return;\n }\n\n partial_sigs.insert(sigdata.signatures.begin(), sigdata.signatures.end());\n if (redeem_script.empty() && !sigdata.redeem_script.empty()) {\n redeem_script = sigdata.redeem_script;\n }\n if (witness_script.empty() && !sigdata.witness_script.empty()) {\n witness_script = sigdata.witness_script;\n }\n for (const auto& entry : sigdata.misc_pubkeys) {\n hd_keypaths.emplace(entry.second);\n }\n}\n\nvoid PSBTInput::Merge(const PSBTInput& input)\n{\n if (!non_witness_utxo && input.non_witness_utxo) non_witness_utxo = input.non_witness_utxo;\n if (witness_utxo.IsNull() && !input.witness_utxo.IsNull()) {\n witness_utxo = input.witness_utxo;\n non_witness_utxo = nullptr; \/\/ Clear out any non-witness utxo when we set a witness one.\n }\n\n partial_sigs.insert(input.partial_sigs.begin(), input.partial_sigs.end());\n hd_keypaths.insert(input.hd_keypaths.begin(), input.hd_keypaths.end());\n unknown.insert(input.unknown.begin(), input.unknown.end());\n\n if (redeem_script.empty() && !input.redeem_script.empty()) redeem_script = input.redeem_script;\n if (witness_script.empty() && !input.witness_script.empty()) witness_script = input.witness_script;\n if (final_script_sig.empty() && !input.final_script_sig.empty()) final_script_sig = input.final_script_sig;\n if (final_script_witness.IsNull() && !input.final_script_witness.IsNull()) final_script_witness = input.final_script_witness;\n}\n\nbool PSBTInput::IsSane() const\n{\n \/\/ Cannot have both witness and non-witness utxos\n if (!witness_utxo.IsNull() && non_witness_utxo) return false;\n\n \/\/ If we have a witness_script or a scriptWitness, we must also have a witness utxo\n if (!witness_script.empty() && witness_utxo.IsNull()) return false;\n if (!final_script_witness.IsNull() && witness_utxo.IsNull()) return false;\n\n return true;\n}\n\nvoid PSBTOutput::FillSignatureData(SignatureData& sigdata) const\n{\n if (!redeem_script.empty()) {\n sigdata.redeem_script = redeem_script;\n }\n if (!witness_script.empty()) {\n sigdata.witness_script = witness_script;\n }\n for (const auto& key_pair : hd_keypaths) {\n sigdata.misc_pubkeys.emplace(key_pair.first.GetID(), key_pair);\n }\n}\n\nvoid PSBTOutput::FromSignatureData(const SignatureData& sigdata)\n{\n if (redeem_script.empty() && !sigdata.redeem_script.empty()) {\n redeem_script = sigdata.redeem_script;\n }\n if (witness_script.empty() && !sigdata.witness_script.empty()) {\n witness_script = sigdata.witness_script;\n }\n for (const auto& entry : sigdata.misc_pubkeys) {\n hd_keypaths.emplace(entry.second);\n }\n}\n\nbool PSBTOutput::IsNull() const\n{\n return redeem_script.empty() && witness_script.empty() && hd_keypaths.empty() && unknown.empty();\n}\n\nvoid PSBTOutput::Merge(const PSBTOutput& output)\n{\n hd_keypaths.insert(output.hd_keypaths.begin(), output.hd_keypaths.end());\n unknown.insert(output.unknown.begin(), output.unknown.end());\n\n if (redeem_script.empty() && !output.redeem_script.empty()) redeem_script = output.redeem_script;\n if (witness_script.empty() && !output.witness_script.empty()) witness_script = output.witness_script;\n}\n\nbool PSBTInputSigned(const PSBTInput& input)\n{\n return !input.final_script_sig.empty() || !input.final_script_witness.IsNull();\n}\n\nbool SignPSBTInput(const SigningProvider& provider, PartiallySignedTransaction& psbt, int index, int sighash, SignatureData* out_sigdata, bool use_dummy)\n{\n PSBTInput& input = psbt.inputs.at(index);\n const CMutableTransaction& tx = *psbt.tx;\n\n if (PSBTInputSigned(input)) {\n return true;\n }\n\n \/\/ Fill SignatureData with input info\n SignatureData sigdata;\n input.FillSignatureData(sigdata);\n\n \/\/ Get UTXO\n bool require_witness_sig = false;\n CTxOut utxo;\n\n \/\/ Verify input sanity, which checks that at most one of witness or non-witness utxos is provided.\n if (!input.IsSane()) {\n return false;\n }\n\n if (input.non_witness_utxo) {\n \/\/ If we're taking our information from a non-witness UTXO, verify that it matches the prevout.\n COutPoint prevout = tx.vin[index].prevout;\n if (input.non_witness_utxo->GetHash() != prevout.hash) {\n return false;\n }\n utxo = input.non_witness_utxo->vout[prevout.n];\n } else if (!input.witness_utxo.IsNull()) {\n utxo = input.witness_utxo;\n \/\/ When we're taking our information from a witness UTXO, we can't verify it is actually data from\n \/\/ the output being spent. This is safe in case a witness signature is produced (which includes this\n \/\/ information directly in the hash), but not for non-witness signatures. Remember that we require\n \/\/ a witness signature in this situation.\n require_witness_sig = true;\n } else {\n return false;\n }\n\n sigdata.witness = false;\n bool sig_complete;\n if (use_dummy) {\n sig_complete = ProduceSignature(provider, DUMMY_SIGNATURE_CREATOR, utxo.scriptPubKey, sigdata);\n } else {\n MutableTransactionSignatureCreator creator(&tx, index, utxo.nValue, sighash);\n sig_complete = ProduceSignature(provider, creator, utxo.scriptPubKey, sigdata);\n }\n \/\/ Verify that a witness signature was produced in case one was required.\n if (require_witness_sig && !sigdata.witness) return false;\n input.FromSignatureData(sigdata);\n\n \/\/ If we have a witness signature, use the smaller witness UTXO.\n if (sigdata.witness) {\n input.witness_utxo = utxo;\n input.non_witness_utxo = nullptr;\n }\n\n \/\/ Fill in the missing info\n if (out_sigdata) {\n out_sigdata->missing_pubkeys = sigdata.missing_pubkeys;\n out_sigdata->missing_sigs = sigdata.missing_sigs;\n out_sigdata->missing_redeem_script = sigdata.missing_redeem_script;\n out_sigdata->missing_witness_script = sigdata.missing_witness_script;\n }\n\n return sig_complete;\n}\n\nbool FinalizePSBT(PartiallySignedTransaction& psbtx)\n{\n \/\/ Finalize input signatures -- in case we have partial signatures that add up to a complete\n \/\/ signature, but have not combined them yet (e.g. because the combiner that created this\n \/\/ PartiallySignedTransaction did not understand them), this will combine them into a final\n \/\/ script.\n bool complete = true;\n for (unsigned int i = 0; i < psbtx.tx->vin.size(); ++i) {\n complete &= SignPSBTInput(DUMMY_SIGNING_PROVIDER, psbtx, i, SIGHASH_ALL);\n }\n\n return complete;\n}\n\nbool FinalizeAndExtractPSBT(PartiallySignedTransaction& psbtx, CMutableTransaction& result)\n{\n \/\/ It's not safe to extract a PSBT that isn't finalized, and there's no easy way to check\n \/\/ whether a PSBT is finalized without finalizing it, so we just do this.\n if (!FinalizePSBT(psbtx)) {\n return false;\n }\n\n result = *psbtx.tx;\n for (unsigned int i = 0; i < result.vin.size(); ++i) {\n result.vin[i].scriptSig = psbtx.inputs[i].final_script_sig;\n result.vin[i].scriptWitness = psbtx.inputs[i].final_script_witness;\n }\n return true;\n}\n\nTransactionError CombinePSBTs(PartiallySignedTransaction& out, const std::vector<PartiallySignedTransaction>& psbtxs)\n{\n out = psbtxs[0]; \/\/ Copy the first one\n\n \/\/ Merge\n for (auto it = std::next(psbtxs.begin()); it != psbtxs.end(); ++it) {\n if (!out.Merge(*it)) {\n return TransactionError::PSBT_MISMATCH;\n }\n }\n if (!out.IsSane()) {\n return TransactionError::INVALID_PSBT;\n }\n\n return TransactionError::OK;\n}\n\nstd::string PSBTRoleName(PSBTRole role) {\n switch (role) {\n case PSBTRole::UPDATER: return \"updater\";\n case PSBTRole::SIGNER: return \"signer\";\n case PSBTRole::FINALIZER: return \"finalizer\";\n case PSBTRole::EXTRACTOR: return \"extractor\";\n \/\/ no default case, so the compiler can warn about missing cases\n }\n assert(false);\n}\n\nbool DecodeBase64PSBT(PartiallySignedTransaction& psbt, const std::string& base64_tx, std::string& error)\n{\n bool invalid;\n std::string tx_data = DecodeBase64(base64_tx, &invalid);\n if (invalid) {\n error = \"invalid base64\";\n return false;\n }\n return DecodeRawPSBT(psbt, tx_data, error);\n}\n\nbool DecodeRawPSBT(PartiallySignedTransaction& psbt, const std::string& tx_data, std::string& error)\n{\n CDataStream ss_data(tx_data.data(), tx_data.data() + tx_data.size(), SER_NETWORK, PROTOCOL_VERSION);\n try {\n ss_data >> psbt;\n if (!ss_data.empty()) {\n error = \"extra data after PSBT\";\n return false;\n }\n } catch (const std::exception& e) {\n error = e.what();\n return false;\n }\n return true;\n}<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\r\n * Copyright (c) 2009 Werner Mayer <wmayer[at]users.sourceforge.net> *\r\n * *\r\n * This file is part of the FreeCAD CAx development system. *\r\n * *\r\n * This library is free software; you can redistribute it and\/or *\r\n * modify it under the terms of the GNU Library General Public *\r\n * License as published by the Free Software Foundation; either *\r\n * version 2 of the License, or (at your option) any later version. *\r\n * *\r\n * This library is distributed in the hope that it will be useful, *\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r\n * GNU Library General Public License for more details. *\r\n * *\r\n * You should have received a copy of the GNU Library General Public *\r\n * License along with this library; see the file COPYING.LIB. If not, *\r\n * write to the Free Software Foundation, Inc., 59 Temple Place, *\r\n * Suite 330, Boston, MA 02111-1307, USA *\r\n * *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <QCheckBox>\r\n#endif\r\n\r\n\r\n#include <Standard_math.hxx>\r\n#include \"TaskDialog.h\"\r\n#include <Gui\/Application.h>\r\n#include <Gui\/Command.h>\r\n#include <Gui\/Selection.h>\r\n#include <Gui\/Document.h>\r\n#include <Gui\/View3DInventor.h>\r\n#include <Gui\/View3DInventorViewer.h>\r\n#include <Mod\/Part\/App\/PartFeature.h>\r\n\r\nusing namespace DrawingGui;\r\n\r\n\r\n\/* TRANSLATOR DrawingGui::TaskProjection *\/\r\n\nTaskProjection::TaskProjection()\n{\n QString texts[10] = \n {\n tr(\"Visible sharp edges\"),\n tr(\"Visible smooth edges\"),\n tr(\"Visible sewn edges\"),\n tr(\"Visible outline edges\"),\n tr(\"Visible isoparameters\"),\n tr(\"Hidden sharp edges\"),\n tr(\"Hidden smooth edges\"),\n tr(\"Hidden sewn edges\"),\n tr(\"Hidden outline edges\"),\n tr(\"Hidden isoparameters\")\n };\n widget = new QWidget();\n QVBoxLayout *mainLayout = new QVBoxLayout;\r\n\r\n for (int i=0; i<10; i++) {\r\n QCheckBox* cb = new QCheckBox();\r\n if (i < 5)\r\n cb->setChecked(true);\r\n cb->setText(texts[i]);\r\n mainLayout->addWidget(cb);\r\n boxes.push_back(cb);\r\n }\r\n\r\n widget->setLayout(mainLayout);\r\n\r\n taskbox = new Gui::TaskView::TaskBox(\n QPixmap(), tr(\"Project shapes\"), false, 0);\n taskbox->groupLayout()->addWidget(widget);\n Content.push_back(taskbox);\n}\n\nTaskProjection::~TaskProjection()\n{\n \/\/ automatically deleted in the sub-class\n}\n\nbool TaskProjection::accept()\n{\n Gui::Document* document = Gui::Application::Instance->activeDocument();\r\n if (!document)\r\n return false;\r\n Gui::MDIView* mdi = document->getActiveView();\r\n if (!mdi || !mdi->isDerivedFrom(Gui::View3DInventor::getClassTypeId()))\r\n return false;\r\n\r\n Gui::View3DInventorViewer* viewer = static_cast<Gui::View3DInventor*>(mdi)->getViewer();\r\n SbVec3f pnt, dir;\r\n viewer->getNearPlane(pnt, dir);\r\n float x=0, y=1,z=1;\r\n dir.getValue(x,y,z);\r\n\r\n std::vector<Part::Feature*> shapes = Gui::Selection().getObjectsOfType<Part::Feature>();\r\n Gui::Command::openCommand(\"Project shape\");\r\n Gui::Command::doCommand(Gui::Command::Doc,\"import Drawing\");\r\n for (std::vector<Part::Feature*>::iterator it = shapes.begin(); it != shapes.end(); ++it) {\r\n const char* object = (*it)->getNameInDocument();\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.addObject('Drawing::FeatureProjection','%s_proj')\", object);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Direction=FreeCAD.Vector(%f,%f,%f)\", x,y,z);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Source=FreeCAD.ActiveDocument.%s\", object);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.VCompound=%s\", (boxes[0]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Rg1LineVCompound=%s\", (boxes[1]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.RgNLineVCompound=%s\", (boxes[2]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.OutLineVCompound=%s\", (boxes[3]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.IsoLineVCompound=%s\", (boxes[4]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.HCompound=%s\", (boxes[5]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Rg1LineHCompound=%s\", (boxes[6]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.RgNLineHCompound=%s\", (boxes[7]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.OutLineHCompound=%s\", (boxes[8]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.IsoLineHCompound=%s\", (boxes[9]->isChecked() ? \"True\" : \"False\"));\r\n }\r\n Gui::Command::updateActive();\r\n Gui::Command::commitCommand();\r\n return true;\n}\n\n#include \"moc_TaskDialog.cpp\"\n<commit_msg>+ improve error handling in projection panel in Drawing workbench<commit_after>\/***************************************************************************\r\n * Copyright (c) 2009 Werner Mayer <wmayer[at]users.sourceforge.net> *\r\n * *\r\n * This file is part of the FreeCAD CAx development system. *\r\n * *\r\n * This library is free software; you can redistribute it and\/or *\r\n * modify it under the terms of the GNU Library General Public *\r\n * License as published by the Free Software Foundation; either *\r\n * version 2 of the License, or (at your option) any later version. *\r\n * *\r\n * This library is distributed in the hope that it will be useful, *\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\r\n * GNU Library General Public License for more details. *\r\n * *\r\n * You should have received a copy of the GNU Library General Public *\r\n * License along with this library; see the file COPYING.LIB. If not, *\r\n * write to the Free Software Foundation, Inc., 59 Temple Place, *\r\n * Suite 330, Boston, MA 02111-1307, USA *\r\n * *\r\n ***************************************************************************\/\r\n\r\n\r\n#include \"PreCompiled.h\"\r\n\r\n#ifndef _PreComp_\r\n# include <QCheckBox>\r\n# include <QMessageBox>\r\n#endif\r\n\r\n\r\n#include <Standard_math.hxx>\r\n#include \"TaskDialog.h\"\r\n#include <Gui\/Application.h>\r\n#include <Gui\/Command.h>\r\n#include <Gui\/Selection.h>\r\n#include <Gui\/Document.h>\r\n#include <Gui\/View3DInventor.h>\r\n#include <Gui\/View3DInventorViewer.h>\r\n#include <Mod\/Part\/App\/PartFeature.h>\r\n\r\nusing namespace DrawingGui;\r\n\r\n\r\n\/* TRANSLATOR DrawingGui::TaskProjection *\/\r\n\nTaskProjection::TaskProjection()\n{\n QString texts[10] = \n {\n tr(\"Visible sharp edges\"),\n tr(\"Visible smooth edges\"),\n tr(\"Visible sewn edges\"),\n tr(\"Visible outline edges\"),\n tr(\"Visible isoparameters\"),\n tr(\"Hidden sharp edges\"),\n tr(\"Hidden smooth edges\"),\n tr(\"Hidden sewn edges\"),\n tr(\"Hidden outline edges\"),\n tr(\"Hidden isoparameters\")\n };\n widget = new QWidget();\n QVBoxLayout *mainLayout = new QVBoxLayout;\r\n\r\n for (int i=0; i<10; i++) {\r\n QCheckBox* cb = new QCheckBox();\r\n if (i < 5)\r\n cb->setChecked(true);\r\n cb->setText(texts[i]);\r\n mainLayout->addWidget(cb);\r\n boxes.push_back(cb);\r\n }\r\n\r\n widget->setLayout(mainLayout);\r\n\r\n taskbox = new Gui::TaskView::TaskBox(\n QPixmap(), tr(\"Project shapes\"), false, 0);\n taskbox->groupLayout()->addWidget(widget);\n Content.push_back(taskbox);\n}\n\nTaskProjection::~TaskProjection()\n{\n \/\/ automatically deleted in the sub-class\n}\n\nbool TaskProjection::accept()\n{\n Gui::Document* document = Gui::Application::Instance->activeDocument();\r\n if (!document) {\r\n QMessageBox::warning(widget, tr(\"No active document\"),\r\n tr(\"There is currently no active document to complete the operation\"));\r\n return true;\r\n }\r\n std::list<Gui::MDIView*> mdis = document->getMDIViewsOfType(Gui::View3DInventor::getClassTypeId());\r\n if (mdis.empty()) {\r\n QMessageBox::warning(widget, tr(\"No active view\"),\r\n tr(\"There is currently no active view to complete the operation\"));\r\n return false;\r\n }\r\n\r\n Gui::View3DInventorViewer* viewer = static_cast<Gui::View3DInventor*>(mdis.front())->getViewer();\r\n SbVec3f pnt, dir;\r\n viewer->getNearPlane(pnt, dir);\r\n float x=0, y=1,z=1;\r\n dir.getValue(x,y,z);\r\n\r\n std::vector<Part::Feature*> shapes = Gui::Selection().getObjectsOfType<Part::Feature>();\r\n Gui::Command::openCommand(\"Project shape\");\r\n Gui::Command::addModule(Gui::Command::Doc,\"Drawing\");\r\n for (std::vector<Part::Feature*>::iterator it = shapes.begin(); it != shapes.end(); ++it) {\r\n const char* object = (*it)->getNameInDocument();\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.addObject('Drawing::FeatureProjection','%s_proj')\", object);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Direction=FreeCAD.Vector(%f,%f,%f)\", x,y,z);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Source=FreeCAD.ActiveDocument.%s\", object);\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.VCompound=%s\", (boxes[0]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Rg1LineVCompound=%s\", (boxes[1]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.RgNLineVCompound=%s\", (boxes[2]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.OutLineVCompound=%s\", (boxes[3]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.IsoLineVCompound=%s\", (boxes[4]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.HCompound=%s\", (boxes[5]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.Rg1LineHCompound=%s\", (boxes[6]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.RgNLineHCompound=%s\", (boxes[7]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.OutLineHCompound=%s\", (boxes[8]->isChecked() ? \"True\" : \"False\"));\r\n Gui::Command::doCommand(Gui::Command::Doc,\r\n \"FreeCAD.ActiveDocument.ActiveObject.IsoLineHCompound=%s\", (boxes[9]->isChecked() ? \"True\" : \"False\"));\r\n }\r\n Gui::Command::updateActive();\r\n Gui::Command::commitCommand();\r\n return true;\n}\n\n#include \"moc_TaskDialog.cpp\"\n<|endoftext|>"} {"text":"<commit_before>#include <vector>\n#include <algorithm>\n#include <iterator>\n\n#include <catch.hpp>\n#include <sliding_window_buffer.hpp>\n\n\ntypedef helene::sliding_window_buffer<int, 4> swb_type;\n\nTEST_CASE(\"default construct a sliding_window_buffer\",\n \"[sliding_window_buffer]\")\n{\n swb_type swb;\n\n CHECK(swb.size() == 4);\n\n SECTION(\"push back four values\")\n {\n swb.push_back(1);\n swb.push_back(2);\n swb.push_back(3);\n swb.push_back(4);\n\n CHECK(swb[0] == 1);\n CHECK(swb[1] == 2);\n CHECK(swb[2] == 3);\n CHECK(swb[3] == 4);\n\n CHECK(swb.front() == 1);\n CHECK(swb.back() == 4);\n\n SECTION(\"push back another value\")\n {\n swb.push_back(5);\n\n CHECK(swb[0] == 2);\n CHECK(swb[1] == 3);\n CHECK(swb[2] == 4);\n CHECK(swb[3] == 5);\n\n CHECK(swb.front() == 2);\n CHECK(swb.back() == 5);\n }\n\n SECTION(\"push front a value\")\n {\n swb.push_front(10);\n\n CHECK(swb[0] == 10);\n CHECK(swb[1] == 1);\n CHECK(swb[2] == 2);\n CHECK(swb[3] == 3);\n\n CHECK(swb.front() == 10);\n CHECK(swb.back() == 3);\n\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 10);\n CHECK(res[1] == 1);\n CHECK(res[2] == 2);\n CHECK(res[3] == 3);\n }\n }\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 1);\n CHECK(res[1] == 2);\n CHECK(res[2] == 3);\n CHECK(res[3] == 4);\n }\n\n SECTION(\"access values through const_iterators\")\n {\n auto cb = swb.cbegin();\n auto ce = swb.cend();\n }\n }\n}\n\n\nTEST_CASE(\"construct sliding_window_buffer with range\",\n \"[sliding_window_buffer]\")\n{\n std::vector<int> vals{1, 2, 3, 4};\n\n swb_type swb(vals.begin(), vals.end());\n\n CHECK(swb[0] == 1);\n CHECK(swb[1] == 2);\n CHECK(swb[2] == 3);\n CHECK(swb[3] == 4);\n\n SECTION(\"push back another value\")\n {\n swb.push_back(5);\n\n CHECK(swb[0] == 2);\n CHECK(swb[1] == 3);\n CHECK(swb[2] == 4);\n CHECK(swb[3] == 5);\n\n CHECK(swb.front() == 2);\n CHECK(swb.back() == 5);\n }\n\n SECTION(\"push front a value\")\n {\n swb.push_front(10);\n\n CHECK(swb[0] == 10);\n CHECK(swb[1] == 1);\n CHECK(swb[2] == 2);\n CHECK(swb[3] == 3);\n\n CHECK(swb.front() == 10);\n CHECK(swb.back() == 3);\n\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 10);\n CHECK(res[1] == 1);\n CHECK(res[2] == 2);\n CHECK(res[3] == 3);\n }\n }\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 1);\n CHECK(res[1] == 2);\n CHECK(res[2] == 3);\n CHECK(res[3] == 4);\n }\n}\n<commit_msg>Add unit tests. \tmodified: tests\/test_sliding_window_buffer.cpp<commit_after>#include <vector>\n#include <algorithm>\n#include <iterator>\n\n#include <catch.hpp>\n#include <sliding_window_buffer.hpp>\n\n\ntypedef helene::sliding_window_buffer<int, 4> swb_type;\n\nTEST_CASE(\"default construct a sliding_window_buffer\",\n \"[sliding_window_buffer]\")\n{\n swb_type swb;\n\n CHECK(swb.size() == 4);\n\n SECTION(\"push back four values\")\n {\n swb.push_back(1);\n swb.push_back(2);\n swb.push_back(3);\n swb.push_back(4);\n\n CHECK(swb[0] == 1);\n CHECK(swb[1] == 2);\n CHECK(swb[2] == 3);\n CHECK(swb[3] == 4);\n\n CHECK(swb.front() == 1);\n CHECK(swb.back() == 4);\n\n SECTION(\"push back another value\")\n {\n swb.push_back(5);\n\n CHECK(swb[0] == 2);\n CHECK(swb[1] == 3);\n CHECK(swb[2] == 4);\n CHECK(swb[3] == 5);\n\n CHECK(swb.front() == 2);\n CHECK(swb.back() == 5);\n }\n\n SECTION(\"push front a value\")\n {\n swb.push_front(10);\n\n CHECK(swb[0] == 10);\n CHECK(swb[1] == 1);\n CHECK(swb[2] == 2);\n CHECK(swb[3] == 3);\n\n CHECK(swb.front() == 10);\n CHECK(swb.back() == 3);\n\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 10);\n CHECK(res[1] == 1);\n CHECK(res[2] == 2);\n CHECK(res[3] == 3);\n }\n }\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 1);\n CHECK(res[1] == 2);\n CHECK(res[2] == 3);\n CHECK(res[3] == 4);\n }\n\n SECTION(\"access values through const_iterators\")\n {\n auto cb = swb.cbegin();\n auto ce = swb.cend();\n\n CHECK(*cb == 1);\n CHECK(cb[1] == 2);\n CHECK(cb[2] == 3);\n CHECK(cb[3] == 4);\n CHECK(cb + 4 == ce);\n }\n }\n}\n\n\nTEST_CASE(\"construct sliding_window_buffer with range\",\n \"[sliding_window_buffer]\")\n{\n std::vector<int> vals{1, 2, 3, 4};\n\n swb_type swb(vals.begin(), vals.end());\n\n CHECK(swb[0] == 1);\n CHECK(swb[1] == 2);\n CHECK(swb[2] == 3);\n CHECK(swb[3] == 4);\n\n SECTION(\"push back another value\")\n {\n swb.push_back(5);\n\n CHECK(swb[0] == 2);\n CHECK(swb[1] == 3);\n CHECK(swb[2] == 4);\n CHECK(swb[3] == 5);\n\n CHECK(swb.front() == 2);\n CHECK(swb.back() == 5);\n }\n\n SECTION(\"push front a value\")\n {\n swb.push_front(10);\n\n CHECK(swb[0] == 10);\n CHECK(swb[1] == 1);\n CHECK(swb[2] == 2);\n CHECK(swb[3] == 3);\n\n CHECK(swb.front() == 10);\n CHECK(swb.back() == 3);\n\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 10);\n CHECK(res[1] == 1);\n CHECK(res[2] == 2);\n CHECK(res[3] == 3);\n }\n }\n\n SECTION(\"copy full range into vector\")\n {\n std::vector<int> res;\n\n std::copy(swb.begin(), swb.end(), std::back_inserter(res));\n\n CHECK(res.size() == 4);\n CHECK(res[0] == 1);\n CHECK(res[1] == 2);\n CHECK(res[2] == 3);\n CHECK(res[3] == 4);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ mail-qman - deliver mail messages from the queue\n\n\/\/ The spool directory has the following structure:\n\/\/ * pid\/<pid> - message files under construction\n\/\/ * mess\/<inumber> - message files\n\/\/ * todo\/<message inumber> - envelope files\n\/\/ * notify - a UNIX socket that receives an <inumber> when a message\n\/\/ is added to the spool\n\n#include \"libutil.h\"\n#include \"shutil.h\"\n\n#include <fcntl.h>\n#include <spawn.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include <sys\/un.h>\n#include <sys\/wait.h>\n\n#include <string>\n#include <thread>\n\nusing std::string;\nusing std::thread;\n\nclass spool_reader\n{\n string spooldir_;\n int notifyfd_;\n\npublic:\n spool_reader(const string &spooldir) : spooldir_(spooldir)\n {\n \/\/ Create notification socket\n \/\/ XXX Commutativity: Unordered\n notifyfd_ = socket(AF_UNIX, SOCK_DGRAM, 0);\n if (notifyfd_ < 0)\n edie(\"socket failed\");\n struct sockaddr_un sun{};\n sun.sun_family = AF_UNIX;\n snprintf(sun.sun_path, sizeof sun.sun_path, \"%s\/notify\", spooldir.c_str());\n unlink(sun.sun_path);\n if (bind(notifyfd_, (struct sockaddr*)&sun, SUN_LEN(&sun)) < 0)\n edie(\"bind failed\");\n }\n\n string dequeue()\n {\n char buf[256];\n ssize_t r = recv(notifyfd_, buf, sizeof buf, 0);\n if (r < 0)\n edie(\"recv failed\");\n return {buf, (size_t)r};\n }\n\n string get_recipient(const string &id)\n {\n char path[256];\n snprintf(path, sizeof path, \"%s\/todo\/%s\", spooldir_.c_str(), id.c_str());\n \/\/ XXX Commutativity: O_ANYFD\n int fd = open(path, O_RDONLY|O_CLOEXEC);\n if (fd < 0)\n edie(\"open %s failed\", path);\n struct stat st;\n \/\/ XXX Commutativity: STAT_OMIT_NLINK\n if (fstat(fd, &st) < 0)\n edie(\"fstat %s failed\", path);\n string res(st.st_size, 0);\n if (readall(fd, &res.front(), res.size()) != res.size())\n edie(\"readall %s failed\", path);\n close(fd);\n return res;\n }\n\n int open_message(const string &id)\n {\n char path[256];\n snprintf(path, sizeof path, \"%s\/mess\/%s\", spooldir_.c_str(), id.c_str());\n \/\/ XXX Commutativity: O_ANYFD\n int fd = open(path, O_RDONLY|O_CLOEXEC);\n if (fd < 0)\n edie(\"open %s failed\", path);\n return fd;\n }\n\n void remove(const string &id)\n {\n string x;\n x.append(spooldir_).append(\"\/todo\/\").append(id);\n unlink(x.c_str());\n x.clear();\n x.append(spooldir_).append(\"\/mess\/\").append(id);\n unlink(x.c_str());\n }\n};\n\nstatic void\ndeliver(const char *mailroot, int msgfd, const string &recipient)\n{\n const char *argv[] = {\".\/mail-deliver\", mailroot, recipient.c_str(), nullptr};\n\n \/\/ XXX Commutativity: fork\/exec vs posix_spawn\n pid_t pid;\n posix_spawn_file_actions_t actions;\n if ((errno = posix_spawn_file_actions_init(&actions)))\n edie(\"posix_spawn_file_actions_init failed\");\n if ((errno = posix_spawn_file_actions_adddup2(&actions, msgfd, 0)))\n edie(\"posix_spawn_file_actions_adddup2 failed\");\n if ((errno = posix_spawn(&pid, argv[0], &actions, nullptr,\n const_cast<char *const*>(argv), environ)))\n edie(\"posix_spawn failed\");\n if ((errno = posix_spawn_file_actions_destroy(&actions)))\n edie(\"posix_spawn_file_actions_destroy failed\");\n\n int status;\n if (waitpid(pid, &status, 0) < 0)\n edie(\"waitpid failed\");\n if (!WIFEXITED(status) || WEXITSTATUS(status))\n die(\"deliver failed: status %d\", status);\n}\n\nstatic void\ndo_process(spool_reader *spool, const char *mailroot)\n{\n while (true) {\n string id = spool->dequeue();\n string recip = spool->get_recipient(id);\n int msgfd = spool->open_message(id);\n deliver(mailroot, msgfd, recip);\n spool->remove(id);\n }\n}\n\nstatic void\nusage(const char *argv0)\n{\n fprintf(stderr, \"Usage: %s spooldir mailroot nthread\\n\", argv0);\n exit(2);\n}\n\nint\nmain(int argc, char **argv)\n{\n if (argc != 4)\n usage(argv[0]);\n\n const char *spooldir = argv[1];\n const char *mailroot = argv[2];\n int nthread = atoi(argv[3]);\n if (nthread <= 0)\n usage(argv[0]);\n\n spool_reader reader{spooldir};\n\n thread *threads = new thread[nthread];\n\n for (int i = 0; i < nthread; ++i) {\n setaffinity(i);\n threads[i] = std::move(thread(do_process, &reader, mailroot));\n }\n\n for (int i = 0; i < nthread; ++i)\n threads[i].join();\n}\n<commit_msg>mail-qman: Support fork\/exec as alternate to posix_spawn<commit_after>\/\/ mail-qman - deliver mail messages from the queue\n\n\/\/ The spool directory has the following structure:\n\/\/ * pid\/<pid> - message files under construction\n\/\/ * mess\/<inumber> - message files\n\/\/ * todo\/<message inumber> - envelope files\n\/\/ * notify - a UNIX socket that receives an <inumber> when a message\n\/\/ is added to the spool\n\n#define HAVE_POSIX_SPAWN 0\n\n#include \"libutil.h\"\n#include \"shutil.h\"\n#include \"xsys.h\"\n\n#include <fcntl.h>\n#if HAVE_POSIX_SPAWN\n#include <spawn.h>\n#endif\n#include <stdio.h>\n#include <stdlib.h>\n#include <unistd.h>\n#include <sys\/socket.h>\n#include <sys\/stat.h>\n#include <sys\/un.h>\n#include <sys\/wait.h>\n\n#include <string>\n#include <thread>\n\nusing std::string;\nusing std::thread;\n\nclass spool_reader\n{\n string spooldir_;\n int notifyfd_;\n\npublic:\n spool_reader(const string &spooldir) : spooldir_(spooldir)\n {\n \/\/ Create notification socket\n \/\/ XXX Commutativity: Unordered\n notifyfd_ = socket(AF_UNIX, SOCK_DGRAM, 0);\n if (notifyfd_ < 0)\n edie(\"socket failed\");\n struct sockaddr_un sun{};\n sun.sun_family = AF_UNIX;\n snprintf(sun.sun_path, sizeof sun.sun_path, \"%s\/notify\", spooldir.c_str());\n unlink(sun.sun_path);\n if (bind(notifyfd_, (struct sockaddr*)&sun, SUN_LEN(&sun)) < 0)\n edie(\"bind failed\");\n }\n\n string dequeue()\n {\n char buf[256];\n ssize_t r = recv(notifyfd_, buf, sizeof buf, 0);\n if (r < 0)\n edie(\"recv failed\");\n return {buf, (size_t)r};\n }\n\n string get_recipient(const string &id)\n {\n char path[256];\n snprintf(path, sizeof path, \"%s\/todo\/%s\", spooldir_.c_str(), id.c_str());\n \/\/ XXX Commutativity: O_ANYFD\n int fd = open(path, O_RDONLY|O_CLOEXEC);\n if (fd < 0)\n edie(\"open %s failed\", path);\n struct stat st;\n \/\/ XXX Commutativity: STAT_OMIT_NLINK\n if (fstat(fd, &st) < 0)\n edie(\"fstat %s failed\", path);\n string res(st.st_size, 0);\n if (readall(fd, &res.front(), res.size()) != res.size())\n edie(\"readall %s failed\", path);\n close(fd);\n return res;\n }\n\n int open_message(const string &id)\n {\n char path[256];\n snprintf(path, sizeof path, \"%s\/mess\/%s\", spooldir_.c_str(), id.c_str());\n \/\/ XXX Commutativity: O_ANYFD\n int fd = open(path, O_RDONLY|O_CLOEXEC);\n if (fd < 0)\n edie(\"open %s failed\", path);\n return fd;\n }\n\n void remove(const string &id)\n {\n string x;\n x.append(spooldir_).append(\"\/todo\/\").append(id);\n unlink(x.c_str());\n x.clear();\n x.append(spooldir_).append(\"\/mess\/\").append(id);\n unlink(x.c_str());\n }\n};\n\nstatic void\ndeliver(const char *mailroot, int msgfd, const string &recipient)\n{\n const char *argv[] = {\".\/mail-deliver\", mailroot, recipient.c_str(), nullptr};\n\n \/\/ XXX Commutativity: fork\/exec vs posix_spawn\n pid_t pid;\n#if HAVE_POSIX_SPAWN\n posix_spawn_file_actions_t actions;\n if ((errno = posix_spawn_file_actions_init(&actions)))\n edie(\"posix_spawn_file_actions_init failed\");\n if ((errno = posix_spawn_file_actions_adddup2(&actions, msgfd, 0)))\n edie(\"posix_spawn_file_actions_adddup2 failed\");\n if ((errno = posix_spawn(&pid, argv[0], &actions, nullptr,\n const_cast<char *const*>(argv), environ)))\n edie(\"posix_spawn failed\");\n if ((errno = posix_spawn_file_actions_destroy(&actions)))\n edie(\"posix_spawn_file_actions_destroy failed\");\n#else\n pid = xfork();\n if (pid < 0)\n edie(\"fork failed\");\n if (pid == 0) {\n dup2(msgfd, 0);\n execv(argv[0], const_cast<char *const*>(argv));\n edie(\"execv %s failed\", argv[0]);\n }\n#endif\n\n int status;\n if (waitpid(pid, &status, 0) < 0)\n edie(\"waitpid failed\");\n if (!WIFEXITED(status) || WEXITSTATUS(status))\n die(\"deliver failed: status %d\", status);\n}\n\nstatic void\ndo_process(spool_reader *spool, const char *mailroot)\n{\n while (true) {\n string id = spool->dequeue();\n string recip = spool->get_recipient(id);\n int msgfd = spool->open_message(id);\n deliver(mailroot, msgfd, recip);\n spool->remove(id);\n }\n}\n\nstatic void\nusage(const char *argv0)\n{\n fprintf(stderr, \"Usage: %s spooldir mailroot nthread\\n\", argv0);\n exit(2);\n}\n\nint\nmain(int argc, char **argv)\n{\n if (argc != 4)\n usage(argv[0]);\n\n const char *spooldir = argv[1];\n const char *mailroot = argv[2];\n int nthread = atoi(argv[3]);\n if (nthread <= 0)\n usage(argv[0]);\n\n spool_reader reader{spooldir};\n\n thread *threads = new thread[nthread];\n\n for (int i = 0; i < nthread; ++i) {\n setaffinity(i);\n threads[i] = std::move(thread(do_process, &reader, mailroot));\n }\n\n for (int i = 0; i < nthread; ++i)\n threads[i].join();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/policy\/configuration_policy_store_interface.h\"\n\nnamespace {\n\nusing namespace policy;\n\nbool IsProxyPolicy(ConfigurationPolicyType policy) {\n return policy == kPolicyProxyMode ||\n policy == kPolicyProxyServerMode ||\n policy == kPolicyProxyServer ||\n policy == kPolicyProxyPacUrl ||\n policy == kPolicyProxyBypassList;\n}\n\n} \/\/ namespace\n\nnamespace policy {\n\nvoid ObservingPolicyStoreInterface::Apply(ConfigurationPolicyType policy,\n Value* value) {\n next_->Apply(policy, value);\n\n if (IsProxyPolicy(policy))\n proxy_policy_applied_ = true;\n}\n\nvoid FilteringPolicyStoreInterface::Apply(ConfigurationPolicyType policy,\n Value* value) {\n if (IsProxyPolicy(policy) && apply_proxy_policies_)\n next_->Apply(policy, value);\n}\n\n} \/\/ namespace policy\n<commit_msg>Plugged memory leak in FilteringPolicyStoreInterface::Apply.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/policy\/configuration_policy_store_interface.h\"\n\nnamespace {\n\nusing namespace policy;\n\nbool IsProxyPolicy(ConfigurationPolicyType policy) {\n return policy == kPolicyProxyMode ||\n policy == kPolicyProxyServerMode ||\n policy == kPolicyProxyServer ||\n policy == kPolicyProxyPacUrl ||\n policy == kPolicyProxyBypassList;\n}\n\n} \/\/ namespace\n\nnamespace policy {\n\nvoid ObservingPolicyStoreInterface::Apply(ConfigurationPolicyType policy,\n Value* value) {\n next_->Apply(policy, value);\n\n if (IsProxyPolicy(policy))\n proxy_policy_applied_ = true;\n}\n\nvoid FilteringPolicyStoreInterface::Apply(ConfigurationPolicyType policy,\n Value* value) {\n \/\/ Apply() takes ownership of |value|.\n if (IsProxyPolicy(policy) && apply_proxy_policies_)\n next_->Apply(policy, value);\n else\n delete value;\n}\n\n} \/\/ namespace policy\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: FillProperties.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: vg $ $Date: 2007-05-22 18:58:47 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_chart2.hxx\"\n#include \"FillProperties.hxx\"\n#include \"macros.hxx\"\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_BITMAPMODE_HPP_\n#include <com\/sun\/star\/drawing\/BitmapMode.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_FILLSTYLE_HPP_\n#include <com\/sun\/star\/drawing\/FillStyle.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_RECTANGLEPOINT_HPP_\n#include <com\/sun\/star\/drawing\/RectanglePoint.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\nusing ::com::sun::star::beans::Property;\n\nnamespace chart\n{\n\nnamespace\n{\n\nvoid lcl_AddPropertiesToVector_without_BitmapProperties( ::std::vector< ::com::sun::star::beans::Property > & rOutProperties )\n{\n rOutProperties.push_back(\n Property( C2U( \"FillStyle\" ),\n FillProperties::PROP_FILL_STYLE,\n ::getCppuType( reinterpret_cast< const drawing::FillStyle * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillColor\" ),\n FillProperties::PROP_FILL_COLOR,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID \/\/ \"maybe auto\"\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillTransparence\" ),\n FillProperties::PROP_FILL_TRANSPARENCE,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillTransparenceGradientName\" ),\n FillProperties::PROP_FILL_TRANSPARENCE_GRADIENT_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillTransparenceGradient\" ),\n\/\/ FillProperties::PROP_FILL_TRANSPARENCE_GRADIENT,\n\/\/ ::getCppuType( reinterpret_cast< const awt::Gradient * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillGradientName\" ),\n FillProperties::PROP_FILL_GRADIENT_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n beans::Property( C2U( \"FillGradientStepCount\" ),\n FillProperties::PROP_FILL_GRADIENT_STEPCOUNT,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillGradient\" ),\n\/\/ FillProperties::PROP_FILL_GRADIENT,\n\/\/ ::getCppuType( reinterpret_cast< const awt::Gradient * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillHatchName\" ),\n FillProperties::PROP_FILL_HATCH_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillHatch\" ),\n\/\/ FillProperties::PROP_FILL_HATCH,\n\/\/ ::getCppuType( reinterpret_cast< const drawing::Hatch * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n \/\/bitmap properties see lcl_AddPropertiesToVector_only_BitmapProperties()\n\n rOutProperties.push_back(\n Property( C2U( \"FillBackground\" ),\n FillProperties::PROP_FILL_BACKGROUND,\n ::getCppuType( reinterpret_cast< const sal_Bool * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n}\n\n\/\/static\nvoid lcl_AddPropertiesToVector_only_BitmapProperties( ::std::vector< ::com::sun::star::beans::Property > & rOutProperties )\n{\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapName\" ),\n FillProperties::PROP_FILL_BITMAP_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillBitmap\" ),\n\/\/ FillProperties::PROP_FILL_BITMAP,\n\/\/ ::getCppuType( reinterpret_cast< const uno::Reference< awt::XBitmap > * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillBitmapURL\" ),\n\/\/ FillProperties::PROP_FILL_BITMAP_URL,\n\/\/ ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapOffsetX\" ),\n FillProperties::PROP_FILL_BITMAP_OFFSETX,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapOffsetY\" ),\n FillProperties::PROP_FILL_BITMAP_OFFSETY,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapPositionOffsetX\" ),\n FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapPositionOffsetY\" ),\n FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapRectanglePoint\" ),\n FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT,\n ::getCppuType( reinterpret_cast< const drawing::RectanglePoint * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapLogicalSize\" ),\n FillProperties::PROP_FILL_BITMAP_LOGICALSIZE,\n ::getCppuType( reinterpret_cast< const sal_Bool * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapSizeX\" ),\n FillProperties::PROP_FILL_BITMAP_SIZEX,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapSizeY\" ),\n FillProperties::PROP_FILL_BITMAP_SIZEY,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapMode\" ),\n FillProperties::PROP_FILL_BITMAP_MODE,\n ::getCppuType( reinterpret_cast< const drawing::BitmapMode * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n}\n\n\nvoid lcl_AddDefaultsToMap_without_BitmapProperties(\n ::chart::tPropertyValueMap & rOutMap )\n{\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_STYLE ));\n rOutMap[ FillProperties::PROP_FILL_STYLE ] =\n uno::makeAny( drawing::FillStyle_SOLID );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_COLOR ));\n rOutMap[ FillProperties::PROP_FILL_COLOR ] =\n uno::makeAny( sal_Int32( 0xd9d9d9 ) ); \/\/ gray85\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_TRANSPARENCE ));\n rOutMap[ FillProperties::PROP_FILL_TRANSPARENCE ] =\n uno::makeAny( sal_Int16( 0 ) );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_GRADIENT_STEPCOUNT ));\n rOutMap[ FillProperties::PROP_FILL_GRADIENT_STEPCOUNT ] =\n uno::makeAny( sal_Int16( 0 ) );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BACKGROUND ));\n rOutMap[ FillProperties::PROP_FILL_BACKGROUND ] =\n uno::makeAny( sal_Bool( sal_False ) );\n}\n\nvoid lcl_AddDefaultsToMap_only_BitmapProperties(\n ::chart::tPropertyValueMap & rOutMap )\n{\n uno::Any aSalInt16Zero = uno::makeAny( sal_Int16( 0 ));\n uno::Any aSalInt32SizeDefault = uno::makeAny( sal_Int32( 0 ));\n\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_OFFSETX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_OFFSETX ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_OFFSETY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_OFFSETY ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT ] =\n uno::makeAny( drawing::RectanglePoint_MIDDLE_MIDDLE );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_LOGICALSIZE ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_LOGICALSIZE ] =\n uno::makeAny( true );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_SIZEX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_SIZEX ] = aSalInt32SizeDefault;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_SIZEY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_SIZEY ] = aSalInt32SizeDefault;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_MODE ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_MODE ] =\n uno::makeAny( drawing::BitmapMode_REPEAT );\n}\n\n}\/\/end anonymous namespace\n\nvoid FillProperties::AddPropertiesToVector(\n ::std::vector< Property > & rOutProperties )\n{\n \/\/ Fill Properties see service drawing::FillProperties\n \/\/ ---------------\n lcl_AddPropertiesToVector_without_BitmapProperties( rOutProperties );\n lcl_AddPropertiesToVector_only_BitmapProperties( rOutProperties );\n}\n\nvoid FillProperties::AddDefaultsToMap(\n ::chart::tPropertyValueMap & rOutMap )\n{\n lcl_AddDefaultsToMap_without_BitmapProperties( rOutMap );\n lcl_AddDefaultsToMap_only_BitmapProperties( rOutMap );\n}\n\n} \/\/ namespace chart\n<commit_msg>INTEGRATION: CWS chart07 (1.5.12); FILE MERGED 2007\/07\/09 07:27:22 bm 1.5.12.1: #i79087# FillxxxName is void per default so add MAYBEVOID<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: FillProperties.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2007-07-25 08:57:12 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_chart2.hxx\"\n#include \"FillProperties.hxx\"\n#include \"macros.hxx\"\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYATTRIBUTE_HPP_\n#include <com\/sun\/star\/beans\/PropertyAttribute.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_BITMAPMODE_HPP_\n#include <com\/sun\/star\/drawing\/BitmapMode.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_FILLSTYLE_HPP_\n#include <com\/sun\/star\/drawing\/FillStyle.hpp>\n#endif\n#ifndef _COM_SUN_STAR_DRAWING_RECTANGLEPOINT_HPP_\n#include <com\/sun\/star\/drawing\/RectanglePoint.hpp>\n#endif\n\nusing namespace ::com::sun::star;\n\nusing ::com::sun::star::beans::Property;\n\nnamespace chart\n{\n\nnamespace\n{\n\nvoid lcl_AddPropertiesToVector_without_BitmapProperties( ::std::vector< ::com::sun::star::beans::Property > & rOutProperties )\n{\n rOutProperties.push_back(\n Property( C2U( \"FillStyle\" ),\n FillProperties::PROP_FILL_STYLE,\n ::getCppuType( reinterpret_cast< const drawing::FillStyle * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillColor\" ),\n FillProperties::PROP_FILL_COLOR,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID \/\/ \"maybe auto\"\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillTransparence\" ),\n FillProperties::PROP_FILL_TRANSPARENCE,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillTransparenceGradientName\" ),\n FillProperties::PROP_FILL_TRANSPARENCE_GRADIENT_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillTransparenceGradient\" ),\n\/\/ FillProperties::PROP_FILL_TRANSPARENCE_GRADIENT,\n\/\/ ::getCppuType( reinterpret_cast< const awt::Gradient * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillGradientName\" ),\n FillProperties::PROP_FILL_GRADIENT_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n beans::Property( C2U( \"FillGradientStepCount\" ),\n FillProperties::PROP_FILL_GRADIENT_STEPCOUNT,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillGradient\" ),\n\/\/ FillProperties::PROP_FILL_GRADIENT,\n\/\/ ::getCppuType( reinterpret_cast< const awt::Gradient * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillHatchName\" ),\n FillProperties::PROP_FILL_HATCH_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillHatch\" ),\n\/\/ FillProperties::PROP_FILL_HATCH,\n\/\/ ::getCppuType( reinterpret_cast< const drawing::Hatch * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT\n\/\/ | beans::PropertyAttribute::MAYBEVOID ));\n\n \/\/bitmap properties see lcl_AddPropertiesToVector_only_BitmapProperties()\n\n rOutProperties.push_back(\n Property( C2U( \"FillBackground\" ),\n FillProperties::PROP_FILL_BACKGROUND,\n ::getCppuType( reinterpret_cast< const sal_Bool * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n}\n\n\/\/static\nvoid lcl_AddPropertiesToVector_only_BitmapProperties( ::std::vector< ::com::sun::star::beans::Property > & rOutProperties )\n{\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapName\" ),\n FillProperties::PROP_FILL_BITMAP_NAME,\n ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEVOID\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillBitmap\" ),\n\/\/ FillProperties::PROP_FILL_BITMAP,\n\/\/ ::getCppuType( reinterpret_cast< const uno::Reference< awt::XBitmap > * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n \/\/optional\n\/\/ rOutProperties.push_back(\n\/\/ Property( C2U( \"FillBitmapURL\" ),\n\/\/ FillProperties::PROP_FILL_BITMAP_URL,\n\/\/ ::getCppuType( reinterpret_cast< const ::rtl::OUString * >(0)),\n\/\/ beans::PropertyAttribute::BOUND\n\/\/ | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapOffsetX\" ),\n FillProperties::PROP_FILL_BITMAP_OFFSETX,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapOffsetY\" ),\n FillProperties::PROP_FILL_BITMAP_OFFSETY,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapPositionOffsetX\" ),\n FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapPositionOffsetY\" ),\n FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY,\n ::getCppuType( reinterpret_cast< const sal_Int16 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapRectanglePoint\" ),\n FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT,\n ::getCppuType( reinterpret_cast< const drawing::RectanglePoint * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapLogicalSize\" ),\n FillProperties::PROP_FILL_BITMAP_LOGICALSIZE,\n ::getCppuType( reinterpret_cast< const sal_Bool * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapSizeX\" ),\n FillProperties::PROP_FILL_BITMAP_SIZEX,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapSizeY\" ),\n FillProperties::PROP_FILL_BITMAP_SIZEY,\n ::getCppuType( reinterpret_cast< const sal_Int32 * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n\n rOutProperties.push_back(\n Property( C2U( \"FillBitmapMode\" ),\n FillProperties::PROP_FILL_BITMAP_MODE,\n ::getCppuType( reinterpret_cast< const drawing::BitmapMode * >(0)),\n beans::PropertyAttribute::BOUND\n | beans::PropertyAttribute::MAYBEDEFAULT ));\n}\n\n\nvoid lcl_AddDefaultsToMap_without_BitmapProperties(\n ::chart::tPropertyValueMap & rOutMap )\n{\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_STYLE ));\n rOutMap[ FillProperties::PROP_FILL_STYLE ] =\n uno::makeAny( drawing::FillStyle_SOLID );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_COLOR ));\n rOutMap[ FillProperties::PROP_FILL_COLOR ] =\n uno::makeAny( sal_Int32( 0xd9d9d9 ) ); \/\/ gray85\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_TRANSPARENCE ));\n rOutMap[ FillProperties::PROP_FILL_TRANSPARENCE ] =\n uno::makeAny( sal_Int16( 0 ) );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_GRADIENT_STEPCOUNT ));\n rOutMap[ FillProperties::PROP_FILL_GRADIENT_STEPCOUNT ] =\n uno::makeAny( sal_Int16( 0 ) );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BACKGROUND ));\n rOutMap[ FillProperties::PROP_FILL_BACKGROUND ] =\n uno::makeAny( sal_Bool( sal_False ) );\n}\n\nvoid lcl_AddDefaultsToMap_only_BitmapProperties(\n ::chart::tPropertyValueMap & rOutMap )\n{\n uno::Any aSalInt16Zero = uno::makeAny( sal_Int16( 0 ));\n uno::Any aSalInt32SizeDefault = uno::makeAny( sal_Int32( 0 ));\n\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_OFFSETX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_OFFSETX ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_OFFSETY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_OFFSETY ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETX ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_POSITION_OFFSETY ] = aSalInt16Zero;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_RECTANGLEPOINT ] =\n uno::makeAny( drawing::RectanglePoint_MIDDLE_MIDDLE );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_LOGICALSIZE ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_LOGICALSIZE ] =\n uno::makeAny( true );\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_SIZEX ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_SIZEX ] = aSalInt32SizeDefault;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_SIZEY ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_SIZEY ] = aSalInt32SizeDefault;\n OSL_ASSERT( rOutMap.end() == rOutMap.find( FillProperties::PROP_FILL_BITMAP_MODE ));\n rOutMap[ FillProperties::PROP_FILL_BITMAP_MODE ] =\n uno::makeAny( drawing::BitmapMode_REPEAT );\n}\n\n}\/\/end anonymous namespace\n\nvoid FillProperties::AddPropertiesToVector(\n ::std::vector< Property > & rOutProperties )\n{\n \/\/ Fill Properties see service drawing::FillProperties\n \/\/ ---------------\n lcl_AddPropertiesToVector_without_BitmapProperties( rOutProperties );\n lcl_AddPropertiesToVector_only_BitmapProperties( rOutProperties );\n}\n\nvoid FillProperties::AddDefaultsToMap(\n ::chart::tPropertyValueMap & rOutMap )\n{\n lcl_AddDefaultsToMap_without_BitmapProperties( rOutMap );\n lcl_AddDefaultsToMap_only_BitmapProperties( rOutMap );\n}\n\n} \/\/ namespace chart\n<|endoftext|>"} {"text":"<commit_before>#include \"map\/crown.hpp\"\n\n#include \"map\/purchase.hpp\"\n\n#include \"metrics\/eye.hpp\"\n\n#include \"platform\/preferred_languages.hpp\"\n#include \"platform\/platform.hpp\"\n\n#include <algorithm>\n#include <array>\n#include <string>\n\n#include \"private.h\"\n\nnamespace\n{\nstd::array<std::string, 10> const kSupportedLanguages = {\"ru\", \"en\", \"fr\", \"de\", \"es\", \"it\", \"pl\",\n \"zh\", \"ar\", \"nl\"};\n} \/\/ namespace\n\nnamespace crown\n{\nbool NeedToShow(std::unique_ptr<Purchase> const & purchase)\n{\n if (!purchase || purchase->IsSubscriptionActive(SubscriptionType::BookmarkCatalog) ||\n !GetPlatform().IsConnected())\n {\n return false;\n }\n\n auto const lang = languages::GetCurrentNorm();\n auto const supportedLanguageIt = std::find(kSupportedLanguages.cbegin(),\n kSupportedLanguages.cend(), lang);\n if (supportedLanguageIt == kSupportedLanguages.cend())\n return false;\n\n auto const eyeInfo = eye::Eye::Instance().GetInfo();\n \/\/ No need to show crown when it is clicked already.\n if (eyeInfo->m_crown.m_clickedTime.time_since_epoch().count() != 0)\n return false;\n\n \/\/ Show crown in some percent of devices.\n std::hash<std::string> h;\n auto const deviceHash = h(GetPlatform().UniqueClientId());\n LOG(LINFO, (\"Crown device hash:\", deviceHash));\n return deviceHash % 100 < CROWN_PERCENT_OF_DEVICES;\n}\n} \/\/ namespace crown\n<commit_msg>[core] Changed supported launguages list for crown showing<commit_after>#include \"map\/crown.hpp\"\n\n#include \"map\/purchase.hpp\"\n\n#include \"metrics\/eye.hpp\"\n\n#include \"platform\/preferred_languages.hpp\"\n#include \"platform\/platform.hpp\"\n\n#include <algorithm>\n#include <array>\n#include <string>\n\n#include \"private.h\"\n\nnamespace\n{\nstd::array<std::string, 5> const kSupportedLanguages = {\"ru\", \"en\", \"fr\", \"de\", \"es\"};\n} \/\/ namespace\n\nnamespace crown\n{\nbool NeedToShow(std::unique_ptr<Purchase> const & purchase)\n{\n if (!purchase || purchase->IsSubscriptionActive(SubscriptionType::BookmarkCatalog) ||\n !GetPlatform().IsConnected())\n {\n return false;\n }\n\n auto const lang = languages::GetCurrentNorm();\n auto const supportedLanguageIt = std::find(kSupportedLanguages.cbegin(),\n kSupportedLanguages.cend(), lang);\n if (supportedLanguageIt == kSupportedLanguages.cend())\n return false;\n\n auto const eyeInfo = eye::Eye::Instance().GetInfo();\n \/\/ No need to show crown when it is clicked already.\n if (eyeInfo->m_crown.m_clickedTime.time_since_epoch().count() != 0)\n return false;\n\n \/\/ Show crown in some percent of devices.\n std::hash<std::string> h;\n auto const deviceHash = h(GetPlatform().UniqueClientId());\n LOG(LINFO, (\"Crown device hash:\", deviceHash));\n return deviceHash % 100 < CROWN_PERCENT_OF_DEVICES;\n}\n} \/\/ namespace crown\n<|endoftext|>"} {"text":"<commit_before>#include <QtPlugin>\n\\\n#include \"animatedtilesplugin.h\"\n#include \"animatedtilesitem.h\"\n\n\nAnimatedTilesPlugin::AnimatedTilesPlugin()\n{\n this->mName = \"AnimatedTiles\";\n this->mRole = \"animatedTiles\";\n}\n\n\nQ_EXPORT_PLUGIN2(animatedTiles, AnimatedTilesPlugin)\n\nvoid AnimatedTilesPlugin::registerPlugin(QDeclarativeContext *context)\n{\n qmlRegisterType<AnimatedTilesItem>(\"AnimatedTiles\", 1, 0, \"AnimatedTiles\");\n}\n<commit_msg>Prevent the unimplemented animated tiles from being advertized on menu<commit_after>#include <QtPlugin>\n\\\n#include \"animatedtilesplugin.h\"\n#include \"animatedtilesitem.h\"\n\n\nAnimatedTilesPlugin::AnimatedTilesPlugin()\n{\n this->mName = \"AnimatedTiles\";\n \/\/This should not be an advertized plugin until it is implemented\n \/\/this->mRole = \"animatedTiles\";\n}\n\n\nQ_EXPORT_PLUGIN2(animatedTiles, AnimatedTilesPlugin)\n\nvoid AnimatedTilesPlugin::registerPlugin(QDeclarativeContext *context)\n{\n qmlRegisterType<AnimatedTilesItem>(\"AnimatedTiles\", 1, 0, \"AnimatedTiles\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include <sys\/ioctl.h>\n#include <netpacket\/packet.h>\n#include <syslog.h>\n#include <cstdio>\n#include <boost\/bind.hpp>\n\n#include \"defs.h\"\n#include \"PortMapper.hh\"\n\n#define BUFFER_SIZE 23 \/* Mapping packet size. *\/\n#define SLEEP_TIME boost::posix_time::seconds(10)\n\nPortMapper::PortMapper(uint64_t vm_id, map<int, Interface*> *ifaces, boost::mutex *ifMutex) {\n this->id = vm_id;\n this->ifaces = ifaces;\n this->ifMutex = ifMutex;\n}\n\n\/**\n * Loops through interfaces, sending mapping packets out each, then sleeps.\n * Rinse and repeat ad infinitum.\n *\/\nvoid PortMapper::operator()() {\n while(true) {\n boost::system_time timeout = boost::get_system_time() + SLEEP_TIME;\n\n \/* Grab list of interfaces from RFClient, iterate, send map packet *\/\n {\n boost::lock_guard<boost::mutex> lock(*(this->ifMutex));\n map<int, Interface*>::iterator it;\n for (it = this->ifaces->begin(); it != this->ifaces->end(); it++) {\n this->send_port_map(*(it->second));\n }\n }\n\n boost::this_thread::sleep(timeout);\n }\n}\n\n\/**\n * Sends a portmap packet out the given interface, logging the success or\n * failure of the endeavour.\n *\/\nvoid PortMapper::send_port_map(Interface &iface) {\n if (send_packet(iface.name.c_str(), iface.port) == -1)\n syslog(LOG_NOTICE, \"Error sending mapping packet (vm_port=%d)\",\n iface.port);\n else\n syslog(LOG_DEBUG, \"Mapping packet was sent to RFVS (vm_port=%d)\",\n iface.port);\n}\n\n\/**\n * Sends the magic RouteFlow portmap packet out an interface with the given\n * name, encoding the given port number inside the message.\n *\n * Returns the number of characters sent, or -1 on failure.\n *\/\nint PortMapper::send_packet(const char ethName[], uint8_t port) {\n char msg[BUFFER_SIZE];\n char buffer[BUFSIZ];\n uint16_t ethType;\n struct ifreq req;\n struct sockaddr_ll sll;\n uint8_t srcAddress[IFHWADDRLEN];\n uint8_t dstAddress[IFHWADDRLEN] = { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n int ifindex, addrLen, SockFd;\n int error = -1;\n\n SockFd = socket(PF_PACKET, SOCK_RAW, htons(RF_ETH_PROTO));\n\n memset(&req, 0, sizeof(req));\n strcpy(req.ifr_name, ethName);\n if (ioctl(SockFd, SIOCGIFFLAGS, &req) < 0) {\n goto exit;\n }\n\n \/* If the interface is down we can't send the packet. *\/\n syslog(LOG_INFO, \"FLAG %d\\n\", req.ifr_flags & IFF_UP);\n if (!(req.ifr_flags & IFF_UP)) {\n goto exit;\n }\n\n \/* Get the interface index. *\/\n if (ioctl(SockFd, SIOCGIFINDEX, &req) < 0) {\n goto exit;\n }\n\n \/* Get the MAC address. *\/\n ifindex = req.ifr_ifindex;\n if (ioctl(SockFd, SIOCGIFHWADDR, &req) < 0) {\n goto exit;\n }\n memcpy(srcAddress, req.ifr_hwaddr.sa_data, IFHWADDRLEN);\n\n \/* Bind to the socket. *\/\n memset(&sll, 0, sizeof(struct sockaddr_ll));\n sll.sll_family = PF_PACKET;\n sll.sll_ifindex = ifindex;\n addrLen = sizeof(sll);\n if (bind(SockFd, (struct sockaddr *) &sll, addrLen) < 0) {\n goto exit;\n }\n\n \/* Construct the packet and send it. *\/\n memset(msg, 0, BUFFER_SIZE);\n memcpy((void *) msg, (void *) dstAddress, IFHWADDRLEN);\n memcpy((void *) (msg + IFHWADDRLEN), (void *) srcAddress, IFHWADDRLEN);\n ethType = htons(RF_ETH_PROTO);\n memcpy((void *) (msg + 2 * IFHWADDRLEN), (void *) ðType,\n sizeof(uint16_t));\n memcpy((void *) (msg + 14), (void *) &this->id, sizeof(uint64_t));\n memcpy((void *) (msg + 22), (void *) &port, sizeof(uint8_t));\n error = (sendto(SockFd, msg, BUFFER_SIZE, 0, (struct sockaddr *) &sll,\n (socklen_t) addrLen));\n\nexit:\n if (error) {\n strerror_r(errno, buffer, BUFSIZ);\n syslog(LOG_ERR, \"send_packet(): %s\", buffer);\n }\n close(SockFd);\n return error;\n}\n<commit_msg>Improve PortMapper logging<commit_after>#include <sys\/ioctl.h>\n#include <netpacket\/packet.h>\n#include <syslog.h>\n#include <cstdio>\n#include <boost\/bind.hpp>\n\n#include \"defs.h\"\n#include \"PortMapper.hh\"\n\n#define BUFFER_SIZE 23 \/* Mapping packet size. *\/\n#define SLEEP_TIME boost::posix_time::seconds(10)\n\nPortMapper::PortMapper(uint64_t vm_id, map<int, Interface*> *ifaces, boost::mutex *ifMutex) {\n this->id = vm_id;\n this->ifaces = ifaces;\n this->ifMutex = ifMutex;\n}\n\n\/**\n * Loops through interfaces, sending mapping packets out each, then sleeps.\n * Rinse and repeat ad infinitum.\n *\/\nvoid PortMapper::operator()() {\n while(true) {\n boost::system_time timeout = boost::get_system_time() + SLEEP_TIME;\n\n \/* Grab list of interfaces from RFClient, iterate, send map packet *\/\n {\n boost::lock_guard<boost::mutex> lock(*(this->ifMutex));\n map<int, Interface*>::iterator it;\n for (it = this->ifaces->begin(); it != this->ifaces->end(); it++) {\n this->send_port_map(*(it->second));\n }\n }\n\n boost::this_thread::sleep(timeout);\n }\n}\n\n\/**\n * Sends a portmap packet out the given interface, logging the success or\n * failure of the endeavour.\n *\/\nvoid PortMapper::send_port_map(Interface &iface) {\n if (send_packet(iface.name.c_str(), iface.port) == -1)\n syslog(LOG_NOTICE, \"Error sending mapping packet (vm_port=%d)\",\n iface.port);\n else\n syslog(LOG_DEBUG, \"Mapping packet was sent to RFVS (vm_port=%d)\",\n iface.port);\n}\n\n\/**\n * Sends the magic RouteFlow portmap packet out an interface with the given\n * name, encoding the given port number inside the message.\n *\n * Returns the number of characters sent, or -1 on failure.\n *\/\nint PortMapper::send_packet(const char ethName[], uint8_t port) {\n char msg[BUFFER_SIZE];\n char buffer[BUFSIZ];\n uint16_t ethType;\n struct ifreq req;\n struct sockaddr_ll sll;\n uint8_t srcAddress[IFHWADDRLEN];\n uint8_t dstAddress[IFHWADDRLEN] = { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 };\n int ifindex, addrLen, SockFd;\n int error = -1;\n\n SockFd = socket(PF_PACKET, SOCK_RAW, htons(RF_ETH_PROTO));\n\n memset(&req, 0, sizeof(req));\n strcpy(req.ifr_name, ethName);\n if (ioctl(SockFd, SIOCGIFFLAGS, &req) < 0) {\n goto exit;\n }\n\n \/* If the interface is down we can't send the packet. *\/\n if (!(req.ifr_flags & IFF_UP)) {\n goto exit;\n }\n\n \/* Get the interface index. *\/\n if (ioctl(SockFd, SIOCGIFINDEX, &req) < 0) {\n goto exit;\n }\n\n \/* Get the MAC address. *\/\n ifindex = req.ifr_ifindex;\n if (ioctl(SockFd, SIOCGIFHWADDR, &req) < 0) {\n goto exit;\n }\n memcpy(srcAddress, req.ifr_hwaddr.sa_data, IFHWADDRLEN);\n\n \/* Bind to the socket. *\/\n memset(&sll, 0, sizeof(struct sockaddr_ll));\n sll.sll_family = PF_PACKET;\n sll.sll_ifindex = ifindex;\n addrLen = sizeof(sll);\n if (bind(SockFd, (struct sockaddr *) &sll, addrLen) < 0) {\n goto exit;\n }\n\n \/* Construct the packet and send it. *\/\n memset(msg, 0, BUFFER_SIZE);\n memcpy((void *) msg, (void *) dstAddress, IFHWADDRLEN);\n memcpy((void *) (msg + IFHWADDRLEN), (void *) srcAddress, IFHWADDRLEN);\n ethType = htons(RF_ETH_PROTO);\n memcpy((void *) (msg + 2 * IFHWADDRLEN), (void *) ðType,\n sizeof(uint16_t));\n memcpy((void *) (msg + 14), (void *) &this->id, sizeof(uint64_t));\n memcpy((void *) (msg + 22), (void *) &port, sizeof(uint8_t));\n error = (sendto(SockFd, msg, BUFFER_SIZE, 0, (struct sockaddr *) &sll,\n (socklen_t) addrLen));\n\nexit:\n if (error <= 0) {\n strerror_r(errno, buffer, BUFSIZ);\n syslog(LOG_ERR, \"send_packet(): %s\", buffer);\n }\n close(SockFd);\n return error;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ofApp.h\"\n\nusing namespace cv;\nusing namespace ofxCv;\n\nfloat ofApp::_(string name) {\n\treturn panel.getValueF(name);\n}\n\nvoid ofApp::_(string name, float x) {\n\tpanel.setValueF(name, x);\n}\n\nvoid ofApp::setup() {\n\tofSetDataPathRoot(\"..\/..\/..\/..\/..\/SharedData\/\");\n\tofSetVerticalSync(true);\n\tofSetFrameRate(60);\n\t\n\tloadDmxSettings();\n\tsetupControlPanel();\n\t\n\tdmx.connect(port, modules * channelsPerModule);\n\tdmx.update(true); \/\/ black on startup\n\t\n\tprevious.allocate(kinect.getWidth(), kinect.getHeight(), OF_IMAGE_GRAYSCALE);\n\tdiff.allocate(kinect.getWidth(), kinect.getHeight(), OF_IMAGE_GRAYSCALE);\n\tkinect.setup();\n\t\n\tloadSounds();\n}\n\nvoid ofApp::loadSounds() {\n\tsounds.clear();\n\tofxXmlSettings xml;\n\txml.loadFile(\"sounds.xml\");\n\tint n = xml.getNumTags(\"sound\");\n\tfor(int i = 0; i < n; i++) {\n\t\tPulse cur;\n\t\txml.pushTag(\"sound\", i);\n\t\tcur.load(xml);\n\t\txml.popTag();\n\t\tsounds.push_back(cur);\n\t}\n}\n\nvoid ofApp::loadDmxSettings() {\n\tofxXmlSettings xml(\"dmx.xml\");\n\tport = xml.getValue(\"port\", \"\");\n\tmodules = xml.getValue(\"modules\", 10);\n\tchannelsPerModule = xml.getValue(\"channelsPerModule\", 4);\n}\n\nvoid ofApp::setupControlPanel() {\n\tpanel.setup(256, 768);\n\tpanel.setPosition(0, 0);\n\tpanel.addPanel(\"sound and movement\");\n\tpanel.addToggle(\"useAdapt\", true);\n\tpanel.addSlider(\"adaptRate\", .01, .0001, .05);\n\tpanel.addSlider(\"energyGrow\", .1, 0, 1);\n\tpanel.addSlider(\"energyDecay\", -.1, -.5, 0);\n\tpanel.addSlider(\"energyMax\", 20, 0, 48);\n\tpanel.addSlider(\"overallEnergy\", 0, 0, 1);\n\tpanel.addSlider(\"minimumPresence\", -.8, -2, 0);\n\tpanel.addSlider(\"pulseRange\", .6, 0, 1);\n\t\n\tpanel.addPanel(\"virtual camera\");\n\tfloat maxPosition = 4000;\n\tpanel.addSlider(\"x\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"y\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"z\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"xcr\", 0, -180, 180);\n\tpanel.addSlider(\"ycr\", 0, -180, 180);\n\tpanel.addSlider(\"zcr\", 0, -180, 180);\n\tpanel.addSlider(\"xsr\", 0, -180, 180);\n\tpanel.addSlider(\"ysr\", 0, -180, 180);\n\tpanel.addSlider(\"zsr\", 0, -180, 180);\n\tpanel.addSlider(\"near\", 0, 0, maxPosition);\n\tpanel.addSlider(\"far\", maxPosition, 0, maxPosition);\n\tpanel.addSlider(\"maxLen\", 100, 0, maxPosition);\n\tpanel.addSlider(\"stepSize\", 2, 1, 16, true);\n\tpanel.addSlider(\"orthoScale\", 10, 0, 32);\n\tpanel.addToggle(\"horizontalFlip\", false);\n\t\n\tpanel.addPanel(\"lighting modules\");\n\tpanel.addToggle(\"saveCurves\", false);\n\tpanel.addToggle(\"loadCurves\", false);\n\tpanel.addSlider(\"saturation\", 255, 0, 255);\n\tpanel.addSlider(\"brightness\", 255, 0, 255);\n\tfor(int module = 1; module <= modules; module++) {\n\t\tstring label = \"mod\" + ofToString(module);\n\t\tpanel.addSlider(label, 0, 0, 1);\n\t}\t\n\tpanel.loadSettings(\"settings.xml\");\n\t\n\tredCurve.setup(256);\n\tgreenCurve.setup(256);\n\tblueCurve.setup(256);\n\tpanel.setValueB(\"loadCurves\", true);\n}\n\nvoid ofApp::exit() {\n\tdmx.clear();\n\tdmx.update(true); \/\/ black on shutdown\n}\n\nofColor ofApp::rastafari(float x) {\n\treturn ofColor::fromHsb(x * 255. \/ 3., _(\"saturation\"), _(\"brightness\"));\n}\n\nvoid ofApp::update() {\n\tupdateVirtualKinect();\n\tupdateDmx();\n\tupdateSounds();\n}\n\nvoid ofApp::updateVirtualKinect() {\n\tofVec3f position(_(\"x\"), _(\"y\"), _(\"z\"));\n\tofVec3f cameraRotation(_(\"xcr\"), _(\"ycr\"), _(\"zcr\"));\n\tofVec3f sceneRotation(_(\"xsr\"), _(\"ysr\"), _(\"zsr\"));\n\tkinect.setPosition(position);\n\tkinect.setCameraRotation(cameraRotation);\n\tkinect.setSceneRotation(sceneRotation);\n\tkinect.setClipping(_(\"near\"), _(\"far\"));\n\tkinect.setStepSize(_(\"stepSize\"));\n\tkinect.setMaxLen(_(\"maxLen\"));\n\tkinect.setOrthoScale(_(\"orthoScale\"));\n\tkinect.setHorizontalFlip(_(\"horizontalFlip\"));\n\t\n\tkinect.update();\n\tif(kinect.isFrameNew()) {\n\t\tabsdiff(kinect, previous, diff);\n\t\t\/\/ only use pixels that have data both frames\n\t\t\/\/Mat kinectMat = toCv(kinect), previousMat = toCv(previous), diffMat = toCv(diff);\n\t\t\/\/diffMat &= (kinectMat > 0) & (previousMat > 0);\n\t\tdiff.update();\n\t\tcopy(kinect, previous);\n\t\trawMean = (Mat_<float>) meanCols(toCv(diff));\n\t\tif(runningMean.rows != rawMean.rows) {\n\t\t\trunningMean = Mat_<float>::zeros(rawMean.rows, 1);\n\t\t\tenergy = Mat_<float>::zeros(rawMean.rows, 1);\n\t\t}\n\t\taccumulateWeighted(rawMean, runningMean, _(\"adaptRate\"));\n\t\tsubtract(rawMean, runningMean, adaptedMean);\n\t\tMat& cur = _(\"useAdapt\") ? adaptedMean : rawMean;\n\t\tmax(cur, 0, cur);\n\t\taddWeighted(cur, _(\"energyGrow\"), energy, 1, _(\"energyDecay\"), energy);\n\t\tmin(max(energy, 0), _(\"energyMax\"), energy);\n\t\tresize(energy, moduleEnergy, cv::Size(1, modules), 0, 0, INTER_AREA);\n\t\tmoduleEnergy \/= _(\"energyMax\");\n\t\t\n\t\tfor(int i = 0; i < moduleEnergy.rows; i++) {\n\t\t\tint module = i + 1;\n\t\t\t_(\"mod\" + ofToString(module), moduleEnergy.at<float>(i));\n\t\t}\n\t}\n}\n\nvoid ofApp::updateDmx() {\n\tif(panel.getValueB(\"saveCurves\")) {\n\t\tredCurve.save(\"redCurve.yml\");\n\t\tgreenCurve.save(\"greenCurve.yml\");\n\t\tblueCurve.save(\"blueCurve.yml\");\n\t\tpanel.setValueB(\"saveCurves\", false);\n\t}\n\tif(panel.getValueB(\"loadCurves\")) {\n\t\tredCurve.load(\"redCurve.yml\");\n\t\tgreenCurve.load(\"greenCurve.yml\");\n\t\tblueCurve.load(\"blueCurve.yml\");\n\t\tpanel.setValueB(\"loadCurves\", false);\n\t}\n\t\n\tint channel = 1;\n\tfor(int module = 1; module <= modules; module++) {\n\t\tofColor cur = rastafari(_(\"mod\" + ofToString(module)));\n\t\tdmx.setLevel(channel++, redCurve[cur.r]);\n\t\tdmx.setLevel(channel++, greenCurve[cur.g]);\n\t\tdmx.setLevel(channel++, blueCurve[cur.b]);\n\t\tchannel++;\n\t}\n\tcout << endl;\n\tif(dmx.isConnected()) {\n\t\tdmx.update();\n\t} else {\n\t\tpanel.msg = \"Could not connect to port \" + port;\n\t}\n}\n\nvoid ofApp::updateSounds() {\n\tfloat endVolume = ofMap(_(\"overallEnergy\"), 0, 1, _(\"minimumPresence\"), 1, true);\n\tfloat pulseSpeed = ofMap(_(\"overallEnergy\"), 0, 1, 1 + _(\"pulseRange\"), 1 - _(\"pulseRange\"), true);\n\tfor(int i = 0; i < sounds.size(); i++) {\n\t\tfloat curVolume = ofMap(i, 0, sounds.size() - 1, 1, endVolume);\n\t\tsounds[i].setVolume(MAX(curVolume, 0));\n\t\tsounds[i].setPulseSpeed(pulseSpeed);\n\t\tsounds[i].update();\n\t}\n}\n\nvoid ofApp::drawVirtualKinect() {\n\tofPushMatrix();\n\tofSetColor(255);\n\tofTranslate(512, 0);\n\tkinect.draw(0, 0);\n\t\n\tofEnableBlendMode(OF_BLENDMODE_ADD);\n\tofSetColor(yellowPrint);\n\tdiff.draw(0, 0);\n\tofEnableAlphaBlending();\n\tofDisableBlendMode();\n\t\n\tofPushStyle();\n\tofSetLineWidth(3);\n\tofNoFill();\n\t\n\tofPushMatrix();\n\tofTranslate(0, kinect.getHeight());\n\tofScale(1, -10);\n\t\n\tofSetColor(ofColor::white);\n\tofBeginShape();\n\tfor(int i = 0; i < energy.rows; i++) {\n\t\tofVertex(i, energy.at<float>(i));\n\t}\n\tofEndShape();\n\t\n\tofSetColor(128);\n\tofLine(0, _(\"energyMax\"), kinect.getWidth(), _(\"energyMax\"));\n\t\n\tofSetColor(yellowPrint);\n\tofBeginShape();\n\tfor(int i = 0; i < rawMean.rows; i++) {\n\t\tofVertex(i, rawMean.at<float>(i));\n\t}\n\tofEndShape();\n\t\n\tif(_(\"useAdapt\")) {\n\t\tofSetColor(cyanPrint);\n\t\tofBeginShape();\n\t\tfor(int i = 0; i < runningMean.rows; i++) {\n\t\t\tofVertex(i, runningMean.at<float>(i));\n\t\t}\n\t\tofEndShape();\n\t\t\n\t\tofSetColor(magentaPrint);\n\t\tofBeginShape();\n\t\tfor(int i = 0; i < adaptedMean.rows; i++) {\n\t\t\tofVertex(i, adaptedMean.at<float>(i));\n\t\t}\n\t\tofEndShape();\n\t}\n\t\n\tofPopMatrix();\n\t\n\tdrawHighlightString(\"energy\", 4, 4);\n\tdrawHighlightString(\"raw\", 4, 24, ofColor::black, yellowPrint);\n\tif(_(\"useAdapt\")) {\n\t\tdrawHighlightString(\"running\", 4, 44, ofColor::black, cyanPrint);\n\t\tdrawHighlightString(\"adapt\", 4, 64, ofColor::black, magentaPrint);\n\t}\n\t\n\tofPopStyle();\n\tofPopMatrix();\n}\n\nvoid ofApp::drawDmx() {\n\tofPushMatrix();\n\tofTranslate(256, 0);\n\tredCurve.draw(0, 0);\n\tgreenCurve.draw(0, 256);\n\tblueCurve.draw(0, 512);\n\t\n\tofTranslate(256, 480);\n\tint channel = 1;\n\tfor(int module = 1; module <= modules; module++) {\n\t\tstring label = \"mod\" + ofToString(module);\n\t\tint rc = channel++;\n\t\tint gc = channel++;\n\t\tint bc = channel++;\n\t\tint ac = channel++;\n\t\tint r = dmx.getLevel(rc), g = dmx.getLevel(gc), b = dmx.getLevel(bc);\n\t\tofSetColor(r, g, b);\n\t\tofFill();\n\t\tofRect(4, module * 16, 14, 14);\n\t\tofSetColor(255);\n\t\tofNoFill();\n\t\tofRect(4, module * 16, 14, 14);\n\t\tstring rs = ofToString(rc) + \":\" + ofToString(r);\n\t\tstring gs = ofToString(gc) + \":\" + ofToString(g);\n\t\tstring bs = ofToString(bc) + \":\" + ofToString(b);\n\t\tstring text = label + \" (\" + rs + \", \" + gs + \", \" + bs + \")\";\n\t\tdrawHighlightString(text, 24, module * 16 - 2);\n\t}\n\t\n\tofPopMatrix();\n}\n\nvoid ofApp::drawSounds() {\n\tofPushMatrix();\n\tofTranslate(800, 480 + 16);\n\tfor(int i = 0; i < sounds.size(); i++) {\n\t\tsounds[i].draw();\n\t\tofTranslate(0, 20);\n\t}\n\tofPopMatrix();\n}\n\nvoid ofApp::draw() {\n\tif(panel.hidden) {\n\t\tofPushMatrix();\n\t\tfloat spacing = ofGetWidth() \/ modules;\n\t\tint channel = 1;\n\t\tfor(int module = 1; module <= modules; module++) {\n\t\t\tstring label = \"mod\" + ofToString(module);\n\t\t\tint rc = channel++;\n\t\t\tint gc = channel++;\n\t\t\tint bc = channel++;\n\t\t\tint ac = channel++;\n\t\t\tint r = dmx.getLevel(rc), g = dmx.getLevel(gc), b = dmx.getLevel(bc);\n\t\t\tofSetColor(r, g, b);\n\t\t\tofFill();\n\t\t\tofRect(0, 0, spacing, ofGetHeight());\n\t\t\tofTranslate(spacing, 0);\n\t\t}\n\t\tofPopMatrix();\n\t} else {\n\t\tofBackground(127);\n\t\tdrawVirtualKinect();\n\t\tdrawDmx();\n\t\tdrawSounds();\n\t}\n}\n\n<commit_msg>connected movement to sound<commit_after>#include \"ofApp.h\"\n\nusing namespace cv;\nusing namespace ofxCv;\n\nfloat ofApp::_(string name) {\n\treturn panel.getValueF(name);\n}\n\nvoid ofApp::_(string name, float x) {\n\tpanel.setValueF(name, x);\n}\n\nvoid ofApp::setup() {\n\tofSetDataPathRoot(\"..\/..\/..\/..\/..\/SharedData\/\");\n\tofSetVerticalSync(true);\n\tofSetFrameRate(60);\n\t\n\tloadDmxSettings();\n\tsetupControlPanel();\n\t\n\tdmx.connect(port, modules * channelsPerModule);\n\tdmx.update(true); \/\/ black on startup\n\t\n\tprevious.allocate(kinect.getWidth(), kinect.getHeight(), OF_IMAGE_GRAYSCALE);\n\tdiff.allocate(kinect.getWidth(), kinect.getHeight(), OF_IMAGE_GRAYSCALE);\n\tkinect.setup();\n\t\n\tloadSounds();\n}\n\nvoid ofApp::loadSounds() {\n\tsounds.clear();\n\tofxXmlSettings xml;\n\txml.loadFile(\"sounds.xml\");\n\tint n = xml.getNumTags(\"sound\");\n\tfor(int i = 0; i < n; i++) {\n\t\tPulse cur;\n\t\txml.pushTag(\"sound\", i);\n\t\tcur.load(xml);\n\t\txml.popTag();\n\t\tsounds.push_back(cur);\n\t}\n}\n\nvoid ofApp::loadDmxSettings() {\n\tofxXmlSettings xml(\"dmx.xml\");\n\tport = xml.getValue(\"port\", \"\");\n\tmodules = xml.getValue(\"modules\", 10);\n\tchannelsPerModule = xml.getValue(\"channelsPerModule\", 4);\n}\n\nvoid ofApp::setupControlPanel() {\n\tpanel.setup(256, 768);\n\tpanel.setPosition(0, 0);\n\tpanel.addPanel(\"sound and movement\");\n\tpanel.addToggle(\"useAdapt\", true);\n\tpanel.addSlider(\"adaptRate\", .01, .0001, .05);\n\tpanel.addSlider(\"energyGrow\", .1, 0, 1);\n\tpanel.addSlider(\"energyDecay\", -.1, -.5, 0);\n\tpanel.addSlider(\"energyMax\", 20, 0, 48);\n\tpanel.addSlider(\"overallEnergy\", 0, 0, 1);\n\tpanel.addSlider(\"minimumPresence\", -.8, -2, 0);\n\tpanel.addSlider(\"pulseRange\", .6, 0, 1);\n\t\n\tpanel.addPanel(\"virtual camera\");\n\tfloat maxPosition = 4000;\n\tpanel.addSlider(\"x\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"y\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"z\", 0, -maxPosition, maxPosition);\n\tpanel.addSlider(\"xcr\", 0, -180, 180);\n\tpanel.addSlider(\"ycr\", 0, -180, 180);\n\tpanel.addSlider(\"zcr\", 0, -180, 180);\n\tpanel.addSlider(\"xsr\", 0, -180, 180);\n\tpanel.addSlider(\"ysr\", 0, -180, 180);\n\tpanel.addSlider(\"zsr\", 0, -180, 180);\n\tpanel.addSlider(\"near\", 0, 0, maxPosition);\n\tpanel.addSlider(\"far\", maxPosition, 0, maxPosition);\n\tpanel.addSlider(\"maxLen\", 100, 0, maxPosition);\n\tpanel.addSlider(\"stepSize\", 2, 1, 16, true);\n\tpanel.addSlider(\"orthoScale\", 10, 0, 32);\n\tpanel.addToggle(\"horizontalFlip\", false);\n\t\n\tpanel.addPanel(\"lighting modules\");\n\tpanel.addToggle(\"saveCurves\", false);\n\tpanel.addToggle(\"loadCurves\", false);\n\tpanel.addSlider(\"saturation\", 255, 0, 255);\n\tpanel.addSlider(\"brightness\", 255, 0, 255);\n\tfor(int module = 1; module <= modules; module++) {\n\t\tstring label = \"mod\" + ofToString(module);\n\t\tpanel.addSlider(label, 0, 0, 1);\n\t}\t\n\tpanel.loadSettings(\"settings.xml\");\n\t\n\tredCurve.setup(256);\n\tgreenCurve.setup(256);\n\tblueCurve.setup(256);\n\tpanel.setValueB(\"loadCurves\", true);\n}\n\nvoid ofApp::exit() {\n\tdmx.clear();\n\tdmx.update(true); \/\/ black on shutdown\n}\n\nofColor ofApp::rastafari(float x) {\n\treturn ofColor::fromHsb(x * 255. \/ 3., _(\"saturation\"), _(\"brightness\"));\n}\n\nvoid ofApp::update() {\n\tupdateVirtualKinect();\n\tupdateDmx();\n\tupdateSounds();\n}\n\nvoid ofApp::updateVirtualKinect() {\n\tofVec3f position(_(\"x\"), _(\"y\"), _(\"z\"));\n\tofVec3f cameraRotation(_(\"xcr\"), _(\"ycr\"), _(\"zcr\"));\n\tofVec3f sceneRotation(_(\"xsr\"), _(\"ysr\"), _(\"zsr\"));\n\tkinect.setPosition(position);\n\tkinect.setCameraRotation(cameraRotation);\n\tkinect.setSceneRotation(sceneRotation);\n\tkinect.setClipping(_(\"near\"), _(\"far\"));\n\tkinect.setStepSize(_(\"stepSize\"));\n\tkinect.setMaxLen(_(\"maxLen\"));\n\tkinect.setOrthoScale(_(\"orthoScale\"));\n\tkinect.setHorizontalFlip(_(\"horizontalFlip\"));\n\t\n\tkinect.update();\n\tif(kinect.isFrameNew()) {\n\t\tabsdiff(kinect, previous, diff);\n\t\t\/\/ only use pixels that have data both frames\n\t\t\/\/Mat kinectMat = toCv(kinect), previousMat = toCv(previous), diffMat = toCv(diff);\n\t\t\/\/diffMat &= (kinectMat > 0) & (previousMat > 0);\n\t\tdiff.update();\n\t\tcopy(kinect, previous);\n\t\trawMean = (Mat_<float>) meanCols(toCv(diff));\n\t\tif(runningMean.rows != rawMean.rows) {\n\t\t\trunningMean = Mat_<float>::zeros(rawMean.rows, 1);\n\t\t\tenergy = Mat_<float>::zeros(rawMean.rows, 1);\n\t\t}\n\t\taccumulateWeighted(rawMean, runningMean, _(\"adaptRate\"));\n\t\tsubtract(rawMean, runningMean, adaptedMean);\n\t\tMat& cur = _(\"useAdapt\") ? adaptedMean : rawMean;\n\t\tmax(cur, 0, cur);\n\t\taddWeighted(cur, _(\"energyGrow\"), energy, 1, _(\"energyDecay\"), energy);\n\t\tmin(max(energy, 0), _(\"energyMax\"), energy);\n\t\tresize(energy, moduleEnergy, cv::Size(1, modules), 0, 0, INTER_AREA);\n\t\tmoduleEnergy \/= _(\"energyMax\");\n\t\t\n\t\t_(\"overallEnergy\", 0);\n\t\tfor(int i = 0; i < moduleEnergy.rows; i++) {\n\t\t\tint module = i + 1;\n\t\t\tfloat cur = moduleEnergy.at<float>(i);\n\t\t\t_(\"mod\" + ofToString(module), cur);\n\t\t\t_(\"overallEnergy\", MAX(_(\"overallEnergy\"), cur));\n\t\t}\n\t}\n}\n\nvoid ofApp::updateDmx() {\n\tif(panel.getValueB(\"saveCurves\")) {\n\t\tredCurve.save(\"redCurve.yml\");\n\t\tgreenCurve.save(\"greenCurve.yml\");\n\t\tblueCurve.save(\"blueCurve.yml\");\n\t\tpanel.setValueB(\"saveCurves\", false);\n\t}\n\tif(panel.getValueB(\"loadCurves\")) {\n\t\tredCurve.load(\"redCurve.yml\");\n\t\tgreenCurve.load(\"greenCurve.yml\");\n\t\tblueCurve.load(\"blueCurve.yml\");\n\t\tpanel.setValueB(\"loadCurves\", false);\n\t}\n\t\n\tint channel = 1;\n\tfor(int module = 1; module <= modules; module++) {\n\t\tofColor cur = rastafari(_(\"mod\" + ofToString(module)));\n\t\tdmx.setLevel(channel++, redCurve[cur.r]);\n\t\tdmx.setLevel(channel++, greenCurve[cur.g]);\n\t\tdmx.setLevel(channel++, blueCurve[cur.b]);\n\t\tchannel++;\n\t}\n\tif(dmx.isConnected()) {\n\t\tdmx.update();\n\t} else {\n\t\tpanel.msg = \"Could not connect to port \" + port;\n\t}\n}\n\nvoid ofApp::updateSounds() {\n\tfloat endVolume = ofMap(_(\"overallEnergy\"), 0, 1, _(\"minimumPresence\"), 1, true);\n\tfloat pulseSpeed = ofMap(_(\"overallEnergy\"), 0, 1, 1 + _(\"pulseRange\"), 1 - _(\"pulseRange\"), true);\n\tfor(int i = 0; i < sounds.size(); i++) {\n\t\tfloat curVolume = ofMap(i, 0, sounds.size() - 1, 1, endVolume);\n\t\tsounds[i].setVolume(MAX(curVolume, 0));\n\t\tsounds[i].setPulseSpeed(pulseSpeed);\n\t\tsounds[i].update();\n\t}\n}\n\nvoid ofApp::drawVirtualKinect() {\n\tofPushMatrix();\n\tofSetColor(255);\n\tofTranslate(512, 0);\n\tkinect.draw(0, 0);\n\t\n\tofEnableBlendMode(OF_BLENDMODE_ADD);\n\tofSetColor(yellowPrint);\n\tdiff.draw(0, 0);\n\tofEnableAlphaBlending();\n\tofDisableBlendMode();\n\t\n\tofPushStyle();\n\tofSetLineWidth(3);\n\tofNoFill();\n\t\n\tofPushMatrix();\n\tofTranslate(0, kinect.getHeight());\n\tofScale(1, -10);\n\t\n\tofSetColor(ofColor::white);\n\tofBeginShape();\n\tfor(int i = 0; i < energy.rows; i++) {\n\t\tofVertex(i, energy.at<float>(i));\n\t}\n\tofEndShape();\n\t\n\tofSetColor(128);\n\tofLine(0, _(\"energyMax\"), kinect.getWidth(), _(\"energyMax\"));\n\t\n\tofSetColor(yellowPrint);\n\tofBeginShape();\n\tfor(int i = 0; i < rawMean.rows; i++) {\n\t\tofVertex(i, rawMean.at<float>(i));\n\t}\n\tofEndShape();\n\t\n\tif(_(\"useAdapt\")) {\n\t\tofSetColor(cyanPrint);\n\t\tofBeginShape();\n\t\tfor(int i = 0; i < runningMean.rows; i++) {\n\t\t\tofVertex(i, runningMean.at<float>(i));\n\t\t}\n\t\tofEndShape();\n\t\t\n\t\tofSetColor(magentaPrint);\n\t\tofBeginShape();\n\t\tfor(int i = 0; i < adaptedMean.rows; i++) {\n\t\t\tofVertex(i, adaptedMean.at<float>(i));\n\t\t}\n\t\tofEndShape();\n\t}\n\t\n\tofPopMatrix();\n\t\n\tdrawHighlightString(\"energy\", 4, 4);\n\tdrawHighlightString(\"raw\", 4, 24, ofColor::black, yellowPrint);\n\tif(_(\"useAdapt\")) {\n\t\tdrawHighlightString(\"running\", 4, 44, ofColor::black, cyanPrint);\n\t\tdrawHighlightString(\"adapt\", 4, 64, ofColor::black, magentaPrint);\n\t}\n\t\n\tofPopStyle();\n\tofPopMatrix();\n}\n\nvoid ofApp::drawDmx() {\n\tofPushMatrix();\n\tofTranslate(256, 0);\n\tredCurve.draw(0, 0);\n\tgreenCurve.draw(0, 256);\n\tblueCurve.draw(0, 512);\n\t\n\tofTranslate(256 + 14, 480);\n\tint channel = 1;\n\tfor(int module = 1; module <= modules; module++) {\n\t\tstring label = \"mod\" + ofToString(module);\n\t\tint rc = channel++;\n\t\tint gc = channel++;\n\t\tint bc = channel++;\n\t\tint ac = channel++;\n\t\tint r = dmx.getLevel(rc), g = dmx.getLevel(gc), b = dmx.getLevel(bc);\n\t\tofSetColor(r, g, b);\n\t\tofFill();\n\t\tofRect(4, module * 16, 14, 14);\n\t\tofSetColor(255);\n\t\tofNoFill();\n\t\tofRect(4, module * 16, 14, 14);\n\t\tstring rs = ofToString(rc) + \":\" + ofToString(r);\n\t\tstring gs = ofToString(gc) + \":\" + ofToString(g);\n\t\tstring bs = ofToString(bc) + \":\" + ofToString(b);\n\t\tstring text = label + \" (\" + rs + \", \" + gs + \", \" + bs + \")\";\n\t\tdrawHighlightString(text, 24, module * 16 - 2);\n\t}\n\t\n\tofPopMatrix();\n}\n\nvoid ofApp::drawSounds() {\n\tofPushMatrix();\n\tofTranslate(800, 480 + 16);\n\tfor(int i = 0; i < sounds.size(); i++) {\n\t\tsounds[i].draw();\n\t\tofTranslate(0, 20);\n\t}\n\tofPopMatrix();\n}\n\nvoid ofApp::draw() {\n\tif(panel.hidden) {\n\t\tofPushMatrix();\n\t\tfloat spacing = ofGetWidth() \/ modules;\n\t\tint channel = 1;\n\t\tfor(int module = 1; module <= modules; module++) {\n\t\t\tstring label = \"mod\" + ofToString(module);\n\t\t\tint rc = channel++;\n\t\t\tint gc = channel++;\n\t\t\tint bc = channel++;\n\t\t\tint ac = channel++;\n\t\t\tint r = dmx.getLevel(rc), g = dmx.getLevel(gc), b = dmx.getLevel(bc);\n\t\t\tofSetColor(r, g, b);\n\t\t\tofFill();\n\t\t\tofRect(0, 0, spacing, ofGetHeight());\n\t\t\tofTranslate(spacing, 0);\n\t\t}\n\t\tofPopMatrix();\n\t} else {\n\t\tofBackground(127);\n\t\tdrawVirtualKinect();\n\t\tdrawDmx();\n\t\tdrawSounds();\n\t}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2014 Michael Fink\n\/\/\n\/\/\/ \\file PsrecSourceDeviceImpl.hpp PS-ReC - SourceDevice impl\n\/\/\n#pragma once\n\n\/\/ includes\n#include \"SourceDevice.hpp\"\n#include \"PsrecCommon.hpp\"\n#include \"PsrecRemoteReleaseControlImpl.hpp\"\n#include \"PsrecPropertyAccess.hpp\"\n#include \"PsrecDeviceInfo.hpp\"\n\nnamespace PSREC\n{\n\n\/\/\/ source device impl for PSREC\nclass SourceDeviceImpl:\n public SourceDevice,\n public std::enable_shared_from_this<SourceDeviceImpl>\n{\npublic:\n \/\/\/ ctor\n SourceDeviceImpl(RefSp spRef, prDeviceInfoTable& deviceInfo)\n :m_spRef(spRef),\n m_hCamera(0)\n {\n LOG_TRACE(_T(\"about to call PR_CreateCameraObject...\\n\"));\n\n prHandle hCamera = 0;\n \/\/ may return prINVALID_FN_CALL when SDK wasn't initialized\n \/\/ may return prINVALID_PARAMETER when specified device info is invalid\n \/\/ may return prMEM_ALLOC_FAILED on memory error\n prResponse err = PR_CreateCameraObject(&deviceInfo, &hCamera);\n LOG_TRACE(_T(\"PR_CreateCameraObject(&si = \\\"%ls\\\", &handle) returned %08x, handle %08x\\n\"),\n deviceInfo.ModelName, err, hCamera);\n CheckError(_T(\"PR_CreateCameraObject\"), err, __FILE__, __LINE__);\n\n m_hCamera = hCamera;\n\n \/\/ connect to camera itself\n \/\/ may return prINVALID_FN_CALL, prINVALID_HANDLE, prMEM_ALLOC_FAILED\n err = PR_ConnectCamera(m_hCamera);\n LOG_TRACE(_T(\"PR_ConnectCamera(handle = %08x) returned %08x\\n\"), m_hCamera, err);\n CheckError(_T(\"PR_ConnectCamera\"), err, __FILE__, __LINE__);\n\n \/\/ get device info so that we don't have to query every time\n m_spDeviceInfo.reset(new DeviceInfo(m_hCamera));\n }\n\n \/\/\/ dtor\n virtual ~SourceDeviceImpl() throw()\n {\n \/\/ disconnect from camera\n prResponse err = PR_DisconnectCamera(m_hCamera);\n LOG_TRACE(_T(\"PR_DisconnectCamera(%08x) returned %08x\\n\"), m_hCamera, err);\n\n \/\/ may return prINVALID_FN_CALL when SDK wasn't initialized\n \/\/ may return prINVALID_HANDLE when specified handle is invalid\n err = PR_DestroyCameraObject(m_hCamera);\n LOG_TRACE(_T(\"PR_DestroyCameraObject(%08x) returned %08x\\n\"), m_hCamera, err);\n }\n\n virtual bool GetDeviceCapability(SourceDevice::T_enDeviceCapability enDeviceCapability) const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n DeviceInfo& info = *m_spDeviceInfo.get();\n\n switch (enDeviceCapability)\n {\n case SourceDevice::capRemoteReleaseControl:\n {\n bool bInitiateRelease =\n info.m_setOperationsSupported.find(prPTP_INITIATE_RELEASE_CONTROL) != info.m_setOperationsSupported.end();\n return bInitiateRelease;\n }\n break;\n\n case SourceDevice::capRemoteViewfinder:\n {\n bool bInitiateViewfinder =\n info.m_setOperationsSupported.find(prPTP_RC_INITIATE_VIEW_FINDER) != info.m_setOperationsSupported.end();\n\n return bInitiateViewfinder;\n }\n break;\n\n default:\n ATLASSERT(false);\n }\n return false;\n }\n\n virtual CString ModelName() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n\n return m_spDeviceInfo->m_cszModel;\n }\n\n virtual CString SerialNumber() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n\n return m_spDeviceInfo->m_cszSerialNumber;\n }\n\n virtual std::vector<unsigned int> EnumDeviceProperties() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n DeviceInfo& info = *m_spDeviceInfo.get();\n\n const std::set<prUInt16>& setDeviceProperties = info.m_setDevicePropertiesSupported;\n std::set<prUInt16>::const_iterator iter = setDeviceProperties.begin(),\n stop = setDeviceProperties.end();\n\n std::vector<unsigned int> vecData;\n\n \/\/ just put the device property id's into the vector\n for (; iter != stop; ++iter)\n vecData.push_back(*iter);\n\n return vecData;\n }\n\n virtual DeviceProperty GetDeviceProperty(unsigned int uiPropertyId) const override\n {\n prUInt16 propId = static_cast<prUInt16>(uiPropertyId & 0xFFFF);\n\n \/\/ get device property value\n DevicePropDesc desc(m_hCamera, propId, false);\n\n DeviceProperty dp(variantPsrec, uiPropertyId, desc.m_varCurrentValue, !desc.IsSetAllowed());\n\n \/\/ TODO needed to create PropertyAccess object here?\n PropertyAccess pa(m_hCamera);\n pa.Enum(propId, dp.m_vecValidValues);\n\n return dp;\n }\n\n virtual std::shared_ptr<RemoteReleaseControl> EnterReleaseControl() override\n {\n if (!GetDeviceCapability(capRemoteReleaseControl))\n {\n throw CameraException(_T(\"SourceDevice::EnterReleaseControl\"), _T(\"Not supported\"),\n prERROR_PRSDK_COMPONENTID | prNOT_SUPPORTED, __FILE__, __LINE__);\n }\n\n std::shared_ptr<SourceDeviceImpl> spSourceDevice = shared_from_this();\n\n return std::shared_ptr<RemoteReleaseControl>(new RemoteReleaseControlImpl(m_hCamera, spSourceDevice));\n }\n\n \/\/\/ returns device info\n std::shared_ptr<DeviceInfo> GetDeviceInfo() { return m_spDeviceInfo; }\n\nprivate:\n \/\/\/ camera handle\n prHandle m_hCamera;\n\n \/\/\/ SDK ref\n RefSp m_spRef;\n\n \/\/\/ device info\n std::shared_ptr<DeviceInfo> m_spDeviceInfo;\n};\n\n} \/\/ namespace PSREC\n<commit_msg>removed extra instance of PropertyAccess when getting device properties<commit_after>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2014 Michael Fink\n\/\/\n\/\/\/ \\file PsrecSourceDeviceImpl.hpp PS-ReC - SourceDevice impl\n\/\/\n#pragma once\n\n\/\/ includes\n#include \"SourceDevice.hpp\"\n#include \"PsrecCommon.hpp\"\n#include \"PsrecRemoteReleaseControlImpl.hpp\"\n#include \"PsrecPropertyAccess.hpp\"\n#include \"PsrecDeviceInfo.hpp\"\n\nnamespace PSREC\n{\n\n\/\/\/ source device impl for PSREC\nclass SourceDeviceImpl:\n public SourceDevice,\n public std::enable_shared_from_this<SourceDeviceImpl>\n{\npublic:\n \/\/\/ ctor\n SourceDeviceImpl(RefSp spRef, prDeviceInfoTable& deviceInfo)\n :m_spRef(spRef),\n m_hCamera(0)\n {\n LOG_TRACE(_T(\"about to call PR_CreateCameraObject...\\n\"));\n\n prHandle hCamera = 0;\n \/\/ may return prINVALID_FN_CALL when SDK wasn't initialized\n \/\/ may return prINVALID_PARAMETER when specified device info is invalid\n \/\/ may return prMEM_ALLOC_FAILED on memory error\n prResponse err = PR_CreateCameraObject(&deviceInfo, &hCamera);\n LOG_TRACE(_T(\"PR_CreateCameraObject(&si = \\\"%ls\\\", &handle) returned %08x, handle %08x\\n\"),\n deviceInfo.ModelName, err, hCamera);\n CheckError(_T(\"PR_CreateCameraObject\"), err, __FILE__, __LINE__);\n\n m_hCamera = hCamera;\n\n \/\/ connect to camera itself\n \/\/ may return prINVALID_FN_CALL, prINVALID_HANDLE, prMEM_ALLOC_FAILED\n err = PR_ConnectCamera(m_hCamera);\n LOG_TRACE(_T(\"PR_ConnectCamera(handle = %08x) returned %08x\\n\"), m_hCamera, err);\n CheckError(_T(\"PR_ConnectCamera\"), err, __FILE__, __LINE__);\n\n \/\/ get device info so that we don't have to query every time\n m_spDeviceInfo.reset(new DeviceInfo(m_hCamera));\n }\n\n \/\/\/ dtor\n virtual ~SourceDeviceImpl() throw()\n {\n \/\/ disconnect from camera\n prResponse err = PR_DisconnectCamera(m_hCamera);\n LOG_TRACE(_T(\"PR_DisconnectCamera(%08x) returned %08x\\n\"), m_hCamera, err);\n\n \/\/ may return prINVALID_FN_CALL when SDK wasn't initialized\n \/\/ may return prINVALID_HANDLE when specified handle is invalid\n err = PR_DestroyCameraObject(m_hCamera);\n LOG_TRACE(_T(\"PR_DestroyCameraObject(%08x) returned %08x\\n\"), m_hCamera, err);\n }\n\n virtual bool GetDeviceCapability(SourceDevice::T_enDeviceCapability enDeviceCapability) const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n DeviceInfo& info = *m_spDeviceInfo.get();\n\n switch (enDeviceCapability)\n {\n case SourceDevice::capRemoteReleaseControl:\n {\n bool bInitiateRelease =\n info.m_setOperationsSupported.find(prPTP_INITIATE_RELEASE_CONTROL) != info.m_setOperationsSupported.end();\n return bInitiateRelease;\n }\n break;\n\n case SourceDevice::capRemoteViewfinder:\n {\n bool bInitiateViewfinder =\n info.m_setOperationsSupported.find(prPTP_RC_INITIATE_VIEW_FINDER) != info.m_setOperationsSupported.end();\n\n return bInitiateViewfinder;\n }\n break;\n\n default:\n ATLASSERT(false);\n }\n return false;\n }\n\n virtual CString ModelName() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n\n return m_spDeviceInfo->m_cszModel;\n }\n\n virtual CString SerialNumber() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n\n return m_spDeviceInfo->m_cszSerialNumber;\n }\n\n virtual std::vector<unsigned int> EnumDeviceProperties() const override\n {\n ATLASSERT(m_spDeviceInfo != nullptr);\n DeviceInfo& info = *m_spDeviceInfo.get();\n\n const std::set<prUInt16>& setDeviceProperties = info.m_setDevicePropertiesSupported;\n std::set<prUInt16>::const_iterator iter = setDeviceProperties.begin(),\n stop = setDeviceProperties.end();\n\n std::vector<unsigned int> vecData;\n\n \/\/ just put the device property id's into the vector\n for (; iter != stop; ++iter)\n vecData.push_back(*iter);\n\n return vecData;\n }\n\n virtual DeviceProperty GetDeviceProperty(unsigned int uiPropertyId) const override\n {\n prUInt16 propId = static_cast<prUInt16>(uiPropertyId & 0xFFFF);\n\n \/\/ get device property value\n DevicePropDesc desc(m_hCamera, propId, true);\n\n DeviceProperty dp(variantPsrec, uiPropertyId, desc.m_varCurrentValue, !desc.IsSetAllowed());\n dp.m_vecValidValues = desc.m_vecAllValues;\n\n return dp;\n }\n\n virtual std::shared_ptr<RemoteReleaseControl> EnterReleaseControl() override\n {\n if (!GetDeviceCapability(capRemoteReleaseControl))\n {\n throw CameraException(_T(\"SourceDevice::EnterReleaseControl\"), _T(\"Not supported\"),\n prERROR_PRSDK_COMPONENTID | prNOT_SUPPORTED, __FILE__, __LINE__);\n }\n\n std::shared_ptr<SourceDeviceImpl> spSourceDevice = shared_from_this();\n\n return std::shared_ptr<RemoteReleaseControl>(new RemoteReleaseControlImpl(m_hCamera, spSourceDevice));\n }\n\n \/\/\/ returns device info\n std::shared_ptr<DeviceInfo> GetDeviceInfo() { return m_spDeviceInfo; }\n\nprivate:\n \/\/\/ camera handle\n prHandle m_hCamera;\n\n \/\/\/ SDK ref\n RefSp m_spRef;\n\n \/\/\/ device info\n std::shared_ptr<DeviceInfo> m_spDeviceInfo;\n};\n\n} \/\/ namespace PSREC\n<|endoftext|>"} {"text":"<commit_before>#include \"compiler.h\"\n#include \"generator.h\"\n\n#include <algorithm>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/scope_exit.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/variant.hpp>\n#include <ostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <iostream> \/\/ debug outputs\n\n\/\/ ----- Program structs -------------------------------------------------------\nnamespace bf {\n\nnamespace instruction {\n\nstruct function_call_t {\n std::string function_name;\n};\n\nstruct variable_declaration_t {\n std::string variable_name;\n int init_value;\n};\n\nstruct print_variable_t {\n std::string variable_name;\n};\n\nstruct print_text_t {\n std::string text;\n};\n\nstruct scan_variable_t {\n std::string variable_name;\n};\n\n} \/\/ namespace bf::instruction\n\ntypedef boost::variant<\n instruction::function_call_t,\n instruction::variable_declaration_t,\n instruction::print_variable_t,\n instruction::print_text_t,\n instruction::scan_variable_t\n> instruction_t;\n\nstruct function_t {\n std::string name;\n std::vector<std::string> parameters;\n std::vector<instruction_t> instructions;\n};\n\ntypedef std::vector<function_t> program_t;\n\n} \/\/ namespace bf\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::function_call_t,\n (std::string, function_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::variable_declaration_t,\n (std::string, variable_name)\n (int, init_value))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::print_variable_t,\n (std::string, variable_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::print_text_t,\n (std::string, text))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::scan_variable_t,\n (std::string, variable_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::function_t,\n (std::string, name)\n (std::vector<std::string>, parameters)\n (std::vector<bf::instruction_t>, instructions))\n\n\/\/ ----- Parser grammar --------------------------------------------------------\nnamespace bf {\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\n\ntemplate <typename iterator>\nstruct grammar : qi::grammar<iterator, program_t(), ascii::space_type> {\n grammar() : grammar::base_type(program) {\n program = *function;\n function = \"function\" >> function_name\n >> '(' >> -(variable_name % ',') >> ')'\n >> '{' >> *instruction >> '}';\n function_name = qi::lexeme[+qi::alpha];\n variable_name = qi::lexeme[+qi::alpha];\n\n instruction = function_call\n | variable_declaration\n | print_variable\n | print_text\n | scan_variable;\n\n function_call = function_name >> '(' >> -(variable_name % ',') >> ')' >> ';';\n variable_declaration = \"var\" >> variable_name >> (('=' >> qi::uint_) | qi::attr(0)) >> ';';\n print_variable = \"print\" >> variable_name >> ';';\n print_text = \"print\" >> qi::lexeme['\"' >> *(qi::char_ - '\"') >> '\"'] >> ';';\n scan_variable = \"scan\" >> variable_name >> ';';\n }\n\n qi::rule<iterator, program_t(), ascii::space_type> program;\n qi::rule<iterator, function_t(), ascii::space_type> function;\n qi::rule<iterator, std::string(), ascii::space_type> function_name;\n qi::rule<iterator, std::string(), ascii::space_type> variable_name;\n qi::rule<iterator, instruction_t(), ascii::space_type> instruction;\n\n qi::rule<iterator, instruction::function_call_t(), ascii::space_type> function_call;\n qi::rule<iterator, instruction::variable_declaration_t(), ascii::space_type> variable_declaration;\n qi::rule<iterator, instruction::print_variable_t(), ascii::space_type> print_variable;\n qi::rule<iterator, instruction::print_text_t(), ascii::space_type> print_text;\n qi::rule<iterator, instruction::scan_variable_t(), ascii::space_type> scan_variable;\n};\n\n\/\/ ----- Compilation algorithms ------------------------------------------------\nprogram_t parse(const std::string &source) {\n \/\/ Build program struct from source input.\n grammar<decltype(source.begin())> g;\n program_t program;\n auto begin = source.begin(), end = source.end();\n const bool success = qi::phrase_parse(begin, end, g, ascii::space, program);\n\n if (!success || begin != end)\n throw std::logic_error(\"Parse unsuccessful!\");\n\n \/\/ ----- Check program struct -----\n std::sort(program.begin(), program.end(),\n [](const function_t &f1, const function_t &f2) {return f1.name < f2.name;});\n \/\/ Ensure unique function names.\n if (program.size() > 1) {\n auto before_it = program.begin();\n for (auto it = before_it + 1; it != program.end(); ++before_it, ++it)\n if (before_it->name == it->name)\n throw std::logic_error(\"Function name used multiply times: \" + it->name);\n }\n\n return program;\n}\n\nclass instruction_visitor : public boost::static_visitor<void> {\npublic:\n instruction_visitor(const program_t &program) : m_program(program) {}\n\n void operator()(const instruction::function_call_t &i) {\n \/\/ Check if called function exists.\n auto function_it = std::find_if(m_program.begin(), m_program.end(),\n [&i](const function_t &f) {return f.name == i.function_name;});\n if (function_it == m_program.end())\n throw std::logic_error(\"Function not found: \" + i.function_name);\n\n \/\/ Check for recursion (which is not supported).\n auto recursion_it = std::find(m_call_stack.begin(), m_call_stack.end(), i.function_name);\n if (recursion_it != m_call_stack.end()) {\n std::string call_stack_dump;\n for (const auto &function : m_call_stack)\n call_stack_dump += function + \", \";\n call_stack_dump += \"(*) \" + i.function_name;\n throw std::logic_error(\"Recursion not supported: \" + call_stack_dump);\n }\n\n \/\/ Provide a clean scope for the called function.\n std::vector<std::map<std::string, generator::var_ptr>> scope_backup;\n std::swap(m_scope, scope_backup);\n m_scope.emplace_back();\n \/\/ TODO: Copy arguments\n \/\/ Restore old scope after the function returns.\n BOOST_SCOPE_EXIT(this_, &scope_backup) {\n std::swap(this_->m_scope, scope_backup);\n } BOOST_SCOPE_EXIT_END\n\n \/\/ Just for error report on recursion: Keep track of the call stack.\n m_call_stack.push_back(i.function_name);\n BOOST_SCOPE_EXIT(this_) {\n this_->m_call_stack.pop_back();\n } BOOST_SCOPE_EXIT_END\n\n \/\/ Finally, visit all instructions in the called function.\n for (const auto &instruction : function_it->instructions)\n boost::apply_visitor(*this, instruction);\n }\n\n void operator()(const instruction::variable_declaration_t &i) {\n auto it = m_scope.back().find(i.variable_name);\n if (it != m_scope.back().end())\n throw std::logic_error(\"Redeclaration of variable: \" + i.variable_name);\n\n m_scope.back().emplace(i.variable_name, m_bfg.new_var(i.variable_name, i.init_value));\n }\n\n void operator()(const instruction::print_variable_t &i) {\n get_var(i.variable_name)->write_output();\n }\n\n void operator()(const instruction::print_text_t &i) {\n m_bfg.print(i.text);\n }\n\n void operator()(const instruction::scan_variable_t &i) {\n get_var(i.variable_name)->read_input();\n }\n\n const generator::var_ptr &get_var(const std::string &variable_name) const {\n for (auto scope_it = m_scope.rbegin(); scope_it != m_scope.rend(); ++scope_it) {\n auto it = scope_it->find(variable_name);\n if (it != scope_it->end())\n return it->second;\n }\n\n throw std::logic_error(\"Variable not declared in this scope: \" + variable_name);\n }\n\n const generator &get_generator() const {\n return m_bfg;\n }\n\nprivate:\n program_t m_program; \/\/ TODO: just const ref?\n generator m_bfg;\n std::vector<std::map<std::string, generator::var_ptr>> m_scope;\n std::vector<std::string> m_call_stack;\n};\n\nstd::string generate(const program_t &program) {\n \/\/ As long as all function calls are inlined, this makes sense.\n instruction_visitor visitor(program);\n instruction::function_call_t call_to_main {\"main\"};\n instruction_t start = call_to_main;\n boost::apply_visitor(visitor, start);\n\n return visitor.get_generator().get_code();\n}\n\nstd::string compiler::compile(const std::string &source) const {\n program_t program = parse(source);\n return generate(program);\n}\n\n} \/\/ namespace\n<commit_msg>Added error message on syntax errors.<commit_after>#include \"compiler.h\"\n#include \"generator.h\"\n\n#define BOOST_RESULT_OF_USE_DECLTYPE\n#define BOOST_SPIRIT_USE_PHOENIX_V3\n\n#include <algorithm>\n#include <boost\/fusion\/include\/adapt_struct.hpp>\n#include <boost\/scope_exit.hpp>\n#include <boost\/spirit\/include\/phoenix.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/variant.hpp>\n#include <iostream> \/\/ for std::cerr in parser\n#include <ostream>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n\/\/ ----- Program structs -------------------------------------------------------\nnamespace bf {\n\nnamespace instruction {\n\nstruct function_call_t {\n std::string function_name;\n};\n\nstruct variable_declaration_t {\n std::string variable_name;\n int init_value;\n};\n\nstruct print_variable_t {\n std::string variable_name;\n};\n\nstruct print_text_t {\n std::string text;\n};\n\nstruct scan_variable_t {\n std::string variable_name;\n};\n\n} \/\/ namespace bf::instruction\n\ntypedef boost::variant<\n instruction::function_call_t,\n instruction::variable_declaration_t,\n instruction::print_variable_t,\n instruction::print_text_t,\n instruction::scan_variable_t\n> instruction_t;\n\nstruct function_t {\n std::string name;\n std::vector<std::string> parameters;\n std::vector<instruction_t> instructions;\n};\n\ntypedef std::vector<function_t> program_t;\n\n} \/\/ namespace bf\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::function_call_t,\n (std::string, function_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::variable_declaration_t,\n (std::string, variable_name)\n (int, init_value))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::print_variable_t,\n (std::string, variable_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::print_text_t,\n (std::string, text))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::instruction::scan_variable_t,\n (std::string, variable_name))\n\nBOOST_FUSION_ADAPT_STRUCT(\n bf::function_t,\n (std::string, name)\n (std::vector<std::string>, parameters)\n (std::vector<bf::instruction_t>, instructions))\n\n\/\/ ----- Parser grammar --------------------------------------------------------\nnamespace bf {\n\nnamespace qi = boost::spirit::qi;\nnamespace ascii = boost::spirit::ascii;\n\n#define KEYWORDS (qi::lit(\"function\") | \"var\" | \"print\" | \"scan\")\ntemplate <typename iterator>\nstruct grammar : qi::grammar<iterator, program_t(), ascii::space_type> {\n grammar() : grammar::base_type(program) {\n program = *function;\n function = qi::lexeme[\"function\"] > function_name\n > '(' > -(variable_name % ',') > ')'\n > '{' > *instruction > '}';\n function_name = qi::lexeme[+qi::alpha - KEYWORDS];\n variable_name = qi::lexeme[+qi::alpha - KEYWORDS];\n\n instruction = function_call\n | variable_declaration\n | print_variable\n | print_text\n | scan_variable;\n\n function_call = function_name >> '(' > -(variable_name % ',') > ')' > ';';\n variable_declaration = qi::lexeme[\"var\"] > variable_name > (('=' > qi::uint_) | qi::attr(0)) > ';';\n print_variable = qi::lexeme[\"print\"] >> variable_name > ';';\n print_text = qi::lexeme[\"print\"] >> qi::lexeme['\"' > *(qi::char_ - '\"') > '\"'] > ';';\n scan_variable = qi::lexeme[\"scan\"] > variable_name > ';';\n\n program.name(\"program\");\n function.name(\"function\");\n function_name.name(\"function name\");\n variable_name.name(\"variable name\");\n instruction.name(\"instruction\");\n function_call.name(\"function call\");\n variable_declaration.name(\"variable declaration\");\n print_variable.name(\"print variable\");\n print_text.name(\"print text\");\n scan_variable.name(\"scan variable\");\n\n auto on_error = [](auto first, auto last, auto err, auto what) {\n std::string before(first, err);\n std::size_t bpos = before.find_last_of('\\n');\n if (bpos != std::string::npos)\n before = before.substr(bpos + 1);\n\n std::string after(err, last);\n std::size_t apos = after.find_first_of('\\n');\n if (apos != std::string::npos)\n after = after.substr(0, apos);\n\n std::cerr << \"Error! Expecting \" << what << \" here:\\n\"\n << before << after << '\\n'\n << std::string(before.size(), ' ') << '^'\n << std::endl;\n };\n\n qi::on_error<qi::fail>(program, boost::phoenix::bind(on_error, qi::_1, qi::_2, qi::_3, qi::_4));\n }\n\n qi::rule<iterator, program_t(), ascii::space_type> program;\n qi::rule<iterator, function_t(), ascii::space_type> function;\n qi::rule<iterator, std::string(), ascii::space_type> function_name;\n qi::rule<iterator, std::string(), ascii::space_type> variable_name;\n qi::rule<iterator, instruction_t(), ascii::space_type> instruction;\n\n qi::rule<iterator, instruction::function_call_t(), ascii::space_type> function_call;\n qi::rule<iterator, instruction::variable_declaration_t(), ascii::space_type> variable_declaration;\n qi::rule<iterator, instruction::print_variable_t(), ascii::space_type> print_variable;\n qi::rule<iterator, instruction::print_text_t(), ascii::space_type> print_text;\n qi::rule<iterator, instruction::scan_variable_t(), ascii::space_type> scan_variable;\n};\n\n\/\/ ----- Compilation algorithms ------------------------------------------------\nprogram_t parse(const std::string &source) {\n \/\/ Build program struct from source input.\n grammar<decltype(source.begin())> g;\n program_t program;\n auto begin = source.begin(), end = source.end();\n const bool success = qi::phrase_parse(begin, end, g, ascii::space, program);\n\n if (!success || begin != end)\n throw std::logic_error(\"Parse unsuccessful!\");\n\n \/\/ ----- Check program struct -----\n std::sort(program.begin(), program.end(),\n [](const function_t &f1, const function_t &f2) {return f1.name < f2.name;});\n \/\/ Ensure unique function names.\n if (program.size() > 1) {\n auto before_it = program.begin();\n for (auto it = before_it + 1; it != program.end(); ++before_it, ++it)\n if (before_it->name == it->name)\n throw std::logic_error(\"Function name used multiply times: \" + it->name);\n }\n\n return program;\n}\n\nclass instruction_visitor : public boost::static_visitor<void> {\npublic:\n instruction_visitor(const program_t &program) : m_program(program) {}\n\n void operator()(const instruction::function_call_t &i) {\n \/\/ Check if called function exists.\n auto function_it = std::find_if(m_program.begin(), m_program.end(),\n [&i](const function_t &f) {return f.name == i.function_name;});\n if (function_it == m_program.end())\n throw std::logic_error(\"Function not found: \" + i.function_name);\n\n \/\/ Check for recursion (which is not supported).\n auto recursion_it = std::find(m_call_stack.begin(), m_call_stack.end(), i.function_name);\n if (recursion_it != m_call_stack.end()) {\n std::string call_stack_dump;\n for (const auto &function : m_call_stack)\n call_stack_dump += function + \", \";\n call_stack_dump += \"(*) \" + i.function_name;\n throw std::logic_error(\"Recursion not supported: \" + call_stack_dump);\n }\n\n \/\/ Provide a clean scope for the called function.\n std::vector<std::map<std::string, generator::var_ptr>> scope_backup;\n std::swap(m_scope, scope_backup);\n m_scope.emplace_back();\n \/\/ TODO: Copy arguments\n \/\/ Restore old scope after the function returns.\n BOOST_SCOPE_EXIT(this_, &scope_backup) {\n std::swap(this_->m_scope, scope_backup);\n } BOOST_SCOPE_EXIT_END\n\n \/\/ Just for error report on recursion: Keep track of the call stack.\n m_call_stack.push_back(i.function_name);\n BOOST_SCOPE_EXIT(this_) {\n this_->m_call_stack.pop_back();\n } BOOST_SCOPE_EXIT_END\n\n \/\/ Finally, visit all instructions in the called function.\n for (const auto &instruction : function_it->instructions)\n boost::apply_visitor(*this, instruction);\n }\n\n void operator()(const instruction::variable_declaration_t &i) {\n auto it = m_scope.back().find(i.variable_name);\n if (it != m_scope.back().end())\n throw std::logic_error(\"Redeclaration of variable: \" + i.variable_name);\n\n m_scope.back().emplace(i.variable_name, m_bfg.new_var(i.variable_name, i.init_value));\n }\n\n void operator()(const instruction::print_variable_t &i) {\n get_var(i.variable_name)->write_output();\n }\n\n void operator()(const instruction::print_text_t &i) {\n m_bfg.print(i.text);\n }\n\n void operator()(const instruction::scan_variable_t &i) {\n get_var(i.variable_name)->read_input();\n }\n\n const generator::var_ptr &get_var(const std::string &variable_name) const {\n for (auto scope_it = m_scope.rbegin(); scope_it != m_scope.rend(); ++scope_it) {\n auto it = scope_it->find(variable_name);\n if (it != scope_it->end())\n return it->second;\n }\n\n throw std::logic_error(\"Variable not declared in this scope: \" + variable_name);\n }\n\n const generator &get_generator() const {\n return m_bfg;\n }\n\nprivate:\n program_t m_program; \/\/ TODO: just const ref?\n generator m_bfg;\n std::vector<std::map<std::string, generator::var_ptr>> m_scope;\n std::vector<std::string> m_call_stack;\n};\n\nstd::string generate(const program_t &program) {\n \/\/ As long as all function calls are inlined, this makes sense.\n instruction_visitor visitor(program);\n instruction::function_call_t call_to_main {\"main\"};\n instruction_t start = call_to_main;\n boost::apply_visitor(visitor, start);\n\n return visitor.get_generator().get_code();\n}\n\nstd::string compiler::compile(const std::string &source) const {\n program_t program = parse(source);\n return generate(program);\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/base\/accelerators\/accelerator.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#elif defined(TOOLKIT_USES_GTK)\n#include <gdk\/gdk.h>\n#endif\n\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"grit\/ui_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\nnamespace ui {\n\nstring16 Accelerator::GetShortcutText() const {\n int string_id = 0;\n switch(key_code_) {\n case ui::VKEY_TAB:\n string_id = IDS_APP_TAB_KEY;\n break;\n case ui::VKEY_RETURN:\n string_id = IDS_APP_ENTER_KEY;\n break;\n case ui::VKEY_ESCAPE:\n string_id = IDS_APP_ESC_KEY;\n break;\n case ui::VKEY_PRIOR:\n string_id = IDS_APP_PAGEUP_KEY;\n break;\n case ui::VKEY_NEXT:\n string_id = IDS_APP_PAGEDOWN_KEY;\n break;\n case ui::VKEY_END:\n string_id = IDS_APP_END_KEY;\n break;\n case ui::VKEY_HOME:\n string_id = IDS_APP_HOME_KEY;\n break;\n case ui::VKEY_INSERT:\n string_id = IDS_APP_INSERT_KEY;\n break;\n case ui::VKEY_DELETE:\n string_id = IDS_APP_DELETE_KEY;\n break;\n case ui::VKEY_LEFT:\n string_id = IDS_APP_LEFT_ARROW_KEY;\n break;\n case ui::VKEY_RIGHT:\n string_id = IDS_APP_RIGHT_ARROW_KEY;\n break;\n case ui::VKEY_BACK:\n string_id = IDS_APP_BACKSPACE_KEY;\n break;\n case ui::VKEY_F1:\n string_id = IDS_APP_F1_KEY;\n break;\n case ui::VKEY_F11:\n string_id = IDS_APP_F11_KEY;\n break;\n default:\n break;\n }\n\n string16 shortcut;\n if (!string_id) {\n#if defined(OS_WIN)\n \/\/ Our fallback is to try translate the key code to a regular character\n \/\/ unless it is one of digits (VK_0 to VK_9). Some keyboard\n \/\/ layouts have characters other than digits assigned in\n \/\/ an unshifted mode (e.g. French AZERY layout has 'a with grave\n \/\/ accent' for '0'). For display in the menu (e.g. Ctrl-0 for the\n \/\/ default zoom level), we leave VK_[0-9] alone without translation.\n wchar_t key;\n if (key_code_ >= '0' && key_code_ <= '9')\n key = key_code_;\n else\n key = LOWORD(::MapVirtualKeyW(key_code_, MAPVK_VK_TO_CHAR));\n shortcut += key;\n#elif defined(TOOLKIT_USES_GTK)\n const gchar* name = NULL;\n switch (key_code_) {\n case ui::VKEY_OEM_2:\n name = static_cast<const gchar*>(\"\/\");\n break;\n default:\n name = gdk_keyval_name(gdk_keyval_to_lower(key_code_));\n break;\n }\n if (name) {\n if (name[0] != 0 && name[1] == 0)\n shortcut += static_cast<string16::value_type>(g_ascii_toupper(name[0]));\n else\n shortcut += UTF8ToUTF16(name);\n }\n#endif\n } else {\n shortcut = l10n_util::GetStringUTF16(string_id);\n }\n\n \/\/ Checking whether the character used for the accelerator is alphanumeric.\n \/\/ If it is not, then we need to adjust the string later on if the locale is\n \/\/ right-to-left. See below for more information of why such adjustment is\n \/\/ required.\n string16 shortcut_rtl;\n bool adjust_shortcut_for_rtl = false;\n if (base::i18n::IsRTL() && shortcut.length() == 1 &&\n !IsAsciiAlpha(shortcut[0]) && !IsAsciiDigit(shortcut[0])) {\n adjust_shortcut_for_rtl = true;\n shortcut_rtl.assign(shortcut);\n }\n\n if (IsShiftDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_SHIFT_MODIFIER, shortcut);\n\n \/\/ Note that we use 'else-if' in order to avoid using Ctrl+Alt as a shortcut.\n \/\/ See http:\/\/blogs.msdn.com\/oldnewthing\/archive\/2004\/03\/29\/101121.aspx for\n \/\/ more information.\n if (IsCtrlDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_CONTROL_MODIFIER, shortcut);\n else if (IsAltDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_ALT_MODIFIER, shortcut);\n\n \/\/ For some reason, menus in Windows ignore standard Unicode directionality\n \/\/ marks (such as LRE, PDF, etc.). On RTL locales, we use RTL menus and\n \/\/ therefore any text we draw for the menu items is drawn in an RTL context.\n \/\/ Thus, the text \"Ctrl++\" (which we currently use for the Zoom In option)\n \/\/ appears as \"++Ctrl\" in RTL because the Unicode BiDi algorithm puts\n \/\/ punctuations on the left when the context is right-to-left. Shortcuts that\n \/\/ do not end with a punctuation mark (such as \"Ctrl+H\" do not have this\n \/\/ problem).\n \/\/\n \/\/ The only way to solve this problem is to adjust the string if the locale\n \/\/ is RTL so that it is drawn correnctly in an RTL context. Instead of\n \/\/ returning \"Ctrl++\" in the above example, we return \"++Ctrl\". This will\n \/\/ cause the text to appear as \"Ctrl++\" when Windows draws the string in an\n \/\/ RTL context because the punctunation no longer appears at the end of the\n \/\/ string.\n \/\/\n \/\/ TODO(idana) bug# 1232732: this hack can be avoided if instead of using\n \/\/ views::Menu we use views::MenuItemView because the latter is a View\n \/\/ subclass and therefore it supports marking text as RTL or LTR using\n \/\/ standard Unicode directionality marks.\n if (adjust_shortcut_for_rtl) {\n int key_length = static_cast<int>(shortcut_rtl.length());\n DCHECK_GT(key_length, 0);\n shortcut_rtl.append(ASCIIToUTF16(\"+\"));\n\n \/\/ Subtracting the size of the shortcut key and 1 for the '+' sign.\n shortcut_rtl.append(shortcut, 0, shortcut.length() - key_length - 1);\n shortcut.swap(shortcut_rtl);\n }\n\n return shortcut;\n}\n\n} \/\/ namespace ui\n<commit_msg>Implement Accelerator::GetShortcutText for non-Windows Aura.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/base\/accelerators\/accelerator.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#elif defined(TOOLKIT_USES_GTK)\n#include <gdk\/gdk.h>\n#endif\n\n#include \"base\/i18n\/rtl.h\"\n#include \"base\/logging.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"grit\/ui_strings.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n\n#if !defined(OS_WIN) && defined(USE_AURA)\n#include \"ui\/base\/keycodes\/keyboard_code_conversion.h\"\n#endif\n\nnamespace ui {\n\nstring16 Accelerator::GetShortcutText() const {\n int string_id = 0;\n switch(key_code_) {\n case ui::VKEY_TAB:\n string_id = IDS_APP_TAB_KEY;\n break;\n case ui::VKEY_RETURN:\n string_id = IDS_APP_ENTER_KEY;\n break;\n case ui::VKEY_ESCAPE:\n string_id = IDS_APP_ESC_KEY;\n break;\n case ui::VKEY_PRIOR:\n string_id = IDS_APP_PAGEUP_KEY;\n break;\n case ui::VKEY_NEXT:\n string_id = IDS_APP_PAGEDOWN_KEY;\n break;\n case ui::VKEY_END:\n string_id = IDS_APP_END_KEY;\n break;\n case ui::VKEY_HOME:\n string_id = IDS_APP_HOME_KEY;\n break;\n case ui::VKEY_INSERT:\n string_id = IDS_APP_INSERT_KEY;\n break;\n case ui::VKEY_DELETE:\n string_id = IDS_APP_DELETE_KEY;\n break;\n case ui::VKEY_LEFT:\n string_id = IDS_APP_LEFT_ARROW_KEY;\n break;\n case ui::VKEY_RIGHT:\n string_id = IDS_APP_RIGHT_ARROW_KEY;\n break;\n case ui::VKEY_BACK:\n string_id = IDS_APP_BACKSPACE_KEY;\n break;\n case ui::VKEY_F1:\n string_id = IDS_APP_F1_KEY;\n break;\n case ui::VKEY_F11:\n string_id = IDS_APP_F11_KEY;\n break;\n default:\n break;\n }\n\n string16 shortcut;\n if (!string_id) {\n#if defined(OS_WIN)\n \/\/ Our fallback is to try translate the key code to a regular character\n \/\/ unless it is one of digits (VK_0 to VK_9). Some keyboard\n \/\/ layouts have characters other than digits assigned in\n \/\/ an unshifted mode (e.g. French AZERY layout has 'a with grave\n \/\/ accent' for '0'). For display in the menu (e.g. Ctrl-0 for the\n \/\/ default zoom level), we leave VK_[0-9] alone without translation.\n wchar_t key;\n if (key_code_ >= '0' && key_code_ <= '9')\n key = key_code_;\n else\n key = LOWORD(::MapVirtualKeyW(key_code_, MAPVK_VK_TO_CHAR));\n shortcut += key;\n#elif defined(USE_AURA)\n const uint16 c = GetCharacterFromKeyCode(key_code_, false);\n if (c != 0) {\n shortcut += static_cast<string16::value_type>(base::ToUpperASCII(c));\n }\n#elif defined(TOOLKIT_USES_GTK)\n const gchar* name = NULL;\n switch (key_code_) {\n case ui::VKEY_OEM_2:\n name = static_cast<const gchar*>(\"\/\");\n break;\n default:\n name = gdk_keyval_name(gdk_keyval_to_lower(key_code_));\n break;\n }\n if (name) {\n if (name[0] != 0 && name[1] == 0)\n shortcut += static_cast<string16::value_type>(g_ascii_toupper(name[0]));\n else\n shortcut += UTF8ToUTF16(name);\n }\n#endif\n } else {\n shortcut = l10n_util::GetStringUTF16(string_id);\n }\n\n \/\/ Checking whether the character used for the accelerator is alphanumeric.\n \/\/ If it is not, then we need to adjust the string later on if the locale is\n \/\/ right-to-left. See below for more information of why such adjustment is\n \/\/ required.\n string16 shortcut_rtl;\n bool adjust_shortcut_for_rtl = false;\n if (base::i18n::IsRTL() && shortcut.length() == 1 &&\n !IsAsciiAlpha(shortcut[0]) && !IsAsciiDigit(shortcut[0])) {\n adjust_shortcut_for_rtl = true;\n shortcut_rtl.assign(shortcut);\n }\n\n if (IsShiftDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_SHIFT_MODIFIER, shortcut);\n\n \/\/ Note that we use 'else-if' in order to avoid using Ctrl+Alt as a shortcut.\n \/\/ See http:\/\/blogs.msdn.com\/oldnewthing\/archive\/2004\/03\/29\/101121.aspx for\n \/\/ more information.\n if (IsCtrlDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_CONTROL_MODIFIER, shortcut);\n else if (IsAltDown())\n shortcut = l10n_util::GetStringFUTF16(IDS_APP_ALT_MODIFIER, shortcut);\n\n \/\/ For some reason, menus in Windows ignore standard Unicode directionality\n \/\/ marks (such as LRE, PDF, etc.). On RTL locales, we use RTL menus and\n \/\/ therefore any text we draw for the menu items is drawn in an RTL context.\n \/\/ Thus, the text \"Ctrl++\" (which we currently use for the Zoom In option)\n \/\/ appears as \"++Ctrl\" in RTL because the Unicode BiDi algorithm puts\n \/\/ punctuations on the left when the context is right-to-left. Shortcuts that\n \/\/ do not end with a punctuation mark (such as \"Ctrl+H\" do not have this\n \/\/ problem).\n \/\/\n \/\/ The only way to solve this problem is to adjust the string if the locale\n \/\/ is RTL so that it is drawn correnctly in an RTL context. Instead of\n \/\/ returning \"Ctrl++\" in the above example, we return \"++Ctrl\". This will\n \/\/ cause the text to appear as \"Ctrl++\" when Windows draws the string in an\n \/\/ RTL context because the punctunation no longer appears at the end of the\n \/\/ string.\n \/\/\n \/\/ TODO(idana) bug# 1232732: this hack can be avoided if instead of using\n \/\/ views::Menu we use views::MenuItemView because the latter is a View\n \/\/ subclass and therefore it supports marking text as RTL or LTR using\n \/\/ standard Unicode directionality marks.\n if (adjust_shortcut_for_rtl) {\n int key_length = static_cast<int>(shortcut_rtl.length());\n DCHECK_GT(key_length, 0);\n shortcut_rtl.append(ASCIIToUTF16(\"+\"));\n\n \/\/ Subtracting the size of the shortcut key and 1 for the '+' sign.\n shortcut_rtl.append(shortcut, 0, shortcut.length() - key_length - 1);\n shortcut.swap(shortcut_rtl);\n }\n\n return shortcut;\n}\n\n} \/\/ namespace ui\n<|endoftext|>"} {"text":"<commit_before>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2009 Torus Knot Software Ltd\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreShaderScriptTranslator.h\"\n#include \"OgrePass.h\"\n#include \"OgreTechnique.h\"\n#include \"OgreMaterial.h\"\n#include \"OgreShaderGenerator.h\"\n\n\nnamespace Ogre {\nnamespace RTShader {\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::translate(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode* obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\n\tObjectAbstractNode* parent = reinterpret_cast<ObjectAbstractNode*>(obj->parent);\n\n\t\/\/ Translate section within a pass context.\n\tif (parent->cls == \"pass\")\n\t{\n\t\ttranslatePass(compiler, node);\n\t}\n\tif (parent->cls == \"texture_unit\")\n\t{\n\t\ttranslateTextureUnit(compiler, node);\n\t}\n}\n\t\n\/\/-----------------------------------------------------------------------------\nSGScriptTranslator::TexturesParamCollection SGScriptTranslator::getParamCollection()\n{\n\treturn mParamCollection;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::clearParamCollection()\n{\n\tmParamCollection.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/*\nnote: we can know the texture unit index by getting parent then finding it in the list of children\n*\/\nvoid SGScriptTranslator::translateTextureUnit(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode *obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\n\tTextureUnitState* textureUnitState = any_cast<TextureUnitState*>(obj->parent->context);\t\n\tString strValue = \"\";\n\t\n\tProperties properties;\n\tfor(AbstractNodeList::iterator i = obj->children.begin(); i != obj->children.end(); ++i)\n\t{\n\t\tif((*i)->type == ANT_PROPERTY)\n\t\t{\n\t\t\tPropertyAbstractNode *prop = reinterpret_cast<PropertyAbstractNode*>((*i).get());\n\t\t\tAbstractNodeList::const_iterator it = prop->values.begin();\n\t\t\tPropertyValues popertyValues;\n\t\t\tfor( ;it != prop->values.end(); ++it)\n\t\t\t{\n\t\t\t\tif(true == SGScriptTranslator::getString(*it, &strValue))\n\t\t\t\t{\n\t\t\t\t\tpopertyValues.push_back(strValue);\n\t\t\t\t}\n\t\t\t}\n\t\t\tproperties[prop->name] = popertyValues;\n\t\t}\n\t}\n\tmParamCollection[textureUnitState] = properties;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::translatePass(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode *obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\t\n\tPass* pass = any_cast<Pass*>(obj->parent->context);\n\tTechnique* technique = pass->getParent();\n\tMaterial* material = technique->getParent();\n\tShaderGenerator* shaderGenerator = ShaderGenerator::getSingletonPtr();\n\tString dstTechniqueSchemeName = obj->name;\n\tbool techniqueCreated;\n\n\t\/\/ Make sure the scheme name is valid - use default if none exists.\n\tif (dstTechniqueSchemeName.empty())\t\n\t\tdstTechniqueSchemeName = ShaderGenerator::DEFAULT_SCHEME_NAME;\t\n\n\n\t\/\/ Create the shader based technique.\n\ttechniqueCreated = shaderGenerator->createShaderBasedTechnique(material->getName(), \n\t\ttechnique->getSchemeName(), \n\t\tdstTechniqueSchemeName);\n\n\n\t\/\/ Case technique successfully created.\n\tif (techniqueCreated)\n\t{\n\t\t\/\/ Go over all the render state properties.\n\t\tfor(AbstractNodeList::iterator i = obj->children.begin(); i != obj->children.end(); ++i)\n\t\t{\n\t\t\tif((*i)->type == ANT_PROPERTY)\n\t\t\t{\n\t\t\t\tPropertyAbstractNode *prop = reinterpret_cast<PropertyAbstractNode*>((*i).get());\n\t\t\t\tSubRenderState* subRenderState;\n\n\t\t\t\t\/\/ Handle light count property.\n\t\t\t\tif (prop->name == \"light_count\")\n\t\t\t\t{\n\t\t\t\t\tif (prop->values.size() != 3)\n\t\t\t\t\t{\n\t\t\t\t\t\tcompiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint lightCount[3];\n\n\t\t\t\t\t\tif (false == SGScriptTranslator::getInts(prop->values.begin(), prop->values.end(), lightCount, 3))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcompiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tshaderGenerator->createScheme(dstTechniqueSchemeName);\n\t\t\t\t\t\t\tRenderState* renderState = shaderGenerator->getRenderState(dstTechniqueSchemeName, material->getName(), pass->getIndex());\n\n\t\t\t\t\t\t\trenderState->setLightCount(lightCount);\n\t\t\t\t\t\t\trenderState->setLightCountAutoUpdate(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\t\t\t\n\t\t\t\t}\n\n\t\t\t\t\/\/ Handle the rest of the custom properties.\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsubRenderState = ShaderGenerator::getSingleton().createSubRenderState(compiler, prop, pass, this);\n\t\t\t\t\tif (subRenderState != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tshaderGenerator->createScheme(dstTechniqueSchemeName);\n\t\t\t\t\t\tRenderState* renderState = shaderGenerator->getRenderState(dstTechniqueSchemeName, material->getName(), pass->getIndex());\n\n\t\t\t\t\t\trenderState->addTemplateSubRenderState(subRenderState);\n\t\t\t\t\t}\n\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprocessNode(compiler, *i);\n\t\t\t}\n\t\t}\n\t}\t\n}\n\n}\n}\n<commit_msg>Being picky. Correct a variable name typo.<commit_after>\/*\n-----------------------------------------------------------------------------\nThis source file is part of OGRE\n(Object-oriented Graphics Rendering Engine)\nFor the latest info, see http:\/\/www.ogre3d.org\n\nCopyright (c) 2000-2009 Torus Knot Software Ltd\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n-----------------------------------------------------------------------------\n*\/\n#include \"OgreShaderScriptTranslator.h\"\n#include \"OgrePass.h\"\n#include \"OgreTechnique.h\"\n#include \"OgreMaterial.h\"\n#include \"OgreShaderGenerator.h\"\n\n\nnamespace Ogre {\nnamespace RTShader {\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::translate(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode* obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\n\tObjectAbstractNode* parent = reinterpret_cast<ObjectAbstractNode*>(obj->parent);\n\n\t\/\/ Translate section within a pass context.\n\tif (parent->cls == \"pass\")\n\t{\n\t\ttranslatePass(compiler, node);\n\t}\n\tif (parent->cls == \"texture_unit\")\n\t{\n\t\ttranslateTextureUnit(compiler, node);\n\t}\n}\n\t\n\/\/-----------------------------------------------------------------------------\nSGScriptTranslator::TexturesParamCollection SGScriptTranslator::getParamCollection()\n{\n\treturn mParamCollection;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::clearParamCollection()\n{\n\tmParamCollection.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\n\/*\nnote: we can know the texture unit index by getting parent then finding it in the list of children\n*\/\nvoid SGScriptTranslator::translateTextureUnit(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode *obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\n\tTextureUnitState* textureUnitState = any_cast<TextureUnitState*>(obj->parent->context);\t\n\tString strValue = \"\";\n\t\n\tProperties properties;\n\tfor(AbstractNodeList::iterator i = obj->children.begin(); i != obj->children.end(); ++i)\n\t{\n\t\tif((*i)->type == ANT_PROPERTY)\n\t\t{\n\t\t\tPropertyAbstractNode *prop = reinterpret_cast<PropertyAbstractNode*>((*i).get());\n\t\t\tAbstractNodeList::const_iterator it = prop->values.begin();\n\t\t\tPropertyValues propertyValues;\n\t\t\tfor( ;it != prop->values.end(); ++it)\n\t\t\t{\n\t\t\t\tif(true == SGScriptTranslator::getString(*it, &strValue))\n\t\t\t\t{\n\t\t\t\t\tpropertyValues.push_back(strValue);\n\t\t\t\t}\n\t\t\t}\n\t\t\tproperties[prop->name] = propertyValues;\n\t\t}\n\t}\n\tmParamCollection[textureUnitState] = properties;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid SGScriptTranslator::translatePass(ScriptCompiler* compiler, const AbstractNodePtr &node)\n{\n\tObjectAbstractNode *obj = reinterpret_cast<ObjectAbstractNode*>(node.get());\t\n\tPass* pass = any_cast<Pass*>(obj->parent->context);\n\tTechnique* technique = pass->getParent();\n\tMaterial* material = technique->getParent();\n\tShaderGenerator* shaderGenerator = ShaderGenerator::getSingletonPtr();\n\tString dstTechniqueSchemeName = obj->name;\n\tbool techniqueCreated;\n\n\t\/\/ Make sure the scheme name is valid - use default if none exists.\n\tif (dstTechniqueSchemeName.empty())\t\n\t\tdstTechniqueSchemeName = ShaderGenerator::DEFAULT_SCHEME_NAME;\t\n\n\n\t\/\/ Create the shader based technique.\n\ttechniqueCreated = shaderGenerator->createShaderBasedTechnique(material->getName(), \n\t\ttechnique->getSchemeName(), \n\t\tdstTechniqueSchemeName);\n\n\n\t\/\/ Case technique successfully created.\n\tif (techniqueCreated)\n\t{\n\t\t\/\/ Go over all the render state properties.\n\t\tfor(AbstractNodeList::iterator i = obj->children.begin(); i != obj->children.end(); ++i)\n\t\t{\n\t\t\tif((*i)->type == ANT_PROPERTY)\n\t\t\t{\n\t\t\t\tPropertyAbstractNode *prop = reinterpret_cast<PropertyAbstractNode*>((*i).get());\n\t\t\t\tSubRenderState* subRenderState;\n\n\t\t\t\t\/\/ Handle light count property.\n\t\t\t\tif (prop->name == \"light_count\")\n\t\t\t\t{\n\t\t\t\t\tif (prop->values.size() != 3)\n\t\t\t\t\t{\n\t\t\t\t\t\tcompiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tint lightCount[3];\n\n\t\t\t\t\t\tif (false == SGScriptTranslator::getInts(prop->values.begin(), prop->values.end(), lightCount, 3))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcompiler->addError(ScriptCompiler::CE_INVALIDPARAMETERS, prop->file, prop->line);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tshaderGenerator->createScheme(dstTechniqueSchemeName);\n\t\t\t\t\t\t\tRenderState* renderState = shaderGenerator->getRenderState(dstTechniqueSchemeName, material->getName(), pass->getIndex());\n\n\t\t\t\t\t\t\trenderState->setLightCount(lightCount);\n\t\t\t\t\t\t\trenderState->setLightCountAutoUpdate(false);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\t\t\t\t\n\t\t\t\t}\n\n\t\t\t\t\/\/ Handle the rest of the custom properties.\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tsubRenderState = ShaderGenerator::getSingleton().createSubRenderState(compiler, prop, pass, this);\n\t\t\t\t\tif (subRenderState != NULL)\n\t\t\t\t\t{\n\t\t\t\t\t\tshaderGenerator->createScheme(dstTechniqueSchemeName);\n\t\t\t\t\t\tRenderState* renderState = shaderGenerator->getRenderState(dstTechniqueSchemeName, material->getName(), pass->getIndex());\n\n\t\t\t\t\t\trenderState->addTemplateSubRenderState(subRenderState);\n\t\t\t\t\t}\n\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprocessNode(compiler, *i);\n\t\t\t}\n\t\t}\n\t}\t\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/base\/cursor\/cursor_loader_win.h\"\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/strings\/string16.h\"\n#include \"ui\/base\/cursor\/cursor.h\"\n#include \"ui\/resources\/grit\/ui_unscaled_resources.h\"\n\nnamespace ui {\n\nnamespace {\n\nbase::LazyInstance<base::string16> g_cursor_resource_module_name;\n\nconst wchar_t* GetCursorId(gfx::NativeCursor native_cursor) {\n switch (native_cursor.native_type()) {\n case kCursorNull:\n return IDC_ARROW;\n case kCursorPointer:\n return IDC_ARROW;\n case kCursorCross:\n return IDC_CROSS;\n case kCursorHand:\n return IDC_HAND;\n case kCursorIBeam:\n return IDC_IBEAM;\n case kCursorWait:\n return IDC_WAIT;\n case kCursorHelp:\n return IDC_HELP;\n case kCursorEastResize:\n return IDC_SIZEWE;\n case kCursorNorthResize:\n return IDC_SIZENS;\n case kCursorNorthEastResize:\n return IDC_SIZENESW;\n case kCursorNorthWestResize:\n return IDC_SIZENWSE;\n case kCursorSouthResize:\n return IDC_SIZENS;\n case kCursorSouthEastResize:\n return IDC_SIZENWSE;\n case kCursorSouthWestResize:\n return IDC_SIZENESW;\n case kCursorWestResize:\n return IDC_SIZEWE;\n case kCursorNorthSouthResize:\n return IDC_SIZENS;\n case kCursorEastWestResize:\n return IDC_SIZEWE;\n case kCursorNorthEastSouthWestResize:\n return IDC_SIZENESW;\n case kCursorNorthWestSouthEastResize:\n return IDC_SIZENWSE;\n case kCursorMove:\n return IDC_SIZEALL;\n case kCursorProgress:\n return IDC_APPSTARTING;\n case kCursorNoDrop:\n return IDC_NO;\n case kCursorNotAllowed:\n return IDC_NO;\n case kCursorColumnResize:\n return MAKEINTRESOURCE(IDC_COLRESIZE);\n case kCursorRowResize:\n return MAKEINTRESOURCE(IDC_ROWRESIZE);\n case kCursorMiddlePanning:\n return MAKEINTRESOURCE(IDC_PAN_MIDDLE);\n case kCursorEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_EAST);\n case kCursorNorthPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH);\n case kCursorNorthEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH_EAST);\n case kCursorNorthWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH_WEST);\n case kCursorSouthPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH);\n case kCursorSouthEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH_EAST);\n case kCursorSouthWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH_WEST);\n case kCursorWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_WEST);\n case kCursorVerticalText:\n return MAKEINTRESOURCE(IDC_VERTICALTEXT);\n case kCursorCell:\n return MAKEINTRESOURCE(IDC_CELL);\n case kCursorZoomIn:\n return MAKEINTRESOURCE(IDC_ZOOMIN);\n case kCursorZoomOut:\n return MAKEINTRESOURCE(IDC_ZOOMOUT);\n case kCursorGrab:\n return MAKEINTRESOURCE(IDC_HAND_GRAB);\n case kCursorGrabbing:\n return MAKEINTRESOURCE(IDC_HAND_GRABBING);\n case kCursorCopy:\n return MAKEINTRESOURCE(IDC_COPYCUR);\n case kCursorAlias:\n return MAKEINTRESOURCE(IDC_ALIAS);\n case kCursorNone:\n return MAKEINTRESOURCE(IDC_CURSOR_NONE);\n case kCursorContextMenu:\n case kCursorCustom:\n NOTIMPLEMENTED();\n return IDC_ARROW;\n default:\n NOTREACHED();\n return IDC_ARROW;\n }\n}\n\n} \/\/ namespace\n\nCursorLoader* CursorLoader::Create() {\n return new CursorLoaderWin;\n}\n\nCursorLoaderWin::CursorLoaderWin() {\n}\n\nCursorLoaderWin::~CursorLoaderWin() {\n}\n\nvoid CursorLoaderWin::LoadImageCursor(int id,\n int resource_id,\n const gfx::Point& hot) {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::LoadAnimatedCursor(int id,\n int resource_id,\n const gfx::Point& hot,\n int frame_delay_ms) {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::UnloadAll() {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::SetPlatformCursor(gfx::NativeCursor* cursor) {\n if (cursor->native_type() != kCursorCustom) {\n if (cursor->platform()) {\n cursor->SetPlatformCursor(cursor->platform());\n } else {\n const wchar_t* cursor_id = GetCursorId(*cursor);\n PlatformCursor platform_cursor = LoadCursor(NULL, cursor_id);\n if (!platform_cursor && !g_cursor_resource_module_name.Get().empty()) {\n platform_cursor = LoadCursor(\n GetModuleHandle(g_cursor_resource_module_name.Get().c_str()),\n cursor_id);\n }\n cursor->SetPlatformCursor(platform_cursor);\n }\n }\n}\n\n\/\/ static\nvoid CursorLoaderWin::SetCursorResourceModule(\n const base::string16& module_name) {\n g_cursor_resource_module_name.Get() = module_name;\n}\n\n} \/\/ namespace ui\n<commit_msg>[WIN] LoadCursor from the current executable<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/base\/cursor\/cursor_loader_win.h\"\n\n#include \"base\/lazy_instance.h\"\n#include \"base\/strings\/string16.h\"\n#include \"ui\/base\/cursor\/cursor.h\"\n#include \"ui\/resources\/grit\/ui_unscaled_resources.h\"\n\nnamespace ui {\n\nnamespace {\n\nbase::LazyInstance<base::string16> g_cursor_resource_module_name;\n\nconst wchar_t* GetCursorId(gfx::NativeCursor native_cursor) {\n switch (native_cursor.native_type()) {\n case kCursorNull:\n return IDC_ARROW;\n case kCursorPointer:\n return IDC_ARROW;\n case kCursorCross:\n return IDC_CROSS;\n case kCursorHand:\n return IDC_HAND;\n case kCursorIBeam:\n return IDC_IBEAM;\n case kCursorWait:\n return IDC_WAIT;\n case kCursorHelp:\n return IDC_HELP;\n case kCursorEastResize:\n return IDC_SIZEWE;\n case kCursorNorthResize:\n return IDC_SIZENS;\n case kCursorNorthEastResize:\n return IDC_SIZENESW;\n case kCursorNorthWestResize:\n return IDC_SIZENWSE;\n case kCursorSouthResize:\n return IDC_SIZENS;\n case kCursorSouthEastResize:\n return IDC_SIZENWSE;\n case kCursorSouthWestResize:\n return IDC_SIZENESW;\n case kCursorWestResize:\n return IDC_SIZEWE;\n case kCursorNorthSouthResize:\n return IDC_SIZENS;\n case kCursorEastWestResize:\n return IDC_SIZEWE;\n case kCursorNorthEastSouthWestResize:\n return IDC_SIZENESW;\n case kCursorNorthWestSouthEastResize:\n return IDC_SIZENWSE;\n case kCursorMove:\n return IDC_SIZEALL;\n case kCursorProgress:\n return IDC_APPSTARTING;\n case kCursorNoDrop:\n return IDC_NO;\n case kCursorNotAllowed:\n return IDC_NO;\n case kCursorColumnResize:\n return MAKEINTRESOURCE(IDC_COLRESIZE);\n case kCursorRowResize:\n return MAKEINTRESOURCE(IDC_ROWRESIZE);\n case kCursorMiddlePanning:\n return MAKEINTRESOURCE(IDC_PAN_MIDDLE);\n case kCursorEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_EAST);\n case kCursorNorthPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH);\n case kCursorNorthEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH_EAST);\n case kCursorNorthWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_NORTH_WEST);\n case kCursorSouthPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH);\n case kCursorSouthEastPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH_EAST);\n case kCursorSouthWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_SOUTH_WEST);\n case kCursorWestPanning:\n return MAKEINTRESOURCE(IDC_PAN_WEST);\n case kCursorVerticalText:\n return MAKEINTRESOURCE(IDC_VERTICALTEXT);\n case kCursorCell:\n return MAKEINTRESOURCE(IDC_CELL);\n case kCursorZoomIn:\n return MAKEINTRESOURCE(IDC_ZOOMIN);\n case kCursorZoomOut:\n return MAKEINTRESOURCE(IDC_ZOOMOUT);\n case kCursorGrab:\n return MAKEINTRESOURCE(IDC_HAND_GRAB);\n case kCursorGrabbing:\n return MAKEINTRESOURCE(IDC_HAND_GRABBING);\n case kCursorCopy:\n return MAKEINTRESOURCE(IDC_COPYCUR);\n case kCursorAlias:\n return MAKEINTRESOURCE(IDC_ALIAS);\n case kCursorNone:\n return MAKEINTRESOURCE(IDC_CURSOR_NONE);\n case kCursorContextMenu:\n case kCursorCustom:\n NOTIMPLEMENTED();\n return IDC_ARROW;\n default:\n NOTREACHED();\n return IDC_ARROW;\n }\n}\n\n} \/\/ namespace\n\nCursorLoader* CursorLoader::Create() {\n return new CursorLoaderWin;\n}\n\nCursorLoaderWin::CursorLoaderWin() {\n}\n\nCursorLoaderWin::~CursorLoaderWin() {\n}\n\nvoid CursorLoaderWin::LoadImageCursor(int id,\n int resource_id,\n const gfx::Point& hot) {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::LoadAnimatedCursor(int id,\n int resource_id,\n const gfx::Point& hot,\n int frame_delay_ms) {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::UnloadAll() {\n \/\/ NOTIMPLEMENTED();\n}\n\nvoid CursorLoaderWin::SetPlatformCursor(gfx::NativeCursor* cursor) {\n if (cursor->native_type() != kCursorCustom) {\n if (cursor->platform()) {\n cursor->SetPlatformCursor(cursor->platform());\n } else {\n const wchar_t* cursor_id = GetCursorId(*cursor);\n PlatformCursor platform_cursor = LoadCursor(NULL, cursor_id);\n if (!platform_cursor) {\n \/\/node-webkit: we don't use g_cursor_resource_module_name\n \/\/because it's not fixed as Chrome\n platform_cursor = LoadCursor(GetModuleHandle(NULL), cursor_id);\n }\n cursor->SetPlatformCursor(platform_cursor);\n }\n }\n}\n\n\/\/ static\nvoid CursorLoaderWin::SetCursorResourceModule(\n const base::string16& module_name) {\n g_cursor_resource_module_name.Get() = module_name;\n}\n\n} \/\/ namespace ui\n<|endoftext|>"} {"text":"<commit_before><commit_msg>gtk: Remove Backspace and Shift-Backspace accelerators.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>[linux] Skip stats question dialog on Linux if managed by policy.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Wrap the task manager treeview in a GtkScrolledWindow in order to have a frame around it.<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Make Chrome default after importing from current default browser.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (C) 2001-2011 by Serge Lamikhov-Center\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#ifndef ELFIO_SEGMENT_HPP\n#define ELFIO_SEGMENT_HPP\n\n#include <fstream>\n#include <vector>\n\nnamespace ELFIO {\n\nclass segment\n{\n friend class elfio;\n public:\n virtual ~segment() {};\n\n virtual Elf_Half get_index() const = 0;\n\n ELFIO_GET_SET_ACCESS_DECL( Elf_Word, type );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Word, flags );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, align );\n ELFIO_GET_SET_ACCESS_DECL( Elf64_Addr, virtual_address );\n ELFIO_GET_SET_ACCESS_DECL( Elf64_Addr, physical_address );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, file_size );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, memory_size );\n\n virtual const char* get_data() const = 0;\n\n virtual Elf_Half add_section_index( Elf_Half index, Elf_Xword addr_align ) = 0;\n virtual Elf_Half get_sections_num() const = 0;\n virtual Elf_Half get_section_index_at( Elf_Half num ) const = 0;\n\n protected:\n virtual void set_index( Elf_Half ) = 0;\n virtual void load( std::ifstream& stream, std::streampos header_offset ) const = 0;\n virtual void save( std::ofstream& f, std::streampos header_offset,\n std::streampos data_offset ) = 0;\n};\n\n\n\/\/------------------------------------------------------------------------------\ntemplate< class T >\nclass segment_impl : public segment\n{\n public:\n\/\/------------------------------------------------------------------------------\n segment_impl( endianess_convertor* convertor_ ) :\n convertor( convertor_ )\n {\n std::fill_n( reinterpret_cast<char*>( &ph ), sizeof( ph ), '\\0' );\n data = 0;\n }\n\n\/\/------------------------------------------------------------------------------\n virtual ~segment_impl()\n {\n delete [] data;\n }\n\n\/\/------------------------------------------------------------------------------\n \/\/ Section info functions\n ELFIO_GET_SET_ACCESS( Elf_Word, type, ph.p_type );\n ELFIO_GET_SET_ACCESS( Elf_Word, flags, ph.p_flags );\n ELFIO_GET_SET_ACCESS( Elf_Xword, align, ph.p_align );\n ELFIO_GET_SET_ACCESS( Elf64_Addr, virtual_address, ph.p_vaddr );\n ELFIO_GET_SET_ACCESS( Elf64_Addr, physical_address, ph.p_paddr );\n ELFIO_GET_SET_ACCESS( Elf_Xword, file_size, ph.p_filesz );\n ELFIO_GET_SET_ACCESS( Elf_Xword, memory_size, ph.p_memsz );\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_index() const\n {\n return index;\n }\n\n\/\/------------------------------------------------------------------------------\n const char*\n get_data() const\n {\n return data;\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n add_section_index( Elf_Half index, Elf_Xword addr_align )\n {\n sections.push_back( index );\n if ( addr_align > get_align() ) {\n set_align( addr_align );\n }\n\n return (Elf_Half)sections.size();\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_sections_num() const\n {\n return (Elf_Half)sections.size();\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_section_index_at( Elf_Half num ) const\n {\n if ( num < sections.size() ) {\n return sections[num];\n }\n\n return -1;\n }\n\n\/\/------------------------------------------------------------------------------\n protected:\n\/\/------------------------------------------------------------------------------\n void\n set_index( Elf_Half value )\n {\n index = value;\n }\n\n\/\/------------------------------------------------------------------------------\n void\n load( std::ifstream& stream,\n std::streampos header_offset ) const\n {\n stream.seekg( header_offset );\n stream.read( reinterpret_cast<char*>( &ph ), sizeof( ph ) );\n\n if ( PT_NULL != get_type() && 0 != get_file_size() ) {\n stream.seekg( (*convertor)( ph.p_offset ) );\n Elf_Xword size = get_file_size();\n data = new char[size];\n if ( 0 != data ) {\n stream.read( data, size );\n }\n }\n }\n\n\/\/------------------------------------------------------------------------------\n void save( std::ofstream& f,\n std::streampos header_offset,\n std::streampos data_offset )\n {\n ph.p_offset = data_offset;\n f.seekp( header_offset );\n f.write( reinterpret_cast<const char*>( &ph ), sizeof( ph ) );\n }\n\n\/\/------------------------------------------------------------------------------\n private:\n mutable T ph;\n Elf_Half index;\n mutable char* data;\n std::vector<Elf_Half> sections;\n endianess_convertor* convertor;\n};\n\n} \/\/ namespace ELFIO\n\n#endif \/\/ ELFIO_SEGMENT_HPP\n<commit_msg>Ticket #9: Segment offset written in wrong endianess.<commit_after>\/*\nCopyright (C) 2001-2011 by Serge Lamikhov-Center\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*\/\n\n#ifndef ELFIO_SEGMENT_HPP\n#define ELFIO_SEGMENT_HPP\n\n#include <fstream>\n#include <vector>\n\nnamespace ELFIO {\n\nclass segment\n{\n friend class elfio;\n public:\n virtual ~segment() {};\n\n virtual Elf_Half get_index() const = 0;\n\n ELFIO_GET_SET_ACCESS_DECL( Elf_Word, type );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Word, flags );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, align );\n ELFIO_GET_SET_ACCESS_DECL( Elf64_Addr, virtual_address );\n ELFIO_GET_SET_ACCESS_DECL( Elf64_Addr, physical_address );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, file_size );\n ELFIO_GET_SET_ACCESS_DECL( Elf_Xword, memory_size );\n\n virtual const char* get_data() const = 0;\n\n virtual Elf_Half add_section_index( Elf_Half index, Elf_Xword addr_align ) = 0;\n virtual Elf_Half get_sections_num() const = 0;\n virtual Elf_Half get_section_index_at( Elf_Half num ) const = 0;\n\n protected:\n virtual void set_index( Elf_Half ) = 0;\n virtual void load( std::ifstream& stream, std::streampos header_offset ) const = 0;\n virtual void save( std::ofstream& f, std::streampos header_offset,\n std::streampos data_offset ) = 0;\n};\n\n\n\/\/------------------------------------------------------------------------------\ntemplate< class T >\nclass segment_impl : public segment\n{\n public:\n\/\/------------------------------------------------------------------------------\n segment_impl( endianess_convertor* convertor_ ) :\n convertor( convertor_ )\n {\n std::fill_n( reinterpret_cast<char*>( &ph ), sizeof( ph ), '\\0' );\n data = 0;\n }\n\n\/\/------------------------------------------------------------------------------\n virtual ~segment_impl()\n {\n delete [] data;\n }\n\n\/\/------------------------------------------------------------------------------\n \/\/ Section info functions\n ELFIO_GET_SET_ACCESS( Elf_Word, type, ph.p_type );\n ELFIO_GET_SET_ACCESS( Elf_Word, flags, ph.p_flags );\n ELFIO_GET_SET_ACCESS( Elf_Xword, align, ph.p_align );\n ELFIO_GET_SET_ACCESS( Elf64_Addr, virtual_address, ph.p_vaddr );\n ELFIO_GET_SET_ACCESS( Elf64_Addr, physical_address, ph.p_paddr );\n ELFIO_GET_SET_ACCESS( Elf_Xword, file_size, ph.p_filesz );\n ELFIO_GET_SET_ACCESS( Elf_Xword, memory_size, ph.p_memsz );\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_index() const\n {\n return index;\n }\n\n\/\/------------------------------------------------------------------------------\n const char*\n get_data() const\n {\n return data;\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n add_section_index( Elf_Half index, Elf_Xword addr_align )\n {\n sections.push_back( index );\n if ( addr_align > get_align() ) {\n set_align( addr_align );\n }\n\n return (Elf_Half)sections.size();\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_sections_num() const\n {\n return (Elf_Half)sections.size();\n }\n\n\/\/------------------------------------------------------------------------------\n Elf_Half\n get_section_index_at( Elf_Half num ) const\n {\n if ( num < sections.size() ) {\n return sections[num];\n }\n\n return -1;\n }\n\n\/\/------------------------------------------------------------------------------\n protected:\n\/\/------------------------------------------------------------------------------\n void\n set_index( Elf_Half value )\n {\n index = value;\n }\n\n\/\/------------------------------------------------------------------------------\n void\n load( std::ifstream& stream,\n std::streampos header_offset ) const\n {\n stream.seekg( header_offset );\n stream.read( reinterpret_cast<char*>( &ph ), sizeof( ph ) );\n\n if ( PT_NULL != get_type() && 0 != get_file_size() ) {\n stream.seekg( (*convertor)( ph.p_offset ) );\n Elf_Xword size = get_file_size();\n data = new char[size];\n if ( 0 != data ) {\n stream.read( data, size );\n }\n }\n }\n\n\/\/------------------------------------------------------------------------------\n void save( std::ofstream& f,\n std::streampos header_offset,\n std::streampos data_offset )\n {\n ph.p_offset = data_offset;\n ph.p_offset = (*convertor)(ph.p_offset);\n f.seekp( header_offset );\n f.write( reinterpret_cast<const char*>( &ph ), sizeof( ph ) );\n }\n\n\/\/------------------------------------------------------------------------------\n private:\n mutable T ph;\n Elf_Half index;\n mutable char* data;\n std::vector<Elf_Half> sections;\n endianess_convertor* convertor;\n};\n\n} \/\/ namespace ELFIO\n\n#endif \/\/ ELFIO_SEGMENT_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Ouzel by Elviss Strazdins\n\n#ifndef OUZEL_SCENE_CAMERA_HPP\n#define OUZEL_SCENE_CAMERA_HPP\n\n#include <memory>\n#include \"Component.hpp\"\n#include \"..\/math\/Constants.hpp\"\n#include \"..\/math\/Matrix.hpp\"\n#include \"..\/math\/Rect.hpp\"\n#include \"..\/graphics\/DepthStencilState.hpp\"\n#include \"..\/graphics\/RenderTarget.hpp\"\n\nnamespace ouzel::scene\n{\n class Layer;\n\n class Camera: public Component\n {\n friend Layer;\n public:\n enum class ProjectionMode\n {\n custom,\n orthographic,\n perspective\n };\n\n enum class ScaleMode\n {\n noScale,\n exactFit,\n noBorder,\n showAll\n };\n\n explicit Camera(const math::Matrix<float, 4>& initProjection);\n explicit Camera(const math::Size<float, 2>& initTargetContentSize = math::Size<float, 2>{}, ScaleMode initScaleMode = ScaleMode::noScale);\n explicit Camera(float initFov, float initNearPlane = 1.0F, float initFarPlane = 100.0F);\n ~Camera() override;\n\n [[nodiscard]] auto getProjectionMode() const noexcept { return projectionMode; }\n void setProjectionMode(ProjectionMode newProjectionMode) { projectionMode = newProjectionMode; }\n\n [[nodiscard]] auto getFOV() const noexcept { return fov; }\n void setFOV(float newFOV) { fov = newFOV; }\n\n [[nodiscard]] auto getNearPlane() const noexcept { return nearPlane; }\n void setNearPlane(float newNearPlane) { nearPlane = newNearPlane; }\n\n [[nodiscard]] auto getFarPlane() const noexcept { return farPlane; }\n void setFarPlane(float newFarPlane) { farPlane = newFarPlane; }\n\n [[nodiscard]] auto& getProjection() const noexcept { return projection; }\n void recalculateProjection();\n\n const math::Matrix<float, 4>& getViewProjection() const;\n const math::Matrix<float, 4>& getRenderViewProjection() const;\n const math::Matrix<float, 4>& getInverseViewProjection() const;\n\n math::Vector<float, 3> convertNormalizedToWorld(const math::Vector<float, 2>& normalizedPosition) const;\n math::Vector<float, 2> convertWorldToNormalized(const math::Vector<float, 3>& worldPosition) const;\n\n bool checkVisibility(const math::Matrix<float, 4>& boxTransform, const math::Box<float, 3>& box) const;\n\n [[nodiscard]] auto& getViewport() const noexcept { return viewport; }\n [[nodiscard]] auto& getRenderViewport() const noexcept { return renderViewport; }\n void setViewport(const math::Rect<float>& newViewport);\n\n [[nodiscard]] auto getScaleMode() const noexcept { return scaleMode; }\n void setScaleMode(ScaleMode newScaleMode);\n\n [[nodiscard]] auto& getTargetContentSize() const noexcept { return targetContentSize; }\n void setTargetContentSize(const math::Size<float, 2>& newTargetContentSize);\n\n [[nodiscard]] auto& getContentSize() const noexcept { return contentSize; }\n [[nodiscard]] auto& getContentScale() const noexcept { return contentScale; }\n [[nodiscard]] auto& getContentPosition() const noexcept { return contentPosition; }\n\n [[nodiscard]] auto getRenderTarget() const noexcept { return renderTarget; }\n void setRenderTarget(graphics::RenderTarget* newRenderTarget);\n\n [[nodiscard]] auto getDepthTest() const noexcept { return depthTest; }\n void setDepthTest(bool newDepthTest);\n [[nodiscard]] auto& getDepthStencilState() const noexcept { return depthStencilState; }\n\n [[nodiscard]] auto getStencilReferenceValue() const noexcept { return stencilReferenceValue; }\n void setStencilReferenceValue(std::uint32_t newStencilReferenceValue) { stencilReferenceValue = newStencilReferenceValue; }\n\n [[nodiscard]] auto getWireframe() const noexcept { return wireframe; }\n void setWireframe(bool newWireframe) { wireframe = newWireframe; }\n\n [[nodiscard]] auto getClearColorBuffer() const noexcept { return clearColorBuffer; }\n void setClearColorBuffer(bool clear) { clearColorBuffer = clear; }\n\n [[nodiscard]] auto getClearDepthBuffer() const noexcept { return clearDepthBuffer; }\n void setClearDepthBuffer(bool clear) { clearDepthBuffer = clear; }\n\n [[nodiscard]] auto getClearStencilBuffer() const noexcept { return clearStencilBuffer; }\n void setClearStencilBuffer(bool clear) { clearStencilBuffer = clear; }\n\n [[nodiscard]] auto getClearColor() const noexcept { return clearColor; }\n void setClearColor(math::Color color) { clearColor = color; }\n\n [[nodiscard]] auto getClearDepth() const noexcept { return clearDepth; }\n void setClearDepth(float depth) { clearDepth = depth; }\n\n [[nodiscard]] auto getClearStencil() const noexcept { return clearStencil; }\n void setClearDepth(std::uint32_t stencil) { clearStencil = stencil; }\n\n private:\n void setActor(Actor* newActor) override;\n void setLayer(Layer* newLayer) override;\n\n void updateTransform() override;\n void calculateViewProjection() const;\n\n ProjectionMode projectionMode;\n float fov = math::tau<float> \/ 6.0F;\n float nearPlane = 1.0F;\n float farPlane = 100.0F;\n\n math::Matrix<float, 4> projection;\n\n math::Rect<float> viewport = math::Rect<float>{0.0F, 0.0F, 1.0F, 1.0F};\n math::Rect<float> renderViewport;\n math::Size<float, 2> targetContentSize;\n\n ScaleMode scaleMode = ScaleMode::noScale;\n math::Size<float, 2> contentSize{};\n math::Vector<float, 2> contentScale{};\n math::Vector<float, 2> contentPosition{};\n\n bool depthTest = false;\n bool wireframe = false;\n\n mutable bool viewProjectionDirty = true;\n mutable math::Matrix<float, 4> viewProjection;\n mutable math::Matrix<float, 4> renderViewProjection;\n\n mutable bool inverseViewProjectionDirty = true;\n mutable math::Matrix<float, 4> inverseViewProjection;\n\n graphics::RenderTarget* renderTarget = nullptr;\n std::unique_ptr<graphics::DepthStencilState> depthStencilState;\n std::uint32_t stencilReferenceValue = 0;\n\n bool clearColorBuffer = false;\n bool clearDepthBuffer = false;\n bool clearStencilBuffer = false;\n math::Color clearColor;\n float clearDepth = 1.0F;\n std::uint32_t clearStencil = 0;\n };\n}\n\n#endif \/\/ OUZEL_SCENE_CAMERA_HPP\n<commit_msg>Change the casing of FOV<commit_after>\/\/ Ouzel by Elviss Strazdins\n\n#ifndef OUZEL_SCENE_CAMERA_HPP\n#define OUZEL_SCENE_CAMERA_HPP\n\n#include <memory>\n#include \"Component.hpp\"\n#include \"..\/math\/Constants.hpp\"\n#include \"..\/math\/Matrix.hpp\"\n#include \"..\/math\/Rect.hpp\"\n#include \"..\/graphics\/DepthStencilState.hpp\"\n#include \"..\/graphics\/RenderTarget.hpp\"\n\nnamespace ouzel::scene\n{\n class Layer;\n\n class Camera: public Component\n {\n friend Layer;\n public:\n enum class ProjectionMode\n {\n custom,\n orthographic,\n perspective\n };\n\n enum class ScaleMode\n {\n noScale,\n exactFit,\n noBorder,\n showAll\n };\n\n explicit Camera(const math::Matrix<float, 4>& initProjection);\n explicit Camera(const math::Size<float, 2>& initTargetContentSize = math::Size<float, 2>{}, ScaleMode initScaleMode = ScaleMode::noScale);\n explicit Camera(float initFov, float initNearPlane = 1.0F, float initFarPlane = 100.0F);\n ~Camera() override;\n\n [[nodiscard]] auto getProjectionMode() const noexcept { return projectionMode; }\n void setProjectionMode(ProjectionMode newProjectionMode) { projectionMode = newProjectionMode; }\n\n [[nodiscard]] auto getFov() const noexcept { return fov; }\n void setFov(float newFov) { fov = newFov; }\n\n [[nodiscard]] auto getNearPlane() const noexcept { return nearPlane; }\n void setNearPlane(float newNearPlane) { nearPlane = newNearPlane; }\n\n [[nodiscard]] auto getFarPlane() const noexcept { return farPlane; }\n void setFarPlane(float newFarPlane) { farPlane = newFarPlane; }\n\n [[nodiscard]] auto& getProjection() const noexcept { return projection; }\n void recalculateProjection();\n\n const math::Matrix<float, 4>& getViewProjection() const;\n const math::Matrix<float, 4>& getRenderViewProjection() const;\n const math::Matrix<float, 4>& getInverseViewProjection() const;\n\n math::Vector<float, 3> convertNormalizedToWorld(const math::Vector<float, 2>& normalizedPosition) const;\n math::Vector<float, 2> convertWorldToNormalized(const math::Vector<float, 3>& worldPosition) const;\n\n bool checkVisibility(const math::Matrix<float, 4>& boxTransform, const math::Box<float, 3>& box) const;\n\n [[nodiscard]] auto& getViewport() const noexcept { return viewport; }\n [[nodiscard]] auto& getRenderViewport() const noexcept { return renderViewport; }\n void setViewport(const math::Rect<float>& newViewport);\n\n [[nodiscard]] auto getScaleMode() const noexcept { return scaleMode; }\n void setScaleMode(ScaleMode newScaleMode);\n\n [[nodiscard]] auto& getTargetContentSize() const noexcept { return targetContentSize; }\n void setTargetContentSize(const math::Size<float, 2>& newTargetContentSize);\n\n [[nodiscard]] auto& getContentSize() const noexcept { return contentSize; }\n [[nodiscard]] auto& getContentScale() const noexcept { return contentScale; }\n [[nodiscard]] auto& getContentPosition() const noexcept { return contentPosition; }\n\n [[nodiscard]] auto getRenderTarget() const noexcept { return renderTarget; }\n void setRenderTarget(graphics::RenderTarget* newRenderTarget);\n\n [[nodiscard]] auto getDepthTest() const noexcept { return depthTest; }\n void setDepthTest(bool newDepthTest);\n [[nodiscard]] auto& getDepthStencilState() const noexcept { return depthStencilState; }\n\n [[nodiscard]] auto getStencilReferenceValue() const noexcept { return stencilReferenceValue; }\n void setStencilReferenceValue(std::uint32_t newStencilReferenceValue) { stencilReferenceValue = newStencilReferenceValue; }\n\n [[nodiscard]] auto getWireframe() const noexcept { return wireframe; }\n void setWireframe(bool newWireframe) { wireframe = newWireframe; }\n\n [[nodiscard]] auto getClearColorBuffer() const noexcept { return clearColorBuffer; }\n void setClearColorBuffer(bool clear) { clearColorBuffer = clear; }\n\n [[nodiscard]] auto getClearDepthBuffer() const noexcept { return clearDepthBuffer; }\n void setClearDepthBuffer(bool clear) { clearDepthBuffer = clear; }\n\n [[nodiscard]] auto getClearStencilBuffer() const noexcept { return clearStencilBuffer; }\n void setClearStencilBuffer(bool clear) { clearStencilBuffer = clear; }\n\n [[nodiscard]] auto getClearColor() const noexcept { return clearColor; }\n void setClearColor(math::Color color) { clearColor = color; }\n\n [[nodiscard]] auto getClearDepth() const noexcept { return clearDepth; }\n void setClearDepth(float depth) { clearDepth = depth; }\n\n [[nodiscard]] auto getClearStencil() const noexcept { return clearStencil; }\n void setClearDepth(std::uint32_t stencil) { clearStencil = stencil; }\n\n private:\n void setActor(Actor* newActor) override;\n void setLayer(Layer* newLayer) override;\n\n void updateTransform() override;\n void calculateViewProjection() const;\n\n ProjectionMode projectionMode;\n float fov = math::tau<float> \/ 6.0F;\n float nearPlane = 1.0F;\n float farPlane = 100.0F;\n\n math::Matrix<float, 4> projection;\n\n math::Rect<float> viewport = math::Rect<float>{0.0F, 0.0F, 1.0F, 1.0F};\n math::Rect<float> renderViewport;\n math::Size<float, 2> targetContentSize;\n\n ScaleMode scaleMode = ScaleMode::noScale;\n math::Size<float, 2> contentSize{};\n math::Vector<float, 2> contentScale{};\n math::Vector<float, 2> contentPosition{};\n\n bool depthTest = false;\n bool wireframe = false;\n\n mutable bool viewProjectionDirty = true;\n mutable math::Matrix<float, 4> viewProjection;\n mutable math::Matrix<float, 4> renderViewProjection;\n\n mutable bool inverseViewProjectionDirty = true;\n mutable math::Matrix<float, 4> inverseViewProjection;\n\n graphics::RenderTarget* renderTarget = nullptr;\n std::unique_ptr<graphics::DepthStencilState> depthStencilState;\n std::uint32_t stencilReferenceValue = 0;\n\n bool clearColorBuffer = false;\n bool clearDepthBuffer = false;\n bool clearStencilBuffer = false;\n math::Color clearColor;\n float clearDepth = 1.0F;\n std::uint32_t clearStencil = 0;\n };\n}\n\n#endif \/\/ OUZEL_SCENE_CAMERA_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {ROI_QB_MUL_1.png}\n\/\/ OUTPUTS: {MSLabeledOutput.tif}, {MSClusteredOutput.tif} {MSLabeledOutput-pretty.png}, {MSClusteredOutput-pretty.png}\n\/\/ 16 16 100 100 0.1\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example demonstrates the use of the\n\/\/ \\doxygen{otb}{MeanShiftSegmentationFilter} class which implements\n\/\/ filtering and clustering using the mean shift algorithm\n\/\/ \\cite{Comaniciu2002}. For a given pixel, the mean shift will\n\/\/ build a set of neighboring pixels within a given spatial radius\n\/\/ and a color range. The spatial and color center of this set is\n\/\/ then computed and the algorithm iterates with this new spatial and\n\/\/ color center. The Mean Shift can be used for edge-preserving\n\/\/ smoothing, or for clustering.\n\/\/\n\/\/ Software Guide : EndLatex\n\n#include \"itkMacro.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbPrintableImageFilter.h\"\n\n#include \"itkRGBPixel.h\"\n#include \"itkScalarToRGBPixelFunctor.h\"\n#include \"itkUnaryFunctorImageFilter.h\"\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We start by including the needed header file.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbMeanShiftSegmentationFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\nint main(int argc, char * argv[])\n{\n if (argc != 11)\n {\n std::cerr << \"Usage: \" << argv[0] << \" infname labeledfname clusteredfname labeledpretty clusteredpretty \"\n << \"spatialRadius rangeRadius minRegionSize maxiter thres\" << std::endl;\n return EXIT_FAILURE;\n }\n\n const char * infname = argv[1];\n const char * labeledfname = argv[2];\n const char * clusteredfname = argv[3];\n const char * labeledpretty = argv[4];\n const char * clusteredpretty = argv[5];\n const unsigned int spatialRadius = atoi(argv[6]);\n const double rangeRadius = atof(argv[7]);\n const unsigned int minRegionSize = atoi(argv[8]);\n const unsigned int maxiter = atoi(argv[9]);\n const double thres = atof(argv[10]);\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We start by the classical \\code{typedef}s needed for reading and\n \/\/ writing the images.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n const unsigned int Dimension = 2;\n\n typedef float PixelType;\n typedef unsigned int LabelPixelType;\n typedef itk::RGBPixel<unsigned char> ColorPixelType;\n\n typedef otb::VectorImage<PixelType, Dimension> ImageType;\n typedef otb::Image<LabelPixelType, Dimension> LabelImageType;\n typedef otb::Image<ColorPixelType, Dimension> RGBImageType;\n\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<ImageType> WriterType;\n typedef otb::StreamingImageFileWriter<LabelImageType> LabelWriterType;\n\n typedef otb::MeanShiftSegmentationFilter<ImageType, LabelImageType, ImageType> FilterType;\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We instantiate the filter, the reader, and 2 writers (for the\n \/\/ labeled and clustered images).\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n FilterType::Pointer filter = FilterType::New();\n ReaderType::Pointer reader = ReaderType::New();\n WriterType::Pointer writer1 = WriterType::New();\n LabelWriterType::Pointer writer2 = LabelWriterType::New();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We set the file names for the reader and the writers:\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n reader->SetFileName(infname);\n writer1->SetFileName(clusteredfname);\n writer2->SetFileName(labeledfname);\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now set the parameters for the filter. There are 3 main\n \/\/ parameters: the spatial radius used for defining the neighborhood,\n \/\/ the range radius used for defining the interval in the color space\n \/\/ and the minimum size for the regions to be kept after clustering.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetSpatialBandwidth(spatialRadius);\n filter->SetRangeBandwidth(rangeRadius);\n filter->SetMinRegionSize(minRegionSize);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ Two another parameters can be set : the maximum iteration number, which defines maximum number of iteration until convergence.\n \/\/ Algorithm iterative scheme will stop if convergence hasn't been reached after the maximum number of iterations.\n \/\/ Threshold parameter defines mean-shift vector convergence value. Algorithm iterative scheme will stop if mean-shift vector is below this threshold or if iteration number reached maximum number of iterations.\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetMaxIterationNumber(maxiter);\n filter->SetThreshold(thres);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now plug the pipeline and run it.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetInput(reader->GetOutput());\n writer1->SetInput(filter->GetClusteredOutput());\n writer2->SetInput(filter->GetLabelOutput());\n\n writer1->Update();\n writer2->Update();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/ Figure~\\ref{fig:MeanShiftSegmentationFilter} shows the result of applying the mean shift\n \/\/ to a Quickbird image.\n \/\/ \\begin{figure}\n \/\/ \\center\n \/\/ \\includegraphics[width=0.40\\textwidth]{ROI_QB_MUL_1.eps}\n \/\/ \\includegraphics[width=0.40\\textwidth]{MSClusteredOutput-pretty.eps}\n \/\/ \\includegraphics[width=0.40\\textwidth]{MSLabeledOutput-pretty.eps}\n \/\/ \\itkcaption[Mean Shift]{From top to bottom and left to right:\n \/\/ Original image, image filtered by\n \/\/ mean shift after clustering , and labeled image.}\n \/\/ \\label{fig:MeanShiftSegmentationFilter}\n \/\/ \\end{figure}\n \/\/ Software Guide : EndLatex\n\n typedef otb::PrintableImageFilter<ImageType> PrintableFilterType;\n PrintableFilterType::Pointer printableImageFilter = PrintableFilterType::New();\n\n printableImageFilter->SetChannel(1);\n printableImageFilter->SetChannel(2);\n printableImageFilter->SetChannel(3);\n\n typedef PrintableFilterType::OutputImageType OutputImageType;\n typedef otb::ImageFileWriter<OutputImageType> PrettyWriterType;\n\n PrettyWriterType::Pointer prettyWriter = PrettyWriterType::New();\n\n printableImageFilter->SetInput(filter->GetClusteredOutput());\n prettyWriter->SetFileName(clusteredpretty);\n prettyWriter->SetInput(printableImageFilter->GetOutput());\n prettyWriter->Update();\n\n typedef otb::ImageFileWriter<RGBImageType> LabelRGBWriterType;\n\n LabelRGBWriterType::Pointer labelRGBWriter = LabelRGBWriterType::New();\n\n \/\/ Label to RGB image\n typedef itk::Functor::ScalarToRGBPixelFunctor<LabelPixelType> FunctorType;\n typedef itk::UnaryFunctorImageFilter<LabelImageType, RGBImageType, FunctorType> ColorLabelFilterType;\n ColorLabelFilterType::Pointer labelToRGB = ColorLabelFilterType::New();\n\n labelToRGB->SetInput(filter->GetLabelOutput());\n\n labelRGBWriter->SetFileName(labeledpretty);\n labelRGBWriter->SetInput(labelToRGB->GetOutput());\n labelRGBWriter->Update();\n\n return EXIT_SUCCESS;\n}\n<commit_msg>COMP: command line change for Art generation in needed by SG.<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n\/\/ Software Guide : BeginCommandLineArgs\n\/\/ INPUTS: {ROI_QB_MUL_1.png}\n\/\/ OUTPUTS: {MSLabeledOutput.tif}, {MSClusteredOutput.tif}, {MSLabeledOutput-pretty.png}, {MSClusteredOutput-pretty.png}\n\/\/ 16 16 100 100 0.1\n\/\/ Software Guide : EndCommandLineArgs\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ This example demonstrates the use of the\n\/\/ \\doxygen{otb}{MeanShiftSegmentationFilter} class which implements\n\/\/ filtering and clustering using the mean shift algorithm\n\/\/ \\cite{Comaniciu2002}. For a given pixel, the mean shift will\n\/\/ build a set of neighboring pixels within a given spatial radius\n\/\/ and a color range. The spatial and color center of this set is\n\/\/ then computed and the algorithm iterates with this new spatial and\n\/\/ color center. The Mean Shift can be used for edge-preserving\n\/\/ smoothing, or for clustering.\n\/\/\n\/\/ Software Guide : EndLatex\n\n#include \"itkMacro.h\"\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbImageFileWriter.h\"\n#include \"otbPrintableImageFilter.h\"\n\n#include \"itkRGBPixel.h\"\n#include \"itkScalarToRGBPixelFunctor.h\"\n#include \"itkUnaryFunctorImageFilter.h\"\n\n\/\/ Software Guide : BeginLatex\n\/\/\n\/\/ We start by including the needed header file.\n\/\/\n\/\/ Software Guide : EndLatex\n\n\/\/ Software Guide : BeginCodeSnippet\n#include \"otbMeanShiftSegmentationFilter.h\"\n\/\/ Software Guide : EndCodeSnippet\nint main(int argc, char * argv[])\n{\n if (argc != 11)\n {\n std::cerr << \"Usage: \" << argv[0] << \" infname labeledfname clusteredfname labeledpretty clusteredpretty \"\n << \"spatialRadius rangeRadius minRegionSize maxiter thres\" << std::endl;\n return EXIT_FAILURE;\n }\n\n const char * infname = argv[1];\n const char * labeledfname = argv[2];\n const char * clusteredfname = argv[3];\n const char * labeledpretty = argv[4];\n const char * clusteredpretty = argv[5];\n const unsigned int spatialRadius = atoi(argv[6]);\n const double rangeRadius = atof(argv[7]);\n const unsigned int minRegionSize = atoi(argv[8]);\n const unsigned int maxiter = atoi(argv[9]);\n const double thres = atof(argv[10]);\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We start by the classical \\code{typedef}s needed for reading and\n \/\/ writing the images.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n const unsigned int Dimension = 2;\n\n typedef float PixelType;\n typedef unsigned int LabelPixelType;\n typedef itk::RGBPixel<unsigned char> ColorPixelType;\n\n typedef otb::VectorImage<PixelType, Dimension> ImageType;\n typedef otb::Image<LabelPixelType, Dimension> LabelImageType;\n typedef otb::Image<ColorPixelType, Dimension> RGBImageType;\n\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<ImageType> WriterType;\n typedef otb::StreamingImageFileWriter<LabelImageType> LabelWriterType;\n\n typedef otb::MeanShiftSegmentationFilter<ImageType, LabelImageType, ImageType> FilterType;\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We instantiate the filter, the reader, and 2 writers (for the\n \/\/ labeled and clustered images).\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n FilterType::Pointer filter = FilterType::New();\n ReaderType::Pointer reader = ReaderType::New();\n WriterType::Pointer writer1 = WriterType::New();\n LabelWriterType::Pointer writer2 = LabelWriterType::New();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We set the file names for the reader and the writers:\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n reader->SetFileName(infname);\n writer1->SetFileName(clusteredfname);\n writer2->SetFileName(labeledfname);\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now set the parameters for the filter. There are 3 main\n \/\/ parameters: the spatial radius used for defining the neighborhood,\n \/\/ the range radius used for defining the interval in the color space\n \/\/ and the minimum size for the regions to be kept after clustering.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetSpatialBandwidth(spatialRadius);\n filter->SetRangeBandwidth(rangeRadius);\n filter->SetMinRegionSize(minRegionSize);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ Two another parameters can be set : the maximum iteration number, which defines maximum number of iteration until convergence.\n \/\/ Algorithm iterative scheme will stop if convergence hasn't been reached after the maximum number of iterations.\n \/\/ Threshold parameter defines mean-shift vector convergence value. Algorithm iterative scheme will stop if mean-shift vector is below this threshold or if iteration number reached maximum number of iterations.\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetMaxIterationNumber(maxiter);\n filter->SetThreshold(thres);\n \/\/ Software Guide : EndCodeSnippet\n \/\/ Software Guide : BeginLatex\n \/\/\n \/\/ We can now plug the pipeline and run it.\n \/\/\n \/\/ Software Guide : EndLatex\n\n \/\/ Software Guide : BeginCodeSnippet\n filter->SetInput(reader->GetOutput());\n writer1->SetInput(filter->GetClusteredOutput());\n writer2->SetInput(filter->GetLabelOutput());\n\n writer1->Update();\n writer2->Update();\n \/\/ Software Guide : EndCodeSnippet\n\n \/\/ Software Guide : BeginLatex\n \/\/ Figure~\\ref{fig:MeanShiftSegmentationFilter} shows the result of applying the mean shift\n \/\/ to a Quickbird image.\n \/\/ \\begin{figure}\n \/\/ \\center\n \/\/ \\includegraphics[width=0.40\\textwidth]{ROI_QB_MUL_1.eps}\n \/\/ \\includegraphics[width=0.40\\textwidth]{MSClusteredOutput-pretty.eps}\n \/\/ \\includegraphics[width=0.40\\textwidth]{MSLabeledOutput-pretty.eps}\n \/\/ \\itkcaption[Mean Shift]{From top to bottom and left to right:\n \/\/ Original image, image filtered by\n \/\/ mean shift after clustering , and labeled image.}\n \/\/ \\label{fig:MeanShiftSegmentationFilter}\n \/\/ \\end{figure}\n \/\/ Software Guide : EndLatex\n\n typedef otb::PrintableImageFilter<ImageType> PrintableFilterType;\n PrintableFilterType::Pointer printableImageFilter = PrintableFilterType::New();\n\n printableImageFilter->SetChannel(1);\n printableImageFilter->SetChannel(2);\n printableImageFilter->SetChannel(3);\n\n typedef PrintableFilterType::OutputImageType OutputImageType;\n typedef otb::ImageFileWriter<OutputImageType> PrettyWriterType;\n\n PrettyWriterType::Pointer prettyWriter = PrettyWriterType::New();\n\n printableImageFilter->SetInput(filter->GetClusteredOutput());\n prettyWriter->SetFileName(clusteredpretty);\n prettyWriter->SetInput(printableImageFilter->GetOutput());\n prettyWriter->Update();\n\n typedef otb::ImageFileWriter<RGBImageType> LabelRGBWriterType;\n\n LabelRGBWriterType::Pointer labelRGBWriter = LabelRGBWriterType::New();\n\n \/\/ Label to RGB image\n typedef itk::Functor::ScalarToRGBPixelFunctor<LabelPixelType> FunctorType;\n typedef itk::UnaryFunctorImageFilter<LabelImageType, RGBImageType, FunctorType> ColorLabelFilterType;\n ColorLabelFilterType::Pointer labelToRGB = ColorLabelFilterType::New();\n\n labelToRGB->SetInput(filter->GetLabelOutput());\n\n labelRGBWriter->SetFileName(labeledpretty);\n labelRGBWriter->SetInput(labelToRGB->GetOutput());\n labelRGBWriter->Update();\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <OGL\/OGLGpuBuffer.h>\n\nstd::vector<GLBufferId> OGLHgGPUBuffer::m_useableBufferIds;\n\n\nGLBufferId::~GLBufferId()\n{\n\tif (buffId > 0) {\n\t\tglDeleteBuffers(1, &buffId);\n\t\tglDeleteTextures(1, &texId);\n\t}\n\ttexId = 0;\n\tbuffId = 0;\n}\n\nvoid GLBufferId::AllocateOnGPU()\n{\n\tif (texId == 0) {\n\t\tglGenBuffers(1, &buffId);\n\t\tglGenTextures(1, &texId);\n\t}\n}\n\nGLBufferId::GLBufferId(GLBufferId&& rhs)\n{\n\t*this = std::move(rhs);\n}\n\nconst GLBufferId& GLBufferId::operator=(GLBufferId&& rhs)\n{\n\tstd::swap(buffId, rhs.buffId);\n\tstd::swap(texId, rhs.texId);\n\treturn *this;\n}\n\n\n\nGLBufferId OGLHgGPUBuffer::getGLBufferId()\n{\n\tif (m_useableBufferIds.size() > 0)\n\t{\n\t\tauto r = std::move(m_useableBufferIds.back());\n\t\tm_useableBufferIds.pop_back();\n\t\treturn r;\n\t}\n\n\tGLBufferId ids;\n\tids.AllocateOnGPU();\n\treturn ids;\n}\n\nvoid OGLHgGPUBuffer::freeGLBufferId(GLBufferId& rhs)\n{\n\tm_useableBufferIds.emplace_back(std::move(rhs));\n}\n\n\nOGLHgGPUBuffer::~OGLHgGPUBuffer()\n{\n\tfreeGLBufferId(m_bufferIds);\n}\n\nvoid OGLHgGPUBuffer::SendToGPU(const IHgGPUBuffer* bufferObject) {\n\tm_bufferIds = getGLBufferId();\n\n\tglBindBuffer(GL_TEXTURE_BUFFER, m_bufferIds.buffId);\n\n\tconst size_t size = bufferObject->sizeBytes();\n\n\tif (m_lastSize < size) {\n\t\t\/\/grow buffer and load all data\n\t\tglBufferData(GL_TEXTURE_BUFFER, size, bufferObject->getBufferPtr(), GL_DYNAMIC_DRAW);\n\t}\n\telse {\n\t\t\/\/load all data\n\t\tglBufferSubData(GL_TEXTURE_BUFFER, 0, size, bufferObject->getBufferPtr());\n\t}\n\tm_lastSize = size;\n}\n\nvoid OGLHgGPUBuffer::Bind() {\n\tglBindTexture(GL_TEXTURE_BUFFER, m_bufferIds.texId);\n\tglTexBuffer(GL_TEXTURE_BUFFER, GL_RGBA32F, m_bufferIds.buffId);\n}<commit_msg>Fix bug causing deletion of buffers<commit_after>#include <OGL\/OGLGpuBuffer.h>\n\nstd::vector<GLBufferId> OGLHgGPUBuffer::m_useableBufferIds;\n\n\nGLBufferId::~GLBufferId()\n{\n\tif (buffId > 0) {\n\t\tglDeleteBuffers(1, &buffId);\n\t\tglDeleteTextures(1, &texId);\n\t}\n\ttexId = 0;\n\tbuffId = 0;\n}\n\nvoid GLBufferId::AllocateOnGPU()\n{\n\tif (texId == 0) {\n\t\tglGenBuffers(1, &buffId);\n\t\tglGenTextures(1, &texId);\n\t}\n}\n\nGLBufferId::GLBufferId(GLBufferId&& rhs)\n{\n\t*this = std::move(rhs);\n}\n\nconst GLBufferId& GLBufferId::operator=(GLBufferId&& rhs)\n{\n\tbuffId = rhs.buffId;\n\ttexId = rhs.texId;\n\n\trhs.buffId = 0;\n\trhs.texId = 0;\n\n\treturn *this;\n}\n\n\n\nGLBufferId OGLHgGPUBuffer::getGLBufferId()\n{\n\tif (m_useableBufferIds.size() > 0)\n\t{\n\t\tauto r = std::move(m_useableBufferIds.back());\n\t\tm_useableBufferIds.pop_back();\n\t\treturn r;\n\t}\n\n\tGLBufferId ids;\n\tids.AllocateOnGPU();\n\treturn ids;\n}\n\nvoid OGLHgGPUBuffer::freeGLBufferId(GLBufferId& rhs)\n{\n\tm_useableBufferIds.emplace_back(std::move(rhs));\n}\n\n\nOGLHgGPUBuffer::~OGLHgGPUBuffer()\n{\n\tfreeGLBufferId(m_bufferIds);\n}\n\nvoid OGLHgGPUBuffer::SendToGPU(const IHgGPUBuffer* bufferObject) {\n\tm_bufferIds = getGLBufferId();\n\n\tglBindBuffer(GL_TEXTURE_BUFFER, m_bufferIds.buffId);\n\n\tconst size_t size = bufferObject->sizeBytes();\n\n\tif (m_lastSize < size) {\n\t\t\/\/grow buffer and load all data\n\t\tglBufferData(GL_TEXTURE_BUFFER, size, bufferObject->getBufferPtr(), GL_DYNAMIC_DRAW);\n\t}\n\telse {\n\t\t\/\/load all data\n\t\tglBufferSubData(GL_TEXTURE_BUFFER, 0, size, bufferObject->getBufferPtr());\n\t}\n\tm_lastSize = size;\n}\n\nvoid OGLHgGPUBuffer::Bind() {\n\tglBindTexture(GL_TEXTURE_BUFFER, m_bufferIds.texId);\n\tglTexBuffer(GL_TEXTURE_BUFFER, GL_RGBA32F, m_bufferIds.buffId);\n}<|endoftext|>"} {"text":"<commit_before>#ifndef WISSBI_SUB_ENTRY_HPP_\n#define WISSBI_SUB_ENTRY_HPP_\n\n#include \"util.hpp\"\n#include <stdlib.h>\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <algorithm>\n#include <string>\n#include <stdexcept>\n\nnamespace wissbi {\n\nclass SubEntry {\n public:\n SubEntry(const std::string& meta_dir, const std::string& queue_name, const std::string& addr_str) :\n meta_dir_(meta_dir), queue_name_(queue_name), addr_str_(addr_str)\n {\n node_name_ = meta_dir_ + \"\/sub\/\" + queue_name_ + \"\/\" + addr_str_ + \",\" +\n wissbi::util::EscapeSubFolderPath(queue_name_);\n renew_();\n }\n\n ~SubEntry() {\n system((\"rm \" + node_name_).c_str());\n }\n\n void renew() const {\n renew_();\n }\n\n private:\n void renew_() const {\n mkdir((meta_dir_ + \"\/sub\/\" + queue_name_).c_str(), S_IRWXU);\n int fd = open(node_name_.c_str(), O_CREAT, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH);\n if(fd == -1) {\n throw std::runtime_error(std::string(\"Cannot create subscriber entry at \") + node_name_);\n }\n int res = futimes(fd, NULL);\n close(fd);\n if(res == -1) {\n throw std::runtime_error(std::string(\"Cannot update subscriber entry at \") + node_name_);\n }\n }\n\n std::string meta_dir_;\n std::string queue_name_;\n std::string node_name_;\n std::string addr_str_;\n};\n\n}\n\n#endif \/\/ WISSBI_SUB_ENTRY_HPP_\n<commit_msg>use unlink to remove subscriber entry node<commit_after>#ifndef WISSBI_SUB_ENTRY_HPP_\n#define WISSBI_SUB_ENTRY_HPP_\n\n#include \"util.hpp\"\n#include <stdlib.h>\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/time.h>\n#include <algorithm>\n#include <string>\n#include <stdexcept>\n\nnamespace wissbi {\n\nclass SubEntry {\n public:\n SubEntry(const std::string& meta_dir, const std::string& queue_name, const std::string& addr_str) :\n meta_dir_(meta_dir), queue_name_(queue_name), addr_str_(addr_str)\n {\n node_name_ = meta_dir_ + \"\/sub\/\" + queue_name_ + \"\/\" + addr_str_ + \",\" +\n wissbi::util::EscapeSubFolderPath(queue_name_);\n renew_();\n }\n\n ~SubEntry() {\n unlink(node_name_.c_str());\n }\n\n void renew() const {\n renew_();\n }\n\n private:\n void renew_() const {\n mkdir((meta_dir_ + \"\/sub\/\" + queue_name_).c_str(), S_IRWXU);\n int fd = open(node_name_.c_str(), O_CREAT, S_IRUSR|S_IWUSR|S_IRGRP|S_IROTH);\n if(fd == -1) {\n throw std::runtime_error(std::string(\"Cannot create subscriber entry at \") + node_name_);\n }\n int res = futimes(fd, NULL);\n close(fd);\n if(res == -1) {\n throw std::runtime_error(std::string(\"Cannot update subscriber entry at \") + node_name_);\n }\n }\n\n std::string meta_dir_;\n std::string queue_name_;\n std::string node_name_;\n std::string addr_str_;\n};\n\n}\n\n#endif \/\/ WISSBI_SUB_ENTRY_HPP_\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cmath>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <exception>\n#include <sys\/time.h>\n#include \"modules\/htmTree.h\"\n#include \"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n \/\/\/\/ Initializations ---------------------------------------------\n srand48(1234); \/\/ Make sure we have reproducability\n check_args(argc);\n Time t, time; \/\/ t for global, time for local\n init_time(t);\n Feat F;\n MTL M;\n \n\n \/\/ Read parameters file \/\/\n F.readInputFile(argv[1]);\n printFile(argv[1]);\n \/\/ Read Secretfile\n \/\/ Secret contains the identity of each target: QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\n Gals Secret;\n init_time_at(time,\"# reading Secret file\",t);\n\n Secret=read_Secretfile(F.Secretfile,F);\n printf(\"# Read %d galaxies from %s \\n\",Secret.size(),F.Secretfile.c_str());\n print_time(time,\"# ... took :\");\n std::vector<int> count(10);\n count=count_galaxies(Secret);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){if(count[i]>0)printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/read the three input fits files\n init_time_at(time,\"# read target, SS, SF files\",t);\n MTL Targ=read_MTLfile(F.Targfile,F,0,0);\n MTL SStars=read_MTLfile(F.SStarsfile,F,1,0);\n MTL SkyF=read_MTLfile(F.SkyFfile,F,0,1);\n \n if(Targ.size() == 0) {\n std::cerr << \"ERROR: No targets found in \" << F.Targfile << std::endl;\n myexit(1);\n }\n \n print_time(time,\"# ... took :\");\n \/\/combine the three input files\n M=Targ;\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SStars.begin(),SStars.end());\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SkyF.begin(),SkyF.end());\n printf(\" M size %d \\n\",M.size());\n F.Ngal=M.size();\n F.Ntarg=Secret.size();\n \n \/\/establish priority classes\n init_time_at(time,\"# establish priority clasess\",t);\n assign_priority_class(M);\n std::vector <int> count_class(M.priority_list.size(),0);\n for(int i;i<M.size();++i){\n if(!M[i].SS&&!M[i].SF){\n count_class[M[i].priority_class]+=1;\n }\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d priority %d number %d\\n\",i,M.priority_list[i],count_class[i]);\n }\n print_time(time,\"# ... took :\");\n \n \/\/ fiber positioners\n PP pp;\n pp.read_fiber_positions(F); \n F.Nfiber = pp.fp.size()\/2; \n F.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n pp.get_neighbors(F);\n pp.compute_fibsofsp(F);\n printf(\"computed neighbors\\n\");\n std::cout.flush();\n \/\/P tiles in order specified by surveyFile\n Plates P = read_plate_centers(F);\n F.Nplate=P.size();\n printf(\"# Read %d plates from %s and %d fibers from %s\\n\",F.Nplate,F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n \/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n F.cb = create_cb(); \/\/ cb=central body\n F.fh = create_fh(); \/\/ fh=fiber holder\n\n \/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n \/\/ HTM Tree of galaxies\n const double MinTreeSize = 0.01;\n init_time_at(time,\"# Start building HTM tree\",t);\n\n htmTree<struct target> T(M,MinTreeSize);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect galaxies at \",t);\n \n \/\/ For plates\/fibers, collect available galaxies; done in parallel\n collect_galaxies_for_all(M,T,P,pp,F);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect available tile-fibers at\",t);\n \/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n collect_available_tilefibers(M,P,F);\n \n \/\/count number of galaxies in first pass and number not in first pass\n \n int inside=0;\n int outside=0;\n for(int g=0;g<F.Ntarg;++g){\n Plist v=M[g].av_tfs;\n for(int i=0;i<v.size();++i){\n if(v[i].f==0){\n ++outside;\n break;\n }\n ++inside;\n }\n }\n printf (\"inside = %d outisde = %d\\n\",inside,outside);\n \/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n \/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n Assignment A(M,F);\n \n print_time(t,\"# Start assignment at : \");\n\n \/\/ Make a plan ----------------------------------------------------\n \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n\n simple_assign(M,P,pp,F,A);\n\n \/\/check to see if there are tiles with no galaxies\n \/\/need to keep mapping of old tile list to new tile list\n \/\/and inverse map\n A.inv_order=initList(F.Nplate,-1);\n int inv_count=0;\n for (int j=0;j<F.Nplate ;++j){\n \n bool not_done=true;\n for(int k=0;k<F.Nfiber && not_done;++k){\n if(A.TF[j][k]!=-1){\/\/fiber and therefore plate is used\n A.suborder.push_back(j);\/\/suborder[jused] is jused-th used plate\n not_done=false;\n A.inv_order[j]=inv_count;\/\/inv_order[j] is -1 unless used\n \/\/and otherwise the position of plate j in list of used plates\n inv_count++;\n }\n }\n }\n F.NUsedplate=A.suborder.size();\n printf(\" Plates actually used %d \\n\",F.NUsedplate);\n\n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \n \/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n for (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A,0);\/\/ more iterations will improve performance slightly\n for (int i=0; i<1; i++) {\n improve(M,P,pp,F,A,0);\n redistribute_tf(M,P,pp,F,A,0);\n }\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n \/\/try assigning SF and SS before real time assignment\n for (int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF for each tile\n assign_unused(j,M,P,pp,F,A);\n }\n if(F.diagnose)diagnostic(M,Secret,F,A);\n init_time_at(time,\"# Begin real time assignment\",t);\n\n \/\/Execute plan, updating targets at intervals\n for(int i=0;i<F.pass_intervals.size();i++){\n printf(\" i=%d interval %d \\n\",i,F.pass_intervals[i]);\n }\n std::vector <int> update_intervals=F.pass_intervals;\n update_intervals.push_back(F.NUsedplate);\/\/to end intervals at last plate\n for(int i=0;i<update_intervals.size();++i){\n printf(\"i %d update_interval %d\\n\",i, update_intervals[i]);\n }\n for(int i=0;i<update_intervals.size()-1;++i){\/\/go plate by used plate\n int starter=update_intervals[i];\n printf(\"-- interval %d\\n\",i);\n for (int jused=starter; jused<update_intervals[i+1] && jused<A.suborder.size()-1; jused++) {\n\n if (0<=jused-F.Analysis) {\n update_plan_from_one_obs(jused,Secret,M,P,pp,F,A);\n }\n else printf(\"\\n no update\\n\");\n \/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\n }\n printf(\"-- redistribute %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- improve %d\\n\",i); \n improve(M,P,pp,F,A,starter);\n printf(\"-- improve again %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- diagnose %d\\n\",i); \n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n }\n \/\/ check on SS and SF\n\n printf(\"-- Checking SS\/SF\\n\");\n List SS_hist=initList(11,0);\n List SF_hist=initList(41,0);\n for(int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n for (int p=0;p<F.Npetal;++p){\n int count_SS=0;\n int count_SF=0;\n for (int k=0;k<F.Nfbp;++k){\n int kk=pp.fibers_of_sp[p][k];\n int g=A.TF[j][kk];\n if(g!=-1 && M[g].SS)count_SS++;\n if(g!=-1 && M[g].SF)count_SF++;\n }\n SS_hist[count_SS]++;\n SF_hist[count_SF]++;\n }\n }\n printf(\" SS distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SS_hist[i]);\n printf(\"\\n %8d \\n\",SS_hist[10]);\n \n printf(\" SF distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=10;i<20;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=20;i<30;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=30;i<40;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n %8d \\n\",SF_hist[40]);\n\n \n\n \n \/\/ Results -------------------------------------------------------\n if (F.PrintAscii){\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n write_FAtile_ascii(A.suborder[jused],F.outDir,M,P,pp,F,A);\n }\n }\n \n if (F.PrintFits) {\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n fa_write(A.suborder[jused],F.outDir,M,P,pp,F,A); \/\/ Write outpu\n }\n }\n \n\n\tdisplay_results(\"doc\/figs\/\",Secret,M,P,pp,F,A,F.Nplate,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n print_time(t,\"# Finished !... in\");\n\n return(0);\n \n}\n<commit_msg>count galaxies in first pass<commit_after>#include <cstdlib>\n#include <cmath>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <exception>\n#include <sys\/time.h>\n#include \"modules\/htmTree.h\"\n#include \"modules\/kdTree.h\"\n#include \"misc.h\"\n#include \"feat.h\"\n#include \"structs.h\"\n#include \"collision.h\"\n#include \"global.h\"\n\/\/reduce redistributes, updates 07\/02\/15 rnc\nint main(int argc, char **argv) {\n \/\/\/\/ Initializations ---------------------------------------------\n srand48(1234); \/\/ Make sure we have reproducability\n check_args(argc);\n Time t, time; \/\/ t for global, time for local\n init_time(t);\n Feat F;\n MTL M;\n \n\n \/\/ Read parameters file \/\/\n F.readInputFile(argv[1]);\n printFile(argv[1]);\n \/\/ Read Secretfile\n \/\/ Secret contains the identity of each target: QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\n Gals Secret;\n init_time_at(time,\"# reading Secret file\",t);\n\n Secret=read_Secretfile(F.Secretfile,F);\n printf(\"# Read %d galaxies from %s \\n\",Secret.size(),F.Secretfile.c_str());\n print_time(time,\"# ... took :\");\n std::vector<int> count(10);\n count=count_galaxies(Secret);\n printf(\" Number of galaxies by type, QSO-Ly-a, QSO-tracers, LRG, ELG, fake QSO, fake LRG, SS, SF\\n\");\n for(int i=0;i<8;i++){if(count[i]>0)printf (\" type %d number %d \\n\",i, count[i]);}\n \/\/read the three input fits files\n init_time_at(time,\"# read target, SS, SF files\",t);\n MTL Targ=read_MTLfile(F.Targfile,F,0,0);\n MTL SStars=read_MTLfile(F.SStarsfile,F,1,0);\n MTL SkyF=read_MTLfile(F.SkyFfile,F,0,1);\n \n if(Targ.size() == 0) {\n std::cerr << \"ERROR: No targets found in \" << F.Targfile << std::endl;\n myexit(1);\n }\n \n print_time(time,\"# ... took :\");\n \/\/combine the three input files\n M=Targ;\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SStars.begin(),SStars.end());\n printf(\" M size %d \\n\",M.size());\n M.insert(M.end(),SkyF.begin(),SkyF.end());\n printf(\" M size %d \\n\",M.size());\n F.Ngal=M.size();\n F.Ntarg=Secret.size();\n \n \/\/establish priority classes\n init_time_at(time,\"# establish priority clasess\",t);\n assign_priority_class(M);\n std::vector <int> count_class(M.priority_list.size(),0);\n for(int i;i<M.size();++i){\n if(!M[i].SS&&!M[i].SF){\n count_class[M[i].priority_class]+=1;\n }\n }\n for(int i;i<M.priority_list.size();++i){\n printf(\" class %d priority %d number %d\\n\",i,M.priority_list[i],count_class[i]);\n }\n print_time(time,\"# ... took :\");\n \n \/\/ fiber positioners\n PP pp;\n pp.read_fiber_positions(F); \n F.Nfiber = pp.fp.size()\/2; \n F.Npetal = max(pp.spectrom)+1;\n F.Nfbp = (int) (F.Nfiber\/F.Npetal);\/\/ fibers per petal = 500\n pp.get_neighbors(F);\n pp.compute_fibsofsp(F);\n printf(\"computed neighbors\\n\");\n std::cout.flush();\n \/\/P tiles in order specified by surveyFile\n Plates P = read_plate_centers(F);\n F.Nplate=P.size();\n printf(\"# Read %d plates from %s and %d fibers from %s\\n\",F.Nplate,F.tileFile.c_str(),F.Nfiber,F.fibFile.c_str());\n\n \/\/ Computes geometries of cb and fh: pieces of positioner - used to determine possible collisions\n F.cb = create_cb(); \/\/ cb=central body\n F.fh = create_fh(); \/\/ fh=fiber holder\n\n \/\/\/\/ Collect available galaxies <-> tilefibers --------------------\n \/\/ HTM Tree of galaxies\n const double MinTreeSize = 0.01;\n init_time_at(time,\"# Start building HTM tree\",t);\n\n htmTree<struct target> T(M,MinTreeSize);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect galaxies at \",t);\n \n \/\/ For plates\/fibers, collect available galaxies; done in parallel\n collect_galaxies_for_all(M,T,P,pp,F);\n print_time(time,\"# ... took :\");\/\/T.stats();\n init_time_at(time,\"# collect available tile-fibers at\",t);\n \/\/ For each galaxy, computes available tilefibers G[i].av_tfs = [(j1,k1),(j2,k2),..]\n collect_available_tilefibers(M,P,F);\n \n \/\/count number of galaxies in first pass and number not in first pass\n \n int totalg=0;\n int outside=0;\n for(int g=0;g<F.Ntarg;++g){\n Plist v=M[g].av_tfs;\n int done=0;\n for(int i=0;i<v.size()&&done==0;++i){\n if(v[i].f==0){\n ++outside;\n done=1;\n }\n }\n ++totalg;\n }\n printf (\"total = %d outisde = %d\\n\",totalg,outside);\n \/\/results_on_inputs(\"doc\/figs\/\",G,P,F,true);\n\n \/\/\/\/ Assignment |||||||||||||||||||||||||||||||||||||||||||||||||||\n printf(\" Nplate %d Ngal %d Nfiber %d \\n\", F.Nplate, F.Ngal, F.Nfiber);\n Assignment A(M,F);\n \n print_time(t,\"# Start assignment at : \");\n\n \/\/ Make a plan ----------------------------------------------------\n \/\/ Plans whole survey without sky fibers, standard stars\n \/\/ assumes maximum number of observations needed for QSOs, LRGs\n\n simple_assign(M,P,pp,F,A);\n\n \/\/check to see if there are tiles with no galaxies\n \/\/need to keep mapping of old tile list to new tile list\n \/\/and inverse map\n A.inv_order=initList(F.Nplate,-1);\n int inv_count=0;\n for (int j=0;j<F.Nplate ;++j){\n \n bool not_done=true;\n for(int k=0;k<F.Nfiber && not_done;++k){\n if(A.TF[j][k]!=-1){\/\/fiber and therefore plate is used\n A.suborder.push_back(j);\/\/suborder[jused] is jused-th used plate\n not_done=false;\n A.inv_order[j]=inv_count;\/\/inv_order[j] is -1 unless used\n \/\/and otherwise the position of plate j in list of used plates\n inv_count++;\n }\n }\n }\n F.NUsedplate=A.suborder.size();\n printf(\" Plates actually used %d \\n\",F.NUsedplate);\n\n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false); \/\/ Hist of unused fibs\n \n \/\/ Smooth out distribution of free fibers, and increase the number of assignments\n \n for (int i=0; i<1; i++) redistribute_tf(M,P,pp,F,A,0);\/\/ more iterations will improve performance slightly\n for (int i=0; i<1; i++) {\n improve(M,P,pp,F,A,0);\n redistribute_tf(M,P,pp,F,A,0);\n }\n print_hist(\"Unused fibers\",5,histogram(A.unused_fbp(pp,F),5),false);\n \/\/try assigning SF and SS before real time assignment\n for (int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n assign_sf_ss(j,M,P,pp,F,A); \/\/ Assign SS and SF for each tile\n assign_unused(j,M,P,pp,F,A);\n }\n if(F.diagnose)diagnostic(M,Secret,F,A);\n init_time_at(time,\"# Begin real time assignment\",t);\n\n \/\/Execute plan, updating targets at intervals\n for(int i=0;i<F.pass_intervals.size();i++){\n printf(\" i=%d interval %d \\n\",i,F.pass_intervals[i]);\n }\n std::vector <int> update_intervals=F.pass_intervals;\n update_intervals.push_back(F.NUsedplate);\/\/to end intervals at last plate\n for(int i=0;i<update_intervals.size();++i){\n printf(\"i %d update_interval %d\\n\",i, update_intervals[i]);\n }\n for(int i=0;i<update_intervals.size()-1;++i){\/\/go plate by used plate\n int starter=update_intervals[i];\n printf(\"-- interval %d\\n\",i);\n for (int jused=starter; jused<update_intervals[i+1] && jused<A.suborder.size()-1; jused++) {\n\n if (0<=jused-F.Analysis) {\n update_plan_from_one_obs(jused,Secret,M,P,pp,F,A);\n }\n else printf(\"\\n no update\\n\");\n \/\/ Update corrects all future occurrences of wrong QSOs etc and tries to observe something else\n\n }\n printf(\"-- redistribute %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- improve %d\\n\",i); \n improve(M,P,pp,F,A,starter);\n printf(\"-- improve again %d\\n\",i); \n redistribute_tf(M,P,pp,F,A,starter);\n printf(\"-- diagnose %d\\n\",i); \n if(F.diagnose)diagnostic(M,Secret,F,A);\n\n }\n \/\/ check on SS and SF\n\n printf(\"-- Checking SS\/SF\\n\");\n List SS_hist=initList(11,0);\n List SF_hist=initList(41,0);\n for(int jused=0;jused<F.NUsedplate;++jused){\n int j=A.suborder[jused];\n for (int p=0;p<F.Npetal;++p){\n int count_SS=0;\n int count_SF=0;\n for (int k=0;k<F.Nfbp;++k){\n int kk=pp.fibers_of_sp[p][k];\n int g=A.TF[j][kk];\n if(g!=-1 && M[g].SS)count_SS++;\n if(g!=-1 && M[g].SF)count_SF++;\n }\n SS_hist[count_SS]++;\n SF_hist[count_SF]++;\n }\n }\n printf(\" SS distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SS_hist[i]);\n printf(\"\\n %8d \\n\",SS_hist[10]);\n \n printf(\" SF distribution \\n\");\n for(int i=0;i<10;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=10;i<20;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=20;i<30;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n\");\n for(int i=30;i<40;i++)printf(\"%8d\",SF_hist[i]);\n printf(\"\\n %8d \\n\",SF_hist[40]);\n\n \n\n \n \/\/ Results -------------------------------------------------------\n if (F.PrintAscii){\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n write_FAtile_ascii(A.suborder[jused],F.outDir,M,P,pp,F,A);\n }\n }\n \n if (F.PrintFits) {\n for (int jused=0; jused<F.NUsedplate; jused++){\n int j=A.suborder[jused];\n fa_write(A.suborder[jused],F.outDir,M,P,pp,F,A); \/\/ Write outpu\n }\n }\n \n\n\tdisplay_results(\"doc\/figs\/\",Secret,M,P,pp,F,A,F.Nplate,true);\n\tif (F.Verif) A.verif(P,M,pp,F); \/\/ Verification that the assignment is sane\n\n\n print_time(t,\"# Finished !... in\");\n\n return(0);\n \n}\n<|endoftext|>"} {"text":"<commit_before>#include <X11\/Xlib.h>\n#include <include\/wrapper\/cef_helpers.h>\n#include <include\/cef_app.h>\n#include <unistd.h>\n#include <gdk\/gdkx.h>\n\n#include \"brick_app.h\"\n#include \"third-party\/json\/json.h\"\n#include \"status_icon\/status_icon.h\"\n#include \"cef_handler.h\"\n#include \"cef_app.h\"\n#include \"window_util.h\"\n#include \"helper.h\"\n\n\n#undef Status \/\/ Definition conflicts with cef_urlrequest.h\n#undef Success \/\/ Definition conflicts with cef_message_router.h\n\nnamespace {\n std::string APPICONS[] = {\"brick16.png\", \"brick32.png\", \"brick48.png\", \"brick128.png\", \"brick256.png\"};\n std::string szWorkingDir; \/\/ The current working directory\n\n bool GetWorkingDir(std::string& dir) {\n char buff[1024];\n\n \/\/ Retrieve the executable path.\n ssize_t len = readlink(\"\/proc\/self\/exe\", buff, sizeof(buff)-1);\n if (len == -1)\n return false;\n\n buff[len] = 0;\n dir = std::string(buff);\n \/\/ Remove the executable name from the path.\n dir = dir.substr(0, dir.find_last_of(\"\/\"));\n\n return true;\n }\n}\n\n\/\/ static\nconst char*\nBrickApp::GetConfigHome() {\n return g_get_user_config_dir();\n}\n\n\/\/ static\nconst char*\nBrickApp::GetCacheHome() {\n return g_get_user_cache_dir();\n}\n\nvoid\nTerminationSignalHandler(int signatl) {\n CefQuitMessageLoop();\n}\n\nint main(int argc, char* argv[]) {\n CefMainArgs main_args(argc, argv);\n CefRefPtr<ClientApp> app(new ClientApp);\n\n \/\/ Execute the secondary process, if any.\n int exit_code = CefExecuteProcess(main_args, app.get(), NULL);\n if (exit_code >= 0)\n return exit_code;\n\n GetWorkingDir(szWorkingDir);\n std::string plain_config = BrickApp::GetConfig();\n AppSettings app_settings = AppSettings::InitByJson(plain_config);\n app_settings.resource_dir = helper::BaseDir(szWorkingDir) + \"\/resources\/\";\n\n CefRefPtr<AccountManager> account_manager(new AccountManager);\n \/\/ ToDo: Fix this bullshit!\n account_manager->Init(\n std::string(BrickApp::GetConfigHome()) + \"\/\" + APP_COMMON_NAME + \"\/accounts.json\"\n );\n\n \/\/ Initialize CEF.\n CefInitialize(main_args, BrickApp::GetCefSettings(szWorkingDir, app_settings), app.get(), NULL);\n\n \/\/ Create the handler.\n CefRefPtr<ClientHandler> client_handler(new ClientHandler);\n\n \/\/ Set default windows icon. Important to do this before any GTK window created!\n GList *list = NULL;\n std::string icon_path = app_settings.resource_dir + \"\/app_icons\/\";\n int icons_count = sizeof(APPICONS) \/ sizeof(APPICONS[0]);\n for (int i = 0; i < icons_count; ++i) {\n GdkPixbuf *icon = gdk_pixbuf_new_from_file((icon_path + APPICONS[i]).c_str(), NULL);\n if (!icon)\n continue;\n list = g_list_append(list, icon);\n }\n gtk_window_set_default_icon_list(list);\n g_list_foreach(list, (GFunc) g_object_unref, NULL);\n g_list_free(list);\n\n \/\/ Initialize main window\n CefRefPtr<MainWindow> main_window(new MainWindow);\n main_window->Init();\n main_window->SetTitle(APP_NAME);\n main_window->Show();\n client_handler->SetAppSettings(app_settings);\n client_handler->SetMainWindowHandle(main_window);\n client_handler->SetAccountManager(account_manager);\n\n \/\/ Initialize status icon\n CefRefPtr<StatusIcon> status_icon(new StatusIcon(app_settings.resource_dir + \"\/indicators\/\"));\n client_handler->SetStatusIconHandle(status_icon);\n\n CefWindowInfo window_info;\n \/\/ The GTK window must be visible before we can retrieve the XID.\n ::Window xwindow = GDK_WINDOW_XID(gtk_widget_get_window(main_window->GetHandler()));\n window_info.SetAsChild(xwindow, CefRect(0, 0, 0, 0));\n window_util::SetLeaderWindow(xwindow);\n window_util::InitWindow(xwindow);\n window_util::InitHooks();\n\n std::string startup_url = account_manager->GetCurrentAccount()->GetBaseUrl();\n if (account_manager->GetCurrentAccount()->IsExisted()) {\n \/\/ Login to our account\n startup_url += \"internals\/pages\/portal-loader#login=yes\";\n } else {\n \/\/ Otherwise let's show error page\n startup_url += \"internals\/pages\/home\";\n }\n\n \/\/ Create browser\n CefBrowserHost::CreateBrowserSync(\n window_info, client_handler.get(),\n startup_url, BrickApp::GetBrowserSettings(szWorkingDir, app_settings), NULL);\n\n \/\/ Install a signal handler so we clean up after ourselves.\n signal(SIGINT, TerminationSignalHandler);\n signal(SIGTERM, TerminationSignalHandler);\n\n CefRunMessageLoop();\n\n CefShutdown();\n\n return 0;\n}\n<commit_msg>В простеньком виде реализовал \"Another instance is already running\" :-)<commit_after>#include <X11\/Xlib.h>\n#include <include\/wrapper\/cef_helpers.h>\n#include <include\/cef_app.h>\n#include <unistd.h>\n#include <gdk\/gdkx.h>\n#include <sys\/file.h>\n\n#include \"brick_app.h\"\n#include \"third-party\/json\/json.h\"\n#include \"status_icon\/status_icon.h\"\n#include \"cef_handler.h\"\n#include \"cef_app.h\"\n#include \"window_util.h\"\n#include \"helper.h\"\n\n\n#undef Status \/\/ Definition conflicts with cef_urlrequest.h\n#undef Success \/\/ Definition conflicts with cef_message_router.h\n\nnamespace {\n std::string APPICONS[] = {\"brick16.png\", \"brick32.png\", \"brick48.png\", \"brick128.png\", \"brick256.png\"};\n std::string szWorkingDir; \/\/ The current working directory\n\n bool GetWorkingDir(std::string& dir) {\n char buff[1024];\n\n \/\/ Retrieve the executable path.\n ssize_t len = readlink(\"\/proc\/self\/exe\", buff, sizeof(buff)-1);\n if (len == -1)\n return false;\n\n buff[len] = 0;\n dir = std::string(buff);\n \/\/ Remove the executable name from the path.\n dir = dir.substr(0, dir.find_last_of(\"\/\"));\n\n return true;\n }\n\n bool EnsureSingleInstance() {\n \/\/ ToDo: Replaced by IPC request, when IPC will be implemented\n std::string lock_file = std::string(BrickApp::GetCacheHome()) + \"\/\" + APP_COMMON_NAME + \"\/run.lock\";\n int fd = open(lock_file.c_str(), O_CREAT, 0600);\n if (fd == -1)\n return true;\n\n return flock(fd, LOCK_EX|LOCK_NB) == 0;\n }\n}\n\n\/\/ static\nconst char*\nBrickApp::GetConfigHome() {\n return g_get_user_config_dir();\n}\n\n\/\/ static\nconst char*\nBrickApp::GetCacheHome() {\n return g_get_user_cache_dir();\n}\n\nvoid\nTerminationSignalHandler(int signatl) {\n CefQuitMessageLoop();\n}\n\nint main(int argc, char* argv[]) {\n CefMainArgs main_args(argc, argv);\n CefRefPtr<ClientApp> app(new ClientApp);\n\n \/\/ Execute the secondary process, if any.\n int exit_code = CefExecuteProcess(main_args, app.get(), NULL);\n if (exit_code >= 0)\n return exit_code;\n\n if (!EnsureSingleInstance()) {\n \/\/ ToDo: change main window stack order, when IPC will be implemented\n printf(\"Another instance is already running.\\nExiting.\");\n return 0;\n }\n\n GetWorkingDir(szWorkingDir);\n std::string plain_config = BrickApp::GetConfig();\n AppSettings app_settings = AppSettings::InitByJson(plain_config);\n app_settings.resource_dir = helper::BaseDir(szWorkingDir) + \"\/resources\/\";\n\n CefRefPtr<AccountManager> account_manager(new AccountManager);\n \/\/ ToDo: Fix this bullshit!\n account_manager->Init(\n std::string(BrickApp::GetConfigHome()) + \"\/\" + APP_COMMON_NAME + \"\/accounts.json\"\n );\n\n \/\/ Initialize CEF.\n CefInitialize(main_args, BrickApp::GetCefSettings(szWorkingDir, app_settings), app.get(), NULL);\n\n \/\/ Create the handler.\n CefRefPtr<ClientHandler> client_handler(new ClientHandler);\n\n \/\/ Set default windows icon. Important to do this before any GTK window created!\n GList *list = NULL;\n std::string icon_path = app_settings.resource_dir + \"\/app_icons\/\";\n int icons_count = sizeof(APPICONS) \/ sizeof(APPICONS[0]);\n for (int i = 0; i < icons_count; ++i) {\n GdkPixbuf *icon = gdk_pixbuf_new_from_file((icon_path + APPICONS[i]).c_str(), NULL);\n if (!icon)\n continue;\n list = g_list_append(list, icon);\n }\n gtk_window_set_default_icon_list(list);\n g_list_foreach(list, (GFunc) g_object_unref, NULL);\n g_list_free(list);\n\n \/\/ Initialize main window\n CefRefPtr<MainWindow> main_window(new MainWindow);\n main_window->Init();\n main_window->SetTitle(APP_NAME);\n main_window->Show();\n client_handler->SetAppSettings(app_settings);\n client_handler->SetMainWindowHandle(main_window);\n client_handler->SetAccountManager(account_manager);\n\n \/\/ Initialize status icon\n CefRefPtr<StatusIcon> status_icon(new StatusIcon(app_settings.resource_dir + \"\/indicators\/\"));\n client_handler->SetStatusIconHandle(status_icon);\n\n CefWindowInfo window_info;\n \/\/ The GTK window must be visible before we can retrieve the XID.\n ::Window xwindow = GDK_WINDOW_XID(gtk_widget_get_window(main_window->GetHandler()));\n window_info.SetAsChild(xwindow, CefRect(0, 0, 0, 0));\n window_util::SetLeaderWindow(xwindow);\n window_util::InitWindow(xwindow);\n window_util::InitHooks();\n\n std::string startup_url = account_manager->GetCurrentAccount()->GetBaseUrl();\n if (account_manager->GetCurrentAccount()->IsExisted()) {\n \/\/ Login to our account\n startup_url += \"internals\/pages\/portal-loader#login=yes\";\n } else {\n \/\/ Otherwise let's show error page\n startup_url += \"internals\/pages\/home\";\n }\n\n \/\/ Create browser\n CefBrowserHost::CreateBrowserSync(\n window_info, client_handler.get(),\n startup_url, BrickApp::GetBrowserSettings(szWorkingDir, app_settings), NULL);\n\n \/\/ Install a signal handler so we clean up after ourselves.\n signal(SIGINT, TerminationSignalHandler);\n signal(SIGTERM, TerminationSignalHandler);\n\n CefRunMessageLoop();\n\n CefShutdown();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This include needs to be the very first to prevent problems with warnings \n\/\/ regarding redefinition of _POSIX_C_SOURCE\n#include \"boost\/python.hpp\"\n\n#include \"OpenEXR\/ImathRandom.h\"\n#include \"OpenEXR\/ImathVec.h\"\n\n#include \"IECore\/bindings\/ImathRandomBinding.h\"\n\nusing namespace boost::python;\nusing namespace Imath;\n\nnamespace IECore \n{\n\ntemplate<typename T, typename F>\nvoid bindRand( const char *className )\n{\t\n\n\tclass_<T>( className )\n\t\t.def( init<unsigned long int>() )\n\t\t.def( \"init\", &T::init )\n\t\t.def( \"nextb\", &T::nextb )\n\t\t.def( \"nexti\", &T::nexti )\n\t\t.def( \"nextf\", (F (T::*)())&T::nextf )\n\t\t.def( \"nextf\", (F (T::*)( F, F ))&T::nextf )\n\t\t.def( \"gauss\", &gaussRand<T> )\n\t\t.def( \"solidCirclef\", &solidSphereRand<V2f,T> )\n\t\t.def( \"solidCircled\", &solidSphereRand<V2d,T> )\n\t\t.def( \"solidSpheref\", &solidSphereRand<V3f,T> )\n\t\t.def( \"solidSphered\", &solidSphereRand<V3d,T> )\n\t\t.def( \"hollowCirclef\", &hollowSphereRand<V2f,T> )\n\t\t.def( \"hollowCircled\", &hollowSphereRand<V2d,T> )\n\t\t.def( \"hollowSpheref\", &hollowSphereRand<V3f,T> )\n\t\t.def( \"hollowSphered\", &hollowSphereRand<V3d,T> )\n\t\t.def( \"gaussCirclef\", &gaussSphereRand<V2f,T> )\n\t\t.def( \"gaussCircled\", &gaussSphereRand<V2d,T> )\n\t\t.def( \"gaussSpheref\", &gaussSphereRand<V3f,T> )\n\t\t.def( \"gaussSphered\", &gaussSphereRand<V3d,T> )\n\t;\n\t\n}\n\nvoid bindImathRandom()\n{\n\tbindRand<Rand32, float>( \"Rand32\" );\n\tbindRand<Rand48, double>( \"Rand48\" );\n\n}\n\n} \/\/ namespace IECore\n<commit_msg>Added versions of random functions for returning many results at once, for when looping in python is just too slow.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This include needs to be the very first to prevent problems with warnings \n\/\/ regarding redefinition of _POSIX_C_SOURCE\n#include \"boost\/python.hpp\"\n\n#include \"IECore\/bindings\/ImathRandomBinding.h\"\n#include \"IECore\/VectorTypedData.h\"\n\n#include \"OpenEXR\/ImathRandom.h\"\n#include \"OpenEXR\/ImathVec.h\"\n#include \"OpenEXR\/ImathColor.h\"\n\n#include \"boost\/type_traits.hpp\"\n\nusing namespace boost::python;\nusing namespace boost;\nusing namespace Imath;\n\nnamespace IECore \n{\n\ntemplate<typename R>\nfloat nextFloat( R &r )\n{\n\treturn r.nextf();\n}\n\ntemplate<typename T, typename R>\nT nextVec( R &r )\n{\n\tT result;\n\tfor( unsigned int i=0; i<T::dimensions(); i++ )\n\t{\n\t\tresult[i] = r.nextf();\n\t}\n\treturn result;\n}\n\ntemplate<typename R, typename T, T (*F)( R & )>\nstruct Vectoriser\n{\n\ttypedef TypedData<std::vector<T> > ResultType;\n\ttypedef typename ResultType::Ptr ResultTypePtr;\n\ttypedef typename ResultType::ValueType ValueType;\n\ttypedef typename ValueType::iterator Iterator;\n\t\n\tstatic ResultTypePtr vectorise( R &r, size_t size )\n\t{\n\t\tResultTypePtr result = new ResultType;\n\t\tValueType &v = result->writable();\n\t\tv.resize( size );\n\t\tfor( Iterator it=v.begin(); it!=v.end(); it++ )\n\t\t{\n\t\t\t*it = F( r );\n\t\t}\n\t\treturn result;\n\t};\n\t\n\ttemplate<typename S>\n\tstatic ResultTypePtr vectoriseSeededT( R &r, typename S::ConstPtr seeds )\n\t{\n\t\tconst typename S::ValueType &seedsV = seeds->readable();\n\t\tResultTypePtr result = new ResultType;\n\t\tValueType &v = result->writable();\n\t\tv.resize( seedsV.size() );\n\t\ttypename S::ValueType::const_iterator sIt = seedsV.begin();\n\t\tfor( Iterator it=v.begin(); it!=v.end(); it++ )\n\t\t{\n\t\t\tr.init( (long unsigned int)(*sIt++) );\n\t\t\t*it = F( r );\n\t\t}\n\t\treturn result;\n\t}\n\t\n\tstatic ResultTypePtr vectoriseSeeded( R &r, ConstDataPtr seeds )\n\t{\n\t\tswitch( seeds->typeId() )\n\t\t{\n\t\t\tcase FloatVectorDataTypeId :\n\t\t\t\treturn vectoriseSeededT<FloatVectorData>( r, static_pointer_cast<const FloatVectorData>( seeds ) );\n\t\t\tcase DoubleVectorDataTypeId :\n\t\t\t\treturn vectoriseSeededT<DoubleVectorData>( r, static_pointer_cast<const DoubleVectorData>( seeds ) );\n\t\t\tcase IntVectorDataTypeId :\n\t\t\t\treturn vectoriseSeededT<IntVectorData>( r, static_pointer_cast<const IntVectorData>( seeds ) );\n\t\t\tcase UIntVectorDataTypeId :\n\t\t\t\treturn vectoriseSeededT<UIntVectorData>( r, static_pointer_cast<const UIntVectorData>( seeds ) );\t\t\n\t\t\tdefault :\n\t\t\t\tthrow Exception( \"Unsupported type for seeds parameter.\" );\n\t\t}\n\t\treturn 0;\n\t}\n\n};\n\ntemplate<typename T, typename F>\nvoid bindRand( const char *className )\n{\t\n\n\tclass_<T>( className )\n\t\t.def( init<unsigned long int>() )\n\t\t.def( \"init\", &T::init )\n\t\t.def( \"nextb\", &T::nextb )\n\t\t.def( \"nexti\", &T::nexti )\n\t\t.def( \"nextf\", (F (T::*)())&T::nextf )\n\t\t.def( \"nextf\", (F (T::*)( F, F ))&T::nextf )\n\t\t.def( \"fVector\", &Vectoriser<T, float, &nextFloat<T> >::vectorise )\n\t\t.def( \"fVector\", &Vectoriser<T, float, &nextFloat<T> >::vectoriseSeeded )\n\t\t.def( \"nextV2f\", &nextVec<V2f, T> )\n\t\t.def( \"nextV3f\", &nextVec<V3f, T> )\n\t\t.def( \"nextV2d\", &nextVec<V2d, T> )\n\t\t.def( \"nextV3d\", &nextVec<V3d, T> )\n\t\t.def( \"v2fVector\", &Vectoriser<T, V2f, &nextVec<V2f, T> >::vectorise )\n\t\t.def( \"v2fVector\", &Vectoriser<T, V2f, &nextVec<V2f, T> >::vectoriseSeeded )\n\t\t.def( \"v2dVector\", &Vectoriser<T, V2d, &nextVec<V2d, T> >::vectorise )\n\t\t.def( \"v2dVector\", &Vectoriser<T, V2d, &nextVec<V2d, T> >::vectoriseSeeded )\n\t\t.def( \"v3fVector\", &Vectoriser<T, V3f, &nextVec<V3f, T> >::vectorise )\n\t\t.def( \"v3fVector\", &Vectoriser<T, V3f, &nextVec<V3f, T> >::vectoriseSeeded )\n\t\t.def( \"v3dVector\", &Vectoriser<T, V3d, &nextVec<V3d, T> >::vectorise )\n\t\t.def( \"v3dVector\", &Vectoriser<T, V3d, &nextVec<V3d, T> >::vectoriseSeeded )\n\t\t.def( \"nextColor3f\", &nextVec<Color3f, T> )\n\t\t.def( \"gauss\", &gaussRand<T> )\n\t\t.def( \"solidCirclef\", &solidSphereRand<V2f,T> )\n\t\t.def( \"solidCircled\", &solidSphereRand<V2d,T> )\n\t\t.def( \"solidCirclefVector\", &Vectoriser<T, V2f, &solidSphereRand<V2f, T> >::vectorise )\n\t\t.def( \"solidCirclefVector\", &Vectoriser<T, V2f, &solidSphereRand<V2f, T> >::vectoriseSeeded )\n\t\t.def( \"solidCircledVector\", &Vectoriser<T, V2d, &solidSphereRand<V2d, T> >::vectorise )\n\t\t.def( \"solidCircledVector\", &Vectoriser<T, V2d, &solidSphereRand<V2d, T> >::vectoriseSeeded )\n\t\t.def( \"solidSpheref\", &solidSphereRand<V3f,T> )\n\t\t.def( \"solidSphered\", &solidSphereRand<V3d,T> )\n\t\t.def( \"solidSpherefVector\", &Vectoriser<T, V3f, &solidSphereRand<V3f, T> >::vectorise )\n\t\t.def( \"solidSpherefVector\", &Vectoriser<T, V3f, &solidSphereRand<V3f, T> >::vectoriseSeeded )\n\t\t.def( \"solidSpheredVector\", &Vectoriser<T, V3d, &solidSphereRand<V3d, T> >::vectorise )\n\t\t.def( \"solidSpheredVector\", &Vectoriser<T, V3d, &solidSphereRand<V3d, T> >::vectoriseSeeded )\n\t\t.def( \"hollowCirclef\", &hollowSphereRand<V2f,T> )\n\t\t.def( \"hollowCircled\", &hollowSphereRand<V2d,T> )\n\t\t.def( \"hollowCirclefVector\", &Vectoriser<T, V2f, &hollowSphereRand<V2f, T> >::vectorise )\n\t\t.def( \"hollowCirclefVector\", &Vectoriser<T, V2f, &hollowSphereRand<V2f, T> >::vectoriseSeeded )\n\t\t.def( \"hollowCircledVector\", &Vectoriser<T, V2d, &hollowSphereRand<V2d, T> >::vectorise )\n\t\t.def( \"hollowCircledVector\", &Vectoriser<T, V2d, &hollowSphereRand<V2d, T> >::vectoriseSeeded )\n\t\t.def( \"hollowSpheref\", &hollowSphereRand<V3f,T> )\n\t\t.def( \"hollowSphered\", &hollowSphereRand<V3d,T> )\n\t\t.def( \"hollowSpherefVector\", &Vectoriser<T, V3f, &hollowSphereRand<V3f, T> >::vectorise )\n\t\t.def( \"hollowSpherefVector\", &Vectoriser<T, V3f, &hollowSphereRand<V3f, T> >::vectoriseSeeded )\n\t\t.def( \"hollowSpheredVector\", &Vectoriser<T, V3d, &hollowSphereRand<V3d, T> >::vectorise )\n\t\t.def( \"hollowSpheredVector\", &Vectoriser<T, V3d, &hollowSphereRand<V3d, T> >::vectoriseSeeded )\n\t\t.def( \"gaussCirclef\", &gaussSphereRand<V2f,T> )\n\t\t.def( \"gaussCircled\", &gaussSphereRand<V2d,T> )\n\t\t.def( \"gaussCirclefVector\", &Vectoriser<T, V2f, &gaussSphereRand<V2f, T> >::vectorise )\n\t\t.def( \"gaussCirclefVector\", &Vectoriser<T, V2f, &gaussSphereRand<V2f, T> >::vectoriseSeeded )\n\t\t.def( \"gaussCircledVector\", &Vectoriser<T, V2d, &gaussSphereRand<V2d, T> >::vectorise )\n\t\t.def( \"gaussCircledVector\", &Vectoriser<T, V2d, &gaussSphereRand<V2d, T> >::vectoriseSeeded )\n\t\t.def( \"gaussSpheref\", &gaussSphereRand<V3f,T> )\n\t\t.def( \"gaussSphered\", &gaussSphereRand<V3d,T> )\n\t\t.def( \"gaussSpherefVector\", &Vectoriser<T, V2f, &gaussSphereRand<V2f, T> >::vectorise )\n\t\t.def( \"gaussSpherefVector\", &Vectoriser<T, V2f, &gaussSphereRand<V2f, T> >::vectoriseSeeded )\n\t\t.def( \"gaussSpheredVector\", &Vectoriser<T, V2d, &gaussSphereRand<V2d, T> >::vectorise )\n\t\t.def( \"gaussSpheredVector\", &Vectoriser<T, V2d, &gaussSphereRand<V2d, T> >::vectoriseSeeded )\n\t;\n\t\n}\n\nvoid bindImathRandom()\n{\n\tbindRand<Rand32, float>( \"Rand32\" );\n\tbindRand<Rand48, double>( \"Rand48\" );\n}\n\n} \/\/ namespace IECore\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2012 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include \"wx\/bitmap.h\"\n#include \"wx\/defs.h\"\n#include \"wx\/event.h\"\n#include \"wx\/clipbrd.h\"\n#ifdef __WXMSW__\n#include \"wx\/dcmemory.h\"\n#endif\n#include \"wx\/filename.h\"\n#include \"wx\/rawbmp.h\"\n#include \"wx\/tokenzr.h\"\n#include \"bitmap\/bitmap.hh\"\n#include \"bitmap\/color.hh\"\n#include \"geo\/int-point.hh\"\n#include \"geo\/int-rect.hh\"\n#include \"gui\/art.hh\"\n#include \"text\/utf8-string.hh\"\n#include \"util-wx\/file-path.hh\"\n#include \"util\/pos-info.hh\"\n\nnamespace faint{\n\nwxFileName absoluted(const wxFileName& filename){\n wxFileName other(filename);\n other.MakeAbsolute();\n return other;\n}\n\nwxColour to_wx(const ColRGB& c){\n return wxColour(c.r, c.g, c.b);\n}\n\nwxColour to_wx(const Color& c){\n return wxColour(c.r, c.g, c.b, c.a);\n}\n\nwxRect to_wx(const IntRect& r){\n return wxRect(r.x, r.y, r.w, r.h);\n}\n\nwxPoint to_wx(const IntPoint& p){\n return wxPoint(p.x, p.y);\n}\n\nwxSize to_wx(const IntSize& sz){\n return wxSize(sz.w, sz.h);\n}\n\nIntPoint to_faint(const wxPoint& p){\n return IntPoint(p.x, p.y);\n}\n\nColor to_faint(const wxColour& c){\n return Color(c.Red(), c.Green(), c.Blue(), c.Alpha());\n}\n\nIntRect to_faint(const wxRect& r){\n return IntRect(IntPoint(r.x, r.y), IntSize(r.width, r.height));\n}\n\nIntSize to_faint(const wxSize& sz){\n return IntSize(sz.GetWidth(), sz.GetHeight());\n}\n\nstatic ToolModifiers get_key_tool_modifiers(){\n ToolModifiers modifiers;\n if (wxGetKeyState(WXK_CONTROL)){\n modifiers.SetPrimary();\n }\n if (wxGetKeyState(WXK_SHIFT)){\n modifiers.SetSecondary();\n }\n return modifiers;\n}\n\nToolModifiers get_tool_modifiers(){\n ToolModifiers modifiers = get_key_tool_modifiers();\n wxMouseState mouseState = wxGetMouseState();\n if (mouseState.LeftIsDown()){\n modifiers.SetLeftMouse();\n }\n else if (mouseState.RightIsDown()){\n modifiers.SetRightMouse();\n }\n return modifiers;\n}\n\nToolModifiers mouse_modifiers(const wxMouseEvent& event){\n ToolModifiers modifiers = get_key_tool_modifiers();\n if (event.LeftUp() || event.LeftDown() || event.LeftDClick()){\n modifiers.SetLeftMouse();\n }\n else if (event.RightUp() || event.RightDown()){\n modifiers.SetRightMouse();\n }\n return modifiers;\n}\n\nMod key_modifiers(const wxKeyEvent& event){\n return Ctrl.If(event.ControlDown()) +\n Shift.If(event.ShiftDown()) +\n Alt.If(event.AltDown());\n}\n\nwxImage to_wx_image(const Bitmap& bmp){\n const int stride = bmp.m_row_stride;\n const uchar* bgraData = bmp.m_data;\n\n \/\/ Using malloc to match wxWidgets free\n uchar* rgbData = (uchar*)malloc(to_size_t(bmp.m_w * bmp.m_h * 3));\n uchar* aData = (uchar*)malloc(to_size_t(bmp.m_w * bmp.m_h));\n\n for (int y = 0; y != bmp.m_h; y++){\n for (int x = 0; x != bmp.m_w; x++){\n size_t srcPos = to_size_t(y * stride + x * ByPP);\n size_t dstPos_rgb = to_size_t(y * bmp.m_w * 3 + x * 3);\n size_t dstPos_alpha = to_size_t(y * bmp.m_w + x);\n rgbData[dstPos_rgb] = bgraData[srcPos + iR];\n rgbData[dstPos_rgb + 1] = bgraData[srcPos + iG];\n rgbData[dstPos_rgb + 2] = bgraData[srcPos + iB];\n aData[dstPos_alpha] = bgraData[srcPos + iA];\n }\n }\n\n \/\/ wxWidgets takes ownership of rgbData and aData, and uses free()\n \/\/ to release the memory.\n wxImage result(bmp.m_w, bmp.m_h, rgbData, aData);\n return result;\n}\n\nusing AlphaPixelData = wxPixelData<wxBitmap, wxAlphaPixelFormat>;\nusing PixelData = AlphaPixelData;\nwxBitmap to_wx_bmp(const Bitmap& bmp){\n wxBitmap wxBmp(bmp.m_w, bmp.m_h, 32);\n PixelData pData(wxBmp);\n assert(pData);\n PixelData::Iterator p = pData;\n\n uchar* data = bmp.m_data;\n const int stride = bmp.m_row_stride;\n\n for (int y = 0; y != bmp.m_h; y++){\n PixelData::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n int pos = y * stride + x * ByPP;\n #ifdef __WXMSW__\n const uchar alpha = *(data + pos + iA);\n p.Alpha() = alpha;\n \/\/ Todo: What. Simplify.\n p.Red() = (*(data + pos + iR) * alpha) \/ 255;\n p.Green() = (*(data + pos + iG) * alpha) \/ 255;\n p.Blue() = (*(data + pos + iB) * alpha) \/ 255;\n #else\n p.Alpha() = *(data + pos + iA);\n p.Red() = *(data + pos + iR);\n p.Green() = *(data + pos + iG);\n p.Blue() = *(data + pos + iB);\n #endif\n ++p;\n }\n p = rowStart;\n p.OffsetY(pData, 1);\n }\n return wxBmp;\n}\n\nBitmap to_faint(wxBitmap wxBmp){\n Bitmap bmp(to_faint(wxBmp.GetSize()));\n if (wxBmp.GetDepth() == 24){\n wxNativePixelData pixelData(wxBmp);\n if (!pixelData){\n goto alpha_label;\n }\n wxNativePixelData::Iterator p = pixelData;\n const int stride = bmp.m_row_stride;\n uchar* data = bmp.GetRaw();\n for (int y = 0; y != bmp.m_h; y++){\n wxPixelData<wxBitmap, wxNativePixelFormat>::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n size_t pos = to_size_t(y * stride + x * ByPP);\n data[pos + iA] = 255;\n data[pos + iR] = p.Red();\n data[pos + iG] = p.Green();\n data[pos + iB] = p.Blue();\n ++p;\n }\n p = rowStart;\n p.OffsetY(pixelData, 1);\n }\n }\n else {\n alpha_label:\n AlphaPixelData pixelData(wxBmp);\n assert(pixelData);\n AlphaPixelData::Iterator p = pixelData;\n const int stride = bmp.m_row_stride;\n uchar* data = bmp.GetRaw();\n for (int y = 0; y != bmp.m_h; y++){\n AlphaPixelData::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n size_t pos = to_size_t(y * stride + x * ByPP);\n #ifdef __WXMSW__\n \/\/ Convert back from premultiplied alpha\n data[pos + iA] = p.Alpha();\n if (p.Alpha() != 0){\n data[pos + iR] = (p.Red() * 255) \/ (255 - (255 - p.Alpha()));\n data[pos + iG] = (p.Green() * 255) \/ (255 - (255 - p.Alpha()));\n data[pos + iB] = (p.Blue() * 255) \/ (255 - (255 - p.Alpha()));\n }\n #else\n data[pos + iA] = p.Alpha();\n data[pos + iR] = p.Red();\n data[pos + iG] = p.Green();\n data[pos + iB] = p.Blue();\n #endif\n ++p;\n }\n p = rowStart;\n p.OffsetY(pixelData, 1);\n }\n }\n return bmp;\n}\n\n#ifdef __WXMSW__\n\/\/ Without this, pasting from clipboard in MSW causes this error:\n\/\/ msw\\bitmap.cpp(1287): assert \"Assert failure\" failed in\n\/\/ wxBitmap::GetRawData(): failed to get DIBSECTION from a DIB?\n\/\/\n\/\/ Probably this bug: http:\/\/trac.wxwidgets.org\/ticket\/11640\nwxBitmap clean_bitmap(const wxBitmap& dirtyBmp){\n \/\/ Note: This uses 24-bits-per-pixel, thereby losing alpha\n \/\/ information, as wxMemoryDC does not support alpha.\n \/\/\n \/\/ Using 32-bits-per-pixel here (or retrieving the necessary value\n \/\/ from the wxBitmap) works for pastes between applications and\n \/\/ within Faint, but fails for pastes from print screen (gives very\n \/\/ weird effects, probably random alpha values).\n \/\/\n \/\/ ... I've also tried GCDC Blit and DrawBitmap, neither retained\n \/\/ alpha.\n wxBitmap cleanBmp(dirtyBmp.GetWidth(), dirtyBmp.GetHeight(), 24);\n wxMemoryDC cleanDC(cleanBmp);\n cleanDC.DrawBitmap(dirtyBmp, 0, 0);\n cleanDC.SelectObject(wxNullBitmap);\n return cleanBmp;\n}\n#endif\n\n#ifndef __WXMSW__\n\nwxBitmap clean_bitmap(const wxBitmap& dirtyBmp){\n return dirtyBmp;\n}\n\n#endif\n\nutf8_char to_faint(const wxChar& ch){\n wxString s;\n s += ch;\n wxCharBuffer buf = s.utf8_str();\n return utf8_char(std::string(buf, buf.length()));\n}\n\nutf8_string to_faint(const wxString& str){\n wxCharBuffer buf(str.utf8_str());\n return utf8_string(std::string(buf, buf.length()));\n}\n\nwxString to_wx(const utf8_string& faintStr){\n return wxString::FromUTF8(faintStr.c_str());\n}\n\nFileList to_FileList(const wxArrayString& strings){\n FileList files;\n for (const wxString& str : strings){\n files.push_back(FilePath::FromAbsoluteWx(str));\n }\n return files;\n}\n\nwxString get_clipboard_text(){\n wxTextDataObject textObject;\n if (!wxTheClipboard->GetData(textObject)){\n return \"\";\n }\n return textObject.GetText();\n}\n\nstd::vector<wxString> wx_split_lines(const wxString& text){\n wxStringTokenizer tokenizer(text, \"\\r\\n\");\n std::vector<wxString> v;\n while (tokenizer.HasMoreTokens()){\n v.push_back(tokenizer.GetNextToken());\n }\n return v;\n}\n\n\n#ifdef FAINT_MSW\nstd::wstring iostream_friendly(const wxString& path){\n \/\/ As best I can tell this wxWidgets method will provide an\n \/\/ UTF16-encoded std::wstring, which the Visual C++-implementation\n \/\/ of iostream accepts.\n return path.ToStdWstring();\n}\n#else\nstd::string iostream_friendly(const wxString& path){\n return to_faint(path).str();\n}\n#endif\n\n} \/\/ namespace\n<commit_msg>Removed unnecessary include.<commit_after>\/\/ -*- coding: us-ascii-unix -*-\n\/\/ Copyright 2012 Lukas Kemmer\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\"); you\n\/\/ may not use this file except in compliance with the License. You\n\/\/ may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n\/\/ implied. See the License for the specific language governing\n\/\/ permissions and limitations under the License.\n\n#include \"wx\/bitmap.h\"\n#include \"wx\/defs.h\"\n#include \"wx\/event.h\"\n#include \"wx\/clipbrd.h\"\n#ifdef __WXMSW__\n#include \"wx\/dcmemory.h\"\n#endif\n#include \"wx\/filename.h\"\n#include \"wx\/rawbmp.h\"\n#include \"wx\/tokenzr.h\"\n#include \"bitmap\/bitmap.hh\"\n#include \"bitmap\/color.hh\"\n#include \"geo\/int-point.hh\"\n#include \"geo\/int-rect.hh\"\n#include \"text\/utf8-string.hh\"\n#include \"util-wx\/file-path.hh\"\n#include \"util\/pos-info.hh\"\n\nnamespace faint{\n\nwxFileName absoluted(const wxFileName& filename){\n wxFileName other(filename);\n other.MakeAbsolute();\n return other;\n}\n\nwxColour to_wx(const ColRGB& c){\n return wxColour(c.r, c.g, c.b);\n}\n\nwxColour to_wx(const Color& c){\n return wxColour(c.r, c.g, c.b, c.a);\n}\n\nwxRect to_wx(const IntRect& r){\n return wxRect(r.x, r.y, r.w, r.h);\n}\n\nwxPoint to_wx(const IntPoint& p){\n return wxPoint(p.x, p.y);\n}\n\nwxSize to_wx(const IntSize& sz){\n return wxSize(sz.w, sz.h);\n}\n\nIntPoint to_faint(const wxPoint& p){\n return IntPoint(p.x, p.y);\n}\n\nColor to_faint(const wxColour& c){\n return Color(c.Red(), c.Green(), c.Blue(), c.Alpha());\n}\n\nIntRect to_faint(const wxRect& r){\n return IntRect(IntPoint(r.x, r.y), IntSize(r.width, r.height));\n}\n\nIntSize to_faint(const wxSize& sz){\n return IntSize(sz.GetWidth(), sz.GetHeight());\n}\n\nstatic ToolModifiers get_key_tool_modifiers(){\n ToolModifiers modifiers;\n if (wxGetKeyState(WXK_CONTROL)){\n modifiers.SetPrimary();\n }\n if (wxGetKeyState(WXK_SHIFT)){\n modifiers.SetSecondary();\n }\n return modifiers;\n}\n\nToolModifiers get_tool_modifiers(){\n ToolModifiers modifiers = get_key_tool_modifiers();\n wxMouseState mouseState = wxGetMouseState();\n if (mouseState.LeftIsDown()){\n modifiers.SetLeftMouse();\n }\n else if (mouseState.RightIsDown()){\n modifiers.SetRightMouse();\n }\n return modifiers;\n}\n\nToolModifiers mouse_modifiers(const wxMouseEvent& event){\n ToolModifiers modifiers = get_key_tool_modifiers();\n if (event.LeftUp() || event.LeftDown() || event.LeftDClick()){\n modifiers.SetLeftMouse();\n }\n else if (event.RightUp() || event.RightDown()){\n modifiers.SetRightMouse();\n }\n return modifiers;\n}\n\nMod key_modifiers(const wxKeyEvent& event){\n return Ctrl.If(event.ControlDown()) +\n Shift.If(event.ShiftDown()) +\n Alt.If(event.AltDown());\n}\n\nwxImage to_wx_image(const Bitmap& bmp){\n const int stride = bmp.m_row_stride;\n const uchar* bgraData = bmp.m_data;\n\n \/\/ Using malloc to match wxWidgets free\n uchar* rgbData = (uchar*)malloc(to_size_t(bmp.m_w * bmp.m_h * 3));\n uchar* aData = (uchar*)malloc(to_size_t(bmp.m_w * bmp.m_h));\n\n for (int y = 0; y != bmp.m_h; y++){\n for (int x = 0; x != bmp.m_w; x++){\n size_t srcPos = to_size_t(y * stride + x * ByPP);\n size_t dstPos_rgb = to_size_t(y * bmp.m_w * 3 + x * 3);\n size_t dstPos_alpha = to_size_t(y * bmp.m_w + x);\n rgbData[dstPos_rgb] = bgraData[srcPos + iR];\n rgbData[dstPos_rgb + 1] = bgraData[srcPos + iG];\n rgbData[dstPos_rgb + 2] = bgraData[srcPos + iB];\n aData[dstPos_alpha] = bgraData[srcPos + iA];\n }\n }\n\n \/\/ wxWidgets takes ownership of rgbData and aData, and uses free()\n \/\/ to release the memory.\n wxImage result(bmp.m_w, bmp.m_h, rgbData, aData);\n return result;\n}\n\nusing AlphaPixelData = wxPixelData<wxBitmap, wxAlphaPixelFormat>;\nusing PixelData = AlphaPixelData;\nwxBitmap to_wx_bmp(const Bitmap& bmp){\n wxBitmap wxBmp(bmp.m_w, bmp.m_h, 32);\n PixelData pData(wxBmp);\n assert(pData);\n PixelData::Iterator p = pData;\n\n uchar* data = bmp.m_data;\n const int stride = bmp.m_row_stride;\n\n for (int y = 0; y != bmp.m_h; y++){\n PixelData::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n int pos = y * stride + x * ByPP;\n #ifdef __WXMSW__\n const uchar alpha = *(data + pos + iA);\n p.Alpha() = alpha;\n \/\/ Todo: What. Simplify.\n p.Red() = (*(data + pos + iR) * alpha) \/ 255;\n p.Green() = (*(data + pos + iG) * alpha) \/ 255;\n p.Blue() = (*(data + pos + iB) * alpha) \/ 255;\n #else\n p.Alpha() = *(data + pos + iA);\n p.Red() = *(data + pos + iR);\n p.Green() = *(data + pos + iG);\n p.Blue() = *(data + pos + iB);\n #endif\n ++p;\n }\n p = rowStart;\n p.OffsetY(pData, 1);\n }\n return wxBmp;\n}\n\nBitmap to_faint(wxBitmap wxBmp){\n Bitmap bmp(to_faint(wxBmp.GetSize()));\n if (wxBmp.GetDepth() == 24){\n wxNativePixelData pixelData(wxBmp);\n if (!pixelData){\n goto alpha_label;\n }\n wxNativePixelData::Iterator p = pixelData;\n const int stride = bmp.m_row_stride;\n uchar* data = bmp.GetRaw();\n for (int y = 0; y != bmp.m_h; y++){\n wxPixelData<wxBitmap, wxNativePixelFormat>::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n size_t pos = to_size_t(y * stride + x * ByPP);\n data[pos + iA] = 255;\n data[pos + iR] = p.Red();\n data[pos + iG] = p.Green();\n data[pos + iB] = p.Blue();\n ++p;\n }\n p = rowStart;\n p.OffsetY(pixelData, 1);\n }\n }\n else {\n alpha_label:\n AlphaPixelData pixelData(wxBmp);\n assert(pixelData);\n AlphaPixelData::Iterator p = pixelData;\n const int stride = bmp.m_row_stride;\n uchar* data = bmp.GetRaw();\n for (int y = 0; y != bmp.m_h; y++){\n AlphaPixelData::Iterator rowStart = p;\n for (int x = 0; x != bmp.m_w; x++){\n size_t pos = to_size_t(y * stride + x * ByPP);\n #ifdef __WXMSW__\n \/\/ Convert back from premultiplied alpha\n data[pos + iA] = p.Alpha();\n if (p.Alpha() != 0){\n data[pos + iR] = (p.Red() * 255) \/ (255 - (255 - p.Alpha()));\n data[pos + iG] = (p.Green() * 255) \/ (255 - (255 - p.Alpha()));\n data[pos + iB] = (p.Blue() * 255) \/ (255 - (255 - p.Alpha()));\n }\n #else\n data[pos + iA] = p.Alpha();\n data[pos + iR] = p.Red();\n data[pos + iG] = p.Green();\n data[pos + iB] = p.Blue();\n #endif\n ++p;\n }\n p = rowStart;\n p.OffsetY(pixelData, 1);\n }\n }\n return bmp;\n}\n\n#ifdef __WXMSW__\n\/\/ Without this, pasting from clipboard in MSW causes this error:\n\/\/ msw\\bitmap.cpp(1287): assert \"Assert failure\" failed in\n\/\/ wxBitmap::GetRawData(): failed to get DIBSECTION from a DIB?\n\/\/\n\/\/ Probably this bug: http:\/\/trac.wxwidgets.org\/ticket\/11640\nwxBitmap clean_bitmap(const wxBitmap& dirtyBmp){\n \/\/ Note: This uses 24-bits-per-pixel, thereby losing alpha\n \/\/ information, as wxMemoryDC does not support alpha.\n \/\/\n \/\/ Using 32-bits-per-pixel here (or retrieving the necessary value\n \/\/ from the wxBitmap) works for pastes between applications and\n \/\/ within Faint, but fails for pastes from print screen (gives very\n \/\/ weird effects, probably random alpha values).\n \/\/\n \/\/ ... I've also tried GCDC Blit and DrawBitmap, neither retained\n \/\/ alpha.\n wxBitmap cleanBmp(dirtyBmp.GetWidth(), dirtyBmp.GetHeight(), 24);\n wxMemoryDC cleanDC(cleanBmp);\n cleanDC.DrawBitmap(dirtyBmp, 0, 0);\n cleanDC.SelectObject(wxNullBitmap);\n return cleanBmp;\n}\n#endif\n\n#ifndef __WXMSW__\n\nwxBitmap clean_bitmap(const wxBitmap& dirtyBmp){\n return dirtyBmp;\n}\n\n#endif\n\nutf8_char to_faint(const wxChar& ch){\n wxString s;\n s += ch;\n wxCharBuffer buf = s.utf8_str();\n return utf8_char(std::string(buf, buf.length()));\n}\n\nutf8_string to_faint(const wxString& str){\n wxCharBuffer buf(str.utf8_str());\n return utf8_string(std::string(buf, buf.length()));\n}\n\nwxString to_wx(const utf8_string& faintStr){\n return wxString::FromUTF8(faintStr.c_str());\n}\n\nFileList to_FileList(const wxArrayString& strings){\n FileList files;\n for (const wxString& str : strings){\n files.push_back(FilePath::FromAbsoluteWx(str));\n }\n return files;\n}\n\nwxString get_clipboard_text(){\n wxTextDataObject textObject;\n if (!wxTheClipboard->GetData(textObject)){\n return \"\";\n }\n return textObject.GetText();\n}\n\nstd::vector<wxString> wx_split_lines(const wxString& text){\n wxStringTokenizer tokenizer(text, \"\\r\\n\");\n std::vector<wxString> v;\n while (tokenizer.HasMoreTokens()){\n v.push_back(tokenizer.GetNextToken());\n }\n return v;\n}\n\n\n#ifdef FAINT_MSW\nstd::wstring iostream_friendly(const wxString& path){\n \/\/ As best I can tell this wxWidgets method will provide an\n \/\/ UTF16-encoded std::wstring, which the Visual C++-implementation\n \/\/ of iostream accepts.\n return path.ToStdWstring();\n}\n#else\nstd::string iostream_friendly(const wxString& path){\n return to_faint(path).str();\n}\n#endif\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/=============================================================================================================\n\/**\n * @file main.cpp\n * @author Juan Garcia-Prieto <juangpc@gmail.com>;\n * Lorenz Esch <lesch@mgh.harvard.edu>;\n * Wayne Mead <wayne.mead@uth.tmc.edu>;\n * John C. Mosher <John.C.Mosher@uth.tmc.edu>;\n * Matti Hamalainen <msh@nmr.mgh.harvard.edu>;\n * @date May, 2020\n * @since 0.1.0\n *\n * @section LICENSE\n *\n * Copyright (C) 2019, Juan Garcia-Prieto, Lorenz Esch, Matti Hamalainen, Wayne Mead, John C. Mosher. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n * * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n * following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n * the following disclaimer in the documentation and\/or other materials provided with the distribution.\n * * Neither the name of MNE-CPP authors nor the names of its contributors may be used\n * to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n *\n * @brief Application for anonymizing patient and personal health information from a fiff file.\n *\n *\/\n\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"apphandler.h\"\n#include <utils\/generics\/applicationlogger.h>\n\n\/\/=============================================================================================================\n\/\/ EIGEN INCLUDES\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n#include <QDebug>\n\/\/=============================================================================================================\n\/\/ FORWARD DECLARATIONS\n\/\/=============================================================================================================\n\nnamespace MNEANONYMIZE {\n class SettingsControllerCl;\n}\n\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\n\/**\n * The function main marks the entry point of the program.\n * By default, main has the storage class extern.\n *\n * @param[in] argc (argument count) is an integer that indicates how many arguments were entered on the.\n * command line when the program was started.\n * @param[in] argv (argument vector) is an array of pointers to arrays of character objects. The array objects.\n * are null-terminated strings, representing the arguments that were entered on the command line when the\n * program was started.\n *\n * @return the value that was set to exit() (which is 0 if exit() is called via quit()).\n *\/\nint main(int argc, char* argv[])\n{\n qInstallMessageHandler(UTILSLIB::ApplicationLogger::customLogWriter);\n\n QScopedPointer<MNEANONYMIZE::AppHandler> h(new MNEANONYMIZE::AppHandler);\n QScopedPointer<QCoreApplication> qtApp(h->createApplication(argc, argv));\n\n qtApp->setOrganizationName(\"MNE-CPP Project\");\n qtApp->setApplicationName(\"MNE Anonymize\");\n\n qDebug() << \"date: \" << __DATE__;\n\n QScopedPointer<MNEANONYMIZE::SettingsControllerCl> controller(h->createController(qtApp->arguments()));\n\n return qtApp->exec();\n}\n<commit_msg>delete data print in main fcn<commit_after>\/\/=============================================================================================================\n\/**\n * @file main.cpp\n * @author Juan Garcia-Prieto <juangpc@gmail.com>;\n * Lorenz Esch <lesch@mgh.harvard.edu>;\n * Wayne Mead <wayne.mead@uth.tmc.edu>;\n * John C. Mosher <John.C.Mosher@uth.tmc.edu>;\n * Matti Hamalainen <msh@nmr.mgh.harvard.edu>;\n * @date May, 2020\n * @since 0.1.0\n *\n * @section LICENSE\n *\n * Copyright (C) 2019, Juan Garcia-Prieto, Lorenz Esch, Matti Hamalainen, Wayne Mead, John C. Mosher. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided that\n * the following conditions are met:\n * * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n * following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and\n * the following disclaimer in the documentation and\/or other materials provided with the distribution.\n * * Neither the name of MNE-CPP authors nor the names of its contributors may be used\n * to endorse or promote products derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A\n * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n *\n * @brief Application for anonymizing patient and personal health information from a fiff file.\n *\n *\/\n\n\/\/=============================================================================================================\n\/\/ INCLUDES\n\/\/=============================================================================================================\n\n#include \"apphandler.h\"\n#include <utils\/generics\/applicationlogger.h>\n\n\/\/=============================================================================================================\n\/\/ EIGEN INCLUDES\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ QT INCLUDES\n\/\/=============================================================================================================\n#include <QDebug>\n\/\/=============================================================================================================\n\/\/ FORWARD DECLARATIONS\n\/\/=============================================================================================================\n\nnamespace MNEANONYMIZE {\n class SettingsControllerCl;\n}\n\n\/\/=============================================================================================================\n\/\/ USED NAMESPACES\n\/\/=============================================================================================================\n\n\/\/=============================================================================================================\n\/\/ MAIN\n\/\/=============================================================================================================\n\n\/**\n * The function main marks the entry point of the program.\n * By default, main has the storage class extern.\n *\n * @param[in] argc (argument count) is an integer that indicates how many arguments were entered on the.\n * command line when the program was started.\n * @param[in] argv (argument vector) is an array of pointers to arrays of character objects. The array objects.\n * are null-terminated strings, representing the arguments that were entered on the command line when the\n * program was started.\n *\n * @return the value that was set to exit() (which is 0 if exit() is called via quit()).\n *\/\nint main(int argc, char* argv[])\n{\n qInstallMessageHandler(UTILSLIB::ApplicationLogger::customLogWriter);\n\n QScopedPointer<MNEANONYMIZE::AppHandler> h(new MNEANONYMIZE::AppHandler);\n QScopedPointer<QCoreApplication> qtApp(h->createApplication(argc, argv));\n\n qtApp->setOrganizationName(\"MNE-CPP Project\");\n qtApp->setApplicationName(\"MNE Anonymize\");\n\n QScopedPointer<MNEANONYMIZE::SettingsControllerCl> controller(h->createController(qtApp->arguments()));\n\n return qtApp->exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"spmv_mult.hpp\"\n\n\/\/ Grappa\n#include \"Grappa.hpp\"\n#include \"Cache.hpp\"\n#include \"GlobalTaskJoiner.hpp\"\n#include \"ForkJoin.hpp\"\n#include \"Delegate.hpp\"\n\n\n#define XOFF(xoff, index) (xoff)+2*(index)\n#define XENDOFF(matrix, index) (xoff)+2*(index)+1\n\nnamespace spmv {\n \/\/ global: local per Node\n weighted_csr_graph m;\n vector v;\n vector y;\n}\n\nvoid inner_loop( int64_t start, int64_t iters, GlobalAddress<int64_t> targetIndex_h ) {\n \/\/ TODO don't use hack\n int64_t targetIndex = reinterpret_cast<int64_t>(targetIndex_h.pointer());\n\n double yaccum = 0;\n int64_t j[iters];\n double weights[iters];\n Incoherent<int64_t>::RO cj( spmv::m.xadj + start, iters, j ); cj.start_acquire();\n Incoherent<double>::RO cw( spmv::m.adjweight + start, iters, weights ); cw.start_acquire();\n for( int64_t k = 0; k<iters; k++ ) {\n double vj;\n \n Grappa_delegate_read(spmv::v.a + cj[k], &vj);\n yaccum += cw[k] * vj; \n DVLOG(5) << \"yaccum += w[\"<<start+k<<\"](\"<<cw[k] <<\") * val[\"<<cj[k]<<\"(\"<<vj<<\")\"; \n }\n\n DVLOG(4) << \"y[\" << targetIndex << \"] += \" << yaccum; \n ff_delegate_add<double>( spmv::y.a+targetIndex, yaccum );\n}\n\nvoid row_loop( int64_t start, int64_t iters ) {\n \/\/VLOG(1) << \"rows [\" << start << \", \" << start+iters << \")\";\n \n for ( int64_t i=start; i<start+iters; i++ ) {\n \/\/ kstart = row_ptr[i], kend = row_ptr[i+1]\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(spmv::m.xoff, i), 2, kbounds );\n int64_t kstart = cxoff[0];\n int64_t kend = cxoff[1];\n\n \/\/ TODO: don't use hack to wrap i\n async_parallel_for<int64_t,inner_loop, joinerSpawn_hack<int64_t,inner_loop,ASYNC_PAR_FOR_DEFAULT>,ASYNC_PAR_FOR_DEFAULT>(kstart, kend-kstart, make_global(reinterpret_cast<int64_t*>(i)));\n \n \/\/ TODO: if yi.start_release() could guarentee the storage is no longer used\n \/\/ then this would be nice for no block until all y[start,start+iters) need to be written, although that pressures the network side\n \/\/ Y could actually be like a feed forward delegate that syncs at global join end\n }\n}\n\/\/ In general, destination arrays that are either associatively accumulated into or written once into can often get by with very weak consistency: sync at very end once value of vector needs to be known valid result.\n \n\/\/ With current low level programming model, the choice to parallelize a loop involves different code\n\nGlobalCompletionEvent mmjoiner;\nvoid spmv_mult( weighted_csr_graph A, vector x, vector y ) {\n \/\/ forall rows\n forall_global_public<&mmjoiner>( 0, A.nv, [A, x, y]( int64_t start, int64_t iters ) {\n \/\/ serialized chunk of rows\n DVLOG(5) << \"rows [\" << start << \", \" << start+iters << \")\";\n for (int64_t i=start; i<start+iters; i++ ) {\n \/\/ kstart = row_ptr[i], kend = row_ptr[i+1]\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(A.xoff, i), 2, kbounds );\n int64_t kstart = cxoff[0];\n int64_t kend = cxoff[1];\n\n \/\/ forall non-zero columns (parallel dot product)\n forall_here_async_public<&mmjoiner>( kstart, kend-kstart, [i]( int64_t start, int64_t iters ) {\n double yaccum = 0;\n\n \/\/ serialized chunk of columns\n int64_t j[iters];\n double weights[iters];\n Incoherent<int64_t>::RO cj( A.xadj + start, iters, j ); cj.start_acquire();\n Incoherent<double>::RO cw( A.adjweight + start, iters, weights ); cw.start_acquire();\n for( int64_t k = 0; k<iters; k++ ) {\n double vj = Grappa::delegate::read(x.a + cj[k]);\n yaccum += cw[k] * vj; \n DVLOG(5) << \"yaccum += w[\"<<start+k<<\"](\"<<cw[k] <<\") * val[\"<<cj[k]<<\"(\"<<vj<<\")\"; \n }\n\n DVLOG(4) << \"y[\" << i << \"] += \" << yaccum; \n\n \/\/ TODO: trait on call_async not to use pool\n MessagePool pool( ##sizeof del## );\n \/\/FIXME async write\n call_async<&mmjoiner>( pool, ..., {});\n ff_delegate_add<double>( y.a+i, yaccum );\n \/\/ could force local updates and bulk communication \n \/\/ here instead of relying on aggregation\n \/\/ since we have to pay the cost of many increments and replies\n });\n }\n });\n}\n\n\n\/\/ only good for small matrices; write out in dense format\nvoid matrix_out( weighted_csr_graph * g, std::ostream& o, bool dense ) {\n for ( int64_t i = 0; i<g->nv; i++ ) {\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(g->xoff, i), 2, kbounds );\n const int64_t kstart = cxoff[0];\n const int64_t kend = cxoff[1];\n\n int64_t row[kend-kstart];\n Incoherent<int64_t>::RO crow( g->xadj + kstart, kend-kstart, row );\n\n double weights[kend-kstart];\n Incoherent<double>::RO cweights( g->adjweight + kstart, kend-kstart, weights );\n\n if (dense) { \n int64_t next_col = 0;\n for ( int64_t j = 0; j<g->nv; j++ ) {\n if ( next_col < (kend-kstart) && crow[next_col] == j ) {\n o << cweights[next_col] << \", \";\n next_col++;\n } else {\n o << \"0, \"; \n }\n }\n o << \"\\n\";\n CHECK (next_col==kend-kstart) << \"mismatch, did not print all entries; next_col=\"<<next_col<<\" kend-kstart=\" <<kend-kstart;\n } else {\n o << \"v=\" << i << \";; \";\n for ( int64_t ri=0; ri<kend-kstart; ri++ ) {\n o << crow[ri] << \",\";\n }\n o << \"\\n\";\n }\n }\n}\n\n\n\nvoid R_matrix_out( weighted_csr_graph * g, std::ostream& o) {\n o << \"matrix(data=c(\"; \n\n for ( int64_t i = 0; i<g->nv; i++ ) {\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(g->xoff, i), 2, kbounds );\n const int64_t kstart = cxoff[0];\n const int64_t kend = cxoff[1];\n\n int64_t row[kend-kstart];\n double weights[kend-kstart];\n Incoherent<int64_t>::RO crow( g->xadj + kstart, kend-kstart, row );\n Incoherent<double>::RO cw( g->adjweight + kstart, kend-kstart, weights );\n\n int64_t next_col = 0;\n for ( int64_t j = 0; j<g->nv; j++ ) {\n if ( next_col < (kend-kstart) && crow[next_col] == j ) {\n o << cw[next_col];\n next_col++;\n } else {\n o << \"0\"; \n }\n if (!(j==g->nv-1 && i==g->nv-1)) o <<\", \";\n }\n CHECK (next_col==kend-kstart) << \"mismatch, did not print all entries; next_col=\"<<next_col<<\" kend-kstart=\" <<kend-kstart;\n }\n o << \")\";\n o << \", nrow=\" << g->nv;\n o << \", ncol=\" << g->nv;\n o << \")\";\n}\n\nvoid vector_out( vector * v, std::ostream& o ) {\n Incoherent<double>::RO cv( v->a, v->length );\n for ( uint64_t i=0; i<v->length; i++ ) {\n o << cv[i] << \", \";\n }\n}\n\nvoid R_vector_out( vector * v, std::ostream& o ) {\n o << \"c(\";\n Incoherent<double>::RO cv( v->a, v->length );\n for ( uint64_t i=0; i<v->length-1; i++ ) {\n o << cv[i] << \", \";\n }\n o << cv[v->length-1];\n o << \")\";\n}\n<commit_msg>port matrix multiply to new api<commit_after>\n#include \"spmv_mult.hpp\"\n\n\/\/ Grappa\n#include <Grappa.hpp>\n#include <Cache.hpp>\n#include <GlobalCompletionEvent.hpp>\n#include <ParallelLoop.hpp>\n#include <Delegate.hpp>\n#include <AsyncDelegate.hpp>\n#include <MessagePool.hpp>\n\n\n#define XOFF(xoff, index) (xoff)+2*(index)\n#define XENDOFF(matrix, index) (xoff)+2*(index)+1\n\nnamespace spmv {\n \/\/ global: local per Node\n weighted_csr_graph m;\n vector x;\n vector y;\n}\n\nusing namespace Grappa;\n\n \n\/\/ With current low level programming model, the choice to parallelize a loop involves different code\n\nGlobalCompletionEvent mmjoiner;\nvoid spmv_mult( weighted_csr_graph A, vector x, vector y ) {\n \/\/ cannot capture in all for loops, so just set on all cores\n on_all_cores( [A,x,y] {\n spmv::m = A;\n spmv::x = x;\n spmv::y = y;\n });\n\n \/\/ forall rows\n forall_global_public<&mmjoiner>( 0, A.nv, []( int64_t start, int64_t iters ) {\n \/\/ serialized chunk of rows\n DVLOG(5) << \"rows [\" << start << \", \" << start+iters << \")\";\n for (int64_t i=start; i<start+iters; i++ ) {\n \/\/ kstart = row_ptr[i], kend = row_ptr[i+1]\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(spmv::m.xoff, i), 2, kbounds );\n int64_t kstart = cxoff[0];\n int64_t kend = cxoff[1];\n\n \/\/ forall non-zero columns (parallel dot product)\n forall_here_async_public<&mmjoiner>( kstart, kend-kstart, [i]( int64_t start, int64_t iters ) {\n double yaccum = 0;\n\n \/\/ serialized chunk of columns\n int64_t j[iters];\n double weights[iters];\n Incoherent<int64_t>::RO cj( spmv::m.xadj + start, iters, j ); cj.start_acquire();\n Incoherent<double>::RO cw( spmv::m.adjweight + start, iters, weights ); cw.start_acquire();\n for( int64_t k = 0; k<iters; k++ ) {\n double vj = Grappa::delegate::read(spmv::x.a + cj[k]);\n yaccum += cw[k] * vj; \n DVLOG(5) << \"yaccum += w[\"<<start+k<<\"](\"<<cw[k] <<\") * val[\"<<cj[k]<<\"(\"<<vj<<\")\"; \n }\n\n DVLOG(4) << \"y[\" << i << \"] += \" << yaccum; \n\n char pool_storage[sizeof(delegate::write_msg_proxy<double>)]; \/\/ TODO: trait on call_async not to use pool\n MessagePool pool( pool_storage, sizeof(pool_storage) );\n delegate::increment_async<&mmjoiner>(pool, spmv::y.a+i, yaccum);\n \/\/ could force local updates and bulk communication \n \/\/ here instead of relying on aggregation\n \/\/ since we have to pay the cost of many increments and replies\n });\n }\n });\n}\n \/\/ TODO: if yi.start_release() could guarentee the storage is no longer used\n \/\/ then this would be nice for no block until all y[start,start+iters) need to be written, although that pressures the network side\n \/\/ Y could actually be like a feed forward delegate that syncs at global join end\n\/\/ In general, destination arrays that are either associatively accumulated into or written once into can often get by with very weak consistency: sync at very end once value of vector needs to be known valid result.\n\n\n\/\/ only good for small matrices; write out in dense format\nvoid matrix_out( weighted_csr_graph * g, std::ostream& o, bool dense ) {\n for ( int64_t i = 0; i<g->nv; i++ ) {\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(g->xoff, i), 2, kbounds );\n const int64_t kstart = cxoff[0];\n const int64_t kend = cxoff[1];\n\n int64_t row[kend-kstart];\n Incoherent<int64_t>::RO crow( g->xadj + kstart, kend-kstart, row );\n\n double weights[kend-kstart];\n Incoherent<double>::RO cweights( g->adjweight + kstart, kend-kstart, weights );\n\n if (dense) { \n int64_t next_col = 0;\n for ( int64_t j = 0; j<g->nv; j++ ) {\n if ( next_col < (kend-kstart) && crow[next_col] == j ) {\n o << cweights[next_col] << \", \";\n next_col++;\n } else {\n o << \"0, \"; \n }\n }\n o << \"\\n\";\n CHECK (next_col==kend-kstart) << \"mismatch, did not print all entries; next_col=\"<<next_col<<\" kend-kstart=\" <<kend-kstart;\n } else {\n o << \"v=\" << i << \";; \";\n for ( int64_t ri=0; ri<kend-kstart; ri++ ) {\n o << crow[ri] << \",\";\n }\n o << \"\\n\";\n }\n }\n}\n\n\n\nvoid R_matrix_out( weighted_csr_graph * g, std::ostream& o) {\n o << \"matrix(data=c(\"; \n\n for ( int64_t i = 0; i<g->nv; i++ ) {\n int64_t kbounds[2];\n Incoherent<int64_t>::RO cxoff( XOFF(g->xoff, i), 2, kbounds );\n const int64_t kstart = cxoff[0];\n const int64_t kend = cxoff[1];\n\n int64_t row[kend-kstart];\n double weights[kend-kstart];\n Incoherent<int64_t>::RO crow( g->xadj + kstart, kend-kstart, row );\n Incoherent<double>::RO cw( g->adjweight + kstart, kend-kstart, weights );\n\n int64_t next_col = 0;\n for ( int64_t j = 0; j<g->nv; j++ ) {\n if ( next_col < (kend-kstart) && crow[next_col] == j ) {\n o << cw[next_col];\n next_col++;\n } else {\n o << \"0\"; \n }\n if (!(j==g->nv-1 && i==g->nv-1)) o <<\", \";\n }\n CHECK (next_col==kend-kstart) << \"mismatch, did not print all entries; next_col=\"<<next_col<<\" kend-kstart=\" <<kend-kstart;\n }\n o << \")\";\n o << \", nrow=\" << g->nv;\n o << \", ncol=\" << g->nv;\n o << \")\";\n}\n\nvoid vector_out( vector * v, std::ostream& o ) {\n Incoherent<double>::RO cv( v->a, v->length );\n for ( uint64_t i=0; i<v->length; i++ ) {\n o << cv[i] << \", \";\n }\n}\n\nvoid R_vector_out( vector * v, std::ostream& o ) {\n o << \"c(\";\n Incoherent<double>::RO cv( v->a, v->length );\n for ( uint64_t i=0; i<v->length-1; i++ ) {\n o << cv[i] << \", \";\n }\n o << cv[v->length-1];\n o << \")\";\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * TinyJS\r\n *\r\n * A single-file Javascript-alike engine\r\n *\r\n * Authored By Gordon Williams <gw@pur3.co.uk>\r\n *\r\n * Copyright (C) 2009 Pur3 Ltd\r\n *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n * this software and associated documentation files (the \"Software\"), to deal in\r\n * the Software without restriction, including without limitation the rights to\r\n * use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies\r\n * of the Software, and to permit persons to whom the Software is furnished to do\r\n * so, subject to the following conditions:\r\n\r\n * The above copyright notice and this permission notice shall be included in all\r\n * copies or substantial portions of the Software.\r\n\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n * SOFTWARE.\r\n *\/\r\n\r\n\/*\r\n * This is a program to run all the tests in the tests folder...\r\n *\/\r\n\r\n#include \"OS_support.h\"\r\n#include \"utils.h\"\r\n#include \"scriptMain.h\"\r\n#include \"mvmCodegen.h\"\r\n#include \"jsParser.h\"\r\n#include \"semanticCheck.h\"\r\n#include \"TinyJS_Functions.h\"\r\n#include \"actorRuntime.h\"\r\n\r\n#include <assert.h>\r\n#include <sys\/stat.h>\r\n#include <string>\r\n#include <sstream>\r\n#include <stdio.h>\r\n\r\nusing namespace std;\r\n\r\n\/**\r\n * Generic JSON format logger.\r\n * It is used to generate call log.\r\n *\/\r\nclass JsonLogger\r\n{\r\npublic:\r\n JsonLogger (const string& filePath) : m_path (filePath)\r\n {\r\n FILE* pf = fopen (m_path.c_str(), \"w\");\r\n if (pf)\r\n {\r\n fclose(pf);\r\n log (\"[\", false);\r\n m_first = true;\r\n }\r\n }\r\n \r\n ~JsonLogger()\r\n {\r\n log (\"]\", false);\r\n }\r\n \r\n void log (const string& text, bool comma = true)\r\n {\r\n FILE* pf = fopen (m_path.c_str(), \"a+\");\r\n \r\n if (pf)\r\n {\r\n if (comma && !m_first)\r\n fprintf (pf, \",%s\\n\", text.c_str());\r\n else\r\n fprintf (pf, \"%s\\n\", text.c_str());\r\n m_first = false;\r\n fclose(pf);\r\n }\r\n }\r\n \r\nprivate:\r\n string m_path;\r\n bool m_first;\r\n};\r\n\r\nJsonLogger* s_curFunctionLogger = NULL;\r\n\r\n\r\n\/**\r\n * Assertion function exported to tests\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> assertFunction(FunctionScope* pScope)\r\n{\r\n auto value = pScope->getParam(\"value\");\r\n \r\n if (!value->toBoolean())\r\n {\r\n auto text = pScope->getParam(\"text\")->toString();\r\n \r\n error(\"Assertion failed: %s\", text.c_str());\r\n }\r\n \r\n return undefined();\r\n}\r\n\r\n\/**\r\n * Executes some code using eval, and expects that it throws a 'CScriptException'.\r\n * It catches the exception, and returns 'true'. If no exception is throw, it \r\n * throws an exception to indicate a test failure.\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> expectError(FunctionScope* pScope)\r\n{\r\n string code = pScope->getParam(\"code\")->toString();\r\n \r\n try\r\n {\r\n evaluate (code.c_str(), createDefaultGlobals());\r\n }\r\n catch (CScriptException& error)\r\n {\r\n return jsTrue();\r\n }\r\n \r\n error (\"No exception thrown: %s\", code.c_str());\r\n \r\n return jsFalse();\r\n}\r\n\r\n\r\n\/**\r\n * Function to write on standard output\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> printLn(FunctionScope* pScope)\r\n{\r\n auto text = pScope->getParam(\"text\");\r\n \r\n printf (\"%s\\n\", text->toString().c_str());\r\n \r\n return undefined();\r\n}\r\n\r\n\/**\r\n * Gives access to the parser to the tested code.\r\n * Useful for tests which target the parser.\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> asParse(FunctionScope* pScope)\r\n{\r\n string code = pScope->getParam(\"code\")->toString();\r\n CScriptToken token (code.c_str());\r\n auto result = JSArray::create();\r\n\r\n \/\/Parsing loop\r\n token = token.next();\r\n while (!token.eof())\r\n {\r\n const ParseResult parseRes = parseStatement (token);\r\n\r\n result->push(parseRes.ast->toJS());\r\n token = parseRes.nextToken;\r\n }\r\n \r\n return result;\r\n}\r\n\r\n\/**\r\n * Funs a test script loaded from a file.\r\n * @param szFile Path to the test script.\r\n * @param testDir Directory in which the test script is located.\r\n * @param resultsDir Directory in which tests results are written\r\n * @return \r\n *\/\r\nbool run_test(const std::string& szFile, const string &testDir, const string& resultsDir)\r\n{\r\n printf(\"TEST %s \", szFile.c_str());\r\n \r\n string script = readTextFile(szFile);\r\n if (script.empty())\r\n {\r\n printf(\"Cannot read file: '%s'\\n\", szFile.c_str());\r\n return false;\r\n }\r\n \r\n const string relPath = szFile.substr (testDir.size());\r\n const string testName = removeExt( fileFromPath(relPath));\r\n string testResultsDir = resultsDir + removeExt(relPath) + '\/';\r\n\r\n auto globals = createDefaultGlobals();\r\n \r\n globals->newVar(\"result\", jsInt(0));\r\n addNative(\"function assert(value, text)\", assertFunction, globals);\r\n addNative(\"function printLn(text)\", printLn, globals);\r\n addNative(\"function expectError(code)\", expectError, globals);\r\n addNative(\"function asParse(code)\", asParse, globals);\r\n try\r\n {\r\n \/\/This code is copied from 'evaluate', to log the intermediate results \r\n \/\/generated from each state\r\n CScriptToken token (script.c_str());\r\n AstNodeList statements;\r\n\r\n \/\/Parsing loop\r\n token = token.next();\r\n while (!token.eof())\r\n {\r\n const ParseResult parseRes = parseStatement (token);\r\n\r\n statements.push_back(parseRes.ast);\r\n token = parseRes.nextToken;\r\n }\r\n\r\n \/\/Write Abstract Syntax Tree\r\n const string astJSON = toJSON (statements);\r\n writeTextFile(testResultsDir + testName + \".ast.json\", astJSON);\r\n \r\n \/\/Semantic analysis\r\n semanticCheck(statements);\r\n\r\n \/\/Code generation.\r\n const Ref<MvmRoutine> code = scriptCodegen(statements);\r\n\r\n \/\/Write disassembly\r\n writeTextFile(testResultsDir + testName + \".asm.json\", mvmDisassembly(code));\r\n \r\n \/\/Call logger setup\r\n JsonLogger callLogger (testResultsDir + testName + \".calls.json\");\r\n s_curFunctionLogger = &callLogger;\r\n auto logFn = [](FunctionScope* pScope) -> Ref<JSValue>\r\n {\r\n auto entry = pScope->getParam(\"x\");\r\n \r\n s_curFunctionLogger->log(entry->getJSON(0));\r\n return undefined();\r\n };\r\n \/\/addNative(\"function callLogger(x)\", logFn, globals);\r\n\r\n \/\/Execution\r\n \/\/mvmExecute(code, globals);\r\n asBlockingExec(code, globals);\r\n }\r\n catch (const CScriptException &e)\r\n {\r\n printf(\"ERROR: %s\\n\", e.what());\r\n }\r\n\r\n \/\/Write globals\r\n writeTextFile(testResultsDir + testName + \".globals.json\", globals->toObject()->getJSON(0));\r\n\r\n bool pass = null2undef( globals->get(\"result\") )->toBoolean();\r\n\r\n if (pass)\r\n printf(\"PASS\\n\");\r\n else\r\n printf(\"FAIL\\n\");\r\n\r\n return pass;\r\n}\r\n\r\nint main(int argc, char **argv)\r\n{\r\n const string testsDir = \".\/tests\/\";\r\n const string resultsDir = \".\/tests\/results\/\";\r\n \r\n printf(\"TinyJS test runner\\n\");\r\n printf(\"USAGE:\\n\");\r\n printf(\" .\/run_tests test.js : run just one test\\n\");\r\n printf(\" .\/run_tests : run all tests\\n\");\r\n if (argc == 2)\r\n {\r\n printf(\"Running test: %s\\n\", argv[1]);\r\n \r\n return !run_test(testsDir + argv[1], testsDir, resultsDir);\r\n }\r\n else\r\n printf(\"Running all tests!\\n\");\r\n\r\n int test_num = 1;\r\n int count = 0;\r\n int passed = 0;\r\n \r\n \/\/TODO: Run all tests in the directory (or even in subdirectories). Do not depend\r\n \/\/on test numbers.\r\n\r\n while (test_num < 1000)\r\n {\r\n char name[32];\r\n sprintf_s(name, \"test%03d.js\", test_num);\r\n \r\n const string szPath = testsDir + name;\r\n \/\/ check if the file exists - if not, assume we're at the end of our tests\r\n FILE *f = fopen(szPath.c_str(), \"r\");\r\n if (!f) break;\r\n fclose(f);\r\n\r\n if (run_test(szPath, testsDir, resultsDir))\r\n passed++;\r\n count++;\r\n test_num++;\r\n }\r\n\r\n printf(\"Done. %d tests, %d pass, %d fail\\n\", count, passed, count - passed);\r\n\r\n#ifdef _DEBUG\r\n#ifdef _WIN32\r\n _CrtDumpMemoryLeaks();\r\n#endif\r\n#endif\r\n\r\n return 0;\r\n}\r\n<commit_msg>Added comment<commit_after>\/*\r\n * TinyJS\r\n *\r\n * A single-file Javascript-alike engine\r\n *\r\n * Authored By Gordon Williams <gw@pur3.co.uk>\r\n *\r\n * Copyright (C) 2009 Pur3 Ltd\r\n *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n * this software and associated documentation files (the \"Software\"), to deal in\r\n * the Software without restriction, including without limitation the rights to\r\n * use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies\r\n * of the Software, and to permit persons to whom the Software is furnished to do\r\n * so, subject to the following conditions:\r\n\r\n * The above copyright notice and this permission notice shall be included in all\r\n * copies or substantial portions of the Software.\r\n\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\r\n * SOFTWARE.\r\n *\/\r\n\r\n\/*\r\n * This is a program to run all the tests in the tests folder...\r\n *\/\r\n\r\n#include \"OS_support.h\"\r\n#include \"utils.h\"\r\n#include \"scriptMain.h\"\r\n#include \"mvmCodegen.h\"\r\n#include \"jsParser.h\"\r\n#include \"semanticCheck.h\"\r\n#include \"TinyJS_Functions.h\"\r\n#include \"actorRuntime.h\"\r\n\r\n#include <assert.h>\r\n#include <sys\/stat.h>\r\n#include <string>\r\n#include <sstream>\r\n#include <stdio.h>\r\n\r\nusing namespace std;\r\n\r\n\/**\r\n * Generic JSON format logger.\r\n * It is used to generate call log.\r\n *\/\r\nclass JsonLogger\r\n{\r\npublic:\r\n JsonLogger (const string& filePath) : m_path (filePath)\r\n {\r\n FILE* pf = fopen (m_path.c_str(), \"w\");\r\n if (pf)\r\n {\r\n fclose(pf);\r\n log (\"[\", false);\r\n m_first = true;\r\n }\r\n }\r\n \r\n ~JsonLogger()\r\n {\r\n log (\"]\", false);\r\n }\r\n \r\n void log (const string& text, bool comma = true)\r\n {\r\n FILE* pf = fopen (m_path.c_str(), \"a+\");\r\n \r\n if (pf)\r\n {\r\n if (comma && !m_first)\r\n fprintf (pf, \",%s\\n\", text.c_str());\r\n else\r\n fprintf (pf, \"%s\\n\", text.c_str());\r\n m_first = false;\r\n fclose(pf);\r\n }\r\n }\r\n \r\nprivate:\r\n string m_path;\r\n bool m_first;\r\n};\r\n\r\nJsonLogger* s_curFunctionLogger = NULL;\r\n\r\n\r\n\/**\r\n * Assertion function exported to tests\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> assertFunction(FunctionScope* pScope)\r\n{\r\n auto value = pScope->getParam(\"value\");\r\n \r\n if (!value->toBoolean())\r\n {\r\n auto text = pScope->getParam(\"text\")->toString();\r\n \r\n error(\"Assertion failed: %s\", text.c_str());\r\n }\r\n \r\n return undefined();\r\n}\r\n\r\n\/**\r\n * Executes some code using eval, and expects that it throws a 'CScriptException'.\r\n * It catches the exception, and returns 'true'. If no exception is throw, it \r\n * throws an exception to indicate a test failure.\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> expectError(FunctionScope* pScope)\r\n{\r\n string code = pScope->getParam(\"code\")->toString();\r\n \r\n try\r\n {\r\n evaluate (code.c_str(), createDefaultGlobals());\r\n }\r\n catch (CScriptException& error)\r\n {\r\n return jsTrue();\r\n }\r\n \r\n error (\"No exception thrown: %s\", code.c_str());\r\n \r\n return jsFalse();\r\n}\r\n\r\n\r\n\/**\r\n * Function to write on standard output\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> printLn(FunctionScope* pScope)\r\n{\r\n auto text = pScope->getParam(\"text\");\r\n \r\n printf (\"%s\\n\", text->toString().c_str());\r\n \r\n return undefined();\r\n}\r\n\r\n\/**\r\n * Gives access to the parser to the tested code.\r\n * Useful for tests which target the parser.\r\n * @param pScope\r\n * @return \r\n *\/\r\nRef<JSValue> asParse(FunctionScope* pScope)\r\n{\r\n string code = pScope->getParam(\"code\")->toString();\r\n CScriptToken token (code.c_str());\r\n auto result = JSArray::create();\r\n\r\n \/\/Parsing loop\r\n token = token.next();\r\n while (!token.eof())\r\n {\r\n const ParseResult parseRes = parseStatement (token);\r\n\r\n result->push(parseRes.ast->toJS());\r\n token = parseRes.nextToken;\r\n }\r\n \r\n return result;\r\n}\r\n\r\n\/**\r\n * Funs a test script loaded from a file.\r\n * @param szFile Path to the test script.\r\n * @param testDir Directory in which the test script is located.\r\n * @param resultsDir Directory in which tests results are written\r\n * @return \r\n *\/\r\nbool run_test(const std::string& szFile, const string &testDir, const string& resultsDir)\r\n{\r\n printf(\"TEST %s \", szFile.c_str());\r\n \r\n string script = readTextFile(szFile);\r\n if (script.empty())\r\n {\r\n printf(\"Cannot read file: '%s'\\n\", szFile.c_str());\r\n return false;\r\n }\r\n \r\n const string relPath = szFile.substr (testDir.size());\r\n const string testName = removeExt( fileFromPath(relPath));\r\n string testResultsDir = resultsDir + removeExt(relPath) + '\/';\r\n\r\n auto globals = createDefaultGlobals();\r\n \r\n globals->newVar(\"result\", jsInt(0));\r\n addNative(\"function assert(value, text)\", assertFunction, globals);\r\n addNative(\"function printLn(text)\", printLn, globals);\r\n addNative(\"function expectError(code)\", expectError, globals);\r\n addNative(\"function asParse(code)\", asParse, globals);\r\n try\r\n {\r\n \/\/This code is copied from 'evaluate', to log the intermediate results \r\n \/\/generated from each state\r\n CScriptToken token (script.c_str());\r\n AstNodeList statements;\r\n\r\n \/\/Parsing loop\r\n token = token.next();\r\n while (!token.eof())\r\n {\r\n const ParseResult parseRes = parseStatement (token);\r\n\r\n statements.push_back(parseRes.ast);\r\n token = parseRes.nextToken;\r\n }\r\n\r\n \/\/Write Abstract Syntax Tree\r\n const string astJSON = toJSON (statements);\r\n writeTextFile(testResultsDir + testName + \".ast.json\", astJSON);\r\n \r\n \/\/Semantic analysis\r\n semanticCheck(statements);\r\n\r\n \/\/Code generation.\r\n const Ref<MvmRoutine> code = scriptCodegen(statements);\r\n\r\n \/\/Write disassembly\r\n writeTextFile(testResultsDir + testName + \".asm.json\", mvmDisassembly(code));\r\n \r\n \/\/Call logger setup\r\n JsonLogger callLogger (testResultsDir + testName + \".calls.json\");\r\n s_curFunctionLogger = &callLogger;\r\n auto logFn = [](FunctionScope* pScope) -> Ref<JSValue>\r\n {\r\n auto entry = pScope->getParam(\"x\");\r\n \r\n s_curFunctionLogger->log(entry->getJSON(0));\r\n return undefined();\r\n };\r\n \/\/addNative(\"function callLogger(x)\", logFn, globals);\r\n\r\n \/\/Execution\r\n \/\/mvmExecute(code, globals);\r\n asBlockingExec(code, globals);\r\n }\r\n catch (const CScriptException &e)\r\n {\r\n printf(\"ERROR: %s\\n\", e.what());\r\n }\r\n\r\n \/\/Write globals\r\n writeTextFile(testResultsDir + testName + \".globals.json\", globals->toObject()->getJSON(0));\r\n\r\n bool pass = null2undef( globals->get(\"result\") )->toBoolean();\r\n\r\n if (pass)\r\n printf(\"PASS\\n\");\r\n else\r\n printf(\"FAIL\\n\");\r\n\r\n return pass;\r\n}\r\n\r\n\/**\r\n * Test program entry point.\r\n * @param argc\r\n * @param argv\r\n * @return \r\n *\/\r\nint main(int argc, char **argv)\r\n{\r\n const string testsDir = \".\/tests\/\";\r\n const string resultsDir = \".\/tests\/results\/\";\r\n \r\n printf(\"TinyJS test runner\\n\");\r\n printf(\"USAGE:\\n\");\r\n printf(\" .\/run_tests test.js : run just one test\\n\");\r\n printf(\" .\/run_tests : run all tests\\n\");\r\n if (argc == 2)\r\n {\r\n printf(\"Running test: %s\\n\", argv[1]);\r\n \r\n return !run_test(testsDir + argv[1], testsDir, resultsDir);\r\n }\r\n else\r\n printf(\"Running all tests!\\n\");\r\n\r\n int test_num = 1;\r\n int count = 0;\r\n int passed = 0;\r\n \r\n \/\/TODO: Run all tests in the directory (or even in subdirectories). Do not depend\r\n \/\/on test numbers.\r\n\r\n while (test_num < 1000)\r\n {\r\n char name[32];\r\n sprintf_s(name, \"test%03d.js\", test_num);\r\n \r\n const string szPath = testsDir + name;\r\n \/\/ check if the file exists - if not, assume we're at the end of our tests\r\n FILE *f = fopen(szPath.c_str(), \"r\");\r\n if (!f) break;\r\n fclose(f);\r\n\r\n if (run_test(szPath, testsDir, resultsDir))\r\n passed++;\r\n count++;\r\n test_num++;\r\n }\r\n\r\n printf(\"Done. %d tests, %d pass, %d fail\\n\", count, passed, count - passed);\r\n\r\n#ifdef _DEBUG\r\n#ifdef _WIN32\r\n _CrtDumpMemoryLeaks();\r\n#endif\r\n#endif\r\n\r\n return 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * Copyright (c) 2010 Kohei Yoshida\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#ifndef __SEGMENTTREE_HPP__\n#define __SEGMENTTREE_HPP__\n\n#include \"node.hpp\"\n\n#include <vector>\n#include <list>\n#include <iostream>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\nnamespace mdds {\n\ntemplate<typename _Key, typename _Data>\nclass segment_tree\n{\npublic:\n typedef _Key key_type;\n typedef _Data data_type;\n typedef ::std::list<data_type*> data_chain_type;\n\n struct nonleaf_value_type\n {\n };\n\n struct leaf_value_type\n {\n key_type key;\n data_chain_type* data_chain;\n };\n\n struct node : public node_base\n {\n union {\n nonleaf_value_type value_nonleaf;\n leaf_value_type value_leaf;\n };\n\n node(bool _is_leaf) :\n node_base(_is_leaf)\n {\n if (_is_leaf)\n value_leaf.data_chain = NULL;\n }\n\n node(const node& r) :\n node_base(r)\n {\n }\n\n virtual ~node()\n {\n if (is_leaf)\n delete value_leaf.data_chain;\n }\n\n bool equals(const node& r) const\n {\n if (is_leaf != r.is_leaf)\n return false;\n\n return true;\n }\n\n virtual void fill_nonleaf_value(const node_base_ptr& left_node, const node_base_ptr& right_node)\n {\n }\n\n virtual void dump_value() const\n {\n }\n\n virtual node_base* create_new(bool leaf) const\n {\n return new node(leaf);\n }\n\n virtual node_base* clone() const\n {\n return new node(*this);\n }\n };\n\n segment_tree();\n ~segment_tree();\n\n bool is_tree_valid() const { return m_valid_tree; }\n\n void build_tree();\n\n void insert(key_type begin_key, key_type end_key, data_type* pdata);\n\nprivate:\n static node* get_node(const node_base_ptr& base_node)\n { \n return static_cast<node*>(base_node.get());\n }\n\n static void build_leaf_node(const ::std::vector<key_type>& keys, node_base_ptr& left, node_base_ptr& right);\n\nprivate:\n struct segment_data\n {\n key_type begin_key;\n key_type end_key;\n data_type* pdata;\n\n segment_data(key_type _beg, key_type _end, data_type* p) :\n begin_key(_beg), end_key(_end), pdata(p) {}\n };\n\n typedef ::boost::ptr_vector<segment_data> data_array_type;\n data_array_type m_segment_data;\n\n node_base_ptr m_root_node;\n node_base_ptr m_left_leaf;\n node_base_ptr m_right_leaf;\n bool m_valid_tree:1;\n};\n\ntemplate<typename _Key, typename _Data>\nsegment_tree<_Key, _Data>::segment_tree() :\n m_valid_tree(false)\n{\n}\n\ntemplate<typename _Key, typename _Data>\nsegment_tree<_Key, _Data>::~segment_tree()\n{\n \/\/ Go through all leaf nodes, and disconnect their links.\n node_base* cur_node = m_left_leaf.get();\n do\n {\n node_base* next_node = cur_node->right.get();\n disconnect_node(cur_node);\n cur_node = next_node;\n }\n while (cur_node != m_right_leaf.get());\n\n disconnect_node(m_right_leaf.get());\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::build_tree()\n{\n using namespace std;\n\n \/\/ In 1st pass, collect unique end-point values and sort them.\n vector<key_type> keys_uniq;\n keys_uniq.reserve(m_segment_data.size()*2);\n typename data_array_type::const_iterator itr, itr_beg = m_segment_data.begin(), itr_end = m_segment_data.end();\n for (itr = itr_beg; itr != itr_end; ++itr)\n {\n cout << itr->begin_key << \",\" << itr->end_key << \": \" << itr->pdata << endl;\n keys_uniq.push_back(itr->begin_key);\n keys_uniq.push_back(itr->end_key);\n }\n\n \/\/ sort and remove duplicates.\n sort(keys_uniq.begin(), keys_uniq.end());\n keys_uniq.erase(unique(keys_uniq.begin(), keys_uniq.end()), keys_uniq.end());\n\n \/\/ debug output.\n cout << \"unique keys: \";\n copy(keys_uniq.begin(), keys_uniq.end(), ostream_iterator<key_type>(cout, \" \"));\n cout << endl;\n\n \/\/ Create leaf nodes with the unique end-point values.\n build_leaf_node(keys_uniq, m_left_leaf, m_right_leaf);\n\n \/\/ debug output.\n {\n cout << \"forward: \";\n node* p = get_node(m_left_leaf);\n while (p)\n {\n cout << p->value_leaf.key << \" \";\n p = get_node(p->right);\n }\n cout << endl;\n\n cout << \"backward: \";\n p = get_node(m_right_leaf);\n while (p)\n {\n cout << p->value_leaf.key << \" \";\n p = get_node(p->left);\n }\n cout << endl;\n }\n\n \/\/ In 2nd pass, \"insert\" each segment.\n for (itr = itr_beg; itr != itr_end; ++itr)\n {\n key_type key_beg = itr->begin_key;\n key_type key_end = itr->end_key;\n data_type* pdata = itr->pdata;\n\n node* p = get_node(m_left_leaf);\n while (p)\n {\n if (p->value_leaf.key == key_beg)\n {\n leaf_value_type& v = p->value_leaf;\n if (!v.data_chain)\n v.data_chain = new data_chain_type;\n v.data_chain->push_back(pdata);\n }\n else if (p->value_leaf.key == key_end)\n {\n \/\/ Insert data pointer to the previous node _only when_ the\n \/\/ value of the previous node doesn't equal the begin point\n \/\/ value.\n node* pprev = get_node(p->left);\n if (pprev && pprev->value_leaf.key != key_beg)\n {\n leaf_value_type& v = pprev->value_leaf;\n if (!v.data_chain)\n v.data_chain = new data_chain_type;\n v.data_chain->push_back(pdata);\n }\n }\n p = get_node(p->right);\n }\n }\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::build_leaf_node(const ::std::vector<key_type>& keys, node_base_ptr& left, node_base_ptr& right)\n{\n if (keys.empty() || keys.size() < 2)\n \/\/ We need at least two keys in order to build tree.\n return;\n\n typename ::std::vector<key_type>::const_iterator itr = keys.begin(), itr_end = keys.end();\n\n \/\/ left-most node\n left.reset(new node(true));\n get_node(left)->value_leaf.key = *itr;\n\n \/\/ move on to next.\n left->right.reset(new node(true));\n node_base_ptr prev_node = left;\n node_base_ptr cur_node = left->right;\n cur_node->left = prev_node;\n\n for (++itr; itr != itr_end; ++itr)\n {\n get_node(cur_node)->value_leaf.key = *itr;\n\n \/\/ move on to next\n cur_node->right.reset(new node(true));\n prev_node = cur_node;\n cur_node = cur_node->right;\n cur_node->left = prev_node;\n }\n\n \/\/ Remove the excess node.\n prev_node->right.reset();\n right = prev_node;\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::insert(key_type begin_key, key_type end_key, data_type* pdata)\n{\n if (begin_key >= end_key)\n return;\n\n m_segment_data.push_back(new segment_data(begin_key, end_key, pdata));\n}\n\n}\n\n#endif\n<commit_msg>Print out attached data pointers for each leaf node.<commit_after>\/*************************************************************************\n *\n * Copyright (c) 2010 Kohei Yoshida\n * \n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n * \n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\n ************************************************************************\/\n\n#ifndef __SEGMENTTREE_HPP__\n#define __SEGMENTTREE_HPP__\n\n#include \"node.hpp\"\n\n#include <vector>\n#include <list>\n#include <iostream>\n#include <boost\/ptr_container\/ptr_vector.hpp>\n\nnamespace mdds {\n\ntemplate<typename _Key, typename _Data>\nclass segment_tree\n{\npublic:\n typedef _Key key_type;\n typedef _Data data_type;\n typedef ::std::list<data_type*> data_chain_type;\n\n struct nonleaf_value_type\n {\n };\n\n struct leaf_value_type\n {\n key_type key;\n data_chain_type* data_chain;\n };\n\n struct node : public node_base\n {\n union {\n nonleaf_value_type value_nonleaf;\n leaf_value_type value_leaf;\n };\n\n node(bool _is_leaf) :\n node_base(_is_leaf)\n {\n if (_is_leaf)\n value_leaf.data_chain = NULL;\n }\n\n node(const node& r) :\n node_base(r)\n {\n }\n\n virtual ~node()\n {\n if (is_leaf)\n delete value_leaf.data_chain;\n }\n\n bool equals(const node& r) const\n {\n if (is_leaf != r.is_leaf)\n return false;\n\n return true;\n }\n\n virtual void fill_nonleaf_value(const node_base_ptr& left_node, const node_base_ptr& right_node)\n {\n }\n\n virtual void dump_value() const\n {\n }\n\n virtual node_base* create_new(bool leaf) const\n {\n return new node(leaf);\n }\n\n virtual node_base* clone() const\n {\n return new node(*this);\n }\n };\n\n segment_tree();\n ~segment_tree();\n\n bool is_tree_valid() const { return m_valid_tree; }\n\n void build_tree();\n\n void insert(key_type begin_key, key_type end_key, data_type* pdata);\n\nprivate:\n static node* get_node(const node_base_ptr& base_node)\n { \n return static_cast<node*>(base_node.get());\n }\n\n static void build_leaf_node(const ::std::vector<key_type>& keys, node_base_ptr& left, node_base_ptr& right);\n\nprivate:\n struct segment_data\n {\n key_type begin_key;\n key_type end_key;\n data_type* pdata;\n\n segment_data(key_type _beg, key_type _end, data_type* p) :\n begin_key(_beg), end_key(_end), pdata(p) {}\n };\n\n typedef ::boost::ptr_vector<segment_data> data_array_type;\n data_array_type m_segment_data;\n\n node_base_ptr m_root_node;\n node_base_ptr m_left_leaf;\n node_base_ptr m_right_leaf;\n bool m_valid_tree:1;\n};\n\ntemplate<typename _Key, typename _Data>\nsegment_tree<_Key, _Data>::segment_tree() :\n m_valid_tree(false)\n{\n}\n\ntemplate<typename _Key, typename _Data>\nsegment_tree<_Key, _Data>::~segment_tree()\n{\n \/\/ Go through all leaf nodes, and disconnect their links.\n node_base* cur_node = m_left_leaf.get();\n do\n {\n node_base* next_node = cur_node->right.get();\n disconnect_node(cur_node);\n cur_node = next_node;\n }\n while (cur_node != m_right_leaf.get());\n\n disconnect_node(m_right_leaf.get());\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::build_tree()\n{\n using namespace std;\n\n \/\/ In 1st pass, collect unique end-point values and sort them.\n vector<key_type> keys_uniq;\n keys_uniq.reserve(m_segment_data.size()*2);\n typename data_array_type::const_iterator itr, itr_beg = m_segment_data.begin(), itr_end = m_segment_data.end();\n for (itr = itr_beg; itr != itr_end; ++itr)\n {\n cout << itr->begin_key << \",\" << itr->end_key << \": \" << itr->pdata << endl;\n keys_uniq.push_back(itr->begin_key);\n keys_uniq.push_back(itr->end_key);\n }\n\n \/\/ sort and remove duplicates.\n sort(keys_uniq.begin(), keys_uniq.end());\n keys_uniq.erase(unique(keys_uniq.begin(), keys_uniq.end()), keys_uniq.end());\n\n \/\/ debug output.\n cout << \"unique keys: \";\n copy(keys_uniq.begin(), keys_uniq.end(), ostream_iterator<key_type>(cout, \" \"));\n cout << endl;\n\n \/\/ Create leaf nodes with the unique end-point values.\n build_leaf_node(keys_uniq, m_left_leaf, m_right_leaf);\n\n \/\/ debug output.\n {\n cout << \"forward: \";\n node* p = get_node(m_left_leaf);\n while (p)\n {\n cout << p->value_leaf.key << \" \";\n p = get_node(p->right);\n }\n cout << endl;\n\n cout << \"backward: \";\n p = get_node(m_right_leaf);\n while (p)\n {\n cout << p->value_leaf.key << \" \";\n p = get_node(p->left);\n }\n cout << endl;\n }\n\n \/\/ In 2nd pass, \"insert\" each segment.\n for (itr = itr_beg; itr != itr_end; ++itr)\n {\n key_type key_beg = itr->begin_key;\n key_type key_end = itr->end_key;\n data_type* pdata = itr->pdata;\n\n node* p = get_node(m_left_leaf);\n while (p)\n {\n if (p->value_leaf.key == key_beg)\n {\n leaf_value_type& v = p->value_leaf;\n if (!v.data_chain)\n v.data_chain = new data_chain_type;\n v.data_chain->push_back(pdata);\n }\n else if (p->value_leaf.key == key_end)\n {\n \/\/ Insert data pointer to the previous node _only when_ the\n \/\/ value of the previous node doesn't equal the begin point\n \/\/ value.\n node* pprev = get_node(p->left);\n if (pprev && pprev->value_leaf.key != key_beg)\n {\n leaf_value_type& v = pprev->value_leaf;\n if (!v.data_chain)\n v.data_chain = new data_chain_type;\n v.data_chain->push_back(pdata);\n }\n }\n p = get_node(p->right);\n }\n }\n\n \/\/ debug output\n {\n node* p = get_node(m_left_leaf);\n while (p)\n {\n cout << p->value_leaf.key << \":{ \";\n if (p->value_leaf.data_chain)\n {\n const data_chain_type* pchain = p->value_leaf.data_chain;\n copy(pchain->begin(), pchain->end(), ostream_iterator<data_type*>(cout, \" \"));\n }\n cout << \"}\" << endl;\n p = get_node(p->right);\n }\n }\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::build_leaf_node(const ::std::vector<key_type>& keys, node_base_ptr& left, node_base_ptr& right)\n{\n if (keys.empty() || keys.size() < 2)\n \/\/ We need at least two keys in order to build tree.\n return;\n\n typename ::std::vector<key_type>::const_iterator itr = keys.begin(), itr_end = keys.end();\n\n \/\/ left-most node\n left.reset(new node(true));\n get_node(left)->value_leaf.key = *itr;\n\n \/\/ move on to next.\n left->right.reset(new node(true));\n node_base_ptr prev_node = left;\n node_base_ptr cur_node = left->right;\n cur_node->left = prev_node;\n\n for (++itr; itr != itr_end; ++itr)\n {\n get_node(cur_node)->value_leaf.key = *itr;\n\n \/\/ move on to next\n cur_node->right.reset(new node(true));\n prev_node = cur_node;\n cur_node = cur_node->right;\n cur_node->left = prev_node;\n }\n\n \/\/ Remove the excess node.\n prev_node->right.reset();\n right = prev_node;\n}\n\ntemplate<typename _Key, typename _Data>\nvoid segment_tree<_Key, _Data>::insert(key_type begin_key, key_type end_key, data_type* pdata)\n{\n if (begin_key >= end_key)\n return;\n\n m_segment_data.push_back(new segment_data(begin_key, end_key, pdata));\n}\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2015 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Core module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Core\/Win32\/HardwareInfoImpl.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <windows.h>\n\n#ifdef NAZARA_COMPILER_MSVC\n\t#include <intrin.h>\n#endif\n\n#include <Nazara\/Core\/Debug.hpp>\n\nvoid NzHardwareInfoImpl::Cpuid(nzUInt32 functionId, nzUInt32 subFunctionId, nzUInt32 registers[4])\n{\n#if defined(NAZARA_COMPILER_MSVC)\n\tstatic_assert(sizeof(nzUInt32) == sizeof(int), \"Assertion failed\");\n\n\t\/\/ Visual propose une fonction intrinsèque pour le cpuid\n\t__cpuidex(reinterpret_cast<int*>(registers), static_cast<int>(functionId), static_cast<int>(subFunctionId));\n#elif defined(NAZARA_COMPILER_CLANG) || defined(NAZARA_COMPILER_GCC) || defined(NAZARA_COMPILER_INTEL)\n\t\/\/ Source: http:\/\/stackoverflow.com\/questions\/1666093\/cpuid-implementations-in-c\n\tasm volatile (\"cpuid\" \/\/ Besoin d'être volatile ?\n\t : \"=a\" (registers[0]), \"=b\" (registers[1]), \"=c\" (registers[2]), \"=d\" (registers[3]) \/\/ output\n\t : \"a\" (functionId), \"c\" (subFunctionId)); \/\/ input\n#else\n\tNazaraInternalError(\"Cpuid has been called although it is not supported\");\n#endif\n}\n\nunsigned int NzHardwareInfoImpl::GetProcessorCount()\n{\n\t\/\/ Plus simple (et plus portable) que de passer par le CPUID\n\tSYSTEM_INFO infos;\n\tGetSystemInfo(&infos);\n\n\treturn infos.dwNumberOfProcessors;\n}\n\nbool NzHardwareInfoImpl::IsCpuidSupported()\n{\n#ifdef NAZARA_PLATFORM_x64\n\treturn true; \/\/ Toujours supporté sur un processeur 64 bits\n#else\n\t#if defined(NAZARA_COMPILER_MSVC)\n\tint supported;\n\t__asm\n\t{\n\t\tpushfd\n\t\tpop eax\n\t\tmov ecx, eax\n\t\txor eax, 0x200000\n\t\tpush eax\n\t\tpopfd\n\t\tpushfd\n\t\tpop eax\n\t\txor eax, ecx\n\t\tmov supported, eax\n\t\tpush ecx\n\t\tpopfd\n\t};\n\n\treturn supported != 0;\n\t#elif defined(NAZARA_COMPILER_CLANG) || defined(NAZARA_COMPILER_GCC) || defined(NAZARA_COMPILER_INTEL)\n\tint supported;\n\tasm volatile (\" pushfl\\n\"\n\t \" pop %%eax\\n\"\n\t \" mov %%eax, %%ecx\\n\"\n\t \" xor $0x200000, %%eax\\n\"\n\t \" push %%eax\\n\"\n\t \" popfl\\n\"\n\t \" pushfl\\n\"\n\t \" pop %%eax\\n\"\n\t \" xor %%ecx, %%eax\\n\"\n\t \" mov %%eax, %0\\n\"\n\t \" push %%ecx\\n\"\n\t \" popfl\"\n\t : \"=m\" (supported) \/\/ output\n\t : \/\/ input\n\t : \"eax\", \"ecx\", \"memory\"); \/\/ clobbered register\n\n\treturn supported != 0;\n\t#else\n\treturn false;\n\t#endif\n#endif\n}\n<commit_msg>Core\/HardwareInfo: Improve accuracy under Windows<commit_after>\/\/ Copyright (C) 2015 Jérôme Leclercq\n\/\/ This file is part of the \"Nazara Engine - Core module\"\n\/\/ For conditions of distribution and use, see copyright notice in Config.hpp\n\n#include <Nazara\/Core\/Win32\/HardwareInfoImpl.hpp>\n#include <Nazara\/Core\/Error.hpp>\n#include <windows.h>\n\n#ifdef NAZARA_COMPILER_MSVC\n\t#include <intrin.h>\n#endif\n\n#include <Nazara\/Core\/Debug.hpp>\n\nvoid NzHardwareInfoImpl::Cpuid(nzUInt32 functionId, nzUInt32 subFunctionId, nzUInt32 registers[4])\n{\n#if defined(NAZARA_COMPILER_MSVC)\n\tstatic_assert(sizeof(nzUInt32) == sizeof(int), \"Assertion failed\");\n\n\t\/\/ Visual propose une fonction intrinsèque pour le cpuid\n\t__cpuidex(reinterpret_cast<int*>(registers), static_cast<int>(functionId), static_cast<int>(subFunctionId));\n#elif defined(NAZARA_COMPILER_CLANG) || defined(NAZARA_COMPILER_GCC) || defined(NAZARA_COMPILER_INTEL)\n\t\/\/ Source: http:\/\/stackoverflow.com\/questions\/1666093\/cpuid-implementations-in-c\n\tasm volatile (\"cpuid\" \/\/ Besoin d'être volatile ?\n\t : \"=a\" (registers[0]), \"=b\" (registers[1]), \"=c\" (registers[2]), \"=d\" (registers[3]) \/\/ output\n\t : \"a\" (functionId), \"c\" (subFunctionId)); \/\/ input\n#else\n\tNazaraInternalError(\"Cpuid has been called although it is not supported\");\n#endif\n}\n\nunsigned int NzHardwareInfoImpl::GetProcessorCount()\n{\n\t\/\/ Plus simple (et plus portable) que de passer par le CPUID\n\tSYSTEM_INFO infos;\n\tGetNativeSystemInfo(&infos);\n\n\treturn infos.dwNumberOfProcessors;\n}\n\nbool NzHardwareInfoImpl::IsCpuidSupported()\n{\n#ifdef NAZARA_PLATFORM_x64\n\treturn true; \/\/ Toujours supporté sur un processeur 64 bits\n#else\n\t#if defined(NAZARA_COMPILER_MSVC)\n\tint supported;\n\t__asm\n\t{\n\t\tpushfd\n\t\tpop eax\n\t\tmov ecx, eax\n\t\txor eax, 0x200000\n\t\tpush eax\n\t\tpopfd\n\t\tpushfd\n\t\tpop eax\n\t\txor eax, ecx\n\t\tmov supported, eax\n\t\tpush ecx\n\t\tpopfd\n\t};\n\n\treturn supported != 0;\n\t#elif defined(NAZARA_COMPILER_CLANG) || defined(NAZARA_COMPILER_GCC) || defined(NAZARA_COMPILER_INTEL)\n\tint supported;\n\tasm volatile (\" pushfl\\n\"\n\t \" pop %%eax\\n\"\n\t \" mov %%eax, %%ecx\\n\"\n\t \" xor $0x200000, %%eax\\n\"\n\t \" push %%eax\\n\"\n\t \" popfl\\n\"\n\t \" pushfl\\n\"\n\t \" pop %%eax\\n\"\n\t \" xor %%ecx, %%eax\\n\"\n\t \" mov %%eax, %0\\n\"\n\t \" push %%ecx\\n\"\n\t \" popfl\"\n\t : \"=m\" (supported) \/\/ output\n\t : \/\/ input\n\t : \"eax\", \"ecx\", \"memory\"); \/\/ clobbered register\n\n\treturn supported != 0;\n\t#else\n\treturn false;\n\t#endif\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#ifndef CONTEXT_H\n#define CONTEXT_H\n\n#include <string>\n#include <map>\n#include <vector>\n\n#include \"Types.hpp\"\n\n#include \"AssemblyFileWriter.hpp\"\n\nnamespace eddic {\n\nenum PositionType {\n STACK, \n GLOBAL\n};\n\nclass Position {\n private:\n const PositionType m_type;\n const int m_offset;\n const std::string m_name;\n\n public:\n Position() : m_type(STACK), m_offset(0), m_name(\"\") {} \/\/TODO Delete that later, just here for compilation\n Position(PositionType type, int offset) : m_type(type), m_offset(offset), m_name(\"\") {}\n Position(PositionType type, std::string name) : m_type(type), m_offset(0), m_name(name) {}\n\n bool isStack(){\n return m_type == STACK;\n }\n\n bool isGlobal(){\n return m_type == GLOBAL;\n }\n\n int offset(){\n return m_offset;\n }\n\n std::string name(){\n return m_name;\n }\n};\n\nclass Variable {\n private:\n const std::string m_name;\n const Type m_type;\n const int m_index;\n Position position;\n\n public:\n Variable(const std::string& name, Type type, int index) : m_name(name), m_type(type), m_index(index) {}\n std::string name() const {\n return m_name;\n }\n int index() const {\n return m_index;\n }\n Type type() const {\n return m_type;\n }\n};\n\nclass Context {\n private:\n static std::vector<Context*> contexts;\n static unsigned int currentVariable;\n\n std::map<std::string, Variable*> variables;\n Context* m_parent;\n\n public:\n Context() : m_parent(NULL) {\n contexts.push_back(this);\n }\n Context(Context* parent) : m_parent(parent) {\n contexts.push_back(this);\n }\n ~Context();\n\n bool exists(const std::string& variable) const;\n unsigned int index(const std::string& variable) const;\n Variable* create(const std::string& variable, Type type);\n Variable* find(const std::string& variable);\n void write(AssemblyFileWriter& writer);\n\n Context* parent() {\n return m_parent;\n }\n\n static void writeAll(AssemblyFileWriter& writer);\n static void cleanup();\n};\n\nclass FunctionContext : public Context {\n\n};\n\n\nclass GlobalContext : public Context {\n \n};\n\nclass BlockContext : public Context {\n \n};\n\n} \/\/end of eddic\n\n#endif\n<commit_msg>Define the interface of the Context<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#ifndef CONTEXT_H\n#define CONTEXT_H\n\n#include <string>\n#include <map>\n#include <vector>\n\n#include \"Types.hpp\"\n\n#include \"AssemblyFileWriter.hpp\"\n\nnamespace eddic {\n\nenum PositionType {\n STACK, \n GLOBAL\n};\n\nclass Position {\n private:\n const PositionType m_type;\n const int m_offset;\n const std::string m_name;\n\n public:\n Position() : m_type(STACK), m_offset(0), m_name(\"\") {} \/\/TODO Delete that later, just here for compilation\n Position(PositionType type, int offset) : m_type(type), m_offset(offset), m_name(\"\") {}\n Position(PositionType type, std::string name) : m_type(type), m_offset(0), m_name(name) {}\n\n bool isStack(){\n return m_type == STACK;\n }\n\n bool isGlobal(){\n return m_type == GLOBAL;\n }\n\n int offset(){\n return m_offset;\n }\n\n std::string name(){\n return m_name;\n }\n};\n\nclass Variable {\n private:\n const std::string m_name;\n const Type m_type;\n const int m_index;\n Position position;\n\n public:\n Variable(const std::string& name, Type type, int index) : m_name(name), m_type(type), m_index(index) {}\n std::string name() const {\n return m_name;\n }\n int index() const {\n return m_index;\n }\n Type type() const {\n return m_type;\n }\n};\n\nclass Context {\n private:\n static std::vector<Context*> contexts;\n static unsigned int currentVariable;\n\n std::map<std::string, Variable*> variables;\n Context* m_parent;\n\n public:\n Context() : m_parent(NULL) {\n contexts.push_back(this);\n }\n Context(Context* parent) : m_parent(parent) {\n contexts.push_back(this);\n }\n ~Context();\n\n bool exists(const std::string& variable) const;\n unsigned int index(const std::string& variable) const;\n Variable* create(const std::string& variable, Type type);\n Variable* find(const std::string& variable);\n void write(AssemblyFileWriter& writer);\n\n Context* parent() {\n return m_parent;\n }\n\n static void writeAll(AssemblyFileWriter& writer);\n static void cleanup();\n};\n\n\/\/TODO Rename to Context when finished the implementation\nclass TempContext {\n private:\n static std::vector<TempContext*> contexts;\n\n std::map<std::string, Variable*> variables;\n TempContext* m_parent;\n\n public:\n virtual void addVariable(const std::string a, Type type);\n virtual bool exists(const std::string& a) const;\n virtual Variable* getVariable(std::string& variable) const;\n\n TempContext* parent() const {\n return m_parent;\n }\n};\n\nclass FunctionContext : public TempContext {\n\n};\n\nclass GlobalContext : public TempContext {\n \n};\n\nclass BlockContext : public TempContext {\n \n};\n\n} \/\/end of eddic\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ GPTimer.h\n\/\/ Bedrock\n\/\/\n\/\/ Created by Eric Yanush on 2016-01-17.\n\/\/ Copyright © 2016 EricYanush. All rights reserved.\n\/\/\n\n#ifndef GPTimer_h\n#define GPTimer_h\n\n#include \"types.hpp\"\n\nnamespace Bedrock {\n template <typename width_t>\n class GPTimer {\n public:\n \n void setPrescaler(uint16_t prescaler) {\n PSC = prescaler;\n }\n\n uint16_t getPrescaler() {\n return (uint16_t)PSC;\n }\n\n void setReload(width_t reloadVal) {\n ARR = reloadVal;\n }\n\n width_t getReload() {\n return ARR;\n }\n \n width_t getCount() {\n return (width_t)CNT;\n }\n \n void enable() {\n CR1 |= 0x1;\n }\n \n void disable() {\n CR1 &= ~(0x1);\n }\n\n bool isEnabled() {\n return (CR1 & ENABLE) == ENABLE;\n }\n\n void enableUpdateInterrupt() {\n DIER |= (ENABLE << 0);\n }\n\n void disableUpdateInterrupt() {\n DIER &= ~(ENABLE << 0);\n }\n\n bool isUpdateInterruptEnabled() {\n return (DIER & ENABLE) == ENABLE;\n }\n\n bool isUpdateInterruptPending() {\n return (SR & 0x1) == 0x1;\n }\n\n void ackUpdate() {\n SR &= ~(1 << 0);\n }\n \n void ackTrigger() {\n SR &= ~(1 << 6);\n }\n \n dev_reg32_t CR1;\n dev_reg32_t CR2;\n dev_reg32_t SMCR;\n dev_reg32_t DIER;\n dev_reg32_t SR;\n dev_reg32_t EGR;\n dev_reg32_t CCMR[2];\n dev_reg32_t CCER;\n dev_reg32_t CNT;\n dev_reg32_t PSC;\n dev_reg32_t ARR;\n uint32_t _pad1;\n dev_reg32_t CCR[4];\n uint32_t _pad2;\n dev_reg32_t DCR;\n dev_reg32_t DMAR;\n };\n \n template <typename width_t>\n using GPTimerProvider = GPTimer<width_t>& (*)(void);\n}\n\n#endif \/* GPTimer_h *\/\n<commit_msg>Add input capture handling methods to GPTimer class<commit_after>\/\/\n\/\/ GPTimer.h\n\/\/ Bedrock\n\/\/\n\/\/ Created by Eric Yanush on 2016-01-17.\n\/\/ Copyright © 2016 EricYanush. All rights reserved.\n\/\/\n\n#ifndef GPTimer_h\n#define GPTimer_h\n\n#include \"types.hpp\"\n\nnamespace Bedrock {\n template <typename width_t>\n class GPTimer {\n public:\n \n void setPrescaler(uint16_t prescaler) {\n PSC = prescaler;\n }\n\n uint16_t getPrescaler() {\n return (uint16_t)PSC;\n }\n\n void setReload(width_t reloadVal) {\n ARR = reloadVal;\n }\n\n width_t getReload() {\n return ARR;\n }\n \n width_t getCount() {\n return (width_t)CNT;\n }\n \n void enable() {\n CR1 |= 0x1;\n }\n \n void disable() {\n CR1 &= ~(0x1);\n }\n\n bool isEnabled() {\n return (CR1 & ENABLE) == ENABLE;\n }\n\n void enableUpdateInterrupt() {\n DIER |= (ENABLE << 0);\n }\n\n void disableUpdateInterrupt() {\n DIER &= ~(ENABLE << 0);\n }\n\n bool isUpdateInterruptEnabled() {\n return (DIER & ENABLE) == ENABLE;\n }\n\n bool isUpdateInterruptPending() {\n return (SR & 0x1) == 0x1;\n }\n\n void ackUpdate() {\n SR &= ~(1 << 0);\n }\n \n void ackTrigger() {\n SR &= ~(1 << 6);\n }\n \n enum class CapCompSelection : uint8_t\n {\n OUTPUT = 0b00,\n IN_DEF = 0b01,\n IN_ALT = 0b10,\n IN_TRC = 0b11\n };\n \n void setCapCompSelection(uint8_t channel, CapCompSelection sel)\n {\n uint8_t regIndex = channel\/3;\n uint8_t bitOffset = ((channel - 1) % 2) * 8;\n \n CCMR[regIndex] &= ~(0b11 << bitOffset);\n CCMR[regIndex] |= static_cast<uint8_t>(sel) << bitOffset;\n }\n \n void enableCapCompChannel(uint8_t channel)\n {\n uint8_t bitOffset = (channel - 1) * 4;\n CCER |= (ENABLE << bitOffset);\n }\n \n void disableCapCompChannel(uint8_t channel)\n {\n uint8_t bitOffset = (channel - 1) * 4;\n CCER &= ~(ENABLE << bitOffset);\n }\n \n width_t readInputCaptureChannel(uint8_t channel)\n {\n return CCR[channel];\n }\n \n void enableCaptureEvent(uint8_t channel)\n {\n EGR |= ENABLE << channel;\n }\n \n void disableCaptureEvent(uint8_t channel)\n {\n EGR &= ~(ENABLE << channel);\n }\n \n bool captureCompleteForChannel(uint8_t channel)\n {\n return (SR >> channel) & 0x1;\n }\n \n void ackCaptureForChannel(uint8_t channel)\n {\n SR &= ~(0x1 << channel);\n }\n \n dev_reg32_t CR1;\n dev_reg32_t CR2;\n dev_reg32_t SMCR;\n dev_reg32_t DIER;\n dev_reg32_t SR;\n dev_reg32_t EGR;\n dev_reg32_t CCMR[2];\n dev_reg32_t CCER;\n dev_reg32_t CNT;\n dev_reg32_t PSC;\n dev_reg32_t ARR;\n uint32_t _pad1;\n dev_reg32_t CCR[4];\n uint32_t _pad2;\n dev_reg32_t DCR;\n dev_reg32_t DMAR;\n };\n \n template <typename width_t>\n using GPTimerProvider = GPTimer<width_t>& (*)(void);\n}\n\n#endif \/* GPTimer_h *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>vea_unittest: Remove vector reserve<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n\n#include <stdio.h>\n#include <ctype.h>\n#include <f32file.h>\n#include <utf.h>\n\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/stringUtils.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/fscapi.h\"\n#include \"base\/SymbianLog.h\"\n#include \"spdm\/spdmutils.h\"\n#include \"spdm\/constants.h\"\n#include \"spdm\/ManagementNode.h\"\n#include \"spdm\/DeviceManagementNode.h\"\n#include \"base\/globalsdef.h\"\n\nUSE_NAMESPACE\n\n#define CONFIG_DIR \".config\"\n#define SYNC4J_DIR \".sync4j\"\n\nStringBuffer DeviceManagementNode::configPath; \nStringBuffer DeviceManagementNode::configFile = \"config.ini\";\n\nStringBuffer DeviceManagementNode::server(\"DefaultServer\");\nStringBuffer DeviceManagementNode::profileName(\"DefaultProfile\");\nTSmlCreatorId DeviceManagementNode::uid = -1;\nStringBuffer DeviceManagementNode::cardURI(\"card\");\nStringBuffer DeviceManagementNode::calURI(\"cal\");\nStringBuffer DeviceManagementNode::imapServer(\"\");\nStringBuffer DeviceManagementNode::smtpServer(\"\");\nunsigned int DeviceManagementNode::imapPort = 143;\nunsigned int DeviceManagementNode::smtpPort = 25;\n\nDeviceManagementNode::DeviceManagementNode(const char* parent,\n const char *leafName)\n : ManagementNode(parent, leafName),\n lines(new ArrayList),\n modified(false)\n{\n initCurrentDir();\n update(true);\n}\n\nDeviceManagementNode::DeviceManagementNode(const char *node)\n : ManagementNode(node),\n lines(new ArrayList),\n modified(false)\n{\n initCurrentDir();\n update(true);\n}\n\nDeviceManagementNode::DeviceManagementNode(const DeviceManagementNode &other)\n : ManagementNode(other) {\n\n lines = other.lines->clone();\n currentDir = other.currentDir;\n modified = other.modified;\n}\n\nDeviceManagementNode::~DeviceManagementNode() {\n if (modified) {\n update(false);\n }\n delete lines;\n}\n\n\nvoid DeviceManagementNode::update(bool read) {\n if (!read && !modified) {\n \/\/ no work to be done\n return;\n }\n\n StringBuffer fileName(currentDir);\n concatDirs(fileName, configFile.c_str());\n const char* fname = fileName.c_str();\n FILE* file = fopen(fname, \"r\");\n\n if (file) {\n \/\/ Open a temp file in writing mode if we must update the config\n if (!read) {\n fclose(file);\n fileName.append(\".tmp\");\n file = fopen(fileName, \"w\");\n }\n\n if (read) {\n \/\/ Note: don't create local buffers too big, the Symbian stack size is limited!\n char buffer[128];\n\n lines->clear();\n while (fgets(buffer, sizeof(buffer), file)) {\n char *eol = strchr(buffer, '\\r');\n if (!eol) {\n eol = strchr(buffer, '\\n');\n }\n if (eol) {\n *eol = 0;\n }\n line newline(buffer);\n lines->add(newline);\n }\n fclose(file);\n } \n else {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n fprintf(file, \"%s\\n\", curr->getLine());\n\n i++;\n }\n fflush(file);\n if (!ferror(file)) {\n StringBuffer tmpConfig = configFile;\n tmpConfig += \".tmp\";\n\n fclose(file); \/\/ Both files must be closed for the rename.\n renameFileInCwd( tmpConfig.c_str(), configFile.c_str());\n }\n else {\n fclose(file);\n }\n }\n }\n}\n\nint DeviceManagementNode::strnicmp( const char *a, const char *b, int len ) {\n while (--len >= 0) {\n if (toupper(*a) != toupper(*b)) {\n return 1;\n }\n a++;\n b++;\n }\n return 0;\n}\n\n\n\/*\n * Returns the value of the given property\n * the value is returned as a new char array and must be fred by the user\n *\n * @param property - the property name\n *\/\nchar* DeviceManagementNode::readPropertyValue(const char* property) {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n\n const char *value = curr->getLine();\n while (*value && isspace(*value)) {\n value++;\n }\n if (!strnicmp(value, property, strlen(property))) {\n value = strchr(value, '=');\n if (value) {\n value++;\n while (*value && isspace(*value)) {\n value++;\n }\n char *res = stringdup(value); \/\/ FOUND :)\n\n \/\/ remove trailing white space: usually it is\n \/\/ added accidentally by users\n char *tmp = res + strlen(res) - 1;\n while (tmp > res) {\n if (!isspace(*tmp)) {\n break;\n }\n tmp--;\n }\n tmp[1] = 0;\n\n return res;\n }\n }\n i++;\n }\n \/\/ Not found, return an empty string\n return stringdup(\"\");\n}\n\n#include \"base\/util\/symbianUtils.h\"\n\nint DeviceManagementNode::getChildrenMaxCount() {\n int count = 0;\n\n RFs fileSession;\n RFile file;\n int cleanupStackSize = 0;\n\n StringBuffer fileSpecSb(currentDir);\n concatDirs(fileSpecSb, \"*.*\");\n\n \/\/ TODO use utility function for string conversion\n TBuf8<DIM_MANAGEMENT_PATH> buf8((const unsigned char*)fileSpecSb.c_str());\n HBufC* fileSpec = CnvUtfConverter::ConvertToUnicodeFromUtf8L(buf8);\n ++cleanupStackSize;\n CleanupStack::PushL(fileSpec);\n\n \/\/\n \/\/ Connect to the file server\n \/\/\n fileSession.Connect();\n ++cleanupStackSize;\n CleanupClosePushL(fileSession);\n\n StringBuffer buf;\n\n \/\/\n \/\/ Get the directories list, sorted by name\n \/\/ (Leave if an error occurs)\n \/\/\n CDir* dirList;\n TRAPD(err, fileSession.GetDir(*fileSpec, KEntryAttDir|KEntryAttMatchExclusive,\n ESortByName, dirList));\n if (err != KErrNone || dirList == NULL) {\n goto finally;\n }\n ++cleanupStackSize;\n CleanupStack::PushL(dirList);\n\n count = dirList->Count();\n\nfinally:\n \/\/\n \/\/ Close the connection with the file server\n \/\/ and destroy dirList\n \/\/\n fileSession.Close();\n CleanupStack::PopAndDestroy(cleanupStackSize);\n return count;\n}\n\n\n\nchar **DeviceManagementNode::getChildrenNames() {\n char **childrenName = 0;\n int cleanupStackSize = 0;\n RFs fileSession;\n RFile file;\n\n StringBuffer fileSpecSb(currentDir);\n concatDirs(fileSpecSb, \"*.*\");\n\n \/\/ TODO use utility function for string conversion\n TBuf8<DIM_MANAGEMENT_PATH> buf8((const unsigned char*)fileSpecSb.c_str());\n HBufC* fileSpec = CnvUtfConverter::ConvertToUnicodeFromUtf8L(buf8);\n ++cleanupStackSize;\n CleanupStack::PushL(fileSpec);\n\n \/\/\n \/\/ Connect to the file server\n \/\/\n fileSession.Connect();\n ++cleanupStackSize;\n CleanupClosePushL(fileSession);\n\n \/\/\n \/\/ Get the directories list, sorted by name\n \/\/ (Leave if an error occurs)\n \/\/\n CDir* dirList;\n TRAPD(err, fileSession.GetDir(*fileSpec, KEntryAttDir|KEntryAttMatchExclusive,\n ESortByName, dirList));\n if (err != KErrNone || dirList == NULL) {\n goto finally;\n }\n ++cleanupStackSize;\n CleanupStack::PushL(dirList);\n\n \/\/\n \/\/ Process each entry\n \/\/\n childrenName = new char*[dirList->Count()];\n TInt i;\n for (i=0;i<dirList->Count();i++)\n {\n TBuf<DIM_MANAGEMENT_PATH> fileName = (*dirList)[i].iName;\n\n#if 0\n childrenName[i] = bufToNewChar(buf8);\n#else\n \/\/ TODO use string utils\n HBufC8* buf8 = CnvUtfConverter::ConvertFromUnicodeToUtf8L(fileName);\n childrenName[i] = stringdup((const char*)buf8->Ptr(), buf8->Length());\n *(childrenName[i] + buf8->Length()) = (char)0;\n delete buf8;\n#endif\n }\n fileSession.Close();\n\nfinally:\n \/\/\n \/\/ Close the connection with the file server\n \/\/ and destroy dirList\n \/\/\n CleanupStack::PopAndDestroy(cleanupStackSize);\n return childrenName;\n}\n\n\/*\n * Sets a property value.\n *\n * @param property - the property name\n * @param value - the property value (zero terminated string)\n *\/\nvoid DeviceManagementNode::setPropertyValue(const char* property, const char* newvalue) {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n\n const char *start = curr->getLine();\n const char *value = start;\n\n while (*value && isspace(*value)) {\n value++;\n }\n if (!strnicmp(value, property, strlen(property))) {\n value = strchr(value, '=');\n if (value) {\n value++;\n while (*value && isspace(*value)) {\n value++;\n }\n if (strcmp(value, newvalue)) {\n \/\/ preserve indention and property name from original config\n char *newstr = new char[(value - start) + strlen(newvalue) + 1];\n strncpy(newstr, start, value - start);\n strcpy(newstr + (value - start), newvalue);\n curr->setLine(newstr);\n delete [] newstr;\n modified = true;\n }\n goto finally;\n }\n }\n i++;\n }\n\n {\n \/\/ This is a new property\n char *newstr = new char[strlen(property) + 3 + strlen(newvalue) + 1];\n sprintf(newstr, \"%s = %s\", property, newvalue);\n line newline(newstr);\n lines->add(newline);\n delete [] newstr;\n modified = true;\n }\n\nfinally:\n i = 0;\n}\n\nvoid DeviceManagementNode::setServerURI(const StringBuffer& server) {\n DeviceManagementNode::server = server;\n}\n\nconst StringBuffer& DeviceManagementNode::getServerURI() {\n return server;\n}\n\nvoid DeviceManagementNode::setProfileName(const StringBuffer& name) {\n DeviceManagementNode::profileName = name;\n}\n\nconst StringBuffer& DeviceManagementNode::getProfileName() {\n return profileName;\n}\n\nvoid DeviceManagementNode::setUID(TSmlCreatorId uid) {\n DeviceManagementNode::uid = uid;\n}\n\nTSmlCreatorId DeviceManagementNode::getUID() {\n return uid;\n}\n\nvoid DeviceManagementNode::setCardURI(const StringBuffer& cardURI) {\n DeviceManagementNode::cardURI = cardURI;\n}\n\nconst StringBuffer& DeviceManagementNode::getCardURI() {\n return cardURI;\n}\n\nvoid DeviceManagementNode::setCalURI(const StringBuffer& calURI) {\n DeviceManagementNode::calURI = calURI;\n}\n\nconst StringBuffer& DeviceManagementNode::getCalURI() {\n return calURI;\n}\n\nvoid DeviceManagementNode::setImapServer(const StringBuffer& imapServer) {\n DeviceManagementNode::imapServer = imapServer;\n}\n\nconst StringBuffer& DeviceManagementNode::getImapServer() {\n return imapServer;\n}\n\nvoid DeviceManagementNode::setImapPort(unsigned int imapPort) {\n DeviceManagementNode::imapPort = imapPort;\n}\n\nunsigned int DeviceManagementNode::getImapPort() {\n return imapPort;\n}\n\nvoid DeviceManagementNode::setSmtpPort(unsigned int smtpPort) {\n DeviceManagementNode::smtpPort = smtpPort;\n}\n\nunsigned int DeviceManagementNode::getSmtpPort() {\n return smtpPort;\n}\n\nvoid DeviceManagementNode::setSmtpServer(const StringBuffer& smtpServer) {\n DeviceManagementNode::smtpServer = smtpServer;\n}\n\nconst StringBuffer& DeviceManagementNode::getSmtpServer() {\n return smtpServer;\n}\n\n\nArrayElement* DeviceManagementNode::clone()\n{\n DeviceManagementNode* ret = new DeviceManagementNode(context, name);\n\n int n = children.size();\n\n for (int i = 0; i<n; ++i) {\n ret->addChild(*((ManagementNode*)children[i]));\n }\n\n return ret;\n}\n\nvoid DeviceManagementNode::concatDirs(StringBuffer& src1, const char* src2) {\n \n \/\/ If the src path terminates with \\\\ then there is no\n \/\/ need to add it again (this would be an illegal symbian path)\n \/\/ Unfortunately we cannot use StringBuffer directly for this check\n \/\/ there is something weird with \\\\ in StringBuffer (at least on symbian)\n const char* chars = src1.c_str();\n if (chars[strlen(chars)-1] != '\\\\') {\n src1.append(\"\\\\\");\n }\n src1.append(src2);\n}\n\nvoid DeviceManagementNode::initCurrentDir() {\n\n if (configPath.empty()) {\n currentDir = \".\\\\\";\n } else {\n currentDir = configPath;\n }\n if (context) {\n StringBuffer translatedContext = contextToPath(context);\n const char* tc = translatedContext.c_str();\n concatDirs(currentDir, tc);\n }\n if (name) {\n concatDirs(currentDir, name);\n }\n}\n\nStringBuffer DeviceManagementNode::contextToPath(const char* cont) {\n \/\/ Contextes are defined as: (string\/)* and on Symbian\n \/\/ we map them to file. But Symbian uses backslashes as\n \/\/ directory separator.\n StringBuffer sb(cont);\n sb.replaceAll(\"\/\", \"\\\\\", 0);\n return sb;\n}\n\nint DeviceManagementNode::renameFileInCwd(const char* src, const char* dst) {\n\n RFs fileSession;\n RFile file;\n\n StringBuffer srcSb(currentDir);\n concatDirs(srcSb, src);\n StringBuffer dstSb(currentDir);\n concatDirs(dstSb, dst);\n\n RBuf srcDes, dstDes;\n srcDes.Assign(stringBufferToNewBuf(srcSb));\n dstDes.Assign(stringBufferToNewBuf(dstSb));\n\n \/\/ Connect to the file server\n fileSession.Connect();\n CleanupClosePushL(fileSession);\n\n \/\/ Replace 'config.ini' file with 'config.ini.tmp'\n TInt err = fileSession.Replace(srcDes, dstDes);\n\n CleanupStack::PopAndDestroy(&fileSession);\n\n if (err == KErrNone) {\n return 0;\n }\n else {\n LOG.error(\"Error (code %d) replacing file '%s'\", err, dstSb.c_str());\n if (err == KErrAccessDenied) {\n LOG.error(\"Access denied\");\n }\n return -1;\n }\n}\n\n\n<commit_msg>Just added a log message<commit_after>\/*\n * Funambol is a mobile platform developed by Funambol, Inc. \n * Copyright (C) 2003 - 2007 Funambol, Inc.\n * \n * This program is free software; you can redistribute it and\/or modify it under\n * the terms of the GNU Affero General Public License version 3 as published by\n * the Free Software Foundation with the addition of the following permission \n * added to Section 15 as permitted in Section 7(a): FOR ANY PART OF THE COVERED\n * WORK IN WHICH THE COPYRIGHT IS OWNED BY FUNAMBOL, FUNAMBOL DISCLAIMS THE \n * WARRANTY OF NON INFRINGEMENT OF THIRD PARTY RIGHTS.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more\n * details.\n * \n * You should have received a copy of the GNU Affero General Public License \n * along with this program; if not, see http:\/\/www.gnu.org\/licenses or write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA 02110-1301 USA.\n * \n * You can contact Funambol, Inc. headquarters at 643 Bair Island Road, Suite \n * 305, Redwood City, CA 94063, USA, or at email address info@funambol.com.\n * \n * The interactive user interfaces in modified source and object code versions\n * of this program must display Appropriate Legal Notices, as required under\n * Section 5 of the GNU Affero General Public License version 3.\n * \n * In accordance with Section 7(b) of the GNU Affero General Public License\n * version 3, these Appropriate Legal Notices must retain the display of the\n * \"Powered by Funambol\" logo. If the display of the logo is not reasonably \n * feasible for technical reasons, the Appropriate Legal Notices must display\n * the words \"Powered by Funambol\".\n *\/\n\n\n#include <stdio.h>\n#include <ctype.h>\n#include <f32file.h>\n#include <utf.h>\n\n#include \"base\/util\/utils.h\"\n#include \"base\/util\/stringUtils.h\"\n#include \"base\/util\/StringBuffer.h\"\n#include \"base\/fscapi.h\"\n#include \"base\/SymbianLog.h\"\n#include \"spdm\/spdmutils.h\"\n#include \"spdm\/constants.h\"\n#include \"spdm\/ManagementNode.h\"\n#include \"spdm\/DeviceManagementNode.h\"\n#include \"base\/globalsdef.h\"\n\nUSE_NAMESPACE\n\n#define CONFIG_DIR \".config\"\n#define SYNC4J_DIR \".sync4j\"\n\nStringBuffer DeviceManagementNode::configPath; \nStringBuffer DeviceManagementNode::configFile = \"config.ini\";\n\nStringBuffer DeviceManagementNode::server(\"DefaultServer\");\nStringBuffer DeviceManagementNode::profileName(\"DefaultProfile\");\nTSmlCreatorId DeviceManagementNode::uid = -1;\nStringBuffer DeviceManagementNode::cardURI(\"card\");\nStringBuffer DeviceManagementNode::calURI(\"cal\");\nStringBuffer DeviceManagementNode::imapServer(\"\");\nStringBuffer DeviceManagementNode::smtpServer(\"\");\nunsigned int DeviceManagementNode::imapPort = 143;\nunsigned int DeviceManagementNode::smtpPort = 25;\n\nDeviceManagementNode::DeviceManagementNode(const char* parent,\n const char *leafName)\n : ManagementNode(parent, leafName),\n lines(new ArrayList),\n modified(false)\n{\n initCurrentDir();\n update(true);\n}\n\nDeviceManagementNode::DeviceManagementNode(const char *node)\n : ManagementNode(node),\n lines(new ArrayList),\n modified(false)\n{\n initCurrentDir();\n update(true);\n}\n\nDeviceManagementNode::DeviceManagementNode(const DeviceManagementNode &other)\n : ManagementNode(other) {\n\n lines = other.lines->clone();\n currentDir = other.currentDir;\n modified = other.modified;\n}\n\nDeviceManagementNode::~DeviceManagementNode() {\n if (modified) {\n update(false);\n }\n delete lines;\n}\n\n\nvoid DeviceManagementNode::update(bool read) {\n if (!read && !modified) {\n \/\/ no work to be done\n return;\n }\n\n StringBuffer fileName(currentDir);\n concatDirs(fileName, configFile.c_str());\n const char* fname = fileName.c_str();\n FILE* file = fopen(fname, \"r\");\n\n if (file) {\n \/\/ Open a temp file in writing mode if we must update the config\n if (!read) {\n fclose(file);\n fileName.append(\".tmp\");\n file = fopen(fileName, \"w\");\n }\n\n if (read) {\n \/\/ Note: don't create local buffers too big, the Symbian stack size is limited!\n char buffer[128];\n\n lines->clear();\n while (fgets(buffer, sizeof(buffer), file)) {\n char *eol = strchr(buffer, '\\r');\n if (!eol) {\n eol = strchr(buffer, '\\n');\n }\n if (eol) {\n *eol = 0;\n }\n line newline(buffer);\n lines->add(newline);\n }\n fclose(file);\n } \n else {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n fprintf(file, \"%s\\n\", curr->getLine());\n\n i++;\n }\n fflush(file);\n if (!ferror(file)) {\n StringBuffer tmpConfig = configFile;\n tmpConfig += \".tmp\";\n\n fclose(file); \/\/ Both files must be closed for the rename.\n renameFileInCwd( tmpConfig.c_str(), configFile.c_str());\n }\n else {\n fclose(file);\n }\n }\n }\n}\n\nint DeviceManagementNode::strnicmp( const char *a, const char *b, int len ) {\n while (--len >= 0) {\n if (toupper(*a) != toupper(*b)) {\n return 1;\n }\n a++;\n b++;\n }\n return 0;\n}\n\n\n\/*\n * Returns the value of the given property\n * the value is returned as a new char array and must be fred by the user\n *\n * @param property - the property name\n *\/\nchar* DeviceManagementNode::readPropertyValue(const char* property) {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n\n const char *value = curr->getLine();\n while (*value && isspace(*value)) {\n value++;\n }\n if (!strnicmp(value, property, strlen(property))) {\n value = strchr(value, '=');\n if (value) {\n value++;\n while (*value && isspace(*value)) {\n value++;\n }\n char *res = stringdup(value); \/\/ FOUND :)\n\n \/\/ remove trailing white space: usually it is\n \/\/ added accidentally by users\n char *tmp = res + strlen(res) - 1;\n while (tmp > res) {\n if (!isspace(*tmp)) {\n break;\n }\n tmp--;\n }\n tmp[1] = 0;\n\n return res;\n }\n }\n i++;\n }\n \/\/ Not found, return an empty string\n return stringdup(\"\");\n}\n\n#include \"base\/util\/symbianUtils.h\"\n\nint DeviceManagementNode::getChildrenMaxCount() {\n int count = 0;\n\n RFs fileSession;\n RFile file;\n int cleanupStackSize = 0;\n\n StringBuffer fileSpecSb(currentDir);\n concatDirs(fileSpecSb, \"*.*\");\n\n \/\/ TODO use utility function for string conversion\n TBuf8<DIM_MANAGEMENT_PATH> buf8((const unsigned char*)fileSpecSb.c_str());\n HBufC* fileSpec = CnvUtfConverter::ConvertToUnicodeFromUtf8L(buf8);\n ++cleanupStackSize;\n CleanupStack::PushL(fileSpec);\n\n \/\/\n \/\/ Connect to the file server\n \/\/\n fileSession.Connect();\n ++cleanupStackSize;\n CleanupClosePushL(fileSession);\n\n StringBuffer buf;\n\n \/\/\n \/\/ Get the directories list, sorted by name\n \/\/ (Leave if an error occurs)\n \/\/\n CDir* dirList;\n TRAPD(err, fileSession.GetDir(*fileSpec, KEntryAttDir|KEntryAttMatchExclusive,\n ESortByName, dirList));\n if (err != KErrNone || dirList == NULL) {\n goto finally;\n }\n ++cleanupStackSize;\n CleanupStack::PushL(dirList);\n\n count = dirList->Count();\n\nfinally:\n \/\/\n \/\/ Close the connection with the file server\n \/\/ and destroy dirList\n \/\/\n fileSession.Close();\n CleanupStack::PopAndDestroy(cleanupStackSize);\n return count;\n}\n\n\n\nchar **DeviceManagementNode::getChildrenNames() {\n char **childrenName = 0;\n int cleanupStackSize = 0;\n RFs fileSession;\n RFile file;\n\n StringBuffer fileSpecSb(currentDir);\n concatDirs(fileSpecSb, \"*.*\");\n\n \/\/ TODO use utility function for string conversion\n TBuf8<DIM_MANAGEMENT_PATH> buf8((const unsigned char*)fileSpecSb.c_str());\n HBufC* fileSpec = CnvUtfConverter::ConvertToUnicodeFromUtf8L(buf8);\n ++cleanupStackSize;\n CleanupStack::PushL(fileSpec);\n\n \/\/\n \/\/ Connect to the file server\n \/\/\n fileSession.Connect();\n ++cleanupStackSize;\n CleanupClosePushL(fileSession);\n\n \/\/\n \/\/ Get the directories list, sorted by name\n \/\/ (Leave if an error occurs)\n \/\/\n CDir* dirList;\n TRAPD(err, fileSession.GetDir(*fileSpec, KEntryAttDir|KEntryAttMatchExclusive,\n ESortByName, dirList));\n if (err != KErrNone || dirList == NULL) {\n goto finally;\n }\n ++cleanupStackSize;\n CleanupStack::PushL(dirList);\n\n \/\/\n \/\/ Process each entry\n \/\/\n childrenName = new char*[dirList->Count()];\n TInt i;\n for (i=0;i<dirList->Count();i++)\n {\n TBuf<DIM_MANAGEMENT_PATH> fileName = (*dirList)[i].iName;\n\n#if 0\n childrenName[i] = bufToNewChar(buf8);\n#else\n \/\/ TODO use string utils\n HBufC8* buf8 = CnvUtfConverter::ConvertFromUnicodeToUtf8L(fileName);\n childrenName[i] = stringdup((const char*)buf8->Ptr(), buf8->Length());\n *(childrenName[i] + buf8->Length()) = (char)0;\n delete buf8;\n#endif\n }\n fileSession.Close();\n\nfinally:\n \/\/\n \/\/ Close the connection with the file server\n \/\/ and destroy dirList\n \/\/\n CleanupStack::PopAndDestroy(cleanupStackSize);\n return childrenName;\n}\n\n\/*\n * Sets a property value.\n *\n * @param property - the property name\n * @param value - the property value (zero terminated string)\n *\/\nvoid DeviceManagementNode::setPropertyValue(const char* property, const char* newvalue) {\n int i = 0;\n\n while (true) {\n line *curr = (line *)lines->get(i);\n if (!curr) {\n break;\n }\n\n const char *start = curr->getLine();\n const char *value = start;\n\n while (*value && isspace(*value)) {\n value++;\n }\n if (!strnicmp(value, property, strlen(property))) {\n value = strchr(value, '=');\n if (value) {\n value++;\n while (*value && isspace(*value)) {\n value++;\n }\n if (strcmp(value, newvalue)) {\n \/\/ preserve indention and property name from original config\n char *newstr = new char[(value - start) + strlen(newvalue) + 1];\n strncpy(newstr, start, value - start);\n strcpy(newstr + (value - start), newvalue);\n curr->setLine(newstr);\n delete [] newstr;\n modified = true;\n }\n goto finally;\n }\n }\n i++;\n }\n\n {\n \/\/ This is a new property\n char *newstr = new char[strlen(property) + 3 + strlen(newvalue) + 1];\n sprintf(newstr, \"%s = %s\", property, newvalue);\n line newline(newstr);\n lines->add(newline);\n delete [] newstr;\n modified = true;\n }\n\nfinally:\n i = 0;\n}\n\nvoid DeviceManagementNode::setServerURI(const StringBuffer& server) {\n DeviceManagementNode::server = server;\n}\n\nconst StringBuffer& DeviceManagementNode::getServerURI() {\n return server;\n}\n\nvoid DeviceManagementNode::setProfileName(const StringBuffer& name) {\n DeviceManagementNode::profileName = name;\n}\n\nconst StringBuffer& DeviceManagementNode::getProfileName() {\n return profileName;\n}\n\nvoid DeviceManagementNode::setUID(TSmlCreatorId uid) {\n DeviceManagementNode::uid = uid;\n}\n\nTSmlCreatorId DeviceManagementNode::getUID() {\n return uid;\n}\n\nvoid DeviceManagementNode::setCardURI(const StringBuffer& cardURI) {\n DeviceManagementNode::cardURI = cardURI;\n}\n\nconst StringBuffer& DeviceManagementNode::getCardURI() {\n return cardURI;\n}\n\nvoid DeviceManagementNode::setCalURI(const StringBuffer& calURI) {\n DeviceManagementNode::calURI = calURI;\n}\n\nconst StringBuffer& DeviceManagementNode::getCalURI() {\n return calURI;\n}\n\nvoid DeviceManagementNode::setImapServer(const StringBuffer& imapServer) {\n DeviceManagementNode::imapServer = imapServer;\n}\n\nconst StringBuffer& DeviceManagementNode::getImapServer() {\n return imapServer;\n}\n\nvoid DeviceManagementNode::setImapPort(unsigned int imapPort) {\n DeviceManagementNode::imapPort = imapPort;\n}\n\nunsigned int DeviceManagementNode::getImapPort() {\n return imapPort;\n}\n\nvoid DeviceManagementNode::setSmtpPort(unsigned int smtpPort) {\n DeviceManagementNode::smtpPort = smtpPort;\n}\n\nunsigned int DeviceManagementNode::getSmtpPort() {\n return smtpPort;\n}\n\nvoid DeviceManagementNode::setSmtpServer(const StringBuffer& smtpServer) {\n DeviceManagementNode::smtpServer = smtpServer;\n}\n\nconst StringBuffer& DeviceManagementNode::getSmtpServer() {\n return smtpServer;\n}\n\n\nArrayElement* DeviceManagementNode::clone()\n{\n DeviceManagementNode* ret = new DeviceManagementNode(context, name);\n\n int n = children.size();\n\n for (int i = 0; i<n; ++i) {\n ret->addChild(*((ManagementNode*)children[i]));\n }\n\n return ret;\n}\n\nvoid DeviceManagementNode::concatDirs(StringBuffer& src1, const char* src2) {\n \n \/\/ If the src path terminates with \\\\ then there is no\n \/\/ need to add it again (this would be an illegal symbian path)\n \/\/ Unfortunately we cannot use StringBuffer directly for this check\n \/\/ there is something weird with \\\\ in StringBuffer (at least on symbian)\n const char* chars = src1.c_str();\n if (chars[strlen(chars)-1] != '\\\\') {\n src1.append(\"\\\\\");\n }\n src1.append(src2);\n}\n\nvoid DeviceManagementNode::initCurrentDir() {\n\n if (configPath.empty()) {\n currentDir = \".\\\\\";\n } else {\n currentDir = configPath;\n }\n if (context) {\n StringBuffer translatedContext = contextToPath(context);\n const char* tc = translatedContext.c_str();\n concatDirs(currentDir, tc);\n }\n if (name) {\n concatDirs(currentDir, name);\n }\n}\n\nStringBuffer DeviceManagementNode::contextToPath(const char* cont) {\n \/\/ Contextes are defined as: (string\/)* and on Symbian\n \/\/ we map them to file. But Symbian uses backslashes as\n \/\/ directory separator.\n StringBuffer sb(cont);\n sb.replaceAll(\"\/\", \"\\\\\", 0);\n return sb;\n}\n\nint DeviceManagementNode::renameFileInCwd(const char* src, const char* dst) {\n\n RFs fileSession;\n RFile file;\n\n StringBuffer srcSb(currentDir);\n concatDirs(srcSb, src);\n StringBuffer dstSb(currentDir);\n concatDirs(dstSb, dst);\n\n RBuf srcDes, dstDes;\n srcDes.Assign(stringBufferToNewBuf(srcSb));\n dstDes.Assign(stringBufferToNewBuf(dstSb));\n\n \/\/ Connect to the file server\n fileSession.Connect();\n CleanupClosePushL(fileSession);\n\n \/\/ Replace 'config.ini' file with 'config.ini.tmp'\n TInt err = fileSession.Replace(srcDes, dstDes);\n\n CleanupStack::PopAndDestroy(&fileSession);\n\n if (err == KErrNone) {\n return 0;\n }\n else {\n LOG.error(\"Error (code %d) replacing file '%s'\", err, dstSb.c_str());\n if (err == KErrAccessDenied) {\n LOG.error(\"Access denied\");\n }\n else if (err == KErrPathNotFound) {\n LOG.error(\"Unable to find the specified folder\");\n }\n return -1;\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef __itkVoronoiDiagram2D_hxx\n#define __itkVoronoiDiagram2D_hxx\n#include \"itkVoronoiDiagram2D.h\"\n\n#include <algorithm>\n#include \"vnl\/vnl_sample.h\"\n\nnamespace itk\n{\n\ntemplate< typename TCoordRepType >\nVoronoiDiagram2D< TCoordRepType >\n::VoronoiDiagram2D()\n{\n m_NumberOfSeeds = 0;\n}\n\n\ntemplate< typename TCoordRepType >\nVoronoiDiagram2D< TCoordRepType >\n::~VoronoiDiagram2D()\n{\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n os << indent << \"Number Of Seeds: \"\n << m_NumberOfSeeds << std::endl;\n}\n\n\n\/* Set the seed points, specify the number of seeds as \"num\". *\/\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetSeeds(int num, SeedsIterator begin)\n{\n m_Seeds.clear();\n SeedsIterator ii(begin);\n for ( int i = 0; i < num; ++i )\n {\n m_Seeds.push_back(*ii++);\n }\n m_NumberOfSeeds = num;\n}\n\n\n\/* Set the rectangle that encloses the Voronoi Diagram. *\/\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetBoundary(PointType vorsize)\n{\n m_VoronoiBoundary[0] = vorsize[0];\n m_VoronoiBoundary[1] = vorsize[1];\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetOrigin(PointType vorsize)\n{\n m_VoronoiBoundaryOrigin[0] = vorsize[0];\n m_VoronoiBoundaryOrigin[0] = vorsize[1];\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::GetPoint(int pId, PointType *answer)\n{\n *answer = this->m_PointsContainer->ElementAt(pId);\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::GetCellId(CellIdentifier cellId, CellAutoPointer & cellPtr)\n{\n cellPtr.TakeNoOwnership(m_VoronoiRegions[cellId]);\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::EdgeInfo\nVoronoiDiagram2D< TCoordRepType >\n::GetSeedsIDAroundEdge(VoronoiEdge *task)\n{\n EdgeInfo answer;\n\n answer[0] = m_LineList[task->m_LineID][0];\n answer[1] = m_LineList[task->m_LineID][1];\n return ( answer );\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VoronoiEdgeIterator\nVoronoiDiagram2D< TCoordRepType >\n::EdgeBegin()\n{\n return m_EdgeList.begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VoronoiEdgeIterator\nVoronoiDiagram2D< TCoordRepType >\n::EdgeEnd()\n{\n return m_EdgeList.end();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::NeighborIdIterator\nVoronoiDiagram2D< TCoordRepType >\n::NeighborIdsBegin(int seeds)\n{\n return m_CellNeighborsID[seeds].begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::NeighborIdIterator\nVoronoiDiagram2D< TCoordRepType >\n::NeighborIdsEnd(int seeds)\n{\n return m_CellNeighborsID[seeds].end();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VertexIterator\nVoronoiDiagram2D< TCoordRepType >\n::VertexBegin()\n{\n return this->m_PointsContainer->Begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VertexIterator\nVoronoiDiagram2D< TCoordRepType >\n::VertexEnd()\n{\n return this->m_PointsContainer->End();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::PointType\nVoronoiDiagram2D< TCoordRepType >\n::GetSeed(int SeedID)\n{\n PointType answer;\n\n answer[0] = m_Seeds[SeedID][0];\n answer[1] = m_Seeds[SeedID][1];\n return answer;\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::Reset()\n{\n m_VoronoiRegions.clear();\n m_VoronoiRegions.resize(m_NumberOfSeeds);\n m_CellNeighborsID.resize(m_NumberOfSeeds);\n\n for ( unsigned int i = 0; i < m_NumberOfSeeds; i++ )\n {\n m_VoronoiRegions[i] = new PolygonCellType;\n m_CellNeighborsID[i].clear();\n }\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::InsertCells()\n{\n genericCellPointer cellPtr;\n\n for ( unsigned int i = 0; i < m_NumberOfSeeds; i++ )\n {\n cellPtr.TakeOwnership(m_VoronoiRegions[i]);\n this->SetCell(i, cellPtr);\n }\n}\n\n} \/\/ end namespace itk\n\n#endif\n<commit_msg>BUG: Fix invalid assignment of second VoronoiBoundaryOrigin.<commit_after>\/*=========================================================================\n *\n * Copyright Insight Software Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *=========================================================================*\/\n#ifndef __itkVoronoiDiagram2D_hxx\n#define __itkVoronoiDiagram2D_hxx\n#include \"itkVoronoiDiagram2D.h\"\n\n#include <algorithm>\n#include \"vnl\/vnl_sample.h\"\n\nnamespace itk\n{\n\ntemplate< typename TCoordRepType >\nVoronoiDiagram2D< TCoordRepType >\n::VoronoiDiagram2D()\n{\n m_NumberOfSeeds = 0;\n}\n\n\ntemplate< typename TCoordRepType >\nVoronoiDiagram2D< TCoordRepType >\n::~VoronoiDiagram2D()\n{\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::PrintSelf(std::ostream & os, Indent indent) const\n{\n Superclass::PrintSelf(os, indent);\n os << indent << \"Number Of Seeds: \"\n << m_NumberOfSeeds << std::endl;\n}\n\n\n\/* Set the seed points, specify the number of seeds as \"num\". *\/\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetSeeds(int num, SeedsIterator begin)\n{\n m_Seeds.clear();\n SeedsIterator ii(begin);\n for ( int i = 0; i < num; ++i )\n {\n m_Seeds.push_back(*ii++);\n }\n m_NumberOfSeeds = num;\n}\n\n\n\/* Set the rectangle that encloses the Voronoi Diagram. *\/\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetBoundary(PointType vorsize)\n{\n m_VoronoiBoundary[0] = vorsize[0];\n m_VoronoiBoundary[1] = vorsize[1];\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::SetOrigin(PointType vorsize)\n{\n m_VoronoiBoundaryOrigin[0] = vorsize[0];\n m_VoronoiBoundaryOrigin[1] = vorsize[1];\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::GetPoint(int pId, PointType *answer)\n{\n *answer = this->m_PointsContainer->ElementAt(pId);\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::GetCellId(CellIdentifier cellId, CellAutoPointer & cellPtr)\n{\n cellPtr.TakeNoOwnership(m_VoronoiRegions[cellId]);\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::EdgeInfo\nVoronoiDiagram2D< TCoordRepType >\n::GetSeedsIDAroundEdge(VoronoiEdge *task)\n{\n EdgeInfo answer;\n\n answer[0] = m_LineList[task->m_LineID][0];\n answer[1] = m_LineList[task->m_LineID][1];\n return ( answer );\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VoronoiEdgeIterator\nVoronoiDiagram2D< TCoordRepType >\n::EdgeBegin()\n{\n return m_EdgeList.begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VoronoiEdgeIterator\nVoronoiDiagram2D< TCoordRepType >\n::EdgeEnd()\n{\n return m_EdgeList.end();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::NeighborIdIterator\nVoronoiDiagram2D< TCoordRepType >\n::NeighborIdsBegin(int seeds)\n{\n return m_CellNeighborsID[seeds].begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::NeighborIdIterator\nVoronoiDiagram2D< TCoordRepType >\n::NeighborIdsEnd(int seeds)\n{\n return m_CellNeighborsID[seeds].end();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VertexIterator\nVoronoiDiagram2D< TCoordRepType >\n::VertexBegin()\n{\n return this->m_PointsContainer->Begin();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::VertexIterator\nVoronoiDiagram2D< TCoordRepType >\n::VertexEnd()\n{\n return this->m_PointsContainer->End();\n}\n\n\ntemplate< typename TCoordRepType >\ntypename VoronoiDiagram2D< TCoordRepType >::PointType\nVoronoiDiagram2D< TCoordRepType >\n::GetSeed(int SeedID)\n{\n PointType answer;\n\n answer[0] = m_Seeds[SeedID][0];\n answer[1] = m_Seeds[SeedID][1];\n return answer;\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::Reset()\n{\n m_VoronoiRegions.clear();\n m_VoronoiRegions.resize(m_NumberOfSeeds);\n m_CellNeighborsID.resize(m_NumberOfSeeds);\n\n for ( unsigned int i = 0; i < m_NumberOfSeeds; i++ )\n {\n m_VoronoiRegions[i] = new PolygonCellType;\n m_CellNeighborsID[i].clear();\n }\n}\n\n\ntemplate< typename TCoordRepType >\nvoid\nVoronoiDiagram2D< TCoordRepType >\n::InsertCells()\n{\n genericCellPointer cellPtr;\n\n for ( unsigned int i = 0; i < m_NumberOfSeeds; i++ )\n {\n cellPtr.TakeOwnership(m_VoronoiRegions[i]);\n this->SetCell(i, cellPtr);\n }\n}\n\n} \/\/ end namespace itk\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"printing\/printing_context_no_system_dialog.h\"\n\n#include <unicode\/ulocdata.h>\n\n#include \"base\/logging.h\"\n#include \"base\/values.h\"\n#include \"printing\/metafile.h\"\n#include \"printing\/print_job_constants.h\"\n#include \"printing\/units.h\"\n\nnamespace printing {\n\n\/\/ static\nPrintingContext* PrintingContext::Create(const std::string& app_locale) {\n return static_cast<PrintingContext*>(\n new PrintingContextNoSystemDialog(app_locale));\n}\n\nPrintingContextNoSystemDialog::PrintingContextNoSystemDialog(\n const std::string& app_locale) : PrintingContext(app_locale) {\n}\n\nPrintingContextNoSystemDialog::~PrintingContextNoSystemDialog() {\n ReleaseContext();\n}\n\nvoid PrintingContextNoSystemDialog::AskUserForSettings(\n gfx::NativeView parent_view,\n int max_pages,\n bool has_selection,\n const PrintSettingsCallback& callback) {\n \/\/ We don't want to bring up a dialog here. Ever. Just signal the callback.\n callback.Run(OK);\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::UseDefaultSettings() {\n DCHECK(!in_print_job_);\n\n ResetSettings();\n \/\/ TODO(abodenha): Fetch these settings from the OS where possible. See\n \/\/ bug 102583.\n \/\/ TODO(sanjeevr): We need a better feedback loop between the cloud print\n \/\/ dialog and this code.\n int dpi = 300;\n gfx::Size physical_size_device_units;\n gfx::Rect printable_area_device_units;\n int32_t width = 0;\n int32_t height = 0;\n UErrorCode error = U_ZERO_ERROR;\n ulocdata_getPaperSize(app_locale_.c_str(), &height, &width, &error);\n if (error != U_ZERO_ERROR) {\n \/\/ If the call failed, assume a paper size of 8.5 x 11 inches.\n LOG(WARNING) << \"ulocdata_getPaperSize failed, using 8.5 x 11, error: \"\n << error;\n width = static_cast<int>(8.5 * dpi);\n height = static_cast<int>(11 * dpi);\n } else {\n \/\/ ulocdata_getPaperSize returns the width and height in mm.\n \/\/ Convert this to pixels based on the dpi.\n width = static_cast<int>(ConvertUnitDouble(width, 25.4, 1.0) * dpi);\n height = static_cast<int>(ConvertUnitDouble(height, 25.4, 1.0) * dpi);\n }\n\n physical_size_device_units.SetSize(width, height);\n\n \/\/ Assume full page is printable for now.\n printable_area_device_units.SetRect(0, 0, width, height);\n\n settings_.set_dpi(dpi);\n settings_.SetPrinterPrintableArea(physical_size_device_units,\n printable_area_device_units,\n dpi);\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::UpdatePrinterSettings(\n const DictionaryValue& job_settings, const PageRanges& ranges) {\n bool landscape = false;\n\n if (!job_settings.GetBoolean(kSettingLandscape, &landscape))\n return OnError();\n\n if (settings_.dpi() == 0)\n UseDefaultSettings();\n\n settings_.SetOrientation(landscape);\n settings_.ranges = ranges;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::InitWithSettings(\n const PrintSettings& settings) {\n DCHECK(!in_print_job_);\n\n settings_ = settings;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::NewDocument(\n const string16& document_name) {\n DCHECK(!in_print_job_);\n in_print_job_ = true;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::NewPage() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n \/\/ Intentional No-op.\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::PageDone() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n \/\/ Intentional No-op.\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::DocumentDone() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n ResetSettings();\n return OK;\n}\n\nvoid PrintingContextNoSystemDialog::Cancel() {\n abort_printing_ = true;\n in_print_job_ = false;\n}\n\nvoid PrintingContextNoSystemDialog::ReleaseContext() {\n \/\/ Intentional No-op.\n}\n\ngfx::NativeDrawingContext PrintingContextNoSystemDialog::context() const {\n \/\/ Intentional No-op.\n return NULL;\n}\n\n} \/\/ namespace printing\n\n<commit_msg>Fix issue with some locales simetimes getting the wrong page size. We use ulocdata_getPaperSize to get the preferred paper size for a region. The error handling for the call assumed that a value other than U_ZERO_ERROR was an error. This is incorrect. The function sometimes returns a warning (negative value). When that happens, the error handling code defaulted to 8.5x11 pages.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"printing\/printing_context_no_system_dialog.h\"\n\n#include <unicode\/ulocdata.h>\n\n#include \"base\/logging.h\"\n#include \"base\/values.h\"\n#include \"printing\/metafile.h\"\n#include \"printing\/print_job_constants.h\"\n#include \"printing\/units.h\"\n\nnamespace printing {\n\n\/\/ static\nPrintingContext* PrintingContext::Create(const std::string& app_locale) {\n return static_cast<PrintingContext*>(\n new PrintingContextNoSystemDialog(app_locale));\n}\n\nPrintingContextNoSystemDialog::PrintingContextNoSystemDialog(\n const std::string& app_locale) : PrintingContext(app_locale) {\n}\n\nPrintingContextNoSystemDialog::~PrintingContextNoSystemDialog() {\n ReleaseContext();\n}\n\nvoid PrintingContextNoSystemDialog::AskUserForSettings(\n gfx::NativeView parent_view,\n int max_pages,\n bool has_selection,\n const PrintSettingsCallback& callback) {\n \/\/ We don't want to bring up a dialog here. Ever. Just signal the callback.\n callback.Run(OK);\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::UseDefaultSettings() {\n DCHECK(!in_print_job_);\n\n ResetSettings();\n \/\/ TODO(abodenha): Fetch these settings from the OS where possible. See\n \/\/ bug 102583.\n \/\/ TODO(sanjeevr): We need a better feedback loop between the cloud print\n \/\/ dialog and this code.\n int dpi = 300;\n gfx::Size physical_size_device_units;\n gfx::Rect printable_area_device_units;\n int32_t width = 0;\n int32_t height = 0;\n UErrorCode error = U_ZERO_ERROR;\n ulocdata_getPaperSize(app_locale_.c_str(), &height, &width, &error);\n if (error > U_ZERO_ERROR) {\n \/\/ If the call failed, assume a paper size of 8.5 x 11 inches.\n LOG(WARNING) << \"ulocdata_getPaperSize failed, using 8.5 x 11, error: \"\n << error;\n width = static_cast<int>(8.5 * dpi);\n height = static_cast<int>(11 * dpi);\n } else {\n \/\/ ulocdata_getPaperSize returns the width and height in mm.\n \/\/ Convert this to pixels based on the dpi.\n width = static_cast<int>(ConvertUnitDouble(width, 25.4, 1.0) * dpi);\n height = static_cast<int>(ConvertUnitDouble(height, 25.4, 1.0) * dpi);\n }\n\n physical_size_device_units.SetSize(width, height);\n\n \/\/ Assume full page is printable for now.\n printable_area_device_units.SetRect(0, 0, width, height);\n\n settings_.set_dpi(dpi);\n settings_.SetPrinterPrintableArea(physical_size_device_units,\n printable_area_device_units,\n dpi);\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::UpdatePrinterSettings(\n const DictionaryValue& job_settings, const PageRanges& ranges) {\n bool landscape = false;\n\n if (!job_settings.GetBoolean(kSettingLandscape, &landscape))\n return OnError();\n\n if (settings_.dpi() == 0)\n UseDefaultSettings();\n\n settings_.SetOrientation(landscape);\n settings_.ranges = ranges;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::InitWithSettings(\n const PrintSettings& settings) {\n DCHECK(!in_print_job_);\n\n settings_ = settings;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::NewDocument(\n const string16& document_name) {\n DCHECK(!in_print_job_);\n in_print_job_ = true;\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::NewPage() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n \/\/ Intentional No-op.\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::PageDone() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n \/\/ Intentional No-op.\n\n return OK;\n}\n\nPrintingContext::Result PrintingContextNoSystemDialog::DocumentDone() {\n if (abort_printing_)\n return CANCEL;\n DCHECK(in_print_job_);\n\n ResetSettings();\n return OK;\n}\n\nvoid PrintingContextNoSystemDialog::Cancel() {\n abort_printing_ = true;\n in_print_job_ = false;\n}\n\nvoid PrintingContextNoSystemDialog::ReleaseContext() {\n \/\/ Intentional No-op.\n}\n\ngfx::NativeDrawingContext PrintingContextNoSystemDialog::context() const {\n \/\/ Intentional No-op.\n return NULL;\n}\n\n} \/\/ namespace printing\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2020 The Orbit Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"CaptureServiceImpl.h\"\n\n#include <absl\/container\/flat_hash_set.h>\n#include <absl\/synchronization\/mutex.h>\n#include <absl\/time\/time.h>\n#include <pthread.h>\n#include <stdint.h>\n\n#include <algorithm>\n#include <limits>\n#include <thread>\n#include <utility>\n#include <vector>\n\n#include \"CaptureEventBuffer.h\"\n#include \"CaptureEventSender.h\"\n#include \"LinuxTracingHandler.h\"\n#include \"OrbitBase\/Logging.h\"\n#include \"OrbitBase\/Tracing.h\"\n#include \"ProducerEventProcessor.h\"\n#include \"capture.pb.h\"\n\nnamespace orbit_service {\n\nusing orbit_grpc_protos::CaptureRequest;\nusing orbit_grpc_protos::CaptureResponse;\n\nnamespace {\n\nusing orbit_grpc_protos::ClientCaptureEvent;\n\nclass SenderThreadCaptureEventBuffer final : public CaptureEventBuffer {\n public:\n explicit SenderThreadCaptureEventBuffer(CaptureEventSender* event_sender)\n : capture_event_sender_{event_sender} {\n CHECK(capture_event_sender_ != nullptr);\n sender_thread_ = std::thread{[this] { SenderThread(); }};\n }\n\n void AddEvent(ClientCaptureEvent&& event) override {\n absl::MutexLock lock{&event_buffer_mutex_};\n if (stop_requested_) {\n return;\n }\n event_buffer_.emplace_back(std::move(event));\n }\n\n void StopAndWait() {\n CHECK(sender_thread_.joinable());\n {\n \/\/ Protect stop_requested_ with event_buffer_mutex_ so that we can use stop_requested_\n \/\/ in Conditions for Await\/LockWhen (specifically, in SenderThread).\n absl::MutexLock lock{&event_buffer_mutex_};\n stop_requested_ = true;\n }\n sender_thread_.join();\n }\n\n ~SenderThreadCaptureEventBuffer() override { CHECK(!sender_thread_.joinable()); }\n\n private:\n void SenderThread() {\n pthread_setname_np(pthread_self(), \"SenderThread\");\n constexpr absl::Duration kSendTimeInterval = absl::Milliseconds(20);\n \/\/ This should be lower than kMaxEventsPerResponse in GrpcCaptureEventSender::SendEvents\n \/\/ as a few more events are likely to arrive after the condition becomes true.\n constexpr uint64_t kSendEventCountInterval = 5000;\n\n bool stopped = false;\n while (!stopped) {\n ORBIT_SCOPE(\"SenderThread iteration\");\n event_buffer_mutex_.LockWhenWithTimeout(absl::Condition(\n +[](SenderThreadCaptureEventBuffer* self) {\n return self->event_buffer_.size() >=\n kSendEventCountInterval ||\n self->stop_requested_;\n },\n this),\n kSendTimeInterval);\n if (stop_requested_) {\n stopped = true;\n }\n std::vector<ClientCaptureEvent> buffered_events = std::move(event_buffer_);\n event_buffer_.clear();\n event_buffer_mutex_.Unlock();\n capture_event_sender_->SendEvents(std::move(buffered_events));\n }\n }\n\n std::vector<ClientCaptureEvent> event_buffer_;\n absl::Mutex event_buffer_mutex_;\n CaptureEventSender* capture_event_sender_;\n std::thread sender_thread_;\n bool stop_requested_ = false;\n};\n\nclass GrpcCaptureEventSender final : public CaptureEventSender {\n public:\n explicit GrpcCaptureEventSender(\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer)\n : reader_writer_{reader_writer} {\n CHECK(reader_writer_ != nullptr);\n }\n\n ~GrpcCaptureEventSender() override {\n LOG(\"Total number of events sent: %lu\", total_number_of_events_sent_);\n LOG(\"Total number of bytes sent: %lu\", total_number_of_bytes_sent_);\n\n \/\/ Ensure we can divide by 0.f safely.\n static_assert(std::numeric_limits<float>::is_iec559);\n float average_bytes =\n static_cast<float>(total_number_of_bytes_sent_) \/ total_number_of_events_sent_;\n\n LOG(\"Average number of bytes per event: %.2f\", average_bytes);\n }\n\n void SendEvents(std::vector<ClientCaptureEvent>&& events) override {\n ORBIT_SCOPE_FUNCTION;\n ORBIT_UINT64(\"Number of buffered events sent\", events.size());\n if (events.empty()) {\n return;\n }\n\n constexpr uint64_t kMaxEventsPerResponse = 10'000;\n uint64_t number_of_bytes_sent = 0;\n CaptureResponse response;\n for (ClientCaptureEvent& event : events) {\n \/\/ We buffer to avoid sending countless tiny messages, but we also want to\n \/\/ avoid huge messages, which would cause the capture on the client to jump\n \/\/ forward in time in few big steps and not look live anymore.\n if (response.capture_events_size() == kMaxEventsPerResponse) {\n number_of_bytes_sent += response.ByteSizeLong();\n reader_writer_->Write(response);\n response.clear_capture_events();\n }\n response.mutable_capture_events()->Add(std::move(event));\n }\n number_of_bytes_sent += response.ByteSizeLong();\n reader_writer_->Write(response);\n\n \/\/ Ensure we can divide by 0.f safely.\n static_assert(std::numeric_limits<float>::is_iec559);\n float average_bytes = static_cast<float>(number_of_bytes_sent) \/ events.size();\n\n ORBIT_FLOAT(\"Average bytes per CaptureEvent\", average_bytes);\n total_number_of_events_sent_ += events.size();\n total_number_of_bytes_sent_ += number_of_bytes_sent;\n }\n\n private:\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer_;\n\n uint64_t total_number_of_events_sent_ = 0;\n uint64_t total_number_of_bytes_sent_ = 0;\n};\n\n} \/\/ namespace\n\n\/\/ LinuxTracingHandler::Stop is blocking, until all perf_event_open events have been processed\n\/\/ and all perf_event_open file descriptors have been closed.\n\/\/ CaptureStartStopListener::OnCaptureStopRequested is also to be assumed blocking,\n\/\/ for example until all CaptureEvents from external producers have been received.\n\/\/ Hence why these methods need to be called in parallel on different threads.\nstatic void StopTracingHandlerAndCaptureStartStopListenersInParallel(\n LinuxTracingHandler* tracing_handler,\n absl::flat_hash_set<CaptureStartStopListener*>* capture_start_stop_listeners) {\n std::vector<std::thread> stop_threads;\n\n stop_threads.emplace_back([&tracing_handler] {\n tracing_handler->Stop();\n LOG(\"LinuxTracingHandler stopped: perf_event_open tracing is done\");\n });\n\n for (CaptureStartStopListener* listener : *capture_start_stop_listeners) {\n stop_threads.emplace_back([&listener] {\n listener->OnCaptureStopRequested();\n LOG(\"CaptureStartStopListener stopped: one or more producers finished capturing\");\n });\n }\n\n for (std::thread& stop_thread : stop_threads) {\n stop_thread.join();\n }\n}\n\ngrpc::Status CaptureServiceImpl::Capture(\n grpc::ServerContext*,\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer) {\n pthread_setname_np(pthread_self(), \"CSImpl::Capture\");\n if (is_capturing) {\n ERROR(\"Cannot start capture because another capture is already in progress\");\n return grpc::Status(grpc::StatusCode::ALREADY_EXISTS,\n \"Cannot start capture because another capture is already in progress.\");\n }\n is_capturing = true;\n\n GrpcCaptureEventSender capture_event_sender{reader_writer};\n SenderThreadCaptureEventBuffer capture_event_buffer{&capture_event_sender};\n std::unique_ptr<ProducerEventProcessor> producer_event_processor =\n ProducerEventProcessor::Create(&capture_event_buffer);\n LinuxTracingHandler tracing_handler{producer_event_processor.get()};\n\n CaptureRequest request;\n reader_writer->Read(&request);\n LOG(\"Read CaptureRequest from Capture's gRPC stream: starting capture\");\n\n tracing_handler.Start(request.capture_options());\n for (CaptureStartStopListener* listener : capture_start_stop_listeners_) {\n listener->OnCaptureStartRequested(request.capture_options(), producer_event_processor.get());\n }\n\n \/\/ The client asks for the capture to be stopped by calling WritesDone.\n \/\/ At that point, this call to Read will return false.\n \/\/ In the meantime, it blocks if no message is received.\n while (reader_writer->Read(&request)) {\n }\n LOG(\"Client finished writing on Capture's gRPC stream: stopping capture\");\n\n StopTracingHandlerAndCaptureStartStopListenersInParallel(&tracing_handler,\n &capture_start_stop_listeners_);\n\n capture_event_buffer.StopAndWait();\n LOG(\"Finished handling gRPC call to Capture: all capture data has been sent\");\n is_capturing = false;\n return grpc::Status::OK;\n}\n\nvoid CaptureServiceImpl::AddCaptureStartStopListener(CaptureStartStopListener* listener) {\n bool new_insertion = capture_start_stop_listeners_.insert(listener).second;\n CHECK(new_insertion);\n}\n\nvoid CaptureServiceImpl::RemoveCaptureStartStopListener(CaptureStartStopListener* listener) {\n bool was_removed = capture_start_stop_listeners_.erase(listener) > 0;\n CHECK(was_removed);\n}\n\n} \/\/ namespace orbit_service\n<commit_msg>Integrate MemoryInfoProducer to CaptureService<commit_after>\/\/ Copyright (c) 2020 The Orbit Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"CaptureServiceImpl.h\"\n\n#include <absl\/container\/flat_hash_set.h>\n#include <absl\/synchronization\/mutex.h>\n#include <absl\/time\/time.h>\n#include <pthread.h>\n#include <stdint.h>\n\n#include <algorithm>\n#include <limits>\n#include <thread>\n#include <utility>\n#include <vector>\n\n#include \"CaptureEventBuffer.h\"\n#include \"CaptureEventSender.h\"\n#include \"LinuxTracingHandler.h\"\n#include \"MemoryInfoHandler.h\"\n#include \"OrbitBase\/Logging.h\"\n#include \"OrbitBase\/Tracing.h\"\n#include \"ProducerEventProcessor.h\"\n#include \"capture.pb.h\"\n\nnamespace orbit_service {\n\nusing orbit_grpc_protos::CaptureRequest;\nusing orbit_grpc_protos::CaptureResponse;\n\nnamespace {\n\nusing orbit_grpc_protos::ClientCaptureEvent;\n\nclass SenderThreadCaptureEventBuffer final : public CaptureEventBuffer {\n public:\n explicit SenderThreadCaptureEventBuffer(CaptureEventSender* event_sender)\n : capture_event_sender_{event_sender} {\n CHECK(capture_event_sender_ != nullptr);\n sender_thread_ = std::thread{[this] { SenderThread(); }};\n }\n\n void AddEvent(ClientCaptureEvent&& event) override {\n absl::MutexLock lock{&event_buffer_mutex_};\n if (stop_requested_) {\n return;\n }\n event_buffer_.emplace_back(std::move(event));\n }\n\n void StopAndWait() {\n CHECK(sender_thread_.joinable());\n {\n \/\/ Protect stop_requested_ with event_buffer_mutex_ so that we can use stop_requested_\n \/\/ in Conditions for Await\/LockWhen (specifically, in SenderThread).\n absl::MutexLock lock{&event_buffer_mutex_};\n stop_requested_ = true;\n }\n sender_thread_.join();\n }\n\n ~SenderThreadCaptureEventBuffer() override { CHECK(!sender_thread_.joinable()); }\n\n private:\n void SenderThread() {\n pthread_setname_np(pthread_self(), \"SenderThread\");\n constexpr absl::Duration kSendTimeInterval = absl::Milliseconds(20);\n \/\/ This should be lower than kMaxEventsPerResponse in GrpcCaptureEventSender::SendEvents\n \/\/ as a few more events are likely to arrive after the condition becomes true.\n constexpr uint64_t kSendEventCountInterval = 5000;\n\n bool stopped = false;\n while (!stopped) {\n ORBIT_SCOPE(\"SenderThread iteration\");\n event_buffer_mutex_.LockWhenWithTimeout(absl::Condition(\n +[](SenderThreadCaptureEventBuffer* self) {\n return self->event_buffer_.size() >=\n kSendEventCountInterval ||\n self->stop_requested_;\n },\n this),\n kSendTimeInterval);\n if (stop_requested_) {\n stopped = true;\n }\n std::vector<ClientCaptureEvent> buffered_events = std::move(event_buffer_);\n event_buffer_.clear();\n event_buffer_mutex_.Unlock();\n capture_event_sender_->SendEvents(std::move(buffered_events));\n }\n }\n\n std::vector<ClientCaptureEvent> event_buffer_;\n absl::Mutex event_buffer_mutex_;\n CaptureEventSender* capture_event_sender_;\n std::thread sender_thread_;\n bool stop_requested_ = false;\n};\n\nclass GrpcCaptureEventSender final : public CaptureEventSender {\n public:\n explicit GrpcCaptureEventSender(\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer)\n : reader_writer_{reader_writer} {\n CHECK(reader_writer_ != nullptr);\n }\n\n ~GrpcCaptureEventSender() override {\n LOG(\"Total number of events sent: %lu\", total_number_of_events_sent_);\n LOG(\"Total number of bytes sent: %lu\", total_number_of_bytes_sent_);\n\n \/\/ Ensure we can divide by 0.f safely.\n static_assert(std::numeric_limits<float>::is_iec559);\n float average_bytes =\n static_cast<float>(total_number_of_bytes_sent_) \/ total_number_of_events_sent_;\n\n LOG(\"Average number of bytes per event: %.2f\", average_bytes);\n }\n\n void SendEvents(std::vector<ClientCaptureEvent>&& events) override {\n ORBIT_SCOPE_FUNCTION;\n ORBIT_UINT64(\"Number of buffered events sent\", events.size());\n if (events.empty()) {\n return;\n }\n\n constexpr uint64_t kMaxEventsPerResponse = 10'000;\n uint64_t number_of_bytes_sent = 0;\n CaptureResponse response;\n for (ClientCaptureEvent& event : events) {\n \/\/ We buffer to avoid sending countless tiny messages, but we also want to\n \/\/ avoid huge messages, which would cause the capture on the client to jump\n \/\/ forward in time in few big steps and not look live anymore.\n if (response.capture_events_size() == kMaxEventsPerResponse) {\n number_of_bytes_sent += response.ByteSizeLong();\n reader_writer_->Write(response);\n response.clear_capture_events();\n }\n response.mutable_capture_events()->Add(std::move(event));\n }\n number_of_bytes_sent += response.ByteSizeLong();\n reader_writer_->Write(response);\n\n \/\/ Ensure we can divide by 0.f safely.\n static_assert(std::numeric_limits<float>::is_iec559);\n float average_bytes = static_cast<float>(number_of_bytes_sent) \/ events.size();\n\n ORBIT_FLOAT(\"Average bytes per CaptureEvent\", average_bytes);\n total_number_of_events_sent_ += events.size();\n total_number_of_bytes_sent_ += number_of_bytes_sent;\n }\n\n private:\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer_;\n\n uint64_t total_number_of_events_sent_ = 0;\n uint64_t total_number_of_bytes_sent_ = 0;\n};\n\n} \/\/ namespace\n\n\/\/ LinuxTracingHandler::Stop is blocking, until all perf_event_open events have been processed\n\/\/ and all perf_event_open file descriptors have been closed.\n\/\/ CaptureStartStopListener::OnCaptureStopRequested is also to be assumed blocking,\n\/\/ for example until all CaptureEvents from external producers have been received.\n\/\/ Hence why these methods need to be called in parallel on different threads.\nstatic void StopInternalProducersAndCaptureStartStopListenersInParallel(\n LinuxTracingHandler* tracing_handler, MemoryInfoHandler* memory_info_handler,\n absl::flat_hash_set<CaptureStartStopListener*>* capture_start_stop_listeners) {\n std::vector<std::thread> stop_threads;\n\n stop_threads.emplace_back([&tracing_handler] {\n tracing_handler->Stop();\n LOG(\"LinuxTracingHandler stopped: perf_event_open tracing is done\");\n });\n\n stop_threads.emplace_back([&memory_info_handler] {\n memory_info_handler->Stop();\n LOG(\"MemoryInfoHandler stopped: total memory usage information collection is done\");\n });\n\n for (CaptureStartStopListener* listener : *capture_start_stop_listeners) {\n stop_threads.emplace_back([&listener] {\n listener->OnCaptureStopRequested();\n LOG(\"CaptureStartStopListener stopped: one or more producers finished capturing\");\n });\n }\n\n for (std::thread& stop_thread : stop_threads) {\n stop_thread.join();\n }\n}\n\ngrpc::Status CaptureServiceImpl::Capture(\n grpc::ServerContext*,\n grpc::ServerReaderWriter<CaptureResponse, CaptureRequest>* reader_writer) {\n pthread_setname_np(pthread_self(), \"CSImpl::Capture\");\n if (is_capturing) {\n ERROR(\"Cannot start capture because another capture is already in progress\");\n return grpc::Status(grpc::StatusCode::ALREADY_EXISTS,\n \"Cannot start capture because another capture is already in progress.\");\n }\n is_capturing = true;\n\n GrpcCaptureEventSender capture_event_sender{reader_writer};\n SenderThreadCaptureEventBuffer capture_event_buffer{&capture_event_sender};\n std::unique_ptr<ProducerEventProcessor> producer_event_processor =\n ProducerEventProcessor::Create(&capture_event_buffer);\n LinuxTracingHandler tracing_handler{producer_event_processor.get()};\n MemoryInfoHandler memory_info_handler{producer_event_processor.get()};\n\n CaptureRequest request;\n reader_writer->Read(&request);\n LOG(\"Read CaptureRequest from Capture's gRPC stream: starting capture\");\n\n tracing_handler.Start(request.capture_options());\n memory_info_handler.Start(request.capture_options());\n for (CaptureStartStopListener* listener : capture_start_stop_listeners_) {\n listener->OnCaptureStartRequested(request.capture_options(), producer_event_processor.get());\n }\n\n \/\/ The client asks for the capture to be stopped by calling WritesDone.\n \/\/ At that point, this call to Read will return false.\n \/\/ In the meantime, it blocks if no message is received.\n while (reader_writer->Read(&request)) {\n }\n LOG(\"Client finished writing on Capture's gRPC stream: stopping capture\");\n\n StopInternalProducersAndCaptureStartStopListenersInParallel(\n &tracing_handler, &memory_info_handler, &capture_start_stop_listeners_);\n\n capture_event_buffer.StopAndWait();\n LOG(\"Finished handling gRPC call to Capture: all capture data has been sent\");\n is_capturing = false;\n return grpc::Status::OK;\n}\n\nvoid CaptureServiceImpl::AddCaptureStartStopListener(CaptureStartStopListener* listener) {\n bool new_insertion = capture_start_stop_listeners_.insert(listener).second;\n CHECK(new_insertion);\n}\n\nvoid CaptureServiceImpl::RemoveCaptureStartStopListener(CaptureStartStopListener* listener) {\n bool was_removed = capture_start_stop_listeners_.erase(listener) > 0;\n CHECK(was_removed);\n}\n\n} \/\/ namespace orbit_service\n<|endoftext|>"} {"text":"<commit_before>#ifndef UTIL_H\n#define UTIL_H\n\n#include <GL\/gl.h>\n#include <cmath>\n#include <FTGL\/ftgl.h>\n\n#include \"..\/Vector3.hpp\"\n#include \"..\/Box2.hpp\"\n#include \"..\/Physical.hpp\"\n\n#include <boost\/math\/constants\/constants.hpp>\nusing namespace boost::math;\n\nnamespace {\nconst float TO_DEGREES = 180 \/ constants::pi<float>();\nconst float TO_RADIANS = constants::pi<float>() \/ 180;\n}\n\nnamespace nt {\nnamespace gl {\n\nvoid setGLFrustum(GLdouble fovy, GLdouble aspect, GLdouble zNear, GLdouble zFar);\n\nvoid drawText(FTFont& font, const char* text, int yOffset);\n\ntemplate <typename Vector>\nvoid glVertex(const Vector& vec);\nvoid glVertex(const float& x, const float& y, const float& z);\nvoid glVertex(const double& x, const double& y, const double& z);\n\ntemplate <typename Vector>\nvoid glNormal(const Vector& vec);\nvoid glNormal(const float& x, const float& y, const float& z);\nvoid glNormal(const double& x, const double& y, const double& z);\n\ntemplate <typename Vector>\nvoid glTranslate(const Vector& vec);\nvoid glTranslate(const float& x, const float& y, const float& z);\nvoid glTranslate(const double& x, const double& y, const double& z);\n\ntemplate <typename Scalar>\nvoid glTransform(const Physical<Scalar>& physical);\n\ntemplate <typename Scalar>\nvoid glReverseTransform(const Physical<Scalar>& physical);\n\nvoid glScissor(const Box2<int>& screenArea);\n\nVector3<double> getAxisAngles(Vector3<double>& vec);\n\nvoid glViewport(const Box2<int>& viewArea);\n\n\/\/ Implementation follows:\n\ntemplate <typename Vector>\nvoid glVertex(const Vector& vec)\n{\n\tglVertex(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <typename Vector>\nvoid glNormal(const Vector& vec)\n{\n\tglNormal(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <typename Vector>\nvoid glTranslate(const Vector& vec)\n{\n glTranslate(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <class T, class U>\nvoid glRotateRadians(const Vector3<T, U>& vec)\n{\n glRotated(vec.z() * TO_DEGREES, 0, 0, 1);\n glRotated(vec.x() * TO_DEGREES, 1, 0, 0);\n \/\/glRotated(vec.y() * TO_DEGREES, 0, 1, 0);\n\n}\n\ntemplate <class T, class U>\nvoid glRotateDegrees(const Vector3<T, U>& vec)\n{\n glRotated(vec.z(), 0, 0, 1);\n glRotated(vec.x(), 1, 0, 0);\n \/\/ glRotated(vec.y(), 0, 1, 0);\n\n}\n\ntemplate <class U>\nvoid glRotateRadians(const Vector3<float, U>& vec)\n{\n glRotatef(vec.z() * TO_DEGREES, 0, 0, 1);\n glRotatef(vec.x() * TO_DEGREES, 1, 0, 0);\n \/\/glRotatef(vec.y() * TO_DEGREES, 0, 1, 0);\n\n}\n\ntemplate <class U>\nvoid glRotateDegrees(const Vector3<float, U>& vec)\n{\n glRotatef(vec.z(), 0, 0, 1);\n glRotatef(vec.x(), 1, 0, 0);\n \/\/ glRotatef(vec.y(), 0, 1, 0);\n\n}\n\/\/ these 2 functions are for the camera\n\/\/ backwards means everything flipped!\n\/\/ values are negative and x is rotated before z\ntemplate <class U>\nvoid glRotateRadiansBackwards(const Vector3<float, U>& vec)\n{\n glRotatef(-vec.x() * TO_DEGREES, 1, 0, 0);\n glRotatef(-vec.z() * TO_DEGREES, 0, 0, 1);\n}\ntemplate <class T, class U>\nvoid glRotateRadiansBackwards(const Vector3<T, U>& vec)\n{\n glRotated(-vec.x() * TO_DEGREES, 1, 0, 0);\n glRotated(-vec.z() * TO_DEGREES, 0, 0, 1);\n}\n\ntemplate <typename Scalar>\nvoid glTransform(const Physical<Scalar>& physical)\n{\n glTranslate(physical.getPosition());\n glRotateRadians(physical.getRotation());\n}\n\ntemplate <typename Scalar>\nvoid glReverseTransform(const Physical<Scalar>& physical)\n{\n glRotateRadians(physical.getRotation());\n glTranslate(-physical.getPosition());\n}\n\n} \/\/ namespace gl\n} \/\/ namespace nt\n\n#endif \/\/ UTIL_H\n<commit_msg>Ignore Z-axis rotation, not Y-axis rotation<commit_after>#ifndef UTIL_H\n#define UTIL_H\n\n#include <GL\/gl.h>\n#include <cmath>\n#include <FTGL\/ftgl.h>\n\n#include \"..\/Vector3.hpp\"\n#include \"..\/Box2.hpp\"\n#include \"..\/Physical.hpp\"\n\n#include <boost\/math\/constants\/constants.hpp>\nusing namespace boost::math;\n\nnamespace {\nconst float TO_DEGREES = 180 \/ constants::pi<float>();\nconst float TO_RADIANS = constants::pi<float>() \/ 180;\n}\n\nnamespace nt {\nnamespace gl {\n\nvoid setGLFrustum(GLdouble fovy, GLdouble aspect, GLdouble zNear, GLdouble zFar);\n\nvoid drawText(FTFont& font, const char* text, int yOffset);\n\ntemplate <typename Vector>\nvoid glVertex(const Vector& vec);\nvoid glVertex(const float& x, const float& y, const float& z);\nvoid glVertex(const double& x, const double& y, const double& z);\n\ntemplate <typename Vector>\nvoid glNormal(const Vector& vec);\nvoid glNormal(const float& x, const float& y, const float& z);\nvoid glNormal(const double& x, const double& y, const double& z);\n\ntemplate <typename Vector>\nvoid glTranslate(const Vector& vec);\nvoid glTranslate(const float& x, const float& y, const float& z);\nvoid glTranslate(const double& x, const double& y, const double& z);\n\ntemplate <typename Scalar>\nvoid glTransform(const Physical<Scalar>& physical);\n\ntemplate <typename Scalar>\nvoid glReverseTransform(const Physical<Scalar>& physical);\n\nvoid glScissor(const Box2<int>& screenArea);\n\nVector3<double> getAxisAngles(Vector3<double>& vec);\n\nvoid glViewport(const Box2<int>& viewArea);\n\n\/\/ Implementation follows:\n\ntemplate <typename Vector>\nvoid glVertex(const Vector& vec)\n{\n\tglVertex(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <typename Vector>\nvoid glNormal(const Vector& vec)\n{\n\tglNormal(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <typename Vector>\nvoid glTranslate(const Vector& vec)\n{\n glTranslate(vec.x(), vec.y(), vec.z());\n}\n\ntemplate <class T, class U>\nvoid glRotateRadians(const Vector3<T, U>& vec)\n{\n \/\/glRotated(vec.z() * TO_DEGREES, 0, 0, 1);\n glRotated(vec.x() * TO_DEGREES, 1, 0, 0);\n glRotated(vec.y() * TO_DEGREES, 0, 1, 0);\n\n}\n\ntemplate <class T, class U>\nvoid glRotateDegrees(const Vector3<T, U>& vec)\n{\n \/\/glRotated(vec.z(), 0, 0, 1);\n glRotated(vec.x(), 1, 0, 0);\n glRotated(vec.y(), 0, 1, 0);\n\n}\n\ntemplate <class U>\nvoid glRotateRadians(const Vector3<float, U>& vec)\n{\n \/\/glRotatef(vec.z() * TO_DEGREES, 0, 0, 1);\n glRotatef(vec.x() * TO_DEGREES, 1, 0, 0);\n glRotatef(vec.y() * TO_DEGREES, 0, 1, 0);\n\n}\n\ntemplate <class U>\nvoid glRotateDegrees(const Vector3<float, U>& vec)\n{\n \/\/glRotatef(vec.z(), 0, 0, 1);\n glRotatef(vec.x(), 1, 0, 0);\n glRotatef(vec.y(), 0, 1, 0);\n\n}\n\/\/ these 2 functions are for the camera\n\/\/ backwards means everything flipped!\n\/\/ values are negative and x is rotated before z\ntemplate <class U>\nvoid glRotateRadiansBackwards(const Vector3<float, U>& vec)\n{\n glRotatef(-vec.x() * TO_DEGREES, 1, 0, 0);\n glRotatef(-vec.y() * TO_DEGREES, 0, 1, 0);\n}\ntemplate <class T, class U>\nvoid glRotateRadiansBackwards(const Vector3<T, U>& vec)\n{\n glRotated(-vec.x() * TO_DEGREES, 1, 0, 0);\n glRotated(-vec.y() * TO_DEGREES, 0, 1, 0);\n}\n\ntemplate <typename Scalar>\nvoid glTransform(const Physical<Scalar>& physical)\n{\n glTranslate(physical.getPosition());\n glRotateRadians(physical.getRotation());\n}\n\ntemplate <typename Scalar>\nvoid glReverseTransform(const Physical<Scalar>& physical)\n{\n glRotateRadians(physical.getRotation());\n glTranslate(-physical.getPosition());\n}\n\n} \/\/ namespace gl\n} \/\/ namespace nt\n\n#endif \/\/ UTIL_H\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 2014 ETH Zurich\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n** following conditions are met:\n**\n** * Redistributions of source code must retain the above copyright notice, this list of conditions and the following\n** disclaimer.\n** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n** following disclaimer in the documentation and\/or other materials provided with the distribution.\n** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n** derived from this software without specific prior written permission.\n**\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n**\n***********************************************************************************************************************\/\n\n#include \"nodes\/Reference.h\"\n#include \"commands\/FieldSet.h\"\n#include \"model\/TreeManager.h\"\n#include \"ModelException.h\"\n#include \"NameText.h\"\n\n#include \"ModelBase\/src\/nodes\/TypedListDefinition.h\"\nDEFINE_TYPED_LIST(Model::Reference)\n\nnamespace Model {\n\nNODE_DEFINE_TYPE_REGISTRATION_METHODS(Reference)\n\nQList<Reference*> Reference::allReferences_;\nQSet<Reference*> Reference::pendingResolution_;\nQList<std::function<void (Node* subTree)>> Reference::unresolutionSteps_;\n\nReference::Reference(Node *parent) : Super(parent)\n{\n\tallReferences_.append(this);\n\tif (parent && parent->manager()) pendingResolution_.insert(this);\n}\n\nReference::Reference(Node *parent, PersistentStore &store, bool) : Super(parent)\n{\n\tallReferences_.append(this);\n\tname_ = store.loadReferenceValue(this);\n\tif (state_ == ReferenceNeedsToBeResolved && parent && parent->manager())\n\t\tpendingResolution_.insert(this);\n}\n\nReference::~Reference()\n{\n\tpendingResolution_.remove(this);\n\tallReferences_.removeAll(this);\n}\n\nvoid Reference::setName(const QString &name)\n{\n\tif (name != name_)\n\t{\n\t\texecute(new FieldSet<QString> (this, name_, name));\n\t\ttarget_ = nullptr;\n\t\tsetResolutionNeeded();\n\t}\n}\n\nNode* Reference::computeTarget() const\n{\n\tQ_ASSERT(false && \"Should not call Reference::computeTarget()\");\n\treturn nullptr;\n}\n\nbool Reference::resolveHelper(bool indirect)\n{\n\t\/\/ TODO this is not multithread friendly.\n\tif (state_ != ReferenceNeedsToBeResolved) return isResolved();\n\tstate_ = ReferenceIsBeingResolved;\n\n\tauto newTarget = computeTarget();\n\n\t\/\/TODO@cyril What is this for?\n\/\/\tQ_ASSERT(!newTarget || (newTarget->definesSymbol() && newTarget->symbolName() == name_));\n\n\tauto oldTarget = target_;\n\ttarget_ = newTarget;\n\n\tif (target_ || !indirect)\n\t{\n\t\t\/\/ This is needed because of the following situation.\n\t\t\/\/ We are resolving a reference A, and during the process we explore reference B, needed for the resolution of A,\n\t\t\/\/ and reference C, which is not needed for the resolution of A. All references but A will be explored indirectly.\n\t\t\/\/ It could happen that to resolve C properly we need to resolve A first. Therefore when failing to resolve a\n\t\t\/\/ reference that is explored indirectly, we shouldn't assume that resolution will fail.\n\t\tpendingResolution_.remove(this);\n\t\tstate_ = ReferenceEstablished;\n\t}\n\telse state_ = ReferenceNeedsToBeResolved;\n\n\tif (oldTarget != target_) targetChanged(oldTarget);\n\n\treturn isResolved();\n}\n\nvoid Reference::targetChanged(Node*){}\n\nvoid Reference::save(PersistentStore &store) const\n{\n\tstore.saveReferenceValue(name_, target_);\n}\n\nvoid Reference::load(PersistentStore &store)\n{\n\t\/\/ TODO: Implement reference loading properly.\n\tthrow ModelException(\"Loading references outside a Reference constructor is not properly implemented yet\");\n\n\tif (store.currentNodeType() != typeName())\n\t\tthrow ModelException(\"Trying to load a Reference node from an incompatible node type \" + store.currentNodeType());\n\n\tsetName( store.loadReferenceValue(this) );\n}\n\nNode* Reference::target()\n{\n\tif (state_ == ReferenceNeedsToBeResolved) resolveHelper(true);\n\treturn state_ == ReferenceEstablished ? target_ : nullptr;\n}\n\nvoid Reference::setResolutionNeeded()\n{\n\tstate_ = ReferenceNeedsToBeResolved;\n\tpendingResolution_.insert(this);\n}\n\ntemplate<class NodeType>\nvoid Reference::forAll(Node* subTree, std::function<void (NodeType*)> function)\n{\n\tif (subTree)\n\t{\n\t\tQList<Node*> stack;\n\t\tstack << subTree;\n\t\twhile (!stack.isEmpty())\n\t\t{\n\t\t\tauto top = stack.takeLast();\n\n\t\t\tif (auto node = DCast<NodeType>(top) ) function(node);\n\t\t\telse stack.append(top->children());\n\t\t}\n\t}\n}\n\nvoid Reference::unresolveReferencesHelper(Node* subTree, bool all,\n\tconst QSet<QString>& names)\n{\n\tif (!subTree || (!all && names.isEmpty())) return;\n\n\tauto targetManager = subTree->manager();\n\tbool isRoot = !subTree->parent();\n\n\tstd::function<void (Reference*)> f;\n\tif (all)\n\t{\n\t\tf = [](Reference* ref) { ref->setResolutionNeeded();};\n\t}\n\telse\n\t{\n\t\tif (names.size() == 2)\n\t\t{\n\t\t\t\/\/This case occurs when changing a name. This happens when the user is typing and therefore it is very\n\t\t\t\/\/performance sensitive. Thus we optimize it specially.\n\n\t\t\tQString first = *names.begin();\n\t\t\tQString second = *++names.begin();\n\n\t\t\t\/\/ Removing this if, and just leaving the statement at the of this method to handle the updates using the\n\t\t\t\/\/ defined f function is slow. In one test an additional 4-5ms were needed on top of the 10-13ms processing\n\t\t\t\/\/ time on a 3.4GHz CPU. Therefore there is a significant cost associated with calling the f function, and\n\t\t\t\/\/ it's betterto just process this case here directly.\n\t\t\t\/\/ If needed this optimization could also be used in the other cases.\n\t\t\tif (isRoot)\n\t\t\t{\n\t\t\t\tfor (auto ref : allReferences_)\n\t\t\t\t\tif (targetManager == ref->manager())\n\t\t\t\t\t{\n\t\t\t\t\t\tauto& refName = ref->name();\n\t\t\t\t\t\tif (refName == first || refName == second)\n\t\t\t\t\t\t\tref->setResolutionNeeded();\n\t\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tf = [=](Reference* ref)\n\t\t\t\t{ auto& refName = ref->name(); if (refName == first || refName == second) ref->setResolutionNeeded();};\n\t\t}\n\t\telse if (names.size() < 20) \/\/ Optimize in the case of just a few names, by avoiding hasing.\n\t\t{\n\t\t\t\/\/ TODO: Find out what's a good value for the magick number 20 above.\n\t\t\tQMap<QString, int> mapNames;\n\t\t\tfor (auto n : names) mapNames.insert(n, 0); \/\/ TODO: isn't there a way to put void here?\n\n\t\t\tf = [=](Reference* ref) { if (mapNames.contains(ref->name())) ref->setResolutionNeeded();};\n\t\t}\n\t\telse\n\t\t{\n\t\t\tf = [=](Reference* ref) { if (names.contains(ref->name())) ref->setResolutionNeeded();};\n\t\t}\n\t}\n\n\tif (isRoot)\n\t{\n\t\tfor (auto ref : allReferences_) if (targetManager == ref->manager()) f(ref);\n\t}\n\telse\n\t{\n\t\t\/\/ If this is not the root, then explore the references only in the specified subTree, which is faster\n\t\tforAll<Reference>(subTree, f);\n\t}\n\n\n}\n\nvoid Reference::unresolveAll(Node* subTree)\n{\n\tunresolveReferencesHelper(subTree, true, {});\n}\n\nvoid Reference::unresolveNames(Node* subTree, const QSet<QString>& names)\n{\n\tunresolveReferencesHelper(subTree, false, names);\n}\n\nvoid Reference::unresolveIfNameIntroduced(Node* subTreeToUnresolve,\n\t\tNode* subTreeToLookForNewNames)\n{\n\tQSet<QString> names;\n\tforAll<NameText>(subTreeToLookForNewNames, [&names](NameText* name){ names.insert(name->get());});\n\tunresolveReferencesHelper(subTreeToUnresolve, false, names);\n}\n\nvoid Reference::unresolveAfterNewSubTree(Node* subTree)\n{\n\tReference::unresolveAll(subTree);\n\tReference::unresolveIfNameIntroduced(subTree->root(), subTree);\n\tfor (auto step : unresolutionSteps_) step(subTree);\n}\n\nvoid Reference::addUnresolutionSteps(std::function<void (Node* subTree)> step)\n{\n\tunresolutionSteps_.append(step);\n}\n\nvoid Reference::resolvePending()\n{\n\tlog.debug(\"Resolving references\");\n\n\tint i = 0;\n\tint round = 0;\n\tint resolved = 0;\n\tauto pending = pendingResolution_;\n\n\twhile (!pending.isEmpty())\n\t{\n\t\tlog.debug(\"resolution round \" + QString::number(round) + \", \"\n\t\t\t\t\t + QString::number(pendingResolution_.size()) + \" references pending.\");\n\t\t++round;\n\n\t\tfor (auto r : pending)\n\t\t{\n\t\t\tif ( r->resolve() ) ++resolved;\n\t\t\tif (++i % 10000 == 0)\tlog.debug(\"Processed \" + QString::number(i) + \" references.\");\n\t\t}\n\n\t\t\/\/ As a result of resolution of some references, some other references could have become invalid.\n\t\tpending = pendingResolution_;\n\t}\n\n\tlog.debug(QString::number(resolved) + \" resolution\" + (resolved == 1 ? \"\" : \"s\") + \" in \"\n\t\t\t\t + QString::number(round) + (round > 1 ? \" rounds.\" : \" round.\"));\n\n\tint totalResolvedReferences = 0;\n\tfor (auto r : allReferences_) if (r->isResolved()) ++totalResolvedReferences;\n\tlog.debug(\"Total number of resolved references: \" + QString::number(totalResolvedReferences));\n}\n\n}\n<commit_msg>Uncomment Q_ASSERT<commit_after>\/***********************************************************************************************************************\n**\n** Copyright (c) 2011, 2014 ETH Zurich\n** All rights reserved.\n**\n** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n** following conditions are met:\n**\n** * Redistributions of source code must retain the above copyright notice, this list of conditions and the following\n** disclaimer.\n** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n** following disclaimer in the documentation and\/or other materials provided with the distribution.\n** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n** derived from this software without specific prior written permission.\n**\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n**\n***********************************************************************************************************************\/\n\n#include \"nodes\/Reference.h\"\n#include \"commands\/FieldSet.h\"\n#include \"model\/TreeManager.h\"\n#include \"ModelException.h\"\n#include \"NameText.h\"\n\n#include \"ModelBase\/src\/nodes\/TypedListDefinition.h\"\nDEFINE_TYPED_LIST(Model::Reference)\n\nnamespace Model {\n\nNODE_DEFINE_TYPE_REGISTRATION_METHODS(Reference)\n\nQList<Reference*> Reference::allReferences_;\nQSet<Reference*> Reference::pendingResolution_;\nQList<std::function<void (Node* subTree)>> Reference::unresolutionSteps_;\n\nReference::Reference(Node *parent) : Super(parent)\n{\n\tallReferences_.append(this);\n\tif (parent && parent->manager()) pendingResolution_.insert(this);\n}\n\nReference::Reference(Node *parent, PersistentStore &store, bool) : Super(parent)\n{\n\tallReferences_.append(this);\n\tname_ = store.loadReferenceValue(this);\n\tif (state_ == ReferenceNeedsToBeResolved && parent && parent->manager())\n\t\tpendingResolution_.insert(this);\n}\n\nReference::~Reference()\n{\n\tpendingResolution_.remove(this);\n\tallReferences_.removeAll(this);\n}\n\nvoid Reference::setName(const QString &name)\n{\n\tif (name != name_)\n\t{\n\t\texecute(new FieldSet<QString> (this, name_, name));\n\t\ttarget_ = nullptr;\n\t\tsetResolutionNeeded();\n\t}\n}\n\nNode* Reference::computeTarget() const\n{\n\tQ_ASSERT(false && \"Should not call Reference::computeTarget()\");\n\treturn nullptr;\n}\n\nbool Reference::resolveHelper(bool indirect)\n{\n\t\/\/ TODO this is not multithread friendly.\n\tif (state_ != ReferenceNeedsToBeResolved) return isResolved();\n\tstate_ = ReferenceIsBeingResolved;\n\n\tauto newTarget = computeTarget();\n\n\tQ_ASSERT(!newTarget || (newTarget->definesSymbol() && newTarget->symbolName() == name_));\n\n\tauto oldTarget = target_;\n\ttarget_ = newTarget;\n\n\tif (target_ || !indirect)\n\t{\n\t\t\/\/ This is needed because of the following situation.\n\t\t\/\/ We are resolving a reference A, and during the process we explore reference B, needed for the resolution of A,\n\t\t\/\/ and reference C, which is not needed for the resolution of A. All references but A will be explored indirectly.\n\t\t\/\/ It could happen that to resolve C properly we need to resolve A first. Therefore when failing to resolve a\n\t\t\/\/ reference that is explored indirectly, we shouldn't assume that resolution will fail.\n\t\tpendingResolution_.remove(this);\n\t\tstate_ = ReferenceEstablished;\n\t}\n\telse state_ = ReferenceNeedsToBeResolved;\n\n\tif (oldTarget != target_) targetChanged(oldTarget);\n\n\treturn isResolved();\n}\n\nvoid Reference::targetChanged(Node*){}\n\nvoid Reference::save(PersistentStore &store) const\n{\n\tstore.saveReferenceValue(name_, target_);\n}\n\nvoid Reference::load(PersistentStore &store)\n{\n\t\/\/ TODO: Implement reference loading properly.\n\tthrow ModelException(\"Loading references outside a Reference constructor is not properly implemented yet\");\n\n\tif (store.currentNodeType() != typeName())\n\t\tthrow ModelException(\"Trying to load a Reference node from an incompatible node type \" + store.currentNodeType());\n\n\tsetName( store.loadReferenceValue(this) );\n}\n\nNode* Reference::target()\n{\n\tif (state_ == ReferenceNeedsToBeResolved) resolveHelper(true);\n\treturn state_ == ReferenceEstablished ? target_ : nullptr;\n}\n\nvoid Reference::setResolutionNeeded()\n{\n\tstate_ = ReferenceNeedsToBeResolved;\n\tpendingResolution_.insert(this);\n}\n\ntemplate<class NodeType>\nvoid Reference::forAll(Node* subTree, std::function<void (NodeType*)> function)\n{\n\tif (subTree)\n\t{\n\t\tQList<Node*> stack;\n\t\tstack << subTree;\n\t\twhile (!stack.isEmpty())\n\t\t{\n\t\t\tauto top = stack.takeLast();\n\n\t\t\tif (auto node = DCast<NodeType>(top) ) function(node);\n\t\t\telse stack.append(top->children());\n\t\t}\n\t}\n}\n\nvoid Reference::unresolveReferencesHelper(Node* subTree, bool all,\n\tconst QSet<QString>& names)\n{\n\tif (!subTree || (!all && names.isEmpty())) return;\n\n\tauto targetManager = subTree->manager();\n\tbool isRoot = !subTree->parent();\n\n\tstd::function<void (Reference*)> f;\n\tif (all)\n\t{\n\t\tf = [](Reference* ref) { ref->setResolutionNeeded();};\n\t}\n\telse\n\t{\n\t\tif (names.size() == 2)\n\t\t{\n\t\t\t\/\/This case occurs when changing a name. This happens when the user is typing and therefore it is very\n\t\t\t\/\/performance sensitive. Thus we optimize it specially.\n\n\t\t\tQString first = *names.begin();\n\t\t\tQString second = *++names.begin();\n\n\t\t\t\/\/ Removing this if, and just leaving the statement at the of this method to handle the updates using the\n\t\t\t\/\/ defined f function is slow. In one test an additional 4-5ms were needed on top of the 10-13ms processing\n\t\t\t\/\/ time on a 3.4GHz CPU. Therefore there is a significant cost associated with calling the f function, and\n\t\t\t\/\/ it's betterto just process this case here directly.\n\t\t\t\/\/ If needed this optimization could also be used in the other cases.\n\t\t\tif (isRoot)\n\t\t\t{\n\t\t\t\tfor (auto ref : allReferences_)\n\t\t\t\t\tif (targetManager == ref->manager())\n\t\t\t\t\t{\n\t\t\t\t\t\tauto& refName = ref->name();\n\t\t\t\t\t\tif (refName == first || refName == second)\n\t\t\t\t\t\t\tref->setResolutionNeeded();\n\t\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tf = [=](Reference* ref)\n\t\t\t\t{ auto& refName = ref->name(); if (refName == first || refName == second) ref->setResolutionNeeded();};\n\t\t}\n\t\telse if (names.size() < 20) \/\/ Optimize in the case of just a few names, by avoiding hasing.\n\t\t{\n\t\t\t\/\/ TODO: Find out what's a good value for the magick number 20 above.\n\t\t\tQMap<QString, int> mapNames;\n\t\t\tfor (auto n : names) mapNames.insert(n, 0); \/\/ TODO: isn't there a way to put void here?\n\n\t\t\tf = [=](Reference* ref) { if (mapNames.contains(ref->name())) ref->setResolutionNeeded();};\n\t\t}\n\t\telse\n\t\t{\n\t\t\tf = [=](Reference* ref) { if (names.contains(ref->name())) ref->setResolutionNeeded();};\n\t\t}\n\t}\n\n\tif (isRoot)\n\t{\n\t\tfor (auto ref : allReferences_) if (targetManager == ref->manager()) f(ref);\n\t}\n\telse\n\t{\n\t\t\/\/ If this is not the root, then explore the references only in the specified subTree, which is faster\n\t\tforAll<Reference>(subTree, f);\n\t}\n\n\n}\n\nvoid Reference::unresolveAll(Node* subTree)\n{\n\tunresolveReferencesHelper(subTree, true, {});\n}\n\nvoid Reference::unresolveNames(Node* subTree, const QSet<QString>& names)\n{\n\tunresolveReferencesHelper(subTree, false, names);\n}\n\nvoid Reference::unresolveIfNameIntroduced(Node* subTreeToUnresolve,\n\t\tNode* subTreeToLookForNewNames)\n{\n\tQSet<QString> names;\n\tforAll<NameText>(subTreeToLookForNewNames, [&names](NameText* name){ names.insert(name->get());});\n\tunresolveReferencesHelper(subTreeToUnresolve, false, names);\n}\n\nvoid Reference::unresolveAfterNewSubTree(Node* subTree)\n{\n\tReference::unresolveAll(subTree);\n\tReference::unresolveIfNameIntroduced(subTree->root(), subTree);\n\tfor (auto step : unresolutionSteps_) step(subTree);\n}\n\nvoid Reference::addUnresolutionSteps(std::function<void (Node* subTree)> step)\n{\n\tunresolutionSteps_.append(step);\n}\n\nvoid Reference::resolvePending()\n{\n\tlog.debug(\"Resolving references\");\n\n\tint i = 0;\n\tint round = 0;\n\tint resolved = 0;\n\tauto pending = pendingResolution_;\n\n\twhile (!pending.isEmpty())\n\t{\n\t\tlog.debug(\"resolution round \" + QString::number(round) + \", \"\n\t\t\t\t\t + QString::number(pendingResolution_.size()) + \" references pending.\");\n\t\t++round;\n\n\t\tfor (auto r : pending)\n\t\t{\n\t\t\tif ( r->resolve() ) ++resolved;\n\t\t\tif (++i % 10000 == 0)\tlog.debug(\"Processed \" + QString::number(i) + \" references.\");\n\t\t}\n\n\t\t\/\/ As a result of resolution of some references, some other references could have become invalid.\n\t\tpending = pendingResolution_;\n\t}\n\n\tlog.debug(QString::number(resolved) + \" resolution\" + (resolved == 1 ? \"\" : \"s\") + \" in \"\n\t\t\t\t + QString::number(round) + (round > 1 ? \" rounds.\" : \" round.\"));\n\n\tint totalResolvedReferences = 0;\n\tfor (auto r : allReferences_) if (r->isResolved()) ++totalResolvedReferences;\n\tlog.debug(\"Total number of resolved references: \" + QString::number(totalResolvedReferences));\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- llvm\/unittest\/Support\/ManagedStatic.cpp - ManagedStatic tests ------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/Threading.h\"\n#ifdef HAVE_PTHREAD_H\n#include <pthread.h>\n#endif\n\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\n#ifdef HAVE_PTHREAD_H\nnamespace test1 {\n llvm::ManagedStatic<int> ms;\n void *helper(void*) {\n *ms;\n return NULL;\n }\n\n \/\/ Valgrind's leak checker complains glibc's stack allocation.\n \/\/ To appease valgrind, we provide our own stack for each thread.\n void *allocate_stack(pthread_attr_t &a, size_t n = 65536) {\n void *stack = malloc(n);\n pthread_attr_init(&a);\n#if defined(__linux__)\n pthread_attr_setstack(&a, stack, n);\n#endif\n return stack;\n }\n}\n\nTEST(Initialize, MultipleThreads) {\n \/\/ Run this test under tsan: http:\/\/code.google.com\/p\/data-race-test\/\n\n pthread_attr_t a1, a2;\n void *p1 = test1::allocate_stack(a1);\n void *p2 = test1::allocate_stack(a2);\n\n llvm_start_multithreaded();\n pthread_t t1, t2;\n pthread_create(&t1, &a1, test1::helper, NULL);\n pthread_create(&t2, &a2, test1::helper, NULL);\n pthread_join(t1, NULL);\n pthread_join(t2, NULL);\n free(p1);\n free(p2);\n llvm_stop_multithreaded();\n}\n#endif\n\n} \/\/ anonymous namespace\n<commit_msg>Disable Initialize.MultipleThreads test under MemorySanitizer.<commit_after>\/\/===- llvm\/unittest\/Support\/ManagedStatic.cpp - ManagedStatic tests ------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n#include \"llvm\/Support\/ManagedStatic.h\"\n#include \"llvm\/Config\/config.h\"\n#include \"llvm\/Support\/Threading.h\"\n#ifdef HAVE_PTHREAD_H\n#include <pthread.h>\n#endif\n\n#include \"gtest\/gtest.h\"\n\nusing namespace llvm;\n\nnamespace {\n\n#if defined(HAVE_PTHREAD_H) && !__has_feature(memory_sanitizer)\nnamespace test1 {\n llvm::ManagedStatic<int> ms;\n void *helper(void*) {\n *ms;\n return NULL;\n }\n\n \/\/ Valgrind's leak checker complains glibc's stack allocation.\n \/\/ To appease valgrind, we provide our own stack for each thread.\n void *allocate_stack(pthread_attr_t &a, size_t n = 65536) {\n void *stack = malloc(n);\n pthread_attr_init(&a);\n#if defined(__linux__)\n pthread_attr_setstack(&a, stack, n);\n#endif\n return stack;\n }\n}\n\nTEST(Initialize, MultipleThreads) {\n \/\/ Run this test under tsan: http:\/\/code.google.com\/p\/data-race-test\/\n\n pthread_attr_t a1, a2;\n void *p1 = test1::allocate_stack(a1);\n void *p2 = test1::allocate_stack(a2);\n\n llvm_start_multithreaded();\n pthread_t t1, t2;\n pthread_create(&t1, &a1, test1::helper, NULL);\n pthread_create(&t2, &a2, test1::helper, NULL);\n pthread_join(t1, NULL);\n pthread_join(t2, NULL);\n free(p1);\n free(p2);\n llvm_stop_multithreaded();\n}\n#endif\n\n} \/\/ anonymous namespace\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n* Software License Agreement (BSD License)\n* \n* Copyright (c) 2008, Willow Garage, Inc.\n* All rights reserved.\n* \n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n* \n* * Redstributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of the Willow Garage nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n* \n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Wim Meeussen *\/\n\n#include \"urdf_parser\/urdf_parser.h\"\n#include <iostream>\n#include <fstream>\n\nusing namespace urdf;\nusing namespace std;\n\nvoid addChildLinkNames(boost::shared_ptr<const Link> link, ofstream& os)\n{\n os << \"\\\"\" << link->name << \"\\\" [label=\\\"\" << link->name << \"\\\"];\" << endl;\n for (std::vector<boost::shared_ptr<Link> >::const_iterator child = link->child_links.begin(); child != link->child_links.end(); child++)\n addChildLinkNames(*child, os);\n}\n\nvoid addChildJointNames(boost::shared_ptr<const Link> link, ofstream& os)\n{\n double r, p, y;\n for (std::vector<boost::shared_ptr<Link> >::const_iterator child = link->child_links.begin(); child != link->child_links.end(); child++){\n (*child)->parent_joint->parent_to_joint_origin_transform.rotation.getRPY(r,p,y);\n os << \"\\\"\" << link->name << \"\\\" -> \\\"\" << (*child)->parent_joint->name \n << \"\\\" [label=\\\"xyz: \"\n << (*child)->parent_joint->parent_to_joint_origin_transform.position.x << \" \" \n << (*child)->parent_joint->parent_to_joint_origin_transform.position.y << \" \" \n << (*child)->parent_joint->parent_to_joint_origin_transform.position.z << \" \" \n << \"\\\\nrpy: \" << r << \" \" << p << \" \" << y << \"\\\"]\" << endl;\n os << \"\\\"\" << (*child)->parent_joint->name << \"\\\" -> \\\"\" << (*child)->name << \"\\\"\" << endl;\n addChildJointNames(*child, os);\n }\n}\n\n\nvoid printTree(boost::shared_ptr<const Link> link, string file)\n{\n std::ofstream os;\n os.open(file.c_str());\n os << \"digraph G {\" << endl;\n\n os << \"node [shape=box];\" << endl;\n addChildLinkNames(link, os);\n\n os << \"node [shape=ellipse, color=blue, fontcolor=blue];\" << endl;\n addChildJointNames(link, os);\n\n os << \"}\" << endl;\n os.close();\n}\n\n\n\nint main(int argc, char** argv)\n{\n if (argc != 2){\n std::cerr << \"Usage: urdf_to_graphiz input.xml\" << std::endl;\n return -1;\n }\n\n \/\/ get the entire file\n std::string xml_string;\n std::fstream xml_file(argv[1], std::fstream::in);\n while ( xml_file.good() )\n {\n std::string line;\n std::getline( xml_file, line);\n xml_string += (line + \"\\n\");\n }\n xml_file.close();\n\n boost::shared_ptr<ModelInterface> robot = parseURDF(xml_string);\n if (!robot){\n std::cerr << \"ERROR: Model Parsing the xml failed\" << std::endl;\n return -1;\n }\n string output = robot->getName();\n\n \/\/ print entire tree to file\n printTree(robot->getRoot(), output+\".gv\");\n cout << \"Created file \" << output << \".gv\" << endl;\n\n string command = \"dot -Tpdf \"+output+\".gv -o \"+output+\".pdf\";\n if (system(command.c_str()) != -1)\n cout << \"Created file \" << output << \".pdf\" << endl;\n else\n cout << \"There was an error executing '\" << command << \"'\" << endl;\n return 0;\n}\n\n<commit_msg>[urdf_to_graphiz] print in green non-fixed joints<commit_after>\/*********************************************************************\n* Software License Agreement (BSD License)\n* \n* Copyright (c) 2008, Willow Garage, Inc.\n* All rights reserved.\n* \n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n* \n* * Redstributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of the Willow Garage nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n* \n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*********************************************************************\/\n\n\/* Author: Wim Meeussen *\/\n\n#include \"urdf_parser\/urdf_parser.h\"\n#include <iostream>\n#include <fstream>\n\nusing namespace urdf;\nusing namespace std;\n\nvoid addChildLinkNames(boost::shared_ptr<const Link> link, ofstream& os)\n{\n os << \"\\\"\" << link->name << \"\\\" [label=\\\"\" << link->name << \"\\\"];\" << endl;\n for (std::vector<boost::shared_ptr<Link> >::const_iterator child = link->child_links.begin(); child != link->child_links.end(); child++)\n addChildLinkNames(*child, os);\n}\n\nvoid addChildJointNames(boost::shared_ptr<const Link> link, ofstream& os)\n{\n double r, p, y;\n for (std::vector<boost::shared_ptr<Link> >::const_iterator child = link->child_links.begin(); child != link->child_links.end(); child++){\n \/\/ use blue for fixed joint and green for not-fixed joints\n if( (*child)->parent_joint->type != Joint::FIXED ) {\n os << \"\\\"\" << (*child)->parent_joint->name << \"\\\" [color=green, fontcolor=green];\" << endl;\n }\n\n (*child)->parent_joint->parent_to_joint_origin_transform.rotation.getRPY(r,p,y);\n os << \"\\\"\" << link->name << \"\\\" -> \\\"\" << (*child)->parent_joint->name \n << \"\\\" [label=\\\"xyz: \"\n << (*child)->parent_joint->parent_to_joint_origin_transform.position.x << \" \" \n << (*child)->parent_joint->parent_to_joint_origin_transform.position.y << \" \" \n << (*child)->parent_joint->parent_to_joint_origin_transform.position.z << \" \" \n << \"\\\\nrpy: \" << r << \" \" << p << \" \" << y << \"\\\"]\" << endl;\n os << \"\\\"\" << (*child)->parent_joint->name << \"\\\" -> \\\"\" << (*child)->name << \"\\\"\" << endl;\n addChildJointNames(*child, os);\n }\n}\n\n\nvoid printTree(boost::shared_ptr<const Link> link, string file)\n{\n std::ofstream os;\n os.open(file.c_str());\n os << \"digraph G {\" << endl;\n\n os << \"node [shape=box];\" << endl;\n addChildLinkNames(link, os);\n\n os << \"node [shape=ellipse, color=blue, fontcolor=blue];\" << endl;\n addChildJointNames(link, os);\n\n os << \"}\" << endl;\n os.close();\n}\n\n\n\nint main(int argc, char** argv)\n{\n if (argc != 2){\n std::cerr << \"Usage: urdf_to_graphiz input.xml\" << std::endl;\n return -1;\n }\n\n \/\/ get the entire file\n std::string xml_string;\n std::fstream xml_file(argv[1], std::fstream::in);\n while ( xml_file.good() )\n {\n std::string line;\n std::getline( xml_file, line);\n xml_string += (line + \"\\n\");\n }\n xml_file.close();\n\n boost::shared_ptr<ModelInterface> robot = parseURDF(xml_string);\n if (!robot){\n std::cerr << \"ERROR: Model Parsing the xml failed\" << std::endl;\n return -1;\n }\n string output = robot->getName();\n\n \/\/ print entire tree to file\n printTree(robot->getRoot(), output+\".gv\");\n cout << \"Created file \" << output << \".gv\" << endl;\n\n string command = \"dot -Tpdf \"+output+\".gv -o \"+output+\".pdf\";\n if (system(command.c_str()) != -1)\n cout << \"Created file \" << output << \".pdf\" << endl;\n else\n cout << \"There was an error executing '\" << command << \"'\" << endl;\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: JDriver.cxx,v $\n *\n * $Revision: 1.16 $\n *\n * last change: $Author: oj $ $Date: 2001-05-31 08:32:48 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVER_HXX_\n#include \"java\/sql\/Driver.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#include \"java\/lang\/Object.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_LANG_CLASS_HXX_\n#include \"java\/lang\/Class.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVERMANAGER_HXX_\n#include \"java\/sql\/DriverManager.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVERPOPERTYINFO_HXX_\n#include \"java\/sql\/DriverPropertyInfo.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_CONNECTION_HXX_\n#include \"java\/sql\/Connection.hxx\"\n#endif\n#include \"java\/util\/Property.hxx\"\n#ifndef _CONNECTIVITY_JAVA_TOOLS_HXX_\n#include \"java\/tools.hxx\"\n#endif\n\nusing namespace connectivity;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\/\/ using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\n\/\/ -------------------------------------------------------------------------\njava_sql_Driver::java_sql_Driver(const Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory)\n : java_lang_Object(_rxFactory)\n{\n\/\/ SDBThreadAttach t; OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n\/\/ \/\/ this object is not the right one\n\/\/ if(t.pEnv)\n\/\/ t.pEnv->DeleteGlobalRef( object );\n\/\/ object = 0;\n}\n\/\/ --------------------------------------------------------------------------------\njclass java_sql_Driver::theClass = 0;\n\/\/ --------------------------------------------------------------------------------\njava_sql_Driver::~java_sql_Driver()\n{}\n\/\/ static ServiceInfo\n\/\/------------------------------------------------------------------------------\nrtl::OUString java_sql_Driver::getImplementationName_Static( ) throw(RuntimeException)\n{\n return ::rtl::OUString::createFromAscii(\"com.sun.star.comp.sdbc.JDBCDriver\");\n \/\/ this name is referenced in the configuration and in the jdbc.xml\n \/\/ Please take care when changing it.\n}\n\/\/------------------------------------------------------------------------------\nSequence< ::rtl::OUString > java_sql_Driver::getSupportedServiceNames_Static( ) throw (RuntimeException)\n{\n Sequence< ::rtl::OUString > aSNS( 1 );\n aSNS[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbc.Driver\");\n return aSNS;\n}\n\/\/------------------------------------------------------------------\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL connectivity::java_sql_Driver_CreateInstance(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) throw( ::com::sun::star::uno::Exception )\n{\n return *(new java_sql_Driver(_rxFactory));\n}\n\/\/ --------------------------------------------------------------------------------\n::rtl::OUString SAL_CALL java_sql_Driver::getImplementationName( ) throw(RuntimeException)\n{\n return getImplementationName_Static();\n}\n\n\/\/ --------------------------------------------------------------------------------\nsal_Bool SAL_CALL java_sql_Driver::supportsService( const ::rtl::OUString& _rServiceName ) throw(RuntimeException)\n{\n Sequence< ::rtl::OUString > aSupported(getSupportedServiceNames());\n const ::rtl::OUString* pSupported = aSupported.getConstArray();\n const ::rtl::OUString* pEnd = pSupported + aSupported.getLength();\n for (;pSupported != pEnd && !pSupported->equals(_rServiceName); ++pSupported)\n ;\n\n return pSupported != pEnd;\n}\n\n\/\/ --------------------------------------------------------------------------------\nSequence< ::rtl::OUString > SAL_CALL java_sql_Driver::getSupportedServiceNames( ) throw(RuntimeException)\n{\n return getSupportedServiceNames_Static();\n}\n\n\/\/ --------------------------------------------------------------------------------\njclass java_sql_Driver::getMyClass()\n{\n \/\/ die Klasse muss nur einmal geholt werden, daher statisch\n if( !theClass )\n {\n SDBThreadAttach t; OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv )\n {\n jclass tempClass = t.pEnv->FindClass(\"java\/sql\/Driver\");\n OSL_ENSURE(tempClass,\"Java : FindClass nicht erfolgreich!\");\n jclass globClass = (jclass)t.pEnv->NewGlobalRef( tempClass );\n t.pEnv->DeleteLocalRef( tempClass );\n saveClassRef( globClass );\n }\n }\n return theClass;\n}\n\/\/ --------------------------------------------------------------------------------\nvoid java_sql_Driver::saveClassRef( jclass pClass )\n{\n if( SDBThreadAttach::IsJavaErrorOccured() || pClass==0 )\n return;\n \/\/ der uebergebe Klassen-Handle ist schon global, daher einfach speichern\n theClass = pClass;\n}\n\/\/ -------------------------------------------------------------------------\nReference< XConnection > SAL_CALL java_sql_Driver::connect( const ::rtl::OUString& url, const\n Sequence< PropertyValue >& info ) throw(SQLException, RuntimeException)\n{\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n Reference< XConnection > xRet;\n \/\/ first try if the jdbc driver is alraedy registered at the driver manager\n try\n {\n if(!object)\n {\n const PropertyValue* pBegin = info.getConstArray();\n const PropertyValue* pEnd = pBegin + info.getLength();\n for(jsize i=0;pBegin != pEnd;++pBegin)\n {\n if(!pBegin->Name.compareToAscii(\"JavaDriverClass\"))\n {\n \/\/ here I try to find the class for jdbc driver\n java_sql_SQLException_BASE::getMyClass();\n java_lang_Throwable::getMyClass();\n\n ::rtl::OUString aStr;\n pBegin->Value >>= aStr;\n \/\/ the driver manager holds the class of the driver for later use\n \/\/ if forName didn't find the class it will throw an exception\n java_lang_Class *pDrvClass = java_lang_Class::forName(aStr);\n if(pDrvClass)\n {\n saveRef(t.pEnv, pDrvClass->newInstanceObject());\n delete pDrvClass;\n }\n break;\n }\n }\n }\n }\n catch(Exception&)\n {\n throw SQLException(::rtl::OUString::createFromAscii(\"The specified driver could not be loaded!\"),*this,::rtl::OUString(),1000,Any());\n }\n\n jobject out(0);\n\n if( t.pEnv )\n {\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"(Ljava\/lang\/String;Ljava\/util\/Properties;)Ljava\/sql\/Connection;\";\n char * cMethodName = \"connect\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n ThrowSQLException(t.pEnv,*this);\n if( mID )\n {\n jvalue args[2];\n \/\/ Parameter konvertieren\n args[0].l = convertwchar_tToJavaString(t.pEnv,url);\n java_util_Properties* pProps = createStringPropertyArray(t.pEnv,info);\n args[1].l = pProps->getJavaObject();\n\n out = t.pEnv->CallObjectMethod( object, mID, args[0].l,args[1].l );\n ThrowSQLException(t.pEnv,*this);\n \/\/ und aufraeumen\n t.pEnv->DeleteLocalRef((jstring)args[0].l);\n ThrowSQLException(t.pEnv,*this);\n delete pProps;\n } \/\/mID\n } \/\/t.pEnv\n \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n Reference< XConnection > xOut;\n return out==0 ? 0 : new java_sql_Connection( t.pEnv, out,this );\n \/\/ return xOut;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL java_sql_Driver::acceptsURL( const ::rtl::OUString& url ) throw(SQLException, RuntimeException)\n{\n \/\/ don't ask the real driver for the url\n \/\/ I feel responsible for all jdbc url's\n static const ::rtl::OUString s_sJdbcPrefix = ::rtl::OUString::createFromAscii(\"jdbc:\");\n return 0 == url.compareTo(s_sJdbcPrefix, 5);\n}\n\/\/ -------------------------------------------------------------------------\nSequence< DriverPropertyInfo > SAL_CALL java_sql_Driver::getPropertyInfo( const ::rtl::OUString& url,\n const Sequence< PropertyValue >& info ) throw(SQLException, RuntimeException)\n{\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if(!object)\n object = java_sql_DriverManager::getDriver(url);\n\n if(!object)\n {\n \/\/ one of these must throw an exception\n ThrowSQLException(t.pEnv,*this);\n throw SQLException(); \/\/ we need a object here\n }\n\n jobjectArray out(0);\n\n if( t.pEnv )\n {\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"(Ljava\/lang\/String;Ljava\/util\/Properties;)[Ljava\/sql\/DriverPropertyInfo;\";\n char * cMethodName = \"getPropertyInfo\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n {\n jvalue args[2];\n \/\/ Parameter konvertieren\n args[0].l = convertwchar_tToJavaString(t.pEnv,url);\n java_util_Properties* pProps = createStringPropertyArray(t.pEnv,info);\n args[1].l = pProps->getJavaObject();\n\n out = (jobjectArray)t.pEnv->CallObjectMethodA( object, mID, args );\n ThrowSQLException(t.pEnv,*this);\n \/\/ und aufraeumen\n t.pEnv->DeleteLocalRef((jstring)args[0].l);\n delete pProps;\n } \/\/mID\n } \/\/t.pEnv\n \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n return copyArrayAndDelete( t.pEnv, out, DriverPropertyInfo(),java_sql_DriverPropertyInfo(NULL,NULL));\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL java_sql_Driver::getMajorVersion( ) throw(RuntimeException)\n{\n if(!object)\n throw RuntimeException();\n jint out(0);\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv ){\n\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"()I\";\n char * cMethodName = \"getMajorVersion\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n out = t.pEnv->CallIntMethod( object, mID);\n ThrowSQLException(t.pEnv,*this);\n } \/\/t.pEnv\n return out;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL java_sql_Driver::getMinorVersion( ) throw(RuntimeException)\n{\n if(!object)\n throw RuntimeException();\n jint out(0);\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv ){\n\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"()I\";\n char * cMethodName = \"getMinorVersion\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n out = t.pEnv->CallIntMethod( object, mID);\n ThrowSQLException(t.pEnv,*this);\n } \/\/t.pEnv\n return out;\n}\n\/\/ -------------------------------------------------------------------------\n\n\n<commit_msg>#90553# forget to clear the object after use<commit_after>\/*************************************************************************\n *\n * $RCSfile: JDriver.cxx,v $\n *\n * $Revision: 1.17 $\n *\n * last change: $Author: oj $ $Date: 2001-08-03 14:19:08 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVER_HXX_\n#include \"java\/sql\/Driver.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#include \"java\/lang\/Object.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_LANG_CLASS_HXX_\n#include \"java\/lang\/Class.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVERMANAGER_HXX_\n#include \"java\/sql\/DriverManager.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_DRIVERPOPERTYINFO_HXX_\n#include \"java\/sql\/DriverPropertyInfo.hxx\"\n#endif\n#ifndef _CONNECTIVITY_JAVA_SQL_CONNECTION_HXX_\n#include \"java\/sql\/Connection.hxx\"\n#endif\n#include \"java\/util\/Property.hxx\"\n#ifndef _CONNECTIVITY_JAVA_TOOLS_HXX_\n#include \"java\/tools.hxx\"\n#endif\n\nusing namespace connectivity;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::beans;\n\/\/ using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::sdbc;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\n\/\/ -------------------------------------------------------------------------\njava_sql_Driver::java_sql_Driver(const Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory)\n : java_lang_Object(_rxFactory)\n{\n}\n\/\/ --------------------------------------------------------------------------------\njclass java_sql_Driver::theClass = 0;\n\/\/ --------------------------------------------------------------------------------\njava_sql_Driver::~java_sql_Driver()\n{}\n\/\/ static ServiceInfo\n\/\/------------------------------------------------------------------------------\nrtl::OUString java_sql_Driver::getImplementationName_Static( ) throw(RuntimeException)\n{\n return ::rtl::OUString::createFromAscii(\"com.sun.star.comp.sdbc.JDBCDriver\");\n \/\/ this name is referenced in the configuration and in the jdbc.xml\n \/\/ Please take care when changing it.\n}\n\/\/------------------------------------------------------------------------------\nSequence< ::rtl::OUString > java_sql_Driver::getSupportedServiceNames_Static( ) throw (RuntimeException)\n{\n Sequence< ::rtl::OUString > aSNS( 1 );\n aSNS[0] = ::rtl::OUString::createFromAscii(\"com.sun.star.sdbc.Driver\");\n return aSNS;\n}\n\/\/------------------------------------------------------------------\n::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface > SAL_CALL connectivity::java_sql_Driver_CreateInstance(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory) throw( ::com::sun::star::uno::Exception )\n{\n return *(new java_sql_Driver(_rxFactory));\n}\n\/\/ --------------------------------------------------------------------------------\n::rtl::OUString SAL_CALL java_sql_Driver::getImplementationName( ) throw(RuntimeException)\n{\n return getImplementationName_Static();\n}\n\n\/\/ --------------------------------------------------------------------------------\nsal_Bool SAL_CALL java_sql_Driver::supportsService( const ::rtl::OUString& _rServiceName ) throw(RuntimeException)\n{\n Sequence< ::rtl::OUString > aSupported(getSupportedServiceNames());\n const ::rtl::OUString* pSupported = aSupported.getConstArray();\n const ::rtl::OUString* pEnd = pSupported + aSupported.getLength();\n for (;pSupported != pEnd && !pSupported->equals(_rServiceName); ++pSupported)\n ;\n\n return pSupported != pEnd;\n}\n\n\/\/ --------------------------------------------------------------------------------\nSequence< ::rtl::OUString > SAL_CALL java_sql_Driver::getSupportedServiceNames( ) throw(RuntimeException)\n{\n return getSupportedServiceNames_Static();\n}\n\n\/\/ --------------------------------------------------------------------------------\njclass java_sql_Driver::getMyClass()\n{\n \/\/ die Klasse muss nur einmal geholt werden, daher statisch\n if( !theClass )\n {\n SDBThreadAttach t; OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv )\n {\n jclass tempClass = t.pEnv->FindClass(\"java\/sql\/Driver\");\n OSL_ENSURE(tempClass,\"Java : FindClass nicht erfolgreich!\");\n jclass globClass = (jclass)t.pEnv->NewGlobalRef( tempClass );\n t.pEnv->DeleteLocalRef( tempClass );\n saveClassRef( globClass );\n }\n }\n return theClass;\n}\n\/\/ --------------------------------------------------------------------------------\nvoid java_sql_Driver::saveClassRef( jclass pClass )\n{\n if( SDBThreadAttach::IsJavaErrorOccured() || pClass==0 )\n return;\n \/\/ der uebergebe Klassen-Handle ist schon global, daher einfach speichern\n theClass = pClass;\n}\n\/\/ -------------------------------------------------------------------------\nReference< XConnection > SAL_CALL java_sql_Driver::connect( const ::rtl::OUString& url, const\n Sequence< PropertyValue >& info ) throw(SQLException, RuntimeException)\n{\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n Reference< XConnection > xRet;\n \/\/ first try if the jdbc driver is alraedy registered at the driver manager\n try\n {\n if(!object)\n {\n const PropertyValue* pBegin = info.getConstArray();\n const PropertyValue* pEnd = pBegin + info.getLength();\n for(jsize i=0;pBegin != pEnd;++pBegin)\n {\n if(!pBegin->Name.compareToAscii(\"JavaDriverClass\"))\n {\n \/\/ here I try to find the class for jdbc driver\n java_sql_SQLException_BASE::getMyClass();\n java_lang_Throwable::getMyClass();\n\n ::rtl::OUString aStr;\n pBegin->Value >>= aStr;\n \/\/ the driver manager holds the class of the driver for later use\n \/\/ if forName didn't find the class it will throw an exception\n java_lang_Class *pDrvClass = java_lang_Class::forName(aStr);\n if(pDrvClass)\n {\n saveRef(t.pEnv, pDrvClass->newInstanceObject());\n delete pDrvClass;\n }\n break;\n }\n }\n }\n }\n catch(Exception&)\n {\n if( object )\n {\n t.pEnv->DeleteGlobalRef( object );\n object = NULL;\n }\n throw SQLException(::rtl::OUString::createFromAscii(\"The specified driver could not be loaded!\"),*this,::rtl::OUString(),1000,Any());\n }\n\n jobject out(0);\n\n if( t.pEnv )\n {\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"(Ljava\/lang\/String;Ljava\/util\/Properties;)Ljava\/sql\/Connection;\";\n char * cMethodName = \"connect\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n ThrowSQLException(t.pEnv,*this);\n if( mID )\n {\n jvalue args[2];\n \/\/ Parameter konvertieren\n args[0].l = convertwchar_tToJavaString(t.pEnv,url);\n java_util_Properties* pProps = createStringPropertyArray(t.pEnv,info);\n args[1].l = pProps->getJavaObject();\n\n out = t.pEnv->CallObjectMethod( object, mID, args[0].l,args[1].l );\n \/\/ und aufraeumen\n t.pEnv->DeleteLocalRef((jstring)args[0].l);\n delete pProps;\n if( object )\n {\n t.pEnv->DeleteGlobalRef( object );\n object = NULL;\n }\n ThrowSQLException(t.pEnv,*this);\n\n } \/\/mID\n if( object )\n {\n t.pEnv->DeleteGlobalRef( object );\n object = NULL;\n }\n } \/\/t.pEnv\n \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n Reference< XConnection > xOut;\n return out==0 ? 0 : new java_sql_Connection( t.pEnv, out,this );\n \/\/ return xOut;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Bool SAL_CALL java_sql_Driver::acceptsURL( const ::rtl::OUString& url ) throw(SQLException, RuntimeException)\n{\n \/\/ don't ask the real driver for the url\n \/\/ I feel responsible for all jdbc url's\n static const ::rtl::OUString s_sJdbcPrefix = ::rtl::OUString::createFromAscii(\"jdbc:\");\n return 0 == url.compareTo(s_sJdbcPrefix, 5);\n}\n\/\/ -------------------------------------------------------------------------\nSequence< DriverPropertyInfo > SAL_CALL java_sql_Driver::getPropertyInfo( const ::rtl::OUString& url,\n const Sequence< PropertyValue >& info ) throw(SQLException, RuntimeException)\n{\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if(!object)\n object = java_sql_DriverManager::getDriver(url);\n\n if(!object)\n {\n \/\/ one of these must throw an exception\n ThrowSQLException(t.pEnv,*this);\n throw SQLException(); \/\/ we need a object here\n }\n\n jobjectArray out(0);\n\n if( t.pEnv )\n {\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"(Ljava\/lang\/String;Ljava\/util\/Properties;)[Ljava\/sql\/DriverPropertyInfo;\";\n char * cMethodName = \"getPropertyInfo\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n {\n jvalue args[2];\n \/\/ Parameter konvertieren\n args[0].l = convertwchar_tToJavaString(t.pEnv,url);\n java_util_Properties* pProps = createStringPropertyArray(t.pEnv,info);\n args[1].l = pProps->getJavaObject();\n\n out = (jobjectArray)t.pEnv->CallObjectMethodA( object, mID, args );\n ThrowSQLException(t.pEnv,*this);\n \/\/ und aufraeumen\n t.pEnv->DeleteLocalRef((jstring)args[0].l);\n delete pProps;\n } \/\/mID\n } \/\/t.pEnv\n \/\/ ACHTUNG: der Aufrufer wird Eigentuemer des zurueckgelieferten Zeigers !!!\n return copyArrayAndDelete( t.pEnv, out, DriverPropertyInfo(),java_sql_DriverPropertyInfo(NULL,NULL));\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL java_sql_Driver::getMajorVersion( ) throw(RuntimeException)\n{\n if(!object)\n throw RuntimeException();\n jint out(0);\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv ){\n\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"()I\";\n char * cMethodName = \"getMajorVersion\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n out = t.pEnv->CallIntMethod( object, mID);\n ThrowSQLException(t.pEnv,*this);\n } \/\/t.pEnv\n return out;\n}\n\/\/ -------------------------------------------------------------------------\nsal_Int32 SAL_CALL java_sql_Driver::getMinorVersion( ) throw(RuntimeException)\n{\n if(!object)\n throw RuntimeException();\n jint out(0);\n SDBThreadAttach t(getORB()); OSL_ENSURE(t.pEnv,\"Java Enviroment gelscht worden!\");\n if( t.pEnv ){\n\n \/\/ temporaere Variable initialisieren\n char * cSignature = \"()I\";\n char * cMethodName = \"getMinorVersion\";\n \/\/ Java-Call absetzen\n jmethodID mID = t.pEnv->GetMethodID( getMyClass(), cMethodName, cSignature );OSL_ENSURE(mID,\"Unknown method id!\");\n if( mID )\n out = t.pEnv->CallIntMethod( object, mID);\n ThrowSQLException(t.pEnv,*this);\n } \/\/t.pEnv\n return out;\n}\n\/\/ -------------------------------------------------------------------------\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: Object.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2003-04-24 13:23:29 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#define _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n\n#if STLPORT_VERSION>=321\n\/\/ jni.h needs cstdarg for std::va_list\n#include <cstdarg>\n#endif\n#include <jni.h>\n\n#ifdef OS2\n#include <typedefs.h>\n#endif\n\n#ifndef _COM_SUN_STAR_SDBC_SQLEXCEPTION_HPP_\n#include <com\/sun\/star\/sdbc\/SQLException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef INCLUDED_JVMACCESS_VIRTUALMACHINE_HXX\n#include <jvmaccess\/virtualmachine.hxx>\n#endif \/\/ INCLUDED_JVMACCESS_VIRTUALMACHINE_HXX\n\n\/\/=====================================================================\n\n#ifdef HAVE_64BIT_POINTERS\n#error \"no 64 bit pointer\"\n#else\n#ifdef OS2\n#define INT64_TO_PVOID(x) (void *)x.lo\ninline jlong Make_Os2_Int64( sal_Int32 hi, sal_Int32 lo ) {jlong x = CONST64( hi, lo ); return x; }\n#define PVOID_TO_INT64(x) Make_Os2_Int64( 0, (sal_Int32)x )\n#else \/\/OS2\n#define PVOID_TO_INT64(x) (jlong)(sal_Int32)x\n#define INT64_TO_PVOID(x) (void *)x\n#endif \/\/Os2\n#endif \/\/HAVE_64BIT_POINTERS\n\n\nnamespace connectivity\n{\n class SDBThreadAttach\n {\n jvmaccess::VirtualMachine::AttachGuard m_aGuard;\n SDBThreadAttach(SDBThreadAttach&);\n public:\n SDBThreadAttach();\n ~SDBThreadAttach();\n\n JNIEnv* pEnv;\n void addRef();\n void releaseRef();\n };\n \/\/=====================================================================\n class java_lang_Class;\n class java_lang_Object\n {\n \/\/ Zuweisungsoperator und Copy Konstruktor sind verboten\n java_lang_Object& operator = (java_lang_Object&) { return *this;};\n java_lang_Object(java_lang_Object&) {};\n\n static jclass getMyClass();\n \/\/ nur zum Zerstoeren des C++ Pointers in vom JSbxObject\n \/\/ abgeleiteten Java Objekten\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > m_xFactory;\n\n protected:\n \/\/ der JAVA Handle zu dieser Klasse\n jobject object;\n \/\/ Klassendefinition\n\n \/\/ neu in SJ2:\n static jclass theClass; \/\/ die Klasse braucht nur einmal angefordert werden !\n static jclass theJSbxObjectClass; \/\/ die Klasse braucht nur einmal angefordert werden !\n static sal_uInt32 nObjCount; \/\/ Zaehler fuer die Anzahl der Instanzen\n\n public:\n \/\/ der Konstruktor, der fuer die abgeleiteten Klassen verwendet\n \/\/ werden soll.\n java_lang_Object( JNIEnv * pEnv, jobject myObj );\n \/\/ der eigentliche Konstruktor\n java_lang_Object(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory=NULL);\n\n virtual ~java_lang_Object();\n\n void saveRef( JNIEnv * pEnv, jobject myObj );\n jobject getJavaObject() const { return object; }\n java_lang_Object * GetWrapper() { return this; }\n\n java_lang_Class * getClass();\n\n ::rtl::OUString toString();\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > getORB() { return m_xFactory; }\n static void ThrowSQLException(JNIEnv * pEnv,const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> & _rContext) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n static ::rtl::Reference< jvmaccess::VirtualMachine > getVM(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory=NULL);\n };\n}\n#endif \/\/_CONNECTIVITY_JAVA_LANG_OBJJECT_HXX_\n\n\n<commit_msg>INTEGRATION: CWS geordi2q10 (1.5.78); FILE MERGED 2003\/11\/28 09:38:59 rt 1.5.78.1: #111934#: join CWS dba01pp1<commit_after>\/*************************************************************************\n *\n * $RCSfile: Object.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: rt $ $Date: 2003-12-01 10:49:07 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n#define _CONNECTIVITY_JAVA_LANG_OBJECT_HXX_\n\n#if STLPORT_VERSION>=321\n\/\/ jni.h needs cstdarg for std::va_list\n#include <cstdarg>\n#endif\n#include <jni.h>\n\n#ifdef OS2\n#include <typedefs.h>\n#endif\n\n#ifndef _COM_SUN_STAR_SDBC_SQLEXCEPTION_HPP_\n#include <com\/sun\/star\/sdbc\/SQLException.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n#ifndef INCLUDED_JVMACCESS_VIRTUALMACHINE_HXX\n#include <jvmaccess\/virtualmachine.hxx>\n#endif \/\/ INCLUDED_JVMACCESS_VIRTUALMACHINE_HXX\n#include <memory>\n\n\/\/=====================================================================\n\n#ifdef HAVE_64BIT_POINTERS\n#error \"no 64 bit pointer\"\n#else\n#ifdef OS2\n#define INT64_TO_PVOID(x) (void *)x.lo\ninline jlong Make_Os2_Int64( sal_Int32 hi, sal_Int32 lo ) {jlong x = CONST64( hi, lo ); return x; }\n#define PVOID_TO_INT64(x) Make_Os2_Int64( 0, (sal_Int32)x )\n#else \/\/OS2\n#define PVOID_TO_INT64(x) (jlong)(sal_Int32)x\n#define INT64_TO_PVOID(x) (void *)x\n#endif \/\/Os2\n#endif \/\/HAVE_64BIT_POINTERS\n\n\nnamespace connectivity\n{\n class SDBThreadAttach\n {\n ::std::auto_ptr< jvmaccess::VirtualMachine::AttachGuard> m_aGuard;\n SDBThreadAttach(SDBThreadAttach&);\n public:\n SDBThreadAttach();\n ~SDBThreadAttach();\n\n JNIEnv* pEnv;\n void addRef();\n void releaseRef();\n };\n \/\/=====================================================================\n class java_lang_Class;\n class java_lang_Object\n {\n \/\/ Zuweisungsoperator und Copy Konstruktor sind verboten\n java_lang_Object& operator = (java_lang_Object&) { return *this;};\n java_lang_Object(java_lang_Object&) {};\n\n static jclass getMyClass();\n \/\/ nur zum Zerstoeren des C++ Pointers in vom JSbxObject\n \/\/ abgeleiteten Java Objekten\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > m_xFactory;\n\n protected:\n \/\/ der JAVA Handle zu dieser Klasse\n jobject object;\n \/\/ Klassendefinition\n\n \/\/ neu in SJ2:\n static jclass theClass; \/\/ die Klasse braucht nur einmal angefordert werden !\n static jclass theJSbxObjectClass; \/\/ die Klasse braucht nur einmal angefordert werden !\n static sal_uInt32 nObjCount; \/\/ Zaehler fuer die Anzahl der Instanzen\n\n public:\n \/\/ der Konstruktor, der fuer die abgeleiteten Klassen verwendet\n \/\/ werden soll.\n java_lang_Object( JNIEnv * pEnv, jobject myObj );\n \/\/ der eigentliche Konstruktor\n java_lang_Object(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory=NULL);\n\n virtual ~java_lang_Object();\n\n void saveRef( JNIEnv * pEnv, jobject myObj );\n jobject getJavaObject() const { return object; }\n java_lang_Object * GetWrapper() { return this; }\n\n java_lang_Class * getClass();\n\n ::rtl::OUString toString();\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > getORB() { return m_xFactory; }\n static void ThrowSQLException(JNIEnv * pEnv,const ::com::sun::star::uno::Reference< ::com::sun::star::uno::XInterface> & _rContext) throw(::com::sun::star::sdbc::SQLException, ::com::sun::star::uno::RuntimeException);\n\n static ::rtl::Reference< jvmaccess::VirtualMachine > getVM(const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rxFactory=NULL);\n };\n}\n#endif \/\/_CONNECTIVITY_JAVA_LANG_OBJJECT_HXX_\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\nusing state = unsigned long long;\nusing tower = unsigned int;\nusing size = unsigned int;\n\nconstexpr tower other(tower t1, tower t2) {\n return 3 - t1 - t2;\n}\n\nconstexpr state move(state s, tower src, tower target) {\n return s % 3 == src\n ? s \/ 3 * 3 + target\n : move(s \/ 3, src, target) * 3 + s % 3;\n}\n\n\/\/ disk 1 is the smallest, 0 does not exist (is \"above\" the smallest)\nconstexpr tower getTower(state s, size disk) {\n return disk == 1\n ? s % 3\n : getTower(s \/ 3, disk - 1);\n}\n\nstd::ostream &print_state(std::ostream &os, size ndisks, state s) {\n return ndisks ? print_state(os, ndisks - 1, s \/ 3) << s % 3 : os;\n}\n\ntemplate <size DISKS, state S, tower SRC, tower TARGET>\nstruct SolverRec {\n static constexpr tower nextSrc = getTower(S, DISKS - 1);\n static constexpr tower inter = other(SRC, TARGET);\n using rec1 = SolverRec<DISKS - 1, S, nextSrc, inter>;\n static constexpr state value = move(rec1::final_state, SRC, TARGET);\n using rec2 = SolverRec<DISKS - 1, value, inter, TARGET>;\n static constexpr state final_state = rec2::final_state;\n};\n\ntemplate <size DISKS, state S, tower TOWER>\nstruct SolverRec<DISKS, S, TOWER, TOWER> {\n static constexpr tower nextSrc = getTower(S, DISKS - 1);\n using rec = SolverRec<DISKS - 1, S, nextSrc, TOWER>;\n static constexpr state final_state = rec::final_state;\n};\n\ntemplate <state S, tower SRC, tower TARGET>\nstruct SolverRec<1, S, SRC, TARGET> {\n static constexpr state final_state = move(S, SRC, TARGET);\n};\n\ntemplate <state S, tower TOWER>\nstruct SolverRec<1, S, TOWER, TOWER> {\n static constexpr state final_state = S;\n};\n\ntemplate <size DISKS, state S, tower TARGET>\nstruct Solver {\n static constexpr tower src = getTower(S, DISKS);\n using start = SolverRec<DISKS, S, src, TARGET>;\n static constexpr state final_state = start::final_state;\n};\n\nint main() {\n constexpr size disks = 5;\n using solver = Solver<disks, 0, 2>;\n print_state(std::cout, disks, solver::final_state) << std::endl;\n return 0;\n}\n<commit_msg>Disks template for initial state<commit_after>#include <iostream>\n\nusing state = unsigned long long;\nusing tower = unsigned int;\nusing size = unsigned int;\n\nconstexpr tower other(tower t1, tower t2) {\n return 3 - t1 - t2;\n}\n\nconstexpr state move(state s, tower src, tower target) {\n return s % 3 == src\n ? s \/ 3 * 3 + target\n : move(s \/ 3, src, target) * 3 + s % 3;\n}\n\n\/\/ disk 1 is the smallest, 0 does not exist (is \"above\" the smallest)\nconstexpr tower getTower(state s, size disk) {\n return disk == 1\n ? s % 3\n : getTower(s \/ 3, disk - 1);\n}\n\nstd::ostream &print_state(std::ostream &os, size ndisks, state s) {\n return ndisks ? print_state(os, ndisks - 1, s \/ 3) << s % 3 : os;\n}\n\ntemplate <tower ...T>\nstruct Disks;\n\ntemplate <tower H, tower ...T>\nstruct Disks<H, T...> {\n static constexpr state count = 1 + sizeof...(T);\n static constexpr state pack(state tmp) {\n return Disks<T...>::pack(tmp * 3 + H);\n }\n static constexpr state packed = pack(0);\n};\n\ntemplate <>\nstruct Disks<> {\n static constexpr state count = 0;\n static constexpr state pack(state tmp) { return tmp; };\n static constexpr state packed = 0;\n};\n\ntemplate <size DISKS, state S, tower SRC, tower TARGET>\nstruct SolverRec {\n static constexpr tower nextSrc = getTower(S, DISKS - 1);\n static constexpr tower inter = other(SRC, TARGET);\n using rec1 = SolverRec<DISKS - 1, S, nextSrc, inter>;\n static constexpr state value = move(rec1::final_state, SRC, TARGET);\n using rec2 = SolverRec<DISKS - 1, value, inter, TARGET>;\n static constexpr state final_state = rec2::final_state;\n};\n\ntemplate <size DISKS, state S, tower TOWER>\nstruct SolverRec<DISKS, S, TOWER, TOWER> {\n static constexpr tower nextSrc = getTower(S, DISKS - 1);\n using rec = SolverRec<DISKS - 1, S, nextSrc, TOWER>;\n static constexpr state final_state = rec::final_state;\n};\n\ntemplate <state S, tower SRC, tower TARGET>\nstruct SolverRec<1, S, SRC, TARGET> {\n static constexpr state final_state = move(S, SRC, TARGET);\n};\n\ntemplate <state S, tower TOWER>\nstruct SolverRec<1, S, TOWER, TOWER> {\n static constexpr state final_state = S;\n};\n\ntemplate <size DISKS, state S, tower TARGET>\nstruct Solver {\n static constexpr tower src = getTower(S, DISKS);\n using start = SolverRec<DISKS, S, src, TARGET>;\n static constexpr state final_state = start::final_state;\n};\n\nint main() {\n using disks = Disks<0, 0, 0, 0, 0>;\n using solver = Solver<disks::count, disks::packed, 2>;\n print_state(std::cout, disks::count, solver::final_state) << std::endl;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2014 Caitlin Potter and Contributors\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n#include <TimedText\/Cue.h>\n#include <gtest\/gtest.h>\nusing namespace TimedText;\n\nvoid testSetAlign(const char *text, bool expectedSet,\n Cue::Align expectedAlign = Cue::Middle)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedAlign = Cue::defaultAlign;\n ++run;\n EXPECT_EQ(expectedSet, cue.setAlign(text))\n << \"in testSetAlign(string) #\" << run;\n EXPECT_EQ(expectedAlign, cue.align())\n << \"in testSetAlign(string) #\" << run;\n}\n\nvoid testSetAlign(Cue::Align align, bool expectedSet,\n Cue::Align expectedAlign = Cue::Middle)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedAlign = Cue::defaultAlign;\n ++run;\n EXPECT_EQ(expectedSet, cue.setAlign(align))\n << \"in testSetAlign(enum) #\" << run;\n EXPECT_EQ(expectedAlign, cue.align())\n << \"in testSetAlign(enum) #\" << run;\n}\n\nvoid testSetLine(const char *text, bool expectedSet,\n int expectedLine = 0, bool expectedSnapToLines = false)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet) {\n expectedLine = Cue::defaultLine;\n expectedSnapToLines = Cue::defaultSnapToLines;\n }\n ++run;\n EXPECT_EQ(expectedSet, cue.setLine(text)) << \"in testSetLine #\" << run;\n EXPECT_EQ(expectedLine, cue.line()) << \"in testSetLine #\" << run;\n EXPECT_EQ(expectedSnapToLines, cue.snapToLines()) << \"in testSetLine #\" << run;\n}\n\nvoid testSetPosition(const char *text, bool expectedSet, int expectedPosition = 0)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedPosition = Cue::defaultPosition;\n ++run;\n EXPECT_EQ(expectedSet, cue.setPosition(text)) << \"in testSetPosition #\" << run;\n EXPECT_EQ(expectedPosition, cue.position()) << \"in testSetPosition #\" << run;\n}\n\nvoid testSetSize(const char *text, bool expectedSet, int expectedSize = 0)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedSize = Cue::defaultSize;\n ++run;\n EXPECT_EQ(expectedSet, cue.setSize(text)) << \"in testSetSize #\" << run;\n EXPECT_EQ(expectedSize, cue.size()) << \"in testSetSize #\" << run;\n}\n\nvoid testSetVertical(const char *text, bool expectedSet,\n Cue::Vertical expectedVertical = Cue::Horizontal)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedVertical = Cue::defaultVertical;\n ++run;\n EXPECT_EQ(expectedSet, cue.setVertical(text))\n << \"in testSetVertical(string) #\" << run;\n EXPECT_EQ(expectedVertical, cue.vertical())\n << \"in testSetVertical(string) #\" << run;\n}\n\nvoid testSetVertical(Cue::Vertical vertical, bool expectedSet,\n Cue::Vertical expectedVertical = Cue::Horizontal)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedVertical = Cue::defaultVertical;\n ++run;\n EXPECT_EQ(expectedSet, cue.setVertical(vertical))\n << \"in testSetVertical(enum) #\" << run;\n EXPECT_EQ(expectedVertical, cue.vertical())\n << \"in testSetVertical(enum) #\" << run;\n}\n\nTEST(CueSettings,SetId)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_STREQ(\"\",cue.id());\n cue.setId(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\", cue.id());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetText)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_STREQ(\"\",cue.text());\n cue.setText(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\", cue.text());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetStartTime)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_EQ(0.000,cue.startTime().toSeconds());\n cue.setStartTime(6667.334);\n EXPECT_EQ(6667.334,cue.startTime().toSeconds());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetEndTime)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_EQ(1.000,cue.endTime().toSeconds());\n cue.setEndTime(8362.316);\n EXPECT_EQ(8362.316,cue.endTime().toSeconds());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetAlign)\n{\n const Cue::Align defaultAlign = Cue::defaultAlign;\n testSetAlign(\"start\",true,Cue::Start);\n testSetAlign(\"middle\",true,Cue::Middle);\n testSetAlign(\"end\",true,Cue::End);\n testSetAlign(\"left\",true,Cue::Left);\n testSetAlign(\"right\",true,Cue::Right);\n testSetAlign(\"12345\",false);\n testSetAlign(\"!@#$\",false);\n testSetAlign(\"bottom\",false);\n testSetAlign(\"\",false);\n testSetAlign(NULL,false);\n testSetAlign(static_cast<Cue::Align>(-1),false,defaultAlign);\n testSetAlign(static_cast<Cue::Align>(68),false,defaultAlign);\n}\n\nTEST(CueSettings,SetLine)\n{\n testSetLine(\"-1\",true,-1,true);\n testSetLine(\"10%\",true,10,false);\n testSetLine(\"0%\",true,0,false);\n testSetLine(\"100%\",true,100,false);\n testSetLine(\"-1%\",false);\n testSetLine(\"101%\",false);\n testSetLine(\"1%1\",false);\n testSetLine(\"1-1\",false);\n testSetLine(\"1z\",false);\n testSetLine(\"%\",false);\n testSetLine(\"-\",false);\n testSetLine(\"alpha\",false);\n testSetPosition(\"\",false);\n testSetPosition(NULL,false);\n}\n\nTEST(CueSettings,SetPosition)\n{\n testSetPosition(\"0%\",true,0);\n testSetPosition(\"100%\",true,100);\n testSetPosition(\"-1%\",false);\n testSetPosition(\"101%\",false);\n testSetPosition(\"0\",false);\n testSetPosition(\"100\",false);\n testSetPosition(\"%\",false);\n testSetPosition(\"%100\",false);\n testSetPosition(\"alpha\",false);\n testSetPosition(\"\",false);\n testSetPosition(NULL,false);\n}\n\nTEST(CueSettings,SetSize)\n{\n testSetSize(\"0%\",true,0);\n testSetSize(\"100%\",true,100);\n testSetSize(\"-1%\",false);\n testSetSize(\"101%\",false);\n testSetSize(\"0\",false);\n testSetSize(\"100\",false);\n testSetSize(\"%\",false);\n testSetSize(\"%100\",false);\n testSetSize(\"alpha\",false);\n testSetSize(\"\",false);\n testSetSize(NULL,false);\n}\n\nTEST(CueSettings,SetVertical)\n{\n const Cue::Vertical defaultVertical = Cue::defaultVertical;\n testSetVertical(\"\",true,Cue::Horizontal);\n testSetVertical(\"lr\",true,Cue::VerticalLeftToRight);\n testSetVertical(\"rl\",true,Cue::VerticalRightToLeft);\n testSetVertical(static_cast<Cue::Vertical>(-1),false,defaultVertical);\n testSetVertical(static_cast<Cue::Vertical>(2000),false,defaultVertical);\n testSetVertical(NULL,false);\n testSetVertical(\"lr \",false);\n testSetVertical(\"rl \",false);\n testSetVertical(\"lrr\",false);\n testSetVertical(\"rll\",false);\n testSetVertical(\"0\",false);\n testSetVertical(\"1\",false);\n testSetVertical(\"2\",false);\n}\n\nTEST(CueSettings,EmptyCue)\n{\n \/\/ Avoid using references to const values in EXPECT_EQ statements\n const Cue::Align defaultAlign = Cue::defaultAlign;\n const int defaultLine = Cue::defaultLine;\n const int defaultPosition = Cue::defaultPosition;\n const int defaultSize = Cue::defaultSize;\n const bool defaultSnapToLines = Cue::defaultSnapToLines;\n const Cue::Vertical defaultVertical = Cue::defaultVertical;\n\n \/\/ Trying to set empty cue settings should always fail\n Cue cue;\n\n \/\/ Id\n cue.setId(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"\", cue.id());\n\n \/\/ Text\n cue.setText(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"\", cue.text());\n\n \/\/ StartTime\n cue.setStartTime(68.067);\n EXPECT_EQ(MalformedTimestamp, cue.startTime());\n\n \/\/ EndTime\n cue.setEndTime(98.678);\n EXPECT_EQ(MalformedTimestamp, cue.endTime());\n\n \/\/ Align\n EXPECT_FALSE(cue.setAlign(Cue::Start));\n EXPECT_FALSE(cue.setAlign(Cue::Middle));\n EXPECT_FALSE(cue.setAlign(Cue::End));\n EXPECT_FALSE(cue.setAlign(Cue::Left));\n EXPECT_FALSE(cue.setAlign(Cue::Right));\n EXPECT_FALSE(cue.setAlign(\"start\"));\n EXPECT_FALSE(cue.setAlign(\"middle\"));\n EXPECT_FALSE(cue.setAlign(\"end\"));\n EXPECT_FALSE(cue.setAlign(\"left\"));\n EXPECT_FALSE(cue.setAlign(\"right\"));\n EXPECT_EQ(defaultAlign,cue.align());\n\n \/\/ Line\n EXPECT_FALSE(cue.setLine(0, false));\n EXPECT_FALSE(cue.setLine(0, false));\n EXPECT_FALSE(cue.setLine(-101, true));\n EXPECT_FALSE(cue.setLine(101, true));\n EXPECT_FALSE(cue.setLine(\"0%\"));\n EXPECT_FALSE(cue.setLine(\"100%\"));\n EXPECT_FALSE(cue.setLine(\"-101\"));\n EXPECT_FALSE(cue.setLine(\"1001\"));\n EXPECT_EQ(defaultLine, cue.line());\n EXPECT_EQ(defaultSnapToLines, cue.snapToLines());\n\n \/\/ Position\n EXPECT_FALSE(cue.setPosition(0));\n EXPECT_FALSE(cue.setPosition(100));\n EXPECT_FALSE(cue.setPosition(\"0%\"));\n EXPECT_FALSE(cue.setPosition(\"100%\"));\n EXPECT_EQ(defaultPosition, cue.position());\n\n \/\/ Size\n EXPECT_FALSE(cue.setSize(0));\n EXPECT_FALSE(cue.setSize(100));\n EXPECT_FALSE(cue.setSize(\"0%\"));\n EXPECT_FALSE(cue.setSize(\"100%\"));\n EXPECT_EQ(defaultSize, cue.size());\n\n \/\/ Vertical\n EXPECT_FALSE(cue.setVertical(Cue::Horizontal));\n EXPECT_FALSE(cue.setVertical(Cue::VerticalLeftToRight));\n EXPECT_FALSE(cue.setVertical(Cue::VerticalRightToLeft));\n EXPECT_FALSE(cue.setVertical(\"\"));\n EXPECT_FALSE(cue.setVertical(\"lr\"));\n EXPECT_FALSE(cue.setVertical(\"rl\"));\n EXPECT_EQ(defaultVertical, cue.vertical());\n}\n<commit_msg>Test setting Cue::setLine with NULL and empty strings<commit_after>\/\/\n\/\/ Copyright (c) 2014 Caitlin Potter and Contributors\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n#include <TimedText\/Cue.h>\n#include <gtest\/gtest.h>\nusing namespace TimedText;\n\nvoid testSetAlign(const char *text, bool expectedSet,\n Cue::Align expectedAlign = Cue::Middle)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedAlign = Cue::defaultAlign;\n ++run;\n EXPECT_EQ(expectedSet, cue.setAlign(text))\n << \"in testSetAlign(string) #\" << run;\n EXPECT_EQ(expectedAlign, cue.align())\n << \"in testSetAlign(string) #\" << run;\n}\n\nvoid testSetAlign(Cue::Align align, bool expectedSet,\n Cue::Align expectedAlign = Cue::Middle)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedAlign = Cue::defaultAlign;\n ++run;\n EXPECT_EQ(expectedSet, cue.setAlign(align))\n << \"in testSetAlign(enum) #\" << run;\n EXPECT_EQ(expectedAlign, cue.align())\n << \"in testSetAlign(enum) #\" << run;\n}\n\nvoid testSetLine(const char *text, bool expectedSet,\n int expectedLine = 0, bool expectedSnapToLines = false)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet) {\n expectedLine = Cue::defaultLine;\n expectedSnapToLines = Cue::defaultSnapToLines;\n }\n ++run;\n EXPECT_EQ(expectedSet, cue.setLine(text)) << \"in testSetLine #\" << run;\n EXPECT_EQ(expectedLine, cue.line()) << \"in testSetLine #\" << run;\n EXPECT_EQ(expectedSnapToLines, cue.snapToLines()) << \"in testSetLine #\" << run;\n}\n\nvoid testSetPosition(const char *text, bool expectedSet, int expectedPosition = 0)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedPosition = Cue::defaultPosition;\n ++run;\n EXPECT_EQ(expectedSet, cue.setPosition(text)) << \"in testSetPosition #\" << run;\n EXPECT_EQ(expectedPosition, cue.position()) << \"in testSetPosition #\" << run;\n}\n\nvoid testSetSize(const char *text, bool expectedSet, int expectedSize = 0)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedSize = Cue::defaultSize;\n ++run;\n EXPECT_EQ(expectedSet, cue.setSize(text)) << \"in testSetSize #\" << run;\n EXPECT_EQ(expectedSize, cue.size()) << \"in testSetSize #\" << run;\n}\n\nvoid testSetVertical(const char *text, bool expectedSet,\n Cue::Vertical expectedVertical = Cue::Horizontal)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedVertical = Cue::defaultVertical;\n ++run;\n EXPECT_EQ(expectedSet, cue.setVertical(text))\n << \"in testSetVertical(string) #\" << run;\n EXPECT_EQ(expectedVertical, cue.vertical())\n << \"in testSetVertical(string) #\" << run;\n}\n\nvoid testSetVertical(Cue::Vertical vertical, bool expectedSet,\n Cue::Vertical expectedVertical = Cue::Horizontal)\n{\n static int run = 0;\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n if(!expectedSet)\n expectedVertical = Cue::defaultVertical;\n ++run;\n EXPECT_EQ(expectedSet, cue.setVertical(vertical))\n << \"in testSetVertical(enum) #\" << run;\n EXPECT_EQ(expectedVertical, cue.vertical())\n << \"in testSetVertical(enum) #\" << run;\n}\n\nTEST(CueSettings,SetId)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_STREQ(\"\",cue.id());\n cue.setId(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\", cue.id());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetText)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_STREQ(\"\",cue.text());\n cue.setText(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\", cue.text());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetStartTime)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_EQ(0.000,cue.startTime().toSeconds());\n cue.setStartTime(6667.334);\n EXPECT_EQ(6667.334,cue.startTime().toSeconds());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetEndTime)\n{\n Cue cue(Cue::WebVTTCue, 0.000, 1.000);\n EXPECT_EQ(1.000,cue.endTime().toSeconds());\n cue.setEndTime(8362.316);\n EXPECT_EQ(8362.316,cue.endTime().toSeconds());\n \/\/ TODO: Test with TTML Cues too!\n}\n\nTEST(CueSettings,SetAlign)\n{\n const Cue::Align defaultAlign = Cue::defaultAlign;\n testSetAlign(\"start\",true,Cue::Start);\n testSetAlign(\"middle\",true,Cue::Middle);\n testSetAlign(\"end\",true,Cue::End);\n testSetAlign(\"left\",true,Cue::Left);\n testSetAlign(\"right\",true,Cue::Right);\n testSetAlign(\"12345\",false);\n testSetAlign(\"!@#$\",false);\n testSetAlign(\"bottom\",false);\n testSetAlign(\"\",false);\n testSetAlign(NULL,false);\n testSetAlign(static_cast<Cue::Align>(-1),false,defaultAlign);\n testSetAlign(static_cast<Cue::Align>(68),false,defaultAlign);\n}\n\nTEST(CueSettings,SetLine)\n{\n testSetLine(\"-1\",true,-1,true);\n testSetLine(\"10%\",true,10,false);\n testSetLine(\"0%\",true,0,false);\n testSetLine(\"100%\",true,100,false);\n testSetLine(\"-1%\",false);\n testSetLine(\"101%\",false);\n testSetLine(\"1%1\",false);\n testSetLine(\"1-1\",false);\n testSetLine(\"1z\",false);\n testSetLine(\"%\",false);\n testSetLine(\"-\",false);\n testSetLine(\"alpha\",false);\n testSetLine(\"\",false);\n testSetLine(NULL,false);\n}\n\nTEST(CueSettings,SetPosition)\n{\n testSetPosition(\"0%\",true,0);\n testSetPosition(\"100%\",true,100);\n testSetPosition(\"-1%\",false);\n testSetPosition(\"101%\",false);\n testSetPosition(\"0\",false);\n testSetPosition(\"100\",false);\n testSetPosition(\"%\",false);\n testSetPosition(\"%100\",false);\n testSetPosition(\"alpha\",false);\n testSetPosition(\"\",false);\n testSetPosition(NULL,false);\n}\n\nTEST(CueSettings,SetSize)\n{\n testSetSize(\"0%\",true,0);\n testSetSize(\"100%\",true,100);\n testSetSize(\"-1%\",false);\n testSetSize(\"101%\",false);\n testSetSize(\"0\",false);\n testSetSize(\"100\",false);\n testSetSize(\"%\",false);\n testSetSize(\"%100\",false);\n testSetSize(\"alpha\",false);\n testSetSize(\"\",false);\n testSetSize(NULL,false);\n}\n\nTEST(CueSettings,SetVertical)\n{\n const Cue::Vertical defaultVertical = Cue::defaultVertical;\n testSetVertical(\"\",true,Cue::Horizontal);\n testSetVertical(\"lr\",true,Cue::VerticalLeftToRight);\n testSetVertical(\"rl\",true,Cue::VerticalRightToLeft);\n testSetVertical(static_cast<Cue::Vertical>(-1),false,defaultVertical);\n testSetVertical(static_cast<Cue::Vertical>(2000),false,defaultVertical);\n testSetVertical(NULL,false);\n testSetVertical(\"lr \",false);\n testSetVertical(\"rl \",false);\n testSetVertical(\"lrr\",false);\n testSetVertical(\"rll\",false);\n testSetVertical(\"0\",false);\n testSetVertical(\"1\",false);\n testSetVertical(\"2\",false);\n}\n\nTEST(CueSettings,EmptyCue)\n{\n \/\/ Avoid using references to const values in EXPECT_EQ statements\n const Cue::Align defaultAlign = Cue::defaultAlign;\n const int defaultLine = Cue::defaultLine;\n const int defaultPosition = Cue::defaultPosition;\n const int defaultSize = Cue::defaultSize;\n const bool defaultSnapToLines = Cue::defaultSnapToLines;\n const Cue::Vertical defaultVertical = Cue::defaultVertical;\n\n \/\/ Trying to set empty cue settings should always fail\n Cue cue;\n\n \/\/ Id\n cue.setId(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"\", cue.id());\n\n \/\/ Text\n cue.setText(\"Phnglui mglw nafh Cthulhu R'lyeh wgah nagl fhtagn\");\n EXPECT_STREQ(\"\", cue.text());\n\n \/\/ StartTime\n cue.setStartTime(68.067);\n EXPECT_EQ(MalformedTimestamp, cue.startTime());\n\n \/\/ EndTime\n cue.setEndTime(98.678);\n EXPECT_EQ(MalformedTimestamp, cue.endTime());\n\n \/\/ Align\n EXPECT_FALSE(cue.setAlign(Cue::Start));\n EXPECT_FALSE(cue.setAlign(Cue::Middle));\n EXPECT_FALSE(cue.setAlign(Cue::End));\n EXPECT_FALSE(cue.setAlign(Cue::Left));\n EXPECT_FALSE(cue.setAlign(Cue::Right));\n EXPECT_FALSE(cue.setAlign(\"start\"));\n EXPECT_FALSE(cue.setAlign(\"middle\"));\n EXPECT_FALSE(cue.setAlign(\"end\"));\n EXPECT_FALSE(cue.setAlign(\"left\"));\n EXPECT_FALSE(cue.setAlign(\"right\"));\n EXPECT_EQ(defaultAlign,cue.align());\n\n \/\/ Line\n EXPECT_FALSE(cue.setLine(0, false));\n EXPECT_FALSE(cue.setLine(0, false));\n EXPECT_FALSE(cue.setLine(-101, true));\n EXPECT_FALSE(cue.setLine(101, true));\n EXPECT_FALSE(cue.setLine(\"0%\"));\n EXPECT_FALSE(cue.setLine(\"100%\"));\n EXPECT_FALSE(cue.setLine(\"-101\"));\n EXPECT_FALSE(cue.setLine(\"1001\"));\n EXPECT_EQ(defaultLine, cue.line());\n EXPECT_EQ(defaultSnapToLines, cue.snapToLines());\n\n \/\/ Position\n EXPECT_FALSE(cue.setPosition(0));\n EXPECT_FALSE(cue.setPosition(100));\n EXPECT_FALSE(cue.setPosition(\"0%\"));\n EXPECT_FALSE(cue.setPosition(\"100%\"));\n EXPECT_EQ(defaultPosition, cue.position());\n\n \/\/ Size\n EXPECT_FALSE(cue.setSize(0));\n EXPECT_FALSE(cue.setSize(100));\n EXPECT_FALSE(cue.setSize(\"0%\"));\n EXPECT_FALSE(cue.setSize(\"100%\"));\n EXPECT_EQ(defaultSize, cue.size());\n\n \/\/ Vertical\n EXPECT_FALSE(cue.setVertical(Cue::Horizontal));\n EXPECT_FALSE(cue.setVertical(Cue::VerticalLeftToRight));\n EXPECT_FALSE(cue.setVertical(Cue::VerticalRightToLeft));\n EXPECT_FALSE(cue.setVertical(\"\"));\n EXPECT_FALSE(cue.setVertical(\"lr\"));\n EXPECT_FALSE(cue.setVertical(\"rl\"));\n EXPECT_EQ(defaultVertical, cue.vertical());\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <string.h>\n#include <limits.h>\n#include <errno.h>\n\n#include <map>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <istream>\n#include <ostream>\n#include <sstream>\n\n#define CLIOPTS_ENABLE_CXX\n#define INCLUDE_SUBDOC_NTOHLL\n#include \"subdoc\/subdoc-api.h\"\n#include \"subdoc\/subdoc-util.h\"\n#include \"subdoc\/path.h\"\n#include \"subdoc\/match.h\"\n#include \"subdoc\/operations.h\"\n#include \"contrib\/cliopts\/cliopts.h\"\n\nusing std::string;\nusing std::map;\nusing namespace cliopts;\n\nclass Options {\npublic:\n Options() :\n o_iter('i', \"iterations\", 1000),\n o_path('p', \"docpath\"),\n o_value('v', \"value\"),\n o_jsfile('f', \"json\"),\n o_cmd('c', \"command\"),\n parser(\"subdoc-bench\")\n {\n o_iter.description(\"Number of iterations to run\");\n o_path.description(\"Document path to manipulate\").mandatory();\n o_value.description(\"Document value to insert\");\n o_jsfile.description(\"JSON file to operate on\");\n o_cmd.description(\"Command to use\").mandatory();\n\n parser.addOption(o_iter);\n parser.addOption(o_path);\n parser.addOption(o_value);\n parser.addOption(o_jsfile);\n parser.addOption(o_cmd);\n\n \/\/ Set the opmap\n initOpmap();\n }\n\n void initOpmap() {\n \/\/ generic ops:\n opmap[\"replace\"] = SUBDOC_CMD_REPLACE;\n opmap[\"delete\"] = SUBDOC_CMD_DELETE;\n opmap[\"get\"] = SUBDOC_CMD_GET;\n opmap[\"exists\"] = SUBDOC_CMD_EXISTS;\n\n \/\/ dict ops\n opmap[\"add\"] = SUBDOC_CMD_DICT_ADD;\n opmap[\"upsert\"] = SUBDOC_CMD_DICT_UPSERT;\n opmap[\"add_p\"] = SUBDOC_CMD_DICT_ADD_P;\n opmap[\"upsert_p\"] = SUBDOC_CMD_DICT_UPSERT_P;\n\n \/\/ list ops\n opmap[\"append\"] = SUBDOC_CMD_ARRAY_APPEND;\n opmap[\"prepend\"] = SUBDOC_CMD_ARRAY_PREPEND;\n opmap[\"pop\"] = SUBDOC_CMD_ARRAY_POP;\n opmap[\"shift\"] = SUBDOC_CMD_ARRAY_SHIFT;\n opmap[\"addunique\"] = SUBDOC_CMD_ARRAY_ADD_UNIQUE;\n opmap[\"append_p\"] = SUBDOC_CMD_ARRAY_APPEND_P;\n opmap[\"prepend_p\"] = SUBDOC_CMD_ARRAY_PREPEND_P;\n opmap[\"addunique_p\"] = SUBDOC_CMD_ARRAY_ADD_UNIQUE_P;\n\n \/\/ arithmetic ops\n opmap[\"incr\"] = SUBDOC_CMD_INCREMENT;\n opmap[\"decr\"] = SUBDOC_CMD_DECREMENT;\n opmap[\"incr_p\"] = SUBDOC_CMD_INCREMENT_P;\n opmap[\"decr_p\"] = SUBDOC_CMD_DECREMENT_P;\n }\n\n UIntOption o_iter;\n StringOption o_path;\n StringOption o_value;\n StringOption o_jsfile;\n StringOption o_cmd;\n map<string,uint8_t> opmap;\n Parser parser;\n};\n\n#ifdef _WIN32\n#include <windows.h>\nstatic uint64_t\nget_nstime(void) {\n double ret;\n static LARGE_INTEGER pf = { 0 };\n static double freq;\n LARGE_INTEGER currtime;\n\n if (pf.QuadPart == 0) {\n QueryPerformanceFrequency(&pf);\n freq = 1.0e9 \/ (double)pf.QuadPart;\n }\n\n QueryPerformanceCounter(&currtime);\n\n ret = (double)currtime.QuadPart * freq ;\n return (uint64_t)ret;\n}\n#else\n#include <sys\/time.h>\nstatic uint64_t\nget_nstime(void) {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n return (tv.tv_sec * 1000000000) + (tv.tv_usec * 1000);\n}\n#endif\n\nstatic void\nexecOperation(Options& o)\n{\n string json;\n std::ifstream input(o.o_jsfile.result().c_str());\n if (input.bad()) {\n throw string(\"Couldn't open file!\");\n }\n std::stringstream ss;\n ss << input.rdbuf();\n json = ss.str();\n input.close();\n\n const uint8_t opcode = o.opmap[o.o_cmd.const_result()];\n string value = o.o_value.const_result();\n string path = o.o_path.const_result();\n const char *vbuf = value.c_str();\n size_t nvbuf = value.length();\n uint64_t dummy;\n\n switch (opcode) {\n case SUBDOC_CMD_INCREMENT:\n case SUBDOC_CMD_INCREMENT_P:\n case SUBDOC_CMD_DECREMENT:\n case SUBDOC_CMD_DECREMENT_P: {\n int64_t ctmp = (uint64_t)strtoll(vbuf, NULL, 10);\n if (ctmp == LLONG_MAX && errno == ERANGE) {\n throw string(\"Invalid delta for arithmetic operation!\");\n }\n dummy = ctmp;\n dummy = htonll(dummy);\n vbuf = (const char *)&dummy;\n nvbuf = sizeof dummy;\n break;\n }\n }\n\n subdoc_OPERATION *op = subdoc_op_alloc();\n\n\n size_t itermax = o.o_iter.result();\n for (size_t ii = 0; ii < itermax; ii++) {\n subdoc_op_clear(op);\n SUBDOC_OP_SETCODE(op, opcode);\n SUBDOC_OP_SETDOC(op, json.c_str(), json.size());\n SUBDOC_OP_SETVALUE(op, vbuf, nvbuf);\n\n uint16_t rv = subdoc_op_exec(op, path.c_str(), path.size());\n if (rv != SUBDOC_STATUS_SUCCESS) {\n throw string(\"Operation failed!\");\n }\n }\n\n \/\/ Print the result.\n if (opcode == SUBDOC_CMD_GET || opcode == SUBDOC_CMD_EXISTS) {\n string match(op->match.loc_match.at, op->match.loc_match.length);\n std::cout << match << std::endl;\n } else {\n string newdoc;\n for (size_t ii = 0; ii < op->doc_new_len; ii++) {\n const subdoc_LOC *loc = &op->doc_new[ii];\n newdoc.append(loc->at, loc->length);\n }\n std::cout << newdoc << std::endl;\n }\n\n subdoc_op_free(op);\n}\n\nstatic void\nexecPathParse(Options& o)\n{\n size_t itermax = o.o_iter.result();\n string path = o.o_path.const_result();\n subdoc_PATH *pth = subdoc_path_alloc();\n\n for (size_t ii = 0; ii < itermax; ii++) {\n subdoc_path_clear(pth);\n int rv = subdoc_path_parse(pth, path.c_str(), path.size());\n\n if (rv != 0) {\n throw string(\"Failed to parse path!\");\n }\n }\n\n subdoc_path_free(pth);\n}\n\nvoid runMain(int argc, char **argv)\n{\n Options o;\n if (!o.parser.parse(argc, argv)) {\n throw string(\"Bad options!\");\n }\n \/\/ Determine the command\n string cmdStr = o.o_cmd.const_result();\n\n uint64_t t_begin = get_nstime();\n\n if (o.opmap.find(cmdStr) != o.opmap.end()) {\n if (!o.o_jsfile.passed()) {\n throw string(\"Operation must contain file!\");\n }\n execOperation(o);\n } else if (cmdStr == \"path\") {\n execPathParse(o);\n } else {\n throw string(\"Unknown command!\");\n }\n\n uint64_t t_total = get_nstime() - t_begin;\n \/\/ Get the number of seconds:\n double n_seconds = t_total \/ 1000000000.0;\n double ops_per_sec = (double)o.o_iter.result() \/ n_seconds;\n\n fprintf(stderr, \"DURATION=%.2lfs. OPS=%lu\\n\", n_seconds, o.o_iter.result());\n fprintf(stderr, \"%.2lf OPS\/s\\n\", ops_per_sec);\n}\n\nint main(int argc, char **argv)\n{\n try {\n runMain(argc, argv);\n return EXIT_SUCCESS;\n } catch (string& exc) {\n std::cerr << exc << std::endl;\n return EXIT_FAILURE;\n }\n}\n<commit_msg>Bench: don't use C++ cout\/cerr (very slow)<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\n#include <string.h>\n#include <limits.h>\n#include <errno.h>\n\n#include <map>\n#include <string>\n#include <fstream>\n#include <iostream>\n#include <istream>\n#include <ostream>\n#include <sstream>\n\n#define CLIOPTS_ENABLE_CXX\n#define INCLUDE_SUBDOC_NTOHLL\n#include \"subdoc\/subdoc-api.h\"\n#include \"subdoc\/subdoc-util.h\"\n#include \"subdoc\/path.h\"\n#include \"subdoc\/match.h\"\n#include \"subdoc\/operations.h\"\n#include \"contrib\/cliopts\/cliopts.h\"\n\nusing std::string;\nusing std::map;\nusing namespace cliopts;\n\nclass Options {\npublic:\n Options() :\n o_iter('i', \"iterations\", 1000),\n o_path('p', \"docpath\"),\n o_value('v', \"value\"),\n o_jsfile('f', \"json\"),\n o_cmd('c', \"command\"),\n parser(\"subdoc-bench\")\n {\n o_iter.description(\"Number of iterations to run\");\n o_path.description(\"Document path to manipulate\").mandatory();\n o_value.description(\"Document value to insert\");\n o_jsfile.description(\"JSON file to operate on\");\n o_cmd.description(\"Command to use\").mandatory();\n\n parser.addOption(o_iter);\n parser.addOption(o_path);\n parser.addOption(o_value);\n parser.addOption(o_jsfile);\n parser.addOption(o_cmd);\n\n \/\/ Set the opmap\n initOpmap();\n }\n\n void initOpmap() {\n \/\/ generic ops:\n opmap[\"replace\"] = SUBDOC_CMD_REPLACE;\n opmap[\"delete\"] = SUBDOC_CMD_DELETE;\n opmap[\"get\"] = SUBDOC_CMD_GET;\n opmap[\"exists\"] = SUBDOC_CMD_EXISTS;\n\n \/\/ dict ops\n opmap[\"add\"] = SUBDOC_CMD_DICT_ADD;\n opmap[\"upsert\"] = SUBDOC_CMD_DICT_UPSERT;\n opmap[\"add_p\"] = SUBDOC_CMD_DICT_ADD_P;\n opmap[\"upsert_p\"] = SUBDOC_CMD_DICT_UPSERT_P;\n\n \/\/ list ops\n opmap[\"append\"] = SUBDOC_CMD_ARRAY_APPEND;\n opmap[\"prepend\"] = SUBDOC_CMD_ARRAY_PREPEND;\n opmap[\"pop\"] = SUBDOC_CMD_ARRAY_POP;\n opmap[\"shift\"] = SUBDOC_CMD_ARRAY_SHIFT;\n opmap[\"addunique\"] = SUBDOC_CMD_ARRAY_ADD_UNIQUE;\n opmap[\"append_p\"] = SUBDOC_CMD_ARRAY_APPEND_P;\n opmap[\"prepend_p\"] = SUBDOC_CMD_ARRAY_PREPEND_P;\n opmap[\"addunique_p\"] = SUBDOC_CMD_ARRAY_ADD_UNIQUE_P;\n\n \/\/ arithmetic ops\n opmap[\"incr\"] = SUBDOC_CMD_INCREMENT;\n opmap[\"decr\"] = SUBDOC_CMD_DECREMENT;\n opmap[\"incr_p\"] = SUBDOC_CMD_INCREMENT_P;\n opmap[\"decr_p\"] = SUBDOC_CMD_DECREMENT_P;\n }\n\n UIntOption o_iter;\n StringOption o_path;\n StringOption o_value;\n StringOption o_jsfile;\n StringOption o_cmd;\n map<string,uint8_t> opmap;\n Parser parser;\n};\n\n#ifdef _WIN32\n#include <windows.h>\nstatic uint64_t\nget_nstime(void) {\n double ret;\n static LARGE_INTEGER pf = { 0 };\n static double freq;\n LARGE_INTEGER currtime;\n\n if (pf.QuadPart == 0) {\n QueryPerformanceFrequency(&pf);\n freq = 1.0e9 \/ (double)pf.QuadPart;\n }\n\n QueryPerformanceCounter(&currtime);\n\n ret = (double)currtime.QuadPart * freq ;\n return (uint64_t)ret;\n}\n#else\n#include <sys\/time.h>\nstatic uint64_t\nget_nstime(void) {\n struct timeval tv;\n gettimeofday(&tv, NULL);\n return (tv.tv_sec * 1000000000) + (tv.tv_usec * 1000);\n}\n#endif\n\nstatic void\nexecOperation(Options& o)\n{\n string json;\n std::ifstream input(o.o_jsfile.result().c_str());\n if (input.bad()) {\n throw string(\"Couldn't open file!\");\n }\n std::stringstream ss;\n ss << input.rdbuf();\n json = ss.str();\n input.close();\n\n const uint8_t opcode = o.opmap[o.o_cmd.const_result()];\n string value = o.o_value.const_result();\n string path = o.o_path.const_result();\n const char *vbuf = value.c_str();\n size_t nvbuf = value.length();\n uint64_t dummy;\n\n switch (opcode) {\n case SUBDOC_CMD_INCREMENT:\n case SUBDOC_CMD_INCREMENT_P:\n case SUBDOC_CMD_DECREMENT:\n case SUBDOC_CMD_DECREMENT_P: {\n int64_t ctmp = (uint64_t)strtoll(vbuf, NULL, 10);\n if (ctmp == LLONG_MAX && errno == ERANGE) {\n throw string(\"Invalid delta for arithmetic operation!\");\n }\n dummy = ctmp;\n dummy = htonll(dummy);\n vbuf = (const char *)&dummy;\n nvbuf = sizeof dummy;\n break;\n }\n }\n\n subdoc_OPERATION *op = subdoc_op_alloc();\n\n\n size_t itermax = o.o_iter.result();\n for (size_t ii = 0; ii < itermax; ii++) {\n subdoc_op_clear(op);\n SUBDOC_OP_SETCODE(op, opcode);\n SUBDOC_OP_SETDOC(op, json.c_str(), json.size());\n SUBDOC_OP_SETVALUE(op, vbuf, nvbuf);\n\n uint16_t rv = subdoc_op_exec(op, path.c_str(), path.size());\n if (rv != SUBDOC_STATUS_SUCCESS) {\n throw string(\"Operation failed!\");\n }\n }\n\n \/\/ Print the result.\n if (opcode == SUBDOC_CMD_GET || opcode == SUBDOC_CMD_EXISTS) {\n string match(op->match.loc_match.at, op->match.loc_match.length);\n printf(\"%s\\n\", match.c_str());\n } else {\n string newdoc;\n for (size_t ii = 0; ii < op->doc_new_len; ii++) {\n const subdoc_LOC *loc = &op->doc_new[ii];\n newdoc.append(loc->at, loc->length);\n }\n printf(\"%s\\n\", newdoc.c_str());\n }\n\n subdoc_op_free(op);\n}\n\nstatic void\nexecPathParse(Options& o)\n{\n size_t itermax = o.o_iter.result();\n string path = o.o_path.const_result();\n subdoc_PATH *pth = subdoc_path_alloc();\n\n for (size_t ii = 0; ii < itermax; ii++) {\n subdoc_path_clear(pth);\n int rv = subdoc_path_parse(pth, path.c_str(), path.size());\n\n if (rv != 0) {\n throw string(\"Failed to parse path!\");\n }\n }\n\n subdoc_path_free(pth);\n}\n\nvoid runMain(int argc, char **argv)\n{\n Options o;\n if (!o.parser.parse(argc, argv)) {\n throw string(\"Bad options!\");\n }\n \/\/ Determine the command\n string cmdStr = o.o_cmd.const_result();\n\n uint64_t t_begin = get_nstime();\n\n if (o.opmap.find(cmdStr) != o.opmap.end()) {\n if (!o.o_jsfile.passed()) {\n throw string(\"Operation must contain file!\");\n }\n execOperation(o);\n } else if (cmdStr == \"path\") {\n execPathParse(o);\n } else {\n throw string(\"Unknown command!\");\n }\n\n uint64_t t_total = get_nstime() - t_begin;\n \/\/ Get the number of seconds:\n double n_seconds = t_total \/ 1000000000.0;\n double ops_per_sec = (double)o.o_iter.result() \/ n_seconds;\n\n fprintf(stderr, \"DURATION=%.2lfs. OPS=%lu\\n\", n_seconds, o.o_iter.result());\n fprintf(stderr, \"%.2lf OPS\/s\\n\", ops_per_sec);\n}\n\nint main(int argc, char **argv)\n{\n try {\n runMain(argc, argv);\n return EXIT_SUCCESS;\n } catch (string& exc) {\n fprintf(stderr, \"%s\\n\", exc.c_str());\n return EXIT_FAILURE;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"accurate_intersections_approx.hpp\"\n#include \"accurate_intersections_incprec.hpp\"\n#include \"accurate_intersections_resultant.hpp\"\n#include \"geometry.hpp\"\n#include \"line.hpp\"\n#include \"quadric.hpp\"\n#include \"quadric_classify.hpp\"\n#include \"timer.hpp\"\n\n#include <fstream>\n#include <iomanip>\n#include <list>\n#include <random>\n\n#include <signal.h>\n#include <unistd.h>\n\nstruct GlobalVars {\n bool run = true;\n} globals;\n\nvoid sigInt(int signum) { globals.run = false; }\n\ntemplate <int dim, typename fptype>\nstd::list<Geometry::Quadric<dim, fptype>> parseQuadrics(\n const char *fname, int *minExp, int *maxExp) {\n std::ifstream file(fname);\n if(!file.is_open()) {\n return std::list<Geometry::Quadric<dim, fptype>>();\n }\n int buf = 0;\n file >> buf;\n if(minExp != NULL) {\n *minExp = buf;\n }\n file >> buf;\n if(maxExp != NULL) {\n *maxExp = buf;\n }\n if(*minExp > 0) {\n std::cout\n << \"Cannot generate a line with these exponents\\n\"\n << *minExp << \", \" << *maxExp << \"\\n\";\n exit(1);\n }\n std::cout << \"Using \" << *minExp << \", \" << *maxExp\n << \" as the range of exponents\\n\";\n\n using Qf = Geometry::Quadric<dim, fptype>;\n int qtypeCount[QuadricClassify::QUADT_ERRORINVALID];\n for(int i = 0; i < QuadricClassify::QUADT_ERRORINVALID;\n i++)\n qtypeCount[i] = 0;\n std::list<Qf> quads;\n int imQuads = 0;\n int numQuads = 0;\n while(!file.eof()) {\n Qf q;\n file >> q;\n QuadricClassify::QuadType type =\n QuadricClassify::classifyQuadric(q);\n if(!QuadricClassify::isImaginary(type) &&\n type != QuadricClassify::QUADT_ERROR &&\n type != QuadricClassify::QUADT_DEGENERATE &&\n type != QuadricClassify::QUADT_ERRORINVALID) {\n quads.push_back(q);\n qtypeCount[type]++;\n } else {\n std::cout << \"Quadric \" << numQuads\n << \" is invalid, returned type \"\n << QuadricClassify::QuadTypeNames[type]\n << \"\\n\";\n imQuads++;\n }\n numQuads++;\n }\n for(int i = 0; i < QuadricClassify::QUADT_ERRORINVALID;\n i++) {\n std::cout << qtypeCount[i] << \" \"\n << QuadricClassify::QuadTypeNames[i] << \"\\n\";\n }\n return quads;\n}\n\nbool isSameInt(mpfr::mpreal int1, mpfr::mpreal int2) {\n \/* Use a heuristic on truth to determine whether adjacent\n * intersections occur at the same place.\n * This will basically be a threshold on the largest\n * different bit in the mantissa.\n *\/\n \/* A relative heuristic does not work when one (or both!)\n * is 0 *\/\n if(int1 == 0.0 || int2 == 0.0) {\n constexpr const double eps = 0.000001;\n return (mpfr::fabs(int1 - int2) < eps);\n }\n mpfr::mpreal largest =\n mpfr::max(mpfr::fabs(int1), mpfr::fabs(int2));\n mp_exp_t largestExp = largest.get_exp();\n mpfr::mpreal diff = mpfr::fabs(int1 - int2);\n int p1 = int1.getPrecision(), p2 = int2.getPrecision();\n int minPrec = std::min(p1, p2);\n mp_exp_t maxExp = largestExp - minPrec * 1 \/ 48,\n diffExp = diff.get_exp();\n return maxExp >= diffExp;\n}\n\ntemplate <typename ListTest, typename ListTrue>\nbool validateResults(ListTest &inter, ListTrue &truth) {\n \/* Note that because the same method is used to determine\n * if an intersection is in the list, these lists will be\n * the same length\n *\/\n if(inter->size() != truth->size()) {\n return false;\n }\n auto j = truth->begin();\n for(auto i = inter->begin();\n i != inter->end() || j != truth->end(); i++, j++) {\n if(i->q != j->q || i->intPos != j->intPos) {\n return false;\n }\n }\n return true;\n}\n\ntemplate <typename List>\nint countIP(List inter) {\n int numIP = 0;\n for(auto i : *inter) numIP += i.incPrecCount();\n return numIP;\n}\n\nusing rngAlg = std::mt19937_64;\n\ntemplate <int dim, typename fptype>\nusing randLineGen = Geometry::Line<dim, fptype> (*)(\n rngAlg &rng, int minExp, int maxExp);\n\ntemplate <int dim, typename fptype, typename cmpAlg>\nstd::shared_ptr<std::list<cmpAlg>> __attribute__((noinline))\nrunTest(\n std::list<Geometry::Quadric<dim, fptype>> &quads,\n Geometry::Line<dim, fptype> &line, Timer::Timer &timer,\n double eps = std::numeric_limits<fptype>::infinity()) {\n timer.startTimer();\n auto inter =\n Geometry::sortIntersections<dim, fptype, cmpAlg>(\n line, quads, fptype(eps));\n timer.stopTimer();\n return inter;\n}\n\ntemplate <int dim, typename fptype>\nvoid intersectionTest(\n std::list<Geometry::Quadric<dim, fptype>> &quads,\n std::ostream &results, const int numTests,\n randLineGen<dim, fptype> rlgf, int minExp, int maxExp) {\n \/* First build a scene of quadrics.\n * Then generate random lines on a disk centered at the\n * intersection of the cylinders.\n * Then sort the intersections\n * Finally validate them with a higher precision sort\n *\/\n using Vf = Geometry::Vector<dim, fptype>;\n using Pf = Geometry::Point<dim, fptype>;\n using Lf = Geometry::Line<dim, fptype>;\n\n std::random_device rd;\n rngAlg engine(rd());\n\n const double eps = 0.75 \/ (2 * quads.size());\n\n constexpr const int numTestTypes = 3;\n Timer::Timer testTimes[numTestTypes];\n struct TimeArr {\n struct TestData {\n long long ns;\n int numIP;\n bool correct;\n } mpTime, fpTime, resTime;\n } *times = new struct TimeArr[numTests];\n \/* Run the tests *\/\n int t;\n for(t = 0; t < numTests && globals.run; t++) {\n Lf line = rlgf(engine, minExp, maxExp);\n \/* Then sort the intersections *\/\n auto resultant = runTest<\n dim, fptype,\n Geometry::IntersectionResultant<dim, fptype>>(\n quads, line, testTimes[0], eps);\n auto fpApproximate = runTest<\n dim, fptype,\n Geometry::IntersectionApproximate<dim, fptype>>(\n quads, line, testTimes[1], eps);\n auto mpApproximate = runTest<\n dim, fptype,\n Geometry::IntersectionIncreasedPrec<dim, fptype>>(\n quads, line, testTimes[2], eps);\n\n times[t].resTime.ns = testTimes[0].instant_ns();\n times[t].fpTime.ns = testTimes[1].instant_ns();\n times[t].mpTime.ns = testTimes[2].instant_ns();\n\n times[t].mpTime.correct =\n validateResults(mpApproximate, resultant);\n times[t].fpTime.correct =\n validateResults(fpApproximate, resultant);\n\n times[t].resTime.numIP = countIP(resultant);\n times[t].fpTime.numIP = countIP(fpApproximate);\n times[t].mpTime.numIP = countIP(mpApproximate);\n }\n \/* Output all of the results *\/\n results << \"Test #, Approximate Times (ns), Approximates \"\n \"Correct Increased Precs, MP Time (ns), MP \"\n \"Correct, Resultants, Resultant Time (ns)\\n\";\n int resTotIP = 0;\n int fpTotIP = 0;\n int mpTotIP = 0;\n int resTotIncorrect = 0;\n int fpTotIncorrect = 0;\n for(int i = 0; i < t; i++) {\n results << i + 1 << \", \" << times[i].fpTime.ns << \", \"\n << times[i].fpTime.correct << \", \"\n << times[i].mpTime.numIP << \", \"\n << times[i].mpTime.ns << \", \"\n << times[i].mpTime.correct\n << times[i].resTime.numIP << \", \"\n << times[i].resTime.ns << \"\\n\";\n resTotIP += times[i].resTime.numIP;\n mpTotIP += times[i].mpTime.numIP;\n resTotIncorrect += 1 - times[i].resTime.correct;\n fpTotIncorrect += 1 - times[i].fpTime.correct;\n }\n results << \"\\n\"\n << \"Total FP Time: \" << testTimes[1].elapsed_s()\n << \".\" << std::setw(9) << std::setfill('0')\n << testTimes[1].elapsed_ns() << \"\\n\"\n << \"Total FP Disagreements: \" << fpTotIncorrect\n << \"\\n\\n\"\n\n << \"Total MP Computations: \" << mpTotIP << \"\\n\"\n << \"Total MP Time (s): \"\n << testTimes[2].elapsed_s() << \".\" << std::setw(9)\n << std::setfill('0') << testTimes[2].elapsed_ns()\n << \"\\n\\n\"\n\n << \"Total Resultant Computations: \" << resTotIP\n << \"\\n\"\n << \"Total Resultant Time (s): \"\n << testTimes[0].elapsed_s() << \".\" << std::setw(9)\n << std::setfill('0') << testTimes[0].elapsed_ns()\n << \"\\n\"\n << \"Total Resultant Disagreements: \"\n << resTotIncorrect << \"\\n\";\n delete[] times;\n}\n\nvoid lockCPU() {\n const int numCPUs = sysconf(_SC_NPROCESSORS_ONLN);\n const int cpuSets =\n numCPUs \/ CPU_SETSIZE + ((numCPUs % CPU_SETSIZE) > 0);\n cpu_set_t *cpus = new cpu_set_t[cpuSets];\n const size_t cpuSize = sizeof(cpu_set_t[cpuSets]);\n sched_getaffinity(0, cpuSize, cpus);\n for(int i = 1; i < numCPUs; i++) CPU_CLR(i, cpus);\n CPU_SET(0, cpus);\n sched_setaffinity(0, cpuSize, cpus);\n delete[] cpus;\n}\n\ntemplate <typename fptype>\nbool checkExp(fptype fpVal, int minExp, int maxExp) {\n if(fpVal == fptype(0.0)) {\n return true;\n }\n GenericFP::fpconvert<fptype> *fpbits =\n reinterpret_cast<GenericFP::fpconvert<fptype> *>(\n &fpVal);\n int exponent = fpbits->exponent;\n exponent -= fpbits->centralExp;\n if(exponent < minExp || exponent > maxExp) {\n return false;\n } else {\n return true;\n }\n}\n\ntemplate <int dim, typename fptype>\nGeometry::Line<dim, fptype> defRandLine(rngAlg &rng,\n int minExp,\n int maxExp) {\n constexpr const fptype minPos = 0, maxPos = 1;\n std::uniform_real_distribution<fptype> genPos(minPos,\n maxPos);\n std::uniform_real_distribution<fptype> genDir(-1.0, 1.0);\n \/* First build the line *\/\n Geometry::Vector<dim, fptype> lineDir;\n Geometry::Vector<dim, fptype> lineInt;\n for(int i = 0; i < dim; i++) {\n fptype tmp = genPos(rng);\n if(checkExp(tmp, minExp, maxExp)) {\n assert(MathFuncs::MathFuncs<fptype>::abs(tmp) >=\n 9.5367431640625e-7);\n lineInt.set(i, tmp);\n }\n tmp = genDir(rng);\n if(checkExp(tmp, minExp, maxExp)) {\n assert(MathFuncs::MathFuncs<fptype>::abs(tmp) >=\n 9.5367431640625e-7);\n lineDir.set(i, tmp);\n }\n }\n return Geometry::Line<dim, fptype>(\n Geometry::Point<dim, fptype>(lineInt), lineInt);\n}\n\ntemplate <int dim, typename fptype>\nGeometry::Line<dim, fptype> cylRandLine(rngAlg &rng,\n int minExp,\n int maxExp) {\n constexpr const fptype minPos = 0.375, maxPos = 0.625;\n std::uniform_real_distribution<fptype> genPos(minPos,\n maxPos);\n std::uniform_real_distribution<fptype> genDir(-1.0, 1.0);\n \/* First build the line *\/\n Geometry::Vector<dim, fptype> lineDir;\n Geometry::Vector<dim, fptype> lineInt;\n lineInt.set(1, genPos(rng));\n for(int i = 0; i < dim; i++) {\n lineInt.set(i, lineInt.get(1));\n lineDir.set(i, genDir(rng));\n }\n lineInt.set(0, genPos(rng));\n return Geometry::Line<dim, fptype>(\n Geometry::Point<dim, fptype>(lineInt), lineInt);\n}\n\nint main(int argc, char **argv) {\n using fptype = float;\n constexpr const int dim = 3;\n lockCPU();\n std::list<Geometry::Quadric<dim, fptype>> quads;\n const char *outFName = \"results\";\n int numTests = 1e4;\n randLineGen<dim, fptype> rlg = cylRandLine<dim, fptype>;\n int minExp, maxExp;\n if(argc > 1) {\n quads = parseQuadrics<dim, fptype>(argv[1], &minExp,\n &maxExp);\n rlg = defRandLine<dim, fptype>;\n if(argc > 2) {\n outFName = argv[2];\n if(argc > 3) numTests = atoi(argv[3]);\n }\n } else {\n quads = parseQuadrics<dim, fptype>(\"cylinders.csg\",\n &minExp, &maxExp);\n }\n std::ofstream results(outFName);\n signal(SIGINT, sigInt);\n intersectionTest(quads, results, numTests, defRandLine,\n minExp, maxExp);\n return 0;\n}\n<commit_msg>Finish fixing the output of the timing intersections test<commit_after>\n#include \"accurate_intersections_approx.hpp\"\n#include \"accurate_intersections_incprec.hpp\"\n#include \"accurate_intersections_resultant.hpp\"\n#include \"geometry.hpp\"\n#include \"line.hpp\"\n#include \"quadric.hpp\"\n#include \"quadric_classify.hpp\"\n#include \"timer.hpp\"\n\n#include <fstream>\n#include <iomanip>\n#include <list>\n#include <random>\n\n#include <signal.h>\n#include <unistd.h>\n\nstruct GlobalVars {\n bool run = true;\n} globals;\n\nvoid sigInt(int signum) { globals.run = false; }\n\ntemplate <int dim, typename fptype>\nstd::list<Geometry::Quadric<dim, fptype>> parseQuadrics(\n const char *fname, int *minExp, int *maxExp) {\n std::ifstream file(fname);\n if(!file.is_open()) {\n return std::list<Geometry::Quadric<dim, fptype>>();\n }\n int buf = 0;\n file >> buf;\n if(minExp != NULL) {\n *minExp = buf;\n }\n file >> buf;\n if(maxExp != NULL) {\n *maxExp = buf;\n }\n if(*minExp > 0) {\n std::cout\n << \"Cannot generate a line with these exponents\\n\"\n << *minExp << \", \" << *maxExp << \"\\n\";\n exit(1);\n }\n std::cout << \"Using \" << *minExp << \", \" << *maxExp\n << \" as the range of exponents\\n\";\n\n using Qf = Geometry::Quadric<dim, fptype>;\n int qtypeCount[QuadricClassify::QUADT_ERRORINVALID];\n for(int i = 0; i < QuadricClassify::QUADT_ERRORINVALID;\n i++)\n qtypeCount[i] = 0;\n std::list<Qf> quads;\n int imQuads = 0;\n int numQuads = 0;\n while(!file.eof()) {\n Qf q;\n file >> q;\n QuadricClassify::QuadType type =\n QuadricClassify::classifyQuadric(q);\n if(!QuadricClassify::isImaginary(type) &&\n type != QuadricClassify::QUADT_ERROR &&\n type != QuadricClassify::QUADT_DEGENERATE &&\n type != QuadricClassify::QUADT_ERRORINVALID) {\n quads.push_back(q);\n qtypeCount[type]++;\n } else {\n std::cout << \"Quadric \" << numQuads\n << \" is invalid, returned type \"\n << QuadricClassify::QuadTypeNames[type]\n << \"\\n\";\n imQuads++;\n }\n numQuads++;\n }\n for(int i = 0; i < QuadricClassify::QUADT_ERRORINVALID;\n i++) {\n std::cout << qtypeCount[i] << \" \"\n << QuadricClassify::QuadTypeNames[i] << \"\\n\";\n }\n return quads;\n}\n\nbool isSameInt(mpfr::mpreal int1, mpfr::mpreal int2) {\n \/* Use a heuristic on truth to determine whether adjacent\n * intersections occur at the same place.\n * This will basically be a threshold on the largest\n * different bit in the mantissa.\n *\/\n \/* A relative heuristic does not work when one (or both!)\n * is 0 *\/\n if(int1 == 0.0 || int2 == 0.0) {\n constexpr const double eps = 0.000001;\n return (mpfr::fabs(int1 - int2) < eps);\n }\n mpfr::mpreal largest =\n mpfr::max(mpfr::fabs(int1), mpfr::fabs(int2));\n mp_exp_t largestExp = largest.get_exp();\n mpfr::mpreal diff = mpfr::fabs(int1 - int2);\n int p1 = int1.getPrecision(), p2 = int2.getPrecision();\n int minPrec = std::min(p1, p2);\n mp_exp_t maxExp = largestExp - minPrec * 1 \/ 48,\n diffExp = diff.get_exp();\n return maxExp >= diffExp;\n}\n\ntemplate <typename ListTest, typename ListTrue>\nbool validateResults(ListTest &inter, ListTrue &truth) {\n \/* Note that because the same method is used to determine\n * if an intersection is in the list, these lists will be\n * the same length\n *\/\n if(inter->size() != truth->size()) {\n return false;\n }\n auto j = truth->begin();\n for(auto i = inter->begin();\n i != inter->end() || j != truth->end(); i++, j++) {\n if(i->q != j->q || i->intPos != j->intPos) {\n return false;\n }\n }\n return true;\n}\n\ntemplate <typename List>\nint countIP(List inter) {\n int numIP = 0;\n for(auto i : *inter) numIP += i.incPrecCount();\n return numIP;\n}\n\nusing rngAlg = std::mt19937_64;\n\ntemplate <int dim, typename fptype>\nusing randLineGen = Geometry::Line<dim, fptype> (*)(\n rngAlg &rng, int minExp, int maxExp);\n\ntemplate <int dim, typename fptype, typename cmpAlg>\nstd::shared_ptr<std::list<cmpAlg>> __attribute__((noinline))\nrunTest(\n std::list<Geometry::Quadric<dim, fptype>> &quads,\n Geometry::Line<dim, fptype> &line, Timer::Timer &timer,\n double eps = std::numeric_limits<fptype>::infinity()) {\n timer.startTimer();\n auto inter =\n Geometry::sortIntersections<dim, fptype, cmpAlg>(\n line, quads, fptype(eps));\n timer.stopTimer();\n return inter;\n}\n\ntemplate <int dim, typename fptype>\nvoid intersectionTest(\n std::list<Geometry::Quadric<dim, fptype>> &quads,\n std::ostream &results, const int numTests,\n randLineGen<dim, fptype> rlgf, int minExp, int maxExp) {\n \/* First build a scene of quadrics.\n * Then generate random lines on a disk centered at the\n * intersection of the cylinders.\n * Then sort the intersections\n * Finally validate them with a higher precision sort\n *\/\n using Vf = Geometry::Vector<dim, fptype>;\n using Pf = Geometry::Point<dim, fptype>;\n using Lf = Geometry::Line<dim, fptype>;\n\n std::random_device rd;\n rngAlg engine(rd());\n\n const double eps = 0.75 \/ (2 * quads.size());\n\n constexpr const int numTestTypes = 3;\n Timer::Timer testTimes[numTestTypes];\n struct TimeArr {\n struct TestData {\n long long ns;\n int numIP;\n bool correct;\n } mpTime, fpTime, resTime;\n } *times = new struct TimeArr[numTests];\n \/* Run the tests *\/\n int t;\n for(t = 0; t < numTests && globals.run; t++) {\n Lf line = rlgf(engine, minExp, maxExp);\n \/* Then sort the intersections *\/\n auto resultant = runTest<\n dim, fptype,\n Geometry::IntersectionResultant<dim, fptype>>(\n quads, line, testTimes[0], eps);\n auto fpApproximate = runTest<\n dim, fptype,\n Geometry::IntersectionApproximate<dim, fptype>>(\n quads, line, testTimes[1], eps);\n auto mpApproximate = runTest<\n dim, fptype,\n Geometry::IntersectionIncreasedPrec<dim, fptype>>(\n quads, line, testTimes[2], eps);\n\n times[t].resTime.ns = testTimes[0].instant_ns();\n times[t].fpTime.ns = testTimes[1].instant_ns();\n times[t].mpTime.ns = testTimes[2].instant_ns();\n\n times[t].mpTime.correct =\n validateResults(mpApproximate, resultant);\n times[t].fpTime.correct =\n validateResults(fpApproximate, resultant);\n\n times[t].resTime.numIP = countIP(resultant);\n times[t].fpTime.numIP = countIP(fpApproximate);\n times[t].mpTime.numIP = countIP(mpApproximate);\n }\n \/* Output all of the results *\/\n results << \"Test #, Approximate Times (ns), Approximates \"\n \"Correct, Increased Precs, MP Time (ns), MP \"\n \"Correct, Resultants, Resultant Time (ns)\\n\";\n int resTotIP = 0;\n int fpTotIP = 0;\n int mpTotIP = 0;\n int mpTotIncorrect = 0;\n int fpTotIncorrect = 0;\n for(int i = 0; i < t; i++) {\n results << i + 1 << \", \"\n\t\t\t\t\t\t<< times[i].fpTime.ns << \", \"\n << times[i].fpTime.correct << \", \"\n << times[i].mpTime.numIP << \", \"\n << times[i].mpTime.ns << \", \"\n << times[i].mpTime.correct << \", \"\n << times[i].resTime.numIP << \", \"\n << times[i].resTime.ns << \"\\n\";\n resTotIP += times[i].resTime.numIP;\n mpTotIP += times[i].mpTime.numIP;\n fpTotIncorrect += 1 - times[i].fpTime.correct;\n mpTotIncorrect += 1 - times[i].mpTime.correct;\n }\n results << \"\\n\"\n << \"Total FP Time: \" << testTimes[1].elapsed_s()\n << \".\" << std::setw(9) << std::setfill('0')\n << testTimes[1].elapsed_ns() << \"\\n\"\n << \"Total FP Disagreements: \" << fpTotIncorrect\n << \"\\n\\n\"\n\n << \"Total MP Computations: \" << mpTotIP << \"\\n\"\n << \"Total MP Time (s): \"\n << testTimes[2].elapsed_s() << \".\" << std::setw(9)\n << std::setfill('0') << testTimes[2].elapsed_ns()\n << \"\\n\"\n << \"Total Resultant Disagreements: \"\n << mpTotIncorrect << \"\\n\\n\"\n\n << \"Total Resultant Computations: \" << resTotIP\n << \"\\n\"\n << \"Total Resultant Time (s): \"\n << testTimes[0].elapsed_s() << \".\" << std::setw(9)\n << std::setfill('0') << testTimes[0].elapsed_ns()\n << \"\\n\";\n delete[] times;\n}\n\nvoid lockCPU() {\n const int numCPUs = sysconf(_SC_NPROCESSORS_ONLN);\n const int cpuSets =\n numCPUs \/ CPU_SETSIZE + ((numCPUs % CPU_SETSIZE) > 0);\n cpu_set_t *cpus = new cpu_set_t[cpuSets];\n const size_t cpuSize = sizeof(cpu_set_t[cpuSets]);\n sched_getaffinity(0, cpuSize, cpus);\n for(int i = 1; i < numCPUs; i++) CPU_CLR(i, cpus);\n CPU_SET(0, cpus);\n sched_setaffinity(0, cpuSize, cpus);\n delete[] cpus;\n}\n\ntemplate <typename fptype>\nbool checkExp(fptype fpVal, int minExp, int maxExp) {\n if(fpVal == fptype(0.0)) {\n return true;\n }\n GenericFP::fpconvert<fptype> *fpbits =\n reinterpret_cast<GenericFP::fpconvert<fptype> *>(\n &fpVal);\n int exponent = fpbits->exponent;\n exponent -= fpbits->centralExp;\n if(exponent < minExp || exponent > maxExp) {\n return false;\n } else {\n return true;\n }\n}\n\ntemplate <int dim, typename fptype>\nGeometry::Line<dim, fptype> defRandLine(rngAlg &rng,\n int minExp,\n int maxExp) {\n constexpr const fptype minPos = 0, maxPos = 1;\n std::uniform_real_distribution<fptype> genPos(minPos,\n maxPos);\n std::uniform_real_distribution<fptype> genDir(-1.0, 1.0);\n \/* First build the line *\/\n Geometry::Vector<dim, fptype> lineDir;\n Geometry::Vector<dim, fptype> lineInt;\n for(int i = 0; i < dim; i++) {\n fptype tmp = genPos(rng);\n if(checkExp(tmp, minExp, maxExp)) {\n assert(MathFuncs::MathFuncs<fptype>::abs(tmp) >=\n 9.5367431640625e-7);\n lineInt.set(i, tmp);\n }\n tmp = genDir(rng);\n if(checkExp(tmp, minExp, maxExp)) {\n assert(MathFuncs::MathFuncs<fptype>::abs(tmp) >=\n 9.5367431640625e-7);\n lineDir.set(i, tmp);\n }\n }\n return Geometry::Line<dim, fptype>(\n Geometry::Point<dim, fptype>(lineInt), lineInt);\n}\n\ntemplate <int dim, typename fptype>\nGeometry::Line<dim, fptype> cylRandLine(rngAlg &rng,\n int minExp,\n int maxExp) {\n constexpr const fptype minPos = 0.375, maxPos = 0.625;\n std::uniform_real_distribution<fptype> genPos(minPos,\n maxPos);\n std::uniform_real_distribution<fptype> genDir(-1.0, 1.0);\n \/* First build the line *\/\n Geometry::Vector<dim, fptype> lineDir;\n Geometry::Vector<dim, fptype> lineInt;\n lineInt.set(1, genPos(rng));\n for(int i = 0; i < dim; i++) {\n lineInt.set(i, lineInt.get(1));\n lineDir.set(i, genDir(rng));\n }\n lineInt.set(0, genPos(rng));\n return Geometry::Line<dim, fptype>(\n Geometry::Point<dim, fptype>(lineInt), lineInt);\n}\n\nint main(int argc, char **argv) {\n using fptype = float;\n constexpr const int dim = 3;\n lockCPU();\n std::list<Geometry::Quadric<dim, fptype>> quads;\n const char *outFName = \"results\";\n int numTests = 1e4;\n randLineGen<dim, fptype> rlg = cylRandLine<dim, fptype>;\n int minExp, maxExp;\n if(argc > 1) {\n quads = parseQuadrics<dim, fptype>(argv[1], &minExp,\n &maxExp);\n rlg = defRandLine<dim, fptype>;\n if(argc > 2) {\n outFName = argv[2];\n if(argc > 3) numTests = atoi(argv[3]);\n }\n } else {\n quads = parseQuadrics<dim, fptype>(\"cylinders.csg\",\n &minExp, &maxExp);\n }\n std::ofstream results(outFName);\n signal(SIGINT, sigInt);\n intersectionTest(quads, results, numTests, defRandLine,\n minExp, maxExp);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <thread>\n#include \"halley\/tools\/assets\/import_assets_task.h\"\n#include \"halley\/tools\/assets\/check_assets_task.h\"\n#include \"halley\/tools\/project\/project.h\"\n#include \"halley\/tools\/assets\/import_assets_database.h\"\n#include \"halley\/resources\/resource_data.h\"\n#include \"halley\/tools\/file\/filesystem.h\"\n#include \"halley\/tools\/assets\/asset_collector.h\"\n#include \"halley\/concurrency\/concurrent.h\"\n#include \"halley\/tools\/packer\/asset_packer_task.h\"\n#include \"halley\/support\/logger.h\"\n#include \"halley\/time\/stopwatch.h\"\n#include \"halley\/support\/debug.h\"\n\nusing namespace Halley;\n\nImportAssetsTask::ImportAssetsTask(String taskName, ImportAssetsDatabase& db, std::shared_ptr<AssetImporter> importer, Path assetsPath, Vector<ImportAssetsDatabaseEntry> files, std::vector<String> deletedAssets, Project& project, bool packAfter)\n\t: EditorTask(taskName, true, true)\n\t, db(db)\n\t, importer(importer)\n\t, assetsPath(assetsPath)\n\t, project(project)\n\t, packAfter(packAfter)\n\t, files(std::move(files))\n\t, deletedAssets(std::move(deletedAssets))\n\t, totalImportTime(0)\n{}\n\nvoid ImportAssetsTask::run()\n{\n\tStopwatch timer;\n\tusing namespace std::chrono_literals;\n\tauto lastSave = std::chrono::steady_clock::now();\n\n\tassetsImported = 0;\n\tassetsToImport = files.size();\n\tstd::vector<Future<void>> tasks;\n\n\tconstexpr bool parallelImport = !Debug::isDebug();\n\n\tfor (size_t i = 0; i < files.size(); ++i) {\n\t\tauto importFunc = [&, i] () {\n\t\t\tif (isCancelled()) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (doImportAsset(files[i])) {\n\t\t\t\t++assetsImported;\n\t\t\t\tsetProgress(float(assetsImported) * 0.98f \/ float(assetsToImport), files[i].assetId);\n\t\t\t}\n\n\t\t\tauto now = std::chrono::steady_clock::now();\n\t\t\tif (now - lastSave > 1s) {\n\t\t\t\tdb.save();\n\t\t\t\tlastSave = now;\n\t\t\t}\n\t\t};\n\n\t\tif (parallelImport) {\n\t\t\ttasks.push_back(Concurrent::execute(Executors::getCPUAux(), importFunc));\n\t\t} else {\n\t\t\timportFunc();\n\t\t}\n\t}\n\n\tConcurrent::whenAll(tasks.begin(), tasks.end()).get();\n\tdb.save();\n\n\tif (!isCancelled()) {\n\t\tsetProgress(1.0f, \"\");\n\n\t\tif (!hasError()) {\n\t\t\tif (!outputAssets.empty()) {\n\t\t\t\tConcurrent::execute(Executors::getMainThread(), [project = &project, assets = outputAssets] () {\n\t\t\t\t\tproject->reloadAssets(assets, false);\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (files.size() == 1 && files[0].assetId == \":codegen\") {\n\t\t\t\tConcurrent::execute(Executors::getMainThread(), [project = &project]() {\n\t\t\t\t\tproject->reloadCodegen();\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (packAfter) {\n\t\t\t\taddContinuation(EditorTaskAnchor(std::make_unique<AssetPackerTask>(project, std::move(outputAssets), std::move(deletedAssets))));\n\t\t\t}\n\t\t}\n\t}\n\n\ttimer.pause();\n\tTime realTime = timer.elapsedNanoseconds() \/ 1000000000.0;\n\tTime importTime = totalImportTime \/ 1000000000.0;\n\tLogger::logInfo(\"Import took \" + toString(realTime) + \" seconds, on which \" + toString(importTime) + \" seconds of work were performed (\" + toString(importTime \/ realTime) + \"x realtime)\");\n}\n\nbool ImportAssetsTask::doImportAsset(ImportAssetsDatabaseEntry& asset)\n{\n\tLogger::logInfo(\"Importing \" + asset.assetId);\n\tStopwatch timer;\n\n\tauto result = importAsset(asset, [&] (const Path& path) { return db.getMetadata(path); }, *importer, assetsPath, [=] (float, const String&) -> bool { return !isCancelled(); });\n\t\n\tif (!result.success) {\n\t\taddError(\"\\\"\" + asset.assetId + \"\\\" - \" + result.errorMsg);\n\t\tasset.additionalInputFiles = std::move(result.additionalInputs);\n\t\tdb.markFailed(asset);\n\n\t\treturn false;\n\t}\n\t\n\t\/\/ Check if it didn't get cancelled\n\tif (isCancelled()) {\n\t\treturn false;\n\t}\n\n\t\/\/ Retrieve previous output from this asset, and remove any files which went missing\n\tauto previous = db.getOutFiles(asset.assetId);\n\tfor (auto& f: previous) {\n\t\tfor (auto& v: f.platformVersions) {\n\t\t\tif (std::find_if(result.outFiles.begin(), result.outFiles.end(), [&] (const std::pair<Path, Bytes>& r) { return r.first == v.second.filepath; }) == result.outFiles.end()) {\n\t\t\t\t\/\/ File no longer exists as part of this asset, remove it\n\t\t\t\tFileSystem::remove(assetsPath \/ v.second.filepath);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Write files\n\tfor (auto& outFile: result.outFiles) {\n\t\tauto path = assetsPath \/ outFile.first;\n\t\tLogger::logInfo(\"- \" + asset.assetId + \" -> \" + path + \" (\" + String::prettySize(outFile.second.size()) + \")\");\n\t\tFileSystem::writeFile(path, outFile.second);\n\t}\n\n\t\/\/ Add to list of output assets\n\tfor (auto& o: result.out) {\n\t\tstd::unique_lock<std::mutex> lock(mutex);\n\t\toutputAssets.insert(toString(o.type) + \":\" + o.name);\n\t}\n\n\t\/\/ Store output in db\n\tasset.additionalInputFiles = std::move(result.additionalInputs);\n\tasset.outputFiles = std::move(result.out);\n\tdb.markAsImported(asset);\n\n\ttimer.pause();\n\ttotalImportTime += timer.elapsedNanoseconds();\n\n\treturn true;\n}\n\nImportAssetsTask::ImportResult ImportAssetsTask::importAsset(const ImportAssetsDatabaseEntry& asset, const MetadataFetchCallback& metadataFetcher, const AssetImporter& importer, Path assetsPath, AssetCollector::ProgressReporter progressReporter)\n{\n\tImportResult result;\n\t\n\ttry {\n\t\t\/\/ Create queue\n\t\tstd::list<ImportingAsset> toLoad;\n\n\t\t\/\/ Load files from disk\n\t\tImportingAsset importingAsset;\n\t\timportingAsset.assetId = asset.assetId;\n\t\timportingAsset.assetType = asset.assetType;\n\t\tfor (auto& f: asset.inputFiles) {\n\t\t\tauto meta = metadataFetcher(f.getPath());\n\t\t\tauto data = FileSystem::readFile(asset.srcDir \/ f.getDataPath());\n\t\t\tif (data.empty()) {\n\t\t\t\tLogger::logError(\"Data for \\\"\" + toString(asset.srcDir \/ f.getPath()) + \"\\\" is empty.\");\n\t\t\t}\n\t\t\timportingAsset.inputFiles.emplace_back(ImportingAssetFile(f.getPath(), std::move(data), meta ? meta.value() : Metadata()));\n\t\t}\n\t\ttoLoad.emplace_back(std::move(importingAsset));\n\n\t\t\/\/ Import\n\t\twhile (!toLoad.empty()) {\n\t\t\tauto cur = std::move(toLoad.front());\n\t\t\ttoLoad.pop_front();\n\t\t\t\n\t\t\tAssetCollector collector(cur, assetsPath, importer.getAssetsSrc(), progressReporter);\n\n\t\t\tfor (const auto& importer: importer.getImporters(cur.assetType)) {\n\t\t\t\ttry {\n\t\t\t\t\timporter.get().import(cur, collector);\n\t\t\t\t} catch (...) {\n\t\t\t\t\tfor (auto& i: collector.getAdditionalInputs()) {\n\t\t\t\t\t\tresult.additionalInputs.push_back(std::move(i));\n\t\t\t\t\t}\n\t\t\t\t\tthrow;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (auto& additional: collector.collectAdditionalAssets()) {\n\t\t\t\ttoLoad.emplace_front(std::move(additional));\n\t\t\t}\n\n\t\t\tfor (auto& outFile: collector.collectOutFiles()) {\n\t\t\t\tresult.outFiles.push_back(std::move(outFile));\n\t\t\t}\n\n\t\t\tfor (auto& o: collector.getAssets()) {\n\t\t\t\tresult.out.push_back(std::move(o));\n\t\t\t}\n\n\t\t\tfor (auto& i: collector.getAdditionalInputs()) {\n\t\t\t\tresult.additionalInputs.push_back(std::move(i));\n\t\t\t}\n\t\t}\n\t\t\n\t\tresult.success = true;\n\t} catch (std::exception& e) {\n\t\tresult.errorMsg = e.what();\n\t\tresult.success = false;\n\t}\n\n\treturn result;\n}\n<commit_msg>Fix some constness.<commit_after>#include <thread>\n#include \"halley\/tools\/assets\/import_assets_task.h\"\n#include \"halley\/tools\/assets\/check_assets_task.h\"\n#include \"halley\/tools\/project\/project.h\"\n#include \"halley\/tools\/assets\/import_assets_database.h\"\n#include \"halley\/resources\/resource_data.h\"\n#include \"halley\/tools\/file\/filesystem.h\"\n#include \"halley\/tools\/assets\/asset_collector.h\"\n#include \"halley\/concurrency\/concurrent.h\"\n#include \"halley\/tools\/packer\/asset_packer_task.h\"\n#include \"halley\/support\/logger.h\"\n#include \"halley\/time\/stopwatch.h\"\n#include \"halley\/support\/debug.h\"\n\nusing namespace Halley;\n\nImportAssetsTask::ImportAssetsTask(String taskName, ImportAssetsDatabase& db, std::shared_ptr<AssetImporter> importer, Path assetsPath, Vector<ImportAssetsDatabaseEntry> files, std::vector<String> deletedAssets, Project& project, bool packAfter)\n\t: EditorTask(taskName, true, true)\n\t, db(db)\n\t, importer(importer)\n\t, assetsPath(assetsPath)\n\t, project(project)\n\t, packAfter(packAfter)\n\t, files(std::move(files))\n\t, deletedAssets(std::move(deletedAssets))\n\t, totalImportTime(0)\n{}\n\nvoid ImportAssetsTask::run()\n{\n\tStopwatch timer;\n\tusing namespace std::chrono_literals;\n\tauto lastSave = std::chrono::steady_clock::now();\n\n\tassetsImported = 0;\n\tassetsToImport = files.size();\n\tstd::vector<Future<void>> tasks;\n\n\tconstexpr bool parallelImport = !Debug::isDebug();\n\n\tfor (size_t i = 0; i < files.size(); ++i) {\n\t\tauto importFunc = [&, i] () {\n\t\t\tif (isCancelled()) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tif (doImportAsset(files[i])) {\n\t\t\t\t++assetsImported;\n\t\t\t\tsetProgress(float(assetsImported) * 0.98f \/ float(assetsToImport), files[i].assetId);\n\t\t\t}\n\n\t\t\tauto now = std::chrono::steady_clock::now();\n\t\t\tif (now - lastSave > 1s) {\n\t\t\t\tdb.save();\n\t\t\t\tlastSave = now;\n\t\t\t}\n\t\t};\n\n\t\tif (parallelImport) {\n\t\t\ttasks.push_back(Concurrent::execute(Executors::getCPUAux(), importFunc));\n\t\t} else {\n\t\t\timportFunc();\n\t\t}\n\t}\n\n\tConcurrent::whenAll(tasks.begin(), tasks.end()).get();\n\tdb.save();\n\n\tif (!isCancelled()) {\n\t\tsetProgress(1.0f, \"\");\n\n\t\tif (!hasError()) {\n\t\t\tif (!outputAssets.empty()) {\n\t\t\t\tConcurrent::execute(Executors::getMainThread(), [project = &project, assets = outputAssets] () {\n\t\t\t\t\tproject->reloadAssets(assets, false);\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (files.size() == 1 && files[0].assetId == \":codegen\") {\n\t\t\t\tConcurrent::execute(Executors::getMainThread(), [project = &project]() {\n\t\t\t\t\tproject->reloadCodegen();\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tif (packAfter) {\n\t\t\t\taddContinuation(EditorTaskAnchor(std::make_unique<AssetPackerTask>(project, std::move(outputAssets), std::move(deletedAssets))));\n\t\t\t}\n\t\t}\n\t}\n\n\ttimer.pause();\n\tTime realTime = timer.elapsedNanoseconds() \/ 1000000000.0;\n\tTime importTime = totalImportTime \/ 1000000000.0;\n\tLogger::logInfo(\"Import took \" + toString(realTime) + \" seconds, on which \" + toString(importTime) + \" seconds of work were performed (\" + toString(importTime \/ realTime) + \"x realtime)\");\n}\n\nbool ImportAssetsTask::doImportAsset(ImportAssetsDatabaseEntry& asset)\n{\n\tLogger::logInfo(\"Importing \" + asset.assetId);\n\tStopwatch timer;\n\n\tauto result = importAsset(asset, [&] (const Path& path) { return db.getMetadata(path); }, *importer, assetsPath, [=] (float, const String&) -> bool { return !isCancelled(); });\n\t\n\tif (!result.success) {\n\t\taddError(\"\\\"\" + asset.assetId + \"\\\" - \" + result.errorMsg);\n\t\tasset.additionalInputFiles = std::move(result.additionalInputs);\n\t\tdb.markFailed(asset);\n\n\t\treturn false;\n\t}\n\t\n\t\/\/ Check if it didn't get cancelled\n\tif (isCancelled()) {\n\t\treturn false;\n\t}\n\n\t\/\/ Retrieve previous output from this asset, and remove any files which went missing\n\tauto previous = db.getOutFiles(asset.assetId);\n\tfor (auto& f: previous) {\n\t\tfor (auto& v: f.platformVersions) {\n\t\t\tif (std::find_if(result.outFiles.begin(), result.outFiles.end(), [&] (const std::pair<Path, Bytes>& r) { return r.first == v.second.filepath; }) == result.outFiles.end()) {\n\t\t\t\t\/\/ File no longer exists as part of this asset, remove it\n\t\t\t\tFileSystem::remove(assetsPath \/ v.second.filepath);\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ Write files\n\tfor (auto& outFile: result.outFiles) {\n\t\tauto path = assetsPath \/ outFile.first;\n\t\tLogger::logInfo(\"- \" + asset.assetId + \" -> \" + path + \" (\" + String::prettySize(outFile.second.size()) + \")\");\n\t\tFileSystem::writeFile(path, outFile.second);\n\t}\n\n\t\/\/ Add to list of output assets\n\tfor (auto& o: result.out) {\n\t\tstd::unique_lock<std::mutex> lock(mutex);\n\t\toutputAssets.insert(toString(o.type) + \":\" + o.name);\n\t}\n\n\t\/\/ Store output in db\n\tasset.additionalInputFiles = std::move(result.additionalInputs);\n\tasset.outputFiles = std::move(result.out);\n\tdb.markAsImported(asset);\n\n\ttimer.pause();\n\ttotalImportTime += timer.elapsedNanoseconds();\n\n\treturn true;\n}\n\nImportAssetsTask::ImportResult ImportAssetsTask::importAsset(const ImportAssetsDatabaseEntry& asset, const MetadataFetchCallback& metadataFetcher, const AssetImporter& importer, Path assetsPath, AssetCollector::ProgressReporter progressReporter)\n{\n\tImportResult result;\n\t\n\ttry {\n\t\t\/\/ Create queue\n\t\tstd::list<ImportingAsset> toLoad;\n\n\t\t\/\/ Load files from disk\n\t\tImportingAsset importingAsset;\n\t\timportingAsset.assetId = asset.assetId;\n\t\timportingAsset.assetType = asset.assetType;\n\t\tfor (const auto& f: asset.inputFiles) {\n\t\t\tauto meta = metadataFetcher(f.getPath());\n\t\t\tauto data = FileSystem::readFile(asset.srcDir \/ f.getDataPath());\n\t\t\tif (data.empty()) {\n\t\t\t\tLogger::logError(\"Data for \\\"\" + toString(asset.srcDir \/ f.getPath()) + \"\\\" is empty.\");\n\t\t\t}\n\t\t\timportingAsset.inputFiles.emplace_back(ImportingAssetFile(f.getPath(), std::move(data), meta ? meta.value() : Metadata()));\n\t\t}\n\t\ttoLoad.emplace_back(std::move(importingAsset));\n\n\t\t\/\/ Import\n\t\twhile (!toLoad.empty()) {\n\t\t\tauto cur = std::move(toLoad.front());\n\t\t\ttoLoad.pop_front();\n\t\t\t\n\t\t\tAssetCollector collector(cur, assetsPath, importer.getAssetsSrc(), progressReporter);\n\n\t\t\tfor (const auto& assetImporter: importer.getImporters(cur.assetType)) {\n\t\t\t\ttry {\n\t\t\t\t\tassetImporter.get().import(cur, collector);\n\t\t\t\t} catch (...) {\n\t\t\t\t\tfor (const auto& i: collector.getAdditionalInputs()) {\n\t\t\t\t\t\tresult.additionalInputs.push_back(i);\n\t\t\t\t\t}\n\t\t\t\t\tthrow;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tfor (auto& additional: collector.collectAdditionalAssets()) {\n\t\t\t\ttoLoad.emplace_front(std::move(additional));\n\t\t\t}\n\n\t\t\tfor (auto& outFile: collector.collectOutFiles()) {\n\t\t\t\tresult.outFiles.push_back(std::move(outFile));\n\t\t\t}\n\n\t\t\tfor (const auto& o: collector.getAssets()) {\n\t\t\t\tresult.out.push_back(o);\n\t\t\t}\n\n\t\t\tfor (const auto& i: collector.getAdditionalInputs()) {\n\t\t\t\tresult.additionalInputs.push_back(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tresult.success = true;\n\t} catch (std::exception& e) {\n\t\tresult.errorMsg = e.what();\n\t\tresult.success = false;\n\t}\n\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include<bits\/stdc++.h>\nusing namespace std;\n\nint calculate(int val[], int wt[], int W){\n int K[sizeof(val)\/sizeof(val[0])+1][W+1];\n\n for(int i=0; i <= sizeof(val)\/sizeof(val[0]); i++){\n for(int j=0; j <= W; j++){\n if(i == 0 || j == 0){\n K[i][j] = 0;\n continue;\n }\n if(j - wt[i-1] >= 0){\n K[i][j] = max(K[i-1][j], K[i-1][j-wt[i-1]] + val[i-1]);\n }else{\n K[i][j] = K[i-1][j];\n }\n }\n }\n return K[sizeof(val)\/sizeof(val[0])][W];\n }\n\n int main(){\n\n int val[] = {60,20,15,30};\n int wt[] = {4,2,3,5};\n int r = calculate(val, wt, 8);\n cout<<r;\n return 0;\n }\n\n<commit_msg>C++ way<commit_after>#include <iostream>\n#include<bits\/stdc++.h>\nusing namespace std;\n\nint calculate(int val[], int wt[], int W){\n int K[sizeof(val)\/sizeof(val[0])][W+1];\n for(i=0;i<sizeof(sizeof(val)\/sizeof(val[0]));i++){\n K[i][0]=0;\n }\n for(j=0;j<W+1;j++){\n K[0][j]=1;\n }\n\n for(int i=1; i < sizeof(val)\/sizeof(val[0]); i++){\n for(int j=0; j <= W; j++){\n \n if(j - wt[i] >= 0){\n K[i][j] = max(K[i-1][j], K[i-1][j-wt[i]] + val[i]);\n }else{\n K[i][j] = K[i-1][j];\n }\n }\n }\n return K[sizeof(val)\/sizeof(val[0])][W];\n }\n\n int main(){\n\n int val[] = {60,20,15,30};\n int wt[] = {4,2,3,5};\n int r = calculate(val, wt, 8);\n cout<<r;\n return 0;\n }\n\n<|endoftext|>"} {"text":"<commit_before>#include <miopen\/temp_file.hpp>\n#include <miopen\/errors.hpp>\n\n#ifndef WIN32\n#include <unistd.h>\n#else\n#include <Windows.h>\n#include <fcntl.h>\n#include <io.h>\n#define _O_EXCL 0x0400\n#define O_EXCL _O_EXCL\n\/* mkstemp extracted from libc\/sysdeps\/posix\/tempname.c. Copyright\n(C) 1991-1999, 2000, 2001, 2006 Free Software Foundation, Inc.\n\nThe GNU C Library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version. *\/\n\nstatic const char letters[] =\n\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\";\n\n\/* Generate a temporary file name based on TMPL. TMPL must match the\nrules for mk[s]temp (i.e. end in \"XXXXXX\"). The name constructed\ndoes not exist at the time of the call to mkstemp. TMPL is\noverwritten with the result. *\/\nstatic int\nmkstemp(char *tmpl)\n{\n\tint len;\n\tchar *XXXXXX;\n\tstatic unsigned long long value;\n\tunsigned long long random_time_bits;\n\tunsigned int count;\n\tint fd = -1;\n\tint save_errno = errno;\n\n\t\/* A lower bound on the number of temporary files to attempt to\n\tgenerate. The maximum total number of temporary file names that\n\tcan exist for a given template is 62**6. It should never be\n\tnecessary to try all these combinations. Instead if a reasonable\n\tnumber of names is tried (we define reasonable as 62**3) fail to\n\tgive the system administrator the chance to remove the problems. *\/\n#define ATTEMPTS_MIN (62 * 62 * 62)\n\n\t\/* The number of times to attempt to generate a temporary file. To\n\tconform to POSIX, this must be no smaller than TMP_MAX. *\/\n#if ATTEMPTS_MIN < TMP_MAX\n\tunsigned int attempts = TMP_MAX;\n#else\n\tunsigned int attempts = ATTEMPTS_MIN;\n#endif\n\n\tlen = strlen(tmpl);\n\tif (len < 6 || strcmp(&tmpl[len - 6], \"XXXXXX\"))\n\t{\n\t\terrno = EINVAL;\n\t\treturn -1;\n\t}\n\n\t\/* This is where the Xs start. *\/\n\tXXXXXX = &tmpl[len - 6];\n\n\t\/* Get some more or less random data. *\/\n\t{\n\t\tSYSTEMTIME stNow;\n\t\tFILETIME ftNow;\n\n\t\t\/\/ get system time\n\t\tGetSystemTime(&stNow);\n\t\tstNow.wMilliseconds = 500;\n\t\tif (!SystemTimeToFileTime(&stNow, &ftNow))\n\t\t{\n\t\t\terrno = -1;\n\t\t\treturn -1;\n\t\t}\n\n\t\trandom_time_bits = (((unsigned long long)ftNow.dwHighDateTime << 32)\n\t\t\t| (unsigned long long)ftNow.dwLowDateTime);\n\t}\n\tvalue += random_time_bits ^ (unsigned long long)GetCurrentThreadId();\n\n\tfor (count = 0; count < attempts; value += 7777, ++count)\n\t{\n\t\tunsigned long long v = value;\n\n\t\t\/* Fill in the random bits. *\/\n\t\tXXXXXX[0] = letters[v % 62];\n\t\tv \/= 62;\n\t\tXXXXXX[1] = letters[v % 62];\n\t\tv \/= 62;\n\t\tXXXXXX[2] = letters[v % 62];\n\t\tv \/= 62;\n\t\tXXXXXX[3] = letters[v % 62];\n\t\tv \/= 62;\n\t\tXXXXXX[4] = letters[v % 62];\n\t\tv \/= 62;\n\t\tXXXXXX[5] = letters[v % 62];\n\n\t\tfd = open(tmpl, O_RDWR | O_CREAT | O_EXCL, _S_IREAD | _S_IWRITE);\n\t\tif (fd >= 0)\n\t\t{\n\t\t\terrno = save_errno;\n\t\t\treturn fd;\n\t\t}\n\t\telse if (errno != EEXIST)\n\t\t\treturn -1;\n\t}\n\n\t\/* We got out of the loop because we ran out of combinations to try. *\/\n\terrno = EEXIST;\n\treturn -1;\n}\n#endif\nnamespace miopen {\nTempFile::TempFile(const std::string& path_template)\n : _path((GetTempDirectoryPath().path \/ (path_template + \"-XXXXXX\")).string())\n{\n _fd = mkstemp(&_path[0]);\n if(_fd == -1)\n {\n MIOPEN_THROW(\"Error: TempFile: mkstemp()\");\n }\n}\n\nTempFile::~TempFile()\n{\n const int remove_rc = std::remove(_path.c_str());\n const int close_rc = close(_fd);\n if(remove_rc != 0 || close_rc != 0)\n {\n#ifndef NDEBUG \/\/ Be quiet in release versions.\n std::fprintf(stderr,\n \"Error: TempFile: On removal of '%s', remove_rc = %d, close_rc = %d.\\n\",\n _path.c_str(),\n remove_rc,\n close_rc);\n#endif\n }\n}\n\nconst TmpDir& TempFile::GetTempDirectoryPath()\n{\n static const TmpDir dir(\"tmp\");\n return dir;\n}\n} \/\/ namespace miopen\n<commit_msg>windows build fix<commit_after>#include <miopen\/temp_file.hpp>\n#include <miopen\/errors.hpp>\n\n#ifndef WIN32\n#include <unistd.h>\n#else\n#include <Windows.h>\n#include <fcntl.h>\n#include <io.h>\n#define _O_EXCL 0x0400\n#define O_EXCL _O_EXCL\n\/* mkstemp extracted from libc\/sysdeps\/posix\/tempname.c. Copyright\n(C) 1991-1999, 2000, 2001, 2006 Free Software Foundation, Inc.\n\nThe GNU C Library is free software; you can redistribute it and\/or\nmodify it under the terms of the GNU Lesser General Public\nLicense as published by the Free Software Foundation; either\nversion 2.1 of the License, or (at your option) any later version. *\/\n\nstatic const char letters[] = \"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789\";\n\n\/* Generate a temporary file name based on TMPL. TMPL must match the\nrules for mk[s]temp (i.e. end in \"XXXXXX\"). The name constructed\ndoes not exist at the time of the call to mkstemp. TMPL is\noverwritten with the result. *\/\nstatic int mkstemp(char* tmpl)\n{\n int len;\n char* XXXXXX;\n static unsigned long long value;\n unsigned long long random_time_bits;\n unsigned int count;\n int fd = -1;\n int save_errno = errno;\n\n\/* A lower bound on the number of temporary files to attempt to\ngenerate. The maximum total number of temporary file names that\ncan exist for a given template is 62**6. It should never be\nnecessary to try all these combinations. Instead if a reasonable\nnumber of names is tried (we define reasonable as 62**3) fail to\ngive the system administrator the chance to remove the problems. *\/\n#define ATTEMPTS_MIN (62 * 62 * 62)\n\n\/* The number of times to attempt to generate a temporary file. To\nconform to POSIX, this must be no smaller than TMP_MAX. *\/\n#if ATTEMPTS_MIN < TMP_MAX\n unsigned int attempts = TMP_MAX;\n#else\n unsigned int attempts = ATTEMPTS_MIN;\n#endif\n\n len = strlen(tmpl);\n if(len < 6 || strcmp(&tmpl[len - 6], \"XXXXXX\"))\n {\n errno = EINVAL;\n return -1;\n }\n\n \/* This is where the Xs start. *\/\n XXXXXX = &tmpl[len - 6];\n\n \/* Get some more or less random data. *\/\n {\n SYSTEMTIME stNow;\n FILETIME ftNow;\n\n \/\/ get system time\n GetSystemTime(&stNow);\n stNow.wMilliseconds = 500;\n if(!SystemTimeToFileTime(&stNow, &ftNow))\n {\n errno = -1;\n return -1;\n }\n\n random_time_bits = (((unsigned long long)ftNow.dwHighDateTime << 32) |\n (unsigned long long)ftNow.dwLowDateTime);\n }\n value += random_time_bits ^ (unsigned long long)GetCurrentThreadId();\n\n for(count = 0; count < attempts; value += 7777, ++count)\n {\n unsigned long long v = value;\n\n \/* Fill in the random bits. *\/\n XXXXXX[0] = letters[v % 62];\n v \/= 62;\n XXXXXX[1] = letters[v % 62];\n v \/= 62;\n XXXXXX[2] = letters[v % 62];\n v \/= 62;\n XXXXXX[3] = letters[v % 62];\n v \/= 62;\n XXXXXX[4] = letters[v % 62];\n v \/= 62;\n XXXXXX[5] = letters[v % 62];\n\n fd = open(tmpl, O_RDWR | O_CREAT | O_EXCL, _S_IREAD | _S_IWRITE);\n if(fd >= 0)\n {\n errno = save_errno;\n return fd;\n }\n else if(errno != EEXIST)\n return -1;\n }\n\n \/* We got out of the loop because we ran out of combinations to try. *\/\n errno = EEXIST;\n return -1;\n}\n#endif\nnamespace miopen {\nTempFile::TempFile(const std::string& path_template)\n : _path((GetTempDirectoryPath().path \/ (path_template + \"-XXXXXX\")).string())\n{\n _fd = mkstemp(&_path[0]);\n if(_fd == -1)\n {\n MIOPEN_THROW(\"Error: TempFile: mkstemp()\");\n }\n}\n\nTempFile::~TempFile()\n{\n const int remove_rc = std::remove(_path.c_str());\n const int close_rc = close(_fd);\n if(remove_rc != 0 || close_rc != 0)\n {\n#ifndef NDEBUG \/\/ Be quiet in release versions.\n std::fprintf(stderr,\n \"Error: TempFile: On removal of '%s', remove_rc = %d, close_rc = %d.\\n\",\n _path.c_str(),\n remove_rc,\n close_rc);\n#endif\n }\n}\n\nconst TmpDir& TempFile::GetTempDirectoryPath()\n{\n static const TmpDir dir(\"tmp\");\n return dir;\n}\n} \/\/ namespace miopen\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <ctime>\n#include \"lib\/base64_sha1.hh\"\n#include <openssl\/sha.h>\n\nunsigned long generate_random_num() {\n\treturn rand();\n}\n\nint main(int argc, char const *argv[])\n{\n\tsrand((unsigned)time(NULL));\n\tstring key;\n\tstring sh;\n\n\tcin >> key;\n\n\tcout << SHA1((unsigned char*)key.c_str(), key.size(), NULL) << endl;\n\n\tcout << generate_random_num() << endl;\n\n\treturn 0;\n}<commit_msg>Working sha1 encrypt<commit_after>#include <cstdio>\n#include <cstdlib>\n#include <ctime>\n#include \"lib\/base64_sha1.hh\"\n#include <openssl\/sha.h>\n\nunsigned long generate_random_num() {\n\treturn rand();\n}\n\nint main(int argc, char const *argv[])\n{\n\tsrand((unsigned)time(NULL));\n\tstring key;\n\tunsigned char* c=new unsigned char[SHA_DIGEST_LENGTH];\n\n\tcin >> key;\n\n\tc=SHA1((unsigned char*)key.c_str(), key.size(), NULL);\n\n\tfor(int i=0;i<20;++i) {\n\t\tprintf(\"%02x\", c[i]);\n\t}\n\tprintf(\"\\n\");\n\tcout << generate_random_num() << endl;\n\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* compression.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"compression.h\"\n\n#include \"core\/io\/zip_io.h\"\n#include \"core\/project_settings.h\"\n\n#include \"thirdparty\/misc\/fastlz.h\"\n\n#include <zlib.h>\n#include <zstd.h>\n\nint Compression::compress(uint8_t *p_dst, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tif (p_src_size < 16) {\n\t\t\t\tuint8_t src[16];\n\t\t\t\tmemset(&src[p_src_size], 0, 16 - p_src_size);\n\t\t\t\tmemcpy(src, p_src, p_src_size);\n\t\t\t\treturn fastlz_compress(src, 16, p_dst);\n\t\t\t} else {\n\t\t\t\treturn fastlz_compress(p_src, p_src_size, p_dst);\n\t\t\t}\n\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tint level = p_mode == MODE_DEFLATE ? zlib_level : gzip_level;\n\t\t\tint err = deflateInit2(&strm, level, Z_DEFLATED, window_bits, 8, Z_DEFAULT_STRATEGY);\n\t\t\tif (err != Z_OK) {\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tstrm.avail_in = p_src_size;\n\t\t\tint aout = deflateBound(&strm, p_src_size);\n\t\t\tstrm.avail_out = aout;\n\t\t\tstrm.next_in = (Bytef *)p_src;\n\t\t\tstrm.next_out = p_dst;\n\t\t\tdeflate(&strm, Z_FINISH);\n\t\t\taout = aout - strm.avail_out;\n\t\t\tdeflateEnd(&strm);\n\t\t\treturn aout;\n\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\tZSTD_CCtx *cctx = ZSTD_createCCtx();\n\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_compressionLevel, zstd_level);\n\t\t\tif (zstd_long_distance_matching) {\n\t\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_enableLongDistanceMatching, 1);\n\t\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_windowLog, zstd_window_log_size);\n\t\t\t}\n\t\t\tint max_dst_size = get_max_compressed_buffer_size(p_src_size, MODE_ZSTD);\n\t\t\tint ret = ZSTD_compressCCtx(cctx, p_dst, max_dst_size, p_src, p_src_size, zstd_level);\n\t\t\tZSTD_freeCCtx(cctx);\n\t\t\treturn ret;\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\nint Compression::get_max_compressed_buffer_size(int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tint ss = p_src_size + p_src_size * 6 \/ 100;\n\t\t\tif (ss < 66) {\n\t\t\t\tss = 66;\n\t\t\t}\n\t\t\treturn ss;\n\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tint err = deflateInit2(&strm, Z_DEFAULT_COMPRESSION, Z_DEFLATED, window_bits, 8, Z_DEFAULT_STRATEGY);\n\t\t\tif (err != Z_OK) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tint aout = deflateBound(&strm, p_src_size);\n\t\t\tdeflateEnd(&strm);\n\t\t\treturn aout;\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\treturn ZSTD_compressBound(p_src_size);\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\nint Compression::decompress(uint8_t *p_dst, int p_dst_max_size, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tint ret_size = 0;\n\n\t\t\tif (p_dst_max_size < 16) {\n\t\t\t\tuint8_t dst[16];\n\t\t\t\tret_size = fastlz_decompress(p_src, p_src_size, dst, 16);\n\t\t\t\tmemcpy(p_dst, dst, p_dst_max_size);\n\t\t\t} else {\n\t\t\t\tret_size = fastlz_decompress(p_src, p_src_size, p_dst, p_dst_max_size);\n\t\t\t}\n\t\t\treturn ret_size;\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tstrm.avail_in = 0;\n\t\t\tstrm.next_in = Z_NULL;\n\t\t\tint err = inflateInit2(&strm, window_bits);\n\t\t\tERR_FAIL_COND_V(err != Z_OK, -1);\n\n\t\t\tstrm.avail_in = p_src_size;\n\t\t\tstrm.avail_out = p_dst_max_size;\n\t\t\tstrm.next_in = (Bytef *)p_src;\n\t\t\tstrm.next_out = p_dst;\n\n\t\t\terr = inflate(&strm, Z_FINISH);\n\t\t\tint total = strm.total_out;\n\t\t\tinflateEnd(&strm);\n\t\t\tERR_FAIL_COND_V(err != Z_STREAM_END, -1);\n\t\t\treturn total;\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\tZSTD_DCtx *dctx = ZSTD_createDCtx();\n\t\t\tif (zstd_long_distance_matching) {\n\t\t\t\tZSTD_DCtx_setParameter(dctx, ZSTD_d_windowLogMax, zstd_window_log_size);\n\t\t\t}\n\t\t\tint ret = ZSTD_decompressDCtx(dctx, p_dst, p_dst_max_size, p_src, p_src_size);\n\t\t\tZSTD_freeDCtx(dctx);\n\t\t\treturn ret;\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\n\/**\n\tThis will handle both Gzip and Deflat streams. It will automatically allocate the output buffer into the provided p_dst_vect Vector.\n\tThis is required for compressed data who's final uncompressed size is unknown, as is the case for HTTP response bodies.\n\tThis is much slower however than using Compression::decompress because it may result in multiple full copies of the output buffer.\n*\/\nint Compression::decompress_dynamic(PoolVector<uint8_t> *p_dst, int p_max_dst_size, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tint ret;\n\tuint8_t *dst = nullptr;\n\tint out_mark = 0;\n\tz_stream strm;\n\n\tERR_FAIL_COND_V(p_src_size <= 0, Z_DATA_ERROR);\n\n\t\/\/ This function only supports GZip and Deflate\n\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\tERR_FAIL_COND_V(p_mode != MODE_DEFLATE && p_mode != MODE_GZIP, Z_ERRNO);\n\n\t\/\/ Initialize the stream\n\tstrm.zalloc = Z_NULL;\n\tstrm.zfree = Z_NULL;\n\tstrm.opaque = Z_NULL;\n\tstrm.avail_in = 0;\n\tstrm.next_in = Z_NULL;\n\n\tint err = inflateInit2(&strm, window_bits);\n\tERR_FAIL_COND_V(err != Z_OK, -1);\n\n\t\/\/ Setup the stream inputs\n\tstrm.next_in = (Bytef *)p_src;\n\tstrm.avail_in = p_src_size;\n\n\t\/\/ Ensure the destination buffer is empty\n\tp_dst->resize(0);\n\n\t\/\/ decompress until deflate stream ends or end of file\n\tdo {\n\t\t\/\/ Add another chunk size to the output buffer\n\t\t\/\/ This forces a copy of the whole buffer\n\t\tp_dst->resize(p_dst->size() + gzip_chunk);\n\t\t\/\/ Get pointer to the actual output buffer\n\t\tdst = p_dst->write().ptr();\n\n\t\t\/\/ Set the stream to the new output stream\n\t\t\/\/ Since it was copied, we need to reset the stream to the new buffer\n\t\tstrm.next_out = &(dst[out_mark]);\n\t\tstrm.avail_out = gzip_chunk;\n\n\t\t\/\/ run inflate() on input until output buffer is full and needs to be resized\n\t\t\/\/ or input runs out\n\t\tdo {\n\t\t\tret = inflate(&strm, Z_SYNC_FLUSH);\n\n\t\t\tswitch (ret) {\n\t\t\t\tcase Z_NEED_DICT:\n\t\t\t\t\tret = Z_DATA_ERROR;\n\t\t\t\tcase Z_DATA_ERROR:\n\t\t\t\tcase Z_MEM_ERROR:\n\t\t\t\tcase Z_STREAM_ERROR:\n\t\t\t\tcase Z_BUF_ERROR:\n\t\t\t\t\tif (strm.msg) {\n\t\t\t\t\t\tWARN_PRINT(strm.msg);\n\t\t\t\t\t}\n\t\t\t\t\t(void)inflateEnd(&strm);\n\t\t\t\t\tp_dst->resize(0);\n\t\t\t\t\treturn ret;\n\t\t\t}\n\t\t} while (strm.avail_out > 0 && strm.avail_in > 0);\n\n\t\tout_mark += gzip_chunk;\n\n\t\t\/\/ Encorce max output size\n\t\tif (p_max_dst_size > -1 && strm.total_out > (uint64_t)p_max_dst_size) {\n\t\t\t(void)inflateEnd(&strm);\n\t\t\tp_dst->resize(0);\n\t\t\treturn Z_BUF_ERROR;\n\t\t}\n\t} while (ret != Z_STREAM_END);\n\n\t\/\/ If all done successfully, resize the output if it's larger than the actual output\n\tif (ret == Z_STREAM_END && (unsigned long)p_dst->size() > strm.total_out) {\n\t\tp_dst->resize(strm.total_out);\n\t}\n\n\t\/\/ clean up and return\n\t(void)inflateEnd(&strm);\n\treturn ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;\n}\n\nint Compression::zlib_level = Z_DEFAULT_COMPRESSION;\nint Compression::gzip_level = Z_DEFAULT_COMPRESSION;\nint Compression::zstd_level = 3;\nbool Compression::zstd_long_distance_matching = false;\nint Compression::zstd_window_log_size = 27; \/\/ ZSTD_WINDOWLOG_LIMIT_DEFAULT\nint Compression::gzip_chunk = 16384;\n<commit_msg>Fix decompression with FastLZ when buffer size is less than 16 bytes<commit_after>\/*************************************************************************\/\n\/* compression.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* https:\/\/godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2021 Juan Linietsky, Ariel Manzur. *\/\n\/* Copyright (c) 2014-2021 Godot Engine contributors (cf. AUTHORS.md). *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n\n#include \"compression.h\"\n\n#include \"core\/io\/zip_io.h\"\n#include \"core\/project_settings.h\"\n\n#include \"thirdparty\/misc\/fastlz.h\"\n\n#include <zlib.h>\n#include <zstd.h>\n\nint Compression::compress(uint8_t *p_dst, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tif (p_src_size < 16) {\n\t\t\t\tuint8_t src[16];\n\t\t\t\tmemset(&src[p_src_size], 0, 16 - p_src_size);\n\t\t\t\tmemcpy(src, p_src, p_src_size);\n\t\t\t\treturn fastlz_compress(src, 16, p_dst);\n\t\t\t} else {\n\t\t\t\treturn fastlz_compress(p_src, p_src_size, p_dst);\n\t\t\t}\n\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tint level = p_mode == MODE_DEFLATE ? zlib_level : gzip_level;\n\t\t\tint err = deflateInit2(&strm, level, Z_DEFLATED, window_bits, 8, Z_DEFAULT_STRATEGY);\n\t\t\tif (err != Z_OK) {\n\t\t\t\treturn -1;\n\t\t\t}\n\n\t\t\tstrm.avail_in = p_src_size;\n\t\t\tint aout = deflateBound(&strm, p_src_size);\n\t\t\tstrm.avail_out = aout;\n\t\t\tstrm.next_in = (Bytef *)p_src;\n\t\t\tstrm.next_out = p_dst;\n\t\t\tdeflate(&strm, Z_FINISH);\n\t\t\taout = aout - strm.avail_out;\n\t\t\tdeflateEnd(&strm);\n\t\t\treturn aout;\n\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\tZSTD_CCtx *cctx = ZSTD_createCCtx();\n\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_compressionLevel, zstd_level);\n\t\t\tif (zstd_long_distance_matching) {\n\t\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_enableLongDistanceMatching, 1);\n\t\t\t\tZSTD_CCtx_setParameter(cctx, ZSTD_c_windowLog, zstd_window_log_size);\n\t\t\t}\n\t\t\tint max_dst_size = get_max_compressed_buffer_size(p_src_size, MODE_ZSTD);\n\t\t\tint ret = ZSTD_compressCCtx(cctx, p_dst, max_dst_size, p_src, p_src_size, zstd_level);\n\t\t\tZSTD_freeCCtx(cctx);\n\t\t\treturn ret;\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\nint Compression::get_max_compressed_buffer_size(int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tint ss = p_src_size + p_src_size * 6 \/ 100;\n\t\t\tif (ss < 66) {\n\t\t\t\tss = 66;\n\t\t\t}\n\t\t\treturn ss;\n\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tint err = deflateInit2(&strm, Z_DEFAULT_COMPRESSION, Z_DEFLATED, window_bits, 8, Z_DEFAULT_STRATEGY);\n\t\t\tif (err != Z_OK) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tint aout = deflateBound(&strm, p_src_size);\n\t\t\tdeflateEnd(&strm);\n\t\t\treturn aout;\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\treturn ZSTD_compressBound(p_src_size);\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\nint Compression::decompress(uint8_t *p_dst, int p_dst_max_size, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tswitch (p_mode) {\n\t\tcase MODE_FASTLZ: {\n\t\t\tint ret_size = 0;\n\n\t\t\tif (p_dst_max_size < 16) {\n\t\t\t\tuint8_t dst[16];\n\t\t\t\tfastlz_decompress(p_src, p_src_size, dst, 16);\n\t\t\t\tmemcpy(p_dst, dst, p_dst_max_size);\n\t\t\t\tret_size = p_dst_max_size;\n\t\t\t} else {\n\t\t\t\tret_size = fastlz_decompress(p_src, p_src_size, p_dst, p_dst_max_size);\n\t\t\t}\n\t\t\treturn ret_size;\n\t\t} break;\n\t\tcase MODE_DEFLATE:\n\t\tcase MODE_GZIP: {\n\t\t\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\n\t\t\tz_stream strm;\n\t\t\tstrm.zalloc = zipio_alloc;\n\t\t\tstrm.zfree = zipio_free;\n\t\t\tstrm.opaque = Z_NULL;\n\t\t\tstrm.avail_in = 0;\n\t\t\tstrm.next_in = Z_NULL;\n\t\t\tint err = inflateInit2(&strm, window_bits);\n\t\t\tERR_FAIL_COND_V(err != Z_OK, -1);\n\n\t\t\tstrm.avail_in = p_src_size;\n\t\t\tstrm.avail_out = p_dst_max_size;\n\t\t\tstrm.next_in = (Bytef *)p_src;\n\t\t\tstrm.next_out = p_dst;\n\n\t\t\terr = inflate(&strm, Z_FINISH);\n\t\t\tint total = strm.total_out;\n\t\t\tinflateEnd(&strm);\n\t\t\tERR_FAIL_COND_V(err != Z_STREAM_END, -1);\n\t\t\treturn total;\n\t\t} break;\n\t\tcase MODE_ZSTD: {\n\t\t\tZSTD_DCtx *dctx = ZSTD_createDCtx();\n\t\t\tif (zstd_long_distance_matching) {\n\t\t\t\tZSTD_DCtx_setParameter(dctx, ZSTD_d_windowLogMax, zstd_window_log_size);\n\t\t\t}\n\t\t\tint ret = ZSTD_decompressDCtx(dctx, p_dst, p_dst_max_size, p_src, p_src_size);\n\t\t\tZSTD_freeDCtx(dctx);\n\t\t\treturn ret;\n\t\t} break;\n\t}\n\n\tERR_FAIL_V(-1);\n}\n\n\/**\n\tThis will handle both Gzip and Deflat streams. It will automatically allocate the output buffer into the provided p_dst_vect Vector.\n\tThis is required for compressed data who's final uncompressed size is unknown, as is the case for HTTP response bodies.\n\tThis is much slower however than using Compression::decompress because it may result in multiple full copies of the output buffer.\n*\/\nint Compression::decompress_dynamic(PoolVector<uint8_t> *p_dst, int p_max_dst_size, const uint8_t *p_src, int p_src_size, Mode p_mode) {\n\tint ret;\n\tuint8_t *dst = nullptr;\n\tint out_mark = 0;\n\tz_stream strm;\n\n\tERR_FAIL_COND_V(p_src_size <= 0, Z_DATA_ERROR);\n\n\t\/\/ This function only supports GZip and Deflate\n\tint window_bits = p_mode == MODE_DEFLATE ? 15 : 15 + 16;\n\tERR_FAIL_COND_V(p_mode != MODE_DEFLATE && p_mode != MODE_GZIP, Z_ERRNO);\n\n\t\/\/ Initialize the stream\n\tstrm.zalloc = Z_NULL;\n\tstrm.zfree = Z_NULL;\n\tstrm.opaque = Z_NULL;\n\tstrm.avail_in = 0;\n\tstrm.next_in = Z_NULL;\n\n\tint err = inflateInit2(&strm, window_bits);\n\tERR_FAIL_COND_V(err != Z_OK, -1);\n\n\t\/\/ Setup the stream inputs\n\tstrm.next_in = (Bytef *)p_src;\n\tstrm.avail_in = p_src_size;\n\n\t\/\/ Ensure the destination buffer is empty\n\tp_dst->resize(0);\n\n\t\/\/ decompress until deflate stream ends or end of file\n\tdo {\n\t\t\/\/ Add another chunk size to the output buffer\n\t\t\/\/ This forces a copy of the whole buffer\n\t\tp_dst->resize(p_dst->size() + gzip_chunk);\n\t\t\/\/ Get pointer to the actual output buffer\n\t\tdst = p_dst->write().ptr();\n\n\t\t\/\/ Set the stream to the new output stream\n\t\t\/\/ Since it was copied, we need to reset the stream to the new buffer\n\t\tstrm.next_out = &(dst[out_mark]);\n\t\tstrm.avail_out = gzip_chunk;\n\n\t\t\/\/ run inflate() on input until output buffer is full and needs to be resized\n\t\t\/\/ or input runs out\n\t\tdo {\n\t\t\tret = inflate(&strm, Z_SYNC_FLUSH);\n\n\t\t\tswitch (ret) {\n\t\t\t\tcase Z_NEED_DICT:\n\t\t\t\t\tret = Z_DATA_ERROR;\n\t\t\t\tcase Z_DATA_ERROR:\n\t\t\t\tcase Z_MEM_ERROR:\n\t\t\t\tcase Z_STREAM_ERROR:\n\t\t\t\tcase Z_BUF_ERROR:\n\t\t\t\t\tif (strm.msg) {\n\t\t\t\t\t\tWARN_PRINT(strm.msg);\n\t\t\t\t\t}\n\t\t\t\t\t(void)inflateEnd(&strm);\n\t\t\t\t\tp_dst->resize(0);\n\t\t\t\t\treturn ret;\n\t\t\t}\n\t\t} while (strm.avail_out > 0 && strm.avail_in > 0);\n\n\t\tout_mark += gzip_chunk;\n\n\t\t\/\/ Encorce max output size\n\t\tif (p_max_dst_size > -1 && strm.total_out > (uint64_t)p_max_dst_size) {\n\t\t\t(void)inflateEnd(&strm);\n\t\t\tp_dst->resize(0);\n\t\t\treturn Z_BUF_ERROR;\n\t\t}\n\t} while (ret != Z_STREAM_END);\n\n\t\/\/ If all done successfully, resize the output if it's larger than the actual output\n\tif (ret == Z_STREAM_END && (unsigned long)p_dst->size() > strm.total_out) {\n\t\tp_dst->resize(strm.total_out);\n\t}\n\n\t\/\/ clean up and return\n\t(void)inflateEnd(&strm);\n\treturn ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;\n}\n\nint Compression::zlib_level = Z_DEFAULT_COMPRESSION;\nint Compression::gzip_level = Z_DEFAULT_COMPRESSION;\nint Compression::zstd_level = 3;\nbool Compression::zstd_long_distance_matching = false;\nint Compression::zstd_window_log_size = 27; \/\/ ZSTD_WINDOWLOG_LIMIT_DEFAULT\nint Compression::gzip_chunk = 16384;\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-2014, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\/*\n * Create default binning and initalise the binning component with this. In case\n * users already defined a binning, do not overwrite this.\n *\n * Author: Markus Fasel\n *\/\n#include \"AliEMCalTriggerBinningComponent.h\"\n#include \"AliEMCalTriggerBinningFactory.h\"\n#include <map>\n#include <vector>\n#include <TMath.h>\n#include <TArrayD.h>\n\nnamespace EMCalTriggerPtAnalysis {\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerBinningFactory::AliEMCalTriggerBinningFactory() {\n \/*\n * Default constructor, nothing to do\n *\/\n}\n\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::Create(AliEMCalTriggerBinningComponent* const data) {\n \/*\n * Initialise binning component with default binning\n *\n * @param data: the binning component to be initialised\n *\/\n TArrayD binLimits;\n if(!data->GetBinning(\"pt\")){\n CreateDefaultPtBinning(binLimits);\n data->SetBinning(\"pt\", binLimits);\n }\n if(!data->GetBinning(\"eta\")){\n CreateDefaultEtaBinning(binLimits);\n data->SetBinning(\"eta\", binLimits);\n }\n if(!data->GetBinning(\"phi\")){\n CreateLinearBinning(binLimits, 100, 0, 2*TMath::Pi());\n data->SetBinning(\"phi\", binLimits);\n }\n if(!data->GetBinning(\"zvertex\")){\n CreateDefaultZVertexBinning(binLimits);\n data->SetBinning(\"zvertex\", binLimits);\n }\n if(!data->GetBinning(\"centrality\")){\n\tCreateLinearBinning(binLimits, 5, 0., 100.);\n\tdata->SetBinning(\"centrality\", binLimits);\n }\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultPtBinning(TArrayD &binning) const{\n \/*\n * Creating the default pt binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n std::map<double,double> definitions;\n definitions.insert(std::pair<double,double>(2.5, 0.1));\n definitions.insert(std::pair<double,double>(7., 0.25));\n definitions.insert(std::pair<double,double>(15., 0.5));\n definitions.insert(std::pair<double,double>(25., 1.));\n definitions.insert(std::pair<double,double>(40., 2.5));\n definitions.insert(std::pair<double,double>(50., 5.));\n definitions.insert(std::pair<double,double>(100., 10.));\n \/\/definitions.insert(std::pair<double, double>(200., 20.));\n double currentval = 0;\n for(std::map<double,double>::iterator id = definitions.begin(); id != definitions.end(); ++id){\n double limit = id->first, binwidth = id->second;\n while(currentval < limit){\n currentval += binwidth;\n mybinning.push_back(currentval);\n }\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultZVertexBinning(TArrayD &binning) const {\n \/*\n * Creating default z-Vertex binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n double currentval = -10;\n mybinning.push_back(currentval);\n while(currentval < 10.){\n currentval += 5.;\n mybinning.push_back(currentval);\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultEtaBinning(TArrayD& binning) const {\n \/*\n * Creating default z-Vertex binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n double currentval = -0.8;\n mybinning.push_back(currentval);\n while(currentval < 0.8){\n currentval += 0.1;\n mybinning.push_back(currentval);\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateLinearBinning(TArrayD& binning, int nbins, double min, double max) const {\n \/*\n * Create any kind of linear binning from given ranges and stores it in the binning array.\n *\n * @param binning: output array\n * @param nbins: Number of bins\n * @param min: lower range\n * @param max: upper range\n *\/\n double binwidth = (max-min)\/static_cast<double>(nbins);\n binning.Set(nbins+1);\n binning[0] = min;\n double currentlimit = min + binwidth;\n for(int ibin = 0; ibin < nbins; ibin++){\n binning[ibin+1] = currentlimit;\n currentlimit += binwidth;\n }\n}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n<commit_msg>Make pt-binning broader, particularly at low pt<commit_after>\/**************************************************************************\n * Copyright(c) 1998-2014, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\/*\n * Create default binning and initalise the binning component with this. In case\n * users already defined a binning, do not overwrite this.\n *\n * Author: Markus Fasel\n *\/\n#include \"AliEMCalTriggerBinningComponent.h\"\n#include \"AliEMCalTriggerBinningFactory.h\"\n#include <map>\n#include <vector>\n#include <TMath.h>\n#include <TArrayD.h>\n\nnamespace EMCalTriggerPtAnalysis {\n\n\/\/______________________________________________________________________________\nAliEMCalTriggerBinningFactory::AliEMCalTriggerBinningFactory() {\n \/*\n * Default constructor, nothing to do\n *\/\n}\n\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::Create(AliEMCalTriggerBinningComponent* const data) {\n \/*\n * Initialise binning component with default binning\n *\n * @param data: the binning component to be initialised\n *\/\n TArrayD binLimits;\n if(!data->GetBinning(\"pt\")){\n CreateDefaultPtBinning(binLimits);\n data->SetBinning(\"pt\", binLimits);\n }\n if(!data->GetBinning(\"eta\")){\n CreateDefaultEtaBinning(binLimits);\n data->SetBinning(\"eta\", binLimits);\n }\n if(!data->GetBinning(\"phi\")){\n CreateLinearBinning(binLimits, 100, 0, 2*TMath::Pi());\n data->SetBinning(\"phi\", binLimits);\n }\n if(!data->GetBinning(\"zvertex\")){\n CreateDefaultZVertexBinning(binLimits);\n data->SetBinning(\"zvertex\", binLimits);\n }\n if(!data->GetBinning(\"centrality\")){\n\tCreateLinearBinning(binLimits, 5, 0., 100.);\n\tdata->SetBinning(\"centrality\", binLimits);\n }\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultPtBinning(TArrayD &binning) const{\n \/*\n * Creating the default pt binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n std::map<double,double> definitions;\n definitions.insert(std::pair<double,double>(2.5, 0.1));\n definitions.insert(std::pair<double,double>(7., 0.25));\n definitions.insert(std::pair<double,double>(10., 0.5));\n definitions.insert(std::pair<double,double>(15., 1.));\n definitions.insert(std::pair<double,double>(20., 2.5));\n definitions.insert(std::pair<double,double>(30., 5.));\n definitions.insert(std::pair<double,double>(100., 10.));\n definitions.insert(std::pair<double, double>(200., 20.));\n double currentval = 0;\n for(std::map<double,double>::iterator id = definitions.begin(); id != definitions.end(); ++id){\n double limit = id->first, binwidth = id->second;\n while(currentval < limit){\n currentval += binwidth;\n mybinning.push_back(currentval);\n }\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultZVertexBinning(TArrayD &binning) const {\n \/*\n * Creating default z-Vertex binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n double currentval = -10;\n mybinning.push_back(currentval);\n while(currentval < 10.){\n currentval += 5.;\n mybinning.push_back(currentval);\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateDefaultEtaBinning(TArrayD& binning) const {\n \/*\n * Creating default z-Vertex binning.\n *\n * @param binning: Array where to store the results.\n *\/\n std::vector<double> mybinning;\n double currentval = -0.8;\n mybinning.push_back(currentval);\n while(currentval < 0.8){\n currentval += 0.1;\n mybinning.push_back(currentval);\n }\n binning.Set(mybinning.size());\n int ib = 0;\n for(std::vector<double>::iterator it = mybinning.begin(); it != mybinning.end(); ++it)\n binning[ib++] = *it;\n}\n\n\/\/______________________________________________________________________________\nvoid AliEMCalTriggerBinningFactory::CreateLinearBinning(TArrayD& binning, int nbins, double min, double max) const {\n \/*\n * Create any kind of linear binning from given ranges and stores it in the binning array.\n *\n * @param binning: output array\n * @param nbins: Number of bins\n * @param min: lower range\n * @param max: upper range\n *\/\n double binwidth = (max-min)\/static_cast<double>(nbins);\n binning.Set(nbins+1);\n binning[0] = min;\n double currentlimit = min + binwidth;\n for(int ibin = 0; ibin < nbins; ibin++){\n binning[ibin+1] = currentlimit;\n currentlimit += binwidth;\n }\n}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitCore *\n * File: $Id: RooTrace.cc,v 1.21 2005\/06\/20 15:45:14 wverkerke Exp $\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\n#include \"RooFitCore\/RooFit.hh\"\n\n#include \"RooFitCore\/RooTrace.hh\"\n#include \"RooFitCore\/RooTrace.hh\"\n#include \"RooFitCore\/RooAbsArg.hh\"\n\n#include <iomanip>\n\nClassImp(RooTrace)\n;\n\n\nBool_t RooTrace::_active(kFALSE) ;\nBool_t RooTrace::_verbose(kFALSE) ;\nRooLinkedList RooTrace::_list ;\nRooLinkedList RooTrace::_markList ;\n\nvoid RooTrace::create2(const TObject* obj) {\n \n _list.Add((RooAbsArg*)obj) ;\n if (_verbose) {\n cout << \"RooTrace::create: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" created \" << endl ;\n }\n}\n\n\n \nvoid RooTrace::destroy2(const TObject* obj) {\n\n if (!_list.Remove((RooAbsArg*)obj)) {\n cout << \"RooTrace::destroy: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" already deleted, or created before trace activation[\" << obj->GetTitle() << \"]\" << endl ;\n } else if (_verbose) {\n cout << \"RooTrace::destroy: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" destroyed [\" << obj->GetTitle() << \"]\" << endl ;\n }\n}\n\n\nvoid RooTrace::mark()\n{\n _markList = _list ;\n}\n\n\nvoid RooTrace::dump(ostream& os, Bool_t sinceMarked) {\n os << \"List of RooFit objects allocated while trace active:\" << endl ;\n\n\n char buf[100] ;\n Int_t i, nMarked(0) ;\n for(i=0 ; i<_list.GetSize() ; i++) {\n if (!sinceMarked || _markList.IndexOf(_list.At(i)) == -1) {\n#ifdef R__B64\n sprintf(buf,\"%010x : \",(ULong64_t)(void*)_list.At(i)) ;\n#else\n sprintf(buf,\"%010x : \",(UInt_t)(void*)_list.At(i)) ;\n#endif\n os << buf << setw(20) << _list.At(i)->ClassName() << setw(0) << \" - \" << _list.At(i)->GetName() << endl ;\n } else {\n nMarked++ ;\n }\n }\n if (sinceMarked) os << nMarked << \" marked objects suppressed\" << endl ;\n}\n<commit_msg><commit_after>\/*****************************************************************************\n * Project: RooFit *\n * Package: RooFitCore *\n * File: $Id: RooTrace.cc,v 1.22 2005\/06\/20 18:15:16 wverkerke Exp $\n * Authors: *\n * WV, Wouter Verkerke, UC Santa Barbara, verkerke@slac.stanford.edu *\n * DK, David Kirkby, UC Irvine, dkirkby@uci.edu *\n * *\n * Copyright (c) 2000-2005, Regents of the University of California *\n * and Stanford University. All rights reserved. *\n * *\n * Redistribution and use in source and binary forms, *\n * with or without modification, are permitted according to the terms *\n * listed in LICENSE (http:\/\/roofit.sourceforge.net\/license.txt) *\n *****************************************************************************\/\n\n\/\/ -- CLASS DESCRIPTION [AUX] --\n\n#include \"RooFitCore\/RooFit.hh\"\n\n#include \"RooFitCore\/RooTrace.hh\"\n#include \"RooFitCore\/RooTrace.hh\"\n#include \"RooFitCore\/RooAbsArg.hh\"\n\n#include <iomanip>\n\nClassImp(RooTrace)\n;\n\n\nBool_t RooTrace::_active(kFALSE) ;\nBool_t RooTrace::_verbose(kFALSE) ;\nRooLinkedList RooTrace::_list ;\nRooLinkedList RooTrace::_markList ;\n\nvoid RooTrace::create2(const TObject* obj) {\n \n _list.Add((RooAbsArg*)obj) ;\n if (_verbose) {\n cout << \"RooTrace::create: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" created \" << endl ;\n }\n}\n\n\n \nvoid RooTrace::destroy2(const TObject* obj) {\n\n if (!_list.Remove((RooAbsArg*)obj)) {\n cout << \"RooTrace::destroy: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" already deleted, or created before trace activation[\" << obj->GetTitle() << \"]\" << endl ;\n } else if (_verbose) {\n cout << \"RooTrace::destroy: object \" << obj << \" of type \" << obj->ClassName() \n\t << \" destroyed [\" << obj->GetTitle() << \"]\" << endl ;\n }\n}\n\n\nvoid RooTrace::mark()\n{\n _markList = _list ;\n}\n\n\nvoid RooTrace::dump(ostream& os, Bool_t sinceMarked) {\n os << \"List of RooFit objects allocated while trace active:\" << endl ;\n\n\n char buf[100] ;\n Int_t i, nMarked(0) ;\n for(i=0 ; i<_list.GetSize() ; i++) {\n if (!sinceMarked || _markList.IndexOf(_list.At(i)) == -1) {\n#ifdef R__B64\n sprintf(buf,\"%010x : \",(ULong64_t)(void*)_list.At(i)) ;\n#else\n sprintf(buf,\"%010x : \",(ULong_t)(void*)_list.At(i)) ;\n#endif\n os << buf << setw(20) << _list.At(i)->ClassName() << setw(0) << \" - \" << _list.At(i)->GetName() << endl ;\n } else {\n nMarked++ ;\n }\n }\n if (sinceMarked) os << nMarked << \" marked objects suppressed\" << endl ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Manager.cpp\n *\n * Created on: 23 Oct 2015\n * Author: hieu\n *\/\n#include <boost\/foreach.hpp>\n#include <cstdlib>\n#include <vector>\n#include <sstream>\n#include \"..\/System.h\"\n#include \"..\/TranslationModel\/PhraseTable.h\"\n#include \"Manager.h\"\n#include \"InputPath.h\"\n#include \"Hypothesis.h\"\n#include \"TargetPhraseImpl.h\"\n#include \"ActiveChart.h\"\n#include \"Sentence.h\"\n\nusing namespace std;\n\nnamespace Moses2\n{\nnamespace SCFG\n{\n\nManager::Manager(System &sys, const TranslationTask &task,\n const std::string &inputStr, long translationId)\n:ManagerBase(sys, task, inputStr, translationId)\n{\n\n}\n\nManager::~Manager()\n{\n\n}\n\nvoid Manager::Decode()\n{\n \/\/ init pools etc\n \/\/cerr << \"START InitPools()\" << endl;\n InitPools();\n \/\/cerr << \"START ParseInput()\" << endl;\n\n FactorCollection &vocab = system.GetVocab();\n m_input = Sentence::CreateFromString(GetPool(), vocab, system, m_inputStr,\n m_translationId);\n\n const SCFG::Sentence &sentence = static_cast<const SCFG::Sentence&>(GetInput());\n\n size_t inputSize = sentence.GetSize();\n \/\/cerr << \"inputSize=\" << inputSize << endl;\n\n m_inputPaths.Init(sentence, *this);\n \/\/cerr << \"CREATED m_inputPaths\" << endl;\n\n m_stacks.Init(*this, inputSize);\n \/\/cerr << \"CREATED m_stacks\" << endl;\n\n for (int startPos = inputSize - 1; startPos >= 0; --startPos) {\n \/\/cerr << endl << \"startPos=\" << startPos << endl;\n SCFG::InputPath &initPath = *m_inputPaths.GetMatrix().GetValue(startPos, 0);\n\n \/\/cerr << \"BEFORE InitActiveChart=\" << initPath.Debug(system) << endl;\n InitActiveChart(initPath);\n \/\/cerr << \"AFTER InitActiveChart=\" << initPath.Debug(system) << endl;\n\n int maxPhraseSize = inputSize - startPos + 1;\n for (int phraseSize = 1; phraseSize < maxPhraseSize; ++phraseSize) {\n \/\/cerr << endl << \"phraseSize=\" << phraseSize << endl;\n SCFG::InputPath &path = *m_inputPaths.GetMatrix().GetValue(startPos, phraseSize);\n\n Stack &stack = m_stacks.GetStack(startPos, phraseSize);\n\n \/\/cerr << \"BEFORE LOOKUP path=\" << path.Debug(system) << endl;\n Lookup(path);\n \/\/cerr << \"AFTER LOOKUP path=\" << path.Debug(system) << endl;\n Decode(path, stack);\n \/\/cerr << \"AFTER DECODE path=\" << path.Debug(system) << endl;\n\n LookupUnary(path);\n \/\/cerr << \"AFTER LookupUnary path=\" << path.Debug(system) << endl;\n\n \/\/cerr << \"#rules=\" << path.GetNumRules() << endl;\n }\n }\n\n \/\/m_stacks.OutputStacks();\n}\n\nvoid Manager::InitActiveChart(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n \/\/cerr << \"START InitActiveChart\" << endl;\n pt.InitActiveChart(GetPool(), *this, path);\n \/\/cerr << \"FINISHED InitActiveChart\" << endl;\n }\n}\n\nvoid Manager::Lookup(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n size_t maxChartSpan = system.maxChartSpans[i];\n pt.Lookup(GetPool(), *this, maxChartSpan, m_stacks, path);\n }\n\n \/*\n size_t tpsNum = path.targetPhrases.GetSize();\n if (tpsNum) {\n cerr << tpsNum << \" \" << path << endl;\n }\n *\/\n}\n\nvoid Manager::LookupUnary(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n pt.LookupUnary(GetPool(), *this, m_stacks, path);\n }\n\n \/*\n size_t tpsNum = path.targetPhrases.GetSize();\n if (tpsNum) {\n cerr << tpsNum << \" \" << path << endl;\n }\n *\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CUBE-PRUNING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Manager::Decode(SCFG::InputPath &path, Stack &stack)\n{\n \/\/ clear cube pruning data\n \/\/std::vector<QueueItem*> &container = Container(m_queue);\n \/\/container.clear();\n Recycler<HypothesisBase*> &hypoRecycler = GetHypoRecycle();\n while (!m_queue.empty()) {\n QueueItem *item = m_queue.top();\n m_queue.pop();\n \/\/ recycle unused hypos from queue\n Hypothesis *hypo = item->hypo;\n hypoRecycler.Recycle(hypo);\n\n \/\/ recycle queue item\n m_queueItemRecycler.push_back(item);\n }\n\n m_seenPositions.clear();\n\n \/\/ init queue\n BOOST_FOREACH(const InputPath::Coll::value_type &valPair, *path.targetPhrases) {\n const SymbolBind &symbolBind = valPair.first;\n const SCFG::TargetPhrases &tps = *valPair.second;\n CreateQueue(path, symbolBind, tps);\n }\n\n \/\/ MAIN LOOP\n size_t pops = 0;\n while (!m_queue.empty() && pops < system.options.cube.pop_limit) {\n \/\/cerr << \"pops=\" << pops << endl;\n QueueItem *item = m_queue.top();\n m_queue.pop();\n\n \/\/ add hypo to stack\n Hypothesis *hypo = item->hypo;\n\n \/\/cerr << \"hypo=\" << *hypo << \" \" << endl;\n stack.Add(hypo, GetHypoRecycle(), arcLists);\n \/\/cerr << \"Added \" << *hypo << \" \" << endl;\n\n item->CreateNext(GetSystemPool(), GetPool(), *this, m_queue, m_seenPositions, path);\n \/\/cerr << \"Created next \" << endl;\n m_queueItemRecycler.push_back(item);\n\n ++pops;\n }\n\n}\n\nvoid Manager::CreateQueue(\n const SCFG::InputPath &path,\n const SymbolBind &symbolBind,\n const SCFG::TargetPhrases &tps)\n{\n QueueItem *item = QueueItem::Create(GetPool(), *this);\n item->Init(GetPool(), symbolBind, tps);\n for (size_t i = 0; i < symbolBind.coll.size(); ++i) {\n const SymbolBindElement &ele = symbolBind.coll[i];\n if (ele.hypos) {\n item->AddHypos(*ele.hypos);\n }\n }\n item->CreateHypo(GetSystemPool(), *this, path, symbolBind);\n\n \/\/cerr << \"hypo=\" << item->hypo->Debug(system) << endl;\n\n m_queue.push(item);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NON CUBE-PRUNING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*\nvoid Manager::Decode(SCFG::InputPath &path, Stack &stack)\n{\n \/\/cerr << \"path=\" << path << endl;\n\n boost::unordered_map<SCFG::SymbolBind, SCFG::TargetPhrases*>::const_iterator iterOuter;\n for (iterOuter = path.targetPhrases->begin(); iterOuter != path.targetPhrases->end(); ++iterOuter) {\n const SCFG::SymbolBind &symbolBind = iterOuter->first;\n\n const SCFG::TargetPhrases &tps = *iterOuter->second;\n \/\/cerr << \"symbolBind=\" << symbolBind << \" tps=\" << tps.GetSize() << endl;\n\n SCFG::TargetPhrases::const_iterator iter;\n for (iter = tps.begin(); iter != tps.end(); ++iter) {\n const SCFG::TargetPhraseImpl &tp = **iter;\n \/\/cerr << \"tp=\" << tp << endl;\n ExpandHypo(path, symbolBind, tp, stack);\n }\n }\n}\n*\/\n\nvoid Manager::ExpandHypo(\n const SCFG::InputPath &path,\n const SCFG::SymbolBind &symbolBind,\n const SCFG::TargetPhraseImpl &tp,\n Stack &stack)\n{\n Recycler<HypothesisBase*> &hypoRecycler = GetHypoRecycle();\n\n std::vector<const SymbolBindElement*> ntEles = symbolBind.GetNTElements();\n Vector<size_t> prevHyposIndices(GetPool(), symbolBind.numNT);\n assert(ntEles.size() == symbolBind.numNT);\n \/\/cerr << \"ntEles:\" << ntEles.size() << endl;\n\n size_t ind = 0;\n while (IncrPrevHypoIndices(prevHyposIndices, ind, ntEles)) {\n SCFG::Hypothesis *hypo = SCFG::Hypothesis::Create(GetSystemPool(), *this);\n hypo->Init(*this, path, symbolBind, tp, prevHyposIndices);\n hypo->EvaluateWhenApplied();\n\n stack.Add(hypo, hypoRecycler, arcLists);\n\n ++ind;\n }\n}\n\nbool Manager::IncrPrevHypoIndices(\n Vector<size_t> &prevHyposIndices,\n size_t ind,\n const std::vector<const SymbolBindElement*> ntEles)\n{\n if (ntEles.size() == 0) {\n \/\/ no nt. Do the 1st\n return ind ? false : true;\n }\n\n size_t numHypos = 0;\n\n \/\/cerr << \"IncrPrevHypoIndices:\" << ind << \" \" << ntEles.size() << \" \";\n for (size_t i = 0; i < ntEles.size() - 1; ++i) {\n const SymbolBindElement &ele = *ntEles[i];\n const Hypotheses &hypos = *ele.hypos;\n numHypos = hypos.size();\n\n std::div_t divRet = std::div((int)ind, (int)numHypos);\n ind = divRet.quot;\n\n size_t hypoInd = divRet.rem;\n prevHyposIndices[i] = hypoInd;\n \/\/cerr << \"(\" << i << \",\" << ind << \",\" << numHypos << \",\" << hypoInd << \")\";\n }\n\n \/\/ last\n prevHyposIndices.back() = ind;\n\n\n \/\/ check if last is over limit\n const SymbolBindElement &ele = *ntEles.back();\n const Hypotheses &hypos = *ele.hypos;\n numHypos = hypos.size();\n\n \/\/cerr << \"(\" << (ntEles.size() - 1) << \",\" << ind << \",\" << numHypos << \",\" << ind << \")\";\n \/\/cerr << endl;\n\n if (ind >= numHypos) {\n return false;\n }\n else {\n return true;\n }\n}\n\nstd::string Manager::OutputBest() const\n{\n stringstream out;\n const Stack &lastStack = m_stacks.GetLastStack();\n const Hypothesis *bestHypo = lastStack.GetBestHypo(*this, const_cast<ArcLists&>(arcLists));\n\n if (bestHypo) {\n if (system.options.output.ReportHypoScore) {\n out << bestHypo->GetScores().GetTotalScore() << \" \";\n }\n\n \/\/cerr << \"BEST TRANSLATION: \" << bestHypo << bestHypo->Debug(system) << endl;\n \/\/cerr << \" \" << out.str() << endl;\n bestHypo->OutputToStream(out);\n }\n else {\n if (system.options.output.ReportHypoScore) {\n out << \"0 \";\n }\n\n \/\/cerr << \"NO TRANSLATION \" << m_input->GetTranslationId() << endl;\n }\n\n out << endl;\n return out.str();\n}\n\n} \/\/ namespace\n}\n\n<commit_msg>don't output <s> <\/s><commit_after>\/*\n * Manager.cpp\n *\n * Created on: 23 Oct 2015\n * Author: hieu\n *\/\n#include <boost\/foreach.hpp>\n#include <cstdlib>\n#include <vector>\n#include <sstream>\n#include \"..\/System.h\"\n#include \"..\/TranslationModel\/PhraseTable.h\"\n#include \"Manager.h\"\n#include \"InputPath.h\"\n#include \"Hypothesis.h\"\n#include \"TargetPhraseImpl.h\"\n#include \"ActiveChart.h\"\n#include \"Sentence.h\"\n\nusing namespace std;\n\nnamespace Moses2\n{\nnamespace SCFG\n{\n\nManager::Manager(System &sys, const TranslationTask &task,\n const std::string &inputStr, long translationId)\n:ManagerBase(sys, task, inputStr, translationId)\n{\n\n}\n\nManager::~Manager()\n{\n\n}\n\nvoid Manager::Decode()\n{\n \/\/ init pools etc\n \/\/cerr << \"START InitPools()\" << endl;\n InitPools();\n \/\/cerr << \"START ParseInput()\" << endl;\n\n FactorCollection &vocab = system.GetVocab();\n m_input = Sentence::CreateFromString(GetPool(), vocab, system, m_inputStr,\n m_translationId);\n\n const SCFG::Sentence &sentence = static_cast<const SCFG::Sentence&>(GetInput());\n\n size_t inputSize = sentence.GetSize();\n \/\/cerr << \"inputSize=\" << inputSize << endl;\n\n m_inputPaths.Init(sentence, *this);\n \/\/cerr << \"CREATED m_inputPaths\" << endl;\n\n m_stacks.Init(*this, inputSize);\n \/\/cerr << \"CREATED m_stacks\" << endl;\n\n for (int startPos = inputSize - 1; startPos >= 0; --startPos) {\n \/\/cerr << endl << \"startPos=\" << startPos << endl;\n SCFG::InputPath &initPath = *m_inputPaths.GetMatrix().GetValue(startPos, 0);\n\n \/\/cerr << \"BEFORE InitActiveChart=\" << initPath.Debug(system) << endl;\n InitActiveChart(initPath);\n \/\/cerr << \"AFTER InitActiveChart=\" << initPath.Debug(system) << endl;\n\n int maxPhraseSize = inputSize - startPos + 1;\n for (int phraseSize = 1; phraseSize < maxPhraseSize; ++phraseSize) {\n \/\/cerr << endl << \"phraseSize=\" << phraseSize << endl;\n SCFG::InputPath &path = *m_inputPaths.GetMatrix().GetValue(startPos, phraseSize);\n\n Stack &stack = m_stacks.GetStack(startPos, phraseSize);\n\n \/\/cerr << \"BEFORE LOOKUP path=\" << path.Debug(system) << endl;\n Lookup(path);\n \/\/cerr << \"AFTER LOOKUP path=\" << path.Debug(system) << endl;\n Decode(path, stack);\n \/\/cerr << \"AFTER DECODE path=\" << path.Debug(system) << endl;\n\n LookupUnary(path);\n \/\/cerr << \"AFTER LookupUnary path=\" << path.Debug(system) << endl;\n\n \/\/cerr << \"#rules=\" << path.GetNumRules() << endl;\n }\n }\n\n \/\/m_stacks.OutputStacks();\n}\n\nvoid Manager::InitActiveChart(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n \/\/cerr << \"START InitActiveChart\" << endl;\n pt.InitActiveChart(GetPool(), *this, path);\n \/\/cerr << \"FINISHED InitActiveChart\" << endl;\n }\n}\n\nvoid Manager::Lookup(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n size_t maxChartSpan = system.maxChartSpans[i];\n pt.Lookup(GetPool(), *this, maxChartSpan, m_stacks, path);\n }\n\n \/*\n size_t tpsNum = path.targetPhrases.GetSize();\n if (tpsNum) {\n cerr << tpsNum << \" \" << path << endl;\n }\n *\/\n}\n\nvoid Manager::LookupUnary(SCFG::InputPath &path)\n{\n size_t numPt = system.mappings.size();\n \/\/cerr << \"numPt=\" << numPt << endl;\n\n for (size_t i = 0; i < numPt; ++i) {\n const PhraseTable &pt = *system.mappings[i];\n pt.LookupUnary(GetPool(), *this, m_stacks, path);\n }\n\n \/*\n size_t tpsNum = path.targetPhrases.GetSize();\n if (tpsNum) {\n cerr << tpsNum << \" \" << path << endl;\n }\n *\/\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ CUBE-PRUNING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid Manager::Decode(SCFG::InputPath &path, Stack &stack)\n{\n \/\/ clear cube pruning data\n \/\/std::vector<QueueItem*> &container = Container(m_queue);\n \/\/container.clear();\n Recycler<HypothesisBase*> &hypoRecycler = GetHypoRecycle();\n while (!m_queue.empty()) {\n QueueItem *item = m_queue.top();\n m_queue.pop();\n \/\/ recycle unused hypos from queue\n Hypothesis *hypo = item->hypo;\n hypoRecycler.Recycle(hypo);\n\n \/\/ recycle queue item\n m_queueItemRecycler.push_back(item);\n }\n\n m_seenPositions.clear();\n\n \/\/ init queue\n BOOST_FOREACH(const InputPath::Coll::value_type &valPair, *path.targetPhrases) {\n const SymbolBind &symbolBind = valPair.first;\n const SCFG::TargetPhrases &tps = *valPair.second;\n CreateQueue(path, symbolBind, tps);\n }\n\n \/\/ MAIN LOOP\n size_t pops = 0;\n while (!m_queue.empty() && pops < system.options.cube.pop_limit) {\n \/\/cerr << \"pops=\" << pops << endl;\n QueueItem *item = m_queue.top();\n m_queue.pop();\n\n \/\/ add hypo to stack\n Hypothesis *hypo = item->hypo;\n\n \/\/cerr << \"hypo=\" << *hypo << \" \" << endl;\n stack.Add(hypo, GetHypoRecycle(), arcLists);\n \/\/cerr << \"Added \" << *hypo << \" \" << endl;\n\n item->CreateNext(GetSystemPool(), GetPool(), *this, m_queue, m_seenPositions, path);\n \/\/cerr << \"Created next \" << endl;\n m_queueItemRecycler.push_back(item);\n\n ++pops;\n }\n\n}\n\nvoid Manager::CreateQueue(\n const SCFG::InputPath &path,\n const SymbolBind &symbolBind,\n const SCFG::TargetPhrases &tps)\n{\n QueueItem *item = QueueItem::Create(GetPool(), *this);\n item->Init(GetPool(), symbolBind, tps);\n for (size_t i = 0; i < symbolBind.coll.size(); ++i) {\n const SymbolBindElement &ele = symbolBind.coll[i];\n if (ele.hypos) {\n item->AddHypos(*ele.hypos);\n }\n }\n item->CreateHypo(GetSystemPool(), *this, path, symbolBind);\n\n \/\/cerr << \"hypo=\" << item->hypo->Debug(system) << endl;\n\n m_queue.push(item);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ NON CUBE-PRUNING\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/*\nvoid Manager::Decode(SCFG::InputPath &path, Stack &stack)\n{\n \/\/cerr << \"path=\" << path << endl;\n\n boost::unordered_map<SCFG::SymbolBind, SCFG::TargetPhrases*>::const_iterator iterOuter;\n for (iterOuter = path.targetPhrases->begin(); iterOuter != path.targetPhrases->end(); ++iterOuter) {\n const SCFG::SymbolBind &symbolBind = iterOuter->first;\n\n const SCFG::TargetPhrases &tps = *iterOuter->second;\n \/\/cerr << \"symbolBind=\" << symbolBind << \" tps=\" << tps.GetSize() << endl;\n\n SCFG::TargetPhrases::const_iterator iter;\n for (iter = tps.begin(); iter != tps.end(); ++iter) {\n const SCFG::TargetPhraseImpl &tp = **iter;\n \/\/cerr << \"tp=\" << tp << endl;\n ExpandHypo(path, symbolBind, tp, stack);\n }\n }\n}\n*\/\n\nvoid Manager::ExpandHypo(\n const SCFG::InputPath &path,\n const SCFG::SymbolBind &symbolBind,\n const SCFG::TargetPhraseImpl &tp,\n Stack &stack)\n{\n Recycler<HypothesisBase*> &hypoRecycler = GetHypoRecycle();\n\n std::vector<const SymbolBindElement*> ntEles = symbolBind.GetNTElements();\n Vector<size_t> prevHyposIndices(GetPool(), symbolBind.numNT);\n assert(ntEles.size() == symbolBind.numNT);\n \/\/cerr << \"ntEles:\" << ntEles.size() << endl;\n\n size_t ind = 0;\n while (IncrPrevHypoIndices(prevHyposIndices, ind, ntEles)) {\n SCFG::Hypothesis *hypo = SCFG::Hypothesis::Create(GetSystemPool(), *this);\n hypo->Init(*this, path, symbolBind, tp, prevHyposIndices);\n hypo->EvaluateWhenApplied();\n\n stack.Add(hypo, hypoRecycler, arcLists);\n\n ++ind;\n }\n}\n\nbool Manager::IncrPrevHypoIndices(\n Vector<size_t> &prevHyposIndices,\n size_t ind,\n const std::vector<const SymbolBindElement*> ntEles)\n{\n if (ntEles.size() == 0) {\n \/\/ no nt. Do the 1st\n return ind ? false : true;\n }\n\n size_t numHypos = 0;\n\n \/\/cerr << \"IncrPrevHypoIndices:\" << ind << \" \" << ntEles.size() << \" \";\n for (size_t i = 0; i < ntEles.size() - 1; ++i) {\n const SymbolBindElement &ele = *ntEles[i];\n const Hypotheses &hypos = *ele.hypos;\n numHypos = hypos.size();\n\n std::div_t divRet = std::div((int)ind, (int)numHypos);\n ind = divRet.quot;\n\n size_t hypoInd = divRet.rem;\n prevHyposIndices[i] = hypoInd;\n \/\/cerr << \"(\" << i << \",\" << ind << \",\" << numHypos << \",\" << hypoInd << \")\";\n }\n\n \/\/ last\n prevHyposIndices.back() = ind;\n\n\n \/\/ check if last is over limit\n const SymbolBindElement &ele = *ntEles.back();\n const Hypotheses &hypos = *ele.hypos;\n numHypos = hypos.size();\n\n \/\/cerr << \"(\" << (ntEles.size() - 1) << \",\" << ind << \",\" << numHypos << \",\" << ind << \")\";\n \/\/cerr << endl;\n\n if (ind >= numHypos) {\n return false;\n }\n else {\n return true;\n }\n}\n\nstd::string Manager::OutputBest() const\n{\n string outStr;\n const Stack &lastStack = m_stacks.GetLastStack();\n const Hypothesis *bestHypo = lastStack.GetBestHypo(*this, const_cast<ArcLists&>(arcLists));\n\n if (bestHypo) {\n \/\/cerr << \"BEST TRANSLATION: \" << bestHypo << bestHypo->Debug(system) << endl;\n \/\/cerr << \" \" << out.str() << endl;\n stringstream out;\n bestHypo->OutputToStream(out);\n\n outStr = out.str();\n outStr = outStr.substr(4);\n outStr = outStr.substr(0, outStr.size() - 6);\n\n if (system.options.output.ReportHypoScore) {\n outStr = SPrint(bestHypo->GetScores().GetTotalScore()) + \" \" + outStr;\n }\n }\n else {\n if (system.options.output.ReportHypoScore) {\n outStr = \"0 \";\n }\n\n \/\/cerr << \"NO TRANSLATION \" << m_input->GetTranslationId() << endl;\n }\n\n outStr += \"\\n\";\n return outStr;\n}\n\n} \/\/ namespace\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2019 Argonne National Laboratory\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"am_mpi.h\"\n\n\nstatic MPI_Win g_am_win = MPI_WIN_NULL;\nstatic void *g_am_base = NULL;\nstatic __thread int thread_id = 0;\nstatic __thread int am_seq = 0;\nstatic Realm::atomic<unsigned int> num_threads(0);\nstatic unsigned char buf_recv_list[AM_BUF_COUNT][1024];\nstatic unsigned char *buf_recv = buf_recv_list[0];\nstatic MPI_Request req_recv_list[AM_BUF_COUNT];\nstatic int n_am_mult_recv = 5;\nstatic int pre_initialized;\nstatic int node_size;\nstatic int node_this;\nstatic MPI_Comm comm_medium;\nint i_recv_list = 0;\n\nnamespace Realm {\nnamespace MPI {\n\n#define AM_MSG_HEADER_SIZE 4 * sizeof(int)\n\n\nvoid AM_Init(int *p_node_this, int *p_node_size)\n{\n char *s;\n\n MPI_Initialized(&pre_initialized);\n if (pre_initialized) {\n int mpi_thread_model;\n MPI_Query_thread(&mpi_thread_model);\n assert(mpi_thread_model == MPI_THREAD_MULTIPLE);\n } else {\n int mpi_thread_model;\n MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &mpi_thread_model);\n assert(mpi_thread_model == MPI_THREAD_MULTIPLE);\n }\n MPI_Comm_size(MPI_COMM_WORLD, &node_size);\n MPI_Comm_rank(MPI_COMM_WORLD, &node_this);\n *p_node_size = node_size;\n *p_node_this = node_this;\n\n s = getenv(\"AM_MULT_RECV\");\n if (s) {\n n_am_mult_recv = atoi(s);\n }\n for (int i = 0; i<n_am_mult_recv; i++) {\n CHECK_MPI( MPI_Irecv(buf_recv_list[i], 1024, MPI_CHAR, MPI_ANY_SOURCE, MPI_ANY_TAG, MPI_COMM_WORLD, &req_recv_list[i]) );\n }\n MPI_Comm_dup(MPI_COMM_WORLD, &comm_medium);\n}\n\nvoid AM_Finalize()\n{\n MPI_Request req_final;\n\n CHECK_MPI( MPI_Ibarrier(MPI_COMM_WORLD, &req_final) );\n while (1) {\n int is_done;\n MPI_Status status;\n CHECK_MPI( MPI_Test(&req_final, &is_done, &status) );\n if (req_final == MPI_REQUEST_NULL) {\n break;\n }\n AMPoll();\n }\n\n AMPoll_cancel();\n CHECK_MPI( MPI_Comm_free(&comm_medium) );\n\n if (!pre_initialized) {\n MPI_Finalize();\n }\n}\n\nvoid AM_init_long_messages(MPI_Win win, void *am_base)\n{\n g_am_win = win;\n g_am_base = am_base;\n}\n\nvoid AMPoll()\n{\n struct AM_msg *msg;\n int tn_src;\n\n while (1) {\n int got_am;\n MPI_Status status;\n CHECK_MPI( MPI_Test(&req_recv_list[i_recv_list], &got_am, &status) );\n if (!got_am) {\n break;\n }\n msg = (struct AM_msg *) buf_recv;\n\n tn_src = status.MPI_SOURCE;\n\n char *header;\n char *payload;\n int payload_type = 0;\n if (msg->type == 0) {\n header = msg->stuff;\n payload = msg->stuff + msg->header_size;\n } else if (msg->type == 1) {\n header = msg->stuff + 4;\n\n int msg_tag = *(int32_t *)(msg->stuff);\n payload = (char *) malloc(msg->payload_size);\n payload_type = 1; \/\/ need_free;\n CHECK_MPI( MPI_Recv(payload, msg->payload_size, MPI_BYTE, tn_src, msg_tag, comm_medium, &status) );\n } else if (msg->type == 2) {\n int offset = *(int32_t *)(msg->stuff);\n header = msg->stuff + 4;\n payload = (char *) g_am_base + offset;\n }\n\n if (msg->msgid != 0x7fff) {\n Realm::ActiveMessageHandlerTable::MessageHandler handler = Realm::activemsg_handler_table.lookup_message_handler(msg->msgid);\n (*handler) (tn_src, header, payload, msg->payload_size);\n }\n\n if (payload_type == 1) {\n free(payload);\n }\n CHECK_MPI( MPI_Irecv(buf_recv_list[i_recv_list], 1024, MPI_CHAR, MPI_ANY_SOURCE, MPI_ANY_TAG, MPI_COMM_WORLD, &req_recv_list[i_recv_list]) );\n i_recv_list = (i_recv_list + 1) % n_am_mult_recv;\n buf_recv = buf_recv_list[i_recv_list];\n }\n\n}\n\nvoid AMPoll_cancel()\n{\n for (int i = 0; i<n_am_mult_recv; i++) {\n CHECK_MPI( MPI_Cancel(&req_recv_list[i]) );\n }\n}\n\nvoid AMSend(int tgt, int msgid, int header_size, int payload_size, const char *header, const char *payload, int has_dest, MPI_Aint dest)\n{\n char buf_send[1024];\n\n struct AM_msg *msg = (struct AM_msg *)(buf_send);\n msg->msgid = msgid;\n msg->header_size = header_size;\n msg->payload_size = payload_size;\n char *msg_header = msg->stuff;\n\n if (has_dest) {\n assert(g_am_win);\n CHECK_MPI( MPI_Put(payload, payload_size, MPI_BYTE, tgt, dest, payload_size, MPI_BYTE, g_am_win) );\n CHECK_MPI( MPI_Win_flush(tgt, g_am_win) );\n\n msg->type = 2;\n *((int32_t *) msg_header) = (int32_t) dest;\n memcpy(msg_header + 4, header, header_size);\n int n = AM_MSG_HEADER_SIZE + 4 + header_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_BYTE, tgt, 0x1, MPI_COMM_WORLD) );\n } else if (AM_MSG_HEADER_SIZE + header_size + payload_size < 1024) {\n msg->type = 0;\n if (header_size > 0) {\n memcpy(msg_header, header, header_size);\n }\n if (payload_size > 0) {\n memcpy(msg_header + header_size, payload, payload_size);\n }\n int n = AM_MSG_HEADER_SIZE + header_size + payload_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_CHAR, tgt, 0x1, MPI_COMM_WORLD) );\n } else {\n msg->type = 1;\n int msg_tag = 0x0;\n if (thread_id == 0) {\n thread_id = num_threads.fetch_add_acqrel(1) + 1;\n }\n am_seq = (am_seq + 1) & 0x1f;\n msg_tag = (thread_id << 10) + am_seq;\n *((int32_t *) msg_header) = (int32_t) msg_tag;\n memcpy(msg_header + 4, header, header_size);\n int n = AM_MSG_HEADER_SIZE + 4 + header_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_BYTE, tgt, 0x1, MPI_COMM_WORLD) );\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(payload, payload_size, MPI_BYTE, tgt, msg_tag, comm_medium) );\n\n }\n}\n\n} \/* namespace MPI *\/\n} \/* namespace Realm *\/\n<commit_msg>realm: add code path for invalid mpi message types<commit_after>\/* Copyright 2019 Argonne National Laboratory\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"am_mpi.h\"\n\n\nstatic MPI_Win g_am_win = MPI_WIN_NULL;\nstatic void *g_am_base = NULL;\nstatic __thread int thread_id = 0;\nstatic __thread int am_seq = 0;\nstatic Realm::atomic<unsigned int> num_threads(0);\nstatic unsigned char buf_recv_list[AM_BUF_COUNT][1024];\nstatic unsigned char *buf_recv = buf_recv_list[0];\nstatic MPI_Request req_recv_list[AM_BUF_COUNT];\nstatic int n_am_mult_recv = 5;\nstatic int pre_initialized;\nstatic int node_size;\nstatic int node_this;\nstatic MPI_Comm comm_medium;\nint i_recv_list = 0;\n\nnamespace Realm {\nnamespace MPI {\n\n#define AM_MSG_HEADER_SIZE 4 * sizeof(int)\n\n\nvoid AM_Init(int *p_node_this, int *p_node_size)\n{\n char *s;\n\n MPI_Initialized(&pre_initialized);\n if (pre_initialized) {\n int mpi_thread_model;\n MPI_Query_thread(&mpi_thread_model);\n assert(mpi_thread_model == MPI_THREAD_MULTIPLE);\n } else {\n int mpi_thread_model;\n MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &mpi_thread_model);\n assert(mpi_thread_model == MPI_THREAD_MULTIPLE);\n }\n MPI_Comm_size(MPI_COMM_WORLD, &node_size);\n MPI_Comm_rank(MPI_COMM_WORLD, &node_this);\n *p_node_size = node_size;\n *p_node_this = node_this;\n\n s = getenv(\"AM_MULT_RECV\");\n if (s) {\n n_am_mult_recv = atoi(s);\n }\n for (int i = 0; i<n_am_mult_recv; i++) {\n CHECK_MPI( MPI_Irecv(buf_recv_list[i], 1024, MPI_CHAR, MPI_ANY_SOURCE, MPI_ANY_TAG, MPI_COMM_WORLD, &req_recv_list[i]) );\n }\n MPI_Comm_dup(MPI_COMM_WORLD, &comm_medium);\n}\n\nvoid AM_Finalize()\n{\n MPI_Request req_final;\n\n CHECK_MPI( MPI_Ibarrier(MPI_COMM_WORLD, &req_final) );\n while (1) {\n int is_done;\n MPI_Status status;\n CHECK_MPI( MPI_Test(&req_final, &is_done, &status) );\n if (req_final == MPI_REQUEST_NULL) {\n break;\n }\n AMPoll();\n }\n\n AMPoll_cancel();\n CHECK_MPI( MPI_Comm_free(&comm_medium) );\n\n if (!pre_initialized) {\n MPI_Finalize();\n }\n}\n\nvoid AM_init_long_messages(MPI_Win win, void *am_base)\n{\n g_am_win = win;\n g_am_base = am_base;\n}\n\nvoid AMPoll()\n{\n struct AM_msg *msg;\n int tn_src;\n\n while (1) {\n int got_am;\n MPI_Status status;\n CHECK_MPI( MPI_Test(&req_recv_list[i_recv_list], &got_am, &status) );\n if (!got_am) {\n break;\n }\n msg = (struct AM_msg *) buf_recv;\n\n tn_src = status.MPI_SOURCE;\n\n char *header;\n char *payload;\n int payload_type = 0;\n if (msg->type == 0) {\n header = msg->stuff;\n payload = msg->stuff + msg->header_size;\n } else if (msg->type == 1) {\n header = msg->stuff + 4;\n\n int msg_tag = *(int32_t *)(msg->stuff);\n payload = (char *) malloc(msg->payload_size);\n payload_type = 1; \/\/ need_free;\n CHECK_MPI( MPI_Recv(payload, msg->payload_size, MPI_BYTE, tn_src, msg_tag, comm_medium, &status) );\n } else if (msg->type == 2) {\n int offset = *(int32_t *)(msg->stuff);\n header = msg->stuff + 4;\n payload = (char *) g_am_base + offset;\n } else {\n assert(0 && \"invalid message type\");\n header = 0;\n payload = 0;\n msg->msgid = 0x7fff; \/\/ skips handler below\n }\n\n if (msg->msgid != 0x7fff) {\n Realm::ActiveMessageHandlerTable::MessageHandler handler = Realm::activemsg_handler_table.lookup_message_handler(msg->msgid);\n (*handler) (tn_src, header, payload, msg->payload_size);\n }\n\n if (payload_type == 1) {\n free(payload);\n }\n CHECK_MPI( MPI_Irecv(buf_recv_list[i_recv_list], 1024, MPI_CHAR, MPI_ANY_SOURCE, MPI_ANY_TAG, MPI_COMM_WORLD, &req_recv_list[i_recv_list]) );\n i_recv_list = (i_recv_list + 1) % n_am_mult_recv;\n buf_recv = buf_recv_list[i_recv_list];\n }\n\n}\n\nvoid AMPoll_cancel()\n{\n for (int i = 0; i<n_am_mult_recv; i++) {\n CHECK_MPI( MPI_Cancel(&req_recv_list[i]) );\n }\n}\n\nvoid AMSend(int tgt, int msgid, int header_size, int payload_size, const char *header, const char *payload, int has_dest, MPI_Aint dest)\n{\n char buf_send[1024];\n\n struct AM_msg *msg = (struct AM_msg *)(buf_send);\n msg->msgid = msgid;\n msg->header_size = header_size;\n msg->payload_size = payload_size;\n char *msg_header = msg->stuff;\n\n if (has_dest) {\n assert(g_am_win);\n CHECK_MPI( MPI_Put(payload, payload_size, MPI_BYTE, tgt, dest, payload_size, MPI_BYTE, g_am_win) );\n CHECK_MPI( MPI_Win_flush(tgt, g_am_win) );\n\n msg->type = 2;\n *((int32_t *) msg_header) = (int32_t) dest;\n memcpy(msg_header + 4, header, header_size);\n int n = AM_MSG_HEADER_SIZE + 4 + header_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_BYTE, tgt, 0x1, MPI_COMM_WORLD) );\n } else if (AM_MSG_HEADER_SIZE + header_size + payload_size < 1024) {\n msg->type = 0;\n if (header_size > 0) {\n memcpy(msg_header, header, header_size);\n }\n if (payload_size > 0) {\n memcpy(msg_header + header_size, payload, payload_size);\n }\n int n = AM_MSG_HEADER_SIZE + header_size + payload_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_CHAR, tgt, 0x1, MPI_COMM_WORLD) );\n } else {\n msg->type = 1;\n int msg_tag = 0x0;\n if (thread_id == 0) {\n thread_id = num_threads.fetch_add_acqrel(1) + 1;\n }\n am_seq = (am_seq + 1) & 0x1f;\n msg_tag = (thread_id << 10) + am_seq;\n *((int32_t *) msg_header) = (int32_t) msg_tag;\n memcpy(msg_header + 4, header, header_size);\n int n = AM_MSG_HEADER_SIZE + 4 + header_size;\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(buf_send, n, MPI_BYTE, tgt, 0x1, MPI_COMM_WORLD) );\n assert(tgt != node_this);\n CHECK_MPI( MPI_Send(payload, payload_size, MPI_BYTE, tgt, msg_tag, comm_medium) );\n\n }\n}\n\n} \/* namespace MPI *\/\n} \/* namespace Realm *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017-2020 The Verible Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"verilog\/analysis\/verilog_project.h\"\n\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/ascii.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/time\/time.h\"\n#include \"absl\/types\/optional.h\"\n#include \"common\/text\/text_structure.h\"\n#include \"common\/util\/file_util.h\"\n#include \"common\/util\/logging.h\"\n#include \"verilog\/analysis\/verilog_analyzer.h\"\n\nnamespace verilog {\n\n\/\/ All files we process with the verilog project, essentially applications that\n\/\/ build a symbol table (project-tool, kythe-indexer) only benefit from\n\/\/ processing the same sequence of tokens a synthesis tool sees.\nstatic constexpr verilog::VerilogPreprocess::Config kPreprocessConfig{\n .filter_branches = true,\n};\n\nVerilogSourceFile::VerilogSourceFile(absl::string_view referenced_path,\n const absl::Status& status)\n : referenced_path_(referenced_path), status_(status) {}\n\nabsl::Status VerilogSourceFile::Open() {\n \/\/ Don't re-open. analyzed_structure_ should be set\/written once only.\n if (state_ != State::kInitialized) return status_;\n\n \/\/ Load file contents.\n std::string content;\n status_ = verible::file::GetContents(ResolvedPath(), &content);\n if (!status_.ok()) return status_;\n\n \/\/ TODO(fangism): std::move or memory-map to avoid a short-term copy.\n analyzed_structure_ = std::make_unique<VerilogAnalyzer>(\n content, ResolvedPath(), kPreprocessConfig);\n state_ = State::kOpened;\n \/\/ status_ is Ok here.\n return status_;\n}\n\nabsl::Status VerilogSourceFile::Parse() {\n \/\/ Parsed state is cached.\n if (state_ == State::kParsed) return status_;\n\n \/\/ Open file and load contents if not already done.\n status_ = Open();\n if (!status_.ok()) return status_;\n\n \/\/ Lex, parse, populate underlying TextStructureView.\n const absl::Time analyze_start = absl::Now();\n status_ = analyzed_structure_->Analyze();\n LOG(INFO) << \"Analyzed \" << ResolvedPath() << \" in \"\n << absl::ToInt64Milliseconds(absl::Now() - analyze_start) << \"ms\";\n state_ = State::kParsed;\n return status_;\n}\n\nconst verible::TextStructureView* VerilogSourceFile::GetTextStructure() const {\n if (analyzed_structure_ == nullptr) return nullptr;\n return &analyzed_structure_->Data();\n}\n\nstd::vector<std::string> VerilogSourceFile::ErrorMessages() const {\n std::vector<std::string> result;\n if (!analyzed_structure_) return result;\n result = analyzed_structure_->LinterTokenErrorMessages(false);\n return result;\n}\n\nstd::ostream& operator<<(std::ostream& stream,\n const VerilogSourceFile& source) {\n stream << \"referenced path: \" << source.ReferencedPath() << std::endl;\n stream << \"resolved path: \" << source.ResolvedPath() << std::endl;\n stream << \"corpus: \" << source.Corpus() << std::endl;\n const auto status = source.Status();\n stream << \"status: \" << (status.ok() ? \"ok\" : status.message()) << std::endl;\n const auto* text_structure = source.GetTextStructure();\n stream << \"have text structure? \"\n << ((text_structure != nullptr) ? \"yes\" : \"no\") << std::endl;\n return stream;\n}\n\nabsl::Status InMemoryVerilogSourceFile::Open() {\n analyzed_structure_ = ABSL_DIE_IF_NULL(std::make_unique<VerilogAnalyzer>(\n contents_for_open_, ResolvedPath(), kPreprocessConfig));\n state_ = State::kOpened;\n status_ = absl::OkStatus();\n return status_;\n}\n\nabsl::Status ParsedVerilogSourceFile::Open() {\n state_ = State::kOpened;\n status_ = absl::OkStatus();\n return status_;\n}\n\nabsl::Status ParsedVerilogSourceFile::Parse() {\n state_ = State::kParsed;\n status_ = absl::OkStatus();\n return status_;\n}\n\nconst verible::TextStructureView* ParsedVerilogSourceFile::GetTextStructure()\n const {\n return text_structure_;\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenFile(\n absl::string_view referenced_filename, absl::string_view resolved_filename,\n absl::string_view corpus) {\n const auto inserted = files_.emplace(\n referenced_filename, absl::make_unique<VerilogSourceFile>(\n referenced_filename, resolved_filename, corpus));\n CHECK(inserted.second); \/\/ otherwise, would have already returned above\n const auto file_iter = inserted.first;\n VerilogSourceFile& file(*file_iter->second);\n\n \/\/ Read the file's contents.\n const absl::Status status = file.Open();\n if (!status.ok()) return status;\n\n \/\/ NOTE: string view maps don't support removal operation. The following block\n \/\/ is valid only if files won't be removed from the project.\n if (populate_string_maps_) {\n const absl::string_view contents(file.GetTextStructure()->Contents());\n\n \/\/ Register the file's contents range in string_view_map_.\n string_view_map_.must_emplace(contents);\n\n \/\/ Map the start of the file's contents to its corresponding owner\n \/\/ VerilogSourceFile.\n const auto map_inserted =\n buffer_to_analyzer_map_.emplace(contents.begin(), file_iter);\n CHECK(map_inserted.second);\n }\n\n return &file;\n}\n\nbool VerilogProject::RemoveRegisteredFile(\n absl::string_view referenced_filename) {\n CHECK(!populate_string_maps_)\n << \"Removing of files added to string maps is not supported! Disable \"\n \"populating string maps.\";\n if (files_.erase(std::string(referenced_filename)) == 1) {\n LOG(INFO) << \"Removed \" << referenced_filename << \" from the project.\";\n return true;\n }\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n if (files_.erase(resolved_filename) == 1) {\n LOG(INFO) << \"Removed \" << resolved_filename << \" from the project.\";\n return true;\n }\n }\n return false;\n}\n\nVerilogSourceFile* VerilogProject::LookupRegisteredFileInternal(\n absl::string_view referenced_filename) const {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n if (!opened_file->ok()) {\n return nullptr;\n }\n return opened_file->value();\n }\n\n \/\/ Check if this is already opened include file\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return opened_file->ok() ? opened_file->value() : nullptr;\n }\n }\n return nullptr;\n}\n\nabsl::optional<absl::StatusOr<VerilogSourceFile*>>\nVerilogProject::FindOpenedFile(absl::string_view filename) const {\n const auto found = files_.find(filename);\n if (found != files_.end()) {\n const auto status = found->second->Status();\n if (!status.ok()) return status;\n return found->second.get();\n }\n return absl::nullopt;\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenTranslationUnit(\n absl::string_view referenced_filename) {\n \/\/ Check for a pre-existing entry to avoid duplicate files.\n {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Locate the file among the base paths.\n const std::string resolved_filename =\n verible::file::JoinPath(TranslationUnitRoot(), referenced_filename);\n \/\/ Check if this is already opened file\n {\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n return OpenFile(referenced_filename, resolved_filename, Corpus());\n}\n\nabsl::Status VerilogProject::IncludeFileNotFoundError(\n absl::string_view referenced_filename) const {\n return absl::NotFoundError(absl::StrCat(\n \"Unable to find '\", referenced_filename,\n \"' among the included paths: \", absl::StrJoin(include_paths_, \", \")));\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenIncludedFile(\n absl::string_view referenced_filename) {\n VLOG(1) << __FUNCTION__ << \", referenced: \" << referenced_filename;\n \/\/ Check for a pre-existing entry to avoid duplicate files.\n {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Check if this is already opened include file\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Locate the file among the base paths.\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n if (verible::file::FileExists(resolved_filename).ok()) {\n VLOG(2) << \"File '\" << resolved_filename << \"' exists. Resolved from '\"\n << referenced_filename << \"'\";\n return OpenFile(referenced_filename, resolved_filename, Corpus());\n }\n VLOG(2) << \"Checked for file'\" << resolved_filename\n << \"', but not found. Resolved from '\" << referenced_filename\n << \"'\";\n }\n\n \/\/ Not found in any path. Cache this status.\n const auto inserted = files_.emplace(\n referenced_filename,\n absl::make_unique<VerilogSourceFile>(\n referenced_filename, IncludeFileNotFoundError(referenced_filename)));\n CHECK(inserted.second) << \"Not-found file should have been recorded as such.\";\n return inserted.first->second->Status();\n}\n\nvoid VerilogProject::AddVirtualFile(absl::string_view resolved_filename,\n absl::string_view content) {\n const auto inserted = files_.emplace(\n resolved_filename, absl::make_unique<InMemoryVerilogSourceFile>(\n resolved_filename, content, \/*corpus=*\/\"\"));\n CHECK(inserted.second);\n}\n\nconst VerilogSourceFile* VerilogProject::LookupFileOrigin(\n absl::string_view content_substring) const {\n \/\/ Look for corresponding source text (superstring) buffer start.\n const auto found_superstring = string_view_map_.find(content_substring);\n if (found_superstring == string_view_map_.end()) return nullptr;\n const absl::string_view::const_iterator buffer_start =\n found_superstring->first;\n\n \/\/ Reverse-lookup originating file based on buffer start.\n const auto found_file = buffer_to_analyzer_map_.find(buffer_start);\n if (found_file == buffer_to_analyzer_map_.end()) return nullptr;\n\n const VerilogSourceFile* file = found_file->second->second.get();\n return file;\n}\n\n} \/\/ namespace verilog\n<commit_msg>require enabling string view population before looking up the file origin<commit_after>\/\/ Copyright 2017-2020 The Verible Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"verilog\/analysis\/verilog_project.h\"\n\n#include <iostream>\n#include <string>\n#include <vector>\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/status\/status.h\"\n#include \"absl\/strings\/ascii.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"absl\/time\/time.h\"\n#include \"absl\/types\/optional.h\"\n#include \"common\/text\/text_structure.h\"\n#include \"common\/util\/file_util.h\"\n#include \"common\/util\/logging.h\"\n#include \"verilog\/analysis\/verilog_analyzer.h\"\n\nnamespace verilog {\n\n\/\/ All files we process with the verilog project, essentially applications that\n\/\/ build a symbol table (project-tool, kythe-indexer) only benefit from\n\/\/ processing the same sequence of tokens a synthesis tool sees.\nstatic constexpr verilog::VerilogPreprocess::Config kPreprocessConfig{\n .filter_branches = true,\n};\n\nVerilogSourceFile::VerilogSourceFile(absl::string_view referenced_path,\n const absl::Status& status)\n : referenced_path_(referenced_path), status_(status) {}\n\nabsl::Status VerilogSourceFile::Open() {\n \/\/ Don't re-open. analyzed_structure_ should be set\/written once only.\n if (state_ != State::kInitialized) return status_;\n\n \/\/ Load file contents.\n std::string content;\n status_ = verible::file::GetContents(ResolvedPath(), &content);\n if (!status_.ok()) return status_;\n\n \/\/ TODO(fangism): std::move or memory-map to avoid a short-term copy.\n analyzed_structure_ = std::make_unique<VerilogAnalyzer>(\n content, ResolvedPath(), kPreprocessConfig);\n state_ = State::kOpened;\n \/\/ status_ is Ok here.\n return status_;\n}\n\nabsl::Status VerilogSourceFile::Parse() {\n \/\/ Parsed state is cached.\n if (state_ == State::kParsed) return status_;\n\n \/\/ Open file and load contents if not already done.\n status_ = Open();\n if (!status_.ok()) return status_;\n\n \/\/ Lex, parse, populate underlying TextStructureView.\n const absl::Time analyze_start = absl::Now();\n status_ = analyzed_structure_->Analyze();\n LOG(INFO) << \"Analyzed \" << ResolvedPath() << \" in \"\n << absl::ToInt64Milliseconds(absl::Now() - analyze_start) << \"ms\";\n state_ = State::kParsed;\n return status_;\n}\n\nconst verible::TextStructureView* VerilogSourceFile::GetTextStructure() const {\n if (analyzed_structure_ == nullptr) return nullptr;\n return &analyzed_structure_->Data();\n}\n\nstd::vector<std::string> VerilogSourceFile::ErrorMessages() const {\n std::vector<std::string> result;\n if (!analyzed_structure_) return result;\n result = analyzed_structure_->LinterTokenErrorMessages(false);\n return result;\n}\n\nstd::ostream& operator<<(std::ostream& stream,\n const VerilogSourceFile& source) {\n stream << \"referenced path: \" << source.ReferencedPath() << std::endl;\n stream << \"resolved path: \" << source.ResolvedPath() << std::endl;\n stream << \"corpus: \" << source.Corpus() << std::endl;\n const auto status = source.Status();\n stream << \"status: \" << (status.ok() ? \"ok\" : status.message()) << std::endl;\n const auto* text_structure = source.GetTextStructure();\n stream << \"have text structure? \"\n << ((text_structure != nullptr) ? \"yes\" : \"no\") << std::endl;\n return stream;\n}\n\nabsl::Status InMemoryVerilogSourceFile::Open() {\n analyzed_structure_ = ABSL_DIE_IF_NULL(std::make_unique<VerilogAnalyzer>(\n contents_for_open_, ResolvedPath(), kPreprocessConfig));\n state_ = State::kOpened;\n status_ = absl::OkStatus();\n return status_;\n}\n\nabsl::Status ParsedVerilogSourceFile::Open() {\n state_ = State::kOpened;\n status_ = absl::OkStatus();\n return status_;\n}\n\nabsl::Status ParsedVerilogSourceFile::Parse() {\n state_ = State::kParsed;\n status_ = absl::OkStatus();\n return status_;\n}\n\nconst verible::TextStructureView* ParsedVerilogSourceFile::GetTextStructure()\n const {\n return text_structure_;\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenFile(\n absl::string_view referenced_filename, absl::string_view resolved_filename,\n absl::string_view corpus) {\n const auto inserted = files_.emplace(\n referenced_filename, absl::make_unique<VerilogSourceFile>(\n referenced_filename, resolved_filename, corpus));\n CHECK(inserted.second); \/\/ otherwise, would have already returned above\n const auto file_iter = inserted.first;\n VerilogSourceFile& file(*file_iter->second);\n\n \/\/ Read the file's contents.\n const absl::Status status = file.Open();\n if (!status.ok()) return status;\n\n \/\/ NOTE: string view maps don't support removal operation. The following block\n \/\/ is valid only if files won't be removed from the project.\n if (populate_string_maps_) {\n const absl::string_view contents(file.GetTextStructure()->Contents());\n\n \/\/ Register the file's contents range in string_view_map_.\n string_view_map_.must_emplace(contents);\n\n \/\/ Map the start of the file's contents to its corresponding owner\n \/\/ VerilogSourceFile.\n const auto map_inserted =\n buffer_to_analyzer_map_.emplace(contents.begin(), file_iter);\n CHECK(map_inserted.second);\n }\n\n return &file;\n}\n\nbool VerilogProject::RemoveRegisteredFile(\n absl::string_view referenced_filename) {\n CHECK(!populate_string_maps_)\n << \"Removing of files added to string maps is not supported! Disable \"\n \"populating string maps.\";\n if (files_.erase(std::string(referenced_filename)) == 1) {\n LOG(INFO) << \"Removed \" << referenced_filename << \" from the project.\";\n return true;\n }\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n if (files_.erase(resolved_filename) == 1) {\n LOG(INFO) << \"Removed \" << resolved_filename << \" from the project.\";\n return true;\n }\n }\n return false;\n}\n\nVerilogSourceFile* VerilogProject::LookupRegisteredFileInternal(\n absl::string_view referenced_filename) const {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n if (!opened_file->ok()) {\n return nullptr;\n }\n return opened_file->value();\n }\n\n \/\/ Check if this is already opened include file\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return opened_file->ok() ? opened_file->value() : nullptr;\n }\n }\n return nullptr;\n}\n\nabsl::optional<absl::StatusOr<VerilogSourceFile*>>\nVerilogProject::FindOpenedFile(absl::string_view filename) const {\n const auto found = files_.find(filename);\n if (found != files_.end()) {\n const auto status = found->second->Status();\n if (!status.ok()) return status;\n return found->second.get();\n }\n return absl::nullopt;\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenTranslationUnit(\n absl::string_view referenced_filename) {\n \/\/ Check for a pre-existing entry to avoid duplicate files.\n {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Locate the file among the base paths.\n const std::string resolved_filename =\n verible::file::JoinPath(TranslationUnitRoot(), referenced_filename);\n \/\/ Check if this is already opened file\n {\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n return OpenFile(referenced_filename, resolved_filename, Corpus());\n}\n\nabsl::Status VerilogProject::IncludeFileNotFoundError(\n absl::string_view referenced_filename) const {\n return absl::NotFoundError(absl::StrCat(\n \"Unable to find '\", referenced_filename,\n \"' among the included paths: \", absl::StrJoin(include_paths_, \", \")));\n}\n\nabsl::StatusOr<VerilogSourceFile*> VerilogProject::OpenIncludedFile(\n absl::string_view referenced_filename) {\n VLOG(1) << __FUNCTION__ << \", referenced: \" << referenced_filename;\n \/\/ Check for a pre-existing entry to avoid duplicate files.\n {\n const auto opened_file = FindOpenedFile(referenced_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Check if this is already opened include file\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n const auto opened_file = FindOpenedFile(resolved_filename);\n if (opened_file) {\n return *opened_file;\n }\n }\n\n \/\/ Locate the file among the base paths.\n for (const auto& include_path : include_paths_) {\n const std::string resolved_filename =\n verible::file::JoinPath(include_path, referenced_filename);\n if (verible::file::FileExists(resolved_filename).ok()) {\n VLOG(2) << \"File '\" << resolved_filename << \"' exists. Resolved from '\"\n << referenced_filename << \"'\";\n return OpenFile(referenced_filename, resolved_filename, Corpus());\n }\n VLOG(2) << \"Checked for file'\" << resolved_filename\n << \"', but not found. Resolved from '\" << referenced_filename\n << \"'\";\n }\n\n \/\/ Not found in any path. Cache this status.\n const auto inserted = files_.emplace(\n referenced_filename,\n absl::make_unique<VerilogSourceFile>(\n referenced_filename, IncludeFileNotFoundError(referenced_filename)));\n CHECK(inserted.second) << \"Not-found file should have been recorded as such.\";\n return inserted.first->second->Status();\n}\n\nvoid VerilogProject::AddVirtualFile(absl::string_view resolved_filename,\n absl::string_view content) {\n const auto inserted = files_.emplace(\n resolved_filename, absl::make_unique<InMemoryVerilogSourceFile>(\n resolved_filename, content, \/*corpus=*\/\"\"));\n CHECK(inserted.second);\n}\n\nconst VerilogSourceFile* VerilogProject::LookupFileOrigin(\n absl::string_view content_substring) const {\n CHECK(populate_string_maps_)\n << \"Populating string maps must be enabled for LookupFileOrigin!\";\n \/\/ Look for corresponding source text (superstring) buffer start.\n const auto found_superstring = string_view_map_.find(content_substring);\n if (found_superstring == string_view_map_.end()) return nullptr;\n const absl::string_view::const_iterator buffer_start =\n found_superstring->first;\n\n \/\/ Reverse-lookup originating file based on buffer start.\n const auto found_file = buffer_to_analyzer_map_.find(buffer_start);\n if (found_file == buffer_to_analyzer_map_.end()) return nullptr;\n\n const VerilogSourceFile* file = found_file->second->second.get();\n return file;\n}\n\n} \/\/ namespace verilog\n<|endoftext|>"} {"text":"<commit_before>#include \"testApp.h\"\n\nbool locked = false;\n\n\/\/--------------------------------------------------------------\nvoid testApp::setup(){\n ofSetFrameRate(30);\n loadCameras();\n rs = new ofxRandomSampler(ipcams.size()); \n \/\/ initialize connection\n for(int i = 0; i < NUM_CAMERAS; i++) {\n IPCameraDef& cam = getRandomCamera();\n \n \/\/ if your camera uses standard web-based authentication, use this\n ipGrabber[i].setUsername(cam.username);\n ipGrabber[i].setPassword(cam.password);\n \n \/\/ if your camera uses cookies for authentication, use something like this:\n \/\/ ipGrabber[i].setCookie(\"user\", cam.username);\n \/\/ ipGrabber[i].setCookie(\"password\", cam.password);\n \n URI uri(cam.uri);\n ipGrabber[i].setURI(uri);\n ipGrabber[i].connect();\n \/\/ set up the listener!\n ofAddListener(ipGrabber[i].videoResized, this, &testApp::videoResized);\n }\n}\n\n\/\/--------------------------------------------------------------\nIPCameraDef& testApp::getRandomCamera() {\n return ipcams[rs->next()]; \/\/ get the next camera, sampling w\/o replacement\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::loadCameras() {\n \n \/\/ all of these cameras were found using this google query\n \/\/ http:\/\/www.google.com\/search?q=inurl%3A%22axis-cgi%2Fmjpg%22\n \/\/ some of the cameras below may no longer be valid.\n \n \/\/ to define a camera with a username \/ password\n \/\/ipcams.push_back(IPCameraDef(\"http:\/\/148.61.142.228\/axis-cgi\/mjpg\/video.cgi\", \"username\", \"password\"));\n\n ipcams.push_back(IPCameraDef(\"http:\/\/148.61.142.228\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/82.79.176.85:8081\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/81.8.151.136:88\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/130.15.110.15\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/80.34.88.249\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/216.8.159.21\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/kassertheatercam.montclair.edu\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/74.94.55.182\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/213.77.33.2:8080\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/129.89.28.32\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/129.171.176.150\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/134.29.208.43\/mjpg\/video.mjpg?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/134.29.208.43\/mjpg\/video.mjpg?resolution=320x240\"));\n \n}\n\n\n\/\/--------------------------------------------------------------\nvoid testApp::videoResized(const void * sender, ofResizeEventArgs& arg) {\n\n ofLog(OF_LOG_VERBOSE, \"testApp::videoResized: A camera was resized.\");\n\n \/\/ find the camera that sent the resize event changed\n for(int i = 0; i < NUM_CAMERAS; i++) {\n if(sender == &ipGrabber[i]) {\n stringstream ss;\n ss << \"testApp::videoResized: \";\n ss << \"Camera connected to: \" << ipGrabber[i].getURI() + \" \";\n ss << \"New DIM = \" << arg.width << \"\/\" << arg.height;\n ofLog(OF_LOG_VERBOSE, ss.str());\n }\n }\n ofLog(OF_LOG_VERBOSE, \"Unable to locate the camera. Very odd.\");\n}\n\n\n\/\/--------------------------------------------------------------\nvoid testApp::update(){\n \/\/ update the cameras\n for(int i = 0; i < NUM_CAMERAS; i++) {\n ipGrabber[i].update();\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::draw(){\n\tofBackground(0,0,0);\n\n\tofSetHexColor(0xffffff);\n \n int row = 0;\n int col = 0;\n \n int x = 0;\n int y = 0;\n \n int w = 320;\n int h = 240;\n \n float totalKBPS = 0;\n float totalFPS = 0;\n \n for(int i = 0; i < NUM_CAMERAS; i++) {\n x = col * w;\n y = row * h;\n\n \/\/ draw in a grid\n row = (row + 1) % NUM_ROWS;\n if(row == 0) {\n col = (col + 1) % NUM_COLS;\n }\n\n \n ofPushMatrix();\n ofTranslate(x,y);\n ofSetColor(255,255,255,255);\n ipGrabber[i].draw(0,0,w,h); \/\/ draw the camera\n \n ofEnableAlphaBlending();\n \n \/\/ draw the info box\n ofSetColor(0,0,0,127);\n ofRect(5,h-47,w-10,42);\n \n float kbps = ipGrabber[i].getBitRate() \/ (8 * 1000.0);\n totalKBPS+=kbps;\n \n float fps = ipGrabber[i].getFrameRate();\n totalFPS+=fps;\n \n \n ofSetColor(255);\n ofDrawBitmapString(\"HOST: \" + ipGrabber[i].getHost(), 10, h-34);\n ofDrawBitmapString(\" FPS: \" + ofToString(fps, 2,7,' '), 10, h-22);\n ofDrawBitmapString(\"KB\/S: \" + ofToString(kbps, 2,7,' '), 10, h-10);\n \n ofDisableAlphaBlending();\n \n ofPopMatrix();\n }\n \n \/\/ keep track of some totals\n float avgFPS = totalFPS \/ NUM_CAMERAS;\n float avgKBPS = totalKBPS \/ NUM_CAMERAS;\n\n ofEnableAlphaBlending();\n ofSetColor(0,80);\n ofRect(5,5, 150, 40);\n \n ofSetColor(255);\n ofDrawBitmapString(\" AVG FPS: \" + ofToString(avgFPS,2,7,' '), 10,17);\n ofDrawBitmapString(\"AVG KB\/S: \" + ofToString(avgKBPS,2,7,' '), 10,29);\n ofDrawBitmapString(\"TOT KB\/S: \" + ofToString(totalKBPS,2,7,' '), 10,41);\n ofDisableAlphaBlending();\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyPressed (int key){\n if(key == ' ') {\n \n rs->reset();\n \/\/ initialize connection\n for(int i = 0; i < NUM_CAMERAS; i++) {\n ipGrabber[i].waitForDisconnect();\n \/\/ we may need to wait a sec here\n IPCameraDef& cam = getRandomCamera();\n ipGrabber[i].setUsername(cam.username);\n ipGrabber[i].setPassword(cam.password);\n URI uri(cam.uri);\n ipGrabber[i].setURI(uri);\n ipGrabber[i].connect();\n }\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyReleased(int key){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseMoved(int x, int y ){\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseDragged(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mousePressed(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseReleased(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::windowResized(int w, int h){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::gotMessage(ofMessage msg){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::dragEvent(ofDragInfo dragInfo){ \n\n}\n<commit_msg>Fix data rate calc and units.<commit_after>#include \"testApp.h\"\n\nbool locked = false;\n\n\/\/--------------------------------------------------------------\nvoid testApp::setup(){\n ofSetFrameRate(30);\n loadCameras();\n rs = new ofxRandomSampler(ipcams.size()); \n \/\/ initialize connection\n for(int i = 0; i < NUM_CAMERAS; i++) {\n IPCameraDef& cam = getRandomCamera();\n \n \/\/ if your camera uses standard web-based authentication, use this\n ipGrabber[i].setUsername(cam.username);\n ipGrabber[i].setPassword(cam.password);\n \n \/\/ if your camera uses cookies for authentication, use something like this:\n \/\/ ipGrabber[i].setCookie(\"user\", cam.username);\n \/\/ ipGrabber[i].setCookie(\"password\", cam.password);\n \n URI uri(cam.uri);\n ipGrabber[i].setURI(uri);\n ipGrabber[i].connect();\n \/\/ set up the listener!\n ofAddListener(ipGrabber[i].videoResized, this, &testApp::videoResized);\n }\n}\n\n\/\/--------------------------------------------------------------\nIPCameraDef& testApp::getRandomCamera() {\n return ipcams[rs->next()]; \/\/ get the next camera, sampling w\/o replacement\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::loadCameras() {\n \n \/\/ all of these cameras were found using this google query\n \/\/ http:\/\/www.google.com\/search?q=inurl%3A%22axis-cgi%2Fmjpg%22\n \/\/ some of the cameras below may no longer be valid.\n \n \/\/ to define a camera with a username \/ password\n \/\/ipcams.push_back(IPCameraDef(\"http:\/\/148.61.142.228\/axis-cgi\/mjpg\/video.cgi\", \"username\", \"password\"));\n\n ipcams.push_back(IPCameraDef(\"http:\/\/148.61.142.228\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/82.79.176.85:8081\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/81.8.151.136:88\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/130.15.110.15\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/80.34.88.249\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/216.8.159.21\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/kassertheatercam.montclair.edu\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/74.94.55.182\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/213.77.33.2:8080\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/129.89.28.32\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/129.171.176.150\/axis-cgi\/mjpg\/video.cgi?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/134.29.208.43\/mjpg\/video.mjpg?resolution=320x240\"));\n ipcams.push_back(IPCameraDef(\"http:\/\/134.29.208.43\/mjpg\/video.mjpg?resolution=320x240\"));\n \n}\n\n\n\/\/--------------------------------------------------------------\nvoid testApp::videoResized(const void * sender, ofResizeEventArgs& arg) {\n\n ofLog(OF_LOG_VERBOSE, \"testApp::videoResized: A camera was resized.\");\n\n \/\/ find the camera that sent the resize event changed\n for(int i = 0; i < NUM_CAMERAS; i++) {\n if(sender == &ipGrabber[i]) {\n stringstream ss;\n ss << \"testApp::videoResized: \";\n ss << \"Camera connected to: \" << ipGrabber[i].getURI() + \" \";\n ss << \"New DIM = \" << arg.width << \"\/\" << arg.height;\n ofLog(OF_LOG_VERBOSE, ss.str());\n }\n }\n ofLog(OF_LOG_VERBOSE, \"Unable to locate the camera. Very odd.\");\n}\n\n\n\/\/--------------------------------------------------------------\nvoid testApp::update(){\n \/\/ update the cameras\n for(int i = 0; i < NUM_CAMERAS; i++) {\n ipGrabber[i].update();\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::draw(){\n\tofBackground(0,0,0);\n\n\tofSetHexColor(0xffffff);\n \n int row = 0;\n int col = 0;\n \n int x = 0;\n int y = 0;\n \n int w = 320;\n int h = 240;\n \n float totalKbps = 0;\n float totalFPS = 0;\n \n for(int i = 0; i < NUM_CAMERAS; i++) {\n x = col * w;\n y = row * h;\n\n \/\/ draw in a grid\n row = (row + 1) % NUM_ROWS;\n if(row == 0) {\n col = (col + 1) % NUM_COLS;\n }\n\n \n ofPushMatrix();\n ofTranslate(x,y);\n ofSetColor(255,255,255,255);\n ipGrabber[i].draw(0,0,w,h); \/\/ draw the camera\n \n ofEnableAlphaBlending();\n \n \/\/ draw the info box\n ofSetColor(0,0,0,127);\n ofRect(5,h-47,w-10,42);\n \n float kbps = ipGrabber[i].getBitRate() \/ 1000.0f; \/\/ kilobits \/ second, not kibibits \/ second\n totalKbps+=kbps;\n \n float fps = ipGrabber[i].getFrameRate();\n totalFPS+=fps;\n \n \n ofSetColor(255);\n ofDrawBitmapString(\"HOST: \" + ipGrabber[i].getHost(), 10, h-34);\n ofDrawBitmapString(\" FPS: \" + ofToString(fps, 2,7,' '), 10, h-22);\n ofDrawBitmapString(\"Kb\/S: \" + ofToString(kbps, 2,7,' '), 10, h-10);\n \n ofDisableAlphaBlending();\n \n ofPopMatrix();\n }\n \n \/\/ keep track of some totals\n float avgFPS = totalFPS \/ NUM_CAMERAS;\n float avgKbps = totalKbps \/ NUM_CAMERAS;\n\n ofEnableAlphaBlending();\n ofSetColor(0,80);\n ofRect(5,5, 150, 40);\n \n ofSetColor(255);\n ofDrawBitmapString(\" AVG FPS: \" + ofToString(avgFPS,2,7,' '), 10,17);\n ofDrawBitmapString(\"AVG Kb\/S: \" + ofToString(avgKbps,2,7,' '), 10,29);\n ofDrawBitmapString(\"TOT Kb\/S: \" + ofToString(totalKbps,2,7,' '), 10,41);\n ofDisableAlphaBlending();\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyPressed (int key){\n if(key == ' ') {\n \n rs->reset();\n \/\/ initialize connection\n for(int i = 0; i < NUM_CAMERAS; i++) {\n ipGrabber[i].waitForDisconnect();\n \/\/ we may need to wait a sec here\n IPCameraDef& cam = getRandomCamera();\n ipGrabber[i].setUsername(cam.username);\n ipGrabber[i].setPassword(cam.password);\n URI uri(cam.uri);\n ipGrabber[i].setURI(uri);\n ipGrabber[i].connect();\n }\n }\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::keyReleased(int key){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseMoved(int x, int y ){\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseDragged(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mousePressed(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::mouseReleased(int x, int y, int butipGrabbern){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::windowResized(int w, int h){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::gotMessage(ofMessage msg){\n\n}\n\n\/\/--------------------------------------------------------------\nvoid testApp::dragEvent(ofDragInfo dragInfo){ \n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <gtk\/gtk.h>\n\n#include \"views\/focus\/accelerator_handler.h\"\n\n#include \"views\/focus\/focus_manager.h\"\n#include \"views\/widget\/widget_gtk.h\"\n#include \"views\/window\/window_gtk.h\"\n\nnamespace views {\n\nAcceleratorHandler::AcceleratorHandler() : last_key_pressed_(0) {\n}\n\nbool AcceleratorHandler::Dispatch(GdkEvent* event) {\n if (event->type != GDK_KEY_PRESS && event->type != GDK_KEY_RELEASE) {\n gtk_main_do_event(event);\n return true;\n }\n\n GdkEventKey* key_event = reinterpret_cast<GdkEventKey*>(event);\n \/\/ Let's retrieve the focus manager for the GdkWindow.\n GdkWindow* window = gdk_window_get_toplevel(key_event->window);\n gpointer ptr;\n gdk_window_get_user_data(window, &ptr);\n DCHECK(ptr); \/\/ The top-level window is expected to always be associated\n \/\/ with the top-level gtk widget.\n WindowGtk* widget =\n WidgetGtk::GetWindowForNative(reinterpret_cast<GtkWidget*>(ptr));\n if (!widget) {\n \/\/ During dnd we get events for windows we don't control (such as the\n \/\/ window being dragged).\n return true;\n }\n FocusManager* focus_manager = widget->GetFocusManager();\n if (!focus_manager) {\n NOTREACHED();\n return true;\n }\n\n if (event->type == GDK_KEY_PRESS) {\n KeyEvent view_key_event(key_event, true);\n \/\/ FocusManager::OnKeyPressed and OnKeyReleased return false if this\n \/\/ message has been consumed and should not be propagated further.\n if (!focus_manager->OnKeyEvent(view_key_event)) {\n last_key_pressed_ = key_event->keyval;\n return true;\n }\n }\n\n \/\/ Key release, make sure to filter-out the key release for key press consumed\n \/\/ as accelerators to avoid unpaired key release.\n if (event->type == GDK_KEY_RELEASE &&\n key_event->keyval == last_key_pressed_) {\n last_key_pressed_ = 0;\n return true;\n }\n\n gtk_main_do_event(event);\n return true;\n}\n\n} \/\/ namespace views\n<commit_msg>Fixes bug in previous change. In AcceleratorHandler if there is no WidgetGtk we should dispatch the event, not eat it.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <gtk\/gtk.h>\n\n#include \"views\/focus\/accelerator_handler.h\"\n\n#include \"views\/focus\/focus_manager.h\"\n#include \"views\/widget\/widget_gtk.h\"\n#include \"views\/window\/window_gtk.h\"\n\nnamespace views {\n\nAcceleratorHandler::AcceleratorHandler() : last_key_pressed_(0) {\n}\n\nbool AcceleratorHandler::Dispatch(GdkEvent* event) {\n if (event->type != GDK_KEY_PRESS && event->type != GDK_KEY_RELEASE) {\n gtk_main_do_event(event);\n return true;\n }\n\n GdkEventKey* key_event = reinterpret_cast<GdkEventKey*>(event);\n \/\/ Let's retrieve the focus manager for the GdkWindow.\n GdkWindow* window = gdk_window_get_toplevel(key_event->window);\n gpointer ptr;\n gdk_window_get_user_data(window, &ptr);\n DCHECK(ptr); \/\/ The top-level window is expected to always be associated\n \/\/ with the top-level gtk widget.\n WindowGtk* widget =\n WidgetGtk::GetWindowForNative(reinterpret_cast<GtkWidget*>(ptr));\n if (!widget) {\n \/\/ During dnd we get events for windows we don't control (such as the\n \/\/ window being dragged).\n gtk_main_do_event(event);\n return true;\n }\n FocusManager* focus_manager = widget->GetFocusManager();\n if (!focus_manager) {\n NOTREACHED();\n return true;\n }\n\n if (event->type == GDK_KEY_PRESS) {\n KeyEvent view_key_event(key_event, true);\n \/\/ FocusManager::OnKeyPressed and OnKeyReleased return false if this\n \/\/ message has been consumed and should not be propagated further.\n if (!focus_manager->OnKeyEvent(view_key_event)) {\n last_key_pressed_ = key_event->keyval;\n return true;\n }\n }\n\n \/\/ Key release, make sure to filter-out the key release for key press consumed\n \/\/ as accelerators to avoid unpaired key release.\n if (event->type == GDK_KEY_RELEASE &&\n key_event->keyval == last_key_pressed_) {\n last_key_pressed_ = 0;\n return true;\n }\n\n gtk_main_do_event(event);\n return true;\n}\n\n} \/\/ namespace views\n<|endoftext|>"} {"text":"<commit_before>\/*\n * @file: perceptron_main.cpp\n * @author: Udit Saxena\n *\n * This program runs the Simple Perceptron Classifier.\n *\n * Perceptrons are simple single-layer binary classifiers, which solve linearly\n * separable problems with a linear decision boundary.\n *\/\n\n#include <mlpack\/core.hpp>\n#include \"perceptron.hpp\"\n\nusing namespace mlpack;\nusing namespace mlpack::perceptron;\nusing namespace std;\nusing namespace arma;\n\nPROGRAM_INFO(\"Perceptron\",\n \"This program implements a perceptron, which is a single level \"\n \"Neural Network. The perceptron makes its predictions based on \"\n \"a linear predictor function combining a set of weights with the feature \"\n \"vector.\\n\"\n \"The perceptron learning rule is able to converge, given enough iterations \"\n \"using the --iterations (-i) parameter, if the data supplied is \"\n \"linearly separable. \"\n \"\\n\"\n \"The Perceptron is parameterized by a matrix of weight vectors which \"\n \"denotes the numerical weights of the Neural Network.\"\n \"\\n\"\n \"This program allows training of a perceptron, and then application of \"\n \"the learned perceptron to a test dataset. To train a perceptron, \"\n \"a training dataset must be passed to --train_file (-t). Labels can either \"\n \"be present as the last dimension of the training dataset, or given \"\n \"explicitly with the --labels_file (-l) parameter.\"\n \"\\n\"\n \"A test file is given through the --test_file (-T) parameter. The \"\n \"predicted labels for the test set will be stored in the file specified by \"\n \"the --output_file (-o) parameter.\"\n );\n\n\/\/ Necessary parameters\nPARAM_STRING_REQ(\"train_file\", \"A file containing the training set.\", \"t\");\nPARAM_STRING(\"labels_file\", \"A file containing labels for the training set.\",\n \"l\",\"\");\nPARAM_STRING_REQ(\"test_file\", \"A file containing the test set.\", \"T\");\n\n\/\/ Optional parameters.\nPARAM_STRING(\"output\", \"The file in which the predicted labels for the test set\"\n \" will be written.\", \"o\", \"output.csv\");\nPARAM_INT(\"iterations\",\"The maximum number of iterations the perceptron is \"\n \"to be run\", \"i\", 1000);\n\nint main(int argc, char** argv)\n{\n CLI::ParseCommandLine(argc, argv);\n\n \/\/ Get reference dataset filename.\n const string trainingDataFilename = CLI::GetParam<string>(\"train_file\");\n mat trainingData;\n data::Load(trainingDataFilename, trainingData, true);\n\n const string labelsFilename = CLI::GetParam<string>(\"labels_file\");\n \/\/ Load labels.\n mat labelsIn;\n\n \/\/ Did the user pass in labels?\n if (CLI::HasParam(\"labels_file\"))\n {\n \/\/ Load labels.\n const string labelsFilename = CLI::GetParam<string>(\"labels_file\");\n data::Load(labelsFilename, labelsIn, true);\n }\n else\n {\n \/\/ Use the last row of the training data as the labels.\n Log::Info << \"Using the last dimension of training set as labels.\" << endl;\n labelsIn = trainingData.row(trainingData.n_rows - 1).t();\n trainingData.shed_row(trainingData.n_rows - 1);\n }\n\n \/\/ Do the labels need to be transposed?\n if (labelsIn.n_rows == 1)\n {\n labelsIn = labelsIn.t();\n }\n\n \/\/ Normalize the labels.\n Col<size_t> labels;\n vec mappings;\n data::NormalizeLabels(labelsIn.unsafe_col(0), labels, mappings);\n\n \/\/ Load test dataset.\n const string testingDataFilename = CLI::GetParam<string>(\"test_file\");\n mat testingData;\n data::Load(testingDataFilename, testingData, true);\n if (testingData.n_rows != trainingData.n_rows)\n {\n Log::Fatal << \"Test data dimensionality (\" << testingData.n_rows << \") \"\n << \"must be the same as training data (\" << trainingData.n_rows - 1\n << \")!\" << std::endl;\n }\n\n int iterations = CLI::GetParam<int>(\"iterations\");\n\n \/\/ Create and train the classifier.\n Timer::Start(\"Training\");\n Perceptron<> p(trainingData, labels.t(), max(labels) + 1, iterations);\n Timer::Stop(\"Training\");\n\n \/\/ Time the running of the Perceptron Classifier.\n Row<size_t> predictedLabels(testingData.n_cols);\n Timer::Start(\"Testing\");\n p.Classify(testingData, predictedLabels);\n Timer::Stop(\"Testing\");\n\n \/\/ Un-normalize labels to prepare output.\n vec results;\n data::RevertLabels(predictedLabels.t(), mappings, results);\n\n \/\/ saving the predictedLabels in the transposed manner in output\n const string outputFilename = CLI::GetParam<string>(\"output\");\n data::Save(outputFilename, results, true, false);\n}\n<commit_msg>Refactor perceptron program to load\/save models.<commit_after>\/*\n * @file: perceptron_main.cpp\n * @author: Udit Saxena\n *\n * This program runs the Simple Perceptron Classifier.\n *\n * Perceptrons are simple single-layer binary classifiers, which solve linearly\n * separable problems with a linear decision boundary.\n *\/\n\n#include <mlpack\/core.hpp>\n#include \"perceptron.hpp\"\n\nusing namespace mlpack;\nusing namespace mlpack::perceptron;\nusing namespace std;\nusing namespace arma;\n\nPROGRAM_INFO(\"Perceptron\",\n \"This program implements a perceptron, which is a single level neural \"\n \"network. The perceptron makes its predictions based on a linear predictor \"\n \"function combining a set of weights with the feature vector. The \"\n \"perceptron learning rule is able to converge, given enough iterations \"\n \"using the --max_iterations (-i) parameter, if the data supplied is \"\n \"linearly separable. The perceptron is parameterized by a matrix of weight\"\n \" vectors that denote the numerical weights of the neural network.\"\n \"\\n\\n\"\n \"This program allows loading a perceptron from a model (-i) or training a \"\n \"perceptron given training data (-t), or both those things at once. In \"\n \"addition, this program allows classification on a test dataset (-T) and \"\n \"will save the classification results to the given output file (-o). The \"\n \"perceptron model itself may be saved with a file specified using the -m \"\n \"option.\"\n \"\\n\\n\"\n \"The training data given with the -t option should have class labels as its\"\n \" last dimension (so, if the training data is in CSV format, labels should \"\n \"be the last column). Alternately, the -l (--labels_file) option may be \"\n \"used to specify a separate file of labels.\"\n \"\\n\\n\"\n \"All these options make it easy to train a perceptron, and then re-use that\"\n \" perceptron for later classification. The invocation below trains a \"\n \"perceptron on 'training_data.csv' (and 'training_labels.csv)' and saves \"\n \"the model to 'perceptron.xml'.\"\n \"\\n\\n\"\n \"$ perceptron -t training_data.csv -l training_labels.csv -m perceptron.csv\"\n \"\\n\\n\"\n \"Then, this model can be re-used for classification on 'test_data.csv'. \"\n \"The example below does precisely that, saving the predicted classes to \"\n \"'predictions.csv'.\"\n \"\\n\\n\"\n \"$ perceptron -i perceptron.xml -T test_data.csv -o predictions.csv\"\n \"\\n\\n\"\n \"Note that all of the options may be specified at once: predictions may be \"\n \"calculated right after training a model, and model training can occur even\"\n \" if an existing perceptron model is passed with -i (--input_model). \"\n \"However, note that the number of classes and the dimensionality of all \"\n \"data must match. So you cannot pass a perceptron model trained on 2 \"\n \"classes and then re-train with a 4-class dataset. Similarly, attempting \"\n \"classification on a 3-dimensional dataset with a perceptron that has been \"\n \"trained on 8 dimensions will cause an error.\"\n );\n\n\/\/ Training parameters.\nPARAM_STRING(\"training_file\", \"A file containing the training set.\", \"t\", \"\");\nPARAM_STRING(\"labels_file\", \"A file containing labels for the training set.\",\n \"l\", \"\");\nPARAM_INT(\"max_iterations\",\"The maximum number of iterations the perceptron is \"\n \"to be run\", \"M\", 1000);\n\n\/\/ Model loading\/saving.\nPARAM_STRING(\"input_model\", \"File containing input perceptron model.\", \"i\", \"\");\nPARAM_STRING(\"output_model\", \"File to save trained perceptron model to.\", \"m\",\n \"\");\n\n\/\/ Testing\/classification parameters.\nPARAM_STRING(\"test_file\", \"A file containing the test set.\", \"T\", \"\");\nPARAM_STRING(\"output_file\", \"The file in which the predicted labels for the \"\n \"test set will be written.\", \"o\", \"output.csv\");\n\n\/\/ When we save a model, we must also save the class mappings. So we use this\n\/\/ auxiliary structure to store both the perceptron and the mapping, and we'll\n\/\/ save this.\nclass PerceptronModel\n{\n private:\n Perceptron<>& p;\n arma::vec& map;\n\n public:\n PerceptronModel(Perceptron<>& p, arma::vec& map) : p(p), map(map) { }\n\n template<typename Archive>\n void Serialize(Archive& ar, const unsigned int \/* version *\/)\n {\n ar & data::CreateNVP(p, \"perceptron\");\n ar & data::CreateNVP(map, \"mappings\");\n }\n};\n\nint main(int argc, char** argv)\n{\n CLI::ParseCommandLine(argc, argv);\n\n \/\/ First, get all parameters and validate them.\n const string trainingDataFile = CLI::GetParam<string>(\"training_file\");\n const string labelsFile = CLI::GetParam<string>(\"labels_file\");\n const string inputModelFile = CLI::GetParam<string>(\"input_model\");\n const string testDataFile = CLI::GetParam<string>(\"test_file\");\n const string outputModelFile = CLI::GetParam<string>(\"output_model\");\n const string outputFile = CLI::GetParam<string>(\"output_file\");\n const size_t maxIterations = (size_t) CLI::GetParam<int>(\"max_iterations\");\n\n \/\/ We must either load a model or train a model.\n if (inputModelFile == \"\" && trainingDataFile == \"\")\n Log::Fatal << \"Either an input model must be specified with --input_model \"\n << \"or training data must be given (--training_file)!\" << endl;\n\n \/\/ If the user isn't going to save the output model or any predictions, we\n \/\/ should issue a warning.\n if (outputModelFile == \"\" && testDataFile == \"\")\n Log::Warn << \"Output will not be saved! (Neither --test_file nor \"\n << \"--output_model are specified.)\" << endl;\n\n \/\/ Now, load our model, if there is one.\n Perceptron<>* p = NULL;\n arma::vec mappings;\n if (inputModelFile != \"\")\n {\n Log::Info << \"Loading saved perceptron from model file '\" << inputModelFile\n << \"'.\" << endl;\n\n \/\/ The parameters here are invalid, but we are about to load the model\n \/\/ anyway...\n p = new Perceptron<>(0, 0);\n PerceptronModel pm(*p, mappings); \/\/ Also load class mappings.\n data::Load(inputModelFile, \"perceptron_model\", pm, true);\n }\n\n \/\/ Next, load the training data and labels (if they have been given).\n if (trainingDataFile != \"\")\n {\n Log::Info << \"Training perceptron on dataset '\" << trainingDataFile;\n if (labelsFile != \"\")\n Log::Info << \"' with labels in '\" << labelsFile << \"'\";\n else\n Log::Info << \"'\";\n Log::Info << \" for a maximum of \" << maxIterations << \" iterations.\"\n << endl;\n\n mat trainingData;\n data::Load(trainingDataFile, trainingData, true);\n\n \/\/ Load labels.\n mat labelsIn;\n\n \/\/ Did the user pass in labels?\n if (CLI::HasParam(\"labels_file\"))\n {\n \/\/ Load labels.\n const string labelsFile = CLI::GetParam<string>(\"labels_file\");\n data::Load(labelsFile, labelsIn, true);\n }\n else\n {\n \/\/ Use the last row of the training data as the labels.\n Log::Info << \"Using the last dimension of training set as labels.\"\n << endl;\n labelsIn = trainingData.row(trainingData.n_rows - 1).t();\n trainingData.shed_row(trainingData.n_rows - 1);\n }\n\n \/\/ Do the labels need to be transposed?\n if (labelsIn.n_rows == 1)\n labelsIn = labelsIn.t();\n\n \/\/ Normalize the labels.\n Col<size_t> labels;\n data::NormalizeLabels(labelsIn.unsafe_col(0), labels, mappings);\n\n \/\/ Now, if we haven't already created a perceptron, do it. Otherwise, make\n \/\/ sure the dimensions are right, then continue training.\n if (p == NULL)\n {\n \/\/ Create and train the classifier.\n Timer::Start(\"training\");\n p = new Perceptron<>(trainingData, labels.t(), max(labels) + 1,\n maxIterations);\n Timer::Stop(\"training\");\n }\n else\n {\n \/\/ Check dimensionality.\n if (p->Weights().n_rows != trainingData.n_rows)\n {\n Log::Fatal << \"Perceptron from '\" << inputModelFile << \"' is built on \"\n << \"data with \" << p->Weights().n_rows << \" dimensions, but data in\"\n << \" '\" << trainingDataFile << \"' has \" << trainingData.n_rows\n << \"dimensions!\" << endl;\n }\n\n \/\/ Check the number of labels.\n if (max(labels) + 1 > p->Weights().n_cols)\n {\n Log::Fatal << \"Perceptron from '\" << inputModelFile << \"' has \"\n << p->Weights().n_cols << \" classes, but the training data has \"\n << max(labels) + 1 << \" classes!\" << endl;\n }\n\n \/\/ Now train.\n Timer::Start(\"training\");\n p->MaxIterations() = maxIterations;\n p->Train(trainingData, labels.t());\n Timer::Stop(\"training\");\n }\n }\n\n \/\/ Now, the training procedure is complete. Do we have any test data?\n if (testDataFile != \"\")\n {\n Log::Info << \"Classifying dataset '\" << testDataFile << \"'.\" << endl;\n mat testData;\n data::Load(testDataFile, testData, true);\n\n if (testData.n_rows != p->Weights().n_rows)\n {\n Log::Fatal << \"Test data dimensionality (\" << testData.n_rows << \") must \"\n << \"be the same as the dimensionality of the perceptron (\"\n << p->Weights().n_rows << \")!\" << endl;\n }\n\n \/\/ Time the running of the perceptron classifier.\n Row<size_t> predictedLabels(testData.n_cols);\n Timer::Start(\"testing\");\n p->Classify(testData, predictedLabels);\n Timer::Stop(\"testing\");\n\n \/\/ Un-normalize labels to prepare output.\n vec results;\n data::RevertLabels(predictedLabels.t(), mappings, results);\n\n \/\/ Save the predictedLabels, but we have to transpose them.\n data::Save(outputFile, results, false \/* non-fatal *\/, false);\n }\n\n \/\/ Lastly, do we need to save the output model?\n if (outputModelFile != \"\")\n {\n PerceptronModel pm(*p, mappings);\n data::Save(outputModelFile, \"perceptron_model\", pm);\n }\n\n \/\/ Clean up memory.\n delete p;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Mickey R7RS Scheme\n *\n * Copyright (C) 2011-2012 Christian Stigen Larsen <csl@sublevel3.org>\n * http:\/\/csl.sublevel3.org _\n * \\\n * Distributed under the LGPL 2.1; see LICENSE \/\\\n * Please post bugfixes and suggestions to the author. \/ \\_\n *\n *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <ctype.h>\n#include \"exceptions.h\"\n#include \"print.h\"\n#include \"tokenizer.h\"\n#include \"util.h\"\n\nstatic const char* source = NULL;\nstatic bool inside_string = false;\nstatic bool fold_case_flag = false;\nstatic int line = 1;\n\nint current_line_number()\n{\n return line;\n}\n\nstatic inline void checkline(const char ch)\n{\n if ( ch == '\\n' )\n ++line;\n}\n\nbool fold_case()\n{\n return fold_case_flag;\n}\n\nvoid set_source(const char* program)\n{\n source = program;\n inside_string = false;\n line = 1;\n}\n\nstatic bool not_pipe(const char* s)\n{\n return *s!='\\0' && *s!='|';\n}\n\nstatic bool string_or_non_delimiter(const char* s)\n{\n char ch = *s;\n\n \/\/ ignore next datum symbol #; is a token\n if ( s[0]=='#' && s[1]==';' )\n return false;\n\n bool open_paren = (ch=='(' \/* normal paren *\/\n || (s[0]=='#' && s[1]=='(') \/* vector form #( ... ) *\/\n || (s[0]=='#' && s[1]=='u' && \/* bytevector form #u8( ... ) *\/\n s[2]=='8' && s[3]=='('));\n\n if ( ch == '\\\"' )\n inside_string = !inside_string;\n\n return ch!='\\0'\n && (inside_string? true :\n !open_paren && ch!=')' && !isspace(ch));\n}\n\nstatic const char* skip_space(const char* s)\n{\n while ( isspace(*s) ) {\n checkline(*s);\n ++s;\n }\n\n return s;\n}\n\nstatic const char* copy_while(\n char *dest, const char* src, bool (*while_expr)(const char*))\n{\n while ( while_expr(src) )\n *dest++ = *src++;\n\n *dest = '\\0';\n return src;\n}\n\nconst char* get_token()\n{\n \/\/ mutatable return buffer\n static char token[256];\n\n for ( ;; ) {\n token[0] = token[1] = '\\0';\n source = skip_space(source);\n\n \/\/ comment? skip to end of line\n if ( *source == ';' ) {\n while ( *source != '\\n' ) ++source;\n continue;\n }\n\n \/\/ hash-bang or similar? skip to end of line\n \/\/ TODO: Properly handle reader directives like case-folding, etc.\n if ( source[0]=='#' && source[1]=='!' ) {\n\n \/\/ skip to end of line\n const char *start = source;\n while ( *source != '\\n' ) ++source;\n\n if ( !strncmp(\"#!fold-case\", start, source - start) )\n fold_case_flag = true;\n else if ( !strncmp(\"#!no-fold-case\", start, source - start) )\n fold_case_flag = false;\n\n continue;\n }\n\n \/\/ block-comments?\n if ( source[0]=='#' && source[1]=='|' ) {\n \/\/ match nested pairs\n source += 2;\n for ( int n=1; n && *source; ++source ) {\n if ( source[0]=='#' && source[1]=='|' ) { ++source; ++n; }\n else if ( source[0]=='|' && source[1]=='#' ) { ++source; --n; }\n }\n continue;\n }\n\n \/\/ vector form \"#( ... )\"\n if ( source[0]=='#' && source[1]=='(' ) {\n strcpy(token, \"#(\");\n source += 2;\n return token;\n }\n\n \/\/ bytevector form \"#u8( ... )\"\n if ( source[0]=='#' && source[1]=='u' &&\n source[2]=='8' && source[3]=='(' )\n {\n strcpy(token, \"#u8(\");\n source += 4;\n return token;\n }\n\n \/\/ ignore-next-datum form \"#;\"\n if ( source[0]=='#' && source[1]==';' ) {\n strcpy(token, \"#;\");\n source += 2;\n return token;\n }\n\n if ( char_in(*source, \"()'\") )\n \/\/ tokens ( and )\n token[0] = *source++;\n else {\n \/\/ long-form-symbol w\/format \"|foo bar baz|\"\n if ( source[0]=='|' ) {\n const char* start = source;\n token[0]='|';\n source = copy_while(token+1, source+1, not_pipe);\n\n if ( *source =='|' )\n ++source;\n else\n raise(parser_exception(format(\n \"Invalid |long symbol| on line %d: %s\\n\", line, start)));\n\n const size_t l = strlen(token);\n token[l] = '|';\n token[l+1] = '\\0';\n } else\n \/\/ other tokens\n source = copy_while(token, source, string_or_non_delimiter);\n }\n\n \/\/ emit NULL when finished\n return !empty(token) ? token : NULL;\n }\n}\n<commit_msg>Bugfix: Check for end of input<commit_after>\/*\n * Mickey R7RS Scheme\n *\n * Copyright (C) 2011-2012 Christian Stigen Larsen <csl@sublevel3.org>\n * http:\/\/csl.sublevel3.org _\n * \\\n * Distributed under the LGPL 2.1; see LICENSE \/\\\n * Please post bugfixes and suggestions to the author. \/ \\_\n *\n *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <ctype.h>\n#include \"exceptions.h\"\n#include \"print.h\"\n#include \"tokenizer.h\"\n#include \"util.h\"\n\nstatic const char* source = NULL;\nstatic bool inside_string = false;\nstatic bool fold_case_flag = false;\nstatic int line = 1;\n\nint current_line_number()\n{\n return line;\n}\n\nstatic inline void checkline(const char ch)\n{\n if ( ch == '\\n' )\n ++line;\n}\n\nbool fold_case()\n{\n return fold_case_flag;\n}\n\nvoid set_source(const char* program)\n{\n source = program;\n inside_string = false;\n line = 1;\n}\n\nstatic bool not_pipe(const char* s)\n{\n return *s!='\\0' && *s!='|';\n}\n\nstatic bool string_or_non_delimiter(const char* s)\n{\n char ch = *s;\n\n \/\/ ignore next datum symbol #; is a token\n if ( s[0]=='#' && s[1]==';' )\n return false;\n\n bool open_paren = (ch=='(' \/* normal paren *\/\n || (s[0]=='#' && s[1]=='(') \/* vector form #( ... ) *\/\n || (s[0]=='#' && s[1]=='u' && \/* bytevector form #u8( ... ) *\/\n s[2]=='8' && s[3]=='('));\n\n if ( ch == '\\\"' )\n inside_string = !inside_string;\n\n return ch!='\\0'\n && (inside_string? true :\n !open_paren && ch!=')' && !isspace(ch));\n}\n\nstatic const char* skip_space(const char* s)\n{\n while ( isspace(*s) ) {\n checkline(*s);\n ++s;\n }\n\n return s;\n}\n\nstatic const char* copy_while(\n char *dest, const char* src, bool (*while_expr)(const char*))\n{\n while ( while_expr(src) )\n *dest++ = *src++;\n\n *dest = '\\0';\n return src;\n}\n\nconst char* get_token()\n{\n \/\/ mutatable return buffer\n static char token[256];\n\n for ( ;; ) {\n token[0] = token[1] = '\\0';\n source = skip_space(source);\n\n \/\/ comment? skip to end of line\n if ( *source == ';' ) {\n while ( *source != '\\n' ) {\n ++source;\n\n if ( *source == '\\0' )\n return NULL;\n }\n\n continue;\n }\n\n \/\/ hash-bang or similar? skip to end of line\n \/\/ TODO: Properly handle reader directives like case-folding, etc.\n if ( source[0]=='#' && source[1]=='!' ) {\n\n \/\/ skip to end of line\n const char *start = source;\n while ( *source != '\\n' ) ++source;\n\n if ( !strncmp(\"#!fold-case\", start, source - start) )\n fold_case_flag = true;\n else if ( !strncmp(\"#!no-fold-case\", start, source - start) )\n fold_case_flag = false;\n\n continue;\n }\n\n \/\/ block-comments?\n if ( source[0]=='#' && source[1]=='|' ) {\n \/\/ match nested pairs\n source += 2;\n for ( int n=1; n && *source; ++source ) {\n if ( source[0]=='#' && source[1]=='|' ) { ++source; ++n; }\n else if ( source[0]=='|' && source[1]=='#' ) { ++source; --n; }\n }\n continue;\n }\n\n \/\/ vector form \"#( ... )\"\n if ( source[0]=='#' && source[1]=='(' ) {\n strcpy(token, \"#(\");\n source += 2;\n return token;\n }\n\n \/\/ bytevector form \"#u8( ... )\"\n if ( source[0]=='#' && source[1]=='u' &&\n source[2]=='8' && source[3]=='(' )\n {\n strcpy(token, \"#u8(\");\n source += 4;\n return token;\n }\n\n \/\/ ignore-next-datum form \"#;\"\n if ( source[0]=='#' && source[1]==';' ) {\n strcpy(token, \"#;\");\n source += 2;\n return token;\n }\n\n if ( char_in(*source, \"()'\") )\n \/\/ tokens ( and )\n token[0] = *source++;\n else {\n \/\/ long-form-symbol w\/format \"|foo bar baz|\"\n if ( source[0]=='|' ) {\n const char* start = source;\n token[0]='|';\n source = copy_while(token+1, source+1, not_pipe);\n\n if ( *source =='|' )\n ++source;\n else\n raise(parser_exception(format(\n \"Invalid |long symbol| on line %d: %s\\n\", line, start)));\n\n const size_t l = strlen(token);\n token[l] = '|';\n token[l+1] = '\\0';\n } else\n \/\/ other tokens\n source = copy_while(token, source, string_or_non_delimiter);\n }\n\n \/\/ emit NULL when finished\n return !empty(token) ? token : NULL;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MR_TR_PARSER_C\n#define MR_TR_PARSER_C\n\n#include <stdexcept>\n#include <ctype.h>\n#include <iostream>\n\n#include <maproute\/tr_parser.hpp>\n#include <maproute\/stringhelp.hpp>\n#include <maproute\/input_walker.hpp>\n#include <maproute\/ip_convertor.hpp>\n\n\ntypedef enum TraceTokenKind {\n TRACE_TOKEN_SPACE, \/\/ whitespace token\n TRACE_TOKEN_NUMBER,\n TRACE_TOKEN_DOT, \/\/ the . in floating point numbers or IP addreses\n TRACE_TOKEN_MS, \/\/ ms keyword\n TRACE_TOKEN_STAR \/\/ '*' characther\n} TraceTokenKind;\n\ntypedef struct TraceToken {\n TraceTokenKind kind;\n std::string contents;\n} TraceToken;\n\ntypedef int (*iskind_cb)(int c);\n\nint take_while(std::string *line, int index, iskind_cb f) {\n\n char c;\n std::string input = *line;\n int len = input.length();\n\n while (index < len && (c = input[index])) {\n if (f(c)) {\n index++;\n } else {\n return index;\n }\n }\n return index;\n\n}\n\nbool expect(TraceToken*self, TraceToken *other) {\n if (self->kind == other->kind) {\n return true;\n } else {\n return false;\n }\n}\n\nbool tokenize(std::string *line, std::vector<TraceToken> *out) {\n std::string input = *line;\n int len = input.length();\n\n for (int i = 0; i < len; i++) {\n int si = i;\n char c = input[i];\n TraceToken token;\n\n if (isspace(c)) {\n i = take_while(line, i, isspace);\n token.kind = TRACE_TOKEN_SPACE;\n token.contents = string_get(line, si, i);\n i--;\n\n } else if (isdigit(c)) {\n i = take_while(line, i, isdigit);\n token.kind = TRACE_TOKEN_NUMBER;\n token.contents = string_get(line, si, i);\n i--;\n\n } else if (c == '.') {\n token.kind = TRACE_TOKEN_DOT;\n token.contents = \".\";\n\n } else if (c == '*') {\n token.kind = TRACE_TOKEN_STAR;\n token.contents = \"*\";\n\n } else if (c == 'm') {\n\n i++;\n c = input[i];\n\n if (c == 's') {\n token.kind = TRACE_TOKEN_MS;\n token.contents = \"ms\";\n } else {\n return false;\n }\n\n } else {\n return false;\n }\n\n out->push_back(token);\n\n }\n\n return true;\n}\n\nbool expect(InputWalker<TraceToken> *walker, TraceTokenKind kind) {\n TraceToken token = walker->advance();\n\n if (token.kind == kind) {\n return true;\n\n } else {\n walker->backtrack();\n std::cout << \"[WARNING] - Wrong token kind.\" << std::endl;\n\n return false;\n }\n\n}\n\nbool expect_ip(InputWalker<TraceToken> *inputs, IPV4 *out) {\n bool result;\n std::string ip_string;\n IPV4Convertor convertor;\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n\n convertor.string_to_ip(&ip_string, out);\n\n return result;\n\n}\n\nbool parse_gateway(std::vector<TraceToken> *tokens, IPV4 *out) {\n\n InputWalker<TraceToken> inputs {*tokens};\n bool result;\n\n \/\/ the hop number\n result = expect(&inputs, TRACE_TOKEN_SPACE);\n result = expect(&inputs, TRACE_TOKEN_NUMBER);\n result = expect(&inputs, TRACE_TOKEN_SPACE);\n\n \/\/ the ip address\n result = expect_ip(&inputs, out);\n result = expect(&inputs, TRACE_TOKEN_SPACE);\n\n return result;\n}\n\nbool TracerouteLineParser::parse(std::string *line, IPV4 *out) {\n\n std::vector<TraceToken> tokens;\n bool valid = tokenize(line, &tokens);\n\n if (valid) {\n return parse_gateway(&tokens, out);\n } else {\n return false;\n }\n}\n\n#endif\n<commit_msg>Removed the space tokens<commit_after>#ifndef MR_TR_PARSER_C\n#define MR_TR_PARSER_C\n\n#include <stdexcept>\n#include <ctype.h>\n#include <iostream>\n\n#include <maproute\/tr_parser.hpp>\n#include <maproute\/stringhelp.hpp>\n#include <maproute\/input_walker.hpp>\n#include <maproute\/ip_convertor.hpp>\n\n\ntypedef enum TraceTokenKind {\n TRACE_TOKEN_SPACE, \/\/ whitespace token\n TRACE_TOKEN_NUMBER,\n TRACE_TOKEN_DOT, \/\/ the . in floating point numbers or IP addreses\n TRACE_TOKEN_MS, \/\/ ms keyword\n TRACE_TOKEN_STAR \/\/ '*' characther\n} TraceTokenKind;\n\ntypedef struct TraceToken {\n TraceTokenKind kind;\n std::string contents;\n} TraceToken;\n\ntypedef int (*iskind_cb)(int c);\n\nint take_while(std::string *line, int index, iskind_cb f) {\n\n char c;\n std::string input = *line;\n int len = input.length();\n\n while (index < len && (c = input[index])) {\n if (f(c)) {\n index++;\n } else {\n return index;\n }\n }\n return index;\n\n}\n\nbool expect(TraceToken*self, TraceToken *other) {\n if (self->kind == other->kind) {\n return true;\n } else {\n return false;\n }\n}\n\nbool tokenize(std::string *line, std::vector<TraceToken> *out) {\n std::string input = *line;\n int len = input.length();\n\n for (int i = 0; i < len; i++) {\n int si = i;\n char c = input[i];\n TraceToken token;\n\n if (isspace(c)) {\n i = take_while(line, i, isspace);\n token.kind = TRACE_TOKEN_SPACE;\n token.contents = string_get(line, si, i);\n i--;\n\n } else if (isdigit(c)) {\n i = take_while(line, i, isdigit);\n token.kind = TRACE_TOKEN_NUMBER;\n token.contents = string_get(line, si, i);\n i--;\n\n } else if (c == '.') {\n token.kind = TRACE_TOKEN_DOT;\n token.contents = \".\";\n\n } else if (c == '*') {\n token.kind = TRACE_TOKEN_STAR;\n token.contents = \"*\";\n\n } else if (c == 'm') {\n i++;\n c = input[i];\n\n if (c == 's') {\n token.kind = TRACE_TOKEN_MS;\n token.contents = \"ms\";\n } else {\n return false;\n }\n\n } else {\n return false;\n }\n\n if (token.kind != TRACE_TOKEN_SPACE) {\n out->push_back(token);\n }\n\n }\n\n return true;\n}\n\nbool expect(InputWalker<TraceToken> *walker, TraceTokenKind kind) {\n TraceToken token = walker->advance();\n\n if (token.kind == kind) {\n return true;\n\n } else {\n walker->backtrack();\n std::cout << \"[WARNING] - Wrong token kind.\" << std::endl;\n\n return false;\n }\n\n}\n\nbool expect_ip(InputWalker<TraceToken> *inputs, IPV4 *out) {\n bool result;\n std::string ip_string;\n IPV4Convertor convertor;\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n result = expect(inputs, TRACE_TOKEN_DOT);\n ip_string.append(inputs->get_current().contents);\n\n result = expect(inputs, TRACE_TOKEN_NUMBER);\n ip_string.append(inputs->get_current().contents);\n\n convertor.string_to_ip(&ip_string, out);\n\n return result;\n\n}\n\nbool parse_gateway(std::vector<TraceToken> *tokens, IPV4 *out) {\n\n InputWalker<TraceToken> inputs {*tokens};\n bool result;\n\n \/\/ the hop number\n result = expect(&inputs, TRACE_TOKEN_NUMBER);\n \n \/\/ the ip address\n result = expect_ip(&inputs, out);\n\n return result;\n}\n\nbool TracerouteLineParser::parse(std::string *line, IPV4 *out) {\n\n std::vector<TraceToken> tokens;\n bool valid = tokenize(line, &tokens);\n\n if (valid) {\n return parse_gateway(&tokens, out);\n } else {\n return false;\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>reduce the scope a bit further<commit_after><|endoftext|>"} {"text":"<commit_before>#include <cctype>\n#include \"error.h\"\n#include \"lexer.h\"\n\nLexer::Token_stream Lexer::ts {cin};\n\nLexer::Token Lexer::Token_stream::get() {\n \/\/ read 1 char, decide what kind of token is incoming,\n \/\/ appropriately read more char then return Token\n char c = 0;\n\n do { \/\/ skip all whitespace except newline\n if(!ip->get(c)) return ct = {Kind::end}; \/\/ no char can be read from ip\n } while (c != '\\n' && isspace(c));\n\n switch (c) {\n case ';':\n case '\\n':\n return ct = {Kind::print};\n case '-':\n if (ct.kind != Kind::number && ct.kind != Kind::name) return ct = {Kind::mag_neg};\n case '*':\n case '\/':\n case '+':\n case '(':\n case ')':\n case '<':\n case '>':\n case '&':\n case '|':\n case '^':\n case '~':\n case '\\\\':\n case '=':\n return ct = {static_cast<Kind>(c)};\n case '0':\n if (isalnum(ip->peek())) \/\/ else use 0 as number\n return ct = {Kind::oct};\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9':\n ip->putback(c);\n if (ct.kind == Kind::hex) { int tmp; *ip >> hex >> tmp; ct.number_val = static_cast<rep_type>(tmp); }\n else if (ct.kind == Kind::oct) { int tmp; *ip >> oct >> tmp; ct.number_val = static_cast<rep_type>(tmp); }\n else *ip >> ct.number_val;\n ct.kind = Kind::number;\n return ct;\n case 'x':\n if (ct.kind == Kind::oct) \/\/ fall down to default otherwise\n return ct = {Kind::hex};\n default: \/\/ name, name =, or error\n if (isalpha(c)) {\n if (ct.kind == Kind::lit) { \/\/ character is a literal rather than a name\n ct.number_val = static_cast<int>(c);\n ct.kind = Kind::number;\n return ct;\n }\n ct.string_val = c;\n while (ip->get(c) && isalnum(c))\n ct.string_val += c; \/\/ append each letter of name\n ip->putback(c); \/\/ while loop reads 1 extra char\n ct.kind = Kind::name;\n return ct;\n }\n Error::error(\"bad token\");\n return ct = {Kind::print};\n }\n}\n\n<commit_msg>Added support for using .5 instead of 0.5 to specify decimal < 1<commit_after>#include <cctype>\n#include \"error.h\"\n#include \"lexer.h\"\n\nLexer::Token_stream Lexer::ts {cin};\n\nLexer::Token Lexer::Token_stream::get() {\n \/\/ read 1 char, decide what kind of token is incoming,\n \/\/ appropriately read more char then return Token\n char c = 0;\n\n do { \/\/ skip all whitespace except newline\n if(!ip->get(c)) return ct = {Kind::end}; \/\/ no char can be read from ip\n } while (c != '\\n' && isspace(c));\n\n switch (c) {\n case ';':\n case '\\n':\n return ct = {Kind::print};\n case '-':\n if (ct.kind != Kind::number && ct.kind != Kind::name) return ct = {Kind::mag_neg};\n case '*':\n case '\/':\n case '+':\n case '(':\n case ')':\n case '<':\n case '>':\n case '&':\n case '|':\n case '^':\n case '~':\n case '\\\\':\n case '=':\n return ct = {static_cast<Kind>(c)};\n case '0':\n if (isalnum(ip->peek())) \/\/ else use 0 as number\n return ct = {Kind::oct};\n case '1':\n case '2':\n case '3':\n case '4':\n case '5':\n case '6':\n case '7':\n case '8':\n case '9':\n case '.':\n ip->putback(c);\n if (ct.kind == Kind::hex) { int tmp; *ip >> hex >> tmp; ct.number_val = static_cast<rep_type>(tmp); }\n else if (ct.kind == Kind::oct) { int tmp; *ip >> oct >> tmp; ct.number_val = static_cast<rep_type>(tmp); }\n else *ip >> ct.number_val;\n ct.kind = Kind::number;\n return ct;\n case 'x':\n if (ct.kind == Kind::oct) \/\/ fall down to default otherwise\n return ct = {Kind::hex};\n default: \/\/ name, name =, or error\n if (isalpha(c)) {\n if (ct.kind == Kind::lit) { \/\/ character is a literal rather than a name\n ct.number_val = static_cast<int>(c);\n ct.kind = Kind::number;\n return ct;\n }\n ct.string_val = c;\n while (ip->get(c) && isalnum(c))\n ct.string_val += c; \/\/ append each letter of name\n ip->putback(c); \/\/ while loop reads 1 extra char\n ct.kind = Kind::name;\n return ct;\n }\n Error::error(\"bad token\");\n return ct = {Kind::print};\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>void runGlauberMC(Bool_t doPartProd=0,Int_t option=0,Int_t N=250000)\n{\n \/\/load libraries\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libPWGGlauber\");\n\n \/\/set the random seed from current time\n TTimeStamp time;\n Int_t seed = time.GetSec();\n gRandom->SetSeed(seed);\n\n Int_t nevents = N; \/\/ number of events to simulate \n \/\/ supported systems are e.g. \"p\", \"d\", \"Si\", \"Au\", \"Pb\", \"U\" \n Option_t *sysA=\"Pb\"; \n Option_t *sysB=\"Pb\";\n Double_t signn=64; \/\/ inelastic nucleon nucleon cross section\n \/\/const char *fname=\"GlauberMC_PbPb_ntuple.root\"; \/\/ name output file\n\n \/\/ run the code to produce an ntuple:\n \/\/ AliGlauberMC::runAndSaveNucleons(10000,\"Pb\",\"Pb\",72);\n Double_t mind=0.4;\n \/\/ AliGlauberMC::RunAndSaveNtuple(nevents,sysA,sysB,signn,mind);\n Double_t r=6.62;\n Double_t a=0.546;\n const char *fname=\"glau_pbpb_ntuple.root\";\n\n AliGlauberMC mcg(sysA,sysB,signn);\n mcg.SetMinDistance(mind);\n mcg.Setr(r);\n mcg.Seta(a);\n if (option==1) \n mcg.SetDoFluc(0.55,78.5*0.92,0.82,kTRUE);\n else if (option==2) \n mcg.SetDoFluc(1.01,72.5*0.92,0.74,kTRUE);\n mcg.SetDoPartProduction(doPartProd);\n \n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n mcg.SetdNdEtaType(AliGlauberMC::kNBDSV);\n mcg.GetdNdEtaParam()[0] = 2.49; \/\/npp\n mcg.GetdNdEtaParam()[1] = 1.7; \/\/ratioSgm2Mu\n mcg.GetdNdEtaParam()[2] = 0.13; \/\/xhard\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n mcg.Run(nevents);\n\n TNtuple *nt = mcg.GetNtuple();\n TFile out(fname,\"recreate\",fname,9);\n if(nt) nt->Write();\n printf(\"total cross section with a nucleon-nucleon cross section %.4f is %.4f\\n\\n\",signn,mcg.GetTotXSect());\n out.Close();\n}\n<commit_msg>setters for sigmaNN<commit_after>void runGlauberMC(Double_t sigNN=64, Bool_t doPartProd=0, Int_t option=0, Int_t N=250000)\n{\n \/\/load libraries\n gSystem->Load(\"libVMC\");\n gSystem->Load(\"libPhysics\");\n gSystem->Load(\"libTree\");\n gSystem->Load(\"libPWGGlauber\");\n\n \/\/set the random seed from current time\n TTimeStamp time;\n Int_t seed = time.GetSec();\n gRandom->SetSeed(seed);\n\n Int_t nevents = N; \/\/ number of events to simulate \n \/\/ supported systems are e.g. \"p\", \"d\", \"Si\", \"Au\", \"Pb\", \"U\" \n Option_t *sysA=\"Pb\"; \n Option_t *sysB=\"Pb\";\n Double_t mind=0.4;\n Double_t r=6.62;\n Double_t a=0.546;\n const char *fname=\"glau_pbpb_ntuple.root\";\n\n AliGlauberMC mcg(sysA,sysB,sigNN);\n mcg.SetMinDistance(mind);\n mcg.Setr(r);\n mcg.Seta(a);\n if (option==1) \n mcg.SetDoFluc(0.55,78.5*0.92,0.82,kTRUE);\n else if (option==2) \n mcg.SetDoFluc(1.01,72.5*0.92,0.74,kTRUE);\n\n mcg.SetDoPartProduction(doPartProd);\n mcg.SetdNdEtaType(AliGlauberMC::kNBDSV);\n mcg.GetdNdEtaParam()[0] = 2.49; \/\/npp\n mcg.GetdNdEtaParam()[1] = 1.7; \/\/ratioSgm2Mu\n mcg.GetdNdEtaParam()[2] = 0.13; \/\/xhard\n\n mcg.Run(nevents);\n\n TNtuple *nt = mcg.GetNtuple();\n TFile out(fname,\"recreate\",fname,9);\n if(nt) nt->Write();\n printf(\"total cross section with a nucleon-nucleon cross section %.4f is %.4f\\n\\n\",signn,mcg.GetTotXSect());\n out.Close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n \n Program: Visualization Toolkit\n Module: vtkOutputPort.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n \nCopyright (c) 1993-2000 Ken Martin, Will Schroeder, Bill Lorensen \nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * Neither name of Ken Martin, Will Schroeder, or Bill Lorensen nor the names\n of any contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n#include \"vtkOutputPort.h\"\n#include \"vtkInputPort.h\"\n#include \"vtkMultiProcessController.h\"\n#include \"vtkObjectFactory.h\"\n\n\n\n\/\/------------------------------------------------------------------------------\nvtkOutputPort* vtkOutputPort::New()\n{\n \/\/ First try to create the object from the vtkObjectFactory\n vtkObject* ret = vtkObjectFactory::CreateInstance(\"vtkOutputPort\");\n if(ret)\n {\n return (vtkOutputPort*)ret;\n }\n \/\/ If the factory was unable to create the object, then create it here.\n return new vtkOutputPort;\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkOutputPort::vtkOutputPort()\n{\n this->Tag = -1;\n \n \/\/ Controller keeps a reference to this object as well.\n this->Controller = \n vtkMultiProcessController::GetGlobalController();\n \n this->PipelineFlag = 0;\n this->ParameterMethod = NULL;\n this->ParameterMethodArgDelete = NULL;\n this->ParameterMethodArg = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ We need to have a \"GetNetReferenceCount\" to avoid memory leaks.\nvtkOutputPort::~vtkOutputPort()\n{\n this->Controller = NULL;\n\n if ((this->ParameterMethodArg)&&(this->ParameterMethodArgDelete))\n {\n (*this->ParameterMethodArgDelete)(this->ParameterMethodArg);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkProcessObject::PrintSelf(os,indent);\n os << indent << \"Tag: \" << this->Tag << endl;\n os << indent << \"Controller: (\" << this->Controller << \")\\n\";\n os << indent << \"Pipeline Flag: \" \n << (this->PipelineFlag ? \"On\\n\" : \"Off\\n\");\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Remote method call to UpdateInformation and send the information downstream.\n\/\/ This should be a friend.\nvoid vtkOutputPortUpdateInformationCallBack(void *arg, void *remoteArgs,\n\t\t \t int remoteArgsLength, int remoteProcessId)\n{\n vtkOutputPort *self = (vtkOutputPort*)arg;\n \n remoteArgs = remoteArgs;\n remoteArgsLength = remoteArgsLength;\n \/\/ Just call a method\n self->TriggerUpdateInformation(remoteProcessId);\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::TriggerUpdateInformation(int remoteProcessId)\n{\n vtkDataObject *input = this->GetInput();\n \n \/\/ Handle no input gracefully.\n if ( input != NULL )\n {\n input->UpdateInformation();\n }\n \n \/\/ The MTime of the input should also be considered.\n \/\/ Important for pipeline parallelism.\n \/\/ Include it in the information for efficiency.\n unsigned long t1, t2;\n t1 = input->GetMTime();\n t2 = input->GetPipelineMTime();\n if (t1 > t2)\n {\n input->SetPipelineMTime(t1);\n }\n \n \/\/ Now just send the information downstream.\n \/\/ PipelineMTime is part of information, so downstream\n \/\/ port will make the time comparison, and call Update if necessary.\n int wholeInformation[8];\n input->GetWholeExtent( wholeInformation );\n wholeInformation[6] = input->GetMaximumNumberOfPieces();\n \n this->Controller->Send( wholeInformation, 7,\n remoteProcessId, VTK_PORT_INFORMATION_TRANSFER_TAG);\n \n unsigned long mtime = input->GetPipelineMTime();\n \n this->Controller->Send( &mtime, 1,\n remoteProcessId, VTK_PORT_INFORMATION_TRANSFER_TAG );\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Remote method call to Update and send data downstream.\n\/\/ This should be a friend.\nvoid vtkOutputPortUpdateCallBack(void *arg, void *remoteArgs, \n\t\t\t\t int remoteArgsLength, int remoteProcessId) \n{\n vtkOutputPort *self = (vtkOutputPort*)arg;\n \n remoteArgs = remoteArgs;\n remoteArgsLength = remoteArgsLength; \n \/\/ Just call a method\n self->TriggerUpdate(remoteProcessId);\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::TriggerUpdate(int remoteProcessId)\n{\n unsigned long downDataTime;\n vtkDataObject *input = this->GetInput();\n \n \/\/ First get the update extent requested.\n int extent[8];\n this->Controller->Receive( extent, 8, remoteProcessId, \n\t\t\t VTK_PORT_UPDATE_EXTENT_TAG);\n input->SetUpdateExtent( extent );\n input->SetUpdatePiece( extent[6] );\n input->SetUpdateNumberOfPieces( extent[7] );\n \n \n \/\/ Note: Receiving DataTime was the start of a more intelligent promotion\n \/\/ for pipeline parallism. Unfortunately there was no way (I knew of)\n \/\/ for us to not promote on the first Update. I backed off, and am \n \/\/ requiring either 1: Filters handle Update Not returning correct data,\n \/\/ or 2: Pipeline parallelism must be primed with Updates on the Output\n \/\/ ports (giving correct data). This Receive can be removed.\n \n \/\/ This is for pipeline parallism.\n \/\/ This Output port may or may not promote our data (execute).\n \/\/ We need the data time of the last transfer to compare to the mtime\n \/\/ of our input to determine if it should send the data (execute).\n this->Controller->Receive( &(downDataTime), 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n \n \/\/ Postpone the update if we want pipeline parallism.\n \/\/ Handle no input gracefully. (Not true: Later we will send a NULL input.)\n if ( input != NULL && input->GetDataReleased())\n {\n input->UpdateInformation();\n input->PropagateUpdateExtent();\n input->TriggerAsynchronousUpdate();\n input->UpdateData();\n }\n\n \/\/ Did the input change?\n \/\/ If it did then we should execute (i.e. we should send the data).\n \/\/ Note: We may need some logic to catch the case where the down port\n \/\/ has released its data.\n \/\/if (downDataTime < input->GetMTime())\n if (input->GetDataReleased() == 0)\n {\n if ( this->StartMethod )\n {\n (*this->StartMethod)(this->StartMethodArg);\n }\n \/\/ First transfer the new data.\n this->Controller->Send( input, remoteProcessId,\n\t\t\t VTK_PORT_DATA_TRANSFER_TAG);\n if ( this->EndMethod )\n {\n (*this->EndMethod)(this->EndMethodArg);\n }\n \n \/\/ Since this time has to be local to downstream process\n \/\/ and we have no data, we have to create a time here.\n \/\/ (The output data usually does this.) \n this->UpdateTime.Modified();\n \n \/\/ Since this OutputPort can have multiple InputPorts\n \/\/ and the InputPort makes the update-descision time comparison,\n \/\/ the InputPort has to store this time.\n downDataTime = this->UpdateTime.GetMTime();\n this->Controller->Send( &downDataTime, 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n }\n else\n { \/\/ Nothing to send. We have to signal somehow.\n vtkDebugMacro(\"Promoting NULL (\" << input << \") to process \" \n\t\t << remoteProcessId);\n this->Controller->Send( (vtkDataObject*)(NULL), remoteProcessId,\n\t\t\t VTK_PORT_DATA_TRANSFER_TAG);\n \n \/\/ Go through the motions of sending the data time,\n \/\/ but just send the same data time back. (nothing changed).\n this->Controller->Send( &downDataTime, 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n }\n \n \/\/ Postpone the update if we want pipeline parallism.\n \/\/ Handle no input gracefully. (Not true: Later we will send a NULL input.)\n if (this->PipelineFlag)\n {\n \/\/ change any parameters if the user wants to.\n if ( this->ParameterMethod )\n {\n (*this->ParameterMethod)(this->ParameterMethodArg);\n input->UpdateInformation();\n }\n \n \/\/ Update to anticipate the next request.\n if ( input != NULL )\n {\n input->UpdateInformation();\n input->PropagateUpdateExtent();\n input->TriggerAsynchronousUpdate();\n input->UpdateData();\n }\n }\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetInput(vtkDataObject *input)\n{\n this->vtkProcessObject::SetNthInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject *vtkOutputPort::GetInput()\n{\n if (this->Inputs == NULL)\n {\n return NULL;\n }\n return this->Inputs[0];\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ We need to create two RMIs when the tag is set.\n\/\/ This means we must generate two tags form this ports tag.\n\/\/ The ports tag should be even. \n\/\/ (I do not like this, but is there another solution?)\nvoid vtkOutputPort::SetTag(int tag)\n{\n if (this->Tag == tag)\n {\n return;\n }\n \n this->Modified();\n \n \/\/ remove old RMI.\n if (this->Tag != -1)\n {\n\/\/ this->Controller->RemoveRMI(vtkOutputPortUpdateInformationCallBack, \n\/\/ (void *)this, this->Tag);\n\/\/ this->Controller->RemoveRMI(vtkOutputPortUpdateCallBack, \n\/\/ (void *)this, this->Tag + 1);\n }\n \n this->Tag = tag;\n this->Controller->AddRMI(vtkOutputPortUpdateInformationCallBack, \n\t\t\t (void *)this, tag);\n this->Controller->AddRMI(vtkOutputPortUpdateCallBack, \n (void *)this, tag+1);\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetParameterMethod(void (*f)(void *), void *arg)\n{\n if ( f != this->ParameterMethod || arg != this->ParameterMethodArg )\n {\n \/\/ delete the current arg if there is one and a delete meth\n if ((this->ParameterMethodArg)&&(this->ParameterMethodArgDelete))\n {\n (*this->ParameterMethodArgDelete)(this->ParameterMethodArg);\n }\n this->ParameterMethod = f;\n this->ParameterMethodArg = arg;\n this->Modified();\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetParameterMethodArgDelete(void (*f)(void *))\n{\n if ( f != this->ParameterMethodArgDelete)\n {\n this->ParameterMethodArgDelete = f;\n this->Modified();\n }\n}\n<commit_msg>change comment<commit_after>\/*=========================================================================\n \n Program: Visualization Toolkit\n Module: vtkOutputPort.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n \nCopyright (c) 1993-2000 Ken Martin, Will Schroeder, Bill Lorensen \nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n * Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n\n * Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n\n * Neither name of Ken Martin, Will Schroeder, or Bill Lorensen nor the names\n of any contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\n * Modified source versions must be plainly marked as such, and must not be\n misrepresented as being the original software.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR\nANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n=========================================================================*\/\n#include \"vtkOutputPort.h\"\n#include \"vtkInputPort.h\"\n#include \"vtkMultiProcessController.h\"\n#include \"vtkObjectFactory.h\"\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkOutputPort* vtkOutputPort::New()\n{\n \/\/ First try to create the object from the vtkObjectFactory\n vtkObject* ret = vtkObjectFactory::CreateInstance(\"vtkOutputPort\");\n if(ret)\n {\n return (vtkOutputPort*)ret;\n }\n \/\/ If the factory was unable to create the object, then create it here.\n return new vtkOutputPort;\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvtkOutputPort::vtkOutputPort()\n{\n this->Tag = -1;\n \n \/\/ Controller keeps a reference to this object as well.\n this->Controller = \n vtkMultiProcessController::GetGlobalController();\n \n this->PipelineFlag = 0;\n this->ParameterMethod = NULL;\n this->ParameterMethodArgDelete = NULL;\n this->ParameterMethodArg = NULL;\n}\n\n\/\/----------------------------------------------------------------------------\n\/\/ We need to have a \"GetNetReferenceCount\" to avoid memory leaks.\nvtkOutputPort::~vtkOutputPort()\n{\n this->Controller = NULL;\n\n if ((this->ParameterMethodArg)&&(this->ParameterMethodArgDelete))\n {\n (*this->ParameterMethodArgDelete)(this->ParameterMethodArg);\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::PrintSelf(ostream& os, vtkIndent indent)\n{\n vtkProcessObject::PrintSelf(os,indent);\n os << indent << \"Tag: \" << this->Tag << endl;\n os << indent << \"Controller: (\" << this->Controller << \")\\n\";\n os << indent << \"Pipeline Flag: \" \n << (this->PipelineFlag ? \"On\\n\" : \"Off\\n\");\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Remote method call to UpdateInformation and send the information downstream.\n\/\/ This should be a friend.\nvoid vtkOutputPortUpdateInformationCallBack(void *arg, void *remoteArgs,\n\t\t \t int remoteArgsLength, int remoteProcessId)\n{\n vtkOutputPort *self = (vtkOutputPort*)arg;\n \n remoteArgs = remoteArgs;\n remoteArgsLength = remoteArgsLength;\n \/\/ Just call a method\n self->TriggerUpdateInformation(remoteProcessId);\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::TriggerUpdateInformation(int remoteProcessId)\n{\n vtkDataObject *input = this->GetInput();\n \n \/\/ Handle no input gracefully.\n if ( input != NULL )\n {\n input->UpdateInformation();\n }\n \n \/\/ The MTime of the input should also be considered.\n \/\/ Important for pipeline parallelism.\n \/\/ Include it in the information for efficiency.\n unsigned long t1, t2;\n t1 = input->GetMTime();\n t2 = input->GetPipelineMTime();\n if (t1 > t2)\n {\n input->SetPipelineMTime(t1);\n }\n \n \/\/ Now just send the information downstream.\n \/\/ PipelineMTime is part of information, so downstream\n \/\/ port will make the time comparison, and call Update if necessary.\n int wholeInformation[8];\n input->GetWholeExtent( wholeInformation );\n wholeInformation[6] = input->GetMaximumNumberOfPieces();\n \n this->Controller->Send( wholeInformation, 7,\n remoteProcessId, VTK_PORT_INFORMATION_TRANSFER_TAG);\n \n unsigned long mtime = input->GetPipelineMTime();\n \n this->Controller->Send( &mtime, 1,\n remoteProcessId, VTK_PORT_INFORMATION_TRANSFER_TAG );\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Remote method call to Update and send data downstream.\n\/\/ This should be a friend.\nvoid vtkOutputPortUpdateCallBack(void *arg, void *remoteArgs, \n\t\t\t\t int remoteArgsLength, int remoteProcessId) \n{\n vtkOutputPort *self = (vtkOutputPort*)arg;\n \n remoteArgs = remoteArgs;\n remoteArgsLength = remoteArgsLength; \n \/\/ Just call a method\n self->TriggerUpdate(remoteProcessId);\n}\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::TriggerUpdate(int remoteProcessId)\n{\n unsigned long downDataTime;\n vtkDataObject *input = this->GetInput();\n \n \/\/ First get the update extent requested.\n int extent[8];\n this->Controller->Receive( extent, 8, remoteProcessId, \n\t\t\t VTK_PORT_UPDATE_EXTENT_TAG);\n input->SetUpdateExtent( extent );\n input->SetUpdatePiece( extent[6] );\n input->SetUpdateNumberOfPieces( extent[7] );\n \n \n \/\/ Note: Receiving DataTime was the start of a more intelligent promotion\n \/\/ for pipeline parallism. Unfortunately there was no way (I knew of)\n \/\/ for us to not promote on the first Update. I backed off, and am \n \/\/ requiring either 1: Filters handle Update Not returning correct data,\n \/\/ or 2: Pipeline parallelism must be primed with Updates on the Output\n \/\/ ports (giving correct data). This Receive can be removed.\n \n \/\/ This is for pipeline parallism.\n \/\/ This Output port may or may not promote our data (execute).\n \/\/ We need the data time of the last transfer to compare to the mtime\n \/\/ of our input to determine if it should send the data (execute).\n this->Controller->Receive( &(downDataTime), 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n \n \/\/ Postpone the update if we want pipeline parallism.\n \/\/ Handle no input gracefully. (Not true: Later we will send a NULL input.)\n if ( input != NULL && input->GetDataReleased())\n {\n input->UpdateInformation();\n input->PropagateUpdateExtent();\n input->TriggerAsynchronousUpdate();\n input->UpdateData();\n }\n\n \/\/ Did the input change?\n \/\/ If it did then we should execute (i.e. we should send the data).\n \/\/ Note: We may need some logic to catch the case where the down port\n \/\/ has released its data.\n \/\/if (downDataTime < input->GetMTime())\n if (input->GetDataReleased() == 0)\n {\n if ( this->StartMethod )\n {\n (*this->StartMethod)(this->StartMethodArg);\n }\n \/\/ First transfer the new data.\n this->Controller->Send( input, remoteProcessId,\n\t\t\t VTK_PORT_DATA_TRANSFER_TAG);\n if ( this->EndMethod )\n {\n (*this->EndMethod)(this->EndMethodArg);\n }\n \n \/\/ Since this time has to be local to downstream process\n \/\/ and we have no data, we have to create a time here.\n \/\/ (The output data usually does this.) \n this->UpdateTime.Modified();\n \n \/\/ Since this OutputPort can have multiple InputPorts\n \/\/ and the InputPort makes the update-descision time comparison,\n \/\/ the InputPort has to store this time.\n downDataTime = this->UpdateTime.GetMTime();\n this->Controller->Send( &downDataTime, 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n }\n else\n { \/\/ Nothing to send. We have to signal somehow.\n vtkDebugMacro(\"Promoting NULL (\" << input << \") to process \" \n\t\t << remoteProcessId);\n this->Controller->Send( (vtkDataObject*)(NULL), remoteProcessId,\n\t\t\t VTK_PORT_DATA_TRANSFER_TAG);\n \n \/\/ Go through the motions of sending the data time,\n \/\/ but just send the same data time back. (nothing changed).\n this->Controller->Send( &downDataTime, 1, remoteProcessId,\n\t\t\t VTK_PORT_NEW_DATA_TIME_TAG);\n }\n \n \/\/ Postpone the update if we want pipeline parallism.\n \/\/ Handle no input gracefully. (Not true: Later we will send a NULL input.)\n if (this->PipelineFlag)\n {\n \/\/ change any parameters if the user wants to.\n if ( this->ParameterMethod )\n {\n (*this->ParameterMethod)(this->ParameterMethodArg);\n input->UpdateInformation();\n }\n \n \/\/ Update to anticipate the next request.\n if ( input != NULL )\n {\n input->UpdateInformation();\n input->PropagateUpdateExtent();\n input->TriggerAsynchronousUpdate();\n input->UpdateData();\n }\n }\n}\n\n\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetInput(vtkDataObject *input)\n{\n this->vtkProcessObject::SetNthInput(0, input);\n}\n\n\/\/----------------------------------------------------------------------------\nvtkDataObject *vtkOutputPort::GetInput()\n{\n if (this->Inputs == NULL)\n {\n return NULL;\n }\n return this->Inputs[0];\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ We need to create two RMIs when the tag is set.\n\/\/ This means we must generate two tags form this ports tag.\n\/\/ The ports tag should be even. \n\/\/ (I do not like this, but is there another solution?)\nvoid vtkOutputPort::SetTag(int tag)\n{\n if (this->Tag == tag)\n {\n return;\n }\n \n this->Modified();\n \n \/\/ remove old RMI.\n if (this->Tag != -1)\n {\n\/\/ this->Controller->RemoveRMI(vtkOutputPortUpdateInformationCallBack, \n\/\/ (void *)this, this->Tag);\n\/\/ this->Controller->RemoveRMI(vtkOutputPortUpdateCallBack, \n\/\/ (void *)this, this->Tag + 1);\n }\n \n this->Tag = tag;\n this->Controller->AddRMI(vtkOutputPortUpdateInformationCallBack, \n\t\t\t (void *)this, tag);\n this->Controller->AddRMI(vtkOutputPortUpdateCallBack, \n (void *)this, tag+1);\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetParameterMethod(void (*f)(void *), void *arg)\n{\n if ( f != this->ParameterMethod || arg != this->ParameterMethodArg )\n {\n \/\/ delete the current arg if there is one and a delete meth\n if ((this->ParameterMethodArg)&&(this->ParameterMethodArgDelete))\n {\n (*this->ParameterMethodArgDelete)(this->ParameterMethodArg);\n }\n this->ParameterMethod = f;\n this->ParameterMethodArg = arg;\n this->Modified();\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\nvoid vtkOutputPort::SetParameterMethodArgDelete(void (*f)(void *))\n{\n if ( f != this->ParameterMethodArgDelete)\n {\n this->ParameterMethodArgDelete = f;\n this->Modified();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2010, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Willow Garage, Inc. nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*\n* $Id$\n*\n*\/\n\n#define MEASURE_FUNCTION_TIME\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/common\/angles.h>\n#include <pcl\/io\/openni2_grabber.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\n#include <boost\/chrono.hpp>\n\n#include \"pcl\/io\/openni2\/openni.h\"\n\ntypedef boost::chrono::high_resolution_clock HRClock;\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\n do \\\n{ \\\n static unsigned count = 0;\\\n static double last = pcl::getTime ();\\\n double now = pcl::getTime (); \\\n ++count; \\\n if (now - last >= 1.0) \\\n{ \\\n std::cout << \"Average framerate (\"<< _WHAT_ << \"): \" << double (count)\/double (now - last) << \" Hz\" << std::endl; \\\n count = 0; \\\n last = now; \\\n} \\\n}while (false)\n#else\n#define FPS_CALC (_WHAT_) \\\n do \\\n{ \\\n}while (false)\n#endif\n\nvoid\nprintHelp (int, char **argv)\n{\n using pcl::console::print_error;\n using pcl::console::print_info;\n\n print_error (\"Syntax is: %s [((<device_id> | <path-to-oni-file>) [-depthmode <mode>] [-imagemode <mode>] [-xyz] | -l [<device_id>]| -h | --help)]\\n\", argv [0]);\n print_info (\"%s -h | --help : shows this help\\n\", argv [0]);\n print_info (\"%s -xyz : use only XYZ values and ignore RGB components (this flag is required for use with ASUS Xtion Pro) \\n\", argv [0]);\n print_info (\"%s -l : list all available devices\\n\", argv [0]);\n print_info (\"%s -l <device-id> :list all available modes for specified device\\n\", argv [0]);\n print_info (\"\\t\\t<device_id> may be \\\"#1\\\", \\\"#2\\\", ... for the first, second etc device in the list\\n\");\n#ifndef _WIN32\n print_info (\"\\t\\t bus@address for the device connected to a specific usb-bus \/ address combination\\n\");\n print_info (\"\\t\\t <serial-number>\\n\");\n#endif\n print_info (\"\\n\\nexamples:\\n\");\n print_info (\"%s \\\"#1\\\"\\n\", argv [0]);\n print_info (\"\\t\\t uses the first device.\\n\");\n print_info (\"%s \\\".\/temp\/test.oni\\\"\\n\", argv [0]);\n print_info (\"\\t\\t uses the oni-player device to play back oni file given by path.\\n\");\n print_info (\"%s -l\\n\", argv [0]);\n print_info (\"\\t\\t list all available devices.\\n\");\n print_info (\"%s -l \\\"#2\\\"\\n\", argv [0]);\n print_info (\"\\t\\t list all available modes for the second device.\\n\");\n#ifndef _WIN32\n print_info (\"%s A00361800903049A\\n\", argv [0]);\n print_info (\"\\t\\t uses the device with the serial number \\'A00361800903049A\\'.\\n\");\n print_info (\"%s 1@16\\n\", argv [0]);\n print_info (\"\\t\\t uses the device on address 16 at USB bus 1.\\n\");\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointType>\nclass OpenNI2Viewer\n{\npublic:\n typedef pcl::PointCloud<PointType> Cloud;\n typedef typename Cloud::ConstPtr CloudConstPtr;\n\n OpenNI2Viewer (pcl::io::OpenNI2Grabber& grabber)\n : cloud_viewer_ (new pcl::visualization::PCLVisualizer (\"PCL OpenNI2 cloud\"))\n , image_viewer_ ()\n , grabber_ (grabber)\n , rgb_data_ (0), rgb_data_size_ (0)\n {\n }\n\n void\n cloud_callback (const CloudConstPtr& cloud)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n }\n\n void\n image_callback (const boost::shared_ptr<pcl::io::openni2::Image>& image)\n {\n FPS_CALC (\"image callback\");\n boost::mutex::scoped_lock lock (image_mutex_);\n image_ = image;\n\n if (image->getEncoding () != pcl::io::openni2::Image::RGB)\n {\n if (rgb_data_size_ < image->getWidth () * image->getHeight ())\n {\n if (rgb_data_)\n delete [] rgb_data_;\n rgb_data_size_ = image->getWidth () * image->getHeight ();\n rgb_data_ = new unsigned char [rgb_data_size_ * 3];\n }\n image_->fillRGB (image_->getWidth (), image_->getHeight (), rgb_data_);\n }\n }\n\n void\n keyboard_callback (const pcl::visualization::KeyboardEvent& event, void*)\n {\n if (event.getKeyCode ())\n cout << \"the key \\'\" << event.getKeyCode () << \"\\' (\" << event.getKeyCode () << \") was\";\n else\n cout << \"the special key \\'\" << event.getKeySym () << \"\\' was\";\n if (event.keyDown ())\n cout << \" pressed\" << endl;\n else\n cout << \" released\" << endl;\n }\n\n void\n mouse_callback (const pcl::visualization::MouseEvent& mouse_event, void*)\n {\n if (mouse_event.getType () == pcl::visualization::MouseEvent::MouseButtonPress && mouse_event.getButton () == pcl::visualization::MouseEvent::LeftButton)\n {\n cout << \"left button pressed @ \" << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n }\n }\n\n \/**\n * @brief starts the main loop\n *\/\n void\n run ()\n {\n cloud_viewer_->registerMouseCallback (&OpenNI2Viewer::mouse_callback, *this);\n cloud_viewer_->registerKeyboardCallback (&OpenNI2Viewer::keyboard_callback, *this);\n cloud_viewer_->setCameraFieldOfView (1.02259994f);\n boost::function<void (const CloudConstPtr&) > cloud_cb = boost::bind (&OpenNI2Viewer::cloud_callback, this, _1);\n boost::signals2::connection cloud_connection = grabber_.registerCallback (cloud_cb);\n\n boost::signals2::connection image_connection;\n if (grabber_.providesCallback<void (const boost::shared_ptr<pcl::io::openni2::Image>&)>())\n {\n image_viewer_.reset (new pcl::visualization::ImageViewer (\"PCL OpenNI image\"));\n image_viewer_->registerMouseCallback (&OpenNI2Viewer::mouse_callback, *this);\n image_viewer_->registerKeyboardCallback (&OpenNI2Viewer::keyboard_callback, *this);\n boost::function<void (const boost::shared_ptr<pcl::io::openni2::Image>&) > image_cb = boost::bind (&OpenNI2Viewer::image_callback, this, _1);\n image_connection = grabber_.registerCallback (image_cb);\n }\n\n bool image_init = false, cloud_init = false;\n\n grabber_.start ();\n\n while (!cloud_viewer_->wasStopped () && (image_viewer_ && !image_viewer_->wasStopped ()))\n {\n boost::shared_ptr<pcl::io::openni2::Image> image;\n CloudConstPtr cloud;\n\n cloud_viewer_->spinOnce ();\n\n \/\/ See if we can get a cloud\n if (cloud_mutex_.try_lock ())\n {\n cloud_.swap (cloud);\n cloud_mutex_.unlock ();\n }\n\n if (cloud)\n {\n FPS_CALC(\"drawing cloud\");\n\n if (!cloud_init)\n {\n cloud_viewer_->setPosition (0, 0);\n cloud_viewer_->setSize (cloud->width, cloud->height);\n cloud_init = !cloud_init;\n }\n\n if (!cloud_viewer_->updatePointCloud (cloud, \"OpenNICloud\"))\n {\n cloud_viewer_->addPointCloud (cloud, \"OpenNICloud\");\n cloud_viewer_->resetCameraViewpoint (\"OpenNICloud\");\n cloud_viewer_->setCameraPosition (\n 0,0,0,\t\t\/\/ Position\n 0,0,1,\t\t\/\/ Viewpoint\n 0,-1,0);\t\/\/ Up\n }\n }\n\n \/\/ See if we can get an image\n if (image_mutex_.try_lock ())\n {\n image_.swap (image);\n image_mutex_.unlock ();\n }\n\n\n if (image)\n {\n if (!image_init && cloud && cloud->width != 0)\n {\n image_viewer_->setPosition (cloud->width, 0);\n image_viewer_->setSize (cloud->width, cloud->height);\n image_init = !image_init;\n }\n\n if (image->getEncoding () == pcl::io::openni2::Image::RGB)\n image_viewer_->addRGBImage ( (const unsigned char*)image->getData (), image->getWidth (), image->getHeight ());\n else\n image_viewer_->addRGBImage (rgb_data_, image->getWidth (), image->getHeight ());\n image_viewer_->spinOnce ();\n\n }\n }\n\n grabber_.stop ();\n\n cloud_connection.disconnect ();\n image_connection.disconnect ();\n if (rgb_data_)\n delete[] rgb_data_;\n }\n\n boost::shared_ptr<pcl::visualization::PCLVisualizer> cloud_viewer_;\n boost::shared_ptr<pcl::visualization::ImageViewer> image_viewer_;\n\n pcl::io::OpenNI2Grabber& grabber_;\n boost::mutex cloud_mutex_;\n boost::mutex image_mutex_;\n\n CloudConstPtr cloud_;\n boost::shared_ptr<pcl::io::openni2::Image> image_;\n unsigned char* rgb_data_;\n unsigned rgb_data_size_;\n};\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> cld;\nboost::shared_ptr<pcl::visualization::ImageViewer> img;\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n std::string device_id (\"\");\n pcl::io::OpenNI2Grabber::Mode depth_mode = pcl::io::OpenNI2Grabber::OpenNI_Default_Mode;\n pcl::io::OpenNI2Grabber::Mode image_mode = pcl::io::OpenNI2Grabber::OpenNI_Default_Mode;\n bool xyz = false;\n\n if (argc >= 2)\n {\n device_id = argv[1];\n if (device_id == \"--help\" || device_id == \"-h\")\n {\n printHelp (argc, argv);\n return 0;\n }\n else if (device_id == \"-l\")\n {\n if (argc >= 3)\n {\n pcl::io::OpenNI2Grabber grabber (argv[2]);\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = grabber.getDevice ();\n cout << *device;\t\t\/\/ Prints out all sensor data, including supported video modes\n }\n else\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2DeviceManager> deviceManager = pcl::io::openni2::OpenNI2DeviceManager::getInstance ();\n if (deviceManager->getNumOfConnectedDevices () > 0)\n {\n for (unsigned deviceIdx = 0; deviceIdx < deviceManager->getNumOfConnectedDevices (); ++deviceIdx)\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = deviceManager->getDeviceByIndex (deviceIdx);\n cout << \"Device \" << device->getStringID () << \"connected.\" << endl;\n }\n\n }\n else\n cout << \"No devices connected.\" << endl;\n\n cout <<\"Virtual Devices available: ONI player\" << endl;\n }\n return 0;\n }\n }\n else\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2DeviceManager> deviceManager = pcl::io::openni2::OpenNI2DeviceManager::getInstance ();\n if (deviceManager->getNumOfConnectedDevices () > 0)\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = deviceManager->getAnyDevice ();\n cout << \"Device ID not set, using default device: \" << device->getStringID () << endl;\n }\n }\n\n unsigned mode;\n if (pcl::console::parse (argc, argv, \"-depthmode\", mode) != -1)\n depth_mode = pcl::io::OpenNI2Grabber::Mode (mode);\n\n if (pcl::console::parse (argc, argv, \"-imagemode\", mode) != -1)\n image_mode = pcl::io::OpenNI2Grabber::Mode (mode);\n\n if (pcl::console::find_argument (argc, argv, \"-xyz\") != -1)\n xyz = true;\n\n pcl::io::OpenNI2Grabber grabber (device_id, depth_mode, image_mode);\n\n if (xyz || !grabber.providesCallback<pcl::io::OpenNI2Grabber::sig_cb_openni_point_cloud_rgb> ())\n {\n OpenNI2Viewer<pcl::PointXYZ> openni_viewer (grabber);\n openni_viewer.run ();\n }\n else\n {\n OpenNI2Viewer<pcl::PointXYZRGBA> openni_viewer (grabber);\n openni_viewer.run ();\n }\n\n return (0);\n}\n\/* ]--- *\/\n<commit_msg>Add Catch I\/O Exception to OpenNI2 Viewer<commit_after>\/*\n* Software License Agreement (BSD License)\n*\n* Copyright (c) 2010, Willow Garage, Inc.\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following\n* disclaimer in the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Willow Garage, Inc. nor the names of its\n* contributors may be used to endorse or promote products derived\n* from this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n* POSSIBILITY OF SUCH DAMAGE.\n*\n* $Id$\n*\n*\/\n\n#define MEASURE_FUNCTION_TIME\n#include <pcl\/common\/time.h> \/\/fps calculations\n#include <pcl\/common\/angles.h>\n#include <pcl\/io\/openni2_grabber.h>\n#include <pcl\/visualization\/pcl_visualizer.h>\n#include <pcl\/visualization\/boost.h>\n#include <pcl\/visualization\/image_viewer.h>\n#include <pcl\/console\/print.h>\n#include <pcl\/console\/parse.h>\n#include <pcl\/console\/time.h>\n\n#include <boost\/chrono.hpp>\n\n#include \"pcl\/io\/openni2\/openni.h\"\n\ntypedef boost::chrono::high_resolution_clock HRClock;\n\n#define SHOW_FPS 1\n#if SHOW_FPS\n#define FPS_CALC(_WHAT_) \\\n do \\\n{ \\\n static unsigned count = 0;\\\n static double last = pcl::getTime ();\\\n double now = pcl::getTime (); \\\n ++count; \\\n if (now - last >= 1.0) \\\n{ \\\n std::cout << \"Average framerate (\"<< _WHAT_ << \"): \" << double (count)\/double (now - last) << \" Hz\" << std::endl; \\\n count = 0; \\\n last = now; \\\n} \\\n}while (false)\n#else\n#define FPS_CALC (_WHAT_) \\\n do \\\n{ \\\n}while (false)\n#endif\n\nvoid\nprintHelp (int, char **argv)\n{\n using pcl::console::print_error;\n using pcl::console::print_info;\n\n print_error (\"Syntax is: %s [((<device_id> | <path-to-oni-file>) [-depthmode <mode>] [-imagemode <mode>] [-xyz] | -l [<device_id>]| -h | --help)]\\n\", argv [0]);\n print_info (\"%s -h | --help : shows this help\\n\", argv [0]);\n print_info (\"%s -xyz : use only XYZ values and ignore RGB components (this flag is required for use with ASUS Xtion Pro) \\n\", argv [0]);\n print_info (\"%s -l : list all available devices\\n\", argv [0]);\n print_info (\"%s -l <device-id> :list all available modes for specified device\\n\", argv [0]);\n print_info (\"\\t\\t<device_id> may be \\\"#1\\\", \\\"#2\\\", ... for the first, second etc device in the list\\n\");\n#ifndef _WIN32\n print_info (\"\\t\\t bus@address for the device connected to a specific usb-bus \/ address combination\\n\");\n print_info (\"\\t\\t <serial-number>\\n\");\n#endif\n print_info (\"\\n\\nexamples:\\n\");\n print_info (\"%s \\\"#1\\\"\\n\", argv [0]);\n print_info (\"\\t\\t uses the first device.\\n\");\n print_info (\"%s \\\".\/temp\/test.oni\\\"\\n\", argv [0]);\n print_info (\"\\t\\t uses the oni-player device to play back oni file given by path.\\n\");\n print_info (\"%s -l\\n\", argv [0]);\n print_info (\"\\t\\t list all available devices.\\n\");\n print_info (\"%s -l \\\"#2\\\"\\n\", argv [0]);\n print_info (\"\\t\\t list all available modes for the second device.\\n\");\n#ifndef _WIN32\n print_info (\"%s A00361800903049A\\n\", argv [0]);\n print_info (\"\\t\\t uses the device with the serial number \\'A00361800903049A\\'.\\n\");\n print_info (\"%s 1@16\\n\", argv [0]);\n print_info (\"\\t\\t uses the device on address 16 at USB bus 1.\\n\");\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate <typename PointType>\nclass OpenNI2Viewer\n{\npublic:\n typedef pcl::PointCloud<PointType> Cloud;\n typedef typename Cloud::ConstPtr CloudConstPtr;\n\n OpenNI2Viewer (pcl::io::OpenNI2Grabber& grabber)\n : cloud_viewer_ (new pcl::visualization::PCLVisualizer (\"PCL OpenNI2 cloud\"))\n , image_viewer_ ()\n , grabber_ (grabber)\n , rgb_data_ (0), rgb_data_size_ (0)\n {\n }\n\n void\n cloud_callback (const CloudConstPtr& cloud)\n {\n FPS_CALC (\"cloud callback\");\n boost::mutex::scoped_lock lock (cloud_mutex_);\n cloud_ = cloud;\n }\n\n void\n image_callback (const boost::shared_ptr<pcl::io::openni2::Image>& image)\n {\n FPS_CALC (\"image callback\");\n boost::mutex::scoped_lock lock (image_mutex_);\n image_ = image;\n\n if (image->getEncoding () != pcl::io::openni2::Image::RGB)\n {\n if (rgb_data_size_ < image->getWidth () * image->getHeight ())\n {\n if (rgb_data_)\n delete [] rgb_data_;\n rgb_data_size_ = image->getWidth () * image->getHeight ();\n rgb_data_ = new unsigned char [rgb_data_size_ * 3];\n }\n image_->fillRGB (image_->getWidth (), image_->getHeight (), rgb_data_);\n }\n }\n\n void\n keyboard_callback (const pcl::visualization::KeyboardEvent& event, void*)\n {\n if (event.getKeyCode ())\n cout << \"the key \\'\" << event.getKeyCode () << \"\\' (\" << event.getKeyCode () << \") was\";\n else\n cout << \"the special key \\'\" << event.getKeySym () << \"\\' was\";\n if (event.keyDown ())\n cout << \" pressed\" << endl;\n else\n cout << \" released\" << endl;\n }\n\n void\n mouse_callback (const pcl::visualization::MouseEvent& mouse_event, void*)\n {\n if (mouse_event.getType () == pcl::visualization::MouseEvent::MouseButtonPress && mouse_event.getButton () == pcl::visualization::MouseEvent::LeftButton)\n {\n cout << \"left button pressed @ \" << mouse_event.getX () << \" , \" << mouse_event.getY () << endl;\n }\n }\n\n \/**\n * @brief starts the main loop\n *\/\n void\n run ()\n {\n cloud_viewer_->registerMouseCallback (&OpenNI2Viewer::mouse_callback, *this);\n cloud_viewer_->registerKeyboardCallback (&OpenNI2Viewer::keyboard_callback, *this);\n cloud_viewer_->setCameraFieldOfView (1.02259994f);\n boost::function<void (const CloudConstPtr&) > cloud_cb = boost::bind (&OpenNI2Viewer::cloud_callback, this, _1);\n boost::signals2::connection cloud_connection = grabber_.registerCallback (cloud_cb);\n\n boost::signals2::connection image_connection;\n if (grabber_.providesCallback<void (const boost::shared_ptr<pcl::io::openni2::Image>&)>())\n {\n image_viewer_.reset (new pcl::visualization::ImageViewer (\"PCL OpenNI image\"));\n image_viewer_->registerMouseCallback (&OpenNI2Viewer::mouse_callback, *this);\n image_viewer_->registerKeyboardCallback (&OpenNI2Viewer::keyboard_callback, *this);\n boost::function<void (const boost::shared_ptr<pcl::io::openni2::Image>&) > image_cb = boost::bind (&OpenNI2Viewer::image_callback, this, _1);\n image_connection = grabber_.registerCallback (image_cb);\n }\n\n bool image_init = false, cloud_init = false;\n\n grabber_.start ();\n\n while (!cloud_viewer_->wasStopped () && (image_viewer_ && !image_viewer_->wasStopped ()))\n {\n boost::shared_ptr<pcl::io::openni2::Image> image;\n CloudConstPtr cloud;\n\n cloud_viewer_->spinOnce ();\n\n \/\/ See if we can get a cloud\n if (cloud_mutex_.try_lock ())\n {\n cloud_.swap (cloud);\n cloud_mutex_.unlock ();\n }\n\n if (cloud)\n {\n FPS_CALC(\"drawing cloud\");\n\n if (!cloud_init)\n {\n cloud_viewer_->setPosition (0, 0);\n cloud_viewer_->setSize (cloud->width, cloud->height);\n cloud_init = !cloud_init;\n }\n\n if (!cloud_viewer_->updatePointCloud (cloud, \"OpenNICloud\"))\n {\n cloud_viewer_->addPointCloud (cloud, \"OpenNICloud\");\n cloud_viewer_->resetCameraViewpoint (\"OpenNICloud\");\n cloud_viewer_->setCameraPosition (\n 0,0,0,\t\t\/\/ Position\n 0,0,1,\t\t\/\/ Viewpoint\n 0,-1,0);\t\/\/ Up\n }\n }\n\n \/\/ See if we can get an image\n if (image_mutex_.try_lock ())\n {\n image_.swap (image);\n image_mutex_.unlock ();\n }\n\n\n if (image)\n {\n if (!image_init && cloud && cloud->width != 0)\n {\n image_viewer_->setPosition (cloud->width, 0);\n image_viewer_->setSize (cloud->width, cloud->height);\n image_init = !image_init;\n }\n\n if (image->getEncoding () == pcl::io::openni2::Image::RGB)\n image_viewer_->addRGBImage ( (const unsigned char*)image->getData (), image->getWidth (), image->getHeight ());\n else\n image_viewer_->addRGBImage (rgb_data_, image->getWidth (), image->getHeight ());\n image_viewer_->spinOnce ();\n\n }\n }\n\n grabber_.stop ();\n\n cloud_connection.disconnect ();\n image_connection.disconnect ();\n if (rgb_data_)\n delete[] rgb_data_;\n }\n\n boost::shared_ptr<pcl::visualization::PCLVisualizer> cloud_viewer_;\n boost::shared_ptr<pcl::visualization::ImageViewer> image_viewer_;\n\n pcl::io::OpenNI2Grabber& grabber_;\n boost::mutex cloud_mutex_;\n boost::mutex image_mutex_;\n\n CloudConstPtr cloud_;\n boost::shared_ptr<pcl::io::openni2::Image> image_;\n unsigned char* rgb_data_;\n unsigned rgb_data_size_;\n};\n\n\/\/ Create the PCLVisualizer object\nboost::shared_ptr<pcl::visualization::PCLVisualizer> cld;\nboost::shared_ptr<pcl::visualization::ImageViewer> img;\n\n\/* ---[ *\/\nint\nmain (int argc, char** argv)\n{\n std::string device_id (\"\");\n pcl::io::OpenNI2Grabber::Mode depth_mode = pcl::io::OpenNI2Grabber::OpenNI_Default_Mode;\n pcl::io::OpenNI2Grabber::Mode image_mode = pcl::io::OpenNI2Grabber::OpenNI_Default_Mode;\n bool xyz = false;\n\n if (argc >= 2)\n {\n device_id = argv[1];\n if (device_id == \"--help\" || device_id == \"-h\")\n {\n printHelp (argc, argv);\n return 0;\n }\n else if (device_id == \"-l\")\n {\n if (argc >= 3)\n {\n pcl::io::OpenNI2Grabber grabber (argv[2]);\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = grabber.getDevice ();\n cout << *device;\t\t\/\/ Prints out all sensor data, including supported video modes\n }\n else\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2DeviceManager> deviceManager = pcl::io::openni2::OpenNI2DeviceManager::getInstance ();\n if (deviceManager->getNumOfConnectedDevices () > 0)\n {\n for (unsigned deviceIdx = 0; deviceIdx < deviceManager->getNumOfConnectedDevices (); ++deviceIdx)\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = deviceManager->getDeviceByIndex (deviceIdx);\n cout << \"Device \" << device->getStringID () << \"connected.\" << endl;\n }\n\n }\n else\n cout << \"No devices connected.\" << endl;\n\n cout <<\"Virtual Devices available: ONI player\" << endl;\n }\n return 0;\n }\n }\n else\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2DeviceManager> deviceManager = pcl::io::openni2::OpenNI2DeviceManager::getInstance ();\n if (deviceManager->getNumOfConnectedDevices () > 0)\n {\n boost::shared_ptr<pcl::io::openni2::OpenNI2Device> device = deviceManager->getAnyDevice ();\n cout << \"Device ID not set, using default device: \" << device->getStringID () << endl;\n }\n }\n\n unsigned mode;\n if (pcl::console::parse (argc, argv, \"-depthmode\", mode) != -1)\n depth_mode = pcl::io::OpenNI2Grabber::Mode (mode);\n\n if (pcl::console::parse (argc, argv, \"-imagemode\", mode) != -1)\n image_mode = pcl::io::OpenNI2Grabber::Mode (mode);\n\n if (pcl::console::find_argument (argc, argv, \"-xyz\") != -1)\n xyz = true;\n\n try\n {\n pcl::io::OpenNI2Grabber grabber (device_id, depth_mode, image_mode);\n\n if (xyz || !grabber.providesCallback<pcl::io::OpenNI2Grabber::sig_cb_openni_point_cloud_rgb> ())\n {\n OpenNI2Viewer<pcl::PointXYZ> openni_viewer (grabber);\n openni_viewer.run ();\n }\n else\n {\n OpenNI2Viewer<pcl::PointXYZRGBA> openni_viewer (grabber);\n openni_viewer.run ();\n }\n }\n catch (pcl::IOException& e)\n {\n pcl::console::print_error (\"Failed to create a grabber: %s\\n\", e.what ());\n return (1);\n }\n\n return (0);\n}\n\/* ]--- *\/\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"edf.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/global\/globallogger.h\"\n#include \"renderer\/kernel\/shading\/shadingcontext.h\"\n#include \"renderer\/kernel\/shading\/shadingpoint.h\"\n#include \"renderer\/modeling\/input\/source.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/api\/apistring.h\"\n#include \"foundation\/utility\/arena.h\"\n\n\/\/ Standard headers.\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nnamespace renderer\n{\n\n\/\/\n\/\/ EDF class implementation.\n\/\/\n\nnamespace\n{\n const UniqueID g_class_uid = new_guid();\n}\n\nUniqueID EDF::get_class_uid()\n{\n return g_class_uid;\n}\n\nEDF::EDF(\n const char* name,\n const ParamArray& params)\n : ConnectableEntity(g_class_uid, params)\n , m_flags(0)\n , m_light_near_start(0.0)\n{\n set_name(name);\n}\n\nfloat EDF::get_uncached_importance_multiplier() const\n{\n return m_params.get_optional<float>(\"importance_multiplier\", 1.0f);\n}\n\ndouble EDF::get_uncached_light_near_start() const\n{\n return m_params.get_optional<double>(\"light_near_start\", 0.0);\n}\n\nbool EDF::on_frame_begin(\n const Project& project,\n const BaseGroup* parent,\n OnFrameBeginRecorder& recorder,\n IAbortSwitch* abort_switch)\n{\n if (!ConnectableEntity::on_frame_begin(project, parent, recorder, abort_switch))\n return false;\n\n m_flags = 0;\n\n if (m_params.get_optional<bool>(\"cast_indirect_light\", true))\n m_flags |= CastIndirectLight;\n\n m_light_near_start = get_uncached_light_near_start();\n\n if (m_light_near_start < 0.0)\n {\n RENDERER_LOG_WARNING(\n \"edf \\\"%s\\\" has a negative light near start value; expect artifacts and\/or slowdowns.\",\n get_path().c_str());\n }\n\n m_max_contribution = get_uncached_max_contribution();\n\n if (get_uncached_importance_multiplier() <= 0.0f)\n {\n RENDERER_LOG_WARNING(\n \"edf \\\"%s\\\" has negative or zero importance; expect artifacts and\/or slowdowns.\",\n get_path().c_str());\n }\n\n return true;\n}\n\nvoid* EDF::evaluate_inputs(\n const ShadingContext& shading_context,\n const ShadingPoint& shading_point) const\n{\n void* data = shading_context.get_arena().allocate(get_inputs().compute_data_size());\n\n get_inputs().evaluate(\n shading_context.get_texture_cache(),\n shading_point.get_uv(0),\n data);\n\n return data;\n}\n\nfloat EDF::get_max_contribution_scalar(const Source* source) const\n{\n assert(source);\n\n if (!source || !source->is_uniform())\n return numeric_limits<float>::max();\n\n float value;\n\n source->evaluate_uniform(value);\n\n return value;\n}\n\nfloat EDF::get_max_contribution_spectrum(const Source* source) const\n{\n assert(source);\n\n if (!source || !source->is_uniform())\n return numeric_limits<float>::max();\n\n Spectrum spectrum;\n\n source->evaluate_uniform(spectrum);\n\n return max_value(spectrum);\n}\n\nfloat EDF::get_max_contribution(const Source* input, const Source* multiplier) const\n{\n const float max_contribution_spectrum = get_max_contribution_spectrum(input);\n\n if (max_contribution_spectrum == numeric_limits<float>::max())\n return numeric_limits<float>::max();\n\n const float max_contribution_scalar = get_max_contribution_scalar(multiplier);\n\n if (max_contribution_scalar == numeric_limits<float>::max())\n return numeric_limits<float>::max();\n\n return max_contribution_spectrum * max_contribution_scalar;\n}\n\nfloat EDF::get_max_contribution(const char* input_name, const char* multiplier_name) const\n{\n return get_max_contribution(m_inputs.source(input_name), m_inputs.source(multiplier_name));\n}\n\n} \/\/ namespace renderer\n<commit_msg>Remove invalid assertions<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2013 Francois Beaune, Jupiter Jazz Limited\n\/\/ Copyright (c) 2014-2017 Francois Beaune, The appleseedhq Organization\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ Interface header.\n#include \"edf.h\"\n\n\/\/ appleseed.renderer headers.\n#include \"renderer\/global\/globallogger.h\"\n#include \"renderer\/kernel\/shading\/shadingcontext.h\"\n#include \"renderer\/kernel\/shading\/shadingpoint.h\"\n#include \"renderer\/modeling\/input\/source.h\"\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/api\/apistring.h\"\n#include \"foundation\/utility\/arena.h\"\n\n\/\/ Standard headers.\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nnamespace renderer\n{\n\n\/\/\n\/\/ EDF class implementation.\n\/\/\n\nnamespace\n{\n const UniqueID g_class_uid = new_guid();\n}\n\nUniqueID EDF::get_class_uid()\n{\n return g_class_uid;\n}\n\nEDF::EDF(\n const char* name,\n const ParamArray& params)\n : ConnectableEntity(g_class_uid, params)\n , m_flags(0)\n , m_light_near_start(0.0)\n{\n set_name(name);\n}\n\nfloat EDF::get_uncached_importance_multiplier() const\n{\n return m_params.get_optional<float>(\"importance_multiplier\", 1.0f);\n}\n\ndouble EDF::get_uncached_light_near_start() const\n{\n return m_params.get_optional<double>(\"light_near_start\", 0.0);\n}\n\nbool EDF::on_frame_begin(\n const Project& project,\n const BaseGroup* parent,\n OnFrameBeginRecorder& recorder,\n IAbortSwitch* abort_switch)\n{\n if (!ConnectableEntity::on_frame_begin(project, parent, recorder, abort_switch))\n return false;\n\n m_flags = 0;\n\n if (m_params.get_optional<bool>(\"cast_indirect_light\", true))\n m_flags |= CastIndirectLight;\n\n m_light_near_start = get_uncached_light_near_start();\n\n if (m_light_near_start < 0.0)\n {\n RENDERER_LOG_WARNING(\n \"edf \\\"%s\\\" has a negative light near start value; expect artifacts and\/or slowdowns.\",\n get_path().c_str());\n }\n\n m_max_contribution = get_uncached_max_contribution();\n\n if (get_uncached_importance_multiplier() <= 0.0f)\n {\n RENDERER_LOG_WARNING(\n \"edf \\\"%s\\\" has negative or zero importance; expect artifacts and\/or slowdowns.\",\n get_path().c_str());\n }\n\n return true;\n}\n\nvoid* EDF::evaluate_inputs(\n const ShadingContext& shading_context,\n const ShadingPoint& shading_point) const\n{\n void* data = shading_context.get_arena().allocate(get_inputs().compute_data_size());\n\n get_inputs().evaluate(\n shading_context.get_texture_cache(),\n shading_point.get_uv(0),\n data);\n\n return data;\n}\n\nfloat EDF::get_max_contribution_scalar(const Source* source) const\n{\n if (!source || !source->is_uniform())\n return numeric_limits<float>::max();\n\n float value;\n source->evaluate_uniform(value);\n\n return value;\n}\n\nfloat EDF::get_max_contribution_spectrum(const Source* source) const\n{\n if (!source || !source->is_uniform())\n return numeric_limits<float>::max();\n\n Spectrum spectrum;\n source->evaluate_uniform(spectrum);\n\n return max_value(spectrum);\n}\n\nfloat EDF::get_max_contribution(const Source* input, const Source* multiplier) const\n{\n const float max_contribution_spectrum = get_max_contribution_spectrum(input);\n\n if (max_contribution_spectrum == numeric_limits<float>::max())\n return numeric_limits<float>::max();\n\n const float max_contribution_scalar = get_max_contribution_scalar(multiplier);\n\n if (max_contribution_scalar == numeric_limits<float>::max())\n return numeric_limits<float>::max();\n\n return max_contribution_spectrum * max_contribution_scalar;\n}\n\nfloat EDF::get_max_contribution(const char* input_name, const char* multiplier_name) const\n{\n return get_max_contribution(m_inputs.source(input_name), m_inputs.source(multiplier_name));\n}\n\n} \/\/ namespace renderer\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*-c++-*-\n\n\/*\n* Copyright (C) 2004 Stephan Huber http:\/\/digitalmind.de\n*\n*\n* The Open Scene Graph (OSG) is a cross platform C++\/OpenGL library for \n* real-time rendering of large 3D photo-realistic models. \n* The OSG homepage is http:\/\/www.openscenegraph.org\/\n* \n* This software is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This software is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program; if not, write to the Free Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n\n#include \"QuicktimeImageStream.h\"\n#include <osg\/Notify>\n#include <osg\/Timer>\n\n#include <OpenThreads\/ScopedLock>\n#include <OpenThreads\/Thread>\n\n#include \"QTUtils.h\"\n#include \"MovieData.h\"\n\n\n\n#define IDLE_TIMEOUT 150000L\n#define ERR_MSG(no,msg) osg::notify(osg::WARN) << \"QT-ImageStream: \" << msg << \" failed with error \" << no << std::endl;\n\nint QuicktimeImageStream::_qtInstanceCount = 0;\n\n\/\/ Constructor: setup and start thread\nQuicktimeImageStream::QuicktimeImageStream(std::string fileName) : ImageStream()\n{\n \/*\n \/\/ ricky \n if(_qtInstanceCount == 0)\n { \n osg::notify(osg::NOTICE) << \"quicktime Init\" << std::endl;\n initQuicktime(); \n }\n ++ _qtInstanceCount; \n \/\/ end ricky\n *\/ \n\n\n _len = 0;\n _data = new MovieData();\n\n for (int i = 0; i < NUM_CMD_INDEX; i++)\n _cmd[i] = THREAD_IDLE;\n _wrIndex = _rdIndex = 0;\n\n load(fileName);\n\n if (!fileName.empty())\n setFileName(fileName);\n\n \/\/ ricky\n _status = ImageStream::PAUSED;\n}\n\n\n\/\/ Deconstructor: stop and terminate thread\nQuicktimeImageStream::~QuicktimeImageStream()\n{\n if( isRunning() )\n {\n quit(true);\n }\n\n \/* \n \/\/ ricky \n -- _qtInstanceCount;\n if(_qtInstanceCount == 0)\n {\n osg::notify(osg::NOTICE) << \"quicktime Exit\" << std::endl;\n exitQuicktime(); \n } \n \/\/ end ricky\n *\/ \n\n \/\/ clean up quicktime movies.\n delete _data;\n \n}\n\n\n\/\/ Set command\nvoid QuicktimeImageStream::setCmd(ThreadCommand cmd, float rate)\n{\n OpenThreads::ScopedLock<OpenThreads::Mutex> lock(_mutex);\n\n _cmd[_wrIndex] = cmd;\n _rates[_wrIndex] = rate;\n _wrIndex = (_wrIndex + 1) % NUM_CMD_INDEX;\n}\n\n\n\/\/ Get command\nQuicktimeImageStream::ThreadCommand QuicktimeImageStream::getCmd()\n{\n ThreadCommand cmd = THREAD_IDLE;\n\n OpenThreads::ScopedLock<OpenThreads::Mutex> lock(_mutex);\n\n if (_rdIndex != _wrIndex) {\n cmd = _cmd[_rdIndex];\n _currentRate = _rates[_rdIndex];\n _rdIndex = (_rdIndex + 1) % NUM_CMD_INDEX;\n }\n\n return cmd;\n}\n\n\nvoid QuicktimeImageStream::load(std::string fileName)\n{\n osg::notify(osg::DEBUG_INFO) << \"QT-ImageStream: loading quicktime movie from \" << fileName << std::endl;\n\n _data->load(this, fileName);\n\n _len = _data->getMovieDuration();\n _current = 0;\n}\n\nvoid QuicktimeImageStream::quit(bool wiatForThreadToExit)\n{\n osg::notify(osg::DEBUG_INFO)<<\"Sending quit\"<<this<<std::endl;\n setCmd(THREAD_QUIT);\n\n if (wiatForThreadToExit)\n {\n while(isRunning())\n {\n osg::notify(osg::DEBUG_INFO)<<\"Waiting for QuicktimeImageStream to quit\"<<this<<std::endl;\n OpenThreads::Thread::YieldCurrentThread();\n }\n osg::notify(osg::DEBUG_INFO)<<\"QuicktimeImageStream has quit\"<<this<<std::endl;\n }\n}\n\n\nvoid QuicktimeImageStream::run()\n{\n\n bool playing = false;\n bool done = false;\n\n \/*\n OSErr err;\n err = EnterMoviesOnThread(0);\n ERR_MSG(err,\"EnterMoviesOnThread\");\n err = AttachMovieToCurrentThread(_data->getMovie());\n *\/ \n while (!done) {\n\n\n ThreadCommand cmd = getCmd();\n osg::notify(osg::DEBUG_INFO) << \"movietime: \" << _data->getMovieTime() << \" rate: \" << _data->getMovieRate() << \" state \" << cmd << \" playing: \" << playing << \" done \" << done << \" \" << _wrIndex << \"\/\" << _rdIndex << std::endl; \n \/\/ Handle commands \n {\n if (cmd != THREAD_IDLE) {\n osg::notify(osg::DEBUG_INFO) << \"new cmd: \" << cmd << std::endl;\n switch (cmd) {\n case THREAD_START: \/\/ Start or continue stream\n _data->setMovieRate(1.0f);\n\n playing = true;\n break;\n\n case THREAD_STOP:\n _data->setMovieRate(0);\n osg::notify(osg::INFO) << \"QT-ImageStream: stop at \"<< std::endl;\n playing = false;\n break;\n\n case THREAD_REWIND:\n SetMovieRate(_data->getMovie(),0);\n GoToBeginningOfMovie(_data->getMovie());\n break;\n\n case THREAD_FORWARD:\n SetMovieRate(_data->getMovie(),0);\n GoToEndOfMovie(_data->getMovie());\n break;\n\n case THREAD_SEEK:\n _data->setMovieTime(_currentRate);\n playing = true;\n break;\n\n case THREAD_SETRATE:\n _data->setMovieRate(_currentRate);\n playing = (_currentRate != 0.0f);\n break;\n\n case THREAD_CLOSE:\n _data->setMovieRate(0);\n break;\n\n case THREAD_QUIT: \/\/ TODO\n _data->setMovieRate(0);\n osg::notify(osg::INFO) << \"QT-ImageStream: quit\" << std::endl;\n \/\/playing = false;\n done = true;\n break;\n default:\n osg::notify(osg::WARN) << \"QT-ImageStream: Unknown command \" << cmd << std::endl;\n break;\n }\n }\n\n MoviesTask(_data->getMovie(),0);\n _current = _data->getMovieTime();\n }\n\n\n if (_lastUpdate!= _current) \n {\n \/\/ force the texture to update the image\n dirty();\n \/\/ update internal time and take care of looping\n _lastUpdate = _current;\n\n if (getLoopingMode() == LOOPING) \n { \n \/\/ loopen wir rueckwaerts?\n if ((_current <= 0.0f) && (_data->getCachedMovieRate() < 0.0f)) {\n forward();\n setMovieRate(_data->getCachedMovieRate()); \n } \n \/\/ loppen wir vorwrts?\n else if ((_current >= _len) && (_data->getCachedMovieRate() > 0.0f)) \n { \n rewind();\n setMovieRate(_data->getCachedMovieRate()); \n }\n } \n else \n { \/\/ NO LOOPING\n \/\/ricky\n if(_current >= _len)\n { \n pause();\n rewind();\n } \n \/\/ orig\n \/\/pause();\n\n \/\/end ricky\n }\n }\n\n if (playing)\n {\n OpenThreads::Thread::microSleep(16000);\n }\n else if (!done)\n {\n OpenThreads::Thread::microSleep(IDLE_TIMEOUT);\n }\n }\n \/*\n err = DetachMovieFromCurrentThread(_data->getMovie());\n err = ExitMoviesOnThread();\n ERR_MSG(err,\"ExitMoviesOnThread\");\n *\/\n}\n<commit_msg>From Brad Colbert, removed inappropriate rewind on non looping code path.<commit_after>\/\/ -*-c++-*-\n\n\/*\n* Copyright (C) 2004 Stephan Huber http:\/\/digitalmind.de\n*\n*\n* The Open Scene Graph (OSG) is a cross platform C++\/OpenGL library for \n* real-time rendering of large 3D photo-realistic models. \n* The OSG homepage is http:\/\/www.openscenegraph.org\/\n* \n* This software is free software; you can redistribute it and\/or modify\n* it under the terms of the GNU General Public License as published by\n* the Free Software Foundation; either version 2 of the License, or\n* (at your option) any later version.\n*\n* This software is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n* GNU General Public License for more details.\n*\n* You should have received a copy of the GNU General Public License\n* along with this program; if not, write to the Free Software\n* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n*\/\n\n#include \"QuicktimeImageStream.h\"\n#include <osg\/Notify>\n#include <osg\/Timer>\n\n#include <OpenThreads\/ScopedLock>\n#include <OpenThreads\/Thread>\n\n#include \"QTUtils.h\"\n#include \"MovieData.h\"\n\n\n\n#define IDLE_TIMEOUT 150000L\n#define ERR_MSG(no,msg) osg::notify(osg::WARN) << \"QT-ImageStream: \" << msg << \" failed with error \" << no << std::endl;\n\nint QuicktimeImageStream::_qtInstanceCount = 0;\n\n\/\/ Constructor: setup and start thread\nQuicktimeImageStream::QuicktimeImageStream(std::string fileName) : ImageStream()\n{\n \/*\n \/\/ ricky \n if(_qtInstanceCount == 0)\n { \n osg::notify(osg::NOTICE) << \"quicktime Init\" << std::endl;\n initQuicktime(); \n }\n ++ _qtInstanceCount; \n \/\/ end ricky\n *\/ \n\n\n _len = 0;\n _data = new MovieData();\n\n for (int i = 0; i < NUM_CMD_INDEX; i++)\n _cmd[i] = THREAD_IDLE;\n _wrIndex = _rdIndex = 0;\n\n load(fileName);\n\n if (!fileName.empty())\n setFileName(fileName);\n\n \/\/ ricky\n _status = ImageStream::PAUSED;\n}\n\n\n\/\/ Deconstructor: stop and terminate thread\nQuicktimeImageStream::~QuicktimeImageStream()\n{\n if( isRunning() )\n {\n quit(true);\n }\n\n \/* \n \/\/ ricky \n -- _qtInstanceCount;\n if(_qtInstanceCount == 0)\n {\n osg::notify(osg::NOTICE) << \"quicktime Exit\" << std::endl;\n exitQuicktime(); \n } \n \/\/ end ricky\n *\/ \n\n \/\/ clean up quicktime movies.\n delete _data;\n \n}\n\n\n\/\/ Set command\nvoid QuicktimeImageStream::setCmd(ThreadCommand cmd, float rate)\n{\n OpenThreads::ScopedLock<OpenThreads::Mutex> lock(_mutex);\n\n _cmd[_wrIndex] = cmd;\n _rates[_wrIndex] = rate;\n _wrIndex = (_wrIndex + 1) % NUM_CMD_INDEX;\n}\n\n\n\/\/ Get command\nQuicktimeImageStream::ThreadCommand QuicktimeImageStream::getCmd()\n{\n ThreadCommand cmd = THREAD_IDLE;\n\n OpenThreads::ScopedLock<OpenThreads::Mutex> lock(_mutex);\n\n if (_rdIndex != _wrIndex) {\n cmd = _cmd[_rdIndex];\n _currentRate = _rates[_rdIndex];\n _rdIndex = (_rdIndex + 1) % NUM_CMD_INDEX;\n }\n\n return cmd;\n}\n\n\nvoid QuicktimeImageStream::load(std::string fileName)\n{\n osg::notify(osg::DEBUG_INFO) << \"QT-ImageStream: loading quicktime movie from \" << fileName << std::endl;\n\n _data->load(this, fileName);\n\n _len = _data->getMovieDuration();\n _current = 0;\n}\n\nvoid QuicktimeImageStream::quit(bool wiatForThreadToExit)\n{\n osg::notify(osg::DEBUG_INFO)<<\"Sending quit\"<<this<<std::endl;\n setCmd(THREAD_QUIT);\n\n if (wiatForThreadToExit)\n {\n while(isRunning())\n {\n osg::notify(osg::DEBUG_INFO)<<\"Waiting for QuicktimeImageStream to quit\"<<this<<std::endl;\n OpenThreads::Thread::YieldCurrentThread();\n }\n osg::notify(osg::DEBUG_INFO)<<\"QuicktimeImageStream has quit\"<<this<<std::endl;\n }\n}\n\n\nvoid QuicktimeImageStream::run()\n{\n\n bool playing = false;\n bool done = false;\n\n \/*\n OSErr err;\n err = EnterMoviesOnThread(0);\n ERR_MSG(err,\"EnterMoviesOnThread\");\n err = AttachMovieToCurrentThread(_data->getMovie());\n *\/ \n while (!done) {\n\n\n ThreadCommand cmd = getCmd();\n osg::notify(osg::DEBUG_INFO) << \"movietime: \" << _data->getMovieTime() << \" rate: \" << _data->getMovieRate() << \" state \" << cmd << \" playing: \" << playing << \" done \" << done << \" \" << _wrIndex << \"\/\" << _rdIndex << std::endl; \n \/\/ Handle commands \n {\n if (cmd != THREAD_IDLE) {\n osg::notify(osg::DEBUG_INFO) << \"new cmd: \" << cmd << std::endl;\n switch (cmd) {\n case THREAD_START: \/\/ Start or continue stream\n _data->setMovieRate(1.0f);\n\n playing = true;\n break;\n\n case THREAD_STOP:\n _data->setMovieRate(0);\n osg::notify(osg::INFO) << \"QT-ImageStream: stop at \"<< std::endl;\n playing = false;\n break;\n\n case THREAD_REWIND:\n SetMovieRate(_data->getMovie(),0);\n GoToBeginningOfMovie(_data->getMovie());\n break;\n\n case THREAD_FORWARD:\n SetMovieRate(_data->getMovie(),0);\n GoToEndOfMovie(_data->getMovie());\n break;\n\n case THREAD_SEEK:\n _data->setMovieTime(_currentRate);\n playing = true;\n break;\n\n case THREAD_SETRATE:\n _data->setMovieRate(_currentRate);\n playing = (_currentRate != 0.0f);\n break;\n\n case THREAD_CLOSE:\n _data->setMovieRate(0);\n break;\n\n case THREAD_QUIT: \/\/ TODO\n _data->setMovieRate(0);\n osg::notify(osg::INFO) << \"QT-ImageStream: quit\" << std::endl;\n \/\/playing = false;\n done = true;\n break;\n default:\n osg::notify(osg::WARN) << \"QT-ImageStream: Unknown command \" << cmd << std::endl;\n break;\n }\n }\n\n MoviesTask(_data->getMovie(),0);\n _current = _data->getMovieTime();\n }\n\n\n if (_lastUpdate!= _current) \n {\n \/\/ force the texture to update the image\n dirty();\n \/\/ update internal time and take care of looping\n _lastUpdate = _current;\n\n if (getLoopingMode() == LOOPING) \n { \n \/\/ loopen wir rueckwaerts?\n if ((_current <= 0.0f) && (_data->getCachedMovieRate() < 0.0f)) {\n forward();\n setMovieRate(_data->getCachedMovieRate()); \n } \n \/\/ loppen wir vorwrts?\n else if ((_current >= _len) && (_data->getCachedMovieRate() > 0.0f)) \n { \n rewind();\n setMovieRate(_data->getCachedMovieRate()); \n }\n } \n else \n { \/\/ NO LOOPING\n \/\/ricky\n if(_current >= _len)\n { \n pause();\n\n \/\/ Don't rewind to the begining if the movie has completed.\n \/\/ Someone may want to see the last frame displayed.\n \/\/rewind();\n } \n \/\/ orig\n \/\/pause();\n\n \/\/end ricky\n }\n }\n\n if (playing)\n {\n OpenThreads::Thread::microSleep(16000);\n }\n else if (!done)\n {\n OpenThreads::Thread::microSleep(IDLE_TIMEOUT);\n }\n }\n \/*\n err = DetachMovieFromCurrentThread(_data->getMovie());\n err = ExitMoviesOnThread();\n ERR_MSG(err,\"ExitMoviesOnThread\");\n *\/\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n\n#include <osgProducer\/GraphicsContextImplementation>\n#include <osg\/TextureRectangle>\n#include <osg\/TextureCubeMap>\n#include <osg\/Notify>\n\nusing namespace osgProducer;\n\nnamespace osgProducer\n{\n struct MyWindowingSystemInterface : public osg::GraphicsContext::WindowingSystemInterface\n {\n virtual unsigned int getNumScreens(const osg::GraphicsContext::ScreenIdentifier& \/*screenIdentifier*\/) \n {\n return Producer::RenderSurface::getNumberOfScreens();\n }\n\n virtual void getScreenResolution(const osg::GraphicsContext::ScreenIdentifier& screenIdentifier, unsigned int& width, unsigned int& height)\n {\n osg::ref_ptr<Producer::RenderSurface> rs = new Producer::RenderSurface;\n rs->setHostName(screenIdentifier.hostName);\n rs->setDisplayNum(screenIdentifier.displayNum);\n rs->setScreenNum(screenIdentifier.screenNum);\n rs->getScreenSize(width, height);\n }\n\n\n virtual osg::GraphicsContext* createGraphicsContext(osg::GraphicsContext::Traits* traits)\n {\n return new GraphicsContextImplementation(traits);\n }\n };\n\n struct RegisterWindowingSystemInterfaceProxy\n {\n RegisterWindowingSystemInterfaceProxy()\n {\n osg::GraphicsContext::setWindowingSystemInterface(new MyWindowingSystemInterface);\n }\n \n ~RegisterWindowingSystemInterfaceProxy()\n {\n osg::GraphicsContext::setWindowingSystemInterface(0);\n }\n };\n \n RegisterWindowingSystemInterfaceProxy createWindowingSystemInterfaceProxy;\n};\n \n\n\nGraphicsContextImplementation::GraphicsContextImplementation(Traits* traits)\n{\n _traits = traits;\n\n _rs = new Producer::RenderSurface;\n _rs->setWindowName(traits->windowName);\n _rs->setWindowRectangle(traits->x, traits->y, traits->width, traits->height);\n _rs->useBorder(traits->windowDecoration);\n _rs->setDisplayNum(traits->displayNum);\n _rs->setScreenNum(traits->screenNum);\n \n\n \/\/ set the visual chooser\n Producer::VisualChooser* rs_vc = _rs->getVisualChooser();\n if (!rs_vc)\n {\n rs_vc = new Producer::VisualChooser;\n _rs->setVisualChooser(rs_vc);\n }\n \n rs_vc->setRedSize(_traits->red);\n rs_vc->setGreenSize(_traits->green);\n rs_vc->setBlueSize(_traits->blue);\n rs_vc->setAlphaSize(_traits->alpha);\n \n rs_vc->setDepthSize(_traits->depth);\n rs_vc->setStencilSize(_traits->stencil);\n \n if (_traits->doubleBuffer) rs_vc->useDoubleBuffer();\n\n rs_vc->addAttribute( Producer::VisualChooser::RGBA );\n\n \/\/ Always use UseGL\n rs_vc->addAttribute( Producer::VisualChooser::UseGL );\n \n if (traits->pbuffer)\n {\n _rs->setDrawableType(Producer::RenderSurface::DrawableType_PBuffer);\n\n if (traits->target)\n {\n\n _rs->setRenderToTextureOptions(traits->mipMapGeneration ? Producer::RenderSurface::RequestSpaceForMipMaps :\n Producer::RenderSurface::RenderToTextureOptions_Default);\n _rs->setRenderToTextureMipMapLevel(traits->level);\n _rs->setRenderToTextureMode(traits->alpha>0 ? Producer::RenderSurface::RenderToRGBATexture : \n Producer::RenderSurface::RenderToRGBTexture);\n\n switch(traits->target)\n {\n case(GL_TEXTURE_1D) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture1D);\n break;\n case(GL_TEXTURE_2D) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture2D);\n break;\n case(GL_TEXTURE_3D) :\n osg::notify(osg::NOTICE)<<\"PBuffer render to Texture3D not supported.\"<<std::endl;\n \/\/ not supported. \n \/\/ _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture3D);\n break;\n case(GL_TEXTURE_RECTANGLE) : \n osg::notify(osg::NOTICE)<<\"PBuffer render to TextureRectangle not supported.\"<<std::endl;\n \/\/ not supported.\n \/\/ _rs->setRenderToTextureTarget(Producer::RenderSurface::TextureRectangle);\n break;\n case(GL_TEXTURE_CUBE_MAP_POSITIVE_X) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_X) : \n case(GL_TEXTURE_CUBE_MAP_POSITIVE_Y) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_Y) : \n case(GL_TEXTURE_CUBE_MAP_POSITIVE_Z) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::TextureCUBE);\n _rs->setRenderToTextureFace( Producer::RenderSurface::CubeMapFace(traits->target - GL_TEXTURE_CUBE_MAP_POSITIVE_X));\n break;\n }\n\n }\n \n }\n \n GraphicsContextImplementation* sharedContext = dynamic_cast<GraphicsContextImplementation*>(traits->sharedContext);\n\n if (sharedContext)\n {\n \/\/ different graphics context so we have our own state.\n setState(new osg::State);\n \n if (sharedContext->getState())\n {\n getState()->setContextID( sharedContext->getState()->getContextID() );\n incrementContextIDUsageCount( sharedContext->getState()->getContextID() ); \n }\n else\n {\n getState()->setContextID( osg::GraphicsContext::createNewContextID() );\n }\n \n \/\/ but we share texture objects etc. so we also share the same contextID\n \/\/_rs->realize( 0, sharedContext->_rs->getGLContext() );\n \n }\n else\n {\n \n \/\/ need to do something here.... \n setState( new osg::State );\n getState()->setContextID( osg::GraphicsContext::createNewContextID() );\n\n \/\/_rs->realize();\n }\n \n \/\/ _rs->useConfigEventThread(false);\n\n _closeOnDestruction = true;\n}\n\nGraphicsContextImplementation::GraphicsContextImplementation(Producer::RenderSurface* rs)\n{\n _rs = rs;\n _closeOnDestruction = false;\n\n _traits = new osg::GraphicsContext::Traits;\n _traits->windowName = _rs->getWindowName();\n _traits->displayNum = _rs->getDisplayNum();\n _traits->screenNum = _rs->getScreenNum();\n}\n\nGraphicsContextImplementation::~GraphicsContextImplementation()\n{\n if (_closeOnDestruction) close();\n}\n\nbool GraphicsContextImplementation::realizeImplementation()\n{\n if (_rs.valid()) \n {\n GraphicsContextImplementation* sharedContext = dynamic_cast<GraphicsContextImplementation*>(_traits->sharedContext);\n\n if (sharedContext)\n {\n _rs->realize( 0, sharedContext->_rs->getGLContext() );\n }\n else\n {\n osg::notify(osg::NOTICE)<<\"GraphicsContextImplementation::realize\"<<std::endl;\n\n _rs->realize();\n }\n return _rs->isRealized();\n }\n else\n {\n return false;\n }\n}\n\nbool GraphicsContextImplementation::makeCurrentImplementation()\n{\n if (!_rs)\n {\n osg::notify(osg::NOTICE)<<\"Error: GraphicsContextImplementation::makeCurrentImplementation() no RenderSurface.\"<<std::endl;\n return false;\n }\n\n if (!isRealized())\n {\n osg::notify(osg::NOTICE)<<\"Error: GraphicsContextImplementation::makeCurrentImplementation() not Realized.\"<<std::endl;\n return false;\n }\n\n\/\/ osg::notify(osg::INFO)<<\"GraphicsContextImplementation::makeCurrentImplementation()\"<<std::endl;\n\n _rs->setReadDrawable( 0 );\n\n \/\/ comment out right now, as Producer's setReadDrawable() is doing a call for us.\n \/\/ _rs->makeCurrent();\n \n return true;\n}\n\nbool GraphicsContextImplementation::makeContextCurrentImplementation(osg::GraphicsContext* readContext)\n{\n if (!_rs) return false;\n\n GraphicsContextImplementation* readContextImplemention = dynamic_cast<GraphicsContextImplementation*>(readContext);\n\n if (readContextImplemention)\n {\n _rs->setReadDrawable( readContextImplemention->getRenderSurface() );\n }\n else\n {\n _rs->setReadDrawable( 0 );\n }\n\n \/\/ comment out right now, as Producer's setReadDrawable() is doing a call for us.\n \/\/ _rs->makeCurrent();\n \n return true;\n}\n\nbool GraphicsContextImplementation::releaseContextImplementation()\n{\n osg::notify(osg::NOTICE)<<\"GraphicsContextImplementation::makeCurrentImplementation(): not implemented - release not supported under Producer.\"<<std::endl;\n return false;\n}\n\nvoid GraphicsContextImplementation::closeImplementation()\n{\n if (!_rs) return;\n \n \/\/ close render surface by deleting it \n _rs = 0;\n}\n\nvoid GraphicsContextImplementation::bindPBufferToTextureImplementation(GLenum buffer)\n{\n if (!_rs) return;\n \n Producer::RenderSurface::BufferType bufferType = Producer::RenderSurface::FrontBuffer;\n switch(buffer)\n {\n case(GL_BACK): bufferType = Producer::RenderSurface::BackBuffer; break;\n case(GL_FRONT): bufferType = Producer::RenderSurface::FrontBuffer; break;\n default: bufferType = Producer::RenderSurface::FrontBuffer; break;\n }\n\n _rs->bindPBufferToTexture(bufferType);\n}\n\nvoid GraphicsContextImplementation::swapBuffersImplementation()\n{\n _rs->swapBuffers();\n}\n<commit_msg>Fixed comment<commit_after>\/* -*-c++-*- OpenSceneGraph - Copyright (C) 1998-2006 Robert Osfield \n *\n * This library is open source and may be redistributed and\/or modified under \n * the terms of the OpenSceneGraph Public License (OSGPL) version 0.0 or \n * (at your option) any later version. The full license is in LICENSE file\n * included with this distribution, and on the openscenegraph.org website.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the \n * OpenSceneGraph Public License for more details.\n*\/\n\n#include <osgProducer\/GraphicsContextImplementation>\n#include <osg\/TextureRectangle>\n#include <osg\/TextureCubeMap>\n#include <osg\/Notify>\n\nusing namespace osgProducer;\n\nnamespace osgProducer\n{\n struct MyWindowingSystemInterface : public osg::GraphicsContext::WindowingSystemInterface\n {\n virtual unsigned int getNumScreens(const osg::GraphicsContext::ScreenIdentifier& \/*screenIdentifier*\/) \n {\n return Producer::RenderSurface::getNumberOfScreens();\n }\n\n virtual void getScreenResolution(const osg::GraphicsContext::ScreenIdentifier& screenIdentifier, unsigned int& width, unsigned int& height)\n {\n osg::ref_ptr<Producer::RenderSurface> rs = new Producer::RenderSurface;\n rs->setHostName(screenIdentifier.hostName);\n rs->setDisplayNum(screenIdentifier.displayNum);\n rs->setScreenNum(screenIdentifier.screenNum);\n rs->getScreenSize(width, height);\n }\n\n\n virtual osg::GraphicsContext* createGraphicsContext(osg::GraphicsContext::Traits* traits)\n {\n return new GraphicsContextImplementation(traits);\n }\n };\n\n struct RegisterWindowingSystemInterfaceProxy\n {\n RegisterWindowingSystemInterfaceProxy()\n {\n osg::GraphicsContext::setWindowingSystemInterface(new MyWindowingSystemInterface);\n }\n \n ~RegisterWindowingSystemInterfaceProxy()\n {\n osg::GraphicsContext::setWindowingSystemInterface(0);\n }\n };\n \n RegisterWindowingSystemInterfaceProxy createWindowingSystemInterfaceProxy;\n};\n \n\n\nGraphicsContextImplementation::GraphicsContextImplementation(Traits* traits)\n{\n _traits = traits;\n\n _rs = new Producer::RenderSurface;\n _rs->setWindowName(traits->windowName);\n _rs->setWindowRectangle(traits->x, traits->y, traits->width, traits->height);\n _rs->useBorder(traits->windowDecoration);\n _rs->setDisplayNum(traits->displayNum);\n _rs->setScreenNum(traits->screenNum);\n \n\n \/\/ set the visual chooser\n Producer::VisualChooser* rs_vc = _rs->getVisualChooser();\n if (!rs_vc)\n {\n rs_vc = new Producer::VisualChooser;\n _rs->setVisualChooser(rs_vc);\n }\n \n rs_vc->setRedSize(_traits->red);\n rs_vc->setGreenSize(_traits->green);\n rs_vc->setBlueSize(_traits->blue);\n rs_vc->setAlphaSize(_traits->alpha);\n \n rs_vc->setDepthSize(_traits->depth);\n rs_vc->setStencilSize(_traits->stencil);\n \n if (_traits->doubleBuffer) rs_vc->useDoubleBuffer();\n\n rs_vc->addAttribute( Producer::VisualChooser::RGBA );\n\n \/\/ Always use UseGL\n rs_vc->addAttribute( Producer::VisualChooser::UseGL );\n \n if (traits->pbuffer)\n {\n _rs->setDrawableType(Producer::RenderSurface::DrawableType_PBuffer);\n\n if (traits->target)\n {\n\n _rs->setRenderToTextureOptions(traits->mipMapGeneration ? Producer::RenderSurface::RequestSpaceForMipMaps :\n Producer::RenderSurface::RenderToTextureOptions_Default);\n _rs->setRenderToTextureMipMapLevel(traits->level);\n _rs->setRenderToTextureMode(traits->alpha>0 ? Producer::RenderSurface::RenderToRGBATexture : \n Producer::RenderSurface::RenderToRGBTexture);\n\n switch(traits->target)\n {\n case(GL_TEXTURE_1D) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture1D);\n break;\n case(GL_TEXTURE_2D) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture2D);\n break;\n case(GL_TEXTURE_3D) :\n osg::notify(osg::NOTICE)<<\"PBuffer render to Texture3D not supported.\"<<std::endl;\n \/\/ not supported. \n \/\/ _rs->setRenderToTextureTarget(Producer::RenderSurface::Texture3D);\n break;\n case(GL_TEXTURE_RECTANGLE) : \n osg::notify(osg::NOTICE)<<\"PBuffer render to TextureRectangle not supported.\"<<std::endl;\n \/\/ not supported.\n \/\/ _rs->setRenderToTextureTarget(Producer::RenderSurface::TextureRectangle);\n break;\n case(GL_TEXTURE_CUBE_MAP_POSITIVE_X) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_X) : \n case(GL_TEXTURE_CUBE_MAP_POSITIVE_Y) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_Y) : \n case(GL_TEXTURE_CUBE_MAP_POSITIVE_Z) : \n case(GL_TEXTURE_CUBE_MAP_NEGATIVE_Z) : \n _rs->setRenderToTextureTarget(Producer::RenderSurface::TextureCUBE);\n _rs->setRenderToTextureFace( Producer::RenderSurface::CubeMapFace(traits->target - GL_TEXTURE_CUBE_MAP_POSITIVE_X));\n break;\n }\n\n }\n \n }\n \n GraphicsContextImplementation* sharedContext = dynamic_cast<GraphicsContextImplementation*>(traits->sharedContext);\n\n if (sharedContext)\n {\n \/\/ different graphics context so we have our own state.\n setState(new osg::State);\n \n if (sharedContext->getState())\n {\n getState()->setContextID( sharedContext->getState()->getContextID() );\n incrementContextIDUsageCount( sharedContext->getState()->getContextID() ); \n }\n else\n {\n getState()->setContextID( osg::GraphicsContext::createNewContextID() );\n }\n \n \/\/ but we share texture objects etc. so we also share the same contextID\n \/\/_rs->realize( 0, sharedContext->_rs->getGLContext() );\n \n }\n else\n {\n \n \/\/ need to do something here.... \n setState( new osg::State );\n getState()->setContextID( osg::GraphicsContext::createNewContextID() );\n\n \/\/_rs->realize();\n }\n \n \/\/ _rs->useConfigEventThread(false);\n\n _closeOnDestruction = true;\n}\n\nGraphicsContextImplementation::GraphicsContextImplementation(Producer::RenderSurface* rs)\n{\n _rs = rs;\n _closeOnDestruction = false;\n\n _traits = new osg::GraphicsContext::Traits;\n _traits->windowName = _rs->getWindowName();\n _traits->displayNum = _rs->getDisplayNum();\n _traits->screenNum = _rs->getScreenNum();\n}\n\nGraphicsContextImplementation::~GraphicsContextImplementation()\n{\n if (_closeOnDestruction) close();\n}\n\nbool GraphicsContextImplementation::realizeImplementation()\n{\n if (_rs.valid()) \n {\n GraphicsContextImplementation* sharedContext = dynamic_cast<GraphicsContextImplementation*>(_traits->sharedContext);\n\n if (sharedContext)\n {\n _rs->realize( 0, sharedContext->_rs->getGLContext() );\n }\n else\n {\n osg::notify(osg::NOTICE)<<\"GraphicsContextImplementation::realize\"<<std::endl;\n\n _rs->realize();\n }\n return _rs->isRealized();\n }\n else\n {\n return false;\n }\n}\n\nbool GraphicsContextImplementation::makeCurrentImplementation()\n{\n if (!_rs)\n {\n osg::notify(osg::NOTICE)<<\"Error: GraphicsContextImplementation::makeCurrentImplementation() no RenderSurface.\"<<std::endl;\n return false;\n }\n\n if (!isRealized())\n {\n osg::notify(osg::NOTICE)<<\"Error: GraphicsContextImplementation::makeCurrentImplementation() not Realized.\"<<std::endl;\n return false;\n }\n\n\/\/ osg::notify(osg::INFO)<<\"GraphicsContextImplementation::makeCurrentImplementation()\"<<std::endl;\n\n _rs->setReadDrawable( 0 );\n\n \/\/ comment out right now, as Producer's setReadDrawable() is doing a call for us.\n \/\/ _rs->makeCurrent();\n \n return true;\n}\n\nbool GraphicsContextImplementation::makeContextCurrentImplementation(osg::GraphicsContext* readContext)\n{\n if (!_rs) return false;\n\n GraphicsContextImplementation* readContextImplemention = dynamic_cast<GraphicsContextImplementation*>(readContext);\n\n if (readContextImplemention)\n {\n _rs->setReadDrawable( readContextImplemention->getRenderSurface() );\n }\n else\n {\n _rs->setReadDrawable( 0 );\n }\n\n \/\/ comment out right now, as Producer's setReadDrawable() is doing a call for us.\n \/\/ _rs->makeCurrent();\n \n return true;\n}\n\nbool GraphicsContextImplementation::releaseContextImplementation()\n{\n osg::notify(osg::NOTICE)<<\"GraphicsContextImplementation::releaseContextImplementation(): not implemented - release not supported under Producer.\"<<std::endl;\n return false;\n}\n\nvoid GraphicsContextImplementation::closeImplementation()\n{\n if (!_rs) return;\n \n \/\/ close render surface by deleting it \n _rs = 0;\n}\n\nvoid GraphicsContextImplementation::bindPBufferToTextureImplementation(GLenum buffer)\n{\n if (!_rs) return;\n \n Producer::RenderSurface::BufferType bufferType = Producer::RenderSurface::FrontBuffer;\n switch(buffer)\n {\n case(GL_BACK): bufferType = Producer::RenderSurface::BackBuffer; break;\n case(GL_FRONT): bufferType = Producer::RenderSurface::FrontBuffer; break;\n default: bufferType = Producer::RenderSurface::FrontBuffer; break;\n }\n\n _rs->bindPBufferToTexture(bufferType);\n}\n\nvoid GraphicsContextImplementation::swapBuffersImplementation()\n{\n _rs->swapBuffers();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdexcept>\n#include <string>\n#include <iostream>\n#include <functional>\n#include <chrono>\n#include <GL\/glew.h>\n#include <SDL.h>\n#include <glm\/glm.hpp>\n#include <glm\/ext.hpp>\n#include <window.h>\n#include <input.h>\n#include <glbuffer.h>\n#include <glvertexarray.h>\n#include <glshader.h>\n#include <glprogram.h>\n#include <gltexture.h>\n#include <model.h>\n#include <util.h>\n\n\/\/This function demos working usage of ubo for matrices\nint uboWorking();\n\n\/\/Note that we build with console as the system so that we'll be able to see\n\/\/the debug output and have the window stay open after closing the program\nint main(int argc, char** argv){\n\treturn uboWorking();\n}\n\nconst std::array<glm::vec4, 10> quad = {\n\t\/\/Vertex positions\n\tglm::vec4(-1.0, -1.0, 0.0, 1.0),\n\tglm::vec4(1.0, -1.0, 0.0, 1.0),\n\tglm::vec4(-1.0, 1.0, 0.0, 1.0),\n\tglm::vec4(1.0, 1.0, 0.0, 1.0),\n\t\/\/Vertex colors\n\tglm::vec4(1.0, 0.0, 0.0, 1.0),\n\tglm::vec4(0.0, 1.0, 0.0, 1.0),\n\tglm::vec4(0.0, 0.0, 1.0, 1.0),\n\tglm::vec4(1.0, 1.0, 0.0, 1.0),\n\t\/\/Texture UVs, stored 2 to a vec4\n\tglm::vec4(0.0, 0.0, 1.0, 0.0),\n\tglm::vec4(0.0, 2.0, 1.0, 2.0),\n};\nconst std::array<unsigned short, 6> quadElems = {\n\t0, 1, 2,\n\t1, 3, 2\n};\n\nint uboWorking(){\n\ttry {\n\t\tWindow::init();\n\t}\n\tcatch (const std::runtime_error &e){\n\t\tstd::cout << e.what() << std::endl;\n\t}\n\tInput::Init();\n\tWindow window(\"Test\", 640, 480);\n\n\t\/\/Setup vbo & ebo\n\tGL::VertexBuffer vbo(quad, GL::USAGE::STATIC_DRAW);\n\tGL::ElementBuffer ebo(quadElems, GL::USAGE::STATIC_DRAW);\n\n\tUtil::checkError(\"VBO & EBO Setup\");\n\n\tGL::VertexArray vao;\n\tvao.elementBuffer(ebo);\n\tUtil::checkError(\"VAO setup\");\n\n\t\/\/Setup program\n\tGL::VertexShader vShader(\"..\/res\/basic.v.glsl\");\n\tif (!vShader.status())\n\t\tstd::cout << vShader.getLog() << std::endl;\n\tUtil::checkError(\"Vert shader Setup\");\n\n\tGL::FragmentShader fShader(\"..\/res\/multitexture.f.glsl\");\n\tif (!fShader.status())\n\t\tstd::cout << fShader.getLog() << std::endl;\n\tUtil::checkError(\"Frag shader Setup\");\n\n\tGL::Program program(vShader, fShader);\n\tUtil::checkError(\"Prog Setup\");\n\n\t\/\/Pass vertex pos into position attrib\n\tGLint posAttrib = program.getAttribute(\"position\");\n\tif (posAttrib == -1)\n\t\tstd::cout << \"Invalid position attrib loc\" << std::endl;\n\t\n\tGLint colAttrib = program.getAttribute(\"color\");\n\tif (colAttrib == -1)\n\t\tstd::cout << \"Invalid color attrib loc\" << std::endl;\n\n\tGLint uvAttrib = program.getAttribute(\"texUv\");\n\tif (uvAttrib == -1)\n\t\tstd::cout << \"Invalid uv attrib loc\" << std::endl;\n\n\tvao.setAttribPointer(vbo, posAttrib, 4, GL_FLOAT);\n\tvao.setAttribPointer(vbo, colAttrib, 4, GL_FLOAT, GL_FALSE, 0, (void*)(sizeof(glm::vec4) * 4));\n\tvao.setAttribPointer(vbo, uvAttrib, 2, GL_FLOAT, GL_FALSE, 0, (void*)(sizeof(glm::vec4) * 8));\n\tUtil::checkError(\"Pos attrib Setup\");\n\n\t\/\/Set the projection and model matrices\n\tglm::mat4 proj = glm::perspective(60.0f, 640.f \/ 480.f, 0.1f, 100.0f);\n\tglm::mat4 model = glm::translate<float>(0, 0, -2.5) * glm::rotate<float>(45, glm::vec3(0, 0, 1));\n\tstd::array<glm::mat4, 2> matrices = { proj, model };\n\n\tGL::UniformBuffer ubo(matrices, GL::USAGE::STATIC_DRAW);\n\tprogram.bindUniformBlock(\"Mat\", ubo);\n\tUtil::checkError(\"Proj buf Setup\");\n\n\t\/\/Creating the texture binds it to TEXTURE_2D so no need to bind again\n\tGL::Texture<GL::TEXTURE::T2D> texture(\"..\/res\/map.png\", true);\n\tGL::Texture<GL::TEXTURE::T2D> textureB(\"..\/res\/strip.png\", true);\n\n\tGL::Sampler sampler;\n\tsampler.parameteri(GL_TEXTURE_WRAP_S, GL_REPEAT);\n\tsampler.parameteri(GL_TEXTURE_WRAP_T, GL_CLAMP);\n\tsampler.parameteri(GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n\tsampler.parameteri(GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\t\n\ttexture.bind(GL_TEXTURE0, sampler);\n\ttextureB.bind(GL_TEXTURE1);\n\tprogram.uniform1i(\"texA\", 0);\n\tprogram.uniform1i(\"texB\", 1);\n\n\tprogram.use();\n\twhile (!Input::Quit()){\n\t\tInput::PollEvents();\n\t\tif (Input::KeyDown(SDL_SCANCODE_ESCAPE))\n\t\t\tInput::Quit(true);\n\n\t\twindow.clear();\n\n\t\tglDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, 0);\n\t\t\n\t\twindow.present();\n\t}\n\tWindow::quit();\n\n\treturn 0;\n}\n<commit_msg>Now drawing two items in the scene, a cube and plane so that I can look into shadowing and lighting effects since I've reached Ch.7 light and shadow in the OpenGL Programming Guide<commit_after>#include <stdexcept>\n#include <string>\n#include <iostream>\n#include <functional>\n#include <chrono>\n#include <GL\/glew.h>\n#include <SDL.h>\n#include <glm\/glm.hpp>\n#include <glm\/ext.hpp>\n#include <window.h>\n#include <input.h>\n#include <glbuffer.h>\n#include <glvertexarray.h>\n#include <glshader.h>\n#include <glprogram.h>\n#include <gltexture.h>\n#include <model.h>\n#include <util.h>\n\n\/\/This function demos working usage of ubo for matrices\nint uboWorking();\n\n\/\/Note that we build with console as the system so that we'll be able to see\n\/\/the debug output and have the window stay open after closing the program\nint main(int argc, char** argv){\n\treturn uboWorking();\n}\n\nconst std::array<glm::vec4, 10> quad = {\n\t\/\/Vertex positions\n\tglm::vec4(-1.0, -1.0, 0.0, 1.0),\n\tglm::vec4(1.0, -1.0, 0.0, 1.0),\n\tglm::vec4(-1.0, 1.0, 0.0, 1.0),\n\tglm::vec4(1.0, 1.0, 0.0, 1.0),\n\t\/\/Vertex colors\n\tglm::vec4(1.0, 0.0, 0.0, 1.0),\n\tglm::vec4(0.0, 1.0, 0.0, 1.0),\n\tglm::vec4(0.0, 0.0, 1.0, 1.0),\n\tglm::vec4(1.0, 1.0, 0.0, 1.0),\n\t\/\/Texture UVs, stored 2 to a vec4\n\tglm::vec4(0.0, 0.0, 1.0, 0.0),\n\tglm::vec4(0.0, 1.0, 1.0, 1.0),\n};\nconst std::array<unsigned short, 6> quadElems = {\n\t0, 1, 2,\n\t1, 3, 2\n};\n\nint uboWorking(){\n\ttry {\n\t\tWindow::init();\n\t}\n\tcatch (const std::runtime_error &e){\n\t\tstd::cout << e.what() << std::endl;\n\t}\n\tInput::Init();\n\tWindow window(\"Test\", 640, 480);\n\n\t\/\/Setup vbo & ebo\n\tGL::VertexBuffer vbo(quad, GL::USAGE::STATIC_DRAW);\n\tGL::ElementBuffer ebo(quadElems, GL::USAGE::STATIC_DRAW);\n\n\tUtil::checkError(\"VBO & EBO Setup\");\n\n\tGL::VertexArray vao;\n\tvao.elementBuffer(ebo);\n\tUtil::checkError(\"VAO setup\");\n\n\t\/\/Setup program\n\tGL::VertexShader vShader(\"..\/res\/basic.v.glsl\");\n\tif (!vShader.status())\n\t\tstd::cout << vShader.getLog() << std::endl;\n\tUtil::checkError(\"Vert shader Setup\");\n\n\tGL::FragmentShader fShader(\"..\/res\/basic.f.glsl\");\n\tif (!fShader.status())\n\t\tstd::cout << fShader.getLog() << std::endl;\n\tUtil::checkError(\"Frag shader Setup\");\n\n\tGL::Program program(vShader, fShader);\n\tUtil::checkError(\"Prog Setup\");\n\n\t\/\/Pass vertex pos into position attrib\n\tGLint posAttrib = program.getAttribute(\"position\");\n\tif (posAttrib == -1)\n\t\tstd::cout << \"Invalid position attrib loc\" << std::endl;\n\t\n\tGLint colAttrib = program.getAttribute(\"color\");\n\tif (colAttrib == -1)\n\t\tstd::cout << \"Invalid color attrib loc\" << std::endl;\n\n\tGLint uvAttrib = program.getAttribute(\"texUv\");\n\tif (uvAttrib == -1)\n\t\tstd::cout << \"Invalid uv attrib loc\" << std::endl;\n\n\tvao.setAttribPointer(vbo, posAttrib, 4, GL_FLOAT);\n\tvao.setAttribPointer(vbo, colAttrib, 4, GL_FLOAT, GL_FALSE, 0, (void*)(sizeof(glm::vec4) * 4));\n\tvao.setAttribPointer(vbo, uvAttrib, 2, GL_FLOAT, GL_FALSE, 0, (void*)(sizeof(glm::vec4) * 8));\n\tUtil::checkError(\"Pos attrib Setup\");\n\n\t\/\/Set the projection and model matrices\n\tglm::mat4 proj = glm::perspective(60.0f, 640.f \/ 480.f, 0.1f, 100.0f)\n\t\t* glm::lookAt(glm::vec3(0.f, 1.f, 2.f), glm::vec3(0.f, -1.f, -1.f), glm::vec3(0.f, 1.f, 0.f));\n\tglm::mat4 model = glm::translate(0.f, -1.f, 0.f) * glm::rotate(-90.f, glm::vec3(1.f, 0.f, 0.f));\n\tstd::array<glm::mat4, 2> matrices = { proj, model };\n\n\tGL::UniformBuffer ubo(matrices, GL::USAGE::STATIC_DRAW);\n\tprogram.bindUniformBlock(\"Mat\", ubo);\n\tUtil::checkError(\"quad buf setup\");\n\n\t\/\/Creating the texture binds it to TEXTURE_2D so no need to bind again\n\tGL::Texture<GL::TEXTURE::T2D> texture(\"..\/res\/map.png\");\n\ttexture.bind(GL_TEXTURE0);\n\tprogram.uniform1i(\"tex2D\", 0);\n\n\t\/\/Setup a simple cube model to draw\n\tGL::VertexArray cubeVAO;\n\tGL::VertexBuffer cubeVBO;\n\tModel::loadObj(\"..\/res\/cube.obj\", cubeVAO, cubeVBO);\n\n\tGL::Program cubeProg(\"..\/res\/cube_simple.v.glsl\", \"..\/res\/cube_simple.f.glsl\");\n\tcubeVAO.setAttribPointer(cubeVBO, cubeProg.getAttribute(\"position\"), 3, GL_FLOAT, GL_FALSE, 3 * sizeof(glm::vec3));\n\n\tstd::array<glm::mat4, 2> cubeMats = { proj, \n\t\tglm::translate(0.f, -0.5f, 0.f) * glm::rotate(45.f, glm::vec3(0.f, 1.f, 0.f)) * glm::scale(0.3f, 0.3f, 0.3f)\n\t};\n\tGL::UniformBuffer cubeUBO(cubeMats, GL::USAGE::STATIC_DRAW);\n\twindow.logMessage(\"SETTING CUBE UBO\");\n\tcubeProg.bindUniformBlock(\"Mat\", cubeUBO);\n\n\t\/\/Testing an idea\n\tGLuint quadMatBind = program.getUniformBlockIndex(\"Mat\");\n\tGLuint cubeMatBind = cubeProg.getUniformBlockIndex(\"Mat\");\n\n\t\/\/It seems that uniform block indices are a global thing, similar to how TEXTURE0 and such work\n\tglUniformBlockBinding(program, quadMatBind, 0);\n\tglBindBufferBase(static_cast<GLenum>(GL::BUFFER::UNIFORM), 0, ubo);\n\tglUniformBlockBinding(cubeProg, cubeMatBind, 1);\n\tglBindBufferBase(static_cast<GLenum>(GL::BUFFER::UNIFORM), 1, cubeUBO);\n\n\tstd::cout << \"cube ubo #: \" << static_cast<GLuint>(cubeUBO) \n\t\t<< \" cube ubo idx: \" << cubeProg.getUniformBlockIndex(\"Mat\") << \"\\n\"\n\t\t<< \"quad ubo #: \" << static_cast<GLenum>(ubo)\n\t\t<< \" quad ubo idx: \" << program.getUniformBlockIndex(\"Mat\") << std::endl;\n\n\tUtil::checkError(\"cube setup\");\n\n\twhile (!Input::Quit()){\n\t\tInput::PollEvents();\n\t\tif (Input::KeyDown(SDL_SCANCODE_ESCAPE))\n\t\t\tInput::Quit(true);\n\n\t\twindow.clear();\n\n\t\tprogram.use();\n\t\tglBindVertexArray(vao);\n\t\tglDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_SHORT, 0);\n\n\t\tcubeProg.use();\n\t\tglBindVertexArray(cubeVAO);\n\t\tglDrawElements(GL_TRIANGLES, cubeVAO.numElements(), GL_UNSIGNED_SHORT, 0);\t\t\n\n\t\twindow.present();\n\t}\n\tWindow::quit();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2011 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"bytearrayinputstream.h\"\n\nnamespace Debugger {\nnamespace Internal {\n\nByteArrayInputStream::ByteArrayInputStream(QByteArray &ba) :\n m_target(ba), m_integerBase(10), m_hexPrefix(false), m_width(0)\n{\n}\n\nvoid ByteArrayInputStream::appendSeparator(char c)\n{\n if (!m_target.isEmpty() && !m_target.endsWith(c))\n m_target.append(c);\n}\n\nvoid hexPrefixOn(ByteArrayInputStream &bs)\n{\n bs.setHexPrefix(true);\n}\n\nvoid hexPrefixOff(ByteArrayInputStream &bs)\n{\n bs.setHexPrefix(false);\n}\n\nvoid hex(ByteArrayInputStream &bs)\n{\n bs.setIntegerBase(16);\n}\n\nvoid dec(ByteArrayInputStream &bs)\n{\n bs.setIntegerBase(10);\n}\n\nvoid blankSeparator(ByteArrayInputStream &bs)\n{\n bs.appendSeparator();\n}\n\nQByteArray trimFront(QByteArray in)\n{\n if (in.isEmpty())\n return in;\n const int size = in.size();\n int pos = 0;\n for ( ; pos < size && isspace(in.at(pos)); pos++) ;\n if (pos)\n in.remove(0, pos);\n return in;\n}\n\nQByteArray trimBack(QByteArray in)\n{\n if (in.isEmpty())\n return in;\n const int size = in.size();\n int pos = size - 1;\n for ( ; pos >= 0 && isspace(in.at(pos)); pos--) ;\n if (pos != size - 1)\n in.truncate(pos + 1);\n return in;\n}\n\n\n\/\/ Simplify: replace tabs, find all occurrences\n\/\/ of 2 blanks, check further up for blanks and remove that bit.\nQByteArray simplify(const QByteArray &inIn)\n{\n if (inIn.isEmpty())\n return inIn;\n QByteArray in = trimFront(trimBack(inIn));\n in.replace('\\t', ' ');\n in.replace('\\n', ' ');\n in.replace('\\r', ' ');\n const QByteArray twoBlanks = \" \";\n while (true) {\n const int pos = in.indexOf(twoBlanks);\n if (pos != -1) {\n const int size = in.size();\n int endPos = pos + twoBlanks.size();\n for ( ; endPos < size && in.at(endPos) == ' '; endPos++) ;\n in.remove(pos + 1, endPos - pos - 1);\n } else {\n break;\n }\n }\n return in;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<commit_msg>debugger:compile fix for -no-stl'ed Qt<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2011 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** No Commercial Usage\n**\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**************************************************************************\/\n\n#include \"bytearrayinputstream.h\"\n\n#include <ctype.h>\n\nnamespace Debugger {\nnamespace Internal {\n\nByteArrayInputStream::ByteArrayInputStream(QByteArray &ba) :\n m_target(ba), m_integerBase(10), m_hexPrefix(false), m_width(0)\n{\n}\n\nvoid ByteArrayInputStream::appendSeparator(char c)\n{\n if (!m_target.isEmpty() && !m_target.endsWith(c))\n m_target.append(c);\n}\n\nvoid hexPrefixOn(ByteArrayInputStream &bs)\n{\n bs.setHexPrefix(true);\n}\n\nvoid hexPrefixOff(ByteArrayInputStream &bs)\n{\n bs.setHexPrefix(false);\n}\n\nvoid hex(ByteArrayInputStream &bs)\n{\n bs.setIntegerBase(16);\n}\n\nvoid dec(ByteArrayInputStream &bs)\n{\n bs.setIntegerBase(10);\n}\n\nvoid blankSeparator(ByteArrayInputStream &bs)\n{\n bs.appendSeparator();\n}\n\nQByteArray trimFront(QByteArray in)\n{\n if (in.isEmpty())\n return in;\n const int size = in.size();\n int pos = 0;\n for ( ; pos < size && isspace(in.at(pos)); pos++) ;\n if (pos)\n in.remove(0, pos);\n return in;\n}\n\nQByteArray trimBack(QByteArray in)\n{\n if (in.isEmpty())\n return in;\n const int size = in.size();\n int pos = size - 1;\n for ( ; pos >= 0 && isspace(in.at(pos)); pos--) ;\n if (pos != size - 1)\n in.truncate(pos + 1);\n return in;\n}\n\n\n\/\/ Simplify: replace tabs, find all occurrences\n\/\/ of 2 blanks, check further up for blanks and remove that bit.\nQByteArray simplify(const QByteArray &inIn)\n{\n if (inIn.isEmpty())\n return inIn;\n QByteArray in = trimFront(trimBack(inIn));\n in.replace('\\t', ' ');\n in.replace('\\n', ' ');\n in.replace('\\r', ' ');\n const QByteArray twoBlanks = \" \";\n while (true) {\n const int pos = in.indexOf(twoBlanks);\n if (pos != -1) {\n const int size = in.size();\n int endPos = pos + twoBlanks.size();\n for ( ; endPos < size && in.at(endPos) == ' '; endPos++) ;\n in.remove(pos + 1, endPos - pos - 1);\n } else {\n break;\n }\n }\n return in;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<|endoftext|>"} {"text":"<commit_before><commit_msg>deleted temporary file<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <string>\n\n#include \"Options.hpp\"\n#include \"Compiler.hpp\"\n#include \"Utils.hpp\"\n#include \"Platform.hpp\"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE EddicTestSuites\n#include <boost\/test\/unit_test.hpp>\n\n#define TEST_SAMPLE(file)\\\nBOOST_AUTO_TEST_CASE( samples_##file ){\\\n assertCompiles(\"samples\/\" #file \".eddi\", \"--32\");\\\n assertCompiles(\"samples\/\" #file \".eddi\", \"--64\");\\\n}\n\n#define ASSERT_OUTPUT(file, output)\\\n assertOutputEquals(file, output, \"--32\");\\\n assertOutputEquals(file, output, \"--64\");\n\n#include <iostream>\n\nvoid assertCompiles(const std::string& file, const std::string& param){\n const char* options[3] = {\".\/bin\/test\", param.c_str(), file.c_str()};\n eddic::parseOptions(3, options);\n\n eddic::Compiler compiler;\n\n eddic::Platform platform = eddic::Platform::INTEL_X86;\n int code = compiler.compileOnly(file, platform);\n\n BOOST_CHECK_EQUAL (code, 0);\n}\n\nvoid assertOutputEquals(const std::string& file, const std::string& output, const std::string& param){\n assertCompiles(\"test\/cases\/\" + file, param);\n\n std::string out = eddic::execCommand(\".\/a.out\"); \n \n BOOST_CHECK_EQUAL (output, out);\n}\n\n\/* Compiles all the samples *\/\n\nBOOST_AUTO_TEST_SUITE(SamplesSuite)\n\nTEST_SAMPLE(arrays)\nTEST_SAMPLE(asm)\nTEST_SAMPLE(assembly)\nTEST_SAMPLE(bool)\nTEST_SAMPLE(compound)\nTEST_SAMPLE(concat)\nTEST_SAMPLE(const)\nTEST_SAMPLE(functions)\nTEST_SAMPLE(float)\nTEST_SAMPLE(casts)\nTEST_SAMPLE(inc)\nTEST_SAMPLE(includes)\nTEST_SAMPLE(optimize)\nTEST_SAMPLE(problem)\nTEST_SAMPLE(sort)\nTEST_SAMPLE(identifiers)\nTEST_SAMPLE(structures)\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/* Specific tests *\/ \n\nBOOST_AUTO_TEST_SUITE(SpecificSuite)\n\nBOOST_AUTO_TEST_CASE( if_ ){\n ASSERT_OUTPUT(\"if.eddi\", \"Cool\");\n}\n\nBOOST_AUTO_TEST_CASE( while_ ){\n ASSERT_OUTPUT(\"while.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( do_while_ ){\n ASSERT_OUTPUT(\"do_while.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( for_ ){\n ASSERT_OUTPUT(\"for.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( foreach_ ){\n ASSERT_OUTPUT(\"foreach.eddi\", \"012345\");\n}\n\nBOOST_AUTO_TEST_CASE( globals_ ){\n assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-32\");\n assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( void_functions ){\n assertOutputEquals(\"void.eddi\", \"4445\", \"-32\");\n assertOutputEquals(\"void.eddi\", \"4445\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( string_functions ){\n assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-32\");\n assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( int_functions ){\n assertOutputEquals(\"return_int.eddi\", \"484\", \"-32\");\n assertOutputEquals(\"return_int.eddi\", \"484\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( recursive_functions ){\n assertOutputEquals(\"recursive.eddi\", \"362880\", \"-32\");\n assertOutputEquals(\"recursive.eddi\", \"362880\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( math ){\n assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-32\");\n assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( builtin ){\n assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-32\");\n assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( assign_value ){\n assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-32\");\n assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( args ){\n assertCompiles(\"test\/cases\/args.eddi\", \"-32\");\n\n std::string out = eddic::execCommand(\".\/a.out\"); \n BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n \n out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n \n assertCompiles(\"test\/cases\/args.eddi\", \"-64\");\n\n out = eddic::execCommand(\".\/a.out\"); \n BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n \n out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n \n\/* Unit test for bug fixes regression *\/\n\nBOOST_AUTO_TEST_SUITE(BugFixesSuite)\n\nBOOST_AUTO_TEST_CASE( while_bug ){\n assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-32\");\n assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-64\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>USE REQUIRE instead of CHECK for the tests that the compilation has been successfull to block from executing wrong file<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2011.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <string>\n\n#include \"Options.hpp\"\n#include \"Compiler.hpp\"\n#include \"Utils.hpp\"\n#include \"Platform.hpp\"\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE EddicTestSuites\n#include <boost\/test\/unit_test.hpp>\n\n#define TEST_SAMPLE(file)\\\nBOOST_AUTO_TEST_CASE( samples_##file ){\\\n assertCompiles(\"samples\/\" #file \".eddi\", \"--32\");\\\n assertCompiles(\"samples\/\" #file \".eddi\", \"--64\");\\\n}\n\n#define ASSERT_OUTPUT(file, output)\\\n assertOutputEquals(file, output, \"--32\");\\\n assertOutputEquals(file, output, \"--64\");\n\n#include <iostream>\n\nvoid assertCompiles(const std::string& file, const std::string& param){\n const char* options[3] = {\".\/bin\/test\", param.c_str(), file.c_str()};\n BOOST_REQUIRE (eddic::parseOptions(3, options));\n\n eddic::Compiler compiler;\n\n eddic::Platform platform = eddic::Platform::INTEL_X86;\n int code = compiler.compileOnly(file, platform);\n\n BOOST_REQUIRE_EQUAL (code, 0);\n}\n\nvoid assertOutputEquals(const std::string& file, const std::string& output, const std::string& param){\n assertCompiles(\"test\/cases\/\" + file, param);\n\n std::string out = eddic::execCommand(\".\/a.out\"); \n \n BOOST_CHECK_EQUAL (output, out);\n}\n\n\/* Compiles all the samples *\/\n\nBOOST_AUTO_TEST_SUITE(SamplesSuite)\n\nTEST_SAMPLE(arrays)\nTEST_SAMPLE(asm)\nTEST_SAMPLE(assembly)\nTEST_SAMPLE(bool)\nTEST_SAMPLE(compound)\nTEST_SAMPLE(concat)\nTEST_SAMPLE(const)\nTEST_SAMPLE(functions)\nTEST_SAMPLE(float)\nTEST_SAMPLE(casts)\nTEST_SAMPLE(inc)\nTEST_SAMPLE(includes)\nTEST_SAMPLE(optimize)\nTEST_SAMPLE(problem)\nTEST_SAMPLE(sort)\nTEST_SAMPLE(identifiers)\nTEST_SAMPLE(structures)\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\/* Specific tests *\/ \n\nBOOST_AUTO_TEST_SUITE(SpecificSuite)\n\nBOOST_AUTO_TEST_CASE( if_ ){\n ASSERT_OUTPUT(\"if.eddi\", \"Cool\");\n}\n\nBOOST_AUTO_TEST_CASE( while_ ){\n ASSERT_OUTPUT(\"while.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( do_while_ ){\n ASSERT_OUTPUT(\"do_while.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( for_ ){\n ASSERT_OUTPUT(\"for.eddi\", \"01234\");\n}\n\nBOOST_AUTO_TEST_CASE( foreach_ ){\n ASSERT_OUTPUT(\"foreach.eddi\", \"012345\");\n}\n\nBOOST_AUTO_TEST_CASE( globals_ ){\n assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-32\");\n assertOutputEquals(\"globals.eddi\", \"1000a2000aa\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( void_functions ){\n assertOutputEquals(\"void.eddi\", \"4445\", \"-32\");\n assertOutputEquals(\"void.eddi\", \"4445\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( string_functions ){\n assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-32\");\n assertOutputEquals(\"return_string.eddi\", \"abcdef\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( int_functions ){\n assertOutputEquals(\"return_int.eddi\", \"484\", \"-32\");\n assertOutputEquals(\"return_int.eddi\", \"484\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( recursive_functions ){\n assertOutputEquals(\"recursive.eddi\", \"362880\", \"-32\");\n assertOutputEquals(\"recursive.eddi\", \"362880\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( math ){\n assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-32\");\n assertOutputEquals(\"math.eddi\", \"333|111|-111|0|24642|2|-2|-1|1|2|0|-111|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( builtin ){\n assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-32\");\n assertOutputEquals(\"builtin.eddi\", \"10|11|12|13|12|13|10|11|4|8|13|8|0|3|\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( assign_value ){\n assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-32\");\n assertOutputEquals(\"assign_value.eddi\", \"66779921\", \"-64\");\n}\n\nBOOST_AUTO_TEST_CASE( args ){\n assertCompiles(\"test\/cases\/args.eddi\", \"-32\");\n\n std::string out = eddic::execCommand(\".\/a.out\"); \n BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n \n out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n \n assertCompiles(\"test\/cases\/args.eddi\", \"-64\");\n\n out = eddic::execCommand(\".\/a.out\"); \n BOOST_CHECK_EQUAL (\".\/a.out|\", out);\n \n out = eddic::execCommand(\".\/a.out arg1 arg2 arg3\"); \n BOOST_CHECK_EQUAL (\".\/a.out|arg1|arg2|arg3|\", out);\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n \n\/* Unit test for bug fixes regression *\/\n\nBOOST_AUTO_TEST_SUITE(BugFixesSuite)\n\nBOOST_AUTO_TEST_CASE( while_bug ){\n assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-32\");\n assertOutputEquals(\"while_bug.eddi\", \"W1W2W3W4W5\", \"-64\");\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/app.hxx>\n#include <abaclade\/coroutine.hxx>\n#include <abaclade\/range.hxx>\n\nusing namespace abc;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ coroutines_app\n\nclass coroutines_app : public app {\npublic:\n \/*! Main function of the program.\n\n @param vsArgs\n Arguments that were provided to this program via command line.\n @return\n Return value of this program.\n *\/\n virtual int main(collections::mvector<istr const> const & vsArgs) override {\n ABC_TRACE_FUNC(this, vsArgs);\n\n auto & pcorosched = this_thread::attach_coroutine_scheduler();\n\n \/\/ Open a pipe in asynchronous I\/O mode.\n auto pair(io::binary::pipe(true));\n\n \/\/ Schedule the reader.\n pcorosched->add(coroutine([this, &pair] () -> void {\n ABC_TRACE_FUNC(this\/*, pair*\/);\n\n io::text::stdout()->write_line(ABC_SL(\"reader: starting\"));\n for (;;) {\n int i;\n io::text::stdout()->print(ABC_SL(\"reader: reading\\n\"));\n \/\/ This will cause a context switch if the read would block.\n std::size_t cbRead = pair.first->read(&i, sizeof i);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n io::text::stdout()->print(ABC_SL(\"reader: read {}\\n\"), i);\n if (!cbRead) {\n \/\/ Detect EOF.\n break;\n }\n \/\/ Consume i.\n }\n io::text::stdout()->write_line(ABC_SL(\"reader: terminating\"));\n }));\n\n \/\/ Schedule the writer.\n pcorosched->add(coroutine([this, &pair] () -> void {\n ABC_TRACE_FUNC(this\/*, pair*\/);\n\n io::text::stdout()->write_line(ABC_SL(\"writer: starting\"));\n ABC_FOR_EACH(int i, make_range(1, 10)) {\n io::text::stdout()->print(ABC_SL(\"writer: writing {}\\n\"), i);\n \/\/ This will cause a context switch if the write would block.\n pair.second->write(&i, sizeof i);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n\n \/* Halt this coroutine for a few milliseconds. This will give the reader a chance to be\n scheduled, as well as create a more realistic non-continuous data flow into the pipe. *\/\n io::text::stdout()->write_line(ABC_SL(\"writer: yielding\"));\n this_thread::coroutine_scheduler()->yield_for(50);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n }\n \/\/ Close the writing end of the pipe to report EOF on the reading end.\n pair.second.reset();\n io::text::stdout()->write_line(ABC_SL(\"writer: terminating\"));\n }));\n\n \/\/ Switch this thread to run coroutines, until they all terminate.\n pcorosched->run();\n \/\/ Execution resumes here, after all coroutines have terminated.\n io::text::stdout()->write_line(ABC_SL(\"main: terminating\"));\n return 0;\n }\n};\n\nABC_APP_CLASS(coroutines_app)\n<commit_msg>Make coroutines example fancier<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n#include <abaclade\/app.hxx>\n#include <abaclade\/coroutine.hxx>\n#include <abaclade\/range.hxx>\n\nusing namespace abc;\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ coroutines_app\n\nclass coroutines_app : public app {\npublic:\n \/*! Main function of the program.\n\n @param vsArgs\n Arguments that were provided to this program via command line.\n @return\n Return value of this program.\n *\/\n virtual int main(collections::mvector<istr const> const & vsArgs) override {\n ABC_TRACE_FUNC(this, vsArgs);\n\n auto & pcorosched = this_thread::attach_coroutine_scheduler();\n\n \/\/ Open a pipe in asynchronous I\/O mode.\n auto pair(io::binary::pipe(true));\n\n \/\/ Schedule the reader.\n pcorosched->add(coroutine([this, &pair] () -> void {\n ABC_TRACE_FUNC(this\/*, pair*\/);\n\n io::text::stdout()->write_line(ABC_SL(\"reader: starting\"));\n for (;;) {\n int i;\n io::text::stdout()->print(ABC_SL(\"reader: reading\\n\"));\n \/\/ This will cause a context switch if the read would block.\n std::size_t cbRead = pair.first->read(&i, sizeof i);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n io::text::stdout()->print(ABC_SL(\"reader: read {}\\n\"), i);\n if (!cbRead) {\n \/\/ Detect EOF.\n break;\n }\n\n \/\/ Consume i.\n if (i == 3) {\n \/\/ Add a coroutine that will display a message in a quarter of a second.\n this_thread::coroutine_scheduler()->add(coroutine([] () -> void {\n io::text::stdout()->write_line(ABC_SL(\"delayed message: starting\"));\n this_thread::coroutine_scheduler()->yield_for(250);\n io::text::stdout()->write_line(ABC_SL(\"delayed message: this is it\"));\n io::text::stdout()->write_line(ABC_SL(\"delayed message: terminating\"));\n }));\n }\n }\n io::text::stdout()->write_line(ABC_SL(\"reader: terminating\"));\n }));\n\n \/\/ Schedule the writer.\n pcorosched->add(coroutine([this, &pair] () -> void {\n ABC_TRACE_FUNC(this\/*, pair*\/);\n\n io::text::stdout()->write_line(ABC_SL(\"writer: starting\"));\n ABC_FOR_EACH(int i, make_range(1, 10)) {\n io::text::stdout()->print(ABC_SL(\"writer: writing {}\\n\"), i);\n \/\/ This will cause a context switch if the write would block.\n pair.second->write(&i, sizeof i);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n\n \/* Halt this coroutine for a few milliseconds. This will give the reader a chance to be\n scheduled, as well as create a more realistic non-continuous data flow into the pipe. *\/\n io::text::stdout()->write_line(ABC_SL(\"writer: yielding\"));\n this_thread::coroutine_scheduler()->yield_for(50);\n \/\/ Execution resumes here, after other coroutines have received CPU time.\n }\n \/\/ Close the writing end of the pipe to report EOF on the reading end.\n pair.second.reset();\n io::text::stdout()->write_line(ABC_SL(\"writer: terminating\"));\n }));\n\n \/\/ Switch this thread to run coroutines, until they all terminate.\n pcorosched->run();\n \/\/ Execution resumes here, after all coroutines have terminated.\n io::text::stdout()->write_line(ABC_SL(\"main: terminating\"));\n return 0;\n }\n};\n\nABC_APP_CLASS(coroutines_app)\n<|endoftext|>"} {"text":"<commit_before>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2017 Intel Corporation. All Rights Reserved.\n\n#include <librealsense\/rs2.hpp>\n#include <iostream>\n#include <iomanip>\n#include <core\/streaming.h> \/\/TODO: remove\n#include <sensor.h>\n#include <record_device.h>\n\n#include \"tclap\/CmdLine.h\"\n\nusing namespace std;\nusing namespace TCLAP;\n\n\/\/TODO: remove when a sensor class actually exists in rs2.hpp\nclass sensor_REMOVE_ME\n{\npublic:\n sensor_REMOVE_ME(rs2::device sensor) : m_sensor(sensor)\n {\n\n }\n\n vector<rsimpl2::stream_profile> get_principal_requests()\n {\n throw std::runtime_error(\"Not Implemented: get_principal_requests()\");\n }\n void open(const vector<rsimpl2::stream_profile>& requests)\n {\n std::vector<rs2::stream_profile> profiles;\n std::transform(requests.begin(),requests.end(), std::back_inserter(profiles),[](const rsimpl2::stream_profile& p)\n {\n return rs2::stream_profile{ p.stream, p.width, p.height, p.fps, p.format};\n } );\n m_sensor.open(profiles);\n }\n void close()\n {\n m_sensor.close();\n }\n void start(rsimpl2::frame_callback_ptr callback)\n {\n \/\/m_sensor.start(callback);\n throw std::runtime_error(\"Not Implementer: start() \");\n\n }\n void stop()\n {\n m_sensor.stop();\n }\n rsimpl2::option& get_option(rs2_option id)\n {\n throw std::runtime_error(\"Not Implemented: get_option()\");\n }\n const rsimpl2::option& get_option(rs2_option id) const\n {\n throw std::runtime_error(\"Not Implemented: get_option() const\");\n }\n bool supports_option(rs2_option id) const\n {\n return false;\n }\n const string& get_info(rs2_camera_info info) const\n {\n throw std::runtime_error(\"Not Implemented: get_info() const\");\n }\n bool supports_info(rs2_camera_info info) const\n {\n return false;\n }\n void register_notifications_callback(rsimpl2::notifications_callback_ptr callback)\n {\n throw std::runtime_error(\"Not Implemented: register_notifications_callback()\");\n }\n bool is_streaming() const\n {\n throw std::runtime_error(\"Not Implemented: is_streaming()\");\n }\n\nprivate:\n rs2::device m_sensor;\n};\n\/\/TODO: remove when a device class actually exists in rs2.hpp\nclass device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS : public rsimpl2::device_interface\n{\npublic:\n device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS()\n {\n m_sensors = m_ctx.query_devices();\n if(m_sensors.empty())\n throw std::runtime_error(\"No device connected\");\n\n for (auto s: m_sensors)\n {\n \/\/m_sensors_interface.emplace_back<sensor_REMOVE_ME>(std::make_shared<rs2_sensor>());\n }\n }\n const string& get_info(rs2_camera_info info) const override\n {\n return m_sensors[0].get_camera_info(info);\n }\n bool supports_info(rs2_camera_info info) const override\n {\n return m_sensors[0].supports(info);\n }\n rsimpl2::sensor_interface& get_sensor(size_t i) override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor() \");\n }\n const rsimpl2::sensor_interface& get_sensor(size_t i) const override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor() const\");\n }\n size_t get_sensors_count() const override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor_count() \");\n }\n void hardware_reset() override\n {\n m_sensors[0].hardware_reset();\n }\n rs2_extrinsics get_extrinsics(size_t from, rs2_stream from_stream, size_t to, rs2_stream to_stream) const override\n {\n return m_ctx.get_extrinsics(m_sensors[from],from_stream,m_sensors[to],to_stream);\n\n }\n\n const rs2_device* get() const\n {\n return m_sensors[0].get();\n }\n\n rs2::context m_ctx;\n vector<rs2::device> m_sensors;\n \/\/vector<std::shared_ptr<rs2_sensor>> m_sensors_interface;\n};\n\/\/TODO: move to rs2.hpp\nclass recorder\n{\npublic:\n recorder(std::string file, device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS device) :\n m_file(file)\n {\n std::ifstream f(file);\n if(!f.good())\n throw std::invalid_argument(std::string(\"File \") + file + \" does not exists or cannot be opened\");\n\n rs2_error* e = nullptr;\n m_serializer = std::shared_ptr<rs2_device_serializer>(\n rs2_create_device_serializer(file.c_str(), &e),\n rs2_delete_device_serializer);\n rs2::error::handle(e);\n\n e = nullptr;\n m_record_device = std::shared_ptr<rs2_record_device>(\n rs2_create_record_device(m_live_device.get(), m_serializer.get(), &e),\n rs2_delete_record_device);\n rs2::error::handle(e);\n }\nprivate:\n std::string m_file;\n std::shared_ptr<rs2_device_serializer> m_serializer;\n std::shared_ptr<rs2_device> m_live_device; \/\/TODO: use a pointer to the c struct instead (when there will be one)\n std::shared_ptr<rs2_record_device> m_record_device;\n};\nint main(int argc, const char** argv) try\n{\n CmdLine cmd(\"librealsense cpp-record example\", ' ', RS2_API_VERSION_STR);\n ValueArg<std::string> file_path(\"f\", \"file_path\", \"File path for recording output\", false, \"record_example.bag\", \"string\");\n cmd.add( file_path );\n cmd.parse(argc, argv);\n\n device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS ds5_device;\n recorder record_device(file_path.getValue(), ds5_device);\n\n std::cout << \"Recording to file: \" << file_path.getValue() << std::endl;\n return 0;\n}\ncatch (const rs2::error & e)\n{\n cerr << \"RealSense error calling \" << e.get_failed_function() << \"(\" << e.get_failed_args() << \"):\\n \" << e.what() << endl;\n return EXIT_FAILURE;\n}<commit_msg>removed somw annoying warnings<commit_after>\/\/ License: Apache 2.0. See LICENSE file in root directory.\n\/\/ Copyright(c) 2017 Intel Corporation. All Rights Reserved.\n\n#include <librealsense\/rs2.hpp>\n#include <iostream>\n#include <iomanip>\n#include <core\/streaming.h> \/\/TODO: remove\n#include <sensor.h>\n#include <record_device.h>\n\n#include \"tclap\/CmdLine.h\"\n\nusing namespace std;\nusing namespace TCLAP;\n\n\/\/TODO: remove when a sensor class actually exists in rs2.hpp\nclass sensor_REMOVE_ME\n{\npublic:\n sensor_REMOVE_ME(rs2::device sensor) : m_sensor(sensor)\n {\n\n }\n\n vector<rsimpl2::stream_profile> get_principal_requests()\n {\n throw std::runtime_error(\"Not Implemented: get_principal_requests()\");\n }\n void open(const vector<rsimpl2::stream_profile>& requests)\n {\n std::vector<rs2::stream_profile> profiles;\n std::transform(requests.begin(),requests.end(), std::back_inserter(profiles),[](const rsimpl2::stream_profile& p)\n {\n return rs2::stream_profile{ p.stream,\n static_cast<int>(p.width),\n static_cast<int>(p.height),\n static_cast<int>(p.fps),\n p.format};\n } );\n m_sensor.open(profiles);\n }\n void close()\n {\n m_sensor.close();\n }\n void start(rsimpl2::frame_callback_ptr callback)\n {\n \/\/m_sensor.start(callback);\n throw std::runtime_error(\"Not Implementer: start() \");\n\n }\n void stop()\n {\n m_sensor.stop();\n }\n rsimpl2::option& get_option(rs2_option id)\n {\n throw std::runtime_error(\"Not Implemented: get_option()\");\n }\n const rsimpl2::option& get_option(rs2_option id) const\n {\n throw std::runtime_error(\"Not Implemented: get_option() const\");\n }\n bool supports_option(rs2_option id) const\n {\n return false;\n }\n const string& get_info(rs2_camera_info info) const\n {\n throw std::runtime_error(\"Not Implemented: get_info() const\");\n }\n bool supports_info(rs2_camera_info info) const\n {\n return false;\n }\n void register_notifications_callback(rsimpl2::notifications_callback_ptr callback)\n {\n throw std::runtime_error(\"Not Implemented: register_notifications_callback()\");\n }\n bool is_streaming() const\n {\n throw std::runtime_error(\"Not Implemented: is_streaming()\");\n }\n\nprivate:\n rs2::device m_sensor;\n};\n\/\/TODO: remove when a device class actually exists in rs2.hpp\nclass device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS : public rsimpl2::device_interface\n{\npublic:\n device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS()\n {\n m_sensors = m_ctx.query_devices();\n if(m_sensors.empty())\n throw std::runtime_error(\"No device connected\");\n\n for (auto s: m_sensors)\n {\n \/\/m_sensors_interface.emplace_back<sensor_REMOVE_ME>(std::make_shared<rs2_sensor>());\n }\n }\n const string& get_info(rs2_camera_info info) const override\n {\n throw std::runtime_error(\"Not Implementer: get_info() const \");\n }\n bool supports_info(rs2_camera_info info) const override\n {\n return m_sensors[0].supports(info);\n }\n rsimpl2::sensor_interface& get_sensor(size_t i) override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor() \");\n }\n const rsimpl2::sensor_interface& get_sensor(size_t i) const override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor() const\");\n }\n size_t get_sensors_count() const override\n {\n throw std::runtime_error(\"Not Implementer: get_sensor_count() \");\n }\n void hardware_reset() override\n {\n m_sensors[0].hardware_reset();\n }\n rs2_extrinsics get_extrinsics(size_t from, rs2_stream from_stream, size_t to, rs2_stream to_stream) const override\n {\n return m_ctx.get_extrinsics(m_sensors[from],from_stream,m_sensors[to],to_stream);\n\n }\n\n const rs2_device* get() const\n {\n return m_sensors[0].get();\n }\n\n rs2::context m_ctx;\n vector<rs2::device> m_sensors;\n \/\/vector<std::shared_ptr<rs2_sensor>> m_sensors_interface;\n};\n\/\/TODO: move to rs2.hpp\nclass recorder\n{\npublic:\n recorder(std::string file, device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS device) :\n m_file(file)\n {\n std::ifstream f(file);\n if(!f.good())\n throw std::invalid_argument(std::string(\"File \") + file + \" does not exists or cannot be opened\");\n\n rs2_error* e = nullptr;\n m_serializer = std::shared_ptr<rs2_device_serializer>(\n rs2_create_device_serializer(file.c_str(), &e),\n rs2_delete_device_serializer);\n rs2::error::handle(e);\n\n e = nullptr;\n m_record_device = std::shared_ptr<rs2_record_device>(\n rs2_create_record_device(m_live_device.get(), m_serializer.get(), &e),\n rs2_delete_record_device);\n rs2::error::handle(e);\n }\nprivate:\n std::string m_file;\n std::shared_ptr<rs2_device_serializer> m_serializer;\n std::shared_ptr<rs2_device> m_live_device; \/\/TODO: use a pointer to the c struct instead (when there will be one)\n std::shared_ptr<rs2_record_device> m_record_device;\n};\nint main(int argc, const char** argv) try\n{\n CmdLine cmd(\"librealsense cpp-record example\", ' ', RS2_API_VERSION_STR);\n ValueArg<std::string> file_path(\"f\", \"file_path\", \"File path for recording output\", false, \"record_example.bag\", \"string\");\n cmd.add( file_path );\n cmd.parse(argc, argv);\n\n device_REMOVE_ME_WHEN_DEVICE_CLASS_EXISTS ds5_device;\n recorder record_device(file_path.getValue(), ds5_device);\n\n std::cout << \"Recording to file: \" << file_path.getValue() << std::endl;\n return 0;\n}\ncatch (const rs2::error & e)\n{\n cerr << \"RealSense error calling \" << e.get_failed_function() << \"(\" << e.get_failed_args() << \"):\\n \" << e.what() << endl;\n return EXIT_FAILURE;\n}<|endoftext|>"} {"text":"<commit_before>\/*-------------------------------------------------------------------------\n *\n * hash_join.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/executor\/hash_join_executor.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include <vector>\n\n#include \"backend\/common\/types.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/executor\/hash_join_executor.h\"\n#include \"backend\/expression\/abstract_expression.h\"\n#include \"backend\/expression\/container_tuple.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor for nested loop join executor.\n * @param node Nested loop join node corresponding to this executor.\n *\/\nHashJoinExecutor::HashJoinExecutor(const planner::AbstractPlan *node,\n ExecutorContext *executor_context)\n: AbstractJoinExecutor(node, executor_context) {\n}\n\nbool HashJoinExecutor::DInit() {\n assert(children_.size() == 2);\n\n auto status = AbstractJoinExecutor::DInit();\n if (status == false)\n return status;\n\n assert(children_[1]->GetRawNode()->GetPlanNodeType() == PLAN_NODE_TYPE_HASH);\n\n hash_executor_ = reinterpret_cast<HashExecutor*>(children_[1]);\n\n return true;\n}\n\n\/**\n * @brief Creates logical tiles from the two input logical tiles after applying\n * join predicate.\n * @return true on success, false otherwise.\n *\/\nbool HashJoinExecutor::DExecute() {\n\n \/\/ Loop until we have non-empty result join logical tile or exit\n\n \/\/ Build outer join output when done\n\n \/\/===--------------------------------------------------------------------===\/\/\n \/\/ Pick right and left tiles\n \/\/===--------------------------------------------------------------------===\/\/\n\n \/\/ Get all the logical tiles from RIGHT child\n\n \/\/ Get next logical tile from LEFT child\n\n \/\/===--------------------------------------------------------------------===\/\/\n \/\/ Build Join Tile\n \/\/===--------------------------------------------------------------------===\/\/\n\n \/\/ Build output join logical tile\n\n \/\/ Build position lists\n\n \/\/ Get the hash table from the hash executor\n\n \/\/ Go over the left logical tile\n \/\/ For each tuple, find matching tuples in the hash table built on top of the right table\n \/\/ Go over the matching right tuples\n\n \/\/ Check if we have any join tuples\n\n return false;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<commit_msg>Removed 'Nested Loop' comments<commit_after>\/*-------------------------------------------------------------------------\n *\n * hash_join.cpp\n * file description\n *\n * Copyright(c) 2015, CMU\n *\n * \/peloton\/src\/executor\/hash_join_executor.cpp\n *\n *-------------------------------------------------------------------------\n *\/\n\n#include <vector>\n\n#include \"backend\/common\/types.h\"\n#include \"backend\/common\/logger.h\"\n#include \"backend\/executor\/logical_tile_factory.h\"\n#include \"backend\/executor\/hash_join_executor.h\"\n#include \"backend\/expression\/abstract_expression.h\"\n#include \"backend\/expression\/container_tuple.h\"\n\nnamespace peloton {\nnamespace executor {\n\n\/**\n * @brief Constructor for hash join executor.\n * @param node Hash join node corresponding to this executor.\n *\/\nHashJoinExecutor::HashJoinExecutor(const planner::AbstractPlan *node,\n ExecutorContext *executor_context)\n: AbstractJoinExecutor(node, executor_context) {\n}\n\nbool HashJoinExecutor::DInit() {\n assert(children_.size() == 2);\n\n auto status = AbstractJoinExecutor::DInit();\n if (status == false)\n return status;\n\n assert(children_[1]->GetRawNode()->GetPlanNodeType() == PLAN_NODE_TYPE_HASH);\n\n hash_executor_ = reinterpret_cast<HashExecutor*>(children_[1]);\n\n return true;\n}\n\n\/**\n * @brief Creates logical tiles from the two input logical tiles after applying\n * join predicate.\n * @return true on success, false otherwise.\n *\/\nbool HashJoinExecutor::DExecute() {\n\n \/\/ Loop until we have non-empty result join logical tile or exit\n\n \/\/ Build outer join output when done\n\n \/\/===--------------------------------------------------------------------===\/\/\n \/\/ Pick right and left tiles\n \/\/===--------------------------------------------------------------------===\/\/\n\n \/\/ Get all the logical tiles from RIGHT child\n\n \/\/ Get next logical tile from LEFT child\n\n \/\/===--------------------------------------------------------------------===\/\/\n \/\/ Build Join Tile\n \/\/===--------------------------------------------------------------------===\/\/\n\n \/\/ Build output join logical tile\n\n \/\/ Build position lists\n\n \/\/ Get the hash table from the hash executor\n\n \/\/ Go over the left logical tile\n \/\/ For each tuple, find matching tuples in the hash table built on top of the right table\n \/\/ Go over the matching right tuples\n\n \/\/ Check if we have any join tuples\n\n return false;\n}\n\n} \/\/ namespace executor\n} \/\/ namespace peloton\n<|endoftext|>"} {"text":"<commit_before>#include <yuni\/yuni.h>\n#include <yuni\/core\/process\/program.h>\n#include <yuni\/datetime\/timestamp.h>\n#include <yuni\/core\/getopt.h>\n#include <iostream>\n\nusing namespace Yuni;\n\n\n\n\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 2)\n\t{\n\t\tstd::cout << \"Usage: \" << argv[0] << \" <program> [<args>]\\n\";\n\t\treturn EXIT_FAILURE;\n\t}\n\n\tProcess::Program process;\n\n\t\/\/ providing arguments\n\tprocess.program(argv[1]);\n\tfor (int i = 2; i < argc; ++i)\n\t\tprocess.argumentAdd(argv[i]);\n\n\t\/\/ use milliseconds instead of seconds\n\tprocess.durationPrecision(Process::Program::dpMilliseconds);\n\t\/\/ redirect the output to the console\n\tprocess.redirectToConsole(true);\n\n\t\/\/ execute the command\n\tsint64 duration = 0;\n\tint exitStatus = process.execute() ? process.wait(&duration) : EXIT_FAILURE;\n\n\n\t\/\/ display the result nearly like `time`\n\tstd::cout << argv[1];\n\tfor (int i = 2; i < argc; ++i)\n\t\tstd::cout << ' ' << argv[i];\n\n\tstd::cout << \" \" << duration << \"ms\\n\";\n\treturn exitStatus;\n}\n\n<commit_msg>sample: Yuni::Process::Program: time: broadcast signals SIGINT (SIGTERM as a bonus) on UNIX to properly handle ctrl-c<commit_after>#include <yuni\/yuni.h>\n#include <yuni\/core\/process\/program.h>\n#include <yuni\/datetime\/timestamp.h>\n#include <yuni\/core\/getopt.h>\n#include <iostream>\n#ifdef YUNI_OS_UNIX\n#include <signal.h>\n#endif\n\nusing namespace Yuni;\n\n\nstatic Process::Program process;\n\n\n#ifdef YUNI_OS_UNIX\nvoid signalHandler(int sig)\n{\n\t\/\/ sending the same signal to the sub-process. If the sub-process\n\t\/\/ handles the signal, it may have a chance to stop properly and should behave\n\t\/\/ the same than without being executed by this program.\n\tprocess.signal(sig);\n\n\tif (sig == SIGINT) \/\/ ctrl-c\n\t{\n\t\t\/\/ a new line to keep the output clean (^C)\n\t\tstd::cout << std::endl;\n\t}\n}\n#endif\n\n\n\n\n\nint main(int argc, char* argv[])\n{\n\tif (argc < 2)\n\t{\n\t\tstd::cout << \"Usage: \" << argv[0] << \" <program> [<args>]\\n\";\n\t\treturn EXIT_FAILURE;\n\t}\n\n\n\t\/\/ providing arguments\n\tprocess.program(argv[1]);\n\tfor (int i = 2; i < argc; ++i)\n\t\tprocess.argumentAdd(argv[i]);\n\n\t\/\/ use milliseconds instead of seconds\n\tprocess.durationPrecision(Process::Program::dpMilliseconds);\n\t\/\/ redirect the output to the console\n\tprocess.redirectToConsole(true);\n\n\t#ifdef YUNI_OS_UNIX\n\t\/\/ install signal handler for SIGINT (ctrl-c) and SIGTERM (quit)\n\t\/\/ see note in the 'signalHandler' routine\n\t::signal(SIGINT, signalHandler); \/\/ interrupt program (^C ctrl-c)\n\t::signal(SIGTERM, signalHandler); \/\/ software termination signal\n\t#endif\n\n\n\t\/\/ execute the command\n\tsint64 duration = 0;\n\tint exitStatus = process.execute() ? process.wait(&duration) : EXIT_FAILURE;\n\n\n\t\/\/ display the result nearly like `time`\n\tstd::cout << argv[1];\n\tfor (int i = 2; i < argc; ++i)\n\t\tstd::cout << ' ' << argv[i];\n\n\tstd::cout << \" \" << duration << \"ms\";\n\tif (exitStatus != 0)\n\t\tstd::cout << \" (exit: \" << exitStatus << ')';\n\tstd::cout << '\\n';\n\treturn exitStatus;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <re2\/re2.h>\n#include <iostream>\n\n\n#define arraysize(array) (sizeof(array)\/sizeof((array)[0]))\n\nbool ExtractAll(const re2::StringPiece &text,\n const re2::RE2& re,\n const re2::StringPiece &rewrite,\n std::string *out) {\n re2::StringPiece vec[1234];\/\/[kVecSize];\n int nvec = 1 + RE2::MaxSubmatch(rewrite);\n if (nvec > arraysize(vec))\n return false;\n\n bool any = false;\n out->clear();\n int consumed = 0;\n while(re.Match(text, consumed, text.size(), RE2::UNANCHORED, vec, nvec)){\n consumed = vec[0].end() - text.begin();\n if(re.Rewrite(out, rewrite, vec, nvec)) {\n any = true;\n }\n }\n return any;\n}\n\nint main(int argc,char** argv){\n int o_global=0,\n o_usage=0,\n o_print_match=0,\n o_also_print_unreplaced=0,\n o_negate_match=0;\n\n if(argc>1){\n if(argv[1][0] == '-'){\n if ( argv[1][1] == '-'){\n \/\/ignore standalone '--' as argv[1];\n } else {\n \/\/ we have flags\n char* fs=argv[1]+1;\n char c;\n while((c=*fs++)){\n switch (c) {\n case 'g':\n o_global = 1;\n break;\n case 'o':\n o_print_match = 1;\n break;\n case 'p':\n o_also_print_unreplaced = 1;\n break;\n case 'v':\n o_negate_match = 1;\n break;\n default:\n o_usage = 1;\n }\n }\n }\n argv[1] = argv[0];\n argv++;\n argc--;\n }\n }\n\n if(o_usage){\n std::cout << argv[0] << \" [-flags] text pattern [replacement]\" << std::endl\n << std:: endl\n << \"TEXT text to search\" << std::endl\n << \"PATTERN re2 expression to apply\" << std::endl\n << \"REPLACEMENT optional replacement string, supports \\\\0 .. \\\\9 references\" << std::endl\n << \"FLAGS modifiers to operation\" << std::endl\n << std::endl\n << \" h: display help\" << std::endl\n << \" v: invert match\" << std::endl\n << \" o: only print matching portion\" << std::endl\n << \" p: (when replacing) print lines where no replacement was made\" << std::endl\n << \" g: (when replacing) global replace, default is one per line\" << std::endl\n << std::endl;\n return 0;\n }\n\n \/*\n std::cout << \"g:\" << o_global << std::endl << \n \"u:\" << o_usage << std::endl <<\n \"p:\" << o_print_match << std::endl <<\n \"u:\" << o_also_print_unreplaced << std::endl <<\n \"n:\" << o_negate_match << std::endl;*\/\n\n std::string in = std::string(argv[1]);\n std::string out;\n std::string *to_print = NULL;\n RE2::RE2 pat(argv[2]);\n\n \/\/rationalize flags\n if(o_negate_match && o_print_match){\n o_print_match = 0;\n }\n\n bool matched;\n bool print;\n if(argc==3){\n \/\/ re2g str pat\n \/\/ ignores o_global\n if(o_print_match){\n matched = RE2::Extract(in,pat,\"\\\\0\",&out);\n to_print=&out;\n\n } else {\n matched = RE2::PartialMatch(in,pat);\n to_print= ∈\n }\n to_print=(matched^o_negate_match)?to_print:NULL;\n } else if(argc==4) {\n \/\/ re2g str pat rep\n \/\/ ignores o_print_match\n\n std::string rep = std::string(argv[3]);\n\n \/\/ need to pick: (-o) Extract, (default)Replace, (-g)GlobalReplace\n \/\/ also, print non matching lines? (-p)\n if(o_print_match && !o_global){\n matched = RE2::Extract(in,pat,rep,&out);\n to_print=&out;\n } else if(o_global && !o_print_match) {\n matched = RE2::GlobalReplace(&in,pat,rep);\n to_print=∈\n } else if(o_global && o_print_match){\n matched = ExtractAll(in,pat,rep,&out);\n to_print=&out;\n } else {\n matched = RE2::Replace(&in,pat,rep);\n to_print=∈\n }\n to_print=(matched^o_negate_match)?to_print:NULL;\n\n if(o_also_print_unreplaced && !to_print){\n out = std::string(argv[1]);\n to_print = & out;\n }\n } else {\n std::cout << RE2::PartialMatch(\"f\", \"f\") << std::endl;\n std::cout << RE2::PartialMatch(\"fred\", \"z\") << std::endl;\n std::cout << RE2::PartialMatch(\"fred\", \"[fz]\") << std::endl;\n }\n if(to_print){\n std::cout << *to_print << std::endl;\n } else {\n std::cout << std::endl;\n }\n}\n\n<commit_msg>spacing cleanup<commit_after>#include <re2\/re2.h>\n#include <iostream>\n\n\n#define arraysize(array) (sizeof(array)\/sizeof((array)[0]))\n\nbool ExtractAll(const re2::StringPiece &text,\n const re2::RE2& re,\n const re2::StringPiece &rewrite,\n std::string *out) {\n re2::StringPiece vec[1234];\/\/[kVecSize];\n int nvec = 1 + RE2::MaxSubmatch(rewrite);\n if (nvec > arraysize(vec))\n return false;\n\n bool any = false;\n out->clear();\n int consumed = 0;\n while(re.Match(text, consumed, text.size(), RE2::UNANCHORED, vec, nvec)){\n consumed = vec[0].end() - text.begin();\n if(re.Rewrite(out, rewrite, vec, nvec)) {\n any = true;\n }\n }\n return any;\n}\n\nint main(int argc,char** argv){\n int o_global=0,\n o_usage=0,\n o_print_match=0,\n o_also_print_unreplaced=0,\n o_negate_match=0;\n\n if(argc>1){\n if(argv[1][0] == '-'){\n if ( argv[1][1] == '-'){\n \/\/ignore standalone '--' as argv[1];\n } else {\n \/\/ we have flags\n char* fs=argv[1]+1;\n char c;\n while((c=*fs++)){\n switch (c) {\n case 'g':\n o_global = 1;\n break;\n case 'o':\n o_print_match = 1;\n break;\n case 'p':\n o_also_print_unreplaced = 1;\n break;\n case 'v':\n o_negate_match = 1;\n break;\n default:\n o_usage = 1;\n }\n }\n }\n argv[1] = argv[0];\n argv++;\n argc--;\n }\n }\n\n if(o_usage){\n std::cout << argv[0] << \" [-flags] text pattern [replacement]\" << std::endl\n << std:: endl\n << \"TEXT text to search\" << std::endl\n << \"PATTERN re2 expression to apply\" << std::endl\n << \"REPLACEMENT optional replacement string, supports \\\\0 .. \\\\9 references\" << std::endl\n << \"FLAGS modifiers to operation\" << std::endl\n << std::endl\n << \" h: display help\" << std::endl\n << \" v: invert match\" << std::endl\n << \" o: only print matching portion\" << std::endl\n << \" p: (when replacing) print lines where no replacement was made\" << std::endl\n << \" g: (when replacing) global replace, default is one per line\" << std::endl\n << std::endl;\n return 0;\n }\n\n \/*\n std::cout << \"g:\" << o_global << std::endl << \n \"u:\" << o_usage << std::endl <<\n \"p:\" << o_print_match << std::endl <<\n \"u:\" << o_also_print_unreplaced << std::endl <<\n \"n:\" << o_negate_match << std::endl;*\/\n\n std::string in = std::string(argv[1]);\n std::string out;\n std::string *to_print = NULL;\n RE2::RE2 pat(argv[2]);\n\n \/\/rationalize flags\n if(o_negate_match && o_print_match){\n o_print_match = 0;\n }\n\n bool matched;\n bool print;\n if(argc==3){\n \/\/ re2g str pat\n \/\/ ignores o_global\n if(o_print_match){\n matched = RE2::Extract(in,pat,\"\\\\0\",&out);\n to_print=&out;\n\n } else {\n matched = RE2::PartialMatch(in,pat);\n to_print= ∈\n }\n to_print=(matched^o_negate_match)?to_print:NULL;\n } else if(argc==4) {\n \/\/ re2g str pat rep\n \/\/ ignores o_print_match\n\n std::string rep = std::string(argv[3]);\n\n \/\/ need to pick: (-o) Extract, (default)Replace, (-g)GlobalReplace\n \/\/ also, print non matching lines? (-p)\n if(o_print_match && !o_global){\n matched = RE2::Extract(in,pat,rep,&out);\n to_print=&out;\n } else if(o_global && !o_print_match) {\n matched = RE2::GlobalReplace(&in,pat,rep);\n to_print=∈\n } else if(o_global && o_print_match){\n matched = ExtractAll(in,pat,rep,&out);\n to_print=&out;\n } else {\n matched = RE2::Replace(&in,pat,rep);\n to_print=∈\n }\n to_print=(matched ^ o_negate_match)?to_print:NULL;\n\n if(o_also_print_unreplaced && !to_print){\n out = std::string(argv[1]);\n to_print = & out;\n }\n } else {\n std::cout << RE2::PartialMatch(\"f\", \"f\") << std::endl;\n std::cout << RE2::PartialMatch(\"fred\", \"z\") << std::endl;\n std::cout << RE2::PartialMatch(\"fred\", \"[fz]\") << std::endl;\n }\n if(to_print){\n std::cout << *to_print << std::endl;\n } else {\n std::cout << std::endl;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>`SymbiontMaterial`: remove obsolete member function declarations.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include \"XalanTransformerDefinitions.hpp\"\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <cassert>\n#if defined(XALAN_OLD_STREAM_HEADERS)\n#include <strstream.h>\n#else\n#include <strstream>\n#endif\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\nusing std::istrstream;\n#endif\n\n\n\n#include \"XalanCAPI.h\"\n#include \"XalanTransformer.hpp\"\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanInitialize()\n{\n\t\/\/ Call the static initializer for Xerces.\n\tXMLPlatformUtils::Initialize();\n\n\t\/\/ Initialize Xalan.\n\tXalanTransformer::initialize();\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanTerminate()\n{\n\t\/\/ Terminate Xalan.\n\tXalanTransformer::terminate();\n\n\t\/\/ Call the static terminator for Xerces.\n\tXMLPlatformUtils::Terminate();\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(XalanHandle)\nCreateXalanTransformer()\n{\t\n\t\/\/ Create a XalanTransformer object.\n\treturn new XalanTransformer();\n}\n\n\n\ninline XalanTransformer*\ngetTransformer(XalanHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (XalanTransformer*)theHandle;\n#else\n\treturn static_cast<XalanTransformer*>(theHandle);\n#endif\n}\n\n\n\ninline const XalanCompiledStylesheet*\ngetStylesheet(XalanCSSHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (const XalanCompiledStylesheet*)theHandle;\n#else\n\treturn reinterpret_cast<const XalanCompiledStylesheet*>(theHandle);\n#endif\n}\n\n\n\ninline const XalanParsedSource*\ngetParsedSource(XalanPSHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (const XalanParsedSource*)theHandle;\n#else\n\treturn reinterpret_cast<const XalanParsedSource*>(theHandle);\n#endif\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nDeleteXalanTransformer(XalanHandle theXalanHandle)\n{\n\t\/\/ Delete a XalanTransformer object.\n\tdelete getTransformer(theXalanHandle);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToFile(\n\t\t\tconst char*\t\ttheXMLFileName, \n\t\t\tconst char*\t\ttheXSLFileName,\n\t\t\tconst char*\t\ttheOutFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\tif(theXSLFileName == 0)\n\t{\n\t\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheOutFileName);\n\t}\n\telse\n\t{\n\t\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutFileName);\n\t}\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToFilePrebuilt(\n\t\t\tXalanPSHandle\ttheParsedSource, \n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tconst char*\t\ttheOutFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\t\t*getParsedSource(theParsedSource),\n\t\t\t\tgetStylesheet(theCSSHandle),\n\t\t\t\ttheOutFileName);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToData(\n\t\t\tconst char*\t\ttheXMLFileName, \n\t\t\tconst char*\t\ttheXSLFileName,\n\t\t\tchar**\t\t\ttheOutput,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::ostrstream;\n#endif\n\n\tint\tstatus = 0;\t\t\n\n\tostrstream\ttheOutputStream;\t\n\n\tif(theXSLFileName == 0)\n\t{\n\t\tstatus = getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheOutputStream);\n\t}\n\telse\n\t{\n\t\tstatus = getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutputStream);\n\t}\n\n\tif (status == 0)\n\t{\n\t\t\/\/ Null-terminate the data.\n\t\ttheOutputStream << '\\0';\n\n\t\t*theOutput = theOutputStream.str();\n\t}\n\n\treturn status;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToDataPrebuilt(\n\t\t\tXalanPSHandle\ttheParsedSource, \n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tchar**\t\t\ttheOutput,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::ostrstream;\n#endif\n\n\tostrstream\ttheOutputStream;\t\n\n\t\/\/ Do the transformation...\n\tconst int\tstatus =\n\t\tgetTransformer(theXalanHandle)->transform(\n\t\t\t*getParsedSource(theParsedSource),\n\t\t\tgetStylesheet(theCSSHandle),\n\t\t\ttheOutputStream);\n\n\tif (status == 0)\n\t{\n\t\t\/\/ Null-terminate the data.\n\t\ttheOutputStream << '\\0';\n\n\t\t*theOutput = theOutputStream.str();\n\t}\n\n\treturn status;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanFreeData(char*\ttheStream)\n{\n\t\/\/ Delete the data.\n\tdelete[] theStream;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int) \nXalanTransformToHandler(\n\t\t\tconst char*\t\t\t\ttheXMLFileName,\n\t\t\tconst char*\t\t\t\ttheXSLFileName,\n\t\t\tXalanHandle\t\t\t\ttheXalanHandle,\n\t\t\tvoid*\t\t\t\t\ttheOutputHandle,\n\t\t\tXalanOutputHandlerType\ttheOutputHandler,\n\t\t\tXalanFlushHandlerType\ttheFlushHandler)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutputHandle,\n\t\t\ttheOutputHandler,\n\t\t\ttheFlushHandler);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int) \nXalanTransformToHandlerPrebuilt(\n\t\t\tXalanPSHandle\t\t\ttheParsedSource,\n\t\t\tXalanCSSHandle\t\t\ttheCSSHandle,\n\t\t\tXalanHandle\t\t\t\ttheXalanHandle,\n\t\t\tvoid*\t\t\t\t\ttheOutputHandle,\n\t\t\tXalanOutputHandlerType\ttheOutputHandler,\n\t\t\tXalanFlushHandlerType\ttheFlushHandler)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\t*getParsedSource(theParsedSource),\n\t\t\tgetStylesheet(theCSSHandle),\n\t\t\ttheOutputHandle,\n\t\t\ttheOutputHandler,\n\t\t\ttheFlushHandler);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanCompileStylesheet(\n\t\t\tconst char*\t\t\ttheXSLFileName,\n\t\t\tXalanHandle\t\t\ttheXalanHandle,\n\t\t\tXalanCSSHandle*\t\ttheCSSHandle)\n{\n\tconst XalanCompiledStylesheet*\ttheCompiledStylesheet = 0;\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->compileStylesheet(\n\t\t\ttheXSLFileName,\n\t\t\ttheCompiledStylesheet);\n\n\tif (theResult == 0)\n\t{\n\t\t*theCSSHandle = theCompiledStylesheet;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanCompileStylesheetFromStream(\n\t\t\tconst char*\t\t\ttheXSLStream,\n\t\t\tunsigned long\t\ttheXSLStreamLength,\n\t\t\tXalanHandle\t\t\ttheXalanHandle,\n\t\t\tXalanCSSHandle*\t\ttheCSSHandle)\n{\n\tconst XalanCompiledStylesheet*\ttheCompiledStylesheet = 0;\n\n\tistrstream\ttheInputStream(theXSLStream, theXSLStreamLength);\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->compileStylesheet(\n\t\t\t&theInputStream,\n\t\t\ttheCompiledStylesheet);\n\n\tif (theResult == 0)\n\t{\n\t\t*theCSSHandle = theCompiledStylesheet;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanDestroyCompiledStylesheet(\n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\treturn getTransformer(theXalanHandle)->destroyStylesheet(getStylesheet(theCSSHandle));\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanParseSource(\n\t\t\tconst char*\t\ttheXMLFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle,\n\t\t\tXalanPSHandle*\tthePSHandle)\n{\n\tconst XalanParsedSource*\ttheParsedSource = 0;\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->parseSource(\n\t\t\ttheXMLFileName,\n\t\t\ttheParsedSource);\n\n\tif (theResult == 0)\n\t{\n\t\t*thePSHandle = theParsedSource;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanParseSourceFromStream(\n\t\t\tconst char*\t\ttheXMLStream,\n\t\t\tunsigned long\ttheXMLStreamLength,\n\t\t\tXalanHandle\t\ttheXalanHandle,\n\t\t\tXalanPSHandle*\tthePSHandle)\n{\n\tconst XalanParsedSource*\ttheParsedSource = 0;\n\n\tistrstream\ttheInputStream(theXMLStream, theXMLStreamLength);\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->parseSource(\n\t\t\t&theInputStream,\n\t\t\ttheParsedSource);\n\n\tif (theResult == 0)\n\t{\n\t\t*thePSHandle = theParsedSource;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanSetStylesheetParam(\n\t\t\tconst char*\t\tkey,\n\t\t\tconst char*\t\texpression,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\tgetTransformer(theXalanHandle)->setStylesheetParam(\n\t\tXalanDOMString(key),\n\t\tXalanDOMString(expression));\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(XalanCCharPtr)\nXalanGetLastError(XalanHandle theXalanHandle)\n{\n\t\/\/ Get the last error.\n\treturn getTransformer(theXalanHandle)->getLastError();\n}\n<commit_msg>Added missing implementation.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 2000 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include \"XalanTransformerDefinitions.hpp\"\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <cassert>\n#if defined(XALAN_OLD_STREAM_HEADERS)\n#include <strstream.h>\n#else\n#include <strstream>\n#endif\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\nusing std::istrstream;\n#endif\n\n\n\n#include \"XalanCAPI.h\"\n#include \"XalanTransformer.hpp\"\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanInitialize()\n{\n\t\/\/ Call the static initializer for Xerces.\n\tXMLPlatformUtils::Initialize();\n\n\t\/\/ Initialize Xalan.\n\tXalanTransformer::initialize();\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanTerminate()\n{\n\t\/\/ Terminate Xalan.\n\tXalanTransformer::terminate();\n\n\t\/\/ Call the static terminator for Xerces.\n\tXMLPlatformUtils::Terminate();\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(XalanHandle)\nCreateXalanTransformer()\n{\t\n\t\/\/ Create a XalanTransformer object.\n\treturn new XalanTransformer();\n}\n\n\n\ninline XalanTransformer*\ngetTransformer(XalanHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (XalanTransformer*)theHandle;\n#else\n\treturn static_cast<XalanTransformer*>(theHandle);\n#endif\n}\n\n\n\ninline const XalanCompiledStylesheet*\ngetStylesheet(XalanCSSHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (const XalanCompiledStylesheet*)theHandle;\n#else\n\treturn reinterpret_cast<const XalanCompiledStylesheet*>(theHandle);\n#endif\n}\n\n\n\ninline const XalanParsedSource*\ngetParsedSource(XalanPSHandle\ttheHandle)\n{\n\tassert(theHandle != 0);\n\n#if defined(XALAN_OLD_STYLE_CASTS)\n\treturn (const XalanParsedSource*)theHandle;\n#else\n\treturn reinterpret_cast<const XalanParsedSource*>(theHandle);\n#endif\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nDeleteXalanTransformer(XalanHandle theXalanHandle)\n{\n\t\/\/ Delete a XalanTransformer object.\n\tdelete getTransformer(theXalanHandle);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToFile(\n\t\t\tconst char*\t\ttheXMLFileName, \n\t\t\tconst char*\t\ttheXSLFileName,\n\t\t\tconst char*\t\ttheOutFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\tif(theXSLFileName == 0)\n\t{\n\t\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheOutFileName);\n\t}\n\telse\n\t{\n\t\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutFileName);\n\t}\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToFilePrebuilt(\n\t\t\tXalanPSHandle\ttheParsedSource, \n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tconst char*\t\ttheOutFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\t\t*getParsedSource(theParsedSource),\n\t\t\t\tgetStylesheet(theCSSHandle),\n\t\t\t\ttheOutFileName);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToData(\n\t\t\tconst char*\t\ttheXMLFileName, \n\t\t\tconst char*\t\ttheXSLFileName,\n\t\t\tchar**\t\t\ttheOutput,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::ostrstream;\n#endif\n\n\tint\tstatus = 0;\t\t\n\n\tostrstream\ttheOutputStream;\t\n\n\tif(theXSLFileName == 0)\n\t{\n\t\tstatus = getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheOutputStream);\n\t}\n\telse\n\t{\n\t\tstatus = getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutputStream);\n\t}\n\n\tif (status == 0)\n\t{\n\t\t\/\/ Null-terminate the data.\n\t\ttheOutputStream << '\\0';\n\n\t\t*theOutput = theOutputStream.str();\n\t}\n\n\treturn status;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanTransformToDataPrebuilt(\n\t\t\tXalanPSHandle\ttheParsedSource, \n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tchar**\t\t\ttheOutput,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::ostrstream;\n#endif\n\n\tostrstream\ttheOutputStream;\t\n\n\t\/\/ Do the transformation...\n\tconst int\tstatus =\n\t\tgetTransformer(theXalanHandle)->transform(\n\t\t\t*getParsedSource(theParsedSource),\n\t\t\tgetStylesheet(theCSSHandle),\n\t\t\ttheOutputStream);\n\n\tif (status == 0)\n\t{\n\t\t\/\/ Null-terminate the data.\n\t\ttheOutputStream << '\\0';\n\n\t\t*theOutput = theOutputStream.str();\n\t}\n\n\treturn status;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanFreeData(char*\ttheStream)\n{\n\t\/\/ Delete the data.\n\tdelete[] theStream;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int) \nXalanTransformToHandler(\n\t\t\tconst char*\t\t\t\ttheXMLFileName,\n\t\t\tconst char*\t\t\t\ttheXSLFileName,\n\t\t\tXalanHandle\t\t\t\ttheXalanHandle,\n\t\t\tvoid*\t\t\t\t\ttheOutputHandle,\n\t\t\tXalanOutputHandlerType\ttheOutputHandler,\n\t\t\tXalanFlushHandlerType\ttheFlushHandler)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\ttheXMLFileName,\n\t\t\ttheXSLFileName,\n\t\t\ttheOutputHandle,\n\t\t\ttheOutputHandler,\n\t\t\ttheFlushHandler);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int) \nXalanTransformToHandlerPrebuilt(\n\t\t\tXalanPSHandle\t\t\ttheParsedSource,\n\t\t\tXalanCSSHandle\t\t\ttheCSSHandle,\n\t\t\tXalanHandle\t\t\t\ttheXalanHandle,\n\t\t\tvoid*\t\t\t\t\ttheOutputHandle,\n\t\t\tXalanOutputHandlerType\ttheOutputHandler,\n\t\t\tXalanFlushHandlerType\ttheFlushHandler)\n{\n\t\/\/ Do the transformation...\n\treturn getTransformer(theXalanHandle)->transform(\n\t\t\t*getParsedSource(theParsedSource),\n\t\t\tgetStylesheet(theCSSHandle),\n\t\t\ttheOutputHandle,\n\t\t\ttheOutputHandler,\n\t\t\ttheFlushHandler);\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanCompileStylesheet(\n\t\t\tconst char*\t\t\ttheXSLFileName,\n\t\t\tXalanHandle\t\t\ttheXalanHandle,\n\t\t\tXalanCSSHandle*\t\ttheCSSHandle)\n{\n\tconst XalanCompiledStylesheet*\ttheCompiledStylesheet = 0;\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->compileStylesheet(\n\t\t\ttheXSLFileName,\n\t\t\ttheCompiledStylesheet);\n\n\tif (theResult == 0)\n\t{\n\t\t*theCSSHandle = theCompiledStylesheet;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanCompileStylesheetFromStream(\n\t\t\tconst char*\t\t\ttheXSLStream,\n\t\t\tunsigned long\t\ttheXSLStreamLength,\n\t\t\tXalanHandle\t\t\ttheXalanHandle,\n\t\t\tXalanCSSHandle*\t\ttheCSSHandle)\n{\n\tconst XalanCompiledStylesheet*\ttheCompiledStylesheet = 0;\n\n\tistrstream\ttheInputStream(theXSLStream, theXSLStreamLength);\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->compileStylesheet(\n\t\t\t&theInputStream,\n\t\t\ttheCompiledStylesheet);\n\n\tif (theResult == 0)\n\t{\n\t\t*theCSSHandle = theCompiledStylesheet;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanDestroyCompiledStylesheet(\n\t\t\tXalanCSSHandle\ttheCSSHandle,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\treturn getTransformer(theXalanHandle)->destroyStylesheet(getStylesheet(theCSSHandle));\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanParseSource(\n\t\t\tconst char*\t\ttheXMLFileName,\n\t\t\tXalanHandle\t\ttheXalanHandle,\n\t\t\tXalanPSHandle*\tthePSHandle)\n{\n\tconst XalanParsedSource*\ttheParsedSource = 0;\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->parseSource(\n\t\t\ttheXMLFileName,\n\t\t\ttheParsedSource);\n\n\tif (theResult == 0)\n\t{\n\t\t*thePSHandle = theParsedSource;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanParseSourceFromStream(\n\t\t\tconst char*\t\ttheXMLStream,\n\t\t\tunsigned long\ttheXMLStreamLength,\n\t\t\tXalanHandle\t\ttheXalanHandle,\n\t\t\tXalanPSHandle*\tthePSHandle)\n{\n\tconst XalanParsedSource*\ttheParsedSource = 0;\n\n\tistrstream\ttheInputStream(theXMLStream, theXMLStreamLength);\n\n\tconst int\ttheResult =\n\t\tgetTransformer(theXalanHandle)->parseSource(\n\t\t\t&theInputStream,\n\t\t\ttheParsedSource);\n\n\tif (theResult == 0)\n\t{\n\t\t*thePSHandle = theParsedSource;\n\t}\n\n\treturn theResult;\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(int)\nXalanDestroyParsedSource(\n\t\t\tXalanPSHandle\tthePSHandle,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\treturn getTransformer(theXalanHandle)->destroyParsedSource(getParsedSource(thePSHandle));\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(void)\nXalanSetStylesheetParam(\n\t\t\tconst char*\t\tkey,\n\t\t\tconst char*\t\texpression,\n\t\t\tXalanHandle\t\ttheXalanHandle)\n{\n\tgetTransformer(theXalanHandle)->setStylesheetParam(\n\t\tXalanDOMString(key),\n\t\tXalanDOMString(expression));\n}\n\n\n\nXALAN_TRANSFORMER_EXPORT_FUNCTION(XalanCCharPtr)\nXalanGetLastError(XalanHandle theXalanHandle)\n{\n\t\/\/ Get the last error.\n\treturn getTransformer(theXalanHandle)->getLastError();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <sstream>\n#include \"linkedBinaryTree.h\"\n\n\nusing namespace std;\n\nvoid linkedBinaryTree :: consturctTree(int *in, int *post)\n{\n\n \/\/ construct bst from inorder and postorder\n \/\/ http:\/\/www.programcreek.com\/2013\/01\/construct-binary-tree-from-inorder-and-postorder-traversal\/\n \n}\n\n\n\nint linkedBinaryTree :: maxHeightDifference()\n{\n\/\/write your code here\n\n\n return 0;\n\n\n\n}\n\nvoid linkedBinaryTree :: preOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tvisit(t);\n\t\tpreOrder(t->leftChild);\n\t\tpreOrder(t->rightChild);\n\t}\n}\n\n\nvoid linkedBinaryTree :: inOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tinOrder(t->leftChild);\n\t\tvisit(t);\n\t\tinOrder(t->rightChild);\n\t}\n}\n\n\nvoid linkedBinaryTree :: postOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tpostOrder(t->leftChild);\n\t\tpostOrder(t->rightChild);\n\t\tvisit(t);\n\t}\n}\n\n\nvoid linkedBinaryTree :: visit(binaryTreeNode *t)\n{\n\n\tcout << t->element << \" \";\n\n}\n\nint linkedBinaryTree :: height(binaryTreeNode *t)\n{\n\n\tif(t == NULL)\n\t\treturn 0;\n\tint hl = height(t->leftChild);\n\tint hr = height(t->rightChild);\n\tif (hl > hr)\n\t\treturn ++hl;\n\telse\n\t\treturn ++hr;\n\n\n}\n\n\n\n<commit_msg>part of construct<commit_after>#include <iostream>\n#include <sstream>\n#include \"linkedBinaryTree.h\"\n\n\nusing namespace std;\n\nvoid linkedBinaryTree :: consturctTree(int *in, int *post)\n{\n\n\t\/\/ from email:\n\t\/\/ In Assignment 4, in the construct tree method as the array length is not passed, you can assume it to be hardcoded as 17.\n\n\t\/\/ get root\n\tint newRoot = post[16];\n\troot = new binaryTreeNode(newRoot);\n\n\t\/\/ find position of root in inorder, derive left and right sub trees\n\tint rootPosition = 0;\n\n\tfor (int i = 0; i < 17; i++) {\n\t\tif (in[i] == newRoot) {\n\t\t\trootPosition = i + 1;\n\t\t}\n\t}\n\n\t\/\/ insert left side\n\tfor (int j = 0; j < rootPosition; j++) {\n\n\t}\n\n\t\/\/ insert right side\n\tfor (int k = 0; k < 17 - rootPosition; k++) {\n\n\t}\n}\n\n\n\nint linkedBinaryTree :: maxHeightDifference()\n{\n\/\/write your code here\n\n\n return 0;\n\n\n\n}\n\nvoid linkedBinaryTree :: preOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tvisit(t);\n\t\tpreOrder(t->leftChild);\n\t\tpreOrder(t->rightChild);\n\t}\n}\n\n\nvoid linkedBinaryTree :: inOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tinOrder(t->leftChild);\n\t\tvisit(t);\n\t\tinOrder(t->rightChild);\n\t}\n}\n\n\nvoid linkedBinaryTree :: postOrder(binaryTreeNode *t)\n{\n\tif(t != NULL)\n\t{\n\t\tpostOrder(t->leftChild);\n\t\tpostOrder(t->rightChild);\n\t\tvisit(t);\n\t}\n}\n\n\nvoid linkedBinaryTree :: visit(binaryTreeNode *t)\n{\n\n\tcout << t->element << \" \";\n\n}\n\nint linkedBinaryTree :: height(binaryTreeNode *t)\n{\n\n\tif(t == NULL)\n\t\treturn 0;\n\tint hl = height(t->leftChild);\n\tint hr = height(t->rightChild);\n\tif (hl > hr)\n\t\treturn ++hl;\n\telse\n\t\treturn ++hr;\n\n\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2009 Adenilson Cavalcanti <savagobr@yahoo.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; by version 2 of the License or (at your\n * choice) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\n#include \"gcalresource.h\"\n#include \"settings.h\"\n#include \"settingsadaptor.h\"\n\n#include <QtDBus\/QDBusConnection>\n#include <kabc\/addressee.h>\n#include <kabc\/phonenumber.h>\n#include <kabc\/key.h>\n#include <kabc\/errorhandler.h>\n#include <kcal\/event.h>\n#include <kdatetime.h>\n#include <qstring.h>\n#include <KWindowSystem>\n#include <akonadi\/changerecorder.h>\n#include <akonadi\/itemfetchscope.h>\n#include <KUrl>\n\nextern \"C\" {\n#include <gcalendar.h>\n#include <gcal_status.h>\n}\n\nusing namespace Akonadi;\n\nGCalResource::GCalResource( const QString &id )\n\t: ResourceBase(id)\n{\n\tnew SettingsAdaptor( Settings::self() );\n\tQDBusConnection::sessionBus().registerObject(\n\t\tQLatin1String( \"\/Settings\" ), Settings::self(),\n\t\tQDBusConnection::ExportAdaptors );\n\n\tchangeRecorder()->itemFetchScope().fetchFullPayload();\n\n if (!(gcal = gcal_new(GCALENDAR)))\n\t\texit(1);\n gcal_set_store_xml(gcal, 1);\n all_events.length = 0;\n all_events.entries = NULL;\n}\n\nGCalResource::~GCalResource()\n{\n gcal_cleanup_events(&all_events);\n pending.clear();\n deleted.clear();\n}\n\nvoid GCalResource::retrieveTimestamp(QString ×tamp)\n{\n\ttimestamp = Settings::self()->timestamp();\n}\n\nvoid GCalResource::saveTimestamp(QString ×tamp)\n{\n Settings::self()->setTimestamp(timestamp);\n Settings::self()->writeConfig();\n}\n\n\nvoid GCalResource::retrieveCollections()\n{\n if(!authenticated) {\n\t\tkError() << \"No authentication for Google Calendar available\";\n const QString message = i18nc(\"@info: status\",\n\t\t\t\t\t \"Not yet authenticated for \"\n\t\t\t\t\t \"use of Google Calendar\");\n\n emit error(message);\n\n emit status(Broken, message);\n return;\n }\n\n Collection c;\n c.setParent(Collection::root());\n c.setRemoteId(\"google-calendar\");\n c.setName(name());\n\n QStringList mimeTypes;\n mimeTypes << \"text\/calendar\";\n c.setContentMimeTypes(mimeTypes);\n\n Collection::List list;\n list << c;\n collectionsRetrieved(list);\n}\n\nvoid GCalResource::retrieveItems( const Akonadi::Collection &collection )\n{\n\tQ_UNUSED(collection);\n\tItem::List items;\n\tint result;\n\tgcal_event_t event;\n\tQString timestamp;\n\tQByteArray t_byte;\n\n\tkError() << \"\\n............. retrieveItems ...........\\n\";\n\tif (!authenticated) {\n\t\tkError() << \"No authentication for Google calendar available\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Not yet authenticated for\"\n\t\t\t\t\t \" use of Google calendar\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\t}\n\n\t\/* Query by updated *\/\n\tretrieveTimestamp(timestamp);\n\tt_byte = timestamp.toLocal8Bit();\n\tif (t_byte.length() > TIMESTAMP_SIZE) {\n\t\t\/\/TODO: implement getUpdated\n\t\t\/\/result = getUpdated(t_byte.data());\n\t\treturn;\n\t}\n\tkError() << \"First retrieve\";\n\n\tif ((result = gcal_get_events(gcal, &all_events)))\n\t\texit(1);\n\n\t\/* GCalendar returns last updated entry as first element *\/\n\tevent = gcal_event_element(&all_events, 0);\n\tif (!event) {\n\t\tkError() << \"Failed to retrieve last updated event.\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Failed getting last updated\"\n\t\t\t\t\t \" event\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\n\t}\n\n\ttimestamp = gcal_event_get_updated(event);\n\tsaveTimestamp(timestamp);\n\n\t\/* Each google entry has a unique ID and edit_url *\/\n\tfor (size_t i = 0; i < all_events.length; ++i) {\n\t\tItem item(QLatin1String(\"text\/calendar\"));\n\t\tKCal::Event kevent;\n\t\tQString temp;\n\t\tevent = gcal_event_element(&all_events, i);\n\n\t\ttemp = gcal_event_get_title(event);\n\t\tkevent.setSummary(temp);\n\n\t\ttemp = gcal_event_get_where(event);\n\t\tkevent.setLocation(temp);\n\n\t\tKCal::Incidence::Status status;\n\t\tif (gcal_event_is_deleted(event))\n\t\t\tstatus = KCal::Incidence::StatusCanceled;\n\t\telse\n\t\t\tstatus = KCal::Incidence::StatusConfirmed;\n\t\tkevent.setStatus(status);\n\n\t\ttemp = gcal_event_get_content(event);\n\t\tkevent.setDescription(temp);\n\n\t\tKDateTime start, end;\n\t\ttemp = gcal_event_get_start(event);\n\t\tstart.fromString(temp);\n\t\ttemp = gcal_event_get_end(event);\n\t\tend.fromString(temp);\n\t\tkevent.setDtStart(start);\n\t\tkevent.setDtEnd(end);\n\n\t\titems << item;\n\t}\n\n\titemsRetrieved(items);\n}\n\nbool GCalResource::retrieveItem( const Akonadi::Item &item, const QSet<QByteArray> &parts )\n{\n\tQ_UNUSED(parts);\n\tQ_UNUSED(item);\n\treturn true;\n}\n\nvoid GCalResource::aboutToQuit()\n{\n\t\/\/ TODO: any cleanup you need to do while there is still an active\n\t\/\/ event loop. The resource will terminate after this method returns\n}\n\nvoid GCalResource::doSetOnline(bool online)\n{\n\tQ_UNUSED(online);\n}\n\nint GCalResource::getUpdated(char *timestamp)\n{\n\tQ_UNUSED(timestamp);\n\n\treturn -1;\n}\n\nvoid GCalResource::configure( WId windowId )\n{\n\tint result = 0;\n\tif (windowId && dlgConf)\n\t\tKWindowSystem::setMainWindow(dlgConf, windowId);\n\n\tdlgConf->exec();\n\tif (!(result = authenticate(dlgConf->eAccount->text(),\n\t\t\t\t dlgConf->ePass->text()))) {\n\t\tresult = saveToWallet(dlgConf->eAccount->text(),\n\t\t\t\t dlgConf->ePass->text(),\n\t\t\t\t windowId);\n\n\t\tsynchronize();\n\t}\n\n\tif (result) {\n\t\tkError() << \"Failed configuring resource.\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Invalid password.\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\t}\n}\n\nvoid GCalResource::itemAdded( const Akonadi::Item &item, const Akonadi::Collection &collection )\n{\n\tQ_UNUSED(collection);\n\n gcal_event_t event;\n KCal::Event kevent;\n QByteArray t_byte;\n QString temp;\n\n if (!authenticated) {\n kError() << \"No authentication for Google calendar available\";\n const QString message = i18nc(\"@info:status\",\n \"Not yet authenticated for\"\n \" use of Google calendar\");\n emit error(message);\n emit status(Broken, message);\n return;\n }\n\n if(item.hasPayload<KCal::Event>())\n kevent = item.payload<KCal::Event>();\n\n if (!(event = gcal_event_new(NULL))) {\n kError() << \"Memory allocation error!\";\n const QString message = i18nc(\"@info:status\",\n \"Failed to create gcal_event\");\n emit error(message);\n emit status(Broken, message);\n return;\n }\n\n temp = kevent.summary();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_title(event, t_byte);\n }\n\n temp = kevent.description();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_content(event, t_byte);\n }\n \/\/TODO: event start, event end, status, url, id and etags\n\n temp = kevent.location();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_where(event, t_byte);\n }\n}\n\nvoid GCalResource::itemChanged( const Akonadi::Item &item, const QSet<QByteArray> &parts )\n{\n\tQ_UNUSED(parts);\n\tQ_UNUSED(item);\n}\n\nvoid GCalResource::itemRemoved( const Akonadi::Item &item )\n{\n\tQ_UNUSED(item);\n}\n\nAKONADI_RESOURCE_MAIN( GCalResource )\n\n#include \"gcalresource.moc\"\n<commit_msg>Formating and commenting soon-to-be-used-code.<commit_after>\/* Copyright (C) 2009 Adenilson Cavalcanti <savagobr@yahoo.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; by version 2 of the License or (at your\n * choice) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *\/\n\n#include \"gcalresource.h\"\n#include \"settings.h\"\n#include \"settingsadaptor.h\"\n\n#include <QtDBus\/QDBusConnection>\n#include <kabc\/addressee.h>\n#include <kabc\/phonenumber.h>\n#include <kabc\/key.h>\n#include <kabc\/errorhandler.h>\n#include <kcal\/event.h>\n#include <kdatetime.h>\n#include <qstring.h>\n#include <KWindowSystem>\n#include <akonadi\/changerecorder.h>\n#include <akonadi\/itemfetchscope.h>\n#include <KUrl>\n\nextern \"C\" {\n#include <gcalendar.h>\n#include <gcal_status.h>\n}\n\nusing namespace Akonadi;\n\nGCalResource::GCalResource( const QString &id )\n\t: ResourceBase(id)\n{\n\tnew SettingsAdaptor( Settings::self() );\n\tQDBusConnection::sessionBus().registerObject(\n\t\tQLatin1String( \"\/Settings\" ), Settings::self(),\n\t\tQDBusConnection::ExportAdaptors );\n\n\tchangeRecorder()->itemFetchScope().fetchFullPayload();\n\n\tif (!(gcal = gcal_new(GCALENDAR)))\n\t\texit(1);\n\tgcal_set_store_xml(gcal, 1);\n\tall_events.length = 0;\n\tall_events.entries = NULL;\n}\n\nGCalResource::~GCalResource()\n{\n\tgcal_cleanup_events(&all_events);\n\tpending.clear();\n\tdeleted.clear();\n}\n\nvoid GCalResource::retrieveTimestamp(QString ×tamp)\n{\n\ttimestamp = Settings::self()->timestamp();\n}\n\nvoid GCalResource::saveTimestamp(QString ×tamp)\n{\n\tSettings::self()->setTimestamp(timestamp);\n\tSettings::self()->writeConfig();\n}\n\n\nvoid GCalResource::retrieveCollections()\n{\n if (!authenticated) {\n\t kError() << \"No authentication for Google Calendar available\";\n\t const QString message = i18nc(\"@info: status\",\n\t\t\t\t\t \"Not yet authenticated for \"\n\t\t\t\t\t \"use of Google Calendar\");\n\n\t emit error(message);\n\n\t emit status(Broken, message);\n\t return;\n }\n\n Collection c;\n c.setParent(Collection::root());\n c.setRemoteId(\"google-calendar\");\n c.setName(name());\n\n QStringList mimeTypes;\n mimeTypes << \"text\/calendar\";\n c.setContentMimeTypes(mimeTypes);\n\n Collection::List list;\n list << c;\n collectionsRetrieved(list);\n}\n\nvoid GCalResource::retrieveItems( const Akonadi::Collection &collection )\n{\n\tQ_UNUSED(collection);\n\tItem::List items;\n\tint result;\n\tgcal_event_t event;\n\tQString timestamp;\n\tQByteArray t_byte;\n\n\tkError() << \"\\n............. retrieveItems ...........\\n\";\n\tif (!authenticated) {\n\t\tkError() << \"No authentication for Google calendar available\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Not yet authenticated for\"\n\t\t\t\t\t \" use of Google calendar\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\t}\n\n\t\/* Query by updated *\/\n\/\/ \tretrieveTimestamp(timestamp);\n\/\/ \tt_byte = timestamp.toLocal8Bit();\n\/\/ \tif (t_byte.length() > TIMESTAMP_SIZE) {\n\/\/ \t\t\/\/TODO: implement getUpdated\n\/\/ \t\t\/\/result = getUpdated(t_byte.data());\n\/\/ \t\treturn;\n\/\/ \t}\n\tkError() << \"First retrieve\";\n\n\tif ((result = gcal_get_events(gcal, &all_events)))\n\t\texit(1);\n\n\t\/* GCalendar returns last updated entry as first element *\/\n\tevent = gcal_event_element(&all_events, 0);\n\tif (!event) {\n\t\tkError() << \"Failed to retrieve last updated event.\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Failed getting last updated\"\n\t\t\t\t\t \" event\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\n\t}\n\n\ttimestamp = gcal_event_get_updated(event);\n\tsaveTimestamp(timestamp);\n\n\t\/* Each google entry has a unique ID and edit_url *\/\n\tfor (size_t i = 0; i < all_events.length; ++i) {\n\t\tItem item(QLatin1String(\"text\/calendar\"));\n\t\tKCal::Event kevent;\n\t\tQString temp;\n\t\tevent = gcal_event_element(&all_events, i);\n\n\t\ttemp = gcal_event_get_title(event);\n\t\tkevent.setSummary(temp);\n\n\t\ttemp = gcal_event_get_where(event);\n\t\tkevent.setLocation(temp);\n\n\t\tKCal::Incidence::Status status;\n\t\tif (gcal_event_is_deleted(event))\n\t\t\tstatus = KCal::Incidence::StatusCanceled;\n\t\telse\n\t\t\tstatus = KCal::Incidence::StatusConfirmed;\n\t\tkevent.setStatus(status);\n\n\t\ttemp = gcal_event_get_content(event);\n\t\tkevent.setDescription(temp);\n\n\t\tKDateTime start, end;\n\t\ttemp = gcal_event_get_start(event);\n\t\tstart.fromString(temp);\n\t\ttemp = gcal_event_get_end(event);\n\t\tend.fromString(temp);\n\t\tkevent.setDtStart(start);\n\t\tkevent.setDtEnd(end);\n\n\t\titems << item;\n\t}\n\n\titemsRetrieved(items);\n}\n\nbool GCalResource::retrieveItem( const Akonadi::Item &item, const QSet<QByteArray> &parts )\n{\n\tQ_UNUSED(parts);\n\tQ_UNUSED(item);\n\treturn true;\n}\n\nvoid GCalResource::aboutToQuit()\n{\n\t\/\/ TODO: any cleanup you need to do while there is still an active\n\t\/\/ event loop. The resource will terminate after this method returns\n}\n\nvoid GCalResource::doSetOnline(bool online)\n{\n\tQ_UNUSED(online);\n}\n\nint GCalResource::getUpdated(char *timestamp)\n{\n\tQ_UNUSED(timestamp);\n\n\treturn -1;\n}\n\nvoid GCalResource::configure( WId windowId )\n{\n\tint result = 0;\n\tif (windowId && dlgConf)\n\t\tKWindowSystem::setMainWindow(dlgConf, windowId);\n\n\tdlgConf->exec();\n\tif (!(result = authenticate(dlgConf->eAccount->text(),\n\t\t\t\t dlgConf->ePass->text()))) {\n\t\tresult = saveToWallet(dlgConf->eAccount->text(),\n\t\t\t\t dlgConf->ePass->text(),\n\t\t\t\t windowId);\n\n\t\tsynchronize();\n\t}\n\n\tif (result) {\n\t\tkError() << \"Failed configuring resource.\";\n\t\tconst QString message = i18nc(\"@info:status\",\n\t\t\t\t\t \"Invalid password.\");\n\t\temit error(message);\n\t\temit status(Broken, message);\n\t\treturn;\n\t}\n}\n\nvoid GCalResource::itemAdded( const Akonadi::Item &item, const Akonadi::Collection &collection )\n{\n\tQ_UNUSED(collection);\n\n gcal_event_t event;\n KCal::Event kevent;\n QByteArray t_byte;\n QString temp;\n\n if (!authenticated) {\n kError() << \"No authentication for Google calendar available\";\n const QString message = i18nc(\"@info:status\",\n \"Not yet authenticated for\"\n \" use of Google calendar\");\n emit error(message);\n emit status(Broken, message);\n return;\n }\n\n if(item.hasPayload<KCal::Event>())\n kevent = item.payload<KCal::Event>();\n\n if (!(event = gcal_event_new(NULL))) {\n kError() << \"Memory allocation error!\";\n const QString message = i18nc(\"@info:status\",\n \"Failed to create gcal_event\");\n emit error(message);\n emit status(Broken, message);\n return;\n }\n\n temp = kevent.summary();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_title(event, t_byte);\n }\n\n temp = kevent.description();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_content(event, t_byte);\n }\n \/\/TODO: event start, event end, status, url, id and etags\n\n temp = kevent.location();\n if(!temp.length()) {\n t_byte = temp.toLocal8Bit();\n gcal_event_set_where(event, t_byte);\n }\n}\n\nvoid GCalResource::itemChanged( const Akonadi::Item &item, const QSet<QByteArray> &parts )\n{\n\tQ_UNUSED(parts);\n\tQ_UNUSED(item);\n}\n\nvoid GCalResource::itemRemoved( const Akonadi::Item &item )\n{\n\tQ_UNUSED(item);\n}\n\nAKONADI_RESOURCE_MAIN( GCalResource )\n\n#include \"gcalresource.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/* cuda_wrapper\/device.hpp\n *\n * Copyright (C) 2007 Peter Colberg\n *\n * This file is part of cuda-wrapper.\n *\n * This software may be modified and distributed under the terms of the\n * 3-clause BSD license. See accompanying file LICENSE for details.\n *\/\n\n#ifndef CUDA_DEVICE_HPP\n#define CUDA_DEVICE_HPP\n\n#include <cuda_runtime.h>\n#include <string>\n\n#include <cuda_wrapper\/error.hpp>\n\nnamespace cuda {\n\n\/**\n * CUDA device management\n *\/\nclass device\n{\npublic:\n \/**\n * returns number of devices available for execution\n *\/\n static int count()\n {\n int count;\n CUDA_CALL(cudaGetDeviceCount(&count));\n return count;\n }\n\n \/**\n * set device on which the active host thread executes device code\n *\/\n static void set(int dev)\n {\n CUDA_CALL(cudaSetDevice(dev));\n }\n\n \/**\n * get device on which the active host thread executes device code\n *\/\n static int get()\n {\n int dev;\n CUDA_CALL(cudaGetDevice(&dev));\n return dev;\n }\n\n \/**\n * CUDA device properties\n *\/\n class properties\n {\n private:\n cudaDeviceProp prop;\n\n public:\n \/**\n * empty initializer\n *\/\n properties() {}\n\n \/**\n * retrieve properties of given device\n *\/\n properties(int dev)\n {\n CUDA_CALL(cudaGetDeviceProperties(&prop, dev));\n }\n\n \/**\n * ASCII string identifying the device\n *\/\n std::string name() const\n {\n return prop.name;\n }\n\n \/**\n * total amount of global memory available on the device in bytes\n *\/\n size_t total_global_mem() const\n {\n return prop.totalGlobalMem;\n }\n\n \/**\n * total amount of shared memory available per block in bytes\n *\/\n size_t shared_mem_per_block() const\n {\n return prop.sharedMemPerBlock;\n }\n\n \/**\n * total number of registers available per block\n *\/\n size_t regs_per_block() const\n {\n return prop.regsPerBlock;\n }\n\n \/**\n * wrap size\n *\/\n size_t warp_size() const\n {\n return prop.warpSize;\n }\n\n \/**\n * maximum allowed memory allocation pitch\n *\/\n size_t mem_pitch() const\n {\n return prop.memPitch;\n }\n\n \/**\n * maximum number of threads per block\n *\/\n unsigned int max_threads_per_block() const\n {\n return prop.maxThreadsPerBlock;\n }\n\n \/**\n * maximum sizes of each dimension of a block\n *\/\n dim3 max_threads_dim() const\n {\n return dim3(prop.maxThreadsDim[0], prop.maxThreadsDim[1], prop.maxThreadsDim[2]);\n }\n\n \/**\n * maximum sizes of each dimension of a grid\n *\/\n dim3 max_grid_size() const\n {\n return dim3(prop.maxGridSize[0], prop.maxGridSize[1], prop.maxGridSize[2]);\n }\n\n \/**\n * total amount of constant memory available on the device in bytes\n *\/\n size_t total_const_mem() const\n {\n return prop.totalConstMem;\n }\n\n \/**\n * major revision number of device's compute capatibility\n *\/\n unsigned int major() const\n {\n return prop.major;\n }\n\n \/**\n * minor revision number of device's compute capatibility\n *\/\n unsigned int minor() const\n {\n return prop.minor;\n }\n\n \/**\n * clock frequency in kHz\n *\/\n unsigned int clock_rate() const\n {\n return prop.clockRate;\n }\n\n \/**\n * texture alignment requirement\n *\/\n size_t texture_alignment() const\n {\n return prop.textureAlignment;\n }\n\n#if (CUDART_VERSION >= 2000)\n \/**\n * asynchronous kernel and memory operations capability\n *\/\n int device_overlap() const\n {\n return prop.deviceOverlap;\n }\n\n \/**\n * number of multiprocessors\n *\/\n int multi_processor_count() const\n {\n return prop.multiProcessorCount;\n }\n#endif \/* CUDART_VERSION >= 2000 *\/\n };\n};\n\n} \/\/ namespace cuda\n\n#endif \/* ! CUDA_DEVICE_HPP *\/\n<commit_msg>device: add max_threads_per_multi_processor() member<commit_after>\/* cuda_wrapper\/device.hpp\n *\n * Copyright (C) 2007 Peter Colberg\n *\n * This file is part of cuda-wrapper.\n *\n * This software may be modified and distributed under the terms of the\n * 3-clause BSD license. See accompanying file LICENSE for details.\n *\/\n\n#ifndef CUDA_DEVICE_HPP\n#define CUDA_DEVICE_HPP\n\n#include <cuda_runtime.h>\n#include <string>\n\n#include <cuda_wrapper\/error.hpp>\n\nnamespace cuda {\n\n\/**\n * CUDA device management\n *\/\nclass device\n{\npublic:\n \/**\n * returns number of devices available for execution\n *\/\n static int count()\n {\n int count;\n CUDA_CALL(cudaGetDeviceCount(&count));\n return count;\n }\n\n \/**\n * set device on which the active host thread executes device code\n *\/\n static void set(int dev)\n {\n CUDA_CALL(cudaSetDevice(dev));\n }\n\n \/**\n * get device on which the active host thread executes device code\n *\/\n static int get()\n {\n int dev;\n CUDA_CALL(cudaGetDevice(&dev));\n return dev;\n }\n\n \/**\n * CUDA device properties\n *\/\n class properties\n {\n private:\n cudaDeviceProp prop;\n\n public:\n \/**\n * empty initializer\n *\/\n properties() {}\n\n \/**\n * retrieve properties of given device\n *\/\n properties(int dev)\n {\n CUDA_CALL(cudaGetDeviceProperties(&prop, dev));\n }\n\n \/**\n * ASCII string identifying the device\n *\/\n std::string name() const\n {\n return prop.name;\n }\n\n \/**\n * total amount of global memory available on the device in bytes\n *\/\n size_t total_global_mem() const\n {\n return prop.totalGlobalMem;\n }\n\n \/**\n * total amount of shared memory available per block in bytes\n *\/\n size_t shared_mem_per_block() const\n {\n return prop.sharedMemPerBlock;\n }\n\n \/**\n * total number of registers available per block\n *\/\n size_t regs_per_block() const\n {\n return prop.regsPerBlock;\n }\n\n \/**\n * wrap size\n *\/\n size_t warp_size() const\n {\n return prop.warpSize;\n }\n\n \/**\n * maximum allowed memory allocation pitch\n *\/\n size_t mem_pitch() const\n {\n return prop.memPitch;\n }\n\n \/**\n * maximum number of threads per block\n *\/\n unsigned int max_threads_per_block() const\n {\n return prop.maxThreadsPerBlock;\n }\n\n \/**\n * maximum sizes of each dimension of a block\n *\/\n dim3 max_threads_dim() const\n {\n return dim3(prop.maxThreadsDim[0], prop.maxThreadsDim[1], prop.maxThreadsDim[2]);\n }\n\n \/**\n * maximum sizes of each dimension of a grid\n *\/\n dim3 max_grid_size() const\n {\n return dim3(prop.maxGridSize[0], prop.maxGridSize[1], prop.maxGridSize[2]);\n }\n\n \/**\n * total amount of constant memory available on the device in bytes\n *\/\n size_t total_const_mem() const\n {\n return prop.totalConstMem;\n }\n\n \/**\n * major revision number of device's compute capatibility\n *\/\n unsigned int major() const\n {\n return prop.major;\n }\n\n \/**\n * minor revision number of device's compute capatibility\n *\/\n unsigned int minor() const\n {\n return prop.minor;\n }\n\n \/**\n * clock frequency in kHz\n *\/\n unsigned int clock_rate() const\n {\n return prop.clockRate;\n }\n\n \/**\n * texture alignment requirement\n *\/\n size_t texture_alignment() const\n {\n return prop.textureAlignment;\n }\n\n#if (CUDART_VERSION >= 2000)\n \/**\n * asynchronous kernel and memory operations capability\n *\/\n int device_overlap() const\n {\n return prop.deviceOverlap;\n }\n\n \/**\n * number of multiprocessors\n *\/\n int multi_processor_count() const\n {\n return prop.multiProcessorCount;\n }\n#endif \/* CUDART_VERSION >= 2000 *\/\n#if (CUDART_VERSION >= 4000)\n \/**\n * maximum resident threads per multiprocessor\n *\/\n int max_threads_per_multi_processor() const\n {\n return prop.maxThreadsPerMultiProcessor;\n }\n#endif \/* CUDART_VERSION >= 4000 *\/\n };\n};\n\n} \/\/ namespace cuda\n\n#endif \/* ! CUDA_DEVICE_HPP *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2022 Michael Fisher <mfisher@lvtk.org>\n\/\/ SPDX-License-Identifier: ISC\n\n#include <vector>\n\n#include <lvtk\/ui\/font.hpp>\n\n#include \"gl.hpp\"\n\n#include \"..\/nanovg\/nanovg.h\"\n#include \"..\/nanovg\/nanovg_gl.h\"\n#include \"Roboto-Bold.ttf.h\"\n#include \"Roboto-Regular.ttf.h\"\n#include \"nanovg.hpp\"\n\nnamespace lvtk {\nnamespace nvg {\nnamespace detail {\n\nstatic constexpr const char* default_font_face = \"Roboto-Normal\";\nstatic constexpr const char* default_font_face_bold = \"Roboto-Bold\";\n\n#if defined(NANOVG_GL2)\nstatic constexpr auto create = nvgCreateGL2;\nstatic constexpr auto destroy = nvgDeleteGL2;\n#elif defined(NANOVG_GL3)\nstatic constexpr auto create = nvgCreateGL3;\nstatic constexpr auto destroy = nvgDeleteGL3;\n#else\n# error \"No GL version specified for NanoVG\"\n#endif\n\n} \/\/ namespace detail\n\nnamespace convert {\nstatic int alignment (Alignment align) {\n uint32_t flags = 0;\n\n if ((align.flags() & Alignment::LEFT) != 0)\n flags |= NVG_ALIGN_LEFT;\n if ((align.flags() & Alignment::RIGHT) != 0)\n flags |= NVG_ALIGN_RIGHT;\n if ((align.flags() & Alignment::CENTER) != 0)\n flags |= NVG_ALIGN_CENTER;\n if ((align.flags() & Alignment::TOP) != 0)\n flags |= NVG_ALIGN_TOP;\n if ((align.flags() & Alignment::BOTTOM) != 0)\n flags |= NVG_ALIGN_BOTTOM;\n if ((align.flags() & Alignment::MIDDLE) != 0)\n flags |= NVG_ALIGN_MIDDLE;\n\n return static_cast<int> (flags);\n};\n\n} \/\/ namespace convert\n\nclass Context::Ctx {\n int _font_normal = 0;\n int _font_bold = 0;\n\npublic:\n Ctx() : ctx (detail::create (NVG_ANTIALIAS | NVG_STENCIL_STROKES)) {\n _font_normal = nvgCreateFontMem (ctx,\n detail::default_font_face,\n (uint8_t*) Roboto_Regular_ttf,\n Roboto_Regular_ttf_size,\n 0);\n _font_bold = nvgCreateFontMem (ctx,\n detail::default_font_face_bold,\n (uint8_t*) Roboto_Bold_ttf,\n Roboto_Bold_ttf_size,\n 0);\n }\n\n ~Ctx() {\n if (ctx)\n detail::destroy (ctx);\n }\n\n void save() {\n stack.push_back (state);\n nvgSave (ctx);\n }\n\n void restore() {\n if (stack.empty())\n return;\n state = stack.back();\n stack.pop_back();\n nvgRestore (ctx);\n }\n\nprivate:\n friend class nvg::Context;\n NVGcontext* ctx { nullptr };\n struct State {\n NVGcolor color;\n Rectangle<float> clip;\n Font font;\n int font_id = 0;\n\n State& operator= (const State& o) {\n color = o.color;\n clip = o.clip;\n font = o.font;\n font_id = o.font_id;\n return *this;\n }\n };\n\n float internal_scale = 1.f;\n State state;\n std::vector<State> stack;\n};\n\nContext::Context()\n : ctx (std::make_unique<Ctx>()) {\n set_fill (Color (0.f, 0.f, 0.f, 1.f));\n}\n\nContext::~Context() {\n ctx.reset();\n}\n\nfloat Context::scale_factor() const noexcept {\n return ctx->internal_scale;\n}\n\nvoid Context::translate (const Point<int>& pt) {\n nvgTranslate (ctx->ctx, (float) pt.x, (float) pt.y);\n}\n\nvoid Context::transform (const Transform& mat) {\n nvgTransform (ctx->ctx, mat.m00, mat.m01, mat.m02, mat.m10, mat.m11, mat.m12);\n}\n\nvoid Context::clip (const Rectangle<int>& r) {\n ctx->state.clip = r.as<float>();\n nvgScissor (ctx->ctx,\n ctx->state.clip.x,\n ctx->state.clip.y,\n ctx->state.clip.width,\n ctx->state.clip.height);\n}\n\nvoid Context::intersect_clip (const Rectangle<int>& r) {\n nvgIntersectScissor (ctx->ctx, r.x, r.y, r.width, r.height);\n}\n\nRectangle<int> Context::last_clip() const {\n return (ctx->state.clip).as<int>();\n}\n\nFont Context::font() const noexcept { return ctx->state.font; }\nvoid Context::set_font (const Font& font) { \n ctx->state.font = font; \n ctx->state.font_id = font.bold() ? ctx->_font_bold : ctx->_font_normal;\n}\n\nvoid Context::set_fill (const Fill& fill) {\n auto c = fill.color();\n auto& color = ctx->state.color;\n color.r = c.fred();\n color.g = c.fgreen();\n color.b = c.fblue();\n color.a = c.falpha();\n}\n\nvoid Context::save() { ctx->save(); }\nvoid Context::restore() { ctx->restore(); }\n\nvoid Context::begin_frame (int width, int height, float scale) {\n ctx->internal_scale = scale;\n nvgBeginFrame (ctx->ctx,\n (float) width,\n (float) height,\n ctx->internal_scale);\n}\n\nvoid Context::end_frame() {\n nvgEndFrame (ctx->ctx);\n}\n\nvoid Context::fill_rect (const Rectangle<float>& r) {\n nvgBeginPath (ctx->ctx);\n\n nvgRect (ctx->ctx,\n (r.x),\n (r.y),\n r.width,\n r.height);\n\n nvgFillColor (ctx->ctx, ctx->state.color);\n nvgFill (ctx->ctx);\n}\n\nbool Context::text (const std::string& text, float x, float y, Alignment align) {\n const auto& font = ctx->state.font;\n nvgFontSize (ctx->ctx, ctx->state.font.height());\n nvgFontFaceId (ctx->ctx, ctx->state.font_id);\n nvgTextAlign (ctx->ctx, convert::alignment (align));\n nvgFillColor (ctx->ctx, ctx->state.color);\n nvgText (ctx->ctx, x, y, text.c_str(), nullptr);\n return true;\n}\n\n} \/\/ namespace nvg\n} \/\/ namespace lvtk\n<commit_msg>remove unused variable<commit_after>\/\/ Copyright 2022 Michael Fisher <mfisher@lvtk.org>\n\/\/ SPDX-License-Identifier: ISC\n\n#include <vector>\n\n#include <lvtk\/ui\/font.hpp>\n\n#include \"gl.hpp\"\n\n#include \"..\/nanovg\/nanovg.h\"\n#include \"..\/nanovg\/nanovg_gl.h\"\n#include \"Roboto-Bold.ttf.h\"\n#include \"Roboto-Regular.ttf.h\"\n#include \"nanovg.hpp\"\n\nnamespace lvtk {\nnamespace nvg {\nnamespace detail {\n\nstatic constexpr const char* default_font_face = \"Roboto-Normal\";\nstatic constexpr const char* default_font_face_bold = \"Roboto-Bold\";\n\n#if defined(NANOVG_GL2)\nstatic constexpr auto create = nvgCreateGL2;\nstatic constexpr auto destroy = nvgDeleteGL2;\n#elif defined(NANOVG_GL3)\nstatic constexpr auto create = nvgCreateGL3;\nstatic constexpr auto destroy = nvgDeleteGL3;\n#else\n# error \"No GL version specified for NanoVG\"\n#endif\n\n} \/\/ namespace detail\n\nnamespace convert {\nstatic int alignment (Alignment align) {\n uint32_t flags = 0;\n\n if ((align.flags() & Alignment::LEFT) != 0)\n flags |= NVG_ALIGN_LEFT;\n if ((align.flags() & Alignment::RIGHT) != 0)\n flags |= NVG_ALIGN_RIGHT;\n if ((align.flags() & Alignment::CENTER) != 0)\n flags |= NVG_ALIGN_CENTER;\n if ((align.flags() & Alignment::TOP) != 0)\n flags |= NVG_ALIGN_TOP;\n if ((align.flags() & Alignment::BOTTOM) != 0)\n flags |= NVG_ALIGN_BOTTOM;\n if ((align.flags() & Alignment::MIDDLE) != 0)\n flags |= NVG_ALIGN_MIDDLE;\n\n return static_cast<int> (flags);\n};\n\n} \/\/ namespace convert\n\nclass Context::Ctx {\n int _font_normal = 0;\n int _font_bold = 0;\n\npublic:\n Ctx() : ctx (detail::create (NVG_ANTIALIAS | NVG_STENCIL_STROKES)) {\n _font_normal = nvgCreateFontMem (ctx,\n detail::default_font_face,\n (uint8_t*) Roboto_Regular_ttf,\n Roboto_Regular_ttf_size,\n 0);\n _font_bold = nvgCreateFontMem (ctx,\n detail::default_font_face_bold,\n (uint8_t*) Roboto_Bold_ttf,\n Roboto_Bold_ttf_size,\n 0);\n }\n\n ~Ctx() {\n if (ctx)\n detail::destroy (ctx);\n }\n\n void save() {\n stack.push_back (state);\n nvgSave (ctx);\n }\n\n void restore() {\n if (stack.empty())\n return;\n state = stack.back();\n stack.pop_back();\n nvgRestore (ctx);\n }\n\nprivate:\n friend class nvg::Context;\n NVGcontext* ctx { nullptr };\n struct State {\n NVGcolor color;\n Rectangle<float> clip;\n Font font;\n int font_id = 0;\n\n State& operator= (const State& o) {\n color = o.color;\n clip = o.clip;\n font = o.font;\n font_id = o.font_id;\n return *this;\n }\n };\n\n float internal_scale = 1.f;\n State state;\n std::vector<State> stack;\n};\n\nContext::Context()\n : ctx (std::make_unique<Ctx>()) {\n set_fill (Color (0.f, 0.f, 0.f, 1.f));\n}\n\nContext::~Context() {\n ctx.reset();\n}\n\nfloat Context::scale_factor() const noexcept {\n return ctx->internal_scale;\n}\n\nvoid Context::translate (const Point<int>& pt) {\n nvgTranslate (ctx->ctx, (float) pt.x, (float) pt.y);\n}\n\nvoid Context::transform (const Transform& mat) {\n nvgTransform (ctx->ctx, mat.m00, mat.m01, mat.m02, mat.m10, mat.m11, mat.m12);\n}\n\nvoid Context::clip (const Rectangle<int>& r) {\n ctx->state.clip = r.as<float>();\n nvgScissor (ctx->ctx,\n ctx->state.clip.x,\n ctx->state.clip.y,\n ctx->state.clip.width,\n ctx->state.clip.height);\n}\n\nvoid Context::intersect_clip (const Rectangle<int>& r) {\n nvgIntersectScissor (ctx->ctx, r.x, r.y, r.width, r.height);\n}\n\nRectangle<int> Context::last_clip() const {\n return (ctx->state.clip).as<int>();\n}\n\nFont Context::font() const noexcept { return ctx->state.font; }\nvoid Context::set_font (const Font& font) { \n ctx->state.font = font; \n ctx->state.font_id = font.bold() ? ctx->_font_bold : ctx->_font_normal;\n}\n\nvoid Context::set_fill (const Fill& fill) {\n auto c = fill.color();\n auto& color = ctx->state.color;\n color.r = c.fred();\n color.g = c.fgreen();\n color.b = c.fblue();\n color.a = c.falpha();\n}\n\nvoid Context::save() { ctx->save(); }\nvoid Context::restore() { ctx->restore(); }\n\nvoid Context::begin_frame (int width, int height, float scale) {\n ctx->internal_scale = scale;\n nvgBeginFrame (ctx->ctx,\n (float) width,\n (float) height,\n ctx->internal_scale);\n}\n\nvoid Context::end_frame() {\n nvgEndFrame (ctx->ctx);\n}\n\nvoid Context::fill_rect (const Rectangle<float>& r) {\n nvgBeginPath (ctx->ctx);\n\n nvgRect (ctx->ctx,\n (r.x),\n (r.y),\n r.width,\n r.height);\n\n nvgFillColor (ctx->ctx, ctx->state.color);\n nvgFill (ctx->ctx);\n}\n\nbool Context::text (const std::string& text, float x, float y, Alignment align) {\n nvgFontSize (ctx->ctx, ctx->state.font.height());\n nvgFontFaceId (ctx->ctx, ctx->state.font_id);\n nvgTextAlign (ctx->ctx, convert::alignment (align));\n nvgFillColor (ctx->ctx, ctx->state.color);\n nvgText (ctx->ctx, x, y, text.c_str(), nullptr);\n return true;\n}\n\n} \/\/ namespace nvg\n} \/\/ namespace lvtk\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Restructuring Shogun's statistical hypothesis testing framework.\n * Copyright (C) 2016 Soumyajit De\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the selfied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <algorithm>\n#include <shogun\/lib\/SGVector.h>\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/statistical_testing\/HypothesisTest.h>\n#include <shogun\/statistical_testing\/internals\/TestTypes.h>\n#include <shogun\/statistical_testing\/internals\/DataManager.h>\n#include <shogun\/statistical_testing\/internals\/KernelManager.h>\n\nusing namespace shogun;\nusing namespace internal;\n\nstruct CHypothesisTest::Self\n{\n\tSelf(index_t num_distributions, index_t num_kernels)\n\t: data_manager(num_distributions), kernel_manager(num_kernels)\n\t{\n\t}\n\tDataManager data_manager;\n\tKernelManager kernel_manager;\n};\n\nCHypothesisTest::CHypothesisTest(index_t num_distributions, index_t num_kernels) : CSGObject()\n{\n\tself = std::unique_ptr<Self>(new CHypothesisTest::Self(num_distributions, num_kernels));\n}\n\nCHypothesisTest::~CHypothesisTest()\n{\n}\n\nDataManager& CHypothesisTest::get_data_manager()\n{\n\treturn self->data_manager;\n}\n\nconst DataManager& CHypothesisTest::get_data_manager() const\n{\n\treturn self->data_manager;\n}\n\nKernelManager& CHypothesisTest::get_kernel_manager()\n{\n\treturn self->kernel_manager;\n}\n\nconst KernelManager& CHypothesisTest::get_kernel_manager() const\n{\n\treturn self->kernel_manager;\n}\n\nfloat64_t CHypothesisTest::compute_p_value(float64_t statistic)\n{\n\tSGVector<float64_t> values = sample_null();\n\n\tstd::sort(values.vector, values.vector + values.vlen);\n\tfloat64_t i = values.find_position_to_insert(statistic);\n\n\treturn 1.0 - i \/ values.vlen;\n}\n\nfloat64_t CHypothesisTest::compute_threshold(float64_t alpha)\n{\n\tfloat64_t result = 0;\n\tSGVector<float64_t> values = sample_null();\n\n\tstd::sort(values.vector, values.vector + values.vlen);\n\treturn values[index_t(CMath::floor(values.vlen * (1 - alpha)))];\n}\n\nconst char* CHypothesisTest::get_name() const\n{\n\treturn \"HypothesisTest\";\n}\n<commit_msg>removed unused variable result<commit_after>\/*\n * Restructuring Shogun's statistical hypothesis testing framework.\n * Copyright (C) 2016 Soumyajit De\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the selfied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include <algorithm>\n#include <shogun\/lib\/SGVector.h>\n#include <shogun\/mathematics\/Math.h>\n#include <shogun\/statistical_testing\/HypothesisTest.h>\n#include <shogun\/statistical_testing\/internals\/TestTypes.h>\n#include <shogun\/statistical_testing\/internals\/DataManager.h>\n#include <shogun\/statistical_testing\/internals\/KernelManager.h>\n\nusing namespace shogun;\nusing namespace internal;\n\nstruct CHypothesisTest::Self\n{\n\tSelf(index_t num_distributions, index_t num_kernels)\n\t: data_manager(num_distributions), kernel_manager(num_kernels)\n\t{\n\t}\n\tDataManager data_manager;\n\tKernelManager kernel_manager;\n};\n\nCHypothesisTest::CHypothesisTest(index_t num_distributions, index_t num_kernels) : CSGObject()\n{\n\tself = std::unique_ptr<Self>(new CHypothesisTest::Self(num_distributions, num_kernels));\n}\n\nCHypothesisTest::~CHypothesisTest()\n{\n}\n\nDataManager& CHypothesisTest::get_data_manager()\n{\n\treturn self->data_manager;\n}\n\nconst DataManager& CHypothesisTest::get_data_manager() const\n{\n\treturn self->data_manager;\n}\n\nKernelManager& CHypothesisTest::get_kernel_manager()\n{\n\treturn self->kernel_manager;\n}\n\nconst KernelManager& CHypothesisTest::get_kernel_manager() const\n{\n\treturn self->kernel_manager;\n}\n\nfloat64_t CHypothesisTest::compute_p_value(float64_t statistic)\n{\n\tSGVector<float64_t> values = sample_null();\n\n\tstd::sort(values.vector, values.vector + values.vlen);\n\tfloat64_t i = values.find_position_to_insert(statistic);\n\n\treturn 1.0 - i \/ values.vlen;\n}\n\nfloat64_t CHypothesisTest::compute_threshold(float64_t alpha)\n{\n\tSGVector<float64_t> values = sample_null();\n\tstd::sort(values.vector, values.vector + values.vlen);\n\treturn values[index_t(CMath::floor(values.vlen * (1 - alpha)))];\n}\n\nconst char* CHypothesisTest::get_name() const\n{\n\treturn \"HypothesisTest\";\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_LANG_GRAMMARS_EXPRESSION_GRAMMAR_DEF_HPP\n#define STAN_LANG_GRAMMARS_EXPRESSION_GRAMMAR_DEF_HPP\n\n#include <stan\/lang\/grammars\/expression_grammar.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <sstream>\n#include <string>\n#include <vector>\n\nBOOST_FUSION_ADAPT_STRUCT(stan::lang::conditional_op,\n (stan::lang::expression, cond_)\n (stan::lang::expression, true_val_)\n (stan::lang::expression, false_val_) )\n\n\nnamespace stan {\n\n namespace lang {\n\n template <typename Iterator>\n expression_grammar<Iterator>::expression_grammar(variable_map& var_map,\n std::stringstream& error_msgs)\n : expression_grammar::base_type(expression_r),\n var_map_(var_map),\n error_msgs_(error_msgs),\n expression07_g(var_map, error_msgs, *this) {\n using boost::spirit::qi::char_;\n using boost::spirit::qi::eps;\n using boost::spirit::qi::lit;\n using boost::spirit::qi::no_skip;\n using boost::spirit::qi::_1;\n using boost::spirit::qi::_pass;\n using boost::spirit::qi::_val;\n using boost::spirit::qi::labels::_r1;\n\n \/\/ expression_r.name(\"expression\");\n \/\/ expression_r\n \/\/ %= conditional_op_r(_r1)\n \/\/ | expression15_r(_r1);\n\n\n \/\/ conditional_op_r.name(\"conditional op expression, cond ? t_val : f_val \");\n \/\/ conditional_op_r\n \/\/ %= expression15_r(_r1)\n \/\/ >> lit(\"?\")\n \/\/ >> expression_r(_r1)\n \/\/ >> lit(\":\")\n \/\/ >> expression_r(_r1)[validate_conditional_op_f(_val, _pass,\n \/\/ boost::phoenix::ref(error_msgs))];\n\n \/\/ expression_r\n \/\/ %= expression15_r(_r1)\n \/\/ >> -(lit('?')\n \/\/ >> expression_r(_r1)\n \/\/ >> lit(\"'\")\n \/\/ >> expression_r(_r1)\n \/\/ [validate_conditional_op_f(_val, _pass,\n \/\/ boost::phoenix::ref(error_msgs))]);\n\n expression_r.name(\"expression\");\n expression_r\n %= (expression15_r(_r1) >> no_skip[!char_('?')] > eps)\n | conditional_op_r(_r1);\n\n conditional_op_r.name(\"conditional op expression, cond ? t_val : f_val \");\n conditional_op_r\n %= expression15_r(_r1)\n >> lit(\"?\")\n >> expression_r(_r1)\n >> lit(\":\")\n >> expression_r(_r1)[validate_conditional_op_f(_val, _pass,\n boost::phoenix::ref(error_msgs))];\n\n expression15_r.name(\"expression\");\n expression15_r\n = expression14_r(_r1)[assign_lhs_f(_val, _1)]\n > *(lit(\"||\")\n > expression14_r(_r1)\n [binary_op_f(_val, _1, \"||\", \"logical_or\",\n boost::phoenix::ref(error_msgs))]);\n\n expression14_r.name(\"expression\");\n expression14_r\n = expression10_r(_r1)[assign_lhs_f(_val, _1)]\n > *(lit(\"&&\")\n > expression10_r(_r1)\n [binary_op_f(_val, _1, \"&&\", \"logical_and\",\n boost::phoenix::ref(error_msgs))]);\n\n expression10_r.name(\"expression\");\n expression10_r\n = expression09_r(_r1)[assign_lhs_f(_val, _1)]\n > *((lit(\"==\")\n > expression09_r(_r1)\n [binary_op_f(_val, _1, \"==\", \"logical_eq\",\n boost::phoenix::ref(error_msgs))])\n |\n (lit(\"!=\")\n > expression09_r(_r1)\n [binary_op_f(_val, _1, \"!=\", \"logical_neq\",\n boost::phoenix::ref(error_msgs))]));\n\n expression09_r.name(\"expression\");\n expression09_r\n = expression07_g(_r1)[assign_lhs_f(_val, _1)]\n > *((lit(\"<=\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \"<\", \"logical_lte\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\"<\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \"<=\", \"logical_lt\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\">=\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \">\", \"logical_gte\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\">\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \">=\", \"logical_gt\",\n boost::phoenix::ref(error_msgs))]));\n }\n }\n}\n#endif\n<commit_msg>fix cpplint errors<commit_after>#ifndef STAN_LANG_GRAMMARS_EXPRESSION_GRAMMAR_DEF_HPP\n#define STAN_LANG_GRAMMARS_EXPRESSION_GRAMMAR_DEF_HPP\n\n#include <stan\/lang\/grammars\/expression_grammar.hpp>\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/spirit\/include\/phoenix_core.hpp>\n#include <sstream>\n#include <string>\n#include <vector>\n\nBOOST_FUSION_ADAPT_STRUCT(stan::lang::conditional_op,\n (stan::lang::expression, cond_)\n (stan::lang::expression, true_val_)\n (stan::lang::expression, false_val_) )\n\n\nnamespace stan {\n\n namespace lang {\n\n template <typename Iterator>\n expression_grammar<Iterator>::expression_grammar(variable_map& var_map,\n std::stringstream& error_msgs)\n : expression_grammar::base_type(expression_r),\n var_map_(var_map),\n error_msgs_(error_msgs),\n expression07_g(var_map, error_msgs, *this) {\n using boost::spirit::qi::char_;\n using boost::spirit::qi::eps;\n using boost::spirit::qi::lit;\n using boost::spirit::qi::no_skip;\n using boost::spirit::qi::_1;\n using boost::spirit::qi::_pass;\n using boost::spirit::qi::_val;\n using boost::spirit::qi::labels::_r1;\n\n expression_r.name(\"expression\");\n expression_r\n %= (expression15_r(_r1) >> no_skip[!char_('?')] > eps)\n | conditional_op_r(_r1);\n\n conditional_op_r.name(\"conditional op expression, cond ? t_val : f_val \");\n conditional_op_r\n %= expression15_r(_r1)\n >> lit(\"?\")\n >> expression_r(_r1)\n >> lit(\":\")\n >> expression_r(_r1)[validate_conditional_op_f(_val, _pass,\n boost::phoenix::ref(error_msgs))];\n\n expression15_r.name(\"expression\");\n expression15_r\n = expression14_r(_r1)[assign_lhs_f(_val, _1)]\n > *(lit(\"||\")\n > expression14_r(_r1)\n [binary_op_f(_val, _1, \"||\", \"logical_or\",\n boost::phoenix::ref(error_msgs))]);\n\n expression14_r.name(\"expression\");\n expression14_r\n = expression10_r(_r1)[assign_lhs_f(_val, _1)]\n > *(lit(\"&&\")\n > expression10_r(_r1)\n [binary_op_f(_val, _1, \"&&\", \"logical_and\",\n boost::phoenix::ref(error_msgs))]);\n\n expression10_r.name(\"expression\");\n expression10_r\n = expression09_r(_r1)[assign_lhs_f(_val, _1)]\n > *((lit(\"==\")\n > expression09_r(_r1)\n [binary_op_f(_val, _1, \"==\", \"logical_eq\",\n boost::phoenix::ref(error_msgs))])\n |\n (lit(\"!=\")\n > expression09_r(_r1)\n [binary_op_f(_val, _1, \"!=\", \"logical_neq\",\n boost::phoenix::ref(error_msgs))]));\n\n expression09_r.name(\"expression\");\n expression09_r\n = expression07_g(_r1)[assign_lhs_f(_val, _1)]\n > *((lit(\"<=\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \"<\", \"logical_lte\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\"<\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \"<=\", \"logical_lt\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\">=\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \">\", \"logical_gte\",\n boost::phoenix::ref(error_msgs))])\n | (lit(\">\")\n > expression07_g(_r1)\n [binary_op_f(_val, _1, \">=\", \"logical_gt\",\n boost::phoenix::ref(error_msgs))]));\n }\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file extract_extending_graph.cpp\n *\n * Implementation for the extract_extending_graph algorithm.\n *\/\n \n#include \"extract_extending_graph.hpp\"\n\n\/\/#define debug_vg_algorithms\n\nnamespace vg {\nnamespace algorithms {\n\n unordered_map<id_t, id_t> extract_extending_graph(const HandleGraph* source, Graph& g, int64_t max_dist, pos_t pos,\n bool backward, bool preserve_cycles_on_src) {\n \n if (g.node_size() || g.edge_size()) {\n cerr << \"error:[extract_extending_graph] must extract into an empty graph\" << endl;\n assert(false);\n }\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] extracting exending graph from \" << pos << \" in \" << (backward ? \"backward\" : \"forward\") << \" direction with max search dist \" << max_dist << endl;\n#endif\n \n \/\/ TODO: these structs are duplicative with extract_connecting_graph\n \n \/\/ a local struct that packages a handle with its distance from the first position\n struct Traversal {\n Traversal(handle_t handle, int64_t dist) : handle(handle), dist(dist) {}\n int64_t dist; \/\/ distance from pos to the right side of this node\n handle_t handle; \/\/ Oriented node traversal\n inline bool operator<(const Traversal& other) const {\n return dist > other.dist; \/\/ opposite order so priority queue selects minimum\n }\n };\n \n \/\/ a map from node ids in the extracted graph to the node ids in the original graph\n unordered_map<id_t, id_t> id_trans;\n \n \/\/ a graph index that we will maintain as we extract the subgraph\n unordered_map<id_t, Node*> graph;\n Node* src_node = g.add_node();\n src_node->set_sequence(source->get_sequence(source->get_handle(id(pos))));\n src_node->set_id(id(pos));\n graph[id(pos)] = src_node;\n id_trans[id(pos)] = id(pos);\n \n \/\/ Keep a handle to where we start from.\n \/\/ If the queue stays empty and we do no searching, the handle will be\n \/\/ uninitialized.\n handle_t start_handle;\n \n \/\/ initialize the queue\n priority_queue<Traversal> queue;\n if (backward) {\n int64_t dist = offset(pos);\n if (dist < max_dist) {\n \/\/ We need to leave the node to get enough sequence\n start_handle = source->get_handle(id(pos), !is_rev(pos));\n queue.emplace(start_handle, dist);\n }\n }\n else {\n int64_t dist = g.node(0).sequence().size() - offset(pos);\n if (dist < max_dist) {\n \/\/ We need to leave the node to get enough sequence\n start_handle = source->get_handle(id(pos), is_rev(pos));\n queue.emplace(start_handle, dist);\n }\n }\n \n id_t max_id = id(pos);\n bool cycled_to_source = false;\n unordered_set<handle_t> traversed;\n unordered_set<pair<handle_t, handle_t>> observed_edges;\n \n while (!queue.empty()) {\n \/\/ get the next shortest distance traversal from either the init\n Traversal trav = queue.top();\n queue.pop();\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] traversing \" << source->get_id(trav.handle)\n << (source->get_is_reverse(trav.handle) ? \"-\" : \"+\") << \" at dist \" << trav.dist << endl;\n#endif\n \n \/\/ make sure we haven't traversed this node already\n if (traversed.count(trav.handle)) {\n continue;\n }\n \/\/ mark the node as traversed\n traversed.emplace(trav.handle);\n \n \/\/ Now go out the right local side\n source->follow_edges(trav.handle, false, [&](const handle_t& next) {\n \/\/ For each next handle...\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] checking edge \" << source->get_id(trav.handle)\n << (source->get_is_reverse(trav.handle) ? \"-\" : \"+\") << \" -> \" << source->get_id(next)\n << (source->get_is_reverse(next) ? \"-\" : \"+\") << endl;\n#endif\n \n \/\/ Get the ID of where we're going.\n auto next_id = source->get_id(next);\n \n \/\/ do we ever return to the source node?\n cycled_to_source = cycled_to_source || next_id == id(pos);\n \n \/\/ record the edge\n observed_edges.insert(source->edge_handle(trav.handle, next));\n \n \/\/ make sure the node is in the graph\n if (!graph.count(next_id)) {\n Node* node = g.add_node();\n \/\/ Grab the sequence in its local forward orientation.\n node->set_sequence(source->get_sequence(source->forward(next)));\n node->set_id(next_id);\n graph[next_id] = node;\n id_trans[next_id] = next_id;\n max_id = std::max(next_id, max_id);\n }\n \n \/\/ distance to the end of this node\n int64_t dist_thru = trav.dist + graph[next_id]->sequence().size();\n if (!traversed.count(next) && dist_thru < max_dist) {\n \/\/ we can add more nodes along same path without going over the max length\n queue.emplace(next, dist_thru);\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] enqueuing \" << source->get_id(next)\n << (source->get_is_reverse(next) ? \"-\" : \"+\") << \" at dist \" << dist_thru << endl;\n#endif\n }\n });\n }\n \n vector<pair<handle_t, handle_t>> src_edges;\n \n \/\/ add the edges to the graph\n for (const pair<handle_t, handle_t>& edge : observed_edges) {\n \/\/ This loop will never run unless we actually ran the search, so it is safe to use start_handle here.\n bool add_edge;\n if (source->forward(edge.first) == source->forward(start_handle) ||\n source->forward(edge.second) == source->forward(start_handle)) {\n \/\/ record the edges that touch the source in case we need to duplicate them\n src_edges.push_back(edge);\n \/\/ does the edge only touch the side of the source node that's not going to be cut?\n \/\/ That means it must touch only the right side of our starting handle.\n \/\/ We know it touches one side, so make sure it *doesn't* touch the left side.\n \/\/ Which means we need the reverse of our starting handle to not\n \/\/ be the left handle, and our handle to not be the right\n \/\/ handle.\n add_edge = !(edge.first == source->flip(start_handle) || edge.second == start_handle);\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << (add_edge ? \"\" : \"not \") << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" that touches source node\" << endl;\n#endif\n }\n else {\n \/\/ the edge doesn't touch the source node, so it will certainly survive the cut\n add_edge = true;\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" that does not touch source node\" << endl;\n#endif\n }\n \n if (add_edge) {\n Edge* e = g.add_edge();\n e->set_from(source->get_id(edge.first));\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to(source->get_id(edge.second));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n }\n \n if (cycled_to_source && preserve_cycles_on_src) {\n \/\/ we need to duplicate the source node to ensure that cycles on it will be preserved\n \/\/ after we cut it\n \n \/\/ choose an ID that hasn't been used yet\n id_t dup_id = max_id + 1;\n \n \/\/ duplicate the node\n Node* dup_node = g.add_node();\n dup_node->set_id(dup_id);\n dup_node->set_sequence(graph[id(pos)]->sequence());\n \n \/\/ record the ID translation\n id_trans[dup_id] = id(pos);\n \n for (const pair<handle_t, handle_t>& edge : src_edges) {\n Edge* e = g.add_edge();\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n \n \/\/ Load the IDs for this edge\n auto from_id = source->get_id(edge.first);\n auto to_id = source->get_id(edge.second);\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" to source node copy\" << endl;\n#endif\n \n if (from_id == id(pos) && to_id == id(pos)) {\n \/\/ this edge is a self loop, always make a copy on the duplicated node\n e->set_from(dup_id);\n e->set_to(dup_id);\n \n \/\/ if one of the ends of the edge is on the non-cut side of the source, also make a copy\n \/\/ between the original and the duplicated node\n if (from_id == id(pos) && source->get_is_reverse(edge.first) == (backward != is_rev(pos))) {\n e = g.add_edge();\n e->set_from(id(pos));\n e->set_to(dup_id);\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n else if (to_id == id(pos) && source->get_is_reverse(edge.second) != (backward != is_rev(pos))) {\n e = g.add_edge();\n e->set_from(dup_id);\n e->set_to(id(pos));\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n }\n else if (from_id == id(pos)) {\n \/\/ add a copy of the edge from the other node to the duplicated node\n e->set_from(dup_id);\n e->set_to(to_id);\n }\n else {\n \/\/ add a copy of the edge from the other node to the duplicated node\n e->set_from(from_id);\n e->set_to(dup_id);\n }\n }\n }\n \n \/\/ cut the source node at the starting position\n if (is_rev(pos) && backward) {\n src_node->set_sequence(src_node->sequence().substr(src_node->sequence().size() - offset(pos), offset(pos)));\n }\n else if (is_rev(pos)) {\n src_node->set_sequence(src_node->sequence().substr(0, src_node->sequence().size() - offset(pos)));\n }\n else if (backward) {\n src_node->set_sequence(src_node->sequence().substr(0, offset(pos)));\n }\n else {\n src_node->set_sequence(src_node->sequence().substr(offset(pos), src_node->sequence().size() - offset(pos)));\n }\n \n return id_trans;\n }\n}\n}\n<commit_msg>Make extract_extending_graph use easy Dijkstra<commit_after>\/**\n * \\file extract_extending_graph.cpp\n *\n * Implementation for the extract_extending_graph algorithm.\n *\/\n \n#include \"extract_extending_graph.hpp\"\n\n\/\/#define debug_vg_algorithms\n\nnamespace vg {\nnamespace algorithms {\n\n unordered_map<id_t, id_t> extract_extending_graph(const HandleGraph* source, Graph& g, int64_t max_dist, pos_t pos,\n bool backward, bool preserve_cycles_on_src) {\n \n if (g.node_size() || g.edge_size()) {\n cerr << \"error:[extract_extending_graph] must extract into an empty graph\" << endl;\n assert(false);\n }\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] extracting exending graph from \" << pos << \" in \" << (backward ? \"backward\" : \"forward\") << \" direction with max search dist \" << max_dist << endl;\n#endif\n \n \/\/ TODO: these structs are duplicative with extract_connecting_graph\n \n \/\/ a local struct that packages a handle with its distance from the first position\n struct Traversal {\n Traversal(handle_t handle, int64_t dist) : handle(handle), dist(dist) {}\n int64_t dist; \/\/ distance from pos to the right side of this node\n handle_t handle; \/\/ Oriented node traversal\n inline bool operator<(const Traversal& other) const {\n return dist > other.dist; \/\/ opposite order so priority queue selects minimum\n }\n };\n \n \/\/ a map from node ids in the extracted graph to the node ids in the original graph\n unordered_map<id_t, id_t> id_trans;\n \n \/\/ a graph index that we will maintain as we extract the subgraph\n unordered_map<id_t, Node*> graph;\n Node* src_node = g.add_node();\n src_node->set_sequence(source->get_sequence(source->get_handle(id(pos))));\n src_node->set_id(id(pos));\n graph[id(pos)] = src_node;\n id_trans[id(pos)] = id(pos);\n \n \/\/ Keep a handle to where we start from.\n \/\/ If the queue stays empty and we do no searching, the handle will be\n \/\/ uninitialized.\n handle_t start_handle;\n \n \/\/ initialize the queue for Dijkstra traversal.\n FilteredPriorityQueue<Traversal, handle_t> queue([](const Traversal& item) {\n return item.handle;\n });\n \n if (backward) {\n int64_t dist = offset(pos);\n if (dist < max_dist) {\n \/\/ We need to leave the node to get enough sequence\n start_handle = source->get_handle(id(pos), !is_rev(pos));\n queue.emplace(start_handle, dist);\n }\n }\n else {\n int64_t dist = g.node(0).sequence().size() - offset(pos);\n if (dist < max_dist) {\n \/\/ We need to leave the node to get enough sequence\n start_handle = source->get_handle(id(pos), is_rev(pos));\n queue.emplace(start_handle, dist);\n }\n }\n \n id_t max_id = id(pos);\n bool cycled_to_source = false;\n unordered_set<pair<handle_t, handle_t>> observed_edges;\n \n while (!queue.empty()) {\n \/\/ get the next shortest distance traversal from either the init\n Traversal trav = queue.top();\n queue.pop();\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] traversing \" << source->get_id(trav.handle)\n << (source->get_is_reverse(trav.handle) ? \"-\" : \"+\") << \" at dist \" << trav.dist << endl;\n#endif\n \n \/\/ Now go out the right local side\n source->follow_edges(trav.handle, false, [&](const handle_t& next) {\n \/\/ For each next handle...\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] checking edge \" << source->get_id(trav.handle)\n << (source->get_is_reverse(trav.handle) ? \"-\" : \"+\") << \" -> \" << source->get_id(next)\n << (source->get_is_reverse(next) ? \"-\" : \"+\") << endl;\n#endif\n \n \/\/ Get the ID of where we're going.\n auto next_id = source->get_id(next);\n \n \/\/ do we ever return to the source node?\n cycled_to_source = cycled_to_source || next_id == id(pos);\n \n \/\/ record the edge\n observed_edges.insert(source->edge_handle(trav.handle, next));\n \n \/\/ make sure the node is in the graph\n if (!graph.count(next_id)) {\n Node* node = g.add_node();\n \/\/ Grab the sequence in its local forward orientation.\n node->set_sequence(source->get_sequence(source->forward(next)));\n node->set_id(next_id);\n graph[next_id] = node;\n id_trans[next_id] = next_id;\n max_id = std::max(next_id, max_id);\n }\n \n \/\/ distance to the end of this node\n int64_t dist_thru = trav.dist + graph[next_id]->sequence().size();\n if (dist_thru < max_dist) {\n \/\/ we can add more nodes along same path without going over the max length\n queue.emplace(next, dist_thru);\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] enqueuing \" << source->get_id(next)\n << (source->get_is_reverse(next) ? \"-\" : \"+\") << \" at dist \" << dist_thru << endl;\n#endif\n }\n });\n }\n \n vector<pair<handle_t, handle_t>> src_edges;\n \n \/\/ add the edges to the graph\n for (const pair<handle_t, handle_t>& edge : observed_edges) {\n \/\/ This loop will never run unless we actually ran the search, so it is safe to use start_handle here.\n bool add_edge;\n if (source->forward(edge.first) == source->forward(start_handle) ||\n source->forward(edge.second) == source->forward(start_handle)) {\n \/\/ record the edges that touch the source in case we need to duplicate them\n src_edges.push_back(edge);\n \/\/ does the edge only touch the side of the source node that's not going to be cut?\n \/\/ That means it must touch only the right side of our starting handle.\n \/\/ We know it touches one side, so make sure it *doesn't* touch the left side.\n \/\/ Which means we need the reverse of our starting handle to not\n \/\/ be the left handle, and our handle to not be the right\n \/\/ handle.\n add_edge = !(edge.first == source->flip(start_handle) || edge.second == start_handle);\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << (add_edge ? \"\" : \"not \") << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" that touches source node\" << endl;\n#endif\n }\n else {\n \/\/ the edge doesn't touch the source node, so it will certainly survive the cut\n add_edge = true;\n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" that does not touch source node\" << endl;\n#endif\n }\n \n if (add_edge) {\n Edge* e = g.add_edge();\n e->set_from(source->get_id(edge.first));\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to(source->get_id(edge.second));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n }\n \n if (cycled_to_source && preserve_cycles_on_src) {\n \/\/ we need to duplicate the source node to ensure that cycles on it will be preserved\n \/\/ after we cut it\n \n \/\/ choose an ID that hasn't been used yet\n id_t dup_id = max_id + 1;\n \n \/\/ duplicate the node\n Node* dup_node = g.add_node();\n dup_node->set_id(dup_id);\n dup_node->set_sequence(graph[id(pos)]->sequence());\n \n \/\/ record the ID translation\n id_trans[dup_id] = id(pos);\n \n for (const pair<handle_t, handle_t>& edge : src_edges) {\n Edge* e = g.add_edge();\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n \n \/\/ Load the IDs for this edge\n auto from_id = source->get_id(edge.first);\n auto to_id = source->get_id(edge.second);\n \n#ifdef debug_vg_algorithms\n cerr << \"[extract_extending_graph] \" << \"adding edge \" << source->get_id(edge.first) << (source->get_is_reverse(edge.first) ? \"-\" : \"+\") << \" -> \" << source->get_id(edge.second) << (source->get_is_reverse(edge.second) ? \"-\" : \"+\") << \" to source node copy\" << endl;\n#endif\n \n if (from_id == id(pos) && to_id == id(pos)) {\n \/\/ this edge is a self loop, always make a copy on the duplicated node\n e->set_from(dup_id);\n e->set_to(dup_id);\n \n \/\/ if one of the ends of the edge is on the non-cut side of the source, also make a copy\n \/\/ between the original and the duplicated node\n if (from_id == id(pos) && source->get_is_reverse(edge.first) == (backward != is_rev(pos))) {\n e = g.add_edge();\n e->set_from(id(pos));\n e->set_to(dup_id);\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n else if (to_id == id(pos) && source->get_is_reverse(edge.second) != (backward != is_rev(pos))) {\n e = g.add_edge();\n e->set_from(dup_id);\n e->set_to(id(pos));\n e->set_from_start(source->get_is_reverse(edge.first));\n e->set_to_end(source->get_is_reverse(edge.second));\n }\n }\n else if (from_id == id(pos)) {\n \/\/ add a copy of the edge from the other node to the duplicated node\n e->set_from(dup_id);\n e->set_to(to_id);\n }\n else {\n \/\/ add a copy of the edge from the other node to the duplicated node\n e->set_from(from_id);\n e->set_to(dup_id);\n }\n }\n }\n \n \/\/ cut the source node at the starting position\n if (is_rev(pos) && backward) {\n src_node->set_sequence(src_node->sequence().substr(src_node->sequence().size() - offset(pos), offset(pos)));\n }\n else if (is_rev(pos)) {\n src_node->set_sequence(src_node->sequence().substr(0, src_node->sequence().size() - offset(pos)));\n }\n else if (backward) {\n src_node->set_sequence(src_node->sequence().substr(0, offset(pos)));\n }\n else {\n src_node->set_sequence(src_node->sequence().substr(offset(pos), src_node->sequence().size() - offset(pos)));\n }\n \n return id_trans;\n }\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Skaffari - a mail account administration web interface based on Cutelyst\n * Copyright (C) 2017 Matthias Fehring <kontakt@buschmann23.de>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"root.h\"\n#include \"objects\/domain.h\"\n#include \"utils\/utils.h\"\n#include \"utils\/language.h\"\n#include \"utils\/skaffariconfig.h\"\n#include \"..\/common\/config.h\"\n\n#include <Cutelyst\/Plugins\/Authentication\/authentication.h>\n#include <Cutelyst\/Plugins\/StatusMessage>\n#include <Cutelyst\/Plugins\/Session\/Session>\n#include <Cutelyst\/Application>\n\n#include <QLocale>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QJsonValue>\n\n#include \"..\/common\/global.h\"\n\nusing namespace Cutelyst;\n\nRoot::Root(QObject *parent) : Controller(parent)\n{\n}\n\nRoot::~Root()\n{\n}\n\nvoid Root::index(Context *c)\n{\n\tc->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"dashboard.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"Dashboard\")}\n });\n}\n\nvoid Root::about(Context *c)\n{\n QStringList description;\n description.push_back(c->translate(\"Root\", \"Skaffari is a web application for managing e-mail accounts, based on Cutelyst and written in Qt\/C++. It serves as a link and access to a combination of SQL database, IMAP and SMTP server. Skaffari bundles administrative tasks such as the creation of new e-mail domains and e-mail accounts, as well as the creation of new e-mail addresses and e-mail forwards.\"));\n description.push_back(c->translate(\"Root\", \"Administrators can be either global or only responsible for specific domains. Individual domains and accounts can be subject to certain restrictions such as storage space, number of accounts or user names.\"));\n description.push_back(c->translate(\"Root\", \"Skaffari has been tested to work with Cyrus IMAP, Postfix and pam_mysql and was inspired by a PHP-based tool called web-cyradm.\"));\n description.push_back(c->translate(\"Root\", \"By the way, Skaffari is the Old High German word for steward.\"));\n\n QVariantList coreComponents;\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Skaffari\")},\n {QStringLiteral(\"version\"), QStringLiteral(SKAFFARI_VERSION)},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/github.com\/Huessenbergnetz\/Skaffari\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Matthias Fehring\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/www.buschmann23.de\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Affero General Public License 3.0\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/www.gnu.org\/licenses\/agpl-3.0.en.html\")}\n }));\n\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Cutelyst\")},\n {QStringLiteral(\"version\"), QString::fromLatin1(Application::cutelystVersion())},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/www.cutelyst.org\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Daniel Nicoletti\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/dantti.wordpress.com\/\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Lesser General Public License 2.1\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/www.gnu.org\/licenses\/lgpl-2.1.en.html\")}\n }));\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Qt\")},\n {QStringLiteral(\"version\"), QString::fromLatin1(qVersion())},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/www.qt.io\/\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"The Qt Company\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/www.qt.io\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Lesser General Public License 2.1\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/www.gnu.org\/licenses\/lgpl-2.1.en.html\")}\n }));\n\n if (SkaffariConfig::useMemcached()) {\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"libMemcached\")},\n {QStringLiteral(\"version\"), QStringLiteral(\"1.0.18\")},\n {QStringLiteral(\"url\"), QStringLiteral(\"http:\/\/libmemcached.org\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Data Differential\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"http:\/\/www.datadifferential.com\/\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"BSD License\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"http:\/\/libmemcached.org\/License.html\")}\n }));\n }\n\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"about.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"About\")},\n {QStringLiteral(\"core_components\"), coreComponents},\n {QStringLiteral(\"description\"), description}\n });\n}\n\nvoid Root::defaultPage(Context *c)\n{\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"404.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"Not found\")}\n });\n c->res()->setStatus(404);\n}\n\nvoid Root::csrfdenied(Context *c)\n{\n c->res()->setStatus(403);\n Language::setLang(c);\n if (Utils::isAjax(c)) {\n c->res()->setJsonBody(QJsonObject({\n {QStringLiteral(\"error_msg\"), QJsonValue(c->stash(QStringLiteral(\"error_msg\")).toString())}\n }));\n } else {\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"csrfdenied.html\")},\n {QStringLiteral(\"no_wrapper\"), QStringLiteral(\"1\")}\n });\n }\n}\n\nbool Root::Auto(Context* c)\n{\n AuthenticationUser user = Authentication::user(c);\n\n Language::setLang(c);\n\n if (c->controller() == c->controller(QStringLiteral(\"Login\"))) {\n return true;\n }\n\n if (Q_UNLIKELY(user.isNull())) {\n if (Utils::isAjax(c)) {\n c->res()->setStatus(Response::Unauthorized);\n c->res()->setJsonBody(QJsonDocument(QJsonObject({\n {QStringLiteral(\"error_msg\"), QJsonValue(c->translate(\"Root\", \"You have to login at first.\"))}\n })));\n } else {\n c->res()->redirect(c->uriFor(QStringLiteral(\"\/login\")));\n }\n return false;\n }\n\n StatusMessage::load(c);\n\n c->stash({\n {QStringLiteral(\"userId\"), QVariant::fromValue<dbid_t>(user.id().toULong())},\n {QStringLiteral(\"userType\"), user.value(QStringLiteral(\"type\"))},\n {QStringLiteral(\"userName\"), user.value(QStringLiteral(\"username\"))},\n {QStringLiteral(\"userMaxDisplay\"), Session::value(c, QStringLiteral(\"maxdisplay\"), SkaffariConfig::defMaxdisplay()).value<quint8>()},\n {QStringLiteral(\"userWarnLevel\"), Session::value(c, QStringLiteral(\"warnlevel\"), SkaffariConfig::defWarnlevel()).value<quint8>()}\n });\n\n return true;\n}\n\n#include \"moc_root.cpp\"\n<commit_msg>Add Grantlee to about page core components (#39)<commit_after>\/*\n * Skaffari - a mail account administration web interface based on Cutelyst\n * Copyright (C) 2017 Matthias Fehring <kontakt@buschmann23.de>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"root.h\"\n#include \"objects\/domain.h\"\n#include \"utils\/utils.h\"\n#include \"utils\/language.h\"\n#include \"utils\/skaffariconfig.h\"\n#include \"..\/common\/config.h\"\n\n#include <Cutelyst\/Plugins\/Authentication\/authentication.h>\n#include <Cutelyst\/Plugins\/StatusMessage>\n#include <Cutelyst\/Plugins\/Session\/Session>\n#include <Cutelyst\/Application>\n\n#include <QLocale>\n#include <QJsonDocument>\n#include <QJsonObject>\n#include <QJsonValue>\n\n#include \"..\/common\/global.h\"\n\nusing namespace Cutelyst;\n\nRoot::Root(QObject *parent) : Controller(parent)\n{\n}\n\nRoot::~Root()\n{\n}\n\nvoid Root::index(Context *c)\n{\n\tc->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"dashboard.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"Dashboard\")}\n });\n}\n\nvoid Root::about(Context *c)\n{\n QStringList description;\n description.push_back(c->translate(\"Root\", \"Skaffari is a web application for managing e-mail accounts, based on Cutelyst and written in Qt\/C++. It serves as a link and access to a combination of SQL database, IMAP and SMTP server. Skaffari bundles administrative tasks such as the creation of new e-mail domains and e-mail accounts, as well as the creation of new e-mail addresses and e-mail forwards.\"));\n description.push_back(c->translate(\"Root\", \"Administrators can be either global or only responsible for specific domains. Individual domains and accounts can be subject to certain restrictions such as storage space, number of accounts or user names.\"));\n description.push_back(c->translate(\"Root\", \"Skaffari has been tested to work with Cyrus IMAP, Postfix and pam_mysql and was inspired by a PHP-based tool called web-cyradm.\"));\n description.push_back(c->translate(\"Root\", \"By the way, Skaffari is the Old High German word for steward.\"));\n\n QVariantList coreComponents;\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Skaffari\")},\n {QStringLiteral(\"version\"), QStringLiteral(SKAFFARI_VERSION)},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/github.com\/Huessenbergnetz\/Skaffari\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Matthias Fehring\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/www.buschmann23.de\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Affero General Public License 3.0\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/github.com\/Huessenbergnetz\/Skaffari\/blob\/master\/LICENSE\")}\n }));\n\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Cutelyst\")},\n {QStringLiteral(\"version\"), QString::fromLatin1(Application::cutelystVersion())},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/www.cutelyst.org\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Daniel Nicoletti\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/dantti.wordpress.com\/\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Lesser General Public License 2.1\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/github.com\/cutelyst\/cutelyst\/blob\/master\/COPYING\")}\n }));\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Qt\")},\n {QStringLiteral(\"version\"), QString::fromLatin1(qVersion())},\n {QStringLiteral(\"url\"), QStringLiteral(\"https:\/\/www.qt.io\/\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"The Qt Company\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/www.qt.io\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Lesser General Public License 2.1\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/doc.qt.io\/qt-5.6\/lgpl.html\")}\n }));\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"Grantlee\")},\n {QStringLiteral(\"version\"), QStringLiteral(GRANTLEE_VERSION)},\n {QStringLiteral(\"url\"), QStringLiteral(\"http:\/\/www.grantlee.org\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Stephen Kelly\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"https:\/\/steveire.wordpress.com\/\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"GNU Lesser General Public License 2.1\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"https:\/\/github.com\/steveire\/grantlee\/blob\/master\/COPYING.LIB\")}\n }));\n\n if (SkaffariConfig::useMemcached()) {\n coreComponents.push_back(QVariantMap({\n {QStringLiteral(\"name\"), QStringLiteral(\"libMemcached\")},\n {QStringLiteral(\"version\"), QStringLiteral(\"1.0.18\")},\n {QStringLiteral(\"url\"), QStringLiteral(\"http:\/\/libmemcached.org\")},\n {QStringLiteral(\"author\"), QStringLiteral(\"Data Differential\")},\n {QStringLiteral(\"authorUrl\"), QStringLiteral(\"http:\/\/www.datadifferential.com\/\")},\n {QStringLiteral(\"license\"), QStringLiteral(\"BSD License\")},\n {QStringLiteral(\"licenseUrl\"), QStringLiteral(\"http:\/\/libmemcached.org\/License.html\")}\n }));\n }\n\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"about.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"About\")},\n {QStringLiteral(\"core_components\"), coreComponents},\n {QStringLiteral(\"description\"), description}\n });\n}\n\nvoid Root::defaultPage(Context *c)\n{\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"404.html\")},\n {QStringLiteral(\"site_title\"), c->translate(\"Root\", \"Not found\")}\n });\n c->res()->setStatus(404);\n}\n\nvoid Root::csrfdenied(Context *c)\n{\n c->res()->setStatus(403);\n Language::setLang(c);\n if (Utils::isAjax(c)) {\n c->res()->setJsonBody(QJsonObject({\n {QStringLiteral(\"error_msg\"), QJsonValue(c->stash(QStringLiteral(\"error_msg\")).toString())}\n }));\n } else {\n c->stash({\n {QStringLiteral(\"template\"), QStringLiteral(\"csrfdenied.html\")},\n {QStringLiteral(\"no_wrapper\"), QStringLiteral(\"1\")}\n });\n }\n}\n\nbool Root::Auto(Context* c)\n{\n AuthenticationUser user = Authentication::user(c);\n\n Language::setLang(c);\n\n if (c->controller() == c->controller(QStringLiteral(\"Login\"))) {\n return true;\n }\n\n if (Q_UNLIKELY(user.isNull())) {\n if (Utils::isAjax(c)) {\n c->res()->setStatus(Response::Unauthorized);\n c->res()->setJsonBody(QJsonDocument(QJsonObject({\n {QStringLiteral(\"error_msg\"), QJsonValue(c->translate(\"Root\", \"You have to login at first.\"))}\n })));\n } else {\n c->res()->redirect(c->uriFor(QStringLiteral(\"\/login\")));\n }\n return false;\n }\n\n StatusMessage::load(c);\n\n c->stash({\n {QStringLiteral(\"userId\"), QVariant::fromValue<dbid_t>(user.id().toULong())},\n {QStringLiteral(\"userType\"), user.value(QStringLiteral(\"type\"))},\n {QStringLiteral(\"userName\"), user.value(QStringLiteral(\"username\"))},\n {QStringLiteral(\"userMaxDisplay\"), Session::value(c, QStringLiteral(\"maxdisplay\"), SkaffariConfig::defMaxdisplay()).value<quint8>()},\n {QStringLiteral(\"userWarnLevel\"), Session::value(c, QStringLiteral(\"warnlevel\"), SkaffariConfig::defWarnlevel()).value<quint8>()}\n });\n\n return true;\n}\n\n#include \"moc_root.cpp\"\n<|endoftext|>"} {"text":"<commit_before>\n<commit_msg>Delete SelectionSort.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Fons Rademakers 04\/05\/96\n\n\/*************************************************************************\n * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TBuffer \/\/\n\/\/ \/\/\n\/\/ Buffer base class used for serializing objects. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TBuffer.h\"\n#include \"TClass.h\"\n#include \"TProcessID.h\"\n\nconst Int_t kExtraSpace = 8; \/\/ extra space at end of buffer (used for free block count)\n\nClassImp(TBuffer)\n\n\/\/______________________________________________________________________________\nstatic char *R__NoReAllocChar(char *, size_t, size_t)\n{\n \/\/ The user has provided memory than we don't own, thus we can not extent it\n \/\/ either.\n return 0;\n}\n\n\/\/______________________________________________________________________________\nstatic inline ULong_t Void_Hash(const void *ptr)\n{\n \/\/ Return hash value for this object.\n\n return TString::Hash(&ptr, sizeof(void*));\n}\n\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite. By default the I\/O buffer has a size of\n \/\/ TBuffer::kInitialSize (1024) bytes.\n\n fBufSize = kInitialSize;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n fBuffer = new char[fBufSize+kExtraSpace];\n\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( 0 );\n}\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode, Int_t bufsiz)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite.\n\n if (bufsiz < kMinimalSize) bufsiz = kMinimalSize;\n fBufSize = bufsiz;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n fBuffer = new char[fBufSize+kExtraSpace];\n\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n\n SetReAllocFunc( 0 );\n}\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode, Int_t bufsiz, void *buf, Bool_t adopt, ReAllocCharFun_t reallocfunc)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite. By default the I\/O buffer has a size of\n \/\/ TBuffer::kInitialSize (1024) bytes. An external buffer can be passed\n \/\/ to TBuffer via the buf argument. By default this buffer will be adopted\n \/\/ unless adopt is false.\n \/\/ If the new buffer is _not_ adopted and no memory allocation routine\n \/\/ is provided, a Fatal error will be issued if the Buffer attempts to\n \/\/ expand.\n \n fBufSize = bufsiz;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n if (buf) {\n fBuffer = (char *)buf;\n if (!adopt) ResetBit(kIsOwner);\n } else {\n if (fBufSize < kMinimalSize) {\n fBufSize = kMinimalSize;\n }\n fBuffer = new char[fBufSize+kExtraSpace];\n }\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( reallocfunc );\n\n if (buf && fBufSize < kMinimalSize) {\n Expand( kMinimalSize );\n }\n}\n\n\/\/______________________________________________________________________________\nTBuffer::~TBuffer()\n{\n \/\/ Delete an I\/O buffer object.\n\n if (TestBit(kIsOwner)) {\n \/\/printf(\"Deleting fBuffer=%lx\\n\", fBuffer);\n delete [] fBuffer;\n }\n fBuffer = 0;\n fParent = 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetBuffer(void *buf, UInt_t newsiz, Bool_t adopt, ReAllocCharFun_t reallocfunc)\n{\n \/\/ Sets a new buffer in an existing TBuffer object. If newsiz=0 then the\n \/\/ new buffer is expected to have the same size as the previous buffer.\n \/\/ The current buffer position is reset to the start of the buffer.\n \/\/ If the TBuffer owned the previous buffer, it will be deleted prior\n \/\/ to accepting the new buffer. By default the new buffer will be\n \/\/ adopted unless adopt is false.\n \/\/ If the new buffer is _not_ adopted and no memory allocation routine\n \/\/ is provided, a Fatal error will be issued if the Buffer attempts to\n \/\/ expand.\n\n if (fBuffer && TestBit(kIsOwner))\n delete [] fBuffer;\n\n if (adopt)\n SetBit(kIsOwner);\n else\n ResetBit(kIsOwner);\n\n fBuffer = (char *)buf;\n fBufCur = fBuffer;\n if (newsiz > 0) {\n fBufSize = newsiz - kExtraSpace;\n }\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( reallocfunc );\n\n if (buf && fBufSize < kMinimalSize) {\n Expand( kMinimalSize );\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::Expand(Int_t newsize)\n{\n \/\/ Expand the I\/O buffer to newsize bytes.\n\n Int_t l = Length();\n fBuffer = fReAllocFunc(fBuffer, newsize+kExtraSpace,\n fBufSize+kExtraSpace);\n if (fBuffer == 0) {\n if (fReAllocFunc == TStorage::ReAllocChar) {\n Fatal(\"Expand\",\"Failed to expand the data buffer using TStorage::ReAllocChar.\");\n } if (fReAllocFunc == R__NoReAllocChar) {\n Fatal(\"Expand\",\"Failed to expand the data buffer because TBuffer does not own it and no custom memory reallocator was provided.\"); \n } else {\n Fatal(\"Expand\",\"Failed to expand the data buffer using custom memory reallocator 0x%lx.\", fReAllocFunc);\n }\n }\n fBufSize = newsize;\n fBufCur = fBuffer + l;\n fBufMax = fBuffer + fBufSize;\n}\n\n\/\/______________________________________________________________________________\nTObject *TBuffer::GetParent() const\n{\n \/\/ Return pointer to parent of this buffer.\n\n return fParent;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetParent(TObject *parent)\n{\n \/\/ Set parent owning this buffer.\n\n fParent = parent;\n}\n\/\/______________________________________________________________________________\nReAllocCharFun_t TBuffer::GetReAllocFunc() \n{\n \/\/ Return the reallocation method currently used.\n return fReAllocFunc;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetReAllocFunc(ReAllocCharFun_t reallocfunc )\n{\n \/\/ Set which memory reallocation method to use. If reallocafunc is null,\n \/\/ reset it to the defaul value (TStorage::ReAlloc)\n \n if (reallocfunc) {\n fReAllocFunc = reallocfunc;\n } else {\n if (TestBit(kIsOwner)) {\n fReAllocFunc = TStorage::ReAllocChar;\n } else {\n fReAllocFunc = R__NoReAllocChar;\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetReadMode()\n{\n \/\/ Set buffer in read mode.\n\n fMode = kRead;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetWriteMode()\n{\n \/\/ Set buffer in write mode.\n\n fMode = kWrite;\n}\n\n\/\/______________________________________________________________________________\nTClass *TBuffer::GetClass(const type_info &typeinfo)\n{\n \/\/ Forward to TROOT::GetClass().\n\n return TClass::GetClass(typeinfo);\n}\n\n\/\/______________________________________________________________________________\nTClass *TBuffer::GetClass(const char *className)\n{\n \/\/ Forward to TROOT::GetClass().\n\n return TClass::GetClass(className);\n}\n\n\/\/______________________________________________________________________________\nTProcessID *TBuffer::ReadProcessID(UShort_t pidf)\n{\n \/\/ Return the current PRocessID.\n\n if (!pidf) return TProcessID::GetPID(); \/\/may happen when cloning an object\n return 0;\n}\n\n\/\/______________________________________________________________________________\nUShort_t TBuffer::WriteProcessID(TProcessID *)\n{\n \/\/ Always return 0 (current processID).\n\n return 0;\n}\n<commit_msg>Do not resize user provide buffer when the buffer is reading. When writing only resize it when it is smaller then kExtraSpace (i.e. 8 bytes)<commit_after>\/\/ @(#)root\/base:$Id$\n\/\/ Author: Fons Rademakers 04\/05\/96\n\n\/*************************************************************************\n * Copyright (C) 1995-2000, Rene Brun and Fons Rademakers. *\n * All rights reserved. *\n * *\n * For the licensing terms see $ROOTSYS\/LICENSE. *\n * For the list of contributors see $ROOTSYS\/README\/CREDITS. *\n *************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ TBuffer \/\/\n\/\/ \/\/\n\/\/ Buffer base class used for serializing objects. \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TBuffer.h\"\n#include \"TClass.h\"\n#include \"TProcessID.h\"\n\nconst Int_t kExtraSpace = 8; \/\/ extra space at end of buffer (used for free block count)\n\nClassImp(TBuffer)\n\n\/\/______________________________________________________________________________\nstatic char *R__NoReAllocChar(char *, size_t, size_t)\n{\n \/\/ The user has provided memory than we don't own, thus we can not extent it\n \/\/ either.\n return 0;\n}\n\n\/\/______________________________________________________________________________\nstatic inline ULong_t Void_Hash(const void *ptr)\n{\n \/\/ Return hash value for this object.\n\n return TString::Hash(&ptr, sizeof(void*));\n}\n\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite. By default the I\/O buffer has a size of\n \/\/ TBuffer::kInitialSize (1024) bytes.\n\n fBufSize = kInitialSize;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n fBuffer = new char[fBufSize+kExtraSpace];\n\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( 0 );\n}\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode, Int_t bufsiz)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite.\n\n if (bufsiz < kMinimalSize) bufsiz = kMinimalSize;\n fBufSize = bufsiz;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n fBuffer = new char[fBufSize+kExtraSpace];\n\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n\n SetReAllocFunc( 0 );\n}\n\n\/\/______________________________________________________________________________\nTBuffer::TBuffer(EMode mode, Int_t bufsiz, void *buf, Bool_t adopt, ReAllocCharFun_t reallocfunc)\n{\n \/\/ Create an I\/O buffer object. Mode should be either TBuffer::kRead or\n \/\/ TBuffer::kWrite. By default the I\/O buffer has a size of\n \/\/ TBuffer::kInitialSize (1024) bytes. An external buffer can be passed\n \/\/ to TBuffer via the buf argument. By default this buffer will be adopted\n \/\/ unless adopt is false.\n \/\/ If the new buffer is _not_ adopted and no memory allocation routine\n \/\/ is provided, a Fatal error will be issued if the Buffer attempts to\n \/\/ expand.\n \n fBufSize = bufsiz;\n fMode = mode;\n fVersion = 0;\n fParent = 0;\n\n SetBit(kIsOwner);\n\n if (buf) {\n fBuffer = (char *)buf;\n fBufSize -= kExtraSpace;\n if (!adopt) ResetBit(kIsOwner);\n } else {\n if (fBufSize < kMinimalSize) {\n fBufSize = kMinimalSize;\n }\n fBuffer = new char[fBufSize+kExtraSpace];\n }\n fBufCur = fBuffer;\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( reallocfunc );\n\n if (buf && ( (fMode&kWrite)!=0 ) && fBufSize < 0) {\n Expand( kMinimalSize );\n }\n}\n\n\/\/______________________________________________________________________________\nTBuffer::~TBuffer()\n{\n \/\/ Delete an I\/O buffer object.\n\n if (TestBit(kIsOwner)) {\n \/\/printf(\"Deleting fBuffer=%lx\\n\", fBuffer);\n delete [] fBuffer;\n }\n fBuffer = 0;\n fParent = 0;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetBuffer(void *buf, UInt_t newsiz, Bool_t adopt, ReAllocCharFun_t reallocfunc)\n{\n \/\/ Sets a new buffer in an existing TBuffer object. If newsiz=0 then the\n \/\/ new buffer is expected to have the same size as the previous buffer.\n \/\/ The current buffer position is reset to the start of the buffer.\n \/\/ If the TBuffer owned the previous buffer, it will be deleted prior\n \/\/ to accepting the new buffer. By default the new buffer will be\n \/\/ adopted unless adopt is false.\n \/\/ If the new buffer is _not_ adopted and no memory allocation routine\n \/\/ is provided, a Fatal error will be issued if the Buffer attempts to\n \/\/ expand.\n\n if (fBuffer && TestBit(kIsOwner))\n delete [] fBuffer;\n\n if (adopt)\n SetBit(kIsOwner);\n else\n ResetBit(kIsOwner);\n\n fBuffer = (char *)buf;\n fBufCur = fBuffer;\n if (newsiz > 0) {\n fBufSize = newsiz - kExtraSpace;\n }\n fBufMax = fBuffer + fBufSize;\n \n SetReAllocFunc( reallocfunc );\n\n if (buf && fBufSize < kMinimalSize) {\n Expand( kMinimalSize );\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::Expand(Int_t newsize)\n{\n \/\/ Expand the I\/O buffer to newsize bytes.\n\n Int_t l = Length();\n fBuffer = fReAllocFunc(fBuffer, newsize+kExtraSpace,\n fBufSize+kExtraSpace);\n if (fBuffer == 0) {\n if (fReAllocFunc == TStorage::ReAllocChar) {\n Fatal(\"Expand\",\"Failed to expand the data buffer using TStorage::ReAllocChar.\");\n } if (fReAllocFunc == R__NoReAllocChar) {\n Fatal(\"Expand\",\"Failed to expand the data buffer because TBuffer does not own it and no custom memory reallocator was provided.\"); \n } else {\n Fatal(\"Expand\",\"Failed to expand the data buffer using custom memory reallocator 0x%lx.\", fReAllocFunc);\n }\n }\n fBufSize = newsize;\n fBufCur = fBuffer + l;\n fBufMax = fBuffer + fBufSize;\n}\n\n\/\/______________________________________________________________________________\nTObject *TBuffer::GetParent() const\n{\n \/\/ Return pointer to parent of this buffer.\n\n return fParent;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetParent(TObject *parent)\n{\n \/\/ Set parent owning this buffer.\n\n fParent = parent;\n}\n\/\/______________________________________________________________________________\nReAllocCharFun_t TBuffer::GetReAllocFunc() \n{\n \/\/ Return the reallocation method currently used.\n return fReAllocFunc;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetReAllocFunc(ReAllocCharFun_t reallocfunc )\n{\n \/\/ Set which memory reallocation method to use. If reallocafunc is null,\n \/\/ reset it to the defaul value (TStorage::ReAlloc)\n \n if (reallocfunc) {\n fReAllocFunc = reallocfunc;\n } else {\n if (TestBit(kIsOwner)) {\n fReAllocFunc = TStorage::ReAllocChar;\n } else {\n fReAllocFunc = R__NoReAllocChar;\n }\n }\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetReadMode()\n{\n \/\/ Set buffer in read mode.\n\n fMode = kRead;\n}\n\n\/\/______________________________________________________________________________\nvoid TBuffer::SetWriteMode()\n{\n \/\/ Set buffer in write mode.\n\n fMode = kWrite;\n}\n\n\/\/______________________________________________________________________________\nTClass *TBuffer::GetClass(const type_info &typeinfo)\n{\n \/\/ Forward to TROOT::GetClass().\n\n return TClass::GetClass(typeinfo);\n}\n\n\/\/______________________________________________________________________________\nTClass *TBuffer::GetClass(const char *className)\n{\n \/\/ Forward to TROOT::GetClass().\n\n return TClass::GetClass(className);\n}\n\n\/\/______________________________________________________________________________\nTProcessID *TBuffer::ReadProcessID(UShort_t pidf)\n{\n \/\/ Return the current PRocessID.\n\n if (!pidf) return TProcessID::GetPID(); \/\/may happen when cloning an object\n return 0;\n}\n\n\/\/______________________________________________________________________________\nUShort_t TBuffer::WriteProcessID(TProcessID *)\n{\n \/\/ Always return 0 (current processID).\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/----------------------------------------------------------------------------\/\/\n\/\/ \/\/\n\/\/ ozz-animation is hosted at http:\/\/github.com\/guillaumeblanc\/ozz-animation \/\/\n\/\/ and distributed under the MIT License (MIT). \/\/\n\/\/ \/\/\n\/\/ Copyright (c) 2015 Guillaume Blanc \/\/\n\/\/ \/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a \/\/\n\/\/ copy of this software and associated documentation files (the \"Software\"), \/\/\n\/\/ to deal in the Software without restriction, including without limitation \/\/\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, \/\/\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the \/\/\n\/\/ Software is furnished to do so, subject to the following conditions: \/\/\n\/\/ \/\/\n\/\/ The above copyright notice and this permission notice shall be included in \/\/\n\/\/ all copies or substantial portions of the Software. \/\/\n\/\/ \/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \/\/\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \/\/\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL \/\/\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \/\/\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \/\/\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \/\/\n\/\/ DEALINGS IN THE SOFTWARE. \/\/\n\/\/ \/\/\n\/\/----------------------------------------------------------------------------\/\/\n\n#define OZZ_INCLUDE_PRIVATE_HEADER \/\/ Allows to include private headers.\n\n#include \"animation\/offline\/fbx\/fbx_animation.h\"\n\n#include \"ozz\/animation\/runtime\/skeleton.h\"\n#include \"ozz\/animation\/runtime\/skeleton_utils.h\"\n#include \"ozz\/animation\/offline\/raw_animation.h\"\n\n#include \"ozz\/base\/log.h\"\n\n#include \"ozz\/base\/maths\/transform.h\"\n\nnamespace ozz {\nnamespace animation {\nnamespace offline {\nnamespace fbx {\n\nnamespace {\nbool ExtractAnimation(FbxSceneLoader* _scene_loader,\n FbxAnimStack* anim_stack,\n const Skeleton& _skeleton,\n float _sampling_rate,\n RawAnimation* _animation) {\n FbxScene* scene = _scene_loader->scene();\n assert(scene);\n\n \/\/ Setup Fbx animation evaluator.\n scene->SetCurrentAnimationStack(anim_stack);\n\n \/\/ Extract animation duration.\n FbxTimeSpan time_spawn;\n const FbxTakeInfo* take_info = scene->GetTakeInfo(anim_stack->GetName());\n if (take_info)\n {\n time_spawn = take_info->mLocalTimeSpan;\n } else {\n scene->GetGlobalSettings().GetTimelineDefaultTimeSpan(time_spawn);\n }\n\n float start = static_cast<float>(time_spawn.GetStart().GetSecondDouble());\n float end = static_cast<float>(time_spawn.GetStop().GetSecondDouble());\n\n \/\/ Animation duration could be 0 if it's just a pose. In this case we'll set a\n \/\/ default 1s duration.\n if (end > start) {\n _animation->duration = end - start;\n } else {\n _animation->duration = 1.f;\n }\n\n \/\/ Allocates all tracks with the same number of joints as the skeleton.\n \/\/ Tracks that would not be found will be set to skeleton bind-pose\n \/\/ transformation.\n _animation->tracks.resize(_skeleton.num_joints());\n\n \/\/ Iterate all skeleton joints and fills there track with key frames.\n FbxAnimEvaluator* evaluator = scene->GetAnimationEvaluator();\n for (int i = 0; i < _skeleton.num_joints(); i++) {\n RawAnimation::JointTrack& track = _animation->tracks[i];\n\n \/\/ Find a node that matches skeleton joint.\n const char* joint_name = _skeleton.joint_names()[i];\n FbxNode* node = scene->FindNodeByName(joint_name);\n\n if (!node) {\n \/\/ Empty joint track.\n ozz::log::Log() << \"No animation track found for joint \\\"\" << joint_name\n << \"\\\". Using skeleton bind pose instead.\" << std::endl;\n\n \/\/ Get joint's bind pose.\n const ozz::math::Transform& bind_pose =\n ozz::animation::GetJointLocalBindPose(_skeleton, i);\n\n const RawAnimation::TranslationKey tkey = {0.f, bind_pose.translation};\n track.translations.push_back(tkey);\n\n const RawAnimation::RotationKey rkey = {0.f, bind_pose.rotation};\n track.rotations.push_back(rkey);\n\n const RawAnimation::ScaleKey skey = {0.f, bind_pose.scale};\n track.scales.push_back(skey);\n\n continue;\n }\n\n \/\/ Reserve keys in animation tracks (allocation strategy optimization\n \/\/ purpose).\n const float sampling_period = 1.f \/ _sampling_rate;\n const int max_keys =\n static_cast<int>(3.f + (end - start) \/ sampling_period);\n track.translations.reserve(max_keys);\n track.rotations.reserve(max_keys);\n track.scales.reserve(max_keys);\n\n \/\/ Evaluate joint transformation at the specified time.\n \/\/ Make sure to include \"end\" time, and enter the loop once at least.\n bool loop_again = true;\n for (float t = start; loop_again; t += sampling_period) {\n if (t >= end) {\n t = end;\n loop_again = false;\n }\n\n \/\/ Evaluate local transform at fbx_time.\n const ozz::math::Transform transform =\n _scene_loader->converter()->ConvertTransform(\n _skeleton.joint_properties()[i].parent == Skeleton::kNoParentIndex?\n evaluator->GetNodeGlobalTransform(node, FbxTimeSeconds(t)):\n evaluator->GetNodeLocalTransform(node, FbxTimeSeconds(t)));\n\n \/\/ Fills corresponding track.\n const float local_time = t - start;\n const RawAnimation::TranslationKey translation = {\n local_time, transform.translation};\n track.translations.push_back(translation);\n const RawAnimation::RotationKey rotation = {\n local_time, transform.rotation};\n track.rotations.push_back(rotation);\n const RawAnimation::ScaleKey scale = {\n local_time, transform.scale};\n track.scales.push_back(scale);\n }\n }\n\n \/\/ Output animation must be valid at that point.\n assert(_animation->Validate());\n\n return true;\n}\n}\n\nbool ExtractAnimation(FbxSceneLoader* _scene_loader,\n const Skeleton& _skeleton,\n float _sampling_rate,\n RawAnimation* _animation) {\n FbxScene* scene = _scene_loader->scene();\n assert(scene);\n\n int anim_stacks_count = scene->GetSrcObjectCount<FbxAnimStack>();\n\n \/\/ Early out if no animation's found.\n if(anim_stacks_count == 0) {\n ozz::log::Err() << \"No animation found.\" << std::endl;\n return false;\n }\n \n if (anim_stacks_count > 1) {\n ozz::log::Log() << anim_stacks_count <<\n \" animations found. Only the first one will be exported.\" << std::endl;\n }\n\n \/\/ Arbitrarily take the first animation of the stack.\n FbxAnimStack* anim_stack = scene->GetSrcObject<FbxAnimStack>(0);\n ozz::log::Log() << \"Extracting animation \\\"\" << anim_stack->GetName() << \"\\\"\"\n << std::endl;\n return ExtractAnimation(_scene_loader,\n anim_stack,\n _skeleton,\n _sampling_rate,\n _animation);\n}\n} \/\/ fbx\n} \/\/ offline\n} \/\/ animation\n} \/\/ ozz\n<commit_msg>Pushes some logs from fbx2anim to LogV.<commit_after>\/\/----------------------------------------------------------------------------\/\/\n\/\/ \/\/\n\/\/ ozz-animation is hosted at http:\/\/github.com\/guillaumeblanc\/ozz-animation \/\/\n\/\/ and distributed under the MIT License (MIT). \/\/\n\/\/ \/\/\n\/\/ Copyright (c) 2015 Guillaume Blanc \/\/\n\/\/ \/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a \/\/\n\/\/ copy of this software and associated documentation files (the \"Software\"), \/\/\n\/\/ to deal in the Software without restriction, including without limitation \/\/\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, \/\/\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the \/\/\n\/\/ Software is furnished to do so, subject to the following conditions: \/\/\n\/\/ \/\/\n\/\/ The above copyright notice and this permission notice shall be included in \/\/\n\/\/ all copies or substantial portions of the Software. \/\/\n\/\/ \/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \/\/\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \/\/\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL \/\/\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \/\/\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \/\/\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \/\/\n\/\/ DEALINGS IN THE SOFTWARE. \/\/\n\/\/ \/\/\n\/\/----------------------------------------------------------------------------\/\/\n\n#define OZZ_INCLUDE_PRIVATE_HEADER \/\/ Allows to include private headers.\n\n#include \"animation\/offline\/fbx\/fbx_animation.h\"\n\n#include \"ozz\/animation\/runtime\/skeleton.h\"\n#include \"ozz\/animation\/runtime\/skeleton_utils.h\"\n#include \"ozz\/animation\/offline\/raw_animation.h\"\n\n#include \"ozz\/base\/log.h\"\n\n#include \"ozz\/base\/maths\/transform.h\"\n\nnamespace ozz {\nnamespace animation {\nnamespace offline {\nnamespace fbx {\n\nnamespace {\nbool ExtractAnimation(FbxSceneLoader* _scene_loader,\n FbxAnimStack* anim_stack,\n const Skeleton& _skeleton,\n float _sampling_rate,\n RawAnimation* _animation) {\n FbxScene* scene = _scene_loader->scene();\n assert(scene);\n\n \/\/ Setup Fbx animation evaluator.\n scene->SetCurrentAnimationStack(anim_stack);\n\n \/\/ Extract animation duration.\n FbxTimeSpan time_spawn;\n const FbxTakeInfo* take_info = scene->GetTakeInfo(anim_stack->GetName());\n if (take_info)\n {\n time_spawn = take_info->mLocalTimeSpan;\n } else {\n scene->GetGlobalSettings().GetTimelineDefaultTimeSpan(time_spawn);\n }\n\n float start = static_cast<float>(time_spawn.GetStart().GetSecondDouble());\n float end = static_cast<float>(time_spawn.GetStop().GetSecondDouble());\n\n \/\/ Animation duration could be 0 if it's just a pose. In this case we'll set a\n \/\/ default 1s duration.\n if (end > start) {\n _animation->duration = end - start;\n } else {\n _animation->duration = 1.f;\n }\n\n \/\/ Allocates all tracks with the same number of joints as the skeleton.\n \/\/ Tracks that would not be found will be set to skeleton bind-pose\n \/\/ transformation.\n _animation->tracks.resize(_skeleton.num_joints());\n\n \/\/ Iterate all skeleton joints and fills there track with key frames.\n FbxAnimEvaluator* evaluator = scene->GetAnimationEvaluator();\n for (int i = 0; i < _skeleton.num_joints(); i++) {\n RawAnimation::JointTrack& track = _animation->tracks[i];\n\n \/\/ Find a node that matches skeleton joint.\n const char* joint_name = _skeleton.joint_names()[i];\n FbxNode* node = scene->FindNodeByName(joint_name);\n\n if (!node) {\n \/\/ Empty joint track.\n ozz::log::LogV() << \"No animation track found for joint \\\"\" << joint_name\n << \"\\\". Using skeleton bind pose instead.\" << std::endl;\n\n \/\/ Get joint's bind pose.\n const ozz::math::Transform& bind_pose =\n ozz::animation::GetJointLocalBindPose(_skeleton, i);\n\n const RawAnimation::TranslationKey tkey = {0.f, bind_pose.translation};\n track.translations.push_back(tkey);\n\n const RawAnimation::RotationKey rkey = {0.f, bind_pose.rotation};\n track.rotations.push_back(rkey);\n\n const RawAnimation::ScaleKey skey = {0.f, bind_pose.scale};\n track.scales.push_back(skey);\n\n continue;\n }\n\n \/\/ Reserve keys in animation tracks (allocation strategy optimization\n \/\/ purpose).\n const float sampling_period = 1.f \/ _sampling_rate;\n const int max_keys =\n static_cast<int>(3.f + (end - start) \/ sampling_period);\n track.translations.reserve(max_keys);\n track.rotations.reserve(max_keys);\n track.scales.reserve(max_keys);\n\n \/\/ Evaluate joint transformation at the specified time.\n \/\/ Make sure to include \"end\" time, and enter the loop once at least.\n bool loop_again = true;\n for (float t = start; loop_again; t += sampling_period) {\n if (t >= end) {\n t = end;\n loop_again = false;\n }\n\n \/\/ Evaluate local transform at fbx_time.\n const ozz::math::Transform transform =\n _scene_loader->converter()->ConvertTransform(\n _skeleton.joint_properties()[i].parent == Skeleton::kNoParentIndex?\n evaluator->GetNodeGlobalTransform(node, FbxTimeSeconds(t)):\n evaluator->GetNodeLocalTransform(node, FbxTimeSeconds(t)));\n\n \/\/ Fills corresponding track.\n const float local_time = t - start;\n const RawAnimation::TranslationKey translation = {\n local_time, transform.translation};\n track.translations.push_back(translation);\n const RawAnimation::RotationKey rotation = {\n local_time, transform.rotation};\n track.rotations.push_back(rotation);\n const RawAnimation::ScaleKey scale = {\n local_time, transform.scale};\n track.scales.push_back(scale);\n }\n }\n\n \/\/ Output animation must be valid at that point.\n assert(_animation->Validate());\n\n return true;\n}\n}\n\nbool ExtractAnimation(FbxSceneLoader* _scene_loader,\n const Skeleton& _skeleton,\n float _sampling_rate,\n RawAnimation* _animation) {\n FbxScene* scene = _scene_loader->scene();\n assert(scene);\n\n int anim_stacks_count = scene->GetSrcObjectCount<FbxAnimStack>();\n\n \/\/ Early out if no animation's found.\n if(anim_stacks_count == 0) {\n ozz::log::Err() << \"No animation found.\" << std::endl;\n return false;\n }\n \n if (anim_stacks_count > 1) {\n ozz::log::Log() << anim_stacks_count <<\n \" animations found. Only the first one will be exported.\" << std::endl;\n }\n\n \/\/ Arbitrarily take the first animation of the stack.\n FbxAnimStack* anim_stack = scene->GetSrcObject<FbxAnimStack>(0);\n ozz::log::Log() << \"Extracting animation \\\"\" << anim_stack->GetName() << \"\\\"\"\n << std::endl;\n return ExtractAnimation(_scene_loader,\n anim_stack,\n _skeleton,\n _sampling_rate,\n _animation);\n}\n} \/\/ fbx\n} \/\/ offline\n} \/\/ animation\n} \/\/ ozz\n<|endoftext|>"} {"text":"<commit_before>#include \"Core.h\"\n#include \"Tracker.h\"\n\n#include <map>\n\nCore::Core()\n : mGameRunning( false ),\n mGameMode( MODE_UNKNOWN ),\n mOutcome( OUTCOME_UNKNOWN ),\n mOrder( ORDER_UNKNOWN ),\n mOwnClass( CLASS_UNKNOWN ),\n mOpponentClass( CLASS_UNKNOWN ),\n mDuration( 0 ),\n mRank( RANK_UNKNOWN ),\n mLegend( LEGEND_UNKNOWN ),\n mGameClientRestartRequired( false )\n{\n mTimer = new QTimer( this );\n connect( mTimer, SIGNAL( timeout() ), this, SLOT( Tick() ) );\n mTimer->start( 1000 );\n\n \/\/ Connect log\n connect( &mLogTracker, SIGNAL( HandleOutcome(Outcome) ), this, SLOT( HandleOutcome(Outcome) ) );\n connect( &mLogTracker, SIGNAL( HandleOrder(GoingOrder) ), this, SLOT( HandleOrder(GoingOrder) ) );\n connect( &mLogTracker, SIGNAL( HandleOwnClass(Class) ), this, SLOT( HandleOwnClass(Class) ) ) ;\n connect( &mLogTracker, SIGNAL( HandleOpponentClass(Class) ), this, SLOT( HandleOpponentClass(Class) ) );\n connect( &mLogTracker, SIGNAL( HandleGameMode(GameMode) ), this, SLOT( HandleGameMode(GameMode) ) );\n connect( &mLogTracker, SIGNAL( HandleRank(int) ), this, SLOT( HandleRank(int) ) );\n connect( &mLogTracker, SIGNAL( HandleLegend(int) ), this, SLOT( HandleLegend(int) ) );\n connect( &mLogTracker, SIGNAL( HandleTurn(int) ), this, SLOT( HandleTurn(int) ) );\n\n connect( &mLogTracker, SIGNAL( HandleMatchStart() ), this, SLOT( HandleMatchStart() ) );\n connect( &mLogTracker, SIGNAL( HandleMatchEnd(const ::CardHistoryList&, bool) ), this, SLOT( HandleMatchEnd(const ::CardHistoryList&, bool) ) );\n\n ResetResult();\n}\n\nCore::~Core() {\n delete mTimer;\n}\n\nvoid Core::ResetResult() {\n mGameMode = MODE_UNKNOWN;\n mOutcome = OUTCOME_UNKNOWN;\n mOrder = ORDER_UNKNOWN;\n mOwnClass = CLASS_UNKNOWN;\n mOpponentClass = CLASS_UNKNOWN;\n mDuration = 0;\n mCardHistoryList.clear();\n mRank = RANK_UNKNOWN;\n mLegend = LEGEND_UNKNOWN;\n\n mRanks.clear();\n}\n\nvoid Core::Tick() {\n bool wasGameRunning = mGameRunning;\n mGameRunning = Hearthstone::Instance()->Running();\n\n if( wasGameRunning != mGameRunning ) {\n if( mGameRunning ) {\n LOG(\"Hearthstone found\");\n } else {\n LOG(\"Hearthstone was closed\");\n Hearthstone::Instance()->SetRestartRequired( false );\n }\n }\n\n if( mGameClientRestartRequired != Hearthstone::Instance()->RestartRequired() ) {\n mGameClientRestartRequired = Hearthstone::Instance()->RestartRequired();\n emit HandleGameClientRestartRequired( mGameClientRestartRequired );\n }\n}\n\nvoid Core::HandleOrder( GoingOrder order ) {\n DEBUG( \"HandleOrder %s\", ORDER_NAMES[ order ] );\n mOrder = order;\n}\n\nvoid Core::HandleOutcome( Outcome outcome ) {\n DEBUG( \"HandleOutcome %s\", OUTCOME_NAMES[ outcome ] );\n mOutcome = outcome;\n}\n\nvoid Core::HandleOwnClass( Class ownClass ) {\n DEBUG( \"HandleOwnClass %s\", CLASS_NAMES[ ownClass ] );\n mOwnClass = ownClass;\n}\n\nvoid Core::HandleOpponentClass( Class opponentClass ) {\n DEBUG( \"HandleOpponentClass %s\", CLASS_NAMES[ opponentClass ] );\n mOpponentClass = opponentClass;\n}\n\nvoid Core::HandleMatchStart() {\n DEBUG( \"HandleMatchStart\" );\n mDurationTimer.start();\n}\n\nvoid Core::HandleMatchEnd( const ::CardHistoryList& cardHistoryList, bool wasSpectating ) {\n if( wasSpectating ) {\n LOG( \"Ignore spectated match\" );\n ResetResult();\n return;\n }\n\n DEBUG( \"HandleMatchEnd\" );\n mCardHistoryList = cardHistoryList;\n mDuration = mDurationTimer.elapsed() \/ 1000;\n UploadResult();\n}\n\nvoid Core::HandleGameMode( GameMode mode ) {\n DEBUG( \"HandleGameMode %s\", MODE_NAMES[ mode ] );\n mGameMode = mode;\n}\n\nvoid Core::HandleRank( int rank ) {\n DEBUG( \"Set Rank %d\", rank );\n mRank = rank;\n}\n\nvoid Core::HandleLegend( int legend ) {\n DEBUG( \"Set Legend %d\", legend );\n mLegend = legend;\n}\n\nvoid Core::HandleTurn( int turn ) {\n int rank = mRankClassifier.DetectCurrentRank();\n mRanks.push_back( rank );\n DEBUG( \"Turn %d. Set Rank %d\", turn, rank );\n}\n\n\/\/ Screen capture can be tricky\n\/\/ So capture the rank a few times during the game\n\/\/ and the majority vote will be the determined rank\nint Core::DetermineRank() {\n std::map< int, int > votesByRank;\n\n int maxVote = 0;\n int maxRank = RANK_UNKNOWN;\n\n for( std::vector<int>::iterator it = mRanks.begin(); it != mRanks.end(); ++it ) {\n votesByRank[ *it ] += 1;\n }\n\n for( std::map<int,int>::iterator it = votesByRank.begin(); it != votesByRank.end(); ++it ) {\n if( (*it).second > maxVote ) {\n maxVote = (*it).second;\n maxRank = (*it).first;\n }\n }\n\n return maxRank;\n}\n\nvoid Core::UploadResult() {\n DEBUG( \"UploadResult\" );\n\n int rank = DetermineRank();\n\n DEBUG( \"Determined Rank: %d\", rank );\n\n Tracker::Instance()->AddResult( mGameMode,\n mOutcome,\n mOrder,\n mOwnClass,\n mOpponentClass,\n mLogTracker.CardHistoryList(),\n mDuration,\n rank,\n mLegend );\n\n ResetResult();\n}\n<commit_msg>Add debug output<commit_after>#include \"Core.h\"\n#include \"Tracker.h\"\n\n#include <map>\n\nCore::Core()\n : mGameRunning( false ),\n mGameMode( MODE_UNKNOWN ),\n mOutcome( OUTCOME_UNKNOWN ),\n mOrder( ORDER_UNKNOWN ),\n mOwnClass( CLASS_UNKNOWN ),\n mOpponentClass( CLASS_UNKNOWN ),\n mDuration( 0 ),\n mRank( RANK_UNKNOWN ),\n mLegend( LEGEND_UNKNOWN ),\n mGameClientRestartRequired( false )\n{\n mTimer = new QTimer( this );\n connect( mTimer, SIGNAL( timeout() ), this, SLOT( Tick() ) );\n mTimer->start( 1000 );\n\n \/\/ Connect log\n connect( &mLogTracker, SIGNAL( HandleOutcome(Outcome) ), this, SLOT( HandleOutcome(Outcome) ) );\n connect( &mLogTracker, SIGNAL( HandleOrder(GoingOrder) ), this, SLOT( HandleOrder(GoingOrder) ) );\n connect( &mLogTracker, SIGNAL( HandleOwnClass(Class) ), this, SLOT( HandleOwnClass(Class) ) ) ;\n connect( &mLogTracker, SIGNAL( HandleOpponentClass(Class) ), this, SLOT( HandleOpponentClass(Class) ) );\n connect( &mLogTracker, SIGNAL( HandleGameMode(GameMode) ), this, SLOT( HandleGameMode(GameMode) ) );\n connect( &mLogTracker, SIGNAL( HandleRank(int) ), this, SLOT( HandleRank(int) ) );\n connect( &mLogTracker, SIGNAL( HandleLegend(int) ), this, SLOT( HandleLegend(int) ) );\n connect( &mLogTracker, SIGNAL( HandleTurn(int) ), this, SLOT( HandleTurn(int) ) );\n\n connect( &mLogTracker, SIGNAL( HandleMatchStart() ), this, SLOT( HandleMatchStart() ) );\n connect( &mLogTracker, SIGNAL( HandleMatchEnd(const ::CardHistoryList&, bool) ), this, SLOT( HandleMatchEnd(const ::CardHistoryList&, bool) ) );\n\n ResetResult();\n}\n\nCore::~Core() {\n delete mTimer;\n}\n\nvoid Core::ResetResult() {\n mGameMode = MODE_UNKNOWN;\n mOutcome = OUTCOME_UNKNOWN;\n mOrder = ORDER_UNKNOWN;\n mOwnClass = CLASS_UNKNOWN;\n mOpponentClass = CLASS_UNKNOWN;\n mDuration = 0;\n mCardHistoryList.clear();\n mRank = RANK_UNKNOWN;\n mLegend = LEGEND_UNKNOWN;\n\n mRanks.clear();\n}\n\nvoid Core::Tick() {\n bool wasGameRunning = mGameRunning;\n mGameRunning = Hearthstone::Instance()->Running();\n\n if( wasGameRunning != mGameRunning ) {\n if( mGameRunning ) {\n LOG(\"Hearthstone found\");\n } else {\n LOG(\"Hearthstone was closed\");\n Hearthstone::Instance()->SetRestartRequired( false );\n }\n }\n\n if( mGameClientRestartRequired != Hearthstone::Instance()->RestartRequired() ) {\n mGameClientRestartRequired = Hearthstone::Instance()->RestartRequired();\n emit HandleGameClientRestartRequired( mGameClientRestartRequired );\n }\n}\n\nvoid Core::HandleOrder( GoingOrder order ) {\n DEBUG( \"HandleOrder %s\", ORDER_NAMES[ order ] );\n mOrder = order;\n}\n\nvoid Core::HandleOutcome( Outcome outcome ) {\n DEBUG( \"HandleOutcome %s\", OUTCOME_NAMES[ outcome ] );\n mOutcome = outcome;\n}\n\nvoid Core::HandleOwnClass( Class ownClass ) {\n DEBUG( \"HandleOwnClass %s\", CLASS_NAMES[ ownClass ] );\n mOwnClass = ownClass;\n}\n\nvoid Core::HandleOpponentClass( Class opponentClass ) {\n DEBUG( \"HandleOpponentClass %s\", CLASS_NAMES[ opponentClass ] );\n mOpponentClass = opponentClass;\n}\n\nvoid Core::HandleMatchStart() {\n DEBUG( \"HandleMatchStart\" );\n mDurationTimer.start();\n}\n\nvoid Core::HandleMatchEnd( const ::CardHistoryList& cardHistoryList, bool wasSpectating ) {\n if( wasSpectating ) {\n LOG( \"Ignore spectated match\" );\n ResetResult();\n return;\n }\n\n DEBUG( \"HandleMatchEnd\" );\n mCardHistoryList = cardHistoryList;\n mDuration = mDurationTimer.elapsed() \/ 1000;\n UploadResult();\n}\n\nvoid Core::HandleGameMode( GameMode mode ) {\n DEBUG( \"HandleGameMode %s\", MODE_NAMES[ mode ] );\n mGameMode = mode;\n}\n\nvoid Core::HandleRank( int rank ) {\n DEBUG( \"Set Rank %d\", rank );\n mRank = rank;\n}\n\nvoid Core::HandleLegend( int legend ) {\n DEBUG( \"Set Legend %d\", legend );\n mLegend = legend;\n}\n\nvoid Core::HandleTurn( int turn ) {\n int rank = mRankClassifier.DetectCurrentRank();\n mRanks.push_back( rank );\n DEBUG( \"Turn %d. Set Rank %d\", turn, rank );\n}\n\n\/\/ Screen capture can be tricky\n\/\/ So capture the rank a few times during the game\n\/\/ and the majority vote will be the determined rank\nint Core::DetermineRank() {\n std::map< int, int > votesByRank;\n\n int maxVote = 0;\n int maxRank = RANK_UNKNOWN;\n\n for( std::vector<int>::iterator it = mRanks.begin(); it != mRanks.end(); ++it ) {\n votesByRank[ *it ] += 1;\n }\n\n for( std::map<int,int>::iterator it = votesByRank.begin(); it != votesByRank.end(); ++it ) {\n DEBUG( \"Rank %d has %d votes\", (*it).first, (*it).second );\n if( (*it).second > maxVote ) {\n maxVote = (*it).second;\n maxRank = (*it).first;\n }\n }\n\n return maxRank;\n}\n\nvoid Core::UploadResult() {\n DEBUG( \"UploadResult\" );\n\n int rank = DetermineRank();\n\n DEBUG( \"Determined Rank: %d\", rank );\n\n Tracker::Instance()->AddResult( mGameMode,\n mOutcome,\n mOrder,\n mOwnClass,\n mOpponentClass,\n mLogTracker.CardHistoryList(),\n mDuration,\n rank,\n mLegend );\n\n ResetResult();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <string>\n#include <cstdlib>\n#include <mutex>\n#include <random>\n#include <math.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n#include <nix\/util\/util.hpp>\n#include <boost\/random.hpp>\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#include <nix\/base\/IDimensions.hpp>\n\n\nusing namespace std;\n\nnamespace nix {\nnamespace util {\n\n\/\/ Base32hex alphabet (RFC 4648)\nconst char* ID_ALPHABET = \"0123456789abcdefghijklmnopqrstuv\";\n\/\/ Unit scaling, SI only, substitutions for micro and ohm...\nconst string PREFIXES = \"(Y|Z|E|P|T|G|M|k|h|da|d|c|m|u|n|p|f|a|z|y)\";\nconst string UNITS = \"(m|g|s|A|K|mol|cd|Hz|N|Pa|J|W|C|V|F|S|Wb|T|H|lm|lx|Bq|Gy|Sv|kat|l|L|Ohm|%|dB|rad)\";\nconst string POWER = \"(\\\\^[+-]?[1-9]\\\\d*)\";\n\nconst map<string, double> PREFIX_FACTORS = {{\"y\", 1.0e-24}, {\"z\", 1.0e-21}, {\"a\", 1.0e-18}, {\"f\", 1.0e-15},\n {\"p\", 1.0e-12}, {\"n\",1.0e-9}, {\"u\", 1.0e-6}, {\"m\", 1.0e-3}, {\"c\", 1.0e-2}, {\"d\",1.0e-1}, {\"da\", 1.0e1}, {\"h\", 1.0e2},\n {\"k\", 1.0e3}, {\"M\",1.0e6}, {\"G\", 1.0e9}, {\"T\", 1.0e12}, {\"P\", 1.0e15}, {\"E\",1.0e18}, {\"Z\", 1.0e21}, {\"Y\", 1.0e24}};\n\n\nstring createId() {\n static boost::mt19937 ran(std::time(0));\n static boost::uuids::basic_random_generator<boost::mt19937> gen(&ran);\n boost::uuids::uuid u = gen();\n return boost::uuids::to_string(u);\n}\n\n\nstring timeToStr(time_t time) {\n using namespace boost::posix_time;\n ptime timetmp = from_time_t(time);\n return to_iso_string(timetmp);\n}\n\n\ntime_t strToTime(const string &time) {\n using namespace boost::posix_time;\n ptime timetmp(from_iso_string(time));\n ptime epoch(boost::gregorian::date(1970, 1, 1));\n return (timetmp - epoch).total_seconds();\n}\n\n\ntime_t getTime() {\n return time(NULL);\n}\n\n\nvoid deblankString(std::string &str) {\n typedef std::string::value_type char_type;\n\n str.erase(std::remove_if(str.begin(),\n str.end(),\n [](char_type c) { return std::isblank(c); }),\n str.end());\n}\n\nstd::string deblankString(const std::string &str) {\n std::string str_copy = str;\n deblankString(str_copy);\n return str_copy;\n}\n\nbool nameCheck(const std::string &name) {\n return name.find(\"\/\") == std::string::npos;\n}\n\nstd::string nameSanitizer(const std::string &name) {\n std::string str_copy = name;\n size_t pos = str_copy.find(\"\/\");\n \n while(pos != std::string::npos) {\n str_copy = str_copy.replace(pos, 1, \"_\");\n pos = str_copy.find(\"\/\");\n }\n \n return str_copy; \n}\n\nstd::string unitSanitizer(const std::string &unit) {\n std::string new_unit = deblankString(unit);\n while (new_unit.find(\"mu\") != string::npos) {\n size_t pos = new_unit.find(\"mu\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n while (new_unit.find(\"µ\") != string::npos) {\n size_t pos = new_unit.find(\"µ\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n return new_unit;\n}\n\nvoid splitUnit(const string &combinedUnit, string &prefix, string &unit, string &power) {\n boost::regex prefix_and_unit_and_power(PREFIXES + UNITS + POWER);\n boost::regex prefix_and_unit(PREFIXES + UNITS);\n boost::regex unit_and_power(UNITS + POWER);\n boost::regex unit_only(UNITS);\n boost::regex prefix_only(PREFIXES);\n\n if (boost::regex_match(combinedUnit, prefix_and_unit_and_power)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n string suffix = m.suffix();\n boost::regex_search(suffix, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, unit_and_power)) {\n prefix = \"\";\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, prefix_and_unit)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n unit = m.suffix();\n power = \"\";\n } else {\n unit = combinedUnit;\n prefix = \"\";\n power = \"\";\n }\n}\n\n\nvoid splitCompoundUnit(const std::string &compoundUnit, std::vector<std::string> &atomicUnits) {\n string s = compoundUnit;\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n boost::regex separator(\"(\\\\*|\/)\");\n boost::match_results<std::string::const_iterator> m;\n\n while (boost::regex_search(s, m, opt_prefix_and_unit_and_power) && (m.suffix().length() > 0)) {\n string suffix = m.suffix();\n atomicUnits.push_back(m[0]);\n s = suffix.substr(1);\n }\n atomicUnits.push_back(m[0]);\n}\n\n\nbool isSIUnit(const string &unit) {\n return isAtomicSIUnit(unit) || isCompoundSIUnit(unit);\n}\n\n\nbool isAtomicSIUnit(const string &unit) {\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n return boost::regex_match(unit, opt_prefix_and_unit_and_power);\n}\n\n\nbool isCompoundSIUnit(const string &unit) {\n string atomic_unit = PREFIXES + \"?\" + UNITS + POWER + \"?\";\n boost::regex compound_unit(\"(\" + atomic_unit + \"(\\\\*|\/))+\"+ atomic_unit);\n return boost::regex_match(unit, compound_unit);\n}\n\n\nstd::string dimTypeToStr(const nix::DimensionType &dtype) {\n std::stringstream s;\n s << dtype;\n return s.str();\n}\n\n\nbool isScalable(const string &unitA, const string &unitB) {\n if (!(isSIUnit(unitA) && isSIUnit(unitB))) {\n return false;\n }\n string a_unit, a_prefix, a_power;\n string b_unit, b_prefix, b_power;\n splitUnit(unitA, a_prefix, a_unit, a_power);\n splitUnit(unitB, b_prefix, b_unit, b_power);\n if (!(a_unit == b_unit) || !(a_power == b_power) ) {\n return false;\n }\n return true;\n}\n\n\nbool isScalable(const vector<string> &unitsA, const vector<string> &unitsB) {\n bool scalable = true;\n \n if (unitsA.size() != unitsB.size()) {\n return false;\n }\n \n auto itA = unitsA.begin();\n auto itB = unitsB.begin();\n while (scalable && itA != unitsA.end()) {\n scalable = isScalable(*itA, *itB);\n ++itA; \n ++itB;\n }\n \n return scalable;\n}\n\n\nbool isSetAtSamePos(const vector<string> &unitsA, const vector<string> &unitsB) {\n bool set_same = true;\n \n if (unitsA.size() != unitsB.size()) {\n return false;\n }\n \n auto itA = unitsA.begin();\n auto itB = unitsB.begin();\n while (set_same && itA != unitsA.end()) {\n set_same = (*itA).empty() == (*itB).empty();\n ++itA; \n ++itB;\n }\n \n return set_same;\n}\n\n\ndouble getSIScaling(const string &originUnit, const string &destinationUnit) {\n double scaling = 1.0;\n if (!isScalable(originUnit, destinationUnit)) {\n throw nix::InvalidUnit(\"Origin unit and destination unit are not scalable versions of the same SI unit!\",\n \"nix::util::getSIScaling\");\n }\n \n string org_unit, org_prefix, org_power;\n string dest_unit, dest_prefix, dest_power;\n splitUnit(originUnit, org_prefix, org_unit, org_power);\n splitUnit(destinationUnit, dest_prefix, dest_unit, dest_power);\n\n if ((org_prefix == dest_prefix) && (org_power == dest_power)) {\n return scaling;\n }\n if (dest_prefix.empty() && !org_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix);\n } else if (org_prefix.empty() && !dest_prefix.empty()) {\n scaling = 1.0 \/ PREFIX_FACTORS.at(dest_prefix);\n } else if (!org_prefix.empty() && !dest_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix) \/ PREFIX_FACTORS.at(dest_prefix);\n }\n if (!org_power.empty()) {\n int power = std::stoi(org_power);\n scaling = pow(scaling, power);\n }\n return scaling;\n}\n\nvoid applyPolynomial(const std::vector<double> &coefficients,\n double origin,\n const double *input,\n double *output,\n size_t n) {\n\n if (!coefficients.size()) {\n \/\/ if we have no coefficients, i.e no polynomial specified we\n \/\/ should still apply the the origin transformation\n for (size_t k = 0; k < n; k++) {\n output[k] = input[k] - origin;\n }\n\n } else {\n\n for (size_t k = 0; k < n; k++) {\n const double x = input[k] - origin;\n double value = 0.0;\n double term = 1.0;\n for (size_t i = 0; i < coefficients.size(); i++) {\n value += coefficients[i] * term;\n term *= x;\n }\n output[k] = value;\n }\n }\n}\n\nbool looksLikeUUID(const std::string &id) {\n \/\/ we don't want a complete check, just a glance\n \/\/ uuid form is: 8-4-4-4-12 = 36 [8, 13, 18, 23, ]\n return id.size() == 36 && id[8] == '-' && id[13] == '-' && id[18] == '-' && id[23] =='-';\n}\n\n} \/\/ namespace util\n} \/\/ namespace nix\n<commit_msg>[win] debankString: only pass args > 0 to isblank<commit_after>\/\/ Copyright (c) 2013, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\n#include <string>\n#include <cstdlib>\n#include <mutex>\n#include <random>\n#include <math.h>\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/regex.hpp>\n#include <nix\/util\/util.hpp>\n#include <boost\/random.hpp>\n#include <boost\/uuid\/uuid.hpp>\n#include <boost\/uuid\/uuid_generators.hpp>\n#include <boost\/uuid\/uuid_io.hpp>\n\n#include <nix\/base\/IDimensions.hpp>\n\n\nusing namespace std;\n\nnamespace nix {\nnamespace util {\n\n\/\/ Base32hex alphabet (RFC 4648)\nconst char* ID_ALPHABET = \"0123456789abcdefghijklmnopqrstuv\";\n\/\/ Unit scaling, SI only, substitutions for micro and ohm...\nconst string PREFIXES = \"(Y|Z|E|P|T|G|M|k|h|da|d|c|m|u|n|p|f|a|z|y)\";\nconst string UNITS = \"(m|g|s|A|K|mol|cd|Hz|N|Pa|J|W|C|V|F|S|Wb|T|H|lm|lx|Bq|Gy|Sv|kat|l|L|Ohm|%|dB|rad)\";\nconst string POWER = \"(\\\\^[+-]?[1-9]\\\\d*)\";\n\nconst map<string, double> PREFIX_FACTORS = {{\"y\", 1.0e-24}, {\"z\", 1.0e-21}, {\"a\", 1.0e-18}, {\"f\", 1.0e-15},\n {\"p\", 1.0e-12}, {\"n\",1.0e-9}, {\"u\", 1.0e-6}, {\"m\", 1.0e-3}, {\"c\", 1.0e-2}, {\"d\",1.0e-1}, {\"da\", 1.0e1}, {\"h\", 1.0e2},\n {\"k\", 1.0e3}, {\"M\",1.0e6}, {\"G\", 1.0e9}, {\"T\", 1.0e12}, {\"P\", 1.0e15}, {\"E\",1.0e18}, {\"Z\", 1.0e21}, {\"Y\", 1.0e24}};\n\n\nstring createId() {\n static boost::mt19937 ran(std::time(0));\n static boost::uuids::basic_random_generator<boost::mt19937> gen(&ran);\n boost::uuids::uuid u = gen();\n return boost::uuids::to_string(u);\n}\n\n\nstring timeToStr(time_t time) {\n using namespace boost::posix_time;\n ptime timetmp = from_time_t(time);\n return to_iso_string(timetmp);\n}\n\n\ntime_t strToTime(const string &time) {\n using namespace boost::posix_time;\n ptime timetmp(from_iso_string(time));\n ptime epoch(boost::gregorian::date(1970, 1, 1));\n return (timetmp - epoch).total_seconds();\n}\n\n\ntime_t getTime() {\n return time(NULL);\n}\n\n\nvoid deblankString(std::string &str) {\n typedef std::string::value_type char_type;\n\n \/\/ c > 0 check is for windows where isblank asserts c > -1 && < 256\n str.erase(std::remove_if(str.begin(),\n str.end(),\n [](char_type c) { return c > 0 && std::isblank(c); }),\n str.end());\n}\n\nstd::string deblankString(const std::string &str) {\n std::string str_copy = str;\n deblankString(str_copy);\n return str_copy;\n}\n\nbool nameCheck(const std::string &name) {\n return name.find(\"\/\") == std::string::npos;\n}\n\nstd::string nameSanitizer(const std::string &name) {\n std::string str_copy = name;\n size_t pos = str_copy.find(\"\/\");\n \n while(pos != std::string::npos) {\n str_copy = str_copy.replace(pos, 1, \"_\");\n pos = str_copy.find(\"\/\");\n }\n \n return str_copy; \n}\n\nstd::string unitSanitizer(const std::string &unit) {\n std::string new_unit = deblankString(unit);\n while (new_unit.find(\"mu\") != string::npos) {\n size_t pos = new_unit.find(\"mu\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n while (new_unit.find(\"µ\") != string::npos) {\n size_t pos = new_unit.find(\"µ\");\n new_unit = new_unit.replace(pos, 2, \"u\");\n }\n return new_unit;\n}\n\nvoid splitUnit(const string &combinedUnit, string &prefix, string &unit, string &power) {\n boost::regex prefix_and_unit_and_power(PREFIXES + UNITS + POWER);\n boost::regex prefix_and_unit(PREFIXES + UNITS);\n boost::regex unit_and_power(UNITS + POWER);\n boost::regex unit_only(UNITS);\n boost::regex prefix_only(PREFIXES);\n\n if (boost::regex_match(combinedUnit, prefix_and_unit_and_power)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n string suffix = m.suffix();\n boost::regex_search(suffix, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, unit_and_power)) {\n prefix = \"\";\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, unit_only);\n unit = m[0];\n power = m.suffix();\n power = power.substr(1);\n } else if (boost::regex_match(combinedUnit, prefix_and_unit)) {\n boost::match_results<std::string::const_iterator> m;\n boost::regex_search(combinedUnit, m, prefix_only);\n prefix = m[0];\n unit = m.suffix();\n power = \"\";\n } else {\n unit = combinedUnit;\n prefix = \"\";\n power = \"\";\n }\n}\n\n\nvoid splitCompoundUnit(const std::string &compoundUnit, std::vector<std::string> &atomicUnits) {\n string s = compoundUnit;\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n boost::regex separator(\"(\\\\*|\/)\");\n boost::match_results<std::string::const_iterator> m;\n\n while (boost::regex_search(s, m, opt_prefix_and_unit_and_power) && (m.suffix().length() > 0)) {\n string suffix = m.suffix();\n atomicUnits.push_back(m[0]);\n s = suffix.substr(1);\n }\n atomicUnits.push_back(m[0]);\n}\n\n\nbool isSIUnit(const string &unit) {\n return isAtomicSIUnit(unit) || isCompoundSIUnit(unit);\n}\n\n\nbool isAtomicSIUnit(const string &unit) {\n boost::regex opt_prefix_and_unit_and_power(PREFIXES + \"?\" + UNITS + POWER + \"?\");\n return boost::regex_match(unit, opt_prefix_and_unit_and_power);\n}\n\n\nbool isCompoundSIUnit(const string &unit) {\n string atomic_unit = PREFIXES + \"?\" + UNITS + POWER + \"?\";\n boost::regex compound_unit(\"(\" + atomic_unit + \"(\\\\*|\/))+\"+ atomic_unit);\n return boost::regex_match(unit, compound_unit);\n}\n\n\nstd::string dimTypeToStr(const nix::DimensionType &dtype) {\n std::stringstream s;\n s << dtype;\n return s.str();\n}\n\n\nbool isScalable(const string &unitA, const string &unitB) {\n if (!(isSIUnit(unitA) && isSIUnit(unitB))) {\n return false;\n }\n string a_unit, a_prefix, a_power;\n string b_unit, b_prefix, b_power;\n splitUnit(unitA, a_prefix, a_unit, a_power);\n splitUnit(unitB, b_prefix, b_unit, b_power);\n if (!(a_unit == b_unit) || !(a_power == b_power) ) {\n return false;\n }\n return true;\n}\n\n\nbool isScalable(const vector<string> &unitsA, const vector<string> &unitsB) {\n bool scalable = true;\n \n if (unitsA.size() != unitsB.size()) {\n return false;\n }\n \n auto itA = unitsA.begin();\n auto itB = unitsB.begin();\n while (scalable && itA != unitsA.end()) {\n scalable = isScalable(*itA, *itB);\n ++itA; \n ++itB;\n }\n \n return scalable;\n}\n\n\nbool isSetAtSamePos(const vector<string> &unitsA, const vector<string> &unitsB) {\n bool set_same = true;\n \n if (unitsA.size() != unitsB.size()) {\n return false;\n }\n \n auto itA = unitsA.begin();\n auto itB = unitsB.begin();\n while (set_same && itA != unitsA.end()) {\n set_same = (*itA).empty() == (*itB).empty();\n ++itA; \n ++itB;\n }\n \n return set_same;\n}\n\n\ndouble getSIScaling(const string &originUnit, const string &destinationUnit) {\n double scaling = 1.0;\n if (!isScalable(originUnit, destinationUnit)) {\n throw nix::InvalidUnit(\"Origin unit and destination unit are not scalable versions of the same SI unit!\",\n \"nix::util::getSIScaling\");\n }\n \n string org_unit, org_prefix, org_power;\n string dest_unit, dest_prefix, dest_power;\n splitUnit(originUnit, org_prefix, org_unit, org_power);\n splitUnit(destinationUnit, dest_prefix, dest_unit, dest_power);\n\n if ((org_prefix == dest_prefix) && (org_power == dest_power)) {\n return scaling;\n }\n if (dest_prefix.empty() && !org_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix);\n } else if (org_prefix.empty() && !dest_prefix.empty()) {\n scaling = 1.0 \/ PREFIX_FACTORS.at(dest_prefix);\n } else if (!org_prefix.empty() && !dest_prefix.empty()) {\n scaling = PREFIX_FACTORS.at(org_prefix) \/ PREFIX_FACTORS.at(dest_prefix);\n }\n if (!org_power.empty()) {\n int power = std::stoi(org_power);\n scaling = pow(scaling, power);\n }\n return scaling;\n}\n\nvoid applyPolynomial(const std::vector<double> &coefficients,\n double origin,\n const double *input,\n double *output,\n size_t n) {\n\n if (!coefficients.size()) {\n \/\/ if we have no coefficients, i.e no polynomial specified we\n \/\/ should still apply the the origin transformation\n for (size_t k = 0; k < n; k++) {\n output[k] = input[k] - origin;\n }\n\n } else {\n\n for (size_t k = 0; k < n; k++) {\n const double x = input[k] - origin;\n double value = 0.0;\n double term = 1.0;\n for (size_t i = 0; i < coefficients.size(); i++) {\n value += coefficients[i] * term;\n term *= x;\n }\n output[k] = value;\n }\n }\n}\n\nbool looksLikeUUID(const std::string &id) {\n \/\/ we don't want a complete check, just a glance\n \/\/ uuid form is: 8-4-4-4-12 = 36 [8, 13, 18, 23, ]\n return id.size() == 36 && id[8] == '-' && id[13] == '-' && id[18] == '-' && id[23] =='-';\n}\n\n} \/\/ namespace util\n} \/\/ namespace nix\n<|endoftext|>"} {"text":"<commit_before>#include \"scene.hh\"\n\n#include <libnova\/transform.h>\n\n#include \"drawer.hh\"\n\nnamespace scene\n{\n\nScene::Scene(const std::shared_ptr<Projection> & projection)\n : projection_(projection),\n scene_{\"\", \"root\", {}}\n{\n}\n\nvoid Scene::add_group(Group && group)\n{\n scene_.elements.push_back(std::move(group));\n}\n\nnamespace\n{\n\nln_equ_posn hrz_to_equ(ln_hrz_posn in, ln_lnlat_posn observer, double t)\n{\n ln_equ_posn out;\n ln_get_equ_from_hrz(&in, &observer, t, &out);\n return out;\n}\n\nvoid create_parallel_grid(\n scene::Group & group, const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n for (double y{grid.start.val} ; y <= grid.end.val ; y += grid.step.val)\n {\n std::vector<ln_equ_posn> path;\n for (double x{0} ; x < 360.1 ; x += grid.density.val)\n {\n switch (grid.coordinates)\n {\n case Coordinates::Equatorial:\n path.push_back({x, y});\n break;\n case Coordinates::Horizontal:\n path.push_back(hrz_to_equ({x, y}, observer, t));\n break;\n }\n }\n auto bezier(create_bezier_from_path(projection, path));\n for (auto const & b : bezier)\n group.elements.push_back(scene::Path{b});\n }\n}\n\nvoid create_meridian_grid(\n scene::Group & group, const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n for (double x{0} ; x <= 360.1 ; x += grid.step.val)\n {\n std::vector<ln_equ_posn> path;\n for (double y{grid.start.val} ; y <= grid.end.val ; y += grid.density.val)\n {\n switch (grid.coordinates)\n {\n case Coordinates::Equatorial:\n path.push_back({x, y});\n break;\n case Coordinates::Horizontal:\n ln_hrz_posn in{x, y};\n ln_equ_posn out;\n ln_get_equ_from_hrz(&in, &observer, t, &out);\n path.push_back(out);\n break;\n }\n }\n auto bezier(create_bezier_from_path(projection, path));\n for (auto const & b : bezier)\n group.elements.push_back(scene::Path{b});\n }\n}\n\n}\n\nscene::Group build_grid(\n const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n scene::Group group{\"grid\", grid.name, {}};\n switch (grid.plane)\n {\n case Plane::Parallel:\n {\n create_parallel_grid(group, grid, projection, observer, t);\n break;\n }\n case Plane::Meridian:\n {\n create_meridian_grid(group, grid, projection, observer, t);\n break;\n }\n }\n return group;\n}\n\nscene::Group build_track(\n const Track & track,\n const std::shared_ptr<Projection> & projection,\n const SolarObjectManager & solar_manager)\n{\n scene::Group group{\"track\", track.name, {}};\n auto path(create_path_from_track(projection, track, solar_manager.get(track.name)));\n auto beziers(create_bezier_from_path(path));\n for (auto const & b : beziers)\n {\n group.elements.push_back(scene::Path{b});\n }\n\n if (path.size() >= 2)\n {\n auto blind_beziered(interpolate_bezier(path));\n for (int i(0), i_end(blind_beziered.size());\n i < i_end; i += track.interval_ticks)\n {\n auto p(blind_beziered[i]);\n group.elements.push_back(scene::DirectedObject{p.p, p.perpendicular});\n }\n }\n return group;\n}\n\nscene::Group build_tick(\n const Tick & tick,\n const std::shared_ptr<Projection> & projection)\n{\n scene::Group group{\"tick\", tick.name, {}};\n switch (tick.plane)\n {\n case Plane::Parallel:\n for (double x{tick.start.val} ; x <= tick.end.val ; x += tick.step.val)\n {\n std::string str;\n if (tick.display == Tick::as_hours)\n str = stringify(angle{x}, as_hour);\n else\n str = stringify(angle{x}, as_degree);\n\n group.elements.push_back(scene::Text{str, projection->project({x, tick.base.val})});\n }\n break;\n case Plane::Meridian:\n for (double y{tick.start.val} ; y <= tick.end.val ; y += tick.step.val)\n {\n std::string str;\n if (tick.display == Tick::as_hours)\n str = stringify(angle{y}, as_hour);\n else\n str = stringify(angle{y}, as_degree);\n\n group.elements.push_back(scene::Text{str, projection->project({tick.base.val, y})});\n }\n break;\n }\n return group;\n}\n\n}\n<commit_msg>extract some common code<commit_after>#include \"scene.hh\"\n\n#include <libnova\/transform.h>\n\n#include \"drawer.hh\"\n\nnamespace scene\n{\n\nScene::Scene(const std::shared_ptr<Projection> & projection)\n : projection_(projection),\n scene_{\"\", \"root\", {}}\n{\n}\n\nvoid Scene::add_group(Group && group)\n{\n scene_.elements.push_back(std::move(group));\n}\n\nnamespace\n{\n\nln_equ_posn convert_to_equ(Coordinates coord, std::pair<double, double> in, ln_lnlat_posn observer, double t)\n{\n switch(coord)\n {\n case Coordinates::Equatorial:\n return ln_equ_posn{in.first, in.second};\n case Coordinates::Horizontal:\n ln_hrz_posn hin{in.first, in.second};\n ln_equ_posn out;\n ln_get_equ_from_hrz(&hin, &observer, t, &out);\n return out;\n }\n}\n\nvoid create_parallel_grid(\n scene::Group & group, const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n for (double y{grid.start.val} ; y <= grid.end.val ; y += grid.step.val)\n {\n std::vector<ln_equ_posn> path;\n for (double x{0} ; x < 360.1 ; x += grid.density.val)\n {\n path.push_back(convert_to_equ(grid.coordinates, {x, y}, observer, t));\n }\n auto bezier(create_bezier_from_path(projection, path));\n for (auto const & b : bezier)\n group.elements.push_back(scene::Path{b});\n }\n}\n\nvoid create_meridian_grid(\n scene::Group & group, const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n for (double x{0} ; x <= 360.1 ; x += grid.step.val)\n {\n std::vector<ln_equ_posn> path;\n for (double y{grid.start.val} ; y <= grid.end.val ; y += grid.density.val)\n {\n path.push_back(convert_to_equ(grid.coordinates, {x, y}, observer, t));\n }\n auto bezier(create_bezier_from_path(projection, path));\n for (auto const & b : bezier)\n group.elements.push_back(scene::Path{b});\n }\n}\n\n}\n\nscene::Group build_grid(\n const Grid grid,\n const std::shared_ptr<Projection> & projection,\n ln_lnlat_posn observer, double t)\n{\n scene::Group group{\"grid\", grid.name, {}};\n switch (grid.plane)\n {\n case Plane::Parallel:\n {\n create_parallel_grid(group, grid, projection, observer, t);\n break;\n }\n case Plane::Meridian:\n {\n create_meridian_grid(group, grid, projection, observer, t);\n break;\n }\n }\n return group;\n}\n\nscene::Group build_track(\n const Track & track,\n const std::shared_ptr<Projection> & projection,\n const SolarObjectManager & solar_manager)\n{\n scene::Group group{\"track\", track.name, {}};\n auto path(create_path_from_track(projection, track, solar_manager.get(track.name)));\n auto beziers(create_bezier_from_path(path));\n for (auto const & b : beziers)\n {\n group.elements.push_back(scene::Path{b});\n }\n\n if (path.size() >= 2)\n {\n auto blind_beziered(interpolate_bezier(path));\n for (int i(0), i_end(blind_beziered.size());\n i < i_end; i += track.interval_ticks)\n {\n auto p(blind_beziered[i]);\n group.elements.push_back(scene::DirectedObject{p.p, p.perpendicular});\n }\n }\n return group;\n}\n\nscene::Group build_tick(\n const Tick & tick,\n const std::shared_ptr<Projection> & projection)\n{\n scene::Group group{\"tick\", tick.name, {}};\n switch (tick.plane)\n {\n case Plane::Parallel:\n for (double x{tick.start.val} ; x <= tick.end.val ; x += tick.step.val)\n {\n std::string str;\n if (tick.display == Tick::as_hours)\n str = stringify(angle{x}, as_hour);\n else\n str = stringify(angle{x}, as_degree);\n\n group.elements.push_back(scene::Text{str, projection->project({x, tick.base.val})});\n }\n break;\n case Plane::Meridian:\n for (double y{tick.start.val} ; y <= tick.end.val ; y += tick.step.val)\n {\n std::string str;\n if (tick.display == Tick::as_hours)\n str = stringify(angle{y}, as_hour);\n else\n str = stringify(angle{y}, as_degree);\n\n group.elements.push_back(scene::Text{str, projection->project({tick.base.val, y})});\n }\n break;\n }\n return group;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __se3_urdf_hpp__\n#define __se3_urdf_hpp__\n\n#include <urdf_model\/model.h>\n#include <urdf_parser\/urdf_parser.h>\n\n#include <iostream>\n#include <boost\/foreach.hpp>\n#include \"pinocchio\/multibody\/model.hpp\"\n\nnamespace urdf\n{\n typedef boost::shared_ptr<ModelInterface> ModelInterfacePtr;\n typedef boost::shared_ptr<const Joint> JointConstPtr;\n typedef boost::shared_ptr<const Link> LinkConstPtr;\n typedef boost::shared_ptr<Link> LinkPtr;\n\n typedef boost::shared_ptr<const Inertial> InertialConstPtr;\n}\n\nnamespace se3\n{\n namespace urdf\n {\n \n Inertia convertFromUrdf( const ::urdf::Inertial& Y )\n {\n const ::urdf::Vector3 & p = Y.origin.position;\n const ::urdf::Rotation & q = Y.origin.rotation;\n\n const Eigen::Vector3d com(p.x,p.y,p.z);\n const Eigen::Matrix3d & R = Eigen::Quaterniond(q.w,q.x,q.y,q.z).matrix();\n\n Eigen::Matrix3d I; I << Y.ixx,Y.ixy,Y.ixz\n\t\t\t , Y.ixy,Y.iyy,Y.iyz\n\t\t\t , Y.ixz,Y.iyz,Y.izz;\n\n return Inertia(Y.mass,com,R*I*R.transpose());\n }\n\n SE3 convertFromUrdf( const ::urdf::Pose & M )\n {\n const ::urdf::Vector3 & p = M.position;\n const ::urdf::Rotation & q = M.rotation;\n return SE3( Eigen::Quaterniond(q.w,q.x,q.y,q.z).matrix(), Eigen::Vector3d(p.x,p.y,p.z));\n }\n\n enum AxisCartesian { AXIS_X, AXIS_Y, AXIS_Z, AXIS_UNALIGNED };\n AxisCartesian extractCartesianAxis( const ::urdf::Vector3 & axis )\n {\n if( (axis.x==1.0)&&(axis.y==0.0)&&(axis.z==0.0) )\n\treturn AXIS_X;\n else if( (axis.x==0.0)&&(axis.y==1.0)&&(axis.z==0.0) )\n\treturn AXIS_Y;\n else if( (axis.x==0.0)&&(axis.y==0.0)&&(axis.z==1.0) )\n\treturn AXIS_Z;\n else\n\treturn AXIS_UNALIGNED;\n }\n\n void parseTree( ::urdf::LinkConstPtr link, Model & model, bool freeFlyer )\n {\n ::urdf::JointConstPtr joint = link->parent_joint;\n\n \/\/ std::cout << \" *** \" << link->name << \" < attached by joint \";\n \/\/ if(joint)\n \/\/ std::cout << \"#\" << link->parent_joint->name << std::endl;\n \/\/ else std::cout << \"###ROOT\" << std::endl;\n \n \/\/assert(link->inertial && \"The parser cannot accept trivial mass\");\n const Inertia & Y = (link->inertial) ?\n\tconvertFromUrdf(*link->inertial)\n\t: Inertia::Identity();\n \/\/std::cout << \"Inertia: \" << Y << std::endl;\n\n bool visual = (link->visual) ? true : false;\n\n if(joint!=NULL)\n\t{\n\t assert(link->getParent()!=NULL);\n\n\t Model::Index parent \n\t = (link->getParent()->parent_joint==NULL) ?\n\t (freeFlyer ? 1 : 0)\n\t : model.getBodyId( link->getParent()->parent_joint->name );\n\t \/\/std::cout << joint->name << \" === \" << parent << std::endl;\n\n\t const SE3 & jointPlacement = convertFromUrdf(joint->parent_to_joint_origin_transform);\n\n\t \/\/std::cout << \"Parent = \" << parent << std::endl;\n\t \/\/std::cout << \"Placement = \" << (Matrix4)jointPlacement << std::endl;\n\n\t switch(joint->type)\n\t {\n\t case ::urdf::Joint::REVOLUTE:\n\t case ::urdf::Joint::CONTINUOUS: \/\/ Revolute with no joint limits\n\t {\n\t Eigen::Vector3d jointAxis(Eigen::Vector3d::Zero());\n\t\tAxisCartesian axis = extractCartesianAxis(joint->axis);\n\t\tswitch(axis)\n\t\t {\n\t\t case AXIS_X:\n\t\t model.addBody( parent, JointModelRX(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Y:\n\t\t model.addBody( parent, JointModelRY(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Z:\n\t\t model.addBody( parent, JointModelRZ(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_UNALIGNED:\n\t\t \tjointAxis= Eigen::Vector3d( joint->axis.x,joint->axis.y,joint->axis.z );\n\t\t jointAxis.normalize();\n\t\t model.addBody( parent, JointModelRevoluteUnaligned(jointAxis), \n\t\t\t\t jointPlacement, Y, joint->name,link->name, visual );\n\t\t \tbreak;\n\t\t default:\n\t\t assert( false && \"Fatal Error while extracting revolute joint axis\");\n\t\t break;\n\t\t }\n\t\tbreak;\n\t }\n\t case ::urdf::Joint::PRISMATIC:\n\t {\n\t AxisCartesian axis = extractCartesianAxis(joint->axis); \t\n\t\tswitch(axis)\n\t\t {\n\t\t case AXIS_X:\n\t\t model.addBody( parent, JointModelPX(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Y:\n\t\t model.addBody( parent, JointModelPY(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Z:\n\t\t model.addBody( parent, JointModelPZ(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_UNALIGNED:\n\t\t \tstd::cerr << \"Bad axis = (\" <<joint->axis.x<<\",\"<<joint->axis.y\n\t\t\t <<\",\"<<joint->axis.z<<\")\" << std::endl;\n\t\t assert(false && \"Only X, Y or Z axis are accepted.\" );\n\t\t \tbreak;\n\t\t default:\n\t\t assert( false && \"Fatal Error while extracting revolute joint axis\");\n\t\t break;\n\t\t }\n\t\tbreak;\n\t }\n\t case ::urdf::Joint::FIXED:\n\t {\n\t model.mergeFixedBody(parent, jointPlacement, Y);\n\t assert( (link->child_links.empty()) && \"Fixed body has joint child. Shouldn't happen\");\n\t \/\/ For the moment, fixed bodies are handled only if end of chain (and only once)\n\t\tbreak;\n\t }\n\t \n\t default:\n\t {\n\t\tstd::cerr << \"The joint type \" << joint->type << \" is not supported.\" << std::endl;\n\t\tassert(false && \"Only revolute joint are accepted.\" );\n\t\tbreak;\n\t }\n\t }\n\t }\n else if(freeFlyer)\n\t{ \/* The link is the root of the body. *\/\n\t model.addBody( 0, JointModelFreeFlyer(), SE3::Identity(), Y, \"root\", link->name, true );\n\t}\n\n BOOST_FOREACH(::urdf::LinkConstPtr child,link->child_links)\n\t{\n\t parseTree( child,model,freeFlyer );\n\t}\n } \n\n Model buildModel( const std::string & filename, bool freeFlyer = false )\n {\n Model model;\n\n ::urdf::ModelInterfacePtr urdfTree = ::urdf::parseURDFFile (filename);\n parseTree(urdfTree->getRoot(),model,freeFlyer);\n return model;\n }\n\n } \/\/ namespace urdf\n} \/\/ namespace se3\n\n#endif \/\/ ifndef __se3_urdf_hpp__\n\n<commit_msg>[Major] Handling case of urdf::Fixed joints during parsing of urdf file.<commit_after>#ifndef __se3_urdf_hpp__\n#define __se3_urdf_hpp__\n\n#include <urdf_model\/model.h>\n#include <urdf_parser\/urdf_parser.h>\n\n#include <iostream>\n#include <boost\/foreach.hpp>\n#include \"pinocchio\/multibody\/model.hpp\"\n\nnamespace urdf\n{\n typedef boost::shared_ptr<ModelInterface> ModelInterfacePtr;\n typedef boost::shared_ptr<const Joint> JointConstPtr;\n typedef boost::shared_ptr<const Link> LinkConstPtr;\n typedef boost::shared_ptr<Link> LinkPtr;\n typedef boost::shared_ptr<const Inertial> InertialConstPtr;\n}\n\nnamespace se3\n{\n namespace urdf\n {\n Inertia convertFromUrdf( const ::urdf::Inertial& Y )\n {\n const ::urdf::Vector3 & p = Y.origin.position;\n const ::urdf::Rotation & q = Y.origin.rotation;\n\n const Eigen::Vector3d com(p.x,p.y,p.z);\n const Eigen::Matrix3d & R = Eigen::Quaterniond(q.w,q.x,q.y,q.z).matrix();\n\n Eigen::Matrix3d I; I << Y.ixx,Y.ixy,Y.ixz\n\t\t\t , Y.ixy,Y.iyy,Y.iyz\n\t\t\t , Y.ixz,Y.iyz,Y.izz;\n return Inertia(Y.mass,com,R*I*R.transpose());\n }\n\n SE3 convertFromUrdf( const ::urdf::Pose & M )\n {\n const ::urdf::Vector3 & p = M.position;\n const ::urdf::Rotation & q = M.rotation;\n return SE3( Eigen::Quaterniond(q.w,q.x,q.y,q.z).matrix(), Eigen::Vector3d(p.x,p.y,p.z));\n }\n\n enum AxisCartesian { AXIS_X, AXIS_Y, AXIS_Z, AXIS_UNALIGNED };\n AxisCartesian extractCartesianAxis( const ::urdf::Vector3 & axis )\n {\n if( (axis.x==1.0)&&(axis.y==0.0)&&(axis.z==0.0) )\n\treturn AXIS_X;\n else if( (axis.x==0.0)&&(axis.y==1.0)&&(axis.z==0.0) )\n\treturn AXIS_Y;\n else if( (axis.x==0.0)&&(axis.y==0.0)&&(axis.z==1.0) )\n\treturn AXIS_Z;\n else\n\treturn AXIS_UNALIGNED;\n }\n\n void parseTree( ::urdf::LinkConstPtr link, Model & model, bool freeFlyer, SE3 placementOffset = SE3::Identity() )\n {\n\n ::urdf::JointConstPtr joint = link->parent_joint;\n SE3 nextPlacementOffset=SE3::Identity(); \/\/ in most cases, no offset for the next link\n\n \/\/ std::cout << \" *** \" << link->name << \" < attached by joint \";\n \/\/ if(joint)\n \/\/ std::cout << \"#\" << link->parent_joint->name << std::endl;\n \/\/ else std::cout << \"###ROOT\" << std::endl;\n\n \/\/std::cout << \" *** \" << link->name << \" < attached by joint \";\n \n \/\/assert(link->inertial && \"The parser cannot accept trivial mass\");\n const Inertia & Y = (link->inertial) ?\n\tconvertFromUrdf(*link->inertial)\n\t: Inertia::Identity();\n\n \/\/ std::cout << \"placementOffset: \" << placementOffset << std::endl;\n\n bool visual = (link->visual) ? true : false;\n\n if(joint!=NULL)\n\t{\n\t assert(link->getParent()!=NULL);\n\n\t Model::Index parent \n\t = (link->getParent()->parent_joint==NULL) ?\n\t (freeFlyer ? 1 : 0)\n\t : model.getBodyId( link->getParent()->parent_joint->name );\n\t \/\/std::cout << joint->name << \" === \" << parent << std::endl;\n\n const SE3 & jointPlacement = placementOffset*convertFromUrdf(joint->parent_to_joint_origin_transform);\n\n\t \/\/std::cout << \"Parent = \" << parent << std::endl;\n\t \/\/std::cout << \"Placement = \" << (Matrix4)jointPlacement << std::endl;\n\n\t switch(joint->type)\n\t {\n\t case ::urdf::Joint::REVOLUTE:\n\t case ::urdf::Joint::CONTINUOUS: \/\/ Revolute with no joint limits\n\t {\n\t Eigen::Vector3d jointAxis(Eigen::Vector3d::Zero());\n\t\tAxisCartesian axis = extractCartesianAxis(joint->axis);\n\t\tswitch(axis)\n\t\t {\n\t\t case AXIS_X:\n\t\t model.addBody( parent, JointModelRX(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Y:\n\t\t model.addBody( parent, JointModelRY(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Z:\n\t\t model.addBody( parent, JointModelRZ(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_UNALIGNED:\n\t\t \tjointAxis= Eigen::Vector3d( joint->axis.x,joint->axis.y,joint->axis.z );\n\t\t jointAxis.normalize();\n\t\t model.addBody( parent, JointModelRevoluteUnaligned(jointAxis), \n\t\t\t\t jointPlacement, Y, joint->name,link->name, visual );\n\t\t \tbreak;\n\t\t default:\n\t\t assert( false && \"Fatal Error while extracting revolute joint axis\");\n\t\t break;\n\t\t }\n\t\tbreak;\n\t }\n\t case ::urdf::Joint::PRISMATIC:\n\t {\n\t AxisCartesian axis = extractCartesianAxis(joint->axis); \t\n\t\tswitch(axis)\n\t\t {\n\t\t case AXIS_X:\n\t\t model.addBody( parent, JointModelPX(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Y:\n\t\t model.addBody( parent, JointModelPY(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_Z:\n\t\t model.addBody( parent, JointModelPZ(), jointPlacement, Y, joint->name,link->name, visual );\n\t\t break;\n\t\t case AXIS_UNALIGNED:\n\t\t \tstd::cerr << \"Bad axis = (\" <<joint->axis.x<<\",\"<<joint->axis.y\n\t\t\t <<\",\"<<joint->axis.z<<\")\" << std::endl;\n\t\t assert(false && \"Only X, Y or Z axis are accepted.\" );\n\t\t \tbreak;\n\t\t default:\n\t\t assert( false && \"Fatal Error while extracting revolute joint axis\");\n\t\t break;\n\t\t }\n\t\tbreak;\n\t }\n\t case ::urdf::Joint::FIXED:\n\t {\n \/* In case of fixed join: \t-add the inertia of the link to his parent in the model\n\t\t\t * \t\t\t\t\t\t\t-let all the children become children of parent \n * \t\t\t\t\t\t\t-inform the parser of the offset to apply\n\t\t\t * *\/\n model.mergeFixedBody(parent, jointPlacement, Y); \/\/Modify the parent inertia in the model\n SE3 ptjot_se3 = convertFromUrdf(link->parent_joint->parent_to_joint_origin_transform);\n \/\/transformation of the current placement offset (important if several fixed join following)\n nextPlacementOffset=placementOffset*ptjot_se3;\n\t\t\tBOOST_FOREACH(::urdf::LinkPtr child_link,link->child_links) \n\t\t\t{\n child_link->setParent(link->getParent() ); \t\/\/skip the fixed generation\n\t\t\t}\n\t\t\tbreak;\n\t }\n\t \n\t default:\n\t {\n\t\tstd::cerr << \"The joint type \" << joint->type << \" is not supported.\" << std::endl;\n\t\tassert(false && \"Only revolute joint are accepted.\" );\n\t\tbreak;\n\t }\n\t }\n\t }\n else if(freeFlyer)\n\t{ \/* The link is the root of the body. *\/\n\t model.addBody( 0, JointModelFreeFlyer(), SE3::Identity(), Y, \"root\", link->name, true );\n\t}\n\n\n BOOST_FOREACH(::urdf::LinkConstPtr child,link->child_links)\n\t{\n parseTree( child,model,freeFlyer,nextPlacementOffset );\n\t}\n } \n\n Model buildModel( const std::string & filename, bool freeFlyer = false )\n {\n Model model;\n\n ::urdf::ModelInterfacePtr urdfTree = ::urdf::parseURDFFile (filename);\n parseTree(urdfTree->getRoot(),model,freeFlyer);\n return model;\n }\n\n } \/\/ namespace urdf\n} \/\/ namespace se3\n\n#endif \/\/ ifndef __se3_urdf_hpp__\n\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2017-2019 Hugo Beauzée-Luyssen, Videolabs, VideoLAN\n *\n * Authors: Hugo Beauzée-Luyssen <hugo@beauzee.fr>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#if HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"Url.h\"\n#include \"Filename.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n\n#include <algorithm>\n#include <cstring>\n#include <iterator>\n#include <stdexcept>\n\nnamespace\n{\ninline bool isSafe( char c )\n{\n return strchr( \".-_~\/\"\n#ifdef _WIN32\n \"\\\\\"\n#endif\n , c ) != nullptr;\n}\n\nstd::string::const_iterator encodeSegment( std::string& res,\n std::string::const_iterator begin,\n std::string::const_iterator end,\n const char* extraChars )\n{\n for ( auto i = begin; i < end; ++i )\n {\n \/\/ This must be an unsigned char for the bits operations below to work.\n \/\/ auto will yield a signed char here.\n const unsigned char c = *i;\n if ( ( c >= 32 && c <= 126 ) && (\n ( c >= 'a' && c <= 'z' ) ||\n ( c >= 'A' && c <= 'Z' ) ||\n ( c >= '0' && c <= '9' ) ||\n isSafe( c ) == true ||\n ( extraChars != nullptr && strchr( extraChars, c ) != nullptr ) )\n )\n {\n res.push_back( c );\n }\n else\n res.append({ '%', \"0123456789ABCDEF\"[c >> 4], \"0123456789ABCDEF\"[c & 0xF] });\n }\n return end;\n}\n\ninline uint16_t charToVal( char c )\n{\n if ( c >= '0' && c <= '9' )\n return c - '0';\n if ( c >= 'a' && c <= 'f' )\n return c - 'a' + 10;\n if ( c >= 'A' && c <= 'F' )\n return c - 'A' + 10;\n throw std::runtime_error( \"Incomplete\/invalid character sequence\" );\n}\n\n}\n\nnamespace medialibrary\n{\nnamespace utils\n{\nnamespace url\n{\n\nparts split( const std::string& url )\n{\n parts res{};\n auto schemePos = url.find( \":\/\/\" );\n if ( schemePos == std::string::npos )\n {\n res.path = url;\n return res;\n }\n std::copy( url.cbegin(), url.cbegin() + schemePos,\n std::back_inserter( res.scheme ) );\n\n\n if ( res.scheme == \"file\" )\n {\n std::copy( url.cbegin() + schemePos + 3, url.cend(),\n std::back_inserter( res.path ) );\n return res;\n }\n\n const auto authorityBegin = url.cbegin() + schemePos + 3;\n auto authorityEnd = std::find( authorityBegin, url.cend(), '\/' );\n auto queryBegin = std::find( authorityBegin, url.cend(), '?' );\n const auto fragmentBegin = std::find( authorityBegin, url.cend(), '#' );\n\n \/*\n * The fragment must come after the query parameters. Since we use both\n * values at a later point, sanitize them now.\n *\/\n if ( fragmentBegin != url.cend() && queryBegin != url.cend() &&\n fragmentBegin < queryBegin )\n {\n queryBegin = url.cend();\n }\n\n \/* RFC 3986 §3.2:\n * The authority component is preceded by a double slash (\"\/\/\") and is\n * terminated by the next slash (\"\/\"), question mark (\"?\"), or number\n * sign (\"#\") character, or by the end of the URI.\n *\/\n if ( authorityEnd == url.cend() )\n {\n if ( queryBegin != url.cend() )\n authorityEnd = queryBegin;\n else\n authorityEnd = fragmentBegin;\n }\n else\n {\n if ( queryBegin != url.cend() && queryBegin < authorityEnd )\n authorityEnd = queryBegin;\n if ( fragmentBegin != url.cend() && fragmentBegin < authorityEnd )\n authorityEnd = fragmentBegin;\n }\n\n {\n \/* Split the authority into its actual components *\/\n auto userInfoEnd = std::find( authorityBegin, authorityEnd, '@' );\n if ( userInfoEnd != authorityEnd )\n {\n std::copy( authorityBegin, userInfoEnd,\n std::back_inserter( res.userInfo ) );\n \/* Skip the '@' when copying the host *\/\n ++userInfoEnd;\n res.hostMarker = true;\n }\n else\n userInfoEnd = authorityBegin;\n\n auto portBegin = std::find( userInfoEnd, authorityEnd, ':' );\n if ( portBegin != authorityEnd )\n std::copy( portBegin + 1, authorityEnd, std::back_inserter( res.port ) );\n else\n portBegin = authorityEnd;\n std::copy( userInfoEnd, portBegin, std::back_inserter( res.host ) );\n\n }\n if ( authorityEnd == url.cend() )\n {\n \/*\n * If we don't have a clear end for the authority segment, it means the\n * end is the url end, so we don't have anything else to split\n *\/\n return res;\n }\n\n auto pathEnd = queryBegin != url.cend() ? queryBegin : fragmentBegin;\n std::copy( authorityEnd, pathEnd,\n std::back_inserter( res.path ) );\n if ( queryBegin != url.cend() )\n {\n std::copy( queryBegin + 1,\n fragmentBegin != url.cend() ? fragmentBegin : url.cend(),\n std::back_inserter( res.query ) );\n }\n if ( fragmentBegin != url.cend() )\n {\n std::copy( fragmentBegin + 1, url.cend(),\n std::back_inserter( res.fragments ) );\n }\n return res;\n}\n\nstd::string decode( const std::string& str )\n{\n std::string res;\n res.reserve( str.size() );\n auto it = str.cbegin();\n auto ite = str.cend();\n for ( ; it != ite; ++it )\n {\n if ( *it == '%' )\n {\n ++it;\n const auto c1 = charToVal( *it );\n const auto c2 = charToVal( *( it + 1 ) );\n auto val = c1 * 16 + c2;\n res.push_back( static_cast<std::string::value_type>( val ) );\n ++it;\n }\n else\n res.push_back( *it );\n }\n return res;\n}\n\nstd::string encode( const std::string& str )\n{\n auto parts = split( str );\n std::string res{};\n res.reserve( str.length() );\n \/*\n * If the file is a local path, we need to encode everything as the\n * characters won't have any URL related meaning\n *\/\n if ( parts.scheme == \"file\" || parts.scheme.empty() == true )\n {\n if ( parts.scheme.empty() == false )\n res += \"file:\/\/\";\n auto pathBegin = parts.path.cbegin();\n#ifdef _WIN32\n if ( *pathBegin == '\/' && isalpha( *(pathBegin + 1) ) && *(pathBegin + 2) == ':' )\n {\n \/\/ Don't encode the ':' after the drive letter.\n \/\/ All other ':' need to be encoded, there are not allowed in a file path\n \/\/ on windows, but they might appear in urls\n std::copy( pathBegin, pathBegin + 3, std::back_inserter( res ) );\n pathBegin += 3;\n }\n#endif\n encodeSegment( res, pathBegin, parts.path.cend(), nullptr );\n return res;\n }\n \/*\n * We already accept any character in \".-_~\/\" through isSafe(), but we need\n * to accept more depending on the URL segments:\n *\/\n encodeSegment( res, parts.scheme.cbegin(), parts.scheme.cend(), \"+\" );\n res += \":\/\/\";\n if ( parts.userInfo.empty() == false )\n {\n encodeSegment( res, parts.userInfo.cbegin(), parts.userInfo.cend(),\n \"!$&'()*+,;=:\" );\n }\n if ( parts.hostMarker == true )\n res += '@';\n encodeSegment( res, parts.host.cbegin(), parts.host.cend(), \"[]\" );\n if ( parts.port.empty() == false )\n {\n res += ':';\n res += parts.port;\n }\n\n encodeSegment( res, parts.path.cbegin(), parts.path.cend(), \"!$&'()*+,;=:@\" );\n\n if ( parts.query.empty() == false )\n {\n res += '?';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n if ( parts.fragments.empty() == false )\n {\n res += '#';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n return res;\n}\n\nstd::string stripScheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( pos + 3 );\n}\n\nstd::string scheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( 0, pos + 3 );\n}\n\n#ifndef _WIN32\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( scheme( mrl ) );\n return utils::url::decode( mrl.substr( 7 ) );\n}\n\n#else\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( utils::url::scheme( mrl ) );\n auto localPath = mrl.substr( 7 );\n \/\/ If the path is a local path (ie. X:\\path\\to and not \\\\path\\to) skip the\n \/\/ initial backslash, as it is only part of our representation, and not\n \/\/ understood by the win32 API functions\n \/\/ Note that the initial '\/' (after the 2 forward slashes from the scheme)\n \/\/ is not a backslash, as it is not a path separator, so do not use\n \/\/ DIR_SEPARATOR_CHAR here.\n if ( localPath[0] == '\/' && isalpha( localPath[1] ) )\n localPath.erase( 0, 1 );\n std::replace( begin( localPath ), end( localPath ), '\/', '\\\\' );\n return utils::url::decode( localPath );\n}\n\n#endif\n\nbool schemeIs( const std::string& scheme, const std::string& mrl )\n{\n return mrl.compare( 0, scheme.size(), scheme ) == 0;\n}\n\nstd::string path( const std::string &mrl )\n{\n auto schemelessMrl = stripScheme( mrl );\n auto host = utils::file::firstFolder( schemelessMrl );\n return utils::file::removePath( schemelessMrl, host );\n}\n\n}\n}\n}\n<commit_msg>utils: Url: Fix GCC13 build by including cstdint<commit_after>\/*****************************************************************************\n * Media Library\n *****************************************************************************\n * Copyright (C) 2017-2019 Hugo Beauzée-Luyssen, Videolabs, VideoLAN\n *\n * Authors: Hugo Beauzée-Luyssen <hugo@beauzee.fr>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n#if HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include \"Url.h\"\n#include \"Filename.h\"\n#include \"medialibrary\/filesystem\/Errors.h\"\n\n#include <algorithm>\n#include <cstdint>\n#include <cstring>\n#include <iterator>\n#include <stdexcept>\n\nnamespace\n{\ninline bool isSafe( char c )\n{\n return strchr( \".-_~\/\"\n#ifdef _WIN32\n \"\\\\\"\n#endif\n , c ) != nullptr;\n}\n\nstd::string::const_iterator encodeSegment( std::string& res,\n std::string::const_iterator begin,\n std::string::const_iterator end,\n const char* extraChars )\n{\n for ( auto i = begin; i < end; ++i )\n {\n \/\/ This must be an unsigned char for the bits operations below to work.\n \/\/ auto will yield a signed char here.\n const unsigned char c = *i;\n if ( ( c >= 32 && c <= 126 ) && (\n ( c >= 'a' && c <= 'z' ) ||\n ( c >= 'A' && c <= 'Z' ) ||\n ( c >= '0' && c <= '9' ) ||\n isSafe( c ) == true ||\n ( extraChars != nullptr && strchr( extraChars, c ) != nullptr ) )\n )\n {\n res.push_back( c );\n }\n else\n res.append({ '%', \"0123456789ABCDEF\"[c >> 4], \"0123456789ABCDEF\"[c & 0xF] });\n }\n return end;\n}\n\ninline uint16_t charToVal( char c )\n{\n if ( c >= '0' && c <= '9' )\n return c - '0';\n if ( c >= 'a' && c <= 'f' )\n return c - 'a' + 10;\n if ( c >= 'A' && c <= 'F' )\n return c - 'A' + 10;\n throw std::runtime_error( \"Incomplete\/invalid character sequence\" );\n}\n\n}\n\nnamespace medialibrary\n{\nnamespace utils\n{\nnamespace url\n{\n\nparts split( const std::string& url )\n{\n parts res{};\n auto schemePos = url.find( \":\/\/\" );\n if ( schemePos == std::string::npos )\n {\n res.path = url;\n return res;\n }\n std::copy( url.cbegin(), url.cbegin() + schemePos,\n std::back_inserter( res.scheme ) );\n\n\n if ( res.scheme == \"file\" )\n {\n std::copy( url.cbegin() + schemePos + 3, url.cend(),\n std::back_inserter( res.path ) );\n return res;\n }\n\n const auto authorityBegin = url.cbegin() + schemePos + 3;\n auto authorityEnd = std::find( authorityBegin, url.cend(), '\/' );\n auto queryBegin = std::find( authorityBegin, url.cend(), '?' );\n const auto fragmentBegin = std::find( authorityBegin, url.cend(), '#' );\n\n \/*\n * The fragment must come after the query parameters. Since we use both\n * values at a later point, sanitize them now.\n *\/\n if ( fragmentBegin != url.cend() && queryBegin != url.cend() &&\n fragmentBegin < queryBegin )\n {\n queryBegin = url.cend();\n }\n\n \/* RFC 3986 §3.2:\n * The authority component is preceded by a double slash (\"\/\/\") and is\n * terminated by the next slash (\"\/\"), question mark (\"?\"), or number\n * sign (\"#\") character, or by the end of the URI.\n *\/\n if ( authorityEnd == url.cend() )\n {\n if ( queryBegin != url.cend() )\n authorityEnd = queryBegin;\n else\n authorityEnd = fragmentBegin;\n }\n else\n {\n if ( queryBegin != url.cend() && queryBegin < authorityEnd )\n authorityEnd = queryBegin;\n if ( fragmentBegin != url.cend() && fragmentBegin < authorityEnd )\n authorityEnd = fragmentBegin;\n }\n\n {\n \/* Split the authority into its actual components *\/\n auto userInfoEnd = std::find( authorityBegin, authorityEnd, '@' );\n if ( userInfoEnd != authorityEnd )\n {\n std::copy( authorityBegin, userInfoEnd,\n std::back_inserter( res.userInfo ) );\n \/* Skip the '@' when copying the host *\/\n ++userInfoEnd;\n res.hostMarker = true;\n }\n else\n userInfoEnd = authorityBegin;\n\n auto portBegin = std::find( userInfoEnd, authorityEnd, ':' );\n if ( portBegin != authorityEnd )\n std::copy( portBegin + 1, authorityEnd, std::back_inserter( res.port ) );\n else\n portBegin = authorityEnd;\n std::copy( userInfoEnd, portBegin, std::back_inserter( res.host ) );\n\n }\n if ( authorityEnd == url.cend() )\n {\n \/*\n * If we don't have a clear end for the authority segment, it means the\n * end is the url end, so we don't have anything else to split\n *\/\n return res;\n }\n\n auto pathEnd = queryBegin != url.cend() ? queryBegin : fragmentBegin;\n std::copy( authorityEnd, pathEnd,\n std::back_inserter( res.path ) );\n if ( queryBegin != url.cend() )\n {\n std::copy( queryBegin + 1,\n fragmentBegin != url.cend() ? fragmentBegin : url.cend(),\n std::back_inserter( res.query ) );\n }\n if ( fragmentBegin != url.cend() )\n {\n std::copy( fragmentBegin + 1, url.cend(),\n std::back_inserter( res.fragments ) );\n }\n return res;\n}\n\nstd::string decode( const std::string& str )\n{\n std::string res;\n res.reserve( str.size() );\n auto it = str.cbegin();\n auto ite = str.cend();\n for ( ; it != ite; ++it )\n {\n if ( *it == '%' )\n {\n ++it;\n const auto c1 = charToVal( *it );\n const auto c2 = charToVal( *( it + 1 ) );\n auto val = c1 * 16 + c2;\n res.push_back( static_cast<std::string::value_type>( val ) );\n ++it;\n }\n else\n res.push_back( *it );\n }\n return res;\n}\n\nstd::string encode( const std::string& str )\n{\n auto parts = split( str );\n std::string res{};\n res.reserve( str.length() );\n \/*\n * If the file is a local path, we need to encode everything as the\n * characters won't have any URL related meaning\n *\/\n if ( parts.scheme == \"file\" || parts.scheme.empty() == true )\n {\n if ( parts.scheme.empty() == false )\n res += \"file:\/\/\";\n auto pathBegin = parts.path.cbegin();\n#ifdef _WIN32\n if ( *pathBegin == '\/' && isalpha( *(pathBegin + 1) ) && *(pathBegin + 2) == ':' )\n {\n \/\/ Don't encode the ':' after the drive letter.\n \/\/ All other ':' need to be encoded, there are not allowed in a file path\n \/\/ on windows, but they might appear in urls\n std::copy( pathBegin, pathBegin + 3, std::back_inserter( res ) );\n pathBegin += 3;\n }\n#endif\n encodeSegment( res, pathBegin, parts.path.cend(), nullptr );\n return res;\n }\n \/*\n * We already accept any character in \".-_~\/\" through isSafe(), but we need\n * to accept more depending on the URL segments:\n *\/\n encodeSegment( res, parts.scheme.cbegin(), parts.scheme.cend(), \"+\" );\n res += \":\/\/\";\n if ( parts.userInfo.empty() == false )\n {\n encodeSegment( res, parts.userInfo.cbegin(), parts.userInfo.cend(),\n \"!$&'()*+,;=:\" );\n }\n if ( parts.hostMarker == true )\n res += '@';\n encodeSegment( res, parts.host.cbegin(), parts.host.cend(), \"[]\" );\n if ( parts.port.empty() == false )\n {\n res += ':';\n res += parts.port;\n }\n\n encodeSegment( res, parts.path.cbegin(), parts.path.cend(), \"!$&'()*+,;=:@\" );\n\n if ( parts.query.empty() == false )\n {\n res += '?';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n if ( parts.fragments.empty() == false )\n {\n res += '#';\n encodeSegment( res, parts.query.cbegin(), parts.query.cend(),\n \"!$&'()*+,;=:@?\" );\n }\n return res;\n}\n\nstd::string stripScheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( pos + 3 );\n}\n\nstd::string scheme( const std::string& mrl )\n{\n auto pos = mrl.find( \":\/\/\" );\n if ( pos == std::string::npos )\n throw fs::errors::UnhandledScheme( \"<empty scheme>\" );\n return mrl.substr( 0, pos + 3 );\n}\n\n#ifndef _WIN32\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( scheme( mrl ) );\n return utils::url::decode( mrl.substr( 7 ) );\n}\n\n#else\n\nstd::string toLocalPath( const std::string& mrl )\n{\n if ( mrl.compare( 0, 7, \"file:\/\/\" ) != 0 )\n throw fs::errors::UnhandledScheme( utils::url::scheme( mrl ) );\n auto localPath = mrl.substr( 7 );\n \/\/ If the path is a local path (ie. X:\\path\\to and not \\\\path\\to) skip the\n \/\/ initial backslash, as it is only part of our representation, and not\n \/\/ understood by the win32 API functions\n \/\/ Note that the initial '\/' (after the 2 forward slashes from the scheme)\n \/\/ is not a backslash, as it is not a path separator, so do not use\n \/\/ DIR_SEPARATOR_CHAR here.\n if ( localPath[0] == '\/' && isalpha( localPath[1] ) )\n localPath.erase( 0, 1 );\n std::replace( begin( localPath ), end( localPath ), '\/', '\\\\' );\n return utils::url::decode( localPath );\n}\n\n#endif\n\nbool schemeIs( const std::string& scheme, const std::string& mrl )\n{\n return mrl.compare( 0, scheme.size(), scheme ) == 0;\n}\n\nstd::string path( const std::string &mrl )\n{\n auto schemelessMrl = stripScheme( mrl );\n auto host = utils::file::firstFolder( schemelessMrl );\n return utils::file::removePath( schemelessMrl, host );\n}\n\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"zip_int_store.hpp\"\n#include <nark\/fsa\/nest_trie_dawg.hpp>\n#include <nark\/io\/FileStream.hpp>\n#include <nark\/io\/DataIO.hpp>\n#include <nark\/util\/mmap.hpp>\n\nnamespace nark { namespace db {\n\nZipIntStore::ZipIntStore() {\n\tm_mmapBase = nullptr;\n\tm_mmapSize = 0;\n}\nZipIntStore::~ZipIntStore() {\n\tif (m_mmapBase) {\n\t\tm_dedup.risk_release_ownership();\n\t\tm_index.risk_release_ownership();\n\t\tmmap_close(m_mmapBase, m_mmapSize);\n\t}\n}\n\nllong ZipIntStore::dataStorageSize() const {\n\treturn m_dedup.mem_size() + m_index.mem_size();\n}\n\nllong ZipIntStore::numDataRows() const {\n\treturn m_index.size() ? m_index.size() : m_dedup.size();\n}\n\ntemplate<class Int>\nvoid ZipIntStore::valueAppend(size_t recIdx, valvec<byte>* key) const {\n\tif (m_index.size()) {\n\t\tsize_t idx = m_index.get(recIdx);\n\t\tassert(idx < m_dedup.size());\n\t\tInt iValue = Int(m_minValue + m_dedup.get(idx));\n\t\tunaligned_save<Int>(key->grow_no_init(sizeof(Int)), iValue);\n\t}\n\telse {\n\t\tInt iValue = Int(m_minValue + m_dedup.get(recIdx));\n\t\tunaligned_save<Int>(key->grow_no_init(sizeof(Int)), iValue);\n\t}\n}\n\nvoid ZipIntStore::getValueAppend(llong id, valvec<byte>* val, DbContext*) const {\n\tassert(id >= 0);\n\tsize_t idx = size_t(id);\n\tassert(idx < m_dedup.size());\n\tswitch (m_intType) {\n\tdefault:\n\t\tTHROW_STD(invalid_argument, \"Bad m_intType=%s\", Schema::columnTypeStr(m_intType));\n\tcase ColumnType::Sint08: valueAppend< int8_t >(idx, val); break;\n\tcase ColumnType::Uint08: valueAppend<uint8_t >(idx, val); break;\n\tcase ColumnType::Sint16: valueAppend< int16_t>(idx, val); break;\n\tcase ColumnType::Uint16: valueAppend<uint16_t>(idx, val); break;\n\tcase ColumnType::Sint32: valueAppend< int32_t>(idx, val); break;\n\tcase ColumnType::Uint32: valueAppend<uint32_t>(idx, val); break;\n\tcase ColumnType::Sint64: valueAppend< int64_t>(idx, val); break;\n\tcase ColumnType::Uint64: valueAppend<uint64_t>(idx, val); break;\n\tcase ColumnType::VarSint: {\n\t\tbyte buf[16];\n\t\tbyte* end = save_var_int64(buf, int64_t(m_minValue + m_dedup.get(idx)));\n\t\tval->append(buf, end - buf);\n\t\tbreak; }\n\tcase ColumnType::VarUint: {\n\t\tbyte buf[16];\n\t\tbyte* end = save_var_uint64(buf, uint64_t(m_minValue + m_dedup.get(idx)));\n\t\tval->append(buf, end - buf);\n\t\tbreak; }\n\t}\n}\n\nStoreIterator* ZipIntStore::createStoreIterForward(DbContext*) const {\n\treturn nullptr; \/\/ not needed\n}\n\nStoreIterator* ZipIntStore::createStoreIterBackward(DbContext*) const {\n\treturn nullptr; \/\/ not needed\n}\n\ntemplate<class Int>\nvoid ZipIntStore::zipValues(const void* data, size_t size) {\n\tsize_t rows = size \/ sizeof(Int);\n\tassert(size % sizeof(Int) == 0);\n\tconst Int* values = (Int*)data;\n\n\tUintVecMin0 dup;\n\tm_minValue = dup.build_from(values, rows);\n\n\tvalvec<Int> dedup(values, rows);\n\tstd::sort(dedup.begin(), dedup.end());\n\tdedup.trim(std::unique(dedup.begin(), dedup.end()));\n\n\tsize_t indexBits = nark_bsr_u32(dedup.size()-1) + 1;\n\tsize_t indexSize = (indexBits * rows + 7) \/ 8;\n\tsize_t dedupSize = (dup.uintbits() * rows + 7) \/ 8;\n\tif (dedupSize + indexSize < dup.mem_size()) {\n\t\tvalvec<uint32_t> index(rows, valvec_no_init());\n\t\tfor(size_t i = 0; i < rows; ++i) {\n\t\t\tsize_t j = lower_bound_a(dedup, values[i]);\n\t\t\tassert(values[i] == dedup[j]);\n\t\t\tindex[i] = j;\n\t\t}\n\t\tm_index.build_from(index);\n\t\tm_dedup.build_from(dedup);\n\t}\n}\n\nvoid ZipIntStore::build(ColumnType keyType, SortableStrVec& strVec) {\n\tassert(strVec.m_index.size() == 0);\n\tm_intType = keyType;\n\tvoid* data = strVec.m_strpool.data();\n\tsize_t size = strVec.m_strpool.size();\n\tswitch (keyType) {\n\tdefault:\n\t\tTHROW_STD(invalid_argument, \"Bad keyType=%s\", Schema::columnTypeStr(keyType));\n\tcase ColumnType::Sint08: zipValues< int8_t >(data, size); break;\n\tcase ColumnType::Uint08: zipValues<uint8_t >(data, size); break;\n\tcase ColumnType::Sint16: zipValues< int16_t>(data, size); break;\n\tcase ColumnType::Uint16: zipValues<uint16_t>(data, size); break;\n\tcase ColumnType::Sint32: zipValues< int32_t>(data, size); break;\n\tcase ColumnType::Uint32: zipValues<uint32_t>(data, size); break;\n\tcase ColumnType::Sint64: zipValues< int64_t>(data, size); break;\n\tcase ColumnType::Uint64: zipValues<uint64_t>(data, size); break;\n\tcase ColumnType::VarSint: {\n\t\tvalvec<llong> tmp;\n\t\tconst byte* pos = strVec.m_strpool.data();\n\t\tconst byte* end = strVec.m_strpool.end();\n\t\twhile (pos < end) {\n\t\t\tconst byte* next = nullptr;\n\t\t\tllong key = load_var_int64(pos, &next);\n\t\t\ttmp.push_back(key);\n\t\t\tpos = next;\n\t\t}\n\t\tzipValues<int64_t>(tmp.data(), tmp.used_mem_size());\n\t\tbreak; }\n\tcase ColumnType::VarUint: {\n\t\tvalvec<ullong> tmp;\n\t\tconst byte* pos = strVec.m_strpool.data();\n\t\tconst byte* end = strVec.m_strpool.end();\n\t\twhile (pos < end) {\n\t\t\tconst byte* next = nullptr;\n\t\t\tullong key = load_var_uint64(pos, &next);\n\t\t\ttmp.push_back(key);\n\t\t\tpos = next;\n\t\t}\n\t\tzipValues<uint64_t>(tmp.data(), tmp.used_mem_size());\n\t\tbreak; }\n\t}\n}\n\nnamespace {\n\tstruct ZipIntStoreHeader {\n\t\tuint32_t rows;\n\t\tuint32_t uniqNum;\n\t\tuint8_t intBits;\n\t\tuint8_t intType;\n\t\tuint16_t padding1;\n\t\tuint32_t padding2;\n\t\tuint32_t padding3;\n\t\t int64_t minValue;\n\t};\n\tBOOST_STATIC_ASSERT(sizeof(ZipIntStoreHeader) == 32);\n}\n\nvoid ZipIntStore::load(fstring path) {\n\tstd::string fpath = path + \".zint\";\n\tm_mmapBase = (byte_t*)mmap_load(fpath.c_str(), &m_mmapSize);\n\tauto header = (const ZipIntStoreHeader*)m_mmapBase;\n\tsize_t rows = header->rows;\n\tm_intType = ColumnType(header->intType);\n\tm_minValue = header->minValue;\n\tm_dedup.risk_set_data((byte*)(header+1), header->uniqNum, header->intBits);\n\tif (header->uniqNum != rows) {\n\t\tassert(header->uniqNum < rows);\n\t\tsize_t indexBits = nark_bsr_u32(rows - 1) + 1;\n\t\tauto indexData = (byte*)(header+1) + m_dedup.mem_size();\n\t\tm_index.risk_set_data(indexData, rows, indexBits);\n\t}\n}\n\nvoid ZipIntStore::save(fstring path) const {\n\tstd::string fpath = path + \".zint\";\n\tNativeDataOutput<FileStream> dio;\n\tdio.open(fpath.c_str(), \"wb\");\n\tZipIntStoreHeader header;\n\theader.rows = uint32_t(numDataRows());\n\theader.uniqNum = m_dedup.size();\n\theader.intBits = byte(m_dedup.uintbits());\n\theader.intType = byte(m_intType);\n\theader.padding1 = 0;\n\theader.padding2 = 0;\n\theader.padding3 = 0;\n\theader.minValue = int64_t(m_minValue);\n\tdio.ensureWrite(&header, sizeof(header));\n\tdio.ensureWrite(m_dedup.data(), m_dedup.mem_size());\n\tdio.ensureWrite(m_index.data(), m_index.mem_size());\n}\n\n}} \/\/ namespace nark::db\n<commit_msg>ZipIntStore: fix bugs<commit_after>#include \"zip_int_store.hpp\"\n#include <nark\/fsa\/nest_trie_dawg.hpp>\n#include <nark\/io\/FileStream.hpp>\n#include <nark\/io\/DataIO.hpp>\n#include <nark\/util\/mmap.hpp>\n\nnamespace nark { namespace db {\n\nZipIntStore::ZipIntStore() {\n\tm_mmapBase = nullptr;\n\tm_mmapSize = 0;\n}\nZipIntStore::~ZipIntStore() {\n\tif (m_mmapBase) {\n\t\tm_dedup.risk_release_ownership();\n\t\tm_index.risk_release_ownership();\n\t\tmmap_close(m_mmapBase, m_mmapSize);\n\t}\n}\n\nllong ZipIntStore::dataStorageSize() const {\n\treturn m_dedup.mem_size() + m_index.mem_size();\n}\n\nllong ZipIntStore::numDataRows() const {\n\treturn m_index.size() ? m_index.size() : m_dedup.size();\n}\n\ntemplate<class Int>\nvoid ZipIntStore::valueAppend(size_t recIdx, valvec<byte>* key) const {\n\tif (m_index.size()) {\n\t\tsize_t idx = m_index.get(recIdx);\n\t\tassert(idx < m_dedup.size());\n\t\tInt iValue = Int(m_minValue + m_dedup.get(idx));\n\t\tunaligned_save<Int>(key->grow_no_init(sizeof(Int)), iValue);\n\t}\n\telse {\n\t\tInt iValue = Int(m_minValue + m_dedup.get(recIdx));\n\t\tunaligned_save<Int>(key->grow_no_init(sizeof(Int)), iValue);\n\t}\n}\n\nvoid ZipIntStore::getValueAppend(llong id, valvec<byte>* val, DbContext*) const {\n\tassert(id >= 0);\n\tsize_t idx = size_t(id);\n\tassert(idx < m_dedup.size());\n\tswitch (m_intType) {\n\tdefault:\n\t\tTHROW_STD(invalid_argument, \"Bad m_intType=%s\", Schema::columnTypeStr(m_intType));\n\tcase ColumnType::Sint08: valueAppend< int8_t >(idx, val); break;\n\tcase ColumnType::Uint08: valueAppend<uint8_t >(idx, val); break;\n\tcase ColumnType::Sint16: valueAppend< int16_t>(idx, val); break;\n\tcase ColumnType::Uint16: valueAppend<uint16_t>(idx, val); break;\n\tcase ColumnType::Sint32: valueAppend< int32_t>(idx, val); break;\n\tcase ColumnType::Uint32: valueAppend<uint32_t>(idx, val); break;\n\tcase ColumnType::Sint64: valueAppend< int64_t>(idx, val); break;\n\tcase ColumnType::Uint64: valueAppend<uint64_t>(idx, val); break;\n\tcase ColumnType::VarSint: {\n\t\tbyte buf[16];\n\t\tbyte* end = save_var_int64(buf, int64_t(m_minValue + m_dedup.get(idx)));\n\t\tval->append(buf, end - buf);\n\t\tbreak; }\n\tcase ColumnType::VarUint: {\n\t\tbyte buf[16];\n\t\tbyte* end = save_var_uint64(buf, uint64_t(m_minValue + m_dedup.get(idx)));\n\t\tval->append(buf, end - buf);\n\t\tbreak; }\n\t}\n}\n\nStoreIterator* ZipIntStore::createStoreIterForward(DbContext*) const {\n\treturn nullptr; \/\/ not needed\n}\n\nStoreIterator* ZipIntStore::createStoreIterBackward(DbContext*) const {\n\treturn nullptr; \/\/ not needed\n}\n\ntemplate<class Int>\nvoid ZipIntStore::zipValues(const void* data, size_t size) {\n\tsize_t rows = size \/ sizeof(Int);\n\tassert(size % sizeof(Int) == 0);\n\tconst Int* values = (Int*)data;\n\n\tUintVecMin0 dup;\n\tm_minValue = dup.build_from(values, rows);\n\n\tvalvec<Int> dedup(values, rows);\n\tstd::sort(dedup.begin(), dedup.end());\n\tdedup.trim(std::unique(dedup.begin(), dedup.end()));\n\n\tsize_t indexBits = nark_bsr_u32(dedup.size()-1) + 1;\n\tsize_t indexSize = (indexBits * rows + 7) \/ 8;\n\tsize_t dedupSize = (dup.uintbits() * dedup.size() + 7) \/ 8;\n\tif (dedupSize + indexSize < dup.mem_size()) {\n\t\tvalvec<uint32_t> index(rows, valvec_no_init());\n\t\tfor(size_t i = 0; i < rows; ++i) {\n\t\t\tsize_t j = lower_bound_a(dedup, values[i]);\n\t\t\tassert(values[i] == dedup[j]);\n\t\t\tindex[i] = j;\n\t\t}\n\t\tm_index.build_from(index);\n\t\tm_dedup.build_from(dedup);\n\t}\n\telse {\n\t\tm_dedup.swap(dup);\n\t}\n}\n\nvoid ZipIntStore::build(ColumnType keyType, SortableStrVec& strVec) {\n\tassert(strVec.m_index.size() == 0);\n\tm_intType = keyType;\n\tvoid* data = strVec.m_strpool.data();\n\tsize_t size = strVec.m_strpool.size();\n\tswitch (keyType) {\n\tdefault:\n\t\tTHROW_STD(invalid_argument, \"Bad keyType=%s\", Schema::columnTypeStr(keyType));\n\tcase ColumnType::Sint08: zipValues< int8_t >(data, size); break;\n\tcase ColumnType::Uint08: zipValues<uint8_t >(data, size); break;\n\tcase ColumnType::Sint16: zipValues< int16_t>(data, size); break;\n\tcase ColumnType::Uint16: zipValues<uint16_t>(data, size); break;\n\tcase ColumnType::Sint32: zipValues< int32_t>(data, size); break;\n\tcase ColumnType::Uint32: zipValues<uint32_t>(data, size); break;\n\tcase ColumnType::Sint64: zipValues< int64_t>(data, size); break;\n\tcase ColumnType::Uint64: zipValues<uint64_t>(data, size); break;\n\tcase ColumnType::VarSint: {\n\t\tvalvec<llong> tmp;\n\t\tconst byte* pos = strVec.m_strpool.data();\n\t\tconst byte* end = strVec.m_strpool.end();\n\t\twhile (pos < end) {\n\t\t\tconst byte* next = nullptr;\n\t\t\tllong key = load_var_int64(pos, &next);\n\t\t\ttmp.push_back(key);\n\t\t\tpos = next;\n\t\t}\n\t\tzipValues<int64_t>(tmp.data(), tmp.used_mem_size());\n\t\tbreak; }\n\tcase ColumnType::VarUint: {\n\t\tvalvec<ullong> tmp;\n\t\tconst byte* pos = strVec.m_strpool.data();\n\t\tconst byte* end = strVec.m_strpool.end();\n\t\twhile (pos < end) {\n\t\t\tconst byte* next = nullptr;\n\t\t\tullong key = load_var_uint64(pos, &next);\n\t\t\ttmp.push_back(key);\n\t\t\tpos = next;\n\t\t}\n\t\tzipValues<uint64_t>(tmp.data(), tmp.used_mem_size());\n\t\tbreak; }\n\t}\n}\n\nnamespace {\n\tstruct ZipIntStoreHeader {\n\t\tuint32_t rows;\n\t\tuint32_t uniqNum;\n\t\tuint8_t intBits;\n\t\tuint8_t intType;\n\t\tuint16_t padding1;\n\t\tuint32_t padding2;\n\t\tuint32_t padding3;\n\t\t int64_t minValue;\n\t};\n\tBOOST_STATIC_ASSERT(sizeof(ZipIntStoreHeader) == 32);\n}\n\nvoid ZipIntStore::load(fstring path) {\n\tstd::string fpath = path + \".zint\";\n\tm_mmapBase = (byte_t*)mmap_load(fpath.c_str(), &m_mmapSize);\n\tauto header = (const ZipIntStoreHeader*)m_mmapBase;\n\tsize_t rows = header->rows;\n\tm_intType = ColumnType(header->intType);\n\tm_minValue = header->minValue;\n\tm_dedup.risk_set_data((byte*)(header+1), header->uniqNum, header->intBits);\n\tif (header->uniqNum != rows) {\n\t\tassert(header->uniqNum < rows);\n\t\tsize_t indexBits = nark_bsr_u32(rows - 1) + 1;\n\t\tauto indexData = (byte*)(header+1) + m_dedup.mem_size();\n\t\tm_index.risk_set_data(indexData, rows, indexBits);\n\t}\n}\n\nvoid ZipIntStore::save(fstring path) const {\n\tstd::string fpath = path + \".zint\";\n\tNativeDataOutput<FileStream> dio;\n\tdio.open(fpath.c_str(), \"wb\");\n\tZipIntStoreHeader header;\n\theader.rows = uint32_t(numDataRows());\n\theader.uniqNum = m_dedup.size();\n\theader.intBits = byte(m_dedup.uintbits());\n\theader.intType = byte(m_intType);\n\theader.padding1 = 0;\n\theader.padding2 = 0;\n\theader.padding3 = 0;\n\theader.minValue = int64_t(m_minValue);\n\tdio.ensureWrite(&header, sizeof(header));\n\tdio.ensureWrite(m_dedup.data(), m_dedup.mem_size());\n\tdio.ensureWrite(m_index.data(), m_index.mem_size());\n}\n\n}} \/\/ namespace nark::db\n<|endoftext|>"} {"text":"<commit_before>#ifdef STXXL_BOOST_CONFIG\n\n#include \"stxxl\/bits\/io\/boostfd_file.h\"\n#include \"stxxl\/bits\/common\/debug.h\"\n\n #include \"boost\/filesystem\/operations.hpp\"\n #include \"boost\/filesystem\/fstream.hpp\"\n\n__STXXL_BEGIN_NAMESPACE\n\n\nboost::iostreams::file_descriptor\nboostfd_file::get_file_des() const\n{\n return file_des;\n}\n\nboostfd_request::boostfd_request (\n boostfd_file * f,\n void * buf,\n stxxl::int64 off,\n size_t b,\n request_type t,\n completion_handler on_cmpl) :\n request (on_cmpl, f, buf, off, b, t),\n _state (OP)\n{ }\n\nbool boostfd_request::add_waiter (onoff_switch * sw)\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n #else\n waiters_mutex.lock ();\n #endif\n\n if (poll ()) \/\/ request already finished\n {\n #ifndef STXXL_BOOST_THREADS\n waiters_mutex.unlock ();\n #endif\n return true;\n }\n\n waiters.insert (sw);\n #ifndef STXXL_BOOST_THREADS\n waiters_mutex.unlock ();\n #endif\n\n return false;\n}\nvoid boostfd_request::delete_waiter (onoff_switch * sw)\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n waiters.erase (sw);\n #else\n waiters_mutex.lock ();\n waiters.erase (sw);\n waiters_mutex.unlock ();\n #endif\n}\nint boostfd_request::nwaiters () \/\/ returns number of waiters\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n return waiters.size();\n #else\n waiters_mutex.lock ();\n int size = waiters.size ();\n waiters_mutex.unlock ();\n return size;\n #endif\n}\nvoid boostfd_request::check_aligning ()\n{\n if (offset % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Offset is not aligned: modulo \"\n << BLOCK_ALIGN << \" = \" <<\n offset % BLOCK_ALIGN);\n\n if (bytes % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Size is not a multiple of \" <<\n BLOCK_ALIGN << \", = \" << bytes % BLOCK_ALIGN);\n\n if (long (buffer) % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Buffer is not aligned: modulo \"\n << BLOCK_ALIGN << \" = \" <<\n long (buffer) % BLOCK_ALIGN << \" (\" <<\n std::hex << buffer << std::dec << \")\");\n}\n\nboostfd_request::~boostfd_request ()\n{\n STXXL_VERBOSE3(\"boostfd_request \" << unsigned (this) << \": deletion, cnt: \" << ref_cnt);\n\n assert(_state() == DONE || _state() == READY2DIE);\n}\n\nvoid boostfd_request::wait ()\n{\n STXXL_VERBOSE3(\"boostfd_request : \" << unsigned (this) << \" wait \");\n\n START_COUNT_WAIT_TIME\n\n #ifdef NO_OVERLAPPING\n enqueue();\n #endif\n\n _state.wait_for (READY2DIE);\n\n END_COUNT_WAIT_TIME\n\n check_errors();\n}\nbool boostfd_request::poll()\n{\n #ifdef NO_OVERLAPPING\n \/*if(_state () < DONE)*\/ wait();\n #endif\n\n const bool s = _state() >= DONE;\n\n check_errors();\n\n return s;\n}\nconst char * boostfd_request::io_type ()\n{\n return \"boostfd\";\n}\n\nboostfd_file::boostfd_file (\n const std::string & filename,\n int mode,\n int disk) : file (disk), mode_(mode)\n{\n BOOST_IOS::openmode boostfd_mode;\n\n\n #ifndef STXXL_DIRECT_IO_OFF\n if (mode & DIRECT)\n {\n \/\/ direct mode not supported in Boost\n }\n #endif\n\n if (mode & RDONLY)\n {\n boostfd_mode = BOOST_IOS::in;\n }\n\n if (mode & WRONLY)\n {\n boostfd_mode = BOOST_IOS::out;\n }\n\n if (mode & RDWR)\n {\n boostfd_mode = BOOST_IOS::out | BOOST_IOS::in;\n }\n\n\n const boost::filesystem::path fspath(filename,\n boost::filesystem::native);\n\n if (mode & TRUNC)\n {\n if (boost::filesystem::exists(fspath))\n {\n boost::filesystem::remove(fspath);\n boost::filesystem::ofstream f(fspath);\n f.close();\n assert(boost::filesystem::exists(fspath));\n }\n }\n\n if (mode & CREAT)\n {\n \/\/ need to be emulated:\n if (!boost::filesystem::exists(fspath))\n {\n boost::filesystem::ofstream f(fspath);\n f.close();\n assert(boost::filesystem::exists(fspath));\n }\n }\n\n\n file_des.open(filename, boostfd_mode, boostfd_mode);\n}\n\nboostfd_file::~boostfd_file ()\n{\n file_des.close();\n}\nstxxl::int64 boostfd_file::size ()\n{\n stxxl::int64 size_ = file_des.seek(0, BOOST_IOS::end);\n return size_;\n}\nvoid boostfd_file::set_size (stxxl::int64 newsize)\n{\n stxxl::int64 oldsize = size();\n file_des.seek(newsize, BOOST_IOS::beg);\n file_des.seek(0, BOOST_IOS::beg); \/\/ not important ?\n assert(size() >= oldsize);\n}\n\nvoid boostfd_request::serve ()\n{\n stats * iostats = stats::get_instance();\n if (nref() < 2)\n {\n STXXL_ERRMSG(\"WARNING: serious error, reference to the request is lost before serve (nref=\"\n << nref() << \") \" <<\n \" this=\" << long (this) << \" offset=\" << offset << \" buffer=\" << buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") );\n }\n STXXL_VERBOSE2(\"boostfd_request::serve(): Buffer at \" << ((void *)buffer)\n << \" offset: \" << offset << \" bytes: \" << bytes << ((type == READ) ? \" READ\" : \" WRITE\")\n );\n\n boostfd_file::fd_type fd = static_cast<boostfd_file *>(file_)->get_file_des();\n\n try\n {\n fd.seek(offset, BOOST_IOS::beg);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"seek() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") << \" : \" << ex.what() )\n\n error_occured(msg.str());\n }\n\n {\n if (type == READ)\n {\n #if STXXL_IO_STATS\n iostats->read_started (size());\n #endif\n\n debugmon::get_instance()->io_started((char *)buffer);\n\n try\n {\n fd.read((char *)buffer, bytes);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"read() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") <<\n \" nref= \" << nref() << \" : \" << ex.what() )\n\n error_occured(msg.str());\n }\n\n debugmon::get_instance()->io_finished((char *)buffer);\n\n #if STXXL_IO_STATS\n iostats->read_finished ();\n #endif\n }\n else\n {\n #if STXXL_IO_STATS\n iostats->write_started (size());\n #endif\n\n debugmon::get_instance()->io_started((char *)buffer);\n\n try\n {\n fd.write((char *)buffer, bytes);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"write() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") <<\n \" nref= \" << nref() << \" : \" << ex.what() )\n\n error_occured(msg.str());\n }\n\n debugmon::get_instance()->io_finished((char *)buffer);\n\n #if STXXL_IO_STATS\n iostats->write_finished ();\n #endif\n }\n }\n\n if (nref() < 2)\n {\n STXXL_ERRMSG(\"WARNING: reference to the request is lost after serve (nref=\" << nref() << \") \" <<\n \" this=\" << long (this) <<\n \" offset=\" << offset << \" buffer=\" << buffer << \" bytes=\" << bytes <<\n \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\"));\n }\n\n _state.set_to (DONE);\n\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n #else\n waiters_mutex.lock ();\n #endif\n \/\/ << notification >>\n std::for_each(\n waiters.begin(),\n waiters.end(),\n std::mem_fun(&onoff_switch::on) );\n\n #ifdef STXXL_BOOST_THREADS\n Lock.unlock();\n #else\n waiters_mutex.unlock ();\n #endif\n\n completed ();\n _state.set_to (READY2DIE);\n}\n\nrequest_ptr boostfd_file::aread (\n void * buffer,\n stxxl::int64 pos,\n size_t bytes,\n completion_handler on_cmpl)\n{\n request_ptr req = new boostfd_request(this,\n buffer, pos, bytes,\n request::READ, on_cmpl);\n\n if (!req.get())\n stxxl_function_error(io_error);\n\n\n #ifndef NO_OVERLAPPING\n disk_queues::get_instance ()->add_readreq(req, get_id());\n #endif\n return req;\n}\nrequest_ptr boostfd_file::awrite (\n void * buffer,\n stxxl::int64 pos,\n size_t bytes,\n completion_handler on_cmpl)\n{\n request_ptr req = new boostfd_request(this, buffer, pos, bytes,\n request::WRITE, on_cmpl);\n\n if (!req.get())\n stxxl_function_error(io_error);\n\n\n #ifndef NO_OVERLAPPING\n disk_queues::get_instance ()->add_writereq(req, get_id());\n #endif\n return req;\n}\n\n\n\n__STXXL_END_NAMESPACE\n\n#endif \/\/ BOOST_VERSION\n\n<commit_msg>added semicolons<commit_after>#ifdef STXXL_BOOST_CONFIG\n\n#include \"stxxl\/bits\/io\/boostfd_file.h\"\n#include \"stxxl\/bits\/common\/debug.h\"\n\n #include \"boost\/filesystem\/operations.hpp\"\n #include \"boost\/filesystem\/fstream.hpp\"\n\n__STXXL_BEGIN_NAMESPACE\n\n\nboost::iostreams::file_descriptor\nboostfd_file::get_file_des() const\n{\n return file_des;\n}\n\nboostfd_request::boostfd_request (\n boostfd_file * f,\n void * buf,\n stxxl::int64 off,\n size_t b,\n request_type t,\n completion_handler on_cmpl) :\n request (on_cmpl, f, buf, off, b, t),\n _state (OP)\n{ }\n\nbool boostfd_request::add_waiter (onoff_switch * sw)\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n #else\n waiters_mutex.lock ();\n #endif\n\n if (poll ()) \/\/ request already finished\n {\n #ifndef STXXL_BOOST_THREADS\n waiters_mutex.unlock ();\n #endif\n return true;\n }\n\n waiters.insert (sw);\n #ifndef STXXL_BOOST_THREADS\n waiters_mutex.unlock ();\n #endif\n\n return false;\n}\nvoid boostfd_request::delete_waiter (onoff_switch * sw)\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n waiters.erase (sw);\n #else\n waiters_mutex.lock ();\n waiters.erase (sw);\n waiters_mutex.unlock ();\n #endif\n}\nint boostfd_request::nwaiters () \/\/ returns number of waiters\n{\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n return waiters.size();\n #else\n waiters_mutex.lock ();\n int size = waiters.size ();\n waiters_mutex.unlock ();\n return size;\n #endif\n}\nvoid boostfd_request::check_aligning ()\n{\n if (offset % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Offset is not aligned: modulo \"\n << BLOCK_ALIGN << \" = \" <<\n offset % BLOCK_ALIGN);\n\n if (bytes % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Size is not a multiple of \" <<\n BLOCK_ALIGN << \", = \" << bytes % BLOCK_ALIGN);\n\n if (long (buffer) % BLOCK_ALIGN != 0)\n STXXL_ERRMSG (\"Buffer is not aligned: modulo \"\n << BLOCK_ALIGN << \" = \" <<\n long (buffer) % BLOCK_ALIGN << \" (\" <<\n std::hex << buffer << std::dec << \")\");\n}\n\nboostfd_request::~boostfd_request ()\n{\n STXXL_VERBOSE3(\"boostfd_request \" << unsigned (this) << \": deletion, cnt: \" << ref_cnt);\n\n assert(_state() == DONE || _state() == READY2DIE);\n}\n\nvoid boostfd_request::wait ()\n{\n STXXL_VERBOSE3(\"boostfd_request : \" << unsigned (this) << \" wait \");\n\n START_COUNT_WAIT_TIME\n\n #ifdef NO_OVERLAPPING\n enqueue();\n #endif\n\n _state.wait_for (READY2DIE);\n\n END_COUNT_WAIT_TIME\n\n check_errors();\n}\nbool boostfd_request::poll()\n{\n #ifdef NO_OVERLAPPING\n \/*if(_state () < DONE)*\/ wait();\n #endif\n\n const bool s = _state() >= DONE;\n\n check_errors();\n\n return s;\n}\nconst char * boostfd_request::io_type ()\n{\n return \"boostfd\";\n}\n\nboostfd_file::boostfd_file (\n const std::string & filename,\n int mode,\n int disk) : file (disk), mode_(mode)\n{\n BOOST_IOS::openmode boostfd_mode;\n\n\n #ifndef STXXL_DIRECT_IO_OFF\n if (mode & DIRECT)\n {\n \/\/ direct mode not supported in Boost\n }\n #endif\n\n if (mode & RDONLY)\n {\n boostfd_mode = BOOST_IOS::in;\n }\n\n if (mode & WRONLY)\n {\n boostfd_mode = BOOST_IOS::out;\n }\n\n if (mode & RDWR)\n {\n boostfd_mode = BOOST_IOS::out | BOOST_IOS::in;\n }\n\n\n const boost::filesystem::path fspath(filename,\n boost::filesystem::native);\n\n if (mode & TRUNC)\n {\n if (boost::filesystem::exists(fspath))\n {\n boost::filesystem::remove(fspath);\n boost::filesystem::ofstream f(fspath);\n f.close();\n assert(boost::filesystem::exists(fspath));\n }\n }\n\n if (mode & CREAT)\n {\n \/\/ need to be emulated:\n if (!boost::filesystem::exists(fspath))\n {\n boost::filesystem::ofstream f(fspath);\n f.close();\n assert(boost::filesystem::exists(fspath));\n }\n }\n\n\n file_des.open(filename, boostfd_mode, boostfd_mode);\n}\n\nboostfd_file::~boostfd_file ()\n{\n file_des.close();\n}\nstxxl::int64 boostfd_file::size ()\n{\n stxxl::int64 size_ = file_des.seek(0, BOOST_IOS::end);\n return size_;\n}\nvoid boostfd_file::set_size (stxxl::int64 newsize)\n{\n stxxl::int64 oldsize = size();\n file_des.seek(newsize, BOOST_IOS::beg);\n file_des.seek(0, BOOST_IOS::beg); \/\/ not important ?\n assert(size() >= oldsize);\n}\n\nvoid boostfd_request::serve ()\n{\n stats * iostats = stats::get_instance();\n if (nref() < 2)\n {\n STXXL_ERRMSG(\"WARNING: serious error, reference to the request is lost before serve (nref=\"\n << nref() << \") \" <<\n \" this=\" << long (this) << \" offset=\" << offset << \" buffer=\" << buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") );\n }\n STXXL_VERBOSE2(\"boostfd_request::serve(): Buffer at \" << ((void *)buffer)\n << \" offset: \" << offset << \" bytes: \" << bytes << ((type == READ) ? \" READ\" : \" WRITE\")\n );\n\n boostfd_file::fd_type fd = static_cast<boostfd_file *>(file_)->get_file_des();\n\n try\n {\n fd.seek(offset, BOOST_IOS::beg);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"seek() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") << \" : \" << ex.what() );\n\n error_occured(msg.str());\n }\n\n {\n if (type == READ)\n {\n #if STXXL_IO_STATS\n iostats->read_started (size());\n #endif\n\n debugmon::get_instance()->io_started((char *)buffer);\n\n try\n {\n fd.read((char *)buffer, bytes);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"read() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") <<\n \" nref= \" << nref() << \" : \" << ex.what() );\n\n error_occured(msg.str());\n }\n\n debugmon::get_instance()->io_finished((char *)buffer);\n\n #if STXXL_IO_STATS\n iostats->read_finished ();\n #endif\n }\n else\n {\n #if STXXL_IO_STATS\n iostats->write_started (size());\n #endif\n\n debugmon::get_instance()->io_started((char *)buffer);\n\n try\n {\n fd.write((char *)buffer, bytes);\n }\n catch (const std::exception & ex)\n {\n STXXL_FORMAT_ERROR_MSG(msg, \"write() in boostfd_request::serve() offset=\" << offset\n << \" this=\" << long (this) << \" buffer=\" <<\n buffer << \" bytes=\" << bytes\n << \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\") <<\n \" nref= \" << nref() << \" : \" << ex.what() );\n\n error_occured(msg.str());\n }\n\n debugmon::get_instance()->io_finished((char *)buffer);\n\n #if STXXL_IO_STATS\n iostats->write_finished ();\n #endif\n }\n }\n\n if (nref() < 2)\n {\n STXXL_ERRMSG(\"WARNING: reference to the request is lost after serve (nref=\" << nref() << \") \" <<\n \" this=\" << long (this) <<\n \" offset=\" << offset << \" buffer=\" << buffer << \" bytes=\" << bytes <<\n \" type=\" << ((type == READ) ? \"READ\" : \"WRITE\"));\n }\n\n _state.set_to (DONE);\n\n #ifdef STXXL_BOOST_THREADS\n boost::mutex::scoped_lock Lock(waiters_mutex);\n #else\n waiters_mutex.lock ();\n #endif\n \/\/ << notification >>\n std::for_each(\n waiters.begin(),\n waiters.end(),\n std::mem_fun(&onoff_switch::on) );\n\n #ifdef STXXL_BOOST_THREADS\n Lock.unlock();\n #else\n waiters_mutex.unlock ();\n #endif\n\n completed ();\n _state.set_to (READY2DIE);\n}\n\nrequest_ptr boostfd_file::aread (\n void * buffer,\n stxxl::int64 pos,\n size_t bytes,\n completion_handler on_cmpl)\n{\n request_ptr req = new boostfd_request(this,\n buffer, pos, bytes,\n request::READ, on_cmpl);\n\n if (!req.get())\n stxxl_function_error(io_error);\n\n\n #ifndef NO_OVERLAPPING\n disk_queues::get_instance ()->add_readreq(req, get_id());\n #endif\n return req;\n}\nrequest_ptr boostfd_file::awrite (\n void * buffer,\n stxxl::int64 pos,\n size_t bytes,\n completion_handler on_cmpl)\n{\n request_ptr req = new boostfd_request(this, buffer, pos, bytes,\n request::WRITE, on_cmpl);\n\n if (!req.get())\n stxxl_function_error(io_error);\n\n\n #ifndef NO_OVERLAPPING\n disk_queues::get_instance ()->add_writereq(req, get_id());\n #endif\n return req;\n}\n\n\n\n__STXXL_END_NAMESPACE\n\n#endif \/\/ BOOST_VERSION\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ #include <compare>\n\/\/ #include <concepts>\n\n#include \"acmacs-base\/argv.hh\"\n#include \"acmacs-base\/range-v3.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"acmacs-base\/quicklook.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"acmacs-chart-2\/stress.hh\"\n#include \"acmacs-chart-2\/randomizer.hh\"\n#include \"acmacs-chart-2\/bounding-ball.hh\"\n#include \"acmacs-draw\/surface-cairo.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ template <typename T> requires requires (const T& a, const T& b)\n\/\/ {\n\/\/ a.compare(b);\n\/\/ \/\/ {\n\/\/ \/\/ a.compare(b)\n\/\/ \/\/ } -> concepts::convertible_to<int>;\n\/\/ }\n\/\/ inline std::strong_ordering operator<=>(const T& lhs, const T& rhs)\n\/\/ {\n\/\/ if (const auto res = lhs.compare(rhs); res == 0)\n\/\/ return std::strong_ordering::equal;\n\/\/ else if (res < 0)\n\/\/ return std::strong_ordering::less;\n\/\/ else\n\/\/ return std::strong_ordering::greater;\n\/\/ }\n\n\nstruct TiterRef\n{\n std::string serum;\n std::string antigen;\n size_t table_no;\n acmacs::chart::Titer titer;\n\n bool operator<(const TiterRef& rhs) const\n {\n if (const auto r1 = serum.compare(rhs.serum); r1 != 0)\n return r1 < 0;\n if (const auto r1 = antigen.compare(rhs.antigen); r1 != 0)\n return r1 < 0;\n return table_no < rhs.table_no;\n }\n\n \/\/ std::strong_ordering operator<=>(const TiterRef&) const = default;\n};\n\nstruct TiterRefCollapsed\n{\n std::string serum;\n std::string antigen;\n std::vector<acmacs::chart::Titer> titers;\n\n TiterRefCollapsed(const std::string& a_serum, const std::string& a_antigen, size_t num_tables) : serum{a_serum}, antigen{a_antigen}, titers(num_tables) {}\n\n static inline bool valid(const acmacs::chart::Titer& titer) { return !titer.is_dont_care(); }\n\n auto num_tables() const\n {\n return ranges::count_if(titers, valid);\n }\n\n auto mean_logged_titer() const\n {\n return ranges::accumulate(titers | ranges::views::filter(valid), 0.0, [](double sum, const auto& titer) { return sum + titer.logged_with_thresholded(); }) \/ static_cast<double>(num_tables());\n }\n\n bool eq(const TiterRef& raw) const { return serum == raw.serum && antigen == raw.antigen; }\n};\n\nclass ChartData\n{\n public:\n void scan(const acmacs::chart::Chart& chart)\n {\n const auto table_no = tables_.size();\n tables_.push_back(chart.info()->date());\n auto chart_antigens = chart.antigens();\n auto chart_sera = chart.sera();\n auto chart_titers = chart.titers();\n for (auto [ag_no, ag] : acmacs::enumerate(*chart_antigens)) {\n for (auto [sr_no, sr] : acmacs::enumerate(*chart_sera)) {\n if (const auto& titer = chart_titers->titer(ag_no, sr_no); !titer.is_dont_care())\n raw_.push_back(TiterRef{.serum = sr->full_name(), .antigen = ag->full_name(), .table_no = table_no, .titer = titer});\n }\n }\n }\n\n void collapse()\n {\n ranges::sort(raw_, &TiterRef::operator<);\n for (const auto& raw : raw_) {\n if (collapsed_.empty())\n collapsed_.emplace_back(raw.serum, raw.antigen, tables_.size());\n else if (!collapsed_.back().eq(raw)) {\n if (collapsed_.back().num_tables() < 2)\n collapsed_.pop_back();\n collapsed_.emplace_back(raw.serum, raw.antigen, tables_.size());\n }\n collapsed_.back().titers[raw.table_no] = raw.titer;\n }\n }\n\n void report_deviation_from_mean() const\n {\n for (const auto& en : collapsed_) {\n fmt::print(\"{}\\n{}\\n\", en.serum, en.antigen);\n const auto mean = en.mean_logged_titer();\n for (size_t t_no = 0; t_no < tables_.size(); ++t_no) {\n if (!en.titers[t_no].is_dont_care())\n fmt::print(\" {} {:>7s} {:.2f}\\n\", tables_[t_no], en.titers[t_no], std::abs(en.titers[t_no].logged_with_thresholded() - mean));\n else\n fmt::print(\" {}\\n\", tables_[t_no]);\n }\n fmt::print(\" {:.2f}\\n\\n\", mean);\n }\n }\n\n void report_average_deviation_from_mean_per_table() const\n {\n std::vector<std::pair<double, size_t>> deviations(tables_.size(), {0.0, 0});\n for (const auto& en : collapsed_) {\n const auto mean = en.mean_logged_titer();\n ranges::for_each(ranges::views::iota(0ul, deviations.size()) \/\/\n | ranges::views::filter([&en](size_t t_no) { return !en.titers[t_no].is_dont_care(); }),\n [&en, &deviations, mean](size_t t_no) {\n deviations[t_no].first += std::abs(en.titers[t_no].logged_with_thresholded() - mean);\n ++deviations[t_no].second;\n });\n }\n for (size_t t_no = 0; t_no < tables_.size(); ++t_no)\n fmt::print(\"{:2d} {} {:.2f} {:4d}\\n\", t_no, tables_[t_no], deviations[t_no].first \/ static_cast<double>(deviations[t_no].second), deviations[t_no].second);\n }\n\n auto make_distance_matrix(bool report = false) const\n {\n std::vector<std::vector<double>> matrix(tables_.size() * tables_.size());\n for (const auto& en : collapsed_) {\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n if (!en.titers[t1].is_dont_care() && !en.titers[t2].is_dont_care())\n matrix[t1 * tables_.size() + t2].push_back(std::abs(en.titers[t1].logged_with_thresholded() - en.titers[t2].logged_with_thresholded()));\n }\n }\n }\n\n if (report) {\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n auto& distances = matrix[t1 * tables_.size() + t2];\n ranges::sort(distances);\n fmt::print(\"{} {} mean:{} median:{} max:{} {}\\n\", tables_[t1], tables_[t2], ranges::accumulate(distances, 0.0) \/ static_cast<double>(distances.size()),\n distances[distances.size() \/ 2], distances.back(), distances);\n }\n }\n }\n\n acmacs::chart::TableDistances table_distances;\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n auto& distances = matrix[t1 * tables_.size() + t2];\n const auto mean = ranges::accumulate(distances, 0.0) \/ static_cast<double>(distances.size());\n table_distances.add_value(acmacs::chart::Titer::Regular, t1, t2, mean);\n }\n }\n return table_distances;\n }\n\n size_t num_tables() const { return tables_.size(); }\n constexpr const auto& tables() const { return tables_; }\n\n private:\n std::vector<acmacs::chart::TableDate> tables_;\n std::vector<TiterRef> raw_;\n std::vector<TiterRefCollapsed> collapsed_;\n};\n\n\/\/ ----------------------------------------------------------------------\n\nusing namespace acmacs::argv;\nstruct Options : public argv\n{\n Options(int a_argc, const char* const a_argv[], on_error on_err = on_error::exit) : argv() { parse(a_argc, a_argv, on_err); }\n\n std::string_view help_pre() const override { return \"compare titers of mutiple tables\"; }\n argument<str_array> charts{*this, arg_name{\"chart\"}, mandatory};\n\n option<str> output{*this, 'o'};\n\n};\n\nint main(int argc, char* const argv[])\n{\n int exit_code = 0;\n try {\n Options opt(argc, argv);\n\n ChartData data;\n for (const auto& fn : opt.charts)\n data.scan(*acmacs::chart::import_from_file(fn));\n data.collapse();\n \/\/ data.report_deviation_from_mean();\n data.report_average_deviation_from_mean_per_table();\n\n acmacs::chart::Stress stress(acmacs::number_of_dimensions_t{2}, data.num_tables());\n stress.table_distances() = data.make_distance_matrix(true);\n\n double best_stress{9e99};\n acmacs::Layout best_layout(data.num_tables(), stress.number_of_dimensions());\n for (auto attempt : acmacs::range(1ul)) {\n acmacs::Layout layout(data.num_tables(), stress.number_of_dimensions());\n acmacs::chart::LayoutRandomizerPlain rnd(10.0, std::nullopt);\n for (auto point_no : acmacs::range(layout.number_of_points()))\n layout.update(point_no, rnd.get(stress.number_of_dimensions()));\n\n const auto status1 =\n acmacs::chart::optimize(acmacs::chart::optimization_method::alglib_cg_pca, stress, layout.data(), layout.data() + layout.size(), acmacs::chart::optimization_precision::rough);\n \/\/ fmt::print(\"{:3d} stress: {} <- {} iterations: {}\\n\", attempt, status1.final_stress, status1.initial_stress, status1.number_of_iterations);\n if (status1.final_stress < best_stress) {\n best_stress = status1.final_stress;\n best_layout = layout;\n }\n }\n fmt::print(\"best_stress: {}\\n\", best_stress);\n\n if (opt.output) {\n const std::array colors_of_tables{\n GREEN, \/\/ 20180206 Leah G\/Heidi\n RED, \/\/ 20180227 Tasuola\n BLUE, \/\/ 20180528 Rob\n RED, \/\/ 20180605 Tasuola\n BLUE, \/\/ 20180626 Rob\n GREEN, \/\/ 20180821 Heidi\/Malet\n GREEN, \/\/ 20180918 Heidi\/Tas\n GREEN, \/\/ 20181127 Heidi\n RED, \/\/ 20181213 Tasuola\n RED, \/\/ 20190211 Tasuola\/Rob\n RED, \/\/ 20190409 Tasuola\n GREEN, \/\/ 20190514 Leah\n GREEN, \/\/ 20190521 Leah\n GREEN, \/\/ 20190716 Leah\/Heidi\n GREEN, \/\/ 20190820 Leah\n GREEN, \/\/ 20190903 Leah\n GREEN, \/\/ 20190918 Leah\n\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n GREEN,\n };\n const double size = 800.0;\n acmacs::surface::PdfCairo surface(opt.output, size, size, size);\n const acmacs::BoundingBall bb{minimum_bounding_ball(best_layout)};\n acmacs::Viewport viewport;\n viewport.set_from_center_size(bb.center(), bb.diameter());\n viewport.whole_width();\n fmt::print(\"{}\\n\", viewport);\n acmacs::surface::Surface& rescaled_surface = surface.subsurface(acmacs::PointCoordinates::zero2D, Scaled{surface.viewport().size.width}, viewport, true);\n rescaled_surface.grid(Scaled{1.0}, GREY, Pixels{1});\n for (size_t t1 = 0; t1 < data.num_tables(); ++t1) {\n rescaled_surface.circle_filled(best_layout[t1], Pixels{10}, AspectNormal, NoRotation, BLACK, Pixels{1}, acmacs::surface::Dash::NoDash, colors_of_tables[t1]);\n rescaled_surface.text(best_layout[t1] + acmacs::PointCoordinates{-0.05, 0.05}, data.tables()[t1], RED, Pixels{10});\n }\n acmacs::open(opt.output, 1, 1);\n }\n }\n catch (std::exception& err) {\n AD_ERROR(\"{}\", err);\n exit_code = 2;\n }\n return exit_code;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<commit_msg>chart-table-compare<commit_after>\/\/ #include <compare>\n\/\/ #include <concepts>\n\n#include \"acmacs-base\/argv.hh\"\n#include \"acmacs-base\/range-v3.hh\"\n#include \"acmacs-base\/enumerate.hh\"\n#include \"acmacs-base\/quicklook.hh\"\n#include \"acmacs-chart-2\/factory-import.hh\"\n#include \"acmacs-chart-2\/chart.hh\"\n#include \"acmacs-chart-2\/stress.hh\"\n#include \"acmacs-chart-2\/randomizer.hh\"\n#include \"acmacs-chart-2\/bounding-ball.hh\"\n#include \"acmacs-draw\/surface-cairo.hh\"\n\n\/\/ ----------------------------------------------------------------------\n\n\/\/ template <typename T> requires requires (const T& a, const T& b)\n\/\/ {\n\/\/ a.compare(b);\n\/\/ \/\/ {\n\/\/ \/\/ a.compare(b)\n\/\/ \/\/ } -> concepts::convertible_to<int>;\n\/\/ }\n\/\/ inline std::strong_ordering operator<=>(const T& lhs, const T& rhs)\n\/\/ {\n\/\/ if (const auto res = lhs.compare(rhs); res == 0)\n\/\/ return std::strong_ordering::equal;\n\/\/ else if (res < 0)\n\/\/ return std::strong_ordering::less;\n\/\/ else\n\/\/ return std::strong_ordering::greater;\n\/\/ }\n\n\nstruct TiterRef\n{\n std::string serum;\n std::string antigen;\n size_t table_no;\n acmacs::chart::Titer titer;\n\n bool operator<(const TiterRef& rhs) const\n {\n if (const auto r1 = serum.compare(rhs.serum); r1 != 0)\n return r1 < 0;\n if (const auto r1 = antigen.compare(rhs.antigen); r1 != 0)\n return r1 < 0;\n return table_no < rhs.table_no;\n }\n\n \/\/ std::strong_ordering operator<=>(const TiterRef&) const = default;\n};\n\nstruct TiterRefCollapsed\n{\n std::string serum;\n std::string antigen;\n std::vector<acmacs::chart::Titer> titers;\n\n TiterRefCollapsed(const std::string& a_serum, const std::string& a_antigen, size_t num_tables) : serum{a_serum}, antigen{a_antigen}, titers(num_tables) {}\n\n static inline bool valid(const acmacs::chart::Titer& titer) { return !titer.is_dont_care(); }\n\n auto num_tables() const\n {\n return ranges::count_if(titers, valid);\n }\n\n auto mean_logged_titer() const\n {\n return ranges::accumulate(titers | ranges::views::filter(valid), 0.0, [](double sum, const auto& titer) { return sum + titer.logged_with_thresholded(); }) \/ static_cast<double>(num_tables());\n }\n\n bool eq(const TiterRef& raw) const { return serum == raw.serum && antigen == raw.antigen; }\n};\n\nclass ChartData\n{\n public:\n void scan(const acmacs::chart::Chart& chart)\n {\n const auto table_no = tables_.size();\n tables_.push_back(chart.info()->date());\n auto chart_antigens = chart.antigens();\n auto chart_sera = chart.sera();\n auto chart_titers = chart.titers();\n for (auto [ag_no, ag] : acmacs::enumerate(*chart_antigens)) {\n for (auto [sr_no, sr] : acmacs::enumerate(*chart_sera)) {\n if (const auto& titer = chart_titers->titer(ag_no, sr_no); !titer.is_dont_care())\n raw_.push_back(TiterRef{.serum = sr->full_name(), .antigen = ag->full_name(), .table_no = table_no, .titer = titer});\n }\n }\n }\n\n void collapse()\n {\n ranges::sort(raw_, &TiterRef::operator<);\n for (const auto& raw : raw_) {\n if (collapsed_.empty())\n collapsed_.emplace_back(raw.serum, raw.antigen, tables_.size());\n else if (!collapsed_.back().eq(raw)) {\n if (collapsed_.back().num_tables() < 2)\n collapsed_.pop_back();\n collapsed_.emplace_back(raw.serum, raw.antigen, tables_.size());\n }\n collapsed_.back().titers[raw.table_no] = raw.titer;\n }\n }\n\n void report_deviation_from_mean() const\n {\n for (const auto& en : collapsed_) {\n fmt::print(\"{}\\n{}\\n\", en.serum, en.antigen);\n const auto mean = en.mean_logged_titer();\n for (size_t t_no = 0; t_no < tables_.size(); ++t_no) {\n if (!en.titers[t_no].is_dont_care())\n fmt::print(\" {} {:>7s} {:.2f}\\n\", tables_[t_no], en.titers[t_no], std::abs(en.titers[t_no].logged_with_thresholded() - mean));\n else\n fmt::print(\" {}\\n\", tables_[t_no]);\n }\n fmt::print(\" {:.2f}\\n\\n\", mean);\n }\n }\n\n void report_average_deviation_from_mean_per_table() const\n {\n std::vector<std::pair<double, size_t>> deviations(tables_.size(), {0.0, 0});\n for (const auto& en : collapsed_) {\n const auto mean = en.mean_logged_titer();\n ranges::for_each(ranges::views::iota(0ul, deviations.size()) \/\/\n | ranges::views::filter([&en](size_t t_no) { return !en.titers[t_no].is_dont_care(); }),\n [&en, &deviations, mean](size_t t_no) {\n deviations[t_no].first += std::abs(en.titers[t_no].logged_with_thresholded() - mean);\n ++deviations[t_no].second;\n });\n }\n for (size_t t_no = 0; t_no < tables_.size(); ++t_no)\n fmt::print(\"{:2d} {} {:.2f} {:4d}\\n\", t_no, tables_[t_no], deviations[t_no].first \/ static_cast<double>(deviations[t_no].second), deviations[t_no].second);\n }\n\n auto make_distance_matrix(bool report = false) const\n {\n std::vector<std::vector<double>> matrix(tables_.size() * tables_.size());\n for (const auto& en : collapsed_) {\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n if (!en.titers[t1].is_dont_care() && !en.titers[t2].is_dont_care())\n matrix[t1 * tables_.size() + t2].push_back(std::abs(en.titers[t1].logged_with_thresholded() - en.titers[t2].logged_with_thresholded()));\n }\n }\n }\n\n if (report) {\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n if (auto& distances = matrix[t1 * tables_.size() + t2]; !distances.empty()) {\n ranges::sort(distances);\n fmt::print(\"{} {} mean:{} median:{} max:{} {}\\n\", tables_[t1], tables_[t2], ranges::accumulate(distances, 0.0) \/ static_cast<double>(distances.size()),\n distances[distances.size() \/ 2], distances.back(), distances);\n }\n else\n fmt::print(\"{} {}: *no distances*\\n\", tables_[t1], tables_[t2]);\n }\n }\n }\n\n acmacs::chart::TableDistances table_distances;\n for (size_t t1 = 0; t1 < (tables_.size() - 1); ++t1) {\n for (size_t t2 = t1 + 1; t2 < tables_.size(); ++t2) {\n if (auto& distances = matrix[t1 * tables_.size() + t2]; !distances.empty()) {\n const auto mean = ranges::accumulate(distances, 0.0) \/ static_cast<double>(distances.size());\n table_distances.add_value(acmacs::chart::Titer::Regular, t1, t2, mean);\n }\n }\n }\n return table_distances;\n }\n\n size_t num_tables() const { return tables_.size(); }\n constexpr const auto& tables() const { return tables_; }\n\n private:\n std::vector<acmacs::chart::TableDate> tables_;\n std::vector<TiterRef> raw_;\n std::vector<TiterRefCollapsed> collapsed_;\n};\n\n\/\/ ----------------------------------------------------------------------\n\nusing namespace acmacs::argv;\nstruct Options : public argv\n{\n Options(int a_argc, const char* const a_argv[], on_error on_err = on_error::exit) : argv() { parse(a_argc, a_argv, on_err); }\n\n std::string_view help_pre() const override { return \"compare titers of mutiple tables\"; }\n argument<str_array> charts{*this, arg_name{\"chart\"}, mandatory};\n\n option<str> output{*this, 'o'};\n option<size_t> number_of_optimizations{*this, 'n', dflt{100ul}};\n};\n\nint main(int argc, char* const argv[])\n{\n int exit_code = 0;\n try {\n Options opt(argc, argv);\n\n ChartData data;\n for (const auto& fn : opt.charts)\n data.scan(*acmacs::chart::import_from_file(fn));\n data.collapse();\n \/\/ data.report_deviation_from_mean();\n data.report_average_deviation_from_mean_per_table();\n\n acmacs::chart::Stress stress(acmacs::number_of_dimensions_t{2}, data.num_tables());\n stress.table_distances() = data.make_distance_matrix();\n\n double best_stress{9e99};\n acmacs::Layout best_layout(data.num_tables(), stress.number_of_dimensions());\n for ([[maybe_unused]] auto attempt : acmacs::range(*opt.number_of_optimizations)) {\n acmacs::Layout layout(data.num_tables(), stress.number_of_dimensions());\n acmacs::chart::LayoutRandomizerPlain rnd(10.0, std::nullopt);\n for (auto point_no : acmacs::range(layout.number_of_points()))\n layout.update(point_no, rnd.get(stress.number_of_dimensions()));\n\n const auto status1 =\n acmacs::chart::optimize(acmacs::chart::optimization_method::alglib_cg_pca, stress, layout.data(), layout.data() + layout.size(), acmacs::chart::optimization_precision::rough);\n \/\/ fmt::print(\"{:3d} stress: {} <- {} iterations: {}\\n\", attempt, status1.final_stress, status1.initial_stress, status1.number_of_iterations);\n if (status1.final_stress < best_stress) {\n best_stress = status1.final_stress;\n best_layout = layout;\n }\n }\n fmt::print(\"best_stress: {}\\n\", best_stress);\n\n if (opt.output) {\n const std::array colors_of_tables{\n GREEN, \/\/ 20180206 Leah G\/Heidi\n RED, \/\/ 20180227 Tasuola\n BLUE, \/\/ 20180528 Rob\n RED, \/\/ 20180605 Tasuola\n BLUE, \/\/ 20180626 Rob\n GREEN, \/\/ 20180821 Heidi\/Malet\n GREEN, \/\/ 20180918 Heidi\/Tas\n GREEN, \/\/ 20181127 Heidi\n RED, \/\/ 20181213 Tasuola\n RED, \/\/ 20190211 Tasuola\/Rob\n RED, \/\/ 20190409 Tasuola\n GREEN, \/\/ 20190514 Leah\n GREEN, \/\/ 20190521 Leah\n GREEN, \/\/ 20190716 Leah\/Heidi\n GREEN, \/\/ 20190820 Leah\n GREEN, \/\/ 20190903 Leah\n GREEN, \/\/ 20190918 Leah\n };\n const double size = 800.0;\n acmacs::surface::PdfCairo surface(opt.output, size, size, size);\n const acmacs::BoundingBall bb{minimum_bounding_ball(best_layout)};\n acmacs::Viewport viewport;\n viewport.set_from_center_size(bb.center(), bb.diameter());\n viewport.whole_width();\n fmt::print(\"{}\\n\", viewport);\n acmacs::surface::Surface& rescaled_surface = surface.subsurface(acmacs::PointCoordinates::zero2D, Scaled{surface.viewport().size.width}, viewport, true);\n rescaled_surface.grid(Scaled{1.0}, GREY, Pixels{1});\n for (size_t t1 = 0; t1 < data.num_tables(); ++t1) {\n const auto fill = t1 < colors_of_tables.size() ? colors_of_tables[t1] : GREEN;\n rescaled_surface.circle_filled(best_layout[t1], Pixels{10}, AspectNormal, NoRotation, BLACK, Pixels{1}, acmacs::surface::Dash::NoDash, fill);\n rescaled_surface.text(best_layout[t1] + acmacs::PointCoordinates{-0.05, 0.05}, data.tables()[t1], BLACK, Pixels{10});\n }\n acmacs::open(opt.output, 1, 1);\n }\n }\n catch (std::exception& err) {\n AD_ERROR(\"{}\", err);\n exit_code = 2;\n }\n return exit_code;\n}\n\n\/\/ ----------------------------------------------------------------------\n\/\/\/ Local Variables:\n\/\/\/ eval: (if (fboundp 'eu-rename-buffer) (eu-rename-buffer))\n\/\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"filesystem\/Path.h\"\n#include <iostream>\n\nusing namespace std::literals::string_literals;\n\n::std::ostream& operator<<(::std::ostream& os, const Path& path) {\n return os << std::string(path).c_str();\n}\n\nTEST(PathAppendTests, ReturnsAppendedPathWithFileNAme)\n{\n\tPath path(\"\/home\/serengeor\/Coding\");\n\tPath path2(\"TheEngine2\");\n\tPath correctPath(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\n\tPath appendPathResult = path.Append(path2);\n\n\tASSERT_EQ(correctPath, appendPathResult);\n}\n\nTEST(PathAppendTests, ReturnsAppendedPathWithoutAdditionalSeparators)\n{\n\t\/\/REFACTOR: Clarify this test\n\tPath path(\"\/home\/serengeor\/Coding\");\n\tPath pathS(\"\/home\/serengeor\/Coding\/\");\n\tPath path2(\"TheEngine2\");\n\tPath path2S(\"\/TheEngine2\");\n\tPath correctPath(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\n\tPath appendPathResult1 = path.Append(path2);\n\tPath appendPathResult2 = pathS.Append(path2);\n\tPath appendPathResult3 = path.Append(path2S);\n\tPath appendPathResult4 = pathS.Append(path2S);\n\n\tASSERT_EQ(correctPath, appendPathResult1);\n\tASSERT_EQ(correctPath, appendPathResult2);\n\tASSERT_EQ(correctPath, appendPathResult3);\n\tASSERT_EQ(correctPath, appendPathResult4);\n}\n\nTEST(PathFileNameTests, ReturnsFileNameWithoutPath)\n{\n\tPath path(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\tPath path2(\"\/TheEngine2\");\n\n\tASSERT_EQ(\"TheEngine2\"s, path.GetFileName());\n\tASSERT_EQ(\"TheEngine2\"s, path2.GetFileName());\n}\n\nTEST(PathFileNameTests, ReturnsFileNameIfNotInDirectory)\n{\n\tPath path(\"TheEngine2\");\n\n\tASSERT_EQ(\"TheEngine2\"s, path.GetFileName());\n}\n\nTEST(PathFileNameTests, ReturnsFileNameWithExtension)\n{\n\tPath path(\"\/home\/serengeor\/Coding\/TheEngine2.exe\");\n\n\tASSERT_EQ(\"TheEngine2.exe\"s, path.GetFileName());\n}\n\nTEST(PathParentDirectoryTests, ReturnsParentDirWhenPathWithFile)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(pathString, path.GetParentDirectory());\n}\n\nTEST(PathParentDirectoryTests, ReturnsParentDirWhenPathWithFileAndExtension)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2.exe\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(pathString, path.GetParentDirectory());\n}\n\nTEST(PathExtensionTests, ReturnsExtensionWithDotWhenFileWithPath)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2.exe\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(\".exe\"s, path.GetExtension());\n}\n\nTEST(PathExtensionTests, ReturnsExtensionWithDotWhenFileWithout)\n{\n\tstd::string fileString = \"TheEngine2.exe\";\n\tPath path(fileString);\n\n\tASSERT_EQ(\".exe\"s, path.GetExtension());\n}\n\nTEST(PathExtensionTests, ReturnsEmptyStringForExtensionWhenNoExtension)\n{\n\tstd::string fileString = \"TheEngine2\";\n\tPath path(fileString);\n\n\tASSERT_EQ(\"\"s, path.GetExtension());\n}\n\nTEST(PathNormalizationTests, DuplicatedDirSeparatorsAreNormalizedOnConstruction)\n{\n\tstd::string goodPath = \"C:\/SomeRelativePath\/BlaBla\/SomeFile.exec\";\n\tstd::string badPath = \"C:\/\/SomeRelativePath\/\/\/\/\/\/\/BlaBla\/\/SomeFile.exec\";\n\t\n\tPath normalizedPath(badPath);\n\t\n\tASSERT_EQ(goodPath, normalizedPath.AsString());\n}<commit_msg>Windows separator test case.<commit_after>#include \"gtest\/gtest.h\"\n#include \"filesystem\/Path.h\"\n#include <iostream>\n\nusing namespace std::literals::string_literals;\n\n::std::ostream& operator<<(::std::ostream& os, const Path& path) {\n return os << std::string(path).c_str();\n}\n\nTEST(PathAppendTests, ReturnsAppendedPathWithFileNAme)\n{\n\tPath path(\"\/home\/serengeor\/Coding\");\n\tPath path2(\"TheEngine2\");\n\tPath correctPath(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\n\tPath appendPathResult = path.Append(path2);\n\n\tASSERT_EQ(correctPath, appendPathResult);\n}\n\nTEST(PathAppendTests, ReturnsAppendedPathWithoutAdditionalSeparators)\n{\n\t\/\/REFACTOR: Clarify this test\n\tPath path(\"\/home\/serengeor\/Coding\");\n\tPath pathS(\"\/home\/serengeor\/Coding\/\");\n\tPath path2(\"TheEngine2\");\n\tPath path2S(\"\/TheEngine2\");\n\tPath correctPath(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\n\tPath appendPathResult1 = path.Append(path2);\n\tPath appendPathResult2 = pathS.Append(path2);\n\tPath appendPathResult3 = path.Append(path2S);\n\tPath appendPathResult4 = pathS.Append(path2S);\n\n\tASSERT_EQ(correctPath, appendPathResult1);\n\tASSERT_EQ(correctPath, appendPathResult2);\n\tASSERT_EQ(correctPath, appendPathResult3);\n\tASSERT_EQ(correctPath, appendPathResult4);\n}\n\nTEST(PathFileNameTests, ReturnsFileNameWithoutPath)\n{\n\tPath path(\"\/home\/serengeor\/Coding\/TheEngine2\");\n\tPath path2(\"\/TheEngine2\");\n\n\tASSERT_EQ(\"TheEngine2\"s, path.GetFileName());\n\tASSERT_EQ(\"TheEngine2\"s, path2.GetFileName());\n}\n\nTEST(PathFileNameTests, ReturnsFileNameIfNotInDirectory)\n{\n\tPath path(\"TheEngine2\");\n\n\tASSERT_EQ(\"TheEngine2\"s, path.GetFileName());\n}\n\nTEST(PathFileNameTests, ReturnsFileNameWithExtension)\n{\n\tPath path(\"\/home\/serengeor\/Coding\/TheEngine2.exe\");\n\n\tASSERT_EQ(\"TheEngine2.exe\"s, path.GetFileName());\n}\n\nTEST(PathParentDirectoryTests, ReturnsParentDirWhenPathWithFile)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(pathString, path.GetParentDirectory());\n}\n\nTEST(PathParentDirectoryTests, ReturnsParentDirWhenPathWithFileAndExtension)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2.exe\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(pathString, path.GetParentDirectory());\n}\n\nTEST(PathExtensionTests, ReturnsExtensionWithDotWhenFileWithPath)\n{\n\tstd::string pathString = \"\/home\/serengeor\/Coding\";\n\tstd::string fileString = \"\/TheEngine2.exe\";\n\tPath path(pathString+fileString);\n\n\tASSERT_EQ(\".exe\"s, path.GetExtension());\n}\n\nTEST(PathExtensionTests, ReturnsExtensionWithDotWhenFileWithout)\n{\n\tstd::string fileString = \"TheEngine2.exe\";\n\tPath path(fileString);\n\n\tASSERT_EQ(\".exe\"s, path.GetExtension());\n}\n\nTEST(PathExtensionTests, ReturnsEmptyStringForExtensionWhenNoExtension)\n{\n\tstd::string fileString = \"TheEngine2\";\n\tPath path(fileString);\n\n\tASSERT_EQ(\"\"s, path.GetExtension());\n}\n\nTEST(PathNormalizationTests, DuplicatedDirSeparatorsAreNormalizedOnConstruction)\n{\n\tstd::string goodPath = \"C:\/SomeRelativePath\/BlaBla\/SomeFile.exec\";\n\tstd::string badUnixSeparatorPath = \"C:\/\/SomeRelativePath\/\/\/\/\/\/\/BlaBla\/\/SomeFile.exec\";\n\tstd::string badWinSeparatorPath = \"C:\\\\\\\\SomeRelativePath\\\\\\\\\\\\\\\\BlaBla\\\\\\\\SomeFile.exec\";\n\t\n\tPath normalizedUnixPath(badUnixSeparatorPath);\n\tPath normalizedWinPath(badWinSeparatorPath);\n\t\n\tASSERT_EQ(goodPath, normalizedUnixPath.AsString());\n\tASSERT_EQ(goodPath, normalizedWinPath.AsString());\n}<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n * @file horner_rule.hpp\n * @author Alan.W\n * @date 27 Aug 2014\n * @version 2\n * @remark CLRS Algorithms implementation in C++ templates.\n ***************************************************************************\/\n\/\/!\n\/\/! @problem 2-3 Correctness of Horner’s rule\n\/\/!\n\n#ifndef HORNER_RULE_HPP\n#define HORNER_RULE_HPP\n\n#include \"iterator.hpp\"\n\nnamespace clrs {namespace ch2 {\n\n\/**\n * @brief horner_rule\n * @param first\n * @param last\n * @param x\n *\n * @ex problem 2-3\n * @complx O(n)\n *\/\ntemplate<typename Iter>\ninline clrs::IterValue<Iter>\nhorner_rule(Iter first, Iter last, const clrs::IterValue<Iter>& x)\n{\n clrs::IterValue<Iter> ret = 0;\n for(auto it = last - 1; it != first - 1; --it)\n ret = *it + x * ret;\n\n return ret;\n}\n\n}}\/\/namespace\n\n#endif \/\/ HORNER_RULE_HPP\n\n\/\/! @test horner_rule for problem 2-3\n\/\/!\n\/\/#include <iostream>\n\/\/#include <vector>\n\/\/#include \"alan.hpp\"\n\/\/#include \"horner_rule.hpp\"\n\n\/\/int main()\n\/\/{\n\/\/ std::vector<int> v{1,6,88,2,3,77};\n\/\/ auto ret = clrs::ch2::horner_rule(v.begin(), v.end(),3);\n\/\/ std::cout << ret;\n\n\/\/ alan::end();\n\/\/ return 0;\n\/\/}\n\/\/! @output\n\/\/!\n\/\/19819\n\/\/exit normally\n<commit_msg>refactor : polynomial_evaluate, not tested \tmodified: horner_rule.hpp<commit_after>\/***************************************************************************\n * @file horner_rule.hpp\n * @author Alan.W\n * @date 27 Aug 2014\n * @version 2\n * @remark CLRS Algorithms implementation in C++ templates.\n ***************************************************************************\/\n\/\/!\n\/\/! @problem 2-3 Correctness of Horner’s rule\n\/\/!\n\n#ifndef HORNER_RULE_HPP\n#define HORNER_RULE_HPP\n\n#include \"iterator.hpp\"\n\nnamespace clrs {namespace ch2 {\n\n\/**\n * @brief horner_rule\n * @param first\n * @param last\n * @param x\n *\n * @ex problem 2-3\n * @complx O(n)\n *\/\ntemplate<typename Iter>\ninline clrs::IterValue<Iter>\nhorner_rule(Iter first, Iter last, const clrs::IterValue<Iter>& x)\n{\n clrs::IterValue<Iter> ret = 0;\n for(auto it = last - 1; it != first - 1; --it)\n ret = *it + x * ret;\n\n return ret;\n}\n\ntemplate<typename ValueType>\ninline ValueType\npower(int order, const ValueType& x)\n{\n return order > 0? x * power(order - 1, x) : 1;\n}\n\ntemplate<typename Iter>\nclrs::IterValue<Iter>\npolynomial_evaluate(Iter first, Iter last, const clrs::IterValue<Iter>& x)\n{\n IterValue<Iter> ret = 0;\n int order = 0;\n for(auto it = first; it != last; ++it)\n ret += *it * power(order++, x);\n\n return ret;\n}\n\n}}\/\/namespace\n\n#endif \/\/ HORNER_RULE_HPP\n\n\/\/! @test horner_rule for problem 2-3\n\/\/!\n\/\/#include <iostream>\n\/\/#include <vector>\n\/\/#include \"alan.hpp\"\n\/\/#include \"horner_rule.hpp\"\n\n\/\/int main()\n\/\/{\n\/\/ std::vector<int> v{1,6,88,2,3,77};\n\/\/ auto ret = clrs::ch2::horner_rule(v.begin(), v.end(),3);\n\/\/ std::cout << ret;\n\n\/\/ alan::end();\n\/\/ return 0;\n\/\/}\n\/\/! @output\n\/\/!\n\/\/19819\n\/\/exit normally\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Improve shadow cascade frustum bounds<commit_after><|endoftext|>"} {"text":"<commit_before>\/** @file runtime.hpp\n*\/\n\n#ifndef RUNTIME_HPP_INCLUDED\n#define RUNTIME_HPP_INCLUDED\n\n#include <thread>\n#include <atomic>\n#include <mutex>\n#include <condition_variable>\n#include <array>\n#include <assert.h>\n#include <stdlib.h>\n\n#include \"StateMachineOwner.hpp\"\n#include \"threadpool.hpp\"\n#include \"ievent.hpp\"\n#include \"threadpoolmanager.hpp\"\n#include \"ESRoot\/Types.hpp\"\n#include \"ESRoot\/AtomicCounter.hpp\"\n\nnamespace Execution \n{\n\ntemplate<typename RuntimeType, int NC>\nclass IRuntime\n{\npublic:\n\n\t\/*!\n\tReturns the runtime instance during the model execution.\n\t*\/\n\tstatic ES::RuntimePtr<RuntimeType,NC> getRuntimeInstance()\n\t{\n\t\tif (instance == nullptr)\n\t\t{\n\t\t\tinstance = RuntimeType::createRuntime();\n\t\t}\n\t\treturn instance;\n\t}\n\n\t\/*!\n\tRegisters a state machine in the runtime instance so\n\tthe threaded runtime can record the number of object instances during the model execution.\n\tCalled by the state machine constructor.\n\t*\/\n\tvoid setupObject(ES::StateMachineRef sm)\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->setupObjectSpecificRuntime(sm);\n\t}\n\n\n\t\/*!\n\tRemoves a state machine from the runtime instance when\n\tthe threaded runtime can record the number of object instances during the model execution.\n\tCalled by the state machine destructor.\n\t*\/\n\tvoid removeObject(ES::StateMachineRef sm)\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->removeObject(sm);\n\t}\n\n\n\t\/*!\n\tSets the deployment configuration for the threaded runtime instance.\n\t*\/\n\tvoid configure(std::array<ES::SharedPtr<Configuration>, NC> configuration)\n\t{\n\t\tif (!(static_cast<RuntimeType*>(this)->isConfigurated()))\n\t\t{\n\t\t\tstatic_cast<RuntimeType*>(this)->setConfiguration(configuration);\n\t\t}\n\n\t}\n\n\t\/*!\n\tStarts the model execution.\n\t*\/\n\tvoid startRT()\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->start();\n\t}\n\n\n\t\/*!\n\tStops the runtime instance when there are no more messages to process and under processing.\n\t*\/\n\tvoid stopUponCompletion()\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->stopUponCompletion();\n\t}\n\n\nprotected:\n\tstatic ES::RuntimePtr<RuntimeType,NC> instance;\n\tIRuntime() {}\n};\n\ntemplate<int NC>\nclass SingleThreadRT : public IRuntime<SingleThreadRT<NC>, NC>\n{\npublic:\n\tvirtual ~SingleThreadRT();\n\n\t\/*!\n\tProcesses the events while the message queue is not empty.\n\t*\/\n\tvoid start();\n\n\tvoid setupObjectSpecificRuntime(ES::StateMachineRef);\n\tvoid removeObject(ES::StateMachineRef);\n\tvoid setConfiguration(std::array<ES::SharedPtr<Configuration>,NC>);\n\tbool isConfigurated();\n\tvoid stopUponCompletion();\n\tstatic ES::RuntimePtr<SingleThreadRT,NC> createRuntime() { return ES::RuntimePtr<SingleThreadRT<NC>,NC>(new SingleThreadRT<NC>()); }\nprivate:\n\tSingleThreadRT();\n\tES::SharedPtr<ES::MessageQueueType> _messageQueue;\n\n};\n\ntemplate<int NC>\nclass ConfiguredThreadedRT : public IRuntime<ConfiguredThreadedRT<NC>,NC>\n{\n\ttypedef typename std::array<unsigned, NC>::size_type id_type;\npublic:\n\tvirtual ~ConfiguredThreadedRT();\n\t\/*!\n\tStarts the thread pools.\n\t*\/\n\tvoid start();\n\n\tvoid setupObjectSpecificRuntime(ES::StateMachineRef);\n\tvoid removeObject(ES::StateMachineRef);\n\tvoid setConfiguration(std::array<ES::SharedPtr<Configuration>, NC>);\n\tbool isConfigurated();\n\tvoid stopUponCompletion();\n\tstatic ES::RuntimePtr<ConfiguredThreadedRT,NC> createRuntime() { return ES::RuntimePtr<ConfiguredThreadedRT<NC>,NC>(new ConfiguredThreadedRT<NC>()); }\nprivate:\n\tConfiguredThreadedRT();\n\tES::SharedPtr<ThreadPoolManager<NC>> poolManager;\n\tstd::array<unsigned, NC> numberOfObjects;\n\n\tES::SharedPtr<ES::AtomicCounter> worker;\n\tES::SharedPtr<ES::AtomicCounter> messages;\n\tstd::condition_variable stop_request_cond;\n};\n\n\n\n\ntemplate<typename RuntimeType, int NC>\nES::RuntimePtr<RuntimeType,NC> IRuntime<RuntimeType, NC>::instance = nullptr;\n\n\n\/\/ SingleThreadRT\ntemplate<int NC>\nSingleThreadRT<NC>::SingleThreadRT() :_messageQueue(new ES::MessageQueueType()) {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::setupObjectSpecificRuntime(ES::StateMachineRef sm)\n{\n\tsm->setMessageQueue(_messageQueue);\n\tsm->setMessageCounter(ES::SharedPtr<ES::AtomicCounter>(new ES::AtomicCounter()));\n}\n\ntemplate<int NC>\nSingleThreadRT<NC>::~SingleThreadRT()\n{\n}\n\ntemplate<int NC>\nbool SingleThreadRT<NC>::isConfigurated()\n{\n\treturn true;\n}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::start()\n{\n\n\twhile (!_messageQueue->isEmpty())\n\t{\n\t\tES::EventRef e = _messageQueue->next();\n\t\tif (Model::IEvent<Model::EventBase>::eventIsValid(e)) {\n\t\t\tconst ES::StateMachineRef sm = e->getTargetSM();\n\t\t\tsm->processNextEvent();\n\t\t}\n\t\telse {\n\t\t\t_messageQueue->dequeue(e); \/\/ drop event\n\t\t}\n\n\n\t}\n\n}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::setConfiguration(std::array<ES::SharedPtr<Configuration>, NC>) {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::stopUponCompletion() {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::removeObject(ES::StateMachineRef) {}\n\n\/\/ ConfiguredThreadedRT\ntemplate<int NC>\nConfiguredThreadedRT<NC>::ConfiguredThreadedRT () :\n\tpoolManager (new ThreadPoolManager<NC> ()),\n\tworker (new ES::AtomicCounter ()),\n\tmessages (new ES::AtomicCounter ()) {}\n\ntemplate<int NC>\nConfiguredThreadedRT<NC>::~ConfiguredThreadedRT () {}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::start ()\n{\n\tassert (isConfigurated () && \"The configurated threaded runtime should be configured before starting.\");\n\n\tif (isConfigurated ())\n\t{\n\t\tfor (id_type i = 0; i < (id_type)NC; i++)\n\t\t{\n\t\t\tES::SharedPtr<StateMachineThreadPool> pool = poolManager->getPool (i);\n\t\t\tpool->setWorkersCounter (worker);\n\t\t\tpool->setMessageCounter (messages);\n\t\t\tpool->setStopReqest (&stop_request_cond);\n\t\t\tpool->startPool (poolManager->calculateNOfThreads (i,numberOfObjects[i]));\n\t\t}\n\t}\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::removeObject (ES::StateMachineRef sm)\n{\n\tid_type objectId = (id_type) sm->getPoolId ();\n\tnumberOfObjects[objectId]--;\n\tpoolManager->recalculateThreads (objectId, numberOfObjects[objectId]);\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::stopUponCompletion ()\n{\n\tfor (int i = 0; i < NC; i++)\n\t{\n\t\tpoolManager->getPool ((id_type)i)->stopUponCompletion ();\n\t}\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::setupObjectSpecificRuntime (ES::StateMachineRef sm)\n{\n\n\tsm->setMessageCounter (messages);\n\tid_type objectId = (id_type)sm->getPoolId ();\n\tES::SharedPtr<StateMachineThreadPool> matchedPool = poolManager->getPool (objectId);\n\tsm->setPool (matchedPool);\n\tnumberOfObjects[objectId]++;\n\tpoolManager->recalculateThreads (objectId, numberOfObjects[objectId]);\n}\n\ntemplate<int NC>\nbool ConfiguredThreadedRT<NC>::isConfigurated ()\n{\n\treturn poolManager->isConfigurated ();\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::setConfiguration (std::array<ES::SharedPtr<Configuration>, NC> conf)\n{\n\tpoolManager->setConfiguration (conf);\n\tfor (id_type i = 0; i < numberOfObjects.size (); ++i) {\n\t\tnumberOfObjects[i] = 0;\n\t}\n}\n\n}\n\n\n#endif \/\/ RUNTIME_HPP_INCLUDED\n<commit_msg>Make runtime instance thread safe<commit_after>\/** @file runtime.hpp\n*\/\n\n#ifndef RUNTIME_HPP_INCLUDED\n#define RUNTIME_HPP_INCLUDED\n\n#include <thread>\n#include <atomic>\n#include <mutex>\n#include <condition_variable>\n#include <array>\n#include <assert.h>\n#include <stdlib.h>\n\n#include \"StateMachineOwner.hpp\"\n#include \"threadpool.hpp\"\n#include \"ievent.hpp\"\n#include \"threadpoolmanager.hpp\"\n#include \"ESRoot\/Types.hpp\"\n#include \"ESRoot\/AtomicCounter.hpp\"\n\nnamespace Execution \n{\n\ntemplate<typename RuntimeType, int NC>\nclass IRuntime\n{\npublic:\n\n\t\/*!\n\tReturns the runtime instance during the model execution.\n\t*\/\n\tstatic ES::RuntimePtr<RuntimeType,NC> getRuntimeInstance()\n\t{\n\t\tstd::call_once (runtimeInstanceInitFlag, initRuntime);\n\t\treturn instance;\n\t}\n\n\t\/*!\n\tRegisters a state machine in the runtime instance so\n\tthe threaded runtime can record the number of object instances during the model execution.\n\tCalled by the state machine constructor.\n\t*\/\n\tvoid setupObject(ES::StateMachineRef sm)\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->setupObjectSpecificRuntime(sm);\n\t}\n\n\n\t\/*!\n\tRemoves a state machine from the runtime instance when\n\tthe threaded runtime can record the number of object instances during the model execution.\n\tCalled by the state machine destructor.\n\t*\/\n\tvoid removeObject(ES::StateMachineRef sm)\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->removeObject(sm);\n\t}\n\n\n\t\/*!\n\tSets the deployment configuration for the threaded runtime instance.\n\t*\/\n\tvoid configure(std::array<ES::SharedPtr<Configuration>, NC> configuration)\n\t{\n\t\tif (!(static_cast<RuntimeType*>(this)->isConfigurated()))\n\t\t{\n\t\t\tstatic_cast<RuntimeType*>(this)->setConfiguration(configuration);\n\t\t}\n\n\t}\n\n\t\/*!\n\tStarts the model execution.\n\t*\/\n\tvoid startRT()\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->start();\n\t}\n\n\n\t\/*!\n\tStops the runtime instance when there are no more messages to process and under processing.\n\t*\/\n\tvoid stopUponCompletion()\n\t{\n\t\tstatic_cast<RuntimeType*>(this)->stopUponCompletion();\n\t}\n\n\nprotected:\n\tIRuntime () {}\n\nprivate:\n\tstatic void initRuntime ()\n\t{\n\t\tinstance = RuntimeType::createRuntime ();\n\n\t}\n\tstatic ES::RuntimePtr<RuntimeType, NC> instance;\n\tstatic std::once_flag\t\t\t\t runtimeInstanceInitFlag;\n};\n\ntemplate<int NC>\nclass SingleThreadRT : public IRuntime<SingleThreadRT<NC>, NC>\n{\npublic:\n\tvirtual ~SingleThreadRT();\n\n\t\/*!\n\tProcesses the events while the message queue is not empty.\n\t*\/\n\tvoid start();\n\n\tvoid setupObjectSpecificRuntime(ES::StateMachineRef);\n\tvoid removeObject(ES::StateMachineRef);\n\tvoid setConfiguration(std::array<ES::SharedPtr<Configuration>,NC>);\n\tbool isConfigurated();\n\tvoid stopUponCompletion();\n\tstatic ES::RuntimePtr<SingleThreadRT, NC> createRuntime () { return ES::RuntimePtr<SingleThreadRT<NC>, NC> (new SingleThreadRT<NC> ()); }\nprivate:\n\tSingleThreadRT ();\n\tES::SharedPtr<ES::MessageQueueType> _messageQueue;\n\n};\n\ntemplate<int NC>\nclass ConfiguredThreadedRT : public IRuntime<ConfiguredThreadedRT<NC>,NC>\n{\n\ttypedef typename std::array<unsigned, NC>::size_type id_type;\npublic:\n\tvirtual ~ConfiguredThreadedRT();\n\t\/*!\n\tStarts the thread pools.\n\t*\/\n\tvoid start();\n\n\tvoid setupObjectSpecificRuntime(ES::StateMachineRef);\n\tvoid removeObject(ES::StateMachineRef);\n\tvoid setConfiguration(std::array<ES::SharedPtr<Configuration>, NC>);\n\tbool isConfigurated();\n\tvoid stopUponCompletion();\n\tstatic ES::RuntimePtr<ConfiguredThreadedRT, NC> createRuntime () { return ES::RuntimePtr<ConfiguredThreadedRT<NC>, NC> (new ConfiguredThreadedRT<NC> ()); }\nprivate:\n\tConfiguredThreadedRT ();\n\tES::SharedPtr<ThreadPoolManager<NC>> poolManager;\n\tstd::array<unsigned, NC> numberOfObjects;\n\n\tES::SharedPtr<ES::AtomicCounter> worker;\n\tES::SharedPtr<ES::AtomicCounter> messages;\n\tstd::condition_variable stop_request_cond;\n};\n\n\n\n\ntemplate<typename RuntimeType, int NC>\nES::RuntimePtr<RuntimeType,NC> IRuntime<RuntimeType, NC>::instance = nullptr;\ntemplate<typename RuntimeType, int NC>\nstd::once_flag\t\t\t\t IRuntime<RuntimeType, NC>::runtimeInstanceInitFlag;\n\n\/\/ SingleThreadRT\ntemplate<int NC>\nSingleThreadRT<NC>::SingleThreadRT() :_messageQueue(new ES::MessageQueueType()) {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::setupObjectSpecificRuntime(ES::StateMachineRef sm)\n{\n\tsm->setMessageQueue(_messageQueue);\n\tsm->setMessageCounter(ES::SharedPtr<ES::AtomicCounter>(new ES::AtomicCounter()));\n}\n\ntemplate<int NC>\nSingleThreadRT<NC>::~SingleThreadRT()\n{\n}\n\ntemplate<int NC>\nbool SingleThreadRT<NC>::isConfigurated()\n{\n\treturn true;\n}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::start()\n{\n\n\twhile (!_messageQueue->isEmpty())\n\t{\n\t\tES::EventRef e = _messageQueue->next();\n\t\tif (Model::IEvent<Model::EventBase>::eventIsValid(e)) {\n\t\t\tconst ES::StateMachineRef sm = e->getTargetSM();\n\t\t\tsm->processNextEvent();\n\t\t}\n\t\telse {\n\t\t\t_messageQueue->dequeue(e); \/\/ drop event\n\t\t}\n\n\n\t}\n\n}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::setConfiguration(std::array<ES::SharedPtr<Configuration>, NC>) {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::stopUponCompletion() {}\n\ntemplate<int NC>\nvoid SingleThreadRT<NC>::removeObject(ES::StateMachineRef) {}\n\n\/\/ ConfiguredThreadedRT\ntemplate<int NC>\nConfiguredThreadedRT<NC>::ConfiguredThreadedRT () :\n\tpoolManager (new ThreadPoolManager<NC> ()),\n\tworker (new ES::AtomicCounter ()),\n\tmessages (new ES::AtomicCounter ()) {}\n\ntemplate<int NC>\nConfiguredThreadedRT<NC>::~ConfiguredThreadedRT () {}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::start ()\n{\n\tassert (isConfigurated () && \"The configurated threaded runtime should be configured before starting.\");\n\n\tif (isConfigurated ())\n\t{\n\t\tfor (id_type i = 0; i < (id_type)NC; i++)\n\t\t{\n\t\t\tES::SharedPtr<StateMachineThreadPool> pool = poolManager->getPool (i);\n\t\t\tpool->setWorkersCounter (worker);\n\t\t\tpool->setMessageCounter (messages);\n\t\t\tpool->setStopReqest (&stop_request_cond);\n\t\t\tpool->startPool (poolManager->calculateNOfThreads (i,numberOfObjects[i]));\n\t\t}\n\t}\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::removeObject (ES::StateMachineRef sm)\n{\n\tid_type objectId = (id_type) sm->getPoolId ();\n\tnumberOfObjects[objectId]--;\n\tpoolManager->recalculateThreads (objectId, numberOfObjects[objectId]);\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::stopUponCompletion ()\n{\n\tfor (int i = 0; i < NC; i++)\n\t{\n\t\tpoolManager->getPool ((id_type)i)->stopUponCompletion ();\n\t}\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::setupObjectSpecificRuntime (ES::StateMachineRef sm)\n{\n\n\tsm->setMessageCounter (messages);\n\tid_type objectId = (id_type)sm->getPoolId ();\n\tES::SharedPtr<StateMachineThreadPool> matchedPool = poolManager->getPool (objectId);\n\tsm->setPool (matchedPool);\n\tnumberOfObjects[objectId]++;\n\tpoolManager->recalculateThreads (objectId, numberOfObjects[objectId]);\n}\n\ntemplate<int NC>\nbool ConfiguredThreadedRT<NC>::isConfigurated ()\n{\n\treturn poolManager->isConfigurated ();\n}\n\ntemplate<int NC>\nvoid ConfiguredThreadedRT<NC>::setConfiguration (std::array<ES::SharedPtr<Configuration>, NC> conf)\n{\n\tpoolManager->setConfiguration (conf);\n\tfor (id_type i = 0; i < numberOfObjects.size (); ++i) {\n\t\tnumberOfObjects[i] = 0;\n\t}\n}\n\n}\n\n\n#endif \/\/ RUNTIME_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Michael X. Grey <mxgrey@gatech.edu>\n *\n * Georgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n * CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"dart\/dynamics\/Chain.h\"\n#include \"dart\/dynamics\/FreeJoint.h\"\n\nnamespace dart {\nnamespace dynamics {\n\n\/\/==============================================================================\nChain::Criteria::Criteria(BodyNode* _start, BodyNode* _target)\n : mStart(_start),\n mTarget(_target)\n{\n \/\/ Do nothing\n}\n\n\/\/==============================================================================\nstd::vector<BodyNode*> Chain::Criteria::satisfy() const\n{\n return convert().satisfy();\n}\n\n\/\/==============================================================================\nLinkage::Criteria Chain::Criteria::convert() const\n{\n Linkage::Criteria criteria;\n criteria.mStart.mNode = mStart;\n criteria.mTargets.push_back(\n Linkage::Criteria::Target(mTarget.lock(),\n Linkage::Criteria::NEUTRAL, true));\n\n return criteria;\n}\n\n\/\/==============================================================================\nChain::Criteria::operator Linkage::Criteria() const\n{\n return convert();\n}\n\n\/\/==============================================================================\nChainPtr Chain::create(const Chain::Criteria& _criteria,\n const std::string& _name)\n{\n ChainPtr chain = Chain::create(_criteria, _name);\n chain->mPtr = chain;\n return chain;\n}\n\n\/\/==============================================================================\nChainPtr Chain::create(BodyNode* _start, BodyNode* _target,\n const std::string& _name)\n{\n ChainPtr chain = Chain::create(_start, _target, _name);\n chain->mPtr = chain;\n return chain;\n}\n\n\/\/==============================================================================\nbool Chain::isStillChain() const\n{\n if(!isAssembled())\n return false;\n\n \/\/ Make sure there are no Branches and no parent FreeJoints on the BodyNodes\n \/\/ on the inside of the chain\n for(size_t i=1; i<mBodyNodes.size()-1; ++i)\n {\n if(mBodyNodes[i]->getNumChildBodyNodes() > 1)\n return false;\n\n if(dynamic_cast<FreeJoint*>(mBodyNodes[i]->getParentJoint()))\n return false;\n }\n\n \/\/ Make sure there is not a FreeJoint at the final BodyNode (which was not\n \/\/ tested above)\n if(mBodyNodes.size() > 1)\n {\n if(dynamic_cast<FreeJoint*>(mBodyNodes.back()->getParentJoint()))\n return false;\n }\n\n return true;\n}\n\n\/\/==============================================================================\nChain::Chain(const Chain::Criteria& _criteria, const std::string& _name)\n : Linkage(_criteria, _name)\n{\n \/\/ Do nothing\n}\n\n\/\/==============================================================================\nChain::Chain(BodyNode* _start, BodyNode* _target, const std::string& _name)\n : Linkage(Chain::Criteria(_start, _target), _name)\n{\n \/\/ Do nothing\n}\n\n} \/\/ namespace dynamics\n} \/\/ namespace dart\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>fixed silly Chain::create bug<commit_after>\/*\n * Copyright (c) 2015, Georgia Tech Research Corporation\n * All rights reserved.\n *\n * Author(s): Michael X. Grey <mxgrey@gatech.edu>\n *\n * Georgia Tech Graphics Lab and Humanoid Robotics Lab\n *\n * Directed by Prof. C. Karen Liu and Prof. Mike Stilman\n * <karenliu@cc.gatech.edu> <mstilman@cc.gatech.edu>\n *\n * This file is provided under the following \"BSD-style\" License:\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND\n * CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR\n * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"dart\/dynamics\/Chain.h\"\n#include \"dart\/dynamics\/FreeJoint.h\"\n\nnamespace dart {\nnamespace dynamics {\n\n\/\/==============================================================================\nChain::Criteria::Criteria(BodyNode* _start, BodyNode* _target)\n : mStart(_start),\n mTarget(_target)\n{\n \/\/ Do nothing\n}\n\n\/\/==============================================================================\nstd::vector<BodyNode*> Chain::Criteria::satisfy() const\n{\n return convert().satisfy();\n}\n\n\/\/==============================================================================\nLinkage::Criteria Chain::Criteria::convert() const\n{\n Linkage::Criteria criteria;\n criteria.mStart.mNode = mStart;\n criteria.mTargets.push_back(\n Linkage::Criteria::Target(mTarget.lock(),\n Linkage::Criteria::NEUTRAL, true));\n\n return criteria;\n}\n\n\/\/==============================================================================\nChain::Criteria::operator Linkage::Criteria() const\n{\n return convert();\n}\n\n\/\/==============================================================================\nChainPtr Chain::create(const Chain::Criteria& _criteria,\n const std::string& _name)\n{\n ChainPtr chain(new Chain(_criteria, _name));\n chain->mPtr = chain;\n return chain;\n}\n\n\/\/==============================================================================\nChainPtr Chain::create(BodyNode* _start, BodyNode* _target,\n const std::string& _name)\n{\n ChainPtr chain(new Chain(_start, _target, _name));\n chain->mPtr = chain;\n return chain;\n}\n\n\/\/==============================================================================\nbool Chain::isStillChain() const\n{\n if(!isAssembled())\n return false;\n\n \/\/ Make sure there are no Branches and no parent FreeJoints on the BodyNodes\n \/\/ on the inside of the chain\n for(size_t i=1; i<mBodyNodes.size()-1; ++i)\n {\n if(mBodyNodes[i]->getNumChildBodyNodes() > 1)\n return false;\n\n if(dynamic_cast<FreeJoint*>(mBodyNodes[i]->getParentJoint()))\n return false;\n }\n\n \/\/ Make sure there is not a FreeJoint at the final BodyNode (which was not\n \/\/ tested above)\n if(mBodyNodes.size() > 1)\n {\n if(dynamic_cast<FreeJoint*>(mBodyNodes.back()->getParentJoint()))\n return false;\n }\n\n return true;\n}\n\n\/\/==============================================================================\nChain::Chain(const Chain::Criteria& _criteria, const std::string& _name)\n : Linkage(_criteria, _name)\n{\n \/\/ Do nothing\n}\n\n\/\/==============================================================================\nChain::Chain(BodyNode* _start, BodyNode* _target, const std::string& _name)\n : Linkage(Chain::Criteria(_start, _target), _name)\n{\n \/\/ Do nothing\n}\n\n} \/\/ namespace dynamics\n} \/\/ namespace dart\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"MyView.hpp\"\n\n\n\/\/ STL headers.\n#include <algorithm>\n#include <iostream>\n#include <vector>\n\n\n\/\/ Engine headers.\n#include <tygra\/FileHelper.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <Terrain\/HeightMap.hpp>\n\n\n\/\/ Constants.\nconst int kVertexPosition { 0 },\n kVertexNormal { 1 };\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructors and destructor \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMyView::MyView (MyView&& move)\n{\n *this = std::move (move);\n}\n\n\nMyView& MyView::operator= (MyView&& move)\n{\n if (this != &move)\n {\n \/\/ TODO: Write the move constructor.\n }\n\n return *this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Initialisation \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewWillStart (std::shared_ptr<tygra::Window> window)\n{\n \/\/ Let the framework do it's business, it isn't relevant to us.\n frameworkLoading();\n\n \/\/ Generate the terrain.\n terrainLoading();\n}\n\n\nvoid MyView::frameworkLoading()\n{\n GLint compile_status = 0;\n GLint link_status = 0; \n GLuint vertex_shader = glCreateShader(GL_VERTEX_SHADER);\n std::string vertex_shader_string = tygra::stringFromFile(\"terrain_vs.glsl\");\n const char *vertex_shader_code = vertex_shader_string.c_str();\n glShaderSource(vertex_shader, 1,\n (const GLchar **) &vertex_shader_code, NULL);\n glCompileShader(vertex_shader);\n glGetShaderiv(vertex_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetShaderInfoLog(vertex_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n } \n GLuint fragment_shader = glCreateShader(GL_FRAGMENT_SHADER);\n std::string fragment_shader_string = tygra::stringFromFile(\"terrain_fs.glsl\");\n const char *fragment_shader_code = fragment_shader_string.c_str();\n glShaderSource(fragment_shader, 1,\n (const GLchar **) &fragment_shader_code, NULL);\n glCompileShader(fragment_shader);\n glGetShaderiv(fragment_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetShaderInfoLog(fragment_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n m_terrainShader = glCreateProgram();\n glAttachShader(m_terrainShader, vertex_shader);\n glDeleteShader(vertex_shader);\n glAttachShader(m_terrainShader, fragment_shader);\n glDeleteShader(fragment_shader);\n glLinkProgram(m_terrainShader);\n glGetProgramiv(m_terrainShader, GL_LINK_STATUS, &link_status);\n if (link_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetProgramInfoLog(m_terrainShader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n vertex_shader = glCreateShader(GL_VERTEX_SHADER);\n vertex_shader_string = tygra::stringFromFile(\"shapes_vs.glsl\");\n vertex_shader_code = vertex_shader_string.c_str();\n glShaderSource(vertex_shader, 1,\n (const GLchar **)&vertex_shader_code, NULL);\n glCompileShader(vertex_shader);\n glGetShaderiv(vertex_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetShaderInfoLog(vertex_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n fragment_shader = glCreateShader(GL_FRAGMENT_SHADER);\n fragment_shader_string = tygra::stringFromFile(\"shapes_fs.glsl\");\n fragment_shader_code = fragment_shader_string.c_str();\n glShaderSource(fragment_shader, 1,\n (const GLchar **)&fragment_shader_code, NULL);\n glCompileShader(fragment_shader);\n glGetShaderiv(fragment_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetShaderInfoLog(fragment_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n m_shapesShader = glCreateProgram();\n glAttachShader(m_shapesShader, vertex_shader);\n glDeleteShader(vertex_shader);\n glAttachShader(m_shapesShader, fragment_shader);\n glDeleteShader(fragment_shader);\n glLinkProgram(m_shapesShader);\n glGetProgramiv(m_shapesShader, GL_LINK_STATUS, &link_status);\n if (link_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetProgramInfoLog(m_terrainShader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n glGenVertexArrays(1, &m_cubeVAO);\n glBindVertexArray(m_cubeVAO);\n glGenBuffers(1, &m_cubeVBO);\n glBindBuffer(GL_ARRAY_BUFFER, m_cubeVBO);\n float cube_vertices[] = {\n -0.5f, 0.f, -0.5f, 0.5f, 0.f, -0.5f, 0.5f, 0.f, 0.5f,\n -0.5f, 0.f, -0.5f, 0.5f, 0.f, 0.5f, -0.5f, 0.f, 0.5f,\n -0.5f, 0.f, 0.5f, 0.5f, 0.f, 0.5f, 0.5f, 1.f, 0.5f,\n -0.5f, 0.f, 0.5f, 0.5f, 1.f, 0.5f, -0.5f, 1.f, 0.5f,\n 0.5f, 0.f, 0.5f, 0.5f, 0.f, -0.5f, 0.5f, 1.f, -0.5f,\n 0.5f, 0.f, 0.5f, 0.5f, 1.f, -0.5f, 0.5f, 1.f, 0.5f,\n 0.5f, 0.f, -0.5f, -0.5f, 0.f, -0.5f, -0.5f, 1.f, -0.5f,\n 0.5f, 0.f, -0.5f, -0.5f, 1.f, -0.5f, 0.5f, 1.f, -0.5f,\n -0.5f, 0.f, -0.5f, -0.5f, 0.f, 0.5f, -0.5f, 1.f, 0.5f,\n -0.5f, 0.f, -0.5f, -0.5f, 1.f, 0.5f, -0.5f, 1.f, -0.5f,\n -0.5f, 1.f, 0.5f, 0.5f, 1.f, 0.5f, 0.5f, 1.f, -0.5f,\n -0.5f, 1.f, 0.5f, 0.5f, 1.f, -0.5f, -0.5f, 1.f, -0.5f,\n };\n glBufferData(GL_ARRAY_BUFFER, sizeof(cube_vertices),\n cube_vertices, GL_STATIC_DRAW);\n glEnableVertexAttribArray(kVertexPosition);\n glVertexAttribPointer(kVertexPosition, 3, GL_FLOAT, GL_FALSE,\n sizeof(glm::vec3), TGL_BUFFER_OFFSET(0));\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n glBindVertexArray(0);\n}\n\n\nvoid MyView::terrainLoading()\n{\n \/\/ Obtain the terrain properties from the scene information and generate the terrain.\n const auto& file = m_scene->getTerrainHeightMapName();\n \n const auto width = m_scene->getTerrainSizeX(),\n height = m_scene->getTerrainSizeY(), \n depth = -m_scene->getTerrainSizeZ();\n\n \/\/ Construct the terrain scalar to get the correct visual output.\n const auto scale = glm::vec3 (width, height, depth);\n \/\/const auto scale = glm::vec3 (256.f, 20.f, -256.f);\n\n \/\/ Load the height map with the desired values.\n const HeightMap heightMap { file, scale };\n\n \/\/ Build the terrain and get it ready for rendering.\n m_terrain.setDivisor (256);\n m_terrain.buildFromHeightMap (heightMap, 4096, 4096);\n m_terrain.prepareForRender (m_terrainShader);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Clean up \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewDidStop (std::shared_ptr<tygra::Window> window)\n{\n glDeleteProgram (m_terrainShader);\n glDeleteProgram (m_shapesShader);\n\n glDeleteBuffers (1, &m_cubeVBO);\n glDeleteVertexArrays (1, &m_cubeVAO);\n\n m_terrain.cleanUp();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Rendering \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewDidReset (std::shared_ptr<tygra::Window> window, int width, int height)\n{\n glViewport(0, 0, width, height);\n}\n\n\nvoid MyView::windowViewRender (std::shared_ptr<tygra::Window> window)\n{\n \/\/ Framework crap, not allowed to touch.\n GLint viewport[4];\n glGetIntegerv(GL_VIEWPORT, viewport);\n const float aspect_ratio = viewport[2] \/ (float)viewport[3];\n const auto& camera = m_scene->getCamera();\n glm::mat4 projection_xform = glm::perspective(camera.getVerticalFieldOfViewInDegrees(),\n aspect_ratio,\n camera.getNearPlaneDistance(),\n camera.getFarPlaneDistance());\n glm::vec3 camera_pos = camera.getPosition();\n glm::vec3 camera_at = camera.getPosition() + camera.getDirection();\n glm::vec3 world_up{ 0, 1, 0 };\n glm::mat4 view_xform = glm::lookAt(camera_pos, camera_at, world_up);\n\n\n \/\/ Personal crap, I can touch this as much as I want *wink* *wink*.\n glClearColor(0.f, 0.f, 0.25f, 0.f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\n glEnable(GL_DEPTH_TEST);\n glEnable(GL_CULL_FACE);\n glPolygonMode(GL_FRONT_AND_BACK, m_shadeNormals ? GL_FILL : GL_LINE);\n\n glUseProgram(m_terrainShader);\n\n GLuint shading_id = glGetUniformLocation(m_terrainShader, \"use_normal\");\n glUniform1i(shading_id, m_shadeNormals);\n\n glm::mat4 world_xform = glm::mat4(1);\n glm::mat4 view_world_xform = view_xform * world_xform;\n\n GLuint projection_xform_id = glGetUniformLocation(m_terrainShader,\n \"projection_xform\");\n glUniformMatrix4fv(projection_xform_id, 1, GL_FALSE,\n glm::value_ptr(projection_xform));\n\n GLuint view_world_xform_id = glGetUniformLocation(m_terrainShader,\n \"view_world_xform\");\n glUniformMatrix4fv(view_world_xform_id, 1, GL_FALSE,\n glm::value_ptr(view_world_xform));\n\n m_terrain.draw();\n \/\/glBindVertexArray(m_terrainMesh.vao);\n \/\/glDrawElements(GL_TRIANGLES, m_terrainMesh.element_count, GL_UNSIGNED_INT, 0);\n\n\n glEnable(GL_DEPTH_TEST);\n glEnable(GL_CULL_FACE);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n glUseProgram(m_shapesShader);\n\n projection_xform_id = glGetUniformLocation(m_shapesShader,\n \"projection_xform\");\n glUniformMatrix4fv(projection_xform_id, 1, GL_FALSE,\n glm::value_ptr(projection_xform));\n\n glBindVertexArray(m_cubeVAO);\n\n for (const auto& pos : m_scene->getAllShapePositions())\n {\n world_xform = glm::translate(glm::mat4(1), glm::vec3(pos.x, 64, -pos.y));\n view_world_xform = view_xform * world_xform;\n\n view_world_xform_id = glGetUniformLocation(m_shapesShader,\n \"view_world_xform\");\n glUniformMatrix4fv(view_world_xform_id, 1, GL_FALSE,\n glm::value_ptr(view_world_xform));\n\n glDrawArrays(GL_TRIANGLES, 0, 36);\n }\n}<commit_msg>Made it easier to change the scale and maintain the same noise.<commit_after>#include \"MyView.hpp\"\n\n\n\/\/ STL headers.\n#include <algorithm>\n#include <iostream>\n#include <vector>\n\n\n\/\/ Engine headers.\n#include <tygra\/FileHelper.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <Terrain\/HeightMap.hpp>\n\n\n\/\/ Constants.\nconst int kVertexPosition { 0 },\n kVertexNormal { 1 };\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Constructors and destructor \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nMyView::MyView (MyView&& move)\n{\n *this = std::move (move);\n}\n\n\nMyView& MyView::operator= (MyView&& move)\n{\n if (this != &move)\n {\n \/\/ TODO: Write the move constructor.\n }\n\n return *this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Initialisation \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewWillStart (std::shared_ptr<tygra::Window> window)\n{\n \/\/ Let the framework do it's business, it isn't relevant to us.\n frameworkLoading();\n\n \/\/ Generate the terrain.\n terrainLoading();\n}\n\n\nvoid MyView::frameworkLoading()\n{\n GLint compile_status = 0;\n GLint link_status = 0; \n GLuint vertex_shader = glCreateShader(GL_VERTEX_SHADER);\n std::string vertex_shader_string = tygra::stringFromFile(\"terrain_vs.glsl\");\n const char *vertex_shader_code = vertex_shader_string.c_str();\n glShaderSource(vertex_shader, 1,\n (const GLchar **) &vertex_shader_code, NULL);\n glCompileShader(vertex_shader);\n glGetShaderiv(vertex_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetShaderInfoLog(vertex_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n } \n GLuint fragment_shader = glCreateShader(GL_FRAGMENT_SHADER);\n std::string fragment_shader_string = tygra::stringFromFile(\"terrain_fs.glsl\");\n const char *fragment_shader_code = fragment_shader_string.c_str();\n glShaderSource(fragment_shader, 1,\n (const GLchar **) &fragment_shader_code, NULL);\n glCompileShader(fragment_shader);\n glGetShaderiv(fragment_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetShaderInfoLog(fragment_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n m_terrainShader = glCreateProgram();\n glAttachShader(m_terrainShader, vertex_shader);\n glDeleteShader(vertex_shader);\n glAttachShader(m_terrainShader, fragment_shader);\n glDeleteShader(fragment_shader);\n glLinkProgram(m_terrainShader);\n glGetProgramiv(m_terrainShader, GL_LINK_STATUS, &link_status);\n if (link_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length]= \"\";\n glGetProgramInfoLog(m_terrainShader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n vertex_shader = glCreateShader(GL_VERTEX_SHADER);\n vertex_shader_string = tygra::stringFromFile(\"shapes_vs.glsl\");\n vertex_shader_code = vertex_shader_string.c_str();\n glShaderSource(vertex_shader, 1,\n (const GLchar **)&vertex_shader_code, NULL);\n glCompileShader(vertex_shader);\n glGetShaderiv(vertex_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetShaderInfoLog(vertex_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n fragment_shader = glCreateShader(GL_FRAGMENT_SHADER);\n fragment_shader_string = tygra::stringFromFile(\"shapes_fs.glsl\");\n fragment_shader_code = fragment_shader_string.c_str();\n glShaderSource(fragment_shader, 1,\n (const GLchar **)&fragment_shader_code, NULL);\n glCompileShader(fragment_shader);\n glGetShaderiv(fragment_shader, GL_COMPILE_STATUS, &compile_status);\n if (compile_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetShaderInfoLog(fragment_shader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n m_shapesShader = glCreateProgram();\n glAttachShader(m_shapesShader, vertex_shader);\n glDeleteShader(vertex_shader);\n glAttachShader(m_shapesShader, fragment_shader);\n glDeleteShader(fragment_shader);\n glLinkProgram(m_shapesShader);\n glGetProgramiv(m_shapesShader, GL_LINK_STATUS, &link_status);\n if (link_status != GL_TRUE) {\n const int string_length = 1024;\n GLchar log[string_length] = \"\";\n glGetProgramInfoLog(m_terrainShader, string_length, NULL, log);\n std::cerr << log << std::endl;\n }\n glGenVertexArrays(1, &m_cubeVAO);\n glBindVertexArray(m_cubeVAO);\n glGenBuffers(1, &m_cubeVBO);\n glBindBuffer(GL_ARRAY_BUFFER, m_cubeVBO);\n float cube_vertices[] = {\n -0.5f, 0.f, -0.5f, 0.5f, 0.f, -0.5f, 0.5f, 0.f, 0.5f,\n -0.5f, 0.f, -0.5f, 0.5f, 0.f, 0.5f, -0.5f, 0.f, 0.5f,\n -0.5f, 0.f, 0.5f, 0.5f, 0.f, 0.5f, 0.5f, 1.f, 0.5f,\n -0.5f, 0.f, 0.5f, 0.5f, 1.f, 0.5f, -0.5f, 1.f, 0.5f,\n 0.5f, 0.f, 0.5f, 0.5f, 0.f, -0.5f, 0.5f, 1.f, -0.5f,\n 0.5f, 0.f, 0.5f, 0.5f, 1.f, -0.5f, 0.5f, 1.f, 0.5f,\n 0.5f, 0.f, -0.5f, -0.5f, 0.f, -0.5f, -0.5f, 1.f, -0.5f,\n 0.5f, 0.f, -0.5f, -0.5f, 1.f, -0.5f, 0.5f, 1.f, -0.5f,\n -0.5f, 0.f, -0.5f, -0.5f, 0.f, 0.5f, -0.5f, 1.f, 0.5f,\n -0.5f, 0.f, -0.5f, -0.5f, 1.f, 0.5f, -0.5f, 1.f, -0.5f,\n -0.5f, 1.f, 0.5f, 0.5f, 1.f, 0.5f, 0.5f, 1.f, -0.5f,\n -0.5f, 1.f, 0.5f, 0.5f, 1.f, -0.5f, -0.5f, 1.f, -0.5f,\n };\n glBufferData(GL_ARRAY_BUFFER, sizeof(cube_vertices),\n cube_vertices, GL_STATIC_DRAW);\n glEnableVertexAttribArray(kVertexPosition);\n glVertexAttribPointer(kVertexPosition, 3, GL_FLOAT, GL_FALSE,\n sizeof(glm::vec3), TGL_BUFFER_OFFSET(0));\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n glBindVertexArray(0);\n}\n\n\nvoid MyView::terrainLoading()\n{\n \/\/ Obtain the terrain properties from the scene information and generate the terrain.\n const auto& file = m_scene->getTerrainHeightMapName();\n \n const auto width = m_scene->getTerrainSizeX(),\n height = m_scene->getTerrainSizeY(), \n depth = -m_scene->getTerrainSizeZ();\n\n const auto shrink = 8U;\n\n \/\/ Construct the terrain scalar to get the correct visual output.\n const auto scale = glm::vec3 (width, height, depth);\n\n \/\/ Load the height map with the desired values.\n const HeightMap heightMap { file, scale \/ (float) shrink };\n\n \/\/ Build the terrain and get it ready for rendering.\n m_terrain.setDivisor (256);\n m_terrain.buildFromHeightMap (heightMap, 8192U \/ shrink, 8192U \/ shrink);\n m_terrain.prepareForRender (m_terrainShader);\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Clean up \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewDidStop (std::shared_ptr<tygra::Window> window)\n{\n glDeleteProgram (m_terrainShader);\n glDeleteProgram (m_shapesShader);\n\n glDeleteBuffers (1, &m_cubeVBO);\n glDeleteVertexArrays (1, &m_cubeVAO);\n\n m_terrain.cleanUp();\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Rendering \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid MyView::windowViewDidReset (std::shared_ptr<tygra::Window> window, int width, int height)\n{\n glViewport(0, 0, width, height);\n}\n\n\nvoid MyView::windowViewRender (std::shared_ptr<tygra::Window> window)\n{\n \/\/ Framework crap, not allowed to touch.\n GLint viewport[4];\n glGetIntegerv(GL_VIEWPORT, viewport);\n const float aspect_ratio = viewport[2] \/ (float)viewport[3];\n const auto& camera = m_scene->getCamera();\n glm::mat4 projection_xform = glm::perspective(camera.getVerticalFieldOfViewInDegrees(),\n aspect_ratio,\n camera.getNearPlaneDistance(),\n camera.getFarPlaneDistance());\n glm::vec3 camera_pos = camera.getPosition();\n glm::vec3 camera_at = camera.getPosition() + camera.getDirection();\n glm::vec3 world_up{ 0, 1, 0 };\n glm::mat4 view_xform = glm::lookAt(camera_pos, camera_at, world_up);\n\n\n \/\/ Personal crap, I can touch this as much as I want *wink* *wink*.\n glClearColor(0.f, 0.f, 0.25f, 0.f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n\n glEnable(GL_DEPTH_TEST);\n glEnable(GL_CULL_FACE);\n glPolygonMode(GL_FRONT_AND_BACK, m_shadeNormals ? GL_FILL : GL_LINE);\n\n glUseProgram(m_terrainShader);\n\n GLuint shading_id = glGetUniformLocation(m_terrainShader, \"use_normal\");\n glUniform1i(shading_id, m_shadeNormals);\n\n glm::mat4 world_xform = glm::mat4(1);\n glm::mat4 view_world_xform = view_xform * world_xform;\n\n GLuint projection_xform_id = glGetUniformLocation(m_terrainShader,\n \"projection_xform\");\n glUniformMatrix4fv(projection_xform_id, 1, GL_FALSE,\n glm::value_ptr(projection_xform));\n\n GLuint view_world_xform_id = glGetUniformLocation(m_terrainShader,\n \"view_world_xform\");\n glUniformMatrix4fv(view_world_xform_id, 1, GL_FALSE,\n glm::value_ptr(view_world_xform));\n\n m_terrain.draw();\n \/\/glBindVertexArray(m_terrainMesh.vao);\n \/\/glDrawElements(GL_TRIANGLES, m_terrainMesh.element_count, GL_UNSIGNED_INT, 0);\n\n\n glEnable(GL_DEPTH_TEST);\n glEnable(GL_CULL_FACE);\n glPolygonMode(GL_FRONT_AND_BACK, GL_FILL);\n\n glUseProgram(m_shapesShader);\n\n projection_xform_id = glGetUniformLocation(m_shapesShader,\n \"projection_xform\");\n glUniformMatrix4fv(projection_xform_id, 1, GL_FALSE,\n glm::value_ptr(projection_xform));\n\n glBindVertexArray(m_cubeVAO);\n\n for (const auto& pos : m_scene->getAllShapePositions())\n {\n world_xform = glm::translate(glm::mat4(1), glm::vec3(pos.x, 64, -pos.y));\n view_world_xform = view_xform * world_xform;\n\n view_world_xform_id = glGetUniformLocation(m_shapesShader,\n \"view_world_xform\");\n glUniformMatrix4fv(view_world_xform_id, 1, GL_FALSE,\n glm::value_ptr(view_world_xform));\n\n glDrawArrays(GL_TRIANGLES, 0, 36);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009, 2010 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <esnpapi.h>\n#include <org\/w3c\/dom.h>\n\n#include <assert.h>\n\nstd::map<const std::string, Object* (*)(ProxyObject object)> ProxyControl::proxyConstructorMap;\n\nProxyControl::ProxyControl(NPP npp) :\n npp(npp),\n nestingCount(1)\n{\n}\n\nProxyControl::~ProxyControl()\n{\n \/\/ TODO: Release objects in newList and oldList\n}\n\nObject* ProxyControl::createProxy(NPObject* object, const Reflect::Type type)\n{\n if (!object)\n {\n return 0;\n }\n\n std::string className = getInterfaceName(npp, object);\n if (className == \"Object\")\n {\n \/\/ TODO: We should define 'Object' interface\n return 0;\n }\n\n bool usedHint = false;\n for (;;)\n {\n std::map<const std::string, Object* (*)(ProxyObject object)>::iterator it;\n it = proxyConstructorMap.find(className);\n if (it != proxyConstructorMap.end())\n {\n ProxyObject browserObject(object, npp);\n if (Object* object = (*it).second(browserObject))\n {\n return track(object);\n }\n }\n if (!type.isObject() || usedHint)\n {\n break;\n }\n className = type.getQualifiedName();\n size_t pos = className.rfind(':');\n if (pos != std::string::npos)\n {\n className = className.substr(pos + 1);\n printf(\"%s: use the class name '%s' as hinted.\\n\", __func__, className.c_str());\n }\n usedHint = true;\n }\n return 0;\n}\n\nlong ProxyControl::enter()\n{\n return ++nestingCount;\n}\n\nlong ProxyControl::leave()\n{\n --nestingCount;\n assert(0 <= nestingCount);\n if (nestingCount == 0)\n {\n while (!newList.empty())\n {\n Object* object = newList.front();\n newList.pop_front();\n if (0 < object->release())\n {\n oldList.push_back(object);\n }\n }\n }\n return nestingCount;\n}\n\nvoid ProxyControl::registerMetaData(const char* meta, Object* (*createProxy)(ProxyObject object), const char* alias)\n{\n Reflect::Interface interface(meta);\n std::string name = interface.getName();\n if (alias)\n {\n name = alias;\n }\n proxyConstructorMap[name] = createProxy;\n printf(\"%s\\n\", name.c_str());\n}\n\nProxyObject::ProxyObject(NPObject* object, NPP npp) :\n object(object),\n npp(npp),\n count(0)\n{\n}\n\nProxyObject::ProxyObject(const ProxyObject& original) :\n object(original.object),\n npp(original.npp),\n count(original.count)\n{\n}\n\nProxyObject::~ProxyObject()\n{\n \/\/ TODO: Remove this from newList or oldList is it is still included\n}\n\nunsigned int ProxyObject::retain()\n{\n NPN_RetainObject(object);\n return ++count;\n}\n\nunsigned int ProxyObject::release()\n{\n if (0 < count)\n {\n NPN_ReleaseObject(object);\n --count;\n }\n if (count == 0)\n {\n delete this;\n return 0;\n }\n return count;\n}\n\nunsigned int ProxyObject::mark()\n{\n return ++count;\n}\n\nPluginInstance::PluginInstance(NPP npp, NPObject* window) :\n proxyControl(npp),\n stubControl(npp),\n window(0)\n{\n npp->pdata = this;\n this->window = interface_cast<org::w3c::dom::html::Window*>(proxyControl.createProxy(window, Reflect::Type(\"O14::html::Window\")));\n if (this->window)\n {\n ProxyObject* proxy = interface_cast<ProxyObject*>(this->window);\n proxy->mark();\n proxy->retain();\n }\n}\n\nPluginInstance::~PluginInstance()\n{\n if (window)\n {\n window->release();\n }\n}\n\n<commit_msg>(~ProxyObject) : Fix a typo.<commit_after>\/*\n * Copyright 2009, 2010 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <esnpapi.h>\n#include <org\/w3c\/dom.h>\n\n#include <assert.h>\n\nstd::map<const std::string, Object* (*)(ProxyObject object)> ProxyControl::proxyConstructorMap;\n\nProxyControl::ProxyControl(NPP npp) :\n npp(npp),\n nestingCount(1)\n{\n}\n\nProxyControl::~ProxyControl()\n{\n \/\/ TODO: Release objects in newList and oldList\n}\n\nObject* ProxyControl::createProxy(NPObject* object, const Reflect::Type type)\n{\n if (!object)\n {\n return 0;\n }\n\n std::string className = getInterfaceName(npp, object);\n if (className == \"Object\")\n {\n \/\/ TODO: We should define 'Object' interface\n return 0;\n }\n\n bool usedHint = false;\n for (;;)\n {\n std::map<const std::string, Object* (*)(ProxyObject object)>::iterator it;\n it = proxyConstructorMap.find(className);\n if (it != proxyConstructorMap.end())\n {\n ProxyObject browserObject(object, npp);\n if (Object* object = (*it).second(browserObject))\n {\n return track(object);\n }\n }\n if (!type.isObject() || usedHint)\n {\n break;\n }\n className = type.getQualifiedName();\n size_t pos = className.rfind(':');\n if (pos != std::string::npos)\n {\n className = className.substr(pos + 1);\n printf(\"%s: use the class name '%s' as hinted.\\n\", __func__, className.c_str());\n }\n usedHint = true;\n }\n return 0;\n}\n\nlong ProxyControl::enter()\n{\n return ++nestingCount;\n}\n\nlong ProxyControl::leave()\n{\n --nestingCount;\n assert(0 <= nestingCount);\n if (nestingCount == 0)\n {\n while (!newList.empty())\n {\n Object* object = newList.front();\n newList.pop_front();\n if (0 < object->release())\n {\n oldList.push_back(object);\n }\n }\n }\n return nestingCount;\n}\n\nvoid ProxyControl::registerMetaData(const char* meta, Object* (*createProxy)(ProxyObject object), const char* alias)\n{\n Reflect::Interface interface(meta);\n std::string name = interface.getName();\n if (alias)\n {\n name = alias;\n }\n proxyConstructorMap[name] = createProxy;\n printf(\"%s\\n\", name.c_str());\n}\n\nProxyObject::ProxyObject(NPObject* object, NPP npp) :\n object(object),\n npp(npp),\n count(0)\n{\n}\n\nProxyObject::ProxyObject(const ProxyObject& original) :\n object(original.object),\n npp(original.npp),\n count(original.count)\n{\n}\n\nProxyObject::~ProxyObject()\n{\n \/\/ TODO: Remove this from newList or oldList if it is still included\n}\n\nunsigned int ProxyObject::retain()\n{\n NPN_RetainObject(object);\n return ++count;\n}\n\nunsigned int ProxyObject::release()\n{\n if (0 < count)\n {\n NPN_ReleaseObject(object);\n --count;\n }\n if (count == 0)\n {\n delete this;\n return 0;\n }\n return count;\n}\n\nunsigned int ProxyObject::mark()\n{\n return ++count;\n}\n\nPluginInstance::PluginInstance(NPP npp, NPObject* window) :\n proxyControl(npp),\n stubControl(npp),\n window(0)\n{\n npp->pdata = this;\n this->window = interface_cast<org::w3c::dom::html::Window*>(proxyControl.createProxy(window, Reflect::Type(\"O14::html::Window\")));\n if (this->window)\n {\n ProxyObject* proxy = interface_cast<ProxyObject*>(this->window);\n proxy->mark();\n proxy->retain();\n }\n}\n\nPluginInstance::~PluginInstance()\n{\n if (window)\n {\n window->release();\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n ** \\file object\/primitive-class.cc\n ** \\brief Creation of the URBI object primitive.\n *\/\n\n#include \"object\/primitive-class.hh\"\n#include \"object\/object.hh\"\n\nnamespace object\n{\n rObject primitive_class;\n\n \/*-----------------------.\n | Primitive primitives. |\n `-----------------------*\/\n\n void\n primitive_class_initialize ()\n {\n }\n\n}; \/\/ namespace object\n<commit_msg>Implement apply() for primitives<commit_after>\/**\n ** \\file object\/primitive-class.cc\n ** \\brief Creation of the URBI object primitive.\n *\/\n\n#include \"object\/primitive-class.hh\"\n#include \"object\/atom.hh\"\n#include \"object\/object.hh\"\n\n#include \"runner\/runner.hh\"\n\nnamespace object\n{\n rObject primitive_class;\n\n \/*-----------------------.\n | Primitive primitives. |\n `-----------------------*\/\n\n static rObject\n primitive_class_apply (runner::Runner& r, objects_type args)\n {\n CHECK_ARG_COUNT (2);\n FETCH_ARG (1, List);\n return r.apply (args[0], arg1);\n }\n\n void\n primitive_class_initialize ()\n {\n#define DECLARE(Name)\t\t\t\t\\\n DECLARE_PRIMITIVE(primitive, Name)\n DECLARE (apply);\n#undef DECLARE\n }\n\n}; \/\/ namespace object\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"Material.hpp\"\n\nnamespace RealRT\n{\n\n class PhongMaterial : public Material\n {\n public:\n\n PhongMaterial(const Vector3D &color, float reflectance, float refractance, float indexOfRefraction, float diffuseScalar, float specularScalar);\n\n float BidirectionReflectanceDistributionFunction(const Vector3D &in, const Vector3D &out, const Vector3D &norm) const;\n };\n\n \/\/some material definitions\n const PhongMaterial DiffuseRed(Vector3D(0.9f,0.1f,0.1f),0.1f,0.0f,0.0f,0.9f,0.2f);\n const PhongMaterial DiffuseGreen(Vector3D(0.1f,0.9f,0.1f),0.1f,0.0f,0.0f,0.9f,0.2f);\n const PhongMaterial DiffuseBlue(Vector3D(0.1f,0.1f,0.9f),0.1f,0.0f,0.0f,0.9f,0.2f);\n\n const PhongMaterial ReflectiveRed(Vector3D(0.9f,0.1f,0.1f),0.9f,0.0f,0.0f,0.1f,0.9f);\n const PhongMaterial ReflectiveGreen(Vector3D(0.1f,0.9f,0.1f),0.9f,0.0f,0.0f,0.1f,0.9f);\n const PhongMaterial ReflectiveBlue(Vector3D(0.1f,0.1f,0.9f),0.9f,0.0f,0.0f,0.1f,0.9f);\n\n const PhongMaterial Mirror(Vector3D(1.0f,1.0f,1.0f),0.9f,0.0f,0.0f,0.1f,0.9f);\n\n const PhongMaterial TranslucentGreen(Vector3D(0.1f,0.9f,0.2f),0.5f,0.0f,0.0f,0.1f,0.9f);\n const PhongMaterial TranslucentRed(Vector3D(0.9f,0.2f,0.1f),0.5f,0.0f,0.0f,0.0f,1.9f);\n const PhongMaterial TranslucentBlue(Vector3D(0.2f,0.1f,0.9f),0.5f,0.0f,0.0f,0.1f,0.9f);\n\n const PhongMaterial Transparent(Vector3D(1.0f,1.0f,1.0f),0.5f,0.9f,1.0f,0.0f,0.9f);\n\n const PhongMaterial WhiteLight(Vector3D(1.0f,1.0f,1.0f),0.0f,0.0f,0.0f,1.0f,0.0f);\n\n const PhongMaterial Blank(Vector3D(0.0f,0.0f,0.0f),0.0f,0.0f,0.0f,0.0f,0.0f);\n\n}\n<commit_msg>Updated material definitions to shared_ptr <commit_after>#pragma once\n\n#include \"Material.hpp\"\n#include <memory>\n\nnamespace RealRT\n{\n\n class PhongMaterial : public Material\n {\n public:\n\n PhongMaterial(const Vector3D &color, float reflectance, float refractance, float indexOfRefraction, float diffuseScalar, float specularScalar);\n\n float BidirectionReflectanceDistributionFunction(const Vector3D &in, const Vector3D &out, const Vector3D &norm) const;\n };\n\n \/\/some material definitions\n const std::shared_ptr<Material> DiffuseRed = std::make_shared<PhongMaterial>(Vector3D(0.9f,0.1f,0.1f),0.1f,0.0f,0.0f,0.9f,0.2f);\n const std::shared_ptr<Material> DiffuseGreen = std::make_shared<PhongMaterial>(Vector3D(0.1f,0.9f,0.1f),0.1f,0.0f,0.0f,0.9f,0.2f);\n const std::shared_ptr<Material> DiffuseBlue = std::make_shared<PhongMaterial>(Vector3D(0.1f,0.1f,0.9f),0.1f,0.0f,0.0f,0.9f,0.2f);\n\n const std::shared_ptr<Material> ReflectiveRed = std::make_shared<PhongMaterial>(Vector3D(0.9f,0.1f,0.1f),0.9f,0.0f,0.0f,0.1f,0.9f);\n const std::shared_ptr<Material> ReflectiveGreen = std::make_shared<PhongMaterial>(Vector3D(0.1f,0.9f,0.1f),0.9f,0.0f,0.0f,0.1f,0.9f);\n const std::shared_ptr<Material> ReflectiveBlue = std::make_shared<PhongMaterial>(Vector3D(0.1f,0.1f,0.9f),0.9f,0.0f,0.0f,0.1f,0.9f);\n\n const std::shared_ptr<Material> Mirror = std::make_shared<PhongMaterial>(Vector3D(1.0f,1.0f,1.0f),0.9f,0.0f,0.0f,0.1f,0.9f);\n\n const std::shared_ptr<Material> TranslucentGreen = std::make_shared<PhongMaterial>(Vector3D(0.1f,0.9f,0.2f),0.5f,0.0f,0.0f,0.1f,0.9f);\n const std::shared_ptr<Material> TranslucentRed = std::make_shared<PhongMaterial>(Vector3D(0.9f,0.2f,0.1f),0.5f,0.0f,0.0f,0.0f,1.9f);\n const std::shared_ptr<Material> TranslucentBlue = std::make_shared<PhongMaterial>(Vector3D(0.2f,0.1f,0.9f),0.5f,0.0f,0.0f,0.1f,0.9f);\n\n const std::shared_ptr<Material> Transparent = std::make_shared<PhongMaterial>(Vector3D(1.0f,1.0f,1.0f),0.5f,0.9f,1.0f,0.0f,0.9f);\n\n const std::shared_ptr<Material> WhiteLight = std::make_shared<PhongMaterial>(Vector3D(1.0f,1.0f,1.0f),0.0f,0.0f,0.0f,1.0f,0.0f);\n\n const std::shared_ptr<Material> Blank = std::make_shared<PhongMaterial>(Vector3D(0.0f,0.0f,0.0f),0.0f,0.0f,0.0f,0.0f,0.0f);\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Copyright (C) Mellanox Technologies Ltd. 2001-2015. ALL RIGHTS RESERVED.\n*\n* $COPYRIGHT$\n* $HEADER$\n*\/\n\n#include \"uct_test.h\"\nextern \"C\" {\n#include <ucs\/time\/time.h>\n#include <ucs\/datastruct\/queue.h>\n#include \"uct\/ib\/ud\/ud_def.h\"\n#include \"uct\/ib\/ud\/ud_ep.h\"\n#include \"uct\/ib\/ud\/ud_iface.h\"\n};\n\/* test ud connect data structures *\/\nclass test_ud_ds : public uct_test {\npublic:\n virtual void init() {\n uct_test::init();\n\n m_e1 = new entity(GetParam(), 0);\n m_e2 = new entity(GetParam(), 0);\n\n uct_iface_get_address(m_e1->iface(), &adr1.super);\n uct_iface_get_address(m_e2->iface(), &adr2.super);\n }\n uct_ud_iface_t *iface(entity *e) {\n return ucs_derived_of(e->iface(), uct_ud_iface_t);\n }\n\n uct_ud_ep_t *ep(entity *e, int i) {\n return ucs_derived_of(e->ep(i), uct_ud_ep_t);\n }\n\n void cleanup() {\n uct_test::cleanup();\n }\n\n void test_cep_insert(entity *e, uct_ud_iface_addr_t *adr);\n\nprotected:\n entity *m_e1, *m_e2;\n uct_ud_iface_addr_t adr1, adr2;\n static int N;\n};\n\nint test_ud_ds::N = 1000;\n\nUCS_TEST_P(test_ud_ds, if_addr) {\n EXPECT_EQ(adr1.lid, adr2.lid);\n EXPECT_NE(adr1.qp_num, adr2.qp_num);\n}\n\nvoid test_ud_ds::test_cep_insert(entity *e, uct_ud_iface_addr_t *adr)\n{\n int i;\n uct_ud_ep_t *my_ep;\n\n for (i = 0; i < N; i++) {\n e->add_ep();\n \/\/printf(\"ep id: %d\", ep(e, i)->ep_id);\n EXPECT_EQ(ep(e, i)->ep_id, i);\n EXPECT_EQ(ep(e, i)->dest_ep_id, UCT_UD_EP_NULL_ID);\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(e), adr, ep(e, i), UCT_UD_EP_CONN_ID_MAX));\n EXPECT_EQ(ep(e, i)->conn_id, i);\n }\n \/* lookup non existing ep *\/\n my_ep = uct_ud_iface_cep_lookup(iface(e), adr, 3333);\n EXPECT_TRUE(my_ep == NULL);\n for (i = 0; i < N; i++) {\n my_ep = uct_ud_iface_cep_lookup(iface(e), adr, i);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(ep(e, i)->ep_id, i);\n EXPECT_EQ(ep(e, i)->conn_id, i);\n }\n}\n\n\/* simulate creq send *\/\nUCS_TEST_P(test_ud_ds, cep_insert) {\n test_cep_insert(m_e1, &adr1);\n test_cep_insert(m_e1, &adr2);\n}\n\nUCS_TEST_P(test_ud_ds, cep_replace) {\n\n uct_ud_ep_t *my_ep;\n\n \/* add N connections *\/\n test_cep_insert(m_e1, &adr1);\n\n \/* Assume that we have 5 connections pending and 3 CREQs received *\/\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N), N+1));\n EXPECT_EQ(ep(m_e1, N)->conn_id, N+1);\n\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+1), N+4));\n EXPECT_EQ(ep(m_e1, N+1)->conn_id, N+4);\n\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+2), N+5));\n EXPECT_EQ(ep(m_e1, N+2)->conn_id, N+5);\n\n \/* we initiate 2 connections *\/\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, UCT_UD_EP_CONN_ID_MAX);\n EXPECT_TRUE(my_ep == NULL);\n m_e1->add_ep();\n \/* slot N must be free. conn_id will be N+1 when inserting ep with no id *\/\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+3), UCT_UD_EP_CONN_ID_MAX));\n EXPECT_EQ(ep(m_e1, N+3)->conn_id, N);\n\n \/* slot N+1 already occupied *\/\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, UCT_UD_EP_CONN_ID_MAX);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(my_ep->conn_id, N+1);\n\n \/* replace ep *\/\n m_e1->add_ep();\n ep(m_e1, N+4)->conn_id = my_ep->conn_id;\n uct_ud_iface_cep_replace(my_ep, ep(m_e1, N+4), uct_ud_ep_cp);\n EXPECT_EQ(ep(m_e1, N+4)->dest_if->conn_id_last, N+2);\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, N+1);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(my_ep, ep(m_e1, N+4));\n}\n\n\n\n_UCT_INSTANTIATE_TEST_CASE(test_ud_ds, ud)\n\n<commit_msg>GTEST\/UD: fixes compilation error<commit_after>\/**\n* Copyright (C) Mellanox Technologies Ltd. 2001-2015. ALL RIGHTS RESERVED.\n*\n* $COPYRIGHT$\n* $HEADER$\n*\/\n\n#include \"uct_test.h\"\nextern \"C\" {\n#include <ucs\/time\/time.h>\n#include <ucs\/datastruct\/queue.h>\n#include \"uct\/ib\/ud\/ud_def.h\"\n#include \"uct\/ib\/ud\/ud_ep.h\"\n#include \"uct\/ib\/ud\/ud_iface.h\"\n};\n\/* test ud connect data structures *\/\nclass test_ud_ds : public uct_test {\npublic:\n virtual void init() {\n uct_test::init();\n\n m_e1 = create_entity(0);\n m_e2 = create_entity(0);\n\n uct_iface_get_address(m_e1->iface(), &adr1.super);\n uct_iface_get_address(m_e2->iface(), &adr2.super);\n }\n uct_ud_iface_t *iface(entity *e) {\n return ucs_derived_of(e->iface(), uct_ud_iface_t);\n }\n\n uct_ud_ep_t *ep(entity *e, int i) {\n return ucs_derived_of(e->ep(i), uct_ud_ep_t);\n }\n\n void cleanup() {\n uct_test::cleanup();\n }\n\n void test_cep_insert(entity *e, uct_ud_iface_addr_t *adr);\n\nprotected:\n entity *m_e1, *m_e2;\n uct_ud_iface_addr_t adr1, adr2;\n static int N;\n};\n\nint test_ud_ds::N = 1000;\n\nUCS_TEST_P(test_ud_ds, if_addr) {\n EXPECT_EQ(adr1.lid, adr2.lid);\n EXPECT_NE(adr1.qp_num, adr2.qp_num);\n}\n\nvoid test_ud_ds::test_cep_insert(entity *e, uct_ud_iface_addr_t *adr)\n{\n int i;\n uct_ud_ep_t *my_ep;\n\n for (i = 0; i < N; i++) {\n e->add_ep();\n \/\/printf(\"ep id: %d\", ep(e, i)->ep_id);\n EXPECT_EQ(ep(e, i)->ep_id, i);\n EXPECT_EQ(ep(e, i)->dest_ep_id, UCT_UD_EP_NULL_ID);\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(e), adr, ep(e, i), UCT_UD_EP_CONN_ID_MAX));\n EXPECT_EQ(ep(e, i)->conn_id, i);\n }\n \/* lookup non existing ep *\/\n my_ep = uct_ud_iface_cep_lookup(iface(e), adr, 3333);\n EXPECT_TRUE(my_ep == NULL);\n for (i = 0; i < N; i++) {\n my_ep = uct_ud_iface_cep_lookup(iface(e), adr, i);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(ep(e, i)->ep_id, i);\n EXPECT_EQ(ep(e, i)->conn_id, i);\n }\n}\n\n\/* simulate creq send *\/\nUCS_TEST_P(test_ud_ds, cep_insert) {\n test_cep_insert(m_e1, &adr1);\n test_cep_insert(m_e1, &adr2);\n}\n\nUCS_TEST_P(test_ud_ds, cep_replace) {\n\n uct_ud_ep_t *my_ep;\n\n \/* add N connections *\/\n test_cep_insert(m_e1, &adr1);\n\n \/* Assume that we have 5 connections pending and 3 CREQs received *\/\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N), N+1));\n EXPECT_EQ(ep(m_e1, N)->conn_id, N+1);\n\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+1), N+4));\n EXPECT_EQ(ep(m_e1, N+1)->conn_id, N+4);\n\n m_e1->add_ep();\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+2), N+5));\n EXPECT_EQ(ep(m_e1, N+2)->conn_id, N+5);\n\n \/* we initiate 2 connections *\/\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, UCT_UD_EP_CONN_ID_MAX);\n EXPECT_TRUE(my_ep == NULL);\n m_e1->add_ep();\n \/* slot N must be free. conn_id will be N+1 when inserting ep with no id *\/\n EXPECT_UCS_OK(uct_ud_iface_cep_insert(iface(m_e1), &adr1, ep(m_e1, N+3), UCT_UD_EP_CONN_ID_MAX));\n EXPECT_EQ(ep(m_e1, N+3)->conn_id, N);\n\n \/* slot N+1 already occupied *\/\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, UCT_UD_EP_CONN_ID_MAX);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(my_ep->conn_id, N+1);\n\n \/* replace ep *\/\n m_e1->add_ep();\n ep(m_e1, N+4)->conn_id = my_ep->conn_id;\n uct_ud_iface_cep_replace(my_ep, ep(m_e1, N+4), uct_ud_ep_clone);\n EXPECT_EQ(ep(m_e1, N+4)->dest_if->conn_id_last, N+2);\n my_ep = uct_ud_iface_cep_lookup(iface(m_e1), &adr1, N+1);\n EXPECT_TRUE(my_ep != NULL);\n EXPECT_EQ(my_ep, ep(m_e1, N+4));\n}\n\n\n\n_UCT_INSTANTIATE_TEST_CASE(test_ud_ds, ud)\n\n<|endoftext|>"} {"text":"<commit_before>\/* **********************************************************\n * Copyright (c) 2015 Google, Inc. All rights reserved.\n * **********************************************************\/\n\n\/*\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Google, Inc. nor the names of its contributors may be\n * used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE, INC. OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\/\n\n\/* Test parsing options.\n *\/\n\n#include \"dr_api.h\"\n#include \"client_tools.h\"\n#include \"droption.h\"\n#include <string.h>\n\nstatic droption_t<unsigned int> op_x\n(DROPTION_SCOPE_CLIENT, \"x\", 0, 0, 64, \"Some param\",\n \"Longer desc of some param.\");\nstatic droption_t<std::string> op_y\n(DROPTION_SCOPE_CLIENT, \"y\", DROPTION_FLAG_ACCUMULATE, \"<default>\", \"Another param\",\n \"Longer desc of another param.\");\nstatic droption_t<std::string> op_z\n(DROPTION_SCOPE_CLIENT, \"z\", \"\", \"Yet another param\",\n \"Longer desc of yet another param.\");\nstatic droption_t<int> op_foo\n(DROPTION_SCOPE_CLIENT, \"foo\", 8, \"Missing param\",\n \"Longer desc of missing param.\");\nstatic droption_t<std::string> op_bar\n(DROPTION_SCOPE_CLIENT, \"bar\", \"some string with spaces\", \"Missing string param\",\n \"Longer desc of missing string param.\");\nstatic droption_t<bool> op_flag\n(DROPTION_SCOPE_CLIENT, \"flag\", true, \"Bool param\",\n \"Longer desc of bool param.\");\nstatic droption_t<std::string> op_sweep\n(DROPTION_SCOPE_CLIENT, \"sweep\", DROPTION_FLAG_SWEEP | DROPTION_FLAG_ACCUMULATE,\n \"\", \"All the unknown params\",\n \"Longer desc of unknown param accum.\");\nstatic droption_t<std::string> op_front\n(DROPTION_SCOPE_FRONTEND, \"front\", \"\", \"Front-end param\",\n \"Longer desc of front-end param.\");\nstatic droption_t<std::string> op_front2\n(DROPTION_SCOPE_FRONTEND, \"front2\", \"\", \"Front-end param2\",\n \"Longer desc of front-end param2.\");\n\nDR_EXPORT void\ndr_init(client_id_t client_id)\n{\n \/\/ Test dr_get_option_array().\n int argc;\n const char **argv;\n bool ok = dr_get_option_array(client_id, &argc, &argv, MAXIMUM_PATH);\n ASSERT(ok);\n ASSERT(argc == 16);\n ASSERT(strcmp(argv[1], \"-x\") == 0);\n ASSERT(strcmp(argv[2], \"4\") == 0);\n ASSERT(strcmp(argv[3], \"-y\") == 0);\n ASSERT(strcmp(argv[4], \"quoted string\") == 0);\n ASSERT(strcmp(argv[5], \"-z\") == 0);\n ASSERT(strcmp(argv[6], \"first\") == 0);\n ASSERT(strcmp(argv[7], \"-z\") == 0);\n ASSERT(strcmp(argv[8], \"single quotes -dash --dashes\") == 0);\n ASSERT(strcmp(argv[9], \"-front\") == 0);\n ASSERT(strcmp(argv[10], \"value\") == 0);\n ASSERT(strcmp(argv[11], \"-y\") == 0);\n ASSERT(strcmp(argv[12], \"accum\") == 0);\n ASSERT(strcmp(argv[13], \"-front2\") == 0);\n ASSERT(strcmp(argv[14], \"value2\") == 0);\n ASSERT(strcmp(argv[15], \"-no_flag\") == 0);\n ok = dr_free_option_array(argc, argv);\n ASSERT(ok);\n\n \/\/ Test dr_parse_options() and droption_t declarations above.\n ok = dr_parse_options(client_id, NULL, NULL);\n ASSERT(ok);\n ASSERT(op_x.specified());\n ASSERT(op_y.specified());\n ASSERT(op_z.specified());\n dr_printf(\"param x = %d\\n\", op_x.get_value());\n dr_printf(\"param y = |%s|\\n\", op_y.get_value().c_str());\n dr_printf(\"param z = |%s|\\n\", op_z.get_value().c_str());\n dr_printf(\"param foo = %d\\n\", op_foo.get_value());\n dr_printf(\"param bar = |%s|\\n\", op_bar.get_value().c_str());\n dr_printf(\"param flag = |%d|\\n\", op_flag.get_value());\n dr_printf(\"param sweep = |%s|\\n\", op_sweep.get_value().c_str());\n ASSERT(!op_foo.specified());\n ASSERT(!op_bar.specified());\n}\n<commit_msg>i#1720 spurious client.option_parse failures: client to use STDERR<commit_after>\/* **********************************************************\n * Copyright (c) 2015 Google, Inc. All rights reserved.\n * **********************************************************\/\n\n\/*\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * * Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * * Neither the name of Google, Inc. nor the names of its contributors may be\n * used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL GOOGLE, INC. OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n * DAMAGE.\n *\/\n\n\/* Test parsing options.\n *\/\n\n#include \"dr_api.h\"\n#include \"client_tools.h\"\n#include \"droption.h\"\n#include <string.h>\n\nstatic droption_t<unsigned int> op_x\n(DROPTION_SCOPE_CLIENT, \"x\", 0, 0, 64, \"Some param\",\n \"Longer desc of some param.\");\nstatic droption_t<std::string> op_y\n(DROPTION_SCOPE_CLIENT, \"y\", DROPTION_FLAG_ACCUMULATE, \"<default>\", \"Another param\",\n \"Longer desc of another param.\");\nstatic droption_t<std::string> op_z\n(DROPTION_SCOPE_CLIENT, \"z\", \"\", \"Yet another param\",\n \"Longer desc of yet another param.\");\nstatic droption_t<int> op_foo\n(DROPTION_SCOPE_CLIENT, \"foo\", 8, \"Missing param\",\n \"Longer desc of missing param.\");\nstatic droption_t<std::string> op_bar\n(DROPTION_SCOPE_CLIENT, \"bar\", \"some string with spaces\", \"Missing string param\",\n \"Longer desc of missing string param.\");\nstatic droption_t<bool> op_flag\n(DROPTION_SCOPE_CLIENT, \"flag\", true, \"Bool param\",\n \"Longer desc of bool param.\");\nstatic droption_t<std::string> op_sweep\n(DROPTION_SCOPE_CLIENT, \"sweep\", DROPTION_FLAG_SWEEP | DROPTION_FLAG_ACCUMULATE,\n \"\", \"All the unknown params\",\n \"Longer desc of unknown param accum.\");\nstatic droption_t<std::string> op_front\n(DROPTION_SCOPE_FRONTEND, \"front\", \"\", \"Front-end param\",\n \"Longer desc of front-end param.\");\nstatic droption_t<std::string> op_front2\n(DROPTION_SCOPE_FRONTEND, \"front2\", \"\", \"Front-end param2\",\n \"Longer desc of front-end param2.\");\n\nDR_EXPORT void\ndr_init(client_id_t client_id)\n{\n \/\/ Test dr_get_option_array().\n int argc;\n const char **argv;\n bool ok = dr_get_option_array(client_id, &argc, &argv, MAXIMUM_PATH);\n ASSERT(ok);\n ASSERT(argc == 16);\n ASSERT(strcmp(argv[1], \"-x\") == 0);\n ASSERT(strcmp(argv[2], \"4\") == 0);\n ASSERT(strcmp(argv[3], \"-y\") == 0);\n ASSERT(strcmp(argv[4], \"quoted string\") == 0);\n ASSERT(strcmp(argv[5], \"-z\") == 0);\n ASSERT(strcmp(argv[6], \"first\") == 0);\n ASSERT(strcmp(argv[7], \"-z\") == 0);\n ASSERT(strcmp(argv[8], \"single quotes -dash --dashes\") == 0);\n ASSERT(strcmp(argv[9], \"-front\") == 0);\n ASSERT(strcmp(argv[10], \"value\") == 0);\n ASSERT(strcmp(argv[11], \"-y\") == 0);\n ASSERT(strcmp(argv[12], \"accum\") == 0);\n ASSERT(strcmp(argv[13], \"-front2\") == 0);\n ASSERT(strcmp(argv[14], \"value2\") == 0);\n ASSERT(strcmp(argv[15], \"-no_flag\") == 0);\n ok = dr_free_option_array(argc, argv);\n ASSERT(ok);\n\n \/\/ Test dr_parse_options() and droption_t declarations above.\n ok = dr_parse_options(client_id, NULL, NULL);\n ASSERT(ok);\n ASSERT(op_x.specified());\n ASSERT(op_y.specified());\n ASSERT(op_z.specified());\n dr_fprintf(STDERR, \"param x = %d\\n\", op_x.get_value());\n dr_fprintf(STDERR, \"param y = |%s|\\n\", op_y.get_value().c_str());\n dr_fprintf(STDERR, \"param z = |%s|\\n\", op_z.get_value().c_str());\n dr_fprintf(STDERR, \"param foo = %d\\n\", op_foo.get_value());\n dr_fprintf(STDERR, \"param bar = |%s|\\n\", op_bar.get_value().c_str());\n dr_fprintf(STDERR, \"param flag = |%d|\\n\", op_flag.get_value());\n dr_fprintf(STDERR, \"param sweep = |%s|\\n\", op_sweep.get_value().c_str());\n ASSERT(!op_foo.specified());\n ASSERT(!op_bar.specified());\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n\ntemplate<typename MatrixType> void array_for_matrix(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVectorType;\n typedef Matrix<Scalar, 1, MatrixType::ColsAtCompileTime> RowVectorType; \n\n Index rows = m.rows();\n Index cols = m.cols();\n\n MatrixType m1 = MatrixType::Random(rows, cols),\n m2 = MatrixType::Random(rows, cols),\n m3(rows, cols);\n\n ColVectorType cv1 = ColVectorType::Random(rows);\n RowVectorType rv1 = RowVectorType::Random(cols);\n \n Scalar s1 = internal::random<Scalar>(),\n s2 = internal::random<Scalar>();\n \n \/\/ scalar addition\n VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array());\n VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);\n VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );\n m3 = m1;\n m3.array() += s2;\n VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix());\n m3 = m1;\n m3.array() -= s1;\n VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix());\n\n \/\/ reductions\n VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum().sum() - m1.sum(), m1.squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum().sum() - m1.sum(), m1.squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum() + m2.colwise().sum() - (m1+m2).colwise().sum(), (m1+m2).squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum() - m2.rowwise().sum() - (m1-m2).rowwise().sum(), (m1-m2).squaredNorm());\n VERIFY_IS_APPROX(m1.colwise().sum(), m1.colwise().redux(internal::scalar_sum_op<Scalar>()));\n\n \/\/ vector-wise ops\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() += cv1, m1.colwise() + cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() -= cv1, m1.colwise() - cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1);\n \n \/\/ empty objects\n VERIFY_IS_APPROX(m1.block(0,0,0,cols).colwise().sum(), RowVectorType::Zero(cols));\n VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));\n \n \/\/ verify the const accessors exist\n const Scalar& ref_m1 = m.matrix().array().coeffRef(0);\n const Scalar& ref_m2 = m.matrix().array().coeffRef(0,0);\n const Scalar& ref_a1 = m.array().matrix().coeffRef(0);\n const Scalar& ref_a2 = m.array().matrix().coeffRef(0,0);\n VERIFY(&ref_a1 == &ref_m1);\n VERIFY(&ref_a2 == &ref_m2);\n}\n\ntemplate<typename MatrixType> void comparisons(const MatrixType& m)\n{\n using std::abs;\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n Index r = internal::random<Index>(0, rows-1),\n c = internal::random<Index>(0, cols-1);\n\n MatrixType m1 = MatrixType::Random(rows, cols),\n m2 = MatrixType::Random(rows, cols),\n m3(rows, cols);\n\n VERIFY(((m1.array() + Scalar(1)) > m1.array()).all());\n VERIFY(((m1.array() - Scalar(1)) < m1.array()).all());\n if (rows*cols>1)\n {\n m3 = m1;\n m3(r,c) += 1;\n VERIFY(! (m1.array() < m3.array()).all() );\n VERIFY(! (m1.array() > m3.array()).all() );\n }\n\n \/\/ comparisons to scalar\n VERIFY( (m1.array() != (m1(r,c)+1) ).any() );\n VERIFY( (m1.array() > (m1(r,c)-1) ).any() );\n VERIFY( (m1.array() < (m1(r,c)+1) ).any() );\n VERIFY( (m1.array() == m1(r,c) ).any() );\n\n \/\/ test Select\n VERIFY_IS_APPROX( (m1.array()<m2.array()).select(m1,m2), m1.cwiseMin(m2) );\n VERIFY_IS_APPROX( (m1.array()>m2.array()).select(m1,m2), m1.cwiseMax(m2) );\n Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())\/Scalar(2);\n for (int j=0; j<cols; ++j)\n for (int i=0; i<rows; ++i)\n m3(i,j) = abs(m1(i,j))<mid ? 0 : m1(i,j);\n VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array())\n .select(MatrixType::Zero(rows,cols),m1), m3);\n \/\/ shorter versions:\n VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array())\n .select(0,m1), m3);\n VERIFY_IS_APPROX( (m1.array().abs()>=MatrixType::Constant(rows,cols,mid).array())\n .select(m1,0), m3);\n \/\/ even shorter version:\n VERIFY_IS_APPROX( (m1.array().abs()<mid).select(0,m1), m3);\n\n \/\/ count\n VERIFY(((m1.array().abs()+1)>RealScalar(0.1)).count() == rows*cols);\n\n typedef Matrix<typename MatrixType::Index, Dynamic, 1> VectorOfIndices;\n\n \/\/ TODO allows colwise\/rowwise for array\n VERIFY_IS_APPROX(((m1.array().abs()+1)>RealScalar(0.1)).matrix().colwise().count(), VectorOfIndices::Constant(cols,rows).transpose());\n VERIFY_IS_APPROX(((m1.array().abs()+1)>RealScalar(0.1)).matrix().rowwise().count(), VectorOfIndices::Constant(rows, cols));\n}\n\ntemplate<typename VectorType> void lpNorm(const VectorType& v)\n{\n using std::sqrt;\n VectorType u = VectorType::Random(v.size());\n\n VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwiseAbs().maxCoeff());\n VERIFY_IS_APPROX(u.template lpNorm<1>(), u.cwiseAbs().sum());\n VERIFY_IS_APPROX(u.template lpNorm<2>(), sqrt(u.array().abs().square().sum()));\n VERIFY_IS_APPROX(numext::pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.array().abs().pow(5).sum());\n}\n\ntemplate<typename MatrixType> void cwise_min_max(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n MatrixType m1 = MatrixType::Random(rows, cols);\n\n \/\/ min\/max with array\n Scalar maxM1 = m1.maxCoeff();\n Scalar minM1 = m1.minCoeff();\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1), m1.cwiseMin(MatrixType::Constant(rows,cols, minM1)));\n VERIFY_IS_APPROX(m1, m1.cwiseMin(MatrixType::Constant(rows,cols, maxM1)));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1), m1.cwiseMax(MatrixType::Constant(rows,cols, maxM1)));\n VERIFY_IS_APPROX(m1, m1.cwiseMax(MatrixType::Constant(rows,cols, minM1)));\n\n \/\/ min\/max with scalar input\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1), m1.cwiseMin( minM1));\n VERIFY_IS_APPROX(m1, m1.cwiseMin( maxM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1), m1.cwiseMax( maxM1));\n VERIFY_IS_APPROX(m1, m1.cwiseMax( minM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1).array(), (m1.array().min)( minM1));\n VERIFY_IS_APPROX(m1.array(), (m1.array().min)( maxM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1).array(), (m1.array().max)( maxM1));\n VERIFY_IS_APPROX(m1.array(), (m1.array().max)( minM1));\n\n}\n\ntemplate<typename MatrixTraits> void resize(const MatrixTraits& t)\n{\n typedef typename MatrixTraits::Index Index;\n typedef typename MatrixTraits::Scalar Scalar;\n typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;\n typedef Array<Scalar,Dynamic,Dynamic> Array2DType;\n typedef Matrix<Scalar,Dynamic,1> VectorType;\n typedef Array<Scalar,Dynamic,1> Array1DType;\n\n Index rows = t.rows(), cols = t.cols();\n\n MatrixType m(rows,cols);\n VectorType v(rows);\n Array2DType a2(rows,cols);\n Array1DType a1(rows);\n\n m.array().resize(rows+1,cols+1);\n VERIFY(m.rows()==rows+1 && m.cols()==cols+1);\n a2.matrix().resize(rows+1,cols+1);\n VERIFY(a2.rows()==rows+1 && a2.cols()==cols+1);\n v.array().resize(cols);\n VERIFY(v.size()==cols);\n a1.matrix().resize(cols);\n VERIFY(a1.size()==cols);\n}\n\nvoid regression_bug_654()\n{\n ArrayXf a = RowVectorXf(3);\n VectorXf v = Array<float,1,Dynamic>(3);\n}\n\nvoid test_array_for_matrix()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( array_for_matrix(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( array_for_matrix(Matrix2f()) );\n CALL_SUBTEST_3( array_for_matrix(Matrix4d()) );\n CALL_SUBTEST_4( array_for_matrix(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_5( array_for_matrix(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( array_for_matrix(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( comparisons(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( comparisons(Matrix2f()) );\n CALL_SUBTEST_3( comparisons(Matrix4d()) );\n CALL_SUBTEST_5( comparisons(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( comparisons(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( cwise_min_max(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( cwise_min_max(Matrix2f()) );\n CALL_SUBTEST_3( cwise_min_max(Matrix4d()) );\n CALL_SUBTEST_5( cwise_min_max(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( cwise_min_max(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( lpNorm(Vector2f()) );\n CALL_SUBTEST_7( lpNorm(Vector3d()) );\n CALL_SUBTEST_8( lpNorm(Vector4f()) );\n CALL_SUBTEST_5( lpNorm(VectorXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_4( lpNorm(VectorXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_4( resize(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_5( resize(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( resize(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n CALL_SUBTEST_6( regression_bug_654() );\n}\n<commit_msg>bug 679: add respective unit test<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008-2009 Gael Guennebaud <gael.guennebaud@inria.fr>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include \"main.h\"\n\ntemplate<typename MatrixType> void array_for_matrix(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> ColVectorType;\n typedef Matrix<Scalar, 1, MatrixType::ColsAtCompileTime> RowVectorType; \n\n Index rows = m.rows();\n Index cols = m.cols();\n\n MatrixType m1 = MatrixType::Random(rows, cols),\n m2 = MatrixType::Random(rows, cols),\n m3(rows, cols);\n\n ColVectorType cv1 = ColVectorType::Random(rows);\n RowVectorType rv1 = RowVectorType::Random(cols);\n \n Scalar s1 = internal::random<Scalar>(),\n s2 = internal::random<Scalar>();\n \n \/\/ scalar addition\n VERIFY_IS_APPROX(m1.array() + s1, s1 + m1.array());\n VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);\n VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );\n m3 = m1;\n m3.array() += s2;\n VERIFY_IS_APPROX(m3, (m1.array() + s2).matrix());\n m3 = m1;\n m3.array() -= s1;\n VERIFY_IS_APPROX(m3, (m1.array() - s1).matrix());\n\n \/\/ reductions\n VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum().sum() - m1.sum(), m1.squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum().sum() - m1.sum(), m1.squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.colwise().sum() + m2.colwise().sum() - (m1+m2).colwise().sum(), (m1+m2).squaredNorm());\n VERIFY_IS_MUCH_SMALLER_THAN(m1.rowwise().sum() - m2.rowwise().sum() - (m1-m2).rowwise().sum(), (m1-m2).squaredNorm());\n VERIFY_IS_APPROX(m1.colwise().sum(), m1.colwise().redux(internal::scalar_sum_op<Scalar>()));\n\n \/\/ vector-wise ops\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() += cv1, m1.colwise() + cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.colwise() -= cv1, m1.colwise() - cv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() += rv1, m1.rowwise() + rv1);\n m3 = m1;\n VERIFY_IS_APPROX(m3.rowwise() -= rv1, m1.rowwise() - rv1);\n \n \/\/ empty objects\n VERIFY_IS_APPROX(m1.block(0,0,0,cols).colwise().sum(), RowVectorType::Zero(cols));\n VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));\n \n \/\/ verify the const accessors exist\n const Scalar& ref_m1 = m.matrix().array().coeffRef(0);\n const Scalar& ref_m2 = m.matrix().array().coeffRef(0,0);\n const Scalar& ref_a1 = m.array().matrix().coeffRef(0);\n const Scalar& ref_a2 = m.array().matrix().coeffRef(0,0);\n VERIFY(&ref_a1 == &ref_m1);\n VERIFY(&ref_a2 == &ref_m2);\n}\n\ntemplate<typename MatrixType> void comparisons(const MatrixType& m)\n{\n using std::abs;\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n Index r = internal::random<Index>(0, rows-1),\n c = internal::random<Index>(0, cols-1);\n\n MatrixType m1 = MatrixType::Random(rows, cols),\n m2 = MatrixType::Random(rows, cols),\n m3(rows, cols);\n\n VERIFY(((m1.array() + Scalar(1)) > m1.array()).all());\n VERIFY(((m1.array() - Scalar(1)) < m1.array()).all());\n if (rows*cols>1)\n {\n m3 = m1;\n m3(r,c) += 1;\n VERIFY(! (m1.array() < m3.array()).all() );\n VERIFY(! (m1.array() > m3.array()).all() );\n }\n\n \/\/ comparisons to scalar\n VERIFY( (m1.array() != (m1(r,c)+1) ).any() );\n VERIFY( (m1.array() > (m1(r,c)-1) ).any() );\n VERIFY( (m1.array() < (m1(r,c)+1) ).any() );\n VERIFY( (m1.array() == m1(r,c) ).any() );\n\n \/\/ test Select\n VERIFY_IS_APPROX( (m1.array()<m2.array()).select(m1,m2), m1.cwiseMin(m2) );\n VERIFY_IS_APPROX( (m1.array()>m2.array()).select(m1,m2), m1.cwiseMax(m2) );\n Scalar mid = (m1.cwiseAbs().minCoeff() + m1.cwiseAbs().maxCoeff())\/Scalar(2);\n for (int j=0; j<cols; ++j)\n for (int i=0; i<rows; ++i)\n m3(i,j) = abs(m1(i,j))<mid ? 0 : m1(i,j);\n VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array())\n .select(MatrixType::Zero(rows,cols),m1), m3);\n \/\/ shorter versions:\n VERIFY_IS_APPROX( (m1.array().abs()<MatrixType::Constant(rows,cols,mid).array())\n .select(0,m1), m3);\n VERIFY_IS_APPROX( (m1.array().abs()>=MatrixType::Constant(rows,cols,mid).array())\n .select(m1,0), m3);\n \/\/ even shorter version:\n VERIFY_IS_APPROX( (m1.array().abs()<mid).select(0,m1), m3);\n\n \/\/ count\n VERIFY(((m1.array().abs()+1)>RealScalar(0.1)).count() == rows*cols);\n\n typedef Matrix<typename MatrixType::Index, Dynamic, 1> VectorOfIndices;\n\n \/\/ TODO allows colwise\/rowwise for array\n VERIFY_IS_APPROX(((m1.array().abs()+1)>RealScalar(0.1)).matrix().colwise().count(), VectorOfIndices::Constant(cols,rows).transpose());\n VERIFY_IS_APPROX(((m1.array().abs()+1)>RealScalar(0.1)).matrix().rowwise().count(), VectorOfIndices::Constant(rows, cols));\n}\n\ntemplate<typename VectorType> void lpNorm(const VectorType& v)\n{\n using std::sqrt;\n VectorType u = VectorType::Random(v.size());\n\n VERIFY_IS_APPROX(u.template lpNorm<Infinity>(), u.cwiseAbs().maxCoeff());\n VERIFY_IS_APPROX(u.template lpNorm<1>(), u.cwiseAbs().sum());\n VERIFY_IS_APPROX(u.template lpNorm<2>(), sqrt(u.array().abs().square().sum()));\n VERIFY_IS_APPROX(numext::pow(u.template lpNorm<5>(), typename VectorType::RealScalar(5)), u.array().abs().pow(5).sum());\n}\n\ntemplate<typename MatrixType> void cwise_min_max(const MatrixType& m)\n{\n typedef typename MatrixType::Index Index;\n typedef typename MatrixType::Scalar Scalar;\n\n Index rows = m.rows();\n Index cols = m.cols();\n\n MatrixType m1 = MatrixType::Random(rows, cols);\n\n \/\/ min\/max with array\n Scalar maxM1 = m1.maxCoeff();\n Scalar minM1 = m1.minCoeff();\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1), m1.cwiseMin(MatrixType::Constant(rows,cols, minM1)));\n VERIFY_IS_APPROX(m1, m1.cwiseMin(MatrixType::Constant(rows,cols, maxM1)));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1), m1.cwiseMax(MatrixType::Constant(rows,cols, maxM1)));\n VERIFY_IS_APPROX(m1, m1.cwiseMax(MatrixType::Constant(rows,cols, minM1)));\n\n \/\/ min\/max with scalar input\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1), m1.cwiseMin( minM1));\n VERIFY_IS_APPROX(m1, m1.cwiseMin(maxM1));\n VERIFY_IS_APPROX(-m1, (-m1).cwiseMin(-minM1));\n VERIFY_IS_APPROX(-m1.array(), ((-m1).array().min)( -minM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1), m1.cwiseMax( maxM1));\n VERIFY_IS_APPROX(m1, m1.cwiseMax(minM1));\n VERIFY_IS_APPROX(-m1, (-m1).cwiseMax(-maxM1));\n VERIFY_IS_APPROX(-m1.array(), ((-m1).array().max)(-maxM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, minM1).array(), (m1.array().min)( minM1));\n VERIFY_IS_APPROX(m1.array(), (m1.array().min)( maxM1));\n\n VERIFY_IS_APPROX(MatrixType::Constant(rows,cols, maxM1).array(), (m1.array().max)( maxM1));\n VERIFY_IS_APPROX(m1.array(), (m1.array().max)( minM1));\n\n}\n\ntemplate<typename MatrixTraits> void resize(const MatrixTraits& t)\n{\n typedef typename MatrixTraits::Index Index;\n typedef typename MatrixTraits::Scalar Scalar;\n typedef Matrix<Scalar,Dynamic,Dynamic> MatrixType;\n typedef Array<Scalar,Dynamic,Dynamic> Array2DType;\n typedef Matrix<Scalar,Dynamic,1> VectorType;\n typedef Array<Scalar,Dynamic,1> Array1DType;\n\n Index rows = t.rows(), cols = t.cols();\n\n MatrixType m(rows,cols);\n VectorType v(rows);\n Array2DType a2(rows,cols);\n Array1DType a1(rows);\n\n m.array().resize(rows+1,cols+1);\n VERIFY(m.rows()==rows+1 && m.cols()==cols+1);\n a2.matrix().resize(rows+1,cols+1);\n VERIFY(a2.rows()==rows+1 && a2.cols()==cols+1);\n v.array().resize(cols);\n VERIFY(v.size()==cols);\n a1.matrix().resize(cols);\n VERIFY(a1.size()==cols);\n}\n\nvoid regression_bug_654()\n{\n ArrayXf a = RowVectorXf(3);\n VectorXf v = Array<float,1,Dynamic>(3);\n}\n\nvoid test_array_for_matrix()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( array_for_matrix(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( array_for_matrix(Matrix2f()) );\n CALL_SUBTEST_3( array_for_matrix(Matrix4d()) );\n CALL_SUBTEST_4( array_for_matrix(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_5( array_for_matrix(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( array_for_matrix(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( comparisons(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( comparisons(Matrix2f()) );\n CALL_SUBTEST_3( comparisons(Matrix4d()) );\n CALL_SUBTEST_5( comparisons(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( comparisons(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( cwise_min_max(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( cwise_min_max(Matrix2f()) );\n CALL_SUBTEST_3( cwise_min_max(Matrix4d()) );\n CALL_SUBTEST_5( cwise_min_max(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( cwise_min_max(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( lpNorm(Matrix<float, 1, 1>()) );\n CALL_SUBTEST_2( lpNorm(Vector2f()) );\n CALL_SUBTEST_7( lpNorm(Vector3d()) );\n CALL_SUBTEST_8( lpNorm(Vector4f()) );\n CALL_SUBTEST_5( lpNorm(VectorXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_4( lpNorm(VectorXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_4( resize(MatrixXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_5( resize(MatrixXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n CALL_SUBTEST_6( resize(MatrixXi(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );\n }\n CALL_SUBTEST_6( regression_bug_654() );\n}\n<|endoftext|>"} {"text":"<commit_before>#if !(defined MPL_ERROR_HPP)\n\n#define MPL_ERROR_HPP\n\n#include <exception>\n\nnamespace mpl {\n\n class error : public ::std::exception {\n protected:\n const char *const str;\n\n public:\n explicit error(const char *const str = \"unknown\") : str(str) {}\n\n ~error() override = default;\n\n const char *what() const noexcept override { return str; }\n };\n\n class invalid_rank : public error {\n public:\n invalid_rank() : error(\"invalid rank\") {}\n\n ~invalid_rank() override = default;\n };\n\n class invalid_tag : public error {\n public:\n invalid_tag() : error(\"invalid tag\") {}\n\n ~invalid_tag() override = default;\n };\n\n class invalid_size : public error {\n public:\n invalid_size() : error(\"invalid size\") {}\n\n ~invalid_size() override = default;\n };\n\n class invalid_count : public error {\n public:\n invalid_count() : error(\"invalid count\") {}\n\n ~invalid_count() override = default;\n };\n\n class invalid_layout : public error {\n public:\n invalid_layout() : error(\"invalid layout\") {}\n\n ~invalid_layout() override = default;\n };\n\n class invalid_dim : public error {\n public:\n invalid_dim() : error(\"invalid dimension\") {}\n\n ~invalid_dim() override = default;\n };\n\n class invalid_datatype_bound : public error {\n public:\n invalid_datatype_bound() : error(\"invalid datatype bound\") {}\n\n ~invalid_datatype_bound() override = default;\n };\n\n class invalid_argument : public error {\n public:\n invalid_argument() : error(\"invalid argument\") {}\n\n ~invalid_argument() override = default;\n };\n\n} \/\/ namespace mpl\n\n#endif\n<commit_msg>remove redundant code<commit_after>#if !(defined MPL_ERROR_HPP)\n\n#define MPL_ERROR_HPP\n\n#include <exception>\n\nnamespace mpl {\n\n class error : public ::std::exception {\n protected:\n const char *const str;\n\n public:\n explicit error(const char *const str = \"unknown\") : str(str) {}\n\n const char *what() const noexcept override { return str; }\n };\n\n class invalid_rank : public error {\n public:\n invalid_rank() : error(\"invalid rank\") {}\n };\n\n class invalid_tag : public error {\n public:\n invalid_tag() : error(\"invalid tag\") {}\n };\n\n class invalid_size : public error {\n public:\n invalid_size() : error(\"invalid size\") {}\n };\n\n class invalid_count : public error {\n public:\n invalid_count() : error(\"invalid count\") {}\n };\n\n class invalid_layout : public error {\n public:\n invalid_layout() : error(\"invalid layout\") {}\n };\n\n class invalid_dim : public error {\n public:\n invalid_dim() : error(\"invalid dimension\") {}\n };\n\n class invalid_datatype_bound : public error {\n public:\n invalid_datatype_bound() : error(\"invalid datatype bound\") {}\n };\n\n class invalid_argument : public error {\n public:\n invalid_argument() : error(\"invalid argument\") {}\n };\n\n} \/\/ namespace mpl\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* spin_box.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* http:\/\/www.godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur. *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n#include \"spin_box.h\"\n#include \"os\/input.h\"\n\nSize2 SpinBox::get_minimum_size() const {\n\n\tSize2 ms = line_edit->get_combined_minimum_size();\n\tms.width+=last_w;\n\treturn ms;\n}\n\n\nvoid SpinBox::_value_changed(double) {\n\n\tString value = String::num(get_val(),Math::step_decimals(get_step()));\n\tif (prefix!=\"\")\n\t\tvalue=prefix+\" \"+value;\n\tif (suffix!=\"\")\n\t\tvalue+=\" \"+suffix;\n\tline_edit->set_text(value);\n}\n\nvoid SpinBox::_text_entered(const String& p_string) {\n\n\t\/\/if (!p_string.is_numeric())\n\t\/\/\treturn;\n\tString value = p_string;\n\tif (prefix!=\"\" && p_string.begins_with(prefix))\n\t\tvalue = p_string.substr(prefix.length(), p_string.length()-prefix.length());\n\tset_val( value.to_double() );\n\t_value_changed(0);\n}\n\n\nLineEdit *SpinBox::get_line_edit() {\n\n\treturn line_edit;\n}\n\n\nvoid SpinBox::_line_edit_input(const InputEvent& p_event) {\n\n\n\n}\n\nvoid SpinBox::_range_click_timeout() {\n\n\tif (!drag.enabled && Input::get_singleton()->is_mouse_button_pressed(BUTTON_LEFT)) {\n\n\t\tbool up = get_local_mouse_pos().y < (get_size().height\/2);\n\t\tset_val( get_val() + (up?get_step():-get_step()));\n\n\t\tif (range_click_timer->is_one_shot()) {\n\t\t\trange_click_timer->set_wait_time(0.075);\n\t\t\trange_click_timer->set_one_shot(false);\n\t\t\trange_click_timer->start();\n\t\t}\n\n\t} else {\n\t\trange_click_timer->stop();\n\t}\n}\n\n\nvoid SpinBox::_input_event(const InputEvent& p_event) {\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && p_event.mouse_button.pressed) {\n\t\tconst InputEventMouseButton &mb=p_event.mouse_button;\n\n\t\tif (mb.doubleclick)\n\t\t\treturn; \/\/ignore doubleclick\n\n\t\tbool up = mb.y < (get_size().height\/2);\n\n\t\tswitch(mb.button_index) {\n\n\t\t\tcase BUTTON_LEFT: {\n\n\t\t\t\tset_val( get_val() + (up?get_step():-get_step()));\n\n\t\t\t\trange_click_timer->set_wait_time(0.6);\n\t\t\t\trange_click_timer->set_one_shot(true);\n\t\t\t\trange_click_timer->start();\n\n\t\t\t} break;\n\t\t\tcase BUTTON_RIGHT: {\n\n\t\t\t\tset_val( (up?get_max():get_min()) );\n\n\t\t\t} break;\n\t\t\tcase BUTTON_WHEEL_UP: {\n\n\t\t\t\tset_val( get_val() + get_step() );\n\t\t\t} break;\n\t\t\tcase BUTTON_WHEEL_DOWN: {\n\n\t\t\t\tset_val( get_val() - get_step() );\n\t\t\t} break;\n\t\t}\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && p_event.mouse_button.pressed && p_event.mouse_button.button_index==1) {\n\n\t\t\/\/set_default_cursor_shape(CURSOR_VSIZE);\n\t\tVector2 cpos = Vector2(p_event.mouse_button.x,p_event.mouse_button.y);\n\t\tdrag.mouse_pos=cpos;\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && !p_event.mouse_button.pressed && p_event.mouse_button.button_index==1) {\n\n\t\t\/\/set_default_cursor_shape(CURSOR_ARROW);\n\t\trange_click_timer->stop();\n\n\t\tif (drag.enabled) {\n\t\t\tdrag.enabled=false;\n\t\t\tInput::get_singleton()->set_mouse_mode(Input::MOUSE_MODE_VISIBLE);\n\t\t\twarp_mouse(drag.capture_pos);\n\t\t}\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_MOTION && p_event.mouse_button.button_mask&1) {\n\n\t\tVector2 cpos = Vector2(p_event.mouse_motion.x,p_event.mouse_motion.y);\n\t\tif (drag.enabled) {\n\n\t\t\tfloat diff_y = drag.mouse_pos.y - cpos.y;\n\t\t\tdiff_y=Math::pow(ABS(diff_y),1.8)*SGN(diff_y);\n\t\t\tdiff_y*=0.1;\n\n\t\t\tdrag.mouse_pos=cpos;\n\t\t\tdrag.base_val=CLAMP(drag.base_val + get_step() * diff_y, get_min(), get_max());\n\n\t\t\tset_val( drag.base_val);\n\n\t\t} else if (drag.mouse_pos.distance_to(cpos)>2) {\n\n\t\t\tInput::get_singleton()->set_mouse_mode(Input::MOUSE_MODE_CAPTURED);\n\t\t\tdrag.enabled=true;\n\t\t\tdrag.base_val=get_val();\n\t\t\tdrag.mouse_pos=cpos;\n\t\t\tdrag.capture_pos=cpos;\n\n\t\t}\n\t}\n}\n\n\nvoid SpinBox::_line_edit_focus_exit() {\n\n\t_text_entered(line_edit->get_text());\n}\n\nvoid SpinBox::_notification(int p_what) {\n\n\tif (p_what==NOTIFICATION_DRAW) {\n\n\t\tRef<Texture> updown = get_icon(\"updown\");\n\n\t\tint w = updown->get_width();\n\t\tif (w!=last_w) {\n\t\t\tline_edit->set_margin(MARGIN_RIGHT,w);\n\t\t\tlast_w=w;\n\t\t}\n\n\t\tRID ci = get_canvas_item();\n\t\tSize2i size = get_size();\n\n\t\tupdown->draw(ci,Point2i(size.width-updown->get_width(),(size.height-updown->get_height())\/2));\n\n\t} else if (p_what==NOTIFICATION_FOCUS_EXIT) {\n\n\n\t\t\/\/_value_changed(0);\n\t} else if (p_what==NOTIFICATION_ENTER_TREE) {\n\n\t\t_value_changed(0);\n\t}\n\n}\n\n\nvoid SpinBox::set_suffix(const String& p_suffix) {\n\n\tsuffix=p_suffix;\n\t_value_changed(0);\n\n}\n\nString SpinBox::get_suffix() const{\n\n\treturn suffix;\n}\n\n\nvoid SpinBox::set_prefix(const String& p_prefix) {\n\n\tprefix=p_prefix;\n\t_value_changed(0);\n\n}\n\nString SpinBox::get_prefix() const{\n\n\treturn prefix;\n}\n\nvoid SpinBox::set_editable(bool p_editable) {\n\tline_edit->set_editable(p_editable);\n}\n\nbool SpinBox::is_editable() const {\n\n\treturn line_edit->is_editable();\n}\n\nvoid SpinBox::_bind_methods() {\n\n\t\/\/ObjectTypeDB::bind_method(_MD(\"_value_changed\"),&SpinBox::_value_changed);\n\tObjectTypeDB::bind_method(_MD(\"_input_event\"),&SpinBox::_input_event);\n\tObjectTypeDB::bind_method(_MD(\"_text_entered\"),&SpinBox::_text_entered);\n\tObjectTypeDB::bind_method(_MD(\"set_suffix\",\"suffix\"),&SpinBox::set_suffix);\n\tObjectTypeDB::bind_method(_MD(\"get_suffix\"),&SpinBox::get_suffix);\n\tObjectTypeDB::bind_method(_MD(\"set_prefix\",\"prefix\"),&SpinBox::set_prefix);\n\tObjectTypeDB::bind_method(_MD(\"get_prefix\"),&SpinBox::get_prefix);\n\tObjectTypeDB::bind_method(_MD(\"set_editable\",\"editable\"),&SpinBox::set_editable);\n\tObjectTypeDB::bind_method(_MD(\"is_editable\"),&SpinBox::is_editable);\n\tObjectTypeDB::bind_method(_MD(\"_line_edit_focus_exit\"),&SpinBox::_line_edit_focus_exit);\n\tObjectTypeDB::bind_method(_MD(\"get_line_edit\"),&SpinBox::get_line_edit);\n\tObjectTypeDB::bind_method(_MD(\"_line_edit_input\"),&SpinBox::_line_edit_input);\n\tObjectTypeDB::bind_method(_MD(\"_range_click_timeout\"),&SpinBox::_range_click_timeout);\n\n\n\tADD_PROPERTY(PropertyInfo(Variant::BOOL,\"editable\"),_SCS(\"set_editable\"),_SCS(\"is_editable\"));\n\tADD_PROPERTY(PropertyInfo(Variant::STRING,\"prefix\"),_SCS(\"set_prefix\"),_SCS(\"get_prefix\"));\n\tADD_PROPERTY(PropertyInfo(Variant::STRING,\"suffix\"),_SCS(\"set_suffix\"),_SCS(\"get_suffix\"));\n\n\n}\n\nSpinBox::SpinBox() {\n\n\tlast_w = 0;\n\tline_edit = memnew( LineEdit );\n\tadd_child(line_edit);\n\n\tline_edit->set_area_as_parent_rect();\n\t\/\/connect(\"value_changed\",this,\"_value_changed\");\n\tline_edit->connect(\"text_entered\",this,\"_text_entered\",Vector<Variant>(),CONNECT_DEFERRED);\n\tline_edit->connect(\"focus_exit\",this,\"_line_edit_focus_exit\",Vector<Variant>(),CONNECT_DEFERRED);\n\tline_edit->connect(\"input_event\",this,\"_line_edit_input\");\n\tdrag.enabled=false;\n\n\trange_click_timer = memnew( Timer );\n\trange_click_timer->connect(\"timeout\",this,\"_range_click_timeout\");\n\tadd_child(range_click_timer);\n}\n<commit_msg>Prevent Spinbox value update while not focused or disabled<commit_after>\/*************************************************************************\/\n\/* spin_box.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* http:\/\/www.godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2016 Juan Linietsky, Ariel Manzur. *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n#include \"spin_box.h\"\n#include \"os\/input.h\"\n\nSize2 SpinBox::get_minimum_size() const {\n\n\tSize2 ms = line_edit->get_combined_minimum_size();\n\tms.width+=last_w;\n\treturn ms;\n}\n\n\nvoid SpinBox::_value_changed(double) {\n\n\tString value = String::num(get_val(),Math::step_decimals(get_step()));\n\tif (prefix!=\"\")\n\t\tvalue=prefix+\" \"+value;\n\tif (suffix!=\"\")\n\t\tvalue+=\" \"+suffix;\n\tline_edit->set_text(value);\n}\n\nvoid SpinBox::_text_entered(const String& p_string) {\n\n\t\/\/if (!p_string.is_numeric())\n\t\/\/\treturn;\n\tString value = p_string;\n\tif (prefix!=\"\" && p_string.begins_with(prefix))\n\t\tvalue = p_string.substr(prefix.length(), p_string.length()-prefix.length());\n\tset_val( value.to_double() );\n\t_value_changed(0);\n}\n\n\nLineEdit *SpinBox::get_line_edit() {\n\n\treturn line_edit;\n}\n\n\nvoid SpinBox::_line_edit_input(const InputEvent& p_event) {\n\n\n\n}\n\nvoid SpinBox::_range_click_timeout() {\n\n\tif (!drag.enabled && Input::get_singleton()->is_mouse_button_pressed(BUTTON_LEFT)) {\n\n\t\tbool up = get_local_mouse_pos().y < (get_size().height\/2);\n\t\tset_val( get_val() + (up?get_step():-get_step()));\n\n\t\tif (range_click_timer->is_one_shot()) {\n\t\t\trange_click_timer->set_wait_time(0.075);\n\t\t\trange_click_timer->set_one_shot(false);\n\t\t\trange_click_timer->start();\n\t\t}\n\n\t} else {\n\t\trange_click_timer->stop();\n\t}\n}\n\n\nvoid SpinBox::_input_event(const InputEvent& p_event) {\n\n\tif (!is_editable()) {\n\t\treturn;\n\t}\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && p_event.mouse_button.pressed) {\n\t\tconst InputEventMouseButton &mb=p_event.mouse_button;\n\n\t\tif (mb.doubleclick)\n\t\t\treturn; \/\/ignore doubleclick\n\n\t\tbool up = mb.y < (get_size().height\/2);\n\n\t\tswitch(mb.button_index) {\n\n\t\t\tcase BUTTON_LEFT: {\n\n\t\t\t\tset_val( get_val() + (up?get_step():-get_step()));\n\n\t\t\t\trange_click_timer->set_wait_time(0.6);\n\t\t\t\trange_click_timer->set_one_shot(true);\n\t\t\t\trange_click_timer->start();\n\n\t\t\t\tline_edit->grab_focus();\n\t\t\t} break;\n\t\t\tcase BUTTON_RIGHT: {\n\n\t\t\t\tset_val( (up?get_max():get_min()) );\n\t\t\t\tline_edit->grab_focus();\n\t\t\t} break;\n\t\t\tcase BUTTON_WHEEL_UP: {\n\t\t\t\tif (line_edit->has_focus()) {\n\t\t\t\t\tset_val( get_val() + get_step() );\n\t\t\t\t\taccept_event();\n\t\t\t\t}\n\t\t\t} break;\n\t\t\tcase BUTTON_WHEEL_DOWN: {\n\t\t\t\tif (line_edit->has_focus()) {\n\t\t\t\t\tset_val( get_val() - get_step() );\n\t\t\t\t\taccept_event();\n\t\t\t\t}\n\t\t\t} break;\n\t\t}\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && p_event.mouse_button.pressed && p_event.mouse_button.button_index==1) {\n\n\t\t\/\/set_default_cursor_shape(CURSOR_VSIZE);\n\t\tVector2 cpos = Vector2(p_event.mouse_button.x,p_event.mouse_button.y);\n\t\tdrag.mouse_pos=cpos;\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_BUTTON && !p_event.mouse_button.pressed && p_event.mouse_button.button_index==1) {\n\n\t\t\/\/set_default_cursor_shape(CURSOR_ARROW);\n\t\trange_click_timer->stop();\n\n\t\tif (drag.enabled) {\n\t\t\tdrag.enabled=false;\n\t\t\tInput::get_singleton()->set_mouse_mode(Input::MOUSE_MODE_VISIBLE);\n\t\t\twarp_mouse(drag.capture_pos);\n\t\t}\n\t}\n\n\tif (p_event.type==InputEvent::MOUSE_MOTION && p_event.mouse_button.button_mask&1) {\n\n\t\tVector2 cpos = Vector2(p_event.mouse_motion.x,p_event.mouse_motion.y);\n\t\tif (drag.enabled) {\n\n\t\t\tfloat diff_y = drag.mouse_pos.y - cpos.y;\n\t\t\tdiff_y=Math::pow(ABS(diff_y),1.8)*SGN(diff_y);\n\t\t\tdiff_y*=0.1;\n\n\t\t\tdrag.mouse_pos=cpos;\n\t\t\tdrag.base_val=CLAMP(drag.base_val + get_step() * diff_y, get_min(), get_max());\n\n\t\t\tset_val( drag.base_val);\n\n\t\t} else if (drag.mouse_pos.distance_to(cpos)>2) {\n\n\t\t\tInput::get_singleton()->set_mouse_mode(Input::MOUSE_MODE_CAPTURED);\n\t\t\tdrag.enabled=true;\n\t\t\tdrag.base_val=get_val();\n\t\t\tdrag.mouse_pos=cpos;\n\t\t\tdrag.capture_pos=cpos;\n\n\t\t}\n\t}\n}\n\n\nvoid SpinBox::_line_edit_focus_exit() {\n\n\t_text_entered(line_edit->get_text());\n}\n\nvoid SpinBox::_notification(int p_what) {\n\n\tif (p_what==NOTIFICATION_DRAW) {\n\n\t\tRef<Texture> updown = get_icon(\"updown\");\n\n\t\tint w = updown->get_width();\n\t\tif (w!=last_w) {\n\t\t\tline_edit->set_margin(MARGIN_RIGHT,w);\n\t\t\tlast_w=w;\n\t\t}\n\n\t\tRID ci = get_canvas_item();\n\t\tSize2i size = get_size();\n\n\t\tupdown->draw(ci,Point2i(size.width-updown->get_width(),(size.height-updown->get_height())\/2));\n\n\t} else if (p_what==NOTIFICATION_FOCUS_EXIT) {\n\n\n\t\t\/\/_value_changed(0);\n\t} else if (p_what==NOTIFICATION_ENTER_TREE) {\n\n\t\t_value_changed(0);\n\t}\n\n}\n\n\nvoid SpinBox::set_suffix(const String& p_suffix) {\n\n\tsuffix=p_suffix;\n\t_value_changed(0);\n\n}\n\nString SpinBox::get_suffix() const{\n\n\treturn suffix;\n}\n\n\nvoid SpinBox::set_prefix(const String& p_prefix) {\n\n\tprefix=p_prefix;\n\t_value_changed(0);\n\n}\n\nString SpinBox::get_prefix() const{\n\n\treturn prefix;\n}\n\nvoid SpinBox::set_editable(bool p_editable) {\n\tline_edit->set_editable(p_editable);\n}\n\nbool SpinBox::is_editable() const {\n\n\treturn line_edit->is_editable();\n}\n\nvoid SpinBox::_bind_methods() {\n\n\t\/\/ObjectTypeDB::bind_method(_MD(\"_value_changed\"),&SpinBox::_value_changed);\n\tObjectTypeDB::bind_method(_MD(\"_input_event\"),&SpinBox::_input_event);\n\tObjectTypeDB::bind_method(_MD(\"_text_entered\"),&SpinBox::_text_entered);\n\tObjectTypeDB::bind_method(_MD(\"set_suffix\",\"suffix\"),&SpinBox::set_suffix);\n\tObjectTypeDB::bind_method(_MD(\"get_suffix\"),&SpinBox::get_suffix);\n\tObjectTypeDB::bind_method(_MD(\"set_prefix\",\"prefix\"),&SpinBox::set_prefix);\n\tObjectTypeDB::bind_method(_MD(\"get_prefix\"),&SpinBox::get_prefix);\n\tObjectTypeDB::bind_method(_MD(\"set_editable\",\"editable\"),&SpinBox::set_editable);\n\tObjectTypeDB::bind_method(_MD(\"is_editable\"),&SpinBox::is_editable);\n\tObjectTypeDB::bind_method(_MD(\"_line_edit_focus_exit\"),&SpinBox::_line_edit_focus_exit);\n\tObjectTypeDB::bind_method(_MD(\"get_line_edit\"),&SpinBox::get_line_edit);\n\tObjectTypeDB::bind_method(_MD(\"_line_edit_input\"),&SpinBox::_line_edit_input);\n\tObjectTypeDB::bind_method(_MD(\"_range_click_timeout\"),&SpinBox::_range_click_timeout);\n\n\n\tADD_PROPERTY(PropertyInfo(Variant::BOOL,\"editable\"),_SCS(\"set_editable\"),_SCS(\"is_editable\"));\n\tADD_PROPERTY(PropertyInfo(Variant::STRING,\"prefix\"),_SCS(\"set_prefix\"),_SCS(\"get_prefix\"));\n\tADD_PROPERTY(PropertyInfo(Variant::STRING,\"suffix\"),_SCS(\"set_suffix\"),_SCS(\"get_suffix\"));\n\n\n}\n\nSpinBox::SpinBox() {\n\n\tlast_w = 0;\n\tline_edit = memnew( LineEdit );\n\tadd_child(line_edit);\n\n\tline_edit->set_area_as_parent_rect();\n\t\/\/connect(\"value_changed\",this,\"_value_changed\");\n\tline_edit->connect(\"text_entered\",this,\"_text_entered\",Vector<Variant>(),CONNECT_DEFERRED);\n\tline_edit->connect(\"focus_exit\",this,\"_line_edit_focus_exit\",Vector<Variant>(),CONNECT_DEFERRED);\n\tline_edit->connect(\"input_event\",this,\"_line_edit_input\");\n\tdrag.enabled=false;\n\n\trange_click_timer = memnew( Timer );\n\trange_click_timer->connect(\"timeout\",this,\"_range_click_timeout\");\n\tadd_child(range_click_timer);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstring>\n#include \"com\/centreon\/broker\/bam\/impact_values.hh\"\n#include \"com\/centreon\/broker\/bam\/kpi_service.hh\"\n#include \"com\/centreon\/broker\/bam\/kpi_status.hh\"\n#include \"com\/centreon\/broker\/bam\/stream.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/neb\/service_status.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::bam;\n\n\/**\n * Default constructor.\n *\/\nkpi_service::kpi_service()\n : _acknowledged(false),\n _downtimed(false),\n _host_id(0),\n _service_id(0),\n _state_hard(0),\n _state_soft(0),\n _state_type(0) {\n for (unsigned int i(0); i < sizeof(_impacts) \/ sizeof(*_impacts); ++i)\n _impacts[i] = 0.0;\n}\n\n\/**\n * Copy constructor.\n *\n * @param[in] right Object to copy.\n *\/\nkpi_service::kpi_service(kpi_service const& right)\n : service_listener(right), kpi(right) {\n _internal_copy(right);\n}\n\n\/**\n * Destructor.\n *\/\nkpi_service::~kpi_service() {}\n\n\/**\n * Assignment operator.\n *\n * @param[in] right Object to copy.\n *\n * @return This object.\n *\/\nkpi_service& kpi_service::operator=(kpi_service const& right) {\n if (this != &right) {\n service_listener::operator=(right);\n kpi::operator=(right);\n _internal_copy(right);\n }\n return (*this);\n}\n\n\/**\n * Unused callback.\n *\n * @param[in] child Unused.\n * @param[out] visitor Unused.\n *\n * @return True.\n *\/\nbool kpi_service::child_has_update(computable* child, stream* visitor) {\n (void)child;\n (void)visitor;\n return true;\n}\n\n\/**\n * Get host ID.\n *\n * @return Host ID.\n *\/\nunsigned int kpi_service::get_host_id() const {\n return (_host_id);\n}\n\n\/**\n * Get the impact applied when service is CRITICAL.\n *\n * @return The impact applied when service is CRITICAL.\n *\/\ndouble kpi_service::get_impact_critical() const {\n return (_impacts[2]);\n}\n\n\/**\n * Get the impact applied when service is UNKNOWN.\n *\n * @return The impact applied when service is UNKNOWN.\n *\/\ndouble kpi_service::get_impact_unknown() const {\n return (_impacts[3]);\n}\n\n\/**\n * Get the impact applied when service is WARNING.\n *\n * @return The impact applied when service is WARNING.\n *\/\ndouble kpi_service::get_impact_warning() const {\n return (_impacts[1]);\n}\n\n\/**\n * Get the service ID.\n *\n * @return Service ID.\n *\/\nunsigned int kpi_service::get_service_id() const {\n return (_service_id);\n}\n\n\/**\n * Get the hard state of the service.\n *\n * @return Hard state of the service.\n *\/\nshort kpi_service::get_state_hard() const {\n return (_state_hard);\n}\n\n\/**\n * Get the soft state of the service.\n *\n * @return Soft state of the service.\n *\/\nshort kpi_service::get_state_soft() const {\n return (_state_soft);\n}\n\n\/**\n * Get current state type.\n *\n * @return State type.\n *\/\nshort kpi_service::get_state_type() const {\n return (_state_type);\n}\n\n\/**\n * Compute impact implied by the hard service state.\n *\n * @param[out] impact Impacts implied by the hard service state.\n *\/\nvoid kpi_service::impact_hard(impact_values& impact) {\n _fill_impact(impact, _state_hard);\n return ;\n}\n\n\/**\n * Compute impact implied by the soft service state.\n *\n * @param[out] impact Impacts implied by the soft service state.\n *\/\nvoid kpi_service::impact_soft(impact_values& impact) {\n _fill_impact(impact, _state_soft);\n return ;\n}\n\n\/**\n * Check if service is in downtime.\n *\n * @return True if the service is in downtime.\n *\/\nbool kpi_service::in_downtime() const {\n return (_downtimed);\n}\n\n\/**\n * Check if service is acknowledged.\n *\n * @return True if the service is acknowledged.\n *\/\nbool kpi_service::is_acknowledged() const {\n return (_acknowledged);\n}\n\n\/**\n * Service got updated !\n *\n * @param[in] status Service status.\n * @param[out] visitor Object that will receive events.\n *\/\nvoid kpi_service::service_update(\n misc::shared_ptr<neb::service_status> const& status,\n stream* visitor) {\n if (!status.isNull()\n && (status->host_id == _host_id)\n && (status->service_id == _service_id)) {\n \/\/ Log.\n logging::debug(logging::low) << \"BAM: updating KPI of service (\"\n << status->host_id << \", \" << status->service_id << \")\";\n\n \/\/ Update information.\n _acknowledged = status->problem_has_been_acknowledged;\n _downtimed = status->scheduled_downtime_depth;\n _state_hard = status->last_hard_state;\n _state_soft = status->current_state;\n _state_type = status->state_type;\n\n \/\/ Generate status event.\n visit(visitor);\n\n \/\/ Propagate change.\n propagate_update(visitor);\n }\n return ;\n}\n\n\/**\n * Set service as acknowledged.\n *\n * @param[in] acknowledged Acknowledged flag.\n *\/\nvoid kpi_service::set_acknowledged(bool acknowledged) {\n _acknowledged = acknowledged;\n return ;\n}\n\n\/**\n * Set service as downtimed.\n *\n * @param[in] downtimed Downtimed flag.\n *\/\nvoid kpi_service::set_downtimed(bool downtimed) {\n _downtimed = downtimed;\n return ;\n}\n\n\/**\n * Set host ID.\n *\n * @param[in] host_id Host ID.\n *\/\nvoid kpi_service::set_host_id(unsigned int host_id) {\n _host_id = host_id;\n return ;\n}\n\n\/**\n * Set impact implied when service is CRITICAL.\n *\n * @param[in] impact Impact if service is CRITICAL.\n *\/\nvoid kpi_service::set_impact_critical(double impact) {\n _impacts[2] = impact;\n return ;\n}\n\n\/**\n * Set impact implied when service is UNKNOWN.\n *\n * @param[in] impact Impact if service is UNKNOWN.\n *\/\nvoid kpi_service::set_impact_unknown(double impact) {\n _impacts[3] = impact;\n return ;\n}\n\n\/**\n * Set impact implied when service is WARNING.\n *\n * @param[in] impact Impact if service is WARNING.\n *\/\nvoid kpi_service::set_impact_warning(double impact) {\n _impacts[1] = impact;\n return ;\n}\n\n\/**\n * Set service ID.\n *\n * @param[in] service_id Service ID.\n *\/\nvoid kpi_service::set_service_id(unsigned int service_id) {\n _service_id = service_id;\n return ;\n}\n\n\/**\n * Set hard state.\n *\n * @param[in] state Service hard state.\n *\/\nvoid kpi_service::set_state_hard(short state) {\n _state_hard = state;\n return ;\n}\n\n\/**\n * Set soft state.\n *\n * @param[in] state Service soft state.\n *\/\nvoid kpi_service::set_state_soft(short state) {\n _state_soft = state;\n return ;\n}\n\n\/**\n * Set state type.\n *\n * @param[in] type Current state type.\n *\/\nvoid kpi_service::set_state_type(short type) {\n _state_type = type;\n return ;\n}\n\n\/**\n * Visit service KPI.\n *\n * @param[out] visitor Object that will receive status.\n *\/\nvoid kpi_service::visit(stream* visitor) {\n if (visitor) {\n \/\/ Get information.\n impact_values hard_values;\n impact_values soft_values;\n impact_hard(hard_values);\n impact_soft(soft_values);\n\n \/\/ Generate status event.\n misc::shared_ptr<kpi_status> status(new kpi_status);\n status->kpi_id = _id;\n status->level_acknowledgement_hard = hard_values.get_acknowledgement();\n status->level_acknowledgement_soft = soft_values.get_acknowledgement();\n status->level_downtime_hard = hard_values.get_downtime();\n status->level_downtime_soft = soft_values.get_downtime();\n status->level_nominal_hard = hard_values.get_nominal();\n status->level_nominal_soft = soft_values.get_nominal();\n status->state_hard = _state_hard;\n status->state_soft = _state_soft;\n visitor->write(status.staticCast<io::data>());\n\n \/\/ If no event was cached, create one.\n if (_event.isNull()) {\n _open_new_event();\n return ;\n }\n\n \/\/ If the status was changed, close the current event, write it\n \/\/ and create a new one\n if (_state_hard != _event->status) {\n _event->duration = std::difftime(time(NULL), _event->start_time);\n visitor->write(_event.staticCast<io::data>());\n _open_new_event();\n }\n return;\n }\n}\n\n\/**\n * Fill impact values from a state.\n *\n * @param[out] impact Impacts of the state.\n * @param[in] state Service state.\n *\/\nvoid kpi_service::_fill_impact(impact_values& impact, short state) {\n if ((state < 0)\n || (static_cast<size_t>(state)\n >= (sizeof(_impacts) \/ sizeof(*_impacts))))\n throw (exceptions::msg()\n << \"BAM: could not get impact introduced by state \"\n << state);\n double nominal(_impacts[state]);\n impact.set_nominal(nominal);\n impact.set_acknowledgement(_acknowledged ? nominal : 0.0);\n impact.set_downtime(_downtimed ? nominal : 0.0);\n return ;\n}\n\n\/**\n * Copy internal data members.\n *\n * @param[in] right Object to copy.\n *\/\nvoid kpi_service::_internal_copy(kpi_service const& right) {\n _acknowledged = right._acknowledged;\n _downtimed = right._downtimed;\n _host_id = right._host_id;\n memcpy(_impacts, right._impacts, sizeof(_impacts));\n _service_id = right._service_id;\n _state_hard = right._state_hard;\n _state_soft = right._state_soft;\n _state_type = right._state_type;\n return ;\n}\n\n\/**\n * Open a new event for this kpi.\n *\/\nvoid kpi_service::_open_new_event() {\n _event = new(kpi_event);\n\n _event->kpi_id = _id;\n _event->start_time = time(NULL);\n _event->status = _state_hard;\n}\n<commit_msg>BAM: Add downtime management for kpi event in kpi_service.<commit_after>\/*\n** Copyright 2014 Merethis\n**\n** This file is part of Centreon Broker.\n**\n** Centreon Broker is free software: you can redistribute it and\/or\n** modify it under the terms of the GNU General Public License version 2\n** as published by the Free Software Foundation.\n**\n** Centreon Broker is distributed in the hope that it will be useful,\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n** General Public License for more details.\n**\n** You should have received a copy of the GNU General Public License\n** along with Centreon Broker. If not, see\n** <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <cstring>\n#include \"com\/centreon\/broker\/bam\/impact_values.hh\"\n#include \"com\/centreon\/broker\/bam\/kpi_service.hh\"\n#include \"com\/centreon\/broker\/bam\/kpi_status.hh\"\n#include \"com\/centreon\/broker\/bam\/stream.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n#include \"com\/centreon\/broker\/neb\/service_status.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::bam;\n\n\/**\n * Default constructor.\n *\/\nkpi_service::kpi_service()\n : _acknowledged(false),\n _downtimed(false),\n _host_id(0),\n _service_id(0),\n _state_hard(0),\n _state_soft(0),\n _state_type(0) {\n for (unsigned int i(0); i < sizeof(_impacts) \/ sizeof(*_impacts); ++i)\n _impacts[i] = 0.0;\n}\n\n\/**\n * Copy constructor.\n *\n * @param[in] right Object to copy.\n *\/\nkpi_service::kpi_service(kpi_service const& right)\n : service_listener(right), kpi(right) {\n _internal_copy(right);\n}\n\n\/**\n * Destructor.\n *\/\nkpi_service::~kpi_service() {}\n\n\/**\n * Assignment operator.\n *\n * @param[in] right Object to copy.\n *\n * @return This object.\n *\/\nkpi_service& kpi_service::operator=(kpi_service const& right) {\n if (this != &right) {\n service_listener::operator=(right);\n kpi::operator=(right);\n _internal_copy(right);\n }\n return (*this);\n}\n\n\/**\n * Unused callback.\n *\n * @param[in] child Unused.\n * @param[out] visitor Unused.\n *\n * @return True.\n *\/\nbool kpi_service::child_has_update(computable* child, stream* visitor) {\n (void)child;\n (void)visitor;\n return true;\n}\n\n\/**\n * Get host ID.\n *\n * @return Host ID.\n *\/\nunsigned int kpi_service::get_host_id() const {\n return (_host_id);\n}\n\n\/**\n * Get the impact applied when service is CRITICAL.\n *\n * @return The impact applied when service is CRITICAL.\n *\/\ndouble kpi_service::get_impact_critical() const {\n return (_impacts[2]);\n}\n\n\/**\n * Get the impact applied when service is UNKNOWN.\n *\n * @return The impact applied when service is UNKNOWN.\n *\/\ndouble kpi_service::get_impact_unknown() const {\n return (_impacts[3]);\n}\n\n\/**\n * Get the impact applied when service is WARNING.\n *\n * @return The impact applied when service is WARNING.\n *\/\ndouble kpi_service::get_impact_warning() const {\n return (_impacts[1]);\n}\n\n\/**\n * Get the service ID.\n *\n * @return Service ID.\n *\/\nunsigned int kpi_service::get_service_id() const {\n return (_service_id);\n}\n\n\/**\n * Get the hard state of the service.\n *\n * @return Hard state of the service.\n *\/\nshort kpi_service::get_state_hard() const {\n return (_state_hard);\n}\n\n\/**\n * Get the soft state of the service.\n *\n * @return Soft state of the service.\n *\/\nshort kpi_service::get_state_soft() const {\n return (_state_soft);\n}\n\n\/**\n * Get current state type.\n *\n * @return State type.\n *\/\nshort kpi_service::get_state_type() const {\n return (_state_type);\n}\n\n\/**\n * Compute impact implied by the hard service state.\n *\n * @param[out] impact Impacts implied by the hard service state.\n *\/\nvoid kpi_service::impact_hard(impact_values& impact) {\n _fill_impact(impact, _state_hard);\n return ;\n}\n\n\/**\n * Compute impact implied by the soft service state.\n *\n * @param[out] impact Impacts implied by the soft service state.\n *\/\nvoid kpi_service::impact_soft(impact_values& impact) {\n _fill_impact(impact, _state_soft);\n return ;\n}\n\n\/**\n * Check if service is in downtime.\n *\n * @return True if the service is in downtime.\n *\/\nbool kpi_service::in_downtime() const {\n return (_downtimed);\n}\n\n\/**\n * Check if service is acknowledged.\n *\n * @return True if the service is acknowledged.\n *\/\nbool kpi_service::is_acknowledged() const {\n return (_acknowledged);\n}\n\n\/**\n * Service got updated !\n *\n * @param[in] status Service status.\n * @param[out] visitor Object that will receive events.\n *\/\nvoid kpi_service::service_update(\n misc::shared_ptr<neb::service_status> const& status,\n stream* visitor) {\n if (!status.isNull()\n && (status->host_id == _host_id)\n && (status->service_id == _service_id)) {\n \/\/ Log.\n logging::debug(logging::low) << \"BAM: updating KPI of service (\"\n << status->host_id << \", \" << status->service_id << \")\";\n\n \/\/ Update information.\n _acknowledged = status->problem_has_been_acknowledged;\n _downtimed = status->scheduled_downtime_depth;\n _state_hard = status->last_hard_state;\n _state_soft = status->current_state;\n _state_type = status->state_type;\n\n \/\/ Generate status event.\n visit(visitor);\n\n \/\/ Propagate change.\n propagate_update(visitor);\n }\n return ;\n}\n\n\/**\n * Set service as acknowledged.\n *\n * @param[in] acknowledged Acknowledged flag.\n *\/\nvoid kpi_service::set_acknowledged(bool acknowledged) {\n _acknowledged = acknowledged;\n return ;\n}\n\n\/**\n * Set service as downtimed.\n *\n * @param[in] downtimed Downtimed flag.\n *\/\nvoid kpi_service::set_downtimed(bool downtimed) {\n _downtimed = downtimed;\n return ;\n}\n\n\/**\n * Set host ID.\n *\n * @param[in] host_id Host ID.\n *\/\nvoid kpi_service::set_host_id(unsigned int host_id) {\n _host_id = host_id;\n return ;\n}\n\n\/**\n * Set impact implied when service is CRITICAL.\n *\n * @param[in] impact Impact if service is CRITICAL.\n *\/\nvoid kpi_service::set_impact_critical(double impact) {\n _impacts[2] = impact;\n return ;\n}\n\n\/**\n * Set impact implied when service is UNKNOWN.\n *\n * @param[in] impact Impact if service is UNKNOWN.\n *\/\nvoid kpi_service::set_impact_unknown(double impact) {\n _impacts[3] = impact;\n return ;\n}\n\n\/**\n * Set impact implied when service is WARNING.\n *\n * @param[in] impact Impact if service is WARNING.\n *\/\nvoid kpi_service::set_impact_warning(double impact) {\n _impacts[1] = impact;\n return ;\n}\n\n\/**\n * Set service ID.\n *\n * @param[in] service_id Service ID.\n *\/\nvoid kpi_service::set_service_id(unsigned int service_id) {\n _service_id = service_id;\n return ;\n}\n\n\/**\n * Set hard state.\n *\n * @param[in] state Service hard state.\n *\/\nvoid kpi_service::set_state_hard(short state) {\n _state_hard = state;\n return ;\n}\n\n\/**\n * Set soft state.\n *\n * @param[in] state Service soft state.\n *\/\nvoid kpi_service::set_state_soft(short state) {\n _state_soft = state;\n return ;\n}\n\n\/**\n * Set state type.\n *\n * @param[in] type Current state type.\n *\/\nvoid kpi_service::set_state_type(short type) {\n _state_type = type;\n return ;\n}\n\n\/**\n * Visit service KPI.\n *\n * @param[out] visitor Object that will receive status.\n *\/\nvoid kpi_service::visit(stream* visitor) {\n if (visitor) {\n \/\/ Get information.\n impact_values hard_values;\n impact_values soft_values;\n impact_hard(hard_values);\n impact_soft(soft_values);\n\n \/\/ Generate status event.\n misc::shared_ptr<kpi_status> status(new kpi_status);\n status->kpi_id = _id;\n status->level_acknowledgement_hard = hard_values.get_acknowledgement();\n status->level_acknowledgement_soft = soft_values.get_acknowledgement();\n status->level_downtime_hard = hard_values.get_downtime();\n status->level_downtime_soft = soft_values.get_downtime();\n status->level_nominal_hard = hard_values.get_nominal();\n status->level_nominal_soft = soft_values.get_nominal();\n status->state_hard = _state_hard;\n status->state_soft = _state_soft;\n visitor->write(status.staticCast<io::data>());\n\n \/\/ If no event was cached, create one.\n if (_event.isNull()) {\n _open_new_event();\n return ;\n }\n\n \/\/ If the status was changed, close the current event, write it\n \/\/ and create a new one\n if (_state_hard != _event->status ||\n _downtimed != _event->in_downtime) {\n _event->duration = std::difftime(time(NULL), _event->start_time);\n visitor->write(_event.staticCast<io::data>());\n _open_new_event();\n }\n return;\n }\n}\n\n\/**\n * Fill impact values from a state.\n *\n * @param[out] impact Impacts of the state.\n * @param[in] state Service state.\n *\/\nvoid kpi_service::_fill_impact(impact_values& impact, short state) {\n if ((state < 0)\n || (static_cast<size_t>(state)\n >= (sizeof(_impacts) \/ sizeof(*_impacts))))\n throw (exceptions::msg()\n << \"BAM: could not get impact introduced by state \"\n << state);\n double nominal(_impacts[state]);\n impact.set_nominal(nominal);\n impact.set_acknowledgement(_acknowledged ? nominal : 0.0);\n impact.set_downtime(_downtimed ? nominal : 0.0);\n return ;\n}\n\n\/**\n * Copy internal data members.\n *\n * @param[in] right Object to copy.\n *\/\nvoid kpi_service::_internal_copy(kpi_service const& right) {\n _acknowledged = right._acknowledged;\n _downtimed = right._downtimed;\n _host_id = right._host_id;\n memcpy(_impacts, right._impacts, sizeof(_impacts));\n _service_id = right._service_id;\n _state_hard = right._state_hard;\n _state_soft = right._state_soft;\n _state_type = right._state_type;\n return ;\n}\n\n\/**\n * Open a new event for this kpi.\n *\/\nvoid kpi_service::_open_new_event() {\n _event = new(kpi_event);\n\n _event->kpi_id = _id;\n _event->start_time = time(NULL);\n _event->status = _state_hard;\n _event->in_downtime = _downtimed;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"LogicalDevice.hpp\"\r\n\r\n#include \"Graphics\/Graphics.hpp\"\r\n#include \"Instance.hpp\"\r\n#include \"PhysicalDevice.hpp\"\r\n#include \"Surface.hpp\"\r\n\r\nnamespace acid {\r\nconst std::vector<const char *> LogicalDevice::DeviceExtensions = {VK_KHR_SWAPCHAIN_EXTENSION_NAME}; \/\/ VK_KHR_PUSH_DESCRIPTOR_EXTENSION_NAME\r\n\r\nLogicalDevice::LogicalDevice(const Instance *instance, const PhysicalDevice *physicalDevice, const Surface *surface) :\r\n\tinstance(instance),\r\n\tphysicalDevice(physicalDevice),\r\n\tsurface(surface) {\r\n\tCreateQueueIndices();\r\n\tCreateLogicalDevice();\r\n}\r\n\r\nLogicalDevice::~LogicalDevice() {\r\n\tGraphics::CheckVk(vkDeviceWaitIdle(logicalDevice));\r\n\r\n\tvkDestroyDevice(logicalDevice, nullptr);\r\n}\r\n\r\nvoid LogicalDevice::CreateQueueIndices() {\r\n\tuint32_t deviceQueueFamilyPropertyCount;\r\n\tvkGetPhysicalDeviceQueueFamilyProperties(*physicalDevice, &deviceQueueFamilyPropertyCount, nullptr);\r\n\tstd::vector<VkQueueFamilyProperties> deviceQueueFamilyProperties(deviceQueueFamilyPropertyCount);\r\n\tvkGetPhysicalDeviceQueueFamilyProperties(*physicalDevice, &deviceQueueFamilyPropertyCount, deviceQueueFamilyProperties.data());\r\n\r\n\tstd::optional<uint32_t> graphicsFamily, presentFamily, computeFamily, transferFamily;\r\n\r\n\tfor (uint32_t i = 0; i < deviceQueueFamilyPropertyCount; i++) {\r\n\t\t\/\/ Check for graphics support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_GRAPHICS_BIT) {\r\n\t\t\tgraphicsFamily = i;\r\n\t\t\tthis->graphicsFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_GRAPHICS_BIT;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for presentation support.\r\n\t\tVkBool32 presentSupport;\r\n\t\tvkGetPhysicalDeviceSurfaceSupportKHR(*physicalDevice, i, *surface, &presentSupport);\r\n\r\n\t\tif (deviceQueueFamilyProperties[i].queueCount > 0 && presentSupport) {\r\n\t\t\tpresentFamily = i;\r\n\t\t\tthis->presentFamily = i;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for compute support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_COMPUTE_BIT) {\r\n\t\t\tcomputeFamily = i;\r\n\t\t\tthis->computeFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_COMPUTE_BIT;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for transfer support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_TRANSFER_BIT) {\r\n\t\t\ttransferFamily = i;\r\n\t\t\tthis->transferFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_TRANSFER_BIT;\r\n\t\t}\r\n\r\n\t\tif (graphicsFamily && presentFamily && computeFamily && transferFamily) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tif (!graphicsFamily)\r\n\t\tthrow std::runtime_error(\"Failed to find queue family supporting VK_QUEUE_GRAPHICS_BIT\");\r\n}\r\n\r\nvoid LogicalDevice::CreateLogicalDevice() {\r\n\tauto physicalDeviceFeatures = physicalDevice->GetFeatures();\r\n\r\n\tstd::vector<VkDeviceQueueCreateInfo> queueCreateInfos;\r\n\tfloat queuePriorities[1] = {0.0f};\r\n\r\n\tif (supportedQueues & VK_QUEUE_GRAPHICS_BIT) {\r\n\t\tVkDeviceQueueCreateInfo graphicsQueueCreateInfo = {};\r\n\t\tgraphicsQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\tgraphicsQueueCreateInfo.queueFamilyIndex = graphicsFamily;\r\n\t\tgraphicsQueueCreateInfo.queueCount = 1;\r\n\t\tgraphicsQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(graphicsQueueCreateInfo);\r\n\t} else {\r\n\t\tgraphicsFamily = (uint32_t)VK_NULL_HANDLE;\r\n\t}\r\n\r\n\tif (supportedQueues & VK_QUEUE_COMPUTE_BIT && computeFamily != graphicsFamily) {\r\n\t\tVkDeviceQueueCreateInfo computeQueueCreateInfo = {};\r\n\t\tcomputeQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\tcomputeQueueCreateInfo.queueFamilyIndex = computeFamily;\r\n\t\tcomputeQueueCreateInfo.queueCount = 1;\r\n\t\tcomputeQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(computeQueueCreateInfo);\r\n\t} else {\r\n\t\tcomputeFamily = graphicsFamily;\r\n\t}\r\n\r\n\tif (supportedQueues & VK_QUEUE_TRANSFER_BIT && transferFamily != graphicsFamily && transferFamily != computeFamily) {\r\n\t\tVkDeviceQueueCreateInfo transferQueueCreateInfo = {};\r\n\t\ttransferQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\ttransferQueueCreateInfo.queueFamilyIndex = transferFamily;\r\n\t\ttransferQueueCreateInfo.queueCount = 1;\r\n\t\ttransferQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(transferQueueCreateInfo);\r\n\t} else {\r\n\t\ttransferFamily = graphicsFamily;\r\n\t}\r\n\r\n\tVkPhysicalDeviceFeatures enabledFeatures = {};\r\n\r\n\t\/\/ Enable sample rate shading filtering if supported.\r\n\tif (physicalDeviceFeatures.sampleRateShading)\r\n\t\tenabledFeatures.sampleRateShading = VK_TRUE;\r\n\r\n\t\/\/ Fill mode non solid is required for wireframe display.\r\n\tif (physicalDeviceFeatures.fillModeNonSolid) {\r\n\t\tenabledFeatures.fillModeNonSolid = VK_TRUE;\r\n\r\n\t\t\/\/ Wide lines must be present for line width > 1.0f.\r\n\t\tif (physicalDeviceFeatures.wideLines)\r\n\t\t\tenabledFeatures.wideLines = VK_TRUE;\r\n\t} else {\r\n\t\tLog::Warning(\"Selected GPU does not support wireframe pipelines!\\n\");\r\n\t}\r\n\r\n\tif (physicalDeviceFeatures.samplerAnisotropy)\r\n\t\tenabledFeatures.samplerAnisotropy = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support sampler anisotropy!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.textureCompressionBC)\r\n\t\tenabledFeatures.textureCompressionBC = VK_TRUE;\r\n\telse if (physicalDeviceFeatures.textureCompressionASTC_LDR)\r\n\t\tenabledFeatures.textureCompressionASTC_LDR = VK_TRUE;\r\n\telse if (physicalDeviceFeatures.textureCompressionETC2)\r\n\t\tenabledFeatures.textureCompressionETC2 = VK_TRUE;\r\n\r\n\tif (physicalDeviceFeatures.vertexPipelineStoresAndAtomics)\r\n\t\tenabledFeatures.vertexPipelineStoresAndAtomics = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support vertex pipeline stores and atomics!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.fragmentStoresAndAtomics)\r\n\t\tenabledFeatures.fragmentStoresAndAtomics = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support fragment stores and atomics!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.shaderStorageImageExtendedFormats)\r\n\t\tenabledFeatures.shaderStorageImageExtendedFormats = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support shader storage extended formats!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.shaderStorageImageWriteWithoutFormat)\r\n\t\tenabledFeatures.shaderStorageImageWriteWithoutFormat = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support shader storage write without format!\\n\");\r\n\r\n\t\/\/enabledFeatures.shaderClipDistance = VK_TRUE;\r\n\t\/\/enabledFeatures.shaderCullDistance = VK_TRUE;\r\n\r\n\tif (physicalDeviceFeatures.geometryShader)\r\n\t\tenabledFeatures.geometryShader = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support geometry shaders!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.tessellationShader)\r\n\t\tenabledFeatures.tessellationShader = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support tessellation shaders!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.multiViewport)\r\n\t\tenabledFeatures.multiViewport = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support multi viewports!\\n\");\r\n\r\n\tVkDeviceCreateInfo deviceCreateInfo = {};\r\n\tdeviceCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_CREATE_INFO;\r\n\tdeviceCreateInfo.queueCreateInfoCount = static_cast<uint32_t>(queueCreateInfos.size());\r\n\tdeviceCreateInfo.pQueueCreateInfos = queueCreateInfos.data();\r\n\tif (instance->GetEnableValidationLayers()) {\r\n\t\tdeviceCreateInfo.enabledLayerCount = static_cast<uint32_t>(Instance::ValidationLayers.size());\r\n\t\tdeviceCreateInfo.ppEnabledLayerNames = Instance::ValidationLayers.data();\r\n\t}\r\n\tdeviceCreateInfo.enabledExtensionCount = static_cast<uint32_t>(DeviceExtensions.size());\r\n\tdeviceCreateInfo.ppEnabledExtensionNames = DeviceExtensions.data();\r\n\tdeviceCreateInfo.pEnabledFeatures = &enabledFeatures;\r\n\tGraphics::CheckVk(vkCreateDevice(*physicalDevice, &deviceCreateInfo, nullptr, &logicalDevice));\r\n\r\n\tvolkLoadDevice(logicalDevice);\r\n\r\n\tvkGetDeviceQueue(logicalDevice, graphicsFamily, 0, &graphicsQueue);\r\n\tvkGetDeviceQueue(logicalDevice, presentFamily, 0, &presentQueue);\r\n\tvkGetDeviceQueue(logicalDevice, computeFamily, 0, &computeQueue);\r\n\tvkGetDeviceQueue(logicalDevice, transferFamily, 0, &transferQueue);\r\n}\r\n}\r\n<commit_msg>Update LogicalDevice.cpp<commit_after>#include \"LogicalDevice.hpp\"\r\n\r\n#include \"Graphics\/Graphics.hpp\"\r\n#include \"Instance.hpp\"\r\n#include \"PhysicalDevice.hpp\"\r\n#include \"Surface.hpp\"\r\n\r\nnamespace acid {\r\nconst std::vector<const char *> LogicalDevice::DeviceExtensions = {VK_KHR_SWAPCHAIN_EXTENSION_NAME}; \/\/ VK_KHR_PUSH_DESCRIPTOR_EXTENSION_NAME\r\n\r\nLogicalDevice::LogicalDevice(const Instance *instance, const PhysicalDevice *physicalDevice, const Surface *surface) :\r\n\tinstance(instance),\r\n\tphysicalDevice(physicalDevice),\r\n\tsurface(surface) {\r\n\tCreateQueueIndices();\r\n\tCreateLogicalDevice();\r\n}\r\n\r\nLogicalDevice::~LogicalDevice() {\r\n\tGraphics::CheckVk(vkDeviceWaitIdle(logicalDevice));\r\n\r\n\tvkDestroyDevice(logicalDevice, nullptr);\r\n}\r\n\r\nvoid LogicalDevice::CreateQueueIndices() {\r\n\tuint32_t deviceQueueFamilyPropertyCount;\r\n\tvkGetPhysicalDeviceQueueFamilyProperties(*physicalDevice, &deviceQueueFamilyPropertyCount, nullptr);\r\n\tstd::vector<VkQueueFamilyProperties> deviceQueueFamilyProperties(deviceQueueFamilyPropertyCount);\r\n\tvkGetPhysicalDeviceQueueFamilyProperties(*physicalDevice, &deviceQueueFamilyPropertyCount, deviceQueueFamilyProperties.data());\r\n\r\n\tstd::optional<uint32_t> graphicsFamily, presentFamily, computeFamily, transferFamily;\r\n\r\n\tfor (uint32_t i = 0; i < deviceQueueFamilyPropertyCount; i++) {\r\n\t\t\/\/ Check for graphics support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_GRAPHICS_BIT) {\r\n\t\t\tgraphicsFamily = i;\r\n\t\t\tthis->graphicsFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_GRAPHICS_BIT;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for presentation support.\r\n\t\tVkBool32 presentSupport;\r\n\t\tvkGetPhysicalDeviceSurfaceSupportKHR(*physicalDevice, i, *surface, &presentSupport);\r\n\r\n\t\tif (deviceQueueFamilyProperties[i].queueCount > 0 && presentSupport) {\r\n\t\t\tpresentFamily = i;\r\n\t\t\tthis->presentFamily = i;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for compute support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_COMPUTE_BIT) {\r\n\t\t\tcomputeFamily = i;\r\n\t\t\tthis->computeFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_COMPUTE_BIT;\r\n\t\t}\r\n\r\n\t\t\/\/ Check for transfer support.\r\n\t\tif (deviceQueueFamilyProperties[i].queueFlags & VK_QUEUE_TRANSFER_BIT) {\r\n\t\t\ttransferFamily = i;\r\n\t\t\tthis->transferFamily = i;\r\n\t\t\tsupportedQueues |= VK_QUEUE_TRANSFER_BIT;\r\n\t\t}\r\n\r\n\t\tif (graphicsFamily && presentFamily && computeFamily && transferFamily) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}\r\n\r\n\tif (!graphicsFamily)\r\n\t\tthrow std::runtime_error(\"Failed to find queue family supporting VK_QUEUE_GRAPHICS_BIT\");\r\n}\r\n\r\nvoid LogicalDevice::CreateLogicalDevice() {\r\n\tauto physicalDeviceFeatures = physicalDevice->GetFeatures();\r\n\r\n\tstd::vector<VkDeviceQueueCreateInfo> queueCreateInfos;\r\n\tfloat queuePriorities[1] = {0.0f};\r\n\r\n\tif (supportedQueues & VK_QUEUE_GRAPHICS_BIT) {\r\n\t\tVkDeviceQueueCreateInfo graphicsQueueCreateInfo = {};\r\n\t\tgraphicsQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\tgraphicsQueueCreateInfo.queueFamilyIndex = graphicsFamily;\r\n\t\tgraphicsQueueCreateInfo.queueCount = 1;\r\n\t\tgraphicsQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(graphicsQueueCreateInfo);\r\n\t} else {\r\n\t\tgraphicsFamily = 0; \/\/ VK_NULL_HANDLE;\r\n\t}\r\n\r\n\tif (supportedQueues & VK_QUEUE_COMPUTE_BIT && computeFamily != graphicsFamily) {\r\n\t\tVkDeviceQueueCreateInfo computeQueueCreateInfo = {};\r\n\t\tcomputeQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\tcomputeQueueCreateInfo.queueFamilyIndex = computeFamily;\r\n\t\tcomputeQueueCreateInfo.queueCount = 1;\r\n\t\tcomputeQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(computeQueueCreateInfo);\r\n\t} else {\r\n\t\tcomputeFamily = graphicsFamily;\r\n\t}\r\n\r\n\tif (supportedQueues & VK_QUEUE_TRANSFER_BIT && transferFamily != graphicsFamily && transferFamily != computeFamily) {\r\n\t\tVkDeviceQueueCreateInfo transferQueueCreateInfo = {};\r\n\t\ttransferQueueCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_QUEUE_CREATE_INFO;\r\n\t\ttransferQueueCreateInfo.queueFamilyIndex = transferFamily;\r\n\t\ttransferQueueCreateInfo.queueCount = 1;\r\n\t\ttransferQueueCreateInfo.pQueuePriorities = queuePriorities;\r\n\t\tqueueCreateInfos.emplace_back(transferQueueCreateInfo);\r\n\t} else {\r\n\t\ttransferFamily = graphicsFamily;\r\n\t}\r\n\r\n\tVkPhysicalDeviceFeatures enabledFeatures = {};\r\n\r\n\t\/\/ Enable sample rate shading filtering if supported.\r\n\tif (physicalDeviceFeatures.sampleRateShading)\r\n\t\tenabledFeatures.sampleRateShading = VK_TRUE;\r\n\r\n\t\/\/ Fill mode non solid is required for wireframe display.\r\n\tif (physicalDeviceFeatures.fillModeNonSolid) {\r\n\t\tenabledFeatures.fillModeNonSolid = VK_TRUE;\r\n\r\n\t\t\/\/ Wide lines must be present for line width > 1.0f.\r\n\t\tif (physicalDeviceFeatures.wideLines)\r\n\t\t\tenabledFeatures.wideLines = VK_TRUE;\r\n\t} else {\r\n\t\tLog::Warning(\"Selected GPU does not support wireframe pipelines!\\n\");\r\n\t}\r\n\r\n\tif (physicalDeviceFeatures.samplerAnisotropy)\r\n\t\tenabledFeatures.samplerAnisotropy = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support sampler anisotropy!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.textureCompressionBC)\r\n\t\tenabledFeatures.textureCompressionBC = VK_TRUE;\r\n\telse if (physicalDeviceFeatures.textureCompressionASTC_LDR)\r\n\t\tenabledFeatures.textureCompressionASTC_LDR = VK_TRUE;\r\n\telse if (physicalDeviceFeatures.textureCompressionETC2)\r\n\t\tenabledFeatures.textureCompressionETC2 = VK_TRUE;\r\n\r\n\tif (physicalDeviceFeatures.vertexPipelineStoresAndAtomics)\r\n\t\tenabledFeatures.vertexPipelineStoresAndAtomics = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support vertex pipeline stores and atomics!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.fragmentStoresAndAtomics)\r\n\t\tenabledFeatures.fragmentStoresAndAtomics = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support fragment stores and atomics!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.shaderStorageImageExtendedFormats)\r\n\t\tenabledFeatures.shaderStorageImageExtendedFormats = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support shader storage extended formats!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.shaderStorageImageWriteWithoutFormat)\r\n\t\tenabledFeatures.shaderStorageImageWriteWithoutFormat = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support shader storage write without format!\\n\");\r\n\r\n\t\/\/enabledFeatures.shaderClipDistance = VK_TRUE;\r\n\t\/\/enabledFeatures.shaderCullDistance = VK_TRUE;\r\n\r\n\tif (physicalDeviceFeatures.geometryShader)\r\n\t\tenabledFeatures.geometryShader = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support geometry shaders!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.tessellationShader)\r\n\t\tenabledFeatures.tessellationShader = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support tessellation shaders!\\n\");\r\n\r\n\tif (physicalDeviceFeatures.multiViewport)\r\n\t\tenabledFeatures.multiViewport = VK_TRUE;\r\n\telse\r\n\t\tLog::Warning(\"Selected GPU does not support multi viewports!\\n\");\r\n\r\n\tVkDeviceCreateInfo deviceCreateInfo = {};\r\n\tdeviceCreateInfo.sType = VK_STRUCTURE_TYPE_DEVICE_CREATE_INFO;\r\n\tdeviceCreateInfo.queueCreateInfoCount = static_cast<uint32_t>(queueCreateInfos.size());\r\n\tdeviceCreateInfo.pQueueCreateInfos = queueCreateInfos.data();\r\n\tif (instance->GetEnableValidationLayers()) {\r\n\t\tdeviceCreateInfo.enabledLayerCount = static_cast<uint32_t>(Instance::ValidationLayers.size());\r\n\t\tdeviceCreateInfo.ppEnabledLayerNames = Instance::ValidationLayers.data();\r\n\t}\r\n\tdeviceCreateInfo.enabledExtensionCount = static_cast<uint32_t>(DeviceExtensions.size());\r\n\tdeviceCreateInfo.ppEnabledExtensionNames = DeviceExtensions.data();\r\n\tdeviceCreateInfo.pEnabledFeatures = &enabledFeatures;\r\n\tGraphics::CheckVk(vkCreateDevice(*physicalDevice, &deviceCreateInfo, nullptr, &logicalDevice));\r\n\r\n\tvolkLoadDevice(logicalDevice);\r\n\r\n\tvkGetDeviceQueue(logicalDevice, graphicsFamily, 0, &graphicsQueue);\r\n\tvkGetDeviceQueue(logicalDevice, presentFamily, 0, &presentQueue);\r\n\tvkGetDeviceQueue(logicalDevice, computeFamily, 0, &computeQueue);\r\n\tvkGetDeviceQueue(logicalDevice, transferFamily, 0, &transferQueue);\r\n}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include \"Object.h\"\r\n#include \"..\/StarComponents.h\"\r\n#include \"..\/Components\/TransformComponent.h\"\r\n#include \"..\/Graphics\/GraphicsManager.h\"\r\n#include \"..\/Scenes\/BaseScene.h\"\r\n#include \"..\/Physics\/Collision\/CollisionManager.h\"\r\n#include <algorithm>\r\n#include <typeinfo>\r\n\r\nnamespace star\r\n{\r\n\tObject::Object(void)\r\n\t\t: m_bIsInitialized(false)\r\n\t\t, m_IsVisible(true)\r\n\t\t, m_IsFrozen(false)\r\n\t\t, m_pParentGameObject(nullptr)\r\n\t\t, m_pPathFindComp(nullptr)\r\n\t\t, m_pScene(nullptr)\r\n\t\t, m_pComponents()\r\n\t\t, m_pGarbageComponents()\r\n\t\t, m_pChildren()\r\n\t\t, m_pGarbageChildren()\r\n\t\t, m_Name(_T(\"Default\"))\r\n\t\t, m_CollisionTag(_T(\"Default\"))\r\n\t{\r\n\t\tm_pComponents.push_back(new TransformComponent(this));\r\n\t}\r\n\r\n\tObject::~Object(void)\r\n\t{\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tdelete comp;\r\n\t\t}\r\n\t\tm_pComponents.clear();\r\n\r\n\t\tfor(auto child : m_pChildren)\r\n\t\t{\r\n\t\t\tdelete child;\r\n\t\t}\r\n\t\tm_pChildren.clear();\r\n\t}\r\n\t\r\n\tObject* Object::GetParent() const\r\n\t{\r\n\t\treturn (m_pParentGameObject);\r\n\t}\r\n\r\n\tvoid Object::BaseInitialize()\r\n\t{\r\n\t\tif (m_bIsInitialized)\r\n\t\t{\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tInitialize();\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tif(comp && !comp->IsInitialized())\r\n\t\t\t{\r\n\t\t\t\tcomp->Initialize();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor(auto child : m_pChildren)\r\n\t\t{\r\n\t\t\tif(child && !child->m_bIsInitialized)\r\n\t\t\t{\r\n\t\t\t\tchild->BaseInitialize();\r\n\t\t\t}\r\n\t\t}\r\n\t\tBaseAfterInitialized();\r\n\t\tm_bIsInitialized = true;\r\n\t}\r\n\r\n\tvoid Object::Initialize()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::BaseAfterInitialized()\r\n\t{\r\n\t\tAfterInitialized();\r\n\t}\r\n\r\n\tvoid Object::AfterInitialized()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::Update(const Context& context)\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\t\r\n\tvoid Object::BaseUpdate(const Context & context)\r\n\t{\r\n\t\tCollectGarbage();\r\n\t\tif(!m_IsFrozen)\r\n\t\t{\r\n\t\t\tUpdate(context);\r\n\t\t\tfor(auto component : m_pComponents)\r\n\t\t\t{\r\n\t\t\t\tif(component)\r\n\t\t\t\t{\r\n\t\t\t\t\tcomponent->BaseUpdate(context);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tfor(auto child : m_pChildren)\r\n\t\t\t{\r\n\t\t\t\tif(child)\r\n\t\t\t\t{\r\n\t\t\t\t\tchild->BaseUpdate(context);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Object::Draw()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::BaseDraw()\r\n\t{\r\n\t\tif(m_IsVisible)\r\n\t\t{\r\n\t\t\tDraw();\r\n\t\t\tfor(auto component : m_pComponents)\r\n\t\t\t{\r\n\t\t\t\tif(component)\r\n\t\t\t\t{\r\n\t\t\t\t\tcomponent->BaseDraw();\r\n\t\t\t\t} \r\n\t\t\t}\r\n\r\n\t\t\tfor(auto child : m_pChildren)\r\n\t\t\t{\r\n\t\t\t\tif(child)\r\n\t\t\t\t{\r\n\t\t\t\t\tchild->BaseDraw();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tconst tstring& Object::GetName() const\r\n\t{\r\n\t\treturn m_Name;\r\n\t}\r\n\r\n\tvoid Object::SetName(const tstring& name)\r\n\t{\r\n\t\tm_Name = name;\r\n\t}\r\n\r\n\tvoid Object::AddComponent(BaseComponent *pComponent)\r\n\t{\r\n\t\tbool isValid(true);\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tif(typeid(*comp) == typeid(*pComponent))\r\n\t\t\t{\r\n\t\t\t\tisValid = false;\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tASSERT(isValid, _T(\"Adding 2 components of the same type to the same object is illegal.\"));\r\n\r\n\t\tif(isValid)\r\n\t\t{\r\n\t\t\tpComponent->SetParent(this);\r\n\r\n\t\t\tif(m_bIsInitialized && ! pComponent->IsInitialized())\r\n\t\t\t{\r\n\t\t\t\tpComponent->Initialize();\r\n\t\t\t}\r\n\r\n\t\t\tm_pComponents.push_back(pComponent);\r\n\t\t}\r\n\t}\t\r\n\r\n\tvoid Object::AddChild(Object *pChild)\r\n\t{\r\n\t\tpChild->m_pParentGameObject = this;\r\n\r\n\t\tif(m_bIsInitialized && !pChild->m_bIsInitialized)\r\n\t\t{\r\n\t\t\tpChild->BaseInitialize();\r\n\t\t}\r\n\r\n\t\tm_pChildren.push_back(pChild);\r\n\r\n\t\t\/\/Logger::GetInstance()->Log(LogLevel::Info, _T(\"Child Added\"));\r\n\t}\r\n\r\n\tvoid Object::RemoveChild(const Object* pObject)\r\n\t{\r\n\t\tauto it = std::find(m_pChildren.begin(), m_pChildren.end(), pObject);\r\n\t\tASSERT(it != m_pChildren.end(), _T(\"Object::RemoveChild: \\\r\n\t\t\t\t\t\t\t\t\t\t The object you tried to remove is not a child of this object!\"));\r\n\t\tm_pGarbageChildren.push_back(*it);\r\n\t}\r\n\r\n\tstd::vector<Object*>& Object::GetChildren()\r\n\t{\r\n\t\treturn m_pChildren;\r\n\t}\r\n\r\n\tvoid Object::SetVisible(bool visible)\r\n\t{\r\n\t\tm_IsVisible = visible;\r\n\t}\r\n\r\n\tbool Object::IsVisible() const\r\n\t{\r\n\t\treturn m_IsVisible;\r\n\t}\r\n\r\n\tvoid Object::Freeze(bool freeze)\r\n\t{\r\n\t\tm_IsFrozen = freeze;\r\n\t}\r\n\r\n\tbool Object::IsFrozen() const\r\n\t{\r\n\t\treturn m_IsFrozen;\r\n\t}\r\n\r\n\tvoid Object::SetDisabled(bool disabled)\r\n\t{\r\n\t\tm_IsVisible = !disabled;\r\n\t\tm_IsFrozen = disabled;\r\n\t}\r\n\r\n\tbool Object::IsDisabled() const\r\n\t{\r\n\t\treturn !m_IsVisible && m_IsFrozen;\r\n\t}\r\n\r\n\tvoid Object::SetScene(BaseScene * pScene)\r\n\t{\r\n\t\tm_pScene = pScene;\r\n\t}\r\n\r\n\tvoid Object::UnsetScene()\r\n\t{\r\n\t\tm_pScene = nullptr;\r\n\t}\r\n\t\r\n\tTransformComponent * Object::GetTransform() const\r\n\t{\r\n\t\treturn GetComponent<TransformComponent>();\r\n\t}\r\n\t\r\n\tBaseScene * Object::GetScene() const\r\n\t{\r\n\t\treturn m_pScene;\r\n\t}\r\n\r\n\tvoid Object::CollectGarbage()\r\n\t{\r\n\t\tfor(auto component : m_pGarbageComponents)\r\n\t\t{\r\n\t\t\tauto it = std::find(m_pComponents.begin(), m_pComponents.end(), component);\r\n\t\t\tASSERT(it != m_pComponents.end(), _T(\"Object::CollectGarbage: \\\r\n\t\t\t\t\t\t\t\t\t\t\t\t trying to delete unknown object!\"));\r\n\t\t\tm_pComponents.erase(it);\r\n\t\t\tdelete component;\r\n\t\t\tLogger::GetInstance()->Log(LogLevel::Info, _T(\"Component Removed\"));\r\n\t\t}\r\n\t\tm_pGarbageComponents.clear();\t\t\r\n\r\n\t\tfor(auto child : m_pGarbageChildren)\r\n\t\t{\r\n\t\t\tauto it = std::find(m_pChildren.begin(), m_pChildren.end(), child);\r\n\t\t\tASSERT(it != m_pChildren.end(), _T(\"Object::CollectGarbage: \\\r\n\t\t\t\t\t\t\t\t\t\t\t\t trying to delete unknown child!\"));\r\n\t\t\tm_pChildren.erase(it);\r\n\t\t\tdelete child;\r\n\t\t\tLogger::GetInstance()->Log(LogLevel::Info, _T(\"Child Removed\"));\r\n\t\t}\r\n\t\tm_pGarbageChildren.clear();\r\n\t}\r\n}\r\n<commit_msg>Cleaned up some code<commit_after>#include \"Object.h\"\r\n#include \"..\/StarComponents.h\"\r\n#include \"..\/Components\/TransformComponent.h\"\r\n#include \"..\/Graphics\/GraphicsManager.h\"\r\n#include \"..\/Scenes\/BaseScene.h\"\r\n#include \"..\/Physics\/Collision\/CollisionManager.h\"\r\n#include <algorithm>\r\n#include <typeinfo>\r\n\r\nnamespace star\r\n{\r\n\tObject::Object(void)\r\n\t\t: m_bIsInitialized(false)\r\n\t\t, m_IsVisible(true)\r\n\t\t, m_IsFrozen(false)\r\n\t\t, m_pParentGameObject(nullptr)\r\n\t\t, m_pPathFindComp(nullptr)\r\n\t\t, m_pScene(nullptr)\r\n\t\t, m_pComponents()\r\n\t\t, m_pGarbageComponents()\r\n\t\t, m_pChildren()\r\n\t\t, m_pGarbageChildren()\r\n\t\t, m_Name(_T(\"Default\"))\r\n\t\t, m_CollisionTag(_T(\"Default\"))\r\n\t{\r\n\t\tm_pComponents.push_back(new TransformComponent(this));\r\n\t}\r\n\r\n\tObject::~Object(void)\r\n\t{\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tdelete comp;\r\n\t\t}\r\n\t\tm_pComponents.clear();\r\n\r\n\t\tfor(auto child : m_pChildren)\r\n\t\t{\r\n\t\t\tdelete child;\r\n\t\t}\r\n\t\tm_pChildren.clear();\r\n\t}\r\n\t\r\n\tObject* Object::GetParent() const\r\n\t{\r\n\t\treturn (m_pParentGameObject);\r\n\t}\r\n\r\n\tvoid Object::BaseInitialize()\r\n\t{\r\n\t\tif (m_bIsInitialized)\r\n\t\t{\r\n\t\t\treturn;\r\n\t\t}\r\n\r\n\t\tInitialize();\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tif(comp && !comp->IsInitialized())\r\n\t\t\t{\r\n\t\t\t\tcomp->Initialize();\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor(auto child : m_pChildren)\r\n\t\t{\r\n\t\t\tif(child && !child->m_bIsInitialized)\r\n\t\t\t{\r\n\t\t\t\tchild->BaseInitialize();\r\n\t\t\t}\r\n\t\t}\r\n\t\tBaseAfterInitialized();\r\n\t\tm_bIsInitialized = true;\r\n\t}\r\n\r\n\tvoid Object::Initialize()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::BaseAfterInitialized()\r\n\t{\r\n\t\tAfterInitialized();\r\n\t}\r\n\r\n\tvoid Object::AfterInitialized()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::Update(const Context& context)\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\t\r\n\tvoid Object::BaseUpdate(const Context & context)\r\n\t{\r\n\t\tCollectGarbage();\r\n\t\tif(!m_IsFrozen)\r\n\t\t{\r\n\t\t\tUpdate(context);\r\n\t\t\tfor(auto component : m_pComponents)\r\n\t\t\t{\r\n\t\t\t\tif(component)\r\n\t\t\t\t{\r\n\t\t\t\t\tcomponent->BaseUpdate(context);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tfor(auto child : m_pChildren)\r\n\t\t\t{\r\n\t\t\t\tif(child)\r\n\t\t\t\t{\r\n\t\t\t\t\tchild->BaseUpdate(context);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tvoid Object::Draw()\r\n\t{\r\n\t\t\/\/DO nothing, unless a derived class overrides this\r\n\t}\r\n\r\n\tvoid Object::BaseDraw()\r\n\t{\r\n\t\tif(m_IsVisible)\r\n\t\t{\r\n\t\t\tDraw();\r\n\t\t\tfor(auto component : m_pComponents)\r\n\t\t\t{\r\n\t\t\t\tif(component)\r\n\t\t\t\t{\r\n\t\t\t\t\tcomponent->BaseDraw();\r\n\t\t\t\t} \r\n\t\t\t}\r\n\r\n\t\t\tfor(auto child : m_pChildren)\r\n\t\t\t{\r\n\t\t\t\tif(child)\r\n\t\t\t\t{\r\n\t\t\t\t\tchild->BaseDraw();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\tconst tstring& Object::GetName() const\r\n\t{\r\n\t\treturn m_Name;\r\n\t}\r\n\r\n\tvoid Object::SetName(const tstring& name)\r\n\t{\r\n\t\tm_Name = name;\r\n\t}\r\n\r\n\tvoid Object::AddComponent(BaseComponent *pComponent)\r\n\t{\r\n\t\tfor(auto comp : m_pComponents)\r\n\t\t{\r\n\t\t\tASSERT(typeid(*comp) != typeid(*pComponent), \r\n\t\t\t\t_T(\"Object::AddComponent: \\\r\n\t\t\t\t Adding 2 components of the same type to the same object is illegal.\"));\r\n\t\t}\r\n\r\n\t\tpComponent->SetParent(this);\r\n\r\n\t\tif(m_bIsInitialized && ! pComponent->IsInitialized())\r\n\t\t{\r\n\t\t\tpComponent->Initialize();\r\n\t\t}\r\n\r\n\t\tm_pComponents.push_back(pComponent);\r\n\t}\t\r\n\r\n\tvoid Object::AddChild(Object *pChild)\r\n\t{\r\n\t\tpChild->m_pParentGameObject = this;\r\n\r\n\t\tif(m_bIsInitialized && !pChild->m_bIsInitialized)\r\n\t\t{\r\n\t\t\tpChild->BaseInitialize();\r\n\t\t}\r\n\r\n\t\tm_pChildren.push_back(pChild);\r\n\r\n\t\t\/\/Logger::GetInstance()->Log(LogLevel::Info, _T(\"Child Added\"));\r\n\t}\r\n\r\n\tvoid Object::RemoveChild(const Object* pObject)\r\n\t{\r\n\t\tauto it = std::find(m_pChildren.begin(), m_pChildren.end(), pObject);\r\n\t\tASSERT(it != m_pChildren.end(), _T(\"Object::RemoveChild: \\\r\n\t\t\t\t\t\t\t\t\t\t The object you tried to remove is not a child of this object!\"));\r\n\t\tm_pGarbageChildren.push_back(*it);\r\n\t}\r\n\r\n\tstd::vector<Object*>& Object::GetChildren()\r\n\t{\r\n\t\treturn m_pChildren;\r\n\t}\r\n\r\n\tvoid Object::SetVisible(bool visible)\r\n\t{\r\n\t\tm_IsVisible = visible;\r\n\t}\r\n\r\n\tbool Object::IsVisible() const\r\n\t{\r\n\t\treturn m_IsVisible;\r\n\t}\r\n\r\n\tvoid Object::Freeze(bool freeze)\r\n\t{\r\n\t\tm_IsFrozen = freeze;\r\n\t}\r\n\r\n\tbool Object::IsFrozen() const\r\n\t{\r\n\t\treturn m_IsFrozen;\r\n\t}\r\n\r\n\tvoid Object::SetDisabled(bool disabled)\r\n\t{\r\n\t\tm_IsVisible = !disabled;\r\n\t\tm_IsFrozen = disabled;\r\n\t}\r\n\r\n\tbool Object::IsDisabled() const\r\n\t{\r\n\t\treturn !m_IsVisible && m_IsFrozen;\r\n\t}\r\n\r\n\tvoid Object::SetScene(BaseScene * pScene)\r\n\t{\r\n\t\tm_pScene = pScene;\r\n\t}\r\n\r\n\tvoid Object::UnsetScene()\r\n\t{\r\n\t\tm_pScene = nullptr;\r\n\t}\r\n\t\r\n\tTransformComponent * Object::GetTransform() const\r\n\t{\r\n\t\treturn GetComponent<TransformComponent>();\r\n\t}\r\n\t\r\n\tBaseScene * Object::GetScene() const\r\n\t{\r\n\t\treturn m_pScene;\r\n\t}\r\n\r\n\tvoid Object::CollectGarbage()\r\n\t{\r\n\t\tfor(auto component : m_pGarbageComponents)\r\n\t\t{\r\n\t\t\tauto it = std::find(m_pComponents.begin(), m_pComponents.end(), component);\r\n\t\t\tASSERT(it != m_pComponents.end(), _T(\"Object::CollectGarbage: \\\r\n\t\t\t\t\t\t\t\t\t\t\t\t trying to delete unknown object!\"));\r\n\t\t\tm_pComponents.erase(it);\r\n\t\t\tdelete component;\r\n\t\t\tLogger::GetInstance()->Log(LogLevel::Info, _T(\"Component Removed\"));\r\n\t\t}\r\n\t\tm_pGarbageComponents.clear();\t\t\r\n\r\n\t\tfor(auto child : m_pGarbageChildren)\r\n\t\t{\r\n\t\t\tauto it = std::find(m_pChildren.begin(), m_pChildren.end(), child);\r\n\t\t\tASSERT(it != m_pChildren.end(), _T(\"Object::CollectGarbage: \\\r\n\t\t\t\t\t\t\t\t\t\t\t\t trying to delete unknown child!\"));\r\n\t\t\tm_pChildren.erase(it);\r\n\t\t\tdelete child;\r\n\t\t\tLogger::GetInstance()->Log(LogLevel::Info, _T(\"Child Removed\"));\r\n\t\t}\r\n\t\tm_pGarbageChildren.clear();\r\n\t}\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <QString>\n#include <typeinfo>\n#include \"kernel.h\"\n#include \"range.h\"\n#include \"domainitem.h\"\n#include \"numericrange.h\"\n#include \"domainitem.h\"\n#include \"numericitem.h\"\n#include \"itemrange.h\"\n#include \"numericitemrange.h\"\n\nusing namespace Ilwis;\n\nNumericItemRange::NumericItemRange()\n{\n _vt = itNUMERICITEM;\n}\n\nQString NumericItemRange::value(quint32 index) const\n{\n if ( index < _items.size())\n return _items[index]->name();\n return sUNDEF;\n\n}\n\nquint32 NumericItemRange::count() const\n{\n return _items.size();\n}\n\nSPDomainItem NumericItemRange::item(quint32 index) const\n{\n if ( index < _items.size())\n return _items[index];\n return SPDomainItem();\n}\n\nSPDomainItem NumericItemRange::item(const QString &name) const\n{\n for(const SPNumericItem& it: _items) {\n if ( it->name() == name)\n return it;\n }\n return SPDomainItem();\n}\n\ndouble NumericItemRange::index(double v) const\n{\n if (!isValid())\n return rUNDEF;\n\n for(quint32 ind = 0; ind < _items.size(); ++ind) {\n quint32 mark1=iUNDEF, mark2=iUNDEF;\n const NumericRange& rng = _items[ind]->range();\n if ( v >= rng.min()){\n mark1 = ind;\n }\n if ( v <= rng.max()){\n mark2 = ind;\n }\n if ( mark1 != iUNDEF && mark2 != iUNDEF) {\n if ( isContinous())\n return ind + (v - rng.min()) \/ rng.distance();\n return ind;\n }\n }\n return rUNDEF;\n}\n\nbool NumericItemRange::contains(const QString &name) const\n{\n for(const SPNumericItem& it: _items) {\n if ( it->name() == name)\n return true;\n }\n return false;\n}\n\nbool NumericItemRange::isValid() const\n{\n return _items.size() != 0;\n}\n\nvoid NumericItemRange::add(DomainItem *item)\n{\n if (!item)\n return;\n\n if ( item->valueType() != itNUMERICITEM)\n return;\n\n if (!item->isValid())\n return;\n SPNumericItem nitem(static_cast<NumericItem *>(item));\n for(auto iter = _items.rbegin(); iter != _items.rend(); ++iter) {\n if ( nitem->range() > (*iter)->range()) {\n _items.insert(iter.base(),1, nitem );\n return;\n }\n }\n if ( _items.size() == 0) \/\/ no overlapping items allowed; so the only case that is legal here is the first\n _items.push_back(nitem);\n\n}\n\nvoid NumericItemRange::remove(const QString &nm)\n{\n for(auto iter = _items.begin(); iter != _items.begin(); ++iter) {\n if ( (*iter)->name() == nm) {\n _items.erase(iter);\n }\n }\n}\n\nQString NumericItemRange::toString() const\n{ if ( _items.size() == 0)\n return sUNDEF;\n QString names;\n for(const SPNumericItem& it: _items) {\n if ( names != \"\")\n names += \";\";\n names += it->name();\n }\n return names;\n}\n\nItemRange *NumericItemRange::clone() const\n{\n ItemRange *items = new NumericItemRange();\n for(const SPNumericItem& it: _items) {\n items->add(it->clone());\n }\n\n return items;\n\n}\n\nNumericItemRange &NumericItemRange::operator <<(const QString &itemdef)\n{\n QStringList parts = itemdef.split(\" \");\n if( parts.size() > 1) {\n bool ok;\n double step = 0;\n double mn = parts[0].toDouble(&ok);\n if(ok) {\n double mx = parts[1].toDouble(&ok);\n if ( ok) {\n if ( parts.size() == 3) {\n step = parts[2].toDouble(&ok);\n\n }\n if (ok) {\n add(new NumericItem({mn,mx, step}));\n }\n }\n }\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n } if ( parts.size() == 1) {\n if ( count() == 0) {\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n return *this;\n }\n bool ok;\n double vmin = _items[_items.size() - 1]->range().max();\n double vmax = itemdef.toDouble(&ok) ;\n if (!ok) {\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n }\n double step = _items[0]->range().step();\n if ( step == 0)\n vmin += EPS8;\n add(new NumericItem({vmin+step,vmax, step}));\n }\n return *this;\n}\n\nbool NumericItemRange::isContinous() const\n{\n return _interpolation != \"\";\n}\n\nQString NumericItemRange::interpolation() const\n{\n return _interpolation;\n}\n\nvoid NumericItemRange::interpolation(const QString &ip)\n{\n _interpolation = ip;\n}\n\nvoid NumericItemRange::addRange(const ItemRange &range)\n{\n ItemRange::addRange(range);\n _interpolation = static_cast<const NumericItemRange&>(range).interpolation();\n}\n\n<commit_msg>fall through wasnt correct in the '<<' overload. Generated an error message in the log file which wasnt needed (worked ok though)<commit_after>#include <QString>\n#include <typeinfo>\n#include \"kernel.h\"\n#include \"range.h\"\n#include \"domainitem.h\"\n#include \"numericrange.h\"\n#include \"domainitem.h\"\n#include \"numericitem.h\"\n#include \"itemrange.h\"\n#include \"numericitemrange.h\"\n\nusing namespace Ilwis;\n\nNumericItemRange::NumericItemRange()\n{\n _vt = itNUMERICITEM;\n}\n\nQString NumericItemRange::value(quint32 index) const\n{\n if ( index < _items.size())\n return _items[index]->name();\n return sUNDEF;\n\n}\n\nquint32 NumericItemRange::count() const\n{\n return _items.size();\n}\n\nSPDomainItem NumericItemRange::item(quint32 index) const\n{\n if ( index < _items.size())\n return _items[index];\n return SPDomainItem();\n}\n\nSPDomainItem NumericItemRange::item(const QString &name) const\n{\n for(const SPNumericItem& it: _items) {\n if ( it->name() == name)\n return it;\n }\n return SPDomainItem();\n}\n\ndouble NumericItemRange::index(double v) const\n{\n if (!isValid())\n return rUNDEF;\n\n for(quint32 ind = 0; ind < _items.size(); ++ind) {\n quint32 mark1=iUNDEF, mark2=iUNDEF;\n const NumericRange& rng = _items[ind]->range();\n if ( v >= rng.min()){\n mark1 = ind;\n }\n if ( v <= rng.max()){\n mark2 = ind;\n }\n if ( mark1 != iUNDEF && mark2 != iUNDEF) {\n if ( isContinous())\n return ind + (v - rng.min()) \/ rng.distance();\n return ind;\n }\n }\n return rUNDEF;\n}\n\nbool NumericItemRange::contains(const QString &name) const\n{\n for(const SPNumericItem& it: _items) {\n if ( it->name() == name)\n return true;\n }\n return false;\n}\n\nbool NumericItemRange::isValid() const\n{\n return _items.size() != 0;\n}\n\nvoid NumericItemRange::add(DomainItem *item)\n{\n if (!item)\n return;\n\n if ( item->valueType() != itNUMERICITEM)\n return;\n\n if (!item->isValid())\n return;\n SPNumericItem nitem(static_cast<NumericItem *>(item));\n for(auto iter = _items.rbegin(); iter != _items.rend(); ++iter) {\n if ( nitem->range() > (*iter)->range()) {\n _items.insert(iter.base(),1, nitem );\n return;\n }\n }\n if ( _items.size() == 0) \/\/ no overlapping items allowed; so the only case that is legal here is the first\n _items.push_back(nitem);\n\n}\n\nvoid NumericItemRange::remove(const QString &nm)\n{\n for(auto iter = _items.begin(); iter != _items.begin(); ++iter) {\n if ( (*iter)->name() == nm) {\n _items.erase(iter);\n }\n }\n}\n\nQString NumericItemRange::toString() const\n{ if ( _items.size() == 0)\n return sUNDEF;\n QString names;\n for(const SPNumericItem& it: _items) {\n if ( names != \"\")\n names += \";\";\n names += it->name();\n }\n return names;\n}\n\nItemRange *NumericItemRange::clone() const\n{\n ItemRange *items = new NumericItemRange();\n for(const SPNumericItem& it: _items) {\n items->add(it->clone());\n }\n\n return items;\n\n}\n\nNumericItemRange &NumericItemRange::operator <<(const QString &itemdef)\n{\n QStringList parts = itemdef.split(\" \");\n if( parts.size() > 1) {\n bool ok;\n double step = 0;\n double mn = parts[0].toDouble(&ok);\n if(ok) {\n double mx = parts[1].toDouble(&ok);\n if ( ok) {\n if ( parts.size() == 3) {\n step = parts[2].toDouble(&ok);\n\n }\n if (ok) {\n add(new NumericItem({mn,mx, step}));\n return *this;\n }\n }\n }\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n } if ( parts.size() == 1) {\n if ( count() == 0) {\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n return *this;\n }\n bool ok;\n double vmin = _items[_items.size() - 1]->range().max();\n double vmax = itemdef.toDouble(&ok) ;\n if (!ok) {\n ERROR1(ERR_NO_INITIALIZED_1, \"numeric item range\");\n }\n double step = _items[0]->range().step();\n if ( step == 0)\n vmin += EPS8;\n add(new NumericItem({vmin+step,vmax, step}));\n }\n return *this;\n}\n\nbool NumericItemRange::isContinous() const\n{\n return _interpolation != \"\";\n}\n\nQString NumericItemRange::interpolation() const\n{\n return _interpolation;\n}\n\nvoid NumericItemRange::interpolation(const QString &ip)\n{\n _interpolation = ip;\n}\n\nvoid NumericItemRange::addRange(const ItemRange &range)\n{\n ItemRange::addRange(range);\n _interpolation = static_cast<const NumericItemRange&>(range).interpolation();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This include needs to be the very first to prevent problems with warnings \n\/\/ regarding redefinition of _POSIX_C_SOURCE\n#include <boost\/python.hpp>\n\n#include <iostream>\n\n#include \"IECore\/IndexedIOInterface.h\"\n#include \"IECore\/FileSystemIndexedIO.h\"\n#include \"IECore\/SQLiteIndexedIO.h\"\n#include \"IECore\/FileIndexedIO.h\"\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/bindings\/IntrusivePtrPatch.h\"\n\nusing namespace boost::python;\nusing namespace IECore;\n\nvoid bindIndexedIOEntry(const char *bindName);\nvoid bindIndexedIOEntryList(const char *bindName);\n\nvoid bindIndexedIOFilter(const char *bindName);\nvoid bindIndexedIONullFilter(const char *bindName);\nvoid bindIndexedIOEntryTypeFilter(const char *bindName);\nvoid bindIndexedIORegexFilter(const char *bindName);\n\nvoid bindIndexedIOInterface(const char *bindName);\nvoid bindFileSystemIndexedIO(const char *bindName);\nvoid bindSQLiteIndexedIO(const char *bindName);\nvoid bindFileIndexedIO(const char *bindName);\n\nvoid stupidTest();\n\nvoid bindIndexedIO()\n{\n\tbindIndexedIOEntry(\"IndexedIOEntry\");\n\tbindIndexedIOEntryList(\"IndexedIOEntryList\");\n\t\n\tbindIndexedIOFilter(\"IndexedIOFilter\");\n\tbindIndexedIONullFilter(\"IndexedIONullFilter\");\n\tbindIndexedIOEntryTypeFilter(\"IndexedIOEntryTypeFilter\");\n\tbindIndexedIORegexFilter(\"IndexedIORegexFilter\");\n\t\n\tbindIndexedIOInterface(\"IndexedIOInterface\");\t\n\tbindFileSystemIndexedIO(\"FileSystemIndexedIO\");\t\n#ifdef IECORE_WITH_SQLITE\n\tbindSQLiteIndexedIO(\"SQLiteIndexedIO\");\n#endif \/\/ IECORE_WITH_SQLITE\n\tbindFileIndexedIO(\"FileIndexedIO\");\t\n}\n\nstruct IndexedIOInterfaceHelper\n{\n\tstatic IndexedIO::Entry ls(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls(name);\t\t\n\t}\n\t\n\tstatic IndexedIO::EntryList ls(IndexedIOInterfacePtr p)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls();\n\t}\n\t\n\tstatic IndexedIO::EntryList ls(IndexedIOInterfacePtr p, IndexedIOFilterPtr f)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls(f);\n\t}\n\t\n\ttemplate<typename T>\n\tstatic void writeVector(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, \n\t\tconst boost::intrusive_ptr< TypedData < T > > &x)\n\t{\n\t\tassert(p);\n\t\t\n\t\tconst typename T::value_type *data = &(x->readable())[0];\t\n\t\tp->write( name, data, (unsigned long)x->readable().size() );\n\t}\n\t\n\ttemplate<typename T>\n\tstatic boost::intrusive_ptr<TypedData<T> > readSingle(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, const IndexedIO::Entry &entry)\n\t{\t\n\t\tT data;\n\t\tp->read(name, data);\t\t\n\t\treturn new TypedData<T>( data );\n\t}\n\t\n\ttemplate<typename T>\n\tstatic boost::intrusive_ptr<TypedData< std::vector<T> > > readArray(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, const IndexedIO::Entry &entry)\n\t{\t\n\t\tunsigned long count = entry.arrayLength();\t\t\n\t\tboost::intrusive_ptr< TypedData<std::vector<T> > > x = new TypedData<std::vector<T> > ();\t\n\t\tx->writable().resize( entry.arrayLength() );\t\t\n\t\tT *data = &(x->writable()[0]);\t\t\n\t\tp->read(name, data, count);\t\t\n\t\t\n\t\treturn x;\n\t}\n\t\t\t\n\tstatic DataPtr read(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\tIndexedIO::Entry entry = p->ls(name);\t\n\n\t\tswitch( entry.dataType() )\n\t\t{\n\t\t\tcase IndexedIO::Float:\n\t\t\t\treturn readSingle<float>(p, name, entry);\n\t\t\tcase IndexedIO::Double:\n\t\t\t\treturn readSingle<double>(p, name, entry);\n\t\t\tcase IndexedIO::Int:\n\t\t\t\treturn readSingle<int>(p, name, entry);\n\t\t\tcase IndexedIO::Long:\n\t\t\t\treturn readSingle<long>(p, name, entry);\n\t\t\tcase IndexedIO::String:\n\t\t\t\treturn readSingle<std::string>(p, name, entry);\n\t\t\tcase IndexedIO::StringArray:\n\t\t\t\treturn readArray<std::string>(p, name, entry);\n\t\t\tcase IndexedIO::FloatArray:\n\t\t\t\treturn readArray<float>(p, name, entry);\n\t\t\tcase IndexedIO::DoubleArray:\n\t\t\t\treturn readArray<double>(p, name, entry);\n\t\t\tcase IndexedIO::IntArray:\n\t\t\t\treturn readArray<int>(p, name, entry);\n\t\t\tcase IndexedIO::LongArray:\n\t\t\t\treturn readArray<long>(p, name, entry);\t\t\t\n\t\t\tcase IndexedIO::UInt:\n\t\t\t\treturn readSingle<unsigned int>(p, name, entry);\n\t\t\tcase IndexedIO::UIntArray:\n\t\t\t\treturn readArray<unsigned int>(p, name, entry);\n\t\t\tcase IndexedIO::Char:\n\t\t\t\treturn readSingle<char>(p, name, entry);\n\t\t\tcase IndexedIO::CharArray:\n\t\t\t\treturn readArray<char>(p, name, entry);\n\t\t\tcase IndexedIO::UChar:\n\t\t\t\treturn readSingle<unsigned char>(p, name, entry);\n\t\t\tcase IndexedIO::UCharArray:\n\t\t\t\treturn readArray<unsigned char>(p, name, entry);\n\t\t\tdefault:\n\t\t\t\tthrow IOException(name);\n\t\t}\t\t\n\t}\n\t\t\n\tstatic std::string readString(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\tstd::string x;\n\t\tp->read(name, x);\n\t\treturn x;\n\t}\n};\n\nvoid bindIndexedIOInterface(const char *bindName)\n{\t\t\n\tIndexedIO::EntryList (*lsNoFilter)(IndexedIOInterfacePtr) = &IndexedIOInterfaceHelper::ls;\n\tIndexedIO::EntryList (*lsFilter)(IndexedIOInterfacePtr, IndexedIOFilterPtr) = &IndexedIOInterfaceHelper::ls;\n\tIndexedIO::Entry (*lsEntry)(IndexedIOInterfacePtr, const IndexedIO::EntryID &) = &IndexedIOInterfaceHelper::ls;\t\n\t\n\tvoid (IndexedIOInterface::*writeFloat)(const IndexedIO::EntryID &, const float &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeDouble)(const IndexedIO::EntryID &, const double &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeInt)(const IndexedIO::EntryID &, const int &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeLong)(const IndexedIO::EntryID &, const long &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeString)(const IndexedIO::EntryID &, const std::string &) = &IndexedIOInterface::write;\n#if 0\t\n\tvoid (IndexedIOInterface::*writeUInt)(const IndexedIO::EntryID &, const unsigned int &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeChar)(const IndexedIO::EntryID &, const char &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeUChar)(const IndexedIO::EntryID &, const unsigned char &) = &IndexedIOInterface::write;\n#endif\t\n\t\n\t\n\tenum_< IndexedIO::OpenModeFlags> (\"IndexedIOOpenMode\")\n\t\t.value(\"Read\", IndexedIO::Read)\n\t\t.value(\"Write\", IndexedIO::Write)\n\t\t.value(\"Append\", IndexedIO::Append)\n\t\t.value(\"Shared\", IndexedIO::Shared)\n\t\t.value(\"Exclusive\", IndexedIO::Exclusive)\n\t\t.export_values()\n\t;\n\t\n\tenum_< IndexedIO::EntryType > (\"IndexedIOEntryType\")\n\t\t.value(\"Directory\", IndexedIO::Directory)\n\t\t.value(\"File\", IndexedIO::File)\n\t\t.export_values()\n\t;\n\n\tenum_< IndexedIO::DataType > (\"IndexedIODataType\")\n\t\t.value(\"Float\", IndexedIO::Float)\n\t\t.value(\"FloatArray\", IndexedIO::FloatArray)\n\t\t.value(\"Double\", IndexedIO::Double)\n\t\t.value(\"DoubleArray\", IndexedIO::DoubleArray)\n\t\t.value(\"Int\", IndexedIO::Int)\n\t\t.value(\"IntArray\", IndexedIO::IntArray)\n\t\t.value(\"Long\", IndexedIO::Long)\n\t\t.value(\"LongArray\", IndexedIO::LongArray)\n\t\t.value(\"String\", IndexedIO::String)\n\t\t.value(\"UInt\", IndexedIO::UInt)\n\t\t.value(\"UIntArray\", IndexedIO::UIntArray)\n\t\t.value(\"Char\", IndexedIO::Char)\n\t\t.value(\"CharArray\", IndexedIO::CharArray)\n\t\t.value(\"UChar\", IndexedIO::UChar)\n\t\t.value(\"UChar\", IndexedIO::UCharArray)\n\t\t.export_values()\n\t;\n\t\n\ttypedef class_< IndexedIOInterface, boost::noncopyable, IndexedIOInterfacePtr, bases<RefCounted> > IndexedIOInterfacePyClass;\n\tIndexedIOInterfacePyClass( bindName, no_init )\n\t\t.def(\"resetRoot\", &IndexedIOInterface::resetRoot)\n\t\t.def(\"chdir\", &IndexedIOInterface::chdir)\n\t\t.def(\"mkdir\", &IndexedIOInterface::mkdir)\n\t\t.def(\"pwd\", &IndexedIOInterface::pwd)\n\t\t.def(\"rm\", &IndexedIOInterface::rm)\n\t\t.def(\"ls\", lsFilter)\n\t\t.def(\"ls\", lsNoFilter)\n\t\t.def(\"ls\", lsEntry)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<float> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<double> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<int> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<long> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<std::string> >)\n\t\t.def(\"write\", writeFloat)\n\t\t.def(\"write\", writeDouble)\n\t\t.def(\"write\", writeInt)\n\t\t.def(\"write\", writeLong)\n\t\t.def(\"write\", writeString)\n#if 0\n\t\t\/\/ We dont really want to bind these because they don't represent natural Python datatypes\n\t\t.def(\"write\", writeUInt)\n\t\t.def(\"write\", writeChar)\n\t\t.def(\"write\", writeUChar)\n#endif\t\t\n\t\t.def(\"read\", &IndexedIOInterfaceHelper::read)\n\t\t.def(\"create\", &IndexedIOInterface::create ).staticmethod(\"create\")\t\n\t\n\t;\n\tINTRUSIVE_PTR_PATCH( IndexedIOInterface, IndexedIOInterfacePyClass );\n\n\timplicitly_convertible<IndexedIOInterfacePtr, RefCountedPtr>();\n}\n\nvoid bindFileSystemIndexedIO(const char *bindName)\n{\t\n\tclass_< FileSystemIndexedIO, FileSystemIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\t\t\t\t\n\t;\n\t\n\timplicitly_convertible< FileSystemIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n\n\n#ifdef IECORE_WITH_SQLITE\nvoid bindSQLiteIndexedIO(const char *bindName)\n{\t\n\tclass_< SQLiteIndexedIO, SQLiteIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\n\t;\n\t\n\timplicitly_convertible< SQLiteIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n#endif \/\/ IECORE_WITH_SQLITE\n\nvoid bindFileIndexedIO(const char *bindName)\n{\t\n\tclass_< FileIndexedIO, FileIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\n\t;\n\t\n\timplicitly_convertible< FileIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n\nvoid bindIndexedIOEntry(const char *bindName)\n{\n\tclass_< IndexedIO::Entry>(bindName, no_init)\t\t\n\t\t.def(\"id\", &IndexedIO::Entry::id)\n\t\t.def(\"entryType\", &IndexedIO::Entry::entryType)\t\t\n\t\t.def(\"dataType\", &IndexedIO::Entry::dataType)\n\t\t.def(\"arrayLength\", &IndexedIO::Entry::arrayLength)\n\t\t;\n}\n\nstruct EntryListAccessor\n{\t\n\tstatic IndexedIO::Entry get(const IndexedIO::EntryList &x, int i)\n\t{\n\t\tif (i < 0)\n\t\t\ti += x.size();\n\t\t\n\t\tif (i >= 0 && i < static_cast<int>(x.size()))\n\t\t{\n\t\t\tint idx = 0;\n\t\t\t\n\t\t\tIndexedIO::EntryList::const_iterator it = x.begin();\n\t\t\twhile (idx != i)\n\t\t\t\tit++, idx++;\n\t\t\t\n\t\t\tassert(it != x.end());\n\t\t\t\n\t\t\treturn *it;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow std::out_of_range(\"\");\t\n\t\t}\n\t}\n\t\n\tstatic int len(const IndexedIO::EntryList &x)\n\t{\n\t\treturn static_cast<int>(x.size());\n\t}\n};\n\nvoid bindIndexedIOEntryList(const char *bindName)\n{\n\tclass_< IndexedIO::EntryList>(bindName, no_init)\n\t\t.def(\"__getitem__\", &EntryListAccessor::get)\n\t\t.def(\"__len__\", &EntryListAccessor::len)\n\t;\n}\n\nvoid bindIndexedIOFilter(const char *bindName)\n{\n\tclass_< IndexedIOFilter, boost::noncopyable, IndexedIOFilterPtr>(bindName, no_init)\n\t\t.def(\"add\", &IndexedIOFilter::add )\n\t\t.def(\"apply\", &IndexedIOFilter::apply )\n\t\t.def(\"filter\", &IndexedIOFilter::filter )\n\t;\t\n}\n\nvoid bindIndexedIONullFilter(const char *bindName)\n{\n\tclass_<IndexedIONullFilter, IndexedIONullFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIONullFilterPtr, IndexedIOFilterPtr >();\t\n}\n\n\nvoid bindIndexedIOEntryTypeFilter(const char *bindName)\n{\n\tclass_<IndexedIOEntryTypeFilter, IndexedIOEntryTypeFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<IndexedIO::EntryType>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIOEntryTypeFilterPtr, IndexedIOFilterPtr >();\t\n}\n\nvoid bindIndexedIORegexFilter(const char *bindName)\n{\n\tclass_<IndexedIORegexFilter, IndexedIORegexFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<const std::string &>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIORegexFilterPtr, IndexedIOFilterPtr >();\t\n}\n<commit_msg>Removed some nonsense.<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2007, Image Engine Design Inc. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ * Neither the name of Image Engine Design nor the names of any\n\/\/ other contributors to this software may be used to endorse or\n\/\/ promote products derived from this software without specific prior\n\/\/ written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS\n\/\/ IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,\n\/\/ THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n\/\/ PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n\/\/ CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n\/\/ EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n\/\/ PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n\/\/ PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n\/\/ LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n\/\/ NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This include needs to be the very first to prevent problems with warnings \n\/\/ regarding redefinition of _POSIX_C_SOURCE\n#include <boost\/python.hpp>\n\n#include <iostream>\n\n#include \"IECore\/IndexedIOInterface.h\"\n#include \"IECore\/FileSystemIndexedIO.h\"\n#include \"IECore\/SQLiteIndexedIO.h\"\n#include \"IECore\/FileIndexedIO.h\"\n#include \"IECore\/VectorTypedData.h\"\n#include \"IECore\/bindings\/IntrusivePtrPatch.h\"\n\nusing namespace boost::python;\nusing namespace IECore;\n\nvoid bindIndexedIOEntry(const char *bindName);\nvoid bindIndexedIOEntryList(const char *bindName);\n\nvoid bindIndexedIOFilter(const char *bindName);\nvoid bindIndexedIONullFilter(const char *bindName);\nvoid bindIndexedIOEntryTypeFilter(const char *bindName);\nvoid bindIndexedIORegexFilter(const char *bindName);\n\nvoid bindIndexedIOInterface(const char *bindName);\nvoid bindFileSystemIndexedIO(const char *bindName);\nvoid bindSQLiteIndexedIO(const char *bindName);\nvoid bindFileIndexedIO(const char *bindName);\n\nvoid bindIndexedIO()\n{\n\tbindIndexedIOEntry(\"IndexedIOEntry\");\n\tbindIndexedIOEntryList(\"IndexedIOEntryList\");\n\t\n\tbindIndexedIOFilter(\"IndexedIOFilter\");\n\tbindIndexedIONullFilter(\"IndexedIONullFilter\");\n\tbindIndexedIOEntryTypeFilter(\"IndexedIOEntryTypeFilter\");\n\tbindIndexedIORegexFilter(\"IndexedIORegexFilter\");\n\t\n\tbindIndexedIOInterface(\"IndexedIOInterface\");\t\n\tbindFileSystemIndexedIO(\"FileSystemIndexedIO\");\t\n#ifdef IECORE_WITH_SQLITE\n\tbindSQLiteIndexedIO(\"SQLiteIndexedIO\");\n#endif \/\/ IECORE_WITH_SQLITE\n\tbindFileIndexedIO(\"FileIndexedIO\");\t\n}\n\nstruct IndexedIOInterfaceHelper\n{\n\tstatic IndexedIO::Entry ls(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls(name);\t\t\n\t}\n\t\n\tstatic IndexedIO::EntryList ls(IndexedIOInterfacePtr p)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls();\n\t}\n\t\n\tstatic IndexedIO::EntryList ls(IndexedIOInterfacePtr p, IndexedIOFilterPtr f)\n\t{\n\t\tassert(p);\n\t\t\n\t\treturn p->ls(f);\n\t}\n\t\n\ttemplate<typename T>\n\tstatic void writeVector(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, \n\t\tconst boost::intrusive_ptr< TypedData < T > > &x)\n\t{\n\t\tassert(p);\n\t\t\n\t\tconst typename T::value_type *data = &(x->readable())[0];\t\n\t\tp->write( name, data, (unsigned long)x->readable().size() );\n\t}\n\t\n\ttemplate<typename T>\n\tstatic boost::intrusive_ptr<TypedData<T> > readSingle(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, const IndexedIO::Entry &entry)\n\t{\t\n\t\tT data;\n\t\tp->read(name, data);\t\t\n\t\treturn new TypedData<T>( data );\n\t}\n\t\n\ttemplate<typename T>\n\tstatic boost::intrusive_ptr<TypedData< std::vector<T> > > readArray(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name, const IndexedIO::Entry &entry)\n\t{\t\n\t\tunsigned long count = entry.arrayLength();\t\t\n\t\tboost::intrusive_ptr< TypedData<std::vector<T> > > x = new TypedData<std::vector<T> > ();\t\n\t\tx->writable().resize( entry.arrayLength() );\t\t\n\t\tT *data = &(x->writable()[0]);\t\t\n\t\tp->read(name, data, count);\t\t\n\t\t\n\t\treturn x;\n\t}\n\t\t\t\n\tstatic DataPtr read(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\tIndexedIO::Entry entry = p->ls(name);\t\n\n\t\tswitch( entry.dataType() )\n\t\t{\n\t\t\tcase IndexedIO::Float:\n\t\t\t\treturn readSingle<float>(p, name, entry);\n\t\t\tcase IndexedIO::Double:\n\t\t\t\treturn readSingle<double>(p, name, entry);\n\t\t\tcase IndexedIO::Int:\n\t\t\t\treturn readSingle<int>(p, name, entry);\n\t\t\tcase IndexedIO::Long:\n\t\t\t\treturn readSingle<long>(p, name, entry);\n\t\t\tcase IndexedIO::String:\n\t\t\t\treturn readSingle<std::string>(p, name, entry);\n\t\t\tcase IndexedIO::StringArray:\n\t\t\t\treturn readArray<std::string>(p, name, entry);\n\t\t\tcase IndexedIO::FloatArray:\n\t\t\t\treturn readArray<float>(p, name, entry);\n\t\t\tcase IndexedIO::DoubleArray:\n\t\t\t\treturn readArray<double>(p, name, entry);\n\t\t\tcase IndexedIO::IntArray:\n\t\t\t\treturn readArray<int>(p, name, entry);\n\t\t\tcase IndexedIO::LongArray:\n\t\t\t\treturn readArray<long>(p, name, entry);\t\t\t\n\t\t\tcase IndexedIO::UInt:\n\t\t\t\treturn readSingle<unsigned int>(p, name, entry);\n\t\t\tcase IndexedIO::UIntArray:\n\t\t\t\treturn readArray<unsigned int>(p, name, entry);\n\t\t\tcase IndexedIO::Char:\n\t\t\t\treturn readSingle<char>(p, name, entry);\n\t\t\tcase IndexedIO::CharArray:\n\t\t\t\treturn readArray<char>(p, name, entry);\n\t\t\tcase IndexedIO::UChar:\n\t\t\t\treturn readSingle<unsigned char>(p, name, entry);\n\t\t\tcase IndexedIO::UCharArray:\n\t\t\t\treturn readArray<unsigned char>(p, name, entry);\n\t\t\tdefault:\n\t\t\t\tthrow IOException(name);\n\t\t}\t\t\n\t}\n\t\t\n\tstatic std::string readString(IndexedIOInterfacePtr p, const IndexedIO::EntryID &name)\n\t{\n\t\tassert(p);\n\t\t\n\t\tstd::string x;\n\t\tp->read(name, x);\n\t\treturn x;\n\t}\n};\n\nvoid bindIndexedIOInterface(const char *bindName)\n{\t\t\n\tIndexedIO::EntryList (*lsNoFilter)(IndexedIOInterfacePtr) = &IndexedIOInterfaceHelper::ls;\n\tIndexedIO::EntryList (*lsFilter)(IndexedIOInterfacePtr, IndexedIOFilterPtr) = &IndexedIOInterfaceHelper::ls;\n\tIndexedIO::Entry (*lsEntry)(IndexedIOInterfacePtr, const IndexedIO::EntryID &) = &IndexedIOInterfaceHelper::ls;\t\n\t\n\tvoid (IndexedIOInterface::*writeFloat)(const IndexedIO::EntryID &, const float &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeDouble)(const IndexedIO::EntryID &, const double &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeInt)(const IndexedIO::EntryID &, const int &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeLong)(const IndexedIO::EntryID &, const long &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeString)(const IndexedIO::EntryID &, const std::string &) = &IndexedIOInterface::write;\n#if 0\t\n\tvoid (IndexedIOInterface::*writeUInt)(const IndexedIO::EntryID &, const unsigned int &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeChar)(const IndexedIO::EntryID &, const char &) = &IndexedIOInterface::write;\n\tvoid (IndexedIOInterface::*writeUChar)(const IndexedIO::EntryID &, const unsigned char &) = &IndexedIOInterface::write;\n#endif\t\n\t\n\t\n\tenum_< IndexedIO::OpenModeFlags> (\"IndexedIOOpenMode\")\n\t\t.value(\"Read\", IndexedIO::Read)\n\t\t.value(\"Write\", IndexedIO::Write)\n\t\t.value(\"Append\", IndexedIO::Append)\n\t\t.value(\"Shared\", IndexedIO::Shared)\n\t\t.value(\"Exclusive\", IndexedIO::Exclusive)\n\t\t.export_values()\n\t;\n\t\n\tenum_< IndexedIO::EntryType > (\"IndexedIOEntryType\")\n\t\t.value(\"Directory\", IndexedIO::Directory)\n\t\t.value(\"File\", IndexedIO::File)\n\t\t.export_values()\n\t;\n\n\tenum_< IndexedIO::DataType > (\"IndexedIODataType\")\n\t\t.value(\"Float\", IndexedIO::Float)\n\t\t.value(\"FloatArray\", IndexedIO::FloatArray)\n\t\t.value(\"Double\", IndexedIO::Double)\n\t\t.value(\"DoubleArray\", IndexedIO::DoubleArray)\n\t\t.value(\"Int\", IndexedIO::Int)\n\t\t.value(\"IntArray\", IndexedIO::IntArray)\n\t\t.value(\"Long\", IndexedIO::Long)\n\t\t.value(\"LongArray\", IndexedIO::LongArray)\n\t\t.value(\"String\", IndexedIO::String)\n\t\t.value(\"UInt\", IndexedIO::UInt)\n\t\t.value(\"UIntArray\", IndexedIO::UIntArray)\n\t\t.value(\"Char\", IndexedIO::Char)\n\t\t.value(\"CharArray\", IndexedIO::CharArray)\n\t\t.value(\"UChar\", IndexedIO::UChar)\n\t\t.value(\"UChar\", IndexedIO::UCharArray)\n\t\t.export_values()\n\t;\n\t\n\ttypedef class_< IndexedIOInterface, boost::noncopyable, IndexedIOInterfacePtr, bases<RefCounted> > IndexedIOInterfacePyClass;\n\tIndexedIOInterfacePyClass( bindName, no_init )\n\t\t.def(\"resetRoot\", &IndexedIOInterface::resetRoot)\n\t\t.def(\"chdir\", &IndexedIOInterface::chdir)\n\t\t.def(\"mkdir\", &IndexedIOInterface::mkdir)\n\t\t.def(\"pwd\", &IndexedIOInterface::pwd)\n\t\t.def(\"rm\", &IndexedIOInterface::rm)\n\t\t.def(\"ls\", lsFilter)\n\t\t.def(\"ls\", lsNoFilter)\n\t\t.def(\"ls\", lsEntry)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<float> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<double> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<int> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<long> >)\n\t\t.def(\"write\", &IndexedIOInterfaceHelper::writeVector<std::vector<std::string> >)\n\t\t.def(\"write\", writeFloat)\n\t\t.def(\"write\", writeDouble)\n\t\t.def(\"write\", writeInt)\n\t\t.def(\"write\", writeLong)\n\t\t.def(\"write\", writeString)\n#if 0\n\t\t\/\/ We dont really want to bind these because they don't represent natural Python datatypes\n\t\t.def(\"write\", writeUInt)\n\t\t.def(\"write\", writeChar)\n\t\t.def(\"write\", writeUChar)\n#endif\t\t\n\t\t.def(\"read\", &IndexedIOInterfaceHelper::read)\n\t\t.def(\"create\", &IndexedIOInterface::create ).staticmethod(\"create\")\t\n\t\n\t;\n\tINTRUSIVE_PTR_PATCH( IndexedIOInterface, IndexedIOInterfacePyClass );\n\n\timplicitly_convertible<IndexedIOInterfacePtr, RefCountedPtr>();\n}\n\nvoid bindFileSystemIndexedIO(const char *bindName)\n{\t\n\tclass_< FileSystemIndexedIO, FileSystemIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\t\t\t\t\n\t;\n\t\n\timplicitly_convertible< FileSystemIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n\n\n#ifdef IECORE_WITH_SQLITE\nvoid bindSQLiteIndexedIO(const char *bindName)\n{\t\n\tclass_< SQLiteIndexedIO, SQLiteIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\n\t;\n\t\n\timplicitly_convertible< SQLiteIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n#endif \/\/ IECORE_WITH_SQLITE\n\nvoid bindFileIndexedIO(const char *bindName)\n{\t\n\tclass_< FileIndexedIO, FileIndexedIOPtr, boost::noncopyable, bases<IndexedIOInterface> >(bindName, no_init)\n\t\t.def(init<const std::string &, const std::string &, IndexedIO::OpenMode >())\n\t;\n\t\n\timplicitly_convertible< FileIndexedIOPtr, IndexedIOInterfacePtr >();\n}\n\nvoid bindIndexedIOEntry(const char *bindName)\n{\n\tclass_< IndexedIO::Entry>(bindName, no_init)\t\t\n\t\t.def(\"id\", &IndexedIO::Entry::id)\n\t\t.def(\"entryType\", &IndexedIO::Entry::entryType)\t\t\n\t\t.def(\"dataType\", &IndexedIO::Entry::dataType)\n\t\t.def(\"arrayLength\", &IndexedIO::Entry::arrayLength)\n\t\t;\n}\n\nstruct EntryListAccessor\n{\t\n\tstatic IndexedIO::Entry get(const IndexedIO::EntryList &x, int i)\n\t{\n\t\tif (i < 0)\n\t\t\ti += x.size();\n\t\t\n\t\tif (i >= 0 && i < static_cast<int>(x.size()))\n\t\t{\n\t\t\tint idx = 0;\n\t\t\t\n\t\t\tIndexedIO::EntryList::const_iterator it = x.begin();\n\t\t\twhile (idx != i)\n\t\t\t\tit++, idx++;\n\t\t\t\n\t\t\tassert(it != x.end());\n\t\t\t\n\t\t\treturn *it;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow std::out_of_range(\"\");\t\n\t\t}\n\t}\n\t\n\tstatic int len(const IndexedIO::EntryList &x)\n\t{\n\t\treturn static_cast<int>(x.size());\n\t}\n};\n\nvoid bindIndexedIOEntryList(const char *bindName)\n{\n\tclass_< IndexedIO::EntryList>(bindName, no_init)\n\t\t.def(\"__getitem__\", &EntryListAccessor::get)\n\t\t.def(\"__len__\", &EntryListAccessor::len)\n\t;\n}\n\nvoid bindIndexedIOFilter(const char *bindName)\n{\n\tclass_< IndexedIOFilter, boost::noncopyable, IndexedIOFilterPtr>(bindName, no_init)\n\t\t.def(\"add\", &IndexedIOFilter::add )\n\t\t.def(\"apply\", &IndexedIOFilter::apply )\n\t\t.def(\"filter\", &IndexedIOFilter::filter )\n\t;\t\n}\n\nvoid bindIndexedIONullFilter(const char *bindName)\n{\n\tclass_<IndexedIONullFilter, IndexedIONullFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIONullFilterPtr, IndexedIOFilterPtr >();\t\n}\n\n\nvoid bindIndexedIOEntryTypeFilter(const char *bindName)\n{\n\tclass_<IndexedIOEntryTypeFilter, IndexedIOEntryTypeFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<IndexedIO::EntryType>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIOEntryTypeFilterPtr, IndexedIOFilterPtr >();\t\n}\n\nvoid bindIndexedIORegexFilter(const char *bindName)\n{\n\tclass_<IndexedIORegexFilter, IndexedIORegexFilterPtr, bases<IndexedIOFilter> >(bindName, no_init)\n\t\t.def(init<const std::string &>())\n\t;\n\t\n\t\/\/ Ensure we can upcast from a IndexedIOEntryTypeFilterPtr to a IndexedIOFilterPtr\n\timplicitly_convertible< IndexedIORegexFilterPtr, IndexedIOFilterPtr >();\t\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <string>\n#include <vector>\n#include <memory>\n\n#include <glm\/glm.hpp>\n\n#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n\n#include \"Mesh.h\"\n#include \"Scene.h\"\n#include \"Window.h\"\n#include \"Renderer.h\"\n#include \"Renderable.h\"\n#include \"ModelLoader.h\"\n#include \"ImGuiAdapter.h\"\n#include \"DiffuseMaterial.h\"\n\nint main(int argc, char *argv[])\n{\n\t\/\/\n\t\/\/ Logging etc.\n\t\/\/\n\n\tint width = 1280;\n\tint height = 720;\n\tbool fullscreen = false;\n\tbool vsync = false;\n\n#if defined(_DEBUG) or defined(DEBUG)\n\tLogger::Heading(\"Rendeer - debug build\");\n#else\n\tLogger::Heading(\"Rendeer - release build\");\n#endif\n\tLogger::Log(\" - Resolution:\\t %dx%d\", width, height);\n\tLogger::Log(\" - Fullscreen:\\t %s\", Logger::BoolToString(fullscreen));\n\tLogger::Log(\" - Vsync:\\t\\t %s\", Logger::BoolToString(vsync));\n\n\tLogger::Subheading(\"Scene setup begin\");\n\tLogger::LogTimestamp();\n\tLogger::EmptyLine();\n\n\t\/\/\n\t\/\/ Setup\n\t\/\/\n\n\tWindow window{ width, height, fullscreen, vsync };\n\tRenderer renderer{ &window };\n\tImGuiAdapter::Init(&window);\n\n\t\/\/\n\t\/\/ Define scene\n\t\/\/\n\n\tScene scene;\n\n\tauto camera = std::make_shared<Camera>(\n\t\tglm::vec3{ 0, 1.7f, -5.0f },\n\t\tglm::angleAxis(0.15f, glm::vec3{ 1, 0, 0 })\n\t);\n\tscene.AddChild(camera);\n\n\tscene.SetSkybox(std::make_shared<TextureCube>(\n\t\tBitmap{\"textures\/skybox_sunset\/left.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/right.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/bottom.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/top.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/front.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/back.png\"}\n\t));\n\n\tscene.SetAmbientColor(glm::vec3{ 0.02f, 0.02f, 0.02f });\n\n\tauto teapot = ModelLoader::Load(\"models\/teapot\/teapot.obj\");\n\tscene.AddChild(teapot)->GetTransform().SetScale(0.032f);\n\n\tauto sponza = ModelLoader::Load(\"models\/dabrovic-sponza\/sponza.obj\");\n\tscene.AddChild(sponza);\n\n\t\/\/auto directionalLight = scene.NewChild();\n\t\/\/directionalLight->GetTransform().SetOrientation(glm::quat{ 0.00873f, 0.0f, 0.0f, 0.99996f });\n\t\/\/directionalLight->AddComponent(std::make_shared<DirectionalLight>(glm::vec3{ 0.92f, 0.95f, 0.88f }, 1.5f));\n\n\tauto pointLight = scene.NewChild();\n\tpointLight->AddComponent(std::make_shared<PointLight>(glm::vec3{ 1.0f, 0.1f, 0.15f }, 1.35f));\n\n\tauto spotLight = scene.NewChild();\n\tspotLight->GetTransform()\n\t\t.SetPosition(glm::vec3{ 0, 10.0f, 0 })\n\t\t.SetOrientation(glm::angleAxis(3.141592f \/ 2.0f, glm::vec3{1, 0, 0 }));\n\tspotLight->AddComponent(std::make_shared<SpotLight>(glm::vec3{ 1.0f, 0.6f, 0.6f }, 12.0f, glm::radians(40.0f), glm::radians(5.0f)));\n\n\t\/\/ Set up the extra camera\n\tauto extraCamera = std::make_shared<CameraComponent>(16.0f \/ 9.0f, 0.1f, 1000.0f, glm::radians(50.0f));\n\tauto extraCameraTexture = std::make_shared<Texture2D>(853, 480, GL_RGBA, GL_RGBA8, GL_CLAMP_TO_EDGE, GL_NEAREST, GL_NEAREST);\n\tauto extraCameraTarget = std::make_shared<FrameBuffer>();\n\textraCameraTarget->Attach(extraCameraTexture.get(), GL_COLOR_ATTACHMENT0);\n\textraCamera->SetTarget(extraCameraTarget);\n\tspotLight->NewChild()->AddComponent(extraCamera);\n\n\t\/\/ Set up the extra camera target model\n\tauto tv = ModelLoader::Load(\"models\/cube.obj\");\n\ttv->GetTransform()\n\t\t.SetPosition(15.0f, 2.3f, 0)\n\t\t.SetScale(1.8f).Scale(0.05f, 16.0f \/ 9.0f, 1) \/\/ TODO: Fix mirroring etc.\n\t\t.Rotate(glm::vec3{1,0,0}, 3.1415f \/ 2.0f);\n\tscene.AddChild(tv);\n\t{\n\t\t\/\/ HACK!!! There needs to be a real nice way to search for a component in a scene graph!\n\t\tauto renderable = tv->GetDirectChildren().front()->GetComponent<Renderable>();\n\t\tauto mat = std::dynamic_pointer_cast<DiffuseMaterial>(renderable->GetMaterial());\n\t\tmat->diffuseTexture = extraCameraTexture;\n\t\tmat->specularIntensity = 0.0f;\n\t\tmat->emissive = 0.25f;\n\t}\n\n\t\/\/\n\t\/\/ Render\/game loop\n\t\/\/\n\n\tLogger::Subheading(\"Render loop begin\");\n\tLogger::LogTimestamp();\n\tLogger::EmptyLine();\n\n\tglfwSetTime(0.0);\n\tdouble currentTime = 0.0;\n\tdouble previousTime = glfwGetTime();\n\n\tfloat animation = 0.0f;\n\n\tbool stickDirectionalLightToCamera = false;\n\n\twindow.Focus();\n\twhile (!window.IsCloseRequested())\n\t{\n\t\tcurrentTime = glfwGetTime();\n\t\tconst double dt = currentTime - previousTime;\n\t\tconst float deltaTime = static_cast<float>(dt);\n\t\tpreviousTime = currentTime;\n\n\t\twindow.PollEvents();\n\t\tImGuiAdapter::NewFrame(deltaTime);\n\n\t\tif (window.IsCursorHidden())\n\t\t{\n\t\t\tcamera->Update(deltaTime, window);\n\t\t}\n\n\t\tif (window.WasKeyPressed(GLFW_KEY_LEFT_ALT))\n\t\t{\n\t\t\twindow.SetCursorHidden(!window.IsCursorHidden());\n\t\t}\n\n\t\tanimation += deltaTime;\n\n\t\tteapot->GetTransform()\n\t\t\t.SetOrientation(glm::vec3(0, 1, 0), 0.7f * animation)\n\t\t\t.SetPosition(0, 0.4f + 0.2f * cosf(2.0f * animation), 0);\n\n\t\tpointLight->GetTransform().SetPosition(\n\t\t\t6.0f * cosf(1.3f * animation),\n\t\t\t1.4f + 0.6f * cosf(sinf(animation)),\n\t\t\t6.0f * sinf(1.3f * animation)\n\t\t);\n\n\t\tif (window.WasKeyPressed(GLFW_KEY_LEFT_CONTROL))\n\t\t{\n\t\t\tstickDirectionalLightToCamera = !stickDirectionalLightToCamera;\n\t\t}\n\n\t\tif (stickDirectionalLightToCamera)\n\t\t{\n\t\t\t\/\/ (Spot light must be attached directly to root node \/ scene for this to work properly)\n\t\t\tauto cameraPosition = camera->GetTransform().GetPositionInWorld();\n\t\t\tauto cameraOrientation = camera->GetTransform().GetOrientationInWorld();\n\t\t\tspotLight->GetTransform().SetPosition(cameraPosition).SetOrientation(cameraOrientation);\n\t\t}\n\n\t\trenderer.Render(scene);\n\n\t\tImGui::ShowTestWindow();\n\t\tImGui::Render();\n\n\t\twindow.SwapBuffers();\n\t}\n\n\t\/\/\n\t\/\/ Deinit\n\t\/\/\n\n\tLogger::Subheading(\"Render loop end\");\n\tLogger::LogTimestamp();\n\n\tImGuiAdapter::Deinit();\n\n\treturn 0;\n}\n<commit_msg>Add custom UI features<commit_after>\n#include <string>\n#include <vector>\n#include <memory>\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n\n#include <glad\/glad.h>\n#include <GLFW\/glfw3.h>\n\n#include \"Mesh.h\"\n#include \"Scene.h\"\n#include \"Window.h\"\n#include \"Renderer.h\"\n#include \"Renderable.h\"\n#include \"ModelLoader.h\"\n#include \"ImGuiAdapter.h\"\n#include \"DiffuseMaterial.h\"\n\nint main(int argc, char *argv[])\n{\n\t\/\/\n\t\/\/ Logging etc.\n\t\/\/\n\n\tint width = 1280;\n\tint height = 720;\n\tbool fullscreen = false;\n\tbool vsync = false;\n\n#if defined(_DEBUG) or defined(DEBUG)\n\tLogger::Heading(\"Rendeer - debug build\");\n#else\n\tLogger::Heading(\"Rendeer - release build\");\n#endif\n\tLogger::Log(\" - Resolution:\\t %dx%d\", width, height);\n\tLogger::Log(\" - Fullscreen:\\t %s\", Logger::BoolToString(fullscreen));\n\tLogger::Log(\" - Vsync:\\t\\t %s\", Logger::BoolToString(vsync));\n\n\tLogger::Subheading(\"Scene setup begin\");\n\tLogger::LogTimestamp();\n\tLogger::EmptyLine();\n\n\t\/\/\n\t\/\/ Setup\n\t\/\/\n\n\tWindow window{ width, height, fullscreen, vsync };\n\tRenderer renderer{ &window };\n\tImGuiAdapter::Init(&window);\n\n\t\/\/\n\t\/\/ Define scene\n\t\/\/\n\n\tScene scene;\n\n\tauto camera = std::make_shared<Camera>(\n\t\tglm::vec3{ 0, 1.7f, -5.0f },\n\t\tglm::angleAxis(0.15f, glm::vec3{ 1, 0, 0 })\n\t);\n\tscene.AddChild(camera);\n\n\tscene.SetSkybox(std::make_shared<TextureCube>(\n\t\tBitmap{\"textures\/skybox_sunset\/left.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/right.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/bottom.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/top.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/front.png\"},\n\t\tBitmap{\"textures\/skybox_sunset\/back.png\"}\n\t));\n\n\tscene.SetAmbientColor(glm::vec3{ 0.012f, 0.020f, 0.032f });\n\n\tauto teapot = ModelLoader::Load(\"models\/teapot\/teapot.obj\");\n\tscene.AddChild(teapot)->GetTransform().SetScale(0.032f);\n\n\tauto sponza = ModelLoader::Load(\"models\/dabrovic-sponza\/sponza.obj\");\n\tscene.AddChild(sponza);\n\n\t\/\/auto directionalLight = scene.NewChild();\n\t\/\/directionalLight->GetTransform().SetOrientation(glm::quat{ 0.00873f, 0.0f, 0.0f, 0.99996f });\n\t\/\/directionalLight->AddComponent(std::make_shared<DirectionalLight>(glm::vec3{ 0.92f, 0.95f, 0.88f }, 1.5f));\n\n\tauto pointLight = scene.NewChild();\n\tpointLight->AddComponent(std::make_shared<PointLight>(glm::vec3{ 1.0f, 0.1f, 0.15f }, 1.35f));\n\n\tauto spotLight = scene.NewChild();\n\tspotLight->GetTransform()\n\t\t.SetPosition(glm::vec3{ 0, 10.0f, 0 })\n\t\t.SetOrientation(glm::angleAxis(3.141592f \/ 2.0f, glm::vec3{1, 0, 0 }));\n\tspotLight->AddComponent(std::make_shared<SpotLight>(glm::vec3{ 1.0f, 0.6f, 0.6f }, 12.0f, glm::radians(40.0f), glm::radians(5.0f)));\n\n\t\/\/ Set up the extra camera\n\tauto extraCamera = std::make_shared<CameraComponent>(16.0f \/ 9.0f, 0.1f, 1000.0f, glm::radians(50.0f));\n\tauto extraCameraTexture = std::make_shared<Texture2D>(853, 480, GL_RGBA, GL_RGBA8, GL_CLAMP_TO_EDGE, GL_NEAREST, GL_NEAREST);\n\tauto extraCameraTarget = std::make_shared<FrameBuffer>();\n\textraCameraTarget->Attach(extraCameraTexture.get(), GL_COLOR_ATTACHMENT0);\n\textraCamera->SetTarget(extraCameraTarget);\n\tspotLight->NewChild()->AddComponent(extraCamera);\n\n\t\/\/ Set up the extra camera target model\n\tauto tv = ModelLoader::Load(\"models\/cube.obj\");\n\ttv->GetTransform()\n\t\t.SetPosition(15.0f, 2.3f, 0)\n\t\t.SetScale(1.8f).Scale(0.05f, 16.0f \/ 9.0f, 1) \/\/ TODO: Fix mirroring etc.\n\t\t.Rotate(glm::vec3{1,0,0}, 3.1415f \/ 2.0f);\n\tscene.AddChild(tv);\n\t{\n\t\t\/\/ HACK!!! There needs to be a real nice way to search for a component in a scene graph!\n\t\tauto renderable = tv->GetDirectChildren().front()->GetComponent<Renderable>();\n\t\tauto mat = std::dynamic_pointer_cast<DiffuseMaterial>(renderable->GetMaterial());\n\t\tmat->diffuseTexture = extraCameraTexture;\n\t\tmat->specularIntensity = 0.0f;\n\t\tmat->emissive = 0.25f;\n\t}\n\n\t\/\/\n\t\/\/ Render\/game loop\n\t\/\/\n\n\tLogger::Subheading(\"Render loop begin\");\n\tLogger::LogTimestamp();\n\tLogger::EmptyLine();\n\n\tglfwSetTime(0.0);\n\tdouble currentTime = 0.0;\n\tdouble previousTime = glfwGetTime();\n\n\tfloat animation = 0.0f;\n\n\tbool stickDirectionalLightToCamera = false;\n\n\twindow.Focus();\n\twhile (!window.IsCloseRequested())\n\t{\n\t\tcurrentTime = glfwGetTime();\n\t\tconst double dt = currentTime - previousTime;\n\t\tconst float deltaTime = static_cast<float>(dt);\n\t\tpreviousTime = currentTime;\n\n\t\twindow.PollEvents();\n\t\tImGuiAdapter::NewFrame(deltaTime);\n\n\t\tif (window.IsCursorHidden())\n\t\t{\n\t\t\tcamera->Update(deltaTime, window);\n\t\t}\n\n\t\tif (window.WasKeyPressed(GLFW_KEY_LEFT_ALT))\n\t\t{\n\t\t\twindow.SetCursorHidden(!window.IsCursorHidden());\n\t\t}\n\n\t\tanimation += deltaTime;\n\n\t\tteapot->GetTransform()\n\t\t\t.SetOrientation(glm::vec3(0, 1, 0), 0.7f * animation)\n\t\t\t.SetPosition(0, 0.4f + 0.2f * cosf(2.0f * animation), 0);\n\n\t\tpointLight->GetTransform().SetPosition(\n\t\t\t6.0f * cosf(1.3f * animation),\n\t\t\t1.4f + 0.6f * cosf(sinf(animation)),\n\t\t\t6.0f * sinf(1.3f * animation)\n\t\t);\n\n\t\tif (window.WasKeyPressed(GLFW_KEY_LEFT_CONTROL))\n\t\t{\n\t\t\tstickDirectionalLightToCamera = !stickDirectionalLightToCamera;\n\t\t}\n\n\t\tif (stickDirectionalLightToCamera)\n\t\t{\n\t\t\t\/\/ (Spot light must be attached directly to root node \/ scene for this to work properly)\n\t\t\tauto cameraPosition = camera->GetTransform().GetPositionInWorld();\n\t\t\tauto cameraOrientation = camera->GetTransform().GetOrientationInWorld();\n\t\t\tspotLight->GetTransform().SetPosition(cameraPosition).SetOrientation(cameraOrientation);\n\t\t}\n\n\t\tImGui::Begin(\"Rendeer\");\n\t\t{\n\t\t\tstatic bool showMetrics = false;\n\t\t\tImGui::Checkbox(\"Show metrics\", &showMetrics);\n\n\t\t\tif (showMetrics)\n\t\t\t{\n\t\t\t\tImGui::ShowMetricsWindow();\n\t\t\t}\n\n\t\t\tstatic glm::vec3 ambientColor = scene.GetAmbientColor();\n\t\t\tImGui::ColorEdit3(\"Ambient color\", glm::value_ptr(ambientColor));\n\t\t\tscene.SetAmbientColor(ambientColor);\n\t\t}\n\t\tImGui::End();\n\n\t\trenderer.Render(scene);\n\t\tImGui::Render();\n\t\twindow.SwapBuffers();\n\t}\n\n\t\/\/\n\t\/\/ Deinit\n\t\/\/\n\n\tLogger::Subheading(\"Render loop end\");\n\tLogger::LogTimestamp();\n\n\tImGuiAdapter::Deinit();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* vim: set ai et ts=4 sw=4: *\/\n\n\/**\n * @mainpage HurmaDB\n *\n * HurmaDB is an experimental NoSQL database. It uses RocksDB as a disk backend and provides REST API.\n *\/\n\n#include <HttpServer.h>\n#include <PersistentStorage.h>\n#include <TcpServer.h>\n#include <atomic>\n#include <iostream>\n#include <map>\n#include <signal.h>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n#include <utility>\n\nPersistentStorage storage;\n\nstatic std::atomic_bool terminate_flag(false);\n\nstatic void httpIndexGetHandler(const HttpRequest&, HttpResponse& resp) {\n resp.setStatus(HTTP_STATUS_OK);\n\n std::ostringstream oss;\n oss << \"HurmaDB is \" << (terminate_flag.load() ? \"terminating\" : \"running\") << \"!\\n\\n\";\n resp.setBody(oss.str());\n}\n\nstatic void httpKVGetHandler(const HttpRequest& req, HttpResponse& resp) {\n bool found;\n const std::string& key = req.getQueryMatch(0);\n const std::string& value = storage.get(key, &found);\n resp.setStatus(found ? HTTP_STATUS_OK : HTTP_STATUS_NOT_FOUND);\n resp.setBody(value);\n}\n\n\/**\n * @todo Rewrite using Storage::getRange instead of deprecated getRangeJson\n *\/\nstatic void httpKVGetRangeHandler(const HttpRequest& req, HttpResponse& resp) {\n const std::string& key_from = req.getQueryMatch(0);\n const std::string& key_to = req.getQueryMatch(1);\n const std::string& valuesJson = storage.getRangeJson(key_from, key_to);\n resp.setStatus(HTTP_STATUS_OK);\n resp.setBody(valuesJson);\n}\n\nstatic void httpKVPutHandler(const HttpRequest& req, HttpResponse& resp) {\n const std::string& key = req.getQueryMatch(0);\n const std::string& value = req.getBody();\n bool ok = true;\n try {\n storage.set(key, value);\n } catch(const std::runtime_error& e) {\n \/\/ Most likely validation failed\n ok = false;\n }\n\n resp.setStatus(ok ? HTTP_STATUS_OK : HTTP_STATUS_BAD_REQUEST);\n}\n\nstatic void httpKVDeleteHandler(const HttpRequest& req, HttpResponse& resp) {\n bool found = false;\n const std::string& key = req.getQueryMatch(0);\n storage.del(key, &found);\n resp.setStatus(found ? HTTP_STATUS_OK : HTTP_STATUS_NOT_FOUND);\n}\n\n\/* Required for generating code coverage report *\/\nstatic void httpStopPutHandler(const HttpRequest&, HttpResponse& resp) {\n terminate_flag.store(true);\n resp.setStatus(HTTP_STATUS_OK);\n}\n\nint main(int argc, char** argv) {\n\n int c;\n bool httpPortSet = false;\n int httpPort = 8080;\n\n while((c = getopt(argc, argv, \"p:h:\")) != -1)\n switch(c) {\n case 'h':\n httpPort = atoi(optarg);\n httpPortSet = true;\n break;\n }\n\n if(!httpPortSet) {\n std::cerr << \"Usage: \" << argv[0] << \" -h http_port\" << std::endl;\n return 2;\n }\n\n if(httpPort <= 0 || httpPort >= 65536) {\n std::cerr << \"Invalid HTTP port number!\" << std::endl;\n return 2;\n }\n\n HttpServer httpServer;\n\n httpServer.addHandler(HTTP_GET, \"(?i)^\/$\", &httpIndexGetHandler);\n httpServer.addHandler(HTTP_PUT, \"(?i)^\/v1\/_stop\/?$\", &httpStopPutHandler);\n httpServer.addHandler(HTTP_GET, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVGetHandler);\n httpServer.addHandler(HTTP_GET, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/([\\\\w-]+)\/?$\", &httpKVGetRangeHandler);\n httpServer.addHandler(HTTP_PUT, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVPutHandler);\n httpServer.addHandler(HTTP_DELETE, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVDeleteHandler);\n\n std::cout << \"Starting HTTP server on port \" << httpPort << std::endl;\n httpServer.listen(\"127.0.0.1\", httpPort);\n\n \/\/ Unlike POSIX accept() procedure none of these .accept methods is blocking\n while(!terminate_flag.load()) {\n httpServer.accept(terminate_flag);\n }\n\n return 0;\n}\n<commit_msg>Minor changes<commit_after>\/* vim: set ai et ts=4 sw=4: *\/\n\n\/**\n * @mainpage HurmaDB\n *\n * HurmaDB is an experimental NoSQL database. It uses RocksDB as a disk backend and provides REST API.\n *\/\n\n#include <HttpServer.h>\n#include <PersistentStorage.h>\n#include <TcpServer.h>\n#include <atomic>\n#include <iostream>\n#include <map>\n#include <signal.h>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n#include <utility>\n\nPersistentStorage storage;\n\nstatic std::atomic_bool terminate_flag(false);\n\nstatic void httpIndexGetHandler(const HttpRequest&, HttpResponse& resp) {\n resp.setStatus(HTTP_STATUS_OK);\n\n std::ostringstream oss;\n oss << \"HurmaDB is \" << (terminate_flag.load() ? \"terminating\" : \"running\") << \"!\\n\\n\";\n resp.setBody(oss.str());\n}\n\nstatic void httpKVGetHandler(const HttpRequest& req, HttpResponse& resp) {\n bool found;\n const std::string& key = req.getQueryMatch(0);\n const std::string& value = storage.get(key, &found);\n resp.setStatus(found ? HTTP_STATUS_OK : HTTP_STATUS_NOT_FOUND);\n resp.setBody(value);\n}\n\n\/**\n * @todo Rewrite using Storage::getRange instead of deprecated getRangeJson\n *\/\nstatic void httpKVGetRangeHandler(const HttpRequest& req, HttpResponse& resp) {\n const std::string& key_from = req.getQueryMatch(0);\n const std::string& key_to = req.getQueryMatch(1);\n const std::string& valuesJson = storage.getRangeJson(key_from, key_to);\n resp.setStatus(HTTP_STATUS_OK);\n resp.setBody(valuesJson);\n}\n\nstatic void httpKVPutHandler(const HttpRequest& req, HttpResponse& resp) {\n const std::string& key = req.getQueryMatch(0);\n const std::string& value = req.getBody();\n bool ok = true;\n try {\n storage.set(key, value);\n } catch(const std::runtime_error& e) {\n \/\/ Most likely validation failed\n ok = false;\n }\n\n resp.setStatus(ok ? HTTP_STATUS_OK : HTTP_STATUS_BAD_REQUEST);\n}\n\nstatic void httpKVDeleteHandler(const HttpRequest& req, HttpResponse& resp) {\n bool found = false;\n const std::string& key = req.getQueryMatch(0);\n storage.del(key, &found);\n resp.setStatus(found ? HTTP_STATUS_OK : HTTP_STATUS_NOT_FOUND);\n}\n\n\/* Required for generating code coverage report *\/\nstatic void httpStopPutHandler(const HttpRequest&, HttpResponse& resp) {\n terminate_flag.store(true);\n resp.setStatus(HTTP_STATUS_OK);\n}\n\nint main(int argc, char** argv) {\n bool httpPortSet = false;\n int httpPort = 8080;\n\n for(;;) {\n int ch = getopt(argc, argv, \"h:\");\n if(ch == -1) {\n break;\n } else if(ch == 'h') {\n httpPort = atoi(optarg);\n httpPortSet = true;\n }\n }\n\n if(!httpPortSet) {\n std::cerr << \"Usage: \" << argv[0] << \" -h http_port\" << std::endl;\n return 2;\n }\n\n if(httpPort <= 0 || httpPort >= 65536) {\n std::cerr << \"Invalid HTTP port number!\" << std::endl;\n return 2;\n }\n\n HttpServer httpServer;\n\n httpServer.addHandler(HTTP_GET, \"(?i)^\/$\", &httpIndexGetHandler);\n httpServer.addHandler(HTTP_PUT, \"(?i)^\/v1\/_stop\/?$\", &httpStopPutHandler);\n httpServer.addHandler(HTTP_GET, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVGetHandler);\n httpServer.addHandler(HTTP_GET, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/([\\\\w-]+)\/?$\", &httpKVGetRangeHandler);\n httpServer.addHandler(HTTP_PUT, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVPutHandler);\n httpServer.addHandler(HTTP_DELETE, \"(?i)^\/v1\/kv\/([\\\\w-]+)\/?$\", &httpKVDeleteHandler);\n\n std::cout << \"Starting HTTP server on port \" << httpPort << std::endl;\n httpServer.listen(\"127.0.0.1\", httpPort);\n\n while(!terminate_flag.load()) {\n httpServer.accept(terminate_flag);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cv.h>\n#include \"opencv2\/opencv.hpp\"\n#include \"SongLoader.h\"\n#include \"SongPlayer.h\"\n#include \"videoStream.hpp\"\n#include <MusicBar.h>\n\n\/\/for the rasperry pi\n#ifndef INT64_C\n#define INT64_C(c) (c ## LL)\n#define UINT64_C(c) (c ## ULL)\n#endif\nextern \"C\" {\n #include <SDL.h>\n #include <SDL_ttf.h>\n}\n#include <stdio.h>\n#include <unistd.h>\n\n#ifdef __amd64__\n #ifndef RUNNINGONINTEL\n #define RUNNINGONINTEL\n #endif\n#else\n #ifndef RUNNINGONPI\n #define RUNNINGONPI\n #endif\n #include \"WiringPiButtons.hpp\"\n#endif\n\n#define SCREEN_HEIGHT 768\n#define SCREEN_WIDTH 1232\n\nvoid processEvents();\nvoid signalToQuit();\nvoid close();\n\nSDL_Renderer* renderer = NULL;\nSDL_Window* window = NULL;\n\nSDL_Rect videoRect;\nSDL_Rect musicBarRect;\nint noSongs;\n\nVideoStream backupCamera;\n\nint quit;\n\nSongPlayer musicPlayer;\nMusicBar gordonMusic(&musicPlayer);\n\n\/***********************************************************************\n\/* SDL functions\n\/***********************************************************************\/\n\/\/ Initializes SDL window \/ renderer for use\n\nbool init_SDL()\n{\n bool success = true;\n\n if (SDL_Init(SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO | SDL_INIT_TIMER)) < 0)\n {\n printf(\"SDL could not initialize! SDL Error: %s\\n\", SDL_GetError());\n success = false;\n }\n else\n {\n window = SDL_CreateWindow(\"Video Application\", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n if (window == NULL)\n {\n printf(\"Window could not be created! SDL Error: %s\\n\", SDL_GetError());\n success = false;\n }\n else\n {\n renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (renderer == NULL)\n {\n printf(\"Renderer could not be created. SDL_Error: %s \\n\", SDL_GetError());\n success = false;\n }\n else\n {\n SDL_SetRenderDrawColor(renderer, 0xFF, 0xFF, 0xFF, 0xFF);\n }\n }\n }\n return success;\n}\n\nbool init_CameraSettings()\n{\n int w, h;\n bool success = true;\n SDL_GetWindowSize(window, &w, &h);\n videoRect.x = 0;\n videoRect.y = 0;\n videoRect.w = w;\n videoRect.h = h-50; \/\/change 50 to whatever height we want for the PI cam\n\n musicBarRect.x = 0;\n musicBarRect.y = h-49;\n musicBarRect.w = w; \n musicBarRect.h = 49;\n \/\/cameraWidth = cap.get(CV_CAP_PROP_FRAME_WIDTH);\n \/\/cameraHeight = cap.get(CV_CAP_PROP_FRAME_HEIGHT);\n \/\/printf(\"Camera Width %d, Camera Height %d \\n\",cameraWidth,cameraHeight);\n \n return success;\n}\n\n\n\/\/ Shows an individual frame of the supplied video\nint show_Camera()\n{\n if(backupCamera.imageReady())\n {\n IplImage* img = NULL;\n img = backupCamera.getFrame();\n SDL_Surface* surface = SDL_CreateRGBSurfaceFrom((void*)img->imageData,\n img->width,\n img->height,\n img->depth * img->nChannels,\n img->widthStep,\n 0xff0000, 0x00ff00, 0x0000ff, 0\n );\n\n SDL_Texture* texture = SDL_CreateTextureFromSurface(renderer, surface);\n SDL_FreeSurface(surface);\n surface = NULL;\n #ifdef RUNNINGONPI\n SDL_RendererFlip flip = SDL_FLIP_VERTICAL;\n #else\n SDL_RendererFlip flip = SDL_FLIP_HORIZONTAL;\n #endif\n SDL_RenderCopyEx(renderer, texture, NULL, &videoRect ,0, NULL, flip);\n SDL_DestroyTexture(texture);\n return 1;\n }\n return 0;\n}\n\nvoid processEvents()\n{\n SDL_Event event;\n while (SDL_PollEvent(&event))\n {\n switch(event.type)\n {\n case SDL_QUIT:\n printf(\"SDL_QUIT was called\\n\");\n signalToQuit();\n close();\n break;\n\n case SDL_KEYDOWN:\n switch(event.key.keysym.sym)\n {\n case SDLK_ESCAPE:\n printf(\"Esc was Pressed!\\n\");\n signalToQuit();\n close();\n break;\n case SDLK_LEFT:\n printf(\"Left arrow was Pressed!\\n\");\n musicPlayer.previousSong();\n break;\n case SDLK_RIGHT:\n printf(\"Right arrow was Pressed!\\n\");\n musicPlayer.nextSong();\n break;\n case SDLK_UP:\n musicPlayer.changeVolume(0.02);\n break;\n case SDLK_DOWN:\n musicPlayer.changeVolume(-0.02);\n break;\n case SDLK_SPACE:\n printf(\"Space was pressed!\\n\");\n musicPlayer.playPause();\n }\n }\n }\n}\n#ifdef RUNNINGONPI\nvoid processGPIO(WiringPiButtons::Button button)\n{\n switch(button)\n {\n case WiringPiButtons::PREVIOUS:\n\t musicPlayer.previousSong();\n\t break;\n\tcase WiringPiButtons::NEXT:\n\t musicPlayer.nextSong();\n\t break;\n\tcase WiringPiButtons::VOLUMEUP:\n\t musicPlayer.changeVolume(0.02);\n\t break;\n\tcase WiringPiButtons::VOLUMEDOWN:\n\t musicPlayer.changeVolume(-0.02);\n\t break;\n\tcase WiringPiButtons::TOGGLEPLAY:\n\t musicPlayer.playPause();\n\tdefault:\n\t break;\n }\n}\n#endif\n\n\/* Signals all the threads to quit and then waits for the threads *\/\nvoid signalToQuit()\n{\n backupCamera.signalToQuit();\n musicPlayer.songQuit();\n}\n\n\/* Cleans up and should free everything used in the program*\/\nvoid close()\n{\n musicPlayer.closeSongPlayer();\n SDL_DestroyRenderer(renderer);\n SDL_DestroyWindow(window);\n window = NULL;\n renderer = NULL;\n SDL_Quit();\n exit(0);\n}\n\nint main(int argc, char* argv[])\n{\n #ifdef RUNNINGONPI\n WiringPiButtons buttonManager;\n #endif \n\n if (!init_SDL())\n {\n fprintf(stderr, \"Could not initialize SDL!\\n\");\n return -1;\n }\n if (!init_CameraSettings())\n {\n printf(\"Failed to load settings!\\n\");\n return -1;\n }\n\n if (musicPlayer.initSongPlayer())\n {\n fprintf(stderr, \"No SongLibrary Folder! Not creating Music Thread!\\n\");\n }\n else \n {\n musicPlayer.StartInternalThread();\n }\n backupCamera.StartInternalThread();\n\n\n while (!quit)\n {\n processEvents();\n #ifdef RUNNINGONPI\n processGPIO(buttonManager.getEvents());\n #endif\n\n if (show_Camera())\n {\n SDL_Surface* surfaceBar;\n gordonMusic.update();\n surfaceBar = gordonMusic.returnMusicBar();\n #ifdef RUNNINGONPI\n SDL_RendererFlip flip = SDL_RendererFlip((int)SDL_FLIP_HORIZONTAL | (int)SDL_FLIP_VERTICAL);\n #else\n SDL_RendererFlip flip = SDL_FLIP_NONE;\n #endif\n SDL_Texture* textureMusicBar = SDL_CreateTextureFromSurface(renderer, surfaceBar);\n SDL_RenderCopyEx(renderer, textureMusicBar, NULL, &musicBarRect ,0, NULL, flip);\n SDL_DestroyTexture(textureMusicBar);\n SDL_RenderPresent(renderer);\n SDL_SetRenderDrawColor(renderer, 0, 0, 0, 0);\n SDL_RenderClear(renderer);\n }\n }\n\n musicPlayer.WaitForInternalThreadToExit();\n backupCamera.WaitForInternalThreadToExit();\n return 0;\n}\n<commit_msg>Changed main to be no longer dependent on the music bar<commit_after>#include <cv.h>\n#include \"opencv2\/opencv.hpp\"\n#include \"SongLoader.h\"\n#include \"SongPlayer.h\"\n#include \"videoStream.hpp\"\n#include <MusicBar.h>\n\n\/\/for the rasperry pi\n#ifndef INT64_C\n#define INT64_C(c) (c ## LL)\n#define UINT64_C(c) (c ## ULL)\n#endif\nextern \"C\" {\n #include <SDL.h>\n #include <SDL_ttf.h>\n}\n#include <stdio.h>\n#include <unistd.h>\n\n#ifdef __amd64__\n #ifndef RUNNINGONINTEL\n #define RUNNINGONINTEL\n #endif\n#else\n #ifndef RUNNINGONPI\n #define RUNNINGONPI\n #endif\n #include \"WiringPiButtons.hpp\"\n#endif\n\n#define SCREEN_HEIGHT 768\n#define SCREEN_WIDTH 1232\n\nvoid processEvents();\nvoid signalToQuit();\nvoid close();\n\nSDL_Renderer* renderer = NULL;\nSDL_Window* window = NULL;\n\nSDL_Rect videoRect;\nSDL_Rect musicBarRect;\n\nVideoStream backupCamera;\n\nint quit;\n\nint noSongs;\nSongPlayer musicPlayer;\nMusicBar gordonMusic(&musicPlayer);\n\n\/***********************************************************************\n\/* SDL functions\n\/***********************************************************************\/\n\/\/ Initializes SDL window \/ renderer for use\n\nbool init_SDL()\n{\n bool success = true;\n\n if (SDL_Init(SDL_Init(SDL_INIT_VIDEO | SDL_INIT_AUDIO | SDL_INIT_TIMER)) < 0)\n {\n printf(\"SDL could not initialize! SDL Error: %s\\n\", SDL_GetError());\n success = false;\n }\n else\n {\n window = SDL_CreateWindow(\"Video Application\", SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED, SCREEN_WIDTH, SCREEN_HEIGHT, SDL_WINDOW_SHOWN);\n if (window == NULL)\n {\n printf(\"Window could not be created! SDL Error: %s\\n\", SDL_GetError());\n success = false;\n }\n else\n {\n renderer = SDL_CreateRenderer(window, -1, SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC);\n if (renderer == NULL)\n {\n printf(\"Renderer could not be created. SDL_Error: %s \\n\", SDL_GetError());\n success = false;\n }\n else\n {\n SDL_SetRenderDrawColor(renderer, 0xFF, 0xFF, 0xFF, 0xFF);\n }\n }\n }\n return success;\n}\n\nbool init_CameraSettings()\n{\n int w, h;\n bool success = true;\n SDL_GetWindowSize(window, &w, &h);\n videoRect.x = 0;\n videoRect.y = 0;\n videoRect.w = w;\n videoRect.h = h-50; \/\/change 50 to whatever height we want for the PI cam\n\n musicBarRect.x = 0;\n musicBarRect.y = h-49;\n musicBarRect.w = w; \n musicBarRect.h = 49;\n \/\/cameraWidth = cap.get(CV_CAP_PROP_FRAME_WIDTH);\n \/\/cameraHeight = cap.get(CV_CAP_PROP_FRAME_HEIGHT);\n \/\/printf(\"Camera Width %d, Camera Height %d \\n\",cameraWidth,cameraHeight);\n \n return success;\n}\n\n\/\/ Shows an individual frame of the supplied video\nint show_Camera()\n{\n if(backupCamera.imageReady())\n {\n IplImage* img = NULL;\n img = backupCamera.getFrame();\n SDL_Surface* surface = SDL_CreateRGBSurfaceFrom((void*)img->imageData,\n img->width,\n img->height,\n img->depth * img->nChannels,\n img->widthStep,\n 0xff0000, 0x00ff00, 0x0000ff, 0\n );\n\n SDL_Texture* texture = SDL_CreateTextureFromSurface(renderer, surface);\n SDL_FreeSurface(surface);\n surface = NULL;\n #ifdef RUNNINGONPI\n SDL_RendererFlip flip = SDL_FLIP_VERTICAL;\n #else\n SDL_RendererFlip flip = SDL_FLIP_HORIZONTAL;\n #endif\n SDL_RenderCopyEx(renderer, texture, NULL, &videoRect ,0, NULL, flip);\n SDL_DestroyTexture(texture);\n return 1;\n }\n return 0;\n}\n\nvoid processEvents()\n{\n SDL_Event event;\n while (SDL_PollEvent(&event))\n {\n switch(event.type)\n {\n case SDL_QUIT:\n printf(\"SDL_QUIT was called\\n\");\n signalToQuit();\n close();\n break;\n\n case SDL_KEYDOWN:\n switch(event.key.keysym.sym)\n {\n case SDLK_ESCAPE:\n printf(\"Esc was Pressed!\\n\");\n signalToQuit();\n close();\n break;\n case SDLK_LEFT:\n printf(\"Left arrow was Pressed!\\n\");\n musicPlayer.previousSong();\n break;\n case SDLK_RIGHT:\n printf(\"Right arrow was Pressed!\\n\");\n musicPlayer.nextSong();\n break;\n case SDLK_UP:\n musicPlayer.changeVolume(0.02);\n break;\n case SDLK_DOWN:\n musicPlayer.changeVolume(-0.02);\n break;\n case SDLK_SPACE:\n printf(\"Space was pressed!\\n\");\n musicPlayer.playPause();\n }\n }\n }\n}\n#ifdef RUNNINGONPI\nvoid processGPIO(WiringPiButtons::Button button)\n{\n switch(button)\n {\n case WiringPiButtons::PREVIOUS:\n\t musicPlayer.previousSong();\n\t break;\n\tcase WiringPiButtons::NEXT:\n\t musicPlayer.nextSong();\n\t break;\n\tcase WiringPiButtons::VOLUMEUP:\n\t musicPlayer.changeVolume(0.02);\n\t break;\n\tcase WiringPiButtons::VOLUMEDOWN:\n\t musicPlayer.changeVolume(-0.02);\n\t break;\n\tcase WiringPiButtons::TOGGLEPLAY:\n\t musicPlayer.playPause();\n\tdefault:\n\t break;\n }\n}\n#endif\n\n\/* Signals all the threads to quit and then waits for the threads *\/\nvoid signalToQuit()\n{\n backupCamera.signalToQuit();\n musicPlayer.songQuit();\n}\n\n\/* Cleans up and should free everything used in the program*\/\nvoid close()\n{\n musicPlayer.closeSongPlayer();\n SDL_DestroyRenderer(renderer);\n SDL_DestroyWindow(window);\n window = NULL;\n renderer = NULL;\n SDL_Quit();\n exit(0);\n}\n\nint showMusicBar()\n{\n\n SDL_Surface* surfaceBar;\n gordonMusic.update();\n surfaceBar = gordonMusic.returnMusicBar();\n SDL_Texture* textureMusicBar = SDL_CreateTextureFromSurface(renderer, surfaceBar);\n #ifdef RUNNINGONPI\n SDL_RendererFlip flip = SDL_RendererFlip((int)SDL_FLIP_HORIZONTAL | (int)SDL_FLIP_VERTICAL);\n #else\n SDL_RendererFlip flip = SDL_FLIP_NONE;\n #endif\n SDL_RenderCopyEx(renderer, textureMusicBar, NULL, &musicBarRect ,0, NULL, flip);\n SDL_DestroyTexture(textureMusicBar);\n \n return 0;\n}\n\n\nint main(int argc, char* argv[])\n{\n #ifdef RUNNINGONPI\n WiringPiButtons buttonManager;\n #endif \n \n if (!init_SDL())\n {\n fprintf(stderr, \"Could not initialize SDL!\\n\");\n return -1;\n }\n if (!init_CameraSettings())\n {\n printf(\"Failed to load settings!\\n\");\n return -1;\n }\n\n if (musicPlayer.initSongPlayer())\n {\n noSongs = true;\n fprintf(stderr, \"No SongLibrary Folder! Not creating Music Thread!\\n\");\n }\n else \n {\n musicPlayer.StartInternalThread();\n }\n backupCamera.StartInternalThread();\n\n while (!quit)\n {\n processEvents();\n #ifdef RUNNINGONPI\n processGPIO(buttonManager.getEvents());\n #endif\n\n if (show_Camera())\n {\n #ifdef RUNNINGONPI\n SDL_RendererFlip flip = SDL_RendererFlip((int)SDL_FLIP_HORIZONTAL | (int)SDL_FLIP_VERTICAL);\n #else\n SDL_RendererFlip flip = SDL_FLIP_NONE;\n #endif\n if (!noSongs)\n { \n showMusicBar();\n } \n SDL_RenderPresent(renderer);\n SDL_SetRenderDrawColor(renderer, 0, 0, 0, 0);\n SDL_RenderClear(renderer);\n }\n }\n backupCamera.WaitForInternalThreadToExit();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"callback_parameter.hpp\"\n#include \"callback_object.hpp\"\n#include \"cpp\/ylikuutio\/common\/any_value.hpp\"\n\n\/\/ Include standard headers\n#include <string> \/\/ std::string\n#include <vector> \/\/ std::vector\n\nnamespace callback_system\n{\n CallbackParameter::CallbackParameter(std::string name, AnyValue any_value, bool is_reference, callback_system::CallbackObject* callback_object)\n {\n \/\/ constructor.\n this->name = name;\n this->any_value = any_value;\n this->is_reference = is_reference;\n }\n}\n<commit_msg>Poistettu tarpeeton `#include`-rivi.<commit_after>#include \"callback_parameter.hpp\"\n#include \"callback_object.hpp\"\n#include \"cpp\/ylikuutio\/common\/any_value.hpp\"\n\n\/\/ Include standard headers\n#include <string> \/\/ std::string\n\nnamespace callback_system\n{\n CallbackParameter::CallbackParameter(std::string name, AnyValue any_value, bool is_reference, callback_system::CallbackObject* callback_object)\n {\n \/\/ constructor.\n this->name = name;\n this->any_value = any_value;\n this->is_reference = is_reference;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n Some parts of this code are derived from libgalib. See GALIBCopyright.txt\n for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\/\/ this file defines the otbMultiScaleTest for the test driver\n\/\/ and all it expects is that you have a function called RegisterTests\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n#include <iostream>\n#include \"otbTestMain.h\"\n\nvoid RegisterTests()\n{\nREGISTER_TEST(galibTests4);\n}\n\/* ----------------------------------------------------------------------------\n ex4.C\n mbwall 28jul94\n Copyright (c) 1995-1996 Massachusetts Institute of Technology\n\n DESCRIPTION:\n Example program for the SteadyStateGA class and 3DBinaryStringGenome \nclass. This program tries to fill the 3Dgenome with alternating 1's and\n0's. Notice that the steady state ga needs many more 'generations' than the\nsimple ga, but it will usually converge to the optimum with fewer evaluations\nof the objective function. So if you have a compute-intensive objective\nfunction, steady state ga may be the way to go.\n You can control the amount of overlap in a steady-state GA by using the\npReplacement member function.\n This example also illustrates some of the statistics members of the genetic\nalgorithm object.\n---------------------------------------------------------------------------- *\/\n#include <stdio.h>\n\n#include <ga\/GASStateGA.h>\t\/\/ include the steady-state GA header\n#include <ga\/GA3DBinStrGenome.h> \/\/ and the header for the genome we'll use\n#include <ga\/std_stream.h>\n\n#define cout STD_COUT\n\nfloat objective(GAGenome &);\n\nint\ngalibTests4(int argc, char * argv[])\n{\n cout << \"Example 4\\n\\n\";\n cout << \"This program tries to fill a 3DBinaryStringGenome with\\n\";\n cout << \"alternating 1s and 0s using a SteadyStateGA\\n\\n\"; cout.flush();\n\n\/\/ See if we've been given a seed to use (for testing purposes). When you\n\/\/ specify a random seed, the evolution will be exactly the same each time\n\/\/ you use that seed number.\n\n const char * outputfile = argv[1];\n for(int ii=1; ii<argc; ii++) {\n if(strcmp(argv[ii],\"seed\") == 0) {\n GARandomSeed((unsigned int)atoi(argv[ii+1]));\n }\n }\n\n int depth = 3;\n int width = 10;\n int height = 5;\n\n\/\/ Now create the GA and run it. First we create a genome of the type that\n\/\/ we want to use in the GA. The ga doesn't use this genome in the\n\/\/ optimization - it just uses it to clone a population of genomes.\n\n GA3DBinaryStringGenome genome(width, height, depth, objective);\n\n\/\/ Now that we have the genome, we create the genetic algorithm and set\n\/\/ its parameters - number of generations, mutation probability, and crossover\n\/\/ probability. By default the GA keeps track of the best of generation scores\n\/\/ and also keeps one genome as the 'best of all' - the best genome \n\/\/ that it encounters from all of the generations. Here we tell the GA to\n\/\/ keep track of all scores, not just the best-of-generation.\n const char * outputfilename = argv[1];\n \n GASteadyStateGA ga(genome);\n ga.populationSize(100);\n ga.pReplacement(0.50);\t\/\/ replace 50% of population each generation\n\/\/ ga.nReplacement(4);\t \/\/ number of individuals to replace each gen\n ga.nGenerations(200);\n ga.pMutation(0.001);\n ga.pCrossover(0.9);\n ga.scoreFilename(outputfilename);\/\/\"bog.dat\");\t\/\/ name of file for scores\n ga.scoreFrequency(10);\t\/\/ keep the scores of every 10th generation\n ga.flushFrequency(50);\t\/\/ specify how often to write the score to disk\n ga.selectScores(GAStatistics::AllScores);\n ga.evolve();\n\n\/\/ Now we print out the best genome.\n\n cout << \"the ga generated:\\n\" << ga.statistics().bestIndividual() << \"\\n\";\n cout << \"best of generation data are in '\"<<ga.scoreFilename()<<\"'\\n\";\n\n\/\/ That's it!\n\n return 0;\n}\n \n\n\n\n\/\/ This is the objective function. All it does is give one point for every\n\/\/ odd bit that is set and one point for every even bit that is not set.\n\nfloat\nobjective(GAGenome& g)\n{\n GA3DBinaryStringGenome & genome = (GA3DBinaryStringGenome &)g;\n float value=0.0;\n int count=0;\n int I=genome.width(), J=genome.height(), K=genome.depth();\n for(int i=0; i<I; i++){\n for(int j=0; j<J; j++){\n for(int k=0; k<K; k++){\n\tif(genome.gene(i,j,k) == 0 && count%2 == 0)\n\t value += 1.0;\n\telse if(genome.gene(i,j,k) == 1 && count%2 != 0)\n\t value += 1.0;\n\tcount++;\n }\n }\n }\n return value;\n}\n<commit_msg>Simple correction.<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n Some parts of this code are derived from libgalib. See GALIBCopyright.txt\n for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\/\/ this file defines the otbMultiScaleTest for the test driver\n\/\/ and all it expects is that you have a function called RegisterTests\n#if defined(_MSC_VER)\n#pragma warning ( disable : 4786 )\n#endif\n#include <iostream>\n#include \"otbTestMain.h\"\n\nvoid RegisterTests()\n{\nREGISTER_TEST(galibTests4);\n}\n\/* ----------------------------------------------------------------------------\n ex4.C\n mbwall 28jul94\n Copyright (c) 1995-1996 Massachusetts Institute of Technology\n\n DESCRIPTION:\n Example program for the SteadyStateGA class and 3DBinaryStringGenome \nclass. This program tries to fill the 3Dgenome with alternating 1's and\n0's. Notice that the steady state ga needs many more 'generations' than the\nsimple ga, but it will usually converge to the optimum with fewer evaluations\nof the objective function. So if you have a compute-intensive objective\nfunction, steady state ga may be the way to go.\n You can control the amount of overlap in a steady-state GA by using the\npReplacement member function.\n This example also illustrates some of the statistics members of the genetic\nalgorithm object.\n---------------------------------------------------------------------------- *\/\n#include <stdio.h>\n\n#include <ga\/GASStateGA.h>\t\/\/ include the steady-state GA header\n#include <ga\/GA3DBinStrGenome.h> \/\/ and the header for the genome we'll use\n#include <ga\/std_stream.h>\n\n#define cout STD_COUT\n\nfloat objective(GAGenome &);\n\nint\ngalibTests4(int argc, char * argv[])\n{\n cout << \"Example 4\\n\\n\";\n cout << \"This program tries to fill a 3DBinaryStringGenome with\\n\";\n cout << \"alternating 1s and 0s using a SteadyStateGA\\n\\n\"; cout.flush();\n\n\/\/ See if we've been given a seed to use (for testing purposes). When you\n\/\/ specify a random seed, the evolution will be exactly the same each time\n\/\/ you use that seed number.\n\n for(int ii=1; ii<argc; ii++) {\n if(strcmp(argv[ii],\"seed\") == 0) {\n GARandomSeed((unsigned int)atoi(argv[ii+1]));\n }\n }\n\n int depth = 3;\n int width = 10;\n int height = 5;\n\n\/\/ Now create the GA and run it. First we create a genome of the type that\n\/\/ we want to use in the GA. The ga doesn't use this genome in the\n\/\/ optimization - it just uses it to clone a population of genomes.\n\n GA3DBinaryStringGenome genome(width, height, depth, objective);\n\n\/\/ Now that we have the genome, we create the genetic algorithm and set\n\/\/ its parameters - number of generations, mutation probability, and crossover\n\/\/ probability. By default the GA keeps track of the best of generation scores\n\/\/ and also keeps one genome as the 'best of all' - the best genome \n\/\/ that it encounters from all of the generations. Here we tell the GA to\n\/\/ keep track of all scores, not just the best-of-generation.\n const char * outputfilename = argv[1];\n \n GASteadyStateGA ga(genome);\n ga.populationSize(100);\n ga.pReplacement(0.50);\t\/\/ replace 50% of population each generation\n\/\/ ga.nReplacement(4);\t \/\/ number of individuals to replace each gen\n ga.nGenerations(200);\n ga.pMutation(0.001);\n ga.pCrossover(0.9);\n ga.scoreFilename(outputfilename);\/\/\"bog.dat\");\t\/\/ name of file for scores\n ga.scoreFrequency(10);\t\/\/ keep the scores of every 10th generation\n ga.flushFrequency(50);\t\/\/ specify how often to write the score to disk\n ga.selectScores(GAStatistics::AllScores);\n ga.evolve();\n\n\/\/ Now we print out the best genome.\n\n cout << \"the ga generated:\\n\" << ga.statistics().bestIndividual() << \"\\n\";\n cout << \"best of generation data are in '\"<<ga.scoreFilename()<<\"'\\n\";\n\n\/\/ That's it!\n\n return 0;\n}\n \n\n\n\n\/\/ This is the objective function. All it does is give one point for every\n\/\/ odd bit that is set and one point for every even bit that is not set.\n\nfloat\nobjective(GAGenome& g)\n{\n GA3DBinaryStringGenome & genome = (GA3DBinaryStringGenome &)g;\n float value=0.0;\n int count=0;\n int I=genome.width(), J=genome.height(), K=genome.depth();\n for(int i=0; i<I; i++){\n for(int j=0; j<J; j++){\n for(int k=0; k<K; k++){\n\tif(genome.gene(i,j,k) == 0 && count%2 == 0)\n\t value += 1.0;\n\telse if(genome.gene(i,j,k) == 1 && count%2 != 0)\n\t value += 1.0;\n\tcount++;\n }\n }\n }\n return value;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.5 2003\/05\/18 14:02:06 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.4 2003\/05\/15 18:48:27 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/11\/04 14:54:58 tng\n * C++ Namespace Support.\n *\n * Revision 1.2 2002\/09\/24 19:48:39 tng\n * Performance: use XMLString::equals instead of XMLString::compareString\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:37 peiyongz\n * sane_include\n *\n * Revision 1.3 2001\/11\/21 14:30:13 knoaman\n * Fix for UPA checking.\n *\n * Revision 1.2 2001\/08\/27 12:19:00 tng\n * Schema: AllContentModel UPA Check typo fix\n *\n * Revision 1.1 2001\/08\/24 12:48:48 tng\n * Schema: AllContentModel\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/RuntimeException.hpp>\n#include <xercesc\/framework\/XMLElementDecl.hpp>\n#include <xercesc\/framework\/XMLValidator.hpp>\n#include <xercesc\/validators\/common\/ContentSpecNode.hpp>\n#include <xercesc\/validators\/common\/AllContentModel.hpp>\n#include <xercesc\/validators\/schema\/SubstitutionGroupComparator.hpp>\n#include <xercesc\/validators\/schema\/XercesElementWildcard.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAllContentModel::AllContentModel( ContentSpecNode* const parentContentSpec\n , const bool isMixed\n , MemoryManager* const manager) :\n fMemoryManager(manager)\n , fCount(0)\n , fChildren(0)\n , fChildOptional(0)\n , fNumRequired(0)\n , fIsMixed(isMixed)\n{\n \/\/\n \/\/ Create a vector of unsigned ints that will be filled in with the\n \/\/ ids of the child nodes. It will be expanded as needed but we give\n \/\/ it an initial capacity of 64 which should be more than enough for\n \/\/ 99% of the scenarios.\n \/\/\n\n ValueVectorOf<QName*> children(64, fMemoryManager);\n ValueVectorOf<bool> childOptional(64, fMemoryManager);\n\n \/\/\n \/\/ Get the parent element's content spec. This is the head of the tree\n \/\/ of nodes that describes the content model. We will iterate this\n \/\/ tree.\n \/\/\n ContentSpecNode* curNode = parentContentSpec;\n if (!curNode)\n ThrowXML(RuntimeException, XMLExcepts::CM_NoParentCSN);\n\n \/\/ And now call the private recursive method that iterates the tree\n buildChildList(curNode, children, childOptional);\n\n \/\/\n \/\/ And now we know how many elements we need in our member list. So\n \/\/ fill them in.\n \/\/\n fCount = children.size();\n fChildren = (QName**) fMemoryManager->allocate(fCount * sizeof(QName*)); \/\/new QName*[fCount];\n fChildOptional = (bool*) fMemoryManager->allocate(fCount * sizeof(bool)); \/\/new bool[fCount];\n for (unsigned int index = 0; index < fCount; index++) {\n fChildren[index] = children.elementAt(index);\n fChildOptional[index] = childOptional.elementAt(index);\n }\n}\n\nAllContentModel::~AllContentModel()\n{\n fMemoryManager->deallocate(fChildren); \/\/delete [] fChildren;\n fMemoryManager->deallocate(fChildOptional); \/\/delete [] fChildOptional;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Implementation of the ContentModel virtual interface\n\/\/ ---------------------------------------------------------------------------\n\/\/\n\/\/Under the XML Schema mixed model,\n\/\/the order and number of child elements appearing in an instance\n\/\/must agree with\n\/\/the order and number of child elements specified in the model.\n\/\/\nint\nAllContentModel::validateContent( QName** const children\n , const unsigned int childCount\n , const unsigned int emptyNamespaceId) const\n{\n \/\/ If <all> had minOccurs of zero and there are\n \/\/ no children to validate, trivially validate\n if (!fNumRequired && !childCount)\n return -1;\n\n \/\/ Check for duplicate element\n bool* elementSeen = (bool*) fMemoryManager->allocate(fCount*sizeof(bool)); \/\/new bool[fCount];\n\n \/\/ initialize the array\n for (unsigned int i = 0; i < fCount; i++)\n elementSeen[i] = false;\n\n \/\/ keep track of the required element seen\n unsigned int numRequiredSeen = 0;\n\n for (unsigned int outIndex = 0; outIndex < childCount; outIndex++) {\n \/\/ Get the current child out of the source index\n const QName* curChild = children[outIndex];\n\n \/\/ If its PCDATA, then we just accept that\n if (fIsMixed && curChild->getURI() == XMLElementDecl::fgPCDataElemId)\n continue;\n\n \/\/ And try to find it in our list\n unsigned int inIndex = 0;\n for (; inIndex < fCount; inIndex++)\n {\n const QName* inChild = fChildren[inIndex];\n if ((inChild->getURI() == curChild->getURI()) &&\n (XMLString::equals(inChild->getLocalPart(), curChild->getLocalPart()))) {\n \/\/ found it\n \/\/ If this element was seen already, indicate an error was\n \/\/ found at the duplicate index.\n if (elementSeen[inIndex]) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n else\n elementSeen[inIndex] = true;\n\n if (!fChildOptional[inIndex])\n numRequiredSeen++;\n\n break;\n }\n }\n\n \/\/ We did not find this one, so the validation failed\n if (inIndex == fCount) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n\n }\n\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n\n \/\/ Were all the required elements of the <all> encountered?\n if (numRequiredSeen != fNumRequired) {\n return childCount;\n }\n\n \/\/ Everything seems to be ok, so return success\n \/\/ success\n return -1;\n}\n\n\nint AllContentModel::validateContentSpecial(QName** const children\n , const unsigned int childCount\n , const unsigned int emptyNamespaceId\n , GrammarResolver* const pGrammarResolver\n , XMLStringPool* const pStringPool) const\n{\n\n SubstitutionGroupComparator comparator(pGrammarResolver, pStringPool);\n\n \/\/ If <all> had minOccurs of zero and there are\n \/\/ no children to validate, trivially validate\n if (!fNumRequired && !childCount)\n return -1;\n\n \/\/ Check for duplicate element\n bool* elementSeen = (bool*) fMemoryManager->allocate(fCount*sizeof(bool)); \/\/new bool[fCount];\n\n \/\/ initialize the array\n for (unsigned int i = 0; i < fCount; i++)\n elementSeen[i] = false;\n\n \/\/ keep track of the required element seen\n unsigned int numRequiredSeen = 0;\n\n for (unsigned int outIndex = 0; outIndex < childCount; outIndex++) {\n \/\/ Get the current child out of the source index\n QName* const curChild = children[outIndex];\n\n \/\/ If its PCDATA, then we just accept that\n if (fIsMixed && curChild->getURI() == XMLElementDecl::fgPCDataElemId)\n continue;\n\n \/\/ And try to find it in our list\n unsigned int inIndex = 0;\n for (; inIndex < fCount; inIndex++)\n {\n QName* const inChild = fChildren[inIndex];\n if ( comparator.isEquivalentTo(curChild, inChild)) {\n \/\/ match\n \/\/ If this element was seen already, indicate an error was\n \/\/ found at the duplicate index.\n if (elementSeen[inIndex]) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n else\n elementSeen[inIndex] = true;\n\n if (!fChildOptional[inIndex])\n numRequiredSeen++;\n\n break;\n }\n }\n\n \/\/ We did not find this one, so the validation failed\n if (inIndex == fCount) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n\n }\n\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n\n \/\/ Were all the required elements of the <all> encountered?\n if (numRequiredSeen != fNumRequired) {\n return childCount;\n }\n\n \/\/ Everything seems to be ok, so return success\n \/\/ success\n return -1;\n\n}\n\nvoid AllContentModel::checkUniqueParticleAttribution\n (\n SchemaGrammar* const pGrammar\n , GrammarResolver* const pGrammarResolver\n , XMLStringPool* const pStringPool\n , XMLValidator* const pValidator\n , unsigned int* const pContentSpecOrgURI\n )\n{\n SubstitutionGroupComparator comparator(pGrammarResolver, pStringPool);\n\n unsigned int i, j;\n\n \/\/ rename back\n for (i = 0; i < fCount; i++) {\n unsigned int orgURIIndex = fChildren[i]->getURI();\n fChildren[i]->setURI(pContentSpecOrgURI[orgURIIndex]);\n }\n\n \/\/ check whether there is conflict between any two leaves\n for (i = 0; i < fCount; i++) {\n for (j = i+1; j < fCount; j++) {\n \/\/ If this is text in a Schema mixed content model, skip it.\n if ( fIsMixed &&\n (( fChildren[i]->getURI() == XMLElementDecl::fgPCDataElemId) ||\n ( fChildren[j]->getURI() == XMLElementDecl::fgPCDataElemId)))\n continue;\n\n if (XercesElementWildcard::conflict(pGrammar,\n ContentSpecNode::Leaf,\n fChildren[i],\n ContentSpecNode::Leaf,\n fChildren[j],\n &comparator)) {\n pValidator->emitError(XMLValid::UniqueParticleAttributionFail,\n fChildren[i]->getRawName(),\n fChildren[j]->getRawName());\n }\n }\n }\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Private helper methods\n\/\/ ---------------------------------------------------------------------------\nvoid\nAllContentModel::buildChildList(ContentSpecNode* const curNode\n , ValueVectorOf<QName*>& toFill\n , ValueVectorOf<bool>& toOptional)\n{\n \/\/ Get the type of spec node our current node is\n const ContentSpecNode::NodeTypes curType = curNode->getType();\n\n if (curType == ContentSpecNode::All)\n {\n \/\/ Get both the child node pointers\n ContentSpecNode* leftNode = curNode->getFirst();\n ContentSpecNode* rightNode = curNode->getSecond();\n\n \/\/ Recurse on the left and right nodes\n buildChildList(leftNode, toFill, toOptional);\n buildChildList(rightNode, toFill, toOptional);\n }\n else if (curType == ContentSpecNode::Leaf)\n {\n \/\/ At leaf, add the element to list of elements permitted in the all\n toFill.addElement(curNode->getElement());\n toOptional.addElement(false);\n fNumRequired++;\n }\n else if (curType == ContentSpecNode::ZeroOrOne)\n {\n \/\/ At ZERO_OR_ONE node, subtree must be an element\n \/\/ that was specified with minOccurs=0, maxOccurs=1\n ContentSpecNode* leftNode = curNode->getFirst();\n if (leftNode->getType() != ContentSpecNode::Leaf)\n ThrowXML(RuntimeException, XMLExcepts::CM_UnknownCMSpecType);\n\n toFill.addElement(leftNode->getElement());\n toOptional.addElement(true);\n }\n else\n ThrowXML(RuntimeException, XMLExcepts::CM_UnknownCMSpecType);\n}\n\nXERCES_CPP_NAMESPACE_END\n<commit_msg>Store a copy of each child, instead of a reference, as the content spec node tree is not guaranteed to be persistent.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Log$\n * Revision 1.6 2003\/11\/20 18:09:18 knoaman\n * Store a copy of each child, instead of a reference, as the content spec node\n * tree is not guaranteed to be persistent.\n *\n * Revision 1.5 2003\/05\/18 14:02:06 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.4 2003\/05\/15 18:48:27 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.3 2002\/11\/04 14:54:58 tng\n * C++ Namespace Support.\n *\n * Revision 1.2 2002\/09\/24 19:48:39 tng\n * Performance: use XMLString::equals instead of XMLString::compareString\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:37 peiyongz\n * sane_include\n *\n * Revision 1.3 2001\/11\/21 14:30:13 knoaman\n * Fix for UPA checking.\n *\n * Revision 1.2 2001\/08\/27 12:19:00 tng\n * Schema: AllContentModel UPA Check typo fix\n *\n * Revision 1.1 2001\/08\/24 12:48:48 tng\n * Schema: AllContentModel\n *\n *\/\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Includes\n\/\/ ---------------------------------------------------------------------------\n#include <xercesc\/util\/RuntimeException.hpp>\n#include <xercesc\/framework\/XMLElementDecl.hpp>\n#include <xercesc\/framework\/XMLValidator.hpp>\n#include <xercesc\/validators\/common\/ContentSpecNode.hpp>\n#include <xercesc\/validators\/common\/AllContentModel.hpp>\n#include <xercesc\/validators\/schema\/SubstitutionGroupComparator.hpp>\n#include <xercesc\/validators\/schema\/XercesElementWildcard.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Constructors and Destructor\n\/\/ ---------------------------------------------------------------------------\nAllContentModel::AllContentModel( ContentSpecNode* const parentContentSpec\n , const bool isMixed\n , MemoryManager* const manager) :\n fMemoryManager(manager)\n , fCount(0)\n , fChildren(0)\n , fChildOptional(0)\n , fNumRequired(0)\n , fIsMixed(isMixed)\n{\n \/\/\n \/\/ Create a vector of unsigned ints that will be filled in with the\n \/\/ ids of the child nodes. It will be expanded as needed but we give\n \/\/ it an initial capacity of 64 which should be more than enough for\n \/\/ 99% of the scenarios.\n \/\/\n\n ValueVectorOf<QName*> children(64, fMemoryManager);\n ValueVectorOf<bool> childOptional(64, fMemoryManager);\n\n \/\/\n \/\/ Get the parent element's content spec. This is the head of the tree\n \/\/ of nodes that describes the content model. We will iterate this\n \/\/ tree.\n \/\/\n ContentSpecNode* curNode = parentContentSpec;\n if (!curNode)\n ThrowXML(RuntimeException, XMLExcepts::CM_NoParentCSN);\n\n \/\/ And now call the private recursive method that iterates the tree\n buildChildList(curNode, children, childOptional);\n\n \/\/\n \/\/ And now we know how many elements we need in our member list. So\n \/\/ fill them in.\n \/\/\n fCount = children.size();\n fChildren = (QName**) fMemoryManager->allocate(fCount * sizeof(QName*)); \/\/new QName*[fCount];\n fChildOptional = (bool*) fMemoryManager->allocate(fCount * sizeof(bool)); \/\/new bool[fCount];\n for (unsigned int index = 0; index < fCount; index++) {\n fChildren[index] = new (fMemoryManager) QName(*(children.elementAt(index)));\n fChildOptional[index] = childOptional.elementAt(index);\n }\n}\n\nAllContentModel::~AllContentModel()\n{\n for (unsigned int index = 0; index < fCount; index++)\n delete fChildren[index];\n fMemoryManager->deallocate(fChildren); \/\/delete [] fChildren;\n fMemoryManager->deallocate(fChildOptional); \/\/delete [] fChildOptional;\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Implementation of the ContentModel virtual interface\n\/\/ ---------------------------------------------------------------------------\n\/\/\n\/\/Under the XML Schema mixed model,\n\/\/the order and number of child elements appearing in an instance\n\/\/must agree with\n\/\/the order and number of child elements specified in the model.\n\/\/\nint\nAllContentModel::validateContent( QName** const children\n , const unsigned int childCount\n , const unsigned int emptyNamespaceId) const\n{\n \/\/ If <all> had minOccurs of zero and there are\n \/\/ no children to validate, trivially validate\n if (!fNumRequired && !childCount)\n return -1;\n\n \/\/ Check for duplicate element\n bool* elementSeen = (bool*) fMemoryManager->allocate(fCount*sizeof(bool)); \/\/new bool[fCount];\n\n \/\/ initialize the array\n for (unsigned int i = 0; i < fCount; i++)\n elementSeen[i] = false;\n\n \/\/ keep track of the required element seen\n unsigned int numRequiredSeen = 0;\n\n for (unsigned int outIndex = 0; outIndex < childCount; outIndex++) {\n \/\/ Get the current child out of the source index\n const QName* curChild = children[outIndex];\n\n \/\/ If its PCDATA, then we just accept that\n if (fIsMixed && curChild->getURI() == XMLElementDecl::fgPCDataElemId)\n continue;\n\n \/\/ And try to find it in our list\n unsigned int inIndex = 0;\n for (; inIndex < fCount; inIndex++)\n {\n const QName* inChild = fChildren[inIndex];\n if ((inChild->getURI() == curChild->getURI()) &&\n (XMLString::equals(inChild->getLocalPart(), curChild->getLocalPart()))) {\n \/\/ found it\n \/\/ If this element was seen already, indicate an error was\n \/\/ found at the duplicate index.\n if (elementSeen[inIndex]) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n else\n elementSeen[inIndex] = true;\n\n if (!fChildOptional[inIndex])\n numRequiredSeen++;\n\n break;\n }\n }\n\n \/\/ We did not find this one, so the validation failed\n if (inIndex == fCount) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n\n }\n\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n\n \/\/ Were all the required elements of the <all> encountered?\n if (numRequiredSeen != fNumRequired) {\n return childCount;\n }\n\n \/\/ Everything seems to be ok, so return success\n \/\/ success\n return -1;\n}\n\n\nint AllContentModel::validateContentSpecial(QName** const children\n , const unsigned int childCount\n , const unsigned int emptyNamespaceId\n , GrammarResolver* const pGrammarResolver\n , XMLStringPool* const pStringPool) const\n{\n\n SubstitutionGroupComparator comparator(pGrammarResolver, pStringPool);\n\n \/\/ If <all> had minOccurs of zero and there are\n \/\/ no children to validate, trivially validate\n if (!fNumRequired && !childCount)\n return -1;\n\n \/\/ Check for duplicate element\n bool* elementSeen = (bool*) fMemoryManager->allocate(fCount*sizeof(bool)); \/\/new bool[fCount];\n\n \/\/ initialize the array\n for (unsigned int i = 0; i < fCount; i++)\n elementSeen[i] = false;\n\n \/\/ keep track of the required element seen\n unsigned int numRequiredSeen = 0;\n\n for (unsigned int outIndex = 0; outIndex < childCount; outIndex++) {\n \/\/ Get the current child out of the source index\n QName* const curChild = children[outIndex];\n\n \/\/ If its PCDATA, then we just accept that\n if (fIsMixed && curChild->getURI() == XMLElementDecl::fgPCDataElemId)\n continue;\n\n \/\/ And try to find it in our list\n unsigned int inIndex = 0;\n for (; inIndex < fCount; inIndex++)\n {\n QName* const inChild = fChildren[inIndex];\n if ( comparator.isEquivalentTo(curChild, inChild)) {\n \/\/ match\n \/\/ If this element was seen already, indicate an error was\n \/\/ found at the duplicate index.\n if (elementSeen[inIndex]) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n else\n elementSeen[inIndex] = true;\n\n if (!fChildOptional[inIndex])\n numRequiredSeen++;\n\n break;\n }\n }\n\n \/\/ We did not find this one, so the validation failed\n if (inIndex == fCount) {\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n return outIndex;\n }\n\n }\n\n fMemoryManager->deallocate(elementSeen); \/\/delete [] elementSeen;\n\n \/\/ Were all the required elements of the <all> encountered?\n if (numRequiredSeen != fNumRequired) {\n return childCount;\n }\n\n \/\/ Everything seems to be ok, so return success\n \/\/ success\n return -1;\n\n}\n\nvoid AllContentModel::checkUniqueParticleAttribution\n (\n SchemaGrammar* const pGrammar\n , GrammarResolver* const pGrammarResolver\n , XMLStringPool* const pStringPool\n , XMLValidator* const pValidator\n , unsigned int* const pContentSpecOrgURI\n )\n{\n SubstitutionGroupComparator comparator(pGrammarResolver, pStringPool);\n\n unsigned int i, j;\n\n \/\/ rename back\n for (i = 0; i < fCount; i++) {\n unsigned int orgURIIndex = fChildren[i]->getURI();\n fChildren[i]->setURI(pContentSpecOrgURI[orgURIIndex]);\n }\n\n \/\/ check whether there is conflict between any two leaves\n for (i = 0; i < fCount; i++) {\n for (j = i+1; j < fCount; j++) {\n \/\/ If this is text in a Schema mixed content model, skip it.\n if ( fIsMixed &&\n (( fChildren[i]->getURI() == XMLElementDecl::fgPCDataElemId) ||\n ( fChildren[j]->getURI() == XMLElementDecl::fgPCDataElemId)))\n continue;\n\n if (XercesElementWildcard::conflict(pGrammar,\n ContentSpecNode::Leaf,\n fChildren[i],\n ContentSpecNode::Leaf,\n fChildren[j],\n &comparator)) {\n pValidator->emitError(XMLValid::UniqueParticleAttributionFail,\n fChildren[i]->getRawName(),\n fChildren[j]->getRawName());\n }\n }\n }\n}\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ AllContentModel: Private helper methods\n\/\/ ---------------------------------------------------------------------------\nvoid\nAllContentModel::buildChildList(ContentSpecNode* const curNode\n , ValueVectorOf<QName*>& toFill\n , ValueVectorOf<bool>& toOptional)\n{\n \/\/ Get the type of spec node our current node is\n const ContentSpecNode::NodeTypes curType = curNode->getType();\n\n if (curType == ContentSpecNode::All)\n {\n \/\/ Get both the child node pointers\n ContentSpecNode* leftNode = curNode->getFirst();\n ContentSpecNode* rightNode = curNode->getSecond();\n\n \/\/ Recurse on the left and right nodes\n buildChildList(leftNode, toFill, toOptional);\n buildChildList(rightNode, toFill, toOptional);\n }\n else if (curType == ContentSpecNode::Leaf)\n {\n \/\/ At leaf, add the element to list of elements permitted in the all\n toFill.addElement(curNode->getElement());\n toOptional.addElement(false);\n fNumRequired++;\n }\n else if (curType == ContentSpecNode::ZeroOrOne)\n {\n \/\/ At ZERO_OR_ONE node, subtree must be an element\n \/\/ that was specified with minOccurs=0, maxOccurs=1\n ContentSpecNode* leftNode = curNode->getFirst();\n if (leftNode->getType() != ContentSpecNode::Leaf)\n ThrowXML(RuntimeException, XMLExcepts::CM_UnknownCMSpecType);\n\n toFill.addElement(leftNode->getElement());\n toOptional.addElement(true);\n }\n else\n ThrowXML(RuntimeException, XMLExcepts::CM_UnknownCMSpecType);\n}\n\nXERCES_CPP_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_SCAL_META_PARTIALS_RETURN_TYPE_HPP\n#define STAN_MATH_PRIM_SCAL_META_PARTIALS_RETURN_TYPE_HPP\n\n#include <stan\/math\/prim\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/rev\/core\/var.hpp>\n#include <stan\/math\/rev\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/fwd\/core\/fvar.hpp>\n#include <stan\/math\/fwd\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/prim\/scal\/meta\/scalar_type.hpp>\n#include <boost\/math\/tools\/promotion.hpp>\n\nnamespace stan {\n\n \/**\n * Template metaprogram to calculate the base scalar return type resulting\n * from promoting all the scalar types of the template parameters. The\n * metaprogram can take an arbitrary number of template parameters.\n *\n * All C++ primitive types (except <code>long double<\/code>) are automatically\n * promoted to <code>double<\/code>.\n *\n * <code>partials_return_type<...><\/code> is a class defining a single public\n * typedef <code>type<\/code> that is <code>var<\/code> if there is a forward\n * mode variable type and is <code>double<\/code> otherwise (this is the most\n * common case).\n * Example usage:\n *\n * - <code>return_type<int,double,var>::type<\/code> is <code>double<\/code>\n * - The same thing with <code>var<\/code> replaced with a forward mode type\n * like <code>fvar<T><\/code> will return <code>T<\/code>.\n *\n * @tparam T (required) A type\n * @tparam T_pack (optional) A parameter pack containing further types.\n *\/\n\ntemplate <typename T, typename... T_pack>\nstruct partials_return_type {\n typedef typename boost::math::tools::promote_args<\n double, typename partials_type<typename scalar_type<T>::type>::type,\n typename partials_return_type<T_pack...>::type>::type type;\n};\n\ntemplate <typename T>\nstruct partials_return_type<T> {\n typedef typename boost::math::tools::promote_args<\n double, typename partials_type<typename scalar_type<T>::type>::type>::type\n type;\n};\n\n} \/\/ namespace stan\n#endif\n<commit_msg>[Jenkins] auto-formatting by clang-format version 6.0.0 (tags\/google\/stable\/2017-11-14)<commit_after>#ifndef STAN_MATH_PRIM_SCAL_META_PARTIALS_RETURN_TYPE_HPP\n#define STAN_MATH_PRIM_SCAL_META_PARTIALS_RETURN_TYPE_HPP\n\n#include <stan\/math\/prim\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/rev\/core\/var.hpp>\n#include <stan\/math\/rev\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/fwd\/core\/fvar.hpp>\n#include <stan\/math\/fwd\/scal\/meta\/partials_type.hpp>\n#include <stan\/math\/prim\/scal\/meta\/scalar_type.hpp>\n#include <boost\/math\/tools\/promotion.hpp>\n\nnamespace stan {\n\n\/**\n * Template metaprogram to calculate the base scalar return type resulting\n * from promoting all the scalar types of the template parameters. The\n * metaprogram can take an arbitrary number of template parameters.\n *\n * All C++ primitive types (except <code>long double<\/code>) are automatically\n * promoted to <code>double<\/code>.\n *\n * <code>partials_return_type<...><\/code> is a class defining a single public\n * typedef <code>type<\/code> that is <code>var<\/code> if there is a forward\n * mode variable type and is <code>double<\/code> otherwise (this is the most\n * common case).\n * Example usage:\n *\n * - <code>return_type<int,double,var>::type<\/code> is <code>double<\/code>\n * - The same thing with <code>var<\/code> replaced with a forward mode type\n * like <code>fvar<T><\/code> will return <code>T<\/code>.\n *\n * @tparam T (required) A type\n * @tparam T_pack (optional) A parameter pack containing further types.\n *\/\n\ntemplate <typename T, typename... T_pack>\nstruct partials_return_type {\n typedef typename boost::math::tools::promote_args<\n double, typename partials_type<typename scalar_type<T>::type>::type,\n typename partials_return_type<T_pack...>::type>::type type;\n};\n\ntemplate <typename T>\nstruct partials_return_type<T> {\n typedef typename boost::math::tools::promote_args<\n double, typename partials_type<typename scalar_type<T>::type>::type>::type\n type;\n};\n\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Standard headers\n#include <cmath>\n#include <thread>\n#include <iostream>\n#include <algorithm>\n\n\/\/ Local headers\n#include \"Math.hpp\"\n#include \"Barrier.hpp\"\n\nconst double PI = 3.141592653589793238462643;\n\nmpz factorial(const mpz& n) {\n return (n == 1 || n == 0) ? mpz(1) : factorial(n - 1) * n;\n}\n\nmpf Cosine::calculatePrecision(int exponent) {\n mpf epsilon;\n mpf_pow_ui(epsilon.get_mpf_t(), mpf(0.1).get_mpf_t(), exponent);\n return epsilon;\n}\n\nmpf Cosine::fixRadians_impl(const mpf& radians) {\n if (radians > 2*PI)\n return fixRadians_impl(radians - 2*PI);\n return radians;\n}\n\nmpf Cosine::fixRadians(const mpf& radians) {\n return fixRadians_impl(abs(radians));\n}\n\nmpf Cosine::calculateTerm(const mpf& radians, unsigned int n) {\n mpf aux = 0; int signal = n % 2 == 0 ? 1 : -1;\n mpf_pow_ui(aux.get_mpf_t(), radians.get_mpf_t(), 2*n);\n return signal * (aux \/ factorial(2*n));\n}\n\nmpf Cosine::singleThreadedCosine() {\n mpf cos = 0, aux = 0;\n\n mpf fixed_radians { fixRadians(radians) };\n\n for (unsigned int n = 0; true; n++) {\n aux = std::move(calculateTerm(radians, n));\n cos += aux;\n if (abs(aux) < precision) break;\n }\n\n return cos;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCosine::Cosine(const mpf& radians,\n int exponent,\n char stop_criteria,\n unsigned int num_threads)\n : radians(radians),\n stop_criteria(stop_criteria),\n num_threads(num_threads),\n terms(num_threads, 0),\n barrier(num_threads) {\n precision = calculatePrecision(exponent);\n}\n\nvoid Cosine::worker(unsigned int offset) {\n terms[offset] = std::move(calculateTerm(radians, iteration * terms.size() + offset));\n}\n\nbool Cosine::coordinator() {\n mpf aux = 0;\n for (auto &term : terms) aux += term;\n\n cos += aux;\n\n if (stop_criteria == 'f') {\n if (abs(aux) < precision) return true;\n } else if (stop_criteria == 'm') {\n if (std::any_of(terms.begin(), terms.end(), \n [this] (const mpf& t) { return abs(t) < precision; })) \n return true;\n }\n return false;\n}\n\nvoid Cosine::asyncCalculateTerm(unsigned int offset,\n bool is_coordinator) {\n while (!stop) {\n worker(offset);\n barrier.wait();\n\n if (is_coordinator) {\n stop = coordinator();\n iteration++;\n }\n barrier.wait();\n }\n}\n\nmpf Cosine::multiThreadedCosine() {\n\n mpf fixed_radians { fixRadians(radians) };\n\n std::vector<std::thread> threads;\n\n for (unsigned int offset = 0; offset < num_threads-1; offset++) {\n threads.emplace_back(&Cosine::asyncCalculateTerm, this, offset, false);\n }\n\n asyncCalculateTerm(num_threads-1, true);\n\n for (auto &thread : threads) thread.join();\n\n return cos;\n}\n<commit_msg>Extract correction of 'radians'<commit_after>\/\/ Standard headers\n#include <cmath>\n#include <thread>\n#include <iostream>\n#include <algorithm>\n\n\/\/ Local headers\n#include \"Math.hpp\"\n#include \"Barrier.hpp\"\n\nconst double PI = 3.141592653589793238462643;\n\nmpz factorial(const mpz& n) {\n return (n == 1 || n == 0) ? mpz(1) : factorial(n - 1) * n;\n}\n\nmpf Cosine::calculatePrecision(int exponent) {\n mpf epsilon;\n mpf_pow_ui(epsilon.get_mpf_t(), mpf(0.1).get_mpf_t(), exponent);\n return epsilon;\n}\n\nmpf Cosine::fixRadians_impl(const mpf& radians) {\n if (radians > 2*PI)\n return fixRadians_impl(radians - 2*PI);\n return radians;\n}\n\nmpf Cosine::fixRadians(const mpf& radians) {\n return fixRadians_impl(abs(radians));\n}\n\nmpf Cosine::calculateTerm(const mpf& radians, unsigned int n) {\n mpf aux = 0; int signal = n % 2 == 0 ? 1 : -1;\n mpf_pow_ui(aux.get_mpf_t(), radians.get_mpf_t(), 2*n);\n return signal * (aux \/ factorial(2*n));\n}\n\nmpf Cosine::singleThreadedCosine() {\n mpf cos = 0, aux = 0;\n\n for (unsigned int n = 0; true; n++) {\n aux = std::move(calculateTerm(radians, n));\n cos += aux;\n if (abs(aux) < precision) break;\n }\n\n return cos;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCosine::Cosine(const mpf& radians,\n int exponent,\n char stop_criteria,\n unsigned int num_threads)\n : radians(fixRadians(radians)),\n precision(calculatePrecision(exponent)),\n stop_criteria(stop_criteria),\n num_threads(num_threads),\n terms(num_threads, 0),\n barrier(num_threads) {\n}\n\nvoid Cosine::worker(unsigned int offset) {\n terms[offset] = std::move(calculateTerm(radians, iteration * terms.size() + offset));\n}\n\nbool Cosine::coordinator() {\n mpf aux = 0;\n for (auto &term : terms) aux += term;\n\n cos += aux;\n\n if (stop_criteria == 'f') {\n if (abs(aux) < precision) return true;\n } else if (stop_criteria == 'm') {\n if (std::any_of(terms.begin(), terms.end(), \n [this] (const mpf& t) { return abs(t) < precision; })) \n return true;\n }\n return false;\n}\n\nvoid Cosine::asyncCalculateTerm(unsigned int offset,\n bool is_coordinator) {\n while (!stop) {\n worker(offset);\n barrier.wait();\n\n if (is_coordinator) {\n stop = coordinator();\n iteration++;\n }\n barrier.wait();\n }\n}\n\nmpf Cosine::multiThreadedCosine() {\n\n std::vector<std::thread> threads;\n\n for (unsigned int offset = 0; offset < num_threads-1; offset++) {\n threads.emplace_back(&Cosine::asyncCalculateTerm, this, offset, false);\n }\n\n asyncCalculateTerm(num_threads-1, true);\n\n for (auto &thread : threads) thread.join();\n\n return cos;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ucontext.h>\n\nnamespace factor\n{\n\ninline static void *ucontext_stack_pointer(void *uap)\n{\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\treturn (void *)ucontext->uc_mcontext.gregs[7];\n}\n\ninline static unsigned int uap_fpu_status(void *uap)\n{\n\t\/\/ XXX mxcsr not available in i386 ucontext\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\treturn ucontext->uc_mcontext.fpregs->sw;\n}\n\ninline static void uap_clear_fpu_status(void *uap)\n{\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\tucontext->uc_mcontext.fpregs->sw = 0;\n}\n\n#define UAP_PROGRAM_COUNTER(ucontext) \\\n\t(((ucontext_t *)(ucontext))->uc_mcontext.gregs[14])\n\n}\n<commit_msg>more secret sauce to tease mxcsr out of linux-x86.32 ucontext<commit_after>#include <ucontext.h>\n\nnamespace factor\n{\n\n\/\/ glibc lies about the contents of the fpstate the kernel provides, hiding the FXSR\n\/\/ environment\nstruct _fpstate {\n\t\/* Regular FPU environment *\/\n\tunsigned long cw;\n\tunsigned long sw;\n\tunsigned long tag;\n\tunsigned long ipoff;\n\tunsigned long cssel;\n\tunsigned long dataoff;\n\tunsigned long datasel;\n\tstruct _fpreg _st[8];\n\tunsigned short status;\n\tunsigned short magic; \/* 0xffff = regular FPU data only *\/\n\t\n\t\/* FXSR FPU environment *\/\n\tunsigned long _fxsr_env[6]; \/* FXSR FPU env is ignored *\/\n\tunsigned long mxcsr;\n\tunsigned long reserved;\n\tstruct _fpxreg _fxsr_st[8]; \/* FXSR FPU reg data is ignored *\/\n\tstruct _xmmreg _xmm[8];\n\tunsigned long padding[56];\n};\n\n#define X86_FXSR_MAGIC 0x0000\n\ninline static void *ucontext_stack_pointer(void *uap)\n{\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\treturn (void *)ucontext->uc_mcontext.gregs[7];\n}\n\ninline static unsigned int uap_fpu_status(void *uap)\n{\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\tstruct _fpstate *fpregs = (struct _fpstate *)uap->uc_mcontext.fpregs;\n\tif (fpregs->magic == X86_FXSR_MAGIC)\n\t return fpregs->sw | fpregs->mxcsr;\n\telse\n\t return fpregs->sw;\n}\n\ninline static void uap_clear_fpu_status(void *uap)\n{\n\tucontext_t *ucontext = (ucontext_t *)uap;\n\tstruct _fpstate *fpregs = (struct _fpstate *)uap->uc_mcontext.fpregs;\n\tfpregs->sw = 0;\n\tif (fpregs->magic == X86_FXSR_MAGIC)\n\t fpregs->mxcsr &= 0xffffffc0;\n}\n\n#define UAP_PROGRAM_COUNTER(ucontext) \\\n\t(((ucontext_t *)(ucontext))->uc_mcontext.gregs[14])\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <atlbase.h>\n#include <atlapp.h>\n#include <malloc.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/icu_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/stats_table.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/browser\/render_process_host.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_counters.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/env_util.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/common\/resource_bundle.h\"\n#include \"sandbox\/src\/sandbox.h\"\n#include \"tools\/memory_watcher\/memory_watcher.h\"\n\nextern int BrowserMain(CommandLine &, int, sandbox::BrokerServices*);\nextern int RendererMain(CommandLine &, int, sandbox::TargetServices*);\nextern int PluginMain(CommandLine &, int, sandbox::TargetServices*);\n\nstatic const wchar_t kProfilingDll[] = L\"memory_watcher.dll\";\n\n\/\/ Load the memory profiling DLL. All it needs to be activated\n\/\/ is to be loaded. Return true on success, false otherwise.\nbool LoadMemoryProfiler() {\n HMODULE prof_module = LoadLibrary(kProfilingDll);\n return prof_module != NULL;\n}\n\nCAppModule _Module;\n\n\/\/ TODO(erikkay): isn't this already defined somewhere?\n#define DLLEXPORT __declspec(dllexport)\n\n\/\/ We use extern C for the prototype DLLEXPORT to avoid C++ name mangling.\nextern \"C\" {\nDLLEXPORT int __cdecl ChromeMain(HINSTANCE instance,\n sandbox::SandboxInterfaceInfo *sandbox_info,\n TCHAR* command_line, int show_command);\n}\n\n#pragma optimize(\"\", off)\n\/\/ Handlers for invalid parameter and pure call. They generate a breakpoint to\n\/\/ tell breakpad that it needs to dump the process.\nvoid InvalidParameter(const wchar_t* expression, const wchar_t* function,\n const wchar_t* file, unsigned int line,\n uintptr_t reserved) {\n __debugbreak();\n}\n\nvoid PureCall() {\n __debugbreak();\n}\n\n\/\/ Handlers to silently dump the current process when there is an assert in\n\/\/ chrome.\nvoid ChromeAssert(const std::string& str) {\n \/\/ Get the breakpad pointer from chrome.exe\n typedef void (__stdcall *DumpProcessFunction)();\n DumpProcessFunction DumpProcess = reinterpret_cast<DumpProcessFunction>(\n ::GetProcAddress(::GetModuleHandle(L\"chrome.exe\"), \"DumpProcess\"));\n if (DumpProcess)\n DumpProcess();\n}\n\n#pragma optimize(\"\", on)\n\n\/\/ Try to unload DLLs that malfunction with the sandboxed processes.\nstatic void EvictTroublesomeDlls() {\n const wchar_t* troublesome_dlls[] = {\n L\"smumhook.dll\", \/\/ spyware doctor version 5 and above.\n NULL \/\/ Must be null. Here you can add with the debugger.\n };\n\n for(int ix = 0; ix != arraysize(troublesome_dlls); ++ix) {\n if (!troublesome_dlls[ix])\n break;\n HMODULE module = ::GetModuleHandleW(troublesome_dlls[ix]);\n if (module) {\n LOG(WARNING) << \"dll to evict found: \" << ix;\n if (::FreeLibrary(module)) {\n DCHECK(NULL == ::GetModuleHandleW(troublesome_dlls[ix]));\n }\n }\n }\n}\n\nDLLEXPORT int __cdecl ChromeMain(HINSTANCE instance,\n sandbox::SandboxInterfaceInfo *sandbox_info,\n TCHAR* command_line, int show_command) {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n _CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n#else\n _CrtSetReportMode(_CRT_ASSERT, 0);\n#endif\n\n \/\/ Register the invalid param handler and pure call handler to be able to\n \/\/ notify breakpad when it happens.\n _set_invalid_parameter_handler(InvalidParameter);\n _set_purecall_handler(PureCall);\n\n CommandLine parsed_command_line;\n\n \/\/ Enable the low fragmentation heap for the CRT heap. The heap is not changed\n \/\/ if the process is run under the debugger is enabled or if certain gflags\n \/\/ are set.\n bool use_lfh = false;\n if (parsed_command_line.HasSwitch(switches::kUseLowFragHeapCrt))\n use_lfh = parsed_command_line.GetSwitchValue(switches::kUseLowFragHeapCrt)\n != L\"false\";\n if (use_lfh) {\n void* crt_heap = reinterpret_cast<void*>(_get_heap_handle());\n ULONG enable_lfh = 2;\n HeapSetInformation(crt_heap, HeapCompatibilityInformation,\n &enable_lfh, sizeof(enable_lfh));\n }\n\n \/\/ Initialize the Chrome path provider.\n chrome::RegisterPathProvider();\n\n \/\/ Initialize the Stats Counters table. With this initialized,\n \/\/ the StatsViewer can be utilized to read counters outside of\n \/\/ Chrome. These lines can be commented out to effectively turn\n \/\/ counters 'off'. The table is created and exists for the life\n \/\/ of the process. It is not cleaned up.\n StatsTable *stats_table = new StatsTable(chrome::kStatsFilename,\n chrome::kStatsMaxThreads, chrome::kStatsMaxCounters);\n StatsTable::set_current(stats_table);\n\n StatsScope<StatsCounterTimer>\n startup_timer(chrome::Counters::chrome_main());\n\n \/\/ Enable the heap profiler as early as possible!\n if (parsed_command_line.HasSwitch(switches::kMemoryProfiling))\n if (!LoadMemoryProfiler())\n exit(-1);\n\n \/\/ Enable Message Loop related state asap.\n if (parsed_command_line.HasSwitch(switches::kMessageLoopStrategy)) {\n std::wstring details =\n parsed_command_line.GetSwitchValue(switches::kMessageLoopStrategy);\n int strategy = 0;\n if (details.size()) {\n strategy = static_cast<int>(StringToInt64(details));\n }\n MessageLoop::SetStrategy(strategy);\n }\n if (parsed_command_line.HasSwitch(switches::kMessageLoopHistogrammer))\n MessageLoop::EnableHistogrammer(true);\n\n sandbox::TargetServices* target_services = NULL;\n sandbox::BrokerServices* broker_services = NULL;\n if (sandbox_info) {\n target_services = sandbox_info->target_services;\n broker_services = sandbox_info->broker_services;\n }\n\n std::wstring process_type =\n parsed_command_line.GetSwitchValue(switches::kProcessType);\n\n bool do_dll_eviction = false;\n\n \/\/ Checks if the sandbox is enabled in this process and initializes it if this\n \/\/ is the case. The crash handler depends on this so it has to be done before\n \/\/ its initialization.\n if (target_services && !parsed_command_line.HasSwitch(switches::kNoSandbox)) {\n if ((process_type == switches::kRendererProcess) ||\n (process_type == switches::kPluginProcess &&\n parsed_command_line.HasSwitch(switches::kSafePlugins))) {\n target_services->Init();\n do_dll_eviction = true;\n }\n }\n\n _Module.Init(NULL, instance);\n\n \/\/ Allocate a message loop for this thread\n MessageLoop main_message_loop;\n\n \/\/ Notice a user data directory override if any\n const std::wstring user_data_dir =\n parsed_command_line.GetSwitchValue(switches::kUserDataDir);\n if (!user_data_dir.empty())\n PathService::Override(chrome::DIR_USER_DATA, user_data_dir);\n\n bool single_process =\n parsed_command_line.HasSwitch(switches::kSingleProcess);\n if (single_process)\n RenderProcessHost::set_run_renderer_in_process(true);\n\n bool icu_result = icu_util::Initialize();\n CHECK(icu_result);\n\n logging::OldFileDeletionState file_state =\n logging::APPEND_TO_OLD_LOG_FILE;\n if (process_type.empty()) {\n file_state = logging::DELETE_OLD_LOG_FILE;\n }\n logging::InitChromeLogging(parsed_command_line, file_state);\n\n#ifdef NDEBUG\n if (parsed_command_line.HasSwitch(switches::kSilentDumpOnDCHECK) &&\n parsed_command_line.HasSwitch(switches::kEnableDCHECK)) {\n logging::SetLogAssertHandler(ChromeAssert);\n }\n#endif\n\n if (!process_type.empty()) {\n \/\/ Initialize ResourceBundle which handles files loaded from external\n \/\/ sources. The language should have been passed in to us from the\n \/\/ browser process as a command line flag.\n ResourceBundle::InitSharedInstance(std::wstring());\n }\n\n \/\/ Eviction of injected DLLs is done early enough that it is likely\n \/\/ to only cover DLLs injected by means of appInit_dlls registry key.\n if (do_dll_eviction)\n EvictTroublesomeDlls();\n\n startup_timer.Stop(); \/\/ End of Startup Time Measurement.\n\n int rv;\n if (process_type == switches::kRendererProcess) {\n rv = RendererMain(parsed_command_line, show_command, target_services);\n } else if (process_type == switches::kPluginProcess) {\n rv = PluginMain(parsed_command_line, show_command, target_services);\n } else if (process_type.empty()) {\n int ole_result = OleInitialize(NULL);\n DCHECK(ole_result == S_OK);\n rv = BrowserMain(parsed_command_line, show_command, broker_services);\n OleUninitialize();\n } else {\n NOTREACHED() << \"Unknown process type\";\n rv = -1;\n }\n\n if (!process_type.empty()) {\n ResourceBundle::CleanupSharedInstance();\n }\n\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtDumpMemoryLeaks();\n#endif\n\n _Module.Term();\n\n logging::CleanupChromeLogging();\n\n return rv;\n}\n<commit_msg>Trap all malloc\/new allocation failures in chrome.dll at allocation point. This won't fix the failure but this will help classifying minidumps.<commit_after>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include <atlbase.h>\n#include <atlapp.h>\n#include <malloc.h>\n#include <new.h>\n\n#include \"base\/command_line.h\"\n#include \"base\/icu_util.h\"\n#include \"base\/message_loop.h\"\n#include \"base\/path_service.h\"\n#include \"base\/stats_table.h\"\n#include \"base\/string_util.h\"\n#include \"base\/win_util.h\"\n#include \"chrome\/browser\/render_process_host.h\"\n#include \"chrome\/common\/chrome_constants.h\"\n#include \"chrome\/common\/chrome_counters.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/env_util.h\"\n#include \"chrome\/common\/env_vars.h\"\n#include \"chrome\/common\/logging_chrome.h\"\n#include \"chrome\/common\/resource_bundle.h\"\n#include \"sandbox\/src\/sandbox.h\"\n#include \"tools\/memory_watcher\/memory_watcher.h\"\n\nextern int BrowserMain(CommandLine &, int, sandbox::BrokerServices*);\nextern int RendererMain(CommandLine &, int, sandbox::TargetServices*);\nextern int PluginMain(CommandLine &, int, sandbox::TargetServices*);\n\nstatic const wchar_t kProfilingDll[] = L\"memory_watcher.dll\";\n\n\/\/ Load the memory profiling DLL. All it needs to be activated\n\/\/ is to be loaded. Return true on success, false otherwise.\nbool LoadMemoryProfiler() {\n HMODULE prof_module = LoadLibrary(kProfilingDll);\n return prof_module != NULL;\n}\n\nCAppModule _Module;\n\n\/\/ TODO(erikkay): isn't this already defined somewhere?\n#define DLLEXPORT __declspec(dllexport)\n\n\/\/ We use extern C for the prototype DLLEXPORT to avoid C++ name mangling.\nextern \"C\" {\nDLLEXPORT int __cdecl ChromeMain(HINSTANCE instance,\n sandbox::SandboxInterfaceInfo *sandbox_info,\n TCHAR* command_line, int show_command);\n}\n\n#pragma optimize(\"\", off)\n\/\/ Handlers for invalid parameter and pure call. They generate a breakpoint to\n\/\/ tell breakpad that it needs to dump the process.\nvoid InvalidParameter(const wchar_t* expression, const wchar_t* function,\n const wchar_t* file, unsigned int line,\n uintptr_t reserved) {\n __debugbreak();\n}\n\nvoid PureCall() {\n __debugbreak();\n}\n\nint OnNoMemory(size_t memory_size) {\n __debugbreak();\n \/\/ Return memory_size so it is not optimized out. Make sure the return value\n \/\/ is at least 1 so malloc\/new is retried, especially useful when under a\n \/\/ debugger.\n return memory_size ? static_cast<int>(memory_size) : 1;\n}\n\n\/\/ Handlers to silently dump the current process when there is an assert in\n\/\/ chrome.\nvoid ChromeAssert(const std::string& str) {\n \/\/ Get the breakpad pointer from chrome.exe\n typedef void (__stdcall *DumpProcessFunction)();\n DumpProcessFunction DumpProcess = reinterpret_cast<DumpProcessFunction>(\n ::GetProcAddress(::GetModuleHandle(L\"chrome.exe\"), \"DumpProcess\"));\n if (DumpProcess)\n DumpProcess();\n}\n\n#pragma optimize(\"\", on)\n\n\/\/ Try to unload DLLs that malfunction with the sandboxed processes.\nstatic void EvictTroublesomeDlls() {\n const wchar_t* troublesome_dlls[] = {\n L\"smumhook.dll\", \/\/ spyware doctor version 5 and above.\n NULL \/\/ Must be null. Here you can add with the debugger.\n };\n\n for(int ix = 0; ix != arraysize(troublesome_dlls); ++ix) {\n if (!troublesome_dlls[ix])\n break;\n HMODULE module = ::GetModuleHandleW(troublesome_dlls[ix]);\n if (module) {\n LOG(WARNING) << \"dll to evict found: \" << ix;\n if (::FreeLibrary(module)) {\n DCHECK(NULL == ::GetModuleHandleW(troublesome_dlls[ix]));\n }\n }\n }\n}\n\nDLLEXPORT int __cdecl ChromeMain(HINSTANCE instance,\n sandbox::SandboxInterfaceInfo *sandbox_info,\n TCHAR* command_line, int show_command) {\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n _CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n#else\n _CrtSetReportMode(_CRT_ASSERT, 0);\n#endif\n\n \/\/ Register the invalid param handler and pure call handler to be able to\n \/\/ notify breakpad when it happens.\n _set_invalid_parameter_handler(InvalidParameter);\n _set_purecall_handler(PureCall);\n \/\/ Gather allocation failure.\n _set_new_handler(&OnNoMemory);\n \/\/ Make sure malloc() calls the new handler too.\n _set_new_mode(1);\n\n CommandLine parsed_command_line;\n\n \/\/ Enable the low fragmentation heap for the CRT heap. The heap is not changed\n \/\/ if the process is run under the debugger is enabled or if certain gflags\n \/\/ are set.\n bool use_lfh = false;\n if (parsed_command_line.HasSwitch(switches::kUseLowFragHeapCrt))\n use_lfh = parsed_command_line.GetSwitchValue(switches::kUseLowFragHeapCrt)\n != L\"false\";\n if (use_lfh) {\n void* crt_heap = reinterpret_cast<void*>(_get_heap_handle());\n ULONG enable_lfh = 2;\n HeapSetInformation(crt_heap, HeapCompatibilityInformation,\n &enable_lfh, sizeof(enable_lfh));\n }\n\n \/\/ Initialize the Chrome path provider.\n chrome::RegisterPathProvider();\n\n \/\/ Initialize the Stats Counters table. With this initialized,\n \/\/ the StatsViewer can be utilized to read counters outside of\n \/\/ Chrome. These lines can be commented out to effectively turn\n \/\/ counters 'off'. The table is created and exists for the life\n \/\/ of the process. It is not cleaned up.\n StatsTable *stats_table = new StatsTable(chrome::kStatsFilename,\n chrome::kStatsMaxThreads, chrome::kStatsMaxCounters);\n StatsTable::set_current(stats_table);\n\n StatsScope<StatsCounterTimer>\n startup_timer(chrome::Counters::chrome_main());\n\n \/\/ Enable the heap profiler as early as possible!\n if (parsed_command_line.HasSwitch(switches::kMemoryProfiling))\n if (!LoadMemoryProfiler())\n exit(-1);\n\n \/\/ Enable Message Loop related state asap.\n if (parsed_command_line.HasSwitch(switches::kMessageLoopStrategy)) {\n std::wstring details =\n parsed_command_line.GetSwitchValue(switches::kMessageLoopStrategy);\n int strategy = 0;\n if (details.size()) {\n strategy = static_cast<int>(StringToInt64(details));\n }\n MessageLoop::SetStrategy(strategy);\n }\n if (parsed_command_line.HasSwitch(switches::kMessageLoopHistogrammer))\n MessageLoop::EnableHistogrammer(true);\n\n sandbox::TargetServices* target_services = NULL;\n sandbox::BrokerServices* broker_services = NULL;\n if (sandbox_info) {\n target_services = sandbox_info->target_services;\n broker_services = sandbox_info->broker_services;\n }\n\n std::wstring process_type =\n parsed_command_line.GetSwitchValue(switches::kProcessType);\n\n bool do_dll_eviction = false;\n\n \/\/ Checks if the sandbox is enabled in this process and initializes it if this\n \/\/ is the case. The crash handler depends on this so it has to be done before\n \/\/ its initialization.\n if (target_services && !parsed_command_line.HasSwitch(switches::kNoSandbox)) {\n if ((process_type == switches::kRendererProcess) ||\n (process_type == switches::kPluginProcess &&\n parsed_command_line.HasSwitch(switches::kSafePlugins))) {\n target_services->Init();\n do_dll_eviction = true;\n }\n }\n\n _Module.Init(NULL, instance);\n\n \/\/ Allocate a message loop for this thread\n MessageLoop main_message_loop;\n\n \/\/ Notice a user data directory override if any\n const std::wstring user_data_dir =\n parsed_command_line.GetSwitchValue(switches::kUserDataDir);\n if (!user_data_dir.empty())\n PathService::Override(chrome::DIR_USER_DATA, user_data_dir);\n\n bool single_process =\n parsed_command_line.HasSwitch(switches::kSingleProcess);\n if (single_process)\n RenderProcessHost::set_run_renderer_in_process(true);\n\n bool icu_result = icu_util::Initialize();\n CHECK(icu_result);\n\n logging::OldFileDeletionState file_state =\n logging::APPEND_TO_OLD_LOG_FILE;\n if (process_type.empty()) {\n file_state = logging::DELETE_OLD_LOG_FILE;\n }\n logging::InitChromeLogging(parsed_command_line, file_state);\n\n#ifdef NDEBUG\n if (parsed_command_line.HasSwitch(switches::kSilentDumpOnDCHECK) &&\n parsed_command_line.HasSwitch(switches::kEnableDCHECK)) {\n logging::SetLogAssertHandler(ChromeAssert);\n }\n#endif\n\n if (!process_type.empty()) {\n \/\/ Initialize ResourceBundle which handles files loaded from external\n \/\/ sources. The language should have been passed in to us from the\n \/\/ browser process as a command line flag.\n ResourceBundle::InitSharedInstance(std::wstring());\n }\n\n \/\/ Eviction of injected DLLs is done early enough that it is likely\n \/\/ to only cover DLLs injected by means of appInit_dlls registry key.\n if (do_dll_eviction)\n EvictTroublesomeDlls();\n\n startup_timer.Stop(); \/\/ End of Startup Time Measurement.\n\n int rv;\n if (process_type == switches::kRendererProcess) {\n rv = RendererMain(parsed_command_line, show_command, target_services);\n } else if (process_type == switches::kPluginProcess) {\n rv = PluginMain(parsed_command_line, show_command, target_services);\n } else if (process_type.empty()) {\n int ole_result = OleInitialize(NULL);\n DCHECK(ole_result == S_OK);\n rv = BrowserMain(parsed_command_line, show_command, broker_services);\n OleUninitialize();\n } else {\n NOTREACHED() << \"Unknown process type\";\n rv = -1;\n }\n\n if (!process_type.empty()) {\n ResourceBundle::CleanupSharedInstance();\n }\n\n#ifdef _CRTDBG_MAP_ALLOC\n _CrtDumpMemoryLeaks();\n#endif\n\n _Module.Term();\n\n logging::CleanupChromeLogging();\n\n return rv;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Have rlz record first search event in a corner case<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ MCHTMLRendererCallback.cpp\n\/\/ mailcore2\n\/\/\n\/\/ Created by DINH Viêt Hoà on 2\/2\/13.\n\/\/ Copyright (c) 2013 MailCore. All rights reserved.\n\/\/\n\n#include \"MCHTMLRendererCallback.h\"\n\n#include \"MCAddressDisplay.h\"\n#include \"MCDateFormatter.h\"\n#include \"MCSizeFormatter.h\"\n#include \"MCAttachment.h\"\n\nusing namespace mailcore;\n\nmailcore::HashMap * HTMLRendererTemplateCallback::templateValuesForHeader(mailcore::MessageHeader * header)\n{\n mailcore::HashMap * result = mailcore::HashMap::hashMap();\n \n if (header->from() != NULL) {\n result->setObjectForKey(MCSTR(\"HASFROM\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"FROM\"), mailcore::AddressDisplay::displayStringForAddress(header->from())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTFROM\"), mailcore::AddressDisplay::shortDisplayStringForAddress(header->from())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTFROM\"), mailcore::AddressDisplay::veryShortDisplayStringForAddress(header->from())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOFROM\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->to() != NULL) && (header->to()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASTO\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"TO\"), mailcore::AddressDisplay::displayStringForAddresses(header->to())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTTO\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->to())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTTO\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->to())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOTO\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->cc() != NULL) && (header->cc()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASCC\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"CC\"), mailcore::AddressDisplay::displayStringForAddresses(header->cc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTCC\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->cc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTCC\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->cc())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOCC\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->bcc() != NULL) && (header->bcc()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASBCC\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"BCC\"), mailcore::AddressDisplay::displayStringForAddresses(header->bcc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTBCC\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->bcc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTBCC\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->bcc())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOBCC\"), mailcore::HashMap::hashMap());\n }\n \n mailcore::Array * recipient = new mailcore::Array();\n recipient->addObjectsFromArray(header->to());\n recipient->addObjectsFromArray(header->cc());\n recipient->addObjectsFromArray(header->bcc());\n \n if (recipient->count() > 0) {\n result->setObjectForKey(MCSTR(\"HASRECIPIENT\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"RECIPIENT\"), mailcore::AddressDisplay::displayStringForAddresses(recipient)->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTRECIPIENT\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(recipient)->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTRECIPIENT\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(recipient)->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NORECIPIENT\"), mailcore::HashMap::hashMap());\n }\n recipient->release();\n \n if ((header->replyTo() != NULL) && (header->replyTo()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASREPLYTO\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"REPLYTO\"), mailcore::AddressDisplay::displayStringForAddresses(header->replyTo())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTREPLYTO\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->replyTo())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTREPLYTO\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->replyTo())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOREPLYTO\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->subject() != NULL) && (header->subject()->length() > 0)) {\n result->setObjectForKey(MCSTR(\"EXTRACTEDSUBJECT\"), header->partialExtractedSubject()->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SUBJECT\"), header->subject()->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"HASSUBJECT\"), mailcore::HashMap::hashMap());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOSUBJECT\"), mailcore::HashMap::hashMap());\n }\n \n mailcore::String * dateString;\n static mailcore::DateFormatter * fullFormatter = NULL;\n if (fullFormatter == NULL) {\n fullFormatter = new mailcore::DateFormatter();\n fullFormatter->setDateStyle(mailcore::DateFormatStyleFull);\n fullFormatter->setTimeStyle(mailcore::DateFormatStyleFull);\n }\n dateString = fullFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"FULLDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * longFormatter = NULL;\n if (longFormatter == NULL) {\n longFormatter = new mailcore::DateFormatter();\n longFormatter->setDateStyle(mailcore::DateFormatStyleLong);\n longFormatter->setTimeStyle(mailcore::DateFormatStyleLong);\n }\n dateString = longFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"LONGDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * mediumFormatter = NULL;\n if (mediumFormatter == NULL) {\n mediumFormatter = new mailcore::DateFormatter();\n mediumFormatter->setDateStyle(mailcore::DateFormatStyleMedium);\n mediumFormatter->setTimeStyle(mailcore::DateFormatStyleMedium);\n }\n dateString = mediumFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"MEDIUMDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * shortFormatter = NULL;\n if (shortFormatter == NULL) {\n shortFormatter = new mailcore::DateFormatter();\n shortFormatter->setDateStyle(mailcore::DateFormatStyleShort);\n shortFormatter->setTimeStyle(mailcore::DateFormatStyleShort);\n }\n dateString = shortFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"SHORTDATE\"), dateString->htmlEncodedString());\n }\n \n return result;\n}\n\nmailcore::HashMap * HTMLRendererTemplateCallback::templateValuesForPart(mailcore::AbstractPart * part)\n{\n mailcore::HashMap * result = mailcore::HashMap::hashMap();\n mailcore::String * filename = NULL;\n \n if (part->filename() != NULL) {\n filename = part->filename()->lastPathComponent();\n }\n \n if (filename != NULL) {\n result->setObjectForKey(MCSTR(\"FILENAME\"), filename->htmlEncodedString());\n }\n \n if (part->className()->isEqual(MCSTR(\"mailcore::IMAPPart\"))) {\n mailcore::IMAPPart * imapPart = (mailcore::IMAPPart *) part;\n mailcore::String * value = mailcore::SizeFormatter::stringWithSize(imapPart->size());\n result->setObjectForKey(MCSTR(\"SIZE\"), value);\n result->setObjectForKey(MCSTR(\"HASSIZE\"), mailcore::HashMap::hashMap());\n }\n else if (part->className()->isEqual(MCSTR(\"mailcore::Attachment\"))) {\n mailcore::Attachment * attachment = (mailcore::Attachment *) part;\n mailcore::String * value = mailcore::SizeFormatter::stringWithSize(attachment->data()->length());\n result->setObjectForKey(MCSTR(\"SIZE\"), value);\n result->setObjectForKey(MCSTR(\"HASSIZE\"), mailcore::HashMap::hashMap());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOSIZE\"), mailcore::HashMap::hashMap());\n }\n \n if (part->contentID() != NULL) {\n result->setObjectForKey(MCSTR(\"CONTENTID\"), part->contentID());\n }\n if (part->uniqueID() != NULL) {\n result->setObjectForKey(MCSTR(\"UNIQUEID\"), part->uniqueID());\n }\n \n return result;\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForMainHeader(MessageHeader * header)\n{\n return MCSTR(\"<div style=\\\"background-color:#eee\\\">\\\n {{#HASFROM}}\\\n <div><b>From:<\/b> {{FROM}}<\/div>\\\n {{\/HASFROM}}\\\n {{#HASTO}}\\\n <div><b>To:<\/b> {{TO}}<\/div>\\\n {{\/HASTO}}\\\n {{#HASCC}}\\\n <div><b>Cc:<\/b> {{CC}}<\/div>\\\n {{\/HASCC}}\\\n {{#HASBCC}}\\\n <div><b>Bcc:<\/b> {{BCC}}<\/div>\\\n {{\/HASBCC}}\\\n {{#NORECIPIENT}}\\\n <div><b>To:<\/b> <i>Undisclosed recipient<\/i><\/div>\\\n {{\/NORECIPIENT}}\\\n {{#HASSUBJECT}}\\\n <div><b>Subject:<\/b> {{EXTRACTEDSUBJECT}}<\/div>\\\n {{\/HASSUBJECT}}\\\n {{#NOSUBJECT}}\\\n <div><b>Subject:<\/b> <i>No Subject<\/i><\/div>\\\n {{\/NOSUBJECT}}\\\n <div><b>Date:<\/b> {{LONGDATE}}<\/div>\\\n <\/div>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForEmbeddedMessageHeader(MessageHeader * header)\n{\n return templateForMainHeader(header);\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForImage(AbstractPart * part)\n{\n return MCSTR(\"\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForAttachment(AbstractPart * part)\n{\n return MCSTR(\"{{#HASSIZE}}\\\n <div>- {{FILENAME}}, {{SIZE}}<\/div>\\\n {{\/HASSIZE}}\\\n {{#NOSIZE}}\\\n <div>- {{FILENAME}}<\/div>\\\n {{\/NOSIZE}}\\\n \");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForMessage(AbstractMessage * message)\n{\n return MCSTR(\"<div style=\\\"padding-bottom: 20px;\\\">{{HEADER}}<\/div><div>{{BODY}}<\/div>\");\n}\n\n\nmailcore::String * HTMLRendererTemplateCallback::templateForEmbeddedMessage(AbstractMessagePart * part)\n{\n return MCSTR(\"<div style=\\\"padding-bottom: 20px;\\\">{{HEADER}}<\/div><div>{{BODY}}<\/div>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForAttachmentSeparator()\n{\n return MCSTR(\"<hr\/>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::filterHTMLForMessage(mailcore::String * html)\n{\n return html;\n}\n\nmailcore::String * HTMLRendererTemplateCallback::filterHTMLForPart(mailcore::String * html)\n{\n return html;\n}\n\nbool HTMLRendererTemplateCallback::canPreviewPart(AbstractPart * part)\n{\n return false;\n}\n\nbool HTMLRendererTemplateCallback::shouldShowPart(AbstractPart * part)\n{\n return true;\n}\n<commit_msg>Fixed part size in default rendering (fixed #595)<commit_after>\/\/\n\/\/ MCHTMLRendererCallback.cpp\n\/\/ mailcore2\n\/\/\n\/\/ Created by DINH Viêt Hoà on 2\/2\/13.\n\/\/ Copyright (c) 2013 MailCore. All rights reserved.\n\/\/\n\n#include \"MCHTMLRendererCallback.h\"\n\n#include \"MCAddressDisplay.h\"\n#include \"MCDateFormatter.h\"\n#include \"MCSizeFormatter.h\"\n#include \"MCAttachment.h\"\n\nusing namespace mailcore;\n\nmailcore::HashMap * HTMLRendererTemplateCallback::templateValuesForHeader(mailcore::MessageHeader * header)\n{\n mailcore::HashMap * result = mailcore::HashMap::hashMap();\n \n if (header->from() != NULL) {\n result->setObjectForKey(MCSTR(\"HASFROM\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"FROM\"), mailcore::AddressDisplay::displayStringForAddress(header->from())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTFROM\"), mailcore::AddressDisplay::shortDisplayStringForAddress(header->from())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTFROM\"), mailcore::AddressDisplay::veryShortDisplayStringForAddress(header->from())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOFROM\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->to() != NULL) && (header->to()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASTO\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"TO\"), mailcore::AddressDisplay::displayStringForAddresses(header->to())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTTO\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->to())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTTO\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->to())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOTO\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->cc() != NULL) && (header->cc()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASCC\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"CC\"), mailcore::AddressDisplay::displayStringForAddresses(header->cc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTCC\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->cc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTCC\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->cc())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOCC\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->bcc() != NULL) && (header->bcc()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASBCC\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"BCC\"), mailcore::AddressDisplay::displayStringForAddresses(header->bcc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTBCC\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->bcc())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTBCC\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->bcc())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOBCC\"), mailcore::HashMap::hashMap());\n }\n \n mailcore::Array * recipient = new mailcore::Array();\n recipient->addObjectsFromArray(header->to());\n recipient->addObjectsFromArray(header->cc());\n recipient->addObjectsFromArray(header->bcc());\n \n if (recipient->count() > 0) {\n result->setObjectForKey(MCSTR(\"HASRECIPIENT\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"RECIPIENT\"), mailcore::AddressDisplay::displayStringForAddresses(recipient)->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTRECIPIENT\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(recipient)->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTRECIPIENT\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(recipient)->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NORECIPIENT\"), mailcore::HashMap::hashMap());\n }\n recipient->release();\n \n if ((header->replyTo() != NULL) && (header->replyTo()->count() > 0)) {\n result->setObjectForKey(MCSTR(\"HASREPLYTO\"), mailcore::HashMap::hashMap());\n result->setObjectForKey(MCSTR(\"REPLYTO\"), mailcore::AddressDisplay::displayStringForAddresses(header->replyTo())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SHORTREPLYTO\"), mailcore::AddressDisplay::shortDisplayStringForAddresses(header->replyTo())->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"VERYSHORTREPLYTO\"), mailcore::AddressDisplay::veryShortDisplayStringForAddresses(header->replyTo())->htmlEncodedString());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOREPLYTO\"), mailcore::HashMap::hashMap());\n }\n \n if ((header->subject() != NULL) && (header->subject()->length() > 0)) {\n result->setObjectForKey(MCSTR(\"EXTRACTEDSUBJECT\"), header->partialExtractedSubject()->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"SUBJECT\"), header->subject()->htmlEncodedString());\n result->setObjectForKey(MCSTR(\"HASSUBJECT\"), mailcore::HashMap::hashMap());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOSUBJECT\"), mailcore::HashMap::hashMap());\n }\n \n mailcore::String * dateString;\n static mailcore::DateFormatter * fullFormatter = NULL;\n if (fullFormatter == NULL) {\n fullFormatter = new mailcore::DateFormatter();\n fullFormatter->setDateStyle(mailcore::DateFormatStyleFull);\n fullFormatter->setTimeStyle(mailcore::DateFormatStyleFull);\n }\n dateString = fullFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"FULLDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * longFormatter = NULL;\n if (longFormatter == NULL) {\n longFormatter = new mailcore::DateFormatter();\n longFormatter->setDateStyle(mailcore::DateFormatStyleLong);\n longFormatter->setTimeStyle(mailcore::DateFormatStyleLong);\n }\n dateString = longFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"LONGDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * mediumFormatter = NULL;\n if (mediumFormatter == NULL) {\n mediumFormatter = new mailcore::DateFormatter();\n mediumFormatter->setDateStyle(mailcore::DateFormatStyleMedium);\n mediumFormatter->setTimeStyle(mailcore::DateFormatStyleMedium);\n }\n dateString = mediumFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"MEDIUMDATE\"), dateString->htmlEncodedString());\n }\n static mailcore::DateFormatter * shortFormatter = NULL;\n if (shortFormatter == NULL) {\n shortFormatter = new mailcore::DateFormatter();\n shortFormatter->setDateStyle(mailcore::DateFormatStyleShort);\n shortFormatter->setTimeStyle(mailcore::DateFormatStyleShort);\n }\n dateString = shortFormatter->stringFromDate(header->date());\n if (dateString != NULL) {\n result->setObjectForKey(MCSTR(\"SHORTDATE\"), dateString->htmlEncodedString());\n }\n \n return result;\n}\n\nmailcore::HashMap * HTMLRendererTemplateCallback::templateValuesForPart(mailcore::AbstractPart * part)\n{\n mailcore::HashMap * result = mailcore::HashMap::hashMap();\n mailcore::String * filename = NULL;\n \n if (part->filename() != NULL) {\n filename = part->filename()->lastPathComponent();\n }\n \n if (filename != NULL) {\n result->setObjectForKey(MCSTR(\"FILENAME\"), filename->htmlEncodedString());\n }\n \n if (part->className()->isEqual(MCSTR(\"mailcore::IMAPPart\"))) {\n mailcore::IMAPPart * imapPart = (mailcore::IMAPPart *) part;\n mailcore::String * value = mailcore::SizeFormatter::stringWithSize(imapPart->decodedSize());\n result->setObjectForKey(MCSTR(\"SIZE\"), value);\n result->setObjectForKey(MCSTR(\"HASSIZE\"), mailcore::HashMap::hashMap());\n }\n else if (part->className()->isEqual(MCSTR(\"mailcore::Attachment\"))) {\n mailcore::Attachment * attachment = (mailcore::Attachment *) part;\n mailcore::String * value = mailcore::SizeFormatter::stringWithSize(attachment->data()->length());\n result->setObjectForKey(MCSTR(\"SIZE\"), value);\n result->setObjectForKey(MCSTR(\"HASSIZE\"), mailcore::HashMap::hashMap());\n }\n else {\n result->setObjectForKey(MCSTR(\"NOSIZE\"), mailcore::HashMap::hashMap());\n }\n \n if (part->contentID() != NULL) {\n result->setObjectForKey(MCSTR(\"CONTENTID\"), part->contentID());\n }\n if (part->uniqueID() != NULL) {\n result->setObjectForKey(MCSTR(\"UNIQUEID\"), part->uniqueID());\n }\n \n return result;\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForMainHeader(MessageHeader * header)\n{\n return MCSTR(\"<div style=\\\"background-color:#eee\\\">\\\n {{#HASFROM}}\\\n <div><b>From:<\/b> {{FROM}}<\/div>\\\n {{\/HASFROM}}\\\n {{#HASTO}}\\\n <div><b>To:<\/b> {{TO}}<\/div>\\\n {{\/HASTO}}\\\n {{#HASCC}}\\\n <div><b>Cc:<\/b> {{CC}}<\/div>\\\n {{\/HASCC}}\\\n {{#HASBCC}}\\\n <div><b>Bcc:<\/b> {{BCC}}<\/div>\\\n {{\/HASBCC}}\\\n {{#NORECIPIENT}}\\\n <div><b>To:<\/b> <i>Undisclosed recipient<\/i><\/div>\\\n {{\/NORECIPIENT}}\\\n {{#HASSUBJECT}}\\\n <div><b>Subject:<\/b> {{EXTRACTEDSUBJECT}}<\/div>\\\n {{\/HASSUBJECT}}\\\n {{#NOSUBJECT}}\\\n <div><b>Subject:<\/b> <i>No Subject<\/i><\/div>\\\n {{\/NOSUBJECT}}\\\n <div><b>Date:<\/b> {{LONGDATE}}<\/div>\\\n <\/div>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForEmbeddedMessageHeader(MessageHeader * header)\n{\n return templateForMainHeader(header);\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForImage(AbstractPart * part)\n{\n return MCSTR(\"\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForAttachment(AbstractPart * part)\n{\n return MCSTR(\"{{#HASSIZE}}\\\n <div>- {{FILENAME}}, {{SIZE}}<\/div>\\\n {{\/HASSIZE}}\\\n {{#NOSIZE}}\\\n <div>- {{FILENAME}}<\/div>\\\n {{\/NOSIZE}}\\\n \");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForMessage(AbstractMessage * message)\n{\n return MCSTR(\"<div style=\\\"padding-bottom: 20px;\\\">{{HEADER}}<\/div><div>{{BODY}}<\/div>\");\n}\n\n\nmailcore::String * HTMLRendererTemplateCallback::templateForEmbeddedMessage(AbstractMessagePart * part)\n{\n return MCSTR(\"<div style=\\\"padding-bottom: 20px;\\\">{{HEADER}}<\/div><div>{{BODY}}<\/div>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::templateForAttachmentSeparator()\n{\n return MCSTR(\"<hr\/>\");\n}\n\nmailcore::String * HTMLRendererTemplateCallback::filterHTMLForMessage(mailcore::String * html)\n{\n return html;\n}\n\nmailcore::String * HTMLRendererTemplateCallback::filterHTMLForPart(mailcore::String * html)\n{\n return html;\n}\n\nbool HTMLRendererTemplateCallback::canPreviewPart(AbstractPart * part)\n{\n return false;\n}\n\nbool HTMLRendererTemplateCallback::shouldShowPart(AbstractPart * part)\n{\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Vittorio Romeo\n\/\/ License: Academic Free License (\"AFL\") v. 3.0\n\/\/ AFL License page: http:\/\/opensource.org\/licenses\/AFL-3.0\n\/\/ http:\/\/vittorioromeo.info | vittorio.romeo@outlook.com\n\n#pragma once\n\n#include <scelta.hpp>\n\nnamespace example\n{\n \/\/ First available variant type.\n template <typename... Ts>\n using variant =\n#if defined(SCELTA_SUPPORT_VARIANT_STD)\n std::variant\n#elif defined(SCELTA_SUPPORT_VARIANT_BOOST)\n boost::variant\n#elif defined(SCELTA_SUPPORT_VARIANT_EGGS)\n eggs::variant\n#else\n#error \"No variant type available.\"\n#endif\n <Ts...>;\n\n\n \/\/ First available optional type.\n template <typename... Ts>\n using optional =\n#if defined(SCELTA_SUPPORT_OPTIONAL_STD)\n std::optional\n#elif defined(SCELTA_SUPPORT_OPTIONAL_BOOST)\n boost::optional\n#else\n#error \"No optional type available.\"\n#endif\n <Ts...>;\n}<commit_msg>Add mpark variant automatic support<commit_after>\/\/ Copyright (c) 2017 Vittorio Romeo\n\/\/ License: Academic Free License (\"AFL\") v. 3.0\n\/\/ AFL License page: http:\/\/opensource.org\/licenses\/AFL-3.0\n\/\/ http:\/\/vittorioromeo.info | vittorio.romeo@outlook.com\n\n#pragma once\n\n#include <scelta.hpp>\n\nnamespace example\n{\n \/\/ First available variant type.\n template <typename... Ts>\n using variant =\n#if defined(SCELTA_SUPPORT_VARIANT_STD)\n ::std::variant\n#elif defined(SCELTA_SUPPORT_VARIANT_BOOST)\n ::boost::variant\n#elif defined(SCELTA_SUPPORT_VARIANT_EGGS)\n ::eggs::variant\n#elif defined(SCELTA_SUPPORT_VARIANT_MPARK)\n ::mpark::variant\n#else\n#error \"No variant type available.\"\n#endif\n <Ts...>;\n\n\n \/\/ First available optional type.\n template <typename... Ts>\n using optional =\n#if defined(SCELTA_SUPPORT_OPTIONAL_STD)\n ::std::optional\n#elif defined(SCELTA_SUPPORT_OPTIONAL_BOOST)\n ::boost::optional\n#else\n#error \"No optional type available.\"\n#endif\n <Ts...>;\n}<|endoftext|>"} {"text":"<commit_before>#include \"constants.hpp\"\n#include <string>\n#include <math.h>\n#include <ros\/ros.h>\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <tf\/transform_broadcaster.h>\n#include <boost\/shared_ptr.hpp>\n#include <fcntl.h>\n#include <termios.h>\n#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <sstream>\n#include <limits>\n\nusing namespace std;\n\n\/\/ A serial interface used to send commands to the Arduino that controls\n\/\/ the motor controllers. (Yeah, recursion!)\n\/\/ (C file descriptor)\nint tty;\nstd::stringstream ss;\n\n\/\/ for odometry\nros::Time currentTime;\nros::Time lastTime;\nros::Publisher odomPub;\nboost::shared_ptr<tf::TransformBroadcaster> odomBroadcaster;\ndouble x = 0;\ndouble y = 0;\ndouble theta = 0;\ndouble vx = 0;\ndouble vy = 0;\ndouble vtheta = 0;\n\/\/ Make current speeds always available (and query them only once per cycle)\ndouble vLeftCur = 0.0;\ndouble vRightCur = 0.0;\n\/\/ Cache speeds to only send data if they change\ndouble vLeftLast = 0.0;\ndouble vRightLast = 0.0;\ndouble vRotLeftLast = 0.0;\ndouble vRotRightLast = 0.0;\n\n\/\/ Used to form the Arduino commands\nconst char MOTOR_LEFT = 'l';\nconst char MOTOR_RIGHT = 'r';\nconst char MOTOR_FORWARD = 'f';\nconst char MOTOR_BACKWARD = 'b';\nconst char MOTOR_STOP = 's';\n\n\/\/ The motors are stopped (not just set to speed 0.0) below this input speed.\nconst float STOP_THRESHOLD = 0.01f;\n\nbool initTty()\n{\n\t\/\/ http:\/\/timmurphy.org\/2009\/08\/04\/baud-rate-and-other-serial-comm-settings-in-c\/\n\ttty = open(\"\/dev\/ttyACM0\", O_RDWR | O_NOCTTY\/* | O_NDELAY*\/);\n\tif(tty < 0) {\n\t\tperror(\"open(\\\"\/dev\/ttyACM0\\\")\");\n\t\treturn false;\n\t}\n\tstruct termios settings;\n\ttcgetattr(tty, &settings);\n\tcfsetospeed(&settings, B115200);\n\tcfsetispeed(&settings, B0 \/*same as output*\/);\n\tsettings.c_cflag &= ~PARENB;\t\/\/ no parity\n\tsettings.c_cflag &= ~CSTOPB;\t\/\/ one stop bit\n\tsettings.c_cflag &= ~CSIZE;\t\t\/\/ 8 bits per character\n\tsettings.c_cflag |= CS8;\n\tsettings.c_cflag &= ~CRTSCTS;\t\/\/ Disable hardware flow control\n\t\/\/ settings.c_cflag &= ~HUPCL;\t\t\/\/ Send modem disconnect when closing the fd\n\tsettings.c_cflag |= CREAD;\t\t\/\/ Enable receiver\n\t\/\/ settings.c_cflag |= CLOCAL;\t\t\/\/ Ignore modem status lines\n\tsettings.c_iflag &= ~(IXON | IXOFF | IXANY); \/\/ Disable start\/stop I\/O control\n\tsettings.c_lflag &= ~(ICANON | ECHO | ECHOE | ISIG); \/\/ Disable user terminal features\n\tsettings.c_oflag &= ~OPOST;\t\t\/\/ Disable output postprocessing\n\tsettings.c_cc[VMIN] = 0;\n\tsettings.c_cc[VTIME] = 0;\n\tif(tcsetattr(tty, TCSANOW, &settings) != 0) {\n\t\tperror(\"tcsetattr\");\n\t\treturn false;\n\t}\n\ttcflush(tty, TCOFLUSH);\n\treturn true;\n}\n\nint readLine(char* const line, const ssize_t LINE_LENGTH)\n{\n\tssize_t bytesRead = 0;\n\tbool lineComplete = false;\n\twhile(!lineComplete && bytesRead < LINE_LENGTH) {\n\t\t\/\/ Read bytes into temporary buffer\n\t\tchar buffer[LINE_LENGTH];\n\t\t\/\/ ROS_INFO(\"a\");\n\t\tssize_t newBytesRead = read(tty, buffer, LINE_LENGTH);\n\t\t\/\/ ROS_INFO(\"b\");\n\t\tif(newBytesRead < 0) {\n\t\t\tperror(\"read\");\n\t\t}\n\t\t\/\/ Copy new bytes to 'line'\n\t\tfor(ssize_t i = 0; i < newBytesRead && bytesRead < LINE_LENGTH; i++, bytesRead++) {\n\t\t\tline[bytesRead] = buffer[i];\n\t\t\tif(buffer[i] == '\\n') {\n\t\t\t\tlineComplete = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn bytesRead;\n}\n\nvoid setDrive(const char motor, const char direction, const float spd = 0.0f)\n{\n\tss.str(\"\");\n\tss << \"sd\" << motor << direction;\n\tif(direction != MOTOR_STOP) {\n\t\tss << std::hex << (int8_t)(spd * 255);\n\t}\n\tss << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ ROS_INFO(\"%s\", output);\n\t\/\/ check response\n\tchar line[2];\n\tconst int lineLength = readLine(line, 2);\n\tif(atoi(line) != 0) {\n\t\tROS_INFO(\"Command failed: %s\", output);\n\t}\n}\n\nvoid setRotation(const char motor, const char direction, const float spd = 0.0f)\n{\n\tss.str(\"\");\n\tss << \"sr\" << motor << direction;\n\tif(direction != MOTOR_STOP) {\n\t\tss << std::hex << (int8_t)(spd * 255);\n\t}\n\tss << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ check response\n\tchar line[2];\n\tconst int lineLength = readLine(line, 2);\n\tif(atoi(line) != 0) {\n\t\tROS_INFO(\"Command failed: %s\", output);\n\t}\n}\n\n\/*\n * Returns the speed in m\/s the given motor is moving the robot at.\n *\/\nfloat getSpeed(const char motor)\n{\n\t\/\/ Write command\n\tss.str(\"\");\n\t\/\/ \"get drive left\/right rate\"\n\tss << \"gd\" << motor << 'r' << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ ROS_INFO(\"%s\", ss.str().c_str());\n\n\t\/\/ Read response\n\t\/\/ Expected: max. 11 characters (-2,147,483,647) + \\n\n\tconst int LINE_LENGTH = 11;\n\tchar line[LINE_LENGTH] = {0};\n\tconst int lineLength = readLine(line, LINE_LENGTH);\n\n\t\/\/ We receive the interval in µs bewtween two motor monitor ticks\n\tconst int interval = atoi(line);\n\t\/\/ Compute motor revolution freq (Hz) from motor tick interval (µs)\n\t\/\/ Filter out division by zero and \"stop\" state\n\tconst double freq = (interval == 0 || interval == 1000000) ? 0 : 1000000 \/ interval;\n\t\/\/ if(motor == MOTOR_RIGHT)\n\t\t\/\/ ROS_INFO(\"interval %c: %i freq: %f\", motor, interval, freq);\n\t\/\/ Return the resulting robot speed for this motor (m\/s)\n\treturn freq * WHEEL_DIAMETER * M_PI \/ (3.0 * WHEEL_REDUCTION);\n}\n\nvoid velocityCallback(const geometry_msgs::Twist& msg) {\n\t\/\/ Store current motor speeds for later reference\n\tvLeftCur = getSpeed(MOTOR_LEFT);\n\tvRightCur = getSpeed(MOTOR_RIGHT);\n\n\t\/\/ Compute the motor speeds necessary to achieve the desired linear and angular motion\n\t\/\/ Adapted from:\n\t\/\/ https:\/\/code.google.com\/p\/differential-drive\/source\/browse\/nodes\/twist_to_motors.py\n\t\/\/ self.right = 1.0 * self.dx + self.dr * self.w \/ 2\n\t\/\/ self.left = 1.0 * self.dx - self.dr * self.w \/ 2\n\tdouble vLeft = msg.linear.x - msg.angular.z * WHEEL_DISTANCE \/ (2.0);\n\tdouble vRight = msg.linear.x + msg.angular.z * WHEEL_DISTANCE \/ (2.0);\n\tdouble vRotLeft = msg.angular.y;\n\tdouble vRotRight = msg.angular.y;\n\n\t\/\/ Only send new commands to the Arduino if the input actually changed\n\tif(vLeft == vLeftLast && vRight == vRightLast\n\t\t&& vRotLeft == vRotLeftLast && vRotRight == vRotRightLast) {\n\t\treturn;\n\t}\n\tvLeftLast = vLeft;\n\tvRightLast = vRight;\n\tvRotLeftLast = vRotLeft;\n\tvRotRightLast = vRotLeft;\n\n\t\/\/ ROS_INFO(\"tl: %f tr: %f z: %f\", vLeft, vRight, msg.angular.z);\n\t\/\/ Determine rotation directions\n\tchar dLeft = vLeft > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\tchar dRight = vRight > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\n\t\/\/ Map [-MAX_DRV_SPEED, MAX_DRV_SPEED] -> [0, 1] as we've extracted the directional component\n\tvLeft = vLeft < 0 ? vLeft * -1.0 : vLeft;\n\tvRight = vRight < 0 ? vRight * -1.0 : vRight;\n\tvLeft = min(1.0, max(0.0, vLeft \/ MAX_DRV_SPEED));\n\tvRight = min(1.0, max(0.0, vRight \/ MAX_DRV_SPEED));\n\t\/\/ Stop the motors when stopping\n\tif(vLeft < STOP_THRESHOLD) {\n\t\tdLeft = MOTOR_STOP;\n\t}\n\tif(vRight < STOP_THRESHOLD) {\n\t\tdRight = MOTOR_STOP;\n\t}\n\t\/\/ Apply!\n\tsetDrive(MOTOR_LEFT, dLeft, vLeft);\n\tsetDrive(MOTOR_RIGHT, dRight, vRight);\n\n\t\/\/ Wheel disc rotation\n\t\/\/ Extract direction\n\tchar dRotLeft = vRotLeft > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\tchar dRotRight = vRotRight > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\t\/\/ Map speeds to [0, 1]\n\tvRotLeft = vRotLeft < 0 ? vRotLeft * -1.0 : vRotLeft;\n\tvRotRight = vRotRight < 0 ? vRotRight * -1.0 : vRotRight;\n\tvRotLeft = min(1.0, max(0.0, vRotLeft \/ MAX_ROT_SPEED));\n\tvRotRight = min(1.0, max(0.0, vRotRight \/ MAX_ROT_SPEED));\n\tif(vRotLeft < STOP_THRESHOLD) {\n\t\tdRotLeft = MOTOR_STOP;\n\t}\n\tif(vRotRight < STOP_THRESHOLD) {\n\t\tdRotRight = MOTOR_STOP;\n\t}\n\tsetRotation(MOTOR_LEFT, dRotLeft, vRotLeft);\n\tsetRotation(MOTOR_RIGHT, dRotRight, vRotRight);\n}\n\nvoid publishOdometry(const ros::TimerEvent&) {\n\/\/ \t\/\/ Source: http:\/\/wiki.ros.org\/navigation\/Tutorials\/RobotSetup\/Odom\n\/\/ \t\/\/ Store odometry input values\n\tvx = (vLeftCur + vRightCur) \/ 2.0;\n\t\/\/ vtheta = (vRight - vLeft) \/ WHEEL_OFFSET;\n\n\t\/\/ Compute input values\n\tdouble dt = (currentTime - lastTime).toSec();\n\tlastTime = currentTime;\n\tcurrentTime = ros::Time::now();\n\tdouble dx = (vx * cos(theta) - vy * sin(theta)) * dt;\n\tdouble dy = (vx * sin(theta) - vy * cos(theta)) * dt;\n\tvtheta = (dx - dy) \/ WHEEL_DISTANCE;\n\tdouble dtheta = vtheta * dt;\n\tx += dx;\n\ty += dy;\n\ttheta += dtheta;\n\t\/\/ ROS_INFO(\"vl: %f vr: %f vx: %f vtheta: %f\", vLeftCur, vRightCur, vx, vtheta);\n\n\t\/\/ Transform frame\n\t\/\/since all odometry is 6DOF we'll need a quaternion created from yaw\n\tgeometry_msgs::Quaternion odomQuat = tf::createQuaternionMsgFromYaw(theta);\n\n\tgeometry_msgs::TransformStamped odomTrans;\n\todomTrans.header.stamp = currentTime;\n\todomTrans.header.frame_id = \"odom\";\n\todomTrans.child_frame_id = \"base_link\";\n\n\todomTrans.transform.translation.x = x;\n\todomTrans.transform.translation.y = y;\n\todomTrans.transform.translation.z = 0.0;\n\todomTrans.transform.rotation = odomQuat;\n\n\todomBroadcaster->sendTransform(odomTrans);\n\n\n\t\/\/ Odometry message\n\tnav_msgs::Odometry odom;\n\todom.header.stamp = currentTime;\n\todom.header.frame_id = \"odom\";\n\n\t\/\/set the position\n\todom.pose.pose.position.x = x;\n\todom.pose.pose.position.y = y;\n\todom.pose.pose.position.z = 0.0;\n\todom.pose.pose.orientation = odomQuat;\n\n\t\/\/set the velocity\n\todom.child_frame_id = \"base_link\";\n\todom.twist.twist.linear.x = vx;\n\todom.twist.twist.linear.y = vy;\n\todom.twist.twist.angular.z = vtheta;\n\n\todomPub.publish(odom);\n\n\t\/\/ Test TF\n\t\/\/ This circumvents problems that might be introduced because static_transform_publisher\n\t\/\/ seems to offset its transforms into the future.\n\t\/\/ <node pkg=\"tf\" type=\"static_transform_publisher\" name=\"base_link_to_laser\" args=\"0.1 0.1 0.15 0.0 0.0 0.0 \/base_link \/laser 50\" \/>\n\tgeometry_msgs::Quaternion laserQuat = tf::createQuaternionMsgFromYaw(0.0);\n\tgeometry_msgs::TransformStamped laserTrans;\n\tlaserTrans.header.stamp = ros::Time::now();\n\tlaserTrans.header.frame_id = \"base_link\";\n\tlaserTrans.child_frame_id = \"laser\";\n\tlaserTrans.transform.translation.x = 0.1;\n\tlaserTrans.transform.translation.y = 0.1;\n\tlaserTrans.transform.translation.z = 0.15;\n\tlaserTrans.transform.rotation = laserQuat;\n\todomBroadcaster->sendTransform(laserTrans);\n}\n\nint main(int argc, char **argv) {\n\tros::init(argc, argv, \"enginecontrol\");\n\tros::NodeHandle n;\n\tcurrentTime = ros::Time::now();\n\tlastTime = ros::Time::now();\n\tif(!initTty()) {\n\t\treturn 1;\n\t}\n\n\t\/\/ Just to make sure we're not going anywhere...\n\tsetDrive(MOTOR_LEFT, MOTOR_STOP);\n\tsetDrive(MOTOR_RIGHT, MOTOR_STOP);\n\tsetRotation(MOTOR_LEFT, MOTOR_STOP);\n\tsetRotation(MOTOR_RIGHT, MOTOR_STOP);\n\n\t\/\/ This is correct - we're borrowing the turtle's topics\n\tros::Subscriber sub = n.subscribe(\"cmd_vel\", 1, velocityCallback);\n\todomPub = n.advertise<nav_msgs::Odometry>(\"odom\", 50);\n\todomBroadcaster = boost::make_shared<tf::TransformBroadcaster>();\n\t\/\/ros::Timer odoTimer = n.createTimer(ros::Duration(1.0\/10.0\/*10 Hz*\/), publishOdometry);\n\tROS_INFO(\"enginecontrol up and running.\");\n\tros::spin();\n\tclose(tty);\n\treturn 0;\n}\n<commit_msg>enginecontrol: disabled odom publisher<commit_after>#include \"constants.hpp\"\n#include <string>\n#include <math.h>\n#include <ros\/ros.h>\n#include <geometry_msgs\/Twist.h>\n#include <nav_msgs\/Odometry.h>\n#include <tf\/transform_broadcaster.h>\n#include <boost\/shared_ptr.hpp>\n#include <fcntl.h>\n#include <termios.h>\n#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <sstream>\n#include <limits>\n\nusing namespace std;\n\n\/\/ A serial interface used to send commands to the Arduino that controls\n\/\/ the motor controllers. (Yeah, recursion!)\n\/\/ (C file descriptor)\nint tty;\nstd::stringstream ss;\n\n\/\/ for odometry\nros::Time currentTime;\nros::Time lastTime;\nros::Publisher odomPub;\nboost::shared_ptr<tf::TransformBroadcaster> odomBroadcaster;\ndouble x = 0;\ndouble y = 0;\ndouble theta = 0;\ndouble vx = 0;\ndouble vy = 0;\ndouble vtheta = 0;\n\/\/ Make current speeds always available (and query them only once per cycle)\ndouble vLeftCur = 0.0;\ndouble vRightCur = 0.0;\n\/\/ Cache speeds to only send data if they change\ndouble vLeftLast = 0.0;\ndouble vRightLast = 0.0;\ndouble vRotLeftLast = 0.0;\ndouble vRotRightLast = 0.0;\n\n\/\/ Used to form the Arduino commands\nconst char MOTOR_LEFT = 'l';\nconst char MOTOR_RIGHT = 'r';\nconst char MOTOR_FORWARD = 'f';\nconst char MOTOR_BACKWARD = 'b';\nconst char MOTOR_STOP = 's';\n\n\/\/ The motors are stopped (not just set to speed 0.0) below this input speed.\nconst float STOP_THRESHOLD = 0.01f;\n\nbool initTty()\n{\n\t\/\/ http:\/\/timmurphy.org\/2009\/08\/04\/baud-rate-and-other-serial-comm-settings-in-c\/\n\ttty = open(\"\/dev\/ttyACM0\", O_RDWR | O_NOCTTY\/* | O_NDELAY*\/);\n\tif(tty < 0) {\n\t\tperror(\"open(\\\"\/dev\/ttyACM0\\\")\");\n\t\treturn false;\n\t}\n\tstruct termios settings;\n\ttcgetattr(tty, &settings);\n\tcfsetospeed(&settings, B115200);\n\tcfsetispeed(&settings, B0 \/*same as output*\/);\n\tsettings.c_cflag &= ~PARENB;\t\/\/ no parity\n\tsettings.c_cflag &= ~CSTOPB;\t\/\/ one stop bit\n\tsettings.c_cflag &= ~CSIZE;\t\t\/\/ 8 bits per character\n\tsettings.c_cflag |= CS8;\n\tsettings.c_cflag &= ~CRTSCTS;\t\/\/ Disable hardware flow control\n\t\/\/ settings.c_cflag &= ~HUPCL;\t\t\/\/ Send modem disconnect when closing the fd\n\tsettings.c_cflag |= CREAD;\t\t\/\/ Enable receiver\n\t\/\/ settings.c_cflag |= CLOCAL;\t\t\/\/ Ignore modem status lines\n\tsettings.c_iflag &= ~(IXON | IXOFF | IXANY); \/\/ Disable start\/stop I\/O control\n\tsettings.c_lflag &= ~(ICANON | ECHO | ECHOE | ISIG); \/\/ Disable user terminal features\n\tsettings.c_oflag &= ~OPOST;\t\t\/\/ Disable output postprocessing\n\tsettings.c_cc[VMIN] = 0;\n\tsettings.c_cc[VTIME] = 0;\n\tif(tcsetattr(tty, TCSANOW, &settings) != 0) {\n\t\tperror(\"tcsetattr\");\n\t\treturn false;\n\t}\n\ttcflush(tty, TCOFLUSH);\n\treturn true;\n}\n\nint readLine(char* const line, const ssize_t LINE_LENGTH)\n{\n\tssize_t bytesRead = 0;\n\tbool lineComplete = false;\n\twhile(!lineComplete && bytesRead < LINE_LENGTH) {\n\t\t\/\/ Read bytes into temporary buffer\n\t\tchar buffer[LINE_LENGTH];\n\t\t\/\/ ROS_INFO(\"a\");\n\t\tssize_t newBytesRead = read(tty, buffer, LINE_LENGTH);\n\t\t\/\/ ROS_INFO(\"b\");\n\t\tif(newBytesRead < 0) {\n\t\t\tperror(\"read\");\n\t\t}\n\t\t\/\/ Copy new bytes to 'line'\n\t\tfor(ssize_t i = 0; i < newBytesRead && bytesRead < LINE_LENGTH; i++, bytesRead++) {\n\t\t\tline[bytesRead] = buffer[i];\n\t\t\tif(buffer[i] == '\\n') {\n\t\t\t\tlineComplete = true;\n\t\t\t}\n\t\t}\n\t}\n\treturn bytesRead;\n}\n\nvoid setDrive(const char motor, const char direction, const float spd = 0.0f)\n{\n\tss.str(\"\");\n\tss << \"sd\" << motor << direction;\n\tif(direction != MOTOR_STOP) {\n\t\tss << std::hex << (int8_t)(spd * 255);\n\t}\n\tss << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ ROS_INFO(\"%s\", output);\n\t\/\/ check response\n\tchar line[2];\n\tconst int lineLength = readLine(line, 2);\n\tif(atoi(line) != 0) {\n\t\tROS_INFO(\"Command failed: %s\", output);\n\t}\n}\n\nvoid setRotation(const char motor, const char direction, const float spd = 0.0f)\n{\n\tss.str(\"\");\n\tss << \"sr\" << motor << direction;\n\tif(direction != MOTOR_STOP) {\n\t\tss << std::hex << (int8_t)(spd * 255);\n\t}\n\tss << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ check response\n\tchar line[2];\n\tconst int lineLength = readLine(line, 2);\n\tif(atoi(line) != 0) {\n\t\tROS_INFO(\"Command failed: %s\", output);\n\t}\n}\n\n\/*\n * Returns the speed in m\/s the given motor is moving the robot at.\n *\/\nfloat getSpeed(const char motor)\n{\n\t\/\/ Write command\n\tss.str(\"\");\n\t\/\/ \"get drive left\/right rate\"\n\tss << \"gd\" << motor << 'r' << std::endl;\n\tconst char* output = ss.str().c_str();\n\twrite(tty, output, ss.str().length());\n\t\/\/ ROS_INFO(\"%s\", ss.str().c_str());\n\n\t\/\/ Read response\n\t\/\/ Expected: max. 11 characters (-2,147,483,647) + \\n\n\tconst int LINE_LENGTH = 11;\n\tchar line[LINE_LENGTH] = {0};\n\tconst int lineLength = readLine(line, LINE_LENGTH);\n\n\t\/\/ We receive the interval in µs bewtween two motor monitor ticks\n\tconst int interval = atoi(line);\n\t\/\/ Compute motor revolution freq (Hz) from motor tick interval (µs)\n\t\/\/ Filter out division by zero and \"stop\" state\n\tconst double freq = (interval == 0 || interval == 1000000) ? 0 : 1000000 \/ interval;\n\t\/\/ if(motor == MOTOR_RIGHT)\n\t\t\/\/ ROS_INFO(\"interval %c: %i freq: %f\", motor, interval, freq);\n\t\/\/ Return the resulting robot speed for this motor (m\/s)\n\treturn freq * WHEEL_DIAMETER * M_PI \/ (3.0 * WHEEL_REDUCTION);\n}\n\nvoid velocityCallback(const geometry_msgs::Twist& msg) {\n\t\/\/ Store current motor speeds for later reference\n\tvLeftCur = getSpeed(MOTOR_LEFT);\n\tvRightCur = getSpeed(MOTOR_RIGHT);\n\n\t\/\/ Compute the motor speeds necessary to achieve the desired linear and angular motion\n\t\/\/ Adapted from:\n\t\/\/ https:\/\/code.google.com\/p\/differential-drive\/source\/browse\/nodes\/twist_to_motors.py\n\t\/\/ self.right = 1.0 * self.dx + self.dr * self.w \/ 2\n\t\/\/ self.left = 1.0 * self.dx - self.dr * self.w \/ 2\n\tdouble vLeft = msg.linear.x - msg.angular.z * WHEEL_DISTANCE \/ (2.0);\n\tdouble vRight = msg.linear.x + msg.angular.z * WHEEL_DISTANCE \/ (2.0);\n\tdouble vRotLeft = msg.angular.y;\n\tdouble vRotRight = msg.angular.y;\n\n\t\/\/ Only send new commands to the Arduino if the input actually changed\n\tif(vLeft == vLeftLast && vRight == vRightLast\n\t\t&& vRotLeft == vRotLeftLast && vRotRight == vRotRightLast) {\n\t\treturn;\n\t}\n\tvLeftLast = vLeft;\n\tvRightLast = vRight;\n\tvRotLeftLast = vRotLeft;\n\tvRotRightLast = vRotLeft;\n\n\t\/\/ ROS_INFO(\"tl: %f tr: %f z: %f\", vLeft, vRight, msg.angular.z);\n\t\/\/ Determine rotation directions\n\tchar dLeft = vLeft > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\tchar dRight = vRight > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\n\t\/\/ Map [-MAX_DRV_SPEED, MAX_DRV_SPEED] -> [0, 1] as we've extracted the directional component\n\tvLeft = vLeft < 0 ? vLeft * -1.0 : vLeft;\n\tvRight = vRight < 0 ? vRight * -1.0 : vRight;\n\tvLeft = min(1.0, max(0.0, vLeft \/ MAX_DRV_SPEED));\n\tvRight = min(1.0, max(0.0, vRight \/ MAX_DRV_SPEED));\n\t\/\/ Stop the motors when stopping\n\tif(vLeft < STOP_THRESHOLD) {\n\t\tdLeft = MOTOR_STOP;\n\t}\n\tif(vRight < STOP_THRESHOLD) {\n\t\tdRight = MOTOR_STOP;\n\t}\n\t\/\/ Apply!\n\tsetDrive(MOTOR_LEFT, dLeft, vLeft);\n\tsetDrive(MOTOR_RIGHT, dRight, vRight);\n\n\t\/\/ Wheel disc rotation\n\t\/\/ Extract direction\n\tchar dRotLeft = vRotLeft > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\tchar dRotRight = vRotRight > 0 ? MOTOR_FORWARD : MOTOR_BACKWARD;\n\t\/\/ Map speeds to [0, 1]\n\tvRotLeft = vRotLeft < 0 ? vRotLeft * -1.0 : vRotLeft;\n\tvRotRight = vRotRight < 0 ? vRotRight * -1.0 : vRotRight;\n\tvRotLeft = min(1.0, max(0.0, vRotLeft \/ MAX_ROT_SPEED));\n\tvRotRight = min(1.0, max(0.0, vRotRight \/ MAX_ROT_SPEED));\n\tif(vRotLeft < STOP_THRESHOLD) {\n\t\tdRotLeft = MOTOR_STOP;\n\t}\n\tif(vRotRight < STOP_THRESHOLD) {\n\t\tdRotRight = MOTOR_STOP;\n\t}\n\tsetRotation(MOTOR_LEFT, dRotLeft, vRotLeft);\n\tsetRotation(MOTOR_RIGHT, dRotRight, vRotRight);\n}\n\nvoid publishOdometry(const ros::TimerEvent&) {\n\/\/ \t\/\/ Source: http:\/\/wiki.ros.org\/navigation\/Tutorials\/RobotSetup\/Odom\n\/\/ \t\/\/ Store odometry input values\n\tvx = (vLeftCur + vRightCur) \/ 2.0;\n\t\/\/ vtheta = (vRight - vLeft) \/ WHEEL_OFFSET;\n\n\t\/\/ Compute input values\n\tdouble dt = (currentTime - lastTime).toSec();\n\tlastTime = currentTime;\n\tcurrentTime = ros::Time::now();\n\tdouble dx = (vx * cos(theta) - vy * sin(theta)) * dt;\n\tdouble dy = (vx * sin(theta) - vy * cos(theta)) * dt;\n\tvtheta = (dx - dy) \/ WHEEL_DISTANCE;\n\tdouble dtheta = vtheta * dt;\n\tx += dx;\n\ty += dy;\n\ttheta += dtheta;\n\t\/\/ ROS_INFO(\"vl: %f vr: %f vx: %f vtheta: %f\", vLeftCur, vRightCur, vx, vtheta);\n\n\t\/\/ Transform frame\n\t\/\/since all odometry is 6DOF we'll need a quaternion created from yaw\n\tgeometry_msgs::Quaternion odomQuat = tf::createQuaternionMsgFromYaw(theta);\n\n\tgeometry_msgs::TransformStamped odomTrans;\n\todomTrans.header.stamp = currentTime;\n\todomTrans.header.frame_id = \"odom\";\n\todomTrans.child_frame_id = \"base_link\";\n\n\todomTrans.transform.translation.x = x;\n\todomTrans.transform.translation.y = y;\n\todomTrans.transform.translation.z = 0.0;\n\todomTrans.transform.rotation = odomQuat;\n\n\todomBroadcaster->sendTransform(odomTrans);\n\n\n\t\/\/ Odometry message\n\tnav_msgs::Odometry odom;\n\todom.header.stamp = currentTime;\n\todom.header.frame_id = \"odom\";\n\n\t\/\/set the position\n\todom.pose.pose.position.x = x;\n\todom.pose.pose.position.y = y;\n\todom.pose.pose.position.z = 0.0;\n\todom.pose.pose.orientation = odomQuat;\n\n\t\/\/set the velocity\n\todom.child_frame_id = \"base_link\";\n\todom.twist.twist.linear.x = vx;\n\todom.twist.twist.linear.y = vy;\n\todom.twist.twist.angular.z = vtheta;\n\n\todomPub.publish(odom);\n\n\t\/\/ Test TF\n\t\/\/ This circumvents problems that might be introduced because static_transform_publisher\n\t\/\/ seems to offset its transforms into the future.\n\t\/\/ <node pkg=\"tf\" type=\"static_transform_publisher\" name=\"base_link_to_laser\" args=\"0.1 0.1 0.15 0.0 0.0 0.0 \/base_link \/laser 50\" \/>\n\tgeometry_msgs::Quaternion laserQuat = tf::createQuaternionMsgFromYaw(0.0);\n\tgeometry_msgs::TransformStamped laserTrans;\n\tlaserTrans.header.stamp = ros::Time::now();\n\tlaserTrans.header.frame_id = \"base_link\";\n\tlaserTrans.child_frame_id = \"laser\";\n\tlaserTrans.transform.translation.x = 0.1;\n\tlaserTrans.transform.translation.y = 0.1;\n\tlaserTrans.transform.translation.z = 0.15;\n\tlaserTrans.transform.rotation = laserQuat;\n\todomBroadcaster->sendTransform(laserTrans);\n}\n\nint main(int argc, char **argv) {\n\tros::init(argc, argv, \"enginecontrol\");\n\tros::NodeHandle n;\n\tcurrentTime = ros::Time::now();\n\tlastTime = ros::Time::now();\n\tif(!initTty()) {\n\t\treturn 1;\n\t}\n\n\t\/\/ Just to make sure we're not going anywhere...\n\tsetDrive(MOTOR_LEFT, MOTOR_STOP);\n\tsetDrive(MOTOR_RIGHT, MOTOR_STOP);\n\tsetRotation(MOTOR_LEFT, MOTOR_STOP);\n\tsetRotation(MOTOR_RIGHT, MOTOR_STOP);\n\n\t\/\/ This is correct - we're borrowing the turtle's topics\n\tros::Subscriber sub = n.subscribe(\"cmd_vel\", 1, velocityCallback);\n\t\/\/odomPub = n.advertise<nav_msgs::Odometry>(\"odom\", 50);\n\t\/\/odomBroadcaster = boost::make_shared<tf::TransformBroadcaster>();\n\t\/\/ros::Timer odoTimer = n.createTimer(ros::Duration(1.0\/10.0\/*10 Hz*\/), publishOdometry);\n\tROS_INFO(\"enginecontrol up and running.\");\n\tros::spin();\n\tclose(tty);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <fstream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <DOMSupport\/DOMSupportDefault.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPath.hpp>\n#include <XPath\/XPathSupportDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XercesParserLiaison\/XercesParserLiaison.hpp>\n\n\n\n#include <XercesPlatformSupport\/TextFileOutputStream.hpp>\n#include <XercesPlatformSupport\/XercesDOMPrintWriter.hpp>\n\n\n\n\/\/ This class defines a function that will return the square root\n\/\/ of its argument.\nclass FunctionSquareRoot : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\topPos,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 1)\n\t\t{\n\t\t\texecutionContext.error(\"The square-root() function takes one argument!\", context);\n\t\t}\n\n\t\tassert(args[0] != 0);\n\n\t\treturn executionContext.getXObjectFactory().createNumber(sqrt(args[0]->num()));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionSquareRoot*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionSquareRoot(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionSquareRoot&\n\toperator=(const FunctionSquareRoot&);\n\n\tbool\n\toperator==(const FunctionSquareRoot&) const;\n};\n\n\n\n\/\/ This class defines a function that will return the cube\n\/\/ of its argument.\nclass FunctionCube : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\topPos,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 1)\n\t\t{\n\t\t\texecutionContext.error(\"The cube() function takes one argument!\", context);\n\t\t}\n\n\t\tassert(args[0] != 0);\n\n\t\treturn executionContext.getXObjectFactory().createNumber(pow(args[0]->num(), 3));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionCube*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionCube(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionCube&\n\toperator=(const FunctionCube&);\n\n\tbool\n\toperator==(const FunctionCube&) const;\n};\n\n\n\n\/\/ This class defines a function that runs the C function\n\/\/ asctime() using the current system time.\nclass FunctionAsctime : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\topPos,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 0)\n\t\t{\n\t\t\texecutionContext.error(\"The asctime() function takes no arguments!\", context);\n\t\t}\n\n\t\ttime_t\ttheTime;\n\n\t\ttime(&theTime);\n\n\t\tchar* const\ttheTimeString = asctime(localtime(&theTime));\n\n\t\t\/\/ The resulting string has a newline character at the end,\n\t\t\/\/ so get rid of it.\n\t\ttheTimeString[strlen(theTimeString) - 1] = '\\0';\n\n\t\treturn executionContext.getXObjectFactory().createString(XalanDOMString(theTimeString));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionAsctime*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionAsctime(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionAsctime&\n\toperator=(const FunctionAsctime&);\n\n\tbool\n\toperator==(const FunctionAsctime&) const;\n};\n\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\t\/* argv *\/[])\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::endl;\n\tusing std::ofstream;\n#endif\n\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: ExternalFunction\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\t\t\tXSLTEngineImpl::Initialize();\n\n\t\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\t\tDOMSupportDefault\t\t\t\ttheDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\ttheParserLiaison(theDOMSupport);\n\t\t\tXPathSupportDefault\t\t\t\ttheXPathSupport(theDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory(theXSLTProcessorEnvSupport, theXPathSupport);\n\t\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\t\/\/ Create a processor...\n\t\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\ttheXPathFactory);\n\n\t\t\t\/\/ Connect the processor to the support object...\n\t\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\t\/\/ Create a stylesheet construction context, and a stylesheet\n\t\t\t\/\/ execution context...\n\t\t\tStylesheetConstructionContextDefault\ttheConstructionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\tStylesheetExecutionContextDefault\t\ttheExecutionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\t\/\/ Our input files...\n\t\t\t\/\/ WARNING!!! You may need to modify these absolute paths depending on where\n\t\t\t\/\/ you've put the Xalan sources.\n\t\t\tconst XalanDOMString\t\ttheXMLFileName(\"foo.xml\");\n\t\t\tconst XalanDOMString\t\ttheXSLFileName(\"foo.xsl\");\n\n\t\t\t\/\/ Our input sources...\n\t\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLFileName));\n\t\t\tXSLTInputSource\t\ttheStylesheetSource(c_wstr(theXSLFileName));\n\n\t\t\t\/\/ Our output target...\n\t\t\tTextFileOutputStream\ttheOutputStream(\"foo.out\");\n\t\t\tXercesDOMPrintWriter\ttheResultWriter(theOutputStream);\n\t\t\tXSLTResultTarget\t\ttheResultTarget(&theResultWriter);\n\n\t\t\t\/\/ Install the function directly into the XPath\n\t\t\t\/\/ function table. We don't recommend doing this,\n\t\t\t\/\/ but you can if you want to be evil! ;-) Since\n\t\t\t\/\/ the function is in the XPath table, the XPath\n\t\t\t\/\/ parser will treat it like any other XPath\n\t\t\t\/\/ function. Therefore, it cannot have a namespace\n\t\t\t\/\/ prefix. It will also be available to every\n\t\t\t\/\/ processor in the executable's process, since there\n\t\t\t\/\/ is one static XPath function table.\n\t\t\tXPath::installFunction(\n\t\t\t\t\"asctime\",\n\t\t\t\tFunctionAsctime());\n\n\t\t\t\/\/ The namespace for our functions...\n\t\t\tconst XalanDOMString\ttheNamespace(\"http:\/\/ExternalFunction.xalan-c++.xml.apache.org\");\n\n\t\t\t\/\/ Install the function in the global space. All\n\t\t\t\/\/ instances will know about the function, so all\n\t\t\t\/\/ processors which use an instance of this the\n\t\t\t\/\/ class XPathEnvSupportDefault will be able to\n\t\t\t\/\/ use the function.\n\t\t\tXSLTProcessorEnvSupportDefault::installExternalFunctionGlobal(\n\t\t\t\ttheNamespace,\n\t\t\t\t\"square-root\",\n\t\t\t\tFunctionSquareRoot());\n\n\t\t\t\/\/ Install the function in the local space. It will only\n\t\t\t\/\/ be installed in this instance, so no other instances\n\t\t\t\/\/ will know about the function...\n\t\t\ttheXSLTProcessorEnvSupport.installExternalFunctionLocal(\n\t\t\t\ttheNamespace,\n\t\t\t\t\"cube\",\n\t\t\t\tFunctionCube());\n\n\t\t\ttheProcessor.process(\n\t\t\t\t\t\ttheInputSource,\n\t\t\t\t\t\ttheStylesheetSource,\n\t\t\t\t\t\ttheResultTarget,\n\t\t\t\t\t\ttheConstructionContext,\n\t\t\t\t\t\ttheExecutionContext);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Commented out unused formal parameters.<commit_after>#include <cmath>\n#include <ctime>\n#include <iostream>\n#include <fstream>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n\n\n\n#include <DOMSupport\/DOMSupportDefault.hpp>\n\n\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPath.hpp>\n#include <XPath\/XPathSupportDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XercesParserLiaison\/XercesParserLiaison.hpp>\n\n\n\n#include <XercesPlatformSupport\/TextFileOutputStream.hpp>\n#include <XercesPlatformSupport\/XercesDOMPrintWriter.hpp>\n\n\n\n\/\/ This class defines a function that will return the square root\n\/\/ of its argument.\nclass FunctionSquareRoot : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\t\/* opPos *\/,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 1)\n\t\t{\n\t\t\texecutionContext.error(\"The square-root() function takes one argument!\", context);\n\t\t}\n\n\t\tassert(args[0] != 0);\n\n\t\treturn executionContext.getXObjectFactory().createNumber(sqrt(args[0]->num()));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionSquareRoot*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionSquareRoot(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionSquareRoot&\n\toperator=(const FunctionSquareRoot&);\n\n\tbool\n\toperator==(const FunctionSquareRoot&) const;\n};\n\n\n\n\/\/ This class defines a function that will return the cube\n\/\/ of its argument.\nclass FunctionCube : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\t\/* opPos *\/,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 1)\n\t\t{\n\t\t\texecutionContext.error(\"The cube() function takes one argument!\", context);\n\t\t}\n\n\t\tassert(args[0] != 0);\n\n\t\treturn executionContext.getXObjectFactory().createNumber(pow(args[0]->num(), 3));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionCube*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionCube(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionCube&\n\toperator=(const FunctionCube&);\n\n\tbool\n\toperator==(const FunctionCube&) const;\n};\n\n\n\n\/\/ This class defines a function that runs the C function\n\/\/ asctime() using the current system time.\nclass FunctionAsctime : public Function\n{\npublic:\n\n\t\/**\n\t * Execute an XPath function object. The function must return a valid\n\t * object.\n\t *\n\t * @param executionContext executing context\n\t * @param context current context node\n\t * @param opPos current op position\n\t * @param args vector of pointers to XObject arguments\n\t * @return pointer to the result XObject\n\t *\/\n\tvirtual XObject*\n\texecute(\n\t\t\tXPathExecutionContext&\t\t\texecutionContext,\n\t\t\tXalanNode*\t\t\t\t\t\tcontext,\n\t\t\tint\t\t\t\t\t\t\t\t\/* opPos *\/,\n\t\t\tconst XObjectArgVectorType&\t\targs)\n\t{\n\t\tif (args.size() != 0)\n\t\t{\n\t\t\texecutionContext.error(\"The asctime() function takes no arguments!\", context);\n\t\t}\n\n\t\ttime_t\ttheTime;\n\n\t\ttime(&theTime);\n\n\t\tchar* const\ttheTimeString = asctime(localtime(&theTime));\n\n\t\t\/\/ The resulting string has a newline character at the end,\n\t\t\/\/ so get rid of it.\n\t\ttheTimeString[strlen(theTimeString) - 1] = '\\0';\n\n\t\treturn executionContext.getXObjectFactory().createString(XalanDOMString(theTimeString));\n\t}\n\n\t\/**\n\t * Create a copy of the function object.\n\t *\n\t * @return pointer to the new object\n\t *\/\n#if defined(XALAN_NO_COVARIANT_RETURN_TYPE)\n\tvirtual Function*\n#else\n\tvirtual FunctionAsctime*\n#endif\n\tclone() const\n\t{\n\t\treturn new FunctionAsctime(*this);\n\t}\n\nprivate:\n\n\t\/\/ Not implemented...\n\tFunctionAsctime&\n\toperator=(const FunctionAsctime&);\n\n\tbool\n\toperator==(const FunctionAsctime&) const;\n};\n\n\n\nint\nmain(\n\t\t\tint\t\t\t\targc,\n\t\t\tconst char*\t\t\/* argv *\/[])\n{\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::endl;\n\tusing std::ofstream;\n#endif\n\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: ExternalFunction\"\n\t\t\t << endl\n\t\t\t << endl;\n\t}\n\telse\n\t{\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\t\t\tXSLTEngineImpl::Initialize();\n\n\t\t\t\/\/ Create the support objects that are necessary for running the processor...\n\t\t\tDOMSupportDefault\t\t\t\ttheDOMSupport;\n\t\t\tXercesParserLiaison\t\t\t\ttheParserLiaison(theDOMSupport);\n\t\t\tXPathSupportDefault\t\t\t\ttheXPathSupport(theDOMSupport);\n\t\t\tXSLTProcessorEnvSupportDefault\ttheXSLTProcessorEnvSupport;\n\t\t\tXObjectFactoryDefault\t\t\ttheXObjectFactory(theXSLTProcessorEnvSupport, theXPathSupport);\n\t\t\tXPathFactoryDefault\t\t\t\ttheXPathFactory;\n\n\t\t\t\/\/ Create a processor...\n\t\t\tXSLTEngineImpl\ttheProcessor(\n\t\t\t\t\ttheParserLiaison,\n\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\ttheXPathFactory);\n\n\t\t\t\/\/ Connect the processor to the support object...\n\t\t\ttheXSLTProcessorEnvSupport.setProcessor(&theProcessor);\n\n\t\t\t\/\/ Create a stylesheet construction context, and a stylesheet\n\t\t\t\/\/ execution context...\n\t\t\tStylesheetConstructionContextDefault\ttheConstructionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXObjectFactory,\n\t\t\t\t\t\ttheXPathFactory);\n\n\t\t\tStylesheetExecutionContextDefault\t\ttheExecutionContext(\n\t\t\t\t\t\ttheProcessor,\n\t\t\t\t\t\ttheXSLTProcessorEnvSupport,\n\t\t\t\t\t\ttheXPathSupport,\n\t\t\t\t\t\ttheXObjectFactory);\n\n\t\t\t\/\/ Our input files...\n\t\t\t\/\/ WARNING!!! You may need to modify these absolute paths depending on where\n\t\t\t\/\/ you've put the Xalan sources.\n\t\t\tconst XalanDOMString\t\ttheXMLFileName(\"foo.xml\");\n\t\t\tconst XalanDOMString\t\ttheXSLFileName(\"foo.xsl\");\n\n\t\t\t\/\/ Our input sources...\n\t\t\tXSLTInputSource\t\ttheInputSource(c_wstr(theXMLFileName));\n\t\t\tXSLTInputSource\t\ttheStylesheetSource(c_wstr(theXSLFileName));\n\n\t\t\t\/\/ Our output target...\n\t\t\tTextFileOutputStream\ttheOutputStream(\"foo.out\");\n\t\t\tXercesDOMPrintWriter\ttheResultWriter(theOutputStream);\n\t\t\tXSLTResultTarget\t\ttheResultTarget(&theResultWriter);\n\n\t\t\t\/\/ Install the function directly into the XPath\n\t\t\t\/\/ function table. We don't recommend doing this,\n\t\t\t\/\/ but you can if you want to be evil! ;-) Since\n\t\t\t\/\/ the function is in the XPath table, the XPath\n\t\t\t\/\/ parser will treat it like any other XPath\n\t\t\t\/\/ function. Therefore, it cannot have a namespace\n\t\t\t\/\/ prefix. It will also be available to every\n\t\t\t\/\/ processor in the executable's process, since there\n\t\t\t\/\/ is one static XPath function table.\n\t\t\tXPath::installFunction(\n\t\t\t\t\"asctime\",\n\t\t\t\tFunctionAsctime());\n\n\t\t\t\/\/ The namespace for our functions...\n\t\t\tconst XalanDOMString\ttheNamespace(\"http:\/\/ExternalFunction.xalan-c++.xml.apache.org\");\n\n\t\t\t\/\/ Install the function in the global space. All\n\t\t\t\/\/ instances will know about the function, so all\n\t\t\t\/\/ processors which use an instance of this the\n\t\t\t\/\/ class XPathEnvSupportDefault will be able to\n\t\t\t\/\/ use the function.\n\t\t\tXSLTProcessorEnvSupportDefault::installExternalFunctionGlobal(\n\t\t\t\ttheNamespace,\n\t\t\t\t\"square-root\",\n\t\t\t\tFunctionSquareRoot());\n\n\t\t\t\/\/ Install the function in the local space. It will only\n\t\t\t\/\/ be installed in this instance, so no other instances\n\t\t\t\/\/ will know about the function...\n\t\t\ttheXSLTProcessorEnvSupport.installExternalFunctionLocal(\n\t\t\t\ttheNamespace,\n\t\t\t\t\"cube\",\n\t\t\t\tFunctionCube());\n\n\t\t\ttheProcessor.process(\n\t\t\t\t\t\ttheInputSource,\n\t\t\t\t\t\ttheStylesheetSource,\n\t\t\t\t\t\ttheResultTarget,\n\t\t\t\t\t\ttheConstructionContext,\n\t\t\t\t\t\ttheExecutionContext);\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\"\n\t\t\t\t << endl\n\t\t\t\t << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <jni.h>\n#include <string>\n#include <vector>\n\n#include \"AudioEngine.h\"\n\nAudioEngine *engine;\n\nstd::vector<int> convertJavaArrayToVector(JNIEnv *env, jintArray intArray){\n\n std::vector<int> v;\n jsize length = env->GetArrayLength(intArray);\n\n if (length > 0) {\n jboolean isCopy;\n jint *elements = env->GetIntArrayElements(intArray, &isCopy);\n for (int i = 0; i < length; i++) {\n v.push_back(elements[i]);\n }\n }\n return v;\n}\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_startEngine(JNIEnv *env, jobject instance,\n jintArray jCpuIds) {\n engine = new AudioEngine;\n std::vector<int> cpuIds = convertJavaArrayToVector(env, jCpuIds);\n engine->start(cpuIds);\n}\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_stopEngine(JNIEnv *env, jobject instance) {\n\n engine->stop();\n delete engine;\n}\n\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_tap(JNIEnv *env, jobject instance, jboolean b) {\n\n engine->tap(b);\n}<commit_msg>Changing engine to be a unique_ptr<commit_after>\/*\n * Copyright 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <jni.h>\n#include <string>\n#include <vector>\n\n#include \"AudioEngine.h\"\n\nstd::unique_ptr<AudioEngine> engine;\n\nstd::vector<int> convertJavaArrayToVector(JNIEnv *env, jintArray intArray){\n\n std::vector<int> v;\n jsize length = env->GetArrayLength(intArray);\n\n if (length > 0) {\n jboolean isCopy;\n jint *elements = env->GetIntArrayElements(intArray, &isCopy);\n for (int i = 0; i < length; i++) {\n v.push_back(elements[i]);\n }\n }\n return v;\n}\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_startEngine(JNIEnv *env, jobject instance,\n jintArray jCpuIds) {\n engine = std::make_unique<AudioEngine>();\n std::vector<int> cpuIds = convertJavaArrayToVector(env, jCpuIds);\n engine->start(cpuIds);\n}\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_stopEngine(JNIEnv *env, jobject instance) {\n\n engine->stop();\n}\n\n\nextern \"C\"\nJNIEXPORT void JNICALL\nJava_com_example_oboe_megadrone_MainActivity_tap(JNIEnv *env, jobject instance, jboolean b) {\n\n engine->tap(b);\n}<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE compile_function\n#include <boost\/test\/unit_test.hpp>\n\n#include \"..\/src\/compile_function.hpp\"\n#include \"..\/src\/core_unique_ids.hpp\"\n#include \"..\/src\/error\/compile_exception.hpp\"\n\n#include \"state_utils.hpp\"\n#include \"function_building.hpp\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/DerivedTypes.h>\n#include <llvm\/IR\/Value.h>\n\n#include <unordered_map>\n#include <utility>\n#include <iterator>\n#include <string>\n#include <csetjmp>\n\nusing std::pair;\nusing std::unique_ptr;\nusing std::unordered_map;\nusing std::advance;\nusing std::string;\n\nusing llvm::Function;\nusing llvm::Value;\nusing llvm::IntegerType;\nusing llvm::Type;\nusing llvm::verifyFunction;\nusing llvm::raw_string_ostream;\n\nusing boost::get;\n\nusing namespace symbol_shortcuts;\n\n\nBOOST_AUTO_TEST_CASE(compile_signature_test)\n{\n const any_symbol params1 = list\n {\n list{a, int64_type},\n list{b, int64_type},\n list{c, int64_type},\n };\n const any_symbol return_type1 = int64_type;\n \n unique_ptr<Function> function1;\n unordered_map<identifier_id_t, named_value_info> parameter_table1;\n tie(function1, parameter_table1) = compile_signature(params1, return_type1, context);\n \n BOOST_CHECK(function1 != nullptr);\n BOOST_CHECK_EQUAL(parameter_table1.size(), 3);\n BOOST_CHECK(parameter_table1.count(a.identifier()));\n BOOST_CHECK(parameter_table1.count(b.identifier()));\n BOOST_CHECK(parameter_table1.count(c.identifier()));\n BOOST_CHECK(parameter_table1.at(b.identifier()).llvm_value == (++function1->arg_begin()));\n \n const any_symbol params2 = list\n {\n list{a, int64_type},\n list{b, int64_type},\n list{a, int64_type}, \/\/ duplicate parameter name\n };\n const any_symbol return_type2 = int64_type;\n \n BOOST_CHECK_THROW(compile_signature(params2, return_type2, context), compile_exception);\n}\n\nBOOST_AUTO_TEST_CASE(compile_instruction_test)\n{\n Type* llvm_int64 = IntegerType::get(context.llvm(), 64);\n \n const id_symbol add_constructor{unique_ids::ADD};\n const list_symbol instruction1{add_constructor, int64_type}; \n const instruction_info got1 = parse_instruction(instruction1, context.llvm());\n BOOST_CHECK(get<instruction_info::add>(got1.kind).type.llvm_type == llvm_int64);\n \n const id_symbol div_constructor{unique_ids::DIV};\n const list_symbol instruction2{div_constructor, int64_type}; \n const instruction_info got2 = parse_instruction(instruction2, context.llvm());\n BOOST_CHECK(get<instruction_info::div>(got2.kind).type.llvm_type == llvm_int64);\n\n const id_symbol cmp_constructor{unique_ids::CMP};\n const ref_symbol cmp_ref{\"asdfasdf\"_id, &cmp_constructor};\n const id_symbol lt{unique_ids::LT};\n const list_symbol instruction3{cmp_ref, lt, int64_type};\n const instruction_info got3 = parse_instruction(instruction3, context.llvm());\n BOOST_CHECK(get<instruction_info::cmp>(got3.kind).cmp_kind == unique_ids::LT);\n BOOST_CHECK(get<instruction_info::cmp>(got3.kind).type.llvm_type == llvm_int64);\n}\n\nBOOST_AUTO_TEST_CASE(store_load_test)\n{\n const list_symbol params =\n {\n list{a, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{let, x, alloc_int64},\n list{store_int64, a, x},\n list{let, y, load_int64, x},\n list{return_int64, y}\n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n\n auto function_ptr = get_compiled_function<uint64_t (uint64_t)>(function_source);\n BOOST_CHECK(function_ptr(2) == 2);\n BOOST_CHECK(function_ptr(1231) == 1231);\n}\n\nBOOST_AUTO_TEST_CASE(branch_test)\n{\n const list_symbol params =\n {\n list{a, int64_type},\n list{b, int64_type},\n };\n \n const symbol& return_type = int64_type;\n \n const list_symbol body =\n {\n list{block1, list\n {\n list{let, x, cmp_eq_int64, a, b},\n list{cond_branch, x, block2, block3}\n }},\n list{block2, list\n {\n list{let, y, add_int64, a, b},\n list{return_int64, y}\n }},\n list{block3, list\n {\n list{let, z, sub_int64, a, b},\n list{return_int64, z}\n }}\n };\n const list_symbol func_source =\n {\n params,\n return_type,\n body\n };\n \n auto compiled_function = get_compiled_function<uint64_t (uint64_t, uint64_t)>(func_source);\n BOOST_CHECK(compiled_function);\n BOOST_CHECK_EQUAL(compiled_function(2, 2), 2 + 2);\n BOOST_CHECK_EQUAL(compiled_function(5, 3), 5 - 3);\n}\n\nBOOST_AUTO_TEST_CASE(phi_test)\n{\n const list_symbol params =\n {\n list{a, int64_type},\n list{b, int64_type},\n };\n \n const symbol& return_type = int64_type;\n\n const list_symbol block1_def = {block1, list\n {\n list{let, x, cmp_eq_int64, a, b},\n list{cond_branch, x, block2, block3}\n }};\n const list_symbol block2_def = list{block2, list\n {\n list{let, y, add_int64, a, b},\n list{branch, block4}\n }};\n const list_symbol block3_def = {block3, list\n {\n list{let, z, sub_int64, a, b},\n list{branch, block4}\n }};\n const list_symbol block4_def = {block4, list\n {\n list{let, w, phi_int64, list{y, block2}, list{z, block3}},\n list{return_int64, w}\n }};\n\n const list_symbol func1_source =\n {\n params,\n return_type,\n list\n {\n block1_def,\n block2_def,\n block3_def,\n block4_def\n }\n };\n \n auto compiled_function1 = get_compiled_function<uint64_t (uint64_t, uint64_t)>(func1_source);\n BOOST_CHECK(compiled_function1);\n BOOST_CHECK_EQUAL(compiled_function1(2, 2), 2 + 2);\n BOOST_CHECK_EQUAL(compiled_function1(5, 3), 5 - 3);\n\n\n const list_symbol block4_invalid_def = {block4, list\n {\n list{let, w, phi_int64, list{z, block3}}, \/\/ missing incoming for block2\n list{return_int64, w}\n }};\n\n const list_symbol func2_source =\n {\n params,\n return_type,\n list\n {\n block1_def,\n block2_def,\n block3_def,\n block4_invalid_def\n }\n };\n BOOST_CHECK_THROW(compile_function(func2_source.begin(), func2_source.end(), context), compile_exception);\n \n}\n\n\nBOOST_AUTO_TEST_CASE(a_times_b_test)\n{\n const ref result_loc{\"result_loc\"_id};\n const ref i_loc{\"i_loc\"_id};\n const ref init_cmp{\"init_cmp\"_id};\n const ref current_sum{\"current_sum\"_id};\n const ref next_sum{\"next_sum\"_id};\n const ref current_i{\"current_i\"_id};\n const ref next_i{\"next_i\"_id};\n const ref loop_cmp{\"loop_cmp\"_id};\n const ref result{\"result\"_id};\n\n const list params =\n {\n list{a, int64_type},\n list{b, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{let, result_loc, alloc_int64},\n list{store_int64, lit{\"0\"}, result_loc}, \/\/ v speichert die Zwischenergebnisse und schließlich das Endergebnis der Add.\n list{let, i_loc, alloc_int64},\n list{store_int64, lit{\"0\"}, i_loc}, \/\/ w ist ein Zähler, der zählt, wie oft die erste Eingabe addiert werden muss\n list{let, init_cmp, cmp_ne_int64, b, lit{\"0\"}}, \/\/ x = 1, falls b != 0, sonst: x = 0\n list{cond_branch, init_cmp, block2, block3}\n \t\n }},\n list{block2, list\n {\n\t\t list{let, current_sum, load_int64, result_loc}, \/\/ y = die aktuelle Summe\n\t\t list{let, next_sum, add_int64, current_sum, a}, \/\/z ist die neue Summe, nach Addition mit a \n\t\t list{store_int64, next_sum, result_loc},\n\t\t list{let, current_i, load_int64, i_loc}, \/\/ der Zähler wird aus dem letzten Block geladen, current_i genannt\n\t\t list{let, next_i, add_int64, current_i, lit{\"1\"}},\n\t\t list{store_int64, next_i, i_loc},\n\t\t list{let, loop_cmp, cmp_ne_int64, b, next_i},\n\t\t list{cond_branch, loop_cmp, block2, block3}\n }},\n list{block3, list\n {\n list{let, result, load_int64, result_loc},\n list{return_int64, result} \n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n\n auto function_ptr = get_compiled_function<uint64_t (uint64_t, uint64_t)>(function_source);\n BOOST_CHECK(function_ptr(2, 3) == 6);\n BOOST_CHECK(function_ptr(0, 20) == 0);\n BOOST_CHECK(function_ptr(33, 0) == 0);\n BOOST_CHECK(function_ptr(0, 0) == 0);\n}\n\nBOOST_AUTO_TEST_CASE(test_missing_let)\n{\n const list params =\n {\n list{a, int64_type},\n list{b, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{x, add_int64, a, b}\n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n BOOST_CHECK_THROW(get_compiled_function<void (uint64_t, uint64_t)>(function_source), compile_exception);\n}\n\n<commit_msg>fix broken test<commit_after>#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MODULE compile_function\n#include <boost\/test\/unit_test.hpp>\n\n#include \"..\/src\/compile_function.hpp\"\n#include \"..\/src\/core_unique_ids.hpp\"\n#include \"..\/src\/error\/compile_exception.hpp\"\n\n#include \"state_utils.hpp\"\n#include \"function_building.hpp\"\n\n#include <llvm\/IR\/Function.h>\n#include <llvm\/IR\/DerivedTypes.h>\n#include <llvm\/IR\/Value.h>\n\n#include <unordered_map>\n#include <utility>\n#include <iterator>\n#include <string>\n#include <csetjmp>\n\nusing std::pair;\nusing std::unique_ptr;\nusing std::unordered_map;\nusing std::advance;\nusing std::string;\n\nusing llvm::Function;\nusing llvm::Value;\nusing llvm::IntegerType;\nusing llvm::Type;\nusing llvm::verifyFunction;\nusing llvm::raw_string_ostream;\n\nusing boost::get;\n\nusing namespace symbol_shortcuts;\n\n\nBOOST_AUTO_TEST_CASE(compile_signature_test)\n{\n const any_symbol params1 = list\n {\n list{a, int64_type},\n list{b, int64_type},\n list{c, int64_type},\n };\n const any_symbol return_type1 = int64_type;\n \n unique_ptr<Function> function1;\n unordered_map<identifier_id_t, named_value_info> parameter_table1;\n tie(function1, parameter_table1) = compile_signature(params1, return_type1, context);\n \n BOOST_CHECK(function1 != nullptr);\n BOOST_CHECK_EQUAL(parameter_table1.size(), 3);\n BOOST_CHECK(parameter_table1.count(a.identifier()));\n BOOST_CHECK(parameter_table1.count(b.identifier()));\n BOOST_CHECK(parameter_table1.count(c.identifier()));\n BOOST_CHECK(parameter_table1.at(b.identifier()).llvm_value == (++function1->arg_begin()));\n \n const any_symbol params2 = list\n {\n list{a, int64_type},\n list{b, int64_type},\n list{a, int64_type}, \/\/ duplicate parameter name\n };\n const any_symbol return_type2 = int64_type;\n \n BOOST_CHECK_THROW(compile_signature(params2, return_type2, context), compile_exception);\n}\n\nBOOST_AUTO_TEST_CASE(compile_instruction_test)\n{\n Type* llvm_int64 = IntegerType::get(context.llvm(), 64);\n \n const id_symbol add_constructor{unique_ids::ADD};\n const list_symbol instruction1{add_constructor, int64_type}; \n const instruction_info got1 = parse_instruction(instruction1, context.llvm());\n BOOST_CHECK(get<instruction_info::add>(got1.kind).type.llvm_type == llvm_int64);\n \n const id_symbol div_constructor{unique_ids::DIV};\n const list_symbol instruction2{div_constructor, int64_type}; \n const instruction_info got2 = parse_instruction(instruction2, context.llvm());\n BOOST_CHECK(get<instruction_info::div>(got2.kind).type.llvm_type == llvm_int64);\n\n const id_symbol cmp_constructor{unique_ids::CMP};\n const ref_symbol cmp_ref{\"asdfasdf\"_id, &cmp_constructor};\n const id_symbol lt{unique_ids::LT};\n const list_symbol instruction3{cmp_ref, lt, int64_type};\n const instruction_info got3 = parse_instruction(instruction3, context.llvm());\n BOOST_CHECK(get<instruction_info::cmp>(got3.kind).cmp_kind == unique_ids::LT);\n BOOST_CHECK(get<instruction_info::cmp>(got3.kind).type.llvm_type == llvm_int64);\n}\n\nBOOST_AUTO_TEST_CASE(store_load_test)\n{\n const list_symbol params =\n {\n list{a, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{let, x, alloc_int64},\n list{store_int64, a, x},\n list{let, y, load_int64, x},\n list{return_int64, y}\n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n\n auto function_ptr = get_compiled_function<uint64_t (uint64_t)>(function_source);\n BOOST_CHECK(function_ptr(2) == 2);\n BOOST_CHECK(function_ptr(1231) == 1231);\n}\n\nBOOST_AUTO_TEST_CASE(branch_test)\n{\n const list_symbol params =\n {\n list{a, int64_type},\n list{b, int64_type},\n };\n \n const symbol& return_type = int64_type;\n \n const list_symbol body =\n {\n list{block1, list\n {\n list{let, x, cmp_eq_int64, a, b},\n list{cond_branch, x, block2, block3}\n }},\n list{block2, list\n {\n list{let, y, add_int64, a, b},\n list{return_int64, y}\n }},\n list{block3, list\n {\n list{let, z, sub_int64, a, b},\n list{return_int64, z}\n }}\n };\n const list_symbol func_source =\n {\n params,\n return_type,\n body\n };\n \n auto compiled_function = get_compiled_function<uint64_t (uint64_t, uint64_t)>(func_source);\n BOOST_CHECK(compiled_function);\n BOOST_CHECK_EQUAL(compiled_function(2, 2), 2 + 2);\n BOOST_CHECK_EQUAL(compiled_function(5, 3), 5 - 3);\n}\n\nBOOST_AUTO_TEST_CASE(phi_test)\n{\n const list_symbol params =\n {\n list{a, int64_type},\n list{b, int64_type},\n };\n \n const symbol& return_type = int64_type;\n\n const list_symbol block1_def = {block1, list\n {\n list{let, x, cmp_eq_int64, a, b},\n list{cond_branch, x, block2, block3}\n }};\n const list_symbol block2_def = list{block2, list\n {\n list{let, y, add_int64, a, b},\n list{branch, block4}\n }};\n const list_symbol block3_def = {block3, list\n {\n list{let, z, sub_int64, a, b},\n list{branch, block4}\n }};\n const list_symbol block4_def = {block4, list\n {\n list{let, w, phi_int64, list{y, block2}, list{z, block3}},\n list{return_int64, w}\n }};\n\n const list_symbol func1_source =\n {\n params,\n return_type,\n list\n {\n block1_def,\n block2_def,\n block3_def,\n block4_def\n }\n };\n \n auto compiled_function1 = get_compiled_function<uint64_t (uint64_t, uint64_t)>(func1_source);\n BOOST_CHECK(compiled_function1);\n BOOST_CHECK_EQUAL(compiled_function1(2, 2), 2 + 2);\n BOOST_CHECK_EQUAL(compiled_function1(5, 3), 5 - 3);\n\n\n const list_symbol block4_invalid_def = {block4, list\n {\n list{let, w, phi_int64, list{z, block3}}, \/\/ missing incoming for block2\n list{return_int64, w}\n }};\n\n const list_symbol func2_source =\n {\n params,\n return_type,\n list\n {\n block1_def,\n block2_def,\n block3_def,\n block4_invalid_def\n }\n };\n BOOST_CHECK_THROW(compile_function(func2_source.begin(), func2_source.end(), context), compile_exception);\n \n}\n\n\nBOOST_AUTO_TEST_CASE(a_times_b_test)\n{\n const ref result_loc{\"result_loc\"_id};\n const ref i_loc{\"i_loc\"_id};\n const ref init_cmp{\"init_cmp\"_id};\n const ref current_sum{\"current_sum\"_id};\n const ref next_sum{\"next_sum\"_id};\n const ref current_i{\"current_i\"_id};\n const ref next_i{\"next_i\"_id};\n const ref loop_cmp{\"loop_cmp\"_id};\n const ref result{\"result\"_id};\n\n const list params =\n {\n list{a, int64_type},\n list{b, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{let, result_loc, alloc_int64},\n list{store_int64, lit{\"0\"}, result_loc}, \/\/ v speichert die Zwischenergebnisse und schließlich das Endergebnis der Add.\n list{let, i_loc, alloc_int64},\n list{store_int64, lit{\"0\"}, i_loc}, \/\/ w ist ein Zähler, der zählt, wie oft die erste Eingabe addiert werden muss\n list{let, init_cmp, cmp_ne_int64, b, lit{\"0\"}}, \/\/ x = 1, falls b != 0, sonst: x = 0\n list{cond_branch, init_cmp, block2, block3}\n \t\n }},\n list{block2, list\n {\n\t\t list{let, current_sum, load_int64, result_loc}, \/\/ y = die aktuelle Summe\n\t\t list{let, next_sum, add_int64, current_sum, a}, \/\/z ist die neue Summe, nach Addition mit a \n\t\t list{store_int64, next_sum, result_loc},\n\t\t list{let, current_i, load_int64, i_loc}, \/\/ der Zähler wird aus dem letzten Block geladen, current_i genannt\n\t\t list{let, next_i, add_int64, current_i, lit{\"1\"}},\n\t\t list{store_int64, next_i, i_loc},\n\t\t list{let, loop_cmp, cmp_ne_int64, b, next_i},\n\t\t list{cond_branch, loop_cmp, block2, block3}\n }},\n list{block3, list\n {\n list{let, result, load_int64, result_loc},\n list{return_int64, result} \n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n\n auto function_ptr = get_compiled_function<uint64_t (uint64_t, uint64_t)>(function_source);\n BOOST_CHECK(function_ptr(2, 3) == 6);\n BOOST_CHECK(function_ptr(0, 20) == 0);\n BOOST_CHECK(function_ptr(33, 0) == 0);\n BOOST_CHECK(function_ptr(0, 0) == 0);\n}\n\nBOOST_AUTO_TEST_CASE(missing_let_test)\n{\n const list params =\n {\n list{a, int64_type},\n list{b, int64_type}\n };\n const symbol& return_type = int64_type;\n const list_symbol body =\n {\n list{block1, list\n {\n list{x, add_int64, a, b}\n }}\n };\n\n const list_symbol function_source = \n {\n params,\n return_type,\n body\n };\n BOOST_CHECK_THROW(compile_function(function_source.begin(), function_source.end(), context), compile_exception);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <private\/qobject_p.h>\n#include <qml.h>\n#include <QtDeclarative\/qmlcontext.h>\n#include <QtDeclarative\/qmlexpression.h>\n#include \"qmlstateoperations.h\"\n#include <QtCore\/qdebug.h>\n#include <QtDeclarative\/qmlinfo.h>\n\nQT_BEGIN_NAMESPACE\n\nclass QmlParentChangePrivate : public QObjectPrivate\n{\npublic:\n QmlParentChangePrivate() : target(0), parent(0), origParent(0) {}\n\n QFxItem *target;\n QFxItem *parent;\n QFxItem *origParent;\n\n void doChange(QFxItem *targetParent);\n};\n\nvoid QmlParentChangePrivate::doChange(QFxItem *targetParent)\n{\n if (targetParent && target && target->itemParent()) {\n QPointF me = target->itemParent()->mapToScene(QPointF(0,0));\n QPointF them = targetParent->mapToScene(QPointF(0,0));\n\n QPointF themx = targetParent->mapToScene(QPointF(1,0));\n QPointF themy = targetParent->mapToScene(QPointF(0,1));\n\n themx -= them;\n themy -= them;\n\n target->setItemParent(targetParent);\n\n \/\/ XXX - this is silly and will only work in a few cases\n\n \/*\n xDiff = rx * themx_x + ry * themy_x\n yDiff = rx * themx_y + ry * themy_y\n *\/\n\n qreal rx = 0;\n qreal ry = 0;\n qreal xDiff = them.x() - me.x();\n qreal yDiff = them.y() - me.y();\n\n\n if (themx.x() == 0.) {\n ry = xDiff \/ themy.x();\n rx = (yDiff - ry * themy.y()) \/ themx.y();\n } else if (themy.x() == 0.) {\n rx = xDiff \/ themx.x();\n ry = (yDiff - rx * themx.y()) \/ themy.y();\n } else if (themx.y() == 0.) {\n ry = yDiff \/ themy.y();\n rx = (xDiff - ry * themy.x()) \/ themx.x();\n } else if (themy.y() == 0.) {\n rx = yDiff \/ themx.y();\n ry = (xDiff - rx * themx.x()) \/ themy.x();\n } else {\n qreal div = (themy.x() * themx.y() - themy.y() * themx.x());\n\n if (div != 0.)\n rx = (themx.y() * xDiff - themx.x() * yDiff) \/ div;\n\n if (themy.y() != 0.) ry = (yDiff - rx * themx.y()) \/ themy.y();\n }\n\n target->setX(target->x() - rx);\n target->setY(target->y() - ry);\n } else if (target) {\n target->setItemParent(targetParent);\n }\n}\n\n\/*!\n \\preliminary\n \\qmlclass ParentChange\n \\brief The ParentChange element allows you to reparent an object in a state.\n*\/\n\nQML_DEFINE_TYPE(Qt,4,6,(QT_VERSION&0x00ff00)>>8,ParentChange,QmlParentChange)\nQmlParentChange::QmlParentChange(QObject *parent)\n : QmlStateOperation(*(new QmlParentChangePrivate), parent)\n{\n}\n\nQmlParentChange::~QmlParentChange()\n{\n}\n\n\/*!\n \\qmlproperty Object ParentChange::target\n This property holds the item to be reparented\n*\/\n\nQFxItem *QmlParentChange::object() const\n{\n Q_D(const QmlParentChange);\n return d->target;\n}\n\nvoid QmlParentChange::setObject(QFxItem *target)\n{\n Q_D(QmlParentChange);\n d->target = target;\n}\n\n\/*!\n \\qmlproperty Item ParentChange::parent\n This property holds the parent for the item in this state\n*\/\n\nQFxItem *QmlParentChange::parent() const\n{\n Q_D(const QmlParentChange);\n return d->parent;\n}\n\nvoid QmlParentChange::setParent(QFxItem *parent)\n{\n Q_D(QmlParentChange);\n d->parent = parent;\n}\n\nQmlStateOperation::ActionList QmlParentChange::actions()\n{\n Q_D(QmlParentChange);\n if (!d->target || !d->parent)\n return ActionList();\n\n Action a;\n a.event = this;\n\n return ActionList() << a;\n}\n\nvoid QmlParentChange::execute()\n{\n Q_D(QmlParentChange);\n if (d->target)\n d->origParent = d->target->itemParent();\n d->doChange(d->parent);\n}\n\nbool QmlParentChange::isReversable()\n{\n return true;\n}\n\nvoid QmlParentChange::reverse()\n{\n Q_D(QmlParentChange);\n d->doChange(d->origParent);\n}\n\nQString QmlParentChange::typeName() const\n{\n return QLatin1String(\"ParentChange\");\n}\n\nclass QmlRunScriptPrivate : public QObjectPrivate\n{\npublic:\n QmlRunScriptPrivate() {}\n\n QString script;\n QString name;\n};\n\n\/*!\n \\qmlclass RunScript QmlRunScript\n \\brief The RunScript element allows you to run a script in a state.\n*\/\nQML_DEFINE_TYPE(Qt,4,6,(QT_VERSION&0x00ff00)>>8,RunScript,QmlRunScript)\nQmlRunScript::QmlRunScript(QObject *parent)\n: QmlStateOperation(*(new QmlRunScriptPrivate), parent)\n{\n}\n\nQmlRunScript::~QmlRunScript()\n{\n}\n\n\/*!\n \\qmlproperty string RunScript::script\n This property holds the script to run when the state is current.\n*\/\nQString QmlRunScript::script() const\n{\n Q_D(const QmlRunScript);\n return d->script;\n}\n\nvoid QmlRunScript::setScript(const QString &s)\n{\n Q_D(QmlRunScript);\n d->script = s;\n}\n\nQString QmlRunScript::name() const\n{\n Q_D(const QmlRunScript);\n return d->name;\n}\n\nvoid QmlRunScript::setName(const QString &n)\n{\n Q_D(QmlRunScript);\n d->name = n;\n}\n\nvoid QmlRunScript::execute()\n{\n Q_D(QmlRunScript);\n if (!d->script.isEmpty()) {\n QmlExpression expr(qmlContext(this), d->script, this);\n expr.setTrackChange(false);\n expr.value();\n }\n}\n\nQmlRunScript::ActionList QmlRunScript::actions()\n{\n ActionList rv;\n Action a;\n a.event = this;\n rv << a;\n return rv;\n}\n\n\/*!\n \\qmlclass SetAnchors\n \\brief The SetAnchors element allows you to change anchors in a state.\n*\/\n\nQML_DEFINE_TYPE(QmlSetAnchors,SetAnchors)\n\nclass QmlSetAnchorsPrivate : public QObjectPrivate\n{\npublic:\n QmlSetAnchorsPrivate() : target(0) {}\n\n QString name;\n QFxItem *target;\n QString resetString;\n QStringList resetList;\n QFxAnchorLine left;\n QFxAnchorLine right;\n QFxAnchorLine top;\n QFxAnchorLine bottom;\n QFxAnchorLine origLeft;\n QFxAnchorLine origRight;\n QFxAnchorLine origTop;\n QFxAnchorLine origBottom;\n qreal origX;\n qreal origY;\n qreal origWidth;\n qreal origHeight;\n};\n\nQmlSetAnchors::QmlSetAnchors(QObject *parent)\n : QmlStateOperation(*(new QmlSetAnchorsPrivate), parent)\n{\n}\n\nQmlSetAnchors::~QmlSetAnchors()\n{\n}\n\nQmlSetAnchors::ActionList QmlSetAnchors::actions()\n{\n Action a;\n a.event = this;\n return ActionList() << a;\n}\n\nQFxItem *QmlSetAnchors::object() const\n{\n Q_D(const QmlSetAnchors);\n return d->target;\n}\n\nvoid QmlSetAnchors::setObject(QFxItem *target)\n{\n Q_D(QmlSetAnchors);\n d->target = target;\n}\n\nQString QmlSetAnchors::reset() const\n{\n Q_D(const QmlSetAnchors);\n return d->resetString;\n}\n\nvoid QmlSetAnchors::setReset(const QString &reset)\n{\n Q_D(QmlSetAnchors);\n d->resetString = reset;\n d->resetList = d->resetString.split(QLatin1Char(','));\n}\n\nQFxAnchorLine QmlSetAnchors::left() const\n{\n Q_D(const QmlSetAnchors);\n return d->left;\n}\n\nvoid QmlSetAnchors::setLeft(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->left = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::right() const\n{\n Q_D(const QmlSetAnchors);\n return d->right;\n}\n\nvoid QmlSetAnchors::setRight(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->right = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::top() const\n{\n Q_D(const QmlSetAnchors);\n return d->top;\n}\n\nvoid QmlSetAnchors::setTop(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->top = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::bottom() const\n{\n Q_D(const QmlSetAnchors);\n return d->bottom;\n}\n\nvoid QmlSetAnchors::setBottom(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->bottom = edge;\n}\n\nvoid QmlSetAnchors::execute()\n{\n Q_D(QmlSetAnchors);\n if (!d->target)\n return;\n\n \/\/set any anchors that have been specified\n if (d->left.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setLeft(d->left);\n if (d->right.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setRight(d->right);\n if (d->top.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setTop(d->top);\n if (d->bottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setBottom(d->bottom);\n}\n\nbool QmlSetAnchors::isReversable()\n{\n return true;\n}\n\nvoid QmlSetAnchors::reverse()\n{\n Q_D(QmlSetAnchors);\n if (!d->target)\n return;\n\n \/\/restore previous anchors\n if (d->origLeft.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setLeft(d->origLeft);\n if (d->origRight.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setRight(d->origRight);\n if (d->origTop.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setTop(d->origTop);\n if (d->origBottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setBottom(d->origBottom);\n\n}\n\nQString QmlSetAnchors::typeName() const\n{\n return QLatin1String(\"SetAnchors\");\n}\n\nQList<Action> QmlSetAnchors::extraActions()\n{\n Q_D(QmlSetAnchors);\n QList<Action> extra;\n\n \/\/### try to be smarter about which ones we add.\n \/\/ or short-circuit later on if they haven't actually changed.\n \/\/ we shouldn't set explicit width if there wasn't one before.\n if (d->target) {\n Action a;\n a.fromValue = d->origX;\n a.property = QmlMetaProperty(d->target, \"x\");\n extra << a;\n\n a.fromValue = d->origY;\n a.property = QmlMetaProperty(d->target, \"y\");\n extra << a;\n\n a.fromValue = d->origWidth;\n a.property = QmlMetaProperty(d->target, \"width\");\n extra << a;\n\n a.fromValue = d->origHeight;\n a.property = QmlMetaProperty(d->target, \"height\");\n extra << a;\n }\n \n return extra;\n}\n\nbool QmlSetAnchors::changesBindings()\n{\n return true;\n}\n\nvoid QmlSetAnchors::clearForwardBindings()\n{\n Q_D(QmlSetAnchors);\n d->origLeft = d->target->anchors()->left();\n d->origRight = d->target->anchors()->right();\n d->origTop = d->target->anchors()->top();\n d->origBottom = d->target->anchors()->bottom();\n d->origX = d->target->x();\n d->origY = d->target->y();\n d->origWidth = d->target->width();\n d->origHeight = d->target->height();\n\n \/\/reset any anchors that have been specified\n if (d->resetList.contains(QLatin1String(\"left\")))\n d->target->anchors()->resetLeft();\n if (d->resetList.contains(QLatin1String(\"right\")))\n d->target->anchors()->resetRight();\n if (d->resetList.contains(QLatin1String(\"top\")))\n d->target->anchors()->resetTop();\n if (d->resetList.contains(QLatin1String(\"bottom\")))\n d->target->anchors()->resetBottom();\n}\n\nvoid QmlSetAnchors::clearReverseBindings()\n{\n Q_D(QmlSetAnchors);\n d->origX = d->target->x();\n d->origY = d->target->y();\n d->origWidth = d->target->width();\n d->origHeight = d->target->height();\n\n \/\/reset any anchors that were set in the state\n if (d->left.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetLeft();\n if (d->right.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetRight();\n if (d->top.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetTop();\n if (d->bottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetBottom();\n}\n\nQT_END_NAMESPACE\n<commit_msg>Compile fix after merge.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtDeclarative module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <private\/qobject_p.h>\n#include <qml.h>\n#include <QtDeclarative\/qmlcontext.h>\n#include <QtDeclarative\/qmlexpression.h>\n#include \"qmlstateoperations.h\"\n#include <QtCore\/qdebug.h>\n#include <QtDeclarative\/qmlinfo.h>\n\nQT_BEGIN_NAMESPACE\n\nclass QmlParentChangePrivate : public QObjectPrivate\n{\npublic:\n QmlParentChangePrivate() : target(0), parent(0), origParent(0) {}\n\n QFxItem *target;\n QFxItem *parent;\n QFxItem *origParent;\n\n void doChange(QFxItem *targetParent);\n};\n\nvoid QmlParentChangePrivate::doChange(QFxItem *targetParent)\n{\n if (targetParent && target && target->itemParent()) {\n QPointF me = target->itemParent()->mapToScene(QPointF(0,0));\n QPointF them = targetParent->mapToScene(QPointF(0,0));\n\n QPointF themx = targetParent->mapToScene(QPointF(1,0));\n QPointF themy = targetParent->mapToScene(QPointF(0,1));\n\n themx -= them;\n themy -= them;\n\n target->setItemParent(targetParent);\n\n \/\/ XXX - this is silly and will only work in a few cases\n\n \/*\n xDiff = rx * themx_x + ry * themy_x\n yDiff = rx * themx_y + ry * themy_y\n *\/\n\n qreal rx = 0;\n qreal ry = 0;\n qreal xDiff = them.x() - me.x();\n qreal yDiff = them.y() - me.y();\n\n\n if (themx.x() == 0.) {\n ry = xDiff \/ themy.x();\n rx = (yDiff - ry * themy.y()) \/ themx.y();\n } else if (themy.x() == 0.) {\n rx = xDiff \/ themx.x();\n ry = (yDiff - rx * themx.y()) \/ themy.y();\n } else if (themx.y() == 0.) {\n ry = yDiff \/ themy.y();\n rx = (xDiff - ry * themy.x()) \/ themx.x();\n } else if (themy.y() == 0.) {\n rx = yDiff \/ themx.y();\n ry = (xDiff - rx * themx.x()) \/ themy.x();\n } else {\n qreal div = (themy.x() * themx.y() - themy.y() * themx.x());\n\n if (div != 0.)\n rx = (themx.y() * xDiff - themx.x() * yDiff) \/ div;\n\n if (themy.y() != 0.) ry = (yDiff - rx * themx.y()) \/ themy.y();\n }\n\n target->setX(target->x() - rx);\n target->setY(target->y() - ry);\n } else if (target) {\n target->setItemParent(targetParent);\n }\n}\n\n\/*!\n \\preliminary\n \\qmlclass ParentChange\n \\brief The ParentChange element allows you to reparent an object in a state.\n*\/\n\nQML_DEFINE_TYPE(Qt,4,6,(QT_VERSION&0x00ff00)>>8,ParentChange,QmlParentChange)\nQmlParentChange::QmlParentChange(QObject *parent)\n : QmlStateOperation(*(new QmlParentChangePrivate), parent)\n{\n}\n\nQmlParentChange::~QmlParentChange()\n{\n}\n\n\/*!\n \\qmlproperty Object ParentChange::target\n This property holds the item to be reparented\n*\/\n\nQFxItem *QmlParentChange::object() const\n{\n Q_D(const QmlParentChange);\n return d->target;\n}\n\nvoid QmlParentChange::setObject(QFxItem *target)\n{\n Q_D(QmlParentChange);\n d->target = target;\n}\n\n\/*!\n \\qmlproperty Item ParentChange::parent\n This property holds the parent for the item in this state\n*\/\n\nQFxItem *QmlParentChange::parent() const\n{\n Q_D(const QmlParentChange);\n return d->parent;\n}\n\nvoid QmlParentChange::setParent(QFxItem *parent)\n{\n Q_D(QmlParentChange);\n d->parent = parent;\n}\n\nQmlStateOperation::ActionList QmlParentChange::actions()\n{\n Q_D(QmlParentChange);\n if (!d->target || !d->parent)\n return ActionList();\n\n Action a;\n a.event = this;\n\n return ActionList() << a;\n}\n\nvoid QmlParentChange::execute()\n{\n Q_D(QmlParentChange);\n if (d->target)\n d->origParent = d->target->itemParent();\n d->doChange(d->parent);\n}\n\nbool QmlParentChange::isReversable()\n{\n return true;\n}\n\nvoid QmlParentChange::reverse()\n{\n Q_D(QmlParentChange);\n d->doChange(d->origParent);\n}\n\nQString QmlParentChange::typeName() const\n{\n return QLatin1String(\"ParentChange\");\n}\n\nclass QmlRunScriptPrivate : public QObjectPrivate\n{\npublic:\n QmlRunScriptPrivate() {}\n\n QString script;\n QString name;\n};\n\n\/*!\n \\qmlclass RunScript QmlRunScript\n \\brief The RunScript element allows you to run a script in a state.\n*\/\nQML_DEFINE_TYPE(Qt,4,6,(QT_VERSION&0x00ff00)>>8,RunScript,QmlRunScript)\nQmlRunScript::QmlRunScript(QObject *parent)\n: QmlStateOperation(*(new QmlRunScriptPrivate), parent)\n{\n}\n\nQmlRunScript::~QmlRunScript()\n{\n}\n\n\/*!\n \\qmlproperty string RunScript::script\n This property holds the script to run when the state is current.\n*\/\nQString QmlRunScript::script() const\n{\n Q_D(const QmlRunScript);\n return d->script;\n}\n\nvoid QmlRunScript::setScript(const QString &s)\n{\n Q_D(QmlRunScript);\n d->script = s;\n}\n\nQString QmlRunScript::name() const\n{\n Q_D(const QmlRunScript);\n return d->name;\n}\n\nvoid QmlRunScript::setName(const QString &n)\n{\n Q_D(QmlRunScript);\n d->name = n;\n}\n\nvoid QmlRunScript::execute()\n{\n Q_D(QmlRunScript);\n if (!d->script.isEmpty()) {\n QmlExpression expr(qmlContext(this), d->script, this);\n expr.setTrackChange(false);\n expr.value();\n }\n}\n\nQmlRunScript::ActionList QmlRunScript::actions()\n{\n ActionList rv;\n Action a;\n a.event = this;\n rv << a;\n return rv;\n}\n\n\/*!\n \\qmlclass SetAnchors\n \\brief The SetAnchors element allows you to change anchors in a state.\n*\/\n\nQML_DEFINE_TYPE(Qt,4,6,(QT_VERSION&0x00ff00)>>8,SetAnchors,QmlSetAnchors)\n\nclass QmlSetAnchorsPrivate : public QObjectPrivate\n{\npublic:\n QmlSetAnchorsPrivate() : target(0) {}\n\n QString name;\n QFxItem *target;\n QString resetString;\n QStringList resetList;\n QFxAnchorLine left;\n QFxAnchorLine right;\n QFxAnchorLine top;\n QFxAnchorLine bottom;\n QFxAnchorLine origLeft;\n QFxAnchorLine origRight;\n QFxAnchorLine origTop;\n QFxAnchorLine origBottom;\n qreal origX;\n qreal origY;\n qreal origWidth;\n qreal origHeight;\n};\n\nQmlSetAnchors::QmlSetAnchors(QObject *parent)\n : QmlStateOperation(*(new QmlSetAnchorsPrivate), parent)\n{\n}\n\nQmlSetAnchors::~QmlSetAnchors()\n{\n}\n\nQmlSetAnchors::ActionList QmlSetAnchors::actions()\n{\n Action a;\n a.event = this;\n return ActionList() << a;\n}\n\nQFxItem *QmlSetAnchors::object() const\n{\n Q_D(const QmlSetAnchors);\n return d->target;\n}\n\nvoid QmlSetAnchors::setObject(QFxItem *target)\n{\n Q_D(QmlSetAnchors);\n d->target = target;\n}\n\nQString QmlSetAnchors::reset() const\n{\n Q_D(const QmlSetAnchors);\n return d->resetString;\n}\n\nvoid QmlSetAnchors::setReset(const QString &reset)\n{\n Q_D(QmlSetAnchors);\n d->resetString = reset;\n d->resetList = d->resetString.split(QLatin1Char(','));\n}\n\nQFxAnchorLine QmlSetAnchors::left() const\n{\n Q_D(const QmlSetAnchors);\n return d->left;\n}\n\nvoid QmlSetAnchors::setLeft(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->left = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::right() const\n{\n Q_D(const QmlSetAnchors);\n return d->right;\n}\n\nvoid QmlSetAnchors::setRight(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->right = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::top() const\n{\n Q_D(const QmlSetAnchors);\n return d->top;\n}\n\nvoid QmlSetAnchors::setTop(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->top = edge;\n}\n\nQFxAnchorLine QmlSetAnchors::bottom() const\n{\n Q_D(const QmlSetAnchors);\n return d->bottom;\n}\n\nvoid QmlSetAnchors::setBottom(const QFxAnchorLine &edge)\n{\n Q_D(QmlSetAnchors);\n d->bottom = edge;\n}\n\nvoid QmlSetAnchors::execute()\n{\n Q_D(QmlSetAnchors);\n if (!d->target)\n return;\n\n \/\/set any anchors that have been specified\n if (d->left.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setLeft(d->left);\n if (d->right.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setRight(d->right);\n if (d->top.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setTop(d->top);\n if (d->bottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setBottom(d->bottom);\n}\n\nbool QmlSetAnchors::isReversable()\n{\n return true;\n}\n\nvoid QmlSetAnchors::reverse()\n{\n Q_D(QmlSetAnchors);\n if (!d->target)\n return;\n\n \/\/restore previous anchors\n if (d->origLeft.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setLeft(d->origLeft);\n if (d->origRight.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setRight(d->origRight);\n if (d->origTop.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setTop(d->origTop);\n if (d->origBottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->setBottom(d->origBottom);\n\n}\n\nQString QmlSetAnchors::typeName() const\n{\n return QLatin1String(\"SetAnchors\");\n}\n\nQList<Action> QmlSetAnchors::extraActions()\n{\n Q_D(QmlSetAnchors);\n QList<Action> extra;\n\n \/\/### try to be smarter about which ones we add.\n \/\/ or short-circuit later on if they haven't actually changed.\n \/\/ we shouldn't set explicit width if there wasn't one before.\n if (d->target) {\n Action a;\n a.fromValue = d->origX;\n a.property = QmlMetaProperty(d->target, \"x\");\n extra << a;\n\n a.fromValue = d->origY;\n a.property = QmlMetaProperty(d->target, \"y\");\n extra << a;\n\n a.fromValue = d->origWidth;\n a.property = QmlMetaProperty(d->target, \"width\");\n extra << a;\n\n a.fromValue = d->origHeight;\n a.property = QmlMetaProperty(d->target, \"height\");\n extra << a;\n }\n \n return extra;\n}\n\nbool QmlSetAnchors::changesBindings()\n{\n return true;\n}\n\nvoid QmlSetAnchors::clearForwardBindings()\n{\n Q_D(QmlSetAnchors);\n d->origLeft = d->target->anchors()->left();\n d->origRight = d->target->anchors()->right();\n d->origTop = d->target->anchors()->top();\n d->origBottom = d->target->anchors()->bottom();\n d->origX = d->target->x();\n d->origY = d->target->y();\n d->origWidth = d->target->width();\n d->origHeight = d->target->height();\n\n \/\/reset any anchors that have been specified\n if (d->resetList.contains(QLatin1String(\"left\")))\n d->target->anchors()->resetLeft();\n if (d->resetList.contains(QLatin1String(\"right\")))\n d->target->anchors()->resetRight();\n if (d->resetList.contains(QLatin1String(\"top\")))\n d->target->anchors()->resetTop();\n if (d->resetList.contains(QLatin1String(\"bottom\")))\n d->target->anchors()->resetBottom();\n}\n\nvoid QmlSetAnchors::clearReverseBindings()\n{\n Q_D(QmlSetAnchors);\n d->origX = d->target->x();\n d->origY = d->target->y();\n d->origWidth = d->target->width();\n d->origHeight = d->target->height();\n\n \/\/reset any anchors that were set in the state\n if (d->left.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetLeft();\n if (d->right.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetRight();\n if (d->top.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetTop();\n if (d->bottom.anchorLine != QFxAnchorLine::Invalid)\n d->target->anchors()->resetBottom();\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <cstddef>\n#include <limits>\n#include <memory>\n#include <tuple>\n#include <type_traits>\n#include <utility>\n#include <vector>\n#include <gtest\/gtest.h>\n#include <entt\/core\/memory.hpp>\n#include \"..\/common\/basic_test_allocator.hpp\"\n#include \"..\/common\/config.h\"\n#include \"..\/common\/throwing_allocator.hpp\"\n#include \"..\/common\/throwing_type.hpp\"\n#include \"..\/common\/tracked_memory_resource.hpp\"\n\nTEST(ToAddress, Functionalities) {\n std::shared_ptr<int> shared = std::make_shared<int>();\n auto *plain = std::addressof(*shared);\n\n ASSERT_EQ(entt::to_address(shared), plain);\n ASSERT_EQ(entt::to_address(plain), plain);\n}\n\nTEST(PoccaPocmaAndPocs, Functionalities) {\n test::basic_test_allocator<int> lhs, rhs;\n \/\/ honestly, I don't even know how one is supposed to test such a thing :)\n entt::propagate_on_container_copy_assignment(lhs, rhs);\n entt::propagate_on_container_move_assignment(lhs, rhs);\n entt::propagate_on_container_swap(lhs, rhs);\n}\n\nTEST(IsPowerOfTwo, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto zero_is_power_of_two = entt::is_power_of_two(0u);\n\n ASSERT_FALSE(zero_is_power_of_two);\n ASSERT_TRUE(entt::is_power_of_two(1u));\n ASSERT_TRUE(entt::is_power_of_two(2u));\n ASSERT_TRUE(entt::is_power_of_two(4u));\n ASSERT_FALSE(entt::is_power_of_two(7u));\n ASSERT_TRUE(entt::is_power_of_two(128u));\n ASSERT_FALSE(entt::is_power_of_two(200u));\n}\n\nTEST(NextPowerOfTwo, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto next_power_of_two_of_zero = entt::next_power_of_two(0u);\n\n ASSERT_EQ(next_power_of_two_of_zero, 1u);\n ASSERT_EQ(entt::next_power_of_two(1u), 1u);\n ASSERT_EQ(entt::next_power_of_two(2u), 2u);\n ASSERT_EQ(entt::next_power_of_two(3u), 4u);\n ASSERT_EQ(entt::next_power_of_two(17u), 32u);\n ASSERT_EQ(entt::next_power_of_two(32u), 32u);\n ASSERT_EQ(entt::next_power_of_two(33u), 64u);\n ASSERT_EQ(entt::next_power_of_two(std::pow(2, 16)), std::pow(2, 16));\n ASSERT_EQ(entt::next_power_of_two(std::pow(2, 16) + 1u), std::pow(2, 17));\n}\n\nENTT_DEBUG_TEST(NextPowerOfTwoDeathTest, Functionalities) {\n ASSERT_DEATH(static_cast<void>(entt::next_power_of_two((std::size_t{1u} << (std::numeric_limits<std::size_t>::digits - 1)) + 1)), \"\");\n}\n\nTEST(FastMod, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto fast_mod_of_zero = entt::fast_mod(0u, 8u);\n\n ASSERT_EQ(fast_mod_of_zero, 0u);\n ASSERT_EQ(entt::fast_mod(7u, 8u), 7u);\n ASSERT_EQ(entt::fast_mod(8u, 8u), 0u);\n}\n\nTEST(AllocateUnique, Functionalities) {\n test::throwing_allocator<test::throwing_type> allocator{};\n test::throwing_allocator<test::throwing_type>::trigger_on_allocate = true;\n test::throwing_type::trigger_on_value = 0;\n\n ASSERT_THROW((entt::allocate_unique<test::throwing_type>(allocator, 0)), test::throwing_allocator<test::throwing_type>::exception_type);\n ASSERT_THROW((entt::allocate_unique<test::throwing_type>(allocator, test::throwing_type{0})), test::throwing_type::exception_type);\n\n std::unique_ptr<test::throwing_type, entt::allocation_deleter<test::throwing_allocator<test::throwing_type>>> ptr = entt::allocate_unique<test::throwing_type>(allocator, 42);\n\n ASSERT_TRUE(ptr);\n ASSERT_EQ(*ptr, 42);\n\n ptr.reset();\n\n ASSERT_FALSE(ptr);\n}\n\n#if defined(ENTT_HAS_TRACKED_MEMORY_RESOURCE)\n\nTEST(AllocateUnique, NoUsesAllocatorConstruction) {\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<int> allocator{&memory_resource};\n\n using type = std::unique_ptr<int, entt::allocation_deleter<std::pmr::polymorphic_allocator<int>>>;\n type ptr = entt::allocate_unique<int>(allocator, 0);\n\n ASSERT_EQ(memory_resource.do_allocate_counter(), 1u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n}\n\nTEST(AllocateUnique, UsesAllocatorConstruction) {\n using string_type = typename test::tracked_memory_resource::string_type;\n\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<string_type> allocator{&memory_resource};\n\n using type = std::unique_ptr<string_type, entt::allocation_deleter<std::pmr::polymorphic_allocator<string_type>>>;\n type ptr = entt::allocate_unique<string_type>(allocator, test::tracked_memory_resource::default_value);\n\n ASSERT_GT(memory_resource.do_allocate_counter(), 1u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n}\n\n#endif\n\nTEST(UsesAllocatorConstructionArgs, NoUsesAllocatorConstruction) {\n const auto value = 42;\n const auto args = entt::uses_allocator_construction_args<int>(std::allocator<int>{}, value);\n\n static_assert(std::tuple_size_v<decltype(args)> == 1u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<const int &>>);\n\n ASSERT_EQ(std::get<0>(args), value);\n}\n\nTEST(UsesAllocatorConstructionArgs, LeadingAllocatorConvention) {\n const auto value = 42;\n const auto args = entt::uses_allocator_construction_args<std::tuple<int, char>>(std::allocator<int>{}, value, 'c');\n\n static_assert(std::tuple_size_v<decltype(args)> == 4u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::allocator_arg_t, const std::allocator<int> &, const int &, char &&>>);\n\n ASSERT_EQ(std::get<2>(args), value);\n}\n\nTEST(UsesAllocatorConstructionArgs, TrailingAllocatorConvention) {\n const auto size = 42u;\n const auto args = entt::uses_allocator_construction_args<std::vector<int>>(std::allocator<int>{}, size);\n\n static_assert(std::tuple_size_v<decltype(args)> == 2u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<const unsigned int &, const std::allocator<int> &>>);\n\n ASSERT_EQ(std::get<0>(args), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairPiecewiseConstruct) {\n const auto size = 42u;\n const auto tup = std::make_tuple(size);\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, std::piecewise_construct, std::make_tuple(3), tup);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<2>(args)), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairNoArgs) {\n [[maybe_unused]] const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{});\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<>, std::tuple<const std::allocator<int> &>>>);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairValues) {\n const auto size = 42u;\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, 3, size);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<2>(args)), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairConstLValueReference) {\n const auto value = std::make_pair(3, 42u);\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, value);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<const int &>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<1>(args)), 3);\n ASSERT_EQ(std::get<0>(std::get<2>(args)), 42u);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairRValueReference) {\n [[maybe_unused]] const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, std::make_pair(3, 42u));\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<unsigned int &&, const std::allocator<int> &>>>);\n}\n\nTEST(MakeObjUsingAllocator, Functionalities) {\n const auto size = 42u;\n test::throwing_allocator<int>::trigger_on_allocate = true;\n\n ASSERT_THROW((entt::make_obj_using_allocator<std::vector<int, test::throwing_allocator<int>>>(test::throwing_allocator<int>{}, size)), test::throwing_allocator<int>::exception_type);\n\n const auto vec = entt::make_obj_using_allocator<std::vector<int>>(std::allocator<int>{}, size);\n\n ASSERT_FALSE(vec.empty());\n ASSERT_EQ(vec.size(), size);\n}\n\nTEST(UninitializedConstructUsingAllocator, NoUsesAllocatorConstruction) {\n std::aligned_storage_t<sizeof(int)> storage;\n std::allocator<int> allocator{};\n\n int *value = entt::uninitialized_construct_using_allocator(reinterpret_cast<int *>(&storage), allocator, 42);\n\n ASSERT_EQ(*value, 42);\n}\n\n#if defined(ENTT_HAS_TRACKED_MEMORY_RESOURCE)\n\nTEST(UninitializedConstructUsingAllocator, UsesAllocatorConstruction) {\n using string_type = typename test::tracked_memory_resource::string_type;\n\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<string_type> allocator{&memory_resource};\n std::aligned_storage_t<sizeof(string_type)> storage;\n\n string_type *value = entt::uninitialized_construct_using_allocator(reinterpret_cast<string_type *>(&storage), allocator, test::tracked_memory_resource::default_value);\n\n ASSERT_GT(memory_resource.do_allocate_counter(), 0u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n ASSERT_EQ(*value, test::tracked_memory_resource::default_value);\n\n value->~string_type();\n}\n\n#endif\n<commit_msg>test: avoid using aligned_storage_t if possible (see #919)<commit_after>#include <cmath>\n#include <cstddef>\n#include <limits>\n#include <memory>\n#include <tuple>\n#include <type_traits>\n#include <utility>\n#include <vector>\n#include <gtest\/gtest.h>\n#include <entt\/core\/memory.hpp>\n#include \"..\/common\/basic_test_allocator.hpp\"\n#include \"..\/common\/config.h\"\n#include \"..\/common\/throwing_allocator.hpp\"\n#include \"..\/common\/throwing_type.hpp\"\n#include \"..\/common\/tracked_memory_resource.hpp\"\n\nTEST(ToAddress, Functionalities) {\n std::shared_ptr<int> shared = std::make_shared<int>();\n auto *plain = std::addressof(*shared);\n\n ASSERT_EQ(entt::to_address(shared), plain);\n ASSERT_EQ(entt::to_address(plain), plain);\n}\n\nTEST(PoccaPocmaAndPocs, Functionalities) {\n test::basic_test_allocator<int> lhs, rhs;\n \/\/ honestly, I don't even know how one is supposed to test such a thing :)\n entt::propagate_on_container_copy_assignment(lhs, rhs);\n entt::propagate_on_container_move_assignment(lhs, rhs);\n entt::propagate_on_container_swap(lhs, rhs);\n}\n\nTEST(IsPowerOfTwo, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto zero_is_power_of_two = entt::is_power_of_two(0u);\n\n ASSERT_FALSE(zero_is_power_of_two);\n ASSERT_TRUE(entt::is_power_of_two(1u));\n ASSERT_TRUE(entt::is_power_of_two(2u));\n ASSERT_TRUE(entt::is_power_of_two(4u));\n ASSERT_FALSE(entt::is_power_of_two(7u));\n ASSERT_TRUE(entt::is_power_of_two(128u));\n ASSERT_FALSE(entt::is_power_of_two(200u));\n}\n\nTEST(NextPowerOfTwo, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto next_power_of_two_of_zero = entt::next_power_of_two(0u);\n\n ASSERT_EQ(next_power_of_two_of_zero, 1u);\n ASSERT_EQ(entt::next_power_of_two(1u), 1u);\n ASSERT_EQ(entt::next_power_of_two(2u), 2u);\n ASSERT_EQ(entt::next_power_of_two(3u), 4u);\n ASSERT_EQ(entt::next_power_of_two(17u), 32u);\n ASSERT_EQ(entt::next_power_of_two(32u), 32u);\n ASSERT_EQ(entt::next_power_of_two(33u), 64u);\n ASSERT_EQ(entt::next_power_of_two(std::pow(2, 16)), std::pow(2, 16));\n ASSERT_EQ(entt::next_power_of_two(std::pow(2, 16) + 1u), std::pow(2, 17));\n}\n\nENTT_DEBUG_TEST(NextPowerOfTwoDeathTest, Functionalities) {\n ASSERT_DEATH(static_cast<void>(entt::next_power_of_two((std::size_t{1u} << (std::numeric_limits<std::size_t>::digits - 1)) + 1)), \"\");\n}\n\nTEST(FastMod, Functionalities) {\n \/\/ constexpr-ness guaranteed\n constexpr auto fast_mod_of_zero = entt::fast_mod(0u, 8u);\n\n ASSERT_EQ(fast_mod_of_zero, 0u);\n ASSERT_EQ(entt::fast_mod(7u, 8u), 7u);\n ASSERT_EQ(entt::fast_mod(8u, 8u), 0u);\n}\n\nTEST(AllocateUnique, Functionalities) {\n test::throwing_allocator<test::throwing_type> allocator{};\n test::throwing_allocator<test::throwing_type>::trigger_on_allocate = true;\n test::throwing_type::trigger_on_value = 0;\n\n ASSERT_THROW((entt::allocate_unique<test::throwing_type>(allocator, 0)), test::throwing_allocator<test::throwing_type>::exception_type);\n ASSERT_THROW((entt::allocate_unique<test::throwing_type>(allocator, test::throwing_type{0})), test::throwing_type::exception_type);\n\n std::unique_ptr<test::throwing_type, entt::allocation_deleter<test::throwing_allocator<test::throwing_type>>> ptr = entt::allocate_unique<test::throwing_type>(allocator, 42);\n\n ASSERT_TRUE(ptr);\n ASSERT_EQ(*ptr, 42);\n\n ptr.reset();\n\n ASSERT_FALSE(ptr);\n}\n\n#if defined(ENTT_HAS_TRACKED_MEMORY_RESOURCE)\n\nTEST(AllocateUnique, NoUsesAllocatorConstruction) {\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<int> allocator{&memory_resource};\n\n using type = std::unique_ptr<int, entt::allocation_deleter<std::pmr::polymorphic_allocator<int>>>;\n type ptr = entt::allocate_unique<int>(allocator, 0);\n\n ASSERT_EQ(memory_resource.do_allocate_counter(), 1u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n}\n\nTEST(AllocateUnique, UsesAllocatorConstruction) {\n using string_type = typename test::tracked_memory_resource::string_type;\n\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<string_type> allocator{&memory_resource};\n\n using type = std::unique_ptr<string_type, entt::allocation_deleter<std::pmr::polymorphic_allocator<string_type>>>;\n type ptr = entt::allocate_unique<string_type>(allocator, test::tracked_memory_resource::default_value);\n\n ASSERT_GT(memory_resource.do_allocate_counter(), 1u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n}\n\n#endif\n\nTEST(UsesAllocatorConstructionArgs, NoUsesAllocatorConstruction) {\n const auto value = 42;\n const auto args = entt::uses_allocator_construction_args<int>(std::allocator<int>{}, value);\n\n static_assert(std::tuple_size_v<decltype(args)> == 1u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<const int &>>);\n\n ASSERT_EQ(std::get<0>(args), value);\n}\n\nTEST(UsesAllocatorConstructionArgs, LeadingAllocatorConvention) {\n const auto value = 42;\n const auto args = entt::uses_allocator_construction_args<std::tuple<int, char>>(std::allocator<int>{}, value, 'c');\n\n static_assert(std::tuple_size_v<decltype(args)> == 4u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::allocator_arg_t, const std::allocator<int> &, const int &, char &&>>);\n\n ASSERT_EQ(std::get<2>(args), value);\n}\n\nTEST(UsesAllocatorConstructionArgs, TrailingAllocatorConvention) {\n const auto size = 42u;\n const auto args = entt::uses_allocator_construction_args<std::vector<int>>(std::allocator<int>{}, size);\n\n static_assert(std::tuple_size_v<decltype(args)> == 2u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<const unsigned int &, const std::allocator<int> &>>);\n\n ASSERT_EQ(std::get<0>(args), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairPiecewiseConstruct) {\n const auto size = 42u;\n const auto tup = std::make_tuple(size);\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, std::piecewise_construct, std::make_tuple(3), tup);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<2>(args)), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairNoArgs) {\n [[maybe_unused]] const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{});\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<>, std::tuple<const std::allocator<int> &>>>);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairValues) {\n const auto size = 42u;\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, 3, size);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<2>(args)), size);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairConstLValueReference) {\n const auto value = std::make_pair(3, 42u);\n const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, value);\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<const int &>, std::tuple<const unsigned int &, const std::allocator<int> &>>>);\n\n ASSERT_EQ(std::get<0>(std::get<1>(args)), 3);\n ASSERT_EQ(std::get<0>(std::get<2>(args)), 42u);\n}\n\nTEST(UsesAllocatorConstructionArgs, PairRValueReference) {\n [[maybe_unused]] const auto args = entt::uses_allocator_construction_args<std::pair<int, std::vector<int>>>(std::allocator<int>{}, std::make_pair(3, 42u));\n\n static_assert(std::tuple_size_v<decltype(args)> == 3u);\n static_assert(std::is_same_v<decltype(args), const std::tuple<std::piecewise_construct_t, std::tuple<int &&>, std::tuple<unsigned int &&, const std::allocator<int> &>>>);\n}\n\nTEST(MakeObjUsingAllocator, Functionalities) {\n const auto size = 42u;\n test::throwing_allocator<int>::trigger_on_allocate = true;\n\n ASSERT_THROW((entt::make_obj_using_allocator<std::vector<int, test::throwing_allocator<int>>>(test::throwing_allocator<int>{}, size)), test::throwing_allocator<int>::exception_type);\n\n const auto vec = entt::make_obj_using_allocator<std::vector<int>>(std::allocator<int>{}, size);\n\n ASSERT_FALSE(vec.empty());\n ASSERT_EQ(vec.size(), size);\n}\n\nTEST(UninitializedConstructUsingAllocator, NoUsesAllocatorConstruction) {\n alignas(int) std::byte storage[sizeof(int)];\n std::allocator<int> allocator{};\n\n int *value = entt::uninitialized_construct_using_allocator(reinterpret_cast<int *>(&storage), allocator, 42);\n\n ASSERT_EQ(*value, 42);\n}\n\n#if defined(ENTT_HAS_TRACKED_MEMORY_RESOURCE)\n\nTEST(UninitializedConstructUsingAllocator, UsesAllocatorConstruction) {\n using string_type = typename test::tracked_memory_resource::string_type;\n\n test::tracked_memory_resource memory_resource{};\n std::pmr::polymorphic_allocator<string_type> allocator{&memory_resource};\n alignas(string_type) std::byte storage[sizeof(string_type)];\n\n string_type *value = entt::uninitialized_construct_using_allocator(reinterpret_cast<string_type *>(&storage), allocator, test::tracked_memory_resource::default_value);\n\n ASSERT_GT(memory_resource.do_allocate_counter(), 0u);\n ASSERT_EQ(memory_resource.do_deallocate_counter(), 0u);\n ASSERT_EQ(*value, test::tracked_memory_resource::default_value);\n\n value->~string_type();\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifdef ETL_VECTORIZE_IMPL\n#ifdef __AVX__\n#define TEST_VEC\n#elif defined(__SSE3__)\n#define TEST_VEC\n#endif\n#endif\n\n#define DOT_FUNCTOR(name, ...) \\\n struct name { \\\n template <typename A, typename B, typename C> \\\n static void apply(A&& a, B&& b, C&& c) { \\\n __VA_ARGS__; \\\n } \\\n };\n\nDOT_FUNCTOR(default_dot, c = etl::dot(a, b))\nDOT_FUNCTOR(std_dot, SELECTED_SECTION(etl::dot_impl::STD) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_DEFAULT DOT_TEST_CASE_SECTIONS(default_dot)\n#define DOT_TEST_CASE_SECTION_STD DOT_TEST_CASE_SECTIONS(std_dot)\n\n#ifdef TEST_VEC\nDOT_FUNCTOR(vec_dot, SELECTED_SECTION(etl::dot_impl::VEC) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_VEC DOT_TEST_CASE_SECTIONS(vec_dot)\n#else\n#define DOT_TEST_CASE_SECTION_VEC\n#endif\n\n#ifdef ETL_BLAS_MODE\nDOT_FUNCTOR(blas_dot, SELECTED_SECTION(etl::dot_impl::BLAS) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_BLAS DOT_TEST_CASE_SECTIONS(blas_dot)\n#else\n#define DOT_TEST_CASE_SECTION_BLAS\n#endif\n\n#define DOT_TEST_CASE_DECL(name, description) \\\n template <typename T, typename Impl> \\\n static void UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)(); \\\n ETL_TEST_CASE(name, description)\n\n#define DOT_TEST_CASE_SECTION(Tn, Impln) \\\n ETL_SECTION(#Tn \"_\" #Impln) { \\\n UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)<Tn, Impln>(); \\\n }\n\n#define DOT_TEST_CASE_DEFN \\\n template <typename T, typename Impl> \\\n static void UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)()\n\n#define DOT_TEST_CASE_SECTIONS(S1) \\\n DOT_TEST_CASE_SECTION(float, S1) \\\n DOT_TEST_CASE_SECTION(double, S1)\n\n#define DOT_TEST_CASE(name, description) \\\n DOT_TEST_CASE_DECL(name, description) { \\\n DOT_TEST_CASE_SECTION_DEFAULT \\\n DOT_TEST_CASE_SECTION_STD \\\n DOT_TEST_CASE_SECTION_VEC \\\n DOT_TEST_CASE_SECTION_BLAS \\\n } \\\n DOT_TEST_CASE_DEFN\n<commit_msg>Tests for CUBLAS dot<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#ifdef ETL_VECTORIZE_IMPL\n#ifdef __AVX__\n#define TEST_VEC\n#elif defined(__SSE3__)\n#define TEST_VEC\n#endif\n#endif\n\n#define DOT_FUNCTOR(name, ...) \\\n struct name { \\\n template <typename A, typename B, typename C> \\\n static void apply(A&& a, B&& b, C&& c) { \\\n __VA_ARGS__; \\\n } \\\n };\n\nDOT_FUNCTOR(default_dot, c = etl::dot(a, b))\nDOT_FUNCTOR(std_dot, SELECTED_SECTION(etl::dot_impl::STD) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_DEFAULT DOT_TEST_CASE_SECTIONS(default_dot)\n#define DOT_TEST_CASE_SECTION_STD DOT_TEST_CASE_SECTIONS(std_dot)\n\n#ifdef TEST_VEC\nDOT_FUNCTOR(vec_dot, SELECTED_SECTION(etl::dot_impl::VEC) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_VEC DOT_TEST_CASE_SECTIONS(vec_dot)\n#else\n#define DOT_TEST_CASE_SECTION_VEC\n#endif\n\n#ifdef ETL_BLAS_MODE\nDOT_FUNCTOR(blas_dot, SELECTED_SECTION(etl::dot_impl::BLAS) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_BLAS DOT_TEST_CASE_SECTIONS(blas_dot)\n#else\n#define DOT_TEST_CASE_SECTION_BLAS\n#endif\n\n#ifdef ETL_CUBLAS_MODE\nDOT_FUNCTOR(cublas_dot, SELECTED_SECTION(etl::dot_impl::CUBLAS) { c = etl::dot(a, b); })\n\n#define DOT_TEST_CASE_SECTION_CUBLAS DOT_TEST_CASE_SECTIONS(cublas_dot)\n#else\n#define DOT_TEST_CASE_SECTION_CUBLAS\n#endif\n\n#define DOT_TEST_CASE_DECL(name, description) \\\n template <typename T, typename Impl> \\\n static void UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)(); \\\n ETL_TEST_CASE(name, description)\n\n#define DOT_TEST_CASE_SECTION(Tn, Impln) \\\n ETL_SECTION(#Tn \"_\" #Impln) { \\\n UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)<Tn, Impln>(); \\\n }\n\n#define DOT_TEST_CASE_DEFN \\\n template <typename T, typename Impl> \\\n static void UNIQUE_NAME(____C_A_T_C_H____T_E_M_P_L_A_TE____T_E_S_T____)()\n\n#define DOT_TEST_CASE_SECTIONS(S1) \\\n DOT_TEST_CASE_SECTION(float, S1) \\\n DOT_TEST_CASE_SECTION(double, S1)\n\n#define DOT_TEST_CASE(name, description) \\\n DOT_TEST_CASE_DECL(name, description) { \\\n DOT_TEST_CASE_SECTION_DEFAULT \\\n DOT_TEST_CASE_SECTION_STD \\\n DOT_TEST_CASE_SECTION_VEC \\\n DOT_TEST_CASE_SECTION_BLAS \\\n DOT_TEST_CASE_SECTION_CUBLAS \\\n } \\\n DOT_TEST_CASE_DEFN\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n#define MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n\n#include <mapnik\/renderer_common.hpp>\n#include <mapnik\/svg\/svg_storage.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/marker_helpers.hpp>\n#include <mapnik\/geometry_type.hpp>\n\nnamespace mapnik {\n\ntemplate <typename VD, typename RD, typename RendererType, typename ContextType>\nstruct render_marker_symbolizer_visitor\n{\n using vector_dispatch_type = VD;\n using raster_dispatch_type = RD;\n using buffer_type = typename std::tuple_element<0,ContextType>::type;\n\n render_marker_symbolizer_visitor(std::string const& filename,\n markers_symbolizer const& sym,\n mapnik::feature_impl & feature,\n proj_transform const& prj_trans,\n RendererType const& common,\n box2d<double> const& clip_box,\n ContextType const& renderer_context)\n : filename_(filename),\n sym_(sym),\n feature_(feature),\n prj_trans_(prj_trans),\n common_(common),\n clip_box_(clip_box),\n renderer_context_(renderer_context) {}\n\n void operator() (marker_null const&) {}\n\n void operator() (marker_svg const& mark)\n {\n using namespace mapnik::svg;\n bool clip = get<value_bool, keys::clip>(sym_, feature_, common_.vars_);\n double offset = get<value_double, keys::offset>(sym_, feature_, common_.vars_);\n double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym_, feature_, common_.vars_);\n double smooth = get<value_double, keys::smooth>(sym_, feature_, common_.vars_);\n\n \/\/ https:\/\/github.com\/mapnik\/mapnik\/issues\/1316\n bool snap_to_pixels = !mapnik::marker_cache::instance().is_uri(filename_);\n\n agg::trans_affine geom_tr;\n auto transform = get_optional<transform_type>(sym_, keys::geometry_transform);\n if (transform) evaluate_transform(geom_tr, feature_, common_.vars_, *transform, common_.scale_factor_);\n agg::trans_affine image_tr = agg::trans_affine_scaling(common_.scale_factor_);\n\n boost::optional<svg_path_ptr> const& stock_vector_marker = mark.get_data();\n\n \/\/ special case for simple ellipse markers\n \/\/ to allow for full control over rx\/ry dimensions\n if (filename_ == \"shape:\/\/ellipse\"\n && (has_key(sym_,keys::width) || has_key(sym_,keys::height)))\n {\n svg_path_ptr marker_ellipse = std::make_shared<svg_storage_type>();\n vertex_stl_adapter<svg_path_storage> stl_storage(marker_ellipse->source());\n svg_path_adapter svg_path(stl_storage);\n build_ellipse(sym_, feature_, common_.vars_, *marker_ellipse, svg_path);\n svg_attribute_type attributes;\n bool result = push_explicit_style( (*stock_vector_marker)->attributes(), attributes, sym_, feature_, common_.vars_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n vector_dispatch_type rasterizer_dispatch(marker_ellipse,\n svg_path,\n result ? attributes : (*stock_vector_marker)->attributes(),\n image_tr,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n snap_to_pixels,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<vector_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString)\n converter.template set<clip_line_tag>();\n }\n\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n else\n {\n box2d<double> const& bbox = mark.bounding_box();\n setup_transform_scaling(image_tr, bbox.width(), bbox.height(), feature_, common_.vars_, sym_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n vertex_stl_adapter<svg_path_storage> stl_storage((*stock_vector_marker)->source());\n svg_path_adapter svg_path(stl_storage);\n svg_attribute_type attributes;\n bool result = push_explicit_style( (*stock_vector_marker)->attributes(), attributes, sym_, feature_, common_.vars_);\n vector_dispatch_type rasterizer_dispatch(*stock_vector_marker,\n svg_path,\n result ? attributes : (*stock_vector_marker)->attributes(),\n image_tr,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n snap_to_pixels,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<vector_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString)\n converter.template set<clip_line_tag>();\n }\n\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n }\n\n void operator() (marker_rgba8 const& mark)\n {\n using namespace mapnik::svg;\n bool clip = get<value_bool, keys::clip>(sym_, feature_, common_.vars_);\n double offset = get<value_double, keys::offset>(sym_, feature_, common_.vars_);\n double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym_, feature_, common_.vars_);\n double smooth = get<value_double, keys::smooth>(sym_, feature_, common_.vars_);\n\n agg::trans_affine geom_tr;\n auto transform = get_optional<transform_type>(sym_, keys::geometry_transform);\n if (transform) evaluate_transform(geom_tr, feature_, common_.vars_, *transform, common_.scale_factor_);\n agg::trans_affine image_tr = agg::trans_affine_scaling(common_.scale_factor_);\n\n setup_transform_scaling(image_tr, mark.width(), mark.height(), feature_, common_.vars_, sym_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n box2d<double> const& bbox = mark.bounding_box();\n mapnik::image_rgba8 const& marker = mark.get_data();\n \/\/ - clamp sizes to > 4 pixels of interactivity\n coord2d center = bbox.center();\n agg::trans_affine_translation recenter(-center.x, -center.y);\n agg::trans_affine marker_trans = recenter * image_tr;\n raster_dispatch_type rasterizer_dispatch(marker,\n marker_trans,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<raster_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString)\n converter.template set<clip_line_tag>();\n }\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n\n private:\n std::string const& filename_;\n markers_symbolizer const& sym_;\n mapnik::feature_impl & feature_;\n proj_transform const& prj_trans_;\n RendererType const& common_;\n box2d<double> const& clip_box_;\n ContextType const& renderer_context_;\n};\n\ntemplate <typename VD, typename RD, typename RendererType, typename ContextType>\nvoid render_markers_symbolizer(markers_symbolizer const& sym,\n mapnik::feature_impl & feature,\n proj_transform const& prj_trans,\n RendererType const& common,\n box2d<double> const& clip_box,\n ContextType const& renderer_context)\n{\n using namespace mapnik::svg;\n std::string filename = get<std::string>(sym, keys::file, feature, common.vars_, \"shape:\/\/ellipse\");\n if (!filename.empty())\n {\n mapnik::marker const& mark = mapnik::marker_cache::instance().find(filename, true);\n render_marker_symbolizer_visitor<VD,RD,RendererType,ContextType> visitor(filename,\n sym,\n feature,\n prj_trans,\n common,\n clip_box,\n renderer_context);\n util::apply_visitor(visitor, mark);\n }\n}\n\n} \/\/ namespace mapnik\n\n#endif \/\/ MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n<commit_msg>visual tests : fix marker-on-hex-grid<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n#ifndef MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n#define MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n\n#include <mapnik\/renderer_common.hpp>\n#include <mapnik\/svg\/svg_storage.hpp>\n#include <mapnik\/svg\/svg_path_adapter.hpp>\n#include <mapnik\/vertex_converters.hpp>\n#include <mapnik\/marker_cache.hpp>\n#include <mapnik\/marker_helpers.hpp>\n#include <mapnik\/geometry_type.hpp>\n\nnamespace mapnik {\n\ntemplate <typename VD, typename RD, typename RendererType, typename ContextType>\nstruct render_marker_symbolizer_visitor\n{\n using vector_dispatch_type = VD;\n using raster_dispatch_type = RD;\n using buffer_type = typename std::tuple_element<0,ContextType>::type;\n\n render_marker_symbolizer_visitor(std::string const& filename,\n markers_symbolizer const& sym,\n mapnik::feature_impl & feature,\n proj_transform const& prj_trans,\n RendererType const& common,\n box2d<double> const& clip_box,\n ContextType const& renderer_context)\n : filename_(filename),\n sym_(sym),\n feature_(feature),\n prj_trans_(prj_trans),\n common_(common),\n clip_box_(clip_box),\n renderer_context_(renderer_context) {}\n\n void operator() (marker_null const&) {}\n\n void operator() (marker_svg const& mark)\n {\n using namespace mapnik::svg;\n bool clip = get<value_bool, keys::clip>(sym_, feature_, common_.vars_);\n double offset = get<value_double, keys::offset>(sym_, feature_, common_.vars_);\n double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym_, feature_, common_.vars_);\n double smooth = get<value_double, keys::smooth>(sym_, feature_, common_.vars_);\n\n \/\/ https:\/\/github.com\/mapnik\/mapnik\/issues\/1316\n bool snap_to_pixels = !mapnik::marker_cache::instance().is_uri(filename_);\n\n agg::trans_affine geom_tr;\n auto transform = get_optional<transform_type>(sym_, keys::geometry_transform);\n if (transform) evaluate_transform(geom_tr, feature_, common_.vars_, *transform, common_.scale_factor_);\n agg::trans_affine image_tr = agg::trans_affine_scaling(common_.scale_factor_);\n\n boost::optional<svg_path_ptr> const& stock_vector_marker = mark.get_data();\n\n \/\/ special case for simple ellipse markers\n \/\/ to allow for full control over rx\/ry dimensions\n if (filename_ == \"shape:\/\/ellipse\"\n && (has_key(sym_,keys::width) || has_key(sym_,keys::height)))\n {\n svg_path_ptr marker_ellipse = std::make_shared<svg_storage_type>();\n vertex_stl_adapter<svg_path_storage> stl_storage(marker_ellipse->source());\n svg_path_adapter svg_path(stl_storage);\n build_ellipse(sym_, feature_, common_.vars_, *marker_ellipse, svg_path);\n svg_attribute_type attributes;\n bool result = push_explicit_style( (*stock_vector_marker)->attributes(), attributes, sym_, feature_, common_.vars_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n vector_dispatch_type rasterizer_dispatch(marker_ellipse,\n svg_path,\n result ? attributes : (*stock_vector_marker)->attributes(),\n image_tr,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n snap_to_pixels,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<vector_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString)\n converter.template set<clip_line_tag>();\n }\n\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n else\n {\n box2d<double> const& bbox = mark.bounding_box();\n setup_transform_scaling(image_tr, bbox.width(), bbox.height(), feature_, common_.vars_, sym_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n vertex_stl_adapter<svg_path_storage> stl_storage((*stock_vector_marker)->source());\n svg_path_adapter svg_path(stl_storage);\n svg_attribute_type attributes;\n bool result = push_explicit_style( (*stock_vector_marker)->attributes(), attributes, sym_, feature_, common_.vars_);\n vector_dispatch_type rasterizer_dispatch(*stock_vector_marker,\n svg_path,\n result ? attributes : (*stock_vector_marker)->attributes(),\n image_tr,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n snap_to_pixels,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<vector_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon || type == geometry::geometry_types::MultiPolygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString || type == geometry::geometry_types::MultiLineString)\n converter.template set<clip_line_tag>();\n }\n\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n }\n\n void operator() (marker_rgba8 const& mark)\n {\n using namespace mapnik::svg;\n bool clip = get<value_bool, keys::clip>(sym_, feature_, common_.vars_);\n double offset = get<value_double, keys::offset>(sym_, feature_, common_.vars_);\n double simplify_tolerance = get<value_double, keys::simplify_tolerance>(sym_, feature_, common_.vars_);\n double smooth = get<value_double, keys::smooth>(sym_, feature_, common_.vars_);\n\n agg::trans_affine geom_tr;\n auto transform = get_optional<transform_type>(sym_, keys::geometry_transform);\n if (transform) evaluate_transform(geom_tr, feature_, common_.vars_, *transform, common_.scale_factor_);\n agg::trans_affine image_tr = agg::trans_affine_scaling(common_.scale_factor_);\n\n setup_transform_scaling(image_tr, mark.width(), mark.height(), feature_, common_.vars_, sym_);\n auto image_transform = get_optional<transform_type>(sym_, keys::image_transform);\n if (image_transform) evaluate_transform(image_tr, feature_, common_.vars_, *image_transform);\n box2d<double> const& bbox = mark.bounding_box();\n mapnik::image_rgba8 const& marker = mark.get_data();\n \/\/ - clamp sizes to > 4 pixels of interactivity\n coord2d center = bbox.center();\n agg::trans_affine_translation recenter(-center.x, -center.y);\n agg::trans_affine marker_trans = recenter * image_tr;\n raster_dispatch_type rasterizer_dispatch(marker,\n marker_trans,\n sym_,\n *common_.detector_,\n common_.scale_factor_,\n feature_,\n common_.vars_,\n renderer_context_);\n\n using vertex_converter_type = vertex_converter<raster_dispatch_type,clip_line_tag,\n clip_poly_tag,\n transform_tag,\n affine_transform_tag,\n simplify_tag, smooth_tag,\n offset_transform_tag>;\n vertex_converter_type converter(clip_box_,\n rasterizer_dispatch,\n sym_,\n common_.t_,\n prj_trans_,\n geom_tr,\n feature_,\n common_.vars_,\n common_.scale_factor_);\n\n if (clip) \/\/ optional clip (default: true)\n {\n geometry::geometry_types type = geometry::geometry_type(feature_.get_geometry());\n if (type == geometry::geometry_types::Polygon)\n converter.template set<clip_poly_tag>();\n else if (type == geometry::geometry_types::LineString)\n converter.template set<clip_line_tag>();\n }\n converter.template set<transform_tag>(); \/\/always transform\n if (std::fabs(offset) > 0.0) converter.template set<offset_transform_tag>(); \/\/ parallel offset\n converter.template set<affine_transform_tag>(); \/\/ optional affine transform\n if (simplify_tolerance > 0.0) converter.template set<simplify_tag>(); \/\/ optional simplify converter\n if (smooth > 0.0) converter.template set<smooth_tag>(); \/\/ optional smooth converter\n apply_markers_multi(feature_, common_.vars_, converter, sym_);\n }\n\n private:\n std::string const& filename_;\n markers_symbolizer const& sym_;\n mapnik::feature_impl & feature_;\n proj_transform const& prj_trans_;\n RendererType const& common_;\n box2d<double> const& clip_box_;\n ContextType const& renderer_context_;\n};\n\ntemplate <typename VD, typename RD, typename RendererType, typename ContextType>\nvoid render_markers_symbolizer(markers_symbolizer const& sym,\n mapnik::feature_impl & feature,\n proj_transform const& prj_trans,\n RendererType const& common,\n box2d<double> const& clip_box,\n ContextType const& renderer_context)\n{\n using namespace mapnik::svg;\n std::string filename = get<std::string>(sym, keys::file, feature, common.vars_, \"shape:\/\/ellipse\");\n if (!filename.empty())\n {\n mapnik::marker const& mark = mapnik::marker_cache::instance().find(filename, true);\n render_marker_symbolizer_visitor<VD,RD,RendererType,ContextType> visitor(filename,\n sym,\n feature,\n prj_trans,\n common,\n clip_box,\n renderer_context);\n util::apply_visitor(visitor, mark);\n }\n}\n\n} \/\/ namespace mapnik\n\n#endif \/\/ MAPNIK_RENDERER_COMMON_PROCESS_MARKERS_SYMBOLIZER_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008 Red Hat, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"condor_common.h\"\n\n#include \"ClassAdReevaluator.h\"\n\n#include \"condor_classad.h\"\n#include \"string_list.h\"\n#include \"MyString.h\"\n#include \"condor_debug.h\"\n\nbool\nclassad_reevaluate(ClassAd *ad, const ClassAd *context)\n{\n\tStringList *reevaluate_attrs;\n\tMyString stmp;\n\tchar *ptmp, *atmp, *ntmp = NULL;\n\tExprTree *etmp;\n\tint itmp;\n\tfloat ftmp;\n\t\n\tif (!ad->LookupString(\"REEVALUATE_ATTRIBUTES\", &ptmp)) {\n\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\"classad_reevaluate: REEVALUATE_ATTRIBUTES not defined, skipping\\n\");\n\n\t\treturn true;\n\t}\n\n\treevaluate_attrs = new StringList(ptmp);\n\tif (!reevaluate_attrs) {\n\t\tdprintf(D_ALWAYS,\n\t\t\t\t\"classad_reevaluate: Failed to parse REEVALUATE_ATTRS: %s\\n\",\n\t\t\t\tptmp);\n\n\t\tgoto FAIL;\n\t}\n\n\tfree(ptmp);\n\tptmp = NULL;\n\n\treevaluate_attrs->rewind();\n\twhile (NULL != (atmp = reevaluate_attrs->next())) {\n\t\tstmp.sprintf(\"REEVALUATE_%s_EXPR\", atmp);\n\n\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\"classad_reevaluate: Attempting reevaluate %s with %s\\n\",\n\t\t\t\tatmp, stmp.Value());\n\n\t\tetmp = ad->LookupExpr(atmp);\n\t\tif (!etmp) {\n\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\"classad_reevaluate: %s does not exist in ad, returning\\n\",\n\t\t\t\t\tatmp);\n\n\t\t\tgoto FAIL;\n\t\t}\n\n\t\tswitch (etmp->MyType()) {\n\t\tcase LX_STRING:\n\t\t\tif (!ad->EvalString(stmp.Value(), context, &ntmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a String\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, ntmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %s to %s\\n\",\n\t\t\t\t\t\tntmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %s\\n\",\n\t\t\t\t\tatmp, ntmp);\n\n\t\t\tfree(ntmp);\n\t\t\tntmp = NULL;\n\n\t\t\tbreak;\n\t\tcase LX_INTEGER:\n\t\t\tif (!ad->EvalInteger(stmp.Value(), context, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as an Integer\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %d to %s\\n\",\n\t\t\t\t\t\titmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %d\\n\",\n\t\t\t\t\tatmp, itmp);\n\n\t\t\tbreak;\n\t\tcase LX_FLOAT:\n\t\t\tif (!ad->EvalFloat(stmp.Value(), context, ftmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a Float\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, ftmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %f to %s\\n\",\n\t\t\t\t\t\tftmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %f\\n\",\n\t\t\t\t\tatmp, ftmp);\n\n\t\t\tbreak;\n\t\tcase LX_BOOL:\n\t\t\tif (!ad->EvalBool(stmp.Value(), context, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a Bool\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, (itmp ? true : false))) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %d to %s\\n\",\n\t\t\t\t\t\titmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %d\\n\",\n\t\t\t\t\tatmp, itmp);\n\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\"classad_reevaluate: %s has unsupported type %d\\n, cannot reevaluate\\n\",\n\t\t\t\t\tatmp, etmp->MyType());\n\t\t}\n\t}\n\n\tdelete reevaluate_attrs;\n\n\treturn true;\n\n FAIL:\n\n\tif (reevaluate_attrs) delete reevaluate_attrs;\n\tif (ntmp) free(ntmp);\n\n\treturn false;\n}\n<commit_msg>Remove usage of ExprTree::MyType() in classad_reevaluate(). #619<commit_after>\/*\n * Copyright 2008 Red Hat, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"condor_common.h\"\n\n#include \"ClassAdReevaluator.h\"\n\n#include \"condor_classad.h\"\n#include \"string_list.h\"\n#include \"MyString.h\"\n#include \"condor_debug.h\"\n\nbool\nclassad_reevaluate(ClassAd *ad, const ClassAd *context)\n{\n\tStringList *reevaluate_attrs;\n\tMyString stmp;\n\tchar *ptmp, *atmp, *ntmp = NULL;\n\tExprTree *etmp;\n\tint itmp;\n\tfloat ftmp;\n\t\n\tif (!ad->LookupString(\"REEVALUATE_ATTRIBUTES\", &ptmp)) {\n\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\"classad_reevaluate: REEVALUATE_ATTRIBUTES not defined, skipping\\n\");\n\n\t\treturn true;\n\t}\n\n\treevaluate_attrs = new StringList(ptmp);\n\tif (!reevaluate_attrs) {\n\t\tdprintf(D_ALWAYS,\n\t\t\t\t\"classad_reevaluate: Failed to parse REEVALUATE_ATTRS: %s\\n\",\n\t\t\t\tptmp);\n\n\t\tgoto FAIL;\n\t}\n\n\tfree(ptmp);\n\tptmp = NULL;\n\n\treevaluate_attrs->rewind();\n\twhile (NULL != (atmp = reevaluate_attrs->next())) {\n\t\tstmp.sprintf(\"REEVALUATE_%s_EXPR\", atmp);\n\n\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\"classad_reevaluate: Attempting reevaluate %s with %s\\n\",\n\t\t\t\tatmp, stmp.Value());\n\n\t\tetmp = ad->LookupExpr(atmp);\n\t\tif (!etmp) {\n\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\"classad_reevaluate: %s does not exist in ad, returning\\n\",\n\t\t\t\t\tatmp);\n\n\t\t\tgoto FAIL;\n\t\t}\n\n\t\tif ( ad->LookupString(atmp, &ntmp) ) {\n\t\t\tfree(ntmp);\n\t\t\tntmp = NULL;\n\n\t\t\tif (!ad->EvalString(stmp.Value(), context, &ntmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a String\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, ntmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %s to %s\\n\",\n\t\t\t\t\t\tntmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %s\\n\",\n\t\t\t\t\tatmp, ntmp);\n\n\t\t\tfree(ntmp);\n\t\t\tntmp = NULL;\n\n\t\t} else if ( ad->LookupInteger(atmp, itmp) ) {\n\n\t\t\tif (!ad->EvalInteger(stmp.Value(), context, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as an Integer\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %d to %s\\n\",\n\t\t\t\t\t\titmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %d\\n\",\n\t\t\t\t\tatmp, itmp);\n\n\t\t} else if ( ad->LookupFloat(atmp, ftmp) ) {\n\n\t\t\tif (!ad->EvalFloat(stmp.Value(), context, ftmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a Float\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, ftmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %f to %s\\n\",\n\t\t\t\t\t\tftmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %f\\n\",\n\t\t\t\t\tatmp, ftmp);\n\n\t\t} else if ( ad->LookupBool(atmp, itmp) ) {\n\n\t\t\tif (!ad->EvalBool(stmp.Value(), context, itmp)) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to evaluate %s as a Bool\\n\",\n\t\t\t\t\t\tstmp.Value());\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tif (!ad->Assign(atmp, (itmp ? true : false))) {\n\t\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\t\"classad_reevaluate: Failed to assign new value %d to %s\\n\",\n\t\t\t\t\t\titmp, atmp);\n\n\t\t\t\tgoto FAIL;\n\t\t\t}\n\n\t\t\tdprintf(D_FULLDEBUG,\n\t\t\t\t\t\"classad_reevaluate: Updated %s to %d\\n\",\n\t\t\t\t\tatmp, itmp);\n\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS,\n\t\t\t\t\t\"classad_reevaluate: %s has an unsupported type\\n, cannot reevaluate\\n\",\n\t\t\t\t\tatmp);\n\t\t}\n\t}\n\n\tdelete reevaluate_attrs;\n\n\treturn true;\n\n FAIL:\n\n\tif (reevaluate_attrs) delete reevaluate_attrs;\n\tif (ntmp) free(ntmp);\n\n\treturn false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"ListHookedConsumer.hpp\"\n#include \"ListHookedKeyboard.hpp\"\n#include \"ListHookedPointing.hpp\"\n#include \"PressDownKeys.hpp\"\n#include \"RemapClass.hpp\"\n#include \"VirtualKey.hpp\"\n#include \"VK_IOHIDPOSTEVENT.hpp\"\n\nnamespace org_pqrs_Karabiner {\n List* EventOutputQueue::queue_ = NULL;\n TimerWrapper EventOutputQueue::fire_timer_;\n Buttons EventOutputQueue::previousButtons_;\n\n void\n EventOutputQueue::initialize(IOWorkLoop& workloop)\n {\n queue_ = new List();\n fire_timer_.initialize(&workloop, NULL, EventOutputQueue::fire_timer_callback);\n }\n\n void\n EventOutputQueue::terminate(void)\n {\n fire_timer_.terminate();\n\n if (queue_) {\n delete queue_;\n }\n }\n\n \/\/ ----------------------------------------------------------------------\n#define PUSH_TO_OUTPUTQUEUE { \\\n if (! queue_) return; \\\n \\\n queue_->push_back(new Item(p)); \\\n fire_timer_.setTimeoutMS(0, false); \\\n}\n void EventOutputQueue::push(const Params_KeyboardEventCallBack& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.eventType == EventType::DOWN) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_KeyboardSpecialEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.ex_iskeydown) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_RelativePointerEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.buttons != Buttons(0)) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_ScrollWheelEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n void EventOutputQueue::push(const Params_Wait& p) {\n PUSH_TO_OUTPUTQUEUE;\n }\n#undef PUSH_TO_OUTPUTQUEUE\n\n \/\/ ----------------------------------------------------------------------\n unsigned int\n EventOutputQueue::calcDelay(const ParamsUnion& paramsUnion)\n {\n \/\/ ----------------------------------------\n {\n \/\/ Delay before and after modifier\n \/\/\n \/\/ We need to wait before and after a modifier event because\n \/\/ events will be dropped by window server if\n \/\/ we send a mouse click event and a modifier event at the same time.\n \/\/\n \/\/ For example, change middle click to command-left click by this autogen.\n \/\/ We need to put a wait on this setting in Mail.app.\n \/\/ <autogen>\n \/\/ __KeyToKey__\n \/\/ PointingButton::MIDDLE, ModifierFlag::NONE,\n \/\/ PointingButton::LEFT, ModifierFlag::COMMAND_L,\n \/\/ <\/autogen>\n \/\/\n if (paramsUnion.isModifier()) {\n return Config::get_wait_before_and_after_a_modifier_key_event();\n }\n }\n\n \/\/ ----------------------------------------\n {\n \/\/ Delay before and after modifier\n \/\/\n \/\/ We need to wait before and after a pointing device click event because\n \/\/ events will be dropped by processes (eg. NetBeans) if\n \/\/ we send press button event and release button event at the same time.\n \/\/\n\n Params_RelativePointerEventCallback* params = paramsUnion.get_Params_RelativePointerEventCallback();\n if (params) {\n if (params->buttons != previousButtons_) {\n previousButtons_ = params->buttons;\n return Config::get_wait_before_and_after_a_click_event();\n }\n }\n }\n\n \/\/ ----------------------------------------\n return 0;\n }\n\n namespace {\n unsigned int maxDelay(unsigned int v1, unsigned int v2) {\n if (v1 > v2) {\n return v1;\n } else {\n return v2;\n }\n }\n }\n\n void\n EventOutputQueue::fire_timer_callback(OSObject* \/* owner *\/, IOTimerEventSource* \/* sender *\/)\n {\n if (! queue_) return;\n\n \/\/ IOLOG_DEVEL(\"EventOutputQueue::fire queue_->size = %d\\n\", static_cast<int>(queue_->size()));\n\n Item* p = static_cast<Item*>(queue_->front());\n if (! p) return;\n\n \/\/ Delay after modifier or click.\n unsigned int delay = calcDelay(p->params);\n\n \/\/ ----------------------------------------\n switch ((p->params).type) {\n case ParamsUnion::KEYBOARD:\n {\n Params_KeyboardEventCallBack* params = (p->params).get_Params_KeyboardEventCallBack();\n if (params) {\n bool handled = VirtualKey::handleAfterEnqueued(*params);\n if (! handled) {\n ListHookedKeyboard::instance().apply(*params);\n }\n }\n\n \/\/ We need to wait at least 3ms in order to avoid changing key sequence order randomly.\n \/\/ (If VMware Fusion's driver is installed, the wrong order issue will be happen.)\n delay = maxDelay(delay, 3);\n break;\n }\n case ParamsUnion::KEYBOARD_SPECIAL:\n {\n Params_KeyboardSpecialEventCallback* params = (p->params).get_Params_KeyboardSpecialEventCallback();\n if (params) {\n if (! ListHookedConsumer::instance().apply(*params)) {\n \/\/ If there is no consumer device, we send an event as a software key.\n VirtualKey::VK_IOHIDPOSTEVENT::post(*params);\n }\n }\n\n \/\/ We need to wait at least 3ms in order to avoid changing key sequence order randomly.\n \/\/ (If VMware Fusion's driver is installed, the wrong order issue will be happen.)\n delay = maxDelay(delay, 3);\n break;\n }\n case ParamsUnion::RELATIVE_POINTER:\n {\n Params_RelativePointerEventCallback* params = (p->params).get_Params_RelativePointerEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::SCROLL_WHEEL:\n {\n Params_ScrollWheelEventCallback* params = (p->params).get_Params_ScrollWheelEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::WAIT:\n {\n Params_Wait* params = (p->params).get_Params_Wait();\n if (params) {\n delay = maxDelay(delay, static_cast<unsigned int>(params->milliseconds));\n }\n break;\n }\n case ParamsUnion::UPDATE_FLAGS:\n \/\/ do nothing\n break;\n }\n\n queue_->pop_front();\n\n \/\/ ----------------------------------------\n \/\/ Set timeout for next event.\n\n \/\/ Delay before modifier and click.\n Item* next = static_cast<Item*>(queue_->front());\n if (! next) return;\n delay = maxDelay(delay, calcDelay(next->params));\n\n fire_timer_.setTimeoutMS(delay);\n }\n\n \/\/ ======================================================================\n Flags EventOutputQueue::FireModifiers::lastFlags_(0);\n\n void\n EventOutputQueue::FireModifiers::fire(Flags toFlags, KeyboardType keyboardType)\n {\n if (lastFlags_ == toFlags) return;\n\n \/\/ ------------------------------------------------------------\n \/\/ At first we handle KeyUp events and handle KeyDown events next.\n \/\/ We need to end KeyDown at Command+Space to Option_L+Shift_L.\n \/\/\n \/\/ When Option_L+Shift_L has a meaning (switch input language at Windows),\n \/\/ it does not works well when the last is KeyUp of Command.\n\n \/\/ ------------------------------------------------------------\n \/\/ KeyUp\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! lastFlags_.isOn(flag)) continue;\n if (toFlags.isOn(flag)) continue;\n\n lastFlags_.remove(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n \/\/ KeyDown\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! toFlags.isOn(flag)) continue;\n if (lastFlags_.isOn(flag)) continue;\n\n lastFlags_.add(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n lastFlags_ = toFlags;\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireKey::fire(const Params_KeyboardEventCallBack& params)\n {\n if (VirtualKey::handle(params)) return;\n\n \/\/ ------------------------------------------------------------\n KeyCode newkeycode = params.key;\n Flags newflags = params.flags;\n\n KeyCode::reverseNormalizeKey(newkeycode, newflags, params.eventType, params.keyboardType);\n\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (newkeycode == KeyCode::VK_NONE ||\n newkeycode == KeyCode::VK_PSEUDO_KEY) {\n return;\n }\n if (newkeycode.isModifier() && newkeycode.getModifierFlag().getRawBits() == 0) {\n \/\/ virtual modifiers.\n return;\n }\n\n FireModifiers::fire(newflags, params.keyboardType);\n\n if (params.eventType == EventType::DOWN || params.eventType == EventType::UP) {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(params.eventType, newflags, newkeycode,\n params.charCode, params.charSet, params.origCharCode, params.origCharSet,\n params.keyboardType, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n\n if (! params.repeat) {\n if (params.eventType == EventType::DOWN) {\n PressDownKeys::add(newkeycode, params.keyboardType);\n } else {\n PressDownKeys::remove(newkeycode, params.keyboardType);\n }\n }\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireConsumer::fire(const Params_KeyboardSpecialEventCallback& params)\n {\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (params.key == ConsumerKeyCode::VK_NONE ||\n params.key == ConsumerKeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire();\n\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(params.eventType, params.flags, params.key, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n }\n\n \/\/ ======================================================================\n Buttons EventOutputQueue::FireRelativePointer::lastButtons_(0);\n\n void\n EventOutputQueue::FireRelativePointer::fire(Buttons toButtons, int dx, int dy)\n {\n \/\/ When changing space to command+left click,\n \/\/ __KeyToKey__ KeyCode::SPACE, PointingButton::LEFT, ModifierFlag::COMMAND_L\n \/\/\n \/\/ We need to release command key after left click was released as follows.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) MouseUp Left\n \/\/ (4) KeyUp Command_L\n \/\/\n \/\/ For mouse drag support, command modifier is increased as normal (not temporary_increase).\n \/\/ Therefore, command modifier is decreased when space key is released.\n \/\/ If we call FireModifiers::fire() at the begining of this function,\n \/\/ input events are fired as follows order.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) KeyUp Command_L\n \/\/ (4) MouseUp Left\n \/\/\n \/\/ It's not desired order.\n \/\/ So, we call FireModifiers::fire() at the end of this function when button is released.\n\n Buttons releasedButtons = lastButtons_;\n releasedButtons.remove(toButtons);\n bool isButtonReleased = ! releasedButtons.isNONE();\n\n if (! isButtonReleased) {\n FireModifiers::fire();\n }\n\n \/\/ Sending button event\n if (lastButtons_ != toButtons) {\n lastButtons_ = toButtons;\n\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, 0, 0, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n \/\/ Sending cursor\n if (dx != 0 || dy != 0) {\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, dx, dy, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n if (isButtonReleased) {\n FireModifiers::fire();\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireScrollWheel::fire(const Params_ScrollWheelEventCallback& params)\n {\n FireModifiers::fire();\n EventOutputQueue::push(params);\n }\n\n void\n EventOutputQueue::FireScrollWheel::fire(int delta1, int delta2)\n {\n short deltaAxis1;\n short deltaAxis2;\n IOFixed fixedDelta1;\n IOFixed fixedDelta2;\n SInt32 pointDelta1;\n SInt32 pointDelta2;\n\n int relative2scroll_rate = Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_pointing_relative2scroll_rate);\n\n deltaAxis1 = (delta1 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n deltaAxis2 = (delta2 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n fixedDelta1 = (delta1 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n fixedDelta2 = (delta2 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n pointDelta1 = (delta1 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n pointDelta2 = (delta2 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n \/\/ see IOHIDSystem\/IOHIDevicePrivateKeys.h about options.\n const int kScrollTypeContinuous_ = 0x0001;\n int options = kScrollTypeContinuous_;\n\n Params_ScrollWheelEventCallback::auto_ptr ptr(Params_ScrollWheelEventCallback::alloc(deltaAxis1, deltaAxis2, 0,\n fixedDelta1, fixedDelta2, 0,\n pointDelta1, pointDelta2, 0,\n options));\n if (! ptr) return;\n EventOutputQueue::FireScrollWheel::fire(*ptr);\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireWait::fire(const Params_Wait& params)\n {\n EventOutputQueue::push(params);\n }\n}\n<commit_msg>revert min delay (-> 1ms)<commit_after>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"ListHookedConsumer.hpp\"\n#include \"ListHookedKeyboard.hpp\"\n#include \"ListHookedPointing.hpp\"\n#include \"PressDownKeys.hpp\"\n#include \"RemapClass.hpp\"\n#include \"VirtualKey.hpp\"\n#include \"VK_IOHIDPOSTEVENT.hpp\"\n\nnamespace org_pqrs_Karabiner {\n List* EventOutputQueue::queue_ = NULL;\n TimerWrapper EventOutputQueue::fire_timer_;\n Buttons EventOutputQueue::previousButtons_;\n\n void\n EventOutputQueue::initialize(IOWorkLoop& workloop)\n {\n queue_ = new List();\n fire_timer_.initialize(&workloop, NULL, EventOutputQueue::fire_timer_callback);\n }\n\n void\n EventOutputQueue::terminate(void)\n {\n fire_timer_.terminate();\n\n if (queue_) {\n delete queue_;\n }\n }\n\n \/\/ ----------------------------------------------------------------------\n#define PUSH_TO_OUTPUTQUEUE { \\\n if (! queue_) return; \\\n \\\n queue_->push_back(new Item(p)); \\\n fire_timer_.setTimeoutMS(0, false); \\\n}\n void EventOutputQueue::push(const Params_KeyboardEventCallBack& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.eventType == EventType::DOWN) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_KeyboardSpecialEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.ex_iskeydown) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_RelativePointerEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.buttons != Buttons(0)) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_ScrollWheelEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n void EventOutputQueue::push(const Params_Wait& p) {\n PUSH_TO_OUTPUTQUEUE;\n }\n#undef PUSH_TO_OUTPUTQUEUE\n\n \/\/ ----------------------------------------------------------------------\n unsigned int\n EventOutputQueue::calcDelay(const ParamsUnion& paramsUnion)\n {\n \/\/ ----------------------------------------\n {\n \/\/ Delay before and after modifier\n \/\/\n \/\/ We need to wait before and after a modifier event because\n \/\/ events will be dropped by window server if\n \/\/ we send a mouse click event and a modifier event at the same time.\n \/\/\n \/\/ For example, change middle click to command-left click by this autogen.\n \/\/ We need to put a wait on this setting in Mail.app.\n \/\/ <autogen>\n \/\/ __KeyToKey__\n \/\/ PointingButton::MIDDLE, ModifierFlag::NONE,\n \/\/ PointingButton::LEFT, ModifierFlag::COMMAND_L,\n \/\/ <\/autogen>\n \/\/\n if (paramsUnion.isModifier()) {\n return Config::get_wait_before_and_after_a_modifier_key_event();\n }\n }\n\n \/\/ ----------------------------------------\n {\n \/\/ Delay before and after modifier\n \/\/\n \/\/ We need to wait before and after a pointing device click event because\n \/\/ events will be dropped by processes (eg. NetBeans) if\n \/\/ we send press button event and release button event at the same time.\n \/\/\n\n Params_RelativePointerEventCallback* params = paramsUnion.get_Params_RelativePointerEventCallback();\n if (params) {\n if (params->buttons != previousButtons_) {\n previousButtons_ = params->buttons;\n return Config::get_wait_before_and_after_a_click_event();\n }\n }\n }\n\n \/\/ ----------------------------------------\n return 0;\n }\n\n namespace {\n unsigned int maxDelay(unsigned int v1, unsigned int v2) {\n if (v1 > v2) {\n return v1;\n } else {\n return v2;\n }\n }\n }\n\n void\n EventOutputQueue::fire_timer_callback(OSObject* \/* owner *\/, IOTimerEventSource* \/* sender *\/)\n {\n if (! queue_) return;\n\n \/\/ IOLOG_DEVEL(\"EventOutputQueue::fire queue_->size = %d\\n\", static_cast<int>(queue_->size()));\n\n Item* p = static_cast<Item*>(queue_->front());\n if (! p) return;\n\n \/\/ Delay after modifier or click.\n unsigned int delay = calcDelay(p->params);\n\n \/\/ ----------------------------------------\n switch ((p->params).type) {\n case ParamsUnion::KEYBOARD:\n {\n Params_KeyboardEventCallBack* params = (p->params).get_Params_KeyboardEventCallBack();\n if (params) {\n bool handled = VirtualKey::handleAfterEnqueued(*params);\n if (! handled) {\n ListHookedKeyboard::instance().apply(*params);\n }\n }\n\n \/\/ We need to wait at least 1ms in order to avoid changing key sequence order randomly.\n \/\/ (If VMware Fusion's driver is installed, the wrong order issue will be happen.)\n delay = maxDelay(delay, 1);\n break;\n }\n case ParamsUnion::KEYBOARD_SPECIAL:\n {\n Params_KeyboardSpecialEventCallback* params = (p->params).get_Params_KeyboardSpecialEventCallback();\n if (params) {\n if (! ListHookedConsumer::instance().apply(*params)) {\n \/\/ If there is no consumer device, we send an event as a software key.\n VirtualKey::VK_IOHIDPOSTEVENT::post(*params);\n }\n }\n\n \/\/ We need to wait at least 1ms in order to avoid changing key sequence order randomly.\n \/\/ (If VMware Fusion's driver is installed, the wrong order issue will be happen.)\n delay = maxDelay(delay, 1);\n break;\n }\n case ParamsUnion::RELATIVE_POINTER:\n {\n Params_RelativePointerEventCallback* params = (p->params).get_Params_RelativePointerEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::SCROLL_WHEEL:\n {\n Params_ScrollWheelEventCallback* params = (p->params).get_Params_ScrollWheelEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::WAIT:\n {\n Params_Wait* params = (p->params).get_Params_Wait();\n if (params) {\n delay = maxDelay(delay, static_cast<unsigned int>(params->milliseconds));\n }\n break;\n }\n case ParamsUnion::UPDATE_FLAGS:\n \/\/ do nothing\n break;\n }\n\n queue_->pop_front();\n\n \/\/ ----------------------------------------\n \/\/ Set timeout for next event.\n\n \/\/ Delay before modifier and click.\n Item* next = static_cast<Item*>(queue_->front());\n if (! next) return;\n delay = maxDelay(delay, calcDelay(next->params));\n\n fire_timer_.setTimeoutMS(delay);\n }\n\n \/\/ ======================================================================\n Flags EventOutputQueue::FireModifiers::lastFlags_(0);\n\n void\n EventOutputQueue::FireModifiers::fire(Flags toFlags, KeyboardType keyboardType)\n {\n if (lastFlags_ == toFlags) return;\n\n \/\/ ------------------------------------------------------------\n \/\/ At first we handle KeyUp events and handle KeyDown events next.\n \/\/ We need to end KeyDown at Command+Space to Option_L+Shift_L.\n \/\/\n \/\/ When Option_L+Shift_L has a meaning (switch input language at Windows),\n \/\/ it does not works well when the last is KeyUp of Command.\n\n \/\/ ------------------------------------------------------------\n \/\/ KeyUp\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! lastFlags_.isOn(flag)) continue;\n if (toFlags.isOn(flag)) continue;\n\n lastFlags_.remove(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n \/\/ KeyDown\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! toFlags.isOn(flag)) continue;\n if (lastFlags_.isOn(flag)) continue;\n\n lastFlags_.add(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n lastFlags_ = toFlags;\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireKey::fire(const Params_KeyboardEventCallBack& params)\n {\n if (VirtualKey::handle(params)) return;\n\n \/\/ ------------------------------------------------------------\n KeyCode newkeycode = params.key;\n Flags newflags = params.flags;\n\n KeyCode::reverseNormalizeKey(newkeycode, newflags, params.eventType, params.keyboardType);\n\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (newkeycode == KeyCode::VK_NONE ||\n newkeycode == KeyCode::VK_PSEUDO_KEY) {\n return;\n }\n if (newkeycode.isModifier() && newkeycode.getModifierFlag().getRawBits() == 0) {\n \/\/ virtual modifiers.\n return;\n }\n\n FireModifiers::fire(newflags, params.keyboardType);\n\n if (params.eventType == EventType::DOWN || params.eventType == EventType::UP) {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(params.eventType, newflags, newkeycode,\n params.charCode, params.charSet, params.origCharCode, params.origCharSet,\n params.keyboardType, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n\n if (! params.repeat) {\n if (params.eventType == EventType::DOWN) {\n PressDownKeys::add(newkeycode, params.keyboardType);\n } else {\n PressDownKeys::remove(newkeycode, params.keyboardType);\n }\n }\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireConsumer::fire(const Params_KeyboardSpecialEventCallback& params)\n {\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (params.key == ConsumerKeyCode::VK_NONE ||\n params.key == ConsumerKeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire();\n\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(params.eventType, params.flags, params.key, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n }\n\n \/\/ ======================================================================\n Buttons EventOutputQueue::FireRelativePointer::lastButtons_(0);\n\n void\n EventOutputQueue::FireRelativePointer::fire(Buttons toButtons, int dx, int dy)\n {\n \/\/ When changing space to command+left click,\n \/\/ __KeyToKey__ KeyCode::SPACE, PointingButton::LEFT, ModifierFlag::COMMAND_L\n \/\/\n \/\/ We need to release command key after left click was released as follows.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) MouseUp Left\n \/\/ (4) KeyUp Command_L\n \/\/\n \/\/ For mouse drag support, command modifier is increased as normal (not temporary_increase).\n \/\/ Therefore, command modifier is decreased when space key is released.\n \/\/ If we call FireModifiers::fire() at the begining of this function,\n \/\/ input events are fired as follows order.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) KeyUp Command_L\n \/\/ (4) MouseUp Left\n \/\/\n \/\/ It's not desired order.\n \/\/ So, we call FireModifiers::fire() at the end of this function when button is released.\n\n Buttons releasedButtons = lastButtons_;\n releasedButtons.remove(toButtons);\n bool isButtonReleased = ! releasedButtons.isNONE();\n\n if (! isButtonReleased) {\n FireModifiers::fire();\n }\n\n \/\/ Sending button event\n if (lastButtons_ != toButtons) {\n lastButtons_ = toButtons;\n\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, 0, 0, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n \/\/ Sending cursor\n if (dx != 0 || dy != 0) {\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, dx, dy, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n if (isButtonReleased) {\n FireModifiers::fire();\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireScrollWheel::fire(const Params_ScrollWheelEventCallback& params)\n {\n FireModifiers::fire();\n EventOutputQueue::push(params);\n }\n\n void\n EventOutputQueue::FireScrollWheel::fire(int delta1, int delta2)\n {\n short deltaAxis1;\n short deltaAxis2;\n IOFixed fixedDelta1;\n IOFixed fixedDelta2;\n SInt32 pointDelta1;\n SInt32 pointDelta2;\n\n int relative2scroll_rate = Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_pointing_relative2scroll_rate);\n\n deltaAxis1 = (delta1 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n deltaAxis2 = (delta2 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n fixedDelta1 = (delta1 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n fixedDelta2 = (delta2 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n pointDelta1 = (delta1 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n pointDelta2 = (delta2 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n \/\/ see IOHIDSystem\/IOHIDevicePrivateKeys.h about options.\n const int kScrollTypeContinuous_ = 0x0001;\n int options = kScrollTypeContinuous_;\n\n Params_ScrollWheelEventCallback::auto_ptr ptr(Params_ScrollWheelEventCallback::alloc(deltaAxis1, deltaAxis2, 0,\n fixedDelta1, fixedDelta2, 0,\n pointDelta1, pointDelta2, 0,\n options));\n if (! ptr) return;\n EventOutputQueue::FireScrollWheel::fire(*ptr);\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireWait::fire(const Params_Wait& params)\n {\n EventOutputQueue::push(params);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"ListHookedConsumer.hpp\"\n#include \"ListHookedKeyboard.hpp\"\n#include \"ListHookedPointing.hpp\"\n#include \"PressDownKeys.hpp\"\n#include \"RemapClass.hpp\"\n#include \"VirtualKey.hpp\"\n#include \"VK_IOHIDPOSTEVENT.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n List* EventOutputQueue::queue_ = NULL;\n TimerWrapper EventOutputQueue::fire_timer_;\n\n void\n EventOutputQueue::initialize(IOWorkLoop& workloop)\n {\n queue_ = new List();\n fire_timer_.initialize(&workloop, NULL, EventOutputQueue::fire_timer_callback);\n }\n\n void\n EventOutputQueue::terminate(void)\n {\n fire_timer_.terminate();\n\n if (queue_) {\n delete queue_;\n }\n }\n\n \/\/ ----------------------------------------------------------------------\n#define PUSH_TO_OUTPUTQUEUE { \\\n if (! queue_) return; \\\n \\\n queue_->push_back(new Item(p)); \\\n fire_timer_.setTimeoutMS(DELAY, false); \\\n}\n void EventOutputQueue::push(const Params_KeyboardEventCallBack& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.eventType == EventType::DOWN) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_KeyboardSpecialEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.ex_iskeydown) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_RelativePointerEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.buttons != Buttons(0)) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_ScrollWheelEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n void EventOutputQueue::push(const Params_Wait& p) {\n PUSH_TO_OUTPUTQUEUE;\n }\n#undef PUSH_TO_OUTPUTQUEUE\n\n \/\/ ----------------------------------------------------------------------\n void\n EventOutputQueue::fire_timer_callback(OSObject* \/* owner *\/, IOTimerEventSource* \/* sender *\/)\n {\n if (! queue_) return;\n\n \/\/ IOLOG_DEVEL(\"EventOutputQueue::fire queue_->size = %d\\n\", static_cast<int>(queue_->size()));\n\n Item* p = static_cast<Item*>(queue_->front());\n if (! p) return;\n\n int delay = DELAY;\n\n \/\/ ----------------------------------------\n switch ((p->params).type) {\n case ParamsUnion::KEYBOARD:\n {\n Params_KeyboardEventCallBack* params = (p->params).get_Params_KeyboardEventCallBack();\n if (params) {\n bool handled = VirtualKey::handleAfterEnqueued(*params);\n if (! handled) {\n ListHookedKeyboard::instance().apply(*params);\n }\n delay = Config::get_wait_between_sequential_keys();\n }\n break;\n }\n case ParamsUnion::KEYBOARD_SPECIAL:\n {\n Params_KeyboardSpecialEventCallback* params = (p->params).get_Params_KeyboardSpecialEventCallback();\n if (params) {\n if (! ListHookedConsumer::instance().apply(*params)) {\n \/\/ If there is no consumer device, we send an event as a software key.\n VirtualKey::VK_IOHIDPOSTEVENT::post(*params);\n }\n }\n break;\n }\n case ParamsUnion::RELATIVE_POINTER:\n {\n Params_RelativePointerEventCallback* params = (p->params).get_Params_RelativePointerEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::SCROLL_WHEEL:\n {\n Params_ScrollWheelEventCallback* params = (p->params).get_Params_ScrollWheelEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::WAIT:\n {\n Params_Wait* params = (p->params).get_Params_Wait();\n if (params) {\n delay = params->milliseconds;\n }\n break;\n }\n case ParamsUnion::UPDATE_FLAGS:\n \/\/ do nothing\n break;\n }\n\n queue_->pop_front();\n\n \/\/ ----------------------------------------\n if (! queue_->empty()) {\n fire_timer_.setTimeoutMS(delay);\n }\n }\n\n \/\/ ======================================================================\n Flags EventOutputQueue::FireModifiers::lastFlags_(0);\n\n void\n EventOutputQueue::FireModifiers::fire(Flags toFlags, KeyboardType keyboardType)\n {\n if (lastFlags_ == toFlags) return;\n\n \/\/ ------------------------------------------------------------\n \/\/ At first we handle KeyUp events and handle KeyDown events next.\n \/\/ We need to end KeyDown at Command+Space to Option_L+Shift_L.\n \/\/\n \/\/ When Option_L+Shift_L has a meaning (switch input language at Windows),\n \/\/ it does not works well when the last is KeyUp of Command.\n\n \/\/ ------------------------------------------------------------\n \/\/ KeyUp\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! lastFlags_.isOn(flag)) continue;\n if (toFlags.isOn(flag)) continue;\n\n lastFlags_.remove(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n \/\/ KeyDown\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! toFlags.isOn(flag)) continue;\n if (lastFlags_.isOn(flag)) continue;\n\n lastFlags_.add(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n lastFlags_ = toFlags;\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireKey::fire(const Params_KeyboardEventCallBack& params)\n {\n if (VirtualKey::handle(params)) return;\n\n \/\/ ----------------------------------------\n if (params.key == KeyCode::VK_MODIFIER_EXTRA1 ||\n params.key == KeyCode::VK_MODIFIER_EXTRA2 ||\n params.key == KeyCode::VK_MODIFIER_EXTRA3 ||\n params.key == KeyCode::VK_MODIFIER_EXTRA4 ||\n params.key == KeyCode::VK_MODIFIER_EXTRA5) return;\n\n \/\/ ------------------------------------------------------------\n KeyCode newkeycode = params.key;\n Flags newflags = params.flags;\n\n KeyCode::reverseNormalizeKey(newkeycode, newflags, params.eventType, params.keyboardType);\n\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (newkeycode == KeyCode::VK_NONE ||\n newkeycode == KeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire(newflags, params.keyboardType);\n\n if (params.eventType == EventType::DOWN || params.eventType == EventType::UP) {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(params.eventType, newflags, newkeycode,\n params.charCode, params.charSet, params.origCharCode, params.origCharSet,\n params.keyboardType, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n\n if (! params.repeat) {\n if (params.eventType == EventType::DOWN) {\n PressDownKeys::add(newkeycode, params.keyboardType);\n } else {\n PressDownKeys::remove(newkeycode, params.keyboardType);\n }\n }\n }\n }\n\n void\n EventOutputQueue::FireKey::fire_downup(Flags flags, KeyCode key, KeyboardType keyboardType)\n {\n ModifierFlag f = key.getModifierFlag();\n\n if (f != ModifierFlag::ZERO) {\n FlagStatus::ScopedTemporaryFlagsChanger stfc(FlagStatus::globalFlagStatus(), flags);\n\n \/\/ We operate FlagStatus for the case \"key == KeyCode::CAPSLOCK\".\n FlagStatus::globalFlagStatus().increase(f);\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY,\n FlagStatus::globalFlagStatus().makeFlags(),\n key,\n keyboardType,\n false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n\n FlagStatus::globalFlagStatus().decrease(f);\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY,\n FlagStatus::globalFlagStatus().makeFlags(),\n key,\n keyboardType,\n false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n\n } else {\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::DOWN, flags, key, keyboardType, false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::UP, flags, key, keyboardType, false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireConsumer::fire(const Params_KeyboardSpecialEventCallback& params)\n {\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (params.key == ConsumerKeyCode::VK_NONE ||\n params.key == ConsumerKeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire();\n\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(params.eventType, params.flags, params.key, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n }\n\n void\n EventOutputQueue::FireConsumer::fire_downup(Flags flags, ConsumerKeyCode key)\n {\n {\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(EventType::DOWN,\n flags,\n key,\n false));\n if (! ptr) return;\n FireConsumer::fire(*ptr);\n }\n {\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(EventType::UP,\n flags,\n key,\n false));\n if (! ptr) return;\n FireConsumer::fire(*ptr);\n }\n }\n\n \/\/ ======================================================================\n Buttons EventOutputQueue::FireRelativePointer::lastButtons_(0);\n\n void\n EventOutputQueue::FireRelativePointer::fire(Buttons toButtons, int dx, int dy)\n {\n \/\/ When changing space to command+left click,\n \/\/ __KeyToKey__ KeyCode::SPACE, PointingButton::LEFT, ModifierFlag::COMMAND_L\n \/\/\n \/\/ We need to release command key after left click was released as follows.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) MouseUp Left\n \/\/ (4) KeyUp Command_L\n \/\/\n \/\/ For mouse drag support, command modifier is increased as normal (not temporary_increase).\n \/\/ Therefore, command modifier is decreased when space key is released.\n \/\/ If we call FireModifiers::fire() at the begining of this function,\n \/\/ input events are fired as follows order.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) KeyUp Command_L\n \/\/ (4) MouseUp Left\n \/\/\n \/\/ It's not desired order.\n \/\/ So, we call FireModifiers::fire() at the end of this function when button is released.\n\n Buttons releasedButtons = lastButtons_;\n releasedButtons.remove(toButtons);\n bool isButtonReleased = ! releasedButtons.isNONE();\n\n if (! isButtonReleased) {\n FireModifiers::fire();\n }\n\n \/\/ Sending button event\n if (lastButtons_ != toButtons) {\n lastButtons_ = toButtons;\n\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, 0, 0, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n \/\/ Sending cursor\n if (dx != 0 || dy != 0) {\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, dx, dy, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n if (isButtonReleased) {\n FireModifiers::fire();\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireScrollWheel::fire(const Params_ScrollWheelEventCallback& params)\n {\n FireModifiers::fire();\n EventOutputQueue::push(params);\n }\n\n void\n EventOutputQueue::FireScrollWheel::fire(int delta1, int delta2)\n {\n short deltaAxis1;\n short deltaAxis2;\n IOFixed fixedDelta1;\n IOFixed fixedDelta2;\n SInt32 pointDelta1;\n SInt32 pointDelta2;\n\n int relative2scroll_rate = Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_pointing_relative2scroll_rate);\n\n deltaAxis1 = (delta1 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n deltaAxis2 = (delta2 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n fixedDelta1 = (delta1 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n fixedDelta2 = (delta2 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n pointDelta1 = (delta1 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n pointDelta2 = (delta2 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n \/\/ see IOHIDSystem\/IOHIDevicePrivateKeys.h about options.\n const int kScrollTypeContinuous_ = 0x0001;\n int options = kScrollTypeContinuous_;\n\n Params_ScrollWheelEventCallback::auto_ptr ptr(Params_ScrollWheelEventCallback::alloc(deltaAxis1, deltaAxis2, 0,\n fixedDelta1, fixedDelta2, 0,\n pointDelta1, pointDelta2, 0,\n options));\n if (! ptr) return;\n EventOutputQueue::FireScrollWheel::fire(*ptr);\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireWait::fire(const Params_Wait& params)\n {\n EventOutputQueue::push(params);\n }\n}\n<commit_msg>remvoe VK_MODIFIER_EXTRA1<commit_after>#include \"Config.hpp\"\n#include \"EventOutputQueue.hpp\"\n#include \"ListHookedConsumer.hpp\"\n#include \"ListHookedKeyboard.hpp\"\n#include \"ListHookedPointing.hpp\"\n#include \"PressDownKeys.hpp\"\n#include \"RemapClass.hpp\"\n#include \"VirtualKey.hpp\"\n#include \"VK_IOHIDPOSTEVENT.hpp\"\n\nnamespace org_pqrs_KeyRemap4MacBook {\n List* EventOutputQueue::queue_ = NULL;\n TimerWrapper EventOutputQueue::fire_timer_;\n\n void\n EventOutputQueue::initialize(IOWorkLoop& workloop)\n {\n queue_ = new List();\n fire_timer_.initialize(&workloop, NULL, EventOutputQueue::fire_timer_callback);\n }\n\n void\n EventOutputQueue::terminate(void)\n {\n fire_timer_.terminate();\n\n if (queue_) {\n delete queue_;\n }\n }\n\n \/\/ ----------------------------------------------------------------------\n#define PUSH_TO_OUTPUTQUEUE { \\\n if (! queue_) return; \\\n \\\n queue_->push_back(new Item(p)); \\\n fire_timer_.setTimeoutMS(DELAY, false); \\\n}\n void EventOutputQueue::push(const Params_KeyboardEventCallBack& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.eventType == EventType::DOWN) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_KeyboardSpecialEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.ex_iskeydown) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_RelativePointerEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n if (p.buttons != Buttons(0)) {\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n }\n void EventOutputQueue::push(const Params_ScrollWheelEventCallback& p) {\n PUSH_TO_OUTPUTQUEUE;\n FlagStatus::globalFlagStatus().sticky_clear();\n }\n void EventOutputQueue::push(const Params_Wait& p) {\n PUSH_TO_OUTPUTQUEUE;\n }\n#undef PUSH_TO_OUTPUTQUEUE\n\n \/\/ ----------------------------------------------------------------------\n void\n EventOutputQueue::fire_timer_callback(OSObject* \/* owner *\/, IOTimerEventSource* \/* sender *\/)\n {\n if (! queue_) return;\n\n \/\/ IOLOG_DEVEL(\"EventOutputQueue::fire queue_->size = %d\\n\", static_cast<int>(queue_->size()));\n\n Item* p = static_cast<Item*>(queue_->front());\n if (! p) return;\n\n int delay = DELAY;\n\n \/\/ ----------------------------------------\n switch ((p->params).type) {\n case ParamsUnion::KEYBOARD:\n {\n Params_KeyboardEventCallBack* params = (p->params).get_Params_KeyboardEventCallBack();\n if (params) {\n bool handled = VirtualKey::handleAfterEnqueued(*params);\n if (! handled) {\n ListHookedKeyboard::instance().apply(*params);\n }\n delay = Config::get_wait_between_sequential_keys();\n }\n break;\n }\n case ParamsUnion::KEYBOARD_SPECIAL:\n {\n Params_KeyboardSpecialEventCallback* params = (p->params).get_Params_KeyboardSpecialEventCallback();\n if (params) {\n if (! ListHookedConsumer::instance().apply(*params)) {\n \/\/ If there is no consumer device, we send an event as a software key.\n VirtualKey::VK_IOHIDPOSTEVENT::post(*params);\n }\n }\n break;\n }\n case ParamsUnion::RELATIVE_POINTER:\n {\n Params_RelativePointerEventCallback* params = (p->params).get_Params_RelativePointerEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::SCROLL_WHEEL:\n {\n Params_ScrollWheelEventCallback* params = (p->params).get_Params_ScrollWheelEventCallback();\n if (params) {\n ListHookedPointing::instance().apply(*params);\n }\n break;\n }\n case ParamsUnion::WAIT:\n {\n Params_Wait* params = (p->params).get_Params_Wait();\n if (params) {\n delay = params->milliseconds;\n }\n break;\n }\n case ParamsUnion::UPDATE_FLAGS:\n \/\/ do nothing\n break;\n }\n\n queue_->pop_front();\n\n \/\/ ----------------------------------------\n if (! queue_->empty()) {\n fire_timer_.setTimeoutMS(delay);\n }\n }\n\n \/\/ ======================================================================\n Flags EventOutputQueue::FireModifiers::lastFlags_(0);\n\n void\n EventOutputQueue::FireModifiers::fire(Flags toFlags, KeyboardType keyboardType)\n {\n if (lastFlags_ == toFlags) return;\n\n \/\/ ------------------------------------------------------------\n \/\/ At first we handle KeyUp events and handle KeyDown events next.\n \/\/ We need to end KeyDown at Command+Space to Option_L+Shift_L.\n \/\/\n \/\/ When Option_L+Shift_L has a meaning (switch input language at Windows),\n \/\/ it does not works well when the last is KeyUp of Command.\n\n \/\/ ------------------------------------------------------------\n \/\/ KeyUp\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! lastFlags_.isOn(flag)) continue;\n if (toFlags.isOn(flag)) continue;\n\n lastFlags_.remove(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n \/\/ KeyDown\n for (size_t i = 0; i < FlagStatus::globalFlagStatus().itemSize(); ++i) {\n ModifierFlag flag = FlagStatus::globalFlagStatus().getFlag(i);\n\n \/\/ Skipping ModifierFlag::NUMPAD\n if (flag.getKeyCode() == KeyCode::VK_NONE) continue;\n \/\/ Skipping virtual modifiers.\n if (flag.getRawBits() == 0) continue;\n\n \/\/ ----------------------------------------\n if (! toFlags.isOn(flag)) continue;\n if (lastFlags_.isOn(flag)) continue;\n\n lastFlags_.add(flag);\n\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY, lastFlags_, flag.getKeyCode(), keyboardType, false));\n if (! ptr) continue;\n EventOutputQueue::push(*ptr);\n }\n\n lastFlags_ = toFlags;\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireKey::fire(const Params_KeyboardEventCallBack& params)\n {\n if (VirtualKey::handle(params)) return;\n if (params.eventType == EventType::MODIFY) return;\n\n \/\/ ------------------------------------------------------------\n KeyCode newkeycode = params.key;\n Flags newflags = params.flags;\n\n KeyCode::reverseNormalizeKey(newkeycode, newflags, params.eventType, params.keyboardType);\n\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (newkeycode == KeyCode::VK_NONE ||\n newkeycode == KeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire(newflags, params.keyboardType);\n\n if (params.eventType == EventType::DOWN || params.eventType == EventType::UP) {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(params.eventType, newflags, newkeycode,\n params.charCode, params.charSet, params.origCharCode, params.origCharSet,\n params.keyboardType, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n\n if (! params.repeat) {\n if (params.eventType == EventType::DOWN) {\n PressDownKeys::add(newkeycode, params.keyboardType);\n } else {\n PressDownKeys::remove(newkeycode, params.keyboardType);\n }\n }\n }\n }\n\n void\n EventOutputQueue::FireKey::fire_downup(Flags flags, KeyCode key, KeyboardType keyboardType)\n {\n ModifierFlag f = key.getModifierFlag();\n\n if (f != ModifierFlag::ZERO) {\n FlagStatus::ScopedTemporaryFlagsChanger stfc(FlagStatus::globalFlagStatus(), flags);\n\n \/\/ We operate FlagStatus for the case \"key == KeyCode::CAPSLOCK\".\n FlagStatus::globalFlagStatus().increase(f);\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY,\n FlagStatus::globalFlagStatus().makeFlags(),\n key,\n keyboardType,\n false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n\n FlagStatus::globalFlagStatus().decrease(f);\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::MODIFY,\n FlagStatus::globalFlagStatus().makeFlags(),\n key,\n keyboardType,\n false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n\n } else {\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::DOWN, flags, key, keyboardType, false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n {\n Params_KeyboardEventCallBack::auto_ptr ptr(Params_KeyboardEventCallBack::alloc(EventType::UP, flags, key, keyboardType, false));\n if (! ptr) return;\n FireKey::fire(*ptr);\n }\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireConsumer::fire(const Params_KeyboardSpecialEventCallback& params)\n {\n \/\/ skip no-outputable keycodes.\n \/\/ Note: check before FireModifiers to avoid meaningless modifier event.\n if (params.key == ConsumerKeyCode::VK_NONE ||\n params.key == ConsumerKeyCode::VK_PSEUDO_KEY) {\n return;\n }\n\n FireModifiers::fire();\n\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(params.eventType, params.flags, params.key, params.repeat));\n if (ptr) {\n EventOutputQueue::push(*ptr);\n }\n }\n\n void\n EventOutputQueue::FireConsumer::fire_downup(Flags flags, ConsumerKeyCode key)\n {\n {\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(EventType::DOWN,\n flags,\n key,\n false));\n if (! ptr) return;\n FireConsumer::fire(*ptr);\n }\n {\n Params_KeyboardSpecialEventCallback::auto_ptr ptr(Params_KeyboardSpecialEventCallback::alloc(EventType::UP,\n flags,\n key,\n false));\n if (! ptr) return;\n FireConsumer::fire(*ptr);\n }\n }\n\n \/\/ ======================================================================\n Buttons EventOutputQueue::FireRelativePointer::lastButtons_(0);\n\n void\n EventOutputQueue::FireRelativePointer::fire(Buttons toButtons, int dx, int dy)\n {\n \/\/ When changing space to command+left click,\n \/\/ __KeyToKey__ KeyCode::SPACE, PointingButton::LEFT, ModifierFlag::COMMAND_L\n \/\/\n \/\/ We need to release command key after left click was released as follows.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) MouseUp Left\n \/\/ (4) KeyUp Command_L\n \/\/\n \/\/ For mouse drag support, command modifier is increased as normal (not temporary_increase).\n \/\/ Therefore, command modifier is decreased when space key is released.\n \/\/ If we call FireModifiers::fire() at the begining of this function,\n \/\/ input events are fired as follows order.\n \/\/ (1) KeyDown Command_L\n \/\/ (2) MouseDown Left\n \/\/ (3) KeyUp Command_L\n \/\/ (4) MouseUp Left\n \/\/\n \/\/ It's not desired order.\n \/\/ So, we call FireModifiers::fire() at the end of this function when button is released.\n\n Buttons releasedButtons = lastButtons_;\n releasedButtons.remove(toButtons);\n bool isButtonReleased = ! releasedButtons.isNONE();\n\n if (! isButtonReleased) {\n FireModifiers::fire();\n }\n\n \/\/ Sending button event\n if (lastButtons_ != toButtons) {\n lastButtons_ = toButtons;\n\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, 0, 0, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n \/\/ Sending cursor\n if (dx != 0 || dy != 0) {\n Params_RelativePointerEventCallback::auto_ptr ptr(Params_RelativePointerEventCallback::alloc(toButtons, dx, dy, PointingButton::NONE, false));\n if (! ptr) return;\n Params_RelativePointerEventCallback& params = *ptr;\n\n EventOutputQueue::push(params);\n }\n\n if (isButtonReleased) {\n FireModifiers::fire();\n }\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireScrollWheel::fire(const Params_ScrollWheelEventCallback& params)\n {\n FireModifiers::fire();\n EventOutputQueue::push(params);\n }\n\n void\n EventOutputQueue::FireScrollWheel::fire(int delta1, int delta2)\n {\n short deltaAxis1;\n short deltaAxis2;\n IOFixed fixedDelta1;\n IOFixed fixedDelta2;\n SInt32 pointDelta1;\n SInt32 pointDelta2;\n\n int relative2scroll_rate = Config::get_essential_config(BRIDGE_ESSENTIAL_CONFIG_INDEX_pointing_relative2scroll_rate);\n\n deltaAxis1 = (delta1 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n deltaAxis2 = (delta2 * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n fixedDelta1 = (delta1 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n fixedDelta2 = (delta2 * relative2scroll_rate) * (POINTING_FIXED_SCALE \/ 1024) \/ DELTA_SCALE;\n\n pointDelta1 = (delta1 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n pointDelta2 = (delta2 * POINTING_POINT_SCALE * relative2scroll_rate) \/ 1024 \/ DELTA_SCALE;\n\n \/\/ see IOHIDSystem\/IOHIDevicePrivateKeys.h about options.\n const int kScrollTypeContinuous_ = 0x0001;\n int options = kScrollTypeContinuous_;\n\n Params_ScrollWheelEventCallback::auto_ptr ptr(Params_ScrollWheelEventCallback::alloc(deltaAxis1, deltaAxis2, 0,\n fixedDelta1, fixedDelta2, 0,\n pointDelta1, pointDelta2, 0,\n options));\n if (! ptr) return;\n EventOutputQueue::FireScrollWheel::fire(*ptr);\n }\n\n \/\/ ======================================================================\n void\n EventOutputQueue::FireWait::fire(const Params_Wait& params)\n {\n EventOutputQueue::push(params);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/\n\/\/ npapitest\n\/\/\n\/\/ This is a NPAPI Plugin Program which is used to test the Browser's NPAPI\n\/\/ host implementation. It is used in conjunction with the npapi_unittest.\n\/\/\n\/\/ As a NPAPI Plugin, you can invoke it by creating a web page of the following\n\/\/ type:\n\/\/\n\/\/ <embed src=\"content-to-load\" type=\"application\/vnd.npapi-test\"\n\/\/ name=\"test-name\">\n\/\/\n\/\/ arguments:\n\/\/ src: This is the initial content which will be sent to the plugin.\n\/\/ type: Must be \"application\/vnd.npapi-test\"\n\/\/ name: The testcase to run when invoked\n\/\/ id: The id of the test being run (for testing concurrent plugins)\n\/\/\n\/\/ The Plugin drives the actual test, calling host functions and validating the\n\/\/ Host callbacks which it receives. It is the duty of the plugin to record\n\/\/ all errors.\n\/\/\n\/\/ To indicate test completion, the plugin expects the containing HTML page to\n\/\/ implement two javascript functions:\n\/\/ onSuccess(string testname);\n\/\/ onFailure(string testname, string results);\n\/\/ The HTML host pages used in this test will then set a document cookie\n\/\/ which the automated test framework can poll for and discover that the\n\/\/ test has completed.\n\/\/\n\/\/\n\/\/ TESTS\n\/\/ When the PluginClient receives a NPP_New callback from the browser,\n\/\/ it looks at the \"name\" argument which is passed in. It verifies that\n\/\/ the name matches a known test, and instantiates that test. The test is\n\/\/ a subclass of PluginTest.\n\/\/\n\/\/\n\n#include \"base\/basictypes.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n#if defined(__GNUC__) && __GNUC__ >= 4\n#define EXPORT __attribute__((visibility (\"default\")))\n#else\n#define EXPORT\n#endif\n\n#include \"webkit\/glue\/plugins\/test\/plugin_client.h\"\n\n#if defined(OS_WIN)\nBOOL API_CALL DllMain(HINSTANCE hDll, DWORD dwReason, LPVOID lpReserved) {\n return TRUE;\n}\n#endif\n\nextern \"C\" {\nEXPORT NPError API_CALL NP_GetEntryPoints(NPPluginFuncs* pFuncs) {\n return NPAPIClient::PluginClient::GetEntryPoints(pFuncs);\n}\n\nEXPORT NPError API_CALL NP_Initialize(NPNetscapeFuncs* pFuncs) {\n return NPAPIClient::PluginClient::Initialize(pFuncs);\n}\n\nEXPORT NPError API_CALL NP_Shutdown() {\n return NPAPIClient::PluginClient::Shutdown();\n}\n\n#if defined(OS_POSIX) && !defined(OS_MACOSX)\nEXPORT const char* API_CALL NP_GetMIMEDescription(void) {\n \/\/ The layout test LayoutTests\/fast\/js\/navigator-mimeTypes-length.html\n \/\/ asserts that the number of mimetypes handled by plugins should be\n \/\/ greater than the number of plugins. We specify a mimetype here so\n \/\/ this plugin has at least one.\n return \"application\/x-npapi-test-netscape:npapitestnetscape:\"\n \"npapi test netscape content\";\n}\n#endif\n} \/\/ extern \"C\"\n\nnamespace WebCore {\n const char* currentTextBreakLocaleID() { return \"en_us\"; }\n}\n<commit_msg>Added linux-specific NP_Initialize function so that the plugin is properly initialized. Also fixed the mime-type to be consistent with that on windows and mac. Review URL: http:\/\/codereview.chromium.org\/3129005<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n\/\/\n\/\/ npapitest\n\/\/\n\/\/ This is a NPAPI Plugin Program which is used to test the Browser's NPAPI\n\/\/ host implementation. It is used in conjunction with the npapi_unittest.\n\/\/\n\/\/ As a NPAPI Plugin, you can invoke it by creating a web page of the following\n\/\/ type:\n\/\/\n\/\/ <embed src=\"content-to-load\" type=\"application\/vnd.npapi-test\"\n\/\/ name=\"test-name\">\n\/\/\n\/\/ arguments:\n\/\/ src: This is the initial content which will be sent to the plugin.\n\/\/ type: Must be \"application\/vnd.npapi-test\"\n\/\/ name: The testcase to run when invoked\n\/\/ id: The id of the test being run (for testing concurrent plugins)\n\/\/\n\/\/ The Plugin drives the actual test, calling host functions and validating the\n\/\/ Host callbacks which it receives. It is the duty of the plugin to record\n\/\/ all errors.\n\/\/\n\/\/ To indicate test completion, the plugin expects the containing HTML page to\n\/\/ implement two javascript functions:\n\/\/ onSuccess(string testname);\n\/\/ onFailure(string testname, string results);\n\/\/ The HTML host pages used in this test will then set a document cookie\n\/\/ which the automated test framework can poll for and discover that the\n\/\/ test has completed.\n\/\/\n\/\/\n\/\/ TESTS\n\/\/ When the PluginClient receives a NPP_New callback from the browser,\n\/\/ it looks at the \"name\" argument which is passed in. It verifies that\n\/\/ the name matches a known test, and instantiates that test. The test is\n\/\/ a subclass of PluginTest.\n\/\/\n\/\/\n\n#include \"base\/basictypes.h\"\n\n#if defined(OS_WIN)\n#include <windows.h>\n#endif\n\n#if defined(__GNUC__) && __GNUC__ >= 4\n#define EXPORT __attribute__((visibility (\"default\")))\n#else\n#define EXPORT\n#endif\n\n#include \"webkit\/glue\/plugins\/test\/plugin_client.h\"\n\n#if defined(OS_WIN)\nBOOL API_CALL DllMain(HINSTANCE hDll, DWORD dwReason, LPVOID lpReserved) {\n return TRUE;\n}\n#endif\n\nextern \"C\" {\nEXPORT NPError API_CALL NP_GetEntryPoints(NPPluginFuncs* pFuncs) {\n return NPAPIClient::PluginClient::GetEntryPoints(pFuncs);\n}\n\nEXPORT NPError API_CALL NP_Shutdown() {\n return NPAPIClient::PluginClient::Shutdown();\n}\n\n#if defined(OS_WIN) || defined(OS_MACOSX)\nEXPORT NPError API_CALL NP_Initialize(NPNetscapeFuncs* npnFuncs) {\n return NPAPIClient::PluginClient::Initialize(npnFuncs);\n}\n#elif defined(OS_POSIX)\nEXPORT NPError API_CALL NP_Initialize(NPNetscapeFuncs* npnFuncs,\n NPPluginFuncs* nppFuncs) {\n NPError error = NPAPIClient::PluginClient::Initialize(npnFuncs);\n if (error == NPERR_NO_ERROR) {\n error = NP_GetEntryPoints(nppFuncs);\n }\n return error;\n}\n\nEXPORT NPError API_CALL NP_GetValue(NPP instance, NPPVariable variable,\n void* value) {\n NPError err = NPERR_NO_ERROR;\n\n switch (variable) {\n case NPPVpluginNameString:\n *(static_cast<const char**>(value)) = \"NPAPI Test Plugin\";\n break;\n case NPPVpluginDescriptionString:\n *(static_cast<const char**>(value)) =\n \"Simple NPAPI plug-in for Chromium unit tests\";\n break;\n case NPPVpluginNeedsXEmbed:\n *(static_cast<NPBool*>(value)) = true;\n break;\n default:\n err = NPERR_GENERIC_ERROR;\n break;\n }\n\n return err;\n}\n\nEXPORT const char* API_CALL NP_GetMIMEDescription(void) {\n \/\/ The layout test LayoutTests\/fast\/js\/navigator-mimeTypes-length.html\n \/\/ asserts that the number of mimetypes handled by plugins should be\n \/\/ greater than the number of plugins. We specify a mimetype here so\n \/\/ this plugin has at least one.\n return \"application\/vnd.npapi-test:npapitest:test npapi\";\n}\n#endif \/\/ OS_POSIX\n} \/\/ extern \"C\"\n\nnamespace WebCore {\n const char* currentTextBreakLocaleID() { return \"en_us\"; }\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <vpp\/core\/pixel_wise.hh>\n\nnamespace vpp\n{\n template <typename OPTS, typename... Params>\n class block_wise_runner\n {\n public:\n typedef block_wise_runner<OPTS, Params...> self;\n\n block_wise_runner(vint2 block_size, std::tuple<Params...> t, OPTS options = iod::D())\n : block_size_(block_size), ranges_(t), options_(options) {}\n\n\n template <typename ...A>\n auto operator()(A... _options)\n {\n auto new_options = iod::D(_options...);\n return block_wise_runner<decltype(new_options), Params...>\n (block_size_, ranges_, new_options);\n }\n\n template <typename F>\n void operator|(F fun)\n {\n auto p1 = std::get<0>(ranges_).first_point_coordinates();\n auto p2 = std::get<0>(ranges_).last_point_coordinates();\n \n int rstart = p1[0];\n int rend = p2[0];\n\n int cstart = p1[1];\n int cend = p2[1];\n \n int nr = std::ceil((1 + rend - rstart) \/ float(block_size_[0]));\n int nc = std::ceil((1 + cend - cstart) \/ float(block_size_[1]));\n\n box2d grid(vint2(0, 0),\n vint2(nr - 1, nc - 1));\n\n pixel_wise(grid)(options_) | [&] (vint2 block)\n {\n int r1 = rstart + block[0] * block_size_[0];\n int r2 = std::min(rstart + (block[0] + 1) * block_size_[0] - 1, rend);\n \n int c1 = cstart + block[1] * block_size_[1];\n int c2 = std::min(cstart + (block[1] + 1) * block_size_[1] - 1, cend);\n\n box2d b(vint2{std::min(r1, r2), std::min(c1, c2)},\n vint2{std::max(r1, r2), std::max(c1, c2)});\n\n internals::apply_args_transform(this->ranges_, fun, [&b] (auto& i) { return i | b; }); \n };\n }\n\n private:\n vint2 block_size_;\n std::tuple<Params...> ranges_;\n OPTS options_;\n };\n \n template <typename... PS>\n auto block_wise(vint2 block_size, PS&&... params)\n {\n return block_wise_runner<iod::sio<>, PS...>(block_size, std::forward_as_tuple(params...));\n }\n\n}\n<commit_msg>re-Add row_wise.<commit_after>#pragma once\n\n#include <vpp\/core\/pixel_wise.hh>\n\nnamespace vpp\n{\n template <typename OPTS, typename... Params>\n class block_wise_runner\n {\n public:\n typedef block_wise_runner<OPTS, Params...> self;\n\n block_wise_runner(vint2 block_size, std::tuple<Params...> t, OPTS options = iod::D())\n : block_size_(block_size), ranges_(t), options_(options) {}\n\n\n template <typename ...A>\n auto operator()(A... _options)\n {\n auto new_options = iod::D(_options...);\n return block_wise_runner<decltype(new_options), Params...>\n (block_size_, ranges_, new_options);\n }\n\n template <typename F>\n void operator|(F fun)\n {\n auto p1 = std::get<0>(ranges_).first_point_coordinates();\n auto p2 = std::get<0>(ranges_).last_point_coordinates();\n \n int rstart = p1[0];\n int rend = p2[0];\n\n int cstart = p1[1];\n int cend = p2[1];\n \n int nr = std::ceil((1 + rend - rstart) \/ float(block_size_[0]));\n int nc = std::ceil((1 + cend - cstart) \/ float(block_size_[1]));\n\n box2d grid(vint2(0, 0),\n vint2(nr - 1, nc - 1));\n\n pixel_wise(grid)(options_) | [&] (vint2 block)\n {\n int r1 = rstart + block[0] * block_size_[0];\n int r2 = std::min(rstart + (block[0] + 1) * block_size_[0] - 1, rend);\n \n int c1 = cstart + block[1] * block_size_[1];\n int c2 = std::min(cstart + (block[1] + 1) * block_size_[1] - 1, cend);\n\n box2d b(vint2{std::min(r1, r2), std::min(c1, c2)},\n vint2{std::max(r1, r2), std::max(c1, c2)});\n\n internals::apply_args_transform(this->ranges_, fun, [&b] (auto& i) { return i | b; }); \n };\n }\n\n private:\n vint2 block_size_;\n std::tuple<Params...> ranges_;\n OPTS options_;\n };\n \n template <typename... PS>\n auto block_wise(vint2 block_size, PS&&... params)\n {\n return block_wise_runner<iod::sio<>, PS...>(block_size, std::forward_as_tuple(params...));\n }\n\n template <typename P0, typename... PS>\n auto row_wise(P0&& a0, PS&&... params)\n {\n auto p1 = a0.first_point_coordinates();\n auto p2 = a0.last_point_coordinates();\n\n return block_wise(vint2(1, 1 + p2[1] - p1[1]),\n std::forward<P0>(a0), std::forward<PS>(params)...);\n }\n \n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <iostream>\n#include <tuple>\n#include <iod\/iod.hh>\n#include <iod\/callable_traits.hh>\n#include <iod\/symbol.hh>\n\n#include <vpp\/core\/imageNd.hh>\n#include <vpp\/core\/image2d.hh>\n#include <vpp\/core\/boxNd.hh>\n#include <vpp\/core\/tuple_utils.hh>\n\n#include <vpp\/core\/symbols.hh>\n#include <vpp\/core\/block_wise.hh>\n\nnamespace vpp\n{\n \/\/ Backends\n struct openmp {};\n struct pthreads {}; \/\/ Todo\n struct cpp_amp {}; \/\/ Todo\n\n template <typename T>\n struct get_row_iterator\n {\n typedef typename T::row_iterator type;\n };\n\n template <typename T>\n struct get_row_iterator<const T>\n {\n typedef typename T::const_row_iterator type;\n };\n\n template <typename T>\n using get_row_iterator_t = typename get_row_iterator<std::remove_reference_t<T>>::type;\n\n template <typename B, typename... Params>\n class parallel_for_pixel_wise_runner;\n\n using s::row_forward;\n using s::row_backward;\n using s::col_forward;\n using s::col_backward;\n using s::mem_forward;\n using s::mem_backward;\n using s::serial;\n using s::block_size;\n using s::no_threads;\n\n \/\/ Pixel wise takes a variable number of 2d ranges. (Todo: implement Nd version).\n \/\/ A range should respect this interface:\n\n \/\/ vint2 first_point_coordinates() -> the first point coordinates of the range.\n \/\/ vint2 last_point_coordinates() -> the last point of the range.\n \/\/ typedefs row_iterator, const_row_iterator -> a class to iterate on each row of the range.\n \/\/ row_iterator(vint2 p, Range range) -> build an iterator an place it at position p.\n \/\/ operator!=(row_iterator a, row_iterator b) -> return true if a != b.\n \/\/ operator* -> return the current object (pixel, neighborhood access, point coordinates, ...)\n\n template <typename OPTS, typename... Params>\n class parallel_for_pixel_wise_runner<openmp, OPTS, Params...>\n {\n public:\n typedef parallel_for_pixel_wise_runner<openmp, OPTS, Params...> self;\n\n parallel_for_pixel_wise_runner(std::tuple<Params...> t, OPTS opts = iod::D())\n : ranges_(t), options_(opts) {}\n\n\n template <typename F>\n void run_row_first(F fun);\n\n template <typename F>\n void run_col_first_parallel(F fun);\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n if (!options_.has(col_backward) and !options_.has(col_forward))\n run_row_first(fun);\n else\n if (parallel and !options_.has(row_backward) and !options_.has(row_forward))\n run_col_first_parallel(fun);\n else\n run_row_first(fun);\n }\n\n template <typename ...A>\n auto operator()(A... _options)\n {\n auto new_options = iod::D(_options...);\n return parallel_for_pixel_wise_runner<openmp, decltype(new_options), Params...>\n (ranges_, new_options);\n }\n\n template <typename ...A>\n auto operator()(iod::iod_object<A...> _options)\n {\n auto new_options = _options;\n return parallel_for_pixel_wise_runner<openmp, decltype(new_options), Params...>\n (ranges_, new_options);\n }\n\n \/\/ Compute the return type of a given kernel function.\n template <typename F>\n using kernel_return_type = decltype(std::declval<F>()(*std::declval<get_row_iterator_t<Params>>()...));\n\n \/\/ if fun -> void.\n template <typename F,\n typename X = std::enable_if_t<std::is_same<kernel_return_type<F>, void>::value>>\n void operator|(F fun) \n {\n run(fun, true);\n }\n\n \/\/ if fun -> something != void.\n template <typename F,\n typename X = std::enable_if_t<!std::is_same<kernel_return_type<F>, void>::value>>\n auto operator|(F fun)\n {\n auto p1 = std::get<0>(ranges_).first_point_coordinates();\n auto p2 = std::get<0>(ranges_).last_point_coordinates();\n\n typedef kernel_return_type<F> fun_return_type;\n image2d<fun_return_type> out(box2d(p1, p2));\n auto ranges = std::tuple_cat(std::make_tuple(out), ranges_);\n pixel_wise(ranges)(options_) |\n [&fun] (auto& o,\n decltype(*std::declval<get_row_iterator_t<Params>>())... ps)\n { o = fun(ps...); };\n\n return out;\n }\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n private:\n OPTS options_;\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n auto pixel_wise(PS&&... params)\n {\n return parallel_for_pixel_wise_runner<openmp, iod::iod_object<>, PS...>(std::forward_as_tuple(params...));\n }\n\n\n template <typename... PS>\n auto pixel_wise(std::tuple<PS...>& params)\n {\n return parallel_for_pixel_wise_runner<openmp, iod::iod_object<>, PS...>(params);\n }\n\n\n template <typename B, typename... Params>\n class parallel_for_row_wise_runner;\n\n template <typename... Params>\n class parallel_for_row_wise_runner<openmp, Params...>\n {\n public:\n\n parallel_for_row_wise_runner(std::tuple<Params...> t) : ranges_(t) {}\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n auto p1 = get_p1(std::get<0>(ranges_));\n auto p2 = get_p2(std::get<0>(ranges_));\n\n int start = p1[0];\n int end = p2[0];\n#pragma omp parallel for num_threads (parallel ? omp_get_num_procs() : 0)\n for (int r = start; r <= end; r++)\n {\n auto cur_ = internals::tuple_transform(ranges_, [&] (auto& range) {\n typedef typename get_row_iterator<std::remove_reference_t<decltype(range)>>::type IT;\n return IT(vint2(r, p1[1]), range);\n });\n\n typedef typename get_row_iterator<std::remove_reference_t<decltype(std::get<0>(ranges_))>>::type IT1;\n auto end0_ = IT1(vint2(r, p2[1] + 1), std::get<0>(ranges_));\n auto& cur0_ = std::get<0>(cur_);\n\n while (cur0_ != end0_)\n {\n internals::apply_args_star(cur_, fun);\n internals::tuple_map(cur_, [this] (auto& it) { it.next(); });\n }\n\n internals::apply_args_star(cur_, fun);\n }\n }\n\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n\n private:\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n parallel_for_row_wise_runner<openmp, PS...> row_wise(PS&&... params)\n {\n return parallel_for_row_wise_runner<openmp, PS...>(std::forward_as_tuple(params...));\n }\n\n\n template <typename B, typename... Params>\n class parallel_for_col_wise_runner;\n\n template <typename... Params>\n class parallel_for_col_wise_runner<openmp, Params...>\n {\n public:\n\n parallel_for_col_wise_runner(std::tuple<Params...> t) : ranges_(t) {}\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n auto p1 = get_p1(std::get<0>(ranges_));\n auto p2 = get_p2(std::get<0>(ranges_));\n\n int start = p1[1];\n int end = p2[1];\n#pragma omp parallel for num_threads (parallel ? omp_get_num_procs() : 0)\n for (int c = start; c <= end; c++)\n {\n auto cur_ = internals::tuple_transform(ranges_, [&] (auto& range) {\n typedef typename std::remove_reference_t<decltype(range)>::iterator IT;\n return IT(vint2(p1[0], c), range);\n });\n\n internals::apply_args_star(cur_, fun);\n }\n }\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n private:\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n parallel_for_col_wise_runner<openmp, PS...> col_wise(PS&&... params)\n {\n return parallel_for_col_wise_runner<openmp, PS...>(std::forward_as_tuple(params...));\n }\n\n};\n\n#include <vpp\/core\/pixel_wise.hpp>\n<commit_msg>Remove useless header.<commit_after>#pragma once\n\n#include <iostream>\n#include <tuple>\n#include <iod\/iod.hh>\n#include <iod\/symbol.hh>\n\n#include <vpp\/core\/imageNd.hh>\n#include <vpp\/core\/image2d.hh>\n#include <vpp\/core\/boxNd.hh>\n#include <vpp\/core\/tuple_utils.hh>\n\n#include <vpp\/core\/symbols.hh>\n#include <vpp\/core\/block_wise.hh>\n\nnamespace vpp\n{\n \/\/ Backends\n struct openmp {};\n struct pthreads {}; \/\/ Todo\n struct cpp_amp {}; \/\/ Todo\n\n template <typename T>\n struct get_row_iterator\n {\n typedef typename T::row_iterator type;\n };\n\n template <typename T>\n struct get_row_iterator<const T>\n {\n typedef typename T::const_row_iterator type;\n };\n\n template <typename T>\n using get_row_iterator_t = typename get_row_iterator<std::remove_reference_t<T>>::type;\n\n template <typename B, typename... Params>\n class parallel_for_pixel_wise_runner;\n\n using s::row_forward;\n using s::row_backward;\n using s::col_forward;\n using s::col_backward;\n using s::mem_forward;\n using s::mem_backward;\n using s::serial;\n using s::block_size;\n using s::no_threads;\n\n \/\/ Pixel wise takes a variable number of 2d ranges. (Todo: implement Nd version).\n \/\/ A range should respect this interface:\n\n \/\/ vint2 first_point_coordinates() -> the first point coordinates of the range.\n \/\/ vint2 last_point_coordinates() -> the last point of the range.\n \/\/ typedefs row_iterator, const_row_iterator -> a class to iterate on each row of the range.\n \/\/ row_iterator(vint2 p, Range range) -> build an iterator an place it at position p.\n \/\/ operator!=(row_iterator a, row_iterator b) -> return true if a != b.\n \/\/ operator* -> return the current object (pixel, neighborhood access, point coordinates, ...)\n\n template <typename OPTS, typename... Params>\n class parallel_for_pixel_wise_runner<openmp, OPTS, Params...>\n {\n public:\n typedef parallel_for_pixel_wise_runner<openmp, OPTS, Params...> self;\n\n parallel_for_pixel_wise_runner(std::tuple<Params...> t, OPTS opts = iod::D())\n : ranges_(t), options_(opts) {}\n\n\n template <typename F>\n void run_row_first(F fun);\n\n template <typename F>\n void run_col_first_parallel(F fun);\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n if (!options_.has(col_backward) and !options_.has(col_forward))\n run_row_first(fun);\n else\n if (parallel and !options_.has(row_backward) and !options_.has(row_forward))\n run_col_first_parallel(fun);\n else\n run_row_first(fun);\n }\n\n template <typename ...A>\n auto operator()(A... _options)\n {\n auto new_options = iod::D(_options...);\n return parallel_for_pixel_wise_runner<openmp, decltype(new_options), Params...>\n (ranges_, new_options);\n }\n\n template <typename ...A>\n auto operator()(iod::iod_object<A...> _options)\n {\n auto new_options = _options;\n return parallel_for_pixel_wise_runner<openmp, decltype(new_options), Params...>\n (ranges_, new_options);\n }\n\n \/\/ Compute the return type of a given kernel function.\n template <typename F>\n using kernel_return_type = decltype(std::declval<F>()(*std::declval<get_row_iterator_t<Params>>()...));\n\n \/\/ if fun -> void.\n template <typename F,\n typename X = std::enable_if_t<std::is_same<kernel_return_type<F>, void>::value>>\n void operator|(F fun) \n {\n run(fun, true);\n }\n\n \/\/ if fun -> something != void.\n template <typename F,\n typename X = std::enable_if_t<!std::is_same<kernel_return_type<F>, void>::value>>\n auto operator|(F fun)\n {\n auto p1 = std::get<0>(ranges_).first_point_coordinates();\n auto p2 = std::get<0>(ranges_).last_point_coordinates();\n\n typedef kernel_return_type<F> fun_return_type;\n image2d<fun_return_type> out(box2d(p1, p2));\n auto ranges = std::tuple_cat(std::make_tuple(out), ranges_);\n pixel_wise(ranges)(options_) |\n [&fun] (auto& o,\n decltype(*std::declval<get_row_iterator_t<Params>>())... ps)\n { o = fun(ps...); };\n\n return out;\n }\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n private:\n OPTS options_;\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n auto pixel_wise(PS&&... params)\n {\n return parallel_for_pixel_wise_runner<openmp, iod::iod_object<>, PS...>(std::forward_as_tuple(params...));\n }\n\n\n template <typename... PS>\n auto pixel_wise(std::tuple<PS...>& params)\n {\n return parallel_for_pixel_wise_runner<openmp, iod::iod_object<>, PS...>(params);\n }\n\n\n template <typename B, typename... Params>\n class parallel_for_row_wise_runner;\n\n template <typename... Params>\n class parallel_for_row_wise_runner<openmp, Params...>\n {\n public:\n\n parallel_for_row_wise_runner(std::tuple<Params...> t) : ranges_(t) {}\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n auto p1 = get_p1(std::get<0>(ranges_));\n auto p2 = get_p2(std::get<0>(ranges_));\n\n int start = p1[0];\n int end = p2[0];\n#pragma omp parallel for num_threads (parallel ? omp_get_num_procs() : 0)\n for (int r = start; r <= end; r++)\n {\n auto cur_ = internals::tuple_transform(ranges_, [&] (auto& range) {\n typedef typename get_row_iterator<std::remove_reference_t<decltype(range)>>::type IT;\n return IT(vint2(r, p1[1]), range);\n });\n\n typedef typename get_row_iterator<std::remove_reference_t<decltype(std::get<0>(ranges_))>>::type IT1;\n auto end0_ = IT1(vint2(r, p2[1] + 1), std::get<0>(ranges_));\n auto& cur0_ = std::get<0>(cur_);\n\n while (cur0_ != end0_)\n {\n internals::apply_args_star(cur_, fun);\n internals::tuple_map(cur_, [this] (auto& it) { it.next(); });\n }\n\n internals::apply_args_star(cur_, fun);\n }\n }\n\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n\n private:\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n parallel_for_row_wise_runner<openmp, PS...> row_wise(PS&&... params)\n {\n return parallel_for_row_wise_runner<openmp, PS...>(std::forward_as_tuple(params...));\n }\n\n\n template <typename B, typename... Params>\n class parallel_for_col_wise_runner;\n\n template <typename... Params>\n class parallel_for_col_wise_runner<openmp, Params...>\n {\n public:\n\n parallel_for_col_wise_runner(std::tuple<Params...> t) : ranges_(t) {}\n\n template <typename F>\n void run(F fun, bool parallel)\n {\n auto p1 = get_p1(std::get<0>(ranges_));\n auto p2 = get_p2(std::get<0>(ranges_));\n\n int start = p1[1];\n int end = p2[1];\n#pragma omp parallel for num_threads (parallel ? omp_get_num_procs() : 0)\n for (int c = start; c <= end; c++)\n {\n auto cur_ = internals::tuple_transform(ranges_, [&] (auto& range) {\n typedef typename std::remove_reference_t<decltype(range)>::iterator IT;\n return IT(vint2(p1[0], c), range);\n });\n\n internals::apply_args_star(cur_, fun);\n }\n }\n\n template <typename F>\n void operator<<(F fun)\n {\n run(fun, true);\n }\n\n template <typename F>\n void operator<(F fun)\n {\n run(fun, false);\n }\n\n private:\n std::tuple<Params...> ranges_;\n };\n\n template <typename... PS>\n parallel_for_col_wise_runner<openmp, PS...> col_wise(PS&&... params)\n {\n return parallel_for_col_wise_runner<openmp, PS...>(std::forward_as_tuple(params...));\n }\n\n};\n\n#include <vpp\/core\/pixel_wise.hpp>\n<|endoftext|>"} {"text":"<commit_before>\/** \\file add_subsystem_tags.cc\n * \\brief Add additional tags for interfaces to identitify subset views of\n IxTheo like RelBib and Bibstudies\n * \\author Johannes Riedl\n *\/\n\n\/*\n Copyright (C) 2018, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"File.h\"\n#include \"MARC.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nconst std::string RELBIB_TAG(\"REL\");\nconst std::string BIBSTUDIES_TAG(\"BIB\");\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\nbool HasRelBibSSGN(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"084\")) {\n const MARC::Subfields subfields(field.getSubfields());\n if (subfields.hasSubfieldWithValue('2', \"ssgn\") and subfields.hasSubfieldWithValue('a', \"0\"))\n return true;\n }\n return false;\n}\n\n\nbool HasRelBibIxTheoNotation(const MARC::Record &record) {\n \/\/ Integrate IxTheo Notations A*.B*,T*,V*,X*,Z*\n static const std::string RELBIB_IXTHEO_NOTATION_PATTERN(\"^[ABTVXZ][A-Z].*|.*:[ABTVXZ][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(RELBIB_IXTHEO_NOTATION_PATTERN));\n for (const auto& field : record.getTagRange(\"652\")) {\n for (const auto& subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfieldA))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasPlausibleDDCPrefix(const std::string ddc_string) {\n \/\/ Exclude records that are obviously not DDC\n static const std::string PLAUSIBLE_DDC_PREFIX_PATTERN(\"^\\\\d\\\\d\");\n static RegexMatcher * const plausible_ddc_prefix_matcher(RegexMatcher::RegexMatcherFactoryOrDie(PLAUSIBLE_DDC_PREFIX_PATTERN));\n return plausible_ddc_prefix_matcher->matched(ddc_string);\n}\n\n\n\/\/ Additional criteria that lead that prevent the exclusion of a record that has a 220-289 field\nbool HasAdditionalRelbibAdmitDDC(const MARC::Record &record) {\n static const std::string RELBIB_ADMIT_DDC_PATTERN(\"^([12][01][0-9]|2[9][0-9]|[3-9][0-9][0-9]).*$\");\n static RegexMatcher * const relbib_admit_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_ADMIT_DDC_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (HasPlausibleDDCPrefix(subfieldA) and relbib_admit_ddc_range_matcher->matched(subfieldA))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasRelBibExcludeDDC(const MARC::Record &record) {\n if (not record.hasTag(\"082\"))\n return true;\n \/\/ Exclude DDC 220-289\n static const std::string RELBIB_EXCLUDE_DDC_RANGE_PATTERN(\"^2[2-8][0-9](\/|\\\\.){0,2}[^.]*$\");\n\/\/ static const std::string RELBIB_EXCLUDE_DDC_RANGE_PATTERN(\"^2[2-8][0-9][\/.]?[^.]*$\");\n static RegexMatcher * const relbib_exclude_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_RANGE_PATTERN));\n\n \/\/ Make sure we have 082-fields to examine\n if (not record.hasTag(\"082\"))\n return false;\n\n \/\/ In general we exclude if the exclude range is matched\n \/\/ But we include it anyway if we find another reasonable DDC-code\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_exclude_ddc_range_matcher->matched(subfieldA)) {\n if (not HasAdditionalRelbibAdmitDDC(record))\n return true;\n }\n }\n }\n\n \/\/ Exclude item if it has only DDC a 400 or 800 DDC notation\n static const std::string RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN(\"^[48][0-9][0-9]$\");\n static RegexMatcher * const relbib_exclude_ddc_categories_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields('a')) {\n if (HasPlausibleDDCPrefix(subfieldA) and not relbib_exclude_ddc_categories_matcher->matched(subfieldA))\n return false;\n }\n }\n return true;\n}\n\n\nbool MatchesRelBibDDC(const MARC::Record &record) {\n return not HasRelBibExcludeDDC(record);\n}\n\n\nbool IsDefinitelyRelBib(const MARC::Record &record) {\n return HasRelBibSSGN(record) or HasRelBibIxTheoNotation(record) or MatchesRelBibDDC(record);\n}\n\n\nbool IsProbablyRelBib(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"191\")) {\n for (const auto& subfield : field.getSubfields().extractSubfields(\"a\")) {\n if (subfield == \"1\")\n return true;\n }\n }\n return false;\n}\n\n\nstd::set<std::string> GetTemporarySuperiorRelBibList() {\n const std::string relbib_superior_temporary_file(\"\/usr\/local\/ub_tools\/cpp\/data\/relbib_superior_temporary.txt\");\n std::set<std::string> superior_temporary_list;\n File superior_temporary(relbib_superior_temporary_file, \"r\");\n std::string line;\n while (superior_temporary.getline(&line) and not superior_temporary.eof())\n superior_temporary_list.emplace(line);\n return superior_temporary_list;\n}\n\n\nbool IsTemporaryRelBibSuperior(const MARC::Record &record) {\n static std::set<std::string> superior_temporary_list(GetTemporarySuperiorRelBibList());\n if (superior_temporary_list.find(record.getControlNumber()) != superior_temporary_list.end())\n return true;\n return false;\n}\n\n\nbool ExcludeBecauseOfRWEX(const MARC::Record &record) {\n for (const auto &field : record.getTagRange(\"LOK\")) {\n const auto &subfields(field.getSubfields());\n for (const auto &subfield0: subfields.extractSubfields('0')) {\n if (not StringUtil::StartsWith(subfield0, \"935\"))\n continue;\n for (const auto &subfieldA : subfields.extractSubfields('a')) {\n if (subfieldA == \"rwex\")\n return true;\n }\n }\n }\n return false;\n}\n\n\nbool IsRelBibRecord(const MARC::Record &record) {\n return ((IsDefinitelyRelBib(record) or\n IsProbablyRelBib(record) or\n IsTemporaryRelBibSuperior(record))\n and not ExcludeBecauseOfRWEX(record));\n}\n\n\nbool HasBibStudiesIxTheoNotation(const MARC::Record &record) {\n static const std::string BIBSTUDIES_IXTHEO_PATTERN(\"^[H][A-Z].*|.*:[H][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(BIBSTUDIES_IXTHEO_PATTERN));\n for (const auto &field : record.getTagRange(\"652\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfieldA))\n return true;\n }\n }\n return false;\n}\n\n\nbool IsBibStudiesRecord(const MARC::Record &record) {\n return HasBibStudiesIxTheoNotation(record);\n}\n\n\nvoid AddSubsystemTag(MARC::Record * const record, const std::string &tag) {\n \/\/ Don't insert twice\n if (record->getFirstField(tag) != record->end())\n return;\n MARC::Subfields subfields;\n subfields.addSubfield('a', \"1\");\n record->insertField(tag, subfields);\n}\n\n\nvoid AddSubsystemTags(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer) {\n unsigned int record_count(0), modified_count(0);\n while (MARC::Record record = marc_reader->read()) {\n ++record_count;\n bool modified_record(false);\n if (IsRelBibRecord(record)) {\n AddSubsystemTag(&record, RELBIB_TAG);\n modified_record = true;\n }\n if (IsBibStudiesRecord(record)) {\n AddSubsystemTag(&record, BIBSTUDIES_TAG);\n modified_record = true;\n }\n marc_writer->write(record);\n if (modified_record)\n ++modified_count;\n }\n\n LOG_INFO(\"Modified \" + std::to_string(modified_count) + \" of \" + std::to_string(record_count) + \" records.\");\n}\n\n\n} \/\/unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc != 3)\n Usage();\n\n const std::string marc_input_filename(argv[1]);\n const std::string marc_output_filename(argv[2]);\n if (unlikely(marc_input_filename == marc_output_filename))\n LOG_ERROR(\"Title data input file name equals output file name!\");\n\n std::unique_ptr<MARC::Reader> marc_reader(MARC::Reader::Factory(marc_input_filename));\n std::unique_ptr<MARC::Writer> marc_writer(MARC::Writer::Factory(marc_output_filename));\n AddSubsystemTags(marc_reader.get() , marc_writer.get());\n\n return EXIT_SUCCESS;\n}\n<commit_msg>Set back to current live version<commit_after>\/** \\file add_subsystem_tags.cc\n * \\brief Add additional tags for interfaces to identitify subset views of\n IxTheo like RelBib and Bibstudies\n * \\author Johannes Riedl\n *\/\n\n\/*\n Copyright (C) 2018, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"File.h\"\n#include \"MARC.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n \nconst std::string RELBIB_TAG(\"REL\");\nconst std::string BIBSTUDIES_TAG(\"BIB\");\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\nbool HasRelBibSSGN(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"084\")) {\n const MARC::Subfields subfields(field.getSubfields());\n if (subfields.hasSubfieldWithValue('2', \"ssgn\") and subfields.hasSubfieldWithValue('a', \"0\"))\n return true;\n }\n return false;\n}\n\n\nbool HasRelBibIxTheoNotation(const MARC::Record &record) {\n \/\/ Integrate IxTheo Notations A*.B*,T*,V*,X*,Z*\n static const std::string RELBIB_IXTHEO_NOTATION_PATTERN(\"^[ABTVXZ][A-Z].*|.*:[ABTVXZ][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(RELBIB_IXTHEO_NOTATION_PATTERN));\n for (const auto& field : record.getTagRange(\"652\")) {\n for (const auto& subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfieldA))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasRelBibExcludeDDC(const MARC::Record &record) {\n if (not record.hasTag(\"082\"))\n return true;\n \/\/ Exclude records that are obviously not DDC\n static const std::string PLAUSIBLE_DDC_START_PATTERN(\"^\\\\d\\\\d\");\n static RegexMatcher * const plausible_ddc_start_matcher(RegexMatcher::RegexMatcherFactoryOrDie(PLAUSIBLE_DDC_START_PATTERN));\n \/\/ Exclude DDC 220-289, i.e. do not include if a DDC code of this range occurs anywhere in the DDC code\n static const std::string RELBIB_EXCLUDE_DDC_RANGE_PATTERN(\"^2[2-8][0-9][\/.]?[^.]*$\");\n static RegexMatcher * const relbib_exclude_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_RANGE_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_exclude_ddc_range_matcher->matched(subfieldA))\n return true;\n }\n }\n \/\/ Exclude item if it has only DDC a 400 or 800 DDC notation\n static const std::string RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN(\"^[48][0-9][0-9]$\");\n static RegexMatcher * const relbib_exclude_ddc_categories_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields('a')) {\n if (plausible_ddc_start_matcher->matched(subfieldA) and not relbib_exclude_ddc_categories_matcher->matched(subfieldA))\n return false;\n }\n }\n return true;\n}\n\n\nbool MatchesRelBibDDC(const MARC::Record &record) {\n return not HasRelBibExcludeDDC(record);\n}\n\n\nbool IsDefinitelyRelBib(const MARC::Record &record) {\n return HasRelBibSSGN(record) or HasRelBibIxTheoNotation(record) or MatchesRelBibDDC(record);\n}\n\n\nbool IsProbablyRelBib(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"191\")) {\n for (const auto& subfield : field.getSubfields().extractSubfields(\"a\")) {\n if (subfield == \"1\")\n return true;\n }\n }\n return false;\n}\n\n\nstd::set<std::string> GetTemporarySuperiorRelBibList() {\n const std::string relbib_superior_temporary_file(\"\/usr\/local\/ub_tools\/cpp\/data\/relbib_superior_temporary.txt\");\n std::set<std::string> superior_temporary_list;\n File superior_temporary(relbib_superior_temporary_file, \"r\");\n std::string line;\n while (superior_temporary.getline(&line) and not superior_temporary.eof())\n superior_temporary_list.emplace(line);\n return superior_temporary_list;\n}\n\n\nbool IsTemporaryRelBibSuperior(const MARC::Record &record) {\n static std::set<std::string> superior_temporary_list(GetTemporarySuperiorRelBibList());\n if (superior_temporary_list.find(record.getControlNumber()) != superior_temporary_list.end())\n return true;\n return false;\n}\n\n\nbool ExcludeBecauseOfRWEX(const MARC::Record &record) {\n for (const auto &field : record.getTagRange(\"LOK\")) {\n const auto &subfields(field.getSubfields());\n for (const auto &subfield0: subfields.extractSubfields('0')) {\n if (not StringUtil::StartsWith(subfield0, \"935\"))\n continue;\n for (const auto &subfieldA : subfields.extractSubfields('a')) {\n if (subfieldA == \"rwex\")\n return true;\n }\n }\n }\n return false;\n}\n\n\nbool IsRelBibRecord(const MARC::Record &record) {\n return ((IsDefinitelyRelBib(record) or\n IsProbablyRelBib(record) or\n IsTemporaryRelBibSuperior(record))\n and not ExcludeBecauseOfRWEX(record));\n}\n\n\nbool HasBibStudiesIxTheoNotation(const MARC::Record &record) {\n static const std::string BIBSTUDIES_IXTHEO_PATTERN(\"^[H][A-Z].*|.*:[H][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(BIBSTUDIES_IXTHEO_PATTERN));\n for (const auto &field : record.getTagRange(\"652\")) {\n for (const auto &subfieldA : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfieldA))\n return true;\n }\n }\n return false;\n}\n\n\nbool IsBibStudiesRecord(const MARC::Record &record) {\n return HasBibStudiesIxTheoNotation(record);\n}\n\n\nvoid AddSubsystemTag(MARC::Record * const record, const std::string &tag) {\n \/\/ Don't insert twice\n if (record->getFirstField(tag) != record->end())\n return;\n MARC::Subfields subfields;\n subfields.addSubfield('a', \"1\");\n record->insertField(tag, subfields);\n}\n\n\nvoid AddSubsystemTags(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer) {\n unsigned int record_count(0), modified_count(0);\n while (MARC::Record record = marc_reader->read()) {\n ++record_count;\n bool modified_record(false);\n if (IsRelBibRecord(record)) {\n AddSubsystemTag(&record, RELBIB_TAG);\n modified_record = true;\n }\n if (IsBibStudiesRecord(record)) {\n AddSubsystemTag(&record, BIBSTUDIES_TAG);\n modified_record = true;\n }\n marc_writer->write(record);\n if (modified_record)\n ++modified_count;\n }\n\n LOG_INFO(\"Modified \" + std::to_string(modified_count) + \" of \" + std::to_string(record_count) + \" records.\");\n}\n\n\n} \/\/unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc != 3)\n Usage();\n\n const std::string marc_input_filename(argv[1]);\n const std::string marc_output_filename(argv[2]);\n if (unlikely(marc_input_filename == marc_output_filename))\n LOG_ERROR(\"Title data input file name equals output file name!\");\n\n std::unique_ptr<MARC::Reader> marc_reader(MARC::Reader::Factory(marc_input_filename));\n std::unique_ptr<MARC::Writer> marc_writer(MARC::Writer::Factory(marc_output_filename));\n AddSubsystemTags(marc_reader.get() , marc_writer.get());\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \\file add_subsystem_tags.cc\n * \\brief Add additional tags for interfaces to identitify subset views of\n IxTheo like RelBib and Bibstudies\n * \\author Johannes Riedl\n *\/\n\n\/*\n Copyright (C) 2018, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"File.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nconst std::string RELBIB_TAG(\"REL\");\nconst std::string BIBSTUDIES_TAG(\"BIB\");\n\nenum SubSystem { RELBIB, BIBSTUDIES };\nconst unsigned NUM_OF_SUBSYSTEMS(2);\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\nbool HasRelBibSSGN(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"084\")) {\n const MARC::Subfields subfields(field.getSubfields());\n if (subfields.hasSubfieldWithValue('2', \"ssgn\") and subfields.hasSubfieldWithValue('a', \"0\"))\n return true;\n }\n return false;\n}\n\n\nbool HasRelBibIxTheoNotation(const MARC::Record &record) {\n \/\/ Integrate IxTheo Notations A*.B*,T*,V*,X*,Z*\n static const std::string RELBIB_IXTHEO_NOTATION_PATTERN(\"^[ABTVXZ][A-Z].*|.*:[ABTVXZ][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(RELBIB_IXTHEO_NOTATION_PATTERN));\n for (const auto& field : record.getTagRange(\"652\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasPlausibleDDCPrefix(const std::string &ddc_string) {\n \/\/ Exclude records that where the entry in the DCC field is not plausible\n static const std::string PLAUSIBLE_DDC_PREFIX_PATTERN(\"^\\\\d\\\\d\");\n static RegexMatcher * const plausible_ddc_prefix_matcher(RegexMatcher::RegexMatcherFactoryOrDie(PLAUSIBLE_DDC_PREFIX_PATTERN));\n return plausible_ddc_prefix_matcher->matched(ddc_string);\n}\n\n\n\/\/ Additional criteria that prevent the exclusion of a record that has a 220-289 field\nbool HasAdditionalRelbibAdmissionDDC(const MARC::Record &record) {\n static const std::string RELBIB_ADMIT_DDC_PATTERN(\"^([12][01][0-9]|2[9][0-9]|[3-9][0-9][0-9]).*$\");\n static RegexMatcher * const relbib_admit_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_ADMIT_DDC_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (HasPlausibleDDCPrefix(subfield_a) and relbib_admit_ddc_range_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasRelBibExcludeDDC(const MARC::Record &record) {\n if (not record.hasTag(\"082\"))\n return true;\n \/\/ Exclude DDC 220-289\n static const std::string RELBIB_EXCLUDE_DDC_RANGE_PATTERN(\"^2[2-8][0-9](\/|\\\\.){0,2}[^.]*$\");\n static RegexMatcher * const relbib_exclude_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_RANGE_PATTERN));\n\n \/\/ Make sure we have 082-fields to examine\n if (not record.hasTag(\"082\"))\n return false;\n\n \/\/ In general we exclude if the exclude range is matched\n \/\/ But we include it anyway if we find another reasonable DDC-code\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_exclude_ddc_range_matcher->matched(subfield_a)) {\n if (not HasAdditionalRelbibAdmissionDDC(record))\n return true;\n }\n }\n }\n\n \/\/ Exclude item if it has only a 400 or 800 DDC notation\n static const std::string RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN(\"^[48][0-9][0-9]$\");\n static RegexMatcher * const relbib_exclude_ddc_categories_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields('a')) {\n if (HasPlausibleDDCPrefix(subfield_a) and not relbib_exclude_ddc_categories_matcher->matched(subfield_a))\n return false;\n }\n }\n return true;\n}\n\n\nbool MatchesRelBibDDC(const MARC::Record &record) {\n return not HasRelBibExcludeDDC(record);\n}\n\n\nbool IsDefinitelyRelBib(const MARC::Record &record) {\n return HasRelBibSSGN(record) or HasRelBibIxTheoNotation(record) or MatchesRelBibDDC(record);\n}\n\n\nbool IsProbablyRelBib(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"191\")) {\n for (const auto& subfield : field.getSubfields().extractSubfields(\"a\")) {\n if (subfield == \"1\")\n return true;\n }\n }\n return false;\n}\n\n\nstd::set<std::string> GetTemporarySuperiorRelBibList() {\n const std::string relbib_superior_temporary_file(\"\/usr\/local\/ub_tools\/cpp\/data\/relbib_superior_temporary.txt\");\n std::set<std::string> superior_temporary_list;\n File superior_temporary(relbib_superior_temporary_file, \"r\");\n std::string line;\n while (superior_temporary.getline(&line) and not superior_temporary.eof())\n superior_temporary_list.emplace(line);\n return superior_temporary_list;\n}\n\n\nbool IsTemporaryRelBibSuperior(const MARC::Record &record) {\n static std::set<std::string> superior_temporary_list(GetTemporarySuperiorRelBibList());\n if (superior_temporary_list.find(record.getControlNumber()) != superior_temporary_list.end())\n return true;\n return false;\n}\n\n\nbool ExcludeBecauseOfRWEX(const MARC::Record &record) {\n for (const auto &field : record.getTagRange(\"LOK\")) {\n const auto &subfields(field.getSubfields());\n for (const auto &subfield0: subfields.extractSubfields('0')) {\n if (not StringUtil::StartsWith(subfield0, \"935\"))\n continue;\n for (const auto &subfield_a : subfields.extractSubfields('a')) {\n if (subfield_a == \"rwex\")\n return true;\n }\n }\n }\n return false;\n}\n\n\nbool IsRelBibRecord(const MARC::Record &record) {\n return ((IsDefinitelyRelBib(record) or\n IsProbablyRelBib(record) or\n IsTemporaryRelBibSuperior(record))\n and not ExcludeBecauseOfRWEX(record));\n}\n\n\nbool HasBibStudiesIxTheoNotation(const MARC::Record &record) {\n static const std::string BIBSTUDIES_IXTHEO_PATTERN(\"^[H][A-Z].*|.*:[H][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(BIBSTUDIES_IXTHEO_PATTERN));\n for (const auto &field : record.getTagRange(\"652\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool IsBibStudiesRecord(const MARC::Record &record) {\n return HasBibStudiesIxTheoNotation(record);\n}\n\n\nvoid AddSubsystemTag(MARC::Record * const record, const std::string &tag) {\n \/\/ Don't insert twice\n if (record->getFirstField(tag) != record->end())\n return;\n MARC::Subfields subfields;\n subfields.addSubfield('a', \"1\");\n record->insertField(tag, subfields);\n}\n\n\nvoid CollectSuperiorOrParallelWorks(const MARC::Record &record, std::unordered_set<std::string> * const superior_or_parallel_works) {\n const std::set<std::string> parallel(MARC::ExtractCrossReferencePPNs(record));\n superior_or_parallel_works->insert(parallel.begin(), parallel.end());\n superior_or_parallel_works->insert(record.getSuperiorControlNumber());\n}\n\n\n\/\/ Get set of immediately belonging or superior or parallel records\nvoid GetSubsystemPPNSet(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer,\n std::vector<std::unordered_set<std::string>> * const subsystem_sets) {\n while (const MARC::Record record = marc_reader->read()) {\n if (IsRelBibRecord(record)) {\n ((*subsystem_sets)[RELBIB]).emplace(record.getControlNumber());\n CollectSuperiorOrParallelWorks(record, &((*subsystem_sets)[RELBIB]));\n }\n if (IsBibStudiesRecord(record)) {\n ((*subsystem_sets)[BIBSTUDIES]).emplace(record.getControlNumber());\n CollectSuperiorOrParallelWorks(record, &((*subsystem_sets)[BIBSTUDIES]));\n }\n marc_writer->write(record);\n }\n}\n\n\nvoid AddSubsystemTags(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer,\n const std::vector<std::unordered_set<std::string>> &subsystem_sets) {\n unsigned record_count(0), modified_count(0);\n while (MARC::Record record = marc_reader->read()) {\n ++record_count;\n bool modified_record(false);\n if ((subsystem_sets[RELBIB]).find(record.getControlNumber()) != subsystem_sets[RELBIB].end()) {\n AddSubsystemTag(&record, RELBIB_TAG);\n modified_record = true;\n }\n if ((subsystem_sets[BIBSTUDIES]).find(record.getControlNumber()) != subsystem_sets[RELBIB].end()) {\n AddSubsystemTag(&record, BIBSTUDIES_TAG);\n modified_record = true;\n }\n if (modified_record)\n ++modified_count;\n marc_writer->write(record);\n\n }\n LOG_INFO(\"Modified \" + std::to_string(modified_count) + \" of \" + std::to_string(record_count) + \" records.\");\n}\n\n\nvoid InitializeSubsystemPPNSets(std::vector<std::unordered_set<std::string>> * const subsystem_ppn_sets) {\n for (unsigned i = 0; i < NUM_OF_SUBSYSTEMS; ++i)\n subsystem_ppn_sets->push_back(std::unordered_set<std::string>());\n}\n\n\n} \/\/unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc != 3)\n Usage();\n\n const std::string marc_input_filename(argv[1]);\n const std::string marc_output_filename(argv[2]);\n if (unlikely(marc_input_filename == marc_output_filename))\n LOG_ERROR(\"Title data input file name equals output file name!\");\n\n std::vector<std::unordered_set<std::string>> subsystem_sets;\n InitializeSubsystemPPNSets(&subsystem_sets);\n\n std::unique_ptr<MARC::Reader> marc_reader(MARC::Reader::Factory(marc_input_filename));\n FileUtil::AutoTempFile tmp_marc_file(\"\/dev\/shm\/\", \".mrc\");\n std::unique_ptr<MARC::Writer> marc_tmp_writer(MARC::Writer::Factory(tmp_marc_file.getFilePath()));\n GetSubsystemPPNSet(marc_reader.get(), marc_tmp_writer.get(), &subsystem_sets);\n if (not marc_tmp_writer->flush())\n LOG_ERROR(\"Could not flush to \" + tmp_marc_file.getFilePath());\n std::unique_ptr<MARC::Reader> marc_tmp_reader(MARC::Reader::Factory(tmp_marc_file.getFilePath()));\n std::unique_ptr<MARC::Writer> marc_writer(MARC::Writer::Factory(marc_output_filename));\n AddSubsystemTags(marc_tmp_reader.get(), marc_writer.get(), subsystem_sets);\n\n return EXIT_SUCCESS;\n}\n<commit_msg>Requested changes<commit_after>\/** \\file add_subsystem_tags.cc\n * \\brief Add additional tags for interfaces to identitify subset views of\n IxTheo like RelBib and Bibstudies\n * \\author Johannes Riedl\n *\/\n\n\/*\n Copyright (C) 2018, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <vector>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"File.h\"\n#include \"FileUtil.h\"\n#include \"MARC.h\"\n#include \"RegexMatcher.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n\n\nnamespace {\n\n\nconst std::string RELBIB_TAG(\"REL\");\nconst std::string BIBSTUDIES_TAG(\"BIB\");\n\nenum SubSystem { RELBIB, BIBSTUDIES };\nconst unsigned NUM_OF_SUBSYSTEMS(2);\n\n\n[[noreturn]] void Usage() {\n std::cerr << \"Usage: \" << ::progname << \" marc_input marc_output\\n\";\n std::exit(EXIT_FAILURE);\n}\n\n\nbool HasRelBibSSGN(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"084\")) {\n const MARC::Subfields subfields(field.getSubfields());\n if (subfields.hasSubfieldWithValue('2', \"ssgn\") and subfields.hasSubfieldWithValue('a', \"0\"))\n return true;\n }\n return false;\n}\n\n\nbool HasRelBibIxTheoNotation(const MARC::Record &record) {\n \/\/ Integrate IxTheo Notations A*.B*,T*,V*,X*,Z*\n static const std::string RELBIB_IXTHEO_NOTATION_PATTERN(\"^[ABTVXZ][A-Z].*|.*:[ABTVXZ][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(RELBIB_IXTHEO_NOTATION_PATTERN));\n for (const auto& field : record.getTagRange(\"652\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasPlausibleDDCPrefix(const std::string &ddc_string) {\n \/\/ Exclude records that where the entry in the DCC field is not plausible\n static const std::string PLAUSIBLE_DDC_PREFIX_PATTERN(\"^\\\\d\\\\d\");\n static RegexMatcher * const plausible_ddc_prefix_matcher(RegexMatcher::RegexMatcherFactoryOrDie(PLAUSIBLE_DDC_PREFIX_PATTERN));\n return plausible_ddc_prefix_matcher->matched(ddc_string);\n}\n\n\n\/\/ Additional criteria that prevent the exclusion of a record that has a 220-289 field\nbool HasAdditionalRelbibAdmissionDDC(const MARC::Record &record) {\n static const std::string RELBIB_ADMIT_DDC_PATTERN(\"^([12][01][0-9]|2[9][0-9]|[3-9][0-9][0-9]).*$\");\n static RegexMatcher * const relbib_admit_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_ADMIT_DDC_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (HasPlausibleDDCPrefix(subfield_a) and relbib_admit_ddc_range_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool HasRelBibExcludeDDC(const MARC::Record &record) {\n if (not record.hasTag(\"082\"))\n return true;\n \/\/ Exclude DDC 220-289\n static const std::string RELBIB_EXCLUDE_DDC_RANGE_PATTERN(\"^2[2-8][0-9](\/|\\\\.){0,2}[^.]*$\");\n static RegexMatcher * const relbib_exclude_ddc_range_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_RANGE_PATTERN));\n\n \/\/ Make sure we have 082-fields to examine\n if (not record.hasTag(\"082\"))\n return false;\n\n \/\/ In general we exclude if the exclude range is matched\n \/\/ But we include it anyway if we find another reasonable DDC-code\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_exclude_ddc_range_matcher->matched(subfield_a)) {\n if (not HasAdditionalRelbibAdmissionDDC(record))\n return true;\n }\n }\n }\n\n \/\/ Exclude item if it has only a 400 or 800 DDC notation\n static const std::string RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN(\"^[48][0-9][0-9]$\");\n static RegexMatcher * const relbib_exclude_ddc_categories_matcher(RegexMatcher::RegexMatcherFactoryOrDie(RELBIB_EXCLUDE_DDC_CATEGORIES_PATTERN));\n for (const auto &field : record.getTagRange(\"082\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields('a')) {\n if (HasPlausibleDDCPrefix(subfield_a) and not relbib_exclude_ddc_categories_matcher->matched(subfield_a))\n return false;\n }\n }\n return true;\n}\n\n\nbool MatchesRelBibDDC(const MARC::Record &record) {\n return not HasRelBibExcludeDDC(record);\n}\n\n\nbool IsDefinitelyRelBib(const MARC::Record &record) {\n return HasRelBibSSGN(record) or HasRelBibIxTheoNotation(record) or MatchesRelBibDDC(record);\n}\n\n\nbool IsProbablyRelBib(const MARC::Record &record) {\n for (const auto& field : record.getTagRange(\"191\")) {\n for (const auto& subfield : field.getSubfields().extractSubfields(\"a\")) {\n if (subfield == \"1\")\n return true;\n }\n }\n return false;\n}\n\n\nstd::set<std::string> GetTemporarySuperiorRelBibList() {\n const std::string relbib_superior_temporary_file(\"\/usr\/local\/ub_tools\/cpp\/data\/relbib_superior_temporary.txt\");\n std::set<std::string> superior_temporary_list;\n File superior_temporary(relbib_superior_temporary_file, \"r\");\n std::string line;\n while (superior_temporary.getline(&line) and not superior_temporary.eof())\n superior_temporary_list.emplace(line);\n return superior_temporary_list;\n}\n\n\nbool IsTemporaryRelBibSuperior(const MARC::Record &record) {\n static std::set<std::string> superior_temporary_list(GetTemporarySuperiorRelBibList());\n if (superior_temporary_list.find(record.getControlNumber()) != superior_temporary_list.end())\n return true;\n return false;\n}\n\n\nbool ExcludeBecauseOfRWEX(const MARC::Record &record) {\n for (const auto &field : record.getTagRange(\"LOK\")) {\n const auto &subfields(field.getSubfields());\n for (const auto &subfield0: subfields.extractSubfields('0')) {\n if (not StringUtil::StartsWith(subfield0, \"935\"))\n continue;\n for (const auto &subfield_a : subfields.extractSubfields('a')) {\n if (subfield_a == \"rwex\")\n return true;\n }\n }\n }\n return false;\n}\n\n\nbool IsRelBibRecord(const MARC::Record &record) {\n return ((IsDefinitelyRelBib(record) or\n IsProbablyRelBib(record) or\n IsTemporaryRelBibSuperior(record))\n and not ExcludeBecauseOfRWEX(record));\n}\n\n\nbool HasBibStudiesIxTheoNotation(const MARC::Record &record) {\n static const std::string BIBSTUDIES_IXTHEO_PATTERN(\"^[H][A-Z].*|.*:[H][A-Z].*\");\n static RegexMatcher * const relbib_ixtheo_notations_matcher(RegexMatcher::RegexMatcherFactory(BIBSTUDIES_IXTHEO_PATTERN));\n for (const auto &field : record.getTagRange(\"652\")) {\n for (const auto &subfield_a : field.getSubfields().extractSubfields(\"a\")) {\n if (relbib_ixtheo_notations_matcher->matched(subfield_a))\n return true;\n }\n }\n return false;\n}\n\n\nbool IsBibStudiesRecord(const MARC::Record &record) {\n return HasBibStudiesIxTheoNotation(record);\n}\n\n\nvoid AddSubsystemTag(MARC::Record * const record, const std::string &tag) {\n \/\/ Don't insert twice\n if (record->getFirstField(tag) != record->end())\n return;\n MARC::Subfields subfields;\n subfields.addSubfield('a', \"1\");\n record->insertField(tag, subfields);\n}\n\n\nvoid CollectSuperiorOrParallelWorks(const MARC::Record &record, std::unordered_set<std::string> * const superior_or_parallel_works) {\n const std::set<std::string> parallel(MARC::ExtractCrossReferencePPNs(record));\n superior_or_parallel_works->insert(parallel.begin(), parallel.end());\n superior_or_parallel_works->insert(record.getSuperiorControlNumber());\n}\n\n\n\/\/ Get set of immediately belonging or superior or parallel records\nvoid GetSubsystemPPNSet(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer,\n std::vector<std::unordered_set<std::string>> * const subsystem_sets) {\n while (const MARC::Record record = marc_reader->read()) {\n if (IsRelBibRecord(record)) {\n ((*subsystem_sets)[RELBIB]).emplace(record.getControlNumber());\n CollectSuperiorOrParallelWorks(record, &((*subsystem_sets)[RELBIB]));\n }\n if (IsBibStudiesRecord(record)) {\n ((*subsystem_sets)[BIBSTUDIES]).emplace(record.getControlNumber());\n CollectSuperiorOrParallelWorks(record, &((*subsystem_sets)[BIBSTUDIES]));\n }\n marc_writer->write(record);\n }\n}\n\n\nvoid AddSubsystemTags(MARC::Reader * const marc_reader, MARC::Writer * const marc_writer,\n const std::vector<std::unordered_set<std::string>> &subsystem_sets) {\n unsigned record_count(0), modified_count(0);\n while (MARC::Record record = marc_reader->read()) {\n ++record_count;\n bool modified_record(false);\n if ((subsystem_sets[RELBIB]).find(record.getControlNumber()) != subsystem_sets[RELBIB].end()) {\n AddSubsystemTag(&record, RELBIB_TAG);\n modified_record = true;\n }\n if ((subsystem_sets[BIBSTUDIES]).find(record.getControlNumber()) != subsystem_sets[RELBIB].end()) {\n AddSubsystemTag(&record, BIBSTUDIES_TAG);\n modified_record = true;\n }\n if (modified_record)\n ++modified_count;\n marc_writer->write(record);\n }\n LOG_INFO(\"Modified \" + std::to_string(modified_count) + \" of \" + std::to_string(record_count) + \" records.\");\n}\n\n\nvoid InitializeSubsystemPPNSets(std::vector<std::unordered_set<std::string>> * const subsystem_ppn_sets) {\n for (unsigned i(0); i < NUM_OF_SUBSYSTEMS; ++i)\n subsystem_ppn_sets->push_back(std::unordered_set<std::string>());\n}\n\n\n} \/\/unnamed namespace\n\n\nint Main(int argc, char **argv) {\n if (argc != 3)\n Usage();\n\n const std::string marc_input_filename(argv[1]);\n const std::string marc_output_filename(argv[2]);\n if (unlikely(marc_input_filename == marc_output_filename))\n LOG_ERROR(\"Title data input file name equals output file name!\");\n\n std::vector<std::unordered_set<std::string>> subsystem_sets;\n InitializeSubsystemPPNSets(&subsystem_sets);\n\n std::unique_ptr<MARC::Reader> marc_reader(MARC::Reader::Factory(marc_input_filename));\n FileUtil::AutoTempFile tmp_marc_file(\"\/dev\/shm\/\", \".mrc\");\n std::unique_ptr<MARC::Writer> marc_tmp_writer(MARC::Writer::Factory(tmp_marc_file.getFilePath()));\n GetSubsystemPPNSet(marc_reader.get(), marc_tmp_writer.get(), &subsystem_sets);\n if (not marc_tmp_writer->flush())\n LOG_ERROR(\"Could not flush to \" + tmp_marc_file.getFilePath());\n std::unique_ptr<MARC::Reader> marc_tmp_reader(MARC::Reader::Factory(tmp_marc_file.getFilePath()));\n std::unique_ptr<MARC::Writer> marc_writer(MARC::Writer::Factory(marc_output_filename));\n AddSubsystemTags(marc_tmp_reader.get(), marc_writer.get(), subsystem_sets);\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ \n\/\/ client.cpp\n\/\/\n\/\/ Created by Peter Gusev on 07 March 2016.\n\/\/ Copyright 2013-2016 Regents of the University of California\n\/\/\n\n#include <algorithm>\n#include <boost\/make_shared.hpp>\n#include <ndn-cpp\/security\/key-chain.hpp>\n#include <ndn-cpp\/security\/identity\/memory-private-key-storage.hpp>\n#include <ndn-cpp\/security\/identity\/memory-identity-storage.hpp>\n#include <ndn-cpp\/security\/policy\/no-verify-policy-manager.hpp>\n\n#include \"client.hpp\"\n#include \"config.hpp\"\n#include \"renderer.hpp\"\n\nusing namespace std;\nusing namespace ndn;\n\n\/\/******************************************************************************\nvoid Client::run(unsigned int runTimeSec, unsigned int statSamplePeriodMs,\n const ClientParams& params, const std::string& instanceName)\n{\n\trunTimeSec_ = runTimeSec;\n\tstatSampleIntervalMs_ = statSamplePeriodMs;\n\tparams_ = params;\n instanceName_ = instanceName;\n\n\tbool run = setupConsumer();\n\trun |= setupProducer();\n\n\tif (!run) return;\n\n\tsetupStatGathering();\n\trunProcessLoop();\n\ttearDownStatGathering();\n\ttearDownProducer();\n\ttearDownConsumer();\n}\n\n\/\/******************************************************************************\nbool Client::setupConsumer()\n{\n\tif (!params_.isConsuming())\n\t\treturn false;\n\n\tConsumerClientParams ccp = params_.getConsumerParams();\n\n\tfor (auto p:ccp.fetchedStreams_)\n\t{\n\t\tndnrtc::GeneralConsumerParams gp = (p.type_ == ClientMediaStreamParams::MediaStreamType::MediaStreamTypeAudio ? ccp.generalAudioParams_ : ccp.generalVideoParams_);\n\t\tRemoteStream rs = initRemoteStream(p, gp);\n#warning check move semantics\n\t\tremoteStreams_.push_back(boost::move(rs));\n\n\t\tLogInfo(\"\") << \"Set up fetching from \" << p.sessionPrefix_ << \":\" \n\t\t\t<< p.streamName_ << endl;\n\t}\n\n\tLogInfo(\"\") << \"Fetching \" << remoteStreams_.size() << \" remote stream(s) total\" << endl;\n\n\treturn true;\n}\n\nbool Client::setupProducer()\n{\n\tif (!params_.isProducing())\n\t\treturn false;\n\n\tProducerClientParams pcp = params_.getProducerParams();\n\n\tfor (auto p:pcp.publishedStreams_)\n\t{\n\t\ttry\n\t\t{\n\t\t\tLocalStream ls = initLocalStream(p);\n\t\t\tlocalStreams_.push_back(boost::move(ls));\n\n\t\t\tLogInfo(\"\") << \"Set up publishing stream \" << pcp.prefix_ << \":\" \n\t\t\t\t<< p.streamName_ << endl;\n\t\t}\n\t\tcatch (const runtime_error& e)\n\t\t{\n\t\t\tLogError(\"\") << \"error while trying to publish stream \" << p.streamName_ << \": \"\n\t\t\t\t<< e.what() << endl;\n throw;\n\t\t}\n\t}\n\n\tLogInfo(\"\") << \"Publishing \" << localStreams_.size() << \" stream(s) total\" << endl;\n\treturn true;\n}\n\nvoid Client::setupStatGathering()\n{\n\tif (!params_.isGatheringStats())\n\t\treturn;\n\n\tLogInfo(\"\") << \"new stat colllector\" << endl;\n\tstatCollector_.reset(new StatCollector(io_));\n\t\n\tfor (auto& rs:remoteStreams_)\n\t\tstatCollector_->addStream(rs.getStream());\n\n\tstatCollector_->startCollecting(statSampleIntervalMs_, \n\t\tparams_.getGeneralParameters().logPath_, \n\t\tparams_.getConsumerParams().statGatheringParams_);\n\n\tLogInfo(\"\") << \"Gathering statistics into \" \n\t\t<< statCollector_->getWritersNumber() << \" files\" << std::endl;\n}\n\nvoid Client::runProcessLoop()\n{\n boost::asio::deadline_timer runTimer(io_);\n runTimer.expires_from_now(boost::posix_time::seconds(runTimeSec_));\n runTimer.wait();\n}\n\nvoid Client::tearDownStatGathering(){\n\tif (!params_.isGatheringStats())\n\t\treturn;\n\n\tstatCollector_->stop();\n\tstatCollector_.reset();\n\tLogInfo(\"\") << \"Stopped gathering statistics\" << std::endl;\n}\n\nvoid Client::tearDownProducer(){\n\tif (!params_.isProducing())\n\t\treturn;\n\n\tLogInfo(\"Tearing down producing...\");\n\n\tfor (auto& ls:localStreams_)\n\t{\n\t\tif (!ls.getVideoSource().get())\n\t\t\tboost::dynamic_pointer_cast<ndnrtc::LocalAudioStream>(ls.getStream())->stop();\n\t\telse\n\t\t\tls.stopSource();\n\n\t\tLogInfo(\"\") << \"...stopped publishing \" << ls.getStream()->getPrefix() << std::endl;\n\t}\n\tlocalStreams_.clear();\n}\n\nvoid Client::tearDownConsumer(){\n\tif (!params_.isConsuming())\n\t\treturn ;\n\n\tLogInfo(\"\") << \"Tearing down consuming...\" << std::endl;\n\n\tfor (auto& rs:remoteStreams_)\n\t{\n\t\tboost::dynamic_pointer_cast<ndnrtc::RemoteStream>(rs.getStream())->stop();\n\t\tLogInfo(\"\") << \"...stopped fetching from \" << rs.getStream()->getPrefix() << std::endl;\n\t}\n\tremoteStreams_.clear();\n}\n\nRemoteStream Client::initRemoteStream(const ConsumerStreamParams& p,\n\tconst ndnrtc::GeneralConsumerParams& gcp)\n{\n\tRendererInternal *renderer = (p.type_ == ConsumerStreamParams::MediaStreamTypeVideo ? new RendererInternal(p.streamSink_, true) : nullptr);\n\t\n\tif (p.type_ == ConsumerStreamParams::MediaStreamTypeVideo)\n\t{\n\t\tboost::shared_ptr<ndnrtc::RemoteVideoStream> \n\t\t\tremoteStream(boost::make_shared<ndnrtc::RemoteVideoStream>(io_, face_, keyChain_,\n\t\t\t\tp.sessionPrefix_, p.streamName_));\n\t\tremoteStream->setLogger(consumerLogger(p.sessionPrefix_, p.streamName_));\n\t\tremoteStream->start(p.threadToFetch_, renderer);\n\t\treturn RemoteStream(remoteStream, boost::shared_ptr<RendererInternal>(renderer));\n\t}\n\telse\n\t{\n\t\tboost::shared_ptr<ndnrtc::RemoteAudioStream>\n\t\t\tremoteStream(boost::make_shared<ndnrtc::RemoteAudioStream>(io_, face_, keyChain_,\n\t\t\t\tp.sessionPrefix_, p.streamName_));\n\t\tremoteStream->setLogger(consumerLogger(p.sessionPrefix_, p.streamName_));\n\t\tremoteStream->start(p.threadToFetch_);\n\t\treturn RemoteStream(remoteStream, boost::shared_ptr<RendererInternal>(renderer));\n\t}\n}\n\nLocalStream Client::initLocalStream(const ProducerStreamParams& p)\n{\n\tboost::shared_ptr<ndnrtc::IStream> localStream;\n\tboost::shared_ptr<VideoSource> videoSource;\n\tndnrtc::MediaStreamSettings settings(io_, p);\n\n\tsettings.keyChain_ = keyChain_.get();\n\tsettings.face_ = face_.get();\n\n\tif (p.type_ == ndnrtc::MediaStreamParams::MediaStreamTypeVideo)\n\t{\n\t\tLogDebug(\"\") << \"initializing video source at \" << p.source_ << endl;\n\n\t\tboost::shared_ptr<RawFrame> sampleFrame = sampleFrameForStream(p);\n\t\t\n\t\tLogDebug(\"\") << \"source should support frames of size \" \n\t\t\t<< sampleFrame->getWidth() << \"x\" << sampleFrame->getHeight() << endl;\n\t\tvideoSource.reset(new VideoSource(io_, p.source_, sampleFrame));\n\t\tLogDebug(\"\") << \"video source initialized\" << endl;\n\n\t\tboost::shared_ptr<ndnrtc::LocalVideoStream> s =\n\t\t\tboost::make_shared<ndnrtc::LocalVideoStream>(p.sessionPrefix_, settings);\n\n s->setLogger(producerLogger(p.streamName_));\n\t\tvideoSource->addCapturer(s.get());\n\t\tlocalStream = s;\n\n#warning double-check whether FPS should be 30\n\t\tLogDebug(\"\") << \"starting video source...\" << endl;\n\t\tvideoSource->start(30);\n\t\tLogDebug(\"\") << \"...video source started\" << endl;\n\t}\n\telse\n\t{\n\t\tboost::shared_ptr<ndnrtc::LocalAudioStream> s = \n\t\t\tboost::make_shared<ndnrtc::LocalAudioStream>(p.sessionPrefix_, settings);\n s->setLogger(producerLogger(p.streamName_));\n\t\ts->start();\n\t\tlocalStream = s;\n\t}\n\n\treturn LocalStream(localStream, videoSource);\n}\n\nboost::shared_ptr<RawFrame> Client::sampleFrameForStream(const ProducerStreamParams& p)\n{\n\tunsigned int width = 0, height = 0;\n\tp.getMaxResolution(width, height);\n\n\tif (width == 0 || height == 0)\n\t{\n\t\tstringstream ss;\n\t\tss << \"incorrect max resolution for stream \" << p.streamName_;\n\t\tthrow runtime_error(ss.str());\n\t}\n\n\treturn boost::shared_ptr<RawFrame>(new ArgbFrame(width, height));\n}\n\nboost::shared_ptr<ndnlog::new_api::Logger> \nClient::producerLogger(std::string streamName)\n{\n\tstd::stringstream logFileName;\n\tlogFileName << params_.getGeneralParameters().logPath_ << \"\/\" \n\t\t<< \"producer-\" << instanceName_ << \"-\" << streamName << \".log\";\n\tboost::shared_ptr<ndnlog::new_api::Logger> logger(new ndnlog::new_api::Logger(params_.getGeneralParameters().loggingLevel_,\n\t\tlogFileName.str()));\n\n\treturn logger;\n}\n\nboost::shared_ptr<ndnlog::new_api::Logger> \nClient::consumerLogger(std::string prefix, std::string streamName)\n{\n\tstd::replace(prefix.begin(), prefix.end(), '\/', '-');\n\tstd::stringstream logFileName;\n\tlogFileName << params_.getGeneralParameters().logPath_ << \"\/\" \n\t\t<< \"consumer\" << prefix << \"-\" << streamName << \".log\" << std::endl;\n\tboost::shared_ptr<ndnlog::new_api::Logger> logger(new ndnlog::new_api::Logger(params_.getGeneralParameters().loggingLevel_,\n\t\tlogFileName.str()));\n\n\treturn logger;\n}<commit_msg>[client] fixed consumer log filename<commit_after>\/\/ \n\/\/ client.cpp\n\/\/\n\/\/ Created by Peter Gusev on 07 March 2016.\n\/\/ Copyright 2013-2016 Regents of the University of California\n\/\/\n\n#include <algorithm>\n#include <boost\/make_shared.hpp>\n#include <ndn-cpp\/security\/key-chain.hpp>\n#include <ndn-cpp\/security\/identity\/memory-private-key-storage.hpp>\n#include <ndn-cpp\/security\/identity\/memory-identity-storage.hpp>\n#include <ndn-cpp\/security\/policy\/no-verify-policy-manager.hpp>\n\n#include \"client.hpp\"\n#include \"config.hpp\"\n#include \"renderer.hpp\"\n\nusing namespace std;\nusing namespace ndn;\n\n\/\/******************************************************************************\nvoid Client::run(unsigned int runTimeSec, unsigned int statSamplePeriodMs,\n const ClientParams& params, const std::string& instanceName)\n{\n\trunTimeSec_ = runTimeSec;\n\tstatSampleIntervalMs_ = statSamplePeriodMs;\n\tparams_ = params;\n instanceName_ = instanceName;\n\n\tbool run = setupConsumer();\n\trun |= setupProducer();\n\n\tif (!run) return;\n\n\tsetupStatGathering();\n\trunProcessLoop();\n\ttearDownStatGathering();\n\ttearDownProducer();\n\ttearDownConsumer();\n}\n\n\/\/******************************************************************************\nbool Client::setupConsumer()\n{\n\tif (!params_.isConsuming())\n\t\treturn false;\n\n\tConsumerClientParams ccp = params_.getConsumerParams();\n\n\tfor (auto p:ccp.fetchedStreams_)\n\t{\n\t\tndnrtc::GeneralConsumerParams gp = (p.type_ == ClientMediaStreamParams::MediaStreamType::MediaStreamTypeAudio ? ccp.generalAudioParams_ : ccp.generalVideoParams_);\n\t\tRemoteStream rs = initRemoteStream(p, gp);\n#warning check move semantics\n\t\tremoteStreams_.push_back(boost::move(rs));\n\n\t\tLogInfo(\"\") << \"Set up fetching from \" << p.sessionPrefix_ << \":\" \n\t\t\t<< p.streamName_ << endl;\n\t}\n\n\tLogInfo(\"\") << \"Fetching \" << remoteStreams_.size() << \" remote stream(s) total\" << endl;\n\n\treturn true;\n}\n\nbool Client::setupProducer()\n{\n\tif (!params_.isProducing())\n\t\treturn false;\n\n\tProducerClientParams pcp = params_.getProducerParams();\n\n\tfor (auto p:pcp.publishedStreams_)\n\t{\n\t\ttry\n\t\t{\n\t\t\tLocalStream ls = initLocalStream(p);\n\t\t\tlocalStreams_.push_back(boost::move(ls));\n\n\t\t\tLogInfo(\"\") << \"Set up publishing stream \" << pcp.prefix_ << \":\" \n\t\t\t\t<< p.streamName_ << endl;\n\t\t}\n\t\tcatch (const runtime_error& e)\n\t\t{\n\t\t\tLogError(\"\") << \"error while trying to publish stream \" << p.streamName_ << \": \"\n\t\t\t\t<< e.what() << endl;\n throw;\n\t\t}\n\t}\n\n\tLogInfo(\"\") << \"Publishing \" << localStreams_.size() << \" stream(s) total\" << endl;\n\treturn true;\n}\n\nvoid Client::setupStatGathering()\n{\n\tif (!params_.isGatheringStats())\n\t\treturn;\n\n\tLogInfo(\"\") << \"new stat colllector\" << endl;\n\tstatCollector_.reset(new StatCollector(io_));\n\t\n\tfor (auto& rs:remoteStreams_)\n\t\tstatCollector_->addStream(rs.getStream());\n\n\tstatCollector_->startCollecting(statSampleIntervalMs_, \n\t\tparams_.getGeneralParameters().logPath_, \n\t\tparams_.getConsumerParams().statGatheringParams_);\n\n\tLogInfo(\"\") << \"Gathering statistics into \" \n\t\t<< statCollector_->getWritersNumber() << \" files\" << std::endl;\n}\n\nvoid Client::runProcessLoop()\n{\n boost::asio::deadline_timer runTimer(io_);\n runTimer.expires_from_now(boost::posix_time::seconds(runTimeSec_));\n runTimer.wait();\n}\n\nvoid Client::tearDownStatGathering(){\n\tif (!params_.isGatheringStats())\n\t\treturn;\n\n\tstatCollector_->stop();\n\tstatCollector_.reset();\n\tLogInfo(\"\") << \"Stopped gathering statistics\" << std::endl;\n}\n\nvoid Client::tearDownProducer(){\n\tif (!params_.isProducing())\n\t\treturn;\n\n\tLogInfo(\"Tearing down producing...\");\n\n\tfor (auto& ls:localStreams_)\n\t{\n\t\tif (!ls.getVideoSource().get())\n\t\t\tboost::dynamic_pointer_cast<ndnrtc::LocalAudioStream>(ls.getStream())->stop();\n\t\telse\n\t\t\tls.stopSource();\n\n\t\tLogInfo(\"\") << \"...stopped publishing \" << ls.getStream()->getPrefix() << std::endl;\n\t}\n\tlocalStreams_.clear();\n}\n\nvoid Client::tearDownConsumer(){\n\tif (!params_.isConsuming())\n\t\treturn ;\n\n\tLogInfo(\"\") << \"Tearing down consuming...\" << std::endl;\n\n\tfor (auto& rs:remoteStreams_)\n\t{\n\t\tboost::dynamic_pointer_cast<ndnrtc::RemoteStream>(rs.getStream())->stop();\n\t\tLogInfo(\"\") << \"...stopped fetching from \" << rs.getStream()->getPrefix() << std::endl;\n\t}\n\tremoteStreams_.clear();\n}\n\nRemoteStream Client::initRemoteStream(const ConsumerStreamParams& p,\n\tconst ndnrtc::GeneralConsumerParams& gcp)\n{\n\tRendererInternal *renderer = (p.type_ == ConsumerStreamParams::MediaStreamTypeVideo ? new RendererInternal(p.streamSink_, true) : nullptr);\n\t\n\tif (p.type_ == ConsumerStreamParams::MediaStreamTypeVideo)\n\t{\n\t\tboost::shared_ptr<ndnrtc::RemoteVideoStream> \n\t\t\tremoteStream(boost::make_shared<ndnrtc::RemoteVideoStream>(io_, face_, keyChain_,\n\t\t\t\tp.sessionPrefix_, p.streamName_));\n\t\tremoteStream->setLogger(consumerLogger(p.sessionPrefix_, p.streamName_));\n\t\tremoteStream->start(p.threadToFetch_, renderer);\n\t\treturn RemoteStream(remoteStream, boost::shared_ptr<RendererInternal>(renderer));\n\t}\n\telse\n\t{\n\t\tboost::shared_ptr<ndnrtc::RemoteAudioStream>\n\t\t\tremoteStream(boost::make_shared<ndnrtc::RemoteAudioStream>(io_, face_, keyChain_,\n\t\t\t\tp.sessionPrefix_, p.streamName_));\n\t\tremoteStream->setLogger(consumerLogger(p.sessionPrefix_, p.streamName_));\n\t\tremoteStream->start(p.threadToFetch_);\n\t\treturn RemoteStream(remoteStream, boost::shared_ptr<RendererInternal>(renderer));\n\t}\n}\n\nLocalStream Client::initLocalStream(const ProducerStreamParams& p)\n{\n\tboost::shared_ptr<ndnrtc::IStream> localStream;\n\tboost::shared_ptr<VideoSource> videoSource;\n\tndnrtc::MediaStreamSettings settings(io_, p);\n\n\tsettings.keyChain_ = keyChain_.get();\n\tsettings.face_ = face_.get();\n\n\tif (p.type_ == ndnrtc::MediaStreamParams::MediaStreamTypeVideo)\n\t{\n\t\tLogDebug(\"\") << \"initializing video source at \" << p.source_ << endl;\n\n\t\tboost::shared_ptr<RawFrame> sampleFrame = sampleFrameForStream(p);\n\t\t\n\t\tLogDebug(\"\") << \"source should support frames of size \" \n\t\t\t<< sampleFrame->getWidth() << \"x\" << sampleFrame->getHeight() << endl;\n\t\tvideoSource.reset(new VideoSource(io_, p.source_, sampleFrame));\n\t\tLogDebug(\"\") << \"video source initialized\" << endl;\n\n\t\tboost::shared_ptr<ndnrtc::LocalVideoStream> s =\n\t\t\tboost::make_shared<ndnrtc::LocalVideoStream>(p.sessionPrefix_, settings);\n\n s->setLogger(producerLogger(p.streamName_));\n\t\tvideoSource->addCapturer(s.get());\n\t\tlocalStream = s;\n\n#warning double-check whether FPS should be 30\n\t\tLogDebug(\"\") << \"starting video source...\" << endl;\n\t\tvideoSource->start(30);\n\t\tLogDebug(\"\") << \"...video source started\" << endl;\n\t}\n\telse\n\t{\n\t\tboost::shared_ptr<ndnrtc::LocalAudioStream> s = \n\t\t\tboost::make_shared<ndnrtc::LocalAudioStream>(p.sessionPrefix_, settings);\n s->setLogger(producerLogger(p.streamName_));\n\t\ts->start();\n\t\tlocalStream = s;\n\t}\n\n\treturn LocalStream(localStream, videoSource);\n}\n\nboost::shared_ptr<RawFrame> Client::sampleFrameForStream(const ProducerStreamParams& p)\n{\n\tunsigned int width = 0, height = 0;\n\tp.getMaxResolution(width, height);\n\n\tif (width == 0 || height == 0)\n\t{\n\t\tstringstream ss;\n\t\tss << \"incorrect max resolution for stream \" << p.streamName_;\n\t\tthrow runtime_error(ss.str());\n\t}\n\n\treturn boost::shared_ptr<RawFrame>(new ArgbFrame(width, height));\n}\n\nboost::shared_ptr<ndnlog::new_api::Logger> \nClient::producerLogger(std::string streamName)\n{\n\tstd::stringstream logFileName;\n\tlogFileName << params_.getGeneralParameters().logPath_ << \"\/\" \n\t\t<< \"producer-\" << instanceName_ << \"-\" << streamName << \".log\";\n\tboost::shared_ptr<ndnlog::new_api::Logger> logger(new ndnlog::new_api::Logger(params_.getGeneralParameters().loggingLevel_,\n\t\tlogFileName.str()));\n\n\treturn logger;\n}\n\nboost::shared_ptr<ndnlog::new_api::Logger> \nClient::consumerLogger(std::string prefix, std::string streamName)\n{\n\tstd::replace(prefix.begin(), prefix.end(), '\/', '-');\n\tstd::stringstream logFileName;\n\tlogFileName << params_.getGeneralParameters().logPath_ << \"\/\" \n\t\t<< \"consumer\" << prefix << \"-\" << streamName << \".log\";\n\tboost::shared_ptr<ndnlog::new_api::Logger> logger(new ndnlog::new_api::Logger(params_.getGeneralParameters().loggingLevel_,\n\t\tlogFileName.str()));\n\n\treturn logger;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright (C) 2000 Frans Kaashoek (kaashoek@lcs.mit.edu)\n * Copyright (C) 2001 Frans Kaashoek (kaashoek@lcs.mit.edu) and \n * Frank Dabek (fdabek@lcs.mit.edu).\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include \"chord.h\"\n#include \"chord_util.h\"\n#include \"location.h\"\n#include \"route.h\"\n#include \"transport_prot.h\"\n\nint logbase; \/\/ base = 2 ^ logbase\n\nchord::chord (str _wellknownhost, int _wellknownport, \n\t str _myname, int port, int max_cache,\n\t int server_selection_mode,\n\t int l_mode, int _logbase) :\n myname (_myname),\n ss_mode (server_selection_mode % 10),\n lookup_mode (l_mode),\n active (NULL)\n{\n logbase = _logbase;\n myport = startchord (port);\n\n wellknown_node.r.hostname = _wellknownhost;\n wellknown_node.r.port = _wellknownport ? _wellknownport : myport;\n wellknown_node.x = make_chordID (wellknown_node.r.hostname,\n\t\t\t\t wellknown_node.r.port);\n wellknown_node.coords.setsize (NCOORDS);\n \n warnx << \"chord: running on \" << myname << \":\" << myport << \"\\n\";\n\n nrcv = New refcounted<u_int32_t>;\n *nrcv = 0;\n locations = New refcounted<locationtable> (nrcv, max_cache);\n\n \/\/BAD LOC (ok)\n bool ok = locations->insert (wellknown_node);\n if (!ok) {\n warn << \"Well known host failed to verify! Bailing.\\n\";\n exit (0);\n }\n\n nvnode = 0;\n srandom ((unsigned int) (getusec() & 0xFFFFFFFF));\n}\n\nvoid\nchord::tcpclient_cb (int srvfd)\n{\n int fd = accept (srvfd, NULL, NULL);\n if (fd < 0)\n warn << \"chord: accept failed \" << strerror (errno) << \"\\n\";\n else {\n ptr<axprt> x = axprt_stream::alloc (fd, 230000);\n\n ptr<asrv> s = asrv::alloc (x, transport_program_1);\n s->setcb (wrap (mkref(this), &chord::dispatch, s));\n }\n}\n\n\nint\nchord::startchord (int myp, int type)\n{\n \n int srvfd = inetsocket (type, myp);\n if (srvfd < 0)\n fatal (\"binding %s port %d: %m\\n\",\n\t (type == SOCK_DGRAM ? \"UDP\" : \"TCP\"), myp);\n \n if (myp == 0) {\n struct sockaddr_in addr;\n socklen_t len = sizeof (addr);\n bzero (&addr, sizeof (addr));\n if (getsockname (srvfd, (sockaddr *) &addr, &len) < 0) \n fatal (\"getsockname failed %m\\n\");\n myp = ntohs (addr.sin_port);\n }\n\n \n if (type == SOCK_DGRAM) {\n x_dgram = axprt_dgram::alloc (srvfd, sizeof(sockaddr), 230000);\n ptr<asrv> s = asrv::alloc (x_dgram, transport_program_1);\n s->setcb (wrap (mkref(this), &chord::dispatch, s));\n }\n else {\n int ret = listen (srvfd, 1000);\n assert (ret == 0);\n fdcb (srvfd, selread, wrap (this, &chord::tcpclient_cb, srvfd));\n }\n \n return myp;\n}\n\n\nint\nchord::startchord (int myp)\n{\n \/\/ see also locationtable constructor.\n if (chord_rpc_style == CHORD_RPC_SFST) {\n \/\/ Ensure the DGRAM and STREAM sockets are on same port #,\n \/\/ since it is included in the Chord ID's hash.\n myp = startchord (myp, SOCK_STREAM);\n }\n\n return startchord (myp, SOCK_DGRAM);\n}\n\n\n\nptr<vnode>\nchord::newvnode (cbjoin_t cb, ptr<fingerlike> fingers, ptr<route_factory> f)\n{\n if (nvnode > max_vnodes)\n fatal << \"Maximum number of vnodes (\" << max_vnodes << \") reached.\\n\";\n \n chordID newID = init_chordID (nvnode, myname, myport);\n warn << \"creating new vnode: \" << newID << \"\\n\";\n\n vec<float> coords;\n warn << gettime () << \" coords are: \";\n for (int i = 0; i < NCOORDS; i++) {\n coords.push_back (uniform_random_f (1000.0));\n warnx << (int) coords[i] << \" \" ;\n }\n warnx << \"\\n\";\n locations->insert (newID, myname, myport, coords);\n \/\/ force an update of the coords in the locationtable\n locations->set_coords (newID, coords);\n\n#if 0 \n if (newID != wellknown_node.x) {\n \/\/ It's not yet strictly speaking useful to other nodes yet.\n \/\/\/BAD LOC (ok)\n bool ok = locations->insert (newID, myname, myport);\n assert (ok);\n }\n#endif \/* 0 *\/\n\n ptr<vnode> vnodep = vnode::produce_vnode (locations, fingers, f,\n\t\t\t\t\t mkref (this), newID, \n\t\t\t\t\t nvnode, ss_mode,\n\t\t\t\t\t lookup_mode);\n f->setvnode (vnodep);\n \n if (!active) active = vnodep;\n nvnode++;\n vnodes.insert (newID, vnodep);\n \n if (newID != wellknown_node.x) {\n vnodep->join (wellknown_node, cb);\n } else {\n vnodep->stabilize ();\n (*cb) (vnodep, CHORD_OK);\n }\n return vnodep;\n}\n\nvoid\nchord::stats_cb (const chordID &k, ptr<vnode> v) { \n v->stats();\n}\n\nvoid\nchord::stats ()\n{\n warnx << \"CHORD NODE STATS\\n\";\n warnx << \"# vnodes: \" << nvnode << \"\\n\";\n vnodes.traverse (wrap (this, &chord::stats_cb));\n locations->stats ();\n}\n\nvoid\nchord::print_cb (const chordID &k, ptr<vnode> v) {\n v->print ();\n}\n\nvoid\nchord::print () {\n vnodes.traverse (wrap (this, &chord::print_cb));\n}\n\nvoid\nchord::stop_cb (const chordID &k, ptr<vnode> v) {\n v->stop ();\n}\n\nvoid\nchord::stop () {\n vnodes.traverse (wrap (this, &chord::stop_cb));\n}\n\nconst rpc_program *\nchord::get_program (int progno)\n{\n for (unsigned int i = 0; i < handledProgs.size (); i++)\n if (progno == (int)handledProgs[i]->progno)\n return handledProgs[i];\n return NULL;\n}\n\n\nbool\nchord::isHandled (int progno) {\n for (u_int i = 0; i < handledProgs.size (); i++)\n if (progno == (int)handledProgs[i]->progno) return true;\n return false;\n}\nvoid\nchord::handleProgram (const rpc_program &prog) {\n warn << \"chord::handleProgram: \" << prog.progno << \"\\n\";\n if (isHandled (prog.progno)) return;\n else {\n handledProgs.push_back (&prog);\n }\n}\n\n\nvoid\nchord::dispatch (ptr<asrv> s, svccb *sbp)\n{\n if (!sbp) {\n s->setcb (NULL);\n return;\n }\n (*nrcv)++;\n \n \/\/autocache nodes\n dorpc_arg *arg = sbp->template getarg<dorpc_arg> ();\n if (arg && !locations->cached (arg->src_id)) {\n const sockaddr *sa = sbp->getsa ();\n net_address netaddr;\n netaddr.port = ((sockaddr_in *)sa)->sin_port;\n str addrstr (inet_ntoa (((sockaddr_in *)sa)->sin_addr));\n netaddr.hostname = addrstr;\n warn << \"autocaching \" << addrstr << \":\" << netaddr.port << \" in ::dispatch\\n\";\n vec<float> coords = convert_coords (arg);\n locations->insert (arg->src_id, netaddr.hostname, netaddr.port, coords);\n }\n\n switch (sbp->proc ()) {\n case TRANSPORTPROC_NULL:\n {\n sbp->reply (NULL);\n break;\n }\n case TRANSPORTPROC_DORPC:\n {\n \/\/v (the destination chordID) is at the top of the header\n chordID *v = sbp->template getarg<chordID> ();\n vnode *vnodep = vnodes[*v];\n if (!vnodep) {\n\twarnx << \"CHORD: unknown node processing procedure \" << sbp->proc ()\n\t << \" request \" << *v << \"\\n\";\n\tsbp->replyref (chordstat (CHORD_UNKNOWNNODE));\n\treturn;\n }\n \n \/\/find the program\n const rpc_program *prog = get_program (arg->progno);\n if (!prog) \n\tfatal << \"bad prog: \" << arg->progno << \"\\n\";\n\n \n \/\/unmarshall the args\n char *arg_base = (char *)(arg->args.base ());\n int arg_len = arg->args.size ();\n \n xdrmem x (arg_base, arg_len, XDR_DECODE);\n xdrproc_t proc = prog->tbl[arg->procno].xdr_arg;\n assert (proc);\n \n void *unmarshalled_args = prog->tbl[arg->procno].alloc_arg ();\n if (!proc (x.xdrp (), unmarshalled_args)) {\n\twarn << \"dispatch: error unmarshalling arguments\\n\";\n\tsbp->replyref (chordstat (CHORD_RPCFAILURE));\n\treturn;\n }\n \n user_args *ua = New user_args (sbp, unmarshalled_args, \n\t\t\t\t prog, arg->procno);\n vnodep->fill_user_args (ua);\n\n \/\/call the handler\n if (!vnodep->progHandled (arg->progno)) {\n\twarn << \"program not handled!\\n\";\n\tchordstat res = CHORD_NOHANDLER;\n\tsbp->replyref (res);\n } else {\n\tcbdispatch_t dispatch = vnodep->getHandler(arg->progno);\n\t(dispatch)(ua);\n } \n \n }\n break;\n default:\n fatal << \"PROC not handled\\n\";\n }\n\t\t\n}\n\n\n\n<commit_msg>Make up initial coordinates for well-known node in the same manner as everything else instead of letting them come from uninitialized memory values. If this chord object is the well-known node, then wait for first newvnode call to insert into locationtable.<commit_after>\/*\n *\n * Copyright (C) 2000 Frans Kaashoek (kaashoek@lcs.mit.edu)\n * Copyright (C) 2001 Frans Kaashoek (kaashoek@lcs.mit.edu) and \n * Frank Dabek (fdabek@lcs.mit.edu).\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\n * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n *\/\n\n#include \"chord.h\"\n#include \"chord_util.h\"\n#include \"location.h\"\n#include \"route.h\"\n#include \"transport_prot.h\"\n\nint logbase; \/\/ base = 2 ^ logbase\n\nchord::chord (str _wellknownhost, int _wellknownport, \n\t str _myname, int port, int max_cache,\n\t int server_selection_mode,\n\t int l_mode, int _logbase) :\n myname (_myname),\n ss_mode (server_selection_mode % 10),\n lookup_mode (l_mode),\n active (NULL)\n{\n logbase = _logbase;\n myport = startchord (port);\n\n warnx << \"chord: running on \" << myname << \":\" << myport << \"\\n\";\n\n nrcv = New refcounted<u_int32_t>;\n *nrcv = 0;\n locations = New refcounted<locationtable> (nrcv, max_cache);\n \n wellknown_node.r.hostname = _wellknownhost;\n wellknown_node.r.port = _wellknownport ? _wellknownport : myport;\n wellknown_node.x = make_chordID (wellknown_node.r.hostname,\n\t\t\t\t wellknown_node.r.port);\n wellknown_node.coords.setsize (NCOORDS);\n \/\/ Make up some random initial information for this other node.\n for (int i = 0; i < NCOORDS; i++)\n wellknown_node.coords[i] = (int) uniform_random_f (1000.0);\n\n if (myname != _wellknownhost || myport != _wellknownport) {\n bool ok = locations->insert (wellknown_node);\n if (!ok) {\n warn << \"Well known host failed to verify! Bailing.\\n\";\n exit (0);\n }\n }\n\n nvnode = 0;\n srandom ((unsigned int) (getusec() & 0xFFFFFFFF));\n}\n\nvoid\nchord::tcpclient_cb (int srvfd)\n{\n int fd = accept (srvfd, NULL, NULL);\n if (fd < 0)\n warn << \"chord: accept failed \" << strerror (errno) << \"\\n\";\n else {\n ptr<axprt> x = axprt_stream::alloc (fd, 230000);\n\n ptr<asrv> s = asrv::alloc (x, transport_program_1);\n s->setcb (wrap (mkref(this), &chord::dispatch, s));\n }\n}\n\n\nint\nchord::startchord (int myp, int type)\n{\n \n int srvfd = inetsocket (type, myp);\n if (srvfd < 0)\n fatal (\"binding %s port %d: %m\\n\",\n\t (type == SOCK_DGRAM ? \"UDP\" : \"TCP\"), myp);\n \n if (myp == 0) {\n struct sockaddr_in addr;\n socklen_t len = sizeof (addr);\n bzero (&addr, sizeof (addr));\n if (getsockname (srvfd, (sockaddr *) &addr, &len) < 0) \n fatal (\"getsockname failed %m\\n\");\n myp = ntohs (addr.sin_port);\n }\n\n \n if (type == SOCK_DGRAM) {\n x_dgram = axprt_dgram::alloc (srvfd, sizeof(sockaddr), 230000);\n ptr<asrv> s = asrv::alloc (x_dgram, transport_program_1);\n s->setcb (wrap (mkref(this), &chord::dispatch, s));\n }\n else {\n int ret = listen (srvfd, 1000);\n assert (ret == 0);\n fdcb (srvfd, selread, wrap (this, &chord::tcpclient_cb, srvfd));\n }\n \n return myp;\n}\n\n\nint\nchord::startchord (int myp)\n{\n \/\/ see also locationtable constructor.\n if (chord_rpc_style == CHORD_RPC_SFST) {\n \/\/ Ensure the DGRAM and STREAM sockets are on same port #,\n \/\/ since it is included in the Chord ID's hash.\n myp = startchord (myp, SOCK_STREAM);\n }\n\n return startchord (myp, SOCK_DGRAM);\n}\n\n\n\nptr<vnode>\nchord::newvnode (cbjoin_t cb, ptr<fingerlike> fingers, ptr<route_factory> f)\n{\n if (nvnode > max_vnodes)\n fatal << \"Maximum number of vnodes (\" << max_vnodes << \") reached.\\n\";\n \n chordID newID = init_chordID (nvnode, myname, myport);\n warn << \"creating new vnode: \" << newID << \"\\n\";\n\n vec<float> coords;\n warn << gettime () << \" coords are: \";\n for (int i = 0; i < NCOORDS; i++) {\n coords.push_back (uniform_random_f (1000.0));\n warnx << (int) coords[i] << \" \" ;\n }\n warnx << \"\\n\";\n locations->insert (newID, myname, myport, coords);\n\n#if 0 \n if (newID != wellknown_node.x) {\n \/\/ It's not yet strictly speaking useful to other nodes yet.\n \/\/\/BAD LOC (ok)\n bool ok = locations->insert (newID, myname, myport);\n assert (ok);\n }\n#endif \/* 0 *\/\n\n ptr<vnode> vnodep = vnode::produce_vnode (locations, fingers, f,\n\t\t\t\t\t mkref (this), newID, \n\t\t\t\t\t nvnode, ss_mode,\n\t\t\t\t\t lookup_mode);\n f->setvnode (vnodep);\n \n if (!active) active = vnodep;\n nvnode++;\n vnodes.insert (newID, vnodep);\n \n if (newID != wellknown_node.x) {\n vnodep->join (wellknown_node, cb);\n } else {\n vnodep->stabilize ();\n (*cb) (vnodep, CHORD_OK);\n }\n return vnodep;\n}\n\nvoid\nchord::stats_cb (const chordID &k, ptr<vnode> v) { \n v->stats();\n}\n\nvoid\nchord::stats ()\n{\n warnx << \"CHORD NODE STATS\\n\";\n warnx << \"# vnodes: \" << nvnode << \"\\n\";\n vnodes.traverse (wrap (this, &chord::stats_cb));\n locations->stats ();\n}\n\nvoid\nchord::print_cb (const chordID &k, ptr<vnode> v) {\n v->print ();\n}\n\nvoid\nchord::print () {\n vnodes.traverse (wrap (this, &chord::print_cb));\n}\n\nvoid\nchord::stop_cb (const chordID &k, ptr<vnode> v) {\n v->stop ();\n}\n\nvoid\nchord::stop () {\n vnodes.traverse (wrap (this, &chord::stop_cb));\n}\n\nconst rpc_program *\nchord::get_program (int progno)\n{\n for (unsigned int i = 0; i < handledProgs.size (); i++)\n if (progno == (int)handledProgs[i]->progno)\n return handledProgs[i];\n return NULL;\n}\n\n\nbool\nchord::isHandled (int progno) {\n for (u_int i = 0; i < handledProgs.size (); i++)\n if (progno == (int)handledProgs[i]->progno) return true;\n return false;\n}\nvoid\nchord::handleProgram (const rpc_program &prog) {\n warn << \"chord::handleProgram: \" << prog.progno << \"\\n\";\n if (isHandled (prog.progno)) return;\n else {\n handledProgs.push_back (&prog);\n }\n}\n\n\nvoid\nchord::dispatch (ptr<asrv> s, svccb *sbp)\n{\n if (!sbp) {\n s->setcb (NULL);\n return;\n }\n (*nrcv)++;\n \n \/\/autocache nodes\n dorpc_arg *arg = sbp->template getarg<dorpc_arg> ();\n if (arg && !locations->cached (arg->src_id)) {\n const sockaddr *sa = sbp->getsa ();\n net_address netaddr;\n netaddr.port = ((sockaddr_in *)sa)->sin_port;\n str addrstr (inet_ntoa (((sockaddr_in *)sa)->sin_addr));\n netaddr.hostname = addrstr;\n warn << \"autocaching \" << addrstr << \":\" << netaddr.port << \" in ::dispatch\\n\";\n vec<float> coords = convert_coords (arg);\n locations->insert (arg->src_id, netaddr.hostname, netaddr.port, coords);\n }\n\n switch (sbp->proc ()) {\n case TRANSPORTPROC_NULL:\n {\n sbp->reply (NULL);\n break;\n }\n case TRANSPORTPROC_DORPC:\n {\n \/\/v (the destination chordID) is at the top of the header\n chordID *v = sbp->template getarg<chordID> ();\n vnode *vnodep = vnodes[*v];\n if (!vnodep) {\n\twarnx << \"CHORD: unknown node processing procedure \" << sbp->proc ()\n\t << \" request \" << *v << \"\\n\";\n\tsbp->replyref (chordstat (CHORD_UNKNOWNNODE));\n\treturn;\n }\n \n \/\/find the program\n const rpc_program *prog = get_program (arg->progno);\n if (!prog) \n\tfatal << \"bad prog: \" << arg->progno << \"\\n\";\n\n \n \/\/unmarshall the args\n char *arg_base = (char *)(arg->args.base ());\n int arg_len = arg->args.size ();\n \n xdrmem x (arg_base, arg_len, XDR_DECODE);\n xdrproc_t proc = prog->tbl[arg->procno].xdr_arg;\n assert (proc);\n \n void *unmarshalled_args = prog->tbl[arg->procno].alloc_arg ();\n if (!proc (x.xdrp (), unmarshalled_args)) {\n\twarn << \"dispatch: error unmarshalling arguments\\n\";\n\tsbp->replyref (chordstat (CHORD_RPCFAILURE));\n\treturn;\n }\n \n user_args *ua = New user_args (sbp, unmarshalled_args, \n\t\t\t\t prog, arg->procno);\n vnodep->fill_user_args (ua);\n\n \/\/call the handler\n if (!vnodep->progHandled (arg->progno)) {\n\twarn << \"program not handled!\\n\";\n\tchordstat res = CHORD_NOHANDLER;\n\tsbp->replyref (res);\n } else {\n\tcbdispatch_t dispatch = vnodep->getHandler(arg->progno);\n\t(dispatch)(ua);\n } \n \n }\n break;\n default:\n fatal << \"PROC not handled\\n\";\n }\n\t\t\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Software License Agreement (BSD License)\n *\n * Point Cloud Library (PCL) - www.pointclouds.org\n * Copyright (c) 2010-2011, Willow Garage, Inc.\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\/\n\n#ifndef PCL_PCA_IMPL_HPP\n#define PCL_PCA_IMPL_HPP\n\n#include <Eigen\/Eigenvalues>\n#include \"pcl\/point_types.h\"\n#include \"pcl\/common\/centroid.h\"\n#include \"pcl\/common\/transforms.h\"\n#include \"pcl\/exceptions.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT>\npcl::PCA<PointT>::PCA (const pcl::PointCloud<PointT>& X, bool basis_only)\n{\n Base ();\n basis_only_ = basis_only;\n setInputCloud (X.makeShared ());\n compute_done_ = initCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> bool\npcl::PCA<PointT>::initCompute () \n{\n if(!Base::initCompute ())\n {\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::initCompute] failed\");\n return (false);\n }\n if(indices_->size () < 3)\n {\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::initCompute] number of points < 3\");\n return (false);\n }\n \n \/\/ Compute mean\n mean_ = Eigen::Vector4f::Zero ();\n compute3DCentroid (*input_, *indices_, mean_); \n \/\/ Compute demeanished cloud\n Eigen::MatrixXf cloud_demean;\n demeanPointCloud (*input_, *indices_, mean_, cloud_demean);\n assert (cloud_demean.cols () == int (indices_->size ()));\n \/\/ Compute the product cloud_demean * cloud_demean^T\n Eigen::Matrix3f alpha = cloud_demean.topRows<3> () * cloud_demean.topRows<3> ().transpose ();\n \n \/\/ Compute eigen vectors and values\n Eigen::SelfAdjointEigenSolver<Eigen::Matrix3f> evd (alpha);\n \/\/ Organize eigenvectors and eigenvalues in ascendent order\n for (int i = 0; i < 3; ++i)\n {\n eigenvalues_[i] = evd.eigenvalues () [2-i];\n eigenvectors_.col (i) = evd.eigenvectors ().col (2-i);\n }\n \/\/ If not basis only then compute the coefficients\n\n if (!basis_only_)\n \/\/ 3x3 = 3x3 * 3x3\n coefficients_ = eigenvectors_.transpose() * (cloud_demean.topRows<3>()).leftCols<3> ();\n compute_done_ = true;\n return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void \npcl::PCA<PointT>::update (const PointT& input_point, FLAG flag) \n{\n if (!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::update] PCA initCompute failed\");\n\n Eigen::Vector3f input (input_point.x, input_point.y, input_point.z);\n const size_t n = eigenvectors_.cols ();\/\/ number of eigen vectors\n Eigen::VectorXf meanp = (float(n) * (mean_.head<3>() + input)) \/ float(n + 1);\n Eigen::VectorXf a = eigenvectors_.transpose() * (input - mean_.head<3>());\n Eigen::VectorXf y = (eigenvectors_ * a) + mean_.head<3>();\n Eigen::VectorXf h = y - input;\n if (h.norm() > 0) \n h.normalize ();\n else\n h.setZero ();\n float gamma = h.dot(input - mean_.head<3>());\n Eigen::MatrixXf D = Eigen::MatrixXf::Zero (a.size() + 1, a.size() + 1);\n D.block(0,0,n,n) = a * a.transpose();\n D \/= float(n)\/float((n+1) * (n+1));\n for(std::size_t i=0; i < a.size(); i++) {\n D(i,i)+= float(n)\/float(n+1)*eigenvalues_(i);\n D(D.rows()-1,i) = float(n) \/ float((n+1) * (n+1)) * gamma * a(i);\n D(i,D.cols()-1) = D(D.rows()-1,i);\n D(D.rows()-1,D.cols()-1) = float(n)\/float((n+1) * (n+1)) * gamma * gamma;\n }\n\n Eigen::MatrixXf R(D.rows(), D.cols());\n Eigen::EigenSolver<Eigen::MatrixXf> D_evd (D, false);\n Eigen::VectorXf alphap = D_evd.eigenvalues().real();\n eigenvalues_.resize(eigenvalues_.size() +1);\n for(std::size_t i=0;i<eigenvalues_.size();i++) {\n eigenvalues_(i) = alphap(eigenvalues_.size()-i-1);\n R.col(i) = D.col(D.cols()-i-1);\n }\n Eigen::MatrixXf Up = Eigen::MatrixXf::Zero(eigenvectors_.rows(), eigenvectors_.cols()+1);\n Up.topLeftCorner(eigenvectors_.rows(),eigenvectors_.cols()) = eigenvectors_;\n Up.rightCols<1>() = h;\n eigenvectors_ = Up*R;\n if (!basis_only_) {\n Eigen::Vector3f etha = Up.transpose() * (mean_.head<3>() - meanp);\n coefficients_.resize(coefficients_.rows()+1,coefficients_.cols()+1);\n for(std::size_t i=0; i < (coefficients_.cols() - 1); i++) {\n coefficients_(coefficients_.rows()-1,i) = 0;\n coefficients_.col(i) = (R.transpose() * coefficients_.col(i)) + etha;\n }\n a.resize(a.size()+1);\n a(a.size()-1) = 0;\n coefficients_.col(coefficients_.cols()-1) = (R.transpose() * a) + etha;\n }\n mean_.head<3>() = meanp;\n switch (flag) \n {\n case increase:\n if (eigenvectors_.rows() >= eigenvectors_.cols())\n break;\n case preserve:\n if (!basis_only_)\n coefficients_ = coefficients_.topRows(coefficients_.rows() - 1);\n eigenvectors_ = eigenvectors_.leftCols(eigenvectors_.cols() - 1);\n eigenvalues_.resize(eigenvalues_.size()-1);\n break;\n default:\n PCL_ERROR(\"[pcl::PCA] unknown flag\\n\");\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::project (const PointT& input, PointT& projection)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::project] PCA initCompute failed\");\n \n Eigen::Vector3f demean_input = input.getVector3fMap () - mean_.head<3> ();\n projection.getVector3fMap () = eigenvectors_.transpose() * demean_input;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::project (const PointCloud& input, PointCloud& projection)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::project] PCA initCompute failed\");\n if (input.is_dense)\n {\n projection.resize (input.size ());\n for (size_t i = 0; i < input.size (); ++i)\n project (input[i], projection[i]);\n }\n else\n {\n PointT p;\n for (size_t i = 0; i < input.size (); ++i)\n {\n if (!pcl_isfinite (input[i].x) || \n !pcl_isfinite (input[i].y) ||\n !pcl_isfinite (input[i].z))\n continue;\n project (input[i], p);\n projection.push_back (p);\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::reconstruct (const PointT& projection, PointT& input)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::reconstruct] PCA initCompute failed\");\n\n input.getVector3fMap ()= eigenvectors_ * projection.getVector3fMap ();\n input.getVector3fMap ()+= mean_.head<3> ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::reconstruct (const PointCloud& projection, PointCloud& input)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::reconstruct] PCA initCompute failed\");\n if (input.is_dense)\n {\n input.resize (projection.size ());\n for (size_t i = 0; i < projection.size (); ++i)\n reconstruct (projection[i], input[i]);\n }\n else\n {\n PointT p;\n for (size_t i = 0; i < input.size (); ++i)\n {\n if (!pcl_isfinite (input[i].x) || \n !pcl_isfinite (input[i].y) ||\n !pcl_isfinite (input[i].z))\n continue;\n reconstruct (projection[i], p);\n input.push_back (p);\n }\n }\n}\n\n#endif\n<commit_msg>Correct coeffcients formula<commit_after>\/*\n * Software License Agreement (BSD License)\n *\n * Point Cloud Library (PCL) - www.pointclouds.org\n * Copyright (c) 2010-2011, Willow Garage, Inc.\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * $Id$\n *\/\n\n#ifndef PCL_PCA_IMPL_HPP\n#define PCL_PCA_IMPL_HPP\n\n#include <Eigen\/Eigenvalues>\n#include \"pcl\/point_types.h\"\n#include \"pcl\/common\/centroid.h\"\n#include \"pcl\/common\/transforms.h\"\n#include \"pcl\/exceptions.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT>\npcl::PCA<PointT>::PCA (const pcl::PointCloud<PointT>& X, bool basis_only)\n{\n Base ();\n basis_only_ = basis_only;\n setInputCloud (X.makeShared ());\n compute_done_ = initCompute ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> bool\npcl::PCA<PointT>::initCompute () \n{\n if(!Base::initCompute ())\n {\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::initCompute] failed\");\n return (false);\n }\n if(indices_->size () < 3)\n {\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::initCompute] number of points < 3\");\n return (false);\n }\n \n \/\/ Compute mean\n mean_ = Eigen::Vector4f::Zero ();\n compute3DCentroid (*input_, *indices_, mean_); \n \/\/ Compute demeanished cloud\n Eigen::MatrixXf cloud_demean;\n demeanPointCloud (*input_, *indices_, mean_, cloud_demean);\n assert (cloud_demean.cols () == int (indices_->size ()));\n \/\/ Compute the product cloud_demean * cloud_demean^T\n Eigen::Matrix3f alpha = cloud_demean.topRows<3> () * cloud_demean.topRows<3> ().transpose ();\n \n \/\/ Compute eigen vectors and values\n Eigen::SelfAdjointEigenSolver<Eigen::Matrix3f> evd (alpha);\n \/\/ Organize eigenvectors and eigenvalues in ascendent order\n for (int i = 0; i < 3; ++i)\n {\n eigenvalues_[i] = evd.eigenvalues () [2-i];\n eigenvectors_.col (i) = evd.eigenvectors ().col (2-i);\n }\n \/\/ If not basis only then compute the coefficients\n\n if (!basis_only_)\n coefficients_ = eigenvectors_.transpose() * cloud_demean.topRows<3> ();\n compute_done_ = true;\n return (true);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void \npcl::PCA<PointT>::update (const PointT& input_point, FLAG flag) \n{\n if (!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::update] PCA initCompute failed\");\n\n Eigen::Vector3f input (input_point.x, input_point.y, input_point.z);\n const size_t n = eigenvectors_.cols ();\/\/ number of eigen vectors\n Eigen::VectorXf meanp = (float(n) * (mean_.head<3>() + input)) \/ float(n + 1);\n Eigen::VectorXf a = eigenvectors_.transpose() * (input - mean_.head<3>());\n Eigen::VectorXf y = (eigenvectors_ * a) + mean_.head<3>();\n Eigen::VectorXf h = y - input;\n if (h.norm() > 0) \n h.normalize ();\n else\n h.setZero ();\n float gamma = h.dot(input - mean_.head<3>());\n Eigen::MatrixXf D = Eigen::MatrixXf::Zero (a.size() + 1, a.size() + 1);\n D.block(0,0,n,n) = a * a.transpose();\n D \/= float(n)\/float((n+1) * (n+1));\n for(std::size_t i=0; i < a.size(); i++) {\n D(i,i)+= float(n)\/float(n+1)*eigenvalues_(i);\n D(D.rows()-1,i) = float(n) \/ float((n+1) * (n+1)) * gamma * a(i);\n D(i,D.cols()-1) = D(D.rows()-1,i);\n D(D.rows()-1,D.cols()-1) = float(n)\/float((n+1) * (n+1)) * gamma * gamma;\n }\n\n Eigen::MatrixXf R(D.rows(), D.cols());\n Eigen::EigenSolver<Eigen::MatrixXf> D_evd (D, false);\n Eigen::VectorXf alphap = D_evd.eigenvalues().real();\n eigenvalues_.resize(eigenvalues_.size() +1);\n for(std::size_t i=0;i<eigenvalues_.size();i++) {\n eigenvalues_(i) = alphap(eigenvalues_.size()-i-1);\n R.col(i) = D.col(D.cols()-i-1);\n }\n Eigen::MatrixXf Up = Eigen::MatrixXf::Zero(eigenvectors_.rows(), eigenvectors_.cols()+1);\n Up.topLeftCorner(eigenvectors_.rows(),eigenvectors_.cols()) = eigenvectors_;\n Up.rightCols<1>() = h;\n eigenvectors_ = Up*R;\n if (!basis_only_) {\n Eigen::Vector3f etha = Up.transpose() * (mean_.head<3>() - meanp);\n coefficients_.resize(coefficients_.rows()+1,coefficients_.cols()+1);\n for(std::size_t i=0; i < (coefficients_.cols() - 1); i++) {\n coefficients_(coefficients_.rows()-1,i) = 0;\n coefficients_.col(i) = (R.transpose() * coefficients_.col(i)) + etha;\n }\n a.resize(a.size()+1);\n a(a.size()-1) = 0;\n coefficients_.col(coefficients_.cols()-1) = (R.transpose() * a) + etha;\n }\n mean_.head<3>() = meanp;\n switch (flag) \n {\n case increase:\n if (eigenvectors_.rows() >= eigenvectors_.cols())\n break;\n case preserve:\n if (!basis_only_)\n coefficients_ = coefficients_.topRows(coefficients_.rows() - 1);\n eigenvectors_ = eigenvectors_.leftCols(eigenvectors_.cols() - 1);\n eigenvalues_.resize(eigenvalues_.size()-1);\n break;\n default:\n PCL_ERROR(\"[pcl::PCA] unknown flag\\n\");\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::project (const PointT& input, PointT& projection)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::project] PCA initCompute failed\");\n \n Eigen::Vector3f demean_input = input.getVector3fMap () - mean_.head<3> ();\n projection.getVector3fMap () = eigenvectors_.transpose() * demean_input;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::project (const PointCloud& input, PointCloud& projection)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::project] PCA initCompute failed\");\n if (input.is_dense)\n {\n projection.resize (input.size ());\n for (size_t i = 0; i < input.size (); ++i)\n project (input[i], projection[i]);\n }\n else\n {\n PointT p;\n for (size_t i = 0; i < input.size (); ++i)\n {\n if (!pcl_isfinite (input[i].x) || \n !pcl_isfinite (input[i].y) ||\n !pcl_isfinite (input[i].z))\n continue;\n project (input[i], p);\n projection.push_back (p);\n }\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::reconstruct (const PointT& projection, PointT& input)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::reconstruct] PCA initCompute failed\");\n\n input.getVector3fMap ()= eigenvectors_ * projection.getVector3fMap ();\n input.getVector3fMap ()+= mean_.head<3> ();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\ntemplate<typename PointT> inline void\npcl::PCA<PointT>::reconstruct (const PointCloud& projection, PointCloud& input)\n{\n if(!compute_done_)\n initCompute ();\n if (!compute_done_)\n PCL_THROW_EXCEPTION (InitFailedException, \"[pcl::PCA::reconstruct] PCA initCompute failed\");\n if (input.is_dense)\n {\n input.resize (projection.size ());\n for (size_t i = 0; i < projection.size (); ++i)\n reconstruct (projection[i], input[i]);\n }\n else\n {\n PointT p;\n for (size_t i = 0; i < input.size (); ++i)\n {\n if (!pcl_isfinite (input[i].x) || \n !pcl_isfinite (input[i].y) ||\n !pcl_isfinite (input[i].z))\n continue;\n reconstruct (projection[i], p);\n input.push_back (p);\n }\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"fetcher\/peer_group.h\"\n\n#include <glog\/logging.h>\n\nusing std::lock_guard;\nusing std::max;\nusing std::mutex;\nusing std::placeholders::_1;\nusing std::shared_ptr;\nusing std::vector;\nusing util::Status;\nusing util::Task;\n\nnamespace cert_trans {\n\nnamespace {\n\n\nvoid GetEntriesDone(AsyncLogClient::Status client_status,\n const vector<AsyncLogClient::Entry>* entries, Task* task) {\n Status status;\n\n switch (client_status) {\n case AsyncLogClient::OK:\n break;\n\n default:\n \/\/ TODO(pphaneuf): Improve this a bit? Or wouldn't it be nice if\n \/\/ AsyncLogClient gave us a util::Status in the first place? ;-)\n status = util::Status::UNKNOWN;\n }\n\n if (status.ok() && entries->empty()) {\n \/\/ This should never happen.\n status =\n Status(util::error::INTERNAL, \"log server did not return any entries\");\n }\n\n task->Return(status);\n}\n\n\n} \/\/ namespace\n\n\nvoid PeerGroup::Add(const shared_ptr<Peer>& peer) {\n lock_guard<mutex> lock(lock_);\n\n CHECK(peers_.emplace(peer, PeerState()).second);\n}\n\n\nint64_t PeerGroup::TreeSize() const {\n lock_guard<mutex> lock(lock_);\n\n int64_t tree_size(-1);\n for (const auto& peer : peers_) {\n tree_size = max(tree_size, peer.first->TreeSize());\n }\n\n return tree_size;\n}\n\n\nvoid PeerGroup::FetchEntries(int64_t start_index, int64_t end_index,\n vector<AsyncLogClient::Entry>* entries,\n Task* task) {\n CHECK_GE(start_index, 0);\n CHECK_GE(end_index, start_index);\n\n const shared_ptr<Peer> peer(PickPeer(end_index + 1));\n CHECK(peer);\n\n \/\/ TODO(pphaneuf): Handle the case where we have no peer more cleanly.\n peer->client().GetEntries(start_index, end_index, CHECK_NOTNULL(entries),\n bind(GetEntriesDone, _1, entries, task));\n}\n\n\nshared_ptr<Peer> PeerGroup::PickPeer(const int64_t needed_size) const {\n lock_guard<mutex> lock(lock_);\n\n \/\/ TODO(pphaneuf): We should pick peers a bit more cleverly, to\n \/\/ spread the load somewhat.\n for (const auto& peer : peers_) {\n if (peer.first->TreeSize() >= needed_size) {\n return peer.first;\n }\n }\n\n return nullptr;\n}\n\n\n} \/\/ namespace cert_trans\n<commit_msg>Do not crash when a peer group doesn't have enough entries.<commit_after>#include \"fetcher\/peer_group.h\"\n\n#include <glog\/logging.h>\n\nusing std::lock_guard;\nusing std::max;\nusing std::mutex;\nusing std::placeholders::_1;\nusing std::shared_ptr;\nusing std::vector;\nusing util::Status;\nusing util::Task;\n\nnamespace cert_trans {\n\nnamespace {\n\n\nvoid GetEntriesDone(AsyncLogClient::Status client_status,\n const vector<AsyncLogClient::Entry>* entries, Task* task) {\n Status status;\n\n switch (client_status) {\n case AsyncLogClient::OK:\n break;\n\n default:\n \/\/ TODO(pphaneuf): Improve this a bit? Or wouldn't it be nice if\n \/\/ AsyncLogClient gave us a util::Status in the first place? ;-)\n status = util::Status::UNKNOWN;\n }\n\n if (status.ok() && entries->empty()) {\n \/\/ This should never happen.\n status =\n Status(util::error::INTERNAL, \"log server did not return any entries\");\n }\n\n task->Return(status);\n}\n\n\n} \/\/ namespace\n\n\nvoid PeerGroup::Add(const shared_ptr<Peer>& peer) {\n lock_guard<mutex> lock(lock_);\n\n CHECK(peers_.emplace(peer, PeerState()).second);\n}\n\n\nint64_t PeerGroup::TreeSize() const {\n lock_guard<mutex> lock(lock_);\n\n int64_t tree_size(-1);\n for (const auto& peer : peers_) {\n tree_size = max(tree_size, peer.first->TreeSize());\n }\n\n return tree_size;\n}\n\n\nvoid PeerGroup::FetchEntries(int64_t start_index, int64_t end_index,\n vector<AsyncLogClient::Entry>* entries,\n Task* task) {\n CHECK_GE(start_index, 0);\n CHECK_GE(end_index, start_index);\n\n const shared_ptr<Peer> peer(PickPeer(end_index + 1));\n if (!peer) {\n task->Return(Status(util::error::UNAVAILABLE,\n \"requested entries not available in the peer group\"));\n return;\n }\n\n \/\/ TODO(pphaneuf): Handle the case where we have no peer more cleanly.\n peer->client().GetEntries(start_index, end_index, CHECK_NOTNULL(entries),\n bind(GetEntriesDone, _1, entries, task));\n}\n\n\nshared_ptr<Peer> PeerGroup::PickPeer(const int64_t needed_size) const {\n lock_guard<mutex> lock(lock_);\n\n \/\/ TODO(pphaneuf): We should pick peers a bit more cleverly, to\n \/\/ spread the load somewhat.\n int64_t group_tree_size(-1);\n for (const auto& peer : peers_) {\n const int64_t tree_size(peer.first->TreeSize());\n group_tree_size = max(group_tree_size, tree_size);\n if (tree_size >= needed_size) {\n return peer.first;\n }\n }\n\n LOG(INFO) << \"requested a peer with \" << needed_size\n << \" entries but the peer group only has \" << group_tree_size\n << \" entries\";\n\n return nullptr;\n}\n\n\n} \/\/ namespace cert_trans\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2017, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <wangle\/ssl\/SSLUtil.h>\n\n#include <folly\/Memory.h>\n\n#if OPENSSL_VERSION_NUMBER >= 0x1000105fL\n#define OPENSSL_GE_101 1\n#include <openssl\/asn1.h>\n#include <openssl\/x509v3.h>\n#include <openssl\/bio.h>\n#else\n#undef OPENSSL_GE_101\n#endif\n\nnamespace wangle {\n\nstd::mutex SSLUtil::sIndexLock_;\n\nstd::unique_ptr<std::string> SSLUtil::getCommonName(const X509* cert) {\n X509_NAME* subject = X509_get_subject_name((X509*)cert);\n if (!subject) {\n return nullptr;\n }\n char cn[ub_common_name + 1];\n int res = X509_NAME_get_text_by_NID(subject, NID_commonName,\n cn, ub_common_name);\n if (res <= 0) {\n return nullptr;\n } else {\n cn[ub_common_name] = '\\0';\n return folly::make_unique<std::string>(cn);\n }\n}\n\nstd::unique_ptr<std::list<std::string>> SSLUtil::getSubjectAltName(\n const X509* cert) {\n#ifdef OPENSSL_GE_101\n auto nameList = folly::make_unique<std::list<std::string>>();\n GENERAL_NAMES* names = (GENERAL_NAMES*)X509_get_ext_d2i(\n (X509*)cert, NID_subject_alt_name, nullptr, nullptr);\n if (names) {\n auto guard = folly::makeGuard([names] { GENERAL_NAMES_free(names); });\n size_t count = sk_GENERAL_NAME_num(names);\n CHECK(count < std::numeric_limits<int>::max());\n for (int i = 0; i < (int)count; ++i) {\n GENERAL_NAME* generalName = sk_GENERAL_NAME_value(names, i);\n if (generalName->type == GEN_DNS) {\n ASN1_STRING* s = generalName->d.dNSName;\n const char* name = (const char*)ASN1_STRING_data(s);\n \/\/ I can't find any docs on what a negative return value here\n \/\/ would mean, so I'm going to ignore it.\n auto len = ASN1_STRING_length(s);\n DCHECK(len >= 0);\n if (size_t(len) != strlen(name)) {\n \/\/ Null byte(s) in the name; return an error rather than depending on\n \/\/ the caller to safely handle this case.\n return nullptr;\n }\n nameList->emplace_back(name);\n }\n }\n }\n return nameList;\n#else\n return nullptr;\n#endif\n}\n\nfolly::ssl::X509UniquePtr SSLUtil::getX509FromCertificate(\n const std::string& certificateData) {\n \/\/ BIO_new_mem_buf creates a bio pointing to a read-only buffer\n folly::ssl::BioUniquePtr bio(\n BIO_new_mem_buf((const void*)certificateData.data(),\n certificateData.length()));\n if (!bio) {\n throw std::runtime_error(\"Cannot create mem BIO\");\n }\n\n auto x509 = folly::ssl::X509UniquePtr(\n PEM_read_bio_X509(bio.get(), nullptr, nullptr, nullptr));\n if (!x509) {\n throw std::runtime_error(\"Cannot read X509 from PEM bio\");\n }\n return x509;\n}\n\n} \/\/ namespace wangle\n<commit_msg>Fix build for OpenSSL versions older than 1.0.2g<commit_after>\/*\n * Copyright (c) 2017, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <wangle\/ssl\/SSLUtil.h>\n\n#include <folly\/Memory.h>\n\n#if OPENSSL_VERSION_NUMBER >= 0x1000105fL\n#define OPENSSL_GE_101 1\n#include <openssl\/asn1.h>\n#include <openssl\/x509v3.h>\n#include <openssl\/bio.h>\n#else\n#undef OPENSSL_GE_101\n#endif\n\nnamespace wangle {\n\nstd::mutex SSLUtil::sIndexLock_;\n\nstd::unique_ptr<std::string> SSLUtil::getCommonName(const X509* cert) {\n X509_NAME* subject = X509_get_subject_name((X509*)cert);\n if (!subject) {\n return nullptr;\n }\n char cn[ub_common_name + 1];\n int res = X509_NAME_get_text_by_NID(subject, NID_commonName,\n cn, ub_common_name);\n if (res <= 0) {\n return nullptr;\n } else {\n cn[ub_common_name] = '\\0';\n return folly::make_unique<std::string>(cn);\n }\n}\n\nstd::unique_ptr<std::list<std::string>> SSLUtil::getSubjectAltName(\n const X509* cert) {\n#ifdef OPENSSL_GE_101\n auto nameList = folly::make_unique<std::list<std::string>>();\n GENERAL_NAMES* names = (GENERAL_NAMES*)X509_get_ext_d2i(\n (X509*)cert, NID_subject_alt_name, nullptr, nullptr);\n if (names) {\n auto guard = folly::makeGuard([names] { GENERAL_NAMES_free(names); });\n size_t count = sk_GENERAL_NAME_num(names);\n CHECK(count < std::numeric_limits<int>::max());\n for (int i = 0; i < (int)count; ++i) {\n GENERAL_NAME* generalName = sk_GENERAL_NAME_value(names, i);\n if (generalName->type == GEN_DNS) {\n ASN1_STRING* s = generalName->d.dNSName;\n const char* name = (const char*)ASN1_STRING_data(s);\n \/\/ I can't find any docs on what a negative return value here\n \/\/ would mean, so I'm going to ignore it.\n auto len = ASN1_STRING_length(s);\n DCHECK(len >= 0);\n if (size_t(len) != strlen(name)) {\n \/\/ Null byte(s) in the name; return an error rather than depending on\n \/\/ the caller to safely handle this case.\n return nullptr;\n }\n nameList->emplace_back(name);\n }\n }\n }\n return nameList;\n#else\n return nullptr;\n#endif\n}\n\nfolly::ssl::X509UniquePtr SSLUtil::getX509FromCertificate(\n const std::string& certificateData) {\n \/\/ BIO_new_mem_buf creates a bio pointing to a read-only buffer. However,\n \/\/ older versions of OpenSSL fail to mark the first argument `const`.\n folly::ssl::BioUniquePtr bio(\n BIO_new_mem_buf((void*)certificateData.data(), certificateData.length()));\n if (!bio) {\n throw std::runtime_error(\"Cannot create mem BIO\");\n }\n\n auto x509 = folly::ssl::X509UniquePtr(\n PEM_read_bio_X509(bio.get(), nullptr, nullptr, nullptr));\n if (!x509) {\n throw std::runtime_error(\"Cannot read X509 from PEM bio\");\n }\n return x509;\n}\n\n} \/\/ namespace wangle\n<|endoftext|>"} {"text":"<commit_before>#include \"fixie_lib\/desktop_gl_impl\/framebuffer.hpp\"\n#include \"fixie_lib\/desktop_gl_impl\/texture.hpp\"\n#include \"fixie_lib\/desktop_gl_impl\/renderbuffer.hpp\"\n#include \"fixie_lib\/debug.hpp\"\n\nnamespace fixie\n{\n #define GL_FRAMEBUFFER 0x8D40\n #define GL_RENDERBUFFER 0x8D41\n #define GL_READ_FRAMEBUFFER 0x8CA8\n #define GL_DRAW_FRAMEBUFFER 0x8CA9\n #define GL_COLOR_ATTACHMENT0 0x8CE0\n #define GL_DEPTH_ATTACHMENT 0x8D00\n #define GL_STENCIL_ATTACHMENT 0x8D20\n\n #define GL_FRAMEBUFFER_COMPLETE 0x8CD5\n\n #define GL_IMPLEMENTATION_COLOR_READ_TYPE 0x8B9A\n #define GL_IMPLEMENTATION_COLOR_READ_FORMAT 0x8B9B\n\n namespace desktop_gl_impl\n {\n framebuffer::framebuffer(std::shared_ptr<const gl_functions> functions)\n : _functions(functions)\n , _id(0)\n {\n gl_call(_functions, gen_framebuffers, 1, &_id);\n }\n\n framebuffer::framebuffer(GLuint id, std::shared_ptr<const gl_functions> functions)\n : _functions(functions)\n , _id(id)\n {\n }\n\n framebuffer::~framebuffer()\n {\n if (_id)\n {\n gl_call_nothrow(_functions, delete_framebuffers, 1, &_id);\n }\n }\n\n GLuint framebuffer::id() const\n {\n return _id;\n }\n\n static void set_framebuffer_attachment(std::shared_ptr<const gl_functions> functions, GLuint framebuffer,\n GLenum attachment_point, const framebuffer_attachment& attachment)\n {\n if (framebuffer != 0)\n {\n gl_call(functions, bind_framebuffer, GL_FRAMEBUFFER, framebuffer);\n if (attachment.is_texture())\n {\n std::shared_ptr<const fixie::texture> texture = attachment.texture().lock();\n std::shared_ptr<const desktop_gl_impl::texture> texture_impl = texture ? std::dynamic_pointer_cast<const desktop_gl_impl::texture>(texture->impl().lock()) : nullptr;\n GLuint id = texture_impl ? texture_impl->id() : 0;\n if (attachment.texture_samples() > 1)\n {\n gl_call(functions, framebuffer_texture_2d, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, id, attachment.texture_level());\n }\n else\n {\n gl_call(functions, framebuffer_texture_2d_multisample, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, id, attachment.texture_level(), attachment.texture_samples());\n }\n }\n else if (attachment.is_renderbuffer())\n {\n std::shared_ptr<const fixie::renderbuffer> renderbuffer = attachment.renderbuffer().lock();\n std::shared_ptr<const desktop_gl_impl::renderbuffer> renderbuffer_impl = renderbuffer ? std::dynamic_pointer_cast<const desktop_gl_impl::renderbuffer>(renderbuffer->impl().lock()) : nullptr;\n GLuint id = renderbuffer_impl ? renderbuffer_impl->id() : 0;\n gl_call(functions, framebuffer_renderbuffer, GL_FRAMEBUFFER, attachment_point, GL_RENDERBUFFER, id);\n }\n else\n {\n assert(!attachment.is_bound());\n gl_call(functions, framebuffer_texture_2d, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, 0, 0);\n }\n }\n }\n\n void framebuffer::set_color_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_COLOR_ATTACHMENT0, attachment);\n }\n\n void framebuffer::set_depth_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_DEPTH_ATTACHMENT, attachment);\n }\n\n void framebuffer::set_stencil_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_STENCIL_ATTACHMENT, attachment);\n }\n\n GLenum framebuffer::preferred_read_format() const\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n\n GLint read_format;\n gl_call(_functions, get_integer_v, GL_IMPLEMENTATION_COLOR_READ_FORMAT, &read_format);\n return static_cast<GLenum>(read_format);\n }\n\n GLenum framebuffer::preferred_read_type() const\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n\n GLint read_type;\n gl_call(_functions, get_integer_v, GL_IMPLEMENTATION_COLOR_READ_TYPE, &read_type);\n return static_cast<GLenum>(read_type);\n }\n\n void framebuffer::read_pixels(GLint x, GLint y, GLsizei width, GLsizei height, GLenum format, GLenum type, GLvoid* data)\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n gl_call(_functions, read_pixels, x, y, width, height, format, type, data);\n }\n\n GLenum framebuffer::status() const \n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n GLenum status = gl_call(_functions, check_framebuffer_status, GL_FRAMEBUFFER);\n return status;\n }\n\n default_framebuffer::default_framebuffer(std::shared_ptr<const gl_functions> functions)\n : framebuffer(0, functions)\n {\n }\n\n GLenum default_framebuffer::status() const\n {\n return GL_FRAMEBUFFER_COMPLETE;\n }\n }\n}\n<commit_msg>Fixed a bug where multisampled renderbuffers are created when samples is 1.<commit_after>#include \"fixie_lib\/desktop_gl_impl\/framebuffer.hpp\"\n#include \"fixie_lib\/desktop_gl_impl\/texture.hpp\"\n#include \"fixie_lib\/desktop_gl_impl\/renderbuffer.hpp\"\n#include \"fixie_lib\/debug.hpp\"\n\nnamespace fixie\n{\n #define GL_FRAMEBUFFER 0x8D40\n #define GL_RENDERBUFFER 0x8D41\n #define GL_READ_FRAMEBUFFER 0x8CA8\n #define GL_DRAW_FRAMEBUFFER 0x8CA9\n #define GL_COLOR_ATTACHMENT0 0x8CE0\n #define GL_DEPTH_ATTACHMENT 0x8D00\n #define GL_STENCIL_ATTACHMENT 0x8D20\n\n #define GL_FRAMEBUFFER_COMPLETE 0x8CD5\n\n #define GL_IMPLEMENTATION_COLOR_READ_TYPE 0x8B9A\n #define GL_IMPLEMENTATION_COLOR_READ_FORMAT 0x8B9B\n\n namespace desktop_gl_impl\n {\n framebuffer::framebuffer(std::shared_ptr<const gl_functions> functions)\n : _functions(functions)\n , _id(0)\n {\n gl_call(_functions, gen_framebuffers, 1, &_id);\n }\n\n framebuffer::framebuffer(GLuint id, std::shared_ptr<const gl_functions> functions)\n : _functions(functions)\n , _id(id)\n {\n }\n\n framebuffer::~framebuffer()\n {\n if (_id)\n {\n gl_call_nothrow(_functions, delete_framebuffers, 1, &_id);\n }\n }\n\n GLuint framebuffer::id() const\n {\n return _id;\n }\n\n static void set_framebuffer_attachment(std::shared_ptr<const gl_functions> functions, GLuint framebuffer,\n GLenum attachment_point, const framebuffer_attachment& attachment)\n {\n if (framebuffer != 0)\n {\n gl_call(functions, bind_framebuffer, GL_FRAMEBUFFER, framebuffer);\n if (attachment.is_texture())\n {\n std::shared_ptr<const fixie::texture> texture = attachment.texture().lock();\n std::shared_ptr<const desktop_gl_impl::texture> texture_impl = texture ? std::dynamic_pointer_cast<const desktop_gl_impl::texture>(texture->impl().lock()) : nullptr;\n GLuint id = texture_impl ? texture_impl->id() : 0;\n if (attachment.texture_samples() > 1)\n {\n gl_call(functions, framebuffer_texture_2d_multisample, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, id, attachment.texture_level(), attachment.texture_samples());\n }\n else\n {\n gl_call(functions, framebuffer_texture_2d, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, id, attachment.texture_level());\n }\n }\n else if (attachment.is_renderbuffer())\n {\n std::shared_ptr<const fixie::renderbuffer> renderbuffer = attachment.renderbuffer().lock();\n std::shared_ptr<const desktop_gl_impl::renderbuffer> renderbuffer_impl = renderbuffer ? std::dynamic_pointer_cast<const desktop_gl_impl::renderbuffer>(renderbuffer->impl().lock()) : nullptr;\n GLuint id = renderbuffer_impl ? renderbuffer_impl->id() : 0;\n gl_call(functions, framebuffer_renderbuffer, GL_FRAMEBUFFER, attachment_point, GL_RENDERBUFFER, id);\n }\n else\n {\n assert(!attachment.is_bound());\n gl_call(functions, framebuffer_texture_2d, GL_FRAMEBUFFER, attachment_point, GL_TEXTURE_2D, 0, 0);\n }\n }\n }\n\n void framebuffer::set_color_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_COLOR_ATTACHMENT0, attachment);\n }\n\n void framebuffer::set_depth_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_DEPTH_ATTACHMENT, attachment);\n }\n\n void framebuffer::set_stencil_attachment(const framebuffer_attachment& attachment)\n {\n set_framebuffer_attachment(_functions, _id, GL_STENCIL_ATTACHMENT, attachment);\n }\n\n GLenum framebuffer::preferred_read_format() const\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n\n GLint read_format;\n gl_call(_functions, get_integer_v, GL_IMPLEMENTATION_COLOR_READ_FORMAT, &read_format);\n return static_cast<GLenum>(read_format);\n }\n\n GLenum framebuffer::preferred_read_type() const\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n\n GLint read_type;\n gl_call(_functions, get_integer_v, GL_IMPLEMENTATION_COLOR_READ_TYPE, &read_type);\n return static_cast<GLenum>(read_type);\n }\n\n void framebuffer::read_pixels(GLint x, GLint y, GLsizei width, GLsizei height, GLenum format, GLenum type, GLvoid* data)\n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n gl_call(_functions, read_pixels, x, y, width, height, format, type, data);\n }\n\n GLenum framebuffer::status() const \n {\n gl_call(_functions, bind_framebuffer, GL_FRAMEBUFFER, _id);\n GLenum status = gl_call(_functions, check_framebuffer_status, GL_FRAMEBUFFER);\n return status;\n }\n\n default_framebuffer::default_framebuffer(std::shared_ptr<const gl_functions> functions)\n : framebuffer(0, functions)\n {\n }\n\n GLenum default_framebuffer::status() const\n {\n return GL_FRAMEBUFFER_COMPLETE;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/io.hpp\"\n#include <cstring>\n#include <asio\/read.hpp>\n#include <asio\/write.hpp>\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\nint read_message(stream_socket& s, char* buffer)\n{\n\tusing namespace libtorrent::detail;\n\tasio::error_code ec;\n\tasio::read(s, asio::buffer(buffer, 4), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n\tchar* ptr = buffer;\n\tint length = read_int32(ptr);\n\n\tasio::read(s, asio::buffer(buffer, length), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n\treturn length;\n}\n\nchar const* message_name[] = {\"choke\", \"unchoke\", \"interested\", \"not_interested\"\n\t, \"have\", \"bitfield\", \"request\", \"piece\", \"cancel\", \"dht_port\", \"\", \"\", \"\"\n\t, \"suggest_piece\", \"have_all\", \"have_none\", \"reject_request\", \"allowed_fast\"};\n\nvoid send_allow_fast(stream_socket& s, int piece)\n{\n\tusing namespace libtorrent::detail;\n\tchar msg[] = \"\\0\\0\\0\\x05\\x11\\0\\0\\0\\0\";\n\tchar* ptr = msg + 5;\n\twrite_int32(piece, ptr);\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 9), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n}\n\nvoid send_suggest_piece(stream_socket& s, int piece)\n{\n\tusing namespace libtorrent::detail;\n\tchar msg[] = \"\\0\\0\\0\\x05\\x0d\\0\\0\\0\\0\";\n\tchar* ptr = msg + 5;\n\twrite_int32(piece, ptr);\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 9), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n}\n\nvoid send_unchoke(stream_socket& s)\n{\n\tchar msg[] = \"\\0\\0\\0\\x01\\x01\";\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 5), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n}\n\nvoid do_handshake(stream_socket& s, sha1_hash const& ih, char* buffer)\n{\n\tchar handshake[] = \"\\x13\" \"BitTorrent protocol\\0\\0\\0\\0\\0\\0\\0\\x04\"\n\t\t\" \" \/\/ space for info-hash\n\t\t\"aaaaaaaaaaaaaaaaaaaa\" \/\/ peer-id\n\t\t\"\\0\\0\\0\\x01\\x0e\"; \/\/ have_all\n\tasio::error_code ec;\n\tstd::memcpy(handshake + 28, ih.begin(), 20);\n\tasio::write(s, asio::buffer(handshake, sizeof(handshake) - 1), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n\n\t\/\/ read handshake\n\tasio::read(s, asio::buffer(buffer, 68), asio::transfer_all(), ec);\n\tTEST_CHECK(!ec);\n\n\tTEST_CHECK(buffer[0] == 19);\n\tTEST_CHECK(std::memcmp(buffer + 1, \"BitTorrent protocol\", 19) == 0);\n\n\tchar* extensions = buffer + 20;\n\t\/\/ check for fast extension support\n\tTEST_CHECK(extensions[7] & 0x4);\n\t\n#ifndef TORRENT_DISABLE_EXTENSIONS\n\t\/\/ check for extension protocol support\n\tTEST_CHECK(extensions[5] & 0x10);\n#endif\n\t\n#ifndef TORRENT_DISABLE_DHT\n\t\/\/ check for DHT support\n\tTEST_CHECK(extensions[7] & 0x1);\n#endif\n\t\n\tTEST_CHECK(std::memcmp(buffer + 28, ih.begin(), 20) == 0);\n}\n\n\/\/ makes sure that pieces that are allowed and then\n\/\/ rejected aren't requested again\nvoid test_reject_fast()\n{\n\tboost::intrusive_ptr<torrent_info> t = create_torrent();\n\tsha1_hash ih = t->info_hash();\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48900, 49000));\n\tses1.add_torrent(t, \".\/tmp1\");\n\n\ttest_sleep(2000);\n\n\tio_service ios;\n\tstream_socket s(ios);\n\ts.connect(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\n\tchar recv_buffer[1000];\n\tdo_handshake(s, ih, recv_buffer);\n\t\n\tstd::vector<int> allowed_fast;\n\tallowed_fast.push_back(0);\n\tallowed_fast.push_back(1);\n\tallowed_fast.push_back(2);\n\tallowed_fast.push_back(3);\n\n\tstd::for_each(allowed_fast.begin(), allowed_fast.end()\n\t\t, bind(&send_allow_fast, boost::ref(s), _1));\n\n\twhile (!allowed_fast.empty())\n\t{\n\t\tread_message(s, recv_buffer);\n\t\tint msg = recv_buffer[0];\n\t\tif (msg >= 0 && msg < int(sizeof(message_name)\/sizeof(message_name[0])))\n\t\t\tstd::cerr << message_name[msg] << std::endl;\n\t\telse\n\t\t\tstd::cerr << msg << std::endl;\n\t\tif (recv_buffer[0] != 0x6) continue;\n\n\t\tusing namespace libtorrent::detail;\n\t\tchar* ptr = recv_buffer + 1;\n\t\tint piece = read_int32(ptr);\n\n\t\tstd::vector<int>::iterator i = std::find(allowed_fast.begin()\n\t\t\t, allowed_fast.end(), piece);\n\t\tTEST_CHECK(i != allowed_fast.end());\n\t\tif (i != allowed_fast.end())\n\t\t\tallowed_fast.erase(i);\n\t\t\/\/ send reject request\n\t\trecv_buffer[0] = 0x10;\n\t\tasio::error_code ec;\n\t\tasio::write(s, asio::buffer(\"\\0\\0\\0\\x0d\", 4), asio::transfer_all(), ec);\n\t\tTEST_CHECK(!ec);\n\t\tasio::write(s, asio::buffer(recv_buffer, 13), asio::transfer_all(), ec);\n\t\tTEST_CHECK(!ec);\n\t}\n}\n\nvoid test_respect_suggest()\n{\n\tboost::intrusive_ptr<torrent_info> t = create_torrent();\n\tsha1_hash ih = t->info_hash();\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48900, 49000));\n\tses1.add_torrent(t, \".\/tmp1\");\n\n\ttest_sleep(2000);\n\n\tio_service ios;\n\tstream_socket s(ios);\n\ts.connect(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\n\tchar recv_buffer[1000];\n\tdo_handshake(s, ih, recv_buffer);\n\t\n\tstd::vector<int> suggested;\n\tsuggested.push_back(0);\n\tsuggested.push_back(1);\n\tsuggested.push_back(2);\n\tsuggested.push_back(3);\n\n\tstd::for_each(suggested.begin(), suggested.end()\n\t\t, bind(&send_suggest_piece, boost::ref(s), _1));\n\n\tsend_unchoke(s);\n\n\tint fail_counter = 100;\t\n\twhile (!suggested.empty() && fail_counter > 0)\n\t{\n\t\tread_message(s, recv_buffer);\n\t\tstd::cerr << \"msg: \";\n\t\tint msg = recv_buffer[0];\n\t\tif (msg >= 0 && msg < int(sizeof(message_name)\/sizeof(message_name[0])))\n\t\t\tstd::cerr << message_name[msg] << std::endl;\n\t\telse\n\t\t\tstd::cerr << msg << std::endl;\n\t\tfail_counter--;\n\t\tif (recv_buffer[0] != 0x6) continue;\n\n\t\tusing namespace libtorrent::detail;\n\t\tchar* ptr = recv_buffer + 1;\n\t\tint piece = read_int32(ptr);\n\n\t\tstd::vector<int>::iterator i = std::find(suggested.begin()\n\t\t\t, suggested.end(), piece);\n\t\tTEST_CHECK(i != suggested.end());\n\t\tif (i != suggested.end())\n\t\t\tsuggested.erase(i);\n\t\t\/\/ send reject request\n\t\trecv_buffer[0] = 0x10;\n\t\tasio::error_code ec;\n\t\tasio::write(s, asio::buffer(\"\\0\\0\\0\\x0d\", 4), asio::transfer_all(), ec);\n\t\tTEST_CHECK(!ec);\n\t\tasio::write(s, asio::buffer(recv_buffer, 13), asio::transfer_all(), ec);\n\t\tTEST_CHECK(!ec);\n\t}\n\tTEST_CHECK(fail_counter > 0);\n}\n\nint test_main()\n{\n\ttest_reject_fast();\n\ttest_respect_suggest();\n\treturn 0;\n}\n\n<commit_msg>more verbose logging in test_fast_extension and avoids infinite loops in case of failures<commit_after>#include \"test.hpp\"\n#include \"setup_transfer.hpp\"\n#include \"libtorrent\/socket.hpp\"\n#include \"libtorrent\/io.hpp\"\n#include <cstring>\n#include <asio\/read.hpp>\n#include <asio\/write.hpp>\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\nint read_message(stream_socket& s, char* buffer)\n{\n\tusing namespace libtorrent::detail;\n\tasio::error_code ec;\n\tasio::read(s, asio::buffer(buffer, 4), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n\tchar* ptr = buffer;\n\tint length = read_int32(ptr);\n\n\tasio::read(s, asio::buffer(buffer, length), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n\treturn length;\n}\n\nchar const* message_name[] = {\"choke\", \"unchoke\", \"interested\", \"not_interested\"\n\t, \"have\", \"bitfield\", \"request\", \"piece\", \"cancel\", \"dht_port\", \"\", \"\", \"\"\n\t, \"suggest_piece\", \"have_all\", \"have_none\", \"reject_request\", \"allowed_fast\"};\n\nvoid send_allow_fast(stream_socket& s, int piece)\n{\n\tstd::cout << \"send allow fast: \" << piece << std::endl;\n\tusing namespace libtorrent::detail;\n\tchar msg[] = \"\\0\\0\\0\\x05\\x11\\0\\0\\0\\0\";\n\tchar* ptr = msg + 5;\n\twrite_int32(piece, ptr);\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 9), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n}\n\nvoid send_suggest_piece(stream_socket& s, int piece)\n{\n\tstd::cout << \"send suggest piece: \" << piece << std::endl;\n\tusing namespace libtorrent::detail;\n\tchar msg[] = \"\\0\\0\\0\\x05\\x0d\\0\\0\\0\\0\";\n\tchar* ptr = msg + 5;\n\twrite_int32(piece, ptr);\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 9), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n}\n\nvoid send_unchoke(stream_socket& s)\n{\n\tstd::cout << \"send unchoke\" << std::endl;\n\tchar msg[] = \"\\0\\0\\0\\x01\\x01\";\n\tasio::error_code ec;\n\tasio::write(s, asio::buffer(msg, 5), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n}\n\nvoid do_handshake(stream_socket& s, sha1_hash const& ih, char* buffer)\n{\n\tchar handshake[] = \"\\x13\" \"BitTorrent protocol\\0\\0\\0\\0\\0\\0\\0\\x04\"\n\t\t\" \" \/\/ space for info-hash\n\t\t\"aaaaaaaaaaaaaaaaaaaa\" \/\/ peer-id\n\t\t\"\\0\\0\\0\\x01\\x0e\"; \/\/ have_all\n\tstd::cout << \"send handshake\" << std::endl;\n\tasio::error_code ec;\n\tstd::memcpy(handshake + 28, ih.begin(), 20);\n\tasio::write(s, asio::buffer(handshake, sizeof(handshake) - 1), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n\n\t\/\/ read handshake\n\tasio::read(s, asio::buffer(buffer, 68), asio::transfer_all(), ec);\n\tif (ec)\n\t{\n\t\tstd::cout << ec.message() << std::endl;\n\t\texit(1);\n\t}\n\tstd::cout << \"received handshake\" << std::endl;\n\n\tTEST_CHECK(buffer[0] == 19);\n\tTEST_CHECK(std::memcmp(buffer + 1, \"BitTorrent protocol\", 19) == 0);\n\n\tchar* extensions = buffer + 20;\n\t\/\/ check for fast extension support\n\tTEST_CHECK(extensions[7] & 0x4);\n\t\n#ifndef TORRENT_DISABLE_EXTENSIONS\n\t\/\/ check for extension protocol support\n\tTEST_CHECK(extensions[5] & 0x10);\n#endif\n\t\n#ifndef TORRENT_DISABLE_DHT\n\t\/\/ check for DHT support\n\tTEST_CHECK(extensions[7] & 0x1);\n#endif\n\t\n\tTEST_CHECK(std::memcmp(buffer + 28, ih.begin(), 20) == 0);\n}\n\n\/\/ makes sure that pieces that are allowed and then\n\/\/ rejected aren't requested again\nvoid test_reject_fast()\n{\n\tboost::intrusive_ptr<torrent_info> t = create_torrent();\n\tsha1_hash ih = t->info_hash();\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48900, 49000));\n\tses1.add_torrent(t, \".\/tmp1\");\n\n\ttest_sleep(1000000);\n\n\tio_service ios;\n\tstream_socket s(ios);\n\ts.connect(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\n\tchar recv_buffer[1000];\n\tdo_handshake(s, ih, recv_buffer);\n\t\n\tstd::vector<int> allowed_fast;\n\tallowed_fast.push_back(0);\n\tallowed_fast.push_back(1);\n\tallowed_fast.push_back(2);\n\tallowed_fast.push_back(3);\n\n\tstd::for_each(allowed_fast.begin(), allowed_fast.end()\n\t\t, bind(&send_allow_fast, boost::ref(s), _1));\n\n\twhile (!allowed_fast.empty())\n\t{\n\t\tread_message(s, recv_buffer);\n\t\tint msg = recv_buffer[0];\n\t\tif (msg >= 0 && msg < int(sizeof(message_name)\/sizeof(message_name[0])))\n\t\t\tstd::cerr << message_name[msg] << std::endl;\n\t\telse\n\t\t\tstd::cerr << msg << std::endl;\n\t\tif (recv_buffer[0] != 0x6) continue;\n\n\t\tusing namespace libtorrent::detail;\n\t\tchar* ptr = recv_buffer + 1;\n\t\tint piece = read_int32(ptr);\n\n\t\tstd::vector<int>::iterator i = std::find(allowed_fast.begin()\n\t\t\t, allowed_fast.end(), piece);\n\t\tTEST_CHECK(i != allowed_fast.end());\n\t\tif (i != allowed_fast.end())\n\t\t\tallowed_fast.erase(i);\n\t\t\/\/ send reject request\n\t\trecv_buffer[0] = 0x10;\n\t\tasio::error_code ec;\n\t\tasio::write(s, asio::buffer(\"\\0\\0\\0\\x0d\", 4), asio::transfer_all(), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tstd::cout << ec.message() << std::endl;\n\t\t\texit(1);\n\t\t}\n\t\tasio::write(s, asio::buffer(recv_buffer, 13), asio::transfer_all(), ec);\n\t\tstd::cout << ec.message() << std::endl;\n\t\tif (ec)\n\t\t{\n\t\t\tstd::cout << ec.message() << std::endl;\n\t\t\texit(1);\n\t\t}\n\t}\n}\n\nvoid test_respect_suggest()\n{\n\tboost::intrusive_ptr<torrent_info> t = create_torrent();\n\tsha1_hash ih = t->info_hash();\n\tsession ses1(fingerprint(\"LT\", 0, 1, 0, 0), std::make_pair(48900, 49000));\n\tses1.add_torrent(t, \".\/tmp1\");\n\n\ttest_sleep(2000);\n\n\tio_service ios;\n\tstream_socket s(ios);\n\ts.connect(tcp::endpoint(address::from_string(\"127.0.0.1\"), ses1.listen_port()));\n\n\tchar recv_buffer[1000];\n\tdo_handshake(s, ih, recv_buffer);\n\t\n\tstd::vector<int> suggested;\n\tsuggested.push_back(0);\n\tsuggested.push_back(1);\n\tsuggested.push_back(2);\n\tsuggested.push_back(3);\n\n\tstd::for_each(suggested.begin(), suggested.end()\n\t\t, bind(&send_suggest_piece, boost::ref(s), _1));\n\n\tsend_unchoke(s);\n\n\tint fail_counter = 100;\t\n\twhile (!suggested.empty() && fail_counter > 0)\n\t{\n\t\tread_message(s, recv_buffer);\n\t\tstd::cerr << \"msg: \";\n\t\tint msg = recv_buffer[0];\n\t\tif (msg >= 0 && msg < int(sizeof(message_name)\/sizeof(message_name[0])))\n\t\t\tstd::cerr << message_name[msg] << std::endl;\n\t\telse\n\t\t\tstd::cerr << msg << std::endl;\n\t\tfail_counter--;\n\t\tif (recv_buffer[0] != 0x6) continue;\n\n\t\tusing namespace libtorrent::detail;\n\t\tchar* ptr = recv_buffer + 1;\n\t\tint piece = read_int32(ptr);\n\n\t\tstd::vector<int>::iterator i = std::find(suggested.begin()\n\t\t\t, suggested.end(), piece);\n\t\tTEST_CHECK(i != suggested.end());\n\t\tif (i != suggested.end())\n\t\t\tsuggested.erase(i);\n\t\t\/\/ send reject request\n\t\trecv_buffer[0] = 0x10;\n\t\tasio::error_code ec;\n\t\tasio::write(s, asio::buffer(\"\\0\\0\\0\\x0d\", 4), asio::transfer_all(), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tstd::cout << ec.message() << std::endl;\n\t\t\texit(1);\n\t\t}\n\t\tasio::write(s, asio::buffer(recv_buffer, 13), asio::transfer_all(), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tstd::cout << ec.message() << std::endl;\n\t\t\texit(1);\n\t\t}\n\t}\n\tTEST_CHECK(fail_counter > 0);\n}\n\nint test_main()\n{\n\ttest_reject_fast();\n\ttest_respect_suggest();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ (C) Copyright Gennadiy Rozental 2001-2012.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/ See http:\/\/www.boost.org\/libs\/test for the library home page.\n\/\/\n\/\/ File : $RCSfile$\n\/\/\n\/\/ Version : $Revision$\n\/\/\n\/\/ Description : tests floating point comparison algorithms\n\/\/ ***************************************************************************\n\n\/\/ Boost.Test\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Boost\n#include <boost\/mpl\/list.hpp>\n#include <boost\/bind.hpp>\n\n\/\/ STL\n#include <functional>\n\nusing namespace boost;\nusing namespace boost::unit_test;\nusing namespace boost::test_tools;\n\nbool not_func( bool argb ) { return !argb; }\n\n\/\/____________________________________________________________________________\/\/\n\ntypedef boost::mpl::list<float,double,long double> test_types;\n\nBOOST_AUTO_TEST_CASE_TEMPLATE( test_BOOST_CHECK_CLOSE, FPT, test_types )\n{\n#define CHECK_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK_CLOSE( fp1, fp2, epsilon ); \\\n\/**\/\n\n#ifdef BOOST_TEST_NO_OLD_TOOLS\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( fp1 != fp2, fpc::percent_tolerance( epsilon ) ); \\\n\n#else\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK( !check_is_close( fp1, fp2, ::fpc::percent_tolerance( epsilon ) ) ); \\\n\/**\/\n#endif\n\n FPT fp1, fp2, epsilon;\n\n CHECK_CLOSE( 1, 1, 0 );\n\n CHECK_NOT_CLOSE( 0, 1e-20, 1e-5 );\n CHECK_NOT_CLOSE( 0, 1e-30, 1e-5 );\n CHECK_NOT_CLOSE( 0, -1e-10, 0.1 );\n CHECK_NOT_CLOSE( 0.123456, 0.123457, 1e-4 );\n\n CHECK_CLOSE( 0.123456, 0.123457, 1e-3 );\n\n CHECK_NOT_CLOSE( 0.123456, -0.123457, 1e-3 );\n\n CHECK_CLOSE( 1.23456e28, 1.23457e28, 1e-3 );\n\n CHECK_CLOSE( 1.23456e-10, 1.23457e-10, 1e-3 );\n CHECK_NOT_CLOSE( 1.111e-10, 1.112e-10, 0.08999 );\n CHECK_CLOSE( 1.112e-10, 1.111e-10, 0.1 );\n\n CHECK_CLOSE( 1, 1.0001, 1.1e-2 );\n CHECK_CLOSE( 1.0002, 1.0001, 1.1e-2 );\n\n CHECK_NOT_CLOSE( 1, 1.0002, 1.1e-2 );\n\n#undef CHECK_CLOSE\n#undef CHECK_NOT_CLOSE\n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE_TEMPLATE( test_CHECK_CLOSE_FRACTION, FPT, test_types )\n{\n#define CHECK_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK_CLOSE( fp1, fp2, epsilon ); \\\n\/**\/\n\n#ifdef BOOST_TEST_NO_OLD_TOOLS\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( fp1 != fp2, epsilon ); \\\n\n#else\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK( !check_is_close( fp1, fp2, epsilon ) ); \\\n\/**\/\n#endif\n\n\n FPT fp1, fp2, epsilon;\n\n CHECK_CLOSE( 1, 1, 0 );\n\n CHECK_NOT_CLOSE( 0, 1e-20, 1e-5 );\n CHECK_NOT_CLOSE( 0, 1e-30, 1e-5 );\n CHECK_NOT_CLOSE( 0, -1e-10, 0.1 );\n CHECK_NOT_CLOSE( 0.123456, 0.123457, 1e-6 );\n\n CHECK_CLOSE( 0.123456, 0.123457, 1e-3 );\n\n CHECK_NOT_CLOSE( 0.123456, -0.123457, 1e-3 );\n\n CHECK_CLOSE( 1.23456e28, 1.23457e28, 1e-3 );\n\n CHECK_CLOSE( 1.23456e-10, 1.23457e-10, 1e-3 );\n CHECK_NOT_CLOSE( 1.111e-10, 1.112e-10, 0.0008999 );\n CHECK_CLOSE( 1.112e-10, 1.111e-10, 0.1 );\n\n CHECK_CLOSE( 1, 1.0001, 1.1e-2 );\n CHECK_CLOSE( 1.0002, 1.0001, 1.1e-2 );\n\n CHECK_NOT_CLOSE( 1, 1.0002, 1.1e-4 );\n\n#undef CHECK_CLOSE\n#undef CHECK_NOT_CLOSE\n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE( test_type_mismatch )\n{\n BOOST_CHECK_CLOSE_FRACTION( 2., 2.1, 0.06 );\n BOOST_CHECK_CLOSE( 2.1, 2., 6. );\n BOOST_CHECK_CLOSE( 2.1, 2.f, 6. );\n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE( test_CHECK_SMALL )\n{\n BOOST_CHECK_SMALL( 1e-6, 1e-5 );\n BOOST_CHECK_SMALL( -1e-6, 1e-5 );\n\n BOOST_TEST( 1e-6 != 0., 1e-7 );\n}\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace fpc = boost::math::fpc;\n\nBOOST_AUTO_TEST_CASE( test_close_at_tolerance )\n{\n double fp1 = 1.00000001;\n double fp2 = 1.00000002;\n double epsilon = 1e-6;\n\n\/\/ ::fpc::close_at_tolerance<double> pred( ::fpc::percent_tolerance( epsilon ), ::fpc::FPC_WEAK );\n\/\/ BOOST_CHECK_PREDICATE( pred, (fp1)(fp2) );\n\n\/\/ BOOST_CHECK_PREDICATE( bind(not_func, bind(check_is_close, _1, _2, _3)), \n\/\/ (fp1)(fp2)( ::fpc::percent_tolerance( epsilon )) );\n\n fp1 = 1.23456e-10;\n fp2 = 1.23457e-10;\n epsilon = 8.1e-4;\n\n\/\/ BOOST_CHECK_PREDICATE( ::fpc::close_at_tolerance<double>( ::fpc::percent_tolerance( epsilon ), ::fpc::FPC_WEAK ), (fp1)(fp2) );\n\/\/ BOOST_CHECK_PREDICATE( \n\/\/ bind(not_func, \n\/\/ bind( ::fpc::close_at_tolerance<double>( ::fpc::percent_tolerance( epsilon ) ), _1, _2)), (fp1)(fp2) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ EOF\n<commit_msg>ifdef new tool usage<commit_after>\/\/ (C) Copyright Gennadiy Rozental 2001-2012.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n\/\/ See http:\/\/www.boost.org\/libs\/test for the library home page.\n\/\/\n\/\/ File : $RCSfile$\n\/\/\n\/\/ Version : $Revision$\n\/\/\n\/\/ Description : tests floating point comparison algorithms\n\/\/ ***************************************************************************\n\n\/\/ Boost.Test\n#define BOOST_TEST_MAIN\n#include <boost\/test\/unit_test.hpp>\n\n\/\/ Boost\n#include <boost\/mpl\/list.hpp>\n#include <boost\/bind.hpp>\n\n\/\/ STL\n#include <functional>\n\nusing namespace boost;\nusing namespace boost::unit_test;\nusing namespace boost::test_tools;\n\nbool not_func( bool argb ) { return !argb; }\n\n\/\/____________________________________________________________________________\/\/\n\ntypedef boost::mpl::list<float,double,long double> test_types;\n\nBOOST_AUTO_TEST_CASE_TEMPLATE( test_BOOST_CHECK_CLOSE, FPT, test_types )\n{\n#define CHECK_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK_CLOSE( fp1, fp2, epsilon ); \\\n\/**\/\n\n#ifdef BOOST_TEST_NO_OLD_TOOLS\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( fp1 != fp2, fpc::percent_tolerance( epsilon ) ); \\\n\n#else\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( !check_is_close( fp1, fp2, ::fpc::percent_tolerance( epsilon ) ) ); \\\n\/**\/\n#endif\n\n FPT fp1, fp2, epsilon;\n\n CHECK_CLOSE( 1, 1, 0 );\n\n CHECK_NOT_CLOSE( 0, 1e-20, 1e-5 );\n CHECK_NOT_CLOSE( 0, 1e-30, 1e-5 );\n CHECK_NOT_CLOSE( 0, -1e-10, 0.1 );\n CHECK_NOT_CLOSE( 0.123456, 0.123457, 1e-4 );\n\n CHECK_CLOSE( 0.123456, 0.123457, 1e-3 );\n\n CHECK_NOT_CLOSE( 0.123456, -0.123457, 1e-3 );\n\n CHECK_CLOSE( 1.23456e28, 1.23457e28, 1e-3 );\n\n CHECK_CLOSE( 1.23456e-10, 1.23457e-10, 1e-3 );\n CHECK_NOT_CLOSE( 1.111e-10, 1.112e-10, 0.08999 );\n CHECK_CLOSE( 1.112e-10, 1.111e-10, 0.1 );\n\n CHECK_CLOSE( 1, 1.0001, 1.1e-2 );\n CHECK_CLOSE( 1.0002, 1.0001, 1.1e-2 );\n\n CHECK_NOT_CLOSE( 1, 1.0002, 1.1e-2 );\n\n#undef CHECK_CLOSE\n#undef CHECK_NOT_CLOSE\n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE_TEMPLATE( test_CHECK_CLOSE_FRACTION, FPT, test_types )\n{\n#define CHECK_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_CHECK_CLOSE( fp1, fp2, epsilon ); \\\n\/**\/\n\n#ifdef BOOST_TEST_NO_OLD_TOOLS\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( fp1 != fp2, epsilon ); \\\n\n#else\n\n#define CHECK_NOT_CLOSE( first, second, e ) \\\n fp1 = static_cast<FPT>(first); \\\n fp2 = static_cast<FPT>(second); \\\n epsilon = static_cast<FPT>(e); \\\n \\\n BOOST_TEST( !check_is_close( fp1, fp2, epsilon ) ); \\\n\/**\/\n#endif\n\n\n FPT fp1, fp2, epsilon;\n\n CHECK_CLOSE( 1, 1, 0 );\n\n CHECK_NOT_CLOSE( 0, 1e-20, 1e-5 );\n CHECK_NOT_CLOSE( 0, 1e-30, 1e-5 );\n CHECK_NOT_CLOSE( 0, -1e-10, 0.1 );\n CHECK_NOT_CLOSE( 0.123456, 0.123457, 1e-6 );\n\n CHECK_CLOSE( 0.123456, 0.123457, 1e-3 );\n\n CHECK_NOT_CLOSE( 0.123456, -0.123457, 1e-3 );\n\n CHECK_CLOSE( 1.23456e28, 1.23457e28, 1e-3 );\n\n CHECK_CLOSE( 1.23456e-10, 1.23457e-10, 1e-3 );\n CHECK_NOT_CLOSE( 1.111e-10, 1.112e-10, 0.0008999 );\n CHECK_CLOSE( 1.112e-10, 1.111e-10, 0.1 );\n\n CHECK_CLOSE( 1, 1.0001, 1.1e-2 );\n CHECK_CLOSE( 1.0002, 1.0001, 1.1e-2 );\n\n CHECK_NOT_CLOSE( 1, 1.0002, 1.1e-4 );\n\n#undef CHECK_CLOSE\n#undef CHECK_NOT_CLOSE \n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE( test_type_mismatch )\n{\n BOOST_CHECK_CLOSE_FRACTION( 2., 2.1, 0.06 );\n BOOST_CHECK_CLOSE( 2.1, 2., 6. );\n BOOST_CHECK_CLOSE( 2.1, 2.f, 6. );\n}\n\n\/\/____________________________________________________________________________\/\/\n\nBOOST_AUTO_TEST_CASE( test_CHECK_SMALL )\n{\n BOOST_CHECK_SMALL( 1e-6, 1e-5 );\n BOOST_CHECK_SMALL( -1e-6, 1e-5 );\n\n#ifndef BOOST_TEST_NO_NEW_TOOLS\n BOOST_TEST( 1e-6 != 0., 1e-7 );\n#endif\n}\n\n\/\/____________________________________________________________________________\/\/\n\nnamespace fpc = boost::math::fpc;\n\nBOOST_AUTO_TEST_CASE( test_close_at_tolerance )\n{\n double fp1 = 1.00000001;\n double fp2 = 1.00000002;\n double epsilon = 1e-6;\n\n\/\/ ::fpc::close_at_tolerance<double> pred( ::fpc::percent_tolerance( epsilon ), ::fpc::FPC_WEAK );\n\/\/ BOOST_CHECK_PREDICATE( pred, (fp1)(fp2) );\n\n\/\/ BOOST_CHECK_PREDICATE( bind(not_func, bind(check_is_close, _1, _2, _3)), \n\/\/ (fp1)(fp2)( ::fpc::percent_tolerance( epsilon )) );\n\n fp1 = 1.23456e-10;\n fp2 = 1.23457e-10;\n epsilon = 8.1e-4;\n\n\/\/ BOOST_CHECK_PREDICATE( ::fpc::close_at_tolerance<double>( ::fpc::percent_tolerance( epsilon ), ::fpc::FPC_WEAK ), (fp1)(fp2) );\n\/\/ BOOST_CHECK_PREDICATE( \n\/\/ bind(not_func, \n\/\/ bind( ::fpc::close_at_tolerance<double>( ::fpc::percent_tolerance( epsilon ) ), _1, _2)), (fp1)(fp2) );\n}\n\n\/\/____________________________________________________________________________\/\/\n\n\/\/ EOF\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Patrick Putnam\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n#ifndef BUFFERED_STREAM_HPP_\n#define BUFFERED_STREAM_HPP_\n\n#include \"buffered_stream_def.hpp\"\n\n#include \"basic_buffered_stream.hpp\"\n#include \"double_buffered_stream.hpp\"\n\n#endif \/\/ BUFFERED_STREAM_HPP_\n<commit_msg>Added mutex based double buffer. Significantly reduces overhead.<commit_after>\/\/ Copyright 2015 Patrick Putnam\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n#ifndef BUFFERED_STREAM_HPP_\n#define BUFFERED_STREAM_HPP_\n\n#include \"buffered_stream_def.hpp\"\n\n#include \"basic_buffered_stream.hpp\"\n#include \"double_buffered_stream.hpp\"\n#include \"double_buffered_mutex_stream.hpp\"\n\n#endif \/\/ BUFFERED_STREAM_HPP_\n<|endoftext|>"} {"text":"<commit_before><commit_msg>No need to use += to initialize m_aFileRoot.<commit_after><|endoftext|>"} {"text":"<commit_before>#include <boost\/python\/class.hpp>\n#include \"HopfieldServer_wrap.h\"\n#include <examples\/hopfield\/HopfieldServer.h>\n\nusing namespace boost::python;\nusing namespace opencog;\n\nvoid init_HopfieldServer_py()\n{\n class_<HopfieldServer>(\"HopfieldServer\")\n ;\n}\n<commit_msg>Based HopfieldServer from CogServer, and exposed derivedCreateInstance() method.<commit_after>#include <boost\/python\/class.hpp>\n#include <boost\/python\/return_value_policy.hpp>\n#include <boost\/python\/manage_new_object.hpp>\n#include \"HopfieldServer_wrap.h\"\n#include <examples\/hopfield\/HopfieldServer.h>\n#include <opencog\/server\/CogServer.h>\n\nusing namespace boost::python;\nusing namespace opencog;\n\nvoid init_HopfieldServer_py()\n{\n class_<HopfieldServer, bases<CogServer> >(\"HopfieldServer\")\n .def(\"derivedCreateInstance\",\n &HopfieldServer::derivedCreateInstance,\n return_value_policy<manage_new_object>())\n .staticmethod(\"derivedCreateInstance\")\n ;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: client.cxx,v $\n *\n * $Revision: 1.19 $\n *\n * last change: $Author: ihi $ $Date: 2007-04-19 09:23:04 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n\n\n#ifndef _COM_SUN_STAR_EMBED_XEMBEDDEDOBJECT_HPP_\n#include <com\/sun\/star\/embed\/XEmbeddedObject.hpp>\n#endif\n#ifndef _COM_SUN_STAR_EMBED_NOVISUALAREASIZEEXCEPTION_HPP_\n#include <com\/sun\/star\/embed\/NoVisualAreaSizeException.hpp>\n#endif\n\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sot\/sotref.hxx>\n#include <svx\/svditer.hxx>\n#include <svx\/svdobj.hxx>\n#include <svx\/svdmodel.hxx>\n#include <svx\/svdpage.hxx>\n#include <svx\/svdoole2.hxx>\n#include <svx\/svdview.hxx>\n#include <svx\/svdograf.hxx>\n#include <svtools\/embedhlp.hxx>\n\n#include \"client.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"docsh.hxx\"\n\nusing namespace com::sun::star;\n\n\/\/------------------------------------------------------------------------\n\nScClient::ScClient( ScTabViewShell* pViewShell, Window* pDraw, SdrModel* pSdrModel, SdrOle2Obj* pObj ) :\n SfxInPlaceClient( pViewShell, pDraw, pObj->GetAspect() ),\n pModel( pSdrModel ),\n pGrafEdit( 0 )\n{\n SetObject( pObj->GetObjRef() );\n}\n\n__EXPORT ScClient::~ScClient()\n{\n}\n\nSdrOle2Obj* ScClient::GetDrawObj()\n{\n uno::Reference < embed::XEmbeddedObject > xObj = GetObject();\n SdrOle2Obj* pOle2Obj = NULL;\n String aName = GetViewShell()->GetObjectShell()->GetEmbeddedObjectContainer().GetEmbeddedObjectName( xObj );\n\n USHORT nPages = pModel->GetPageCount();\n for (USHORT nPNr=0; nPNr<nPages && !pOle2Obj; nPNr++)\n {\n SdrPage* pPage = pModel->GetPage(nPNr);\n SdrObjListIter aIter( *pPage, IM_DEEPNOGROUPS );\n SdrObject* pObject = aIter.Next();\n while (pObject && !pOle2Obj)\n {\n if ( pObject->GetObjIdentifier() == OBJ_OLE2 )\n {\n \/\/ name from InfoObject is PersistName\n if ( ((SdrOle2Obj*)pObject)->GetPersistName() == aName )\n pOle2Obj = (SdrOle2Obj*)pObject;\n }\n pObject = aIter.Next();\n }\n }\n return pOle2Obj;\n}\n\nvoid __EXPORT ScClient::RequestNewObjectArea( Rectangle& aLogicRect )\n{\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (!pViewSh)\n {\n DBG_ERROR(\"Wrong ViewShell\");\n return;\n }\n\n Rectangle aOldRect = GetObjArea();\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if ( pDrawObj )\n {\n if ( pDrawObj->IsResizeProtect() )\n aLogicRect.SetSize( aOldRect.GetSize() );\n\n if ( pDrawObj->IsMoveProtect() )\n aLogicRect.SetPos( aOldRect.TopLeft() );\n }\n\n USHORT nTab = pViewSh->GetViewData()->GetTabNo();\n SdrPage* pPage = pModel->GetPage(static_cast<sal_uInt16>(static_cast<sal_Int16>(nTab)));\n if ( pPage && aLogicRect != aOldRect )\n {\n Point aPos;\n Size aSize = pPage->GetSize();\n if ( aSize.Width() < 0 )\n {\n aPos.X() = aSize.Width() + 1; \/\/ negative\n aSize.Width() = -aSize.Width(); \/\/ positive\n }\n Rectangle aPageRect( aPos, aSize );\n\n if (aLogicRect.Right() > aPageRect.Right())\n {\n long nDiff = aLogicRect.Right() - aPageRect.Right();\n aLogicRect.Left() -= nDiff;\n aLogicRect.Right() -= nDiff;\n }\n if (aLogicRect.Bottom() > aPageRect.Bottom())\n {\n long nDiff = aLogicRect.Bottom() - aPageRect.Bottom();\n aLogicRect.Top() -= nDiff;\n aLogicRect.Bottom() -= nDiff;\n }\n\n if (aLogicRect.Left() < aPageRect.Left())\n {\n long nDiff = aLogicRect.Left() - aPageRect.Left();\n aLogicRect.Right() -= nDiff;\n aLogicRect.Left() -= nDiff;\n }\n if (aLogicRect.Top() < aPageRect.Top())\n {\n long nDiff = aLogicRect.Top() - aPageRect.Top();\n aLogicRect.Bottom() -= nDiff;\n aLogicRect.Top() -= nDiff;\n }\n }\n}\n\nvoid __EXPORT ScClient::ObjectAreaChanged()\n{\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (!pViewSh)\n {\n DBG_ERROR(\"Wrong ViewShell\");\n return;\n }\n\n \/\/ Position und Groesse ins Dokument uebernehmen\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n pDrawObj->SetLogicRect( GetScaledObjArea() );\n\n \/\/ set document modified (SdrModel::SetChanged is not used)\n \/\/ TODO\/LATER: is there a reason that this code is not executed in Draw?\n\/\/ SfxViewShell* pSfxViewSh = GetViewShell();\n\/\/ ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (pViewSh)\n pViewSh->GetViewData()->GetDocShell()->SetDrawModified();\n }\n\n if (pDrawObj)\n pViewSh->ScrollToObject( pDrawObj );\n}\n\nvoid __EXPORT ScClient::ViewChanged()\n{\n if ( GetAspect() == embed::Aspects::MSOLE_ICON )\n {\n \/\/ the iconified object seems not to need such a scaling handling\n \/\/ since the replacement image and the size a completely controlled by the container\n \/\/ TODO\/LATER: when the icon exchange is implemented the scaling handling might be required again here\n\n return;\n }\n\n uno::Reference < embed::XEmbeddedObject > xObj = GetObject();\n\n \/\/ TODO\/LEAN: working with Visual Area can switch object to running state\n awt::Size aSz;\n try {\n aSz = xObj->getVisualAreaSize( GetAspect() );\n } catch ( embed::NoVisualAreaSizeException& )\n {\n DBG_ERROR(\"The visual area size must be available!\\n\");\n }\n\n MapUnit aMapUnit = VCLUnoHelper::UnoEmbed2VCLMapUnit( xObj->getMapUnit( GetAspect() ) );\n Size aVisSize = OutputDevice::LogicToLogic( Size( aSz.Width, aSz.Height ), aMapUnit, MAP_100TH_MM );\n\n \/\/ Groesse ins Dokument uebernehmen\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n Rectangle aLogicRect = pDrawObj->GetLogicRect();\n Fraction aFractX = GetScaleWidth();\n Fraction aFractY = GetScaleHeight();\n aFractX *= aVisSize.Width();\n aFractY *= aVisSize.Height();\n aVisSize = Size( (long) aFractX, (long) aFractY ); \/\/ skaliert fuer Draw-Model\n\n \/\/ pClientData->SetObjArea vor pDrawObj->SetLogicRect, damit keine\n \/\/ falschen Skalierungen ausgerechnet werden:\n \/\/Rectangle aObjArea = aLogicRect;\n \/\/aObjArea.SetSize( aVisSize ); \/\/ Dokument-Groesse vom Server\n \/\/SetObjArea( aObjArea );\n\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if ( pViewSh )\n {\n Window* pWin = pViewSh->GetActiveWin();\n if ( pWin->LogicToPixel( aVisSize ) != pWin->LogicToPixel( aLogicRect.GetSize() ) )\n {\n aLogicRect.SetSize( aVisSize );\n pDrawObj->SetLogicRect( aLogicRect );\n\n \/\/ set document modified (SdrModel::SetChanged is not used)\n pViewSh->GetViewData()->GetDocShell()->SetDrawModified();\n }\n }\n }\n}\n\nvoid __EXPORT ScClient::MakeVisible()\n{\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (pViewSh)\n pViewSh->ScrollToObject( pDrawObj );\n }\n}\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.19.302); FILE MERGED 2008\/04\/01 12:36:38 thb 1.19.302.2: #i85898# Stripping all external header guards 2008\/03\/31 17:15:09 rt 1.19.302.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: client.cxx,v $\n * $Revision: 1.20 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sc.hxx\"\n\n\/\/ INCLUDE ---------------------------------------------------------------\n\n\n#include <com\/sun\/star\/embed\/XEmbeddedObject.hpp>\n#include <com\/sun\/star\/embed\/NoVisualAreaSizeException.hpp>\n\n#include <toolkit\/helper\/vclunohelper.hxx>\n#include <sfx2\/objsh.hxx>\n#include <sfx2\/viewfrm.hxx>\n#include <sot\/sotref.hxx>\n#include <svx\/svditer.hxx>\n#include <svx\/svdobj.hxx>\n#include <svx\/svdmodel.hxx>\n#include <svx\/svdpage.hxx>\n#include <svx\/svdoole2.hxx>\n#include <svx\/svdview.hxx>\n#include <svx\/svdograf.hxx>\n#include <svtools\/embedhlp.hxx>\n\n#include \"client.hxx\"\n#include \"tabvwsh.hxx\"\n#include \"docsh.hxx\"\n\nusing namespace com::sun::star;\n\n\/\/------------------------------------------------------------------------\n\nScClient::ScClient( ScTabViewShell* pViewShell, Window* pDraw, SdrModel* pSdrModel, SdrOle2Obj* pObj ) :\n SfxInPlaceClient( pViewShell, pDraw, pObj->GetAspect() ),\n pModel( pSdrModel ),\n pGrafEdit( 0 )\n{\n SetObject( pObj->GetObjRef() );\n}\n\n__EXPORT ScClient::~ScClient()\n{\n}\n\nSdrOle2Obj* ScClient::GetDrawObj()\n{\n uno::Reference < embed::XEmbeddedObject > xObj = GetObject();\n SdrOle2Obj* pOle2Obj = NULL;\n String aName = GetViewShell()->GetObjectShell()->GetEmbeddedObjectContainer().GetEmbeddedObjectName( xObj );\n\n USHORT nPages = pModel->GetPageCount();\n for (USHORT nPNr=0; nPNr<nPages && !pOle2Obj; nPNr++)\n {\n SdrPage* pPage = pModel->GetPage(nPNr);\n SdrObjListIter aIter( *pPage, IM_DEEPNOGROUPS );\n SdrObject* pObject = aIter.Next();\n while (pObject && !pOle2Obj)\n {\n if ( pObject->GetObjIdentifier() == OBJ_OLE2 )\n {\n \/\/ name from InfoObject is PersistName\n if ( ((SdrOle2Obj*)pObject)->GetPersistName() == aName )\n pOle2Obj = (SdrOle2Obj*)pObject;\n }\n pObject = aIter.Next();\n }\n }\n return pOle2Obj;\n}\n\nvoid __EXPORT ScClient::RequestNewObjectArea( Rectangle& aLogicRect )\n{\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (!pViewSh)\n {\n DBG_ERROR(\"Wrong ViewShell\");\n return;\n }\n\n Rectangle aOldRect = GetObjArea();\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if ( pDrawObj )\n {\n if ( pDrawObj->IsResizeProtect() )\n aLogicRect.SetSize( aOldRect.GetSize() );\n\n if ( pDrawObj->IsMoveProtect() )\n aLogicRect.SetPos( aOldRect.TopLeft() );\n }\n\n USHORT nTab = pViewSh->GetViewData()->GetTabNo();\n SdrPage* pPage = pModel->GetPage(static_cast<sal_uInt16>(static_cast<sal_Int16>(nTab)));\n if ( pPage && aLogicRect != aOldRect )\n {\n Point aPos;\n Size aSize = pPage->GetSize();\n if ( aSize.Width() < 0 )\n {\n aPos.X() = aSize.Width() + 1; \/\/ negative\n aSize.Width() = -aSize.Width(); \/\/ positive\n }\n Rectangle aPageRect( aPos, aSize );\n\n if (aLogicRect.Right() > aPageRect.Right())\n {\n long nDiff = aLogicRect.Right() - aPageRect.Right();\n aLogicRect.Left() -= nDiff;\n aLogicRect.Right() -= nDiff;\n }\n if (aLogicRect.Bottom() > aPageRect.Bottom())\n {\n long nDiff = aLogicRect.Bottom() - aPageRect.Bottom();\n aLogicRect.Top() -= nDiff;\n aLogicRect.Bottom() -= nDiff;\n }\n\n if (aLogicRect.Left() < aPageRect.Left())\n {\n long nDiff = aLogicRect.Left() - aPageRect.Left();\n aLogicRect.Right() -= nDiff;\n aLogicRect.Left() -= nDiff;\n }\n if (aLogicRect.Top() < aPageRect.Top())\n {\n long nDiff = aLogicRect.Top() - aPageRect.Top();\n aLogicRect.Bottom() -= nDiff;\n aLogicRect.Top() -= nDiff;\n }\n }\n}\n\nvoid __EXPORT ScClient::ObjectAreaChanged()\n{\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (!pViewSh)\n {\n DBG_ERROR(\"Wrong ViewShell\");\n return;\n }\n\n \/\/ Position und Groesse ins Dokument uebernehmen\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n pDrawObj->SetLogicRect( GetScaledObjArea() );\n\n \/\/ set document modified (SdrModel::SetChanged is not used)\n \/\/ TODO\/LATER: is there a reason that this code is not executed in Draw?\n\/\/ SfxViewShell* pSfxViewSh = GetViewShell();\n\/\/ ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (pViewSh)\n pViewSh->GetViewData()->GetDocShell()->SetDrawModified();\n }\n\n if (pDrawObj)\n pViewSh->ScrollToObject( pDrawObj );\n}\n\nvoid __EXPORT ScClient::ViewChanged()\n{\n if ( GetAspect() == embed::Aspects::MSOLE_ICON )\n {\n \/\/ the iconified object seems not to need such a scaling handling\n \/\/ since the replacement image and the size a completely controlled by the container\n \/\/ TODO\/LATER: when the icon exchange is implemented the scaling handling might be required again here\n\n return;\n }\n\n uno::Reference < embed::XEmbeddedObject > xObj = GetObject();\n\n \/\/ TODO\/LEAN: working with Visual Area can switch object to running state\n awt::Size aSz;\n try {\n aSz = xObj->getVisualAreaSize( GetAspect() );\n } catch ( embed::NoVisualAreaSizeException& )\n {\n DBG_ERROR(\"The visual area size must be available!\\n\");\n }\n\n MapUnit aMapUnit = VCLUnoHelper::UnoEmbed2VCLMapUnit( xObj->getMapUnit( GetAspect() ) );\n Size aVisSize = OutputDevice::LogicToLogic( Size( aSz.Width, aSz.Height ), aMapUnit, MAP_100TH_MM );\n\n \/\/ Groesse ins Dokument uebernehmen\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n Rectangle aLogicRect = pDrawObj->GetLogicRect();\n Fraction aFractX = GetScaleWidth();\n Fraction aFractY = GetScaleHeight();\n aFractX *= aVisSize.Width();\n aFractY *= aVisSize.Height();\n aVisSize = Size( (long) aFractX, (long) aFractY ); \/\/ skaliert fuer Draw-Model\n\n \/\/ pClientData->SetObjArea vor pDrawObj->SetLogicRect, damit keine\n \/\/ falschen Skalierungen ausgerechnet werden:\n \/\/Rectangle aObjArea = aLogicRect;\n \/\/aObjArea.SetSize( aVisSize ); \/\/ Dokument-Groesse vom Server\n \/\/SetObjArea( aObjArea );\n\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if ( pViewSh )\n {\n Window* pWin = pViewSh->GetActiveWin();\n if ( pWin->LogicToPixel( aVisSize ) != pWin->LogicToPixel( aLogicRect.GetSize() ) )\n {\n aLogicRect.SetSize( aVisSize );\n pDrawObj->SetLogicRect( aLogicRect );\n\n \/\/ set document modified (SdrModel::SetChanged is not used)\n pViewSh->GetViewData()->GetDocShell()->SetDrawModified();\n }\n }\n }\n}\n\nvoid __EXPORT ScClient::MakeVisible()\n{\n SdrOle2Obj* pDrawObj = GetDrawObj();\n if (pDrawObj)\n {\n SfxViewShell* pSfxViewSh = GetViewShell();\n ScTabViewShell* pViewSh = PTR_CAST( ScTabViewShell, pSfxViewSh );\n if (pViewSh)\n pViewSh->ScrollToObject( pDrawObj );\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: output.hxx,v $\n *\n * $Revision: 1.17 $\n *\n * last change: $Author: ihi $ $Date: 2006-11-14 15:54:25 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SC_OUTPUT_HXX\n#define SC_OUTPUT_HXX\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _FRACT_HXX \/\/autogen\n#include <tools\/fract.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_EMBED_XEMBEDDEDOBJECT_HPP_\n#include <com\/sun\/star\/embed\/XEmbeddedObject.hpp>\n#endif\n\nclass Rectangle;\nclass Font;\nclass OutputDevice;\nclass Window;\nclass EditEngine;\nclass ScDocument;\nclass ScBaseCell;\nclass ScPatternAttr;\nclass SvxMarginItem;\nclass SdrObject;\nclass SdrOle2Obj;\nstruct RowInfo;\nstruct ScTableInfo;\nclass ScTabViewShell;\nclass ScPageBreakData;\nclass FmFormView;\n\n\/\/ ---------------------------------------------------------------------------\n\n#define SC_SCENARIO_HSPACE 60\n#define SC_SCENARIO_VSPACE 50\n\n\/\/ ---------------------------------------------------------------------------\n\n#define SC_OBJECTS_NONE 0\n#define SC_OBJECTS_DRAWING 1\n#define SC_OBJECTS_OLE 2\n#define SC_OBJECTS_CHARTS 4\n#define SC_OBJECTS_ALL ( SC_OBJECTS_DRAWING | SC_OBJECTS_OLE | SC_OBJECTS_CHARTS )\n\nenum ScOutputType { OUTTYPE_WINDOW, OUTTYPE_PRINTER };\n\nclass ScOutputData\n{\nfriend class ScDrawStringsVars;\nprivate:\n OutputDevice* pDev; \/\/ Device\n OutputDevice* pRefDevice; \/\/ printer if used for preview\n OutputDevice* pFmtDevice; \/\/ reference for text formatting\n ScTableInfo& mrTabInfo;\n RowInfo* pRowInfo; \/\/ Info-Block\n SCSIZE nArrCount; \/\/ belegte Zeilen im Info-Block\n ScDocument* pDoc; \/\/ Dokument\n SCTAB nTab; \/\/ Tabelle\n long nScrX; \/\/ Ausgabe Startpos. (Pixel)\n long nScrY;\n long nScrW; \/\/ Ausgabe Groesse (Pixel)\n long nScrH;\n long nMirrorW; \/\/ Visible output width for mirroring (default: nScrW)\n SCCOL nX1; \/\/ Start-\/Endkoordinaten\n SCROW nY1; \/\/ ( incl. versteckte )\n SCCOL nX2;\n SCROW nY2;\n SCCOL nVisX1; \/\/ Start-\/Endkoordinaten\n SCROW nVisY1; \/\/ ( sichtbarer Bereich )\n SCCOL nVisX2;\n SCROW nVisY2;\n ScOutputType eType; \/\/ Bildschirm\/Drucker ...\n double nPPTX; \/\/ Pixel per Twips\n double nPPTY;\n\/\/ USHORT nZoom; \/\/ Zoom-Faktor (Prozent) - fuer GetFont\n Fraction aZoomX;\n Fraction aZoomY;\n\n SdrObject* pEditObj; \/\/ beim Painten auslassen\n\n ScTabViewShell* pViewShell; \/\/ zum Connecten von sichtbaren Plug-Ins\n\n \/\/ #114135#\n FmFormView* pDrawView; \/\/ SdrView to paint to\n\n BOOL bEditMode; \/\/ InPlace editierte Zelle - nicht ausgeben\n SCCOL nEditCol;\n SCROW nEditRow;\n\n BOOL bMetaFile; \/\/ Ausgabe auf Metafile (nicht in Pixeln!)\n BOOL bSingleGrid; \/\/ beim Gitter bChanged auswerten\n\n BOOL bPagebreakMode; \/\/ Seitenumbruch-Vorschau\n BOOL bSolidBackground; \/\/ weiss statt transparent\n\n BOOL bUseStyleColor;\n BOOL bForceAutoColor;\n\n BOOL bSyntaxMode; \/\/ Syntax-Highlighting\n Color* pValueColor;\n Color* pTextColor;\n Color* pFormulaColor;\n\n Color aGridColor;\n\n BOOL bShowNullValues;\n BOOL bShowFormulas;\n BOOL bShowSpellErrors; \/\/ Spell-Errors in EditObjekten anzeigen\n BOOL bMarkClipped;\n\n BOOL bSnapPixel;\n\n BOOL bAnyRotated; \/\/ intern\n BOOL bAnyClipped; \/\/ intern\n BOOL bTabProtected;\n BYTE nTabTextDirection; \/\/ EEHorizontalTextDirection values\n BOOL bLayoutRTL;\n\n \/\/ private methods\n\n BOOL GetMergeOrigin( SCCOL nX, SCROW nY, SCSIZE nArrY,\n SCCOL& rOverX, SCROW& rOverY, BOOL bVisRowChanged );\n BOOL IsEmptyCellText( RowInfo* pThisRowInfo, SCCOL nX, SCROW nY );\n void GetVisibleCell( SCCOL nCol, SCROW nRow, SCTAB nTab, ScBaseCell*& rpCell );\n\n BOOL IsAvailable( SCCOL nX, SCROW nY );\n long GetAvailableWidth( SCCOL nX, SCROW nY, long nNeeded );\n void GetOutputArea( SCCOL nX, SCSIZE nArrY, long nPosX, long nPosY,\n SCCOL nCellX, SCROW nCellY, long nNeeded,\n const ScPatternAttr& rPattern,\n USHORT nHorJustify, BOOL bCellIsValue,\n BOOL bBreak, BOOL bOverwrite,\n Rectangle& rAlignRect, Rectangle& rClipRect,\n BOOL& rLeftClip, BOOL& rRightClip );\n\n void ShrinkEditEngine( EditEngine& rEngine, const Rectangle& rAlignRect,\n long nLeftM, long nTopM, long nRightM, long nBottomM,\n BOOL bWidth, USHORT nOrient, long nAttrRotate, BOOL bPixelToLogic,\n long& rEngineWidth, long& rEngineHeight, long& rNeededPixel,\n BOOL& rLeftClip, BOOL& rRightClip );\n\n void SetSyntaxColor( Font* pFont, ScBaseCell* pCell );\n void SetEditSyntaxColor( EditEngine& rEngine, ScBaseCell* pCell );\n\n void ConnectObject( const com::sun::star::uno::Reference < com::sun::star::embed::XEmbeddedObject >& rRef, SdrOle2Obj* pOleObj );\n\n double GetStretch();\n\n void DrawRotatedFrame( const Color* pForceColor ); \/\/ pixel\n\npublic:\n ScOutputData( OutputDevice* pNewDev, ScOutputType eNewType,\n ScTableInfo& rTabInfo, ScDocument* pNewDoc,\n SCTAB nNewTab, long nNewScrX, long nNewScrY,\n SCCOL nNewX1, SCROW nNewY1, SCCOL nNewX2, SCROW nNewY2,\n double nPixelPerTwipsX, double nPixelPerTwipsY,\n const Fraction* pZoomX = NULL,\n const Fraction* pZoomY = NULL );\n\n ~ScOutputData();\n\n void SetRefDevice( OutputDevice* pRDev ) { pRefDevice = pFmtDevice = pRDev; }\n void SetFmtDevice( OutputDevice* pRDev ) { pFmtDevice = pRDev; }\n void SetEditObject( SdrObject* pObj ) { pEditObj = pObj; }\n void SetViewShell( ScTabViewShell* pSh ) { pViewShell = pSh; }\n\n \/\/ #114135#\n void SetDrawView( FmFormView* pNew ) { pDrawView = pNew; }\n\n void SetSolidBackground( BOOL bSet ) { bSolidBackground = bSet; }\n void SetUseStyleColor( BOOL bSet ) { bUseStyleColor = bSet; }\n\n void SetEditCell( SCCOL nCol, SCROW nRow );\n void SetSyntaxMode( BOOL bNewMode );\n void SetMetaFileMode( BOOL bNewMode );\n void SetSingleGrid( BOOL bNewMode );\n void SetGridColor( const Color& rColor );\n void SetMarkClipped( BOOL bSet );\n void SetShowNullValues ( BOOL bSet = TRUE );\n void SetShowFormulas ( BOOL bSet = TRUE );\n void SetShowSpellErrors( BOOL bSet = TRUE );\n void SetMirrorWidth( long nNew );\n long GetScrW() const { return nScrW; }\n long GetScrH() const { return nScrH; }\n\n void SetSnapPixel( BOOL bSet = TRUE );\n\n void DrawGrid( BOOL bGrid, BOOL bPage );\n void DrawStrings( BOOL bPixelToLogic = FALSE );\n void DrawBackground();\n void DrawShadow();\n void DrawExtraShadow(BOOL bLeft, BOOL bTop, BOOL bRight, BOOL bBottom);\n void DrawFrame();\n\n \/\/ with logic MapMode set!\n void DrawEdit(BOOL bPixelToLogic);\n\n void FindRotated();\n void DrawRotated(BOOL bPixelToLogic); \/\/ logisch\n\n void DrawClear();\n void DrawPageBorder( SCCOL nStartX, SCROW nStartY, SCCOL nEndX, SCROW nEndY );\n\n \/\/ #109985#\n \/\/void DrawingLayer( USHORT nLayer, USHORT nObjectFlags, long nLogStX, long nLogStY );\n void DrawingLayer(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode, long nLogStX, long nLogStY );\n\n \/\/ nur Bildschirm:\n\n \/\/ #109985#\n \/\/void DrawingSingle( USHORT nLayer, USHORT nObjectFlags, USHORT nDummyFlags );\n void DrawingSingle(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode);\n\n \/\/ #109985#\n \/\/void DrawSelectiveObjects( USHORT nLayer, const Rectangle& rRect, USHORT nObjectFlags, USHORT nDummyFlags = 0 );\n void DrawSelectiveObjects(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode);\n\n BOOL SetChangedClip(); \/\/ FALSE = nix\n\n void FindChanged();\n void SetPagebreakMode( ScPageBreakData* pPageData );\n void DrawMark( Window* pWin );\n void DrawRefMark( SCCOL nRefStartX, SCROW nRefStartY,\n SCCOL nRefEndX, SCROW nRefEndY,\n const Color& rColor, BOOL bHandle );\n void DrawOneChange( SCCOL nRefStartX, SCROW nRefStartY,\n SCCOL nRefEndX, SCROW nRefEndY,\n const Color& rColor, USHORT nType );\n void DrawChangeTrack();\n void DrawClipMarks();\n\n void DrawNoteMarks();\n void AddPDFNotes();\n void PrintNoteMarks( const List& rPosList ); \/\/ List of ScAddress\n};\n\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS aw039 (1.17.36); FILE MERGED 2006\/12\/20 16:16:44 aw 1.17.36.1: #i72502# reorganizing DrawingLayer Layer printing for SC<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: output.hxx,v $\n *\n * $Revision: 1.18 $\n *\n * last change: $Author: obo $ $Date: 2007-01-22 15:07:04 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef SC_OUTPUT_HXX\n#define SC_OUTPUT_HXX\n\n#ifndef SC_ADDRESS_HXX\n#include \"address.hxx\"\n#endif\n\n#ifndef _LIST_HXX \/\/autogen\n#include <tools\/list.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _FRACT_HXX \/\/autogen\n#include <tools\/fract.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_EMBED_XEMBEDDEDOBJECT_HPP_\n#include <com\/sun\/star\/embed\/XEmbeddedObject.hpp>\n#endif\n\nclass Rectangle;\nclass Font;\nclass OutputDevice;\nclass Window;\nclass EditEngine;\nclass ScDocument;\nclass ScBaseCell;\nclass ScPatternAttr;\nclass SvxMarginItem;\nclass SdrObject;\nclass SdrOle2Obj;\nstruct RowInfo;\nstruct ScTableInfo;\nclass ScTabViewShell;\nclass ScPageBreakData;\nclass FmFormView;\n\n\/\/ ---------------------------------------------------------------------------\n\n#define SC_SCENARIO_HSPACE 60\n#define SC_SCENARIO_VSPACE 50\n\n\/\/ ---------------------------------------------------------------------------\n\n#define SC_OBJECTS_NONE 0\n#define SC_OBJECTS_DRAWING 1\n#define SC_OBJECTS_OLE 2\n#define SC_OBJECTS_CHARTS 4\n#define SC_OBJECTS_ALL ( SC_OBJECTS_DRAWING | SC_OBJECTS_OLE | SC_OBJECTS_CHARTS )\n\nenum ScOutputType { OUTTYPE_WINDOW, OUTTYPE_PRINTER };\n\nclass ScOutputData\n{\nfriend class ScDrawStringsVars;\nprivate:\n OutputDevice* pDev; \/\/ Device\n OutputDevice* pRefDevice; \/\/ printer if used for preview\n OutputDevice* pFmtDevice; \/\/ reference for text formatting\n ScTableInfo& mrTabInfo;\n RowInfo* pRowInfo; \/\/ Info-Block\n SCSIZE nArrCount; \/\/ belegte Zeilen im Info-Block\n ScDocument* pDoc; \/\/ Dokument\n SCTAB nTab; \/\/ Tabelle\n long nScrX; \/\/ Ausgabe Startpos. (Pixel)\n long nScrY;\n long nScrW; \/\/ Ausgabe Groesse (Pixel)\n long nScrH;\n long nMirrorW; \/\/ Visible output width for mirroring (default: nScrW)\n SCCOL nX1; \/\/ Start-\/Endkoordinaten\n SCROW nY1; \/\/ ( incl. versteckte )\n SCCOL nX2;\n SCROW nY2;\n SCCOL nVisX1; \/\/ Start-\/Endkoordinaten\n SCROW nVisY1; \/\/ ( sichtbarer Bereich )\n SCCOL nVisX2;\n SCROW nVisY2;\n ScOutputType eType; \/\/ Bildschirm\/Drucker ...\n double nPPTX; \/\/ Pixel per Twips\n double nPPTY;\n\/\/ USHORT nZoom; \/\/ Zoom-Faktor (Prozent) - fuer GetFont\n Fraction aZoomX;\n Fraction aZoomY;\n\n SdrObject* pEditObj; \/\/ beim Painten auslassen\n\n ScTabViewShell* pViewShell; \/\/ zum Connecten von sichtbaren Plug-Ins\n\n \/\/ #114135#\n FmFormView* pDrawView; \/\/ SdrView to paint to\n\n BOOL bEditMode; \/\/ InPlace editierte Zelle - nicht ausgeben\n SCCOL nEditCol;\n SCROW nEditRow;\n\n BOOL bMetaFile; \/\/ Ausgabe auf Metafile (nicht in Pixeln!)\n BOOL bSingleGrid; \/\/ beim Gitter bChanged auswerten\n\n BOOL bPagebreakMode; \/\/ Seitenumbruch-Vorschau\n BOOL bSolidBackground; \/\/ weiss statt transparent\n\n BOOL bUseStyleColor;\n BOOL bForceAutoColor;\n\n BOOL bSyntaxMode; \/\/ Syntax-Highlighting\n Color* pValueColor;\n Color* pTextColor;\n Color* pFormulaColor;\n\n Color aGridColor;\n\n BOOL bShowNullValues;\n BOOL bShowFormulas;\n BOOL bShowSpellErrors; \/\/ Spell-Errors in EditObjekten anzeigen\n BOOL bMarkClipped;\n\n BOOL bSnapPixel;\n\n BOOL bAnyRotated; \/\/ intern\n BOOL bAnyClipped; \/\/ intern\n BOOL bTabProtected;\n BYTE nTabTextDirection; \/\/ EEHorizontalTextDirection values\n BOOL bLayoutRTL;\n\n \/\/ private methods\n\n BOOL GetMergeOrigin( SCCOL nX, SCROW nY, SCSIZE nArrY,\n SCCOL& rOverX, SCROW& rOverY, BOOL bVisRowChanged );\n BOOL IsEmptyCellText( RowInfo* pThisRowInfo, SCCOL nX, SCROW nY );\n void GetVisibleCell( SCCOL nCol, SCROW nRow, SCTAB nTab, ScBaseCell*& rpCell );\n\n BOOL IsAvailable( SCCOL nX, SCROW nY );\n long GetAvailableWidth( SCCOL nX, SCROW nY, long nNeeded );\n void GetOutputArea( SCCOL nX, SCSIZE nArrY, long nPosX, long nPosY,\n SCCOL nCellX, SCROW nCellY, long nNeeded,\n const ScPatternAttr& rPattern,\n USHORT nHorJustify, BOOL bCellIsValue,\n BOOL bBreak, BOOL bOverwrite,\n Rectangle& rAlignRect, Rectangle& rClipRect,\n BOOL& rLeftClip, BOOL& rRightClip );\n\n void ShrinkEditEngine( EditEngine& rEngine, const Rectangle& rAlignRect,\n long nLeftM, long nTopM, long nRightM, long nBottomM,\n BOOL bWidth, USHORT nOrient, long nAttrRotate, BOOL bPixelToLogic,\n long& rEngineWidth, long& rEngineHeight, long& rNeededPixel,\n BOOL& rLeftClip, BOOL& rRightClip );\n\n void SetSyntaxColor( Font* pFont, ScBaseCell* pCell );\n void SetEditSyntaxColor( EditEngine& rEngine, ScBaseCell* pCell );\n\n void ConnectObject( const com::sun::star::uno::Reference < com::sun::star::embed::XEmbeddedObject >& rRef, SdrOle2Obj* pOleObj );\n\n double GetStretch();\n\n void DrawRotatedFrame( const Color* pForceColor ); \/\/ pixel\n\npublic:\n ScOutputData( OutputDevice* pNewDev, ScOutputType eNewType,\n ScTableInfo& rTabInfo, ScDocument* pNewDoc,\n SCTAB nNewTab, long nNewScrX, long nNewScrY,\n SCCOL nNewX1, SCROW nNewY1, SCCOL nNewX2, SCROW nNewY2,\n double nPixelPerTwipsX, double nPixelPerTwipsY,\n const Fraction* pZoomX = NULL,\n const Fraction* pZoomY = NULL );\n\n ~ScOutputData();\n\n void SetRefDevice( OutputDevice* pRDev ) { pRefDevice = pFmtDevice = pRDev; }\n void SetFmtDevice( OutputDevice* pRDev ) { pFmtDevice = pRDev; }\n void SetEditObject( SdrObject* pObj ) { pEditObj = pObj; }\n void SetViewShell( ScTabViewShell* pSh ) { pViewShell = pSh; }\n\n \/\/ #114135#\n void SetDrawView( FmFormView* pNew ) { pDrawView = pNew; }\n\n void SetSolidBackground( BOOL bSet ) { bSolidBackground = bSet; }\n void SetUseStyleColor( BOOL bSet ) { bUseStyleColor = bSet; }\n\n void SetEditCell( SCCOL nCol, SCROW nRow );\n void SetSyntaxMode( BOOL bNewMode );\n void SetMetaFileMode( BOOL bNewMode );\n void SetSingleGrid( BOOL bNewMode );\n void SetGridColor( const Color& rColor );\n void SetMarkClipped( BOOL bSet );\n void SetShowNullValues ( BOOL bSet = TRUE );\n void SetShowFormulas ( BOOL bSet = TRUE );\n void SetShowSpellErrors( BOOL bSet = TRUE );\n void SetMirrorWidth( long nNew );\n long GetScrW() const { return nScrW; }\n long GetScrH() const { return nScrH; }\n\n void SetSnapPixel( BOOL bSet = TRUE );\n\n void DrawGrid( BOOL bGrid, BOOL bPage );\n void DrawStrings( BOOL bPixelToLogic = FALSE );\n void DrawBackground();\n void DrawShadow();\n void DrawExtraShadow(BOOL bLeft, BOOL bTop, BOOL bRight, BOOL bBottom);\n void DrawFrame();\n\n \/\/ with logic MapMode set!\n void DrawEdit(BOOL bPixelToLogic);\n\n void FindRotated();\n void DrawRotated(BOOL bPixelToLogic); \/\/ logisch\n\n void DrawClear();\n void DrawPageBorder( SCCOL nStartX, SCROW nStartY, SCCOL nEndX, SCROW nEndY );\n\n \/\/ #i72502# printer only command set\n Point PrePrintDrawingLayer(long nLogStX, long nLogStY );\n void PostPrintDrawingLayer();\n void PrintDrawingLayer(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode, const Point& rMMOffset);\n\n \/\/ nur Bildschirm:\n \/\/ #109985#\n \/\/void DrawingSingle( USHORT nLayer, USHORT nObjectFlags, USHORT nDummyFlags );\n void DrawingSingle(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode);\n\n \/\/ #109985#\n \/\/void DrawSelectiveObjects( USHORT nLayer, const Rectangle& rRect, USHORT nObjectFlags, USHORT nDummyFlags = 0 );\n void DrawSelectiveObjects(const sal_uInt16 nLayer, const sal_uInt16 nPaintMode);\n\n BOOL SetChangedClip(); \/\/ FALSE = nix\n\n void FindChanged();\n void SetPagebreakMode( ScPageBreakData* pPageData );\n void DrawMark( Window* pWin );\n void DrawRefMark( SCCOL nRefStartX, SCROW nRefStartY,\n SCCOL nRefEndX, SCROW nRefEndY,\n const Color& rColor, BOOL bHandle );\n void DrawOneChange( SCCOL nRefStartX, SCROW nRefStartY,\n SCCOL nRefEndX, SCROW nRefEndY,\n const Color& rColor, USHORT nType );\n void DrawChangeTrack();\n void DrawClipMarks();\n\n void DrawNoteMarks();\n void AddPDFNotes();\n void PrintNoteMarks( const List& rPosList ); \/\/ List of ScAddress\n};\n\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>#include <Python.h>\n#include <numpy\/arrayobject.h>\n\n#include <vector>\n#include <iostream>\n\n#include \"best_utility.h\"\n#include \"solver.h\"\n\nstatic PyObject *\nfind_max(PyObject *self, PyObject *args){\n double p;\n PyArrayObject *X, *y, *X_argsort_by_feature, *example_idx; \/\/borrowed\n PyArrayObject *feature_weights = NULL;\n\n \/\/ Extract the argument values\n if(!PyArg_ParseTuple(args, \"dO!O!O!O!|O!\",\n &p,\n &PyArray_Type, &X,\n &PyArray_Type, &y,\n &PyArray_Type, &X_argsort_by_feature,\n &PyArray_Type, &example_idx,\n &PyArray_Type, &feature_weights)){\n return NULL;\n }\n\n \/\/ Check the type of the numpy arrays\n if(PyArray_TYPE(X) != PyArray_DOUBLE){\n PyErr_SetString(PyExc_TypeError,\n \"X must be numpy.ndarray type double\");\n return NULL;\n }\n if(PyArray_TYPE(y) != PyArray_LONG){\n PyErr_SetString(PyExc_TypeError,\n \"y must be numpy.ndarray type int\");\n return NULL;\n }\n if(PyArray_TYPE(X_argsort_by_feature) != PyArray_LONG){\n PyErr_SetString(PyExc_TypeError,\n \"X_argsort_by_feature must be numpy.ndarray type int\");\n return NULL;\n }\n if(PyArray_TYPE(example_idx) != PyArray_LONG){\n PyErr_SetString(PyExc_TypeError,\n \"example_idx must be numpy.ndarray type int\");\n return NULL;\n }\n if(feature_weights && PyArray_TYPE(feature_weights) != PyArray_DOUBLE){\n PyErr_SetString(PyExc_TypeError,\n \"feature_weights must be numpy.ndarray type double\");\n return NULL;\n }\n\n \/\/ Check the number of dimensions of the numpy arrays\n if(PyArray_NDIM(X) != 2){\n PyErr_SetString(PyExc_TypeError,\n \"X must be a 2D numpy.ndarray\");\n return NULL;\n }\n if(PyArray_NDIM(y) != 1){\n PyErr_SetString(PyExc_TypeError,\n \"y must be a 1D numpy.ndarray\");\n return NULL;\n }\n if(PyArray_NDIM(X_argsort_by_feature) != 2){\n PyErr_SetString(PyExc_TypeError,\n \"X_argsort_by_feature must be a 2D numpy.ndarray\");\n return NULL;\n }\n if(PyArray_NDIM(example_idx) != 1){\n PyErr_SetString(PyExc_TypeError,\n \"example_idx must be a 1D numpy.ndarray\");\n return NULL;\n }\n if(feature_weights && PyArray_NDIM(example_idx) != 1){\n PyErr_SetString(PyExc_TypeError,\n \"feature_weights must be a 1D numpy.ndarray\");\n return NULL;\n }\n\n \/\/ Check that the dimension sizes match\n npy_intp X_dim0 = PyArray_DIM(X, 0);\n npy_intp X_dim1 = PyArray_DIM(X, 1);\n npy_intp y_dim0 = PyArray_DIM(y, 0);\n npy_intp X_argsort_by_feature_dim0 = PyArray_DIM(X_argsort_by_feature, 0);\n npy_intp X_argsort_by_feature_dim1 = PyArray_DIM(X_argsort_by_feature, 1);\n npy_intp example_idx_dim0 = PyArray_DIM(example_idx, 0);\n npy_intp feature_weights_dim0 = 0;\n if(feature_weights){\n feature_weights_dim0 = PyArray_DIM(feature_weights, 0);\n }\n\n if(X_dim0 != y_dim0){\n PyErr_SetString(PyExc_TypeError,\n \"X and y must have the same number of rows\");\n return NULL;\n }\n if(X_dim0 != X_argsort_by_feature_dim0){\n PyErr_SetString(PyExc_TypeError,\n \"X and X_argsort_by_feature must have the same number of rows\");\n return NULL;\n }\n if(X_dim1 != X_argsort_by_feature_dim1){\n PyErr_SetString(PyExc_TypeError,\n \"X and X_argsort_by_feature must have the same number of columns\");\n return NULL;\n }\n if(feature_weights && feature_weights_dim0 != X_dim1){\n PyErr_SetString(PyExc_TypeError,\n \"feature_weights must have shape X.shape[1]\");\n return NULL;\n }\n\n \/\/ Extract the data pointer from the number arrays\n double *X_data;\n long *y_data, *X_argsort_by_feature_data, *example_idx_data;\n X_data = (double*)PyArray_DATA(PyArray_GETCONTIGUOUS(X));\n y_data = (long*)PyArray_DATA(PyArray_GETCONTIGUOUS(y));\n X_argsort_by_feature_data = (long*)PyArray_DATA(PyArray_GETCONTIGUOUS(X_argsort_by_feature));\n example_idx_data = (long*)PyArray_DATA(PyArray_GETCONTIGUOUS(example_idx));\n\n double *feature_weights_data;\n if(feature_weights){\n feature_weights_data = (double*)PyArray_DATA(PyArray_GETCONTIGUOUS(feature_weights));\n }\n else{\n feature_weights_data = new double[X_dim1];\n for(int i = 0; i < X_dim1; i++){\n feature_weights_data[i] = 1;\n }\n }\n\n BestUtility best_solution(100);\n int status = find_max(p, X_data, y_data, X_argsort_by_feature_data, example_idx_data, feature_weights_data,\n example_idx_dim0, X_dim0, X_dim1, best_solution);\n\n if(status != 0){\n PyErr_SetString(PyExc_TypeError,\n \"An error occurred in the solver\");\n return NULL;\n }\n\n \/\/ Prepare variables for return\n\n double opti_utility = best_solution.best_utility;\n\n npy_intp dims[] = {best_solution.best_n_equiv};\n PyObject *opti_feat_idx = PyArray_SimpleNew(1, dims, PyArray_LONG);\n long *opti_feat_idx_data = (long*)PyArray_DATA(opti_feat_idx);\n\n PyObject *opti_thresholds = PyArray_SimpleNew(1, dims, PyArray_DOUBLE);\n double *opti_thresholds_data = (double*)PyArray_DATA(opti_thresholds);\n\n PyObject *opti_kinds = PyArray_SimpleNew(1, dims, PyArray_LONG);\n long *opti_kinds_data = (long*)PyArray_DATA(opti_kinds);\n\n for(int i = 0; i < best_solution.best_n_equiv; i++){\n opti_feat_idx_data[i] = best_solution.best_feat_idx[i];\n opti_thresholds_data[i] = best_solution.best_feat_threshold[i];\n opti_kinds_data[i] = (int) best_solution.best_feat_kind[i];\n }\n\n if (feature_weights){\n Py_DECREF(feature_weights);\n }\n else{\n delete [] feature_weights_data;\n }\n\n Py_DECREF(X);\n Py_DECREF(y);\n Py_DECREF(X_argsort_by_feature);\n Py_DECREF(example_idx);\n\n return Py_BuildValue(\"d,N,N,N\",\n opti_utility,\n opti_feat_idx,\n opti_thresholds,\n opti_kinds);\n}\n\n\n\/***********************************************************************************************************************\n * MODULE DECLARATION\n **********************************************************************************************************************\/\nstatic PyMethodDef Methods[] = {\n {\"find_max\", find_max, METH_VARARGS,\n \"Find the split of maximum utility.\"},\n {NULL, NULL, 0, NULL}\n};\n\n#if PY_MAJOR_VERSION >= 3\n\nstatic struct PyModuleDef _scm_utility_module = {\n PyModuleDef_HEAD_INIT,\n \"_scm_utility\",\n NULL,\n -1,\n Methods\n};\n\nPyMODINIT_FUNC PyInit__scm_utility() {\n import_array();\n return PyModule_Create(&_scm_utility_module);\n};\n\n#else\n\nPyMODINIT_FUNC\ninit_scm_utility\n (void){\n (void)Py_InitModule(\"_scm_utility\", Methods);\n import_array();\/\/necessary from numpy otherwise we crash with segfault\n}\n\n#endif\n<commit_msg>Deleted useless file<commit_after><|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: brkdlg.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: obo $ $Date: 2004-01-20 10:41:29 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"BreakDlg.hxx\"\n\n#ifndef _SFX_PROGRESS_HXX\n#include <sfx2\/progress.hxx>\n#endif\n\n#include <svx\/svdedtv.hxx>\n#include <svx\/svdetc.hxx>\n#include <sfx2\/app.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"sdattr.hxx\"\n#include \"brkdlg.hrc\"\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#include \"strings.hrc\"\n#ifndef SD_DRAW_DOC_SHELL_HXX\n#include \"DrawDocShell.hxx\"\n#endif\n\nnamespace sd {\n\n\/*************************************************************************\n|*\n|* Dialog zum aufbrechen von Metafiles\n|*\n\\************************************************************************\/\n\nBreakDlg::BreakDlg(\n ::Window* pWindow,\n DrawView* _pDrView,\n DrawDocShell* pShell,\n ULONG nSumActionCount,\n ULONG nObjCount )\n : SfxModalDialog ( pWindow, SdResId( DLG_BREAK ) ),\n aFtObjInfo ( this, SdResId( FT_OBJ_INFO ) ),\n aFtActInfo ( this, SdResId( FT_ACT_INFO ) ),\n aFtInsInfo ( this, SdResId( FT_INS_INFO ) ),\n aFiObjInfo ( this, SdResId( FI_OBJ_INFO ) ),\n aFiActInfo ( this, SdResId( FI_ACT_INFO ) ),\n aFiInsInfo ( this, SdResId( FI_INS_INFO ) ),\n aBtnCancel ( this, SdResId( BTN_CANCEL ) ),\n aLink ( LINK( this, BreakDlg, UpDate)),\n mpProgress ( NULL )\n{\n aBtnCancel.SetClickHdl( LINK( this, BreakDlg, CancelButtonHdl));\n\n mpProgress = new SfxProgress( pShell, String(SdResId(STR_BREAK_METAFILE)), nSumActionCount*3 );\n\n pProgrInfo = new SvdProgressInfo( &aLink );\n \/\/ jede Action wird in DoImport() 3mal bearbeitet\n pProgrInfo->Init( nSumActionCount*3, nObjCount );\n\n pDrView = _pDrView;\n bCancel = FALSE;\n\n FreeResource();\n}\n\nBreakDlg::~BreakDlg()\n{\n if( mpProgress )\n delete mpProgress;\n\n if( pProgrInfo )\n delete pProgrInfo;\n}\n\n\/\/ Control-Handler fuer den Abbruch Button\nIMPL_LINK( BreakDlg, CancelButtonHdl, void *, EMPTYARG )\n{\n bCancel = TRUE;\n aBtnCancel.Disable();\n return( 0L );\n}\n\n\/\/ Die UpDate Methode muss regelmaessig von der Arbeitsfunktion\n\/\/ ausgeuehrt werden.\n\/\/ Beim ersten aufruf wird die gesamtanzahl der actions uebergeben.\n\/\/ Jeder weitere sollte die bearbeiteten actions seit dem letzten aufruf von\n\/\/ UpDate erhalten.\n\nIMPL_LINK( BreakDlg, UpDate, void*, nInit )\n{\n String aEmptyStr;\n\n if(pProgrInfo == NULL)\n return 1L;\n\n \/\/ Statuszeile updaten oder Fehlermeldung?\n if(nInit == (void*)1L)\n {\n ErrorBox aErrBox( this, WB_OK, String( SdResId( STR_BREAK_FAIL ) ) );\n aErrBox.Execute();\n }\n else\n {\n if(mpProgress)\n mpProgress->SetState( pProgrInfo->GetSumCurAction() );\n }\n\n \/\/ Welches Oject wird gerade angezeigt?\n String info = UniString::CreateFromInt32( pProgrInfo->GetCurObj() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetObjCount() ) );\n aFiObjInfo.SetText(info);\n\n \/\/ Wieviele Actions sind schon aufgebrochen?\n if(pProgrInfo->GetActionCount() == 0)\n {\n aFiActInfo.SetText( aEmptyStr );\n }\n else\n {\n info = UniString::CreateFromInt32( pProgrInfo->GetCurAction() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetActionCount() ) );\n aFiActInfo.SetText(info);\n }\n\n \/\/ Und erst eingefuegt????\n if(pProgrInfo->GetInsertCount() == 0)\n {\n aFiInsInfo.SetText( aEmptyStr );\n }\n else\n {\n info = UniString::CreateFromInt32( pProgrInfo->GetCurInsert() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetInsertCount() ) );\n aFiInsInfo.SetText(info);\n }\n\n Application::Reschedule();\n return( bCancel?0L:1L );\n}\n\n\/\/ Oeffnet den Modalen Dialog und startet einen Timer der die Arbeitsfunktion\n\/\/ nach oeffnen des Dialogs ausfuehrt\nshort BreakDlg::Execute()\n{\n aTimer.SetTimeout( 10 );\n aTimer.SetTimeoutHdl( LINK( this, BreakDlg, InitialUpdate ) );\n aTimer.Start();\n\n return SfxModalDialog::Execute();\n}\n\n\/\/ Linkmethode welche die Arbeitsfunktion startet\nIMPL_LINK( BreakDlg, InitialUpdate, Timer*, pTimer )\n{\n pDrView->DoImportMarkedMtf(pProgrInfo);\n EndDialog(TRUE);\n return 0L;\n}\n\n} \/\/ end of namespace sd\n<commit_msg>INTEGRATION: CWS tune03 (1.2.186); FILE MERGED 2004\/08\/08 12:54:00 mhu 1.2.186.1: #i29979# Added SD_DLLPUBLIC\/PRIVATE (see sddllapi.h) to exported symbols\/classes.<commit_after>\/*************************************************************************\n *\n * $RCSfile: brkdlg.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2004-08-23 08:14:11 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifdef SD_DLLIMPLEMENTATION\n#undef SD_DLLIMPLEMENTATION\n#endif\n\n#include \"BreakDlg.hxx\"\n\n#ifndef _SFX_PROGRESS_HXX\n#include <sfx2\/progress.hxx>\n#endif\n\n#include <svx\/svdedtv.hxx>\n#include <svx\/svdetc.hxx>\n#include <sfx2\/app.hxx>\n#include <vcl\/msgbox.hxx>\n\n#include \"sdattr.hxx\"\n#include \"brkdlg.hrc\"\n#include \"sdresid.hxx\"\n#ifndef SD_VIEW_HXX\n#include \"View.hxx\"\n#endif\n#ifndef SD_DRAW_VIEW_HXX\n#include \"drawview.hxx\"\n#endif\n#include \"strings.hrc\"\n#ifndef SD_DRAW_DOC_SHELL_HXX\n#include \"DrawDocShell.hxx\"\n#endif\n\nnamespace sd {\n\n\/*************************************************************************\n|*\n|* Dialog zum aufbrechen von Metafiles\n|*\n\\************************************************************************\/\n\nBreakDlg::BreakDlg(\n ::Window* pWindow,\n DrawView* _pDrView,\n DrawDocShell* pShell,\n ULONG nSumActionCount,\n ULONG nObjCount )\n : SfxModalDialog ( pWindow, SdResId( DLG_BREAK ) ),\n aFtObjInfo ( this, SdResId( FT_OBJ_INFO ) ),\n aFtActInfo ( this, SdResId( FT_ACT_INFO ) ),\n aFtInsInfo ( this, SdResId( FT_INS_INFO ) ),\n aFiObjInfo ( this, SdResId( FI_OBJ_INFO ) ),\n aFiActInfo ( this, SdResId( FI_ACT_INFO ) ),\n aFiInsInfo ( this, SdResId( FI_INS_INFO ) ),\n aBtnCancel ( this, SdResId( BTN_CANCEL ) ),\n aLink ( LINK( this, BreakDlg, UpDate)),\n mpProgress ( NULL )\n{\n aBtnCancel.SetClickHdl( LINK( this, BreakDlg, CancelButtonHdl));\n\n mpProgress = new SfxProgress( pShell, String(SdResId(STR_BREAK_METAFILE)), nSumActionCount*3 );\n\n pProgrInfo = new SvdProgressInfo( &aLink );\n \/\/ jede Action wird in DoImport() 3mal bearbeitet\n pProgrInfo->Init( nSumActionCount*3, nObjCount );\n\n pDrView = _pDrView;\n bCancel = FALSE;\n\n FreeResource();\n}\n\nBreakDlg::~BreakDlg()\n{\n if( mpProgress )\n delete mpProgress;\n\n if( pProgrInfo )\n delete pProgrInfo;\n}\n\n\/\/ Control-Handler fuer den Abbruch Button\nIMPL_LINK( BreakDlg, CancelButtonHdl, void *, EMPTYARG )\n{\n bCancel = TRUE;\n aBtnCancel.Disable();\n return( 0L );\n}\n\n\/\/ Die UpDate Methode muss regelmaessig von der Arbeitsfunktion\n\/\/ ausgeuehrt werden.\n\/\/ Beim ersten aufruf wird die gesamtanzahl der actions uebergeben.\n\/\/ Jeder weitere sollte die bearbeiteten actions seit dem letzten aufruf von\n\/\/ UpDate erhalten.\n\nIMPL_LINK( BreakDlg, UpDate, void*, nInit )\n{\n String aEmptyStr;\n\n if(pProgrInfo == NULL)\n return 1L;\n\n \/\/ Statuszeile updaten oder Fehlermeldung?\n if(nInit == (void*)1L)\n {\n ErrorBox aErrBox( this, WB_OK, String( SdResId( STR_BREAK_FAIL ) ) );\n aErrBox.Execute();\n }\n else\n {\n if(mpProgress)\n mpProgress->SetState( pProgrInfo->GetSumCurAction() );\n }\n\n \/\/ Welches Oject wird gerade angezeigt?\n String info = UniString::CreateFromInt32( pProgrInfo->GetCurObj() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetObjCount() ) );\n aFiObjInfo.SetText(info);\n\n \/\/ Wieviele Actions sind schon aufgebrochen?\n if(pProgrInfo->GetActionCount() == 0)\n {\n aFiActInfo.SetText( aEmptyStr );\n }\n else\n {\n info = UniString::CreateFromInt32( pProgrInfo->GetCurAction() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetActionCount() ) );\n aFiActInfo.SetText(info);\n }\n\n \/\/ Und erst eingefuegt????\n if(pProgrInfo->GetInsertCount() == 0)\n {\n aFiInsInfo.SetText( aEmptyStr );\n }\n else\n {\n info = UniString::CreateFromInt32( pProgrInfo->GetCurInsert() );\n info.Append( sal_Unicode('\/') );\n info.Append( UniString::CreateFromInt32( pProgrInfo->GetInsertCount() ) );\n aFiInsInfo.SetText(info);\n }\n\n Application::Reschedule();\n return( bCancel?0L:1L );\n}\n\n\/\/ Oeffnet den Modalen Dialog und startet einen Timer der die Arbeitsfunktion\n\/\/ nach oeffnen des Dialogs ausfuehrt\nshort BreakDlg::Execute()\n{\n aTimer.SetTimeout( 10 );\n aTimer.SetTimeoutHdl( LINK( this, BreakDlg, InitialUpdate ) );\n aTimer.Start();\n\n return SfxModalDialog::Execute();\n}\n\n\/\/ Linkmethode welche die Arbeitsfunktion startet\nIMPL_LINK( BreakDlg, InitialUpdate, Timer*, pTimer )\n{\n pDrView->DoImportMarkedMtf(pProgrInfo);\n EndDialog(TRUE);\n return 0L;\n}\n\n} \/\/ end of namespace sd\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <nlohmann\/json.hpp>\n#include <depthai-shared\/pb\/common\/optional.hpp>\n\n\nnamespace dai {\n\n \/**\n * Specify NeuralNetwork options such as blob path, ...\n *\/\n struct NeuralNetworkProperties {\n \/**\n * Blob binary size in bytes\n *\/\n tl::optional<int64_t> blobSize;\n \/**\n * Uri which points to blob\n *\/\n std::string blobUri;\n \/**\n * Number of available output tensors in pool\n *\/\n tl::optional<int32_t> numFrames;\n };\n\n NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(NeuralNetworkProperties, blobSize, blobUri, numFrames)\n\n}\n<commit_msg>Updated NN properties<commit_after>#pragma once\n\n#include <nlohmann\/json.hpp>\n#include <depthai-shared\/pb\/common\/optional.hpp>\n\n\nnamespace dai {\n\n \/**\n * Specify NeuralNetwork options such as blob path, ...\n *\/\n struct NeuralNetworkProperties {\n \/**\n * Blob binary size in bytes\n *\/\n tl::optional<uint32_t> blobSize;\n \/**\n * Uri which points to blob\n *\/\n std::string blobUri;\n \/**\n * Number of available output tensors in pool\n *\/\n std::uint32_t numFrames = 8;\n };\n\n NLOHMANN_DEFINE_TYPE_NON_INTRUSIVE(NeuralNetworkProperties, blobSize, blobUri, numFrames)\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>add natural merge sort<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Use std::make_reverse_iterator directly<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"catch.hpp\"\n\n#include \".\/shunting-yard.h\"\n\nTokenMap_t vars, tmap, key3, emap;\n\nvoid PREPARE_ENVIRONMENT() {\n vars[\"pi\"] = 3.14;\n vars[\"b1\"] = 0.0;\n vars[\"b2\"] = 0.86;\n vars[\"str1\"] = \"foo\";\n vars[\"str2\"] = \"bar\";\n vars[\"str3\"] = \"foobar\";\n vars[\"str4\"] = \"foo10\";\n vars[\"str5\"] = \"10bar\";\n\n vars[\"map\"] = &tmap;\n tmap[\"key\"] = \"mapped value\";\n tmap[\"key1\"] = \"second mapped value\";\n tmap[\"key2\"] = 10;\n tmap[\"key3\"] = &key3;\n tmap[\"key3\"][\"map1\"] = \"inception1\";\n tmap[\"key3\"][\"map2\"] = \"inception2\";\n\n emap[\"a\"] = 10;\n emap[\"b\"] = 20;\n}\n\nTEST_CASE(\"Static calculate::calculate()\") {\n REQUIRE(calculator::calculate(\"-pi + 1\", &vars).asDouble() == Approx(-2.14));\n REQUIRE(calculator::calculate(\"-pi + 1 * b1\", &vars).asDouble() == Approx(-3.14));\n REQUIRE(calculator::calculate(\"(20+10)*3\/2-3\", &vars).asDouble() == Approx(42.0));\n REQUIRE(calculator::calculate(\"1 << 4\", &vars).asDouble() == Approx(16.0));\n REQUIRE(calculator::calculate(\"1+(-2*3)\", &vars).asDouble() == Approx(-5));\n}\n\nTEST_CASE(\"calculate::compile() and calculate::eval()\") {\n calculator c1;\n c1.compile(\"-pi+1\", &vars);\n REQUIRE(c1.eval().asDouble() == Approx(-2.14));\n\n calculator c2(\"pi+4\", &vars);\n REQUIRE(c2.eval().asDouble() == Approx(7.14));\n REQUIRE(c2.eval().asDouble() == Approx(7.14));\n\n calculator c3(\"pi+b1+b2\", &vars);\n REQUIRE(c3.eval(&vars).asDouble() == Approx(4.0));\n}\n\nTEST_CASE(\"Boolean expressions\") {\n REQUIRE_FALSE(calculator::calculate(\"3 < 3\").asBool());\n REQUIRE(calculator::calculate(\"3 <= 3\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"3 > 3\").asBool());\n REQUIRE(calculator::calculate(\"3 >= 3\").asBool());\n REQUIRE(calculator::calculate(\"3 == 3\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"3 != 3\").asBool());\n\n REQUIRE(calculator::calculate(\"(3 && true) == true\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"(3 && 0) == true\").asBool());\n REQUIRE(calculator::calculate(\"(3 || 0) == true\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"(false || 0) == true\").asBool());\n}\n\nTEST_CASE(\"String expressions\") {\n REQUIRE(calculator::calculate(\"str1 + str2 == str3\", &vars).asBool());\n REQUIRE_FALSE(calculator::calculate(\"str1 + str2 != str3\", &vars).asBool());\n REQUIRE(calculator::calculate(\"str1 + 10 == str4\", &vars).asBool());\n REQUIRE(calculator::calculate(\"10 + str2 == str5\", &vars).asBool());\n\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\" == str3\", &vars).asBool());\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\" != 'foobar\\\"'\", &vars).asBool());\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\\\\\"\\\" == 'foobar\\\"'\", &vars).asBool());\n}\n\nTEST_CASE(\"Map access expressions\") {\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"]\", &vars).asString() == \"mapped value\");\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"+1]\", &vars).asString() ==\n \"second mapped value\");\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"+2] + 3 == 13\", &vars).asBool() == true);\n REQUIRE(calculator::calculate(\"map.key1\", &vars).asString() == \"second mapped value\");\n\n REQUIRE(calculator::calculate(\"map.key3.map1\", &vars).asString() == \"inception1\");\n REQUIRE(calculator::calculate(\"map.key3['map2']\", &vars).asString() == \"inception2\");\n REQUIRE_THROWS(calculator::calculate(\"map[\\\"no_key\\\"]\", &vars));\n}\n\nTEST_CASE(\"Function usage expressions\") {\n TokenMap_t vars;\n vars[\"pi\"] = 3.141592653589793;\n vars[\"a\"] = -4;\n\n REQUIRE(calculator::calculate(\"sqrt(4)\", &vars).asDouble() == 2);\n REQUIRE(calculator::calculate(\"sin(pi)\", &vars).asDouble() == Approx(0));\n REQUIRE(calculator::calculate(\"cos(pi\/2)\", &vars).asDouble() == Approx(0));\n REQUIRE(calculator::calculate(\"tan(pi)\", &vars).asDouble() == Approx(0));\n calculator c(\"a + sqrt(4) * 2\");\n REQUIRE(c.eval(&vars).asDouble() == 0);\n REQUIRE(calculator::calculate(\"sqrt(4-a*3) * 2\", &vars).asDouble() == 8);\n REQUIRE(calculator::calculate(\"abs(42)\", &vars).asDouble() == 42);\n REQUIRE(calculator::calculate(\"abs(-42)\", &vars).asDouble() == 42);\n\n \/\/ With more than one argument:\n REQUIRE(calculator::calculate(\"pow(2,2)\", &vars).asDouble() == 4);\n REQUIRE(calculator::calculate(\"pow(2,3)\", &vars).asDouble() == 8);\n REQUIRE(calculator::calculate(\"pow(2,a)\", &vars).asDouble() == Approx(1.\/16));\n REQUIRE(calculator::calculate(\"pow(2,a+4)\", &vars).asDouble() == 1);\n\n REQUIRE_THROWS(calculator::calculate(\"foo(10)\"));\n REQUIRE_THROWS(calculator::calculate(\"foo(10),\"));\n REQUIRE_THROWS(calculator::calculate(\"foo,(10)\"));\n\n \/\/ The test bellow will fail, TODO fix it:\n \/\/ REQUIRE_NOTHROW(calculator::calculate(\"print()\"));\n}\n\nTEST_CASE(\"Scope management\") {\n calculator c(\"pi+b1+b2\");\n Scope scope;\n\n \/\/ Add vars to scope:\n scope.push(&vars);\n REQUIRE(c.eval(scope).asDouble() == Approx(4));\n\n tmap[\"b2\"] = 1.0;\n scope.push(&tmap);\n REQUIRE(c.eval(scope).asDouble() == Approx(4.14));\n\n Scope scope_bkp = scope;\n\n \/\/ Remove vars from scope:\n scope.pop();\n scope.pop();\n\n scope.pop(); \/\/ Final pop for default functions.\n\n \/\/ Test what happens when you try to drop more namespaces than possible:\n REQUIRE_THROWS(scope.pop());\n\n \/\/ Load Saved Scope\n scope = scope_bkp;\n REQUIRE(c.eval(scope).asDouble() == Approx(4.14));\n\n \/\/ Testing with 3 namespaces:\n TokenMap_t vmap;\n vmap[\"b1\"] = -1.14;\n scope.push(&vmap);\n REQUIRE(c.eval(scope).asDouble() == Approx(3.0));\n\n scope_bkp = scope;\n calculator c2(\"pi+b1+b2\", scope_bkp);\n REQUIRE(c2.eval().asDouble() == Approx(3.0));\n REQUIRE(calculator::calculate(\"pi+b1+b2\", scope_bkp).asDouble() == Approx(3.0));\n\n scope.clean();\n}\n\nTEST_CASE(\"Resource management\") {\n calculator C1, C2(\"1 + 1\");\n\n \/\/ These are likely to cause seg fault if\n \/\/ RPN copy is not handled:\n\n \/\/ Copy:\n REQUIRE_NOTHROW(calculator C3(C2));\n \/\/ Assignment:\n REQUIRE_NOTHROW(C1 = C2);\n}\n\nTEST_CASE(\"Exception management\") {\n calculator ecalc;\n ecalc.compile(\"a+b+del\", &emap);\n emap[\"del\"] = 30;\n\n REQUIRE_THROWS(ecalc.eval());\n REQUIRE_NOTHROW(ecalc.eval(&emap));\n\n emap.erase(\"del\");\n REQUIRE_THROWS(ecalc.eval(&emap));\n\n emap[\"del\"] = 0;\n emap.erase(\"a\");\n REQUIRE_NOTHROW(ecalc.eval(&emap));\n\n REQUIRE_THROWS(calculator c5(\"10 + - - 10\"));\n REQUIRE_THROWS(calculator c5(\"10 + +\"));\n REQUIRE_NOTHROW(calculator c5(\"10 + -10\"));\n REQUIRE_THROWS(calculator c5(\"c.[10]\"));\n\n TokenMap_t v1, v2;\n v1[\"map\"] = &v2;\n \/\/ Mismatched types, no supported operators.\n REQUIRE_THROWS(calculator(\"map == 0\").eval(&v1));\n}\n<commit_msg>Formatting.<commit_after>#include \"catch.hpp\"\n\n#include \".\/shunting-yard.h\"\n\nTokenMap_t vars, tmap, key3, emap;\n\nvoid PREPARE_ENVIRONMENT() {\n vars[\"pi\"] = 3.14;\n vars[\"b1\"] = 0.0;\n vars[\"b2\"] = 0.86;\n vars[\"str1\"] = \"foo\";\n vars[\"str2\"] = \"bar\";\n vars[\"str3\"] = \"foobar\";\n vars[\"str4\"] = \"foo10\";\n vars[\"str5\"] = \"10bar\";\n\n vars[\"map\"] = &tmap;\n tmap[\"key\"] = \"mapped value\";\n tmap[\"key1\"] = \"second mapped value\";\n tmap[\"key2\"] = 10;\n tmap[\"key3\"] = &key3;\n tmap[\"key3\"][\"map1\"] = \"inception1\";\n tmap[\"key3\"][\"map2\"] = \"inception2\";\n\n emap[\"a\"] = 10;\n emap[\"b\"] = 20;\n}\n\nTEST_CASE(\"Static calculate::calculate()\") {\n REQUIRE(calculator::calculate(\"-pi + 1\", &vars).asDouble() == Approx(-2.14));\n REQUIRE(calculator::calculate(\"-pi + 1 * b1\", &vars).asDouble() == Approx(-3.14));\n REQUIRE(calculator::calculate(\"(20+10)*3\/2-3\", &vars).asDouble() == Approx(42.0));\n REQUIRE(calculator::calculate(\"1 << 4\", &vars).asDouble() == Approx(16.0));\n REQUIRE(calculator::calculate(\"1+(-2*3)\", &vars).asDouble() == Approx(-5));\n}\n\nTEST_CASE(\"calculate::compile() and calculate::eval()\") {\n calculator c1;\n c1.compile(\"-pi+1\", &vars);\n REQUIRE(c1.eval().asDouble() == Approx(-2.14));\n\n calculator c2(\"pi+4\", &vars);\n REQUIRE(c2.eval().asDouble() == Approx(7.14));\n REQUIRE(c2.eval().asDouble() == Approx(7.14));\n\n calculator c3(\"pi+b1+b2\", &vars);\n REQUIRE(c3.eval(&vars).asDouble() == Approx(4.0));\n}\n\nTEST_CASE(\"Boolean expressions\") {\n REQUIRE_FALSE(calculator::calculate(\"3 < 3\").asBool());\n REQUIRE(calculator::calculate(\"3 <= 3\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"3 > 3\").asBool());\n REQUIRE(calculator::calculate(\"3 >= 3\").asBool());\n REQUIRE(calculator::calculate(\"3 == 3\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"3 != 3\").asBool());\n\n REQUIRE(calculator::calculate(\"(3 && true) == true\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"(3 && 0) == true\").asBool());\n REQUIRE(calculator::calculate(\"(3 || 0) == true\").asBool());\n REQUIRE_FALSE(calculator::calculate(\"(false || 0) == true\").asBool());\n}\n\nTEST_CASE(\"String expressions\") {\n REQUIRE(calculator::calculate(\"str1 + str2 == str3\", &vars).asBool());\n REQUIRE_FALSE(calculator::calculate(\"str1 + str2 != str3\", &vars).asBool());\n REQUIRE(calculator::calculate(\"str1 + 10 == str4\", &vars).asBool());\n REQUIRE(calculator::calculate(\"10 + str2 == str5\", &vars).asBool());\n\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\" == str3\", &vars).asBool());\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\" != 'foobar\\\"'\", &vars).asBool());\n REQUIRE(calculator::calculate(\"'foo' + \\\"bar\\\\\\\"\\\" == 'foobar\\\"'\", &vars).asBool());\n}\n\nTEST_CASE(\"Map access expressions\") {\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"]\", &vars).asString() == \"mapped value\");\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"+1]\", &vars).asString() ==\n \"second mapped value\");\n REQUIRE(calculator::calculate(\"map[\\\"key\\\"+2] + 3 == 13\", &vars).asBool() == true);\n REQUIRE(calculator::calculate(\"map.key1\", &vars).asString() == \"second mapped value\");\n\n REQUIRE(calculator::calculate(\"map.key3.map1\", &vars).asString() == \"inception1\");\n REQUIRE(calculator::calculate(\"map.key3['map2']\", &vars).asString() == \"inception2\");\n REQUIRE_THROWS(calculator::calculate(\"map[\\\"no_key\\\"]\", &vars));\n}\n\nTEST_CASE(\"Function usage expressions\") {\n TokenMap_t vars;\n vars[\"pi\"] = 3.141592653589793;\n vars[\"a\"] = -4;\n\n REQUIRE(calculator::calculate(\"sqrt(4)\", &vars).asDouble() == 2);\n REQUIRE(calculator::calculate(\"sin(pi)\", &vars).asDouble() == Approx(0));\n REQUIRE(calculator::calculate(\"cos(pi\/2)\", &vars).asDouble() == Approx(0));\n REQUIRE(calculator::calculate(\"tan(pi)\", &vars).asDouble() == Approx(0));\n calculator c(\"a + sqrt(4) * 2\");\n REQUIRE(c.eval(&vars).asDouble() == 0);\n REQUIRE(calculator::calculate(\"sqrt(4-a*3) * 2\", &vars).asDouble() == 8);\n REQUIRE(calculator::calculate(\"abs(42)\", &vars).asDouble() == 42);\n REQUIRE(calculator::calculate(\"abs(-42)\", &vars).asDouble() == 42);\n\n \/\/ With more than one argument:\n REQUIRE(calculator::calculate(\"pow(2,2)\", &vars).asDouble() == 4);\n REQUIRE(calculator::calculate(\"pow(2,3)\", &vars).asDouble() == 8);\n REQUIRE(calculator::calculate(\"pow(2,a)\", &vars).asDouble() == Approx(1.\/16));\n REQUIRE(calculator::calculate(\"pow(2,a+4)\", &vars).asDouble() == 1);\n\n REQUIRE_THROWS(calculator::calculate(\"foo(10)\"));\n REQUIRE_THROWS(calculator::calculate(\"foo(10),\"));\n REQUIRE_THROWS(calculator::calculate(\"foo,(10)\"));\n\n \/\/ The test bellow will fail, TODO fix it:\n \/\/ REQUIRE_NOTHROW(calculator::calculate(\"print()\"));\n}\n\nTEST_CASE(\"Scope management\") {\n calculator c(\"pi+b1+b2\");\n Scope scope;\n\n \/\/ Add vars to scope:\n scope.push(&vars);\n REQUIRE(c.eval(scope).asDouble() == Approx(4));\n\n tmap[\"b2\"] = 1.0;\n scope.push(&tmap);\n REQUIRE(c.eval(scope).asDouble() == Approx(4.14));\n\n Scope scope_bkp = scope;\n\n \/\/ Remove vars from scope:\n scope.pop();\n scope.pop();\n\n scope.pop(); \/\/ Final pop for default functions.\n\n \/\/ Test what happens when you try to drop more namespaces than possible:\n REQUIRE_THROWS(scope.pop());\n\n \/\/ Load Saved Scope\n scope = scope_bkp;\n REQUIRE(c.eval(scope).asDouble() == Approx(4.14));\n\n \/\/ Testing with 3 namespaces:\n TokenMap_t vmap;\n vmap[\"b1\"] = -1.14;\n scope.push(&vmap);\n REQUIRE(c.eval(scope).asDouble() == Approx(3.0));\n\n scope_bkp = scope;\n calculator c2(\"pi+b1+b2\", scope_bkp);\n REQUIRE(c2.eval().asDouble() == Approx(3.0));\n REQUIRE(calculator::calculate(\"pi+b1+b2\", scope_bkp).asDouble() == Approx(3.0));\n\n scope.clean();\n}\n\nTEST_CASE(\"Resource management\") {\n calculator C1, C2(\"1 + 1\");\n\n \/\/ These are likely to cause seg fault if\n \/\/ RPN copy is not handled:\n\n \/\/ Copy:\n REQUIRE_NOTHROW(calculator C3(C2));\n \/\/ Assignment:\n REQUIRE_NOTHROW(C1 = C2);\n}\n\nTEST_CASE(\"Exception management\") {\n calculator ecalc;\n ecalc.compile(\"a+b+del\", &emap);\n emap[\"del\"] = 30;\n\n REQUIRE_THROWS(ecalc.eval());\n REQUIRE_NOTHROW(ecalc.eval(&emap));\n\n emap.erase(\"del\");\n REQUIRE_THROWS(ecalc.eval(&emap));\n\n emap[\"del\"] = 0;\n emap.erase(\"a\");\n REQUIRE_NOTHROW(ecalc.eval(&emap));\n\n REQUIRE_THROWS(calculator c5(\"10 + - - 10\"));\n REQUIRE_THROWS(calculator c5(\"10 + +\"));\n REQUIRE_NOTHROW(calculator c5(\"10 + -10\"));\n REQUIRE_THROWS(calculator c5(\"c.[10]\"));\n\n TokenMap_t v1, v2;\n v1[\"map\"] = &v2;\n \/\/ Mismatched types, no supported operators.\n REQUIRE_THROWS(calculator(\"map == 0\").eval(&v1));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s | clang-format -style=LLVM -cursor=6 \\\n\/\/ RUN: | FileCheck -strict-whitespace %s\n\/\/ CHECK: {{^\\{ \"Cursor\": 4, }}\n\/\/ CHECK: {{^int\\ \\i;$}}\n int i;\n<commit_msg>Fix clang-format test. I believe that the new behavior is better.<commit_after>\/\/ RUN: grep -Ev \"\/\/ *[A-Z-]+:\" %s | clang-format -style=LLVM -cursor=6 \\\n\/\/ RUN: | FileCheck -strict-whitespace %s\n\/\/ CHECK: {{^\\{ \"Cursor\": 3, }}\n\/\/ CHECK: {{^int\\ \\i;$}}\n int i;\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 1999 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include <iostream>\n\n\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n#include <crtdbg.h>\n#endif\n\n\n\n#include <vector>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XalanTransformer\/XalanTransformer.hpp>\n\n\n\n#include <XMLFileReporter.hpp>\n#include <FileUtility.hpp>\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::endl;\n#endif\n\n\n\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\n\t\nstatic const char* const\texcludeStylesheets[] =\n{\n\/\/\t\"impincl16.xml\",\n\t0\n};\n\n\n\ninline bool\ncheckForExclusion(XalanDOMString currentFile)\n{\n\tfor (int i = 0; excludeStylesheets[i] != 0; ++i)\n\t{\t\n\t\tif (equals(currentFile, XalanDOMString(excludeStylesheets[i])))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\n\nbool\ngetParams(int\t\t\targc, \n\t\t const char*\t\/* argv *\/[])\n{\n\t\/\/ This needs additional work.\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: Stressmem\" << endl;\n\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\treturn true;\n\t}\n}\n\n\n\n#if defined(XALAN_NO_NAMESPACES)\ntypedef vector<XalanDOMString>\t\tFileNameVectorType;\n#else\ntypedef std::vector<XalanDOMString>\tFileNameVectorType;\n#endif\n\n\n\nint\nmain(\n\t int\t\t\targc,\n\t const char*\targv[])\n{\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\tif (getParams(argc, argv) == true)\n\t{\n\t\t\/\/ Defined root for performance directory. Based on PD's machine. \n\t\tconst XalanDOMString\tconfDir(XALAN_STATIC_UCODE_STRING(\"\\\\xsl-test\\\\conf\\\\\"));\n\t\tconst XalanDOMString\toutDir(XALAN_STATIC_UCODE_STRING(\"\\\\xsl-test\\\\cplus-mem\\\\\"));\n\n\t\tFileUtility\t\t\tf;\n\n\t\t\/\/ Get the list of Directories that are below perf\n\t\tconst FileNameVectorType\tdirs = f.getDirectoryNames(confDir);\n\n\t\t\/\/XMLFileReporter\tlogFile(\"cpp.xml\");\n\t\t\/\/logFile.logTestFileInit(\"Memory Testing - Memory leaks detected during ConformanceTests. \");\n\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\n\t\t\tXalanTransformer::initialize();\n\n\t\t\t{\n\t\t\t\tXalanTransformer\t\ttransformEngine;\n\n\t\t\t\tconst XalanDOMString\ttheXSLSuffix(XALAN_STATIC_UCODE_STRING(\".xsl\"));\n\t\t\t\tconst XalanDOMString\ttheXMLSuffix(XALAN_STATIC_UCODE_STRING(\".xml\"));\n\t\t\t\tconst XalanDOMString\tpathSep(XALAN_STATIC_UCODE_STRING(\"\\\\\")); \n\n\t\t\t\tfor(FileNameVectorType::size_type\tj = 0; j < dirs.size(); ++j)\n\t\t\t\t{\n\t\t\t\t\tconst FileNameVectorType\tfiles = f.getTestFileNames(confDir, dirs[j]);\n\n\t\t\t\t\tfor(FileNameVectorType::size_type i = 0; i < files.size(); ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (checkForExclusion(files[i]) == false)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ Output file name to result log.\n\t\t\t\t\t\t\t\/\/logFile.logTestCaseInit(files[i]);\n\t\t\t\t\t\t\tcout << files[i] << endl;\n\n\t\t\t\t\t\t\tconst XalanDOMString\ttheXMLFile= confDir + dirs[j] + pathSep + files[i];\n\t\t\t\t\t\t\tconst XalanDOMString\toutFile = outDir + dirs[j] + pathSep + files[i];\n\t\t\t\t\t\t\tconst XalanDOMString\ttheXSLFile = f.GenerateFileName(theXMLFile,\"xsl\");\n\t\t\t\t\t\t\tconst XalanDOMString\ttheOutputFile = f.GenerateFileName(outFile, \"out\");\n\n\t\t\t\t\t\t\t\/\/ Do a total end to end transform with no pre parsing of either xsl or xml files.\n\t\t\t\t\t\t\tXSLTResultTarget\t\ttheResultTarget(theOutputFile);\n\n\t\t\t\t\t\t\tconst XSLTInputSource\txslInputSource(c_wstr(theXSLFile));\n\t\t\t\t\t\t\tconst XSLTInputSource\txmlInputSource(c_wstr(theXMLFile));\n\n\t\t\t\t\t\t\tint\t\ttheResult =\n\t\t\t\t\t\t\t\ttransformEngine.transform(xmlInputSource, xslInputSource, theResultTarget);\n\n\t\t\t\t\t\t\tif(theResult != 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcerr << \"XalanError: \\n\" << transformEngine.getLastError();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tXalanTransformer::terminate();\n\n\t\t\tXMLPlatformUtils::Terminate();\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\" << endl << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<commit_msg>Updated to work with new FileUtility<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 1999 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include <iostream>\n\n\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n#include <crtdbg.h>\n#endif\n\n\n\n#include <vector>\n\n\n\n#include <util\/PlatformUtils.hpp>\n\n\n\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n\n\n#include <XalanTransformer\/XalanTransformer.hpp>\n\n\n\n#include <XMLFileReporter.hpp>\n#include <FileUtility.hpp>\n\n\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::endl;\n#endif\n\n\n\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\n\n\t\nstatic const char* const\texcludeStylesheets[] =\n{\n\/\/\t\"impincl16.xml\",\n\t0\n};\n\n\n\ninline bool\ncheckForExclusion(XalanDOMString currentFile)\n{\n\tfor (int i = 0; excludeStylesheets[i] != 0; ++i)\n\t{\t\n\t\tif (equals(currentFile, XalanDOMString(excludeStylesheets[i])))\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\n\n\nbool\ngetParams(int\t\t\targc, \n\t\t const char*\t\/* argv *\/[])\n{\n\t\/\/ This needs additional work.\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: Stressmem\" << endl;\n\n\t\treturn false;\n\t}\n\telse\n\t{\n\t\treturn true;\n\t}\n}\n\n\n\n#if defined(XALAN_NO_NAMESPACES)\ntypedef vector<XalanDOMString>\t\tFileNameVectorType;\n#else\ntypedef std::vector<XalanDOMString>\tFileNameVectorType;\n#endif\n\n\n\nint\nmain(\n\t int\t\t\targc,\n\t const char*\targv[])\n{\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\tif (getParams(argc, argv) == true)\n\t{\n\t\t\/\/ Defined root for performance directory. Based on PD's machine. \n\t\tconst XalanDOMString\tconfDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\conf\\\\\"));\n\t\tconst XalanDOMString\toutDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\cplus-mem\\\\\"));\n\n\t\tFileUtility\t\t\tf;\n\n\t\t\/\/ Get the list of Directories that are below perf\n\t\tconst FileNameVectorType\tdirs = f.getDirectoryNames(confDir);\n\n\t\t\/\/XMLFileReporter\tlogFile(\"cpp.xml\");\n\t\t\/\/logFile.logTestFileInit(\"Memory Testing - Memory leaks detected during ConformanceTests. \");\n\n\t\ttry\n\t\t{\n\t\t\t\/\/ Call the static initializers...\n\t\t\tXMLPlatformUtils::Initialize();\n\n\t\t\tXalanTransformer::initialize();\n\n\t\t\t{\n\t\t\t\tXalanTransformer\t\ttransformEngine;\n\n\t\t\t\tconst XalanDOMString\ttheXSLSuffix(XALAN_STATIC_UCODE_STRING(\".xsl\"));\n\t\t\t\tconst XalanDOMString\ttheXMLSuffix(XALAN_STATIC_UCODE_STRING(\".xml\"));\n\t\t\t\tconst XalanDOMString\tpathSep(XALAN_STATIC_UCODE_STRING(\"\\\\\")); \n\n\t\t\t\tfor(FileNameVectorType::size_type\tj = 0; j < dirs.size(); ++j)\n\t\t\t\t{\n\t\t\t\t\tconst FileNameVectorType\tfiles = f.getTestFileNames(confDir, dirs[j]);\n\n\t\t\t\t\tfor(FileNameVectorType::size_type i = 0; i < files.size(); ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (checkForExclusion(files[i]) == false)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ Output file name to result log.\n\t\t\t\t\t\t\t\/\/logFile.logTestCaseInit(files[i]);\n\t\t\t\t\t\t\tcout << files[i] << endl;\n\n\t\t\t\t\t\/\/\t\tconst XalanDOMString\ttheXMLFile= confDir + dirs[j] + pathSep + files[i];\n\t\t\t\t\t\/\/\t\tconst XalanDOMString\toutFile = outDir + dirs[j] + pathSep + files[i];\n\t\t\t\t\t\/\/\t\tconst XalanDOMString\ttheXSLFile = f.GenerateFileName(theXMLFile,\"xsl\");\n\t\t\t\t\t\/\/\t\tconst XalanDOMString\ttheOutputFile = f.GenerateFileName(outFile, \"out\");\n\n\t\t\t\t\t\t\tconst XalanDOMString theXSLFile= confDir + dirs[j] + pathSep + files[i];\n\t\t\t\t\t\t\tconst XalanDOMString theXMLFile = f.GenerateFileName(theXSLFile,\"xml\");\n\t\t\t\t\t\t\tconst XalanDOMString theOutput = outDir + dirs[j] + pathSep + files[i]; \n\t\t\t\t\t\t\tconst XalanDOMString theOutputFile = f.GenerateFileName(theOutput, \"out\");\n\n\t\t\t\t\t\t\t\/\/ Do a total end to end transform with no pre parsing of either xsl or xml files.\n\t\t\t\t\t\t\tXSLTResultTarget\t\ttheResultTarget(theOutputFile);\n\n\t\t\t\t\t\t\tconst XSLTInputSource\txslInputSource(c_wstr(theXSLFile));\n\t\t\t\t\t\t\tconst XSLTInputSource\txmlInputSource(c_wstr(theXMLFile));\n\n\t\t\t\t\t\t\tint\ttheResult =\n\t\t\t\t\t\t\t\ttransformEngine.transform(xmlInputSource, xslInputSource, theResultTarget);\n\n\t\t\t\t\t\t\tif(theResult != 0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcerr << \"XalanError: \\n\" << transformEngine.getLastError();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tXalanTransformer::terminate();\n\n\t\t\tXMLPlatformUtils::Terminate();\n\t\t}\n\t\tcatch(...)\n\t\t{\n\t\t\tcerr << \"Exception caught!!!\" << endl << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 1999 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include <cassert>\n#include <fstream>\n#include <iostream>\n#include <strstream>\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n#include <crtdbg.h>\n#endif\n\n\/\/These came from the debug test.\n#include <cstdio>\n#include <ctime>\n#include <string>\n#include <vector>\n\n#include <util\/PlatformUtils.hpp>\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/XalanFileOutputStream.hpp>\n#include <PlatformSupport\/XalanOutputStreamPrintWriter.hpp>\n\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n\n#include <XalanTransformer\/XalanTransformer.hpp>\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/StylesheetRoot.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInit.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n#include <XMLFileReporter.hpp>\n#include <FileUtility.hpp>\n\n\/\/This is here for the threads.\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <winbase.h>\n#define THREADFUNCTIONRETURN DWORD WINAPI\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::cin;\n\tusing std::endl;\n\tusing std::ifstream;\n\tusing std::ios_base;\n\tusing std::ostrstream;\n\tusing std::string;\n#endif\n\n\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\nconst char* const excludeStylesheets[] =\n{\n\n\t\"attribset15.xml\",\n\t\"entref08.xml\",\n\t\"entref10.xml\",\n\t\"extend01.xml\",\n\t0\n};\n\n\nconst char* const xslStylesheets[] =\n{\n\t\"attribset15.xml\",\n\t\"entref08.xml\",\n\t\"entref10.xml\",\n\t\"extend01.xml\",\n\t0\n\n};\n\ninline bool\ncheckForExclusion(XalanDOMString currentFile)\n{\n\n\t\tfor (int i=0; excludeStylesheets[i] != 0; i++)\n\t\t\t{\tif (equals(currentFile, XalanDOMString(excludeStylesheets[i])))\n\t\t\t\treturn true;\n\t\t\t}\n\t\treturn false;\n}\n\nvoid\noutputMessage(int iter)\n{\n\t\tcout << \"\\n\" << \"Starting Iteration: \" << iter << '\\0';\n}\n\nvoid\ngetParams(int argc, \n\t\t const char*\targv[])\n{\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: ThreadTest\" << endl;\n\t\texit(1);\n\t}\n}\n\n#if defined(XALAN_NO_NAMESPACES)\n\ttypedef vector<XalanDOMString>\t\tFileNameVectorType;\n#else\n\ttypedef std::vector<XalanDOMString>\tFileNameVectorType;\n#endif\n\nint\nmain(\n\t int\t\t\targc,\n\t const char*\targv[])\n{\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\t\/\/ Defined root for performance directory. Based on PD's machine. \n\tconst XalanDOMString\tconfDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\conf\\\\\"));\n\tconst XalanDOMString\toutDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\cplus-mem\\\\\"));\n\n\tFileUtility f;\n\tFileNameVectorType dirs, files;\n\n\t\/\/ Get the list of Directories that are below perf\n\tdirs = f.getDirectoryNames(confDir);\n\n\tXMLFileReporter\tlogFile(\"cpp.xml\");\n\tlogFile.logTestFileInit(\"Memory Testing - Memory leaks detected during ConformanceTests. \");\n\n\tgetParams(argc, argv);\n\n\ttry\n\t{\n\t\t\/\/ Call the static initializers...\n\t\t\/\/XMLPlatformUtils::Initialize();\n\t\tXalanTransformer::initialize();\n\n\t\t{\n\t\t\t\/\/XSLTInit\ttheInit;\n\t\t\tXalanTransformer transformEngine;\n\t\t\tconst XalanDOMString theXSLSuffix(\".xsl\");\n\t\t\tconst XalanDOMString theXMLSuffix(\".xml\");\n\t\t\tconst XalanDOMString pathSep(XALAN_STATIC_UCODE_STRING(\"\\\\\")); \n\/\/\t\t\tconst XalanDOMString outputSuffix(\".out\");\n\n\t\t\tfor(FileNameVectorType::size_type\tj = 0; j < dirs.size(); j++)\n\t\t\t{\n\t\t\t files = f.getTestFileNames(confDir, dirs[j]);\n\t\t\t for(FileNameVectorType::size_type i = 0; i < files.size(); i++)\n\t\t\t { \/*\n\t\t\t\tif (skip)\n\t\t\t\t{\n\t\t\t\t\tif (checkForExclusion(files[i]))\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t} *\/\n\t\t\t\t\/\/ Output file name to result log.\n\t\t\t\t\/\/logFile.logTestCaseInit(files[i]);\n\t\t\t cout << files[i] << endl;\n\n\t\t\t\tconst XalanDOMString theXMLFile= confDir + dirs[j] + pathSep + files[i];\n\t\t\t\tconst XalanDOMString outFile = outDir + dirs[j] + pathSep + files[i];\n\t\t\t\tconst XalanDOMString theXSLFile = f.GenerateFileName(theXMLFile,\"xsl\");\n\t\t\t\tconst XalanDOMString theOutputFile = f.GenerateFileName(outFile, \"out\");\n\n\t\t\t\t\/\/ Do a total end to end transform with no pre parsing of either xsl or xml files.\n\t\t\t\tXSLTResultTarget\t\ttheResultTarget(theOutputFile);\n\t\t\t\tconst XSLTInputSource\txslInputSource(c_wstr(theXSLFile));\n\t\t\t\tconst XSLTInputSource\txmlInputSource(c_wstr(theXMLFile));\n\t\t\t\tint theResult = 0;\n\t\t\t\t\/*\n\t\t\t\tconst etoetran = eTOeTransform(xmlInputSource, \n\t\t\t\t\t\t\t\t\t\t\t\txslInputSource,\n\t\t\t\t\t\t\t\t\t\t\t\ttheResultTarget,\n\t\t\t\t\t\t\t\t\t\t\t\tcsConstructionContext,\n\t\t\t\t\t\t\t\t\t\t\t\tpsExecutionContext,\n\t\t\t\t\t\t\t\t\t\t\t\tcsProcessor); *\/\n\t\t\t theResult = transformEngine.transform(xmlInputSource, xslInputSource, theResultTarget);\n\t\t\t }\n\t\t\t}\n\t\t}\n\t\tXalanTransformer::terminate();\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\" << endl << endl;\n\t}\n\n\nreturn 0;\n}\n<commit_msg>Added XMLPlatformUtils::Terminate; always look for exclusions and commented out writing to ReportLog. ReportLogging will be added later.<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n *\n * Copyright (c) 1999 The Apache Software Foundation. All rights \n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer. \n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment: \n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xalan\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written \n * permission, please contact apache@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation and was\n * originally based on software copyright (c) 1999, International\n * Business Machines, Inc., http:\/\/www.ibm.com. For more\n * information on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n#include <cassert>\n#include <fstream>\n#include <iostream>\n#include <strstream>\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n#include <crtdbg.h>\n#endif\n\n\/\/These came from the debug test.\n#include <cstdio>\n#include <ctime>\n#include <string>\n#include <vector>\n\n#include <util\/PlatformUtils.hpp>\n\n#include <PlatformSupport\/DOMStringHelper.hpp>\n#include <PlatformSupport\/XalanFileOutputStream.hpp>\n#include <PlatformSupport\/XalanOutputStreamPrintWriter.hpp>\n\n#include <XalanSourceTree\/XalanSourceTreeDOMSupport.hpp>\n#include <XalanSourceTree\/XalanSourceTreeParserLiaison.hpp>\n\n#include <XalanTransformer\/XalanTransformer.hpp>\n\n#include <XPath\/XObjectFactoryDefault.hpp>\n#include <XPath\/XPathFactoryDefault.hpp>\n\n#include <XSLT\/StylesheetConstructionContextDefault.hpp>\n#include <XSLT\/StylesheetExecutionContextDefault.hpp>\n#include <XSLT\/StylesheetRoot.hpp>\n#include <XSLT\/XSLTEngineImpl.hpp>\n#include <XSLT\/XSLTInit.hpp>\n#include <XSLT\/XSLTInputSource.hpp>\n#include <XSLT\/XSLTProcessorEnvSupportDefault.hpp>\n#include <XSLT\/XSLTResultTarget.hpp>\n\n#include <XMLFileReporter.hpp>\n#include <FileUtility.hpp>\n\n\/\/This is here for the threads.\n#define WIN32_LEAN_AND_MEAN\n#include <windows.h>\n#include <winbase.h>\n#define THREADFUNCTIONRETURN DWORD WINAPI\n\n#if !defined(XALAN_NO_NAMESPACES)\n\tusing std::cerr;\n\tusing std::cout;\n\tusing std::cin;\n\tusing std::endl;\n\tusing std::ifstream;\n\tusing std::ios_base;\n\tusing std::ostrstream;\n\tusing std::string;\n#endif\n\n\n\/\/ This is here for memory leak testing.\n#if defined(_DEBUG)\n#include <crtdbg.h>\n#endif\n\nconst char* const excludeStylesheets[] =\n{\n\/\/\t\"impincl16.xml\",\n\t0\n};\n\n\n\ninline bool\ncheckForExclusion(XalanDOMString currentFile)\n{\n\n\t\tfor (int i=0; excludeStylesheets[i] != 0; i++)\n\t\t\t{\t\n\t\t\t\tif (equals(currentFile, XalanDOMString(excludeStylesheets[i])))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\treturn false;\n}\n\nvoid\ngetParams(int argc, \n\t\t const char*\targv[])\n{\n\t\/\/ This needs additional work.\n\tif (argc != 1)\n\t{\n\t\tcerr << \"Usage: ThreadTest\" << endl;\n\t\texit(1);\n\t}\n}\n\n#if defined(XALAN_NO_NAMESPACES)\n\ttypedef vector<XalanDOMString>\t\tFileNameVectorType;\n#else\n\ttypedef std::vector<XalanDOMString>\tFileNameVectorType;\n#endif\n\nint\nmain(\n\t int\t\t\targc,\n\t const char*\targv[])\n{\n\n#if !defined(NDEBUG) && defined(_MSC_VER)\n\t_CrtSetDbgFlag(_CrtSetDbgFlag(_CRTDBG_REPORT_FLAG) | _CRTDBG_LEAK_CHECK_DF);\n\n\t_CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);\n\t_CrtSetReportFile(_CRT_WARN, _CRTDBG_FILE_STDERR);\n#endif\n\n\t\/\/ Defined root for performance directory. Based on PD's machine. \n\tconst XalanDOMString\tconfDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\conf\\\\\"));\n\tconst XalanDOMString\toutDir(XALAN_STATIC_UCODE_STRING(\"d:\\\\xslt\\\\xsl-test\\\\cplus-mem\\\\\"));\n\n\tFileUtility f;\n\tFileNameVectorType dirs, files;\n\n\t\/\/ Get the list of Directories that are below perf\n\tdirs = f.getDirectoryNames(confDir);\n\n\t\/\/XMLFileReporter\tlogFile(\"cpp.xml\");\n\t\/\/logFile.logTestFileInit(\"Memory Testing - Memory leaks detected during ConformanceTests. \");\n\n\tgetParams(argc, argv);\n\n\ttry\n\t{\n\t\t\/\/ Call the static initializers...\n\t\tXMLPlatformUtils::Initialize();\n\t\tXalanTransformer::initialize();\n\t\tXalanTransformer transformEngine;\n\t\t{\n\t\t\tconst XalanDOMString theXSLSuffix(\".xsl\");\n\t\t\tconst XalanDOMString theXMLSuffix(\".xml\");\n\t\t\tconst XalanDOMString pathSep(XALAN_STATIC_UCODE_STRING(\"\\\\\")); \n\n\t\t\tfor(FileNameVectorType::size_type\tj = 0; j < dirs.size(); j++)\n\t\t\t{\n\t\t\t files = f.getTestFileNames(confDir, dirs[j]);\n\t\t\t for(FileNameVectorType::size_type i = 0; i < files.size(); i++)\n\t\t\t { \n\t\t\t\tif (checkForExclusion(files[i]))\n\t\t\t\t\t{\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\/\/ Output file name to result log.\n\t\t\t\t\/\/logFile.logTestCaseInit(files[i]);\n\t\t\t cout << files[i] << endl;\n\n\t\t\t\tconst XalanDOMString theXMLFile= confDir + dirs[j] + pathSep + files[i];\n\t\t\t\tconst XalanDOMString outFile = outDir + dirs[j] + pathSep + files[i];\n\t\t\t\tconst XalanDOMString theXSLFile = f.GenerateFileName(theXMLFile,\"xsl\");\n\t\t\t\tconst XalanDOMString theOutputFile = f.GenerateFileName(outFile, \"out\");\n\n\t\t\t\t\/\/ Do a total end to end transform with no pre parsing of either xsl or xml files.\n\t\t\t\tXSLTResultTarget\t\ttheResultTarget(theOutputFile);\n\t\t\t\tconst XSLTInputSource\txslInputSource(c_wstr(theXSLFile));\n\t\t\t\tconst XSLTInputSource\txmlInputSource(c_wstr(theXMLFile));\n\t\t\t\tint theResult = 0;\n\n\t\t\t theResult = transformEngine.transform(xmlInputSource, xslInputSource, theResultTarget);\n\t\t\t\tif(theResult != 0)\n\t\t\t\t{\n\t\t\t\t\tcerr << \"XalanError: \\n\" << transformEngine.getLastError();\n\t\t\t\t\t\/\/exit (1);\n\t\t\t\t}\n\n\t\t\t }\n\t\t\t}\n\t\t}\n\t\tXalanTransformer::terminate();\n\t\tXMLPlatformUtils::Terminate();\n\t}\n\tcatch(...)\n\t{\n\t\tcerr << \"Exception caught!!!\" << endl << endl;\n\t}\n\n\nreturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include \"test.hpp\"\n\n#include <vector>\n\n\/\/TODO The tests are a bit poor\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/max2\/1\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 4, 4> a;\n a(0) = aa;\n a(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2> b(etl::max_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 1, 1), 16.0);\n}\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/max2\/2\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 2, 4, 4> a;\n a(0)(0) = aa;\n a(0)(1) = aa;\n a(1)(0) = aa;\n a(1)(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2, 2> b(etl::max_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(0, 1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 1, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 1, 1, 1), 16.0);\n}\n<commit_msg>New tests<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2016 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#include \"test.hpp\"\n\n#include <vector>\n\n\/\/TODO The tests are a bit poor\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/max2\/1\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 4, 4> a;\n a(0) = aa;\n a(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2> b(etl::max_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 1, 1), 16.0);\n}\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/max2\/2\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 2, 4, 4> a;\n a(0)(0) = aa;\n a(0)(1) = aa;\n a(1)(0) = aa;\n a(1)(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2, 2> b(etl::max_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(0, 1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(0, 1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(0, 1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(0, 1, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 0, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 0, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 0, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 0, 1, 1), 16.0);\n\n REQUIRE_EQUALS(b(1, 1, 0, 0), 6.0);\n REQUIRE_EQUALS(b(1, 1, 0, 1), 8.0);\n REQUIRE_EQUALS(b(1, 1, 1, 0), 14.0);\n REQUIRE_EQUALS(b(1, 1, 1, 1), 16.0);\n}\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/avg2\/1\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 4, 4> a;\n a(0) = aa;\n a(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2> b(etl::avg_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0), 3.5);\n REQUIRE_EQUALS(b(0, 0, 1), 5.5);\n REQUIRE_EQUALS(b(0, 1, 0), 11.5);\n REQUIRE_EQUALS(b(0, 1, 1), 13.5);\n\n REQUIRE_EQUALS(b(1, 0, 0), 3.5);\n REQUIRE_EQUALS(b(1, 0, 1), 5.5);\n REQUIRE_EQUALS(b(1, 1, 0), 11.5);\n REQUIRE_EQUALS(b(1, 1, 1), 13.5);\n}\n\nTEMPLATE_TEST_CASE_2(\"pooling\/deep\/avg2\/2\", \"[pooling]\", Z, float, double) {\n etl::fast_matrix<Z, 4, 4> aa({1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0});\n etl::fast_matrix<Z, 2, 2, 4, 4> a;\n a(0)(0) = aa;\n a(0)(1) = aa;\n a(1)(0) = aa;\n a(1)(1) = aa;\n\n etl::fast_matrix<Z, 2, 2, 2, 2> b(etl::avg_pool_2d<2, 2>(a));\n\n REQUIRE_EQUALS(b(0, 0, 0, 0), 3.5);\n REQUIRE_EQUALS(b(0, 0, 0, 1), 5.5);\n REQUIRE_EQUALS(b(0, 0, 1, 0), 11.5);\n REQUIRE_EQUALS(b(0, 0, 1, 1), 13.5);\n\n REQUIRE_EQUALS(b(0, 1, 0, 0), 3.5);\n REQUIRE_EQUALS(b(0, 1, 0, 1), 5.5);\n REQUIRE_EQUALS(b(0, 1, 1, 0), 11.5);\n REQUIRE_EQUALS(b(0, 1, 1, 1), 13.5);\n\n REQUIRE_EQUALS(b(1, 0, 0, 0), 3.5);\n REQUIRE_EQUALS(b(1, 0, 0, 1), 5.5);\n REQUIRE_EQUALS(b(1, 0, 1, 0), 11.5);\n REQUIRE_EQUALS(b(1, 0, 1, 1), 13.5);\n\n REQUIRE_EQUALS(b(1, 1, 0, 0), 3.5);\n REQUIRE_EQUALS(b(1, 1, 0, 1), 5.5);\n REQUIRE_EQUALS(b(1, 1, 1, 0), 11.5);\n REQUIRE_EQUALS(b(1, 1, 1, 1), 13.5);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"t-unit.h\"\n#include <routing\/routingtemplate.h>\n\nFIXTURE(RoutingTests) {\n\tTEST(MatchesNonTemplatedRoute) {\n\t\tApiMock::RoutingTemplate sut(\"\/first\/second\");\n\t\tassert.is_true(sut.isMatch(\"\/first\/second\"));\n\t}\n}<commit_msg>Test templated routes<commit_after>#include \"t-unit.h\"\n#include <routing\/routingtemplate.h>\n\nFIXTURE(RoutingTests) {\n\tTEST(MatchesNonTemplatedRoute) {\n\t\tApiMock::RoutingTemplate sut(\"\/first\/second\");\n\t\tassert.is_true(sut.isMatch(\"\/first\/second\"));\n\t}\n\n\tTEST(MatchesTemplatedRoute) {\n\t\tApiMock::RoutingTemplate sut(\"\/first\/{second}\/third\");\n\t\tassert.is_true(sut.isMatch(\"\/first\/banana\/third\"));\n\t}\n}<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_MODULE sync_access_test\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/thread.hpp>\n#include <boost\/thread\/barrier.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/ref.hpp>\n\n\nusing namespace boost;\nnamespace ut = boost::unit_test;\n\nstatic boost::mutex m;\n\n\/\/\/ thread execution function\nstatic void thread_function(boost::barrier& b)\n{\n b.wait(); \/\/\/ wait until memory barrier allows the execution\n boost::mutex::scoped_lock lock(m); \/\/\/ lock mutex\n BOOST_CHECK_EQUAL(1,0); \/\/\/ produce the fault\n}\n\nBOOST_AUTO_TEST_CASE_EXPECTED_FAILURES( test_multiple_assertion_faults, 100 );\n\n\/\/\/ test function which creates threads\nBOOST_AUTO_TEST_CASE( test_multiple_assertion_faults )\n{\n boost::thread_group tg; \/\/ thread group to manage all threads\n boost::barrier b(100); \/\/ memory barrier, which should block all threads\n \/\/ until all 100 threads were created\n\n for(size_t i=0; i<100; ++i)\n tg.create_thread(boost::bind(thread_function, ref(b))); \/\/\/ create a thread and pass it the barrier\n\n tg.join_all();\n}\n\n\/\/ EOF\n<commit_msg>extra ; removed<commit_after>#define BOOST_TEST_MODULE sync_access_test\n#include <boost\/test\/unit_test.hpp>\n\n#include <boost\/thread.hpp>\n#include <boost\/thread\/barrier.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/ref.hpp>\n\n\nusing namespace boost;\nnamespace ut = boost::unit_test;\n\nstatic boost::mutex m;\n\n\/\/\/ thread execution function\nstatic void thread_function(boost::barrier& b)\n{\n b.wait(); \/\/\/ wait until memory barrier allows the execution\n boost::mutex::scoped_lock lock(m); \/\/\/ lock mutex\n BOOST_CHECK_EQUAL(1,0); \/\/\/ produce the fault\n}\n\nBOOST_AUTO_TEST_CASE_EXPECTED_FAILURES( test_multiple_assertion_faults, 100 )\n\n\/\/\/ test function which creates threads\nBOOST_AUTO_TEST_CASE( test_multiple_assertion_faults )\n{\n boost::thread_group tg; \/\/ thread group to manage all threads\n boost::barrier b(100); \/\/ memory barrier, which should block all threads\n \/\/ until all 100 threads were created\n\n for(size_t i=0; i<100; ++i)\n tg.create_thread(boost::bind(thread_function, ref(b))); \/\/\/ create a thread and pass it the barrier\n\n tg.join_all();\n}\n\n\/\/ EOF\n<|endoftext|>"} {"text":"<commit_before>#include \"sani\/platform\/window.hpp\"\n#include \"sani\/assert.hpp\"\n\n#if SANI_TARGET_PLATFORM == SANI_PLATFORM_WIN32\n\nnamespace sani {\n\tnamespace graphics {\n\t\t\n\t\t\/*\n\t\t *\t\tSome functions always require that the window is in initialized state.\n\t\t *\t Should this be fixed?\n\t\t *\/\n\n\t\tclass Window::Impl {\n\t\tpublic:\n\t\t\t\/\/ Simple flag to keep track about the \n\t\t\t\/\/ state of the window.\n\t\t\tbool initialized;\n\t\t\tbool isWindowOpen;\n\t\t\tbool isMinimized;\n\n\t\t\t\/\/ Just store basic and long strings\n\t\t\t\/\/ to their own fields.\n\t\t\t\n\t\t\tLPCWSTR title;\n\t\t\tString cTitle;\n\t\t\t\n\t\t\tint32 width;\n\t\t\tint32 height;\n\t\t\tint32 x;\n\t\t\tint32 y;\n\n\t\t\tHINSTANCE hInstance;\n\t\t\tHWND hWnd;\n\n\t\t\tImpl() : initialized(false),\n\t\t\t\t\t isWindowOpen(false),\n\t\t\t\t\t isMinimized(false),\n\t\t\t\t\t title(L\"Win32Window\"),\n\t\t\t\t\t cTitle(\"Win32Window\"),\n\t\t\t\t\t x(300),\n\t\t\t\t\t y(300) {\n\t\t\t}\n\n\t\t\t~Impl() {\n\t\t\t}\n\t\t};\n\n\t\tWindow::Window(const HINSTANCE hInstance, const uint32 width, const uint32 height) : impl(new Impl()) {\n\t\t\timpl->hInstance = hInstance;\n\t\t\timpl->width = width;\n\t\t\timpl->height = height;\n\t\t}\n\n\t\t\/\/ Private.\n\n\t\tLRESULT CALLBACK Window::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n\t\t\tWindow* window;\n\n\t\t\t\/\/ Sent prior to the WM_CREATE message when a window is first created.\n\t\t\tif (message == WM_NCCREATE) {\n\t\t\t\t\/\/ Get instance pointer.\n\t\t\t\twindow = static_cast<Window*>(reinterpret_cast<CREATESTRUCT*>(lParam)->lpCreateParams);\n\n\t\t\t\t\/\/ Just set last error to 0.\n\t\t\t\tSetLastError(0);\n\n\t\t\t\t\/\/ Try to set the window long ptr.\n\t\t\t\tif (!SetWindowLongPtr(hWnd, GWL_USERDATA, reinterpret_cast<LONG_PTR>(window))) {\n\t\t\t\t\tif (GetLastError() != 0) return FALSE;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\twindow = reinterpret_cast<Window*>(GetWindowLongPtr(hWnd, GWL_USERDATA));\n\t\t\t}\n\n\t\t\t\/\/ TODO: use window if needed.\n\n\t\t\tswitch (message) {\n\t\t\t\t\/\/ Close the application.\n\t\t\t\tcase WM_DESTROY:\n\t\t\t\t\tPostQuitMessage(0);\n\t\t\t\t\tDestroyWindow(hWnd);\n\n\t\t\t\t\treturn 0;\n\t\t\t\tcase WM_CREATE:\n\t\t\t\t{\n\t\t\t\t\t\/\/ Initialize for OpenGL, set pixel format.\n\t\t\t\t\t\/\/ TODO: select between OpenGL and DX.\n\t\t\t\t\tPIXELFORMATDESCRIPTOR pfd =\n\t\t\t\t\t{\n\t\t\t\t\t\tsizeof(PIXELFORMATDESCRIPTOR),\n\t\t\t\t\t\t1,\n\t\t\t\t\t\tPFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER,\t\t\/\/ Flags.\n\t\t\t\t\t\tPFD_TYPE_RGBA,\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ The kind of framebuffer. RGBA for palette.\n\t\t\t\t\t\t32,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Colordepth of the framebuffer.\n\t\t\t\t\t\t0, 0, 0, 0, 0, 0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0, 0, 0, 0,\n\t\t\t\t\t\t24,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of bits for the depth buffer.\n\t\t\t\t\t\t8,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of bits for the stencil buffer.\n\t\t\t\t\t\t0,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of Aux buffers in the framebuffer.\n\t\t\t\t\t\tPFD_MAIN_PLANE,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0, 0, 0\n\t\t\t\t\t};\n\n\t\t\t\t\t\/\/ Handle to device.\n\t\t\t\t\tHDC hDC = GetDC(hWnd);\n\n\t\t\t\t\t\/\/ Set pixel format.\n\t\t\t\t\tint pixelFormatID = ChoosePixelFormat(hDC, &pfd);\n\t\t\t\t\tSetPixelFormat(hDC, pixelFormatID, &pfd);\n\n\t\t\t\t\tWIN32_ASSERT();\n\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\tcase WM_SIZE:\n\t\t\t\t\t\/\/ Get new size of the window.\n\t\t\t\t\tRECT wndRect;\n\n\t\t\t\t\tGetWindowRect(window->impl->hWnd, &wndRect);\n\n\t\t\t\t\twindow->impl->width = wndRect.right - wndRect.left;\n\t\t\t\t\twindow->impl->height = wndRect.bottom - wndRect.top;\n\n\t\t\t\t\treturn 0;\n\t\t\t\tcase WM_MOVE:\n\t\t\t\t\tGetWindowRect(window->impl->hWnd, &wndRect);\n\n\t\t\t\t\twindow->impl->x = wndRect.left;\n\t\t\t\t\twindow->impl->y = wndRect.top;\n\n\t\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ Handle any messages the switch statement didn't.\n\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\n\t\t}\n\n\t\t\/\/ Public.\n\n\t\tHWND Window::getHandle() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\treturn impl->hWnd;\n\t\t}\n\n\t\tString Window::getTitle() const {\n\t\t\treturn impl->cTitle;\n\t\t}\n\t\tvoid Window::setTitle(const String& title) {\n\t\t\tconst std::wstring stemp = std::wstring(title.begin(), title.end());\n\n\t\t\timpl->title = stemp.c_str();\n\t\t\timpl->cTitle = title;\n\n\t\t\tif (impl->initialized) {\n\t\t\t\tSetWindowText(impl->hWnd, impl->title);\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::minimize() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (impl->isMinimized) return;\n\n\t\t\tShowWindow(impl->hWnd, SW_MINIMIZE);\n\t\t\t\n\t\t\timpl->isMinimized = true;\n\t\t}\n\t\tvoid Window::show() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (impl->isMinimized) {\n\t\t\t\tShowWindow(impl->hWnd, SW_RESTORE);\n\n\t\t\t\timpl->isMinimized = false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tShowWindow(impl->hWnd, SW_SHOW);\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::setSize(const int32 width, const int32 height) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, width, height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->width = width;\n\t\t\t\timpl->height = height;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setWidth(const int32 width) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->width = width;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setHeight(const int32 height) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, impl->width, height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->height = height;\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::setPosition(const int32 x, const int32 y) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, y, x, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->x = x;\n\t\t\t\timpl->y = y;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setX(const int32 x) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, x, impl->y, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->x = x;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setY(const int32 y) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, y, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->y = y;\n\t\t\t}\n\t\t}\n\n\t\tint32 Window::getX() const {\n\t\t\treturn impl->x;\n\t\t}\n\t\tint32 Window::getY() const {\n\t\t\treturn impl->y;\n\t\t}\n\n\t\tuint32 Window::getClientWidth() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tRECT clntRect;\n\n\t\t\tGetClientRect(impl->hWnd, &clntRect);\n\n\t\t\treturn clntRect.right- clntRect.left;\n\t\t}\n\t\tuint32 Window::getClientHeight() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tRECT clntRect;\n\n\t\t\tGetClientRect(impl->hWnd, &clntRect);\n\n\t\t\treturn clntRect.bottom - clntRect.top;\n\t\t}\n\n\t\tinline int32 Window::getWidth() {\n\t\t\treturn impl->width;\n\t\t}\n\t\tinline int32 Window::getHeight() {\n\t\t\treturn impl->height;\n\t\t}\n\n\t\tvoid Window::listen() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tMSG msg;\n\n\t\t\tif (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE)) {\n\t\t\t\t\/\/ translate keystroke messages into the right format\n\t\t\t\tTranslateMessage(&msg);\n\n\t\t\t\t\/\/ send the message to the WindowProc function\n\t\t\t\tDispatchMessage(&msg);\n\n\t\t\t\timpl->isWindowOpen = msg.message != WM_QUIT;\n\t\t\t}\n\t\t}\n\n\t\tbool Window::isOpen() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\treturn impl->isWindowOpen;\n\t\t}\n\n\t\tvoid Window::close() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (!impl->isWindowOpen) return;\n\n\t\t\timpl->isWindowOpen = false;\n\t\t}\n\n\t\tbool Window::initialize() {\n\t\t\tassert(!impl->initialized);\n\n\t\t\t\/\/ Initialize the window.\n\t\t\tWNDCLASSEX windowClass;\n\n\t\t\tconst size_t wndSize = sizeof(WNDCLASSEX);\n\t\t\t\n\t\t\tZeroMemory(&windowClass, wndSize);\n\t\t\tWIN32_ASSERT();\n\n\t\t\t\/\/ Fill the struct.\n\t\t\twindowClass.cbSize = wndSize;\n\t\t\twindowClass.style = CS_HREDRAW | CS_VREDRAW;\n\t\t\twindowClass.lpfnWndProc = WndProc;\n\t\t\twindowClass.hInstance = impl->hInstance;\n\t\t\twindowClass.hCursor = LoadCursor(NULL, IDC_ARROW);\n\t\t\twindowClass.lpszClassName = L\"WindowClass1\";\n\n\t\t\tRegisterClassEx(&windowClass);\n\t\t\tWIN32_ASSERT();\n\n\t\t\t\/\/ TODO: set style to WS_OVERLAPPEDWINDOW for WinDX and \n\t\t\t\/\/\t\t CS_OWNDC for OpenGL. Create rendering API detection.\n\n\t\t\t\/\/ TODO: open the window to the center of the display.\n\t\t\t\/\/ Create the window.\n\t\t\timpl->hWnd = CreateWindowEx(NULL,\n\t\t\t\t\t\t\t\t\t\twindowClass.lpszClassName,\n\t\t\t\t\t\t\t\t\t\timpl->title,\n\t\t\t\t\t\t\t\t\t\tWS_OVERLAPPEDWINDOW,\n\t\t\t\t\t\t\t\t\t\timpl->x,\n\t\t\t\t\t\t\t\t\t\timpl->y,\n\t\t\t\t\t\t\t\t\t\timpl->width,\n\t\t\t\t\t\t\t\t\t\timpl->height,\n\t\t\t\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\t\t\t\timpl->hInstance,\n\t\t\t\t\t\t\t\t\t\tthis);\n\n\t\t\tWIN32_REQUIRE(impl->hWnd, L\"failed to create window\");\n\n\t\t\t\/\/ Set background to black.\n\t\t\tconst HBRUSH brush = CreateSolidBrush(RGB(0, 0, 0));\n\t\t\tSetClassLongPtr(impl->hWnd, GCLP_HBRBACKGROUND, (LONG)brush);\n\n\t\t\timpl->initialized = true;\n\t\t\timpl->isWindowOpen = true;\n\n\t\t\t\/\/ Return results.\n\t\t\treturn impl->initialized;\n\t\t}\n\n\t\tWindow::~Window() {\n\t\t\tdelete impl;\n\t\t}\n\t}\n}\n\n#endif<commit_msg>did some research about the window moving and resizing<commit_after>#include \"sani\/platform\/window.hpp\"\n#include \"sani\/assert.hpp\"\n\n#if SANI_TARGET_PLATFORM == SANI_PLATFORM_WIN32\n\nnamespace sani {\n\tnamespace graphics {\n\t\t\n\t\t\/*\n\t\t *\t\tSome functions always require that the window is in initialized state.\n\t\t *\t Should this be fixed?\n\t\t *\/\n\n\t\tclass Window::Impl {\n\t\tpublic:\n\t\t\t\/\/ Simple flag to keep track about the \n\t\t\t\/\/ state of the window.\n\t\t\tbool initialized;\n\t\t\tbool isWindowOpen;\n\t\t\tbool isMinimized;\n\n\t\t\t\/\/ Just store basic and long strings\n\t\t\t\/\/ to their own fields.\n\t\t\t\n\t\t\tLPCWSTR title;\n\t\t\tString cTitle;\n\t\t\t\n\t\t\tint32 width;\n\t\t\tint32 height;\n\t\t\tint32 x;\n\t\t\tint32 y;\n\n\t\t\tHINSTANCE hInstance;\n\t\t\tHWND hWnd;\n\n\t\t\tImpl() : initialized(false),\n\t\t\t\t\t isWindowOpen(false),\n\t\t\t\t\t isMinimized(false),\n\t\t\t\t\t title(L\"Win32Window\"),\n\t\t\t\t\t cTitle(\"Win32Window\"),\n\t\t\t\t\t x(300),\n\t\t\t\t\t y(300) {\n\t\t\t}\n\n\t\t\t~Impl() {\n\t\t\t}\n\t\t};\n\n\t\tWindow::Window(const HINSTANCE hInstance, const uint32 width, const uint32 height) : impl(new Impl()) {\n\t\t\timpl->hInstance = hInstance;\n\t\t\timpl->width = width;\n\t\t\timpl->height = height;\n\t\t}\n\n\t\t\/\/ Private.\n\n\t\tLRESULT CALLBACK Window::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n\t\t\t\/*\n\t\t\t\tTODO: window goes to black and stops \n\t\t\t\t\t rendering when moved, fix it.\n\n\t\t\t\t\t When moving or resizing the window, \n\t\t\t\t\t windows blocks the calling thread by pumping \n\t\t\t\t\t messages to this function. Create new\n\t\t\t\t\t thread for the OpelGL to use?\n\t\t\t*\/\n\n\t\t\tWindow* window;\n\n\t\t\t\/\/ Sent prior to the WM_CREATE message when a window is first created.\n\t\t\tif (message == WM_NCCREATE) {\n\t\t\t\t\/\/ Get instance pointer.\n\t\t\t\twindow = static_cast<Window*>(reinterpret_cast<CREATESTRUCT*>(lParam)->lpCreateParams);\n\n\t\t\t\t\/\/ Just set last error to 0.\n\t\t\t\tSetLastError(0);\n\n\t\t\t\t\/\/ Try to set the window long ptr.\n\t\t\t\tif (!SetWindowLongPtr(hWnd, GWL_USERDATA, reinterpret_cast<LONG_PTR>(window))) {\n\t\t\t\t\tif (GetLastError() != 0) return FALSE;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\twindow = reinterpret_cast<Window*>(GetWindowLongPtr(hWnd, GWL_USERDATA));\n\t\t\t}\n\n\t\t\t\/\/ TODO: use window if needed.\n\n\t\t\tswitch (message) {\n\t\t\t\t\/\/ Close the application.\n\t\t\t\tcase WM_DESTROY:\n\t\t\t\t\tPostQuitMessage(0);\n\t\t\t\t\tDestroyWindow(hWnd);\n\n\t\t\t\t\treturn 0;\n\t\t\t\tcase WM_CREATE:\n\t\t\t\t{\n\t\t\t\t\t\/\/ Initialize for OpenGL, set pixel format.\n\t\t\t\t\t\/\/ TODO: select between OpenGL and DX.\n\t\t\t\t\tPIXELFORMATDESCRIPTOR pfd =\n\t\t\t\t\t{\n\t\t\t\t\t\tsizeof(PIXELFORMATDESCRIPTOR),\n\t\t\t\t\t\t1,\n\t\t\t\t\t\tPFD_DRAW_TO_WINDOW | PFD_SUPPORT_OPENGL | PFD_DOUBLEBUFFER,\t\t\/\/ Flags.\n\t\t\t\t\t\tPFD_TYPE_RGBA,\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ The kind of framebuffer. RGBA for palette.\n\t\t\t\t\t\t32,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Colordepth of the framebuffer.\n\t\t\t\t\t\t0, 0, 0, 0, 0, 0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0, 0, 0, 0,\n\t\t\t\t\t\t24,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of bits for the depth buffer.\n\t\t\t\t\t\t8,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of bits for the stencil buffer.\n\t\t\t\t\t\t0,\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\/\/ Number of Aux buffers in the framebuffer.\n\t\t\t\t\t\tPFD_MAIN_PLANE,\n\t\t\t\t\t\t0,\n\t\t\t\t\t\t0, 0, 0\n\t\t\t\t\t};\n\n\t\t\t\t\t\/\/ Handle to device.\n\t\t\t\t\tHDC hDC = GetDC(hWnd);\n\n\t\t\t\t\t\/\/ Set pixel format.\n\t\t\t\t\tint pixelFormatID = ChoosePixelFormat(hDC, &pfd);\n\t\t\t\t\tSetPixelFormat(hDC, pixelFormatID, &pfd);\n\n\t\t\t\t\tWIN32_ASSERT();\n\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t\tcase WM_SIZE:\n\t\t\t\t\t\/\/ Get new size of the window.\n\t\t\t\t\tRECT wndRect;\n\n\t\t\t\t\tGetWindowRect(window->impl->hWnd, &wndRect);\n\n\t\t\t\t\twindow->impl->width = wndRect.right - wndRect.left;\n\t\t\t\t\twindow->impl->height = wndRect.bottom - wndRect.top;\n\n\t\t\t\t\treturn 0;\n\t\t\t\tcase WM_MOVE:\n\t\t\t\t\tGetWindowRect(window->impl->hWnd, &wndRect);\n\n\t\t\t\t\twindow->impl->x = wndRect.left;\n\t\t\t\t\twindow->impl->y = wndRect.top;\n\n\t\t\t\t\treturn 0;\n\t\t\t}\n\n\t\t\t\/\/ Handle any messages the switch statement didn't.\n\t\t\treturn DefWindowProc(hWnd, message, wParam, lParam);\n\t\t}\n\n\t\t\/\/ Public.\n\n\t\tHWND Window::getHandle() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\treturn impl->hWnd;\n\t\t}\n\n\t\tString Window::getTitle() const {\n\t\t\treturn impl->cTitle;\n\t\t}\n\t\tvoid Window::setTitle(const String& title) {\n\t\t\tconst std::wstring stemp = std::wstring(title.begin(), title.end());\n\n\t\t\timpl->title = stemp.c_str();\n\t\t\timpl->cTitle = title;\n\n\t\t\tif (impl->initialized) {\n\t\t\t\tSetWindowText(impl->hWnd, impl->title);\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::minimize() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (impl->isMinimized) return;\n\n\t\t\tShowWindow(impl->hWnd, SW_MINIMIZE);\n\t\t\t\n\t\t\timpl->isMinimized = true;\n\t\t}\n\t\tvoid Window::show() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (impl->isMinimized) {\n\t\t\t\tShowWindow(impl->hWnd, SW_RESTORE);\n\n\t\t\t\timpl->isMinimized = false;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tShowWindow(impl->hWnd, SW_SHOW);\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::setSize(const int32 width, const int32 height) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, width, height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->width = width;\n\t\t\t\timpl->height = height;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setWidth(const int32 width) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->width = width;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setHeight(const int32 height) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, impl->y, impl->width, height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->height = height;\n\t\t\t}\n\t\t}\n\n\t\tvoid Window::setPosition(const int32 x, const int32 y) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, y, x, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->x = x;\n\t\t\t\timpl->y = y;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setX(const int32 x) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, x, impl->y, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->x = x;\n\t\t\t}\n\t\t}\n\t\tvoid Window::setY(const int32 y) {\n\t\t\tif (impl->initialized) MoveWindow(impl->hWnd, impl->x, y, impl->width, impl->height, TRUE);\n\t\t\telse {\n\t\t\t\timpl->y = y;\n\t\t\t}\n\t\t}\n\n\t\tint32 Window::getX() const {\n\t\t\treturn impl->x;\n\t\t}\n\t\tint32 Window::getY() const {\n\t\t\treturn impl->y;\n\t\t}\n\n\t\tuint32 Window::getClientWidth() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tRECT clntRect;\n\n\t\t\tGetClientRect(impl->hWnd, &clntRect);\n\n\t\t\treturn clntRect.right- clntRect.left;\n\t\t}\n\t\tuint32 Window::getClientHeight() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tRECT clntRect;\n\n\t\t\tGetClientRect(impl->hWnd, &clntRect);\n\n\t\t\treturn clntRect.bottom - clntRect.top;\n\t\t}\n\n\t\tinline int32 Window::getWidth() {\n\t\t\treturn impl->width;\n\t\t}\n\t\tinline int32 Window::getHeight() {\n\t\t\treturn impl->height;\n\t\t}\n\n\t\tvoid Window::listen() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\tMSG msg;\n\n\t\t\tif (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE)) {\n\t\t\t\t\/\/ translate keystroke messages into the right format\n\t\t\t\tTranslateMessage(&msg);\n\n\t\t\t\t\/\/ send the message to the WindowProc function\n\t\t\t\tDispatchMessage(&msg);\n\n\t\t\t\timpl->isWindowOpen = msg.message != WM_QUIT;\n\t\t\t}\n\t\t}\n\n\t\tbool Window::isOpen() const {\n\t\t\tassert(impl->initialized);\n\n\t\t\treturn impl->isWindowOpen;\n\t\t}\n\n\t\tvoid Window::close() {\n\t\t\tassert(impl->initialized);\n\n\t\t\tif (!impl->isWindowOpen) return;\n\n\t\t\timpl->isWindowOpen = false;\n\t\t}\n\n\t\tbool Window::initialize() {\n\t\t\tassert(!impl->initialized);\n\n\t\t\t\/\/ Initialize the window.\n\t\t\tWNDCLASSEX windowClass;\n\n\t\t\tconst size_t wndSize = sizeof(WNDCLASSEX);\n\t\t\t\n\t\t\tZeroMemory(&windowClass, wndSize);\n\t\t\tWIN32_ASSERT();\n\n\t\t\t\/\/ Fill the struct.\n\t\t\twindowClass.cbSize = wndSize;\n\t\t\twindowClass.style = CS_HREDRAW | CS_VREDRAW;\n\t\t\twindowClass.lpfnWndProc = WndProc;\n\t\t\twindowClass.hInstance = impl->hInstance;\n\t\t\twindowClass.hCursor = LoadCursor(NULL, IDC_ARROW);\n\t\t\twindowClass.lpszClassName = L\"WindowClass1\";\n\n\t\t\tRegisterClassEx(&windowClass);\n\t\t\tWIN32_ASSERT();\n\n\t\t\t\/\/ TODO: set style to WS_OVERLAPPEDWINDOW for WinDX and \n\t\t\t\/\/\t\t CS_OWNDC for OpenGL. Create rendering API detection.\n\n\t\t\t\/\/ TODO: open the window to the center of the display.\n\t\t\t\/\/ Create the window.\n\t\t\timpl->hWnd = CreateWindowEx(NULL,\n\t\t\t\t\t\t\t\t\t\twindowClass.lpszClassName,\n\t\t\t\t\t\t\t\t\t\timpl->title,\n\t\t\t\t\t\t\t\t\t\tWS_OVERLAPPEDWINDOW,\n\t\t\t\t\t\t\t\t\t\timpl->x,\n\t\t\t\t\t\t\t\t\t\timpl->y,\n\t\t\t\t\t\t\t\t\t\timpl->width,\n\t\t\t\t\t\t\t\t\t\timpl->height,\n\t\t\t\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\t\t\t\tNULL,\n\t\t\t\t\t\t\t\t\t\timpl->hInstance,\n\t\t\t\t\t\t\t\t\t\tthis);\n\n\t\t\tWIN32_REQUIRE(impl->hWnd, L\"failed to create window\");\n\n\t\t\t\/\/ Set background to black.\n\t\t\tconst HBRUSH brush = CreateSolidBrush(RGB(0, 0, 0));\n\t\t\tSetClassLongPtr(impl->hWnd, GCLP_HBRBACKGROUND, (LONG)brush);\n\n\t\t\timpl->initialized = true;\n\t\t\timpl->isWindowOpen = true;\n\n\t\t\t\/\/ Return results.\n\t\t\treturn impl->initialized;\n\t\t}\n\n\t\tWindow::~Window() {\n\t\t\tdelete impl;\n\t\t}\n\t}\n}\n\n#endif<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 Cloudera, Inc. All rights reserved.\n\n#include \"common\/logging.h\"\n#include \"util\/webserver.h\"\n#include \"util\/metrics.h\"\n#include <sstream>\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/mem_fn.hpp>\n\nusing namespace impala;\nusing namespace std;\nusing namespace boost;\nusing namespace boost::algorithm;\n\nMetrics::Metrics() \n : obj_pool_(new ObjectPool()) { }\n\nStatus Metrics::Init(Webserver* webserver) {\n if (webserver != NULL) {\n Webserver::PathHandlerCallback default_callback =\n bind<void>(mem_fn(&Metrics::TextCallback), this, _1); \n webserver->RegisterPathHandler(\"\/metrics\", default_callback);\n\n Webserver::PathHandlerCallback json_callback =\n bind<void>(mem_fn(&Metrics::JsonCallback), this, _1); \n webserver->RegisterPathHandler(\"\/jsonmetrics\", json_callback);\n }\n\n return Status::OK;\n}\n\nvoid Metrics::PrintMetricMap(stringstream* output) {\n lock_guard<mutex> l(lock_);\n BOOST_FOREACH(const MetricMap::value_type& m, metric_map_) {\n m.second->Print(output);\n }\n}\n\nvoid Metrics::PrintMetricMapAsJson(vector<string>* metrics) {\n lock_guard<mutex> l(lock_);\n BOOST_FOREACH(const MetricMap::value_type& m, metric_map_) {\n stringstream ss;\n m.second->PrintJson(&ss);\n metrics->push_back(ss.str());\n }\n}\n\nstring Metrics::DebugString() {\n stringstream ss;\n TextCallback(&ss);\n return ss.str();\n}\n\nvoid Metrics::TextCallback(stringstream* output) {\n (*output) << \"<pre>\";\n PrintMetricMap(output);\n (*output) << \"<\/pre>\";\n}\n\nvoid Metrics::JsonCallback(stringstream* output) {\n (*output) << \"<pre>{\";\n vector<string> metrics;\n PrintMetricMapAsJson(&metrics);\n (*output) << join(metrics, \",\\n\");\n (*output) << \"}<\/pre>\";\n}\n<commit_msg>Remove HTML tags from \/jsonmetrics<commit_after>\/\/ Copyright (c) 2012 Cloudera, Inc. All rights reserved.\n\n#include \"common\/logging.h\"\n#include \"util\/webserver.h\"\n#include \"util\/metrics.h\"\n#include <sstream>\n#include <boost\/algorithm\/string\/join.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/bind.hpp>\n#include <boost\/mem_fn.hpp>\n\nusing namespace impala;\nusing namespace std;\nusing namespace boost;\nusing namespace boost::algorithm;\n\nMetrics::Metrics() \n : obj_pool_(new ObjectPool()) { }\n\nStatus Metrics::Init(Webserver* webserver) {\n if (webserver != NULL) {\n Webserver::PathHandlerCallback default_callback =\n bind<void>(mem_fn(&Metrics::TextCallback), this, _1); \n webserver->RegisterPathHandler(\"\/metrics\", default_callback);\n\n Webserver::PathHandlerCallback json_callback =\n bind<void>(mem_fn(&Metrics::JsonCallback), this, _1); \n webserver->RegisterPathHandler(\"\/jsonmetrics\", json_callback);\n }\n\n return Status::OK;\n}\n\nvoid Metrics::PrintMetricMap(stringstream* output) {\n lock_guard<mutex> l(lock_);\n BOOST_FOREACH(const MetricMap::value_type& m, metric_map_) {\n m.second->Print(output);\n }\n}\n\nvoid Metrics::PrintMetricMapAsJson(vector<string>* metrics) {\n lock_guard<mutex> l(lock_);\n BOOST_FOREACH(const MetricMap::value_type& m, metric_map_) {\n stringstream ss;\n m.second->PrintJson(&ss);\n metrics->push_back(ss.str());\n }\n}\n\nstring Metrics::DebugString() {\n stringstream ss;\n TextCallback(&ss);\n return ss.str();\n}\n\nvoid Metrics::TextCallback(stringstream* output) {\n (*output) << \"<pre>\";\n PrintMetricMap(output);\n (*output) << \"<\/pre>\";\n}\n\nvoid Metrics::JsonCallback(stringstream* output) {\n (*output) << \"{\";\n vector<string> metrics;\n PrintMetricMapAsJson(&metrics);\n (*output) << join(metrics, \",\\n\");\n (*output) << \"}\";\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Song.h\"\n#include \"Sequence.h\"\n#include \"SequenceRow.h\"\n#include \"Pattern.h\"\n#include \"Sequence.h\"\n#include \"Macro.h\"\n#include \"PatternRow.h\"\n#include \"FileSection.h\"\n#include \"SectionListener.h\"\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <strings.h>\n#include <algorithm>\n\nSong::Song()\n\t: patternLength(64), sequenceLength(1), mNumListeners(0)\n{\n\tsequence = new Sequence();\n\tpatterns = new Pattern[maxPatterns];\n\tmacros = new Macro[maxMacros];\n\tstrcpy(name, \"new song\");\n}\n\n\nSong::~Song()\n{\n\tdelete[] patterns;\n\tdelete[] macros;\n\tdelete sequence;\n}\n\n\nSequence& Song::getSequence()\n{\n\treturn *sequence;\n}\n\n\nint Song::getLastPatternUsed() const\n{\n\tint last = -1;\n\t\n\tfor (int i = 0 ; i < maxPatterns ; ++i)\n\t{\n\t\tif (!patterns[i].isEmpty())\n\t\t\tlast = std::max(last, i);\n\t}\n\t\n\treturn last;\n}\n\n\nint Song::getLastMacroUsed() const\n{\n\tint last = -1;\n\n\tfor (int i = 0 ; i < maxMacros ; ++i)\n\t{\n\t\tif (strlen(macros[i].getName()) > 0 || !macros[i].isEmpty())\n\t\t\tlast = std::max(last, i);\n\t}\n\t\n\treturn last;\n}\n\n\nint Song::getPatternLength() const\n{\n\treturn patternLength;\n}\n\n\nint Song::getSequenceLength() const\n{\n\treturn sequenceLength;\n}\n\n\nPattern& Song::getPattern(int pattern)\n{\n\treturn patterns[pattern];\n}\n\n\nMacro& Song::getMacro(int macro)\n{\n\treturn macros[macro];\n}\n\n\nvoid Song::setPatternLength(int length)\n{\n\tpatternLength = length;\n}\n\n\nvoid Song::setSequenceLength(int length)\n{\n\tsequenceLength = length;\n}\n\n\nFileSection* Song::pack() \n{\n\tFileSection * song = FileSection::createSection(\"SONG\");\n\t\n\t\/*\n\t * Basic song info\n\t *\/\n\t\n\t\/\/ File format version\n\tsong->writeByte(songVersion);\n\tsong->writeByte(SequenceRow::maxTracks);\n\tsong->writeString(name);\n\tsong->writeByte(patternLength - 1);\n\tsong->writeByte(sequenceLength - 1);\n\t\n\t\/*\n\t * Sequence data\n\t *\/\n\t\n\tFileSection * sequenceData = FileSection::createSection(\"SEQU\");\n\tint sequenceCount = sequence->getLastSequenceRowUsed() + 1;\n\tsequenceData->writeByte(sequenceCount);\n\tfor (int track = 0 ; track < SequenceRow::maxTracks ; ++track)\n\t{\n\t\tfor (int i = 0 ; i < sequenceCount ; ++i)\n\t\t{\t\t\t\n\t\t\tSequenceRow& sequenceRow = sequence->getRow(i);\n\t\t\tsequenceData->writeByte(sequenceRow.pattern[track]);\n\t\t}\n\t}\n\tsong->writeSection(*sequenceData);\n\tdelete sequenceData;\n\t\n\t\/*\n\t * Patterns\n\t *\/\n\t\n\tFileSection * patternData = FileSection::createSection(\"PATT\");\n\tint patternCount = getLastPatternUsed() + 1;\n\tpatternData->writeByte(patternCount);\n\tfor (int i = 0 ; i < patternCount ; ++i)\n\t{\n\t\tPattern& pattern = getPattern(i);\n\t\tpatternData->writePattern(pattern);\n\t}\n\tsong->writeSection(*patternData);\n\tdelete patternData;\n\t\n\t\/*\n\t * Macros\n\t *\/\n\t\n\tFileSection * macroData = FileSection::createSection(\"MACR\");\n\tint macroCount = getLastMacroUsed() + 1;\n\t\/\/printf(\"Saving %d macros\\n\", macroCount);\n\tmacroData->writeByte(macroCount);\n\tfor (int i = 0 ; i < macroCount ; ++i)\n\t{\n\t\tMacro& macro = getMacro(i);\n\t\tmacroData->writeString(macro.getName());\n\t\tmacroData->writePattern(macro);\n\t}\n\tsong->writeSection(*macroData);\n\tdelete macroData;\n\t\n\t\/\/ Call SectionListeners for save\n\t\n\tfor (int i = 0 ; i < mNumListeners ; ++i)\n\t{\n\t\tif (mListeners[i].flags & SectionListener::Load)\n\t\t{\n\t\t\tFileSection *listenerSection = FileSection::createSection(mListeners[i].sectionId);\n\t\t\tmListeners[i].listener->onFileSectionSave(*listenerSection);\n\t\t\tsong->writeSection(*listenerSection);\n\t\t\tdelete listenerSection;\n\t\t}\n\t}\n\t\n\treturn song;\n}\n\n\nvoid Song::clear()\n{\n\tsequence->clear();\n\t\n\tstrcpy(name, \"\");\n\t\n\tfor (int i = 0 ; i < maxPatterns ; ++i)\n\t{\n\t\tpatterns[i].clear();\n\t}\n\t\n\tfor (int i = 0 ; i < maxMacros ; ++i)\n\t{\n\t\tmacros[i].clear();\n\t}\n\t\n\tsequenceLength = 1;\n\tpatternLength = 64;\n}\n\n\nSong::UnpackError Song::unpack(const FileSection& section)\n{\n\tif (strcmp(section.getName(), \"SONG\") != 0)\n\t\treturn NotASong;\n\t\n\tclear();\n\t\n\tint offset = 0;\n\tint version = section.readByte(offset);\n\t\n\tif (version > songVersion)\n\t{\n\t\t\/\/ TODO: display a proper error if the version is newer than we can handle\n\t\treturn ErrorVersion;\n\t}\n\t\n\t\/\/ Default trackCount for version == 0\n\tint trackCount = 4;\n\t\n\tif (version == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tif (version >= 1)\n\t{\n\t\ttrackCount = section.readByte(offset);\n\t\t\n\t\tif (trackCount == FileSection::invalidRead)\n\t\t\treturn ErrorRead;\n\t}\n\t\n\tconst char *songName = section.readString(offset);\n\t\n\tif (songName == NULL)\n\t\treturn ErrorRead;\n\t\n\tstrncpy(name, songName, songNameLength + 1);\n\t\n\tint temp = section.readByte(offset);\n\t\n\tif (temp == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tpatternLength = temp + 1;\n\t\n\ttemp = section.readByte(offset);\n\t\n\tif (temp == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tsequenceLength = temp + 1;\n\t\n\tUnpackError returnValue = Success;\n\t\n\tdo\n\t{\n\t\t\/\/printf(\"offset = %d\\n\", offset);\n\t\tFileSection *subSection = section.readSection(offset);\n\t\tint subOffset = 0;\n\t\t\n\t\tif (subSection == NULL)\n\t\t\tbreak;\n\t\t\n\t\tconst char *sectionName = subSection->getName();\n\t\t\n\t\tif (sectionName != NULL)\n\t\t{\n\t\t\t\/\/printf(\"Read section %s (%d bytes)\\n\", sectionName, subSection->getSize());\n\t\t\t\n\t\t\tif (strcmp(sectionName, \"SEQU\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d sequences\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tif (count > maxSequenceRows)\n\t\t\t\t\t{\n\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int track = 0 ; track < trackCount && returnValue == Success ; ++track)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Skip tracks that can't fit in our sequence\n\t\t\t\t\t\t\t\tif (track < SequenceRow::maxTracks)\n\t\t\t\t\t\t\t\t\tsequence->getRow(i).pattern[track] = temp;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (strcmp(sectionName, \"PATT\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d patterns\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!subSection->readPattern(patterns[i], subOffset))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (strcmp(sectionName, \"MACR\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d macros\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst char *macroName = subSection->readString(subOffset);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (macroName == NULL)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tstrncpy(macros[i].getName(), macroName, Macro::macroNameLength + 1);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (!subSection->readPattern(macros[i], subOffset))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int i = 0 ; i < mNumListeners ; ++i)\n\t\t\t\t{\n\t\t\t\t\tif ((mListeners[i].flags & SectionListener::Load) && strcmp(mListeners[i].sectionId, sectionName) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!mListeners[i].listener->onFileSectionLoad(*subSection))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturnValue = ErrorRead;\n\t\t}\n\t\t\n\t\t\/\/offset += subOffset;\n\t\t\n\t\tdelete subSection;\n\t}\n\twhile (returnValue == Success);\n\t\n\treturn returnValue;\n}\n\n\nchar *Song::getSongName()\n{\n\treturn name;\n}\n\n\nint Song::getSize() const\n{\n\treturn 0;\n}\n\n\nbool Song::addSectionListener(const char *sectionId, SectionListener *sectionListener, int flags)\n{\n\tif (mNumListeners >= maxListeners)\n\t\treturn false;\n\t\n\tSectionListenerInfo& info = mListeners[mNumListeners];\n\tinfo.flags = flags;\n\tinfo.sectionId = sectionId;\n\tinfo.listener = sectionListener;\n\t\n\tmNumListeners++;\n\t\t\n\treturn true;\n}\n<commit_msg>Wrong flag for saving<commit_after>#include \"Song.h\"\n#include \"Sequence.h\"\n#include \"SequenceRow.h\"\n#include \"Pattern.h\"\n#include \"Sequence.h\"\n#include \"Macro.h\"\n#include \"PatternRow.h\"\n#include \"FileSection.h\"\n#include \"SectionListener.h\"\n#include <cstdlib>\n#include <cstdio>\n#include <cstring>\n#include <strings.h>\n#include <algorithm>\n\nSong::Song()\n\t: patternLength(64), sequenceLength(1), mNumListeners(0)\n{\n\tsequence = new Sequence();\n\tpatterns = new Pattern[maxPatterns];\n\tmacros = new Macro[maxMacros];\n\tstrcpy(name, \"new song\");\n}\n\n\nSong::~Song()\n{\n\tdelete[] patterns;\n\tdelete[] macros;\n\tdelete sequence;\n}\n\n\nSequence& Song::getSequence()\n{\n\treturn *sequence;\n}\n\n\nint Song::getLastPatternUsed() const\n{\n\tint last = -1;\n\t\n\tfor (int i = 0 ; i < maxPatterns ; ++i)\n\t{\n\t\tif (!patterns[i].isEmpty())\n\t\t\tlast = std::max(last, i);\n\t}\n\t\n\treturn last;\n}\n\n\nint Song::getLastMacroUsed() const\n{\n\tint last = -1;\n\n\tfor (int i = 0 ; i < maxMacros ; ++i)\n\t{\n\t\tif (strlen(macros[i].getName()) > 0 || !macros[i].isEmpty())\n\t\t\tlast = std::max(last, i);\n\t}\n\t\n\treturn last;\n}\n\n\nint Song::getPatternLength() const\n{\n\treturn patternLength;\n}\n\n\nint Song::getSequenceLength() const\n{\n\treturn sequenceLength;\n}\n\n\nPattern& Song::getPattern(int pattern)\n{\n\treturn patterns[pattern];\n}\n\n\nMacro& Song::getMacro(int macro)\n{\n\treturn macros[macro];\n}\n\n\nvoid Song::setPatternLength(int length)\n{\n\tpatternLength = length;\n}\n\n\nvoid Song::setSequenceLength(int length)\n{\n\tsequenceLength = length;\n}\n\n\nFileSection* Song::pack() \n{\n\tFileSection * song = FileSection::createSection(\"SONG\");\n\t\n\t\/*\n\t * Basic song info\n\t *\/\n\t\n\t\/\/ File format version\n\tsong->writeByte(songVersion);\n\tsong->writeByte(SequenceRow::maxTracks);\n\tsong->writeString(name);\n\tsong->writeByte(patternLength - 1);\n\tsong->writeByte(sequenceLength - 1);\n\t\n\t\/*\n\t * Sequence data\n\t *\/\n\t\n\tFileSection * sequenceData = FileSection::createSection(\"SEQU\");\n\tint sequenceCount = sequence->getLastSequenceRowUsed() + 1;\n\tsequenceData->writeByte(sequenceCount);\n\tfor (int track = 0 ; track < SequenceRow::maxTracks ; ++track)\n\t{\n\t\tfor (int i = 0 ; i < sequenceCount ; ++i)\n\t\t{\t\t\t\n\t\t\tSequenceRow& sequenceRow = sequence->getRow(i);\n\t\t\tsequenceData->writeByte(sequenceRow.pattern[track]);\n\t\t}\n\t}\n\tsong->writeSection(*sequenceData);\n\tdelete sequenceData;\n\t\n\t\/*\n\t * Patterns\n\t *\/\n\t\n\tFileSection * patternData = FileSection::createSection(\"PATT\");\n\tint patternCount = getLastPatternUsed() + 1;\n\tpatternData->writeByte(patternCount);\n\tfor (int i = 0 ; i < patternCount ; ++i)\n\t{\n\t\tPattern& pattern = getPattern(i);\n\t\tpatternData->writePattern(pattern);\n\t}\n\tsong->writeSection(*patternData);\n\tdelete patternData;\n\t\n\t\/*\n\t * Macros\n\t *\/\n\t\n\tFileSection * macroData = FileSection::createSection(\"MACR\");\n\tint macroCount = getLastMacroUsed() + 1;\n\t\/\/printf(\"Saving %d macros\\n\", macroCount);\n\tmacroData->writeByte(macroCount);\n\tfor (int i = 0 ; i < macroCount ; ++i)\n\t{\n\t\tMacro& macro = getMacro(i);\n\t\tmacroData->writeString(macro.getName());\n\t\tmacroData->writePattern(macro);\n\t}\n\tsong->writeSection(*macroData);\n\tdelete macroData;\n\t\n\t\/\/ Call SectionListeners for save\n\t\n\tfor (int i = 0 ; i < mNumListeners ; ++i)\n\t{\n\t\tif (mListeners[i].flags & SectionListener::Save)\n\t\t{\n\t\t\tFileSection *listenerSection = FileSection::createSection(mListeners[i].sectionId);\n\t\t\tmListeners[i].listener->onFileSectionSave(*listenerSection);\n\t\t\tsong->writeSection(*listenerSection);\n\t\t\tdelete listenerSection;\n\t\t}\n\t}\n\t\n\treturn song;\n}\n\n\nvoid Song::clear()\n{\n\tsequence->clear();\n\t\n\tstrcpy(name, \"\");\n\t\n\tfor (int i = 0 ; i < maxPatterns ; ++i)\n\t{\n\t\tpatterns[i].clear();\n\t}\n\t\n\tfor (int i = 0 ; i < maxMacros ; ++i)\n\t{\n\t\tmacros[i].clear();\n\t}\n\t\n\tsequenceLength = 1;\n\tpatternLength = 64;\n}\n\n\nSong::UnpackError Song::unpack(const FileSection& section)\n{\n\tif (strcmp(section.getName(), \"SONG\") != 0)\n\t\treturn NotASong;\n\t\n\tclear();\n\t\n\tint offset = 0;\n\tint version = section.readByte(offset);\n\t\n\tif (version > songVersion)\n\t{\n\t\t\/\/ TODO: display a proper error if the version is newer than we can handle\n\t\treturn ErrorVersion;\n\t}\n\t\n\t\/\/ Default trackCount for version == 0\n\tint trackCount = 4;\n\t\n\tif (version == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tif (version >= 1)\n\t{\n\t\ttrackCount = section.readByte(offset);\n\t\t\n\t\tif (trackCount == FileSection::invalidRead)\n\t\t\treturn ErrorRead;\n\t}\n\t\n\tconst char *songName = section.readString(offset);\n\t\n\tif (songName == NULL)\n\t\treturn ErrorRead;\n\t\n\tstrncpy(name, songName, songNameLength + 1);\n\t\n\tint temp = section.readByte(offset);\n\t\n\tif (temp == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tpatternLength = temp + 1;\n\t\n\ttemp = section.readByte(offset);\n\t\n\tif (temp == FileSection::invalidRead)\n\t\treturn ErrorRead;\n\t\n\tsequenceLength = temp + 1;\n\t\n\tUnpackError returnValue = Success;\n\t\n\tdo\n\t{\n\t\t\/\/printf(\"offset = %d\\n\", offset);\n\t\tFileSection *subSection = section.readSection(offset);\n\t\tint subOffset = 0;\n\t\t\n\t\tif (subSection == NULL)\n\t\t\tbreak;\n\t\t\n\t\tconst char *sectionName = subSection->getName();\n\t\t\n\t\tif (sectionName != NULL)\n\t\t{\n\t\t\t\/\/printf(\"Read section %s (%d bytes)\\n\", sectionName, subSection->getSize());\n\t\t\t\n\t\t\tif (strcmp(sectionName, \"SEQU\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d sequences\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tif (count > maxSequenceRows)\n\t\t\t\t\t{\n\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int track = 0 ; track < trackCount && returnValue == Success ; ++track)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\/\/ Skip tracks that can't fit in our sequence\n\t\t\t\t\t\t\t\tif (track < SequenceRow::maxTracks)\n\t\t\t\t\t\t\t\t\tsequence->getRow(i).pattern[track] = temp;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (strcmp(sectionName, \"PATT\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d patterns\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!subSection->readPattern(patterns[i], subOffset))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (strcmp(sectionName, \"MACR\") == 0)\n\t\t\t{\n\t\t\t\tint temp = subSection->readByte(subOffset);\n\t\t\t\t\n\t\t\t\tif (temp == FileSection::invalidRead)\n\t\t\t\t{\n\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint count = temp;\n\t\t\t\t\t\n\t\t\t\t\t\/\/printf(\"Reading %d macros\\n\", count);\n\t\t\t\t\t\n\t\t\t\t\tfor (int i = 0 ; i < count ; ++i)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst char *macroName = subSection->readString(subOffset);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (macroName == NULL)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\tstrncpy(macros[i].getName(), macroName, Macro::macroNameLength + 1);\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (!subSection->readPattern(macros[i], subOffset))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tfor (int i = 0 ; i < mNumListeners ; ++i)\n\t\t\t\t{\n\t\t\t\t\tif ((mListeners[i].flags & SectionListener::Load) && strcmp(mListeners[i].sectionId, sectionName) == 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!mListeners[i].listener->onFileSectionLoad(*subSection))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\treturnValue = ErrorRead;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\treturnValue = ErrorRead;\n\t\t}\n\t\t\n\t\t\/\/offset += subOffset;\n\t\t\n\t\tdelete subSection;\n\t}\n\twhile (returnValue == Success);\n\t\n\treturn returnValue;\n}\n\n\nchar *Song::getSongName()\n{\n\treturn name;\n}\n\n\nint Song::getSize() const\n{\n\treturn 0;\n}\n\n\nbool Song::addSectionListener(const char *sectionId, SectionListener *sectionListener, int flags)\n{\n\tif (mNumListeners >= maxListeners)\n\t\treturn false;\n\t\n\tSectionListenerInfo& info = mListeners[mNumListeners];\n\tinfo.flags = flags;\n\tinfo.sectionId = sectionId;\n\tinfo.listener = sectionListener;\n\t\n\tmNumListeners++;\n\t\t\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program source code file is part of KiCad, a free EDA CAD application.\n *\n * Copyright (C) 2009 Jean-Pierre Charras, jaen-pierre.charras@gipsa-lab.inpg.com\n * Copyright (C) 2011 Wayne Stambaugh <stambaughw@verizon.net>\n * Copyright (C) 1992-2011 KiCad Developers, see AUTHORS.txt for contributors.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, you may find one here:\n * http:\/\/www.gnu.org\/licenses\/old-licenses\/gpl-2.0.html\n * or you may search the http:\/\/www.gnu.org website for the version 2 license,\n * or you may write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\/**\n * @file pcbnew\/controle.cpp\n *\/\n\n#include \"fctsys.h\"\n#include \"class_drawpanel.h\"\n#include \"wxPcbStruct.h\"\n#include \"pcbcommon.h\"\n#include \"macros.h\"\n\n#include \"pcbnew_id.h\"\n\n#include \"class_board.h\"\n#include \"class_module.h\"\n\n#include \"pcbnew.h\"\n#include \"protos.h\"\n#include \"collectors.h\"\n\n\/\/external functions used here:\nextern bool Magnetize( BOARD* m_Pcb, PCB_EDIT_FRAME* frame,\n int aCurrentTool, wxSize grid, wxPoint on_grid, wxPoint* curpos );\n\n\n\/**\n * Function AllAreModulesAndReturnSmallestIfSo\n * tests that all items in the collection are MODULEs and if so, returns the\n * smallest MODULE.\n * @return BOARD_ITEM* - The smallest or NULL.\n *\/\nstatic BOARD_ITEM* AllAreModulesAndReturnSmallestIfSo( GENERAL_COLLECTOR* aCollector )\n{\n int count = aCollector->GetCount();\n\n for( int i = 0; i<count; ++i )\n {\n if( (*aCollector)[i]->Type() != PCB_MODULE_T )\n return NULL;\n }\n\n \/\/ all are modules, now find smallest MODULE\n\n int minDim = 0x7FFFFFFF;\n int minNdx = 0;\n\n for( int i = 0; i<count; ++i )\n {\n MODULE* module = (MODULE*) (*aCollector)[i];\n\n int lx = module->m_BoundaryBox.GetWidth();\n int ly = module->m_BoundaryBox.GetHeight();\n\n int lmin = MIN( lx, ly );\n\n if( lmin <= minDim )\n {\n minDim = lmin;\n minNdx = i;\n }\n }\n\n return (*aCollector)[minNdx];\n}\n\n\nBOARD_ITEM* PCB_BASE_FRAME::PcbGeneralLocateAndDisplay( int aHotKeyCode )\n{\n BOARD_ITEM* item;\n\n GENERAL_COLLECTORS_GUIDE guide = GetCollectorsGuide();\n\n \/\/ Assign to scanList the proper item types desired based on tool type\n \/\/ or hotkey that is in play.\n\n const KICAD_T* scanList = NULL;\n\n if( aHotKeyCode )\n {\n \/\/ @todo: add switch here and add calls to PcbGeneralLocateAndDisplay( int aHotKeyCode )\n \/\/ when searching is needed from a hotkey handler\n }\n else if( GetToolId() == ID_NO_TOOL_SELECTED )\n {\n switch( m_HTOOL_current_state )\n {\n case ID_TOOLBARH_PCB_MODE_MODULE:\n scanList = GENERAL_COLLECTOR::ModuleItems;\n break;\n\n default:\n scanList = DisplayOpt.DisplayZonesMode == 0 ?\n GENERAL_COLLECTOR::AllBoardItems :\n GENERAL_COLLECTOR::AllButZones;\n break;\n }\n }\n else\n {\n switch( GetToolId() )\n {\n case ID_PCB_SHOW_1_RATSNEST_BUTT:\n scanList = GENERAL_COLLECTOR::PadsOrModules;\n break;\n\n case ID_TRACK_BUTT:\n scanList = GENERAL_COLLECTOR::Tracks;\n break;\n\n case ID_PCB_MODULE_BUTT:\n scanList = GENERAL_COLLECTOR::ModuleItems;\n break;\n\n case ID_PCB_ZONES_BUTT:\n scanList = GENERAL_COLLECTOR::Zones;\n break;\n\n default:\n scanList = DisplayOpt.DisplayZonesMode == 0 ?\n GENERAL_COLLECTOR::AllBoardItems :\n GENERAL_COLLECTOR::AllButZones;\n }\n }\n\n m_Collector->Collect( m_Pcb, scanList, GetScreen()->RefPos( true ), guide );\n\n#if 0\n \/\/ debugging: print out the collected items, showing their priority order too.\n for( int i = 0; i<m_Collector->GetCount(); ++i )\n (*m_Collector)[i]->Show( 0, std::cout );\n#endif\n\n \/* Remove redundancies: sometime, zones are found twice,\n * because zones can be filled by overlapping segments (this is a fill option)\n *\/\n unsigned long timestampzone = 0;\n\n for( int ii = 0; ii < m_Collector->GetCount(); ii++ )\n {\n item = (*m_Collector)[ii];\n\n if( item->Type() != PCB_ZONE_T )\n continue;\n\n \/* Found a TYPE ZONE *\/\n if( item->m_TimeStamp == timestampzone ) \/\/ Remove it, redundant, zone already found\n {\n m_Collector->Remove( ii );\n ii--;\n }\n else\n {\n timestampzone = item->m_TimeStamp;\n }\n }\n\n if( m_Collector->GetCount() <= 1 )\n {\n item = (*m_Collector)[0];\n SetCurItem( item );\n }\n\n \/\/ If the count is 2, and first item is a pad or module text, and the 2nd item is its\n \/\/ parent module:\n else if( m_Collector->GetCount() == 2\n && ( (*m_Collector)[0]->Type() == PCB_PAD_T || (*m_Collector)[0]->Type() ==\n PCB_MODULE_TEXT_T )\n && (*m_Collector)[1]->Type() == PCB_MODULE_T && (*m_Collector)[0]->GetParent()==\n (*m_Collector)[1] )\n {\n item = (*m_Collector)[0];\n SetCurItem( item );\n }\n \/\/ if all are modules, find the smallest one among the primary choices\n else if( ( item = AllAreModulesAndReturnSmallestIfSo( m_Collector ) ) != NULL )\n {\n SetCurItem( item );\n }\n\n else \/\/ we can't figure out which item user wants, do popup menu so user can choose\n {\n wxMenu itemMenu;\n\n \/* Give a title to the selection menu. This is also a cancel menu item *\/\n wxMenuItem * item_title = new wxMenuItem( &itemMenu, -1, _( \"Selection Clarification\" ) );\n\n#ifdef __WINDOWS__\n wxFont bold_font( *wxNORMAL_FONT );\n bold_font.SetWeight( wxFONTWEIGHT_BOLD );\n bold_font.SetStyle( wxFONTSTYLE_ITALIC );\n item_title->SetFont( bold_font );\n#endif\n\n itemMenu.Append( item_title );\n itemMenu.AppendSeparator();\n\n int limit = MIN( MAX_ITEMS_IN_PICKER, m_Collector->GetCount() );\n\n for( int i = 0; i<limit; ++i )\n {\n wxString text;\n item = (*m_Collector)[i];\n\n text = item->GetSelectMenuText();\n\n BITMAP_DEF xpm = item->GetMenuImage();\n\n AddMenuItem( &itemMenu, ID_POPUP_PCB_ITEM_SELECTION_START + i, text, KiBitmap( xpm ) );\n }\n\n \/* @todo: rather than assignment to true, these should be increment and decrement\n * operators throughout _everywhere_.\n * That way we can handle nesting.\n * But I tried that and found there cases where the assignment to true (converted to\n * a m_IgnoreMouseEvents++ )\n * was not balanced with the -- (now m_IgnoreMouseEvents=false), so I had to revert.\n * Somebody should track down these and make them balanced.\n * DrawPanel->m_IgnoreMouseEvents = true;\n *\/\n\n \/\/ this menu's handler is void PCB_BASE_FRAME::ProcessItemSelection()\n \/\/ and it calls SetCurItem() which in turn calls DisplayInfo() on the item.\n DrawPanel->m_AbortRequest = true; \/\/ changed in false if an item is selected\n PopupMenu( &itemMenu );\n\n DrawPanel->MoveCursorToCrossHair();\n\n \/\/ The function ProcessItemSelection() has set the current item, return it.\n if( DrawPanel->m_AbortRequest ) \/\/ Nothing selected\n item = NULL;\n else\n item = GetCurItem();\n }\n\n return item;\n}\n\n\nvoid PCB_EDIT_FRAME::GeneralControl( wxDC* aDC, const wxPoint& aPosition, int aHotKey )\n{\n wxRealPoint gridSize;\n wxPoint oldpos;\n wxPoint pos = GetScreen()->GetNearestGridPosition( aPosition );\n\n oldpos = GetScreen()->GetCrossHairPosition();\n\n gridSize = GetScreen()->GetGridSize();\n\n switch( aHotKey )\n {\n case WXK_NUMPAD8:\n case WXK_UP:\n pos.y -= wxRound( gridSize.y );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD2:\n case WXK_DOWN:\n pos.y += wxRound( gridSize.y );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD4:\n case WXK_LEFT:\n pos.x -= wxRound( gridSize.x );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD6:\n case WXK_RIGHT:\n pos.x += wxRound( gridSize.x );\n DrawPanel->MoveCursor( pos );\n break;\n\n default:\n break;\n }\n\n \/\/ Put cursor in new position, according to the zoom keys (if any).\n GetScreen()->SetCrossHairPosition( pos );\n\n \/* Put cursor on grid or a pad centre if requested. If the tool DELETE is active the\n * cursor is left off grid this is better to reach items to delete off grid,\n *\/\n bool keep_on_grid = true;\n\n if( GetToolId() == ID_PCB_DELETE_ITEM_BUTT )\n keep_on_grid = false;\n\n \/* Cursor is left off grid if no block in progress and no moving object *\/\n if( GetScreen()->m_BlockLocate.m_State != STATE_NO_BLOCK )\n keep_on_grid = true;\n\n EDA_ITEM* DrawStruct = GetScreen()->GetCurItem();\n\n if( DrawStruct && DrawStruct->m_Flags )\n keep_on_grid = true;\n\n if( keep_on_grid )\n {\n wxPoint on_grid = GetScreen()->GetNearestGridPosition( pos );\n\n wxSize grid;\n grid.x = (int) GetScreen()->GetGridSize().x;\n grid.y = (int) GetScreen()->GetGridSize().y;\n\n if( Magnetize( m_Pcb, this, GetToolId(), grid, on_grid, &pos ) )\n {\n GetScreen()->SetCrossHairPosition( pos, false );\n }\n else\n {\n \/\/ If there's no intrusion and DRC is active, we pass the cursor\n \/\/ \"as is\", and let ShowNewTrackWhenMovingCursor figure out what to do.\n if( !Drc_On || !g_CurrentTrackSegment\n || (BOARD_ITEM*)g_CurrentTrackSegment != this->GetCurItem()\n || !LocateIntrusion( m_Pcb->m_Track, g_CurrentTrackSegment,\n GetScreen()->m_Active_Layer, GetScreen()->RefPos( true ) ) )\n {\n GetScreen()->SetCrossHairPosition( on_grid );\n }\n }\n }\n\n if( oldpos != GetScreen()->GetCrossHairPosition() )\n {\n pos = GetScreen()->GetCrossHairPosition();\n GetScreen()->SetCrossHairPosition( oldpos, false );\n DrawPanel->CrossHairOff( aDC );\n GetScreen()->SetCrossHairPosition( pos, false );\n DrawPanel->CrossHairOn( aDC );\n\n if( DrawPanel->IsMouseCaptured() )\n {\n#ifdef USE_WX_OVERLAY\n wxDCOverlay oDC( DrawPanel->m_overlay, (wxWindowDC*)aDC );\n oDC.Clear();\n DrawPanel->m_mouseCaptureCallback( DrawPanel, aDC, aPosition, false );\n#else\n DrawPanel->m_mouseCaptureCallback( DrawPanel, aDC, aPosition, true );\n#endif\n }\n#ifdef USE_WX_OVERLAY\n else\n DrawPanel->m_overlay.Reset();\n#endif\n }\n\n if( aHotKey )\n {\n OnHotKey( aDC, aHotKey, aPosition );\n }\n\n UpdateStatusBar(); \/* Display new cursor coordinates *\/\n}\n<commit_msg>PCBNEW favored module placed on OPPOSITE side selected layer become. Now it select module from selected side if present. Especially handy in contrast view.<commit_after>\/*\n * This program source code file is part of KiCad, a free EDA CAD application.\n *\n * Copyright (C) 2009 Jean-Pierre Charras, jaen-pierre.charras@gipsa-lab.inpg.com\n * Copyright (C) 2011 Wayne Stambaugh <stambaughw@verizon.net>\n * Copyright (C) 1992-2011 KiCad Developers, see AUTHORS.txt for contributors.\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, you may find one here:\n * http:\/\/www.gnu.org\/licenses\/old-licenses\/gpl-2.0.html\n * or you may search the http:\/\/www.gnu.org website for the version 2 license,\n * or you may write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA\n *\/\n\n\/**\n * @file pcbnew\/controle.cpp\n *\/\n\n#include \"fctsys.h\"\n#include \"class_drawpanel.h\"\n#include \"wxPcbStruct.h\"\n#include \"pcbcommon.h\"\n#include \"macros.h\"\n\n#include \"pcbnew_id.h\"\n\n#include \"class_board.h\"\n#include \"class_module.h\"\n\n#include \"pcbnew.h\"\n#include \"protos.h\"\n#include \"collectors.h\"\n\n\/\/external functions used here:\nextern bool Magnetize( BOARD* m_Pcb, PCB_EDIT_FRAME* frame,\n int aCurrentTool, wxSize grid, wxPoint on_grid, wxPoint* curpos );\n\n\n\/**\n * Function AllAreModulesAndReturnSmallestIfSo\n * tests that all items in the collection are MODULEs and if so, returns the\n * smallest MODULE.\n * @return BOARD_ITEM* - The smallest or NULL.\n *\/\nstatic BOARD_ITEM* AllAreModulesAndReturnSmallestIfSo( GENERAL_COLLECTOR* aCollector )\n{\n int count = aCollector->GetPrimaryCount(); \/\/ try to use preferred layer\n if( 0 == count ) count = aCollector->GetCount();\n\n for( int i = 0; i<count; ++i )\n {\n if( (*aCollector)[i]->Type() != PCB_MODULE_T )\n return NULL;\n }\n\n \/\/ all are modules, now find smallest MODULE\n\n int minDim = 0x7FFFFFFF;\n int minNdx = 0;\n\n for( int i = 0; i<count; ++i )\n {\n MODULE* module = (MODULE*) (*aCollector)[i];\n\n int lx = module->m_BoundaryBox.GetWidth();\n int ly = module->m_BoundaryBox.GetHeight();\n\n int lmin = MIN( lx, ly );\n\n if( lmin < minDim )\n {\n minDim = lmin;\n minNdx = i;\n }\n }\n\n return (*aCollector)[minNdx];\n}\n\n\nBOARD_ITEM* PCB_BASE_FRAME::PcbGeneralLocateAndDisplay( int aHotKeyCode )\n{\n BOARD_ITEM* item;\n\n GENERAL_COLLECTORS_GUIDE guide = GetCollectorsGuide();\n\n \/\/ Assign to scanList the proper item types desired based on tool type\n \/\/ or hotkey that is in play.\n\n const KICAD_T* scanList = NULL;\n\n if( aHotKeyCode )\n {\n \/\/ @todo: add switch here and add calls to PcbGeneralLocateAndDisplay( int aHotKeyCode )\n \/\/ when searching is needed from a hotkey handler\n }\n else if( GetToolId() == ID_NO_TOOL_SELECTED )\n {\n switch( m_HTOOL_current_state )\n {\n case ID_TOOLBARH_PCB_MODE_MODULE:\n scanList = GENERAL_COLLECTOR::ModuleItems;\n break;\n\n default:\n scanList = DisplayOpt.DisplayZonesMode == 0 ?\n GENERAL_COLLECTOR::AllBoardItems :\n GENERAL_COLLECTOR::AllButZones;\n break;\n }\n }\n else\n {\n switch( GetToolId() )\n {\n case ID_PCB_SHOW_1_RATSNEST_BUTT:\n scanList = GENERAL_COLLECTOR::PadsOrModules;\n break;\n\n case ID_TRACK_BUTT:\n scanList = GENERAL_COLLECTOR::Tracks;\n break;\n\n case ID_PCB_MODULE_BUTT:\n scanList = GENERAL_COLLECTOR::ModuleItems;\n break;\n\n case ID_PCB_ZONES_BUTT:\n scanList = GENERAL_COLLECTOR::Zones;\n break;\n\n default:\n scanList = DisplayOpt.DisplayZonesMode == 0 ?\n GENERAL_COLLECTOR::AllBoardItems :\n GENERAL_COLLECTOR::AllButZones;\n }\n }\n\n m_Collector->Collect( m_Pcb, scanList, GetScreen()->RefPos( true ), guide );\n\n#if 0\n \/\/ debugging: print out the collected items, showing their priority order too.\n for( int i = 0; i<m_Collector->GetCount(); ++i )\n (*m_Collector)[i]->Show( 0, std::cout );\n#endif\n\n \/* Remove redundancies: sometime, zones are found twice,\n * because zones can be filled by overlapping segments (this is a fill option)\n *\/\n unsigned long timestampzone = 0;\n\n for( int ii = 0; ii < m_Collector->GetCount(); ii++ )\n {\n item = (*m_Collector)[ii];\n\n if( item->Type() != PCB_ZONE_T )\n continue;\n\n \/* Found a TYPE ZONE *\/\n if( item->m_TimeStamp == timestampzone ) \/\/ Remove it, redundant, zone already found\n {\n m_Collector->Remove( ii );\n ii--;\n }\n else\n {\n timestampzone = item->m_TimeStamp;\n }\n }\n\n if( m_Collector->GetCount() <= 1 )\n {\n item = (*m_Collector)[0];\n SetCurItem( item );\n }\n\n \/\/ If the count is 2, and first item is a pad or module text, and the 2nd item is its\n \/\/ parent module:\n else if( m_Collector->GetCount() == 2\n && ( (*m_Collector)[0]->Type() == PCB_PAD_T || (*m_Collector)[0]->Type() ==\n PCB_MODULE_TEXT_T )\n && (*m_Collector)[1]->Type() == PCB_MODULE_T && (*m_Collector)[0]->GetParent()==\n (*m_Collector)[1] )\n {\n item = (*m_Collector)[0];\n SetCurItem( item );\n }\n \/\/ if all are modules, find the smallest one among the primary choices\n else if( ( item = AllAreModulesAndReturnSmallestIfSo( m_Collector ) ) != NULL )\n {\n SetCurItem( item );\n }\n\n else \/\/ we can't figure out which item user wants, do popup menu so user can choose\n {\n wxMenu itemMenu;\n\n \/* Give a title to the selection menu. This is also a cancel menu item *\/\n wxMenuItem * item_title = new wxMenuItem( &itemMenu, -1, _( \"Selection Clarification\" ) );\n\n#ifdef __WINDOWS__\n wxFont bold_font( *wxNORMAL_FONT );\n bold_font.SetWeight( wxFONTWEIGHT_BOLD );\n bold_font.SetStyle( wxFONTSTYLE_ITALIC );\n item_title->SetFont( bold_font );\n#endif\n\n itemMenu.Append( item_title );\n itemMenu.AppendSeparator();\n\n int limit = MIN( MAX_ITEMS_IN_PICKER, m_Collector->GetCount() );\n\n for( int i = 0; i<limit; ++i )\n {\n wxString text;\n item = (*m_Collector)[i];\n\n text = item->GetSelectMenuText();\n\n BITMAP_DEF xpm = item->GetMenuImage();\n\n AddMenuItem( &itemMenu, ID_POPUP_PCB_ITEM_SELECTION_START + i, text, KiBitmap( xpm ) );\n }\n\n \/* @todo: rather than assignment to true, these should be increment and decrement\n * operators throughout _everywhere_.\n * That way we can handle nesting.\n * But I tried that and found there cases where the assignment to true (converted to\n * a m_IgnoreMouseEvents++ )\n * was not balanced with the -- (now m_IgnoreMouseEvents=false), so I had to revert.\n * Somebody should track down these and make them balanced.\n * DrawPanel->m_IgnoreMouseEvents = true;\n *\/\n\n \/\/ this menu's handler is void PCB_BASE_FRAME::ProcessItemSelection()\n \/\/ and it calls SetCurItem() which in turn calls DisplayInfo() on the item.\n DrawPanel->m_AbortRequest = true; \/\/ changed in false if an item is selected\n PopupMenu( &itemMenu );\n\n DrawPanel->MoveCursorToCrossHair();\n\n \/\/ The function ProcessItemSelection() has set the current item, return it.\n if( DrawPanel->m_AbortRequest ) \/\/ Nothing selected\n item = NULL;\n else\n item = GetCurItem();\n }\n\n return item;\n}\n\n\nvoid PCB_EDIT_FRAME::GeneralControl( wxDC* aDC, const wxPoint& aPosition, int aHotKey )\n{\n wxRealPoint gridSize;\n wxPoint oldpos;\n wxPoint pos = GetScreen()->GetNearestGridPosition( aPosition );\n\n oldpos = GetScreen()->GetCrossHairPosition();\n\n gridSize = GetScreen()->GetGridSize();\n\n switch( aHotKey )\n {\n case WXK_NUMPAD8:\n case WXK_UP:\n pos.y -= wxRound( gridSize.y );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD2:\n case WXK_DOWN:\n pos.y += wxRound( gridSize.y );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD4:\n case WXK_LEFT:\n pos.x -= wxRound( gridSize.x );\n DrawPanel->MoveCursor( pos );\n break;\n\n case WXK_NUMPAD6:\n case WXK_RIGHT:\n pos.x += wxRound( gridSize.x );\n DrawPanel->MoveCursor( pos );\n break;\n\n default:\n break;\n }\n\n \/\/ Put cursor in new position, according to the zoom keys (if any).\n GetScreen()->SetCrossHairPosition( pos );\n\n \/* Put cursor on grid or a pad centre if requested. If the tool DELETE is active the\n * cursor is left off grid this is better to reach items to delete off grid,\n *\/\n bool keep_on_grid = true;\n\n if( GetToolId() == ID_PCB_DELETE_ITEM_BUTT )\n keep_on_grid = false;\n\n \/* Cursor is left off grid if no block in progress and no moving object *\/\n if( GetScreen()->m_BlockLocate.m_State != STATE_NO_BLOCK )\n keep_on_grid = true;\n\n EDA_ITEM* DrawStruct = GetScreen()->GetCurItem();\n\n if( DrawStruct && DrawStruct->m_Flags )\n keep_on_grid = true;\n\n if( keep_on_grid )\n {\n wxPoint on_grid = GetScreen()->GetNearestGridPosition( pos );\n\n wxSize grid;\n grid.x = (int) GetScreen()->GetGridSize().x;\n grid.y = (int) GetScreen()->GetGridSize().y;\n\n if( Magnetize( m_Pcb, this, GetToolId(), grid, on_grid, &pos ) )\n {\n GetScreen()->SetCrossHairPosition( pos, false );\n }\n else\n {\n \/\/ If there's no intrusion and DRC is active, we pass the cursor\n \/\/ \"as is\", and let ShowNewTrackWhenMovingCursor figure out what to do.\n if( !Drc_On || !g_CurrentTrackSegment\n || (BOARD_ITEM*)g_CurrentTrackSegment != this->GetCurItem()\n || !LocateIntrusion( m_Pcb->m_Track, g_CurrentTrackSegment,\n GetScreen()->m_Active_Layer, GetScreen()->RefPos( true ) ) )\n {\n GetScreen()->SetCrossHairPosition( on_grid );\n }\n }\n }\n\n if( oldpos != GetScreen()->GetCrossHairPosition() )\n {\n pos = GetScreen()->GetCrossHairPosition();\n GetScreen()->SetCrossHairPosition( oldpos, false );\n DrawPanel->CrossHairOff( aDC );\n GetScreen()->SetCrossHairPosition( pos, false );\n DrawPanel->CrossHairOn( aDC );\n\n if( DrawPanel->IsMouseCaptured() )\n {\n#ifdef USE_WX_OVERLAY\n wxDCOverlay oDC( DrawPanel->m_overlay, (wxWindowDC*)aDC );\n oDC.Clear();\n DrawPanel->m_mouseCaptureCallback( DrawPanel, aDC, aPosition, false );\n#else\n DrawPanel->m_mouseCaptureCallback( DrawPanel, aDC, aPosition, true );\n#endif\n }\n#ifdef USE_WX_OVERLAY\n else\n DrawPanel->m_overlay.Reset();\n#endif\n }\n\n if( aHotKey )\n {\n OnHotKey( aDC, aHotKey, aPosition );\n }\n\n UpdateStatusBar(); \/* Display new cursor coordinates *\/\n}\n<|endoftext|>"} {"text":"<commit_before>\t\t\/*************************\/\n\t\t\/* affichage des modules *\/\n\t\t\/*************************\/\n\n#include \"fctsys.h\"\n#include \"gr_basic.h\"\n\n#include \"common.h\"\n#include \"pcbnew.h\"\n#include \"trigo.h\"\n\n#ifdef PCBNEW\n#include \"drag.h\"\n#endif\n\n#ifdef CVPCB\n#include \"cvpcb.h\"\n#endif\n\n\/* Police des caracteres de la routine de trace des textes *\/\nextern char *graphic_fonte_shape[];\n\n#include \"protos.h\"\n\n#define L_MIN_DESSIN 1 \/* seuil de largeur des segments pour trace autre que filaire *\/\n\n\/* fonctions locales : *\/\n\n\n\n\/******************************************************************\/\nvoid Trace_Pads_Only(WinEDA_DrawPanel * panel, wxDC * DC, MODULE * Module,\n\t\t\t\t\t\tint ox, int oy,\n\t\t\t\t\t\tint MasqueLayer,int draw_mode)\n\/******************************************************************\/\n\n\/* Trace les pads d'un module en mode SKETCH.\n\tUtilisee pour afficher les pastilles d'un module lorsque celui ci n'est\n\tpas affiche par les options d'affichage des Modules\n\n\tLes pads affiches doivent apparaitre sur les couches donnees par\n\tMasqueLayer\n*\/\n{\nint tmp;\nD_PAD * pt_pad ;\nPCB_SCREEN * screen;\nWinEDA_BasePcbFrame * frame;\n\n\tscreen = (PCB_SCREEN *) panel->GetScreen();\n\tframe = (WinEDA_BasePcbFrame *) panel->m_Parent;\n\n\ttmp = frame->m_DisplayPadFill;\n\tframe->m_DisplayPadFill = FALSE;\n\n\t\/* trace des pastilles *\/\n\tpt_pad = Module->m_Pads;\n\tfor( ; pt_pad != NULL; pt_pad = (D_PAD*) pt_pad->Pnext )\n\t\t{\n\t\tif( (pt_pad->m_Masque_Layer & MasqueLayer) == 0 ) continue;\n\t\tpt_pad->Draw(panel, DC, wxPoint(ox,oy), draw_mode);\n\t\t}\n\n\tframe->m_DisplayPadFill = tmp;\n}\n\n<commit_msg>beautified<commit_after>\/*************************\/\n\/* affichage des modules *\/\n\/*************************\/\n\n#include \"fctsys.h\"\n#include \"gr_basic.h\"\n\n#include \"common.h\"\n#include \"pcbnew.h\"\n#include \"trigo.h\"\n\n#ifdef PCBNEW\n#include \"drag.h\"\n#endif\n\n#ifdef CVPCB\n#include \"cvpcb.h\"\n#endif\n\n\/* Police des caracteres de la routine de trace des textes *\/\nextern char* graphic_fonte_shape[];\n\n#include \"protos.h\"\n\n#define L_MIN_DESSIN 1 \/* seuil de largeur des segments pour trace autre que filaire *\/\n\n\/* fonctions locales : *\/\n\n\n\/******************************************************************\/\nvoid Trace_Pads_Only( WinEDA_DrawPanel* panel, wxDC* DC, MODULE* Module,\n int ox, int oy,\n int MasqueLayer, int draw_mode )\n\/******************************************************************\/\n\n\/* Trace les pads d'un module en mode SKETCH.\n * Utilisee pour afficher les pastilles d'un module lorsque celui ci n'est\n * pas affiche par les options d'affichage des Modules\n * \n * Les pads affiches doivent apparaitre sur les couches donnees par\n * MasqueLayer\n *\/\n{\n int tmp;\n D_PAD* pt_pad;\n PCB_SCREEN* screen;\n WinEDA_BasePcbFrame* frame;\n\n screen = (PCB_SCREEN*) panel->GetScreen();\n frame = (WinEDA_BasePcbFrame*) panel->m_Parent;\n\n tmp = frame->m_DisplayPadFill;\n frame->m_DisplayPadFill = FALSE;\n\n \/* trace des pastilles *\/\n pt_pad = Module->m_Pads;\n for( ; pt_pad != NULL; pt_pad = (D_PAD*) pt_pad->Pnext )\n {\n if( (pt_pad->m_Masque_Layer & MasqueLayer) == 0 )\n continue;\n pt_pad->Draw( panel, DC, wxPoint( ox, oy ), draw_mode );\n }\n\n frame->m_DisplayPadFill = tmp;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: Query.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: hr $ $Date: 2006-06-20 00:41:22 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _XMLSEARCH_QE_QUERY_HXX_\n#include <qe\/Query.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_XMLINDEX_HXX_\n#include <qe\/XmlIndex.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_CONCEPTDATA_HXX_\n#include <qe\/ConceptData.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_QUERYPROCESSOR_HXX_\n#include <qe\/QueryProcessor.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_CONTEXTTABLES_HXX_\n#include <qe\/ContextTables.hxx>\n#endif\n\n\nusing namespace xmlsearch::qe;\n\n\nsal_Int32* QueryHit::getMatches( sal_Int32& matchesL )\n{\n matchesL = matchesL_;\n return matches_;\n}\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* HitStore *\/\n\/* *\/\n\/******************************************************************************\/\n\n\nHitStore::HitStore( double initialStandard,sal_Int32 limit,sal_Int32 nColumns )\n : limit_( limit ),\n nColumns_( nColumns ),\n index_( 0 ),\n free_( 0 ),\n standard_( initialStandard ),\n heap_( limit )\n{\n for( sal_uInt32 i = 0; i < heap_.size(); ++i )\n heap_[i] = 0;\n}\n\n\n\nHitStore::~HitStore()\n{\n for( sal_uInt32 i = 0; i < heap_.size(); ++i )\n delete heap_[i];\n}\n\n\n\nbool HitStore::goodEnough( double penalty, sal_Int32 begin, sal_Int32 end )\n{\n return free_ == limit_ ? heap_[0]->worseThan( penalty,begin,end ) : true;\n}\n\n\nQueryHit* HitStore::createQueryHit( double penalty,sal_Int32 doc,sal_Int32 begin,sal_Int32 end )\n{\n QueryHit* hit = new QueryHit( nColumns_,penalty,doc,begin,end );\n if( free_ == limit_ )\n { \/\/ goodEnough'ness checked already\n delete heap_[0];\n heap_[0] = hit;\n heapify( 0 );\n standard_ = heap_[0]->getPenalty();\n }\n else if( free_ < limit_ )\n {\n heap_[ free_++ ] = hit;\n if( free_ == limit_ )\n { \/\/ we have the needed number\n for( sal_Int32 i = free_\/2; i >= 0; --i ) \/\/ build heap\n heapify( i );\n standard_ = heap_[0]->getPenalty();\n }\n }\n return hit;\n}\n\n\nstruct CompareQueryHit\n{\n bool operator()( const QueryHit* l,const QueryHit* r )\n {\n return l->compareTo( r );\n }\n};\n\n\n#include <algorithm>\n\n\nQueryHit* HitStore::firstBestQueryHit()\n{\n if( free_ > 0)\n {\n CompareQueryHit bla;\n heap_.resize( free_ );\n std::stable_sort( heap_.begin(),heap_.end(),bla );\n index_ = 0;\n return nextBestQueryHit();\n }\n else\n return 0;\n}\n\n\nQueryHit* HitStore::nextBestQueryHit()\n{\n return index_ < free_ ? heap_[ index_++ ] : 0;\n}\n\n\nvoid HitStore::heapify( sal_Int32 i )\n{\n for( sal_Int32 r,l,worst; ; )\n {\n r = (i + 1) << 1; l = r - 1;\n worst = l < free_ && heap_[i]->betterThan( heap_[l] ) ? l : i;\n if( r < free_ && heap_[ worst ]->betterThan( heap_[r] ) )\n worst = r;\n if (worst != i)\n {\n QueryHit* temp = heap_[ worst ];\n heap_[ worst ] = heap_[ i ];\n heap_[i] = temp;\n i = worst; \/\/ continue\n }\n else\n break;\n }\n}\n\n\n\/\/ sal_Int32 HitStore::partition( sal_Int32 p,sal_Int32 r )\n\/\/ {\n\/\/ QueryHit* x = heap_[ ((p + r) >> 1) & 0x7FFFFFFF ];\n\/\/ sal_Int32 i = p - 1, j = r + 1;\n\/\/ while( true )\n\/\/ {\n\/\/ while( x->compareTo( heap_[--j] ) )\n\/\/ ;\n\/\/ while( heap_[++i]->compareTo( x ) )\n\/\/ ;\n\/\/ if( i < j )\n\/\/ {\n\/\/ QueryHit* t = heap_[i];\n\/\/ heap_[i] = heap_[j];\n\/\/ heap_[j] = t;\n\/\/ }\n\/\/ else\n\/\/ return j;\n\/\/ }\n\/\/ }\n\n\n\/\/ void HitStore::quicksort( sal_Int32 p,sal_Int32 r )\n\/\/ {\n\/\/ while( p < r )\n\/\/ {\n\/\/ sal_Int32 q = partition( p,r );\n\/\/ quicksort(p, q);\n\/\/ p = q + 1;\n\/\/ }\n\/\/ }\n\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* Query *\/\n\/* *\/\n\/******************************************************************************\/\n\n\n#define MissingTermPenalty 10.0\n\n\nQuery::Query( XmlIndex* env,\n sal_Int32 nColumns,\n sal_Int32 nHits,\n sal_Int32 missingPenaltiesL,\n double* missingPenalties )\n : env_( env ),\n ctx_( env ? env->getContextInfo() : 0 ),\n store_( nColumns * MissingTermPenalty - 0.0001,nHits,nColumns ),\n nHitsRequested_( nHits ),\n nColumns_( nColumns ),\n currentStandard_( nColumns * MissingTermPenalty - 0.0001 ),\n missingPenaltyL_( nColumns ),\n upperboundTemplateL_( nColumns ),\n penaltiesL_( missingPenaltiesL ),\n missingPenalty_( new double[ nColumns ] ),\n upperboundTemplate_( new double[ nColumns ] ),\n penalties_( missingPenalties ),\n ignoredElementsL_( 0 ),\n ignoredElements_( 0 ),\n missingTermsPenalty_( 0.0 )\n{\n \/\/ for the EmptyQuery case (awaits arch improvement pass)\n\n if( missingPenalties )\n for( sal_Int32 i = 0;i < nColumns_; ++i )\n missingPenalty_[i] = missingPenalties[i];\n else\n for( sal_Int32 i = 0;i < nColumns_; ++i )\n missingPenalty_[i] = MissingTermPenalty;\n\n makePenaltiesTable();\n \/\/ _roleFillerList = RoleFiller.STOP;\n}\n\n\nQuery::~Query()\n{\n delete[] missingPenalty_;\n delete[] upperboundTemplate_;\n delete[] penalties_;\n delete[] ignoredElements_;\n}\n\n\nvoid Query::setIgnoredElements( const sal_Int32 ignoredElementsL,const rtl::OUString* ignoredElements )\n{\n if( ctx_ )\n ignoredElements_ = ctx_->getIgnoredElementsSet( ignoredElementsL_,\n ignoredElementsL,ignoredElements );\n\n if( ! ctx_ )\n {\n ignoredElementsL_ = 0;\n ignoredElements_ = 0;\n }\n}\n\n\n\nvoid Query::missingTerms( sal_Int32 nMissingTerms )\n{\n missingTermsPenalty_ = MissingTermPenalty * nMissingTerms;\n}\n\n\n\nConceptData* Query::makeConceptData( sal_Int32 col,sal_Int32 concept,double penalty,sal_Int32 queryNo )\n{\n return new ConceptData( concept,col,penalty,queryNo,nColumns_,env_->getContextInfo() );;\n}\n\n\nvoid Query::getHits( std::vector< QueryHitData* >& data,sal_Int32 n )\n{\n if( n <= 0 )\n return;\n\n QueryHit* qh = store_.firstBestQueryHit();\n\n while( qh )\n {\n data.push_back( env_->hitToData( qh ) );\n qh = data.size() < sal_uInt32( n ) ? store_.nextBestQueryHit() : 0;\n }\n}\n\n\nQueryHit* Query::maybeCreateQueryHit( double penalty,\n sal_Int32 doc, sal_Int32 begin, sal_Int32 end, sal_Int32 parentContext )\n{\n \/\/ hits are located using only terms actually present in text\n \/\/ if B is not present, the query A B C reduces to A C and penalties\n \/\/ are computed as if B did not occur in query\n \/\/ to meaningfully merge results from different servers, some of which\n \/\/ may have B, penalty has to be normalized to the common computing scheme\n\n QueryHit* res =\n ( store_.goodEnough( penalty += missingTermsPenalty_,begin,end )\n && ( ! ignoredElements_ || ctx_->notIgnored( parentContext,ignoredElementsL_,ignoredElements_ ) ) )\n ?\n store_.createQueryHit( penalty,doc,begin,end )\n :\n 0;\n return res;\n}\n\n\nvoid Query::makePenaltiesTable()\n{\n sal_Int32 nPatterns = 1 << nColumns_;\n delete[] penalties_;\n penalties_ = new double[ penaltiesL_ = nPatterns ];\n for (sal_Int32 i = 0; i < nPatterns; ++i )\n penalties_[i] = computePenalty(i);\n}\n\n\ndouble Query::computePenalty( sal_Int32 n )\n{\n double penalty = 0.0;\n for( sal_Int32 i = 0; i < nColumns_; ++i )\n if( ( n & 1 << i ) == 0 )\n penalty += missingPenalty_[i];\n return penalty;\n}\n\n\nvoid Query::resetForNextDocument()\n{\n currentStandard_ = store_.getCurrentStandard();\n \/\/ \"everything's missing\"\n for( sal_Int32 i = 0; i < nColumns_; i++ )\n upperboundTemplate_[i] = missingPenalty_[i];\n vote_ = false;\n}\n\n\nbool Query::vote()\n{\n double sum = 0.0;\n for( sal_Int32 i = 0; i < nColumns_; i++ )\n sum += upperboundTemplate_[i];\n return vote_ = (sum <= currentStandard_ );\n}\n\n\nvoid Query::updateEstimate( sal_Int32 role,double penalty )\n{\n if( penalty < upperboundTemplate_[ role ] )\n upperboundTemplate_[ role ] = penalty;\n}\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* QueryHitIterator *\/\n\/* *\/\n\/******************************************************************************\/\n\n\n\nQueryHitIterator::QueryHitIterator( const QueryResults* result )\n : index_( -1 ),\n result_( result )\n{\n}\n\n\nQueryHitIterator::~QueryHitIterator()\n{\n delete result_;\n}\n\n\nbool QueryHitIterator::next()\n{\n return accessible_ = ( ++index_ < sal_Int32( result_->queryHits_.size() ) );\n}\n\n\nQueryHitData* QueryHitIterator::getHit( const PrefixTranslator* ) const\n{\n if( accessible_ )\n return result_->queryHits_[index_];\n else\n return 0;\n}\n\n\ndouble QueryHitIterator::getPenalty()\n{\n if( accessible_ )\n return result_->queryHits_[index_]->getPenalty();\n else\n return 1.0E30;\n}\n\n<commit_msg>INTEGRATION: CWS pchfix02 (1.10.8); FILE MERGED 2006\/09\/01 17:58:34 kaib 1.10.8.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: Query.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 01:19:32 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_xmlhelp.hxx\"\n#ifndef _XMLSEARCH_QE_QUERY_HXX_\n#include <qe\/Query.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_XMLINDEX_HXX_\n#include <qe\/XmlIndex.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_CONCEPTDATA_HXX_\n#include <qe\/ConceptData.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_QUERYPROCESSOR_HXX_\n#include <qe\/QueryProcessor.hxx>\n#endif\n#ifndef _XMLSEARCH_QE_CONTEXTTABLES_HXX_\n#include <qe\/ContextTables.hxx>\n#endif\n\n\nusing namespace xmlsearch::qe;\n\n\nsal_Int32* QueryHit::getMatches( sal_Int32& matchesL )\n{\n matchesL = matchesL_;\n return matches_;\n}\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* HitStore *\/\n\/* *\/\n\/******************************************************************************\/\n\n\nHitStore::HitStore( double initialStandard,sal_Int32 limit,sal_Int32 nColumns )\n : limit_( limit ),\n nColumns_( nColumns ),\n index_( 0 ),\n free_( 0 ),\n standard_( initialStandard ),\n heap_( limit )\n{\n for( sal_uInt32 i = 0; i < heap_.size(); ++i )\n heap_[i] = 0;\n}\n\n\n\nHitStore::~HitStore()\n{\n for( sal_uInt32 i = 0; i < heap_.size(); ++i )\n delete heap_[i];\n}\n\n\n\nbool HitStore::goodEnough( double penalty, sal_Int32 begin, sal_Int32 end )\n{\n return free_ == limit_ ? heap_[0]->worseThan( penalty,begin,end ) : true;\n}\n\n\nQueryHit* HitStore::createQueryHit( double penalty,sal_Int32 doc,sal_Int32 begin,sal_Int32 end )\n{\n QueryHit* hit = new QueryHit( nColumns_,penalty,doc,begin,end );\n if( free_ == limit_ )\n { \/\/ goodEnough'ness checked already\n delete heap_[0];\n heap_[0] = hit;\n heapify( 0 );\n standard_ = heap_[0]->getPenalty();\n }\n else if( free_ < limit_ )\n {\n heap_[ free_++ ] = hit;\n if( free_ == limit_ )\n { \/\/ we have the needed number\n for( sal_Int32 i = free_\/2; i >= 0; --i ) \/\/ build heap\n heapify( i );\n standard_ = heap_[0]->getPenalty();\n }\n }\n return hit;\n}\n\n\nstruct CompareQueryHit\n{\n bool operator()( const QueryHit* l,const QueryHit* r )\n {\n return l->compareTo( r );\n }\n};\n\n\n#include <algorithm>\n\n\nQueryHit* HitStore::firstBestQueryHit()\n{\n if( free_ > 0)\n {\n CompareQueryHit bla;\n heap_.resize( free_ );\n std::stable_sort( heap_.begin(),heap_.end(),bla );\n index_ = 0;\n return nextBestQueryHit();\n }\n else\n return 0;\n}\n\n\nQueryHit* HitStore::nextBestQueryHit()\n{\n return index_ < free_ ? heap_[ index_++ ] : 0;\n}\n\n\nvoid HitStore::heapify( sal_Int32 i )\n{\n for( sal_Int32 r,l,worst; ; )\n {\n r = (i + 1) << 1; l = r - 1;\n worst = l < free_ && heap_[i]->betterThan( heap_[l] ) ? l : i;\n if( r < free_ && heap_[ worst ]->betterThan( heap_[r] ) )\n worst = r;\n if (worst != i)\n {\n QueryHit* temp = heap_[ worst ];\n heap_[ worst ] = heap_[ i ];\n heap_[i] = temp;\n i = worst; \/\/ continue\n }\n else\n break;\n }\n}\n\n\n\/\/ sal_Int32 HitStore::partition( sal_Int32 p,sal_Int32 r )\n\/\/ {\n\/\/ QueryHit* x = heap_[ ((p + r) >> 1) & 0x7FFFFFFF ];\n\/\/ sal_Int32 i = p - 1, j = r + 1;\n\/\/ while( true )\n\/\/ {\n\/\/ while( x->compareTo( heap_[--j] ) )\n\/\/ ;\n\/\/ while( heap_[++i]->compareTo( x ) )\n\/\/ ;\n\/\/ if( i < j )\n\/\/ {\n\/\/ QueryHit* t = heap_[i];\n\/\/ heap_[i] = heap_[j];\n\/\/ heap_[j] = t;\n\/\/ }\n\/\/ else\n\/\/ return j;\n\/\/ }\n\/\/ }\n\n\n\/\/ void HitStore::quicksort( sal_Int32 p,sal_Int32 r )\n\/\/ {\n\/\/ while( p < r )\n\/\/ {\n\/\/ sal_Int32 q = partition( p,r );\n\/\/ quicksort(p, q);\n\/\/ p = q + 1;\n\/\/ }\n\/\/ }\n\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* Query *\/\n\/* *\/\n\/******************************************************************************\/\n\n\n#define MissingTermPenalty 10.0\n\n\nQuery::Query( XmlIndex* env,\n sal_Int32 nColumns,\n sal_Int32 nHits,\n sal_Int32 missingPenaltiesL,\n double* missingPenalties )\n : env_( env ),\n ctx_( env ? env->getContextInfo() : 0 ),\n store_( nColumns * MissingTermPenalty - 0.0001,nHits,nColumns ),\n nHitsRequested_( nHits ),\n nColumns_( nColumns ),\n currentStandard_( nColumns * MissingTermPenalty - 0.0001 ),\n missingPenaltyL_( nColumns ),\n upperboundTemplateL_( nColumns ),\n penaltiesL_( missingPenaltiesL ),\n missingPenalty_( new double[ nColumns ] ),\n upperboundTemplate_( new double[ nColumns ] ),\n penalties_( missingPenalties ),\n ignoredElementsL_( 0 ),\n ignoredElements_( 0 ),\n missingTermsPenalty_( 0.0 )\n{\n \/\/ for the EmptyQuery case (awaits arch improvement pass)\n\n if( missingPenalties )\n for( sal_Int32 i = 0;i < nColumns_; ++i )\n missingPenalty_[i] = missingPenalties[i];\n else\n for( sal_Int32 i = 0;i < nColumns_; ++i )\n missingPenalty_[i] = MissingTermPenalty;\n\n makePenaltiesTable();\n \/\/ _roleFillerList = RoleFiller.STOP;\n}\n\n\nQuery::~Query()\n{\n delete[] missingPenalty_;\n delete[] upperboundTemplate_;\n delete[] penalties_;\n delete[] ignoredElements_;\n}\n\n\nvoid Query::setIgnoredElements( const sal_Int32 ignoredElementsL,const rtl::OUString* ignoredElements )\n{\n if( ctx_ )\n ignoredElements_ = ctx_->getIgnoredElementsSet( ignoredElementsL_,\n ignoredElementsL,ignoredElements );\n\n if( ! ctx_ )\n {\n ignoredElementsL_ = 0;\n ignoredElements_ = 0;\n }\n}\n\n\n\nvoid Query::missingTerms( sal_Int32 nMissingTerms )\n{\n missingTermsPenalty_ = MissingTermPenalty * nMissingTerms;\n}\n\n\n\nConceptData* Query::makeConceptData( sal_Int32 col,sal_Int32 concept,double penalty,sal_Int32 queryNo )\n{\n return new ConceptData( concept,col,penalty,queryNo,nColumns_,env_->getContextInfo() );;\n}\n\n\nvoid Query::getHits( std::vector< QueryHitData* >& data,sal_Int32 n )\n{\n if( n <= 0 )\n return;\n\n QueryHit* qh = store_.firstBestQueryHit();\n\n while( qh )\n {\n data.push_back( env_->hitToData( qh ) );\n qh = data.size() < sal_uInt32( n ) ? store_.nextBestQueryHit() : 0;\n }\n}\n\n\nQueryHit* Query::maybeCreateQueryHit( double penalty,\n sal_Int32 doc, sal_Int32 begin, sal_Int32 end, sal_Int32 parentContext )\n{\n \/\/ hits are located using only terms actually present in text\n \/\/ if B is not present, the query A B C reduces to A C and penalties\n \/\/ are computed as if B did not occur in query\n \/\/ to meaningfully merge results from different servers, some of which\n \/\/ may have B, penalty has to be normalized to the common computing scheme\n\n QueryHit* res =\n ( store_.goodEnough( penalty += missingTermsPenalty_,begin,end )\n && ( ! ignoredElements_ || ctx_->notIgnored( parentContext,ignoredElementsL_,ignoredElements_ ) ) )\n ?\n store_.createQueryHit( penalty,doc,begin,end )\n :\n 0;\n return res;\n}\n\n\nvoid Query::makePenaltiesTable()\n{\n sal_Int32 nPatterns = 1 << nColumns_;\n delete[] penalties_;\n penalties_ = new double[ penaltiesL_ = nPatterns ];\n for (sal_Int32 i = 0; i < nPatterns; ++i )\n penalties_[i] = computePenalty(i);\n}\n\n\ndouble Query::computePenalty( sal_Int32 n )\n{\n double penalty = 0.0;\n for( sal_Int32 i = 0; i < nColumns_; ++i )\n if( ( n & 1 << i ) == 0 )\n penalty += missingPenalty_[i];\n return penalty;\n}\n\n\nvoid Query::resetForNextDocument()\n{\n currentStandard_ = store_.getCurrentStandard();\n \/\/ \"everything's missing\"\n for( sal_Int32 i = 0; i < nColumns_; i++ )\n upperboundTemplate_[i] = missingPenalty_[i];\n vote_ = false;\n}\n\n\nbool Query::vote()\n{\n double sum = 0.0;\n for( sal_Int32 i = 0; i < nColumns_; i++ )\n sum += upperboundTemplate_[i];\n return vote_ = (sum <= currentStandard_ );\n}\n\n\nvoid Query::updateEstimate( sal_Int32 role,double penalty )\n{\n if( penalty < upperboundTemplate_[ role ] )\n upperboundTemplate_[ role ] = penalty;\n}\n\n\n\/******************************************************************************\/\n\/* *\/\n\/* QueryHitIterator *\/\n\/* *\/\n\/******************************************************************************\/\n\n\n\nQueryHitIterator::QueryHitIterator( const QueryResults* result )\n : index_( -1 ),\n result_( result )\n{\n}\n\n\nQueryHitIterator::~QueryHitIterator()\n{\n delete result_;\n}\n\n\nbool QueryHitIterator::next()\n{\n return accessible_ = ( ++index_ < sal_Int32( result_->queryHits_.size() ) );\n}\n\n\nQueryHitData* QueryHitIterator::getHit( const PrefixTranslator* ) const\n{\n if( accessible_ )\n return result_->queryHits_[index_];\n else\n return 0;\n}\n\n\ndouble QueryHitIterator::getPenalty()\n{\n if( accessible_ )\n return result_->queryHits_[index_]->getPenalty();\n else\n return 1.0E30;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) Facebook, Inc. and its affiliates.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <folly\/Portability.h>\n#include <folly\/io\/async\/EventBase.h>\n#include <gtest\/gtest.h>\n#include <vector>\n\n#include \"yarpl\/Flowable.h\"\n#include \"yarpl\/flowable\/TestSubscriber.h\"\n#include \"yarpl\/flowable\/ThriftStreamShim.h\"\n\nusing namespace yarpl::flowable;\n\ntemplate <typename T>\nstd::vector<T> run(\n std::shared_ptr<Flowable<T>> flowable,\n int64_t requestCount = 100) {\n auto subscriber = std::make_shared<TestSubscriber<T>>(requestCount);\n flowable->subscribe(subscriber);\n subscriber->awaitTerminalEvent(std::chrono::seconds(1));\n return std::move(subscriber->values());\n}\ntemplate <typename T>\nstd::vector<T> run(apache::thrift::ServerStream<T>&& stream) {\n std::vector<T> values;\n std::move(stream).toClientStreamUnsafeDoNotUse().subscribeInline([&](auto&& val) {\n if (val.hasValue()) {\n values.push_back(std::move(*val));\n }\n });\n return values;\n}\n\napache::thrift::ClientBufferedStream<int> makeRange(int start, int count) {\n auto streamAndPublisher =\n apache::thrift::ServerStream<int>::createPublisher();\n for (int i = 0; i < count; ++i) {\n streamAndPublisher.second.next(i + start);\n }\n std::move(streamAndPublisher.second).complete();\n return std::move(streamAndPublisher.first).toClientStreamUnsafeDoNotUse();\n}\n\nTEST(ThriftStreamShimTest, ClientStream) {\n auto flowable = ThriftStreamShim::fromClientStream(\n makeRange(1, 5), folly::getEventBase());\n EXPECT_EQ(run(flowable), std::vector<int>({1, 2, 3, 4, 5}));\n}\n\nTEST(ThriftStreamShimTest, ServerStream) {\n auto stream = ThriftStreamShim::toServerStream(Flowable<>::range(1, 5));\n EXPECT_EQ(run(std::move(stream)), std::vector<long>({1, 2, 3, 4, 5}));\n\n stream = ThriftStreamShim::toServerStream(Flowable<long>::never());\n auto sub = std::move(stream).toClientStreamUnsafeDoNotUse().subscribeExTry(\n folly::getEventBase(), [](auto) {});\n sub.cancel();\n std::move(sub).join();\n\n ThriftStreamShim::toServerStream(Flowable<>::just(std::make_unique<int>(42)));\n}\n<commit_msg>Remove dead includes in yarpl<commit_after>\/\/ Copyright (c) Facebook, Inc. and its affiliates.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <folly\/io\/async\/EventBase.h>\n#include <gtest\/gtest.h>\n#include <vector>\n\n#include \"yarpl\/Flowable.h\"\n#include \"yarpl\/flowable\/TestSubscriber.h\"\n#include \"yarpl\/flowable\/ThriftStreamShim.h\"\n\nusing namespace yarpl::flowable;\n\ntemplate <typename T>\nstd::vector<T> run(\n std::shared_ptr<Flowable<T>> flowable,\n int64_t requestCount = 100) {\n auto subscriber = std::make_shared<TestSubscriber<T>>(requestCount);\n flowable->subscribe(subscriber);\n subscriber->awaitTerminalEvent(std::chrono::seconds(1));\n return std::move(subscriber->values());\n}\ntemplate <typename T>\nstd::vector<T> run(apache::thrift::ServerStream<T>&& stream) {\n std::vector<T> values;\n std::move(stream).toClientStreamUnsafeDoNotUse().subscribeInline([&](auto&& val) {\n if (val.hasValue()) {\n values.push_back(std::move(*val));\n }\n });\n return values;\n}\n\napache::thrift::ClientBufferedStream<int> makeRange(int start, int count) {\n auto streamAndPublisher =\n apache::thrift::ServerStream<int>::createPublisher();\n for (int i = 0; i < count; ++i) {\n streamAndPublisher.second.next(i + start);\n }\n std::move(streamAndPublisher.second).complete();\n return std::move(streamAndPublisher.first).toClientStreamUnsafeDoNotUse();\n}\n\nTEST(ThriftStreamShimTest, ClientStream) {\n auto flowable = ThriftStreamShim::fromClientStream(\n makeRange(1, 5), folly::getEventBase());\n EXPECT_EQ(run(flowable), std::vector<int>({1, 2, 3, 4, 5}));\n}\n\nTEST(ThriftStreamShimTest, ServerStream) {\n auto stream = ThriftStreamShim::toServerStream(Flowable<>::range(1, 5));\n EXPECT_EQ(run(std::move(stream)), std::vector<long>({1, 2, 3, 4, 5}));\n\n stream = ThriftStreamShim::toServerStream(Flowable<long>::never());\n auto sub = std::move(stream).toClientStreamUnsafeDoNotUse().subscribeExTry(\n folly::getEventBase(), [](auto) {});\n sub.cancel();\n std::move(sub).join();\n\n ThriftStreamShim::toServerStream(Flowable<>::just(std::make_unique<int>(42)));\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2018 Kristofer Björnson\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file Greens.cpp\n *\n * @author Kristofer Björnson\n *\/\n\n#include \"TBTK\/PropertyExtractor\/Greens.h\"\n#include \"TBTK\/Functions.h\"\n#include \"TBTK\/Streams.h\"\n#include \"TBTK\/TBTKMacros.h\"\n\n#include <set>\n\nusing namespace std;\n\nnamespace TBTK{\nnamespace PropertyExtractor{\n\nGreens::Greens(Solver::Greens &solver){\n\tthis->solver = &solver;\n}\n\nGreens::~Greens(){\n}\n\nvoid Greens::setEnergyWindow(\n\tdouble lowerBound,\n\tdouble upperBound,\n\tint energyResolution\n){\n\tTBTKExit(\n\t\t\"PropertyExtractor::Greens::setEnergyWindow()\",\n\t\t\"This function is not supported by this PropertyExtractor.\",\n\t\t\"The energy window is instead determined by the Green's\"\n\t\t<< \" function that is used by the corresponding solver. Use\"\n\t\t<< \" Solver::Greens::setGreensFunction() to set this Green's\"\n\t\t<< \" function.\"\n\t);\n}\n\nProperty::Density Greens::calculateDensity(\n\tIndex pattern,\n\tIndex ranges\n){\n\tensureCompliantRanges(pattern, ranges);\n\n\tvector<int> loopRanges = getLoopRanges(pattern, ranges);\n\tProperty::Density density(loopRanges);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateDensityCallback,\n\t\tdensity,\n\t\tpattern,\n\t\tranges,\n\t\t0,\n\t\t1,\n\t\tinformation\n\t);\n\n\treturn density;\n}\n\nProperty::Density Greens::calculateDensity(\n\tvector<Index> patterns\n){\n\tvalidatePatternsNumComponents(\n\t\tpatterns,\n\t\t1,\n\t\t\"PropertyExtractor::Greens::calculateDensity()\"\n\t);\n\tvalidatePatternsSpecifiers(\n\t\tpatterns,\n\t\t{IDX_ALL, IDX_SUM_ALL},\n\t\t\"PropertyExtractor::Greens::calculateDensity()\"\n\t);\n\n\tIndexTree allIndices = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\tfalse,\n\t\tfalse\n\t);\n\n\tIndexTree memoryLayout = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tProperty::Density density(memoryLayout);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateDensityCallback,\n\t\tallIndices,\n\t\tmemoryLayout,\n\t\tdensity,\n\t\tinformation\n\t);\n\n\treturn density;\n}\n\nProperty::LDOS Greens::calculateLDOS(\n\tvector<Index> patterns\n){\n\tvalidatePatternsNumComponents(\n\t\tpatterns,\n\t\t1,\n\t\t\"PropertyExtractor::Greens::calculateLDOS()\"\n\t);\n\tvalidatePatternsSpecifiers(\n\t\tpatterns,\n\t\t{IDX_ALL, IDX_SUM_ALL},\n\t\t\"PropertyExtractor::Greens::calculateLDOS()\"\n\t);\n\n\tIndexTree allIndices = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\tfalse,\n\t\ttrue\n\t);\n\n\tIndexTree memoryLayout = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tProperty::LDOS ldos(\n\t\tmemoryLayout,\n\t\tsolver->getGreensFunction().getLowerBound(),\n\t\tsolver->getGreensFunction().getUpperBound(),\n\t\tsolver->getGreensFunction().getResolution()\n\t);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateLDOSCallback,\n\t\tallIndices,\n\t\tmemoryLayout,\n\t\tldos,\n\t\tinformation\n\t);\n\n\treturn ldos;\n}\n\nvoid Greens::calculateDensityCallback(\n\tPropertyExtractor *cb_this,\n\tProperty::Property &property,\n\tconst Index &index,\n\tint offset,\n\tInformation &information\n){\n\tGreens *propertyExtractor = (Greens*)cb_this;\n\tProperty::Density &density = (Property::Density&)property;\n\tvector<double> &data = density.getDataRW();\n\n\tconst Property::GreensFunction &greensFunction\n\t\t= propertyExtractor->solver->getGreensFunction();\n\n\tStatistics statistics = propertyExtractor->solver->getModel().getStatistics();\n\n\tswitch(greensFunction.getType()){\n\tcase Property::GreensFunction::Type::Retarded:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int e = 0; e < energyResolution; e++){\n\t\t\tdouble E = lowerBound + e*dE;\n\n\t\t\tdouble weight;\n\t\t\tif(statistics == Statistics::FermiDirac){\n\t\t\t\tweight = Functions::fermiDiracDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getTemperature()\n\t\t\t\t);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tweight = Functions::boseEinsteinDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tdata[offset] += -weight*imag(\n\t\t\t\tgreensFunction({index, index}, e)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Advanced:\n\tcase Property::GreensFunction::Type::NonPrincipal:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int e = 0; e < energyResolution; e++){\n\t\t\tdouble E = lowerBound + e*dE;\n\n\t\t\tdouble weight;\n\t\t\tif(statistics == Statistics::FermiDirac){\n\t\t\t\tweight = Functions::fermiDiracDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tweight = Functions::boseEinsteinDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tdata[offset] += weight*imag(\n\t\t\t\tgreensFunction({index, index}, e)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Principal:\n\tdefault:\n\t\tTBTKExit(\n\t\t\t\"PropertyExtractor::Greens::calculateDensityCallback()\",\n\t\t\t\"Only calculation of the Density from the Retarded,\"\n\t\t\t<< \" Advanced, and NonPrincipal Green's function\"\n\t\t\t<< \" is supported yet.\",\n\t\t\t\"\"\n\t\t);\n\t}\n}\n\nvoid Greens::calculateLDOSCallback(\n\tPropertyExtractor *cb_this,\n\tProperty::Property &property,\n\tconst Index &index,\n\tint offset,\n\tInformation &information\n){\n\tGreens *propertyExtractor = (Greens*)cb_this;\n\tProperty::LDOS &ldos = (Property::LDOS&)property;\n\tvector<double> &data = ldos.getDataRW();\n\n\tconst Property::GreensFunction &greensFunction\n\t\t= propertyExtractor->solver->getGreensFunction();\n\n\tswitch(greensFunction.getType()){\n\tcase Property::GreensFunction::Type::Retarded:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int n = 0; n < energyResolution; n++){\n\t\t\tdata[offset + n] -= imag(\n\t\t\t\tgreensFunction({index, index}, n)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Advanced:\n\tcase Property::GreensFunction::Type::NonPrincipal:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int n = 0; n < energyResolution; n++){\n\t\t\tdata[offset + n] += imag(\n\t\t\t\tgreensFunction({index, index}, n)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Principal:\n\tdefault:\n\t\tTBTKExit(\n\t\t\t\"PropertyExtractor::Greens::calculateDensityCallback()\",\n\t\t\t\"Only calculation of the Density from the Retarded,\"\n\t\t\t<< \" Advanced, and NonPrincipal Green's function\"\n\t\t\t<< \" is supported yet.\",\n\t\t\t\"\"\n\t\t);\n\t}\n}\n\n};\t\/\/End of namespace PropertyExtractor\n};\t\/\/End of namespace TBTK\n<commit_msg>Added density calculation for Matsubara Green's functions to PropertyExtractor::Greens.<commit_after>\/* Copyright 2018 Kristofer Björnson\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/** @file Greens.cpp\n *\n * @author Kristofer Björnson\n *\/\n\n#include \"TBTK\/PropertyExtractor\/Greens.h\"\n#include \"TBTK\/Functions.h\"\n#include \"TBTK\/Streams.h\"\n#include \"TBTK\/TBTKMacros.h\"\n\n#include <set>\n\nusing namespace std;\n\nnamespace TBTK{\nnamespace PropertyExtractor{\n\nGreens::Greens(Solver::Greens &solver){\n\tthis->solver = &solver;\n}\n\nGreens::~Greens(){\n}\n\nvoid Greens::setEnergyWindow(\n\tdouble lowerBound,\n\tdouble upperBound,\n\tint energyResolution\n){\n\tTBTKExit(\n\t\t\"PropertyExtractor::Greens::setEnergyWindow()\",\n\t\t\"This function is not supported by this PropertyExtractor.\",\n\t\t\"The energy window is instead determined by the Green's\"\n\t\t<< \" function that is used by the corresponding solver. Use\"\n\t\t<< \" Solver::Greens::setGreensFunction() to set this Green's\"\n\t\t<< \" function.\"\n\t);\n}\n\nProperty::Density Greens::calculateDensity(\n\tIndex pattern,\n\tIndex ranges\n){\n\tensureCompliantRanges(pattern, ranges);\n\n\tvector<int> loopRanges = getLoopRanges(pattern, ranges);\n\tProperty::Density density(loopRanges);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateDensityCallback,\n\t\tdensity,\n\t\tpattern,\n\t\tranges,\n\t\t0,\n\t\t1,\n\t\tinformation\n\t);\n\n\treturn density;\n}\n\nProperty::Density Greens::calculateDensity(\n\tvector<Index> patterns\n){\n\tvalidatePatternsNumComponents(\n\t\tpatterns,\n\t\t1,\n\t\t\"PropertyExtractor::Greens::calculateDensity()\"\n\t);\n\tvalidatePatternsSpecifiers(\n\t\tpatterns,\n\t\t{IDX_ALL, IDX_SUM_ALL},\n\t\t\"PropertyExtractor::Greens::calculateDensity()\"\n\t);\n\n\tIndexTree allIndices = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\tfalse,\n\t\tfalse\n\t);\n\n\tIndexTree memoryLayout = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tProperty::Density density(memoryLayout);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateDensityCallback,\n\t\tallIndices,\n\t\tmemoryLayout,\n\t\tdensity,\n\t\tinformation\n\t);\n\n\treturn density;\n}\n\nProperty::LDOS Greens::calculateLDOS(\n\tvector<Index> patterns\n){\n\tvalidatePatternsNumComponents(\n\t\tpatterns,\n\t\t1,\n\t\t\"PropertyExtractor::Greens::calculateLDOS()\"\n\t);\n\tvalidatePatternsSpecifiers(\n\t\tpatterns,\n\t\t{IDX_ALL, IDX_SUM_ALL},\n\t\t\"PropertyExtractor::Greens::calculateLDOS()\"\n\t);\n\n\tIndexTree allIndices = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\tfalse,\n\t\ttrue\n\t);\n\n\tIndexTree memoryLayout = generateIndexTree(\n\t\tpatterns,\n\t\tsolver->getModel().getHoppingAmplitudeSet(),\n\t\ttrue,\n\t\ttrue\n\t);\n\n\tProperty::LDOS ldos(\n\t\tmemoryLayout,\n\t\tsolver->getGreensFunction().getLowerBound(),\n\t\tsolver->getGreensFunction().getUpperBound(),\n\t\tsolver->getGreensFunction().getResolution()\n\t);\n\n\tInformation information;\n\tcalculate(\n\t\tcalculateLDOSCallback,\n\t\tallIndices,\n\t\tmemoryLayout,\n\t\tldos,\n\t\tinformation\n\t);\n\n\treturn ldos;\n}\n\nvoid Greens::calculateDensityCallback(\n\tPropertyExtractor *cb_this,\n\tProperty::Property &property,\n\tconst Index &index,\n\tint offset,\n\tInformation &information\n){\n\tGreens *propertyExtractor = (Greens*)cb_this;\n\tProperty::Density &density = (Property::Density&)property;\n\tvector<double> &data = density.getDataRW();\n\n\tconst Property::GreensFunction &greensFunction\n\t\t= propertyExtractor->solver->getGreensFunction();\n\n\tStatistics statistics = propertyExtractor->solver->getModel().getStatistics();\n\n\tswitch(greensFunction.getType()){\n\tcase Property::GreensFunction::Type::Retarded:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int e = 0; e < energyResolution; e++){\n\t\t\tdouble E = lowerBound + e*dE;\n\n\t\t\tdouble weight;\n\t\t\tif(statistics == Statistics::FermiDirac){\n\t\t\t\tweight = Functions::fermiDiracDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getTemperature()\n\t\t\t\t);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tweight = Functions::boseEinsteinDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tdata[offset] += -weight*imag(\n\t\t\t\tgreensFunction({index, index}, e)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Advanced:\n\tcase Property::GreensFunction::Type::NonPrincipal:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int e = 0; e < energyResolution; e++){\n\t\t\tdouble E = lowerBound + e*dE;\n\n\t\t\tdouble weight;\n\t\t\tif(statistics == Statistics::FermiDirac){\n\t\t\t\tweight = Functions::fermiDiracDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tweight = Functions::boseEinsteinDistribution(\n\t\t\t\t\tE,\n\t\t\t\t\tpropertyExtractor->solver->getModel(\n\t\t\t\t\t).getChemicalPotential(),\n\t\t\t\t\tpropertyExtractor->solver->getModel().getTemperature()\n\t\t\t\t);\n\t\t\t}\n\n\t\t\tdata[offset] += weight*imag(\n\t\t\t\tgreensFunction({index, index}, e)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Matsubara:\n\t{\n\t\tfor(\n\t\t\tunsigned int e = 0;\n\t\t\te < greensFunction.getNumMatsubaraEnergies();\n\t\t\te++\n\t\t){\n\t\t\tdata[offset] += real(greensFunction({index, index}, e));\n\t\t}\n\n\t\tdata[offset]\n\t\t\t*= greensFunction.getFundamentalMatsubaraEnergy()\/M_PI;\n\n\t\tdata[offset] += 1\/2.;\n\n\t\tbreak;\n\t}\n\tdefault:\n\t\tTBTKExit(\n\t\t\t\"PropertyExtractor::Greens::calculateDensityCallback()\",\n\t\t\t\"Only calculation of the Density from the Retarded,\"\n\t\t\t<< \" Advanced, and NonPrincipal Green's function\"\n\t\t\t<< \" is supported yet.\",\n\t\t\t\"\"\n\t\t);\n\t}\n}\n\nvoid Greens::calculateLDOSCallback(\n\tPropertyExtractor *cb_this,\n\tProperty::Property &property,\n\tconst Index &index,\n\tint offset,\n\tInformation &information\n){\n\tGreens *propertyExtractor = (Greens*)cb_this;\n\tProperty::LDOS &ldos = (Property::LDOS&)property;\n\tvector<double> &data = ldos.getDataRW();\n\n\tconst Property::GreensFunction &greensFunction\n\t\t= propertyExtractor->solver->getGreensFunction();\n\n\tswitch(greensFunction.getType()){\n\tcase Property::GreensFunction::Type::Retarded:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int n = 0; n < energyResolution; n++){\n\t\t\tdata[offset + n] -= imag(\n\t\t\t\tgreensFunction({index, index}, n)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tcase Property::GreensFunction::Type::Advanced:\n\tcase Property::GreensFunction::Type::NonPrincipal:\n\t{\n\t\tdouble lowerBound = greensFunction.getLowerBound();\n\t\tdouble upperBound = greensFunction.getUpperBound();\n\t\tint energyResolution = greensFunction.getResolution();\n\n\t\tconst double dE = (upperBound - lowerBound)\/energyResolution;\n\t\tfor(int n = 0; n < energyResolution; n++){\n\t\t\tdata[offset + n] += imag(\n\t\t\t\tgreensFunction({index, index}, n)\n\t\t\t)\/M_PI*dE;\n\t\t}\n\n\t\tbreak;\n\t}\n\tdefault:\n\t\tTBTKExit(\n\t\t\t\"PropertyExtractor::Greens::calculateDensityCallback()\",\n\t\t\t\"Only calculation of the Density from the Retarded,\"\n\t\t\t<< \" Advanced, and NonPrincipal Green's function\"\n\t\t\t<< \" is supported yet.\",\n\t\t\t\"\"\n\t\t);\n\t}\n}\n\n};\t\/\/End of namespace PropertyExtractor\n};\t\/\/End of namespace TBTK\n<|endoftext|>"} {"text":"<commit_before>\/\/===========================================\n\/\/ Lumina-DE source code\n\/\/ Copyright (c) 2014, Ken Moore\n\/\/ Available under the 3-clause BSD license\n\/\/ See the LICENSE file for full details\n\/\/===========================================\n#include \"SysMenuQuick.h\"\n#include \"ui_SysMenuQuick.h\"\n\n#include \"..\/..\/LSession.h\"\n#include <LuminaX11.h>\n\nLSysMenuQuick::LSysMenuQuick(QWidget *parent) : QWidget(parent), ui(new Ui::LSysMenuQuick){\n ui->setupUi(this);\n settings = new QSettings(\"panel-plugins\",\"systemdashboard\");\n \/\/Now reset the initial saved settings (if any)\n LOS::setScreenBrightness( settings->value(\"screenbrightness\",100).toInt() ); \/\/default to 100%\n LOS::setAudioVolume( settings->value(\"audiovolume\", 100).toInt() ); \/\/default to 100%\n \/\/Now setup the connections\n connect(ui->slider_volume, SIGNAL(valueChanged(int)), this, SLOT(volSliderChanged()) );\n connect(ui->slider_brightness, SIGNAL(valueChanged(int)), this, SLOT(brightSliderChanged()) );\n connect(ui->tool_wk_prev, SIGNAL(clicked()), this, SLOT(prevWorkspace()) );\n connect(ui->tool_wk_next, SIGNAL(clicked()), this, SLOT(nextWorkspace()) );\n connect(ui->tool_logout, SIGNAL(clicked()), this, SLOT(startLogout()) );\n connect(ui->tool_vol_mixer, SIGNAL(clicked()), this, SLOT(startMixer()) );\n \/\/And setup the default icons\n ui->label_bright_icon->setPixmap( LXDG::findIcon(\"preferences-system-power-management\",\"\").pixmap(ui->label_bright_icon->maximumSize()) );\n ui->tool_wk_prev->setIcon( LXDG::findIcon(\"go-previous-view\",\"\"));\n ui->tool_wk_next->setIcon( LXDG::findIcon(\"go-next-view\",\"\") );\n ui->tool_logout->setIcon( LXDG::findIcon(\"system-log-out\",\"\") );\n}\n\nLSysMenuQuick::~LSysMenuQuick(){\n\t\n}\n\nvoid LSysMenuQuick::UpdateMenu(){\n \/\/Audio Volume\n int val = LOS::audioVolume();\t\n QIcon ico;\n if(val > 66){ ico= LXDG::findIcon(\"audio-volume-high\",\"\"); }\n else if(val > 33){ ico= LXDG::findIcon(\"audio-volume-medium\",\"\"); }\n else if(val > 0){ ico= LXDG::findIcon(\"audio-volume-low\",\"\"); }\n else{ ico= LXDG::findIcon(\"audio-volume-muted\",\"\"); }\n bool hasMixer = LOS::hasMixerUtility();\n ui->label_vol_icon->setVisible(!hasMixer);\n ui->tool_vol_mixer->setVisible(hasMixer);\n if(!hasMixer){ ui->label_vol_icon->setPixmap( ico.pixmap(ui->label_vol_icon->maximumSize()) ); }\n else{ ui->tool_vol_mixer->setIcon(ico); }\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_vol_text->setText(txt);\n if(ui->slider_volume->value()!= val){ ui->slider_volume->setValue(val); }\n \/\/Screen Brightness\n val = LOS::ScreenBrightness();\n txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_bright_text->setText(txt);\n if(ui->slider_brightness->value()!=val){ ui->slider_brightness->setValue(val); }\n \/\/Battery Status\n if(LOS::hasBattery()){\n ui->group_battery->setVisible(true);\n val = LOS::batteryCharge();\n if(LOS::batteryIsCharging()){\n if(val < 15){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-low\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 30){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-caution\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 50){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-040\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 70){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-060\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 90){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-080\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else{ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n ui->label_bat_text->setText( QString(\"%1%\\n(%2)\").arg(QString::number(val), tr(\"connected\")) );\n }else{\n if(val < 1){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-missing\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 15){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-low\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 30){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-caution\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 50){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-040\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 70){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-060\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 90){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-080\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else{ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-100\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n ui->label_bat_text->setText( QString(\"%1%\\n(%2)\").arg(QString::number(val), getRemainingTime()) );\n }\n }else{\n ui->group_battery->setVisible(false);\n }\n \/\/Workspace\n val = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n ui->group_workspace->setVisible(val>=0 && tot>1);\n ui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(val+1), QString::number(tot)) );\n}\n\nvoid LSysMenuQuick::volSliderChanged(){\n int val = ui->slider_volume->value();\n LOS::setAudioVolume(val);\n settings->setValue(\"audiovolume\",val);\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_vol_text->setText( txt );\n if(val > 66){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-high\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else if(val > 33){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-medium\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else if(val > 0){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-low\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else{ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-muted\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n}\n\nvoid LSysMenuQuick::startMixer(){\n emit CloseMenu();\n LOS::startMixerUtility();\n}\n\nvoid LSysMenuQuick::brightSliderChanged(){\n int val = ui->slider_brightness->value();\n LOS::setScreenBrightness(val);\n settings->setValue(\"screenbrightness\",val);\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_bright_text->setText( txt );\n}\n\nvoid LSysMenuQuick::nextWorkspace(){\n int cur = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n cur++;\n if(cur>=tot){ cur = 0; } \/\/back to beginning\n LX11::SetCurrentDesktop(cur);\nui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(cur+1), QString::number(tot)) );\n}\n\nvoid LSysMenuQuick::prevWorkspace(){\n int cur = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n cur--;\n if(cur<0){ cur = tot-1; } \/\/back to last\n LX11::SetCurrentDesktop(cur);\n ui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(cur+1), QString::number(tot)) );\t\n}\n\nQString LSysMenuQuick::getRemainingTime(){\n int secs = LOS::batterySecondsLeft();\n if(secs < 0){ return \"??\"; }\n QString rem; \/\/remaining\n if(secs > 3600){\n int hours = secs\/3600;\n rem.append( QString::number(hours)+\"h \");\n secs = secs - (hours*3600);\n }\n if(secs > 60){\n int min = secs\/60;\n rem.append( QString::number(min)+\"m \");\n secs = secs - (min*60);\n }\n if(secs > 0){\n rem.append( QString::number(secs)+\"s\");\n }else{\n rem.append( \"0s\" );\n }\n return rem;\n}\n\nvoid LSysMenuQuick::startLogout(){\n emit CloseMenu();\n LSession::handle()->systemWindow();\n}\n<commit_msg>Oops, make sure that if brightness controls are not available, that the system dashboard hides that control option.<commit_after>\/\/===========================================\n\/\/ Lumina-DE source code\n\/\/ Copyright (c) 2014, Ken Moore\n\/\/ Available under the 3-clause BSD license\n\/\/ See the LICENSE file for full details\n\/\/===========================================\n#include \"SysMenuQuick.h\"\n#include \"ui_SysMenuQuick.h\"\n\n#include \"..\/..\/LSession.h\"\n#include <LuminaX11.h>\n\nLSysMenuQuick::LSysMenuQuick(QWidget *parent) : QWidget(parent), ui(new Ui::LSysMenuQuick){\n ui->setupUi(this);\n settings = new QSettings(\"panel-plugins\",\"systemdashboard\");\n \/\/Now reset the initial saved settings (if any)\n LOS::setScreenBrightness( settings->value(\"screenbrightness\",100).toInt() ); \/\/default to 100%\n LOS::setAudioVolume( settings->value(\"audiovolume\", 100).toInt() ); \/\/default to 100%\n \/\/Now setup the connections\n connect(ui->slider_volume, SIGNAL(valueChanged(int)), this, SLOT(volSliderChanged()) );\n connect(ui->slider_brightness, SIGNAL(valueChanged(int)), this, SLOT(brightSliderChanged()) );\n connect(ui->tool_wk_prev, SIGNAL(clicked()), this, SLOT(prevWorkspace()) );\n connect(ui->tool_wk_next, SIGNAL(clicked()), this, SLOT(nextWorkspace()) );\n connect(ui->tool_logout, SIGNAL(clicked()), this, SLOT(startLogout()) );\n connect(ui->tool_vol_mixer, SIGNAL(clicked()), this, SLOT(startMixer()) );\n \/\/And setup the default icons\n ui->label_bright_icon->setPixmap( LXDG::findIcon(\"preferences-system-power-management\",\"\").pixmap(ui->label_bright_icon->maximumSize()) );\n ui->tool_wk_prev->setIcon( LXDG::findIcon(\"go-previous-view\",\"\"));\n ui->tool_wk_next->setIcon( LXDG::findIcon(\"go-next-view\",\"\") );\n ui->tool_logout->setIcon( LXDG::findIcon(\"system-log-out\",\"\") );\n}\n\nLSysMenuQuick::~LSysMenuQuick(){\n\t\n}\n\nvoid LSysMenuQuick::UpdateMenu(){\n \/\/Audio Volume\n int val = LOS::audioVolume();\t\n QIcon ico;\n if(val > 66){ ico= LXDG::findIcon(\"audio-volume-high\",\"\"); }\n else if(val > 33){ ico= LXDG::findIcon(\"audio-volume-medium\",\"\"); }\n else if(val > 0){ ico= LXDG::findIcon(\"audio-volume-low\",\"\"); }\n else{ ico= LXDG::findIcon(\"audio-volume-muted\",\"\"); }\n bool hasMixer = LOS::hasMixerUtility();\n ui->label_vol_icon->setVisible(!hasMixer);\n ui->tool_vol_mixer->setVisible(hasMixer);\n if(!hasMixer){ ui->label_vol_icon->setPixmap( ico.pixmap(ui->label_vol_icon->maximumSize()) ); }\n else{ ui->tool_vol_mixer->setIcon(ico); }\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_vol_text->setText(txt);\n if(ui->slider_volume->value()!= val){ ui->slider_volume->setValue(val); }\n \/\/Screen Brightness\n val = LOS::ScreenBrightness();\n if(val < 0){\n \/\/No brightness control - hide it\n ui->group_brightness->setVisible(false);\n }else{\n ui->group_brightness->setVisible(true);\n txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_bright_text->setText(txt);\n if(ui->slider_brightness->value()!=val){ ui->slider_brightness->setValue(val); }\n }\n \/\/Battery Status\n if(LOS::hasBattery()){\n ui->group_battery->setVisible(true);\n val = LOS::batteryCharge();\n if(LOS::batteryIsCharging()){\n if(val < 15){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-low\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 30){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-caution\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 50){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-040\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 70){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-060\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 90){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging-080\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else{ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-charging\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n ui->label_bat_text->setText( QString(\"%1%\\n(%2)\").arg(QString::number(val), tr(\"connected\")) );\n }else{\n if(val < 1){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-missing\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 15){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-low\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 30){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-caution\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 50){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-040\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 70){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-060\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else if(val < 90){ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-080\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n else{ ui->label_bat_icon->setPixmap( LXDG::findIcon(\"battery-100\",\"\").pixmap(ui->label_bat_icon->maximumSize()) ); }\n ui->label_bat_text->setText( QString(\"%1%\\n(%2)\").arg(QString::number(val), getRemainingTime()) );\n }\n }else{\n ui->group_battery->setVisible(false);\n }\n \/\/Workspace\n val = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n ui->group_workspace->setVisible(val>=0 && tot>1);\n ui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(val+1), QString::number(tot)) );\n}\n\nvoid LSysMenuQuick::volSliderChanged(){\n int val = ui->slider_volume->value();\n LOS::setAudioVolume(val);\n settings->setValue(\"audiovolume\",val);\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_vol_text->setText( txt );\n if(val > 66){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-high\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else if(val > 33){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-medium\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else if(val > 0){ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-low\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n else{ ui->label_vol_icon->setPixmap( LXDG::findIcon(\"audio-volume-muted\",\"\").pixmap(ui->label_vol_icon->maximumSize()) ); }\n}\n\nvoid LSysMenuQuick::startMixer(){\n emit CloseMenu();\n LOS::startMixerUtility();\n}\n\nvoid LSysMenuQuick::brightSliderChanged(){\n int val = ui->slider_brightness->value();\n LOS::setScreenBrightness(val);\n settings->setValue(\"screenbrightness\",val);\n QString txt = QString::number(val)+\"%\";\n if(val<100){ txt.prepend(\" \"); } \/\/make sure no widget resizing\n ui->label_bright_text->setText( txt );\n}\n\nvoid LSysMenuQuick::nextWorkspace(){\n int cur = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n cur++;\n if(cur>=tot){ cur = 0; } \/\/back to beginning\n LX11::SetCurrentDesktop(cur);\nui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(cur+1), QString::number(tot)) );\n}\n\nvoid LSysMenuQuick::prevWorkspace(){\n int cur = LX11::GetCurrentDesktop();\n int tot = LX11::GetNumberOfDesktops();\n cur--;\n if(cur<0){ cur = tot-1; } \/\/back to last\n LX11::SetCurrentDesktop(cur);\n ui->label_wk_text->setText( QString(tr(\"%1 of %2\")).arg(QString::number(cur+1), QString::number(tot)) );\t\n}\n\nQString LSysMenuQuick::getRemainingTime(){\n int secs = LOS::batterySecondsLeft();\n if(secs < 0){ return \"??\"; }\n QString rem; \/\/remaining\n if(secs > 3600){\n int hours = secs\/3600;\n rem.append( QString::number(hours)+\"h \");\n secs = secs - (hours*3600);\n }\n if(secs > 60){\n int min = secs\/60;\n rem.append( QString::number(min)+\"m \");\n secs = secs - (min*60);\n }\n if(secs > 0){\n rem.append( QString::number(secs)+\"s\");\n }else{\n rem.append( \"0s\" );\n }\n return rem;\n}\n\nvoid LSysMenuQuick::startLogout(){\n emit CloseMenu();\n LSession::handle()->systemWindow();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clang -target x86_64-unknown-unknown -fverbose-asm -g -O0 -S %s -o - | FileCheck %s\n\/\/ <rdar:\/\/problem\/12566646>\n\nclass A {\n int x[];\n};\nA a;\n\n\/\/ CHECK: Abbrev [3] 0x2d:0x3 DW_TAG_base_type\n\/\/ CHECK-NEXT: DW_AT_byte_size\n\/\/ CHECK-NEXT: DW_AT_encoding\n\/\/ CHECK-NEXT: Abbrev [4] 0x30:0xb DW_TAG_array_type\n\/\/ CHECK-NEXT: DW_AT_type\n\/\/ CHECK-NEXT: Abbrev [5] 0x35:0x5 DW_TAG_subrange_type\n\/\/ CHECK-NEXT: DW_AT_type\n\/\/ CHECK-NEXT: End Of Children Mark\n<commit_msg>Don't test for ASM output but for IR output.<commit_after>\/\/ RUN: %clang -target x86_64-unknown-unknown -fverbose-asm -g -O0 -S -emit-llvm %s -o - | FileCheck %s\n\/\/ <rdar:\/\/problem\/12566646>\n\nclass A {\n int x[];\n};\nA a;\n\n\/\/ CHECK: !9 = metadata !{i32 {{.*}}, metadata {{.*}}, metadata !\"x\", metadata {{.*}}, i32 5, i64 0, i64 0, i64 0, i32 1, metadata [[ARRAY_TYPE:.*]]} ; [ DW_TAG_member ]\n\/\/ CHECK: [[ARRAY_TYPE]] = metadata !{i32 {{.*}}, null, metadata !\"\", null, i32 0, i64 0, i64 32, i32 0, i32 0, metadata [[BASE_TYPE:.*]], metadata [[ELEM_TYPE:.*]], i32 0, i32 0} ; [ DW_TAG_array_type ]\n\/\/ CHECK: [[BASE_TYPE]] = metadata !{i32 {{.*}}, null, metadata !\"int\", null, i32 0, i64 32, i64 32, i64 0, i32 0, i32 5} ; [ DW_TAG_base_type ]\n\/\/ CHECK: [[ELEM_TYPE]] = metadata !{metadata [[SUBRANGE:.*]]}\n\/\/ CHECK: [[SUBRANGE]] = metadata !{i32 786465, i64 1, i64 0, i64 -1} ; [ DW_TAG_subrange_type ] [1, 0]\n<|endoftext|>"} {"text":"<commit_before>\/*!\n * @file poa.cpp\n *\n * @brief Poa source file which encapsulates the implementation\n *\/\n\n#include <stdlib.h>\n#include <stdint.h>\n#include <algorithm>\n\n#include \"graph.hpp\"\n#include \"spoa.hpp\"\n\nvoid prepare_indices(std::vector<uint32_t>& dst, const std::vector<std::string>& sequences, bool sorted) {\n dst.resize(sequences.size());\n std::iota(dst.begin(), dst.end(), static_cast<uint32_t>(0));\n\n if (sorted) {\n std::sort(dst.begin(), dst.end(),\n [&](uint32_t lhs, uint32_t rhs) {\n return sequences[lhs].size() > sequences[rhs].size();\n }\n );\n }\n}\n\nnamespace SPOA {\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n std::shared_ptr<Graph> graph = createGraph(sequences[indices.front()]);\n\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n auto alignment = Alignment::createAlignment(sequences[indices[i]], graph, params);\n alignment->align_sequence_to_graph();\n graph->add_alignment(std::move(alignment), sequences[indices[i]]);\n }\n\n return graph;\n}\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n std::shared_ptr<Graph> graph = createGraph(sequences[indices.front()], qualities[indices.front()]);\n\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n auto alignment = Alignment::createAlignment(sequences[indices[i]], graph, params);\n alignment->align_sequence_to_graph();\n graph->add_alignment(std::move(alignment), sequences[indices[i]], qualities[indices[i]]);\n }\n\n return graph;\n}\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, const std::vector<uint32_t>& begin_positions,\n const std::vector<uint32_t>& end_positions, AlignmentParams params) {\n\n std::shared_ptr<Graph> graph = createGraph(sequences.front(), qualities.front());\n uint32_t offset = 0.01 * sequences.front().size();\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n bool adjust = false;\n std::vector<int32_t> mapping;\n std::shared_ptr<Graph> subgraph = nullptr;\n if (begin_positions[i] < offset && end_positions[i] > sequences.front().size() - offset) {\n subgraph = graph;\n } else {\n subgraph = graph->subgraph(begin_positions[i], end_positions[i], mapping);\n adjust = true;\n }\n\n auto alignment = Alignment::createAlignment(sequences[i], subgraph, params);\n alignment->align_sequence_to_graph();\n if (adjust) alignment->adjust_node_ids(mapping);\n\n graph->add_alignment(std::move(alignment), sequences[i], qualities[i]);\n }\n\n return graph;\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n auto graph = construct_partial_order_graph(sequences, params, sorted);\n return graph->generate_consensus();\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n auto graph = construct_partial_order_graph(sequences, qualities, params, sorted);\n return graph->generate_consensus();\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, const std::vector<uint32_t>& begin_positions,\n const std::vector<uint32_t>& end_positions, AlignmentParams params) {\n\n auto graph = construct_partial_order_graph(sequences, qualities, begin_positions,\n end_positions, params);\n return graph->generate_consensus();\n}\n\nvoid generate_msa(std::vector<std::string>& dst, const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n auto graph = construct_partial_order_graph(sequences, params, sorted);\n graph->generate_msa(dst);\n graph->check_msa(dst, sequences, indices);\n}\n\nvoid generate_msa(std::vector<std::string>& dst, const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n auto graph = construct_partial_order_graph(sequences, qualities, params, sorted);\n graph->generate_msa(dst);\n graph->check_msa(dst, sequences, indices);\n}\n\n}\n<commit_msg>Added missing header<commit_after>\/*!\n * @file poa.cpp\n *\n * @brief Poa source file which encapsulates the implementation\n *\/\n\n#include <stdlib.h>\n#include <stdint.h>\n#include <algorithm>\n#include <numeric>\n\n#include \"graph.hpp\"\n#include \"spoa.hpp\"\n\nvoid prepare_indices(std::vector<uint32_t>& dst, const std::vector<std::string>& sequences, bool sorted) {\n dst.resize(sequences.size());\n std::iota(dst.begin(), dst.end(), static_cast<uint32_t>(0));\n\n if (sorted) {\n std::sort(dst.begin(), dst.end(),\n [&](uint32_t lhs, uint32_t rhs) {\n return sequences[lhs].size() > sequences[rhs].size();\n }\n );\n }\n}\n\nnamespace SPOA {\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n std::shared_ptr<Graph> graph = createGraph(sequences[indices.front()]);\n\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n auto alignment = Alignment::createAlignment(sequences[indices[i]], graph, params);\n alignment->align_sequence_to_graph();\n graph->add_alignment(std::move(alignment), sequences[indices[i]]);\n }\n\n return graph;\n}\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n std::shared_ptr<Graph> graph = createGraph(sequences[indices.front()], qualities[indices.front()]);\n\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n auto alignment = Alignment::createAlignment(sequences[indices[i]], graph, params);\n alignment->align_sequence_to_graph();\n graph->add_alignment(std::move(alignment), sequences[indices[i]], qualities[indices[i]]);\n }\n\n return graph;\n}\n\nstd::shared_ptr<Graph> construct_partial_order_graph(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, const std::vector<uint32_t>& begin_positions,\n const std::vector<uint32_t>& end_positions, AlignmentParams params) {\n\n std::shared_ptr<Graph> graph = createGraph(sequences.front(), qualities.front());\n uint32_t offset = 0.01 * sequences.front().size();\n for (uint32_t i = 1; i < sequences.size(); ++i) {\n bool adjust = false;\n std::vector<int32_t> mapping;\n std::shared_ptr<Graph> subgraph = nullptr;\n if (begin_positions[i] < offset && end_positions[i] > sequences.front().size() - offset) {\n subgraph = graph;\n } else {\n subgraph = graph->subgraph(begin_positions[i], end_positions[i], mapping);\n adjust = true;\n }\n\n auto alignment = Alignment::createAlignment(sequences[i], subgraph, params);\n alignment->align_sequence_to_graph();\n if (adjust) alignment->adjust_node_ids(mapping);\n\n graph->add_alignment(std::move(alignment), sequences[i], qualities[i]);\n }\n\n return graph;\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n auto graph = construct_partial_order_graph(sequences, params, sorted);\n return graph->generate_consensus();\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n auto graph = construct_partial_order_graph(sequences, qualities, params, sorted);\n return graph->generate_consensus();\n}\n\nstd::string generate_consensus(const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, const std::vector<uint32_t>& begin_positions,\n const std::vector<uint32_t>& end_positions, AlignmentParams params) {\n\n auto graph = construct_partial_order_graph(sequences, qualities, begin_positions,\n end_positions, params);\n return graph->generate_consensus();\n}\n\nvoid generate_msa(std::vector<std::string>& dst, const std::vector<std::string>& sequences,\n AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n auto graph = construct_partial_order_graph(sequences, params, sorted);\n graph->generate_msa(dst);\n graph->check_msa(dst, sequences, indices);\n}\n\nvoid generate_msa(std::vector<std::string>& dst, const std::vector<std::string>& sequences,\n const std::vector<std::string>& qualities, AlignmentParams params, bool sorted) {\n\n std::vector<uint32_t> indices;\n prepare_indices(indices, sequences, sorted);\n\n auto graph = construct_partial_order_graph(sequences, qualities, params, sorted);\n graph->generate_msa(dst);\n graph->check_msa(dst, sequences, indices);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ State.cc\n\/\/\n\/\/ Description:\n\/\/ Implementation of the State class\n\/\/\n\/\/ Author(s):\n\/\/ Clancy Rowley\n\/\/\n\/\/ Date: 1 Sep 2008\n\/\/\n\/\/ $Revision$\n\/\/ $LastChangedDate$\n\/\/ $LastChangedBy$\n\/\/ $HeadURL$\n\n#include \"State.h\"\n#include <string>\n#include <stdio.h>\n\nusing namespace ibpm;\n\nnamespace ibpm {\n\nState::State() {\n timestep = 0;\n time = 0.;\n}\n\nState::State(const Grid& grid, int numPoints ) {\n timestep = 0;\n time = 0.;\n resize( grid, numPoints );\n}\n\nvoid State::resize( const Grid& grid, int numPoints ) {\n q.resize( grid );\n omega.resize( grid );\n f.resize( numPoints );\n}\n\nState::State( string filename ) {\n timestep = 0;\n time = 0.;\n load( filename );\n}\n\nState::~State() {}\n \n\/\/ Routine for computing X & Y forces\n\/\/ Note that f is actually a body force (force per unit mass), so the net\n\/\/ force is the integral over the domain. By a property of the discrete\n\/\/ delta function, this equals a sum of the BoundaryVector values times dx^2\nvoid State::computeNetForce( double& xforce, double& yforce) const {\n xforce = 0;\n yforce = 0;\n for( int i=0; i<f.getNumPoints(); i++ ) {\n xforce += f(X,i);\n yforce += f(Y,i);\n }\n double dx2 = omega.Dx() * omega.Dx();\n xforce *= dx2;\n yforce *= dx2;\n}\n\nbool State::load(const std::string& filename) {\n\n cerr << \"Reading restart file \" << filename << \"...\" << flush;\n FILE* fp = fopen( filename.c_str(), \"rb\" );\n if ( fp == NULL ) return false;\n\n \/\/ read Grid info\n int nx;\n int ny;\n int ngrid;\n double dx;\n double x0;\n double y0;\n \n fread( &nx, sizeof( int ), 1, fp );\n fread( &ny, sizeof( int ), 1, fp );\n fread( &ngrid, sizeof( int ), 1, fp );\n fread( &dx, sizeof( double ), 1, fp );\n fread( &x0, sizeof( double ), 1, fp );\n fread( &y0, sizeof( double ), 1, fp );\n\n int numPoints;\n \/\/ read Geometry info\n fread( &numPoints, sizeof( int ), 1, fp );\n \n \/\/ check that Grid and Geometry in file match those expected\n bool success = true;\n if ( nx != q.Nx() || \n ny != q.Ny() ||\n ngrid != q.Ngrid() ||\n dx != q.Dx() ||\n x0 != q.getXEdge(0,0) ||\n y0 != q.getYEdge(0,0) ||\n numPoints != f.getNumPoints() ) {\n \n \/\/ If old grid was previously allocated, print a warning and set\n \/\/ the return value to false\n if ( q.Nx() > 0 ) {\n cerr << \"Warning: grids do not match. Resizing grid.\" << endl;\n success = false;\n }\n Grid newgrid( nx, ny, 1, dx * nx, x0, y0 );\n resize( newgrid, numPoints );\n }\n\n \/\/ read Flux q\n Flux::index qind;\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for ( qind = q.begin(); qind != q.end(); ++qind ) {\n success = success && fread( &( q(lev,qind) ), sizeof( double ), 1, fp );\n }\n }\n \n \/\/ read Scalar omega\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for (int i=1; i<nx; ++i ) {\n for ( int j=1; j<ny; ++j ) {\n success = success && fread( &( omega(lev,i,j) ), sizeof( double ), 1, fp );\n }\n }\n }\n\n \/\/ read BoundaryVector f\n for ( int i=0; i < numPoints; ++i ) {\n success = success && fread( &( f(X,i) ), sizeof( double ), 1, fp );\n success = success && fread( &( f(Y,i) ), sizeof( double ), 1, fp ); \n }\n\n \/\/ read timestep and time\n success = success && fread( ×tep, sizeof(int), 1, fp );\n success = success && fread( &time, sizeof(double), 1, fp );\n\n \/\/ close file\n fclose( fp );\n cerr << \"done\" << endl;\n return success;\n}\n\nbool State::save(std::string filename) const {\n cerr << \"Writing restart file \" << filename << \"...\" << flush;\n \/\/ open file\n FILE* fp = fopen( filename.c_str(), \"wb\" );\n if ( fp == NULL ) return false;\n\n \/\/ write Grid info\n const Grid& grid = q.getGrid();\n int nx = grid.Nx();\n int ny = grid.Ny();\n int ngrid = grid.Ngrid();\n double dx = grid.Dx();\n double x0 = grid.getXEdge(0,0);\n double y0 = grid.getYEdge(0,0);\n \n fwrite( &nx, sizeof( int ), 1, fp );\n fwrite( &ny, sizeof( int ), 1, fp );\n fwrite( &ngrid, sizeof( int ), 1, fp );\n fwrite( &dx, sizeof( double ), 1, fp );\n fwrite( &x0, sizeof( double ), 1, fp );\n fwrite( &y0, sizeof( double ), 1, fp );\n \n \/\/ write Geometry info\n int numPoints = f.getNumPoints();\n fwrite( &numPoints, sizeof( int ), 1, fp );\n \n \/\/ write Flux q\n Flux::index qind;\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for ( qind = q.begin(); qind != q.end(); ++qind ) {\n double qq = q(lev,qind);\n fwrite( &qq, sizeof( double ), 1, fp );\n }\n }\n\n \/\/ write Scalar omega\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for (int i=1; i<nx; ++i ) {\n for ( int j=1; j<ny; ++j ) {\n double g = omega(lev,i,j);\n fwrite( &g, sizeof( double ), 1, fp );\n }\n }\n }\n\n \/\/ write BoundaryVector f\n for ( int i=0; i < numPoints; ++i ) {\n double fx = f(X,i);\n double fy = f(Y,i);\n fwrite( &fx, sizeof( double ), 1, fp );\n fwrite( &fy, sizeof( double ), 1, fp ); \n }\n\n \/\/ write timestep and time\n fwrite( ×tep, sizeof(int), 1, fp );\n fwrite( &time, sizeof(double), 1, fp );\n\n \/\/ close file\n fclose( fp );\n cerr << \"done\" << endl;\n return true;\n}\n\n} \/\/ namespace ibpm\n<commit_msg>a bug fixed in State::load(): Grid newgrid(nx, ny, 1, ...) replaced by Grid newgrid(nx, ny, ngrid))<commit_after>\/\/ State.cc\n\/\/\n\/\/ Description:\n\/\/ Implementation of the State class\n\/\/\n\/\/ Author(s):\n\/\/ Clancy Rowley\n\/\/\n\/\/ Date: 1 Sep 2008\n\/\/\n\/\/ $Revision$\n\/\/ $LastChangedDate$\n\/\/ $LastChangedBy$\n\/\/ $HeadURL$\n\n#include \"State.h\"\n#include <string>\n#include <stdio.h>\n\nusing namespace ibpm;\n\nnamespace ibpm {\n\nState::State() {\n timestep = 0;\n time = 0.;\n}\n\nState::State(const Grid& grid, int numPoints ) {\n timestep = 0;\n time = 0.;\n resize( grid, numPoints );\n}\n\nvoid State::resize( const Grid& grid, int numPoints ) {\n q.resize( grid );\n omega.resize( grid );\n f.resize( numPoints );\n}\n\nState::State( string filename ) {\n timestep = 0;\n time = 0.;\n load( filename );\n}\n\nState::~State() {}\n \n\/\/ Routine for computing X & Y forces\n\/\/ Note that f is actually a body force (force per unit mass), so the net\n\/\/ force is the integral over the domain. By a property of the discrete\n\/\/ delta function, this equals a sum of the BoundaryVector values times dx^2\nvoid State::computeNetForce( double& xforce, double& yforce) const {\n xforce = 0;\n yforce = 0;\n for( int i=0; i<f.getNumPoints(); i++ ) {\n xforce += f(X,i);\n yforce += f(Y,i);\n }\n double dx2 = omega.Dx() * omega.Dx();\n xforce *= dx2;\n yforce *= dx2;\n}\n\nbool State::load(const std::string& filename) {\n\n cerr << \"Reading restart file \" << filename << \"...\" << flush;\n FILE* fp = fopen( filename.c_str(), \"rb\" );\n if ( fp == NULL ) return false;\n\n \/\/ read Grid info\n int nx;\n int ny;\n int ngrid;\n double dx;\n double x0;\n double y0;\n \n fread( &nx, sizeof( int ), 1, fp );\n fread( &ny, sizeof( int ), 1, fp );\n fread( &ngrid, sizeof( int ), 1, fp );\n fread( &dx, sizeof( double ), 1, fp );\n fread( &x0, sizeof( double ), 1, fp );\n fread( &y0, sizeof( double ), 1, fp );\n\n int numPoints;\n \/\/ read Geometry info\n fread( &numPoints, sizeof( int ), 1, fp );\n \n \/\/ check that Grid and Geometry in file match those expected\n bool success = true;\n if ( nx != q.Nx() || \n ny != q.Ny() ||\n ngrid != q.Ngrid() ||\n dx != q.Dx() ||\n x0 != q.getXEdge(0,0) ||\n y0 != q.getYEdge(0,0) ||\n numPoints != f.getNumPoints() ) {\n \n \/\/ If old grid was previously allocated, print a warning and set\n \/\/ the return value to false\n if ( q.Nx() > 0 ) {\n cerr << \"Warning: grids do not match. Resizing grid.\" << endl;\n success = false;\n }\n Grid newgrid( nx, ny, ngrid, dx * nx, x0, y0 );\n resize( newgrid, numPoints );\n }\n\n \/\/ read Flux q\n Flux::index qind;\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for ( qind = q.begin(); qind != q.end(); ++qind ) {\n success = success && fread( &( q(lev,qind) ), sizeof( double ), 1, fp );\n }\n }\n \n \/\/ read Scalar omega\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for (int i=1; i<nx; ++i ) {\n for ( int j=1; j<ny; ++j ) {\n success = success && fread( &( omega(lev,i,j) ), sizeof( double ), 1, fp );\n }\n }\n }\n\n \/\/ read BoundaryVector f\n for ( int i=0; i < numPoints; ++i ) {\n success = success && fread( &( f(X,i) ), sizeof( double ), 1, fp );\n success = success && fread( &( f(Y,i) ), sizeof( double ), 1, fp ); \n }\n\n \/\/ read timestep and time\n success = success && fread( ×tep, sizeof(int), 1, fp );\n success = success && fread( &time, sizeof(double), 1, fp );\n\n \/\/ close file\n fclose( fp );\n cerr << \"done\" << endl;\n return success;\n}\n\nbool State::save(std::string filename) const {\n cerr << \"Writing restart file \" << filename << \"...\" << flush;\n \/\/ open file\n FILE* fp = fopen( filename.c_str(), \"wb\" );\n if ( fp == NULL ) return false;\n\n \/\/ write Grid info\n const Grid& grid = q.getGrid();\n int nx = grid.Nx();\n int ny = grid.Ny();\n int ngrid = grid.Ngrid();\n double dx = grid.Dx();\n double x0 = grid.getXEdge(0,0);\n double y0 = grid.getYEdge(0,0);\n \n fwrite( &nx, sizeof( int ), 1, fp );\n fwrite( &ny, sizeof( int ), 1, fp );\n fwrite( &ngrid, sizeof( int ), 1, fp );\n fwrite( &dx, sizeof( double ), 1, fp );\n fwrite( &x0, sizeof( double ), 1, fp );\n fwrite( &y0, sizeof( double ), 1, fp );\n \n \/\/ write Geometry info\n int numPoints = f.getNumPoints();\n fwrite( &numPoints, sizeof( int ), 1, fp );\n \n \/\/ write Flux q\n Flux::index qind;\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for ( qind = q.begin(); qind != q.end(); ++qind ) {\n double qq = q(lev,qind);\n fwrite( &qq, sizeof( double ), 1, fp );\n }\n }\n\n \/\/ write Scalar omega\n for ( int lev=0; lev < q.Ngrid(); ++lev ) {\n for (int i=1; i<nx; ++i ) {\n for ( int j=1; j<ny; ++j ) {\n double g = omega(lev,i,j);\n fwrite( &g, sizeof( double ), 1, fp );\n }\n }\n }\n\n \/\/ write BoundaryVector f\n for ( int i=0; i < numPoints; ++i ) {\n double fx = f(X,i);\n double fy = f(Y,i);\n fwrite( &fx, sizeof( double ), 1, fp );\n fwrite( &fy, sizeof( double ), 1, fp ); \n }\n\n \/\/ write timestep and time\n fwrite( ×tep, sizeof(int), 1, fp );\n fwrite( &time, sizeof(double), 1, fp );\n\n \/\/ close file\n fclose( fp );\n cerr << \"done\" << endl;\n return true;\n}\n\n} \/\/ namespace ibpm\n<|endoftext|>"} {"text":"<commit_before>\n#include <iterator>\n\n#include \"Representations\/Infrastructure\/JointData.h\"\n#include \"Tools\/Math\/Common.h\"\n#include \"PlatformInterface\/Platform.h\"\n#include \"Tools\/Debug\/NaoTHAssert.h\"\n#include \"Messages\/Framework-Representations.pb.h\"\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n\nusing namespace naoth;\nusing namespace std;\n\ndouble JointData::min[JointData::numOfJoint];\ndouble JointData::max[JointData::numOfJoint];\n\nJointData::JointData()\n{\n \/\/ init the arrays\n for (int i = 0; i < numOfJoint; i++) \n {\n position[i] = 0.0;\n dp[i] = 0.0;\n ddp[i] = 0.0;\n stiffness[i] = 0.0;\n }\n}\n\nvoid JointData::loadJointLimitsFromConfig()\n{\n const Configuration& cfg = Platform::getInstance().theConfiguration;\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n string jointName = JointData::getJointName((JointData::JointID)i);\n \n if (cfg.hasKey(\"joints\", jointName + \"Max\")) {\n max[i] = Math::fromDegrees(cfg.getDouble(\"joints\", jointName + \"Max\"));\n } else {\n THROW(\"JointData: can not get \" + jointName + \" max angle\");\n }\n\n if (cfg.hasKey(\"joints\", jointName + \"Min\")) {\n min[i] = Math::fromDegrees(cfg.getDouble(\"joints\", jointName + \"Min\"));\n } else {\n THROW(\"JointData: can not get \" + jointName + \" min angle\");\n }\n }\/\/enf for\n}\/\/end init\n\nstring JointData::getJointName(JointID joint)\n{\n switch (joint)\n {\n case HeadPitch: return string(\"HeadPitch\");\n case HeadYaw: return string(\"HeadYaw\");\n case RShoulderRoll: return string(\"RShoulderRoll\");\n case LShoulderRoll: return string(\"LShoulderRoll\");\n case RShoulderPitch: return string(\"RShoulderPitch\");\n case LShoulderPitch: return string(\"LShoulderPitch\");\n case RElbowRoll: return string(\"RElbowRoll\");\n case LElbowRoll: return string(\"LElbowRoll\");\n case RElbowYaw: return string(\"RElbowYaw\");\n case LElbowYaw: return string(\"LElbowYaw\");\n \n case LWristYaw: return string(\"LWristYaw\");\n case RWristYaw: return string(\"RWristYaw\");\n case LHand: return string(\"LHand\");\n case RHand: return string(\"RHand\");\n \n case LHipYawPitch: return string(\"LHipYawPitch\");\n case RHipYawPitch: return string(\"RHipYawPitch\");\n case RHipPitch: return string(\"RHipPitch\");\n case LHipPitch: return string(\"LHipPitch\");\n case RHipRoll: return string(\"RHipRoll\");\n case LHipRoll: return string(\"LHipRoll\");\n case RKneePitch: return string(\"RKneePitch\");\n case LKneePitch: return string(\"LKneePitch\");\n case RAnklePitch: return string(\"RAnklePitch\");\n case LAnklePitch: return string(\"LAnklePitch\");\n case RAnkleRoll: return string(\"RAnkleRoll\");\n case LAnkleRoll: return string(\"LAnkleRoll\");\n default: return string(\"Unknown Joint\");\n }\/\/end switch\n}\/\/end getJointName\n\ndouble JointData::mirrorData(JointID joint) const\n{\n switch (joint)\n {\n \/\/ Head (don't mirror)\n case HeadYaw: return -position[HeadYaw];\n case HeadPitch: return position[HeadPitch];\n\n \/\/ Arms\n case RShoulderPitch: return position[LShoulderPitch];\n case RShoulderRoll: return -position[LShoulderRoll];\n case RElbowYaw: return -position[LElbowYaw];\n case RElbowRoll: return -position[LElbowRoll];\n\n case LShoulderPitch: return position[RShoulderPitch];\n case LShoulderRoll: return -position[RShoulderRoll];\n case LElbowYaw: return -position[RElbowYaw];\n case LElbowRoll: return -position[RElbowRoll];\n\n \/\/ Legs\n case RHipYawPitch: return position[LHipYawPitch];\n case RHipPitch: return position[LHipPitch];\n case RHipRoll: return -position[LHipRoll];\n case RKneePitch: return position[LKneePitch];\n case RAnklePitch: return position[LAnklePitch];\n case RAnkleRoll: return -position[LAnkleRoll];\n\n\n case LHipYawPitch: return position[RHipYawPitch];\n case LHipPitch: return position[RHipPitch];\n case LHipRoll: return -position[RHipRoll];\n case LKneePitch: return position[RKneePitch];\n case LAnklePitch: return position[RAnklePitch];\n case LAnkleRoll: return -position[RAnkleRoll];\n default: return position[joint];\n }\n}\/\/end mirrorData\n\nJointData::JointID JointData::jointIDFromName(std::string name)\n{\n for (int i = 0; i < numOfJoint; i++) {\n if (name == getJointName((JointID) i)) return (JointID) i;\n }\n\n return numOfJoint;\n}\/\/end getJointName\n\nvoid JointData::mirrorFrom(const JointData& jointData)\n{\n for (int i = 0; i < numOfJoint; i++) {\n position[i] = jointData.mirrorData((JointID) i);\n }\n}\/\/end mirror\n\nvoid JointData::mirror()\n{\n JointData tmp = *this;\n mirrorFrom(tmp);\n}\n\nvoid JointData::clamp(JointID id)\n{\n position[id] = Math::clamp(position[id], min[id], max[id]);\n}\n\nvoid JointData::clamp()\n{\n for( int i=0; i<numOfJoint; i++) {\n clamp((JointID)i);\n }\n}\n\nbool JointData::isInRange(JointData::JointID id, double ang) const\n{\n return ang <= max[id] && ang >= min[id];\n}\n\nbool JointData::isInRange(JointData::JointID id) const\n{\n return isInRange(id, position[id]);\n}\n\nvoid JointData::updateSpeed(const JointData& lastData, double dt)\n{\n const double* lastPose = lastData.position;\n double idt = 1 \/ dt;\n for ( int i=0; i<JointData::numOfJoint; i++)\n {\n dp[i] = (position[i] - lastPose[i]) * idt;\n }\n}\n\nvoid JointData::updateAcceleration(const JointData& lastData, double dt)\n{\n const double* lastSpeed = lastData.dp;\n double idt = 1 \/ dt;\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n ddp[i] = (dp[i] - lastSpeed[i]) * idt;\n }\n}\n\nbool JointData::isLegStiffnessOn() const\n{\n for ( int i=JointData::RHipYawPitch; i<JointData::numOfJoint; i++)\n {\n if ( stiffness[i] < 0 ) return false;\n }\n return true;\n}\n\nint JointData::checkStiffness() const\n{\n for(int i=0; i<JointData::numOfJoint; i++)\n {\n double v = stiffness[i];\n if ( v > 1 || v < -1 )\n {\n return i;\n \/\/THROW(\"Get ILLEGAL Stiffness: \"<<getJointName(JointData::JointID(i))<<\" = \"<<v);\n }\n }\n return -1;\n}\n\nSensorJointData::SensorJointData()\n : timestamp(0)\n{\n for (int i = 0; i < numOfJoint; i++)\n {\n electricCurrent[i] = 0.0;\n temperature[i] = 0.0;\n }\n}\n\n\nvoid SensorJointData::print(ostream& stream) const\n{\n stream << \"Timestamp: \" << timestamp << endl;\n stream << \"Joint [pos(deg), stiffness, temperature,current]\" << endl;\n stream << \"------------------------\" << endl;\n for (int i = 0; i < numOfJoint; i++) \n {\n stream.precision(4);\n stream << getJointName((JointData::JointID) i) << \"\\t[\" << fixed << Math::toDegrees(position[i]) << \", \" << stiffness[i] << \", \";\n stream.precision(0);\n stream << temperature[i] << \", \";\n stream.precision(3);\n stream << electricCurrent[i] << \"]\" << endl;\n }\n}\/\/end print\n\nSensorJointData::~SensorJointData()\n{\n}\n\nMotorJointData::MotorJointData()\n{\n}\n\n\nMotorJointData::~MotorJointData()\n{\n}\n\nvoid MotorJointData::print(ostream& stream) const\n{\n stream << \"Joint [pos, stiffness]\" << endl;\n stream << \"------------------------\" << endl;\n for (int i = 0; i < numOfJoint; i++) {\n stream << getJointName((JointData::JointID) i) << \"[\" << position[i] << \", \" << stiffness[i] << \"]\" << endl;\n }\n}\/\/end print\n\nvoid Serializer<SensorJointData>::serialize(const SensorJointData& representation, std::ostream& stream)\n{\n naothmessages::SensorJointData message;\n \n for(int i=0; i < JointData::numOfJoint; i++)\n {\n message.add_electriccurrent(representation.electricCurrent[i]);\n message.add_temperature(representation.temperature[i]);\n\n message.mutable_jointdata()->add_position(representation.position[i]);\n message.mutable_jointdata()->add_stiffness(representation.stiffness[i]);\n message.mutable_jointdata()->add_dp(representation.dp[i]);\n message.mutable_jointdata()->add_ddp(representation.ddp[i]);\n }\n\n google::protobuf::io::OstreamOutputStream buf(&stream);\n message.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<SensorJointData>::deserialize(std::istream& stream, SensorJointData& representation)\n{\n naothmessages::SensorJointData message;\n google::protobuf::io::IstreamInputStream buf(&stream);\n message.ParseFromZeroCopyStream(&buf);\n\n \/\/ assure the integrity of the message\n ASSERT( message.electriccurrent().size() == JointData::numOfJoint || \n message.electriccurrent().size() == JointData::numOfJoint - 4);\n ASSERT( message.temperature().size() == JointData::numOfJoint || \n message.temperature().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().position().size() == JointData::numOfJoint || \n message.jointdata().position().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().stiffness().size() == JointData::numOfJoint || \n message.jointdata().stiffness().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().dp().size() == JointData::numOfJoint || \n message.jointdata().dp().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().ddp().size() == JointData::numOfJoint || \n message.jointdata().ddp().size() == JointData::numOfJoint - 4);\n\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n if(i < message.jointdata().position().size())\n {\n representation.electricCurrent[i] = message.electriccurrent(i);\n representation.temperature[i] = message.temperature(i);\n \/\/ joint data\n representation.position[i] = message.jointdata().position(i);\n representation.stiffness[i] = message.jointdata().stiffness(i);\n representation.dp[i] = message.jointdata().dp(i);\n representation.ddp[i] = message.jointdata().ddp(i);\n }\n else \/\/ LWristYaw, RWristYaw, LHand, RHand don't exist in old messages\n {\n representation.electricCurrent[i] = 0;\n representation.temperature[i] = 0;\n \/\/ joint data\n representation.position[i] = 0;\n representation.stiffness[i] = 0;\n representation.dp[i] = 0;\n representation.ddp[i] = 0;\n }\n }\n}\n\n\nvoid Serializer<MotorJointData>::serialize(const MotorJointData& representation, std::ostream& stream)\n{\n naothmessages::JointData message;\n \n for(int i=0; i < JointData::numOfJoint; i++)\n {\n message.add_position(representation.position[i]);\n message.add_stiffness(representation.stiffness[i]);\n message.add_dp(representation.dp[i]);\n message.add_ddp(representation.ddp[i]);\n }\n\n google::protobuf::io::OstreamOutputStream buf(&stream);\n message.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<MotorJointData>::deserialize(std::istream& stream, MotorJointData& representation)\n{\n naothmessages::JointData message;\n google::protobuf::io::IstreamInputStream buf(&stream);\n message.ParseFromZeroCopyStream(&buf);\n\n \/\/ assure the integrity of the message\n ASSERT(message.position().size() == JointData::numOfJoint);\n ASSERT(message.stiffness().size() == JointData::numOfJoint);\n ASSERT(message.dp().size() == JointData::numOfJoint);\n ASSERT(message.ddp().size() == JointData::numOfJoint);\n\n for(int i=0; i < JointData::numOfJoint; i++)\n {\n representation.position[i] = message.position(i);\n representation.stiffness[i] = message.stiffness(i);\n representation.dp[i] = message.dp(i);\n representation.ddp[i] = message.ddp(i);\n }\n}\n\n<commit_msg>fix load the min-max positions for hands<commit_after>\n#include <iterator>\n\n#include \"Representations\/Infrastructure\/JointData.h\"\n#include \"Tools\/Math\/Common.h\"\n#include \"PlatformInterface\/Platform.h\"\n#include \"Tools\/Debug\/NaoTHAssert.h\"\n#include \"Messages\/Framework-Representations.pb.h\"\n#include <google\/protobuf\/io\/zero_copy_stream_impl.h>\n\nusing namespace naoth;\nusing namespace std;\n\ndouble JointData::min[JointData::numOfJoint];\ndouble JointData::max[JointData::numOfJoint];\n\nJointData::JointData()\n{\n \/\/ init the arrays\n for (int i = 0; i < numOfJoint; i++) \n {\n position[i] = 0.0;\n dp[i] = 0.0;\n ddp[i] = 0.0;\n stiffness[i] = 0.0;\n }\n}\n\nvoid JointData::loadJointLimitsFromConfig()\n{\n const Configuration& cfg = Platform::getInstance().theConfiguration;\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n string jointName = JointData::getJointName((JointData::JointID)i);\n \n if (cfg.hasKey(\"joints\", jointName + \"Max\")) {\n double v = cfg.getDouble(\"joints\", jointName + \"Max\");\n max[i] = (i == LHand || i == RHand)?v:Math::fromDegrees(v);\n } else {\n THROW(\"JointData: can not get \" + jointName + \" max angle\");\n }\n\n if (cfg.hasKey(\"joints\", jointName + \"Min\")) {\n double v = cfg.getDouble(\"joints\", jointName + \"Min\");\n min[i] = (i == LHand || i == RHand)?v:Math::fromDegrees(v);\n } else {\n THROW(\"JointData: can not get \" + jointName + \" min angle\");\n }\n }\/\/enf for\n}\/\/end init\n\nstring JointData::getJointName(JointID joint)\n{\n switch (joint)\n {\n case HeadPitch: return string(\"HeadPitch\");\n case HeadYaw: return string(\"HeadYaw\");\n case RShoulderRoll: return string(\"RShoulderRoll\");\n case LShoulderRoll: return string(\"LShoulderRoll\");\n case RShoulderPitch: return string(\"RShoulderPitch\");\n case LShoulderPitch: return string(\"LShoulderPitch\");\n case RElbowRoll: return string(\"RElbowRoll\");\n case LElbowRoll: return string(\"LElbowRoll\");\n case RElbowYaw: return string(\"RElbowYaw\");\n case LElbowYaw: return string(\"LElbowYaw\");\n \n case LWristYaw: return string(\"LWristYaw\");\n case RWristYaw: return string(\"RWristYaw\");\n case LHand: return string(\"LHand\");\n case RHand: return string(\"RHand\");\n \n case LHipYawPitch: return string(\"LHipYawPitch\");\n case RHipYawPitch: return string(\"RHipYawPitch\");\n case RHipPitch: return string(\"RHipPitch\");\n case LHipPitch: return string(\"LHipPitch\");\n case RHipRoll: return string(\"RHipRoll\");\n case LHipRoll: return string(\"LHipRoll\");\n case RKneePitch: return string(\"RKneePitch\");\n case LKneePitch: return string(\"LKneePitch\");\n case RAnklePitch: return string(\"RAnklePitch\");\n case LAnklePitch: return string(\"LAnklePitch\");\n case RAnkleRoll: return string(\"RAnkleRoll\");\n case LAnkleRoll: return string(\"LAnkleRoll\");\n default: return string(\"Unknown Joint\");\n }\/\/end switch\n}\/\/end getJointName\n\ndouble JointData::mirrorData(JointID joint) const\n{\n switch (joint)\n {\n \/\/ Head (don't mirror)\n case HeadYaw: return -position[HeadYaw];\n case HeadPitch: return position[HeadPitch];\n\n \/\/ Arms\n case RShoulderPitch: return position[LShoulderPitch];\n case RShoulderRoll: return -position[LShoulderRoll];\n case RElbowYaw: return -position[LElbowYaw];\n case RElbowRoll: return -position[LElbowRoll];\n\n case LShoulderPitch: return position[RShoulderPitch];\n case LShoulderRoll: return -position[RShoulderRoll];\n case LElbowYaw: return -position[RElbowYaw];\n case LElbowRoll: return -position[RElbowRoll];\n\n \/\/ Legs\n case RHipYawPitch: return position[LHipYawPitch];\n case RHipPitch: return position[LHipPitch];\n case RHipRoll: return -position[LHipRoll];\n case RKneePitch: return position[LKneePitch];\n case RAnklePitch: return position[LAnklePitch];\n case RAnkleRoll: return -position[LAnkleRoll];\n\n\n case LHipYawPitch: return position[RHipYawPitch];\n case LHipPitch: return position[RHipPitch];\n case LHipRoll: return -position[RHipRoll];\n case LKneePitch: return position[RKneePitch];\n case LAnklePitch: return position[RAnklePitch];\n case LAnkleRoll: return -position[RAnkleRoll];\n default: return position[joint];\n }\n}\/\/end mirrorData\n\nJointData::JointID JointData::jointIDFromName(std::string name)\n{\n for (int i = 0; i < numOfJoint; i++) {\n if (name == getJointName((JointID) i)) return (JointID) i;\n }\n\n return numOfJoint;\n}\/\/end getJointName\n\nvoid JointData::mirrorFrom(const JointData& jointData)\n{\n for (int i = 0; i < numOfJoint; i++) {\n position[i] = jointData.mirrorData((JointID) i);\n }\n}\/\/end mirror\n\nvoid JointData::mirror()\n{\n JointData tmp = *this;\n mirrorFrom(tmp);\n}\n\nvoid JointData::clamp(JointID id)\n{\n position[id] = Math::clamp(position[id], min[id], max[id]);\n}\n\nvoid JointData::clamp()\n{\n for( int i=0; i<numOfJoint; i++) {\n clamp((JointID)i);\n }\n}\n\nbool JointData::isInRange(JointData::JointID id, double ang) const\n{\n return ang <= max[id] && ang >= min[id];\n}\n\nbool JointData::isInRange(JointData::JointID id) const\n{\n return isInRange(id, position[id]);\n}\n\nvoid JointData::updateSpeed(const JointData& lastData, double dt)\n{\n const double* lastPose = lastData.position;\n double idt = 1 \/ dt;\n for ( int i=0; i<JointData::numOfJoint; i++)\n {\n dp[i] = (position[i] - lastPose[i]) * idt;\n }\n}\n\nvoid JointData::updateAcceleration(const JointData& lastData, double dt)\n{\n const double* lastSpeed = lastData.dp;\n double idt = 1 \/ dt;\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n ddp[i] = (dp[i] - lastSpeed[i]) * idt;\n }\n}\n\nbool JointData::isLegStiffnessOn() const\n{\n for ( int i = JointData::RHipYawPitch; i <= JointData::LAnkleRoll; i++)\n {\n if ( stiffness[i] < 0 ) { \n return false;\n }\n }\n return true;\n}\n\nint JointData::checkStiffness() const\n{\n for(int i=0; i<JointData::numOfJoint; i++)\n {\n double v = stiffness[i];\n if ( v > 1 || v < -1 )\n {\n return i;\n \/\/THROW(\"Get ILLEGAL Stiffness: \"<<getJointName(JointData::JointID(i))<<\" = \"<<v);\n }\n }\n return -1;\n}\n\nSensorJointData::SensorJointData()\n : timestamp(0)\n{\n for (int i = 0; i < numOfJoint; i++)\n {\n electricCurrent[i] = 0.0;\n temperature[i] = 0.0;\n }\n}\n\n\nvoid SensorJointData::print(ostream& stream) const\n{\n stream << \"Timestamp: \" << timestamp << endl;\n stream << \"Joint [pos(deg), stiffness, temperature,current]\" << endl;\n stream << \"------------------------\" << endl;\n for (int i = 0; i < numOfJoint; i++) \n {\n stream.precision(4);\n stream << getJointName((JointData::JointID) i) << \"\\t[\" << fixed << Math::toDegrees(position[i]) << \", \" << stiffness[i] << \", \";\n stream.precision(0);\n stream << temperature[i] << \", \";\n stream.precision(3);\n stream << electricCurrent[i] << \"]\" << endl;\n }\n}\/\/end print\n\nSensorJointData::~SensorJointData()\n{\n}\n\nMotorJointData::MotorJointData()\n{\n}\n\n\nMotorJointData::~MotorJointData()\n{\n}\n\nvoid MotorJointData::print(ostream& stream) const\n{\n stream << \"Joint [pos, stiffness]\" << endl;\n stream << \"------------------------\" << endl;\n for (int i = 0; i < numOfJoint; i++) {\n stream << getJointName((JointData::JointID) i) << \"[\" << position[i] << \", \" << stiffness[i] << \"]\" << endl;\n }\n}\/\/end print\n\nvoid Serializer<SensorJointData>::serialize(const SensorJointData& representation, std::ostream& stream)\n{\n naothmessages::SensorJointData message;\n \n for(int i=0; i < JointData::numOfJoint; i++)\n {\n message.add_electriccurrent(representation.electricCurrent[i]);\n message.add_temperature(representation.temperature[i]);\n\n message.mutable_jointdata()->add_position(representation.position[i]);\n message.mutable_jointdata()->add_stiffness(representation.stiffness[i]);\n message.mutable_jointdata()->add_dp(representation.dp[i]);\n message.mutable_jointdata()->add_ddp(representation.ddp[i]);\n }\n\n google::protobuf::io::OstreamOutputStream buf(&stream);\n message.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<SensorJointData>::deserialize(std::istream& stream, SensorJointData& representation)\n{\n naothmessages::SensorJointData message;\n google::protobuf::io::IstreamInputStream buf(&stream);\n message.ParseFromZeroCopyStream(&buf);\n\n \/\/ assure the integrity of the message\n ASSERT( message.electriccurrent().size() == JointData::numOfJoint || \n message.electriccurrent().size() == JointData::numOfJoint - 4);\n ASSERT( message.temperature().size() == JointData::numOfJoint || \n message.temperature().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().position().size() == JointData::numOfJoint || \n message.jointdata().position().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().stiffness().size() == JointData::numOfJoint || \n message.jointdata().stiffness().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().dp().size() == JointData::numOfJoint || \n message.jointdata().dp().size() == JointData::numOfJoint - 4);\n ASSERT( message.jointdata().ddp().size() == JointData::numOfJoint || \n message.jointdata().ddp().size() == JointData::numOfJoint - 4);\n\n for (int i = 0; i < JointData::numOfJoint; i++)\n {\n if(i < message.jointdata().position().size())\n {\n representation.electricCurrent[i] = message.electriccurrent(i);\n representation.temperature[i] = message.temperature(i);\n \/\/ joint data\n representation.position[i] = message.jointdata().position(i);\n representation.stiffness[i] = message.jointdata().stiffness(i);\n representation.dp[i] = message.jointdata().dp(i);\n representation.ddp[i] = message.jointdata().ddp(i);\n }\n else \/\/ LWristYaw, RWristYaw, LHand, RHand don't exist in old messages\n {\n representation.electricCurrent[i] = 0;\n representation.temperature[i] = 0;\n \/\/ joint data\n representation.position[i] = 0;\n representation.stiffness[i] = 0;\n representation.dp[i] = 0;\n representation.ddp[i] = 0;\n }\n }\n}\n\n\nvoid Serializer<MotorJointData>::serialize(const MotorJointData& representation, std::ostream& stream)\n{\n naothmessages::JointData message;\n \n for(int i=0; i < JointData::numOfJoint; i++)\n {\n message.add_position(representation.position[i]);\n message.add_stiffness(representation.stiffness[i]);\n message.add_dp(representation.dp[i]);\n message.add_ddp(representation.ddp[i]);\n }\n\n google::protobuf::io::OstreamOutputStream buf(&stream);\n message.SerializeToZeroCopyStream(&buf);\n}\n\nvoid Serializer<MotorJointData>::deserialize(std::istream& stream, MotorJointData& representation)\n{\n naothmessages::JointData message;\n google::protobuf::io::IstreamInputStream buf(&stream);\n message.ParseFromZeroCopyStream(&buf);\n\n \/\/ assure the integrity of the message\n ASSERT(message.position().size() == JointData::numOfJoint);\n ASSERT(message.stiffness().size() == JointData::numOfJoint);\n ASSERT(message.dp().size() == JointData::numOfJoint);\n ASSERT(message.ddp().size() == JointData::numOfJoint);\n\n for(int i=0; i < JointData::numOfJoint; i++)\n {\n representation.position[i] = message.position(i);\n representation.stiffness[i] = message.stiffness(i);\n representation.dp[i] = message.dp(i);\n representation.ddp[i] = message.ddp(i);\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\/ \/**\n* @brief Message decode example.\n* @file\n******************************************************************************\/\n\n#include <cstdint>\n#include <cstdio>\n#include <fstream>\n\n#include <point_one\/fusion_engine\/messages\/core.h>\n#include <point_one\/fusion_engine\/messages\/crc.h>\n\nusing namespace point_one::fusion_engine::messages;\n\n\/******************************************************************************\/\nbool DecodeMessage(std::ifstream& stream, size_t available_bytes) {\n static uint32_t expected_sequence_number = 0;\n\n \/\/ Enforce a 4-byte aligned address.\n alignas(4) uint8_t storage[4096];\n char* buffer = reinterpret_cast<char*>(storage);\n\n \/\/ Read the message header.\n if (available_bytes < sizeof(MessageHeader)) {\n printf(\"Not enough data: cannot read header. [%zu bytes < %zu bytes]\\n\",\n available_bytes, sizeof(MessageHeader));\n return false;\n }\n\n stream.read(buffer, sizeof(MessageHeader));\n if (!stream) {\n printf(\"Unexpected error reading header.\\n\");\n return false;\n }\n\n available_bytes -= sizeof(MessageHeader);\n\n auto& header = *reinterpret_cast<MessageHeader*>(buffer);\n buffer += sizeof(MessageHeader);\n\n \/\/ Read the message payload.\n if (available_bytes < header.payload_size_bytes) {\n printf(\"Not enough data: cannot read payload. [%zu bytes < %u bytes]\\n\",\n available_bytes, header.payload_size_bytes);\n return false;\n }\n\n stream.read(buffer, header.payload_size_bytes);\n if (!stream) {\n printf(\"Unexpected error reading payload.\\n\");\n return false;\n }\n\n \/\/ Verify the message checksum.\n size_t message_size = sizeof(MessageHeader) + header.payload_size_bytes;\n if (!IsValid(storage)) {\n printf(\n \"CRC failure. [type=%s (%u), size=%zu bytes (payload size=%u bytes], \"\n \"sequence=%u, expected_crc=0x%08x, calculated_crc=0x%08x]\\n\",\n to_string(header.message_type),\n static_cast<unsigned>(header.message_type), message_size,\n header.payload_size_bytes, header.sequence_number, header.crc,\n CalculateCRC(storage));\n return false;\n }\n\n \/\/ Check that the sequence number increments as expected.\n if (header.sequence_number != expected_sequence_number) {\n printf(\n \"Warning: unexpected sequence number. [type=%s (%u), size=%zu bytes \"\n \"(payload size=%u bytes], crc=0x%08x, expected_sequence=%u, \"\n \"received_sequence=%u]\\n\",\n to_string(header.message_type),\n static_cast<unsigned>(header.message_type), message_size,\n header.payload_size_bytes, header.crc, expected_sequence_number,\n header.sequence_number);\n }\n\n expected_sequence_number = header.sequence_number + 1;\n\n \/\/ Interpret the payload.\n if (header.message_type == MessageType::POSE) {\n auto& contents = *reinterpret_cast<PoseMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n\n printf(\"Received pose message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B]\\n\",\n p1_time_sec, header.sequence_number, message_size);\n printf(\" Position (LLA): %.6f, %.6f, %.3f (deg, deg, m)\\n\",\n contents.lla_deg[0], contents.lla_deg[1], contents.lla_deg[2]);\n printf(\" Attitude (YPR): %.2f, %.2f, %.2f (deg, deg, deg)\\n\",\n contents.ypr_deg[0], contents.ypr_deg[1], contents.ypr_deg[2]);\n printf(\" Velocity (Body): %.2f, %.2f, %.2f (m\/s, m\/s, m\/s)\\n\",\n contents.velocity_body_mps[0], contents.velocity_body_mps[1],\n contents.velocity_body_mps[2]);\n printf(\" Position Std Dev (ENU): %.2f, %.2f, %.2f (m, m, m)\\n\",\n contents.position_std_enu_m[0], contents.position_std_enu_m[1],\n contents.position_std_enu_m[2]);\n printf(\" Attitude Std Dev (YPR): %.2f, %.2f, %.2f (deg, deg, deg)\\n\",\n contents.ypr_std_deg[0], contents.ypr_std_deg[1],\n contents.ypr_std_deg[2]);\n printf(\" Velocity Std Dev (Body): %.2f, %.2f, %.2f (m\/s, m\/s, m\/s)\\n\",\n contents.velocity_std_body_mps[0], contents.velocity_std_body_mps[1],\n contents.velocity_std_body_mps[2]);\n printf(\" Protection Levels:\\n\");\n printf(\" Aggregate: %.2f m\\n\", contents.aggregate_protection_level_m);\n printf(\" Horizontal: %.2f m\\n\", contents.horizontal_protection_level_m);\n printf(\" Vertical: %.2f m\\n\", contents.vertical_protection_level_m);\n } else if (header.message_type == MessageType::GNSS_INFO) {\n auto& contents = *reinterpret_cast<GNSSInfoMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n double gps_time_sec =\n contents.gps_time.seconds + (contents.gps_time.fraction_ns * 1e-9);\n double last_diff_time_sec =\n contents.last_differential_time.seconds +\n (contents.last_differential_time.fraction_ns * 1e-9);\n\n printf(\n \"Received GNSS info message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B]\\n\",\n p1_time_sec, header.sequence_number, message_size);\n printf(\" GPS time: %.3f\\n\", gps_time_sec);\n printf(\" GPS time std dev: %.2e sec\\n\", contents.gps_time_std_sec);\n printf(\" Reference station: %s\\n\",\n contents.reference_station_id ==\n GNSSInfoMessage::INVALID_REFERENCE_STATION\n ? \"none\"\n : std::to_string(contents.reference_station_id).c_str());\n printf(\" Last differential time: %.3f\\n\", last_diff_time_sec);\n printf(\" GDOP: %.1f PDOP: %.1f\\n\", contents.gdop, contents.pdop);\n printf(\" HDOP: %.1f VDOP: %.1f\\n\", contents.hdop, contents.vdop);\n } else if (header.message_type == MessageType::GNSS_SATELLITE) {\n auto& contents = *reinterpret_cast<GNSSSatelliteMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n\n printf(\n \"Received GNSS satellite message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B, %u svs]\\n\",\n p1_time_sec, header.sequence_number, message_size,\n contents.num_satellites);\n\n for (unsigned i = 0; i < contents.num_satellites; ++i) {\n auto& sv = *reinterpret_cast<SatelliteInfo*>(buffer);\n buffer += sizeof(sv);\n\n printf(\" %s PRN %u:\\n\", to_string(sv.system), sv.prn);\n printf(\" Elevation\/azimuth: (%.1f, %.1f) deg\\n\", sv.elevation_deg,\n sv.azimuth_deg);\n printf(\" In solution: %s\\n\", sv.usage > 0 ? \"yes\" : \"no\");\n }\n } else {\n printf(\"Ignoring message type %s. [%u bytes]\\n\",\n to_string(header.message_type), header.payload_size_bytes);\n }\n\n return true;\n}\n\n\/******************************************************************************\/\nint main(int argc, const char* argv[]) {\n if (argc != 2) {\n printf(\"Usage: %s FILE\\n\", argv[0]);\n printf(R\"EOF(\nDecode platform pose messages from a binary file containing FusionEngine data.\n)EOF\");\n return 0;\n }\n\n \/\/ Open the file.\n std::ifstream stream(argv[1], std::ifstream::binary);\n if (!stream) {\n printf(\"Error opening file '%s'.\\n\", argv[1]);\n return 1;\n }\n\n \/\/ Determine the file size.\n stream.seekg(0, stream.end);\n std::streampos file_size_bytes = stream.tellg();\n stream.seekg(0, stream.beg);\n\n \/\/ Decode all messages in the file.\n int return_code = 0;\n while (stream.tellg() != file_size_bytes) {\n if (!DecodeMessage(stream,\n static_cast<size_t>(file_size_bytes - stream.tellg()))) {\n return_code = 1;\n break;\n }\n }\n\n \/\/ Close the file.\n stream.close();\n\n return return_code;\n}\n<commit_msg>Added GPS time to message decode example app.<commit_after>\/**************************************************************************\/ \/**\n* @brief Message decode example.\n* @file\n******************************************************************************\/\n\n#include <cstdint>\n#include <cstdio>\n#include <fstream>\n\n#include <point_one\/fusion_engine\/messages\/core.h>\n#include <point_one\/fusion_engine\/messages\/crc.h>\n\nusing namespace point_one::fusion_engine::messages;\n\n\/******************************************************************************\/\nbool DecodeMessage(std::ifstream& stream, size_t available_bytes) {\n static uint32_t expected_sequence_number = 0;\n\n \/\/ Enforce a 4-byte aligned address.\n alignas(4) uint8_t storage[4096];\n char* buffer = reinterpret_cast<char*>(storage);\n\n \/\/ Read the message header.\n if (available_bytes < sizeof(MessageHeader)) {\n printf(\"Not enough data: cannot read header. [%zu bytes < %zu bytes]\\n\",\n available_bytes, sizeof(MessageHeader));\n return false;\n }\n\n stream.read(buffer, sizeof(MessageHeader));\n if (!stream) {\n printf(\"Unexpected error reading header.\\n\");\n return false;\n }\n\n available_bytes -= sizeof(MessageHeader);\n\n auto& header = *reinterpret_cast<MessageHeader*>(buffer);\n buffer += sizeof(MessageHeader);\n\n \/\/ Read the message payload.\n if (available_bytes < header.payload_size_bytes) {\n printf(\"Not enough data: cannot read payload. [%zu bytes < %u bytes]\\n\",\n available_bytes, header.payload_size_bytes);\n return false;\n }\n\n stream.read(buffer, header.payload_size_bytes);\n if (!stream) {\n printf(\"Unexpected error reading payload.\\n\");\n return false;\n }\n\n \/\/ Verify the message checksum.\n size_t message_size = sizeof(MessageHeader) + header.payload_size_bytes;\n if (!IsValid(storage)) {\n printf(\n \"CRC failure. [type=%s (%u), size=%zu bytes (payload size=%u bytes], \"\n \"sequence=%u, expected_crc=0x%08x, calculated_crc=0x%08x]\\n\",\n to_string(header.message_type),\n static_cast<unsigned>(header.message_type), message_size,\n header.payload_size_bytes, header.sequence_number, header.crc,\n CalculateCRC(storage));\n return false;\n }\n\n \/\/ Check that the sequence number increments as expected.\n if (header.sequence_number != expected_sequence_number) {\n printf(\n \"Warning: unexpected sequence number. [type=%s (%u), size=%zu bytes \"\n \"(payload size=%u bytes], crc=0x%08x, expected_sequence=%u, \"\n \"received_sequence=%u]\\n\",\n to_string(header.message_type),\n static_cast<unsigned>(header.message_type), message_size,\n header.payload_size_bytes, header.crc, expected_sequence_number,\n header.sequence_number);\n }\n\n expected_sequence_number = header.sequence_number + 1;\n\n \/\/ Interpret the payload.\n if (header.message_type == MessageType::POSE) {\n auto& contents = *reinterpret_cast<PoseMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n\n static constexpr double SEC_PER_WEEK = 7 * 24 * 3600.0;\n double gps_time_sec =\n contents.gps_time.seconds + (contents.gps_time.fraction_ns * 1e-9);\n int gps_week = std::lround(gps_time_sec \/ SEC_PER_WEEK);\n double gps_tow_sec = gps_time_sec - (gps_week * SEC_PER_WEEK);\n\n printf(\"Received pose message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B]\\n\",\n p1_time_sec, header.sequence_number, message_size);\n printf(\" Position (LLA): %.6f, %.6f, %.3f (deg, deg, m)\\n\",\n contents.lla_deg[0], contents.lla_deg[1], contents.lla_deg[2]);\n printf(\" GPS Time: %d:%.3f (%.3f seconds)\\n\", gps_week, gps_tow_sec,\n gps_time_sec);\n printf(\" Attitude (YPR): %.2f, %.2f, %.2f (deg, deg, deg)\\n\",\n contents.ypr_deg[0], contents.ypr_deg[1], contents.ypr_deg[2]);\n printf(\" Velocity (Body): %.2f, %.2f, %.2f (m\/s, m\/s, m\/s)\\n\",\n contents.velocity_body_mps[0], contents.velocity_body_mps[1],\n contents.velocity_body_mps[2]);\n printf(\" Position Std Dev (ENU): %.2f, %.2f, %.2f (m, m, m)\\n\",\n contents.position_std_enu_m[0], contents.position_std_enu_m[1],\n contents.position_std_enu_m[2]);\n printf(\" Attitude Std Dev (YPR): %.2f, %.2f, %.2f (deg, deg, deg)\\n\",\n contents.ypr_std_deg[0], contents.ypr_std_deg[1],\n contents.ypr_std_deg[2]);\n printf(\" Velocity Std Dev (Body): %.2f, %.2f, %.2f (m\/s, m\/s, m\/s)\\n\",\n contents.velocity_std_body_mps[0], contents.velocity_std_body_mps[1],\n contents.velocity_std_body_mps[2]);\n printf(\" Protection Levels:\\n\");\n printf(\" Aggregate: %.2f m\\n\", contents.aggregate_protection_level_m);\n printf(\" Horizontal: %.2f m\\n\", contents.horizontal_protection_level_m);\n printf(\" Vertical: %.2f m\\n\", contents.vertical_protection_level_m);\n } else if (header.message_type == MessageType::GNSS_INFO) {\n auto& contents = *reinterpret_cast<GNSSInfoMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n double gps_time_sec =\n contents.gps_time.seconds + (contents.gps_time.fraction_ns * 1e-9);\n double last_diff_time_sec =\n contents.last_differential_time.seconds +\n (contents.last_differential_time.fraction_ns * 1e-9);\n\n printf(\n \"Received GNSS info message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B]\\n\",\n p1_time_sec, header.sequence_number, message_size);\n printf(\" GPS time: %.3f\\n\", gps_time_sec);\n printf(\" GPS time std dev: %.2e sec\\n\", contents.gps_time_std_sec);\n printf(\" Reference station: %s\\n\",\n contents.reference_station_id ==\n GNSSInfoMessage::INVALID_REFERENCE_STATION\n ? \"none\"\n : std::to_string(contents.reference_station_id).c_str());\n printf(\" Last differential time: %.3f\\n\", last_diff_time_sec);\n printf(\" GDOP: %.1f PDOP: %.1f\\n\", contents.gdop, contents.pdop);\n printf(\" HDOP: %.1f VDOP: %.1f\\n\", contents.hdop, contents.vdop);\n } else if (header.message_type == MessageType::GNSS_SATELLITE) {\n auto& contents = *reinterpret_cast<GNSSSatelliteMessage*>(buffer);\n buffer += sizeof(contents);\n\n double p1_time_sec =\n contents.p1_time.seconds + (contents.p1_time.fraction_ns * 1e-9);\n\n printf(\n \"Received GNSS satellite message @ P1 time %.3f seconds. [sequence=%u, \"\n \"size=%zu B, %u svs]\\n\",\n p1_time_sec, header.sequence_number, message_size,\n contents.num_satellites);\n\n for (unsigned i = 0; i < contents.num_satellites; ++i) {\n auto& sv = *reinterpret_cast<SatelliteInfo*>(buffer);\n buffer += sizeof(sv);\n\n printf(\" %s PRN %u:\\n\", to_string(sv.system), sv.prn);\n printf(\" Elevation\/azimuth: (%.1f, %.1f) deg\\n\", sv.elevation_deg,\n sv.azimuth_deg);\n printf(\" In solution: %s\\n\", sv.usage > 0 ? \"yes\" : \"no\");\n }\n } else {\n printf(\"Ignoring message type %s. [%u bytes]\\n\",\n to_string(header.message_type), header.payload_size_bytes);\n }\n\n return true;\n}\n\n\/******************************************************************************\/\nint main(int argc, const char* argv[]) {\n if (argc != 2) {\n printf(\"Usage: %s FILE\\n\", argv[0]);\n printf(R\"EOF(\nDecode platform pose messages from a binary file containing FusionEngine data.\n)EOF\");\n return 0;\n }\n\n \/\/ Open the file.\n std::ifstream stream(argv[1], std::ifstream::binary);\n if (!stream) {\n printf(\"Error opening file '%s'.\\n\", argv[1]);\n return 1;\n }\n\n \/\/ Determine the file size.\n stream.seekg(0, stream.end);\n std::streampos file_size_bytes = stream.tellg();\n stream.seekg(0, stream.beg);\n\n \/\/ Decode all messages in the file.\n int return_code = 0;\n while (stream.tellg() != file_size_bytes) {\n if (!DecodeMessage(stream,\n static_cast<size_t>(file_size_bytes - stream.tellg()))) {\n return_code = 1;\n break;\n }\n }\n\n \/\/ Close the file.\n stream.close();\n\n return return_code;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ ProxyPlayer.hpp\n\/\/ This will invoke another process and waits for a return code.\n\n#ifndef __PROXY_PLAYER_HPP__\n#define __PROXY_PLAYER_HPP__\n\n#include \"Player.hpp\"\n#include <string>\n#include <sstream>\n\n#undef UNICODE\n#define NOMINMAX\n#include <Windows.h>\n\nclass ProxyPlayer : public Player\n{\npublic:\n\t\/\/ Initialize with process (without .exe) and identifier of opponent.\n\tProxyPlayer(std::string const &process, std::string const &script = \"\", size_t opponent = -1)\n\t : Player(opponent), mProcess(process), mScript(script) {}\n\npublic:\n\t\/\/ Invoke other process.\n\tvirtual Action fight()\n\t{\n\t\tunsigned choice = executeWithArguments(getArguments(3));\n\t\tswitch (choice)\n\t\t{\n\t\tcase 48: return load();\n\t\tcase 49: return bullet();\n\t\tcase 50: return plasma();\n\t\tcase 45: return metal();\n\t\tcase 61: return thermal();\n\t\tdefault: return (Action)(-1);\n\t\t}\n\t}\n\n\t\/\/ Notify external program of result.\n\tvirtual void declared(Result result)\n\t{\n\t\tstd::string arguments;\n\t\tswitch (result)\n\t\t{\n\t\tcase WIN: arguments = getArguments(1);\n\t\tcase LOSS: arguments = getArguments(2);\n\t\tdefault: arguments = getArguments(0);\n\t\t}\n\t\texecuteWithArguments(arguments);\n\t};\n\nprivate:\n\t\/\/ External process name\n\tstd::string mProcess;\n\n\t\/\/ External script name (for non binary submissions)\n\tstd::string mScript;\n\n\t\/\/ Generates argument given game status.\n\tstd::string getArguments(size_t status)\n\t{\n\t\tstd::stringstream sst;\n\t\tsst << getOpponent()\n\t\t\t<< \" \" << getTurn()\n\t\t\t<< \" \" << status\n\t\t\t<< \" \" << getAmmo()\n\t\t\t<< \" \" << getAmmoOpponent();\n\t\tif (getTurn() > 0)\n\t\t{\n\t\t\tsst << \" \" << toActionString(getHistory())\n\t\t\t\t<< \" \" << toActionString(getHistoryOpponent());\n\t\t};\n\t\treturn sst.str();\n\t}\n\n\t\/\/ Execute process with given arguments.\n\tunsigned executeWithArguments(std::string const &arguments) const\n\t{\n\t\tSTARTUPINFO startup = { sizeof(startup) };\n\t\tPROCESS_INFORMATION process;\n\t\tLPSTR lpApplicationName;\n\t\tLPSTR lpCommandLine;\n\n\t\tlpApplicationName = const_cast<char *>(mProcess.c_str());\n\t\tif (mScript.length() == 0)\n\t\t{\n\t\t\t\/\/ Binary Proxy Player\n\t\t\t\/\/ name.exe arguments\n\t\t\tlpCommandLine = const_cast<char *>(arguments.c_str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Script Proxy Player\n\t\t\t\/\/ python.exe script.py arguments\n\t\t\tstd::string actualArguments = mScript;\n\t\t\tactualArguments.append(1, ' ');\n\t\t\tactualArguments.append(arguments);\n\t\t}\n\n\t\tstartup.cb = sizeof(startup);\n\t\tBOOL result = CreateProcess(lpApplicationName, lpCommandLine,\n\t\t\tNULL, NULL, TRUE, 0, NULL, NULL, &startup, &process);\n\n\t\tif (!result)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Wait for process to terminate and sanitize return code.\n\t\t\tDWORD exitCode;\n\t\t\tWaitForSingleObject(process.hProcess, INFINITE);\n\t\t\tGetExitCodeProcess(process.hProcess, &exitCode);\n\t\t\treturn exitCode;\n\t\t}\n\t}\n};\n\n\/\/ Example: BINARY_PLAYER(CustomPlayer)\n\/\/ Effects: Invoke CustomPlayer.exe <arguments>\n#define BINARY_PLAYER(x) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t\tx(size_t opponent = -1) : ProxyPlayer(#x \".exe\", opponent) {} \\\n\t};\n\n\/\/ Example: SCRIPT_PLAYER(CustomPlayer, \"python\", \"CustomScriptPlayer.py\")\n\/\/ Effects: Invoke python CustomScriptPlayer.py <arguments>\n#define SCRIPT_PLAYER(x, y, z) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t\tx(size_t opponent = -1) : ProxyPlayer(y, z, opponent) {} \\\n\t};\n\n#endif \/\/ !__CUSTOM_PLAYER_HPP__\n<commit_msg>Platform-agnostic implementation of ProxyPlayer (using system)<commit_after>\n\/\/ ProxyPlayer.hpp\n\/\/ This will invoke another process and waits for a return code.\n\n#ifndef __PROXY_PLAYER_HPP__\n#define __PROXY_PLAYER_HPP__\n\n#include \"Player.hpp\"\n#include <string>\n#include <sstream>\n\n#ifdef _WIN32\n#undef UNICODE\n#define NOMINMAX\n#include <Windows.h>\n#define EXE_SUFFIX \".exe\"\n#else\n#include <cstdlib>\n#define EXE_SUFFIX \"\"\n#endif\n\nclass ProxyPlayer : public Player\n{\npublic:\n\t\/\/ Initialize with process (without .exe) and identifier of opponent.\n\tProxyPlayer(std::string const &process, std::string const &script = \"\", size_t opponent = -1)\n\t : Player(opponent), mProcess(process), mScript(script) {}\n\npublic:\n\t\/\/ Invoke other process.\n\tvirtual Action fight()\n\t{\n\t\tunsigned choice = executeWithArguments(getArguments(3));\n\t\tswitch (choice)\n\t\t{\n\t\tcase 48: return load();\n\t\tcase 49: return bullet();\n\t\tcase 50: return plasma();\n\t\tcase 45: return metal();\n\t\tcase 61: return thermal();\n\t\tdefault: return (Action)(-1);\n\t\t}\n\t}\n\n\t\/\/ Notify external program of result.\n\tvirtual void declared(Result result)\n\t{\n\t\tstd::string arguments;\n\t\tswitch (result)\n\t\t{\n\t\tcase WIN: arguments = getArguments(1);\n\t\tcase LOSS: arguments = getArguments(2);\n\t\tdefault: arguments = getArguments(0);\n\t\t}\n\t\texecuteWithArguments(arguments);\n\t};\n\nprivate:\n\t\/\/ External process name\n\tstd::string mProcess;\n\n\t\/\/ External script name (for non binary submissions)\n\tstd::string mScript;\n\n\t\/\/ Generates argument given game status.\n\tstd::string getArguments(size_t status)\n\t{\n\t\tstd::stringstream sst;\n\t\tsst << getOpponent()\n\t\t\t<< \" \" << getTurn()\n\t\t\t<< \" \" << status\n\t\t\t<< \" \" << getAmmo()\n\t\t\t<< \" \" << getAmmoOpponent();\n\t\tif (getTurn() > 0)\n\t\t{\n\t\t\tsst << \" \" << toActionString(getHistory())\n\t\t\t\t<< \" \" << toActionString(getHistoryOpponent());\n\t\t};\n\t\treturn sst.str();\n\t}\n\n\t\/\/ Execute process with given arguments.\n\tunsigned executeWithArguments(std::string const &arguments) const\n\t{\n#ifdef _WIN32\n\t\tSTARTUPINFO startup = { sizeof(startup) };\n\t\tPROCESS_INFORMATION process;\n\t\tLPSTR lpApplicationName;\n\t\tLPSTR lpCommandLine;\n\n\t\tlpApplicationName = const_cast<char *>(mProcess.c_str());\n\t\tif (mScript.length() == 0)\n\t\t{\n\t\t\t\/\/ Binary Proxy Player\n\t\t\t\/\/ name.exe arguments\n\t\t\tlpCommandLine = const_cast<char *>(arguments.c_str());\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Script Proxy Player\n\t\t\t\/\/ python.exe script.py arguments\n\t\t\tstd::string actualArguments = mScript;\n\t\t\tactualArguments.append(1, ' ');\n\t\t\tactualArguments.append(arguments);\n\t\t}\n\n\t\tstartup.cb = sizeof(startup);\n\t\tBOOL result = CreateProcess(lpApplicationName, lpCommandLine,\n\t\t\tNULL, NULL, TRUE, 0, NULL, NULL, &startup, &process);\n\n\t\tif (!result)\n\t\t{\n\t\t\treturn -1;\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Wait for process to terminate and sanitize return code.\n\t\t\tDWORD exitCode;\n\t\t\tWaitForSingleObject(process.hProcess, INFINITE);\n\t\t\tGetExitCodeProcess(process.hProcess, &exitCode);\n\t\t\treturn exitCode;\n\t\t}\n#else\n\t\treturn std::system((mProcess + \" \" + mScript + \" \" + arguments).c_str());\n#endif\n\t}\n};\n\n\/\/ Example: BINARY_PLAYER(CustomPlayer)\n\/\/ Effects: Invoke CustomPlayer.exe <arguments>\n#define BINARY_PLAYER(x) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t x(size_t opponent = -1) : ProxyPlayer(#x EXE_SUFFIX, opponent) {} \\\n\t};\n\n\/\/ Example: SCRIPT_PLAYER(CustomPlayer, \"python\", \"CustomScriptPlayer.py\")\n\/\/ Effects: Invoke python CustomScriptPlayer.py <arguments>\n#define SCRIPT_PLAYER(x, y, z) \\\n\tclass x final : public ProxyPlayer \\\n\t{ \\\n\tpublic: \\\n\t\tx(size_t opponent = -1) : ProxyPlayer(y, z, opponent) {} \\\n\t};\n\n#endif \/\/ !__CUSTOM_PLAYER_HPP__\n<|endoftext|>"} {"text":"<commit_before>#include \"tables.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/INITIALIZIING\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace editor\n{\n int WIN_HEIGHT, WIN_WIDTH;\n WINDOW *ptrnwin;\n WINDOW *instwin;\n WINDOW *metawin;\n WINDOW *volwin;\n WINDOW *wavewin;\n WINDOW *dialog;\n\n WINDOW *wingroup;\n WINDOW *inputwin;\n WINDOW *lastwin;\n\n bool running;\n\n\n int numBuffer;\n char charBuffer[CHARBUFFER_SIZE];\n char charInputBuffer[CMDBAR_SIZE];\n\n char charInputHistory[HISTORY_SIZE][CMDBAR_SIZE];\n char history_head;\n char history_size;\n\n char lastSongPath[LASTSONG_SIZE];\n char textCursorPos;\n bool *muted_tracks;\n float playamp;\n\n Song *song;\n int daemonpid;\n Song *playback;\n unsigned char playback_length;\n unsigned char playback_mark;\n Instrument *selinst;\n}\n\n\/\/Pattern Editor\nnamespace patternedtr\n{\n std::map<int,unsigned int> notemap;\n Pattern *selptrn; \n unsigned char viewporttrack;\n unsigned char viewportrow;\n\n unsigned char maxtracksviewport;\n unsigned char maxrowsviewport;\n\n unsigned char selrow;\n unsigned char seltrack;\n unsigned char seltrackseg;\n unsigned char selorder;\n\n unsigned char selinstrument;\n unsigned char edit_step;\n unsigned char row_underline;\n unsigned char octave;\n unsigned char key;\n unsigned int entryclipboard;\n\n\n \/\/METADATA (Main controls)\n unsigned char metaobjindex;\n bool metaobjedit;\n\n unsigned char selobjmeta;\/\/x\n unsigned char selrowmeta;\/\/y\n\n}\n\n\/\/Instrument Editor\nnamespace instedtr\n{\n unsigned short waveclipboard;\n unsigned short volclipboard;\n\n bool instobjedit;\n unsigned char selinstrow;\n unsigned char selinstobj;\n unsigned short selwavrow;\n unsigned char selwavseg;\n unsigned short viewportwave;\n unsigned char viewportvol;\n\n\n unsigned char selvolrow;\n unsigned char selvolseg;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/DONE INITIALIZING\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n<commit_msg>Updated<commit_after>#include \"tables.h\"\n\n\/*This information was previously in main but was moved out to make test programs\n *\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/INITIALIZIING\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nnamespace editor\n{\n int WIN_HEIGHT, WIN_WIDTH;\n WINDOW *ptrnwin;\n WINDOW *instwin;\n WINDOW *metawin;\n WINDOW *volwin;\n WINDOW *wavewin;\n WINDOW *dialog;\n\n WINDOW *wingroup;\n WINDOW *inputwin;\n WINDOW *lastwin;\n\n bool running;\n\n\n int numBuffer;\n char charBuffer[CHARBUFFER_SIZE];\n char charInputBuffer[CMDBAR_SIZE];\n\n char charInputHistory[HISTORY_SIZE][CMDBAR_SIZE];\n char history_head;\n char history_size;\n\n char lastSongPath[LASTSONG_SIZE];\n char textCursorPos;\n bool *muted_tracks;\n float playamp;\n\n Song *song;\n int daemonpid;\n Song *playback;\n unsigned char playback_length;\n unsigned char playback_mark;\n Instrument *selinst;\n}\n\n\/\/Pattern Editor\nnamespace patternedtr\n{\n std::map<int,unsigned int> notemap;\n Pattern *selptrn; \n unsigned char viewporttrack;\n unsigned char viewportrow;\n\n unsigned char maxtracksviewport;\n unsigned char maxrowsviewport;\n\n unsigned char selrow;\n unsigned char seltrack;\n unsigned char seltrackseg;\n unsigned char selorder;\n\n unsigned char selinstrument;\n unsigned char edit_step;\n unsigned char row_underline;\n unsigned char octave;\n unsigned char key;\n unsigned int entryclipboard;\n\n\n \/\/METADATA (Main controls)\n unsigned char metaobjindex;\n bool metaobjedit;\n\n unsigned char selobjmeta;\/\/x\n unsigned char selrowmeta;\/\/y\n\n}\n\n\/\/Instrument Editor\nnamespace instedtr\n{\n unsigned short waveclipboard;\n unsigned short volclipboard;\n\n bool instobjedit;\n unsigned char selinstrow;\n unsigned char selinstobj;\n unsigned short selwavrow;\n unsigned char selwavseg;\n unsigned short viewportwave;\n unsigned char viewportvol;\n\n\n unsigned char selvolrow;\n unsigned char selvolseg;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/DONE INITIALIZING\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TKey.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 04:59:26 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef CONNECTIVITY_TKEY_HXX\n#define CONNECTIVITY_TKEY_HXX\n\n#ifndef _CONNECTIVITY_SDBCX_KEY_HXX_\n#include <connectivity\/sdbcx\/VKey.hxx>\n#endif\n#ifndef _COM_SUN_STAR_SDBC_XDATABASEMETADATA_HPP_\n#include <com\/sun\/star\/sdbc\/XDatabaseMetaData.hpp>\n#endif\n\nnamespace connectivity\n{\n class OTableHelper;\n class OTableKeyHelper : public connectivity::sdbcx::OKey\n {\n OTableHelper* m_pTable;\n public:\n virtual void refreshColumns();\n public:\n OTableKeyHelper( OTableHelper* _pTable);\n OTableKeyHelper( OTableHelper* _pTable,\n const ::rtl::OUString& _Name,\n const ::rtl::OUString& _ReferencedTable,\n sal_Int32 _Type,\n sal_Int32 _UpdateRule,\n sal_Int32 _DeleteRule\n );\n inline OTableHelper* getTable() const { return m_pTable; }\n };\n}\n#endif \/\/ CONNECTIVITY_TKEY_HXX\n\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.372); FILE MERGED 2008\/04\/01 10:52:41 thb 1.2.372.2: #i85898# Stripping all external header guards 2008\/03\/28 15:23:15 rt 1.2.372.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: TKey.hxx,v $\n * $Revision: 1.3 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef CONNECTIVITY_TKEY_HXX\n#define CONNECTIVITY_TKEY_HXX\n\n#include <connectivity\/sdbcx\/VKey.hxx>\n#include <com\/sun\/star\/sdbc\/XDatabaseMetaData.hpp>\n\nnamespace connectivity\n{\n class OTableHelper;\n class OTableKeyHelper : public connectivity::sdbcx::OKey\n {\n OTableHelper* m_pTable;\n public:\n virtual void refreshColumns();\n public:\n OTableKeyHelper( OTableHelper* _pTable);\n OTableKeyHelper( OTableHelper* _pTable,\n const ::rtl::OUString& _Name,\n const ::rtl::OUString& _ReferencedTable,\n sal_Int32 _Type,\n sal_Int32 _UpdateRule,\n sal_Int32 _DeleteRule\n );\n inline OTableHelper* getTable() const { return m_pTable; }\n };\n}\n#endif \/\/ CONNECTIVITY_TKEY_HXX\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <dali\/public-api\/dali-core.h>\n\n#include <application.h>\n#include <adaptor.h>\n#include <render-surface.h>\n#include <orientation.h>\n#include <timer.h>\n\nusing namespace Dali;\n\n\/*****************************************************************************\n * Test to see if the dali-adaptor is linking correctly.\n *\/\n\nclass LinkerApp : public ConnectionTracker\n{\npublic:\n LinkerApp(Application &app)\n {\n app.InitSignal().Connect(this, &LinkerApp::Create);\n }\n\npublic:\n\n void Create(Application& app)\n {\n }\n};\n\n\/*****************************************************************************\/\n\nint\nmain(int argc, char **argv)\n{\n Application app = Application::New(&argc, &argv);\n LinkerApp linkerApp (app);\n app.MainLoop();\n\n return 0;\n}\n<commit_msg>Fix prevent issue - uncaught exception<commit_after>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <dali\/public-api\/dali-core.h>\n\n#include <application.h>\n#include <adaptor.h>\n#include <render-surface.h>\n#include <orientation.h>\n#include <timer.h>\n#include <iostream>\n\nusing namespace Dali;\n\n\/*****************************************************************************\n * Test to see if the dali-adaptor is linking correctly.\n *\/\n\nclass LinkerApp : public ConnectionTracker\n{\npublic:\n LinkerApp(Application &app)\n {\n app.InitSignal().Connect(this, &LinkerApp::Create);\n }\n\npublic:\n\n void Create(Application& app)\n {\n }\n};\n\n\/*****************************************************************************\/\n\nint\nmain(int argc, char **argv)\n{\n Application app = Application::New(&argc, &argv);\n\n try\n {\n LinkerApp linkerApp (app);\n app.MainLoop();\n }\n catch(...)\n {\n std::cout << \"Exception caught\";\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>removed unused member variable<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#708338 Uninitialized scalar field<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\r\nCopyright (C) 2007 <SWGEmu>\r\n\r\nThis File is part of Core3.\r\n\r\nThis program is free software; you can redistribute\r\nit and\/or modify it under the terms of the GNU Lesser\r\nGeneral Public License as published by the Free Software\r\nFoundation; either version 2 of the License,\r\nor (at your option) any later version.\r\n\r\nThis program is distributed in the hope that it will be useful,\r\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\nSee the GNU Lesser General Public License for\r\nmore details.\r\n\r\nYou should have received a copy of the GNU Lesser General\r\nPublic License along with this program; if not, write to\r\nthe Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r\n\r\nLinking Engine3 statically or dynamically with other modules\r\nis making a combined work based on Engine3.\r\nThus, the terms and conditions of the GNU Lesser General Public License\r\ncover the whole combination.\r\n\r\nIn addition, as a special exception, the copyright holders of Engine3\r\ngive you permission to combine Engine3 program with free software\r\nprograms or libraries that are released under the GNU LGPL and with\r\ncode included in the standard release of Core3 under the GNU LGPL\r\nlicense (or modified versions of such code, with unchanged license).\r\nYou may copy and distribute such a system following the terms of the\r\nGNU LGPL for Engine3 and the licenses of the other code concerned,\r\nprovided that you include the source code of that other code when\r\nand as the GNU LGPL requires distribution of source code.\r\n\r\nNote that people who make modified versions of Engine3 are not obligated\r\nto grant this special exception for their modified versions;\r\nit is their choice whether to do so. The GNU Lesser General Public License\r\ngives permission to release a modified version without this exception;\r\nthis exception also makes it possible to release a modified version\r\nwhich carries forward this exception.\r\n*\/\r\n\r\n#include \"ServerCore.h\"\r\n\r\n#include \"db\/ServerDatabase.h\"\r\n\r\n#include \"db\/MantisDatabase.h\"\r\n\r\n#include \"chat\/ChatManager.h\"\r\n\r\n#include \"login\/LoginServer.h\"\r\n\r\n#include \"features\/Features.h\"\r\n\r\n#include \"ping\/PingServer.h\"\r\n\r\n#include \"status\/StatusServer.h\"\r\n\r\n#include \"web\/WebServer.h\"\r\n\r\n#include \"zone\/ZoneServer.h\"\r\n\r\n#include \"zone\/managers\/object\/ObjectManager.h\"\r\n#include \"zone\/managers\/templates\/TemplateManager.h\"\r\n\r\n#include \"zone\/objects\/creature\/CreatureObject.h\"\r\n\r\nManagedReference<ZoneServer*> ServerCore::zoneServerRef = NULL;\r\nSortedVector<String> ServerCore::arguments;\r\nbool ServerCore::truncateAllData = false;\r\n\r\nServerCore::ServerCore(bool truncateDatabases, SortedVector<String>& args) : Core(\"log\/core3.log\"), Logger(\"Core\") {\r\n\torb = NULL;\r\n\r\n\tloginServer = NULL;\r\n\tzoneServerRef = NULL;\r\n\tstatusServer = NULL;\r\n\tpingServer = NULL;\r\n\twebServer = NULL;\r\n\tdatabase = NULL;\r\n\r\n\ttruncateAllData = truncateDatabases;\r\n\targuments = args;\r\n\r\n\tconfigManager = ConfigManager::instance();\r\n\r\n\tfeatures = NULL;\r\n}\r\n\r\nclass ZoneStatisticsTask : public Task {\r\n\tManagedReference<ZoneServer*> zoneServer;\r\n\r\npublic:\r\n\tZoneStatisticsTask(ZoneServer* server) {\r\n\t\tzoneServer = server;\r\n\t}\r\n\r\n\tvoid run() {\r\n\t\tzoneServer->printInfo(true);\r\n\t}\r\n};\r\n\r\nvoid ServerCore::initialize() {\r\n\tinfo(\"starting up server..\");\r\n\r\n\tprocessConfig();\r\n\r\n\ttry {\r\n\t\tObjectManager* objectManager = ObjectManager::instance();\r\n\r\n\t\tdatabase = new ServerDatabase(configManager);\r\n\r\n\t\tmantisDatabase = new MantisDatabase(configManager);\r\n\r\n\t\tString& orbaddr = configManager->getORBNamingDirectoryAddress();\r\n\t\torb = DistributedObjectBroker::initialize(orbaddr, 44496);\r\n\r\n\t\torb->setCustomObjectManager(objectManager);\r\n\r\n\t\tif (configManager->getMakeLogin()) {\r\n\t\t\tloginServer = new LoginServer(configManager);\r\n\t\t\tloginServer->deploy(\"LoginServer\");\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeZone()) {\r\n\t\t\tZoneServer* zoneServer = new ZoneServer(configManager);\r\n\t\t\tzoneServer->deploy(\"ZoneServer\");\r\n\r\n\t\t\tzoneServerRef = zoneServer;\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakePing()) {\r\n\t\t\tpingServer = new PingServer();\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeStatus()) {\r\n\t\t\tstatusServer = new StatusServer(configManager, zoneServerRef);\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeWeb()) {\r\n\t\t\twebServer = WebServer::instance();\r\n\t\t}\r\n\r\n\t\tZoneServer* zoneServer = zoneServerRef.get();\r\n\r\n\t\tif (zoneServer != NULL) {\r\n\t\t\tint zonePort = 44463;\r\n\t\t\tint zoneAllowedConnections = configManager->getZoneAllowedConnections();\r\n\r\n\t\t\tObjectDatabaseManager* dbManager = ObjectDatabaseManager::instance();\r\n\t\t\tdbManager->loadDatabases(truncateDatabases());\r\n\r\n\t\t\tint galaxyID = configManager->getZoneGalaxyID();\r\n\r\n\t\t\tString query = \"SELECT port FROM galaxy WHERE galaxy_id = \" + String::valueOf(galaxyID);\r\n\t\t\tReference<ResultSet*> result = database->instance()->executeQuery(query);\r\n\r\n\t\t\tif (result != NULL && result->next()) {\r\n\t\t\t\tzonePort = result->getInt(0);\r\n\t\t\t}\r\n\r\n\t\t\tdatabase->instance()->executeStatement(\"TRUNCATE TABLE sessions\");\r\n\r\n\t\t\tdatabase->instance()->executeStatement(\"DELETE FROM characters_dirty WHERE galaxy_id = \" + String::valueOf(galaxyID));\r\n\r\n\t\t\tzoneServer->start(zonePort, zoneAllowedConnections);\r\n\t\t}\r\n\r\n\t\tif (statusServer != NULL) {\r\n\t\t\tint statusPort = configManager->getStatusPort();\r\n\t\t\tint statusAllowedConnections = configManager->getStatusAllowedConnections();\r\n\r\n\t\t\tstatusServer->start(statusPort);\r\n\t\t}\r\n\r\n\t\tif (webServer != NULL) {\r\n\t\t\twebServer->start(configManager);\r\n\t\t}\r\n\r\n\t\tif (pingServer != NULL) {\r\n\t\t\tint pingPort = configManager->getPingPort();\r\n\t\t\tint pingAllowedConnections = configManager->getPingAllowedConnections();\r\n\r\n\t\t\tpingServer->start(pingPort, pingAllowedConnections);\r\n\t\t}\r\n\r\n\t\tif (loginServer != NULL) {\r\n\t\t\tint loginPort = configManager->getLoginPort();\r\n\t\t\tint loginAllowedConnections = configManager->getLoginAllowedConnections();\r\n\r\n\t\t\tloginServer->start(loginPort, loginAllowedConnections);\r\n\t\t}\r\n\r\n\t#ifndef WITH_STM\r\n\t\tObjectManager::instance()->scheduleUpdateToDatabase();\r\n\t#else\r\n\t\tTask* statiscticsTask = new ZoneStatisticsTask(zoneServerRef);\r\n\t\tstatiscticsTask->schedulePeriodic(10000, 10000);\r\n\t#endif\r\n\r\n\t\tinfo(\"initialized\", true);\r\n\t} catch (ServiceException& e) {\r\n\t\tshutdown();\r\n\t} catch (DatabaseException& e) {\r\n\t\tinfo(e.getMessage());\r\n\r\n\t\texit(1);\r\n\t}\r\n}\r\n\r\nvoid ServerCore::run() {\r\n\thandleCommands();\r\n\r\n\tshutdown();\r\n}\r\n\r\nvoid ServerCore::shutdown() {\r\n\tinfo(\"shutting down server..\");\r\n\r\n\tObjectManager::instance()->cancelUpdateModifiedObjectsTask();\r\n\tObjectDatabaseManager::instance()->checkpoint();\r\n\r\n\tinfo(\"database checkpoint done\", true);\r\n\r\n\tif (statusServer != NULL) {\r\n\t\tstatusServer->stop();\r\n\r\n\t\tdelete statusServer;\r\n\t\tstatusServer = NULL;\r\n\t}\r\n\r\n\tif (webServer != NULL) {\r\n\t\twebServer->stop();\r\n\r\n\t\tdelete webServer;\r\n\t\twebServer = NULL;\r\n\t}\r\n\r\n\tZoneServer* zoneServer = zoneServerRef.get();\r\n\r\n\tif (zoneServer != NULL) {\r\n\t\tzoneServer->stop();\r\n\t\t\/\/zoneServer->finalize();\r\n\r\n\t\tzoneServer = NULL;\r\n\t}\r\n\r\n\tif (loginServer != NULL) {\r\n\t\tloginServer->stop();\r\n\r\n\t\tloginServer = NULL;\r\n\t}\r\n\r\n\tif (pingServer != NULL) {\r\n\t\tpingServer->stop();\r\n\r\n\t\tdelete pingServer;\r\n\t\tpingServer = NULL;\r\n\t}\r\n\r\n\tif (features != NULL) {\r\n\t\tdelete features;\r\n\t\tfeatures = NULL;\r\n\t}\r\n\r\n\tif (database != NULL) {\r\n\t\tdelete database;\r\n\t\tdatabase = NULL;\r\n\t}\r\n\r\n\tif (mantisDatabase != NULL) {\r\n\t\tdelete mantisDatabase;\r\n\t\tmantisDatabase = NULL;\r\n\t}\r\n\r\n\tzoneServerRef = NULL;\r\n\r\n\tinfo(\"server closed\");\r\n\r\n\t\/\/exit(1);\r\n}\r\n\r\nvoid ServerCore::handleCommands() {\r\n\twhile (true) {\r\n\r\n#ifdef WITH_STM\r\n\t\tReference<Transaction*> transaction = TransactionalMemoryManager::instance()->startTransaction();\r\n#endif\r\n\r\n\t\ttry {\r\n\t\t\tString fullCommand;\r\n\r\n\t\t\tThread::sleep(500);\r\n\r\n\t\t\tSystem::out << \"> \";\r\n\r\n\t\t\tchar line[256];\r\n\t\t\tfgets(line, sizeof(line), stdin);\r\n\r\n\t\t\tfullCommand = line;\r\n\t\t\tfullCommand = fullCommand.replaceFirst(\"\\n\", \"\");\r\n\r\n\t\t\tStringTokenizer tokenizer(fullCommand);\r\n\r\n\t\t\tString command, arguments;\r\n\r\n\t\t\tif (tokenizer.hasMoreTokens())\r\n\t\t\t\ttokenizer.getStringToken(command);\r\n\r\n\t\t\tif (tokenizer.hasMoreTokens())\r\n\t\t\t\ttokenizer.finalToken(arguments);\r\n\r\n\t\t\tZoneServer* zoneServer = zoneServerRef.getForUpdate();\r\n\r\n\t\t\tif (command == \"exit\") {\r\n\t\t\t\tif (zoneServer != NULL) {\r\n\t\t\t\t\tChatManager* chatManager = zoneServer->getChatManager();\r\n\t\t\t\t\tchatManager->broadcastGalaxy(NULL, \"Server is shutting down NOW!\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn;\r\n\t\t\t} else if (command == \"dumpmem\") {\r\n\t\t\t\t#ifdef DEBUG_MEMORY\r\n\t\t\t\t\tDumpUnfreed(TRUE);\r\n\t\t\t\t#endif\r\n\t\t\t} else if (command == \"logQuadTree\") {\r\n\t\t\t\tQuadTree::setLogging(!QuadTree::doLog());\r\n\t\t\t} else if (command == \"info\") {\r\n\t\t\t\t\/\/TaskManager::instance()->printInfo();\r\n\r\n\t\t\t\tif (loginServer != NULL)\r\n\t\t\t\t\tloginServer->printInfo();\r\n\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->printInfo(true);\r\n\r\n\t\t\t\tif (pingServer != NULL)\r\n\t\t\t\t\tpingServer->printInfo();\r\n\t\t\t} else if (command == \"lock\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->setServerStateLocked();\r\n\t\t\t} else if (command == \"unlock\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->setServerStateOnline();\r\n\t\t\t} else if (command == \"icap\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->changeUserCap(50);\r\n\t\t\t} else if (command == \"dcap\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->changeUserCap(-50);\r\n\t\t\t} else if (command == \"fixQueue\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->fixScheduler();\r\n\t\t\t} else if (command == \"crash\") {\r\n\t\t\t\tzoneServer = NULL;\r\n\r\n\t\t\t\tzoneServer->fixScheduler();\r\n\t\t\t} else if (command == \"save\") {\r\n\t\t\t\tObjectManager::instance()->updateModifiedObjectsToDatabase(true);\r\n\t\t\t\t\/\/ObjectDatabaseManager::instance()->checkpoint();\r\n\t\t\t} else if (command == \"help\") {\r\n\t\t\t\tSystem::out << \"available commands:\\n\";\r\n\t\t\t\tSystem::out << \"\\texit, logQuadTree, info, icap, dcap, fixQueue, crash, about.\\n\";\r\n\t\t\t} else if (command == \"about\") {\r\n\t\t\t\tSystem::out << \"Core3 Uber Edition. Ultyma pwns you.\\n\";\r\n\t\t\t} else if (command == \"lookupcrc\") {\r\n\t\t\t\tuint32 crc = 0;\r\n\t\t\t\ttry {\r\n\t\t\t\t\tcrc = UnsignedInteger::valueOf(arguments);\r\n\t\t\t\t} catch (Exception& e) {\r\n\t\t\t\t\tSystem::out << \"invalid crc number expected dec\";\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (crc != 0) {\r\n\t\t\t\t\tString file = TemplateManager::instance()->getTemplateFile(crc);\r\n\r\n\t\t\t\t\tSystem::out << \"result: \" << file << endl;\r\n\t\t\t\t}\r\n\r\n\t\t\t} else if (command == \"rev\") {\r\n\t\t\t\tSystem::out << ConfigManager::instance()->getRevision() << endl;\r\n\t\t\t} else\r\n\t\t\t\tSystem::out << \"unknown command (\" << command << \")\\n\";\r\n\t\t} catch (SocketException& e) {\r\n\t\t\tSystem::out << \"[ServerCore] \" << e.getMessage();\r\n\t\t} catch (ArrayIndexOutOfBoundsException& e) {\r\n\t\t\tSystem::out << \"[ServerCore] \" << e.getMessage() << \"\\n\";\r\n\t\t} catch (Exception& e) {\r\n\t\t\tSystem::out << \"[ServerCore] unreported Exception caught\\n\";\r\n\t\t}\r\n\r\n#ifdef WITH_STM\r\n\t\ttry {\r\n\t\t\tTransactionalMemoryManager::commitPureTransaction(transaction);\r\n\t\t} catch (const TransactionAbortedException& e) {\r\n\t\t}\r\n\t#endif\r\n\r\n\t}\r\n}\r\n\r\nvoid ServerCore::processConfig() {\r\n\tif (!configManager->loadConfigData())\r\n\t\tinfo(\"missing config file.. loading default values\\n\");\r\n\r\n\t\/\/if (!features->loadFeatures())\r\n\t\t\/\/info(\"Problem occurred trying to load features.lua\");\r\n}\r\n<commit_msg>[fixed] error message on db exception while loading<commit_after>\/*\r\nCopyright (C) 2007 <SWGEmu>\r\n\r\nThis File is part of Core3.\r\n\r\nThis program is free software; you can redistribute\r\nit and\/or modify it under the terms of the GNU Lesser\r\nGeneral Public License as published by the Free Software\r\nFoundation; either version 2 of the License,\r\nor (at your option) any later version.\r\n\r\nThis program is distributed in the hope that it will be useful,\r\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\r\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\r\nSee the GNU Lesser General Public License for\r\nmore details.\r\n\r\nYou should have received a copy of the GNU Lesser General\r\nPublic License along with this program; if not, write to\r\nthe Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r\n\r\nLinking Engine3 statically or dynamically with other modules\r\nis making a combined work based on Engine3.\r\nThus, the terms and conditions of the GNU Lesser General Public License\r\ncover the whole combination.\r\n\r\nIn addition, as a special exception, the copyright holders of Engine3\r\ngive you permission to combine Engine3 program with free software\r\nprograms or libraries that are released under the GNU LGPL and with\r\ncode included in the standard release of Core3 under the GNU LGPL\r\nlicense (or modified versions of such code, with unchanged license).\r\nYou may copy and distribute such a system following the terms of the\r\nGNU LGPL for Engine3 and the licenses of the other code concerned,\r\nprovided that you include the source code of that other code when\r\nand as the GNU LGPL requires distribution of source code.\r\n\r\nNote that people who make modified versions of Engine3 are not obligated\r\nto grant this special exception for their modified versions;\r\nit is their choice whether to do so. The GNU Lesser General Public License\r\ngives permission to release a modified version without this exception;\r\nthis exception also makes it possible to release a modified version\r\nwhich carries forward this exception.\r\n*\/\r\n\r\n#include \"ServerCore.h\"\r\n\r\n#include \"db\/ServerDatabase.h\"\r\n\r\n#include \"db\/MantisDatabase.h\"\r\n\r\n#include \"chat\/ChatManager.h\"\r\n\r\n#include \"login\/LoginServer.h\"\r\n\r\n#include \"features\/Features.h\"\r\n\r\n#include \"ping\/PingServer.h\"\r\n\r\n#include \"status\/StatusServer.h\"\r\n\r\n#include \"web\/WebServer.h\"\r\n\r\n#include \"zone\/ZoneServer.h\"\r\n\r\n#include \"zone\/managers\/object\/ObjectManager.h\"\r\n#include \"zone\/managers\/templates\/TemplateManager.h\"\r\n\r\n#include \"zone\/objects\/creature\/CreatureObject.h\"\r\n\r\nManagedReference<ZoneServer*> ServerCore::zoneServerRef = NULL;\r\nSortedVector<String> ServerCore::arguments;\r\nbool ServerCore::truncateAllData = false;\r\n\r\nServerCore::ServerCore(bool truncateDatabases, SortedVector<String>& args) : Core(\"log\/core3.log\"), Logger(\"Core\") {\r\n\torb = NULL;\r\n\r\n\tloginServer = NULL;\r\n\tzoneServerRef = NULL;\r\n\tstatusServer = NULL;\r\n\tpingServer = NULL;\r\n\twebServer = NULL;\r\n\tdatabase = NULL;\r\n\r\n\ttruncateAllData = truncateDatabases;\r\n\targuments = args;\r\n\r\n\tconfigManager = ConfigManager::instance();\r\n\r\n\tfeatures = NULL;\r\n}\r\n\r\nclass ZoneStatisticsTask : public Task {\r\n\tManagedReference<ZoneServer*> zoneServer;\r\n\r\npublic:\r\n\tZoneStatisticsTask(ZoneServer* server) {\r\n\t\tzoneServer = server;\r\n\t}\r\n\r\n\tvoid run() {\r\n\t\tzoneServer->printInfo(true);\r\n\t}\r\n};\r\n\r\nvoid ServerCore::initialize() {\r\n\tinfo(\"starting up server..\");\r\n\r\n\tprocessConfig();\r\n\r\n\ttry {\r\n\t\tObjectManager* objectManager = ObjectManager::instance();\r\n\r\n\t\tdatabase = new ServerDatabase(configManager);\r\n\r\n\t\tmantisDatabase = new MantisDatabase(configManager);\r\n\r\n\t\tString& orbaddr = configManager->getORBNamingDirectoryAddress();\r\n\t\torb = DistributedObjectBroker::initialize(orbaddr, 44496);\r\n\r\n\t\torb->setCustomObjectManager(objectManager);\r\n\r\n\t\tif (configManager->getMakeLogin()) {\r\n\t\t\tloginServer = new LoginServer(configManager);\r\n\t\t\tloginServer->deploy(\"LoginServer\");\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeZone()) {\r\n\t\t\tZoneServer* zoneServer = new ZoneServer(configManager);\r\n\t\t\tzoneServer->deploy(\"ZoneServer\");\r\n\r\n\t\t\tzoneServerRef = zoneServer;\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakePing()) {\r\n\t\t\tpingServer = new PingServer();\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeStatus()) {\r\n\t\t\tstatusServer = new StatusServer(configManager, zoneServerRef);\r\n\t\t}\r\n\r\n\t\tif (configManager->getMakeWeb()) {\r\n\t\t\twebServer = WebServer::instance();\r\n\t\t}\r\n\r\n\t\tZoneServer* zoneServer = zoneServerRef.get();\r\n\r\n\t\tif (zoneServer != NULL) {\r\n\t\t\tint zonePort = 44463;\r\n\t\t\tint zoneAllowedConnections = configManager->getZoneAllowedConnections();\r\n\r\n\t\t\tObjectDatabaseManager* dbManager = ObjectDatabaseManager::instance();\r\n\t\t\tdbManager->loadDatabases(truncateDatabases());\r\n\r\n\t\t\tint galaxyID = configManager->getZoneGalaxyID();\r\n\r\n\t\t\ttry {\r\n\t\t\t\tString query = \"SELECT port FROM galaxy WHERE galaxy_id = \" + String::valueOf(galaxyID);\r\n\t\t\t\tReference<ResultSet*> result = database->instance()->executeQuery(query);\r\n\r\n\t\t\t\tif (result != NULL && result->next()) {\r\n\t\t\t\t\tzonePort = result->getInt(0);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tdatabase->instance()->executeStatement(\"TRUNCATE TABLE sessions\");\r\n\r\n\t\t\t\tdatabase->instance()->executeStatement(\"DELETE FROM characters_dirty WHERE galaxy_id = \" + String::valueOf(galaxyID));\r\n\t\t\t} catch (DatabaseException& e) {\r\n\t\t\t\terror(e.getMessage());\r\n\r\n\t\t\t\texit(1);\r\n\t\t\t}\r\n\r\n\t\t\tzoneServer->start(zonePort, zoneAllowedConnections);\r\n\t\t}\r\n\r\n\t\tif (statusServer != NULL) {\r\n\t\t\tint statusPort = configManager->getStatusPort();\r\n\t\t\tint statusAllowedConnections = configManager->getStatusAllowedConnections();\r\n\r\n\t\t\tstatusServer->start(statusPort);\r\n\t\t}\r\n\r\n\t\tif (webServer != NULL) {\r\n\t\t\twebServer->start(configManager);\r\n\t\t}\r\n\r\n\t\tif (pingServer != NULL) {\r\n\t\t\tint pingPort = configManager->getPingPort();\r\n\t\t\tint pingAllowedConnections = configManager->getPingAllowedConnections();\r\n\r\n\t\t\tpingServer->start(pingPort, pingAllowedConnections);\r\n\t\t}\r\n\r\n\t\tif (loginServer != NULL) {\r\n\t\t\tint loginPort = configManager->getLoginPort();\r\n\t\t\tint loginAllowedConnections = configManager->getLoginAllowedConnections();\r\n\r\n\t\t\tloginServer->start(loginPort, loginAllowedConnections);\r\n\t\t}\r\n\r\n\t#ifndef WITH_STM\r\n\t\tObjectManager::instance()->scheduleUpdateToDatabase();\r\n\t#else\r\n\t\tTask* statiscticsTask = new ZoneStatisticsTask(zoneServerRef);\r\n\t\tstatiscticsTask->schedulePeriodic(10000, 10000);\r\n\t#endif\r\n\r\n\t\tinfo(\"initialized\", true);\r\n\t} catch (ServiceException& e) {\r\n\t\tshutdown();\r\n\t} catch (DatabaseException& e) {\r\n\t\tinfo(e.getMessage());\r\n\r\n\t\texit(1);\r\n\t}\r\n}\r\n\r\nvoid ServerCore::run() {\r\n\thandleCommands();\r\n\r\n\tshutdown();\r\n}\r\n\r\nvoid ServerCore::shutdown() {\r\n\tinfo(\"shutting down server..\");\r\n\r\n\tObjectManager::instance()->cancelUpdateModifiedObjectsTask();\r\n\tObjectDatabaseManager::instance()->checkpoint();\r\n\r\n\tinfo(\"database checkpoint done\", true);\r\n\r\n\tif (statusServer != NULL) {\r\n\t\tstatusServer->stop();\r\n\r\n\t\tdelete statusServer;\r\n\t\tstatusServer = NULL;\r\n\t}\r\n\r\n\tif (webServer != NULL) {\r\n\t\twebServer->stop();\r\n\r\n\t\tdelete webServer;\r\n\t\twebServer = NULL;\r\n\t}\r\n\r\n\tZoneServer* zoneServer = zoneServerRef.get();\r\n\r\n\tif (zoneServer != NULL) {\r\n\t\tzoneServer->stop();\r\n\t\t\/\/zoneServer->finalize();\r\n\r\n\t\tzoneServer = NULL;\r\n\t}\r\n\r\n\tif (loginServer != NULL) {\r\n\t\tloginServer->stop();\r\n\r\n\t\tloginServer = NULL;\r\n\t}\r\n\r\n\tif (pingServer != NULL) {\r\n\t\tpingServer->stop();\r\n\r\n\t\tdelete pingServer;\r\n\t\tpingServer = NULL;\r\n\t}\r\n\r\n\tif (features != NULL) {\r\n\t\tdelete features;\r\n\t\tfeatures = NULL;\r\n\t}\r\n\r\n\tif (database != NULL) {\r\n\t\tdelete database;\r\n\t\tdatabase = NULL;\r\n\t}\r\n\r\n\tif (mantisDatabase != NULL) {\r\n\t\tdelete mantisDatabase;\r\n\t\tmantisDatabase = NULL;\r\n\t}\r\n\r\n\tzoneServerRef = NULL;\r\n\r\n\tinfo(\"server closed\");\r\n\r\n\t\/\/exit(1);\r\n}\r\n\r\nvoid ServerCore::handleCommands() {\r\n\twhile (true) {\r\n\r\n#ifdef WITH_STM\r\n\t\tReference<Transaction*> transaction = TransactionalMemoryManager::instance()->startTransaction();\r\n#endif\r\n\r\n\t\ttry {\r\n\t\t\tString fullCommand;\r\n\r\n\t\t\tThread::sleep(500);\r\n\r\n\t\t\tSystem::out << \"> \";\r\n\r\n\t\t\tchar line[256];\r\n\t\t\tfgets(line, sizeof(line), stdin);\r\n\r\n\t\t\tfullCommand = line;\r\n\t\t\tfullCommand = fullCommand.replaceFirst(\"\\n\", \"\");\r\n\r\n\t\t\tStringTokenizer tokenizer(fullCommand);\r\n\r\n\t\t\tString command, arguments;\r\n\r\n\t\t\tif (tokenizer.hasMoreTokens())\r\n\t\t\t\ttokenizer.getStringToken(command);\r\n\r\n\t\t\tif (tokenizer.hasMoreTokens())\r\n\t\t\t\ttokenizer.finalToken(arguments);\r\n\r\n\t\t\tZoneServer* zoneServer = zoneServerRef.getForUpdate();\r\n\r\n\t\t\tif (command == \"exit\") {\r\n\t\t\t\tif (zoneServer != NULL) {\r\n\t\t\t\t\tChatManager* chatManager = zoneServer->getChatManager();\r\n\t\t\t\t\tchatManager->broadcastGalaxy(NULL, \"Server is shutting down NOW!\");\r\n\t\t\t\t}\r\n\r\n\t\t\t\treturn;\r\n\t\t\t} else if (command == \"dumpmem\") {\r\n\t\t\t\t#ifdef DEBUG_MEMORY\r\n\t\t\t\t\tDumpUnfreed(TRUE);\r\n\t\t\t\t#endif\r\n\t\t\t} else if (command == \"logQuadTree\") {\r\n\t\t\t\tQuadTree::setLogging(!QuadTree::doLog());\r\n\t\t\t} else if (command == \"info\") {\r\n\t\t\t\t\/\/TaskManager::instance()->printInfo();\r\n\r\n\t\t\t\tif (loginServer != NULL)\r\n\t\t\t\t\tloginServer->printInfo();\r\n\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->printInfo(true);\r\n\r\n\t\t\t\tif (pingServer != NULL)\r\n\t\t\t\t\tpingServer->printInfo();\r\n\t\t\t} else if (command == \"lock\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->setServerStateLocked();\r\n\t\t\t} else if (command == \"unlock\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->setServerStateOnline();\r\n\t\t\t} else if (command == \"icap\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->changeUserCap(50);\r\n\t\t\t} else if (command == \"dcap\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->changeUserCap(-50);\r\n\t\t\t} else if (command == \"fixQueue\") {\r\n\t\t\t\tif (zoneServer != NULL)\r\n\t\t\t\t\tzoneServer->fixScheduler();\r\n\t\t\t} else if (command == \"crash\") {\r\n\t\t\t\tzoneServer = NULL;\r\n\r\n\t\t\t\tzoneServer->fixScheduler();\r\n\t\t\t} else if (command == \"save\") {\r\n\t\t\t\tObjectManager::instance()->updateModifiedObjectsToDatabase(true);\r\n\t\t\t\t\/\/ObjectDatabaseManager::instance()->checkpoint();\r\n\t\t\t} else if (command == \"help\") {\r\n\t\t\t\tSystem::out << \"available commands:\\n\";\r\n\t\t\t\tSystem::out << \"\\texit, logQuadTree, info, icap, dcap, fixQueue, crash, about.\\n\";\r\n\t\t\t} else if (command == \"about\") {\r\n\t\t\t\tSystem::out << \"Core3 Uber Edition. Ultyma pwns you.\\n\";\r\n\t\t\t} else if (command == \"lookupcrc\") {\r\n\t\t\t\tuint32 crc = 0;\r\n\t\t\t\ttry {\r\n\t\t\t\t\tcrc = UnsignedInteger::valueOf(arguments);\r\n\t\t\t\t} catch (Exception& e) {\r\n\t\t\t\t\tSystem::out << \"invalid crc number expected dec\";\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (crc != 0) {\r\n\t\t\t\t\tString file = TemplateManager::instance()->getTemplateFile(crc);\r\n\r\n\t\t\t\t\tSystem::out << \"result: \" << file << endl;\r\n\t\t\t\t}\r\n\r\n\t\t\t} else if (command == \"rev\") {\r\n\t\t\t\tSystem::out << ConfigManager::instance()->getRevision() << endl;\r\n\t\t\t} else\r\n\t\t\t\tSystem::out << \"unknown command (\" << command << \")\\n\";\r\n\t\t} catch (SocketException& e) {\r\n\t\t\tSystem::out << \"[ServerCore] \" << e.getMessage();\r\n\t\t} catch (ArrayIndexOutOfBoundsException& e) {\r\n\t\t\tSystem::out << \"[ServerCore] \" << e.getMessage() << \"\\n\";\r\n\t\t} catch (Exception& e) {\r\n\t\t\tSystem::out << \"[ServerCore] unreported Exception caught\\n\";\r\n\t\t}\r\n\r\n#ifdef WITH_STM\r\n\t\ttry {\r\n\t\t\tTransactionalMemoryManager::commitPureTransaction(transaction);\r\n\t\t} catch (const TransactionAbortedException& e) {\r\n\t\t}\r\n\t#endif\r\n\r\n\t}\r\n}\r\n\r\nvoid ServerCore::processConfig() {\r\n\tif (!configManager->loadConfigData())\r\n\t\tinfo(\"missing config file.. loading default values\\n\");\r\n\r\n\t\/\/if (!features->loadFeatures())\r\n\t\t\/\/info(\"Problem occurred trying to load features.lua\");\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/lazy_entry.hpp\"\n#include \"libtorrent\/magnet_uri.hpp\"\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tprintf(\"sizeof(file_entry): %d\\n\", int(sizeof(file_entry)));\n\n\tif (argc != 2)\n\t{\n\t\tfputs(\"usage: dump_torrent torrent-file\\n\", stderr);\n\t\treturn 1;\n\t}\n\n\tint size = file_size(argv[1]);\n\tif (size > 10 * 1000000)\n\t{\n\t\tfprintf(stderr, \"file too big (%d), aborting\\n\", size);\n\t\treturn 1;\n\t}\n\tstd::vector<char> buf(size);\n\tint ret = load_file(argv[1], buf);\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to load file: %d\\n\", ret);\n\t\treturn 1;\n\t}\n\tlazy_entry e;\n\terror_code ec;\n\tint pos;\n\tret = lazy_bdecode(&buf[0], &buf[0] + buf.size(), e, ec, &pos);\n\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to decode: '%s' at character: %d\\n\", ec.message().c_str(), pos);\n\t\treturn 1;\n\t}\n\n\/\/\tprintf(\"\\n\\n----- raw info -----\\n\\n%s\\n\", print_entry(e).c_str());\n\n\ttorrent_info t(e, ec);\n\tif (ec)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\te.clear();\n\tstd::vector<char>().swap(buf);\n\n\t\/\/ print info about torrent\n\tprintf(\"\\n\\n----- torrent file info -----\\n\\n\"\n\t\t\"nodes:\\n\");\n\n\ttypedef std::vector<std::pair<std::string, int> > node_vec;\n\tnode_vec const& nodes = t.nodes();\n\tfor (node_vec::const_iterator i = nodes.begin(), end(nodes.end());\n\t\ti != end; ++i)\n\t{\n\t\tprintf(\"%s: %d\\n\", i->first.c_str(), i->second);\n\t}\n\tputs(\"trackers:\\n\");\n\tfor (std::vector<announce_entry>::const_iterator i = t.trackers().begin();\n\t\ti != t.trackers().end(); ++i)\n\t{\n\t\tprintf(\"%2d: %s\\n\", i->tier, i->url.c_str());\n\t}\n\n\tchar ih[41];\n\tto_hex((char const*)&t.info_hash()[0], 20, ih);\n\tprintf(\"number of pieces: %d\\n\"\n\t\t\"piece length: %d\\n\"\n\t\t\"info hash: %s\\n\"\n\t\t\"comment: %s\\n\"\n\t\t\"created by: %s\\n\"\n\t\t\"magnet link: %s\\n\"\n\t\t\"name: %s\\n\"\n\t\t\"number of files: %d\\n\"\n\t\t\"files:\\n\"\n\t\t, t.num_pieces()\n\t\t, t.piece_length()\n\t\t, ih\n\t\t, t.comment().c_str()\n\t\t, t.creator().c_str()\n\t\t, make_magnet_uri(t).c_str()\n\t\t, t.name().c_str()\n\t\t, t.num_files());\n\tint index = 0;\n\tfor (torrent_info::file_iterator i = t.begin_files();\n\t\ti != t.end_files(); ++i, ++index)\n\t{\n\t\tint first = t.map_file(index, 0, 0).piece;\n\t\tint last = t.map_file(index, (std::max)(i->size-1, size_type(0)), 0).piece;\n\t\tprintf(\" %11\"PRId64\" %c%c%c%c [ %4d, %4d ] %7u %s %s %s%s\\n\"\n\t\t\t, i->size\n\t\t\t, (i->pad_file?'p':'-')\n\t\t\t, (i->executable_attribute?'x':'-')\n\t\t\t, (i->hidden_attribute?'h':'-')\n\t\t\t, (i->symlink_attribute?'l':'-')\n\t\t\t, first, last\n\t\t\t, boost::uint32_t(t.files().mtime(*i))\n\t\t\t, t.files().hash(*i) != sha1_hash(0) ? to_hex(t.files().hash(*i).to_string()).c_str() : \"\"\n\t\t\t, t.files().file_path(*i).c_str()\n\t\t\t, i->symlink_attribute ? \"-> \": \"\"\n\t\t\t, i->symlink_attribute && i->symlink_index != -1 ? t.files().symlink(*i).c_str() : \"\");\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>temporary commented out code<commit_after>\/*\n\nCopyright (c) 2003, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/lazy_entry.hpp\"\n#include \"libtorrent\/magnet_uri.hpp\"\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tprintf(\"sizeof(file_entry): %d\\n\", int(sizeof(file_entry)));\n\n\tif (argc != 2)\n\t{\n\t\tfputs(\"usage: dump_torrent torrent-file\\n\", stderr);\n\t\treturn 1;\n\t}\n\n\tint size = file_size(argv[1]);\n\tif (size > 10 * 1000000)\n\t{\n\t\tfprintf(stderr, \"file too big (%d), aborting\\n\", size);\n\t\treturn 1;\n\t}\n\tstd::vector<char> buf(size);\n\tint ret = load_file(argv[1], buf);\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to load file: %d\\n\", ret);\n\t\treturn 1;\n\t}\n\tlazy_entry e;\n\terror_code ec;\n\tint pos;\n\tret = lazy_bdecode(&buf[0], &buf[0] + buf.size(), e, ec, &pos);\n\n\tif (ret != 0)\n\t{\n\t\tfprintf(stderr, \"failed to decode: '%s' at character: %d\\n\", ec.message().c_str(), pos);\n\t\treturn 1;\n\t}\n\n\tprintf(\"\\n\\n----- raw info -----\\n\\n%s\\n\", print_entry(e).c_str());\n\n\ttorrent_info t(e, ec);\n\tif (ec)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\treturn 1;\n\t}\n\te.clear();\n\tstd::vector<char>().swap(buf);\n\n\t\/\/ print info about torrent\n\tprintf(\"\\n\\n----- torrent file info -----\\n\\n\"\n\t\t\"nodes:\\n\");\n\n\ttypedef std::vector<std::pair<std::string, int> > node_vec;\n\tnode_vec const& nodes = t.nodes();\n\tfor (node_vec::const_iterator i = nodes.begin(), end(nodes.end());\n\t\ti != end; ++i)\n\t{\n\t\tprintf(\"%s: %d\\n\", i->first.c_str(), i->second);\n\t}\n\tputs(\"trackers:\\n\");\n\tfor (std::vector<announce_entry>::const_iterator i = t.trackers().begin();\n\t\ti != t.trackers().end(); ++i)\n\t{\n\t\tprintf(\"%2d: %s\\n\", i->tier, i->url.c_str());\n\t}\n\n\tchar ih[41];\n\tto_hex((char const*)&t.info_hash()[0], 20, ih);\n\tprintf(\"number of pieces: %d\\n\"\n\t\t\"piece length: %d\\n\"\n\t\t\"info hash: %s\\n\"\n\t\t\"comment: %s\\n\"\n\t\t\"created by: %s\\n\"\n\t\t\"magnet link: %s\\n\"\n\t\t\"name: %s\\n\"\n\t\t\"number of files: %d\\n\"\n\t\t\"files:\\n\"\n\t\t, t.num_pieces()\n\t\t, t.piece_length()\n\t\t, ih\n\t\t, t.comment().c_str()\n\t\t, t.creator().c_str()\n\t\t, make_magnet_uri(t).c_str()\n\t\t, t.name().c_str()\n\t\t, t.num_files());\n\tint index = 0;\n\tfor (torrent_info::file_iterator i = t.begin_files();\n\t\ti != t.end_files(); ++i, ++index)\n\t{\n\t\tint first = t.map_file(index, 0, 0).piece;\n\t\tint last = t.map_file(index, (std::max)(i->size-1, size_type(0)), 0).piece;\n\t\tprintf(\" %11\"PRId64\" %c%c%c%c [ %4d, %4d ] %7u %s %s %s%s\\n\"\n\t\t\t, i->size\n\t\t\t, (i->pad_file?'p':'-')\n\t\t\t, (i->executable_attribute?'x':'-')\n\t\t\t, (i->hidden_attribute?'h':'-')\n\t\t\t, (i->symlink_attribute?'l':'-')\n\t\t\t, first, last\n\t\t\t, boost::uint32_t(t.files().mtime(*i))\n\t\t\t, t.files().hash(*i) != sha1_hash(0) ? to_hex(t.files().hash(*i).to_string()).c_str() : \"\"\n\t\t\t, t.files().file_path(*i).c_str()\n\t\t\t, i->symlink_attribute ? \"-> \": \"\"\n\t\t\t, i->symlink_attribute && i->symlink_index != -1 ? t.files().symlink(*i).c_str() : \"\");\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Default using display names to on for now until I can fix the code to turn them off<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"FOX_OSG_MDIView.h\"\n\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osgGA\/TrackballManipulator>\n\n#include <osgDB\/ReadFile>\n\n\n\/\/ Map\nFXDEFMAP(FOX_OSG_MDIView) FOX_OSG_MDIView_Map[] = {\n\t\/\/________Message_Type_________\t\t___ID___\t\t\t\t\t\t________Message_Handler________\n\tFXMAPFUNC(SEL_CHORE,\t\t\t\tFOX_OSG_MDIView::ID_CHORE,\t\tFOX_OSG_MDIView::OnIdle)\n};\n\nFXIMPLEMENT(FOX_OSG_MDIView, FXMDIChild, FOX_OSG_MDIView_Map, ARRAYNUMBER(FOX_OSG_MDIView_Map))\n\nFOX_OSG_MDIView::FOX_OSG_MDIView(FXMDIClient *p, const FXString &name,\n\t\tFXIcon *ic, FXPopup *pup, FXuint opt,\n\t\tFXint x, FXint y, FXint w, FXint h)\n\t\t: FXMDIChild(p, name, ic, pup, opt, x, y, w, h)\n{\n\t\/\/ A visual to drag OpenGL in double-buffered mode; note the glvisual is\n\t\/\/ shared between all windows which need the same depths and numbers of buffers\n\t\/\/ Thus, while the first visual may take some time to initialize, each subsequent\n\t\/\/ window can be created very quickly; we need to determine grpaphics hardware\n\t\/\/ characteristics only once.\n\tFXGLVisual* glVisual=new FXGLVisual(getApp(),VISUAL_DOUBLEBUFFER|VISUAL_STEREO);\n\n\tm_gwFox = new GraphicsWindowFOX(this, glVisual, NULL, NULL, LAYOUT_FILL_X|LAYOUT_FILL_Y, x, y, w, h );\n\n\tosgViewer::Viewer *viewer = new osgViewer::Viewer;\n\tviewer->getCamera()->setGraphicsContext(m_gwFox);\n\tviewer->getCamera()->setViewport(0,0,w,h);\n\tviewer->setThreadingModel(osgViewer::Viewer::SingleThreaded);\n\n\t\/\/ load the scene.\n\tosg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFile(\"cow.osg\");\n\tif (!loadedModel)\n\t{\n\t\treturn ;\n\t}\n\n\t\/\/ add the stats handler\n viewer->addEventHandler(new osgViewer::StatsHandler);\n\n\tviewer->setSceneData(loadedModel.get());\n\n\tviewer->setCameraManipulator(new osgGA::TrackballManipulator);\n\n\tSetViewer(viewer);\n\n\tgetApp()->addChore(this,ID_CHORE);\n\n}\n\n\nFOX_OSG_MDIView::~FOX_OSG_MDIView()\n{\n}\n\nlong FOX_OSG_MDIView::OnIdle(FXObject *sender, FXSelector sel, void* ptr)\n{\n\tm_osgViewer->frame();\n\tgetApp()->addChore(this, ID_CHORE);\n\treturn 1;\n}\n\nvoid FOX_OSG_MDIView::SetViewer(osgViewer::Viewer* viewer)\n{\n\tm_osgViewer = viewer;\n}\n<commit_msg>Fixed warning<commit_after>#include \"FOX_OSG_MDIView.h\"\n\n#include <osgViewer\/ViewerEventHandlers>\n\n#include <osgGA\/TrackballManipulator>\n\n#include <osgDB\/ReadFile>\n\n\n\/\/ Map\nFXDEFMAP(FOX_OSG_MDIView) FOX_OSG_MDIView_Map[] = {\n\t\/\/________Message_Type_________\t\t___ID___\t\t\t\t\t\t________Message_Handler________\n\tFXMAPFUNC(SEL_CHORE,\t\t\t\tFOX_OSG_MDIView::ID_CHORE,\t\tFOX_OSG_MDIView::OnIdle)\n};\n\nFXIMPLEMENT(FOX_OSG_MDIView, FXMDIChild, FOX_OSG_MDIView_Map, ARRAYNUMBER(FOX_OSG_MDIView_Map))\n\nFOX_OSG_MDIView::FOX_OSG_MDIView(FXMDIClient *p, const FXString &name,\n\t\tFXIcon *ic, FXPopup *pup, FXuint opt,\n\t\tFXint x, FXint y, FXint w, FXint h)\n\t\t: FXMDIChild(p, name, ic, pup, opt, x, y, w, h)\n{\n\t\/\/ A visual to drag OpenGL in double-buffered mode; note the glvisual is\n\t\/\/ shared between all windows which need the same depths and numbers of buffers\n\t\/\/ Thus, while the first visual may take some time to initialize, each subsequent\n\t\/\/ window can be created very quickly; we need to determine grpaphics hardware\n\t\/\/ characteristics only once.\n\tFXGLVisual* glVisual=new FXGLVisual(getApp(),VISUAL_DOUBLEBUFFER|VISUAL_STEREO);\n\n\tm_gwFox = new GraphicsWindowFOX(this, glVisual, NULL, 0, LAYOUT_FILL_X|LAYOUT_FILL_Y, x, y, w, h );\n\n\tosgViewer::Viewer *viewer = new osgViewer::Viewer;\n\tviewer->getCamera()->setGraphicsContext(m_gwFox);\n\tviewer->getCamera()->setViewport(0,0,w,h);\n\tviewer->setThreadingModel(osgViewer::Viewer::SingleThreaded);\n\n\t\/\/ load the scene.\n\tosg::ref_ptr<osg::Node> loadedModel = osgDB::readNodeFile(\"cow.osg\");\n\tif (!loadedModel)\n\t{\n\t\treturn ;\n\t}\n\n\t\/\/ add the stats handler\n viewer->addEventHandler(new osgViewer::StatsHandler);\n\n\tviewer->setSceneData(loadedModel.get());\n\n\tviewer->setCameraManipulator(new osgGA::TrackballManipulator);\n\n\tSetViewer(viewer);\n\n\tgetApp()->addChore(this,ID_CHORE);\n\n}\n\n\nFOX_OSG_MDIView::~FOX_OSG_MDIView()\n{\n}\n\nlong FOX_OSG_MDIView::OnIdle(FXObject *sender, FXSelector sel, void* ptr)\n{\n\tm_osgViewer->frame();\n\tgetApp()->addChore(this, ID_CHORE);\n\treturn 1;\n}\n\nvoid FOX_OSG_MDIView::SetViewer(osgViewer::Viewer* viewer)\n{\n\tm_osgViewer = viewer;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Adjustments should be precomposed, not postcomposed!<commit_after><|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2013, Institute for Artificial Intelligence,\n * Universität Bremen.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Institute for Artificial Intelligence,\n * Universität Bremen, nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/** \\author Jan Winkler *\/\n\n\n#include <plugins\/ros\/PluginROS.h>\n\n\nnamespace beliefstate {\n namespace plugins {\n PLUGIN_CLASS::PLUGIN_CLASS() {\n m_nhHandle = NULL;\n m_aspnAsyncSpinner = NULL;\n m_bRoslogMessages = false;\n \n this->setPluginVersion(\"0.9\");\n }\n \n PLUGIN_CLASS::~PLUGIN_CLASS() {\n if(m_nhHandle) {\n\tdelete m_nhHandle;\n }\n \n if(m_aspnAsyncSpinner) {\n\tdelete m_aspnAsyncSpinner;\n }\n }\n \n Result PLUGIN_CLASS::init(int argc, char** argv) {\n Result resInit = defaultResult();\n \n CDesignator* cdConfig = this->getIndividualConfig();\n \n this->setSubscribedToEvent(\"add-image-from-file\", true);\n this->setSubscribedToEvent(\"add-image-from-topic\", true);\n this->setSubscribedToEvent(\"symbolic-create-designator\", true);\n this->setSubscribedToEvent(\"interactive-callback\", true);\n this->setSubscribedToEvent(\"status-message\", true);\n \n if(!ros::ok()) {\n\tstring strROSNodeName = cdConfig->stringValue(\"node-name\");\n\t\n\tif(strROSNodeName == \"\") {\n\t strROSNodeName = \"beliefstate_ros\";\n\t}\n\t\n\tthis->info(\"Starting ROS node '\" + strROSNodeName + \"'.\");\n\t\n\tros::init(argc, argv, strROSNodeName);\n\tm_nhHandle = new ros::NodeHandle(\"~\");\n\t\n\tif(ros::ok()) {\n\t m_srvBeginContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"begin_context\", &PLUGIN_CLASS::serviceCallbackBeginContext, this);\n\t m_srvEndContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"end_context\", &PLUGIN_CLASS::serviceCallbackEndContext, this);\n\t m_srvAlterContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"alter_context\", &PLUGIN_CLASS::serviceCallbackAlterContext, this);\n\t m_pubLoggedDesignators = m_nhHandle->advertise<designator_integration_msgs::Designator>(\"\/logged_designators\", 1);\n\t m_pubInteractiveCallback = m_nhHandle->advertise<designator_integration_msgs::Designator>(\"\/interactive_callback\", 1);\n\t \n\t if(cdConfig->floatValue(\"roslog-messages\") != 0) {\n\t string strTopic = cdConfig->stringValue(\"roslog-topic\");\n\t \n\t if(strTopic != \"\") {\n\t m_pubStatusMessages = m_nhHandle->advertise<rosgraph_msgs::Log>(strTopic, 1);\n\t m_bRoslogMessages = true;\n\t } else {\n\t this->warn(\"You requested the status messages to be roslog'ged, but didn't specify a roslog topic. Ignoring the whole thing.\");\n\t }\n\t }\n\t \n\t int nThreads = 4;\n\t if(cdConfig->childForKey(\"async-threads\")) {\n\t nThreads = cdConfig->floatValue(\"async-threads\");\n\t }\n\t \n\t stringstream sts;\n\t sts << nThreads;\n\t \n\t this->info(\"ROS node started. Starting to spin (\" + sts.str() + \" threads).\");\n\t m_aspnAsyncSpinner = new ros::AsyncSpinner(nThreads);\n\t m_aspnAsyncSpinner->start();\n\t} else {\n\t resInit.bSuccess = false;\n\t resInit.strErrorMessage = \"Failed to start ROS node.\";\n\t}\n } else {\n \tthis->warn(\"ROS node already started.\");\n }\n \n return resInit;\n }\n \n Result PLUGIN_CLASS::deinit() {\n ros::shutdown();\n \n return defaultResult();\n }\n \n Result PLUGIN_CLASS::cycle() {\n Result resCycle = defaultResult();\n this->deployCycleData(resCycle);\n \n return resCycle;\n }\n \n bool PLUGIN_CLASS::serviceCallbackBeginContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evBeginContext = defaultEvent(\"begin-context\");\n evBeginContext.nContextID = createContextID();\n evBeginContext.cdDesignator = new CDesignator(req.request.designator);\n \n stringstream sts;\n sts << evBeginContext.nContextID;\n \n this->info(\"When beginning context (ID = \" + sts.str() + \"), received \" + this->getDesignatorTypeString(evBeginContext.cdDesignator) + \" designator\");\n this->deployEvent(evBeginContext);\n \n CDesignator *desigResponse = new CDesignator();\n desigResponse->setType(ACTION);\n desigResponse->setValue(string(\"_id\"), evBeginContext.nContextID);\n \n res.response.designators.push_back(desigResponse->serializeToMessage());\n delete desigResponse;\n \n return true;\n }\n \n bool PLUGIN_CLASS::serviceCallbackEndContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evEndContext = defaultEvent(\"end-context\");\n evEndContext.cdDesignator = new CDesignator(req.request.designator);\n \n int nContextID = (int)evEndContext.cdDesignator->floatValue(\"_id\");\n stringstream sts;\n sts << nContextID;\n \n this->info(\"When ending context (ID = \" + sts.str() + \"), received \" + this->getDesignatorTypeString(evEndContext.cdDesignator) + \" designator\");\n this->deployEvent(evEndContext);\n \n freeContextID(nContextID);\n \n return true;\n }\n\n bool PLUGIN_CLASS::serviceCallbackAlterContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evAlterContext = defaultEvent();\n evAlterContext.cdDesignator = new CDesignator(req.request.designator);\n \n this->info(\"When altering context, received \" + this->getDesignatorTypeString(evAlterContext.cdDesignator) + \" designator\");\n \n string strCommand = evAlterContext.cdDesignator->stringValue(\"command\");\n transform(strCommand.begin(), strCommand.end(), strCommand.begin(), ::tolower);\n \n if(strCommand == \"add-image\") {\n\tevAlterContext.strEventName = \"add-image-from-topic\";\n\tevAlterContext.nOpenRequestID = this->openNewRequestID();\n } else if(strCommand == \"add-failure\") {\n\tevAlterContext.strEventName = \"add-failure\";\n } else if(strCommand == \"add-designator\") {\n\tevAlterContext.strEventName = \"add-designator\";\n } else if(strCommand == \"equate-designators\") {\n\tevAlterContext.strEventName = \"equate-designators\";\n } else if(strCommand == \"add-object\") {\n\tevAlterContext.strEventName = \"add-object\";\n } else if(strCommand == \"export-planlog\") {\n\tevAlterContext.strEventName = \"export-planlog\";\n } else if(strCommand == \"start-new-experiment\") {\n\tevAlterContext.strEventName = \"start-new-experiment\";\n } else if(strCommand == \"set-experiment-meta-data\") {\n\tevAlterContext.strEventName = \"set-experiment-meta-data\";\n } else if(strCommand == \"register-interactive-object\") {\n\tevAlterContext.strEventName = \"symbolic-add-object\";\n } else if(strCommand == \"unregister-interactive-object\") {\n\tevAlterContext.strEventName = \"symbolic-remove-object\";\n } else if(strCommand == \"set-interactive-object-menu\") {\n\tevAlterContext.strEventName = \"symbolic-set-interactive-object-menu\";\n } else if(strCommand == \"update-interactive-object-pose\") {\n\tevAlterContext.strEventName = \"symbolic-update-object-pose\";\n } else {\n\tthis->warn(\"Unknown command when altering context: '\" + strCommand + \"'\");\n }\n \n this->deployEvent(evAlterContext, true);\n \n return true;\n }\n \n void PLUGIN_CLASS::consumeEvent(Event evEvent) {\n if(evEvent.bRequest == false) {\n\tthis->closeRequestID(evEvent.nOpenRequestID);\n } else {\n\tif(evEvent.strEventName == \"symbolic-create-designator\") {\n\t if(evEvent.cdDesignator) {\n\t m_pubLoggedDesignators.publish(evEvent.cdDesignator->serializeToMessage());\n\t }\n\t} else if(evEvent.strEventName == \"interactive-callback\") {\n\t if(evEvent.cdDesignator) {\n\t m_pubInteractiveCallback.publish(evEvent.cdDesignator->serializeToMessage());\n\t }\n\t} else if(evEvent.strEventName == \"status-message\") {\n\t if(m_bRoslogMessages) {\n\t StatusMessage msgStatus = evEvent.msgStatusMessage;\n\t rosgraph_msgs::Log rgmLogMessage;\n\t \n\t if(msgStatus.bBold == true) {\n\t rgmLogMessage.level = rosgraph_msgs::Log::WARN;\n\t } else {\n\t rgmLogMessage.level = rosgraph_msgs::Log::INFO;\n\t }\n\t \n\t rgmLogMessage.name = msgStatus.strPrefix;\n\t rgmLogMessage.msg = msgStatus.strMessage;\n\t \n\t m_pubStatusMessages.publish(rgmLogMessage);\n\t }\n\t}\n }\n }\n \n Event PLUGIN_CLASS::consumeServiceEvent(ServiceEvent seServiceEvent) {\n Event evService = defaultEvent();\n \n this->info(\"Consume service event of type '\" + seServiceEvent.strServiceName + \"'!\");\n \n return evService;\n }\n \n string PLUGIN_CLASS::getDesignatorTypeString(CDesignator* desigDesignator) {\n string strDesigType = \"UNKNOWN\";\n switch(desigDesignator->type()) {\n case ACTION:\n\tstrDesigType = \"ACTION\";\n\tbreak;\n\t\n case OBJECT:\n\tstrDesigType = \"OBJECT\";\n\tbreak;\n\t\n case LOCATION:\n\tstrDesigType = \"LOCATION\";\n\tbreak;\n\t\n default:\n\tbreak;\n }\n \n return strDesigType;\n }\n }\n \n extern \"C\" plugins::PLUGIN_CLASS* createInstance() {\n return new plugins::PLUGIN_CLASS();\n }\n \n extern \"C\" void destroyInstance(plugins::PLUGIN_CLASS* icDestroy) {\n delete icDestroy;\n }\n}\n<commit_msg>Don't subscribe to status messages for now, as it disturbs normal status output<commit_after>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2013, Institute for Artificial Intelligence,\n * Universität Bremen.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Institute for Artificial Intelligence,\n * Universität Bremen, nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/** \\author Jan Winkler *\/\n\n\n#include <plugins\/ros\/PluginROS.h>\n\n\nnamespace beliefstate {\n namespace plugins {\n PLUGIN_CLASS::PLUGIN_CLASS() {\n m_nhHandle = NULL;\n m_aspnAsyncSpinner = NULL;\n m_bRoslogMessages = false;\n \n this->setPluginVersion(\"0.9\");\n }\n \n PLUGIN_CLASS::~PLUGIN_CLASS() {\n if(m_nhHandle) {\n\tdelete m_nhHandle;\n }\n \n if(m_aspnAsyncSpinner) {\n\tdelete m_aspnAsyncSpinner;\n }\n }\n \n Result PLUGIN_CLASS::init(int argc, char** argv) {\n Result resInit = defaultResult();\n \n CDesignator* cdConfig = this->getIndividualConfig();\n \n this->setSubscribedToEvent(\"add-image-from-file\", true);\n this->setSubscribedToEvent(\"add-image-from-topic\", true);\n this->setSubscribedToEvent(\"symbolic-create-designator\", true);\n this->setSubscribedToEvent(\"interactive-callback\", true);\n \n if(cdConfig->floatValue(\"roslog-messages\") != 0) {\n\tthis->setSubscribedToEvent(\"status-message\", false);\n }\n \n if(!ros::ok()) {\n\tstring strROSNodeName = cdConfig->stringValue(\"node-name\");\n\t\n\tif(strROSNodeName == \"\") {\n\t strROSNodeName = \"beliefstate_ros\";\n\t}\n\t\n\tthis->info(\"Starting ROS node '\" + strROSNodeName + \"'.\");\n\t\n\tros::init(argc, argv, strROSNodeName);\n\tm_nhHandle = new ros::NodeHandle(\"~\");\n\t\n\tif(ros::ok()) {\n\t m_srvBeginContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"begin_context\", &PLUGIN_CLASS::serviceCallbackBeginContext, this);\n\t m_srvEndContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"end_context\", &PLUGIN_CLASS::serviceCallbackEndContext, this);\n\t m_srvAlterContext = m_nhHandle->advertiseService<PLUGIN_CLASS>(\"alter_context\", &PLUGIN_CLASS::serviceCallbackAlterContext, this);\n\t m_pubLoggedDesignators = m_nhHandle->advertise<designator_integration_msgs::Designator>(\"\/logged_designators\", 1);\n\t m_pubInteractiveCallback = m_nhHandle->advertise<designator_integration_msgs::Designator>(\"\/interactive_callback\", 1);\n\t \n\t if(cdConfig->floatValue(\"roslog-messages\") != 0) {\n\t string strTopic = cdConfig->stringValue(\"roslog-topic\");\n\t \n\t if(strTopic != \"\") {\n\t m_pubStatusMessages = m_nhHandle->advertise<rosgraph_msgs::Log>(strTopic, 1);\n\t m_bRoslogMessages = true;\n\t } else {\n\t this->warn(\"You requested the status messages to be roslog'ged, but didn't specify a roslog topic. Ignoring the whole thing.\");\n\t }\n\t }\n\t \n\t int nThreads = 4;\n\t if(cdConfig->childForKey(\"async-threads\")) {\n\t nThreads = cdConfig->floatValue(\"async-threads\");\n\t }\n\t \n\t stringstream sts;\n\t sts << nThreads;\n\t \n\t this->info(\"ROS node started. Starting to spin (\" + sts.str() + \" threads).\");\n\t m_aspnAsyncSpinner = new ros::AsyncSpinner(nThreads);\n\t m_aspnAsyncSpinner->start();\n\t} else {\n\t resInit.bSuccess = false;\n\t resInit.strErrorMessage = \"Failed to start ROS node.\";\n\t}\n } else {\n \tthis->warn(\"ROS node already started.\");\n }\n \n return resInit;\n }\n \n Result PLUGIN_CLASS::deinit() {\n ros::shutdown();\n \n return defaultResult();\n }\n \n Result PLUGIN_CLASS::cycle() {\n Result resCycle = defaultResult();\n this->deployCycleData(resCycle);\n \n return resCycle;\n }\n \n bool PLUGIN_CLASS::serviceCallbackBeginContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evBeginContext = defaultEvent(\"begin-context\");\n evBeginContext.nContextID = createContextID();\n evBeginContext.cdDesignator = new CDesignator(req.request.designator);\n \n stringstream sts;\n sts << evBeginContext.nContextID;\n \n this->info(\"When beginning context (ID = \" + sts.str() + \"), received \" + this->getDesignatorTypeString(evBeginContext.cdDesignator) + \" designator\");\n this->deployEvent(evBeginContext);\n \n CDesignator *desigResponse = new CDesignator();\n desigResponse->setType(ACTION);\n desigResponse->setValue(string(\"_id\"), evBeginContext.nContextID);\n \n res.response.designators.push_back(desigResponse->serializeToMessage());\n delete desigResponse;\n \n return true;\n }\n \n bool PLUGIN_CLASS::serviceCallbackEndContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evEndContext = defaultEvent(\"end-context\");\n evEndContext.cdDesignator = new CDesignator(req.request.designator);\n \n int nContextID = (int)evEndContext.cdDesignator->floatValue(\"_id\");\n stringstream sts;\n sts << nContextID;\n \n this->info(\"When ending context (ID = \" + sts.str() + \"), received \" + this->getDesignatorTypeString(evEndContext.cdDesignator) + \" designator\");\n this->deployEvent(evEndContext);\n \n freeContextID(nContextID);\n \n return true;\n }\n\n bool PLUGIN_CLASS::serviceCallbackAlterContext(designator_integration_msgs::DesignatorCommunication::Request &req, designator_integration_msgs::DesignatorCommunication::Response &res) {\n Event evAlterContext = defaultEvent();\n evAlterContext.cdDesignator = new CDesignator(req.request.designator);\n \n this->info(\"When altering context, received \" + this->getDesignatorTypeString(evAlterContext.cdDesignator) + \" designator\");\n \n string strCommand = evAlterContext.cdDesignator->stringValue(\"command\");\n transform(strCommand.begin(), strCommand.end(), strCommand.begin(), ::tolower);\n \n if(strCommand == \"add-image\") {\n\tevAlterContext.strEventName = \"add-image-from-topic\";\n\tevAlterContext.nOpenRequestID = this->openNewRequestID();\n } else if(strCommand == \"add-failure\") {\n\tevAlterContext.strEventName = \"add-failure\";\n } else if(strCommand == \"add-designator\") {\n\tevAlterContext.strEventName = \"add-designator\";\n } else if(strCommand == \"equate-designators\") {\n\tevAlterContext.strEventName = \"equate-designators\";\n } else if(strCommand == \"add-object\") {\n\tevAlterContext.strEventName = \"add-object\";\n } else if(strCommand == \"export-planlog\") {\n\tevAlterContext.strEventName = \"export-planlog\";\n } else if(strCommand == \"start-new-experiment\") {\n\tevAlterContext.strEventName = \"start-new-experiment\";\n } else if(strCommand == \"set-experiment-meta-data\") {\n\tevAlterContext.strEventName = \"set-experiment-meta-data\";\n } else if(strCommand == \"register-interactive-object\") {\n\tevAlterContext.strEventName = \"symbolic-add-object\";\n } else if(strCommand == \"unregister-interactive-object\") {\n\tevAlterContext.strEventName = \"symbolic-remove-object\";\n } else if(strCommand == \"set-interactive-object-menu\") {\n\tevAlterContext.strEventName = \"symbolic-set-interactive-object-menu\";\n } else if(strCommand == \"update-interactive-object-pose\") {\n\tevAlterContext.strEventName = \"symbolic-update-object-pose\";\n } else {\n\tthis->warn(\"Unknown command when altering context: '\" + strCommand + \"'\");\n }\n \n this->deployEvent(evAlterContext, true);\n \n return true;\n }\n \n void PLUGIN_CLASS::consumeEvent(Event evEvent) {\n if(evEvent.bRequest == false) {\n\tthis->closeRequestID(evEvent.nOpenRequestID);\n } else {\n\tif(evEvent.strEventName == \"symbolic-create-designator\") {\n\t if(evEvent.cdDesignator) {\n\t m_pubLoggedDesignators.publish(evEvent.cdDesignator->serializeToMessage());\n\t }\n\t} else if(evEvent.strEventName == \"interactive-callback\") {\n\t if(evEvent.cdDesignator) {\n\t m_pubInteractiveCallback.publish(evEvent.cdDesignator->serializeToMessage());\n\t }\n\t} else if(evEvent.strEventName == \"status-message\") {\n\t if(m_bRoslogMessages) {\n\t StatusMessage msgStatus = evEvent.msgStatusMessage;\n\t rosgraph_msgs::Log rgmLogMessage;\n\t \n\t if(msgStatus.bBold == true) {\n\t rgmLogMessage.level = rosgraph_msgs::Log::WARN;\n\t } else {\n\t rgmLogMessage.level = rosgraph_msgs::Log::INFO;\n\t }\n\t \n\t rgmLogMessage.name = msgStatus.strPrefix;\n\t rgmLogMessage.msg = msgStatus.strMessage;\n\t \n\t m_pubStatusMessages.publish(rgmLogMessage);\n\t }\n\t}\n }\n }\n \n Event PLUGIN_CLASS::consumeServiceEvent(ServiceEvent seServiceEvent) {\n Event evService = defaultEvent();\n \n this->info(\"Consume service event of type '\" + seServiceEvent.strServiceName + \"'!\");\n \n return evService;\n }\n \n string PLUGIN_CLASS::getDesignatorTypeString(CDesignator* desigDesignator) {\n string strDesigType = \"UNKNOWN\";\n switch(desigDesignator->type()) {\n case ACTION:\n\tstrDesigType = \"ACTION\";\n\tbreak;\n\t\n case OBJECT:\n\tstrDesigType = \"OBJECT\";\n\tbreak;\n\t\n case LOCATION:\n\tstrDesigType = \"LOCATION\";\n\tbreak;\n\t\n default:\n\tbreak;\n }\n \n return strDesigType;\n }\n }\n \n extern \"C\" plugins::PLUGIN_CLASS* createInstance() {\n return new plugins::PLUGIN_CLASS();\n }\n \n extern \"C\" void destroyInstance(plugins::PLUGIN_CLASS* icDestroy) {\n delete icDestroy;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <nan.h>\n#include <v8.h>\n#include <poppler.h>\n#include <cairo.h>\n#include <cairo-svg.h>\n\nnamespace sspdf {\n\nusing v8::Local;\nusing v8::Value;\nusing v8::Function;\nusing v8::Exception;\nusing v8::Isolate;\nusing v8::Object;\nusing v8::Array;\nusing v8::Uint8Array;\nusing Nan::Callback;\nusing Nan::GetFunction;\nusing Nan::Set;\nusing Nan::Null;\nusing Nan::New;\nusing Nan::AsyncWorker;\nusing Nan::HandleScope;\nusing Nan::ThrowTypeError;\nusing Nan::Persistent;\nusing Nan::ObjectWrap;\n\nconst char* MSG_EXCEPTION_ZEROLEN = \"Zero length buffer provided.\";\n\nclass PdfssWorker : public AsyncWorker {\n public:\n char* pdfData = NULL;\n Persistent<Uint8Array>* pdfBuffer = NULL;\n size_t pdfLen = 0;\n double pw, ph;\n char* txt;\n PopplerRectangle* rects;\n guint rectLen;\n char* error = NULL;\n int destPage;\n PdfssWorker(Callback* cb, Persistent<Uint8Array>* pdfBuffer, int destPage)\n : AsyncWorker(cb) {\n this->destPage = destPage;\n this->pdfBuffer = pdfBuffer;\n Local<Uint8Array> hPdf = New<Uint8Array>(*pdfBuffer);\n this->pdfLen = (*hPdf)->ByteLength();\n if (this->pdfLen == 0) {\n this->error = new char[strlen(MSG_EXCEPTION_ZEROLEN)];\n strcpy(this->error, MSG_EXCEPTION_ZEROLEN);\n } else {\n this->pdfData = (((char*)(*(*hPdf)->Buffer())->GetContents().Data())) + (*hPdf)->ByteOffset();\n }\n }\n\n void Execute () {\n if (this->error != NULL) {\n return;\n }\n GError* gerror = NULL;\n PopplerDocument* pd = poppler_document_new_from_data(this->pdfData, this->pdfLen, NULL, &gerror);\n if (pd == NULL) {\n this->error = new char[strlen(gerror->message)];\n strcpy(this->error, gerror->message);\n g_error_free(gerror);\n gerror = NULL;\n return;\n }\n PopplerPage* pg = poppler_document_get_page(pd, this->destPage);\n poppler_page_get_size(pg, &this->pw, &this->ph);\n this->txt = poppler_page_get_text(pg);\n poppler_page_get_text_layout(pg, &this->rects, &this->rectLen);\n }\n\n void HandleOKCallback () {\n HandleScope scope;\n Local<Object> obj;\n Local<Array> rects;\n Local<Value> argv[] = {\n Null(), Null()\n };\n if (this->error == NULL) {\n obj = New<Object>();\n Set(obj, New<v8::String>(\"pw\").ToLocalChecked(), New<v8::Number>(this->pw));\n Set(obj, New<v8::String>(\"ph\").ToLocalChecked(), New<v8::Number>(this->ph));\n Set(obj, New<v8::String>(\"txt\").ToLocalChecked(), New<v8::String>(this->txt).ToLocalChecked());\n rects = New<v8::Array>(this->rectLen);\n for (guint i = 0; i < this->rectLen; i ++) {\n Local<Object> xy = New<Object>();\n Set(xy, New<v8::String>(\"x1\").ToLocalChecked(), New<v8::Number>(this->rects[i].x1));\n Set(xy, New<v8::String>(\"y1\").ToLocalChecked(), New<v8::Number>(this->rects[i].y1));\n Set(xy, New<v8::String>(\"x2\").ToLocalChecked(), New<v8::Number>(this->rects[i].x2));\n Set(xy, New<v8::String>(\"y2\").ToLocalChecked(), New<v8::Number>(this->rects[i].y2));\n Set(rects, New<v8::Number>(i), xy);\n }\n Set(obj, New<v8::String>(\"rects\").ToLocalChecked(), rects);\n g_free(this->rects);\n argv[1] = obj;\n } else {\n argv[0] = v8::Exception::Error(New<v8::String>(this->error).ToLocalChecked());\n delete this->error;\n this->error = NULL;\n }\n this->callback->Call(2, argv);\n if (this->pdfBuffer != NULL) {\n this->pdfBuffer->Reset();\n delete this->pdfBuffer;\n this->pdfBuffer = NULL;\n }\n }\n};\n\nNAN_METHOD(getPage) {\n if (info.Length() != 3) {\n ThrowTypeError(\"getPage(pdfBuffer, pageNum, callback)\");\n return;\n }\n if (!info[0]->IsUint8Array()) {\n ThrowTypeError(\"arg[0] is not a buffer.\");\n return;\n }\n if (!info[1]->IsInt32()) {\n ThrowTypeError(\"arg[1] is not a int32.\");\n return;\n }\n if (!info[2]->IsFunction()) {\n ThrowTypeError(\"arg[2] is not a function.\");\n return;\n }\n int pn = (int)(*info[1].As<v8::Number>())->Value();\n if (pn < 0) {\n ThrowTypeError(\"arg[1] shouldn't be < 0.\");\n return;\n }\n Callback *callback = new Callback(info[2].As<Function>());\n AsyncQueueWorker(new PdfssWorker(callback, new Persistent<Uint8Array>(info[0].As<Uint8Array>()), pn));\n}\n\nNAN_MODULE_INIT(Init) {\n Set(target\n , New<v8::String>(\"getPage\").ToLocalChecked()\n , New<v8::FunctionTemplate>(getPage)->GetFunction());\n}\n\nNODE_MODULE(sspdf, Init)\n\n}\n<commit_msg>sspdf.getPage return svg<commit_after>#include <nan.h>\n#include <v8.h>\n#include <poppler.h>\n#include <cairo.h>\n#include <cairo-svg.h>\n#include <vector>\n\nnamespace sspdf {\n\nusing v8::Local;\nusing v8::Value;\nusing v8::Function;\nusing v8::Exception;\nusing v8::Isolate;\nusing v8::Object;\nusing v8::Array;\nusing v8::Uint8Array;\nusing v8::ArrayBuffer;\nusing Nan::Callback;\nusing Nan::GetFunction;\nusing Nan::Set;\nusing Nan::Null;\nusing Nan::New;\nusing Nan::AsyncWorker;\nusing Nan::HandleScope;\nusing Nan::ThrowTypeError;\nusing Nan::Persistent;\nusing Nan::ObjectWrap;\nusing std::vector;\n\nconst char* MSG_EXCEPTION_ZEROLEN = \"Zero length buffer provided.\";\n\nclass PdfssWorker : public AsyncWorker {\n public:\n char* pdfData = NULL;\n size_t pdfLen = 0;\n double pw, ph;\n char* txt;\n PopplerRectangle* rects;\n guint rectLen;\n char* error = NULL;\n int destPage;\n vector<char> svgData;\n PdfssWorker(Callback* cb, Local<Uint8Array> hPdf, int destPage)\n : AsyncWorker(cb) {\n this->destPage = destPage;\n this->pdfLen = (*hPdf)->ByteLength();\n if (this->pdfLen == 0) {\n this->error = new char[strlen(MSG_EXCEPTION_ZEROLEN)];\n strcpy(this->error, MSG_EXCEPTION_ZEROLEN);\n } else {\n char* pdfData = (((char*)(*(*hPdf)->Buffer())->GetContents().Data())) + (*hPdf)->ByteOffset();\n this->pdfData = new char[this->pdfLen];\n memcpy(this->pdfData, pdfData, this->pdfLen);\n }\n }\n\n void Execute () {\n if (this->error != NULL) {\n return;\n }\n GError* gerror = NULL;\n PopplerDocument* pd = poppler_document_new_from_data(this->pdfData, this->pdfLen, NULL, &gerror);\n if (pd == NULL) {\n this->error = new char[strlen(gerror->message)];\n strcpy(this->error, gerror->message);\n g_error_free(gerror);\n gerror = NULL;\n return;\n }\n PopplerPage* pg = poppler_document_get_page(pd, this->destPage);\n poppler_page_get_size(pg, &this->pw, &this->ph);\n this->txt = poppler_page_get_text(pg);\n poppler_page_get_text_layout(pg, &this->rects, &this->rectLen);\n\n cairo_surface_t* svgSurface = cairo_svg_surface_create_for_stream((cairo_write_func_t) PdfssWorker::writeFunc, this, this->pw, this->ph);\n cairo_t* svg = cairo_create(svgSurface);\n poppler_page_render(pg, svg);\n cairo_surface_destroy(svgSurface);\n cairo_destroy(svg);\n\n \/\/ g_free(pg); ( led to crash )\n \/\/ g_free(pd);\n }\n\n void HandleOKCallback () {\n HandleScope scope;\n Local<Object> obj;\n Local<Array> rects;\n Local<Value> argv[] = {\n Null(), Null()\n };\n if (this->error == NULL) {\n obj = New<Object>();\n Set(obj, New<v8::String>(\"pw\").ToLocalChecked(), New<v8::Number>(this->pw));\n Set(obj, New<v8::String>(\"ph\").ToLocalChecked(), New<v8::Number>(this->ph));\n Set(obj, New<v8::String>(\"txt\").ToLocalChecked(), New<v8::String>(this->txt).ToLocalChecked());\n rects = New<v8::Array>(this->rectLen);\n for (guint i = 0; i < this->rectLen; i ++) {\n Local<Object> xy = New<Object>();\n Set(xy, New<v8::String>(\"x1\").ToLocalChecked(), New<v8::Number>(this->rects[i].x1));\n Set(xy, New<v8::String>(\"y1\").ToLocalChecked(), New<v8::Number>(this->rects[i].y1));\n Set(xy, New<v8::String>(\"x2\").ToLocalChecked(), New<v8::Number>(this->rects[i].x2));\n Set(xy, New<v8::String>(\"y2\").ToLocalChecked(), New<v8::Number>(this->rects[i].y2));\n Set(rects, New<v8::Number>(i), xy);\n }\n Set(obj, New<v8::String>(\"rects\").ToLocalChecked(), rects);\n g_free(this->rects);\n argv[1] = obj;\n\n Local<ArrayBuffer> svgABuffer = ArrayBuffer::New(Isolate::GetCurrent(), this->svgData.size());\n char* svgBuffer = (char*)((*svgABuffer)->GetContents().Data());\n memcpy(svgBuffer, &(*this->svgData.begin()), this->svgData.size());\n\n if (this->svgData.size() > 0) {\n auto ml = node::Buffer::Copy(Isolate::GetCurrent(), &(*this->svgData.begin()), this->svgData.size());\n if (ml.IsEmpty()) {\n argv[0] = v8::Exception::Error(New<v8::String>(\"Can't return svg data.\").ToLocalChecked());\n } else {\n Set(obj, New<v8::String>(\"svg\").ToLocalChecked(), ml.ToLocalChecked());\n }\n } else {\n Set(obj, New<v8::String>(\"svg\").ToLocalChecked(), Null());\n }\n } else {\n argv[0] = v8::Exception::Error(New<v8::String>(this->error).ToLocalChecked());\n delete this->error;\n this->error = NULL;\n }\n this->callback->Call(2, argv);\n if (this->pdfData != NULL) {\n delete this->pdfData;\n this->pdfData = NULL;\n }\n }\n static cairo_status_t writeFunc (void* closure, const unsigned char* data, unsigned int length) {\n PdfssWorker* worker = (PdfssWorker*) closure;\n worker->svgData.reserve(worker->svgData.size() + length);\n for (unsigned int i = 0; i < length; i ++) {\n worker->svgData.push_back(data[i]);\n }\n return CAIRO_STATUS_SUCCESS;\n }\n};\n\nNAN_METHOD(getPage) {\n if (info.Length() != 3) {\n ThrowTypeError(\"getPage(pdfBuffer, pageNum, callback)\");\n return;\n }\n if (!info[0]->IsUint8Array()) {\n ThrowTypeError(\"arg[0] is not a buffer.\");\n return;\n }\n if (!info[1]->IsInt32()) {\n ThrowTypeError(\"arg[1] is not a int32.\");\n return;\n }\n if (!info[2]->IsFunction()) {\n ThrowTypeError(\"arg[2] is not a function.\");\n return;\n }\n int pn = (int)(*info[1].As<v8::Number>())->Value();\n if (pn < 0) {\n ThrowTypeError(\"arg[1] shouldn't be < 0.\");\n return;\n }\n auto pdfBuffer = info[0].As<Uint8Array>();\n if (pdfBuffer.IsEmpty()) {\n ThrowTypeError(\"arg[0] can't resolve.\");\n return;\n }\n Callback *callback = new Callback(info[2].As<Function>());\n AsyncQueueWorker(new PdfssWorker(callback, pdfBuffer, pn));\n}\n\nNAN_MODULE_INIT(Init) {\n Set(target\n , New<v8::String>(\"getPage\").ToLocalChecked()\n , New<v8::FunctionTemplate>(getPage)->GetFunction());\n}\n\nNODE_MODULE(sspdf, Init)\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2017 Social Robotics Lab, Yale University\n * Author: Alessandro Roncone\n * email: alessandro.roncone@yale.edu\n * website: www.scazlab.yale.edu\n * Permission is granted to copy, distribute, and\/or modify this program\n * under the terms of the GNU Lesser General Public License, version 2.1 or any\n * later version published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\n * Public License for more details\n**\/\n\n#include \"robot_utils\/particle_thread.h\"\n\n\/*****************************************************************************\/\n\/* ParticleThread *\/\n\/*****************************************************************************\/\n\nParticleThread::ParticleThread(std::string _name, double _thread_rate,\n bool _rviz_visual) : name(_name), r(_thread_rate),\n is_running(false), is_closing(false),\n rviz_visual(_rviz_visual), start_time(ros::Time::now()),\n is_particle_set(false), rviz_pub(_name)\n{\n\n}\n\nvoid ParticleThread::internalThread()\n{\n start_time = ros::Time::now();\n\n while(ros::ok() && not is_closing.get())\n {\n \/\/ ROS_INFO(\"Running..\");\n Eigen::VectorXd new_pt;\n\n updateParticle(new_pt);\n setCurrPoint(new_pt);\n\n \/\/ ROS_INFO_STREAM(\"New particle position: \" << getCurrPoint().transpose());\n\n r.sleep();\n }\n}\n\nbool ParticleThread::start()\n{\n if (is_particle_set.get() && not is_running.get())\n {\n is_closing.set(false);\n thread = std::thread(&ParticleThread::internalThread, this);\n is_running.set(true);\n\n if (rviz_visual) { rviz_pub.start(); };\n\n return true;\n }\n else\n {\n return false;\n }\n}\n\nbool ParticleThread::stop()\n{\n is_closing.set(true);\n is_running.set(false);\n is_particle_set.set(false);\n\n if (rviz_visual) { rviz_pub.stop(); };\n\n if (thread.joinable())\n {\n thread.join();\n }\n\n is_closing.set(false);\n\n return true;\n}\n\ndouble ParticleThread::getRate()\n{\n return 1\/r.expectedCycleTime().toSec();\n}\n\nvoid ParticleThread::setMarker()\n{\n Eigen::Vector3d _curr_pt = getCurrPoint();\n\n geometry_msgs::Pose mrk_pos;\n mrk_pos.position.x = _curr_pt[0];\n mrk_pos.position.y = _curr_pt[1];\n mrk_pos.position.z = _curr_pt[2];\n\n RVIZMarker curr_mrk(mrk_pos, ColorRGBA(0.0, 1.0, 1.0), 0.03);\n\n rviz_pub.setMarkers(std::vector<RVIZMarker>{curr_mrk});\n}\n\nEigen::VectorXd ParticleThread::getCurrPoint()\n{\n return curr_pt.get();\n}\n\nbool ParticleThread::setCurrPoint(const Eigen::VectorXd& _curr_pt)\n{\n if (rviz_visual) { setMarker(); };\n\n return curr_pt.set(_curr_pt);\n}\n\nParticleThread::~ParticleThread()\n{\n stop();\n}\n\n\/*****************************************************************************\/\n\/* ParticleThreadImpl *\/\n\/*****************************************************************************\/\nParticleThreadImpl::ParticleThreadImpl(std::string _name, double _thread_rate,\n bool _rviz_visual) :\n ParticleThread(_name, _thread_rate, _rviz_visual)\n{\n is_particle_set.set(true);\n}\n\nbool ParticleThreadImpl::updateParticle(Eigen::VectorXd& _new_pt)\n{\n _new_pt = Eigen::Vector3d(1.0, 1.0, 1.0);\n\n return true;\n}\n\n\/*****************************************************************************\/\n\/* LinearPointParticle *\/\n\/*****************************************************************************\/\n\nLinearPointParticle::LinearPointParticle(std::string _name, double _thread_rate,\n bool _rviz_visual) :\n ParticleThread(_name, _thread_rate, _rviz_visual),\n speed(double(0.0)), start_pt(Eigen::Vector3d(0.0, 0.0, 0.0)),\n des_pt(Eigen::Vector3d(0.0, 0.0, 0.0))\n{\n\n}\n\nbool LinearPointParticle::updateParticle(Eigen::VectorXd& _new_pt)\n{\n double elap_time = (ros::Time::now() - start_time).toSec();\n\n Eigen::Vector3d p_sd = des_pt.get() - start_pt.get();\n\n \/\/ We model the particle as a 3D point that moves toward the\n \/\/ target with a straight trajectory and constant speed.\n _new_pt = start_pt.get() + p_sd \/ p_sd.norm() * speed.get() * elap_time;\n\n Eigen::Vector3d p_cd = des_pt.get() - _new_pt;\n\n \/\/ Check if the current position is overshooting the desired position\n \/\/ By checking the sign of the cosine of the angle between p_sd and p_cd\n \/\/ This would mean equal to 1 within some small epsilon (1e-8)\n if ((p_sd.dot(p_cd))\/(p_sd.norm()*p_cd.norm()) - 1 < EPSILON &&\n (p_sd.dot(p_cd))\/(p_sd.norm()*p_cd.norm()) - 1 > -EPSILON)\n {\n return true;\n }\n\n _new_pt = des_pt.get();\n return false;\n}\n\nvoid LinearPointParticle::setMarker()\n{\n ParticleThread::setMarker();\n\n Eigen::Vector3d _des_pt = des_pt.get();\n\n geometry_msgs::Pose mrk_pos;\n mrk_pos.position.x = _des_pt[0];\n mrk_pos.position.y = _des_pt[1];\n mrk_pos.position.z = _des_pt[2];\n\n RVIZMarker des_mrk(mrk_pos, ColorRGBA(1.0, 1.0, 0.0));\n\n rviz_pub.push_back(des_mrk);\n}\n\nbool LinearPointParticle::setupParticle(const Eigen::Vector3d& _start_pt,\n const Eigen::Vector3d& _des_pt,\n double _speed)\n{\n start_pt.set(_start_pt);\n des_pt.set( _des_pt);\n speed.set( _speed);\n\n is_particle_set.set(true);\n\n return true;\n}\n\nLinearPointParticle::~LinearPointParticle()\n{\n\n}\n\n<commit_msg>[particle_thread] Costmetic changes<commit_after>\/**\n * Copyright (C) 2017 Social Robotics Lab, Yale University\n * Author: Alessandro Roncone\n * email: alessandro.roncone@yale.edu\n * website: www.scazlab.yale.edu\n * Permission is granted to copy, distribute, and\/or modify this program\n * under the terms of the GNU Lesser General Public License, version 2.1 or any\n * later version published by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\n * Public License for more details\n**\/\n\n#include \"robot_utils\/particle_thread.h\"\n\n\/*****************************************************************************\/\n\/* ParticleThread *\/\n\/*****************************************************************************\/\nParticleThread::ParticleThread(std::string _name, double _thread_rate, bool _rviz_visual) :\n name(_name), r(_thread_rate), is_running(false), is_closing(false),\n rviz_visual(_rviz_visual), start_time(ros::Time::now()),\n is_particle_set(false), rviz_pub(_name)\n{\n\n}\n\nvoid ParticleThread::internalThread()\n{\n start_time = ros::Time::now();\n\n while(ros::ok() && not is_closing.get())\n {\n \/\/ ROS_INFO(\"Running..\");\n Eigen::VectorXd new_pt;\n\n updateParticle(new_pt);\n setCurrPoint(new_pt);\n\n \/\/ ROS_INFO_STREAM(\"New particle position: \" << getCurrPoint().transpose());\n\n r.sleep();\n }\n}\n\nbool ParticleThread::start()\n{\n if (is_particle_set.get() && not is_running.get())\n {\n is_closing.set(false);\n thread = std::thread(&ParticleThread::internalThread, this);\n is_running.set(true);\n\n if (rviz_visual) { rviz_pub.start(); };\n\n return true;\n }\n else\n {\n return false;\n }\n}\n\nbool ParticleThread::stop()\n{\n is_closing.set(true);\n is_running.set(false);\n is_particle_set.set(false);\n\n if (rviz_visual) { rviz_pub.stop(); };\n\n if (thread.joinable())\n {\n thread.join();\n }\n\n is_closing.set(false);\n\n return true;\n}\n\ndouble ParticleThread::getRate()\n{\n return 1\/r.expectedCycleTime().toSec();\n}\n\nvoid ParticleThread::setMarker()\n{\n Eigen::Vector3d _curr_pt = getCurrPoint();\n\n geometry_msgs::Pose mrk_pos;\n mrk_pos.position.x = _curr_pt[0];\n mrk_pos.position.y = _curr_pt[1];\n mrk_pos.position.z = _curr_pt[2];\n\n RVIZMarker curr_mrk(mrk_pos, ColorRGBA(0.0, 1.0, 1.0), 0.03);\n\n rviz_pub.setMarkers(std::vector<RVIZMarker>{curr_mrk});\n}\n\nEigen::VectorXd ParticleThread::getCurrPoint()\n{\n return curr_pt.get();\n}\n\nbool ParticleThread::setCurrPoint(const Eigen::VectorXd& _curr_pt)\n{\n if (rviz_visual) { setMarker(); };\n\n return curr_pt.set(_curr_pt);\n}\n\nParticleThread::~ParticleThread()\n{\n stop();\n}\n\n\/*****************************************************************************\/\n\/* ParticleThreadImpl *\/\n\/*****************************************************************************\/\nParticleThreadImpl::ParticleThreadImpl(std::string _name, double _thread_rate, bool _rviz_visual) :\n ParticleThread(_name, _thread_rate, _rviz_visual)\n{\n is_particle_set.set(true);\n}\n\nbool ParticleThreadImpl::updateParticle(Eigen::VectorXd& _new_pt)\n{\n _new_pt = Eigen::Vector3d(1.0, 1.0, 1.0);\n\n return true;\n}\n\n\/*****************************************************************************\/\n\/* LinearPointParticle *\/\n\/*****************************************************************************\/\nLinearPointParticle::LinearPointParticle(std::string _name, double _thread_rate, bool _rviz_visual) :\n ParticleThread(_name, _thread_rate, _rviz_visual),\n speed(double(0.0)), start_pt(Eigen::Vector3d(0.0, 0.0, 0.0)),\n des_pt(Eigen::Vector3d(0.0, 0.0, 0.0))\n{\n\n}\n\nbool LinearPointParticle::updateParticle(Eigen::VectorXd& _new_pt)\n{\n double elap_time = (ros::Time::now() - start_time).toSec();\n\n Eigen::Vector3d p_sd = des_pt.get() - start_pt.get();\n\n \/\/ We model the particle as a 3D point that moves toward the\n \/\/ target with a straight trajectory and constant speed.\n _new_pt = start_pt.get() + p_sd \/ p_sd.norm() * speed.get() * elap_time;\n\n Eigen::Vector3d p_cd = des_pt.get() - _new_pt;\n\n \/\/ Check if the current position is overshooting the desired position\n \/\/ By checking the sign of the cosine of the angle between p_sd and p_cd\n \/\/ This would mean equal to 1 within some small epsilon (1e-8)\n if ((p_sd.dot(p_cd))\/(p_sd.norm()*p_cd.norm()) - 1 < EPSILON &&\n (p_sd.dot(p_cd))\/(p_sd.norm()*p_cd.norm()) - 1 > -EPSILON)\n {\n return true;\n }\n\n _new_pt = des_pt.get();\n return false;\n}\n\nvoid LinearPointParticle::setMarker()\n{\n ParticleThread::setMarker();\n\n Eigen::Vector3d _des_pt = des_pt.get();\n\n geometry_msgs::Pose mrk_pos;\n mrk_pos.position.x = _des_pt[0];\n mrk_pos.position.y = _des_pt[1];\n mrk_pos.position.z = _des_pt[2];\n\n RVIZMarker des_mrk(mrk_pos, ColorRGBA(1.0, 1.0, 0.0));\n\n rviz_pub.push_back(des_mrk);\n}\n\nbool LinearPointParticle::setupParticle(const Eigen::Vector3d& _start_pt,\n const Eigen::Vector3d& _des_pt,\n double _speed)\n{\n start_pt.set(_start_pt);\n des_pt.set( _des_pt);\n speed.set( _speed);\n\n is_particle_set.set(true);\n\n return true;\n}\n\nLinearPointParticle::~LinearPointParticle()\n{\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ poVideoPlayer.cpp\n\/\/ VideoPlayer\n\/\/\n\/\/ Created by Stephen Varga on 6\/17\/14.\n\/\/\n\/\/\n\n#include \"poVideoPlayer.h\"\n\n\nnamespace po {\n VideoPlayerRef VideoPlayer::create() {\n VideoPlayerRef ref = VideoPlayerRef(new VideoPlayer());\n ref->setup();\n return ref;\n }\n \n VideoPlayer::VideoPlayer()\n {\n }\n \n void VideoPlayer::update()\n {\n if(mVideo && mVideo->checkNewFrame()) mVideoTex = mVideo->getTexture();\n }\n \n ci::Rectf VideoPlayer::getBounds()\n {\n if(mVideo) return mVideo->getBounds();\n return ci::Rectf(0,0,0,0);\n }\n \n void VideoPlayer::draw()\n {\n if(mVideoTex) {\n ci::gl::color(ci::ColorA(getFillColor(), getAppliedAlpha()));\n ci::gl::draw(mVideoTex);\n }\n }\n \n void VideoPlayer::load(const ci::fs::path &moviePath)\n {\n try {\n mVideo = ci::qtime::MovieGl::create(moviePath);\n }\n catch( ... ) {\n ci::app::console() << \"Unable to load the movie from location \" << moviePath << std::endl;\n mVideo->reset();\n mVideoTex.reset();\n }\n }\n \n void VideoPlayer::load(const ci::DataSourceRef data)\n {\n try {\n mVideo = ci::qtime::MovieGl::create(data);\n }\n catch( ... ) {\n ci::app::console() << \"Unable to load the movie from location \" << data << std::endl;\n mVideo.reset();\n mVideoTex.reset();\n }\n }\n \n void VideoPlayer::unload() {\n mVideo.reset();\n mVideoTex.reset();\n }\n}<commit_msg>Changed pointer to dot syntax when resetting var<commit_after>\/\/\n\/\/ poVideoPlayer.cpp\n\/\/ VideoPlayer\n\/\/\n\/\/ Created by Stephen Varga on 6\/17\/14.\n\/\/\n\/\/\n\n#include \"poVideoPlayer.h\"\n\n\nnamespace po {\n VideoPlayerRef VideoPlayer::create() {\n VideoPlayerRef ref = VideoPlayerRef(new VideoPlayer());\n ref->setup();\n return ref;\n }\n \n VideoPlayer::VideoPlayer()\n {\n }\n \n void VideoPlayer::update()\n {\n if(mVideo && mVideo->checkNewFrame()) mVideoTex = mVideo->getTexture();\n }\n \n ci::Rectf VideoPlayer::getBounds()\n {\n if(mVideo) return mVideo->getBounds();\n return ci::Rectf(0,0,0,0);\n }\n \n void VideoPlayer::draw()\n {\n if(mVideoTex) {\n ci::gl::color(ci::ColorA(getFillColor(), getAppliedAlpha()));\n ci::gl::draw(mVideoTex);\n }\n }\n \n void VideoPlayer::load(const ci::fs::path &moviePath)\n {\n try {\n mVideo = ci::qtime::MovieGl::create(moviePath);\n }\n catch( ... ) {\n ci::app::console() << \"Unable to load the movie from location \" << moviePath << std::endl;\n mVideo.reset();\n mVideoTex.reset();\n }\n }\n \n void VideoPlayer::load(const ci::DataSourceRef data)\n {\n try {\n mVideo = ci::qtime::MovieGl::create(data);\n }\n catch( ... ) {\n ci::app::console() << \"Unable to load the movie from location \" << data << std::endl;\n mVideo.reset();\n mVideoTex.reset();\n }\n }\n \n void VideoPlayer::unload() {\n mVideo.reset();\n mVideoTex.reset();\n }\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright 2018 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <cstdlib>\n\/\/ emscripten\n#include <emscripten\/bind.h>\n#include <emscripten\/val.h>\n\/\/ libvpx\n#include \"vpxenc.h\"\n#include \"vpx\/vp8cx.h\"\n\/\/ libwebm\n#include \"mkvmuxer.hpp\"\n\/\/ libyuv\n#include \"libyuv.h\"\n\/\/ Our MyMkvWriters\n#include \".\/mkvwriter\/mymkvwriter.hpp\"\n#include \".\/mkvwriter\/mymkvstreamwriter.hpp\"\n\nusing namespace emscripten;\nusing namespace mkvmuxer;\n\nint vpx_img_plane_width(const vpx_image_t *img, int plane);\nint vpx_img_plane_height(const vpx_image_t *img, int plane);\nvoid clear_image(vpx_image_t *img) ;\n\nclass WebmEncoder {\n public:\n WebmEncoder(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate, bool realtime, bool klive, val cb);\n ~WebmEncoder();\n bool addRGBAFrame(std::string rgba);\n bool finalize();\n std::string lastError();\n\n private:\n bool InitCodec(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate);\n bool InitMkvWriter(bool klive, val cb);\n bool InitImageBuffer();\n\n bool RGBAtoVPXImage(const uint8_t *data);\n bool EncodeFrame(vpx_image_t *img, int frame_cnt);\n\n vpx_codec_ctx_t ctx;\n unsigned int frame_cnt = 0;\n vpx_codec_enc_cfg_t cfg;\n vpx_codec_iface_t* iface = vpx_codec_vp8_cx();\n vpx_image_t *img;\n std::string last_error;\n IMkvWriter *mkv_writer;\n Segment *main_segment;\n bool realtime = false;\n};\n\nWebmEncoder::WebmEncoder(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate_kbps, bool realtime_, bool klive, val cb): realtime(realtime_) {\n\n if(!InitCodec(timebase_num, timebase_den, width, height, bitrate_kbps)) {\n throw last_error;\n }\n if(!InitMkvWriter(klive, cb)) {\n throw last_error;\n }\n if(!InitImageBuffer()) {\n throw last_error;\n }\n}\n\nWebmEncoder::~WebmEncoder() {\n vpx_img_free(img);\n delete main_segment;\n if(realtime) {\n delete (MyMkvStreamWriter*)mkv_writer;\n } else {\n delete (MyMkvWriter*)mkv_writer;\n }\n}\n\nbool WebmEncoder::addRGBAFrame(std::string rgba) {\n RGBAtoVPXImage((const uint8_t*) rgba.c_str());\n if(!EncodeFrame(img, frame_cnt++)) {\n return false;\n }\n if(realtime) {\n ((MyMkvStreamWriter*)mkv_writer)->Notify();\n }\n return true;\n}\n\nbool WebmEncoder::finalize() {\n if(!EncodeFrame(NULL, -1)) {\n last_error = \"Could not encode flush frame\";\n return false;\n }\n\n if(!main_segment->Finalize()) {\n last_error = \"Could not finalize mkv\";\n return false;\n }\n if(realtime) {\n ((MyMkvStreamWriter*)mkv_writer)->Notify();\n } else {\n ((MyMkvWriter*)mkv_writer)->Notify();\n }\n return true;\n}\n\nstd::string WebmEncoder::lastError() {\n return std::string(last_error);\n}\n\nbool WebmEncoder::EncodeFrame(vpx_image_t *img, int frame_cnt) {\n vpx_codec_iter_t iter = NULL;\n const vpx_codec_cx_pkt_t *pkt;\n vpx_codec_err_t err;\n\n err = vpx_codec_encode(\n &ctx,\n img,\n frame_cnt, \/* time of frame *\/\n 1, \/* length of frame *\/\n 0, \/* flags. Use VPX_EFLAG_FORCE_KF to force a keyframe. *\/\n realtime ? VPX_DL_REALTIME : VPX_DL_BEST_QUALITY\n );\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n while((pkt = vpx_codec_get_cx_data(&ctx, &iter)) != NULL) {\n if(pkt->kind != VPX_CODEC_CX_FRAME_PKT) {\n continue;\n }\n auto frame_size = pkt->data.frame.sz;\n auto is_keyframe = (pkt->data.frame.flags & VPX_FRAME_IS_KEY) != 0;\n if(!main_segment->AddFrame(\n (uint8_t*) pkt->data.frame.buf,\n pkt->data.frame.sz,\n 1, \/* track id *\/\n pkt->data.frame.pts * 1000000000ULL * cfg.g_timebase.num\/cfg.g_timebase.den,\n is_keyframe\n )) {\n last_error = \"Could not add frame\";\n return false;\n }\n }\n return true;\n}\n\nbool WebmEncoder::InitCodec(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate) {\n vpx_codec_err_t err;\n err = vpx_codec_enc_config_default(iface, &cfg, 0);\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n\n cfg.g_timebase.num = timebase_num;\n cfg.g_timebase.den = timebase_den;\n cfg.g_w = width;\n cfg.g_h = height;\n cfg.rc_target_bitrate = bitrate;\n\n err = vpx_codec_enc_init(\n &ctx,\n iface,\n &cfg,\n 0 \/* flags *\/\n );\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n return true;\n}\n\nbool WebmEncoder::InitMkvWriter(bool klive, val cb) {\n if(realtime) {\n mkv_writer = new MyMkvStreamWriter(cb);\n } else {\n mkv_writer = new MyMkvWriter(cb);\n }\n main_segment = new Segment();\n if(!main_segment->Init(mkv_writer)) {\n last_error = \"Could not initialize main segment\";\n return false;\n }\n if(main_segment->AddVideoTrack(cfg.g_w, cfg.g_h, 1 \/* track id *\/) == 0) {\n last_error = \"Could not add video track\";\n return false;\n }\n main_segment->set_mode(klive ? Segment::Mode::kLive : Segment::Mode::kFile);\n auto info = main_segment->GetSegmentInfo();\n \/\/ Branding, yo\n auto muxing_app = std::string(info->muxing_app()) + \" but in wasm\";\n auto writing_app = std::string(info->writing_app()) + \" but in wasm\";\n info->set_writing_app(writing_app.c_str());\n info->set_muxing_app(muxing_app.c_str());\n return true;\n}\n\nbool WebmEncoder::InitImageBuffer() {\n img = vpx_img_alloc(\n NULL, \/* allocate buffer on the heap *\/\n VPX_IMG_FMT_I420,\n cfg.g_w,\n cfg.g_h,\n 0 \/* align. simple_encoder says 1? *\/\n );\n if(img == NULL) {\n last_error = \"Could not allocate vpx image buffer\";\n return false;\n }\n return true;\n}\n\nbool WebmEncoder::RGBAtoVPXImage(const uint8_t *rgba) {\n clear_image(img);\n \/\/ litten endian BGRA means it is ARGB in memory\n if(\n libyuv::BGRAToI420(\n \/\/ Since we are ignoring opacity anyways (currently), we can use\n \/\/ this nasty nasty trick to avoid reshuffling the entire memory\n \/\/ from RGBA to ARGB.\n rgba-1,\n cfg.g_w*4,\n img->planes[VPX_PLANE_Y],\n img->stride[VPX_PLANE_Y],\n img->planes[VPX_PLANE_U],\n img->stride[VPX_PLANE_U],\n img->planes[VPX_PLANE_V],\n img->stride[VPX_PLANE_V],\n cfg.g_w,\n cfg.g_h\n ) != 0) {\n last_error = \"Could not convert to I420\";\n return false;\n }\n return true;\n}\n\nint vpx_img_plane_width(const vpx_image_t *img, int plane) {\n if ((plane == 1 || plane == 2) && img->x_chroma_shift > 0 )\n return (img->d_w + 1) >> img->x_chroma_shift;\n else\n return img->d_w;\n}\n\nint vpx_img_plane_height(const vpx_image_t *img, int plane) {\n if ((plane == 1 || plane == 2) && img->y_chroma_shift > 0)\n return (img->d_h + 1) >> img->y_chroma_shift;\n else\n return img->d_h;\n}\n\nvoid clear_image(vpx_image_t *img) {\n for(int plane = 0; plane < 4; plane++) {\n auto *row = img->planes[plane];\n if(!row) {\n continue;\n }\n auto plane_width = vpx_img_plane_width(img, plane);\n auto plane_height = vpx_img_plane_height(img, plane);\n uint8_t value = plane == 3 ? 1 : 0;\n for(int y = 0; y < plane_height; y++) {\n memset(row, value, plane_width);\n row += img->stride[plane];\n }\n }\n}\n\nEMSCRIPTEN_BINDINGS(my_module) {\n class_<WebmEncoder>(\"WebmEncoder\")\n .constructor<int, int, unsigned int, unsigned int, unsigned int, bool, bool, val>()\n .function(\"addRGBAFrame\", &WebmEncoder::addRGBAFrame)\n .function(\"finalize\", &WebmEncoder::finalize)\n .function(\"lastError\", &WebmEncoder::lastError);\n}\n<commit_msg>Fix finalization of video<commit_after>\/**\n * Copyright 2018 Google Inc. All Rights Reserved.\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <cstdlib>\n\/\/ emscripten\n#include <emscripten\/bind.h>\n#include <emscripten\/val.h>\n\/\/ libvpx\n#include \"vpxenc.h\"\n#include \"vpx\/vp8cx.h\"\n\/\/ libwebm\n#include \"mkvmuxer.hpp\"\n\/\/ libyuv\n#include \"libyuv.h\"\n\/\/ Our MyMkvWriters\n#include \".\/mkvwriter\/mymkvwriter.hpp\"\n#include \".\/mkvwriter\/mymkvstreamwriter.hpp\"\n\nusing namespace emscripten;\nusing namespace mkvmuxer;\n\nint vpx_img_plane_width(const vpx_image_t *img, int plane);\nint vpx_img_plane_height(const vpx_image_t *img, int plane);\nvoid clear_image(vpx_image_t *img) ;\n\nclass WebmEncoder {\n public:\n WebmEncoder(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate, bool realtime, bool klive, val cb);\n ~WebmEncoder();\n bool addRGBAFrame(std::string rgba);\n bool finalize();\n std::string lastError();\n\n private:\n bool InitCodec(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate);\n bool InitMkvWriter(bool klive, val cb);\n bool InitImageBuffer();\n\n bool RGBAtoVPXImage(const uint8_t *data);\n bool EncodeFrame(vpx_image_t *img);\n\n vpx_codec_ctx_t ctx;\n unsigned int frame_cnt = 0;\n vpx_codec_enc_cfg_t cfg;\n vpx_codec_iface_t* iface = vpx_codec_vp8_cx();\n vpx_image_t *img;\n std::string last_error;\n IMkvWriter *mkv_writer;\n Segment *main_segment;\n bool realtime = false;\n};\n\nWebmEncoder::WebmEncoder(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate_kbps, bool realtime_, bool klive, val cb): realtime(realtime_) {\n\n if(!InitCodec(timebase_num, timebase_den, width, height, bitrate_kbps)) {\n throw last_error;\n }\n if(!InitMkvWriter(klive, cb)) {\n throw last_error;\n }\n if(!InitImageBuffer()) {\n throw last_error;\n }\n}\n\nWebmEncoder::~WebmEncoder() {\n vpx_img_free(img);\n delete main_segment;\n if(realtime) {\n delete (MyMkvStreamWriter*)mkv_writer;\n } else {\n delete (MyMkvWriter*)mkv_writer;\n }\n}\n\nbool WebmEncoder::addRGBAFrame(std::string rgba) {\n RGBAtoVPXImage((const uint8_t*) rgba.c_str());\n if(!EncodeFrame(img)) {\n return false;\n }\n if(realtime) {\n ((MyMkvStreamWriter*)mkv_writer)->Notify();\n }\n return true;\n}\n\nbool WebmEncoder::finalize() {\n if(!EncodeFrame(NULL)) {\n last_error = \"Could not encode flush frame\";\n return false;\n }\n\n if(!main_segment->Finalize()) {\n last_error = \"Could not finalize mkv\";\n return false;\n }\n if(realtime) {\n ((MyMkvStreamWriter*)mkv_writer)->Notify();\n } else {\n ((MyMkvWriter*)mkv_writer)->Notify();\n }\n return true;\n}\n\nstd::string WebmEncoder::lastError() {\n return std::string(last_error);\n}\n\nbool WebmEncoder::EncodeFrame(vpx_image_t *img) {\n vpx_codec_iter_t iter = NULL;\n const vpx_codec_cx_pkt_t *pkt;\n vpx_codec_err_t err;\n\n err = vpx_codec_encode(\n &ctx,\n img,\n frame_cnt, \/* time of frame *\/\n 1, \/* length of frame *\/\n 0, \/* flags. Use VPX_EFLAG_FORCE_KF to force a keyframe. *\/\n realtime ? VPX_DL_REALTIME : VPX_DL_BEST_QUALITY\n );\n frame_cnt++;\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n while((pkt = vpx_codec_get_cx_data(&ctx, &iter)) != NULL) {\n if(pkt->kind != VPX_CODEC_CX_FRAME_PKT) {\n continue;\n }\n auto frame_size = pkt->data.frame.sz;\n auto is_keyframe = (pkt->data.frame.flags & VPX_FRAME_IS_KEY) != 0;\n if(!main_segment->AddFrame(\n (uint8_t*) pkt->data.frame.buf,\n pkt->data.frame.sz,\n 1, \/* track id *\/\n pkt->data.frame.pts * 1000000000ULL * cfg.g_timebase.num\/cfg.g_timebase.den,\n is_keyframe\n )) {\n last_error = \"Could not add frame\";\n return false;\n }\n }\n return true;\n}\n\nbool WebmEncoder::InitCodec(int timebase_num, int timebase_den, unsigned int width, unsigned int height, unsigned int bitrate) {\n vpx_codec_err_t err;\n err = vpx_codec_enc_config_default(iface, &cfg, 0);\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n\n cfg.g_timebase.num = timebase_num;\n cfg.g_timebase.den = timebase_den;\n cfg.g_w = width;\n cfg.g_h = height;\n cfg.rc_target_bitrate = bitrate;\n\n err = vpx_codec_enc_init(\n &ctx,\n iface,\n &cfg,\n 0 \/* flags *\/\n );\n if(err != VPX_CODEC_OK) {\n last_error = std::string(vpx_codec_err_to_string(err));\n return false;\n }\n return true;\n}\n\nbool WebmEncoder::InitMkvWriter(bool klive, val cb) {\n if(realtime) {\n mkv_writer = new MyMkvStreamWriter(cb);\n } else {\n mkv_writer = new MyMkvWriter(cb);\n }\n main_segment = new Segment();\n if(!main_segment->Init(mkv_writer)) {\n last_error = \"Could not initialize main segment\";\n return false;\n }\n if(main_segment->AddVideoTrack(cfg.g_w, cfg.g_h, 1 \/* track id *\/) == 0) {\n last_error = \"Could not add video track\";\n return false;\n }\n main_segment->set_mode(klive ? Segment::Mode::kLive : Segment::Mode::kFile);\n auto info = main_segment->GetSegmentInfo();\n \/\/ Branding, yo\n auto muxing_app = std::string(info->muxing_app()) + \" but in wasm\";\n auto writing_app = std::string(info->writing_app()) + \" but in wasm\";\n info->set_writing_app(writing_app.c_str());\n info->set_muxing_app(muxing_app.c_str());\n return true;\n}\n\nbool WebmEncoder::InitImageBuffer() {\n img = vpx_img_alloc(\n NULL, \/* allocate buffer on the heap *\/\n VPX_IMG_FMT_I420,\n cfg.g_w,\n cfg.g_h,\n 0 \/* align. simple_encoder says 1? *\/\n );\n if(img == NULL) {\n last_error = \"Could not allocate vpx image buffer\";\n return false;\n }\n return true;\n}\n\nbool WebmEncoder::RGBAtoVPXImage(const uint8_t *rgba) {\n clear_image(img);\n \/\/ litten endian BGRA means it is ARGB in memory\n if(\n libyuv::BGRAToI420(\n \/\/ Since we are ignoring opacity anyways (currently), we can use\n \/\/ this nasty nasty trick to avoid reshuffling the entire memory\n \/\/ from RGBA to ARGB.\n rgba-1,\n cfg.g_w*4,\n img->planes[VPX_PLANE_Y],\n img->stride[VPX_PLANE_Y],\n img->planes[VPX_PLANE_U],\n img->stride[VPX_PLANE_U],\n img->planes[VPX_PLANE_V],\n img->stride[VPX_PLANE_V],\n cfg.g_w,\n cfg.g_h\n ) != 0) {\n last_error = \"Could not convert to I420\";\n return false;\n }\n return true;\n}\n\nint vpx_img_plane_width(const vpx_image_t *img, int plane) {\n if ((plane == 1 || plane == 2) && img->x_chroma_shift > 0 )\n return (img->d_w + 1) >> img->x_chroma_shift;\n else\n return img->d_w;\n}\n\nint vpx_img_plane_height(const vpx_image_t *img, int plane) {\n if ((plane == 1 || plane == 2) && img->y_chroma_shift > 0)\n return (img->d_h + 1) >> img->y_chroma_shift;\n else\n return img->d_h;\n}\n\nvoid clear_image(vpx_image_t *img) {\n for(int plane = 0; plane < 4; plane++) {\n auto *row = img->planes[plane];\n if(!row) {\n continue;\n }\n auto plane_width = vpx_img_plane_width(img, plane);\n auto plane_height = vpx_img_plane_height(img, plane);\n uint8_t value = plane == 3 ? 1 : 0;\n for(int y = 0; y < plane_height; y++) {\n memset(row, value, plane_width);\n row += img->stride[plane];\n }\n }\n}\n\nEMSCRIPTEN_BINDINGS(my_module) {\n class_<WebmEncoder>(\"WebmEncoder\")\n .constructor<int, int, unsigned int, unsigned int, unsigned int, bool, bool, val>()\n .function(\"addRGBAFrame\", &WebmEncoder::addRGBAFrame)\n .function(\"finalize\", &WebmEncoder::finalize)\n .function(\"lastError\", &WebmEncoder::lastError);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ The main caffe test code. Your test cpp code should include this hpp\n\/\/ to allow a main function to be compiled into the binary.\n\n#include \"caffe\/caffe.hpp\"\n#include \"caffe\/test\/test_caffe_main.hpp\"\n\nnamespace caffe {\n#ifndef CPU_ONLY\n cudaDeviceProp CAFFE_TEST_CUDA_PROP;\n#endif\n}\n\n#ifndef CPU_ONLY\nusing caffe::CAFFE_TEST_CUDA_PROP;\n#endif\n\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n caffe::GlobalInit(&argc, &argv);\n#ifndef CPU_ONLY\n \/\/ Before starting testing, let's first print out a few cuda defice info.\n int device;\n cudaGetDeviceCount(&device);\n cout << \"Cuda number of devices: \" << device << endl;\n if (argc > 1) {\n \/\/ Use the given device\n device = atoi(argv[1]);\n cudaSetDevice(device);\n cout << \"Setting to use device \" << device << endl;\n } else if (CUDA_TEST_DEVICE >= 0) {\n \/\/ Use the device assigned in build configuration; but with a lower priority\n device = CUDA_TEST_DEVICE;\n }\n cudaGetDevice(&device);\n cout << \"Current device id: \" << device << endl;\n cudaGetDeviceProperties(&CAFFE_TEST_CUDA_PROP, device);\n cout << \"Current device name: \" << CAFFE_TEST_CUDA_PROP.name << endl;\n#endif\n \/\/ invoke the test.\n return RUN_ALL_TESTS();\n}\n<commit_msg>Remove misleading comment from a test file<commit_after>#include \"caffe\/caffe.hpp\"\n#include \"caffe\/test\/test_caffe_main.hpp\"\n\nnamespace caffe {\n#ifndef CPU_ONLY\n cudaDeviceProp CAFFE_TEST_CUDA_PROP;\n#endif\n}\n\n#ifndef CPU_ONLY\nusing caffe::CAFFE_TEST_CUDA_PROP;\n#endif\n\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n caffe::GlobalInit(&argc, &argv);\n#ifndef CPU_ONLY\n \/\/ Before starting testing, let's first print out a few cuda defice info.\n int device;\n cudaGetDeviceCount(&device);\n cout << \"Cuda number of devices: \" << device << endl;\n if (argc > 1) {\n \/\/ Use the given device\n device = atoi(argv[1]);\n cudaSetDevice(device);\n cout << \"Setting to use device \" << device << endl;\n } else if (CUDA_TEST_DEVICE >= 0) {\n \/\/ Use the device assigned in build configuration; but with a lower priority\n device = CUDA_TEST_DEVICE;\n }\n cudaGetDevice(&device);\n cout << \"Current device id: \" << device << endl;\n cudaGetDeviceProperties(&CAFFE_TEST_CUDA_PROP, device);\n cout << \"Current device name: \" << CAFFE_TEST_CUDA_PROP.name << endl;\n#endif\n \/\/ invoke the test.\n return RUN_ALL_TESTS();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011 Esrille Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <GL\/freeglut.h>\n\n#include \"WindowImp.h\"\n#include \"Test.util.h\"\n\nusing namespace org::w3c::dom::bootstrap;\nusing namespace org::w3c::dom;\n\nextern html::Window window;\n\nvoid reshape(int w, int h)\n{\n glViewport(0, 0, w, h);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(0, w, h, 0, -1000.0, 1.0);\n\n glMatrixMode(GL_TEXTURE);\n glLoadIdentity();\n\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\nvoid display()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->render();\n glutSwapBuffers(); \/\/ This would block until the sync happens\n}\n\nunsigned getCharKeyCode(int key)\n{\n \/\/ US Qwerty\n static unsigned map[] = {\n 0, 0, 0, 0, 0, 0, 0, 0, 8, 9, 0, 0, 12, 13, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 8, 9, 0, 27, 0, 0, 0, 0,\n 32, 49 \/* ! *\/, 222 \/* \" *\/, 51 \/* # *\/, 52 \/* $ *\/, 53 \/* % *\/, 55 \/* & *\/, 222 \/* ' *\/,\n 57 \/* ( *\/, 48 \/* ) *\/, 56 \/* * *\/, 187 \/* + *\/, 188 \/* , *\/, 189 \/* - *\/, 190 \/* . *\/, 191 \/* \/ *\/,\n 48 \/* 0 *\/, 49 \/* 1 *\/, 50 \/* 2 *\/, 51 \/* 3 *\/, 52 \/* 4 *\/, 53 \/* 5 *\/, 54 \/* 6 *\/, 55 \/* 7 *\/,\n 56 \/* 8 *\/, 57 \/* 9 *\/, 186 \/* : *\/, 186 \/* ; *\/, 188 \/* < *\/, 187 \/* = *\/, 190 \/* > *\/, 191 \/* ? *\/,\n 50 \/* @ *\/, 65 \/* A *\/, 66 \/* B *\/, 67 \/* C *\/, 68 \/* D *\/, 69 \/* E *\/, 70 \/* F *\/, 71 \/* G *\/,\n 72 \/* H *\/, 73 \/* I *\/, 74 \/* J *\/, 75 \/* K *\/, 76 \/* L *\/, 77 \/* M *\/, 78 \/* N *\/, 79 \/* O *\/,\n 80 \/* P *\/, 81 \/* Q *\/, 82 \/* R *\/, 83 \/* S *\/, 84 \/* T *\/, 85 \/* U *\/, 86 \/* V *\/, 87 \/* W *\/,\n 88 \/* X *\/, 89 \/* Y *\/, 90 \/* Z *\/, 219 \/* [ *\/, 220 \/* \\ *\/, 221 \/* ] *\/, 54 \/* ^ *\/, 189 \/* _ *\/,\n 192 \/* ` *\/, 65 \/* a *\/, 66 \/* b *\/, 67 \/* c *\/, 68 \/* d *\/, 69 \/* e *\/, 70 \/* f *\/, 71 \/* g *\/,\n 72 \/* h *\/, 73 \/* i *\/, 74 \/* j *\/, 75 \/* k *\/, 76 \/* l *\/, 77 \/* m *\/, 78 \/* n *\/, 79 \/* o *\/,\n 80 \/* p *\/, 81 \/* q *\/, 82 \/* r *\/, 83 \/* s *\/, 84 \/* t *\/, 85 \/* u *\/, 86 \/* v *\/, 87 \/* w *\/,\n 88 \/* x *\/, 89 \/* y *\/, 90 \/* z *\/, 219 \/* { *\/, 220 \/* | *\/, 221 \/* } *\/, 192 \/* ~ *\/, 46 \/* DEL *\/\n };\n static_assert(sizeof map \/sizeof map[0] == 128, \"invalid map\");\n return (0 <= key && key <= 127) ? map[key] : 0;\n}\n\nvoid keyboard(unsigned char key, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keydown(key, getCharKeyCode(key), glutGetModifiers());\n}\n\nvoid keyboardUp(unsigned char key, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keyup(key, getCharKeyCode(key), glutGetModifiers());\n}\n\nunsigned getSpecialKeyCode(int key)\n{\n switch (key) {\n case GLUT_KEY_F1:\n return 112;\n case GLUT_KEY_F2:\n return 113;\n case GLUT_KEY_F3:\n return 114;\n case GLUT_KEY_F4:\n return 115;\n case GLUT_KEY_F5:\n return 116;\n case GLUT_KEY_F6:\n return 117;\n case GLUT_KEY_F7:\n return 118;\n case GLUT_KEY_F8:\n return 119;\n case GLUT_KEY_F9:\n return 120;\n case GLUT_KEY_F10:\n return 121;\n case GLUT_KEY_F11:\n return 122;\n case GLUT_KEY_F12:\n return 123;\n case GLUT_KEY_LEFT:\n return 37;\n case GLUT_KEY_UP:\n return 38;\n case GLUT_KEY_RIGHT:\n return 39;\n case GLUT_KEY_DOWN:\n return 40;\n case GLUT_KEY_PAGE_UP:\n return 33;\n case GLUT_KEY_PAGE_DOWN:\n return 34;\n case GLUT_KEY_HOME:\n return 36;\n case GLUT_KEY_END:\n return 35;\n case GLUT_KEY_INSERT:\n return 45;\n case 109: \/\/ Num Lock\n return 144;\n default:\n return 0;\n }\n}\n\nvoid special(int key, int x, int y)\n{\n unsigned keycode = getSpecialKeyCode(key);\n if (keycode) {\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keydown(0, keycode, glutGetModifiers());\n }\n}\n\nvoid specialUp(int key, int x, int y)\n{\n unsigned keycode = getSpecialKeyCode(key);\n if (keycode) {\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keyup(0, keycode, glutGetModifiers());\n }\n}\n\nvoid mouse(int button, int state, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->mouse(button, state, x, y, glutGetModifiers());\n}\n\nvoid mouseMove(int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->mouseMove(x, y, glutGetModifiers());\n}\n\nvoid timer(int value)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self())) {\n if (imp->poll())\n glutPostRedisplay();\n }\n glutTimerFunc(50, timer, 0);\n \/\/ TODO: do GC here or maybe in the idle proc\n }\n\nvoid init(int argc, char* argv[])\n{\n glutInit(&argc, argv);\n\n GLint buffers, samples;\n glGetIntegerv(GL_SAMPLE_BUFFERS, &buffers);\n glGetIntegerv(GL_SAMPLES, &samples);\n std::cout << \"GL_SAMPLE_BUFFERS = \" << buffers << \", GL_SAMPLES = \" << samples << '\\n';\n if (1 <= GL_SAMPLE_BUFFERS && 2 <= samples)\n glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE | GLUT_DEPTH | GLUT_MULTISAMPLE);\n else\n glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE | GLUT_DEPTH);\n glutInitWindowSize(816, 1056);\n glutCreateWindow(argv[0]);\n glutReshapeFunc(reshape);\n glutDisplayFunc(display);\n glClearColor(1.0, 1.0, 1.0, 1.0);\n glEnable(GL_TEXTURE_2D);\n glDepthFunc(GL_LEQUAL);\n glDisable(GL_CULL_FACE);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_ALPHA_TEST);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glutKeyboardFunc(keyboard);\n glutKeyboardUpFunc(keyboardUp);\n glutSpecialFunc(special);\n glutSpecialUpFunc(specialUp);\n glutMouseFunc(mouse);\n glutMotionFunc(mouseMove);\n glutPassiveMotionFunc(mouseMove);\n glutTimerFunc(50, timer, 0);\n glutSetOption(GLUT_ACTION_ON_WINDOW_CLOSE, GLUT_ACTION_CONTINUE_EXECUTION);\n if (1 <= GL_SAMPLE_BUFFERS && 2 <= samples) {\n glEnable(GL_MULTISAMPLE);\n glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n }\n}<commit_msg>(init) : Enable GLUT_MULTISAMPLE for now. We will revisit this issue later.<commit_after>\/*\n * Copyright 2011 Esrille Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <GL\/freeglut.h>\n\n#include \"WindowImp.h\"\n#include \"Test.util.h\"\n\nusing namespace org::w3c::dom::bootstrap;\nusing namespace org::w3c::dom;\n\nextern html::Window window;\n\nvoid reshape(int w, int h)\n{\n glViewport(0, 0, w, h);\n\n glMatrixMode(GL_PROJECTION);\n glLoadIdentity();\n glOrtho(0, w, h, 0, -1000.0, 1.0);\n\n glMatrixMode(GL_TEXTURE);\n glLoadIdentity();\n\n glMatrixMode(GL_MODELVIEW);\n glLoadIdentity();\n}\n\nvoid display()\n{\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->render();\n glutSwapBuffers(); \/\/ This would block until the sync happens\n}\n\nunsigned getCharKeyCode(int key)\n{\n \/\/ US Qwerty\n static unsigned map[] = {\n 0, 0, 0, 0, 0, 0, 0, 0, 8, 9, 0, 0, 12, 13, 0, 0,\n 0, 0, 0, 0, 0, 0, 0, 0, 8, 9, 0, 27, 0, 0, 0, 0,\n 32, 49 \/* ! *\/, 222 \/* \" *\/, 51 \/* # *\/, 52 \/* $ *\/, 53 \/* % *\/, 55 \/* & *\/, 222 \/* ' *\/,\n 57 \/* ( *\/, 48 \/* ) *\/, 56 \/* * *\/, 187 \/* + *\/, 188 \/* , *\/, 189 \/* - *\/, 190 \/* . *\/, 191 \/* \/ *\/,\n 48 \/* 0 *\/, 49 \/* 1 *\/, 50 \/* 2 *\/, 51 \/* 3 *\/, 52 \/* 4 *\/, 53 \/* 5 *\/, 54 \/* 6 *\/, 55 \/* 7 *\/,\n 56 \/* 8 *\/, 57 \/* 9 *\/, 186 \/* : *\/, 186 \/* ; *\/, 188 \/* < *\/, 187 \/* = *\/, 190 \/* > *\/, 191 \/* ? *\/,\n 50 \/* @ *\/, 65 \/* A *\/, 66 \/* B *\/, 67 \/* C *\/, 68 \/* D *\/, 69 \/* E *\/, 70 \/* F *\/, 71 \/* G *\/,\n 72 \/* H *\/, 73 \/* I *\/, 74 \/* J *\/, 75 \/* K *\/, 76 \/* L *\/, 77 \/* M *\/, 78 \/* N *\/, 79 \/* O *\/,\n 80 \/* P *\/, 81 \/* Q *\/, 82 \/* R *\/, 83 \/* S *\/, 84 \/* T *\/, 85 \/* U *\/, 86 \/* V *\/, 87 \/* W *\/,\n 88 \/* X *\/, 89 \/* Y *\/, 90 \/* Z *\/, 219 \/* [ *\/, 220 \/* \\ *\/, 221 \/* ] *\/, 54 \/* ^ *\/, 189 \/* _ *\/,\n 192 \/* ` *\/, 65 \/* a *\/, 66 \/* b *\/, 67 \/* c *\/, 68 \/* d *\/, 69 \/* e *\/, 70 \/* f *\/, 71 \/* g *\/,\n 72 \/* h *\/, 73 \/* i *\/, 74 \/* j *\/, 75 \/* k *\/, 76 \/* l *\/, 77 \/* m *\/, 78 \/* n *\/, 79 \/* o *\/,\n 80 \/* p *\/, 81 \/* q *\/, 82 \/* r *\/, 83 \/* s *\/, 84 \/* t *\/, 85 \/* u *\/, 86 \/* v *\/, 87 \/* w *\/,\n 88 \/* x *\/, 89 \/* y *\/, 90 \/* z *\/, 219 \/* { *\/, 220 \/* | *\/, 221 \/* } *\/, 192 \/* ~ *\/, 46 \/* DEL *\/\n };\n static_assert(sizeof map \/sizeof map[0] == 128, \"invalid map\");\n return (0 <= key && key <= 127) ? map[key] : 0;\n}\n\nvoid keyboard(unsigned char key, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keydown(key, getCharKeyCode(key), glutGetModifiers());\n}\n\nvoid keyboardUp(unsigned char key, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keyup(key, getCharKeyCode(key), glutGetModifiers());\n}\n\nunsigned getSpecialKeyCode(int key)\n{\n switch (key) {\n case GLUT_KEY_F1:\n return 112;\n case GLUT_KEY_F2:\n return 113;\n case GLUT_KEY_F3:\n return 114;\n case GLUT_KEY_F4:\n return 115;\n case GLUT_KEY_F5:\n return 116;\n case GLUT_KEY_F6:\n return 117;\n case GLUT_KEY_F7:\n return 118;\n case GLUT_KEY_F8:\n return 119;\n case GLUT_KEY_F9:\n return 120;\n case GLUT_KEY_F10:\n return 121;\n case GLUT_KEY_F11:\n return 122;\n case GLUT_KEY_F12:\n return 123;\n case GLUT_KEY_LEFT:\n return 37;\n case GLUT_KEY_UP:\n return 38;\n case GLUT_KEY_RIGHT:\n return 39;\n case GLUT_KEY_DOWN:\n return 40;\n case GLUT_KEY_PAGE_UP:\n return 33;\n case GLUT_KEY_PAGE_DOWN:\n return 34;\n case GLUT_KEY_HOME:\n return 36;\n case GLUT_KEY_END:\n return 35;\n case GLUT_KEY_INSERT:\n return 45;\n case 109: \/\/ Num Lock\n return 144;\n default:\n return 0;\n }\n}\n\nvoid special(int key, int x, int y)\n{\n unsigned keycode = getSpecialKeyCode(key);\n if (keycode) {\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keydown(0, keycode, glutGetModifiers());\n }\n}\n\nvoid specialUp(int key, int x, int y)\n{\n unsigned keycode = getSpecialKeyCode(key);\n if (keycode) {\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->keyup(0, keycode, glutGetModifiers());\n }\n}\n\nvoid mouse(int button, int state, int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->mouse(button, state, x, y, glutGetModifiers());\n}\n\nvoid mouseMove(int x, int y)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self()))\n imp->mouseMove(x, y, glutGetModifiers());\n}\n\nvoid timer(int value)\n{\n if (WindowImp* imp = static_cast<WindowImp*>(window.self())) {\n if (imp->poll())\n glutPostRedisplay();\n }\n glutTimerFunc(50, timer, 0);\n \/\/ TODO: do GC here or maybe in the idle proc\n }\n\nvoid init(int argc, char* argv[])\n{\n glutInit(&argc, argv);\n\n glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE | GLUT_DEPTH | GLUT_MULTISAMPLE);\n\n glutInitWindowSize(816, 1056);\n glutCreateWindow(argv[0]);\n glutReshapeFunc(reshape);\n glutDisplayFunc(display);\n glClearColor(1.0, 1.0, 1.0, 1.0);\n glEnable(GL_TEXTURE_2D);\n glDepthFunc(GL_LEQUAL);\n glDisable(GL_CULL_FACE);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_ALPHA_TEST);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n glutKeyboardFunc(keyboard);\n glutKeyboardUpFunc(keyboardUp);\n glutSpecialFunc(special);\n glutSpecialUpFunc(specialUp);\n glutMouseFunc(mouse);\n glutMotionFunc(mouseMove);\n glutPassiveMotionFunc(mouseMove);\n glutTimerFunc(50, timer, 0);\n glutSetOption(GLUT_ACTION_ON_WINDOW_CLOSE, GLUT_ACTION_CONTINUE_EXECUTION);\n\n glEnable(GL_MULTISAMPLE);\n glEnable(GL_SAMPLE_ALPHA_TO_COVERAGE);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"sprites.h\"\n#include \"Graphics.h\"\n#include \"Text.h\"\n#include <cstdio>\n#include <cstdarg>\n#include <string>\n\n#define TEXT WalrusRPG::Graphics::Text\n#define GRAPHICS WalrusRPG::Graphics\n\nvoid TEXT::print_char(char c, unsigned x, unsigned y)\n{\n GRAPHICS::Rect_t rect;\n rect.w = 8;\n rect.h = 8;\n rect.x = (c % 16) * 8;\n rect.y = (c \/ 16) * 8;\n draw_sprite_sheet(font, x, y, &rect);\n}\n\nvoid TEXT::print_string(const char *str, unsigned x, unsigned y)\n{\n GRAPHICS::Rect_t rect;\n rect.w = 8;\n rect.h = 8;\n for (unsigned index = 0; str[index]; index++)\n {\n char c = str[index];\n rect.x = (c % 16) * 8;\n rect.y = (c \/ 16) * 8;\n draw_sprite_sheet(font, x, y, &rect);\n x += 8;\n }\n}\n\nvoid TEXT::print_string(const std::string &str, unsigned x, unsigned y) {\n TEXT::print_string(str.c_str(), x, y);\n}\n\nvoid TEXT::print_format(unsigned x, unsigned y, const char *format, ...) {\n\tchar buffer[256] = \"\";\n\tva_list args;\n\tva_start(args, format);\n\tvsnprintf(buffer, 256, format, args);\n\tprint_string(buffer, x, y);\n}\n\nvoid TEXT::print_format(unsigned x, unsigned y, const std::string &format, ...) {\n TEXT::print_format(x, y, format.c_str());\n}\n<commit_msg>Format<commit_after>#include \"sprites.h\"\n#include \"Graphics.h\"\n#include \"Text.h\"\n#include <cstdio>\n#include <cstdarg>\n#include <string>\n\n#define TEXT WalrusRPG::Graphics::Text\n#define GRAPHICS WalrusRPG::Graphics\n\nvoid TEXT::print_char(char c, unsigned x, unsigned y)\n{\n GRAPHICS::Rect_t rect;\n rect.w = 8;\n rect.h = 8;\n rect.x = (c % 16) * 8;\n rect.y = (c \/ 16) * 8;\n draw_sprite_sheet(font, x, y, &rect);\n}\n\nvoid TEXT::print_string(const char *str, unsigned x, unsigned y)\n{\n GRAPHICS::Rect_t rect;\n rect.w = 8;\n rect.h = 8;\n for (unsigned index = 0; str[index]; index++)\n {\n char c = str[index];\n rect.x = (c % 16) * 8;\n rect.y = (c \/ 16) * 8;\n draw_sprite_sheet(font, x, y, &rect);\n x += 8;\n }\n}\n\nvoid TEXT::print_string(const std::string &str, unsigned x, unsigned y)\n{\n TEXT::print_string(str.c_str(), x, y);\n}\n\nvoid TEXT::print_format(unsigned x, unsigned y, const char *format, ...)\n{\n char buffer[256] =\n \"\";\n va_list args;\n va_start(args, format);\n vsnprintf(buffer, 256, format, args);\n print_string(buffer, x, y);\n}\n\nvoid TEXT::print_format(unsigned x, unsigned y, const std::string &format, ...)\n{\n TEXT::print_format(x, y, format.c_str());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"MainScene.h\"\n\nScene* MainScene::createScene()\n{\n auto scene = Scene::create();\n \n auto layer = MainScene::create();\n\n scene->addChild(layer);\n\n return scene;\n}\n\nbool MainScene::init()\n{\n\tif (!Layer::init())\n\t{\n\t\treturn false;\n\t}\n\n\tSize visibleSize = Director::getInstance()->getVisibleSize();\n\tVec2 origin = Director::getInstance()->getVisibleOrigin();\n\n\tauto closeItem = MenuItemImage::create(\n\t\t\"CloseNormal.png\",\n\t\t\"CloseSelected.png\",\n\t\tCC_CALLBACK_1(MainScene::menuCloseCallback, this));\n\n\tcloseItem->setPosition(Vec2(origin.x + visibleSize.width - closeItem->getContentSize().width \/ 2,\n\t\torigin.y + closeItem->getContentSize().height \/ 2));\n\n\tauto menu = Menu::create(closeItem, NULL);\n\tmenu->setPosition(Vec2::ZERO);\n\tthis->addChild(menu, 1);\n}\n\nvoid MainScene::menuCloseCallback(Ref* pSender)\n{\n Director::getInstance()->end();\n\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n exit(0);\n#endif\n}\n<commit_msg>particle<commit_after>#include \"stdafx.h\"\n#include \"MainScene.h\"\n\nScene* MainScene::createScene()\n{\n auto scene = Scene::create();\n \n auto layer = MainScene::create();\n\n scene->addChild(layer);\n\n return scene;\n}\n\nbool MainScene::init()\n{\n\tif (!Layer::init())\n\t{\n\t\treturn false;\n\t}\n\n\tSize visibleSize = Director::getInstance()->getVisibleSize();\n\tVec2 origin = Director::getInstance()->getVisibleOrigin();\n\n\tauto closeItem = MenuItemImage::create(\n\t\t\"CloseNormal.png\",\n\t\t\"CloseSelected.png\",\n\t\tCC_CALLBACK_1(MainScene::menuCloseCallback, this));\n\n\tcloseItem->setPosition(Vec2(origin.x + visibleSize.width - closeItem->getContentSize().width \/ 2,\n\t\torigin.y + closeItem->getContentSize().height \/ 2));\n\n\tauto menu = Menu::create(closeItem, NULL);\n\tmenu->setPosition(Vec2::ZERO);\n\tthis->addChild(menu, 1);\n\n\tParticleFireworks* particle = ParticleFireworks::create();\n\tparticle->setAngle(60);\n\tparticle->setEmissionRate(500);\n\tparticle->setGravity(Vec2::ZERO);\n\tthis->addChild(particle);\n}\n\nvoid MainScene::menuCloseCallback(Ref* pSender)\n{\n Director::getInstance()->end();\n\n#if (CC_TARGET_PLATFORM == CC_PLATFORM_IOS)\n exit(0);\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2016, The OpenThread Authors.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * @brief\n * This file includes the platform-specific initializers.\n *\/\n\n#include \"openthread-posix-config.h\"\n#include \"platform-posix.h\"\n\n#include <assert.h>\n\n#include <openthread-core-config.h>\n#include <openthread\/tasklet.h>\n#include <openthread\/platform\/alarm-milli.h>\n#include <openthread\/platform\/radio.h>\n#include <openthread\/platform\/uart.h>\n\n#include \"common\/code_utils.hpp\"\n\nuint64_t gNodeId = 0;\n\notInstance *otSysInit(otPlatformConfig *aPlatformConfig)\n{\n otInstance * instance = nullptr;\n ot::Posix::RadioUrl radioUrl(aPlatformConfig->mRadioUrl);\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeInit(static_cast<uint16_t>(atoi(radioUrl.GetValue(\"forkpty-arg\"))));\n#endif\n\n VerifyOrDie(radioUrl.GetPath() != nullptr, OT_EXIT_INVALID_ARGUMENTS);\n platformAlarmInit(aPlatformConfig->mSpeedUpFactor, aPlatformConfig->mRealTimeSignal);\n platformRadioInit(&radioUrl);\n platformRandomInit();\n\n instance = otInstanceInitSingle();\n assert(instance != nullptr);\n\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifInit(instance, aPlatformConfig->mInterfaceName);\n#elif OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpInit(aPlatformConfig->mInterfaceName);\n#endif\n\n return instance;\n}\n\nvoid otSysDeinit(void)\n{\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeDeinit();\n#endif\n platformRadioDeinit();\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifDeinit();\n#endif\n IgnoreError(otPlatUartDisable());\n}\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n\/**\n * This function try selecting the given file descriptors in nonblocking mode.\n *\n * @param[inout] aReadFdSet A pointer to the read file descriptors.\n * @param[inout] aWriteFdSet A pointer to the write file descriptors.\n * @param[inout] aErrorFdSet A pointer to the error file descriptors.\n * @param[in] aMaxFd The max file descriptor.\n *\n * @returns The value returned from select().\n *\n *\/\nstatic int trySelect(fd_set *aReadFdSet, fd_set *aWriteFdSet, fd_set *aErrorFdSet, int aMaxFd)\n{\n struct timeval timeout = {0, 0};\n fd_set originReadFdSet = *aReadFdSet;\n fd_set originWriteFdSet = *aWriteFdSet;\n fd_set originErrorFdSet = *aErrorFdSet;\n int rval;\n\n rval = select(aMaxFd + 1, aReadFdSet, aWriteFdSet, aErrorFdSet, &timeout);\n\n if (rval == 0)\n {\n *aReadFdSet = originReadFdSet;\n *aWriteFdSet = originWriteFdSet;\n *aErrorFdSet = originErrorFdSet;\n }\n\n return rval;\n}\n#endif \/\/ OPENTHREAD_POSIX_VIRTUAL_TIME\n\nvoid otSysMainloopUpdate(otInstance *aInstance, otSysMainloopContext *aMainloop)\n{\n platformAlarmUpdateTimeout(&aMainloop->mTimeout);\n platformUartUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mMaxFd);\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpUpdateFdSet(aInstance, &aMainloop->mReadFdSet, &aMainloop->mMaxFd);\n#endif\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mMaxFd);\n#endif\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet, &aMainloop->mMaxFd,\n &aMainloop->mTimeout);\n#else\n platformRadioUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mMaxFd, &aMainloop->mTimeout);\n#endif\n\n if (otTaskletsArePending(aInstance))\n {\n aMainloop->mTimeout.tv_sec = 0;\n aMainloop->mTimeout.tv_usec = 0;\n }\n}\n\nint otSysMainloopPoll(otSysMainloopContext *aMainloop)\n{\n int rval;\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n if (timerisset(&aMainloop->mTimeout))\n {\n \/\/ Make sure there are no data ready in UART\n rval = trySelect(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet, aMainloop->mMaxFd);\n\n if (rval == 0)\n {\n bool noWrite = true;\n\n \/\/ If there are write requests, the device is supposed to wake soon\n for (int i = 0; i < aMainloop->mMaxFd + 1; ++i)\n {\n if (FD_ISSET(i, &aMainloop->mWriteFdSet))\n {\n noWrite = false;\n break;\n }\n }\n\n if (noWrite)\n {\n virtualTimeSendSleepEvent(&aMainloop->mTimeout);\n }\n\n rval = select(aMainloop->mMaxFd + 1, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet,\n &aMainloop->mErrorFdSet, nullptr);\n }\n }\n else\n#endif\n {\n rval = select(aMainloop->mMaxFd + 1, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mTimeout);\n }\n\n return rval;\n}\n\nvoid otSysMainloopProcess(otInstance *aInstance, const otSysMainloopContext *aMainloop)\n{\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeProcess(aInstance, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n#else\n platformRadioProcess(aInstance, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet);\n#endif\n platformUartProcess(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n platformAlarmProcess(aInstance);\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifProcess(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n#endif\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpProcess(aInstance, &aMainloop->mReadFdSet);\n#endif\n}\n<commit_msg>[otns] implement `otPlatOtnsStatus` for posix (#5357)<commit_after>\/*\n * Copyright (c) 2016, The OpenThread Authors.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * @brief\n * This file includes the platform-specific initializers.\n *\/\n\n#include \"openthread-posix-config.h\"\n#include \"platform-posix.h\"\n\n#include <assert.h>\n\n#include <openthread-core-config.h>\n#include <openthread\/tasklet.h>\n#include <openthread\/platform\/alarm-milli.h>\n#include <openthread\/platform\/otns.h>\n#include <openthread\/platform\/radio.h>\n#include <openthread\/platform\/uart.h>\n\n#include \"common\/code_utils.hpp\"\n\nuint64_t gNodeId = 0;\n\notInstance *otSysInit(otPlatformConfig *aPlatformConfig)\n{\n otInstance * instance = nullptr;\n ot::Posix::RadioUrl radioUrl(aPlatformConfig->mRadioUrl);\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeInit(static_cast<uint16_t>(atoi(radioUrl.GetValue(\"forkpty-arg\"))));\n#endif\n\n VerifyOrDie(radioUrl.GetPath() != nullptr, OT_EXIT_INVALID_ARGUMENTS);\n platformAlarmInit(aPlatformConfig->mSpeedUpFactor, aPlatformConfig->mRealTimeSignal);\n platformRadioInit(&radioUrl);\n platformRandomInit();\n\n instance = otInstanceInitSingle();\n assert(instance != nullptr);\n\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifInit(instance, aPlatformConfig->mInterfaceName);\n#elif OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpInit(aPlatformConfig->mInterfaceName);\n#endif\n\n return instance;\n}\n\nvoid otSysDeinit(void)\n{\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeDeinit();\n#endif\n platformRadioDeinit();\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifDeinit();\n#endif\n IgnoreError(otPlatUartDisable());\n}\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n\/**\n * This function try selecting the given file descriptors in nonblocking mode.\n *\n * @param[inout] aReadFdSet A pointer to the read file descriptors.\n * @param[inout] aWriteFdSet A pointer to the write file descriptors.\n * @param[inout] aErrorFdSet A pointer to the error file descriptors.\n * @param[in] aMaxFd The max file descriptor.\n *\n * @returns The value returned from select().\n *\n *\/\nstatic int trySelect(fd_set *aReadFdSet, fd_set *aWriteFdSet, fd_set *aErrorFdSet, int aMaxFd)\n{\n struct timeval timeout = {0, 0};\n fd_set originReadFdSet = *aReadFdSet;\n fd_set originWriteFdSet = *aWriteFdSet;\n fd_set originErrorFdSet = *aErrorFdSet;\n int rval;\n\n rval = select(aMaxFd + 1, aReadFdSet, aWriteFdSet, aErrorFdSet, &timeout);\n\n if (rval == 0)\n {\n *aReadFdSet = originReadFdSet;\n *aWriteFdSet = originWriteFdSet;\n *aErrorFdSet = originErrorFdSet;\n }\n\n return rval;\n}\n#endif \/\/ OPENTHREAD_POSIX_VIRTUAL_TIME\n\nvoid otSysMainloopUpdate(otInstance *aInstance, otSysMainloopContext *aMainloop)\n{\n platformAlarmUpdateTimeout(&aMainloop->mTimeout);\n platformUartUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mMaxFd);\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpUpdateFdSet(aInstance, &aMainloop->mReadFdSet, &aMainloop->mMaxFd);\n#endif\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mMaxFd);\n#endif\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet, &aMainloop->mMaxFd,\n &aMainloop->mTimeout);\n#else\n platformRadioUpdateFdSet(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mMaxFd, &aMainloop->mTimeout);\n#endif\n\n if (otTaskletsArePending(aInstance))\n {\n aMainloop->mTimeout.tv_sec = 0;\n aMainloop->mTimeout.tv_usec = 0;\n }\n}\n\nint otSysMainloopPoll(otSysMainloopContext *aMainloop)\n{\n int rval;\n\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n if (timerisset(&aMainloop->mTimeout))\n {\n \/\/ Make sure there are no data ready in UART\n rval = trySelect(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet, aMainloop->mMaxFd);\n\n if (rval == 0)\n {\n bool noWrite = true;\n\n \/\/ If there are write requests, the device is supposed to wake soon\n for (int i = 0; i < aMainloop->mMaxFd + 1; ++i)\n {\n if (FD_ISSET(i, &aMainloop->mWriteFdSet))\n {\n noWrite = false;\n break;\n }\n }\n\n if (noWrite)\n {\n virtualTimeSendSleepEvent(&aMainloop->mTimeout);\n }\n\n rval = select(aMainloop->mMaxFd + 1, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet,\n &aMainloop->mErrorFdSet, nullptr);\n }\n }\n else\n#endif\n {\n rval = select(aMainloop->mMaxFd + 1, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet,\n &aMainloop->mTimeout);\n }\n\n return rval;\n}\n\nvoid otSysMainloopProcess(otInstance *aInstance, const otSysMainloopContext *aMainloop)\n{\n#if OPENTHREAD_POSIX_VIRTUAL_TIME\n virtualTimeProcess(aInstance, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n#else\n platformRadioProcess(aInstance, &aMainloop->mReadFdSet, &aMainloop->mWriteFdSet);\n#endif\n platformUartProcess(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n platformAlarmProcess(aInstance);\n#if OPENTHREAD_CONFIG_PLATFORM_NETIF_ENABLE\n platformNetifProcess(&aMainloop->mReadFdSet, &aMainloop->mWriteFdSet, &aMainloop->mErrorFdSet);\n#endif\n#if OPENTHREAD_CONFIG_PLATFORM_UDP_ENABLE\n platformUdpProcess(aInstance, &aMainloop->mReadFdSet);\n#endif\n}\n\n#if OPENTHREAD_CONFIG_OTNS_ENABLE\n\nvoid otPlatOtnsStatus(const char *aStatus)\n{\n otLogOtns(\"[OTNS] %s\", aStatus);\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Simple WASM speed test.\n *\n * Run with:\n * `bazel run --config=libc++ -c opt \/\/test\/extensions\/bootstrap\/wasm:wasm_speed_test`\n *\/\n#include \"common\/event\/dispatcher_impl.h\"\n#include \"common\/stats\/isolated_store_impl.h\"\n\n#include \"extensions\/common\/wasm\/wasm.h\"\n\n#include \"test\/mocks\/server\/mocks.h\"\n#include \"test\/mocks\/upstream\/mocks.h\"\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"absl\/types\/optional.h\"\n#include \"benchmark\/benchmark.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"tools\/cpp\/runfiles\/runfiles.h\"\n\nusing bazel::tools::cpp::runfiles::Runfiles;\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace Wasm {\n\nclass TestRoot : public Envoy::Extensions::Common::Wasm::Context {\npublic:\n TestRoot(Extensions::Common::Wasm::Wasm* wasm,\n const std::shared_ptr<Extensions::Common::Wasm::Plugin>& plugin)\n : Envoy::Extensions::Common::Wasm::Context(wasm, plugin) {}\n\n using Envoy::Extensions::Common::Wasm::Context::log;\n proxy_wasm::WasmResult log(uint32_t level, absl::string_view message) override {\n log_(static_cast<spdlog::level::level_enum>(level), message);\n return proxy_wasm::WasmResult::Ok;\n }\n MOCK_METHOD(void, log_, (spdlog::level::level_enum level, absl::string_view message));\n};\n\nstatic void bmWasmSimpleCallSpeedTest(benchmark::State& state, std::string test,\n std::string runtime) {\n Envoy::Logger::Registry::getLog(Logger::Id::wasm).set_level(spdlog::level::off);\n Stats::IsolatedStoreImpl stats_store;\n Api::ApiPtr api = Api::createApiForTest(stats_store);\n Upstream::MockClusterManager cluster_manager;\n Event::DispatcherPtr dispatcher(api->allocateDispatcher(\"wasm_test\"));\n auto scope = Stats::ScopeSharedPtr(stats_store.createScope(\"wasm.\"));\n NiceMock<LocalInfo::MockLocalInfo> local_info;\n\n envoy::extensions::wasm::v3::PluginConfig plugin_config;\n *plugin_config.mutable_root_id() = \"some_long_root_id\";\n plugin_config.mutable_vm_config()->mutable_configuration()->set_value(test);\n auto plugin = std::make_shared<Extensions::Common::Wasm::Plugin>(\n plugin_config, envoy::config::core::v3::TrafficDirection::UNSPECIFIED, local_info, nullptr);\n auto wasm = std::make_unique<Extensions::Common::Wasm::Wasm>(plugin->wasmConfig(), \"vm_key\",\n scope, cluster_manager, *dispatcher);\n std::string code;\n if (runtime == \"null\") {\n code = \"WasmSpeedCpp\";\n } else {\n code = TestEnvironment::readFileToStringForTest(\n TestEnvironment::runfilesPath(\"test\/extensions\/bootstrap\/wasm\/test_data\/speed_cpp.wasm\"));\n }\n EXPECT_FALSE(code.empty());\n EXPECT_TRUE(wasm->initialize(code, false));\n wasm->setCreateContextForTesting(\n nullptr,\n [](Extensions::Common::Wasm::Wasm* wasm,\n const std::shared_ptr<Extensions::Common::Wasm::Plugin>& plugin)\n -> proxy_wasm::ContextBase* { return new TestRoot(wasm, plugin); });\n\n auto root_context = wasm->start(plugin);\n for (__attribute__((unused)) auto _ : state) {\n root_context->onTick(0);\n }\n}\n\n#if defined(ENVOY_WASM_WAVM)\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, V8SpeedTest_##_t, std::string(#_t), \\\n std::string(\"v8\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, WavmSpeedTest_##_t, std::string(#_t), \\\n std::string(\"wavm\"));\n#else\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, V8SpeedTest_##_t, std::string(#_t), \\\n std::string(\"v8\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\"));\n#endif\n\nB(empty)\nB(get_current_time)\nB(small_string)\nB(small_string1000)\nB(small_string_check_compiler)\nB(small_string_check_compiler1000)\nB(large_string)\nB(large_string1000)\nB(get_property)\nB(grpc_service)\nB(grpc_service1000)\nB(modify_metadata)\nB(modify_metadata1000)\nB(json_serialize)\nB(json_deserialize)\nB(json_deserialize_empty)\nB(convert_to_filter_state)\n\n} \/\/ namespace Wasm\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n\nint main(int argc, char** argv) {\n ::benchmark::Initialize(&argc, argv);\n Envoy::TestEnvironment::initializeOptions(argc, argv);\n \/\/ Create a Runfiles object for runfiles lookup.\n \/\/ https:\/\/github.com\/bazelbuild\/bazel\/blob\/master\/tools\/cpp\/runfiles\/runfiles_src.h#L32\n std::string error;\n std::unique_ptr<Runfiles> runfiles(Runfiles::Create(argv[0], &error));\n RELEASE_ASSERT(Envoy::TestEnvironment::getOptionalEnvVar(\"NORUNFILES\").has_value() ||\n runfiles != nullptr,\n error);\n Envoy::TestEnvironment::setRunfiles(runfiles.get());\n Envoy::TestEnvironment::setEnvVar(\"ENVOY_IP_TEST_VERSIONS\", \"all\", 0);\n Envoy::Event::Libevent::Global::initialize();\n if (::benchmark::ReportUnrecognizedArguments(argc, argv)) {\n return 1;\n }\n ::benchmark::RunSpecifiedBenchmarks();\n return 0;\n}\n<commit_msg>wasm: fix benchmarks when using non-V8 Wasm runtime. (#15214)<commit_after>\/**\n * Simple WASM speed test.\n *\n * Run with:\n * `bazel run --config=libc++ -c opt \/\/test\/extensions\/bootstrap\/wasm:wasm_speed_test`\n *\/\n#include \"common\/event\/dispatcher_impl.h\"\n#include \"common\/stats\/isolated_store_impl.h\"\n\n#include \"extensions\/common\/wasm\/wasm.h\"\n\n#include \"test\/mocks\/server\/mocks.h\"\n#include \"test\/mocks\/upstream\/mocks.h\"\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"absl\/types\/optional.h\"\n#include \"benchmark\/benchmark.h\"\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n#include \"tools\/cpp\/runfiles\/runfiles.h\"\n\nusing bazel::tools::cpp::runfiles::Runfiles;\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace Wasm {\n\nclass TestRoot : public Envoy::Extensions::Common::Wasm::Context {\npublic:\n TestRoot(Extensions::Common::Wasm::Wasm* wasm,\n const std::shared_ptr<Extensions::Common::Wasm::Plugin>& plugin)\n : Envoy::Extensions::Common::Wasm::Context(wasm, plugin) {}\n\n using Envoy::Extensions::Common::Wasm::Context::log;\n proxy_wasm::WasmResult log(uint32_t level, absl::string_view message) override {\n log_(static_cast<spdlog::level::level_enum>(level), message);\n return proxy_wasm::WasmResult::Ok;\n }\n MOCK_METHOD(void, log_, (spdlog::level::level_enum level, absl::string_view message));\n};\n\nstatic void bmWasmSimpleCallSpeedTest(benchmark::State& state, std::string test,\n std::string runtime) {\n Envoy::Logger::Registry::getLog(Logger::Id::wasm).set_level(spdlog::level::off);\n Stats::IsolatedStoreImpl stats_store;\n Api::ApiPtr api = Api::createApiForTest(stats_store);\n Upstream::MockClusterManager cluster_manager;\n Event::DispatcherPtr dispatcher(api->allocateDispatcher(\"wasm_test\"));\n auto scope = Stats::ScopeSharedPtr(stats_store.createScope(\"wasm.\"));\n NiceMock<LocalInfo::MockLocalInfo> local_info;\n\n envoy::extensions::wasm::v3::PluginConfig plugin_config;\n *plugin_config.mutable_root_id() = \"some_long_root_id\";\n plugin_config.mutable_vm_config()->mutable_configuration()->set_value(test);\n auto plugin = std::make_shared<Extensions::Common::Wasm::Plugin>(\n plugin_config, envoy::config::core::v3::TrafficDirection::UNSPECIFIED, local_info, nullptr);\n auto wasm = std::make_unique<Extensions::Common::Wasm::Wasm>(plugin->wasmConfig(), \"vm_key\",\n scope, cluster_manager, *dispatcher);\n std::string code;\n if (runtime == \"null\") {\n code = \"WasmSpeedCpp\";\n } else {\n code = TestEnvironment::readFileToStringForTest(\n TestEnvironment::runfilesPath(\"test\/extensions\/bootstrap\/wasm\/test_data\/speed_cpp.wasm\"));\n }\n EXPECT_FALSE(code.empty());\n EXPECT_TRUE(wasm->initialize(code, false));\n wasm->setCreateContextForTesting(\n nullptr,\n [](Extensions::Common::Wasm::Wasm* wasm,\n const std::shared_ptr<Extensions::Common::Wasm::Plugin>& plugin)\n -> proxy_wasm::ContextBase* { return new TestRoot(wasm, plugin); });\n\n auto root_context = wasm->start(plugin);\n for (__attribute__((unused)) auto _ : state) {\n root_context->onTick(0);\n }\n}\n\n#if defined(ENVOY_WASM_V8)\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, WasmSpeedTest_##_t, std::string(#_t), \\\n std::string(\"v8\"));\n#elif defined(ENVOY_WASM_WAVM)\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, WasmSpeedTest_##_t, std::string(#_t), \\\n std::string(\"wavm\"));\n#elif defined(ENVOY_WASM_WASMTIME)\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\")); \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, WasmSpeedTest_##_t, std::string(#_t), \\\n std::string(\"wasmtime\"));\n#else\n#define B(_t) \\\n BENCHMARK_CAPTURE(bmWasmSimpleCallSpeedTest, NullSpeedTest_##_t, std::string(#_t), \\\n std::string(\"null\"));\n#endif\n\nB(empty)\nB(get_current_time)\nB(small_string)\nB(small_string1000)\nB(small_string_check_compiler)\nB(small_string_check_compiler1000)\nB(large_string)\nB(large_string1000)\nB(get_property)\nB(grpc_service)\nB(grpc_service1000)\nB(modify_metadata)\nB(modify_metadata1000)\nB(json_serialize)\nB(json_deserialize)\nB(json_deserialize_empty)\nB(convert_to_filter_state)\n\n} \/\/ namespace Wasm\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n\nint main(int argc, char** argv) {\n ::benchmark::Initialize(&argc, argv);\n Envoy::TestEnvironment::initializeOptions(argc, argv);\n \/\/ Create a Runfiles object for runfiles lookup.\n \/\/ https:\/\/github.com\/bazelbuild\/bazel\/blob\/master\/tools\/cpp\/runfiles\/runfiles_src.h#L32\n std::string error;\n std::unique_ptr<Runfiles> runfiles(Runfiles::Create(argv[0], &error));\n RELEASE_ASSERT(Envoy::TestEnvironment::getOptionalEnvVar(\"NORUNFILES\").has_value() ||\n runfiles != nullptr,\n error);\n Envoy::TestEnvironment::setRunfiles(runfiles.get());\n Envoy::TestEnvironment::setEnvVar(\"ENVOY_IP_TEST_VERSIONS\", \"all\", 0);\n Envoy::Event::Libevent::Global::initialize();\n if (::benchmark::ReportUnrecognizedArguments(argc, argv)) {\n return 1;\n }\n ::benchmark::RunSpecifiedBenchmarks();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"envoy\/config\/bootstrap\/v2\/bootstrap.pb.h\"\n#include \"envoy\/registry\/registry.h\"\n\n#include \"common\/config\/well_known_names.h\"\n#include \"common\/protobuf\/utility.h\"\n\n#include \"extensions\/stat_sinks\/common\/statsd\/statsd.h\"\n#include \"extensions\/stat_sinks\/statsd\/config.h\"\n#include \"extensions\/stat_sinks\/well_known_names.h\"\n\n#include \"test\/mocks\/server\/mocks.h\"\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/network_utility.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\nusing testing::NiceMock;\nusing testing::Return;\nusing testing::ReturnRef;\nusing testing::_;\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace StatSinks {\nnamespace Statsd {\n\nTEST(StatsConfigTest, ValidTcpStatsd) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n EXPECT_NE(sink, nullptr);\n EXPECT_NE(dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get()), nullptr);\n}\n\nTEST(StatsConfigTest, UdpSinkDefaultPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n auto defaultPrefix = Common::Statsd::getDefaultPrefix();\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n socket_address.set_address(\"127.0.0.1\");\n socket_address.set_port_value(8125);\n EXPECT_EQ(sink_config.prefix(), \"\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto udp_sink = dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get());\n ASSERT_NE(udp_sink, nullptr);\n EXPECT_EQ(udp_sink->getPrefix(), defaultPrefix);\n}\n\nTEST(StatsConfigTest, UdpSinkCustomPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n const std::string customPrefix = \"prefix.test\";\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n socket_address.set_address(\"127.0.0.1\");\n socket_address.set_port_value(8125);\n sink_config.set_prefix(customPrefix);\n EXPECT_NE(sink_config.prefix(), \"\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto udp_sink = dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get());\n ASSERT_NE(udp_sink, nullptr);\n EXPECT_EQ(udp_sink->getPrefix(), customPrefix);\n}\n\nTEST(StatsConfigTest, TcpSinkDefaultPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n auto defaultPrefix = Common::Statsd::getDefaultPrefix();\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n EXPECT_EQ(sink_config.prefix(), \"\");\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto tcp_sink = dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get());\n ASSERT_NE(tcp_sink, nullptr);\n EXPECT_EQ(tcp_sink->getPrefix(), defaultPrefix);\n}\n\nTEST(StatsConfigTest, TcpSinkCustomPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n std::string prefix = \"prefixTest\";\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n ASSERT_NE(sink_config.prefix(), prefix);\n sink_config.set_prefix(prefix);\n EXPECT_EQ(sink_config.prefix(), prefix);\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto tcp_sink = dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get());\n ASSERT_NE(tcp_sink, nullptr);\n EXPECT_EQ(tcp_sink->getPrefix(), prefix);\n}\n\nclass StatsConfigLoopbackTest : public testing::TestWithParam<Network::Address::IpVersion> {};\nINSTANTIATE_TEST_CASE_P(IpVersions, StatsConfigLoopbackTest,\n testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n TestUtility::ipTestParamsToString);\n\nTEST_P(StatsConfigLoopbackTest, ValidUdpIpStatsd) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n auto loopback_flavor = Network::Test::getCanonicalLoopbackAddress(GetParam());\n socket_address.set_address(loopback_flavor->ip()->addressAsString());\n socket_address.set_port_value(8125);\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n EXPECT_NE(sink, nullptr);\n EXPECT_NE(dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get()), nullptr);\n EXPECT_EQ(dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get())->getUseTagForTest(), false);\n}\n\n\/\/ Negative test for protoc-gen-validate constraints for statsd.\nTEST(StatsdConfigTest, ValidateFail) {\n NiceMock<Server::MockInstance> server;\n EXPECT_THROW(\n StatsdSinkFactory().createStatsSink(envoy::config::metrics::v2::StatsdSink(), server),\n ProtoValidationException);\n}\n\n} \/\/ namespace Statsd\n} \/\/ namespace StatSinks\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n<commit_msg>tests: Parameterize StatsConfigTest by IP version (#3241)<commit_after>#include \"envoy\/config\/bootstrap\/v2\/bootstrap.pb.h\"\n#include \"envoy\/network\/address.h\"\n#include \"envoy\/registry\/registry.h\"\n\n#include \"common\/config\/well_known_names.h\"\n#include \"common\/protobuf\/utility.h\"\n\n#include \"extensions\/stat_sinks\/common\/statsd\/statsd.h\"\n#include \"extensions\/stat_sinks\/statsd\/config.h\"\n#include \"extensions\/stat_sinks\/well_known_names.h\"\n\n#include \"test\/mocks\/server\/mocks.h\"\n#include \"test\/test_common\/environment.h\"\n#include \"test\/test_common\/network_utility.h\"\n#include \"test\/test_common\/utility.h\"\n\n#include \"gmock\/gmock.h\"\n#include \"gtest\/gtest.h\"\n\nusing testing::NiceMock;\nusing testing::Return;\nusing testing::ReturnRef;\nusing testing::_;\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace StatSinks {\nnamespace Statsd {\n\nTEST(StatsConfigTest, ValidTcpStatsd) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n EXPECT_NE(sink, nullptr);\n EXPECT_NE(dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get()), nullptr);\n}\n\nclass StatsConfigParameterizedTest : public testing::TestWithParam<Network::Address::IpVersion> {};\n\nINSTANTIATE_TEST_CASE_P(IpVersions, StatsConfigParameterizedTest,\n testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n TestUtility::ipTestParamsToString);\n\nTEST_P(StatsConfigParameterizedTest, UdpSinkDefaultPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n auto defaultPrefix = Common::Statsd::getDefaultPrefix();\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n if (GetParam() == Network::Address::IpVersion::v4) {\n socket_address.set_address(\"127.0.0.1\");\n } else {\n socket_address.set_address(\"::1\");\n }\n socket_address.set_port_value(8125);\n EXPECT_EQ(sink_config.prefix(), \"\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto udp_sink = dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get());\n ASSERT_NE(udp_sink, nullptr);\n EXPECT_EQ(udp_sink->getPrefix(), defaultPrefix);\n}\n\nTEST_P(StatsConfigParameterizedTest, UdpSinkCustomPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n const std::string customPrefix = \"prefix.test\";\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n if (GetParam() == Network::Address::IpVersion::v4) {\n socket_address.set_address(\"127.0.0.1\");\n } else {\n socket_address.set_address(\"::1\");\n }\n socket_address.set_port_value(8125);\n sink_config.set_prefix(customPrefix);\n EXPECT_NE(sink_config.prefix(), \"\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto udp_sink = dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get());\n ASSERT_NE(udp_sink, nullptr);\n EXPECT_EQ(udp_sink->getPrefix(), customPrefix);\n}\n\nTEST(StatsConfigTest, TcpSinkDefaultPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n auto defaultPrefix = Common::Statsd::getDefaultPrefix();\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n EXPECT_EQ(sink_config.prefix(), \"\");\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto tcp_sink = dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get());\n ASSERT_NE(tcp_sink, nullptr);\n EXPECT_EQ(tcp_sink->getPrefix(), defaultPrefix);\n}\n\nTEST(StatsConfigTest, TcpSinkCustomPrefix) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n ProtobufTypes::String prefix = \"prefixTest\";\n sink_config.set_tcp_cluster_name(\"fake_cluster\");\n ASSERT_NE(sink_config.prefix(), prefix);\n sink_config.set_prefix(prefix);\n EXPECT_EQ(sink_config.prefix(), prefix);\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n ASSERT_NE(sink, nullptr);\n\n auto tcp_sink = dynamic_cast<Common::Statsd::TcpStatsdSink*>(sink.get());\n ASSERT_NE(tcp_sink, nullptr);\n EXPECT_EQ(tcp_sink->getPrefix(), prefix);\n}\n\nclass StatsConfigLoopbackTest : public testing::TestWithParam<Network::Address::IpVersion> {};\nINSTANTIATE_TEST_CASE_P(IpVersions, StatsConfigLoopbackTest,\n testing::ValuesIn(TestEnvironment::getIpVersionsForTest()),\n TestUtility::ipTestParamsToString);\n\nTEST_P(StatsConfigLoopbackTest, ValidUdpIpStatsd) {\n const std::string name = StatsSinkNames::get().STATSD;\n\n envoy::config::metrics::v2::StatsdSink sink_config;\n envoy::api::v2::core::Address& address = *sink_config.mutable_address();\n envoy::api::v2::core::SocketAddress& socket_address = *address.mutable_socket_address();\n socket_address.set_protocol(envoy::api::v2::core::SocketAddress::UDP);\n auto loopback_flavor = Network::Test::getCanonicalLoopbackAddress(GetParam());\n socket_address.set_address(loopback_flavor->ip()->addressAsString());\n socket_address.set_port_value(8125);\n\n Server::Configuration::StatsSinkFactory* factory =\n Registry::FactoryRegistry<Server::Configuration::StatsSinkFactory>::getFactory(name);\n ASSERT_NE(factory, nullptr);\n\n ProtobufTypes::MessagePtr message = factory->createEmptyConfigProto();\n MessageUtil::jsonConvert(sink_config, *message);\n\n NiceMock<Server::MockInstance> server;\n Stats::SinkPtr sink = factory->createStatsSink(*message, server);\n EXPECT_NE(sink, nullptr);\n EXPECT_NE(dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get()), nullptr);\n EXPECT_EQ(dynamic_cast<Common::Statsd::UdpStatsdSink*>(sink.get())->getUseTagForTest(), false);\n}\n\n\/\/ Negative test for protoc-gen-validate constraints for statsd.\nTEST(StatsdConfigTest, ValidateFail) {\n NiceMock<Server::MockInstance> server;\n EXPECT_THROW(\n StatsdSinkFactory().createStatsSink(envoy::config::metrics::v2::StatsdSink(), server),\n ProtoValidationException);\n}\n\n} \/\/ namespace Statsd\n} \/\/ namespace StatSinks\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Name: style.cpp\n\/\/ Purpose: Implementation of wxExStyle class\n\/\/ Author: Anton van Wezenbeek\n\/\/ Copyright: (c) 2011 Anton van Wezenbeek\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/config.h>\n#include <wx\/log.h> \n#include <wx\/stc\/stc.h>\n#include <wx\/tokenzr.h>\n#include <wx\/extension\/style.h>\n#include <wx\/extension\/lexers.h>\n\nwxExStyle::wxExStyle()\n : m_No()\n , m_Value()\n{\n}\n \nwxExStyle::wxExStyle(const wxXmlNode* node)\n{\n Set(node);\n}\n\nwxExStyle::wxExStyle(const wxString& no, const wxString& value)\n : m_Value(value)\n{\n SetNo(no);\n}\n\nvoid wxExStyle::Apply(wxStyledTextCtrl* stc) const\n{\n \/\/ Currently the default style is constructed using\n \/\/ default constructor.\n \/\/ If this is the only style, reset STC.\n if (m_No.empty())\n {\n stc->StyleResetDefault();\n }\n else\n {\n for (\n auto it = m_No.begin();\n it != m_No.end();\n ++it)\n {\n stc->StyleSetSpec(*it, m_Value);\n }\n }\n}\n\nbool wxExStyle::ContainsDefaultStyle() const\n{\n const auto it = m_No.find(wxSTC_STYLE_DEFAULT);\n return (it != m_No.end());\n}\n\nbool wxExStyle::IsOk() const\n{\n return !m_No.empty() && !m_Value.empty();\n}\n\nvoid wxExStyle::Set(const wxXmlNode* node)\n{\n SetNo(wxExLexers::Get()->ApplyMacro(node->GetAttribute(\"no\", \"0\")));\n\n m_Value = node->GetNodeContent().Strip(wxString::both);\n\n const auto it = \n wxExLexers::Get()->GetThemeMacros().find(m_Value);\n\n if (it != wxExLexers::Get()->GetThemeMacros().end())\n {\n wxString value = it->second;\n \n if (value.Contains(\"default-font\"))\n {\n const wxFont font(wxConfigBase::Get()->ReadObject(_(\"Default font\"), \n wxSystemSettings::GetFont(wxSYS_OEM_FIXED_FONT)));\n \n value.Replace(\"default-font\", \n wxString::Format(\"face:%s,size:%d\",\n font.GetFaceName().c_str(), font.GetPointSize()));\n }\n \n m_Value = value;\n }\n\n if (!IsOk())\n {\n wxLogError(_(\"Illegal style: %s on line: %d\"), \n m_Value.c_str(), node->GetLineNumber());\n }\n}\n\nvoid wxExStyle::SetNo(const wxString& no)\n{\n m_No.clear();\n \n wxStringTokenizer no_fields(no, \",\");\n\n \/\/ Collect each single no in the vector.\n while (no_fields.HasMoreTokens())\n {\n const wxString single = \n wxExLexers::Get()->ApplyMacro(no_fields.GetNextToken());\n\n if (single.IsNumber())\n {\n m_No.insert(atoi(single.c_str()));\n }\n else\n {\n wxLogError(_(\"Illegal style: %s\"), no.c_str());\n }\n }\n}\n<commit_msg>added option for italic and bold, does not work<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Name: style.cpp\n\/\/ Purpose: Implementation of wxExStyle class\n\/\/ Author: Anton van Wezenbeek\n\/\/ Copyright: (c) 2011 Anton van Wezenbeek\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <wx\/wxprec.h>\n#ifndef WX_PRECOMP\n#include <wx\/wx.h>\n#endif\n#include <wx\/config.h>\n#include <wx\/log.h> \n#include <wx\/stc\/stc.h>\n#include <wx\/tokenzr.h>\n#include <wx\/extension\/style.h>\n#include <wx\/extension\/lexers.h>\n\nwxExStyle::wxExStyle()\n : m_No()\n , m_Value()\n{\n}\n \nwxExStyle::wxExStyle(const wxXmlNode* node)\n{\n Set(node);\n}\n\nwxExStyle::wxExStyle(const wxString& no, const wxString& value)\n : m_Value(value)\n{\n SetNo(no);\n}\n\nvoid wxExStyle::Apply(wxStyledTextCtrl* stc) const\n{\n \/\/ Currently the default style is constructed using\n \/\/ default constructor.\n \/\/ If this is the only style, reset STC.\n if (m_No.empty())\n {\n stc->StyleResetDefault();\n }\n else\n {\n for (\n auto it = m_No.begin();\n it != m_No.end();\n ++it)\n {\n stc->StyleSetSpec(*it, m_Value);\n }\n }\n}\n\nbool wxExStyle::ContainsDefaultStyle() const\n{\n const auto it = m_No.find(wxSTC_STYLE_DEFAULT);\n return (it != m_No.end());\n}\n\nbool wxExStyle::IsOk() const\n{\n return !m_No.empty() && !m_Value.empty();\n}\n\nvoid wxExStyle::Set(const wxXmlNode* node)\n{\n SetNo(wxExLexers::Get()->ApplyMacro(node->GetAttribute(\"no\", \"0\")));\n\n m_Value = node->GetNodeContent().Strip(wxString::both);\n\n const auto it = \n wxExLexers::Get()->GetThemeMacros().find(m_Value);\n\n if (it != wxExLexers::Get()->GetThemeMacros().end())\n {\n wxString value = it->second;\n \n if (value.Contains(\"default-font\"))\n {\n const wxFont font(wxConfigBase::Get()->ReadObject(_(\"Default font\"), \n wxSystemSettings::GetFont(wxSYS_OEM_FIXED_FONT)));\n \n value.Replace(\"default-font\", \n wxString::Format(\"face:%s,size:%d\",\n font.GetFaceName().c_str(), font.GetPointSize()));\n \n if (\n (font.GetStyle() & wxFONTSTYLE_ITALIC) ||\n (font.GetStyle() & wxFONTSTYLE_SLANT))\n {\n \/\/ This does not work (2.9.2)\n \/\/ value += \",italic\";\n }\n \n if (font.GetWeight() & wxFONTWEIGHT_BOLD)\n {\n value += \",bold\";\n }\n \n if (font.GetUnderlined())\n {\n value += \",underline\";\n }\n }\n \n m_Value = value;\n }\n\n if (!IsOk())\n {\n wxLogError(_(\"Illegal style: %s on line: %d\"), \n m_Value.c_str(), node->GetLineNumber());\n }\n}\n\nvoid wxExStyle::SetNo(const wxString& no)\n{\n m_No.clear();\n \n wxStringTokenizer no_fields(no, \",\");\n\n \/\/ Collect each single no in the vector.\n while (no_fields.HasMoreTokens())\n {\n const wxString single = \n wxExLexers::Get()->ApplyMacro(no_fields.GetNextToken());\n\n if (single.IsNumber())\n {\n m_No.insert(atoi(single.c_str()));\n }\n else\n {\n wxLogError(_(\"Illegal style: %s\"), no.c_str());\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cstdlib>\n#include <cstdint>\n#include <string>\n#include <vector>\n#include <kj\/common.h>\n#include <kj\/debug.h>\n#include <kj\/main.h>\n#include <kj\/string.h>\n#include <glog\/logging.h>\n#include <turbo\/ipc\/posix\/pipe.hpp>\n#include <turbo\/process\/posix\/spawn.hpp>\n\nnamespace tpp = turbo::process::posix;\n\nstruct config\n{\n config() : port(0), bot_arg_count(0), bot_arg_offset(0) { }\n std::string address;\n int port;\n std::string bot_path;\n unsigned short bot_arg_count;\n unsigned short bot_arg_offset;\n};\n\nvoid parse_cmd_args(int argc, char* argv[], config& conf)\n{\n kj::TopLevelProcessContext context(argv[0]);\n kj::MainFunc parse = kj::MainBuilder(\n\t context,\n\t \"Robocup 2D Simulation Client v0.0\",\n\t \"Launches bot and connects to the server\")\n\t.expectArg(\"address\", [&] (kj::StringPtr arg)\n\t{\n\t conf.address = arg.cStr();\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectArg(\"port\", [&] (kj::StringPtr arg)\n\t{\n\t conf.port = atoi(arg.cStr());\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectArg(\"bot_path\", [&] (kj::StringPtr arg)\n\t{\n\t conf.bot_path = arg.cStr();\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectZeroOrMoreArgs(\"bot_arg\", [&] (kj::StringPtr)\n\t{\n\t ++conf.bot_arg_count;\n\t return true;\n\t})\n\t.build();\n KJ_STACK_ARRAY(kj::StringPtr, params, argc - 1, 8, 32);\n for (int iter = 1; iter < argc; ++iter)\n {\n\tparams[iter - 1] = argv[iter];\n }\n parse(argv[0], params);\n}\n\nint main(int argc, char* argv[])\n{\n config conf;\n parse_cmd_args(argc, argv, conf);\n tpp::child&& bot = tpp::spawn(conf.bot_path.c_str(), &argv[conf.bot_arg_offset], {}, 2 << 16);\n google::InitGoogleLogging(argv[0]);\n FLAGS_logtostderr = true;\n FLAGS_minloglevel = (kj::_::Debug::shouldLog(kj::_::Debug::Severity::INFO)) ? 0 : 1;\n google::InstallFailureSignalHandler();\n return 0;\n}\n<commit_msg>* added in goalie, team and uniform to the command line argument parser; these are needed for the InitRequest message * the port and uniform number arguments now have range checking<commit_after>#include <cstdlib>\n#include <cstdint>\n#include <limits>\n#include <string>\n#include <vector>\n#include <kj\/common.h>\n#include <kj\/debug.h>\n#include <kj\/main.h>\n#include <kj\/string.h>\n#include <glog\/logging.h>\n#include <turbo\/ipc\/posix\/pipe.hpp>\n#include <turbo\/process\/posix\/spawn.hpp>\n\nnamespace tpp = turbo::process::posix;\n\nstruct config\n{\n config() :\n\t goalie(false),\n\t port(0),\n\t bot_arg_count(0),\n\t bot_arg_offset(0)\n { }\n bool goalie;\n std::string address;\n uint16_t port;\n std::string team;\n uint8_t uniform;\n std::string bot_path;\n unsigned short bot_arg_count;\n unsigned short bot_arg_offset;\n};\n\nvoid parse_cmd_args(int argc, char* argv[], config& conf)\n{\n kj::TopLevelProcessContext context(argv[0]);\n kj::MainFunc parse = kj::MainBuilder(\n\t context,\n\t \"Robocup 2D Simulation Client v0.0\",\n\t \"Launches bot and connects to the server\")\n\t.addOption({'g', \"goalie\"}, [&] ()\n\t{\n\t conf.goalie = true;\n\t ++conf.bot_arg_offset;\n\t return true;\n\t},\n\t\"The bot is playing as the goalie.\")\n\t.expectArg(\"address\", [&] (kj::StringPtr arg)\n\t{\n\t conf.address = arg.cStr();\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectArg(\"port\", [&] (kj::StringPtr arg)\n\t{\n\t int tmp = atoi(arg.cStr());\n\t if (std::numeric_limits<decltype(conf.port)>::min() <= tmp && \n\t\t tmp <= std::numeric_limits<decltype(conf.port)>::max())\n\t {\n\t\tconf.port = static_cast<decltype(conf.port)>(tmp);\n\t\t++conf.bot_arg_offset;\n\t\treturn kj::MainBuilder::Validity(true);\n\t }\n\t else\n\t {\n\t\treturn kj::MainBuilder::Validity(kj::str(\n\t\t\t\"port number must be int the range \",\n\t\t\tstd::numeric_limits<decltype(conf.port)>::min(),\n\t\t\t\" to \",\n\t\t\tstd::numeric_limits<decltype(conf.port)>::max()));\n\t }\n\t})\n\t.expectArg(\"team\", [&] (kj::StringPtr arg)\n\t{\n\t conf.team = arg.cStr();\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectArg(\"uniform\", [&] (kj::StringPtr arg)\n\t{\n\t int tmp = atoi(arg.cStr());\n\t if (std::numeric_limits<decltype(conf.uniform)>::min() <= tmp && \n\t\t tmp <= std::numeric_limits<decltype(conf.uniform)>::max())\n\t {\n\t\tconf.uniform = static_cast<decltype(conf.uniform)>(tmp);\n\t\t++conf.bot_arg_offset;\n\t\treturn kj::MainBuilder::Validity(true);\n\t }\n\t else\n\t {\n\t\treturn kj::MainBuilder::Validity(kj::str(\n\t\t\t\"uniform number must be in the range \",\n\t\t\tstd::numeric_limits<decltype(conf.uniform)>::min(),\n\t\t\t\" to \",\n\t\t\tstd::numeric_limits<decltype(conf.uniform)>::max()));\n\t }\n\t})\n\t.expectArg(\"bot_path\", [&] (kj::StringPtr arg)\n\t{\n\t conf.bot_path = arg.cStr();\n\t ++conf.bot_arg_offset;\n\t return true;\n\t})\n\t.expectZeroOrMoreArgs(\"bot_arg\", [&] (kj::StringPtr)\n\t{\n\t ++conf.bot_arg_count;\n\t return true;\n\t})\n\t.build();\n KJ_STACK_ARRAY(kj::StringPtr, params, argc - 1, 8, 32);\n for (int iter = 1; iter < argc; ++iter)\n {\n\tparams[iter - 1] = argv[iter];\n }\n parse(argv[0], params);\n}\n\nint main(int argc, char* argv[])\n{\n config conf;\n parse_cmd_args(argc, argv, conf);\n tpp::child&& bot = tpp::spawn(conf.bot_path.c_str(), &argv[conf.bot_arg_offset], {}, 2 << 16);\n google::InitGoogleLogging(argv[0]);\n FLAGS_logtostderr = true;\n FLAGS_minloglevel = (kj::_::Debug::shouldLog(kj::_::Debug::Severity::INFO)) ? 0 : 1;\n google::InstallFailureSignalHandler();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iterator>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/imgproc.hpp>\n\nint main(void) {\n cv::Scalar black(0, 0, 0);\n cv::Scalar white(255, 255, 255);\n std::string input;\n\n std::getline(std::cin, input);\n if (std::cin.eof()) {\n exit(0);\n }\n int width, height;\n if (sscanf(input.c_str(), \"[%dx%d]\", &width, &height) != 2) {\n std::cout << \"Invalid input for [WxH]:\" << input << std::endl;\n exit(1);\n }\n cv::Mat image(width, height, CV_8U);\n\n while (1) {\n std::getline(std::cin, input);\n if (std::cin.eof()) {\n exit(0);\n }\n int x, y;\n if (sscanf(input.c_str(), \"%d,%d\", &x, &y) != 2) {\n std::cout << \"Invalid input:\" << input << std::endl;\n continue;\n }\n if (x < 0 || y < 0) {\n continue;\n }\n image = black;\n cv::circle(image, cv::Point(x, y), 20, white, -1);\n std::string window_name = \"circle\";\n cv::putText(image, std::to_string(x) + ',' + std::to_string(y),\n cv::Point(30, 30), cv::FONT_HERSHEY_SIMPLEX, 1,\n cv::Scalar(200, 200, 250));\n cv::imshow(window_name.c_str(), image);\n char c = static_cast<char>(cv::waitKey(10));\n if (c == 27) exit(0);\n }\n}\n<commit_msg>make image black when x,y are negative too<commit_after>#include <iostream>\n#include <iterator>\n#include <opencv2\/highgui.hpp>\n#include <opencv2\/imgproc.hpp>\n\nint main(void) {\n cv::Scalar black(0, 0, 0);\n cv::Scalar white(255, 255, 255);\n std::string input;\n\n std::getline(std::cin, input);\n if (std::cin.eof()) {\n exit(0);\n }\n int width, height;\n if (sscanf(input.c_str(), \"[%dx%d]\", &width, &height) != 2) {\n std::cout << \"Invalid input for [WxH]:\" << input << std::endl;\n exit(1);\n }\n cv::Mat image(width, height, CV_8U);\n\n while (1) {\n std::getline(std::cin, input);\n if (std::cin.eof()) {\n exit(0);\n }\n int x, y;\n if (sscanf(input.c_str(), \"%d,%d\", &x, &y) != 2) {\n std::cout << \"Invalid input:\" << input << std::endl;\n continue;\n }\n image = black;\n if (x < 0 || y < 0) {\n continue;\n }\n cv::circle(image, cv::Point(x, y), 20, white, -1);\n std::string window_name = \"circle\";\n cv::putText(image, std::to_string(x) + ',' + std::to_string(y),\n cv::Point(30, 30), cv::FONT_HERSHEY_SIMPLEX, 1,\n cv::Scalar(200, 200, 250));\n cv::imshow(window_name.c_str(), image);\n char c = static_cast<char>(cv::waitKey(10));\n if (c == 27) exit(0);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2016.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <vector.hpp>\n#include <string.hpp>\n\n#include \"arp_layer.hpp\"\n#include \"arp_cache.hpp\"\n#include \"ip_layer.hpp\"\n#include \"logging.hpp\"\n#include \"kernel_utils.hpp\"\n#include \"network.hpp\"\n\nnamespace {\n\n\/\/TODO\n\n} \/\/end of anonymous namespace\n\nvoid network::arp::decode(network::ethernet::packet& packet){\n header* arp_header = reinterpret_cast<header*>(packet.payload + packet.index);\n\n logging::logf(logging::log_level::TRACE, \"arp: Start ARP packet handling\\n\");\n\n auto hw_type = switch_endian_16(arp_header->hw_type);\n auto protocol_type = switch_endian_16(arp_header->protocol_type);\n\n \/\/ We only support ethernet hardware frames\n if(hw_type != 0x1){\n logging::logf(logging::log_level::ERROR, \"arp: Unhandled hardware type %h\\n\", size_t(hw_type));\n return;\n }\n\n \/\/ We only support IPV4 protocol\n if(protocol_type != 0x800){\n logging::logf(logging::log_level::ERROR, \"arp: Unhandled protocol type %h\\n\", size_t(protocol_type));\n return;\n }\n\n auto hw_len = arp_header->hw_len;\n auto protocol_len = arp_header->protocol_len;\n auto operation = switch_endian_16(arp_header->operation);\n\n \/\/ This should never happen\n if(hw_len != 0x6 || protocol_len != 0x4){\n logging::logf(logging::log_level::ERROR, \"arp: Unable to process the given length hw:%h prot:%h\\n\", size_t(hw_len), size_t(protocol_len));\n return;\n }\n\n if (operation != 0x1 && operation != 0x2) {\n logging::logf(logging::log_level::TRACE, \"arp: Unhandled operation %h\\n\", size_t(operation));\n return;\n }\n\n size_t source_hw = 0;\n size_t target_hw = 0;\n\n for(size_t i = 0; i < 3; ++i){\n source_hw |= uint64_t(switch_endian_16(arp_header->source_hw_addr[i])) << ((2 - i) * 16);\n target_hw |= uint64_t(switch_endian_16(arp_header->target_hw_addr[i])) << ((2 - i) * 16);\n }\n\n logging::logf(logging::log_level::TRACE, \"arp: Source HW Address %h \\n\", source_hw);\n logging::logf(logging::log_level::TRACE, \"arp: Target HW Address %h \\n\", target_hw);\n\n network::ip::address source_prot;\n network::ip::address target_prot;\n\n for(size_t i = 0; i < 2; ++i){\n auto source = switch_endian_16(arp_header->source_protocol_addr[i]);\n auto target = switch_endian_16(arp_header->target_protocol_addr[i]);\n\n source_prot.set_sub(2*i, source >> 8);\n source_prot.set_sub(2*i+1, source);\n\n target_prot.set_sub(2*i, target >> 8);\n target_prot.set_sub(2*i+1, target);\n }\n\n logging::logf(logging::log_level::TRACE, \"arp: Source Protocol Address %u.%u.%u.%u \\n\",\n uint64_t(source_prot(0)), uint64_t(source_prot(1)), uint64_t(source_prot(2)), uint64_t(source_prot(3)));\n logging::logf(logging::log_level::TRACE, \"arp: Target Protocol Address %u.%u.%u.%u \\n\",\n uint64_t(target_prot(0)), uint64_t(target_prot(1)), uint64_t(target_prot(2)), uint64_t(target_prot(3)));\n\n \/\/TODO Only do that is not an ARP probe\n network::arp::update_cache(source_hw, source_prot);\n\n if(operation == 0x1){\n logging::logf(logging::log_level::TRACE, \"arp: Handle Request\\n\");\n\n \/\/ Ask the ethernet layer to craft a packet\n auto packet = network::ethernet::prepare_packet(sizeof(header), source_hw, ethernet::ether_type::ARP);\n\n auto* arp_reply_header = reinterpret_cast<header*>(packet.payload + packet.index);\n\n arp_reply_header->hw_type = switch_endian_16(0x1); \/\/ ethernet\n arp_reply_header->protocol_type = switch_endian_16(0x800); \/\/ IPV4\n arp_reply_header->hw_len = 0x6; \/\/ MAC Address\n arp_reply_header->protocol_len = 0x4; \/\/ IP Address\n arp_reply_header->operation = switch_endian_16(0x2); \/\/ARP Reply\n\n auto& inter = network::interface(0); \/\/TODO Select the interface ?\n auto source_mac = inter.mac_address;\n\n for(size_t i = 0; i < 3; ++i){\n arp_reply_header->target_hw_addr[i] = arp_header->source_hw_addr[i];\n\n arp_reply_header->source_hw_addr[i] = switch_endian_16(uint16_t(source_mac >> ((2 - i) * 16)));\n }\n\n for(size_t i = 0; i < 2; ++i){\n arp_reply_header->source_protocol_addr[i] = arp_header->target_protocol_addr[i];\n arp_reply_header->target_protocol_addr[i] = arp_header->source_protocol_addr[i];\n }\n\n network::ethernet::finalize_packet(packet);\n } else if(operation == 0x2){\n logging::logf(logging::log_level::TRACE, \"arp: Handle Reply\\n\");\n\n \/\/TODO\n }\n}\n<commit_msg>Only update the cache if not an ARP probe<commit_after>\/\/=======================================================================\n\/\/ Copyright Baptiste Wicht 2013-2016.\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ (See accompanying file LICENSE_1_0.txt or copy at\n\/\/ http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\/\/=======================================================================\n\n#include <vector.hpp>\n#include <string.hpp>\n\n#include \"arp_layer.hpp\"\n#include \"arp_cache.hpp\"\n#include \"ip_layer.hpp\"\n#include \"logging.hpp\"\n#include \"kernel_utils.hpp\"\n#include \"network.hpp\"\n\nnamespace {\n\n\/\/TODO\n\n} \/\/end of anonymous namespace\n\nvoid network::arp::decode(network::ethernet::packet& packet){\n header* arp_header = reinterpret_cast<header*>(packet.payload + packet.index);\n\n logging::logf(logging::log_level::TRACE, \"arp: Start ARP packet handling\\n\");\n\n auto hw_type = switch_endian_16(arp_header->hw_type);\n auto protocol_type = switch_endian_16(arp_header->protocol_type);\n\n \/\/ We only support ethernet hardware frames\n if(hw_type != 0x1){\n logging::logf(logging::log_level::ERROR, \"arp: Unhandled hardware type %h\\n\", size_t(hw_type));\n return;\n }\n\n \/\/ We only support IPV4 protocol\n if(protocol_type != 0x800){\n logging::logf(logging::log_level::ERROR, \"arp: Unhandled protocol type %h\\n\", size_t(protocol_type));\n return;\n }\n\n auto hw_len = arp_header->hw_len;\n auto protocol_len = arp_header->protocol_len;\n auto operation = switch_endian_16(arp_header->operation);\n\n \/\/ This should never happen\n if(hw_len != 0x6 || protocol_len != 0x4){\n logging::logf(logging::log_level::ERROR, \"arp: Unable to process the given length hw:%h prot:%h\\n\", size_t(hw_len), size_t(protocol_len));\n return;\n }\n\n if (operation != 0x1 && operation != 0x2) {\n logging::logf(logging::log_level::TRACE, \"arp: Unhandled operation %h\\n\", size_t(operation));\n return;\n }\n\n size_t source_hw = 0;\n size_t target_hw = 0;\n\n for(size_t i = 0; i < 3; ++i){\n source_hw |= uint64_t(switch_endian_16(arp_header->source_hw_addr[i])) << ((2 - i) * 16);\n target_hw |= uint64_t(switch_endian_16(arp_header->target_hw_addr[i])) << ((2 - i) * 16);\n }\n\n logging::logf(logging::log_level::TRACE, \"arp: Source HW Address %h \\n\", source_hw);\n logging::logf(logging::log_level::TRACE, \"arp: Target HW Address %h \\n\", target_hw);\n\n network::ip::address source_prot;\n network::ip::address target_prot;\n\n for(size_t i = 0; i < 2; ++i){\n auto source = switch_endian_16(arp_header->source_protocol_addr[i]);\n auto target = switch_endian_16(arp_header->target_protocol_addr[i]);\n\n source_prot.set_sub(2*i, source >> 8);\n source_prot.set_sub(2*i+1, source);\n\n target_prot.set_sub(2*i, target >> 8);\n target_prot.set_sub(2*i+1, target);\n }\n\n logging::logf(logging::log_level::TRACE, \"arp: Source Protocol Address %u.%u.%u.%u \\n\",\n uint64_t(source_prot(0)), uint64_t(source_prot(1)), uint64_t(source_prot(2)), uint64_t(source_prot(3)));\n logging::logf(logging::log_level::TRACE, \"arp: Target Protocol Address %u.%u.%u.%u \\n\",\n uint64_t(target_prot(0)), uint64_t(target_prot(1)), uint64_t(target_prot(2)), uint64_t(target_prot(3)));\n\n \/\/ If not an ARP Probe, update the ARP cache\n if(source_prot.raw_address == 0x0){\n network::arp::update_cache(source_hw, source_prot);\n }\n\n if(operation == 0x1){\n logging::logf(logging::log_level::TRACE, \"arp: Handle Request\\n\");\n\n \/\/ Ask the ethernet layer to craft a packet\n auto packet = network::ethernet::prepare_packet(sizeof(header), source_hw, ethernet::ether_type::ARP);\n\n auto* arp_reply_header = reinterpret_cast<header*>(packet.payload + packet.index);\n\n arp_reply_header->hw_type = switch_endian_16(0x1); \/\/ ethernet\n arp_reply_header->protocol_type = switch_endian_16(0x800); \/\/ IPV4\n arp_reply_header->hw_len = 0x6; \/\/ MAC Address\n arp_reply_header->protocol_len = 0x4; \/\/ IP Address\n arp_reply_header->operation = switch_endian_16(0x2); \/\/ARP Reply\n\n auto& inter = network::interface(0); \/\/TODO Select the interface ?\n auto source_mac = inter.mac_address;\n\n for(size_t i = 0; i < 3; ++i){\n arp_reply_header->target_hw_addr[i] = arp_header->source_hw_addr[i];\n\n arp_reply_header->source_hw_addr[i] = switch_endian_16(uint16_t(source_mac >> ((2 - i) * 16)));\n }\n\n for(size_t i = 0; i < 2; ++i){\n arp_reply_header->source_protocol_addr[i] = arp_header->target_protocol_addr[i];\n arp_reply_header->target_protocol_addr[i] = arp_header->source_protocol_addr[i];\n }\n\n network::ethernet::finalize_packet(packet);\n } else if(operation == 0x2){\n logging::logf(logging::log_level::TRACE, \"arp: Handle Reply\\n\");\n\n \/\/TODO\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ script templates example\n\/\/\n\/\/ templates.cpp\n\/\/\n\/\/ Copyright (c) 2012-2016 Eric Lombrozo\n\/\/\n\/\/ All Rights Reserved.\n\n#include <CoinQ\/CoinQ_script.h>\n#include <CoinQ\/scriptnum.h>\n#include <CoinCore\/Base58Check.h>\n#include <CoinCore\/hash.h>\n\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n\nusing namespace Coin;\nusing namespace CoinQ::Script;\nusing namespace std;\n\nconst unsigned char ADDRESS_VERSIONS[] = {30, 50};\n\nstring help(char* appName)\n{\n stringstream ss;\n ss << \"# Usage: \" << appName << \" <type> [params]\" << endl\n << \"# p2pk <pubkey>\" << endl\n << \"# p2pkh <pubkey>\" << endl\n << \"# mofn <m> <pubkey1> [pubkey2] ...\" << endl\n << \"# cltv <master pubkey> <timelock pubkey> <locktime>\" << endl\n << \"# witness <redeemscript>\";\n return ss.str();\n}\n\nint main(int argc, char* argv[])\n{\n if (argc < 2)\n {\n cerr << help(argv[0]) << endl;\n return -1;\n }\n\n try\n {\n string type(argv[1]);\n if (type == \"p2pk\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector pubkey(argv[2]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n uchar_vector outPattern;\n outPattern << OP_PUBKEY << 0 << OP_CHECKSIG;\n ScriptTemplate outTemplate(outPattern);\n\n uchar_vector inPattern;\n inPattern << OP_0;\n ScriptTemplate inTemplate(inPattern);\n\n cout << \"txoutscript: \" << outTemplate.script(pubkey).getHex() << endl;\n cout << \"txinscript: \" << inTemplate.script(pubkey).getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(pubkey), ADDRESS_VERSIONS[0]) << endl;\n }\n else if (type == \"p2pkh\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector pubkey(argv[2]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n uchar_vector outPattern;\n outPattern << OP_DUP << OP_HASH160 << OP_PUBKEYHASH << 0 << OP_EQUALVERIFY << OP_CHECKSIG;\n ScriptTemplate outTemplate(outPattern);\n\n uchar_vector inPattern;\n inPattern << OP_0 << OP_PUBKEY << 0;\n ScriptTemplate inTemplate(inPattern);\n\n cout << \"txoutscript: \" << outTemplate.script(pubkey).getHex() << endl;\n cout << \"txinscript: \" << inTemplate.script(pubkey).getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(pubkey), ADDRESS_VERSIONS[0]) << endl;\n }\n else if (type == \"mofn\")\n {\n if (argc < 4) throw runtime_error(help(argv[0]));\n\n int minsigs = strtol(argv[2], NULL, 0);\n if (minsigs < 1 || minsigs > 15)\n throw runtime_error(\"Invalid minsigs.\");\n\n vector<bytes_t> pubkeys;\n for (int i = 3; i < argc; i++)\n {\n uchar_vector pubkey(argv[i]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n pubkeys.push_back(pubkey);\n }\n if ((int)pubkeys.size() < minsigs || pubkeys.size() > 15)\n throw runtime_error(\"Invalid pubkey count.\");\n\n uchar_vector redeemPattern, emptySigs;\n redeemPattern << (OP_1_OFFSET + minsigs);\n for (size_t i = 0; i < pubkeys.size(); i++)\n {\n redeemPattern << OP_PUBKEY << i;\n emptySigs << OP_0;\n }\n redeemPattern << (OP_1_OFFSET + pubkeys.size()) << OP_CHECKMULTISIG;\n\n SymmetricKeyGroup keyGroup(pubkeys);\n ScriptTemplate redeemTemplate(redeemPattern);\n uchar_vector redeemscript = redeemTemplate.script(keyGroup.pubkeys());\n\n uchar_vector txoutscript;\n txoutscript << OP_HASH160 << pushStackItem(hash160(redeemscript)) << OP_EQUAL;\n\n uchar_vector txinscript;\n txinscript << OP_0 << emptySigs << pushStackItem(redeemscript);\n\n cout << \"redeemscript: \" << redeemscript.getHex() << endl;\n cout << \"txoutscript: \" << txoutscript.getHex() << endl;\n cout << \"txinscript: \" << txinscript.getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(redeemscript), ADDRESS_VERSIONS[1]) << endl;\n }\n else if (type == \"cltv\")\n {\n if (argc != 5) throw runtime_error(help(argv[0]));\n\n uchar_vector master_pubkey(argv[2]);\n if (master_pubkey.size() != 33) throw runtime_error(\"Invalid master pubkey.\");\n\n uchar_vector timelock_pubkey(argv[3]);\n if (timelock_pubkey.size() != 33) throw runtime_error(\"Invalid timelock pubkey.\");\n\n uint32_t locktime = strtoul(argv[4], NULL, 0);\n\n uchar_vector redeemPattern;\n redeemPattern << OP_DUP\n << OP_PUBKEY << 1 << OP_CHECKSIG\n << OP_IF\n << pushStackItem(CScriptNum::serialize(locktime))\n << OP_CHECKLOCKTIMEVERIFY << OP_DROP\n << OP_ELSE\n << OP_PUBKEY << 0 << OP_CHECKSIG\n << OP_ENDIF;\n\n ScriptTemplate redeemTemplate1(redeemPattern);\n ScriptTemplate redeemTemplate2(redeemTemplate1.script(master_pubkey));\n uchar_vector redeemscript = redeemTemplate2.script(timelock_pubkey);\n\n uchar_vector txoutscript;\n txoutscript << OP_HASH160 << pushStackItem(hash160(redeemscript)) << OP_EQUAL;\n\n uchar_vector txinscript;\n txinscript << OP_0 << pushStackItem(redeemscript);\n\n cout << \"redeemscript: \" << redeemscript.getHex() << endl;\n cout << \"txoutscript: \" << txoutscript.getHex() << endl;\n cout << \"txinscript: \" << txinscript.getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(redeemscript), ADDRESS_VERSIONS[1]) << endl;\n\/*\n redeemscript.push_back(OP_DUP);\n redeemscript += opPushData(locked_pubkey.size());\n redeemscript += locked_pubkey;\n redeemscript.push_back(OP_CHECKSIG);\n redeemscript.push_back(OP_IF);\n \/\/ We're using the locked pubkey\n redeemscript += opPushData(serialized_locktime.size());\n redeemscript += serialized_locktime;\n redeemscript.push_back(OP_CHECKLOCKTIMEVERIFY);\n redeemscript.push_back(OP_DROP);\n redeemscript.push_back(OP_ELSE);\n \/\/ We're using the unlocked pubkey\n redeemscript += opPushData(unlocked_pubkey.size());\n redeemscript += unlocked_pubkey;\n redeemscript.push_back(OP_CHECKSIG);\n redeemscript.push_back(OP_ENDIF);\n*\/\n }\n else if (type == \"witness\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector redeemscript(argv[2]);\n WitnessProgram wp(redeemscript);\n cout << \"witnessscript: \" << wp.witnessscript().getHex() << endl;\n cout << \"redeemscript: \" << wp.redeemscript().getHex() << endl;\n cout << \"txoutscript: \" << wp.txoutscript().getHex() << endl;\n cout << \"txinscript: \" << wp.txinscript(). getHex() << endl;\n cout << \"address: \" << wp.address(ADDRESS_VERSIONS) << endl;\n }\n else\n {\n throw runtime_error(help(argv[0]));\n }\n\n }\n catch (const exception& e)\n {\n cerr << e.what() << endl;\n return -2;\n }\n\n return 0;\n}\n<commit_msg>Use multistep ScriptTemplate reduction in example<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ script templates example\n\/\/\n\/\/ templates.cpp\n\/\/\n\/\/ Copyright (c) 2012-2016 Eric Lombrozo\n\/\/\n\/\/ All Rights Reserved.\n\n#include <CoinQ\/CoinQ_script.h>\n#include <CoinQ\/scriptnum.h>\n#include <CoinCore\/Base58Check.h>\n#include <CoinCore\/hash.h>\n\n#include <iostream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n\nusing namespace Coin;\nusing namespace CoinQ::Script;\nusing namespace std;\n\nconst unsigned char ADDRESS_VERSIONS[] = {30, 50};\n\nstring help(char* appName)\n{\n stringstream ss;\n ss << \"# Usage: \" << appName << \" <type> [params]\" << endl\n << \"# p2pk <pubkey>\" << endl\n << \"# p2pkh <pubkey>\" << endl\n << \"# mofn <m> <pubkey1> [pubkey2] ...\" << endl\n << \"# cltv <master pubkey> <timelock pubkey> <locktime>\" << endl\n << \"# witness <redeemscript>\";\n return ss.str();\n}\n\nint main(int argc, char* argv[])\n{\n if (argc < 2)\n {\n cerr << help(argv[0]) << endl;\n return -1;\n }\n\n try\n {\n string type(argv[1]);\n if (type == \"p2pk\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector pubkey(argv[2]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n uchar_vector outPattern;\n outPattern << OP_PUBKEY << 0 << OP_CHECKSIG;\n ScriptTemplate outTemplate(outPattern);\n\n uchar_vector inPattern;\n inPattern << OP_0;\n ScriptTemplate inTemplate(inPattern);\n\n cout << \"txoutscript: \" << outTemplate.script(pubkey).getHex() << endl;\n cout << \"txinscript: \" << inTemplate.script(pubkey).getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(pubkey), ADDRESS_VERSIONS[0]) << endl;\n }\n else if (type == \"p2pkh\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector pubkey(argv[2]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n uchar_vector outPattern;\n outPattern << OP_DUP << OP_HASH160 << OP_PUBKEYHASH << 0 << OP_EQUALVERIFY << OP_CHECKSIG;\n ScriptTemplate outTemplate(outPattern);\n\n uchar_vector inPattern;\n inPattern << OP_0 << OP_PUBKEY << 0;\n ScriptTemplate inTemplate(inPattern);\n\n cout << \"txoutscript: \" << outTemplate.script(pubkey).getHex() << endl;\n cout << \"txinscript: \" << inTemplate.script(pubkey).getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(pubkey), ADDRESS_VERSIONS[0]) << endl;\n }\n else if (type == \"mofn\")\n {\n if (argc < 4) throw runtime_error(help(argv[0]));\n\n int minsigs = strtol(argv[2], NULL, 0);\n if (minsigs < 1 || minsigs > 15)\n throw runtime_error(\"Invalid minsigs.\");\n\n vector<bytes_t> pubkeys;\n for (int i = 3; i < argc; i++)\n {\n uchar_vector pubkey(argv[i]);\n if (pubkey.size() != 33) throw runtime_error(\"Invalid pubkey length.\");\n\n pubkeys.push_back(pubkey);\n }\n if ((int)pubkeys.size() < minsigs || pubkeys.size() > 15)\n throw runtime_error(\"Invalid pubkey count.\");\n\n uchar_vector redeemPattern, emptySigs;\n redeemPattern << (OP_1_OFFSET + minsigs);\n for (size_t i = 0; i < pubkeys.size(); i++)\n {\n redeemPattern << OP_PUBKEY << i;\n emptySigs << OP_0;\n }\n redeemPattern << (OP_1_OFFSET + pubkeys.size()) << OP_CHECKMULTISIG;\n\n SymmetricKeyGroup keyGroup(pubkeys);\n ScriptTemplate redeemTemplate(redeemPattern);\n uchar_vector redeemscript = redeemTemplate.script(keyGroup.pubkeys());\n\n uchar_vector txoutscript;\n txoutscript << OP_HASH160 << pushStackItem(hash160(redeemscript)) << OP_EQUAL;\n\n uchar_vector txinscript;\n txinscript << OP_0 << emptySigs << pushStackItem(redeemscript);\n\n cout << \"redeemscript: \" << redeemscript.getHex() << endl;\n cout << \"txoutscript: \" << txoutscript.getHex() << endl;\n cout << \"txinscript: \" << txinscript.getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(redeemscript), ADDRESS_VERSIONS[1]) << endl;\n }\n else if (type == \"cltv\")\n {\n if (argc != 5) throw runtime_error(help(argv[0]));\n\n uchar_vector master_pubkey(argv[2]);\n if (master_pubkey.size() != 33) throw runtime_error(\"Invalid master pubkey.\");\n\n uchar_vector timelock_pubkey(argv[3]);\n if (timelock_pubkey.size() != 33) throw runtime_error(\"Invalid timelock pubkey.\");\n\n uint32_t locktime = strtoul(argv[4], NULL, 0);\n\n uchar_vector redeemPattern;\n redeemPattern << OP_DUP\n << OP_PUBKEY << 1 << OP_CHECKSIG\n << OP_IF\n << pushStackItem(CScriptNum::serialize(locktime))\n << OP_CHECKLOCKTIMEVERIFY << OP_DROP\n << OP_ELSE\n << OP_PUBKEY << 0 << OP_CHECKSIG\n << OP_ENDIF;\n\n ScriptTemplate redeemTemplate(redeemPattern);\n redeemTemplate.reduce(master_pubkey);\n redeemTemplate.reduce(timelock_pubkey);\n uchar_vector redeemscript = redeemTemplate.script();\n\n uchar_vector txoutscript;\n txoutscript << OP_HASH160 << pushStackItem(hash160(redeemscript)) << OP_EQUAL;\n\n uchar_vector txinscript;\n txinscript << OP_0 << pushStackItem(redeemscript);\n\n cout << \"redeemscript: \" << redeemscript.getHex() << endl;\n cout << \"txoutscript: \" << txoutscript.getHex() << endl;\n cout << \"txinscript: \" << txinscript.getHex() << endl;\n cout << \"address: \" << toBase58Check(hash160(redeemscript), ADDRESS_VERSIONS[1]) << endl;\n }\n else if (type == \"witness\")\n {\n if (argc != 3) throw runtime_error(help(argv[0]));\n\n uchar_vector redeemscript(argv[2]);\n WitnessProgram wp(redeemscript);\n cout << \"witnessscript: \" << wp.witnessscript().getHex() << endl;\n cout << \"redeemscript: \" << wp.redeemscript().getHex() << endl;\n cout << \"txoutscript: \" << wp.txoutscript().getHex() << endl;\n cout << \"txinscript: \" << wp.txinscript(). getHex() << endl;\n cout << \"address: \" << wp.address(ADDRESS_VERSIONS) << endl;\n }\n else\n {\n throw runtime_error(help(argv[0]));\n }\n\n }\n catch (const exception& e)\n {\n cerr << e.what() << endl;\n return -2;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: jvmfwk.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2005-01-18 16:20:47 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include \"cppuhelper\/implbase3.hxx\"\n#include \"cppuhelper\/implementationentry.hxx\"\n#include \"rtl\/ustrbuf.hxx\"\n#include \"rtl\/ustring.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/types.h\"\n#include \"boost\/scoped_array.hpp\"\n#include \"com\/sun\/star\/lang\/XServiceInfo.hpp\"\n#include \"com\/sun\/star\/lang\/XInitialization.hpp\"\n#include \"com\/sun\/star\/task\/XJob.hpp\"\n\n\nnamespace css = com::sun::star;\n\nnamespace migration\n{\n\n\nrtl::OUString jvmfwk_getImplementationName();\n\ncss::uno::Sequence< rtl::OUString > jvmfwk_getSupportedServiceNames();\n\n\ncss::uno::Reference< css::uno::XInterface > SAL_CALL jvmfwk_create(\n css::uno::Reference< css::uno::XComponentContext > const & )\n throw (css::uno::Exception);\n\n\n} \/\/end blind namespace\n\n<commit_msg>INTEGRATION: CWS ooo19126 (1.3.178); FILE MERGED 2005\/09\/05 17:50:53 rt 1.3.178.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: jvmfwk.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 17:41:49 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include \"cppuhelper\/implbase3.hxx\"\n#include \"cppuhelper\/implementationentry.hxx\"\n#include \"rtl\/ustrbuf.hxx\"\n#include \"rtl\/ustring.h\"\n#include \"rtl\/ustring.hxx\"\n#include \"sal\/types.h\"\n#include \"boost\/scoped_array.hpp\"\n#include \"com\/sun\/star\/lang\/XServiceInfo.hpp\"\n#include \"com\/sun\/star\/lang\/XInitialization.hpp\"\n#include \"com\/sun\/star\/task\/XJob.hpp\"\n\n\nnamespace css = com::sun::star;\n\nnamespace migration\n{\n\n\nrtl::OUString jvmfwk_getImplementationName();\n\ncss::uno::Sequence< rtl::OUString > jvmfwk_getSupportedServiceNames();\n\n\ncss::uno::Reference< css::uno::XInterface > SAL_CALL jvmfwk_create(\n css::uno::Reference< css::uno::XComponentContext > const & )\n throw (css::uno::Exception);\n\n\n} \/\/end blind namespace\n\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n#include \"GrGLInterface.h\"\n\n#include <OpenGL\/gl.h>\n#include <OpenGL\/glext.h>\n\n#include <mach-o\/dyld.h>\n\n\n\/\/ This uses deprecated functions, should rewrite using dlopen, dlsym, dlclose\nvoid* GetProcAddress(const char* name) {\n NSSymbol symbol = NULL;\n if (NSIsSymbolNameDefined(name)) {\n symbol = NSLookupAndBindSymbol(name);\n }\n return NULL == symbol ? NULL : NSAddressOfSymbol(symbol); \n}\n\n#define GET_PROC(name) ((GrGL ## name ## Proc) GetProcAddress(\"_gl\" #name))\n#define GET_PROC_SUFFIX(name, suffix) ((GrGL ## name ## Proc) GetProcAddress(\"_gl\" #name #suffix))\n\nconst GrGLInterface* GrGLCreateNativeInterface() {\n \/\/ The gl functions are not context-specific so we create one global \n \/\/ interface\n static SkAutoTUnref<GrGLInterface> glInterface;\n if (!glInterface.get()) {\n GrGLInterface* interface = new GrGLInterface;\n glInterface.reset(interface);\n const char* verStr = (const char*) glGetString(GL_VERSION);\n GrGLVersion ver = GrGLGetVersionFromString(verStr);\n const char* extStr = (const char*) glGetString(GL_EXTENSIONS);\n \n interface->fBindingsExported = kDesktop_GrGLBinding;\n interface->fActiveTexture = glActiveTexture;\n interface->fAttachShader = glAttachShader;\n interface->fBeginQuery = glBeginQuery;\n interface->fBindAttribLocation = glBindAttribLocation;\n interface->fBindBuffer = glBindBuffer;\n if (ver >= GR_GL_VER(3,0)) {\n #if GL_VERSION_3_0\n interface->fBindFragDataLocation = glBindFragDataLocation;\n #else\n interface->fBindFragDataLocation = GET_PROC(BindFragDataLocation);\n #endif\n }\n interface->fBindTexture = glBindTexture;\n interface->fBlendColor = glBlendColor;\n interface->fBlendFunc = glBlendFunc;\n interface->fBufferData = glBufferData;\n interface->fBufferSubData = glBufferSubData;\n interface->fClear = glClear;\n interface->fClearColor = glClearColor;\n interface->fClearStencil = glClearStencil;\n interface->fColorMask = glColorMask;\n interface->fColorPointer = glColorPointer;\n interface->fCompileShader = glCompileShader;\n interface->fCompressedTexImage2D = glCompressedTexImage2D;\n interface->fCreateProgram = glCreateProgram;\n interface->fCreateShader = glCreateShader;\n interface->fCullFace = glCullFace;\n interface->fDeleteBuffers = glDeleteBuffers;\n interface->fDeleteProgram = glDeleteProgram;\n interface->fDeleteQueries = glDeleteQueries;\n interface->fDeleteShader = glDeleteShader;\n interface->fDeleteTextures = glDeleteTextures;\n interface->fDepthMask = glDepthMask;\n interface->fDisable = glDisable;\n interface->fDisableVertexAttribArray =\n glDisableVertexAttribArray;\n interface->fDrawArrays = glDrawArrays;\n interface->fDrawBuffer = glDrawBuffer;\n interface->fDrawBuffers = glDrawBuffers;\n interface->fDrawElements = glDrawElements;\n interface->fEnable = glEnable;\n interface->fEnableVertexAttribArray = glEnableVertexAttribArray;\n interface->fEndQuery = glEndQuery;\n interface->fFinish = glFinish;\n interface->fFlush = glFlush;\n interface->fFrontFace = glFrontFace;\n interface->fGenBuffers = glGenBuffers;\n interface->fGenQueries = glGenQueries;\n interface->fGetBufferParameteriv = glGetBufferParameteriv;\n interface->fGetError = glGetError;\n interface->fGetIntegerv = glGetIntegerv;\n interface->fGetProgramInfoLog = glGetProgramInfoLog;\n interface->fGetProgramiv = glGetProgramiv;\n interface->fGetQueryiv = glGetQueryiv;\n interface->fGetQueryObjectiv = glGetQueryObjectiv;\n interface->fGetQueryObjectuiv = glGetQueryObjectuiv;\n interface->fGetShaderInfoLog = glGetShaderInfoLog;\n interface->fGetShaderiv = glGetShaderiv;\n interface->fGetString = glGetString;\n interface->fGetTexLevelParameteriv = glGetTexLevelParameteriv;\n interface->fGenTextures = glGenTextures;\n interface->fGetUniformLocation = glGetUniformLocation;\n interface->fLineWidth = glLineWidth;\n interface->fLinkProgram = glLinkProgram;\n interface->fMapBuffer = glMapBuffer;\n interface->fPixelStorei = glPixelStorei;\n interface->fReadBuffer = glReadBuffer;\n interface->fReadPixels = glReadPixels;\n interface->fScissor = glScissor;\n interface->fShaderSource = glShaderSource;\n interface->fStencilFunc = glStencilFunc;\n interface->fStencilFuncSeparate = glStencilFuncSeparate;\n interface->fStencilMask = glStencilMask;\n interface->fStencilMaskSeparate = glStencilMaskSeparate;\n interface->fStencilOp = glStencilOp;\n interface->fStencilOpSeparate = glStencilOpSeparate;\n \/\/ mac uses GLenum for internalFormat param (non-standard)\n \/\/ amounts to int vs. uint.\n interface->fTexImage2D = (GrGLTexImage2DProc)glTexImage2D;\n interface->fTexParameteri = glTexParameteri;\n #if GL_ARB_texture_storage || GL_VERSION_4_2\n interface->fTexStorage2D = glTexStorage2D\n #elif GL_EXT_texture_storage\n interface->fTexStorage2D = glTexStorage2DEXT;\n #else\n if (glVer >= GR_GL_VER(4,2) ||\n GrGLHasExtensionFromString(\"GL_ARB_texture_storage\", extString)) {\n GR_GL_GET_PROC(TexStorage2D);\n } else if (GrGLHasExtensionFromString(\"GL_EXT_texture_storage\", extString)) {\n GR_GL_GET_PROC_SUFFIX(TexStorage2D, EXT);\n }\n #endif\n interface->fTexSubImage2D = glTexSubImage2D;\n interface->fUniform1f = glUniform1f;\n interface->fUniform1i = glUniform1i;\n interface->fUniform1fv = glUniform1fv;\n interface->fUniform1iv = glUniform1iv;\n interface->fUniform2f = glUniform2f;\n interface->fUniform2i = glUniform2i;\n interface->fUniform2fv = glUniform2fv;\n interface->fUniform2iv = glUniform2iv;\n interface->fUniform3f = glUniform3f;\n interface->fUniform3i = glUniform3i;\n interface->fUniform3fv = glUniform3fv;\n interface->fUniform3iv = glUniform3iv;\n interface->fUniform4f = glUniform4f;\n interface->fUniform4i = glUniform4i;\n interface->fUniform4fv = glUniform4fv;\n interface->fUniform4iv = glUniform4iv;\n interface->fUniform4fv = glUniform4fv;\n interface->fUniformMatrix2fv = glUniformMatrix2fv;\n interface->fUniformMatrix3fv = glUniformMatrix3fv;\n interface->fUniformMatrix4fv = glUniformMatrix4fv;\n interface->fUnmapBuffer = glUnmapBuffer;\n interface->fUseProgram = glUseProgram;\n interface->fVertexAttrib4fv = glVertexAttrib4fv;\n interface->fVertexAttribPointer = glVertexAttribPointer;\n interface->fViewport = glViewport;\n\n if (ver >= GR_GL_VER(3,3) || GrGLHasExtensionFromString(\"GL_ARB_timer_query\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function name\n #if GL_ARB_timer_query || GL_VERSION_3_3\n interface->fQueryCounter = glQueryCounter;\n interface->fGetQueryObjecti64v = glGetQueryObjecti64v;\n interface->fGetQueryObjectui64v = glGetQueryObjectui64v;\n #else\n interface->fQueryCounter = GET_PROC(QueryCounter);\n interface->fGetQueryObjecti64v = GET_PROC(GetQueryObjecti64v);\n interface->fGetQueryObjectui64v = GET_PROC(GetQueryObjectui64v);\n #endif\n } else if (GrGLHasExtensionFromString(\"GL_EXT_timer_query\", extStr)) {\n #if GL_EXT_timer_query\n interface->fGetQueryObjecti64v = glGetQueryObjecti64vEXT;\n interface->fGetQueryObjectui64v = glGetQueryObjectui64vEXT;\n #else\n interface->fGetQueryObjecti64v = GET_PROC_SUFFIX(GetQueryObjecti64v, EXT);\n interface->fGetQueryObjectui64v = GET_PROC_SUFFIX(GetQueryObjectui64v, EXT);\n #endif \n }\n \n if (ver >= GR_GL_VER(3,0) || GrGLHasExtensionFromString(\"GL_ARB_framebuffer_object\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function names\n #if GL_VERSION_3_0 || GL_ARB_framebuffer_object\n interface->fGenFramebuffers = glGenFramebuffers;\n interface->fGetFramebufferAttachmentParameteriv = glGetFramebufferAttachmentParameteriv;\n interface->fGetRenderbufferParameteriv = glGetRenderbufferParameteriv;\n interface->fBindFramebuffer = glBindFramebuffer;\n interface->fFramebufferTexture2D = glFramebufferTexture2D;\n interface->fCheckFramebufferStatus = glCheckFramebufferStatus;\n interface->fDeleteFramebuffers = glDeleteFramebuffers;\n interface->fRenderbufferStorage = glRenderbufferStorage;\n interface->fGenRenderbuffers = glGenRenderbuffers;\n interface->fDeleteRenderbuffers = glDeleteRenderbuffers;\n interface->fFramebufferRenderbuffer = glFramebufferRenderbuffer;\n interface->fBindRenderbuffer = glBindRenderbuffer;\n interface->fRenderbufferStorageMultisample = glRenderbufferStorageMultisample;\n interface->fBlitFramebuffer = glBlitFramebuffer;\n #else\n interface->fGenFramebuffers = GET_PROC(GenFramebuffers);\n interface->fGetFramebufferAttachmentParameteriv = GET_PROC(GetFramebufferAttachmentParameteriv);\n interface->fGetRenderbufferParameteriv = GET_PROC(GetRenderbufferParameteriv);\n interface->fBindFramebuffer = GET_PROC(BindFramebuffer);\n interface->fFramebufferTexture2D = GET_PROC(FramebufferTexture2D);\n interface->fCheckFramebufferStatus = GET_PROC(CheckFramebufferStatus);\n interface->fDeleteFramebuffers = GET_PROC(DeleteFramebuffers);\n interface->fRenderbufferStorage = GET_PROC(RenderbufferStorage);\n interface->fGenRenderbuffers = GET_PROC(GenRenderbuffers);\n interface->fDeleteRenderbuffers = GET_PROC(DeleteRenderbuffers);\n interface->fFramebufferRenderbuffer = GET_PROC(FramebufferRenderbuffer);\n interface->fBindRenderbuffer = GET_PROC(BindRenderbuffer);\n interface->fRenderbufferStorageMultisample = GET_PROC(RenderbufferStorageMultisample);\n interface->fBlitFramebuffer = GET_PROC(BlitFramebuffer);\n #endif\n } else {\n if (GrGLHasExtensionFromString(\"GL_EXT_framebuffer_object\", extStr)) {\n #if GL_EXT_framebuffer_object\n interface->fGenFramebuffers = glGenFramebuffersEXT;\n interface->fGetFramebufferAttachmentParameteriv = glGetFramebufferAttachmentParameterivEXT;\n interface->fGetRenderbufferParameteriv = glGetRenderbufferParameterivEXT;\n interface->fBindFramebuffer = glBindFramebufferEXT;\n interface->fFramebufferTexture2D = glFramebufferTexture2DEXT;\n interface->fCheckFramebufferStatus = glCheckFramebufferStatusEXT;\n interface->fDeleteFramebuffers = glDeleteFramebuffersEXT;\n interface->fRenderbufferStorage = glRenderbufferStorageEXT;\n interface->fGenRenderbuffers = glGenRenderbuffersEXT;\n interface->fDeleteRenderbuffers = glDeleteRenderbuffersEXT;\n interface->fFramebufferRenderbuffer = glFramebufferRenderbufferEXT;\n interface->fBindRenderbuffer = glBindRenderbufferEXT;\n #else\n interface->fGenFramebuffers = GET_PROC_SUFFIX(GenFramebuffers, EXT);\n interface->fGetFramebufferAttachmentParameteriv = GET_PROC_SUFFIX(GetFramebufferAttachmentParameteriv, EXT);\n interface->fGetRenderbufferParameteriv = GET_PROC_SUFFIX(GetRenderbufferParameteriv, EXT);\n interface->fBindFramebuffer = GET_PROC_SUFFIX(BindFramebuffer, EXT);\n interface->fFramebufferTexture2D = GET_PROC_SUFFIX(FramebufferTexture2D, EXT);\n interface->fCheckFramebufferStatus = GET_PROC_SUFFIX(CheckFramebufferStatus, EXT);\n interface->fDeleteFramebuffers = GET_PROC_SUFFIX(DeleteFramebuffers, EXT);\n interface->fRenderbufferStorage = GET_PROC_SUFFIX(RenderbufferStorage, EXT);\n interface->fGenRenderbuffers = GET_PROC_SUFFIX(GenRenderbuffers, EXT);\n interface->fDeleteRenderbuffers = GET_PROC_SUFFIX(DeleteRenderbuffers, EXT);\n interface->fFramebufferRenderbuffer = GET_PROC_SUFFIX(FramebufferRenderbuffer, EXT);\n interface->fBindRenderbuffer = GET_PROC_SUFFIX(BindRenderbuffer, EXT);\n #endif\n }\n if (GrGLHasExtensionFromString(\"GL_EXT_framebuffer_multisample\", extStr)) {\n #if GL_EXT_framebuffer_multisample\n interface->fRenderbufferStorageMultisample = glRenderbufferStorageMultisampleEXT;\n #else\n interface->fRenderbufferStorageMultisample = GET_PROC_SUFFIX(RenderbufferStorageMultisample, EXT);\n #endif\n }\n if (GrGLHasExtensionFromString(\"\", extStr)) {\n #if GL_EXT_framebuffer_blit\n interface->fBlitFramebuffer = glBlitFramebufferEXT;\n #else\n interface->fBlitFramebuffer = GET_PROC_SUFFIX(BlitFramebuffer, EXT);\n #endif\n }\n }\n if (ver >= GR_GL_VER(3,3) || GrGLHasExtensionFromString(\"GL_ARB_blend_func_extended\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function name\n #if GL_VERSION_3_3 || GL_ARB_blend_func_extended\n interface->fBindFragDataLocationIndexed = glBindFragDataLocationIndexed;\n #else\n interface->fBindFragDataLocationIndexed = GET_PROC(BindFragDataLocationIndexed);\n #endif\n }\n\n interface->fBindingsExported = kDesktop_GrGLBinding;\n }\n glInterface.get()->ref();\n return glInterface.get();\n}\n<commit_msg>Fix Mac build<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n\n#include \"GrGLInterface.h\"\n\n#include <OpenGL\/gl.h>\n#include <OpenGL\/glext.h>\n\n#include <mach-o\/dyld.h>\n\n\n\/\/ This uses deprecated functions, should rewrite using dlopen, dlsym, dlclose\nvoid* GetProcAddress(const char* name) {\n NSSymbol symbol = NULL;\n if (NSIsSymbolNameDefined(name)) {\n symbol = NSLookupAndBindSymbol(name);\n }\n return NULL == symbol ? NULL : NSAddressOfSymbol(symbol); \n}\n\n#define GET_PROC(name) ((GrGL ## name ## Proc) GetProcAddress(\"_gl\" #name))\n#define GET_PROC_SUFFIX(name, suffix) ((GrGL ## name ## Proc) GetProcAddress(\"_gl\" #name #suffix))\n\nconst GrGLInterface* GrGLCreateNativeInterface() {\n \/\/ The gl functions are not context-specific so we create one global \n \/\/ interface\n static SkAutoTUnref<GrGLInterface> glInterface;\n if (!glInterface.get()) {\n GrGLInterface* interface = new GrGLInterface;\n glInterface.reset(interface);\n const char* verStr = (const char*) glGetString(GL_VERSION);\n GrGLVersion ver = GrGLGetVersionFromString(verStr);\n const char* extStr = (const char*) glGetString(GL_EXTENSIONS);\n \n interface->fBindingsExported = kDesktop_GrGLBinding;\n interface->fActiveTexture = glActiveTexture;\n interface->fAttachShader = glAttachShader;\n interface->fBeginQuery = glBeginQuery;\n interface->fBindAttribLocation = glBindAttribLocation;\n interface->fBindBuffer = glBindBuffer;\n if (ver >= GR_GL_VER(3,0)) {\n #if GL_VERSION_3_0\n interface->fBindFragDataLocation = glBindFragDataLocation;\n #else\n interface->fBindFragDataLocation = GET_PROC(BindFragDataLocation);\n #endif\n }\n interface->fBindTexture = glBindTexture;\n interface->fBlendColor = glBlendColor;\n interface->fBlendFunc = glBlendFunc;\n interface->fBufferData = glBufferData;\n interface->fBufferSubData = glBufferSubData;\n interface->fClear = glClear;\n interface->fClearColor = glClearColor;\n interface->fClearStencil = glClearStencil;\n interface->fColorMask = glColorMask;\n interface->fColorPointer = glColorPointer;\n interface->fCompileShader = glCompileShader;\n interface->fCompressedTexImage2D = glCompressedTexImage2D;\n interface->fCreateProgram = glCreateProgram;\n interface->fCreateShader = glCreateShader;\n interface->fCullFace = glCullFace;\n interface->fDeleteBuffers = glDeleteBuffers;\n interface->fDeleteProgram = glDeleteProgram;\n interface->fDeleteQueries = glDeleteQueries;\n interface->fDeleteShader = glDeleteShader;\n interface->fDeleteTextures = glDeleteTextures;\n interface->fDepthMask = glDepthMask;\n interface->fDisable = glDisable;\n interface->fDisableVertexAttribArray =\n glDisableVertexAttribArray;\n interface->fDrawArrays = glDrawArrays;\n interface->fDrawBuffer = glDrawBuffer;\n interface->fDrawBuffers = glDrawBuffers;\n interface->fDrawElements = glDrawElements;\n interface->fEnable = glEnable;\n interface->fEnableVertexAttribArray = glEnableVertexAttribArray;\n interface->fEndQuery = glEndQuery;\n interface->fFinish = glFinish;\n interface->fFlush = glFlush;\n interface->fFrontFace = glFrontFace;\n interface->fGenBuffers = glGenBuffers;\n interface->fGenQueries = glGenQueries;\n interface->fGetBufferParameteriv = glGetBufferParameteriv;\n interface->fGetError = glGetError;\n interface->fGetIntegerv = glGetIntegerv;\n interface->fGetProgramInfoLog = glGetProgramInfoLog;\n interface->fGetProgramiv = glGetProgramiv;\n interface->fGetQueryiv = glGetQueryiv;\n interface->fGetQueryObjectiv = glGetQueryObjectiv;\n interface->fGetQueryObjectuiv = glGetQueryObjectuiv;\n interface->fGetShaderInfoLog = glGetShaderInfoLog;\n interface->fGetShaderiv = glGetShaderiv;\n interface->fGetString = glGetString;\n interface->fGetTexLevelParameteriv = glGetTexLevelParameteriv;\n interface->fGenTextures = glGenTextures;\n interface->fGetUniformLocation = glGetUniformLocation;\n interface->fLineWidth = glLineWidth;\n interface->fLinkProgram = glLinkProgram;\n interface->fMapBuffer = glMapBuffer;\n interface->fPixelStorei = glPixelStorei;\n interface->fReadBuffer = glReadBuffer;\n interface->fReadPixels = glReadPixels;\n interface->fScissor = glScissor;\n interface->fShaderSource = glShaderSource;\n interface->fStencilFunc = glStencilFunc;\n interface->fStencilFuncSeparate = glStencilFuncSeparate;\n interface->fStencilMask = glStencilMask;\n interface->fStencilMaskSeparate = glStencilMaskSeparate;\n interface->fStencilOp = glStencilOp;\n interface->fStencilOpSeparate = glStencilOpSeparate;\n \/\/ mac uses GLenum for internalFormat param (non-standard)\n \/\/ amounts to int vs. uint.\n interface->fTexImage2D = (GrGLTexImage2DProc)glTexImage2D;\n interface->fTexParameteri = glTexParameteri;\n #if GL_ARB_texture_storage || GL_VERSION_4_2\n interface->fTexStorage2D = glTexStorage2D\n #elif GL_EXT_texture_storage\n interface->fTexStorage2D = glTexStorage2DEXT;\n #else\n if (ver >= GR_GL_VER(4,2) ||\n GrGLHasExtensionFromString(\"GL_ARB_texture_storage\", extStr)) {\n GET_PROC(TexStorage2D);\n } else if (GrGLHasExtensionFromString(\"GL_EXT_texture_storage\", extStr)) {\n GET_PROC_SUFFIX(TexStorage2D, EXT);\n }\n #endif\n interface->fTexSubImage2D = glTexSubImage2D;\n interface->fUniform1f = glUniform1f;\n interface->fUniform1i = glUniform1i;\n interface->fUniform1fv = glUniform1fv;\n interface->fUniform1iv = glUniform1iv;\n interface->fUniform2f = glUniform2f;\n interface->fUniform2i = glUniform2i;\n interface->fUniform2fv = glUniform2fv;\n interface->fUniform2iv = glUniform2iv;\n interface->fUniform3f = glUniform3f;\n interface->fUniform3i = glUniform3i;\n interface->fUniform3fv = glUniform3fv;\n interface->fUniform3iv = glUniform3iv;\n interface->fUniform4f = glUniform4f;\n interface->fUniform4i = glUniform4i;\n interface->fUniform4fv = glUniform4fv;\n interface->fUniform4iv = glUniform4iv;\n interface->fUniform4fv = glUniform4fv;\n interface->fUniformMatrix2fv = glUniformMatrix2fv;\n interface->fUniformMatrix3fv = glUniformMatrix3fv;\n interface->fUniformMatrix4fv = glUniformMatrix4fv;\n interface->fUnmapBuffer = glUnmapBuffer;\n interface->fUseProgram = glUseProgram;\n interface->fVertexAttrib4fv = glVertexAttrib4fv;\n interface->fVertexAttribPointer = glVertexAttribPointer;\n interface->fViewport = glViewport;\n\n if (ver >= GR_GL_VER(3,3) || GrGLHasExtensionFromString(\"GL_ARB_timer_query\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function name\n #if GL_ARB_timer_query || GL_VERSION_3_3\n interface->fQueryCounter = glQueryCounter;\n interface->fGetQueryObjecti64v = glGetQueryObjecti64v;\n interface->fGetQueryObjectui64v = glGetQueryObjectui64v;\n #else\n interface->fQueryCounter = GET_PROC(QueryCounter);\n interface->fGetQueryObjecti64v = GET_PROC(GetQueryObjecti64v);\n interface->fGetQueryObjectui64v = GET_PROC(GetQueryObjectui64v);\n #endif\n } else if (GrGLHasExtensionFromString(\"GL_EXT_timer_query\", extStr)) {\n #if GL_EXT_timer_query\n interface->fGetQueryObjecti64v = glGetQueryObjecti64vEXT;\n interface->fGetQueryObjectui64v = glGetQueryObjectui64vEXT;\n #else\n interface->fGetQueryObjecti64v = GET_PROC_SUFFIX(GetQueryObjecti64v, EXT);\n interface->fGetQueryObjectui64v = GET_PROC_SUFFIX(GetQueryObjectui64v, EXT);\n #endif \n }\n \n if (ver >= GR_GL_VER(3,0) || GrGLHasExtensionFromString(\"GL_ARB_framebuffer_object\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function names\n #if GL_VERSION_3_0 || GL_ARB_framebuffer_object\n interface->fGenFramebuffers = glGenFramebuffers;\n interface->fGetFramebufferAttachmentParameteriv = glGetFramebufferAttachmentParameteriv;\n interface->fGetRenderbufferParameteriv = glGetRenderbufferParameteriv;\n interface->fBindFramebuffer = glBindFramebuffer;\n interface->fFramebufferTexture2D = glFramebufferTexture2D;\n interface->fCheckFramebufferStatus = glCheckFramebufferStatus;\n interface->fDeleteFramebuffers = glDeleteFramebuffers;\n interface->fRenderbufferStorage = glRenderbufferStorage;\n interface->fGenRenderbuffers = glGenRenderbuffers;\n interface->fDeleteRenderbuffers = glDeleteRenderbuffers;\n interface->fFramebufferRenderbuffer = glFramebufferRenderbuffer;\n interface->fBindRenderbuffer = glBindRenderbuffer;\n interface->fRenderbufferStorageMultisample = glRenderbufferStorageMultisample;\n interface->fBlitFramebuffer = glBlitFramebuffer;\n #else\n interface->fGenFramebuffers = GET_PROC(GenFramebuffers);\n interface->fGetFramebufferAttachmentParameteriv = GET_PROC(GetFramebufferAttachmentParameteriv);\n interface->fGetRenderbufferParameteriv = GET_PROC(GetRenderbufferParameteriv);\n interface->fBindFramebuffer = GET_PROC(BindFramebuffer);\n interface->fFramebufferTexture2D = GET_PROC(FramebufferTexture2D);\n interface->fCheckFramebufferStatus = GET_PROC(CheckFramebufferStatus);\n interface->fDeleteFramebuffers = GET_PROC(DeleteFramebuffers);\n interface->fRenderbufferStorage = GET_PROC(RenderbufferStorage);\n interface->fGenRenderbuffers = GET_PROC(GenRenderbuffers);\n interface->fDeleteRenderbuffers = GET_PROC(DeleteRenderbuffers);\n interface->fFramebufferRenderbuffer = GET_PROC(FramebufferRenderbuffer);\n interface->fBindRenderbuffer = GET_PROC(BindRenderbuffer);\n interface->fRenderbufferStorageMultisample = GET_PROC(RenderbufferStorageMultisample);\n interface->fBlitFramebuffer = GET_PROC(BlitFramebuffer);\n #endif\n } else {\n if (GrGLHasExtensionFromString(\"GL_EXT_framebuffer_object\", extStr)) {\n #if GL_EXT_framebuffer_object\n interface->fGenFramebuffers = glGenFramebuffersEXT;\n interface->fGetFramebufferAttachmentParameteriv = glGetFramebufferAttachmentParameterivEXT;\n interface->fGetRenderbufferParameteriv = glGetRenderbufferParameterivEXT;\n interface->fBindFramebuffer = glBindFramebufferEXT;\n interface->fFramebufferTexture2D = glFramebufferTexture2DEXT;\n interface->fCheckFramebufferStatus = glCheckFramebufferStatusEXT;\n interface->fDeleteFramebuffers = glDeleteFramebuffersEXT;\n interface->fRenderbufferStorage = glRenderbufferStorageEXT;\n interface->fGenRenderbuffers = glGenRenderbuffersEXT;\n interface->fDeleteRenderbuffers = glDeleteRenderbuffersEXT;\n interface->fFramebufferRenderbuffer = glFramebufferRenderbufferEXT;\n interface->fBindRenderbuffer = glBindRenderbufferEXT;\n #else\n interface->fGenFramebuffers = GET_PROC_SUFFIX(GenFramebuffers, EXT);\n interface->fGetFramebufferAttachmentParameteriv = GET_PROC_SUFFIX(GetFramebufferAttachmentParameteriv, EXT);\n interface->fGetRenderbufferParameteriv = GET_PROC_SUFFIX(GetRenderbufferParameteriv, EXT);\n interface->fBindFramebuffer = GET_PROC_SUFFIX(BindFramebuffer, EXT);\n interface->fFramebufferTexture2D = GET_PROC_SUFFIX(FramebufferTexture2D, EXT);\n interface->fCheckFramebufferStatus = GET_PROC_SUFFIX(CheckFramebufferStatus, EXT);\n interface->fDeleteFramebuffers = GET_PROC_SUFFIX(DeleteFramebuffers, EXT);\n interface->fRenderbufferStorage = GET_PROC_SUFFIX(RenderbufferStorage, EXT);\n interface->fGenRenderbuffers = GET_PROC_SUFFIX(GenRenderbuffers, EXT);\n interface->fDeleteRenderbuffers = GET_PROC_SUFFIX(DeleteRenderbuffers, EXT);\n interface->fFramebufferRenderbuffer = GET_PROC_SUFFIX(FramebufferRenderbuffer, EXT);\n interface->fBindRenderbuffer = GET_PROC_SUFFIX(BindRenderbuffer, EXT);\n #endif\n }\n if (GrGLHasExtensionFromString(\"GL_EXT_framebuffer_multisample\", extStr)) {\n #if GL_EXT_framebuffer_multisample\n interface->fRenderbufferStorageMultisample = glRenderbufferStorageMultisampleEXT;\n #else\n interface->fRenderbufferStorageMultisample = GET_PROC_SUFFIX(RenderbufferStorageMultisample, EXT);\n #endif\n }\n if (GrGLHasExtensionFromString(\"\", extStr)) {\n #if GL_EXT_framebuffer_blit\n interface->fBlitFramebuffer = glBlitFramebufferEXT;\n #else\n interface->fBlitFramebuffer = GET_PROC_SUFFIX(BlitFramebuffer, EXT);\n #endif\n }\n }\n if (ver >= GR_GL_VER(3,3) || GrGLHasExtensionFromString(\"GL_ARB_blend_func_extended\", extStr)) {\n \/\/ ARB extension doesn't use the ARB suffix on the function name\n #if GL_VERSION_3_3 || GL_ARB_blend_func_extended\n interface->fBindFragDataLocationIndexed = glBindFragDataLocationIndexed;\n #else\n interface->fBindFragDataLocationIndexed = GET_PROC(BindFragDataLocationIndexed);\n #endif\n }\n\n interface->fBindingsExported = kDesktop_GrGLBinding;\n }\n glInterface.get()->ref();\n return glInterface.get();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2008-2009 NVIDIA Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\n#include <cusp\/array1d.h>\n#include <cusp\/blas.h>\n#include <cusp\/multiply.h>\n#include <cusp\/monitor.h>\n#include <cusp\/linear_operator.h>\n\nnamespace blas = cusp::blas;\n\nnamespace cusp\n{\nnamespace krylov\n{\n\ntemplate <class LinearOperator,\n class Vector>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b)\n{\n typedef typename LinearOperator::value_type ValueType;\n\n cusp::default_monitor<ValueType> monitor(b);\n\n cusp::krylov::cg(A, x, b, monitor);\n}\n\ntemplate <class LinearOperator,\n class Vector,\n class Monitor>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b,\n Monitor& monitor)\n{\n typedef typename LinearOperator::value_type ValueType;\n typedef typename LinearOperator::memory_space MemorySpace;\n\n cusp::identity_operator<ValueType,MemorySpace> M(A.num_rows, A.num_cols);\n\n cusp::krylov::cg(A, x, b, monitor, M);\n}\n\ntemplate <class LinearOperator,\n class Vector,\n class Monitor,\n class Preconditioner>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b,\n Monitor& monitor,\n Preconditioner& M)\n{\n typedef typename LinearOperator::value_type ValueType;\n typedef typename LinearOperator::memory_space MemorySpace;\n\n assert(A.num_rows == A.num_cols); \/\/ sanity check\n\n const size_t N = A.num_rows;\n\n \/\/ allocate workspace\n cusp::array1d<ValueType,MemorySpace> y(N);\n cusp::array1d<ValueType,MemorySpace> z(N);\n cusp::array1d<ValueType,MemorySpace> r(N);\n cusp::array1d<ValueType,MemorySpace> p(N);\n \n \/\/ y <- Ax\n cusp::multiply(A, x, y);\n\n \/\/ r <- b - A*x\n blas::axpby(b, y, r, ValueType(1), ValueType(-1));\n \n \/\/ z <- M*r\n cusp::multiply(M, r, z);\n\n \/\/ p <- z\n blas::copy(z, p);\n\t\t\n ValueType r_norm = blas::nrm2(r.begin(), r.end());\n\n \/\/ rz = <r^H, z>\n ValueType rz = blas::dotc(r, z);\n\n while (!monitor.finished(r))\n {\n \/\/ y <- Ap\n cusp::multiply(A, p, y);\n \n \/\/ alpha <- <r,z>\/<y,p>\n ValueType alpha = rz \/ blas::dotc(y, p);\n \/\/ x <- x + alpha * p\n blas::axpy(p, x, alpha);\n \/\/ r <- r - alpha * y\t\t\n blas::axpy(y, r, -alpha);\n \/\/ z <- M*r\n cusp::multiply(M, r, z);\n\t\t\n \/\/\/\/ r2 = <r,r>\n \/\/r_norm = blas::nrm2(r);\n \n ValueType rz_old = rz;\n\n \/\/ rz = <r^H, z>\n rz = blas::dotc(r, z);\n\n \/\/ beta <- <r_{i+1},r_{i+1}>\/<r,r> \n ValueType beta = rz \/ rz_old;\n\t\t\n \/\/ p <- r + beta*p\n blas::axpby(z, p, p, ValueType(1), beta);\n\n ++monitor;\n }\n\n \/\/cudaThreadSynchronize();\n\n \/\/ MFLOPs excludes BLAS operations\n \/\/double elapsed = ((double) (clock() - start)) \/ CLOCKS_PER_SEC;\n \/\/double MFLOPs = 2* ((double) i * (double) A.num_entries)\/ (1e6 * elapsed);\n \/\/printf(\"-iteration completed in %lfms ( > %6.2lf MFLOPs )\\n\",1000*elapsed, MFLOPs );\n}\n\n} \/\/ end namespace krylov\n} \/\/ end namespace cusp\n\n<commit_msg>cleaned up CG code<commit_after>\/*\n * Copyright 2008-2009 NVIDIA Corporation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\n#include <cusp\/array1d.h>\n#include <cusp\/blas.h>\n#include <cusp\/multiply.h>\n#include <cusp\/monitor.h>\n#include <cusp\/linear_operator.h>\n\nnamespace blas = cusp::blas;\n\nnamespace cusp\n{\nnamespace krylov\n{\n\ntemplate <class LinearOperator,\n class Vector>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b)\n{\n typedef typename LinearOperator::value_type ValueType;\n\n cusp::default_monitor<ValueType> monitor(b);\n\n cusp::krylov::cg(A, x, b, monitor);\n}\n\ntemplate <class LinearOperator,\n class Vector,\n class Monitor>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b,\n Monitor& monitor)\n{\n typedef typename LinearOperator::value_type ValueType;\n typedef typename LinearOperator::memory_space MemorySpace;\n\n cusp::identity_operator<ValueType,MemorySpace> M(A.num_rows, A.num_cols);\n\n cusp::krylov::cg(A, x, b, monitor, M);\n}\n\ntemplate <class LinearOperator,\n class Vector,\n class Monitor,\n class Preconditioner>\nvoid cg(LinearOperator& A,\n Vector& x,\n Vector& b,\n Monitor& monitor,\n Preconditioner& M)\n{\n typedef typename LinearOperator::value_type ValueType;\n typedef typename LinearOperator::memory_space MemorySpace;\n\n assert(A.num_rows == A.num_cols); \/\/ sanity check\n\n const size_t N = A.num_rows;\n\n \/\/ allocate workspace\n cusp::array1d<ValueType,MemorySpace> y(N);\n cusp::array1d<ValueType,MemorySpace> z(N);\n cusp::array1d<ValueType,MemorySpace> r(N);\n cusp::array1d<ValueType,MemorySpace> p(N);\n \n \/\/ y <- Ax\n cusp::multiply(A, x, y);\n\n \/\/ r <- b - A*x\n blas::axpby(b, y, r, ValueType(1), ValueType(-1));\n \n \/\/ z <- M*r\n cusp::multiply(M, r, z);\n\n \/\/ p <- z\n blas::copy(z, p);\n\t\t\n \/\/ rz = <r^H, z>\n ValueType rz = blas::dotc(r, z);\n\n while (!monitor.finished(r))\n {\n \/\/ y <- Ap\n cusp::multiply(A, p, y);\n \n \/\/ alpha <- <r,z>\/<y,p>\n ValueType alpha = rz \/ blas::dotc(y, p);\n\n \/\/ x <- x + alpha * p\n blas::axpy(p, x, alpha);\n\n \/\/ r <- r - alpha * y\t\t\n blas::axpy(y, r, -alpha);\n\n \/\/ z <- M*r\n cusp::multiply(M, r, z);\n\t\t\n ValueType rz_old = rz;\n\n \/\/ rz = <r^H, z>\n rz = blas::dotc(r, z);\n\n \/\/ beta <- <r_{i+1},r_{i+1}>\/<r,r> \n ValueType beta = rz \/ rz_old;\n\t\t\n \/\/ p <- r + beta*p\n blas::axpby(z, p, p, ValueType(1), beta);\n\n ++monitor;\n }\n}\n\n} \/\/ end namespace krylov\n} \/\/ end namespace cusp\n\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: chips\/p9\/utils\/imageProcs\/p9_tor.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* EKB Project *\/\n\/* *\/\n\/* COPYRIGHT 2016 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* The source code for this program is not published or otherwise *\/\n\/* divested of its trade secrets, irrespective of what has been *\/\n\/* deposited with the U.S. Copyright Office. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef _P9_TOR_H_\n#define _P9_TOR_H_\n\n#include \"p9_ring_identification.H\"\n#include \"p9_ringId.H\"\n#include \"p9_infrastruct_help.H\"\n\nnamespace P9_TOR\n{\n\n#define NUM_RING_IDS P9_NUM_RINGS\n\ntypedef struct\n{\n uint32_t sizeOfThis;\n uint16_t sizeOfCmsk;\n uint16_t sizeOfMeta; \/\/ Exact size of meta data. Arbitrary size. Not null terminated.\n} RingLayout_t;\n\n\n\/\/\n\/\/ Temporary define until in TOR header by Giri.\n\/\/\n\/\/\n\/\/ Temporary define until in TOR header by Giri.\n\/\/\ntypedef struct\n{\n uint32_t TorNumDdLevels;\n uint32_t reserved;\n} TorNumDdLevels_t;\n\ntypedef struct\n{\n uint32_t TorDdLevelAndOffset;\n uint32_t TorDdBlockSize;\n} TorDdLevelBlock_t;\n\ntypedef struct\n{\n uint32_t TorPpeTypeOffset;\n uint32_t TorPpeBlockSize;\n} TorPpeBlock_t;\n\n\n\n#define IMGBUILD_TGR_RING_FOUND 0\n#define IMGBUILD_TGR_RING_BLOCKS_FOUND 0\n#define IMGBUILD_TGR_RING_NOT_FOUND 1 \/\/ Ring is not found in HW image.\n#define IMGBUILD_TGR_INVALID_RING_ID 2 \/\/ Ring is invalid or mismatch.\n#define IMGBUILD_TGR_AMBIGUOUS_API_PARMS 3 \/\/ Ring search in HW iamge got ambiguous condition.\n#define IMGBUILD_TGR_SECTION_NOT_FOUND 4\n#define IMGBUILD_TGR_DD_LVL_INFO_NOT_FOUND 5\n#define IMGBUILD_TGR_OP_BUFFER_INVALID 6\n#define IMGBUILD_TGR_OP_BUFFER_SIZE_EXCEEDED 7\n#define IMGBUILD_INVALID_INSTANCEID 8\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_CME 10\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_SGPE 11\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_DD_LEVEL 12\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_PPE_LEVEL 13\n\n\nextern const char* ringVariantName[];\nextern const char* ppeTypeName[];\n\n\ntypedef enum\nRingBlockType \/\/ Different options to extract data using tor_get_ring API\n{\n SINGLE_RING = 0x00,\n DD_LEVEL_RINGS = 0x01,\n PPE_LEVEL_RINGS = 0x02,\n CPLT_LEVEL_RINGS = 0x03\n} RingBlockType_t;\n\n\ntypedef enum RingType \/\/ Different type of Rings\n{\n COMMON = 0x00,\n INSTANCE = 0x01,\n ALLRING = 0x02\n} RingType_t;\n\n\n\ntypedef enum RingVariant \/\/ Base variables\n{\n BASE = 0x00,\n CC = 0x01,\n RL = 0x02,\n OVERRIDE = 0x03,\n OVERLAY = 0x04,\n NUM_RING_VARIANTS = 0x05\n} RingVariant_t;\n\n\n\/\/\n\/\/ PPE types\n\/\/\ntypedef enum PpeType\n{\n SBE = 0x00, \/\/ Ppe type partition in Ringsection\n CME = 0x01,\n SGPE = 0x02,\n NUM_PPE_TYPES = 0x03\n} PpeType_t;\n\n\n\ntypedef enum RingSectionId\n{\n SECTION_RING = 0x00, \/\/.ring section ID\n SECTION_OVRD = 0x01, \/\/.Override section ID\n SECTION_OVRL = 0x02 \/\/.Overlay section ID\n} RingSectionId_t;\n\ntypedef enum SbeTorId\n{\n PERV_CPLT = 0,\n N0_CPLT = 1,\n N1_CPLT = 2,\n N2_CPLT = 3,\n N3_CPLT = 4,\n XB_CPLT = 5,\n MC_CPLT = 6,\n OB0_CPLT = 7,\n OB1_CPLT = 8,\n OB2_CPLT = 9,\n OB3_CPLT = 10,\n PCI0_CPLT = 11,\n PCI1_CPLT = 12,\n PCI2_CPLT = 13,\n EQ_CPLT = 14,\n EC_CPLT = 15,\n SBE_NOOF_CHIPLETS = 16\n} SbeTorId_t;\ntypedef enum CmeTorId\n{\n CME0_CPLT = 0,\n CME1_CPLT = 1,\n CME2_CPLT = 2,\n CME3_CPLT = 3,\n CME4_CPLT = 4,\n CME5_CPLT = 5,\n CME6_CPLT = 6,\n CME7_CPLT = 7,\n CME8_CPLT = 8,\n CME9_CPLT = 9,\n CME10_CPLT = 10,\n CME11_CPLT = 11,\n CME_NOOF_CHIPLETS = 12\n} CmeTorId_t;\n\/\/\/\n\/\/\/ ****************************************************************************\n\/\/\/ Function declares.\n\/\/\/ ****************************************************************************\n\/\/\/\n\n\nint get_ring_from_sbe_image ( void*\n i_ringSectionPtr, \/\/ Image pointer\n uint64_t i_magic, \/\/ Image Magic Number\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint get_ring_from_sgpe_image ( void*\n i_ringSectionPtr, \/\/ Image pointer\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint get_ring_from_cme_image ( void* i_ringSectionPtr, \/\/ Image pointer\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint tor_get_ring( void*\n i_ringSectionPtr, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint64_t i_magic, \/\/ Image Magic Number\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level info\n PpeType_t i_PpeType, \/\/ PPE type : SBE, CME, etc\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, Cache etc\n uint8_t& io_instanceId, \/\/ chiplet instance ID\n RingBlockType_t i_RingBlockType, \/\/ 0: single ring, 1: ring block\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize, \/\/ size of ring data\n char* o_ringName); \/\/ Ring name\n\nint tor_get_single_ring ( void*\n i_ringSectionPt, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint16_t i_ddLevel, \/\/ DD level info\n RingID i_ringId, \/\/ Unique ring ID\n PpeType_t i_PpeType, \/\/ ppe Type\n RingVariant_t\n i_RingVariant, \/\/ Base, cache contained, Risk level, Override and Overlay\n uint8_t i_instanceId, \/\/ Chiplet Instance ID\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize ); \/\/ size of ring data\n\n\nint tor_get_block_of_rings ( void*\n i_ringSectionPt, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint16_t i_ddLevel, \/\/ DD level\n PpeType_t i_PpeType, \/\/ ppe Type\n RingType_t i_RingType, \/\/ Common Or Instance\n RingVariant_t i_RingVariant, \/\/ base,cache,etc\n uint8_t i_instanceId, \/\/ Chiplet Instance ID\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize); \/\/ size of ring data\n};\n\n#endif \/\/_P9_TOR_H_\n<commit_msg>Added 0b0,1,2 and 3 chiplet TOR block creation support.<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: chips\/p9\/utils\/imageProcs\/p9_tor.H $ *\/\n\/* *\/\n\/* IBM CONFIDENTIAL *\/\n\/* *\/\n\/* EKB Project *\/\n\/* *\/\n\/* COPYRIGHT 2016 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* The source code for this program is not published or otherwise *\/\n\/* divested of its trade secrets, irrespective of what has been *\/\n\/* deposited with the U.S. Copyright Office. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef _P9_TOR_H_\n#define _P9_TOR_H_\n\n#include \"p9_ring_identification.H\"\n#include \"p9_ringId.H\"\n#include \"p9_infrastruct_help.H\"\n\nnamespace P9_TOR\n{\n\n#define NUM_RING_IDS P9_NUM_RINGS\n\ntypedef struct\n{\n uint32_t sizeOfThis;\n uint16_t sizeOfCmsk;\n uint16_t sizeOfMeta; \/\/ Exact size of meta data. Arbitrary size. Not null terminated.\n} RingLayout_t;\n\n\n\/\/\n\/\/ Temporary define until in TOR header by Giri.\n\/\/\n\/\/\n\/\/ Temporary define until in TOR header by Giri.\n\/\/\ntypedef struct\n{\n uint32_t TorNumDdLevels;\n uint32_t reserved;\n} TorNumDdLevels_t;\n\ntypedef struct\n{\n uint32_t TorDdLevelAndOffset;\n uint32_t TorDdBlockSize;\n} TorDdLevelBlock_t;\n\ntypedef struct\n{\n uint32_t TorPpeTypeOffset;\n uint32_t TorPpeBlockSize;\n} TorPpeBlock_t;\n\n\n#define IMGBUILD_TGR_RING_FOUND 0\n#define IMGBUILD_TGR_RING_BLOCKS_FOUND 0\n#define IMGBUILD_TGR_RING_NOT_FOUND 1 \/\/ Ring is not found in HW image.\n#define IMGBUILD_TGR_INVALID_RING_ID 2 \/\/ Ring is invalid or mismatch.\n#define IMGBUILD_TGR_AMBIGUOUS_API_PARMS 3 \/\/ Ring search in HW iamge got ambiguous condition.\n#define IMGBUILD_TGR_SECTION_NOT_FOUND 4\n#define IMGBUILD_TGR_DD_LVL_INFO_NOT_FOUND 5\n#define IMGBUILD_TGR_OP_BUFFER_INVALID 6\n#define IMGBUILD_TGR_OP_BUFFER_SIZE_EXCEEDED 7\n#define IMGBUILD_INVALID_INSTANCEID 8\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_CME 10\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_SGPE 11\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_DD_LEVEL 12\n#define IMGBUILD_TGR_IMAGE_DOES_NOT_SUPPORT_PPE_LEVEL 13\n\n\nextern const char* ringVariantName[];\nextern const char* ppeTypeName[];\n\n\ntypedef enum\nRingBlockType \/\/ Different options to extract data using tor_get_ring API\n{\n SINGLE_RING = 0x00,\n DD_LEVEL_RINGS = 0x01,\n PPE_LEVEL_RINGS = 0x02,\n CPLT_LEVEL_RINGS = 0x03\n} RingBlockType_t;\n\n\ntypedef enum RingType \/\/ Different type of Rings\n{\n COMMON = 0x00,\n INSTANCE = 0x01,\n ALLRING = 0x02\n} RingType_t;\n\n\n\ntypedef enum RingVariant \/\/ Base variables\n{\n BASE = 0x00,\n CC = 0x01,\n RL = 0x02,\n OVERRIDE = 0x03,\n OVERLAY = 0x04,\n NUM_RING_VARIANTS = 0x05\n} RingVariant_t;\n\n\n\/\/\n\/\/ PPE types\n\/\/\ntypedef enum PpeType\n{\n SBE = 0x00, \/\/ Ppe type partition in Ringsection\n CME = 0x01,\n SGPE = 0x02,\n NUM_PPE_TYPES = 0x03\n} PpeType_t;\n\n\n\ntypedef enum RingSectionId\n{\n SECTION_RING = 0x00, \/\/.ring section ID\n SECTION_OVRD = 0x01, \/\/.Override section ID\n SECTION_OVRL = 0x02 \/\/.Overlay section ID\n} RingSectionId_t;\n\ntypedef enum SbeTorId\n{\n PERV_CPLT = 0,\n N0_CPLT = 1,\n N1_CPLT = 2,\n N2_CPLT = 3,\n N3_CPLT = 4,\n XB_CPLT = 5,\n MC_CPLT = 6,\n OB0_CPLT = 7,\n OB1_CPLT = 8,\n OB2_CPLT = 9,\n OB3_CPLT = 10,\n PCI0_CPLT = 11,\n PCI1_CPLT = 12,\n PCI2_CPLT = 13,\n EQ_CPLT = 14,\n EC_CPLT = 15,\n SBE_NOOF_CHIPLETS = 16\n} SbeTorId_t;\ntypedef enum CmeTorId\n{\n CME0_CPLT = 0,\n CME1_CPLT = 1,\n CME2_CPLT = 2,\n CME3_CPLT = 3,\n CME4_CPLT = 4,\n CME5_CPLT = 5,\n CME6_CPLT = 6,\n CME7_CPLT = 7,\n CME8_CPLT = 8,\n CME9_CPLT = 9,\n CME10_CPLT = 10,\n CME11_CPLT = 11,\n CME_NOOF_CHIPLETS = 12\n} CmeTorId_t;\n\/\/\/\n\/\/\/ ****************************************************************************\n\/\/\/ Function declares.\n\/\/\/ ****************************************************************************\n\/\/\/\n\n\nint get_ring_from_sbe_image ( void*\n i_ringSectionPtr, \/\/ Image pointer\n uint64_t i_magic, \/\/ Image Magic Number\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint get_ring_from_sgpe_image ( void*\n i_ringSectionPtr, \/\/ Image pointer\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint get_ring_from_cme_image ( void* i_ringSectionPtr, \/\/ Image pointer\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level details\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, cache contained, Risk level,\n \/\/ Override and Overlay\n uint8_t& io_instanceId, \/\/ required Instance\n RingBlockType_t RingBlockType, \/\/ 0: single ring, 1: ddLevel block\n void** io_ringBlockPtr, \/\/ RS4 Container data or block data\n uint32_t& io_ringBlockSize, \/\/ size of data copied into ring block pointer\n char* o_ringName, \/\/ Name of ring\n uint32_t dbgl); \/\/ Debug option\n\nint tor_get_ring( void*\n i_ringSectionPtr, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint64_t i_magic, \/\/ Image Magic Number\n RingID i_ringId, \/\/ Unique ring ID\n uint16_t i_ddLevel, \/\/ DD level info\n PpeType_t i_PpeType, \/\/ PPE type : SBE, CME, etc\n RingType_t& io_RingType, \/\/ 0: Common 1: Instance\n RingVariant_t i_RingVariant, \/\/ Base, Cache etc\n uint8_t& io_instanceId, \/\/ chiplet instance ID\n RingBlockType_t i_RingBlockType, \/\/ 0: single ring, 1: ring block\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize, \/\/ size of ring data\n char* o_ringName); \/\/ Ring name\n\nint tor_get_single_ring ( void*\n i_ringSectionPt, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint16_t i_ddLevel, \/\/ DD level info\n RingID i_ringId, \/\/ Unique ring ID\n PpeType_t i_PpeType, \/\/ ppe Type\n RingVariant_t\n i_RingVariant, \/\/ Base, cache contained, Risk level, Override and Overlay\n uint8_t i_instanceId, \/\/ Chiplet Instance ID\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize ); \/\/ size of ring data\n\n\nint tor_get_block_of_rings ( void*\n i_ringSectionPt, \/\/ Ring address Ptr any of .rings, .overrides and .overlays.\n uint16_t i_ddLevel, \/\/ DD level\n PpeType_t i_PpeType, \/\/ ppe Type\n RingType_t i_RingType, \/\/ Common Or Instance\n RingVariant_t i_RingVariant, \/\/ base,cache,etc\n uint8_t i_instanceId, \/\/ Chiplet Instance ID\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize); \/\/ size of ring data\n};\n\n#endif \/\/_P9_TOR_H_\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/utils\/imageProcs\/p9_tor.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef _P9_TOR_H_\n#define _P9_TOR_H_\n\n#include <common_ringId.H>\n\n\/\/ Different options to extract data using tor_access_ring API\ntypedef enum RingBlockType\n{\n GET_SINGLE_RING = 0x00,\n GET_DD_LEVEL_RINGS = 0x01,\n GET_PPE_LEVEL_RINGS = 0x02,\n PUT_SINGLE_RING = 0x03\n} RingBlockType_t;\n\n\/\/\/\n\/\/\/ ****************************************************************************\n\/\/\/ Function declares.\n\/\/\/ ****************************************************************************\n\/\/\/\n\/\/\/ Traverse on TOR structure and copies data in granular up to DD type,\n\/\/\/ ppe type, ring type, RS4 ring container and ring address\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring, which is used for scanning operation.\n\/\/\/ TOR API supports two type of binary image. 1) HW image format and 2)\n\/\/\/ SEEPROM image format binary\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings from hw_image\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type. They are SBE, CME\n\/\/\/ and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for single ring extract. There are three major types. They are\n\/\/\/ base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in\/out] io_instanceId A variable to indicate chiplet instance ID.\n\/\/\/ It returns Chiplet instance ID while doing get single ring operation\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate type of operation performed\n\/\/\/ by TOR API Option:\n\/\/\/ GET_SINGLE_RING indicates to extract single ring container.\n\/\/\/ GET_DD_LEVEL_RINGS indicates to extract specific DD level TOR and rings\n\/\/\/ GET_PPE_LEVEL_RINGS indcates to extract specific PPE level TOR and rings\n\/\/\/ PUT_SINGLE_RING indicates to extract ring absolute memory addres for\n\/\/\/ ringTorSlot location\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void pointer to pointer. Returns data\n\/\/\/ which copied during extract ring operation and returns tor absolute address\n\/\/\/ where offset slot is located while PUT_SINGLE_RING call.\n\/\/\/ Note:- Caller's responsibility for free() to avoid memory leak\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data copied\n\/\/\/ into io_ringBlockPtr and returns absolute offset where ring RS4 starts in\n\/\/\/ TOR during PUT_SINGLE_RING call\n\/\/\/\n\/\/\/ \\param[out] o_ringName A string. Returns name of ring ID in characters\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API traverse TOR structure of .ringSection from HW image or SBE image\n\/\/\/ and the following n number of operation based on the call.\n\/\/\/\n\/\/\/ GET_SINGLE_RING (\\a i_ringVariant) - traverse on \\a i_ringSection buffer\n\/\/\/ based on \\a i_ringId which gives ring info, \\a i_ddLevel which gives dd spec\n\/\/\/ (Used only for HW image\/optional for other image) i_ppeType which gives ppe\n\/\/\/ type info, \\a i_ringVarint gives ring variant info and \\a io_instance which\n\/\/\/ gives chiplet instance specific while accessing instance specific ring and\n\/\/\/ returns chiplet number while accessing common ring. On return,\n\/\/\/ \\a io_ringBlockPtr contains RS4 container \\a io_ringBlockSize contains size\n\/\/\/ of data copied into io_ringBlockPtr. \\a o_ringName returns ring string name.\n\/\/\/\n\/\/\/ GET_DD_LEVEL_RINGS (\\a i_ringVariant) - traverse on \\a i_ringSection\n\/\/\/ buffer based on \\a i_ddLevel which gives dd spec (used only for HW image\n\/\/\/ \/optional for other image) On return, \\a io_ringBlockPtr contains DD level\n\/\/\/ specific ring section and \\a io_ringBlockSize contains size of the data\n\/\/\/ copied into io_ringBlockPtr. \\a Other params are optional.\n\/\/\/ This ringVariant works on HW image.\n\/\/\/\n\/\/\/ GET_PPE_LEVEL_RINGS (\\a i_ringVariant) - traverse on \\a i_ringSection\n\/\/\/ buffer based on \\a i_ppeType which gives ppe type info and \\a i_ddLevel which\n\/\/\/ gives dd spec used only for HW image\/optional for other image) On return,\n\/\/\/ \\a io_ringBlockPtr contains PPE type specific ring section and\n\/\/\/ \\a io_ringBlockSize contains size of the data copied into io_ringBlockPtr.\n\/\/\/ \\a Other params are optional. This ringVariant works on HW image.\n\/\/\/\n\/\/\/ PUT_SINGLE_RING (\\a i_ringVariant) - traverse on \\a i_ringSection buffer\n\/\/\/ based on \\a i_ringId which gives ring info, \\a i_ddLevel which gives dd spec\n\/\/\/ (used only for HW image\/optional for other image), i_ppeType which gives\n\/\/\/ ppe type info, \\a i_ringVarint gives ring variant info and \\a io_instance\n\/\/\/ which gives chiplet instance specific while accessing instance specific\n\/\/\/ ring and returns chiplet number while accessing common ring. On return,\n\/\/\/ \\a io_ringBlockPtr contains absolute memory address of ring type of\n\/\/\/ requested ring and \\a io_ringBlockSize contains of absolute memory addres\n\/\/\/ of ringTor slot copied into io_ringBlockPtr \\a o_ringName returns ring\n\/\/\/ string name\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_access_ring( void* i_ringSection, \/\/ Ring section ptr\n RingId_t i_ringId, \/\/ Unique ring ID\n uint8_t i_ddLevel, \/\/ DD level info\n PpeType_t i_PpeType, \/\/ PPE type : SBE, CME, etc\n RingVariant_t i_RingVariant, \/\/ Base, Cache etc\n uint8_t& io_instanceId, \/\/ chiplet instance ID\n RingBlockType_t i_RingBlockType, \/\/ 0: single ring, 1: ring block\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize, \/\/ size of ring data\n char* o_ringName, \/\/ Ring name\n uint32_t i_dbgl = 0 ); \/\/ Debug option\n\n\n\/\/\/ Traverse on TOR structure and copies RS4 ring container data for ring\n\/\/\/ variant\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contain details of p9 Ring which is used for scanning operation.\n\/\/\/ TOR API supports HW image format only\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings on hw_image.\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type.\n\/\/\/ They are SBE, CME and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for get single ring operation There are three major types.\n\/\/\/ They are base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in] io_instanceId A variable to indicate chiplet instance ID\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void point to pointer. Returns data\n\/\/\/ which copied during extract ring operation\n\/\/\/ Note- Caller's responsibility for free() to avoid memory leak\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data copied\n\/\/\/ into io_ringBlockPtr\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on top of tor_access_ring API to support get\n\/\/\/ single ring container from .ring section and customizes for\n\/\/\/ get_single_ring parameter.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_get_single_ring ( void* i_ringSection,\n uint8_t i_ddLevel,\n RingId_t i_ringId,\n PpeType_t i_PpeType,\n RingVariant_t i_RingVariant,\n uint8_t i_instanceId,\n void** io_ringBlockPtr,\n uint32_t& io_ringBlockSize,\n uint32_t i_dbgl = 0 ); \/\/ Debug option\n\n\/\/\/ Traverse on TOR structure and copies data in block level up to DD type,\n\/\/\/ ppe type and ring type\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring which is used for scanning operation.\n\/\/\/ API supports HW image format only\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings on hw_image\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type passed.\n\/\/\/ they are SBE, CME and SGPE. It is used to decode TOR structure\n\/\/\/ TOR API uses Ppe type to extract single ring or block of rings\n\/\/\/ on either hw_image or SBE image\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for single ring extract. There are three major types.\n\/\/\/ They are base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void point to pointer. Returns data\n\/\/\/ which copied block of rings. Note: Caller's responsibility for free()\n\/\/\/ to avoid memory leak\n\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data\n\/\/\/ copied into io_ringBlockPtr\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on top of tor_access_ring API and supports\n\/\/\/ to copy block of rings in DD level and PPE level rings.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_get_block_of_rings ( void* i_ringSection,\n uint8_t i_ddLevel,\n PpeType_t i_PpeType,\n RingVariant_t i_RingVariant,\n void** io_ringBlockPtr,\n uint32_t& io_ringBlockSize,\n uint32_t i_dbgl = 0 );\n\n\/\/\/ Traverse on TOR structure and copies absolute memory address of Ringtype\n\/\/\/ offset addres and TOR offset slot address\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring which is used for scanning operation.\n\/\/\/ TOR API supports SEEPROM image format.\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringSectionSize In: Exact size of i_ringSection.\n\/\/\/ Out: Updated size of i_ringSection.\n\/\/\/ Note: Caller manages this buffer and must make sure the RS4 ring fits\n\/\/\/ before making this call\n\/\/\/\n\/\/\/ \\param[in] i_ringBuffer A pointer to a ring work buffer, which is used\n\/\/\/ for scanning operation purpose\n\/\/\/\n\/\/\/ \\param[in] i_ringBufferSize A constant value to indicate size of\n\/\/\/ ringBuffer data passed in\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type. They are SBE,\n\/\/\/ CME and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum and used as input param to indicate\n\/\/\/ which variant type of requested for single ring extract\n\/\/\/\n\/\/\/ \\param[in] i_instanceId A variable to indicate chiplet instance ID\n\/\/\/\n\/\/\/ \\param[in] i_rs4_container A void pointer. Contains RS4 compressed ring\n\/\/\/ data which eventually attached into void image pointer i_ringSection\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on tor_access_ring to get \\a io_ringBlockPtr\n\/\/\/ contains absolute memory address of ring type start address of the ring\n\/\/\/ \\a io_ringBlockSize contains absolute memory address of ringTorslot. Then\n\/\/\/ appends new rs4 ring container at the end of ring section and updates new\n\/\/\/ ring offset address on ring offset location. the slot must be empty. If there\n\/\/\/ is non-zero content in the slot, the API will fail catastrophically. Do not\n\/\/\/ \"insert\" or \"replace\" rings at ring section.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_append_ring( void* i_ringSection,\n uint32_t& io_ringSectionSize,\n void* i_ringBuffer,\n const uint32_t i_ringBufferSize,\n RingId_t i_ringId,\n PpeType_t i_ppeType,\n RingVariant_t i_RingVariant,\n uint8_t i_instanceId,\n void* i_rs4Container,\n uint32_t i_dbgl = 0 );\n\n\n\/\/\/ Inform caller of TOR version\n\/\/\/\n\/\/\/ \\param[in] - none\n\/\/\/\n\/\/\/ \\retval - TOR version\nuint8_t tor_version( void);\n\n#endif \/\/_P9_TOR_H_\n<commit_msg>Moving DD specific ring coord from TOR to XIP (step 1)<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/utils\/imageProcs\/p9_tor.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef _P9_TOR_H_\n#define _P9_TOR_H_\n\n#include <common_ringId.H>\n\n\/\/ Different options to extract data using tor_access_ring API\ntypedef enum RingBlockType\n{\n GET_SINGLE_RING = 0x00,\n#ifdef TORV3_SUPPORT\n GET_DD_LEVEL_RINGS = 0x01,\n#endif\n GET_PPE_LEVEL_RINGS = 0x02,\n PUT_SINGLE_RING = 0x03\n} RingBlockType_t;\n\n\/\/\/\n\/\/\/ ****************************************************************************\n\/\/\/ Function declares.\n\/\/\/ ****************************************************************************\n\/\/\/\n\/\/\/ Traverse on TOR structure and copies data in granular up to DD type,\n\/\/\/ ppe type, ring type, RS4 ring container and ring address\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring, which is used for scanning operation.\n\/\/\/ TOR API supports two type of binary image. 1) HW image format and 2)\n\/\/\/ SEEPROM image format binary\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings from hw_image\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type. They are SBE, CME\n\/\/\/ and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for single ring extract. There are three major types. They are\n\/\/\/ base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in\/out] io_instanceId A variable to indicate chiplet instance ID.\n\/\/\/ It returns Chiplet instance ID while doing get single ring operation\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate type of operation performed\n\/\/\/ by TOR API Option:\n\/\/\/ GET_SINGLE_RING indicates to extract single ring container.\n\/\/\/ GET_PPE_LEVEL_RINGS indcates to extract specific PPE level TOR and rings\n\/\/\/ PUT_SINGLE_RING indicates to extract ring absolute memory addres for\n\/\/\/ ringTorSlot location\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void pointer to pointer. Returns data\n\/\/\/ which copied during extract ring operation and returns tor absolute address\n\/\/\/ where offset slot is located while PUT_SINGLE_RING call.\n\/\/\/ Note:- Caller's responsibility for free() to avoid memory leak\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data copied\n\/\/\/ into io_ringBlockPtr and returns absolute offset where ring RS4 starts in\n\/\/\/ TOR during PUT_SINGLE_RING call\n\/\/\/\n\/\/\/ \\param[out] o_ringName A string. Returns name of ring ID in characters\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API traverse TOR structure of .ringSection from HW image or SBE image\n\/\/\/ and the following n number of operation based on the call.\n\/\/\/\n\/\/\/ GET_SINGLE_RING (\\a i_ringVariant) - traverse on \\a i_ringSection buffer\n\/\/\/ based on \\a i_ringId which gives ring info, \\a i_ddLevel which gives dd spec\n\/\/\/ (Used only for HW image\/optional for other image) i_ppeType which gives ppe\n\/\/\/ type info, \\a i_ringVarint gives ring variant info and \\a io_instance which\n\/\/\/ gives chiplet instance specific while accessing instance specific ring and\n\/\/\/ returns chiplet number while accessing common ring. On return,\n\/\/\/ \\a io_ringBlockPtr contains RS4 container \\a io_ringBlockSize contains size\n\/\/\/ of data copied into io_ringBlockPtr. \\a o_ringName returns ring string name.\n\/\/\/\n\/\/\/ GET_PPE_LEVEL_RINGS (\\a i_ringVariant) - traverse on \\a i_ringSection\n\/\/\/ buffer based on \\a i_ppeType which gives ppe type info and \\a i_ddLevel which\n\/\/\/ gives dd spec used only for HW image\/optional for other image) On return,\n\/\/\/ \\a io_ringBlockPtr contains PPE type specific ring section and\n\/\/\/ \\a io_ringBlockSize contains size of the data copied into io_ringBlockPtr.\n\/\/\/ \\a Other params are optional. This ringVariant works on HW image.\n\/\/\/\n\/\/\/ PUT_SINGLE_RING (\\a i_ringVariant) - traverse on \\a i_ringSection buffer\n\/\/\/ based on \\a i_ringId which gives ring info, \\a i_ddLevel which gives dd spec\n\/\/\/ (used only for HW image\/optional for other image), i_ppeType which gives\n\/\/\/ ppe type info, \\a i_ringVarint gives ring variant info and \\a io_instance\n\/\/\/ which gives chiplet instance specific while accessing instance specific\n\/\/\/ ring and returns chiplet number while accessing common ring. On return,\n\/\/\/ \\a io_ringBlockPtr contains absolute memory address of ring type of\n\/\/\/ requested ring and \\a io_ringBlockSize contains of absolute memory addres\n\/\/\/ of ringTor slot copied into io_ringBlockPtr \\a o_ringName returns ring\n\/\/\/ string name\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_access_ring( void* i_ringSection, \/\/ Ring section ptr\n RingId_t i_ringId, \/\/ Unique ring ID\n uint8_t i_ddLevel, \/\/ DD level info\n PpeType_t i_PpeType, \/\/ PPE type : SBE, CME, etc\n RingVariant_t i_RingVariant, \/\/ Base, Cache etc\n uint8_t& io_instanceId, \/\/ chiplet instance ID\n RingBlockType_t i_RingBlockType, \/\/ 0: single ring, 1: ring block\n void** io_ringBlockPtr, \/\/ Addr of ring buffer\n uint32_t& io_ringBlockSize, \/\/ size of ring data\n char* o_ringName, \/\/ Ring name\n uint32_t i_dbgl = 0 ); \/\/ Debug option\n\n\n\/\/\/ Traverse on TOR structure and copies RS4 ring container data for ring\n\/\/\/ variant\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contain details of p9 Ring which is used for scanning operation.\n\/\/\/ TOR API supports HW image format only\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings on hw_image.\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type.\n\/\/\/ They are SBE, CME and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for get single ring operation There are three major types.\n\/\/\/ They are base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in] io_instanceId A variable to indicate chiplet instance ID\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void point to pointer. Returns data\n\/\/\/ which copied during extract ring operation\n\/\/\/ Note- Caller's responsibility for free() to avoid memory leak\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data copied\n\/\/\/ into io_ringBlockPtr\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on top of tor_access_ring API to support get\n\/\/\/ single ring container from .ring section and customizes for\n\/\/\/ get_single_ring parameter.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_get_single_ring ( void* i_ringSection,\n uint8_t i_ddLevel,\n RingId_t i_ringId,\n PpeType_t i_PpeType,\n RingVariant_t i_RingVariant,\n uint8_t i_instanceId,\n void** io_ringBlockPtr,\n uint32_t& io_ringBlockSize,\n uint32_t i_dbgl = 0 ); \/\/ Debug option\n\n\/\/\/ Traverse on TOR structure and copies data in block level up to DD type,\n\/\/\/ ppe type and ring type\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring which is used for scanning operation.\n\/\/\/ API supports HW image format only\n\/\/\/\n\/\/\/ \\param[in] i_ddLevel A variable to indicate chip DD level. TOR API\n\/\/\/ uses DD level to extract single ring or block of rings on hw_image\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type passed.\n\/\/\/ they are SBE, CME and SGPE. It is used to decode TOR structure\n\/\/\/ TOR API uses Ppe type to extract single ring or block of rings\n\/\/\/ on either hw_image or SBE image\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum to indicate which variant type of\n\/\/\/ requested for single ring extract. There are three major types.\n\/\/\/ They are base, Cache contained and Risk level ring\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringBlockPtr A void point to pointer. Returns data\n\/\/\/ which copied block of rings. Note: Caller's responsibility for free()\n\/\/\/ to avoid memory leak\n\/\/\n\/\/\/ \\param[in\/out] io_ringBlockSize A variable. Returns size of data\n\/\/\/ copied into io_ringBlockPtr\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on top of tor_access_ring API and supports\n\/\/\/ to copy block of rings in DD level and PPE level rings.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_get_block_of_rings ( void* i_ringSection,\n uint8_t i_ddLevel,\n PpeType_t i_PpeType,\n RingVariant_t i_RingVariant,\n void** io_ringBlockPtr,\n uint32_t& io_ringBlockSize,\n uint32_t i_dbgl = 0 );\n\n\/\/\/ Traverse on TOR structure and copies absolute memory address of Ringtype\n\/\/\/ offset addres and TOR offset slot address\n\/\/\/\n\/\/\/ \\param[in] i_ringSection A pointer to a Ring section binary image.\n\/\/\/ It contains details of p9 Ring which is used for scanning operation.\n\/\/\/ TOR API supports SEEPROM image format.\n\/\/\/\n\/\/\/ \\param[in\/out] io_ringSectionSize In: Exact size of i_ringSection.\n\/\/\/ Out: Updated size of i_ringSection.\n\/\/\/ Note: Caller manages this buffer and must make sure the RS4 ring fits\n\/\/\/ before making this call\n\/\/\/\n\/\/\/ \\param[in] i_ringBuffer A pointer to a ring work buffer, which is used\n\/\/\/ for scanning operation purpose\n\/\/\/\n\/\/\/ \\param[in] i_ringBufferSize A constant value to indicate size of\n\/\/\/ ringBuffer data passed in\n\/\/\/\n\/\/\/ \\param[in] i_ringId A enum to indicate unique ID for the ring\n\/\/\/\n\/\/\/ \\param[in] i_PpeType A enum to indicate ppe type. They are SBE,\n\/\/\/ CME and SGPE. It is used to decode TOR structure\n\/\/\/\n\/\/\/ \\param[in] i_RingVariant A enum and used as input param to indicate\n\/\/\/ which variant type of requested for single ring extract\n\/\/\/\n\/\/\/ \\param[in] i_instanceId A variable to indicate chiplet instance ID\n\/\/\/\n\/\/\/ \\param[in] i_rs4_container A void pointer. Contains RS4 compressed ring\n\/\/\/ data which eventually attached into void image pointer i_ringSection\n\/\/\/\n\/\/\/ \\param[in] - i_debug is debug statment params. Supports 0 to 3.\n\/\/\/\n\/\/\/ This API contains wrapper on tor_access_ring to get \\a io_ringBlockPtr\n\/\/\/ contains absolute memory address of ring type start address of the ring\n\/\/\/ \\a io_ringBlockSize contains absolute memory address of ringTorslot. Then\n\/\/\/ appends new rs4 ring container at the end of ring section and updates new\n\/\/\/ ring offset address on ring offset location. the slot must be empty. If there\n\/\/\/ is non-zero content in the slot, the API will fail catastrophically. Do not\n\/\/\/ \"insert\" or \"replace\" rings at ring section.\n\/\/\/\n\/\/\/ \\retval 0 Success\n\/\/\/\n\/\/\/ \\retval non-0 See \\ref TOR API RETURN errors\nint tor_append_ring( void* i_ringSection,\n uint32_t& io_ringSectionSize,\n void* i_ringBuffer,\n const uint32_t i_ringBufferSize,\n RingId_t i_ringId,\n PpeType_t i_ppeType,\n RingVariant_t i_RingVariant,\n uint8_t i_instanceId,\n void* i_rs4Container,\n uint32_t i_dbgl = 0 );\n\n\n\/\/\/ Inform caller of TOR version\n\/\/\/\n\/\/\/ \\param[in] - none\n\/\/\/\n\/\/\/ \\retval - TOR version\nuint8_t tor_version( void);\n\n#endif \/\/_P9_TOR_H_\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the CernVM File System.\n *\/\n#define __STDC_FORMAT_MACROS\n#include \"authz_curl.h\"\n\n#include <openssl\/err.h>\n#include <openssl\/ssl.h>\n#include <pthread.h>\n\n#include <cassert>\n\n#include \"authz\/authz_session.h\"\n#include \"duplex_curl.h\"\n#include \"duplex_ssl.h\"\n#include \"logging.h\"\n#include \"util\/pointer.h\"\n#include \"util_concurrency.h\"\n\nusing namespace std; \/\/ NOLINT\n\n\nnamespace {\n\nstruct sslctx_info {\n sslctx_info() : chain(NULL), pkey(NULL) {}\n\n STACK_OF(X509) *chain;\n EVP_PKEY *pkey;\n};\n\nstruct bearer_info {\n \/**\n * List of extra headers to put on the HTTP request. This is required\n * in order to add the \"Authorization: Bearer XXXXX\" header.\n *\/\n struct curl_slist *list;\n\n \/**\n * Actual text of the bearer token\n *\/\n char* token;\n\n};\n} \/\/ anonymous namespace\n\n\nbool AuthzAttachment::ssl_strings_loaded_ = false;\n\n\nAuthzAttachment::AuthzAttachment(AuthzSessionManager *sm)\n : authz_session_manager_(sm)\n{\n \/\/ Required for logging OpenSSL errors\n SSL_load_error_strings();\n ssl_strings_loaded_ = true;\n}\n\n\nCURLcode AuthzAttachment::CallbackSslCtx(\n CURL *curl,\n void *sslctx,\n void *parm)\n{\n sslctx_info *p = reinterpret_cast<sslctx_info *>(parm);\n SSL_CTX *ctx = reinterpret_cast<SSL_CTX *>(sslctx);\n\n if (parm == NULL)\n return CURLE_OK;\n\n STACK_OF(X509) *chain = p->chain;\n EVP_PKEY *pkey = p->pkey;\n\n LogCvmfs(kLogAuthz, kLogDebug, \"Customizing OpenSSL context.\");\n\n int cert_count = sk_X509_num(chain);\n if (cert_count == 0) {\n LogOpenSSLErrors(\"No certificate found in chain.\");\n }\n X509 *cert = sk_X509_value(chain, 0);\n\n \/\/ NOTE: SSL_CTX_use_certificate and _user_PrivateKey increase the ref count.\n if (!SSL_CTX_use_certificate(ctx, cert)) {\n LogOpenSSLErrors(\"Failed to set the user certificate in the SSL \"\n \"connection\");\n return CURLE_SSL_CERTPROBLEM;\n }\n\n if (!SSL_CTX_use_PrivateKey(ctx, pkey)) {\n LogOpenSSLErrors(\"Failed to set the private key in the SSL connection\");\n return CURLE_SSL_CERTPROBLEM;\n }\n\n if (!SSL_CTX_check_private_key(ctx)) {\n LogOpenSSLErrors(\"Provided certificate and key do not match\");\n return CURLE_SSL_CERTPROBLEM;\n } else {\n LogCvmfs(kLogAuthz, kLogDebug, \"Client certificate and key match.\");\n }\n\n \/\/ NOTE: SSL_CTX_add_extra_chain_cert DOES NOT increase the ref count\n \/\/ Instead, it now owns the pointer. THIS IS DIFFERENT FROM ABOVE.\n for (int idx = 1; idx < cert_count; idx++) {\n cert = sk_X509_value(chain, idx);\n if (!SSL_CTX_add_extra_chain_cert(ctx, X509_dup(cert))) {\n LogOpenSSLErrors(\"Failed to add client cert to chain\");\n }\n }\n\n return CURLE_OK;\n}\n\n\nbool AuthzAttachment::ConfigureSciTokenCurl(\n CURL *curl_handle,\n const AuthzToken &token,\n void **info_data)\n{\n if (*info_data == NULL) {\n AuthzToken* saved_token = new AuthzToken();\n saved_token->type = kTokenBearer;\n saved_token->data = new bearer_info;\n bearer_info* bearer = static_cast<bearer_info*>(saved_token->data);\n bearer->token = (char*)smalloc((sizeof(char) * token.size)+ 1);\n memcpy(bearer->token, token.data, token.size);\n static_cast<char*>(bearer->token)[token.size] = 0;\n *info_data = saved_token;\n }\n\n AuthzToken* tmp_token = static_cast<AuthzToken*>(*info_data);\n bearer_info* bearer = static_cast<bearer_info*>(tmp_token->data);\n\n LogCvmfs(kLogAuthz, kLogDebug, \"Setting OAUTH bearer token to: %s\",\n static_cast<char*>(bearer->token));\n\n \/\/ Create the Bearer token\n \/\/ The CURLOPT_XOAUTH2_BEARER option only works \"IMAP, POP3 and SMTP\" protocols\n \/\/ Not HTTPS\n std::string auth_preamble = \"Authorization: Bearer \";\n std::string auth_header = auth_preamble + static_cast<char*>(bearer->token);\n bearer->list = curl_slist_append(bearer->list, auth_header.c_str());\n int retval = curl_easy_setopt(curl_handle, CURLOPT_HTTPHEADER, bearer->list);\n \n if (retval != CURLE_OK) {\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"Failed to set Oauth2 Bearer Token\");\n return false;\n }\n\n return true;\n}\n\n\n\nbool AuthzAttachment::ConfigureCurlHandle(\n CURL *curl_handle,\n pid_t pid,\n void **info_data)\n{\n assert(info_data);\n\n \/\/ We cannot rely on libcurl to pipeline (yet), as cvmfs may\n \/\/ bounce between different auth handles.\n curl_easy_setopt(curl_handle, CURLOPT_FRESH_CONNECT, 1);\n curl_easy_setopt(curl_handle, CURLOPT_FORBID_REUSE, 1);\n curl_easy_setopt(curl_handle, CURLOPT_SSL_SESSIONID_CACHE, 0);\n\n UniquePtr<AuthzToken> token(\n authz_session_manager_->GetTokenCopy(pid, membership_));\n if (!token.IsValid()) {\n LogCvmfs(kLogAuthz, kLogDebug, \"failed to get authz token for pid %d\", pid);\n return false;\n }\n\n switch (token->type) {\n case kTokenBearer:\n \/\/ If it's a scitoken, then just go to the private\n \/\/ ConfigureSciTokenCurl function\n return ConfigureSciTokenCurl(curl_handle, *token, info_data);\n\n case kTokenX509:\n \/\/ The x509 code is below, so just break and go.\n break;\n\n default:\n \/\/ Oh no, don't know the the token type, throw error and return\n LogCvmfs(kLogAuthz, kLogDebug, \"unknown token type: %d\", token->type);\n return false;\n }\n\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA, NULL);\n\n \/\/ The calling layer is reusing data;\n if (*info_data) {\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA,\n static_cast<AuthzToken*>(*info_data)->data);\n return true;\n }\n\n\n int retval = curl_easy_setopt(curl_handle,\n CURLOPT_SSL_CTX_FUNCTION,\n CallbackSslCtx);\n if (retval != CURLE_OK) {\n LogCvmfs(kLogAuthz, kLogDebug, \"cannot configure curl ssl callback\");\n return false;\n }\n\n UniquePtr<sslctx_info> parm(new sslctx_info);\n\n STACK_OF(X509_INFO) *sk = NULL;\n STACK_OF(X509) *certstack = sk_X509_new_null();\n parm->chain = certstack;\n if (certstack == NULL) {\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"Failed to allocate new X509 chain.\");\n return false;\n }\n\n BIO *bio_token = BIO_new_mem_buf(token->data, token->size);\n assert(bio_token != NULL);\n sk = PEM_X509_INFO_read_bio(bio_token, NULL, NULL, NULL);\n BIO_free(bio_token);\n if (!sk) {\n LogOpenSSLErrors(\"Failed to load credential file.\");\n sk_X509_INFO_free(sk);\n sk_X509_free(certstack);\n return false;\n }\n\n while (sk_X509_INFO_num(sk)) {\n X509_INFO *xi = sk_X509_INFO_shift(sk);\n if (xi == NULL) {continue;}\n if (xi->x509 != NULL) {\n#ifdef OPENSSL_API_INTERFACE_V11\n retval = X509_up_ref(xi->x509);\n assert(retval == 1);\n#else\n CRYPTO_add(&xi->x509->references, 1, CRYPTO_LOCK_X509);\n#endif\n sk_X509_push(certstack, xi->x509);\n }\n if ((xi->x_pkey != NULL) && (xi->x_pkey->dec_pkey != NULL)) {\n parm->pkey = xi->x_pkey->dec_pkey;\n#ifdef OPENSSL_API_INTERFACE_V11\n retval = EVP_PKEY_up_ref(parm->pkey);\n assert(retval == 1);\n#else\n CRYPTO_add(&parm->pkey->references, 1, CRYPTO_LOCK_EVP_PKEY);\n#endif\n }\n X509_INFO_free(xi);\n }\n sk_X509_INFO_free(sk);\n\n if (parm->pkey == NULL) {\n \/\/ Sigh - PEM_X509_INFO_read doesn't understand old key encodings.\n \/\/ Try a more general-purpose funciton.\n BIO *bio_token = BIO_new_mem_buf(token->data, token->size);\n assert(bio_token != NULL);\n EVP_PKEY *old_pkey = PEM_read_bio_PrivateKey(bio_token, NULL, NULL, NULL);\n BIO_free(bio_token);\n if (old_pkey) {\n parm->pkey = old_pkey;\n } else {\n sk_X509_free(certstack);\n LogCvmfs(kLogAuthz, kLogSyslogErr,\n \"credential did not contain a decrypted private key.\");\n return false;\n }\n }\n\n if (!sk_X509_num(certstack)) {\n EVP_PKEY_free(parm->pkey);\n sk_X509_free(certstack);\n LogCvmfs(kLogAuthz, kLogSyslogErr,\n \"Credential file did not contain any actual credentials.\");\n return false;\n } else {\n LogCvmfs(kLogAuthz, kLogDebug, \"Certificate stack contains %d entries.\",\n sk_X509_num(certstack));\n }\n\n AuthzToken* to_return = new AuthzToken();\n to_return->type = kTokenX509;\n to_return->data = static_cast<void*>(parm.Release());\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA,\n static_cast<sslctx_info*>(to_return->data));\n *info_data = to_return;\n return true;\n}\n\n\nvoid AuthzAttachment::LogOpenSSLErrors(const char *top_message) {\n assert(ssl_strings_loaded_);\n char error_buf[1024];\n LogCvmfs(kLogAuthz, kLogSyslogWarn, \"%s\", top_message);\n unsigned long next_err; \/\/ NOLINT; this is the type expected by OpenSSL\n while ((next_err = ERR_get_error())) {\n ERR_error_string_n(next_err, error_buf, 1024);\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"%s\", error_buf);\n }\n}\n\n\nvoid AuthzAttachment::ReleaseCurlHandle(CURL *curl_handle, void *info_data) {\n assert(info_data);\n\n AuthzToken* token = static_cast<AuthzToken*>(info_data);\n if (token->type == kTokenBearer) {\n \/\/ Compiler complains if we delete a void*\n bearer_info* bearer = static_cast<bearer_info*>(token->data);\n delete static_cast<char*>(bearer->token);\n curl_slist_free_all(bearer->list);\n delete static_cast<bearer_info*>(token->data);\n token->data = NULL;\n delete token;\n\n } else if (token->type == kTokenX509) {\n sslctx_info *p = static_cast<sslctx_info *>(info_data);\n STACK_OF(X509) *chain = p->chain;\n EVP_PKEY *pkey = p->pkey;\n p->chain = NULL;\n p->pkey = NULL;\n delete p;\n\n \/\/ Calls X509_free on each element, then frees the stack itself\n sk_X509_pop_free(chain, X509_free);\n EVP_PKEY_free(pkey);\n\n \/\/ Make sure that if CVMFS reuses this curl handle, curl doesn't try\n \/\/ to reuse cert chain we just freed.\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA, 0);\n }\n}\n<commit_msg>Fixing some cpplint<commit_after>\/**\n * This file is part of the CernVM File System.\n *\/\n#define __STDC_FORMAT_MACROS\n#include \"authz_curl.h\"\n\n#include <openssl\/err.h>\n#include <openssl\/ssl.h>\n#include <pthread.h>\n\n#include <cassert>\n\n#include \"authz\/authz_session.h\"\n#include \"duplex_curl.h\"\n#include \"duplex_ssl.h\"\n#include \"logging.h\"\n#include \"util\/pointer.h\"\n#include \"util_concurrency.h\"\n\nusing namespace std; \/\/ NOLINT\n\n\nnamespace {\n\nstruct sslctx_info {\n sslctx_info() : chain(NULL), pkey(NULL) {}\n\n STACK_OF(X509) *chain;\n EVP_PKEY *pkey;\n};\n\nstruct bearer_info {\n \/**\n * List of extra headers to put on the HTTP request. This is required\n * in order to add the \"Authorization: Bearer XXXXX\" header.\n *\/\n struct curl_slist *list;\n\n \/**\n * Actual text of the bearer token\n *\/\n char* token;\n};\n} \/\/ anonymous namespace\n\n\nbool AuthzAttachment::ssl_strings_loaded_ = false;\n\n\nAuthzAttachment::AuthzAttachment(AuthzSessionManager *sm)\n : authz_session_manager_(sm)\n{\n \/\/ Required for logging OpenSSL errors\n SSL_load_error_strings();\n ssl_strings_loaded_ = true;\n}\n\n\nCURLcode AuthzAttachment::CallbackSslCtx(\n CURL *curl,\n void *sslctx,\n void *parm)\n{\n sslctx_info *p = reinterpret_cast<sslctx_info *>(parm);\n SSL_CTX *ctx = reinterpret_cast<SSL_CTX *>(sslctx);\n\n if (parm == NULL)\n return CURLE_OK;\n\n STACK_OF(X509) *chain = p->chain;\n EVP_PKEY *pkey = p->pkey;\n\n LogCvmfs(kLogAuthz, kLogDebug, \"Customizing OpenSSL context.\");\n\n int cert_count = sk_X509_num(chain);\n if (cert_count == 0) {\n LogOpenSSLErrors(\"No certificate found in chain.\");\n }\n X509 *cert = sk_X509_value(chain, 0);\n\n \/\/ NOTE: SSL_CTX_use_certificate and _user_PrivateKey increase the ref count.\n if (!SSL_CTX_use_certificate(ctx, cert)) {\n LogOpenSSLErrors(\"Failed to set the user certificate in the SSL \"\n \"connection\");\n return CURLE_SSL_CERTPROBLEM;\n }\n\n if (!SSL_CTX_use_PrivateKey(ctx, pkey)) {\n LogOpenSSLErrors(\"Failed to set the private key in the SSL connection\");\n return CURLE_SSL_CERTPROBLEM;\n }\n\n if (!SSL_CTX_check_private_key(ctx)) {\n LogOpenSSLErrors(\"Provided certificate and key do not match\");\n return CURLE_SSL_CERTPROBLEM;\n } else {\n LogCvmfs(kLogAuthz, kLogDebug, \"Client certificate and key match.\");\n }\n\n \/\/ NOTE: SSL_CTX_add_extra_chain_cert DOES NOT increase the ref count\n \/\/ Instead, it now owns the pointer. THIS IS DIFFERENT FROM ABOVE.\n for (int idx = 1; idx < cert_count; idx++) {\n cert = sk_X509_value(chain, idx);\n if (!SSL_CTX_add_extra_chain_cert(ctx, X509_dup(cert))) {\n LogOpenSSLErrors(\"Failed to add client cert to chain\");\n }\n }\n\n return CURLE_OK;\n}\n\n\nbool AuthzAttachment::ConfigureSciTokenCurl(\n CURL *curl_handle,\n const AuthzToken &token,\n void **info_data)\n{\n if (*info_data == NULL) {\n AuthzToken* saved_token = new AuthzToken();\n saved_token->type = kTokenBearer;\n saved_token->data = new bearer_info;\n bearer_info* bearer = static_cast<bearer_info*>(saved_token->data);\n bearer->list = NULL;\n bearer->token = static_cast<char*>(smalloc((sizeof(char) * token.size)+ 1));\n memcpy(bearer->token, token.data, token.size);\n static_cast<char*>(bearer->token)[token.size] = 0;\n *info_data = saved_token;\n }\n\n AuthzToken* tmp_token = static_cast<AuthzToken*>(*info_data);\n bearer_info* bearer = static_cast<bearer_info*>(tmp_token->data);\n\n LogCvmfs(kLogAuthz, kLogDebug, \"Setting OAUTH bearer token to: %s\",\n static_cast<char*>(bearer->token));\n\n \/\/ Create the Bearer token\n \/\/ The CURLOPT_XOAUTH2_BEARER option only works \"IMAP, POP3 and SMTP\"\n \/\/ protocols. Not HTTPS\n std::string auth_preamble = \"Authorization: Bearer \";\n std::string auth_header = auth_preamble + static_cast<char*>(bearer->token);\n bearer->list = curl_slist_append(bearer->list, auth_header.c_str());\n int retval = curl_easy_setopt(curl_handle, CURLOPT_HTTPHEADER, bearer->list);\n\n if (retval != CURLE_OK) {\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"Failed to set Oauth2 Bearer Token\");\n return false;\n }\n\n return true;\n}\n\n\n\nbool AuthzAttachment::ConfigureCurlHandle(\n CURL *curl_handle,\n pid_t pid,\n void **info_data)\n{\n assert(info_data);\n\n \/\/ We cannot rely on libcurl to pipeline (yet), as cvmfs may\n \/\/ bounce between different auth handles.\n curl_easy_setopt(curl_handle, CURLOPT_FRESH_CONNECT, 1);\n curl_easy_setopt(curl_handle, CURLOPT_FORBID_REUSE, 1);\n curl_easy_setopt(curl_handle, CURLOPT_SSL_SESSIONID_CACHE, 0);\n\n UniquePtr<AuthzToken> token(\n authz_session_manager_->GetTokenCopy(pid, membership_));\n if (!token.IsValid()) {\n LogCvmfs(kLogAuthz, kLogDebug, \"failed to get authz token for pid %d\", pid);\n return false;\n }\n\n switch (token->type) {\n case kTokenBearer:\n \/\/ If it's a scitoken, then just go to the private\n \/\/ ConfigureSciTokenCurl function\n return ConfigureSciTokenCurl(curl_handle, *token, info_data);\n\n case kTokenX509:\n \/\/ The x509 code is below, so just break and go.\n break;\n\n default:\n \/\/ Oh no, don't know the the token type, throw error and return\n LogCvmfs(kLogAuthz, kLogDebug, \"unknown token type: %d\", token->type);\n return false;\n }\n\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA, NULL);\n\n \/\/ The calling layer is reusing data;\n if (*info_data) {\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA,\n static_cast<AuthzToken*>(*info_data)->data);\n return true;\n }\n\n\n int retval = curl_easy_setopt(curl_handle,\n CURLOPT_SSL_CTX_FUNCTION,\n CallbackSslCtx);\n if (retval != CURLE_OK) {\n LogCvmfs(kLogAuthz, kLogDebug, \"cannot configure curl ssl callback\");\n return false;\n }\n\n UniquePtr<sslctx_info> parm(new sslctx_info);\n\n STACK_OF(X509_INFO) *sk = NULL;\n STACK_OF(X509) *certstack = sk_X509_new_null();\n parm->chain = certstack;\n if (certstack == NULL) {\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"Failed to allocate new X509 chain.\");\n return false;\n }\n\n BIO *bio_token = BIO_new_mem_buf(token->data, token->size);\n assert(bio_token != NULL);\n sk = PEM_X509_INFO_read_bio(bio_token, NULL, NULL, NULL);\n BIO_free(bio_token);\n if (!sk) {\n LogOpenSSLErrors(\"Failed to load credential file.\");\n sk_X509_INFO_free(sk);\n sk_X509_free(certstack);\n return false;\n }\n\n while (sk_X509_INFO_num(sk)) {\n X509_INFO *xi = sk_X509_INFO_shift(sk);\n if (xi == NULL) {continue;}\n if (xi->x509 != NULL) {\n#ifdef OPENSSL_API_INTERFACE_V11\n retval = X509_up_ref(xi->x509);\n assert(retval == 1);\n#else\n CRYPTO_add(&xi->x509->references, 1, CRYPTO_LOCK_X509);\n#endif\n sk_X509_push(certstack, xi->x509);\n }\n if ((xi->x_pkey != NULL) && (xi->x_pkey->dec_pkey != NULL)) {\n parm->pkey = xi->x_pkey->dec_pkey;\n#ifdef OPENSSL_API_INTERFACE_V11\n retval = EVP_PKEY_up_ref(parm->pkey);\n assert(retval == 1);\n#else\n CRYPTO_add(&parm->pkey->references, 1, CRYPTO_LOCK_EVP_PKEY);\n#endif\n }\n X509_INFO_free(xi);\n }\n sk_X509_INFO_free(sk);\n\n if (parm->pkey == NULL) {\n \/\/ Sigh - PEM_X509_INFO_read doesn't understand old key encodings.\n \/\/ Try a more general-purpose funciton.\n BIO *bio_token = BIO_new_mem_buf(token->data, token->size);\n assert(bio_token != NULL);\n EVP_PKEY *old_pkey = PEM_read_bio_PrivateKey(bio_token, NULL, NULL, NULL);\n BIO_free(bio_token);\n if (old_pkey) {\n parm->pkey = old_pkey;\n } else {\n sk_X509_free(certstack);\n LogCvmfs(kLogAuthz, kLogSyslogErr,\n \"credential did not contain a decrypted private key.\");\n return false;\n }\n }\n\n if (!sk_X509_num(certstack)) {\n EVP_PKEY_free(parm->pkey);\n sk_X509_free(certstack);\n LogCvmfs(kLogAuthz, kLogSyslogErr,\n \"Credential file did not contain any actual credentials.\");\n return false;\n } else {\n LogCvmfs(kLogAuthz, kLogDebug, \"Certificate stack contains %d entries.\",\n sk_X509_num(certstack));\n }\n\n AuthzToken* to_return = new AuthzToken();\n to_return->type = kTokenX509;\n to_return->data = static_cast<void*>(parm.Release());\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA,\n static_cast<sslctx_info*>(to_return->data));\n *info_data = to_return;\n return true;\n}\n\n\nvoid AuthzAttachment::LogOpenSSLErrors(const char *top_message) {\n assert(ssl_strings_loaded_);\n char error_buf[1024];\n LogCvmfs(kLogAuthz, kLogSyslogWarn, \"%s\", top_message);\n unsigned long next_err; \/\/ NOLINT; this is the type expected by OpenSSL\n while ((next_err = ERR_get_error())) {\n ERR_error_string_n(next_err, error_buf, 1024);\n LogCvmfs(kLogAuthz, kLogSyslogErr, \"%s\", error_buf);\n }\n}\n\n\nvoid AuthzAttachment::ReleaseCurlHandle(CURL *curl_handle, void *info_data) {\n assert(info_data);\n\n AuthzToken* token = static_cast<AuthzToken*>(info_data);\n if (token->type == kTokenBearer) {\n \/\/ Compiler complains if we delete a void*\n bearer_info* bearer = static_cast<bearer_info*>(token->data);\n delete static_cast<char*>(bearer->token);\n curl_slist_free_all(bearer->list);\n delete static_cast<bearer_info*>(token->data);\n token->data = NULL;\n delete token;\n\n } else if (token->type == kTokenX509) {\n sslctx_info *p = static_cast<sslctx_info *>(info_data);\n STACK_OF(X509) *chain = p->chain;\n EVP_PKEY *pkey = p->pkey;\n p->chain = NULL;\n p->pkey = NULL;\n delete p;\n\n \/\/ Calls X509_free on each element, then frees the stack itself\n sk_X509_pop_free(chain, X509_free);\n EVP_PKEY_free(pkey);\n\n \/\/ Make sure that if CVMFS reuses this curl handle, curl doesn't try\n \/\/ to reuse cert chain we just freed.\n curl_easy_setopt(curl_handle, CURLOPT_SSL_CTX_DATA, 0);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/hw_access_def.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/\/\n\/\/\/ @file hw_access_def.H\n\/\/\/ @brief Hardware access definitions\n\/\/\/\n\n#ifndef FAPI2_HWACCESSDEF_H_\n#define FAPI2_HWACCESSDEF_H_\n\n#include <stdint.h>\n\n\/\/\/ @cond\ntypedef uint64_t spyId_t;\ntypedef uint64_t scanRingId_t;\n\/\/\/ @endcond\n\nnamespace fapi2\n{\n\/\/\/\n\/\/\/ @enum fapi2::ChipOpModifyMode\n\/\/\/ @brief Enumeration of modify modes used in HW access modify operations\n\/\/\/\nenum ChipOpModifyMode\n{\n CHIP_OP_MODIFY_MODE_OR = 1, \/\/\/< Modify or mode\n CHIP_OP_MODIFY_MODE_AND = 2, \/\/\/< Modify and mode\n CHIP_OP_MODIFY_MODE_XOR = 3, \/\/\/< Modify xor mode\n};\n\n\/\/\/\n\/\/\/ @enum fapi2::RingMode\n\/\/\/ @brief Enumeration of Ring access operation modes\n\/\/\/ This is a bitmap to allow the user to specify multiple modes.\n\/\/\/\nenum RingMode\n{\n RING_MODE_SET_PULSE = 0x00000001, \/\/\/< Set pulse\n RING_MODE_NO_HEADER_CHECK = 0x00000002, \/\/\/< Dont' check header\n \/\/ FUTURE_MODE = 0x00000004,\n \/\/ FUTURE_MODE = 0x00000008,\n};\n\n\/\/\/ @enum OpModes operational Mode Error Functions\nenum OpModes\n{\n \/\/ These are bit-masks in case they need to be or'd together\n NORMAL = 0x00,\n IGNORE_HW_ERROR = 0x01,\n DO_NOT_DO_WAKEUP = 0x02,\n};\n\n}\n\n#endif\n<commit_msg>Updates to the fapi2 putRing API<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/hwpf\/fapi2\/include\/hw_access_def.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2012,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\/\/\/\n\/\/\/ @file hw_access_def.H\n\/\/\/ @brief Hardware access definitions\n\/\/\/\n\n#ifndef FAPI2_HWACCESSDEF_H_\n#define FAPI2_HWACCESSDEF_H_\n\n#include <stdint.h>\n\n\/\/\/ @cond\ntypedef uint64_t spyId_t;\ntypedef uint64_t scanRingId_t;\n\/\/\/ @endcond\n\nnamespace fapi2\n{\n\/\/\/\n\/\/\/ @enum fapi2::ChipOpModifyMode\n\/\/\/ @brief Enumeration of modify modes used in HW access modify operations\n\/\/\/\nenum ChipOpModifyMode\n{\n CHIP_OP_MODIFY_MODE_OR = 1, \/\/\/< Modify or mode\n CHIP_OP_MODIFY_MODE_AND = 2, \/\/\/< Modify and mode\n CHIP_OP_MODIFY_MODE_XOR = 3, \/\/\/< Modify xor mode\n};\n\n\/\/\/\n\/\/\/ @enum fapi2::RingMode\n\/\/\/ @brief Enumeration of Ring access operation modes\n\/\/\/ This is a bitmap to allow the user to specify multiple modes.\n\/\/\/\nenum RingMode\n{\n RING_MODE_HEADER_CHECK = 0x00000000, \/\/\/< Check header\n RING_MODE_SET_PULSE = 0x00000001, \/\/\/< Set pulse\n RING_MODE_NO_HEADER_CHECK = 0x00000002, \/\/\/< Dont' check header\n \/\/ FUTURE_MODE = 0x00000004,\n \/\/ FUTURE_MODE = 0x00000008,\n};\n\n\/\/\/ @enum OpModes operational Mode Error Functions\nenum OpModes\n{\n \/\/ These are bit-masks in case they need to be or'd together\n NORMAL = 0x00,\n IGNORE_HW_ERROR = 0x01,\n DO_NOT_DO_WAKEUP = 0x02,\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m file generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\" the resulting full merkle tree is written to\\n\"\n\t\t\" the specified file\\n\"\n\t\t\"-f include sha-1 file hashes in the torrent\\n\"\n\t\t\" this helps supporting mixing sources from\\n\"\n\t\t\" other networks\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent. For multiple trackers, specify more\\n\"\n\t\t\" -t options\\n\"\n\t\t\"-C creator sets the created-by field to the specified string\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t\"-l Don't follow symlinks, instead encode them as\\n\"\n\t\t\" links in the torrent file\\n\"\n\t\t\"-o file specifies the output filename of the torrent file\\n\"\n\t\t\" If this is not specified, the torrent file is\\n\"\n\t\t\" printed to the standard out, except on windows\\n\"\n\t\t\" where the filename defaults to a.torrent\\n\"\n\t\t\"-c file add root certificate to the torrent, to verify\\n\"\n\t\t\" the HTTPS tracker\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tstd::string creator_str = \"libtorrent\";\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\t\tstd::string root_cert;\n\n\t\tstd::string outfile;\n\t\tstd::string merklefile;\n#ifdef TORRENT_WINDOWS\n\t\t\/\/ don't ever write binary data to the console on windows\n\t\t\/\/ it will just be interpreted as text and corrupted\n\t\toutfile = \"a.torrent\";\n#endif\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\t++i;\n\t\t\t\t\tmerklefile = argv[i];\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'o':\n\t\t\t\t\t++i;\n\t\t\t\t\toutfile = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'f':\n\t\t\t\t\tflags |= create_torrent::calculate_file_hashes;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'l':\n\t\t\t\t\tflags |= create_torrent::symlinks;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\t++i;\n\t\t\t\t\tcreator_str = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'c':\n\t\t\t\t\t++i;\n\t\t\t\t\troot_cert = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter, flags);\n\t\tif (fs.num_files() == 0)\n\t\t{\n\t\t\tfputs(\"no files specified.\\n\", stderr);\n\t\t\treturn 1;\n\t\t}\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tint tier = 0;\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i, ++tier)\n\t\t\tt.add_tracker(*i, tier);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str.c_str());\n\n\t\tif (!root_cert.empty())\n\t\t{\n\t\t\tstd::vector<char> pem;\n\t\t\tload_file(root_cert, pem, ec, 10000);\n\t\t\tif (ec)\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"failed to load root certificate for tracker: %s\\n\", ec.message().c_str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tt.set_root_cert(std::string(&pem[0], pem.size()));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tFILE* output = stdout;\n\t\tif (!outfile.empty())\n\t\t\toutput = fopen(outfile.c_str(), \"wb+\");\n\t\tif (output == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"failed to open file \\\"%s\\\": (%d) %s\\n\"\n\t\t\t\t, outfile.c_str(), errno, strerror(errno));\n\t\t\treturn 1;\n\t\t}\n\t\tfwrite(&torrent[0], 1, torrent.size(), output);\n\n\t\tif (output != stdout)\n\t\t\tfclose(output);\n\n\t\tif (!merklefile.empty())\n\t\t{\n\t\t\toutput = fopen(merklefile.c_str(), \"wb+\");\n\t\t\tint ret = fwrite(&t.merkle_tree()[0], 20, t.merkle_tree().size(), output);\n\t\t\tif (ret != t.merkle_tree().size() * 20)\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"failed to write %s: (%d) %s\\n\"\n\t\t\t\t\t, merklefile.c_str(), errno, strerror(errno));\n\t\t\t}\n\t\t\tfclose(output);\n\t\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<commit_msg>support setting comment in make_torrent example<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m file generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\" the resulting full merkle tree is written to\\n\"\n\t\t\" the specified file\\n\"\n\t\t\"-f include sha-1 file hashes in the torrent\\n\"\n\t\t\" this helps supporting mixing sources from\\n\"\n\t\t\" other networks\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent. For multiple trackers, specify more\\n\"\n\t\t\" -t options\\n\"\n\t\t\"-c comment sets the comment to the specified string\\n\"\n\t\t\"-C creator sets the created-by field to the specified string\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t\"-l Don't follow symlinks, instead encode them as\\n\"\n\t\t\" links in the torrent file\\n\"\n\t\t\"-o file specifies the output filename of the torrent file\\n\"\n\t\t\" If this is not specified, the torrent file is\\n\"\n\t\t\" printed to the standard out, except on windows\\n\"\n\t\t\" where the filename defaults to a.torrent\\n\"\n\t\t\"-r file add root certificate to the torrent, to verify\\n\"\n\t\t\" the HTTPS tracker\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tstd::string creator_str = \"libtorrent\";\n\tstd::string comment_str;\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\t\tstd::string root_cert;\n\n\t\tstd::string outfile;\n\t\tstd::string merklefile;\n#ifdef TORRENT_WINDOWS\n\t\t\/\/ don't ever write binary data to the console on windows\n\t\t\/\/ it will just be interpreted as text and corrupted\n\t\toutfile = \"a.torrent\";\n#endif\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\t++i;\n\t\t\t\t\tmerklefile = argv[i];\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'o':\n\t\t\t\t\t++i;\n\t\t\t\t\toutfile = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'f':\n\t\t\t\t\tflags |= create_torrent::calculate_file_hashes;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'l':\n\t\t\t\t\tflags |= create_torrent::symlinks;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'C':\n\t\t\t\t\t++i;\n\t\t\t\t\tcreator_str = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'c':\n\t\t\t\t\t++i;\n\t\t\t\t\tcomment_str = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'r':\n\t\t\t\t\t++i;\n\t\t\t\t\troot_cert = argv[i];\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter, flags);\n\t\tif (fs.num_files() == 0)\n\t\t{\n\t\t\tfputs(\"no files specified.\\n\", stderr);\n\t\t\treturn 1;\n\t\t}\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tint tier = 0;\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i, ++tier)\n\t\t\tt.add_tracker(*i, tier);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str.c_str());\n\t\tif (!comment_str.empty())\n\t\t\tt.set_comment(comment_str.c_str());\n\n\t\tif (!root_cert.empty())\n\t\t{\n\t\t\tstd::vector<char> pem;\n\t\t\tload_file(root_cert, pem, ec, 10000);\n\t\t\tif (ec)\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"failed to load root certificate for tracker: %s\\n\", ec.message().c_str());\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tt.set_root_cert(std::string(&pem[0], pem.size()));\n\t\t\t}\n\t\t}\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tFILE* output = stdout;\n\t\tif (!outfile.empty())\n\t\t\toutput = fopen(outfile.c_str(), \"wb+\");\n\t\tif (output == NULL)\n\t\t{\n\t\t\tfprintf(stderr, \"failed to open file \\\"%s\\\": (%d) %s\\n\"\n\t\t\t\t, outfile.c_str(), errno, strerror(errno));\n\t\t\treturn 1;\n\t\t}\n\t\tfwrite(&torrent[0], 1, torrent.size(), output);\n\n\t\tif (output != stdout)\n\t\t\tfclose(output);\n\n\t\tif (!merklefile.empty())\n\t\t{\n\t\t\toutput = fopen(merklefile.c_str(), \"wb+\");\n\t\t\tint ret = fwrite(&t.merkle_tree()[0], 20, t.merkle_tree().size(), output);\n\t\t\tif (ret != t.merkle_tree().size() * 20)\n\t\t\t{\n\t\t\t\tfprintf(stderr, \"failed to write %s: (%d) %s\\n\"\n\t\t\t\t\t, merklefile.c_str(), errno, strerror(errno));\n\t\t\t}\n\t\t\tfclose(output);\n\t\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: skeletonjava.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: jsc $ $Date: 2005-09-09 13:50:35 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _UNO_DEVTOOLS_SKELETONJAVA_HXX_\n#define _UNO_DEVTOOLS_SKELETONJAVA_HXX_\n\n#include <fstream>\n\n#ifndef _CODEMAKER_GENERATEDTYPESET_HXX_\n#include <codemaker\/generatedtypeset.hxx>\n#endif\n#ifndef _UNO_DEVTOOLS_SKELETONCOMMON_HXX_\n#include \"skeletoncommon.hxx\"\n#endif\n\nnamespace skeletonmaker { namespace java {\n\nvoid printType(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n codemaker::UnoType::Sort sort, RTTypeClass typeClass,\n rtl::OString const & name, sal_Int32 rank,\n std::vector< rtl::OString > const & arguments,\n bool referenceType, bool defaultvalue=false);\n\nvoid printType(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n rtl::OString const & type, bool referenceType,\n bool defaultvalue=false);\n\nbool printConstructorParameters(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n typereg::Reader const & outerReader,\n std::vector< rtl::OString > const & arguments);\n\nvoid printConstructor(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n typereg::Reader const & reader,\n std::vector< rtl::OString > const & arguments);\n\nvoid printMethodParameters(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n sal_uInt16 method, bool previous,\n bool withtype,\n bool shortname=false);\n\nvoid printExceptionSpecification(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n sal_uInt16 method);\n\nvoid printMethods(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n typereg::Reader const & reader,\n codemaker::GeneratedTypeSet & generated,\n rtl::OString const & delegate,\n rtl::OString const & indentation=rtl::OString(),\n bool defaultvalue=false,\n bool usepropertymixin=false);\n\nvoid printConstructionMethods(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader);\n\nvoid printServiceMembers(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n rtl::OString const & type,\n rtl::OString const & delegate);\n\nvoid printMapsToJavaType(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n codemaker::UnoType::Sort sort,\n RTTypeClass typeClass,\n rtl::OString const & name, sal_Int32 rank,\n std::vector< rtl::OString > const & arguments,\n const char * javaTypeSort);\n\nvoid generateDocumentation(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n rtl::OString const & type,\n rtl::OString const & delegate);\n\nvoid generateSkeleton(ProgramOptions const & options, TypeManager const & manager, std::vector< rtl::OString > const & types, rtl::OString const & delegate);\n\n} }\n\n#endif \/\/ _UNO_DEVTOOLS_SKELETONJAVA_HXX_\n\n<commit_msg>INTEGRATION: CWS jsc3 (1.3.6); FILE MERGED 2006\/01\/20 13:08:41 jsc 1.3.6.1: #i56247# unify include guards<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: skeletonjava.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: vg $ $Date: 2006-03-15 09:20:45 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef INCLUDED_UNODEVTOOLS_SKELETONJAVA_HXX\n#define INCLUDED_UNODEVTOOLS_SKELETONJAVA_HXX\n\n#include <fstream>\n\n#ifndef INCLUDED_CODEMAKER_GENERATEDTYPESET_HXX\n#include \"codemaker\/generatedtypeset.hxx\"\n#endif\n#ifndef INCLUDED_UNODEVTOOLS_SOURCE_SKELETONMAKER_SKELETONCOMMON_HXX\n#include \"skeletoncommon.hxx\"\n#endif\n\nnamespace skeletonmaker { namespace java {\n\nvoid printType(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n codemaker::UnoType::Sort sort, RTTypeClass typeClass,\n rtl::OString const & name, sal_Int32 rank,\n std::vector< rtl::OString > const & arguments,\n bool referenceType, bool defaultvalue=false);\n\nvoid printType(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n rtl::OString const & type, bool referenceType,\n bool defaultvalue=false);\n\nbool printConstructorParameters(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n typereg::Reader const & outerReader,\n std::vector< rtl::OString > const & arguments);\n\nvoid printConstructor(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n typereg::Reader const & reader,\n std::vector< rtl::OString > const & arguments);\n\nvoid printMethodParameters(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n sal_uInt16 method, bool previous,\n bool withtype,\n bool shortname=false);\n\nvoid printExceptionSpecification(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n sal_uInt16 method);\n\nvoid printMethods(std::ostream & o,\n ProgramOptions const & options, TypeManager const & manager,\n typereg::Reader const & reader,\n codemaker::GeneratedTypeSet & generated,\n rtl::OString const & delegate,\n rtl::OString const & indentation=rtl::OString(),\n bool defaultvalue=false,\n bool usepropertymixin=false);\n\nvoid printConstructionMethods(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader);\n\nvoid printServiceMembers(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n typereg::Reader const & reader,\n rtl::OString const & type,\n rtl::OString const & delegate);\n\nvoid printMapsToJavaType(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n codemaker::UnoType::Sort sort,\n RTTypeClass typeClass,\n rtl::OString const & name, sal_Int32 rank,\n std::vector< rtl::OString > const & arguments,\n const char * javaTypeSort);\n\nvoid generateDocumentation(std::ostream & o,\n ProgramOptions const & options,\n TypeManager const & manager,\n rtl::OString const & type,\n rtl::OString const & delegate);\n\nvoid generateSkeleton(ProgramOptions const & options, TypeManager const & manager, std::vector< rtl::OString > const & types, rtl::OString const & delegate);\n\n} }\n\n#endif \/\/ INCLUDED_UNODEVTOOLS_SKELETONJAVA_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2006, Industrial Light & Magic, a division of Lucas\n\/\/ Digital Ltd. LLC\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Industrial Light & Magic nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission. \n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/\n\/\/\tRun a set of CTL transforms to generate a color lookup table.\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include <ctlToLut.h>\n\n#if HAVE_CTL_INTERPRETER\n\n #include <ImfCtlApplyTransforms.h>\n #include <CtlSimdInterpreter.h>\n #include <ImfStandardAttributes.h>\n #include <ImfHeader.h>\n #include <stdlib.h>\n #include <ImfFrameBuffer.h>\n #include <cassert>\n #include <iostream>\n\n using namespace std;\n using namespace Ctl;\n using namespace Imf;\n using namespace Imath;\n\n#else\n\n #include <ImfStandardAttributes.h>\n #include <ImfHeader.h>\n #include <stdlib.h>\n #include <cassert>\n #include <iostream>\n\n using namespace std;\n using namespace Imf;\n using namespace Imath;\n\n#endif\n\n\n#define WARNING(message) (cerr << \"Warning: \" << message << endl)\n\n\nfloat\ndisplayVideoGamma ()\n{\n \/\/\n \/\/ Get the display's video gamma from an environment variable.\n \/\/ If this fails, use a default value (1\/2.2).\n \/\/\n\n const char gammaEnv[] = \"EXR_DISPLAY_VIDEO_GAMMA\";\n float g = 2.2f;\n\n if (const char *gamma = getenv (gammaEnv))\n {\n\tfloat tmp;\n\tint n = sscanf (gamma, \" %f\", &tmp);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" << gammaEnv << \"; \"\n\t\t \"using default value (\" << g << \").\");\n\telse if (tmp < 1.f)\n\t WARNING (\"Display video gamma, specified in environment \"\n\t\t \"variable \" << gammaEnv << \" is out of range; \"\n\t\t \"using default value (\" << g << \").\");\n\telse\n\t g = tmp;\n }\n else\n {\n\t WARNING (\"Environment variable \" << gammaEnv << \" is not set; \"\n\t\t \"using default value (\" << g << \").\");\n }\n\n return 1.f \/ g;\n}\n\n\n#if HAVE_CTL_INTERPRETER\n\nnamespace {\n\nvoid\ninitializeEnvHeader (Header &envHeader)\n{\n \/\/\n \/\/ Initialize the \"environment header\" for the CTL\n \/\/ transforms by adding displayChromaticities,\n \/\/ displayWhiteLuminance and displaySurroundLuminance\n \/\/ attributes.\n \/\/\n\n \/\/\n \/\/ Get the chromaticities of the display's primaries and\n \/\/ white point from an environment variable. If this fails,\n \/\/ assume chromaticities according to Rec. ITU-R BT.709.\n \/\/\n\n static const char chromaticitiesEnv[] = \"CTL_DISPLAY_CHROMATICITIES\";\n Chromaticities c; \/\/ default-initialized according to Rec. 709\n\n if (const char *chromaticities = getenv (chromaticitiesEnv))\n {\n\tChromaticities tmp;\n\n\tint n = sscanf (chromaticities,\n\t\t\t\" red %f %f green %f %f blue %f %f white %f %f\",\n\t\t\t&tmp.red.x, &tmp.red.y,\n\t\t\t&tmp.green.x, &tmp.green.y,\n\t\t\t&tmp.blue.x, &tmp.blue.y,\n\t\t\t&tmp.white.x, &tmp.white.y);\n\n\tif (n == 8)\n\t c = tmp;\n\telse\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t chromaticitiesEnv << \"; using default value \"\n\t\t \"(chromaticities according to Rec. ITU-R BT.709).\");\n }\n else\n {\n\tWARNING (\"Environment variable \" << chromaticitiesEnv << \" is \"\n\t\t \"not set; using default value (chromaticities according \"\n\t\t \"to Rec. ITU-R BT.709).\");\n }\n\n envHeader.insert (\"displayChromaticities\", ChromaticitiesAttribute (c));\n\n \/\/\n \/\/ Get the display's white luminance from an environment variable.\n \/\/ If this fails, assume 120 candelas per square meter.\n \/\/ (Screen aim luminance according to SMPTE RP 166.)\n \/\/\n\n static const char whiteLuminanceEnv[] = \"CTL_DISPLAY_WHITE_LUMINANCE\";\n static const float whiteLuminanceDefault = 120.0;\n float wl = whiteLuminanceDefault;\n\n if (const char *whiteLuminance = getenv (whiteLuminanceEnv))\n {\n\tint n = sscanf (whiteLuminance, \" %f\", &wl);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t whiteLuminanceEnv << \"; using default value \"\n\t\t \"(\" << wl << \" candelas per square meter).\");\n }\n else\n {\n\t WARNING (\"Environment variable \" << whiteLuminanceEnv << \" is \"\n\t\t \"is not set; using default value (\" << wl << \" candelas \"\n\t\t \"per square meter).\");\n }\n\n envHeader.insert (\"displayWhiteLuminance\", FloatAttribute (wl));\n\n \/\/\n \/\/ Get the display's surround luminance from an environment variable.\n \/\/ If this fails, assume 10% of the display's white luminance.\n \/\/ (Recommended setup according to SMPTE RP 166.)\n \/\/\n\n static const char surroundLuminanceEnv[] = \"CTL_DISPLAY_SURROUND_LUMINANCE\";\n float sl = wl * 0.1f;\n\n if (const char *surroundLuminance = getenv (surroundLuminanceEnv))\n {\n\tint n = sscanf (surroundLuminance, \" %f\", &sl);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t surroundLuminanceEnv << \"; using default value \"\n\t\t \"(\" << sl << \" candelas per square meter).\");\n }\n else\n {\n\t WARNING (\"Environment variable \" << surroundLuminanceEnv << \" is \"\n\t\t \"is not set; using default value (\" << sl << \" candelas \"\n\t\t \"per square meter).\");\n }\n\n envHeader.insert (\"displaySurroundLuminance\", FloatAttribute (sl));\n}\n\n\nstring\ndisplayTransformName ()\n{\n \/\/\n \/\/ Get the name of the display transform from an environment\n \/\/ variable. If this fails, use a default name.\n \/\/\n\n static const char displayTransformEnv[] = \"CTL_DISPLAY_TRANSFORM\";\n static const char displayTransformDefault[] = \"transform_display_video\";\n const char *displayTransform = getenv (displayTransformEnv);\n\n if (!displayTransform)\n {\n\tdisplayTransform = displayTransformDefault;\n\n\tWARNING (\"Environment variable \" << displayTransformEnv << \" \"\n\t\t \"is not set; using default value \"\n\t\t \"(\\\"\" << displayTransform << \"\\\").\");\n }\n\n return displayTransform;\n}\n\n} \/\/ namespace\n\n\nvoid\nctlToLut (vector<string> transformNames,\n\t Header inHeader,\n\t size_t lutSize,\n\t const half pixelValues[\/*lutSize*\/],\n\t half lut[\/*lutSize*\/])\n{\n \/\/\n \/\/ If we do not have an explicit set of transform names\n \/\/ then find suitable look modification, rendering and\n \/\/ display transforms.\n \/\/\n\n if (transformNames.empty())\n {\n\tif (hasLookModTransform (inHeader))\n\t transformNames.push_back (lookModTransform (inHeader));\n\n\tif (hasRenderingTransform (inHeader))\n\t transformNames.push_back (renderingTransform (inHeader));\n\telse\n\t transformNames.push_back (\"transform_RRT\");\n\n\ttransformNames.push_back (displayTransformName());\n }\n\n \/\/\n \/\/ Initialize an input and an environment header:\n \/\/ Make sure that the headers contain information about the primaries\n \/\/ and the white point of the image files an the display, and about\n \/\/ the display's white luminance and surround luminance.\n \/\/\n\n Header envHeader;\n Header outHeader;\n\n if (!hasChromaticities (inHeader))\n\taddChromaticities (inHeader, Chromaticities());\n\n if (!hasAdoptedNeutral (inHeader))\n\taddAdoptedNeutral (inHeader, chromaticities(inHeader).white);\n\n initializeEnvHeader (envHeader);\n\n \/\/\n \/\/ Set up input and output FrameBuffer objects for the CTL transforms.\n \/\/\n\n assert (lutSize % 4 == 0);\n\n FrameBuffer inFb;\n\n inFb.insert (\"R\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t (char *)pixelValues,\t\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n inFb.insert (\"G\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t(char *)(pixelValues + 1),\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n inFb.insert (\"B\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t(char *)(pixelValues + 2),\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n FrameBuffer outFb;\n\n outFb.insert (\"R_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)lut,\t\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n outFb.insert (\"G_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)(lut + 1),\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n outFb.insert (\"B_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)(lut + 2),\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n \/\/\n \/\/ Run the CTL transforms.\n \/\/\n\n SimdInterpreter interpreter;\n\n #ifdef CTL_MODULE_BASE_PATH\n\n\t\/\/\n\t\/\/ The configuration scripts has defined a default\n\t\/\/ location for CTL modules. Include this location\n\t\/\/ in the CTL module search path.\n\t\/\/\n\n\tvector<string> paths = interpreter.modulePaths();\n\tpaths.push_back (CTL_MODULE_BASE_PATH);\n\tinterpreter.setModulePaths (paths);\n\n #endif\n\n ImfCtl::applyTransforms (interpreter,\n\t\t\t transformNames,\n\t\t\t Box2i (V2i (0, 0), V2i (lutSize \/ 4 - 1, 0)),\n\t\t\t envHeader,\n\t\t\t inHeader,\n\t\t\t inFb,\n\t\t\t outHeader,\n\t\t\t outFb);\n}\n\n\n#else\n\n#include <ImfStandardAttributes.h>\n#include <ImfHeader.h>\n#include <cassert>\n#include <iostream>\n\n\nusing namespace std;\nusing namespace Imf;\nusing namespace Imath;\n\n\n#define WARNING(message) (cerr << \"Warning: \" << message << endl)\n\n\nvoid\nctlToLut (vector<string> transformNames,\n\t Header inHeader,\n\t size_t lutSize,\n\t const half pixelValues[\/*lutSize*\/],\n\t half lut[\/*lutSize*\/])\n{\n \/\/\n \/\/ This program has been compiled without CTL support.\n \/\/\n \/\/ Our fallback solution is to build a lookup table that\n \/\/ performs a coordinate transform from the primaries and\n \/\/ white point of the input files to the primaries and\n \/\/ white point of the display.\n \/\/\n\n \/\/\n \/\/ Get the input file chromaticities\n \/\/\n\n Chromaticities fileChroma;\n\n if (hasChromaticities (inHeader))\n\tfileChroma = chromaticities (inHeader);\n\n \/\/\n \/\/ Get the display chromaticities\n \/\/\n\n static const char chromaticitiesEnv[] = \"CTL_DISPLAY_CHROMATICITIES\";\n Chromaticities displayChroma;\n\n if (const char *chromaticities = getenv (chromaticitiesEnv))\n {\n\tChromaticities tmp;\n\n\tint n = sscanf (chromaticities,\n\t\t\t\" red %f %f green %f %f blue %f %f white %f %f\",\n\t\t\t&tmp.red.x, &tmp.red.y,\n\t\t\t&tmp.green.x, &tmp.green.y,\n\t\t\t&tmp.blue.x, &tmp.blue.y,\n\t\t\t&tmp.white.x, &tmp.white.y);\n\n\tif (n == 8)\n\t displayChroma = tmp;\n\telse\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t chromaticitiesEnv << \"; using default value \"\n\t\t \"(chromaticities according to Rec. ITU-R BT.709).\");\n }\n else\n {\n\tWARNING (\"Environment variable \" << chromaticitiesEnv << \" is \"\n\t\t \"not set; using default value (chromaticities according \"\n\t\t \"to Rec. ITU-R BT.709).\");\n }\n\n \/\/\n \/\/ Do the coordinate transform\n \/\/\n\n M44f M = RGBtoXYZ (fileChroma, 1) * XYZtoRGB (displayChroma, 1);\n\n assert (lutSize % 4 == 0);\n\n for (int i = 0; i < lutSize; i += 4)\n {\n\tV3f rgb (pixelValues[i], pixelValues[i + 1], pixelValues[i + 2]);\n\trgb = rgb * M;\n\n\tlut[i + 0] = rgb[0];\n\tlut[i + 1] = rgb[1];\n\tlut[i + 2] = rgb[2];\n\tlut[i + 3] = 0;\n }\n}\n\n#endif\n<commit_msg>Fix for gcc-4.4 - Cg enabled build<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2006, Industrial Light & Magic, a division of Lucas\n\/\/ Digital Ltd. LLC\n\/\/ \n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Industrial Light & Magic nor the names of\n\/\/ its contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission. \n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/-----------------------------------------------------------------------------\n\/\/\n\/\/\tRun a set of CTL transforms to generate a color lookup table.\n\/\/\n\/\/-----------------------------------------------------------------------------\n\n#include <stdio.h>\n#include <ctlToLut.h>\n\n#if HAVE_CTL_INTERPRETER\n\n #include <ImfCtlApplyTransforms.h>\n #include <CtlSimdInterpreter.h>\n #include <ImfStandardAttributes.h>\n #include <ImfHeader.h>\n #include <stdlib.h>\n #include <ImfFrameBuffer.h>\n #include <cassert>\n #include <iostream>\n\n using namespace std;\n using namespace Ctl;\n using namespace Imf;\n using namespace Imath;\n\n#else\n\n #include <ImfStandardAttributes.h>\n #include <ImfHeader.h>\n #include <stdlib.h>\n #include <cassert>\n #include <iostream>\n\n using namespace std;\n using namespace Imf;\n using namespace Imath;\n\n#endif\n\n\n#define WARNING(message) (cerr << \"Warning: \" << message << endl)\n\n\nfloat\ndisplayVideoGamma ()\n{\n \/\/\n \/\/ Get the display's video gamma from an environment variable.\n \/\/ If this fails, use a default value (1\/2.2).\n \/\/\n\n const char gammaEnv[] = \"EXR_DISPLAY_VIDEO_GAMMA\";\n float g = 2.2f;\n\n if (const char *gamma = getenv (gammaEnv))\n {\n\tfloat tmp;\n\tint n = sscanf (gamma, \" %f\", &tmp);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" << gammaEnv << \"; \"\n\t\t \"using default value (\" << g << \").\");\n\telse if (tmp < 1.f)\n\t WARNING (\"Display video gamma, specified in environment \"\n\t\t \"variable \" << gammaEnv << \" is out of range; \"\n\t\t \"using default value (\" << g << \").\");\n\telse\n\t g = tmp;\n }\n else\n {\n\t WARNING (\"Environment variable \" << gammaEnv << \" is not set; \"\n\t\t \"using default value (\" << g << \").\");\n }\n\n return 1.f \/ g;\n}\n\n\n#if HAVE_CTL_INTERPRETER\n\nnamespace {\n\nvoid\ninitializeEnvHeader (Header &envHeader)\n{\n \/\/\n \/\/ Initialize the \"environment header\" for the CTL\n \/\/ transforms by adding displayChromaticities,\n \/\/ displayWhiteLuminance and displaySurroundLuminance\n \/\/ attributes.\n \/\/\n\n \/\/\n \/\/ Get the chromaticities of the display's primaries and\n \/\/ white point from an environment variable. If this fails,\n \/\/ assume chromaticities according to Rec. ITU-R BT.709.\n \/\/\n\n static const char chromaticitiesEnv[] = \"CTL_DISPLAY_CHROMATICITIES\";\n Chromaticities c; \/\/ default-initialized according to Rec. 709\n\n if (const char *chromaticities = getenv (chromaticitiesEnv))\n {\n\tChromaticities tmp;\n\n\tint n = sscanf (chromaticities,\n\t\t\t\" red %f %f green %f %f blue %f %f white %f %f\",\n\t\t\t&tmp.red.x, &tmp.red.y,\n\t\t\t&tmp.green.x, &tmp.green.y,\n\t\t\t&tmp.blue.x, &tmp.blue.y,\n\t\t\t&tmp.white.x, &tmp.white.y);\n\n\tif (n == 8)\n\t c = tmp;\n\telse\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t chromaticitiesEnv << \"; using default value \"\n\t\t \"(chromaticities according to Rec. ITU-R BT.709).\");\n }\n else\n {\n\tWARNING (\"Environment variable \" << chromaticitiesEnv << \" is \"\n\t\t \"not set; using default value (chromaticities according \"\n\t\t \"to Rec. ITU-R BT.709).\");\n }\n\n envHeader.insert (\"displayChromaticities\", ChromaticitiesAttribute (c));\n\n \/\/\n \/\/ Get the display's white luminance from an environment variable.\n \/\/ If this fails, assume 120 candelas per square meter.\n \/\/ (Screen aim luminance according to SMPTE RP 166.)\n \/\/\n\n static const char whiteLuminanceEnv[] = \"CTL_DISPLAY_WHITE_LUMINANCE\";\n static const float whiteLuminanceDefault = 120.0;\n float wl = whiteLuminanceDefault;\n\n if (const char *whiteLuminance = getenv (whiteLuminanceEnv))\n {\n\tint n = sscanf (whiteLuminance, \" %f\", &wl);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t whiteLuminanceEnv << \"; using default value \"\n\t\t \"(\" << wl << \" candelas per square meter).\");\n }\n else\n {\n\t WARNING (\"Environment variable \" << whiteLuminanceEnv << \" is \"\n\t\t \"is not set; using default value (\" << wl << \" candelas \"\n\t\t \"per square meter).\");\n }\n\n envHeader.insert (\"displayWhiteLuminance\", FloatAttribute (wl));\n\n \/\/\n \/\/ Get the display's surround luminance from an environment variable.\n \/\/ If this fails, assume 10% of the display's white luminance.\n \/\/ (Recommended setup according to SMPTE RP 166.)\n \/\/\n\n static const char surroundLuminanceEnv[] = \"CTL_DISPLAY_SURROUND_LUMINANCE\";\n float sl = wl * 0.1f;\n\n if (const char *surroundLuminance = getenv (surroundLuminanceEnv))\n {\n\tint n = sscanf (surroundLuminance, \" %f\", &sl);\n\n\tif (n != 1)\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t surroundLuminanceEnv << \"; using default value \"\n\t\t \"(\" << sl << \" candelas per square meter).\");\n }\n else\n {\n\t WARNING (\"Environment variable \" << surroundLuminanceEnv << \" is \"\n\t\t \"is not set; using default value (\" << sl << \" candelas \"\n\t\t \"per square meter).\");\n }\n\n envHeader.insert (\"displaySurroundLuminance\", FloatAttribute (sl));\n}\n\n\nstring\ndisplayTransformName ()\n{\n \/\/\n \/\/ Get the name of the display transform from an environment\n \/\/ variable. If this fails, use a default name.\n \/\/\n\n static const char displayTransformEnv[] = \"CTL_DISPLAY_TRANSFORM\";\n static const char displayTransformDefault[] = \"transform_display_video\";\n const char *displayTransform = getenv (displayTransformEnv);\n\n if (!displayTransform)\n {\n\tdisplayTransform = displayTransformDefault;\n\n\tWARNING (\"Environment variable \" << displayTransformEnv << \" \"\n\t\t \"is not set; using default value \"\n\t\t \"(\\\"\" << displayTransform << \"\\\").\");\n }\n\n return displayTransform;\n}\n\n} \/\/ namespace\n\n\nvoid\nctlToLut (vector<string> transformNames,\n\t Header inHeader,\n\t size_t lutSize,\n\t const half pixelValues[\/*lutSize*\/],\n\t half lut[\/*lutSize*\/])\n{\n \/\/\n \/\/ If we do not have an explicit set of transform names\n \/\/ then find suitable look modification, rendering and\n \/\/ display transforms.\n \/\/\n\n if (transformNames.empty())\n {\n\tif (hasLookModTransform (inHeader))\n\t transformNames.push_back (lookModTransform (inHeader));\n\n\tif (hasRenderingTransform (inHeader))\n\t transformNames.push_back (renderingTransform (inHeader));\n\telse\n\t transformNames.push_back (\"transform_RRT\");\n\n\ttransformNames.push_back (displayTransformName());\n }\n\n \/\/\n \/\/ Initialize an input and an environment header:\n \/\/ Make sure that the headers contain information about the primaries\n \/\/ and the white point of the image files an the display, and about\n \/\/ the display's white luminance and surround luminance.\n \/\/\n\n Header envHeader;\n Header outHeader;\n\n if (!hasChromaticities (inHeader))\n\taddChromaticities (inHeader, Chromaticities());\n\n if (!hasAdoptedNeutral (inHeader))\n\taddAdoptedNeutral (inHeader, chromaticities(inHeader).white);\n\n initializeEnvHeader (envHeader);\n\n \/\/\n \/\/ Set up input and output FrameBuffer objects for the CTL transforms.\n \/\/\n\n assert (lutSize % 4 == 0);\n\n FrameBuffer inFb;\n\n inFb.insert (\"R\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t (char *)pixelValues,\t\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n inFb.insert (\"G\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t(char *)(pixelValues + 1),\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n inFb.insert (\"B\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t(char *)(pixelValues + 2),\t\/\/ base\n\t\t\t4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t0));\t\t\t\t\/\/ yStride\n\n FrameBuffer outFb;\n\n outFb.insert (\"R_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)lut,\t\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n outFb.insert (\"G_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)(lut + 1),\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n outFb.insert (\"B_display\",\n\t\t Slice (HALF,\t\t\t\t\/\/ type\n\t\t\t (char *)(lut + 2),\t\t\/\/ base\n\t\t\t 4 * sizeof (half),\t\t\/\/ xStride\n\t\t\t 0));\t\t\t\t\/\/ yStride\n\n \/\/\n \/\/ Run the CTL transforms.\n \/\/\n\n SimdInterpreter interpreter;\n\n #ifdef CTL_MODULE_BASE_PATH\n\n\t\/\/\n\t\/\/ The configuration scripts has defined a default\n\t\/\/ location for CTL modules. Include this location\n\t\/\/ in the CTL module search path.\n\t\/\/\n\n\tvector<string> paths = interpreter.modulePaths();\n\tpaths.push_back (CTL_MODULE_BASE_PATH);\n\tinterpreter.setModulePaths (paths);\n\n #endif\n\n ImfCtl::applyTransforms (interpreter,\n\t\t\t transformNames,\n\t\t\t Box2i (V2i (0, 0), V2i (lutSize \/ 4 - 1, 0)),\n\t\t\t envHeader,\n\t\t\t inHeader,\n\t\t\t inFb,\n\t\t\t outHeader,\n\t\t\t outFb);\n}\n\n\n#else\n\n#include <ImfStandardAttributes.h>\n#include <ImfHeader.h>\n#include <cassert>\n#include <iostream>\n\n\nusing namespace std;\nusing namespace Imf;\nusing namespace Imath;\n\n\n#define WARNING(message) (cerr << \"Warning: \" << message << endl)\n\n\nvoid\nctlToLut (vector<string> transformNames,\n\t Header inHeader,\n\t size_t lutSize,\n\t const half pixelValues[\/*lutSize*\/],\n\t half lut[\/*lutSize*\/])\n{\n \/\/\n \/\/ This program has been compiled without CTL support.\n \/\/\n \/\/ Our fallback solution is to build a lookup table that\n \/\/ performs a coordinate transform from the primaries and\n \/\/ white point of the input files to the primaries and\n \/\/ white point of the display.\n \/\/\n\n \/\/\n \/\/ Get the input file chromaticities\n \/\/\n\n Chromaticities fileChroma;\n\n if (hasChromaticities (inHeader))\n\tfileChroma = chromaticities (inHeader);\n\n \/\/\n \/\/ Get the display chromaticities\n \/\/\n\n static const char chromaticitiesEnv[] = \"CTL_DISPLAY_CHROMATICITIES\";\n Chromaticities displayChroma;\n\n if (const char *chromaticities = getenv (chromaticitiesEnv))\n {\n\tChromaticities tmp;\n\n\tint n = sscanf (chromaticities,\n\t\t\t\" red %f %f green %f %f blue %f %f white %f %f\",\n\t\t\t&tmp.red.x, &tmp.red.y,\n\t\t\t&tmp.green.x, &tmp.green.y,\n\t\t\t&tmp.blue.x, &tmp.blue.y,\n\t\t\t&tmp.white.x, &tmp.white.y);\n\n\tif (n == 8)\n\t displayChroma = tmp;\n\telse\n\t WARNING (\"Cannot parse environment variable \" <<\n\t\t chromaticitiesEnv << \"; using default value \"\n\t\t \"(chromaticities according to Rec. ITU-R BT.709).\");\n }\n else\n {\n\tWARNING (\"Environment variable \" << chromaticitiesEnv << \" is \"\n\t\t \"not set; using default value (chromaticities according \"\n\t\t \"to Rec. ITU-R BT.709).\");\n }\n\n \/\/\n \/\/ Do the coordinate transform\n \/\/\n\n M44f M = RGBtoXYZ (fileChroma, 1) * XYZtoRGB (displayChroma, 1);\n\n assert (lutSize % 4 == 0);\n\n for (int i = 0; i < lutSize; i += 4)\n {\n\tV3f rgb (pixelValues[i], pixelValues[i + 1], pixelValues[i + 2]);\n\trgb = rgb * M;\n\n\tlut[i + 0] = rgb[0];\n\tlut[i + 1] = rgb[1];\n\tlut[i + 2] = rgb[2];\n\tlut[i + 3] = 0;\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"precomp.h\"\n\n#include \"internal\/common.h\"\n#include \"internal\/enums.h\"\n#include \"internal\/node.h\"\n#include \"internal\/error.h\"\n\nnamespace Spark\n{\n namespace Internal\n {\n thread_local symbolid_t g_nextSymbol;\n thread_local std::vector<Spark::Node*> g_nodeStack;\n thread_local std::vector<Spark::Node*> g_allocatedNodes;\n\n uintptr_t isNull(char* buffer)\n {\n return buffer ? 1 : 0;\n }\n\n char* nullOrOffset(char* buffer, uint32_t offset)\n {\n return buffer + isNull(buffer) * offset;\n }\n\n template<typename... Args>\n int32_t doSnprintf(char* buffer, int32_t buffer_size, int32_t written, const Args&... args)\n {\n SPARK_ASSERT(written >= 0);\n auto len = snprintf(nullOrOffset(buffer, written), buffer_size == 0 ? 0 : buffer_size - written, args...);\n SPARK_ASSERT(len >= 0);\n SPARK_ASSERT(buffer_size == 0 || (written + len < buffer_size));\n\n return written + len;\n }\n\n int32_t controlNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n return doSnprintf(buffer, buffer_size, written,\n \"%s\\n\",\n spark_control_to_str(node->_control));\n }\n\n int32_t functionNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char datatypeBuffer[32];\n return doSnprintf(buffer, buffer_size, written,\n \"%s -> %s\\n\",\n spark_operator_to_str((operator_t)node->_function.id),\n spark_datatype_to_str(node->_function.type, datatypeBuffer, sizeof(datatypeBuffer)));\n }\n\n int32_t symbolNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char datatypeBuffer[32];\n return doSnprintf(buffer, buffer_size, written,\n \"0x%x -> %s\\n\",\n node->_symbol.id,\n spark_datatype_to_str(node->_symbol.type, datatypeBuffer, sizeof(datatypeBuffer)));\n }\n\n int32_t constantNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n const auto dt = node->_constant.type;\n const auto primitive = dt & DataType::PrimitiveMask;\n \/\/ primitive cannot be void\n SPARK_ASSERT(primitive != DataType::Void);\n const auto component = dt & DataType::ComponentMask;\n const auto container = dt & DataType::ContainerMask;\n \/\/ container cannot be init'd with a constant\n SPARK_ASSERT(container == 0);\n\n int32_t componentCount = 1;\n switch(component)\n {\n case DataType::Vector2:\n componentCount = 2;\n break;\n case DataType::Vector3:\n componentCount = 3;\n break;\n case DataType::Vector4:\n componentCount = 4;\n break;\n case DataType::Vector8:\n componentCount = 8;\n break;\n case DataType::Vector16:\n componentCount = 16;\n break;\n }\n\n auto raw = node->_constant.buffer;\n SPARK_ASSERT(raw != nullptr);\n\n for(int32_t k = 0; k < componentCount; k++)\n {\n if(k > 0)\n {\n written = doSnprintf(buffer, buffer_size, written, \"%s\", \", \");\n }\n\n union\n {\n int64_t signed_integer;\n uint64_t unsigned_integer;\n double floating_point;\n };\n\n switch(primitive)\n {\n case DataType::Char:\n signed_integer = *((int8_t*)raw + k);\n break;\n case DataType::UChar:\n unsigned_integer = *((uint8_t*)raw + k);\n break;\n case DataType::Short:\n signed_integer = *((int16_t*)raw + k);\n break;\n case DataType::UShort:\n unsigned_integer = *((uint16_t*)raw + k);\n break;\n case DataType::Int:\n signed_integer = *((int32_t*)raw + k);\n break;\n case DataType::UInt:\n unsigned_integer = *((uint32_t*)raw + k);\n break;\n case DataType::Long:\n signed_integer = *((int64_t*)raw + k);\n break;\n case DataType::ULong:\n unsigned_integer = *((uint64_t*)raw + k);\n break;\n case DataType::Float:\n floating_point = *((float*)raw + k);\n break;\n case DataType::Double:\n floating_point = *((double*)raw + k);\n break;\n }\n\n switch(primitive)\n {\n case DataType::Char:\n case DataType::Short:\n case DataType::Int:\n case DataType::Long:\n written = doSnprintf(buffer, buffer_size, written, \"%lli\", signed_integer);\n break;\n case DataType::UChar:\n case DataType::UShort:\n case DataType::UInt:\n case DataType::ULong:\n written = doSnprintf(buffer, buffer_size, written, \"%llu\", unsigned_integer);\n break;\n case DataType::Float:\n case DataType::Double:\n written = doSnprintf(buffer, buffer_size, written, \"%f\", floating_point);\n break;\n }\n }\n\n char datatypeBuffer[32];\n written = doSnprintf(buffer, buffer_size, written,\n \" -> %s\\n\",\n spark_datatype_to_str(node->_symbol.type, datatypeBuffer, sizeof(datatypeBuffer)));\n\n return written;\n }\n\n int32_t propertyNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char propertyBuffer[8];\n written = doSnprintf(buffer, buffer_size, written,\n \"Property::%s\\n\",\n spark_property_to_str(node->_property.id, propertyBuffer, countof(propertyBuffer)));\n return written;\n }\n\n \/\/ if out_bufer is null\n int32_t nodeToText(Spark::Node* node, char* out_buffer, int32_t buffer_size, int32_t written, int32_t indentation)\n {\n SPARK_ASSERT(node != nullptr);\n SPARK_ASSERT((out_buffer == nullptr && buffer_size == 0) || (out_buffer != nullptr && buffer_size > 0));\n\n \/\/ write indentation\n for(int32_t k = 0; k < indentation; k++)\n {\n written = doSnprintf(out_buffer, buffer_size, written, \"%s\", \" \");\n }\n \/\/ write node info\n\n switch(node->_type)\n {\n case NodeType::Control:\n written = controlNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Operator:\n written = functionNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Symbol:\n written = symbolNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Constant:\n written = constantNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Property:\n written = propertyNodeToText(node, out_buffer, buffer_size, written);\n break;\n default:\n written = doSnprintf(out_buffer, buffer_size, written, \"%s\\n\", spark_nodetype_to_str(node->_type));\n break;\n }\n\n \/\/ depth first traversal\n for(uint32_t k = 0; k < node->_childCount; k++)\n {\n Node* child = node->_children[k];\n written = nodeToText(child, out_buffer, buffer_size, written, indentation + 1);\n }\n\n \/\/ return characters written\n return written;\n }\n }\n}\n\nusing namespace Spark;\nusing namespace Spark::Internal;\n\nvoid spark_begin_program()\n{\n g_nextSymbol = 0;\n}\n\nvoid spark_end_program()\n{\n \/\/ free all of our unattached nodes\n for(auto node : g_allocatedNodes)\n {\n spark_free_node(node);\n }\n g_allocatedNodes.clear();\n}\n\n\/\/ symbol functions\nSpark::symbolid_t spark_next_symbol()\n{\n return g_nextSymbol++;\n}\n\n\/\/ node creation\n\nNode* spark_create_control_node(control_t c)\n{\n SPARK_ASSERT(c < Control::Count);\n\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Control;\n node->_control = c;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_operator_node(datatype_t dt, operator_t id)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Operator;\n node->_function.type = dt;\n node->_function.id = id;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_symbol_node(datatype_t dt, symbolid_t id)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Symbol;\n node->_symbol.type = dt;\n node->_symbol.id = id;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_constant_node(datatype_t dt, const void* raw, size_t sz)\n{\n SPARK_ASSERT(raw != nullptr);\n SPARK_ASSERT(sz > 0);\n\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Constant;\n node->_constant.type = dt;\n node->_constant.buffer = new uint8_t[sz];\n std::memcpy(node->_constant.buffer, raw, sz);\n node->_constant.size = sz;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_property_node(property_t prop)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Property;\n node->_property.id = prop;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_operator1_node(Spark::datatype_t dt, Spark::operator_t op, Spark::Node* arg1)\n{\n Node* result_node = spark_create_operator_node(dt, op);\n spark_add_child_node(result_node, arg1);\n return result_node;\n}\n\nNode* spark_create_operator2_node(Spark::datatype_t dt, Spark::operator_t op, Spark::Node* arg1, Spark::Node* arg2)\n{\n Node* result_node = spark_create_operator_node(dt, op);\n spark_add_child_node(result_node, arg1);\n spark_add_child_node(result_node, arg2);\n return result_node;\n}\n\n\/\/ node deletion\nvoid spark_free_node(Node* node)\n{\n delete[] node->_children;\n if(node->_type == NodeType::Constant)\n {\n delete[] node->_constant.buffer;\n }\n delete node;\n}\n\/\/ tree modification\nvoid spark_add_child_node(Node* root, Node* node)\n{\n SPARK_ASSERT(root != nullptr);\n SPARK_ASSERT(node != nullptr);\n SPARK_ASSERT(root != node);\n\n \/\/ init buffer if it is empty\n if(root->_children == nullptr)\n {\n const uint32_t bufferSize = 8;\n root->_children = new Node*[bufferSize];\n for(uint32_t k = 0; k < bufferSize; k++)\n {\n root->_children[k] = nullptr;\n }\n root->_bufferSize = bufferSize;\n root->_childCount = 0;\n }\n\n \/\/ add child node\n root->_children[root->_childCount++] = node;\n\n \/\/ resize buffer if it is full\n if(root->_childCount == root->_bufferSize)\n {\n \/\/ copy over nodes to new buffer\n const uint32_t bufferSize = root->_bufferSize * 2;\n const uint32_t childCount = root->_childCount;\n Node** children = new Node*[bufferSize];\n for(uint32_t k = 0; k < childCount; k++)\n {\n children[k] = root->_children[k];\n }\n\n for(uint32_t k = childCount; k < bufferSize; k++)\n {\n children[k] = nullptr;\n }\n\n \/\/ delete old buffer and copy over data\n delete[] root->_children;\n root->_children = children;\n root->_childCount = childCount;\n root->_bufferSize = bufferSize;\n }\n\n SPARK_ASSERT(root->_childCount < root->_bufferSize);\n}\n\/\/ source scope\nvoid spark_push_scope_node(Node* node)\n{\n try\n {\n if(g_nodeStack.size() > 0)\n {\n spark_add_child_node(g_nodeStack.back(), node);\n }\n g_nodeStack.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n}\n\nvoid spark_pop_scope_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n g_nodeStack.pop_back();\n}\n\nNode* spark_peek_scope_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n return g_nodeStack.back();\n}\n\nNode* spark_get_root_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n return g_nodeStack.front();\n}\n\nint32_t spark_node_to_text(Spark::Node* node, char* out_buffer, int32_t buffer_size)\n{\n return Spark::Internal::nodeToText(node, out_buffer, buffer_size, 0, 0) + 1;\n}\n<commit_msg>missing node.cpp from last commit<commit_after>#include \"precomp.h\"\n\n#include \"internal\/common.h\"\n#include \"internal\/enums.h\"\n#include \"internal\/node.h\"\n#include \"internal\/error.h\"\n\nnamespace Spark\n{\n namespace Internal\n {\n thread_local symbolid_t g_nextSymbol;\n thread_local std::vector<Spark::Node*> g_nodeStack;\n thread_local std::vector<Spark::Node*> g_allocatedNodes;\n\n uintptr_t isNull(char* buffer)\n {\n return buffer ? 1 : 0;\n }\n\n char* nullOrOffset(char* buffer, uint32_t offset)\n {\n return buffer + isNull(buffer) * offset;\n }\n\n template<typename... Args>\n int32_t doSnprintf(char* buffer, int32_t buffer_size, int32_t written, const Args&... args)\n {\n SPARK_ASSERT(written >= 0);\n auto len = snprintf(nullOrOffset(buffer, written), buffer_size == 0 ? 0 : buffer_size - written, args...);\n SPARK_ASSERT(len >= 0);\n SPARK_ASSERT(buffer_size == 0 || (written + len < buffer_size));\n\n return written + len;\n }\n\n int32_t controlNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n return doSnprintf(buffer, buffer_size, written,\n \"%s\\n\",\n spark_control_to_str(node->_control));\n }\n\n int32_t functionNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char datatypeBuffer[32];\n return doSnprintf(buffer, buffer_size, written,\n \"%s -> %s\\n\",\n spark_operator_to_str((operator_t)node->_function.id),\n spark_datatype_to_str(node->_function.type, datatypeBuffer, sizeof(datatypeBuffer)));\n }\n\n int32_t symbolNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char datatypeBuffer[32];\n return doSnprintf(buffer, buffer_size, written,\n \"0x%x -> %s\\n\",\n node->_symbol.id,\n spark_datatype_to_str(node->_symbol.type, datatypeBuffer, sizeof(datatypeBuffer)));\n }\n\n int32_t constantNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n const auto dt = node->_constant.type;\n const auto primitive = dt & DataType::PrimitiveMask;\n \/\/ primitive cannot be void\n SPARK_ASSERT(primitive != DataType::Void);\n const auto component = dt & DataType::ComponentMask;\n const auto container = dt & DataType::ContainerMask;\n \/\/ container cannot be init'd with a constant\n SPARK_ASSERT(container == 0);\n\n int32_t componentCount = 1;\n switch(component)\n {\n case DataType::Vector2:\n componentCount = 2;\n break;\n case DataType::Vector3:\n componentCount = 3;\n break;\n case DataType::Vector4:\n componentCount = 4;\n break;\n case DataType::Vector8:\n componentCount = 8;\n break;\n case DataType::Vector16:\n componentCount = 16;\n break;\n }\n\n auto raw = node->_constant.buffer;\n SPARK_ASSERT(raw != nullptr);\n\n for(int32_t k = 0; k < componentCount; k++)\n {\n if(k > 0)\n {\n written = doSnprintf(buffer, buffer_size, written, \"%s\", \", \");\n }\n\n union\n {\n int64_t signed_integer;\n uint64_t unsigned_integer;\n double floating_point;\n };\n\n switch(primitive)\n {\n case DataType::Char:\n signed_integer = *((int8_t*)raw + k);\n break;\n case DataType::UChar:\n unsigned_integer = *((uint8_t*)raw + k);\n break;\n case DataType::Short:\n signed_integer = *((int16_t*)raw + k);\n break;\n case DataType::UShort:\n unsigned_integer = *((uint16_t*)raw + k);\n break;\n case DataType::Int:\n signed_integer = *((int32_t*)raw + k);\n break;\n case DataType::UInt:\n unsigned_integer = *((uint32_t*)raw + k);\n break;\n case DataType::Long:\n signed_integer = *((int64_t*)raw + k);\n break;\n case DataType::ULong:\n unsigned_integer = *((uint64_t*)raw + k);\n break;\n case DataType::Float:\n floating_point = *((float*)raw + k);\n break;\n case DataType::Double:\n floating_point = *((double*)raw + k);\n break;\n }\n\n switch(primitive)\n {\n case DataType::Char:\n case DataType::Short:\n case DataType::Int:\n case DataType::Long:\n written = doSnprintf(buffer, buffer_size, written, \"%lli\", signed_integer);\n break;\n case DataType::UChar:\n case DataType::UShort:\n case DataType::UInt:\n case DataType::ULong:\n written = doSnprintf(buffer, buffer_size, written, \"%llu\", unsigned_integer);\n break;\n case DataType::Float:\n case DataType::Double:\n written = doSnprintf(buffer, buffer_size, written, \"%f\", floating_point);\n break;\n }\n }\n\n char datatypeBuffer[32];\n written = doSnprintf(buffer, buffer_size, written,\n \" -> %s\\n\",\n spark_datatype_to_str(node->_symbol.type, datatypeBuffer, sizeof(datatypeBuffer)));\n\n return written;\n }\n\n int32_t propertyNodeToText(Spark::Node* node, char* buffer, int32_t buffer_size, int32_t written)\n {\n char propertyBuffer[8];\n written = doSnprintf(buffer, buffer_size, written,\n \"Property::%s\\n\",\n spark_property_to_str(node->_property.id, propertyBuffer, countof(propertyBuffer)));\n return written;\n }\n\n \/\/ if out_bufer is null\n int32_t nodeToText(Spark::Node* node, char* out_buffer, int32_t buffer_size, int32_t written, int32_t indentation)\n {\n SPARK_ASSERT(node != nullptr);\n SPARK_ASSERT((out_buffer == nullptr && buffer_size == 0) || (out_buffer != nullptr && buffer_size > 0));\n\n \/\/ write indentation\n for(int32_t k = 0; k < indentation; k++)\n {\n written = doSnprintf(out_buffer, buffer_size, written, \"%s\", \" \");\n }\n \/\/ write node info\n\n switch(node->_type)\n {\n case NodeType::Control:\n written = controlNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Operator:\n written = functionNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Symbol:\n written = symbolNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Constant:\n written = constantNodeToText(node, out_buffer, buffer_size, written);\n break;\n case NodeType::Property:\n written = propertyNodeToText(node, out_buffer, buffer_size, written);\n break;\n default:\n written = doSnprintf(out_buffer, buffer_size, written, \"%s\\n\", spark_nodetype_to_str(node->_type));\n break;\n }\n\n \/\/ depth first traversal\n for(uint32_t k = 0; k < node->_childCount; k++)\n {\n Node* child = node->_children[k];\n written = nodeToText(child, out_buffer, buffer_size, written, indentation + 1);\n }\n\n \/\/ return characters written\n return written;\n }\n }\n}\n\nusing namespace Spark;\nusing namespace Spark::Internal;\n\nvoid spark_begin_program()\n{\n g_nextSymbol = 0;\n}\n\nvoid spark_end_program()\n{\n \/\/ free all of our unattached nodes\n for(auto node : g_allocatedNodes)\n {\n spark_free_node(node);\n }\n g_allocatedNodes.clear();\n}\n\n\/\/ symbol functions\nSpark::symbolid_t spark_next_symbol()\n{\n return g_nextSymbol++;\n}\n\n\/\/ node creation\n\nNode* spark_create_control_node(control_t c)\n{\n SPARK_ASSERT(c < Control::Count);\n\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Control;\n node->_attached = false;\n node->_control = c;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_operator_node(datatype_t dt, operator_t id)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Operator;\n node->_attached = false;\n node->_function.type = dt;\n node->_function.id = id;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_symbol_node(datatype_t dt, symbolid_t id)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Symbol;\n node->_attached = false;\n node->_symbol.type = dt;\n node->_symbol.id = id;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_constant_node(datatype_t dt, const void* raw, size_t sz)\n{\n SPARK_ASSERT(raw != nullptr);\n SPARK_ASSERT(sz > 0);\n\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_type = NodeType::Constant;\n node->_attached = false;\n node->_constant.type = dt;\n node->_constant.buffer = new uint8_t[sz];\n std::memcpy(node->_constant.buffer, raw, sz);\n node->_constant.size = sz;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_property_node(property_t prop)\n{\n Node* node = new Node();\n node->_children = nullptr;\n node->_childCount = 0;\n node->_bufferSize = 0;\n node->_attached = false;\n node->_type = NodeType::Property;\n node->_property.id = prop;\n\n try\n {\n g_allocatedNodes.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n\n return node;\n}\n\nNode* spark_create_operator1_node(Spark::datatype_t dt, Spark::operator_t op, Spark::Node* arg1)\n{\n Node* result_node = spark_create_operator_node(dt, op);\n spark_add_child_node(result_node, arg1);\n return result_node;\n}\n\nNode* spark_create_operator2_node(Spark::datatype_t dt, Spark::operator_t op, Spark::Node* arg1, Spark::Node* arg2)\n{\n Node* result_node = spark_create_operator_node(dt, op);\n spark_add_child_node(result_node, arg1);\n spark_add_child_node(result_node, arg2);\n return result_node;\n}\n\n\/\/ node deletion\nvoid spark_free_node(Node* node)\n{\n delete[] node->_children;\n if(node->_type == NodeType::Constant)\n {\n delete[] node->_constant.buffer;\n }\n delete node;\n}\n\/\/ tree modification\nvoid spark_add_child_node(Node* root, Node* node)\n{\n SPARK_ASSERT(root != nullptr);\n SPARK_ASSERT(node != nullptr);\n SPARK_ASSERT(root != node);\n\n \/\/ init buffer if it is empty\n if(root->_children == nullptr)\n {\n const uint32_t bufferSize = 8;\n root->_children = new Node*[bufferSize];\n for(uint32_t k = 0; k < bufferSize; k++)\n {\n root->_children[k] = nullptr;\n }\n root->_bufferSize = bufferSize;\n root->_childCount = 0;\n }\n\n \/\/ add child node\n root->_children[root->_childCount++] = node;\n node->_attached = true;\n\n \/\/ resize buffer if it is full\n if(root->_childCount == root->_bufferSize)\n {\n \/\/ copy over nodes to new buffer\n const uint32_t bufferSize = root->_bufferSize * 2;\n const uint32_t childCount = root->_childCount;\n Node** children = new Node*[bufferSize];\n for(uint32_t k = 0; k < childCount; k++)\n {\n children[k] = root->_children[k];\n }\n\n for(uint32_t k = childCount; k < bufferSize; k++)\n {\n children[k] = nullptr;\n }\n\n \/\/ delete old buffer and copy over data\n delete[] root->_children;\n root->_children = children;\n root->_childCount = childCount;\n root->_bufferSize = bufferSize;\n }\n\n SPARK_ASSERT(root->_childCount < root->_bufferSize);\n}\n\/\/ source scope\nvoid spark_push_scope_node(Node* node)\n{\n try\n {\n if(g_nodeStack.size() > 0)\n {\n spark_add_child_node(g_nodeStack.back(), node);\n }\n g_nodeStack.push_back(node);\n }\n catch(std::exception& ex)\n {\n spark_print_exception(ex);\n }\n}\n\nvoid spark_pop_scope_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n g_nodeStack.pop_back();\n}\n\nNode* spark_peek_scope_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n return g_nodeStack.back();\n}\n\nNode* spark_get_root_node()\n{\n SPARK_ASSERT(g_nodeStack.size() > 0);\n return g_nodeStack.front();\n}\n\nint32_t spark_node_to_text(Spark::Node* node, char* out_buffer, int32_t buffer_size)\n{\n return Spark::Internal::nodeToText(node, out_buffer, buffer_size, 0, 0) + 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: guisaveas.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: kz $ $Date: 2005-01-21 17:32:25 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SFX_GUISAVEAS_HXX_\n#define _SFX_GUISAVEAS_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_NAMEDVALUE_HPP_\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINERQUERY_HPP_\n#include <com\/sun\/star\/container\/XContainerQuery.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n\n#ifndef _DRAFTS_COM_SUN_STAR_FRAME_XMODULEMANAGER_HPP_\n#include <drafts\/com\/sun\/star\/frame\/XModuleManager.hpp>\n#endif\n\n\n#include <comphelper\/sequenceashashmap.hxx>\n#include \"docinf.hxx\"\n\nclass ModelData_Impl;\nclass SfxStoringHelper\n{\n friend class ModelData_Impl;\n\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > m_xFactory;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > m_xFilterCFG;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery > m_xFilterQuery;\n ::com::sun::star::uno::Reference< ::drafts::com::sun::star::frame::XModuleManager > m_xModuleManager;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > m_xNamedModManager;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > GetServiceFactory();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > GetFilterConfiguration();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery > GetFilterQuery();\n ::com::sun::star::uno::Reference< ::drafts::com::sun::star::frame::XModuleManager > GetModuleManager();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > GetNamedModuleManager();\n\n\npublic:\n SfxStoringHelper( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& xFactory );\n\n sal_Bool GUIStoreModel(\n const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n const ::rtl::OUString& aSlotName,\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& aArgsSequence);\n\n static ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > SearchForFilter(\n const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery >& xFilterQuery,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& aSearchRequest,\n sal_Int32 nMustFlags,\n sal_Int32 nDontFlags );\n\n static sal_Bool CheckFilterOptionsAppearence(\n const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& xFilterCFG,\n const ::rtl::OUString& aFilterName );\n\n static void FillCopy( const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n SfxDocumentInfo& aDocInfoToFill );\n\n static void PrepareDocInfoForStore( SfxDocumentInfo& aDocInfoToClear );\n\n static void SetDocInfoState( const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n const SfxDocumentInfo& aDocInfoState,\n sal_Bool bNoModify );\n\n static void ExecuteInfoDlg( const ::rtl::OUString& aTargetURL,\n const ::rtl::OUString& aTitle, const String& rBaseURL,\n SfxDocumentInfo &aDocInfo );\n\n static sal_Bool WarnUnacceptableFormat(\n const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n ::rtl::OUString aOldUIName,\n ::rtl::OUString aDefUIName,\n sal_Bool bCanProceedFurther );\n\n static void ExecuteFilterDialog( SfxStoringHelper& _rStorageHelper\n ,const ::rtl::OUString& sFilterName\n ,const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel\n ,\/*OUT*\/::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& rArgsSequence\n );\n};\n\n#endif\n\n<commit_msg>INTEGRATION: CWS removedrafts (1.4.46); FILE MERGED 2005\/02\/17 14:01:56 cd 1.4.46.1: #i42557# Move UNOIDL types from drafts to com<commit_after>\/*************************************************************************\n *\n * $RCSfile: guisaveas.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: kz $ $Date: 2005-03-01 19:56:52 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _SFX_GUISAVEAS_HXX_\n#define _SFX_GUISAVEAS_HXX_\n\n#ifndef _COM_SUN_STAR_UNO_SEQUENCE_HXX_\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n#ifndef _COM_SUN_STAR_BEANS_NAMEDVALUE_HPP_\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_CONTAINER_XNAMEACCESS_HPP_\n#include <com\/sun\/star\/container\/XNameAccess.hpp>\n#endif\n#ifndef _COM_SUN_STAR_CONTAINER_XCONTAINERQUERY_HPP_\n#include <com\/sun\/star\/container\/XContainerQuery.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XMODEL_HPP_\n#include <com\/sun\/star\/frame\/XModel.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XMODULEMANAGER_HPP_\n#include <com\/sun\/star\/frame\/XModuleManager.hpp>\n#endif\n\n\n#include <comphelper\/sequenceashashmap.hxx>\n#include \"docinf.hxx\"\n\nclass ModelData_Impl;\nclass SfxStoringHelper\n{\n friend class ModelData_Impl;\n\nprivate:\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > m_xFactory;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > m_xFilterCFG;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery > m_xFilterQuery;\n ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModuleManager > m_xModuleManager;\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > m_xNamedModManager;\n\n ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory > GetServiceFactory();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > GetFilterConfiguration();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery > GetFilterQuery();\n ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModuleManager > GetModuleManager();\n ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess > GetNamedModuleManager();\n\n\npublic:\n SfxStoringHelper( const ::com::sun::star::uno::Reference< ::com::sun::star::lang::XMultiServiceFactory >& xFactory );\n\n sal_Bool GUIStoreModel(\n const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n const ::rtl::OUString& aSlotName,\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& aArgsSequence);\n\n static ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > SearchForFilter(\n const ::com::sun::star::uno::Reference< ::com::sun::star::container::XContainerQuery >& xFilterQuery,\n const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& aSearchRequest,\n sal_Int32 nMustFlags,\n sal_Int32 nDontFlags );\n\n static sal_Bool CheckFilterOptionsAppearence(\n const ::com::sun::star::uno::Reference< ::com::sun::star::container::XNameAccess >& xFilterCFG,\n const ::rtl::OUString& aFilterName );\n\n static void FillCopy( const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n SfxDocumentInfo& aDocInfoToFill );\n\n static void PrepareDocInfoForStore( SfxDocumentInfo& aDocInfoToClear );\n\n static void SetDocInfoState( const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n const SfxDocumentInfo& aDocInfoState,\n sal_Bool bNoModify );\n\n static void ExecuteInfoDlg( const ::rtl::OUString& aTargetURL,\n const ::rtl::OUString& aTitle, const String& rBaseURL,\n SfxDocumentInfo &aDocInfo );\n\n static sal_Bool WarnUnacceptableFormat(\n const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel,\n ::rtl::OUString aOldUIName,\n ::rtl::OUString aDefUIName,\n sal_Bool bCanProceedFurther );\n\n static void ExecuteFilterDialog( SfxStoringHelper& _rStorageHelper\n ,const ::rtl::OUString& sFilterName\n ,const ::com::sun::star::uno::Reference< ::com::sun::star::frame::XModel >& xModel\n ,\/*OUT*\/::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& rArgsSequence\n );\n};\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/android\/banners\/app_banner_settings_helper.h\"\n\n#include <string>\n\n#include \"chrome\/browser\/content_settings\/host_content_settings_map.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/content_settings_pattern.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\n\/\/ Max number of apps that a particular site may show a banner for.\nconst size_t kMaxAppsPerSite = 3;\n}\n\nbool AppBannerSettingsHelper::IsAllowed(content::WebContents* web_contents,\n const GURL& origin_url,\n const std::string& package_name) {\n Profile* profile =\n Profile::FromBrowserContext(web_contents->GetBrowserContext());\n if (profile->IsOffTheRecord() || web_contents->GetURL() != origin_url ||\n package_name.empty()) {\n return false;\n }\n\n \/\/ Check if this combination has been previously disabled.\n HostContentSettingsMap* settings = profile->GetHostContentSettingsMap();\n if (!settings)\n return false;\n scoped_ptr<base::Value> value(\n settings->GetWebsiteSetting(origin_url,\n origin_url,\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL));\n if (!value.get()) {\n \/\/ We've never blocked a banner on this site.\n return true;\n } else if (value->IsType(base::Value::TYPE_DICTIONARY)) {\n \/\/ We expect to get dictionary back, where the keys are the package names.\n base::DictionaryValue* banner_dict =\n static_cast<base::DictionaryValue*>(value.get());\n bool is_allowed = false;\n if (banner_dict->GetBoolean(package_name, &is_allowed)) {\n return is_allowed;\n } else {\n return banner_dict->size() < ::kMaxAppsPerSite;\n }\n } else {\n \/\/ Somehow the value we got back is not a dictionary (e.g. the settings were\n \/\/ corrupted by malware). Try to clear it out.\n ContentSettingsPattern pattern(ContentSettingsPattern::FromURL(origin_url));\n if (pattern.IsValid()) {\n settings->SetWebsiteSetting(pattern,\n ContentSettingsPattern::Wildcard(),\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL);\n return true;\n }\n }\n\n return false;\n}\n\nvoid AppBannerSettingsHelper::Block(content::WebContents* web_contents,\n const GURL& origin_url,\n const std::string& package_name) {\n Profile* profile =\n Profile::FromBrowserContext(web_contents->GetBrowserContext());\n HostContentSettingsMap* settings = profile->GetHostContentSettingsMap();\n ContentSettingsPattern pattern(ContentSettingsPattern::FromURL(origin_url));\n if (!settings || !pattern.IsValid())\n return;\n\n scoped_ptr<base::Value> value(\n settings->GetWebsiteSetting(origin_url,\n origin_url,\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL));\n base::DictionaryValue* banner_dict = NULL;\n if (value.get() && value->IsType(base::Value::TYPE_DICTIONARY)) {\n banner_dict = static_cast<base::DictionaryValue*>(value.release());\n } else {\n banner_dict = new base::DictionaryValue();\n }\n\n \/\/ Update the setting and save it back.\n banner_dict->SetBoolean(package_name, false);\n settings->SetWebsiteSetting(pattern,\n ContentSettingsPattern::Wildcard(),\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n banner_dict);\n}\n<commit_msg>Sanitize app package names for DictionaryValue<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/android\/banners\/app_banner_settings_helper.h\"\n\n#include <algorithm>\n#include <string>\n\n#include \"chrome\/browser\/content_settings\/host_content_settings_map.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/common\/content_settings_pattern.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"url\/gurl.h\"\n\nnamespace {\nstd::string SanitizePackageName(std::string package_name) {\n \/\/ DictionaryValue doesn't allow '.' in the keys. Replace them with ' '\n \/\/ because you can't have a package name with a ' ' in it.\n std::replace(package_name.begin(), package_name.end(), '.', ' ');\n return package_name;\n}\n\n\/\/ Max number of apps that a particular site may show a banner for.\nconst size_t kMaxAppsPerSite = 3;\n} \/\/ namespace\n\nbool AppBannerSettingsHelper::IsAllowed(content::WebContents* web_contents,\n const GURL& origin_url,\n const std::string& package_name) {\n std::string sanitized_package_name = SanitizePackageName(package_name);\n Profile* profile =\n Profile::FromBrowserContext(web_contents->GetBrowserContext());\n if (profile->IsOffTheRecord() || web_contents->GetURL() != origin_url ||\n sanitized_package_name.empty()) {\n return false;\n }\n\n \/\/ Check if this combination has been previously disabled.\n HostContentSettingsMap* settings = profile->GetHostContentSettingsMap();\n if (!settings)\n return false;\n scoped_ptr<base::Value> value(\n settings->GetWebsiteSetting(origin_url,\n origin_url,\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL));\n if (!value.get()) {\n \/\/ We've never blocked a banner on this site.\n return true;\n } else if (value->IsType(base::Value::TYPE_DICTIONARY)) {\n \/\/ We expect to get a Dictionary back, where the keys are the package names.\n base::DictionaryValue* banner_dict =\n static_cast<base::DictionaryValue*>(value.get());\n bool is_allowed = false;\n if (banner_dict->GetBoolean(sanitized_package_name, &is_allowed)) {\n return is_allowed;\n } else {\n return banner_dict->size() < ::kMaxAppsPerSite;\n }\n } else {\n \/\/ Somehow the value we got back is not a dictionary (e.g. the settings were\n \/\/ corrupted by malware). Try to clear it out.\n ContentSettingsPattern pattern(ContentSettingsPattern::FromURL(origin_url));\n if (pattern.IsValid()) {\n settings->SetWebsiteSetting(pattern,\n ContentSettingsPattern::Wildcard(),\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL);\n return true;\n }\n }\n\n return false;\n}\n\nvoid AppBannerSettingsHelper::Block(content::WebContents* web_contents,\n const GURL& origin_url,\n const std::string& package_name) {\n std::string sanitized_package_name = SanitizePackageName(package_name);\n DCHECK(!sanitized_package_name.empty());\n\n Profile* profile =\n Profile::FromBrowserContext(web_contents->GetBrowserContext());\n HostContentSettingsMap* settings = profile->GetHostContentSettingsMap();\n ContentSettingsPattern pattern(ContentSettingsPattern::FromURL(origin_url));\n if (!settings || !pattern.IsValid())\n return;\n\n scoped_ptr<base::Value> value(\n settings->GetWebsiteSetting(origin_url,\n origin_url,\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n NULL));\n base::DictionaryValue* banner_dict = NULL;\n if (value.get() && value->IsType(base::Value::TYPE_DICTIONARY)) {\n banner_dict = static_cast<base::DictionaryValue*>(value.release());\n } else {\n banner_dict = new base::DictionaryValue();\n }\n\n \/\/ Update the setting and save it back.\n banner_dict->SetBoolean(sanitized_package_name, false);\n settings->SetWebsiteSetting(pattern,\n ContentSettingsPattern::Wildcard(),\n CONTENT_SETTINGS_TYPE_APP_BANNER,\n std::string(),\n banner_dict);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/Contact>\n#include <TelepathyQt4\/ContactManager>\n#include <TelepathyQt4\/PendingContacts>\n#include <TelepathyQt4\/PendingReady>\n\n#include <telepathy-glib\/telepathy-glib.h>\n\n#include <tests\/lib\/glib\/contacts-conn.h>\n#include <tests\/lib\/test.h>\n\nusing namespace Tp;\n\nclass TestContactsInfo : public Test\n{\n Q_OBJECT\n\npublic:\n TestContactsInfo(QObject *parent = 0)\n : Test(parent), mConnService(0)\n { }\n\nprotected Q_SLOTS:\n void expectConnInvalidated();\n void expectPendingContactsFinished(Tp::PendingOperation *);\n void onContactInfoChanged(const Tp::ContactInfoFieldList &);\n\nprivate Q_SLOTS:\n void initTestCase();\n void init();\n\n void testInfo();\n\n void cleanup();\n void cleanupTestCase();\n\nprivate:\n QString mConnName, mConnPath;\n ContactsConnection *mConnService;\n ConnectionPtr mConn;\n QList<ContactPtr> mContacts;\n int mContactsInfoUpdated;\n};\n\nvoid TestContactsInfo::expectConnInvalidated()\n{\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::expectPendingContactsFinished(PendingOperation *op)\n{\n if (!op->isFinished()) {\n qWarning() << \"unfinished\";\n mLoop->exit(1);\n return;\n }\n\n if (op->isError()) {\n qWarning().nospace() << op->errorName()\n << \": \" << op->errorMessage();\n mLoop->exit(2);\n return;\n }\n\n if (!op->isValid()) {\n qWarning() << \"inconsistent results\";\n mLoop->exit(3);\n return;\n }\n\n qDebug() << \"finished\";\n PendingContacts *pending = qobject_cast<PendingContacts *>(op);\n mContacts = pending->contacts();\n\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::onContactInfoChanged(const Tp::ContactInfoFieldList &info)\n{\n Q_UNUSED(info);\n mContactsInfoUpdated++;\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::initTestCase()\n{\n initTestCaseImpl();\n\n g_type_init();\n g_set_prgname(\"contacts-info\");\n tp_debug_set_flags(\"all\");\n dbus_g_bus_get(DBUS_BUS_STARTER, 0);\n\n gchar *name;\n gchar *connPath;\n GError *error = 0;\n\n mConnService = CONTACTS_CONNECTION(g_object_new(\n CONTACTS_TYPE_CONNECTION,\n \"account\", \"me@example.com\",\n \"protocol\", \"foo\",\n 0));\n QVERIFY(mConnService != 0);\n QVERIFY(tp_base_connection_register(TP_BASE_CONNECTION(mConnService),\n \"foo\", &name, &connPath, &error));\n QVERIFY(error == 0);\n\n QVERIFY(name != 0);\n QVERIFY(connPath != 0);\n\n mConnName = QLatin1String(name);\n mConnPath = QLatin1String(connPath);\n\n g_free(name);\n g_free(connPath);\n\n mConn = Connection::create(mConnName, mConnPath);\n QCOMPARE(mConn->isReady(), false);\n\n QVERIFY(connect(mConn->requestConnect(),\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n QCOMPARE(mConn->isReady(), true);\n\n QCOMPARE(mConn->status(), Connection::StatusConnected);\n\n QVERIFY(mConn->contactManager()->supportedFeatures().contains(Contact::FeatureInfo));\n}\n\nvoid TestContactsInfo::init()\n{\n initImpl();\n mContactsInfoUpdated = 0;\n}\n\nvoid TestContactsInfo::testInfo()\n{\n QStringList validIDs = QStringList() << QLatin1String(\"foo\")\n << QLatin1String(\"bar\");\n\n PendingContacts *pending = mConn->contactManager()->contactsForIdentifiers(\n validIDs, QSet<Contact::Feature>() << Contact::FeatureInfo);\n QVERIFY(connect(pending,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectPendingContactsFinished(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n\n for (int i = 0; i < mContacts.size(); i++) {\n ContactPtr contact = mContacts[i];\n\n QCOMPARE(contact->requestedFeatures(),\n QSet<Contact::Feature>() << Contact::FeatureInfo);\n QCOMPARE(contact->actualFeatures(),\n QSet<Contact::Feature>() << Contact::FeatureInfo);\n\n QVERIFY(contact->info().isEmpty());\n\n connect(contact.data(),\n SIGNAL(infoChanged(const Tp::ContactInfoFieldList &)),\n SLOT(onContactInfoChanged(const Tp::ContactInfoFieldList &)));\n }\n\n GPtrArray *info_1 = (GPtrArray *) dbus_g_type_specialized_construct (\n TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST);\n {\n const gchar * const field_values[2] = {\n \"Foo\", NULL\n };\n g_ptr_array_add (info_1, tp_value_array_build (3,\n G_TYPE_STRING, \"n\",\n G_TYPE_STRV, NULL,\n G_TYPE_STRV, field_values,\n G_TYPE_INVALID));\n }\n GPtrArray *info_2 = (GPtrArray *) dbus_g_type_specialized_construct (\n TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST);\n {\n const gchar * const field_values[2] = {\n \"Bar\", NULL\n };\n g_ptr_array_add (info_2, tp_value_array_build (3,\n G_TYPE_STRING, \"n\",\n G_TYPE_STRV, NULL,\n G_TYPE_STRV, field_values,\n G_TYPE_INVALID));\n }\n GPtrArray *infos[] = { info_1, info_2 };\n\n TpHandle handles[] = { 0, 0 };\n TpHandleRepoIface *serviceRepo = tp_base_connection_get_handles(\n (TpBaseConnection *) mConnService, TP_HANDLE_TYPE_CONTACT);\n\n for (unsigned i = 0; i < 2; i++) {\n handles[i] = tp_handle_ensure(serviceRepo, qPrintable(validIDs[i]),\n NULL, NULL);\n }\n\n contacts_connection_change_infos(mConnService, 2, handles, infos);\n\n while (mContactsInfoUpdated != 2) {\n QCOMPARE(mLoop->exec(), 0);\n }\n\n mContactsInfoUpdated = 0;\n ContactPtr contactFoo = mContacts[0];\n ContactPtr contactBar = mContacts[1];\n\n QCOMPARE(contactFoo->info().size(), 1);\n QCOMPARE(contactFoo->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactFoo->info()[0].fieldValue[0], QLatin1String(\"Foo\"));\n QCOMPARE(contactBar->info().size(), 1);\n QCOMPARE(contactBar->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactBar->info()[0].fieldValue[0], QLatin1String(\"Bar\"));\n\n foreach (const ContactPtr &contact, mContacts) {\n PendingOperation *op = contact->refreshInfo();\n QVERIFY(connect(op,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n }\n\n while (mContactsInfoUpdated != 2) {\n QCOMPARE(mLoop->exec(), 0);\n }\n\n QCOMPARE(contactFoo->info().size(), 2);\n QCOMPARE(contactFoo->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactFoo->info()[0].fieldValue[0], QLatin1String(\"Foo\"));\n QCOMPARE(contactFoo->info()[1].fieldName, QLatin1String(\"url\"));\n QCOMPARE(contactFoo->info()[1].fieldValue[0], QLatin1String(\"http:\/\/telepathy.freedesktop.org\"));\n QCOMPARE(contactBar->info().size(), 2);\n QCOMPARE(contactBar->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactBar->info()[0].fieldValue[0], QLatin1String(\"Bar\"));\n QCOMPARE(contactBar->info()[1].fieldName, QLatin1String(\"url\"));\n QCOMPARE(contactBar->info()[1].fieldValue[0], QLatin1String(\"http:\/\/telepathy.freedesktop.org\"));\n\n g_boxed_free (TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST, info_1);\n g_boxed_free (TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST, info_2);\n}\n\nvoid TestContactsInfo::cleanup()\n{\n cleanupImpl();\n}\n\nvoid TestContactsInfo::cleanupTestCase()\n{\n if (mConn) {\n \/\/ Disconnect and wait for invalidated\n QVERIFY(connect(mConn->requestDisconnect(),\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n\n if (mConn->isValid()) {\n QVERIFY(connect(mConn.data(),\n SIGNAL(invalidated(Tp::DBusProxy *,\n const QString &, const QString &)),\n SLOT(expectConnInvalidated())));\n QCOMPARE(mLoop->exec(), 0);\n }\n }\n\n if (mConnService != 0) {\n g_object_unref(mConnService);\n mConnService = 0;\n }\n\n cleanupTestCaseImpl();\n}\n\nQTEST_MAIN(TestContactsInfo)\n#include \"_gen\/contacts-info.cpp.moc.hpp\"\n<commit_msg>contacts-info test: Added test for Tp::Contact::requestInfo().<commit_after>#include <TelepathyQt4\/Connection>\n#include <TelepathyQt4\/Contact>\n#include <TelepathyQt4\/ContactManager>\n#include <TelepathyQt4\/PendingContacts>\n#include <TelepathyQt4\/PendingContactInfo>\n#include <TelepathyQt4\/PendingReady>\n\n#include <telepathy-glib\/telepathy-glib.h>\n\n#include <tests\/lib\/glib\/contacts-conn.h>\n#include <tests\/lib\/test.h>\n\nusing namespace Tp;\n\nclass TestContactsInfo : public Test\n{\n Q_OBJECT\n\npublic:\n TestContactsInfo(QObject *parent = 0)\n : Test(parent), mConnService(0)\n { }\n\nprotected Q_SLOTS:\n void expectConnInvalidated();\n void expectPendingContactsFinished(Tp::PendingOperation *);\n void onContactInfoChanged(const Tp::ContactInfoFieldList &);\n\nprivate Q_SLOTS:\n void initTestCase();\n void init();\n\n void testInfo();\n\n void cleanup();\n void cleanupTestCase();\n\nprivate:\n QString mConnName, mConnPath;\n ContactsConnection *mConnService;\n ConnectionPtr mConn;\n QList<ContactPtr> mContacts;\n int mContactsInfoUpdated;\n};\n\nvoid TestContactsInfo::expectConnInvalidated()\n{\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::expectPendingContactsFinished(PendingOperation *op)\n{\n if (!op->isFinished()) {\n qWarning() << \"unfinished\";\n mLoop->exit(1);\n return;\n }\n\n if (op->isError()) {\n qWarning().nospace() << op->errorName()\n << \": \" << op->errorMessage();\n mLoop->exit(2);\n return;\n }\n\n if (!op->isValid()) {\n qWarning() << \"inconsistent results\";\n mLoop->exit(3);\n return;\n }\n\n qDebug() << \"finished\";\n PendingContacts *pending = qobject_cast<PendingContacts *>(op);\n mContacts = pending->contacts();\n\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::onContactInfoChanged(const Tp::ContactInfoFieldList &info)\n{\n Q_UNUSED(info);\n mContactsInfoUpdated++;\n mLoop->exit(0);\n}\n\nvoid TestContactsInfo::initTestCase()\n{\n initTestCaseImpl();\n\n g_type_init();\n g_set_prgname(\"contacts-info\");\n tp_debug_set_flags(\"all\");\n dbus_g_bus_get(DBUS_BUS_STARTER, 0);\n\n gchar *name;\n gchar *connPath;\n GError *error = 0;\n\n mConnService = CONTACTS_CONNECTION(g_object_new(\n CONTACTS_TYPE_CONNECTION,\n \"account\", \"me@example.com\",\n \"protocol\", \"foo\",\n 0));\n QVERIFY(mConnService != 0);\n QVERIFY(tp_base_connection_register(TP_BASE_CONNECTION(mConnService),\n \"foo\", &name, &connPath, &error));\n QVERIFY(error == 0);\n\n QVERIFY(name != 0);\n QVERIFY(connPath != 0);\n\n mConnName = QLatin1String(name);\n mConnPath = QLatin1String(connPath);\n\n g_free(name);\n g_free(connPath);\n\n mConn = Connection::create(mConnName, mConnPath);\n QCOMPARE(mConn->isReady(), false);\n\n QVERIFY(connect(mConn->requestConnect(),\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n QCOMPARE(mConn->isReady(), true);\n\n QCOMPARE(mConn->status(), Connection::StatusConnected);\n\n QVERIFY(mConn->contactManager()->supportedFeatures().contains(Contact::FeatureInfo));\n}\n\nvoid TestContactsInfo::init()\n{\n initImpl();\n mContactsInfoUpdated = 0;\n}\n\nvoid TestContactsInfo::testInfo()\n{\n QStringList validIDs = QStringList() << QLatin1String(\"foo\")\n << QLatin1String(\"bar\");\n\n PendingContacts *pending = mConn->contactManager()->contactsForIdentifiers(\n validIDs, QSet<Contact::Feature>() << Contact::FeatureInfo);\n QVERIFY(connect(pending,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectPendingContactsFinished(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n\n for (int i = 0; i < mContacts.size(); i++) {\n ContactPtr contact = mContacts[i];\n\n QCOMPARE(contact->requestedFeatures(),\n QSet<Contact::Feature>() << Contact::FeatureInfo);\n QCOMPARE(contact->actualFeatures(),\n QSet<Contact::Feature>() << Contact::FeatureInfo);\n\n QVERIFY(contact->info().isEmpty());\n\n connect(contact.data(),\n SIGNAL(infoChanged(const Tp::ContactInfoFieldList &)),\n SLOT(onContactInfoChanged(const Tp::ContactInfoFieldList &)));\n }\n\n GPtrArray *info_1 = (GPtrArray *) dbus_g_type_specialized_construct (\n TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST);\n {\n const gchar * const field_values[2] = {\n \"Foo\", NULL\n };\n g_ptr_array_add (info_1, tp_value_array_build (3,\n G_TYPE_STRING, \"n\",\n G_TYPE_STRV, NULL,\n G_TYPE_STRV, field_values,\n G_TYPE_INVALID));\n }\n GPtrArray *info_2 = (GPtrArray *) dbus_g_type_specialized_construct (\n TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST);\n {\n const gchar * const field_values[2] = {\n \"Bar\", NULL\n };\n g_ptr_array_add (info_2, tp_value_array_build (3,\n G_TYPE_STRING, \"n\",\n G_TYPE_STRV, NULL,\n G_TYPE_STRV, field_values,\n G_TYPE_INVALID));\n }\n GPtrArray *infos[] = { info_1, info_2 };\n\n TpHandle handles[] = { 0, 0 };\n TpHandleRepoIface *serviceRepo = tp_base_connection_get_handles(\n (TpBaseConnection *) mConnService, TP_HANDLE_TYPE_CONTACT);\n\n for (unsigned i = 0; i < 2; i++) {\n handles[i] = tp_handle_ensure(serviceRepo, qPrintable(validIDs[i]),\n NULL, NULL);\n }\n\n contacts_connection_change_infos(mConnService, 2, handles, infos);\n\n while (mContactsInfoUpdated != 2) {\n QCOMPARE(mLoop->exec(), 0);\n }\n\n mContactsInfoUpdated = 0;\n ContactPtr contactFoo = mContacts[0];\n ContactPtr contactBar = mContacts[1];\n\n QCOMPARE(contactFoo->info().size(), 1);\n QCOMPARE(contactFoo->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactFoo->info()[0].fieldValue[0], QLatin1String(\"Foo\"));\n QCOMPARE(contactBar->info().size(), 1);\n QCOMPARE(contactBar->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactBar->info()[0].fieldValue[0], QLatin1String(\"Bar\"));\n\n foreach (const ContactPtr &contact, mContacts) {\n PendingOperation *op = contact->refreshInfo();\n QVERIFY(connect(op,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n }\n\n while (mContactsInfoUpdated != 2) {\n QCOMPARE(mLoop->exec(), 0);\n }\n\n QCOMPARE(contactFoo->info().size(), 2);\n QCOMPARE(contactFoo->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactFoo->info()[0].fieldValue[0], QLatin1String(\"Foo\"));\n QCOMPARE(contactFoo->info()[1].fieldName, QLatin1String(\"url\"));\n QCOMPARE(contactFoo->info()[1].fieldValue[0], QLatin1String(\"http:\/\/telepathy.freedesktop.org\"));\n QCOMPARE(contactBar->info().size(), 2);\n QCOMPARE(contactBar->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(contactBar->info()[0].fieldValue[0], QLatin1String(\"Bar\"));\n QCOMPARE(contactBar->info()[1].fieldName, QLatin1String(\"url\"));\n QCOMPARE(contactBar->info()[1].fieldValue[0], QLatin1String(\"http:\/\/telepathy.freedesktop.org\"));\n\n for (int i = 0; i < mContacts.size(); i++) {\n ContactPtr contact = mContacts[i];\n disconnect(contact.data(),\n SIGNAL(infoChanged(const Tp::ContactInfoFieldList &)),\n this,\n SLOT(onContactInfoChanged(const Tp::ContactInfoFieldList &)));\n }\n\n PendingContactInfo *pci = contactFoo->requestInfo();\n QVERIFY(connect(pci,\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n while (!pci->isFinished()) {\n QCOMPARE(mLoop->exec(), 0);\n }\n\n QCOMPARE(pci->info().size(), 2);\n QCOMPARE(pci->info()[0].fieldName, QLatin1String(\"n\"));\n QCOMPARE(pci->info()[0].fieldValue[0], QLatin1String(\"Foo\"));\n QCOMPARE(pci->info()[1].fieldName, QLatin1String(\"url\"));\n QCOMPARE(pci->info()[1].fieldValue[0], QLatin1String(\"http:\/\/telepathy.freedesktop.org\"));\n\n g_boxed_free (TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST, info_1);\n g_boxed_free (TP_ARRAY_TYPE_CONTACT_INFO_FIELD_LIST, info_2);\n}\n\nvoid TestContactsInfo::cleanup()\n{\n cleanupImpl();\n}\n\nvoid TestContactsInfo::cleanupTestCase()\n{\n if (mConn) {\n \/\/ Disconnect and wait for invalidated\n QVERIFY(connect(mConn->requestDisconnect(),\n SIGNAL(finished(Tp::PendingOperation*)),\n SLOT(expectSuccessfulCall(Tp::PendingOperation*))));\n QCOMPARE(mLoop->exec(), 0);\n\n if (mConn->isValid()) {\n QVERIFY(connect(mConn.data(),\n SIGNAL(invalidated(Tp::DBusProxy *,\n const QString &, const QString &)),\n SLOT(expectConnInvalidated())));\n QCOMPARE(mLoop->exec(), 0);\n }\n }\n\n if (mConnService != 0) {\n g_object_unref(mConnService);\n mConnService = 0;\n }\n\n cleanupTestCaseImpl();\n}\n\nQTEST_MAIN(TestContactsInfo)\n#include \"_gen\/contacts-info.cpp.moc.hpp\"\n<|endoftext|>"} {"text":"<commit_before>#include \"LogSinks.hpp\"\n#include \"macros.hpp\"\n#include <unistd.h>\n#include <iostream>\n#include <ctime>\n#include <sstream>\n\nstatic const char* const ESCAPE_BOLD = \"\\x1B[1m\";\nstatic const char* const ESCAPE_NORMALFONT = \"\\x1B[0m\";\nstatic const char* const ESCAPE_BLACK_FOREGROUND = \"\\x1B[30m\";\nstatic const char* const ESCAPE_RED_FOREGROUND = \"\\x1B[31m\";\nstatic const char* const ESCAPE_GREEN_FOREGROUND = \"\\x1B[32m\";\nstatic const char* const ESCAPE_YELLOW_FOREGROUND = \"\\x1B[33m\";\nstatic const char* const ESCAPE_BLUE_FOREGROUND = \"\\x1B[34m\";\nstatic const char* const ESCAPE_MAGENTA_FOREGROUND = \"\\x1B[35m\";\nstatic const char* const ESCAPE_CYAN_FOREGROUND = \"\\x1B[36m\";\nstatic const char* const ESCAPE_WHITE_FOREGROUND = \"\\x1B[37m\";\n\nstatic void HOT printDateTime(uint64_t timestamp, std::ostream& stream) {\n \/\/Convert timestamp to timeval\n struct timeval tv;\n tv.tv_sec = timestamp \/ 1000;\n tv.tv_usec = (timestamp % 1000) * 1000;\n \/\/Format the tm data\n char dateBuffer[32];\n size_t formattedLength = strftime(dateBuffer, 32, \"%F %T\", localtime(&(tv.tv_sec)));\n assert(formattedLength > 0);\n \/\/Format the subsecond part\n snprintf(dateBuffer + formattedLength, 32 - formattedLength, \".%03lu\", (unsigned long) (tv.tv_usec \/ 1000));\n stream << '[' << dateBuffer << ']';\n}\n\n\nstd::string logLevelToString(LogLevel logLevel) {\n switch (logLevel) {\n case LogLevel::Critical: {\n return \"Critical\";\n }\n case LogLevel::Error: {\n return \"Error\";\n }\n case LogLevel::Warn: {\n return \"Warn\";\n }\n case LogLevel::Info: {\n return \"Info\";\n }\n case LogLevel::Debug: {\n return \"Debug\";\n }\n case LogLevel::Trace: {\n return \"Trace\";\n }\n default: {\n return \"Unknown\";\n }\n }\n}\n\nLogSink::~LogSink() {\n \n}\n\nStderrLogSink::StderrLogSink() : coloredLogging(isatty(fileno(stderr))) {\n\n}\n\nvoid StderrLogSink::setColoredLogging(bool value) {\n this->coloredLogging = value;\n}\n\nvoid HOT StderrLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n\n switch (logLevel) {\n case LogLevel::Critical: {\n if(coloredLogging) {\n std::cerr << ESCAPE_BOLD << ESCAPE_RED_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Error] \" << senderName << \" - \" << logMessage;\n if(coloredLogging) {\n std::cerr << ESCAPE_NORMALFONT << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << std::endl;\n break;\n }\n case LogLevel::Error: {\n if(coloredLogging) {\n std::cerr << ESCAPE_RED_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Error] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND << std::endl;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Warn: {\n if(coloredLogging) {\n std::cerr << ESCAPE_YELLOW_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Warning] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Info: {\n if(coloredLogging) {\n std::cerr << ESCAPE_GREEN_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Info] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Debug: {\n if(coloredLogging) {\n std::cerr << ESCAPE_BLUE_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Debug] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Trace: {\n if(coloredLogging) {\n std::cerr << ESCAPE_CYAN_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Trace] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n default: {\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Unknown] \" << senderName << \" - \" << logMessage << std::endl;\n break;\n }\n }\n}\n\nFileLogSink::FileLogSink(const std::string& filename) : fout(filename.c_str()), filename(filename) {\n}\n\nFileLogSink::~FileLogSink() {\n fout.close();\n}\n\nvoid FileLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n printDateTime(timestamp, fout);\n \/\/Not flushing (endl) would be faster, but log msgs before a crash might be lost\n fout << \" [\" << logLevelToString(logLevel) << \"] \" << senderName << \" - \" << logMessage << std::endl;\n}\n\nBufferLogSink::LogMessage::LogMessage(LogLevel level, uint64_t timestamp, const std::string& message, const std::string& sender) : level(level), timestamp(timestamp), message(message), sender(sender) {\n}\n\nBufferLogSink::BufferLogSink(size_t maxBufferSize) : maxBufferSize(maxBufferSize), bufferMutex() {\n \n}\n\nBufferLogSink::~BufferLogSink() {\n \n}\n\nstd::deque<BufferLogSink::LogMessage>& BufferLogSink::getLogMessages() {\n bufferMutex.lock();\n return buffer;\n}\n\nvoid BufferLogSink::unlock() {\n bufferMutex.unlock();\n}\n\nvoid BufferLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n \/\/Create the entry\n bufferMutex.lock();\n buffer.emplace_front(logLevel, timestamp, logMessage, senderName);\n \/\/Expunge the first msgs if buffer is full\n if(buffer.size() > maxBufferSize) {\n buffer.pop_back();\n }\n bufferMutex.unlock();\n}<commit_msg>Reversed logging order<commit_after>#include \"LogSinks.hpp\"\n#include \"macros.hpp\"\n#include <unistd.h>\n#include <iostream>\n#include <ctime>\n#include <sstream>\n\nstatic const char* const ESCAPE_BOLD = \"\\x1B[1m\";\nstatic const char* const ESCAPE_NORMALFONT = \"\\x1B[0m\";\nstatic const char* const ESCAPE_BLACK_FOREGROUND = \"\\x1B[30m\";\nstatic const char* const ESCAPE_RED_FOREGROUND = \"\\x1B[31m\";\nstatic const char* const ESCAPE_GREEN_FOREGROUND = \"\\x1B[32m\";\nstatic const char* const ESCAPE_YELLOW_FOREGROUND = \"\\x1B[33m\";\nstatic const char* const ESCAPE_BLUE_FOREGROUND = \"\\x1B[34m\";\nstatic const char* const ESCAPE_MAGENTA_FOREGROUND = \"\\x1B[35m\";\nstatic const char* const ESCAPE_CYAN_FOREGROUND = \"\\x1B[36m\";\nstatic const char* const ESCAPE_WHITE_FOREGROUND = \"\\x1B[37m\";\n\nstatic void HOT printDateTime(uint64_t timestamp, std::ostream& stream) {\n \/\/Convert timestamp to timeval\n struct timeval tv;\n tv.tv_sec = timestamp \/ 1000;\n tv.tv_usec = (timestamp % 1000) * 1000;\n \/\/Format the tm data\n char dateBuffer[32];\n size_t formattedLength = strftime(dateBuffer, 32, \"%F %T\", localtime(&(tv.tv_sec)));\n assert(formattedLength > 0);\n \/\/Format the subsecond part\n snprintf(dateBuffer + formattedLength, 32 - formattedLength, \".%03lu\", (unsigned long) (tv.tv_usec \/ 1000));\n stream << '[' << dateBuffer << ']';\n}\n\n\nstd::string logLevelToString(LogLevel logLevel) {\n switch (logLevel) {\n case LogLevel::Critical: {\n return \"Critical\";\n }\n case LogLevel::Error: {\n return \"Error\";\n }\n case LogLevel::Warn: {\n return \"Warn\";\n }\n case LogLevel::Info: {\n return \"Info\";\n }\n case LogLevel::Debug: {\n return \"Debug\";\n }\n case LogLevel::Trace: {\n return \"Trace\";\n }\n default: {\n return \"Unknown\";\n }\n }\n}\n\nLogSink::~LogSink() {\n \n}\n\nStderrLogSink::StderrLogSink() : coloredLogging(isatty(fileno(stderr))) {\n\n}\n\nvoid StderrLogSink::setColoredLogging(bool value) {\n this->coloredLogging = value;\n}\n\nvoid HOT StderrLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n\n switch (logLevel) {\n case LogLevel::Critical: {\n if(coloredLogging) {\n std::cerr << ESCAPE_BOLD << ESCAPE_RED_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Error] \" << senderName << \" - \" << logMessage;\n if(coloredLogging) {\n std::cerr << ESCAPE_NORMALFONT << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << std::endl;\n break;\n }\n case LogLevel::Error: {\n if(coloredLogging) {\n std::cerr << ESCAPE_RED_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Error] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND << std::endl;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Warn: {\n if(coloredLogging) {\n std::cerr << ESCAPE_YELLOW_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Warning] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Info: {\n if(coloredLogging) {\n std::cerr << ESCAPE_GREEN_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Info] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Debug: {\n if(coloredLogging) {\n std::cerr << ESCAPE_BLUE_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Debug] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n case LogLevel::Trace: {\n if(coloredLogging) {\n std::cerr << ESCAPE_CYAN_FOREGROUND;\n }\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Trace] \" << senderName << \" - \";\n if(coloredLogging) {\n std::cerr << ESCAPE_BLACK_FOREGROUND;\n }\n std::cerr << logMessage << std::endl;\n break;\n }\n default: {\n printDateTime(timestamp, std::cerr);\n std::cerr << \"[Unknown] \" << senderName << \" - \" << logMessage << std::endl;\n break;\n }\n }\n}\n\nFileLogSink::FileLogSink(const std::string& filename) : fout(filename.c_str()), filename(filename) {\n}\n\nFileLogSink::~FileLogSink() {\n fout.close();\n}\n\nvoid FileLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n printDateTime(timestamp, fout);\n \/\/Not flushing (endl) would be faster, but log msgs before a crash might be lost\n fout << \" [\" << logLevelToString(logLevel) << \"] \" << senderName << \" - \" << logMessage << std::endl;\n}\n\nBufferLogSink::LogMessage::LogMessage(LogLevel level, uint64_t timestamp, const std::string& message, const std::string& sender) : level(level), timestamp(timestamp), message(message), sender(sender) {\n}\n\nBufferLogSink::BufferLogSink(size_t maxBufferSize) : maxBufferSize(maxBufferSize), bufferMutex() {\n \n}\n\nBufferLogSink::~BufferLogSink() {\n \n}\n\nstd::deque<BufferLogSink::LogMessage>& BufferLogSink::getLogMessages() {\n bufferMutex.lock();\n return buffer;\n}\n\nvoid BufferLogSink::unlock() {\n bufferMutex.unlock();\n}\n\nvoid BufferLogSink::log(LogLevel logLevel, uint64_t timestamp, const std::string& senderName, const std::string& logMessage) {\n \/\/Create the entry\n bufferMutex.lock();\n buffer.emplace_back(logLevel, timestamp, logMessage, senderName);\n \/\/Expunge the first msgs if buffer is full\n if(buffer.size() > maxBufferSize) {\n buffer.pop_front();\n }\n bufferMutex.unlock();\n}<|endoftext|>"} {"text":"<commit_before>\nint GetFontHeight(void *TheFont)\n{\n \/\/MSG(\"GetFontHeight()\");\n return static_cast<objFont *>(TheFont)->MaxHeight;\n}\n\nint GetFontLeading(void *TheFont)\n{\n \/\/MSG(\"GetFontLeading()\");\n return static_cast<objFont *>(TheFont)->Leading;\n}\n\nint GetFontGutter(void *TheFont)\n{\n \/\/MSG(\"GetFontGutter()\");\n return static_cast<objFont *>(TheFont)->Gutter;\n}\n\n\/*****************************************************************************\n** Point class\n*\/\n\nScintilla::Point Scintilla::Point::FromLong(long lpoint)\n{\n return Scintilla::Point(Scintilla::Platform::LowShortFromLong(lpoint),\n Scintilla::Platform::HighShortFromLong(lpoint));\n}\n\n\/*****************************************************************************\n** Palette class. Functionality not required as we only use 32 bit colours.\n*\/\n\nScintilla::Palette::Palette() { }\nScintilla::Palette::~Palette() { }\nvoid Scintilla::Palette::Release() { }\nvoid Scintilla::Palette::Allocate(Scintilla::Window &w) { }\n\nvoid Scintilla::Palette::WantFind(Scintilla::ColourPair &cp, bool want)\n{\n cp.allocated.Set(cp.desired.AsLong());\n}\n\n\/*****************************************************************************\n** Font class\n**\n** Not really supported as we only need to allocate 3 main fonts in the\n** Scintilla class to serve all of our font needs in an edited document.\n** Scintilla will try to create a font for every style allocated, which is\n** overkill.\n*\/\n\nScintilla::Font::Font()\n{\n bold = 0;\n italic = 0;\n}\n\nScintilla::Font::~Font()\n{\n\n}\n\nvoid Scintilla::Font::Create(const char *faceName, int characterSet, int size, bool bold_, bool italic_, int)\n{\n bold = bold_;\n italic = italic_;\n\n FMSG(\"Font::Create:\",\"Face: %s, Style:%s%s\", faceName, (bold) ? \" Bold\" : \"\", (italic) ? \" Italic\" : \"\");\n}\n\nvoid Scintilla::Font::Release()\n{\n}\n\n\/*****************************************************************************\n** BitmapClipper class\n**\n** Utility class used by SurfacePan\n*\/\n\nclass BitmapClipper\n{\npublic:\n BitmapClipper(struct rkBitmap *bitmap_, const Scintilla::PRectangle& cliprect) : bitmap(bitmap_)\n {\n \/*** Save old clipping rectangle ***\/\n\n saved_cliprect.left = bitmap->Clip.Left;\n saved_cliprect.top = bitmap->Clip.Top;\n saved_cliprect.right = bitmap->Clip.Right;\n saved_cliprect.bottom = bitmap->Clip.Bottom;\n\n \/*** Apply new clipping rectangle ***\/\n\n bitmap->Clip.Left = MAX(bitmap->Clip.Left, cliprect.left);\n bitmap->Clip.Top = MAX(bitmap->Clip.Top, cliprect.top);\n bitmap->Clip.Right = MIN(bitmap->Clip.Right, cliprect.right);\n bitmap->Clip.Bottom = MIN(bitmap->Clip.Bottom, cliprect.bottom);\n }\n\n ~BitmapClipper()\n {\n \/*** Restore old clipping rectangle ***\/\n\n bitmap->Clip.Left = saved_cliprect.left;\n bitmap->Clip.Top = saved_cliprect.top;\n bitmap->Clip.Right = saved_cliprect.right;\n bitmap->Clip.Bottom = saved_cliprect.bottom;\n }\n\nprivate:\n struct rkBitmap *bitmap;\n Scintilla::PRectangle saved_cliprect;\n};\n\n\/*****************************************************************************\n** DynamicLibraryImpl class\n*\/\n\nclass DynamicLibraryImpl : public Scintilla::DynamicLibrary\n{\nprotected:\n\npublic:\n DynamicLibraryImpl(const char *modulePath)\n {\n LogF(\"DynamicLibraryImpl::DynamicLibraryImpl():\",\"path: %s\", modulePath);\n }\n\n virtual ~DynamicLibraryImpl()\n {\n\n }\n\n \/\/ Use g_module_symbol to get a pointer to the relevant function.\n virtual void * FindFunction(const char *name)\n {\n LogF(\"DynamicLibraryImpl::FindFunction():\",\"name: %s\", name);\n return NULL;\/* TEMP *\/\n }\n\n virtual bool IsValid()\n {\n return TRUE;\/* TEMP HACK *\/\n }\n};\n\nScintilla::DynamicLibrary * Scintilla::DynamicLibrary::Load(const char *modulePath)\n{\n LogF(\"DynamicLibraryImpl::Load():\",\"modulePath: %s\", modulePath);\n return static_cast<DynamicLibrary *>( new DynamicLibraryImpl(modulePath) );\n}\n\n\/*****************************************************************************\n** ElapsedTime class\n*\/\n\nScintilla::ElapsedTime::ElapsedTime()\n{\n Duration(TRUE);\/\/reset time\n}\n\ndouble Scintilla::ElapsedTime::Duration(bool reset)\n{\n LARGE systime = PreciseTime() \/ 1000LL;\n LARGE lasttime = ((LARGE)bigBit<<32) + *(ULONG*)&littleBit;\n DOUBLE elapsed = systime - lasttime;\n\n if (reset) {\n bigBit = (long)(systime>>32);\n *(ULONG*)&littleBit = (systime & 0xFFFFFFFF);\n }\n\n return elapsed * 0.001;\n}\n\n\/*****************************************************************************\n** Platform class\n*\/\n\nScintilla::ColourDesired Scintilla::Platform::Chrome()\n{\n return ColourDesired(0xe0, 0xe0, 0xe0);\n}\n\nScintilla::ColourDesired Scintilla::Platform::ChromeHighlight()\n{\n return Scintilla::ColourDesired(0xff, 0xff, 0xff);\n}\n\nconst char * Scintilla::Platform::DefaultFont()\n{\n return \"Courier\";\n}\n\nint Scintilla::Platform::DefaultFontSize()\n{\n return 20;\n}\n\nunsigned int Scintilla::Platform::DoubleClickTime()\n{\n return 500; \/\/ Half a second\n}\n\nbool Scintilla::Platform::MouseButtonBounce()\n{\n return true;\n}\n\nvoid Scintilla::Platform::DebugDisplay(const char *string)\n{\n LogF(\"Scintilla:\", string);\n}\n\nbool Scintilla::Platform::IsKeyDown(int)\n{\n LogF(\"Platform::IsKeyDown\",\"UNSUPPORTED\");\n\n \/\/ TODO: discover state of keys in GTK+\/X\n return false;\n}\n\nlong Scintilla::Platform::SendScintilla(Scintilla::WindowID w, unsigned int msg, unsigned long wParam, long lParam)\n{\n LogF(\"Platform::SendScintilla\",\"UNSUPPORTED\");\n return 0;\n}\n\nlong Scintilla::Platform::SendScintillaPointer(Scintilla::WindowID w, unsigned int msg, unsigned long wParam, void *lParam)\n{\n LogF(\"Platform::SendScintillaPointer\",\"UNSUPPORTED\");\n\n \/\/return scintilla_send_message(SCINTILLA(w), msg, wParam,\n \/\/ reinterpret_cast<sptr_t>(lParam));\n return 0;\n}\n\nbool Scintilla::Platform::IsDBCSLeadByte(int \/* codePage *\/, char \/* ch *\/)\n{\n return false;\n}\n\nint Scintilla::Platform::DBCSCharLength(int codePage, const char *s)\n{\n return 1;\/* TEMP HACK *\/\n \/*if (codePage == 999932) {\n \/\/ Experimental and disabled code - change 999932 to 932 above to\n \/\/ enable locale avoiding but expensive character length determination.\n \/\/ Avoid locale with explicit use of iconv\n Converter convMeasure(\"UCS-2\", CharacterSetID(SC_CHARSET_SHIFTJIS));\n size_t lenChar = MultiByteLenFromIconv(convMeasure, s, strlen(s));\n return lenChar;\n }\n else {\n int bytes = mblen(s, MB_CUR_MAX);\n if (bytes >= 1)\n return bytes;\n else\n return 1;\n }*\/\n}\n\n\nint Scintilla::Platform::DBCSCharMaxLength()\n{\n\/\/ return MB_CUR_MAX;\n \/\/return 2;\n\n return 1;\/* TEMP HACK *\/\n}\n\n\/\/ These are utility functions not really tied to a platform\n\nint Scintilla::Platform::Minimum(int a, int b)\n{\n if (a < b) return a;\n else return b;\n}\n\nint Scintilla::Platform::Maximum(int a, int b)\n{\n if (a > b) return a;\n else return b;\n}\n\n#ifdef DEBUG\nvoid Scintilla::Platform::DebugPrintf(const char *format, ...)\n{\n#if 1\n LONG *Array;\n Array = (LONG *)&format;\n LogF(\"Scintilla:\", (BYTE *)Array[0], Array[1], Array[2], Array[3], Array[4], Array[5], Array[6], Array[7], Array[8], Array[9], Array[10], Array[11]);\n#else\n char buffer[2000];\n va_list pArguments;\n va_start(pArguments, format);\n vsprintf(buffer, format, pArguments);\n va_end(pArguments);\n LogF(\"Scintilla:\", buffer);\n#endif\n}\n#else\nvoid Scintilla::Platform::DebugPrintf(const char *, ...) {}\n\n#endif\n\n\/\/ Not supported for GTK+\nstatic bool assertionPopUps = true;\n\nbool Scintilla::Platform::ShowAssertionPopUps(bool assertionPopUps_) {\n bool ret = assertionPopUps;\n assertionPopUps = assertionPopUps_;\n return ret;\n}\n\nvoid Scintilla::Platform::Assert(const char *c, const char *file, int line)\n{\n LogF(\"@Platform::Assert:\",\"%s, File %s, Line %d\", c, file, line);\n SelfDestruct();\n}\n\nint Scintilla::Platform::Clamp(int val, int minVal, int maxVal)\n{\n if (val > maxVal) val = maxVal;\n if (val < minVal) val = minVal;\n return val;\n}\n\nvoid Platform_Initialise()\n{\n\n}\n\nvoid Platform_Finalise()\n{\n\n}\n<commit_msg>Fixed log message bug in Scintilla<commit_after>\nint GetFontHeight(void *TheFont)\n{\n \/\/MSG(\"GetFontHeight()\");\n return static_cast<objFont *>(TheFont)->MaxHeight;\n}\n\nint GetFontLeading(void *TheFont)\n{\n \/\/MSG(\"GetFontLeading()\");\n return static_cast<objFont *>(TheFont)->Leading;\n}\n\nint GetFontGutter(void *TheFont)\n{\n \/\/MSG(\"GetFontGutter()\");\n return static_cast<objFont *>(TheFont)->Gutter;\n}\n\n\/*****************************************************************************\n** Point class\n*\/\n\nScintilla::Point Scintilla::Point::FromLong(long lpoint)\n{\n return Scintilla::Point(Scintilla::Platform::LowShortFromLong(lpoint),\n Scintilla::Platform::HighShortFromLong(lpoint));\n}\n\n\/*****************************************************************************\n** Palette class. Functionality not required as we only use 32 bit colours.\n*\/\n\nScintilla::Palette::Palette() { }\nScintilla::Palette::~Palette() { }\nvoid Scintilla::Palette::Release() { }\nvoid Scintilla::Palette::Allocate(Scintilla::Window &w) { }\n\nvoid Scintilla::Palette::WantFind(Scintilla::ColourPair &cp, bool want)\n{\n cp.allocated.Set(cp.desired.AsLong());\n}\n\n\/*****************************************************************************\n** Font class\n**\n** Not really supported as we only need to allocate 3 main fonts in the\n** Scintilla class to serve all of our font needs in an edited document.\n** Scintilla will try to create a font for every style allocated, which is\n** overkill.\n*\/\n\nScintilla::Font::Font()\n{\n bold = 0;\n italic = 0;\n}\n\nScintilla::Font::~Font()\n{\n\n}\n\nvoid Scintilla::Font::Create(const char *faceName, int characterSet, int size, bool bold_, bool italic_, int)\n{\n bold = bold_;\n italic = italic_;\n\n FMSG(\"Font::Create:\",\"Face: %s, Style:%s%s\", faceName, (bold) ? \" Bold\" : \"\", (italic) ? \" Italic\" : \"\");\n}\n\nvoid Scintilla::Font::Release()\n{\n}\n\n\/*****************************************************************************\n** BitmapClipper class\n**\n** Utility class used by SurfacePan\n*\/\n\nclass BitmapClipper\n{\npublic:\n BitmapClipper(struct rkBitmap *bitmap_, const Scintilla::PRectangle& cliprect) : bitmap(bitmap_)\n {\n \/*** Save old clipping rectangle ***\/\n\n saved_cliprect.left = bitmap->Clip.Left;\n saved_cliprect.top = bitmap->Clip.Top;\n saved_cliprect.right = bitmap->Clip.Right;\n saved_cliprect.bottom = bitmap->Clip.Bottom;\n\n \/*** Apply new clipping rectangle ***\/\n\n bitmap->Clip.Left = MAX(bitmap->Clip.Left, cliprect.left);\n bitmap->Clip.Top = MAX(bitmap->Clip.Top, cliprect.top);\n bitmap->Clip.Right = MIN(bitmap->Clip.Right, cliprect.right);\n bitmap->Clip.Bottom = MIN(bitmap->Clip.Bottom, cliprect.bottom);\n }\n\n ~BitmapClipper()\n {\n \/*** Restore old clipping rectangle ***\/\n\n bitmap->Clip.Left = saved_cliprect.left;\n bitmap->Clip.Top = saved_cliprect.top;\n bitmap->Clip.Right = saved_cliprect.right;\n bitmap->Clip.Bottom = saved_cliprect.bottom;\n }\n\nprivate:\n struct rkBitmap *bitmap;\n Scintilla::PRectangle saved_cliprect;\n};\n\n\/*****************************************************************************\n** DynamicLibraryImpl class\n*\/\n\nclass DynamicLibraryImpl : public Scintilla::DynamicLibrary\n{\nprotected:\n\npublic:\n DynamicLibraryImpl(const char *modulePath)\n {\n LogF(\"DynamicLibraryImpl::DynamicLibraryImpl():\",\"path: %s\", modulePath);\n }\n\n virtual ~DynamicLibraryImpl()\n {\n\n }\n\n \/\/ Use g_module_symbol to get a pointer to the relevant function.\n virtual void * FindFunction(const char *name)\n {\n LogF(\"DynamicLibraryImpl::FindFunction():\",\"name: %s\", name);\n return NULL;\/* TEMP *\/\n }\n\n virtual bool IsValid()\n {\n return TRUE;\/* TEMP HACK *\/\n }\n};\n\nScintilla::DynamicLibrary * Scintilla::DynamicLibrary::Load(const char *modulePath)\n{\n LogF(\"DynamicLibraryImpl::Load():\",\"modulePath: %s\", modulePath);\n return static_cast<DynamicLibrary *>( new DynamicLibraryImpl(modulePath) );\n}\n\n\/*****************************************************************************\n** ElapsedTime class\n*\/\n\nScintilla::ElapsedTime::ElapsedTime()\n{\n Duration(TRUE);\/\/reset time\n}\n\ndouble Scintilla::ElapsedTime::Duration(bool reset)\n{\n LARGE systime = PreciseTime() \/ 1000LL;\n LARGE lasttime = ((LARGE)bigBit<<32) + *(ULONG*)&littleBit;\n DOUBLE elapsed = systime - lasttime;\n\n if (reset) {\n bigBit = (long)(systime>>32);\n *(ULONG*)&littleBit = (systime & 0xFFFFFFFF);\n }\n\n return elapsed * 0.001;\n}\n\n\/*****************************************************************************\n** Platform class\n*\/\n\nScintilla::ColourDesired Scintilla::Platform::Chrome()\n{\n return ColourDesired(0xe0, 0xe0, 0xe0);\n}\n\nScintilla::ColourDesired Scintilla::Platform::ChromeHighlight()\n{\n return Scintilla::ColourDesired(0xff, 0xff, 0xff);\n}\n\nconst char * Scintilla::Platform::DefaultFont()\n{\n return \"Courier\";\n}\n\nint Scintilla::Platform::DefaultFontSize()\n{\n return 20;\n}\n\nunsigned int Scintilla::Platform::DoubleClickTime()\n{\n return 500; \/\/ Half a second\n}\n\nbool Scintilla::Platform::MouseButtonBounce()\n{\n return true;\n}\n\nvoid Scintilla::Platform::DebugDisplay(const char *string)\n{\n LogF(\"Scintilla:\", \"%s\", string);\n}\n\nbool Scintilla::Platform::IsKeyDown(int)\n{\n LogF(\"Platform::IsKeyDown\",\"UNSUPPORTED\");\n\n \/\/ TODO: discover state of keys in GTK+\/X\n return false;\n}\n\nlong Scintilla::Platform::SendScintilla(Scintilla::WindowID w, unsigned int msg, unsigned long wParam, long lParam)\n{\n LogF(\"Platform::SendScintilla\",\"UNSUPPORTED\");\n return 0;\n}\n\nlong Scintilla::Platform::SendScintillaPointer(Scintilla::WindowID w, unsigned int msg, unsigned long wParam, void *lParam)\n{\n LogF(\"Platform::SendScintillaPointer\",\"UNSUPPORTED\");\n\n \/\/return scintilla_send_message(SCINTILLA(w), msg, wParam,\n \/\/ reinterpret_cast<sptr_t>(lParam));\n return 0;\n}\n\nbool Scintilla::Platform::IsDBCSLeadByte(int \/* codePage *\/, char \/* ch *\/)\n{\n return false;\n}\n\nint Scintilla::Platform::DBCSCharLength(int codePage, const char *s)\n{\n return 1;\/* TEMP HACK *\/\n \/*if (codePage == 999932) {\n \/\/ Experimental and disabled code - change 999932 to 932 above to\n \/\/ enable locale avoiding but expensive character length determination.\n \/\/ Avoid locale with explicit use of iconv\n Converter convMeasure(\"UCS-2\", CharacterSetID(SC_CHARSET_SHIFTJIS));\n size_t lenChar = MultiByteLenFromIconv(convMeasure, s, strlen(s));\n return lenChar;\n }\n else {\n int bytes = mblen(s, MB_CUR_MAX);\n if (bytes >= 1)\n return bytes;\n else\n return 1;\n }*\/\n}\n\n\nint Scintilla::Platform::DBCSCharMaxLength()\n{\n\/\/ return MB_CUR_MAX;\n \/\/return 2;\n\n return 1;\/* TEMP HACK *\/\n}\n\n\/\/ These are utility functions not really tied to a platform\n\nint Scintilla::Platform::Minimum(int a, int b)\n{\n if (a < b) return a;\n else return b;\n}\n\nint Scintilla::Platform::Maximum(int a, int b)\n{\n if (a > b) return a;\n else return b;\n}\n\n#ifdef DEBUG\nvoid Scintilla::Platform::DebugPrintf(const char *format, ...)\n{\n#if 1\n LONG *Array;\n Array = (LONG *)&format;\n LogF(\"Scintilla:\", (BYTE *)Array[0], Array[1], Array[2], Array[3], Array[4], Array[5], Array[6], Array[7], Array[8], Array[9], Array[10], Array[11]);\n#else\n char buffer[2000];\n va_list pArguments;\n va_start(pArguments, format);\n vsprintf(buffer, format, pArguments);\n va_end(pArguments);\n LogF(\"Scintilla:\", buffer);\n#endif\n}\n#else\nvoid Scintilla::Platform::DebugPrintf(const char *, ...) {}\n\n#endif\n\n\/\/ Not supported for GTK+\nstatic bool assertionPopUps = true;\n\nbool Scintilla::Platform::ShowAssertionPopUps(bool assertionPopUps_) {\n bool ret = assertionPopUps;\n assertionPopUps = assertionPopUps_;\n return ret;\n}\n\nvoid Scintilla::Platform::Assert(const char *c, const char *file, int line)\n{\n LogF(\"@Platform::Assert:\",\"%s, File %s, Line %d\", c, file, line);\n SelfDestruct();\n}\n\nint Scintilla::Platform::Clamp(int val, int minVal, int maxVal)\n{\n if (val > maxVal) val = maxVal;\n if (val < minVal) val = minVal;\n return val;\n}\n\nvoid Platform_Initialise()\n{\n\n}\n\nvoid Platform_Finalise()\n{\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* +---------------------------------------------------------------------------+\n | Mobile Robot Programming Toolkit (MRPT) |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2016, Individual contributors, see AUTHORS file |\n | See: http:\/\/www.mrpt.org\/Authors - All rights reserved. |\n | Released under BSD License. See details in http:\/\/www.mrpt.org\/License |\n +---------------------------------------------------------------------------+ *\/\n\n#include \"base-precomp.h\" \/\/ Precompiled headers\n\n#include <mrpt\/utils\/CStream.h>\n#include <mrpt\/utils\/CFileOutputStream.h>\n#include <mrpt\/utils\/COutputLogger.h>\n#include <mrpt\/system\/threads.h>\n#include <cstdio>\n#include <sstream>\n#include <iostream>\n#include <cstdarg> \/\/ for logFmt\n\n#ifdef _MSC_VER\n\t#define WIN32_LEAN_AND_MEAN\n\t#include <windows.h> \/\/ OutputDebugString() for MSVC\n#endif\n\nnamespace std {\nbool operator <(const mrpt::utils::COutputLogger::TCallbackEntry &e1, const mrpt::utils::COutputLogger::TCallbackEntry &e2)\n{\n\treturn e1.func<e2.func;\n}\n}\n\nusing namespace mrpt;\nusing namespace mrpt::system;\nusing namespace mrpt::utils;\n\nusing namespace std;\n\n\n\/**\n * Implementation file for the COutputLogger header class\n *\/\n\n\/\/ COutputLogger\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nmrpt::system::TConsoleColor COutputLogger::logging_levels_to_colors[NUMBER_OF_VERBOSITY_LEVELS] = {\n\tCONCOL_BLUE, \/\/ LVL_DEBUG\n\tCONCOL_NORMAL, \/\/ LVL_INFO\n\tCONCOL_GREEN, \/\/ LVL_WARN\n\tCONCOL_RED \/\/ LVL_ERROR\n};\n\nstd::string COutputLogger::logging_levels_to_names[NUMBER_OF_VERBOSITY_LEVELS] = {\n \t\"DEBUG\", \/\/LVL_DEBUG\n\t\"INFO \", \/\/ LVL_INFO\n\t\"WARN \", \/\/ LVL_WARN\n\t\"ERROR\" \/\/ LVL_ERROR\n};\n\nCOutputLogger::COutputLogger(const std::string &name) {\n\tthis->loggerReset();\n\tm_logger_name = name;\n\n}\nCOutputLogger::COutputLogger() {\n\tthis->loggerReset();\n}\nCOutputLogger::~COutputLogger() { }\n\nvoid COutputLogger::logStr(const VerbosityLevel level, const std::string& msg_str) const {\n\tif (level<m_min_verbosity_level)\n\t\treturn;\n\n\t\/\/ initialize a TMsg object\n\tTMsg msg(level, msg_str, *this);\n\tif (logging_enable_keep_record)\n\t\tm_history.push_back(msg);\n\n\tif (logging_enable_console_output) {\n\t\tmsg.dumpToConsole();\n\n\t\t\/\/ User callbacks:\n\t\tfor (const auto &c : m_listCallbacks)\n\t\t\t(*c.func)(msg.body,msg.level,msg.name,msg.timestamp,c.userParam);\n\t}\n}\n\nvoid COutputLogger::logFmt(const VerbosityLevel level, const char* fmt, ...) const {\n\t\/\/ see MRPT\/libs\/base\/src\/utils\/CDeugOutputCapable.cpp for the iniitial\n\t\/\/ implementtion\n\n\t\/\/ check for NULL pointer\n\tif (!fmt) return;\n\n\t\/\/ initialize the va_list and let generateStringFromFormat do the work\n\t\/\/ http:\/\/c-faq.com\/varargs\/handoff.html\n\tva_list argp;\n\tva_start(argp, fmt);\n\tstd::string str = this->generateStringFromFormat(fmt, argp);\n\tva_end(argp);\n\n\tthis->logStr(level,str);\n}\n\nstd::string COutputLogger::generateStringFromFormat(const char* fmt, va_list argp) const{\n\tint result = -1, length = 1024;\n\tstd::vector<char> buffer;\n\t\/\/ make sure that the buffer is large enough to handle the string\n\twhile (result == -1)\n\t{\n\t\tbuffer.resize(length + 10);\n\t\tresult = os::vsnprintf(&buffer[0], length, fmt, argp);\n\n\t\t\/\/ http:\/\/www.cplusplus.com\/reference\/cstdio\/vsnprintf\/\n\t\t\/\/ only when this returned value is non-negative and less than n, the\n\t\t\/\/ string has been completely written\n\t\tif (result>=length) result=-1;\n\t\tlength*=2;\n\t}\n\n\t\/\/ return result to the caller\n\treturn std::string(&buffer[0]);\n\n}\nvoid COutputLogger::logCond(const VerbosityLevel level, bool cond, const std::string& msg_str) const\n{\n\tif (!cond) return;\n\tthis->logStr(level,msg_str);\n}\n\nvoid COutputLogger::setLoggerName(const std::string& name) { m_logger_name = name; }\n\nstd::string COutputLogger::getLoggerName() const { return m_logger_name; }\n\nvoid COutputLogger::setMinLoggingLevel(const VerbosityLevel level \/*= LVL_INFO *\/) {\n\tm_min_verbosity_level = level;\n}\nvoid COutputLogger::setVerbosityLevel(const VerbosityLevel level) { \n\tm_min_verbosity_level = level;\n}\n\nvoid COutputLogger::getLogAsString(std::string& fname) const {\n\tfname.clear();\n\tfor (const auto & h : m_history)\n\t\tfname += h.getAsString();\n}\nstd::string COutputLogger::getLogAsString() const{\n\tstd::string str;\n\tthis->getLogAsString(str);\n\treturn str;\n}\nvoid COutputLogger::writeLogToFile(const std::string* fname_in \/* = NULL *\/) const {\n\t\/\/ determine the filename - open it\n\tstd::string fname;\n\tif (fname_in) {\n\t\tfname = *fname_in;\n\t}\n\telse {\n\t\tfname = m_logger_name + \".log\";\n\t}\n\tCFileOutputStream fstream(fname);\n\tASSERTMSG_(fstream.fileOpenCorrectly(),\n\t\t\tmrpt::format(\"\\n[%s:] Could not open external file: %s\",\n\t\t\t\tm_logger_name.c_str(), fname.c_str()) );\n\n\tstd::string hist_str;\n\tthis->getLogAsString(hist_str);\n\tfstream.printf(\"%s\", hist_str.c_str());\n\tfstream.close();\n}\n\nvoid COutputLogger::dumpLogToConsole() const{\n\tfor (const auto &h :m_history)\n\t\th.dumpToConsole();\n}\n\nstd::string COutputLogger::getLoggerLastMsg() const {\n\tTMsg last_msg = m_history.back();\n\treturn last_msg.getAsString();\n}\n\nvoid COutputLogger::getLoggerLastMsg(std::string& msg_str) const {\n\tmsg_str = this->getLoggerLastMsg();\n}\n\n\nvoid COutputLogger::loggerReset() {\n\tm_logger_name = \"log\"; \/\/ just the default name\n\n\tm_history.clear();\n\tlogging_enable_console_output = true;\n\tlogging_enable_keep_record = false;\n\n\t\/\/ set the minimum logging level allowed for printing. By default its\n\t\/\/ LVL_INFO\n\tm_min_verbosity_level = LVL_INFO;\n}\n\n\/\/ TMsg Struct\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCOutputLogger::TMsg::TMsg(const mrpt::utils::VerbosityLevel level, const std::string& msg_str, const COutputLogger& logger) {\n\tthis->reset();\n\n\tname = logger.getLoggerName();\n\tthis->level = level;\n\ttimestamp = mrpt::system::getCurrentTime(); \/\/ fill with the current time\n\tbody = msg_str;\n}\nCOutputLogger::TMsg::~TMsg() { }\n\nvoid COutputLogger::TMsg::reset() {\n\ttimestamp = INVALID_TIMESTAMP;\n\tlevel = LVL_INFO;\n\tname = \"Message\"; \/\/ default name\n\tbody.clear(); \n}\n\nstd::string COutputLogger::TMsg::getAsString() const {\n\tstringstream out;\n\tout.str(\"\");\n\tout << \"[\" << name << \"|\" << COutputLogger::logging_levels_to_names[level] << \"|\" \n\t\t<< mrpt::system::timeLocalToString(timestamp,4) \n\t\t<< \"] \" << body;\n\tif (!body.empty() && *body.rbegin()!='\\n')\n\t\tout<<std::endl;\n\n\treturn out.str();\n}\nvoid COutputLogger::TMsg::getAsString(std::string* contents) const {\n\t*contents = this->getAsString();\n}\nvoid COutputLogger::TMsg::writeToStream(mrpt::utils::CStream& out) const {\n\tconst std::string str = getAsString();\n\tout.printf(\"%s\", str.c_str());\n#ifdef _MSC_VER\n\tOutputDebugStringA(str.c_str());\n#endif\n}\nvoid COutputLogger::TMsg::dumpToConsole() const {\n\tconst std::string str = getAsString();\n\n\tconst bool dump_to_cerr = (level==LVL_ERROR); \/\/ LVL_ERROR alternatively dumped to stderr instead of stdout\n\n\t\/\/ Set console color:\n\tconst TConsoleColor concol = COutputLogger::logging_levels_to_colors[level];\n\tif (concol!=CONCOL_NORMAL)\n\t\tmrpt::system::setConsoleColor(concol, dump_to_cerr);\n\t\/\/ Output msg:\n\t::fputs(str.c_str(), dump_to_cerr ? stderr:stdout );\n\t\/\/ Switch back to normal color:\n\tif (concol!=CONCOL_NORMAL)\n\t\tmrpt::system::setConsoleColor(CONCOL_NORMAL);\n#ifdef _MSC_VER\n\tOutputDebugStringA(str.c_str());\n#endif\n}\n\nvoid COutputLogger::logRegisterCallback(output_logger_callback_t userFunc, void *userParam )\n{\n\tASSERT_(userFunc!=NULL);\n\tTCallbackEntry cbe;\n\tcbe.func = userFunc;\n\tcbe.userParam = userParam;\n\tm_listCallbacks.insert(cbe);\n}\n\nvoid COutputLogger::logDeregisterCallback(output_logger_callback_t userFunc, void *userParam )\n{\n\tASSERT_(userFunc!=NULL);\n\tTCallbackEntry cbe;\n\tcbe.func = userFunc;\n\tcbe.userParam = userParam;\n\tm_listCallbacks.erase(cbe);\n}\n\n<commit_msg>Outputlogger: fix callbacks when console is disabled; cout instead of stdout<commit_after>\/* +---------------------------------------------------------------------------+\n | Mobile Robot Programming Toolkit (MRPT) |\n | http:\/\/www.mrpt.org\/ |\n | |\n | Copyright (c) 2005-2016, Individual contributors, see AUTHORS file |\n | See: http:\/\/www.mrpt.org\/Authors - All rights reserved. |\n | Released under BSD License. See details in http:\/\/www.mrpt.org\/License |\n +---------------------------------------------------------------------------+ *\/\n\n#include \"base-precomp.h\" \/\/ Precompiled headers\n\n#include <mrpt\/utils\/CStream.h>\n#include <mrpt\/utils\/CFileOutputStream.h>\n#include <mrpt\/utils\/COutputLogger.h>\n#include <mrpt\/system\/threads.h>\n#include <cstdio>\n#include <sstream>\n#include <iostream>\n#include <cstdarg> \/\/ for logFmt\n\n#ifdef _MSC_VER\n\t#define WIN32_LEAN_AND_MEAN\n\t#include <windows.h> \/\/ OutputDebugString() for MSVC\n#endif\n\nnamespace std {\nbool operator <(const mrpt::utils::COutputLogger::TCallbackEntry &e1, const mrpt::utils::COutputLogger::TCallbackEntry &e2)\n{\n\treturn e1.func<e2.func;\n}\n}\n\nusing namespace mrpt;\nusing namespace mrpt::system;\nusing namespace mrpt::utils;\n\nusing namespace std;\n\n\n\/**\n * Implementation file for the COutputLogger header class\n *\/\n\n\/\/ COutputLogger\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nmrpt::system::TConsoleColor COutputLogger::logging_levels_to_colors[NUMBER_OF_VERBOSITY_LEVELS] = {\n\tCONCOL_BLUE, \/\/ LVL_DEBUG\n\tCONCOL_NORMAL, \/\/ LVL_INFO\n\tCONCOL_GREEN, \/\/ LVL_WARN\n\tCONCOL_RED \/\/ LVL_ERROR\n};\n\nstd::string COutputLogger::logging_levels_to_names[NUMBER_OF_VERBOSITY_LEVELS] = {\n \t\"DEBUG\", \/\/LVL_DEBUG\n\t\"INFO \", \/\/ LVL_INFO\n\t\"WARN \", \/\/ LVL_WARN\n\t\"ERROR\" \/\/ LVL_ERROR\n};\n\nCOutputLogger::COutputLogger(const std::string &name) {\n\tthis->loggerReset();\n\tm_logger_name = name;\n\n}\nCOutputLogger::COutputLogger() {\n\tthis->loggerReset();\n}\nCOutputLogger::~COutputLogger() { }\n\nvoid COutputLogger::logStr(const VerbosityLevel level, const std::string& msg_str) const {\n\tif (level<m_min_verbosity_level)\n\t\treturn;\n\n\t\/\/ initialize a TMsg object\n\tTMsg msg(level, msg_str, *this);\n\tif (logging_enable_keep_record)\n\t\tm_history.push_back(msg);\n\n\tif (logging_enable_console_output) {\n\t\tmsg.dumpToConsole();\n\t}\n\n\t\/\/ User callbacks:\n\tfor (const auto &c : m_listCallbacks)\n\t\t(*c.func)(msg.body,msg.level,msg.name,msg.timestamp,c.userParam);\n}\n\nvoid COutputLogger::logFmt(const VerbosityLevel level, const char* fmt, ...) const {\n\t\/\/ see MRPT\/libs\/base\/src\/utils\/CDeugOutputCapable.cpp for the iniitial\n\t\/\/ implementtion\n\n\t\/\/ check for NULL pointer\n\tif (!fmt) return;\n\n\t\/\/ initialize the va_list and let generateStringFromFormat do the work\n\t\/\/ http:\/\/c-faq.com\/varargs\/handoff.html\n\tva_list argp;\n\tva_start(argp, fmt);\n\tstd::string str = this->generateStringFromFormat(fmt, argp);\n\tva_end(argp);\n\n\tthis->logStr(level,str);\n}\n\nstd::string COutputLogger::generateStringFromFormat(const char* fmt, va_list argp) const{\n\tint result = -1, length = 1024;\n\tstd::vector<char> buffer;\n\t\/\/ make sure that the buffer is large enough to handle the string\n\twhile (result == -1)\n\t{\n\t\tbuffer.resize(length + 10);\n\t\tresult = os::vsnprintf(&buffer[0], length, fmt, argp);\n\n\t\t\/\/ http:\/\/www.cplusplus.com\/reference\/cstdio\/vsnprintf\/\n\t\t\/\/ only when this returned value is non-negative and less than n, the\n\t\t\/\/ string has been completely written\n\t\tif (result>=length) result=-1;\n\t\tlength*=2;\n\t}\n\n\t\/\/ return result to the caller\n\treturn std::string(&buffer[0]);\n\n}\nvoid COutputLogger::logCond(const VerbosityLevel level, bool cond, const std::string& msg_str) const\n{\n\tif (!cond) return;\n\tthis->logStr(level,msg_str);\n}\n\nvoid COutputLogger::setLoggerName(const std::string& name) { m_logger_name = name; }\n\nstd::string COutputLogger::getLoggerName() const { return m_logger_name; }\n\nvoid COutputLogger::setMinLoggingLevel(const VerbosityLevel level \/*= LVL_INFO *\/) {\n\tm_min_verbosity_level = level;\n}\nvoid COutputLogger::setVerbosityLevel(const VerbosityLevel level) { \n\tm_min_verbosity_level = level;\n}\n\nvoid COutputLogger::getLogAsString(std::string& fname) const {\n\tfname.clear();\n\tfor (const auto & h : m_history)\n\t\tfname += h.getAsString();\n}\nstd::string COutputLogger::getLogAsString() const{\n\tstd::string str;\n\tthis->getLogAsString(str);\n\treturn str;\n}\nvoid COutputLogger::writeLogToFile(const std::string* fname_in \/* = NULL *\/) const {\n\t\/\/ determine the filename - open it\n\tstd::string fname;\n\tif (fname_in) {\n\t\tfname = *fname_in;\n\t}\n\telse {\n\t\tfname = m_logger_name + \".log\";\n\t}\n\tCFileOutputStream fstream(fname);\n\tASSERTMSG_(fstream.fileOpenCorrectly(),\n\t\t\tmrpt::format(\"\\n[%s:] Could not open external file: %s\",\n\t\t\t\tm_logger_name.c_str(), fname.c_str()) );\n\n\tstd::string hist_str;\n\tthis->getLogAsString(hist_str);\n\tfstream.printf(\"%s\", hist_str.c_str());\n\tfstream.close();\n}\n\nvoid COutputLogger::dumpLogToConsole() const{\n\tfor (const auto &h :m_history)\n\t\th.dumpToConsole();\n}\n\nstd::string COutputLogger::getLoggerLastMsg() const {\n\tTMsg last_msg = m_history.back();\n\treturn last_msg.getAsString();\n}\n\nvoid COutputLogger::getLoggerLastMsg(std::string& msg_str) const {\n\tmsg_str = this->getLoggerLastMsg();\n}\n\n\nvoid COutputLogger::loggerReset() {\n\tm_logger_name = \"log\"; \/\/ just the default name\n\n\tm_history.clear();\n\tlogging_enable_console_output = true;\n\tlogging_enable_keep_record = false;\n\n\t\/\/ set the minimum logging level allowed for printing. By default its\n\t\/\/ LVL_INFO\n\tm_min_verbosity_level = LVL_INFO;\n}\n\n\/\/ TMsg Struct\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nCOutputLogger::TMsg::TMsg(const mrpt::utils::VerbosityLevel level, const std::string& msg_str, const COutputLogger& logger) {\n\tthis->reset();\n\n\tname = logger.getLoggerName();\n\tthis->level = level;\n\ttimestamp = mrpt::system::getCurrentTime(); \/\/ fill with the current time\n\tbody = msg_str;\n}\nCOutputLogger::TMsg::~TMsg() { }\n\nvoid COutputLogger::TMsg::reset() {\n\ttimestamp = INVALID_TIMESTAMP;\n\tlevel = LVL_INFO;\n\tname = \"Message\"; \/\/ default name\n\tbody.clear(); \n}\n\nstd::string COutputLogger::TMsg::getAsString() const {\n\tstringstream out;\n\tout.str(\"\");\n\tout << \"[\" << name << \"|\" << COutputLogger::logging_levels_to_names[level] << \"|\" \n\t\t<< mrpt::system::timeLocalToString(timestamp,4) \n\t\t<< \"] \" << body;\n\tif (!body.empty() && *body.rbegin()!='\\n')\n\t\tout<<std::endl;\n\n\treturn out.str();\n}\nvoid COutputLogger::TMsg::getAsString(std::string* contents) const {\n\t*contents = this->getAsString();\n}\nvoid COutputLogger::TMsg::writeToStream(mrpt::utils::CStream& out) const {\n\tconst std::string str = getAsString();\n\tout.printf(\"%s\", str.c_str());\n#ifdef _MSC_VER\n\tOutputDebugStringA(str.c_str());\n#endif\n}\nvoid COutputLogger::TMsg::dumpToConsole() const {\n\tconst std::string str = getAsString();\n\n\tconst bool dump_to_cerr = (level==LVL_ERROR); \/\/ LVL_ERROR alternatively dumped to stderr instead of stdout\n\n\t\/\/ Set console color:\n\tconst TConsoleColor concol = COutputLogger::logging_levels_to_colors[level];\n\tif (concol!=CONCOL_NORMAL)\n\t\tmrpt::system::setConsoleColor(concol, dump_to_cerr);\n\t\/\/ Output msg:\n\t(dump_to_cerr ? std::cerr : std::cout) << str;\n\t\/\/ Switch back to normal color:\n\tif (concol!=CONCOL_NORMAL)\n\t\tmrpt::system::setConsoleColor(CONCOL_NORMAL);\n#ifdef _MSC_VER\n\tOutputDebugStringA(str.c_str());\n#endif\n}\n\nvoid COutputLogger::logRegisterCallback(output_logger_callback_t userFunc, void *userParam )\n{\n\tASSERT_(userFunc!=NULL);\n\tTCallbackEntry cbe;\n\tcbe.func = userFunc;\n\tcbe.userParam = userParam;\n\tm_listCallbacks.insert(cbe);\n}\n\nvoid COutputLogger::logDeregisterCallback(output_logger_callback_t userFunc, void *userParam )\n{\n\tASSERT_(userFunc!=NULL);\n\tTCallbackEntry cbe;\n\tcbe.func = userFunc;\n\tcbe.userParam = userParam;\n\tm_listCallbacks.erase(cbe);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tThis file is part of solidity.\n\n\tsolidity is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tsolidity is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with solidity. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/**\n * Analyzer part of inline assembly.\n *\/\n\n#include <libsolidity\/inlineasm\/AsmAnalysis.h>\n\n#include <libsolidity\/inlineasm\/AsmData.h>\n#include <libsolidity\/inlineasm\/AsmScopeFiller.h>\n#include <libsolidity\/inlineasm\/AsmScope.h>\n#include <libsolidity\/inlineasm\/AsmAnalysisInfo.h>\n\n#include <libsolidity\/interface\/Exceptions.h>\n#include <libsolidity\/interface\/Utils.h>\n\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include <memory>\n#include <functional>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::solidity;\nusing namespace dev::solidity::assembly;\n\nnamespace {\n\nset<string> const builtinTypes{\"bool\", \"u8\", \"s8\", \"u32\", \"s32\", \"u64\", \"s64\", \"u128\", \"s128\", \"u256\", \"s256\"};\n\n}\n\nbool AsmAnalyzer::analyze(Block const& _block)\n{\n\tif (!(ScopeFiller(m_info, m_errorReporter))(_block))\n\t\treturn false;\n\n\treturn (*this)(_block);\n}\n\nbool AsmAnalyzer::operator()(Label const& _label)\n{\n\tsolAssert(!m_julia, \"\");\n\tm_info.stackHeightInfo[&_label] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Instruction const& _instruction)\n{\n\tsolAssert(!m_julia, \"\");\n\tauto const& info = instructionInfo(_instruction.instruction);\n\tm_stackHeight += info.ret - info.args;\n\tm_info.stackHeightInfo[&_instruction] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Literal const& _literal)\n{\n\texpectValidType(_literal.type, _literal.location);\n\t++m_stackHeight;\n\tif (_literal.kind == assembly::LiteralKind::String && _literal.value.size() > 32)\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\t_literal.location,\n\t\t\t\"String literal too long (\" + boost::lexical_cast<std::string>(_literal.value.size()) + \" > 32)\"\n\t\t);\n\t\treturn false;\n\t}\n\tm_info.stackHeightInfo[&_literal] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Identifier const& _identifier)\n{\n\tsize_t numErrorsBefore = m_errorReporter.errors().size();\n\tbool success = true;\n\tif (m_currentScope->lookup(_identifier.name, Scope::Visitor(\n\t\t[&](Scope::Variable const& _var)\n\t\t{\n\t\t\tif (!_var.active)\n\t\t\t{\n\t\t\t\tm_errorReporter.declarationError(\n\t\t\t\t\t_identifier.location,\n\t\t\t\t\t\"Variable \" + _identifier.name + \" used before it was declared.\"\n\t\t\t\t);\n\t\t\t\tsuccess = false;\n\t\t\t}\n\t\t\t++m_stackHeight;\n\t\t},\n\t\t[&](Scope::Label const&)\n\t\t{\n\t\t\t++m_stackHeight;\n\t\t},\n\t\t[&](Scope::Function const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_identifier.location,\n\t\t\t\t\"Function \" + _identifier.name + \" used without being called.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t)))\n\t{\n\t}\n\telse\n\t{\n\t\tsize_t stackSize(-1);\n\t\tif (m_resolver)\n\t\t\tstackSize = m_resolver(_identifier, julia::IdentifierContext::RValue);\n\t\tif (stackSize == size_t(-1))\n\t\t{\n\t\t\t\/\/ Only add an error message if the callback did not do it.\n\t\t\tif (numErrorsBefore == m_errorReporter.errors().size())\n\t\t\t\tm_errorReporter.declarationError(_identifier.location, \"Identifier not found.\");\n\t\t\tsuccess = false;\n\t\t}\n\t\tm_stackHeight += stackSize == size_t(-1) ? 1 : stackSize;\n\t}\n\tm_info.stackHeightInfo[&_identifier] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(FunctionalInstruction const& _instr)\n{\n\tsolAssert(!m_julia, \"\");\n\tbool success = true;\n\tfor (auto const& arg: _instr.arguments | boost::adaptors::reversed)\n\t\tif (!expectExpression(arg))\n\t\t\tsuccess = false;\n\t\/\/ Parser already checks that the number of arguments is correct.\n\tsolAssert(instructionInfo(_instr.instruction.instruction).args == int(_instr.arguments.size()), \"\");\n\tif (!(*this)(_instr.instruction))\n\t\tsuccess = false;\n\tm_info.stackHeightInfo[&_instr] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::StackAssignment const& _assignment)\n{\n\tsolAssert(!m_julia, \"\");\n\tbool success = checkAssignment(_assignment.variableName, size_t(-1));\n\tm_info.stackHeightInfo[&_assignment] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::Assignment const& _assignment)\n{\n\tint const stackHeight = m_stackHeight;\n\tbool success = boost::apply_visitor(*this, *_assignment.value);\n\tsolAssert(m_stackHeight >= stackHeight, \"Negative value size.\");\n\tif (!checkAssignment(_assignment.variableName, m_stackHeight - stackHeight))\n\t\tsuccess = false;\n\tm_info.stackHeightInfo[&_assignment] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::VariableDeclaration const& _varDecl)\n{\n\tint const expectedItems = _varDecl.variables.size();\n\tint const stackHeight = m_stackHeight;\n\tbool success = boost::apply_visitor(*this, *_varDecl.value);\n\tif ((m_stackHeight - stackHeight) != expectedItems)\n\t{\n\t\tm_errorReporter.declarationError(_varDecl.location, \"Variable count mismatch.\");\n\t\treturn false;\n\t}\n\n\tfor (auto const& variable: _varDecl.variables)\n\t{\n\t\texpectValidType(variable.type, variable.location);\n\t\tboost::get<Scope::Variable>(m_currentScope->identifiers.at(variable.name)).active = true;\n\t}\n\tm_info.stackHeightInfo[&_varDecl] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::FunctionDefinition const& _funDef)\n{\n\tBlock const* virtualBlock = m_info.virtualBlocks.at(&_funDef).get();\n\tsolAssert(virtualBlock, \"\");\n\tScope& varScope = scope(virtualBlock);\n\tfor (auto const& var: _funDef.arguments + _funDef.returns)\n\t{\n\t\texpectValidType(var.type, var.location);\n\t\tboost::get<Scope::Variable>(varScope.identifiers.at(var.name)).active = true;\n\t}\n\n\tint const stackHeight = m_stackHeight;\n\tm_stackHeight = _funDef.arguments.size() + _funDef.returns.size();\n\n\tbool success = (*this)(_funDef.body);\n\n\tm_stackHeight = stackHeight;\n\tm_info.stackHeightInfo[&_funDef] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::FunctionCall const& _funCall)\n{\n\tbool success = true;\n\tsize_t arguments = 0;\n\tsize_t returns = 0;\n\tif (!m_currentScope->lookup(_funCall.functionName.name, Scope::Visitor(\n\t\t[&](Scope::Variable const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Attempt to call variable instead of function.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t},\n\t\t[&](Scope::Label const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Attempt to call label instead of function.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t},\n\t\t[&](Scope::Function const& _fun)\n\t\t{\n\t\t\t\/\/\/ TODO: compare types too\n\t\t\targuments = _fun.arguments.size();\n\t\t\treturns = _fun.returns.size();\n\t\t}\n\t)))\n\t{\n\t\tm_errorReporter.declarationError(_funCall.functionName.location, \"Function not found.\");\n\t\tsuccess = false;\n\t}\n\tif (success)\n\t{\n\t\tif (_funCall.arguments.size() != arguments)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Expected \" + boost::lexical_cast<string>(arguments) + \" arguments but got \" +\n\t\t\t\tboost::lexical_cast<string>(_funCall.arguments.size()) + \".\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t}\n\tfor (auto const& arg: _funCall.arguments | boost::adaptors::reversed)\n\t\tif (!expectExpression(arg))\n\t\t\tsuccess = false;\n\tm_stackHeight += int(returns) - int(arguments);\n\tm_info.stackHeightInfo[&_funCall] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(Switch const& _switch)\n{\n\tbool success = true;\n\n\tif (!expectExpression(*_switch.expression))\n\t\tsuccess = false;\n\n\tset<tuple<LiteralKind, string>> cases;\n\tfor (auto const& _case: _switch.cases)\n\t{\n\t\tif (_case.value)\n\t\t{\n\t\t\tif (!expectExpression(*_case.value))\n\t\t\t\tsuccess = false;\n\t\t\tm_stackHeight--;\n\n\t\t\t\/\/\/ Note: the parser ensures there is only one default case\n\t\t\tauto val = make_tuple(_case.value->kind, _case.value->value);\n\t\t\tif (!cases.insert(val).second)\n\t\t\t{\n\t\t\t\tm_errorReporter.declarationError(\n\t\t\t\t\t_case.location,\n\t\t\t\t\t\"Duplicate case defined\"\n\t\t\t\t);\n\t\t\t\tsuccess = false;\n\t\t\t}\n\t\t}\n\n\t\tif (!(*this)(_case.body))\n\t\t\tsuccess = false;\n\t}\n\n\tm_stackHeight--;\n\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(Block const& _block)\n{\n\tbool success = true;\n\tauto previousScope = m_currentScope;\n\tm_currentScope = &scope(&_block);\n\n\tint const initialStackHeight = m_stackHeight;\n\n\tfor (auto const& s: _block.statements)\n\t\tif (!boost::apply_visitor(*this, s))\n\t\t\tsuccess = false;\n\n\tfor (auto const& identifier: scope(&_block).identifiers)\n\t\tif (identifier.second.type() == typeid(Scope::Variable))\n\t\t\t--m_stackHeight;\n\n\tint const stackDiff = m_stackHeight - initialStackHeight;\n\tif (stackDiff != 0)\n\t{\n\t\tm_errorReporter.declarationError(\n\t\t\t_block.location,\n\t\t\t\"Unbalanced stack at the end of a block: \" +\n\t\t\t(\n\t\t\t\tstackDiff > 0 ?\n\t\t\t\tto_string(stackDiff) + string(\" surplus item(s).\") :\n\t\t\t\tto_string(-stackDiff) + string(\" missing item(s).\")\n\t\t\t)\n\t\t);\n\t\tsuccess = false;\n\t}\n\n\tm_info.stackHeightInfo[&_block] = m_stackHeight;\n\tm_currentScope = previousScope;\n\treturn success;\n}\n\nbool AsmAnalyzer::expectExpression(Statement const& _statement)\n{\n\tbool success = true;\n\tint const initialHeight = m_stackHeight;\n\tif (!boost::apply_visitor(*this, _statement))\n\t\tsuccess = false;\n\tif (m_stackHeight - initialHeight != 1)\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\tlocationOf(_statement),\n\t\t\t\"Expected instruction(s) to deposit one item to the stack but did deposit \" +\n\t\t\tboost::lexical_cast<string>(m_stackHeight - initialHeight) +\n\t\t\t\" items.\"\n\t\t);\n\t\tsuccess = false;\n\t}\n\treturn success;\n}\n\nbool AsmAnalyzer::checkAssignment(assembly::Identifier const& _variable, size_t _valueSize)\n{\n\tbool success = true;\n\tsize_t numErrorsBefore = m_errorReporter.errors().size();\n\tsize_t variableSize(-1);\n\tif (Scope::Identifier const* var = m_currentScope->lookup(_variable.name))\n\t{\n\t\t\/\/ Check that it is a variable\n\t\tif (var->type() != typeid(Scope::Variable))\n\t\t{\n\t\t\tm_errorReporter.typeError(_variable.location, \"Assignment requires variable.\");\n\t\t\tsuccess = false;\n\t\t}\n\t\telse if (!boost::get<Scope::Variable>(*var).active)\n\t\t{\n\t\t\tm_errorReporter.declarationError(\n\t\t\t\t_variable.location,\n\t\t\t\t\"Variable \" + _variable.name + \" used before it was declared.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t\tvariableSize = 1;\n\t}\n\telse if (m_resolver)\n\t\tvariableSize = m_resolver(_variable, julia::IdentifierContext::LValue);\n\tif (variableSize == size_t(-1))\n\t{\n\t\t\/\/ Only add message if the callback did not.\n\t\tif (numErrorsBefore == m_errorReporter.errors().size())\n\t\t\tm_errorReporter.declarationError(_variable.location, \"Variable not found or variable not lvalue.\");\n\t\tsuccess = false;\n\t}\n\tif (_valueSize == size_t(-1))\n\t\t_valueSize = variableSize == size_t(-1) ? 1 : variableSize;\n\n\tm_stackHeight -= _valueSize;\n\n\tif (_valueSize != variableSize && variableSize != size_t(-1))\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\t_variable.location,\n\t\t\t\"Variable size (\" +\n\t\t\tto_string(variableSize) +\n\t\t\t\") and value size (\" +\n\t\t\tto_string(_valueSize) +\n\t\t\t\") do not match.\"\n\t\t);\n\t\tsuccess = false;\n\t}\n\treturn success;\n}\n\nScope& AsmAnalyzer::scope(Block const* _block)\n{\n\tsolAssert(m_info.scopes.count(_block) == 1, \"Scope requested but not present.\");\n\tauto scopePtr = m_info.scopes.at(_block);\n\tsolAssert(scopePtr, \"Scope requested but not present.\");\n\treturn *scopePtr;\n}\n\nvoid AsmAnalyzer::expectValidType(string const& type, SourceLocation const& _location)\n{\n\tif (!m_julia)\n\t\treturn;\n\n\tif (!builtinTypes.count(type))\n\t\tm_errorReporter.typeError(\n\t\t\t_location,\n\t\t\t\"\\\"\" + type + \"\\\" is not a valid type (user defined types are not yet supported).\"\n\t\t);\n}\n<commit_msg>Improved error message.<commit_after>\/*\n\tThis file is part of solidity.\n\n\tsolidity is free software: you can redistribute it and\/or modify\n\tit under the terms of the GNU General Public License as published by\n\tthe Free Software Foundation, either version 3 of the License, or\n\t(at your option) any later version.\n\n\tsolidity is distributed in the hope that it will be useful,\n\tbut WITHOUT ANY WARRANTY; without even the implied warranty of\n\tMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\tGNU General Public License for more details.\n\n\tYou should have received a copy of the GNU General Public License\n\talong with solidity. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\/**\n * Analyzer part of inline assembly.\n *\/\n\n#include <libsolidity\/inlineasm\/AsmAnalysis.h>\n\n#include <libsolidity\/inlineasm\/AsmData.h>\n#include <libsolidity\/inlineasm\/AsmScopeFiller.h>\n#include <libsolidity\/inlineasm\/AsmScope.h>\n#include <libsolidity\/inlineasm\/AsmAnalysisInfo.h>\n\n#include <libsolidity\/interface\/Exceptions.h>\n#include <libsolidity\/interface\/Utils.h>\n\n#include <boost\/range\/adaptor\/reversed.hpp>\n\n#include <memory>\n#include <functional>\n\nusing namespace std;\nusing namespace dev;\nusing namespace dev::solidity;\nusing namespace dev::solidity::assembly;\n\nnamespace {\n\nset<string> const builtinTypes{\"bool\", \"u8\", \"s8\", \"u32\", \"s32\", \"u64\", \"s64\", \"u128\", \"s128\", \"u256\", \"s256\"};\n\n}\n\nbool AsmAnalyzer::analyze(Block const& _block)\n{\n\tif (!(ScopeFiller(m_info, m_errorReporter))(_block))\n\t\treturn false;\n\n\treturn (*this)(_block);\n}\n\nbool AsmAnalyzer::operator()(Label const& _label)\n{\n\tsolAssert(!m_julia, \"\");\n\tm_info.stackHeightInfo[&_label] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Instruction const& _instruction)\n{\n\tsolAssert(!m_julia, \"\");\n\tauto const& info = instructionInfo(_instruction.instruction);\n\tm_stackHeight += info.ret - info.args;\n\tm_info.stackHeightInfo[&_instruction] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Literal const& _literal)\n{\n\texpectValidType(_literal.type, _literal.location);\n\t++m_stackHeight;\n\tif (_literal.kind == assembly::LiteralKind::String && _literal.value.size() > 32)\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\t_literal.location,\n\t\t\t\"String literal too long (\" + boost::lexical_cast<std::string>(_literal.value.size()) + \" > 32)\"\n\t\t);\n\t\treturn false;\n\t}\n\tm_info.stackHeightInfo[&_literal] = m_stackHeight;\n\treturn true;\n}\n\nbool AsmAnalyzer::operator()(assembly::Identifier const& _identifier)\n{\n\tsize_t numErrorsBefore = m_errorReporter.errors().size();\n\tbool success = true;\n\tif (m_currentScope->lookup(_identifier.name, Scope::Visitor(\n\t\t[&](Scope::Variable const& _var)\n\t\t{\n\t\t\tif (!_var.active)\n\t\t\t{\n\t\t\t\tm_errorReporter.declarationError(\n\t\t\t\t\t_identifier.location,\n\t\t\t\t\t\"Variable \" + _identifier.name + \" used before it was declared.\"\n\t\t\t\t);\n\t\t\t\tsuccess = false;\n\t\t\t}\n\t\t\t++m_stackHeight;\n\t\t},\n\t\t[&](Scope::Label const&)\n\t\t{\n\t\t\t++m_stackHeight;\n\t\t},\n\t\t[&](Scope::Function const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_identifier.location,\n\t\t\t\t\"Function \" + _identifier.name + \" used without being called.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t)))\n\t{\n\t}\n\telse\n\t{\n\t\tsize_t stackSize(-1);\n\t\tif (m_resolver)\n\t\t\tstackSize = m_resolver(_identifier, julia::IdentifierContext::RValue);\n\t\tif (stackSize == size_t(-1))\n\t\t{\n\t\t\t\/\/ Only add an error message if the callback did not do it.\n\t\t\tif (numErrorsBefore == m_errorReporter.errors().size())\n\t\t\t\tm_errorReporter.declarationError(_identifier.location, \"Identifier not found.\");\n\t\t\tsuccess = false;\n\t\t}\n\t\tm_stackHeight += stackSize == size_t(-1) ? 1 : stackSize;\n\t}\n\tm_info.stackHeightInfo[&_identifier] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(FunctionalInstruction const& _instr)\n{\n\tsolAssert(!m_julia, \"\");\n\tbool success = true;\n\tfor (auto const& arg: _instr.arguments | boost::adaptors::reversed)\n\t\tif (!expectExpression(arg))\n\t\t\tsuccess = false;\n\t\/\/ Parser already checks that the number of arguments is correct.\n\tsolAssert(instructionInfo(_instr.instruction.instruction).args == int(_instr.arguments.size()), \"\");\n\tif (!(*this)(_instr.instruction))\n\t\tsuccess = false;\n\tm_info.stackHeightInfo[&_instr] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::StackAssignment const& _assignment)\n{\n\tsolAssert(!m_julia, \"\");\n\tbool success = checkAssignment(_assignment.variableName, size_t(-1));\n\tm_info.stackHeightInfo[&_assignment] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::Assignment const& _assignment)\n{\n\tint const stackHeight = m_stackHeight;\n\tbool success = boost::apply_visitor(*this, *_assignment.value);\n\tsolAssert(m_stackHeight >= stackHeight, \"Negative value size.\");\n\tif (!checkAssignment(_assignment.variableName, m_stackHeight - stackHeight))\n\t\tsuccess = false;\n\tm_info.stackHeightInfo[&_assignment] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::VariableDeclaration const& _varDecl)\n{\n\tint const expectedItems = _varDecl.variables.size();\n\tint const stackHeight = m_stackHeight;\n\tbool success = boost::apply_visitor(*this, *_varDecl.value);\n\tif ((m_stackHeight - stackHeight) != expectedItems)\n\t{\n\t\tm_errorReporter.declarationError(_varDecl.location, \"Variable count mismatch.\");\n\t\treturn false;\n\t}\n\n\tfor (auto const& variable: _varDecl.variables)\n\t{\n\t\texpectValidType(variable.type, variable.location);\n\t\tboost::get<Scope::Variable>(m_currentScope->identifiers.at(variable.name)).active = true;\n\t}\n\tm_info.stackHeightInfo[&_varDecl] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::FunctionDefinition const& _funDef)\n{\n\tBlock const* virtualBlock = m_info.virtualBlocks.at(&_funDef).get();\n\tsolAssert(virtualBlock, \"\");\n\tScope& varScope = scope(virtualBlock);\n\tfor (auto const& var: _funDef.arguments + _funDef.returns)\n\t{\n\t\texpectValidType(var.type, var.location);\n\t\tboost::get<Scope::Variable>(varScope.identifiers.at(var.name)).active = true;\n\t}\n\n\tint const stackHeight = m_stackHeight;\n\tm_stackHeight = _funDef.arguments.size() + _funDef.returns.size();\n\n\tbool success = (*this)(_funDef.body);\n\n\tm_stackHeight = stackHeight;\n\tm_info.stackHeightInfo[&_funDef] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(assembly::FunctionCall const& _funCall)\n{\n\tbool success = true;\n\tsize_t arguments = 0;\n\tsize_t returns = 0;\n\tif (!m_currentScope->lookup(_funCall.functionName.name, Scope::Visitor(\n\t\t[&](Scope::Variable const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Attempt to call variable instead of function.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t},\n\t\t[&](Scope::Label const&)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Attempt to call label instead of function.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t},\n\t\t[&](Scope::Function const& _fun)\n\t\t{\n\t\t\t\/\/\/ TODO: compare types too\n\t\t\targuments = _fun.arguments.size();\n\t\t\treturns = _fun.returns.size();\n\t\t}\n\t)))\n\t{\n\t\tm_errorReporter.declarationError(_funCall.functionName.location, \"Function not found.\");\n\t\tsuccess = false;\n\t}\n\tif (success)\n\t{\n\t\tif (_funCall.arguments.size() != arguments)\n\t\t{\n\t\t\tm_errorReporter.typeError(\n\t\t\t\t_funCall.functionName.location,\n\t\t\t\t\"Expected \" + boost::lexical_cast<string>(arguments) + \" arguments but got \" +\n\t\t\t\tboost::lexical_cast<string>(_funCall.arguments.size()) + \".\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t}\n\tfor (auto const& arg: _funCall.arguments | boost::adaptors::reversed)\n\t\tif (!expectExpression(arg))\n\t\t\tsuccess = false;\n\tm_stackHeight += int(returns) - int(arguments);\n\tm_info.stackHeightInfo[&_funCall] = m_stackHeight;\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(Switch const& _switch)\n{\n\tbool success = true;\n\n\tif (!expectExpression(*_switch.expression))\n\t\tsuccess = false;\n\n\tset<tuple<LiteralKind, string>> cases;\n\tfor (auto const& _case: _switch.cases)\n\t{\n\t\tif (_case.value)\n\t\t{\n\t\t\tif (!expectExpression(*_case.value))\n\t\t\t\tsuccess = false;\n\t\t\tm_stackHeight--;\n\n\t\t\t\/\/\/ Note: the parser ensures there is only one default case\n\t\t\tauto val = make_tuple(_case.value->kind, _case.value->value);\n\t\t\tif (!cases.insert(val).second)\n\t\t\t{\n\t\t\t\tm_errorReporter.declarationError(\n\t\t\t\t\t_case.location,\n\t\t\t\t\t\"Duplicate case defined\"\n\t\t\t\t);\n\t\t\t\tsuccess = false;\n\t\t\t}\n\t\t}\n\n\t\tif (!(*this)(_case.body))\n\t\t\tsuccess = false;\n\t}\n\n\tm_stackHeight--;\n\n\treturn success;\n}\n\nbool AsmAnalyzer::operator()(Block const& _block)\n{\n\tbool success = true;\n\tauto previousScope = m_currentScope;\n\tm_currentScope = &scope(&_block);\n\n\tint const initialStackHeight = m_stackHeight;\n\n\tfor (auto const& s: _block.statements)\n\t\tif (!boost::apply_visitor(*this, s))\n\t\t\tsuccess = false;\n\n\tfor (auto const& identifier: scope(&_block).identifiers)\n\t\tif (identifier.second.type() == typeid(Scope::Variable))\n\t\t\t--m_stackHeight;\n\n\tint const stackDiff = m_stackHeight - initialStackHeight;\n\tif (stackDiff != 0)\n\t{\n\t\tm_errorReporter.declarationError(\n\t\t\t_block.location,\n\t\t\t\"Unbalanced stack at the end of a block: \" +\n\t\t\t(\n\t\t\t\tstackDiff > 0 ?\n\t\t\t\tto_string(stackDiff) + string(\" surplus item(s).\") :\n\t\t\t\tto_string(-stackDiff) + string(\" missing item(s).\")\n\t\t\t)\n\t\t);\n\t\tsuccess = false;\n\t}\n\n\tm_info.stackHeightInfo[&_block] = m_stackHeight;\n\tm_currentScope = previousScope;\n\treturn success;\n}\n\nbool AsmAnalyzer::expectExpression(Statement const& _statement)\n{\n\tbool success = true;\n\tint const initialHeight = m_stackHeight;\n\tif (!boost::apply_visitor(*this, _statement))\n\t\tsuccess = false;\n\tif (m_stackHeight - initialHeight != 1)\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\tlocationOf(_statement),\n\t\t\t\"Expected expression to return one item to the stack but did return \" +\n\t\t\tboost::lexical_cast<string>(m_stackHeight - initialHeight) +\n\t\t\t\" items.\"\n\t\t);\n\t\tsuccess = false;\n\t}\n\treturn success;\n}\n\nbool AsmAnalyzer::checkAssignment(assembly::Identifier const& _variable, size_t _valueSize)\n{\n\tbool success = true;\n\tsize_t numErrorsBefore = m_errorReporter.errors().size();\n\tsize_t variableSize(-1);\n\tif (Scope::Identifier const* var = m_currentScope->lookup(_variable.name))\n\t{\n\t\t\/\/ Check that it is a variable\n\t\tif (var->type() != typeid(Scope::Variable))\n\t\t{\n\t\t\tm_errorReporter.typeError(_variable.location, \"Assignment requires variable.\");\n\t\t\tsuccess = false;\n\t\t}\n\t\telse if (!boost::get<Scope::Variable>(*var).active)\n\t\t{\n\t\t\tm_errorReporter.declarationError(\n\t\t\t\t_variable.location,\n\t\t\t\t\"Variable \" + _variable.name + \" used before it was declared.\"\n\t\t\t);\n\t\t\tsuccess = false;\n\t\t}\n\t\tvariableSize = 1;\n\t}\n\telse if (m_resolver)\n\t\tvariableSize = m_resolver(_variable, julia::IdentifierContext::LValue);\n\tif (variableSize == size_t(-1))\n\t{\n\t\t\/\/ Only add message if the callback did not.\n\t\tif (numErrorsBefore == m_errorReporter.errors().size())\n\t\t\tm_errorReporter.declarationError(_variable.location, \"Variable not found or variable not lvalue.\");\n\t\tsuccess = false;\n\t}\n\tif (_valueSize == size_t(-1))\n\t\t_valueSize = variableSize == size_t(-1) ? 1 : variableSize;\n\n\tm_stackHeight -= _valueSize;\n\n\tif (_valueSize != variableSize && variableSize != size_t(-1))\n\t{\n\t\tm_errorReporter.typeError(\n\t\t\t_variable.location,\n\t\t\t\"Variable size (\" +\n\t\t\tto_string(variableSize) +\n\t\t\t\") and value size (\" +\n\t\t\tto_string(_valueSize) +\n\t\t\t\") do not match.\"\n\t\t);\n\t\tsuccess = false;\n\t}\n\treturn success;\n}\n\nScope& AsmAnalyzer::scope(Block const* _block)\n{\n\tsolAssert(m_info.scopes.count(_block) == 1, \"Scope requested but not present.\");\n\tauto scopePtr = m_info.scopes.at(_block);\n\tsolAssert(scopePtr, \"Scope requested but not present.\");\n\treturn *scopePtr;\n}\n\nvoid AsmAnalyzer::expectValidType(string const& type, SourceLocation const& _location)\n{\n\tif (!m_julia)\n\t\treturn;\n\n\tif (!builtinTypes.count(type))\n\t\tm_errorReporter.typeError(\n\t\t\t_location,\n\t\t\t\"\\\"\" + type + \"\\\" is not a valid type (user defined types are not yet supported).\"\n\t\t);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"config.h\"\n\n\/\/ system\n#include <iostream>\n\n\/\/ boost\n#include <boost\/filesystem.hpp>\n\n\/\/ dune-common\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/mpihelper.hh>\n#include <dune\/common\/timer.hh>\n\n\/\/ dune-stuff\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/filesystem.hh>\n#include <dune\/stuff\/common\/string.hh>\n\n\/\/ dune-grid-multiscale\n#include <dune\/grid\/multiscale\/provider\/cube.hh>\n\n\/**\n \\brief Creates a parameter file if it does not exist.\n\n Nothing is done if the file already exists. If not, a parameter file will be created with all neccessary\n keys and values.\n \\param[in] filename\n (Relative) path to the file.\n **\/\nvoid ensureParamFile(std::string filename)\n{\n Dune::Stuff::Common::Filesystem::testCreateDirectory(filename);\n if (!boost::filesystem::exists(filename)) {\n std::ofstream file;\n file.open(filename);\n file << \"[grid.multiscale.provider.cube]\" << std::endl;\n file << \"numElements.0 = 6\" << std::endl;\n file << \"numElements.1 = 6\" << std::endl;\n file << \"numElements.2 = 6\" << std::endl;\n file << \"boundaryId = 7\" << std::endl; \/\/ a cube from the factory gets the boundary ids 1 to 4 ind 2d and 1 to 6 ? in 3d\n file << \"filename = msGrid_visualization\" << std::endl;\n file << \"partitions.0 = 2\" << std::endl;\n file << \"partitions.1 = 2\" << std::endl;\n file << \"partitions.2 = 2\" << std::endl;\n file.close();\n } \/\/ only write param file if there is none\n} \/\/ void ensureParamFile()\n\ntemplate< class GridPartType >\nvoid measureTiming(const GridPartType& gridPart, Dune::Stuff::Common::LogStream& out, const std::string name = \"\")\n{\n out << \" walking \" << name << \" grid part... \" << std::flush;\n Dune::Timer timer;\n unsigned int elements = 0;\n for (typename GridPartType::template Codim< 0 >::IteratorType it = gridPart.template begin< 0 >();\n it != gridPart.template end< 0 >();\n ++it)\n ++elements;\n out << \" done (has \" << elements << \" elements, took \" << timer.elapsed() << \" sek)\" << std::endl;\n return;\n}\n\nint main(int argc, char** argv)\n{\n try {\n \/\/ mpi\n Dune::MPIHelper::instance(argc, argv);\n\n \/\/ parameter\n const std::string id = \"cube\";\n const std::string filename = id + \".param\";\n ensureParamFile(filename);\n Dune::ParameterTree paramTree = Dune::Stuff::Common::Parameter::Tree::init(argc, argv, filename);\n\n \/\/ logger\n Dune::Stuff::Common::Logger().create(Dune::Stuff::Common::LOG_INFO |\n Dune::Stuff::Common::LOG_CONSOLE |\n Dune::Stuff::Common::LOG_DEBUG);\n Dune::Stuff::Common::LogStream& info = Dune::Stuff::Common::Logger().info();\n Dune::Stuff::Common::LogStream& debug = Dune::Stuff::Common::Logger().debug();\n\n \/\/ timer\n Dune::Timer timer;\n\n \/\/ grid\n info << \"setting up grid: \" << std::endl;\n debug.suspend();\n typedef Dune::grid::Multiscale::Provider::Cube< Dune::GridSelector::GridType > GridProviderType;\n Dune::Stuff::Common::Parameter::Tree::assertSub(paramTree, GridProviderType::id, id);\n GridProviderType gridProvider(paramTree.sub(GridProviderType::id));\n typedef GridProviderType::MsGridType MsGridType;\n const MsGridType& msGrid = gridProvider.msGrid();\n debug.resume();\n info << \" took \" << timer.elapsed()\n << \" sec (has \" << msGrid.globalGridPart()->grid().size(0) << \" elements, \"\n << msGrid.size() << \" subdomains)\" << std::endl;\n\n info << \"visualizing... \" << std::flush;\n debug.suspend();\n timer.reset();\n msGrid.visualize();\n debug.resume();\n info << \" done (took \" << timer.elapsed() << \" sek)\" << std::endl;\n\n \/\/ time grid parts\n info << \"timing grid parts:\" << std::endl;\n typedef MsGridType::GlobalGridPartType GlobalGridPartType;\n const Dune::shared_ptr< const GlobalGridPartType > globalGridPart = msGrid.globalGridPart();\n measureTiming(*globalGridPart, info, \"global\");\n typedef MsGridType::LocalGridPartType LocalGridPartType;\n const Dune::shared_ptr< const LocalGridPartType > firstLocalGridPart = msGrid.localGridPart(0);\n measureTiming(*firstLocalGridPart, info, \"local (subdomain 0)\");\n for (unsigned int subdomain = 1; subdomain < msGrid.size(); ++subdomain) {\n const Dune::shared_ptr< const LocalGridPartType > localGridPart = msGrid.localGridPart(subdomain);\n measureTiming(*localGridPart, debug, \"local (subdomain \" + Dune::Stuff::Common::String::convertTo(subdomain) + \")\");\n }\n\n \/\/ if we came that far we can as well be happy about it\n return 0;\n } catch(Dune::Exception& e) {\n std::cerr << \"Dune reported error: \" << e.what() << std::endl;\n } catch(std::exception& e) {\n std::cerr << e.what() << std::endl;\n } catch(...) {\n std::cerr << \"Unknown exception thrown!\" << std::endl;\n } \/\/ try\n} \/\/ main\n<commit_msg>[examples.provider.cube] added coupling example<commit_after>\n#include \"config.h\"\n\n\/\/ system\n#include <iostream>\n\n\/\/ boost\n#include <boost\/filesystem.hpp>\n\n\/\/ dune-common\n#include <dune\/common\/exceptions.hh>\n#include <dune\/common\/mpihelper.hh>\n#include <dune\/common\/timer.hh>\n\n\/\/ dune-stuff\n#include <dune\/stuff\/common\/parameter\/tree.hh>\n#include <dune\/stuff\/common\/logging.hh>\n#include <dune\/stuff\/common\/filesystem.hh>\n#include <dune\/stuff\/common\/string.hh>\n\n\/\/ dune-grid-multiscale\n#include <dune\/grid\/multiscale\/provider\/cube.hh>\n\n\/**\n \\brief Creates a parameter file if it does not exist.\n\n Nothing is done if the file already exists. If not, a parameter file will be created with all neccessary\n keys and values.\n \\param[in] filename\n (Relative) path to the file.\n **\/\nvoid ensureParamFile(std::string filename)\n{\n Dune::Stuff::Common::Filesystem::testCreateDirectory(filename);\n if (!boost::filesystem::exists(filename)) {\n std::ofstream file;\n file.open(filename);\n file << \"[grid.multiscale.provider.cube]\" << std::endl;\n file << \"numElements.0 = 6\" << std::endl;\n file << \"numElements.1 = 6\" << std::endl;\n file << \"numElements.2 = 6\" << std::endl;\n file << \"boundaryId = 7\" << std::endl; \/\/ a cube from the factory gets the boundary ids 1 to 4 ind 2d and 1 to 6 ? in 3d\n file << \"filename = msGrid_visualization\" << std::endl;\n file << \"partitions.0 = 2\" << std::endl;\n file << \"partitions.1 = 2\" << std::endl;\n file << \"partitions.2 = 2\" << std::endl;\n file.close();\n } \/\/ only write param file if there is none\n} \/\/ void ensureParamFile()\n\ntemplate< class GridPartType >\nvoid measureTiming(const GridPartType& gridPart, Dune::Stuff::Common::LogStream& out, const std::string name = \"\")\n{\n out << \" walking \" << name << \" grid part... \" << std::flush;\n Dune::Timer timer;\n unsigned int elements = 0;\n for (typename GridPartType::template Codim< 0 >::IteratorType it = gridPart.template begin< 0 >();\n it != gridPart.template end< 0 >();\n ++it)\n ++elements;\n out << \" done (has \" << elements << \" elements, took \" << timer.elapsed() << \" sek)\" << std::endl;\n} \/\/ void measureTiming()\n\ntemplate< class GlobalGridPartType, class CouplingGridPartType >\nvoid testCoupling(const GlobalGridPartType& globalGridPart, const CouplingGridPartType& couplingGridPart, Dune::Stuff::Common::LogStream& out)\n{\n \/\/ walk the grid part\n for (typename CouplingGridPartType::template Codim< 0 >::IteratorType entityIterator = couplingGridPart.template begin< 0 >();\n entityIterator != couplingGridPart.template end< 0 >();\n ++entityIterator) {\n const typename CouplingGridPartType::template Codim< 0 >::EntityType& entity = *entityIterator;\n const unsigned int entityIndex = globalGridPart.indexSet().index(entity);\n out << \"entity \" << entityIndex << \", neighbors \" << std::flush;\n \/\/ walk the intersections\n for (typename CouplingGridPartType::IntersectionIteratorType intersectionIterator = couplingGridPart.ibegin(entity);\n intersectionIterator != couplingGridPart.iend(entity);\n ++intersectionIterator) {\n const typename CouplingGridPartType::IntersectionIteratorType::Intersection& intersection = *intersectionIterator;\n const typename CouplingGridPartType::IntersectionIteratorType::Intersection::EntityPointer neighborPtr = intersection.outside();\n const typename CouplingGridPartType::template Codim< 0 >::EntityType& neighbor = *neighborPtr;\n const unsigned int neighborIndex = globalGridPart.indexSet().index(neighbor);\n out << neighborIndex << \" \";\n } \/\/ walk the intersections\n out << std::endl;\n } \/\/ walk the grid part\n} \/\/ void testCoupling()\n\nint main(int argc, char** argv)\n{\n try {\n \/\/ mpi\n Dune::MPIHelper::instance(argc, argv);\n\n \/\/ parameter\n const std::string id = \"cube\";\n const std::string filename = id + \".param\";\n ensureParamFile(filename);\n Dune::ParameterTree paramTree = Dune::Stuff::Common::Parameter::Tree::init(argc, argv, filename);\n\n \/\/ logger\n Dune::Stuff::Common::Logger().create(Dune::Stuff::Common::LOG_INFO |\n Dune::Stuff::Common::LOG_CONSOLE |\n Dune::Stuff::Common::LOG_DEBUG);\n Dune::Stuff::Common::LogStream& info = Dune::Stuff::Common::Logger().info();\n Dune::Stuff::Common::LogStream& debug = Dune::Stuff::Common::Logger().debug();\n\n \/\/ timer\n Dune::Timer timer;\n\n \/\/ grid\n info << \"setting up grid: \" << std::endl;\n debug.suspend();\n typedef Dune::grid::Multiscale::Provider::Cube< Dune::GridSelector::GridType > GridProviderType;\n Dune::Stuff::Common::Parameter::Tree::assertSub(paramTree, GridProviderType::id, id);\n GridProviderType gridProvider(paramTree.sub(GridProviderType::id));\n typedef GridProviderType::MsGridType MsGridType;\n const MsGridType& msGrid = gridProvider.msGrid();\n debug.resume();\n info << \" took \" << timer.elapsed()\n << \" sec (has \" << msGrid.globalGridPart()->grid().size(0) << \" elements, \"\n << msGrid.size() << \" subdomains)\" << std::endl;\n\n info << \"visualizing... \" << std::flush;\n debug.suspend();\n timer.reset();\n msGrid.visualize();\n debug.resume();\n info << \" done (took \" << timer.elapsed() << \" sek)\" << std::endl;\n\n \/\/ time grid parts\n info << \"timing grid parts:\" << std::endl;\n typedef MsGridType::GlobalGridPartType GlobalGridPartType;\n const Dune::shared_ptr< const GlobalGridPartType > globalGridPart = msGrid.globalGridPart();\n measureTiming(*globalGridPart, info, \"global\");\n typedef MsGridType::CouplingGridPartType CouplingGridPartType;\n const unsigned int neighbor = *(msGrid.neighborsOf(0)->begin());\n const Dune::shared_ptr< const CouplingGridPartType > couplingGridPart = msGrid.couplingGridPart(0, neighbor);\n measureTiming(*couplingGridPart, info, \"coupling (subdomain 0 with \" + Dune::Stuff::Common::String::convertTo(neighbor) + \")\");\n typedef MsGridType::LocalGridPartType LocalGridPartType;\n const Dune::shared_ptr< const LocalGridPartType > firstLocalGridPart = msGrid.localGridPart(0);\n measureTiming(*firstLocalGridPart, info, \"local (subdomain 0)\");\n for (unsigned int subdomain = 1; subdomain < msGrid.size(); ++subdomain) {\n const Dune::shared_ptr< const LocalGridPartType > localGridPart = msGrid.localGridPart(subdomain);\n measureTiming(*localGridPart, debug, \"local (subdomain \" + Dune::Stuff::Common::String::convertTo(subdomain) + \")\");\n }\n\n\/\/ \/\/ test coupling grid part\n\/\/ info << \"testing coupling grid part:\" << std::endl;\n\/\/ testCoupling(*globalGridPart, *couplingGridPart, info);\n\n \/\/ if we came that far we can as well be happy about it\n return 0;\n } catch(Dune::Exception& e) {\n std::cerr << \"Dune reported error: \" << e.what() << std::endl;\n } catch(std::exception& e) {\n std::cerr << e.what() << std::endl;\n } catch(...) {\n std::cerr << \"Unknown exception thrown!\" << std::endl;\n } \/\/ try\n} \/\/ main\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fast flag for h264 improves performance of loop filter. Increases performance by about 10% with minimal quality loss.<commit_after><|endoftext|>"} {"text":"<commit_before>#ifndef __Data_majorRequirement__\n#define __Data_majorRequirement__\n\n#include \"data-general.hpp\"\nusing namespace std;\n\nclass MajorRequirement {\nprivate:\n int needed;\n int has;\n bool satisfied;\n vector<Course> validCourses;\npublic:\n bool fulfillsRequirement(const Course& c) {\n for (vector<Course>::iterator i=validCourses.begin(); i!=validCourses.end(); ++i) {\n if (*i==c)\n\treturn true;\n }\n return false;\n }\n\n void incrementHas() {\n ++has;\n }\n}\n<commit_msg>reindent data-majorRequirement<commit_after>#ifndef __Data_majorRequirement__\n#define __Data_majorRequirement__\n\n#include \"data-general.hpp\"\nusing namespace std;\n\nclass MajorRequirement {\nprivate:\n\tint needed;\n\tint has;\n\tbool satisfied;\n\tvector<Course> validCourses;\npublic:\n\tbool fulfillsRequirement(const Course& c) {\n\t\tfor (vector<Course>::iterator i=validCourses.begin(); i!=validCourses.end(); ++i) {\n\t\t\tif (*i==c)\n\t\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid incrementHas() {\n\t\t++has;\n\t}\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"word.h\"\n#include \"kwic.h\"\n#include \"cute.h\"\n#include \"ide_listener.h\"\n#include \"xml_listener.h\"\n#include \"cute_runner.h\"\n\nvoid testWordShouldBeLessComparesInternalValue() {\n\t\/\/Arrange\n\tconst Word word1(\"abc\");\n\tconst Word word2(\"bcd\");\n\t\/\/Assert\n\tASSERT_LESS(word1, word2);\n}\n\nvoid testWordShouldBeLessComparesCaseInsensitive() {\n\t\/\/Arrange\n\tconst Word word1(\"abc\");\n\tconst Word word2(\"BCD\");\n\t\/\/Assert\n\tASSERT_LESS(word1, word2);\n}\n\nvoid testWordShiftLeftPrintsInternalValue() {\n\t\/\/Arrange\n\tstd::ostringstream out { };\n\tconst Word word(\"hallo\");\n\t\/\/Act\n\tout << word;\n\t\/\/Assert\n\tASSERT_EQUAL(\"hallo\", out.str());\n\n}\n\nvoid testConstructWordThrowsInvalidArgumentExceptionForNumber() {\n\t\/\/Assert\n\tASSERT_THROWS(Word(\"124abd\"), std::invalid_argument);\n}\n\nvoid testConstructWordThrowsInvalidArgumentExceptionForSpecialCharacters() {\n\t\/\/Assert\n\tASSERT_THROWS(Word(\"dsl!*%\"), std::invalid_argument);\n}\n\nvoid testWordConsistsOfOnlyLetters() {\n\t\/\/Arrange\n\tstd::istringstream in { \"abc123%\" };\n\tWord word { };\n\t\/\/Act\n\tin >> word;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"abc\"), word);\n}\n\nvoid testWordIsEmptyIfStreamIsEmpty() {\n\t\/\/Arrange\n\tstd::istringstream in { \" \" };\n\tWord word { };\n\t\/\/Act\n\tin >> word;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"\"), word);\n}\n\nvoid testWordsAreDelimitedByNonAlphanumericCharacters() {\n\t\/\/Arrange\n\tstd::istringstream in { \"compl33tely ~ weird !!??!! 4matted in_put\" };\n\tWord word1 { }, word2 { }, word3 { }, word4 { }, word5 { }, word6 { };\n\t\/\/Act\n\tin >> word1;\n\tin >> word2;\n\tin >> word3;\n\tin >> word4;\n\tin >> word5;\n\tin >> word6;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"compl\"), word1);\n\tASSERT_EQUAL(Word(\"tely\"), word2);\n\tASSERT_EQUAL(Word(\"weird\"), word3);\n\tASSERT_EQUAL(Word(\"matted\"), word4);\n\tASSERT_EQUAL(Word(\"in\"), word5);\n\tASSERT_EQUAL(Word(\"put\"), word6);\n}\n\nvoid testRotateSingleLineReturnsAllRotationsSorted() {\n\t\/\/Arrange\n\tconst Word mockWord1(\"this\");\n\tconst Word mockWord2(\"is\");\n\tconst Word mockWord3(\"a\");\n\tconst Word mockWord4(\"test\");\n\n\tconst std::vector<Word> words { Word(\"this\"), Word(\"is\"), Word(\"a\"), Word(\"test\") };\n\n\t\/\/Act\n\tconst auto rotatedWords = rotateWords(words);\n\tauto permuted = std::vector<std::vector<Word>> { };\n\n\tfor (auto word : rotatedWords) {\n\t\tpermuted.push_back(word);\n\t}\n\n\t\/\/Assert\n\tconst std::vector<Word> expected1 { mockWord3, mockWord4, mockWord1, mockWord2 };\n\tASSERT_EQUAL(expected1, permuted.at(0));\n\n\n\tconst std::vector<Word> expected2 { mockWord2, mockWord3, mockWord4, mockWord1 };\n\tASSERT_EQUAL(expected2, permuted.at(1));\n\n\n\tconst std::vector<Word> expected3 { mockWord4, mockWord1, mockWord2, mockWord3 };\n\tASSERT_EQUAL(expected3, permuted.at(2));\n\n\n\tconst std::vector<Word> expected4 { mockWord1, mockWord2, mockWord3, mockWord4 };\n\tASSERT_EQUAL(expected4, permuted.at(3));\n}\n\nvoid testRotateMultipleLinesReturnsAllRotationsSorted() {\n\t\/\/Arrange\n\tstd::istringstream in { \"this is a test\\n\"\n\t\t\t\t\t\t\t\"this is another test\" };\n\tstd::ostringstream out { };\n\t\/\/Act\n\trotateLines(in, out);\n\t\/\/Assert\n\tASSERT_EQUAL(\"a test this is \\n\"\n \"another test this is \\n\"\n \"is a test this \\n\"\n \"is another test this \\n\"\n \"test this is a \\n\"\n \"test this is another \\n\"\n \"this is a test \\n\"\n \"this is another test \\n\", out.str());\n}\n\nvoid testWordRightShiftPutsWordsIntoSentenceUntilEndOfLine() {\n\t\/\/Arrange\n\tstd::istringstream in { \"this is a test\" };\n\tstd::vector<Word> sentence { };\n\t\/\/Act\n\tin >> sentence;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"this\"), sentence.at(0));\n\tASSERT_EQUAL(Word(\"is\"), sentence.at(1));\n\tASSERT_EQUAL(Word(\"a\"), sentence.at(2));\n\tASSERT_EQUAL(Word(\"test\"), sentence.at(3));\n}\n\nvoid runAllTests(int argc, char const *argv[]) {\n\tcute::suite s { };\n\n\ts.push_back(CUTE(testWordConsistsOfOnlyLetters));\n\ts.push_back(CUTE(testWordsAreDelimitedByNonAlphanumericCharacters));\n\ts.push_back(CUTE(testWordIsEmptyIfStreamIsEmpty));\n\ts.push_back(CUTE(testConstructWordThrowsInvalidArgumentExceptionForNumber));\n\ts.push_back(CUTE(testConstructWordThrowsInvalidArgumentExceptionForSpecialCharacters));\n\ts.push_back(CUTE(testWordShiftLeftPrintsInternalValue));\n\ts.push_back(CUTE(testWordShouldBeLessComparesInternalValue));\n\ts.push_back(CUTE(testWordShouldBeLessComparesCaseInsensitive));\n\ts.push_back(CUTE(testRotateSingleLineReturnsAllRotationsSorted));\n\ts.push_back(CUTE(testRotateMultipleLinesReturnsAllRotationsSorted));\n\ts.push_back(CUTE(testWordRightShiftPutsWordsIntoSentenceUntilEndOfLine));\n\n\tcute::xml_file_opener xmlfile(argc, argv);\n\tcute::xml_listener<cute::ide_listener<> > lis(xmlfile.out);\n\tcute::makeRunner(lis, argc, argv)(s, \"AllTests\");\n}\n\nint main(int argc, char const *argv[]) {\n\trunAllTests(argc, argv);\n\treturn 0;\n}\n<commit_msg>Improved<commit_after>#include \"word.h\"\n#include \"kwic.h\"\n#include \"cute.h\"\n#include \"ide_listener.h\"\n#include \"xml_listener.h\"\n#include \"cute_runner.h\"\n\nvoid testWordShouldBeLessComparesInternalValue() {\n\t\/\/Arrange\n\tconst Word word1(\"abc\");\n\tconst Word word2(\"bcd\");\n\t\/\/Assert\n\tASSERT_LESS(word1, word2);\n}\n\nvoid testWordShouldBeLessComparesCaseInsensitive() {\n\t\/\/Arrange\n\tconst Word word1(\"abc\");\n\tconst Word word2(\"BCD\");\n\t\/\/Assert\n\tASSERT_LESS(word1, word2);\n}\n\nvoid testWordShiftLeftPrintsInternalValue() {\n\t\/\/Arrange\n\tstd::ostringstream out { };\n\tconst Word word(\"hallo\");\n\t\/\/Act\n\tout << word;\n\t\/\/Assert\n\tASSERT_EQUAL(\"hallo\", out.str());\n\n}\n\nvoid testConstructWordThrowsInvalidArgumentExceptionForNumber() {\n\t\/\/Assert\n\tASSERT_THROWS(Word(\"124abd\"), std::invalid_argument);\n}\n\nvoid testConstructWordThrowsInvalidArgumentExceptionForSpecialCharacters() {\n\t\/\/Assert\n\tASSERT_THROWS(Word(\"dsl!*%\"), std::invalid_argument);\n}\n\nvoid testWordConsistsOfOnlyLetters() {\n\t\/\/Arrange\n\tstd::istringstream in { \"abc123%\" };\n\tWord word { };\n\t\/\/Act\n\tin >> word;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"abc\"), word);\n}\n\nvoid testWordIsEmptyIfStreamIsEmpty() {\n\t\/\/Arrange\n\tstd::istringstream in { \" \" };\n\tWord word { };\n\t\/\/Act\n\tin >> word;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"\"), word);\n}\n\nvoid testWordsAreDelimitedByNonAlphanumericCharacters() {\n\t\/\/Arrange\n\tstd::istringstream in { \"compl33tely ~ weird !!??!! 4matted in_put\" };\n\tWord word1 { }, word2 { }, word3 { }, word4 { }, word5 { }, word6 { };\n\t\/\/Act\n\tin >> word1;\n\tin >> word2;\n\tin >> word3;\n\tin >> word4;\n\tin >> word5;\n\tin >> word6;\n\t\/\/Assert\n\tASSERT_EQUAL(Word(\"compl\"), word1);\n\tASSERT_EQUAL(Word(\"tely\"), word2);\n\tASSERT_EQUAL(Word(\"weird\"), word3);\n\tASSERT_EQUAL(Word(\"matted\"), word4);\n\tASSERT_EQUAL(Word(\"in\"), word5);\n\tASSERT_EQUAL(Word(\"put\"), word6);\n}\n\nvoid testRotateSingleLineReturnsAllRotationsSorted() {\n\t\/\/Arrange\n\tconst Word mockWord1(\"this\");\n\tconst Word mockWord2(\"is\");\n\tconst Word mockWord3(\"a\");\n\tconst Word mockWord4(\"test\");\n\n\tconst std::vector<Word> words { Word(\"this\"), Word(\"is\"), Word(\"a\"), Word(\"test\") };\n\n\t\/\/Act\n\tconst auto rotatedWords = rotateWords(words);\n\tauto permuted = std::vector<std::vector<Word>> { };\n\n\tfor (auto word : rotatedWords) {\n\t\tpermuted.push_back(word);\n\t}\n\n\t\/\/Assert\n\tconst std::vector<Word> expected1 { mockWord3, mockWord4, mockWord1, mockWord2 };\n\tASSERT_EQUAL(expected1, permuted.at(0));\n\n\n\tconst std::vector<Word> expected2 { mockWord2, mockWord3, mockWord4, mockWord1 };\n\tASSERT_EQUAL(expected2, permuted.at(1));\n\n\n\tconst std::vector<Word> expected3 { mockWord4, mockWord1, mockWord2, mockWord3 };\n\tASSERT_EQUAL(expected3, permuted.at(2));\n\n\n\tconst std::vector<Word> expected4 { mockWord1, mockWord2, mockWord3, mockWord4 };\n\tASSERT_EQUAL(expected4, permuted.at(3));\n}\n\nvoid testRotateMultipleLinesReturnsAllRotationsSorted() {\n\t\/\/Arrange\n\tstd::istringstream in { \"this is a test\\n\"\n\t\t\t\t\t\t\t\"this is another test\" };\n\tstd::ostringstream out { };\n\t\/\/Act\n\trotateLines(in, out);\n\t\/\/Assert\n\tASSERT_EQUAL(\"a test this is \\n\"\n \"another test this is \\n\"\n \"is a test this \\n\"\n \"is another test this \\n\"\n \"test this is a \\n\"\n \"test this is another \\n\"\n \"this is a test \\n\"\n \"this is another test \\n\", out.str());\n}\n\nvoid testWordRightShiftPutsWordsIntoSentenceUntilEndOfLine() {\n\t\/\/Arrange\n\tstd::istringstream in { \"this is a test\" };\n\tstd::vector<Word> sentence { };\n\t\/\/Act\n\tin >> sentence;\n\t\/\/Assert\n\tconst std::vector<Word> expected { Word(\"this\"), Word(\"is\"), Word(\"a\"), Word(\"test\") };\n\tASSERT_EQUAL(expected, sentence);\n}\n\nvoid runAllTests(int argc, char const *argv[]) {\n\tcute::suite s { };\n\n\ts.push_back(CUTE(testWordConsistsOfOnlyLetters));\n\ts.push_back(CUTE(testWordsAreDelimitedByNonAlphanumericCharacters));\n\ts.push_back(CUTE(testWordIsEmptyIfStreamIsEmpty));\n\ts.push_back(CUTE(testConstructWordThrowsInvalidArgumentExceptionForNumber));\n\ts.push_back(CUTE(testConstructWordThrowsInvalidArgumentExceptionForSpecialCharacters));\n\ts.push_back(CUTE(testWordShiftLeftPrintsInternalValue));\n\ts.push_back(CUTE(testWordShouldBeLessComparesInternalValue));\n\ts.push_back(CUTE(testWordShouldBeLessComparesCaseInsensitive));\n\ts.push_back(CUTE(testRotateSingleLineReturnsAllRotationsSorted));\n\ts.push_back(CUTE(testRotateMultipleLinesReturnsAllRotationsSorted));\n\ts.push_back(CUTE(testWordRightShiftPutsWordsIntoSentenceUntilEndOfLine));\n\n\tcute::xml_file_opener xmlfile(argc, argv);\n\tcute::xml_listener<cute::ide_listener<> > lis(xmlfile.out);\n\tcute::makeRunner(lis, argc, argv)(s, \"AllTests\");\n}\n\nint main(int argc, char const *argv[]) {\n\trunAllTests(argc, argv);\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"nbostream.h\"\n#include \"hexdump.h\"\n#include <vespa\/vespalib\/util\/exceptions.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <cassert>\n\nnamespace vespalib {\n\nnbostream::nbostream(size_t initialSize) :\n _wbuf(),\n _rbuf(),\n _rp(0),\n _wp(0),\n _state(ok),\n _longLivedBuffer(false)\n{\n extend(initialSize);\n}\n\nnbostream::nbostream(const void * buf, size_t sz, bool longLivedBuffer) :\n _wbuf(),\n _rbuf(buf, sz),\n _rp(0),\n _wp(sz),\n _state(ok),\n _longLivedBuffer(longLivedBuffer)\n{ }\n\nnbostream_longlivedbuf::nbostream_longlivedbuf(const void * buf, size_t sz) :\n nbostream(buf, sz, true)\n{ }\n\nnbostream_longlivedbuf::nbostream_longlivedbuf(size_t initialSize) :\n nbostream(initialSize)\n{ }\n\nnbostream::nbostream(const void * buf, size_t sz) :\n nbostream(buf, sz, false)\n{ }\n\nnbostream::nbostream(Alloc && buf, size_t sz) :\n _wbuf(std::move(buf), sz),\n _rbuf(&_wbuf[0], sz),\n _rp(0),\n _wp(sz),\n _state(ok),\n _longLivedBuffer(false)\n{\n assert(_wbuf.size() >= sz);\n}\n\nnbostream::nbostream(const nbostream & rhs) :\n _wbuf(),\n _rbuf(),\n _rp(0),\n _wp(0),\n _state(ok),\n _longLivedBuffer(false)\n{\n extend(rhs.size());\n _wp = rhs.size();\n memcpy(&_wbuf[0], &rhs._rbuf[rhs._rp], _wp);\n}\n\nnbostream &\nnbostream::operator = (const nbostream & rhs) {\n if (this != &rhs) {\n nbostream n(rhs);\n swap(n);\n }\n return *this;\n}\n\nnbostream::~nbostream() { }\n\nvoid nbostream::fail(State s)\n{\n _state = static_cast<State>(_state | s);\n throw IllegalStateException(make_string(\"Stream failed bufsize(%zu), readp(%zu), writep(%zu)\", _wbuf.size(), _rp, _wp), VESPA_STRLOC);\n}\n\nstd::ostream & operator << (std::ostream & os, const nbostream & s) {\n return os << HexDump(&s._rbuf[s._rp], s.left());\n}\n\nvoid nbostream::reserve(size_t sz)\n{\n if (capacity() < sz) {\n extend(sz - capacity());\n }\n}\n\nvoid nbostream::compact()\n{\n memmove(&_wbuf[0], &_rbuf[_rp], left());\n _wp = left();\n _rp = 0;\n}\n\n\nvoid nbostream::extend(size_t extraSize)\n{\n if (&_wbuf[0] != _rbuf.c_str()) {\n _wbuf.resize(roundUp2inN(_rbuf.size() + extraSize));\n compact();\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n }\n if (_rp != 0) {\n compact();\n }\n if (space() < extraSize) {\n _wbuf.resize(roundUp2inN(_wbuf.size() + extraSize));\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n }\n}\n\nvoid nbostream::swap(Buffer & buf) {\n if (_rp != 0) {\n compact();\n }\n _wbuf.resize(size());\n _wbuf.swap(buf);\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n _wp = _wbuf.size();\n _rp = 0;\n _state = ok;\n}\n\nvoid nbostream::swap(nbostream & os)\n{\n std::swap(_rp, os._rp);\n std::swap(_wp, os._wp);\n std::swap(_state, os._state);\n _wbuf.swap(os._wbuf);\n std::swap(_rbuf, os._rbuf);\n}\n\n}\n<commit_msg>= default<commit_after>\/\/ Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"nbostream.h\"\n#include \"hexdump.h\"\n#include <vespa\/vespalib\/util\/exceptions.h>\n#include <vespa\/vespalib\/util\/stringfmt.h>\n#include <cassert>\n\nnamespace vespalib {\n\nnbostream::nbostream(size_t initialSize) :\n _wbuf(),\n _rbuf(),\n _rp(0),\n _wp(0),\n _state(ok),\n _longLivedBuffer(false)\n{\n extend(initialSize);\n}\n\nnbostream::nbostream(const void * buf, size_t sz, bool longLivedBuffer) :\n _wbuf(),\n _rbuf(buf, sz),\n _rp(0),\n _wp(sz),\n _state(ok),\n _longLivedBuffer(longLivedBuffer)\n{ }\n\nnbostream_longlivedbuf::nbostream_longlivedbuf(const void * buf, size_t sz) :\n nbostream(buf, sz, true)\n{ }\n\nnbostream_longlivedbuf::nbostream_longlivedbuf(size_t initialSize) :\n nbostream(initialSize)\n{ }\n\nnbostream::nbostream(const void * buf, size_t sz) :\n nbostream(buf, sz, false)\n{ }\n\nnbostream::nbostream(Alloc && buf, size_t sz) :\n _wbuf(std::move(buf), sz),\n _rbuf(&_wbuf[0], sz),\n _rp(0),\n _wp(sz),\n _state(ok),\n _longLivedBuffer(false)\n{\n assert(_wbuf.size() >= sz);\n}\n\nnbostream::nbostream(const nbostream & rhs) :\n _wbuf(),\n _rbuf(),\n _rp(0),\n _wp(0),\n _state(ok),\n _longLivedBuffer(false)\n{\n extend(rhs.size());\n _wp = rhs.size();\n memcpy(&_wbuf[0], &rhs._rbuf[rhs._rp], _wp);\n}\n\nnbostream &\nnbostream::operator = (const nbostream & rhs) {\n if (this != &rhs) {\n nbostream n(rhs);\n swap(n);\n }\n return *this;\n}\n\nnbostream::~nbostream() = default;\n\nvoid nbostream::fail(State s)\n{\n _state = static_cast<State>(_state | s);\n throw IllegalStateException(make_string(\"Stream failed bufsize(%zu), readp(%zu), writep(%zu)\", _wbuf.size(), _rp, _wp), VESPA_STRLOC);\n}\n\nstd::ostream & operator << (std::ostream & os, const nbostream & s) {\n return os << HexDump(&s._rbuf[s._rp], s.left());\n}\n\nvoid nbostream::reserve(size_t sz)\n{\n if (capacity() < sz) {\n extend(sz - capacity());\n }\n}\n\nvoid nbostream::compact()\n{\n memmove(&_wbuf[0], &_rbuf[_rp], left());\n _wp = left();\n _rp = 0;\n}\n\n\nvoid nbostream::extend(size_t extraSize)\n{\n if (&_wbuf[0] != _rbuf.c_str()) {\n _wbuf.resize(roundUp2inN(_rbuf.size() + extraSize));\n compact();\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n }\n if (_rp != 0) {\n compact();\n }\n if (space() < extraSize) {\n _wbuf.resize(roundUp2inN(_wbuf.size() + extraSize));\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n }\n}\n\nvoid nbostream::swap(Buffer & buf) {\n if (_rp != 0) {\n compact();\n }\n _wbuf.resize(size());\n _wbuf.swap(buf);\n _rbuf = ConstBufferRef(&_wbuf[0], _wbuf.capacity());\n _wp = _wbuf.size();\n _rp = 0;\n _state = ok;\n}\n\nvoid nbostream::swap(nbostream & os)\n{\n std::swap(_rp, os._rp);\n std::swap(_wp, os._wp);\n std::swap(_state, os._state);\n _wbuf.swap(os._wbuf);\n std::swap(_rbuf, os._rbuf);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DICE_RANDOMOPERATION_H\n#define DICE_RANDOMOPERATION_H\n\n#include \"..\/stdafx.hpp\"\n\n#include \"IOperation.hpp\"\n\nclass RandomOperation : public IOperation\n{\n const int _lower, _upper;\n unsigned int _seed;\n bool _fixedSeed;\n\nprotected:\n \/**\n * \\brief Generates one random number from range specified in the\n * constructor.\n * \n * \\return Unique pointer to RollResult storing one random number.\n *\n * \\exception std::invalid_argument If constructor got bad arguments.\n * (Lower is less than 1 or\/and less than upper)\n *\/\n std::unique_ptr<RollResult> execute();\n \npublic:\n \/\/ If seed is not given, it will randomize using time\n \/**\n * Defines range for RandomOperation. Lower limit is 1, and upper is defined (both are inclusive).\n * by the user.\n *\n * \\param upper [in] Upper limit (inclusive) in random range.\n *\/\n RandomOperation(int upper);\n \/**\n * Defines range for RandomOperation. User can specify lower and upper limit (both inclusive).\n * for randomizing a number.\n * \n * \\param lower Lower limit (inclusive) in random range.\n * \\param upper Upper limit (inclusive) in random range.\n *\/\n RandomOperation(int lower, int upper);\n\n \/\/ Throws exception if lower >= upper\n \/**\n * \\brief Calls execute() and does nothing else.\n * \n * \\return Returns unique pointer to the RollResult containing one random\n * number from range specified by the constructor.\n *\/\n std::unique_ptr<RollResult> evaluate();\n \/**\n * \\brief Sets seed for randomizing a number.\n *\n * If seed is not set, it defaults to timestamp so operation generates\n * random number.\\n\n * If it is set, evaluating the operation will return the same result\n * every time.\n * \n * \\param newSeed Seed for random operation.\n *\/\n void changeSeed(unsigned newSeed);\n};\n\n#endif \/\/ DICE_RANDOMOPERATION_H\n<commit_msg>Doc for private vars.<commit_after>#ifndef DICE_RANDOMOPERATION_H\n#define DICE_RANDOMOPERATION_H\n\n#include \"..\/stdafx.hpp\"\n\n#include \"IOperation.hpp\"\n\nclass RandomOperation : public IOperation\n{\n \/\/ Upper and lower limits in range for generating number. These values\n \/\/ are inclusive.\n const int _lower, _upper;\n \/\/ Seed for random number generator that is used in execute().\n unsigned int _seed;\n \/\/ It is true if seed has been set, and false if not.\n bool _fixedSeed;\n\nprotected:\n \/**\n * \\brief Generates one random number from range specified in the\n * constructor.\n * \n * \\return Unique pointer to RollResult storing one random number.\n *\n * \\exception std::invalid_argument If constructor got bad arguments.\n * (Lower is less than 1 or\/and less than upper)\n *\/\n std::unique_ptr<RollResult> execute();\n \npublic:\n \/\/ If seed is not given, it will randomize using time\n \/**\n * Defines range for RandomOperation. Lower limit is 1, and upper is defined (both are inclusive).\n * by the user.\n *\n * \\param upper [in] Upper limit (inclusive) in random range.\n *\/\n RandomOperation(int upper);\n \/**\n * Defines range for RandomOperation. User can specify lower and upper limit (both inclusive).\n * for randomizing a number.\n * \n * \\param lower Lower limit (inclusive) in random range.\n * \\param upper Upper limit (inclusive) in random range.\n *\/\n RandomOperation(int lower, int upper);\n\n \/\/ Throws exception if lower >= upper\n \/**\n * \\brief Calls execute() and does nothing else.\n * \n * \\return Returns unique pointer to the RollResult containing one random\n * number from range specified by the constructor.\n *\/\n std::unique_ptr<RollResult> evaluate();\n \/**\n * \\brief Sets seed for randomizing a number.\n *\n * If seed is not set, it defaults to timestamp so operation generates\n * random number.\\n\n * If it is set, evaluating the operation will return the same result\n * every time.\n * \n * \\param newSeed Seed for random operation.\n *\/\n void changeSeed(unsigned newSeed);\n};\n\n#endif \/\/ DICE_RANDOMOPERATION_H\n<|endoftext|>"} {"text":"<commit_before>#include \"GuiScraperStart.h\"\n#include \"GuiScraperLog.h\"\n#include \"GuiMsgBoxYesNo.h\"\n\nGuiScraperStart::GuiScraperStart(Window* window) : GuiComponent(window),\n\tmBox(window, \":\/frame.png\"),\n\tmList(window, Eigen::Vector2i(2, 4)),\n\tmFilterLabel(mWindow),\n\tmSystemsLabel(mWindow),\n\tmManualLabel(mWindow),\n\tmFiltersOpt(mWindow),\n\tmSystemsOpt(mWindow, true),\n\tmManualSwitch(mWindow),\n\tmStartButton(mWindow)\n{\n\tmFilterLabel.setText(\"Filter: \");\n\tmSystemsLabel.setText(\"Systems: \");\n\tmManualLabel.setText(\"Manual mode: \");\n\n\taddChild(&mBox);\n\taddChild(&mList);\n\n\tusing namespace Eigen;\n\n\t\/\/add filters (with first one selected)\n\tmFiltersOpt.addEntry(mFiltersOpt.makeEntry(\"All Games\", \n\t\t[](SystemData*, FileData*) -> bool { return true; }, true));\n\tmFiltersOpt.addEntry(mFiltersOpt.makeEntry(\"Missing Image\", \n\t\t[](SystemData*, FileData* g) -> bool { return g->metadata.get(\"image\").empty(); }));\n\n\tmList.setEntry(Vector2i(0, 0), Vector2i(1, 1), &mFilterLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 0), Vector2i(1, 1), &mFiltersOpt, true, ComponentListComponent::AlignLeft);\n\n\t\/\/add systems (with all selected)\n\tstd::vector<SystemData*> sys = SystemData::sSystemVector;\n\tmSystemsOpt.populate(sys, \n\t\t[&](SystemData* s) { \n\t\t\treturn mSystemsOpt.makeEntry(s->getName(), s, true); \n\t});\n\n\tmList.setEntry(Vector2i(0, 1), Vector2i(1, 1), &mSystemsLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 1), Vector2i(1, 1), &mSystemsOpt, true, ComponentListComponent::AlignLeft);\n\n\tmList.setEntry(Vector2i(0, 2), Vector2i(1, 1), &mManualLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 2), Vector2i(1, 1), &mManualSwitch, true, ComponentListComponent::AlignLeft);\n\n\tmStartButton.setText(\"GO GO GO GO\", 0x00FF00FF);\n\tmStartButton.setPressedFunc(std::bind(&GuiScraperStart::pressedStart, this));\n\tmList.setEntry(Vector2i(0, 3), Vector2i(2, 1), &mStartButton, true, ComponentListComponent::AlignCenter);\n\n\tmList.setPosition(Renderer::getScreenWidth() \/ 2 - mList.getSize().x() \/ 2, Renderer::getScreenHeight() \/ 2 - mList.getSize().y() \/ 2);\n\n\tmBox.setEdgeColor(0x333333FF);\n\tmBox.fitTo(mList.getSize(), mList.getPosition(), Eigen::Vector2f(8, 8));\n}\n\nvoid GuiScraperStart::pressedStart()\n{\n\tstd::vector<SystemData*> sys = mSystemsOpt.getSelectedObjects();\n\tfor(auto it = sys.begin(); it != sys.end(); it++)\n\t{\n\t\tif((*it)->getPlatformId() == PlatformIds::PLATFORM_UNKNOWN)\n\t\t{\n\t\t\tmWindow->pushGui(new GuiMsgBoxYesNo(mWindow, \"Warning: some of your selected systems do not have a platform ID set. Results may be even more inaccurate than usual!\\nContinue anyway?\", \n\t\t\t\tstd::bind(&GuiScraperStart::start, this)));\n\t\t\treturn;\n\t\t}\n\t}\n\n\tstart();\n}\n\nvoid GuiScraperStart::start()\n{\n\tstd::queue<ScraperSearchParams> searches = getSearches(mSystemsOpt.getSelectedObjects(), mFiltersOpt.getSelectedObjects()[0]);\n\n\tGuiScraperLog* gsl = new GuiScraperLog(mWindow, searches, mManualSwitch.getState());\n\tmWindow->pushGui(gsl);\n\tgsl->start();\n\tdelete this;\n}\n\nstd::queue<ScraperSearchParams> GuiScraperStart::getSearches(std::vector<SystemData*> systems, GameFilterFunc selector)\n{\n\tstd::queue<ScraperSearchParams> queue;\n\tfor(auto sys = systems.begin(); sys != systems.end(); sys++)\n\t{\n\t\tstd::vector<FileData*> games = (*sys)->getRootFolder()->getFilesRecursive(GAME);\n\t\tfor(auto game = games.begin(); game != games.end(); game++)\n\t\t{\n\t\t\tif(selector((*sys), (*game)))\n\t\t\t{\n\t\t\t\tScraperSearchParams search;\n\t\t\t\tsearch.game = *game;\n\t\t\t\tsearch.system = *sys;\n\t\t\t\t\n\t\t\t\tqueue.push(search);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn queue;\n}\n\nbool GuiScraperStart::input(InputConfig* config, Input input)\n{\n\tbool consumed = GuiComponent::input(config, input);\n\tif(consumed)\n\t\treturn true;\n\t\n\tif(input.value != 0 && config->isMappedTo(\"b\", input))\n\t{\n\t\tdelete this;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n<commit_msg>Don't scrape systems without a platform ID set by default.<commit_after>#include \"GuiScraperStart.h\"\n#include \"GuiScraperLog.h\"\n#include \"GuiMsgBoxYesNo.h\"\n\nGuiScraperStart::GuiScraperStart(Window* window) : GuiComponent(window),\n\tmBox(window, \":\/frame.png\"),\n\tmList(window, Eigen::Vector2i(2, 4)),\n\tmFilterLabel(mWindow),\n\tmSystemsLabel(mWindow),\n\tmManualLabel(mWindow),\n\tmFiltersOpt(mWindow),\n\tmSystemsOpt(mWindow, true),\n\tmManualSwitch(mWindow),\n\tmStartButton(mWindow)\n{\n\tmFilterLabel.setText(\"Filter: \");\n\tmSystemsLabel.setText(\"Systems: \");\n\tmManualLabel.setText(\"Manual mode: \");\n\n\taddChild(&mBox);\n\taddChild(&mList);\n\n\tusing namespace Eigen;\n\n\t\/\/add filters (with first one selected)\n\tmFiltersOpt.addEntry(mFiltersOpt.makeEntry(\"All Games\", \n\t\t[](SystemData*, FileData*) -> bool { return true; }, true));\n\tmFiltersOpt.addEntry(mFiltersOpt.makeEntry(\"Missing Image\", \n\t\t[](SystemData*, FileData* g) -> bool { return g->metadata.get(\"image\").empty(); }));\n\n\tmList.setEntry(Vector2i(0, 0), Vector2i(1, 1), &mFilterLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 0), Vector2i(1, 1), &mFiltersOpt, true, ComponentListComponent::AlignLeft);\n\n\t\/\/add systems (all with a platformid specified selected)\n\tstd::vector<SystemData*> sys = SystemData::sSystemVector;\n\tmSystemsOpt.populate(sys, \n\t\t[&](SystemData* s) { \n\t\t\treturn mSystemsOpt.makeEntry(s->getName(), s, s->getPlatformId() != PlatformIds::PLATFORM_UNKNOWN); \n\t});\n\n\tmList.setEntry(Vector2i(0, 1), Vector2i(1, 1), &mSystemsLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 1), Vector2i(1, 1), &mSystemsOpt, true, ComponentListComponent::AlignLeft);\n\n\tmList.setEntry(Vector2i(0, 2), Vector2i(1, 1), &mManualLabel, false, ComponentListComponent::AlignRight);\n\tmList.setEntry(Vector2i(1, 2), Vector2i(1, 1), &mManualSwitch, true, ComponentListComponent::AlignLeft);\n\n\tmStartButton.setText(\"GO GO GO GO\", 0x00FF00FF);\n\tmStartButton.setPressedFunc(std::bind(&GuiScraperStart::pressedStart, this));\n\tmList.setEntry(Vector2i(0, 3), Vector2i(2, 1), &mStartButton, true, ComponentListComponent::AlignCenter);\n\n\tmList.setPosition(Renderer::getScreenWidth() \/ 2 - mList.getSize().x() \/ 2, Renderer::getScreenHeight() \/ 2 - mList.getSize().y() \/ 2);\n\n\tmBox.setEdgeColor(0x333333FF);\n\tmBox.fitTo(mList.getSize(), mList.getPosition(), Eigen::Vector2f(8, 8));\n}\n\nvoid GuiScraperStart::pressedStart()\n{\n\tstd::vector<SystemData*> sys = mSystemsOpt.getSelectedObjects();\n\tfor(auto it = sys.begin(); it != sys.end(); it++)\n\t{\n\t\tif((*it)->getPlatformId() == PlatformIds::PLATFORM_UNKNOWN)\n\t\t{\n\t\t\tmWindow->pushGui(new GuiMsgBoxYesNo(mWindow, \"Warning: some of your selected systems do not have a platform ID set. Results may be even more inaccurate than usual!\\nContinue anyway?\", \n\t\t\t\tstd::bind(&GuiScraperStart::start, this)));\n\t\t\treturn;\n\t\t}\n\t}\n\n\tstart();\n}\n\nvoid GuiScraperStart::start()\n{\n\tstd::queue<ScraperSearchParams> searches = getSearches(mSystemsOpt.getSelectedObjects(), mFiltersOpt.getSelectedObjects()[0]);\n\n\tGuiScraperLog* gsl = new GuiScraperLog(mWindow, searches, mManualSwitch.getState());\n\tmWindow->pushGui(gsl);\n\tgsl->start();\n\tdelete this;\n}\n\nstd::queue<ScraperSearchParams> GuiScraperStart::getSearches(std::vector<SystemData*> systems, GameFilterFunc selector)\n{\n\tstd::queue<ScraperSearchParams> queue;\n\tfor(auto sys = systems.begin(); sys != systems.end(); sys++)\n\t{\n\t\tstd::vector<FileData*> games = (*sys)->getRootFolder()->getFilesRecursive(GAME);\n\t\tfor(auto game = games.begin(); game != games.end(); game++)\n\t\t{\n\t\t\tif(selector((*sys), (*game)))\n\t\t\t{\n\t\t\t\tScraperSearchParams search;\n\t\t\t\tsearch.game = *game;\n\t\t\t\tsearch.system = *sys;\n\t\t\t\t\n\t\t\t\tqueue.push(search);\n\t\t\t}\n\t\t}\n\t}\n\n\treturn queue;\n}\n\nbool GuiScraperStart::input(InputConfig* config, Input input)\n{\n\tbool consumed = GuiComponent::input(config, input);\n\tif(consumed)\n\t\treturn true;\n\t\n\tif(input.value != 0 && config->isMappedTo(\"b\", input))\n\t{\n\t\tdelete this;\n\t\treturn true;\n\t}\n\n\treturn false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-gdt project:\n\/\/ http:\/\/users.dune-project.org\/projects\/dune-gdt\n\/\/ Copyright holders: Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n#define DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n\n#include <memory>\n#include <type_traits>\n\n#include <dune\/geometry\/genericgeometry\/topologytypes.hh>\n\n#include <dune\/common\/typetraits.hh>\n\n#include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/common\/fvector.hh>\n#include <dune\/stuff\/common\/reenable_warnings.hh>\n\n#if HAVE_DUNE_ISTL\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/istl\/paamg\/pinfo.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n# include <dune\/stuff\/la\/solver\/istl_amg.hh>\n#endif\n\n#if HAVE_DUNE_PDELAB\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/pdelab\/finiteelementmap\/pkfem.hh>\n# include <dune\/pdelab\/finiteelementmap\/qkfem.hh>\n# include <dune\/pdelab\/gridfunctionspace\/gridfunctionspace.hh>\n# include <dune\/pdelab\/constraints\/conforming.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n#endif \/\/ HAVE_DUNE_PDELAB\n\n#include <dune\/gdt\/spaces\/parallel.hh>\n\n#include \"..\/..\/mapper\/pdelab.hh\"\n#include \"..\/..\/basefunctionset\/pdelab.hh\"\n\n#include \"base.hh\"\n\nnamespace Dune {\n\nnamespace GDT {\nnamespace Spaces {\nnamespace ContinuousLagrange {\n\n#if HAVE_DUNE_PDELAB\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBased\n{\n static_assert((Dune::AlwaysFalse< GridViewImp >::value), \"Untested for this combination of dimensions!\");\n};\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBasedTraits\n{\npublic:\n typedef PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, rangeDim, rangeDimCols > derived_type;\n typedef GridViewImp GridViewType;\n static const int polOrder = polynomialOrder;\n static_assert(polOrder >= 1, \"Wrong polOrder given!\");\nprivate:\n typedef typename GridViewType::ctype DomainFieldType;\npublic:\n static const unsigned int dimDomain = GridViewType::dimension;\n typedef RangeFieldImp RangeFieldType;\n static const unsigned int dimRange = rangeDim;\n static const unsigned int dimRangeCols = rangeDimCols;\nprivate:\n template< class G, bool single_geom, bool is_simplex, bool is_cube >\n struct FeMap\n {\n static_assert(Dune::AlwaysFalse< G >::value,\n \"This space is only implemented for either fully simplicial or fully cubic grids!\");\n };\n template< class G >\n struct FeMap< G, true, true, false >\n {\n typedef PDELab::PkLocalFiniteElementMap < GridViewType, DomainFieldType, RangeFieldType, polOrder> Type;\n };\n template< class G >\n struct FeMap< G, true, false, true >\n {\n typedef PDELab::QkLocalFiniteElementMap < GridViewType, DomainFieldType, RangeFieldType, polOrder> Type;\n };\n typedef typename GridViewType::Grid GridType;\n static const bool single_geom_ = Dune::Capabilities::hasSingleGeometryType< GridType >::v;\n static const bool simplicial_ = (Dune::Capabilities::hasSingleGeometryType< GridType >::topologyId\n == GenericGeometry::SimplexTopology< dimDomain >::type::id);\n static const bool cubic_ = (Dune::Capabilities::hasSingleGeometryType< GridType >::topologyId\n == GenericGeometry::CubeTopology< dimDomain >::type::id);\n typedef typename FeMap< GridType, single_geom_, simplicial_, cubic_ >::Type FEMapType;\npublic:\n typedef PDELab::GridFunctionSpace< GridViewType, FEMapType, PDELab::OverlappingConformingDirichletConstraints > BackendType;\n typedef Mapper::SimplePdelabWrapper< BackendType > MapperType;\n typedef typename GridViewType::template Codim< 0 >::Entity EntityType;\n typedef BaseFunctionSet::PdelabWrapper\n < BackendType, EntityType, DomainFieldType, dimDomain, RangeFieldType, dimRange, dimRangeCols >\n BaseFunctionSetType;\n static const Stuff::Grid::ChoosePartView part_view_type = Stuff::Grid::ChoosePartView::view;\n static const bool needs_grid_view = true;\n\n typedef typename CommunicationChooser<GridViewType>::Type CommunicatorType;\nprivate:\n friend class PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, rangeDim, rangeDimCols >;\n}; \/\/ class SpaceWrappedFemContinuousLagrangeTraits\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp >\nclass PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n : public Spaces::ContinuousLagrangeBase< PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n , GridViewImp::dimension, RangeFieldImp, 1, 1 >\n{\n typedef Spaces::ContinuousLagrangeBase< PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n , GridViewImp::dimension, RangeFieldImp, 1, 1 > BaseType;\n typedef PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 > ThisType;\npublic:\n typedef PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 > Traits;\n\n typedef typename Traits::GridViewType GridViewType;\n static const int polOrder = Traits::polOrder;\n typedef typename GridViewType::ctype DomainFieldType;\n static const unsigned int dimDomain = GridViewType::dimension;\n typedef FieldVector< DomainFieldType, dimDomain > DomainType;\n typedef typename Traits::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = Traits::dimRange;\n static const unsigned int dimRangeCols = Traits::dimRangeCols;\n\n typedef typename Traits::BackendType BackendType;\n typedef typename Traits::MapperType MapperType;\n typedef typename Traits::BaseFunctionSetType BaseFunctionSetType;\n typedef typename Traits::CommunicatorType CommunicatorType;\n\nprivate:\n typedef typename Traits::FEMapType FEMapType;\n\npublic:\n typedef typename BaseType::IntersectionType IntersectionType;\n typedef typename BaseType::EntityType EntityType;\n typedef typename BaseType::PatternType PatternType;\n typedef typename BaseType::BoundaryInfoType BoundaryInfoType;\n\n PdelabBased(const std::shared_ptr< const GridViewType >& gV)\n : gridView_(gV)\n , fe_map_(std::make_shared< FEMapType >(*(gridView_)))\n , backend_(std::make_shared< BackendType >(const_cast< GridViewType& >(*gridView_), *(*fe_map_)))\n , mapper_(std::make_shared< MapperType >(*(*backend_)))\n , communicator_(CommunicationChooser<GridViewImp>::create(*gridView_))\n , communicator_prepared_(false)\n {}\n\n PdelabBased(const ThisType& other)\n : gridView_(other.gridView_)\n , fe_map_(other.fe_map_)\n , backend_(other.backend_)\n , mapper_(other.mapper_)\n , communicator_(other.communicator_)\n , communicator_prepared_(other.communicator_prepared_)\n {}\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n gridView_ = other.gridView_;\n fe_map_ = other.fe_map_;\n backend_ = other.backend_;\n mapper_ = other.mapper_;\n communicator_ = other.communicator_;\n communicator_prepared_ = other.communicator_prepared_;\n }\n return *this;\n }\n\n ~PdelabBased() {}\n\n const std::shared_ptr< const GridViewType >& grid_view() const\n {\n return gridView_;\n }\n\n const BackendType& backend() const\n {\n return *(*backend_);\n }\n\n const MapperType& mapper() const\n {\n return *(*mapper_);\n }\n\n BaseFunctionSetType base_function_set(const EntityType& entity) const\n {\n return BaseFunctionSetType(*(*backend_), entity);\n }\n\n CommunicatorType& communicator() const\n {\n std::lock_guard<std::mutex> gg(communicator_mutex_);\n if (!communicator_prepared_) {\n communicator_prepared_ = CommunicationChooser<GridViewType>::prepare(*this, *communicator_);\n }\n return *communicator_;\n } \/\/ ... communicator(...)\n\nprivate:\n std::shared_ptr< const GridViewType > gridView_;\n DS::PerThreadValue<std::shared_ptr< const FEMapType >> fe_map_;\n DS::PerThreadValue<std::shared_ptr< const BackendType >> backend_;\n DS::PerThreadValue<std::shared_ptr< const MapperType >> mapper_;\n mutable std::shared_ptr< CommunicatorType > communicator_;\n mutable bool communicator_prepared_;\n mutable std::mutex communicator_mutex_;\n}; \/\/ class PdelabBased< ..., 1 >\n\n\n#else \/\/ HAVE_DUNE_PDELAB\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBased\n{\n static_assert((Dune::AlwaysFalse< GridViewImp >::value), \"You are missing dune-pdelab!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_PDELAB\n\n} \/\/ namespace ContinuousLagrange\n} \/\/ namespace Spaces\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n<commit_msg>[spaces.cg.pdelab] simplify member<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/ http:\/\/users.dune-project.org\/projects\/dune-gdt\n\/\/ Copyright holders: Felix Schindler\n\/\/ License: BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\n#ifndef DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n#define DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n\n#include <memory>\n#include <type_traits>\n\n#include <dune\/geometry\/genericgeometry\/topologytypes.hh>\n\n#include <dune\/common\/typetraits.hh>\n\n#include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/common\/fvector.hh>\n#include <dune\/stuff\/common\/reenable_warnings.hh>\n\n#if HAVE_DUNE_ISTL\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/istl\/paamg\/pinfo.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n# include <dune\/stuff\/la\/solver\/istl_amg.hh>\n#endif\n\n#if HAVE_DUNE_PDELAB\n# include <dune\/stuff\/common\/disable_warnings.hh>\n# include <dune\/pdelab\/finiteelementmap\/pkfem.hh>\n# include <dune\/pdelab\/finiteelementmap\/qkfem.hh>\n# include <dune\/pdelab\/gridfunctionspace\/gridfunctionspace.hh>\n# include <dune\/pdelab\/constraints\/conforming.hh>\n# include <dune\/stuff\/common\/reenable_warnings.hh>\n#endif \/\/ HAVE_DUNE_PDELAB\n\n#include <dune\/gdt\/spaces\/parallel.hh>\n\n#include \"..\/..\/mapper\/pdelab.hh\"\n#include \"..\/..\/basefunctionset\/pdelab.hh\"\n\n#include \"base.hh\"\n\nnamespace Dune {\n\nnamespace GDT {\nnamespace Spaces {\nnamespace ContinuousLagrange {\n\n#if HAVE_DUNE_PDELAB\n\n\n\/\/ forward, to be used in the traits and to allow for specialization\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBased\n{\n static_assert((Dune::AlwaysFalse< GridViewImp >::value), \"Untested for this combination of dimensions!\");\n};\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBasedTraits\n{\npublic:\n typedef PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, rangeDim, rangeDimCols > derived_type;\n typedef GridViewImp GridViewType;\n static const int polOrder = polynomialOrder;\n static_assert(polOrder >= 1, \"Wrong polOrder given!\");\nprivate:\n typedef typename GridViewType::ctype DomainFieldType;\npublic:\n static const unsigned int dimDomain = GridViewType::dimension;\n typedef RangeFieldImp RangeFieldType;\n static const unsigned int dimRange = rangeDim;\n static const unsigned int dimRangeCols = rangeDimCols;\nprivate:\n template< class G, bool single_geom, bool is_simplex, bool is_cube >\n struct FeMap\n {\n static_assert(Dune::AlwaysFalse< G >::value,\n \"This space is only implemented for either fully simplicial or fully cubic grids!\");\n };\n template< class G >\n struct FeMap< G, true, true, false >\n {\n typedef PDELab::PkLocalFiniteElementMap < GridViewType, DomainFieldType, RangeFieldType, polOrder> Type;\n };\n template< class G >\n struct FeMap< G, true, false, true >\n {\n typedef PDELab::QkLocalFiniteElementMap < GridViewType, DomainFieldType, RangeFieldType, polOrder> Type;\n };\n typedef typename GridViewType::Grid GridType;\n static const bool single_geom_ = Dune::Capabilities::hasSingleGeometryType< GridType >::v;\n static const bool simplicial_ = (Dune::Capabilities::hasSingleGeometryType< GridType >::topologyId\n == GenericGeometry::SimplexTopology< dimDomain >::type::id);\n static const bool cubic_ = (Dune::Capabilities::hasSingleGeometryType< GridType >::topologyId\n == GenericGeometry::CubeTopology< dimDomain >::type::id);\n typedef typename FeMap< GridType, single_geom_, simplicial_, cubic_ >::Type FEMapType;\npublic:\n typedef PDELab::GridFunctionSpace< GridViewType, FEMapType, PDELab::OverlappingConformingDirichletConstraints > BackendType;\n typedef Mapper::SimplePdelabWrapper< BackendType > MapperType;\n typedef typename GridViewType::template Codim< 0 >::Entity EntityType;\n typedef BaseFunctionSet::PdelabWrapper\n < BackendType, EntityType, DomainFieldType, dimDomain, RangeFieldType, dimRange, dimRangeCols >\n BaseFunctionSetType;\n static const Stuff::Grid::ChoosePartView part_view_type = Stuff::Grid::ChoosePartView::view;\n static const bool needs_grid_view = true;\n\n typedef typename CommunicationChooser<GridViewType>::Type CommunicatorType;\nprivate:\n friend class PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, rangeDim, rangeDimCols >;\n}; \/\/ class SpaceWrappedFemContinuousLagrangeTraits\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp >\nclass PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n : public Spaces::ContinuousLagrangeBase< PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n , GridViewImp::dimension, RangeFieldImp, 1, 1 >\n{\n typedef Spaces::ContinuousLagrangeBase< PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 >\n , GridViewImp::dimension, RangeFieldImp, 1, 1 > BaseType;\n typedef PdelabBased< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 > ThisType;\npublic:\n typedef PdelabBasedTraits< GridViewImp, polynomialOrder, RangeFieldImp, 1, 1 > Traits;\n\n typedef typename Traits::GridViewType GridViewType;\n static const int polOrder = Traits::polOrder;\n typedef typename GridViewType::ctype DomainFieldType;\n static const unsigned int dimDomain = GridViewType::dimension;\n typedef FieldVector< DomainFieldType, dimDomain > DomainType;\n typedef typename Traits::RangeFieldType RangeFieldType;\n static const unsigned int dimRange = Traits::dimRange;\n static const unsigned int dimRangeCols = Traits::dimRangeCols;\n\n typedef typename Traits::BackendType BackendType;\n typedef typename Traits::MapperType MapperType;\n typedef typename Traits::BaseFunctionSetType BaseFunctionSetType;\n typedef typename Traits::CommunicatorType CommunicatorType;\n\nprivate:\n typedef typename Traits::FEMapType FEMapType;\n\npublic:\n typedef typename BaseType::IntersectionType IntersectionType;\n typedef typename BaseType::EntityType EntityType;\n typedef typename BaseType::PatternType PatternType;\n typedef typename BaseType::BoundaryInfoType BoundaryInfoType;\n\n PdelabBased(const std::shared_ptr< const GridViewType >& gV)\n : gridView_(gV)\n , fe_map_(*(gridView_))\n , backend_(const_cast< GridViewType& >(*gridView_), fe_map_)\n , mapper_(backend_)\n , communicator_(CommunicationChooser<GridViewImp>::create(*gridView_))\n , communicator_prepared_(false)\n {}\n\n PdelabBased(const ThisType& other)\n : gridView_(other.gridView_)\n , fe_map_(other.fe_map_)\n , backend_(other.backend_)\n , mapper_(other.mapper_)\n , communicator_(other.communicator_)\n , communicator_prepared_(other.communicator_prepared_)\n {}\n\n ThisType& operator=(const ThisType& other)\n {\n if (this != &other) {\n gridView_ = other.gridView_;\n fe_map_ = other.fe_map_;\n backend_ = other.backend_;\n mapper_ = other.mapper_;\n communicator_ = other.communicator_;\n communicator_prepared_ = other.communicator_prepared_;\n }\n return *this;\n }\n\n ~PdelabBased() {}\n\n const std::shared_ptr< const GridViewType >& grid_view() const\n {\n return gridView_;\n }\n\n const BackendType& backend() const\n {\n return backend_;\n }\n\n const MapperType& mapper() const\n {\n return mapper_;\n }\n\n BaseFunctionSetType base_function_set(const EntityType& entity) const\n {\n return BaseFunctionSetType(backend_, entity);\n }\n\n CommunicatorType& communicator() const\n {\n std::lock_guard<std::mutex> gg(communicator_mutex_);\n if (!communicator_prepared_) {\n communicator_prepared_ = CommunicationChooser<GridViewType>::prepare(*this, *communicator_);\n }\n return *communicator_;\n } \/\/ ... communicator(...)\n\nprivate:\n std::shared_ptr< const GridViewType > gridView_;\n const FEMapType fe_map_;\n const BackendType backend_;\n const MapperType mapper_;\n mutable std::shared_ptr< CommunicatorType > communicator_;\n mutable bool communicator_prepared_;\n mutable std::mutex communicator_mutex_;\n}; \/\/ class PdelabBased< ..., 1 >\n\n\n#else \/\/ HAVE_DUNE_PDELAB\n\n\ntemplate< class GridViewImp, int polynomialOrder, class RangeFieldImp, int rangeDim, int rangeDimCols = 1 >\nclass PdelabBased\n{\n static_assert((Dune::AlwaysFalse< GridViewImp >::value), \"You are missing dune-pdelab!\");\n};\n\n\n#endif \/\/ HAVE_DUNE_PDELAB\n\n} \/\/ namespace ContinuousLagrange\n} \/\/ namespace Spaces\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_SPACES_CONTINUOUSLAGRANGE_PDELAB_HH\n<|endoftext|>"} {"text":"<commit_before>#include \"ampfrm.h\"\n#include <qwt_knob.h>\n#include <qwt_thermo.h>\n#include <qwt_round_scale_draw.h>\n#include <qwt_math.h>\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qfont.h>\n#include <qpen.h>\n#include <qevent.h>\n\n#if QT_VERSION < 0x040600\n#define qFastSin(x) ::sin(x)\n#define qFastCos(x) ::cos(x)\n#endif\n\nclass Knob: public QWidget\n{\npublic:\n Knob( const QString &title, double min, double max, QWidget *parent ):\n QWidget( parent )\n {\n d_knob = new QwtKnob( this );\n d_knob->setScale( min, max );\n d_knob->setTotalSteps( 0 ); \/\/ disable\n d_knob->setScaleMaxMajor( 10 );\n\n d_knob->setKnobStyle( QwtKnob::Raised );\n d_knob->setKnobWidth( 50 );\n d_knob->setBorderWidth( 2 );\n d_knob->setMarkerStyle( QwtKnob::Notch );\n d_knob->setMarkerSize( 8 );\n\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MinorTick, 4 );\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MediumTick, 4 );\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MajorTick, 6 );\n\n d_label = new QLabel( title, this );\n d_label->setAlignment( Qt::AlignTop | Qt::AlignHCenter );\n\n setSizePolicy( QSizePolicy::MinimumExpanding,\n QSizePolicy::MinimumExpanding );\n }\n\n virtual QSize sizeHint() const\n {\n QSize sz1 = d_knob->sizeHint();\n QSize sz2 = d_label->sizeHint();\n\n const int w = qMax( sz1.width(), sz2.width() );\n const int h = sz1.height() + sz2.height();\n\n int off = qCeil( d_knob->scaleDraw()->extent( d_knob->font() ) );\n off -= 10; \/\/ spacing\n\n return QSize( w, h - off );\n }\n\n void setValue( double value )\n {\n d_knob->setValue( value );\n }\n\n double value() const\n {\n return d_knob->value();\n }\n\nprotected:\n virtual void resizeEvent( QResizeEvent *e )\n {\n const QSize sz = e->size();\n\n int h = d_label->sizeHint().height();\n\n d_label->setGeometry( 0, sz.height() - h, sz.width(), h );\n\n h = d_knob->sizeHint().height();\n int off = qCeil( d_knob->scaleDraw()->extent( d_knob->font() ) );\n off -= 10; \/\/ spacing\n\n d_knob->setGeometry( 0, d_label->pos().y() - h + off,\n sz.width(), h );\n }\n\nprivate:\n QwtKnob *d_knob;\n QLabel *d_label;\n};\n\nclass Thermo: public QWidget\n{\npublic:\n Thermo( const QString &title, QWidget *parent ):\n QWidget( parent )\n {\n d_thermo = new QwtThermo( this );\n d_thermo->setPipeWidth( 6 );\n d_thermo->setScale( -40, 10 );\n d_thermo->setFillBrush( Qt::green );\n d_thermo->setAlarmBrush( Qt::red );\n d_thermo->setAlarmLevel( 0.0 );\n d_thermo->setAlarmEnabled( true );\n\n QLabel *label = new QLabel( title, this );\n label->setAlignment( Qt::AlignTop | Qt::AlignLeft );\n\n QVBoxLayout *layout = new QVBoxLayout( this );\n layout->setMargin( 0 );\n layout->setSpacing( 0 );\n layout->addWidget( d_thermo, 10 );\n layout->addWidget( label );\n }\n\n void setValue( double value )\n {\n d_thermo->setValue( value );\n }\n\nprivate:\n QwtThermo *d_thermo;\n};\n\nAmpFrame::AmpFrame( QWidget *p ):\n QFrame( p )\n{\n d_knbVolume = new Knob( \"Volume\", 0.0, 10.0, this );\n d_knbBalance = new Knob( \"Balance\", -10.0, 10.0, this );\n d_knbTreble = new Knob( \"Treble\", -10.0, 10.0, this );\n d_knbBass = new Knob( \"Bass\", -10.0, 10.0, this );\n\n d_thmLeft = new Thermo( \"Left [dB]\", this );\n d_thmRight = new Thermo( \"Right [dB]\", this );\n\n QHBoxLayout *layout = new QHBoxLayout( this );\n layout->setSpacing( 0 );\n layout->setMargin( 10 );\n layout->addWidget( d_knbVolume );\n layout->addWidget( d_knbBalance );\n layout->addWidget( d_knbTreble );\n layout->addWidget( d_knbBass );\n layout->addSpacing( 20 );\n layout->addStretch( 10 );\n layout->addWidget( d_thmLeft );\n layout->addSpacing( 10 );\n layout->addWidget( d_thmRight );\n\n d_knbVolume->setValue( 7.0 );\n ( void )startTimer( 50 );\n}\n\nvoid AmpFrame::timerEvent( QTimerEvent * )\n{\n static double phs = 0;\n\n \/\/\n \/\/ This amplifier generates its own input signal...\n \/\/\n\n const double sig_bass = ( 1.0 + 0.1 * d_knbBass->value() )\n * qFastSin( 13.0 * phs );\n const double sig_mid_l = qFastSin( 17.0 * phs );\n const double sig_mid_r = qFastCos( 17.5 * phs );\n const double sig_trbl_l = 0.5 * ( 1.0 + 0.1 * d_knbTreble->value() )\n * qFastSin( 35.0 * phs );\n const double sig_trbl_r = 0.5 * ( 1.0 + 0.1 * d_knbTreble->value() )\n * qFastSin( 34.0 * phs );\n\n double sig_l = 0.05 * d_master * d_knbVolume->value()\n * qwtSqr( sig_bass + sig_mid_l + sig_trbl_l );\n double sig_r = 0.05 * d_master * d_knbVolume->value()\n * qwtSqr( sig_bass + sig_mid_r + sig_trbl_r );\n\n double balance = 0.1 * d_knbBalance->value();\n if ( balance > 0 )\n sig_l *= ( 1.0 - balance );\n else\n sig_r *= ( 1.0 + balance );\n\n if ( sig_l > 0.01 )\n sig_l = 20.0 * log10( sig_l );\n else\n sig_l = -40.0;\n\n if ( sig_r > 0.01 )\n sig_r = 20.0 * log10( sig_r );\n else\n sig_r = - 40.0;\n\n d_thmLeft->setValue( sig_l );\n d_thmRight->setValue( sig_r );\n\n phs += M_PI \/ 100;\n if ( phs > M_PI )\n phs = 0;\n}\n\nvoid AmpFrame::setMaster( double v )\n{\n d_master = v;\n}\n<commit_msg>knob alignemnt fixed<commit_after>#include \"ampfrm.h\"\n#include <qwt_knob.h>\n#include <qwt_thermo.h>\n#include <qwt_round_scale_draw.h>\n#include <qwt_math.h>\n#include <qlayout.h>\n#include <qlabel.h>\n#include <qfont.h>\n#include <qpen.h>\n#include <qevent.h>\n\n#if QT_VERSION < 0x040600\n#define qFastSin(x) ::sin(x)\n#define qFastCos(x) ::cos(x)\n#endif\n\nclass Knob: public QWidget\n{\npublic:\n Knob( const QString &title, double min, double max, QWidget *parent ):\n QWidget( parent )\n {\n d_knob = new QwtKnob( this );\n d_knob->setScale( min, max );\n d_knob->setTotalSteps( 0 ); \/\/ disable\n d_knob->setScaleMaxMajor( 10 );\n\n d_knob->setKnobStyle( QwtKnob::Raised );\n d_knob->setKnobWidth( 50 );\n d_knob->setBorderWidth( 2 );\n d_knob->setMarkerStyle( QwtKnob::Notch );\n d_knob->setMarkerSize( 8 );\n\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MinorTick, 4 );\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MediumTick, 4 );\n d_knob->scaleDraw()->setTickLength( QwtScaleDiv::MajorTick, 6 );\n\n d_label = new QLabel( title, this );\n d_label->setAlignment( Qt::AlignTop | Qt::AlignHCenter );\n\n setSizePolicy( QSizePolicy::MinimumExpanding,\n QSizePolicy::MinimumExpanding );\n }\n\n virtual QSize sizeHint() const\n {\n QSize sz1 = d_knob->sizeHint();\n QSize sz2 = d_label->sizeHint();\n\n const int w = qMax( sz1.width(), sz2.width() );\n const int h = sz1.height() + sz2.height();\n\n int off = qCeil( d_knob->scaleDraw()->extent( d_knob->font() ) );\n off -= 10; \/\/ spacing\n\n return QSize( w, h - off );\n }\n\n void setValue( double value )\n {\n d_knob->setValue( value );\n }\n\n double value() const\n {\n return d_knob->value();\n }\n\nprotected:\n virtual void resizeEvent( QResizeEvent *e )\n {\n const QSize sz = e->size();\n\n int h = d_label->sizeHint().height();\n\n d_label->setGeometry( 0, sz.height() - h, sz.width(), h );\n\n h = d_knob->sizeHint().height();\n int off = qCeil( d_knob->scaleDraw()->extent( d_knob->font() ) );\n off -= 10; \/\/ spacing\n\n d_knob->setGeometry( 0, d_label->pos().y() - h + off,\n sz.width(), h );\n }\n\nprivate:\n QwtKnob *d_knob;\n QLabel *d_label;\n};\n\nclass Thermo: public QWidget\n{\npublic:\n Thermo( const QString &title, QWidget *parent ):\n QWidget( parent )\n {\n d_thermo = new QwtThermo( this );\n d_thermo->setPipeWidth( 6 );\n d_thermo->setScale( -40, 10 );\n d_thermo->setFillBrush( Qt::green );\n d_thermo->setAlarmBrush( Qt::red );\n d_thermo->setAlarmLevel( 0.0 );\n d_thermo->setAlarmEnabled( true );\n\n QLabel *label = new QLabel( title, this );\n label->setAlignment( Qt::AlignTop | Qt::AlignLeft );\n\n QVBoxLayout *layout = new QVBoxLayout( this );\n layout->setMargin( 0 );\n layout->setSpacing( 0 );\n layout->addWidget( d_thermo, 10 );\n layout->addWidget( label );\n }\n\n void setValue( double value )\n {\n d_thermo->setValue( value );\n }\n\nprivate:\n QwtThermo *d_thermo;\n};\n\nAmpFrame::AmpFrame( QWidget *p ):\n QFrame( p )\n{\n d_knbVolume = new Knob( \"Volume\", 0.0, 10.0, this );\n d_knbBalance = new Knob( \"Balance\", -10.0, 10.0, this );\n d_knbTreble = new Knob( \"Treble\", -10.0, 10.0, this );\n d_knbBass = new Knob( \"Bass\", -10.0, 10.0, this );\n\n d_thmLeft = new Thermo( \"Left [dB]\", this );\n d_thmRight = new Thermo( \"Right [dB]\", this );\n\n QHBoxLayout *layout = new QHBoxLayout( this );\n layout->setSpacing( 0 );\n layout->setMargin( 10 );\n layout->addWidget( d_knbVolume, 0, Qt::AlignHCenter | Qt::AlignTop );\n layout->addWidget( d_knbBalance, 0, Qt::AlignHCenter | Qt::AlignTop );\n layout->addWidget( d_knbTreble, 0, Qt::AlignHCenter | Qt::AlignTop );\n layout->addWidget( d_knbBass, 0, Qt::AlignHCenter | Qt::AlignTop );\n layout->addSpacing( 20 );\n layout->addStretch( 10 );\n layout->addWidget( d_thmLeft );\n layout->addSpacing( 10 );\n layout->addWidget( d_thmRight );\n\n d_knbVolume->setValue( 7.0 );\n ( void )startTimer( 50 );\n}\n\nvoid AmpFrame::timerEvent( QTimerEvent * )\n{\n static double phs = 0;\n\n \/\/\n \/\/ This amplifier generates its own input signal...\n \/\/\n\n const double sig_bass = ( 1.0 + 0.1 * d_knbBass->value() )\n * qFastSin( 13.0 * phs );\n const double sig_mid_l = qFastSin( 17.0 * phs );\n const double sig_mid_r = qFastCos( 17.5 * phs );\n const double sig_trbl_l = 0.5 * ( 1.0 + 0.1 * d_knbTreble->value() )\n * qFastSin( 35.0 * phs );\n const double sig_trbl_r = 0.5 * ( 1.0 + 0.1 * d_knbTreble->value() )\n * qFastSin( 34.0 * phs );\n\n double sig_l = 0.05 * d_master * d_knbVolume->value()\n * qwtSqr( sig_bass + sig_mid_l + sig_trbl_l );\n double sig_r = 0.05 * d_master * d_knbVolume->value()\n * qwtSqr( sig_bass + sig_mid_r + sig_trbl_r );\n\n double balance = 0.1 * d_knbBalance->value();\n if ( balance > 0 )\n sig_l *= ( 1.0 - balance );\n else\n sig_r *= ( 1.0 + balance );\n\n if ( sig_l > 0.01 )\n sig_l = 20.0 * log10( sig_l );\n else\n sig_l = -40.0;\n\n if ( sig_r > 0.01 )\n sig_r = 20.0 * log10( sig_r );\n else\n sig_r = - 40.0;\n\n d_thmLeft->setValue( sig_l );\n d_thmRight->setValue( sig_r );\n\n phs += M_PI \/ 100;\n if ( phs > M_PI )\n phs = 0;\n}\n\nvoid AmpFrame::setMaster( double v )\n{\n d_master = v;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/info_bubble.h\"\n\n#include \"base\/keyboard_codes.h\"\n#include \"chrome\/browser\/window_sizer.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/color_utils.h\"\n#include \"gfx\/path.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"views\/fill_layout.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/client_view.h\"\n#include \"views\/window\/window.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"third_party\/cros\/chromeos_wm_ipc_enums.h\"\n#endif\n\n\/\/ Background color of the bubble.\n#if defined(OS_WIN)\nconst SkColor InfoBubble::kBackgroundColor =\n color_utils::GetSysSkColor(COLOR_WINDOW);\n#else\n\/\/ TODO(beng): source from theme provider.\nconst SkColor InfoBubble::kBackgroundColor = SK_ColorWHITE;\n#endif\n\nvoid BorderContents::Init() {\n DCHECK(!bubble_border_);\n bubble_border_ = new BubbleBorder(BubbleBorder::TOP_LEFT);\n set_border(bubble_border_);\n bubble_border_->set_background_color(InfoBubble::kBackgroundColor);\n}\n\nvoid BorderContents::SizeAndGetBounds(\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool allow_bubble_offscreen,\n const gfx::Size& contents_size,\n gfx::Rect* contents_bounds,\n gfx::Rect* window_bounds) {\n if (base::i18n::IsRTL())\n arrow_location = BubbleBorder::rtl_mirror(arrow_location);\n bubble_border_->set_arrow_location(arrow_location);\n \/\/ Set the border.\n set_border(bubble_border_);\n bubble_border_->set_background_color(InfoBubble::kBackgroundColor);\n\n \/\/ Give the contents a margin.\n gfx::Size local_contents_size(contents_size);\n local_contents_size.Enlarge(kLeftMargin + kRightMargin,\n kTopMargin + kBottomMargin);\n\n \/\/ Try putting the arrow in its initial location, and calculating the bounds.\n *window_bounds =\n bubble_border_->GetBounds(position_relative_to, local_contents_size);\n\n if (!allow_bubble_offscreen) {\n \/\/ See if those bounds will fit on the monitor.\n scoped_ptr<WindowSizer::MonitorInfoProvider> monitor_provider(\n WindowSizer::CreateDefaultMonitorInfoProvider());\n gfx::Rect monitor_bounds(\n monitor_provider->GetMonitorWorkAreaMatching(position_relative_to));\n if (!monitor_bounds.IsEmpty() && !monitor_bounds.Contains(*window_bounds)) {\n \/\/ The bounds don't fit. Move the arrow to try and improve things.\n if (window_bounds->bottom() > monitor_bounds.bottom())\n arrow_location = BubbleBorder::horizontal_mirror(arrow_location);\n else if (BubbleBorder::is_arrow_on_left(arrow_location) ?\n (window_bounds->right() > monitor_bounds.right()) :\n (window_bounds->x() < monitor_bounds.x())) {\n arrow_location = BubbleBorder::rtl_mirror(arrow_location);\n }\n\n bubble_border_->set_arrow_location(arrow_location);\n\n \/\/ Now get the recalculated bounds.\n *window_bounds = bubble_border_->GetBounds(position_relative_to,\n local_contents_size);\n }\n }\n\n \/\/ Calculate the bounds of the contained contents (in window coordinates) by\n \/\/ subtracting the border dimensions and margin amounts.\n *contents_bounds = gfx::Rect(gfx::Point(), window_bounds->size());\n gfx::Insets insets;\n bubble_border_->GetInsets(&insets);\n contents_bounds->Inset(insets.left() + kLeftMargin, insets.top() + kTopMargin,\n insets.right() + kRightMargin, insets.bottom() + kBottomMargin);\n}\n\nvoid BorderContents::Paint(gfx::Canvas* canvas) {\n \/\/ The border of this view creates an anti-aliased round-rect region for the\n \/\/ contents, which we need to fill with the background color.\n \/\/ NOTE: This doesn't handle an arrow location of \"NONE\", which has square top\n \/\/ corners.\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setStyle(SkPaint::kFill_Style);\n paint.setColor(InfoBubble::kBackgroundColor);\n gfx::Path path;\n gfx::Rect bounds(GetLocalBounds(false));\n SkRect rect;\n rect.set(SkIntToScalar(bounds.x()), SkIntToScalar(bounds.y()),\n SkIntToScalar(bounds.right()), SkIntToScalar(bounds.bottom()));\n SkScalar radius = SkIntToScalar(BubbleBorder::GetCornerRadius());\n path.addRoundRect(rect, radius, radius);\n canvas->drawPath(path, paint);\n\n \/\/ Now we paint the border, so it will be alpha-blended atop the contents.\n \/\/ This looks slightly better in the corners than drawing the contents atop\n \/\/ the border.\n PaintBorder(canvas);\n}\n\n#if defined(OS_WIN)\n\/\/ BorderWidget ---------------------------------------------------------------\n\nBorderWidget::BorderWidget() : border_contents_(NULL) {\n set_delete_on_destroy(false); \/\/ Our owner will free us manually.\n set_window_style(WS_POPUP);\n set_window_ex_style(WS_EX_TOOLWINDOW | WS_EX_LAYERED);\n}\n\n\nvoid BorderWidget::Init(HWND owner) {\n DCHECK(!border_contents_);\n border_contents_ = CreateBorderContents();\n border_contents_->Init();\n WidgetWin::Init(GetAncestor(owner, GA_ROOT), gfx::Rect());\n SetContentsView(border_contents_);\n SetWindowPos(owner, 0, 0, 0, 0,\n SWP_NOSIZE | SWP_NOMOVE | SWP_NOACTIVATE | SWP_NOREDRAW);\n}\n\ngfx::Rect BorderWidget::SizeAndGetBounds(\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n const gfx::Size& contents_size) {\n \/\/ Ask the border view to calculate our bounds (and our contents').\n gfx::Rect contents_bounds;\n gfx::Rect window_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to, arrow_location,\n false, contents_size, &contents_bounds,\n &window_bounds);\n SetBounds(window_bounds);\n\n \/\/ Chop a hole out of our region to show the contents through.\n \/\/ CreateRectRgn() expects (left, top, right, bottom) in window coordinates.\n HRGN contents_region = CreateRectRgn(contents_bounds.x(), contents_bounds.y(),\n contents_bounds.right(), contents_bounds.bottom());\n HRGN window_region = CreateRectRgn(0, 0, window_bounds.width(),\n window_bounds.height());\n CombineRgn(window_region, window_region, contents_region, RGN_XOR);\n DeleteObject(contents_region);\n SetWindowRgn(window_region, true);\n\n \/\/ Return |contents_bounds| in screen coordinates.\n contents_bounds.Offset(window_bounds.origin());\n return contents_bounds;\n}\n\nBorderContents* BorderWidget::CreateBorderContents() {\n return new BorderContents();\n}\n\nLRESULT BorderWidget::OnMouseActivate(HWND window,\n UINT hit_test,\n UINT mouse_message) {\n \/\/ Never activate.\n return MA_NOACTIVATE;\n}\n#endif\n\n\/\/ InfoBubble -----------------------------------------------------------------\n\n\/\/ static\nInfoBubble* InfoBubble::Show(views::Widget* parent,\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n views::View* contents,\n InfoBubbleDelegate* delegate) {\n InfoBubble* window = new InfoBubble;\n window->Init(parent, position_relative_to, arrow_location,\n contents, delegate);\n return window;\n}\n\nvoid InfoBubble::Close() {\n Close(false);\n}\n\nInfoBubble::InfoBubble()\n :\n#if defined(OS_LINUX)\n WidgetGtk(TYPE_WINDOW),\n border_contents_(NULL),\n#endif\n delegate_(NULL),\n closed_(false) {\n}\n\nvoid InfoBubble::Init(views::Widget* parent,\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n views::View* contents,\n InfoBubbleDelegate* delegate) {\n delegate_ = delegate;\n position_relative_to_ = position_relative_to;\n arrow_location_ = arrow_location;\n contents_ = contents;\n\n \/\/ Create the main window.\n#if defined(OS_WIN)\n views::Window* parent_window = parent->GetWindow();\n if (parent_window)\n parent_window->DisableInactiveRendering();\n set_window_style(WS_POPUP | WS_CLIPCHILDREN);\n set_window_ex_style(WS_EX_TOOLWINDOW);\n WidgetWin::Init(parent->GetNativeView(), gfx::Rect());\n#elif defined(OS_LINUX)\n MakeTransparent();\n make_transient_to_parent();\n WidgetGtk::Init(\n GTK_WIDGET(static_cast<WidgetGtk*>(parent)->GetNativeView()),\n gfx::Rect());\n#if defined(OS_CHROMEOS)\n chromeos::WmIpc::instance()->SetWindowType(\n GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n#endif\n\n \/\/ Create a View to hold the contents of the main window.\n views::View* contents_view = new views::View;\n \/\/ We add |contents_view| to ourselves before the AddChildView() call below so\n \/\/ that when |contents| gets added, it will already have a widget, and thus\n \/\/ any NativeButtons it creates in ViewHierarchyChanged() will be functional\n \/\/ (e.g. calling SetChecked() on checkboxes is safe).\n SetContentsView(contents_view);\n \/\/ Adding |contents| as a child has to be done before we call\n \/\/ contents->GetPreferredSize() below, since some supplied views don't\n \/\/ actually initialize themselves until they're added to a hierarchy.\n contents_view->AddChildView(contents);\n\n \/\/ Calculate and set the bounds for all windows and views.\n gfx::Rect window_bounds;\n\n#if defined(OS_WIN)\n DCHECK(!border_.get());\n border_.reset(CreateBorderWidget());\n border_->Init(GetNativeView());\n\n \/\/ Initialize and position the border window.\n window_bounds = border_->SizeAndGetBounds(position_relative_to,\n arrow_location,\n contents->GetPreferredSize());\n\n \/\/ Make |contents| take up the entire contents view.\n contents_view->SetLayoutManager(new views::FillLayout);\n\n \/\/ Paint the background color behind the contents.\n contents_view->set_background(\n views::Background::CreateSolidBackground(kBackgroundColor));\n#else\n \/\/ Create a view to paint the border and background.\n border_contents_ = new BorderContents;\n border_contents_->Init();\n gfx::Rect contents_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to,\n arrow_location, false, contents->GetPreferredSize(),\n &contents_bounds, &window_bounds);\n \/\/ This new view must be added before |contents| so it will paint under it.\n contents_view->AddChildView(0, border_contents_);\n\n \/\/ |contents_view| has no layout manager, so we have to explicitly position\n \/\/ its children.\n border_contents_->SetBounds(gfx::Rect(gfx::Point(), window_bounds.size()));\n contents->SetBounds(contents_bounds);\n#endif\n SetBounds(window_bounds);\n\n \/\/ Register the Escape accelerator for closing.\n GetFocusManager()->RegisterAccelerator(\n views::Accelerator(base::VKEY_ESCAPE, false, false, false), this);\n\n \/\/ Done creating the bubble.\n NotificationService::current()->Notify(NotificationType::INFO_BUBBLE_CREATED,\n Source<InfoBubble>(this),\n NotificationService::NoDetails());\n\n \/\/ Show the window.\n#if defined(OS_WIN)\n border_->ShowWindow(SW_SHOW);\n ShowWindow(SW_SHOW);\n#elif defined(OS_LINUX)\n views::WidgetGtk::Show();\n#endif\n}\n\n#if defined(OS_WIN)\nBorderWidget* InfoBubble::CreateBorderWidget() {\n return new BorderWidget;\n}\n#endif\n\nvoid InfoBubble::SizeToContents() {\n gfx::Rect window_bounds;\n\n#if defined(OS_WIN)\n \/\/ Initialize and position the border window.\n window_bounds = border_->SizeAndGetBounds(position_relative_to_,\n arrow_location_,\n contents_->GetPreferredSize());\n#else\n gfx::Rect contents_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to_,\n arrow_location_, false, contents_->GetPreferredSize(),\n &contents_bounds, &window_bounds);\n \/\/ |contents_view| has no layout manager, so we have to explicitly position\n \/\/ its children.\n border_contents_->SetBounds(gfx::Rect(gfx::Point(), window_bounds.size()));\n contents_->SetBounds(contents_bounds);\n#endif\n SetBounds(window_bounds);\n}\n\n#if defined(OS_WIN)\nvoid InfoBubble::OnActivate(UINT action, BOOL minimized, HWND window) {\n \/\/ The popup should close when it is deactivated.\n if (action == WA_INACTIVE && !closed_) {\n Close();\n } else if (action == WA_ACTIVE) {\n DCHECK(GetRootView()->GetChildViewCount() > 0);\n GetRootView()->GetChildViewAt(0)->RequestFocus();\n }\n}\n#elif defined(OS_LINUX)\nvoid InfoBubble::IsActiveChanged() {\n if (!IsActive())\n Close();\n}\n#endif\n\nvoid InfoBubble::Close(bool closed_by_escape) {\n if (closed_)\n return;\n\n if (delegate_)\n delegate_->InfoBubbleClosing(this, closed_by_escape);\n closed_ = true;\n#if defined(OS_WIN)\n border_->Close();\n WidgetWin::Close();\n#elif defined(OS_LINUX)\n WidgetGtk::Close();\n#endif\n}\n\nbool InfoBubble::AcceleratorPressed(const views::Accelerator& accelerator) {\n if (!delegate_ || delegate_->CloseOnEscape()) {\n Close(true);\n return true;\n }\n return false;\n}\n<commit_msg>Fix default info_bubble arrow location for RTL.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/views\/info_bubble.h\"\n\n#include \"base\/keyboard_codes.h\"\n#include \"chrome\/browser\/window_sizer.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"gfx\/canvas.h\"\n#include \"gfx\/color_utils.h\"\n#include \"gfx\/path.h\"\n#include \"third_party\/skia\/include\/core\/SkPaint.h\"\n#include \"views\/fill_layout.h\"\n#include \"views\/widget\/root_view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/client_view.h\"\n#include \"views\/window\/window.h\"\n\n#if defined(OS_CHROMEOS)\n#include \"chrome\/browser\/chromeos\/wm_ipc.h\"\n#include \"third_party\/cros\/chromeos_wm_ipc_enums.h\"\n#endif\n\n\/\/ Background color of the bubble.\n#if defined(OS_WIN)\nconst SkColor InfoBubble::kBackgroundColor =\n color_utils::GetSysSkColor(COLOR_WINDOW);\n#else\n\/\/ TODO(beng): source from theme provider.\nconst SkColor InfoBubble::kBackgroundColor = SK_ColorWHITE;\n#endif\n\nvoid BorderContents::Init() {\n \/\/ Default arrow location.\n BubbleBorder::ArrowLocation arrow_location = BubbleBorder::TOP_LEFT;\n if (base::i18n::IsRTL())\n arrow_location = BubbleBorder::rtl_mirror(arrow_location);\n DCHECK(!bubble_border_);\n bubble_border_ = new BubbleBorder(arrow_location);\n set_border(bubble_border_);\n bubble_border_->set_background_color(InfoBubble::kBackgroundColor);\n}\n\nvoid BorderContents::SizeAndGetBounds(\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n bool allow_bubble_offscreen,\n const gfx::Size& contents_size,\n gfx::Rect* contents_bounds,\n gfx::Rect* window_bounds) {\n if (base::i18n::IsRTL())\n arrow_location = BubbleBorder::rtl_mirror(arrow_location);\n bubble_border_->set_arrow_location(arrow_location);\n \/\/ Set the border.\n set_border(bubble_border_);\n bubble_border_->set_background_color(InfoBubble::kBackgroundColor);\n\n \/\/ Give the contents a margin.\n gfx::Size local_contents_size(contents_size);\n local_contents_size.Enlarge(kLeftMargin + kRightMargin,\n kTopMargin + kBottomMargin);\n\n \/\/ Try putting the arrow in its initial location, and calculating the bounds.\n *window_bounds =\n bubble_border_->GetBounds(position_relative_to, local_contents_size);\n\n if (!allow_bubble_offscreen) {\n \/\/ See if those bounds will fit on the monitor.\n scoped_ptr<WindowSizer::MonitorInfoProvider> monitor_provider(\n WindowSizer::CreateDefaultMonitorInfoProvider());\n gfx::Rect monitor_bounds(\n monitor_provider->GetMonitorWorkAreaMatching(position_relative_to));\n if (!monitor_bounds.IsEmpty() && !monitor_bounds.Contains(*window_bounds)) {\n \/\/ The bounds don't fit. Move the arrow to try and improve things.\n if (window_bounds->bottom() > monitor_bounds.bottom())\n arrow_location = BubbleBorder::horizontal_mirror(arrow_location);\n else if (BubbleBorder::is_arrow_on_left(arrow_location) ?\n (window_bounds->right() > monitor_bounds.right()) :\n (window_bounds->x() < monitor_bounds.x())) {\n arrow_location = BubbleBorder::rtl_mirror(arrow_location);\n }\n\n bubble_border_->set_arrow_location(arrow_location);\n\n \/\/ Now get the recalculated bounds.\n *window_bounds = bubble_border_->GetBounds(position_relative_to,\n local_contents_size);\n }\n }\n\n \/\/ Calculate the bounds of the contained contents (in window coordinates) by\n \/\/ subtracting the border dimensions and margin amounts.\n *contents_bounds = gfx::Rect(gfx::Point(), window_bounds->size());\n gfx::Insets insets;\n bubble_border_->GetInsets(&insets);\n contents_bounds->Inset(insets.left() + kLeftMargin, insets.top() + kTopMargin,\n insets.right() + kRightMargin, insets.bottom() + kBottomMargin);\n}\n\nvoid BorderContents::Paint(gfx::Canvas* canvas) {\n \/\/ The border of this view creates an anti-aliased round-rect region for the\n \/\/ contents, which we need to fill with the background color.\n \/\/ NOTE: This doesn't handle an arrow location of \"NONE\", which has square top\n \/\/ corners.\n SkPaint paint;\n paint.setAntiAlias(true);\n paint.setStyle(SkPaint::kFill_Style);\n paint.setColor(InfoBubble::kBackgroundColor);\n gfx::Path path;\n gfx::Rect bounds(GetLocalBounds(false));\n SkRect rect;\n rect.set(SkIntToScalar(bounds.x()), SkIntToScalar(bounds.y()),\n SkIntToScalar(bounds.right()), SkIntToScalar(bounds.bottom()));\n SkScalar radius = SkIntToScalar(BubbleBorder::GetCornerRadius());\n path.addRoundRect(rect, radius, radius);\n canvas->drawPath(path, paint);\n\n \/\/ Now we paint the border, so it will be alpha-blended atop the contents.\n \/\/ This looks slightly better in the corners than drawing the contents atop\n \/\/ the border.\n PaintBorder(canvas);\n}\n\n#if defined(OS_WIN)\n\/\/ BorderWidget ---------------------------------------------------------------\n\nBorderWidget::BorderWidget() : border_contents_(NULL) {\n set_delete_on_destroy(false); \/\/ Our owner will free us manually.\n set_window_style(WS_POPUP);\n set_window_ex_style(WS_EX_TOOLWINDOW | WS_EX_LAYERED);\n}\n\n\nvoid BorderWidget::Init(HWND owner) {\n DCHECK(!border_contents_);\n border_contents_ = CreateBorderContents();\n border_contents_->Init();\n WidgetWin::Init(GetAncestor(owner, GA_ROOT), gfx::Rect());\n SetContentsView(border_contents_);\n SetWindowPos(owner, 0, 0, 0, 0,\n SWP_NOSIZE | SWP_NOMOVE | SWP_NOACTIVATE | SWP_NOREDRAW);\n}\n\ngfx::Rect BorderWidget::SizeAndGetBounds(\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n const gfx::Size& contents_size) {\n \/\/ Ask the border view to calculate our bounds (and our contents').\n gfx::Rect contents_bounds;\n gfx::Rect window_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to, arrow_location,\n false, contents_size, &contents_bounds,\n &window_bounds);\n SetBounds(window_bounds);\n\n \/\/ Chop a hole out of our region to show the contents through.\n \/\/ CreateRectRgn() expects (left, top, right, bottom) in window coordinates.\n HRGN contents_region = CreateRectRgn(contents_bounds.x(), contents_bounds.y(),\n contents_bounds.right(), contents_bounds.bottom());\n HRGN window_region = CreateRectRgn(0, 0, window_bounds.width(),\n window_bounds.height());\n CombineRgn(window_region, window_region, contents_region, RGN_XOR);\n DeleteObject(contents_region);\n SetWindowRgn(window_region, true);\n\n \/\/ Return |contents_bounds| in screen coordinates.\n contents_bounds.Offset(window_bounds.origin());\n return contents_bounds;\n}\n\nBorderContents* BorderWidget::CreateBorderContents() {\n return new BorderContents();\n}\n\nLRESULT BorderWidget::OnMouseActivate(HWND window,\n UINT hit_test,\n UINT mouse_message) {\n \/\/ Never activate.\n return MA_NOACTIVATE;\n}\n#endif\n\n\/\/ InfoBubble -----------------------------------------------------------------\n\n\/\/ static\nInfoBubble* InfoBubble::Show(views::Widget* parent,\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n views::View* contents,\n InfoBubbleDelegate* delegate) {\n InfoBubble* window = new InfoBubble;\n window->Init(parent, position_relative_to, arrow_location,\n contents, delegate);\n return window;\n}\n\nvoid InfoBubble::Close() {\n Close(false);\n}\n\nInfoBubble::InfoBubble()\n :\n#if defined(OS_LINUX)\n WidgetGtk(TYPE_WINDOW),\n border_contents_(NULL),\n#endif\n delegate_(NULL),\n closed_(false) {\n}\n\nvoid InfoBubble::Init(views::Widget* parent,\n const gfx::Rect& position_relative_to,\n BubbleBorder::ArrowLocation arrow_location,\n views::View* contents,\n InfoBubbleDelegate* delegate) {\n delegate_ = delegate;\n position_relative_to_ = position_relative_to;\n arrow_location_ = arrow_location;\n contents_ = contents;\n\n \/\/ Create the main window.\n#if defined(OS_WIN)\n views::Window* parent_window = parent->GetWindow();\n if (parent_window)\n parent_window->DisableInactiveRendering();\n set_window_style(WS_POPUP | WS_CLIPCHILDREN);\n set_window_ex_style(WS_EX_TOOLWINDOW);\n WidgetWin::Init(parent->GetNativeView(), gfx::Rect());\n#elif defined(OS_LINUX)\n MakeTransparent();\n make_transient_to_parent();\n WidgetGtk::Init(\n GTK_WIDGET(static_cast<WidgetGtk*>(parent)->GetNativeView()),\n gfx::Rect());\n#if defined(OS_CHROMEOS)\n chromeos::WmIpc::instance()->SetWindowType(\n GetNativeView(),\n chromeos::WM_IPC_WINDOW_CHROME_INFO_BUBBLE,\n NULL);\n#endif\n#endif\n\n \/\/ Create a View to hold the contents of the main window.\n views::View* contents_view = new views::View;\n \/\/ We add |contents_view| to ourselves before the AddChildView() call below so\n \/\/ that when |contents| gets added, it will already have a widget, and thus\n \/\/ any NativeButtons it creates in ViewHierarchyChanged() will be functional\n \/\/ (e.g. calling SetChecked() on checkboxes is safe).\n SetContentsView(contents_view);\n \/\/ Adding |contents| as a child has to be done before we call\n \/\/ contents->GetPreferredSize() below, since some supplied views don't\n \/\/ actually initialize themselves until they're added to a hierarchy.\n contents_view->AddChildView(contents);\n\n \/\/ Calculate and set the bounds for all windows and views.\n gfx::Rect window_bounds;\n\n#if defined(OS_WIN)\n DCHECK(!border_.get());\n border_.reset(CreateBorderWidget());\n border_->Init(GetNativeView());\n\n \/\/ Initialize and position the border window.\n window_bounds = border_->SizeAndGetBounds(position_relative_to,\n arrow_location,\n contents->GetPreferredSize());\n\n \/\/ Make |contents| take up the entire contents view.\n contents_view->SetLayoutManager(new views::FillLayout);\n\n \/\/ Paint the background color behind the contents.\n contents_view->set_background(\n views::Background::CreateSolidBackground(kBackgroundColor));\n#else\n \/\/ Create a view to paint the border and background.\n border_contents_ = new BorderContents;\n border_contents_->Init();\n gfx::Rect contents_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to,\n arrow_location, false, contents->GetPreferredSize(),\n &contents_bounds, &window_bounds);\n \/\/ This new view must be added before |contents| so it will paint under it.\n contents_view->AddChildView(0, border_contents_);\n\n \/\/ |contents_view| has no layout manager, so we have to explicitly position\n \/\/ its children.\n border_contents_->SetBounds(gfx::Rect(gfx::Point(), window_bounds.size()));\n contents->SetBounds(contents_bounds);\n#endif\n SetBounds(window_bounds);\n\n \/\/ Register the Escape accelerator for closing.\n GetFocusManager()->RegisterAccelerator(\n views::Accelerator(base::VKEY_ESCAPE, false, false, false), this);\n\n \/\/ Done creating the bubble.\n NotificationService::current()->Notify(NotificationType::INFO_BUBBLE_CREATED,\n Source<InfoBubble>(this),\n NotificationService::NoDetails());\n\n \/\/ Show the window.\n#if defined(OS_WIN)\n border_->ShowWindow(SW_SHOW);\n ShowWindow(SW_SHOW);\n#elif defined(OS_LINUX)\n views::WidgetGtk::Show();\n#endif\n}\n\n#if defined(OS_WIN)\nBorderWidget* InfoBubble::CreateBorderWidget() {\n return new BorderWidget;\n}\n#endif\n\nvoid InfoBubble::SizeToContents() {\n gfx::Rect window_bounds;\n\n#if defined(OS_WIN)\n \/\/ Initialize and position the border window.\n window_bounds = border_->SizeAndGetBounds(position_relative_to_,\n arrow_location_,\n contents_->GetPreferredSize());\n#else\n gfx::Rect contents_bounds;\n border_contents_->SizeAndGetBounds(position_relative_to_,\n arrow_location_, false, contents_->GetPreferredSize(),\n &contents_bounds, &window_bounds);\n \/\/ |contents_view| has no layout manager, so we have to explicitly position\n \/\/ its children.\n border_contents_->SetBounds(gfx::Rect(gfx::Point(), window_bounds.size()));\n contents_->SetBounds(contents_bounds);\n#endif\n SetBounds(window_bounds);\n}\n\n#if defined(OS_WIN)\nvoid InfoBubble::OnActivate(UINT action, BOOL minimized, HWND window) {\n \/\/ The popup should close when it is deactivated.\n if (action == WA_INACTIVE && !closed_) {\n Close();\n } else if (action == WA_ACTIVE) {\n DCHECK(GetRootView()->GetChildViewCount() > 0);\n GetRootView()->GetChildViewAt(0)->RequestFocus();\n }\n}\n#elif defined(OS_LINUX)\nvoid InfoBubble::IsActiveChanged() {\n if (!IsActive())\n Close();\n}\n#endif\n\nvoid InfoBubble::Close(bool closed_by_escape) {\n if (closed_)\n return;\n\n if (delegate_)\n delegate_->InfoBubbleClosing(this, closed_by_escape);\n closed_ = true;\n#if defined(OS_WIN)\n border_->Close();\n WidgetWin::Close();\n#elif defined(OS_LINUX)\n WidgetGtk::Close();\n#endif\n}\n\nbool InfoBubble::AcceleratorPressed(const views::Accelerator& accelerator) {\n if (!delegate_ || delegate_->CloseOnEscape()) {\n Close(true);\n return true;\n }\n return false;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <unistd.h>\n#include <sys\/epoll.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/signal.h>\n#include <sys\/prctl.h>\n#include <sys\/wait.h>\n\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/global_descriptors_posix.h\"\n#include \"base\/path_service.h\"\n#include \"base\/pickle.h\"\n#include \"base\/rand_util.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/unix_domain_socket_posix.h\"\n\n#include \"chrome\/browser\/zygote_host_linux.h\"\n#include \"chrome\/common\/chrome_descriptors.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/main_function_params.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/sandbox_methods_linux.h\"\n\n#include \"media\/base\/media.h\"\n\n#include \"skia\/ext\/SkFontHost_fontconfig_control.h\"\n\n\/\/ http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxZygote\n\nstatic const int kMagicSandboxIPCDescriptor = 5;\n\n\/\/ This is the object which implements the zygote. The ZygoteMain function,\n\/\/ which is called from ChromeMain, at the the bottom and simple constructs one\n\/\/ of these objects and runs it.\nclass Zygote {\n public:\n bool ProcessRequests() {\n \/\/ A SOCK_SEQPACKET socket is installed in fd 3. We get commands from the\n \/\/ browser on it.\n \/\/ A SOCK_DGRAM is installed in fd 4. This is the sandbox IPC channel.\n \/\/ See http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxSandboxIPC\n\n \/\/ We need to accept SIGCHLD, even though our handler is a no-op because\n \/\/ otherwise we cannot wait on children. (According to POSIX 2001.)\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIGCHLDHandler;\n CHECK(sigaction(SIGCHLD, &action, NULL) == 0);\n\n for (;;) {\n if (HandleRequestFromBrowser(3))\n return true;\n }\n }\n\n private:\n \/\/ See comment below, where sigaction is called.\n static void SIGCHLDHandler(int signal) { }\n\n \/\/ ---------------------------------------------------------------------------\n \/\/ Requests from the browser...\n\n \/\/ Read and process a request from the browser. Returns true if we are in a\n \/\/ new process and thus need to unwind back into ChromeMain.\n bool HandleRequestFromBrowser(int fd) {\n std::vector<int> fds;\n static const unsigned kMaxMessageLength = 1024;\n char buf[kMaxMessageLength];\n const ssize_t len = base::RecvMsg(fd, buf, sizeof(buf), &fds);\n if (len == -1) {\n LOG(WARNING) << \"Error reading message from browser: \" << errno;\n return false;\n }\n\n if (len == 0) {\n \/\/ EOF from the browser. We should die.\n _exit(0);\n return false;\n }\n\n Pickle pickle(buf, len);\n void* iter = NULL;\n\n int kind;\n if (pickle.ReadInt(&iter, &kind)) {\n switch (kind) {\n case ZygoteHost::kCmdFork:\n return HandleForkRequest(fd, pickle, iter, fds);\n case ZygoteHost::kCmdReap:\n if (!fds.empty())\n break;\n return HandleReapRequest(fd, pickle, iter);\n case ZygoteHost::kCmdDidProcessCrash:\n if (!fds.empty())\n break;\n return HandleDidProcessCrash(fd, pickle, iter);\n default:\n NOTREACHED();\n break;\n }\n }\n\n LOG(WARNING) << \"Error parsing message from browser\";\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n return false;\n }\n\n bool HandleReapRequest(int fd, Pickle& pickle, void* iter) {\n pid_t child;\n\n if (!pickle.ReadInt(&iter, &child)) {\n LOG(WARNING) << \"Error parsing reap request from browser\";\n return false;\n }\n\n ProcessWatcher::EnsureProcessTerminated(child);\n\n return false;\n }\n\n bool HandleDidProcessCrash(int fd, Pickle& pickle, void* iter) {\n base::ProcessHandle child;\n\n if (!pickle.ReadInt(&iter, &child)) {\n LOG(WARNING) << \"Error parsing DidProcessCrash request from browser\";\n return false;\n }\n\n bool child_exited;\n bool did_crash = base::DidProcessCrash(&child_exited, child);\n\n Pickle write_pickle;\n write_pickle.WriteBool(did_crash);\n write_pickle.WriteBool(child_exited);\n HANDLE_EINTR(write(fd, write_pickle.data(), write_pickle.size()));\n\n return false;\n }\n\n \/\/ Handle a 'fork' request from the browser: this means that the browser\n \/\/ wishes to start a new renderer.\n bool HandleForkRequest(int fd, Pickle& pickle, void* iter,\n std::vector<int>& fds) {\n std::vector<std::string> args;\n int argc, numfds;\n base::GlobalDescriptors::Mapping mapping;\n pid_t child;\n\n if (!pickle.ReadInt(&iter, &argc))\n goto error;\n\n for (int i = 0; i < argc; ++i) {\n std::string arg;\n if (!pickle.ReadString(&iter, &arg))\n goto error;\n args.push_back(arg);\n }\n\n if (!pickle.ReadInt(&iter, &numfds))\n goto error;\n if (numfds != static_cast<int>(fds.size()))\n goto error;\n\n for (int i = 0; i < numfds; ++i) {\n base::GlobalDescriptors::Key key;\n if (!pickle.ReadUInt32(&iter, &key))\n goto error;\n mapping.push_back(std::make_pair(key, fds[i]));\n }\n\n mapping.push_back(std::make_pair(\n static_cast<uint32_t>(kSandboxIPCChannel), 5));\n\n child = fork();\n\n if (!child) {\n close(3); \/\/ our socket from the browser is in fd 3\n Singleton<base::GlobalDescriptors>()->Reset(mapping);\n CommandLine::Reset();\n CommandLine::Init(args);\n return true;\n }\n\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n\n HANDLE_EINTR(write(fd, &child, sizeof(child)));\n return false;\n\n error:\n LOG(WARNING) << \"Error parsing fork request from browser\";\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n return false;\n }\n};\n\n\/\/ Patched dynamic symbol wrapper functions...\nnamespace sandbox_wrapper {\n\nvoid do_localtime(time_t input, struct tm* output, char* timezone_out,\n size_t timezone_out_len) {\n Pickle request;\n request.WriteInt(LinuxSandbox::METHOD_LOCALTIME);\n request.WriteString(\n std::string(reinterpret_cast<char*>(&input), sizeof(input)));\n\n uint8_t reply_buf[512];\n const ssize_t r = base::SendRecvMsg(\n kMagicSandboxIPCDescriptor, reply_buf, sizeof(reply_buf), NULL, request);\n if (r == -1) {\n memset(output, 0, sizeof(struct tm));\n return;\n }\n\n Pickle reply(reinterpret_cast<char*>(reply_buf), r);\n void* iter = NULL;\n std::string result, timezone;\n if (!reply.ReadString(&iter, &result) ||\n !reply.ReadString(&iter, &timezone) ||\n result.size() != sizeof(struct tm)) {\n memset(output, 0, sizeof(struct tm));\n return;\n }\n\n memcpy(output, result.data(), sizeof(struct tm));\n if (timezone_out_len) {\n const size_t copy_len = std::min(timezone_out_len - 1, timezone.size());\n memcpy(timezone_out, timezone.data(), copy_len);\n timezone_out[copy_len] = 0;\n output->tm_zone = timezone_out;\n } else {\n output->tm_zone = NULL;\n }\n}\n\nstruct tm* localtime(const time_t* timep) {\n static struct tm time_struct;\n static char timezone_string[64];\n do_localtime(*timep, &time_struct, timezone_string, sizeof(timezone_string));\n return &time_struct;\n}\n\nstruct tm* localtime_r(const time_t* timep, struct tm* result) {\n do_localtime(*timep, result, NULL, 0);\n return result;\n}\n\n} \/\/ namespace sandbox_wrapper\n\n\/* On IA-32, function calls which need to be resolved by the dynamic linker are\n * directed to the producure linking table (PLT). Each PLT entry contains code\n * which jumps (indirectly) via the global offset table (GOT):\n * Dump of assembler code for function f@plt:\n * 0x0804830c <f@plt+0>: jmp *0x804a004 # GOT indirect jump\n * 0x08048312 <f@plt+6>: push $0x8\n * 0x08048317 <f@plt+11>: jmp 0x80482ec <_init+48>\n *\n * At the beginning of a process's lifetime, the GOT entry jumps back to\n * <f@plt+6> end then enters the dynamic linker. Once the symbol has been\n * resolved, the GOT entry is patched so that future calls go directly to the\n * resolved function.\n *\n * This macro finds the PLT entry for a given symbol, |symbol|, and reads the\n * GOT entry address from the first instruction. It then patches that address\n * with the address of a replacement function, |replacement|.\n *\/\n#define PATCH_GLOBAL_OFFSET_TABLE(symbol, replacement) \\\n \/* First, get the current instruction pointer since the PLT address *\/ \\\n \/* is IP relative *\/ \\\n asm (\"call 0f\\n\" \\\n \"0: pop %%ecx\\n\" \\\n \/* Move the IP relative address of the PLT entry into EAX *\/ \\\n \"mov $\" #symbol \"@plt,%%eax\\n\" \\\n \/* Add EAX to ECX to get an absolute entry *\/ \\\n \"add %%eax,%%ecx\\n\" \\\n \/* The value in ECX was relative to the add instruction, however, *\/ \\\n \/* the IP value was that of the pop. The pop and mov take 6 *\/ \\\n \/* bytes, so adding 6 gets us the correct address for the PLT. The *\/ \\\n \/* first instruction at the PLT is FF 25 <abs address>, so we skip 2 *\/ \\\n \/* bytes to get to the address. 6 + 2 = 8: *\/ \\\n \"movl 8(%%ecx),%%ecx\\n\" \\\n \/* Now ECX contains the address of the GOT entry, we poke our *\/ \\\n \/* replacement function in there: *\/ \\\n \"movl %0,(%%ecx)\\n\" \\\n : \/* no output *\/ \\\n : \"r\" (replacement) \\\n : \"memory\", \"%eax\", \"%ecx\");\n\nstatic bool MaybeEnterChroot() {\n const char* const sandbox_fd_string = getenv(\"SBX_D\");\n if (sandbox_fd_string) {\n \/\/ The SUID sandbox sets this environment variable to a file descriptor\n \/\/ over which we can signal that we have completed our startup and can be\n \/\/ chrooted.\n\n char* endptr;\n const long fd_long = strtol(sandbox_fd_string, &endptr, 10);\n if (!*sandbox_fd_string || *endptr || fd_long < 0 || fd_long > INT_MAX)\n return false;\n const int fd = fd_long;\n\n \/\/ Before entering the sandbox, \"prime\" any systems that need to open\n \/\/ files and cache the results or the descriptors.\n base::RandUint64();\n\n base::SysInfo::MaxSharedMemorySize();\n\n \/\/ To make wcstombs\/mbstowcs work in a renderer, setlocale() has to be\n \/\/ called before the sandbox is triggered. It's possible to avoid calling\n \/\/ setlocale() by pulling out the conversion between FilePath and\n \/\/ WebCore String out of the renderer and using string16 in place of\n \/\/ FilePath for IPC.\n const char* locale = setlocale(LC_ALL, \"\");\n LOG_IF(WARNING, locale == NULL) << \"setlocale failed.\";\n\n#if defined(ARCH_CPU_X86)\n PATCH_GLOBAL_OFFSET_TABLE(localtime, sandbox_wrapper::localtime);\n PATCH_GLOBAL_OFFSET_TABLE(localtime_r, sandbox_wrapper::localtime_r);\n#endif\n\n FilePath module_path;\n if (PathService::Get(base::DIR_MODULE, &module_path))\n media::InitializeMediaLibrary(module_path);\n\n static const char kChrootMe = 'C';\n static const char kChrootMeSuccess = 'O';\n\n if (HANDLE_EINTR(write(fd, &kChrootMe, 1)) != 1) {\n LOG(ERROR) << \"Failed to write to chroot pipe: \" << errno;\n return false;\n }\n\n \/\/ We need to reap the chroot helper process in any event:\n wait(NULL);\n\n char reply;\n if (HANDLE_EINTR(read(fd, &reply, 1)) != 1) {\n LOG(ERROR) << \"Failed to read from chroot pipe: \" << errno;\n return false;\n }\n\n if (reply != kChrootMeSuccess) {\n LOG(ERROR) << \"Error code reply from chroot helper\";\n return false;\n }\n\n SkiaFontConfigUseIPCImplementation(kMagicSandboxIPCDescriptor);\n\n \/\/ Previously, we required that the binary be non-readable. This causes the\n \/\/ kernel to mark the process as non-dumpable at startup. The thinking was\n \/\/ that, although we were putting the renderers into a PID namespace (with\n \/\/ the SUID sandbox), they would nonetheless be in the \/same\/ PID\n \/\/ namespace. So they could ptrace each other unless they were non-dumpable.\n \/\/\n \/\/ If the binary was readable, then there would be a window between process\n \/\/ startup and the point where we set the non-dumpable flag in which a\n \/\/ compromised renderer could ptrace attach.\n \/\/\n \/\/ However, now that we have a zygote model, only the (trusted) zygote\n \/\/ exists at this point and we can set the non-dumpable flag which is\n \/\/ inherited by all our renderer children.\n \/\/\n \/\/ Note: a non-dumpable process can't be debugged. To debug sandbox-related\n \/\/ issues, one can specify --allow-sandbox-debugging to let the process be\n \/\/ dumpable.\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (!command_line.HasSwitch(switches::kAllowSandboxDebugging)) {\n prctl(PR_SET_DUMPABLE, 0, 0, 0, 0);\n if (prctl(PR_GET_DUMPABLE, 0, 0, 0, 0)) {\n LOG(ERROR) << \"Failed to set non-dumpable flag\";\n return false;\n }\n }\n } else {\n SkiaFontConfigUseDirectImplementation();\n }\n\n return true;\n}\n\nbool ZygoteMain(const MainFunctionParams& params) {\n if (!MaybeEnterChroot()) {\n LOG(FATAL) << \"Failed to enter sandbox. Fail safe abort. (errno: \"\n << errno << \")\";\n return false;\n }\n\n Zygote zygote;\n return zygote.ProcessRequests();\n}\n<commit_msg>Linux: don't use GOT patching to intercept localtime(_r)<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <dlfcn.h>\n#include <unistd.h>\n#include <sys\/epoll.h>\n#include <sys\/types.h>\n#include <sys\/socket.h>\n#include <sys\/signal.h>\n#include <sys\/prctl.h>\n#include <sys\/wait.h>\n\n#include \"base\/basictypes.h\"\n#include \"base\/command_line.h\"\n#include \"base\/eintr_wrapper.h\"\n#include \"base\/global_descriptors_posix.h\"\n#include \"base\/path_service.h\"\n#include \"base\/pickle.h\"\n#include \"base\/rand_util.h\"\n#include \"base\/sys_info.h\"\n#include \"base\/unix_domain_socket_posix.h\"\n\n#include \"chrome\/browser\/zygote_host_linux.h\"\n#include \"chrome\/common\/chrome_descriptors.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n#include \"chrome\/common\/main_function_params.h\"\n#include \"chrome\/common\/process_watcher.h\"\n#include \"chrome\/common\/sandbox_methods_linux.h\"\n\n#include \"media\/base\/media.h\"\n\n#include \"skia\/ext\/SkFontHost_fontconfig_control.h\"\n\n\/\/ http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxZygote\n\nstatic const int kMagicSandboxIPCDescriptor = 5;\n\n\/\/ This is the object which implements the zygote. The ZygoteMain function,\n\/\/ which is called from ChromeMain, at the the bottom and simple constructs one\n\/\/ of these objects and runs it.\nclass Zygote {\n public:\n bool ProcessRequests() {\n \/\/ A SOCK_SEQPACKET socket is installed in fd 3. We get commands from the\n \/\/ browser on it.\n \/\/ A SOCK_DGRAM is installed in fd 4. This is the sandbox IPC channel.\n \/\/ See http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxSandboxIPC\n\n \/\/ We need to accept SIGCHLD, even though our handler is a no-op because\n \/\/ otherwise we cannot wait on children. (According to POSIX 2001.)\n struct sigaction action;\n memset(&action, 0, sizeof(action));\n action.sa_handler = SIGCHLDHandler;\n CHECK(sigaction(SIGCHLD, &action, NULL) == 0);\n\n for (;;) {\n if (HandleRequestFromBrowser(3))\n return true;\n }\n }\n\n private:\n \/\/ See comment below, where sigaction is called.\n static void SIGCHLDHandler(int signal) { }\n\n \/\/ ---------------------------------------------------------------------------\n \/\/ Requests from the browser...\n\n \/\/ Read and process a request from the browser. Returns true if we are in a\n \/\/ new process and thus need to unwind back into ChromeMain.\n bool HandleRequestFromBrowser(int fd) {\n std::vector<int> fds;\n static const unsigned kMaxMessageLength = 1024;\n char buf[kMaxMessageLength];\n const ssize_t len = base::RecvMsg(fd, buf, sizeof(buf), &fds);\n if (len == -1) {\n LOG(WARNING) << \"Error reading message from browser: \" << errno;\n return false;\n }\n\n if (len == 0) {\n \/\/ EOF from the browser. We should die.\n _exit(0);\n return false;\n }\n\n Pickle pickle(buf, len);\n void* iter = NULL;\n\n int kind;\n if (pickle.ReadInt(&iter, &kind)) {\n switch (kind) {\n case ZygoteHost::kCmdFork:\n return HandleForkRequest(fd, pickle, iter, fds);\n case ZygoteHost::kCmdReap:\n if (!fds.empty())\n break;\n return HandleReapRequest(fd, pickle, iter);\n case ZygoteHost::kCmdDidProcessCrash:\n if (!fds.empty())\n break;\n return HandleDidProcessCrash(fd, pickle, iter);\n default:\n NOTREACHED();\n break;\n }\n }\n\n LOG(WARNING) << \"Error parsing message from browser\";\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n return false;\n }\n\n bool HandleReapRequest(int fd, Pickle& pickle, void* iter) {\n pid_t child;\n\n if (!pickle.ReadInt(&iter, &child)) {\n LOG(WARNING) << \"Error parsing reap request from browser\";\n return false;\n }\n\n ProcessWatcher::EnsureProcessTerminated(child);\n\n return false;\n }\n\n bool HandleDidProcessCrash(int fd, Pickle& pickle, void* iter) {\n base::ProcessHandle child;\n\n if (!pickle.ReadInt(&iter, &child)) {\n LOG(WARNING) << \"Error parsing DidProcessCrash request from browser\";\n return false;\n }\n\n bool child_exited;\n bool did_crash = base::DidProcessCrash(&child_exited, child);\n\n Pickle write_pickle;\n write_pickle.WriteBool(did_crash);\n write_pickle.WriteBool(child_exited);\n HANDLE_EINTR(write(fd, write_pickle.data(), write_pickle.size()));\n\n return false;\n }\n\n \/\/ Handle a 'fork' request from the browser: this means that the browser\n \/\/ wishes to start a new renderer.\n bool HandleForkRequest(int fd, Pickle& pickle, void* iter,\n std::vector<int>& fds) {\n std::vector<std::string> args;\n int argc, numfds;\n base::GlobalDescriptors::Mapping mapping;\n pid_t child;\n\n if (!pickle.ReadInt(&iter, &argc))\n goto error;\n\n for (int i = 0; i < argc; ++i) {\n std::string arg;\n if (!pickle.ReadString(&iter, &arg))\n goto error;\n args.push_back(arg);\n }\n\n if (!pickle.ReadInt(&iter, &numfds))\n goto error;\n if (numfds != static_cast<int>(fds.size()))\n goto error;\n\n for (int i = 0; i < numfds; ++i) {\n base::GlobalDescriptors::Key key;\n if (!pickle.ReadUInt32(&iter, &key))\n goto error;\n mapping.push_back(std::make_pair(key, fds[i]));\n }\n\n mapping.push_back(std::make_pair(\n static_cast<uint32_t>(kSandboxIPCChannel), 5));\n\n child = fork();\n\n if (!child) {\n close(3); \/\/ our socket from the browser is in fd 3\n Singleton<base::GlobalDescriptors>()->Reset(mapping);\n CommandLine::Reset();\n CommandLine::Init(args);\n return true;\n }\n\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n\n HANDLE_EINTR(write(fd, &child, sizeof(child)));\n return false;\n\n error:\n LOG(WARNING) << \"Error parsing fork request from browser\";\n for (std::vector<int>::const_iterator\n i = fds.begin(); i != fds.end(); ++i)\n close(*i);\n return false;\n }\n};\n\nstatic void ProxyLocaltimeCallToBrowser(time_t input, struct tm* output,\n char* timezone_out,\n size_t timezone_out_len) {\n Pickle request;\n request.WriteInt(LinuxSandbox::METHOD_LOCALTIME);\n request.WriteString(\n std::string(reinterpret_cast<char*>(&input), sizeof(input)));\n\n uint8_t reply_buf[512];\n const ssize_t r = base::SendRecvMsg(\n kMagicSandboxIPCDescriptor, reply_buf, sizeof(reply_buf), NULL, request);\n if (r == -1) {\n memset(output, 0, sizeof(struct tm));\n return;\n }\n\n Pickle reply(reinterpret_cast<char*>(reply_buf), r);\n void* iter = NULL;\n std::string result, timezone;\n if (!reply.ReadString(&iter, &result) ||\n !reply.ReadString(&iter, &timezone) ||\n result.size() != sizeof(struct tm)) {\n memset(output, 0, sizeof(struct tm));\n return;\n }\n\n memcpy(output, result.data(), sizeof(struct tm));\n if (timezone_out_len) {\n const size_t copy_len = std::min(timezone_out_len - 1, timezone.size());\n memcpy(timezone_out, timezone.data(), copy_len);\n timezone_out[copy_len] = 0;\n output->tm_zone = timezone_out;\n } else {\n output->tm_zone = NULL;\n }\n}\n\nstatic bool g_am_zygote_or_renderer = false;\n\n\/\/ Sandbox interception of libc calls.\n\/\/\n\/\/ Because we are running in a sandbox certain libc calls will fail (localtime\n\/\/ being the motivating example - it needs to read \/etc\/localtime). We need to\n\/\/ intercept these calls and proxy them to the browser. However, these calls\n\/\/ may come from us or from our libraries. In some cases we can't just change\n\/\/ our code.\n\/\/\n\/\/ It's for these cases that we have the following setup:\n\/\/\n\/\/ We define global functions for those functions which we wish to override.\n\/\/ Since we will be first in the dynamic resolution order, the dynamic linker\n\/\/ will point callers to our versions of these functions. However, we have the\n\/\/ same binary for both the browser and the renderers, which means that our\n\/\/ overrides will apply in the browser too.\n\/\/\n\/\/ The global |g_am_zygote_or_renderer| is true iff we are in a zygote or\n\/\/ renderer process. It's set in ZygoteMain and inherited by the renderers when\n\/\/ they fork. (This means that it'll be incorrect for global constructor\n\/\/ functions and before ZygoteMain is called - beware).\n\/\/\n\/\/ Our replacement functions can check this global and either proxy\n\/\/ the call to the browser over the sandbox IPC\n\/\/ (http:\/\/code.google.com\/p\/chromium\/wiki\/LinuxSandboxIPC) or they can use\n\/\/ dlsym with RTLD_NEXT to resolve the symbol, ignoring any symbols in the\n\/\/ current module.\n\/\/\n\/\/ Other avenues:\n\/\/\n\/\/ Our first attempt involved some assembly to patch the GOT of the current\n\/\/ module. This worked, but was platform specific and doesn't catch the case\n\/\/ where a library makes a call rather than current module.\n\/\/\n\/\/ We also considered patching the function in place, but this would again by\n\/\/ platform specific and the above technique seems to work well enough.\n\nstruct tm* localtime(const time_t* timep) {\n if (g_am_zygote_or_renderer) {\n static struct tm time_struct;\n static char timezone_string[64];\n ProxyLocaltimeCallToBrowser(*timep, &time_struct, timezone_string,\n sizeof(timezone_string));\n return &time_struct;\n } else {\n typedef struct tm* (*LocaltimeFunction)(const time_t* timep);\n static LocaltimeFunction libc_localtime;\n if (!libc_localtime)\n libc_localtime = (LocaltimeFunction) dlsym(RTLD_NEXT, \"localtime\");\n\n return libc_localtime(timep);\n }\n}\n\nstruct tm* localtime_r(const time_t* timep, struct tm* result) {\n if (g_am_zygote_or_renderer) {\n ProxyLocaltimeCallToBrowser(*timep, result, NULL, 0);\n return result;\n } else {\n typedef struct tm* (*LocaltimeRFunction)(const time_t* timep,\n struct tm* result);\n static LocaltimeRFunction libc_localtime_r;\n if (!libc_localtime_r)\n libc_localtime_r = (LocaltimeRFunction) dlsym(RTLD_NEXT, \"localtime_r\");\n\n return libc_localtime_r(timep, result);\n }\n}\n\nstatic bool MaybeEnterChroot() {\n const char* const sandbox_fd_string = getenv(\"SBX_D\");\n if (sandbox_fd_string) {\n \/\/ The SUID sandbox sets this environment variable to a file descriptor\n \/\/ over which we can signal that we have completed our startup and can be\n \/\/ chrooted.\n\n char* endptr;\n const long fd_long = strtol(sandbox_fd_string, &endptr, 10);\n if (!*sandbox_fd_string || *endptr || fd_long < 0 || fd_long > INT_MAX)\n return false;\n const int fd = fd_long;\n\n \/\/ Before entering the sandbox, \"prime\" any systems that need to open\n \/\/ files and cache the results or the descriptors.\n base::RandUint64();\n\n base::SysInfo::MaxSharedMemorySize();\n\n \/\/ To make wcstombs\/mbstowcs work in a renderer, setlocale() has to be\n \/\/ called before the sandbox is triggered. It's possible to avoid calling\n \/\/ setlocale() by pulling out the conversion between FilePath and\n \/\/ WebCore String out of the renderer and using string16 in place of\n \/\/ FilePath for IPC.\n const char* locale = setlocale(LC_ALL, \"\");\n LOG_IF(WARNING, locale == NULL) << \"setlocale failed.\";\n\n FilePath module_path;\n if (PathService::Get(base::DIR_MODULE, &module_path))\n media::InitializeMediaLibrary(module_path);\n\n static const char kChrootMe = 'C';\n static const char kChrootMeSuccess = 'O';\n\n if (HANDLE_EINTR(write(fd, &kChrootMe, 1)) != 1) {\n LOG(ERROR) << \"Failed to write to chroot pipe: \" << errno;\n return false;\n }\n\n \/\/ We need to reap the chroot helper process in any event:\n wait(NULL);\n\n char reply;\n if (HANDLE_EINTR(read(fd, &reply, 1)) != 1) {\n LOG(ERROR) << \"Failed to read from chroot pipe: \" << errno;\n return false;\n }\n\n if (reply != kChrootMeSuccess) {\n LOG(ERROR) << \"Error code reply from chroot helper\";\n return false;\n }\n\n SkiaFontConfigUseIPCImplementation(kMagicSandboxIPCDescriptor);\n\n \/\/ Previously, we required that the binary be non-readable. This causes the\n \/\/ kernel to mark the process as non-dumpable at startup. The thinking was\n \/\/ that, although we were putting the renderers into a PID namespace (with\n \/\/ the SUID sandbox), they would nonetheless be in the \/same\/ PID\n \/\/ namespace. So they could ptrace each other unless they were non-dumpable.\n \/\/\n \/\/ If the binary was readable, then there would be a window between process\n \/\/ startup and the point where we set the non-dumpable flag in which a\n \/\/ compromised renderer could ptrace attach.\n \/\/\n \/\/ However, now that we have a zygote model, only the (trusted) zygote\n \/\/ exists at this point and we can set the non-dumpable flag which is\n \/\/ inherited by all our renderer children.\n \/\/\n \/\/ Note: a non-dumpable process can't be debugged. To debug sandbox-related\n \/\/ issues, one can specify --allow-sandbox-debugging to let the process be\n \/\/ dumpable.\n const CommandLine& command_line = *CommandLine::ForCurrentProcess();\n if (!command_line.HasSwitch(switches::kAllowSandboxDebugging)) {\n prctl(PR_SET_DUMPABLE, 0, 0, 0, 0);\n if (prctl(PR_GET_DUMPABLE, 0, 0, 0, 0)) {\n LOG(ERROR) << \"Failed to set non-dumpable flag\";\n return false;\n }\n }\n } else {\n SkiaFontConfigUseDirectImplementation();\n }\n\n return true;\n}\n\nbool ZygoteMain(const MainFunctionParams& params) {\n g_am_zygote_or_renderer = true;\n\n if (!MaybeEnterChroot()) {\n LOG(FATAL) << \"Failed to enter sandbox. Fail safe abort. (errno: \"\n << errno << \")\";\n return false;\n }\n\n Zygote zygote;\n return zygote.ProcessRequests();\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <cstdint>\n#include <functional>\n#include <string>\n#include <vector>\n\n#include <lug\/Graphics\/Export.hpp>\n#include <lug\/Graphics\/Render\/Technique\/Type.hpp>\n#include <lug\/Graphics\/Resource.hpp>\n#include <lug\/Graphics\/Vulkan\/API\/Pipeline.hpp>\n\nnamespace lug {\nnamespace Graphics {\nnamespace Vulkan {\n\nclass Renderer;\n\nnamespace Render {\n\n\/**\n* @brief Class for the Vulkan pipeline, Render side.\n*\/\nclass LUG_GRAPHICS_API Pipeline : public Resource {\npublic:\n \/**\n * @brief Id of the Pipeline.\n * It's a concatenation of three parts: PrimitivePart, MaterialPart and PipelinePart\n * It allows to uniquely identify a pipeline using these characteristics.\n *\/\n struct Id {\n \/**\n * @brief Describes the primitive.\n *\/\n struct PrimitivePart {\n union {\n struct {\n uint32_t positionVertexData : 1; \/\/\/< 0 if no attribute position.\n uint32_t normalVertexData : 1; \/\/\/< 0 if no attribute normal.\n uint32_t tangentVertexData : 1; \/\/\/< 0 if no attribute tangeant.\n uint32_t countTexCoord : 2; \/\/\/< The number of texcoord (maximum 3).\n uint32_t primitiveMode : 3; \/\/\/< The primitive mode. @see Mesh::PrimitiveSet::Mode.\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n };\n\n \/**\n * @brief Describes the material. How is the material composed,\n * with textures, no textures, etc, to be used to construct unique\n * pipelines.\n *\/\n struct MaterialPart {\n union {\n struct {\n uint32_t baseColorInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t metallicRoughnessInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t normalInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t occlusionInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t emissiveInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n };\n\n union {\n struct {\n uint32_t primitivePart : 8;\n uint32_t materialPart : 10;\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n\n bool operator==(const Id& other) const {\n return value == other.value;\n }\n\n PrimitivePart getPrimitivePart() {\n PrimitivePart tmp;\n tmp.value = primitivePart;\n return tmp;\n }\n\n MaterialPart getMaterialPart() {\n MaterialPart tmp;\n tmp.value = materialPart;\n return tmp;\n }\n\n \/**\n * @brief Create a pipeline id.\n *\n * @param[in] primitivePart The primitive part. It should be created manually beforehand.\n * @param[in] materialPart The material part. It should be created manually beforehand.\n *\n * @return The created id.\n *\/\n static Id create(PrimitivePart primitivePart, MaterialPart materialPart) {\n Id id;\n\n id.primitivePart = static_cast<uint32_t>(primitivePart);\n id.materialPart = static_cast<uint32_t>(materialPart);\n\n return id;\n };\n };\n\npublic:\n class ShaderBuilder {\n public:\n enum class Type : uint8_t {\n Vertex,\n Fragment\n };\n\n public:\n ShaderBuilder() = delete;\n\n ShaderBuilder(const ShaderBuilder&) = delete;\n ShaderBuilder(ShaderBuilder&&) = delete;\n\n ShaderBuilder& operator=(const ShaderBuilder&) = delete;\n ShaderBuilder& operator=(ShaderBuilder&&) = delete;\n\n ~ShaderBuilder() = delete;\n\n public:\n static std::vector<uint32_t> buildShader(std::string shaderRoot, ::lug::Graphics::Render::Technique::Type technique, Type type, Pipeline::Id id);\n static std::vector<uint32_t> buildShaderFromFile(std::string filename, Type type, Pipeline::Id id);\n static std::vector<uint32_t> buildShaderFromString(std::string filename, std::string content, Type type, Pipeline::Id id);\n };\n\npublic:\n Pipeline(Renderer& renderer, Id id);\n\n Pipeline(const Pipeline&) = delete;\n Pipeline(Pipeline&&) = delete;\n\n Pipeline& operator=(const Pipeline&) = delete;\n Pipeline& operator=(Pipeline&&) = delete;\n\n ~Pipeline() = default;\n\n \/**\n * @brief Returns the id of the Pipeline.\n *\n * @return The id.\n *\/\n Id getId() const;\n\nprivate:\n bool init();\n\nprivate:\n static Resource::SharedPtr<Pipeline> create(Renderer& renderer, Id id);\n\nprivate:\n Renderer& _renderer;\n Id _id;\n\n API::Pipeline _pipeline;\n};\n\n#include <lug\/Graphics\/Vulkan\/Render\/Pipeline.inl>\n\n} \/\/ Render\n} \/\/ Vulkan\n} \/\/ Graphics\n} \/\/ lug\n\n\/\/ Make Pipeline Id hashable like a uint32_t\nnamespace std {\n template<> struct hash<lug::Graphics::Vulkan::Render::Pipeline::Id> {\n size_t operator()(const lug::Graphics::Vulkan::Render::Pipeline::Id& id) const {\n return hash<uint32_t>()(id.value);\n }\n };\n}\n<commit_msg>Export Pipeline::ShaderBuilder<commit_after>#pragma once\n\n#include <cstdint>\n#include <functional>\n#include <string>\n#include <vector>\n\n#include <lug\/Graphics\/Export.hpp>\n#include <lug\/Graphics\/Render\/Technique\/Type.hpp>\n#include <lug\/Graphics\/Resource.hpp>\n#include <lug\/Graphics\/Vulkan\/API\/Pipeline.hpp>\n\nnamespace lug {\nnamespace Graphics {\nnamespace Vulkan {\n\nclass Renderer;\n\nnamespace Render {\n\n\/**\n* @brief Class for the Vulkan pipeline, Render side.\n*\/\nclass LUG_GRAPHICS_API Pipeline : public Resource {\npublic:\n \/**\n * @brief Id of the Pipeline.\n * It's a concatenation of three parts: PrimitivePart, MaterialPart and PipelinePart\n * It allows to uniquely identify a pipeline using these characteristics.\n *\/\n struct Id {\n \/**\n * @brief Describes the primitive.\n *\/\n struct PrimitivePart {\n union {\n struct {\n uint32_t positionVertexData : 1; \/\/\/< 0 if no attribute position.\n uint32_t normalVertexData : 1; \/\/\/< 0 if no attribute normal.\n uint32_t tangentVertexData : 1; \/\/\/< 0 if no attribute tangeant.\n uint32_t countTexCoord : 2; \/\/\/< The number of texcoord (maximum 3).\n uint32_t primitiveMode : 3; \/\/\/< The primitive mode. @see Mesh::PrimitiveSet::Mode.\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n };\n\n \/**\n * @brief Describes the material. How is the material composed,\n * with textures, no textures, etc, to be used to construct unique\n * pipelines.\n *\/\n struct MaterialPart {\n union {\n struct {\n uint32_t baseColorInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t metallicRoughnessInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t normalInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t occlusionInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n uint32_t emissiveInfo : 2; \/\/\/< 0b00 texture with UV0, 0b01 texture with UV1, 0b10 texture with UV2, 0b11 no texture.\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n };\n\n union {\n struct {\n uint32_t primitivePart : 8;\n uint32_t materialPart : 10;\n };\n\n uint32_t value;\n };\n\n explicit operator uint32_t() {\n return value;\n }\n\n bool operator==(const Id& other) const {\n return value == other.value;\n }\n\n PrimitivePart getPrimitivePart() {\n PrimitivePart tmp;\n tmp.value = primitivePart;\n return tmp;\n }\n\n MaterialPart getMaterialPart() {\n MaterialPart tmp;\n tmp.value = materialPart;\n return tmp;\n }\n\n \/**\n * @brief Create a pipeline id.\n *\n * @param[in] primitivePart The primitive part. It should be created manually beforehand.\n * @param[in] materialPart The material part. It should be created manually beforehand.\n *\n * @return The created id.\n *\/\n static Id create(PrimitivePart primitivePart, MaterialPart materialPart) {\n Id id;\n\n id.primitivePart = static_cast<uint32_t>(primitivePart);\n id.materialPart = static_cast<uint32_t>(materialPart);\n\n return id;\n };\n };\n\npublic:\n class LUG_GRAPHICS_API ShaderBuilder {\n public:\n enum class Type : uint8_t {\n Vertex,\n Fragment\n };\n\n public:\n ShaderBuilder() = delete;\n\n ShaderBuilder(const ShaderBuilder&) = delete;\n ShaderBuilder(ShaderBuilder&&) = delete;\n\n ShaderBuilder& operator=(const ShaderBuilder&) = delete;\n ShaderBuilder& operator=(ShaderBuilder&&) = delete;\n\n ~ShaderBuilder() = delete;\n\n public:\n static std::vector<uint32_t> buildShader(std::string shaderRoot, ::lug::Graphics::Render::Technique::Type technique, Type type, Pipeline::Id id);\n static std::vector<uint32_t> buildShaderFromFile(std::string filename, Type type, Pipeline::Id id);\n static std::vector<uint32_t> buildShaderFromString(std::string filename, std::string content, Type type, Pipeline::Id id);\n };\n\npublic:\n Pipeline(Renderer& renderer, Id id);\n\n Pipeline(const Pipeline&) = delete;\n Pipeline(Pipeline&&) = delete;\n\n Pipeline& operator=(const Pipeline&) = delete;\n Pipeline& operator=(Pipeline&&) = delete;\n\n ~Pipeline() = default;\n\n \/**\n * @brief Returns the id of the Pipeline.\n *\n * @return The id.\n *\/\n Id getId() const;\n\nprivate:\n bool init();\n\nprivate:\n static Resource::SharedPtr<Pipeline> create(Renderer& renderer, Id id);\n\nprivate:\n Renderer& _renderer;\n Id _id;\n\n API::Pipeline _pipeline;\n};\n\n#include <lug\/Graphics\/Vulkan\/Render\/Pipeline.inl>\n\n} \/\/ Render\n} \/\/ Vulkan\n} \/\/ Graphics\n} \/\/ lug\n\n\/\/ Make Pipeline Id hashable like a uint32_t\nnamespace std {\n template<> struct hash<lug::Graphics::Vulkan::Render::Pipeline::Id> {\n size_t operator()(const lug::Graphics::Vulkan::Render::Pipeline::Id& id) const {\n return hash<uint32_t>()(id.value);\n }\n };\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/============================================================================\n\/\/ vSMC\/cmake\/FindOpenCL.cpp\n\/\/----------------------------------------------------------------------------\n\/\/ vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013,2014, Yan Zhou\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS AS IS\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/============================================================================\n\n#ifndef __has_attribute\n#define __has_attribute(x) 0\n#endif\n\n#ifndef __has_builtin\n#define __has_builtin(x) 0\n#endif\n\n#ifndef __has_cpp_attribute\n#define __has_cpp_attribute(x) 0\n#endif\n\n#ifndef __has_extension\n#define __has_extension(x) 0\n#endif\n\n#ifndef __has_feature\n#define __has_feature(x) 0\n#endif\n\n#include <cl.hpp>\n#include <vector>\n#include <cassert>\n\nint main ()\n{\n std::vector<cl::Platform> plat;\n cl::Platform::get(&plat);\n std::vector<cl::Device> dev;\n plat[0].getDevices(CL_DEVICE_TYPE_ALL, &dev);\n assert(dev.size() != 0);\n\n return 0;\n}\n<commit_msg>new OpenCL test files<commit_after>\/\/============================================================================\n\/\/ vSMC\/cmake\/FindOpenCL.cpp\n\/\/----------------------------------------------------------------------------\n\/\/ vSMC: Scalable Monte Carlo\n\/\/----------------------------------------------------------------------------\n\/\/ Copyright (c) 2013,2014, Yan Zhou\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS AS IS\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n\/\/============================================================================\n\n#ifndef __has_attribute\n#define __has_attribute(x) 0\n#endif\n\n#ifndef __has_builtin\n#define __has_builtin(x) 0\n#endif\n\n#ifndef __has_cpp_attribute\n#define __has_cpp_attribute(x) 0\n#endif\n\n#ifndef __has_extension\n#define __has_extension(x) 0\n#endif\n\n#ifndef __has_feature\n#define __has_feature(x) 0\n#endif\n\n#if defined(__APPLE__) || defined(__MACOSX)\n#include <OpenCL\/opencl.h>\n#else\n#include <CL\/opencl.h>\n#endif\n\n#include <cassert>\n\nint main ()\n{\n ::cl_platform_id platform;\n ::cl_device_id device;\n ::cl_uint num;\n ::cl_int status;\n status = clGetPlatformIDs(1, &platform, &num);\n assert(status == CL_SUCCESS && num != 0);\n status = clGetDeviceIDs(platform, CL_DEVICE_TYPE_ALL, 1, &device, &num);\n assert(status == CL_SUCCESS && num != 0);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"camerabinimagecapture.h\"\n#include \"camerabincapturedestination.h\"\n#include \"camerabincapturebufferformat.h\"\n#include \"camerabinsession.h\"\n#include \"qgstvideobuffer.h\"\n#include \"qvideosurfacegstsink.h\"\n#include \"qgstutils.h\"\n#include <QtCore\/QDebug>\n\n\/\/#define DEBUG_CAPTURE\n\n#ifdef Q_WS_MAEMO_5\n#define IMAGE_DONE_SIGNAL \"img-done\"\n#else\n#define IMAGE_DONE_SIGNAL \"image-done\"\n#endif\n\n\nQ_DECLARE_METATYPE(QVideoFrame)\nQ_DECLARE_METATYPE(QtMultimediaKit::MetaData)\n\nnamespace\n{\nclass CameraRegisterMetaTypes\n{\npublic:\n CameraRegisterMetaTypes()\n {\n qRegisterMetaType<QVideoFrame>(\"QVideoFrame\");\n qRegisterMetaType<QtMultimediaKit::MetaData>(\"QtMultimediaKit::MetaData\");\n }\n} _registerCameraMetaTypes;\n}\n\n\nCameraBinImageCapture::CameraBinImageCapture(CameraBinSession *session)\n :QCameraImageCaptureControl(session)\n , m_session(session)\n , m_ready(false)\n , m_requestId(0)\n , m_jpegEncoderElement(0)\n , m_metadataMuxerElement(0)\n{\n connect(m_session, SIGNAL(stateChanged(QCamera::State)), SLOT(updateState()));\n connect(m_session, SIGNAL(imageExposed(int)), this, SIGNAL(imageExposed(int)));\n connect(m_session, SIGNAL(imageCaptured(int,QImage)), this, SIGNAL(imageCaptured(int,QImage)));\n connect(m_session, SIGNAL(busMessage(QGstreamerMessage)), SLOT(handleBusMessage(QGstreamerMessage)));\n\n g_signal_connect(G_OBJECT(m_session->cameraBin()), IMAGE_DONE_SIGNAL, G_CALLBACK(handleImageSaved), this);\n}\n\nCameraBinImageCapture::~CameraBinImageCapture()\n{\n}\n\nbool CameraBinImageCapture::isReadyForCapture() const\n{\n return m_ready;\n}\n\nint CameraBinImageCapture::capture(const QString &fileName)\n{\n m_requestId++;\n#ifdef DEBUG_CAPTURE\n qDebug() << Q_FUNC_INFO << requestId << fileName;\n#endif\n m_session->captureImage(m_requestId, fileName);\n return m_requestId;\n}\n\nvoid CameraBinImageCapture::cancelCapture()\n{\n}\n\nvoid CameraBinImageCapture::updateState()\n{\n bool ready = m_session->state() == QCamera::ActiveState;\n if (m_ready != ready) {\n#ifdef DEBUG_CAPTURE\n qDebug() << \"readyForCaptureChanged\" << ready;\n#endif\n emit readyForCaptureChanged(m_ready = ready);\n }\n}\n\ngboolean CameraBinImageCapture::handleImageSaved(GstElement *camera,\n const gchar *filename,\n CameraBinImageCapture *self)\n{\n#if DEBUG_CAPTURE\n qDebug() << \"Image saved\" << filename;\n#endif\n\n Q_UNUSED(camera);\n\n if (self->m_session->captureDestinationControl()->captureDestination() & QCameraImageCapture::CaptureToFile) {\n QMetaObject::invokeMethod(self, \"imageSaved\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QString, QString::fromUtf8(filename)));\n } else {\n#ifdef DEBUG_CAPTURE\n qDebug() << Q_FUNC_INFO << \"Dropped saving file\" << filename;\n#endif\n \/\/camerabin creates an empty file when captured buffer is dropped,\n \/\/let's remove it\n QFileInfo info(QString::fromUtf8(filename));\n if (info.isFile() &&\n info.filePath().startsWith(\"\/home\") &&\n info.size() == 0) {\n QFile(info.absoluteFilePath()).remove();\n }\n }\n return true;\n}\n\ngboolean CameraBinImageCapture::uncompressedBufferProbe(GstPad *pad, GstBuffer *buffer, CameraBinImageCapture *self)\n{\n Q_UNUSED(pad);\n CameraBinSession *session = self->m_session;\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"Uncompressed buffer probe\" << gst_caps_to_string(GST_BUFFER_CAPS(buffer));\n#endif\n\n QCameraImageCapture::CaptureDestinations destination =\n session->captureDestinationControl()->captureDestination();\n QVideoFrame::PixelFormat format = session->captureBufferFormatControl()->bufferFormat();\n\n if (destination & QCameraImageCapture::CaptureToBuffer) {\n if (format != QVideoFrame::Format_Jpeg) {\n GstCaps *caps = GST_BUFFER_CAPS(buffer);\n int bytesPerLine = -1;\n QVideoSurfaceFormat format = QVideoSurfaceGstSink::formatForCaps(caps, &bytesPerLine);\n#ifdef DEBUG_CAPTURE\n qDebug() << \"imageAvailable(uncompressed):\" << format;\n#endif\n QGstVideoBuffer *videoBuffer = new QGstVideoBuffer(buffer, bytesPerLine);\n\n QVideoFrame frame(videoBuffer,\n format.frameSize(),\n format.pixelFormat());\n\n QMetaObject::invokeMethod(self, \"imageAvailable\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QVideoFrame, frame));\n }\n }\n\n \/\/keep the buffer if capture to file or jpeg buffer capture was reuqsted\n bool keepBuffer = (destination & QCameraImageCapture::CaptureToFile) ||\n ((destination & QCameraImageCapture::CaptureToBuffer) &&\n format == QVideoFrame::Format_Jpeg);\n\n return keepBuffer;\n}\n\ngboolean CameraBinImageCapture::jpegBufferProbe(GstPad *pad, GstBuffer *buffer, CameraBinImageCapture *self)\n{\n Q_UNUSED(pad);\n CameraBinSession *session = self->m_session;\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"Jpeg buffer probe\" << gst_caps_to_string(GST_BUFFER_CAPS(buffer));\n#endif\n\n QCameraImageCapture::CaptureDestinations destination =\n session->captureDestinationControl()->captureDestination();\n\n if ((destination & QCameraImageCapture::CaptureToBuffer) &&\n session->captureBufferFormatControl()->bufferFormat() == QVideoFrame::Format_Jpeg) {\n QGstVideoBuffer *videoBuffer = new QGstVideoBuffer(buffer,\n -1); \/\/bytesPerLine is not available for jpegs\n QVideoFrame frame(videoBuffer,\n QGstUtils::capsCorrectedResolution(GST_BUFFER_CAPS(buffer)),\n QVideoFrame::Format_Jpeg);\n\n QMetaObject::invokeMethod(self, \"imageAvailable\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QVideoFrame, frame));\n }\n\n \/\/drop the buffer if capture to file was disabled\n return destination & QCameraImageCapture::CaptureToFile;\n}\n\nvoid CameraBinImageCapture::handleBusMessage(const QGstreamerMessage &message)\n{\n \/\/Install buffer probes\n\n \/\/The image capture pipiline is built dynamically,\n \/\/it's necessary to wait until jpeg encoder is added to pipeline\n\n GstMessage *gm = message.rawMessage();\n if (GST_MESSAGE_TYPE(gm) == GST_MESSAGE_STATE_CHANGED) {\n GstState oldState;\n GstState newState;\n GstState pending;\n gst_message_parse_state_changed(gm, &oldState, &newState, &pending);\n\n if (newState == GST_STATE_READY) {\n GstElement *element = GST_ELEMENT(GST_MESSAGE_SRC(gm));\n if (!element)\n return;\n\n QString elementName = QString::fromLatin1(gst_element_get_name(element));\n if (elementName.contains(\"jpegenc\") && element != m_jpegEncoderElement) {\n m_jpegEncoderElement = element;\n GstPad *sinkpad = gst_element_get_static_pad(element, \"sink\");\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"install uncompressed buffer probe\";\n#endif\n gst_pad_add_buffer_probe(sinkpad,\n G_CALLBACK(CameraBinImageCapture::uncompressedBufferProbe),\n this);\n\n gst_object_unref(sinkpad);\n } else if (elementName.contains(\"jifmux\") && element != m_metadataMuxerElement) {\n \/\/Jpeg encoded buffer probe is added after jifmux\n \/\/element to ensure the resulting jpeg buffer contains capture metadata\n m_metadataMuxerElement = element;\n\n GstPad *srcpad = gst_element_get_static_pad(element, \"src\");\n#ifdef DEBUG_CAPTURE\n qDebug() << \"install jpeg buffer probe\";\n#endif\n gst_pad_add_buffer_probe(srcpad,\n G_CALLBACK(CameraBinImageCapture::jpegBufferProbe),\n this);\n gst_object_unref(srcpad);\n }\n }\n }\n}\n<commit_msg>Camera buffer capture fixes on camerabin\/desktop<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"camerabinimagecapture.h\"\n#include \"camerabincapturedestination.h\"\n#include \"camerabincapturebufferformat.h\"\n#include \"camerabinsession.h\"\n#include \"qgstvideobuffer.h\"\n#include \"qvideosurfacegstsink.h\"\n#include \"qgstutils.h\"\n#include <QtCore\/qdebug.h>\n#include <QtCore\/qbuffer.h>\n#include <QtGui\/qimagereader.h>\n\n\/\/#define DEBUG_CAPTURE\n\n#ifdef Q_WS_MAEMO_5\n#define IMAGE_DONE_SIGNAL \"img-done\"\n#else\n#define IMAGE_DONE_SIGNAL \"image-done\"\n#endif\n\n\nQ_DECLARE_METATYPE(QVideoFrame)\nQ_DECLARE_METATYPE(QtMultimediaKit::MetaData)\n\nnamespace\n{\nclass CameraRegisterMetaTypes\n{\npublic:\n CameraRegisterMetaTypes()\n {\n qRegisterMetaType<QVideoFrame>(\"QVideoFrame\");\n qRegisterMetaType<QtMultimediaKit::MetaData>(\"QtMultimediaKit::MetaData\");\n }\n} _registerCameraMetaTypes;\n}\n\n\nCameraBinImageCapture::CameraBinImageCapture(CameraBinSession *session)\n :QCameraImageCaptureControl(session)\n , m_session(session)\n , m_ready(false)\n , m_requestId(0)\n , m_jpegEncoderElement(0)\n , m_metadataMuxerElement(0)\n{\n connect(m_session, SIGNAL(stateChanged(QCamera::State)), SLOT(updateState()));\n connect(m_session, SIGNAL(imageExposed(int)), this, SIGNAL(imageExposed(int)));\n connect(m_session, SIGNAL(imageCaptured(int,QImage)), this, SIGNAL(imageCaptured(int,QImage)));\n connect(m_session, SIGNAL(busMessage(QGstreamerMessage)), SLOT(handleBusMessage(QGstreamerMessage)));\n\n g_signal_connect(G_OBJECT(m_session->cameraBin()), IMAGE_DONE_SIGNAL, G_CALLBACK(handleImageSaved), this);\n}\n\nCameraBinImageCapture::~CameraBinImageCapture()\n{\n}\n\nbool CameraBinImageCapture::isReadyForCapture() const\n{\n return m_ready;\n}\n\nint CameraBinImageCapture::capture(const QString &fileName)\n{\n m_requestId++;\n#ifdef DEBUG_CAPTURE\n qDebug() << Q_FUNC_INFO << m_requestId << fileName;\n#endif\n m_session->captureImage(m_requestId, fileName);\n return m_requestId;\n}\n\nvoid CameraBinImageCapture::cancelCapture()\n{\n}\n\nvoid CameraBinImageCapture::updateState()\n{\n bool ready = m_session->state() == QCamera::ActiveState;\n if (m_ready != ready) {\n#ifdef DEBUG_CAPTURE\n qDebug() << \"readyForCaptureChanged\" << ready;\n#endif\n emit readyForCaptureChanged(m_ready = ready);\n }\n}\n\ngboolean CameraBinImageCapture::handleImageSaved(GstElement *camera,\n const gchar *filename,\n CameraBinImageCapture *self)\n{\n#ifdef DEBUG_CAPTURE\n qDebug() << \"Image saved\" << filename;\n#endif\n\n Q_UNUSED(camera);\n\n if (self->m_session->captureDestinationControl()->captureDestination() & QCameraImageCapture::CaptureToFile) {\n QMetaObject::invokeMethod(self, \"imageSaved\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QString, QString::fromUtf8(filename)));\n } else {\n#ifdef DEBUG_CAPTURE\n qDebug() << Q_FUNC_INFO << \"Dropped saving file\" << filename;\n#endif\n \/\/camerabin creates an empty file when captured buffer is dropped,\n \/\/let's remove it\n QFileInfo info(QString::fromUtf8(filename));\n if (info.isFile() &&\n info.filePath().startsWith(\"\/home\") &&\n info.size() == 0) {\n QFile(info.absoluteFilePath()).remove();\n }\n }\n return true;\n}\n\ngboolean CameraBinImageCapture::uncompressedBufferProbe(GstPad *pad, GstBuffer *buffer, CameraBinImageCapture *self)\n{\n Q_UNUSED(pad);\n CameraBinSession *session = self->m_session;\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"Uncompressed buffer probe\" << gst_caps_to_string(GST_BUFFER_CAPS(buffer));\n#endif\n\n QCameraImageCapture::CaptureDestinations destination =\n session->captureDestinationControl()->captureDestination();\n QVideoFrame::PixelFormat format = session->captureBufferFormatControl()->bufferFormat();\n\n if (destination & QCameraImageCapture::CaptureToBuffer) {\n if (format != QVideoFrame::Format_Jpeg) {\n GstCaps *caps = GST_BUFFER_CAPS(buffer);\n int bytesPerLine = -1;\n QVideoSurfaceFormat format = QVideoSurfaceGstSink::formatForCaps(caps, &bytesPerLine);\n#ifdef DEBUG_CAPTURE\n qDebug() << \"imageAvailable(uncompressed):\" << format;\n#endif\n QGstVideoBuffer *videoBuffer = new QGstVideoBuffer(buffer, bytesPerLine);\n\n QVideoFrame frame(videoBuffer,\n format.frameSize(),\n format.pixelFormat());\n\n QMetaObject::invokeMethod(self, \"imageAvailable\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QVideoFrame, frame));\n }\n }\n\n \/\/keep the buffer if capture to file or jpeg buffer capture was reuqsted\n bool keepBuffer = (destination & QCameraImageCapture::CaptureToFile) ||\n ((destination & QCameraImageCapture::CaptureToBuffer) &&\n format == QVideoFrame::Format_Jpeg);\n\n return keepBuffer;\n}\n\ngboolean CameraBinImageCapture::jpegBufferProbe(GstPad *pad, GstBuffer *buffer, CameraBinImageCapture *self)\n{\n Q_UNUSED(pad);\n CameraBinSession *session = self->m_session;\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"Jpeg buffer probe\" << gst_caps_to_string(GST_BUFFER_CAPS(buffer));\n#endif\n\n QCameraImageCapture::CaptureDestinations destination =\n session->captureDestinationControl()->captureDestination();\n\n if ((destination & QCameraImageCapture::CaptureToBuffer) &&\n session->captureBufferFormatControl()->bufferFormat() == QVideoFrame::Format_Jpeg) {\n QGstVideoBuffer *videoBuffer = new QGstVideoBuffer(buffer,\n -1); \/\/bytesPerLine is not available for jpegs\n\n QSize resolution = QGstUtils::capsCorrectedResolution(GST_BUFFER_CAPS(buffer));\n \/\/if resolution is not presented in caps, try to find it from encoded jpeg data:\n if (resolution.isEmpty()) {\n QBuffer data;\n data.setData(reinterpret_cast<const char*>(GST_BUFFER_DATA(buffer)), GST_BUFFER_SIZE(buffer));\n QImageReader reader(&data, \"JPEG\");\n resolution = reader.size();\n }\n\n QVideoFrame frame(videoBuffer,\n resolution,\n QVideoFrame::Format_Jpeg);\n\n QMetaObject::invokeMethod(self, \"imageAvailable\",\n Qt::QueuedConnection,\n Q_ARG(int, self->m_requestId),\n Q_ARG(QVideoFrame, frame));\n }\n\n \/\/drop the buffer if capture to file was disabled\n return destination & QCameraImageCapture::CaptureToFile;\n}\n\nvoid CameraBinImageCapture::handleBusMessage(const QGstreamerMessage &message)\n{\n \/\/Install buffer probes\n\n \/\/The image capture pipiline is built dynamically,\n \/\/it's necessary to wait until jpeg encoder is added to pipeline\n\n GstMessage *gm = message.rawMessage();\n if (GST_MESSAGE_TYPE(gm) == GST_MESSAGE_STATE_CHANGED) {\n GstState oldState;\n GstState newState;\n GstState pending;\n gst_message_parse_state_changed(gm, &oldState, &newState, &pending);\n\n if (newState == GST_STATE_READY) {\n GstElement *element = GST_ELEMENT(GST_MESSAGE_SRC(gm));\n if (!element)\n return;\n\n QString elementName = QString::fromLatin1(gst_element_get_name(element));\n if (elementName.contains(\"jpegenc\") && element != m_jpegEncoderElement) {\n m_jpegEncoderElement = element;\n GstPad *sinkpad = gst_element_get_static_pad(element, \"sink\");\n\n#ifdef DEBUG_CAPTURE\n qDebug() << \"install uncompressed buffer probe\";\n#endif\n gst_pad_add_buffer_probe(sinkpad,\n G_CALLBACK(CameraBinImageCapture::uncompressedBufferProbe),\n this);\n\n gst_object_unref(sinkpad);\n } else if ((elementName.contains(\"jifmux\") || elementName.startsWith(\"metadatamux\"))\n && element != m_metadataMuxerElement) {\n \/\/Jpeg encoded buffer probe is added after jifmux\/metadatamux\n \/\/element to ensure the resulting jpeg buffer contains capture metadata\n m_metadataMuxerElement = element;\n\n GstPad *srcpad = gst_element_get_static_pad(element, \"src\");\n#ifdef DEBUG_CAPTURE\n qDebug() << \"install jpeg buffer probe\";\n#endif\n gst_pad_add_buffer_probe(srcpad,\n G_CALLBACK(CameraBinImageCapture::jpegBufferProbe),\n this);\n gst_object_unref(srcpad);\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"Runtime\/World\/CScriptBallTrigger.hpp\"\n\n#include \"Runtime\/CStateManager.hpp\"\n#include \"Runtime\/GameGlobalObjects.hpp\"\n#include \"Runtime\/World\/CMorphBall.hpp\"\n#include \"Runtime\/World\/CPlayer.hpp\"\n\n#include \"DNAMP1\/Tweaks\/CTweakPlayer.hpp\"\n\n#include \"TCastTo.hpp\" \/\/ Generated file, do not modify include path\n\nnamespace urde {\n\nstatic zeus::CAABox calculate_ball_aabox() {\n const float extent = 0.33f * g_tweakPlayer->GetPlayerBallHalfExtent();\n return {-extent, extent};\n}\n\nCScriptBallTrigger::CScriptBallTrigger(TUniqueId uid, std::string_view name, const CEntityInfo& info,\n const zeus::CVector3f& pos, const zeus::CVector3f& scale, bool active, float f1,\n float f2, float f3, const zeus::CVector3f& vec, bool b2)\n: CScriptTrigger(uid, name, info, pos, calculate_ball_aabox(), CDamageInfo(CWeaponMode::Power(), 0.f, 0.f, 0.f),\n zeus::skZero3f, ETriggerFlags::DetectMorphedPlayer, active, false, false)\n, x150_force(f1)\n, x154_minAngle(f2)\n, x158_maxDistance(f3)\n, x168_25_stopPlayer(b2) {\n\n if (vec.canBeNormalized()) {\n x15c_forceAngle = vec.normalized();\n }\n}\n\nvoid CScriptBallTrigger::Accept(IVisitor& visitor) { visitor.Visit(this); }\n\nvoid CScriptBallTrigger::AcceptScriptMsg(EScriptObjectMessage msg, TUniqueId uid, CStateManager& mgr) {\n if (msg == EScriptObjectMessage::Deactivate && GetActive()) {\n mgr.GetPlayer().GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostAvailable);\n x168_24_canApplyForce = false;\n }\n\n CScriptTrigger::AcceptScriptMsg(msg, uid, mgr);\n}\n\nvoid CScriptBallTrigger::Think(float dt, CStateManager& mgr) {\n if (!GetActive()) {\n return;\n }\n\n CScriptTrigger::Think(dt, mgr);\n CPlayer& player = mgr.GetPlayer();\n\n if (player.GetMorphballTransitionState() != CPlayer::EPlayerMorphBallState::Morphed) {\n x168_24_canApplyForce = false;\n return;\n }\n\n const float ballRadius = player.GetMorphBall()->GetBallRadius();\n const zeus::CVector3f radiusPosDif =\n (player.GetTranslation() - (player.GetTranslation() + zeus::CVector3f{0.f, 0.f, ballRadius}));\n const float distance = radiusPosDif.magnitude();\n\n if (!x168_24_canApplyForce) {\n if (distance < ballRadius) {\n x168_24_canApplyForce = true;\n } else {\n const zeus::CVector3f offset = radiusPosDif.normalized();\n if (std::cos(zeus::degToRad(x154_minAngle)) < (-offset).dot(x15c_forceAngle) && distance < x158_maxDistance) {\n const float force = zeus::min((1.f \/ dt * distance), x150_force * (distance * distance));\n player.ApplyForceWR(force * (player.GetMass() * offset), zeus::CAxisAngle());\n }\n }\n }\n\n if (x148_28_playerTriggerProc) {\n const zeus::CVector3f offset = GetTranslation() - zeus::CVector3f(0.f, 0.f, ballRadius);\n if (x168_25_stopPlayer) {\n player.Stop();\n }\n player.MoveToWR(offset, dt);\n } else {\n x168_24_canApplyForce = false;\n }\n}\n\nvoid CScriptBallTrigger::InhabitantAdded(CActor& act, CStateManager& \/*mgr*\/) {\n if (const TCastToPtr<CPlayer> player = act) {\n player->GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostDisabled);\n }\n}\n\nvoid CScriptBallTrigger::InhabitantExited(CActor& act, CStateManager&) {\n if (const TCastToPtr<CPlayer> player = act) {\n player->GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostAvailable);\n x168_24_canApplyForce = false;\n }\n}\n\n} \/\/ namespace urde\n<commit_msg>CScriptBallTrigger: Apply force fixes<commit_after>#include \"Runtime\/World\/CScriptBallTrigger.hpp\"\n\n#include \"Runtime\/CStateManager.hpp\"\n#include \"Runtime\/GameGlobalObjects.hpp\"\n#include \"Runtime\/World\/CMorphBall.hpp\"\n#include \"Runtime\/World\/CPlayer.hpp\"\n\n#include \"DNAMP1\/Tweaks\/CTweakPlayer.hpp\"\n\n#include \"TCastTo.hpp\" \/\/ Generated file, do not modify include path\n\nnamespace urde {\n\nstatic zeus::CAABox calculate_ball_aabox() {\n const float extent = 0.33f * g_tweakPlayer->GetPlayerBallHalfExtent();\n return {-extent, extent};\n}\n\nCScriptBallTrigger::CScriptBallTrigger(TUniqueId uid, std::string_view name, const CEntityInfo& info,\n const zeus::CVector3f& pos, const zeus::CVector3f& scale, bool active, float f1,\n float f2, float f3, const zeus::CVector3f& vec, bool b2)\n: CScriptTrigger(uid, name, info, pos, calculate_ball_aabox(), CDamageInfo(CWeaponMode::Power(), 0.f, 0.f, 0.f),\n zeus::skZero3f, ETriggerFlags::DetectMorphedPlayer, active, false, false)\n, x150_force(f1)\n, x154_minAngle(f2)\n, x158_maxDistance(f3)\n, x168_25_stopPlayer(b2) {\n\n if (vec.canBeNormalized()) {\n x15c_forceAngle = vec.normalized();\n }\n}\n\nvoid CScriptBallTrigger::Accept(IVisitor& visitor) { visitor.Visit(this); }\n\nvoid CScriptBallTrigger::AcceptScriptMsg(EScriptObjectMessage msg, TUniqueId uid, CStateManager& mgr) {\n if (msg == EScriptObjectMessage::Deactivate && GetActive()) {\n mgr.GetPlayer().GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostAvailable);\n x168_24_canApplyForce = false;\n }\n\n CScriptTrigger::AcceptScriptMsg(msg, uid, mgr);\n}\n\nvoid CScriptBallTrigger::Think(float dt, CStateManager& mgr) {\n if (!GetActive()) {\n return;\n }\n\n CScriptTrigger::Think(dt, mgr);\n CPlayer& player = mgr.GetPlayer();\n\n if (player.GetMorphballTransitionState() != CPlayer::EPlayerMorphBallState::Morphed) {\n x168_24_canApplyForce = false;\n return;\n }\n\n const float ballRadius = player.GetMorphBall()->GetBallRadius();\n const zeus::CVector3f radiusPosDif =\n GetTranslation() - (player.GetTranslation() + zeus::CVector3f{0.f, 0.f, ballRadius});\n const float distance = radiusPosDif.magnitude();\n\n if (!x168_24_canApplyForce) {\n if (distance < ballRadius) {\n x168_24_canApplyForce = true;\n } else {\n const zeus::CVector3f offset = radiusPosDif.normalized();\n if (std::cos(zeus::degToRad(x154_minAngle)) < (-offset).dot(x15c_forceAngle) && distance < x158_maxDistance) {\n const float force = zeus::min((1.f \/ dt * distance), x150_force * (distance * distance));\n player.ApplyForceWR(force * (player.GetMass() * offset), zeus::CAxisAngle());\n }\n }\n }\n\n if (x148_28_playerTriggerProc) {\n const zeus::CVector3f offset = GetTranslation() - zeus::CVector3f(0.f, 0.f, ballRadius);\n if (x168_25_stopPlayer) {\n player.Stop();\n }\n player.MoveToWR(offset, dt);\n }\n}\n\nvoid CScriptBallTrigger::InhabitantAdded(CActor& act, CStateManager& \/*mgr*\/) {\n if (const TCastToPtr<CPlayer> player = act) {\n player->GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostDisabled);\n }\n}\n\nvoid CScriptBallTrigger::InhabitantExited(CActor& act, CStateManager&) {\n if (const TCastToPtr<CPlayer> player = act) {\n player->GetMorphBall()->SetBallBoostState(CMorphBall::EBallBoostState::BoostAvailable);\n x168_24_canApplyForce = false;\n }\n}\n\n} \/\/ namespace urde\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016-2020 Jean-Francois Poilpret\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/*\n * This is a program to help test FastArduino I2C bus support implementation.\n * It tries to connect to a ghost device (no suchd evice on the bus) and check\n * that I2C status is correct in this situation.\n * \n * Wiring:\n * - on Arduino UNO:\n * - A4 (PC4, SDA): connected to pullup resistor (10K-22K)\n * - A5 (PC5, SCL): connected to pullup resistor (10K-22K)\n * - direct USB access (traces output)\n *\/\n\n#include <fastarduino\/array.h>\n#include <fastarduino\/i2c_device.h>\n#include <fastarduino\/uart.h>\n#include <fastarduino\/i2c_debug.h>\n\n\/\/ I2C Device specific constants go here\n\/\/======================================\nstatic constexpr const i2c::I2CMode MODE = i2c::I2CMode::FAST;\nstatic constexpr const uint8_t DEVICE_ADDRESS = 0x77 << 1;\n\nstatic constexpr const uint8_t DEBUG_SIZE = 32;\nusing DEBUGGER = i2c::debug::I2CDebugStatusRecorder<DEBUG_SIZE, DEBUG_SIZE>;\nusing MANAGER = i2c::I2CSyncStatusDebugManager<MODE, DEBUGGER&, DEBUGGER&>;\n#define DEBUG(OUT) debugger.trace(OUT, false)\n\n\/\/ Define vectors we need in the example\nREGISTER_UATX_ISR(0)\n\n\/\/ UART for traces\nstatic constexpr const uint8_t OUTPUT_BUFFER_SIZE = 64;\nstatic char output_buffer[OUTPUT_BUFFER_SIZE];\n\n\/\/ Subclass I2CDevice to make protected methods available\nclass FakeDevice: public i2c::I2CDevice<MANAGER>\n{\n\t\/\/ The following type aliases will be useful for declaring proper Futures and calling I2CDevice API\n\tusing PARENT = i2c::I2CDevice<MANAGER>;\n\ttemplate<typename T> using PROXY = typename PARENT::template PROXY<T>;\n\ttemplate<typename OUT, typename IN> using FUTURE = typename PARENT::template FUTURE<OUT, IN>;\n\npublic:\n\tFakeDevice(MANAGER& manager): PARENT{manager, DEVICE_ADDRESS, i2c::Mode<MODE>{}, true} {}\n\n\tclass WriteRegister : public FUTURE<void, containers::array<uint8_t, 2>>\n\t{\n\t\tusing PARENT = FUTURE<void, containers::array<uint8_t, 2>>;\n\tpublic:\n\t\tWriteRegister(uint8_t address, uint8_t value) : PARENT{{address, value}} {}\n\t\tWriteRegister(WriteRegister&&) = default;\n\t\tWriteRegister& operator=(WriteRegister&&) = default;\n\t};\n\n\tint write_register(PROXY<WriteRegister> future)\n\t{\n\t\treturn this->launch_commands(future, {this->write()});\n\t}\n\tbool write_register(uint8_t address, uint8_t value)\n\t{\n\t\tWriteRegister future{address, value};\n\t\tif (write_register(PARENT::make_proxy(future)) != 0) return false;\n\t\treturn (future.await() == future::FutureStatus::READY);\n\t}\n\n\tclass ReadRegister : public FUTURE<uint8_t, uint8_t>\n\t{\n\t\tusing PARENT = FUTURE<uint8_t, uint8_t>;\n\tpublic:\n\t\tReadRegister(uint8_t address) : PARENT{address} {}\n\t\tReadRegister(ReadRegister&&) = default;\n\t\tReadRegister& operator=(ReadRegister&&) = default;\n\t};\n\n\tint read_register(PROXY<ReadRegister> future)\n\t{\n\t\treturn this->launch_commands(future, {this->write(), this->read()});\n\t}\n\tbool read_register(uint8_t address, uint8_t& value)\n\t{\n\t\tReadRegister future{address};\n\t\tif (read_register(PARENT::make_proxy(future)) != 0) return false;\n\t\treturn future.get(value);\n\t}\n};\n\nusing streams::endl;\nusing streams::dec;\nusing streams::hex;\n\nint main()\n{\n\tboard::init();\n\tsei();\n\t\n\tserial::hard::UATX<board::USART::USART0> uart{output_buffer};\n\tstreams::ostream out = uart.out();\n\tuart.begin(115200);\n\tout.width(2);\n\tout << streams::boolalpha;\n\t\n\t\/\/ Start TWI interface\n\t\/\/====================\n\tDEBUGGER debugger{};\n\tMANAGER manager{debugger, debugger};\n\tmanager.begin();\n\tout << F(\"I2C interface started\") << endl;\n\t\n\tFakeDevice device{manager};\n\t\n\t\/\/ Simulate write register\n\tbool ok = device.write_register(0x35, 0x23);\n\tout << F(\"write_register() = \") << ok << endl;\n\tDEBUG(out);\n\n\t\/\/ Simulate read register\n\tuint8_t value = 0;\n\tok = device.read_register(0x35, value);\n\tout << F(\"read_register() = \") << ok << endl;\n\tout << F(\"value = \") << hex << value << endl;\n\tDEBUG(out);\n\n\t\/\/ Stop TWI interface\n\t\/\/===================\n\tmanager.end();\n\tout << F(\"End\") << endl;\n}\n<commit_msg>Add and improve example to check I2C API behavior when no device answers.<commit_after>\/\/ Copyright 2016-2020 Jean-Francois Poilpret\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n\/*\n * This is a program to help test FastArduino I2C bus support implementation.\n * It tries to connect to a ghost device (no suchd evice on the bus) and check\n * that I2C status is correct in this situation.\n * \n * Wiring:\n * - on Arduino UNO:\n * - A4 (PC4, SDA): connected to pullup resistor (10K-22K)\n * - A5 (PC5, SCL): connected to pullup resistor (10K-22K)\n * - direct USB access (traces output)\n *\/\n\n#include <fastarduino\/array.h>\n#include <fastarduino\/i2c_handler.h>\n#include <fastarduino\/i2c_device.h>\n#include <fastarduino\/i2c_debug.h>\n#include <fastarduino\/i2c_status.h>\n\n\/\/TODO adapt to allow checks also on async manager!\n\/\/TODO allow disabling debug (may impact results?)\n\/\/TODO adapt to also support ATtinyX4 (useful for testing I2C API in this context)\n#if defined(ARDUINO_UNO)\n#define HARDWARE_UART 1\n#include <fastarduino\/uart.h>\nstatic constexpr const board::USART UART = board::USART::USART0;\nstatic constexpr const uint8_t OUTPUT_BUFFER_SIZE = 64;\nstatic constexpr uint8_t I2C_BUFFER_SIZE = 32;\nstatic constexpr const uint8_t DEBUG_SIZE = 32;\n\/\/ Define vectors we need in the example\nREGISTER_UATX_ISR(0)\n#elif defined(BREADBOARD_ATTINYX4)\n#define HARDWARE_UART 0\n#include <fastarduino\/soft_uart.h>\nstatic constexpr const board::DigitalPin TX = board::DigitalPin::D8_PB0;\nstatic constexpr const uint8_t OUTPUT_BUFFER_SIZE = 64;\nstatic constexpr const uint8_t DEBUG_SIZE = 32;\n#else\n#error \"Current target is not yet supported!\"\n#endif\n\n\/\/ #define DEBUG_I2C\n\/\/ #define FORCE_SYNC\n\n#ifdef DEBUG_I2C\nusing DEBUGGER = i2c::debug::I2CDebugStatusRecorder<DEBUG_SIZE, DEBUG_SIZE>;\n#\tif I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\nusing MANAGER = i2c::I2CAsyncStatusDebugManager<\n\ti2c::I2CMode::FAST, i2c::I2CErrorPolicy::CLEAR_ALL_COMMANDS, DEBUGGER&, DEBUGGER&>;\nstatic MANAGER::I2CCOMMAND i2c_buffer[I2C_BUFFER_SIZE];\n#\telse\nusing MANAGER = i2c::I2CSyncStatusDebugManager<i2c::I2CMode::FAST, DEBUGGER&, DEBUGGER&>;\n#\tendif\n#define DEBUG(OUT) debugger.trace(OUT, false)\n#else\nusing DEBUGGER = i2c::status::I2CLatestStatusHolder;\n#\tif I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\nusing MANAGER = i2c::I2CAsyncStatusManager<\n\ti2c::I2CMode::FAST, i2c::I2CErrorPolicy::CLEAR_ALL_COMMANDS, DEBUGGER&>;\nstatic MANAGER::I2CCOMMAND i2c_buffer[I2C_BUFFER_SIZE];\n#\telse\nusing MANAGER = i2c::I2CSyncStatusManager<i2c::I2CMode::FAST, DEBUGGER&>;\n#\tendif\n#define DEBUG(OUT) OUT << streams::hex << debugger.latest_status() << streams::endl\n#endif\n\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\nREGISTER_I2C_ISR(MANAGER)\n#endif\n\n\/\/ UART buffer for traces\nstatic char output_buffer[OUTPUT_BUFFER_SIZE];\n\n\/\/ Subclass I2CDevice to make protected methods available\nstatic constexpr const uint8_t DEVICE_ADDRESS = 0x77 << 1;\nclass FakeDevice: public i2c::I2CDevice<MANAGER>\n{\n\t\/\/ The following type aliases will be useful for declaring proper Futures and calling I2CDevice API\n\tusing PARENT = i2c::I2CDevice<MANAGER>;\n\ttemplate<typename T> using PROXY = typename PARENT::template PROXY<T>;\n\ttemplate<typename OUT, typename IN> using FUTURE = typename PARENT::template FUTURE<OUT, IN>;\n\npublic:\n\tFakeDevice(MANAGER& manager): PARENT{manager, DEVICE_ADDRESS, i2c::I2C_FAST, true} {}\n\n\tclass WriteRegister : public FUTURE<void, containers::array<uint8_t, 2>>\n\t{\n\t\tusing PARENT = FUTURE<void, containers::array<uint8_t, 2>>;\n\tpublic:\n\t\tWriteRegister(uint8_t address, uint8_t value) : PARENT{{address, value}} {}\n\t\tWriteRegister(WriteRegister&&) = default;\n\t\tWriteRegister& operator=(WriteRegister&&) = default;\n\t};\n\n\tint write_register(PROXY<WriteRegister> future)\n\t{\n\t\treturn this->launch_commands(future, {this->write()});\n\t}\n\tbool write_register(uint8_t address, uint8_t value)\n\t{\n\t\tWriteRegister future{address, value};\n\t\tif (write_register(PARENT::make_proxy(future)) != 0) return false;\n\t\treturn (future.await() == future::FutureStatus::READY);\n\t}\n\n\tclass ReadRegister : public FUTURE<uint8_t, uint8_t>\n\t{\n\t\tusing PARENT = FUTURE<uint8_t, uint8_t>;\n\tpublic:\n\t\tReadRegister(uint8_t address) : PARENT{address} {}\n\t\tReadRegister(ReadRegister&&) = default;\n\t\tReadRegister& operator=(ReadRegister&&) = default;\n\t};\n\n\tint read_register(PROXY<ReadRegister> future)\n\t{\n\t\treturn this->launch_commands(future, {this->write(), this->read()});\n\t}\n\tbool read_register(uint8_t address, uint8_t& value)\n\t{\n\t\tReadRegister future{address};\n\t\tif (read_register(PARENT::make_proxy(future)) != 0) return false;\n\t\treturn future.get(value);\n\t}\n};\n\nusing streams::endl;\nusing streams::dec;\nusing streams::hex;\n\nint main()\n{\n\tboard::init();\n\tsei();\n\t\n#if HARDWARE_UART\n\tserial::hard::UATX<UART> uart{output_buffer};\n#else\n\tserial::soft::UATX<TX> uart{output_buffer};\n#endif\n\tstreams::ostream out = uart.out();\n\tuart.begin(115200);\n\tout.width(2);\n\tout << streams::boolalpha;\n\t\n\t\/\/ Start TWI interface\n\t\/\/====================\n\tDEBUGGER debugger{};\n#if I2C_TRUE_ASYNC and not defined(FORCE_SYNC)\n#\tifdef DEBUG_I2C\n\tMANAGER manager{i2c_buffer, debugger, debugger};\n#\telse\n\tMANAGER manager{i2c_buffer, debugger};\n#\tendif\n#else\n#\tifdef DEBUG_I2C\n\tMANAGER manager{debugger, debugger};\n#\telse\n\tMANAGER manager{debugger};\n#\tendif\n#endif\n\tmanager.begin();\n\tout << F(\"I2C interface started\") << endl;\n\t\n\tFakeDevice device{manager};\n\t\n\t\/\/ Simulate write register\n\tbool ok = device.write_register(0x35, 0x23);\n\tout << F(\"write_register() = \") << ok << endl;\n\tDEBUG(out);\n\n\t\/\/ Simulate read register\n\tuint8_t value = 0;\n\tok = device.read_register(0x35, value);\n\tout << F(\"read_register() = \") << ok << endl;\n\tout << F(\"value = \") << hex << value << endl;\n\tDEBUG(out);\n\n\t\/\/ Stop TWI interface\n\t\/\/===================\n\tmanager.end();\n\tout << F(\"End\") << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright 2015 Centreon\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n** See the License for the specific language governing permissions and\n** limitations under the License.\n**\n** For more information : contact@centreon.com\n*\/\n\n#include <cstdlib>\n#include <QCoreApplication>\n#include <QString>\n#include <sstream>\n#include \"com\/centreon\/broker\/json\/json_writer.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/extcmd\/command_request.hh\"\n#include \"com\/centreon\/broker\/extcmd\/command_result.hh\"\n#include \"com\/centreon\/broker\/extcmd\/json_command_parser.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::extcmd;\n\n\/**\n * Find a value or throw a exception.\n *\n * @param[in] val The key of the param to find.\n * @param[in] it A valid iterator.\n *\n * @return The value.\n *\/\nstd::string find_or_except(\n std::string const& val,\n json::json_iterator const& it) {\n json::json_iterator found = it.find_child(val);\n if (found.is_null())\n throw (exceptions::msg() << \"couldn't find '\" << val << \"'\");\n return (found.get_string());\n}\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in,out] listener Command listener.\n *\/\njson_command_parser::json_command_parser(command_listener& listener)\n : command_parser(listener) {}\n\n\/**\n * Destructor.\n *\/\njson_command_parser::~json_command_parser() {}\n\n\/**\n * Parse the string given in argument.\n *\n * @param[in] buffer The buffer to parse.\n * @param[out] res The command result.\n * @param[out] request The parsed command request. Can be null for none.\n *\n * @return The number of characters parsed succesfully, 0 for none.\n *\/\nunsigned int json_command_parser::parse(\n std::string const& buffer,\n command_result& res,\n misc::shared_ptr<command_request>& request) {\n res = command_result();\n request.clear();\n\n \/\/ Try to find a valid json snippet.\n size_t parsed = 0;\n size_t level = 0;\n try {\n for (parsed = 0; parsed < buffer.size(); ++parsed) {\n if (buffer[parsed] == '{') {\n ++level;\n break ;\n }\n else if (buffer[parsed] != ' ' && buffer[parsed] != '\\n')\n throw (exceptions::msg() << \"expected '{'\");\n }\n \/\/ Didn't find opening '{'.\n if (level == 0)\n return (0);\n for (; parsed < buffer.size(); ++parsed) {\n if (buffer[parsed] == '{')\n ++level;\n else if (buffer[parsed] == '}')\n --level;\n if (level == 0)\n break ;\n }\n \/\/ Didn't find closing '}'\n if (parsed == buffer.size())\n return (0);\n\n \/\/ Found a (hopefully) valid json snippet. Try to parse it.\n _parser.parse(buffer.substr(0, parsed + 1));\n json::json_iterator it = _parser.begin();\n std::string command_type = find_or_except(\"command_type\", it);\n if (command_type == \"status\") {\n res = _listener.command_status(\n QString::fromStdString(find_or_except(\"command_id\", it)));\n }\n else if (command_type == \"execute\") {\n request = misc::make_shared(new command_request);\n request->cmd = QString::fromStdString(find_or_except(\"command\", it));\n request->destination_id =\n QString::fromStdString(find_or_except(\"broker_id\", it)).toUInt();\n request->endp = QString::fromStdString(find_or_except(\"endpoint\", it));\n request->with_partial_result\n = it.find_child(\"with_partial_result\").get_bool();\n logging::debug(logging::high)\n << \"command: sending request \" << request->uuid << \" ('\" << request->cmd\n << \"') to endpoint '\" << request->endp\n << \"' of Centreon Broker instance \" << request->destination_id;\n _listener.write(request);\n res = _listener.command_status(request->uuid);\n }\n else {\n throw (exceptions::msg()\n << \"invalid command type: expected 'execute' or 'status' \");\n }\n } catch (std::exception const& e) {\n \/\/ At this point, command request was not written to the command\n \/\/ listener, so it not necessary to write command result either.\n res.uuid = QString();\n res.code = -1;\n res.msg = e.what();\n }\n return (parsed);\n}\n\n\/**\n * Write a command result into a string.\n *\n * @param[in] res The command result.\n *\n * @return The string.\n *\/\nstd::string json_command_parser::write(command_result const& res) {\n json::json_writer writer;\n writer.open_object();\n writer.add_key(\"command_id\");\n writer.add_string(res.uuid.toStdString());\n writer.add_key(\"command_code\");\n writer.add_number(res.code);\n writer.add_key(\"command_output\");\n writer.add_string(res.msg.toStdString());\n writer.close_object();\n return (writer.get_string());\n}\n<commit_msg>Extcmd: small fix.<commit_after>\/*\n** Copyright 2015 Centreon\n**\n** Licensed under the Apache License, Version 2.0 (the \"License\");\n** you may not use this file except in compliance with the License.\n** You may obtain a copy of the License at\n**\n** http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n**\n** Unless required by applicable law or agreed to in writing, software\n** distributed under the License is distributed on an \"AS IS\" BASIS,\n** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n** See the License for the specific language governing permissions and\n** limitations under the License.\n**\n** For more information : contact@centreon.com\n*\/\n\n#include <cstdlib>\n#include <QCoreApplication>\n#include <QString>\n#include <sstream>\n#include \"com\/centreon\/broker\/json\/json_writer.hh\"\n#include \"com\/centreon\/broker\/exceptions\/msg.hh\"\n#include \"com\/centreon\/broker\/extcmd\/command_request.hh\"\n#include \"com\/centreon\/broker\/extcmd\/command_result.hh\"\n#include \"com\/centreon\/broker\/extcmd\/json_command_parser.hh\"\n#include \"com\/centreon\/broker\/logging\/logging.hh\"\n\nusing namespace com::centreon::broker;\nusing namespace com::centreon::broker::extcmd;\n\n\/**\n * Find a value or throw a exception.\n *\n * @param[in] val The key of the param to find.\n * @param[in] it A valid iterator.\n *\n * @return The value.\n *\/\nstd::string find_or_except(\n std::string const& val,\n json::json_iterator const& it) {\n json::json_iterator found = it.find_child(val).enter_children();\n if (found.is_null())\n throw (exceptions::msg() << \"couldn't find '\" << val << \"'\");\n return (found.get_string());\n}\n\n\/**************************************\n* *\n* Public Methods *\n* *\n**************************************\/\n\n\/**\n * Constructor.\n *\n * @param[in,out] listener Command listener.\n *\/\njson_command_parser::json_command_parser(command_listener& listener)\n : command_parser(listener) {}\n\n\/**\n * Destructor.\n *\/\njson_command_parser::~json_command_parser() {}\n\n\/**\n * Parse the string given in argument.\n *\n * @param[in] buffer The buffer to parse.\n * @param[out] res The command result.\n * @param[out] request The parsed command request. Can be null for none.\n *\n * @return The number of characters parsed succesfully, 0 for none.\n *\/\nunsigned int json_command_parser::parse(\n std::string const& buffer,\n command_result& res,\n misc::shared_ptr<command_request>& request) {\n res = command_result();\n request.clear();\n\n \/\/ Try to find a valid json snippet.\n size_t parsed = 0;\n size_t level = 0;\n try {\n for (parsed = 0; parsed < buffer.size(); ++parsed) {\n if (buffer[parsed] == '{') {\n ++level;\n break ;\n }\n else if (buffer[parsed] != ' ' && buffer[parsed] != '\\n')\n throw (exceptions::msg() << \"expected '{'\");\n }\n \/\/ Didn't find opening '{'.\n if (level == 0)\n return (0);\n for (++parsed; parsed < buffer.size(); ++parsed) {\n if (buffer[parsed] == '{')\n ++level;\n else if (buffer[parsed] == '}')\n --level;\n if (level == 0)\n break ;\n }\n \/\/ Didn't find closing '}'\n if (level != 0)\n return (0);\n\n \/\/ Found a (hopefully) valid json snippet. Try to parse it.\n _parser.parse(buffer.substr(0, parsed + 1));\n json::json_iterator it = _parser.begin();\n std::string command_type = find_or_except(\"command_type\", it);\n if (command_type == \"status\") {\n res = _listener.command_status(\n QString::fromStdString(find_or_except(\"command_id\", it)));\n }\n else if (command_type == \"execute\") {\n request = misc::make_shared(new command_request);\n request->cmd = QString::fromStdString(find_or_except(\"command\", it));\n request->destination_id =\n QString::fromStdString(find_or_except(\"broker_id\", it)).toUInt();\n request->endp = QString::fromStdString(find_or_except(\"endpoint\", it));\n request->with_partial_result\n = it.find_child(\"with_partial_result\").get_bool();\n logging::debug(logging::high)\n << \"command: sending request \" << request->uuid << \" ('\" << request->cmd\n << \"') to endpoint '\" << request->endp\n << \"' of Centreon Broker instance \" << request->destination_id;\n _listener.write(request);\n res = _listener.command_status(request->uuid);\n }\n else {\n throw (exceptions::msg()\n << \"invalid command type: expected 'execute' or 'status' \");\n }\n } catch (std::exception const& e) {\n \/\/ At this point, command request was not written to the command\n \/\/ listener, so it not necessary to write command result either.\n res.uuid = QString();\n res.code = -1;\n res.msg = e.what();\n }\n return (parsed);\n}\n\n\/**\n * Write a command result into a string.\n *\n * @param[in] res The command result.\n *\n * @return The string.\n *\/\nstd::string json_command_parser::write(command_result const& res) {\n json::json_writer writer;\n writer.open_object();\n writer.add_key(\"command_id\");\n writer.add_string(res.uuid.toStdString());\n writer.add_key(\"command_code\");\n writer.add_number(res.code);\n writer.add_key(\"command_output\");\n writer.add_string(res.msg.toStdString());\n writer.close_object();\n return (writer.get_string());\n}\n<|endoftext|>"} {"text":"<commit_before>template<typename T>\nclass SkipList {\n struct SkipListNode {\n const T& _data;\n SkipListNode _next[];\n\n SkipListNode(const T& data, const int level):\n _data(data),\n _next(new SkipListNode[level+1])\n { }\n };\n\n private:\n const int _maxLevel;\n SkipListNode _head;\n\n public:\n SkipList(const int maxLevel):\n _maxLevel(maxLevel)\n {\n _head = new SkipListNode(nullptr, _maxLevel);\n SkipListNode sentinel = new SkipListNode(nullptr, maxLevel);\n for (int i = 0; i <= maxLevel; ++i) {\n _head.next[i] = sentinel;\n }\n }\n\n T find(T key) {\n SkipListNode current = _head;\n\n for(int i = _maxLevel; i >= 0; --i) {\n SkipListNode next = current.next[i];\n while (next._data < key) {\n current = next;\n next = current._next[i];\n }\n\n current = current._next[0];\n if(current.data == key) return current.data;\n else return nullptr;\n }\n }\n\n};\n<commit_msg>[skip-list] Removing a redundant file.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"mainwindow.h\"\n#include \"pagefactory.h\"\n#include \"dcppage.h\"\n#include <duideviceprofile.h>\n#include <QtDebug>\n#include \"dcpappletpage.h\"\n\nMainWindow::MainWindow():m_CurrentPage(NULL)\n{\n connect(PageFactory::instance(), SIGNAL(changePage(DcpPage*)), \n this, SLOT(appletChangePage(DcpPage*))); \n Pages::Handle handle = {Pages::MAIN, \"\"};\n changePage(handle);\n}\n\nvoid MainWindow::homeClicked()\n{\n \/*\n Pages::Handle handle = {Pages::MAIN, \"\"};\n changePage(handle);\n*\/\n onRotateClicked();\n}\n\nvoid MainWindow::backClicked()\n{\n Q_ASSERT(m_CurrentPage);\n bool change = true;\n if (m_CurrentPage->handle().id == Pages::APPLET\n || m_CurrentPage->handle().id == Pages::APPLETFROMMOSTUSED)\n change = PageFactory::instance()->backFromApplet();\n if (change)\n changePage(m_CurrentPage->referer());\n}\n\nMainWindow::~MainWindow()\n{\n}\n\nvoid\nMainWindow::changePage(Pages::Handle handle)\n{\n if (handle.id == Pages::NOPAGE)\n return;\n\n DcpPage* page = PageFactory::instance()->create(handle.id, handle.param);\n qDebug() << \"XXXX changePage\" << (void*) page;\n connect (page, SIGNAL(openSubPage(Pages::Handle)), this,\n SLOT(changePage(Pages::Handle)));\n connect(page, SIGNAL(backButtonClicked()), this, SLOT(backClicked()));\n page->appearNow(DuiSceneWindow::DestroyWhenDone);\n if (m_CurrentPage) {\n if (page->referer().id == Pages::NOPAGE)\n page->setReferer(m_CurrentPage->handle());\n }\n\n m_CurrentPage = page;\n}\n\n\nvoid MainWindow::onRotateClicked()\n{\n DuiDeviceProfile *profile = DuiDeviceProfile::instance();\n\n if ( profile->orientation() == Dui::Portrait ) {\n qDebug() << \"mode changes to Angle0\";\n profile->setOrientationAngle (DuiDeviceProfile::Angle0);\n } else {\n qDebug() << \"mode changes to Angle90\";\n profile->setOrientationAngle (DuiDeviceProfile::Angle90);\n }\n}\n\n\nvoid\nMainWindow::appletChangePage(DcpPage *page)\n{\n Q_ASSERT(page);\n m_CurrentPage = page;\n qDebug() << \"XXXX appletChangePage\" << (void*) page;\n connect(page, SIGNAL(backButtonClicked()), this, SLOT(backClicked()));\n page->appearNow(DuiSceneWindow::DestroyWhenDone);\n}\n\n<commit_msg>Restored KeepWhenDone until we find solution for the segfault<commit_after>#include \"mainwindow.h\"\n#include \"pagefactory.h\"\n#include \"dcppage.h\"\n#include <duideviceprofile.h>\n#include <QtDebug>\n#include \"dcpappletpage.h\"\n\nMainWindow::MainWindow():m_CurrentPage(NULL)\n{\n connect(PageFactory::instance(), SIGNAL(changePage(DcpPage*)), \n this, SLOT(appletChangePage(DcpPage*))); \n Pages::Handle handle = {Pages::MAIN, \"\"};\n changePage(handle);\n}\n\nvoid MainWindow::homeClicked()\n{\n \/*\n Pages::Handle handle = {Pages::MAIN, \"\"};\n changePage(handle);\n*\/\n onRotateClicked();\n}\n\nvoid MainWindow::backClicked()\n{\n Q_ASSERT(m_CurrentPage);\n bool change = true;\n if (m_CurrentPage->handle().id == Pages::APPLET\n || m_CurrentPage->handle().id == Pages::APPLETFROMMOSTUSED)\n change = PageFactory::instance()->backFromApplet();\n if (change)\n changePage(m_CurrentPage->referer());\n}\n\nMainWindow::~MainWindow()\n{\n}\n\nvoid\nMainWindow::changePage(Pages::Handle handle)\n{\n if (handle.id == Pages::NOPAGE)\n return;\n\n DcpPage* page = PageFactory::instance()->create(handle.id, handle.param);\n qDebug() << \"XXXX changePage\" << (void*) page;\n connect (page, SIGNAL(openSubPage(Pages::Handle)), this,\n SLOT(changePage(Pages::Handle)));\n connect(page, SIGNAL(backButtonClicked()), this, SLOT(backClicked()));\n\/\/ page->appearNow(DuiSceneWindow::DestroyWhenDone); TODO\n page->appearNow(DuiSceneWindow::KeepWhenDone);\n if (m_CurrentPage) {\n if (page->referer().id == Pages::NOPAGE)\n page->setReferer(m_CurrentPage->handle());\n }\n\n m_CurrentPage = page;\n}\n\n\nvoid MainWindow::onRotateClicked()\n{\n DuiDeviceProfile *profile = DuiDeviceProfile::instance();\n\n if ( profile->orientation() == Dui::Portrait ) {\n qDebug() << \"mode changes to Angle0\";\n profile->setOrientationAngle (DuiDeviceProfile::Angle0);\n } else {\n qDebug() << \"mode changes to Angle90\";\n profile->setOrientationAngle (DuiDeviceProfile::Angle90);\n }\n}\n\n\nvoid\nMainWindow::appletChangePage(DcpPage *page)\n{\n Q_ASSERT(page);\n m_CurrentPage = page;\n qDebug() << \"XXXX appletChangePage\" << (void*) page;\n connect(page, SIGNAL(backButtonClicked()), this, SLOT(backClicked()));\n\/\/ page->appearNow(DuiSceneWindow::DestroyWhenDone); TODO\n page->appearNow(DuiSceneWindow::KeepWhenDone);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\/\/ $Id$\n\/\/ Fennel is a relational database kernel.\n\/\/ Copyright (C) 1999-2004 John V. Sichi.\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public License\n\/\/ as published by the Free Software Foundation; either version 2.1\n\/\/ of the License, or (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n*\/\n\n#include \"fennel\/common\/CommonPreamble.h\"\n#include \"fennel\/ftrs\/FtrsTableWriterExecStream.h\"\n#include \"fennel\/ftrs\/FtrsTableWriterFactory.h\"\n#include \"fennel\/txn\/LogicalTxn.h\"\n#include \"fennel\/tuple\/StandardTypeDescriptor.h\"\n#include \"fennel\/exec\/ExecStreamBufAccessor.h\"\n#include \"fennel\/exec\/ExecStreamGraph.h\"\n\nFENNEL_BEGIN_CPPFILE(\"$Id$\");\n\nFtrsTableWriterExecStream::FtrsTableWriterExecStream()\n{\n pActionMutex = NULL;\n svptId = NULL_SVPT_ID;\n}\n\nvoid FtrsTableWriterExecStream::prepare(\n FtrsTableWriterExecStreamParams const ¶ms)\n{\n ConduitExecStream::prepare(params);\n pTableWriter = params.pTableWriterFactory->newTableWriter(params);\n actionType = params.actionType;\n pActionMutex = params.pActionMutex;\n assert(pActionMutex);\n}\n\nvoid FtrsTableWriterExecStream::getResourceRequirements(\n ExecStreamResourceQuantity &minQuantity,\n ExecStreamResourceQuantity &optQuantity)\n{\n ConduitExecStream::getResourceRequirements(minQuantity,optQuantity);\n \n \/\/ REVIEW: update\/delete resources\n\n \/\/ This is to account for total number of pages needed to perform an\n \/\/ update on a single index. Pages are only locked for the duration of\n \/\/ one index update, so they don't need to be charged per index (unless\n \/\/ we start parallelizing index updates). REVIEW: determine the correct\n \/\/ number; 4 is just a guess.\n minQuantity.nCachePages += 4;\n\n \/\/ each BTreeWriter currently needs a private scratch page\n minQuantity.nCachePages += pTableWriter->getIndexCount();\n \n optQuantity = minQuantity;\n}\n\nvoid FtrsTableWriterExecStream::open(bool restart)\n{\n ConduitExecStream::open(restart);\n assert(pGraph->getTxn());\n \/\/ REVIEW: close\/restart?\n pGraph->getTxn()->addParticipant(pTableWriter);\n nTuples = 0;\n pTableWriter->openIndexWriters();\n isDone = false;\n}\n\nExecStreamResult FtrsTableWriterExecStream::execute(\n ExecStreamQuantum const &quantum)\n{\n if (isDone) {\n \/\/ already returned final result\n pOutAccessor->markEOS();\n return EXECRC_EOS;\n }\n \n if (pInAccessor->getState() == EXECBUF_EOS) {\n \/\/ we've processed all input, so commit what we've written\n \/\/ and return row count as our output\n commitSavepoint();\n \/\/ REVIEW: The format for a 1-tuple with a single non-null uint64_t\n \/\/ value is just the value itself (assuming alignment size no greater\n \/\/ than 64-bit), which is why this works. But it would be cleaner to\n \/\/ set up a proper TupleAccessor.\n pOutAccessor->provideBufferForConsumption(\n reinterpret_cast<PConstBuffer>(&nTuples), \n reinterpret_cast<PConstBuffer>((&nTuples) + 1));\n isDone = true;\n return EXECRC_BUF_OVERFLOW;\n }\n\n ExecStreamResult rc = precheckConduitBuffers();\n if (rc != EXECRC_YIELD) {\n return rc;\n }\n\n if (svptId == NULL_SVPT_ID) {\n createSavepoint();\n }\n\n try {\n nTuples += pTableWriter->execute(\n quantum, *pInAccessor, actionType, *pActionMutex);\n } catch (...) {\n try {\n rollbackSavepoint();\n } catch (...) {\n \/\/ TODO: trace failed rollback\n }\n throw;\n }\n\n if (!pInAccessor->isConsumptionPossible()) {\n return EXECRC_BUF_UNDERFLOW;\n } else {\n return EXECRC_QUANTUM_EXPIRED;\n }\n}\n\nExecStreamBufProvision\n FtrsTableWriterExecStream::getOutputBufProvision() const\n{\n return BUFPROV_PRODUCER;\n}\n\nvoid FtrsTableWriterExecStream::closeImpl()\n{\n if (svptId != NULL_SVPT_ID) {\n rollbackSavepoint();\n }\n ConduitExecStream::closeImpl();\n if (pTableWriter) {\n pTableWriter->closeIndexWriters();\n }\n}\n\nvoid FtrsTableWriterExecStream::createSavepoint()\n{\n \/\/ block checkpoints while creating savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n svptId = pGraph->getTxn()->createSavepoint();\n}\n\nvoid FtrsTableWriterExecStream::commitSavepoint()\n{\n SavepointId svptIdCopy = svptId;\n svptId = NULL_SVPT_ID;\n \n \/\/ block checkpoints while committing savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n pGraph->getTxn()->commitSavepoint(svptIdCopy);\n}\n\nvoid FtrsTableWriterExecStream::rollbackSavepoint()\n{\n SavepointId svptIdCopy = svptId;\n svptId = NULL_SVPT_ID;\n \n \/\/ block checkpoints while rolling back savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n pGraph->getTxn()->rollback(&svptIdCopy);\n pGraph->getTxn()->commitSavepoint(svptIdCopy);\n}\n\nFENNEL_END_CPPFILE(\"$Id$\");\n\n\/\/ End FtrsTableWriterExecStream.cpp\n<commit_msg>FENNEL: fix savepoint bug with empty DML<commit_after>\/*\n\/\/ $Id$\n\/\/ Fennel is a relational database kernel.\n\/\/ Copyright (C) 1999-2004 John V. Sichi.\n\/\/\n\/\/ This program is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public License\n\/\/ as published by the Free Software Foundation; either version 2.1\n\/\/ of the License, or (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public License\n\/\/ along with this program; if not, write to the Free Software\n\/\/ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.\n*\/\n\n#include \"fennel\/common\/CommonPreamble.h\"\n#include \"fennel\/ftrs\/FtrsTableWriterExecStream.h\"\n#include \"fennel\/ftrs\/FtrsTableWriterFactory.h\"\n#include \"fennel\/txn\/LogicalTxn.h\"\n#include \"fennel\/tuple\/StandardTypeDescriptor.h\"\n#include \"fennel\/exec\/ExecStreamBufAccessor.h\"\n#include \"fennel\/exec\/ExecStreamGraph.h\"\n\nFENNEL_BEGIN_CPPFILE(\"$Id$\");\n\nFtrsTableWriterExecStream::FtrsTableWriterExecStream()\n{\n pActionMutex = NULL;\n svptId = NULL_SVPT_ID;\n}\n\nvoid FtrsTableWriterExecStream::prepare(\n FtrsTableWriterExecStreamParams const ¶ms)\n{\n ConduitExecStream::prepare(params);\n pTableWriter = params.pTableWriterFactory->newTableWriter(params);\n actionType = params.actionType;\n pActionMutex = params.pActionMutex;\n assert(pActionMutex);\n}\n\nvoid FtrsTableWriterExecStream::getResourceRequirements(\n ExecStreamResourceQuantity &minQuantity,\n ExecStreamResourceQuantity &optQuantity)\n{\n ConduitExecStream::getResourceRequirements(minQuantity,optQuantity);\n \n \/\/ REVIEW: update\/delete resources\n\n \/\/ This is to account for total number of pages needed to perform an\n \/\/ update on a single index. Pages are only locked for the duration of\n \/\/ one index update, so they don't need to be charged per index (unless\n \/\/ we start parallelizing index updates). REVIEW: determine the correct\n \/\/ number; 4 is just a guess.\n minQuantity.nCachePages += 4;\n\n \/\/ each BTreeWriter currently needs a private scratch page\n minQuantity.nCachePages += pTableWriter->getIndexCount();\n \n optQuantity = minQuantity;\n}\n\nvoid FtrsTableWriterExecStream::open(bool restart)\n{\n ConduitExecStream::open(restart);\n assert(pGraph->getTxn());\n \/\/ REVIEW: close\/restart?\n pGraph->getTxn()->addParticipant(pTableWriter);\n nTuples = 0;\n pTableWriter->openIndexWriters();\n isDone = false;\n}\n\nExecStreamResult FtrsTableWriterExecStream::execute(\n ExecStreamQuantum const &quantum)\n{\n if (isDone) {\n \/\/ already returned final result\n pOutAccessor->markEOS();\n return EXECRC_EOS;\n }\n \n if (pInAccessor->getState() == EXECBUF_EOS) {\n \/\/ we've processed all input, so commit what we've written\n \/\/ and return row count as our output\n commitSavepoint();\n \/\/ REVIEW: The format for a 1-tuple with a single non-null uint64_t\n \/\/ value is just the value itself (assuming alignment size no greater\n \/\/ than 64-bit), which is why this works. But it would be cleaner to\n \/\/ set up a proper TupleAccessor.\n pOutAccessor->provideBufferForConsumption(\n reinterpret_cast<PConstBuffer>(&nTuples), \n reinterpret_cast<PConstBuffer>((&nTuples) + 1));\n isDone = true;\n return EXECRC_BUF_OVERFLOW;\n }\n\n ExecStreamResult rc = precheckConduitBuffers();\n if (rc != EXECRC_YIELD) {\n return rc;\n }\n\n if (svptId == NULL_SVPT_ID) {\n createSavepoint();\n }\n\n try {\n nTuples += pTableWriter->execute(\n quantum, *pInAccessor, actionType, *pActionMutex);\n } catch (...) {\n try {\n rollbackSavepoint();\n } catch (...) {\n \/\/ TODO: trace failed rollback\n }\n throw;\n }\n\n if (!pInAccessor->isConsumptionPossible()) {\n return EXECRC_BUF_UNDERFLOW;\n } else {\n return EXECRC_QUANTUM_EXPIRED;\n }\n}\n\nExecStreamBufProvision\n FtrsTableWriterExecStream::getOutputBufProvision() const\n{\n return BUFPROV_PRODUCER;\n}\n\nvoid FtrsTableWriterExecStream::closeImpl()\n{\n if (svptId != NULL_SVPT_ID) {\n rollbackSavepoint();\n }\n ConduitExecStream::closeImpl();\n if (pTableWriter) {\n pTableWriter->closeIndexWriters();\n }\n}\n\nvoid FtrsTableWriterExecStream::createSavepoint()\n{\n \/\/ block checkpoints while creating savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n svptId = pGraph->getTxn()->createSavepoint();\n}\n\nvoid FtrsTableWriterExecStream::commitSavepoint()\n{\n if (svptId == NULL_SVPT_ID) {\n return;\n }\n \n SavepointId svptIdCopy = svptId;\n svptId = NULL_SVPT_ID;\n \n \/\/ block checkpoints while committing savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n pGraph->getTxn()->commitSavepoint(svptIdCopy);\n}\n\nvoid FtrsTableWriterExecStream::rollbackSavepoint()\n{\n if (svptId == NULL_SVPT_ID) {\n return;\n }\n \n SavepointId svptIdCopy = svptId;\n svptId = NULL_SVPT_ID;\n \n \/\/ block checkpoints while rolling back savepoint\n SXMutexSharedGuard actionMutexGuard(*pActionMutex);\n pGraph->getTxn()->rollback(&svptIdCopy);\n pGraph->getTxn()->commitSavepoint(svptIdCopy);\n}\n\nFENNEL_END_CPPFILE(\"$Id$\");\n\n\/\/ End FtrsTableWriterExecStream.cpp\n<|endoftext|>"} {"text":"<commit_before> \r\n\/\/snippet-sourcedescription:[get_item.cpp demonstrates how to retrieve an item from an Amazon DynamoDB table.]\r\n\/\/snippet-keyword:[C++]\r\n\/\/snippet-keyword:[Code Sample]\r\n\/\/snippet-keyword:[Amazon DynamoDB]\r\n\/\/snippet-service:[dynamodb]\r\n\/\/snippet-sourcetype:[full-example]\r\n\/\/snippet-sourcedate:[]\r\n\/\/snippet-sourceauthor:[AWS]\r\n\r\n\r\n\/*\r\nCopyright 2010-2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.\r\n\r\nThis file is licensed under the Apache License, Version 2.0 (the \"License\").\r\nYou may not use this file except in compliance with the License. A copy of\r\nthe License is located at\r\n\r\nhttp:\/\/aws.amazon.com\/apache2.0\/\r\n\r\nThis file is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\r\nCONDITIONS OF ANY KIND, either express or implied. See the License for the\r\nspecific language governing permissions and limitations under the License.\r\n*\/\r\n\/\/snippet-start:[dynamodb.cpp.get_item.inc]\r\n#include <aws\/core\/Aws.h>\r\n#include <aws\/core\/utils\/Outcome.h> \r\n#include <aws\/dynamodb\/DynamoDBClient.h>\r\n#include <aws\/dynamodb\/model\/AttributeDefinition.h>\r\n#include <aws\/dynamodb\/model\/GetItemRequest.h>\r\n#include <iostream>\r\n\/\/snippet-end:[dynamodb.cpp.get_item.inc]\r\n\r\n\r\n\/**\r\n* Get an item from a DynamoDB table.\r\n*\r\n* Takes the name of the table and the name of the item to retrieve from it.\r\n*\r\n* The primary key searched is \"Name\", and the value contained by the field\r\n* \"Greeting\" will be returned.\r\n*\r\n* This code expects that you have AWS credentials set up per:\r\n* http:\/\/docs.aws.amazon.com\/sdk-for-cpp\/v1\/developer-guide\/credentials.html\r\n*\/\r\nint main(int argc, char** argv)\r\n{\r\n const std::string USAGE = \"\\n\" \\\r\n \"Usage:\\n\"\r\n \" get_item <table> <name> [projection_expression]\\n\\n\"\r\n \"Where:\\n\"\r\n \" table - the table to get an item from.\\n\"\r\n \" name - the item to get.\\n\\n\"\r\n \"You can add an optional projection expression (a quote-delimited,\\n\"\r\n \"comma-separated list of attributes to retrieve) to limit the\\n\"\r\n \"fields returned from the table.\\n\\n\"\r\n \"Example:\\n\"\r\n \" get_item HelloTable World\\n\"\r\n \" get_item SiteColors text \\\"default, bold\\\"\\n\";\r\n\r\n if (argc < 2)\r\n {\r\n std::cout << USAGE;\r\n return 1;\r\n }\r\n\r\n Aws::SDKOptions options;\r\n\r\n Aws::InitAPI(options);\r\n {\r\n const Aws::String table(argv[1]);\r\n const Aws::String name(argv[2]);\r\n const Aws::String projection(argc > 3 ? argv[3] : \"\");\r\n\r\n \/\/ snippet-start:[dynamodb.cpp.get_item.code]\r\n Aws::Client::ClientConfiguration clientConfig;\r\n Aws::DynamoDB::DynamoDBClient dynamoClient(clientConfig);\r\n\r\n Aws::DynamoDB::Model::GetItemRequest req;\r\n\r\n if (!projection.empty())\r\n req.SetProjectionExpression(projection);\r\n\r\n Aws::DynamoDB::Model::AttributeValue haskKey;\r\n haskKey.SetS(name);\r\n req.AddKey(\"Name\", haskKey);\r\n\r\n req.SetTableName(table);\r\n\r\n const Aws::DynamoDB::Model::GetItemOutcome& result = dynamoClient.GetItem(req);\r\n if (result.IsSuccess())\r\n {\r\n const Aws::Map<Aws::String, Aws::DynamoDB::Model::AttributeValue>& item = result.GetResult().GetItem();\r\n if (item.size() > 0)\r\n {\r\n for (const auto& i : item)\r\n std::cout << i.first << \": \" << i.second.GetS() << std::endl;\r\n }\r\n else\r\n {\r\n std::cout << \"No item found with the key \" << name << std::endl;\r\n }\r\n\r\n }\r\n else\r\n {\r\n std::cout << \"Failed to get item: \" << result.GetError().GetMessage();\r\n }\r\n \/\/ snippet-end:[dynamodb.cpp.get_item.code]\r\n }\r\n Aws::ShutdownAPI(options);\r\n return 0;\r\n}<commit_msg>Repair and polish C++ DynamoDB get_item<commit_after> \r\n\/\/snippet-sourcedescription:[get_item.cpp demonstrates how to retrieve an item from an Amazon DynamoDB table.]\r\n\/\/snippet-service:[dynamodb]\r\n\/\/snippet-keyword:[Amazon DynamoDB]\r\n\/\/snippet-keyword:[C++]\r\n\/\/snippet-keyword:[Code Sample]\r\n\/\/snippet-sourcetype:[full-example]\r\n\/\/snippet-sourcedate:[2019-04-09]\r\n\/\/snippet-sourceauthor:[AWS]\r\n\r\n\/*\r\nCopyright 2010-2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.\r\n\r\nThis file is licensed under the Apache License, Version 2.0 (the \"License\").\r\nYou may not use this file except in compliance with the License. A copy of\r\nthe License is located at\r\n\r\nhttp:\/\/aws.amazon.com\/apache2.0\/\r\n\r\nThis file is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR\r\nCONDITIONS OF ANY KIND, either express or implied. See the License for the\r\nspecific language governing permissions and limitations under the License.\r\n*\/\r\n\r\n\/\/snippet-start:[dynamodb.cpp.get_item.inc]\r\n#include <aws\/core\/Aws.h>\r\n#include <aws\/core\/utils\/Outcome.h> \r\n#include <aws\/dynamodb\/DynamoDBClient.h>\r\n#include <aws\/dynamodb\/model\/AttributeDefinition.h>\r\n#include <aws\/dynamodb\/model\/GetItemRequest.h>\r\n#include <iostream>\r\n\/\/snippet-end:[dynamodb.cpp.get_item.inc]\r\n\r\n\r\n\/**\r\n* Get an item from a DynamoDB table.\r\n*\r\n* Takes the name of the table and the name of the item to retrieve from it.\r\n*\r\n* The primary key \"Name\" is searched. By default, all fields and values \r\n* contained in the item are returned. If an optional projection expression is\r\n* specified on the command line, only the specified fields and values are \r\n* returned.\r\n*\r\n*\/\r\nint main(int argc, char** argv)\r\n{\r\n const std::string USAGE = \"\\n\" \\\r\n \"Usage:\\n\"\r\n \" get_item <table> <name> [projection_expression]\\n\\n\"\r\n \"Where:\\n\"\r\n \" table - the table to get an item from.\\n\"\r\n \" name - the item to get.\\n\\n\"\r\n \"You can add an optional projection expression (a quote-delimited,\\n\"\r\n \"comma-separated list of attributes to retrieve) to limit the\\n\"\r\n \"fields returned from the table.\\n\\n\"\r\n \"Example:\\n\"\r\n \" get_item HelloTable World\\n\"\r\n \" get_item SiteColors text \\\"default, bold\\\"\\n\";\r\n\r\n if (argc < 3)\r\n {\r\n std::cout << USAGE;\r\n return 1;\r\n }\r\n\r\n Aws::SDKOptions options;\r\n\r\n Aws::InitAPI(options);\r\n {\r\n const Aws::String table(argv[1]);\r\n const Aws::String name(argv[2]);\r\n const Aws::String projection(argc > 3 ? argv[3] : \"\");\r\n\r\n \/\/ snippet-start:[dynamodb.cpp.get_item.code]\r\n Aws::Client::ClientConfiguration clientConfig;\r\n Aws::DynamoDB::DynamoDBClient dynamoClient(clientConfig);\r\n Aws::DynamoDB::Model::GetItemRequest req;\r\n\r\n \/\/ Set up the request\r\n req.SetTableName(table);\r\n Aws::DynamoDB::Model::AttributeValue hashKey;\r\n hashKey.SetS(name);\r\n req.AddKey(\"Name\", hashKey);\r\n if (!projection.empty())\r\n req.SetProjectionExpression(projection);\r\n\r\n \/\/ Retrieve the item's fields and values\r\n const Aws::DynamoDB::Model::GetItemOutcome& result = dynamoClient.GetItem(req);\r\n if (result.IsSuccess())\r\n {\r\n \/\/ Reference the retrieved fields\/values\r\n const Aws::Map<Aws::String, Aws::DynamoDB::Model::AttributeValue>& item = result.GetResult().GetItem();\r\n if (item.size() > 0)\r\n {\r\n \/\/ Output each retrieved field and its value\r\n for (const auto& i : item)\r\n std::cout << i.first << \": \" << i.second.GetS() << std::endl;\r\n }\r\n else\r\n {\r\n std::cout << \"No item found with the key \" << name << std::endl;\r\n }\r\n\r\n }\r\n else\r\n {\r\n std::cout << \"Failed to get item: \" << result.GetError().GetMessage();\r\n }\r\n \/\/ snippet-end:[dynamodb.cpp.get_item.code]\r\n }\r\n Aws::ShutdownAPI(options);\r\n return 0;\r\n}<|endoftext|>"} {"text":"<commit_before>\/** \\brief Updates Zeder (via Ingo's SQL database) w\/ the last N issues of harvested articles for each journal.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2018-2020 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <iostream>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DnsUtil.h\"\n#include \"IniFile.h\"\n#include \"MARC.h\"\n#include \"SqlUtil.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n#include \"Zeder.h\"\n\n\nnamespace {\n\n\n\/\/ Please note that Zeder PPN entries are separated by spaces and, unlike what the column names \"print_ppn\" and\n\/\/ \"online_ppn\" imply may in rare cases contain space-separated lists of PPN's.\ninline auto SplitZederPPNs(const std::string &ppns) {\n std::vector<std::string> individual_ppns;\n StringUtil::Split(ppns, ' ', &individual_ppns);\n return individual_ppns;\n}\n\n\nstruct ZederIdAndPPNType {\n unsigned zeder_id_;\n char type_; \/\/ 'p' or 'e' for \"print\" or \"electronic\"\npublic:\n ZederIdAndPPNType(const unsigned zeder_id, const char type)\n : zeder_id_(zeder_id), type_(type) { }\n};\n\n\nstd::unordered_map<std::string, ZederIdAndPPNType> GetPPNsToZederIdsAndTypesMap(const std::string &system_type) {\n const Zeder::SimpleZeder zeder(system_type == \"ixtheo\" ? Zeder::IXTHEO : Zeder::KRIMDOK, { \"eppn\", \"pppn\" });\n if (unlikely(zeder.empty()))\n LOG_ERROR(\"found no Zeder entries matching any of our requested columns!\"\n \" (This *should* not happen as we included the column ID!)\");\n\n std::unordered_map<std::string, ZederIdAndPPNType> ppns_to_zeder_ids_and_types_map;\n unsigned included_journal_count(0);\n std::set<std::string> bundle_ppns; \/\/ We use a std::set because it is automatically being sorted for us.\n for (const auto &journal : zeder) {\n if (journal.empty())\n continue;\n ++included_journal_count;\n\n const auto print_ppns(SplitZederPPNs(journal.lookup(\"pppn\")));\n const auto online_ppns(SplitZederPPNs(journal.lookup(\"eppn\")));\n\n if (print_ppns.empty() and online_ppns.empty()) {\n --included_journal_count;\n LOG_WARNING(\"Zeder entry #\" + std::to_string(journal.getId()) + \" is missing print and online PPN's!\");\n continue;\n }\n\n for (const auto &print_ppn : print_ppns)\n ppns_to_zeder_ids_and_types_map.emplace(print_ppn, ZederIdAndPPNType(journal.getId(), 'p'));\n\n for (const auto &online_ppn : online_ppns)\n ppns_to_zeder_ids_and_types_map.emplace(online_ppn, ZederIdAndPPNType(journal.getId(), 'e'));\n }\n\n LOG_INFO(\"downloaded information for \" + std::to_string(included_journal_count) + \" journal(s) from Zeder.\");\n\n return ppns_to_zeder_ids_and_types_map;\n}\n\n\n\/\/ \\return the year as a small integer or 0 if we could not parse it.\nunsigned short YearStringToShort(const std::string &year_as_string) {\n unsigned short year_as_unsigned_short;\n if (not StringUtil::ToUnsignedShort(year_as_string, &year_as_unsigned_short))\n return 0;\n return year_as_unsigned_short;\n}\n\n\nstruct DbEntry {\n std::string jahr_;\n std::string band_;\n std::string heft_;\n std::string seitenbereich_;\npublic:\n DbEntry(const std::string &jahr, const std::string &band, const std::string &heft, const std::string &seitenbereich)\n : jahr_(jahr), band_(band), heft_(heft), seitenbereich_(seitenbereich) { }\n DbEntry() = default;\n DbEntry(const DbEntry &other) = default;\n\n \/** \\return True if the current entry represents a more recent article than \"other\". If the entry is in the same issue\n we use the page numbers as an arbitrary tie breaker. *\/\n bool isNewerThan(const DbEntry &other) const;\n};\n\n\ninline bool DbEntry::isNewerThan(const DbEntry &other) const {\n if (jahr_ < other.jahr_)\n return false;\n if (jahr_ > other.jahr_)\n return true;\n if (band_ < other.band_)\n return false;\n if (band_ > other.band_)\n return true;\n if (heft_ < other.heft_)\n return false;\n if (heft_ > other.heft_)\n return true;\n return seitenbereich_ > other.seitenbereich_; \/\/ Somewhat nonsensical, but useful nonetheless.\n}\n\n\nsize_t GetExistingDbEntries(const IniFile &ini_file, const std::string &hostname, const std::string &system_type,\n std::unordered_map<std::string, DbEntry> * const existing_entries)\n{\n DbConnection db_connection_select(ini_file, \"DatabaseSelect\");\n\n db_connection_select.queryOrDie(\"SELECT MAX(timestamp),Zeder_ID,PPN,Jahr,Band,Heft,Seitenbereich\"\n \" FROM zeder.erschliessung WHERE Quellrechner='\" + hostname + \"' AND Systemtyp='\"\n + system_type + \"' GROUP BY Zeder_ID,PPN,Jahr,Band,Heft,Seitenbereich\");\n auto result_set(db_connection_select.getLastResultSet());\n while (const auto row = result_set.getNextRow()) {\n const DbEntry db_entry(row[\"Jahr\"], row[\"Band\"], row[\"Heft\"], row[\"Seitenbereich\"]);\n const auto key(row[\"Zeder_ID\"] + \"+\" + row[\"PPN\"]);\n auto key_and_entry(existing_entries->find(key));\n if (key_and_entry == existing_entries->end() or db_entry.isNewerThan(key_and_entry->second))\n (*existing_entries)[key] = db_entry;\n }\n\n return existing_entries->size();\n}\n\n\n\/\/ \\return True if \"test_entry\" either does not exist in the databse or is newer than the newest existing entry.\nbool NewerThanWhatExistsInDB(const std::unordered_map<std::string, DbEntry> &existing_entries,\n const std::string &zeder_id, const std::string &ppn, const DbEntry &test_entry)\n{\n const auto key_and_entry(existing_entries.find(zeder_id + \"+\" + ppn));\n if (key_and_entry == existing_entries.cend())\n return true;\n\n return test_entry.isNewerThan(key_and_entry->second);\n}\n\n\nvoid CollectMostRecentEntries(const IniFile &ini_file, MARC::Reader * const reader, MARC::Writer * const writer,\n const std::string &system_type, const std::string &hostname,\n const std::unordered_map<std::string, ZederIdAndPPNType> &ppns_to_zeder_ids_and_types_map,\n std::unordered_map<std::string, DbEntry> * const ppns_to_most_recent_entries_map)\n{\n std::unordered_map<std::string, DbEntry> existing_entries;\n LOG_INFO(\"Found \" + std::to_string(GetExistingDbEntries(ini_file, hostname, system_type, &existing_entries))\n + \" existing database entries.\");\n\n unsigned total_count(0);\n while (const auto record = reader->read()) {\n ++total_count;\n writer->write(record); \/\/ For the next pipeline phase.\n\n const std::string superior_control_number(record.getSuperiorControlNumber());\n if (superior_control_number.empty())\n continue;\n\n const auto ppn_and_zeder_id_and_ppn_type(ppns_to_zeder_ids_and_types_map.find(superior_control_number));\n if (ppn_and_zeder_id_and_ppn_type == ppns_to_zeder_ids_and_types_map.cend())\n continue;\n\n const auto _936_field(record.findTag(\"936\"));\n if (_936_field == record.end())\n continue;\n\n const std::string pages(_936_field->getFirstSubfieldWithCode('h'));\n std::string volume;\n std::string issue(_936_field->getFirstSubfieldWithCode('e'));\n if (issue.empty())\n issue = _936_field->getFirstSubfieldWithCode('d');\n else\n volume = _936_field->getFirstSubfieldWithCode('d');\n const std::string year(_936_field->getFirstSubfieldWithCode('j'));\n\n const std::string zeder_id(std::to_string(ppn_and_zeder_id_and_ppn_type->second.zeder_id_));\n const std::string ppn_type(1, ppn_and_zeder_id_and_ppn_type->second.type_);\n const std::string year_as_string(std::to_string(YearStringToShort(year)));\n\n const DbEntry new_db_entry(year_as_string, volume, issue, pages);\n if (NewerThanWhatExistsInDB(existing_entries, zeder_id, superior_control_number, new_db_entry))\n (*ppns_to_most_recent_entries_map)[superior_control_number] = new_db_entry;\n }\n\n LOG_INFO(\"Processed \" + std::to_string(total_count) + \" MARC records and found \"\n + std::to_string(ppns_to_most_recent_entries_map->size()) + \" new entries to insert .\");\n}\n\n\nvoid UpdateDatabase(const IniFile &ini_file, const std::string &system_type, const std::string &hostname,\n const std::unordered_map<std::string, ZederIdAndPPNType> &ppns_to_zeder_ids_and_types_map,\n const std::unordered_map<std::string, DbEntry> &ppns_to_most_recent_entries_map)\n{\n const auto JOB_START_TIME(std::to_string(std::time(nullptr)));\n\n DbConnection db_connection_insert(ini_file, \"DatabaseInsert\");\n const unsigned SQL_INSERT_BATCH_SIZE(20);\n const std::vector<std::string> COLUMN_NAMES{ \"timestamp\", \"Quellrechner\", \"Systemtyp\", \"Zeder_ID\", \"PPN_Typ\",\n \"PPN\", \"Jahr\", \"Band\", \"Heft\", \"Seitenbereich\" };\n std::vector<std::vector<std::optional<std::string>>> column_values;\n\n for (const auto &[ppn, db_entry] : ppns_to_most_recent_entries_map) {\n const auto ppn_and_zeder_id_and_ppn_type(ppns_to_zeder_ids_and_types_map.find(ppn));\n if (unlikely(ppn_and_zeder_id_and_ppn_type == ppns_to_zeder_ids_and_types_map.cend()))\n LOG_ERROR(\"this should *never* happen!\");\n\n const std::vector<std::optional<std::string>> new_column_values{\n { \/* timestamp *\/ JOB_START_TIME },\n { \/* Quellrechner *\/ hostname },\n { \/* Systemtyp *\/ system_type, },\n { \/* Zeder_ID *\/ std::to_string(ppn_and_zeder_id_and_ppn_type->second.zeder_id_) },\n { \/* PPN_Typ *\/ std::string(1, ppn_and_zeder_id_and_ppn_type->second.type_) },\n { \/* PPN *\/ ppn },\n { \/* Jahr *\/ db_entry.jahr_ },\n { \/* Band *\/ db_entry.band_ },\n { \/* Heft *\/ db_entry.heft_ },\n { \/* Seitenbereich *\/ db_entry.seitenbereich_ },\n };\n column_values.emplace_back(new_column_values);\n\n if (column_values.size() == SQL_INSERT_BATCH_SIZE) {\n db_connection_insert.insertIntoTableOrDie(\"zeder.erschliessung\", COLUMN_NAMES, column_values);\n column_values.clear();\n }\n }\n if (not column_values.empty())\n db_connection_insert.insertIntoTableOrDie(\"zeder.erschliessung\", COLUMN_NAMES, column_values);\n\n LOG_INFO(\"Inserted \" + std::to_string(ppns_to_most_recent_entries_map.size()) + \" entries into Ingo's database.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 4)\n ::Usage(\"[--min-log-level=log_level] system_type marc_input marc_output\\n\"\n \"\\twhere \\\"system_type\\\" must be one of ixtheo|krimdok\");\n\n std::string system_type;\n if (__builtin_strcmp(\"ixtheo\", argv[1]) == 0)\n system_type = \"ixtheo\";\n else if (__builtin_strcmp(\"krimdok\", argv[1]) == 0)\n system_type = \"krimdok\";\n else\n LOG_ERROR(\"system_type must be one of ixtheo|krimdok!\");\n\n const auto ppns_to_zeder_ids_and_types_map(GetPPNsToZederIdsAndTypesMap(system_type));\n\n const IniFile ini_file;\n const auto HOSTNAME(DnsUtil::GetHostname());\n const auto marc_reader(MARC::Reader::Factory(argv[2]));\n const auto marc_writer(MARC::Writer::Factory(argv[3]));\n std::unordered_map<std::string, DbEntry> ppns_to_most_recent_entries_map;\n CollectMostRecentEntries(ini_file, marc_reader.get(), marc_writer.get(), system_type, HOSTNAME,\n ppns_to_zeder_ids_and_types_map, &ppns_to_most_recent_entries_map);\n UpdateDatabase(ini_file, system_type, HOSTNAME, ppns_to_zeder_ids_and_types_map,\n ppns_to_most_recent_entries_map);\n\n return EXIT_SUCCESS;\n}\n<commit_msg>determine most recent article<commit_after>\/** \\brief Updates Zeder (via Ingo's SQL database) w\/ the last N issues of harvested articles for each journal.\n * \\author Dr. Johannes Ruscheinski (johannes.ruscheinski@uni-tuebingen.de)\n *\n * \\copyright 2018-2020 Universitätsbibliothek Tübingen. All rights reserved.\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <iostream>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DnsUtil.h\"\n#include \"IniFile.h\"\n#include \"MARC.h\"\n#include \"SqlUtil.h\"\n#include \"StringUtil.h\"\n#include \"util.h\"\n#include \"Zeder.h\"\n\n\nnamespace {\n\n\n\/\/ Please note that Zeder PPN entries are separated by spaces and, unlike what the column names \"print_ppn\" and\n\/\/ \"online_ppn\" imply may in rare cases contain space-separated lists of PPN's.\ninline auto SplitZederPPNs(const std::string &ppns) {\n std::vector<std::string> individual_ppns;\n StringUtil::Split(ppns, ' ', &individual_ppns);\n return individual_ppns;\n}\n\n\nstruct ZederIdAndPPNType {\n unsigned zeder_id_;\n char type_; \/\/ 'p' or 'e' for \"print\" or \"electronic\"\npublic:\n ZederIdAndPPNType(const unsigned zeder_id, const char type)\n : zeder_id_(zeder_id), type_(type) { }\n};\n\n\nstd::unordered_map<std::string, ZederIdAndPPNType> GetPPNsToZederIdsAndTypesMap(const std::string &system_type) {\n const Zeder::SimpleZeder zeder(system_type == \"ixtheo\" ? Zeder::IXTHEO : Zeder::KRIMDOK, { \"eppn\", \"pppn\" });\n if (unlikely(zeder.empty()))\n LOG_ERROR(\"found no Zeder entries matching any of our requested columns!\"\n \" (This *should* not happen as we included the column ID!)\");\n\n std::unordered_map<std::string, ZederIdAndPPNType> ppns_to_zeder_ids_and_types_map;\n unsigned included_journal_count(0);\n std::set<std::string> bundle_ppns; \/\/ We use a std::set because it is automatically being sorted for us.\n for (const auto &journal : zeder) {\n if (journal.empty())\n continue;\n ++included_journal_count;\n\n const auto print_ppns(SplitZederPPNs(journal.lookup(\"pppn\")));\n const auto online_ppns(SplitZederPPNs(journal.lookup(\"eppn\")));\n\n if (print_ppns.empty() and online_ppns.empty()) {\n --included_journal_count;\n LOG_WARNING(\"Zeder entry #\" + std::to_string(journal.getId()) + \" is missing print and online PPN's!\");\n continue;\n }\n\n for (const auto &print_ppn : print_ppns)\n ppns_to_zeder_ids_and_types_map.emplace(print_ppn, ZederIdAndPPNType(journal.getId(), 'p'));\n\n for (const auto &online_ppn : online_ppns)\n ppns_to_zeder_ids_and_types_map.emplace(online_ppn, ZederIdAndPPNType(journal.getId(), 'e'));\n }\n\n LOG_INFO(\"downloaded information for \" + std::to_string(included_journal_count) + \" journal(s) from Zeder.\");\n\n return ppns_to_zeder_ids_and_types_map;\n}\n\n\n\/\/ \\return the year as a small integer or 0 if we could not parse it.\nunsigned short YearStringToShort(const std::string &year_as_string) {\n unsigned short year_as_unsigned_short;\n if (not StringUtil::ToUnsignedShort(year_as_string, &year_as_unsigned_short))\n return 0;\n return year_as_unsigned_short;\n}\n\n\nstruct DbEntry {\n std::string jahr_;\n std::string band_;\n std::string heft_;\n std::string seitenbereich_;\npublic:\n DbEntry(const std::string &jahr, const std::string &band, const std::string &heft, const std::string &seitenbereich)\n : jahr_(jahr), band_(band), heft_(heft), seitenbereich_(seitenbereich) { }\n DbEntry() = default;\n DbEntry(const DbEntry &other) = default;\n\n \/** \\return True if the current entry represents a more recent article than \"other\". If the entry is in the same issue\n we use the page numbers as an arbitrary tie breaker. *\/\n bool isNewerThan(const DbEntry &other) const;\n};\n\n\ninline bool DbEntry::isNewerThan(const DbEntry &other) const {\n if (jahr_ < other.jahr_)\n return false;\n if (jahr_ > other.jahr_)\n return true;\n if (band_ < other.band_)\n return false;\n if (band_ > other.band_)\n return true;\n if (heft_ < other.heft_)\n return false;\n if (heft_ > other.heft_)\n return true;\n return seitenbereich_ > other.seitenbereich_; \/\/ Somewhat nonsensical, but useful nonetheless.\n}\n\n\nsize_t GetExistingDbEntries(const IniFile &ini_file, const std::string &hostname, const std::string &system_type,\n std::unordered_map<std::string, DbEntry> * const existing_entries)\n{\n DbConnection db_connection_select(ini_file, \"DatabaseSelect\");\n\n db_connection_select.queryOrDie(\"SELECT MAX(timestamp),Zeder_ID,PPN,Jahr,Band,Heft,Seitenbereich\"\n \" FROM zeder.erschliessung WHERE Quellrechner='\" + hostname + \"' AND Systemtyp='\"\n + system_type + \"' GROUP BY Zeder_ID,PPN,Jahr,Band,Heft,Seitenbereich\");\n auto result_set(db_connection_select.getLastResultSet());\n while (const auto row = result_set.getNextRow()) {\n const DbEntry db_entry(row[\"Jahr\"], row[\"Band\"], row[\"Heft\"], row[\"Seitenbereich\"]);\n const auto key(row[\"Zeder_ID\"] + \"+\" + row[\"PPN\"]);\n auto key_and_entry(existing_entries->find(key));\n if (key_and_entry == existing_entries->end() or db_entry.isNewerThan(key_and_entry->second))\n (*existing_entries)[key] = db_entry;\n }\n\n return existing_entries->size();\n}\n\n\n\/\/ \\return True if \"test_entry\" either does not exist in the databse or is newer than the newest existing entry.\nbool NewerThanWhatExistsInDB(const std::unordered_map<std::string, DbEntry> &existing_entries,\n const std::string &zeder_id, const std::string &ppn, const DbEntry &test_entry)\n{\n const auto key_and_entry(existing_entries.find(zeder_id + \"+\" + ppn));\n if (key_and_entry == existing_entries.cend())\n return true;\n\n return test_entry.isNewerThan(key_and_entry->second);\n}\n\n\nvoid CollectMostRecentEntries(const IniFile &ini_file, MARC::Reader * const reader, MARC::Writer * const writer,\n const std::string &system_type, const std::string &hostname,\n const std::unordered_map<std::string, ZederIdAndPPNType> &ppns_to_zeder_ids_and_types_map,\n std::unordered_map<std::string, DbEntry> * const ppns_to_most_recent_entries_map)\n{\n std::unordered_map<std::string, DbEntry> existing_entries;\n LOG_INFO(\"Found \" + std::to_string(GetExistingDbEntries(ini_file, hostname, system_type, &existing_entries))\n + \" existing database entries.\");\n\n unsigned total_count(0);\n while (const auto record = reader->read()) {\n ++total_count;\n writer->write(record); \/\/ For the next pipeline phase.\n\n const std::string superior_control_number(record.getSuperiorControlNumber());\n if (superior_control_number.empty())\n continue;\n\n const auto ppn_and_zeder_id_and_ppn_type(ppns_to_zeder_ids_and_types_map.find(superior_control_number));\n if (ppn_and_zeder_id_and_ppn_type == ppns_to_zeder_ids_and_types_map.cend())\n continue;\n\n const auto _936_field(record.findTag(\"936\"));\n if (_936_field == record.end())\n continue;\n\n const std::string pages(_936_field->getFirstSubfieldWithCode('h'));\n std::string volume;\n std::string issue(_936_field->getFirstSubfieldWithCode('e'));\n if (issue.empty())\n issue = _936_field->getFirstSubfieldWithCode('d');\n else\n volume = _936_field->getFirstSubfieldWithCode('d');\n const std::string year(_936_field->getFirstSubfieldWithCode('j'));\n\n const std::string zeder_id(std::to_string(ppn_and_zeder_id_and_ppn_type->second.zeder_id_));\n const std::string ppn_type(1, ppn_and_zeder_id_and_ppn_type->second.type_);\n const std::string year_as_string(std::to_string(YearStringToShort(year)));\n\n const DbEntry new_db_entry(year_as_string, volume, issue, pages);\n if (NewerThanWhatExistsInDB(existing_entries, zeder_id, superior_control_number, new_db_entry)) {\n (*ppns_to_most_recent_entries_map)[superior_control_number] = new_db_entry;\n const auto superior_control_number_and_entry(ppns_to_most_recent_entries_map->find(superior_control_number));\n if (superior_control_number_and_entry == ppns_to_most_recent_entries_map->end() or new_db_entry.isNewerThan(superior_control_number_and_entry->second))\n (*ppns_to_most_recent_entries_map)[superior_control_number] = new_db_entry;\n }\n }\n\n LOG_INFO(\"Processed \" + std::to_string(total_count) + \" MARC records and found \"\n + std::to_string(ppns_to_most_recent_entries_map->size()) + \" new entries to insert .\");\n}\n\n\nvoid UpdateDatabase(const IniFile &ini_file, const std::string &system_type, const std::string &hostname,\n const std::unordered_map<std::string, ZederIdAndPPNType> &ppns_to_zeder_ids_and_types_map,\n const std::unordered_map<std::string, DbEntry> &ppns_to_most_recent_entries_map)\n{\n const auto JOB_START_TIME(std::to_string(std::time(nullptr)));\n\n DbConnection db_connection_insert(ini_file, \"DatabaseInsert\");\n const unsigned SQL_INSERT_BATCH_SIZE(20);\n const std::vector<std::string> COLUMN_NAMES{ \"timestamp\", \"Quellrechner\", \"Systemtyp\", \"Zeder_ID\", \"PPN_Typ\",\n \"PPN\", \"Jahr\", \"Band\", \"Heft\", \"Seitenbereich\" };\n std::vector<std::vector<std::optional<std::string>>> column_values;\n\n for (const auto &[ppn, db_entry] : ppns_to_most_recent_entries_map) {\n const auto ppn_and_zeder_id_and_ppn_type(ppns_to_zeder_ids_and_types_map.find(ppn));\n if (unlikely(ppn_and_zeder_id_and_ppn_type == ppns_to_zeder_ids_and_types_map.cend()))\n LOG_ERROR(\"this should *never* happen!\");\n\n const std::vector<std::optional<std::string>> new_column_values{\n { \/* timestamp *\/ JOB_START_TIME },\n { \/* Quellrechner *\/ hostname },\n { \/* Systemtyp *\/ system_type, },\n { \/* Zeder_ID *\/ std::to_string(ppn_and_zeder_id_and_ppn_type->second.zeder_id_) },\n { \/* PPN_Typ *\/ std::string(1, ppn_and_zeder_id_and_ppn_type->second.type_) },\n { \/* PPN *\/ ppn },\n { \/* Jahr *\/ db_entry.jahr_ },\n { \/* Band *\/ db_entry.band_ },\n { \/* Heft *\/ db_entry.heft_ },\n { \/* Seitenbereich *\/ db_entry.seitenbereich_ },\n };\n column_values.emplace_back(new_column_values);\n\n if (column_values.size() == SQL_INSERT_BATCH_SIZE) {\n db_connection_insert.insertIntoTableOrDie(\"zeder.erschliessung\", COLUMN_NAMES, column_values);\n column_values.clear();\n }\n }\n if (not column_values.empty())\n db_connection_insert.insertIntoTableOrDie(\"zeder.erschliessung\", COLUMN_NAMES, column_values);\n\n LOG_INFO(\"Inserted \" + std::to_string(ppns_to_most_recent_entries_map.size()) + \" entries into Ingo's database.\");\n}\n\n\n} \/\/ unnamed namespace\n\n\nint Main(int argc, char *argv[]) {\n if (argc != 4)\n ::Usage(\"[--min-log-level=log_level] system_type marc_input marc_output\\n\"\n \"\\twhere \\\"system_type\\\" must be one of ixtheo|krimdok\");\n\n std::string system_type;\n if (__builtin_strcmp(\"ixtheo\", argv[1]) == 0)\n system_type = \"ixtheo\";\n else if (__builtin_strcmp(\"krimdok\", argv[1]) == 0)\n system_type = \"krimdok\";\n else\n LOG_ERROR(\"system_type must be one of ixtheo|krimdok!\");\n\n const auto ppns_to_zeder_ids_and_types_map(GetPPNsToZederIdsAndTypesMap(system_type));\n\n const IniFile ini_file;\n const auto HOSTNAME(DnsUtil::GetHostname());\n const auto marc_reader(MARC::Reader::Factory(argv[2]));\n const auto marc_writer(MARC::Writer::Factory(argv[3]));\n std::unordered_map<std::string, DbEntry> ppns_to_most_recent_entries_map;\n CollectMostRecentEntries(ini_file, marc_reader.get(), marc_writer.get(), system_type, HOSTNAME,\n ppns_to_zeder_ids_and_types_map, &ppns_to_most_recent_entries_map);\n UpdateDatabase(ini_file, system_type, HOSTNAME, ppns_to_zeder_ids_and_types_map,\n ppns_to_most_recent_entries_map);\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <unordered_map>\n#include <boost\/cast.hpp>\n\n#include \"BinaryMsg.hpp\"\n\n\nstruct Dispatcher\n{\n virtual ~Dispatcher(void) { }\n virtual void dispatch(BinaryMsg const& bin) = 0;\nprotected:\n};\n\n\nnamespace detail\n{\ntemplate<typename FinalType, typename C, typename H, typename ...T>\nstruct RegistrationHelper\n{\n static void call(C& c)\n {\n auto h = [](FinalType& ft, BinaryMsg const& bin) { ft.handle( deserialize<H>(bin) ); };\n c[H::type()] = +h;\n RegistrationHelper<FinalType, C, T...>::call(c);\n }\n};\n\ntemplate<typename FinalType, typename C>\nstruct RegistrationHelper<FinalType, C, void>\n{\n static void call(C& c) { }\n};\n}\n\n\ntemplate<typename FinalType, typename ...M>\nstruct CustomDispatcher: public Dispatcher\n{\n CustomDispatcher(void)\n {\n detail::RegistrationHelper<FinalType, decltype(handlers_), M..., void>::call(handlers_);\n }\n\n virtual void dispatch(BinaryMsg const& bin)\n {\n auto it = handlers_.find(bin.type_);\n if(it==std::end(handlers_))\n throw std::runtime_error(\"no handler for a given message type\");\n auto h = it->second;\n assert(h);\n (*h)( *boost::polymorphic_downcast<FinalType*>(this), bin );\n }\n\nprivate:\n std::unordered_map<unsigned, void(*)(FinalType&, BinaryMsg const&)> handlers_;\n};\n<commit_msg>fixed binary size issue; added runtime-check for unique message IDs<commit_after>#pragma once\n\n#include <unordered_map>\n#include <boost\/cast.hpp>\n\n#include \"BinaryMsg.hpp\"\n\n\nstruct Dispatcher\n{\n virtual ~Dispatcher(void) { }\n virtual void dispatch(BinaryMsg const& bin) = 0;\nprotected:\n};\n\n\nnamespace detail\n{\n\ntemplate<typename FinalType, typename M>\nvoid todo(FinalType& ft, BinaryMsg const& bin)\n{\n ft.handle( deserialize<M>(bin) );\n}\n\ntemplate<typename FinalType, typename C, typename H, typename ...T>\nstruct RegistrationHelper\n{\n static void call(C& c)\n {\n \/\/ NOTE: although lambda version is way nicer, GCC generates 6x bigger code for that, clang 2x.\n \/\/ apparently both misse some important optimization. too bad... :(\n#if 0\n c[H::type()] = +[](FinalType& ft, BinaryMsg const& bin) { ft.handle( deserialize<H>(bin) ); };\n#else\n c[H::type()] = todo<FinalType,H>;\n#endif\n RegistrationHelper<FinalType, C, T...>::call(c);\n }\n};\n\ntemplate<typename FinalType, typename C>\nstruct RegistrationHelper<FinalType, C, void>\n{\n static void call(C& c) { }\n};\n}\n\n\ntemplate<typename FinalType, typename ...M>\nstruct CustomDispatcher: public Dispatcher\n{\n CustomDispatcher(void)\n {\n \/\/ NOTE: compile time check for unique type-ids can be added here!\n detail::RegistrationHelper<FinalType, decltype(handlers_), M..., void>::call(handlers_);\n assert( handlers_.size() == sizeof...(M) && \"non-unique message ids detected\" );\n }\n\n virtual void dispatch(BinaryMsg const& bin)\n {\n auto it = handlers_.find(bin.type_);\n if(it==std::end(handlers_))\n throw std::runtime_error(\"no handler for a given message type\");\n auto h = it->second;\n assert(h);\n (*h)( *boost::polymorphic_downcast<FinalType*>(this), bin );\n }\n\nprivate:\n std::unordered_map<unsigned, void(*)(FinalType&, BinaryMsg const&)> handlers_;\n};\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: vclfactory.hxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: vg $ $Date: 2005-03-10 13:22:43 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _CPPCANVAS_VCLFACTORY_HXX\n#define _CPPCANVAS_VCLFACTORY_HXX\n\n#ifndef _CPPCANVAS_CANVAS_HXX\n#include <cppcanvas\/canvas.hxx>\n#endif\n#ifndef _CPPCANVAS_BITMAPCANVAS_HXX\n#include <cppcanvas\/bitmapcanvas.hxx>\n#endif\n#ifndef _CPPCANVAS_SPRITECANVAS_HXX\n#include <cppcanvas\/spritecanvas.hxx>\n#endif\n#ifndef _CPPCANVAS_POLYPOLYGON_HXX\n#include <cppcanvas\/polypolygon.hxx>\n#endif\n#ifndef _CPPCANVAS_BITMAP_HXX\n#include <cppcanvas\/bitmap.hxx>\n#endif\n#ifndef _CPPCANVAS_RENDERER_HXX\n#include <cppcanvas\/renderer.hxx>\n#endif\n#ifndef _CPPCANVAS_TEXT_HXX\n#include <cppcanvas\/text.hxx>\n#endif\n#ifndef _CPPCANVAS_SPRITE_HXX\n#include <cppcanvas\/sprite.hxx>\n#endif\n\n\nclass Window;\nclass Bitmap;\nclass BitmapEx;\nclass Polygon;\nclass PolyPolygon;\nclass Size;\nclass Graphic;\nclass GDIMetaFile;\nclass Animation;\n\nnamespace rtl\n{\n class OUString;\n}\nnamespace com { namespace sun { namespace star { namespace rendering\n{\n class XBitmapCanvas;\n class XSpriteCanvas;\n} } } }\n\n\/* Definition of VCLFactory class *\/\n\nnamespace cppcanvas\n{\n \/** The VCLFactory creates Canvas objects for various VCL\n OutputDevice primitives, such as windows, polygons, bitmaps\n and metafiles.\n\n Please note that the objects created for a specific Canvas can\n only be drawn on exactly that canvas. You have to regenerate\n them for different canvases.\n *\/\n class VCLFactory\n {\n public:\n static VCLFactory& getInstance();\n\n BitmapCanvasSharedPtr createCanvas( const ::Window& rVCLWindow );\n BitmapCanvasSharedPtr createCanvas( const ::com::sun::star::uno::Reference<\n ::com::sun::star::rendering::XBitmapCanvas >& xCanvas );\n\n SpriteCanvasSharedPtr createSpriteCanvas( const ::Window& rVCLWindow ) const;\n SpriteCanvasSharedPtr createSpriteCanvas( const ::com::sun::star::uno::Reference<\n ::com::sun::star::rendering::XSpriteCanvas >& xCanvas ) const;\n SpriteCanvasSharedPtr createFullscreenSpriteCanvas( const ::Window& rVCLWindow, const Size& rFullscreenSize ) const;\n\n \/** Create a polygon from a tools::Polygon\n\n The created polygon initially has the same size in user\n coordinate space as the source polygon\n *\/\n PolyPolygonSharedPtr createPolyPolygon( const CanvasSharedPtr&, const ::Polygon& rPoly ) const;\n PolyPolygonSharedPtr createPolyPolygon( const CanvasSharedPtr&, const ::PolyPolygon& rPoly ) const;\n\n \/** Create an uninitialized bitmap with the given size\n *\/\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::Size& rSize ) const;\n\n \/** Create an uninitialized alpha bitmap with the given size\n *\/\n BitmapSharedPtr createAlphaBitmap( const CanvasSharedPtr&, const ::Size& rSize ) const;\n\n \/** Create a bitmap from a VCL Bitmap\n *\/\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::Bitmap& rBitmap ) const;\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::BitmapEx& rBmpEx ) const;\n\n \/** Create a renderer object from a Graphic\n\n The created renderer initially draws the graphic\n one-by-one units large, in user coordinate space\n *\/\n RendererSharedPtr createRenderer( const CanvasSharedPtr& rCanvas,\n const ::Graphic& rGraphic,\n const Renderer::Parameters& rParms ) const;\n \/** Create a renderer object from a Metafile\n\n The created renderer initially draws the metafile\n one-by-one units large, in user coordinate space\n *\/\n RendererSharedPtr createRenderer( const CanvasSharedPtr& rCanvas,\n const ::GDIMetaFile& rMtf,\n const Renderer::Parameters& rParms ) const;\n\n \/** Create an animated sprite from a VCL animation\n *\/\n SpriteSharedPtr createAnimatedSprite( const SpriteCanvasSharedPtr&, const ::Animation& rAnim ) const;\n\n \/** Create a text portion with the given content string\n *\/\n TextSharedPtr createText( const CanvasSharedPtr&, const ::rtl::OUString& ) const;\n\n private:\n friend struct InitInstance;\n\n \/\/ singleton\n VCLFactory();\n ~VCLFactory();\n\n \/\/ default: disabled copy\/assignment\n VCLFactory(const VCLFactory&);\n VCLFactory& operator=( const VCLFactory& );\n };\n\n}\n\n#endif \/* _CPPCANVAS_VCLFACTORY_HXX *\/\n<commit_msg>INTEGRATION: CWS ooo19126 (1.4.20); FILE MERGED 2005\/09\/05 18:40:56 rt 1.4.20.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: vclfactory.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 08:16:10 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _CPPCANVAS_VCLFACTORY_HXX\n#define _CPPCANVAS_VCLFACTORY_HXX\n\n#ifndef _CPPCANVAS_CANVAS_HXX\n#include <cppcanvas\/canvas.hxx>\n#endif\n#ifndef _CPPCANVAS_BITMAPCANVAS_HXX\n#include <cppcanvas\/bitmapcanvas.hxx>\n#endif\n#ifndef _CPPCANVAS_SPRITECANVAS_HXX\n#include <cppcanvas\/spritecanvas.hxx>\n#endif\n#ifndef _CPPCANVAS_POLYPOLYGON_HXX\n#include <cppcanvas\/polypolygon.hxx>\n#endif\n#ifndef _CPPCANVAS_BITMAP_HXX\n#include <cppcanvas\/bitmap.hxx>\n#endif\n#ifndef _CPPCANVAS_RENDERER_HXX\n#include <cppcanvas\/renderer.hxx>\n#endif\n#ifndef _CPPCANVAS_TEXT_HXX\n#include <cppcanvas\/text.hxx>\n#endif\n#ifndef _CPPCANVAS_SPRITE_HXX\n#include <cppcanvas\/sprite.hxx>\n#endif\n\n\nclass Window;\nclass Bitmap;\nclass BitmapEx;\nclass Polygon;\nclass PolyPolygon;\nclass Size;\nclass Graphic;\nclass GDIMetaFile;\nclass Animation;\n\nnamespace rtl\n{\n class OUString;\n}\nnamespace com { namespace sun { namespace star { namespace rendering\n{\n class XBitmapCanvas;\n class XSpriteCanvas;\n} } } }\n\n\/* Definition of VCLFactory class *\/\n\nnamespace cppcanvas\n{\n \/** The VCLFactory creates Canvas objects for various VCL\n OutputDevice primitives, such as windows, polygons, bitmaps\n and metafiles.\n\n Please note that the objects created for a specific Canvas can\n only be drawn on exactly that canvas. You have to regenerate\n them for different canvases.\n *\/\n class VCLFactory\n {\n public:\n static VCLFactory& getInstance();\n\n BitmapCanvasSharedPtr createCanvas( const ::Window& rVCLWindow );\n BitmapCanvasSharedPtr createCanvas( const ::com::sun::star::uno::Reference<\n ::com::sun::star::rendering::XBitmapCanvas >& xCanvas );\n\n SpriteCanvasSharedPtr createSpriteCanvas( const ::Window& rVCLWindow ) const;\n SpriteCanvasSharedPtr createSpriteCanvas( const ::com::sun::star::uno::Reference<\n ::com::sun::star::rendering::XSpriteCanvas >& xCanvas ) const;\n SpriteCanvasSharedPtr createFullscreenSpriteCanvas( const ::Window& rVCLWindow, const Size& rFullscreenSize ) const;\n\n \/** Create a polygon from a tools::Polygon\n\n The created polygon initially has the same size in user\n coordinate space as the source polygon\n *\/\n PolyPolygonSharedPtr createPolyPolygon( const CanvasSharedPtr&, const ::Polygon& rPoly ) const;\n PolyPolygonSharedPtr createPolyPolygon( const CanvasSharedPtr&, const ::PolyPolygon& rPoly ) const;\n\n \/** Create an uninitialized bitmap with the given size\n *\/\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::Size& rSize ) const;\n\n \/** Create an uninitialized alpha bitmap with the given size\n *\/\n BitmapSharedPtr createAlphaBitmap( const CanvasSharedPtr&, const ::Size& rSize ) const;\n\n \/** Create a bitmap from a VCL Bitmap\n *\/\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::Bitmap& rBitmap ) const;\n BitmapSharedPtr createBitmap( const CanvasSharedPtr&, const ::BitmapEx& rBmpEx ) const;\n\n \/** Create a renderer object from a Graphic\n\n The created renderer initially draws the graphic\n one-by-one units large, in user coordinate space\n *\/\n RendererSharedPtr createRenderer( const CanvasSharedPtr& rCanvas,\n const ::Graphic& rGraphic,\n const Renderer::Parameters& rParms ) const;\n \/** Create a renderer object from a Metafile\n\n The created renderer initially draws the metafile\n one-by-one units large, in user coordinate space\n *\/\n RendererSharedPtr createRenderer( const CanvasSharedPtr& rCanvas,\n const ::GDIMetaFile& rMtf,\n const Renderer::Parameters& rParms ) const;\n\n \/** Create an animated sprite from a VCL animation\n *\/\n SpriteSharedPtr createAnimatedSprite( const SpriteCanvasSharedPtr&, const ::Animation& rAnim ) const;\n\n \/** Create a text portion with the given content string\n *\/\n TextSharedPtr createText( const CanvasSharedPtr&, const ::rtl::OUString& ) const;\n\n private:\n friend struct InitInstance;\n\n \/\/ singleton\n VCLFactory();\n ~VCLFactory();\n\n \/\/ default: disabled copy\/assignment\n VCLFactory(const VCLFactory&);\n VCLFactory& operator=( const VCLFactory& );\n };\n\n}\n\n#endif \/* _CPPCANVAS_VCLFACTORY_HXX *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"stdafx.h\"\n#include \"SamplingTypeGenerator.h\"\n#include <math.h>\n#include \"DataHelper.h\"\n#include <algorithm>\n#include <numeric>\n#include \"..\/FFTW-64\/include\/fftw3.h\"\n\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3-3.lib\")\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3f-3.lib\")\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3l-3.lib\")\n\n\nusing namespace Yap;\nusing namespace std;\n\nCSamplingTypeGenerator::CSamplingTypeGenerator(void):\n\tCProcessorImp(L\"SamplingTypeGenerator\"),\n\t_try_count(10),\n\t_tolerance(3)\n{\n\tAddInputPort(L\"Input\", YAP_ANY_DIMENSION, DataTypeUnknown);\n\tAddOutputPort(L\"Output\", 1, DataTypeChar);\n\n\tAddProperty(PropertyFloat, L\"pow\", L\"\");\n\tSetFloat(L\"pow\", 3.0f);\n\tAddProperty(PropertyFloat, L\"sample_percent\", L\"\");\n\tSetFloat(L\"sample_percent\", 0.4);\n\tAddProperty(PropertyFloat, L\"radius\", L\"\");\n\tSetFloat(L\"radius\", 0.2f);\n\tAddProperty(PropertyBool, L\"equal_subsampling\", L\"\");\n\tSetBool(L\"equal_subsampling\", false);\n\tAddProperty(PropertyBool, L\"random_subsampling\", L\"\");\n\tSetBool(L\"random_subsampling\", true);\n\tAddProperty(PropertyInt, L\"Rate\", L\"\");\n\tSetInt(L\"Rate\", 2);\n\tAddProperty(PropertyInt, L\"AcsCount\", L\"\");\n\tSetInt(L\"AcsCount\", 16);\n}\n\nYap::CSamplingTypeGenerator::CSamplingTypeGenerator(const CSamplingTypeGenerator & rhs)\n\t:CProcessorImp(rhs)\n{\t\n}\n\n\nCSamplingTypeGenerator::~CSamplingTypeGenerator()\n{\n}\n\nIProcessor * Yap::CSamplingTypeGenerator::Clone()\n{\n\ttry\n\t{\n\t\tauto processor = new CSamplingTypeGenerator(*this);\n\t\treturn processor;\n\t}\n\tcatch (std::bad_alloc&)\n\t{\n\t\treturn nullptr;\n\t}\n}\n\nbool Yap::CSamplingTypeGenerator::Input(const wchar_t * name, IData * data)\n{\n\tif (wstring(name) != L\"Input\")\n\t\treturn false;\n\n\tif (data->GetDataType() != DataTypeComplexFloat)\n\t\treturn false;\n\n\tCDataHelper input_data(data);\n\tif (GetBool(L\"random_subsampling\"))\n\t{\n\t\tauto row_count = input_data.GetHeight();\n\t\tfloat pow = static_cast<float> (GetFloat(L\"pow\"));\n\t\tfloat sample_percent = static_cast<float> (GetFloat(L\"sample_percent\"));\n\t\tfloat radius = static_cast<float> (GetFloat(L\"radius\"));\n\n\t\tauto sampling_pattern = GetMinInterferenceSamplingPattern(row_count, pow, sample_percent, radius);\n\t\tchar * sampling_type = nullptr;\n\t\ttry\n\t\t{\n\t\t\tsampling_type = new char[row_count];\n\t\t}\n\t\tcatch(bad_alloc&)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tmemcpy(sampling_type, sampling_pattern.data(), sizeof(char));\n\n\t\tCDimensionsImp dimensions;\n\t\tdimensions(DimensionReadout, 0U, 1)\n\t\t\t(DimensionPhaseEncoding, 0U, row_count);\n\t\tCSmartPtr<CCharData> outdata(new CCharData(sampling_type, dimensions, nullptr, true));\n\n\t\tFeed(L\"Output\", outdata.get());\n\t}\n\telse\n\t{\n\t\tvector<unsigned char> sampling_pattern;\n\t\tunsigned int r = GetInt(L\"Rate\");\n\t\tunsigned int acs = GetInt(L\"AcsCount\");\n\t\tauto height = input_data.GetHeight();\n\t\tfor (unsigned int i = 0; i <= height - r - 1; ++i)\n\t\t{\n\t\t\tif (i % r == 0)\n\t\t\t{\n\t\t\t\tsampling_pattern.push_back(1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsampling_pattern.push_back(0);\n\t\t\t}\n\t\t}\n\n\t\tunsigned int first = static_cast<unsigned int>((floor((height - acs) \/ (2 * r))) * r + 1);\n\t\tunsigned int last = first + acs;\n\t\tsampling_pattern[first] = 1;\n\t\twhile (first <= last)\n\t\t{\n\t\t\t++first;\n\t\t\tsampling_pattern[first] = 1;\n\t\t}\n\n\t\tchar * sampling_type = nullptr;\n\t\ttry\n\t\t{\n\t\t\tsampling_type = new char[height];\n\t\t}\n\t\tcatch (bad_alloc&)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tmemcpy(sampling_type, sampling_pattern.data(), sizeof(char));\n\n\t\tCDimensionsImp dimensions;\n\t\tdimensions(DimensionReadout, 0U, 1)\n\t\t\t(DimensionPhaseEncoding, 0U, height);\n\t\tCSmartPtr<CCharData> outdata(new CCharData(sampling_type, dimensions, nullptr, true));\n\n\t\tFeed(L\"Output\", outdata.get());\n\t}\n\treturn true;\n}\n\nstd::vector<unsigned char> Yap::CSamplingTypeGenerator::GetMinInterferenceSamplingPattern(unsigned int row_count, float pow, float sample_percent, float radius)\n{\n\tfloat min_peak_interference((float)INT_MAX);\n\tvector<float> pdf = GeneratePdf(row_count, pow, sample_percent, radius);\n\n\tvector<unsigned char> min_interference_pattern(pdf.size());\n\tvector<unsigned char> sampling_pattern(pdf.size());\n\tvector<complex<float>> normalized_sampling_pattern(pdf.size());\n\tvector<complex<float>> fft_result(pdf.size());\n\n\tfftwf_plan p = fftwf_plan_dft_1d(int(normalized_sampling_pattern.size()),\n\t\t(fftwf_complex*)normalized_sampling_pattern.data(),\n\t\t(fftwf_complex*)fft_result.data(),\n\t\tFFTW_BACKWARD, FFTW_ESTIMATE);\t\/\/kռ䵽ͼǷҶ任\n\n\tfor (unsigned int i = 0; i < _try_count; ++i)\n\t{\n\t\tfloat sum_vector_element = 0;\n\n\t\tfloat sum_pdf = accumulate(pdf.begin(), pdf.end(), 0.0f);\n\t\twhile (abs(sum_vector_element - sum_pdf) > _tolerance)\n\t\t{\n\t\t\tsum_vector_element = 0;\n\t\t\tfor (unsigned int j = 0; j < pdf.size(); ++j)\n\t\t\t{\n\t\t\t\tsampling_pattern[j] = ((float)rand() \/ (RAND_MAX + 1) * 1) < pdf[j];\n\t\t\t\tsum_vector_element += sampling_pattern[j];\n\t\t\t}\n\t\t}\n\n\t\t\/\/תΪʽ\n\n\t\tfor (unsigned int t = 0; t < pdf.size(); t++)\n\t\t{\n\t\t\tnormalized_sampling_pattern[t] = std::complex<float>(sampling_pattern[t] \/ pdf[t], 0);\n\t\t}\n\t\t\/\/ Ҷ任\n\n\t\tfftwf_execute(p);\n\t\tfor (auto iter = fft_result.begin() + 1; iter != fft_result.end(); ++iter)\n\t\t{\n\t\t\t(*iter) \/= float(sqrt(fft_result.size()));\n\t\t}\n\t\t*(fft_result.data()) = 0;\n\t\tfloat max_value = abs(fft_result[1]);\n\t\tfor (auto it = fft_result.begin() + 1; it != fft_result.end(); ++it)\n\t\t{\n\n\t\t\tif (max_value < abs(*it))\n\t\t\t{\n\t\t\t\tmax_value = abs(*it);\n\t\t\t}\n\t\t}\n\n\t\tif (max_value < min_peak_interference)\n\t\t{\n\t\t\tmin_peak_interference = max_value;\n\t\t\tmin_interference_pattern = sampling_pattern;\n\t\t}\n\t}\n\t\/\/\n\tfftwf_destroy_plan(p);\n\n\treturn min_interference_pattern;\n}\n\nstd::vector<float> Yap::CSamplingTypeGenerator::GeneratePdf(unsigned int row_count, float p, float sample_percent, float radius)\n{\n\tfloat minval = 0.0;\n\tfloat maxval = 1.0;\n\tfloat val = 0.5;\n\tunsigned int line_count = (unsigned int)floor(sample_percent * row_count); \/\/ PCTG = 0.35 * 512 in Matlab\n\tfloat gap = float(2.0 \/ (row_count - 1));\n\n\tstd::vector<float> pdf;\n\n\tpdf = LineSpace(-1, 1, row_count);\n\tstd::vector<unsigned int> pdf_index(row_count);\n\tfor (unsigned int i = 0; i < pdf.size(); ++i)\n\t{\n\t\tpdf_index[i] = 0;\n\t\tif (abs(pdf[i]) < radius)\n\t\t{\n\t\t\tpdf_index[i] = i;\n\t\t}\n\t}\n\n\tfor (unsigned int i = 0; i < pdf.size(); ++i)\n\t{\n\t\tpdf[i] = pow(1 - abs(pdf[i]), p);\n\t\tif (i == pdf_index[i])\n\t\t{\n\t\t\tpdf[i] = 1;\n\t\t}\n\t}\n\n\tfloat sum = accumulate(pdf.begin(), pdf.end(), 0.0f);\n\n\n\tstd::vector<float> pdf_temp;\n\twhile (1)\n\t{\n\t\tval = minval \/ 2 + maxval \/ 2;\n\t\tpdf_temp.erase(pdf_temp.begin(), pdf_temp.end());\n\t\tfor (unsigned int i = 0; i < row_count; ++i)\n\t\t{\n\t\t\tfloat pdf_elem = pdf[i] + val;\n\t\t\tif (pdf_elem > 1.0)\n\t\t\t{\n\t\t\t\tpdf_elem = 1.0;\n\t\t\t}\n\t\t\tpdf_temp.push_back(pdf_elem);\n\t\t}\n\n\t\tsum = floor(accumulate(pdf_temp.begin(), pdf_temp.end(), 0.0f));\n\n\t\tif (floor(sum) > line_count)\n\t\t{\n\t\t\treturn vector<float>(); \/\/pֵƫС\n\t\t}\n\n\t\tif (sum > line_count)\n\t\t{\n\t\t\tmaxval = val;\n\t\t}\n\t\telse if (sum < line_count)\n\t\t{\n\t\t\tminval = val;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\treturn pdf_temp;\n}\n\nstd::vector<float> Yap::CSamplingTypeGenerator::LineSpace(float begin, float end, unsigned int count)\n{\n\tstd::vector<float> vec;\n\tfloat current_value = begin;\n\tfloat gap = float(2.0 \/ (count - 1));\n\n\twhile (current_value <= end)\n\t{\n\t\tvec.push_back(current_value);\n\t\tcurrent_value += gap;\n\t}\n\twhile (vec.size() < count)\n\t{\n\t\tvec.push_back(end);\n\t}\n\n\treturn vec;\n}\n<commit_msg>Modify SampingTypeGenerator<commit_after>#include \"stdafx.h\"\n#include \"SamplingTypeGenerator.h\"\n#include <math.h>\n#include \"DataHelper.h\"\n#include <algorithm>\n#include <numeric>\n#include \"..\/FFTW-64\/include\/fftw3.h\"\n\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3-3.lib\")\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3f-3.lib\")\n#pragma comment(lib, \"..\/FFTW-64\/lib\/libfftw3l-3.lib\")\n\n\nusing namespace Yap;\nusing namespace std;\n\nCSamplingTypeGenerator::CSamplingTypeGenerator(void):\n\tCProcessorImp(L\"SamplingTypeGenerator\"),\n\t_try_count(10),\n\t_tolerance(3)\n{\n\tAddInputPort(L\"Input\", YAP_ANY_DIMENSION, DataTypeUnknown);\n\tAddOutputPort(L\"Output\", 1, DataTypeChar);\n\n\tAddProperty(PropertyFloat, L\"pow\", L\"\");\n\tSetFloat(L\"pow\", 3.0f);\n\tAddProperty(PropertyFloat, L\"sample_percent\", L\"\");\n\tSetFloat(L\"sample_percent\", 0.4);\n\tAddProperty(PropertyFloat, L\"radius\", L\"\");\n\tSetFloat(L\"radius\", 0.2f);\n\n\tAddProperty(PropertyBool, L\"equal_subsampling\", L\"\");\n\tSetBool(L\"equal_subsampling\", false);\n\tAddProperty(PropertyBool, L\"random_subsampling\", L\"\");\n\tSetBool(L\"random_subsampling\", true);\n\n\tAddProperty(PropertyInt, L\"Rate\", L\"\");\n\tSetInt(L\"Rate\", 2);\n\tAddProperty(PropertyInt, L\"AcsCount\", L\"\");\n\tSetInt(L\"AcsCount\", 16);\n}\n\nYap::CSamplingTypeGenerator::CSamplingTypeGenerator(const CSamplingTypeGenerator & rhs)\n\t:CProcessorImp(rhs)\n{\t\n}\n\n\nCSamplingTypeGenerator::~CSamplingTypeGenerator()\n{\n}\n\nIProcessor * Yap::CSamplingTypeGenerator::Clone()\n{\n\ttry\n\t{\n\t\tauto processor = new CSamplingTypeGenerator(*this);\n\t\treturn processor;\n\t}\n\tcatch (std::bad_alloc&)\n\t{\n\t\treturn nullptr;\n\t}\n}\n\nbool Yap::CSamplingTypeGenerator::Input(const wchar_t * name, IData * data)\n{\n\tif (wstring(name) != L\"Input\")\n\t\treturn false;\n\n\tif (data->GetDataType() != DataTypeComplexFloat)\n\t\treturn false;\n\n\tCDataHelper input_data(data);\n\tif (GetBool(L\"random_subsampling\"))\n\t{\n\t\tauto row_count = input_data.GetHeight();\n\t\tfloat pow = static_cast<float> (GetFloat(L\"pow\"));\n\t\tfloat sample_percent = static_cast<float> (GetFloat(L\"sample_percent\"));\n\t\tfloat radius = static_cast<float> (GetFloat(L\"radius\"));\n\n\t\tauto sampling_pattern = GetMinInterferenceSamplingPattern(row_count, pow, sample_percent, radius);\n\t\tchar * sampling_type = nullptr;\n\t\ttry\n\t\t{\n\t\t\tsampling_type = new char[row_count];\n\t\t}\n\t\tcatch(bad_alloc&)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tmemcpy(sampling_type, sampling_pattern.data(), row_count * sizeof(char));\n\n\t\tCDimensionsImp dimensions;\n\t\tdimensions(DimensionReadout, 0U, 1)\n\t\t\t(DimensionPhaseEncoding, 0U, row_count);\n\t\tCSmartPtr<CCharData> outdata(new CCharData(sampling_type, dimensions, nullptr, true));\n\n\t\tFeed(L\"Output\", outdata.get());\n\t}\n\telse\n\t{\n\t\tvector<unsigned char> sampling_pattern;\n\t\tunsigned int r = GetInt(L\"Rate\");\n\t\tunsigned int acs = GetInt(L\"AcsCount\");\n\t\tauto height = input_data.GetHeight();\n\t\tfor (unsigned int i = 0; i <= height - r - 1; ++i)\n\t\t{\n\t\t\tif (i % r == 0)\n\t\t\t{\n\t\t\t\tsampling_pattern.push_back(1);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tsampling_pattern.push_back(0);\n\t\t\t}\n\t\t}\n\n\t\tunsigned int first = static_cast<unsigned int>((floor((height - acs) \/ (2 * r))) * r + 1);\n\t\tunsigned int last = first + acs;\n\t\tsampling_pattern[first] = 1;\n\t\twhile (first <= last)\n\t\t{\n\t\t\t++first;\n\t\t\tsampling_pattern[first] = 1;\n\t\t}\n\n\t\tchar * sampling_type = nullptr;\n\t\ttry\n\t\t{\n\t\t\tsampling_type = new char[height];\n\t\t}\n\t\tcatch (bad_alloc&)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t\tmemcpy(sampling_type, sampling_pattern.data(), height * sizeof(char));\n\n\t\tCDimensionsImp dimensions;\n\t\tdimensions(DimensionReadout, 0U, 1)\n\t\t\t(DimensionPhaseEncoding, 0U, height);\n\t\tCSmartPtr<CCharData> outdata(new CCharData(sampling_type, dimensions, nullptr, true));\n\n\t\tFeed(L\"Output\", outdata.get());\n\t}\n\treturn true;\n}\n\nstd::vector<unsigned char> Yap::CSamplingTypeGenerator::GetMinInterferenceSamplingPattern(unsigned int row_count, float pow, float sample_percent, float radius)\n{\n\tfloat min_peak_interference((float)INT_MAX);\n\tvector<float> pdf = GeneratePdf(row_count, pow, sample_percent, radius);\n\n\tvector<unsigned char> min_interference_pattern(pdf.size());\n\tvector<unsigned char> sampling_pattern(pdf.size());\n\tvector<complex<float>> normalized_sampling_pattern(pdf.size());\n\tvector<complex<float>> fft_result(pdf.size());\n\n\tfftwf_plan p = fftwf_plan_dft_1d(int(normalized_sampling_pattern.size()),\n\t\t(fftwf_complex*)normalized_sampling_pattern.data(),\n\t\t(fftwf_complex*)fft_result.data(),\n\t\tFFTW_BACKWARD, FFTW_ESTIMATE);\t\/\/kռ䵽ͼǷҶ任\n\n\tfor (unsigned int i = 0; i < _try_count; ++i)\n\t{\n\t\tfloat sum_vector_element = 0;\n\n\t\tfloat sum_pdf = accumulate(pdf.begin(), pdf.end(), 0.0f);\n\t\twhile (abs(sum_vector_element - sum_pdf) > _tolerance)\n\t\t{\n\t\t\tsum_vector_element = 0;\n\t\t\tfor (unsigned int j = 0; j < pdf.size(); ++j)\n\t\t\t{\n\t\t\t\tsampling_pattern[j] = ((float)rand() \/ (RAND_MAX + 1) * 1) < pdf[j];\n\t\t\t\tsum_vector_element += sampling_pattern[j];\n\t\t\t}\n\t\t}\n\n\t\t\/\/תΪʽ\n\n\t\tfor (unsigned int t = 0; t < pdf.size(); t++)\n\t\t{\n\t\t\tnormalized_sampling_pattern[t] = std::complex<float>(sampling_pattern[t] \/ pdf[t], 0);\n\t\t}\n\t\t\/\/ Ҷ任\n\n\t\tfftwf_execute(p);\n\t\tfor (auto iter = fft_result.begin() + 1; iter != fft_result.end(); ++iter)\n\t\t{\n\t\t\t(*iter) \/= float(sqrt(fft_result.size()));\n\t\t}\n\t\t*(fft_result.data()) = 0;\n\t\tfloat max_value = abs(fft_result[1]);\n\t\tfor (auto it = fft_result.begin() + 1; it != fft_result.end(); ++it)\n\t\t{\n\n\t\t\tif (max_value < abs(*it))\n\t\t\t{\n\t\t\t\tmax_value = abs(*it);\n\t\t\t}\n\t\t}\n\n\t\tif (max_value < min_peak_interference)\n\t\t{\n\t\t\tmin_peak_interference = max_value;\n\t\t\tmin_interference_pattern = sampling_pattern;\n\t\t}\n\t}\n\t\/\/\n\tfftwf_destroy_plan(p);\n\n\treturn min_interference_pattern;\n}\n\nstd::vector<float> Yap::CSamplingTypeGenerator::GeneratePdf(unsigned int row_count, float p, float sample_percent, float radius)\n{\n\tfloat minval = 0.0;\n\tfloat maxval = 1.0;\n\tfloat val = 0.5;\n\tunsigned int line_count = (unsigned int)floor(sample_percent * row_count); \/\/ PCTG = 0.35 * 512 in Matlab\n\tfloat gap = float(2.0 \/ (row_count - 1));\n\n\tstd::vector<float> pdf;\n\n\tpdf = LineSpace(-1, 1, row_count);\n\tstd::vector<unsigned int> pdf_index(row_count);\n\tfor (unsigned int i = 0; i < pdf.size(); ++i)\n\t{\n\t\tpdf_index[i] = 0;\n\t\tif (abs(pdf[i]) < radius)\n\t\t{\n\t\t\tpdf_index[i] = i;\n\t\t}\n\t}\n\n\tfor (unsigned int i = 0; i < pdf.size(); ++i)\n\t{\n\t\tpdf[i] = pow(1 - abs(pdf[i]), p);\n\t\tif (i == pdf_index[i])\n\t\t{\n\t\t\tpdf[i] = 1;\n\t\t}\n\t}\n\n\tfloat sum = accumulate(pdf.begin(), pdf.end(), 0.0f);\n\n\n\tstd::vector<float> pdf_temp;\n\twhile (1)\n\t{\n\t\tval = minval \/ 2 + maxval \/ 2;\n\t\tpdf_temp.erase(pdf_temp.begin(), pdf_temp.end());\n\t\tfor (unsigned int i = 0; i < row_count; ++i)\n\t\t{\n\t\t\tfloat pdf_elem = pdf[i] + val;\n\t\t\tif (pdf_elem > 1.0)\n\t\t\t{\n\t\t\t\tpdf_elem = 1.0;\n\t\t\t}\n\t\t\tpdf_temp.push_back(pdf_elem);\n\t\t}\n\n\t\tsum = floor(accumulate(pdf_temp.begin(), pdf_temp.end(), 0.0f));\n\n\t\tif (floor(sum) > line_count)\n\t\t{\n\t\t\treturn vector<float>(); \/\/pֵƫС\n\t\t}\n\n\t\tif (sum > line_count)\n\t\t{\n\t\t\tmaxval = val;\n\t\t}\n\t\telse if (sum < line_count)\n\t\t{\n\t\t\tminval = val;\n\t\t}\n\t\telse\n\t\t\tbreak;\n\t}\n\treturn pdf_temp;\n}\n\nstd::vector<float> Yap::CSamplingTypeGenerator::LineSpace(float begin, float end, unsigned int count)\n{\n\tstd::vector<float> vec;\n\tfloat current_value = begin;\n\tfloat gap = float(2.0 \/ (count - 1));\n\n\twhile (current_value <= end)\n\t{\n\t\tvec.push_back(current_value);\n\t\tcurrent_value += gap;\n\t}\n\twhile (vec.size() < count)\n\t{\n\t\tvec.push_back(end);\n\t}\n\n\treturn vec;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <folly\/MemoryMapping.h>\n\n#include <algorithm>\n#include <functional>\n#include <utility>\n\n#include <folly\/Format.h>\n#include <folly\/portability\/GFlags.h>\n#include <folly\/portability\/SysMman.h>\n\n#ifdef __linux__\n#include <folly\/experimental\/io\/HugePages.h>\n#endif\n\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <system_error>\n\nDEFINE_int64(mlock_chunk_size, 1 << 20, \/\/ 1MB\n \"Maximum bytes to mlock\/munlock\/munmap at once \"\n \"(will be rounded up to PAGESIZE)\");\n\n#ifndef MAP_POPULATE\n#define MAP_POPULATE 0\n#endif\n\nnamespace folly {\n\nMemoryMapping::MemoryMapping(MemoryMapping&& other) noexcept {\n swap(other);\n}\n\nMemoryMapping::MemoryMapping(File file, off_t offset, off_t length,\n Options options)\n : file_(std::move(file)),\n options_(std::move(options)) {\n CHECK(file_);\n init(offset, length);\n}\n\nMemoryMapping::MemoryMapping(const char* name, off_t offset, off_t length,\n Options options)\n : MemoryMapping(File(name, options.writable ? O_RDWR : O_RDONLY),\n offset,\n length,\n options) { }\n\nMemoryMapping::MemoryMapping(int fd, off_t offset, off_t length,\n Options options)\n : MemoryMapping(File(fd), offset, length, options) { }\n\nMemoryMapping::MemoryMapping(AnonymousType, off_t length, Options options)\n : options_(std::move(options)) {\n init(0, length);\n}\n\nnamespace {\n\n#ifdef __linux__\nvoid getDeviceOptions(dev_t device, off_t& pageSize, bool& autoExtend) {\n auto ps = getHugePageSizeForDevice(device);\n if (ps) {\n pageSize = ps->size;\n autoExtend = true;\n }\n}\n#else\ninline void getDeviceOptions(dev_t device, off_t& pageSize,\n bool& autoExtend) { }\n#endif\n\n} \/\/ namespace\n\nvoid MemoryMapping::init(off_t offset, off_t length) {\n const bool grow = options_.grow;\n const bool anon = !file_;\n CHECK(!(grow && anon));\n\n off_t& pageSize = options_.pageSize;\n\n struct stat st;\n\n \/\/ On Linux, hugetlbfs file systems don't require ftruncate() to grow the\n \/\/ file, and (on kernels before 2.6.24) don't even allow it. Also, the file\n \/\/ size is always a multiple of the page size.\n bool autoExtend = false;\n\n if (!anon) {\n \/\/ Stat the file\n CHECK_ERR(fstat(file_.fd(), &st));\n\n if (pageSize == 0) {\n getDeviceOptions(st.st_dev, pageSize, autoExtend);\n }\n } else {\n DCHECK(!file_);\n DCHECK_EQ(offset, 0);\n CHECK_EQ(pageSize, 0);\n CHECK_GE(length, 0);\n }\n\n if (pageSize == 0) {\n pageSize = sysconf(_SC_PAGESIZE);\n }\n\n CHECK_GT(pageSize, 0);\n CHECK_EQ(pageSize & (pageSize - 1), 0); \/\/ power of two\n CHECK_GE(offset, 0);\n\n \/\/ Round down the start of the mapped region\n size_t skipStart = offset % pageSize;\n offset -= skipStart;\n\n mapLength_ = length;\n if (mapLength_ != -1) {\n mapLength_ += skipStart;\n\n \/\/ Round up the end of the mapped region\n mapLength_ = (mapLength_ + pageSize - 1) \/ pageSize * pageSize;\n }\n\n off_t remaining = anon ? length : st.st_size - offset;\n\n if (mapLength_ == -1) {\n length = mapLength_ = remaining;\n } else {\n if (length > remaining) {\n if (grow) {\n if (!autoExtend) {\n PCHECK(0 == ftruncate(file_.fd(), offset + length))\n << \"ftruncate() failed, couldn't grow file to \"\n << offset + length;\n remaining = length;\n } else {\n \/\/ Extend mapping to multiple of page size, don't use ftruncate\n remaining = mapLength_;\n }\n } else {\n length = remaining;\n }\n }\n if (mapLength_ > remaining) {\n mapLength_ = remaining;\n }\n }\n\n if (length == 0) {\n mapLength_ = 0;\n mapStart_ = nullptr;\n } else {\n int flags = options_.shared ? MAP_SHARED : MAP_PRIVATE;\n if (anon) flags |= MAP_ANONYMOUS;\n if (options_.prefault) flags |= MAP_POPULATE;\n\n \/\/ The standard doesn't actually require PROT_NONE to be zero...\n int prot = PROT_NONE;\n if (options_.readable || options_.writable) {\n prot = ((options_.readable ? PROT_READ : 0) |\n (options_.writable ? PROT_WRITE : 0));\n }\n\n unsigned char* start = static_cast<unsigned char*>(\n mmap(options_.address, mapLength_, prot, flags, file_.fd(), offset));\n PCHECK(start != MAP_FAILED)\n << \" offset=\" << offset\n << \" length=\" << mapLength_;\n mapStart_ = start;\n data_.reset(start + skipStart, length);\n }\n}\n\nnamespace {\n\noff_t memOpChunkSize(off_t length, off_t pageSize) {\n off_t chunkSize = length;\n if (FLAGS_mlock_chunk_size <= 0) {\n return chunkSize;\n }\n\n chunkSize = FLAGS_mlock_chunk_size;\n off_t r = chunkSize % pageSize;\n if (r) {\n chunkSize += (pageSize - r);\n }\n return chunkSize;\n}\n\n\/**\n * Run @op in chunks over the buffer @mem of @bufSize length.\n *\n * Return:\n * - success: true + amountSucceeded == bufSize (op success on whole buffer)\n * - failure: false + amountSucceeded == nr bytes on which op succeeded.\n *\/\nbool memOpInChunks(std::function<int(void*, size_t)> op,\n void* mem, size_t bufSize, off_t pageSize,\n size_t& amountSucceeded) {\n#ifdef _MSC_VER\n \/\/ MSVC doesn't have this problem, and calling munmap many times\n \/\/ with the same address is a bad idea with the windows implementation.\n int ret = op(mem, bufSize);\n if (ret == 0) {\n amountSucceeded = bufSize;\n }\n return ret == 0;\n#else\n \/\/ unmap\/mlock\/munlock take a kernel semaphore and block other threads from\n \/\/ doing other memory operations. If the size of the buffer is big the\n \/\/ semaphore can be down for seconds (for benchmarks see\n \/\/ http:\/\/kostja-osipov.livejournal.com\/42963.html). Doing the operations in\n \/\/ chunks breaks the locking into intervals and lets other threads do memory\n \/\/ operations of their own.\n\n size_t chunkSize = memOpChunkSize(bufSize, pageSize);\n\n char* addr = static_cast<char*>(mem);\n amountSucceeded = 0;\n\n while (amountSucceeded < bufSize) {\n size_t size = std::min(chunkSize, bufSize - amountSucceeded);\n if (op(addr + amountSucceeded, size) != 0) {\n return false;\n }\n amountSucceeded += size;\n }\n\n return true;\n#endif\n}\n\n} \/\/ anonymous namespace\n\nbool MemoryMapping::mlock(LockMode lock) {\n size_t amountSucceeded = 0;\n locked_ = memOpInChunks(::mlock, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded);\n if (locked_) {\n return true;\n }\n\n auto msg =\n folly::sformat(\"mlock({}) failed at {}\", mapLength_, amountSucceeded);\n\n if (lock == LockMode::TRY_LOCK && (errno == EPERM || errno == ENOMEM)) {\n PLOG(WARNING) << msg;\n } else {\n PLOG(FATAL) << msg;\n }\n\n#ifndef _MSC_VER\n \/\/ only part of the buffer was mlocked, unlock it back\n if (!memOpInChunks(::munlock, mapStart_, amountSucceeded, options_.pageSize,\n amountSucceeded)) {\n PLOG(WARNING) << \"munlock()\";\n }\n#endif\n\n return false;\n}\n\nvoid MemoryMapping::munlock(bool dontneed) {\n if (!locked_) return;\n\n size_t amountSucceeded = 0;\n if (!memOpInChunks(::munlock, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded)) {\n PLOG(WARNING) << \"munlock()\";\n }\n if (mapLength_ && dontneed &&\n ::madvise(mapStart_, mapLength_, MADV_DONTNEED)) {\n PLOG(WARNING) << \"madvise()\";\n }\n locked_ = false;\n}\n\nvoid MemoryMapping::hintLinearScan() {\n advise(MADV_SEQUENTIAL);\n}\n\nMemoryMapping::~MemoryMapping() {\n if (mapLength_) {\n size_t amountSucceeded = 0;\n if (!memOpInChunks(::munmap, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded)) {\n PLOG(FATAL) << folly::format(\"munmap({}) failed at {}\",\n mapLength_, amountSucceeded);\n }\n }\n}\n\nvoid MemoryMapping::advise(int advice) const { advise(advice, 0, mapLength_); }\n\nvoid MemoryMapping::advise(int advice, size_t offset, size_t length) const {\n CHECK_LE(offset + length, mapLength_)\n << \" offset: \" << offset\n << \" length: \" << length\n << \" mapLength_: \" << mapLength_;\n\n \/\/ Include the entire start page: round down to page boundary.\n const auto offMisalign = offset % options_.pageSize;\n offset -= offMisalign;\n length += offMisalign;\n\n \/\/ Round the last page down to page boundary.\n if (offset + length != size_t(mapLength_)) {\n length -= length % options_.pageSize;\n }\n\n if (length == 0) {\n return;\n }\n\n char* mapStart = static_cast<char*>(mapStart_) + offset;\n PLOG_IF(WARNING, ::madvise(mapStart, length, advice)) << \"madvise\";\n}\n\nMemoryMapping& MemoryMapping::operator=(MemoryMapping other) {\n swap(other);\n return *this;\n}\n\nvoid MemoryMapping::swap(MemoryMapping& other) noexcept {\n using std::swap;\n swap(this->file_, other.file_);\n swap(this->mapStart_, other.mapStart_);\n swap(this->mapLength_, other.mapLength_);\n swap(this->options_, other.options_);\n swap(this->locked_, other.locked_);\n swap(this->data_, other.data_);\n}\n\nvoid swap(MemoryMapping& a, MemoryMapping& b) noexcept { a.swap(b); }\n\nvoid alignedForwardMemcpy(void* dst, const void* src, size_t size) {\n assert(reinterpret_cast<uintptr_t>(src) % alignof(unsigned long) == 0);\n assert(reinterpret_cast<uintptr_t>(dst) % alignof(unsigned long) == 0);\n\n auto srcl = static_cast<const unsigned long*>(src);\n auto dstl = static_cast<unsigned long*>(dst);\n\n while (size >= sizeof(unsigned long)) {\n *dstl++ = *srcl++;\n size -= sizeof(unsigned long);\n }\n\n auto srcc = reinterpret_cast<const unsigned char*>(srcl);\n auto dstc = reinterpret_cast<unsigned char*>(dstl);\n\n while (size != 0) {\n *dstc++ = *srcc++;\n --size;\n }\n}\n\nvoid mmapFileCopy(const char* src, const char* dest, mode_t mode) {\n MemoryMapping srcMap(src);\n srcMap.hintLinearScan();\n\n MemoryMapping destMap(\n File(dest, O_RDWR | O_CREAT | O_TRUNC, mode),\n 0,\n srcMap.range().size(),\n MemoryMapping::writable());\n\n alignedForwardMemcpy(destMap.writableRange().data(),\n srcMap.range().data(),\n srcMap.range().size());\n}\n\n} \/\/ namespace folly\n<commit_msg>folly: MemoryMapping: isolate _MSC_VER-related changes<commit_after>\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <folly\/MemoryMapping.h>\n\n#include <algorithm>\n#include <functional>\n#include <utility>\n\n#include <folly\/Format.h>\n#include <folly\/portability\/GFlags.h>\n#include <folly\/portability\/SysMman.h>\n\n#ifdef __linux__\n#include <folly\/experimental\/io\/HugePages.h>\n#endif\n\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <system_error>\n\nstatic constexpr ssize_t kDefaultMlockChunkSize =\n#ifndef _MSC_VER\n \/\/ Linux implementations of unmap\/mlock\/munlock take a kernel\n \/\/ semaphore and block other threads from doing other memory\n \/\/ operations. Split the operations in chunks.\n (1 << 20) \/\/ 1MB\n#else \/\/ _MSC_VER\n \/\/ MSVC doesn't have this problem, and calling munmap many times\n \/\/ with the same address is a bad idea with the windows implementation.\n (-1)\n#endif \/\/ _MSC_VER\n ;\n\nDEFINE_int64(mlock_chunk_size, kDefaultMlockChunkSize,\n \"Maximum bytes to mlock\/munlock\/munmap at once \"\n \"(will be rounded up to PAGESIZE). Ignored if negative.\");\n\n#ifndef MAP_POPULATE\n#define MAP_POPULATE 0\n#endif\n\nnamespace folly {\n\nMemoryMapping::MemoryMapping(MemoryMapping&& other) noexcept {\n swap(other);\n}\n\nMemoryMapping::MemoryMapping(File file, off_t offset, off_t length,\n Options options)\n : file_(std::move(file)),\n options_(std::move(options)) {\n CHECK(file_);\n init(offset, length);\n}\n\nMemoryMapping::MemoryMapping(const char* name, off_t offset, off_t length,\n Options options)\n : MemoryMapping(File(name, options.writable ? O_RDWR : O_RDONLY),\n offset,\n length,\n options) { }\n\nMemoryMapping::MemoryMapping(int fd, off_t offset, off_t length,\n Options options)\n : MemoryMapping(File(fd), offset, length, options) { }\n\nMemoryMapping::MemoryMapping(AnonymousType, off_t length, Options options)\n : options_(std::move(options)) {\n init(0, length);\n}\n\nnamespace {\n\n#ifdef __linux__\nvoid getDeviceOptions(dev_t device, off_t& pageSize, bool& autoExtend) {\n auto ps = getHugePageSizeForDevice(device);\n if (ps) {\n pageSize = ps->size;\n autoExtend = true;\n }\n}\n#else\ninline void getDeviceOptions(dev_t device, off_t& pageSize,\n bool& autoExtend) { }\n#endif\n\n} \/\/ namespace\n\nvoid MemoryMapping::init(off_t offset, off_t length) {\n const bool grow = options_.grow;\n const bool anon = !file_;\n CHECK(!(grow && anon));\n\n off_t& pageSize = options_.pageSize;\n\n struct stat st;\n\n \/\/ On Linux, hugetlbfs file systems don't require ftruncate() to grow the\n \/\/ file, and (on kernels before 2.6.24) don't even allow it. Also, the file\n \/\/ size is always a multiple of the page size.\n bool autoExtend = false;\n\n if (!anon) {\n \/\/ Stat the file\n CHECK_ERR(fstat(file_.fd(), &st));\n\n if (pageSize == 0) {\n getDeviceOptions(st.st_dev, pageSize, autoExtend);\n }\n } else {\n DCHECK(!file_);\n DCHECK_EQ(offset, 0);\n CHECK_EQ(pageSize, 0);\n CHECK_GE(length, 0);\n }\n\n if (pageSize == 0) {\n pageSize = sysconf(_SC_PAGESIZE);\n }\n\n CHECK_GT(pageSize, 0);\n CHECK_EQ(pageSize & (pageSize - 1), 0); \/\/ power of two\n CHECK_GE(offset, 0);\n\n \/\/ Round down the start of the mapped region\n size_t skipStart = offset % pageSize;\n offset -= skipStart;\n\n mapLength_ = length;\n if (mapLength_ != -1) {\n mapLength_ += skipStart;\n\n \/\/ Round up the end of the mapped region\n mapLength_ = (mapLength_ + pageSize - 1) \/ pageSize * pageSize;\n }\n\n off_t remaining = anon ? length : st.st_size - offset;\n\n if (mapLength_ == -1) {\n length = mapLength_ = remaining;\n } else {\n if (length > remaining) {\n if (grow) {\n if (!autoExtend) {\n PCHECK(0 == ftruncate(file_.fd(), offset + length))\n << \"ftruncate() failed, couldn't grow file to \"\n << offset + length;\n remaining = length;\n } else {\n \/\/ Extend mapping to multiple of page size, don't use ftruncate\n remaining = mapLength_;\n }\n } else {\n length = remaining;\n }\n }\n if (mapLength_ > remaining) {\n mapLength_ = remaining;\n }\n }\n\n if (length == 0) {\n mapLength_ = 0;\n mapStart_ = nullptr;\n } else {\n int flags = options_.shared ? MAP_SHARED : MAP_PRIVATE;\n if (anon) flags |= MAP_ANONYMOUS;\n if (options_.prefault) flags |= MAP_POPULATE;\n\n \/\/ The standard doesn't actually require PROT_NONE to be zero...\n int prot = PROT_NONE;\n if (options_.readable || options_.writable) {\n prot = ((options_.readable ? PROT_READ : 0) |\n (options_.writable ? PROT_WRITE : 0));\n }\n\n unsigned char* start = static_cast<unsigned char*>(\n mmap(options_.address, mapLength_, prot, flags, file_.fd(), offset));\n PCHECK(start != MAP_FAILED)\n << \" offset=\" << offset\n << \" length=\" << mapLength_;\n mapStart_ = start;\n data_.reset(start + skipStart, length);\n }\n}\n\nnamespace {\n\noff_t memOpChunkSize(off_t length, off_t pageSize) {\n off_t chunkSize = length;\n if (FLAGS_mlock_chunk_size <= 0) {\n return chunkSize;\n }\n\n chunkSize = FLAGS_mlock_chunk_size;\n off_t r = chunkSize % pageSize;\n if (r) {\n chunkSize += (pageSize - r);\n }\n return chunkSize;\n}\n\n\/**\n * Run @op in chunks over the buffer @mem of @bufSize length.\n *\n * Return:\n * - success: true + amountSucceeded == bufSize (op success on whole buffer)\n * - failure: false + amountSucceeded == nr bytes on which op succeeded.\n *\/\nbool memOpInChunks(std::function<int(void*, size_t)> op,\n void* mem, size_t bufSize, off_t pageSize,\n size_t& amountSucceeded) {\n \/\/ Linux' unmap\/mlock\/munlock take a kernel semaphore and block other threads\n \/\/ from doing other memory operations. If the size of the buffer is big the\n \/\/ semaphore can be down for seconds (for benchmarks see\n \/\/ http:\/\/kostja-osipov.livejournal.com\/42963.html). Doing the operations in\n \/\/ chunks breaks the locking into intervals and lets other threads do memory\n \/\/ operations of their own.\n\n size_t chunkSize = memOpChunkSize(bufSize, pageSize);\n\n char* addr = static_cast<char*>(mem);\n amountSucceeded = 0;\n\n while (amountSucceeded < bufSize) {\n size_t size = std::min(chunkSize, bufSize - amountSucceeded);\n if (op(addr + amountSucceeded, size) != 0) {\n return false;\n }\n amountSucceeded += size;\n }\n\n return true;\n}\n\n} \/\/ anonymous namespace\n\nbool MemoryMapping::mlock(LockMode lock) {\n size_t amountSucceeded = 0;\n locked_ = memOpInChunks(::mlock, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded);\n if (locked_) {\n return true;\n }\n\n auto msg =\n folly::sformat(\"mlock({}) failed at {}\", mapLength_, amountSucceeded);\n\n if (lock == LockMode::TRY_LOCK && (errno == EPERM || errno == ENOMEM)) {\n PLOG(WARNING) << msg;\n } else {\n PLOG(FATAL) << msg;\n }\n\n \/\/ only part of the buffer was mlocked, unlock it back\n if (!memOpInChunks(::munlock, mapStart_, amountSucceeded, options_.pageSize,\n amountSucceeded)) {\n PLOG(WARNING) << \"munlock()\";\n }\n\n return false;\n}\n\nvoid MemoryMapping::munlock(bool dontneed) {\n if (!locked_) return;\n\n size_t amountSucceeded = 0;\n if (!memOpInChunks(::munlock, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded)) {\n PLOG(WARNING) << \"munlock()\";\n }\n if (mapLength_ && dontneed &&\n ::madvise(mapStart_, mapLength_, MADV_DONTNEED)) {\n PLOG(WARNING) << \"madvise()\";\n }\n locked_ = false;\n}\n\nvoid MemoryMapping::hintLinearScan() {\n advise(MADV_SEQUENTIAL);\n}\n\nMemoryMapping::~MemoryMapping() {\n if (mapLength_) {\n size_t amountSucceeded = 0;\n if (!memOpInChunks(::munmap, mapStart_, mapLength_, options_.pageSize,\n amountSucceeded)) {\n PLOG(FATAL) << folly::format(\"munmap({}) failed at {}\",\n mapLength_, amountSucceeded);\n }\n }\n}\n\nvoid MemoryMapping::advise(int advice) const { advise(advice, 0, mapLength_); }\n\nvoid MemoryMapping::advise(int advice, size_t offset, size_t length) const {\n CHECK_LE(offset + length, mapLength_)\n << \" offset: \" << offset\n << \" length: \" << length\n << \" mapLength_: \" << mapLength_;\n\n \/\/ Include the entire start page: round down to page boundary.\n const auto offMisalign = offset % options_.pageSize;\n offset -= offMisalign;\n length += offMisalign;\n\n \/\/ Round the last page down to page boundary.\n if (offset + length != size_t(mapLength_)) {\n length -= length % options_.pageSize;\n }\n\n if (length == 0) {\n return;\n }\n\n char* mapStart = static_cast<char*>(mapStart_) + offset;\n PLOG_IF(WARNING, ::madvise(mapStart, length, advice)) << \"madvise\";\n}\n\nMemoryMapping& MemoryMapping::operator=(MemoryMapping other) {\n swap(other);\n return *this;\n}\n\nvoid MemoryMapping::swap(MemoryMapping& other) noexcept {\n using std::swap;\n swap(this->file_, other.file_);\n swap(this->mapStart_, other.mapStart_);\n swap(this->mapLength_, other.mapLength_);\n swap(this->options_, other.options_);\n swap(this->locked_, other.locked_);\n swap(this->data_, other.data_);\n}\n\nvoid swap(MemoryMapping& a, MemoryMapping& b) noexcept { a.swap(b); }\n\nvoid alignedForwardMemcpy(void* dst, const void* src, size_t size) {\n assert(reinterpret_cast<uintptr_t>(src) % alignof(unsigned long) == 0);\n assert(reinterpret_cast<uintptr_t>(dst) % alignof(unsigned long) == 0);\n\n auto srcl = static_cast<const unsigned long*>(src);\n auto dstl = static_cast<unsigned long*>(dst);\n\n while (size >= sizeof(unsigned long)) {\n *dstl++ = *srcl++;\n size -= sizeof(unsigned long);\n }\n\n auto srcc = reinterpret_cast<const unsigned char*>(srcl);\n auto dstc = reinterpret_cast<unsigned char*>(dstl);\n\n while (size != 0) {\n *dstc++ = *srcc++;\n --size;\n }\n}\n\nvoid mmapFileCopy(const char* src, const char* dest, mode_t mode) {\n MemoryMapping srcMap(src);\n srcMap.hintLinearScan();\n\n MemoryMapping destMap(\n File(dest, O_RDWR | O_CREAT | O_TRUNC, mode),\n 0,\n srcMap.range().size(),\n MemoryMapping::writable());\n\n alignedForwardMemcpy(destMap.writableRange().data(),\n srcMap.range().data(),\n srcMap.range().size());\n}\n\n} \/\/ namespace folly\n<|endoftext|>"} {"text":"<commit_before>\/*$Id$\n *\n * This source file is a part of the Berlin Project.\n * Copyright (C) 1999 Stefan Seefeld <stefan@berlin-consortium.org> \n * http:\/\/www.berlin-consortium.org\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this library; if not, write to the\n * Free Software Foundation, Inc., 675 Mass Ave, Cambridge,\n * MA 02139, USA.\n *\/\n#ifndef _PolyGraphic_hh\n#define _PolyGraphic_hh\n\n#include <Berlin\/GraphicImpl.hh>\n#include <Berlin\/Pool.hh>\n#include <vector>\n\nclass PolyGraphic : public GraphicImpl\n{\n class Iterator;\n friend class Iterator;\npublic:\n PolyGraphic();\n virtual ~PolyGraphic();\n\n virtual void append_graphic(Warsaw::Graphic_ptr);\n virtual void prepend_graphic(Warsaw::Graphic_ptr);\n virtual void remove_graphic(Warsaw::Tag);\n virtual void remove_child_graphic(Warsaw::Tag);\n virtual Warsaw::Graphic::Iterator_ptr first_child_graphic();\n virtual Warsaw::Graphic::Iterator_ptr last_child_graphic();\n\n virtual void need_resize();\n virtual void need_resize(Warsaw::Tag);\nprotected:\n CORBA::Long num_children();\n Warsaw::Tag unique_child_id();\n glist_t::iterator child_id_to_iterator(Warsaw::Tag);\n CORBA::Long child_id_to_index(Warsaw::Tag);\n Warsaw::Graphic::Requisition *children_requests();\n void deallocate_requisitions(Warsaw::Graphic::Requisition *);\n void child_extension(size_t, const Warsaw::Allocation::Info &, Warsaw::Region_ptr);\n\/\/ private:\n static Pool<Warsaw::Graphic::Requisition> _pool;\n glist_t _children;\n Prague::Mutex _mutex;\n};\n\n\/*\n * the following methods are inlined for speed.\n * Attention : they must be used within a PolyGraphic::childMutex locked section !\n *\/\ninline Warsaw::Tag PolyGraphic::unique_child_id()\n{\n Warsaw::Tag localId = 0;\n do\n if (find_if(_children.begin(), _children.end(), localId_eq(localId)) == _children.end())\n return localId;\n while(++localId);\n}\n\ninline PolyGraphic::glist_t::iterator PolyGraphic::child_id_to_iterator(Warsaw::Tag localId)\n{\n return find_if(_children.begin(), _children.end(), localId_eq(localId));\n}\n\ninline CORBA::Long PolyGraphic::child_id_to_index(Warsaw::Tag localId)\n{\n return find_if(_children.begin(), _children.end(), localId_eq(localId)) - _children.begin();\n}\n\n#endif \n<commit_msg>(unique_child_id): Rewritten to silence a compiler warning about control reaching the end of non-void function.<commit_after>\/*$Id$\n *\n * This source file is a part of the Berlin Project.\n * Copyright (C) 1999 Stefan Seefeld <stefan@berlin-consortium.org> \n * http:\/\/www.berlin-consortium.org\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public\n * License along with this library; if not, write to the\n * Free Software Foundation, Inc., 675 Mass Ave, Cambridge,\n * MA 02139, USA.\n *\/\n#ifndef _PolyGraphic_hh\n#define _PolyGraphic_hh\n\n#include <Berlin\/GraphicImpl.hh>\n#include <Berlin\/Pool.hh>\n#include <vector>\n\nclass PolyGraphic : public GraphicImpl\n{\n class Iterator;\n friend class Iterator;\npublic:\n PolyGraphic();\n virtual ~PolyGraphic();\n\n virtual void append_graphic(Warsaw::Graphic_ptr);\n virtual void prepend_graphic(Warsaw::Graphic_ptr);\n virtual void remove_graphic(Warsaw::Tag);\n virtual void remove_child_graphic(Warsaw::Tag);\n virtual Warsaw::Graphic::Iterator_ptr first_child_graphic();\n virtual Warsaw::Graphic::Iterator_ptr last_child_graphic();\n\n virtual void need_resize();\n virtual void need_resize(Warsaw::Tag);\nprotected:\n CORBA::Long num_children();\n Warsaw::Tag unique_child_id();\n glist_t::iterator child_id_to_iterator(Warsaw::Tag);\n CORBA::Long child_id_to_index(Warsaw::Tag);\n Warsaw::Graphic::Requisition *children_requests();\n void deallocate_requisitions(Warsaw::Graphic::Requisition *);\n void child_extension(size_t, const Warsaw::Allocation::Info &, Warsaw::Region_ptr);\n\/\/ private:\n static Pool<Warsaw::Graphic::Requisition> _pool;\n glist_t _children;\n Prague::Mutex _mutex;\n};\n\n\/*\n * the following methods are inlined for speed.\n * Attention : they must be used within a PolyGraphic::childMutex locked section !\n *\/\ninline Warsaw::Tag PolyGraphic::unique_child_id()\n{\n Warsaw::Tag localId;\n for (localId = 0;\n find_if (_children.begin(), _children.end(), localId_eq(localId)) != _children.end();\n localId++);\n return localId;\n}\n\ninline PolyGraphic::glist_t::iterator PolyGraphic::child_id_to_iterator(Warsaw::Tag localId)\n{\n return find_if(_children.begin(), _children.end(), localId_eq(localId));\n}\n\ninline CORBA::Long PolyGraphic::child_id_to_index(Warsaw::Tag localId)\n{\n return find_if(_children.begin(), _children.end(), localId_eq(localId)) - _children.begin();\n}\n\n#endif \n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"object_search_msgs\/Label.h\"\n#include \"object_search_msgs\/Task.h\"\n#include \"pcl\/point_cloud.h\"\n#include \"pcl\/point_types.h\"\n#include \"rapid_db\/name_db.hpp\"\n#include \"rapid_msgs\/LandmarkInfo.h\"\n#include \"rapid_perception\/conversions.h\"\n#include \"rapid_perception\/pose_estimation.h\"\n#include \"rapid_perception\/random_heat_mapper.h\"\n#include \"rapid_ros\/publisher.h\"\n#include \"ros\/ros.h\"\n#include \"sensor_msgs\/PointCloud2.h\"\n#include \"visualization_msgs\/Marker.h\"\n\n#include \"object_search\/experiment.h\"\n#include \"object_search\/object_search.h\"\n\nusing object_search::ExperimentDbs;\nusing rapid::perception::PoseEstimationMatch;\nusing rapid::perception::PoseEstimator;\nusing sensor_msgs::PointCloud2;\nusing visualization_msgs::Marker;\nusing pcl::PointCloud;\nusing pcl::PointXYZRGB;\n\ntypedef PointCloud<PointXYZRGB> PointC;\n\nvoid RunExperiment(PoseEstimator* estimator,\n const std::vector<std::string>& task_list,\n const ExperimentDbs& dbs);\n\nint main(int argc, char** argv) {\n ros::init(argc, argv, \"object_search_experiment\");\n ros::NodeHandle nh;\n\n \/\/ Build DBs\n rapid::db::NameDb task_db(nh, \"custom_landmarks\", \"tasks\");\n rapid::db::NameDb scene_db(nh, \"custom_landmarks\", \"scenes\");\n rapid::db::NameDb scene_cloud_db(nh, \"custom_landmarks\", \"scene_clouds\");\n rapid::db::NameDb landmark_db(nh, \"custom_landmarks\", \"landmarks\");\n rapid::db::NameDb landmark_cloud_db(nh, \"custom_landmarks\",\n \"landmark_clouds\");\n ExperimentDbs dbs;\n dbs.task_db = &task_db;\n dbs.scene_db = &scene_db;\n dbs.scene_cloud_db = &scene_cloud_db;\n dbs.landmark_db = &landmark_db;\n dbs.landmark_cloud_db = &landmark_cloud_db;\n\n \/\/ Build estimator\n \/\/ Visualization publishers\n ros::Publisher landmark_pub = nh.advertise<PointCloud2>(\"\/landmark\", 1, true);\n ros::Publisher scene_pub = nh.advertise<PointCloud2>(\"\/scene\", 1, true);\n ros::Publisher heatmap_pub = nh.advertise<PointCloud2>(\"\/heatmap\", 1, true);\n ros::Publisher candidates_pub =\n nh.advertise<PointCloud2>(\"\/candidate_samples\", 1, true);\n ros::Publisher alignment_pub =\n nh.advertise<PointCloud2>(\"\/alignment\", 1, true);\n ros::Publisher output_pub = nh.advertise<PointCloud2>(\"\/output\", 1, true);\n rapid_ros::Publisher<Marker> marker_pub(\n nh.advertise<Marker>(\"\/visualization_markers\", 1, true));\n\n rapid::perception::RandomHeatMapper heat_mapper;\n heat_mapper.set_name(\"random\");\n heat_mapper.set_heatmap_publisher(heatmap_pub);\n rapid::perception::PoseEstimator custom(&heat_mapper);\n custom.set_candidates_publisher(candidates_pub);\n custom.set_alignment_publisher(alignment_pub);\n custom.set_marker_publisher(&marker_pub);\n\n \/\/ Read tasks from the parameter server\n std::vector<std::string> task_list;\n nh.getParam(\"experiment_tasks\", task_list);\n\n RunExperiment(&custom, task_list, dbs);\n\n ros::spin();\n return 0;\n}\n\nvoid RunExperiment(PoseEstimator* estimator,\n const std::vector<std::string>& task_list,\n const ExperimentDbs& dbs) {\n for (size_t task_i = 0; task_i < task_list.size(); ++task_i) {\n const std::string& task_name = task_list[task_i];\n object_search_msgs::Task task;\n if (!dbs.task_db->Get(task_name, &task)) {\n std::cerr << \"Error getting task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n sensor_msgs::PointCloud2 scene_cloud;\n if (!dbs.scene_cloud_db->Get(task.scene_name, &scene_cloud)) {\n std::cerr << \"Error getting scene cloud \\\"\" << task.scene_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n std::set<std::string> landmarks;\n for (size_t li = 0; li < task.labels.size(); ++li) {\n const object_search_msgs::Label& label = task.labels[li];\n landmarks.insert(label.landmark_name);\n }\n\n for (std::set<std::string>::iterator landmark_name = landmarks.begin();\n landmark_name != landmarks.end(); ++landmark_name) {\n rapid_msgs::LandmarkInfo landmark_info;\n if (!dbs.landmark_db->Get(*landmark_name, &landmark_info)) {\n std::cerr << \"Error getting landmark info \\\"\" << *landmark_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n sensor_msgs::PointCloud2 landmark_cloud;\n if (!dbs.landmark_cloud_db->Get(*landmark_name, &landmark_cloud)) {\n std::cerr << \"Error getting landmark cloud \\\"\" << *landmark_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n object_search::UpdateEstimatorParams(estimator);\n\n PointC::Ptr scene = rapid::perception::PclFromRos(scene_cloud);\n estimator->set_scene(scene);\n PointC::Ptr landmark = rapid::perception::PclFromRos(landmark_cloud);\n estimator->set_object(landmark);\n estimator->set_roi(landmark_info.roi);\n\n std::vector<rapid::perception::PoseEstimationMatch> matches;\n estimator->Find(&matches);\n\n \/\/ Compute precision\/recall\n \/\/ TODO: complete this\n }\n }\n}\n<commit_msg>Compute precision\/recall of experiment.<commit_after>#include <iostream>\n#include <set>\n#include <string>\n#include <vector>\n\n#include \"object_search_msgs\/Label.h\"\n#include \"object_search_msgs\/Task.h\"\n#include \"pcl\/point_cloud.h\"\n#include \"pcl\/point_types.h\"\n#include \"rapid_db\/name_db.hpp\"\n#include \"rapid_msgs\/LandmarkInfo.h\"\n#include \"rapid_perception\/conversions.h\"\n#include \"rapid_perception\/pose_estimation.h\"\n#include \"rapid_perception\/random_heat_mapper.h\"\n#include \"rapid_ros\/publisher.h\"\n#include \"ros\/ros.h\"\n#include \"sensor_msgs\/PointCloud2.h\"\n#include \"visualization_msgs\/Marker.h\"\n\n#include \"object_search\/experiment.h\"\n#include \"object_search\/object_search.h\"\n\nusing object_search::ExperimentDbs;\nusing rapid::perception::PoseEstimationMatch;\nusing rapid::perception::PoseEstimator;\nusing sensor_msgs::PointCloud2;\nusing visualization_msgs::Marker;\nusing pcl::PointCloud;\nusing pcl::PointXYZRGB;\n\ntypedef PointCloud<PointXYZRGB> PointC;\n\nvoid RunExperiment(PoseEstimator* estimator,\n const std::vector<std::string>& task_list,\n const ExperimentDbs& dbs);\nint MatchLabels(const std::vector<object_search_msgs::Label>& labels,\n const PoseEstimationMatch& match);\n\nint main(int argc, char** argv) {\n ros::init(argc, argv, \"object_search_experiment\");\n ros::NodeHandle nh;\n\n \/\/ Build DBs\n rapid::db::NameDb task_db(nh, \"custom_landmarks\", \"tasks\");\n rapid::db::NameDb scene_db(nh, \"custom_landmarks\", \"scenes\");\n rapid::db::NameDb scene_cloud_db(nh, \"custom_landmarks\", \"scene_clouds\");\n rapid::db::NameDb landmark_db(nh, \"custom_landmarks\", \"landmarks\");\n rapid::db::NameDb landmark_cloud_db(nh, \"custom_landmarks\",\n \"landmark_clouds\");\n ExperimentDbs dbs;\n dbs.task_db = &task_db;\n dbs.scene_db = &scene_db;\n dbs.scene_cloud_db = &scene_cloud_db;\n dbs.landmark_db = &landmark_db;\n dbs.landmark_cloud_db = &landmark_cloud_db;\n\n \/\/ Build estimator\n \/\/ Visualization publishers\n ros::Publisher landmark_pub = nh.advertise<PointCloud2>(\"\/landmark\", 1, true);\n ros::Publisher scene_pub = nh.advertise<PointCloud2>(\"\/scene\", 1, true);\n ros::Publisher heatmap_pub = nh.advertise<PointCloud2>(\"\/heatmap\", 1, true);\n ros::Publisher candidates_pub =\n nh.advertise<PointCloud2>(\"\/candidate_samples\", 1, true);\n ros::Publisher alignment_pub =\n nh.advertise<PointCloud2>(\"\/alignment\", 1, true);\n ros::Publisher output_pub = nh.advertise<PointCloud2>(\"\/output\", 1, true);\n rapid_ros::Publisher<Marker> marker_pub(\n nh.advertise<Marker>(\"\/visualization_markers\", 1, true));\n\n rapid::perception::RandomHeatMapper heat_mapper;\n heat_mapper.set_name(\"random\");\n heat_mapper.set_heatmap_publisher(heatmap_pub);\n rapid::perception::PoseEstimator custom(&heat_mapper);\n custom.set_candidates_publisher(candidates_pub);\n custom.set_alignment_publisher(alignment_pub);\n custom.set_marker_publisher(&marker_pub);\n\n \/\/ Read tasks from the parameter server\n std::vector<std::string> task_list;\n nh.getParam(\"experiment_tasks\", task_list);\n\n RunExperiment(&custom, task_list, dbs);\n\n return 0;\n}\n\nvoid RunExperiment(PoseEstimator* estimator,\n const std::vector<std::string>& task_list,\n const ExperimentDbs& dbs) {\n object_search::ConfusionMatrix results;\n for (size_t task_i = 0; task_i < task_list.size(); ++task_i) {\n const std::string& task_name = task_list[task_i];\n object_search_msgs::Task task;\n if (!dbs.task_db->Get(task_name, &task)) {\n std::cerr << \"Error getting task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n sensor_msgs::PointCloud2 scene_cloud;\n if (!dbs.scene_cloud_db->Get(task.scene_name, &scene_cloud)) {\n std::cerr << \"Error getting scene cloud \\\"\" << task.scene_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n std::set<std::string> landmarks;\n for (size_t li = 0; li < task.labels.size(); ++li) {\n const object_search_msgs::Label& label = task.labels[li];\n landmarks.insert(label.landmark_name);\n }\n\n object_search::ConfusionMatrix task_results;\n for (std::set<std::string>::iterator landmark_name = landmarks.begin();\n landmark_name != landmarks.end(); ++landmark_name) {\n rapid_msgs::LandmarkInfo landmark_info;\n if (!dbs.landmark_db->Get(*landmark_name, &landmark_info)) {\n std::cerr << \"Error getting landmark info \\\"\" << *landmark_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n sensor_msgs::PointCloud2 landmark_cloud;\n if (!dbs.landmark_cloud_db->Get(*landmark_name, &landmark_cloud)) {\n std::cerr << \"Error getting landmark cloud \\\"\" << *landmark_name\n << \"\\\" for task \\\"\" << task_name << \"\\\", skipping.\"\n << std::endl;\n continue;\n }\n\n object_search::UpdateEstimatorParams(estimator);\n\n double leaf_size = 0.01;\n ros::param::param<double>(\"leaf_size\", leaf_size, 0.01);\n PointC::Ptr scene = rapid::perception::PclFromRos(scene_cloud);\n PointC::Ptr scene_cropped(new PointC);\n object_search::CropScene(scene, scene_cropped);\n PointC::Ptr scene_downsampled(new PointC);\n object_search::Downsample(leaf_size, scene_cropped, scene_downsampled);\n estimator->set_scene(scene_downsampled);\n\n PointC::Ptr landmark = rapid::perception::PclFromRos(landmark_cloud);\n PointC::Ptr landmark_downsampled(new PointC);\n object_search::Downsample(leaf_size, landmark, landmark_downsampled);\n estimator->set_object(landmark_downsampled);\n estimator->set_roi(landmark_info.roi);\n\n std::vector<PoseEstimationMatch> matches;\n estimator->Find(&matches);\n\n \/\/ Compute precision\/recall\n object_search::ConfusionMatrix landmark_results;\n std::vector<int> found(task.labels.size(), 0);\n for (size_t mi = 0; mi < matches.size(); ++mi) {\n const PoseEstimationMatch& match = matches[mi];\n int label_i = MatchLabels(task.labels, match);\n if (label_i != -1) {\n found[label_i] = 1;\n } else {\n ++landmark_results.fp;\n }\n }\n\n for (size_t fi = 0; fi < found.size(); ++fi) {\n if (found[fi] == 1) {\n ++landmark_results.tp;\n } else {\n ++landmark_results.fn;\n }\n }\n task_results.Merge(landmark_results);\n std::cout << \" Results for task \\\"\" << task_name << \"\\\", landmark \\\"\"\n << *landmark_name << \"\\\"\" << std::endl;\n std::cout << \" Precision: \" << landmark_results.Precision()\n << \", Recall: \" << landmark_results.Recall()\n << \", F1: \" << landmark_results.F1() << std::endl;\n }\n results.Merge(task_results);\n std::cout << \" Task results for \\\"\" << task_name << \"\\\"\" << std::endl;\n std::cout << \" Precision: \" << task_results.Precision()\n << \", Recall: \" << task_results.Recall()\n << \", F1: \" << task_results.F1() << std::endl;\n }\n\n std::cout << \"Final results:\" << std::endl;\n std::cout << \"Precision: \" << results.Precision()\n << \", Recall: \" << results.Recall() << \", F1: \" << results.F1()\n << std::endl;\n}\n\nint MatchLabels(const std::vector<object_search_msgs::Label>& labels,\n const PoseEstimationMatch& match) {\n const double position_tolerance = 0.01;\n const double orientation_tolerance = 0.04; \/\/ Approx 2 degrees\n for (size_t i = 0; i < labels.size(); ++i) {\n const object_search_msgs::Label& label = labels[i];\n double x_diff = label.pose.position.x - match.pose().position.x;\n double y_diff = label.pose.position.y - match.pose().position.y;\n double z_diff = label.pose.position.z - match.pose().position.z;\n double pos_diff =\n sqrt((x_diff * x_diff) + (y_diff * y_diff) + (z_diff * z_diff));\n Eigen::Quaterniond label_q;\n label_q.w() = label.pose.orientation.w;\n label_q.x() = label.pose.orientation.x;\n label_q.y() = label.pose.orientation.y;\n label_q.z() = label.pose.orientation.z;\n Eigen::Quaterniond match_q;\n match_q.w() = match.pose().orientation.w;\n match_q.x() = match.pose().orientation.x;\n match_q.y() = match.pose().orientation.y;\n match_q.z() = match.pose().orientation.z;\n double ang_diff = label_q.angularDistance(match_q);\n if (pos_diff < position_tolerance && ang_diff < orientation_tolerance) {\n return i;\n }\n }\n return -1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"mutation.hh\"\n\nclass mutation_assertion {\n mutation _m;\npublic:\n mutation_assertion(mutation m)\n : _m(std::move(m))\n { }\n\n \/\/ If ck_ranges is passed, verifies only that information relevant for ck_ranges matches.\n mutation_assertion& is_equal_to(const mutation& other, const stdx::optional<query::clustering_row_ranges>& ck_ranges = {}) {\n if (ck_ranges) {\n mutation_assertion(_m.sliced(*ck_ranges)).is_equal_to(other.sliced(*ck_ranges));\n return *this;\n }\n if (_m != other) {\n BOOST_FAIL(sprint(\"Mutations differ, expected %s\\n ...but got: %s\", other, _m));\n }\n if (other != _m) {\n BOOST_FAIL(sprint(\"Mutation inequality is not symmetric for %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n mutation_assertion& is_not_equal_to(const mutation& other) {\n if (_m == other) {\n BOOST_FAIL(sprint(\"Mutations equal but expected to differ: %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n mutation_assertion& has_schema(schema_ptr s) {\n if (_m.schema() != s) {\n BOOST_FAIL(sprint(\"Expected mutation of schema %s, but got %s\", *s, *_m.schema()));\n }\n return *this;\n }\n\n mutation_assertion& has_same_continuity(const mutation& other) {\n if (!_m.partition().equal_continuity(*_m.schema(), other.partition())) {\n BOOST_FAIL(sprint(\"Continuity doesn't match: %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n \/\/ Verifies that mutation data remains unchanged when upgraded to the new schema\n void is_upgrade_equivalent(schema_ptr new_schema) {\n mutation m2 = _m;\n m2.upgrade(new_schema);\n BOOST_REQUIRE(m2.schema() == new_schema);\n mutation_assertion(m2).is_equal_to(_m);\n\n mutation m3 = m2;\n m3.upgrade(_m.schema());\n BOOST_REQUIRE(m3.schema() == _m.schema());\n mutation_assertion(m3).is_equal_to(_m);\n mutation_assertion(m3).is_equal_to(m2);\n }\n};\n\nstatic inline\nmutation_assertion assert_that(mutation m) {\n return { std::move(m) };\n}\n\nstatic inline\nmutation_assertion assert_that(streamed_mutation sm) {\n auto mo = mutation_from_streamed_mutation(std::move(sm)).get0();\n return { std::move(*mo) };\n}\n\nclass mutation_opt_assertions {\n mutation_opt _mo;\npublic:\n mutation_opt_assertions(mutation_opt mo) : _mo(std::move(mo)) {}\n\n mutation_assertion has_mutation() {\n if (!_mo) {\n BOOST_FAIL(\"Expected engaged mutation_opt, but found not\");\n }\n return { *_mo };\n }\n\n void has_no_mutation() {\n if (_mo) {\n BOOST_FAIL(\"Expected disengaged mutation_opt\");\n }\n }\n};\n\nstatic inline\nmutation_opt_assertions assert_that(mutation_opt mo) {\n return { std::move(mo) };\n}\n\nstatic inline\nmutation_opt_assertions assert_that(streamed_mutation_opt smo) {\n auto mo = mutation_from_streamed_mutation(std::move(smo)).get0();\n return { std::move(mo) };\n}\n\nclass streamed_mutation_assertions {\n streamed_mutation _sm;\n clustering_key::equality _ck_eq;\npublic:\n streamed_mutation_assertions(streamed_mutation sm)\n : _sm(std::move(sm)), _ck_eq(*_sm.schema()) { }\n\n streamed_mutation_assertions& produces_static_row() {\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(\"Expected static row, got end of stream\");\n }\n if (mfopt->mutation_fragment_kind() != mutation_fragment::kind::static_row) {\n BOOST_FAIL(sprint(\"Expected static row, got: %s\", mfopt->mutation_fragment_kind()));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(mutation_fragment::kind k, std::vector<int> ck_elements) {\n std::vector<bytes> ck_bytes;\n for (auto&& e : ck_elements) {\n ck_bytes.emplace_back(int32_type->decompose(e));\n }\n auto ck = clustering_key_prefix::from_exploded(*_sm.schema(), std::move(ck_bytes));\n\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(sprint(\"Expected mutation fragment %s, got end of stream\", ck));\n }\n if (mfopt->mutation_fragment_kind() != k) {\n BOOST_FAIL(sprint(\"Expected mutation fragment kind %s, got: %s\", k, mfopt->mutation_fragment_kind()));\n }\n if (!_ck_eq(mfopt->key(), ck)) {\n BOOST_FAIL(sprint(\"Expected key %s, got: %s\", ck, mfopt->key()));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(mutation_fragment mf) {\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(sprint(\"Expected mutation fragment %s, got end of stream\", mf));\n }\n if (!mfopt->equal(*_sm.schema(), mf)) {\n BOOST_FAIL(sprint(\"Expected %s, but got %s\", mf, *mfopt));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(const mutation& m) {\n assert_that(mutation_from_streamed_mutation(_sm).get0()).is_equal_to(m);\n return *this;\n }\n\n streamed_mutation_assertions& produces_only(const std::deque<mutation_fragment>& fragments) {\n for (auto&& f : fragments) {\n produces(f);\n }\n produces_end_of_stream();\n return *this;\n }\n\n streamed_mutation_assertions& produces_row_with_key(const clustering_key& ck) {\n BOOST_TEST_MESSAGE(sprint(\"Expect %s\", ck));\n auto mfo = _sm().get0();\n if (!mfo) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but got end of stream\", ck));\n }\n if (!mfo->is_clustering_row()) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but got %s\", ck, *mfo));\n }\n auto& actual = mfo->as_clustering_row().key();\n if (!actual.equal(*_sm.schema(), ck)) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but key is %s\", ck, actual));\n }\n return *this;\n }\n\n \/\/ If ck_ranges is passed, verifies only that information relevant for ck_ranges matches.\n streamed_mutation_assertions& produces_range_tombstone(const range_tombstone& rt, const query::clustering_row_ranges& ck_ranges = {}) {\n BOOST_TEST_MESSAGE(sprint(\"Expect %s\", rt));\n auto mfo = _sm().get0();\n if (!mfo) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got end of stream\", rt));\n }\n if (!mfo->is_range_tombstone()) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got %s\", rt, *mfo));\n }\n auto& actual = mfo->as_range_tombstone();\n const schema& s = *_sm.schema();\n if (!ck_ranges.empty()) {\n range_tombstone_list actual_list(s);\n range_tombstone_list expected_list(s);\n actual_list.apply(s, actual);\n expected_list.apply(s, rt);\n actual_list.trim(s, ck_ranges);\n expected_list.trim(s, ck_ranges);\n if (!actual_list.equal(s, expected_list)) {\n BOOST_FAIL(sprint(\"Expected %s, but got %s\", expected_list, actual_list));\n }\n } else if (!actual.equal(s, rt)) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got %s\", rt, actual));\n }\n return *this;\n }\n\n streamed_mutation_assertions& fwd_to(const clustering_key& ck1, const clustering_key& ck2) {\n return fwd_to(position_range{\n position_in_partition(position_in_partition::clustering_row_tag_t(), ck1),\n position_in_partition(position_in_partition::clustering_row_tag_t(), ck2)\n });\n }\n\n streamed_mutation_assertions& fwd_to(position_range range) {\n BOOST_TEST_MESSAGE(sprint(\"Forwarding to %s\", range));\n _sm.fast_forward_to(std::move(range)).get();\n return *this;\n }\n\n streamed_mutation_assertions& produces_end_of_stream() {\n auto mfopt = _sm().get0();\n if (mfopt) {\n BOOST_FAIL(sprint(\"Expected end of stream, got: %s\", *mfopt));\n }\n return *this;\n }\n\n void has_monotonic_positions() {\n position_in_partition::less_compare less(*_sm.schema());\n mutation_fragment_opt prev;\n for (;;) {\n mutation_fragment_opt mfo = _sm().get0();\n if (!mfo) {\n break;\n }\n if (prev) {\n if (!less(prev->position(), mfo->position())) {\n BOOST_FAIL(sprint(\"previous fragment has greater position: prev=%s, current=%s\", *prev, *mfo));\n }\n }\n prev = std::move(mfo);\n }\n }\n};\n\nstatic inline streamed_mutation_assertions assert_that_stream(streamed_mutation sm)\n{\n return streamed_mutation_assertions(std::move(sm));\n}\n<commit_msg>tests: mutation_assertion: Introduce is_continuous()<commit_after>\/*\n * Copyright (C) 2015 ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#pragma once\n\n#include \"mutation.hh\"\n\nclass mutation_assertion {\n mutation _m;\npublic:\n mutation_assertion(mutation m)\n : _m(std::move(m))\n { }\n\n \/\/ If ck_ranges is passed, verifies only that information relevant for ck_ranges matches.\n mutation_assertion& is_equal_to(const mutation& other, const stdx::optional<query::clustering_row_ranges>& ck_ranges = {}) {\n if (ck_ranges) {\n mutation_assertion(_m.sliced(*ck_ranges)).is_equal_to(other.sliced(*ck_ranges));\n return *this;\n }\n if (_m != other) {\n BOOST_FAIL(sprint(\"Mutations differ, expected %s\\n ...but got: %s\", other, _m));\n }\n if (other != _m) {\n BOOST_FAIL(sprint(\"Mutation inequality is not symmetric for %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n mutation_assertion& is_not_equal_to(const mutation& other) {\n if (_m == other) {\n BOOST_FAIL(sprint(\"Mutations equal but expected to differ: %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n mutation_assertion& has_schema(schema_ptr s) {\n if (_m.schema() != s) {\n BOOST_FAIL(sprint(\"Expected mutation of schema %s, but got %s\", *s, *_m.schema()));\n }\n return *this;\n }\n\n mutation_assertion& has_same_continuity(const mutation& other) {\n if (!_m.partition().equal_continuity(*_m.schema(), other.partition())) {\n BOOST_FAIL(sprint(\"Continuity doesn't match: %s\\n ...and: %s\", other, _m));\n }\n return *this;\n }\n\n mutation_assertion& is_continuous(const position_range& r, is_continuous cont = is_continuous::yes) {\n if (!_m.partition().check_continuity(*_m.schema(), r, cont)) {\n BOOST_FAIL(sprint(\"Expected range %s to be %s in %s\", r, cont ? \"continuous\" : \"discontinuous\", _m));\n }\n return *this;\n }\n\n \/\/ Verifies that mutation data remains unchanged when upgraded to the new schema\n void is_upgrade_equivalent(schema_ptr new_schema) {\n mutation m2 = _m;\n m2.upgrade(new_schema);\n BOOST_REQUIRE(m2.schema() == new_schema);\n mutation_assertion(m2).is_equal_to(_m);\n\n mutation m3 = m2;\n m3.upgrade(_m.schema());\n BOOST_REQUIRE(m3.schema() == _m.schema());\n mutation_assertion(m3).is_equal_to(_m);\n mutation_assertion(m3).is_equal_to(m2);\n }\n};\n\nstatic inline\nmutation_assertion assert_that(mutation m) {\n return { std::move(m) };\n}\n\nstatic inline\nmutation_assertion assert_that(streamed_mutation sm) {\n auto mo = mutation_from_streamed_mutation(std::move(sm)).get0();\n return { std::move(*mo) };\n}\n\nclass mutation_opt_assertions {\n mutation_opt _mo;\npublic:\n mutation_opt_assertions(mutation_opt mo) : _mo(std::move(mo)) {}\n\n mutation_assertion has_mutation() {\n if (!_mo) {\n BOOST_FAIL(\"Expected engaged mutation_opt, but found not\");\n }\n return { *_mo };\n }\n\n void has_no_mutation() {\n if (_mo) {\n BOOST_FAIL(\"Expected disengaged mutation_opt\");\n }\n }\n};\n\nstatic inline\nmutation_opt_assertions assert_that(mutation_opt mo) {\n return { std::move(mo) };\n}\n\nstatic inline\nmutation_opt_assertions assert_that(streamed_mutation_opt smo) {\n auto mo = mutation_from_streamed_mutation(std::move(smo)).get0();\n return { std::move(mo) };\n}\n\nclass streamed_mutation_assertions {\n streamed_mutation _sm;\n clustering_key::equality _ck_eq;\npublic:\n streamed_mutation_assertions(streamed_mutation sm)\n : _sm(std::move(sm)), _ck_eq(*_sm.schema()) { }\n\n streamed_mutation_assertions& produces_static_row() {\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(\"Expected static row, got end of stream\");\n }\n if (mfopt->mutation_fragment_kind() != mutation_fragment::kind::static_row) {\n BOOST_FAIL(sprint(\"Expected static row, got: %s\", mfopt->mutation_fragment_kind()));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(mutation_fragment::kind k, std::vector<int> ck_elements) {\n std::vector<bytes> ck_bytes;\n for (auto&& e : ck_elements) {\n ck_bytes.emplace_back(int32_type->decompose(e));\n }\n auto ck = clustering_key_prefix::from_exploded(*_sm.schema(), std::move(ck_bytes));\n\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(sprint(\"Expected mutation fragment %s, got end of stream\", ck));\n }\n if (mfopt->mutation_fragment_kind() != k) {\n BOOST_FAIL(sprint(\"Expected mutation fragment kind %s, got: %s\", k, mfopt->mutation_fragment_kind()));\n }\n if (!_ck_eq(mfopt->key(), ck)) {\n BOOST_FAIL(sprint(\"Expected key %s, got: %s\", ck, mfopt->key()));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(mutation_fragment mf) {\n auto mfopt = _sm().get0();\n if (!mfopt) {\n BOOST_FAIL(sprint(\"Expected mutation fragment %s, got end of stream\", mf));\n }\n if (!mfopt->equal(*_sm.schema(), mf)) {\n BOOST_FAIL(sprint(\"Expected %s, but got %s\", mf, *mfopt));\n }\n return *this;\n }\n\n streamed_mutation_assertions& produces(const mutation& m) {\n assert_that(mutation_from_streamed_mutation(_sm).get0()).is_equal_to(m);\n return *this;\n }\n\n streamed_mutation_assertions& produces_only(const std::deque<mutation_fragment>& fragments) {\n for (auto&& f : fragments) {\n produces(f);\n }\n produces_end_of_stream();\n return *this;\n }\n\n streamed_mutation_assertions& produces_row_with_key(const clustering_key& ck) {\n BOOST_TEST_MESSAGE(sprint(\"Expect %s\", ck));\n auto mfo = _sm().get0();\n if (!mfo) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but got end of stream\", ck));\n }\n if (!mfo->is_clustering_row()) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but got %s\", ck, *mfo));\n }\n auto& actual = mfo->as_clustering_row().key();\n if (!actual.equal(*_sm.schema(), ck)) {\n BOOST_FAIL(sprint(\"Expected row with key %s, but key is %s\", ck, actual));\n }\n return *this;\n }\n\n \/\/ If ck_ranges is passed, verifies only that information relevant for ck_ranges matches.\n streamed_mutation_assertions& produces_range_tombstone(const range_tombstone& rt, const query::clustering_row_ranges& ck_ranges = {}) {\n BOOST_TEST_MESSAGE(sprint(\"Expect %s\", rt));\n auto mfo = _sm().get0();\n if (!mfo) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got end of stream\", rt));\n }\n if (!mfo->is_range_tombstone()) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got %s\", rt, *mfo));\n }\n auto& actual = mfo->as_range_tombstone();\n const schema& s = *_sm.schema();\n if (!ck_ranges.empty()) {\n range_tombstone_list actual_list(s);\n range_tombstone_list expected_list(s);\n actual_list.apply(s, actual);\n expected_list.apply(s, rt);\n actual_list.trim(s, ck_ranges);\n expected_list.trim(s, ck_ranges);\n if (!actual_list.equal(s, expected_list)) {\n BOOST_FAIL(sprint(\"Expected %s, but got %s\", expected_list, actual_list));\n }\n } else if (!actual.equal(s, rt)) {\n BOOST_FAIL(sprint(\"Expected range tombstone %s, but got %s\", rt, actual));\n }\n return *this;\n }\n\n streamed_mutation_assertions& fwd_to(const clustering_key& ck1, const clustering_key& ck2) {\n return fwd_to(position_range{\n position_in_partition(position_in_partition::clustering_row_tag_t(), ck1),\n position_in_partition(position_in_partition::clustering_row_tag_t(), ck2)\n });\n }\n\n streamed_mutation_assertions& fwd_to(position_range range) {\n BOOST_TEST_MESSAGE(sprint(\"Forwarding to %s\", range));\n _sm.fast_forward_to(std::move(range)).get();\n return *this;\n }\n\n streamed_mutation_assertions& produces_end_of_stream() {\n auto mfopt = _sm().get0();\n if (mfopt) {\n BOOST_FAIL(sprint(\"Expected end of stream, got: %s\", *mfopt));\n }\n return *this;\n }\n\n void has_monotonic_positions() {\n position_in_partition::less_compare less(*_sm.schema());\n mutation_fragment_opt prev;\n for (;;) {\n mutation_fragment_opt mfo = _sm().get0();\n if (!mfo) {\n break;\n }\n if (prev) {\n if (!less(prev->position(), mfo->position())) {\n BOOST_FAIL(sprint(\"previous fragment has greater position: prev=%s, current=%s\", *prev, *mfo));\n }\n }\n prev = std::move(mfo);\n }\n }\n};\n\nstatic inline streamed_mutation_assertions assert_that_stream(streamed_mutation sm)\n{\n return streamed_mutation_assertions(std::move(sm));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by 乔磊 on 15\/10\/21.\n\/\/ Copyright (c) 2015年 乔磊. All rights reserved.\n\/\/\n\n\n#include <NSolver\/Parameters\/StabilizationParameters.h>\n\nnamespace NSFEMSolver\n{\n namespace Parameters\n {\n using namespace dealii;\n\n template <int dim>\n void StabilizationParameters<dim>::declare_parameters (ParameterHandler &prm)\n {\n prm.enter_subsection (\"stabilization parameters\");\n {\n prm.declare_entry (\"diffusion type\", \"cell size\",\n Patterns::Anything(),\n \"How to calculate diffusion\");\n\n prm.declare_entry (\"diffusion power\", \"2.0\",\n Patterns::Double(),\n \"power of mesh size for diffusion\");\n\n prm.declare_entry (\"diffusion coefficient\", \"1.0\",\n Patterns::Double(),\n \"predefined diffusion coefficient\");\n prm.declare_entry (\"entropy visc cE\", \"1.0\",\n Patterns::Double (0.0),\n \"Scale factor on entropy viscosity\");\n prm.declare_entry (\"entropy visc cLinear\", \"0.25\",\n Patterns::Double (0.0),\n \"Scale factor on linear limit of entropy viscosity\");\n prm.declare_entry (\"entropy use global h min\", \"false\",\n Patterns::Bool(),\n \"Use global minimum cell size for entropy viscosity\");\n\n prm.declare_entry (\"continuation type\", \"time\",\n Patterns::Anything(),\n \"continuation type\");\n\n prm.declare_entry (\"switch threshold\",\"10.0\",\n Patterns::Double(),\n \"Ratio threshold to switch from laplacian to time continuation\");\n\n prm.declare_entry (\"Laplacian continuation\", \"-1.0\",\n Patterns::Double(),\n \"Coefficient for Laplacian continuation\");\n prm.declare_entry (\"enable partial laplacian\", \"false\",\n Patterns::Bool(),\n \"Enable partial laplacian\");\n prm.declare_entry (\"dodge mesh adaptation\", \"false\",\n Patterns::Bool(),\n \"Avoid doing mesh refinement and decreasing Laplacian continuation on same time step.\");\n prm.declare_entry (\"Laplacian zero\", \"1e-9\",\n Patterns::Double(),\n \"Threshold of Laplacian Coefficient to be force to zero\");\n prm.declare_entry (\"Laplacian Newton tolerance\", \"0.1\",\n Patterns::Double (0.0),\n \"Threshold of Laplacian Coefficient to be force to zero\");\n prm.declare_entry (\"Laplacian Newton quadratic\", \"1.5\",\n Patterns::Double (0.0),\n \"Threshold of Newton convergence rate to be recognized as quadratic convergence.\");\n prm.declare_entry (\"Laplacian decrease rate\", \"1.5\",\n Patterns::Double (1.0),\n \"Laplacian decrease rate.\");\n\n prm.declare_entry (\"SUPG factor\", \"-1.0\",\n Patterns::Double(),\n \"SUPG stabilization factor.\");\n\n for (unsigned int di=0; di<EquationComponents<dim>::n_components; ++di)\n {\n prm.declare_entry (\"diffusion factor for w_\" + Utilities::int_to_string (di),\n \"1.0\",\n Patterns::Double (0),\n \"diffusion factor for component w_\" + Utilities::int_to_string (di));\n }\n }\n prm.leave_subsection();\n return;\n }\n\n template <int dim>\n void StabilizationParameters<dim>::parse_parameters (ParameterHandler &prm)\n {\n prm.enter_subsection (\"stabilization parameters\");\n {\n {\n const std::string prm_buf = prm.get (\"diffusion type\");\n if (prm_buf == \"entropy\")\n {\n diffusion_type = diffu_entropy;\n }\n else if (prm_buf == \"entropy_DRB\")\n {\n diffusion_type = diffu_entropy_DRB;\n }\n else if (prm_buf == \"cell size\")\n {\n diffusion_type = diffu_cell_size;\n }\n else if (prm_buf == \"const\")\n {\n diffusion_type = diffu_const;\n }\n else\n {\n AssertThrow (false, ExcNotImplemented());\n }\n }\n diffusion_power = prm.get_double (\"diffusion power\");\n diffusion_coefficoent = prm.get_double (\"diffusion coefficient\");\n entropy_visc_cE = prm.get_double (\"entropy visc cE\");\n entropy_visc_cLinear = prm.get_double (\"entropy visc cLinear\");\n entropy_use_global_h_min = prm.get_bool (\"entropy use global h min\");\n\n {\n const std::string prm_buf = prm.get (\"continuation type\");\n if (prm_buf == \"timeCFL\")\n {\n continuation_type = CT_timeCFL;\n }\n else if (prm_buf == \"time\")\n {\n continuation_type = CT_time;\n }\n else if (prm_buf == \"laplacian\")\n {\n continuation_type = CT_laplacian;\n }\n else if (prm_buf == \"switch\")\n {\n continuation_type = CT_switch;\n }\n else if (prm_buf == \"alternative\")\n {\n continuation_type = CT_alternative;\n }\n else if (prm_buf == \"blend\")\n {\n continuation_type = CT_blend;\n }\n else\n {\n AssertThrow (false, ExcNotImplemented());\n }\n }\n\n continuation_switch_threshold = prm.get_double (\"switch threshold\");\n\n laplacian_continuation = prm.get_double (\"Laplacian continuation\");\n enable_partial_laplacian = prm.get_bool (\"enable partial laplacian\");\n dodge_mesh_adaptation = prm.get_bool (\"dodge mesh adaptation\");\n laplacian_zero = prm.get_double (\"Laplacian zero\");\n laplacian_newton_quadratic = prm.get_double (\"Laplacian Newton quadratic\");\n laplacian_newton_tolerance = prm.get_double (\"Laplacian Newton tolerance\");\n laplacian_decrease_rate = prm.get_double (\"Laplacian decrease rate\");\n\n for (unsigned int di=0; di<EquationComponents<dim>::n_components; ++di)\n {\n diffusion_factor[di] = prm.get_double (\"diffusion factor for w_\"\n + Utilities::int_to_string (di));\n }\n\n SUPG_factor = prm.get_double (\"SUPG factor\");\n }\n prm.leave_subsection();\n return;\n }\n\n template struct StabilizationParameters<2>;\n template struct StabilizationParameters<3>;\n }\n}\n<commit_msg>PT_BCR: change default continuation type to timeCFL for backward compatibility<commit_after>\/\/\n\/\/ Created by 乔磊 on 15\/10\/21.\n\/\/ Copyright (c) 2015年 乔磊. All rights reserved.\n\/\/\n\n\n#include <NSolver\/Parameters\/StabilizationParameters.h>\n\nnamespace NSFEMSolver\n{\n namespace Parameters\n {\n using namespace dealii;\n\n template <int dim>\n void StabilizationParameters<dim>::declare_parameters (ParameterHandler &prm)\n {\n prm.enter_subsection (\"stabilization parameters\");\n {\n prm.declare_entry (\"diffusion type\", \"cell size\",\n Patterns::Anything(),\n \"How to calculate diffusion\");\n\n prm.declare_entry (\"diffusion power\", \"2.0\",\n Patterns::Double(),\n \"power of mesh size for diffusion\");\n\n prm.declare_entry (\"diffusion coefficient\", \"1.0\",\n Patterns::Double(),\n \"predefined diffusion coefficient\");\n prm.declare_entry (\"entropy visc cE\", \"1.0\",\n Patterns::Double (0.0),\n \"Scale factor on entropy viscosity\");\n prm.declare_entry (\"entropy visc cLinear\", \"0.25\",\n Patterns::Double (0.0),\n \"Scale factor on linear limit of entropy viscosity\");\n prm.declare_entry (\"entropy use global h min\", \"false\",\n Patterns::Bool(),\n \"Use global minimum cell size for entropy viscosity\");\n\n prm.declare_entry (\"continuation type\", \"timeCFL\",\n Patterns::Anything(),\n \"continuation type\");\n\n prm.declare_entry (\"switch threshold\",\"10.0\",\n Patterns::Double(),\n \"Ratio threshold to switch from laplacian to time continuation\");\n\n prm.declare_entry (\"Laplacian continuation\", \"-1.0\",\n Patterns::Double(),\n \"Coefficient for Laplacian continuation\");\n prm.declare_entry (\"enable partial laplacian\", \"false\",\n Patterns::Bool(),\n \"Enable partial laplacian\");\n prm.declare_entry (\"dodge mesh adaptation\", \"false\",\n Patterns::Bool(),\n \"Avoid doing mesh refinement and decreasing Laplacian continuation on same time step.\");\n prm.declare_entry (\"Laplacian zero\", \"1e-9\",\n Patterns::Double(),\n \"Threshold of Laplacian Coefficient to be force to zero\");\n prm.declare_entry (\"Laplacian Newton tolerance\", \"0.1\",\n Patterns::Double (0.0),\n \"Threshold of Laplacian Coefficient to be force to zero\");\n prm.declare_entry (\"Laplacian Newton quadratic\", \"1.5\",\n Patterns::Double (0.0),\n \"Threshold of Newton convergence rate to be recognized as quadratic convergence.\");\n prm.declare_entry (\"Laplacian decrease rate\", \"1.5\",\n Patterns::Double (1.0),\n \"Laplacian decrease rate.\");\n\n prm.declare_entry (\"SUPG factor\", \"-1.0\",\n Patterns::Double(),\n \"SUPG stabilization factor.\");\n\n for (unsigned int di=0; di<EquationComponents<dim>::n_components; ++di)\n {\n prm.declare_entry (\"diffusion factor for w_\" + Utilities::int_to_string (di),\n \"1.0\",\n Patterns::Double (0),\n \"diffusion factor for component w_\" + Utilities::int_to_string (di));\n }\n }\n prm.leave_subsection();\n return;\n }\n\n template <int dim>\n void StabilizationParameters<dim>::parse_parameters (ParameterHandler &prm)\n {\n prm.enter_subsection (\"stabilization parameters\");\n {\n {\n const std::string prm_buf = prm.get (\"diffusion type\");\n if (prm_buf == \"entropy\")\n {\n diffusion_type = diffu_entropy;\n }\n else if (prm_buf == \"entropy_DRB\")\n {\n diffusion_type = diffu_entropy_DRB;\n }\n else if (prm_buf == \"cell size\")\n {\n diffusion_type = diffu_cell_size;\n }\n else if (prm_buf == \"const\")\n {\n diffusion_type = diffu_const;\n }\n else\n {\n AssertThrow (false, ExcNotImplemented());\n }\n }\n diffusion_power = prm.get_double (\"diffusion power\");\n diffusion_coefficoent = prm.get_double (\"diffusion coefficient\");\n entropy_visc_cE = prm.get_double (\"entropy visc cE\");\n entropy_visc_cLinear = prm.get_double (\"entropy visc cLinear\");\n entropy_use_global_h_min = prm.get_bool (\"entropy use global h min\");\n\n {\n const std::string prm_buf = prm.get (\"continuation type\");\n if (prm_buf == \"timeCFL\")\n {\n continuation_type = CT_timeCFL;\n }\n else if (prm_buf == \"time\")\n {\n continuation_type = CT_time;\n }\n else if (prm_buf == \"laplacian\")\n {\n continuation_type = CT_laplacian;\n }\n else if (prm_buf == \"switch\")\n {\n continuation_type = CT_switch;\n }\n else if (prm_buf == \"alternative\")\n {\n continuation_type = CT_alternative;\n }\n else if (prm_buf == \"blend\")\n {\n continuation_type = CT_blend;\n }\n else\n {\n AssertThrow (false, ExcNotImplemented());\n }\n }\n\n continuation_switch_threshold = prm.get_double (\"switch threshold\");\n\n laplacian_continuation = prm.get_double (\"Laplacian continuation\");\n enable_partial_laplacian = prm.get_bool (\"enable partial laplacian\");\n dodge_mesh_adaptation = prm.get_bool (\"dodge mesh adaptation\");\n laplacian_zero = prm.get_double (\"Laplacian zero\");\n laplacian_newton_quadratic = prm.get_double (\"Laplacian Newton quadratic\");\n laplacian_newton_tolerance = prm.get_double (\"Laplacian Newton tolerance\");\n laplacian_decrease_rate = prm.get_double (\"Laplacian decrease rate\");\n\n for (unsigned int di=0; di<EquationComponents<dim>::n_components; ++di)\n {\n diffusion_factor[di] = prm.get_double (\"diffusion factor for w_\"\n + Utilities::int_to_string (di));\n }\n\n SUPG_factor = prm.get_double (\"SUPG factor\");\n }\n prm.leave_subsection();\n return;\n }\n\n template struct StabilizationParameters<2>;\n template struct StabilizationParameters<3>;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ This file is part of the Marble Virtual Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2014 Sanjiban Bairagya <sanjiban22393@gmail.com>\n\/\/\n\n#include \"PlaybackAnimatedUpdateItem.h\"\n#include \"GeoDataTypes.h\"\n\n#include <QString>\n\nnamespace Marble\n{\nPlaybackAnimatedUpdateItem::PlaybackAnimatedUpdateItem( const GeoDataAnimatedUpdate* animatedUpdate )\n{\n m_animatedUpdate = animatedUpdate;\n}\n\nconst GeoDataAnimatedUpdate* PlaybackAnimatedUpdateItem::animatedUpdate() const\n{\n return m_animatedUpdate;\n}\n\ndouble PlaybackAnimatedUpdateItem::duration() const\n{\n return m_animatedUpdate->duration();\n}\n\nvoid PlaybackAnimatedUpdateItem::play()\n{\n if ( m_animatedUpdate->update() ) {\n QVector<GeoDataPlacemark*> placemarkList = m_animatedUpdate->update()->change()->placemarkList();\n for( int i = 0; i < placemarkList.size(); i++ ){\n GeoDataPlacemark* placemark = placemarkList.at( i );\n QString targetId = placemark->targetId();\n if( placemark->isBalloonVisible() ){\n GeoDataDocument* document = rootDocument( placemark );\n GeoDataPlacemark* placemarkFromDocument = findPlacemark( document, targetId );\n if( placemarkFromDocument ){\n emit balloonShown( placemarkFromDocument );\n }\n } else {\n emit balloonHidden();\n }\n }\n }\n}\n\nGeoDataPlacemark* PlaybackAnimatedUpdateItem::findPlacemark( GeoDataFeature* feature, const QString& targetId ) const\n{\n if ( feature && feature->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n if( static_cast<GeoDataPlacemark*>( feature )->id() == targetId ){\n return static_cast<GeoDataPlacemark*>( feature );\n }\n }\n\n GeoDataContainer *container = dynamic_cast<GeoDataContainer*>( feature );\n if ( container ){\n QVector<GeoDataFeature*>::Iterator end = container->end();\n QVector<GeoDataFeature*>::Iterator iter = container->begin();\n for( ; iter != end; ++iter ){\n GeoDataPlacemark *placemark = findPlacemark( *iter, targetId );\n if ( placemark ) {\n return placemark;\n }\n }\n }\n return 0;\n}\n\nGeoDataDocument* PlaybackAnimatedUpdateItem::rootDocument( GeoDataObject* object ) const\n{\n if( !object || !object->parent() ){\n GeoDataDocument* document = dynamic_cast<GeoDataDocument*>( object );\n return document;\n } else {\n return rootDocument( object->parent() );\n }\n return 0;\n}\n\nvoid PlaybackAnimatedUpdateItem::pause()\n{\n \/\/do nothing\n}\n\nvoid PlaybackAnimatedUpdateItem::seek( double position )\n{\n Q_UNUSED( position );\n \/\/do nothing\n}\n\nvoid PlaybackAnimatedUpdateItem::stop()\n{\n \/\/do nothing\n}\n\n}\n\n#include \"PlaybackAnimatedUpdateItem.moc\"\n<commit_msg>Don't crash when an update has no change<commit_after>\/\/\n\/\/ This file is part of the Marble Virtual Globe.\n\/\/\n\/\/ This program is free software licensed under the GNU LGPL. You can\n\/\/ find a copy of this license in LICENSE.txt in the top directory of\n\/\/ the source code.\n\/\/\n\/\/ Copyright 2014 Sanjiban Bairagya <sanjiban22393@gmail.com>\n\/\/\n\n#include \"PlaybackAnimatedUpdateItem.h\"\n#include \"GeoDataTypes.h\"\n\n#include <QString>\n\nnamespace Marble\n{\nPlaybackAnimatedUpdateItem::PlaybackAnimatedUpdateItem( const GeoDataAnimatedUpdate* animatedUpdate )\n{\n m_animatedUpdate = animatedUpdate;\n}\n\nconst GeoDataAnimatedUpdate* PlaybackAnimatedUpdateItem::animatedUpdate() const\n{\n return m_animatedUpdate;\n}\n\ndouble PlaybackAnimatedUpdateItem::duration() const\n{\n return m_animatedUpdate->duration();\n}\n\nvoid PlaybackAnimatedUpdateItem::play()\n{\n if ( m_animatedUpdate->update() && m_animatedUpdate->update()->change() ) {\n QVector<GeoDataPlacemark*> placemarkList = m_animatedUpdate->update()->change()->placemarkList();\n for( int i = 0; i < placemarkList.size(); i++ ){\n GeoDataPlacemark* placemark = placemarkList.at( i );\n QString targetId = placemark->targetId();\n if( placemark->isBalloonVisible() ){\n GeoDataDocument* document = rootDocument( placemark );\n GeoDataPlacemark* placemarkFromDocument = findPlacemark( document, targetId );\n if( placemarkFromDocument ){\n emit balloonShown( placemarkFromDocument );\n }\n } else {\n emit balloonHidden();\n }\n }\n }\n}\n\nGeoDataPlacemark* PlaybackAnimatedUpdateItem::findPlacemark( GeoDataFeature* feature, const QString& targetId ) const\n{\n if ( feature && feature->nodeType() == GeoDataTypes::GeoDataPlacemarkType ) {\n if( static_cast<GeoDataPlacemark*>( feature )->id() == targetId ){\n return static_cast<GeoDataPlacemark*>( feature );\n }\n }\n\n GeoDataContainer *container = dynamic_cast<GeoDataContainer*>( feature );\n if ( container ){\n QVector<GeoDataFeature*>::Iterator end = container->end();\n QVector<GeoDataFeature*>::Iterator iter = container->begin();\n for( ; iter != end; ++iter ){\n GeoDataPlacemark *placemark = findPlacemark( *iter, targetId );\n if ( placemark ) {\n return placemark;\n }\n }\n }\n return 0;\n}\n\nGeoDataDocument* PlaybackAnimatedUpdateItem::rootDocument( GeoDataObject* object ) const\n{\n if( !object || !object->parent() ){\n GeoDataDocument* document = dynamic_cast<GeoDataDocument*>( object );\n return document;\n } else {\n return rootDocument( object->parent() );\n }\n return 0;\n}\n\nvoid PlaybackAnimatedUpdateItem::pause()\n{\n \/\/do nothing\n}\n\nvoid PlaybackAnimatedUpdateItem::seek( double position )\n{\n Q_UNUSED( position );\n \/\/do nothing\n}\n\nvoid PlaybackAnimatedUpdateItem::stop()\n{\n \/\/do nothing\n}\n\n}\n\n#include \"PlaybackAnimatedUpdateItem.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: C; c-basic-offset: 4 -*- *\/\n#ident \"Copyright (c) 2007 Tokutek Inc. All rights reserved.\"\n\n\/* try a reverse compare function to verify that the database always uses the application's\n compare function *\/\n\n#include <arpa\/inet.h>\n#include <assert.h>\n#include <db_cxx.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#define DIR \"dir_test_reverse_compare_fun\"\n#include \"test.h\"\n\n\n\nint keycompare (const void *key1, unsigned int key1len, const void *key2, unsigned int key2len) {\n if (key1len==key2len) {\n\treturn memcmp(key1,key2,key1len);\n } else if (key1len<key2len) {\n\tint r = memcmp(key1,key2,key1len);\n\tif (r<=0) return -1; \/* If the keys are the same up to 1's length, then return -1, since key1 is shorter than key2. *\/\n\telse return 1;\n } else {\n\treturn -keycompare(key2,key2len,key1,key1len);\n }\n}\n\nint reverse_compare(Db *db __attribute__((__unused__)), const Dbt *a, const Dbt*b) {\n return -keycompare(a->get_data(), a->get_size(), b->get_data(), b->get_size());\n}\n\nvoid expect(Dbc *cursor, int k, int v) {\n Dbt key; key.set_flags(DB_DBT_MALLOC);\n Dbt val; val.set_flags(DB_DBT_MALLOC);\n int r = cursor->get(&key, &val, DB_NEXT);\n CKERR(r);\n assert(key.get_size() == sizeof k);\n int kk;\n memcpy(&kk, key.get_data(), key.get_size());\n assert(val.get_size() == sizeof v);\n int vv;\n memcpy(&vv, val.get_data(), val.get_size());\n if (kk != k || vv != v) printf(\"expect key %d got %d - %d %d\\n\", htonl(k), htonl(kk), htonl(v), htonl(vv));\n assert(kk == k);\n assert(vv == v);\n\n free(key.get_data());\n free(val.get_data());\n}\n\nvoid test_reverse_compare(int n, int dup_flags) {\n if (verbose) printf(\"test_reverse_compare:%d %d\\n\", n, dup_flags);\n\n DbEnv * const null_env = 0;\n Db *db;\n DbTxn * const null_txn = 0;\n const char * const fname = DIR \"\/reverse.compare.db\";\n\n int r;\n int i;\n\n system(\"rm -rf \" DIR);\n mkdir(DIR, 0777);\n\n \/* create the dup database file *\/\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n CKERR(r);\n r = db->set_pagesize(4096);\n CKERR(r);\n r = db->set_bt_compare(reverse_compare);\n CKERR(r);\n r = db->set_dup_compare(reverse_compare);\n CKERR(r);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, DB_CREATE, 0666);\n CKERR(r);\n\n \/* insert n unique keys {0, 1, n-1} *\/\n for (i=0; i<n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n CKERR(r);\n }\n\n \/* reopen the database to force nonleaf buffering *\/\n r = db->close(0);\n CKERR(r);\n delete db;\n\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n CKERR(r);\n r = db->set_pagesize(4096);\n CKERR(r);\n r = db->set_bt_compare(reverse_compare);\n CKERR(r);\n r = db->set_dup_compare(reverse_compare);\n CKERR(r);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, 0, 0666);\n CKERR(r);\n\n \/* insert n unique keys {n, n+1, 2*n-1} *\/\n for (i=n; i<2*n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n CKERR(r);\n }\n\n \/* verify the sort order with a cursor *\/\n Dbc *cursor;\n r = db->cursor(null_txn, &cursor, 0);\n CKERR(r);\n\n \/\/for (i=0; i<2*n; i++) \n for (i=2*n-1; i>=0; i--)\n expect(cursor, htonl(dup_flags ? n : i), htonl(i));\n\n r = cursor->close();\n CKERR(r);\n\n r = db->close(0);\n CKERR(r);\n delete db;\n}\n\nint main(int argc, const char *argv[]) {\n parse_args(argc, argv);\n\n int i;\n\n for (i = 1; i <= (1<<16); i *= 2) {\n test_reverse_compare(i, 0);\n test_reverse_compare(i, DB_DUP + DB_DUPSORT);\n }\n return 0;\n}\n<commit_msg>fix the build. addresses #277<commit_after>\/* -*- mode: C; c-basic-offset: 4 -*- *\/\n#ident \"Copyright (c) 2007 Tokutek Inc. All rights reserved.\"\n\n\/* try a reverse compare function to verify that the database always uses the application's\n compare function *\/\n\n#include <arpa\/inet.h>\n#include <assert.h>\n#include <db_cxx.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#define DIR \"dir_test_reverse_compare_fun\"\nint verbose;\n\nint keycompare (const void *key1, unsigned int key1len, const void *key2, unsigned int key2len) {\n if (key1len==key2len) {\n\treturn memcmp(key1,key2,key1len);\n } else if (key1len<key2len) {\n\tint r = memcmp(key1,key2,key1len);\n\tif (r<=0) return -1; \/* If the keys are the same up to 1's length, then return -1, since key1 is shorter than key2. *\/\n\telse return 1;\n } else {\n\treturn -keycompare(key2,key2len,key1,key1len);\n }\n}\n\nint reverse_compare(Db *db __attribute__((__unused__)), const Dbt *a, const Dbt*b) {\n return -keycompare(a->get_data(), a->get_size(), b->get_data(), b->get_size());\n}\n\nvoid expect(Dbc *cursor, int k, int v) {\n Dbt key; key.set_flags(DB_DBT_MALLOC);\n Dbt val; val.set_flags(DB_DBT_MALLOC);\n int r = cursor->get(&key, &val, DB_NEXT);\n assert(r == 0);\n assert(key.get_size() == sizeof k);\n int kk;\n memcpy(&kk, key.get_data(), key.get_size());\n assert(val.get_size() == sizeof v);\n int vv;\n memcpy(&vv, val.get_data(), val.get_size());\n if (kk != k || vv != v) printf(\"expect key %d got %d - %d %d\\n\", htonl(k), htonl(kk), htonl(v), htonl(vv));\n assert(kk == k);\n assert(vv == v);\n\n free(key.get_data());\n free(val.get_data());\n}\n\nvoid test_reverse_compare(int n, int dup_flags) {\n if (verbose) printf(\"test_reverse_compare:%d %d\\n\", n, dup_flags);\n\n DbEnv * const null_env = 0;\n Db *db;\n DbTxn * const null_txn = 0;\n const char * const fname = DIR \"\/reverse.compare.db\";\n\n int r;\n int i;\n\n system(\"rm -rf \" DIR);\n mkdir(DIR, 0777);\n\n \/* create the dup database file *\/\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n assert(r == 0);\n r = db->set_pagesize(4096);\n assert(r == 0);\n r = db->set_bt_compare(reverse_compare);\n assert(r == 0);\n r = db->set_dup_compare(reverse_compare);\n assert(r == 0);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, DB_CREATE, 0666);\n assert(r == 0);\n\n \/* insert n unique keys {0, 1, n-1} *\/\n for (i=0; i<n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n assert(r == 0);\n }\n\n \/* reopen the database to force nonleaf buffering *\/\n r = db->close(0);\n assert(r == 0);\n delete db;\n\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n assert(r == 0);\n r = db->set_pagesize(4096);\n assert(r == 0);\n r = db->set_bt_compare(reverse_compare);\n assert(r == 0);\n r = db->set_dup_compare(reverse_compare);\n assert(r == 0);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, 0, 0666);\n assert(r == 0);\n\n \/* insert n unique keys {n, n+1, 2*n-1} *\/\n for (i=n; i<2*n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n assert(r == 0);\n }\n\n \/* verify the sort order with a cursor *\/\n Dbc *cursor;\n r = db->cursor(null_txn, &cursor, 0);\n assert(r == 0);\n\n \/\/for (i=0; i<2*n; i++) \n for (i=2*n-1; i>=0; i--)\n expect(cursor, htonl(dup_flags ? n : i), htonl(i));\n\n r = cursor->close();\n assert(r == 0);\n\n r = db->close(0);\n assert(r == 0);\n delete db;\n}\n\nint main(int argc, const char *argv[]) {\n int i;\n for (i = 1; i <= (1<<16); i *= 2) {\n test_reverse_compare(i, 0);\n test_reverse_compare(i, DB_DUP + DB_DUPSORT);\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2009-2013 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n\n#include \"dlpolytopologyreader.h\"\n#include \"dlpoly\/dlp_io_layer.h\"\n\nnamespace votca { namespace csg {\n\nbool DLPOLYTopologyReader::ReadTopology(string file, Topology &top)\n{\n struct FieldSpecsT FieldBase;\n struct FrameSpecsT FrameBase;\n struct MolecSpecsT *MolecBase;\n struct FieldSiteT *FieldSite;\n struct FrameSiteT *FrameSite;\n\n int idnode,matms,natms,nmols,nmolt;\n int istateF;\n\n int inode=matms=natms=nmols=nmolt=0;\n\n \/\/ TODO: istateF must be an enum!\n istateF=1;\n\n \/\/ TODO: we need to fix the file naming!\n field_scan_(&istateF,&matms,&natms,&nmolt);\n\n MolecBase = new MolecSpecsT[nmolt];\n FieldSite = new FieldSiteT[natms];\n\n FieldBase.nmols = nmolt;\n FieldBase.natms = natms;\n\n field_read_(&istateF,&FieldBase,MolecBase,FieldSite);\n\n \/\/ AB: if on return istateF < 0 => in the next F-call the relevant F-arrays will be deallocated (at the end)\n \/\/ AB: NOT TO RE-\/DE-ALLOCATE F-arrays in the next F-call, reset istateF = 0\n istateF = 0;\n\n \/\/ TODO: fix residue naming \/ assignment\n Residue *res = top.CreateResidue(\"no\");\n\n \/\/ read the atoms\n int is=0;\n for(int im=0; im<nmolt; im++){\n for(int imr=0; imr<MolecBase[im].nrept; ++imr) {\n Molecule *mi = top.CreateMolecule(MolecBase[im].name);\n for(int ims=0; ims<MolecBase[im].nsites; ims++) {\n\n BeadType *type = top.GetOrCreateBeadType(FieldSite[is].name); \/\/ what is\n Bead *bead = top.CreateBead(1, FieldSite[is].type, type, res->getId(), FieldSite[is].m, FieldSite[is].q);\n\n stringstream nm;\n nm << bead->getResnr() + 1 << \":\" << top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n mi->AddBead(bead, nm.str());\n }\n }\n }\n\n delete [] MolecBase;\n delete [] FieldSite;\n\n std::ifstream fl;\n fl.open(\"CONFIG\");\n if(fl.is_open()) {\n string line;\n getline(fl, line); \/\/title\n getline(fl, line); \/\/ 2nd header line\n vec box_vectors[3];\n for (int i=0;i<3;i++){ \/\/ read 3 box lines\n getline(fl, line);\n if(fl.eof())\n throw std::runtime_error(\"unexpected end of file in dlpoly file CONFIG, when reading box vector\" +\n boost::lexical_cast<string>(i));\n Tokenizer tok(line, \" \");\n vector<double> fields;\n tok.ConvertToVector<double>(fields);\n box_vectors[i]=vec(fields[0],fields[1],fields[2]);\n }\n matrix box(box_vectors[0],box_vectors[1],box_vectors[2]);\n top.setBox(box);\n }\n else {\n cout << \"NOTE: Could open dlploy file CONFIG, so no boundary conditions, where set in the topology\" << endl;\n }\n\n return true;\n}\n\n}}\n\n<commit_msg>dlpolytopologyreader: added missing files close<commit_after>\/*\n * Copyright 2009-2013 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#include <iostream>\n#include <fstream>\n\n#include \"dlpolytopologyreader.h\"\n#include \"dlpoly\/dlp_io_layer.h\"\n\nnamespace votca { namespace csg {\n\nbool DLPOLYTopologyReader::ReadTopology(string file, Topology &top)\n{\n struct FieldSpecsT FieldBase;\n struct FrameSpecsT FrameBase;\n struct MolecSpecsT *MolecBase;\n struct FieldSiteT *FieldSite;\n struct FrameSiteT *FrameSite;\n\n int idnode,matms,natms,nmols,nmolt;\n int istateF;\n\n int inode=matms=natms=nmols=nmolt=0;\n\n \/\/ TODO: istateF must be an enum!\n istateF=1;\n\n \/\/ TODO: we need to fix the file naming!\n field_scan_(&istateF,&matms,&natms,&nmolt);\n\n MolecBase = new MolecSpecsT[nmolt];\n FieldSite = new FieldSiteT[natms];\n\n FieldBase.nmols = nmolt;\n FieldBase.natms = natms;\n\n field_read_(&istateF,&FieldBase,MolecBase,FieldSite);\n\n \/\/ AB: if on return istateF < 0 => in the next F-call the relevant F-arrays will be deallocated (at the end)\n \/\/ AB: NOT TO RE-\/DE-ALLOCATE F-arrays in the next F-call, reset istateF = 0\n istateF = 0;\n\n \/\/ TODO: fix residue naming \/ assignment\n Residue *res = top.CreateResidue(\"no\");\n\n \/\/ read the atoms\n int is=0;\n for(int im=0; im<nmolt; im++){\n for(int imr=0; imr<MolecBase[im].nrept; ++imr) {\n Molecule *mi = top.CreateMolecule(MolecBase[im].name);\n for(int ims=0; ims<MolecBase[im].nsites; ims++) {\n\n BeadType *type = top.GetOrCreateBeadType(FieldSite[is].name); \/\/ what is\n Bead *bead = top.CreateBead(1, FieldSite[is].type, type, res->getId(), FieldSite[is].m, FieldSite[is].q);\n\n stringstream nm;\n nm << bead->getResnr() + 1 << \":\" << top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n mi->AddBead(bead, nm.str());\n }\n }\n }\n\n delete [] MolecBase;\n delete [] FieldSite;\n\n std::ifstream fl;\n fl.open(\"CONFIG\");\n if(fl.is_open()) {\n string line;\n getline(fl, line); \/\/title\n getline(fl, line); \/\/ 2nd header line\n vec box_vectors[3];\n for (int i=0;i<3;i++){ \/\/ read 3 box lines\n getline(fl, line);\n if(fl.eof())\n throw std::runtime_error(\"unexpected end of file in dlpoly file CONFIG, when reading box vector\" +\n boost::lexical_cast<string>(i));\n Tokenizer tok(line, \" \");\n vector<double> fields;\n tok.ConvertToVector<double>(fields);\n box_vectors[i]=vec(fields[0],fields[1],fields[2]);\n }\n matrix box(box_vectors[0],box_vectors[1],box_vectors[2]);\n top.setBox(box);\n }\n else {\n cout << \"NOTE: Could open dlploy file CONFIG, so no boundary conditions, where set in the topology\" << endl;\n }\n fl.close();\n\n return true;\n}\n\n}}\n\n<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: C; c-basic-offset: 4 -*- *\/\n#ident \"Copyright (c) 2007 Tokutek Inc. All rights reserved.\"\n\n\/* try a reverse compare function to verify that the database always uses the application's\n compare function *\/\n\n#include <arpa\/inet.h>\n#include <assert.h>\n#include <db_cxx.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#define DIR \"dir_test_reverse_compare_fun\"\n#include \"test.h\"\n\n\n\nint keycompare (const void *key1, unsigned int key1len, const void *key2, unsigned int key2len) {\n if (key1len==key2len) {\n\treturn memcmp(key1,key2,key1len);\n } else if (key1len<key2len) {\n\tint r = memcmp(key1,key2,key1len);\n\tif (r<=0) return -1; \/* If the keys are the same up to 1's length, then return -1, since key1 is shorter than key2. *\/\n\telse return 1;\n } else {\n\treturn -keycompare(key2,key2len,key1,key1len);\n }\n}\n\nint reverse_compare(Db *db __attribute__((__unused__)), const Dbt *a, const Dbt*b) {\n return -keycompare(a->get_data(), a->get_size(), b->get_data(), b->get_size());\n}\n\nvoid expect(Dbc *cursor, int k, int v) {\n Dbt key; key.set_flags(DB_DBT_MALLOC);\n Dbt val; val.set_flags(DB_DBT_MALLOC);\n int r = cursor->get(&key, &val, DB_NEXT);\n CKERR(r);\n assert(key.get_size() == sizeof k);\n int kk;\n memcpy(&kk, key.get_data(), key.get_size());\n assert(val.get_size() == sizeof v);\n int vv;\n memcpy(&vv, val.get_data(), val.get_size());\n if (kk != k || vv != v) printf(\"expect key %d got %d - %d %d\\n\", htonl(k), htonl(kk), htonl(v), htonl(vv));\n assert(kk == k);\n assert(vv == v);\n\n free(key.get_data());\n free(val.get_data());\n}\n\nvoid test_reverse_compare(int n, int dup_flags) {\n if (verbose) printf(\"test_reverse_compare:%d %d\\n\", n, dup_flags);\n\n DbEnv * const null_env = 0;\n Db *db;\n DbTxn * const null_txn = 0;\n const char * const fname = DIR \"\/reverse.compare.db\";\n\n int r;\n int i;\n\n system(\"rm -rf \" DIR);\n mkdir(DIR, 0777);\n\n \/* create the dup database file *\/\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n CKERR(r);\n r = db->set_pagesize(4096);\n CKERR(r);\n r = db->set_bt_compare(reverse_compare);\n CKERR(r);\n r = db->set_dup_compare(reverse_compare);\n CKERR(r);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, DB_CREATE, 0666);\n CKERR(r);\n\n \/* insert n unique keys {0, 1, n-1} *\/\n for (i=0; i<n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n CKERR(r);\n }\n\n \/* reopen the database to force nonleaf buffering *\/\n r = db->close(0);\n CKERR(r);\n delete db;\n\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n CKERR(r);\n r = db->set_pagesize(4096);\n CKERR(r);\n r = db->set_bt_compare(reverse_compare);\n CKERR(r);\n r = db->set_dup_compare(reverse_compare);\n CKERR(r);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, 0, 0666);\n CKERR(r);\n\n \/* insert n unique keys {n, n+1, 2*n-1} *\/\n for (i=n; i<2*n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n CKERR(r);\n }\n\n \/* verify the sort order with a cursor *\/\n Dbc *cursor;\n r = db->cursor(null_txn, &cursor, 0);\n CKERR(r);\n\n \/\/for (i=0; i<2*n; i++) \n for (i=2*n-1; i>=0; i--)\n expect(cursor, htonl(dup_flags ? n : i), htonl(i));\n\n r = cursor->close();\n CKERR(r);\n\n r = db->close(0);\n CKERR(r);\n delete db;\n}\n\nint main(int argc, const char *argv[]) {\n parse_args(argc, argv);\n\n int i;\n\n for (i = 1; i <= (1<<16); i *= 2) {\n test_reverse_compare(i, 0);\n test_reverse_compare(i, DB_DUP + DB_DUPSORT);\n }\n return 0;\n}\n<commit_msg>fix the build. addresses #277<commit_after>\/* -*- mode: C; c-basic-offset: 4 -*- *\/\n#ident \"Copyright (c) 2007 Tokutek Inc. All rights reserved.\"\n\n\/* try a reverse compare function to verify that the database always uses the application's\n compare function *\/\n\n#include <arpa\/inet.h>\n#include <assert.h>\n#include <db_cxx.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n\n#define DIR \"dir_test_reverse_compare_fun\"\nint verbose;\n\nint keycompare (const void *key1, unsigned int key1len, const void *key2, unsigned int key2len) {\n if (key1len==key2len) {\n\treturn memcmp(key1,key2,key1len);\n } else if (key1len<key2len) {\n\tint r = memcmp(key1,key2,key1len);\n\tif (r<=0) return -1; \/* If the keys are the same up to 1's length, then return -1, since key1 is shorter than key2. *\/\n\telse return 1;\n } else {\n\treturn -keycompare(key2,key2len,key1,key1len);\n }\n}\n\nint reverse_compare(Db *db __attribute__((__unused__)), const Dbt *a, const Dbt*b) {\n return -keycompare(a->get_data(), a->get_size(), b->get_data(), b->get_size());\n}\n\nvoid expect(Dbc *cursor, int k, int v) {\n Dbt key; key.set_flags(DB_DBT_MALLOC);\n Dbt val; val.set_flags(DB_DBT_MALLOC);\n int r = cursor->get(&key, &val, DB_NEXT);\n assert(r == 0);\n assert(key.get_size() == sizeof k);\n int kk;\n memcpy(&kk, key.get_data(), key.get_size());\n assert(val.get_size() == sizeof v);\n int vv;\n memcpy(&vv, val.get_data(), val.get_size());\n if (kk != k || vv != v) printf(\"expect key %d got %d - %d %d\\n\", htonl(k), htonl(kk), htonl(v), htonl(vv));\n assert(kk == k);\n assert(vv == v);\n\n free(key.get_data());\n free(val.get_data());\n}\n\nvoid test_reverse_compare(int n, int dup_flags) {\n if (verbose) printf(\"test_reverse_compare:%d %d\\n\", n, dup_flags);\n\n DbEnv * const null_env = 0;\n Db *db;\n DbTxn * const null_txn = 0;\n const char * const fname = DIR \"\/reverse.compare.db\";\n\n int r;\n int i;\n\n system(\"rm -rf \" DIR);\n mkdir(DIR, 0777);\n\n \/* create the dup database file *\/\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n assert(r == 0);\n r = db->set_pagesize(4096);\n assert(r == 0);\n r = db->set_bt_compare(reverse_compare);\n assert(r == 0);\n r = db->set_dup_compare(reverse_compare);\n assert(r == 0);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, DB_CREATE, 0666);\n assert(r == 0);\n\n \/* insert n unique keys {0, 1, n-1} *\/\n for (i=0; i<n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n assert(r == 0);\n }\n\n \/* reopen the database to force nonleaf buffering *\/\n r = db->close(0);\n assert(r == 0);\n delete db;\n\n db = new Db(null_env, 0);\n assert(db);\n r = db->set_flags(dup_flags);\n assert(r == 0);\n r = db->set_pagesize(4096);\n assert(r == 0);\n r = db->set_bt_compare(reverse_compare);\n assert(r == 0);\n r = db->set_dup_compare(reverse_compare);\n assert(r == 0);\n r = db->open(null_txn, fname, \"main\", DB_BTREE, 0, 0666);\n assert(r == 0);\n\n \/* insert n unique keys {n, n+1, 2*n-1} *\/\n for (i=n; i<2*n; i++) {\n int k, v;\n k = htonl(dup_flags ? n : i);\n Dbt key(&k, sizeof k);\n v = htonl(i);\n Dbt val(&v, sizeof v);\n r = db->put(null_txn, &key, &val, DB_YESOVERWRITE);\n assert(r == 0);\n }\n\n \/* verify the sort order with a cursor *\/\n Dbc *cursor;\n r = db->cursor(null_txn, &cursor, 0);\n assert(r == 0);\n\n \/\/for (i=0; i<2*n; i++) \n for (i=2*n-1; i>=0; i--)\n expect(cursor, htonl(dup_flags ? n : i), htonl(i));\n\n r = cursor->close();\n assert(r == 0);\n\n r = db->close(0);\n assert(r == 0);\n delete db;\n}\n\nint main(int argc, const char *argv[]) {\n int i;\n for (i = 1; i <= (1<<16); i *= 2) {\n test_reverse_compare(i, 0);\n test_reverse_compare(i, DB_DUP + DB_DUPSORT);\n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************\n filename: Sample_GLESTest.cpp\n created: Sat Nov 05 2011\n author: Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2011 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/OpenGLES\/Renderer.h\"\n#include \"CEGUI\/CEGUI.h\"\n#include <stdio.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <GLES\/egl.h>\n#include <GLES\/gl.h>\n\/\/ Include last to avoid the total fail that is the definition of things\n\/\/ like None, True and False as macros from affecting the other headers.\n#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ setup default-default path\n#ifndef CEGUI_SAMPLE_DATAPATH\n #define CEGUI_SAMPLE_DATAPATH \"..\/datafiles\"\n#endif\n\n\/\/ environment variable that overrides the location of the datafiles\n#define DATAPATH_VAR_NAME \"CEGUI_SAMPLE_DATAPATH\"\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseResourceGroupDirectories();\nvoid initialiseDefaultResourceGroups();\nconst char* getDataPathPrefix();\n\n\/\/----------------------------------------------------------------------------\/\/\nint main(int argc, char* argv[])\n{\n \/\/ Create X11 window.\n Display* dpy = XOpenDisplay(0);\n int scn = DefaultScreen(dpy);\n Window wnd = XCreateSimpleWindow(dpy, DefaultRootWindow(dpy),\n 50, 50, 480, 320, 1,\n BlackPixel(dpy, scn),\n WhitePixel(dpy, scn));\n\n XSelectInput(dpy, wnd, StructureNotifyMask |\n PointerMotionMask |\n ButtonPressMask | ButtonReleaseMask |\n KeyPressMask | KeyReleaseMask);\n XMapWindow(dpy, wnd);\n\n XEvent evt;\n while (true)\n {\n XNextEvent(dpy, &evt);\n if (evt.type == MapNotify)\n break;\n }\n\n \/\/ EGL setup\n EGLDisplay egldpy = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n\n EGLint majVer, minVer;\n eglInitialize(egldpy, &majVer, &minVer);\n\n EGLint attrs[] =\n {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES_BIT,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n\n EGLConfig config;\n EGLint numconfigs;\n eglChooseConfig(egldpy, attrs, &config, 1, &numconfigs);\n\n EGLSurface surface =\n eglCreateWindowSurface(egldpy, config, (NativeWindowType)wnd, 0);\n\n EGLContext ctx = eglCreateContext(egldpy, config, 0, 0);\n eglMakeCurrent(egldpy, surface, surface, ctx);\n\n eglBindAPI(EGL_OPENGL_ES_API);\n\n \/\/ basic gl state setup;\n glViewport(0, 0, 480, 320);\n glClearColor(0.2, 0.2, 0.2, 1);\n\n \/\/ CEGUI setup\n CEGUI::OpenGLESRenderer::bootstrapSystem();\n initialiseResourceGroupDirectories();\n initialiseDefaultResourceGroups();\n\n CEGUI::SchemeManager::getSingleton().createFromFile(\"TaharezLook.scheme\");\n CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"TaharezLook\/MouseArrow\");\n CEGUI::WindowManager& winMgr(CEGUI::WindowManager::getSingleton());\n CEGUI::Window* root = winMgr.createWindow(\"DefaultWindow\", \"root\");\n CEGUI::Window* fw = root->createChild(\"TaharezLook\/FrameWindow\");\n fw->setPosition(CEGUI::UVector2(CEGUI::UDim(0.25, 0), CEGUI::UDim(0.25, 0)));\n fw->setSize(CEGUI::USize(CEGUI::UDim(0.5, 0), CEGUI::UDim(0.5, 0)));\n fw->setText(\"OpenGL ES 1 Test\");\n\n CEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(root);\n\n \/\/ Main looop\n bool running = true;\n while (running)\n {\n while (XPending(dpy))\n {\n XNextEvent(dpy, &evt);\n\n switch (evt.type)\n {\n case KeyPress:\n {\n int kspkcr;\n KeySym* ks = XGetKeyboardMapping(dpy, evt.xkey.keycode, 1, &kspkcr);\n\n if (ks[0] == XK_Escape)\n running = false;\n\n break;\n }\n\n case MotionNotify:\n CEGUI::System::getSingleton().injectMousePosition(evt.xmotion.x, evt.xmotion.y);\n break;\n\n case ButtonPress:\n {\n CEGUI::MouseButton btn;\n if (evt.xbutton.button == Button1)\n btn = CEGUI::LeftButton;\n else if (evt.xbutton.button == Button2)\n btn = CEGUI::RightButton;\n else\n break;\n\n CEGUI::System::getSingleton().injectMouseButtonDown(btn);\n break;\n }\n \n case ButtonRelease:\n {\n CEGUI::MouseButton btn;\n if (evt.xbutton.button == Button1)\n btn = CEGUI::LeftButton;\n else if (evt.xbutton.button == Button2)\n btn = CEGUI::RightButton;\n else\n break;\n\n CEGUI::System::getSingleton().injectMouseButtonUp(btn);\n break;\n }\n \n }\n }\n\n glClear(GL_COLOR_BUFFER_BIT);\n\n CEGUI::System::getSingleton().renderAllGUIContexts();\n\n eglSwapBuffers(egldpy, surface);\n }\n\n \/\/ cleanup\n CEGUI::OpenGLESRenderer::destroySystem();\n\n eglMakeCurrent(egldpy, 0, 0, 0);\n eglDestroyContext(egldpy, ctx);\n eglDestroySurface(egldpy, surface);\n eglTerminate(dpy);\n eglReleaseThread();\n\n XCloseDisplay(dpy);\n\n return 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseResourceGroupDirectories()\n{\n \/\/ initialise the required dirs for the DefaultResourceProvider\n CEGUI::DefaultResourceProvider* rp =\n static_cast<CEGUI::DefaultResourceProvider*>\n (CEGUI::System::getSingleton().getResourceProvider());\n\n const char* dataPathPrefix = getDataPathPrefix();\n char resourcePath[PATH_MAX];\n\n \/\/ for each resource type, set a resource group directory\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"schemes\/\");\n rp->setResourceGroupDirectory(\"schemes\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"imagesets\/\");\n rp->setResourceGroupDirectory(\"imagesets\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"fonts\/\");\n rp->setResourceGroupDirectory(\"fonts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"layouts\/\");\n rp->setResourceGroupDirectory(\"layouts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"looknfeel\/\");\n rp->setResourceGroupDirectory(\"looknfeels\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"lua_scripts\/\");\n rp->setResourceGroupDirectory(\"lua_scripts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"xml_schemas\/\");\n rp->setResourceGroupDirectory(\"schemas\", resourcePath); \n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"animations\/\");\n rp->setResourceGroupDirectory(\"animations\", resourcePath); \n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseDefaultResourceGroups()\n{\n \/\/ set the default resource groups to be used\n CEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n CEGUI::Font::setDefaultResourceGroup(\"fonts\");\n CEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n CEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n CEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n CEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n CEGUI::AnimationManager::setDefaultResourceGroup(\"animations\");\n \/\/ setup default group for validation schemas\n CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n parser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst char* getDataPathPrefix()\n{\n static char dataPathPrefix[PATH_MAX];\n\n char* envDataPath = 0;\n\n \/\/ get data path from environment var\n envDataPath = getenv(DATAPATH_VAR_NAME);\n\n \/\/ set data path prefix \/ base directory. This will\n \/\/ be either from an environment variable, or from\n \/\/ a compiled in default based on original configure\n \/\/ options\n if (envDataPath != 0)\n strcpy(dataPathPrefix, envDataPath);\n else\n strcpy(dataPathPrefix, CEGUI_SAMPLE_DATAPATH);\n\n return dataPathPrefix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n<commit_msg>Fix the GLES test (hopefully)<commit_after>\/***********************************************************************\n filename: Sample_GLESTest.cpp\n created: Sat Nov 05 2011\n author: Paul D Turner <paul@cegui.org.uk>\n*************************************************************************\/\n\/***************************************************************************\n * Copyright (C) 2004 - 2011 Paul D Turner & The CEGUI Development Team\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\n * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR\n * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n ***************************************************************************\/\n#include \"CEGUI\/RendererModules\/OpenGLES\/Renderer.h\"\n#include \"CEGUI\/CEGUI.h\"\n#include <stdio.h>\n#include <limits.h>\n#include <stdlib.h>\n#include <string.h>\n\n#include <GLES\/egl.h>\n#include <GLES\/gl.h>\n\/\/ Include last to avoid the total fail that is the definition of things\n\/\/ like None, True and False as macros from affecting the other headers.\n#include <X11\/Xlib.h>\n#include <X11\/keysym.h>\n\n\/\/----------------------------------------------------------------------------\/\/\n\/\/ setup default-default path\n#ifndef CEGUI_SAMPLE_DATAPATH\n #define CEGUI_SAMPLE_DATAPATH \"..\/datafiles\"\n#endif\n\n\/\/ environment variable that overrides the location of the datafiles\n#define DATAPATH_VAR_NAME \"CEGUI_SAMPLE_DATAPATH\"\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseResourceGroupDirectories();\nvoid initialiseDefaultResourceGroups();\nconst char* getDataPathPrefix();\n\n\/\/----------------------------------------------------------------------------\/\/\nint main(int argc, char* argv[])\n{\n \/\/ Create X11 window.\n Display* dpy = XOpenDisplay(0);\n int scn = DefaultScreen(dpy);\n Window wnd = XCreateSimpleWindow(dpy, DefaultRootWindow(dpy),\n 50, 50, 480, 320, 1,\n BlackPixel(dpy, scn),\n WhitePixel(dpy, scn));\n\n XSelectInput(dpy, wnd, StructureNotifyMask |\n PointerMotionMask |\n ButtonPressMask | ButtonReleaseMask |\n KeyPressMask | KeyReleaseMask);\n XMapWindow(dpy, wnd);\n\n XEvent evt;\n while (true)\n {\n XNextEvent(dpy, &evt);\n if (evt.type == MapNotify)\n break;\n }\n\n \/\/ EGL setup\n EGLDisplay egldpy = eglGetDisplay(EGL_DEFAULT_DISPLAY);\n\n EGLint majVer, minVer;\n eglInitialize(egldpy, &majVer, &minVer);\n\n EGLint attrs[] =\n {\n EGL_RED_SIZE, 8,\n EGL_GREEN_SIZE, 8,\n EGL_BLUE_SIZE, 8,\n EGL_RENDERABLE_TYPE, EGL_OPENGL_ES_BIT,\n EGL_SURFACE_TYPE, EGL_WINDOW_BIT,\n EGL_NONE\n };\n\n EGLConfig config;\n EGLint numconfigs;\n eglChooseConfig(egldpy, attrs, &config, 1, &numconfigs);\n\n EGLSurface surface =\n eglCreateWindowSurface(egldpy, config, (NativeWindowType)wnd, 0);\n\n EGLContext ctx = eglCreateContext(egldpy, config, 0, 0);\n eglMakeCurrent(egldpy, surface, surface, ctx);\n\n eglBindAPI(EGL_OPENGL_ES_API);\n\n \/\/ basic gl state setup;\n glViewport(0, 0, 480, 320);\n glClearColor(0.2, 0.2, 0.2, 1);\n\n \/\/ CEGUI setup\n CEGUI::OpenGLESRenderer::bootstrapSystem();\n initialiseResourceGroupDirectories();\n initialiseDefaultResourceGroups();\n\n CEGUI::SchemeManager::getSingleton().createFromFile(\"TaharezLook.scheme\");\n CEGUI::System::getSingleton().getDefaultGUIContext().getMouseCursor().setDefaultImage(\"TaharezLook\/MouseArrow\");\n CEGUI::WindowManager& winMgr(CEGUI::WindowManager::getSingleton());\n CEGUI::Window* root = winMgr.createWindow(\"DefaultWindow\", \"root\");\n CEGUI::Window* fw = root->createChild(\"TaharezLook\/FrameWindow\");\n fw->setPosition(CEGUI::UVector2(CEGUI::UDim(0.25, 0), CEGUI::UDim(0.25, 0)));\n fw->setSize(CEGUI::USize(CEGUI::UDim(0.5, 0), CEGUI::UDim(0.5, 0)));\n fw->setText(\"OpenGL ES 1 Test\");\n\n CEGUI::System::getSingleton().getDefaultGUIContext().setRootWindow(root);\n\n \/\/ Main looop\n bool running = true;\n while (running)\n {\n while (XPending(dpy))\n {\n XNextEvent(dpy, &evt);\n\n switch (evt.type)\n {\n case KeyPress:\n {\n int kspkcr;\n KeySym* ks = XGetKeyboardMapping(dpy, evt.xkey.keycode, 1, &kspkcr);\n\n if (ks[0] == XK_Escape)\n running = false;\n\n break;\n }\n\n case MotionNotify:\n CEGUI::System::getSingleton().getDefaultGUIContext().injectMousePosition(evt.xmotion.x, evt.xmotion.y);\n break;\n\n case ButtonPress:\n {\n CEGUI::MouseButton btn;\n if (evt.xbutton.button == Button1)\n btn = CEGUI::LeftButton;\n else if (evt.xbutton.button == Button2)\n btn = CEGUI::RightButton;\n else\n break;\n\n CEGUI::System::getSingleton().getDefaultGUIContext().injectMouseButtonDown(btn);\n break;\n }\n \n case ButtonRelease:\n {\n CEGUI::MouseButton btn;\n if (evt.xbutton.button == Button1)\n btn = CEGUI::LeftButton;\n else if (evt.xbutton.button == Button2)\n btn = CEGUI::RightButton;\n else\n break;\n\n CEGUI::System::getSingleton().getDefaultGUIContext().injectMouseButtonUp(btn);\n break;\n }\n \n }\n }\n\n glClear(GL_COLOR_BUFFER_BIT);\n\n CEGUI::System::getSingleton().renderAllGUIContexts();\n\n eglSwapBuffers(egldpy, surface);\n }\n\n \/\/ cleanup\n CEGUI::OpenGLESRenderer::destroySystem();\n\n eglMakeCurrent(egldpy, 0, 0, 0);\n eglDestroyContext(egldpy, ctx);\n eglDestroySurface(egldpy, surface);\n eglTerminate(dpy);\n eglReleaseThread();\n\n XCloseDisplay(dpy);\n\n return 0;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseResourceGroupDirectories()\n{\n \/\/ initialise the required dirs for the DefaultResourceProvider\n CEGUI::DefaultResourceProvider* rp =\n static_cast<CEGUI::DefaultResourceProvider*>\n (CEGUI::System::getSingleton().getResourceProvider());\n\n const char* dataPathPrefix = getDataPathPrefix();\n char resourcePath[PATH_MAX];\n\n \/\/ for each resource type, set a resource group directory\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"schemes\/\");\n rp->setResourceGroupDirectory(\"schemes\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"imagesets\/\");\n rp->setResourceGroupDirectory(\"imagesets\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"fonts\/\");\n rp->setResourceGroupDirectory(\"fonts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"layouts\/\");\n rp->setResourceGroupDirectory(\"layouts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"looknfeel\/\");\n rp->setResourceGroupDirectory(\"looknfeels\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"lua_scripts\/\");\n rp->setResourceGroupDirectory(\"lua_scripts\", resourcePath);\n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"xml_schemas\/\");\n rp->setResourceGroupDirectory(\"schemas\", resourcePath); \n sprintf(resourcePath, \"%s\/%s\", dataPathPrefix, \"animations\/\");\n rp->setResourceGroupDirectory(\"animations\", resourcePath); \n}\n\n\/\/----------------------------------------------------------------------------\/\/\nvoid initialiseDefaultResourceGroups()\n{\n \/\/ set the default resource groups to be used\n CEGUI::ImageManager::setImagesetDefaultResourceGroup(\"imagesets\");\n CEGUI::Font::setDefaultResourceGroup(\"fonts\");\n CEGUI::Scheme::setDefaultResourceGroup(\"schemes\");\n CEGUI::WidgetLookManager::setDefaultResourceGroup(\"looknfeels\");\n CEGUI::WindowManager::setDefaultResourceGroup(\"layouts\");\n CEGUI::ScriptModule::setDefaultResourceGroup(\"lua_scripts\");\n CEGUI::AnimationManager::setDefaultResourceGroup(\"animations\");\n \/\/ setup default group for validation schemas\n CEGUI::XMLParser* parser = CEGUI::System::getSingleton().getXMLParser();\n if (parser->isPropertyPresent(\"SchemaDefaultResourceGroup\"))\n parser->setProperty(\"SchemaDefaultResourceGroup\", \"schemas\");\n}\n\n\/\/----------------------------------------------------------------------------\/\/\nconst char* getDataPathPrefix()\n{\n static char dataPathPrefix[PATH_MAX];\n\n char* envDataPath = 0;\n\n \/\/ get data path from environment var\n envDataPath = getenv(DATAPATH_VAR_NAME);\n\n \/\/ set data path prefix \/ base directory. This will\n \/\/ be either from an environment variable, or from\n \/\/ a compiled in default based on original configure\n \/\/ options\n if (envDataPath != 0)\n strcpy(dataPathPrefix, envDataPath);\n else\n strcpy(dataPathPrefix, CEGUI_SAMPLE_DATAPATH);\n\n return dataPathPrefix;\n}\n\n\/\/----------------------------------------------------------------------------\/\/\n<|endoftext|>"} {"text":"<commit_before>#include \"xchainer\/array.h\"\n\n#include <cassert>\n#include <cstring>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda.h>\n#include <cuda_runtime.h>\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\n#include \"xchainer\/array_math.h\"\n#include \"xchainer\/array_repr.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/array_math.h\"\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/op_node.h\"\n\nnamespace xchainer {\n\nnamespace {\n\n#ifdef XCHAINER_ENABLE_CUDA\nstd::shared_ptr<void> AllocateCudaManaged(size_t size) {\n std::shared_ptr<void> ptr{};\n {\n void* raw_ptr = nullptr;\n auto raw_ptr_scope = gsl::finally([&]() {\n if (raw_ptr && !ptr) {\n cudaFree(raw_ptr);\n }\n });\n cuda::CheckError(cudaMallocManaged(&raw_ptr, size, cudaMemAttachGlobal));\n ptr.reset(raw_ptr, cudaFree);\n }\n return ptr;\n}\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\nstd::shared_ptr<void> Allocate(const Device& device, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n return std::make_unique<uint8_t[]>(size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n return AllocateCudaManaged(size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid MemoryCopy(const Device& device, void* dst_ptr, const void* src_ptr, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n std::memcpy(dst_ptr, src_ptr, size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n cuda::CheckError(cudaMemcpy(dst_ptr, src_ptr, size, cudaMemcpyHostToDevice));\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\n} \/\/ namespace\n\nArray::Array(const Shape& shape, Dtype dtype, std::shared_ptr<void> data, bool requires_grad, int64_t offset)\n : shape_(shape),\n is_contiguous_(true),\n dtype_(dtype),\n data_(nullptr),\n requires_grad_(requires_grad),\n offset_(offset),\n node_(std::make_shared<ArrayNode>()) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n data_ = std::move(data);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n size_t size = static_cast<size_t>(shape_.total_size() * GetElementSize(dtype));\n data_ = AllocateCudaManaged(size);\n MemoryCopy(device, data_.get(), data.get(), size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray Array::Empty(const Shape& shape, Dtype dtype) {\n size_t size = static_cast<size_t>(shape.total_size() * GetElementSize(dtype));\n std::shared_ptr<void> data = Allocate(GetCurrentDevice(), size);\n return {shape, dtype, data};\n}\n\nArray Array::EmptyLike(const Array& array) { return Empty(array.shape(), array.dtype()); }\n\nArray Array::DeepCopy() const {\n auto bytes = total_bytes();\n if (GetCurrentDevice() == MakeDevice(\"cpu\")) {\n std::shared_ptr<void> ret_data = std::make_unique<uint8_t[]>(bytes);\n std::memcpy(ret_data.get(), data_.get(), bytes);\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (GetCurrentDevice() == MakeDevice(\"cuda\")) {\n void* ret_ptr = nullptr;\n cuda::CheckError(cudaMallocManaged(&ret_ptr, bytes, cudaMemAttachGlobal));\n std::shared_ptr<void> ret_data(ret_ptr, ::cudaFree);\n cuda::CheckError(cudaMemcpy(ret_ptr, data_.get(), bytes, cudaMemcpyDeviceToDevice));\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray& Array::operator+=(const Array& rhs) {\n Add(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray& Array::operator*=(const Array& rhs) {\n Mul(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray Array::operator+(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Add(rhs, out);\n return out;\n}\n\nArray Array::operator*(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Mul(rhs, out);\n return out;\n}\n\nvoid Array::Add(const Array& rhs, Array& out) const {\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n const Array& lhs = *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n auto lhs_func = lhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"add\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Add(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Add(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Mul(const Array& rhs, Array& out) const {\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n \/\/ deep copy for in-place operation to keep original input\n const Array& lhs = (this == &out) ? DeepCopy() : *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n \/\/ TODO(sonots): turn off constructing graph (requires_grad) in backward (but, turn on for double backprop)\n auto lhs_func = lhs.requires_grad() ? [rhs](const Array& gout) { return gout * rhs; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [lhs](const Array& gout) { return gout * lhs; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"mul\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Mul(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Mul(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nstd::string Array::ToString() const { return ArrayRepr(*this); }\n\nnamespace {\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const ArrayNode& array_node, int indent) {\n static const char kIndentChar = ' ';\n\n os << std::string(static_cast<size_t>(indent * 2), kIndentChar) << \"ArrayNode<\" << &array_node << \">\" << std::endl;\n\n std::shared_ptr<const OpNode> op = array_node.next_node();\n if (op) {\n os << std::string(static_cast<size_t>((indent + 1) * 2), kIndentChar) << \"Op<\" << op->name() << \">\" << std::endl;\n for (const std::shared_ptr<const ArrayNode>& next_node : op->next_nodes()) {\n DebugDumpComputationalGraph(os, *next_node, static_cast<size_t>(indent + 2));\n }\n }\n}\n\n} \/\/ namespace\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const Array& array, int indent) {\n DebugDumpComputationalGraph(os, *array.node(), indent);\n}\n\n} \/\/ namespace xchainer\n<commit_msg>Add TODO comments<commit_after>#include \"xchainer\/array.h\"\n\n#include <cassert>\n#include <cstring>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda.h>\n#include <cuda_runtime.h>\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\n#include \"xchainer\/array_math.h\"\n#include \"xchainer\/array_repr.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/array_math.h\"\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/op_node.h\"\n\nnamespace xchainer {\n\nnamespace {\n\n#ifdef XCHAINER_ENABLE_CUDA\nstd::shared_ptr<void> AllocateCudaManaged(size_t size) {\n std::shared_ptr<void> ptr{};\n {\n void* raw_ptr = nullptr;\n auto raw_ptr_scope = gsl::finally([&]() {\n if (raw_ptr && !ptr) {\n cudaFree(raw_ptr);\n }\n });\n cuda::CheckError(cudaMallocManaged(&raw_ptr, size, cudaMemAttachGlobal));\n ptr.reset(raw_ptr, cudaFree);\n }\n return ptr;\n}\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\nstd::shared_ptr<void> Allocate(const Device& device, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n return std::make_unique<uint8_t[]>(size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n return AllocateCudaManaged(size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid MemoryCopy(const Device& device, void* dst_ptr, const void* src_ptr, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n std::memcpy(dst_ptr, src_ptr, size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n cuda::CheckError(cudaMemcpy(dst_ptr, src_ptr, size, cudaMemcpyHostToDevice));\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\n} \/\/ namespace\n\nArray::Array(const Shape& shape, Dtype dtype, std::shared_ptr<void> data, bool requires_grad, int64_t offset)\n : shape_(shape),\n is_contiguous_(true),\n dtype_(dtype),\n data_(nullptr),\n requires_grad_(requires_grad),\n offset_(offset),\n node_(std::make_shared<ArrayNode>()) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n data_ = std::move(data);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n size_t size = static_cast<size_t>(shape_.total_size() * GetElementSize(dtype));\n data_ = AllocateCudaManaged(size);\n MemoryCopy(device, data_.get(), data.get(), size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray Array::Empty(const Shape& shape, Dtype dtype) {\n size_t size = static_cast<size_t>(shape.total_size() * GetElementSize(dtype));\n std::shared_ptr<void> data = Allocate(GetCurrentDevice(), size);\n return {shape, dtype, data};\n}\n\nArray Array::EmptyLike(const Array& array) { return Empty(array.shape(), array.dtype()); }\n\nArray Array::DeepCopy() const {\n auto bytes = total_bytes();\n if (GetCurrentDevice() == MakeDevice(\"cpu\")) {\n std::shared_ptr<void> ret_data = std::make_unique<uint8_t[]>(bytes);\n std::memcpy(ret_data.get(), data_.get(), bytes);\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (GetCurrentDevice() == MakeDevice(\"cuda\")) {\n \/\/ TODO(sonots): Better to use abstraction layer such as Allocate or MemoryCopy,\n \/\/ but they do not support all cases such as device to device, yet. We need refactoring.\n void* ret_ptr = nullptr;\n cuda::CheckError(cudaMallocManaged(&ret_ptr, bytes, cudaMemAttachGlobal));\n std::shared_ptr<void> ret_data(ret_ptr, ::cudaFree);\n cuda::CheckError(cudaMemcpy(ret_ptr, data_.get(), bytes, cudaMemcpyDeviceToDevice));\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray& Array::operator+=(const Array& rhs) {\n Add(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray& Array::operator*=(const Array& rhs) {\n Mul(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray Array::operator+(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Add(rhs, out);\n return out;\n}\n\nArray Array::operator*(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Mul(rhs, out);\n return out;\n}\n\nvoid Array::Add(const Array& rhs, Array& out) const {\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n const Array& lhs = *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n auto lhs_func = lhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"add\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Add(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Add(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Mul(const Array& rhs, Array& out) const {\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n \/\/ deep copy for in-place operation to keep original input\n const Array& lhs = (this == &out) ? DeepCopy() : *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n \/\/ TODO(sonots): turn off constructing graph (requires_grad) in backward (but, turn on for double backprop)\n auto lhs_func = lhs.requires_grad() ? [rhs](const Array& gout) { return gout * rhs; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [lhs](const Array& gout) { return gout * lhs; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"mul\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Mul(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Mul(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nstd::string Array::ToString() const { return ArrayRepr(*this); }\n\nnamespace {\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const ArrayNode& array_node, int indent) {\n static const char kIndentChar = ' ';\n\n os << std::string(static_cast<size_t>(indent * 2), kIndentChar) << \"ArrayNode<\" << &array_node << \">\" << std::endl;\n\n std::shared_ptr<const OpNode> op = array_node.next_node();\n if (op) {\n os << std::string(static_cast<size_t>((indent + 1) * 2), kIndentChar) << \"Op<\" << op->name() << \">\" << std::endl;\n for (const std::shared_ptr<const ArrayNode>& next_node : op->next_nodes()) {\n DebugDumpComputationalGraph(os, *next_node, static_cast<size_t>(indent + 2));\n }\n }\n}\n\n} \/\/ namespace\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const Array& array, int indent) {\n DebugDumpComputationalGraph(os, *array.node(), indent);\n}\n\n} \/\/ namespace xchainer\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\r\n**\r\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\r\n** All rights reserved.\r\n** Contact: Nokia Corporation (qt-info@nokia.com)\r\n**\r\n** This file is part of the Qt Mobility Components.\r\n**\r\n** $QT_BEGIN_LICENSE:LGPL$\r\n** No Commercial Usage\r\n** This file contains pre-release code and may not be distributed.\r\n** You may use this file in accordance with the terms and conditions\r\n** contained in the Technology Preview License Agreement accompanying\r\n** this package.\r\n**\r\n** GNU Lesser General Public License Usage\r\n** Alternatively, this file may be used under the terms of the GNU Lesser\r\n** General Public License version 2.1 as published by the Free Software\r\n** Foundation and appearing in the file LICENSE.LGPL included in the\r\n** packaging of this file. Please review the following information to\r\n** ensure the GNU Lesser General Public License version 2.1 requirements\r\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\r\n**\r\n** In addition, as a special exception, Nokia gives you certain additional\r\n** rights. These rights are described in the Nokia Qt LGPL Exception\r\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n** If you have questions regarding the use of this file, please contact\r\n** Nokia at qt-info@nokia.com.\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n** $QT_END_LICENSE$\r\n**\r\n****************************************************************************\/\r\n\r\n#include \"qgeopositioninfosource_maemo_p.h\"\r\n#include <iostream>\r\n\r\n#ifdef Q_WS_MAEMO_5\r\n#include <QDateTime>\r\n#endif\r\n#if 0\r\nvoid dumpQByteArray(const QByteArray &msg)\r\n{\r\n std::cout << \"QByteArray dump:\\n\";\r\n std::cout << msg.size() << \" \\n\";\r\n int i = msg.size();\r\n for (int k = 0; k < i ;k++)\r\n printf(\"msg[%d]=%2.2x\\n\", k, (unsigned char)msg[k]);\r\n}\r\n#endif\r\n\r\nusing namespace std;\r\n\r\nQTM_BEGIN_NAMESPACE\r\n\r\nQGeoPositionInfoSourceMaemo::QGeoPositionInfoSourceMaemo(QObject *parent): QGeoPositionInfoSource(parent)\r\n{\r\n \/\/ default values\r\n#ifdef Q_WS_MAEMO_5\r\n time_interval_ = LOCATION_INTERVAL_5S;\r\n availableMethods = SatellitePositioningMethods;\r\n#else\r\n time_interval_ = 5000;\r\n availableMethods = AllPositioningMethods; \r\n#endif\r\n distance_interval_ = 10;\r\n registered_ = false;\r\n validLastUpdate = false;\r\n validLastSatUpdate = false;\r\n}\r\n\r\nint QGeoPositionInfoSourceMaemo::init()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n g_type_init();\r\n\r\n locationControl = location_gpsd_control_get_default();\r\n if(locationControl) { \r\n g_object_set(G_OBJECT(locationControl),\r\n \"preferred-method\", LOCATION_METHOD_USER_SELECTED,\r\n \"preferred-interval\", time_interval_,\r\n NULL);\r\n } else {\r\n return -1;\r\n }\r\n\r\n locationDevice = \r\n (LocationGPSDevice*)g_object_new(LOCATION_TYPE_GPS_DEVICE, \r\n NULL);\r\n\r\n if(locationDevice) {\r\n errorHandlerId =\r\n g_signal_connect(G_OBJECT(locationControl), \"error-verbose\",\r\n G_CALLBACK(&locationError), \r\n static_cast<void*>(this));\r\n posChangedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"changed\",\r\n G_CALLBACK(&locationChanged), \r\n static_cast<void*>(this));\r\n connectedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"connected\",\r\n G_CALLBACK(&deviceConnected), \r\n static_cast<void*>(this));\r\n disconnectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"disconnected\",\r\n G_CALLBACK(&deviceDisconnected), \r\n static_cast<void*>(this));\r\n return 0;\r\n } else {\r\n return -1;\r\n }\r\n#else\r\n int status;\r\n\r\n dbusComm = new DBusComm();\r\n status = dbusComm->init();\r\n\r\n QObject::connect(dbusComm, SIGNAL(receivedMessage(const QByteArray &)),\r\n this, SLOT(dbusMessages(const QByteArray &)));\r\n\r\n QObject::connect(dbusComm, SIGNAL(receivedPositionUpdate(const QGeoPositionInfo &)),\r\n this, SLOT(newPositionUpdate(const QGeoPositionInfo &)));\r\n return status;\r\n#endif \/\/ Q_WS_MAEMO_5\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::dbusMessages(const QByteArray &msg)\r\n{\r\n Q_UNUSED(msg)\r\n \/\/ stub\r\n\r\n return;\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::newPositionUpdate(const QGeoPositionInfo &update)\r\n{\r\n lastSatUpdate = update;\r\n validLastSatUpdate = true;\r\n emit positionUpdated(update);\r\n}\r\n\r\n\r\nQGeoPositionInfo QGeoPositionInfoSourceMaemo::lastKnownPosition(bool fromSatellitePositioningMethodsOnly) const\r\n{\r\n if (validLastSatUpdate)\r\n return lastSatUpdate;\r\n\r\n if (!fromSatellitePositioningMethodsOnly)\r\n if (validLastUpdate)\r\n return lastUpdate;\r\n\r\n return QGeoPositionInfo();\r\n}\r\n\r\n\r\nQGeoPositionInfoSource::PositioningMethods QGeoPositionInfoSourceMaemo::supportedPositioningMethods() const\r\n{\r\n return availableMethods;\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setUpdateInterval(int msec)\r\n{\r\n msec = (msec < MinimumUpdateInterval) ? MinimumUpdateInterval : msec;\r\n\r\n#ifdef Q_WS_MAEMO_5\r\n time_interval_ = mapUpdateInterval(msec);\r\n QGeoPositionInfoSource::setUpdateInterval(time_interval_*100); \r\n if(locationControl) {\r\n g_object_set(G_OBJECT(locationControl),\r\n \"preferred-method\", LOCATION_METHOD_USER_SELECTED,\r\n \"preferred-interval\", time_interval_,\r\n NULL) ; \r\n }\r\n#else\r\n QGeoPositionInfoSource::setUpdateInterval(msec);\r\n\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n dbusComm->sessionConfigRequest(dbusComm->CmdSetInterval, 0, msec);\r\n#endif\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setPreferredPositioningMethods(PositioningMethods sources)\r\n{\r\n#ifdef Q_WS_MAEMO_5 \r\n return;\r\n#else\r\n QGeoPositionInfoSource::setPreferredPositioningMethods(sources);\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n dbusComm->sessionConfigRequest(dbusComm->CmdSetMethods, sources, 0);\r\n#endif\r\n}\r\n\r\n\r\nint QGeoPositionInfoSourceMaemo::minimumUpdateInterval() const\r\n{\r\n return MinimumUpdateInterval;\r\n}\r\n\r\n\/\/ public slots:\r\nvoid QGeoPositionInfoSourceMaemo::startUpdates()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n if(locationControl) {\r\n if(!errorHandlerId) {\r\n errorHandlerId =\r\n g_signal_connect(G_OBJECT(locationControl), \"error-verbose\",\r\n G_CALLBACK(&locationError), \r\n static_cast<void*>(this)); \r\n }\r\n\r\n if(!posChangedId) {\r\n posChangedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"changed\",\r\n G_CALLBACK(&locationChanged), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n if(!connectedId) {\r\n connectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"connected\",\r\n G_CALLBACK(&deviceConnected), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n if(!disconnectedId) {\r\n disconnectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"disconnected\",\r\n G_CALLBACK(&deviceDisconnected), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n location_gpsd_control_start(locationControl);\r\n } else {\r\n \r\n }\r\n#else\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n\r\n int cmd = dbusComm->CmdStart;\r\n dbusComm->sessionConfigRequest(cmd, 222, time_interval_);\r\n#endif\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::stopUpdates()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n if(locationControl) {\r\n if(errorHandlerId)\r\n g_signal_handler_disconnect(G_OBJECT(locationControl), \r\n errorHandlerId);\r\n if(posChangedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n posChangedId);\r\n if(connectedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n connectedId);\r\n if(disconnectedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n disconnectedId);\r\n errorHandlerId = 0;\r\n posChangedId = 0;\r\n connectedId = 0;\r\n disconnectedId = 0; \r\n location_gpsd_control_stop(locationControl);\r\n }\r\n#else\r\n if (registered_ == false)\r\n return; \/\/ nothing to stop\r\n dbusComm->sessionConfigRequest(dbusComm->CmdStop, 0, 0);\r\n#endif\r\n}\r\n\r\n\/\/ Stub\r\n\r\nvoid QGeoPositionInfoSourceMaemo::requestUpdate(int timeout)\r\n{\r\n if (timeout) {}\r\n}\r\n\r\n#ifdef Q_WS_MAEMO_5\r\nvoid QGeoPositionInfoSourceMaemo::locationError(LocationGPSDevice *device,\r\n gint errorCode, gpointer data)\r\n{\r\n QString locationError;\r\n\r\n switch (errorCode) {\r\n case LOCATION_ERROR_USER_REJECTED_DIALOG:\r\n locationError = \"User didn't enable requested methods\";\r\n break;\r\n case LOCATION_ERROR_USER_REJECTED_SETTINGS:\r\n locationError = \"User changed settings, which disabled location.\";\r\n break;\r\n case LOCATION_ERROR_BT_GPS_NOT_AVAILABLE:\r\n locationError = \"Problems with BT GPS\";\r\n break;\r\n case LOCATION_ERROR_METHOD_NOT_ALLOWED_IN_OFFLINE_MODE:\r\n locationError = \"Requested method is not allowed in offline mode\";\r\n break;\r\n case LOCATION_ERROR_SYSTEM:\r\n locationError = \"System error.\";\r\n break;\r\n default:\r\n locationError = \"Unknown error.\";\r\n }\r\n\r\n qDebug() << \"Location error:\" << locationError;\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::deviceDisconnected(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n Q_UNUSED(device)\r\n\r\n if (!data)\r\n return;\r\n\r\n QGeoPositionInfoSourceMaemo *object = (QGeoPositionInfoSourceMaemo *)data;\r\n object->setOnline(false);\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::deviceConnected(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n Q_UNUSED(device)\r\n\r\n if (!data)\r\n return;\r\n\r\n QGeoPositionInfoSourceMaemo *object = (QGeoPositionInfoSourceMaemo *)data;\r\n object->setOnline(true);\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setOnline(bool status)\r\n{\r\n emit online(status);\r\n}\r\n\r\nbool QGeoPositionInfoSourceMaemo::isOnline() const\r\n{\r\n if (!locationDevice) {\r\n return false;\r\n }\r\n\r\n return locationDevice->online == 1;\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::locationChanged(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n QGeoPositionInfo posInfo;\r\n QGeoCoordinate coordinate;\r\n QGeoPositionInfoSourceMaemo *object;\r\n\r\n\r\n if (!data || !device)\r\n return;\r\n\r\n object = (QGeoPositionInfoSourceMaemo *)data;\r\n\r\n if (device && device->fix) {\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_TIME_SET) {\r\n posInfo.setDateTime(QDateTime::fromTime_t(device->fix->time));\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_LATLONG_SET) {\r\n coordinate.setLatitude(device->fix->latitude);\r\n coordinate.setLongitude(device->fix->longitude);\r\n posInfo.setAttribute(QGeoPositionInfo::HorizontalAccuracy,\r\n device->fix->eph);\r\n posInfo.setAttribute(QGeoPositionInfo::VerticalAccuracy,\r\n device->fix->epv);\r\n\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_ALTITUDE_SET) {\r\n coordinate.setAltitude(device->fix->altitude);\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_SPEED_SET) {\r\n posInfo.setAttribute(QGeoPositionInfo::GroundSpeed,\r\n device->fix->speed);\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_TRACK_SET) {\r\n posInfo.setAttribute(QGeoPositionInfo::Direction,\r\n device->fix->track); \r\n }\r\n\r\n }\r\n \r\n if(device->status == LOCATION_GPS_DEVICE_STATUS_FIX) {\r\n posInfo.setCoordinate(coordinate); \r\n object->setLocation(posInfo);\r\n }\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setLocation(const QGeoPositionInfo &update)\r\n{\r\n lastSatUpdate = update;\r\n validLastSatUpdate = true;\r\n emit positionUpdated(update);\r\n}\r\n\r\nint QGeoPositionInfoSourceMaemo::mapUpdateInterval(int msec) {\r\n if (msec < 1000)\r\n return LOCATION_INTERVAL_1S;\r\n else if ((msec >= 1000) && (msec < 3500))\r\n return LOCATION_INTERVAL_2S;\r\n else if ((msec >= 3500) && (msec < 7500))\r\n return LOCATION_INTERVAL_5S;\r\n else if ((msec >= 7500) && (msec < 15000))\r\n return LOCATION_INTERVAL_10S;\r\n else if ((msec >= 15000) && (msec < 25000))\r\n return LOCATION_INTERVAL_20S;\r\n else if ((msec >= 25000) && (msec < 45000))\r\n return LOCATION_INTERVAL_30S;\r\n else if ((msec >= 45000) && (msec < 90000))\r\n return LOCATION_INTERVAL_60S;\r\n else if (msec >= 90000)\r\n return LOCATION_INTERVAL_120S;\r\n}\r\n \r\n#endif \/\/ Q_WS_MAEMO_5\r\n\r\n\r\n#include \"moc_qgeopositioninfosource_maemo_p.cpp\"\r\nQTM_END_NAMESPACE\r\n\r\n<commit_msg>Initial interval changed to LOCATION_INTERVAL_DEFAULT.<commit_after>\/****************************************************************************\r\n**\r\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\r\n** All rights reserved.\r\n** Contact: Nokia Corporation (qt-info@nokia.com)\r\n**\r\n** This file is part of the Qt Mobility Components.\r\n**\r\n** $QT_BEGIN_LICENSE:LGPL$\r\n** No Commercial Usage\r\n** This file contains pre-release code and may not be distributed.\r\n** You may use this file in accordance with the terms and conditions\r\n** contained in the Technology Preview License Agreement accompanying\r\n** this package.\r\n**\r\n** GNU Lesser General Public License Usage\r\n** Alternatively, this file may be used under the terms of the GNU Lesser\r\n** General Public License version 2.1 as published by the Free Software\r\n** Foundation and appearing in the file LICENSE.LGPL included in the\r\n** packaging of this file. Please review the following information to\r\n** ensure the GNU Lesser General Public License version 2.1 requirements\r\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\r\n**\r\n** In addition, as a special exception, Nokia gives you certain additional\r\n** rights. These rights are described in the Nokia Qt LGPL Exception\r\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n** If you have questions regarding the use of this file, please contact\r\n** Nokia at qt-info@nokia.com.\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n**\r\n** $QT_END_LICENSE$\r\n**\r\n****************************************************************************\/\r\n\r\n#include \"qgeopositioninfosource_maemo_p.h\"\r\n#include <iostream>\r\n\r\n#ifdef Q_WS_MAEMO_5\r\n#include <QDateTime>\r\n#endif\r\n#if 0\r\nvoid dumpQByteArray(const QByteArray &msg)\r\n{\r\n std::cout << \"QByteArray dump:\\n\";\r\n std::cout << msg.size() << \" \\n\";\r\n int i = msg.size();\r\n for (int k = 0; k < i ;k++)\r\n printf(\"msg[%d]=%2.2x\\n\", k, (unsigned char)msg[k]);\r\n}\r\n#endif\r\n\r\nusing namespace std;\r\n\r\nQTM_BEGIN_NAMESPACE\r\n\r\nQGeoPositionInfoSourceMaemo::QGeoPositionInfoSourceMaemo(QObject *parent): QGeoPositionInfoSource(parent)\r\n{\r\n \/\/ default values\r\n#ifdef Q_WS_MAEMO_5\r\n time_interval_ = LOCATION_INTERVAL_DEFAULT;\r\n availableMethods = SatellitePositioningMethods;\r\n#else\r\n time_interval_ = 5000;\r\n availableMethods = AllPositioningMethods; \r\n#endif\r\n distance_interval_ = 10;\r\n registered_ = false;\r\n validLastUpdate = false;\r\n validLastSatUpdate = false;\r\n}\r\n\r\nint QGeoPositionInfoSourceMaemo::init()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n g_type_init();\r\n\r\n locationControl = location_gpsd_control_get_default();\r\n if(locationControl) { \r\n g_object_set(G_OBJECT(locationControl),\r\n \"preferred-method\", LOCATION_METHOD_USER_SELECTED,\r\n \"preferred-interval\", time_interval_,\r\n NULL);\r\n } else {\r\n return -1;\r\n }\r\n\r\n locationDevice = \r\n (LocationGPSDevice*)g_object_new(LOCATION_TYPE_GPS_DEVICE, \r\n NULL);\r\n\r\n if(locationDevice) {\r\n errorHandlerId =\r\n g_signal_connect(G_OBJECT(locationControl), \"error-verbose\",\r\n G_CALLBACK(&locationError), \r\n static_cast<void*>(this));\r\n posChangedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"changed\",\r\n G_CALLBACK(&locationChanged), \r\n static_cast<void*>(this));\r\n connectedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"connected\",\r\n G_CALLBACK(&deviceConnected), \r\n static_cast<void*>(this));\r\n disconnectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"disconnected\",\r\n G_CALLBACK(&deviceDisconnected), \r\n static_cast<void*>(this));\r\n return 0;\r\n } else {\r\n return -1;\r\n }\r\n#else\r\n int status;\r\n\r\n dbusComm = new DBusComm();\r\n status = dbusComm->init();\r\n\r\n QObject::connect(dbusComm, SIGNAL(receivedMessage(const QByteArray &)),\r\n this, SLOT(dbusMessages(const QByteArray &)));\r\n\r\n QObject::connect(dbusComm, SIGNAL(receivedPositionUpdate(const QGeoPositionInfo &)),\r\n this, SLOT(newPositionUpdate(const QGeoPositionInfo &)));\r\n return status;\r\n#endif \/\/ Q_WS_MAEMO_5\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::dbusMessages(const QByteArray &msg)\r\n{\r\n Q_UNUSED(msg)\r\n \/\/ stub\r\n\r\n return;\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::newPositionUpdate(const QGeoPositionInfo &update)\r\n{\r\n lastSatUpdate = update;\r\n validLastSatUpdate = true;\r\n emit positionUpdated(update);\r\n}\r\n\r\n\r\nQGeoPositionInfo QGeoPositionInfoSourceMaemo::lastKnownPosition(bool fromSatellitePositioningMethodsOnly) const\r\n{\r\n if (validLastSatUpdate)\r\n return lastSatUpdate;\r\n\r\n if (!fromSatellitePositioningMethodsOnly)\r\n if (validLastUpdate)\r\n return lastUpdate;\r\n\r\n return QGeoPositionInfo();\r\n}\r\n\r\n\r\nQGeoPositionInfoSource::PositioningMethods QGeoPositionInfoSourceMaemo::supportedPositioningMethods() const\r\n{\r\n return availableMethods;\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setUpdateInterval(int msec)\r\n{\r\n msec = (msec < MinimumUpdateInterval) ? MinimumUpdateInterval : msec;\r\n\r\n#ifdef Q_WS_MAEMO_5\r\n time_interval_ = mapUpdateInterval(msec);\r\n QGeoPositionInfoSource::setUpdateInterval(time_interval_*100); \r\n if(locationControl) {\r\n g_object_set(G_OBJECT(locationControl),\r\n \"preferred-method\", LOCATION_METHOD_USER_SELECTED,\r\n \"preferred-interval\", time_interval_,\r\n NULL) ; \r\n }\r\n#else\r\n QGeoPositionInfoSource::setUpdateInterval(msec);\r\n\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n dbusComm->sessionConfigRequest(dbusComm->CmdSetInterval, 0, msec);\r\n#endif\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setPreferredPositioningMethods(PositioningMethods sources)\r\n{\r\n#ifdef Q_WS_MAEMO_5 \r\n return;\r\n#else\r\n QGeoPositionInfoSource::setPreferredPositioningMethods(sources);\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n dbusComm->sessionConfigRequest(dbusComm->CmdSetMethods, sources, 0);\r\n#endif\r\n}\r\n\r\n\r\nint QGeoPositionInfoSourceMaemo::minimumUpdateInterval() const\r\n{\r\n return MinimumUpdateInterval;\r\n}\r\n\r\n\/\/ public slots:\r\nvoid QGeoPositionInfoSourceMaemo::startUpdates()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n if(locationControl) {\r\n if(!errorHandlerId) {\r\n errorHandlerId =\r\n g_signal_connect(G_OBJECT(locationControl), \"error-verbose\",\r\n G_CALLBACK(&locationError), \r\n static_cast<void*>(this)); \r\n }\r\n\r\n if(!posChangedId) {\r\n posChangedId =\r\n g_signal_connect(G_OBJECT(locationDevice), \"changed\",\r\n G_CALLBACK(&locationChanged), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n if(!connectedId) {\r\n connectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"connected\",\r\n G_CALLBACK(&deviceConnected), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n if(!disconnectedId) {\r\n disconnectedId = \r\n g_signal_connect(G_OBJECT(locationDevice), \"disconnected\",\r\n G_CALLBACK(&deviceDisconnected), \r\n static_cast<void*>(this)); \r\n }\r\n \r\n location_gpsd_control_start(locationControl);\r\n } else {\r\n \r\n }\r\n#else\r\n if (registered_ == false)\r\n registered_ = dbusComm->sendDBusRegister();\r\n\r\n int cmd = dbusComm->CmdStart;\r\n dbusComm->sessionConfigRequest(cmd, 222, time_interval_);\r\n#endif\r\n}\r\n\r\n\r\nvoid QGeoPositionInfoSourceMaemo::stopUpdates()\r\n{\r\n#ifdef Q_WS_MAEMO_5\r\n if(locationControl) {\r\n if(errorHandlerId)\r\n g_signal_handler_disconnect(G_OBJECT(locationControl), \r\n errorHandlerId);\r\n if(posChangedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n posChangedId);\r\n if(connectedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n connectedId);\r\n if(disconnectedId)\r\n g_signal_handler_disconnect(G_OBJECT(locationDevice), \r\n disconnectedId);\r\n errorHandlerId = 0;\r\n posChangedId = 0;\r\n connectedId = 0;\r\n disconnectedId = 0; \r\n location_gpsd_control_stop(locationControl);\r\n }\r\n#else\r\n if (registered_ == false)\r\n return; \/\/ nothing to stop\r\n dbusComm->sessionConfigRequest(dbusComm->CmdStop, 0, 0);\r\n#endif\r\n}\r\n\r\n\/\/ Stub\r\n\r\nvoid QGeoPositionInfoSourceMaemo::requestUpdate(int timeout)\r\n{\r\n if (timeout) {}\r\n}\r\n\r\n#ifdef Q_WS_MAEMO_5\r\nvoid QGeoPositionInfoSourceMaemo::locationError(LocationGPSDevice *device,\r\n gint errorCode, gpointer data)\r\n{\r\n QString locationError;\r\n\r\n switch (errorCode) {\r\n case LOCATION_ERROR_USER_REJECTED_DIALOG:\r\n locationError = \"User didn't enable requested methods\";\r\n break;\r\n case LOCATION_ERROR_USER_REJECTED_SETTINGS:\r\n locationError = \"User changed settings, which disabled location.\";\r\n break;\r\n case LOCATION_ERROR_BT_GPS_NOT_AVAILABLE:\r\n locationError = \"Problems with BT GPS\";\r\n break;\r\n case LOCATION_ERROR_METHOD_NOT_ALLOWED_IN_OFFLINE_MODE:\r\n locationError = \"Requested method is not allowed in offline mode\";\r\n break;\r\n case LOCATION_ERROR_SYSTEM:\r\n locationError = \"System error.\";\r\n break;\r\n default:\r\n locationError = \"Unknown error.\";\r\n }\r\n\r\n qDebug() << \"Location error:\" << locationError;\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::deviceDisconnected(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n Q_UNUSED(device)\r\n\r\n if (!data)\r\n return;\r\n\r\n QGeoPositionInfoSourceMaemo *object = (QGeoPositionInfoSourceMaemo *)data;\r\n object->setOnline(false);\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::deviceConnected(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n Q_UNUSED(device)\r\n\r\n if (!data)\r\n return;\r\n\r\n QGeoPositionInfoSourceMaemo *object = (QGeoPositionInfoSourceMaemo *)data;\r\n object->setOnline(true);\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setOnline(bool status)\r\n{\r\n emit online(status);\r\n}\r\n\r\nbool QGeoPositionInfoSourceMaemo::isOnline() const\r\n{\r\n if (!locationDevice) {\r\n return false;\r\n }\r\n\r\n return locationDevice->online == 1;\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::locationChanged(LocationGPSDevice *device,\r\n gpointer data)\r\n{\r\n QGeoPositionInfo posInfo;\r\n QGeoCoordinate coordinate;\r\n QGeoPositionInfoSourceMaemo *object;\r\n\r\n\r\n if (!data || !device)\r\n return;\r\n\r\n object = (QGeoPositionInfoSourceMaemo *)data;\r\n\r\n if (device && device->fix) {\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_TIME_SET) {\r\n posInfo.setDateTime(QDateTime::fromTime_t(device->fix->time));\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_LATLONG_SET) {\r\n coordinate.setLatitude(device->fix->latitude);\r\n coordinate.setLongitude(device->fix->longitude);\r\n posInfo.setAttribute(QGeoPositionInfo::HorizontalAccuracy,\r\n device->fix->eph);\r\n posInfo.setAttribute(QGeoPositionInfo::VerticalAccuracy,\r\n device->fix->epv);\r\n\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_ALTITUDE_SET) {\r\n coordinate.setAltitude(device->fix->altitude);\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_SPEED_SET) {\r\n posInfo.setAttribute(QGeoPositionInfo::GroundSpeed,\r\n device->fix->speed);\r\n }\r\n\r\n if (device->fix->fields & LOCATION_GPS_DEVICE_TRACK_SET) {\r\n posInfo.setAttribute(QGeoPositionInfo::Direction,\r\n device->fix->track); \r\n }\r\n\r\n }\r\n \r\n if(device->status == LOCATION_GPS_DEVICE_STATUS_FIX) {\r\n posInfo.setCoordinate(coordinate); \r\n object->setLocation(posInfo);\r\n }\r\n}\r\n\r\nvoid QGeoPositionInfoSourceMaemo::setLocation(const QGeoPositionInfo &update)\r\n{\r\n lastSatUpdate = update;\r\n validLastSatUpdate = true;\r\n emit positionUpdated(update);\r\n}\r\n\r\nint QGeoPositionInfoSourceMaemo::mapUpdateInterval(int msec) {\r\n if (msec < 1000)\r\n return LOCATION_INTERVAL_1S;\r\n else if ((msec >= 1000) && (msec < 3500))\r\n return LOCATION_INTERVAL_2S;\r\n else if ((msec >= 3500) && (msec < 7500))\r\n return LOCATION_INTERVAL_5S;\r\n else if ((msec >= 7500) && (msec < 15000))\r\n return LOCATION_INTERVAL_10S;\r\n else if ((msec >= 15000) && (msec < 25000))\r\n return LOCATION_INTERVAL_20S;\r\n else if ((msec >= 25000) && (msec < 45000))\r\n return LOCATION_INTERVAL_30S;\r\n else if ((msec >= 45000) && (msec < 90000))\r\n return LOCATION_INTERVAL_60S;\r\n else if (msec >= 90000)\r\n return LOCATION_INTERVAL_120S;\r\n}\r\n \r\n#endif \/\/ Q_WS_MAEMO_5\r\n\r\n\r\n#include \"moc_qgeopositioninfosource_maemo_p.cpp\"\r\nQTM_END_NAMESPACE\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include \"xchainer\/array.h\"\n\n#include <cassert>\n#include <cstring>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda.h>\n#include <cuda_runtime.h>\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\n#include \"xchainer\/array_fill.h\"\n#include \"xchainer\/array_math.h\"\n#include \"xchainer\/array_repr.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/array_fill.h\"\n#include \"xchainer\/cuda\/array_math.h\"\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/op_node.h\"\n#include \"xchainer\/scalar.h\"\n\nnamespace xchainer {\n\nnamespace {\n\n#ifdef XCHAINER_ENABLE_CUDA\nstd::shared_ptr<void> AllocateCudaManaged(size_t size) {\n std::shared_ptr<void> ptr{};\n {\n void* raw_ptr = nullptr;\n auto raw_ptr_scope = gsl::finally([&]() {\n if (raw_ptr && !ptr) {\n cudaFree(raw_ptr);\n }\n });\n cuda::CheckError(cudaMallocManaged(&raw_ptr, size, cudaMemAttachGlobal));\n ptr.reset(raw_ptr, cudaFree);\n }\n return ptr;\n}\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\nstd::shared_ptr<void> Allocate(const Device& device, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n return std::make_unique<uint8_t[]>(size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n return AllocateCudaManaged(size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid MemoryCopy(const Device& device, void* dst_ptr, const void* src_ptr, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n std::memcpy(dst_ptr, src_ptr, size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n cuda::CheckError(cudaMemcpy(dst_ptr, src_ptr, size, cudaMemcpyHostToDevice));\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\n} \/\/ namespace\n\nArray::Array(const Shape& shape, Dtype dtype, std::shared_ptr<void> data, bool requires_grad, int64_t offset)\n : shape_(shape),\n is_contiguous_(true),\n dtype_(dtype),\n data_(nullptr),\n requires_grad_(requires_grad),\n offset_(offset),\n node_(std::make_shared<ArrayNode>()) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n data_ = std::move(data);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n size_t size = static_cast<size_t>(shape_.total_size() * GetElementSize(dtype));\n data_ = AllocateCudaManaged(size);\n MemoryCopy(device, data_.get(), data.get(), size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray Array::Empty(const Shape& shape, Dtype dtype) {\n size_t size = static_cast<size_t>(shape.total_size() * GetElementSize(dtype));\n std::shared_ptr<void> data = Allocate(GetCurrentDevice(), size);\n return {shape, dtype, data};\n}\n\nArray Array::EmptyLike(const Array& array) { return Empty(array.shape(), array.dtype()); }\n\nArray Array::DeepCopy() const {\n auto bytes = total_bytes();\n if (GetCurrentDevice() == MakeDevice(\"cpu\")) {\n std::shared_ptr<void> ret_data = std::make_unique<uint8_t[]>(bytes);\n std::memcpy(ret_data.get(), data_.get(), bytes);\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (GetCurrentDevice() == MakeDevice(\"cuda\")) {\n \/\/ TODO(sonots): Better to use abstraction layer such as Allocate or MemoryCopy,\n \/\/ but they do not support all cases such as device to device, yet. We need refactoring.\n void* ret_ptr = nullptr;\n cuda::CheckError(cudaMallocManaged(&ret_ptr, bytes, cudaMemAttachGlobal));\n std::shared_ptr<void> ret_data(ret_ptr, ::cudaFree);\n cuda::CheckError(cudaMemcpy(ret_ptr, data_.get(), bytes, cudaMemcpyDeviceToDevice));\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray& Array::operator+=(const Array& rhs) {\n Add(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray& Array::operator*=(const Array& rhs) {\n Mul(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray Array::operator+(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Add(rhs, out);\n return out;\n}\n\nArray Array::operator*(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Mul(rhs, out);\n return out;\n}\n\nvoid Array::Add(const Array& rhs, Array& out) const {\n if ((&out == this || &out == &rhs) && out.requires_grad_) {\n throw XchainerError(\"In-place operation (Add) is not supported for an array with requires_grad=true.\");\n }\n\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n const Array& lhs = *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n auto lhs_func = lhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"add\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Add(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Add(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Mul(const Array& rhs, Array& out) const {\n if ((&out == this || &out == &rhs) && out.requires_grad_) {\n throw XchainerError(\"In-place operation (Mul) is not supported for an array with requires_grad=true.\");\n }\n\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n \/\/ deep copy for in-place operation to keep original input\n const Array& lhs = (this == &out) ? DeepCopy() : *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n \/\/ TODO(sonots): turn off constructing graph (requires_grad) in backward (but, turn on for double backprop)\n auto lhs_func = lhs.requires_grad() ? [rhs](const Array& gout) { return gout * rhs; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [lhs](const Array& gout) { return gout * lhs; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"mul\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Mul(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Mul(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Fill(Scalar value) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Fill(*this, value);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Fill(*this, value);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nstd::string Array::ToString() const { return ArrayRepr(*this); }\n\nnamespace {\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const ArrayNode& array_node, int indent) {\n static const char kIndentChar = ' ';\n\n os << std::string(static_cast<size_t>(indent * 2), kIndentChar) << \"ArrayNode<\" << &array_node << \">\" << std::endl;\n\n std::shared_ptr<const OpNode> op = array_node.next_node();\n if (op) {\n os << std::string(static_cast<size_t>((indent + 1) * 2), kIndentChar) << \"Op<\" << op->name() << \">\" << std::endl;\n for (const std::shared_ptr<const ArrayNode>& next_node : op->next_nodes()) {\n DebugDumpComputationalGraph(os, *next_node, static_cast<size_t>(indent + 2));\n }\n }\n}\n\n} \/\/ namespace\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const Array& array, int indent) {\n DebugDumpComputationalGraph(os, *array.node(), indent);\n}\n\n} \/\/ namespace xchainer\n<commit_msg>Remove deep copy for in-place operation<commit_after>#include \"xchainer\/array.h\"\n\n#include <cassert>\n#include <cstring>\n\n#ifdef XCHAINER_ENABLE_CUDA\n#include <cuda.h>\n#include <cuda_runtime.h>\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\n#include \"xchainer\/array_fill.h\"\n#include \"xchainer\/array_math.h\"\n#include \"xchainer\/array_repr.h\"\n#ifdef XCHAINER_ENABLE_CUDA\n#include \"xchainer\/cuda\/array_fill.h\"\n#include \"xchainer\/cuda\/array_math.h\"\n#include \"xchainer\/cuda\/cuda_runtime.h\"\n#endif \/\/ XCHAINER_ENABLE_CUDA\n#include \"xchainer\/device.h\"\n#include \"xchainer\/op_node.h\"\n#include \"xchainer\/scalar.h\"\n\nnamespace xchainer {\n\nnamespace {\n\n#ifdef XCHAINER_ENABLE_CUDA\nstd::shared_ptr<void> AllocateCudaManaged(size_t size) {\n std::shared_ptr<void> ptr{};\n {\n void* raw_ptr = nullptr;\n auto raw_ptr_scope = gsl::finally([&]() {\n if (raw_ptr && !ptr) {\n cudaFree(raw_ptr);\n }\n });\n cuda::CheckError(cudaMallocManaged(&raw_ptr, size, cudaMemAttachGlobal));\n ptr.reset(raw_ptr, cudaFree);\n }\n return ptr;\n}\n#endif \/\/ XCHAINER_ENABLE_CUDA\n\nstd::shared_ptr<void> Allocate(const Device& device, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n return std::make_unique<uint8_t[]>(size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n return AllocateCudaManaged(size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid MemoryCopy(const Device& device, void* dst_ptr, const void* src_ptr, size_t size) {\n if (device == MakeDevice(\"cpu\")) {\n std::memcpy(dst_ptr, src_ptr, size);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n cuda::CheckError(cudaMemcpy(dst_ptr, src_ptr, size, cudaMemcpyHostToDevice));\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\n} \/\/ namespace\n\nArray::Array(const Shape& shape, Dtype dtype, std::shared_ptr<void> data, bool requires_grad, int64_t offset)\n : shape_(shape),\n is_contiguous_(true),\n dtype_(dtype),\n data_(nullptr),\n requires_grad_(requires_grad),\n offset_(offset),\n node_(std::make_shared<ArrayNode>()) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n data_ = std::move(data);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n size_t size = static_cast<size_t>(shape_.total_size() * GetElementSize(dtype));\n data_ = AllocateCudaManaged(size);\n MemoryCopy(device, data_.get(), data.get(), size);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray Array::Empty(const Shape& shape, Dtype dtype) {\n size_t size = static_cast<size_t>(shape.total_size() * GetElementSize(dtype));\n std::shared_ptr<void> data = Allocate(GetCurrentDevice(), size);\n return {shape, dtype, data};\n}\n\nArray Array::EmptyLike(const Array& array) { return Empty(array.shape(), array.dtype()); }\n\nArray Array::DeepCopy() const {\n auto bytes = total_bytes();\n if (GetCurrentDevice() == MakeDevice(\"cpu\")) {\n std::shared_ptr<void> ret_data = std::make_unique<uint8_t[]>(bytes);\n std::memcpy(ret_data.get(), data_.get(), bytes);\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (GetCurrentDevice() == MakeDevice(\"cuda\")) {\n \/\/ TODO(sonots): Better to use abstraction layer such as Allocate or MemoryCopy,\n \/\/ but they do not support all cases such as device to device, yet. We need refactoring.\n void* ret_ptr = nullptr;\n cuda::CheckError(cudaMallocManaged(&ret_ptr, bytes, cudaMemAttachGlobal));\n std::shared_ptr<void> ret_data(ret_ptr, ::cudaFree);\n cuda::CheckError(cudaMemcpy(ret_ptr, data_.get(), bytes, cudaMemcpyDeviceToDevice));\n return {shape_, dtype_, ret_data, requires_grad_, offset_};\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nArray& Array::operator+=(const Array& rhs) {\n Add(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray& Array::operator*=(const Array& rhs) {\n Mul(rhs, *this);\n requires_grad_ |= rhs.requires_grad();\n return *this;\n}\n\nArray Array::operator+(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Add(rhs, out);\n return out;\n}\n\nArray Array::operator*(const Array& rhs) const {\n bool requires_grad = (requires_grad_ || rhs.requires_grad());\n Array out = {shape_, dtype_, std::make_unique<uint8_t[]>(total_bytes()), requires_grad, 0};\n Mul(rhs, out);\n return out;\n}\n\nvoid Array::Add(const Array& rhs, Array& out) const {\n if ((&out == this || &out == &rhs) && out.requires_grad_) {\n throw XchainerError(\"In-place operation (Add) is not supported for an array with requires_grad=true.\");\n }\n\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n const Array& lhs = *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n auto lhs_func = lhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [](const Array& gout) { return gout; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"add\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Add(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Add(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Mul(const Array& rhs, Array& out) const {\n if ((&out == this || &out == &rhs) && out.requires_grad_) {\n throw XchainerError(\"In-place operation (Mul) is not supported for an array with requires_grad=true.\");\n }\n\n \/\/ TODO: dtype conversion\n CheckEqual(dtype_, rhs.dtype());\n \/\/ TODO: broadcasting\n CheckEqual(shape_, rhs.shape());\n\n if (requires_grad_ || rhs.requires_grad()) {\n const Array& lhs = *this;\n std::shared_ptr<const ArrayNode> lhs_node = node();\n std::shared_ptr<const ArrayNode> rhs_node = rhs.node();\n std::shared_ptr<ArrayNode> out_node = out.RenewNode();\n std::function<Array(const Array&)> empty_func;\n \/\/ TODO(sonots): turn off constructing graph (requires_grad) in backward (but, turn on for double backprop)\n auto lhs_func = lhs.requires_grad() ? [rhs](const Array& gout) { return gout * rhs; } : empty_func;\n auto rhs_func = rhs.requires_grad() ? [lhs](const Array& gout) { return gout * lhs; } : empty_func;\n auto backward_functions = std::vector<std::function<Array(const Array&)>>{lhs_func, rhs_func};\n std::shared_ptr<OpNode> op_node =\n std::make_shared<OpNode>(\"mul\", std::vector<std::shared_ptr<const ArrayNode>>{lhs_node, rhs_node}, backward_functions);\n out_node->set_next_node(op_node);\n }\n\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Mul(*this, rhs, out);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Mul(*this, rhs, out);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nvoid Array::Fill(Scalar value) {\n Device device = GetCurrentDevice();\n if (device == MakeDevice(\"cpu\")) {\n xchainer::Fill(*this, value);\n#ifdef XCHAINER_ENABLE_CUDA\n } else if (device == MakeDevice(\"cuda\")) {\n xchainer::cuda::Fill(*this, value);\n#endif \/\/ XCHAINER_ENABLE_CUDA\n } else {\n throw DeviceError(\"invalid device\");\n }\n}\n\nstd::string Array::ToString() const { return ArrayRepr(*this); }\n\nnamespace {\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const ArrayNode& array_node, int indent) {\n static const char kIndentChar = ' ';\n\n os << std::string(static_cast<size_t>(indent * 2), kIndentChar) << \"ArrayNode<\" << &array_node << \">\" << std::endl;\n\n std::shared_ptr<const OpNode> op = array_node.next_node();\n if (op) {\n os << std::string(static_cast<size_t>((indent + 1) * 2), kIndentChar) << \"Op<\" << op->name() << \">\" << std::endl;\n for (const std::shared_ptr<const ArrayNode>& next_node : op->next_nodes()) {\n DebugDumpComputationalGraph(os, *next_node, static_cast<size_t>(indent + 2));\n }\n }\n}\n\n} \/\/ namespace\n\nvoid DebugDumpComputationalGraph(std::ostream& os, const Array& array, int indent) {\n DebugDumpComputationalGraph(os, *array.node(), indent);\n}\n\n} \/\/ namespace xchainer\n<|endoftext|>"} {"text":"<commit_before>\/\/ The MIT License (MIT) \r\n\r\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\r\n\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\r\n\/\/ the Software without restriction, including without limitation the rights to\r\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\r\n\/\/ subject to the following conditions:\r\n\r\n\/\/ The above copyright notice and this permission notice shall be included in all\r\n\/\/ copies or substantial portions of the Software.\r\n\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef SOL_FUNCTION_TYPES_HPP\r\n#define SOL_FUNCTION_TYPES_HPP\r\n\r\n#include \"function_types_core.hpp\"\r\n#include \"function_types_templated.hpp\"\r\n#include \"function_types_basic.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"function_types_member.hpp\"\r\n#include \"function_types_usertype.hpp\"\r\n#include \"function_types_overload.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"resolve.hpp\"\r\n\r\nnamespace sol {\r\n\r\ntemplate <typename Sig, typename... Ps>\r\nstruct function_arguments {\r\n std::tuple<Ps...> params;\r\n template <typename... Args>\r\n function_arguments(Args&&... args) : params(std::forward<Args>(args)...) {}\r\n};\r\n\r\ntemplate <typename Sig = function_sig<>, typename... Args>\r\nfunction_arguments<Sig, Args...> function_args( Args&&... args ) { \r\n return function_arguments<Sig, Args...>(std::forward<Args>(args)...);\r\n}\r\n\r\nnamespace stack {\r\ntemplate<typename... Sigs>\r\nstruct pusher<function_sig<Sigs...>> {\r\n template <typename... Sig, typename Fx, typename... Args>\r\n static void select_convertible(std::false_type, types<Sig...>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::functor_function<clean_fx>>(std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename R, typename... A, typename Fx, typename... Args>\r\n static void select_convertible(std::true_type, types<R(A...)>, lua_State* L, Fx&& fx, Args&&... args) {\r\n using fx_ptr_t = R(*)(A...);\r\n fx_ptr_t fxptr = detail::unwrap(std::forward<Fx>(fx));\r\n select_function(std::true_type(), L, fxptr, std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename R, typename... A, typename Fx, typename... Args>\r\n static void select_convertible(types<R(A...)> t, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::decay_t<meta::Unwrapped<meta::Unqualified<Fx>>> raw_fx_t;\r\n typedef R(* fx_ptr_t)(A...);\r\n typedef std::is_convertible<raw_fx_t, fx_ptr_t> is_convertible;\r\n select_convertible(is_convertible(), t, L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_convertible(types<>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef meta::function_signature_t<meta::Unwrapped<meta::Unqualified<Fx>>> Sig;\r\n select_convertible(types<Sig>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_variable(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::member_variable<meta::Unqualified<T>, clean_fx>>(std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t<Fx> dFx;\r\n dFx memfxptr(std::forward<Fx>(fx));\r\n auto userptr = detail::ptr(std::forward<T>(obj), std::forward<Args>(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_member_variable<std::decay_t<decltype(*userptr)>, meta::Unqualified<Fx>>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast<void*>(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_variable(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_convertible(types<Sigs...>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool<meta::is_specialization_of<meta::Unqualified<T>, std::reference_wrapper>::value || std::is_pointer<T>::value> is_reference;\r\n select_reference_member_variable(is_reference(), L, std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits<meta::Unqualified<Fx>>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_variable<C, Fx>::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_function(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::member_function<meta::Unwrapped<meta::Unqualified<T>>, clean_fx>>(std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t<Fx> dFx;\r\n dFx memfxptr(std::forward<Fx>(fx));\r\n auto userptr = detail::ptr(std::forward<T>(obj));\r\n lua_CFunction freefunc = &function_detail::upvalue_member_function<std::decay_t<decltype(*userptr)>, meta::Unqualified<Fx>>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast<void*>(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_variable(std::is_member_object_pointer<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool<meta::is_specialization_of<meta::Unqualified<T>, std::reference_wrapper>::value || std::is_pointer<T>::value> is_reference;\r\n select_reference_member_function(is_reference(), L, std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits<meta::Unqualified<Fx>>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_function<C, Fx>::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_function(std::is_member_function_pointer<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_function(std::true_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n std::decay_t<Fx> target(std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_free_function<Fx>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, target);\r\n stack::push(L, freefunc, upvalues);\r\n }\r\n\r\n static void select_function(std::true_type, lua_State* L, lua_CFunction f) {\r\n stack::push(L, f);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select(lua_State* L, Fx&& fx, Args&&... args) {\r\n select_function(std::is_function<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n static void set_fx(lua_State* L, std::unique_ptr<function_detail::base_function> luafunc) {\r\n function_detail::base_function* target = luafunc.release();\r\n void* targetdata = static_cast<void*>(target);\r\n lua_CFunction freefunc = function_detail::call;\r\n\r\n stack::push(L, userdata_value(targetdata));\r\n function_detail::free_function_cleanup(L);\r\n lua_setmetatable(L, -2);\r\n stack::push(L, freefunc, 1);\r\n }\r\n\r\n template<typename... Args>\r\n static int push(lua_State* L, Args&&... args) {\r\n \/\/ Set will always place one thing (function) on the stack\r\n select(L, std::forward<Args>(args)...);\r\n return 1;\r\n }\r\n};\r\n\r\ntemplate<typename T, typename... Args>\r\nstruct pusher<function_arguments<T, Args...>> {\r\n template <std::size_t... I, typename FP>\r\n static int push_func(std::index_sequence<I...>, lua_State* L, FP&& fp) {\r\n return stack::push<T>(L, detail::forward_get<I>(fp.params)...);\r\n }\r\n\r\n template <typename FP>\r\n static int push(lua_State* L, FP&& fp) {\r\n return push_func(std::index_sequence_for<Args...>(), L, std::forward<FP>(fp));\r\n }\r\n};\r\n\r\ntemplate<typename Signature>\r\nstruct pusher<std::function<Signature>> {\r\n static int push(lua_State* L, std::function<Signature> fx) {\r\n return pusher<function_sig<>>{}.push(L, std::move(fx));\r\n }\r\n};\r\n\r\ntemplate<typename... Functions>\r\nstruct pusher<overload_set<Functions...>> {\r\n static int push(lua_State* L, overload_set<Functions...>&& set) {\r\n pusher<function_sig<>>{}.set_fx(L, std::make_unique<function_detail::overloaded_function<Functions...>>(std::move(set.set)));\r\n return 1;\r\n }\r\n\r\n static int push(lua_State* L, const overload_set<Functions...>& set) {\r\n pusher<function_sig<>>{}.set_fx(L, std::make_unique<function_detail::overloaded_function<Functions...>>(set.set));\r\n return 1;\r\n }\r\n};\r\n\r\n} \/\/ stack\r\n} \/\/ sol\r\n\r\n#endif \/\/ SOL_FUNCTION_TYPES_HPP\r\n<commit_msg>unused q_q<commit_after>\/\/ The MIT License (MIT) \r\n\r\n\/\/ Copyright (c) 2013-2016 Rapptz, ThePhD and contributors\r\n\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\r\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\r\n\/\/ the Software without restriction, including without limitation the rights to\r\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\r\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\r\n\/\/ subject to the following conditions:\r\n\r\n\/\/ The above copyright notice and this permission notice shall be included in all\r\n\/\/ copies or substantial portions of the Software.\r\n\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\r\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\r\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\r\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\r\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\r\n\r\n#ifndef SOL_FUNCTION_TYPES_HPP\r\n#define SOL_FUNCTION_TYPES_HPP\r\n\r\n#include \"function_types_core.hpp\"\r\n#include \"function_types_templated.hpp\"\r\n#include \"function_types_basic.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"function_types_member.hpp\"\r\n#include \"function_types_usertype.hpp\"\r\n#include \"function_types_overload.hpp\"\r\n#include \"function_types_allocator.hpp\"\r\n#include \"resolve.hpp\"\r\n\r\nnamespace sol {\r\n\r\ntemplate <typename Sig, typename... Ps>\r\nstruct function_arguments {\r\n std::tuple<Ps...> params;\r\n template <typename... Args>\r\n function_arguments(Args&&... args) : params(std::forward<Args>(args)...) {}\r\n};\r\n\r\ntemplate <typename Sig = function_sig<>, typename... Args>\r\nfunction_arguments<Sig, Args...> function_args( Args&&... args ) { \r\n return function_arguments<Sig, Args...>(std::forward<Args>(args)...);\r\n}\r\n\r\nnamespace stack {\r\ntemplate<typename... Sigs>\r\nstruct pusher<function_sig<Sigs...>> {\r\n template <typename... Sig, typename Fx, typename... Args>\r\n static void select_convertible(std::false_type, types<Sig...>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::functor_function<clean_fx>>(std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename R, typename... A, typename Fx, typename... Args>\r\n static void select_convertible(std::true_type, types<R(A...)>, lua_State* L, Fx&& fx, Args&&... args) {\r\n using fx_ptr_t = R(*)(A...);\r\n fx_ptr_t fxptr = detail::unwrap(std::forward<Fx>(fx));\r\n select_function(std::true_type(), L, fxptr, std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename R, typename... A, typename Fx, typename... Args>\r\n static void select_convertible(types<R(A...)> t, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef std::decay_t<meta::Unwrapped<meta::Unqualified<Fx>>> raw_fx_t;\r\n typedef R(* fx_ptr_t)(A...);\r\n typedef std::is_convertible<raw_fx_t, fx_ptr_t> is_convertible;\r\n select_convertible(is_convertible(), t, L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_convertible(types<>, lua_State* L, Fx&& fx, Args&&... args) {\r\n typedef meta::function_signature_t<meta::Unwrapped<meta::Unqualified<Fx>>> Sig;\r\n select_convertible(types<Sig>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_variable(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::member_variable<meta::Unqualified<T>, clean_fx>>(std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t<Fx> dFx;\r\n dFx memfxptr(std::forward<Fx>(fx));\r\n auto userptr = detail::ptr(std::forward<T>(obj), std::forward<Args>(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_member_variable<std::decay_t<decltype(*userptr)>, meta::Unqualified<Fx>>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast<void*>(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_variable(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_convertible(types<Sigs...>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool<meta::is_specialization_of<meta::Unqualified<T>, std::reference_wrapper>::value || std::is_pointer<T>::value> is_reference;\r\n select_reference_member_variable(is_reference(), L, std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_variable(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits<meta::Unqualified<Fx>>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_variable<C, Fx>::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_function(std::false_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::remove_pointer_t<std::decay_t<Fx>> clean_fx;\r\n std::unique_ptr<function_detail::base_function> sptr = std::make_unique<function_detail::member_function<meta::Unwrapped<meta::Unqualified<T>>, clean_fx>>(std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)... );\r\n set_fx(L, std::move(sptr));\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_reference_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef std::decay_t<Fx> dFx;\r\n dFx memfxptr(std::forward<Fx>(fx));\r\n auto userptr = detail::ptr(std::forward<T>(obj), std::forward<Args>(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_member_function<std::decay_t<decltype(*userptr)>, meta::Unqualified<Fx>>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, memfxptr);\r\n upvalues += stack::push(L, light_userdata_value(static_cast<void*>(userptr))); \r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_variable(std::is_member_object_pointer<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename T, typename... Args>\r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx, T&& obj, Args&&... args) {\r\n typedef meta::Bool<meta::is_specialization_of<meta::Unqualified<T>, std::reference_wrapper>::value || std::is_pointer<T>::value> is_reference;\r\n select_reference_member_function(is_reference(), L, std::forward<Fx>(fx), std::forward<T>(obj), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_member_function(std::true_type, lua_State* L, Fx&& fx) {\r\n typedef typename meta::bind_traits<meta::Unqualified<Fx>>::object_type C;\r\n lua_CFunction freefunc = &function_detail::upvalue_this_member_function<C, Fx>::call;\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, fx);\r\n stack::push(L, c_closure(freefunc, upvalues));\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_function(std::false_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n select_member_function(std::is_member_function_pointer<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select_function(std::true_type, lua_State* L, Fx&& fx, Args&&... args) {\r\n std::decay_t<Fx> target(std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n lua_CFunction freefunc = &function_detail::upvalue_free_function<Fx>::call;\r\n\r\n int upvalues = stack::stack_detail::push_as_upvalues(L, target);\r\n stack::push(L, freefunc, upvalues);\r\n }\r\n\r\n static void select_function(std::true_type, lua_State* L, lua_CFunction f) {\r\n stack::push(L, f);\r\n }\r\n\r\n template <typename Fx, typename... Args>\r\n static void select(lua_State* L, Fx&& fx, Args&&... args) {\r\n select_function(std::is_function<meta::Unqualified<Fx>>(), L, std::forward<Fx>(fx), std::forward<Args>(args)...);\r\n }\r\n\r\n static void set_fx(lua_State* L, std::unique_ptr<function_detail::base_function> luafunc) {\r\n function_detail::base_function* target = luafunc.release();\r\n void* targetdata = static_cast<void*>(target);\r\n lua_CFunction freefunc = function_detail::call;\r\n\r\n stack::push(L, userdata_value(targetdata));\r\n function_detail::free_function_cleanup(L);\r\n lua_setmetatable(L, -2);\r\n stack::push(L, freefunc, 1);\r\n }\r\n\r\n template<typename... Args>\r\n static int push(lua_State* L, Args&&... args) {\r\n \/\/ Set will always place one thing (function) on the stack\r\n select(L, std::forward<Args>(args)...);\r\n return 1;\r\n }\r\n};\r\n\r\ntemplate<typename T, typename... Args>\r\nstruct pusher<function_arguments<T, Args...>> {\r\n template <std::size_t... I, typename FP>\r\n static int push_func(std::index_sequence<I...>, lua_State* L, FP&& fp) {\r\n return stack::push<T>(L, detail::forward_get<I>(fp.params)...);\r\n }\r\n\r\n template <typename FP>\r\n static int push(lua_State* L, FP&& fp) {\r\n return push_func(std::index_sequence_for<Args...>(), L, std::forward<FP>(fp));\r\n }\r\n};\r\n\r\ntemplate<typename Signature>\r\nstruct pusher<std::function<Signature>> {\r\n static int push(lua_State* L, std::function<Signature> fx) {\r\n return pusher<function_sig<>>{}.push(L, std::move(fx));\r\n }\r\n};\r\n\r\ntemplate<typename... Functions>\r\nstruct pusher<overload_set<Functions...>> {\r\n static int push(lua_State* L, overload_set<Functions...>&& set) {\r\n pusher<function_sig<>>{}.set_fx(L, std::make_unique<function_detail::overloaded_function<Functions...>>(std::move(set.set)));\r\n return 1;\r\n }\r\n\r\n static int push(lua_State* L, const overload_set<Functions...>& set) {\r\n pusher<function_sig<>>{}.set_fx(L, std::make_unique<function_detail::overloaded_function<Functions...>>(set.set));\r\n return 1;\r\n }\r\n};\r\n\r\n} \/\/ stack\r\n} \/\/ sol\r\n\r\n#endif \/\/ SOL_FUNCTION_TYPES_HPP\r\n<|endoftext|>"} {"text":"<commit_before>#include \"components\/WebGUIComponent.h\"\n\nnamespace Sigma {\n\tvoid WebGUIView::InjectKeyboardEvent(const unsigned int key, const Sigma::event::KEY_STATE state) {\n\t\tif (this->hasFocus) {\n\t\t\tCefKeyEvent key_event;\n\t\t\tmemset(&key_event, 0, sizeof(CefKeyEvent));\n\n\t\t\tkey_event.native_key_code = key;\n\n\t\t\tif (state == Sigma::event::KS_UP) {\n\t\t\t\tkey_event.type = KEYEVENT_KEYUP;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tkey_event.type = KEYEVENT_KEYDOWN;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t}\n\t}\n\n\tbool WebGUIView::InjectMouseMove(float x, float y) {\n\t\tCefMouseEvent mouse_event;\n\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\n\t\tif(this->mouseDown == 0) {\n\t\t\tif ((x > this->x) && (x < (this->x + this->width))) {\n\t\t\t\tif ((y > this->y) && (y < (this->y + this->height))) {\n\t\t\t\t\tthis->browserHost->SendFocusEvent(true);\n\t\t\t\t\tthis->hasFocus = true;\n\t\t\t\t\tthis->browserHost->SendMouseMoveEvent(mouse_event, false);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->browserHost->SendFocusEvent(false);\n\t\t\tthis->hasFocus = false;\n\t\t}\n\t\telse {\n\t\t\tthis->browserHost->SendMouseMoveEvent(mouse_event, false);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool WebGUIView::InjectMouseDown(const Sigma::event::BUTTON btn, float x, float y) {\n\t\tif (btn != Sigma::event::BUTTON::LEFT) { return false; }\n\t\tif ((x > this->x) && (x < (this->x + this->width))) {\n\t\t\tif ((y > this->y) && (y < (this->y + this->height))) {\n\t\t\t\tCefMouseEvent mouse_event;\n\t\t\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\t\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\n\t\t\t\tthis->browserHost->SendFocusEvent(true);\n\t\t\t\tthis->hasFocus = true;\n\t\t\t\tthis->browserHost->SendMouseClickEvent(mouse_event, MBT_LEFT, false, 1);\n\t\t\t\tthis->mouseDown = 1;\n\t\t\t\t\/\/this->browserHost->SendMouseClickEvent(mouse_event, MBT_LEFT, true, 1);\n\t\t\t\treturn true; \/\/ Early return to prevent focus loss.\n\t\t\t}\n\t\t}\n\t\tthis->browserHost->SendFocusEvent(false);\n\t\tthis->hasFocus = false;\n\t\treturn false;\n\t}\n\n\tbool WebGUIView::InjectMouseUp(const Sigma::event::BUTTON btn, float x, float y) {\n\t\tif (this->hasFocus) {\n\t\t\tCefMouseEvent mouse_event;\n\t\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\t\t\tthis->browserHost->SendMouseClickEvent(mouse_event, btn == Sigma::event::BUTTON::LEFT ? MBT_LEFT : (btn == Sigma::event::BUTTON::MIDDLE ? MBT_MIDDLE : MBT_RIGHT), true, 1);\n\t\t\tthis->mouseDown = 0;\n\t\t\treturn true;\n\t\t}\n\t\tthis->browserHost->SendFocusEvent(false);\n\t\tthis->hasFocus = false;\n\t\treturn false;\n\t}\n\n\tvoid WebGUIView::InjectCharDown(const unsigned int c) {\n\t\tif (this->hasFocus) {\n\t\t\tCefKeyEvent key_event;\n\t\t\tmemset(&key_event, 0, sizeof(CefKeyEvent));\n\n\t\t\tkey_event.native_key_code = c;\n\n\t\t\tif (c >= 32) {\n\t\t\t\tkey_event.type = KEYEVENT_CHAR;\n\n\t\t\t\tkey_event.character = c;\n\t\t\t\tkey_event.unmodified_character = c;\n\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t\tkey_event.type = KEYEVENT_KEYUP;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>Added a catch in InjectMouseMove to prevent a crash if an event is sent before browsetHost is initialized<commit_after>#include \"components\/WebGUIComponent.h\"\n\nnamespace Sigma {\n\tvoid WebGUIView::InjectKeyboardEvent(const unsigned int key, const Sigma::event::KEY_STATE state) {\n\t\tif (this->hasFocus) {\n\t\t\tCefKeyEvent key_event;\n\t\t\tmemset(&key_event, 0, sizeof(CefKeyEvent));\n\n\t\t\tkey_event.native_key_code = key;\n\n\t\t\tif (state == Sigma::event::KS_UP) {\n\t\t\t\tkey_event.type = KEYEVENT_KEYUP;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tkey_event.type = KEYEVENT_KEYDOWN;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t}\n\t}\n\n\tbool WebGUIView::InjectMouseMove(float x, float y) {\n\t\tif (!this->browserHost) {\n\t\t\treturn false;\n\t\t}\n\t\tCefMouseEvent mouse_event;\n\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\n\t\tif(this->mouseDown == 0) {\n\t\t\tif ((x > this->x) && (x < (this->x + this->width))) {\n\t\t\t\tif ((y > this->y) && (y < (this->y + this->height))) {\n\t\t\t\t\tthis->browserHost->SendFocusEvent(true);\n\t\t\t\t\tthis->hasFocus = true;\n\t\t\t\t\tthis->browserHost->SendMouseMoveEvent(mouse_event, false);\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis->browserHost->SendFocusEvent(false);\n\t\t\tthis->hasFocus = false;\n\t\t}\n\t\telse {\n\t\t\tthis->browserHost->SendMouseMoveEvent(mouse_event, false);\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t}\n\n\tbool WebGUIView::InjectMouseDown(const Sigma::event::BUTTON btn, float x, float y) {\n\t\tif (btn != Sigma::event::BUTTON::LEFT) { return false; }\n\t\tif ((x > this->x) && (x < (this->x + this->width))) {\n\t\t\tif ((y > this->y) && (y < (this->y + this->height))) {\n\t\t\t\tCefMouseEvent mouse_event;\n\t\t\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\t\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\n\t\t\t\tthis->browserHost->SendFocusEvent(true);\n\t\t\t\tthis->hasFocus = true;\n\t\t\t\tthis->browserHost->SendMouseClickEvent(mouse_event, MBT_LEFT, false, 1);\n\t\t\t\tthis->mouseDown = 1;\n\t\t\t\t\/\/this->browserHost->SendMouseClickEvent(mouse_event, MBT_LEFT, true, 1);\n\t\t\t\treturn true; \/\/ Early return to prevent focus loss.\n\t\t\t}\n\t\t}\n\t\tthis->browserHost->SendFocusEvent(false);\n\t\tthis->hasFocus = false;\n\t\treturn false;\n\t}\n\n\tbool WebGUIView::InjectMouseUp(const Sigma::event::BUTTON btn, float x, float y) {\n\t\tif (this->hasFocus) {\n\t\t\tCefMouseEvent mouse_event;\n\t\t\tmouse_event.x = (x - this->x) * this->windowWidth;\n\t\t\tmouse_event.y = (y - this->y) * this->windowHeight;\n\t\t\tthis->browserHost->SendMouseClickEvent(mouse_event, btn == Sigma::event::BUTTON::LEFT ? MBT_LEFT : (btn == Sigma::event::BUTTON::MIDDLE ? MBT_MIDDLE : MBT_RIGHT), true, 1);\n\t\t\tthis->mouseDown = 0;\n\t\t\treturn true;\n\t\t}\n\t\tthis->browserHost->SendFocusEvent(false);\n\t\tthis->hasFocus = false;\n\t\treturn false;\n\t}\n\n\tvoid WebGUIView::InjectCharDown(const unsigned int c) {\n\t\tif (this->hasFocus) {\n\t\t\tCefKeyEvent key_event;\n\t\t\tmemset(&key_event, 0, sizeof(CefKeyEvent));\n\n\t\t\tkey_event.native_key_code = c;\n\n\t\t\tif (c >= 32) {\n\t\t\t\tkey_event.type = KEYEVENT_CHAR;\n\n\t\t\t\tkey_event.character = c;\n\t\t\t\tkey_event.unmodified_character = c;\n\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t\tkey_event.type = KEYEVENT_KEYUP;\n\t\t\t\tthis->browserHost->SendKeyEvent(key_event);\n\t\t\t}\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\r\n\/\/ ChunkSender.cpp\r\n\r\n\/\/ Interfaces to the cChunkSender class representing the thread that waits for chunks becoming ready (loaded \/ generated) and sends them to clients\r\n\r\n\r\n\r\n\r\n\r\n#include \"Globals.h\"\r\n#include \"ChunkSender.h\"\r\n#include \"cWorld.h\"\r\n#include \"packets\/cPacket_MapChunk.h\"\r\n#include \"packets\/cPacket_PreChunk.h\"\r\n#include \"cBlockEntity.h\"\r\n\r\n\r\n\r\n\r\n\r\ncChunkSender::cChunkSender(void) :\r\n\tsuper(\"ChunkSender\"),\r\n\tm_World(NULL)\r\n{\r\n}\r\n\r\n\r\n\r\n\r\n\r\ncChunkSender::~cChunkSender()\r\n{\r\n\tmShouldTerminate = true;\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nbool cChunkSender::Start(cWorld * a_World)\r\n{\r\n\tm_World = a_World;\r\n\treturn super::Start();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::ChunkReady(int a_ChunkX, int a_ChunkY, int a_ChunkZ)\r\n{\r\n\t\/\/ This is probably never gonna be called twice for the same chunk, and if it is, we don't mind, so we don't check\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\tm_ChunksReady.push_back(cChunkCoords(a_ChunkX, a_ChunkY, a_ChunkZ));\r\n\t}\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::QueueSendChunkTo(int a_ChunkX, int a_ChunkY, int a_ChunkZ, cClientHandle * a_Client)\r\n{\r\n\tASSERT(a_Client != NULL);\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\tm_SendChunks.push_back(sSendChunk(a_ChunkX, a_ChunkY, a_ChunkZ, a_Client));\r\n\t}\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::RemoveClient(cClientHandle * a_Client)\r\n{\r\n\tcCSLock Lock(m_CS);\r\n\tfor (sSendChunkList::iterator itr = m_SendChunks.begin(); itr != m_SendChunks.end();)\r\n\t{\r\n\t\tif (itr->m_Client == a_Client)\r\n\t\t{\r\n\t\t\titr = m_SendChunks.erase(itr);\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\t++itr;\r\n\t} \/\/ for itr - m_SendChunks[]\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::Execute(void)\r\n{\r\n\twhile (!mShouldTerminate)\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\twhile (m_ChunksReady.empty() && m_SendChunks.empty())\r\n\t\t{\r\n\t\t\tcCSUnlock Unlock(Lock);\r\n\t\t\tm_Event.Wait();\r\n\t\t\tif (mShouldTerminate)\r\n\t\t\t{\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t} \/\/ while (empty)\r\n\t\t\r\n\t\tif (!m_ChunksReady.empty())\r\n\t\t{\r\n\t\t\t\/\/ Take one from the queue:\r\n\t\t\tcChunkCoords Coords(m_ChunksReady.front());\r\n\t\t\tm_ChunksReady.pop_front();\r\n\t\t\tLock.Unlock();\r\n\t\t\t\r\n\t\t\tSendChunk(Coords.m_ChunkX, Coords.m_ChunkY, Coords.m_ChunkZ, NULL);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\t\/\/ Take one from the queue:\r\n\t\t\tsSendChunk Chunk(m_SendChunks.front());\r\n\t\t\tm_SendChunks.pop_front();\r\n\t\t\tLock.Unlock();\r\n\t\t\t\r\n\t\t\tSendChunk(Chunk.m_ChunkX, Chunk.m_ChunkY, Chunk.m_ChunkZ, Chunk.m_Client);\r\n\t\t}\r\n\t} \/\/ while (!mShouldTerminate)\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::SendChunk(int a_ChunkX, int a_ChunkY, int a_ChunkZ, cClientHandle * a_Client)\r\n{\r\n\tASSERT(m_World != NULL);\r\n\t\r\n\t\/\/ Prepare MapChunk packets:\r\n\tm_World->GetChunkData(a_ChunkX, a_ChunkY, a_ChunkZ, this);\r\n\tcPacket_PreChunk PreChunk(a_ChunkX, a_ChunkZ, true);\r\n\tcPacket_MapChunk MapChunk(a_ChunkX, a_ChunkY, a_ChunkZ, m_BlockData);\r\n\t\r\n\t\/\/ Send:\r\n\tif (a_Client == NULL)\r\n\t{\r\n\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, PreChunk);\r\n\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, MapChunk);\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta_Client->Send(PreChunk);\r\n\t\ta_Client->Send(MapChunk);\r\n\t}\r\n\t\r\n\t\/\/ Send entity creation packets:\r\n\tfor (PacketList::iterator itr = m_Packets.begin(); itr != m_Packets.end(); ++itr)\r\n\t{\r\n\t\tif (a_Client == NULL)\r\n\t\t{\r\n\t\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, **itr);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ta_Client->Send(**itr);\r\n\t\t}\r\n\t\tdelete *itr;\r\n\t} \/\/ for itr - m_Packets[]\r\n\tm_Packets.clear();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::BlockData(const char * a_Data)\r\n{\r\n\tmemcpy(m_BlockData, a_Data, cChunk::c_BlockDataSize);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::BlockEntity(cBlockEntity * a_Entity)\r\n{\r\n\tm_Packets.push_back(a_Entity->GetPacket());\r\n}\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::Entity(cEntity * a_Entity)\r\n{\r\n\t\/\/ Nothing needed yet, perhaps in the future when we save entities into chunks we'd like to send them upon load, too ;)\r\n}\r\n\r\n\r\n\r\n\r\n<commit_msg>ChunkSender won't send NULL packets anymore<commit_after>\r\n\/\/ ChunkSender.cpp\r\n\r\n\/\/ Interfaces to the cChunkSender class representing the thread that waits for chunks becoming ready (loaded \/ generated) and sends them to clients\r\n\r\n\r\n\r\n\r\n\r\n#include \"Globals.h\"\r\n#include \"ChunkSender.h\"\r\n#include \"cWorld.h\"\r\n#include \"packets\/cPacket_MapChunk.h\"\r\n#include \"packets\/cPacket_PreChunk.h\"\r\n#include \"cBlockEntity.h\"\r\n\r\n\r\n\r\n\r\n\r\ncChunkSender::cChunkSender(void) :\r\n\tsuper(\"ChunkSender\"),\r\n\tm_World(NULL)\r\n{\r\n}\r\n\r\n\r\n\r\n\r\n\r\ncChunkSender::~cChunkSender()\r\n{\r\n\tmShouldTerminate = true;\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nbool cChunkSender::Start(cWorld * a_World)\r\n{\r\n\tm_World = a_World;\r\n\treturn super::Start();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::ChunkReady(int a_ChunkX, int a_ChunkY, int a_ChunkZ)\r\n{\r\n\t\/\/ This is probably never gonna be called twice for the same chunk, and if it is, we don't mind, so we don't check\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\tm_ChunksReady.push_back(cChunkCoords(a_ChunkX, a_ChunkY, a_ChunkZ));\r\n\t}\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::QueueSendChunkTo(int a_ChunkX, int a_ChunkY, int a_ChunkZ, cClientHandle * a_Client)\r\n{\r\n\tASSERT(a_Client != NULL);\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\tm_SendChunks.push_back(sSendChunk(a_ChunkX, a_ChunkY, a_ChunkZ, a_Client));\r\n\t}\r\n\tm_Event.Set();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::RemoveClient(cClientHandle * a_Client)\r\n{\r\n\tcCSLock Lock(m_CS);\r\n\tfor (sSendChunkList::iterator itr = m_SendChunks.begin(); itr != m_SendChunks.end();)\r\n\t{\r\n\t\tif (itr->m_Client == a_Client)\r\n\t\t{\r\n\t\t\titr = m_SendChunks.erase(itr);\r\n\t\t\tcontinue;\r\n\t\t}\r\n\t\t++itr;\r\n\t} \/\/ for itr - m_SendChunks[]\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::Execute(void)\r\n{\r\n\twhile (!mShouldTerminate)\r\n\t{\r\n\t\tcCSLock Lock(m_CS);\r\n\t\twhile (m_ChunksReady.empty() && m_SendChunks.empty())\r\n\t\t{\r\n\t\t\tcCSUnlock Unlock(Lock);\r\n\t\t\tm_Event.Wait();\r\n\t\t\tif (mShouldTerminate)\r\n\t\t\t{\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t} \/\/ while (empty)\r\n\t\t\r\n\t\tif (!m_ChunksReady.empty())\r\n\t\t{\r\n\t\t\t\/\/ Take one from the queue:\r\n\t\t\tcChunkCoords Coords(m_ChunksReady.front());\r\n\t\t\tm_ChunksReady.pop_front();\r\n\t\t\tLock.Unlock();\r\n\t\t\t\r\n\t\t\tSendChunk(Coords.m_ChunkX, Coords.m_ChunkY, Coords.m_ChunkZ, NULL);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\t\/\/ Take one from the queue:\r\n\t\t\tsSendChunk Chunk(m_SendChunks.front());\r\n\t\t\tm_SendChunks.pop_front();\r\n\t\t\tLock.Unlock();\r\n\t\t\t\r\n\t\t\tSendChunk(Chunk.m_ChunkX, Chunk.m_ChunkY, Chunk.m_ChunkZ, Chunk.m_Client);\r\n\t\t}\r\n\t} \/\/ while (!mShouldTerminate)\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::SendChunk(int a_ChunkX, int a_ChunkY, int a_ChunkZ, cClientHandle * a_Client)\r\n{\r\n\tASSERT(m_World != NULL);\r\n\t\r\n\t\/\/ Prepare MapChunk packets:\r\n\tm_World->GetChunkData(a_ChunkX, a_ChunkY, a_ChunkZ, this);\r\n\tcPacket_PreChunk PreChunk(a_ChunkX, a_ChunkZ, true);\r\n\tcPacket_MapChunk MapChunk(a_ChunkX, a_ChunkY, a_ChunkZ, m_BlockData);\r\n\t\r\n\t\/\/ Send:\r\n\tif (a_Client == NULL)\r\n\t{\r\n\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, PreChunk);\r\n\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, MapChunk);\r\n\t}\r\n\telse\r\n\t{\r\n\t\ta_Client->Send(PreChunk);\r\n\t\ta_Client->Send(MapChunk);\r\n\t}\r\n\t\r\n\t\/\/ Send entity creation packets:\r\n\tfor (PacketList::iterator itr = m_Packets.begin(); itr != m_Packets.end(); ++itr)\r\n\t{\r\n\t\tif (a_Client == NULL)\r\n\t\t{\r\n\t\t\tm_World->BroadcastToChunk(a_ChunkX, a_ChunkY, a_ChunkZ, **itr);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\ta_Client->Send(**itr);\r\n\t\t}\r\n\t\tdelete *itr;\r\n\t} \/\/ for itr - m_Packets[]\r\n\tm_Packets.clear();\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::BlockData(const char * a_Data)\r\n{\r\n\tmemcpy(m_BlockData, a_Data, cChunk::c_BlockDataSize);\r\n}\r\n\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::BlockEntity(cBlockEntity * a_Entity)\r\n{\r\n\tcPacket * Packet = a_Entity->GetPacket();\r\n\tif (Packet != NULL)\r\n\t{\r\n\t\tm_Packets.push_back(Packet);\r\n\t}\r\n}\r\n\r\n\r\n\r\n\r\nvoid cChunkSender::Entity(cEntity * a_Entity)\r\n{\r\n\t\/\/ Nothing needed yet, perhaps in the future when we save entities into chunks we'd like to send them upon load, too ;)\r\n}\r\n\r\n\r\n\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include \"Config.hpp\"\n#include \"Exception.hpp\"\n#include \"Utility.hpp\"\n#include <fstream>\n\n\/\/ Includes needed to get path of dynamic library\n#ifdef _WIN32\n#include <windows.h>\n#else\n#define __USE_GNU 1\n#include <dlfcn.h>\n#endif\n\nnamespace fast {\n\n\tnamespace Config {\n\t\tnamespace {\n\t\t\t\/\/ Initialize global variables, put in anonymous namespace to hide them\n\t\t\tbool mConfigurationLoaded = false;\n\t\t\tstd::string mConfigFilename = \"\";\n\t\t\tstd::string mBasePath = \"\";\n\t\t\tstd::string mTestDataPath;\n\t\t\tstd::string mKernelSourcePath;\n\t\t\tstd::string mKernelBinaryPath;\n\t\t\tstd::string mDocumentationPath;\n\t\t\tstd::string mPipelinePath;\n\t\t\tstd::string mLibraryPath;\n\t\t\tstd::string mQtPluginsPath;\n\t\t\tStreamingMode m_streamingMode = STREAMING_MODE_PROCESS_ALL_FRAMES;\n\t\t}\n\n\t\tstd::string getPath() {\n\t\t\tif (mBasePath != \"\")\n\t\t\t\treturn mBasePath;\n\t\t\tstd::string path = \"\";\n\t\t\tstd::string slash = \"\/\";\n\t\t\t\/\/ Find path of the FAST dynamic library\n\t\t\t\/\/ The fast_configuration.txt file should lie in the folder below\n#ifdef _WIN32\n\t\t\t\/\/ http:\/\/stackoverflow.com\/questions\/6924195\/get-dll-path-at-runtime\n\t\t\tHMODULE hm = NULL;\n\n\t\t\tif (!GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS |\n\t\t\t\tGET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\n\t\t\t\t(LPCSTR)&getPath,\n\t\t\t\t&hm)) {\n\t\t\t\tint ret = GetLastError();\n\t\t\t\tthrow Exception(\"Error reading dyanmic library address in getPath()\");\n\t\t\t}\n\t\t\tchar dlpath[MAX_PATH];\n\t\t\tGetModuleFileNameA(hm, dlpath, sizeof(dlpath));\n\t\t\tpath = std::string(dlpath);\n\t\t\tpath = replace(path, \"\\\\\", \"\/\"); \/\/ Replace windows \\ with \/\n\t\t\tpath = replace(path, \"\/FAST.dll\", \"\");\n#else\n\t\t\t\/\/ http:\/\/stackoverflow.com\/questions\/1681060\/library-path-when-dynamically-loaded\n\t\t\tDl_info dl_info;\n\t\t\tint ret = dladdr((void *)&getPath, &dl_info);\n\t\t\tif (ret == 0)\n\t\t\t\tthrow Exception(\"Error reading dynamic library address in getPath()\");\n\t\t\tconst char* dlpath = dl_info.dli_fname;\n\t\t\tpath = std::string(dlpath);\n\t\t\t\/\/ Remove lib name and lib folder\n\t\t\tint libPos = path.rfind(slash + \"lib\" + slash);\n\t\t\tpath = path.substr(0, libPos) + slash + \"bin\";\n#endif\n\n\n\t\t\tpath = path + slash; \/\/ Make sure there is a slash at the end\n\t\t\treturn path;\n\t\t}\n\t\t\n\t\tvoid loadConfiguration() {\n\t\t\tif (mConfigurationLoaded)\n\t\t\t\treturn;\n\n\t\t\t\/\/ Set default paths\n\t\t\tmTestDataPath = getPath() + \"..\/..\/data\/\";\n\t\t\tmKernelSourcePath = getPath() + \"..\/..\/source\/FAST\/\";\n\t\t\tmKernelBinaryPath = getPath() + \"..\/kernel_binaries\/\";\n\t\t\tmDocumentationPath = getPath() + \"..\/..\/doc\/\";\n\t\t\tmPipelinePath = getPath() + \"..\/..\/pipelines\/\";\n\t\t\tmQtPluginsPath = getPath() + \"..\/plugins\/\";\n#ifdef WIN32\n\t\t\tmLibraryPath = getPath();\n#else\n\t\t\tmLibraryPath = getPath() + \"\/..\/lib\/\";\n#endif\n\n\t\t\t\/\/ Read and parse configuration file\n\t\t\t\/\/ It should reside in the build folder when compiling, and in the root folder when using release\n\t\t\tstd::string filename;\n\t\t\tif(mConfigFilename == \"\") {\n\t\t\t\tfilename = getPath() + \"fast_configuration.txt\";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfilename = mConfigFilename;\n\t\t\t}\n\t\t\tstd::ifstream file(filename);\n\t\t\tif (!file.is_open()) {\n\t\t\t\tReporter::warning() << \"Unable to open the configuration file \" << filename << \". Using defaults instead.\" << Reporter::end();\n\t\t\t\tmConfigurationLoaded = true;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tReporter::info() << \"Loaded configuration file: \" << filename << Reporter::end();\n\n\n\t\t\tdo {\n\t\t\t\tstd::string line;\n\t\t\t\tstd::getline(file, line);\n\t\t\t\ttrim(line);\n\t\t\t\tif (line[0] == '#' || line.size() == 0) {\n\t\t\t\t\t\/\/ Comment or empty line, skip\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstd::vector<std::string> list = split(line, \"=\");\n\t\t\t\tif (list.size() != 2) {\n\t\t\t\t\tthrow Exception(\"Error parsing configuration file. Expected key = value pair, got: \" + line);\n\t\t\t\t}\n\n\t\t\t\tstd::string key = list[0];\n\t\t\t\tstd::string value = list[1];\n\t\t\t\ttrim(key);\n\t\t\t\ttrim(value);\n\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\n\t\t\t\tif (key == \"TestDataPath\") {\n\t\t\t\t\tmTestDataPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"KernelSourcePath\") {\n\t\t\t\t\tmKernelSourcePath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"KernelBinaryPath\") {\n\t\t\t\t\tmKernelBinaryPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"DocumentationPath\") {\n\t\t\t\t\tmDocumentationPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"PipelinePath\") {\n\t\t\t\t\tmPipelinePath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"QtPluginsPath\") {\n\t\t\t\t\tmQtPluginsPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"LibraryPath\") {\n\t\t\t\t\tmLibraryPath = value;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthrow Exception(\"Error parsing configuration file. Unrecognized key: \" + key);\n\t\t\t\t}\n\t\t\t} while (!file.eof());\n\t\t\tfile.close();\n\n\t\t\tReporter::info() << \"Test data path: \" << mTestDataPath << Reporter::end();\n\t\t\tReporter::info() << \"Kernel source path: \" << mKernelSourcePath << Reporter::end();\n\t\t\tReporter::info() << \"Kernel binary path: \" << mKernelBinaryPath << Reporter::end();\n\t\t\tReporter::info() << \"Documentation path: \" << mDocumentationPath << Reporter::end();\n\t\t\tReporter::info() << \"Pipeline path: \" << mPipelinePath << Reporter::end();\n\t\t\tReporter::info() << \"Qt plugins path: \" << mQtPluginsPath << Reporter::end();\n Reporter::info() << \"Library path: \" << mLibraryPath << Reporter::end();\n\n\t\t\tmConfigurationLoaded = true;\n\t\t}\n\n\t\tstd::string getTestDataPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mTestDataPath;\n\t\t}\n\n\t\tstd::string getKernelSourcePath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mKernelSourcePath;\n\t\t}\n\n\t\tstd::string getKernelBinaryPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mKernelBinaryPath;\n\t\t}\n\n\t\tstd::string getDocumentationPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mDocumentationPath;\n\t\t}\n\n\t\tstd::string getPipelinePath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mPipelinePath;\n\t\t}\n\n\t\tstd::string getLibraryPath() {\n\t\t loadConfiguration();\n\t\t return mLibraryPath;\n\t\t}\n\n\t\tstd::string getQtPluginsPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mQtPluginsPath;\n\t\t}\n\n\t\tvoid setConfigFilename(std::string filename) {\n\t\t\tmConfigFilename = filename;\n\t\t\tloadConfiguration();\n\t\t}\n\n\t\tvoid setBasePath(std::string path) {\n\t\t\tmBasePath = path;\n\t\t\tif (mBasePath[mBasePath.size() - 1] != '\/')\n\t\t\t\tmBasePath += \"\/\";\n\t\t\tmTestDataPath = getPath() + \"..\/data\/\";\n\t\t\tmKernelSourcePath = getPath() + \"..\/source\/FAST\/\";\n\t\t\tmKernelBinaryPath = getPath() + \"kernel_binaries\/\";\n\t\t\tmDocumentationPath = getPath() + \"..\/doc\/\";\n\t\t\tmPipelinePath = getPath() + \"..\/pipelines\/\";\n#ifdef WIN32\n mLibraryPath = getPath() + \"..\/bin\/\";\n#else\n mLibraryPath = getPath() + \"..\/lib\/\";\n#endif\n\t\t\tloadConfiguration();\n\t\t}\n\n\t\tvoid setTestDataPath(std::string path) {\n\t\t\tmTestDataPath = path;\n\t\t}\n\n\t\tvoid setKernelSourcePath(std::string path) {\n\t\t\tmKernelSourcePath = path;\n\t\t}\n\n\t\tvoid setKernelBinaryPath(std::string path) {\n\t\t\tmKernelBinaryPath = path;\n\t\t}\n\n\t\tvoid setDocumentationPath(std::string path) {\n\t\t\tmDocumentationPath = path;\n\t\t}\n\n\t\tvoid setPipelinePath(std::string path) {\n\t\t\tmPipelinePath = path;\n\t\t}\n\n\t\tvoid setStreamingMode(StreamingMode mode) {\n\t\t m_streamingMode = mode;\n\t\t}\n\n\t\tStreamingMode getStreamingMode() {\n\t\t return m_streamingMode;\n\t\t}\n\n\t} \/\/ end namespace Config\n\n}; \/\/ end namespace fast\n<commit_msg>added execption to config class on windows, if FAST is installed in Program Files it will not be able to write to this folder and need to use ProgramData folder instead<commit_after>#include \"Config.hpp\"\n#include \"Exception.hpp\"\n#include \"Utility.hpp\"\n#include <fstream>\n\n\/\/ Includes needed to get path of dynamic library\n#ifdef _WIN32\n#include <windows.h>\n#else\n#define __USE_GNU 1\n#include <dlfcn.h>\n#endif\n\nnamespace fast {\n\n\tnamespace Config {\n\t\tnamespace {\n\t\t\t\/\/ Initialize global variables, put in anonymous namespace to hide them\n\t\t\tbool mConfigurationLoaded = false;\n\t\t\tstd::string mConfigFilename = \"\";\n\t\t\tstd::string mBasePath = \"\";\n\t\t\tstd::string mTestDataPath;\n\t\t\tstd::string mKernelSourcePath;\n\t\t\tstd::string mKernelBinaryPath;\n\t\t\tstd::string mDocumentationPath;\n\t\t\tstd::string mPipelinePath;\n\t\t\tstd::string mLibraryPath;\n\t\t\tstd::string mQtPluginsPath;\n\t\t\tStreamingMode m_streamingMode = STREAMING_MODE_PROCESS_ALL_FRAMES;\n\t\t}\n\n\t\tstd::string getPath() {\n\t\t\tif (mBasePath != \"\")\n\t\t\t\treturn mBasePath;\n\t\t\tstd::string path = \"\";\n\t\t\tstd::string slash = \"\/\";\n\t\t\t\/\/ Find path of the FAST dynamic library\n\t\t\t\/\/ The fast_configuration.txt file should lie in the folder below\n#ifdef _WIN32\n\t\t\t\/\/ http:\/\/stackoverflow.com\/questions\/6924195\/get-dll-path-at-runtime\n\t\t\tHMODULE hm = NULL;\n\n\t\t\tif (!GetModuleHandleExA(GET_MODULE_HANDLE_EX_FLAG_FROM_ADDRESS |\n\t\t\t\tGET_MODULE_HANDLE_EX_FLAG_UNCHANGED_REFCOUNT,\n\t\t\t\t(LPCSTR)&getPath,\n\t\t\t\t&hm)) {\n\t\t\t\tint ret = GetLastError();\n\t\t\t\tthrow Exception(\"Error reading dyanmic library address in getPath()\");\n\t\t\t}\n\t\t\tchar dlpath[MAX_PATH];\n\t\t\tGetModuleFileNameA(hm, dlpath, sizeof(dlpath));\n\t\t\tpath = std::string(dlpath);\n\t\t\tpath = replace(path, \"\\\\\", \"\/\"); \/\/ Replace windows \\ with \/\n\t\t\tpath = replace(path, \"\/FAST.dll\", \"\");\n#else\n\t\t\t\/\/ http:\/\/stackoverflow.com\/questions\/1681060\/library-path-when-dynamically-loaded\n\t\t\tDl_info dl_info;\n\t\t\tint ret = dladdr((void *)&getPath, &dl_info);\n\t\t\tif (ret == 0)\n\t\t\t\tthrow Exception(\"Error reading dynamic library address in getPath()\");\n\t\t\tconst char* dlpath = dl_info.dli_fname;\n\t\t\tpath = std::string(dlpath);\n\t\t\t\/\/ Remove lib name and lib folder\n\t\t\tint libPos = path.rfind(slash + \"lib\" + slash);\n\t\t\tpath = path.substr(0, libPos) + slash + \"bin\";\n#endif\n\n\n\t\t\tpath = path + slash; \/\/ Make sure there is a slash at the end\n\t\t\treturn path;\n\t\t}\n\t\t\n\t\tvoid loadConfiguration() {\n\t\t\tif (mConfigurationLoaded)\n\t\t\t\treturn;\n\n\t\t\t\/\/ Set default paths\n\t\t\tmTestDataPath = getPath() + \"..\/..\/data\/\";\n\t\t\tmKernelSourcePath = getPath() + \"..\/..\/source\/FAST\/\";\n\t\t\tmKernelBinaryPath = getPath() + \"..\/kernel_binaries\/\";\n\t\t\tmDocumentationPath = getPath() + \"..\/..\/doc\/\";\n\t\t\tmPipelinePath = getPath() + \"..\/..\/pipelines\/\";\n\t\t\tmQtPluginsPath = getPath() + \"..\/plugins\/\";\n\n\t\t\tstd::string writeablePath = getPath();\n#ifdef WIN32\n\t\t\tmLibraryPath = getPath();\n\t\t\tif(getPath().find(\"Program Files\") != std::string::npos) {\n\t\t\t\t\/\/ Special case for windows: default install dir: program files is not writeable.\n\t\t\t\t\/\/ Use ProgramData folder instead.\n\t\t\t\twriteablePath = \"C:\/ProgramData\/FAST\/\";\n\t\t\t\t\/\/ Copy pipelines (first time only)\n\t\t\t\tfor(auto&& pipeline : getDirectoryList(mPipelinePath)) {\n\t\t\t\t\tif(!fileExists(writeablePath + \"pipelines\/\" + pipeline)) {\n\t\t\t\t\t\t\/\/ Copy file from source folder\n\t\t\t\t\t\tstd::ifstream src(mPipelinePath + pipeline, std::ios::binary);\n\t\t\t\t\t\tstd::ofstream dst(writeablePath + \"pipelines\/\" + pipeline, std::ios::binary);\n\n\t\t\t\t\t\tdst << src.rdbuf();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n#else\n\t\t\tmLibraryPath = getPath() + \"\/..\/lib\/\";\n#endif\n\n\t\t\t\/\/ Read and parse configuration file\n\t\t\t\/\/ It should reside in the build folder when compiling, and in the root folder when using release\n\t\t\tstd::string filename;\n\t\t\tif(mConfigFilename == \"\") {\n\t\t\t\tfilename = getPath() + \"fast_configuration.txt\";\n\t\t\t}\n\t\t\telse {\n\t\t\t\tfilename = mConfigFilename;\n\t\t\t}\n\t\t\tstd::ifstream file(filename);\n\t\t\tif (!file.is_open()) {\n\t\t\t\tReporter::warning() << \"Unable to open the configuration file \" << filename << \". Using defaults instead.\" << Reporter::end();\n\t\t\t\tmConfigurationLoaded = true;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tReporter::info() << \"Loaded configuration file: \" << filename << Reporter::end();\n\n\n\t\t\tdo {\n\t\t\t\tstd::string line;\n\t\t\t\tstd::getline(file, line);\n\t\t\t\ttrim(line);\n\t\t\t\tif (line[0] == '#' || line.size() == 0) {\n\t\t\t\t\t\/\/ Comment or empty line, skip\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstd::vector<std::string> list = split(line, \"=\");\n\t\t\t\tif (list.size() != 2) {\n\t\t\t\t\tthrow Exception(\"Error parsing configuration file. Expected key = value pair, got: \" + line);\n\t\t\t\t}\n\n\t\t\t\tstd::string key = list[0];\n\t\t\t\tstd::string value = list[1];\n\t\t\t\ttrim(key);\n\t\t\t\ttrim(value);\t\t\t\t\n\n\t\t\t\tif (key == \"TestDataPath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\t\t\t\t\tmTestDataPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"KernelSourcePath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\t\t\t\t\tmKernelSourcePath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"KernelBinaryPath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", writeablePath);\n\t\t\t\t\tmKernelBinaryPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"DocumentationPath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\t\t\t\t\tmDocumentationPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"PipelinePath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", writeablePath);\n\t\t\t\t\tmPipelinePath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"QtPluginsPath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\t\t\t\t\tmQtPluginsPath = value;\n\t\t\t\t}\n\t\t\t\telse if (key == \"LibraryPath\") {\n\t\t\t\t\tvalue = replace(value, \"@ROOT@\", getPath() + \"\/..\/\");\n\t\t\t\t\tmLibraryPath = value;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthrow Exception(\"Error parsing configuration file. Unrecognized key: \" + key);\n\t\t\t\t}\n\t\t\t} while (!file.eof());\n\t\t\tfile.close();\n\n\t\t\tReporter::info() << \"Test data path: \" << mTestDataPath << Reporter::end();\n\t\t\tReporter::info() << \"Kernel source path: \" << mKernelSourcePath << Reporter::end();\n\t\t\tReporter::info() << \"Kernel binary path: \" << mKernelBinaryPath << Reporter::end();\n\t\t\tReporter::info() << \"Documentation path: \" << mDocumentationPath << Reporter::end();\n\t\t\tReporter::info() << \"Pipeline path: \" << mPipelinePath << Reporter::end();\n\t\t\tReporter::info() << \"Qt plugins path: \" << mQtPluginsPath << Reporter::end();\n Reporter::info() << \"Library path: \" << mLibraryPath << Reporter::end();\n\n\t\t\tmConfigurationLoaded = true;\n\t\t}\n\n\t\tstd::string getTestDataPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mTestDataPath;\n\t\t}\n\n\t\tstd::string getKernelSourcePath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mKernelSourcePath;\n\t\t}\n\n\t\tstd::string getKernelBinaryPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mKernelBinaryPath;\n\t\t}\n\n\t\tstd::string getDocumentationPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mDocumentationPath;\n\t\t}\n\n\t\tstd::string getPipelinePath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mPipelinePath;\n\t\t}\n\n\t\tstd::string getLibraryPath() {\n\t\t loadConfiguration();\n\t\t return mLibraryPath;\n\t\t}\n\n\t\tstd::string getQtPluginsPath() {\n\t\t\tloadConfiguration();\n\t\t\treturn mQtPluginsPath;\n\t\t}\n\n\t\tvoid setConfigFilename(std::string filename) {\n\t\t\tmConfigFilename = filename;\n\t\t\tloadConfiguration();\n\t\t}\n\n\t\tvoid setBasePath(std::string path) {\n\t\t\tmBasePath = path;\n\t\t\tif (mBasePath[mBasePath.size() - 1] != '\/')\n\t\t\t\tmBasePath += \"\/\";\n\t\t\tmTestDataPath = getPath() + \"..\/data\/\";\n\t\t\tmKernelSourcePath = getPath() + \"..\/source\/FAST\/\";\n\t\t\tmKernelBinaryPath = getPath() + \"kernel_binaries\/\";\n\t\t\tmDocumentationPath = getPath() + \"..\/doc\/\";\n\t\t\tmPipelinePath = getPath() + \"..\/pipelines\/\";\n#ifdef WIN32\n mLibraryPath = getPath() + \"..\/bin\/\";\n#else\n mLibraryPath = getPath() + \"..\/lib\/\";\n#endif\n\t\t\tloadConfiguration();\n\t\t}\n\n\t\tvoid setTestDataPath(std::string path) {\n\t\t\tmTestDataPath = path;\n\t\t}\n\n\t\tvoid setKernelSourcePath(std::string path) {\n\t\t\tmKernelSourcePath = path;\n\t\t}\n\n\t\tvoid setKernelBinaryPath(std::string path) {\n\t\t\tmKernelBinaryPath = path;\n\t\t}\n\n\t\tvoid setDocumentationPath(std::string path) {\n\t\t\tmDocumentationPath = path;\n\t\t}\n\n\t\tvoid setPipelinePath(std::string path) {\n\t\t\tmPipelinePath = path;\n\t\t}\n\n\t\tvoid setStreamingMode(StreamingMode mode) {\n\t\t m_streamingMode = mode;\n\t\t}\n\n\t\tStreamingMode getStreamingMode() {\n\t\t return m_streamingMode;\n\t\t}\n\n\t} \/\/ end namespace Config\n\n}; \/\/ end namespace fast\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"winshutdownmonitor.h\"\n\n#if defined(Q_OS_WIN) && QT_VERSION >= 0x050000\n#include \"init.h\"\n#include \"util.h\"\n\n#include <windows.h>\n\n#include <QDebug>\n\n#include <openssl\/rand.h>\n\n\/\/ If we don't want a message to be processed by Qt, return true and set result to\n\/\/ the value that the window procedure should return. Otherwise return false.\nbool WinShutdownMonitor::nativeEventFilter(const QByteArray &eventType, void *pMessage, long *pnResult)\n{\n Q_UNUSED(eventType);\n\n MSG *pMsg = static_cast<MSG *>(pMessage);\n\n \/\/ Seed OpenSSL PRNG with Windows event data (e.g. mouse movements and other user interactions)\n if (RAND_event(pMsg->message, pMsg->wParam, pMsg->lParam) == 0) {\n \/\/ Warn only once as this is performance-critical\n static bool warned = false;\n if (!warned) {\n LogPrint(\"%s: OpenSSL RAND_event() failed to seed OpenSSL PRNG with enough data.\\n\", __func__);\n warned = true;\n }\n }\n\n switch(pMsg->message)\n {\n case WM_QUERYENDSESSION:\n {\n \/\/ Initiate a client shutdown after receiving a WM_QUERYENDSESSION and block\n \/\/ Windows session end until we have finished client shutdown.\n StartShutdown();\n *pnResult = FALSE;\n return true;\n }\n\n case WM_ENDSESSION:\n {\n *pnResult = FALSE;\n return true;\n }\n }\n\n return false;\n}\n\nvoid WinShutdownMonitor::registerShutdownBlockReason(const QString& strReason, const HWND& mainWinId)\n{\n typedef BOOL (WINAPI *PSHUTDOWNBRCREATE)(HWND, LPCWSTR);\n PSHUTDOWNBRCREATE shutdownBRCreate = (PSHUTDOWNBRCREATE)GetProcAddress(GetModuleHandleA(\"User32.dll\"), \"ShutdownBlockReasonCreate\");\n if (shutdownBRCreate == NULL) {\n qWarning() << \"registerShutdownBlockReason: GetProcAddress for ShutdownBlockReasonCreate failed\";\n return;\n }\n\n if (shutdownBRCreate(mainWinId, strReason.toStdWString().c_str()))\n qWarning() << \"registerShutdownBlockReason: Successfully registered: \" + strReason;\n else\n qWarning() << \"registerShutdownBlockReason: Failed to register: \" + strReason;\n}\n#endif\n<commit_msg>Fix LogPrint to LogPrintf<commit_after>\/\/ Copyright (c) 2014 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"winshutdownmonitor.h\"\n\n#if defined(Q_OS_WIN) && QT_VERSION >= 0x050000\n#include \"init.h\"\n#include \"util.h\"\n\n#include <windows.h>\n\n#include <QDebug>\n\n#include <openssl\/rand.h>\n\n\/\/ If we don't want a message to be processed by Qt, return true and set result to\n\/\/ the value that the window procedure should return. Otherwise return false.\nbool WinShutdownMonitor::nativeEventFilter(const QByteArray &eventType, void *pMessage, long *pnResult)\n{\n Q_UNUSED(eventType);\n\n MSG *pMsg = static_cast<MSG *>(pMessage);\n\n \/\/ Seed OpenSSL PRNG with Windows event data (e.g. mouse movements and other user interactions)\n if (RAND_event(pMsg->message, pMsg->wParam, pMsg->lParam) == 0) {\n \/\/ Warn only once as this is performance-critical\n static bool warned = false;\n if (!warned) {\n LogPrintf(\"%s: OpenSSL RAND_event() failed to seed OpenSSL PRNG with enough data.\\n\", __func__);\n warned = true;\n }\n }\n\n switch(pMsg->message)\n {\n case WM_QUERYENDSESSION:\n {\n \/\/ Initiate a client shutdown after receiving a WM_QUERYENDSESSION and block\n \/\/ Windows session end until we have finished client shutdown.\n StartShutdown();\n *pnResult = FALSE;\n return true;\n }\n\n case WM_ENDSESSION:\n {\n *pnResult = FALSE;\n return true;\n }\n }\n\n return false;\n}\n\nvoid WinShutdownMonitor::registerShutdownBlockReason(const QString& strReason, const HWND& mainWinId)\n{\n typedef BOOL (WINAPI *PSHUTDOWNBRCREATE)(HWND, LPCWSTR);\n PSHUTDOWNBRCREATE shutdownBRCreate = (PSHUTDOWNBRCREATE)GetProcAddress(GetModuleHandleA(\"User32.dll\"), \"ShutdownBlockReasonCreate\");\n if (shutdownBRCreate == NULL) {\n qWarning() << \"registerShutdownBlockReason: GetProcAddress for ShutdownBlockReasonCreate failed\";\n return;\n }\n\n if (shutdownBRCreate(mainWinId, strReason.toStdWString().c_str()))\n qWarning() << \"registerShutdownBlockReason: Successfully registered: \" + strReason;\n else\n qWarning() << \"registerShutdownBlockReason: Failed to register: \" + strReason;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <qt\/winshutdownmonitor.h>\n\n#if defined(Q_OS_WIN)\n#include <shutdown.h>\n#include <util\/system.h>\n\n#include <windows.h>\n\n#include <QDebug>\n\n#include <openssl\/rand.h>\n\n\/\/ If we don't want a message to be processed by Qt, return true and set result to\n\/\/ the value that the window procedure should return. Otherwise return false.\nbool WinShutdownMonitor::nativeEventFilter(const QByteArray &eventType, void *pMessage, long *pnResult)\n{\n Q_UNUSED(eventType);\n\n MSG *pMsg = static_cast<MSG *>(pMessage);\n\n \/\/ Seed OpenSSL PRNG with Windows event data (e.g. mouse movements and other user interactions)\n if (RAND_event(pMsg->message, pMsg->wParam, pMsg->lParam) == 0) {\n \/\/ Warn only once as this is performance-critical\n static bool warned = false;\n if (!warned) {\n LogPrintf(\"%s: OpenSSL RAND_event() failed to seed OpenSSL PRNG with enough data.\\n\", __func__);\n warned = true;\n }\n }\n\n switch(pMsg->message)\n {\n case WM_QUERYENDSESSION:\n {\n \/\/ Initiate a client shutdown after receiving a WM_QUERYENDSESSION and block\n \/\/ Windows session end until we have finished client shutdown.\n StartShutdown();\n *pnResult = FALSE;\n return true;\n }\n\n case WM_ENDSESSION:\n {\n *pnResult = FALSE;\n return true;\n }\n }\n\n return false;\n}\n\nvoid WinShutdownMonitor::registerShutdownBlockReason(const QString& strReason, const HWND& mainWinId)\n{\n typedef BOOL (WINAPI *PSHUTDOWNBRCREATE)(HWND, LPCWSTR);\n PSHUTDOWNBRCREATE shutdownBRCreate = (PSHUTDOWNBRCREATE)GetProcAddress(GetModuleHandleA(\"User32.dll\"), \"ShutdownBlockReasonCreate\");\n if (shutdownBRCreate == nullptr) {\n qWarning() << \"registerShutdownBlockReason: GetProcAddress for ShutdownBlockReasonCreate failed\";\n return;\n }\n\n if (shutdownBRCreate(mainWinId, strReason.toStdWString().c_str()))\n qInfo() << \"registerShutdownBlockReason: Successfully registered: \" + strReason;\n else\n qWarning() << \"registerShutdownBlockReason: Failed to register: \" + strReason;\n}\n#endif\n<commit_msg>gui: remove OpenSSL PRNG seeding (Windows, Qt only)<commit_after>\/\/ Copyright (c) 2014-2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include <qt\/winshutdownmonitor.h>\n\n#if defined(Q_OS_WIN)\n#include <shutdown.h>\n\n#include <windows.h>\n\n#include <QDebug>\n\n\/\/ If we don't want a message to be processed by Qt, return true and set result to\n\/\/ the value that the window procedure should return. Otherwise return false.\nbool WinShutdownMonitor::nativeEventFilter(const QByteArray &eventType, void *pMessage, long *pnResult)\n{\n Q_UNUSED(eventType);\n\n MSG *pMsg = static_cast<MSG *>(pMessage);\n\n switch(pMsg->message)\n {\n case WM_QUERYENDSESSION:\n {\n \/\/ Initiate a client shutdown after receiving a WM_QUERYENDSESSION and block\n \/\/ Windows session end until we have finished client shutdown.\n StartShutdown();\n *pnResult = FALSE;\n return true;\n }\n\n case WM_ENDSESSION:\n {\n *pnResult = FALSE;\n return true;\n }\n }\n\n return false;\n}\n\nvoid WinShutdownMonitor::registerShutdownBlockReason(const QString& strReason, const HWND& mainWinId)\n{\n typedef BOOL (WINAPI *PSHUTDOWNBRCREATE)(HWND, LPCWSTR);\n PSHUTDOWNBRCREATE shutdownBRCreate = (PSHUTDOWNBRCREATE)GetProcAddress(GetModuleHandleA(\"User32.dll\"), \"ShutdownBlockReasonCreate\");\n if (shutdownBRCreate == nullptr) {\n qWarning() << \"registerShutdownBlockReason: GetProcAddress for ShutdownBlockReasonCreate failed\";\n return;\n }\n\n if (shutdownBRCreate(mainWinId, strReason.toStdWString().c_str()))\n qInfo() << \"registerShutdownBlockReason: Successfully registered: \" + strReason;\n else\n qWarning() << \"registerShutdownBlockReason: Failed to register: \" + strReason;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n *\n * Copyright (c) 2020 Project CHIP Authors\n * All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"TestSupport.h\"\n\n#include <support\/ScopedBuffer.h>\n#include <support\/TestUtils.h>\n\n#include <nlunit-test.h>\n\nnamespace {\n\nclass TestCounterMemoryManagement\n{\npublic:\n static int Counter() { return mAllocCount; }\n\n static void MemoryFree(void * p)\n {\n mAllocCount--;\n chip::Platform::MemoryFree(p);\n }\n static void * MemoryAlloc(size_t size)\n {\n mAllocCount++;\n return chip::Platform::MemoryAlloc(size);\n }\n static void * MemoryAlloc(size_t size, bool longTerm)\n {\n\n mAllocCount++;\n return chip::Platform::MemoryAlloc(size, longTerm);\n }\n static void * MemoryCalloc(size_t num, size_t size)\n {\n\n mAllocCount++;\n return chip::Platform::MemoryCalloc(num, size);\n }\n\nprivate:\n static int mAllocCount;\n};\nint TestCounterMemoryManagement::mAllocCount = 0;\n\nusing TestCounterScopedBuffer = chip::Platform::ScopedMemoryBuffer<char, TestCounterMemoryManagement>;\n\nvoid TestAutoFree(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\nvoid TestFreeDuringAllocs(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(64));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.LongTermAlloc(256));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.Calloc(10));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\nvoid TestRelease(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n void * ptr = nullptr;\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, buffer.Ptr() != nullptr);\n\n ptr = buffer.Release();\n NL_TEST_ASSERT(inSuite, ptr != nullptr);\n NL_TEST_ASSERT(inSuite, buffer.Ptr() == nullptr);\n }\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n\n {\n TestCounterScopedBuffer buffer;\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 2);\n TestCounterMemoryManagement::MemoryFree(ptr);\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\n} \/\/ namespace\n\n#define NL_TEST_DEF_FN(fn) NL_TEST_DEF(\"Test \" #fn, fn)\n\/**\n * Test Suite. It lists all the test functions.\n *\/\nstatic const nlTest sTests[] = {\n NL_TEST_DEF_FN(TestAutoFree), \/\/\n NL_TEST_DEF_FN(TestFreeDuringAllocs), \/\/\n NL_TEST_DEF_FN(TestRelease), \/\/\n NL_TEST_SENTINEL() \/\/\n};\n\nint TestScopedBuffer(void)\n{\n nlTestSuite theSuite = { \"CHIP ScopedBuffer tests\", &sTests[0], nullptr, nullptr };\n\n \/\/ Run test suit againt one context.\n nlTestRunner(&theSuite, nullptr);\n return nlTestRunnerStats(&theSuite);\n}\n\nCHIP_REGISTER_TEST_SUITE(TestBufBound)\n<commit_msg>Make sure scoped buffer test test calls Platform::MemoryInit (#3050)<commit_after>\/*\n *\n * Copyright (c) 2020 Project CHIP Authors\n * All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"TestSupport.h\"\n\n#include <support\/ScopedBuffer.h>\n#include <support\/TestUtils.h>\n\n#include <nlunit-test.h>\n\nnamespace {\n\nclass TestCounterMemoryManagement\n{\npublic:\n static int Counter() { return mAllocCount; }\n\n static void MemoryFree(void * p)\n {\n mAllocCount--;\n chip::Platform::MemoryFree(p);\n }\n static void * MemoryAlloc(size_t size)\n {\n mAllocCount++;\n return chip::Platform::MemoryAlloc(size);\n }\n static void * MemoryAlloc(size_t size, bool longTerm)\n {\n\n mAllocCount++;\n return chip::Platform::MemoryAlloc(size, longTerm);\n }\n static void * MemoryCalloc(size_t num, size_t size)\n {\n\n mAllocCount++;\n return chip::Platform::MemoryCalloc(num, size);\n }\n\nprivate:\n static int mAllocCount;\n};\nint TestCounterMemoryManagement::mAllocCount = 0;\n\nusing TestCounterScopedBuffer = chip::Platform::ScopedMemoryBuffer<char, TestCounterMemoryManagement>;\n\nvoid TestAutoFree(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\nvoid TestFreeDuringAllocs(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(64));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.LongTermAlloc(256));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n NL_TEST_ASSERT(inSuite, buffer.Calloc(10));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\nvoid TestRelease(nlTestSuite * inSuite, void * inContext)\n{\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n void * ptr = nullptr;\n\n {\n TestCounterScopedBuffer buffer;\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, buffer.Ptr() != nullptr);\n\n ptr = buffer.Release();\n NL_TEST_ASSERT(inSuite, ptr != nullptr);\n NL_TEST_ASSERT(inSuite, buffer.Ptr() == nullptr);\n }\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n\n {\n TestCounterScopedBuffer buffer;\n NL_TEST_ASSERT(inSuite, buffer.Alloc(128));\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 2);\n TestCounterMemoryManagement::MemoryFree(ptr);\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 1);\n }\n\n NL_TEST_ASSERT(inSuite, TestCounterMemoryManagement::Counter() == 0);\n}\n\nint Setup(void * inContext)\n{\n CHIP_ERROR error = chip::Platform::MemoryInit();\n if (error != CHIP_NO_ERROR)\n return FAILURE;\n return SUCCESS;\n}\n\nint Teardown(void * inContext)\n{\n chip::Platform::MemoryShutdown();\n return SUCCESS;\n}\n\n} \/\/ namespace\n\n#define NL_TEST_DEF_FN(fn) NL_TEST_DEF(\"Test \" #fn, fn)\n\/**\n * Test Suite. It lists all the test functions.\n *\/\nstatic const nlTest sTests[] = {\n NL_TEST_DEF_FN(TestAutoFree), \/\/\n NL_TEST_DEF_FN(TestFreeDuringAllocs), \/\/\n NL_TEST_DEF_FN(TestRelease), \/\/\n NL_TEST_SENTINEL() \/\/\n};\n\nint TestScopedBuffer(void)\n{\n nlTestSuite theSuite = { \"CHIP ScopedBuffer tests\", &sTests[0], Setup, Teardown };\n\n \/\/ Run test suit againt one context.\n nlTestRunner(&theSuite, nullptr);\n return nlTestRunnerStats(&theSuite);\n}\n\nCHIP_REGISTER_TEST_SUITE(TestBufBound)\n<|endoftext|>"} {"text":"<commit_before>#include \"macwebcam_info.h\"\n\n#include <assert.h>\n#include <iostream>\n#include <QProcess>\n#include <QCoreApplication>\n\ntypedef struct{\n int x, y;\n} resolution_t;\n\nQList<resolution_t> resolutions;\n\nresolution_t makeRes(int x, int y)\n{\n resolution_t res;\n res.x = x;\n res.y = y;\n return res;\n}\n\nMacWebcamInfo::MacWebcamInfo(const QString &id)\n{\n webcam_id = id;\n resolutions.clear();\n res_list.clear();\n resolutions.push_back(makeRes(160, 120));\n resolutions.push_back(makeRes(320, 240));\n resolutions.push_back(makeRes(352, 288));\n resolutions.push_back(makeRes(640, 480));\n \n QList<resolution_t>::iterator i;\n QString str;\n for(i = resolutions.begin(); i != resolutions.end(); ++i){\n str = QString(\"%1 x %2\").arg(i->x).arg(i->y);\n res_list.push_back(str);\n }\n}\n\nconst QStringList& MacWebcamInfo::getResolutions()\n{\n return res_list;\n}\n\nbool MacWebcamInfo::decodeRes(const QString &res, int &res_x, int &res_y)\n{\n const QRegExp &res_rexp = QRegExp(\"^\\\\s*(\\\\d+)\\\\s*[xX]\\\\s*(\\\\d+)\\\\s*$\");\n if(res_rexp.indexIn(res) == -1){\n return false;\n }\n res_x = res_rexp.cap(1).toInt();\n res_y = res_rexp.cap(2).toInt();\n return true;\n}\n\nint MacWebcamInfo::findRes(const int &res_x, const int &res_y)\n{\n QList<resolution_t>::const_iterator i;\n int counter = 0;\n for(i = resolutions.begin(); i != resolutions.end(); ++i, ++counter){\n if((i->x == res_x) && (i->y == res_y)){\n return counter;\n }\n }\n return 0;\n}\n\nMacWebcamInfo::~MacWebcamInfo()\n{\n}\n\nQStringList& MacWebcamInfo::EnumerateWebcams()\n{\n QStringList *res = new QStringList();\n QProcess *enum_proc = new QProcess();\n enum_proc->start(QCoreApplication::applicationDirPath() + \"\/..\/helper\/qt_cam -e\");\n enum_proc->waitForStarted(10000);\n enum_proc->waitForFinished(10000);\n QString str(enum_proc->readAllStandardOutput());\n *res = str.split(\"\\n\", QString::SkipEmptyParts);\n return *res;\n}\n<commit_msg>Fixed problem causing no webcam being found when ltr_gui was in path containing spaces.<commit_after>#include \"macwebcam_info.h\"\n\n#include <assert.h>\n#include <iostream>\n#include <QProcess>\n#include <QCoreApplication>\n\ntypedef struct{\n int x, y;\n} resolution_t;\n\nQList<resolution_t> resolutions;\n\nresolution_t makeRes(int x, int y)\n{\n resolution_t res;\n res.x = x;\n res.y = y;\n return res;\n}\n\nMacWebcamInfo::MacWebcamInfo(const QString &id)\n{\n webcam_id = id;\n resolutions.clear();\n res_list.clear();\n resolutions.push_back(makeRes(160, 120));\n resolutions.push_back(makeRes(320, 240));\n resolutions.push_back(makeRes(352, 288));\n resolutions.push_back(makeRes(640, 480));\n \n QList<resolution_t>::iterator i;\n QString str;\n for(i = resolutions.begin(); i != resolutions.end(); ++i){\n str = QString(\"%1 x %2\").arg(i->x).arg(i->y);\n res_list.push_back(str);\n }\n}\n\nconst QStringList& MacWebcamInfo::getResolutions()\n{\n return res_list;\n}\n\nbool MacWebcamInfo::decodeRes(const QString &res, int &res_x, int &res_y)\n{\n const QRegExp &res_rexp = QRegExp(\"^\\\\s*(\\\\d+)\\\\s*[xX]\\\\s*(\\\\d+)\\\\s*$\");\n if(res_rexp.indexIn(res) == -1){\n return false;\n }\n res_x = res_rexp.cap(1).toInt();\n res_y = res_rexp.cap(2).toInt();\n return true;\n}\n\nint MacWebcamInfo::findRes(const int &res_x, const int &res_y)\n{\n QList<resolution_t>::const_iterator i;\n int counter = 0;\n for(i = resolutions.begin(); i != resolutions.end(); ++i, ++counter){\n if((i->x == res_x) && (i->y == res_y)){\n return counter;\n }\n }\n return 0;\n}\n\nMacWebcamInfo::~MacWebcamInfo()\n{\n}\n\nQStringList& MacWebcamInfo::EnumerateWebcams()\n{\n QStringList *res = new QStringList();\n QProcess *enum_proc = new QProcess();\n enum_proc->start(QCoreApplication::applicationDirPath() + \"\/..\/helper\/qt_cam\", QStringList() << \"-e\");\n enum_proc->waitForStarted(10000);\n enum_proc->waitForFinished(10000);\n QString str(enum_proc->readAllStandardOutput());\n *res = str.split(\"\\n\", QString::SkipEmptyParts);\n return *res;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* \n * Copyright 2009-2015 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#ifndef HAVE_NO_CONFIG\n#include <votca_config.h>\n#endif\n\n#include <iostream>\n#include \"gmxtopologyreader.h\"\n\n#include <gromacs\/fileio\/tpxio.h>\n#include <gromacs\/topology\/atoms.h>\n#include <gromacs\/topology\/topology.h>\n#include <gromacs\/mdtypes\/inputrec.h>\n\n\/\/ this one is needed because of bool is defined in one of the headers included by gmx\n#undef bool\n\nnamespace votca { namespace csg {\n\nbool GMXTopologyReader::ReadTopology(string file, Topology &top)\n{ \n gmx_mtop_t mtop;\n\n int natoms;\n \/\/ cleanup topology to store new data\n top.Cleanup();\n\n t_inputrec ir;\n ::matrix gbox;\n\n (void)read_tpx((char *)file.c_str(),&ir,gbox,&natoms,NULL,NULL,&mtop);\n\n int count=0;\n for(int iblock=0; iblock<mtop.nmolblock; ++iblock)\n count+=mtop.molblock[iblock].nmol;\n\n if(count != mtop.mols.nr ) {\n throw runtime_error(\"gromacs topology contains inconsistency in molecule definitons\\n\\n\"\n \"A possible reason is an outdated .tpr file. Please rerun grompp to generate a new tpr file.\\n\"\n \"If the problem remains or \"\n \"you're missing the files to rerun grompp,\\n contact the votca mailing list for a solution.\");\n }\n\n int ifirstatom = 0;\n for(int iblock=0; iblock<mtop.nmolblock; ++iblock) {\n gmx_moltype_t *mol\n = &(mtop.moltype[mtop.molblock[iblock].type]);\n\n string molname = *(mol->name);\n\n int res_offset = top.ResidueCount();\n\n t_atoms *atoms=&(mol->atoms);\n\n for(int i=0; i < atoms->nres; i++) {\n top.CreateResidue(*(atoms->resinfo[i].name));\n }\n\n for(int imol=0; imol<mtop.molblock[iblock].nmol; ++imol) {\n Molecule *mi = top.CreateMolecule(molname);\n\n \/\/ read the atoms\n for(int iatom=0; iatom<mtop.molblock[iblock].natoms_mol; iatom++) {\n t_atom *a = &(atoms->atom[iatom]);\n\n BeadType *type = top.GetOrCreateBeadType(*(atoms->atomtype[iatom]));\n Bead *bead = top.CreateBead(1, *(atoms->atomname[iatom]), type, a->resind + res_offset, a->m, a->q);\n\n stringstream nm;\n nm << bead->getResnr() + 1 - res_offset << \":\" << top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n mi->AddBead(bead, nm.str());\n }\n\n \/\/ add exclusions\n for(int iatom=0; iatom<mtop.molblock[iblock].natoms_mol; iatom++) {\n \/\/ read exclusions\n t_blocka * excl = &(mol->excls);\n \/\/ insert exclusions\n list<Bead *> excl_list;\n for(int k=excl->index[iatom]; k<excl->index[iatom+1]; k++) {\n \texcl_list.push_back(top.getBead(excl->a[k]+ifirstatom));\n }\n top.InsertExclusion(top.getBead(iatom+ifirstatom), excl_list);\n }\n ifirstatom+=mtop.molblock[iblock].natoms_mol;\n }\n }\n\n matrix m;\n for(int i=0; i<3; i++)\n for(int j=0; j<3; j++)\n m[i][j] = gbox[j][i];\n top.setBox(m);\n\n return true;\n}\n\n}}\n<commit_msg>gmxtopologyreader: remove ancient warning about tpr<commit_after>\/* \n * Copyright 2009-2015 The VOTCA Development Team (http:\/\/www.votca.org)\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n#ifndef HAVE_NO_CONFIG\n#include <votca_config.h>\n#endif\n\n#include <iostream>\n#include \"gmxtopologyreader.h\"\n\n#include <gromacs\/fileio\/tpxio.h>\n#include <gromacs\/topology\/atoms.h>\n#include <gromacs\/topology\/topology.h>\n#include <gromacs\/mdtypes\/inputrec.h>\n\n\/\/ this one is needed because of bool is defined in one of the headers included by gmx\n#undef bool\n\nnamespace votca { namespace csg {\n\nbool GMXTopologyReader::ReadTopology(string file, Topology &top)\n{ \n gmx_mtop_t mtop;\n\n int natoms;\n \/\/ cleanup topology to store new data\n top.Cleanup();\n\n t_inputrec ir;\n ::matrix gbox;\n\n (void)read_tpx((char *)file.c_str(),&ir,gbox,&natoms,NULL,NULL,&mtop);\n\n int count=0;\n for(int iblock=0; iblock<mtop.nmolblock; ++iblock)\n count+=mtop.molblock[iblock].nmol;\n\n int ifirstatom = 0;\n for(int iblock=0; iblock<mtop.nmolblock; ++iblock) {\n gmx_moltype_t *mol\n = &(mtop.moltype[mtop.molblock[iblock].type]);\n\n string molname = *(mol->name);\n\n int res_offset = top.ResidueCount();\n\n t_atoms *atoms=&(mol->atoms);\n\n for(int i=0; i < atoms->nres; i++) {\n top.CreateResidue(*(atoms->resinfo[i].name));\n }\n\n for(int imol=0; imol<mtop.molblock[iblock].nmol; ++imol) {\n Molecule *mi = top.CreateMolecule(molname);\n\n \/\/ read the atoms\n for(int iatom=0; iatom<mtop.molblock[iblock].natoms_mol; iatom++) {\n t_atom *a = &(atoms->atom[iatom]);\n\n BeadType *type = top.GetOrCreateBeadType(*(atoms->atomtype[iatom]));\n Bead *bead = top.CreateBead(1, *(atoms->atomname[iatom]), type, a->resind + res_offset, a->m, a->q);\n\n stringstream nm;\n nm << bead->getResnr() + 1 - res_offset << \":\" << top.getResidue(bead->getResnr())->getName() << \":\" << bead->getName();\n mi->AddBead(bead, nm.str());\n }\n\n \/\/ add exclusions\n for(int iatom=0; iatom<mtop.molblock[iblock].natoms_mol; iatom++) {\n \/\/ read exclusions\n t_blocka * excl = &(mol->excls);\n \/\/ insert exclusions\n list<Bead *> excl_list;\n for(int k=excl->index[iatom]; k<excl->index[iatom+1]; k++) {\n \texcl_list.push_back(top.getBead(excl->a[k]+ifirstatom));\n }\n top.InsertExclusion(top.getBead(iatom+ifirstatom), excl_list);\n }\n ifirstatom+=mtop.molblock[iblock].natoms_mol;\n }\n }\n\n matrix m;\n for(int i=0; i<3; i++)\n for(int j=0; j<3; j++)\n m[i][j] = gbox[j][i];\n top.setBox(m);\n\n return true;\n}\n\n}}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2015] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_COLUMN_DATETIME_HPP\n#define REALM_COLUMN_DATETIME_HPP\n\n#include <realm\/column.hpp>\n\nnamespace realm {\n\nstruct NewDate {\n NewDate(int64_t seconds, uint32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) \n {\n REALM_ASSERT_3(nanoseconds, <, 1000000000);\n }\n NewDate(const null&) : m_is_null(true) { }\n NewDate() : NewDate(null()) { }\n\n bool is_null() const { return m_is_null; }\n \n \/\/ Note that nullability is handeled by query system. These operators are only invoked for non-null dates.\n bool operator==(const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }\n bool operator!=(const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }\n bool operator>(const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }\n bool operator<(const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }\n bool operator<=(const NewDate& rhs) const { return *this < rhs || *this == rhs; }\n bool operator>=(const NewDate& rhs) const { return *this > rhs || *this == rhs; }\n NewDate& operator=(const NewDate& rhs) = default;\n\n template<class Ch, class Tr>\n friend std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& out, const NewDate&);\n\n int64_t m_seconds;\n uint32_t m_nanoseconds;\n bool m_is_null;\n};\n\ntemplate<class C, class T>\ninline std::basic_ostream<C, T>& operator<<(std::basic_ostream<C, T>& out, const NewDate& d)\n{\n out << \"NewDate(\" << d.m_seconds << \", \" << d.m_nanoseconds << \")\";\n return out;\n}\n\n\/\/ Inherits from ColumnTemplate to get a compare_values() that can be called without knowing the\n\/\/ column type\nclass DateTimeColumn : public ColumnBaseSimple, public ColumnTemplate<NewDate> {\npublic:\n DateTimeColumn(Allocator& alloc, ref_type ref);\n ~DateTimeColumn() noexcept override;\n\n static ref_type create(Allocator& alloc, size_t size = 0);\n\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n MemRef clone_deep(Allocator& alloc) const override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n#ifdef REALM_DEBUG\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n#endif\n void add(const NewDate& ndt = NewDate{});\n NewDate get(size_t row_ndx) const noexcept;\n NewDate get_val(size_t row_ndx) const noexcept { return get(row_ndx); }\n void set(size_t row_ndx, const NewDate& ndt);\n bool compare(const DateTimeColumn& c) const noexcept;\n void erase(size_t ndx, bool is_last) {\n m_seconds.erase(ndx, is_last);\n m_nanoseconds.erase(ndx, is_last);\n }\n\n\nprivate:\n\n IntNullColumn m_seconds;\n IntegerColumn m_nanoseconds;\n\n};\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_DATETIME_HPP\n<commit_msg>Added missing override.<commit_after>\/*************************************************************************\n *\n * REALM CONFIDENTIAL\n * __________________\n *\n * [2011] - [2015] Realm Inc\n * All Rights Reserved.\n *\n * NOTICE: All information contained herein is, and remains\n * the property of Realm Incorporated and its suppliers,\n * if any. The intellectual and technical concepts contained\n * herein are proprietary to Realm Incorporated\n * and its suppliers and may be covered by U.S. and Foreign Patents,\n * patents in process, and are protected by trade secret or copyright law.\n * Dissemination of this information or reproduction of this material\n * is strictly forbidden unless prior written permission is obtained\n * from Realm Incorporated.\n *\n **************************************************************************\/\n#ifndef REALM_COLUMN_DATETIME_HPP\n#define REALM_COLUMN_DATETIME_HPP\n\n#include <realm\/column.hpp>\n\nnamespace realm {\n\nstruct NewDate {\n NewDate(int64_t seconds, uint32_t nanoseconds) : m_seconds(seconds), m_nanoseconds(nanoseconds), m_is_null(false) \n {\n REALM_ASSERT_3(nanoseconds, <, 1000000000);\n }\n NewDate(const null&) : m_is_null(true) { }\n NewDate() : NewDate(null()) { }\n\n bool is_null() const { return m_is_null; }\n \n \/\/ Note that nullability is handeled by query system. These operators are only invoked for non-null dates.\n bool operator==(const NewDate& rhs) const { return m_seconds == rhs.m_seconds && m_nanoseconds == rhs.m_nanoseconds; }\n bool operator!=(const NewDate& rhs) const { return m_seconds != rhs.m_seconds || m_nanoseconds != rhs.m_nanoseconds; }\n bool operator>(const NewDate& rhs) const { return (m_seconds > rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds > rhs.m_nanoseconds); }\n bool operator<(const NewDate& rhs) const { return (m_seconds < rhs.m_seconds) || (m_seconds == rhs.m_seconds && m_nanoseconds < rhs.m_nanoseconds); }\n bool operator<=(const NewDate& rhs) const { return *this < rhs || *this == rhs; }\n bool operator>=(const NewDate& rhs) const { return *this > rhs || *this == rhs; }\n NewDate& operator=(const NewDate& rhs) = default;\n\n template<class Ch, class Tr>\n friend std::basic_ostream<Ch, Tr>& operator<<(std::basic_ostream<Ch, Tr>& out, const NewDate&);\n\n int64_t m_seconds;\n uint32_t m_nanoseconds;\n bool m_is_null;\n};\n\ntemplate<class C, class T>\ninline std::basic_ostream<C, T>& operator<<(std::basic_ostream<C, T>& out, const NewDate& d)\n{\n out << \"NewDate(\" << d.m_seconds << \", \" << d.m_nanoseconds << \")\";\n return out;\n}\n\n\/\/ Inherits from ColumnTemplate to get a compare_values() that can be called without knowing the\n\/\/ column type\nclass DateTimeColumn : public ColumnBaseSimple, public ColumnTemplate<NewDate> {\npublic:\n DateTimeColumn(Allocator& alloc, ref_type ref);\n ~DateTimeColumn() noexcept override;\n\n static ref_type create(Allocator& alloc, size_t size = 0);\n\n \/\/\/ Get the number of entries in this column. This operation is relatively\n \/\/\/ slow.\n size_t size() const noexcept override;\n \/\/\/ Whether or not this column is nullable.\n bool is_nullable() const noexcept override;\n \/\/\/ Whether or not the value at \\a row_ndx is NULL. If the column is not\n \/\/\/ nullable, always returns false.\n bool is_null(size_t row_ndx) const noexcept override;\n \/\/\/ Sets the value at \\a row_ndx to be NULL.\n \/\/\/ \\throw LogicError Thrown if this column is not nullable.\n void set_null(size_t row_ndx) override;\n void insert_rows(size_t row_ndx, size_t num_rows_to_insert, size_t prior_num_rows, bool nullable) override;\n void erase_rows(size_t row_ndx, size_t num_rows_to_erase, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void move_last_row_over(size_t row_ndx, size_t prior_num_rows,\n bool broken_reciprocal_backlinks) override;\n void clear(size_t num_rows, bool broken_reciprocal_backlinks) override;\n void swap_rows(size_t row_ndx_1, size_t row_ndx_2) override;\n void destroy() noexcept override;\n StringData get_index_data(size_t, StringIndex::StringConversionBuffer& buffer) const noexcept override;\n MemRef clone_deep(Allocator& alloc) const override;\n ref_type write(size_t slice_offset, size_t slice_size, size_t table_size, _impl::OutputStream&) const override;\n void update_from_parent(size_t old_baseline) noexcept override;\n void refresh_accessor_tree(size_t new_col_ndx, const Spec&) override;\n#ifdef REALM_DEBUG\n void verify() const override;\n void to_dot(std::ostream&, StringData title = StringData()) const override;\n void do_dump_node_structure(std::ostream&, int level) const override;\n void leaf_to_dot(MemRef, ArrayParent*, size_t ndx_in_parent, std::ostream&) const override;\n#endif\n void add(const NewDate& ndt = NewDate{});\n NewDate get(size_t row_ndx) const noexcept;\n NewDate get_val(size_t row_ndx) const noexcept override { return get(row_ndx); }\n void set(size_t row_ndx, const NewDate& ndt);\n bool compare(const DateTimeColumn& c) const noexcept;\n void erase(size_t ndx, bool is_last) {\n m_seconds.erase(ndx, is_last);\n m_nanoseconds.erase(ndx, is_last);\n }\n\n\nprivate:\n\n IntNullColumn m_seconds;\n IntegerColumn m_nanoseconds;\n\n};\n\n} \/\/ namespace realm\n\n#endif \/\/ REALM_COLUMN_DATETIME_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/paint_aggregator.h\"\n\n#include \"base\/histogram.h\"\n#include \"base\/logging.h\"\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ALGORITHM NOTES\n\/\/\n\/\/ We attempt to maintain a scroll rect in the presence of invalidations that\n\/\/ are contained within the scroll rect. If an invalidation crosses a scroll\n\/\/ rect, then we just treat the scroll rect as an invalidation rect.\n\/\/\n\/\/ For invalidations performed prior to scrolling and contained within the\n\/\/ scroll rect, we offset the invalidation rects to account for the fact that\n\/\/ the consumer will perform scrolling before painting.\n\/\/\n\/\/ We only support scrolling along one axis at a time. A diagonal scroll will\n\/\/ therefore be treated as an invalidation.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ If the combined area of paint rects contained within the scroll rect grows\n\/\/ too large, then we might as well just treat the scroll rect as a paint rect.\n\/\/ This constant sets the max ratio of paint rect area to scroll rect area that\n\/\/ we will tolerate before downgrading the scroll into a repaint.\nstatic const float kMaxRedundantPaintToScrollArea = 0.8f;\n\n\/\/ The maximum number of paint rects. If we exceed this limit, then we'll\n\/\/ start combining paint rects (see CombinePaintRects). This limiting is\n\/\/ important since the WebKit code associated with deciding what to paint given\n\/\/ a paint rect can be significant.\nstatic const size_t kMaxPaintRects = 10;\n\ngfx::Rect PaintAggregator::PendingUpdate::GetScrollDamage() const {\n \/\/ Should only be scrolling in one direction at a time.\n DCHECK(!(scroll_delta.x() && scroll_delta.y()));\n\n gfx::Rect damaged_rect;\n\n \/\/ Compute the region we will expose by scrolling, and paint that into a\n \/\/ shared memory section.\n if (scroll_delta.x()) {\n int dx = scroll_delta.x();\n damaged_rect.set_y(scroll_rect.y());\n damaged_rect.set_height(scroll_rect.height());\n if (dx > 0) {\n damaged_rect.set_x(scroll_rect.x());\n damaged_rect.set_width(dx);\n } else {\n damaged_rect.set_x(scroll_rect.right() + dx);\n damaged_rect.set_width(-dx);\n }\n } else {\n int dy = scroll_delta.y();\n damaged_rect.set_x(scroll_rect.x());\n damaged_rect.set_width(scroll_rect.width());\n if (dy > 0) {\n damaged_rect.set_y(scroll_rect.y());\n damaged_rect.set_height(dy);\n } else {\n damaged_rect.set_y(scroll_rect.bottom() + dy);\n damaged_rect.set_height(-dy);\n }\n }\n\n \/\/ In case the scroll offset exceeds the width\/height of the scroll rect\n return scroll_rect.Intersect(damaged_rect);\n}\n\ngfx::Rect PaintAggregator::PendingUpdate::GetPaintBounds() const {\n gfx::Rect bounds;\n for (size_t i = 0; i < paint_rects.size(); ++i)\n bounds = bounds.Union(paint_rects[i]);\n return bounds;\n}\n\nbool PaintAggregator::HasPendingUpdate() const {\n return !update_.scroll_rect.IsEmpty() || !update_.paint_rects.empty();\n}\n\nvoid PaintAggregator::ClearPendingUpdate() {\n update_ = PendingUpdate();\n}\n\nvoid PaintAggregator::InvalidateRect(const gfx::Rect& rect) {\n \/\/ Combine overlapping paints using smallest bounding box.\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (existing_rect.Contains(rect)) \/\/ Optimize out redundancy.\n return;\n if (rect.Intersects(existing_rect) || rect.SharesEdgeWith(existing_rect)) {\n \/\/ Re-invalidate in case the union intersects other paint rects.\n gfx::Rect combined_rect = existing_rect.Union(rect);\n update_.paint_rects.erase(update_.paint_rects.begin() + i);\n InvalidateRect(combined_rect);\n return;\n }\n }\n\n \/\/ Add a non-overlapping paint.\n update_.paint_rects.push_back(rect);\n\n \/\/ If the new paint overlaps with a scroll, then it forces an invalidation of\n \/\/ the scroll. If the new paint is contained by a scroll, then trim off the\n \/\/ scroll damage to avoid redundant painting.\n if (!update_.scroll_rect.IsEmpty()) {\n if (ShouldInvalidateScrollRect(rect)) {\n InvalidateScrollRect();\n } else if (update_.scroll_rect.Contains(rect)) {\n update_.paint_rects[update_.paint_rects.size() - 1] =\n rect.Subtract(update_.GetScrollDamage());\n if (update_.paint_rects[update_.paint_rects.size() - 1].IsEmpty())\n update_.paint_rects.erase(update_.paint_rects.end() - 1);\n }\n }\n\n if (update_.paint_rects.size() > kMaxPaintRects)\n CombinePaintRects();\n\n \/\/ Track how large the paint_rects vector grows during an invalidation\n \/\/ sequence. Note: A subsequent invalidation may end up being combined\n \/\/ with all existing paints, which means that tracking the size of\n \/\/ paint_rects at the time when GetPendingUpdate() is called may mask\n \/\/ certain performance problems.\n HISTOGRAM_COUNTS_100(\"MPArch.RW_IntermediatePaintRectCount\",\n update_.paint_rects.size());\n}\n\nvoid PaintAggregator::ScrollRect(int dx, int dy, const gfx::Rect& clip_rect) {\n \/\/ We only support scrolling along one axis at a time.\n if (dx != 0 && dy != 0) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ We can only scroll one rect at a time.\n if (!update_.scroll_rect.IsEmpty() &&\n !update_.scroll_rect.Equals(clip_rect)) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ Again, we only support scrolling along one axis at a time. Make sure this\n \/\/ update doesn't scroll on a different axis than any existing one.\n if ((dx && update_.scroll_delta.y()) || (dy && update_.scroll_delta.x())) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ The scroll rect is new or isn't changing (though the scroll amount may\n \/\/ be changing).\n update_.scroll_rect = clip_rect;\n update_.scroll_delta.Offset(dx, dy);\n\n \/\/ Adjust any contained paint rects and check for any overlapping paints.\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n if (update_.scroll_rect.Contains(update_.paint_rects[i])) {\n update_.paint_rects[i] = ScrollPaintRect(update_.paint_rects[i], dx, dy);\n \/\/ The rect may have been scrolled out of view.\n if (update_.paint_rects[i].IsEmpty()) {\n update_.paint_rects.erase(update_.paint_rects.begin() + i);\n i--;\n }\n } else if (update_.scroll_rect.Intersects(update_.paint_rects[i])) {\n InvalidateScrollRect();\n return;\n }\n }\n\n \/\/ If the new scroll overlaps too much with contained paint rects, then force\n \/\/ an invalidation of the scroll.\n if (ShouldInvalidateScrollRect(gfx::Rect()))\n InvalidateScrollRect();\n}\n\ngfx::Rect PaintAggregator::ScrollPaintRect(const gfx::Rect& paint_rect,\n int dx, int dy) const {\n gfx::Rect result = paint_rect;\n\n result.Offset(dx, dy);\n result = update_.scroll_rect.Intersect(result);\n\n \/\/ Subtract out the scroll damage rect to avoid redundant painting.\n return result.Subtract(update_.GetScrollDamage());\n}\n\nbool PaintAggregator::ShouldInvalidateScrollRect(const gfx::Rect& rect) const {\n if (!rect.IsEmpty()) {\n if (!update_.scroll_rect.Intersects(rect))\n return false;\n\n if (!update_.scroll_rect.Contains(rect))\n return true;\n }\n\n \/\/ Check if the combined area of all contained paint rects plus this new\n \/\/ rect comes too close to the area of the scroll_rect. If so, then we\n \/\/ might as well invalidate the scroll rect.\n\n int paint_area = rect.size().GetArea();\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (update_.scroll_rect.Contains(existing_rect))\n paint_area += existing_rect.size().GetArea();\n }\n int scroll_area = update_.scroll_rect.size().GetArea();\n if (float(paint_area) \/ float(scroll_area) > kMaxRedundantPaintToScrollArea)\n return true;\n\n return false;\n}\n\nvoid PaintAggregator::InvalidateScrollRect() {\n gfx::Rect scroll_rect = update_.scroll_rect;\n update_.scroll_rect = gfx::Rect();\n update_.scroll_delta = gfx::Point();\n InvalidateRect(scroll_rect);\n}\n\nvoid PaintAggregator::CombinePaintRects() {\n \/\/ Combine paint rects down to at most two rects: one inside the scroll_rect\n \/\/ and one outside the scroll_rect. If there is no scroll_rect, then just\n \/\/ use the smallest bounding box for all paint rects.\n \/\/\n \/\/ NOTE: This is a fairly simple algorithm. We could get fancier by only\n \/\/ combining two rects to get us under the kMaxPaintRects limit, but if we\n \/\/ reach this method then it means we're hitting a rare case, so there's no\n \/\/ need to over-optimize it.\n \/\/\n if (update_.scroll_rect.IsEmpty()) {\n gfx::Rect bounds = update_.GetPaintBounds();\n update_.paint_rects.clear();\n update_.paint_rects.push_back(bounds);\n } else {\n gfx::Rect inner, outer;\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (update_.scroll_rect.Contains(existing_rect)) {\n inner = inner.Union(existing_rect);\n } else {\n outer = outer.Union(existing_rect);\n }\n }\n update_.paint_rects.clear();\n update_.paint_rects.push_back(inner);\n update_.paint_rects.push_back(outer);\n }\n}\n<commit_msg>Reduce kMaxPaintRects to test impact on single-core bot.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/renderer\/paint_aggregator.h\"\n\n#include \"base\/histogram.h\"\n#include \"base\/logging.h\"\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ ALGORITHM NOTES\n\/\/\n\/\/ We attempt to maintain a scroll rect in the presence of invalidations that\n\/\/ are contained within the scroll rect. If an invalidation crosses a scroll\n\/\/ rect, then we just treat the scroll rect as an invalidation rect.\n\/\/\n\/\/ For invalidations performed prior to scrolling and contained within the\n\/\/ scroll rect, we offset the invalidation rects to account for the fact that\n\/\/ the consumer will perform scrolling before painting.\n\/\/\n\/\/ We only support scrolling along one axis at a time. A diagonal scroll will\n\/\/ therefore be treated as an invalidation.\n\/\/ ----------------------------------------------------------------------------\n\n\/\/ If the combined area of paint rects contained within the scroll rect grows\n\/\/ too large, then we might as well just treat the scroll rect as a paint rect.\n\/\/ This constant sets the max ratio of paint rect area to scroll rect area that\n\/\/ we will tolerate before downgrading the scroll into a repaint.\nstatic const float kMaxRedundantPaintToScrollArea = 0.8f;\n\n\/\/ The maximum number of paint rects. If we exceed this limit, then we'll\n\/\/ start combining paint rects (see CombinePaintRects). This limiting is\n\/\/ important since the WebKit code associated with deciding what to paint given\n\/\/ a paint rect can be significant.\nstatic const size_t kMaxPaintRects = 5;\n\ngfx::Rect PaintAggregator::PendingUpdate::GetScrollDamage() const {\n \/\/ Should only be scrolling in one direction at a time.\n DCHECK(!(scroll_delta.x() && scroll_delta.y()));\n\n gfx::Rect damaged_rect;\n\n \/\/ Compute the region we will expose by scrolling, and paint that into a\n \/\/ shared memory section.\n if (scroll_delta.x()) {\n int dx = scroll_delta.x();\n damaged_rect.set_y(scroll_rect.y());\n damaged_rect.set_height(scroll_rect.height());\n if (dx > 0) {\n damaged_rect.set_x(scroll_rect.x());\n damaged_rect.set_width(dx);\n } else {\n damaged_rect.set_x(scroll_rect.right() + dx);\n damaged_rect.set_width(-dx);\n }\n } else {\n int dy = scroll_delta.y();\n damaged_rect.set_x(scroll_rect.x());\n damaged_rect.set_width(scroll_rect.width());\n if (dy > 0) {\n damaged_rect.set_y(scroll_rect.y());\n damaged_rect.set_height(dy);\n } else {\n damaged_rect.set_y(scroll_rect.bottom() + dy);\n damaged_rect.set_height(-dy);\n }\n }\n\n \/\/ In case the scroll offset exceeds the width\/height of the scroll rect\n return scroll_rect.Intersect(damaged_rect);\n}\n\ngfx::Rect PaintAggregator::PendingUpdate::GetPaintBounds() const {\n gfx::Rect bounds;\n for (size_t i = 0; i < paint_rects.size(); ++i)\n bounds = bounds.Union(paint_rects[i]);\n return bounds;\n}\n\nbool PaintAggregator::HasPendingUpdate() const {\n return !update_.scroll_rect.IsEmpty() || !update_.paint_rects.empty();\n}\n\nvoid PaintAggregator::ClearPendingUpdate() {\n update_ = PendingUpdate();\n}\n\nvoid PaintAggregator::InvalidateRect(const gfx::Rect& rect) {\n \/\/ Combine overlapping paints using smallest bounding box.\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (existing_rect.Contains(rect)) \/\/ Optimize out redundancy.\n return;\n if (rect.Intersects(existing_rect) || rect.SharesEdgeWith(existing_rect)) {\n \/\/ Re-invalidate in case the union intersects other paint rects.\n gfx::Rect combined_rect = existing_rect.Union(rect);\n update_.paint_rects.erase(update_.paint_rects.begin() + i);\n InvalidateRect(combined_rect);\n return;\n }\n }\n\n \/\/ Add a non-overlapping paint.\n update_.paint_rects.push_back(rect);\n\n \/\/ If the new paint overlaps with a scroll, then it forces an invalidation of\n \/\/ the scroll. If the new paint is contained by a scroll, then trim off the\n \/\/ scroll damage to avoid redundant painting.\n if (!update_.scroll_rect.IsEmpty()) {\n if (ShouldInvalidateScrollRect(rect)) {\n InvalidateScrollRect();\n } else if (update_.scroll_rect.Contains(rect)) {\n update_.paint_rects[update_.paint_rects.size() - 1] =\n rect.Subtract(update_.GetScrollDamage());\n if (update_.paint_rects[update_.paint_rects.size() - 1].IsEmpty())\n update_.paint_rects.erase(update_.paint_rects.end() - 1);\n }\n }\n\n if (update_.paint_rects.size() > kMaxPaintRects)\n CombinePaintRects();\n\n \/\/ Track how large the paint_rects vector grows during an invalidation\n \/\/ sequence. Note: A subsequent invalidation may end up being combined\n \/\/ with all existing paints, which means that tracking the size of\n \/\/ paint_rects at the time when GetPendingUpdate() is called may mask\n \/\/ certain performance problems.\n HISTOGRAM_COUNTS_100(\"MPArch.RW_IntermediatePaintRectCount\",\n update_.paint_rects.size());\n}\n\nvoid PaintAggregator::ScrollRect(int dx, int dy, const gfx::Rect& clip_rect) {\n \/\/ We only support scrolling along one axis at a time.\n if (dx != 0 && dy != 0) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ We can only scroll one rect at a time.\n if (!update_.scroll_rect.IsEmpty() &&\n !update_.scroll_rect.Equals(clip_rect)) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ Again, we only support scrolling along one axis at a time. Make sure this\n \/\/ update doesn't scroll on a different axis than any existing one.\n if ((dx && update_.scroll_delta.y()) || (dy && update_.scroll_delta.x())) {\n InvalidateRect(clip_rect);\n return;\n }\n\n \/\/ The scroll rect is new or isn't changing (though the scroll amount may\n \/\/ be changing).\n update_.scroll_rect = clip_rect;\n update_.scroll_delta.Offset(dx, dy);\n\n \/\/ Adjust any contained paint rects and check for any overlapping paints.\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n if (update_.scroll_rect.Contains(update_.paint_rects[i])) {\n update_.paint_rects[i] = ScrollPaintRect(update_.paint_rects[i], dx, dy);\n \/\/ The rect may have been scrolled out of view.\n if (update_.paint_rects[i].IsEmpty()) {\n update_.paint_rects.erase(update_.paint_rects.begin() + i);\n i--;\n }\n } else if (update_.scroll_rect.Intersects(update_.paint_rects[i])) {\n InvalidateScrollRect();\n return;\n }\n }\n\n \/\/ If the new scroll overlaps too much with contained paint rects, then force\n \/\/ an invalidation of the scroll.\n if (ShouldInvalidateScrollRect(gfx::Rect()))\n InvalidateScrollRect();\n}\n\ngfx::Rect PaintAggregator::ScrollPaintRect(const gfx::Rect& paint_rect,\n int dx, int dy) const {\n gfx::Rect result = paint_rect;\n\n result.Offset(dx, dy);\n result = update_.scroll_rect.Intersect(result);\n\n \/\/ Subtract out the scroll damage rect to avoid redundant painting.\n return result.Subtract(update_.GetScrollDamage());\n}\n\nbool PaintAggregator::ShouldInvalidateScrollRect(const gfx::Rect& rect) const {\n if (!rect.IsEmpty()) {\n if (!update_.scroll_rect.Intersects(rect))\n return false;\n\n if (!update_.scroll_rect.Contains(rect))\n return true;\n }\n\n \/\/ Check if the combined area of all contained paint rects plus this new\n \/\/ rect comes too close to the area of the scroll_rect. If so, then we\n \/\/ might as well invalidate the scroll rect.\n\n int paint_area = rect.size().GetArea();\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (update_.scroll_rect.Contains(existing_rect))\n paint_area += existing_rect.size().GetArea();\n }\n int scroll_area = update_.scroll_rect.size().GetArea();\n if (float(paint_area) \/ float(scroll_area) > kMaxRedundantPaintToScrollArea)\n return true;\n\n return false;\n}\n\nvoid PaintAggregator::InvalidateScrollRect() {\n gfx::Rect scroll_rect = update_.scroll_rect;\n update_.scroll_rect = gfx::Rect();\n update_.scroll_delta = gfx::Point();\n InvalidateRect(scroll_rect);\n}\n\nvoid PaintAggregator::CombinePaintRects() {\n \/\/ Combine paint rects down to at most two rects: one inside the scroll_rect\n \/\/ and one outside the scroll_rect. If there is no scroll_rect, then just\n \/\/ use the smallest bounding box for all paint rects.\n \/\/\n \/\/ NOTE: This is a fairly simple algorithm. We could get fancier by only\n \/\/ combining two rects to get us under the kMaxPaintRects limit, but if we\n \/\/ reach this method then it means we're hitting a rare case, so there's no\n \/\/ need to over-optimize it.\n \/\/\n if (update_.scroll_rect.IsEmpty()) {\n gfx::Rect bounds = update_.GetPaintBounds();\n update_.paint_rects.clear();\n update_.paint_rects.push_back(bounds);\n } else {\n gfx::Rect inner, outer;\n for (size_t i = 0; i < update_.paint_rects.size(); ++i) {\n const gfx::Rect& existing_rect = update_.paint_rects[i];\n if (update_.scroll_rect.Contains(existing_rect)) {\n inner = inner.Union(existing_rect);\n } else {\n outer = outer.Union(existing_rect);\n }\n }\n update_.paint_rects.clear();\n update_.paint_rects.push_back(inner);\n update_.paint_rects.push_back(outer);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"base\/at_exit.h\"\n#include \"chrome\/test\/ui\/ui_test_suite.h\"\n\nint main(int argc, char **argv) {\n \/\/ Some tests may use base::Singleton<>, thus we need to instanciate\n \/\/ the AtExitManager or else we will leak objects.\n base::AtExitManager at_exit_manager; \n\n Thread::SetThreadName(\"Tests_Main\", GetCurrentThreadId());\n return UITestSuite(argc, argv).Run();\n}\n<commit_msg>fix build bustage<commit_after>\/\/ Copyright 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"base\/at_exit.h\"\n#include \"base\/platform_thread.h\"\n#include \"chrome\/test\/ui\/ui_test_suite.h\"\n\nint main(int argc, char **argv) {\n \/\/ Some tests may use base::Singleton<>, thus we need to instanciate\n \/\/ the AtExitManager or else we will leak objects.\n base::AtExitManager at_exit_manager; \n\n PlatformThread::SetName(PlatformThread::CurrentId(), \"Tests_Main\");\n return UITestSuite(argc, argv).Run();\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <cppexpose\/function\/Function.h>\n\n#include <cppexpose\/function\/StaticFunction.h>\n#include <cppexpose\/function\/MemberFunction.h>\n\n\nnamespace cppexpose\n{\n\n\nFunction::Function(std::unique_ptr<AbstractFunction> && func)\n: m_func(std::move(func))\n{\n}\n\nFunction::Function(const Function & other)\n: m_func(other.m_func ? other.m_func->clone() : nullptr)\n{\n}\n\nFunction::~Function()\n{\n}\n\nFunction & Function::operator=(const Function & other)\n{\n \/\/ Copy function\n m_func = other.m_func ? other.m_func->clone() : nullptr;\n return *this;\n}\n\nbool Function::isEmpty() const\n{\n return m_func != nullptr;\n}\n\nVariant Function::call(const std::vector<Variant> & args)\n{\n \/\/ Call function\n if (m_func) {\n return m_func->call(args);\n }\n\n \/\/ Empty function\n return Variant();\n}\n\n\n} \/\/ namespace cppexpose\n<commit_msg>Fix stupid error<commit_after>\n#include <cppexpose\/function\/Function.h>\n\n#include <cppexpose\/function\/StaticFunction.h>\n#include <cppexpose\/function\/MemberFunction.h>\n\n\nnamespace cppexpose\n{\n\n\nFunction::Function(std::unique_ptr<AbstractFunction> && func)\n: m_func(std::move(func))\n{\n}\n\nFunction::Function(const Function & other)\n: m_func(other.m_func ? other.m_func->clone() : nullptr)\n{\n}\n\nFunction::~Function()\n{\n}\n\nFunction & Function::operator=(const Function & other)\n{\n \/\/ Copy function\n m_func = other.m_func ? other.m_func->clone() : nullptr;\n return *this;\n}\n\nbool Function::isEmpty() const\n{\n return m_func == nullptr;\n}\n\nVariant Function::call(const std::vector<Variant> & args)\n{\n \/\/ Call function\n if (m_func) {\n return m_func->call(args);\n }\n\n \/\/ Empty function\n return Variant();\n}\n\n\n} \/\/ namespace cppexpose\n<|endoftext|>"} {"text":"<commit_before>\n#include <gloperate-glfw\/RenderWindow.h>\n\n#define GLFW_INCLUDE_NONE\n#include <GLFW\/glfw3.h>\n\n#include <gloperate\/viewer\/input.h>\n#include <gloperate\/viewer\/RenderSurface.h>\n\n#include <gloperate-glfw\/WindowEvent.h>\n#include <gloperate-glfw\/GLContext.h>\n#include <gloperate-glfw\/input.h>\n\n\nusing namespace gloperate;\n\n\nnamespace gloperate_glfw\n{\n\n\nRenderWindow::RenderWindow(\n gloperate::ViewerContext * viewerContext\n , const std::string & title\n , int width\n , int height)\n: RenderWindow(viewerContext, title, width, height, new gloperate::RenderSurface(viewerContext))\n{\n}\n\nRenderWindow::~RenderWindow()\n{\n delete m_surface;\n}\n\ngloperate::ViewerContext * RenderWindow::viewerContext() const\n{\n return m_viewerContext;\n}\n\ngloperate::Surface * RenderWindow::surface() const\n{\n return m_surface;\n}\n\nRenderWindow::RenderWindow(\n gloperate::ViewerContext * viewerContext\n , const std::string & title\n , int width\n , int height\n , gloperate::Surface * surface)\n: Window(title, width, height, surface->requiredFormat())\n, m_viewerContext(viewerContext)\n, m_surface(surface)\n{\n}\n\nvoid RenderWindow::onContextInit()\n{\n m_surface->setOpenGLContext(m_context);\n}\n\nvoid RenderWindow::onContextDeinit()\n{\n m_surface->setOpenGLContext(nullptr);\n}\n\nvoid RenderWindow::onIdle()\n{\n m_surface->onIdle();\n}\n\nvoid RenderWindow::onResize(ResizeEvent & event)\n{\n m_virtualSize = event.size();\n\n m_surface->onResize(m_deviceSize, m_virtualSize);\n}\n\nvoid RenderWindow::onFramebufferResize(ResizeEvent & event)\n{\n m_deviceSize = event.size();\n\n m_surface->onResize(m_deviceSize, m_virtualSize);\n}\n\nvoid RenderWindow::onMove(MoveEvent &)\n{\n}\n\nvoid RenderWindow::onPaint(PaintEvent &)\n{\n m_surface->onRender();\n}\n\nvoid RenderWindow::onKeyPress(KeyEvent & event)\n{\n m_surface->onKeyPress(\n fromGLFWKeyCode(event.key())\n );\n}\n\nvoid RenderWindow::onKeyRelease(KeyEvent & event)\n{\n m_surface->onKeyRelease(\n fromGLFWKeyCode(event.key())\n );\n}\n\nvoid RenderWindow::onMousePress(MouseEvent & event)\n{\n m_surface->onMousePress(\n fromGLFWMouseButton(event.button())\n , event.pos()\n );\n}\n\nvoid RenderWindow::onMouseRelease(MouseEvent & event)\n{\n m_surface->onMouseRelease(\n fromGLFWMouseButton(event.button())\n , event.pos()\n );\n}\n\nvoid RenderWindow::onMouseMove(MouseEvent & event)\n{\n m_surface->onMouseMove(event.pos());\n}\n\nvoid RenderWindow::onMouseEnter(MouseEnterEvent &)\n{\n}\n\nvoid RenderWindow::onMouseLeave(MouseLeaveEvent &)\n{\n}\n\nvoid RenderWindow::onScroll(ScrollEvent & event)\n{\n m_surface->onMouseWheel(\n event.offset()\n , event.pos()\n );\n}\n\nvoid RenderWindow::onFocus(FocusEvent &)\n{\n}\n\nvoid RenderWindow::onIconify(IconifyEvent &)\n{\n}\n\nvoid RenderWindow::onTimer(TimerEvent &)\n{\n}\n\n\n} \/\/ namespace gloperate_glfw\n<commit_msg>Add fullscreen mode to F11 for gloperate-glfw (does not yet work as intended)<commit_after>\n#include <gloperate-glfw\/RenderWindow.h>\n\n#define GLFW_INCLUDE_NONE\n#include <GLFW\/glfw3.h>\n\n#include <gloperate\/viewer\/input.h>\n#include <gloperate\/viewer\/RenderSurface.h>\n\n#include <gloperate-glfw\/WindowEvent.h>\n#include <gloperate-glfw\/GLContext.h>\n#include <gloperate-glfw\/input.h>\n\n\nusing namespace gloperate;\n\n\nnamespace gloperate_glfw\n{\n\n\nRenderWindow::RenderWindow(\n gloperate::ViewerContext * viewerContext\n , const std::string & title\n , int width\n , int height)\n: RenderWindow(viewerContext, title, width, height, new gloperate::RenderSurface(viewerContext))\n{\n}\n\nRenderWindow::~RenderWindow()\n{\n delete m_surface;\n}\n\ngloperate::ViewerContext * RenderWindow::viewerContext() const\n{\n return m_viewerContext;\n}\n\ngloperate::Surface * RenderWindow::surface() const\n{\n return m_surface;\n}\n\nRenderWindow::RenderWindow(\n gloperate::ViewerContext * viewerContext\n , const std::string & title\n , int width\n , int height\n , gloperate::Surface * surface)\n: Window(title, width, height, surface->requiredFormat())\n, m_viewerContext(viewerContext)\n, m_surface(surface)\n{\n}\n\nvoid RenderWindow::onContextInit()\n{\n m_surface->setOpenGLContext(m_context);\n}\n\nvoid RenderWindow::onContextDeinit()\n{\n m_surface->setOpenGLContext(nullptr);\n}\n\nvoid RenderWindow::onIdle()\n{\n m_surface->onIdle();\n}\n\nvoid RenderWindow::onResize(ResizeEvent & event)\n{\n m_virtualSize = event.size();\n\n m_surface->onResize(m_deviceSize, m_virtualSize);\n}\n\nvoid RenderWindow::onFramebufferResize(ResizeEvent & event)\n{\n m_deviceSize = event.size();\n\n m_surface->onResize(m_deviceSize, m_virtualSize);\n}\n\nvoid RenderWindow::onMove(MoveEvent &)\n{\n}\n\nvoid RenderWindow::onPaint(PaintEvent &)\n{\n m_surface->onRender();\n}\n\nvoid RenderWindow::onKeyPress(KeyEvent & event)\n{\n if (event.key() == GLFW_KEY_F11)\n {\n setFullscreen(!isFullscreen());\n }\n\n m_surface->onKeyPress(\n fromGLFWKeyCode(event.key())\n );\n}\n\nvoid RenderWindow::onKeyRelease(KeyEvent & event)\n{\n m_surface->onKeyRelease(\n fromGLFWKeyCode(event.key())\n );\n}\n\nvoid RenderWindow::onMousePress(MouseEvent & event)\n{\n m_surface->onMousePress(\n fromGLFWMouseButton(event.button())\n , event.pos()\n );\n}\n\nvoid RenderWindow::onMouseRelease(MouseEvent & event)\n{\n m_surface->onMouseRelease(\n fromGLFWMouseButton(event.button())\n , event.pos()\n );\n}\n\nvoid RenderWindow::onMouseMove(MouseEvent & event)\n{\n m_surface->onMouseMove(event.pos());\n}\n\nvoid RenderWindow::onMouseEnter(MouseEnterEvent &)\n{\n}\n\nvoid RenderWindow::onMouseLeave(MouseLeaveEvent &)\n{\n}\n\nvoid RenderWindow::onScroll(ScrollEvent & event)\n{\n m_surface->onMouseWheel(\n event.offset()\n , event.pos()\n );\n}\n\nvoid RenderWindow::onFocus(FocusEvent &)\n{\n}\n\nvoid RenderWindow::onIconify(IconifyEvent &)\n{\n}\n\nvoid RenderWindow::onTimer(TimerEvent &)\n{\n}\n\n\n} \/\/ namespace gloperate_glfw\n<|endoftext|>"} {"text":"<commit_before>\/\/ Test.cpp\n\/\/ Sean Jones\n\n#define GLFW_INCLUDE_GLU\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/constants.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/core\/type_vec3.hpp>\n#include <vector>\n#include <random>\n#include <chrono>\n#include <array>\n\/\/ For Debug\n#include <iostream>\n\n\nusing namespace glm;\nusing namespace std;\nusing namespace std::chrono;\n\nGLFWwindow* window;\n\nbool running = true;\n\n\n\/\/ Vector containing vector data\nvector<vec2> vertices;\n\n\n\/*\n * triangle()\n *\n * Helper function to create a triangle\n *\/\nvoid triangle(const vec2& a, const vec2& b, const vec2& c)\n{\n \/\/ Push the vertices onto the vector\n vertices.push_back(a);\n vertices.push_back(b);\n vertices.push_back(c);\n} \/\/ Triangle\n\n\nvoid divide_triangle(const vec2& a, const vec2& b, const vec2& c, int count)\n{\n}\n\n\n\/*\n * Initialise()\n *\n * Initialises the application\n *\/\nbool initialise()\n{\n \/\/ Set background to cyan.\n glClearColor(0.0f, 1.0f, 1.0f, 1.0f);\n \/\/ Enable face culling\n glEnable(GL_CULL_FACE);\n \/\/ Enable depth testing\n glEnable(GL_DEPTH_TEST);\n \/\/ Enable vertex arrays\n glEnableClientState(GL_VERTEX_ARRAY);\n\n \/\/ Starting vertices - edge of the screen\n array<vec2, 3> v =\n {\n vec2(1.0f, -1.0f),\n vec2(0.0f, 1.0f),\n vec2(-1.0f, -1.0f)\n };\n\n \/\/ Divide the triangle first - you will need to modify this\n divide_triangle(v[0], v[1], v[2], 0);\n\n return true;\n} \/\/ initialise\n\n\n\/*\n * update()\n *\n * Updates the application state\n *\/\nvoid update(double deltaTime) {\n\n \/\/ Check if escape pressed or window is closed\n running = !glfwGetKey(window, GLFW_KEY_ESCAPE) &&\n !glfwWindowShouldClose(window);\n\n} \/\/ update\n\n\n\/*\n * render()\n *\n * renders the application\n *\/\nvoid render()\n{\n \/\/ Clear the screen\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ Point to the internal array of the vector\n glVertexPointer(2, GL_FLOAT, 0, &vertices[0]);\n\n \/\/ Set the colour\n glColor3f(1.0f, 0.0f, 0.0f);\n\n \/\/ Draw the arrays - start at 0 and have n vertices\n glDrawArrays(GL_TRIANGLES, 0, vertices.size());\n\n \/\/ Swap front and back buffers\n glfwSwapBuffers(window);\n\n \/\/ Set transform matrix to identity (no transform)\n glLoadIdentity();\n\n} \/\/ render\n\nint main(void)\n{\n \/* Initialise the library *\/\n if (!glfwInit())\n {\n return -1;\n }\n\n \/* Create a windowed mode window and its OpenGL context *\/\n window = glfwCreateWindow(640, 480, \"Sierpinski\", NULL, NULL);\n if (!window)\n {\n glfwTerminate();\n return -1;\n }\n\n \/* Make the window's context current *\/\n glfwMakeContextCurrent(window);\n \/* Set the function for the key callback *\/\n\n \/\/initialise the window\n if (!initialise())\n {\n glfwTerminate();\n return -1;\n }\n\n \/\/ Monitor the elapsed time per frame\n auto currentTimeStamp = system_clock::now();\n auto prevTimeStamp = system_clock::now();\n\n\n \/* Loop until the user closes the window *\/\n while (!glfwWindowShouldClose(window))\n {\n \/\/ Get current time\n currentTimeStamp = system_clock::now();\n \/\/ Calculate elapsed time\n auto elapsed = duration_cast<milliseconds>(currentTimeStamp\n - prevTimeStamp);\n \/\/Convert to fractions of a second\n auto seconds = double(elapsed.count()) \/ 1000.0;\n\n \/\/ Update Application\n update(seconds);\n \/\/Render scene\n render();\n\n \/* Swap front and back buffers *\/\n glfwSwapBuffers(window);\n\n \/* Poll for and process events *\/\n glfwPollEvents();\n\n \/\/ set the previous time stamp to current time stamp\n prevTimeStamp = currentTimeStamp;\n } \/\/ Main Loop\n\n glfwTerminate();\n return 0;\n} \/\/ main\n<commit_msg>Added initial divide_triangle<commit_after>\/\/ Test.cpp\n\/\/ Sean Jones\n\n#define GLFW_INCLUDE_GLU\n#include <GLFW\/glfw3.h>\n#include <glm\/glm.hpp>\n#include <glm\/gtx\/constants.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n#include <glm\/gtx\/transform.hpp>\n#include <glm\/gtc\/type_ptr.hpp>\n#include <glm\/core\/type_vec3.hpp>\n#include <vector>\n#include <random>\n#include <chrono>\n#include <array>\n\/\/ For Debug\n#include <iostream>\n\n\nusing namespace glm;\nusing namespace std;\nusing namespace std::chrono;\n\nGLFWwindow* window;\n\nbool running = true;\n\n\n\/\/ Vector containing vector data\nvector<vec2> vertices;\n\n\n\/*\n * triangle()\n *\n * Helper function to create a triangle\n *\/\nvoid triangle(const vec2& a, const vec2& b, const vec2& c)\n{\n \/\/ Push the vertices onto the vector\n vertices.push_back(a);\n vertices.push_back(b);\n vertices.push_back(c);\n} \/\/ Triangle\n\n\nvoid divide_triangle(const vec2& a, const vec2& b, const vec2& c, int count)\n{\n \/\/ If subdivisions (count) is zero just output the triangle defined it initialise\n if (count == 0) {\n triangle(a, b, c);\n }\n}\n\n\n\/*\n * Initialise()\n *\n * Initialises the application\n *\/\nbool initialise()\n{\n \/\/ Set background to cyan.\n glClearColor(0.0f, 1.0f, 1.0f, 1.0f);\n \/\/ Enable face culling\n glEnable(GL_CULL_FACE);\n \/\/ Enable depth testing\n glEnable(GL_DEPTH_TEST);\n \/\/ Enable vertex arrays\n glEnableClientState(GL_VERTEX_ARRAY);\n\n \/\/ Starting vertices - edge of the screen\n array<vec2, 3> v =\n {\n vec2(1.0f, -1.0f),\n vec2(0.0f, 1.0f),\n vec2(-1.0f, -1.0f)\n };\n\n \/\/ Divide the triangle first - you will need to modify this\n divide_triangle(v[0], v[1], v[2], 0);\n\n return true;\n} \/\/ initialise\n\n\n\/*\n * update()\n *\n * Updates the application state\n *\/\nvoid update(double deltaTime) {\n\n \/\/ Check if escape pressed or window is closed\n running = !glfwGetKey(window, GLFW_KEY_ESCAPE) &&\n !glfwWindowShouldClose(window);\n\n} \/\/ update\n\n\n\/*\n * render()\n *\n * renders the application\n *\/\nvoid render()\n{\n \/\/ Clear the screen\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ Point to the internal array of the vector\n glVertexPointer(2, GL_FLOAT, 0, &vertices[0]);\n\n \/\/ Set the colour\n glColor3f(1.0f, 0.0f, 0.0f);\n\n \/\/ Draw the arrays - start at 0 and have n vertices\n glDrawArrays(GL_TRIANGLES, 0, vertices.size());\n\n \/\/ Swap front and back buffers\n glfwSwapBuffers(window);\n\n \/\/ Set transform matrix to identity (no transform)\n glLoadIdentity();\n\n} \/\/ render\n\nint main(void)\n{\n \/* Initialise the library *\/\n if (!glfwInit())\n {\n return -1;\n }\n\n \/* Create a windowed mode window and its OpenGL context *\/\n window = glfwCreateWindow(640, 480, \"Sierpinski\", NULL, NULL);\n if (!window)\n {\n glfwTerminate();\n return -1;\n }\n\n \/* Make the window's context current *\/\n glfwMakeContextCurrent(window);\n \/* Set the function for the key callback *\/\n\n \/\/initialise the window\n if (!initialise())\n {\n glfwTerminate();\n return -1;\n }\n\n \/\/ Monitor the elapsed time per frame\n auto currentTimeStamp = system_clock::now();\n auto prevTimeStamp = system_clock::now();\n\n\n \/* Loop until the user closes the window *\/\n while (!glfwWindowShouldClose(window))\n {\n \/\/ Get current time\n currentTimeStamp = system_clock::now();\n \/\/ Calculate elapsed time\n auto elapsed = duration_cast<milliseconds>(currentTimeStamp\n - prevTimeStamp);\n \/\/Convert to fractions of a second\n auto seconds = double(elapsed.count()) \/ 1000.0;\n\n \/\/ Update Application\n update(seconds);\n \/\/Render scene\n render();\n\n \/* Swap front and back buffers *\/\n glfwSwapBuffers(window);\n\n \/* Poll for and process events *\/\n glfwPollEvents();\n\n \/\/ set the previous time stamp to current time stamp\n prevTimeStamp = currentTimeStamp;\n } \/\/ Main Loop\n\n glfwTerminate();\n return 0;\n} \/\/ main\n<|endoftext|>"} {"text":"<commit_before>\n#include <gloperate-qtquick\/QmlEngine.h>\n\n#include <cstring>\n\n#include <QVariant>\n#include <QQmlContext>\n#include <QJSValueIterator>\n#include <QBuffer>\n#include <QImage>\n\n#include <cppexpose\/reflection\/Property.h>\n#include <cppexpose\/typed\/DirectValue.h>\n#include <cppexpose\/function\/Function.h>\n\n#include <cppassist\/fs\/FilePath.h>\n#include <cppassist\/logging\/logging.h>\n\n#include <gloperate\/gloperate.h>\n#include <gloperate\/base\/Environment.h>\n#include <gloperate\/rendering\/Image.h>\n\n#include <gloperate-qtquick\/RenderItem.h>\n#include <gloperate-qtquick\/TextureItem.h>\n#include <gloperate-qtquick\/VideoProfile.h>\n#include <gloperate-qtquick\/TextController.h>\n#include <gloperate-qtquick\/QmlScriptFunction.h>\n#include <gloperate-qtquick\/QmlObjectWrapper.h>\n\n\nnamespace gloperate_qtquick\n{\n\n\nconst char * s_qmlObjectPointerKey = \"_obj\";\n\n\nQmlEngine::QmlEngine(gloperate::Environment * environment)\n: qmltoolbox::QmlApplicationEngine()\n, m_environment(environment)\n{\n \/\/ Get data path\n m_gloperateQmlPath = QString::fromStdString(gloperate::dataPath()) + \"\/gloperate\/qml\";\n\n \/\/ Import gloperate qml module\n addImportPath(m_gloperateQmlPath);\n\n \/\/ Register QML types\n qmlRegisterType<RenderItem> (\"gloperate.rendering\", 1, 0, \"RenderItem\");\n qmlRegisterType<TextureItem> (\"gloperate.rendering\", 1, 0, \"TextureItem\");\n qmlRegisterType<TextController>(\"gloperate.base\", 1, 0, \"TextController\");\n qmlRegisterType<VideoProfile> (\"gloperate.base\", 1, 0, \"VideoProfile\");\n\n \/\/ Register global functions and properties\n rootContext()->setContextObject(this);\n}\n\nQmlEngine::~QmlEngine()\n{\n \/\/ Disconnect from Object::beforeDestroy signals\n for (auto & objectWrapper : m_objectWrappers)\n {\n objectWrapper.second.second.disconnect();\n }\n\n \/\/ m_objectWrappers are deleted through the Qt object hierarchy\n}\n\nconst gloperate::Environment * QmlEngine::environment() const\n{\n return m_environment;\n}\n\ngloperate::Environment * QmlEngine::environment()\n{\n return m_environment;\n}\n\nvoid QmlEngine::addGlobalObject(cppexpose::Object * obj)\n{\n \/\/ Create object wrapper\n const auto wrapper = getOrCreateObjectWrapper(obj);\n\n \/\/ Add global object\n rootContext()->setContextProperty(QString::fromStdString(obj->name()), QVariant::fromValue(wrapper->wrapObject()));\n}\n\nvoid QmlEngine::removeGlobalObject(cppexpose::Object * obj)\n{\n \/\/ Remove global object by setting it to null\n rootContext()->setContextProperty(QString::fromStdString(obj->name()), QVariant{});\n}\n\nQString QmlEngine::executeScript(const QString & code)\n{\n return QString::fromStdString(\n m_environment->executeScript(code.toStdString()).value<std::string>()\n );\n}\n\ncppexpose::Variant QmlEngine::fromScriptValue(const QJSValue & value)\n{\n if (value.isBool()) {\n return cppexpose::Variant(value.toBool());\n }\n\n else if (value.isNumber()) {\n return cppexpose::Variant(value.toNumber());\n }\n\n else if (value.isString()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isRegExp()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isError()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isDate()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isCallable()) {\n cppexpose::Function function(cppassist::make_unique<QmlScriptFunction>(this, value));\n return cppexpose::Variant::fromValue<cppexpose::Function>(function);\n }\n\n else if (value.isArray()) {\n cppexpose::VariantArray array;\n\n QJSValueIterator it(value);\n while (it.next())\n {\n if (it.hasNext()) \/\/ Skip last item (length)\n {\n array.push_back(fromScriptValue(it.value()));\n }\n }\n\n return array;\n }\n\n else if (value.isObject())\n {\n cppexpose::VariantMap obj;\n\n QJSValueIterator it(value);\n while (it.next())\n {\n \/\/ If a property s_qmlObjectPointerKey exists, the object is a cppexpose::Object.\n \/\/ In this case, extract the pointer and return that.\n \/\/ Otherwise, continue to build a key-value map of the object's properties\n if (it.name() == s_qmlObjectPointerKey)\n {\n assert(it.value().isQObject());\n const auto objWrapper = static_cast<QmlObjectWrapper *>(it.value().toQObject());\n\n return cppexpose::Variant::fromValue(objWrapper->object());\n }\n else\n {\n obj[it.name().toStdString()] = fromScriptValue(it.value());\n }\n }\n\n return obj;\n }\n\n else {\n return cppexpose::Variant();\n }\n}\n\nQJSValue QmlEngine::toScriptValue(const cppexpose::Variant & var)\n{\n if (var.hasType<char>()) {\n return QJSValue(var.value<char>());\n }\n\n else if (var.hasType<unsigned char>()) {\n return QJSValue(var.value<unsigned char>());\n }\n\n else if (var.hasType<short>()) {\n return QJSValue(var.value<short>());\n }\n\n else if (var.hasType<unsigned short>()) {\n return QJSValue(var.value<unsigned short>());\n }\n\n else if (var.hasType<int>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned int>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<long>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned long>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<long long>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned long long>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<float>()) {\n return QJSValue(var.value<float>());\n }\n\n else if (var.hasType<double>()) {\n return QJSValue(var.value<double>());\n }\n\n else if (var.hasType<char*>()) {\n return QJSValue(var.value<char*>());\n }\n\n else if (var.hasType<std::string>()) {\n return QJSValue(var.value<std::string>().c_str());\n }\n\n else if (var.hasType<bool>()) {\n return QJSValue(var.value<bool>());\n }\n\n else if (var.hasType<cppassist::FilePath>()) {\n return QJSValue(var.value<cppassist::FilePath>().path().c_str());\n }\n\n else if (var.isBool()) {\n return QJSValue(var.toBool());\n }\n\n else if (var.isUnsignedIntegral()) {\n return QJSValue((unsigned int)var.toULongLong());\n }\n\n else if (var.isSignedIntegral() || var.isIntegral()) {\n return QJSValue((int)var.toLongLong());\n }\n\n else if (var.isFloatingPoint()) {\n return QJSValue(var.toDouble());\n }\n\n else if (var.isString()) {\n return QJSValue(var.toString().c_str());\n }\n\n else if (var.hasType<gloperate::Image>()) {\n const gloperate::Image * image = var.ptr<gloperate::Image>();\n\n QImage conversion((unsigned char *) image->data(), image->width(), image->height(), QImage::Format_RGB32);\n\n QByteArray byteArray;\n QBuffer buffer(&byteArray);\n buffer.open(QIODevice::WriteOnly);\n conversion.save(&buffer, \"PNG\", 0);\n QString imgBase64 = QString::fromLatin1(byteArray.toBase64().data());\n\n return toScriptValue(\"data:image\/png;base64,\" + imgBase64.toStdString());\n }\n\n else if (var.hasType<cppexpose::VariantArray>()) {\n QJSValue array = newArray();\n\n cppexpose::VariantArray variantArray = var.value<cppexpose::VariantArray>();\n for (unsigned int i=0; i<variantArray.size(); i++) {\n array.setProperty(i, toScriptValue(variantArray.at(i)));\n }\n\n return array;\n }\n\n else if (var.hasType<cppexpose::VariantMap>()) {\n QJSValue obj = newObject();\n\n cppexpose::VariantMap variantMap = var.value<cppexpose::VariantMap>();\n for (const std::pair<std::string, cppexpose::Variant> & pair : variantMap)\n {\n obj.setProperty(pair.first.c_str(), toScriptValue(pair.second));\n }\n\n return obj;\n }\n\n else if (var.hasType<cppexpose::Object *>()) {\n const auto object = var.value<cppexpose::Object *>();\n\n return getOrCreateObjectWrapper(object)->wrapObject();\n }\n\n else {\n return QJSValue();\n }\n}\n\ncppexpose::Variant QmlEngine::fromQVariant(const QVariant & value)\n{\n if (value.type() == QVariant::Bool) {\n return cppexpose::Variant(value.toBool());\n }\n\n else if (value.type() == QVariant::Char || value.type() == QVariant::Int) {\n return cppexpose::Variant(value.toInt());\n }\n\n else if (value.type() == QVariant::UInt) {\n return cppexpose::Variant(value.toUInt());\n }\n\n else if (value.type() == QVariant::LongLong) {\n return cppexpose::Variant(value.toLongLong());\n }\n\n else if (value.type() == QVariant::ULongLong) {\n return cppexpose::Variant(value.toULongLong());\n }\n\n else if (value.type() == QVariant::Double) {\n return cppexpose::Variant(value.toDouble());\n }\n\n else if (value.type() == QVariant::StringList)\n {\n cppexpose::VariantArray array;\n\n QStringList list = value.toStringList();\n for (QStringList::iterator it = list.begin(); it != list.end(); ++it)\n {\n array.push_back(cppexpose::Variant((*it).toStdString()) );\n }\n\n return array;\n }\n\n else if (value.type() == QVariant::List)\n {\n cppexpose::VariantArray array;\n\n QList<QVariant> list = value.toList();\n for (QList<QVariant>::iterator it = list.begin(); it != list.end(); ++it)\n {\n array.push_back(fromQVariant(*it));\n }\n\n return array;\n }\n\n else if (value.type() == QVariant::Map)\n {\n cppexpose::VariantMap obj;\n\n QMap<QString, QVariant> map = value.toMap();\n for (QMap<QString, QVariant>::iterator it = map.begin(); it != map.end(); ++it)\n {\n std::string key = it.key().toStdString();\n obj[key] = fromQVariant(it.value());\n }\n\n return obj;\n }\n\n else if (value.type() == QVariant::String || value.canConvert(QVariant::String))\n {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.canConvert<QJSValue>())\n {\n return fromScriptValue(value.value<QJSValue>());\n }\n\n else {\n return cppexpose::Variant();\n }\n}\n\nconst QString & QmlEngine::gloperateModulePath() const\n{\n return m_gloperateQmlPath;\n}\n\n\nQmlObjectWrapper * QmlEngine::getOrCreateObjectWrapper(cppexpose::Object * object)\n{\n \/\/ Check if wrapper exists\n const auto itr = m_objectWrappers.find(object);\n if (itr != m_objectWrappers.end())\n {\n return itr->second.first;\n }\n\n \/\/ Wrap object\n const auto wrapper = new QmlObjectWrapper(this, object);\n\n \/\/ Delete wrapper when object is destroyed\n \/\/ The connection will be deleted when this backend is destroyed\n const auto beforeDestroy = object->beforeDestroy.connect([this, object](cppexpose::AbstractProperty *)\n {\n delete m_objectWrappers[object].first;\n m_objectWrappers.erase(object);\n });\n\n \/\/ Save wrapper for later\n m_objectWrappers[object] = {wrapper, beforeDestroy};\n\n return wrapper;\n}\n\n\n} \/\/ namespace gloperate_qtquick\n<commit_msg>Avoid loop to list properties if a wrapped object is found<commit_after>\n#include <gloperate-qtquick\/QmlEngine.h>\n\n#include <cstring>\n\n#include <QVariant>\n#include <QQmlContext>\n#include <QJSValueIterator>\n#include <QBuffer>\n#include <QImage>\n\n#include <cppexpose\/reflection\/Property.h>\n#include <cppexpose\/typed\/DirectValue.h>\n#include <cppexpose\/function\/Function.h>\n\n#include <cppassist\/fs\/FilePath.h>\n#include <cppassist\/logging\/logging.h>\n\n#include <gloperate\/gloperate.h>\n#include <gloperate\/base\/Environment.h>\n#include <gloperate\/rendering\/Image.h>\n\n#include <gloperate-qtquick\/RenderItem.h>\n#include <gloperate-qtquick\/TextureItem.h>\n#include <gloperate-qtquick\/VideoProfile.h>\n#include <gloperate-qtquick\/TextController.h>\n#include <gloperate-qtquick\/QmlScriptFunction.h>\n#include <gloperate-qtquick\/QmlObjectWrapper.h>\n\n\nnamespace gloperate_qtquick\n{\n\n\nconst char * s_qmlObjectPointerKey = \"_obj\";\n\n\nQmlEngine::QmlEngine(gloperate::Environment * environment)\n: qmltoolbox::QmlApplicationEngine()\n, m_environment(environment)\n{\n \/\/ Get data path\n m_gloperateQmlPath = QString::fromStdString(gloperate::dataPath()) + \"\/gloperate\/qml\";\n\n \/\/ Import gloperate qml module\n addImportPath(m_gloperateQmlPath);\n\n \/\/ Register QML types\n qmlRegisterType<RenderItem> (\"gloperate.rendering\", 1, 0, \"RenderItem\");\n qmlRegisterType<TextureItem> (\"gloperate.rendering\", 1, 0, \"TextureItem\");\n qmlRegisterType<TextController>(\"gloperate.base\", 1, 0, \"TextController\");\n qmlRegisterType<VideoProfile> (\"gloperate.base\", 1, 0, \"VideoProfile\");\n\n \/\/ Register global functions and properties\n rootContext()->setContextObject(this);\n}\n\nQmlEngine::~QmlEngine()\n{\n \/\/ Disconnect from Object::beforeDestroy signals\n for (auto & objectWrapper : m_objectWrappers)\n {\n objectWrapper.second.second.disconnect();\n }\n\n \/\/ m_objectWrappers are deleted through the Qt object hierarchy\n}\n\nconst gloperate::Environment * QmlEngine::environment() const\n{\n return m_environment;\n}\n\ngloperate::Environment * QmlEngine::environment()\n{\n return m_environment;\n}\n\nvoid QmlEngine::addGlobalObject(cppexpose::Object * obj)\n{\n \/\/ Create object wrapper\n const auto wrapper = getOrCreateObjectWrapper(obj);\n\n \/\/ Add global object\n rootContext()->setContextProperty(QString::fromStdString(obj->name()), QVariant::fromValue(wrapper->wrapObject()));\n}\n\nvoid QmlEngine::removeGlobalObject(cppexpose::Object * obj)\n{\n \/\/ Remove global object by setting it to null\n rootContext()->setContextProperty(QString::fromStdString(obj->name()), QVariant{});\n}\n\nQString QmlEngine::executeScript(const QString & code)\n{\n return QString::fromStdString(\n m_environment->executeScript(code.toStdString()).value<std::string>()\n );\n}\n\ncppexpose::Variant QmlEngine::fromScriptValue(const QJSValue & value)\n{\n if (value.isBool()) {\n return cppexpose::Variant(value.toBool());\n }\n\n else if (value.isNumber()) {\n return cppexpose::Variant(value.toNumber());\n }\n\n else if (value.isString()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isRegExp()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isError()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isDate()) {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.isCallable()) {\n cppexpose::Function function(cppassist::make_unique<QmlScriptFunction>(this, value));\n return cppexpose::Variant::fromValue<cppexpose::Function>(function);\n }\n\n else if (value.isArray()) {\n cppexpose::VariantArray array;\n\n QJSValueIterator it(value);\n while (it.next())\n {\n if (it.hasNext()) \/\/ Skip last item (length)\n {\n array.push_back(fromScriptValue(it.value()));\n }\n }\n\n return array;\n }\n\n else if (value.isObject())\n {\n \/\/ If a property s_qmlObjectPointerKey exists, the object is a cppexpose::Object.\n \/\/ In this case, extract the pointer and return that.\n \/\/ Otherwise, build a key-value map of the object's properties.\n if (value.hasOwnProperty(s_qmlObjectPointerKey))\n {\n assert(it.value().isQObject());\n const auto objWrapper = static_cast<QmlObjectWrapper *>(value.property(s_qmlObjectPointerKey).toQObject());\n\n return cppexpose::Variant::fromValue(objWrapper->object());\n }\n\n else\n {\n cppexpose::VariantMap obj;\n\n QJSValueIterator it(value);\n while (it.next())\n {\n if (it.name() == s_qmlObjectPointerKey)\n {\n }\n else\n {\n obj[it.name().toStdString()] = fromScriptValue(it.value());\n }\n }\n\n return obj;\n }\n }\n\n else {\n return cppexpose::Variant();\n }\n}\n\nQJSValue QmlEngine::toScriptValue(const cppexpose::Variant & var)\n{\n if (var.hasType<char>()) {\n return QJSValue(var.value<char>());\n }\n\n else if (var.hasType<unsigned char>()) {\n return QJSValue(var.value<unsigned char>());\n }\n\n else if (var.hasType<short>()) {\n return QJSValue(var.value<short>());\n }\n\n else if (var.hasType<unsigned short>()) {\n return QJSValue(var.value<unsigned short>());\n }\n\n else if (var.hasType<int>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned int>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<long>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned long>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<long long>()) {\n return QJSValue(var.value<int>());\n }\n\n else if (var.hasType<unsigned long long>()) {\n return QJSValue(var.value<unsigned int>());\n }\n\n else if (var.hasType<float>()) {\n return QJSValue(var.value<float>());\n }\n\n else if (var.hasType<double>()) {\n return QJSValue(var.value<double>());\n }\n\n else if (var.hasType<char*>()) {\n return QJSValue(var.value<char*>());\n }\n\n else if (var.hasType<std::string>()) {\n return QJSValue(var.value<std::string>().c_str());\n }\n\n else if (var.hasType<bool>()) {\n return QJSValue(var.value<bool>());\n }\n\n else if (var.hasType<cppassist::FilePath>()) {\n return QJSValue(var.value<cppassist::FilePath>().path().c_str());\n }\n\n else if (var.isBool()) {\n return QJSValue(var.toBool());\n }\n\n else if (var.isUnsignedIntegral()) {\n return QJSValue((unsigned int)var.toULongLong());\n }\n\n else if (var.isSignedIntegral() || var.isIntegral()) {\n return QJSValue((int)var.toLongLong());\n }\n\n else if (var.isFloatingPoint()) {\n return QJSValue(var.toDouble());\n }\n\n else if (var.isString()) {\n return QJSValue(var.toString().c_str());\n }\n\n else if (var.hasType<gloperate::Image>()) {\n const gloperate::Image * image = var.ptr<gloperate::Image>();\n\n QImage conversion((unsigned char *) image->data(), image->width(), image->height(), QImage::Format_RGB32);\n\n QByteArray byteArray;\n QBuffer buffer(&byteArray);\n buffer.open(QIODevice::WriteOnly);\n conversion.save(&buffer, \"PNG\", 0);\n QString imgBase64 = QString::fromLatin1(byteArray.toBase64().data());\n\n return toScriptValue(\"data:image\/png;base64,\" + imgBase64.toStdString());\n }\n\n else if (var.hasType<cppexpose::VariantArray>()) {\n QJSValue array = newArray();\n\n cppexpose::VariantArray variantArray = var.value<cppexpose::VariantArray>();\n for (unsigned int i=0; i<variantArray.size(); i++) {\n array.setProperty(i, toScriptValue(variantArray.at(i)));\n }\n\n return array;\n }\n\n else if (var.hasType<cppexpose::VariantMap>()) {\n QJSValue obj = newObject();\n\n cppexpose::VariantMap variantMap = var.value<cppexpose::VariantMap>();\n for (const std::pair<std::string, cppexpose::Variant> & pair : variantMap)\n {\n obj.setProperty(pair.first.c_str(), toScriptValue(pair.second));\n }\n\n return obj;\n }\n\n else if (var.hasType<cppexpose::Object *>()) {\n const auto object = var.value<cppexpose::Object *>();\n\n return getOrCreateObjectWrapper(object)->wrapObject();\n }\n\n else {\n return QJSValue();\n }\n}\n\ncppexpose::Variant QmlEngine::fromQVariant(const QVariant & value)\n{\n if (value.type() == QVariant::Bool) {\n return cppexpose::Variant(value.toBool());\n }\n\n else if (value.type() == QVariant::Char || value.type() == QVariant::Int) {\n return cppexpose::Variant(value.toInt());\n }\n\n else if (value.type() == QVariant::UInt) {\n return cppexpose::Variant(value.toUInt());\n }\n\n else if (value.type() == QVariant::LongLong) {\n return cppexpose::Variant(value.toLongLong());\n }\n\n else if (value.type() == QVariant::ULongLong) {\n return cppexpose::Variant(value.toULongLong());\n }\n\n else if (value.type() == QVariant::Double) {\n return cppexpose::Variant(value.toDouble());\n }\n\n else if (value.type() == QVariant::StringList)\n {\n cppexpose::VariantArray array;\n\n QStringList list = value.toStringList();\n for (QStringList::iterator it = list.begin(); it != list.end(); ++it)\n {\n array.push_back(cppexpose::Variant((*it).toStdString()) );\n }\n\n return array;\n }\n\n else if (value.type() == QVariant::List)\n {\n cppexpose::VariantArray array;\n\n QList<QVariant> list = value.toList();\n for (QList<QVariant>::iterator it = list.begin(); it != list.end(); ++it)\n {\n array.push_back(fromQVariant(*it));\n }\n\n return array;\n }\n\n else if (value.type() == QVariant::Map)\n {\n cppexpose::VariantMap obj;\n\n QMap<QString, QVariant> map = value.toMap();\n for (QMap<QString, QVariant>::iterator it = map.begin(); it != map.end(); ++it)\n {\n std::string key = it.key().toStdString();\n obj[key] = fromQVariant(it.value());\n }\n\n return obj;\n }\n\n else if (value.type() == QVariant::String || value.canConvert(QVariant::String))\n {\n return cppexpose::Variant(value.toString().toStdString());\n }\n\n else if (value.canConvert<QJSValue>())\n {\n return fromScriptValue(value.value<QJSValue>());\n }\n\n else {\n return cppexpose::Variant();\n }\n}\n\nconst QString & QmlEngine::gloperateModulePath() const\n{\n return m_gloperateQmlPath;\n}\n\n\nQmlObjectWrapper * QmlEngine::getOrCreateObjectWrapper(cppexpose::Object * object)\n{\n \/\/ Check if wrapper exists\n const auto itr = m_objectWrappers.find(object);\n if (itr != m_objectWrappers.end())\n {\n return itr->second.first;\n }\n\n \/\/ Wrap object\n const auto wrapper = new QmlObjectWrapper(this, object);\n\n \/\/ Delete wrapper when object is destroyed\n \/\/ The connection will be deleted when this backend is destroyed\n const auto beforeDestroy = object->beforeDestroy.connect([this, object](cppexpose::AbstractProperty *)\n {\n delete m_objectWrappers[object].first;\n m_objectWrappers.erase(object);\n });\n\n \/\/ Save wrapper for later\n m_objectWrappers[object] = {wrapper, beforeDestroy};\n\n return wrapper;\n}\n\n\n} \/\/ namespace gloperate_qtquick\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * client.cpp\n *\n * Handles the client env.\n *\n * Created by Ryan Faulkner on 2014-06-08\n * Copyright (c) 2014. All rights reserved.\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <regex>\n#include <assert.h>\n\n#include \"column_types.h\"\n#include \"redis.h\"\n#include \"md5.h\"\n#include \"index.h\"\n\n#define REDISHOST \"127.0.0.1\"\n#define REDISPORT 6379\n\nusing namespace std;\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisSet() {\n RedisHandler r;\n r.connect();\n r.write(\"foo\", \"bar\");\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisGet() {\n RedisHandler r;\n r.connect();\n cout << endl << \"VALUE FOR KEY foo\" << endl;\n cout << r.read(\"foo\") << endl << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisKeys() {\n RedisHandler r;\n std::vector<std::string> vec;\n\n r.connect();\n vec = r.keys(\"*\");\n cout << \"KEY LIST FOR *\" << endl;\n for (std::vector<std::string>::iterator it = vec.begin() ; it != vec.end(); ++it) {\n cout << *it << endl;\n }\n cout << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisIO() {\n RedisHandler r;\n std::vector<string>* vec;\n std::string outTrue, outFalse = \"\";\n\n r.connect();\n r.write(\"test_key\", \"test value\");\n outTrue = r.read(\"test_key\");\n assert(std::strcmp(outTrue.c_str(), \"test value\") == 0);\n r.deleteKey(\"test_key\");\n assert(!r.exists(\"test_key\"));\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testMd5Hashing() {\n cout << endl << \"md5 of 'mykey': \" << md5(\"mykey\") << endl;\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testRegexForTypes() {\n IntegerColumn ic;\n FloatColumn fc;\n assert(ic.validate(\"1981\"));\n assert(fc.validate(\"5.2\"));\n cout << \"Passed regex tests.\" << endl;\n}\n\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testOrderPairAlphaNumeric() {\n IndexHandler ih;\n assert(std::strcmp(ih.orderPairAlphaNumeric(\"b\", \"a\").c_str(), \"a_b\") == 0);\n cout << \"Passed orderPairAlphaNumeric tests.\" << endl;\n}\n\n\/**\n * Test to ensure that relation entities are encoded properly\n *\/\nvoid testJSONEntityEncoding() {\n IndexHandler ih;\n Json::Value* ret;\n std::vector<std::pair<ColumnBase*, std::string>>* fields_ent = new vector<std::pair<ColumnBase*, std::string>>;\n fields_ent->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n ih.writeEntity(\"test\", fields_ent);\n \/\/ Fetch the entity representation\n ret = ih.fetchEntity(\"test\");\n cout << ret->toStyledString() << endl;\n\n \/\/ TODO - assert\n \/\/ TODO - remove entity\n}\n\n\n\/**\n * Test to ensure that relation fields are encoded properly\n *\/\nvoid testRelationJSONRelationEncoding() {\n\/\/ IndexHandler ih;\n\/\/ std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_1 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_2 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<std::string, std::string>>* fields_rel_1 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/ std::vector<std::pair<std::string, std::string>>* fields_rel_2 = new vector<std::pair<ColumnBase*, std::string>>;\n\/\/\n\/\/ \/\/ Popualate fields\n\/\/ fields_ent_1->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n\/\/ fields_ent_2->push_back(std::make_pair(getColumnType(\"string\"), \"b\"));\n\/\/ fields_rel_1->push_back(std::make_pair(\"a\", \"1\"));\n\/\/ fields_rel_2->push_back(std::make_pair(\"b\", \"hello\"));\n\/\/\n\/\/ \/\/ Create entities\n\/\/ ih.writeEntity(\"test_1\", fields_ent_1);\n\/\/ ih.writeEntity(\"test_2\", fields_ent_1);\n\/\/\n\/\/ \/\/ Create relation in redis\n\/\/ ih.writeRelation(\"test_1\", \"test_2\", fields_rel_1, fields_rel_2)\n\n \/\/ Fetch the entity representation\n\n \/\/ assert\n}\n\nint main() {\n cout << \"-- TESTS BEGIN --\" << endl << endl;\n\n\/\/ testRedisSet();\n\/\/ testRedisGet();\n\/\/ testRedisKeys();\n\/\/ md5Hashing();\n\/\/ testRedisIO();\n\/\/ testRegexForTypes();\n\/\/ testOrderPairAlphaNumeric();\n testJSONEntityEncoding();\n\n cout << endl << \"-- TESTS END --\" << endl;\n\n return 0;\n}\n<commit_msg>flesh out functional portion of json encoding for relation test<commit_after>\n\/*\n * client.cpp\n *\n * Handles the client env.\n *\n * Created by Ryan Faulkner on 2014-06-08\n * Copyright (c) 2014. All rights reserved.\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n#include <regex>\n#include <assert.h>\n\n#include \"column_types.h\"\n#include \"redis.h\"\n#include \"md5.h\"\n#include \"index.h\"\n\n#define REDISHOST \"127.0.0.1\"\n#define REDISPORT 6379\n\nusing namespace std;\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisSet() {\n RedisHandler r;\n r.connect();\n r.write(\"foo\", \"bar\");\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisGet() {\n RedisHandler r;\n r.connect();\n cout << endl << \"VALUE FOR KEY foo\" << endl;\n cout << r.read(\"foo\") << endl << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisKeys() {\n RedisHandler r;\n std::vector<std::string> vec;\n\n r.connect();\n vec = r.keys(\"*\");\n cout << \"KEY LIST FOR *\" << endl;\n for (std::vector<std::string>::iterator it = vec.begin() ; it != vec.end(); ++it) {\n cout << *it << endl;\n }\n cout << endl;\n}\n\n\/** Test to ensure that redis keys are correctly returned *\/\nvoid testRedisIO() {\n RedisHandler r;\n std::vector<string>* vec;\n std::string outTrue, outFalse = \"\";\n\n r.connect();\n r.write(\"test_key\", \"test value\");\n outTrue = r.read(\"test_key\");\n assert(std::strcmp(outTrue.c_str(), \"test value\") == 0);\n r.deleteKey(\"test_key\");\n assert(!r.exists(\"test_key\"));\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testMd5Hashing() {\n cout << endl << \"md5 of 'mykey': \" << md5(\"mykey\") << endl;\n}\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testRegexForTypes() {\n IntegerColumn ic;\n FloatColumn fc;\n assert(ic.validate(\"1981\"));\n assert(fc.validate(\"5.2\"));\n cout << \"Passed regex tests.\" << endl;\n}\n\n\n\/** Test to ensure that md5 hashing works *\/\nvoid testOrderPairAlphaNumeric() {\n IndexHandler ih;\n assert(std::strcmp(ih.orderPairAlphaNumeric(\"b\", \"a\").c_str(), \"a_b\") == 0);\n cout << \"Passed orderPairAlphaNumeric tests.\" << endl;\n}\n\n\/**\n * Test to ensure that relation entities are encoded properly\n *\/\nvoid testJSONEntityEncoding() {\n IndexHandler ih;\n Json::Value* ret;\n std::vector<std::pair<ColumnBase*, std::string>>* fields_ent = new vector<std::pair<ColumnBase*, std::string>>;\n fields_ent->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n ih.writeEntity(\"test\", fields_ent);\n \/\/ Fetch the entity representation\n ret = ih.fetchEntity(\"test\");\n cout << ret->toStyledString() << endl;\n\n \/\/ TODO - assert\n \/\/ TODO - remove entity\n}\n\n\n\/**\n * Test to ensure that relation fields are encoded properly\n *\/\nvoid testJSONRelationEncoding() {\n IndexHandler ih;\n std::vector<Json::Value> ret;\n std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_1 = new vector<std::pair<ColumnBase*, std::string>>;\n std::vector<std::pair<ColumnBase*, std::string>>* fields_ent_2 = new vector<std::pair<ColumnBase*, std::string>>;\n std::vector<std::pair<std::string, std::string>>* fields_rel_1 = new vector<std::pair<std::string, std::string>>;\n std::vector<std::pair<std::string, std::string>>* fields_rel_2 = new vector<std::pair<std::string, std::string>>;\n\n \/\/ Popualate fields\n fields_ent_1->push_back(std::make_pair(getColumnType(\"integer\"), \"a\"));\n fields_ent_2->push_back(std::make_pair(getColumnType(\"string\"), \"b\"));\n fields_rel_1->push_back(std::make_pair(\"a\", \"1\"));\n fields_rel_2->push_back(std::make_pair(\"b\", \"hello\"));\n\n \/\/ Create entities\n ih.writeEntity(\"test_1\", fields_ent_1);\n ih.writeEntity(\"test_2\", fields_ent_1);\n\n \/\/ Create relation in redis\n ih.writeRelation(\"test_1\", \"test_2\", fields_rel_1, fields_rel_2);\n\n \/\/ Fetch the entity representation\n ret = ih.fetchRelationPrefix(\"test_1\", \"test_2\");\n for (std::vector<Json::Value>::iterator it = ret.begin(); it != ret.end(); ++it)\n cout << (*it).toStyledString() << endl;\n\n \/\/ assert\n}\n\nint main() {\n cout << \"-- TESTS BEGIN --\" << endl << endl;\n\n\/\/ testRedisSet();\n\/\/ testRedisGet();\n\/\/ testRedisKeys();\n\/\/ md5Hashing();\n\/\/ testRedisIO();\n\/\/ testRegexForTypes();\n\/\/ testOrderPairAlphaNumeric();\n testJSONEntityEncoding();\n\n cout << endl << \"-- TESTS END --\" << endl;\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/** \n **\n ** This is free software: you can redistribute it and\/or modify\n ** it under the terms of the GNU General Public License as published by\n ** the Free Software Foundation, either version 3 of the License, or\n ** (at your option) any later version.\n **\n ** This software is distributed in the hope that it will be useful,\n ** but WITHOUT ANY WARRANTY; without even the implied warranty of\n ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n ** GNU General Public License for more details.\n **\n ** You should have received a copy of the GNU General Public License\n ** along with this software. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n **\n **\/\n#include \"codeclean.h\"\n#include \"cstdout_test.h\"\n#include \"cstdin_test.h\"\n#include \"bag_test.h\"\n#include \"edge_test.h\"\n\nusing com::goffersoft::codeclean::codeclean;\nusing com::goffersoft::codeclean::testsuite;\nusing edu::princeton::cs::algs4::cstdout_testsuite;\nusing edu::princeton::cs::algs4::cstdin_testsuite;\nusing edu::princeton::cs::algs4::bag_testsuite;\nusing edu::princeton::cs::algs4::edge_testsuite;\n\nint test_main(int argc, const char **argv) {\n codeclean tests;\n tests.add_testsuite(cstdout_testsuite());\n tests.add_testsuite(cstdin_testsuite());\n tests.add_testsuite(bag_testsuite());\n tests.add_testsuite(edge_testsuite());\n tests.run();\n tests.print_report();\n\n return 0;\n}\n<commit_msg>add graph testsuite<commit_after>\/** \n **\n ** This is free software: you can redistribute it and\/or modify\n ** it under the terms of the GNU General Public License as published by\n ** the Free Software Foundation, either version 3 of the License, or\n ** (at your option) any later version.\n **\n ** This software is distributed in the hope that it will be useful,\n ** but WITHOUT ANY WARRANTY; without even the implied warranty of\n ** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n ** GNU General Public License for more details.\n **\n ** You should have received a copy of the GNU General Public License\n ** along with this software. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n **\n **\/\n#include \"codeclean.h\"\n#include \"cstdout_test.h\"\n#include \"cstdin_test.h\"\n#include \"bag_test.h\"\n#include \"edge_test.h\"\n#include \"graph_test.h\"\n\nusing com::goffersoft::codeclean::codeclean;\nusing com::goffersoft::codeclean::testsuite;\nusing edu::princeton::cs::algs4::cstdout_testsuite;\nusing edu::princeton::cs::algs4::cstdin_testsuite;\nusing edu::princeton::cs::algs4::bag_testsuite;\nusing edu::princeton::cs::algs4::edge_testsuite;\nusing edu::princeton::cs::algs4::graph_testsuite;\n\nint test_main(int argc, const char **argv) {\n codeclean tests;\n tests.add_testsuite(cstdout_testsuite());\n tests.add_testsuite(cstdin_testsuite());\n tests.add_testsuite(bag_testsuite());\n tests.add_testsuite(edge_testsuite());\n tests.add_testsuite(graph_testsuite());\n tests.run();\n tests.print_report();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"core\/mat4.h\"\n#include \"core\/random.h\"\n#include \"core\/mat4.h\"\n#include \"core\/axisangle.h\"\n#include \"core\/aabb.h\"\n#include \"core\/texturetypes.h\"\n#include \"core\/vfs.h\"\n#include \"core\/vfs_imagegenerator.h\"\n#include \"core\/vfs_path.h\"\n#include \"core\/os.h\"\n#include \"core\/range.h\"\n#include \"core\/camera.h\"\n#include \"core\/stringutils.h\"\n#include \"core\/stdutils.h\"\n#include \"core\/proto.h\"\n#include \"core\/log.h\"\n#include \"core\/rgb.h\"\n#include \"core\/colors.h\"\n#include \"core\/palette_lospec.h\"\n#include \"core\/palette.h\"\n\n#include \"render\/init.h\"\n#include \"render\/debuggl.h\"\n#include \"render\/materialshader.h\"\n#include \"render\/compiledmesh.h\"\n#include \"render\/texturecache.h\"\n#include \"render\/shaderattribute3d.h\"\n#include \"render\/texture.h\"\n#include \"render\/world.h\"\n#include \"render\/viewport.h\"\n#include \"render\/materialshadercache.h\"\n#include \"render\/defaultfiles.h\"\n\n\n#include \"window\/imguilibrary.h\"\n#include \"window\/timer.h\"\n#include \"window\/imgui_ext.h\"\n#include \"window\/imgui_extra.h\"\n#include \"window\/sdllibrary.h\"\n#include \"window\/sdlwindow.h\"\n#include \"window\/sdlglcontext.h\"\n#include \"window\/filesystem.h\"\n#include \"window\/engine.h\"\n#include \"window\/canvas.h\"\n\n#include \"imgui\/imgui.h\"\n#include \"SDL.h\"\n#include <iostream>\n#include <memory>\n\n\n#define IMGUI_DEFINE_MATH_OPERATORS\n#include \"imgui\/imgui_internal.h\"\n#include \"window\/imgui_ext.h\"\n\n\nusing namespace euphoria::core;\nusing namespace euphoria::render;\nusing namespace euphoria::window;\n\n\nImU32\nC(const Rgbai& c)\n{\n return IM_COL32(c.r, c.g, c.b, c.a);\n}\n\n\nbool IsOver(const ImVec2& min, const ImVec2& max, const ImVec2& mouse)\n{\n const auto over_min = min.x <= mouse.x && min.y <= mouse.y;\n const auto over_max = max.x >= mouse.x && max.y >= mouse.y;\n return over_min && over_max;\n}\n\n\nint\nmain(int argc, char** argv)\n{\n Engine engine;\n\n if (const auto r = engine.Setup(argparse::Arguments::Extract(argc, argv)); r != 0)\n {\n return r;\n }\n\n\n int window_width = 1280;\n int window_height = 720;\n\n if(!engine.CreateWindow(\"Painter\", window_width, window_height, true))\n {\n return -1;\n }\n\n \/\/ ViewportHandler viewport_handler;\n \/\/ viewport_handler.SetSize(window_width, window_height);\n\n\n bool running = true;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ main loop\n CanvasConfig cc;\n Canvas canvas;\n Image image;\n Random random;\n auto palette = palette::EDG64();\n auto foreground = 0;\n auto background = 1;\n\n image.SetupNoAlphaSupport(64, 64);\n image.SetAllTopBottom([&](int x, int y)\n {\n return Rgbai{palette.colors[background]};\n });\n\n while(running)\n {\n SDL_Event e;\n while(SDL_PollEvent(&e) != 0)\n {\n engine.imgui->ProcessEvents(&e);\n\n if(engine.HandleResize(e, &window_width, &window_height))\n {\n \/\/ viewport_handler.SetSize(window_width, window_height);\n }\n\n switch(e.type)\n {\n case SDL_QUIT: running = false; break;\n default:\n \/\/ ignore other events\n break;\n }\n }\n\n engine.imgui->StartNewFrame();\n\n if(ImGui::BeginMainMenuBar())\n {\n if(ImGui::BeginMenu(\"File\"))\n {\n if(ImGui::MenuItem(\"Exit\", \"Ctrl+Q\"))\n {\n running = false;\n }\n ImGui::EndMenu();\n }\n }\n ImGui::EndMainMenuBar();\n\n if(ImGui::Begin(\"palette\"))\n {\n\n const auto tile_size = 20;\n const auto spacing = 3;\n const auto big_spacing = 10;\n const auto big_offset = 0.20f;\n const auto max_pal_size = tile_size * 5;\n\n if(imgui::CanvasBegin(ImVec4(0.3, 0.3, 0.3, 1.0f), \"palette\"))\n {\n const auto p = ImGui::GetCursorScreenPos();\n const auto size = ImGui::GetContentRegionAvail();\n\n const auto hovering = ImGui::IsAnyItemHovered();\n const auto left_clicked = ImGui::IsMouseClicked(0);\n const auto right_clicked = ImGui::IsMouseClicked(1);\n const auto mouse = ImGui::GetMousePos();\n\n ImDrawList* draw_list = ImGui::GetWindowDrawList();\n\n auto x = 0.0f;\n auto y = 0.0f;\n\n for(int palette_index=0; palette_index<palette.colors.size(); palette_index+=1)\n {\n if(x + tile_size > size.x)\n {\n x = 0;\n y += tile_size + spacing;\n }\n\n const auto min = p + ImVec2(x, y);\n const auto max = min + ImVec2(tile_size, tile_size);\n\n draw_list->AddRectFilled(min, max, C(palette.colors[palette_index]));\n x += tile_size + spacing;\n\n if(!hovering && (left_clicked || right_clicked))\n {\n if(IsOver(min, max, mouse))\n {\n if(left_clicked)\n {\n foreground = palette_index;\n }\n else\n {\n background = palette_index;\n }\n \n }\n }\n }\n\n y += tile_size;\n\n const auto big_size = std::min(size.x, size.y - y) - big_spacing * 2;\n\n if(big_size > 0)\n {\n const auto bsf = std::min<float>(max_pal_size, big_size \/ (1+big_offset));\n const auto bs = ImVec2(bsf, bsf);\n const auto foreground_pos = ImVec2\n (\n size.x\/2 - (bsf * (1+big_offset))\/2,\n y+big_spacing\n );\n\n const auto background_pos = foreground_pos + bs * big_offset;\n draw_list->AddRectFilled(p + background_pos, p + background_pos + bs, C(palette.GetSafeIndex(background)));\n draw_list->AddRectFilled(p + foreground_pos, p + foreground_pos + bs, C(palette.GetSafeIndex(foreground)));\n }\n\n imgui::CanvasEnd();\n }\n }\n ImGui::End();\n\n ImGui::SetNextWindowSize(ImVec2 {300, 300}, ImGuiCond_FirstUseEver);\n if(ImGui::Begin(\"pixel\"))\n {\n if(image.IsValid())\n {\n const auto hovering = ImGui::IsAnyItemHovered();\n const auto left_down = ImGui::IsMouseDown(0);\n const auto right_down = ImGui::IsMouseDown(1);\n\n canvas.Begin(cc);\n canvas.ShowGrid(cc);\n\n \/\/ draw image\n ImDrawList* draw_list = ImGui::GetWindowDrawList();\n image.ForAllTopBottom([&](int x, int y, const Rgbai& c)\n {\n const auto pixel_size = 5;\n const auto p = ImVec2(x * pixel_size, y*pixel_size);\n const auto s = ImVec2(pixel_size, pixel_size);\n const auto ps = canvas.WorldToScreen(p);\n const auto pss = canvas.WorldToScreen(p+s);\n const auto m = ImGui::GetMousePos();\n if(ps.x <= m.x && ps.y <= m.y && pss.x >= m.x && pss.y >= m.y)\n {\n \/\/ hovering over pixel\n if(!hovering && left_down)\n {\n image.SetPixel(x, y, palette.colors[foreground]);\n }\n\n \/\/ hovering over pixel\n if(!hovering && right_down)\n {\n image.SetPixel(x, y, palette.colors[background]);\n }\n }\n draw_list->AddRectFilled(ps, pss, C(c));\n });\n\n canvas.ShowRuler(cc);\n canvas.End(cc);\n }\n }\n ImGui::End();\n\n \/\/ ImGui::ShowMetricsWindow();\n\n engine.init->ClearScreen(Color::LightGray);\n engine.imgui->Render();\n\n SDL_GL_SwapWindow(engine.window->window);\n }\n\n return 0;\n}\n<commit_msg>added todo<commit_after>#include \"core\/mat4.h\"\n#include \"core\/random.h\"\n#include \"core\/mat4.h\"\n#include \"core\/axisangle.h\"\n#include \"core\/aabb.h\"\n#include \"core\/texturetypes.h\"\n#include \"core\/vfs.h\"\n#include \"core\/vfs_imagegenerator.h\"\n#include \"core\/vfs_path.h\"\n#include \"core\/os.h\"\n#include \"core\/range.h\"\n#include \"core\/camera.h\"\n#include \"core\/stringutils.h\"\n#include \"core\/stdutils.h\"\n#include \"core\/proto.h\"\n#include \"core\/log.h\"\n#include \"core\/rgb.h\"\n#include \"core\/colors.h\"\n#include \"core\/palette_lospec.h\"\n#include \"core\/palette.h\"\n\n#include \"render\/init.h\"\n#include \"render\/debuggl.h\"\n#include \"render\/materialshader.h\"\n#include \"render\/compiledmesh.h\"\n#include \"render\/texturecache.h\"\n#include \"render\/shaderattribute3d.h\"\n#include \"render\/texture.h\"\n#include \"render\/world.h\"\n#include \"render\/viewport.h\"\n#include \"render\/materialshadercache.h\"\n#include \"render\/defaultfiles.h\"\n\n\n#include \"window\/imguilibrary.h\"\n#include \"window\/timer.h\"\n#include \"window\/imgui_ext.h\"\n#include \"window\/imgui_extra.h\"\n#include \"window\/sdllibrary.h\"\n#include \"window\/sdlwindow.h\"\n#include \"window\/sdlglcontext.h\"\n#include \"window\/filesystem.h\"\n#include \"window\/engine.h\"\n#include \"window\/canvas.h\"\n\n#include \"imgui\/imgui.h\"\n#include \"SDL.h\"\n#include <iostream>\n#include <memory>\n\n\n#define IMGUI_DEFINE_MATH_OPERATORS\n#include \"imgui\/imgui_internal.h\"\n#include \"window\/imgui_ext.h\"\n\n\nusing namespace euphoria::core;\nusing namespace euphoria::render;\nusing namespace euphoria::window;\n\n\n\/*\nPixLE todo\ndifferent paint tools: brush, fill\nbrushes \/ sizes\nbrush preview\/hover\ntransparency\ntool: eraser\nlayers\nundo\/redo\nsave\/load via terminal\nfast draw\naa lines\ntile x\/y mode\nclone\/pattern brush\n*\/\n\n\nImU32\nC(const Rgbai& c)\n{\n return IM_COL32(c.r, c.g, c.b, c.a);\n}\n\n\nbool IsOver(const ImVec2& min, const ImVec2& max, const ImVec2& mouse)\n{\n const auto over_min = min.x <= mouse.x && min.y <= mouse.y;\n const auto over_max = max.x >= mouse.x && max.y >= mouse.y;\n return over_min && over_max;\n}\n\n\nint\nmain(int argc, char** argv)\n{\n Engine engine;\n\n if (const auto r = engine.Setup(argparse::Arguments::Extract(argc, argv)); r != 0)\n {\n return r;\n }\n\n\n int window_width = 1280;\n int window_height = 720;\n\n if(!engine.CreateWindow(\"PixLE\", window_width, window_height, true))\n {\n return -1;\n }\n\n \/\/ ViewportHandler viewport_handler;\n \/\/ viewport_handler.SetSize(window_width, window_height);\n\n\n bool running = true;\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/ main loop\n CanvasConfig cc;\n Canvas canvas;\n Image image;\n Random random;\n auto palette = palette::EDG64();\n auto foreground = 0;\n auto background = 1;\n\n image.SetupNoAlphaSupport(64, 64);\n image.SetAllTopBottom([&](int x, int y)\n {\n return Rgbai{palette.colors[background]};\n });\n\n while(running)\n {\n SDL_Event e;\n while(SDL_PollEvent(&e) != 0)\n {\n engine.imgui->ProcessEvents(&e);\n\n if(engine.HandleResize(e, &window_width, &window_height))\n {\n \/\/ viewport_handler.SetSize(window_width, window_height);\n }\n\n switch(e.type)\n {\n case SDL_QUIT: running = false; break;\n default:\n \/\/ ignore other events\n break;\n }\n }\n\n engine.imgui->StartNewFrame();\n\n if(ImGui::BeginMainMenuBar())\n {\n if(ImGui::BeginMenu(\"File\"))\n {\n if(ImGui::MenuItem(\"Exit\", \"Ctrl+Q\"))\n {\n running = false;\n }\n ImGui::EndMenu();\n }\n }\n ImGui::EndMainMenuBar();\n\n if(ImGui::Begin(\"Palette\"))\n {\n\n const auto tile_size = 20;\n const auto spacing = 3;\n const auto big_spacing = 10;\n const auto big_offset = 0.20f;\n const auto max_pal_size = tile_size * 5;\n\n if(imgui::CanvasBegin(ImVec4(0.3, 0.3, 0.3, 1.0f), \"palette\"))\n {\n const auto p = ImGui::GetCursorScreenPos();\n const auto size = ImGui::GetContentRegionAvail();\n\n const auto hovering = ImGui::IsAnyItemHovered();\n const auto left_clicked = ImGui::IsMouseClicked(0);\n const auto right_clicked = ImGui::IsMouseClicked(1);\n const auto mouse = ImGui::GetMousePos();\n\n ImDrawList* draw_list = ImGui::GetWindowDrawList();\n\n auto x = 0.0f;\n auto y = 0.0f;\n\n for(int palette_index=0; palette_index<palette.colors.size(); palette_index+=1)\n {\n if(x + tile_size > size.x)\n {\n x = 0;\n y += tile_size + spacing;\n }\n\n const auto min = p + ImVec2(x, y);\n const auto max = min + ImVec2(tile_size, tile_size);\n\n draw_list->AddRectFilled(min, max, C(palette.colors[palette_index]));\n x += tile_size + spacing;\n\n if(!hovering && (left_clicked || right_clicked))\n {\n if(IsOver(min, max, mouse))\n {\n if(left_clicked)\n {\n foreground = palette_index;\n }\n else\n {\n background = palette_index;\n }\n \n }\n }\n }\n\n y += tile_size;\n\n const auto big_size = std::min(size.x, size.y - y) - big_spacing * 2;\n\n if(big_size > 0)\n {\n const auto bsf = std::min<float>(max_pal_size, big_size \/ (1+big_offset));\n const auto bs = ImVec2(bsf, bsf);\n const auto foreground_pos = ImVec2\n (\n size.x\/2 - (bsf * (1+big_offset))\/2,\n y+big_spacing\n );\n\n const auto background_pos = foreground_pos + bs * big_offset;\n draw_list->AddRectFilled(p + background_pos, p + background_pos + bs, C(palette.GetSafeIndex(background)));\n draw_list->AddRectFilled(p + foreground_pos, p + foreground_pos + bs, C(palette.GetSafeIndex(foreground)));\n }\n\n imgui::CanvasEnd();\n }\n }\n ImGui::End();\n\n ImGui::SetNextWindowSize(ImVec2 {300, 300}, ImGuiCond_FirstUseEver);\n if(ImGui::Begin(\"Image\"))\n {\n if(image.IsValid())\n {\n const auto hovering = ImGui::IsAnyItemHovered();\n const auto left_down = ImGui::IsMouseDown(0);\n const auto right_down = ImGui::IsMouseDown(1);\n\n canvas.Begin(cc);\n canvas.ShowGrid(cc);\n\n \/\/ draw image\n ImDrawList* draw_list = ImGui::GetWindowDrawList();\n image.ForAllTopBottom([&](int x, int y, const Rgbai& c)\n {\n const auto pixel_size = 5;\n const auto p = ImVec2(x * pixel_size, y*pixel_size);\n const auto s = ImVec2(pixel_size, pixel_size);\n const auto ps = canvas.WorldToScreen(p);\n const auto pss = canvas.WorldToScreen(p+s);\n const auto m = ImGui::GetMousePos();\n if(ps.x <= m.x && ps.y <= m.y && pss.x >= m.x && pss.y >= m.y)\n {\n \/\/ hovering over pixel\n if(!hovering && left_down)\n {\n image.SetPixel(x, y, palette.colors[foreground]);\n }\n\n \/\/ hovering over pixel\n if(!hovering && right_down)\n {\n image.SetPixel(x, y, palette.colors[background]);\n }\n }\n draw_list->AddRectFilled(ps, pss, C(c));\n });\n\n canvas.ShowRuler(cc);\n canvas.End(cc);\n }\n }\n ImGui::End();\n\n \/\/ ImGui::ShowMetricsWindow();\n\n engine.init->ClearScreen(Color::LightGray);\n engine.imgui->Render();\n\n SDL_GL_SwapWindow(engine.window->window);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"headers\/mainwindow.h\"\n#include \"headers\/cryptogame.h\"\n#include \"headers\/primefactorization.h\"\n#include \"headers\/generateprimes.h\"\n#include \"ui_mainwindow.h\"\n#include \"QPushButton\"\n\n#include \"iostream\" \/\/for debugging\n\nMainWindow::MainWindow(QWidget *parent) :\n QMainWindow(parent),\n ui(new Ui::MainWindow)\n{\n ui->setupUi(this);\n\n}\n\nMainWindow::~MainWindow()\n{\n delete ui;\n}\n\nvoid MainWindow::on_GPUCheckBox_clicked()\n{\n\n}\n\nvoid MainWindow::on_pushButton_clicked()\n{\n std::cout<<\"Start the game.\"<<std::endl;\n\/\/ cryptogame agame = cryptogame();\n\/\/ std::cout<<agame.getEncryptedMessage()<<std::endl;\n\n}\n\nvoid MainWindow::on_factorPrimesButton_clicked()\n{\n\tusing std::cout;\n\tusing std::endl;\n\t\n\tcout<< \"'Factor Primes' button pressed\" <<endl;\n\tmpz_class composite, p, q;\n\tGeneratePrimes gp = GeneratePrimes();\n\tp = gp.readRandomPrime(\"primes.txt\");\n\tq = gp.readRandomPrime(\"primes.txt\");\n\tcomposite = p * q;\n\t\n\tcout << p.get_str(10) << \" * \" << q.get_str(10) << \" = \" << composite.get_str(10) << endl;\n\t\n\tcout << \"Number to factor: \" << composite.get_str(10) << endl;\n\t\n\tPrimeFactorization pf = PrimeFactorization();\n\tpf.bruteForceFactor(composite);\n\t\n\tcout << \"factor 1: \" << pf.p1.get_str(10) << endl;\n\tcout << \"factor 2: \" << pf.p2.get_str(10) << endl;\n}\n<commit_msg>removed comment<commit_after>#include \"headers\/mainwindow.h\"\n#include \"headers\/cryptogame.h\"\n#include \"headers\/primefactorization.h\"\n#include \"headers\/generateprimes.h\"\n#include \"ui_mainwindow.h\"\n#include \"QPushButton\"\n\n#include \"iostream\" \/\/for debugging\n\nMainWindow::MainWindow(QWidget *parent) :\n QMainWindow(parent),\n ui(new Ui::MainWindow)\n{\n ui->setupUi(this);\n\n}\n\nMainWindow::~MainWindow()\n{\n delete ui;\n}\n\nvoid MainWindow::on_GPUCheckBox_clicked()\n{\n\n}\n\nvoid MainWindow::on_pushButton_clicked()\n{\n std::cout<<\"Start the game.\"<<std::endl;\n cryptogame agame = cryptogame();\n std::cout<<agame.getEncryptedMessage()<<std::endl;\n\n}\n\nvoid MainWindow::on_factorPrimesButton_clicked()\n{\n\tusing std::cout;\n\tusing std::endl;\n\t\n\tcout<< \"'Factor Primes' button pressed\" <<endl;\n\tmpz_class composite, p, q;\n\tGeneratePrimes gp = GeneratePrimes();\n\tp = gp.readRandomPrime(\"primes.txt\");\n\tq = gp.readRandomPrime(\"primes.txt\");\n\tcomposite = p * q;\n\t\n\tcout << p.get_str(10) << \" * \" << q.get_str(10) << \" = \" << composite.get_str(10) << endl;\n\t\n\tcout << \"Number to factor: \" << composite.get_str(10) << endl;\n\t\n\tPrimeFactorization pf = PrimeFactorization();\n\tpf.bruteForceFactor(composite);\n\t\n\tcout << \"factor 1: \" << pf.p1.get_str(10) << endl;\n\tcout << \"factor 2: \" << pf.p2.get_str(10) << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/test_extension_system.h\"\n\n#include \"chrome\/browser\/extensions\/api\/alarms\/alarm_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_devtools_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_info_map.h\"\n#include \"chrome\/browser\/extensions\/extension_message_service.h\"\n#include \"chrome\/browser\/extensions\/extension_pref_value_map.h\"\n#include \"chrome\/browser\/extensions\/extension_pref_value_map_factory.h\"\n#include \"chrome\/browser\/extensions\/extension_process_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/state_store.h\"\n#include \"chrome\/browser\/extensions\/user_script_master.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/value_store\/testing_value_store.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nTestExtensionSystem::TestExtensionSystem(Profile* profile)\n : profile_(profile),\n info_map_(new ExtensionInfoMap()) {\n}\n\nTestExtensionSystem::~TestExtensionSystem() {\n}\n\nvoid TestExtensionSystem::Shutdown() {\n extension_process_manager_.reset();\n}\n\nvoid TestExtensionSystem::CreateExtensionProcessManager() {\n extension_process_manager_.reset(ExtensionProcessManager::Create(profile_));\n}\n\nvoid TestExtensionSystem::CreateAlarmManager(\n extensions::AlarmManager::TimeProvider now) {\n alarm_manager_.reset(new extensions::AlarmManager(profile_, now));\n}\n\nExtensionService* TestExtensionSystem::CreateExtensionService(\n const CommandLine* command_line,\n const FilePath& install_directory,\n bool autoupdate_enabled) {\n bool extensions_disabled =\n command_line && command_line->HasSwitch(switches::kDisableExtensions);\n\n \/\/ Note that the GetPrefs() creates a TestingPrefService, therefore\n \/\/ the extension controlled pref values set in extension_prefs_\n \/\/ are not reflected in the pref service. One would need to\n \/\/ inject a new ExtensionPrefStore(extension_pref_value_map, false).\n\n extension_prefs_.reset(new extensions::ExtensionPrefs(\n profile_->GetPrefs(),\n install_directory,\n ExtensionPrefValueMapFactory::GetForProfile(profile_)));\n state_store_.reset(new extensions::StateStore(\n profile_,\n new TestingValueStore()));\n extension_prefs_->Init(extensions_disabled);\n extension_service_.reset(new ExtensionService(profile_,\n command_line,\n install_directory,\n extension_prefs_.get(),\n autoupdate_enabled,\n true));\n return extension_service_.get();\n}\n\nextensions::ManagementPolicy* TestExtensionSystem::CreateManagementPolicy() {\n management_policy_.reset(new extensions::ManagementPolicy());\n DCHECK(extension_prefs_.get());\n management_policy_->RegisterProvider(extension_prefs_.get());\n\n return management_policy();\n}\n\nExtensionService* TestExtensionSystem::extension_service() {\n return extension_service_.get();\n}\n\nextensions::ManagementPolicy* TestExtensionSystem::management_policy() {\n return management_policy_.get();\n}\n\nvoid TestExtensionSystem::SetExtensionService(ExtensionService* service) {\n extension_service_.reset(service);\n}\n\nUserScriptMaster* TestExtensionSystem::user_script_master() {\n return NULL;\n}\n\nExtensionDevToolsManager* TestExtensionSystem::devtools_manager() {\n return NULL;\n}\n\nExtensionProcessManager* TestExtensionSystem::process_manager() {\n return extension_process_manager_.get();\n}\n\nextensions::AlarmManager* TestExtensionSystem::alarm_manager() {\n return alarm_manager_.get();\n}\n\nextensions::StateStore* TestExtensionSystem::state_store() {\n return state_store_.get();\n}\n\nExtensionInfoMap* TestExtensionSystem::info_map() {\n return info_map_.get();\n}\n\nextensions::LazyBackgroundTaskQueue*\nTestExtensionSystem::lazy_background_task_queue() {\n return NULL;\n}\n\nExtensionMessageService* TestExtensionSystem::message_service() {\n return NULL;\n}\n\nExtensionEventRouter* TestExtensionSystem::event_router() {\n return NULL;\n}\n\nextensions::RulesRegistryService*\nTestExtensionSystem::rules_registry_service() {\n return NULL;\n}\n\n\/\/ static\nProfileKeyedService* TestExtensionSystem::Build(Profile* profile) {\n return new TestExtensionSystem(profile);\n}\n<commit_msg>Don't create external extension providers for a TestExtensionSystem.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/test_extension_system.h\"\n\n#include \"chrome\/browser\/extensions\/api\/alarms\/alarm_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_devtools_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_event_router.h\"\n#include \"chrome\/browser\/extensions\/extension_info_map.h\"\n#include \"chrome\/browser\/extensions\/extension_message_service.h\"\n#include \"chrome\/browser\/extensions\/extension_pref_value_map.h\"\n#include \"chrome\/browser\/extensions\/extension_pref_value_map_factory.h\"\n#include \"chrome\/browser\/extensions\/extension_process_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_service.h\"\n#include \"chrome\/browser\/extensions\/extension_system.h\"\n#include \"chrome\/browser\/extensions\/state_store.h\"\n#include \"chrome\/browser\/extensions\/user_script_master.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/value_store\/testing_value_store.h\"\n#include \"chrome\/common\/chrome_switches.h\"\n\n\nTestExtensionSystem::TestExtensionSystem(Profile* profile)\n : profile_(profile),\n info_map_(new ExtensionInfoMap()) {\n}\n\nTestExtensionSystem::~TestExtensionSystem() {\n}\n\nvoid TestExtensionSystem::Shutdown() {\n extension_process_manager_.reset();\n}\n\nvoid TestExtensionSystem::CreateExtensionProcessManager() {\n extension_process_manager_.reset(ExtensionProcessManager::Create(profile_));\n}\n\nvoid TestExtensionSystem::CreateAlarmManager(\n extensions::AlarmManager::TimeProvider now) {\n alarm_manager_.reset(new extensions::AlarmManager(profile_, now));\n}\n\nExtensionService* TestExtensionSystem::CreateExtensionService(\n const CommandLine* command_line,\n const FilePath& install_directory,\n bool autoupdate_enabled) {\n bool extensions_disabled =\n command_line && command_line->HasSwitch(switches::kDisableExtensions);\n\n \/\/ Note that the GetPrefs() creates a TestingPrefService, therefore\n \/\/ the extension controlled pref values set in extension_prefs_\n \/\/ are not reflected in the pref service. One would need to\n \/\/ inject a new ExtensionPrefStore(extension_pref_value_map, false).\n\n extension_prefs_.reset(new extensions::ExtensionPrefs(\n profile_->GetPrefs(),\n install_directory,\n ExtensionPrefValueMapFactory::GetForProfile(profile_)));\n state_store_.reset(new extensions::StateStore(\n profile_,\n new TestingValueStore()));\n extension_prefs_->Init(extensions_disabled);\n extension_service_.reset(new ExtensionService(profile_,\n command_line,\n install_directory,\n extension_prefs_.get(),\n autoupdate_enabled,\n true));\n extension_service_->ClearProvidersForTesting();\n return extension_service_.get();\n}\n\nextensions::ManagementPolicy* TestExtensionSystem::CreateManagementPolicy() {\n management_policy_.reset(new extensions::ManagementPolicy());\n DCHECK(extension_prefs_.get());\n management_policy_->RegisterProvider(extension_prefs_.get());\n\n return management_policy();\n}\n\nExtensionService* TestExtensionSystem::extension_service() {\n return extension_service_.get();\n}\n\nextensions::ManagementPolicy* TestExtensionSystem::management_policy() {\n return management_policy_.get();\n}\n\nvoid TestExtensionSystem::SetExtensionService(ExtensionService* service) {\n extension_service_.reset(service);\n}\n\nUserScriptMaster* TestExtensionSystem::user_script_master() {\n return NULL;\n}\n\nExtensionDevToolsManager* TestExtensionSystem::devtools_manager() {\n return NULL;\n}\n\nExtensionProcessManager* TestExtensionSystem::process_manager() {\n return extension_process_manager_.get();\n}\n\nextensions::AlarmManager* TestExtensionSystem::alarm_manager() {\n return alarm_manager_.get();\n}\n\nextensions::StateStore* TestExtensionSystem::state_store() {\n return state_store_.get();\n}\n\nExtensionInfoMap* TestExtensionSystem::info_map() {\n return info_map_.get();\n}\n\nextensions::LazyBackgroundTaskQueue*\nTestExtensionSystem::lazy_background_task_queue() {\n return NULL;\n}\n\nExtensionMessageService* TestExtensionSystem::message_service() {\n return NULL;\n}\n\nExtensionEventRouter* TestExtensionSystem::event_router() {\n return NULL;\n}\n\nextensions::RulesRegistryService*\nTestExtensionSystem::rules_registry_service() {\n return NULL;\n}\n\n\/\/ static\nProfileKeyedService* TestExtensionSystem::Build(Profile* profile) {\n return new TestExtensionSystem(profile);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/speech\/speech_input_bubble.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/info_bubble.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/tab_contents\/tab_contents_view.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/layout\/layout_constants.h\"\n#include \"views\/view.h\"\n\nnamespace {\n\nconst int kBubbleHorizMargin = 6;\nconst int kBubbleVertMargin = 0;\n\n\/\/ This is the content view which is placed inside a SpeechInputBubble.\nclass ContentView\n : public views::View,\n public views::ButtonListener {\n public:\n explicit ContentView(SpeechInputBubbleDelegate* delegate);\n\n void UpdateLayout(SpeechInputBubbleBase::DisplayMode mode,\n const string16& message_text);\n void SetImage(const SkBitmap& image);\n\n \/\/ views::ButtonListener methods.\n virtual void ButtonPressed(views::Button* source, const views::Event& event);\n\n \/\/ views::View overrides.\n virtual gfx::Size GetPreferredSize();\n virtual void Layout();\n\n private:\n SpeechInputBubbleDelegate* delegate_;\n views::ImageView* icon_;\n views::Label* heading_;\n views::Label* message_;\n views::NativeButton* try_again_;\n views::NativeButton* cancel_;\n\n DISALLOW_COPY_AND_ASSIGN(ContentView);\n};\n\nContentView::ContentView(SpeechInputBubbleDelegate* delegate)\n : delegate_(delegate) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::MediumFont);\n\n heading_ = new views::Label(\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_BUBBLE_HEADING)));\n heading_->SetFont(font);\n heading_->SetHorizontalAlignment(views::Label::ALIGN_CENTER);\n AddChildView(heading_);\n\n message_ = new views::Label();\n message_->SetFont(font);\n message_->SetHorizontalAlignment(views::Label::ALIGN_LEFT);\n message_->SetMultiLine(true);\n AddChildView(message_);\n\n icon_ = new views::ImageView();\n icon_->SetImage(*ResourceBundle::GetSharedInstance().GetBitmapNamed(\n IDR_SPEECH_INPUT_MIC_EMPTY));\n icon_->SetHorizontalAlignment(views::ImageView::CENTER);\n AddChildView(icon_);\n\n cancel_ = new views::NativeButton(\n this,\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_CANCEL)));\n AddChildView(cancel_);\n\n try_again_ = new views::NativeButton(\n this,\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_TRY_AGAIN)));\n AddChildView(try_again_);\n}\n\nvoid ContentView::UpdateLayout(SpeechInputBubbleBase::DisplayMode mode,\n const string16& message_text) {\n bool is_message = (mode == SpeechInputBubbleBase::DISPLAY_MODE_MESSAGE);\n heading_->SetVisible(!is_message);\n icon_->SetVisible(!is_message);\n message_->SetVisible(is_message);\n try_again_->SetVisible(is_message);\n\n if (mode == SpeechInputBubbleBase::DISPLAY_MODE_MESSAGE) {\n message_->SetText(UTF16ToWideHack(message_text));\n } else if (mode == SpeechInputBubbleBase::DISPLAY_MODE_RECORDING) {\n heading_->SetText(UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_BUBBLE_HEADING)));\n icon_->SetImage(*ResourceBundle::GetSharedInstance().GetBitmapNamed(\n IDR_SPEECH_INPUT_MIC_EMPTY));\n } else {\n heading_->SetText(UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_BUBBLE_WORKING)));\n }\n}\n\nvoid ContentView::SetImage(const SkBitmap& image) {\n icon_->SetImage(image);\n}\n\nvoid ContentView::ButtonPressed(views::Button* source,\n const views::Event& event) {\n if (source == cancel_) {\n delegate_->InfoBubbleButtonClicked(SpeechInputBubble::BUTTON_CANCEL);\n } else if (source == try_again_) {\n delegate_->InfoBubbleButtonClicked(SpeechInputBubble::BUTTON_TRY_AGAIN);\n } else {\n NOTREACHED() << \"Unknown button\";\n }\n}\n\ngfx::Size ContentView::GetPreferredSize() {\n int width = heading_->GetPreferredSize().width();\n int control_width = cancel_->GetPreferredSize().width() +\n try_again_->GetPreferredSize().width() +\n views::kRelatedButtonHSpacing;\n if (control_width > width)\n width = control_width;\n control_width = icon_->GetPreferredSize().width();\n if (control_width > width)\n width = control_width;\n\n int height = cancel_->GetPreferredSize().height();\n if (message_->IsVisible()) {\n height += message_->GetHeightForWidth(width) +\n views::kLabelToControlVerticalSpacing;\n } else {\n height += heading_->GetPreferredSize().height() +\n icon_->GetImage().height();\n }\n width += kBubbleHorizMargin * 2;\n height += kBubbleVertMargin * 2;\n\n return gfx::Size(width, height);\n}\n\nvoid ContentView::Layout() {\n int x = kBubbleHorizMargin;\n int y = kBubbleVertMargin;\n int available_width = width() - kBubbleHorizMargin * 2;\n int available_height = height() - kBubbleVertMargin * 2;\n\n if (message_->IsVisible()) {\n DCHECK(try_again_->IsVisible());\n\n int height = try_again_->GetPreferredSize().height();\n int try_again_width = try_again_->GetPreferredSize().width();\n int cancel_width = cancel_->GetPreferredSize().width();\n y += available_height - height;\n x += (available_width - cancel_width - try_again_width -\n views::kRelatedButtonHSpacing) \/ 2;\n try_again_->SetBounds(x, y, try_again_width, height);\n cancel_->SetBounds(x + try_again_width + views::kRelatedButtonHSpacing, y,\n cancel_width, height);\n\n height = message_->GetHeightForWidth(available_width);\n if (height > y - kBubbleVertMargin)\n height = y - kBubbleVertMargin;\n message_->SetBounds(kBubbleHorizMargin, kBubbleVertMargin,\n available_width, height);\n } else {\n DCHECK(heading_->IsVisible());\n DCHECK(icon_->IsVisible());\n\n int height = heading_->GetPreferredSize().height();\n heading_->SetBounds(x, y, available_width, height);\n y += height;\n\n height = icon_->GetImage().height();\n icon_->SetBounds(x, y, available_width, height);\n y += height;\n\n height = cancel_->GetPreferredSize().height();\n int width = cancel_->GetPreferredSize().width();\n cancel_->SetBounds(x + (available_width - width) \/ 2, y, width, height);\n }\n}\n\n\/\/ Implementation of SpeechInputBubble.\nclass SpeechInputBubbleImpl\n : public SpeechInputBubbleBase,\n public InfoBubbleDelegate {\n public:\n SpeechInputBubbleImpl(TabContents* tab_contents,\n Delegate* delegate,\n const gfx::Rect& element_rect);\n virtual ~SpeechInputBubbleImpl();\n\n \/\/ SpeechInputBubble methods.\n virtual void Show();\n virtual void Hide();\n\n \/\/ SpeechInputBubbleBase methods.\n virtual void UpdateLayout();\n virtual void SetImage(const SkBitmap& image);\n\n \/\/ Returns the screen rectangle to use as the info bubble's target.\n \/\/ |element_rect| is the html element's bounds in page coordinates.\n gfx::Rect GetInfoBubbleTarget(const gfx::Rect& element_rect);\n\n \/\/ InfoBubbleDelegate\n virtual void InfoBubbleClosing(InfoBubble* info_bubble,\n bool closed_by_escape);\n virtual bool CloseOnEscape();\n virtual bool FadeInOnShow();\n\n private:\n Delegate* delegate_;\n InfoBubble* info_bubble_;\n ContentView* bubble_content_;\n gfx::Rect element_rect_;\n\n \/\/ Set to true if the object is being destroyed normally instead of the\n \/\/ user clicking outside the window causing it to close automatically.\n bool did_invoke_close_;\n\n DISALLOW_COPY_AND_ASSIGN(SpeechInputBubbleImpl);\n};\n\nSpeechInputBubbleImpl::SpeechInputBubbleImpl(TabContents* tab_contents,\n Delegate* delegate,\n const gfx::Rect& element_rect)\n : SpeechInputBubbleBase(tab_contents),\n delegate_(delegate),\n info_bubble_(NULL),\n bubble_content_(NULL),\n element_rect_(element_rect),\n did_invoke_close_(false) {\n}\n\nSpeechInputBubbleImpl::~SpeechInputBubbleImpl() {\n did_invoke_close_ = true;\n Hide();\n}\n\ngfx::Rect SpeechInputBubbleImpl::GetInfoBubbleTarget(\n const gfx::Rect& element_rect) {\n gfx::Rect container_rect;\n tab_contents()->GetContainerBounds(&container_rect);\n return gfx::Rect(\n container_rect.x() + element_rect.x() + kBubbleTargetOffsetX,\n container_rect.y() + element_rect.y() + element_rect.height(), 1, 1);\n}\n\nvoid SpeechInputBubbleImpl::InfoBubbleClosing(InfoBubble* info_bubble,\n bool closed_by_escape) {\n info_bubble_ = NULL;\n bubble_content_ = NULL;\n if (!did_invoke_close_)\n delegate_->InfoBubbleFocusChanged();\n}\n\nbool SpeechInputBubbleImpl::CloseOnEscape() {\n return false;\n}\n\nbool SpeechInputBubbleImpl::FadeInOnShow() {\n return false;\n}\n\nvoid SpeechInputBubbleImpl::Show() {\n if (info_bubble_)\n return; \/\/ nothing to do, already visible.\n\n bubble_content_ = new ContentView(delegate_);\n UpdateLayout();\n\n views::Widget* tab = views::Widget::GetWidgetFromNativeView(\n tab_contents()->view()->GetNativeView());\n views::Widget* parent = tab ? tab->GetRootWidget() : NULL;\n\n if (parent) {\n info_bubble_ = InfoBubble::Show(parent,\n GetInfoBubbleTarget(element_rect_),\n BubbleBorder::TOP_LEFT, bubble_content_,\n this);\n\n \/\/ We don't want fade outs when closing because it makes speech recognition\n \/\/ appear slower than it is. Also setting it to false allows |Close| to\n \/\/ destroy the bubble immediately instead of waiting for the fade animation\n \/\/ to end so the caller can manage this object's life cycle like a normal\n \/\/ stack based or member variable object.\n info_bubble_->set_fade_away_on_close(false);\n }\n}\n\nvoid SpeechInputBubbleImpl::Hide() {\n if (info_bubble_)\n info_bubble_->Close();\n}\n\nvoid SpeechInputBubbleImpl::UpdateLayout() {\n if (bubble_content_)\n bubble_content_->UpdateLayout(display_mode(), message_text());\n if (info_bubble_) \/\/ Will be null on first call.\n info_bubble_->SizeToContents();\n}\n\nvoid SpeechInputBubbleImpl::SetImage(const SkBitmap& image) {\n if (bubble_content_)\n bubble_content_->SetImage(image);\n}\n\n} \/\/ namespace\n\nSpeechInputBubble* SpeechInputBubble::CreateNativeBubble(\n TabContents* tab_contents,\n SpeechInputBubble::Delegate* delegate,\n const gfx::Rect& element_rect) {\n return new SpeechInputBubbleImpl(tab_contents, delegate, element_rect);\n}\n<commit_msg>Redo the speech bubble layout on windows.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/speech\/speech_input_bubble.h\"\n\n#include \"base\/message_loop.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/info_bubble.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/browser\/tab_contents\/tab_contents_view.h\"\n#include \"grit\/generated_resources.h\"\n#include \"grit\/theme_resources.h\"\n#include \"media\/audio\/audio_manager.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/base\/resource\/resource_bundle.h\"\n#include \"ui\/gfx\/canvas.h\"\n#include \"views\/border.h\"\n#include \"views\/controls\/button\/native_button.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/controls\/link.h\"\n#include \"views\/layout\/layout_constants.h\"\n#include \"views\/view.h\"\n\nnamespace {\n\nconst int kBubbleHorizMargin = 6;\nconst int kBubbleVertMargin = 4;\nconst int kBubbleHeadingVertMargin = 6;\n\n\/\/ This is the content view which is placed inside a SpeechInputBubble.\nclass ContentView\n : public views::View,\n public views::ButtonListener,\n public views::LinkController {\n public:\n explicit ContentView(SpeechInputBubbleDelegate* delegate);\n\n void UpdateLayout(SpeechInputBubbleBase::DisplayMode mode,\n const string16& message_text);\n void SetImage(const SkBitmap& image);\n\n \/\/ views::ButtonListener methods.\n virtual void ButtonPressed(views::Button* source, const views::Event& event);\n\n \/\/ views::LinkController methods.\n virtual void LinkActivated(views::Link* source, int event_flags);\n\n \/\/ views::View overrides.\n virtual gfx::Size GetPreferredSize();\n virtual void Layout();\n\n private:\n SpeechInputBubbleDelegate* delegate_;\n views::ImageView* icon_;\n views::Label* heading_;\n views::Label* message_;\n views::NativeButton* try_again_;\n views::NativeButton* cancel_;\n views::Link* mic_settings_;\n\n DISALLOW_COPY_AND_ASSIGN(ContentView);\n};\n\nContentView::ContentView(SpeechInputBubbleDelegate* delegate)\n : delegate_(delegate) {\n ResourceBundle& rb = ResourceBundle::GetSharedInstance();\n const gfx::Font& font = rb.GetFont(ResourceBundle::MediumFont);\n\n heading_ = new views::Label(\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_BUBBLE_HEADING)));\n heading_->set_border(views::Border::CreateEmptyBorder(\n kBubbleHeadingVertMargin, 0, kBubbleHeadingVertMargin, 0));\n heading_->SetFont(font);\n heading_->SetHorizontalAlignment(views::Label::ALIGN_CENTER);\n heading_->SetText(UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_BUBBLE_HEADING)));\n AddChildView(heading_);\n\n message_ = new views::Label();\n message_->SetFont(font);\n message_->SetHorizontalAlignment(views::Label::ALIGN_CENTER);\n message_->SetMultiLine(true);\n AddChildView(message_);\n\n icon_ = new views::ImageView();\n icon_->SetImage(*ResourceBundle::GetSharedInstance().GetBitmapNamed(\n IDR_SPEECH_INPUT_MIC_EMPTY));\n icon_->SetHorizontalAlignment(views::ImageView::CENTER);\n AddChildView(icon_);\n\n cancel_ = new views::NativeButton(\n this,\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_CANCEL)));\n AddChildView(cancel_);\n\n try_again_ = new views::NativeButton(\n this,\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_TRY_AGAIN)));\n AddChildView(try_again_);\n\n mic_settings_ = new views::Link(\n UTF16ToWide(l10n_util::GetStringUTF16(IDS_SPEECH_INPUT_MIC_SETTINGS)));\n mic_settings_->SetController(this);\n AddChildView(mic_settings_);\n}\n\nvoid ContentView::UpdateLayout(SpeechInputBubbleBase::DisplayMode mode,\n const string16& message_text) {\n bool is_message = (mode == SpeechInputBubbleBase::DISPLAY_MODE_MESSAGE);\n icon_->SetVisible(!is_message);\n message_->SetVisible(is_message);\n mic_settings_->SetVisible(is_message);\n try_again_->SetVisible(is_message);\n heading_->SetVisible(mode == SpeechInputBubbleBase::DISPLAY_MODE_RECORDING);\n\n if (mode == SpeechInputBubbleBase::DISPLAY_MODE_MESSAGE) {\n message_->SetText(UTF16ToWideHack(message_text));\n } else if (mode == SpeechInputBubbleBase::DISPLAY_MODE_RECORDING) {\n icon_->SetImage(*ResourceBundle::GetSharedInstance().GetBitmapNamed(\n IDR_SPEECH_INPUT_MIC_EMPTY));\n }\n\n if (icon_->IsVisible())\n icon_->ResetImageSize();\n}\n\nvoid ContentView::SetImage(const SkBitmap& image) {\n icon_->SetImage(image);\n}\n\nvoid ContentView::ButtonPressed(views::Button* source,\n const views::Event& event) {\n if (source == cancel_) {\n delegate_->InfoBubbleButtonClicked(SpeechInputBubble::BUTTON_CANCEL);\n } else if (source == try_again_) {\n delegate_->InfoBubbleButtonClicked(SpeechInputBubble::BUTTON_TRY_AGAIN);\n } else {\n NOTREACHED() << \"Unknown button\";\n }\n}\n\nvoid ContentView::LinkActivated(views::Link* source, int event_flags) {\n DCHECK_EQ(source, mic_settings_);\n AudioManager::GetAudioManager()->ShowAudioInputSettings();\n}\n\ngfx::Size ContentView::GetPreferredSize() {\n int width = heading_->GetPreferredSize().width();\n int control_width = cancel_->GetPreferredSize().width();\n if (try_again_->IsVisible()) {\n control_width += try_again_->GetPreferredSize().width() +\n views::kRelatedButtonHSpacing;\n }\n if (control_width > width)\n width = control_width;\n control_width = icon_->GetPreferredSize().width();\n if (control_width > width)\n width = control_width;\n if (mic_settings_->IsVisible()) {\n control_width = mic_settings_->GetPreferredSize().width();\n if (control_width > width)\n width = control_width;\n }\n\n int height = cancel_->GetPreferredSize().height();\n if (message_->IsVisible()) {\n height += message_->GetHeightForWidth(width) +\n views::kLabelToControlVerticalSpacing;\n }\n if (heading_->IsVisible())\n height += heading_->GetPreferredSize().height();\n if (icon_->IsVisible())\n height += icon_->GetImage().height();\n if (mic_settings_->IsVisible())\n height += mic_settings_->GetPreferredSize().height();\n width += kBubbleHorizMargin * 2;\n height += kBubbleVertMargin * 2;\n\n return gfx::Size(width, height);\n}\n\nvoid ContentView::Layout() {\n int x = kBubbleHorizMargin;\n int y = kBubbleVertMargin;\n int available_width = width() - kBubbleHorizMargin * 2;\n int available_height = height() - kBubbleVertMargin * 2;\n\n if (message_->IsVisible()) {\n DCHECK(try_again_->IsVisible());\n\n int control_height = try_again_->GetPreferredSize().height();\n int try_again_width = try_again_->GetPreferredSize().width();\n int cancel_width = cancel_->GetPreferredSize().width();\n y += available_height - control_height;\n x += (available_width - cancel_width - try_again_width -\n views::kRelatedButtonHSpacing) \/ 2;\n try_again_->SetBounds(x, y, try_again_width, control_height);\n cancel_->SetBounds(x + try_again_width + views::kRelatedButtonHSpacing, y,\n cancel_width, control_height);\n\n control_height = message_->GetHeightForWidth(available_width);\n message_->SetBounds(kBubbleHorizMargin, kBubbleVertMargin,\n available_width, control_height);\n y = kBubbleVertMargin + control_height;\n\n control_height = mic_settings_->GetPreferredSize().height();\n mic_settings_->SetBounds(kBubbleHorizMargin, y, available_width,\n control_height);\n } else {\n DCHECK(icon_->IsVisible());\n\n int control_height = icon_->GetImage().height();\n icon_->SetBounds(x, y, available_width, control_height);\n y += control_height;\n\n if (heading_->IsVisible()) {\n control_height = heading_->GetPreferredSize().height();\n heading_->SetBounds(x, y, available_width, control_height);\n y += control_height;\n }\n\n control_height = cancel_->GetPreferredSize().height();\n int width = cancel_->GetPreferredSize().width();\n cancel_->SetBounds(x + (available_width - width) \/ 2, y, width,\n control_height);\n }\n}\n\n\/\/ Implementation of SpeechInputBubble.\nclass SpeechInputBubbleImpl\n : public SpeechInputBubbleBase,\n public InfoBubbleDelegate {\n public:\n SpeechInputBubbleImpl(TabContents* tab_contents,\n Delegate* delegate,\n const gfx::Rect& element_rect);\n virtual ~SpeechInputBubbleImpl();\n\n \/\/ SpeechInputBubble methods.\n virtual void Show();\n virtual void Hide();\n\n \/\/ SpeechInputBubbleBase methods.\n virtual void UpdateLayout();\n virtual void SetImage(const SkBitmap& image);\n\n \/\/ Returns the screen rectangle to use as the info bubble's target.\n \/\/ |element_rect| is the html element's bounds in page coordinates.\n gfx::Rect GetInfoBubbleTarget(const gfx::Rect& element_rect);\n\n \/\/ InfoBubbleDelegate\n virtual void InfoBubbleClosing(InfoBubble* info_bubble,\n bool closed_by_escape);\n virtual bool CloseOnEscape();\n virtual bool FadeInOnShow();\n\n private:\n Delegate* delegate_;\n InfoBubble* info_bubble_;\n ContentView* bubble_content_;\n gfx::Rect element_rect_;\n\n \/\/ Set to true if the object is being destroyed normally instead of the\n \/\/ user clicking outside the window causing it to close automatically.\n bool did_invoke_close_;\n\n DISALLOW_COPY_AND_ASSIGN(SpeechInputBubbleImpl);\n};\n\nSpeechInputBubbleImpl::SpeechInputBubbleImpl(TabContents* tab_contents,\n Delegate* delegate,\n const gfx::Rect& element_rect)\n : SpeechInputBubbleBase(tab_contents),\n delegate_(delegate),\n info_bubble_(NULL),\n bubble_content_(NULL),\n element_rect_(element_rect),\n did_invoke_close_(false) {\n}\n\nSpeechInputBubbleImpl::~SpeechInputBubbleImpl() {\n did_invoke_close_ = true;\n Hide();\n}\n\ngfx::Rect SpeechInputBubbleImpl::GetInfoBubbleTarget(\n const gfx::Rect& element_rect) {\n gfx::Rect container_rect;\n tab_contents()->GetContainerBounds(&container_rect);\n return gfx::Rect(\n container_rect.x() + element_rect.x() + element_rect.width() -\n kBubbleTargetOffsetX,\n container_rect.y() + element_rect.y() + element_rect.height(), 1, 1);\n}\n\nvoid SpeechInputBubbleImpl::InfoBubbleClosing(InfoBubble* info_bubble,\n bool closed_by_escape) {\n info_bubble_ = NULL;\n bubble_content_ = NULL;\n if (!did_invoke_close_)\n delegate_->InfoBubbleFocusChanged();\n}\n\nbool SpeechInputBubbleImpl::CloseOnEscape() {\n return false;\n}\n\nbool SpeechInputBubbleImpl::FadeInOnShow() {\n return false;\n}\n\nvoid SpeechInputBubbleImpl::Show() {\n if (info_bubble_)\n return; \/\/ nothing to do, already visible.\n\n bubble_content_ = new ContentView(delegate_);\n UpdateLayout();\n\n views::Widget* tab = views::Widget::GetWidgetFromNativeView(\n tab_contents()->view()->GetNativeView());\n views::Widget* parent = tab ? tab->GetRootWidget() : NULL;\n\n if (parent) {\n info_bubble_ = InfoBubble::Show(parent,\n GetInfoBubbleTarget(element_rect_),\n BubbleBorder::TOP_LEFT, bubble_content_,\n this);\n\n \/\/ We don't want fade outs when closing because it makes speech recognition\n \/\/ appear slower than it is. Also setting it to false allows |Close| to\n \/\/ destroy the bubble immediately instead of waiting for the fade animation\n \/\/ to end so the caller can manage this object's life cycle like a normal\n \/\/ stack based or member variable object.\n info_bubble_->set_fade_away_on_close(false);\n }\n}\n\nvoid SpeechInputBubbleImpl::Hide() {\n if (info_bubble_)\n info_bubble_->Close();\n}\n\nvoid SpeechInputBubbleImpl::UpdateLayout() {\n if (bubble_content_)\n bubble_content_->UpdateLayout(display_mode(), message_text());\n if (info_bubble_) \/\/ Will be null on first call.\n info_bubble_->SizeToContents();\n}\n\nvoid SpeechInputBubbleImpl::SetImage(const SkBitmap& image) {\n if (bubble_content_)\n bubble_content_->SetImage(image);\n}\n\n} \/\/ namespace\n\nSpeechInputBubble* SpeechInputBubble::CreateNativeBubble(\n TabContents* tab_contents,\n SpeechInputBubble::Delegate* delegate,\n const gfx::Rect& element_rect) {\n return new SpeechInputBubbleImpl(tab_contents, delegate, element_rect);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- UseDefaultMemberInitCheck.cpp - clang-tidy------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"UseDefaultMemberInitCheck.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Lex\/Lexer.h\"\n\nusing namespace clang::ast_matchers;\n\nnamespace clang {\nnamespace tidy {\nnamespace modernize {\n\nstatic StringRef getValueOfValueInit(const QualType InitType) {\n switch (InitType->getScalarTypeKind()) {\n case Type::STK_CPointer:\n case Type::STK_BlockPointer:\n case Type::STK_ObjCObjectPointer:\n case Type::STK_MemberPointer:\n return \"nullptr\";\n\n case Type::STK_Bool:\n return \"false\";\n\n case Type::STK_Integral:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::Char_U:\n case BuiltinType::UChar:\n case BuiltinType::Char_S:\n case BuiltinType::SChar:\n return \"'\\\\0'\";\n case BuiltinType::WChar_U:\n case BuiltinType::WChar_S:\n return \"L'\\\\0'\";\n case BuiltinType::Char16:\n return \"u'\\\\0'\";\n case BuiltinType::Char32:\n return \"U'\\\\0'\";\n default:\n return \"0\";\n }\n\n case Type::STK_Floating:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::Half:\n case BuiltinType::Float:\n return \"0.0f\";\n default:\n return \"0.0\";\n }\n\n case Type::STK_FloatingComplex:\n case Type::STK_IntegralComplex:\n return getValueOfValueInit(\n InitType->getAs<ComplexType>()->getElementType());\n case Type::STK_FixedPoint:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::ShortAccum:\n case BuiltinType::SatShortAccum:\n return \"0.0hk\";\n case BuiltinType::Accum:\n case BuiltinType::SatAccum:\n return \"0.0k\";\n case BuiltinType::LongAccum:\n case BuiltinType::SatLongAccum:\n return \"0.0lk\";\n case BuiltinType::UShortAccum:\n case BuiltinType::SatUShortAccum:\n return \"0.0uhk\";\n case BuiltinType::UAccum:\n case BuiltinType::SatUAccum:\n return \"0.0uk\";\n case BuiltinType::ULongAccum:\n case BuiltinType::SatULongAccum:\n return \"0.0ulk\";\n case BuiltinType::ShortFract:\n case BuiltinType::SatShortFract:\n return \"0.0hr\";\n case BuiltinType::Fract:\n case BuiltinType::SatFract:\n return \"0.0r\";\n case BuiltinType::LongFract:\n case BuiltinType::SatLongFract:\n return \"0.0lr\";\n case BuiltinType::UShortFract:\n case BuiltinType::SatUShortFract:\n return \"0.0uhr\";\n case BuiltinType::UFract:\n case BuiltinType::SatUFract:\n return \"0.0ur\";\n case BuiltinType::ULongFract:\n case BuiltinType::SatULongFract:\n return \"0.0ulr\";\n default:\n llvm_unreachable(\"Unhandled fixed point BuiltinType\");\n }\n }\n llvm_unreachable(\"Invalid scalar type kind\");\n}\n\nstatic bool isZero(const Expr *E) {\n switch (E->getStmtClass()) {\n case Stmt::CXXNullPtrLiteralExprClass:\n case Stmt::ImplicitValueInitExprClass:\n return true;\n case Stmt::InitListExprClass:\n return cast<InitListExpr>(E)->getNumInits() == 0;\n case Stmt::CharacterLiteralClass:\n return !cast<CharacterLiteral>(E)->getValue();\n case Stmt::CXXBoolLiteralExprClass:\n return !cast<CXXBoolLiteralExpr>(E)->getValue();\n case Stmt::IntegerLiteralClass:\n return !cast<IntegerLiteral>(E)->getValue();\n case Stmt::FloatingLiteralClass: {\n llvm::APFloat Value = cast<FloatingLiteral>(E)->getValue();\n return Value.isZero() && !Value.isNegative();\n }\n default:\n return false;\n }\n}\n\nstatic const Expr *ignoreUnaryPlus(const Expr *E) {\n auto *UnaryOp = dyn_cast<UnaryOperator>(E);\n if (UnaryOp && UnaryOp->getOpcode() == UO_Plus)\n return UnaryOp->getSubExpr();\n return E;\n}\n\nstatic const Expr *getInitializer(const Expr *E) {\n auto *InitList = dyn_cast<InitListExpr>(E);\n if (InitList && InitList->getNumInits() == 1)\n return InitList->getInit(0);\n return E;\n}\n\nstatic bool sameValue(const Expr *E1, const Expr *E2) {\n E1 = ignoreUnaryPlus(getInitializer(E1->IgnoreParenImpCasts()));\n E2 = ignoreUnaryPlus(getInitializer(E2->IgnoreParenImpCasts()));\n\n if (isZero(E1) && isZero(E2))\n return true;\n\n if (E1->getStmtClass() != E2->getStmtClass())\n return false;\n\n switch (E1->getStmtClass()) {\n case Stmt::UnaryOperatorClass:\n return sameValue(cast<UnaryOperator>(E1)->getSubExpr(),\n cast<UnaryOperator>(E2)->getSubExpr());\n case Stmt::CharacterLiteralClass:\n return cast<CharacterLiteral>(E1)->getValue() ==\n cast<CharacterLiteral>(E2)->getValue();\n case Stmt::CXXBoolLiteralExprClass:\n return cast<CXXBoolLiteralExpr>(E1)->getValue() ==\n cast<CXXBoolLiteralExpr>(E2)->getValue();\n case Stmt::IntegerLiteralClass:\n return cast<IntegerLiteral>(E1)->getValue() ==\n cast<IntegerLiteral>(E2)->getValue();\n case Stmt::FloatingLiteralClass:\n return cast<FloatingLiteral>(E1)->getValue().bitwiseIsEqual(\n cast<FloatingLiteral>(E2)->getValue());\n case Stmt::StringLiteralClass:\n return cast<StringLiteral>(E1)->getString() ==\n cast<StringLiteral>(E2)->getString();\n case Stmt::DeclRefExprClass:\n return cast<DeclRefExpr>(E1)->getDecl() == cast<DeclRefExpr>(E2)->getDecl();\n default:\n return false;\n }\n}\n\nUseDefaultMemberInitCheck::UseDefaultMemberInitCheck(StringRef Name,\n ClangTidyContext *Context)\n : ClangTidyCheck(Name, Context),\n UseAssignment(Options.get(\"UseAssignment\", 0) != 0),\n IgnoreMacros(Options.getLocalOrGlobal(\"IgnoreMacros\", true) != 0) {}\n\nvoid UseDefaultMemberInitCheck::storeOptions(\n ClangTidyOptions::OptionMap &Opts) {\n Options.store(Opts, \"UseAssignment\", UseAssignment);\n Options.store(Opts, \"IgnoreMacros\", IgnoreMacros);\n}\n\nvoid UseDefaultMemberInitCheck::registerMatchers(MatchFinder *Finder) {\n if (!getLangOpts().CPlusPlus11)\n return;\n\n auto Init =\n anyOf(stringLiteral(), characterLiteral(), integerLiteral(),\n unaryOperator(anyOf(hasOperatorName(\"+\"), hasOperatorName(\"-\")),\n hasUnaryOperand(integerLiteral())),\n floatLiteral(),\n unaryOperator(anyOf(hasOperatorName(\"+\"), hasOperatorName(\"-\")),\n hasUnaryOperand(floatLiteral())),\n cxxBoolLiteral(), cxxNullPtrLiteralExpr(), implicitValueInitExpr(),\n declRefExpr(to(enumConstantDecl())));\n\n Finder->addMatcher(\n cxxConstructorDecl(\n isDefaultConstructor(), unless(isInstantiated()),\n forEachConstructorInitializer(\n cxxCtorInitializer(\n forField(unless(anyOf(getLangOpts().CPlusPlus2a\n ? unless(anything())\n : isBitField(),\n hasInClassInitializer(anything()),\n hasParent(recordDecl(isUnion()))))),\n isWritten(), withInitializer(ignoringImplicit(Init)))\n .bind(\"default\"))),\n this);\n\n Finder->addMatcher(\n cxxConstructorDecl(\n unless(ast_matchers::isTemplateInstantiation()),\n forEachConstructorInitializer(\n cxxCtorInitializer(forField(hasInClassInitializer(anything())),\n isWritten(),\n withInitializer(ignoringImplicit(Init)))\n .bind(\"existing\"))),\n this);\n}\n\nvoid UseDefaultMemberInitCheck::check(const MatchFinder::MatchResult &Result) {\n if (const auto *Default =\n Result.Nodes.getNodeAs<CXXCtorInitializer>(\"default\"))\n checkDefaultInit(Result, Default);\n else if (const auto *Existing =\n Result.Nodes.getNodeAs<CXXCtorInitializer>(\"existing\"))\n checkExistingInit(Result, Existing);\n else\n llvm_unreachable(\"Bad Callback. No node provided.\");\n}\n\nvoid UseDefaultMemberInitCheck::checkDefaultInit(\n const MatchFinder::MatchResult &Result, const CXXCtorInitializer *Init) {\n const FieldDecl *Field = Init->getAnyMember();\n\n SourceLocation StartLoc = Field->getBeginLoc();\n if (StartLoc.isMacroID() && IgnoreMacros)\n return;\n\n SourceLocation FieldEnd =\n Lexer::getLocForEndOfToken(Field->getSourceRange().getEnd(), 0,\n *Result.SourceManager, getLangOpts());\n SourceLocation LParenEnd = Lexer::getLocForEndOfToken(\n Init->getLParenLoc(), 0, *Result.SourceManager, getLangOpts());\n CharSourceRange InitRange =\n CharSourceRange::getCharRange(LParenEnd, Init->getRParenLoc());\n\n auto Diag =\n diag(Field->getLocation(), \"use default member initializer for %0\")\n << Field\n << FixItHint::CreateInsertion(FieldEnd, UseAssignment ? \" = \" : \"{\")\n << FixItHint::CreateInsertionFromRange(FieldEnd, InitRange);\n\n if (UseAssignment && isa<ImplicitValueInitExpr>(Init->getInit()))\n Diag << FixItHint::CreateInsertion(\n FieldEnd, getValueOfValueInit(Init->getInit()->getType()));\n\n if (!UseAssignment)\n Diag << FixItHint::CreateInsertion(FieldEnd, \"}\");\n\n Diag << FixItHint::CreateRemoval(Init->getSourceRange());\n}\n\nvoid UseDefaultMemberInitCheck::checkExistingInit(\n const MatchFinder::MatchResult &Result, const CXXCtorInitializer *Init) {\n const FieldDecl *Field = Init->getMember();\n\n if (!sameValue(Field->getInClassInitializer(), Init->getInit()))\n return;\n\n diag(Init->getSourceLocation(), \"member initializer for %0 is redundant\")\n << Field\n << FixItHint::CreateRemoval(Init->getSourceRange());\n}\n\n} \/\/ namespace modernize\n} \/\/ namespace tidy\n} \/\/ namespace clang\n<commit_msg>[Fixed Point Arithmetic] Fix for clang-tools-extra warning<commit_after>\/\/===--- UseDefaultMemberInitCheck.cpp - clang-tidy------------------------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"UseDefaultMemberInitCheck.h\"\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/ASTMatchers\/ASTMatchFinder.h\"\n#include \"clang\/Lex\/Lexer.h\"\n\nusing namespace clang::ast_matchers;\n\nnamespace clang {\nnamespace tidy {\nnamespace modernize {\n\nstatic StringRef getValueOfValueInit(const QualType InitType) {\n switch (InitType->getScalarTypeKind()) {\n case Type::STK_CPointer:\n case Type::STK_BlockPointer:\n case Type::STK_ObjCObjectPointer:\n case Type::STK_MemberPointer:\n return \"nullptr\";\n\n case Type::STK_Bool:\n return \"false\";\n\n case Type::STK_Integral:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::Char_U:\n case BuiltinType::UChar:\n case BuiltinType::Char_S:\n case BuiltinType::SChar:\n return \"'\\\\0'\";\n case BuiltinType::WChar_U:\n case BuiltinType::WChar_S:\n return \"L'\\\\0'\";\n case BuiltinType::Char16:\n return \"u'\\\\0'\";\n case BuiltinType::Char32:\n return \"U'\\\\0'\";\n default:\n return \"0\";\n }\n\n case Type::STK_Floating:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::Half:\n case BuiltinType::Float:\n return \"0.0f\";\n default:\n return \"0.0\";\n }\n\n case Type::STK_FloatingComplex:\n case Type::STK_IntegralComplex:\n return getValueOfValueInit(\n InitType->getAs<ComplexType>()->getElementType());\n\n case Type::STK_FixedPoint:\n switch (InitType->getAs<BuiltinType>()->getKind()) {\n case BuiltinType::ShortAccum:\n case BuiltinType::SatShortAccum:\n return \"0.0hk\";\n case BuiltinType::Accum:\n case BuiltinType::SatAccum:\n return \"0.0k\";\n case BuiltinType::LongAccum:\n case BuiltinType::SatLongAccum:\n return \"0.0lk\";\n case BuiltinType::UShortAccum:\n case BuiltinType::SatUShortAccum:\n return \"0.0uhk\";\n case BuiltinType::UAccum:\n case BuiltinType::SatUAccum:\n return \"0.0uk\";\n case BuiltinType::ULongAccum:\n case BuiltinType::SatULongAccum:\n return \"0.0ulk\";\n case BuiltinType::ShortFract:\n case BuiltinType::SatShortFract:\n return \"0.0hr\";\n case BuiltinType::Fract:\n case BuiltinType::SatFract:\n return \"0.0r\";\n case BuiltinType::LongFract:\n case BuiltinType::SatLongFract:\n return \"0.0lr\";\n case BuiltinType::UShortFract:\n case BuiltinType::SatUShortFract:\n return \"0.0uhr\";\n case BuiltinType::UFract:\n case BuiltinType::SatUFract:\n return \"0.0ur\";\n case BuiltinType::ULongFract:\n case BuiltinType::SatULongFract:\n return \"0.0ulr\";\n default:\n llvm_unreachable(\"Unhandled fixed point BuiltinType\");\n }\n }\n llvm_unreachable(\"Invalid scalar type kind\");\n}\n\nstatic bool isZero(const Expr *E) {\n switch (E->getStmtClass()) {\n case Stmt::CXXNullPtrLiteralExprClass:\n case Stmt::ImplicitValueInitExprClass:\n return true;\n case Stmt::InitListExprClass:\n return cast<InitListExpr>(E)->getNumInits() == 0;\n case Stmt::CharacterLiteralClass:\n return !cast<CharacterLiteral>(E)->getValue();\n case Stmt::CXXBoolLiteralExprClass:\n return !cast<CXXBoolLiteralExpr>(E)->getValue();\n case Stmt::IntegerLiteralClass:\n return !cast<IntegerLiteral>(E)->getValue();\n case Stmt::FloatingLiteralClass: {\n llvm::APFloat Value = cast<FloatingLiteral>(E)->getValue();\n return Value.isZero() && !Value.isNegative();\n }\n default:\n return false;\n }\n}\n\nstatic const Expr *ignoreUnaryPlus(const Expr *E) {\n auto *UnaryOp = dyn_cast<UnaryOperator>(E);\n if (UnaryOp && UnaryOp->getOpcode() == UO_Plus)\n return UnaryOp->getSubExpr();\n return E;\n}\n\nstatic const Expr *getInitializer(const Expr *E) {\n auto *InitList = dyn_cast<InitListExpr>(E);\n if (InitList && InitList->getNumInits() == 1)\n return InitList->getInit(0);\n return E;\n}\n\nstatic bool sameValue(const Expr *E1, const Expr *E2) {\n E1 = ignoreUnaryPlus(getInitializer(E1->IgnoreParenImpCasts()));\n E2 = ignoreUnaryPlus(getInitializer(E2->IgnoreParenImpCasts()));\n\n if (isZero(E1) && isZero(E2))\n return true;\n\n if (E1->getStmtClass() != E2->getStmtClass())\n return false;\n\n switch (E1->getStmtClass()) {\n case Stmt::UnaryOperatorClass:\n return sameValue(cast<UnaryOperator>(E1)->getSubExpr(),\n cast<UnaryOperator>(E2)->getSubExpr());\n case Stmt::CharacterLiteralClass:\n return cast<CharacterLiteral>(E1)->getValue() ==\n cast<CharacterLiteral>(E2)->getValue();\n case Stmt::CXXBoolLiteralExprClass:\n return cast<CXXBoolLiteralExpr>(E1)->getValue() ==\n cast<CXXBoolLiteralExpr>(E2)->getValue();\n case Stmt::IntegerLiteralClass:\n return cast<IntegerLiteral>(E1)->getValue() ==\n cast<IntegerLiteral>(E2)->getValue();\n case Stmt::FloatingLiteralClass:\n return cast<FloatingLiteral>(E1)->getValue().bitwiseIsEqual(\n cast<FloatingLiteral>(E2)->getValue());\n case Stmt::StringLiteralClass:\n return cast<StringLiteral>(E1)->getString() ==\n cast<StringLiteral>(E2)->getString();\n case Stmt::DeclRefExprClass:\n return cast<DeclRefExpr>(E1)->getDecl() == cast<DeclRefExpr>(E2)->getDecl();\n default:\n return false;\n }\n}\n\nUseDefaultMemberInitCheck::UseDefaultMemberInitCheck(StringRef Name,\n ClangTidyContext *Context)\n : ClangTidyCheck(Name, Context),\n UseAssignment(Options.get(\"UseAssignment\", 0) != 0),\n IgnoreMacros(Options.getLocalOrGlobal(\"IgnoreMacros\", true) != 0) {}\n\nvoid UseDefaultMemberInitCheck::storeOptions(\n ClangTidyOptions::OptionMap &Opts) {\n Options.store(Opts, \"UseAssignment\", UseAssignment);\n Options.store(Opts, \"IgnoreMacros\", IgnoreMacros);\n}\n\nvoid UseDefaultMemberInitCheck::registerMatchers(MatchFinder *Finder) {\n if (!getLangOpts().CPlusPlus11)\n return;\n\n auto Init =\n anyOf(stringLiteral(), characterLiteral(), integerLiteral(),\n unaryOperator(anyOf(hasOperatorName(\"+\"), hasOperatorName(\"-\")),\n hasUnaryOperand(integerLiteral())),\n floatLiteral(),\n unaryOperator(anyOf(hasOperatorName(\"+\"), hasOperatorName(\"-\")),\n hasUnaryOperand(floatLiteral())),\n cxxBoolLiteral(), cxxNullPtrLiteralExpr(), implicitValueInitExpr(),\n declRefExpr(to(enumConstantDecl())));\n\n Finder->addMatcher(\n cxxConstructorDecl(\n isDefaultConstructor(), unless(isInstantiated()),\n forEachConstructorInitializer(\n cxxCtorInitializer(\n forField(unless(anyOf(getLangOpts().CPlusPlus2a\n ? unless(anything())\n : isBitField(),\n hasInClassInitializer(anything()),\n hasParent(recordDecl(isUnion()))))),\n isWritten(), withInitializer(ignoringImplicit(Init)))\n .bind(\"default\"))),\n this);\n\n Finder->addMatcher(\n cxxConstructorDecl(\n unless(ast_matchers::isTemplateInstantiation()),\n forEachConstructorInitializer(\n cxxCtorInitializer(forField(hasInClassInitializer(anything())),\n isWritten(),\n withInitializer(ignoringImplicit(Init)))\n .bind(\"existing\"))),\n this);\n}\n\nvoid UseDefaultMemberInitCheck::check(const MatchFinder::MatchResult &Result) {\n if (const auto *Default =\n Result.Nodes.getNodeAs<CXXCtorInitializer>(\"default\"))\n checkDefaultInit(Result, Default);\n else if (const auto *Existing =\n Result.Nodes.getNodeAs<CXXCtorInitializer>(\"existing\"))\n checkExistingInit(Result, Existing);\n else\n llvm_unreachable(\"Bad Callback. No node provided.\");\n}\n\nvoid UseDefaultMemberInitCheck::checkDefaultInit(\n const MatchFinder::MatchResult &Result, const CXXCtorInitializer *Init) {\n const FieldDecl *Field = Init->getAnyMember();\n\n SourceLocation StartLoc = Field->getBeginLoc();\n if (StartLoc.isMacroID() && IgnoreMacros)\n return;\n\n SourceLocation FieldEnd =\n Lexer::getLocForEndOfToken(Field->getSourceRange().getEnd(), 0,\n *Result.SourceManager, getLangOpts());\n SourceLocation LParenEnd = Lexer::getLocForEndOfToken(\n Init->getLParenLoc(), 0, *Result.SourceManager, getLangOpts());\n CharSourceRange InitRange =\n CharSourceRange::getCharRange(LParenEnd, Init->getRParenLoc());\n\n auto Diag =\n diag(Field->getLocation(), \"use default member initializer for %0\")\n << Field\n << FixItHint::CreateInsertion(FieldEnd, UseAssignment ? \" = \" : \"{\")\n << FixItHint::CreateInsertionFromRange(FieldEnd, InitRange);\n\n if (UseAssignment && isa<ImplicitValueInitExpr>(Init->getInit()))\n Diag << FixItHint::CreateInsertion(\n FieldEnd, getValueOfValueInit(Init->getInit()->getType()));\n\n if (!UseAssignment)\n Diag << FixItHint::CreateInsertion(FieldEnd, \"}\");\n\n Diag << FixItHint::CreateRemoval(Init->getSourceRange());\n}\n\nvoid UseDefaultMemberInitCheck::checkExistingInit(\n const MatchFinder::MatchResult &Result, const CXXCtorInitializer *Init) {\n const FieldDecl *Field = Init->getMember();\n\n if (!sameValue(Field->getInClassInitializer(), Init->getInit()))\n return;\n\n diag(Init->getSourceLocation(), \"member initializer for %0 is redundant\")\n << Field\n << FixItHint::CreateRemoval(Init->getSourceRange());\n}\n\n} \/\/ namespace modernize\n} \/\/ namespace tidy\n} \/\/ namespace clang\n<|endoftext|>"} {"text":"<commit_before>#ifndef GENERIC_CIFY_HPP\n# define GENERIC_CIFY_HPP\n# pragma once\n\n#include <utility>\n\nnamespace generic\n{\n\nnamespace\n{\n\ntemplate <typename R, typename ...A> using return_type = R (*)(A...);\n\n}\n\ntemplate <typename F, typename R, typename ...A>\nreturn_type<R, A...> cify(R (*)(A...), F&& f)\n{\n static F const f_(::std::forward<F>(f));\n\n struct S\n {\n static R f(A... args)\n {\n f_(::std::forward<A>(args)...);\n }\n };\n\n return &S::f;\n}\n\n}\n\n#endif \/\/ GENERIC_CIFY_HPP\n<commit_msg>some fixes<commit_after>#ifndef GENERIC_CIFY_HPP\n# define GENERIC_CIFY_HPP\n# pragma once\n\n#include <utility>\n\nnamespace generic\n{\n\nnamespace\n{\n\ntemplate <typename R, typename ...A> using return_type = R (*)(A...);\n\n}\n\ntemplate <typename F, int I = 0, typename R, typename ...A>\nreturn_type<R, A...> cify(R (*)(A...), F&& f)\n{\n static F const f_(::std::forward<F>(f));\n\n struct S\n {\n static R f(A... args)\n {\n f_(::std::forward<A>(args)...);\n }\n };\n\n return &S::f;\n}\n\n}\n\n#endif \/\/ GENERIC_CIFY_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2018 Google LLC\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"database\/src\/desktop\/core\/operation.h\"\n\n#include <iostream>\n\n#include \"app\/src\/assert.h\"\n#include \"app\/src\/path.h\"\n#include \"database\/src\/desktop\/util_desktop.h\"\n\nnamespace firebase {\nnamespace database {\nnamespace internal {\n\nconst OperationSource OperationSource::kUser(OperationSource::kSourceUser,\n Optional<QueryParams>());\nconst OperationSource OperationSource::kServer(OperationSource::kSourceServer,\n Optional<QueryParams>());\n\nOperation Operation::Overwrite(const OperationSource& source, const Path& path,\n const Variant& snapshot) {\n return Operation(Operation::kTypeOverwrite, source, path, snapshot,\n CompoundWrite(), Tree<bool>(), kAckConfirm);\n}\n\nOperation Operation::Merge(const OperationSource& source, const Path& path,\n const CompoundWrite& children) {\n return Operation(Operation::kTypeMerge, source, path, Variant(), children,\n Tree<bool>(), kAckConfirm);\n}\n\nOperation Operation::AckUserWrite(const Path& path,\n const Tree<bool>& affected_tree,\n AckStatus status) {\n return Operation(Operation::kTypeAckUserWrite, OperationSource::kUser, path,\n Variant(), CompoundWrite(), affected_tree, status);\n}\n\nOperation Operation::ListenComplete(const OperationSource& source,\n const Path& path) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n source.source != OperationSource::kSourceUser,\n \"Can't have a listen complete from a user source\");\n return Operation(Operation::kTypeListenComplete, source, path, Variant(),\n CompoundWrite(), Tree<bool>(), kAckConfirm);\n}\n\nstatic Optional<Operation> OperationForChildOverwrite(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n return Optional<Operation>(Operation::Overwrite(\n op.source, Path(), VariantGetChild(&op.snapshot, child_key)));\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n Path child_path(std::next(directories.begin()), directories.end());\n return Optional<Operation>(\n Operation::Overwrite(op.source, child_path, op.snapshot));\n }\n}\n\nstatic Optional<Operation> OperationForChildMerge(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n CompoundWrite child_tree = op.children.ChildCompoundWrite(Path(child_key));\n if (child_tree.IsEmpty()) {\n \/\/ This child is unaffected.\n return Optional<Operation>();\n } else if (child_tree.GetRootWrite().has_value()) {\n return Optional<Operation>(\n Operation::Overwrite(op.source, Path(), *child_tree.GetRootWrite()));\n } else {\n return Optional<Operation>(\n Operation::Merge(op.source, Path(), child_tree));\n }\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n if (directories.front() == child_key) {\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(Operation::Merge(\n op.source, Path(std::next(start), finish), op.children));\n } else {\n \/\/ Merge doesn't affect operation path.\n return Optional<Operation>();\n }\n }\n}\n\nstatic Optional<Operation> OperationForChildAckUserWrite(\n const Operation& op, const std::string& child_key) {\n if (!op.path.empty()) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n op.path.GetDirectories().front() == child_key,\n \"OperationForChild called for unrelated child.\");\n std::vector<std::string> directories = op.path.GetDirectories();\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(Operation::AckUserWrite(\n Path(std::next(start), finish), op.affected_tree,\n op.revert ? kAckRevert : kAckConfirm));\n } else if (op.affected_tree.value().has_value()) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n op.affected_tree.children().empty(),\n \"AffectedTree should not have overlapping affected paths.\");\n \/\/ All child locations are affected as well; just return same operation.\n return Optional<Operation>(op);\n } else {\n const Tree<bool>* child_tree = op.affected_tree.GetChild(child_key);\n return Optional<Operation>(Operation::AckUserWrite(\n Path(), *child_tree, op.revert ? kAckRevert : kAckConfirm));\n }\n}\n\nstatic Optional<Operation> OperationForChildListenComplete(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n return Optional<Operation>(Operation::ListenComplete(op.source, Path()));\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(\n Operation::ListenComplete(op.source, Path(std::next(start), finish)));\n }\n}\n\nOptional<Operation> OperationForChild(const Operation& op,\n const std::string& child_key) {\n switch (op.type) {\n case Operation::kTypeOverwrite: {\n return OperationForChildOverwrite(op, child_key);\n }\n case Operation::kTypeMerge: {\n return OperationForChildMerge(op, child_key);\n }\n case Operation::kTypeAckUserWrite: {\n return OperationForChildAckUserWrite(op, child_key);\n }\n case Operation::kTypeListenComplete: {\n return OperationForChildListenComplete(op, child_key);\n }\n }\n}\n\n} \/\/ namespace internal\n} \/\/ namespace database\n} \/\/ namespace firebase\n<commit_msg>Fixed a potential null deref and added a unit test to catch that edge case.<commit_after>\/\/ Copyright 2018 Google LLC\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"database\/src\/desktop\/core\/operation.h\"\n\n#include <iostream>\n\n#include \"app\/src\/assert.h\"\n#include \"app\/src\/path.h\"\n#include \"database\/src\/desktop\/util_desktop.h\"\n\nnamespace firebase {\nnamespace database {\nnamespace internal {\n\nconst OperationSource OperationSource::kUser(OperationSource::kSourceUser,\n Optional<QueryParams>());\nconst OperationSource OperationSource::kServer(OperationSource::kSourceServer,\n Optional<QueryParams>());\n\nOperation Operation::Overwrite(const OperationSource& source, const Path& path,\n const Variant& snapshot) {\n return Operation(Operation::kTypeOverwrite, source, path, snapshot,\n CompoundWrite(), Tree<bool>(), kAckConfirm);\n}\n\nOperation Operation::Merge(const OperationSource& source, const Path& path,\n const CompoundWrite& children) {\n return Operation(Operation::kTypeMerge, source, path, Variant(), children,\n Tree<bool>(), kAckConfirm);\n}\n\nOperation Operation::AckUserWrite(const Path& path,\n const Tree<bool>& affected_tree,\n AckStatus status) {\n return Operation(Operation::kTypeAckUserWrite, OperationSource::kUser, path,\n Variant(), CompoundWrite(), affected_tree, status);\n}\n\nOperation Operation::ListenComplete(const OperationSource& source,\n const Path& path) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n source.source != OperationSource::kSourceUser,\n \"Can't have a listen complete from a user source\");\n return Operation(Operation::kTypeListenComplete, source, path, Variant(),\n CompoundWrite(), Tree<bool>(), kAckConfirm);\n}\n\nstatic Optional<Operation> OperationForChildOverwrite(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n return Optional<Operation>(Operation::Overwrite(\n op.source, Path(), VariantGetChild(&op.snapshot, child_key)));\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n Path child_path(std::next(directories.begin()), directories.end());\n return Optional<Operation>(\n Operation::Overwrite(op.source, child_path, op.snapshot));\n }\n}\n\nstatic Optional<Operation> OperationForChildMerge(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n CompoundWrite child_tree = op.children.ChildCompoundWrite(Path(child_key));\n if (child_tree.IsEmpty()) {\n \/\/ This child is unaffected.\n return Optional<Operation>();\n } else if (child_tree.GetRootWrite().has_value()) {\n return Optional<Operation>(\n Operation::Overwrite(op.source, Path(), *child_tree.GetRootWrite()));\n } else {\n return Optional<Operation>(\n Operation::Merge(op.source, Path(), child_tree));\n }\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n if (directories.front() == child_key) {\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(Operation::Merge(\n op.source, Path(std::next(start), finish), op.children));\n } else {\n \/\/ Merge doesn't affect operation path.\n return Optional<Operation>();\n }\n }\n}\n\nstatic Optional<Operation> OperationForChildAckUserWrite(\n const Operation& op, const std::string& child_key) {\n if (!op.path.empty()) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n op.path.GetDirectories().front() == child_key,\n \"OperationForChild called for unrelated child.\");\n std::vector<std::string> directories = op.path.GetDirectories();\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(Operation::AckUserWrite(\n Path(std::next(start), finish), op.affected_tree,\n op.revert ? kAckRevert : kAckConfirm));\n } else if (op.affected_tree.value().has_value()) {\n FIREBASE_DEV_ASSERT_MESSAGE(\n op.affected_tree.children().empty(),\n \"AffectedTree should not have overlapping affected paths.\");\n \/\/ All child locations are affected as well; just return same operation.\n return Optional<Operation>(op);\n } else {\n const Tree<bool>* child_tree = op.affected_tree.GetChild(child_key);\n return Optional<Operation>(\n Operation::AckUserWrite(Path(), child_tree ? *child_tree : Tree<bool>(),\n op.revert ? kAckRevert : kAckConfirm));\n }\n}\n\nstatic Optional<Operation> OperationForChildListenComplete(\n const Operation& op, const std::string& child_key) {\n if (op.path.empty()) {\n return Optional<Operation>(Operation::ListenComplete(op.source, Path()));\n } else {\n std::vector<std::string> directories = op.path.GetDirectories();\n auto start = directories.begin();\n auto finish = directories.end();\n return Optional<Operation>(\n Operation::ListenComplete(op.source, Path(std::next(start), finish)));\n }\n}\n\nOptional<Operation> OperationForChild(const Operation& op,\n const std::string& child_key) {\n switch (op.type) {\n case Operation::kTypeOverwrite: {\n return OperationForChildOverwrite(op, child_key);\n }\n case Operation::kTypeMerge: {\n return OperationForChildMerge(op, child_key);\n }\n case Operation::kTypeAckUserWrite: {\n return OperationForChildAckUserWrite(op, child_key);\n }\n case Operation::kTypeListenComplete: {\n return OperationForChildListenComplete(op, child_key);\n }\n }\n}\n\n} \/\/ namespace internal\n} \/\/ namespace database\n} \/\/ namespace firebase\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: brwview.cxx,v $\n *\n * $Revision: 1.27 $\n *\n * last change: $Author: rt $ $Date: 2007-07-06 08:02:57 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n\n#ifndef _SBA_BWRCTRLR_HXX\n#include \"brwctrlr.hxx\"\n#endif\n#ifndef _SBX_BRWVIEW_HXX\n#include \"brwview.hxx\"\n#endif\n#ifndef _SBA_GRID_HXX\n#include \"sbagrid.hxx\"\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n#ifndef DBACCESS_UI_DBTREEVIEW_HXX\n#include \"dbtreeview.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _DBU_BRW_HRC_\n#include \"dbu_brw.hrc\"\n#endif\n#ifndef _COM_SUN_STAR_FORM_XLOADABLE_HPP_\n#include <com\/sun\/star\/form\/XLoadable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XCONTROLCONTAINER_HPP_\n#include <com\/sun\/star\/awt\/XControlContainer.hpp>\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n\n\nusing namespace dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::sdb;\nusing namespace ::com::sun::star::form;\n\/\/ using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\n\nnamespace\n{\n sal_Bool isGrabVclControlFocusAllowed(const UnoDataBrowserView* _pView)\n {\n sal_Bool bGrabFocus = sal_False;\n SbaGridControl* pVclControl = _pView->getVclControl();\n Reference< ::com::sun::star::awt::XControl > xGrid = _pView->getGridControl();\n if (pVclControl && xGrid.is())\n {\n bGrabFocus = sal_True;\n if(!pVclControl->HasChildPathFocus())\n {\n Reference<XChild> xChild(xGrid->getModel(),UNO_QUERY);\n Reference<XLoadable> xLoad;\n if(xChild.is())\n xLoad.set(xChild->getParent(),UNO_QUERY);\n bGrabFocus = xLoad.is() && xLoad->isLoaded();\n }\n }\n return bGrabFocus;\n }\n}\n\/\/==================================================================\n\/\/= UnoDataBrowserView\n\/\/==================================================================\n\nDBG_NAME(UnoDataBrowserView)\n\/\/ -------------------------------------------------------------------------\nUnoDataBrowserView::UnoDataBrowserView( Window* pParent,\n IController* _pController,\n const Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rFactory)\n :ODataView(pParent,_pController,_rFactory)\n ,m_pTreeView(NULL)\n ,m_pSplitter(NULL)\n ,m_pVclControl(NULL)\n ,m_pStatus(NULL)\n{\n DBG_CTOR(UnoDataBrowserView,NULL);\n\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::Construct(const Reference< ::com::sun::star::awt::XControlModel >& xModel)\n{\n try\n {\n ODataView::Construct();\n\n \/\/ our UNO representation\n m_xMe = VCLUnoHelper::CreateControlContainer(this);\n\n \/\/ create the (UNO-) control\n m_xGrid = new SbaXGridControl(getORB());\n DBG_ASSERT(m_xGrid.is(), \"UnoDataBrowserView::Construct : could not create a grid control !\");\n \/\/ in design mode (for the moment)\n m_xGrid->setDesignMode(sal_True);\n\n Reference< ::com::sun::star::awt::XWindow > xGridWindow(m_xGrid, UNO_QUERY);\n xGridWindow->setVisible(sal_True);\n xGridWindow->setEnable(sal_True);\n\n \/\/ introduce the model to the grid\n m_xGrid->setModel(xModel);\n \/\/ introduce the container (me) to the grid\n Reference< ::com::sun::star::beans::XPropertySet > xModelSet(xModel, UNO_QUERY);\n getContainer()->addControl(::comphelper::getString(xModelSet->getPropertyValue(PROPERTY_NAME)), m_xGrid);\n\n \/\/ get the VCL-control\n m_pVclControl = NULL;\n getVclControl();\n\n DBG_ASSERT(m_pVclControl != NULL, \"UnoDataBrowserView::Construct : no real grid control !\");\n }\n catch(Exception&)\n {\n ::comphelper::disposeComponent(m_xGrid);\n throw;\n }\n}\n\/\/ -------------------------------------------------------------------------\nUnoDataBrowserView::~UnoDataBrowserView()\n{\n {\n ::std::auto_ptr<Splitter> aTemp(m_pSplitter);\n m_pSplitter = NULL;\n }\n setTreeView(NULL);\n\n if ( m_pStatus )\n {\n delete m_pStatus;\n m_pStatus = NULL;\n }\n\n try\n {\n ::comphelper::disposeComponent(m_xGrid);\n ::comphelper::disposeComponent(m_xMe);\n }\n catch(Exception)\n {}\n\n DBG_DTOR(UnoDataBrowserView,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( UnoDataBrowserView, SplitHdl, void*, \/*NOINTERESTEDIN*\/ )\n{\n long nYPos = m_pSplitter->GetPosPixel().Y();\n m_pSplitter->SetPosPixel( Point( m_pSplitter->GetSplitPosPixel(), nYPos ) );\n Resize();\n\n return 0L;\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::setSplitter(Splitter* _pSplitter)\n{\n m_pSplitter = _pSplitter;\n m_pSplitter->SetSplitHdl( LINK( this, UnoDataBrowserView, SplitHdl ) );\n LINK( this, UnoDataBrowserView, SplitHdl ).Call(m_pSplitter);\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::setTreeView(DBTreeView* _pTreeView)\n{\n if (m_pTreeView != _pTreeView)\n {\n if (m_pTreeView)\n {\n ::std::auto_ptr<Window> aTemp(m_pTreeView);\n m_pTreeView = NULL;\n }\n m_pTreeView = _pTreeView;\n }\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::showStatus( const String& _rStatus )\n{\n if (0 == _rStatus.Len())\n hideStatus();\n else\n {\n if (!m_pStatus)\n m_pStatus = new FixedText(this);\n m_pStatus->SetText(_rStatus);\n m_pStatus->Show();\n Resize();\n Update();\n }\n}\n\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::hideStatus()\n{\n if (!m_pStatus || !m_pStatus->IsVisible())\n \/\/ nothing to do\n return;\n m_pStatus->Hide();\n Resize();\n Update();\n}\n\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::resizeDocumentView(Rectangle& _rPlayground)\n{\n Point aSplitPos;\n Size aSplitSize;\n Point aPlaygroundPos( _rPlayground.TopLeft() );\n Size aPlaygroundSize( _rPlayground.GetSize() );\n\n if (m_pTreeView && m_pTreeView->IsVisible() && m_pSplitter)\n {\n \/\/ calculate the splitter pos and size\n aSplitPos = m_pSplitter->GetPosPixel();\n aSplitPos.Y() = aPlaygroundPos.Y();\n aSplitSize = m_pSplitter->GetOutputSizePixel();\n aSplitSize.Height() = aPlaygroundSize.Height();\n\n if( ( aSplitPos.X() + aSplitSize.Width() ) > ( aPlaygroundSize.Width() ))\n aSplitPos.X() = aPlaygroundSize.Width() - aSplitSize.Width();\n\n if( aSplitPos.X() <= aPlaygroundPos.X() )\n aSplitPos.X() = aPlaygroundPos.X() + sal_Int32(aPlaygroundSize.Width() * 0.2);\n\n \/\/ the tree pos and size\n Point aTreeViewPos( aPlaygroundPos );\n Size aTreeViewSize( aSplitPos.X(), aPlaygroundSize.Height() );\n\n \/\/ the status pos and size\n if (m_pStatus && m_pStatus->IsVisible())\n {\n Size aStatusSize(aPlaygroundPos.X(), GetTextHeight() + 2);\n aStatusSize = LogicToPixel(aStatusSize, MAP_APPFONT);\n aStatusSize.Width() = aTreeViewSize.Width() - 2 - 2;\n\n Point aStatusPos( aPlaygroundPos.X() + 2, aTreeViewPos.Y() + aTreeViewSize.Height() - aStatusSize.Height() );\n m_pStatus->SetPosSizePixel( aStatusPos, aStatusSize );\n aTreeViewSize.Height() -= aStatusSize.Height();\n }\n\n \/\/ set the size of treelistbox\n m_pTreeView->SetPosSizePixel( aTreeViewPos, aTreeViewSize );\n\n \/\/set the size of the splitter\n m_pSplitter->SetPosSizePixel( aSplitPos, Size( aSplitSize.Width(), aPlaygroundSize.Height() ) );\n m_pSplitter->SetDragRectPixel( _rPlayground );\n }\n\n \/\/ set the size of grid control\n Reference< ::com::sun::star::awt::XWindow > xGridAsWindow(m_xGrid, UNO_QUERY);\n if (xGridAsWindow.is())\n xGridAsWindow->setPosSize( aSplitPos.X() + aSplitSize.Width(), aPlaygroundPos.Y(),\n aPlaygroundSize.Width() - aSplitSize.Width() - aSplitPos.X(), aPlaygroundSize.Height(), ::com::sun::star::awt::PosSize::POSSIZE);\n\n \/\/ just for completeness: there is no space left, we occupied it all ...\n _rPlayground.SetPos( _rPlayground.BottomRight() );\n _rPlayground.SetSize( Size( 0, 0 ) );\n}\n\n\/\/------------------------------------------------------------------\nsal_uInt16 UnoDataBrowserView::View2ModelPos(sal_uInt16 nPos) const\n{\n return m_pVclControl ? m_pVclControl->GetModelColumnPos(m_pVclControl->GetColumnIdFromViewPos(nPos)) : -1;\n}\n\n\/\/ -----------------------------------------------------------------------------\nSbaGridControl* UnoDataBrowserView::getVclControl() const\n{\n if ( !m_pVclControl )\n {\n OSL_ENSURE(m_xGrid.is(),\"Grid not set!\");\n if ( m_xGrid.is() )\n {\n Reference< ::com::sun::star::awt::XWindowPeer > xPeer = m_xGrid->getPeer();\n if ( xPeer.is() )\n {\n SbaXGridPeer* pPeer = SbaXGridPeer::getImplementation(xPeer);\n UnoDataBrowserView* pTHIS = const_cast<UnoDataBrowserView*>(this);\n if ( pPeer )\n {\n m_pVclControl = static_cast<SbaGridControl*>(pPeer->GetWindow());\n pTHIS->startComponentListening(Reference<XComponent>(VCLUnoHelper::GetInterface(m_pVclControl),UNO_QUERY));\n }\n }\n }\n }\n return m_pVclControl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UnoDataBrowserView::GetFocus()\n{\n ODataView::GetFocus();\n if( m_pTreeView && m_pTreeView->IsVisible() && !m_pTreeView->HasChildPathFocus())\n m_pTreeView->GrabFocus();\n else if (m_pVclControl && m_xGrid.is())\n {\n sal_Bool bGrabFocus = sal_False;\n if(!m_pVclControl->HasChildPathFocus())\n {\n bGrabFocus = isGrabVclControlFocusAllowed(this);\n if( bGrabFocus )\n m_pVclControl->GrabFocus();\n }\n if(!bGrabFocus && m_pTreeView && m_pTreeView->IsVisible() )\n m_pTreeView->GrabFocus();\n }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UnoDataBrowserView::_disposing( const ::com::sun::star::lang::EventObject& \/*_rSource*\/ )\n{\n stopComponentListening(Reference<XComponent>(VCLUnoHelper::GetInterface(m_pVclControl),UNO_QUERY));\n m_pVclControl = NULL;\n}\n\/\/ -------------------------------------------------------------------------\nlong UnoDataBrowserView::PreNotify( NotifyEvent& rNEvt )\n{\n long nDone = 0L;\n if(rNEvt.GetType() == EVENT_KEYINPUT)\n {\n sal_Bool bGrabAllowed = isGrabVclControlFocusAllowed(this);\n if ( bGrabAllowed )\n {\n const KeyEvent* pKeyEvt = rNEvt.GetKeyEvent();\n const KeyCode& rKeyCode = pKeyEvt->GetKeyCode();\n if ( ( rKeyCode == KeyCode( KEY_E, TRUE, TRUE, FALSE ) )\n || ( rKeyCode == KeyCode( KEY_TAB, TRUE, FALSE, FALSE ) )\n )\n {\n if ( m_pTreeView && m_pVclControl && m_pTreeView->HasChildPathFocus() )\n m_pVclControl->GrabFocus();\n else if ( m_pTreeView && m_pVclControl && m_pVclControl->HasChildPathFocus() )\n m_pTreeView->GrabFocus();\n\n nDone = 1L;\n }\n }\n }\n return nDone ? nDone : ODataView::PreNotify(rNEvt);\n}\n\nDBG_NAME(BrowserViewStatusDisplay)\n\/\/ -----------------------------------------------------------------------------\nBrowserViewStatusDisplay::BrowserViewStatusDisplay( UnoDataBrowserView* _pView, const String& _rStatus )\n :m_pView(_pView)\n{\n DBG_CTOR(BrowserViewStatusDisplay,NULL);\n\n if (m_pView)\n m_pView->showStatus(_rStatus);\n}\n\n\/\/ -----------------------------------------------------------------------------\nBrowserViewStatusDisplay::~BrowserViewStatusDisplay( )\n{\n if (m_pView)\n m_pView->showStatus(String());\n\n DBG_DTOR(BrowserViewStatusDisplay,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\n<commit_msg>INTEGRATION: CWS changefileheader (1.27.162); FILE MERGED 2008\/03\/31 13:27:07 rt 1.27.162.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: brwview.cxx,v $\n * $Revision: 1.28 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_dbaccess.hxx\"\n\n#ifndef _SBA_BWRCTRLR_HXX\n#include \"brwctrlr.hxx\"\n#endif\n#ifndef _SBX_BRWVIEW_HXX\n#include \"brwview.hxx\"\n#endif\n#ifndef _SBA_GRID_HXX\n#include \"sbagrid.hxx\"\n#endif\n#ifndef _TOOLKIT_HELPER_VCLUNOHELPER_HXX_\n#include <toolkit\/helper\/vclunohelper.hxx>\n#endif\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _SV_SPLIT_HXX\n#include <vcl\/split.hxx>\n#endif\n#ifndef DBACCESS_UI_DBTREEVIEW_HXX\n#include \"dbtreeview.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBUSTRINGS_HRC\n#include \"dbustrings.hrc\"\n#endif\n#ifndef _DBU_BRW_HRC_\n#include \"dbu_brw.hrc\"\n#endif\n#ifndef _COM_SUN_STAR_FORM_XLOADABLE_HPP_\n#include <com\/sun\/star\/form\/XLoadable.hpp>\n#endif\n#ifndef _COM_SUN_STAR_AWT_XCONTROLCONTAINER_HPP_\n#include <com\/sun\/star\/awt\/XControlContainer.hpp>\n#endif\n#ifndef DBAUI_TOOLS_HXX\n#include \"UITools.hxx\"\n#endif\n\n\nusing namespace dbaui;\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::sdb;\nusing namespace ::com::sun::star::form;\n\/\/ using namespace ::com::sun::star::sdbcx;\nusing namespace ::com::sun::star::beans;\nusing namespace ::com::sun::star::container;\nusing namespace ::com::sun::star::lang;\n\n\nnamespace\n{\n sal_Bool isGrabVclControlFocusAllowed(const UnoDataBrowserView* _pView)\n {\n sal_Bool bGrabFocus = sal_False;\n SbaGridControl* pVclControl = _pView->getVclControl();\n Reference< ::com::sun::star::awt::XControl > xGrid = _pView->getGridControl();\n if (pVclControl && xGrid.is())\n {\n bGrabFocus = sal_True;\n if(!pVclControl->HasChildPathFocus())\n {\n Reference<XChild> xChild(xGrid->getModel(),UNO_QUERY);\n Reference<XLoadable> xLoad;\n if(xChild.is())\n xLoad.set(xChild->getParent(),UNO_QUERY);\n bGrabFocus = xLoad.is() && xLoad->isLoaded();\n }\n }\n return bGrabFocus;\n }\n}\n\/\/==================================================================\n\/\/= UnoDataBrowserView\n\/\/==================================================================\n\nDBG_NAME(UnoDataBrowserView)\n\/\/ -------------------------------------------------------------------------\nUnoDataBrowserView::UnoDataBrowserView( Window* pParent,\n IController* _pController,\n const Reference< ::com::sun::star::lang::XMultiServiceFactory >& _rFactory)\n :ODataView(pParent,_pController,_rFactory)\n ,m_pTreeView(NULL)\n ,m_pSplitter(NULL)\n ,m_pVclControl(NULL)\n ,m_pStatus(NULL)\n{\n DBG_CTOR(UnoDataBrowserView,NULL);\n\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::Construct(const Reference< ::com::sun::star::awt::XControlModel >& xModel)\n{\n try\n {\n ODataView::Construct();\n\n \/\/ our UNO representation\n m_xMe = VCLUnoHelper::CreateControlContainer(this);\n\n \/\/ create the (UNO-) control\n m_xGrid = new SbaXGridControl(getORB());\n DBG_ASSERT(m_xGrid.is(), \"UnoDataBrowserView::Construct : could not create a grid control !\");\n \/\/ in design mode (for the moment)\n m_xGrid->setDesignMode(sal_True);\n\n Reference< ::com::sun::star::awt::XWindow > xGridWindow(m_xGrid, UNO_QUERY);\n xGridWindow->setVisible(sal_True);\n xGridWindow->setEnable(sal_True);\n\n \/\/ introduce the model to the grid\n m_xGrid->setModel(xModel);\n \/\/ introduce the container (me) to the grid\n Reference< ::com::sun::star::beans::XPropertySet > xModelSet(xModel, UNO_QUERY);\n getContainer()->addControl(::comphelper::getString(xModelSet->getPropertyValue(PROPERTY_NAME)), m_xGrid);\n\n \/\/ get the VCL-control\n m_pVclControl = NULL;\n getVclControl();\n\n DBG_ASSERT(m_pVclControl != NULL, \"UnoDataBrowserView::Construct : no real grid control !\");\n }\n catch(Exception&)\n {\n ::comphelper::disposeComponent(m_xGrid);\n throw;\n }\n}\n\/\/ -------------------------------------------------------------------------\nUnoDataBrowserView::~UnoDataBrowserView()\n{\n {\n ::std::auto_ptr<Splitter> aTemp(m_pSplitter);\n m_pSplitter = NULL;\n }\n setTreeView(NULL);\n\n if ( m_pStatus )\n {\n delete m_pStatus;\n m_pStatus = NULL;\n }\n\n try\n {\n ::comphelper::disposeComponent(m_xGrid);\n ::comphelper::disposeComponent(m_xMe);\n }\n catch(Exception)\n {}\n\n DBG_DTOR(UnoDataBrowserView,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\nIMPL_LINK( UnoDataBrowserView, SplitHdl, void*, \/*NOINTERESTEDIN*\/ )\n{\n long nYPos = m_pSplitter->GetPosPixel().Y();\n m_pSplitter->SetPosPixel( Point( m_pSplitter->GetSplitPosPixel(), nYPos ) );\n Resize();\n\n return 0L;\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::setSplitter(Splitter* _pSplitter)\n{\n m_pSplitter = _pSplitter;\n m_pSplitter->SetSplitHdl( LINK( this, UnoDataBrowserView, SplitHdl ) );\n LINK( this, UnoDataBrowserView, SplitHdl ).Call(m_pSplitter);\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::setTreeView(DBTreeView* _pTreeView)\n{\n if (m_pTreeView != _pTreeView)\n {\n if (m_pTreeView)\n {\n ::std::auto_ptr<Window> aTemp(m_pTreeView);\n m_pTreeView = NULL;\n }\n m_pTreeView = _pTreeView;\n }\n}\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::showStatus( const String& _rStatus )\n{\n if (0 == _rStatus.Len())\n hideStatus();\n else\n {\n if (!m_pStatus)\n m_pStatus = new FixedText(this);\n m_pStatus->SetText(_rStatus);\n m_pStatus->Show();\n Resize();\n Update();\n }\n}\n\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::hideStatus()\n{\n if (!m_pStatus || !m_pStatus->IsVisible())\n \/\/ nothing to do\n return;\n m_pStatus->Hide();\n Resize();\n Update();\n}\n\n\/\/ -------------------------------------------------------------------------\nvoid UnoDataBrowserView::resizeDocumentView(Rectangle& _rPlayground)\n{\n Point aSplitPos;\n Size aSplitSize;\n Point aPlaygroundPos( _rPlayground.TopLeft() );\n Size aPlaygroundSize( _rPlayground.GetSize() );\n\n if (m_pTreeView && m_pTreeView->IsVisible() && m_pSplitter)\n {\n \/\/ calculate the splitter pos and size\n aSplitPos = m_pSplitter->GetPosPixel();\n aSplitPos.Y() = aPlaygroundPos.Y();\n aSplitSize = m_pSplitter->GetOutputSizePixel();\n aSplitSize.Height() = aPlaygroundSize.Height();\n\n if( ( aSplitPos.X() + aSplitSize.Width() ) > ( aPlaygroundSize.Width() ))\n aSplitPos.X() = aPlaygroundSize.Width() - aSplitSize.Width();\n\n if( aSplitPos.X() <= aPlaygroundPos.X() )\n aSplitPos.X() = aPlaygroundPos.X() + sal_Int32(aPlaygroundSize.Width() * 0.2);\n\n \/\/ the tree pos and size\n Point aTreeViewPos( aPlaygroundPos );\n Size aTreeViewSize( aSplitPos.X(), aPlaygroundSize.Height() );\n\n \/\/ the status pos and size\n if (m_pStatus && m_pStatus->IsVisible())\n {\n Size aStatusSize(aPlaygroundPos.X(), GetTextHeight() + 2);\n aStatusSize = LogicToPixel(aStatusSize, MAP_APPFONT);\n aStatusSize.Width() = aTreeViewSize.Width() - 2 - 2;\n\n Point aStatusPos( aPlaygroundPos.X() + 2, aTreeViewPos.Y() + aTreeViewSize.Height() - aStatusSize.Height() );\n m_pStatus->SetPosSizePixel( aStatusPos, aStatusSize );\n aTreeViewSize.Height() -= aStatusSize.Height();\n }\n\n \/\/ set the size of treelistbox\n m_pTreeView->SetPosSizePixel( aTreeViewPos, aTreeViewSize );\n\n \/\/set the size of the splitter\n m_pSplitter->SetPosSizePixel( aSplitPos, Size( aSplitSize.Width(), aPlaygroundSize.Height() ) );\n m_pSplitter->SetDragRectPixel( _rPlayground );\n }\n\n \/\/ set the size of grid control\n Reference< ::com::sun::star::awt::XWindow > xGridAsWindow(m_xGrid, UNO_QUERY);\n if (xGridAsWindow.is())\n xGridAsWindow->setPosSize( aSplitPos.X() + aSplitSize.Width(), aPlaygroundPos.Y(),\n aPlaygroundSize.Width() - aSplitSize.Width() - aSplitPos.X(), aPlaygroundSize.Height(), ::com::sun::star::awt::PosSize::POSSIZE);\n\n \/\/ just for completeness: there is no space left, we occupied it all ...\n _rPlayground.SetPos( _rPlayground.BottomRight() );\n _rPlayground.SetSize( Size( 0, 0 ) );\n}\n\n\/\/------------------------------------------------------------------\nsal_uInt16 UnoDataBrowserView::View2ModelPos(sal_uInt16 nPos) const\n{\n return m_pVclControl ? m_pVclControl->GetModelColumnPos(m_pVclControl->GetColumnIdFromViewPos(nPos)) : -1;\n}\n\n\/\/ -----------------------------------------------------------------------------\nSbaGridControl* UnoDataBrowserView::getVclControl() const\n{\n if ( !m_pVclControl )\n {\n OSL_ENSURE(m_xGrid.is(),\"Grid not set!\");\n if ( m_xGrid.is() )\n {\n Reference< ::com::sun::star::awt::XWindowPeer > xPeer = m_xGrid->getPeer();\n if ( xPeer.is() )\n {\n SbaXGridPeer* pPeer = SbaXGridPeer::getImplementation(xPeer);\n UnoDataBrowserView* pTHIS = const_cast<UnoDataBrowserView*>(this);\n if ( pPeer )\n {\n m_pVclControl = static_cast<SbaGridControl*>(pPeer->GetWindow());\n pTHIS->startComponentListening(Reference<XComponent>(VCLUnoHelper::GetInterface(m_pVclControl),UNO_QUERY));\n }\n }\n }\n }\n return m_pVclControl;\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UnoDataBrowserView::GetFocus()\n{\n ODataView::GetFocus();\n if( m_pTreeView && m_pTreeView->IsVisible() && !m_pTreeView->HasChildPathFocus())\n m_pTreeView->GrabFocus();\n else if (m_pVclControl && m_xGrid.is())\n {\n sal_Bool bGrabFocus = sal_False;\n if(!m_pVclControl->HasChildPathFocus())\n {\n bGrabFocus = isGrabVclControlFocusAllowed(this);\n if( bGrabFocus )\n m_pVclControl->GrabFocus();\n }\n if(!bGrabFocus && m_pTreeView && m_pTreeView->IsVisible() )\n m_pTreeView->GrabFocus();\n }\n}\n\/\/ -----------------------------------------------------------------------------\nvoid UnoDataBrowserView::_disposing( const ::com::sun::star::lang::EventObject& \/*_rSource*\/ )\n{\n stopComponentListening(Reference<XComponent>(VCLUnoHelper::GetInterface(m_pVclControl),UNO_QUERY));\n m_pVclControl = NULL;\n}\n\/\/ -------------------------------------------------------------------------\nlong UnoDataBrowserView::PreNotify( NotifyEvent& rNEvt )\n{\n long nDone = 0L;\n if(rNEvt.GetType() == EVENT_KEYINPUT)\n {\n sal_Bool bGrabAllowed = isGrabVclControlFocusAllowed(this);\n if ( bGrabAllowed )\n {\n const KeyEvent* pKeyEvt = rNEvt.GetKeyEvent();\n const KeyCode& rKeyCode = pKeyEvt->GetKeyCode();\n if ( ( rKeyCode == KeyCode( KEY_E, TRUE, TRUE, FALSE ) )\n || ( rKeyCode == KeyCode( KEY_TAB, TRUE, FALSE, FALSE ) )\n )\n {\n if ( m_pTreeView && m_pVclControl && m_pTreeView->HasChildPathFocus() )\n m_pVclControl->GrabFocus();\n else if ( m_pTreeView && m_pVclControl && m_pVclControl->HasChildPathFocus() )\n m_pTreeView->GrabFocus();\n\n nDone = 1L;\n }\n }\n }\n return nDone ? nDone : ODataView::PreNotify(rNEvt);\n}\n\nDBG_NAME(BrowserViewStatusDisplay)\n\/\/ -----------------------------------------------------------------------------\nBrowserViewStatusDisplay::BrowserViewStatusDisplay( UnoDataBrowserView* _pView, const String& _rStatus )\n :m_pView(_pView)\n{\n DBG_CTOR(BrowserViewStatusDisplay,NULL);\n\n if (m_pView)\n m_pView->showStatus(_rStatus);\n}\n\n\/\/ -----------------------------------------------------------------------------\nBrowserViewStatusDisplay::~BrowserViewStatusDisplay( )\n{\n if (m_pView)\n m_pView->showStatus(String());\n\n DBG_DTOR(BrowserViewStatusDisplay,NULL);\n}\n\/\/ -----------------------------------------------------------------------------\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"partial_update.h\"\n#include <vespa\/vespalib\/util\/overload.h>\n#include <vespa\/vespalib\/util\/typify.h>\n#include <vespa\/vespalib\/util\/visit_ranges.h>\n#include <cassert>\n#include <set>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".eval.tensor.partial_update\");\n\nusing namespace vespalib::eval;\n\nnamespace vespalib::tensor {\n\nnamespace {\n\nusing join_fun_t = double (*)(double, double);\n\nstatic constexpr size_t npos() { return -1; }\n\nenum class DimCase {\n SKIP_MAPPED, SKIP_INDEXED,\n MISSING_MAPPED, MISSING_INDEXED,\n MAPPED_MATCH, INDEXED_MATCH,\n CONV_TO_INDEXED, CONV_TO_MAPPED\n};\n\nstruct DenseCoords {\n std::vector<size_t> dim_sizes;\n std::vector<const char *> dim_names;\n size_t total_size = 1;\n size_t offset;\n size_t dim;\n void clear() { offset = 0; dim = 0; }\n void with(size_t coord) {\n size_t cur = dim_sizes[dim];\n if (coord < cur) {\n if (offset != npos()) {\n offset *= cur;\n offset += coord;\n }\n } else {\n \/\/ \"bad label{%s} in modifier tensor, was %zu, must be < %zu\", dim_names[dim], coord, cur\n offset = npos();\n }\n ++dim;\n }\n void with(vespalib::stringref label) {\n uint32_t result = 0;\n for (char c : label) {\n if (c < '0' || c > '9') { \/\/ bad char\n \/\/ \"bad label{%s} in modifier tensor, was '%s'\", dim_names[dim], label.data()\n offset = npos();\n ++dim;\n return;\n }\n result = result * 10 + (c - '0');\n }\n with(result);\n }\n void add_dim(const char *name, size_t sz) {\n dim_sizes.push_back(sz);\n dim_names.push_back(name);\n total_size *= sz;\n }\n size_t get() const {\n assert(dim == dim_sizes.size());\n return offset;\n }\n ~DenseCoords();\n};\nDenseCoords::~DenseCoords() = default;\n\nstruct Addresses {\n std::vector<vespalib::stringref> addr;\n std::vector<vespalib::stringref *> next_result_refs;\n std::vector<const vespalib::stringref *> lookup_refs;\n std::vector<size_t> lookup_view_dims;\n Addresses(size_t sz)\n : addr(sz), next_result_refs(sz), lookup_refs(sz), lookup_view_dims(sz)\n {\n for (size_t i = 0; i < sz; ++i) {\n next_result_refs[i] = &addr[i];\n lookup_refs[i] = &addr[i];\n lookup_view_dims[i] = i;\n }\n }\n ~Addresses();\n};\nAddresses::~Addresses() = default;\n\nstruct AddressHandler {\n std::vector<DimCase> how;\n DenseCoords target_coords;\n Addresses for_output;\n Addresses from_modifier;\n bool valid;\n\n AddressHandler(const ValueType &input_type,\n const ValueType &modifier_type)\n : how(), target_coords(),\n for_output(input_type.count_mapped_dimensions()),\n from_modifier(modifier_type.count_mapped_dimensions()),\n valid(true)\n {\n if (! modifier_type.is_sparse()) {\n LOG(error, \"Unexpected non-sparse modifier tensor, type is %s\",\n modifier_type.to_spec().c_str());\n valid = false;\n return;\n }\n \/\/ analyse dimensions\n auto visitor = overload {\n [&](visit_ranges_either, const auto &) { valid = false; },\n [&](visit_ranges_both, const auto &a, const auto &) {\n how.push_back(a.is_mapped() ? DimCase::MAPPED_MATCH : DimCase::CONV_TO_INDEXED);\n }\n };\n const auto & input_dims = input_type.dimensions();\n const auto & modifier_dims = modifier_type.dimensions();\n visit_ranges(visitor,\n input_dims.begin(), input_dims.end(),\n modifier_dims.begin(), modifier_dims.end(),\n [](const auto &a, const auto &b){ return (a.name < b.name); });\n if ((! valid) ||\n (input_dims.size() != modifier_dims.size()) ||\n (input_dims.size() != how.size()))\n {\n LOG(error, \"Value type %s does not match modifier type %s (should have same dimensions)\",\n input_type.to_spec().c_str(),\n modifier_type.to_spec().c_str());\n valid = false;\n return;\n }\n for (const auto & dim : input_type.dimensions()) {\n if (dim.is_indexed()) {\n target_coords.add_dim(dim.name.c_str(), dim.size);\n }\n }\n }\n\n void handle_address()\n {\n target_coords.clear();\n auto out = for_output.addr.begin();\n for (size_t i = 0; i < how.size(); ++i) {\n if (how[i] == DimCase::CONV_TO_INDEXED) {\n target_coords.with(from_modifier.addr[i]);\n } else {\n *out++ = from_modifier.addr[i];\n }\n }\n assert(out == for_output.addr.end());\n assert(target_coords.dim == target_coords.dim_sizes.size());\n }\n\n ~AddressHandler();\n};\nAddressHandler::~AddressHandler() = default;\n\ntemplate <typename CT>\nValue::UP\ncopy_tensor(const Value &input, const ValueType &input_type, Addresses &helper, const ValueBuilderFactory &factory)\n{\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n const size_t expected_subspaces = input.index().size();\n auto builder = factory.create_value_builder<CT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n auto view = input.index().create_view({});\n view->lookup({});\n auto input_cells = input.cells().typify<CT>();\n size_t input_subspace;\n while (view->next_result(helper.next_result_refs, input_subspace)) {\n size_t input_offset = input_subspace * dsss;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(helper.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n return builder->build(std::move(builder));\n}\n\ntemplate <typename ICT, typename MCT>\nValue::UP\nmy_modify_value(const Value &input, join_fun_t function, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const size_t dsss = input_type.dense_subspace_size();\n const ValueType &modifier_type = modifier.type();\n AddressHandler handler(input_type, modifier_type);\n if (! handler.valid) {\n return Value::UP();\n }\n \/\/ copy input to output\n auto out = copy_tensor<ICT>(input, input_type, handler.for_output, factory);\n \/\/ need to overwrite some cells\n auto output_cells = unconstify(out->cells().template typify<ICT>());\n const auto modifier_cells = modifier.cells().typify<MCT>();\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = out->index().create_view(handler.for_output.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(handler.from_modifier.next_result_refs, modifier_subspace_index)) {\n handler.handle_address();\n size_t dense_idx = handler.target_coords.get();\n if (dense_idx == npos()) {\n continue;\n }\n lookup_view->lookup(handler.for_output.lookup_refs);\n size_t output_subspace_index;\n if (lookup_view->next_result({}, output_subspace_index)) {\n size_t subspace_offset = dsss * output_subspace_index;\n auto dst = output_cells.begin() + subspace_offset;\n ICT lhs = dst[dense_idx];\n MCT rhs = modifier_cells[modifier_subspace_index];\n dst[dense_idx] = function(lhs, rhs);\n }\n }\n return out;\n}\nstruct PerformModify {\n template<typename ICT, typename MCT>\n static Value::UP invoke(const Value &input,\n join_fun_t function,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_modify_value<ICT,MCT>(input, function, modifier, factory);\n }\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\ntemplate <typename ICT, typename MCT>\nValue::UP\nmy_add_cells(const Value &input, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const ValueType &modifier_type = modifier.type();\n if (input_type.dimensions() != modifier_type.dimensions()) {\n LOG(error, \"when adding cells to a tensor, dimensions must be equal\");\n return Value::UP();\n }\n const auto input_cells = input.cells().typify<ICT>();\n const auto modifier_cells = modifier.cells().typify<MCT>();\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n const size_t expected_subspaces = input.index().size() + modifier.index().size();\n auto builder = factory.create_value_builder<ICT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n Addresses addrs(num_mapped_in_input);\n std::set<size_t> overwritten_subspaces;\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = input.index().create_view(addrs.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(addrs.next_result_refs, modifier_subspace_index)) {\n size_t modifier_offset = dsss * modifier_subspace_index;\n auto src = modifier_cells.begin() + modifier_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n lookup_view->lookup(addrs.lookup_refs);\n size_t input_subspace_index;\n if (lookup_view->next_result({}, input_subspace_index)) {\n overwritten_subspaces.insert(input_subspace_index);\n }\n }\n auto input_view = input.index().create_view({});\n input_view->lookup({});\n size_t input_subspace_index;\n while (input_view->next_result(addrs.next_result_refs, input_subspace_index)) {\n if (overwritten_subspaces.count(input_subspace_index) == 0) {\n size_t input_offset = dsss * input_subspace_index;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n }\n return builder->build(std::move(builder));\n}\n\nstruct PerformAdd {\n template<typename ICT, typename MCT>\n static Value::UP invoke(const Value &input,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_add_cells<ICT,MCT>(input, modifier, factory);\n }\n};\n\n\/\/-----------------------------------------------------------------------------\n\ntemplate <typename ICT>\nValue::UP\nmy_remove_cells(const Value &input, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const ValueType &modifier_type = modifier.type();\n if (input_type.mapped_dimensions() != modifier_type.mapped_dimensions()) {\n LOG(error, \"when removing cells from a tensor, mapped dimensions must be equal\");\n return Value::UP();\n }\n if (input_type.mapped_dimensions().size() == 0) {\n LOG(error, \"cannot remove cells from a dense tensor\");\n return Value::UP();\n }\n const auto input_cells = input.cells().typify<ICT>();\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n Addresses addrs(num_mapped_in_input);\n std::set<size_t> removed_subspaces;\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = input.index().create_view(addrs.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(addrs.next_result_refs, modifier_subspace_index)) {\n lookup_view->lookup(addrs.lookup_refs);\n size_t input_subspace_index;\n if (lookup_view->next_result({}, input_subspace_index)) {\n removed_subspaces.insert(input_subspace_index);\n }\n }\n const size_t expected_subspaces = input.index().size() - removed_subspaces.size();\n auto builder = factory.create_value_builder<ICT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n auto input_view = input.index().create_view({});\n input_view->lookup({});\n size_t input_subspace_index;\n while (input_view->next_result(addrs.next_result_refs, input_subspace_index)) {\n if (removed_subspaces.count(input_subspace_index) == 0) {\n size_t input_offset = dsss * input_subspace_index;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n }\n return builder->build(std::move(builder));\n}\n\nstruct PerformRemove {\n template<typename ICT>\n static Value::UP invoke(const Value &input,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_remove_cells<ICT>(input, modifier, factory);\n }\n};\n\n} \/\/ namespace <unnamed>\n\n\/\/-----------------------------------------------------------------------------\n\nValue::UP\nTensorPartialUpdate::modify(const Value &input, join_fun_t function,\n const Value &modifier, const ValueBuilderFactory &factory)\n{\n return typify_invoke<2, TypifyCellType, PerformModify>(\n input.cells().type, modifier.cells().type,\n input, function, modifier, factory);\n}\n\nValue::UP\nTensorPartialUpdate::add(const Value &input, const Value &add_cells, const ValueBuilderFactory &factory)\n{\n return typify_invoke<2, TypifyCellType, PerformAdd>(\n input.cells().type, add_cells.cells().type,\n input, add_cells, factory);\n}\n\nValue::UP\nTensorPartialUpdate::remove(const Value &input, const Value &remove_spec, const ValueBuilderFactory &factory)\n{\n return typify_invoke<1, TypifyCellType, PerformRemove>(\n input.cells().type,\n input, remove_spec, factory);\n}\n\n} \/\/ namespace\n<commit_msg>only keep DimCase enums that are possible (within current constraints)<commit_after>\/\/ Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"partial_update.h\"\n#include <vespa\/vespalib\/util\/overload.h>\n#include <vespa\/vespalib\/util\/typify.h>\n#include <vespa\/vespalib\/util\/visit_ranges.h>\n#include <cassert>\n#include <set>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".eval.tensor.partial_update\");\n\nusing namespace vespalib::eval;\n\nnamespace vespalib::tensor {\n\nnamespace {\n\nusing join_fun_t = double (*)(double, double);\n\nstatic constexpr size_t npos() { return -1; }\n\nenum class DimCase {\n MAPPED_MATCH, CONV_TO_INDEXED\n};\n\nstruct DenseCoords {\n std::vector<size_t> dim_sizes;\n std::vector<const char *> dim_names;\n size_t total_size = 1;\n size_t offset;\n size_t dim;\n void clear() { offset = 0; dim = 0; }\n void with(size_t coord) {\n size_t cur = dim_sizes[dim];\n if (coord < cur) {\n if (offset != npos()) {\n offset *= cur;\n offset += coord;\n }\n } else {\n \/\/ \"bad label{%s} in modifier tensor, was %zu, must be < %zu\", dim_names[dim], coord, cur\n offset = npos();\n }\n ++dim;\n }\n void with(vespalib::stringref label) {\n uint32_t result = 0;\n for (char c : label) {\n if (c < '0' || c > '9') { \/\/ bad char\n \/\/ \"bad label{%s} in modifier tensor, was '%s'\", dim_names[dim], label.data()\n offset = npos();\n ++dim;\n return;\n }\n result = result * 10 + (c - '0');\n }\n with(result);\n }\n void add_dim(const char *name, size_t sz) {\n dim_sizes.push_back(sz);\n dim_names.push_back(name);\n total_size *= sz;\n }\n size_t get() const {\n assert(dim == dim_sizes.size());\n return offset;\n }\n ~DenseCoords();\n};\nDenseCoords::~DenseCoords() = default;\n\nstruct Addresses {\n std::vector<vespalib::stringref> addr;\n std::vector<vespalib::stringref *> next_result_refs;\n std::vector<const vespalib::stringref *> lookup_refs;\n std::vector<size_t> lookup_view_dims;\n Addresses(size_t sz)\n : addr(sz), next_result_refs(sz), lookup_refs(sz), lookup_view_dims(sz)\n {\n for (size_t i = 0; i < sz; ++i) {\n next_result_refs[i] = &addr[i];\n lookup_refs[i] = &addr[i];\n lookup_view_dims[i] = i;\n }\n }\n ~Addresses();\n};\nAddresses::~Addresses() = default;\n\nstruct AddressHandler {\n std::vector<DimCase> how;\n DenseCoords target_coords;\n Addresses for_output;\n Addresses from_modifier;\n bool valid;\n\n AddressHandler(const ValueType &input_type,\n const ValueType &modifier_type)\n : how(), target_coords(),\n for_output(input_type.count_mapped_dimensions()),\n from_modifier(modifier_type.count_mapped_dimensions()),\n valid(true)\n {\n if (! modifier_type.is_sparse()) {\n LOG(error, \"Unexpected non-sparse modifier tensor, type is %s\",\n modifier_type.to_spec().c_str());\n valid = false;\n return;\n }\n \/\/ analyse dimensions\n auto visitor = overload {\n [&](visit_ranges_either, const auto &) { valid = false; },\n [&](visit_ranges_both, const auto &a, const auto &) {\n how.push_back(a.is_mapped() ? DimCase::MAPPED_MATCH : DimCase::CONV_TO_INDEXED);\n }\n };\n const auto & input_dims = input_type.dimensions();\n const auto & modifier_dims = modifier_type.dimensions();\n visit_ranges(visitor,\n input_dims.begin(), input_dims.end(),\n modifier_dims.begin(), modifier_dims.end(),\n [](const auto &a, const auto &b){ return (a.name < b.name); });\n if ((! valid) ||\n (input_dims.size() != modifier_dims.size()) ||\n (input_dims.size() != how.size()))\n {\n LOG(error, \"Value type %s does not match modifier type %s (should have same dimensions)\",\n input_type.to_spec().c_str(),\n modifier_type.to_spec().c_str());\n valid = false;\n return;\n }\n for (const auto & dim : input_type.dimensions()) {\n if (dim.is_indexed()) {\n target_coords.add_dim(dim.name.c_str(), dim.size);\n }\n }\n }\n\n void handle_address()\n {\n target_coords.clear();\n auto out = for_output.addr.begin();\n for (size_t i = 0; i < how.size(); ++i) {\n if (how[i] == DimCase::CONV_TO_INDEXED) {\n target_coords.with(from_modifier.addr[i]);\n } else {\n *out++ = from_modifier.addr[i];\n }\n }\n assert(out == for_output.addr.end());\n assert(target_coords.dim == target_coords.dim_sizes.size());\n }\n\n ~AddressHandler();\n};\nAddressHandler::~AddressHandler() = default;\n\ntemplate <typename CT>\nValue::UP\ncopy_tensor(const Value &input, const ValueType &input_type, Addresses &helper, const ValueBuilderFactory &factory)\n{\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n const size_t expected_subspaces = input.index().size();\n auto builder = factory.create_value_builder<CT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n auto view = input.index().create_view({});\n view->lookup({});\n auto input_cells = input.cells().typify<CT>();\n size_t input_subspace;\n while (view->next_result(helper.next_result_refs, input_subspace)) {\n size_t input_offset = input_subspace * dsss;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(helper.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n return builder->build(std::move(builder));\n}\n\ntemplate <typename ICT, typename MCT>\nValue::UP\nmy_modify_value(const Value &input, join_fun_t function, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const size_t dsss = input_type.dense_subspace_size();\n const ValueType &modifier_type = modifier.type();\n AddressHandler handler(input_type, modifier_type);\n if (! handler.valid) {\n return Value::UP();\n }\n \/\/ copy input to output\n auto out = copy_tensor<ICT>(input, input_type, handler.for_output, factory);\n \/\/ need to overwrite some cells\n auto output_cells = unconstify(out->cells().template typify<ICT>());\n const auto modifier_cells = modifier.cells().typify<MCT>();\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = out->index().create_view(handler.for_output.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(handler.from_modifier.next_result_refs, modifier_subspace_index)) {\n handler.handle_address();\n size_t dense_idx = handler.target_coords.get();\n if (dense_idx == npos()) {\n continue;\n }\n lookup_view->lookup(handler.for_output.lookup_refs);\n size_t output_subspace_index;\n if (lookup_view->next_result({}, output_subspace_index)) {\n size_t subspace_offset = dsss * output_subspace_index;\n auto dst = output_cells.begin() + subspace_offset;\n ICT lhs = dst[dense_idx];\n MCT rhs = modifier_cells[modifier_subspace_index];\n dst[dense_idx] = function(lhs, rhs);\n }\n }\n return out;\n}\nstruct PerformModify {\n template<typename ICT, typename MCT>\n static Value::UP invoke(const Value &input,\n join_fun_t function,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_modify_value<ICT,MCT>(input, function, modifier, factory);\n }\n};\n\n\/\/-----------------------------------------------------------------------------\n\n\ntemplate <typename ICT, typename MCT>\nValue::UP\nmy_add_cells(const Value &input, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const ValueType &modifier_type = modifier.type();\n if (input_type.dimensions() != modifier_type.dimensions()) {\n LOG(error, \"when adding cells to a tensor, dimensions must be equal\");\n return Value::UP();\n }\n const auto input_cells = input.cells().typify<ICT>();\n const auto modifier_cells = modifier.cells().typify<MCT>();\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n const size_t expected_subspaces = input.index().size() + modifier.index().size();\n auto builder = factory.create_value_builder<ICT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n Addresses addrs(num_mapped_in_input);\n std::set<size_t> overwritten_subspaces;\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = input.index().create_view(addrs.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(addrs.next_result_refs, modifier_subspace_index)) {\n size_t modifier_offset = dsss * modifier_subspace_index;\n auto src = modifier_cells.begin() + modifier_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n lookup_view->lookup(addrs.lookup_refs);\n size_t input_subspace_index;\n if (lookup_view->next_result({}, input_subspace_index)) {\n overwritten_subspaces.insert(input_subspace_index);\n }\n }\n auto input_view = input.index().create_view({});\n input_view->lookup({});\n size_t input_subspace_index;\n while (input_view->next_result(addrs.next_result_refs, input_subspace_index)) {\n if (overwritten_subspaces.count(input_subspace_index) == 0) {\n size_t input_offset = dsss * input_subspace_index;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n }\n return builder->build(std::move(builder));\n}\n\nstruct PerformAdd {\n template<typename ICT, typename MCT>\n static Value::UP invoke(const Value &input,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_add_cells<ICT,MCT>(input, modifier, factory);\n }\n};\n\n\/\/-----------------------------------------------------------------------------\n\ntemplate <typename ICT>\nValue::UP\nmy_remove_cells(const Value &input, const Value &modifier, const ValueBuilderFactory &factory)\n{\n const ValueType &input_type = input.type();\n const ValueType &modifier_type = modifier.type();\n if (input_type.mapped_dimensions() != modifier_type.mapped_dimensions()) {\n LOG(error, \"when removing cells from a tensor, mapped dimensions must be equal\");\n return Value::UP();\n }\n if (input_type.mapped_dimensions().size() == 0) {\n LOG(error, \"cannot remove cells from a dense tensor\");\n return Value::UP();\n }\n const auto input_cells = input.cells().typify<ICT>();\n const size_t num_mapped_in_input = input_type.count_mapped_dimensions();\n const size_t dsss = input_type.dense_subspace_size();\n Addresses addrs(num_mapped_in_input);\n std::set<size_t> removed_subspaces;\n auto modifier_view = modifier.index().create_view({});\n auto lookup_view = input.index().create_view(addrs.lookup_view_dims);\n modifier_view->lookup({});\n size_t modifier_subspace_index;\n while (modifier_view->next_result(addrs.next_result_refs, modifier_subspace_index)) {\n lookup_view->lookup(addrs.lookup_refs);\n size_t input_subspace_index;\n if (lookup_view->next_result({}, input_subspace_index)) {\n removed_subspaces.insert(input_subspace_index);\n }\n }\n const size_t expected_subspaces = input.index().size() - removed_subspaces.size();\n auto builder = factory.create_value_builder<ICT>(input_type, num_mapped_in_input, dsss, expected_subspaces);\n auto input_view = input.index().create_view({});\n input_view->lookup({});\n size_t input_subspace_index;\n while (input_view->next_result(addrs.next_result_refs, input_subspace_index)) {\n if (removed_subspaces.count(input_subspace_index) == 0) {\n size_t input_offset = dsss * input_subspace_index;\n auto src = input_cells.begin() + input_offset;\n auto dst = builder->add_subspace(addrs.addr).begin();\n for (size_t i = 0; i < dsss; ++i) {\n dst[i] = src[i];\n }\n }\n }\n return builder->build(std::move(builder));\n}\n\nstruct PerformRemove {\n template<typename ICT>\n static Value::UP invoke(const Value &input,\n const Value &modifier,\n const ValueBuilderFactory &factory)\n {\n return my_remove_cells<ICT>(input, modifier, factory);\n }\n};\n\n} \/\/ namespace <unnamed>\n\n\/\/-----------------------------------------------------------------------------\n\nValue::UP\nTensorPartialUpdate::modify(const Value &input, join_fun_t function,\n const Value &modifier, const ValueBuilderFactory &factory)\n{\n return typify_invoke<2, TypifyCellType, PerformModify>(\n input.cells().type, modifier.cells().type,\n input, function, modifier, factory);\n}\n\nValue::UP\nTensorPartialUpdate::add(const Value &input, const Value &add_cells, const ValueBuilderFactory &factory)\n{\n return typify_invoke<2, TypifyCellType, PerformAdd>(\n input.cells().type, add_cells.cells().type,\n input, add_cells, factory);\n}\n\nValue::UP\nTensorPartialUpdate::remove(const Value &input, const Value &remove_spec, const ValueBuilderFactory &factory)\n{\n return typify_invoke<1, TypifyCellType, PerformRemove>(\n input.cells().type,\n input, remove_spec, factory);\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#include \"utest.h\"\n#include \"builder.h\"\n#include \"trainer.h\"\n#include \"accumulator.h\"\n#include \"math\/epsilon.h\"\n#include \"solver_batch.h\"\n#include \"tasks\/task_affine.h\"\n\nusing namespace nano;\n\nNANO_BEGIN_MODULE(trainer_batch)\n\nNANO_CASE(tune_and_train_regression)\n{\n const auto isize = 5;\n const auto osize = 3;\n const auto fold = 0;\n\n \/\/ create synthetic task\n const auto task = get_tasks().get(\"synth-affine\");\n NANO_REQUIRE(task);\n task->config(json_writer_t().object(\n \"isize\", isize, \"osize\", osize, \"noise\", 0, \"count\", 100, \"type\", affine_task_type::regression).str());\n NANO_REQUIRE(task->load());\n\n \/\/ create default enhancer (use task as it is)\n const auto enhancer = get_enhancers().get(\"default\");\n NANO_REQUIRE(enhancer);\n\n \/\/ create loss\n const auto loss = get_losses().get(\"square\");\n NANO_REQUIRE(loss);\n\n \/\/ create model\n model_t model;\n NANO_REQUIRE(make_linear(model, osize, 1, 1, \"act-snorm\"));\n NANO_REQUIRE(model.done());\n NANO_REQUIRE(model.resize(make_dims(isize, 1, 1), make_dims(osize, 1, 1)));\n\n \/\/ create batch trainer\n const auto trainer = get_trainers().get(\"batch\");\n NANO_REQUIRE(trainer);\n\n \/\/ check that the trainer works for all compatible solvers\n for (const auto& solver : get_batch_solvers().ids())\n {\n trainer->config(json_writer_t().object(\n \"epochs\", 128, \"solver\", solver, \"eps\", epsilon0<scalar_t>()).str());\n\n accumulator_t acc(model, *loss);\n acc.threads(1);\n\n acc.random();\n trainer->tune(*enhancer, *task, fold, acc);\n\n acc.random();\n const auto result = trainer->train(*enhancer, *task, fold, acc);\n NANO_REQUIRE(result);\n const auto state = result.optimum_state();\n\n NANO_CHECK_LESS(state.m_train.m_error, epsilon1<scalar_t>());\n }\n}\n\nNANO_CASE(tune_and_train_classification)\n{\n const auto isize = 3;\n const auto osize = 2;\n const auto fold = 0;\n\n \/\/ create synthetic task\n const auto task = get_tasks().get(\"synth-affine\");\n NANO_REQUIRE(task);\n task->config(json_writer_t().object(\n \"isize\", isize, \"osize\", osize, \"noise\", 0, \"count\", 1000, \"type\", affine_task_type::classification).str());\n NANO_REQUIRE(task->load());\n\n \/\/ create default enhancer (use task as it is)\n const auto enhancer = get_enhancers().get(\"default\");\n NANO_REQUIRE(enhancer);\n\n \/\/ create loss\n const auto loss = get_losses().get(\"m-exponential\");\n NANO_REQUIRE(loss);\n\n \/\/ create model\n model_t model;\n NANO_REQUIRE(make_linear(model, osize, 1, 1, \"act-snorm\"));\n NANO_REQUIRE(model.done());\n NANO_REQUIRE(model.resize(make_dims(isize, 1, 1), make_dims(osize, 1, 1)));\n\n \/\/ create batch trainer\n const auto trainer = get_trainers().get(\"batch\");\n NANO_REQUIRE(trainer);\n\n \/\/ check that the trainer works for all compatible solvers\n for (const auto& solver : get_batch_solvers().ids())\n {\n trainer->config(json_writer_t().object(\n \"epochs\", 1024, \"solver\", solver, \"eps\", epsilon1<scalar_t>()).str());\n\n accumulator_t acc(model, *loss);\n acc.threads(1);\n\n acc.random();\n trainer->tune(*enhancer, *task, fold, acc);\n\n acc.random();\n const auto result = trainer->train(*enhancer, *task, fold, acc);\n NANO_REQUIRE(result);\n const auto state = result.optimum_state();\n\n NANO_CHECK_LESS(state.m_train.m_error, epsilon3<scalar_t>());\n }\n}\n\nNANO_END_MODULE()\n<commit_msg>faster unit test for batch trainers<commit_after>#include \"utest.h\"\n#include \"builder.h\"\n#include \"trainer.h\"\n#include \"accumulator.h\"\n#include \"math\/epsilon.h\"\n#include \"solver_batch.h\"\n#include \"tasks\/task_affine.h\"\n\nusing namespace nano;\n\nNANO_BEGIN_MODULE(trainer_batch)\n\nNANO_CASE(tune_and_train_regression)\n{\n const auto isize = 5;\n const auto osize = 3;\n const auto fold = 0;\n\n \/\/ create synthetic task\n const auto task = get_tasks().get(\"synth-affine\");\n NANO_REQUIRE(task);\n task->config(json_writer_t().object(\n \"isize\", isize, \"osize\", osize, \"noise\", 0, \"count\", 100, \"type\", affine_task_type::regression).str());\n NANO_REQUIRE(task->load());\n\n \/\/ create default enhancer (use task as it is)\n const auto enhancer = get_enhancers().get(\"default\");\n NANO_REQUIRE(enhancer);\n\n \/\/ create loss\n const auto loss = get_losses().get(\"square\");\n NANO_REQUIRE(loss);\n\n \/\/ create model\n model_t model;\n NANO_REQUIRE(make_linear(model, osize, 1, 1, \"act-snorm\"));\n NANO_REQUIRE(model.done());\n NANO_REQUIRE(model.resize(make_dims(isize, 1, 1), make_dims(osize, 1, 1)));\n\n \/\/ create batch trainer\n const auto trainer = get_trainers().get(\"batch\");\n NANO_REQUIRE(trainer);\n\n \/\/ check that the trainer works for all compatible solvers\n for (const auto& solver : get_batch_solvers().ids())\n {\n trainer->config(json_writer_t().object(\n \"epochs\", 128, \"solver\", solver, \"eps\", epsilon0<scalar_t>()).str());\n\n accumulator_t acc(model, *loss);\n acc.threads(1);\n\n acc.random();\n trainer->tune(*enhancer, *task, fold, acc);\n\n acc.random();\n const auto result = trainer->train(*enhancer, *task, fold, acc);\n NANO_REQUIRE(result);\n const auto state = result.optimum_state();\n\n NANO_CHECK_LESS(state.m_train.m_error, epsilon1<scalar_t>());\n }\n}\n\nNANO_CASE(tune_and_train_classification)\n{\n const auto isize = 3;\n const auto osize = 2;\n const auto fold = 0;\n\n \/\/ create synthetic task\n const auto task = get_tasks().get(\"synth-affine\");\n NANO_REQUIRE(task);\n task->config(json_writer_t().object(\n \"isize\", isize, \"osize\", osize, \"noise\", 0, \"count\", 100, \"type\", affine_task_type::classification).str());\n NANO_REQUIRE(task->load());\n\n \/\/ create default enhancer (use task as it is)\n const auto enhancer = get_enhancers().get(\"default\");\n NANO_REQUIRE(enhancer);\n\n \/\/ create loss\n const auto loss = get_losses().get(\"m-exponential\");\n NANO_REQUIRE(loss);\n\n \/\/ create model\n model_t model;\n NANO_REQUIRE(make_linear(model, osize, 1, 1, \"act-snorm\"));\n NANO_REQUIRE(model.done());\n NANO_REQUIRE(model.resize(make_dims(isize, 1, 1), make_dims(osize, 1, 1)));\n\n \/\/ create batch trainer\n const auto trainer = get_trainers().get(\"batch\");\n NANO_REQUIRE(trainer);\n\n \/\/ check that the trainer works for all compatible solvers\n for (const auto& solver : get_batch_solvers().ids())\n {\n trainer->config(json_writer_t().object(\n \"epochs\", 128, \"solver\", solver, \"eps\", epsilon0<scalar_t>()).str());\n\n accumulator_t acc(model, *loss);\n acc.threads(1);\n\n acc.random();\n trainer->tune(*enhancer, *task, fold, acc);\n\n acc.random();\n const auto result = trainer->train(*enhancer, *task, fold, acc);\n NANO_REQUIRE(result);\n const auto state = result.optimum_state();\n\n NANO_CHECK_LESS(state.m_train.m_error, epsilon1<scalar_t>());\n }\n}\n\nNANO_END_MODULE()\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2020 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"call\/version.h\"\n\nnamespace webrtc {\n\n\/\/ The timestamp is always in UTC.\nconst char* const kSourceTimestamp = \"WebRTC source stamp 2021-01-03T04:03:33\";\n\nvoid LoadWebRTCVersionInRegister() {\n \/\/ Using volatile to instruct the compiler to not optimize `p` away even\n \/\/ if it looks unused.\n const char* volatile p = kSourceTimestamp;\n static_cast<void>(p);\n}\n\n} \/\/ namespace webrtc\n<commit_msg>Update WebRTC code version (2021-01-04T04:02:59).<commit_after>\/*\n * Copyright (c) 2020 The WebRTC project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"call\/version.h\"\n\nnamespace webrtc {\n\n\/\/ The timestamp is always in UTC.\nconst char* const kSourceTimestamp = \"WebRTC source stamp 2021-01-04T04:02:59\";\n\nvoid LoadWebRTCVersionInRegister() {\n \/\/ Using volatile to instruct the compiler to not optimize `p` away even\n \/\/ if it looks unused.\n const char* volatile p = kSourceTimestamp;\n static_cast<void>(p);\n}\n\n} \/\/ namespace webrtc\n<|endoftext|>"} {"text":"<commit_before><commit_msg>CppCheck cleaning : reduce scope<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"Backend.h\"\n\nvoid\nSecurity::EncodeLargeConstants()\n{\n#pragma prefast(suppress:6236 6285, \"logical-or of constants is by design\")\n if (PHASE_OFF(Js::EncodeConstantsPhase, this->func) || CONFIG_ISENABLED(Js::DebugFlag) || !MD_ENCODE_LG_CONSTS)\n {\n return;\n }\n\n FOREACH_REAL_INSTR_IN_FUNC_EDITING(instr, instrNext, this->func)\n {\n if (!instr->IsRealInstr())\n {\n continue;\n }\n IR::Opnd *dst = instr->GetDst();\n if (dst)\n {\n this->EncodeOpnd(instr, dst);\n }\n IR::Opnd *src1 = instr->GetSrc1();\n if (src1)\n {\n this->EncodeOpnd(instr, src1);\n\n IR::Opnd *src2 = instr->GetSrc2();\n if (src2)\n {\n this->EncodeOpnd(instr, src2);\n }\n }\n } NEXT_REAL_INSTR_IN_FUNC_EDITING;\n}\n\nint\nSecurity::GetNextNOPInsertPoint()\n{\n uint frequency = (1 << CONFIG_FLAG(NopFrequency)) - 1;\n return (Math::Rand() & frequency) + 1;\n}\n\nvoid\nSecurity::InsertRandomFunctionPad(IR::Instr * instrBeforeInstr)\n{\n if (PHASE_OFF(Js::InsertNOPsPhase, instrBeforeInstr->m_func->GetTopFunc())\n || CONFIG_ISENABLED(Js::DebugFlag) || CONFIG_ISENABLED(Js::BenchmarkFlag))\n {\n return;\n }\n DWORD randomPad = Math::Rand() & ((0 - INSTR_ALIGNMENT) & 0xF);\n#ifndef _M_ARM\n if (randomPad == 1)\n {\n InsertSmallNOP(instrBeforeInstr, 1);\n return;\n }\n if (randomPad & 1)\n {\n InsertSmallNOP(instrBeforeInstr, 3);\n randomPad -= 3;\n }\n#endif\n Assert((randomPad & 1) == 0);\n while (randomPad >= 4)\n {\n InsertSmallNOP(instrBeforeInstr, 4);\n randomPad -= 4;\n }\n Assert(randomPad == 2 || randomPad == 0);\n if (randomPad == 2)\n {\n InsertSmallNOP(instrBeforeInstr, 2);\n }\n}\n\n\nvoid\nSecurity::InsertNOPs()\n{\n if (PHASE_OFF(Js::InsertNOPsPhase, this->func) || CONFIG_ISENABLED(Js::DebugFlag) || CONFIG_ISENABLED(Js::BenchmarkFlag))\n {\n return;\n }\n\n int count = 0;\n IR::Instr *instr = this->func->m_headInstr;\n\n while(true)\n {\n count = this->GetNextNOPInsertPoint();\n while(instr && count--)\n {\n instr = instr->GetNextRealInstr();\n }\n if (instr == nullptr)\n {\n break;\n }\n this->InsertNOPBefore(instr);\n };\n}\n\nvoid\nSecurity::InsertNOPBefore(IR::Instr *instr)\n{\n InsertSmallNOP(instr, (Math::Rand() & 0x3) + 1);\n}\n\nvoid\nSecurity::InsertSmallNOP(IR::Instr * instr, DWORD nopSize)\n{\n#if defined(_M_IX86) || defined(_M_X64)\n#ifdef _M_IX86\n if (AutoSystemInfo::Data.SSE2Available())\n { \/\/ on x86 system that has SSE2, encode fast NOPs as x64 does\n#endif\n Assert(nopSize >= 1 || nopSize <= 4);\n IR::Instr *nop = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n\n \/\/ Let the encoder know what the size of the NOP needs to be.\n if (nopSize > 1)\n {\n \/\/ 2, 3 or 4 byte NOP.\n IR::IntConstOpnd *nopSizeOpnd = IR::IntConstOpnd::New(nopSize, TyInt8, instr->m_func);\n nop->SetSrc1(nopSizeOpnd);\n }\n\n instr->InsertBefore(nop);\n#ifdef _M_IX86\n }\n else\n {\n IR::Instr *nopInstr = nullptr;\n IR::RegOpnd *regOpnd;\n IR::IndirOpnd *indirOpnd;\n switch (nopSize)\n {\n case 1:\n \/\/ nop\n nopInstr = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n break;\n case 2:\n \/\/ mov edi, edi ; 2 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegEDI, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::MOV, regOpnd, regOpnd, instr->m_func);\n break;\n case 3:\n \/\/ lea ecx, [ecx+00] ; 3 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegECX, TyInt32, instr->m_func);\n indirOpnd = IR::IndirOpnd::New(regOpnd, (int32)0, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::LEA, regOpnd, indirOpnd, instr->m_func);\n break;\n case 4:\n \/\/ lea esp, [esp+00] ; 4 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegESP, TyInt32, instr->m_func);\n indirOpnd = IR::IndirOpnd::New(regOpnd, (int32)0, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::LEA, regOpnd, indirOpnd, instr->m_func);\n break;\n default:\n Assert(false);\n break;\n }\n instr->InsertBefore(nopInstr);\n }\n#endif\n#elif defined(_M_ARM)\n \/\/ Can't insert 3 bytes, must choose between 2 and 4.\n\n IR::Instr *nopInstr = nullptr;\n\n switch(nopSize)\n {\n case 1:\n case 2:\n nopInstr = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n break;\n case 3:\n case 4:\n nopInstr = IR::Instr::New(Js::OpCode::NOP_W, instr->m_func);\n break;\n default:\n Assert(false);\n break;\n }\n\n instr->InsertBefore(nopInstr);\n#else\n AssertMsg(false, \"Unimplemented\");\n#endif\n}\n\nbool\nSecurity::DontEncode(IR::Opnd *opnd)\n{\n switch (opnd->GetKind())\n {\n case IR::OpndKindIntConst:\n {\n IR::IntConstOpnd *intConstOpnd = opnd->AsIntConstOpnd();\n return intConstOpnd->m_dontEncode;\n }\n\n case IR::OpndKindAddr:\n {\n IR::AddrOpnd *addrOpnd = opnd->AsAddrOpnd();\n return (addrOpnd->m_dontEncode ||\n !addrOpnd->IsVar() ||\n addrOpnd->m_address == nullptr ||\n !Js::TaggedNumber::Is(addrOpnd->m_address));\n }\n\n case IR::OpndKindHelperCall:\n \/\/ Never encode helper call addresses, as these are always internal constants.\n return true;\n }\n\n return false;\n}\n\nvoid\nSecurity::EncodeOpnd(IR::Instr *instr, IR::Opnd *opnd)\n{\n IR::RegOpnd *newOpnd;\n bool isSrc2 = false;\n\n if (Security::DontEncode(opnd))\n {\n return;\n }\n\n switch(opnd->GetKind())\n {\n case IR::OpndKindIntConst:\n {\n IR::IntConstOpnd *intConstOpnd = opnd->AsIntConstOpnd();\n\n if (\n#if TARGET_64\n (IRType_IsInt64(intConstOpnd->GetType()) && !this->IsLargeConstant(intConstOpnd->GetValue())) ||\n#endif\n !this->IsLargeConstant(intConstOpnd->AsInt32()))\n {\n return;\n }\n\n if (opnd != instr->GetSrc1())\n {\n Assert(opnd == instr->GetSrc2());\n isSrc2 = true;\n instr->UnlinkSrc2();\n }\n else\n {\n instr->UnlinkSrc1();\n }\n\n#if DBG_DUMP || defined(ENABLE_IR_VIEWER)\n intConstOpnd->decodedValue = intConstOpnd->GetValue();\n#endif\n\n intConstOpnd->SetValue(EncodeValue(instr, intConstOpnd, intConstOpnd->GetValue(), &newOpnd));\n }\n break;\n\n case IR::OpndKindAddr:\n {\n IR::AddrOpnd *addrOpnd = opnd->AsAddrOpnd();\n\n \/\/ Only encode large constants. Small ones don't allow control of enough bits\n if (Js::TaggedInt::Is(addrOpnd->m_address) && !this->IsLargeConstant(Js::TaggedInt::ToInt32(addrOpnd->m_address)))\n {\n return;\n }\n\n if (opnd != instr->GetSrc1())\n {\n Assert(opnd == instr->GetSrc2());\n isSrc2 = true;\n instr->UnlinkSrc2();\n }\n else\n {\n instr->UnlinkSrc1();\n }\n\n addrOpnd->SetEncodedValue((Js::Var)this->EncodeValue(instr, addrOpnd, (IntConstType)addrOpnd->m_address, &newOpnd), addrOpnd->GetAddrOpndKind());\n }\n break;\n\n case IR::OpndKindIndir:\n {\n IR::IndirOpnd *indirOpnd = opnd->AsIndirOpnd();\n\n if (!this->IsLargeConstant(indirOpnd->GetOffset()) || indirOpnd->m_dontEncode)\n {\n return;\n }\n AssertMsg(indirOpnd->GetIndexOpnd() == nullptr, \"Code currently doesn't support indir with offset and indexOpnd\");\n\n IR::IntConstOpnd *indexOpnd = IR::IntConstOpnd::New(indirOpnd->GetOffset(), TyInt32, instr->m_func);\n#if DBG_DUMP || defined(ENABLE_IR_VIEWER)\n indexOpnd->decodedValue = indexOpnd->GetValue();\n#endif\n\n indexOpnd->SetValue(EncodeValue(instr, indexOpnd, indexOpnd->GetValue(), &newOpnd));\n indirOpnd->SetOffset(0);\n indirOpnd->SetIndexOpnd(newOpnd);\n }\n return;\n\n default:\n return;\n }\n\n IR::Opnd *dst = instr->GetDst();\n\n if (dst)\n {\n#if _M_X64\n \/\/ Ensure the left and right operand has the same type (that might not be true for constants on x64)\n newOpnd = (IR::RegOpnd *)newOpnd->UseWithNewType(dst->GetType(), instr->m_func);\n#endif\n if (dst->IsRegOpnd())\n {\n IR::RegOpnd *dstRegOpnd = dst->AsRegOpnd();\n StackSym *dstSym = dstRegOpnd->m_sym;\n\n if (dstSym)\n {\n dstSym->m_isConst = false;\n dstSym->m_isIntConst = false;\n dstSym->m_isInt64Const = false;\n dstSym->m_isTaggableIntConst = false;\n dstSym->m_isFltConst = false;\n }\n }\n }\n\n LowererMD::ImmedSrcToReg(instr, newOpnd, isSrc2 ? 2 : 1);\n}\n\nIntConstType\nSecurity::EncodeValue(IR::Instr *instr, IR::Opnd *opnd, IntConstType constValue, IR::RegOpnd **pNewOpnd)\n{\n if (opnd->GetType() == TyInt32 || opnd->GetType() == TyInt16 || opnd->GetType() == TyInt8\n#if _M_IX86\n || opnd->GetType() == TyVar\n#endif\n )\n {\n int32 cookie = (int32)Math::Rand();\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(StackSym::New(TyInt32, instr->m_func), TyInt32, instr->m_func);\n IR::Instr * instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n IR::IntConstOpnd * cookieOpnd = IR::IntConstOpnd::New(cookie, TyInt32, instr->m_func);\n\n#if DBG_DUMP\n cookieOpnd->name = _u(\"cookie\");\n#endif\n\n instrNew = IR::Instr::New(Js::OpCode::Xor_I4, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n\n LowererMD::EmitInt4Instr(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = (int32)constValue;\n\n *pNewOpnd = regOpnd;\n\n int32 value = (int32)constValue;\n value = value ^ cookie;\n return value;\n }\n else if (opnd->GetType() == TyUint32 || opnd->GetType() == TyUint16 || opnd->GetType() == TyUint8)\n {\n uint32 cookie = (uint32)Math::Rand();\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(StackSym::New(TyUint32, instr->m_func), TyUint32, instr->m_func);\n IR::Instr * instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n IR::IntConstOpnd * cookieOpnd = IR::IntConstOpnd::New(cookie, TyUint32, instr->m_func);\n\n#if DBG_DUMP\n cookieOpnd->name = _u(\"cookie\");\n#endif\n\n instrNew = IR::Instr::New(Js::OpCode::Xor_I4, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n\n LowererMD::EmitInt4Instr(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = (uint32)constValue;\n\n *pNewOpnd = regOpnd;\n\n uint32 value = (uint32)constValue;\n value = value ^ cookie;\n return (IntConstType)value;\n }\n else\n {\n#ifdef _M_X64\n return this->EncodeAddress(instr, opnd, constValue, pNewOpnd);\n#else\n Assert(false);\n return 0;\n#endif\n }\n}\n\n#ifdef _M_X64\nsize_t\nSecurity::EncodeAddress(IR::Instr *instr, IR::Opnd *opnd, size_t value, IR::RegOpnd **pNewOpnd)\n{\n IR::Instr *instrNew = nullptr;\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(TyMachReg, instr->m_func);\n\n instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n size_t cookie = (size_t)Math::Rand();\n IR::IntConstOpnd *cookieOpnd = IR::IntConstOpnd::New(cookie, TyMachReg, instr->m_func);\n instrNew = IR::Instr::New(Js::OpCode::XOR, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n LowererMD::Legalize(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = value;\n\n *pNewOpnd = regOpnd;\n return value ^ cookie;\n}\n#endif\n<commit_msg>[1.4>2.0] Revert change made when encoding large constant for Wasm bug as it has a big perf impact.<commit_after>\/\/-------------------------------------------------------------------------------------------------------\n\/\/ Copyright (C) Microsoft. All rights reserved.\n\/\/ Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.\n\/\/-------------------------------------------------------------------------------------------------------\n#include \"Backend.h\"\n\nvoid\nSecurity::EncodeLargeConstants()\n{\n#pragma prefast(suppress:6236 6285, \"logical-or of constants is by design\")\n if (PHASE_OFF(Js::EncodeConstantsPhase, this->func) || CONFIG_ISENABLED(Js::DebugFlag) || !MD_ENCODE_LG_CONSTS)\n {\n return;\n }\n\n FOREACH_REAL_INSTR_IN_FUNC_EDITING(instr, instrNext, this->func)\n {\n if (!instr->IsRealInstr())\n {\n continue;\n }\n IR::Opnd *dst = instr->GetDst();\n if (dst)\n {\n this->EncodeOpnd(instr, dst);\n }\n IR::Opnd *src1 = instr->GetSrc1();\n if (src1)\n {\n this->EncodeOpnd(instr, src1);\n\n IR::Opnd *src2 = instr->GetSrc2();\n if (src2)\n {\n this->EncodeOpnd(instr, src2);\n }\n }\n } NEXT_REAL_INSTR_IN_FUNC_EDITING;\n}\n\nint\nSecurity::GetNextNOPInsertPoint()\n{\n uint frequency = (1 << CONFIG_FLAG(NopFrequency)) - 1;\n return (Math::Rand() & frequency) + 1;\n}\n\nvoid\nSecurity::InsertRandomFunctionPad(IR::Instr * instrBeforeInstr)\n{\n if (PHASE_OFF(Js::InsertNOPsPhase, instrBeforeInstr->m_func->GetTopFunc())\n || CONFIG_ISENABLED(Js::DebugFlag) || CONFIG_ISENABLED(Js::BenchmarkFlag))\n {\n return;\n }\n DWORD randomPad = Math::Rand() & ((0 - INSTR_ALIGNMENT) & 0xF);\n#ifndef _M_ARM\n if (randomPad == 1)\n {\n InsertSmallNOP(instrBeforeInstr, 1);\n return;\n }\n if (randomPad & 1)\n {\n InsertSmallNOP(instrBeforeInstr, 3);\n randomPad -= 3;\n }\n#endif\n Assert((randomPad & 1) == 0);\n while (randomPad >= 4)\n {\n InsertSmallNOP(instrBeforeInstr, 4);\n randomPad -= 4;\n }\n Assert(randomPad == 2 || randomPad == 0);\n if (randomPad == 2)\n {\n InsertSmallNOP(instrBeforeInstr, 2);\n }\n}\n\n\nvoid\nSecurity::InsertNOPs()\n{\n if (PHASE_OFF(Js::InsertNOPsPhase, this->func) || CONFIG_ISENABLED(Js::DebugFlag) || CONFIG_ISENABLED(Js::BenchmarkFlag))\n {\n return;\n }\n\n int count = 0;\n IR::Instr *instr = this->func->m_headInstr;\n\n while(true)\n {\n count = this->GetNextNOPInsertPoint();\n while(instr && count--)\n {\n instr = instr->GetNextRealInstr();\n }\n if (instr == nullptr)\n {\n break;\n }\n this->InsertNOPBefore(instr);\n };\n}\n\nvoid\nSecurity::InsertNOPBefore(IR::Instr *instr)\n{\n InsertSmallNOP(instr, (Math::Rand() & 0x3) + 1);\n}\n\nvoid\nSecurity::InsertSmallNOP(IR::Instr * instr, DWORD nopSize)\n{\n#if defined(_M_IX86) || defined(_M_X64)\n#ifdef _M_IX86\n if (AutoSystemInfo::Data.SSE2Available())\n { \/\/ on x86 system that has SSE2, encode fast NOPs as x64 does\n#endif\n Assert(nopSize >= 1 || nopSize <= 4);\n IR::Instr *nop = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n\n \/\/ Let the encoder know what the size of the NOP needs to be.\n if (nopSize > 1)\n {\n \/\/ 2, 3 or 4 byte NOP.\n IR::IntConstOpnd *nopSizeOpnd = IR::IntConstOpnd::New(nopSize, TyInt8, instr->m_func);\n nop->SetSrc1(nopSizeOpnd);\n }\n\n instr->InsertBefore(nop);\n#ifdef _M_IX86\n }\n else\n {\n IR::Instr *nopInstr = nullptr;\n IR::RegOpnd *regOpnd;\n IR::IndirOpnd *indirOpnd;\n switch (nopSize)\n {\n case 1:\n \/\/ nop\n nopInstr = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n break;\n case 2:\n \/\/ mov edi, edi ; 2 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegEDI, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::MOV, regOpnd, regOpnd, instr->m_func);\n break;\n case 3:\n \/\/ lea ecx, [ecx+00] ; 3 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegECX, TyInt32, instr->m_func);\n indirOpnd = IR::IndirOpnd::New(regOpnd, (int32)0, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::LEA, regOpnd, indirOpnd, instr->m_func);\n break;\n case 4:\n \/\/ lea esp, [esp+00] ; 4 bytes\n regOpnd = IR::RegOpnd::New(nullptr, RegESP, TyInt32, instr->m_func);\n indirOpnd = IR::IndirOpnd::New(regOpnd, (int32)0, TyInt32, instr->m_func);\n nopInstr = IR::Instr::New(Js::OpCode::LEA, regOpnd, indirOpnd, instr->m_func);\n break;\n default:\n Assert(false);\n break;\n }\n instr->InsertBefore(nopInstr);\n }\n#endif\n#elif defined(_M_ARM)\n \/\/ Can't insert 3 bytes, must choose between 2 and 4.\n\n IR::Instr *nopInstr = nullptr;\n\n switch(nopSize)\n {\n case 1:\n case 2:\n nopInstr = IR::Instr::New(Js::OpCode::NOP, instr->m_func);\n break;\n case 3:\n case 4:\n nopInstr = IR::Instr::New(Js::OpCode::NOP_W, instr->m_func);\n break;\n default:\n Assert(false);\n break;\n }\n\n instr->InsertBefore(nopInstr);\n#else\n AssertMsg(false, \"Unimplemented\");\n#endif\n}\n\nbool\nSecurity::DontEncode(IR::Opnd *opnd)\n{\n switch (opnd->GetKind())\n {\n case IR::OpndKindIntConst:\n {\n IR::IntConstOpnd *intConstOpnd = opnd->AsIntConstOpnd();\n return intConstOpnd->m_dontEncode;\n }\n\n case IR::OpndKindAddr:\n {\n IR::AddrOpnd *addrOpnd = opnd->AsAddrOpnd();\n return (addrOpnd->m_dontEncode ||\n !addrOpnd->IsVar() ||\n addrOpnd->m_address == nullptr ||\n !Js::TaggedNumber::Is(addrOpnd->m_address));\n }\n\n case IR::OpndKindHelperCall:\n \/\/ Never encode helper call addresses, as these are always internal constants.\n return true;\n }\n\n return false;\n}\n\nvoid\nSecurity::EncodeOpnd(IR::Instr *instr, IR::Opnd *opnd)\n{\n IR::RegOpnd *newOpnd;\n bool isSrc2 = false;\n\n if (Security::DontEncode(opnd))\n {\n return;\n }\n\n switch(opnd->GetKind())\n {\n case IR::OpndKindIntConst:\n {\n IR::IntConstOpnd *intConstOpnd = opnd->AsIntConstOpnd();\n\n if (\n#if TARGET_64\n IRType_IsInt64(intConstOpnd->GetType()) ? !this->IsLargeConstant(intConstOpnd->GetValue()) :\n#endif\n !this->IsLargeConstant(intConstOpnd->AsInt32()))\n {\n return;\n }\n\n if (opnd != instr->GetSrc1())\n {\n Assert(opnd == instr->GetSrc2());\n isSrc2 = true;\n instr->UnlinkSrc2();\n }\n else\n {\n instr->UnlinkSrc1();\n }\n\n#if DBG_DUMP || defined(ENABLE_IR_VIEWER)\n intConstOpnd->decodedValue = intConstOpnd->GetValue();\n#endif\n\n intConstOpnd->SetValue(EncodeValue(instr, intConstOpnd, intConstOpnd->GetValue(), &newOpnd));\n }\n break;\n\n case IR::OpndKindAddr:\n {\n IR::AddrOpnd *addrOpnd = opnd->AsAddrOpnd();\n\n \/\/ Only encode large constants. Small ones don't allow control of enough bits\n if (Js::TaggedInt::Is(addrOpnd->m_address) && !this->IsLargeConstant(Js::TaggedInt::ToInt32(addrOpnd->m_address)))\n {\n return;\n }\n\n if (opnd != instr->GetSrc1())\n {\n Assert(opnd == instr->GetSrc2());\n isSrc2 = true;\n instr->UnlinkSrc2();\n }\n else\n {\n instr->UnlinkSrc1();\n }\n\n addrOpnd->SetEncodedValue((Js::Var)this->EncodeValue(instr, addrOpnd, (IntConstType)addrOpnd->m_address, &newOpnd), addrOpnd->GetAddrOpndKind());\n }\n break;\n\n case IR::OpndKindIndir:\n {\n IR::IndirOpnd *indirOpnd = opnd->AsIndirOpnd();\n\n if (!this->IsLargeConstant(indirOpnd->GetOffset()) || indirOpnd->m_dontEncode)\n {\n return;\n }\n AssertMsg(indirOpnd->GetIndexOpnd() == nullptr, \"Code currently doesn't support indir with offset and indexOpnd\");\n\n IR::IntConstOpnd *indexOpnd = IR::IntConstOpnd::New(indirOpnd->GetOffset(), TyInt32, instr->m_func);\n#if DBG_DUMP || defined(ENABLE_IR_VIEWER)\n indexOpnd->decodedValue = indexOpnd->GetValue();\n#endif\n\n indexOpnd->SetValue(EncodeValue(instr, indexOpnd, indexOpnd->GetValue(), &newOpnd));\n indirOpnd->SetOffset(0);\n indirOpnd->SetIndexOpnd(newOpnd);\n }\n return;\n\n default:\n return;\n }\n\n IR::Opnd *dst = instr->GetDst();\n\n if (dst)\n {\n#if _M_X64\n \/\/ Ensure the left and right operand has the same type (that might not be true for constants on x64)\n newOpnd = (IR::RegOpnd *)newOpnd->UseWithNewType(dst->GetType(), instr->m_func);\n#endif\n if (dst->IsRegOpnd())\n {\n IR::RegOpnd *dstRegOpnd = dst->AsRegOpnd();\n StackSym *dstSym = dstRegOpnd->m_sym;\n\n if (dstSym)\n {\n dstSym->m_isConst = false;\n dstSym->m_isIntConst = false;\n dstSym->m_isInt64Const = false;\n dstSym->m_isTaggableIntConst = false;\n dstSym->m_isFltConst = false;\n }\n }\n }\n\n LowererMD::ImmedSrcToReg(instr, newOpnd, isSrc2 ? 2 : 1);\n}\n\nIntConstType\nSecurity::EncodeValue(IR::Instr *instr, IR::Opnd *opnd, IntConstType constValue, IR::RegOpnd **pNewOpnd)\n{\n if (opnd->GetType() == TyInt32 || opnd->GetType() == TyInt16 || opnd->GetType() == TyInt8\n#if _M_IX86\n || opnd->GetType() == TyVar\n#endif\n )\n {\n int32 cookie = (int32)Math::Rand();\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(StackSym::New(TyInt32, instr->m_func), TyInt32, instr->m_func);\n IR::Instr * instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n IR::IntConstOpnd * cookieOpnd = IR::IntConstOpnd::New(cookie, TyInt32, instr->m_func);\n\n#if DBG_DUMP\n cookieOpnd->name = _u(\"cookie\");\n#endif\n\n instrNew = IR::Instr::New(Js::OpCode::Xor_I4, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n\n LowererMD::EmitInt4Instr(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = (int32)constValue;\n\n *pNewOpnd = regOpnd;\n\n int32 value = (int32)constValue;\n value = value ^ cookie;\n return value;\n }\n else if (opnd->GetType() == TyUint32 || opnd->GetType() == TyUint16 || opnd->GetType() == TyUint8)\n {\n uint32 cookie = (uint32)Math::Rand();\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(StackSym::New(TyUint32, instr->m_func), TyUint32, instr->m_func);\n IR::Instr * instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n IR::IntConstOpnd * cookieOpnd = IR::IntConstOpnd::New(cookie, TyUint32, instr->m_func);\n\n#if DBG_DUMP\n cookieOpnd->name = _u(\"cookie\");\n#endif\n\n instrNew = IR::Instr::New(Js::OpCode::Xor_I4, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n\n LowererMD::EmitInt4Instr(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = (uint32)constValue;\n\n *pNewOpnd = regOpnd;\n\n uint32 value = (uint32)constValue;\n value = value ^ cookie;\n return (IntConstType)value;\n }\n else\n {\n#ifdef _M_X64\n return this->EncodeAddress(instr, opnd, constValue, pNewOpnd);\n#else\n Assert(false);\n return 0;\n#endif\n }\n}\n\n#ifdef _M_X64\nsize_t\nSecurity::EncodeAddress(IR::Instr *instr, IR::Opnd *opnd, size_t value, IR::RegOpnd **pNewOpnd)\n{\n IR::Instr *instrNew = nullptr;\n IR::RegOpnd *regOpnd = IR::RegOpnd::New(TyMachReg, instr->m_func);\n\n instrNew = LowererMD::CreateAssign(regOpnd, opnd, instr);\n\n size_t cookie = (size_t)Math::Rand();\n IR::IntConstOpnd *cookieOpnd = IR::IntConstOpnd::New(cookie, TyMachReg, instr->m_func);\n instrNew = IR::Instr::New(Js::OpCode::XOR, regOpnd, regOpnd, cookieOpnd, instr->m_func);\n instr->InsertBefore(instrNew);\n LowererMD::Legalize(instrNew);\n\n StackSym * stackSym = regOpnd->m_sym;\n Assert(!stackSym->m_isSingleDef);\n Assert(stackSym->m_instrDef == nullptr);\n stackSym->m_isEncodedConstant = true;\n stackSym->constantValue = value;\n\n *pNewOpnd = regOpnd;\n return value ^ cookie;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief debugging helpers\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Jan Steemann\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Basics\/Common.h\"\n#include \"Basics\/locks.h\"\n#include \"Basics\/logging.h\"\n\n#ifdef TRI_ENABLE_MAINTAINER_MODE\n#if HAVE_BACKTRACE\n#ifdef _WIN32\n#include <DbgHelp.h>\n#else\n#include <execinfo.h>\n#include <cxxabi.h>\n#endif\n#endif\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- private variables\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief a global string containing the currently registered failure points\n\/\/\/ the string is a comma-separated list of point names\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic char* FailurePoints;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief a read-write lock for thread-safe access to the failure-points list\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nTRI_read_write_lock_t FailurePointsLock;\n\n#ifdef TRI_ENABLE_FAILURE_TESTS\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- private functions\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief make a delimited value from a string, so we can unambigiously\n\/\/\/ search for it (e.g. searching for just \"foo\" would find \"foo\" and \"foobar\",\n\/\/\/ so we'll be putting the value inside some delimiter: \",foo,\")\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic char* MakeValue (char const* value) {\n if (value == nullptr || strlen(value) == 0) {\n return nullptr;\n }\n\n char* delimited = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, strlen(value) + 3, false));\n\n if (delimited != nullptr) {\n memcpy(delimited + 1, value, strlen(value));\n delimited[0] = ',';\n delimited[strlen(value) + 1] = ',';\n delimited[strlen(value) + 2] = '\\0';\n }\n\n return delimited;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- public functions\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief cause a segmentation violation\n\/\/\/ this is used for crash and recovery tests\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_SegfaultDebugging (char const* message) {\n LOG_WARNING(\"%s: summon Baal!\", message);\n \/\/ make sure the latest log messages are flushed\n TRI_ShutdownLogging(true);\n\n \/\/ and now crash\n#ifndef __APPLE__\n \/\/ on MacOS, the following statement makes the server hang but not crash\n *((char*) -1) = '!';\n#endif\n\n \/\/ ensure the process is terminated\n abort();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief check whether we should fail at a specific failure point\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool TRI_ShouldFailDebugging (char const* value) {\n char* found = nullptr;\n\n \/\/ try without the lock first (to speed things up)\n if (FailurePoints == nullptr) {\n return false;\n }\n\n TRI_ReadLockReadWriteLock(&FailurePointsLock);\n\n if (FailurePoints != nullptr) {\n char* checkValue = MakeValue(value);\n\n if (checkValue != nullptr) {\n found = strstr(FailurePoints, checkValue);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n }\n }\n\n TRI_ReadUnlockReadWriteLock(&FailurePointsLock);\n\n return (found != nullptr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief add a failure point\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_AddFailurePointDebugging (char const* value) {\n char* found;\n char* checkValue;\n\n checkValue = MakeValue(value);\n\n if (checkValue == nullptr) {\n return;\n }\n\n TRI_WriteLockReadWriteLock(&FailurePointsLock);\n\n if (FailurePoints == nullptr) {\n found = nullptr;\n }\n else {\n found = strstr(FailurePoints, checkValue);\n }\n\n if (found == nullptr) {\n \/\/ not yet found. so add it\n char* copy;\n size_t n;\n\n LOG_WARNING(\"activating intentional failure point '%s'. the server will misbehave!\", value);\n n = strlen(checkValue);\n\n if (FailurePoints == nullptr) {\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, n + 1, false));\n\n if (copy == nullptr) {\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n memcpy(copy, checkValue, n);\n copy[n] = '\\0';\n }\n else {\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, n + strlen(FailurePoints), false));\n\n if (copy == nullptr) {\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n memcpy(copy, FailurePoints, strlen(FailurePoints));\n memcpy(copy + strlen(FailurePoints) - 1, checkValue, n);\n copy[strlen(FailurePoints) + n - 1] = '\\0';\n }\n\n FailurePoints = copy;\n }\n\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief remove a failure points\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_RemoveFailurePointDebugging (char const* value) {\n char* checkValue;\n\n TRI_WriteLockReadWriteLock(&FailurePointsLock);\n\n if (FailurePoints == nullptr) {\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n return;\n }\n\n checkValue = MakeValue(value);\n\n if (checkValue != nullptr) {\n char* found;\n char* copy;\n size_t n;\n\n found = strstr(FailurePoints, checkValue);\n\n if (found == nullptr) {\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n if (strlen(FailurePoints) - strlen(checkValue) <= 2) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n FailurePoints = nullptr;\n\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, strlen(FailurePoints) - strlen(checkValue) + 2, false));\n\n if (copy == nullptr) {\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n \/\/ copy start of string\n n = found - FailurePoints;\n memcpy(copy, FailurePoints, n);\n\n \/\/ copy remainder of string\n memcpy(copy + n, found + strlen(checkValue) - 1, strlen(FailurePoints) - strlen(checkValue) - n + 1);\n\n copy[strlen(FailurePoints) - strlen(checkValue) + 1] = '\\0';\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n FailurePoints = copy;\n\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief clear all failure points\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_ClearFailurePointsDebugging () {\n TRI_WriteLockReadWriteLock(&FailurePointsLock);\n\n if (FailurePoints != nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n }\n\n FailurePoints = nullptr;\n\n TRI_WriteUnlockReadWriteLock(&FailurePointsLock);\n}\n\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief initialise the debugging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_InitialiseDebugging () {\n FailurePoints = nullptr;\n TRI_InitReadWriteLock(&FailurePointsLock);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief shutdown the debugging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_ShutdownDebugging () {\n if (FailurePoints != nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n }\n\n FailurePoints = nullptr;\n\n TRI_DestroyReadWriteLock(&FailurePointsLock);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief appends a backtrace to the string provided\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_GetBacktrace (std::string& btstr) {\n#if HAVE_BACKTRACE\n#ifdef _WIN32\n void * stack[100];\n unsigned short frames;\n SYMBOL_INFO * symbol;\n HANDLE process;\n\n process = GetCurrentProcess();\n\n SymInitialize(process, nullptr, true);\n\n frames = CaptureStackBackTrace(0, 100, stack, nullptr);\n symbol = (SYMBOL_INFO*) calloc(sizeof(SYMBOL_INFO) + 256 * sizeof(char), 1);\n\n if (symbol == nullptr) {\n \/\/ cannot allocate memory\n return;\n }\n\n symbol->MaxNameLen = 255;\n symbol->SizeOfStruct = sizeof(SYMBOL_INFO);\n\n for (unsigned int i = 0; i < frames; i++) {\n char address[64];\n SymFromAddr(process, (DWORD64) stack[i], 0, symbol);\n\n snprintf(address, sizeof(address), \"0x%0X\", (unsigned int) symbol->Address);\n btstr += std::to_string(frames - i - 1) + std::string(\": \") + symbol->Name + std::string(\" [\") + address + std::string(\"]\\n\");\n }\n\n TRI_SystemFree(symbol);\n\n#else\n void* stack_frames[50];\n size_t size, i;\n char** strings;\n\n size = backtrace(stack_frames, sizeof(stack_frames) \/ sizeof(void*));\n strings = backtrace_symbols(stack_frames, size);\n for (i = 0; i < size; i++) {\n std::stringstream ss;\n if (strings != nullptr) {\n char *mangled_name = nullptr, *offset_begin = nullptr, *offset_end = nullptr;\n\n \/\/ find parantheses and +address offset surrounding mangled name\n for (char *p = strings[i]; *p; ++p) {\n if (*p == '(') {\n mangled_name = p; \n }\n else if (*p == '+') {\n offset_begin = p;\n }\n else if (*p == ')') {\n offset_end = p;\n break;\n }\n }\n \/\/ TODO: osx demangling works a little bit different. \n \/\/ http:\/\/oroboro.com\/stack-trace-on-crash\/ \n \/\/ says it should look like that:\n \/\/#ifdef DARWIN\n \/\/ \/\/ OSX style stack trace\n \/\/ for ( char *p = symbollist[i]; *p; ++p )\n \/\/ {\n \/\/ if (( *p == '_' ) && ( *(p-1) == ' ' ))\n \/\/ begin_name = p-1;\n \/\/ else if ( *p == '+' )\n \/\/ begin_offset = p-1;\n \/\/ }\n \/\/\n \/\/ if ( begin_name && begin_offset && ( begin_name < begin_offset ))\n \/\/ {\n \/\/ *begin_name++ = '\\0';\n \/\/ *begin_offset++ = '\\0';\n \/\/\n \/\/ \/\/ mangled name is now in [begin_name, begin_offset) and caller\n \/\/ \/\/ offset in [begin_offset, end_offset). now apply\n \/\/ \/\/ __cxa_demangle():\n \/\/ int status;\n \/\/ char* ret = abi::__cxa_demangle( begin_name, &funcname[0],\n \/\/ &funcnamesize, &status );\n \/\/ if ( status == 0 ) \n \/\/ {\n \/\/ funcname = ret; \/\/ use possibly realloc()-ed string\n \/\/ fprintf( out, \" %-30s %-40s %s\\n\",\n \/\/ symbollist[i], funcname, begin_offset );\n \/\/ } else {\n \/\/ \/\/ demangling failed. Output function name as a C function with\n \/\/ \/\/ no arguments.\n \/\/ fprintf( out, \" %-30s %-38s() %s\\n\",\n \/\/ symbollist[i], begin_name, begin_offset );\n \/\/ }\n \/\/\n \/\/#else \/\/ !DARWIN - but is posix\n \/\/ if the line could be processed, attempt to demangle the symbol\n if (mangled_name && offset_begin && offset_end && \n mangled_name < offset_begin) {\n *mangled_name++ = '\\0';\n *offset_begin++ = '\\0';\n *offset_end++ = '\\0';\n int status = 0;\n char * demangled_name = abi::__cxa_demangle(mangled_name, 0, 0, &status);\n\n if (demangled_name != nullptr) {\n if (status == 0) {\n ss << stack_frames[i];\n btstr += strings[i] +\n std::string(\"() [\") +\n ss.str() +\n std::string(\"] \") +\n demangled_name +\n std::string(\"\\n\");\n }\n else {\n btstr += strings[i] +\n std::string(\"\\n\");\n }\n TRI_SystemFree(demangled_name);\n }\n }\n else {\n btstr += strings[i] +\n std::string(\"\\n\");\n }\n }\n else {\n ss << stack_frames[i];\n btstr += ss.str() +\n std::string(\"\\n\");\n }\n }\n if (strings != nullptr) {\n TRI_SystemFree(strings); \n }\n#endif\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief prints a backtrace on stderr\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_PrintBacktrace () {\n#if HAVE_BACKTRACE\n std::string out;\n TRI_GetBacktrace(out);\n fprintf(stderr, \"%s\", out.c_str());\n#endif\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- END-OF-FILE\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @page\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\"\n\/\/ End:\n<commit_msg>use ReadWriteLocker<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief debugging helpers\n\/\/\/\n\/\/\/ @file\n\/\/\/\n\/\/\/ DISCLAIMER\n\/\/\/\n\/\/\/ Copyright 2014 ArangoDB GmbH, Cologne, Germany\n\/\/\/ Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/\/ you may not use this file except in compliance with the License.\n\/\/\/ You may obtain a copy of the License at\n\/\/\/\n\/\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\/\n\/\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/\/ See the License for the specific language governing permissions and\n\/\/\/ limitations under the License.\n\/\/\/\n\/\/\/ Copyright holder is ArangoDB GmbH, Cologne, Germany\n\/\/\/\n\/\/\/ @author Jan Steemann\n\/\/\/ @author Copyright 2014, ArangoDB GmbH, Cologne, Germany\n\/\/\/ @author Copyright 2011-2013, triAGENS GmbH, Cologne, Germany\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"Basics\/Common.h\"\n#include \"Basics\/logging.h\"\n#include \"Basics\/ReadLocker.h\"\n#include \"Basics\/ReadWriteLock.h\"\n#include \"Basics\/WriteLocker.h\"\n\n#ifdef TRI_ENABLE_MAINTAINER_MODE\n#if HAVE_BACKTRACE\n#ifdef _WIN32\n#include <DbgHelp.h>\n#else\n#include <execinfo.h>\n#include <cxxabi.h>\n#endif\n#endif\n#endif\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- private variables\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief a global string containing the currently registered failure points\n\/\/\/ the string is a comma-separated list of point names\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic char* FailurePoints = nullptr;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief a read-write lock for thread-safe access to the failure-points list\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntriagens::basics::ReadWriteLock FailurePointsLock;\n\n#ifdef TRI_ENABLE_FAILURE_TESTS\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- private functions\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief make a delimited value from a string, so we can unambigiously\n\/\/\/ search for it (e.g. searching for just \"foo\" would find \"foo\" and \"foobar\",\n\/\/\/ so we'll be putting the value inside some delimiter: \",foo,\")\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic char* MakeValue (char const* value) {\n if (value == nullptr || strlen(value) == 0) {\n return nullptr;\n }\n\n char* delimited = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, strlen(value) + 3, false));\n\n if (delimited != nullptr) {\n memcpy(delimited + 1, value, strlen(value));\n delimited[0] = ',';\n delimited[strlen(value) + 1] = ',';\n delimited[strlen(value) + 2] = '\\0';\n }\n\n return delimited;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- public functions\n\/\/ -----------------------------------------------------------------------------\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief cause a segmentation violation\n\/\/\/ this is used for crash and recovery tests\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_SegfaultDebugging (char const* message) {\n LOG_WARNING(\"%s: summon Baal!\", message);\n \/\/ make sure the latest log messages are flushed\n TRI_ShutdownLogging(true);\n\n \/\/ and now crash\n#ifndef __APPLE__\n \/\/ on MacOS, the following statement makes the server hang but not crash\n *((char*) -1) = '!';\n#endif\n\n \/\/ ensure the process is terminated\n abort();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief check whether we should fail at a specific failure point\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nbool TRI_ShouldFailDebugging (char const* value) {\n char* found = nullptr;\n\n \/\/ try without the lock first (to speed things up)\n if (FailurePoints == nullptr) {\n return false;\n }\n\n READ_LOCKER(FailurePointsLock);\n\n if (FailurePoints != nullptr) {\n char* checkValue = MakeValue(value);\n\n if (checkValue != nullptr) {\n found = strstr(FailurePoints, checkValue);\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n }\n }\n\n return (found != nullptr);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief add a failure point\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_AddFailurePointDebugging (char const* value) {\n char* found;\n char* checkValue = MakeValue(value);\n\n if (checkValue == nullptr) {\n return;\n }\n\n WRITE_LOCKER(FailurePointsLock);\n\n if (FailurePoints == nullptr) {\n found = nullptr;\n }\n else {\n found = strstr(FailurePoints, checkValue);\n }\n\n if (found == nullptr) {\n \/\/ not yet found. so add it\n char* copy;\n\n LOG_WARNING(\"activating intentional failure point '%s'. the server will misbehave!\", value);\n size_t n = strlen(checkValue);\n\n if (FailurePoints == nullptr) {\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, n + 1, false));\n\n if (copy == nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n memcpy(copy, checkValue, n);\n copy[n] = '\\0';\n }\n else {\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, n + strlen(FailurePoints), false));\n\n if (copy == nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n memcpy(copy, FailurePoints, strlen(FailurePoints));\n memcpy(copy + strlen(FailurePoints) - 1, checkValue, n);\n copy[strlen(FailurePoints) + n - 1] = '\\0';\n }\n\n FailurePoints = copy;\n }\n\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief remove a failure points\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_RemoveFailurePointDebugging (char const* value) {\n WRITE_LOCKER(FailurePointsLock);\n\n if (FailurePoints == nullptr) {\n return;\n }\n\n char* checkValue = MakeValue(value);\n\n if (checkValue != nullptr) {\n char* found;\n char* copy;\n size_t n;\n\n found = strstr(FailurePoints, checkValue);\n\n if (found == nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n if (strlen(FailurePoints) - strlen(checkValue) <= 2) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n FailurePoints = nullptr;\n\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n copy = static_cast<char*>(TRI_Allocate(TRI_CORE_MEM_ZONE, strlen(FailurePoints) - strlen(checkValue) + 2, false));\n\n if (copy == nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n return;\n }\n\n \/\/ copy start of string\n n = found - FailurePoints;\n memcpy(copy, FailurePoints, n);\n\n \/\/ copy remainder of string\n memcpy(copy + n, found + strlen(checkValue) - 1, strlen(FailurePoints) - strlen(checkValue) - n + 1);\n\n copy[strlen(FailurePoints) - strlen(checkValue) + 1] = '\\0';\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n FailurePoints = copy;\n\n TRI_Free(TRI_CORE_MEM_ZONE, checkValue);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief clear all failure points\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_ClearFailurePointsDebugging () {\n WRITE_LOCKER(FailurePointsLock);\n\n if (FailurePoints != nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n }\n\n FailurePoints = nullptr;\n}\n\n#endif\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief initialise the debugging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_InitialiseDebugging () {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief shutdown the debugging\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_ShutdownDebugging () {\n if (FailurePoints != nullptr) {\n TRI_Free(TRI_CORE_MEM_ZONE, FailurePoints);\n }\n\n FailurePoints = nullptr;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief appends a backtrace to the string provided\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_GetBacktrace (std::string& btstr) {\n#if HAVE_BACKTRACE\n#ifdef _WIN32\n void * stack[100];\n unsigned short frames;\n SYMBOL_INFO * symbol;\n HANDLE process;\n\n process = GetCurrentProcess();\n\n SymInitialize(process, nullptr, true);\n\n frames = CaptureStackBackTrace(0, 100, stack, nullptr);\n symbol = (SYMBOL_INFO*) calloc(sizeof(SYMBOL_INFO) + 256 * sizeof(char), 1);\n\n if (symbol == nullptr) {\n \/\/ cannot allocate memory\n return;\n }\n\n symbol->MaxNameLen = 255;\n symbol->SizeOfStruct = sizeof(SYMBOL_INFO);\n\n for (unsigned int i = 0; i < frames; i++) {\n char address[64];\n SymFromAddr(process, (DWORD64) stack[i], 0, symbol);\n\n snprintf(address, sizeof(address), \"0x%0X\", (unsigned int) symbol->Address);\n btstr += std::to_string(frames - i - 1) + std::string(\": \") + symbol->Name + std::string(\" [\") + address + std::string(\"]\\n\");\n }\n\n TRI_SystemFree(symbol);\n\n#else\n void* stack_frames[50];\n size_t size, i;\n char** strings;\n\n size = backtrace(stack_frames, sizeof(stack_frames) \/ sizeof(void*));\n strings = backtrace_symbols(stack_frames, size);\n for (i = 0; i < size; i++) {\n std::stringstream ss;\n if (strings != nullptr) {\n char *mangled_name = nullptr, *offset_begin = nullptr, *offset_end = nullptr;\n\n \/\/ find parantheses and +address offset surrounding mangled name\n for (char *p = strings[i]; *p; ++p) {\n if (*p == '(') {\n mangled_name = p; \n }\n else if (*p == '+') {\n offset_begin = p;\n }\n else if (*p == ')') {\n offset_end = p;\n break;\n }\n }\n \/\/ TODO: osx demangling works a little bit different. \n \/\/ http:\/\/oroboro.com\/stack-trace-on-crash\/ \n \/\/ says it should look like that:\n \/\/#ifdef DARWIN\n \/\/ \/\/ OSX style stack trace\n \/\/ for ( char *p = symbollist[i]; *p; ++p )\n \/\/ {\n \/\/ if (( *p == '_' ) && ( *(p-1) == ' ' ))\n \/\/ begin_name = p-1;\n \/\/ else if ( *p == '+' )\n \/\/ begin_offset = p-1;\n \/\/ }\n \/\/\n \/\/ if ( begin_name && begin_offset && ( begin_name < begin_offset ))\n \/\/ {\n \/\/ *begin_name++ = '\\0';\n \/\/ *begin_offset++ = '\\0';\n \/\/\n \/\/ \/\/ mangled name is now in [begin_name, begin_offset) and caller\n \/\/ \/\/ offset in [begin_offset, end_offset). now apply\n \/\/ \/\/ __cxa_demangle():\n \/\/ int status;\n \/\/ char* ret = abi::__cxa_demangle( begin_name, &funcname[0],\n \/\/ &funcnamesize, &status );\n \/\/ if ( status == 0 ) \n \/\/ {\n \/\/ funcname = ret; \/\/ use possibly realloc()-ed string\n \/\/ fprintf( out, \" %-30s %-40s %s\\n\",\n \/\/ symbollist[i], funcname, begin_offset );\n \/\/ } else {\n \/\/ \/\/ demangling failed. Output function name as a C function with\n \/\/ \/\/ no arguments.\n \/\/ fprintf( out, \" %-30s %-38s() %s\\n\",\n \/\/ symbollist[i], begin_name, begin_offset );\n \/\/ }\n \/\/\n \/\/#else \/\/ !DARWIN - but is posix\n \/\/ if the line could be processed, attempt to demangle the symbol\n if (mangled_name && offset_begin && offset_end && \n mangled_name < offset_begin) {\n *mangled_name++ = '\\0';\n *offset_begin++ = '\\0';\n *offset_end++ = '\\0';\n int status = 0;\n char * demangled_name = abi::__cxa_demangle(mangled_name, 0, 0, &status);\n\n if (demangled_name != nullptr) {\n if (status == 0) {\n ss << stack_frames[i];\n btstr += strings[i] +\n std::string(\"() [\") +\n ss.str() +\n std::string(\"] \") +\n demangled_name +\n std::string(\"\\n\");\n }\n else {\n btstr += strings[i] +\n std::string(\"\\n\");\n }\n TRI_SystemFree(demangled_name);\n }\n }\n else {\n btstr += strings[i] +\n std::string(\"\\n\");\n }\n }\n else {\n ss << stack_frames[i];\n btstr += ss.str() +\n std::string(\"\\n\");\n }\n }\n if (strings != nullptr) {\n TRI_SystemFree(strings); \n }\n#endif\n#endif\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/ @brief prints a backtrace on stderr\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nvoid TRI_PrintBacktrace () {\n#if HAVE_BACKTRACE\n std::string out;\n TRI_GetBacktrace(out);\n fprintf(stderr, \"%s\", out.c_str());\n#endif\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ --SECTION-- END-OF-FILE\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ Local Variables:\n\/\/ mode: outline-minor\n\/\/ outline-regexp: \"\/\/\/ @brief\\\\|\/\/\/ {@inheritDoc}\\\\|\/\/\/ @page\\\\|\/\/ --SECTION--\\\\|\/\/\/ @\\\\}\"\n\/\/ End:\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Monteverdi2\n Language: C++\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See Copyright.txt for details.\n\n Monteverdi2 is distributed under the CeCILL licence version 2. See\n Licence_CeCILL_V2-en.txt or\n http:\/\/www.cecill.info\/licences\/Licence_CeCILL_V2-en.txt for more details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"mvdI18nApplication.h\"\n\n\n\/*****************************************************************************\/\n\/* INCLUDE SECTION *\/\n\n\/\/\n\/\/ Qt includes (sorted by alphabetic order)\n\/\/\/\/ Must be included before system\/custom includes.\n\n\/\/\n\/\/ System includes (sorted by alphabetic order)\n\n\/\/\n\/\/ OTB includes (sorted by alphabetic order)\n#include \"otbDEMHandler.h\"\n\n\/\/\n\/\/ Monteverdi includes (sorted by alphabetic order)\n#include \"mvdAlgorithm.h\"\n#include \"mvdDatasetModel.h\"\n#include \"mvdSystemError.h\"\n#include \"mvdVectorImageModel.h\"\n\nnamespace mvd\n{\n\/*\n TRANSLATOR mvd::I18nApplication\n\n Necessary for lupdate to be aware of C++ namespaces.\n\n Context comment for translator.\n*\/\n\n\/*****************************************************************************\/\n\/* CONSTANTS *\/\n\nconst char* I18nApplication::DEFAULT_CACHE_DIR_NAME = \"mvd2\";\n\nconst char* I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME = \"result\";\n\nconst char* I18nApplication::DATASET_EXT = \".ds\";\n\n\/*****************************************************************************\/\n\/* STATIC IMPLEMENTATION SECTION *\/\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::IsCacheDirValid( const QString& path )\n{\n QDir dir( path );\n QFileInfo fileInfo( path );\n\n return\n fileInfo.exists() &&\n fileInfo.isDir() &&\n fileInfo.isReadable() &&\n fileInfo.isWritable() &&\n dir.dirName()==I18nApplication::DEFAULT_CACHE_DIR_NAME;\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeDirTree( const QString& path, const QString& tree, QDir* dir )\n{\n QDir pathDir( path );\n\n \/*\n qDebug() << path;\n qDebug() << pathDir.currentPath();\n qDebug() << pathDir.path();\n *\/\n\n if( !pathDir.exists() )\n throw SystemError( ToStdString( QString( \"('%1')\" ).arg( path ) ) );\n\n QDir treeDir( pathDir.filePath( tree ) );\n if( treeDir.exists() )\n return false;\n\n if( !pathDir.mkpath( tree ) )\n throw SystemError(\n ToStdString(\n\tQString( \"('%1')\" ).arg( pathDir.filePath( tree ) )\n )\n );\n\n if( !pathDir.cd( tree ) )\n throw SystemError(\n ToStdString(\n\tQString( \"('%1')\" ).arg(\n\t pathDir.filePath( tree )\n\t)\n )\n );\n\n if( dir!=NULL )\n {\n *dir = pathDir;\n }\n\n return true;\n}\n\n\/*****************************************************************************\/\nvoid\nI18nApplication\n::DatasetPathName( QString& path,\n\t\t QString& name,\n\t\t const QString& imageFilename )\n{\n \/\/ convenient QFileInfo\n QFileInfo fileInfo( imageFilename );\n\n \/\/ Dataset is stored into application cache-directory.\n \/\/ E.g. '$HOME\/<CACHE_DIR>'\n path = I18nApplication::Instance()->GetCacheDir().path();\n \n \/\/ get the md5 of the filename\n QByteArray result = QCryptographicHash::hash(fileInfo.absoluteFilePath().toAscii(), \n QCryptographicHash::Md5);\n\n \/\/ store the md5 + the dataset extension at the end\n name = result.toHex() + I18nApplication::DATASET_EXT;\n}\n\n\/*****************************************************************************\/\nDatasetModel*\nI18nApplication\n::LoadDatasetModel( const QString& imageFilename,\n\t\t int width,\n\t\t int height )\n{\n \/\/ New model.\n DatasetModel* model = new DatasetModel();\n\n \/\/ Retrive path and name.\n QString path;\n QString name;\n\n I18nApplication::DatasetPathName( path, name, imageFilename );\n qDebug() << \"Dataset path: \" << path;\n qDebug() << \"Dataset name: \" << name;\n\n \/\/ Setup QObject\n model->setObjectName( QDir( path ).filePath( name ) );\n\n try\n {\n \/\/ try if the filename is valid\n VectorImageModel::EnsureValidImage(imageFilename);\n\n \/\/ get the basename from the filename to be used as an Alias\n QFileInfo finfo( imageFilename );\n\n \/\/ Build model (relink to cached data).\n DatasetModel::BuildContext context( path, name, finfo.baseName(), width, height );\n model->BuildModel( &context );\n\n \/\/ Load image if DatasetModel is empty.\n if( !model->HasSelectedImageModel() )\n {\n \/\/ Import image from filename given (w; h) size to choose\n \/\/ best-fit resolution.\n model->ImportImage( imageFilename, width, height );\n }\n }\n\n catch( std::exception& exc )\n {\n delete model;\n model = NULL;\n\n throw;\n }\n \n return model;\n}\n\n\/*****************************************************************************\/\n\/* CLASS IMPLEMENTATION SECTION *\/\n\n\/*******************************************************************************\/\nI18nApplication\n::I18nApplication( int& argc, char** argv ) :\n QApplication( argc, argv ),\n m_CacheDir(),\n m_Settings( NULL ),\n m_Model( NULL ),\n m_IsRunningFromBuildDir( false )\n{\n}\n\n\/*******************************************************************************\/\nI18nApplication\n::~I18nApplication()\n{\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::Initialize()\n{\n \/\/ Initialize internationlization.\n InitializeLocale();\n\n \/\/\n \/\/ Force numeric options of locale to \"C\"\n \/\/ See issue #635\n \/\/\n \/\/ TODO: Move into I18nApplication.\n setlocale( LC_NUMERIC, \"C\" );\n\n \/\/ Initialize QCoreApplication.\n virtual_InitializeCore();\n\n \/\/ Initialize settings.\n InitializeSettings();\n\n \/\/ Elevation setup\n ElevationSetup();\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::SetModel( AbstractModel* model )\n{\n emit AboutToChangeModel( model );\n\n delete m_Model;\n\n m_Model = model;\n\n if( model!=NULL )\n m_Model->setParent( this );\n\n emit ModelChanged( m_Model );\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeCacheDir( const QString& path )\n{\n qDebug() << this << \"::MakeCacheDir(\" << path << \")\";\n\n \/\/\n \/\/ Check path.\n QDir homeDir( path );\n\n if (!homeDir.exists())\n SystemError( ToStdString( QString( \"('%1')\" ).arg( homeDir.path() ) ) );\n\n \/\/\n \/\/ Create cache-dir.\n bool isNew = I18nApplication::MakeDirTree(\n homeDir.path(),\n I18nApplication::DEFAULT_CACHE_DIR_NAME,\n &m_CacheDir\n );\n\n \/\/\n \/\/ Remember cache-dir.\n StoreSettingsKey( \"cacheDir\", QDir::cleanPath( m_CacheDir.path() ) );\n\n \/\/\n \/\/ Construct result-dir path.\n I18nApplication::MakeDirTree(\n m_CacheDir.path(),\n I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME,\n &m_ResultsDir\n );\n\n \/\/\n \/\/ Result.\n return isNew;\n}\n\nvoid\nI18nApplication\n::ElevationSetup()\n{\n QSettings settings;\n\n otb::DEMHandler::Pointer demHandlerInstance = otb::DEMHandler::Instance();\n\n if(settings.contains(\"geoidPathActive\") && settings.value(\"geoidPathActive\").toBool())\n {\n qDebug() << \"Settings\/GeoidFile:\" <<settings.value(\"geoidPath\").toString() ;\n try\n {\n demHandlerInstance->OpenGeoidFile(settings.value(\"geoidPath\").toString().toStdString());\n }\n catch(itk::ExceptionObject & err)\n {\n qDebug() <<tr(\"An error occured while loading the geoid file, no geoid file will be used.\");\n qDebug()<<tr(\"Error: \")<<err.what();\n }\n }\n if(settings.contains(\"srtmDirActive\") && settings.value(\"srtmDirActive\").toBool())\n {\n qDebug() << \"Settings\/DEMDir:\" <<settings.value(\"srtmDir\").toString();\n try\n {\n demHandlerInstance->OpenDEMDirectory(settings.value(\"srtmDir\").toString().toStdString());\n }\n catch(itk::ExceptionObject & err)\n {\n qDebug() <<tr(\"An error occured while loading the DEM directory, no DEM will be used.\");\n qDebug()<<tr(\"Error: \") << err.what();\n }\n }\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeLocale()\n{\n QTextCodec::setCodecForTr( QTextCodec::codecForName( \"utf8\" ) );\n QTextCodec::setCodecForLocale( QTextCodec::codecForName(\"utf8\") );\n QTextCodec::setCodecForCStrings( QTextCodec::codecForName(\"utf8\") );\n\n \/\/\n \/\/ 1. default UI language is english (no translation).\n QLocale sys_lc( QLocale::system() );\n if( sys_lc.language() == QLocale::C ||\n ( sys_lc.language() == QLocale::English &&\n sys_lc.country() == QLocale::UnitedStates ) )\n {\n return;\n }\n\n \/\/\n \/\/ 2. Choose i18n path between build dir and install dir.\n\n \/\/ Begin from the executable path\n QDir bin_dir( QDir::cleanPath(QCoreApplication::applicationDirPath()) );\n qDebug() << tr( \"Executable dir : %1\" ).arg( bin_dir.path() );\n \n \/\/ Go up in the directory hierarchy until we have a candidate install prefix\n bool prefixFound = false;\n QDir prefix( bin_dir );\n while ( prefix.cdUp() )\n {\n if ( QDir(prefix).cd(Monteverdi2_INSTALL_BIN_DIR) )\n {\n prefixFound = true;\n break;\n }\n }\n \n if (prefixFound)\n {\n qDebug() << tr( \"Candidate install prefix found : %1\" ).arg( prefix.path() );\n }\n else\n {\n QString message( tr( \"Unable to locate translation files\" ) );\n qDebug() << message;\n QMessageBox::critical( NULL, tr( \"Critical error\" ), message );\n return;\n }\n \n QDir i18n_dir;\n\n \/\/ At this point the candidate install prefix can also be the build dir root\n if ( prefix.exists( Monteverdi2_CONFIGURE_FILE )\n && prefix.exists(\"i18n\") )\n {\n m_IsRunningFromBuildDir = true;\n\n \/\/ Report found build dir root\n qDebug() << tr( \"Running from build directory '%1'.\" ).arg( prefix.path() );\n \n \/\/ Go into the i18n dir (it exists we just checked for it)\n i18n_dir = prefix;\n i18n_dir.cd(\"i18n\");\n \n qDebug() << tr( \"Using translation dir '%1'.\" ).arg( i18n_dir.path() );\n }\n else\n {\n m_IsRunningFromBuildDir = false;\n \n \/\/ Report found install prefix\n qDebug() << tr( \"Running from install directory '%1'.\" ).arg( prefix.path() );\n\n \/\/ Go into the i18n dir configured at cmake-time\n i18n_dir = prefix;\n \n if (i18n_dir.cd(Monteverdi2_INSTALL_DATA_I18N_DIR))\n {\n qDebug() << tr( \"Using translation dir '%1'.\" ).arg( i18n_dir.path() );\n }\n else\n {\n QString message( tr( \"Failed to access translation-files directory '%1'\" )\n .arg(QDir::cleanPath(prefix.path()\n + QDir::separator()\n + Monteverdi2_INSTALL_DATA_I18N_DIR)) );\n qDebug() << message;\n QMessageBox::critical( NULL, tr( \"Critical error\" ), message );\n return;\n }\n }\n \n \/\/\n \/\/ 3.1 Stack Qt translator.\n LoadAndInstallTranslator(\n \"qt_\" + sys_lc.name(),\n QLibraryInfo::location( QLibraryInfo::TranslationsPath )\n );\n\n \/\/\n \/\/ 3.2 Stack Monteverdi2 translator as prioritary over Qt translator.\n LoadAndInstallTranslator( sys_lc.name(), i18n_dir.path() );\n\n \/\/ TODO: Record locale translation filename(s) used in UI component (e.g.\n \/\/ AboutDialog, Settings dialog, Information dialog etc.)\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeCore( const QString& appName,\n\t\t const QString& appVersion,\n\t\t const QString& orgName,\n\t\t const QString& orgDomain )\n{\n setObjectName( \"Application\" );\n\n \/\/\n \/\/ Setup application tags.\n \/\/\n QCoreApplication::setApplicationName(\n appName\n );\n QCoreApplication::setApplicationVersion(\n appVersion\n );\n\n \/\/\n \/\/ Setup organization tags.\n \/\/\n QCoreApplication::setOrganizationName( orgName );\n QCoreApplication::setOrganizationDomain( orgDomain );\n\n#ifndef Q_WS_MAC\n setWindowIcon( QIcon( QLatin1String( \":\/images\/application_icon\" ) ) );\n#endif\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeSettings()\n{\n \/\/\n \/\/ Create settings proxy.\n m_Settings = new QSettings(\n \/\/ TODO: Change QSettings::NativeFormat by QSettings::IniFormat.\n QSettings::NativeFormat,\n QSettings::UserScope,\n QCoreApplication::organizationName(),\n QCoreApplication::applicationName(),\n this\n );\n\n \/\/\n \/\/ Restore cache directory.\n QVariant value( RetrieveSettingsKey( \"cacheDir\" ) );\n\n if( !value.isNull() )\n {\n QString path( value.toString() );\n\n qDebug() << \"Settings\/cacheDir:\" << path;\n\n if( I18nApplication::IsCacheDirValid( path ) )\n {\n m_CacheDir.setPath( path );\n }\n }\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::LoadAndInstallTranslator(const QString& filename,\n const QString& directory,\n const QString& searchDelimiters,\n const QString& suffix )\n{\n QString filename_ext(\n filename +\n ( suffix.isNull()\n ? \".qm\"\n : suffix )\n );\n\n \/\/ (a) Do need to new QTranslator() here!\n QTranslator* lc_translator = new QTranslator( this );\n\n if( !lc_translator->load( filename, directory, searchDelimiters, suffix ) )\n {\n QString message(\n tr( \"Failed to load '%1' translation file from '%2'.\" )\n .arg( filename_ext )\n .arg( directory )\n );\n\n \/\/ TODO: Use log system to trace error while loading locale translation file.\n\n qWarning() << message;\n\n \/\/ TODO: morph into better HMI design.\n#if defined( _DEBUG )\n QMessageBox::warning( NULL, tr( \"Warning!\" ), message );\n#endif\n\n return false;\n }\n\n \/\/ (a) ...because QTranslator needs to be alive during the whole\n \/\/ lifespan of the application.\n QCoreApplication::installTranslator( lc_translator );\n\n QString message(\n tr( \"Successfully loaded '%1' translation file from '%2'.\" )\n .arg( filename_ext )\n .arg( directory )\n );\n\n \/\/ TODO: Log locale translation filename used.\n\n qDebug() << message;\n\n return true;\n}\n\n\/*******************************************************************************\/\n\/* SLOTS *\/\n\/*******************************************************************************\/\n\n} \/\/ end namespace 'mvd'\n<commit_msg>ENH: store resultsDir in settings<commit_after>\/*=========================================================================\n\n Program: Monteverdi2\n Language: C++\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See Copyright.txt for details.\n\n Monteverdi2 is distributed under the CeCILL licence version 2. See\n Licence_CeCILL_V2-en.txt or\n http:\/\/www.cecill.info\/licences\/Licence_CeCILL_V2-en.txt for more details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"mvdI18nApplication.h\"\n\n\n\/*****************************************************************************\/\n\/* INCLUDE SECTION *\/\n\n\/\/\n\/\/ Qt includes (sorted by alphabetic order)\n\/\/\/\/ Must be included before system\/custom includes.\n\n\/\/\n\/\/ System includes (sorted by alphabetic order)\n\n\/\/\n\/\/ OTB includes (sorted by alphabetic order)\n#include \"otbDEMHandler.h\"\n\n\/\/\n\/\/ Monteverdi includes (sorted by alphabetic order)\n#include \"mvdAlgorithm.h\"\n#include \"mvdDatasetModel.h\"\n#include \"mvdSystemError.h\"\n#include \"mvdVectorImageModel.h\"\n\nnamespace mvd\n{\n\/*\n TRANSLATOR mvd::I18nApplication\n\n Necessary for lupdate to be aware of C++ namespaces.\n\n Context comment for translator.\n*\/\n\n\/*****************************************************************************\/\n\/* CONSTANTS *\/\n\nconst char* I18nApplication::DEFAULT_CACHE_DIR_NAME = \"mvd2\";\n\nconst char* I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME = \"result\";\n\nconst char* I18nApplication::DATASET_EXT = \".ds\";\n\n\/*****************************************************************************\/\n\/* STATIC IMPLEMENTATION SECTION *\/\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::IsCacheDirValid( const QString& path )\n{\n QDir dir( path );\n QFileInfo fileInfo( path );\n\n return\n fileInfo.exists() &&\n fileInfo.isDir() &&\n fileInfo.isReadable() &&\n fileInfo.isWritable() &&\n dir.dirName()==I18nApplication::DEFAULT_CACHE_DIR_NAME;\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeDirTree( const QString& path, const QString& tree, QDir* dir )\n{\n QDir pathDir( path );\n\n \/*\n qDebug() << path;\n qDebug() << pathDir.currentPath();\n qDebug() << pathDir.path();\n *\/\n\n if( !pathDir.exists() )\n throw SystemError( ToStdString( QString( \"('%1')\" ).arg( path ) ) );\n\n QDir treeDir( pathDir.filePath( tree ) );\n if( treeDir.exists() )\n return false;\n\n if( !pathDir.mkpath( tree ) )\n throw SystemError(\n ToStdString(\n\tQString( \"('%1')\" ).arg( pathDir.filePath( tree ) )\n )\n );\n\n if( !pathDir.cd( tree ) )\n throw SystemError(\n ToStdString(\n\tQString( \"('%1')\" ).arg(\n\t pathDir.filePath( tree )\n\t)\n )\n );\n\n if( dir!=NULL )\n {\n *dir = pathDir;\n }\n\n return true;\n}\n\n\/*****************************************************************************\/\nvoid\nI18nApplication\n::DatasetPathName( QString& path,\n\t\t QString& name,\n\t\t const QString& imageFilename )\n{\n \/\/ convenient QFileInfo\n QFileInfo fileInfo( imageFilename );\n\n \/\/ Dataset is stored into application cache-directory.\n \/\/ E.g. '$HOME\/<CACHE_DIR>'\n path = I18nApplication::Instance()->GetCacheDir().path();\n \n \/\/ get the md5 of the filename\n QByteArray result = QCryptographicHash::hash(fileInfo.absoluteFilePath().toAscii(), \n QCryptographicHash::Md5);\n\n \/\/ store the md5 + the dataset extension at the end\n name = result.toHex() + I18nApplication::DATASET_EXT;\n}\n\n\/*****************************************************************************\/\nDatasetModel*\nI18nApplication\n::LoadDatasetModel( const QString& imageFilename,\n\t\t int width,\n\t\t int height )\n{\n \/\/ New model.\n DatasetModel* model = new DatasetModel();\n\n \/\/ Retrive path and name.\n QString path;\n QString name;\n\n I18nApplication::DatasetPathName( path, name, imageFilename );\n qDebug() << \"Dataset path: \" << path;\n qDebug() << \"Dataset name: \" << name;\n\n \/\/ Setup QObject\n model->setObjectName( QDir( path ).filePath( name ) );\n\n try\n {\n \/\/ try if the filename is valid\n VectorImageModel::EnsureValidImage(imageFilename);\n\n \/\/ get the basename from the filename to be used as an Alias\n QFileInfo finfo( imageFilename );\n\n \/\/ Build model (relink to cached data).\n DatasetModel::BuildContext context( path, name, finfo.baseName(), width, height );\n model->BuildModel( &context );\n\n \/\/ Load image if DatasetModel is empty.\n if( !model->HasSelectedImageModel() )\n {\n \/\/ Import image from filename given (w; h) size to choose\n \/\/ best-fit resolution.\n model->ImportImage( imageFilename, width, height );\n }\n }\n\n catch( std::exception& exc )\n {\n delete model;\n model = NULL;\n\n throw;\n }\n \n return model;\n}\n\n\/*****************************************************************************\/\n\/* CLASS IMPLEMENTATION SECTION *\/\n\n\/*******************************************************************************\/\nI18nApplication\n::I18nApplication( int& argc, char** argv ) :\n QApplication( argc, argv ),\n m_CacheDir(),\n m_Settings( NULL ),\n m_Model( NULL ),\n m_IsRunningFromBuildDir( false )\n{\n}\n\n\/*******************************************************************************\/\nI18nApplication\n::~I18nApplication()\n{\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::Initialize()\n{\n \/\/ Initialize internationlization.\n InitializeLocale();\n\n \/\/\n \/\/ Force numeric options of locale to \"C\"\n \/\/ See issue #635\n \/\/\n \/\/ TODO: Move into I18nApplication.\n setlocale( LC_NUMERIC, \"C\" );\n\n \/\/ Initialize QCoreApplication.\n virtual_InitializeCore();\n\n \/\/ Initialize settings.\n InitializeSettings();\n\n \/\/ Elevation setup\n ElevationSetup();\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::SetModel( AbstractModel* model )\n{\n emit AboutToChangeModel( model );\n\n delete m_Model;\n\n m_Model = model;\n\n if( model!=NULL )\n m_Model->setParent( this );\n\n emit ModelChanged( m_Model );\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::MakeCacheDir( const QString& path )\n{\n qDebug() << this << \"::MakeCacheDir(\" << path << \")\";\n\n \/\/\n \/\/ Check path.\n QDir homeDir( path );\n\n if (!homeDir.exists())\n SystemError( ToStdString( QString( \"('%1')\" ).arg( homeDir.path() ) ) );\n\n \/\/\n \/\/ Create cache-dir.\n bool isNew = I18nApplication::MakeDirTree(\n homeDir.path(),\n I18nApplication::DEFAULT_CACHE_DIR_NAME,\n &m_CacheDir\n );\n\n \/\/\n \/\/ Remember cache-dir.\n StoreSettingsKey( \"cacheDir\", QDir::cleanPath( m_CacheDir.path() ) );\n \n \/\/\n \/\/ Construct result-dir path.\n I18nApplication::MakeDirTree(\n m_CacheDir.path(),\n I18nApplication::DEFAULT_CACHE_RESULT_DIR_NAME,\n &m_ResultsDir\n );\n\n \/\/\n \/\/ Remember result-dir\n StoreSettingsKey( \"resultDir\", QDir::cleanPath( m_ResultsDir.path() ) );\n\n \/\/\n \/\/ Result.\n return isNew;\n}\n\nvoid\nI18nApplication\n::ElevationSetup()\n{\n QSettings settings;\n\n otb::DEMHandler::Pointer demHandlerInstance = otb::DEMHandler::Instance();\n\n if(settings.contains(\"geoidPathActive\") && settings.value(\"geoidPathActive\").toBool())\n {\n qDebug() << \"Settings\/GeoidFile:\" <<settings.value(\"geoidPath\").toString() ;\n try\n {\n demHandlerInstance->OpenGeoidFile(settings.value(\"geoidPath\").toString().toStdString());\n }\n catch(itk::ExceptionObject & err)\n {\n qDebug() <<tr(\"An error occured while loading the geoid file, no geoid file will be used.\");\n qDebug()<<tr(\"Error: \")<<err.what();\n }\n }\n if(settings.contains(\"srtmDirActive\") && settings.value(\"srtmDirActive\").toBool())\n {\n qDebug() << \"Settings\/DEMDir:\" <<settings.value(\"srtmDir\").toString();\n try\n {\n demHandlerInstance->OpenDEMDirectory(settings.value(\"srtmDir\").toString().toStdString());\n }\n catch(itk::ExceptionObject & err)\n {\n qDebug() <<tr(\"An error occured while loading the DEM directory, no DEM will be used.\");\n qDebug()<<tr(\"Error: \") << err.what();\n }\n }\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeLocale()\n{\n QTextCodec::setCodecForTr( QTextCodec::codecForName( \"utf8\" ) );\n QTextCodec::setCodecForLocale( QTextCodec::codecForName(\"utf8\") );\n QTextCodec::setCodecForCStrings( QTextCodec::codecForName(\"utf8\") );\n\n \/\/\n \/\/ 1. default UI language is english (no translation).\n QLocale sys_lc( QLocale::system() );\n if( sys_lc.language() == QLocale::C ||\n ( sys_lc.language() == QLocale::English &&\n sys_lc.country() == QLocale::UnitedStates ) )\n {\n return;\n }\n\n \/\/\n \/\/ 2. Choose i18n path between build dir and install dir.\n\n \/\/ Begin from the executable path\n QDir bin_dir( QDir::cleanPath(QCoreApplication::applicationDirPath()) );\n qDebug() << tr( \"Executable dir : %1\" ).arg( bin_dir.path() );\n \n \/\/ Go up in the directory hierarchy until we have a candidate install prefix\n bool prefixFound = false;\n QDir prefix( bin_dir );\n while ( prefix.cdUp() )\n {\n if ( QDir(prefix).cd(Monteverdi2_INSTALL_BIN_DIR) )\n {\n prefixFound = true;\n break;\n }\n }\n \n if (prefixFound)\n {\n qDebug() << tr( \"Candidate install prefix found : %1\" ).arg( prefix.path() );\n }\n else\n {\n QString message( tr( \"Unable to locate translation files\" ) );\n qDebug() << message;\n QMessageBox::critical( NULL, tr( \"Critical error\" ), message );\n return;\n }\n \n QDir i18n_dir;\n\n \/\/ At this point the candidate install prefix can also be the build dir root\n if ( prefix.exists( Monteverdi2_CONFIGURE_FILE )\n && prefix.exists(\"i18n\") )\n {\n m_IsRunningFromBuildDir = true;\n\n \/\/ Report found build dir root\n qDebug() << tr( \"Running from build directory '%1'.\" ).arg( prefix.path() );\n \n \/\/ Go into the i18n dir (it exists we just checked for it)\n i18n_dir = prefix;\n i18n_dir.cd(\"i18n\");\n \n qDebug() << tr( \"Using translation dir '%1'.\" ).arg( i18n_dir.path() );\n }\n else\n {\n m_IsRunningFromBuildDir = false;\n \n \/\/ Report found install prefix\n qDebug() << tr( \"Running from install directory '%1'.\" ).arg( prefix.path() );\n\n \/\/ Go into the i18n dir configured at cmake-time\n i18n_dir = prefix;\n \n if (i18n_dir.cd(Monteverdi2_INSTALL_DATA_I18N_DIR))\n {\n qDebug() << tr( \"Using translation dir '%1'.\" ).arg( i18n_dir.path() );\n }\n else\n {\n QString message( tr( \"Failed to access translation-files directory '%1'\" )\n .arg(QDir::cleanPath(prefix.path()\n + QDir::separator()\n + Monteverdi2_INSTALL_DATA_I18N_DIR)) );\n qDebug() << message;\n QMessageBox::critical( NULL, tr( \"Critical error\" ), message );\n return;\n }\n }\n \n \/\/\n \/\/ 3.1 Stack Qt translator.\n LoadAndInstallTranslator(\n \"qt_\" + sys_lc.name(),\n QLibraryInfo::location( QLibraryInfo::TranslationsPath )\n );\n\n \/\/\n \/\/ 3.2 Stack Monteverdi2 translator as prioritary over Qt translator.\n LoadAndInstallTranslator( sys_lc.name(), i18n_dir.path() );\n\n \/\/ TODO: Record locale translation filename(s) used in UI component (e.g.\n \/\/ AboutDialog, Settings dialog, Information dialog etc.)\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeCore( const QString& appName,\n\t\t const QString& appVersion,\n\t\t const QString& orgName,\n\t\t const QString& orgDomain )\n{\n setObjectName( \"Application\" );\n\n \/\/\n \/\/ Setup application tags.\n \/\/\n QCoreApplication::setApplicationName(\n appName\n );\n QCoreApplication::setApplicationVersion(\n appVersion\n );\n\n \/\/\n \/\/ Setup organization tags.\n \/\/\n QCoreApplication::setOrganizationName( orgName );\n QCoreApplication::setOrganizationDomain( orgDomain );\n\n#ifndef Q_WS_MAC\n setWindowIcon( QIcon( QLatin1String( \":\/images\/application_icon\" ) ) );\n#endif\n}\n\n\/*******************************************************************************\/\nvoid\nI18nApplication\n::InitializeSettings()\n{\n \/\/\n \/\/ Create settings proxy.\n m_Settings = new QSettings(\n \/\/ TODO: Change QSettings::NativeFormat by QSettings::IniFormat.\n QSettings::NativeFormat,\n QSettings::UserScope,\n QCoreApplication::organizationName(),\n QCoreApplication::applicationName(),\n this\n );\n\n \/\/\n \/\/ Restore cache directory.\n QVariant value( RetrieveSettingsKey( \"cacheDir\" ) );\n\n if( !value.isNull() )\n {\n QString path( value.toString() );\n\n qDebug() << \"Settings\/cacheDir:\" << path;\n\n if( I18nApplication::IsCacheDirValid( path ) )\n {\n m_CacheDir.setPath( path );\n }\n }\n\n \/\/\n \/\/ Restore result directory.\n QVariant resultDir( RetrieveSettingsKey( \"resultDir\" ) );\n\n if( !resultDir.isNull() )\n {\n QString resultPath( resultDir.toString() );\n\n qDebug() << \"Settings\/cacheDir:\" << resultPath;\n\n if( I18nApplication::IsCacheDirValid(resultDir ) )\n {\n m_ResultsDir.setPath( path );\n }\n }\n}\n\n\/*******************************************************************************\/\nbool\nI18nApplication\n::LoadAndInstallTranslator(const QString& filename,\n const QString& directory,\n const QString& searchDelimiters,\n const QString& suffix )\n{\n QString filename_ext(\n filename +\n ( suffix.isNull()\n ? \".qm\"\n : suffix )\n );\n\n \/\/ (a) Do need to new QTranslator() here!\n QTranslator* lc_translator = new QTranslator( this );\n\n if( !lc_translator->load( filename, directory, searchDelimiters, suffix ) )\n {\n QString message(\n tr( \"Failed to load '%1' translation file from '%2'.\" )\n .arg( filename_ext )\n .arg( directory )\n );\n\n \/\/ TODO: Use log system to trace error while loading locale translation file.\n\n qWarning() << message;\n\n \/\/ TODO: morph into better HMI design.\n#if defined( _DEBUG )\n QMessageBox::warning( NULL, tr( \"Warning!\" ), message );\n#endif\n\n return false;\n }\n\n \/\/ (a) ...because QTranslator needs to be alive during the whole\n \/\/ lifespan of the application.\n QCoreApplication::installTranslator( lc_translator );\n\n QString message(\n tr( \"Successfully loaded '%1' translation file from '%2'.\" )\n .arg( filename_ext )\n .arg( directory )\n );\n\n \/\/ TODO: Log locale translation filename used.\n\n qDebug() << message;\n\n return true;\n}\n\n\/*******************************************************************************\/\n\/* SLOTS *\/\n\/*******************************************************************************\/\n\n} \/\/ end namespace 'mvd'\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkMaskImageFilter.h\"\n#include \"mitkImageTimeSelector.h\"\n#include \"mitkTimeHelper.h\"\n#include \"mitkProperties.h\"\n\n#include \"mitkImageToItk.h\"\n\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n\nmitk::MaskImageFilter::MaskImageFilter() : m_Mask(NULL)\n{\n this->SetNumberOfInputs(2);\n this->SetNumberOfRequiredInputs(2);\n m_InputTimeSelector = mitk::ImageTimeSelector::New();\n m_MaskTimeSelector = mitk::ImageTimeSelector::New();\n m_OutputTimeSelector = mitk::ImageTimeSelector::New();\n}\n\nmitk::MaskImageFilter::~MaskImageFilter()\n{\n\n}\n\nvoid mitk::MaskImageFilter::SetMask( const mitk::Image* mask ) \n{\n\t\/\/ Process object is not const-correct so the const_cast is required here\n m_Mask = const_cast< mitk::Image * >( mask );\n\tthis->ProcessObject::SetNthInput(1, m_Mask );\n}\n\nconst mitk::Image* mitk::MaskImageFilter::GetMask() const \n{\n return m_Mask;\n}\n\nvoid mitk::MaskImageFilter::GenerateInputRequestedRegion()\n{\n Superclass::GenerateInputRequestedRegion();\n\n mitk::Image* output = this->GetOutput();\n mitk::Image* input = const_cast< mitk::Image * > ( this->GetInput() );\n mitk::Image* mask = m_Mask ;\n if((output->IsInitialized()==false) || (mask == NULL) || (mask->GetTimeSlicedGeometry()->GetTimeSteps() == 0))\n return;\n\n input->SetRequestedRegionToLargestPossibleRegion();\n mask->SetRequestedRegionToLargestPossibleRegion();\n\n GenerateTimeInInputRegion(output, input);\n GenerateTimeInInputRegion(output, mask);\n}\n\nvoid mitk::MaskImageFilter::GenerateOutputInformation()\n{\n mitk::Image::ConstPointer input = this->GetInput();\n mitk::Image::Pointer output = this->GetOutput();\n\n if ((output->IsInitialized()) && (this->GetMTime() <= m_TimeOfHeaderInitialization.GetMTime()))\n return;\n\n itkDebugMacro(<<\"GenerateOutputInformation()\");\n\n unsigned int i;\n unsigned int *tmpDimensions = new unsigned int[input->GetDimension()];\n\n for(i=0;i<input->GetDimension();++i)\n tmpDimensions[i]=input->GetDimension(i);\n\n output->Initialize(input->GetPixelType(),\n input->GetDimension(),\n tmpDimensions,\n input->GetNumberOfChannels());\n\n delete [] tmpDimensions;\n\n output->SetGeometry(static_cast<mitk::Geometry3D*>(input->GetGeometry()->Clone().GetPointer()));\n\n output->SetPropertyList(input->GetPropertyList()->Clone()); \n\n m_TimeOfHeaderInitialization.Modified();\n}\n\ntemplate < typename TPixel, unsigned int VImageDimension >\nvoid mitk::_InternalComputeMask(itk::Image<TPixel, VImageDimension>* inputItkImage, mitk::MaskImageFilter* MaskImageFilter)\n{\n typedef itk::Image<TPixel, VImageDimension> ItkInputImageType;\n\n typedef itk::Image<unsigned char, VImageDimension> ItkMaskImageType;\n typedef itk::Image<TPixel, VImageDimension> ItkOutputImageType;\n\n typedef itk::ImageRegionConstIterator< ItkInputImageType > ItkInputImageIteratorType;\n typedef itk::ImageRegionConstIterator< ItkMaskImageType > ItkMaskImageIteratorType;\n typedef itk::ImageRegionIteratorWithIndex< ItkOutputImageType > ItkOutputImageIteratorType;\n\n typename mitk::ImageToItk<ItkMaskImageType>::Pointer maskimagetoitk = mitk::ImageToItk<ItkMaskImageType>::New();\n maskimagetoitk->SetInput(MaskImageFilter->m_MaskTimeSelector->GetOutput());\n maskimagetoitk->Update();\n typename ItkMaskImageType::Pointer maskItkImage = maskimagetoitk->GetOutput();\n\n typename mitk::ImageToItk<ItkOutputImageType>::Pointer outputimagetoitk = mitk::ImageToItk<ItkOutputImageType>::New();\n outputimagetoitk->SetInput(MaskImageFilter->m_OutputTimeSelector->GetOutput());\n outputimagetoitk->Update();\n typename ItkOutputImageType::Pointer outputItkImage = outputimagetoitk->GetOutput();\n\n \/\/ create the iterators\n ItkInputImageType::RegionType inputRegionOfInterest = inputItkImage->GetLargestPossibleRegion();\n ItkInputImageIteratorType inputIt( inputItkImage, inputRegionOfInterest );\n ItkMaskImageIteratorType maskIt ( maskItkImage, inputRegionOfInterest );\n ItkOutputImageIteratorType outputIt( outputItkImage, inputRegionOfInterest );\n\n typename ItkOutputImageType::PixelType m_OutsideValue = itk::NumericTraits<typename ItkOutputImageType::PixelType>::min();\n\n for ( inputIt.GoToBegin(), maskIt.GoToBegin(), outputIt.GoToBegin(); !inputIt.IsAtEnd() && !maskIt.IsAtEnd(); ++inputIt, ++maskIt, ++outputIt)\n {\n if ( maskIt.Get() > itk::NumericTraits<typename ItkMaskImageType::PixelType>::Zero )\n {\n outputIt.Set(inputIt.Get());\n }\n else\n {\n outputIt.Set(m_OutsideValue);\n }\n }\n}\n\n#include \"mitkImageAccessByItk.h\"\n\nvoid mitk::MaskImageFilter::GenerateData()\n{\n mitk::Image::ConstPointer input = this->GetInput();\n mitk::Image::ConstPointer mask = m_Mask;\n mitk::Image::Pointer output = this->GetOutput();\n\n if((output->IsInitialized()==false) || (mask.IsNull()) || (mask->GetTimeSlicedGeometry()->GetTimeSteps() == 0))\n return;\n\n m_InputTimeSelector->SetInput(input);\n m_MaskTimeSelector->SetInput(mask);\n m_OutputTimeSelector->SetInput(this->GetOutput());\n\n mitk::Image::RegionType outputRegion = output->GetRequestedRegion();\n const mitk::TimeSlicedGeometry *outputTimeGeometry = output->GetTimeSlicedGeometry();\n const mitk::TimeSlicedGeometry *inputTimeGeometry = input->GetTimeSlicedGeometry();\n const mitk::TimeSlicedGeometry *maskTimeGeometry = mask->GetTimeSlicedGeometry();\n ScalarType timeInMS;\n\n int timestep=0;\n int tstart=outputRegion.GetIndex(3);\n int tmax=tstart+outputRegion.GetSize(3);\n\n int t;\n for(t=tstart;t<tmax;++t)\n {\n timeInMS = outputTimeGeometry->TimeStepToMS( t );\n\n timestep = inputTimeGeometry->MSToTimeStep( timeInMS );\n\n m_InputTimeSelector->SetTimeNr(timestep);\n m_InputTimeSelector->UpdateLargestPossibleRegion();\n m_OutputTimeSelector->SetTimeNr(t);\n m_OutputTimeSelector->UpdateLargestPossibleRegion();\n\n timestep = maskTimeGeometry->MSToTimeStep( timeInMS );\n m_MaskTimeSelector->SetTimeNr(timestep);\n m_MaskTimeSelector->UpdateLargestPossibleRegion();\n\n AccessByItk_1(m_InputTimeSelector->GetOutput(),_InternalComputeMask,this);\n }\n\n m_TimeOfHeaderInitialization.Modified();\n}\n<commit_msg>FIX: linux compatibility<commit_after>\/*=========================================================================\n\nProgram: Medical Imaging & Interaction Toolkit\nModule: $RCSfile$\nLanguage: C++\nDate: $Date$\nVersion: $Revision$\n\nCopyright (c) German Cancer Research Center, Division of Medical and\nBiological Informatics. All rights reserved.\nSee MITKCopyright.txt or http:\/\/www.mitk.org\/copyright.html for details.\n\nThis software is distributed WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\nPURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n\n#include \"mitkMaskImageFilter.h\"\n#include \"mitkImageTimeSelector.h\"\n#include \"mitkTimeHelper.h\"\n#include \"mitkProperties.h\"\n\n#include \"mitkImageToItk.h\"\n\n#include \"itkImageRegionConstIterator.h\"\n#include \"itkImageRegionIteratorWithIndex.h\"\n\nmitk::MaskImageFilter::MaskImageFilter() : m_Mask(NULL)\n{\n this->SetNumberOfInputs(2);\n this->SetNumberOfRequiredInputs(2);\n m_InputTimeSelector = mitk::ImageTimeSelector::New();\n m_MaskTimeSelector = mitk::ImageTimeSelector::New();\n m_OutputTimeSelector = mitk::ImageTimeSelector::New();\n}\n\nmitk::MaskImageFilter::~MaskImageFilter()\n{\n\n}\n\nvoid mitk::MaskImageFilter::SetMask( const mitk::Image* mask ) \n{\n\t\/\/ Process object is not const-correct so the const_cast is required here\n m_Mask = const_cast< mitk::Image * >( mask );\n\tthis->ProcessObject::SetNthInput(1, m_Mask );\n}\n\nconst mitk::Image* mitk::MaskImageFilter::GetMask() const \n{\n return m_Mask;\n}\n\nvoid mitk::MaskImageFilter::GenerateInputRequestedRegion()\n{\n Superclass::GenerateInputRequestedRegion();\n\n mitk::Image* output = this->GetOutput();\n mitk::Image* input = const_cast< mitk::Image * > ( this->GetInput() );\n mitk::Image* mask = m_Mask ;\n if((output->IsInitialized()==false) || (mask == NULL) || (mask->GetTimeSlicedGeometry()->GetTimeSteps() == 0))\n return;\n\n input->SetRequestedRegionToLargestPossibleRegion();\n mask->SetRequestedRegionToLargestPossibleRegion();\n\n GenerateTimeInInputRegion(output, input);\n GenerateTimeInInputRegion(output, mask);\n}\n\nvoid mitk::MaskImageFilter::GenerateOutputInformation()\n{\n mitk::Image::ConstPointer input = this->GetInput();\n mitk::Image::Pointer output = this->GetOutput();\n\n if ((output->IsInitialized()) && (this->GetMTime() <= m_TimeOfHeaderInitialization.GetMTime()))\n return;\n\n itkDebugMacro(<<\"GenerateOutputInformation()\");\n\n unsigned int i;\n unsigned int *tmpDimensions = new unsigned int[input->GetDimension()];\n\n for(i=0;i<input->GetDimension();++i)\n tmpDimensions[i]=input->GetDimension(i);\n\n output->Initialize(input->GetPixelType(),\n input->GetDimension(),\n tmpDimensions,\n input->GetNumberOfChannels());\n\n delete [] tmpDimensions;\n\n output->SetGeometry(static_cast<mitk::Geometry3D*>(input->GetGeometry()->Clone().GetPointer()));\n\n output->SetPropertyList(input->GetPropertyList()->Clone()); \n\n m_TimeOfHeaderInitialization.Modified();\n}\n\ntemplate < typename TPixel, unsigned int VImageDimension >\nvoid mitk::_InternalComputeMask(itk::Image<TPixel, VImageDimension>* inputItkImage, mitk::MaskImageFilter* MaskImageFilter)\n{\n typedef itk::Image<TPixel, VImageDimension> ItkInputImageType;\n\n typedef itk::Image<unsigned char, VImageDimension> ItkMaskImageType;\n typedef itk::Image<TPixel, VImageDimension> ItkOutputImageType;\n\n typedef itk::ImageRegionConstIterator< ItkInputImageType > ItkInputImageIteratorType;\n typedef itk::ImageRegionConstIterator< ItkMaskImageType > ItkMaskImageIteratorType;\n typedef itk::ImageRegionIteratorWithIndex< ItkOutputImageType > ItkOutputImageIteratorType;\n\n typename mitk::ImageToItk<ItkMaskImageType>::Pointer maskimagetoitk = mitk::ImageToItk<ItkMaskImageType>::New();\n maskimagetoitk->SetInput(MaskImageFilter->m_MaskTimeSelector->GetOutput());\n maskimagetoitk->Update();\n typename ItkMaskImageType::Pointer maskItkImage = maskimagetoitk->GetOutput();\n\n typename mitk::ImageToItk<ItkOutputImageType>::Pointer outputimagetoitk = mitk::ImageToItk<ItkOutputImageType>::New();\n outputimagetoitk->SetInput(MaskImageFilter->m_OutputTimeSelector->GetOutput());\n outputimagetoitk->Update();\n typename ItkOutputImageType::Pointer outputItkImage = outputimagetoitk->GetOutput();\n\n \/\/ create the iterators\n typename ItkInputImageType::RegionType inputRegionOfInterest = inputItkImage->GetLargestPossibleRegion();\n ItkInputImageIteratorType inputIt( inputItkImage, inputRegionOfInterest );\n ItkMaskImageIteratorType maskIt ( maskItkImage, inputRegionOfInterest );\n ItkOutputImageIteratorType outputIt( outputItkImage, inputRegionOfInterest );\n\n typename ItkOutputImageType::PixelType m_OutsideValue = itk::NumericTraits<typename ItkOutputImageType::PixelType>::min();\n\n for ( inputIt.GoToBegin(), maskIt.GoToBegin(), outputIt.GoToBegin(); !inputIt.IsAtEnd() && !maskIt.IsAtEnd(); ++inputIt, ++maskIt, ++outputIt)\n {\n if ( maskIt.Get() > itk::NumericTraits<typename ItkMaskImageType::PixelType>::Zero )\n {\n outputIt.Set(inputIt.Get());\n }\n else\n {\n outputIt.Set(m_OutsideValue);\n }\n }\n}\n\n#include \"mitkImageAccessByItk.h\"\n\nvoid mitk::MaskImageFilter::GenerateData()\n{\n mitk::Image::ConstPointer input = this->GetInput();\n mitk::Image::Pointer mask = m_Mask;\n mitk::Image::Pointer output = this->GetOutput();\n\n if((output->IsInitialized()==false) || (mask.IsNull()) || (mask->GetTimeSlicedGeometry()->GetTimeSteps() == 0))\n return;\n\n m_InputTimeSelector->SetInput(input);\n m_MaskTimeSelector->SetInput(mask);\n m_OutputTimeSelector->SetInput(this->GetOutput());\n\n mitk::Image::RegionType outputRegion = output->GetRequestedRegion();\n const mitk::TimeSlicedGeometry *outputTimeGeometry = output->GetTimeSlicedGeometry();\n const mitk::TimeSlicedGeometry *inputTimeGeometry = input->GetTimeSlicedGeometry();\n const mitk::TimeSlicedGeometry *maskTimeGeometry = mask->GetTimeSlicedGeometry();\n ScalarType timeInMS;\n\n int timestep=0;\n int tstart=outputRegion.GetIndex(3);\n int tmax=tstart+outputRegion.GetSize(3);\n\n int t;\n for(t=tstart;t<tmax;++t)\n {\n timeInMS = outputTimeGeometry->TimeStepToMS( t );\n\n timestep = inputTimeGeometry->MSToTimeStep( timeInMS );\n\n m_InputTimeSelector->SetTimeNr(timestep);\n m_InputTimeSelector->UpdateLargestPossibleRegion();\n m_OutputTimeSelector->SetTimeNr(t);\n m_OutputTimeSelector->UpdateLargestPossibleRegion();\n\n timestep = maskTimeGeometry->MSToTimeStep( timeInMS );\n m_MaskTimeSelector->SetTimeNr(timestep);\n m_MaskTimeSelector->UpdateLargestPossibleRegion();\n\n AccessByItk_1(m_InputTimeSelector->GetOutput(),_InternalComputeMask,this);\n }\n\n m_TimeOfHeaderInitialization.Modified();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Actions\/PlayCard.hpp>\n#include <Rosetta\/Actions\/Targeting.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Tasks\/Tasks.hpp>\n\nnamespace RosettaStone::Generic\n{\nvoid PlayCard(Player& player, Entity* source, Character* target, int fieldPos)\n{\n \/\/ Verify mana is sufficient\n if (source->card.cost > player.currentMana)\n {\n return;\n }\n\n \/\/ Verify target is valid\n if (!IsValidTarget(source, target))\n {\n return;\n }\n\n \/\/ Spend mana to play cards\n if (source->card.cost > 0)\n {\n player.currentMana -= source->card.cost;\n }\n\n \/\/ Erase from player's hand\n player.GetHand().RemoveCard(*source);\n\n \/\/ Set card's owner\n source->SetOwner(player);\n\n \/\/ Pass to sub-logic\n switch (source->card.cardType)\n {\n case CardType::MINION:\n {\n const auto minion = dynamic_cast<Minion*>(source);\n PlayMinion(player, minion, target, fieldPos);\n break;\n }\n case CardType::SPELL:\n {\n const auto spell = dynamic_cast<Spell*>(source);\n PlaySpell(player, spell, target);\n break;\n }\n case CardType::WEAPON:\n {\n const auto weapon = dynamic_cast<Weapon*>(source);\n PlayWeapon(player, weapon, target);\n break;\n }\n default:\n throw std::invalid_argument(\n \"Generic::PlayCard() - Invalid card type!\");\n }\n}\n\nvoid PlayMinion(Player& player, Minion* minion, Character* target, int fieldPos)\n{\n (void)target;\n\n \/\/ Add minion to battlefield\n player.GetField().AddMinion(*minion, fieldPos);\n\n \/\/ Apply card mechanics tags\n for (const auto tags : minion->card.gameTags)\n {\n minion->SetGameTag(tags.first, tags.second);\n }\n\n \/\/ Process power tasks\n for (auto& powerTask : minion->card.power.GetPowerTask())\n {\n if (powerTask == nullptr)\n {\n continue;\n }\n\n powerTask->SetSource(minion);\n powerTask->SetTarget(target);\n powerTask->Run(player);\n }\n\n player.GetGame()->ProcessDestroyAndUpdateAura();\n}\n\nvoid PlaySpell(Player& player, Spell* spell, Character* target)\n{\n \/\/ Process power tasks\n for (auto& powerTask : spell->card.power.GetPowerTask())\n {\n powerTask->SetSource(spell);\n powerTask->SetTarget(target);\n powerTask->Run(player);\n }\n\n player.GetGame()->ProcessDestroyAndUpdateAura();\n}\n\nvoid PlayWeapon(Player& player, Weapon* weapon, Character* target)\n{\n (void)target;\n\n player.GetHero()->AddWeapon(*weapon);\n}\n\nbool IsPlayableByCardReq(Entity* source)\n{\n for (auto& requirement : source->card.playRequirements)\n {\n switch (requirement.first)\n {\n case PlayReq::REQ_MINIMUM_ENEMY_MINIONS:\n {\n auto& opField = source->GetOwner().GetOpponent().GetField();\n if (opField.GetNumOfMinions() < requirement.second)\n {\n return false;\n }\n break;\n }\n case PlayReq::REQ_MINION_TARGET:\n case PlayReq::REQ_ENEMY_TARGET:\n case PlayReq::REQ_NONSELF_TARGET:\n break;\n default:\n break;\n }\n }\n\n return true;\n}\n} \/\/ namespace RosettaStone::Generic\n<commit_msg>feat(card-impl): Add code to call IsPlayableByCardReq() function<commit_after>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Actions\/PlayCard.hpp>\n#include <Rosetta\/Actions\/Targeting.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Tasks\/Tasks.hpp>\n\nnamespace RosettaStone::Generic\n{\nvoid PlayCard(Player& player, Entity* source, Character* target, int fieldPos)\n{\n \/\/ Verify mana is sufficient\n if (source->card.cost > player.currentMana)\n {\n return;\n }\n\n \/\/ Check if we can play this card and the target is valid\n if (!IsPlayableByCardReq(source) || !IsValidTarget(source, target))\n {\n return;\n }\n\n \/\/ Spend mana to play cards\n if (source->card.cost > 0)\n {\n player.currentMana -= source->card.cost;\n }\n\n \/\/ Erase from player's hand\n player.GetHand().RemoveCard(*source);\n\n \/\/ Set card's owner\n source->SetOwner(player);\n\n \/\/ Pass to sub-logic\n switch (source->card.cardType)\n {\n case CardType::MINION:\n {\n const auto minion = dynamic_cast<Minion*>(source);\n PlayMinion(player, minion, target, fieldPos);\n break;\n }\n case CardType::SPELL:\n {\n const auto spell = dynamic_cast<Spell*>(source);\n PlaySpell(player, spell, target);\n break;\n }\n case CardType::WEAPON:\n {\n const auto weapon = dynamic_cast<Weapon*>(source);\n PlayWeapon(player, weapon, target);\n break;\n }\n default:\n throw std::invalid_argument(\n \"Generic::PlayCard() - Invalid card type!\");\n }\n}\n\nvoid PlayMinion(Player& player, Minion* minion, Character* target, int fieldPos)\n{\n (void)target;\n\n \/\/ Add minion to battlefield\n player.GetField().AddMinion(*minion, fieldPos);\n\n \/\/ Apply card mechanics tags\n for (const auto tags : minion->card.gameTags)\n {\n minion->SetGameTag(tags.first, tags.second);\n }\n\n \/\/ Process power tasks\n for (auto& powerTask : minion->card.power.GetPowerTask())\n {\n if (powerTask == nullptr)\n {\n continue;\n }\n\n powerTask->SetSource(minion);\n powerTask->SetTarget(target);\n powerTask->Run(player);\n }\n\n player.GetGame()->ProcessDestroyAndUpdateAura();\n}\n\nvoid PlaySpell(Player& player, Spell* spell, Character* target)\n{\n \/\/ Process power tasks\n for (auto& powerTask : spell->card.power.GetPowerTask())\n {\n powerTask->SetSource(spell);\n powerTask->SetTarget(target);\n powerTask->Run(player);\n }\n\n player.GetGame()->ProcessDestroyAndUpdateAura();\n}\n\nvoid PlayWeapon(Player& player, Weapon* weapon, Character* target)\n{\n (void)target;\n\n player.GetHero()->AddWeapon(*weapon);\n}\n\nbool IsPlayableByCardReq(Entity* source)\n{\n for (auto& requirement : source->card.playRequirements)\n {\n switch (requirement.first)\n {\n case PlayReq::REQ_MINIMUM_ENEMY_MINIONS:\n {\n auto& opField = source->GetOwner().GetOpponent().GetField();\n if (opField.GetNumOfMinions() < requirement.second)\n {\n return false;\n }\n break;\n }\n case PlayReq::REQ_MINION_TARGET:\n case PlayReq::REQ_ENEMY_TARGET:\n case PlayReq::REQ_NONSELF_TARGET:\n break;\n default:\n break;\n }\n }\n\n return true;\n}\n} \/\/ namespace RosettaStone::Generic\n<|endoftext|>"} {"text":"<commit_before>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Commons\/Utils.hpp>\n#include <Rosetta\/Enchants\/Trigger.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Models\/Enchantment.hpp>\n#include <Rosetta\/Tasks\/ITask.hpp>\n\n#include <stdexcept>\n\nnamespace RosettaStone\n{\nTrigger::Trigger(TriggerType type) : m_triggerType(type)\n{\n switch (type)\n {\n case TriggerType::PLAY_CARD:\n m_sequenceType = SequenceType::PLAY_CARD;\n break;\n case TriggerType::CAST_SPELL:\n case TriggerType::AFTER_CAST:\n m_sequenceType = SequenceType::PLAY_SPELL;\n break;\n case TriggerType::TARGET:\n m_sequenceType = SequenceType::TARGET;\n break;\n case TriggerType::TURN_END:\n fastExecution = true;\n break;\n default:\n m_sequenceType = SequenceType::NONE;\n }\n}\n\nTrigger::Trigger(Trigger& prototype, Entity& owner)\n : triggerSource(prototype.triggerSource),\n tasks(prototype.tasks),\n condition(prototype.condition),\n fastExecution(prototype.fastExecution),\n removeAfterTriggered(prototype.removeAfterTriggered),\n m_owner(&owner),\n m_triggerType(prototype.m_triggerType),\n m_triggerActivation(prototype.m_triggerActivation),\n m_sequenceType(prototype.m_sequenceType)\n{\n \/\/ Do nothing\n}\n\nvoid Trigger::Activate(Entity* source, TriggerActivation activation, bool cloning)\n{\n if (!cloning && activation != m_triggerActivation)\n {\n if (m_triggerActivation != TriggerActivation::HAND_OR_PLAY)\n {\n return;\n }\n\n if (activation == TriggerActivation::DECK)\n {\n return;\n }\n }\n\n auto* instance = new Trigger(*this, *source);\n Game* game = source->owner->GetGame();\n\n source->activatedTrigger = instance;\n\n auto triggerFunc = [instance](Player* p, Entity* e) {\n instance->Process(p, e);\n };\n\n if (m_sequenceType != SequenceType::NONE)\n {\n source->owner->GetGame()->triggers.emplace_back(instance);\n }\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n game->triggerManager.startTurnTrigger = std::move(triggerFunc);\n break;\n case TriggerType::TURN_END:\n game->triggerManager.endTurnTrigger = std::move(triggerFunc);\n break;\n case TriggerType::PLAY_CARD:\n game->triggerManager.playCardTrigger = std::move(triggerFunc);\n break;\n case TriggerType::CAST_SPELL:\n game->triggerManager.castSpellTrigger = std::move(triggerFunc);\n break;\n case TriggerType::AFTER_CAST:\n game->triggerManager.afterCastTrigger = std::move(triggerFunc);\n break;\n case TriggerType::HEAL:\n game->triggerManager.healTrigger = std::move(triggerFunc);\n break;\n case TriggerType::ATTACK:\n game->triggerManager.attackTrigger = std::move(triggerFunc);\n break;\n case TriggerType::AFTER_ATTACK:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n source->owner->GetHero()->afterAttackTrigger =\n std::move(triggerFunc);\n break;\n }\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(source);\n minion->afterAttackTrigger = std::move(triggerFunc);\n break;\n }\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment = dynamic_cast<Enchantment*>(source);\n auto minion =\n dynamic_cast<Minion*>(enchantment->GetTarget());\n minion->afterAttackTrigger = std::move(triggerFunc);\n break;\n }\n default:\n break;\n }\n break;\n case TriggerType::SUMMON:\n game->triggerManager.summonTrigger = std::move(triggerFunc);\n break;\n case TriggerType::PREDAMAGE:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n source->owner->GetHero()->preDamageTrigger =\n std::move(triggerFunc);\n break;\n }\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(source);\n minion->preDamageTrigger = std::move(triggerFunc);\n break;\n }\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment = dynamic_cast<Enchantment*>(source);\n auto minion =\n dynamic_cast<Minion*>(enchantment->GetTarget());\n minion->preDamageTrigger = std::move(triggerFunc);\n break;\n }\n default:\n break;\n }\n break;\n case TriggerType::TAKE_DAMAGE:\n game->triggerManager.takeDamageTrigger = std::move(triggerFunc);\n break;\n case TriggerType::TARGET:\n game->triggerManager.targetTrigger = std::move(triggerFunc);\n break;\n default:\n throw std::invalid_argument(\n \"Trigger::Activate() - Invalid trigger type!\");\n }\n}\n\nvoid Trigger::Remove() const\n{\n Game* game = m_owner->owner->GetGame();\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n game->triggerManager.startTurnTrigger = nullptr;\n break;\n case TriggerType::TURN_END:\n game->triggerManager.endTurnTrigger = nullptr;\n break;\n case TriggerType::PLAY_CARD:\n game->triggerManager.playCardTrigger = nullptr;\n break;\n case TriggerType::CAST_SPELL:\n game->triggerManager.castSpellTrigger = nullptr;\n break;\n case TriggerType::AFTER_CAST:\n game->triggerManager.afterCastTrigger = nullptr;\n break;\n case TriggerType::HEAL:\n game->triggerManager.healTrigger = nullptr;\n break;\n case TriggerType::ATTACK:\n game->triggerManager.attackTrigger = nullptr;\n break;\n case TriggerType::AFTER_ATTACK:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n m_owner->owner->GetHero()->afterAttackTrigger = nullptr;\n break;\n }\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(m_owner);\n minion->afterAttackTrigger = nullptr;\n break;\n }\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment =\n dynamic_cast<Enchantment*>(m_owner);\n auto minion =\n dynamic_cast<Minion*>(enchantment->GetTarget());\n minion->afterAttackTrigger = nullptr;\n break;\n }\n default:\n break;\n }\n case TriggerType::SUMMON:\n game->triggerManager.summonTrigger = nullptr;\n break;\n case TriggerType::PREDAMAGE:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n m_owner->owner->GetHero()->preDamageTrigger = nullptr;\n break;\n }\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(m_owner);\n minion->preDamageTrigger = nullptr;\n break;\n }\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment =\n dynamic_cast<Enchantment*>(m_owner);\n auto minion =\n dynamic_cast<Minion*>(enchantment->GetTarget());\n minion->preDamageTrigger = nullptr;\n break;\n }\n default:\n break;\n }\n case TriggerType::TAKE_DAMAGE:\n game->triggerManager.takeDamageTrigger = nullptr;\n break;\n case TriggerType::TARGET:\n game->triggerManager.targetTrigger = nullptr;\n break;\n default:\n throw std::invalid_argument(\n \"Trigger::Remove() - Invalid trigger type!\");\n }\n\n if (m_sequenceType != SequenceType::NONE)\n {\n EraseIf(game->triggers,\n [this](Trigger* trigger) { return trigger == this; });\n }\n\n delete m_owner->activatedTrigger;\n}\n\nvoid Trigger::ValidateTriggers(Game* game, Entity* source, SequenceType type)\n{\n for (auto& trigger : game->triggers)\n {\n if (trigger->m_sequenceType == type)\n {\n trigger->Validate(&game->GetCurrentPlayer(), source);\n }\n }\n}\n\nvoid Trigger::Process(Player* player, Entity* source)\n{\n if (m_sequenceType == SequenceType::NONE)\n {\n Validate(player, source);\n }\n\n if (!m_isValidated)\n {\n return;\n }\n\n ProcessInternal(source);\n}\n\nvoid Trigger::ProcessInternal(Entity* source)\n{\n m_isValidated = false;\n\n for (auto& task : tasks)\n {\n task->SetPlayer(m_owner->owner);\n task->SetSource(m_owner);\n\n if (source != nullptr)\n {\n task->SetTarget(source);\n }\n else\n {\n const auto enchantment = dynamic_cast<Enchantment*>(m_owner);\n if (enchantment != nullptr && enchantment->GetTarget() != nullptr)\n {\n task->SetTarget(enchantment->GetTarget());\n }\n else\n {\n task->SetTarget(nullptr);\n }\n }\n\n if (fastExecution)\n {\n task->Run();\n }\n else\n {\n m_owner->owner->GetGame()->taskQueue.Enqueue(task);\n }\n\n if (removeAfterTriggered)\n {\n Remove();\n }\n }\n\n m_isValidated = false;\n}\n\nvoid Trigger::Validate(Player* player, Entity* source)\n{\n switch (triggerSource)\n {\n case TriggerSource::NONE:\n break;\n case TriggerSource::SELF:\n if (source != m_owner)\n {\n return;\n }\n break;\n case TriggerSource::HERO:\n if (dynamic_cast<Hero*>(source) == nullptr ||\n source->owner != m_owner->owner)\n {\n return;\n }\n break;\n case TriggerSource::ALL_MINIONS:\n if (dynamic_cast<Minion*>(source) == nullptr)\n {\n return;\n }\n break;\n case TriggerSource::MINIONS_EXCEPT_SELF:\n if (dynamic_cast<Minion*>(source) == nullptr ||\n source->owner != m_owner->owner || source == m_owner)\n {\n return;\n }\n break;\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment = dynamic_cast<Enchantment*>(m_owner);\n if (enchantment == nullptr ||\n enchantment->GetTarget()->id != source->id)\n {\n return;\n }\n break;\n }\n case TriggerSource::FRIENDLY:\n {\n if (source->owner != m_owner->owner)\n {\n return;\n }\n break;\n }\n default:\n throw std::invalid_argument(\n \"Trigger::Validate() - Invalid source trigger!\");\n }\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n case TriggerType::TURN_END:\n if (player != m_owner->owner)\n {\n return;\n }\n break;\n case TriggerType::PLAY_CARD:\n case TriggerType::SUMMON:\n if (source == m_owner)\n {\n return;\n }\n break;\n default:\n break;\n }\n\n if (condition != nullptr)\n {\n const bool res = (source != nullptr) ? condition->Evaluate(source)\n : condition->Evaluate(m_owner);\n\n if (!res)\n {\n return;\n }\n }\n\n m_isValidated = true;\n}\n} \/\/ namespace RosettaStone\n<commit_msg>fix: Remove unused code<commit_after>\/\/ This code is based on Sabberstone project.\n\/\/ Copyright (c) 2017-2019 SabberStone Team, darkfriend77 & rnilva\n\/\/ RosettaStone is hearthstone simulator using C++ with reinforcement learning.\n\/\/ Copyright (c) 2019 Chris Ohk, Youngjoong Kim, SeungHyun Jeon\n\n#include <Rosetta\/Commons\/Utils.hpp>\n#include <Rosetta\/Enchants\/Trigger.hpp>\n#include <Rosetta\/Games\/Game.hpp>\n#include <Rosetta\/Models\/Enchantment.hpp>\n#include <Rosetta\/Tasks\/ITask.hpp>\n\n#include <stdexcept>\n\nnamespace RosettaStone\n{\nTrigger::Trigger(TriggerType type) : m_triggerType(type)\n{\n switch (type)\n {\n case TriggerType::PLAY_CARD:\n m_sequenceType = SequenceType::PLAY_CARD;\n break;\n case TriggerType::CAST_SPELL:\n case TriggerType::AFTER_CAST:\n m_sequenceType = SequenceType::PLAY_SPELL;\n break;\n case TriggerType::TARGET:\n m_sequenceType = SequenceType::TARGET;\n break;\n case TriggerType::TURN_END:\n fastExecution = true;\n break;\n default:\n m_sequenceType = SequenceType::NONE;\n }\n}\n\nTrigger::Trigger(Trigger& prototype, Entity& owner)\n : triggerSource(prototype.triggerSource),\n tasks(prototype.tasks),\n condition(prototype.condition),\n fastExecution(prototype.fastExecution),\n removeAfterTriggered(prototype.removeAfterTriggered),\n m_owner(&owner),\n m_triggerType(prototype.m_triggerType),\n m_triggerActivation(prototype.m_triggerActivation),\n m_sequenceType(prototype.m_sequenceType)\n{\n \/\/ Do nothing\n}\n\nvoid Trigger::Activate(Entity* source, TriggerActivation activation, bool cloning)\n{\n if (!cloning && activation != m_triggerActivation)\n {\n if (m_triggerActivation != TriggerActivation::HAND_OR_PLAY)\n {\n return;\n }\n }\n\n auto* instance = new Trigger(*this, *source);\n Game* game = source->owner->GetGame();\n\n source->activatedTrigger = instance;\n\n auto triggerFunc = [instance](Player* p, Entity* e) {\n instance->Process(p, e);\n };\n\n if (m_sequenceType != SequenceType::NONE)\n {\n source->owner->GetGame()->triggers.emplace_back(instance);\n }\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n game->triggerManager.startTurnTrigger = std::move(triggerFunc);\n break;\n case TriggerType::TURN_END:\n game->triggerManager.endTurnTrigger = std::move(triggerFunc);\n break;\n case TriggerType::PLAY_CARD:\n game->triggerManager.playCardTrigger = std::move(triggerFunc);\n break;\n case TriggerType::CAST_SPELL:\n game->triggerManager.castSpellTrigger = std::move(triggerFunc);\n break;\n case TriggerType::AFTER_CAST:\n game->triggerManager.afterCastTrigger = std::move(triggerFunc);\n break;\n case TriggerType::HEAL:\n game->triggerManager.healTrigger = std::move(triggerFunc);\n break;\n case TriggerType::ATTACK:\n game->triggerManager.attackTrigger = std::move(triggerFunc);\n break;\n case TriggerType::AFTER_ATTACK:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n source->owner->GetHero()->afterAttackTrigger =\n std::move(triggerFunc);\n break;\n }\n default:\n break;\n }\n break;\n case TriggerType::SUMMON:\n game->triggerManager.summonTrigger = std::move(triggerFunc);\n break;\n case TriggerType::PREDAMAGE:\n switch (triggerSource)\n {\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(source);\n minion->preDamageTrigger = std::move(triggerFunc);\n break;\n }\n default:\n break;\n }\n break;\n case TriggerType::TAKE_DAMAGE:\n game->triggerManager.takeDamageTrigger = std::move(triggerFunc);\n break;\n case TriggerType::TARGET:\n game->triggerManager.targetTrigger = std::move(triggerFunc);\n break;\n default:\n throw std::invalid_argument(\n \"Trigger::Activate() - Invalid trigger type!\");\n }\n}\n\nvoid Trigger::Remove() const\n{\n Game* game = m_owner->owner->GetGame();\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n game->triggerManager.startTurnTrigger = nullptr;\n break;\n case TriggerType::TURN_END:\n game->triggerManager.endTurnTrigger = nullptr;\n break;\n case TriggerType::PLAY_CARD:\n game->triggerManager.playCardTrigger = nullptr;\n break;\n case TriggerType::CAST_SPELL:\n game->triggerManager.castSpellTrigger = nullptr;\n break;\n case TriggerType::AFTER_CAST:\n game->triggerManager.afterCastTrigger = nullptr;\n break;\n case TriggerType::HEAL:\n game->triggerManager.healTrigger = nullptr;\n break;\n case TriggerType::ATTACK:\n game->triggerManager.attackTrigger = nullptr;\n break;\n case TriggerType::AFTER_ATTACK:\n switch (triggerSource)\n {\n case TriggerSource::HERO:\n {\n m_owner->owner->GetHero()->afterAttackTrigger = nullptr;\n break;\n }\n default:\n break;\n }\n case TriggerType::SUMMON:\n game->triggerManager.summonTrigger = nullptr;\n break;\n case TriggerType::PREDAMAGE:\n switch (triggerSource)\n {\n case TriggerSource::SELF:\n {\n auto minion = dynamic_cast<Minion*>(m_owner);\n minion->preDamageTrigger = nullptr;\n break;\n }\n default:\n break;\n }\n case TriggerType::TAKE_DAMAGE:\n game->triggerManager.takeDamageTrigger = nullptr;\n break;\n case TriggerType::TARGET:\n game->triggerManager.targetTrigger = nullptr;\n break;\n default:\n throw std::invalid_argument(\n \"Trigger::Remove() - Invalid trigger type!\");\n }\n\n if (m_sequenceType != SequenceType::NONE)\n {\n EraseIf(game->triggers,\n [this](Trigger* trigger) { return trigger == this; });\n }\n\n delete m_owner->activatedTrigger;\n}\n\nvoid Trigger::ValidateTriggers(Game* game, Entity* source, SequenceType type)\n{\n for (auto& trigger : game->triggers)\n {\n if (trigger->m_sequenceType == type)\n {\n trigger->Validate(&game->GetCurrentPlayer(), source);\n }\n }\n}\n\nvoid Trigger::Process(Player* player, Entity* source)\n{\n if (m_sequenceType == SequenceType::NONE)\n {\n Validate(player, source);\n }\n\n if (!m_isValidated)\n {\n return;\n }\n\n ProcessInternal(source);\n}\n\nvoid Trigger::ProcessInternal(Entity* source)\n{\n m_isValidated = false;\n\n for (auto& task : tasks)\n {\n task->SetPlayer(m_owner->owner);\n task->SetSource(m_owner);\n\n if (source != nullptr)\n {\n task->SetTarget(source);\n }\n else\n {\n const auto enchantment = dynamic_cast<Enchantment*>(m_owner);\n if (enchantment != nullptr && enchantment->GetTarget() != nullptr)\n {\n task->SetTarget(enchantment->GetTarget());\n }\n else\n {\n task->SetTarget(nullptr);\n }\n }\n\n if (fastExecution)\n {\n task->Run();\n }\n else\n {\n m_owner->owner->GetGame()->taskQueue.Enqueue(task);\n }\n\n if (removeAfterTriggered)\n {\n Remove();\n }\n }\n\n m_isValidated = false;\n}\n\nvoid Trigger::Validate(Player* player, Entity* source)\n{\n switch (triggerSource)\n {\n case TriggerSource::NONE:\n break;\n case TriggerSource::SELF:\n if (source != m_owner)\n {\n return;\n }\n break;\n case TriggerSource::HERO:\n if (dynamic_cast<Hero*>(source) == nullptr ||\n source->owner != m_owner->owner)\n {\n return;\n }\n break;\n case TriggerSource::ALL_MINIONS:\n if (dynamic_cast<Minion*>(source) == nullptr)\n {\n return;\n }\n break;\n case TriggerSource::MINIONS_EXCEPT_SELF:\n if (dynamic_cast<Minion*>(source) == nullptr ||\n source->owner != m_owner->owner || source == m_owner)\n {\n return;\n }\n break;\n case TriggerSource::ENCHANTMENT_TARGET:\n {\n const auto enchantment = dynamic_cast<Enchantment*>(m_owner);\n if (enchantment == nullptr ||\n enchantment->GetTarget()->id != source->id)\n {\n return;\n }\n break;\n }\n case TriggerSource::FRIENDLY:\n {\n if (source->owner != m_owner->owner)\n {\n return;\n }\n break;\n }\n default:\n throw std::invalid_argument(\n \"Trigger::Validate() - Invalid source trigger!\");\n }\n\n switch (m_triggerType)\n {\n case TriggerType::TURN_START:\n case TriggerType::TURN_END:\n if (player != m_owner->owner)\n {\n return;\n }\n break;\n case TriggerType::PLAY_CARD:\n case TriggerType::SUMMON:\n if (source == m_owner)\n {\n return;\n }\n break;\n default:\n break;\n }\n\n if (condition != nullptr)\n {\n const bool res = (source != nullptr) ? condition->Evaluate(source)\n : condition->Evaluate(m_owner);\n\n if (!res)\n {\n return;\n }\n }\n\n m_isValidated = true;\n}\n} \/\/ namespace RosettaStone\n<|endoftext|>"} {"text":"<commit_before>\/************************************************\n * 该例程是守护进程和看门狗进程的编程实现\n************************************************\/\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/wait.h>\n#include <sys\/param.h> \/\/ NOFILE\n#include <sys\/stat.h> \/\/ umask\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n\nvoid childProcessFunc()\n{\n FILE* file = NULL;\n time_t t = 0;\n int i = 0;\n\n \/\/ 每隔5秒向test.log报告运行状态\n while (true)\n {\n ++i;\n sleep(5);\n file = fopen(\".\/var\/test.log\", \"a+\");\n if (file != NULL)\n {\n t = time(NULL);\n fprintf(file, \"i: %d, I am here at %s\\n\", i, asctime(localtime(&t)));\n fclose(file);\n }\n\n if (i == 5)\n {\n \/\/ 子进程主动退出\n exit(0);\n }\n }\n}\n\nvoid forkChildProcess(int)\n{\n int status = 0;\n \/\/ 等待子进程中断或终止，释放子进程资源\n \/\/ 否则死掉的子进程会变成僵尸进程\n int pid = wait(&status);\n if (pid < 0)\n {\n printf(\"error: %s\\n\", strerror(errno));\n return;\n }\n\n \/\/ 如果子进程是由于某种信号退出的，捕获该信号\n if (WIFSIGNALED(status))\n {\n int signalNum = WTERMSIG(status);\n printf(\"Child process was killed by signal num: %d\\n\", signalNum);\n }\n\n \/\/ 等待3秒钟重新启动子进程\n sleep(3);\n\n pid = fork();\n if (pid == 0)\n {\n printf(\"Fork new child process\\n\");\n childProcessFunc();\n }\n}\n\nbool initWatchDog()\n{\n int pid = fork();\n if (pid)\n {\n \/\/ 父进程一直监视子进程的运行状态\n while (true)\n {\n \/\/ 捕获子进程结束信号\n signal(SIGCHLD, forkChildProcess);\n \/\/ 父进程挂起，当有信号来时被唤醒\n pause();\n }\n }\n else if (pid < 0)\n {\n return false;\n }\n\n return true;\n}\n\nbool initDaemon()\n{\n \/\/ 屏蔽一些有关控制终端操作的信号\n \/\/ 防止守护进程没有正常运转起来时，因控制终端受到干扰退出或挂起\n signal(SIGINT, SIG_IGN); \/\/ 终端中断\n signal(SIGHUP, SIG_IGN); \/\/ 连接挂断\n signal(SIGQUIT, SIG_IGN);\/\/ 终端退出\n signal(SIGPIPE, SIG_IGN);\/\/ 向无读进程的管道写数据\n signal(SIGTTOU, SIG_IGN);\/\/ 后台程序尝试写操作\n signal(SIGTTIN, SIG_IGN);\/\/ 后台程序尝试读操作\n signal(SIGTERM, SIG_IGN);\/\/ 终止\n\n \/\/ [1] 创建一个子进程，父进程退出\n int pid = fork();\n if (pid)\n {\n \/\/ 父进程退出\n exit(0);\n }\n else if (pid < 0)\n {\n return false;\n }\n\n \/\/ 子进程继续运行\n \n \/\/ [2] 在子进程中创建新的会话，setsid有三个作用\n \/\/ a.让进程摆脱原会话的控制\n \/\/ b.让进程摆脱原进程组的控制\n \/\/ c.让进程摆脱原控制终端的控制\n int ret = setsid();\n if (ret < 0)\n {\n return false;\n }\n\n \/\/ [3] 禁止进程重新打开控制终端\n \/\/ 进程已经成为无终端的会话组长，但它可以重新申请打开一个控制终端\n \/\/ 可以通过使进程不再成为会话组长来禁止进程重新打开控制终端\n pid = fork();\n if (pid)\n {\n \/\/ 结束第一个子进程\n exit(0);\n }\n else if (pid < 0)\n {\n return false;\n }\n\n \/\/ 第二个子进程继续运行\n\n \/\/ [4] 关闭打开的文件描述符\n \/\/ 进程从创建它的父进程那里继承了打开的文件描述符，如果不关闭，将会浪费系统资源，\n \/\/ 造成进程所在的文件系统无法卸下以及引起无法预料的错误\n for (int i = 0; i < NOFILE; ++i)\n {\n close(i);\n }\n\n \/\/ [5] 改变当前工作目录\n \/\/ 进程活动时，其工作目录所在的文件系统不能卸下，一般将工作目录改变到根目录\n ret = chdir(\"\/\");\n if (ret < 0)\n {\n return false;\n }\n\n \/\/ [6] 重新设置文件创建掩码\n \/\/ 进程从创建它的父进程那里继承了文件创建掩码，它可能修改守护进程所创建的文件的存取位\n \/\/ 所以将文件创建掩码清除\n umask(0);\n\n return true;\n}\n\nint main()\n{\n \/\/ 注意：要编写带有看门狗并且后台运行的程序\n \/\/ 需要先初始化守护进程（让该程序成为后台程序）\n \/\/ 然后才初始化看门狗进程\n \n \/\/ 初始化守护进程\n bool ret = initDaemon();\n if (!ret)\n {\n return 1;\n }\n\n \/\/ 初始化看门狗进程\n ret = initWatchDog();\n if (!ret)\n {\n return 1;\n }\n\n \/\/ 运行子进程代码\n childProcessFunc(); \n\n return 0;\n}\n<commit_msg>Update DaemonAndWatchDog<commit_after>\/************************************************\n * 该例程是守护进程和看门狗进程的编程实现\n************************************************\/\n#include <unistd.h>\n#include <signal.h>\n#include <sys\/wait.h>\n#include <sys\/param.h> \/\/ NOFILE\n#include <sys\/stat.h> \/\/ umask\n#include <errno.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <time.h>\n#include <assert.h>\n\nvoid childProcessFunc()\n{\n FILE* file = NULL;\n time_t t = 0;\n int i = 0;\n\n \/\/ 每隔5秒向test.log报告运行状态\n while (true)\n {\n ++i;\n sleep(5);\n file = fopen(\".\/var\/test.log\", \"a+\");\n if (file != NULL)\n {\n t = time(NULL);\n fprintf(file, \"i: %d, I am here at %s\\n\", i, asctime(localtime(&t)));\n fclose(file);\n }\n\n if (i == 5)\n {\n \/\/ 子进程主动退出\n exit(0);\n }\n }\n}\n\nvoid forkChildProcess(int)\n{\n int status = 0;\n \/\/ 等待子进程中断或终止，释放子进程资源\n \/\/ 否则死掉的子进程会变成僵尸进程\n int pid = wait(&status);\n if (pid < 0)\n {\n printf(\"error: %s\\n\", strerror(errno));\n return;\n }\n\n \/\/ 如果子进程是由于某种信号退出的，捕获该信号\n if (WIFSIGNALED(status))\n {\n int signalNum = WTERMSIG(status);\n printf(\"Child process was killed by signal num: %d\\n\", signalNum);\n }\n\n \/\/ 等待3秒钟重新启动子进程\n sleep(3);\n\n pid = fork();\n if (pid == 0)\n {\n printf(\"Fork new child process\\n\");\n childProcessFunc();\n }\n}\n\nbool initWatchDog()\n{\n int pid = fork();\n if (pid)\n {\n \/\/ 父进程一直监视子进程的运行状态\n while (true)\n {\n \/\/ 捕获子进程结束信号\n assert(signal(SIGCHLD, forkChildProcess) != SIG_ERR);\n \/\/ 父进程挂起，当有信号来时被唤醒\n pause();\n }\n }\n else if (pid < 0)\n {\n return false;\n }\n\n return true;\n}\n\nbool initDaemon()\n{\n \/\/ 屏蔽一些有关控制终端操作的信号\n \/\/ 防止守护进程没有正常运转起来时，因控制终端受到干扰退出或挂起\n assert(signal(SIGINT, SIG_IGN) != SIG_ERR); \/\/ 终端中断\n assert(signal(SIGHUP, SIG_IGN) != SIG_ERR); \/\/ 连接挂断\n assert(signal(SIGQUIT, SIG_IGN) != SIG_ERR);\/\/ 终端退出\n assert(signal(SIGPIPE, SIG_IGN) != SIG_ERR);\/\/ 向无读进程的管道写数据\n assert(signal(SIGTTOU, SIG_IGN) != SIG_ERR);\/\/ 后台程序尝试写操作\n assert(signal(SIGTTIN, SIG_IGN) != SIG_ERR);\/\/ 后台程序尝试读操作\n assert(signal(SIGTERM, SIG_IGN) != SIG_ERR);\/\/ 终止\n\n \/\/ [1] 创建一个子进程，父进程退出\n int pid = fork();\n if (pid)\n {\n \/\/ 父进程退出\n exit(0);\n }\n else if (pid < 0)\n {\n return false;\n }\n\n \/\/ 子进程继续运行\n \n \/\/ [2] 在子进程中创建新的会话，setsid有三个作用\n \/\/ a.让进程摆脱原会话的控制\n \/\/ b.让进程摆脱原进程组的控制\n \/\/ c.让进程摆脱原控制终端的控制\n int ret = setsid();\n if (ret < 0)\n {\n return false;\n }\n\n \/\/ [3] 禁止进程重新打开控制终端\n \/\/ 进程已经成为无终端的会话组长，但它可以重新申请打开一个控制终端\n \/\/ 可以通过使进程不再成为会话组长来禁止进程重新打开控制终端\n pid = fork();\n if (pid)\n {\n \/\/ 结束第一个子进程\n exit(0);\n }\n else if (pid < 0)\n {\n return false;\n }\n\n \/\/ 第二个子进程继续运行\n\n \/\/ [4] 关闭打开的文件描述符\n \/\/ 进程从创建它的父进程那里继承了打开的文件描述符，如果不关闭，将会浪费系统资源，\n \/\/ 造成进程所在的文件系统无法卸下以及引起无法预料的错误\n for (int i = 0; i < NOFILE; ++i)\n {\n close(i);\n }\n\n \/\/ [5] 改变当前工作目录\n \/\/ 进程活动时，其工作目录所在的文件系统不能卸下，一般将工作目录改变到根目录\n ret = chdir(\"\/\");\n if (ret < 0)\n {\n return false;\n }\n\n \/\/ [6] 重新设置文件创建掩码\n \/\/ 进程从创建它的父进程那里继承了文件创建掩码，它可能修改守护进程所创建的文件的存取位\n \/\/ 所以将文件创建掩码清除\n umask(0);\n\n return true;\n}\n\nint main()\n{\n \/\/ 注意：要编写带有看门狗并且后台运行的程序\n \/\/ 需要先初始化守护进程（让该程序成为后台程序）\n \/\/ 然后才初始化看门狗进程\n \n \/\/ 初始化守护进程\n bool ret = initDaemon();\n if (!ret)\n {\n return 1;\n }\n\n \/\/ 初始化看门狗进程\n ret = initWatchDog();\n if (!ret)\n {\n return 1;\n }\n\n \/\/ 运行子进程代码\n childProcessFunc(); \n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n \n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Modules\/Legacy\/Fields\/GetFieldBoundary.h>\n#include <Core\/Algorithms\/Legacy\/Fields\/MeshDerivatives\/GetFieldBoundary.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Fields;\n\nGetFieldBoundary::GetFieldBoundary()\n : Module(ModuleLookupInfo(\"GetFieldBoundary\", \"NewField\", \"SCIRun\"), false)\n{\n algo_ = algoFactory_->create(get_module_name(), getLogger()); \n}\n\nvoid\nGetFieldBoundary::execute()\n{\n FieldHandle field;\n \n get_input_handle(\"Field\",field,true);\n \n \/\/ If parameters changed, do algorithm\n if (inputs_changed_ || \n !oport_cached(\"BoundaryField\") || \n !oport_cached(\"Mapping\"))\n {\n update_state(Executing);\n\n \/\/ Output dataflow objects:\n FieldHandle ofield;\n MatrixHandle mapping;\n \n \/\/ Entry point to algorithm\n if (!(algo_.run(field,ofield,mapping))) return;\n\n \/\/ Send Data flow objects downstream\n send_output_handle(\"BoundaryField\", ofield);\n send_output_handle(\"Mapping\", mapping);\n }\n}\n<commit_msg>Remove superfluous comments<commit_after>\/*\n For more information, please see: http:\/\/software.sci.utah.edu\n\n The MIT License\n\n Copyright (c) 2009 Scientific Computing and Imaging Institute,\n University of Utah.\n\n \n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included\n in all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <Modules\/Legacy\/Fields\/GetFieldBoundary.h>\n#include <Core\/Algorithms\/Legacy\/Fields\/MeshDerivatives\/GetFieldBoundary.h>\n\nusing namespace SCIRun;\nusing namespace SCIRun::Core::Datatypes;\nusing namespace SCIRun::Dataflow::Networks;\nusing namespace SCIRun::Modules::Fields;\n\nGetFieldBoundary::GetFieldBoundary()\n : Module(ModuleLookupInfo(\"GetFieldBoundary\", \"NewField\", \"SCIRun\"), false)\n{\n algo_ = algoFactory_->create(get_module_name(), getLogger()); \n}\n\nvoid\nGetFieldBoundary::execute()\n{\n FieldHandle field;\n \n get_input_handle(\"Field\",field,true);\n \n \/\/ If parameters changed, do algorithm\n if (inputs_changed_ || \n !oport_cached(\"BoundaryField\") || \n !oport_cached(\"Mapping\"))\n {\n update_state(Executing);\n\n FieldHandle ofield;\n MatrixHandle mapping;\n \n if (!(algo_.run(field,ofield,mapping))) return;\n\n send_output_handle(\"BoundaryField\", ofield);\n send_output_handle(\"Mapping\", mapping);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <math.h>\r\n#include <iostream>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nvoid printVect(vector<int> v){\r\n\tint size = v.size();\r\n\tfor (int i = 0; i < size; i++){\r\n\t\tcout << v.at(i) << \" \";\r\n\t}\r\n}\r\n\r\nvector<int> DivideAndConquere(vector<int> v){\r\n\tint size = v.size();\r\n\tint half_size = size \/ 2;\r\n\tif (size < 1){\r\n\t\tcout << \"Error size is \" << size << endl;\r\n\t\treturn v;\r\n\t}\r\n\tif (size == 1) {\r\n\t\tcout << \"out vector \" << v[0] << endl;\r\n\t\treturn v;\r\n\t}\r\n\r\n\tprintVect(v); cout << \"--->\";\r\n\tvector<int> v_out(size);\r\n\tvector<int> v_left(v.begin(), v.begin() + size - half_size);\r\n\tprintVect(v_left); cout << \"----\";\r\n\tvector<int> v_right(v.begin() + size - half_size, v.end());\r\n\tprintVect(v_right); cout << endl;\r\n\r\n\tv_left = DivideAndConquere(v_left);\r\n\tv_right = DivideAndConquere(v_right);\r\n\r\n\t\/\/merge\r\n\tint left = 0;\r\n\tint right = 0;\r\n\tfor (int i = 0; i < size; i++){\r\n\t\tif ((left >= size - half_size) || (v_right[right] < v_left[left])){\r\n\t\t\tv_out[i] = v_right[right];\r\n\t\t\tright++;\r\n\t\t}\r\n\t\telse{\r\n\t\t\tif ((right >= half_size) || (v_left[left] < v_right[right])){\r\n\t\t\t\tv_out[i] = v_left[left];\r\n\t\t\t\tleft++;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tcout << \"out vector \";\r\n\tprintVect(v_out); cout << endl;\r\n\r\n\treturn v_out;\r\n}\r\n\r\nvoid DivideAndConquereAndTest(){\r\n\tvector <int> v = { 38, 27, 43, 3, 9, 82, 10 };\r\n\tcout << endl << \"un-ordered vector \";\r\n\tprintVect(v); cout << endl;\r\n\r\n\tv = DivideAndConquere(v);\r\n\tcout << endl << \"ordered vector \";\r\n\tprintVect(v); cout << endl;\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n\t\/\/KaratsubaMultiplicationAndTest();\r\n\tDivideAndConquereAndTest();\r\n\tsystem(\"pause\");\r\n\treturn 0;\r\n}\r\n\r\n<commit_msg>rename DivideAndConquere fonction to MergeAnd Sort<commit_after>#include <math.h>\r\n#include <iostream>\r\n#include <vector>\r\n\r\nusing namespace std;\r\n\r\nvoid printVect(vector<int> v){\r\n\tint size = v.size();\r\n\tfor (int i = 0; i < size; i++){\r\n\t\tcout << v.at(i) << \" \";\r\n\t}\r\n}\r\n\r\nvector<int> MergeAndSort(vector<int> v){\r\n\tint size = v.size();\r\n\tint half_size = size \/ 2;\r\n\tif (size < 1){\r\n\t\tcout << \"Error size is \" << size << endl;\r\n\t\treturn v;\r\n\t}\r\n\tif (size == 1) {\r\n\t\tcout << \"out vector \" << v[0] << endl;\r\n\t\treturn v;\r\n\t}\r\n\r\n\tprintVect(v); cout << \"--->\";\r\n\tvector<int> v_out(size);\r\n\tvector<int> v_left(v.begin(), v.begin() + size - half_size);\r\n\tprintVect(v_left); cout << \"----\";\r\n\tvector<int> v_right(v.begin() + size - half_size, v.end());\r\n\tprintVect(v_right); cout << endl;\r\n\r\n\tv_left = MergeAndSort(v_left);\r\n\tv_right = MergeAndSort(v_right);\r\n\r\n\t\/\/merge\r\n\tint left = 0;\r\n\tint right = 0;\r\n\tfor (int i = 0; i < size; i++){\r\n\t\tif ((left >= size - half_size) || (v_right[right] < v_left[left])){\r\n\t\t\tv_out[i] = v_right[right];\r\n\t\t\tright++;\r\n\t\t}\r\n\t\telse{\r\n\t\t\tif ((right >= half_size) || (v_left[left] < v_right[right])){\r\n\t\t\t\tv_out[i] = v_left[left];\r\n\t\t\t\tleft++;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tcout << \"out vector \";\r\n\tprintVect(v_out); cout << endl;\r\n\r\n\treturn v_out;\r\n}\r\n\r\nvoid MergeAndSortAndTest(){\r\n\tvector <int> v = { 38, 27, 43, 3, 9, 82, 10 };\r\n\tcout << endl << \"un-ordered vector \";\r\n\tprintVect(v); cout << endl;\r\n\r\n\tv = MergeAndSort(v);\r\n\tcout << endl << \"ordered vector \";\r\n\tprintVect(v); cout << endl;\r\n}\r\n\r\nint main(int argc, char* argv[])\r\n{\r\n\tMergeAndSortAndTest();\r\n\tsystem(\"pause\");\r\n\treturn 0;\r\n}\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/test\/unit_test.hpp>\n\n#include \"core\/connection.hpp\"\n#include \"ports\/events\/event_sink_with_queue.hpp\"\n#include \"ports\/event_ports.hpp\"\n#include <vector>\n#include <algorithm>\n#include \"move_token.hpp\"\n\nusing namespace fc;\n\nBOOST_AUTO_TEST_SUITE(test_tokens_testing)\n\nBOOST_AUTO_TEST_CASE( move_token_ )\n{\n\t\/\/ no default constructor\n\t\/\/ how to test for \"does not compile\"?\n\/\/\tmove_token t;\n\n\t\/\/ non-copyable\n\tmove_token t(\"foo\");\n\tmove_token u(move_token(\"bar\"));\n\n\tstd::vector<move_token> v(10);\n\tstd::sort(v.begin(), v.end());\n\tv.push_back(move_token(\"foo\"));\n}\n\nBOOST_AUTO_TEST_CASE( moving )\n{\n\tauto set_bar = [](auto&& t) -> move_token&& { t.value() = \"bar\"; return std::move(t); };\n\/\/\tauto set_bar = [](move_token&& t) { t.value() = \"bar\"; return std::move(t); };\n\n\tevent_out_port<move_token&&> source;\n\tevent_in_port<move_token> sink([](move_token&& t){ std::cout << \"move: \" << t.value() << \"\\n\";});\n\n\tstd::function<void(move_token&&)> bla = sink;\n\tsource >> set_bar >> bla;\n\tsource.fire(move_token(\"foo\"));\n}\n\n\/\/test case to make sure objects are not move if we don't want them to be\nBOOST_AUTO_TEST_CASE( non_moving )\n{\n\ttypedef std::shared_ptr<int> non_move; \/\/shared_ptr is nulled after move, so we can check\n\tevent_out_port<non_move> source;\n\tbool moved = false;\n\tevent_in_port<non_move> sink([&moved](non_move&& t){ moved = !t.operator bool() ;});\n\tevent_in_port<non_move> sink2([&moved](non_move&& t){ moved = !t.operator bool() ;});\n\n\tsource >> sink;\n\n\tsource.fire(std::make_shared<int>(1));\n\tBOOST_CHECK(!moved);\n\n\tsource >> sink2; \/\/now we have two connections\n\tsource.fire(std::make_shared<int>(1));\n\tBOOST_CHECK(!moved);\n\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n\n\n\n\n\n<commit_msg>added first test for moving state, currently fails<commit_after>#include <boost\/test\/unit_test.hpp>\n\n#include \"core\/connection.hpp\"\n#include \"ports\/events\/event_sink_with_queue.hpp\"\n#include \"ports\/event_ports.hpp\"\n#include \"ports\/state_ports.hpp\"\n\n#include <vector>\n#include <algorithm>\n#include \"move_token.hpp\"\n\nusing namespace fc;\n\nBOOST_AUTO_TEST_SUITE(test_tokens_testing)\n\nBOOST_AUTO_TEST_CASE( move_token_ )\n{\n\t\/\/ no default constructor\n\t\/\/ how to test for \"does not compile\"?\n\/\/\tmove_token t;\n\n\t\/\/ non-copyable\n\tmove_token t(\"foo\");\n\tmove_token u(move_token(\"bar\"));\n\n\tstd::vector<move_token> v(10);\n\tstd::sort(v.begin(), v.end());\n\tv.push_back(move_token(\"foo\"));\n}\n\nBOOST_AUTO_TEST_CASE( moving_events )\n{\n\tauto set_bar = [](auto&& t) -> move_token&& { t.value() = \"bar\"; return std::move(t); };\n\/\/\tauto set_bar = [](move_token&& t) { t.value() = \"bar\"; return std::move(t); };\n\n\tevent_out_port<move_token&&> source;\n\tevent_in_port<move_token> sink([](move_token&& t){ std::cout << \"move: \" << t.value() << \"\\n\";});\n\n\tstd::function<void(move_token&&)> bla = sink;\n\tsource >> set_bar >> bla;\n\tsource.fire(move_token(\"foo\"));\n}\n\nBOOST_AUTO_TEST_CASE( moving_state )\n{\n\tauto set_bar = [](auto&& t) -> move_token&& { t.value() = \"bar\"; return std::move(t); };\n\tstate_sink<move_token> sink;\n\tstate_source_call_function<move_token> source([](){ return move_token(\"foo\"); });\n\n\tsource >> set_bar >> sink;\n\tBOOST_CHECK_EQUAL(sink.get().value(), \"bar\");\n\n}\n\n\n\/\/test case to make sure objects are not move if we don't want them to be\nBOOST_AUTO_TEST_CASE( non_moving )\n{\n\ttypedef std::shared_ptr<int> non_move; \/\/shared_ptr is nulled after move, so we can check\n\tevent_out_port<non_move> source;\n\tbool moved = false;\n\tevent_in_port<non_move> sink([&moved](non_move&& t){ moved = !t.operator bool() ;});\n\tevent_in_port<non_move> sink2([&moved](non_move&& t){ moved = !t.operator bool() ;});\n\n\tsource >> sink;\n\n\tsource.fire(std::make_shared<int>(1));\n\tBOOST_CHECK(!moved);\n\n\tsource >> sink2; \/\/now we have two connections\n\tsource.fire(std::make_shared<int>(1));\n\tBOOST_CHECK(!moved);\n\n}\n\n\nBOOST_AUTO_TEST_SUITE_END()\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n\n#include <seastar\/core\/reactor.hh>\n#include <seastar\/core\/app-template.hh>\n#include <seastar\/core\/print.hh>\n#include <seastar\/core\/shared_ptr.hh>\n\nusing namespace seastar;\n\nint main(int ac, char** av) {\n class lister {\n file _f;\n subscription<directory_entry> _listing;\n public:\n lister(file f)\n : _f(std::move(f))\n , _listing(_f.list_directory([this] (directory_entry de) { return report(de); })) {\n }\n future<> done() { return _listing.done(); }\n private:\n future<> report(directory_entry de) {\n fmt::print(\"{}\\n\", de.name);\n return make_ready_future<>();\n }\n };\n return app_template().run_deprecated(ac, av, [] {\n return engine().open_directory(\".\").then([] (file f) {\n auto l = make_lw_shared<lister>(std::move(f));\n return l->done().then([l] {\n \/\/ ugly thing to keep *l alive\n engine().exit(0);\n });\n });\n });\n}\n<commit_msg>directory_test: incorporate file_stat<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2014 Cloudius Systems, Ltd.\n *\/\n\n\n#include <seastar\/core\/reactor.hh>\n#include <seastar\/core\/app-template.hh>\n#include <seastar\/core\/print.hh>\n#include <seastar\/core\/shared_ptr.hh>\n\nusing namespace seastar;\n\nconst char* de_type_desc(directory_entry_type t)\n{\n switch (t) {\n case directory_entry_type::unknown:\n return \"unknown\";\n case directory_entry_type::block_device:\n return \"block_device\";\n case directory_entry_type::char_device:\n return \"char_device\";\n case directory_entry_type::directory:\n return \"directory\";\n case directory_entry_type::fifo:\n return \"fifo\";\n case directory_entry_type::link:\n return \"link\";\n case directory_entry_type::regular:\n return \"regular\";\n case directory_entry_type::socket:\n return \"socket\";\n }\n assert(0 && \"should not get here\");\n return nullptr;\n}\n\nint main(int ac, char** av) {\n class lister {\n file _f;\n subscription<directory_entry> _listing;\n public:\n lister(file f)\n : _f(std::move(f))\n , _listing(_f.list_directory([this] (directory_entry de) { return report(de); })) {\n }\n future<> done() { return _listing.done(); }\n private:\n future<> report(directory_entry de) {\n return file_stat(de.name, follow_symlink::no).then([de = std::move(de)] (stat_data sd) {\n if (de.type) {\n assert(*de.type == sd.type);\n } else {\n assert(sd.type == directory_entry_type::unknown);\n }\n fmt::print(\"{} (type={})\\n\", de.name, de_type_desc(sd.type));\n return make_ready_future<>();\n });\n }\n };\n return app_template().run_deprecated(ac, av, [] {\n return engine().open_directory(\".\").then([] (file f) {\n auto l = make_lw_shared<lister>(std::move(f));\n return l->done().then([l] {\n \/\/ ugly thing to keep *l alive\n engine().exit(0);\n });\n });\n });\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2014 Michael Fink\n\/\/\n\/\/\/ \\file ViewFinderImageWindow.cpp Viewfinder image window\n\/\/\n\n\/\/ includes\n#include \"stdafx.h\"\n#include \"ViewFinderImageWindow.hpp\"\n#include \"Viewfinder.hpp\"\n#include \"JpegMemoryReader.hpp\"\n#include \"Logging.hpp\"\n\n\/\/\/ ratio to draw lines for \"golden ratio\" mode\nconst double c_dGoldenRatio = 0.618;\n\n\/\/\/ number of milliseconds until zebra pattern is moved to the right\nconst unsigned int c_uiZebraPatternMovementInMs = 300;\n\nViewFinderImageWindow::ViewFinderImageWindow()\n:m_uiResX(0),\n m_uiResY(0),\n m_enLinesMode(linesModeNoLines),\n m_bShowZebraPattern(false),\n m_bShowHistogram(false)\n{\n SetupZebraBrush();\n}\n\nViewFinderImageWindow::~ViewFinderImageWindow() throw()\n{\n m_brushZebraPattern.DeleteObject();\n}\n\nvoid ViewFinderImageWindow::EnableUpdate(bool bEnable)\n{\n if (bEnable)\n {\n if (m_spViewfinder != nullptr)\n m_spViewfinder->SetAvailImageHandler(\n std::bind(&ViewFinderImageWindow::OnAvailViewfinderImage, this, std::placeholders::_1));\n }\n else\n {\n m_spViewfinder->SetAvailImageHandler();\n }\n}\n\nvoid ViewFinderImageWindow::SetViewfinder(std::shared_ptr<Viewfinder> spViewfinder)\n{\n if (spViewfinder == nullptr && m_spViewfinder != nullptr)\n {\n m_spViewfinder->SetAvailImageHandler();\n SetBitmap(NULL);\n }\n\n m_spViewfinder = spViewfinder;\n\n if (spViewfinder != nullptr)\n EnableUpdate(true);\n}\n\nvoid ViewFinderImageWindow::OnAvailViewfinderImage(const std::vector<BYTE>& vecImage)\n{\n if (m_spViewfinder == nullptr)\n return;\n\n if (vecImage.empty())\n return;\n\n \/\/{\n \/\/ static DWORD s_dwLastCall = GetTickCount();\n \/\/ DWORD dwNow = GetTickCount();\n \/\/ ATLTRACE(_T(\"last view finder image was %u ms ago\\n\"), dwNow - s_dwLastCall);\n \/\/\n \/\/ s_dwLastCall = dwNow;\n \/\/}\n\n DecodeJpegImage(vecImage);\n\n if (IsWindow())\n PostMessage(WM_VIEWFINDER_AVAIL_IMAGE);\n}\n\nLRESULT ViewFinderImageWindow::OnMessageViewfinderAvailImage(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n CBitmapHandle bmp;\n\n CreateBitmap(bmp);\n SetBitmap(bmp);\n\n \/\/ invalidate control to force redraw\n Invalidate();\n\n TraceViewfinderFps();\n\n return 0;\n}\n\nvoid ViewFinderImageWindow::SetupZebraBrush()\n{\n const WORD c_bitsZebraPatternBrush[8] = { 0x9f, 0x3f, 0x7e, 0xfc, 0xf9, 0xf3, 0xe7, 0xcf };\n\n CBitmap bmZebraPattern;\n bmZebraPattern.CreateBitmap(8, 8, 1, 1, c_bitsZebraPatternBrush);\n\n LOGBRUSH logBrush = { 0 };\n logBrush.lbStyle = BS_PATTERN;\n logBrush.lbHatch = (ULONG_PTR)bmZebraPattern.m_hBitmap;\n logBrush.lbColor = RGB(192, 192, 192);\n\n m_brushZebraPattern.CreateBrushIndirect(&logBrush);\n}\n\nvoid ViewFinderImageWindow::DecodeJpegImage(const std::vector<BYTE>& vecImage)\n{\n \/\/DWORD dwStart = GetTickCount();\n JpegMemoryReader jpegReader(vecImage);\n\n try\n {\n jpegReader.Read();\n }\n catch(...)\n {\n static bool s_bWarnedAboutJPEG = false;\n if (!s_bWarnedAboutJPEG)\n {\n LOG_TRACE(_T(\"DecodeJpegImage: failed loading JPEG!\\n\"));\n s_bWarnedAboutJPEG = true;\n }\n return;\n }\n\n \/\/DWORD dwEnd = GetTickCount();\n \/\/ATLTRACE(_T(\"decoding jpg took %u ms\\n\"), dwEnd - dwStart);\n\n std::vector<BYTE>& vecBitmapData = jpegReader.BitmapData();\n\n JpegImageInfo imageInfo = jpegReader.ImageInfo();\n\n {\n LightweightMutex::LockType lock(m_mtxViewfinderData);\n std::swap(m_vecCurrentViewfinderData, vecBitmapData);\n\n m_uiResX = imageInfo.Width();\n m_uiResY = imageInfo.Height();\n }\n}\n\nvoid ViewFinderImageWindow::MakeOverexposedTransparent(std::vector<BYTE>& vecBitmapData)\n{\n ATLASSERT((vecBitmapData.size() % 3) == 0);\n\n size_t uiValues = vecBitmapData.size() \/ 3;\n\n \/\/ 0xff means fully opaque\n std::vector<BYTE> vecTransparentBitmapData(uiValues * 4, 0xff);\n\n for (size_t ui = 0; ui < uiValues; ui++)\n {\n memcpy(&vecTransparentBitmapData[ui * 4], &vecBitmapData[ui * 3], 3);\n\n if (vecBitmapData[ui * 3 + 0] == 0xff ||\n vecBitmapData[ui * 3 + 1] == 0xff ||\n vecBitmapData[ui * 3 + 2] == 0xff)\n {\n vecTransparentBitmapData[ui * 4 + 3] = 0; \/\/ make transparent\n }\n }\n\n vecBitmapData.swap(vecTransparentBitmapData);\n}\n\nvoid ViewFinderImageWindow::CreateBitmap(CBitmapHandle& bmp)\n{\n BITMAPINFO bi = {0};\n\n BITMAPINFOHEADER& bih = bi.bmiHeader;\n bih.biSize = sizeof(bih);\n bih.biBitCount = 24;\n bih.biClrUsed = 0;\n bih.biCompression = BI_RGB;\n bih.biPlanes = 1;\n\n bih.biHeight = -static_cast<LONG>(m_uiResY); \/\/ negative, since bytes represent a top-bottom DIB\n bih.biWidth = m_uiResX;\n\n BITMAPINFOHEADER* lpbmih = &bih;\n BITMAPINFO* lpbmi = &bi;\n\n {\n LightweightMutex::LockType lock(m_mtxViewfinderData);\n\n LPCVOID lpDIBBits = m_vecCurrentViewfinderData.data();\n\n CClientDC dc(m_hWnd);\n bmp.CreateDIBitmap(dc, lpbmih, CBM_INIT, lpDIBBits, lpbmi, DIB_RGB_COLORS);\n }\n}\n\nvoid ViewFinderImageWindow::SetBitmap(CBitmapHandle bmpViewfinder)\n{\n m_bmpViewfinder = bmpViewfinder;\n}\n\nvoid ViewFinderImageWindow::TraceViewfinderFps()\n{\n static unsigned int s_uiViewfinderImageCount = 0;\n static DWORD s_dwLastFpsTime = GetTickCount();\n\n s_uiViewfinderImageCount++;\n\n DWORD dwNow = GetTickCount();\n\n DWORD dwElapsed = dwNow - s_dwLastFpsTime;\n if (dwElapsed > 500)\n {\n CString cszText;\n cszText.Format(_T(\"Viewfinder: %u fps\"), s_uiViewfinderImageCount * 1000 \/ dwElapsed);\n ATLTRACE(_T(\"%s\\n\"), cszText);\n\n s_uiViewfinderImageCount = 0;\n s_dwLastFpsTime = dwNow;\n }\n}\n\nvoid ViewFinderImageWindow::ScaleBitmapSize(const BITMAP& bm, int& iWidth, int& iHeight)\n{\n CRect rcWindow;\n GetClientRect(rcWindow);\n\n double dRatioWindow = rcWindow.Height() == 0 ? 1.0 : (double(rcWindow.Width()) \/ rcWindow.Height());\n double dRatioBitmap = bm.bmHeight == 0 ? 1.0 : (double(bm.bmWidth) \/ bm.bmHeight);\n\n if (dRatioBitmap < dRatioWindow)\n iWidth = int(iHeight * dRatioBitmap);\n else\n iHeight = int(iWidth \/ dRatioBitmap);\n}\n\nvoid ViewFinderImageWindow::DrawLines(CDC& dc, int iWidth, int iHeight)\n{\n \/\/ pen color is the inverse of the background color\n int iLastDrawMode = dc.SetROP2(R2_NOTXORPEN);\n\n CPen pen;\n pen.CreatePen(PS_DOT, 3, RGB(0, 0, 0));\n CPenHandle oldPen = dc.SelectPen(pen);\n\n double dRatio1 = 1.0 \/ 3.0;\n if (m_enLinesMode == linesModeGoldenRatio)\n dRatio1 = c_dGoldenRatio;\n\n double dRatio2 = 1.0 - dRatio1;\n\n \/\/ horizontal lines\n dc.MoveTo(0, int(iHeight * dRatio1));\n dc.LineTo(iWidth-1, int(iHeight * dRatio1));\n\n dc.MoveTo(0, int(iHeight * dRatio2));\n dc.LineTo(iWidth-1,int(iHeight * dRatio2));\n\n \/\/ vertical lines\n dc.MoveTo(int(iWidth * dRatio1), 0);\n dc.LineTo(int(iWidth * dRatio1), iHeight-1);\n\n dc.MoveTo(int(iWidth * dRatio2), 0);\n dc.LineTo(int(iWidth * dRatio2), iHeight-1);\n\n dc.SelectPen(oldPen);\n\n dc.SetROP2(iLastDrawMode);\n}\n\nvoid ViewFinderImageWindow::DrawZebraPattern(CDC& dc, int iWidth, int iHeight)\n{\n \/\/ draw zebra pattern\n HBRUSH hOldBrush = dc.SelectBrush(m_brushZebraPattern);\n\n dc.SetBkMode(TRANSPARENT);\n dc.SetBkColor(RGB(255, 255, 255));\n\n \/\/ in order to move zebra pattern, set pattern brush origin\n DWORD dwNow = GetTickCount();\n int iOffset = (dwNow \/ c_uiZebraPatternMovementInMs) % 8;\n dc.SetBrushOrg(iOffset, 0);\n\n CRect rcImage(CPoint(0, 0), CSize(iWidth, iHeight));\n dc.Rectangle(&rcImage);\n\n dc.SelectBrush(hOldBrush);\n}\n\nLRESULT ViewFinderImageWindow::OnEraseBkgnd(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n \/\/ disable erasing\n return FALSE;\n}\n\nLRESULT ViewFinderImageWindow::OnPaint(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n CPaintDC dc(m_hWnd);\n\n if (m_bmpViewfinder.IsNull())\n {\n dc.FillSolidRect(&dc.m_ps.rcPaint, RGB(0,0,0));\n return 0;\n }\n\n \/\/ calculate bitmap size\n BITMAP bm = {0};\n GetObject(m_bmpViewfinder, sizeof(bm), &bm);\n\n CRect rcPaint(dc.m_ps.rcPaint);\n\n int iWidth = rcPaint.Width();\n int iHeight = rcPaint.Height();\n\n ScaleBitmapSize(bm, iWidth, iHeight);\n\n rcPaint = CRect(0, 0, iWidth, iHeight);\n\n \/\/ select bitmap into bitmap DC\n CDC bmpDC;\n bmpDC.CreateCompatibleDC();\n\n HBITMAP hbmT = bmpDC.SelectBitmap(m_bmpViewfinder);\n\n \/\/ draw to memory DC\n CMemoryDC memDC(dc, dc.m_ps.rcPaint);\n memDC.FillSolidRect(&dc.m_ps.rcPaint, ::GetSysColor(COLOR_3DFACE));\n\n \/\/ blit bitmap\n if (m_bShowZebraPattern)\n {\n DrawZebraPattern(memDC, iWidth, iHeight);\n\n \/\/ draw viewfinder bitmap with transparency\n memDC.TransparentBlt(0, 0, iWidth, iHeight, bmpDC, 0, 0, bm.bmWidth, bm.bmHeight, RGB(255,255,255));\n }\n else\n memDC.StretchBlt(0, 0, iWidth, iHeight, bmpDC, 0, 0, bm.bmWidth, bm.bmHeight, SRCCOPY);\n\n bmpDC.SelectBitmap(hbmT);\n\n \/\/ draw lines\n if (m_enLinesMode != linesModeNoLines)\n DrawLines(memDC, iWidth, iHeight);\n\n return 0;\n}\n\nLRESULT ViewFinderImageWindow::OnDestroy(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n if (m_spViewfinder != nullptr)\n {\n m_spViewfinder->SetAvailImageHandler();\n m_spViewfinder.reset();\n }\n\n return 0;\n}\n<commit_msg>set StretchBlt mode to properly draw viewfinder image<commit_after>\/\/\n\/\/ RemotePhotoTool - remote camera control software\n\/\/ Copyright (C) 2008-2014 Michael Fink\n\/\/\n\/\/\/ \\file ViewFinderImageWindow.cpp Viewfinder image window\n\/\/\n\n\/\/ includes\n#include \"stdafx.h\"\n#include \"ViewFinderImageWindow.hpp\"\n#include \"Viewfinder.hpp\"\n#include \"JpegMemoryReader.hpp\"\n#include \"Logging.hpp\"\n\n\/\/\/ ratio to draw lines for \"golden ratio\" mode\nconst double c_dGoldenRatio = 0.618;\n\n\/\/\/ number of milliseconds until zebra pattern is moved to the right\nconst unsigned int c_uiZebraPatternMovementInMs = 300;\n\nViewFinderImageWindow::ViewFinderImageWindow()\n:m_uiResX(0),\n m_uiResY(0),\n m_enLinesMode(linesModeNoLines),\n m_bShowZebraPattern(false),\n m_bShowHistogram(false)\n{\n SetupZebraBrush();\n}\n\nViewFinderImageWindow::~ViewFinderImageWindow() throw()\n{\n m_brushZebraPattern.DeleteObject();\n}\n\nvoid ViewFinderImageWindow::EnableUpdate(bool bEnable)\n{\n if (bEnable)\n {\n if (m_spViewfinder != nullptr)\n m_spViewfinder->SetAvailImageHandler(\n std::bind(&ViewFinderImageWindow::OnAvailViewfinderImage, this, std::placeholders::_1));\n }\n else\n {\n m_spViewfinder->SetAvailImageHandler();\n }\n}\n\nvoid ViewFinderImageWindow::SetViewfinder(std::shared_ptr<Viewfinder> spViewfinder)\n{\n if (spViewfinder == nullptr && m_spViewfinder != nullptr)\n {\n m_spViewfinder->SetAvailImageHandler();\n SetBitmap(NULL);\n }\n\n m_spViewfinder = spViewfinder;\n\n if (spViewfinder != nullptr)\n EnableUpdate(true);\n}\n\nvoid ViewFinderImageWindow::OnAvailViewfinderImage(const std::vector<BYTE>& vecImage)\n{\n if (m_spViewfinder == nullptr)\n return;\n\n if (vecImage.empty())\n return;\n\n \/\/{\n \/\/ static DWORD s_dwLastCall = GetTickCount();\n \/\/ DWORD dwNow = GetTickCount();\n \/\/ ATLTRACE(_T(\"last view finder image was %u ms ago\\n\"), dwNow - s_dwLastCall);\n \/\/\n \/\/ s_dwLastCall = dwNow;\n \/\/}\n\n DecodeJpegImage(vecImage);\n\n if (IsWindow())\n PostMessage(WM_VIEWFINDER_AVAIL_IMAGE);\n}\n\nLRESULT ViewFinderImageWindow::OnMessageViewfinderAvailImage(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n CBitmapHandle bmp;\n\n CreateBitmap(bmp);\n SetBitmap(bmp);\n\n \/\/ invalidate control to force redraw\n Invalidate();\n\n TraceViewfinderFps();\n\n return 0;\n}\n\nvoid ViewFinderImageWindow::SetupZebraBrush()\n{\n const WORD c_bitsZebraPatternBrush[8] = { 0x9f, 0x3f, 0x7e, 0xfc, 0xf9, 0xf3, 0xe7, 0xcf };\n\n CBitmap bmZebraPattern;\n bmZebraPattern.CreateBitmap(8, 8, 1, 1, c_bitsZebraPatternBrush);\n\n LOGBRUSH logBrush = { 0 };\n logBrush.lbStyle = BS_PATTERN;\n logBrush.lbHatch = (ULONG_PTR)bmZebraPattern.m_hBitmap;\n logBrush.lbColor = RGB(192, 192, 192);\n\n m_brushZebraPattern.CreateBrushIndirect(&logBrush);\n}\n\nvoid ViewFinderImageWindow::DecodeJpegImage(const std::vector<BYTE>& vecImage)\n{\n \/\/DWORD dwStart = GetTickCount();\n JpegMemoryReader jpegReader(vecImage);\n\n try\n {\n jpegReader.Read();\n }\n catch(...)\n {\n static bool s_bWarnedAboutJPEG = false;\n if (!s_bWarnedAboutJPEG)\n {\n LOG_TRACE(_T(\"DecodeJpegImage: failed loading JPEG!\\n\"));\n s_bWarnedAboutJPEG = true;\n }\n return;\n }\n\n \/\/DWORD dwEnd = GetTickCount();\n \/\/ATLTRACE(_T(\"decoding jpg took %u ms\\n\"), dwEnd - dwStart);\n\n std::vector<BYTE>& vecBitmapData = jpegReader.BitmapData();\n\n JpegImageInfo imageInfo = jpegReader.ImageInfo();\n\n {\n LightweightMutex::LockType lock(m_mtxViewfinderData);\n std::swap(m_vecCurrentViewfinderData, vecBitmapData);\n\n m_uiResX = imageInfo.Width();\n m_uiResY = imageInfo.Height();\n }\n}\n\nvoid ViewFinderImageWindow::MakeOverexposedTransparent(std::vector<BYTE>& vecBitmapData)\n{\n ATLASSERT((vecBitmapData.size() % 3) == 0);\n\n size_t uiValues = vecBitmapData.size() \/ 3;\n\n \/\/ 0xff means fully opaque\n std::vector<BYTE> vecTransparentBitmapData(uiValues * 4, 0xff);\n\n for (size_t ui = 0; ui < uiValues; ui++)\n {\n memcpy(&vecTransparentBitmapData[ui * 4], &vecBitmapData[ui * 3], 3);\n\n if (vecBitmapData[ui * 3 + 0] == 0xff ||\n vecBitmapData[ui * 3 + 1] == 0xff ||\n vecBitmapData[ui * 3 + 2] == 0xff)\n {\n vecTransparentBitmapData[ui * 4 + 3] = 0; \/\/ make transparent\n }\n }\n\n vecBitmapData.swap(vecTransparentBitmapData);\n}\n\nvoid ViewFinderImageWindow::CreateBitmap(CBitmapHandle& bmp)\n{\n BITMAPINFO bi = {0};\n\n BITMAPINFOHEADER& bih = bi.bmiHeader;\n bih.biSize = sizeof(bih);\n bih.biBitCount = 24;\n bih.biClrUsed = 0;\n bih.biCompression = BI_RGB;\n bih.biPlanes = 1;\n\n bih.biHeight = -static_cast<LONG>(m_uiResY); \/\/ negative, since bytes represent a top-bottom DIB\n bih.biWidth = m_uiResX;\n\n BITMAPINFOHEADER* lpbmih = &bih;\n BITMAPINFO* lpbmi = &bi;\n\n {\n LightweightMutex::LockType lock(m_mtxViewfinderData);\n\n LPCVOID lpDIBBits = m_vecCurrentViewfinderData.data();\n\n CClientDC dc(m_hWnd);\n bmp.CreateDIBitmap(dc, lpbmih, CBM_INIT, lpDIBBits, lpbmi, DIB_RGB_COLORS);\n }\n}\n\nvoid ViewFinderImageWindow::SetBitmap(CBitmapHandle bmpViewfinder)\n{\n m_bmpViewfinder = bmpViewfinder;\n}\n\nvoid ViewFinderImageWindow::TraceViewfinderFps()\n{\n static unsigned int s_uiViewfinderImageCount = 0;\n static DWORD s_dwLastFpsTime = GetTickCount();\n\n s_uiViewfinderImageCount++;\n\n DWORD dwNow = GetTickCount();\n\n DWORD dwElapsed = dwNow - s_dwLastFpsTime;\n if (dwElapsed > 500)\n {\n CString cszText;\n cszText.Format(_T(\"Viewfinder: %u fps\"), s_uiViewfinderImageCount * 1000 \/ dwElapsed);\n ATLTRACE(_T(\"%s\\n\"), cszText);\n\n s_uiViewfinderImageCount = 0;\n s_dwLastFpsTime = dwNow;\n }\n}\n\nvoid ViewFinderImageWindow::ScaleBitmapSize(const BITMAP& bm, int& iWidth, int& iHeight)\n{\n CRect rcWindow;\n GetClientRect(rcWindow);\n\n double dRatioWindow = rcWindow.Height() == 0 ? 1.0 : (double(rcWindow.Width()) \/ rcWindow.Height());\n double dRatioBitmap = bm.bmHeight == 0 ? 1.0 : (double(bm.bmWidth) \/ bm.bmHeight);\n\n if (dRatioBitmap < dRatioWindow)\n iWidth = int(iHeight * dRatioBitmap);\n else\n iHeight = int(iWidth \/ dRatioBitmap);\n}\n\nvoid ViewFinderImageWindow::DrawLines(CDC& dc, int iWidth, int iHeight)\n{\n \/\/ pen color is the inverse of the background color\n int iLastDrawMode = dc.SetROP2(R2_NOTXORPEN);\n\n CPen pen;\n pen.CreatePen(PS_DOT, 3, RGB(0, 0, 0));\n CPenHandle oldPen = dc.SelectPen(pen);\n\n double dRatio1 = 1.0 \/ 3.0;\n if (m_enLinesMode == linesModeGoldenRatio)\n dRatio1 = c_dGoldenRatio;\n\n double dRatio2 = 1.0 - dRatio1;\n\n \/\/ horizontal lines\n dc.MoveTo(0, int(iHeight * dRatio1));\n dc.LineTo(iWidth-1, int(iHeight * dRatio1));\n\n dc.MoveTo(0, int(iHeight * dRatio2));\n dc.LineTo(iWidth-1,int(iHeight * dRatio2));\n\n \/\/ vertical lines\n dc.MoveTo(int(iWidth * dRatio1), 0);\n dc.LineTo(int(iWidth * dRatio1), iHeight-1);\n\n dc.MoveTo(int(iWidth * dRatio2), 0);\n dc.LineTo(int(iWidth * dRatio2), iHeight-1);\n\n dc.SelectPen(oldPen);\n\n dc.SetROP2(iLastDrawMode);\n}\n\nvoid ViewFinderImageWindow::DrawZebraPattern(CDC& dc, int iWidth, int iHeight)\n{\n \/\/ draw zebra pattern\n HBRUSH hOldBrush = dc.SelectBrush(m_brushZebraPattern);\n\n dc.SetBkMode(TRANSPARENT);\n dc.SetBkColor(RGB(255, 255, 255));\n\n \/\/ in order to move zebra pattern, set pattern brush origin\n DWORD dwNow = GetTickCount();\n int iOffset = (dwNow \/ c_uiZebraPatternMovementInMs) % 8;\n dc.SetBrushOrg(iOffset, 0);\n\n CRect rcImage(CPoint(0, 0), CSize(iWidth, iHeight));\n dc.Rectangle(&rcImage);\n\n dc.SelectBrush(hOldBrush);\n}\n\nLRESULT ViewFinderImageWindow::OnEraseBkgnd(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n \/\/ disable erasing\n return FALSE;\n}\n\nLRESULT ViewFinderImageWindow::OnPaint(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n CPaintDC dc(m_hWnd);\n\n if (m_bmpViewfinder.IsNull())\n {\n dc.FillSolidRect(&dc.m_ps.rcPaint, RGB(0,0,0));\n return 0;\n }\n\n \/\/ calculate bitmap size\n BITMAP bm = {0};\n GetObject(m_bmpViewfinder, sizeof(bm), &bm);\n\n CRect rcPaint(dc.m_ps.rcPaint);\n\n int iWidth = rcPaint.Width();\n int iHeight = rcPaint.Height();\n\n ScaleBitmapSize(bm, iWidth, iHeight);\n\n rcPaint = CRect(0, 0, iWidth, iHeight);\n\n \/\/ select bitmap into bitmap DC\n CDC bmpDC;\n bmpDC.CreateCompatibleDC();\n\n HBITMAP hbmT = bmpDC.SelectBitmap(m_bmpViewfinder);\n\n \/\/ draw to memory DC\n CMemoryDC memDC(dc, dc.m_ps.rcPaint);\n memDC.FillSolidRect(&dc.m_ps.rcPaint, ::GetSysColor(COLOR_3DFACE));\n\n \/\/ blit bitmap\n if (m_bShowZebraPattern)\n {\n DrawZebraPattern(memDC, iWidth, iHeight);\n\n \/\/ draw viewfinder bitmap with transparency\n memDC.TransparentBlt(0, 0, iWidth, iHeight, bmpDC, 0, 0, bm.bmWidth, bm.bmHeight, RGB(255,255,255));\n }\n else\n {\n memDC.SetStretchBltMode(COLORONCOLOR);\n memDC.StretchBlt(0, 0, iWidth, iHeight, bmpDC, 0, 0, bm.bmWidth, bm.bmHeight, SRCCOPY);\n }\n\n bmpDC.SelectBitmap(hbmT);\n\n \/\/ draw lines\n if (m_enLinesMode != linesModeNoLines)\n DrawLines(memDC, iWidth, iHeight);\n\n return 0;\n}\n\nLRESULT ViewFinderImageWindow::OnDestroy(UINT \/*uMsg*\/, WPARAM \/*wParam*\/, LPARAM \/*lParam*\/, BOOL& \/*bHandled*\/)\n{\n if (m_spViewfinder != nullptr)\n {\n m_spViewfinder->SetAvailImageHandler();\n m_spViewfinder.reset();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2005 Stefan Seefeld\n\/\/ All rights reserved.\n\/\/ Licensed to the public under the terms of the GNU LGPL (>= 2),\n\/\/ see the file COPYING for details.\n\/\/\n#ifndef Synopsis_TypeAnalysis_OverloadResolver_hh_\n#define Synopsis_TypeAnalysis_OverloadResolver_hh_\n\n#include <Synopsis\/SymbolLookup\/Table.hh>\n\nnamespace Synopsis\n{\nnamespace TypeAnalysis\n{\n\n\/\/. Resolve a function call in the context of the given scope.\nSymbolLookup::Symbol const *resolve_funcall(PTree::FuncallExpr const *funcall,\n\t\t\t\t\t SymbolLookup::Scope const *);\n\n}\n}\n\n#endif\n\n<commit_msg>Fix include directive.<commit_after>\/\/\n\/\/ Copyright (C) 2005 Stefan Seefeld\n\/\/ All rights reserved.\n\/\/ Licensed to the public under the terms of the GNU LGPL (>= 2),\n\/\/ see the file COPYING for details.\n\/\/\n#ifndef Synopsis_TypeAnalysis_OverloadResolver_hh_\n#define Synopsis_TypeAnalysis_OverloadResolver_hh_\n\n#include <Synopsis\/PTree.hh>\n#include <Synopsis\/SymbolLookup.hh>\n\nnamespace Synopsis\n{\nnamespace TypeAnalysis\n{\n\n\/\/. Resolve a function call in the context of the given scope.\nSymbolLookup::Symbol const *resolve_funcall(PTree::FuncallExpr const *funcall,\n\t\t\t\t\t SymbolLookup::Scope const *);\n\n}\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: officeipcthread.hxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: hr $ $Date: 2003-03-25 13:51:19 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _DESKTOP_OFFICEIPCTHREAD_HXX_\n#define _DESKTOP_OFFICEIPCTHREAD_HXX_\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTERMINATELISTENER_HPP_\n#include <com\/sun\/star\/frame\/XTerminateListener.hpp>\n#endif\n\n#ifndef _VOS_PIPE_HXX_\n#include <vos\/pipe.hxx>\n#endif\n#ifndef _VOS_SECURITY_HXX_\n#include <vos\/security.hxx>\n#endif\n#ifndef _VOS_THREAD_HXX_\n#include <vos\/thread.hxx>\n#endif\n#ifndef _VOS_SIGNAL_HXX_\n#include <vos\/signal.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAKBASE2_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n#ifndef _OSL_CONDITN_HXX_\n#include <osl\/conditn.hxx>\n#endif\n\nnamespace desktop\n{\n\nclass SalMainPipeExchangeSignalHandler : public vos::OSignalHandler\n{\n virtual TSignalAction SAL_CALL signal(TSignalInfo *pInfo);\n};\n\n\/\/ A request for the current office\n\/\/ that was given by command line or by IPC pipe communication.\nstruct ProcessDocumentsRequest\n{\n ::rtl::OUString aOpenList; \/\/ Documents that should be opened in the default way\n ::rtl::OUString aViewList; \/\/ Documents that should be opened in viewmode\n ::rtl::OUString aPrintList; \/\/ Documents that should be printed on default printer\n ::rtl::OUString aForceOpenList; \/\/ Documents that should be forced to open for editing (even templates)\n ::rtl::OUString aForceNewList; \/\/ Documents that should be forced to create a new document\n ::rtl::OUString aPrinterName; \/\/ The printer name that should be used for printing\n ::rtl::OUString aPrintToList; \/\/ Documents that should be printed on the given printer\n ::osl::Condition cProcessed; \/\/ condition to be set when the request has been processed\n};\n\nclass DispatchWatcher;\nclass OfficeIPCThread : public vos::OThread\n{\n private:\n static OfficeIPCThread* pGlobalOfficeIPCThread;\n static ::osl::Mutex* pOfficeIPCThreadMutex;\n\n vos::OPipe maPipe;\n vos::OStreamPipe maStreamPipe;\n static vos::OSecurity maSecurity;\n rtl::OUString maPipeIdent;\n sal_Bool mbBlockRequests;\n int mnPendingRequests;\n DispatchWatcher* mpDispatchWatcher;\n sal_Bool mbShutdownInProgress;\n\n static ::osl::Mutex& GetMutex();\n static const char *sc_aTerminationSequence;\n static const int sc_nTSeqLength;\n static const char *sc_aShowSequence;\n static const int sc_nShSeqLength;\n static const char *sc_aConfirmationSequence;\n static const int sc_nCSeqLength;\n\n OfficeIPCThread();\n\n protected:\n \/\/\/ Working method which should be overridden\n virtual void SAL_CALL run();\n\n public:\n enum Status\n {\n IPC_STATUS_OK,\n IPC_STATUS_2ND_OFFICE,\n IPC_STATUS_BOOTSTRAP_ERROR\n };\n\n virtual ~OfficeIPCThread();\n\n \/\/ controlling pipe communication during shutdown\n static OfficeIPCThread* GetOfficeIPCThread();\n static void BlockAllRequests();\n static sal_Bool AreRequestsPending();\n static void RequestsCompleted( int n = 1 );\n static void ExecuteCmdLineRequests( ProcessDocumentsRequest& );\n\n \/\/ return FALSE if second office\n static Status EnableOfficeIPCThread();\n static void DisableOfficeIPCThread();\n};\n\n\nclass OfficeIPCThreadController : public ::cppu::WeakImplHelper2<\n ::com::sun::star::lang::XServiceInfo,\n ::com::sun::star::frame::XTerminateListener >\n{\n public:\n OfficeIPCThreadController() {}\n virtual ~OfficeIPCThreadController() {}\n\n \/\/ XServiceInfo\n virtual ::rtl::OUString SAL_CALL getImplementationName()\n throw ( ::com::sun::star::uno::RuntimeException );\n virtual sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName )\n throw ( ::com::sun::star::uno::RuntimeException );\n virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames()\n throw ( ::com::sun::star::uno::RuntimeException );\n\n \/\/ XEventListener\n virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source )\n throw( ::com::sun::star::uno::RuntimeException );\n\n \/\/ XTerminateListener\n virtual void SAL_CALL queryTermination( const ::com::sun::star::lang::EventObject& aEvent )\n throw( ::com::sun::star::frame::TerminationVetoException, ::com::sun::star::uno::RuntimeException );\n virtual void SAL_CALL notifyTermination( const ::com::sun::star::lang::EventObject& aEvent )\n throw( ::com::sun::star::uno::RuntimeException );\n};\n\n}\n\n#endif \/\/ _DESKTOP_OFFICEIPCTHREAD_HXX_\n<commit_msg>INTEGRATION: CWS draw10 (1.11.22); FILE MERGED 2003\/04\/30 09:37:26 lo 1.11.22.1: #109140# -start for StartPresentation<commit_after>\/*************************************************************************\n *\n * $RCSfile: officeipcthread.hxx,v $\n *\n * $Revision: 1.12 $\n *\n * last change: $Author: vg $ $Date: 2003-05-16 14:22:30 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _DESKTOP_OFFICEIPCTHREAD_HXX_\n#define _DESKTOP_OFFICEIPCTHREAD_HXX_\n\n#ifndef _COM_SUN_STAR_LANG_XSERVICEINFO_HPP_\n#include <com\/sun\/star\/lang\/XServiceInfo.hpp>\n#endif\n#ifndef _COM_SUN_STAR_FRAME_XTERMINATELISTENER_HPP_\n#include <com\/sun\/star\/frame\/XTerminateListener.hpp>\n#endif\n\n#ifndef _VOS_PIPE_HXX_\n#include <vos\/pipe.hxx>\n#endif\n#ifndef _VOS_SECURITY_HXX_\n#include <vos\/security.hxx>\n#endif\n#ifndef _VOS_THREAD_HXX_\n#include <vos\/thread.hxx>\n#endif\n#ifndef _VOS_SIGNAL_HXX_\n#include <vos\/signal.hxx>\n#endif\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n#ifndef _CPPUHELPER_WEAKBASE2_HXX_\n#include <cppuhelper\/implbase2.hxx>\n#endif\n#ifndef _OSL_CONDITN_HXX_\n#include <osl\/conditn.hxx>\n#endif\n\nnamespace desktop\n{\n\nclass SalMainPipeExchangeSignalHandler : public vos::OSignalHandler\n{\n virtual TSignalAction SAL_CALL signal(TSignalInfo *pInfo);\n};\n\n\/\/ A request for the current office\n\/\/ that was given by command line or by IPC pipe communication.\nstruct ProcessDocumentsRequest\n{\n ::rtl::OUString aOpenList; \/\/ Documents that should be opened in the default way\n ::rtl::OUString aViewList; \/\/ Documents that should be opened in viewmode\n ::rtl::OUString aStartList; \/\/ Documents\/Presentations that should be started\n ::rtl::OUString aPrintList; \/\/ Documents that should be printed on default printer\n ::rtl::OUString aForceOpenList; \/\/ Documents that should be forced to open for editing (even templates)\n ::rtl::OUString aForceNewList; \/\/ Documents that should be forced to create a new document\n ::rtl::OUString aPrinterName; \/\/ The printer name that should be used for printing\n ::rtl::OUString aPrintToList; \/\/ Documents that should be printed on the given printer\n ::osl::Condition cProcessed; \/\/ condition to be set when the request has been processed\n};\n\nclass DispatchWatcher;\nclass OfficeIPCThread : public vos::OThread\n{\n private:\n static OfficeIPCThread* pGlobalOfficeIPCThread;\n static ::osl::Mutex* pOfficeIPCThreadMutex;\n\n vos::OPipe maPipe;\n vos::OStreamPipe maStreamPipe;\n static vos::OSecurity maSecurity;\n rtl::OUString maPipeIdent;\n sal_Bool mbBlockRequests;\n int mnPendingRequests;\n DispatchWatcher* mpDispatchWatcher;\n sal_Bool mbShutdownInProgress;\n\n static ::osl::Mutex& GetMutex();\n static const char *sc_aTerminationSequence;\n static const int sc_nTSeqLength;\n static const char *sc_aShowSequence;\n static const int sc_nShSeqLength;\n static const char *sc_aConfirmationSequence;\n static const int sc_nCSeqLength;\n\n OfficeIPCThread();\n\n protected:\n \/\/\/ Working method which should be overridden\n virtual void SAL_CALL run();\n\n public:\n enum Status\n {\n IPC_STATUS_OK,\n IPC_STATUS_2ND_OFFICE,\n IPC_STATUS_BOOTSTRAP_ERROR\n };\n\n virtual ~OfficeIPCThread();\n\n \/\/ controlling pipe communication during shutdown\n static OfficeIPCThread* GetOfficeIPCThread();\n static void BlockAllRequests();\n static sal_Bool AreRequestsPending();\n static void RequestsCompleted( int n = 1 );\n static void ExecuteCmdLineRequests( ProcessDocumentsRequest& );\n\n \/\/ return FALSE if second office\n static Status EnableOfficeIPCThread();\n static void DisableOfficeIPCThread();\n};\n\n\nclass OfficeIPCThreadController : public ::cppu::WeakImplHelper2<\n ::com::sun::star::lang::XServiceInfo,\n ::com::sun::star::frame::XTerminateListener >\n{\n public:\n OfficeIPCThreadController() {}\n virtual ~OfficeIPCThreadController() {}\n\n \/\/ XServiceInfo\n virtual ::rtl::OUString SAL_CALL getImplementationName()\n throw ( ::com::sun::star::uno::RuntimeException );\n virtual sal_Bool SAL_CALL supportsService( const ::rtl::OUString& ServiceName )\n throw ( ::com::sun::star::uno::RuntimeException );\n virtual ::com::sun::star::uno::Sequence< ::rtl::OUString > SAL_CALL getSupportedServiceNames()\n throw ( ::com::sun::star::uno::RuntimeException );\n\n \/\/ XEventListener\n virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source )\n throw( ::com::sun::star::uno::RuntimeException );\n\n \/\/ XTerminateListener\n virtual void SAL_CALL queryTermination( const ::com::sun::star::lang::EventObject& aEvent )\n throw( ::com::sun::star::frame::TerminationVetoException, ::com::sun::star::uno::RuntimeException );\n virtual void SAL_CALL notifyTermination( const ::com::sun::star::lang::EventObject& aEvent )\n throw( ::com::sun::star::uno::RuntimeException );\n};\n\n}\n\n#endif \/\/ _DESKTOP_OFFICEIPCTHREAD_HXX_\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Touhou Community Reliant Automatic Patcher\n * Tasogare Frontier support plugin\n *\n * ----\n *\n * Plugin breakpoints and hooks for th175.\n *\/\n\n#include <thcrap.h>\n#include \"thcrap_tasofro.h\"\n#include \"files_list.h\"\n#include \"act-nut.h\"\n\nint th175_init()\n{\n\tpatchhook_register(\"*.pl\", patch_th175_pl, nullptr);\n\tpatchhook_register(\"*.nut\", patch_nut, nullptr);\n\n\treturn 0;\n}\n\nstruct AVfile_handle\n{\n\tvoid *vtable;\n\tHANDLE hFile;\n\tuint32_t unk1;\n\tuint32_t unk2;\n};\n\nstruct AVFileIO_DefaultReader\n{\n\tvoid *vtable;\n\tAVfile_handle handle;\n};\n\nstruct AVPackageReader\n{\n\tvoid* vtable;\n\tDWORD refcount; \/\/ from IUnknown\n\tuint32_t unk_08;\n\tuint32_t unk_0C;\n\tuint32_t file_offset;\n\tuint32_t unk_14;\n\tuint32_t file_size;\n\tuint32_t unk_1c;\n\t\/\/ Game does SetFilePointer(..., file_offset + file_segment_offset, ...)\n\tuint32_t file_segment_offset;\n\tuint32_t unk_24;\n\tuint32_t unk_28;\n\n\tAVFileIO_DefaultReader* file_reader;\n};\n\nstatic std::map<AVPackageReader*, TasofroFile> open_files;\nstd::mutex open_files_mutex;\n\nextern \"C\" int BP_th175_open_file(x86_reg_t *regs, json_t *bp_info)\n{\n\tconst char *file_name = (const char*)json_object_get_immediate(bp_info, regs, \"file_name\");\n\tAVPackageReader *reader = (AVPackageReader*)json_object_get_immediate(bp_info, regs, \"file_reader\");\n\n\tif (!file_name || !reader) {\n\t\treturn 1;\n\t}\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tTasofroFile& fr = open_files[reader];\n\n\tfr.init(file_name);\n\tif (!fr.need_replace()) {\n\t\topen_files.erase(reader);\n\t\treturn 1;\n\t}\n\n\treader->file_size = fr.init_game_file_size(static_cast<size_t>(reader->file_size));\n\n\treturn 1;\n}\n\nvoid do_partial_xor(uint8_t* dst, uint8_t* src, size_t size)\n{\n\tfor (size_t i = 0; i < size; i++) {\n\t\tdst[i] ^= src[i];\n\t}\n}\n\n\/\/ More readable version of the decrypt code.\n\/\/ This one also doesn't require the input buffer size to be divisible by 4\nuint32_t do_decrypt_step(uint32_t key)\n{\n\tint64_t a = key * 0x5E4789C9ll;\n\tuint32_t b = (a >> 0x2E) + (a >> 0x3F);\n\tuint32_t ret = (key - b * 0xADC8) * 0xBC8F + b * 0xFFFFF2B9;\n\tif ((int32_t)ret <= 0) {\n\t\tret += 0x7FFFFFFF;\n\t}\n\treturn ret;\n}\n\nvoid th175_crypt_file(uint8_t* buffer, size_t size, size_t offset_in_file)\n{\n\tsize_t bytes_processed = 0;\n\t\/\/ File key, derived from the file's size and its offset in the archive file.\n\tuint32_t file_key = size ^ offset_in_file;\n\n\tfor (size_t pos = 0; pos < size; pos += 4) {\n\t\tuint32_t xor = 0;\n\t\tuint32_t tmp_key = file_key;\n\t\tfor (size_t i = 0; i < 4; i++) {\n\t\t\ttmp_key = do_decrypt_step(tmp_key);\n\t\t\txor = (xor << 8) | (tmp_key & 0xFF);\n\t\t}\n\n\t\tif (pos + 4 <= size) {\n\t\t\t*(uint32_t*)(buffer + pos) ^= xor;\n\t\t\tbytes_processed += 4;\n\t\t}\n\t\telse {\n\t\t\tdo_partial_xor(buffer + pos, (uint8_t*)&xor, size - pos);\n\t\t\tbytes_processed += size - pos;\n\t\t}\n\t\tfile_key++;\n\t}\n\n\tassert(bytes_processed == size);\n}\n\nextern \"C\" int BP_th175_replaceReadFile(x86_reg_t *regs, json_t *bp_info)\n{\n\tAVfile_handle *handle = (AVfile_handle*)json_object_get_immediate(bp_info, regs, \"file_handle\");\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tauto it = std::find_if(open_files.begin(), open_files.end(), [handle](const std::pair<AVPackageReader* const, TasofroFile>& it) {\n\t\treturn &it.first->file_reader->handle == handle;\n\t});\n\tif (it == open_files.end()) {\n\t\treturn 1;\n\t}\n\n\treturn it->second.replace_ReadFile(regs,\n\t\t[&it](TasofroFile *fr, BYTE *buffer, DWORD size) {\n\t\t\t\/\/ Make sure we use the old size, which is part of the xor\n\t\t\tif (fr->pre_json_size > size) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tth175_crypt_file(buffer, fr->pre_json_size, it->first->file_offset + it->first->file_segment_offset);\n\t\t},\n\t\t[&it](TasofroFile *fr, BYTE *buffer, DWORD size) {\n\t\t\t\/\/ Make sure we use the game reader's size, which will be used when the game decrypts its file\n\t\t\tif (it->first->file_size > size) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tth175_crypt_file(buffer, static_cast<size_t>(it->first->file_size), it->first->file_offset + it->first->file_segment_offset);\n\t\t}\n\t);\n}\n\nextern \"C\" int BP_th175_close_file(x86_reg_t *regs, json_t *bp_info)\n{\n\tAVPackageReader *reader = (AVPackageReader*)json_object_get_immediate(bp_info, regs, \"file_reader\");\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tauto it = open_files.find(reader);\n\tif (it == open_files.end()) {\n\t\treturn 1;\n\t}\n\n\topen_files.erase(it);\n\treturn 1;\n}\n<commit_msg>tasofro: pass better parameters to th175_crypt_file<commit_after>\/**\n * Touhou Community Reliant Automatic Patcher\n * Tasogare Frontier support plugin\n *\n * ----\n *\n * Plugin breakpoints and hooks for th175.\n *\/\n\n#include <thcrap.h>\n#include \"thcrap_tasofro.h\"\n#include \"files_list.h\"\n#include \"act-nut.h\"\n\nint th175_init()\n{\n\tpatchhook_register(\"*.pl\", patch_th175_pl, nullptr);\n\tpatchhook_register(\"*.nut\", patch_nut, nullptr);\n\n\treturn 0;\n}\n\nstruct AVfile_handle\n{\n\tvoid *vtable;\n\tHANDLE hFile;\n\tuint32_t unk1;\n\tuint32_t unk2;\n};\n\nstruct AVFileIO_DefaultReader\n{\n\tvoid *vtable;\n\tAVfile_handle handle;\n};\n\nstruct AVPackageReader\n{\n\tvoid* vtable;\n\tDWORD refcount; \/\/ from IUnknown\n\tuint32_t unk_08;\n\tuint32_t unk_0C;\n\tuint32_t file_offset;\n\tuint32_t unk_14;\n\tuint32_t file_size;\n\tuint32_t unk_1c;\n\t\/\/ Game does SetFilePointer(..., file_offset + file_segment_offset, ...)\n\tuint32_t file_segment_offset;\n\tuint32_t unk_24;\n\tuint32_t unk_28;\n\n\tAVFileIO_DefaultReader* file_reader;\n};\n\nstatic std::map<AVPackageReader*, TasofroFile> open_files;\nstd::mutex open_files_mutex;\n\nextern \"C\" int BP_th175_open_file(x86_reg_t *regs, json_t *bp_info)\n{\n\tconst char *file_name = (const char*)json_object_get_immediate(bp_info, regs, \"file_name\");\n\tAVPackageReader *reader = (AVPackageReader*)json_object_get_immediate(bp_info, regs, \"file_reader\");\n\n\tif (!file_name || !reader) {\n\t\treturn 1;\n\t}\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tTasofroFile& fr = open_files[reader];\n\n\tfr.init(file_name);\n\tif (!fr.need_replace()) {\n\t\topen_files.erase(reader);\n\t\treturn 1;\n\t}\n\n\treader->file_size = fr.init_game_file_size(static_cast<size_t>(reader->file_size));\n\n\treturn 1;\n}\n\nvoid do_partial_xor(uint8_t* dst, uint8_t* src, size_t size)\n{\n\tfor (size_t i = 0; i < size; i++) {\n\t\tdst[i] ^= src[i];\n\t}\n}\n\n\/\/ More readable version of the decrypt code.\n\/\/ This one also doesn't require the input buffer size to be divisible by 4\nuint32_t do_decrypt_step(uint32_t key)\n{\n\tint64_t a = key * 0x5E4789C9ll;\n\tuint32_t b = (a >> 0x2E) + (a >> 0x3F);\n\tuint32_t ret = (key - b * 0xADC8) * 0xBC8F + b * 0xFFFFF2B9;\n\tif ((int32_t)ret <= 0) {\n\t\tret += 0x7FFFFFFF;\n\t}\n\treturn ret;\n}\n\nvoid th175_crypt_file(uint8_t* buffer, size_t size, size_t offset_in_file)\n{\n\tsize_t bytes_processed = 0;\n\t\/\/ File key, derived from the file's size and its offset in the archive file.\n\tuint32_t file_key = size ^ offset_in_file;\n\n\tfor (size_t pos = 0; pos < size; pos += 4) {\n\t\tuint32_t xor = 0;\n\t\tuint32_t tmp_key = file_key;\n\t\tfor (size_t i = 0; i < 4; i++) {\n\t\t\ttmp_key = do_decrypt_step(tmp_key);\n\t\t\txor = (xor << 8) | (tmp_key & 0xFF);\n\t\t}\n\n\t\tif (pos + 4 <= size) {\n\t\t\t*(uint32_t*)(buffer + pos) ^= xor;\n\t\t\tbytes_processed += 4;\n\t\t}\n\t\telse {\n\t\t\tdo_partial_xor(buffer + pos, (uint8_t*)&xor, size - pos);\n\t\t\tbytes_processed += size - pos;\n\t\t}\n\t\tfile_key++;\n\t}\n\n\tassert(bytes_processed == size);\n}\n\nextern \"C\" int BP_th175_replaceReadFile(x86_reg_t *regs, json_t *bp_info)\n{\n\tAVfile_handle *handle = (AVfile_handle*)json_object_get_immediate(bp_info, regs, \"file_handle\");\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tauto it = std::find_if(open_files.begin(), open_files.end(), [handle](const std::pair<AVPackageReader* const, TasofroFile>& it) {\n\t\treturn &it.first->file_reader->handle == handle;\n\t});\n\tif (it == open_files.end()) {\n\t\treturn 1;\n\t}\n\n\treturn it->second.replace_ReadFile(regs,\n\t\t[&it](TasofroFile *fr, BYTE *buffer, DWORD size) {\n\t\t\t\/\/ Make sure we use the old size, which is part of the xor\n\t\t\tif (fr->pre_json_size > size) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tth175_crypt_file(buffer, fr->pre_json_size, it->second.offset);\n\t\t},\n\t\t[&it](TasofroFile *fr, BYTE *buffer, DWORD size) {\n\t\t\t\/\/ Make sure we use the game reader's size, which will be used when the game decrypts its file\n\t\t\tif (it->first->file_size > size) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tth175_crypt_file(buffer, static_cast<size_t>(it->first->file_size), it->first->file_offset);\n\t\t}\n\t);\n}\n\nextern \"C\" int BP_th175_close_file(x86_reg_t *regs, json_t *bp_info)\n{\n\tAVPackageReader *reader = (AVPackageReader*)json_object_get_immediate(bp_info, regs, \"file_reader\");\n\n\tstd::scoped_lock<std::mutex> lock(open_files_mutex);\n\tauto it = open_files.find(reader);\n\tif (it == open_files.end()) {\n\t\treturn 1;\n\t}\n\n\topen_files.erase(it);\n\treturn 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014, 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc {\n\nvoid to_str_backend<text::char_ptr_to_str_adapter>::write(\n text::char_ptr_to_str_adapter const & cs, io::text::writer * ptwOut\n) {\n void const * p;\n std::size_t cb;\n text::encoding enc;\n if (cs.m_psz) {\n p = cs.m_psz;\n std::size_t cch = text::size_in_chars(cs.m_psz);\n enc = text::guess_encoding(cs.m_psz, cs.m_psz + cch);\n cb = sizeof(char) * cch;\n } else {\n static char_t const sc_szNull[] = ABC_SL(\"<nullptr>\");\n p = sc_szNull;\n enc = text::encoding::host;\n cb = sizeof(char_t) * ABC_SL_SIZE(sc_szNull);\n }\n text::detail::str_to_str_backend::write(p, cb, enc, ptwOut);\n}\n\n} \/\/namespace abc\n<commit_msg>Avoid explicitly naming types<commit_after>\/* -*- coding: utf-8; mode: c++; tab-width: 3; indent-tabs-mode: nil -*-\n\nCopyright 2010, 2011, 2012, 2013, 2014, 2015\nRaffaello D. Di Napoli\n\nThis file is part of Abaclade.\n\nAbaclade is free software: you can redistribute it and\/or modify it under the terms of the GNU\nGeneral Public License as published by the Free Software Foundation, either version 3 of the\nLicense, or (at your option) any later version.\n\nAbaclade is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even\nthe implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\nPublic License for more details.\n\nYou should have received a copy of the GNU General Public License along with Abaclade. If not, see\n<http:\/\/www.gnu.org\/licenses\/>.\n--------------------------------------------------------------------------------------------------*\/\n\n#include <abaclade.hxx>\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nnamespace abc {\n\nvoid to_str_backend<text::char_ptr_to_str_adapter>::write(\n text::char_ptr_to_str_adapter const & cs, io::text::writer * ptwOut\n) {\n void const * p;\n std::size_t cb;\n text::encoding enc;\n if (cs.m_psz) {\n p = cs.m_psz;\n std::size_t cch = text::size_in_chars(cs.m_psz);\n enc = text::guess_encoding(cs.m_psz, cs.m_psz + cch);\n cb = sizeof cs.m_psz[0] * cch;\n } else {\n static char_t const sc_szNull[] = ABC_SL(\"<nullptr>\");\n p = sc_szNull;\n enc = text::encoding::host;\n cb = sizeof sc_szNull - sizeof sc_szNull[0] \/*NUL*\/;\n }\n text::detail::str_to_str_backend::write(p, cb, enc, ptwOut);\n}\n\n} \/\/namespace abc\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (directui@nokia.com)\n**\n** This file is part of libmeegotouch.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at directui@nokia.com.\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n#include \"ut_mapplicationpage.h\"\n\n#include <MApplicationWindow>\n#include <MApplication>\n#include \"mapplicationpage_p.h\"\n#include <MSceneManager>\n\n#include <MPannableViewport>\n#include <MAction>\n#include <MButton>\n#include <MLayout>\n#include <MGridLayoutPolicy>\n\n#include \"mondisplaychangeevent.h\"\n\nvoid Ut_MApplicationPage::initTestCase()\n{\n static int argc = 1;\n static char *app_name[1] = { (char *) \".\/ut_mapplicationpage\" };\n app = new MApplication(argc, app_name);\n appWin = new MApplicationWindow;\n\n qRegisterMetaType<MApplicationPage *>();\n qRegisterMetaType<MEscapeButtonPanelModel::EscapeMode>();\n}\n\nvoid Ut_MApplicationPage::cleanupTestCase()\n{\n delete appWin;\n delete app;\n}\n\nvoid Ut_MApplicationPage::init()\n{\n m_subject = new MApplicationPage;\n}\n\nvoid Ut_MApplicationPage::cleanup()\n{\n \/\/ important: testCentralWidget deletes m_subject on its own\n if (m_subject) {\n delete m_subject;\n m_subject = 0;\n }\n}\n\nvoid Ut_MApplicationPage::testInitialValues()\n{\n QCOMPARE(m_subject->title(), QString());\n QCOMPARE(m_subject->isContentCreated(), false);\n QVERIFY(m_subject->centralWidget());\n\n QCOMPARE(m_subject->isPannable(), true);\n QCOMPARE(m_subject->escapeMode(), MApplicationPageModel::EscapeAuto);\n QCOMPARE(m_subject->rememberPosition(), true);\n}\n\nvoid Ut_MApplicationPage::testProperties()\n{\n QString title(\"Title of the page\");\n bool pannable = true;\n Qt::Orientations panningDirection = Qt::Horizontal | Qt::Vertical;\n bool autoMarginsForComponents = true;\n MApplicationPageModel::PageEscapeMode escapeMode = MApplicationPageModel::EscapeManualBack;\n bool rememberPosition = false;\n\n m_subject->setTitle(title);\n QCOMPARE(m_subject->title(), title);\n m_subject->setPannable(pannable);\n QCOMPARE(m_subject->isPannable(), pannable);\n m_subject->setPanningDirection(panningDirection);\n QCOMPARE(m_subject->panningDirection(), panningDirection);\n m_subject->setAutoMarginsForComponentsEnabled(autoMarginsForComponents);\n QCOMPARE(m_subject->autoMarginsForComponentsEnabled(), autoMarginsForComponents);\n m_subject->setEscapeMode(escapeMode);\n QCOMPARE(m_subject->escapeMode(), escapeMode);\n m_subject->setRememberPosition(rememberPosition);\n QCOMPARE(m_subject->rememberPosition(), rememberPosition);\n}\n\nvoid Ut_MApplicationPage::testCentralWidget()\n{\n QPointer<MWidget> widget = new MWidget;\n m_subject->setCentralWidget(widget);\n QCOMPARE(m_subject->centralWidget(), widget.data());\n\n \/\/ remove the current central widget and verify that it has been deleted\n m_subject->setCentralWidget(0);\n QCOMPARE(m_subject->centralWidget(), (MWidget *) 0);\n QVERIFY(widget.isNull());\n\n widget = new MWidget;\n m_subject->setCentralWidget(widget);\n QCOMPARE(m_subject->centralWidget(), widget.data());\n\n \/\/ delete the page to see if the central widget is deleted\n delete m_subject;\n m_subject = 0;\n QVERIFY(widget.isNull());\n}\n\nvoid Ut_MApplicationPage::testCreateContent()\n{\n QVERIFY(!m_subject->isContentCreated());\n m_subject->createContent();\n QVERIFY(m_subject->isContentCreated());\n}\n\nvoid Ut_MApplicationPage::testPageTitleChanged()\n{\n qRegisterMetaType< QList<const char *> >(\"QList<const char *>\");\n\n QSignalSpy spy(m_subject->model(), SIGNAL(modified(QList<const char *>)));\n QString title(\"Title!\");\n\n m_subject->setTitle(m_subject->title());\n QCOMPARE(spy.count(), 0);\n m_subject->setTitle(title);\n QCOMPARE(spy.count(), 1);\n QCOMPARE(m_subject->model()->title(), title);\n m_subject->setTitle(title);\n QCOMPARE(spy.count(), 1);\n m_subject->setTitle(QString());\n QCOMPARE(spy.count(), 2);\n QCOMPARE(m_subject->model()->title(), QString());\n}\n\nvoid Ut_MApplicationPage::testRememberPosition()\n{\n m_subject->setRememberPosition(true);\n m_subject->d_func()->pannableViewPort->setPosition(QPointF(0, 10));\n appWin->sceneManager()->appearSceneWindowNow(m_subject);\n QCOMPARE(m_subject->d_func()->pannableViewPort->position() + QPointF(10, 10), QPointF(10, 20));\n QCOMPARE(m_subject->d_func()->pannableViewPort->physics()->position() + QPointF(10, 10), QPointF(10, 20));\n}\n\nvoid Ut_MApplicationPage::testForgetPosition()\n{\n m_subject->setRememberPosition(false);\n m_subject->d_func()->pannableViewPort->setPosition(QPointF(0, 10));\n appWin->sceneManager()->appearSceneWindowNow(m_subject);\n QCOMPARE(m_subject->d_func()->pannableViewPort->position() + QPointF(10, 10), QPointF(10, 10));\n QCOMPARE(m_subject->d_func()->pannableViewPort->physics()->position() + QPointF(10, 10), QPointF(10, 10));\n}\n\nvoid Ut_MApplicationPage::testActionUpdated()\n{\n m_subject->clearActions();\n QSignalSpy spy(m_subject, SIGNAL(actionUpdated(QActionEvent *)));\n QCOMPARE(spy.count(), 0);\n\n m_subject->addAction(new MAction(\"test application page\", m_subject));\n QCOMPARE(spy.count(), 1);\n\n m_subject->clearActions();\n QCOMPARE(spy.count(), 2);\n}\n\nvoid Ut_MApplicationPage::testDefaultComponentDisplayModes()\n{\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Show);\n}\n\nvoid Ut_MApplicationPage::testSettingComponentsDisplayModes()\n{\n MApplicationPageModel *model = m_subject->model();\n\n m_subject->setComponentsDisplayMode(MApplicationPage::NavigationBar, MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(model->navigationBarDisplayMode(), MApplicationPageModel::Hide);\n\n m_subject->setComponentsDisplayMode(MApplicationPage::HomeButton, MApplicationPageModel::AutoHide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::AutoHide);\n QCOMPARE(model->homeButtonDisplayMode(), MApplicationPageModel::AutoHide);\n}\n\nvoid Ut_MApplicationPage::testSettingMultipleComponentsDisplayModes()\n{\n MApplicationPageModel *model = m_subject->model();\n\n m_subject->setComponentsDisplayMode(MApplicationPage::NavigationBar | MApplicationPage::HomeButton,\n MApplicationPageModel::Hide);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(model->navigationBarDisplayMode(), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Hide);\n QCOMPARE(model->homeButtonDisplayMode(), MApplicationPageModel::Hide);\n}\n\nvoid Ut_MApplicationPage::testSettingAllComponentsDisplayMode()\n{\n m_subject->setComponentsDisplayMode(MApplicationPage::AllComponents, MApplicationPageModel::Hide);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Hide);\n\n m_subject->setComponentsDisplayMode(MApplicationPage::AllComponents, MApplicationPageModel::Show);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Show);\n}\n\nvoid Ut_MApplicationPage::testUpdatingWindowTitleWithChangingPageTitle()\n{\n QString title(\"Test title\");\n QString title2(\"Another test title\");\n QString title3(\"Multiple length variants title\\0x9cMult. length var. title\");\n QString title3_longest(\"Multiple length variants title\");\n QString title4;\n\n m_subject->appear();\n\n m_subject->setTitle(title);\n QCOMPARE(appWin->windowTitle(), title);\n m_subject->setTitle(title2);\n QCOMPARE(appWin->windowTitle(), title2);\n m_subject->setTitle(title3);\n QCOMPARE(appWin->windowTitle(), title3_longest);\n m_subject->setTitle(title4);\n QCOMPARE(appWin->windowTitle(), title4);\n}\n\nQTEST_APPLESS_MAIN(Ut_MApplicationPage)\n<commit_msg>Fixes: failing ut_mapplicationpage unittest<commit_after>\/***************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (directui@nokia.com)\n**\n** This file is part of libmeegotouch.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at directui@nokia.com.\n**\n** This library is free software; you can redistribute it and\/or\n** modify it under the terms of the GNU Lesser General Public\n** License version 2.1 as published by the Free Software Foundation\n** and appearing in the file LICENSE.LGPL included in the packaging\n** of this file.\n**\n****************************************************************************\/\n\n#include \"ut_mapplicationpage.h\"\n\n#include <MApplicationWindow>\n#include <MApplication>\n#include \"mapplicationpage_p.h\"\n#include <MSceneManager>\n\n#include <MPannableViewport>\n#include <MAction>\n#include <MButton>\n#include <MLayout>\n#include <MGridLayoutPolicy>\n\n#include \"mondisplaychangeevent.h\"\n\nvoid Ut_MApplicationPage::initTestCase()\n{\n static int argc = 1;\n static char *app_name[1] = { (char *) \".\/ut_mapplicationpage\" };\n app = new MApplication(argc, app_name);\n appWin = new MApplicationWindow;\n\n qRegisterMetaType<MApplicationPage *>();\n qRegisterMetaType<MEscapeButtonPanelModel::EscapeMode>();\n}\n\nvoid Ut_MApplicationPage::cleanupTestCase()\n{\n delete appWin;\n delete app;\n}\n\nvoid Ut_MApplicationPage::init()\n{\n m_subject = new MApplicationPage;\n}\n\nvoid Ut_MApplicationPage::cleanup()\n{\n \/\/ important: testCentralWidget deletes m_subject on its own\n if (m_subject) {\n delete m_subject;\n m_subject = 0;\n }\n}\n\nvoid Ut_MApplicationPage::testInitialValues()\n{\n QCOMPARE(m_subject->title(), QString());\n QCOMPARE(m_subject->isContentCreated(), false);\n QVERIFY(m_subject->centralWidget());\n\n QCOMPARE(m_subject->isPannable(), true);\n QCOMPARE(m_subject->escapeMode(), MApplicationPageModel::EscapeAuto);\n QCOMPARE(m_subject->rememberPosition(), true);\n}\n\nvoid Ut_MApplicationPage::testProperties()\n{\n QString title(\"Title of the page\");\n bool pannable = true;\n Qt::Orientations panningDirection = Qt::Horizontal | Qt::Vertical;\n bool autoMarginsForComponents = true;\n MApplicationPageModel::PageEscapeMode escapeMode = MApplicationPageModel::EscapeManualBack;\n bool rememberPosition = false;\n\n m_subject->setTitle(title);\n QCOMPARE(m_subject->title(), title);\n m_subject->setPannable(pannable);\n QCOMPARE(m_subject->isPannable(), pannable);\n m_subject->setPanningDirection(panningDirection);\n QCOMPARE(m_subject->panningDirection(), panningDirection);\n m_subject->setAutoMarginsForComponentsEnabled(autoMarginsForComponents);\n QCOMPARE(m_subject->autoMarginsForComponentsEnabled(), autoMarginsForComponents);\n m_subject->setEscapeMode(escapeMode);\n QCOMPARE(m_subject->escapeMode(), escapeMode);\n m_subject->setRememberPosition(rememberPosition);\n QCOMPARE(m_subject->rememberPosition(), rememberPosition);\n}\n\nvoid Ut_MApplicationPage::testCentralWidget()\n{\n QPointer<MWidget> widget = new MWidget;\n m_subject->setCentralWidget(widget);\n QCOMPARE(m_subject->centralWidget(), widget.data());\n\n \/\/ remove the current central widget and verify that it has been deleted\n m_subject->setCentralWidget(0);\n QCOMPARE(m_subject->centralWidget(), (MWidget *) 0);\n QVERIFY(widget.isNull());\n\n widget = new MWidget;\n m_subject->setCentralWidget(widget);\n QCOMPARE(m_subject->centralWidget(), widget.data());\n\n \/\/ delete the page to see if the central widget is deleted\n delete m_subject;\n m_subject = 0;\n QVERIFY(widget.isNull());\n}\n\nvoid Ut_MApplicationPage::testCreateContent()\n{\n QVERIFY(!m_subject->isContentCreated());\n m_subject->createContent();\n QVERIFY(m_subject->isContentCreated());\n}\n\nvoid Ut_MApplicationPage::testPageTitleChanged()\n{\n qRegisterMetaType< QList<const char *> >(\"QList<const char *>\");\n\n QSignalSpy spy(m_subject->model(), SIGNAL(modified(QList<const char *>)));\n QString title(\"Title!\");\n\n m_subject->setTitle(m_subject->title());\n QCOMPARE(spy.count(), 0);\n m_subject->setTitle(title);\n QCOMPARE(spy.count(), 1);\n QCOMPARE(m_subject->model()->title(), title);\n m_subject->setTitle(title);\n QCOMPARE(spy.count(), 1);\n m_subject->setTitle(QString());\n QCOMPARE(spy.count(), 2);\n QCOMPARE(m_subject->model()->title(), QString());\n}\n\nvoid Ut_MApplicationPage::testRememberPosition()\n{\n m_subject->setRememberPosition(true);\n m_subject->d_func()->pannableViewPort->adjustSize();\n m_subject->d_func()->pannableViewPort->setPosition(QPointF(0, 10));\n appWin->sceneManager()->appearSceneWindowNow(m_subject);\n QCOMPARE(m_subject->d_func()->pannableViewPort->position() + QPointF(10, 10), QPointF(10, 20));\n QCOMPARE(m_subject->d_func()->pannableViewPort->physics()->position() + QPointF(10, 10), QPointF(10, 20));\n}\n\nvoid Ut_MApplicationPage::testForgetPosition()\n{\n m_subject->setRememberPosition(false);\n m_subject->d_func()->pannableViewPort->adjustSize();\n m_subject->d_func()->pannableViewPort->setPosition(QPointF(0, 10));\n appWin->sceneManager()->appearSceneWindowNow(m_subject);\n QCOMPARE(m_subject->d_func()->pannableViewPort->position() + QPointF(10, 10), QPointF(10, 10));\n QCOMPARE(m_subject->d_func()->pannableViewPort->physics()->position() + QPointF(10, 10), QPointF(10, 10));\n}\n\nvoid Ut_MApplicationPage::testActionUpdated()\n{\n m_subject->clearActions();\n QSignalSpy spy(m_subject, SIGNAL(actionUpdated(QActionEvent *)));\n QCOMPARE(spy.count(), 0);\n\n m_subject->addAction(new MAction(\"test application page\", m_subject));\n QCOMPARE(spy.count(), 1);\n\n m_subject->clearActions();\n QCOMPARE(spy.count(), 2);\n}\n\nvoid Ut_MApplicationPage::testDefaultComponentDisplayModes()\n{\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Show);\n}\n\nvoid Ut_MApplicationPage::testSettingComponentsDisplayModes()\n{\n MApplicationPageModel *model = m_subject->model();\n\n m_subject->setComponentsDisplayMode(MApplicationPage::NavigationBar, MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(model->navigationBarDisplayMode(), MApplicationPageModel::Hide);\n\n m_subject->setComponentsDisplayMode(MApplicationPage::HomeButton, MApplicationPageModel::AutoHide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::AutoHide);\n QCOMPARE(model->homeButtonDisplayMode(), MApplicationPageModel::AutoHide);\n}\n\nvoid Ut_MApplicationPage::testSettingMultipleComponentsDisplayModes()\n{\n MApplicationPageModel *model = m_subject->model();\n\n m_subject->setComponentsDisplayMode(MApplicationPage::NavigationBar | MApplicationPage::HomeButton,\n MApplicationPageModel::Hide);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(model->navigationBarDisplayMode(), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Hide);\n QCOMPARE(model->homeButtonDisplayMode(), MApplicationPageModel::Hide);\n}\n\nvoid Ut_MApplicationPage::testSettingAllComponentsDisplayMode()\n{\n m_subject->setComponentsDisplayMode(MApplicationPage::AllComponents, MApplicationPageModel::Hide);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Hide);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Hide);\n\n m_subject->setComponentsDisplayMode(MApplicationPage::AllComponents, MApplicationPageModel::Show);\n\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::NavigationBar), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::HomeButton), MApplicationPageModel::Show);\n QCOMPARE(m_subject->componentDisplayMode(MApplicationPage::EscapeButton), MApplicationPageModel::Show);\n}\n\nvoid Ut_MApplicationPage::testUpdatingWindowTitleWithChangingPageTitle()\n{\n QString title(\"Test title\");\n QString title2(\"Another test title\");\n QString title3(\"Multiple length variants title\\0x9cMult. length var. title\");\n QString title3_longest(\"Multiple length variants title\");\n QString title4;\n\n m_subject->appear();\n\n m_subject->setTitle(title);\n QCOMPARE(appWin->windowTitle(), title);\n m_subject->setTitle(title2);\n QCOMPARE(appWin->windowTitle(), title2);\n m_subject->setTitle(title3);\n QCOMPARE(appWin->windowTitle(), title3_longest);\n m_subject->setTitle(title4);\n QCOMPARE(appWin->windowTitle(), title4);\n}\n\nQTEST_APPLESS_MAIN(Ut_MApplicationPage)\n<|endoftext|>"} {"text":"<commit_before>#include <socket.h>\n#include <utils\/logger.h>\n\nusing meshy::Socket;\nusing meshy::NativeSocket;\nusing meshy::SocketAddress;\n\n#ifdef OS_WIN32\n#pragma comment(lib, \"Ws2_32.lib\")\t\/\/ closesocket\n#endif \/\/ OS_WIN32\n\nNativeSocket Socket::CreateNativeSocket() {\n\tNativeSocket fd = socket(PF_INET, SOCK_STREAM, 0);\n\tif (INVALID_SOCKET == fd)\n\t{\n#ifdef OS_WIN32\n\t\tTRACE_ERROR(\"Create socket failed! errorno={0}\", WSAGetLastError());\n#else\n\t\tTRACE_ERROR(\"Create socket failed! errorno={0}\", errno);\n#endif\n\t\texit(1);\n\t}\n\treturn fd;\n}\n\nSocket::Socket(NativeSocket nativeSocket, SocketAddress const& address)\n\t: m_nativeSocket(nativeSocket), m_socketAddress(address)\n{\n\t\n}\n\nSocket::~Socket() {\n\tclose();\n}\n\nvoid Socket::close() {\n\tTRACE_ERROR(\"关闭连接socket={}\", m_nativeSocket);\n#ifdef OS_WIN32\n\tclosesocket(m_nativeSocket);\n#else\n\tclose(m_nativeSocket);\n#endif \/\/ OS_WIN32\n\tm_nativeSocket = -1;\n}\n\nNativeSocket Socket::GetNativeSocket()const {\n\treturn m_nativeSocket;\n}\n\nvoid Socket::SetNativeSocket(NativeSocket nativeSocket) {\n\tm_nativeSocket = nativeSocket;\n}\n\nSocketAddress const& Socket::GetSocketAddress()const {\n\treturn m_socketAddress;\n}\n\nint Socket::type()const {\t\n\treturn getsockopt(SOL_SOCKET, SO_TYPE);\n}\n\nint Socket::getsockopt(int level, int optname)const {\n\tint optval = 0, optlen = 0;\n\tint state = ::getsockopt(m_nativeSocket, level, optname, (char*)&optval, &optlen);\n\tif (state)\n\t{\n\t\t\/\/ 发生了错误\n\t\treturn -1;\n\t}\n\treturn optval;\n}\nint Socket::setsockopt(int level, int optname, int optval) {\n\tint optlen = sizeof(optval);\n\tint state = ::setsockopt(m_nativeSocket, level, optname, (char const*)&optval, optlen);\n\tassert(SOCKET_ERROR != state);\n\treturn state;\n}\n\nint Socket::sendbuf()const {\n\treturn getsockopt(SOL_SOCKET, SO_SNDBUF);\n}\nint Socket::recvbuf()const {\n\treturn getsockopt(SOL_SOCKET, SO_RCVBUF);\n}\n\n\nint Socket::sendbuf(int new_size) {\n\treturn setsockopt(SOL_SOCKET, SO_SNDBUF, new_size);\n}\nint Socket::recvbuf(int new_size) {\n\treturn setsockopt(SOL_SOCKET, SO_RCVBUF, new_size);\n}\n\nint Socket::nodelay(bool value) {\n\tint new_value = value;\n\treturn setsockopt(IPPROTO_TCP, TCP_NODELAY, new_value);\n}\n\nint Socket::ReuseAddr() {\n\treturn setsockopt(SOL_SOCKET, SO_REUSEADDR, 1);\n}\n<commit_msg>IOCP 995<commit_after>#include <socket.h>\n#include <utils\/logger.h>\n\nusing meshy::Socket;\nusing meshy::NativeSocket;\nusing meshy::SocketAddress;\n\n#ifdef OS_WIN32\n#pragma comment(lib, \"Ws2_32.lib\")\t\/\/ closesocket\n#endif \/\/ OS_WIN32\n\nNativeSocket Socket::CreateNativeSocket() {\n\tNativeSocket fd = socket(PF_INET, SOCK_STREAM, 0);\n\tif (INVALID_SOCKET == fd)\n\t{\n#ifdef OS_WIN32\n\t\tTRACE_ERROR(\"Create socket failed! errorno={0}\", WSAGetLastError());\n#else\n\t\tTRACE_ERROR(\"Create socket failed! errorno={0}\", errno);\n#endif\n\t\texit(1);\n\t}\n\treturn fd;\n}\n\nSocket::Socket(NativeSocket nativeSocket, SocketAddress const& address)\n\t: m_nativeSocket(nativeSocket), m_socketAddress(address)\n{\n\t\n}\n\nSocket::~Socket() {\n\tclose();\n}\n\nvoid Socket::close() {\n\tTRACE_ERROR(\"关闭连接socket={}\", m_nativeSocket);\n#ifdef OS_WIN32\n\tshutdown(m_nativeSocket, SD_BOTH);\n\t\/\/ closesocket(m_nativeSocket);\t\/\/ 会报995 IocpLoop.cpp(148):GetQueuedCompletionStatus errno=0,Error: 995,fd=176\n#else\n\tclose(m_nativeSocket);\n#endif \/\/ OS_WIN32\n\tm_nativeSocket = INVALID_SOCKET;\t\/\/ 不知道哪里把它当作指针使用了\n}\n\nNativeSocket Socket::GetNativeSocket()const {\n\treturn m_nativeSocket;\n}\n\nvoid Socket::SetNativeSocket(NativeSocket nativeSocket) {\n\tm_nativeSocket = nativeSocket;\n}\n\nSocketAddress const& Socket::GetSocketAddress()const {\n\treturn m_socketAddress;\n}\n\nint Socket::type()const {\t\n\treturn getsockopt(SOL_SOCKET, SO_TYPE);\n}\n\nint Socket::getsockopt(int level, int optname)const {\n\tint optval = 0, optlen = 0;\n\tint state = ::getsockopt(m_nativeSocket, level, optname, (char*)&optval, &optlen);\n\tif (state)\n\t{\n\t\t\/\/ 发生了错误\n\t\treturn -1;\n\t}\n\treturn optval;\n}\nint Socket::setsockopt(int level, int optname, int optval) {\n\tint optlen = sizeof(optval);\n\tint state = ::setsockopt(m_nativeSocket, level, optname, (char const*)&optval, optlen);\n\tassert(SOCKET_ERROR != state);\n\treturn state;\n}\n\nint Socket::sendbuf()const {\n\treturn getsockopt(SOL_SOCKET, SO_SNDBUF);\n}\nint Socket::recvbuf()const {\n\treturn getsockopt(SOL_SOCKET, SO_RCVBUF);\n}\n\n\nint Socket::sendbuf(int new_size) {\n\treturn setsockopt(SOL_SOCKET, SO_SNDBUF, new_size);\n}\nint Socket::recvbuf(int new_size) {\n\treturn setsockopt(SOL_SOCKET, SO_RCVBUF, new_size);\n}\n\nint Socket::nodelay(bool value) {\n\tint new_value = value;\n\treturn setsockopt(IPPROTO_TCP, TCP_NODELAY, new_value);\n}\n\nint Socket::ReuseAddr() {\n\treturn setsockopt(SOL_SOCKET, SO_REUSEADDR, 1);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#include \"BVshared.h\"\n#include \"BVgene.h\"\n\nstd::vector<gene_expression>\ngene_expression_vector(std::vector<std::vector<std::string>> raw_data) {\n int current_row, current_col;\n double current_element;\n bool process = true;\n std::vector<gene_expression> gene_data;\n for (current_row = 1; current_row < raw_data.size(); current_row++) {\n gene_expression ge_row;\n ge_row.gene_name = raw_data[current_row][0];\n \/\/\/\/std::cout << \"Processing gene: \" << ge_row.gene_name << std::endl;\n for (current_col = 0; current_col < raw_data[current_row].size();\n current_col++) {\n try {\n current_element = std::stod(raw_data[current_row][current_col]);\n } catch (std::exception &e) {\n process = false;\n }\n\n if (process) {\n if (current_col > 0 && current_col < 9) {\n \/*std::cout << \"Processing element (type, value): \"\n << \"renal, \" << current_element << std::endl; *\/\n ge_row.renal_disease.push_back(current_element);\n }\n if (current_col >= 9) {\n \/*std::cout << \"Processing element (type, value): \"\n << \"control, \" << current_element << std::endl; *\/\n ge_row.control.push_back(current_element);\n }\n }\n process = true;\n }\n gene_data.push_back(ge_row);\n }\n return gene_data;\n}\n\ngene_result process(gene_expression data_row) {\n int i;\n \/\/ combine vectors to do t-stat permutations\n std::vector<double> all_gene_data;\n all_gene_data.reserve(data_row.renal_disease.size() +\n data_row.control.size()); \/\/ preallocate memory\n all_gene_data.insert(all_gene_data.end(), data_row.renal_disease.begin(),\n data_row.renal_disease.end());\n all_gene_data.insert(all_gene_data.end(), data_row.control.begin(),\n data_row.control.end());\n std::vector<double> permutation_t_stats;\n for (i = 0; i < 1000; i++) {\n \/\/ shuffle the order\n std::random_shuffle(all_gene_data.begin(), all_gene_data.end());\n \/\/ split the vector into 2\n std::vector<double> all_gene_data1(all_gene_data.begin(),\n all_gene_data.begin() +\n data_row.renal_disease.size()),\n all_gene_data2(all_gene_data.begin() + data_row.renal_disease.size(),\n all_gene_data.end());\n \/\/ add the random t-stat to the t-stat list\n double random_t_stat = students_t_stat(all_gene_data1, all_gene_data2);\n \/*if (std::isinf(random_t_stat)) {\n std::cout << \"This data set is infinite: \";\n print_1d_vector(all_gene_data1);\n print_1d_vector(all_gene_data2);\n }*\/\n permutation_t_stats.push_back(random_t_stat);\n }\n\n \/\/ find the d-score\n double t_stat = students_t_stat(data_row.renal_disease, data_row.control);\n double random_t_stat_mean = mean(permutation_t_stats);\n double random_standard_deviation = standard_deviation(permutation_t_stats);\n double absolute_value = std::abs(t_stat - random_t_stat_mean);\n double d_score = absolute_value \/ random_standard_deviation;\n return gene_result(data_row.gene_name, d_score);\n}\n<commit_msg>remove ugly comments<commit_after>#include <cmath>\n#include <iostream>\n#include <string>\n#include <vector>\n#include \"BVshared.h\"\n#include \"BVgene.h\"\n\nstd::vector<gene_expression>\ngene_expression_vector(std::vector<std::vector<std::string>> raw_data) {\n int current_row, current_col;\n double current_element;\n bool process = true;\n std::vector<gene_expression> gene_data;\n for (current_row = 1; current_row < raw_data.size(); current_row++) {\n gene_expression ge_row;\n ge_row.gene_name = raw_data[current_row][0];\n for (current_col = 0; current_col < raw_data[current_row].size();\n current_col++) {\n try {\n current_element = std::stod(raw_data[current_row][current_col]);\n } catch (std::exception &e) {\n process = false;\n }\n\n if (process) {\n if (current_col > 0 && current_col < 9) {\n ge_row.renal_disease.push_back(current_element);\n }\n if (current_col >= 9) {\n ge_row.control.push_back(current_element);\n }\n }\n process = true;\n }\n gene_data.push_back(ge_row);\n }\n return gene_data;\n}\n\ngene_result process(gene_expression data_row) {\n int i;\n \/\/ combine vectors to do t-stat permutations\n std::vector<double> all_gene_data;\n all_gene_data.reserve(data_row.renal_disease.size() +\n data_row.control.size()); \/\/ preallocate memory\n all_gene_data.insert(all_gene_data.end(), data_row.renal_disease.begin(),\n data_row.renal_disease.end());\n all_gene_data.insert(all_gene_data.end(), data_row.control.begin(),\n data_row.control.end());\n std::vector<double> permutation_t_stats;\n for (i = 0; i < 1000; i++) {\n \/\/ shuffle the order\n std::random_shuffle(all_gene_data.begin(), all_gene_data.end());\n \/\/ split the vector into 2\n std::vector<double> all_gene_data1(all_gene_data.begin(),\n all_gene_data.begin() +\n data_row.renal_disease.size()),\n all_gene_data2(all_gene_data.begin() + data_row.renal_disease.size(),\n all_gene_data.end());\n \/\/ add the random t-stat to the t-stat list\n double random_t_stat = students_t_stat(all_gene_data1, all_gene_data2);\n permutation_t_stats.push_back(random_t_stat);\n }\n\n \/\/ find the d-score\n double t_stat = students_t_stat(data_row.renal_disease, data_row.control);\n double random_t_stat_mean = mean(permutation_t_stats);\n double random_standard_deviation = standard_deviation(permutation_t_stats);\n double absolute_value = std::abs(t_stat - random_t_stat_mean);\n double d_score = absolute_value \/ random_standard_deviation;\n return gene_result(data_row.gene_name, d_score);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 New Designs Unlimited, LLC\n * Opensource Automated License Plate Recognition [http:\/\/www.openalpr.com]\n *\n * This file is part of OpenAlpr.\n *\n * OpenAlpr is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License\n * version 3 as published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n\n#include <iostream>\n#include <stdio.h>\n#include <fstream>\n#include <sys\/stat.h>\n#include \"support\/filesystem.h\"\n#include \"..\/tclap\/CmdLine.h\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace alpr;\n\n\/\/ Takes a directory full of single char images, and plops them on a big tif files\n\/\/ Also creates a box file so Tesseract can recognize it\nint main( int argc, const char** argv )\n{\n string inDir;\n int tile_width;\n int tile_height;\n\n TCLAP::CmdLine cmd(\"OpenAlpr OCR Training Prep Utility\", ' ', \"1.0.0\");\n\n TCLAP::UnlabeledValueArg<std::string> inputDirArg( \"input_dir\", \"Folder containing individual character images\", true, \"\", \"input_dir_path\" );\n\n \n TCLAP::ValueArg<int> tileWidthArg(\"\",\"tile_width\",\"Width (in pixels) for each character tile. Default=50\",false, 50 ,\"tile_width_px\");\n TCLAP::ValueArg<int> tileHeightArg(\"\",\"tile_height\",\"Height (in pixels) for each character tile. Default=60\",false, 60 ,\"tile_height_px\");\n \n try\n {\n cmd.add( inputDirArg );\n cmd.add( tileWidthArg );\n cmd.add( tileHeightArg );\n\n \n if (cmd.parse( argc, argv ) == false)\n {\n \/\/ Error occured while parsing. Exit now.\n return 1;\n }\n\n inDir = inputDirArg.getValue();\n tile_width = tileWidthArg.getValue();\n tile_height = tileHeightArg.getValue();\n \n }\n catch (TCLAP::ArgException &e) \/\/ catch any exceptions\n {\n std::cerr << \"error: \" << e.error() << \" for arg \" << e.argId() << std::endl;\n return 1;\n }\n \n \n\n if (DirectoryExists(inDir.c_str()) == false)\n {\n printf(\"Output dir does not exist\\n\");\n return 0;\n }\n\n\n if (DirectoryExists(inDir.c_str()))\n {\n const int CHAR_PADDING_HORIZONTAL = 0;\n const int CHAR_PADDING_VERTICAL = 0;\n \n const int X_OFFSET = 5;\n const int Y_OFFSET = 5;\n\n const int PAGE_MARGIN_X = 70;\n const int PAGE_MARGIN_Y = 70;\n const int HORIZONTAL_RESOLUTION = 3500;\n const int MAX_VERTICAL_RESOLUTION = 6000; \/\/ Maximum vertical size before chopping into additional pages.\n\n const int TILE_WIDTH = tile_width;\n const int TILE_HEIGHT = tile_height;\n const int CHAR_HORIZ_OFFSET = 40;\n const int CHAR_VERT_OFFSET = 48;\n\n const int FIXED_CHAR_HEIGHT = 40; \/\/ RESIZE all characters to this height\n \n vector<string> files = getFilesInDir(inDir.c_str());\n\n sort( files.begin(), files.end(), stringCompare );\n \n for (int i = 0; i< files.size(); i++)\n {\n if (hasEnding(files[i], \".png\") || hasEnding(files[i], \".jpg\"))\n {\n\t\n }\n else\n {\n\tstd::cerr << \"Non-image file detected in this directory. This must be removed first\" << std::endl;\n\treturn 1;\n }\n }\n \n \n int tiles_per_row = ((float) (HORIZONTAL_RESOLUTION - (PAGE_MARGIN_X * 2))) \/ ((float) TILE_WIDTH);\n int lines = files.size() \/ (tiles_per_row);\n int vertical_resolution = (lines * TILE_HEIGHT) + (PAGE_MARGIN_Y * 3) ;\n cout << tiles_per_row << \" : \" << vertical_resolution << endl;\n\n Mat bigTif = Mat::zeros(Size(HORIZONTAL_RESOLUTION, vertical_resolution), CV_8U);\n bitwise_not(bigTif, bigTif);\n\n stringstream boxFileOut;\n\n for (int i = 0; i< files.size(); i++)\n {\n int col = i % tiles_per_row;\n int line = i \/ tiles_per_row;\n\n int xPos = (col * TILE_WIDTH) + PAGE_MARGIN_X;\n int yPos = (line * TILE_HEIGHT) + PAGE_MARGIN_Y;\n\n if (hasEnding(files[i], \".png\") || hasEnding(files[i], \".jpg\"))\n {\n string fullpath = inDir + \"\/\" + files[i];\n\n cout << \"Processing file: \" << (i + 1) << \" of \" << files.size() << endl;\n\n char charcode = files[i][0];\n\n Mat characterImg = imread(fullpath);\n\n\t\n Mat charImgCopy = Mat::zeros(Size(150, 150), characterImg.type());\n bitwise_not(charImgCopy, charImgCopy);\n\n characterImg.copyTo(charImgCopy(Rect(X_OFFSET, Y_OFFSET, characterImg.cols, characterImg.rows)));\n cvtColor(charImgCopy, charImgCopy, CV_BGR2GRAY);\n bitwise_not(charImgCopy, charImgCopy);\n\n vector<vector<Point> > contours;\n\n \/\/imshow(\"copy\", charImgCopy);\n findContours(charImgCopy, contours, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);\n\n\tfloat minHeightPercent = 0.35;\n\tint minHeight = (int) (((float) characterImg.rows) * minHeightPercent);\n\n\tvector<Rect> tallEnoughRects;\n for (int c = 0; c < contours.size(); c++)\n {\n Rect tmpRect = boundingRect(contours[c]);\n if (tmpRect.height > minHeight)\n tallEnoughRects.push_back( tmpRect );\n }\n\n\tint xMin = 9999999, xMax = 0, yMin = 9999999, yMax = 0;\n \/\/ Combine all the \"tall enough\" rectangles into one super rectangle\n for (int r = 0; r < tallEnoughRects.size(); r++)\n\t{\n\t if (tallEnoughRects[r].x < xMin)\n\t xMin = tallEnoughRects[r].x;\n\t if (tallEnoughRects[r].y < yMin)\n\t yMin = tallEnoughRects[r].y;\n\t if (tallEnoughRects[r].x + tallEnoughRects[r].width > xMax)\n\t xMax = tallEnoughRects[r].x + tallEnoughRects[r].width;\n\t if (tallEnoughRects[r].y + tallEnoughRects[r].height > yMax)\n\t yMax = tallEnoughRects[r].y + tallEnoughRects[r].height;\n\t}\n\t\n Rect tallestRect(xMin, yMin, xMax - xMin, yMax - yMin);\n\t\n\t\n \/\/cout << tallestRect.x << \":\" << tallestRect.y << \" -- \" << tallestRect.width << \":\" << tallestRect.height << endl;\n\n Rect cropRect(0, tallestRect.y - Y_OFFSET, tallestRect.width, tallestRect.height);\n\n \/\/cout << \"Cropped: \" << cropRect.x << \":\" << cropRect.y << \" -- \" << cropRect.width << \":\" << cropRect.height << endl;\n Mat cropped(characterImg, cropRect);\n cvtColor(cropped, cropped, CV_BGR2GRAY);\n\n Rect destinationRect(xPos + (CHAR_HORIZ_OFFSET - TILE_WIDTH), yPos + (CHAR_VERT_OFFSET - TILE_HEIGHT + (TILE_HEIGHT - tallestRect.height)), tallestRect.width, tallestRect.height);\n\n \/\/cout << \"1\" << endl;\n\n cropped.copyTo(bigTif(destinationRect));\n\n int x1 = destinationRect.x - CHAR_PADDING_HORIZONTAL;\n int y1 = (vertical_resolution - destinationRect.y - destinationRect.height) - CHAR_PADDING_VERTICAL;\n int x2 = (destinationRect.x + destinationRect.width) + CHAR_PADDING_HORIZONTAL;\n int y2 = (vertical_resolution - destinationRect.y) + CHAR_PADDING_VERTICAL;\n \/\/0 70 5602 85 5636 0\n boxFileOut << charcode << \" \" << x1 << \" \" << y1 << \" \";\n boxFileOut << x2 << \" \" << y2 ;\n boxFileOut << \" 0\" << endl;\n\n \/\/rectangle(characterImg, tallestRect, Scalar(0, 255, 0));\n \/\/imshow(\"characterImg\", cropped);\n\n waitKey(2);\n }\n }\n\n imwrite(\"combined.tif\", bigTif);\n ofstream boxFile(\"combined.box\", std::ios::out);\n boxFile << boxFileOut.str();\n }\n}\n<commit_msg>Removed unnecessary if statement<commit_after>\/*\n * Copyright (c) 2015 New Designs Unlimited, LLC\n * Opensource Automated License Plate Recognition [http:\/\/www.openalpr.com]\n *\n * This file is part of OpenAlpr.\n *\n * OpenAlpr is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License\n * version 3 as published by the Free Software Foundation\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Affero General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n\n#include <iostream>\n#include <stdio.h>\n#include <fstream>\n#include <sys\/stat.h>\n#include \"support\/filesystem.h\"\n#include \"..\/tclap\/CmdLine.h\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace alpr;\n\n\/\/ Takes a directory full of single char images, and plops them on a big tif files\n\/\/ Also creates a box file so Tesseract can recognize it\nint main( int argc, const char** argv )\n{\n string inDir;\n int tile_width;\n int tile_height;\n\n TCLAP::CmdLine cmd(\"OpenAlpr OCR Training Prep Utility\", ' ', \"1.0.0\");\n\n TCLAP::UnlabeledValueArg<std::string> inputDirArg( \"input_dir\", \"Folder containing individual character images\", true, \"\", \"input_dir_path\" );\n\n \n TCLAP::ValueArg<int> tileWidthArg(\"\",\"tile_width\",\"Width (in pixels) for each character tile. Default=50\",false, 50 ,\"tile_width_px\");\n TCLAP::ValueArg<int> tileHeightArg(\"\",\"tile_height\",\"Height (in pixels) for each character tile. Default=60\",false, 60 ,\"tile_height_px\");\n \n try\n {\n cmd.add( inputDirArg );\n cmd.add( tileWidthArg );\n cmd.add( tileHeightArg );\n\n \n if (cmd.parse( argc, argv ) == false)\n {\n \/\/ Error occured while parsing. Exit now.\n return 1;\n }\n\n inDir = inputDirArg.getValue();\n tile_width = tileWidthArg.getValue();\n tile_height = tileHeightArg.getValue();\n \n }\n catch (TCLAP::ArgException &e) \/\/ catch any exceptions\n {\n std::cerr << \"error: \" << e.error() << \" for arg \" << e.argId() << std::endl;\n return 1;\n }\n \n \n\n if (DirectoryExists(inDir.c_str()) == false)\n {\n printf(\"Output dir does not exist\\n\");\n return 0;\n }\n\n\n\n const int CHAR_PADDING_HORIZONTAL = 0;\n const int CHAR_PADDING_VERTICAL = 0;\n\n const int X_OFFSET = 5;\n const int Y_OFFSET = 5;\n\n const int PAGE_MARGIN_X = 70;\n const int PAGE_MARGIN_Y = 70;\n const int HORIZONTAL_RESOLUTION = 3500;\n const int MAX_VERTICAL_RESOLUTION = 6000; \/\/ Maximum vertical size before chopping into additional pages.\n\n const int TILE_WIDTH = tile_width;\n const int TILE_HEIGHT = tile_height;\n const int CHAR_HORIZ_OFFSET = 40;\n const int CHAR_VERT_OFFSET = 48;\n\n const int FIXED_CHAR_HEIGHT = 40; \/\/ RESIZE all characters to this height\n\n vector<string> files = getFilesInDir(inDir.c_str());\n\n sort( files.begin(), files.end(), stringCompare );\n\n for (int i = 0; i< files.size(); i++)\n {\n if (hasEnding(files[i], \".png\") || hasEnding(files[i], \".jpg\"))\n {\n\n }\n else\n {\n std::cerr << \"Non-image file detected in this directory. This must be removed first\" << std::endl;\n return 1;\n }\n }\n\n\n int tiles_per_row = ((float) (HORIZONTAL_RESOLUTION - (PAGE_MARGIN_X * 2))) \/ ((float) TILE_WIDTH);\n int lines = files.size() \/ (tiles_per_row);\n int vertical_resolution = (lines * TILE_HEIGHT) + (PAGE_MARGIN_Y * 3) ;\n cout << tiles_per_row << \" : \" << vertical_resolution << endl;\n\n Mat bigTif = Mat::zeros(Size(HORIZONTAL_RESOLUTION, vertical_resolution), CV_8U);\n bitwise_not(bigTif, bigTif);\n\n stringstream boxFileOut;\n\n for (int i = 0; i< files.size(); i++)\n {\n int col = i % tiles_per_row;\n int line = i \/ tiles_per_row;\n\n int xPos = (col * TILE_WIDTH) + PAGE_MARGIN_X;\n int yPos = (line * TILE_HEIGHT) + PAGE_MARGIN_Y;\n\n if (hasEnding(files[i], \".png\") || hasEnding(files[i], \".jpg\"))\n {\n string fullpath = inDir + \"\/\" + files[i];\n\n cout << \"Processing file: \" << (i + 1) << \" of \" << files.size() << endl;\n\n char charcode = files[i][0];\n\n Mat characterImg = imread(fullpath);\n\n\n Mat charImgCopy = Mat::zeros(Size(150, 150), characterImg.type());\n bitwise_not(charImgCopy, charImgCopy);\n\n characterImg.copyTo(charImgCopy(Rect(X_OFFSET, Y_OFFSET, characterImg.cols, characterImg.rows)));\n cvtColor(charImgCopy, charImgCopy, CV_BGR2GRAY);\n bitwise_not(charImgCopy, charImgCopy);\n\n vector<vector<Point> > contours;\n\n \/\/imshow(\"copy\", charImgCopy);\n findContours(charImgCopy, contours, CV_RETR_EXTERNAL, CV_CHAIN_APPROX_SIMPLE);\n\n float minHeightPercent = 0.35;\n int minHeight = (int) (((float) characterImg.rows) * minHeightPercent);\n\n vector<Rect> tallEnoughRects;\n for (int c = 0; c < contours.size(); c++)\n {\n Rect tmpRect = boundingRect(contours[c]);\n if (tmpRect.height > minHeight)\n tallEnoughRects.push_back( tmpRect );\n }\n\n int xMin = 9999999, xMax = 0, yMin = 9999999, yMax = 0;\n \/\/ Combine all the \"tall enough\" rectangles into one super rectangle\n for (int r = 0; r < tallEnoughRects.size(); r++)\n {\n if (tallEnoughRects[r].x < xMin)\n xMin = tallEnoughRects[r].x;\n if (tallEnoughRects[r].y < yMin)\n yMin = tallEnoughRects[r].y;\n if (tallEnoughRects[r].x + tallEnoughRects[r].width > xMax)\n xMax = tallEnoughRects[r].x + tallEnoughRects[r].width;\n if (tallEnoughRects[r].y + tallEnoughRects[r].height > yMax)\n yMax = tallEnoughRects[r].y + tallEnoughRects[r].height;\n }\n\n Rect tallestRect(xMin, yMin, xMax - xMin, yMax - yMin);\n\n\n \/\/cout << tallestRect.x << \":\" << tallestRect.y << \" -- \" << tallestRect.width << \":\" << tallestRect.height << endl;\n\n Rect cropRect(0, tallestRect.y - Y_OFFSET, tallestRect.width, tallestRect.height);\n\n \/\/cout << \"Cropped: \" << cropRect.x << \":\" << cropRect.y << \" -- \" << cropRect.width << \":\" << cropRect.height << endl;\n Mat cropped(characterImg, cropRect);\n cvtColor(cropped, cropped, CV_BGR2GRAY);\n\n Rect destinationRect(xPos + (CHAR_HORIZ_OFFSET - TILE_WIDTH), yPos + (CHAR_VERT_OFFSET - TILE_HEIGHT + (TILE_HEIGHT - tallestRect.height)), tallestRect.width, tallestRect.height);\n\n \/\/cout << \"1\" << endl;\n\n cropped.copyTo(bigTif(destinationRect));\n\n int x1 = destinationRect.x - CHAR_PADDING_HORIZONTAL;\n int y1 = (vertical_resolution - destinationRect.y - destinationRect.height) - CHAR_PADDING_VERTICAL;\n int x2 = (destinationRect.x + destinationRect.width) + CHAR_PADDING_HORIZONTAL;\n int y2 = (vertical_resolution - destinationRect.y) + CHAR_PADDING_VERTICAL;\n \/\/0 70 5602 85 5636 0\n boxFileOut << charcode << \" \" << x1 << \" \" << y1 << \" \";\n boxFileOut << x2 << \" \" << y2 ;\n boxFileOut << \" 0\" << endl;\n\n \/\/rectangle(characterImg, tallestRect, Scalar(0, 255, 0));\n \/\/imshow(\"characterImg\", cropped);\n\n waitKey(2);\n }\n }\n\n imwrite(\"combined.tif\", bigTif);\n ofstream boxFile(\"combined.box\", std::ios::out);\n boxFile << boxFileOut.str();\n \n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2013 The CefSharp Project. All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.\n\n#include \"Stdafx.h\"\n#include \"CookieVisitor.h\"\n\nnamespace CefSharp\n{\n bool CookieVisitor::Visit(const CefCookie& cefCookie, int count, int total, bool& deleteCookie)\n {\n Cookie^ cookie = gcnew Cookie();\n cookie->Name = toClr(cefCookie.name);\n cookie->Value = toClr(cefCookie.value);\n cookie->Domain = toClr(cefCookie.domain);\n cookie->Path = toClr(cefCookie.path);\n cookie->Secure = cefCookie.secure;\n cookie->HttpOnly = cefCookie.httponly;\n\n try\n {\n cookie->Expires = DateTime(cefCookie.expires.year,\n cefCookie.expires.month, cefCookie.expires.day_of_month);\n }\n catch (Exception^ ex)\n {\n\n }\n\n return _visitor->Visit(cookie, count, total, deleteCookie);\n }\n}<commit_msg>Updated to work w\/ changes in StringUtils.<commit_after>\/\/ Copyright 2010-2013 The CefSharp Project. All rights reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.\n\n#include \"Stdafx.h\"\n#include \"CookieVisitor.h\"\n\nnamespace CefSharp\n{\n bool CookieVisitor::Visit(const CefCookie& cefCookie, int count, int total, bool& deleteCookie)\n {\n Cookie^ cookie = gcnew Cookie();\n cookie->Name = StringUtils::ToClr(cefCookie.name);\n cookie->Value = StringUtils::ToClr(cefCookie.value);\n cookie->Domain = StringUtils::ToClr(cefCookie.domain);\n cookie->Path = StringUtils::ToClr(cefCookie.path);\n cookie->Secure = cefCookie.secure;\n cookie->HttpOnly = cefCookie.httponly;\n\n try\n {\n cookie->Expires = DateTime(cefCookie.expires.year,\n cefCookie.expires.month, cefCookie.expires.day_of_month);\n }\n catch (Exception^)\n {\n \/\/ TODO: Why should we just ignore exceptions here...?\n }\n\n return _visitor->Visit(cookie, count, total, deleteCookie);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * paged_grid.cpp\n *\n * Created on: 06.05.2010\n * Author: gmueller\n *\/\n\n#include \"arguments.hpp\"\n\n#include \"gadget\/Grid.hpp\"\n#include \"gadget\/Index3.hpp\"\n#include \"gadget\/SmoothParticle.hpp\"\n#include \"gadget\/GadgetFile.hpp\"\n#include \"gadget\/Vector3.hpp\"\n\n#include <ctime>\n#include <limits>\n#include <algorithm>\n#include <omp.h>\n#include <sstream>\n#include <fstream>\n\nvoid updateRho(std::vector<SmoothParticle> &sph) {\n\tconst size_t s = sph.size();\n#pragma omp parallel for\n\tfor (size_t i = 0; i < s; i++) {\n\t\tsph[i].updateRho(sph);\n\t}\n}\n\nint sph(Arguments &arguments) {\n\n\tint size = arguments.getInt(\"-size\", 240000);\n\tstd::cout << \"Size: \" << size << \" kpc\" << std::endl;\n\n\tVector3f offset;\n\toffset.x = arguments.getFloat(\"-ox\", 0);\n\toffset.y = arguments.getFloat(\"-oy\", 0);\n\toffset.z = arguments.getFloat(\"-oz\", 0);\n\tstd::cout << \"Offset: \" << offset << \" kpc\" << std::endl;\n\n\tfloat h = arguments.getFloat(\"-h\", 0.7);\n\tstd::cout << \"h: \" << h << std::endl;\n\n\tsize_t fileSizeKpc = arguments.getInt(\"-fileSize\", 20000);\n\tstd::cout << \"FileSize: \" << fileSizeKpc << \" kpc \" << std::endl;\n\n\tsize_t marginKpc = arguments.getInt(\"-margin\", 1000);\n\tstd::cout << \"Margin: \" << marginKpc << \" kpc \" << std::endl;\n\n\tstd::string prefix = arguments.getString(\"-prefix\", \"sph\");\n\tstd::cout << \"Prefix: \" << prefix << std::endl;\n\n\tbool verbose = arguments.hasFlag(\"-v\");\n\n\tsize_t bins = size \/ fileSizeKpc;\n\tGrid<std::vector<SmoothParticle> > grid(bins, size);\n\n\tstd::vector<std::string> files;\n\targuments.getVector(\"-f\", files);\n\tfor (size_t iArg = 0; iArg < files.size(); iArg++) {\n\t\tstd::cout << \"Open \" << files[iArg] << \" (\" << (iArg + 1) << \"\/\"\n\t\t\t\t<< files.size() << \")\" << std::endl;\n\n\t\tGadgetFile file;\n\t\tfile.open(files[iArg]);\n\t\tif (file.good() == false) {\n\t\t\tstd::cerr << \"Failed to open file \" << files[iArg] << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tfile.readHeader();\n\t\tint pn = file.getHeader().particleNumberList[0];\n\t\tstd::cout << \" Number of SmoothParticles: \" << pn << std::endl;\n\n\t\tstd::cout << \" Read POS block\" << std::endl;\n\t\tstd::vector<float> pos;\n\t\tif (file.readFloatBlock(\"POS \", pos) == false) {\n\t\t\tstd::cerr << \"Failed to read POS block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read BFLD block\" << std::endl;\n\t\tstd::vector<float> bfld;\n\t\tif (file.readFloatBlock(\"BFLD\", bfld) == false) {\n\t\t\tstd::cerr << \"Failed to read BFLD block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read HSML block\" << std::endl;\n\t\tstd::vector<float> hsml;\n\t\tif (file.readFloatBlock(\"HSML\", hsml) == false) {\n\t\t\tstd::cerr << \"Failed to read HSML block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read RHO block\" << std::endl;\n\t\tstd::vector<float> rho;\n\t\tif (file.readFloatBlock(\"RHO \", rho) == false) {\n\t\t\tstd::cerr << \"Failed to read RHO block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tfor (int iP = 0; iP < pn; iP++) {\n\t\t\tSmoothParticle particle;\n\t\t\tparticle.smoothingLength = hsml[iP] \/ h;\n\t\t\tparticle.position.x = (pos[iP * 3] - size \/ 2) \/ h + size \/ 2;\n\t\t\tparticle.position.y = (pos[iP * 3 + 1] - size \/ 2) \/ h + size \/ 2;\n\t\t\tparticle.position.z = (pos[iP * 3 + 2] - size \/ 2) \/ h + size \/ 2;\n\n\t\t\tparticle.bfield.x = bfld[iP * 3];\n\t\t\tparticle.bfield.y = bfld[iP * 3 + 1];\n\t\t\tparticle.bfield.z = bfld[iP * 3 + 2];\n\n\t\t\tparticle.mass = rho[iP];\n\n\t\t\tVector3f l = particle.position\n\t\t\t\t\t- Vector3f(particle.smoothingLength + marginKpc) - offset;\n\t\t\tl.clamp(0.0, size);\n\n\t\t\tVector3f u = particle.position\n\t\t\t\t\t+ Vector3f(particle.smoothingLength + marginKpc) - offset;\n\t\t\tu.clamp(0.0, size);\n\n\t\t\tIndex3 lower, upper;\n\t\t\tlower.x = (uint32_t) std::floor(l.x \/ fileSizeKpc);\n\t\t\tlower.y = (uint32_t) std::floor(l.y \/ fileSizeKpc);\n\t\t\tlower.z = (uint32_t) std::floor(l.z \/ fileSizeKpc);\n\n\t\t\tupper.x = (uint32_t) std::ceil(u.x \/ fileSizeKpc);\n\t\t\tupper.y = (uint32_t) std::ceil(u.y \/ fileSizeKpc);\n\t\t\tupper.z = (uint32_t) std::ceil(u.z \/ fileSizeKpc);\n\n\t\t\tif (verbose && (iP % 100000 == 0)) {\n\t\t\t\tstd::cout << \"position: \" << particle.position\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"magnetic field: \" << particle.bfield\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"mass: \" << particle.mass << std::endl;\n\t\t\t\tstd::cout << \"smoothing length: \" << particle.smoothingLength\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"lower: \" << lower << std::endl;\n\t\t\t\tstd::cout << \"upper: \" << upper << std::endl;\n\t\t\t}\n\n\t\t\tfor (size_t x = lower.x; x < upper.x; x++)\n\t\t\t\tfor (size_t y = lower.y; y < upper.y; y++)\n\t\t\t\t\tfor (size_t z = lower.z; z < upper.z; z++)\n\t\t\t\t\t\tgrid.get(x, y, z).push_back(particle);\n\t\t}\n\t}\n\n\tstd::cout << \"Write output\" << std::endl;\n\n\tfor (size_t x = 0; x < bins; x++) {\n\t\tif (verbose) {\n\t\t\tstd::cout << \"x = \" << x << std::endl;\n\t\t}\n\n\t\tfor (size_t y = 0; y < bins; y++)\n\t\t\tfor (size_t z = 0; z < bins; z++) {\n\t\t\t\tstd::stringstream sstr;\n\t\t\t\tsstr << prefix << \"-\" << x << \"-\" << y << \"-\" << z << \".raw\";\n\t\t\t\tstd::ofstream out(sstr.str().c_str(), std::ofstream::binary);\n\t\t\t\tupdateRho(grid.get(x, y, z));\n\t\t\t\tuint32_t s = grid.get(x, y, z).size();\n\t\t\t\tif (verbose)\n\t\t\t\t\tstd::cout << s << std::endl;\n\t\t\t\tout.write((const char *) &s, sizeof(uint32_t));\n\t\t\t\tout.write((const char *) &grid.get(x, y, z)[0],\n\t\t\t\t\t\tsizeof(SmoothParticle) * s);\n\t\t\t}\n\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>add veryverbose -vv flag<commit_after>\/*\n * paged_grid.cpp\n *\n * Created on: 06.05.2010\n * Author: gmueller\n *\/\n\n#include \"arguments.hpp\"\n\n#include \"gadget\/Grid.hpp\"\n#include \"gadget\/Index3.hpp\"\n#include \"gadget\/SmoothParticle.hpp\"\n#include \"gadget\/GadgetFile.hpp\"\n#include \"gadget\/Vector3.hpp\"\n\n#include <ctime>\n#include <limits>\n#include <algorithm>\n#include <omp.h>\n#include <sstream>\n#include <fstream>\n\nvoid updateRho(std::vector<SmoothParticle> &sph) {\n\tconst size_t s = sph.size();\n#pragma omp parallel for\n\tfor (size_t i = 0; i < s; i++) {\n\t\tsph[i].updateRho(sph);\n\t}\n}\n\nint sph(Arguments &arguments) {\n\n\tint size = arguments.getInt(\"-size\", 240000);\n\tstd::cout << \"Size: \" << size << \" kpc\" << std::endl;\n\n\tVector3f offset;\n\toffset.x = arguments.getFloat(\"-ox\", 0);\n\toffset.y = arguments.getFloat(\"-oy\", 0);\n\toffset.z = arguments.getFloat(\"-oz\", 0);\n\tstd::cout << \"Offset: \" << offset << \" kpc\" << std::endl;\n\n\tfloat h = arguments.getFloat(\"-h\", 0.7);\n\tstd::cout << \"h: \" << h << std::endl;\n\n\tsize_t fileSizeKpc = arguments.getInt(\"-fileSize\", 20000);\n\tstd::cout << \"FileSize: \" << fileSizeKpc << \" kpc \" << std::endl;\n\n\tsize_t marginKpc = arguments.getInt(\"-margin\", 1000);\n\tstd::cout << \"Margin: \" << marginKpc << \" kpc \" << std::endl;\n\n\tstd::string prefix = arguments.getString(\"-prefix\", \"sph\");\n\tstd::cout << \"Prefix: \" << prefix << std::endl;\n\n\tbool verbose = arguments.hasFlag(\"-v\");\n\tbool veryverbose = arguments.hasFlag(\"-vv\");\n\tif (veryverbose)\n\t\tverbose = true;\n\n\tsize_t bins = size \/ fileSizeKpc;\n\tGrid<std::vector<SmoothParticle> > grid(bins, size);\n\n\tstd::vector<std::string> files;\n\targuments.getVector(\"-f\", files);\n\tfor (size_t iArg = 0; iArg < files.size(); iArg++) {\n\t\tstd::cout << \"Open \" << files[iArg] << \" (\" << (iArg + 1) << \"\/\"\n\t\t\t\t<< files.size() << \")\" << std::endl;\n\n\t\tGadgetFile file;\n\t\tfile.open(files[iArg]);\n\t\tif (file.good() == false) {\n\t\t\tstd::cerr << \"Failed to open file \" << files[iArg] << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tfile.readHeader();\n\t\tint pn = file.getHeader().particleNumberList[0];\n\t\tstd::cout << \" Number of SmoothParticles: \" << pn << std::endl;\n\n\t\tstd::cout << \" Read POS block\" << std::endl;\n\t\tstd::vector<float> pos;\n\t\tif (file.readFloatBlock(\"POS \", pos) == false) {\n\t\t\tstd::cerr << \"Failed to read POS block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read BFLD block\" << std::endl;\n\t\tstd::vector<float> bfld;\n\t\tif (file.readFloatBlock(\"BFLD\", bfld) == false) {\n\t\t\tstd::cerr << \"Failed to read BFLD block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read HSML block\" << std::endl;\n\t\tstd::vector<float> hsml;\n\t\tif (file.readFloatBlock(\"HSML\", hsml) == false) {\n\t\t\tstd::cerr << \"Failed to read HSML block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tstd::cout << \" Read RHO block\" << std::endl;\n\t\tstd::vector<float> rho;\n\t\tif (file.readFloatBlock(\"RHO \", rho) == false) {\n\t\t\tstd::cerr << \"Failed to read RHO block\" << std::endl;\n\t\t\treturn 1;\n\t\t}\n\n\t\tfor (int iP = 0; iP < pn; iP++) {\n\t\t\tSmoothParticle particle;\n\t\t\tparticle.smoothingLength = hsml[iP] \/ h;\n\t\t\tparticle.position.x = (pos[iP * 3] - size \/ 2) \/ h + size \/ 2;\n\t\t\tparticle.position.y = (pos[iP * 3 + 1] - size \/ 2) \/ h + size \/ 2;\n\t\t\tparticle.position.z = (pos[iP * 3 + 2] - size \/ 2) \/ h + size \/ 2;\n\n\t\t\tparticle.bfield.x = bfld[iP * 3];\n\t\t\tparticle.bfield.y = bfld[iP * 3 + 1];\n\t\t\tparticle.bfield.z = bfld[iP * 3 + 2];\n\n\t\t\tparticle.mass = rho[iP];\n\n\t\t\tVector3f relativePosition = particle.position - offset;\n\t\t\tVector3f radius = Vector3f(particle.smoothingLength + marginKpc);\n\t\t\tVector3f l = relativePosition - radius;\n\t\t\tl.clamp(0.0, size);\n\n\t\t\tVector3f u = relativePosition + radius;\n\t\t\tu.clamp(0.0, size);\n\n\t\t\tIndex3 lower, upper;\n\t\t\tlower.x = (uint32_t) std::floor(l.x \/ fileSizeKpc);\n\t\t\tlower.y = (uint32_t) std::floor(l.y \/ fileSizeKpc);\n\t\t\tlower.z = (uint32_t) std::floor(l.z \/ fileSizeKpc);\n\n\t\t\tupper.x = (uint32_t) std::ceil(u.x \/ fileSizeKpc);\n\t\t\tupper.y = (uint32_t) std::ceil(u.y \/ fileSizeKpc);\n\t\t\tupper.z = (uint32_t) std::ceil(u.z \/ fileSizeKpc);\n\n\t\t\tif ((verbose && (iP % 100000 == 0)) || veryverbose) {\n\t\t\t\tstd::cout << \"position: \" << particle.position\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"magnetic field: \" << particle.bfield\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"mass: \" << particle.mass << std::endl;\n\t\t\t\tstd::cout << \"smoothing length: \" << particle.smoothingLength\n\t\t\t\t\t\t<< std::endl;\n\t\t\t\tstd::cout << \"lower: \" << lower << std::endl;\n\t\t\t\tstd::cout << \"upper: \" << upper << std::endl;\n\t\t\t}\n\n\t\t\tfor (size_t x = lower.x; x < upper.x; x++)\n\t\t\t\tfor (size_t y = lower.y; y < upper.y; y++)\n\t\t\t\t\tfor (size_t z = lower.z; z < upper.z; z++)\n\t\t\t\t\t\tgrid.get(x, y, z).push_back(particle);\n\t\t}\n\t}\n\n\tstd::cout << \"Write output\" << std::endl;\n\n\tfor (size_t x = 0; x < bins; x++) {\n\t\tif (verbose) {\n\t\t\tstd::cout << \"x = \" << x << std::endl;\n\t\t}\n\n\t\tfor (size_t y = 0; y < bins; y++)\n\t\t\tfor (size_t z = 0; z < bins; z++) {\n\t\t\t\tstd::stringstream sstr;\n\t\t\t\tsstr << prefix << \"-\" << x << \"-\" << y << \"-\" << z << \".raw\";\n\t\t\t\tstd::ofstream out(sstr.str().c_str(), std::ofstream::binary);\n\t\t\t\tupdateRho(grid.get(x, y, z));\n\t\t\t\tuint32_t s = grid.get(x, y, z).size();\n\t\t\t\tif (verbose)\n\t\t\t\t\tstd::cout << s << std::endl;\n\t\t\t\tout.write((const char *) &s, sizeof(uint32_t));\n\t\t\t\tout.write((const char *) &grid.get(x, y, z)[0],\n\t\t\t\t\t\tsizeof(SmoothParticle) * s);\n\t\t\t}\n\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2016-2019 The DMLab2D Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"dmlab2d\/lib\/env_lua_api\/env_lua_api.h\"\n\n#include <cstdint>\n#include <filesystem>\n#include <istream>\n#include <string>\n#include <utility>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/numbers.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"dmlab2d\/lib\/env_lua_api\/properties.h\"\n#include \"dmlab2d\/lib\/lua\/bind.h\"\n#include \"dmlab2d\/lib\/lua\/call.h\"\n#include \"dmlab2d\/lib\/lua\/lua.h\"\n#include \"dmlab2d\/lib\/lua\/n_results_or.h\"\n#include \"dmlab2d\/lib\/lua\/push.h\"\n#include \"dmlab2d\/lib\/lua\/push_script.h\"\n#include \"dmlab2d\/lib\/lua\/read.h\"\n#include \"dmlab2d\/lib\/lua\/stack_resetter.h\"\n#include \"dmlab2d\/lib\/lua\/vm.h\"\n#include \"dmlab2d\/lib\/system\/image\/lua_image.h\"\n#include \"dmlab2d\/lib\/system\/random\/lua\/random.h\"\n#include \"dmlab2d\/lib\/system\/tensor\/lua\/tensor.h\"\n#include \"dmlab2d\/lib\/util\/default_read_only_file_system.h\"\n#include \"dmlab2d\/lib\/util\/file_reader_types.h\"\n#include \"third_party\/rl_api\/env_c_api.h\"\n\nnamespace deepmind::lab2d {\n\nconstexpr char kGameScriptPath[] =\n \"\/org_deepmind_lab2d\/dmlab2d\/lib\/game_scripts\";\nconstexpr char kLevelDirectory[] = \"levels\";\nconstexpr char kScriptFromSetting[] = \"<script from setting>\";\n\nEnvLuaApi::EnvLuaApi(std::string executable_runfiles)\n : lua_vm_(lua::CreateVm()),\n executable_runfiles_(std::move(executable_runfiles)),\n file_system_(executable_runfiles_, util::DefaultReadOnlyFileSystem()),\n mixer_seed_(0) {}\n\nint EnvLuaApi::AddSetting(absl::string_view key, absl::string_view value) {\n if (key == \"levelName\") {\n SetLevelName(std::string(value));\n return 0;\n }\n if (key == \"mixerSeed\") {\n std::uint32_t mixer_seed;\n if (absl::SimpleAtoi(value, &mixer_seed)) {\n SetMixerSeed(mixer_seed);\n return 0;\n } else {\n SetErrorMessage(absl::StrCat(\"Invalid settings 'mixerSeed' : \", value));\n return 1;\n }\n }\n if (key == \"levelDirectory\") {\n SetLevelDirectory(std::string(value));\n return 0;\n }\n settings_.emplace(key, value);\n return 0;\n}\n\nvoid EnvLuaApi::SetLevelName(absl::string_view level_name) {\n if (!level_name.empty() && level_name.front() == '=') {\n level_script_content_ = level_name.substr(1);\n }\n if (auto sep = level_name.find_last_of(':'); sep != absl::string_view::npos) {\n level_name_ = level_name.substr(0, sep);\n sub_level_name_ = level_name.substr(sep + 1);\n } else {\n level_name_ = level_name;\n sub_level_name_.clear();\n }\n}\n\nvoid EnvLuaApi::SetLevelDirectory(std::string level_directory) {\n level_directory_ = std::move(level_directory);\n}\n\nstd::string EnvLuaApi::GetLevelDirectory() {\n if (!level_directory_.empty()) {\n if (level_directory_[0] == '\/') {\n return level_directory_;\n } else {\n return absl::StrCat(ExecutableRunfiles(), \"\/\", level_directory_);\n }\n }\n return absl::StrCat(ExecutableRunfiles(), kGameScriptPath, \"\/\",\n kLevelDirectory);\n}\n\nlua::NResultsOr EnvLuaApi::PushLevelScriptAndName() {\n lua_State* L = lua_vm_.get();\n if (!level_script_content_.empty()) {\n if (!level_directory_.empty()) {\n lua_vm_.AddPathToSearchers(level_directory_);\n }\n if (auto result =\n lua::PushScript(L, level_script_content_, kScriptFromSetting);\n !result.ok()) {\n return result;\n }\n lua::Push(L, kGameScriptPath);\n return 2;\n }\n if (absl::EndsWith(level_name_, \".lua\")) {\n if (auto pos = level_name_.find_last_of('\/'); pos != std::string::npos) {\n lua_vm_.AddPathToSearchers(level_name_.substr(0, pos));\n }\n if (!level_directory_.empty()) {\n lua_vm_.AddPathToSearchers(level_directory_);\n }\n if (auto result = lua::PushScriptFile(L, level_name_); !result.ok()) {\n return result;\n }\n lua::Push(L, level_name_);\n return 2;\n }\n if (level_name_.empty()) {\n return \"Missing level script! Must set setting 'levelName'!\";\n }\n\n auto level_directory = GetLevelDirectory();\n auto level_path = absl::StrCat(level_directory, \"\/\", level_name_, \".lua\");\n if (std::ifstream f(level_path.c_str()); f.good()) {\n auto last_sep = level_path.find_last_of('\/');\n auto level_root = level_path.substr(0, last_sep);\n if (level_root != level_directory) {\n lua_vm_.AddPathToSearchers(level_root);\n }\n } else {\n auto level_root = absl::StrCat(level_directory, \"\/\", level_name_);\n level_path = absl::StrCat(level_root, \"\/init.lua\");\n lua_vm_.AddPathToSearchers(level_root);\n }\n lua_vm_.AddPathToSearchers(level_directory);\n lua_vm_.AddPathToSearchers(ExecutableRunfiles());\n\n if (auto result = lua::PushScriptFile(L, level_path); !result.ok()) {\n return result;\n }\n lua::Push(L, level_path);\n return 2;\n}\n\nint EnvLuaApi::Init() {\n lua_State* L = lua_vm_.get();\n lua::StackResetter stack_resetter(L);\n tensor::LuaTensorRegister(L);\n LuaRandom::Register(L);\n if (StoreError(PushLevelScriptAndName())) {\n return 1;\n }\n\n lua_vm_.AddPathToSearchers(\n absl::StrCat(ExecutableRunfiles(), kGameScriptPath));\n\n void* readonly_fs = const_cast<DeepMindReadOnlyFileSystem*>(\n GetFileSystem().ReadOnlyFileSystem());\n lua_vm_.AddCModuleToSearchers(\"system.image\", LuaImageRequire, {readonly_fs});\n lua_vm_.AddCModuleToSearchers(\"system.tensor\", tensor::LuaTensorConstructors,\n {readonly_fs});\n\n lua_vm_.AddCModuleToSearchers(\"system.events\", &lua::Bind<Events::Module>,\n {MutableEvents()});\n lua_vm_.AddCModuleToSearchers(\n \"system.random\", &lua::Bind<LuaRandom::Require>,\n {UserPrbg(),\n reinterpret_cast<void*>(static_cast<std::uintptr_t>(mixer_seed_))});\n\n lua_vm_.AddCModuleToSearchers(\"system.properties\",\n &lua::Bind<Properties::Module>);\n\n if (auto result = lua::Call(L, 1); StoreError(result)) {\n return 1;\n } else if (result.n_results() != 1) {\n error_message_ = \"Lua script function must return a table.\";\n return 1;\n }\n\n if (lua_isfunction(L, -1)) {\n lua::Push(L, sub_level_name_);\n if (auto result = lua::Call(L, 1); StoreError(result)) {\n return 1;\n } else if (result.n_results() != 1) {\n error_message_ = \"Lua script must return only a table or function.\";\n return 1;\n }\n }\n\n if (!IsFound(lua::Read(L, -1, &script_table_ref_))) {\n error_message_ = absl::StrCat(\n \"Lua script must return a table or function, Actually returned : '\",\n lua::ToString(L, -1), \"'\");\n return 1;\n }\n\n lua_settop(L, 0); \/\/ ApiInit expects an empty Lua stack.\n\n int error_value = 0;\n if (StoreError(ApiInit(&error_value)) ||\n StoreError(MutableObservations()->BindApi(script_table_ref_)) ||\n StoreError(MutableActions()->BindApi(script_table_ref_)) ||\n StoreError(MutableProperties()->BindApi(script_table_ref_)) ||\n StoreError(MutableEpisode()->BindApi(script_table_ref_))) {\n return error_value != 0 ? error_value : 1;\n }\n return 0;\n}\n\nint EnvLuaApi::MakeRandomSeed() {\n return std::uniform_int_distribution<int>(\n 1, std::numeric_limits<int>::max())(*EnginePrbg());\n}\n\nint EnvLuaApi::Start(int episode, int seed) {\n MutableEvents()->Clear();\n EnginePrbg()->seed(static_cast<std::uint64_t>(seed) ^\n (static_cast<std::uint64_t>(mixer_seed_) << 32));\n return StoreError(MutableEpisode()->Start(episode, MakeRandomSeed())) ? 1 : 0;\n}\n\nlua::NResultsOr EnvLuaApi::ApiInit(int* error_value) {\n lua_State* L = lua_vm_.get();\n lua::StackResetter stack_resetter(L);\n script_table_ref_.PushMemberFunction(\"init\");\n if (lua_isnil(L, -2)) {\n return 0;\n }\n lua::Push(L, settings_);\n auto result = lua::Call(L, 2);\n if (!result.ok()) {\n return result;\n }\n\n bool correct_args =\n result.n_results() == 0 || (result.n_results() == 1 && lua_isnil(L, 1)) ||\n (result.n_results() <= 2 && IsFound(lua::Read(L, 1, error_value)));\n if (*error_value != 0) {\n if (result.n_results() == 2) {\n return lua::ToString(L, 2);\n } else {\n return \"[init] - Script returned non zero.\";\n }\n }\n if (!correct_args) {\n return \"[init] - Must return none, nil, or integer and message\";\n }\n return 0;\n}\n\nEnvCApi_EnvironmentStatus EnvLuaApi::Advance(int number_of_steps,\n double* reward) {\n if (number_of_steps != 1) {\n SetErrorMessage(\"DeepMind Lab2d does not support frame skip.\");\n return EnvCApi_EnvironmentStatus_Error;\n }\n MutableEvents()->Clear();\n EnvCApi_EnvironmentStatus status;\n if (StoreError(MutableEpisode()->Advance(&status, reward))) {\n return EnvCApi_EnvironmentStatus_Error;\n }\n return status;\n}\n\n} \/\/ namespace deepmind::lab2d\n<commit_msg>[lib\/env_lua_api] Remove unused inclusion of <filesystem><commit_after>\/\/ Copyright (C) 2016-2019 The DMLab2D Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ https:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"dmlab2d\/lib\/env_lua_api\/env_lua_api.h\"\n\n#include <cstdint>\n#include <istream>\n#include <string>\n#include <utility>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/numbers.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"dmlab2d\/lib\/env_lua_api\/properties.h\"\n#include \"dmlab2d\/lib\/lua\/bind.h\"\n#include \"dmlab2d\/lib\/lua\/call.h\"\n#include \"dmlab2d\/lib\/lua\/lua.h\"\n#include \"dmlab2d\/lib\/lua\/n_results_or.h\"\n#include \"dmlab2d\/lib\/lua\/push.h\"\n#include \"dmlab2d\/lib\/lua\/push_script.h\"\n#include \"dmlab2d\/lib\/lua\/read.h\"\n#include \"dmlab2d\/lib\/lua\/stack_resetter.h\"\n#include \"dmlab2d\/lib\/lua\/vm.h\"\n#include \"dmlab2d\/lib\/system\/image\/lua_image.h\"\n#include \"dmlab2d\/lib\/system\/random\/lua\/random.h\"\n#include \"dmlab2d\/lib\/system\/tensor\/lua\/tensor.h\"\n#include \"dmlab2d\/lib\/util\/default_read_only_file_system.h\"\n#include \"dmlab2d\/lib\/util\/file_reader_types.h\"\n#include \"third_party\/rl_api\/env_c_api.h\"\n\nnamespace deepmind::lab2d {\n\nconstexpr char kGameScriptPath[] =\n \"\/org_deepmind_lab2d\/dmlab2d\/lib\/game_scripts\";\nconstexpr char kLevelDirectory[] = \"levels\";\nconstexpr char kScriptFromSetting[] = \"<script from setting>\";\n\nEnvLuaApi::EnvLuaApi(std::string executable_runfiles)\n : lua_vm_(lua::CreateVm()),\n executable_runfiles_(std::move(executable_runfiles)),\n file_system_(executable_runfiles_, util::DefaultReadOnlyFileSystem()),\n mixer_seed_(0) {}\n\nint EnvLuaApi::AddSetting(absl::string_view key, absl::string_view value) {\n if (key == \"levelName\") {\n SetLevelName(std::string(value));\n return 0;\n }\n if (key == \"mixerSeed\") {\n std::uint32_t mixer_seed;\n if (absl::SimpleAtoi(value, &mixer_seed)) {\n SetMixerSeed(mixer_seed);\n return 0;\n } else {\n SetErrorMessage(absl::StrCat(\"Invalid settings 'mixerSeed' : \", value));\n return 1;\n }\n }\n if (key == \"levelDirectory\") {\n SetLevelDirectory(std::string(value));\n return 0;\n }\n settings_.emplace(key, value);\n return 0;\n}\n\nvoid EnvLuaApi::SetLevelName(absl::string_view level_name) {\n if (!level_name.empty() && level_name.front() == '=') {\n level_script_content_ = level_name.substr(1);\n }\n if (auto sep = level_name.find_last_of(':'); sep != absl::string_view::npos) {\n level_name_ = level_name.substr(0, sep);\n sub_level_name_ = level_name.substr(sep + 1);\n } else {\n level_name_ = level_name;\n sub_level_name_.clear();\n }\n}\n\nvoid EnvLuaApi::SetLevelDirectory(std::string level_directory) {\n level_directory_ = std::move(level_directory);\n}\n\nstd::string EnvLuaApi::GetLevelDirectory() {\n if (!level_directory_.empty()) {\n if (level_directory_[0] == '\/') {\n return level_directory_;\n } else {\n return absl::StrCat(ExecutableRunfiles(), \"\/\", level_directory_);\n }\n }\n return absl::StrCat(ExecutableRunfiles(), kGameScriptPath, \"\/\",\n kLevelDirectory);\n}\n\nlua::NResultsOr EnvLuaApi::PushLevelScriptAndName() {\n lua_State* L = lua_vm_.get();\n if (!level_script_content_.empty()) {\n if (!level_directory_.empty()) {\n lua_vm_.AddPathToSearchers(level_directory_);\n }\n if (auto result =\n lua::PushScript(L, level_script_content_, kScriptFromSetting);\n !result.ok()) {\n return result;\n }\n lua::Push(L, kGameScriptPath);\n return 2;\n }\n if (absl::EndsWith(level_name_, \".lua\")) {\n if (auto pos = level_name_.find_last_of('\/'); pos != std::string::npos) {\n lua_vm_.AddPathToSearchers(level_name_.substr(0, pos));\n }\n if (!level_directory_.empty()) {\n lua_vm_.AddPathToSearchers(level_directory_);\n }\n if (auto result = lua::PushScriptFile(L, level_name_); !result.ok()) {\n return result;\n }\n lua::Push(L, level_name_);\n return 2;\n }\n if (level_name_.empty()) {\n return \"Missing level script! Must set setting 'levelName'!\";\n }\n\n auto level_directory = GetLevelDirectory();\n auto level_path = absl::StrCat(level_directory, \"\/\", level_name_, \".lua\");\n if (std::ifstream f(level_path.c_str()); f.good()) {\n auto last_sep = level_path.find_last_of('\/');\n auto level_root = level_path.substr(0, last_sep);\n if (level_root != level_directory) {\n lua_vm_.AddPathToSearchers(level_root);\n }\n } else {\n auto level_root = absl::StrCat(level_directory, \"\/\", level_name_);\n level_path = absl::StrCat(level_root, \"\/init.lua\");\n lua_vm_.AddPathToSearchers(level_root);\n }\n lua_vm_.AddPathToSearchers(level_directory);\n lua_vm_.AddPathToSearchers(ExecutableRunfiles());\n\n if (auto result = lua::PushScriptFile(L, level_path); !result.ok()) {\n return result;\n }\n lua::Push(L, level_path);\n return 2;\n}\n\nint EnvLuaApi::Init() {\n lua_State* L = lua_vm_.get();\n lua::StackResetter stack_resetter(L);\n tensor::LuaTensorRegister(L);\n LuaRandom::Register(L);\n if (StoreError(PushLevelScriptAndName())) {\n return 1;\n }\n\n lua_vm_.AddPathToSearchers(\n absl::StrCat(ExecutableRunfiles(), kGameScriptPath));\n\n void* readonly_fs = const_cast<DeepMindReadOnlyFileSystem*>(\n GetFileSystem().ReadOnlyFileSystem());\n lua_vm_.AddCModuleToSearchers(\"system.image\", LuaImageRequire, {readonly_fs});\n lua_vm_.AddCModuleToSearchers(\"system.tensor\", tensor::LuaTensorConstructors,\n {readonly_fs});\n\n lua_vm_.AddCModuleToSearchers(\"system.events\", &lua::Bind<Events::Module>,\n {MutableEvents()});\n lua_vm_.AddCModuleToSearchers(\n \"system.random\", &lua::Bind<LuaRandom::Require>,\n {UserPrbg(),\n reinterpret_cast<void*>(static_cast<std::uintptr_t>(mixer_seed_))});\n\n lua_vm_.AddCModuleToSearchers(\"system.properties\",\n &lua::Bind<Properties::Module>);\n\n if (auto result = lua::Call(L, 1); StoreError(result)) {\n return 1;\n } else if (result.n_results() != 1) {\n error_message_ = \"Lua script function must return a table.\";\n return 1;\n }\n\n if (lua_isfunction(L, -1)) {\n lua::Push(L, sub_level_name_);\n if (auto result = lua::Call(L, 1); StoreError(result)) {\n return 1;\n } else if (result.n_results() != 1) {\n error_message_ = \"Lua script must return only a table or function.\";\n return 1;\n }\n }\n\n if (!IsFound(lua::Read(L, -1, &script_table_ref_))) {\n error_message_ = absl::StrCat(\n \"Lua script must return a table or function, Actually returned : '\",\n lua::ToString(L, -1), \"'\");\n return 1;\n }\n\n lua_settop(L, 0); \/\/ ApiInit expects an empty Lua stack.\n\n int error_value = 0;\n if (StoreError(ApiInit(&error_value)) ||\n StoreError(MutableObservations()->BindApi(script_table_ref_)) ||\n StoreError(MutableActions()->BindApi(script_table_ref_)) ||\n StoreError(MutableProperties()->BindApi(script_table_ref_)) ||\n StoreError(MutableEpisode()->BindApi(script_table_ref_))) {\n return error_value != 0 ? error_value : 1;\n }\n return 0;\n}\n\nint EnvLuaApi::MakeRandomSeed() {\n return std::uniform_int_distribution<int>(\n 1, std::numeric_limits<int>::max())(*EnginePrbg());\n}\n\nint EnvLuaApi::Start(int episode, int seed) {\n MutableEvents()->Clear();\n EnginePrbg()->seed(static_cast<std::uint64_t>(seed) ^\n (static_cast<std::uint64_t>(mixer_seed_) << 32));\n return StoreError(MutableEpisode()->Start(episode, MakeRandomSeed())) ? 1 : 0;\n}\n\nlua::NResultsOr EnvLuaApi::ApiInit(int* error_value) {\n lua_State* L = lua_vm_.get();\n lua::StackResetter stack_resetter(L);\n script_table_ref_.PushMemberFunction(\"init\");\n if (lua_isnil(L, -2)) {\n return 0;\n }\n lua::Push(L, settings_);\n auto result = lua::Call(L, 2);\n if (!result.ok()) {\n return result;\n }\n\n bool correct_args =\n result.n_results() == 0 || (result.n_results() == 1 && lua_isnil(L, 1)) ||\n (result.n_results() <= 2 && IsFound(lua::Read(L, 1, error_value)));\n if (*error_value != 0) {\n if (result.n_results() == 2) {\n return lua::ToString(L, 2);\n } else {\n return \"[init] - Script returned non zero.\";\n }\n }\n if (!correct_args) {\n return \"[init] - Must return none, nil, or integer and message\";\n }\n return 0;\n}\n\nEnvCApi_EnvironmentStatus EnvLuaApi::Advance(int number_of_steps,\n double* reward) {\n if (number_of_steps != 1) {\n SetErrorMessage(\"DeepMind Lab2d does not support frame skip.\");\n return EnvCApi_EnvironmentStatus_Error;\n }\n MutableEvents()->Clear();\n EnvCApi_EnvironmentStatus status;\n if (StoreError(MutableEpisode()->Advance(&status, reward))) {\n return EnvCApi_EnvironmentStatus_Error;\n }\n return status;\n}\n\n} \/\/ namespace deepmind::lab2d\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Realm C++ coding standard - by example\n\/\/\n\n\n\/\/ Lines should never exceed 118 characters --------------------------------------------------------------------------\n\n\n\/\/ Macro names use uppercase and have \"REALM_\" as prefix. Non-macro\n\/\/ names never use all uppercase.\n\n#define REALM_MY_MACRO 1\n\n\n\/\/ A function name uses lowercase and its parts are separated by\n\/\/ underscores.\n\nmy_type my_func()\n{\n \/\/ Put the opening brace of a function body in the next line below\n \/\/ the function prototype. This also applies to class member\n \/\/ functions.\n\n \/\/ Put all other opening braces on the same line as the syntax\n \/\/ element to which the brace is subordinate.\n\n \/\/ Use 4 spaces per indentation level (no tabs please).\n\n if (...) {\n \/\/ ...\n }\n else {\n \/\/ ...\n }\n\n \/\/ Always put subordinate statements on a new line (to ease\n \/\/ debugging).\n\n if (...)\n return ...;\n\n \/\/ No space between type and '*' or '&'\n int* foo1 = ...;\n int& foo2 = ...;\n\n \/\/ 'const' goes before the type\n const int foo3 = ...;\n\n \/\/ ... but not when 'const' operates on a pointer type\n const int* foo3 = ...; \/\/ 'const' operates on 'int' not 'int*'\n int* const foo4 = ...; \/\/ 'const' operates on 'int*'\n int* const* const foo5 = ...;\n}\n\n\nvoid my_func_2()\n{\n \/\/ This indentation and brace placement style agrees with K&R\n \/\/ style except for the 'extra' indentation of 'cases' in a switch\n \/\/ statement.\n\n switch (...) {\n case type_Foo: {\n \/\/ ...\n break;\n }\n case type_FooBar: {\n \/\/ ...\n break;\n }\n }\n\n try {\n \/\/ ...\n }\n catch (...) {\n \/\/ ...\n }\n}\n\n\n\n\/\/ A name space name uses lowercase and its parts are separated by\n\/\/ underscores.\n\nnamespace my_namespace {\n\n\/\/ No indentation inside name spaces.\n\n\n\/\/ A Class name uses CamelCase with uppercase initial.\n\ntemplate<class T>\nclass MyClass: public Base {\npublic:\n MyClass(...):\n Base(...),\n m_bar(7),\n ...\n {\n \/\/ ...\n }\n\n \/\/ Public member variables do not have a 'm_' prefix.\n int baz;\n\nprivate:\n \/\/ Static member variables have prefix 's_'.\n static int s_foo;\n\n \/\/ Regular member variables have prefix 'm_'.\n int m_bar;\n};\n\n\n} \/\/ namespace my_namespace\n\n\n\n\/\/ Names of values of an enumeration are composed of two parts\n\/\/ separated by an underscore. The first part is a common lowercase\n\/\/ prefix. The second part identifies the value and uses CamelCase\n\/\/ with uppercase initial.\n\nenum mode {\n mode_Foo,\n mode_FooBar\n};\n\n\n\n\/\/ Order of class members (roughly):\n\nclass MyClass2 {\npublic:\n \/\/ Types\n\n \/\/ Static variables\n \/\/ Regular variables\n\n \/\/ Static functions\n \/\/ Regular functions\n\nprotected:\n \/\/ Same as 'public'\n\nprivate:\n \/\/ Same as 'public'\n\n \/\/ Friends\n};\n\n\n\n\/\/ Use literals when possible\n\nchar* str = nullptr; \/\/ don't use 0, NULL\nbool enable_feature = true;\nbool is_last = false;\n\n\n\n\/\/ Use of 'auto' keyword:\n\/\/\n\/\/ 'auto' should *not* be used for trivial cases where the type declaration \n\/\/ is short, non-templated, and non-derived (type_t, int64_t, std::string,\n\/\/ etc.\n\n\n\n\n\/\/ About FIXMEs:\n\/\/\n\/\/ A FIXME conveys information about a known issue or shortcoming. It\n\/\/ may also include information on how to fix the problem, and on\n\/\/ possible conflicts with anticipated future features.\n\/\/\n\/\/ A FIXME is often added in the following situations:\n\/\/\n\/\/ - While working on, or studying a particular part of the code you\n\/\/ uncover an issue or a shortcoming. Additionally, you may have\n\/\/ gained an understanding of how to fix it.\n\/\/\n\/\/ - While implementing a new feature, you are forced to cut a corner,\n\/\/ but you have some good ideas about how to continue later, and\/or\n\/\/ you may have knowledge about a certain planned feature that would\n\/\/ require a more complete solution.\n\/\/\n\/\/ A FIXME is generally not about a bug or an error, and is should\n\/\/ generally not be considered a task either. Is is simply a memo to\n\/\/ oneself or to some other developer who is going to work on the code\n\/\/ at some later point in time.\n\/\/\n\/\/ A FIXME should never be deleted unless by somebody who understands\n\/\/ the mening of it and knows that the problem is fixed, or has\n\/\/ otherwise diappeard.\n<commit_msg>Move public member variable before public methods.<commit_after>\/\/\n\/\/ Realm C++ coding standard - by example\n\/\/\n\n\n\/\/ Lines should never exceed 118 characters --------------------------------------------------------------------------\n\n\n\/\/ Macro names use uppercase and have \"REALM_\" as prefix. Non-macro\n\/\/ names never use all uppercase.\n\n#define REALM_MY_MACRO 1\n\n\n\/\/ A function name uses lowercase and its parts are separated by\n\/\/ underscores.\n\nmy_type my_func()\n{\n \/\/ Put the opening brace of a function body in the next line below\n \/\/ the function prototype. This also applies to class member\n \/\/ functions.\n\n \/\/ Put all other opening braces on the same line as the syntax\n \/\/ element to which the brace is subordinate.\n\n \/\/ Use 4 spaces per indentation level (no tabs please).\n\n if (...) {\n \/\/ ...\n }\n else {\n \/\/ ...\n }\n\n \/\/ Always put subordinate statements on a new line (to ease\n \/\/ debugging).\n\n if (...)\n return ...;\n\n \/\/ No space between type and '*' or '&'\n int* foo1 = ...;\n int& foo2 = ...;\n\n \/\/ 'const' goes before the type\n const int foo3 = ...;\n\n \/\/ ... but not when 'const' operates on a pointer type\n const int* foo3 = ...; \/\/ 'const' operates on 'int' not 'int*'\n int* const foo4 = ...; \/\/ 'const' operates on 'int*'\n int* const* const foo5 = ...;\n}\n\n\nvoid my_func_2()\n{\n \/\/ This indentation and brace placement style agrees with K&R\n \/\/ style except for the 'extra' indentation of 'cases' in a switch\n \/\/ statement.\n\n switch (...) {\n case type_Foo: {\n \/\/ ...\n break;\n }\n case type_FooBar: {\n \/\/ ...\n break;\n }\n }\n\n try {\n \/\/ ...\n }\n catch (...) {\n \/\/ ...\n }\n}\n\n\n\n\/\/ A name space name uses lowercase and its parts are separated by\n\/\/ underscores.\n\nnamespace my_namespace {\n\n\/\/ No indentation inside name spaces.\n\n\n\/\/ A Class name uses CamelCase with uppercase initial.\n\ntemplate<class T>\nclass MyClass: public Base {\npublic:\n\n \/\/ Public member variables do not have a 'm_' prefix.\n int baz;\n\n MyClass(...):\n Base(...),\n m_bar(7),\n ...\n {\n \/\/ ...\n }\n\nprivate:\n \/\/ Static member variables have prefix 's_'.\n static int s_foo;\n\n \/\/ Regular member variables have prefix 'm_'.\n int m_bar;\n};\n\n\n} \/\/ namespace my_namespace\n\n\n\n\/\/ Names of values of an enumeration are composed of two parts\n\/\/ separated by an underscore. The first part is a common lowercase\n\/\/ prefix. The second part identifies the value and uses CamelCase\n\/\/ with uppercase initial.\n\nenum mode {\n mode_Foo,\n mode_FooBar\n};\n\n\n\n\/\/ Order of class members (roughly):\n\nclass MyClass2 {\npublic:\n \/\/ Types\n\n \/\/ Static variables\n \/\/ Regular variables\n\n \/\/ Static functions\n \/\/ Regular functions\n\nprotected:\n \/\/ Same as 'public'\n\nprivate:\n \/\/ Same as 'public'\n\n \/\/ Friends\n};\n\n\n\n\/\/ Use literals when possible\n\nchar* str = nullptr; \/\/ don't use 0, NULL\nbool enable_feature = true;\nbool is_last = false;\n\n\n\n\/\/ Use of 'auto' keyword:\n\/\/\n\/\/ 'auto' should *not* be used for trivial cases where the type declaration \n\/\/ is short, non-templated, and non-derived (type_t, int64_t, std::string,\n\/\/ etc.\n\n\n\n\n\/\/ About FIXMEs:\n\/\/\n\/\/ A FIXME conveys information about a known issue or shortcoming. It\n\/\/ may also include information on how to fix the problem, and on\n\/\/ possible conflicts with anticipated future features.\n\/\/\n\/\/ A FIXME is often added in the following situations:\n\/\/\n\/\/ - While working on, or studying a particular part of the code you\n\/\/ uncover an issue or a shortcoming. Additionally, you may have\n\/\/ gained an understanding of how to fix it.\n\/\/\n\/\/ - While implementing a new feature, you are forced to cut a corner,\n\/\/ but you have some good ideas about how to continue later, and\/or\n\/\/ you may have knowledge about a certain planned feature that would\n\/\/ require a more complete solution.\n\/\/\n\/\/ A FIXME is generally not about a bug or an error, and is should\n\/\/ generally not be considered a task either. Is is simply a memo to\n\/\/ oneself or to some other developer who is going to work on the code\n\/\/ at some later point in time.\n\/\/\n\/\/ A FIXME should never be deleted unless by somebody who understands\n\/\/ the mening of it and knows that the problem is fixed, or has\n\/\/ otherwise diappeard.\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id: MMPA_UnitTest.cpp $\n\/\/\n\/\/ Copyright (c) 2015, Novartis Institutes for BioMedical Research Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Novartis Institutes for BioMedical Research Inc.\n\/\/ nor the names of its contributors may be used to endorse or promote\n\/\/ products derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n#ifdef WIN32\n#include <Windows.h>\n#else\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#endif\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n#include <string>\n#include <iostream>\n#include <RDGeneral\/RDLog.h>\n#include <RDGeneral\/utils.h>\n#include \"..\/RDKitBase.h\"\n#include \"..\/FileParsers\/FileParsers.h\" \/\/MOL single molecule !\n#include \"..\/FileParsers\/MolSupplier.h\" \/\/SDF\n#include \"..\/SmilesParse\/SmilesParse.h\"\n#include \"..\/SmilesParse\/SmilesWrite.h\"\n#include \"..\/SmilesParse\/SmartsWrite.h\"\n#include \"..\/Substruct\/SubstructMatch.h\"\n\n#include \"MMPA.h\"\n\nusing namespace RDKit;\n\nunsigned long long T0;\nunsigned long long t0;\n\n#ifdef WIN32\n#define DELTA_EPOCH_IN_MICROSECS 11644473600000000ULL\n\nstruct timezone {\n int tz_minuteswest; \/\/ minutes W of Greenwich\n int tz_dsttime; \/\/ type of dst correction\n};\n\nstatic inline int gettimeofday(struct timeval *tv, struct timezone *tz) {\n FILETIME ft;\n unsigned __int64 tmpres = 0;\n static int tzflag;\n\n if (NULL != tv) {\n GetSystemTimeAsFileTime(&ft);\n\n tmpres |= ft.dwHighDateTime;\n tmpres <<= 32;\n tmpres |= ft.dwLowDateTime;\n\n \/\/converting file time to unix epoch\n tmpres -= DELTA_EPOCH_IN_MICROSECS;\n tmpres \/= 10; \/\/convert into microseconds\n tv->tv_sec = (long)(tmpres \/ 1000000UL);\n tv->tv_usec = (long)(tmpres % 1000000UL);\n }\n\n if (NULL != tz) {\n if (!tzflag) {\n _tzset();\n tzflag++;\n }\n tz->tz_minuteswest = _timezone \/ 60;\n tz->tz_dsttime = _daylight;\n }\n return 0;\n}\n#endif\n\nstatic inline unsigned long long nanoClock (void) { \/\/ actually returns microseconds\n struct timeval t;\n gettimeofday(&t, (struct timezone*)0);\n return t.tv_usec + t.tv_sec * 1000000ULL;\n}\n\n\nvoid printTime() {\n unsigned long long t1 = nanoClock();\n double sec = double(t1-t0) \/ 1000000.;\n printf(\"Time elapsed %.4lf seconds\\n\", sec);\n t0 = nanoClock();\n}\n\nstd::string getSmilesOnly(const char* smiles, std::string* id=0) { \/\/ remove label, because RDKit parse FAILED\n const char* sp = strchr(smiles,' ');\n unsigned n = (sp ? sp-smiles+1 : strlen(smiles));\n if(id)\n *id = std::string(smiles+(n--));\n return std::string(smiles, n);\n}\n\n\/\/ UNIT Test Set:\n\/\/=========================================================================\n\nvoid test1() {\n BOOST_LOG(rdInfoLog) << \"-------------------------------------\" << std::endl;\n BOOST_LOG(rdInfoLog) << \"MMPA test1()\\n\" << std::endl;\n\/*\n\/\/ DEBUG PRINT\n RWMol *m = SmartsToMol(\"[*:1]C.[*:1]c1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-]\");\n Atom *a = m->getAtomWithIdx(0);\n std::cout<<\"DEBUG: \"<< MolToSmiles(*m, true) <<\"\\n\";\n delete m;\n\/\/-----\n*\/\n const char* smi[] = {\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-] ZINC21984717\",\n };\n\n const char* fs[] = { \/\/ 16 reordered reference results\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,[*:1]C.[*:1]c1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-]\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]c1c([*:2])[n+](=O)c2ccccc2n1[O-],[*:1]C.[*:2]C(=O)NCCO\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]CNC([*:2])=O,[*:1]CO.[*:2]c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]C[*:2],[*:1]CO.[*:2]NC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]NC([*:2])=O,[*:1]CCO.[*:2]c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:2]NC(=O)c1c([*:1])n([O-])c2ccccc2[n+]1=O,[*:1]C.[*:2]CCO\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:2]CNC(=O)c1c([*:1])n([O-])c2ccccc2[n+]1=O,[*:1]C.[*:2]CO\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:2]CCNC(=O)c1c([*:1])n([O-])c2ccccc2[n+]1=O,[*:1]C.[*:2]O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,[*:1]C(=O)NCCO.[*:1]c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,[*:1]CCO.[*:1]NC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,[*:1]CO.[*:1]CNC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,[*:1]O.[*:1]CCNC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]NC([*:2])=O,[*:1]CCO.[*:2]c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]CC[*:2],[*:1]O.[*:2]NC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]CCNC([*:2])=O,[*:1]O.[*:2]c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,[*:1]C[*:2],[*:1]O.[*:2]CNC(=O)c1c(C)n([O-])c2ccccc2[n+]1=O\",\r\n };\n\n for(int i=0; i<sizeof(smi)\/sizeof(smi[0]); i++) {\n static const std::string es(\"NULL\");\n std::string id;\n std::string smiles = getSmilesOnly(smi[i], &id);\n ROMol* mol = SmilesToMol( smiles );\n std::vector< std::pair<ROMOL_SPTR,ROMOL_SPTR> > res;\n t0 = nanoClock();\n RDKit::MMPA::fragmentMol(*mol, res);\n printTime();\n delete mol;\n std::map<size_t, size_t> fs2res;\n std::cout << \"\\nTEST \"<< i+1 << \" mol: \" << smi[i] <<\"\\n\";\n for(size_t j=0; j<res.size(); j++) {\n\/\/ std::cout <<\" \"<< j+1 << \": \";\n\/\/ std::cout << (res[j].first.get() ? MolToSmiles(*res[j].first ) : es) <<\", \";\n\/\/ std::cout << (res[j].second.get() ? MolToSmiles(*res[j].second) : es) <<\"\\n\";\n std::stringstream ss;\n ss << smiles << \",\" << id << \",\";\n ss << (res[j].first.get() ? MolToSmiles(*res[j].first, true) : \"\") <<\",\";\n ss << (res[j].second.get() ? MolToSmiles(*res[j].second,true) : \"\");\n bool failed = true;\n size_t matchedRefRes = -1;\n for(size_t r=0; r < sizeof(fs)\/sizeof(fs[0]); r++) {\n if(0==strcmp(std::string(ss.str()).c_str(), fs[r])) { \/\/ PASSED\n failed = false;\n matchedRefRes = r;\n fs2res[r] = j;\n break;\n }\n }\n if(j<9)\n std::cout << \" \";\n if(failed) { \/\/0!=strcmp(std::string(ss.str()).c_str(), fs[j])) { \/\/ FAILED\n std::cout << j+1 << \":*FAILED* \" << ss.str() <<\"\\n\";\/\/<< \"FS: \" << fs[j] <<\"\\n\";\n\/\/tmp TEST_ASSERT(0==strcmp(std::string(ss.str()).c_str(), fs[j]));\n }\n else\n std::cout << j+1 << \": PASSED. matchedRefRes = \"<< matchedRefRes+1 <<\"\\n\";\/\/ok: << \"ss: \" << ss.str() <<\"\\n\";\n std::cout.flush();\n }\n std::cout << \"\\n --- UNMATCHED Reference RESULTS: --- \\n\";\n for(size_t r=0; r < sizeof(fs)\/sizeof(fs[0]); r++) {\n if(fs2res.end() == fs2res.find(r))\n std::cout <<(r<9?\" \":\"\")<< r+1 << \": \" << fs[r] <<\"\\n\";\n }\n }\n std::cout << \" -----------------------------------\\n\";\n BOOST_LOG(rdInfoLog) << \"\\tdone\" << std::endl;\n}\n\n\/\/====================================================================================================\n\/\/====================================================================================================\n\nint main(int argc, const char* argv[]) {\n BOOST_LOG(rdInfoLog) << \"*******************************************************\\n\";\n BOOST_LOG(rdInfoLog) << \"MMPA Unit Test \\n\";\n\n\/\/ use maximum CPU resoures to increase time measuring accuracy and stability in multi process environment\n#ifdef WIN32\n\/\/ SetPriorityClass (GetCurrentProcess(), REALTIME_PRIORITY_CLASS );\n SetThreadPriority(GetCurrentThread (), THREAD_PRIORITY_HIGHEST );\n#else\n setpriority(PRIO_PROCESS, getpid(), -20);\n#endif\n\n T0 = nanoClock();\n t0 = nanoClock();\n\n test1();\n\/*\n unsigned long long t1 = nanoClock();\n double sec = double(t1-T0) \/ 1000000.;\n printf(\"TOTAL Time elapsed %.4lf seconds\\n\", sec);\n*\/\n BOOST_LOG(rdInfoLog) << \"*******************************************************\\n\";\n return 0;\n}\n<commit_msg>update expected results based on a new run of rfrag.py<commit_after>\/\/ $Id: MMPA_UnitTest.cpp $\n\/\/\n\/\/ Copyright (c) 2015, Novartis Institutes for BioMedical Research Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of Novartis Institutes for BioMedical Research Inc.\n\/\/ nor the names of its contributors may be used to endorse or promote\n\/\/ products derived from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n#ifdef WIN32\n#include <Windows.h>\n#else\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/time.h>\n#include <sys\/resource.h>\n#endif\n\n#include <stdio.h>\n#include <string.h>\n#include <time.h>\n#include <string>\n#include <iostream>\n#include <RDGeneral\/RDLog.h>\n#include <RDGeneral\/utils.h>\n#include \"..\/RDKitBase.h\"\n#include \"..\/FileParsers\/FileParsers.h\" \/\/MOL single molecule !\n#include \"..\/FileParsers\/MolSupplier.h\" \/\/SDF\n#include \"..\/SmilesParse\/SmilesParse.h\"\n#include \"..\/SmilesParse\/SmilesWrite.h\"\n#include \"..\/SmilesParse\/SmartsWrite.h\"\n#include \"..\/Substruct\/SubstructMatch.h\"\n\n#include \"MMPA.h\"\n\nusing namespace RDKit;\n\nunsigned long long T0;\nunsigned long long t0;\n\n#ifdef WIN32\n#define DELTA_EPOCH_IN_MICROSECS 11644473600000000ULL\n\nstruct timezone {\n int tz_minuteswest; \/\/ minutes W of Greenwich\n int tz_dsttime; \/\/ type of dst correction\n};\n\nstatic inline int gettimeofday(struct timeval *tv, struct timezone *tz) {\n FILETIME ft;\n unsigned __int64 tmpres = 0;\n static int tzflag;\n\n if (NULL != tv) {\n GetSystemTimeAsFileTime(&ft);\n\n tmpres |= ft.dwHighDateTime;\n tmpres <<= 32;\n tmpres |= ft.dwLowDateTime;\n\n \/\/converting file time to unix epoch\n tmpres -= DELTA_EPOCH_IN_MICROSECS;\n tmpres \/= 10; \/\/convert into microseconds\n tv->tv_sec = (long)(tmpres \/ 1000000UL);\n tv->tv_usec = (long)(tmpres % 1000000UL);\n }\n\n if (NULL != tz) {\n if (!tzflag) {\n _tzset();\n tzflag++;\n }\n tz->tz_minuteswest = _timezone \/ 60;\n tz->tz_dsttime = _daylight;\n }\n return 0;\n}\n#endif\n\nstatic inline unsigned long long nanoClock (void) { \/\/ actually returns microseconds\n struct timeval t;\n gettimeofday(&t, (struct timezone*)0);\n return t.tv_usec + t.tv_sec * 1000000ULL;\n}\n\n\nvoid printTime() {\n unsigned long long t1 = nanoClock();\n double sec = double(t1-t0) \/ 1000000.;\n printf(\"Time elapsed %.4lf seconds\\n\", sec);\n t0 = nanoClock();\n}\n\nstd::string getSmilesOnly(const char* smiles, std::string* id=0) { \/\/ remove label, because RDKit parse FAILED\n const char* sp = strchr(smiles,' ');\n unsigned n = (sp ? sp-smiles+1 : strlen(smiles));\n if(id)\n *id = std::string(smiles+(n--));\n return std::string(smiles, n);\n}\n\n\/\/ UNIT Test Set:\n\/\/=========================================================================\n\nvoid test1() {\n BOOST_LOG(rdInfoLog) << \"-------------------------------------\" << std::endl;\n BOOST_LOG(rdInfoLog) << \"MMPA test1()\\n\" << std::endl;\n\/*\n\/\/ DEBUG PRINT\n RWMol *m = SmartsToMol(\"[*:1]C.[*:1]c1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-]\");\n Atom *a = m->getAtomWithIdx(0);\n std::cout<<\"DEBUG: \"<< MolToSmiles(*m, true) <<\"\\n\";\n delete m;\n\/\/-----\n*\/\n const char* smi[] = {\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-] ZINC21984717\",\n };\n\n const char* fs[] = { \/\/ 16 reordered reference results\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=[n+]1c([*:2])c([*:1])n([O-])c2ccccc21,C[*:1].O=C(NCCO)[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,Cc1c(C(=O)NCC[*:1])[n+](=O)c2ccccc2n1[O-].O[*:1]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,OCC[*:1].Cc1c(C(=O)N[*:1])[n+](=O)c2ccccc2n1[O-]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,C[*:1].O=C(NCCO)c1c([*:1])n([O-])c2ccccc2[n+]1=O\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,C([*:1])[*:2],Cc1c(C(=O)N[*:1])[n+](=O)c2ccccc2n1[O-].OC[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(N[*:2])c1c([*:1])n([O-])c2ccccc2[n+]1=O,C[*:1].OCC[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(N[*:2])[*:1],Cc1c([*:1])[n+](=O)c2ccccc2n1[O-].OCC[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,C(C[*:2])[*:1],Cc1c(C(=O)N[*:1])[n+](=O)c2ccccc2n1[O-].O[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,Cc1c(C(=O)NC[*:1])[n+](=O)c2ccccc2n1[O-].OC[*:1]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,,O=C(NCCO)[*:1].Cc1c([*:1])[n+](=O)c2ccccc2n1[O-]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,C([*:1])[*:2],Cc1c(C(=O)NC[*:1])[n+](=O)c2ccccc2n1[O-].O[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(NCC[*:2])c1c([*:1])n([O-])c2ccccc2[n+]1=O,C[*:1].O[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(NC[*:2])c1c([*:1])n([O-])c2ccccc2[n+]1=O,C[*:1].OC[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(NCC[*:2])[*:1],Cc1c([*:1])[n+](=O)c2ccccc2n1[O-].O[*:2]\",\n \"Cc1c(C(=O)NCCO)[n+](=O)c2ccccc2n1[O-],ZINC21984717,O=C(NC[*:2])[*:1],Cc1c([*:1])[n+](=O)c2ccccc2n1[O-].OC[*:2]\"\n };\n\n for(int i=0; i<sizeof(smi)\/sizeof(smi[0]); i++) {\n static const std::string es(\"NULL\");\n std::string id;\n std::string smiles = getSmilesOnly(smi[i], &id);\n ROMol* mol = SmilesToMol( smiles );\n std::vector< std::pair<ROMOL_SPTR,ROMOL_SPTR> > res;\n t0 = nanoClock();\n RDKit::MMPA::fragmentMol(*mol, res);\n printTime();\n delete mol;\n std::map<size_t, size_t> fs2res;\n std::cout << \"\\nTEST \"<< i+1 << \" mol: \" << smi[i] <<\"\\n\";\n for(size_t j=0; j<res.size(); j++) {\n\/\/ std::cout <<\" \"<< j+1 << \": \";\n\/\/ std::cout << (res[j].first.get() ? MolToSmiles(*res[j].first ) : es) <<\", \";\n\/\/ std::cout << (res[j].second.get() ? MolToSmiles(*res[j].second) : es) <<\"\\n\";\n std::stringstream ss;\n ss << smiles << \",\" << id << \",\";\n ss << (res[j].first.get() ? MolToSmiles(*res[j].first, true) : \"\") <<\",\";\n ss << (res[j].second.get() ? MolToSmiles(*res[j].second,true) : \"\");\n bool failed = true;\n size_t matchedRefRes = -1;\n for(size_t r=0; r < sizeof(fs)\/sizeof(fs[0]); r++) {\n if(0==strcmp(std::string(ss.str()).c_str(), fs[r])) { \/\/ PASSED\n failed = false;\n matchedRefRes = r;\n fs2res[r] = j;\n break;\n }\n }\n if(j<9)\n std::cout << \" \";\n if(failed) { \/\/0!=strcmp(std::string(ss.str()).c_str(), fs[j])) { \/\/ FAILED\n std::cout << j+1 << \":*FAILED* \" << ss.str() <<\"\\n\";\/\/<< \"FS: \" << fs[j] <<\"\\n\";\n\/\/tmp TEST_ASSERT(0==strcmp(std::string(ss.str()).c_str(), fs[j]));\n }\n else\n std::cout << j+1 << \": PASSED. matchedRefRes = \"<< matchedRefRes+1 <<\"\\n\";\/\/ok: << \"ss: \" << ss.str() <<\"\\n\";\n std::cout.flush();\n }\n std::cout << \"\\n --- UNMATCHED Reference RESULTS: --- \\n\";\n for(size_t r=0; r < sizeof(fs)\/sizeof(fs[0]); r++) {\n if(fs2res.end() == fs2res.find(r))\n std::cout <<(r<9?\" \":\"\")<< r+1 << \": \" << fs[r] <<\"\\n\";\n }\n }\n std::cout << \" -----------------------------------\\n\";\n BOOST_LOG(rdInfoLog) << \"\\tdone\" << std::endl;\n}\n\n\/\/====================================================================================================\n\/\/====================================================================================================\n\nint main(int argc, const char* argv[]) {\n BOOST_LOG(rdInfoLog) << \"*******************************************************\\n\";\n BOOST_LOG(rdInfoLog) << \"MMPA Unit Test \\n\";\n\n\/\/ use maximum CPU resoures to increase time measuring accuracy and stability in multi process environment\n#ifdef WIN32\n\/\/ SetPriorityClass (GetCurrentProcess(), REALTIME_PRIORITY_CLASS );\n SetThreadPriority(GetCurrentThread (), THREAD_PRIORITY_HIGHEST );\n#else\n setpriority(PRIO_PROCESS, getpid(), -20);\n#endif\n\n T0 = nanoClock();\n t0 = nanoClock();\n\n test1();\n\/*\n unsigned long long t1 = nanoClock();\n double sec = double(t1-T0) \/ 1000000.;\n printf(\"TOTAL Time elapsed %.4lf seconds\\n\", sec);\n*\/\n BOOST_LOG(rdInfoLog) << \"*******************************************************\\n\";\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013-2016, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Physics\/CcdCollisionLoop.h\"\n\n#include \"SurgSim\/Physics\/CcdCollision.h\"\n#include \"SurgSim\/Physics\/UpdateCcdData.h\"\n#include \"SurgSim\/Physics\/ContactConstraintGeneration.h\"\n#include \"SurgSim\/Physics\/SolveMlcp.h\"\n#include \"SurgSim\/Physics\/PushResults.h\"\n#include \"SurgSim\/Physics\/BuildMlcp.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n\n#include <unordered_set>\n#include <limits>\n\nnamespace SurgSim\n{\n\nnamespace Physics\n{\n\nCcdCollisionLoop::CcdCollisionLoop(bool copyState) :\n\tComputation(copyState),\n\tm_updateCcdData(new UpdateCcdData(copyState)),\n\tm_ccdCollision(new CcdCollision(copyState)),\n\tm_constraintGeneration(new ContactConstraintGeneration(copyState)),\n\tm_buildMlcp(new BuildMlcp(copyState)),\n\tm_solveMlcp(new SolveMlcp(copyState)),\n\tm_pushResults(new PushResults(copyState)),\n\tm_maxIterations(5),\n\tm_epsilonFactor(1000)\n{\n}\n\nCcdCollisionLoop::~CcdCollisionLoop()\n{\n\n}\n\nstd::shared_ptr<SurgSim::Physics::PhysicsManagerState> CcdCollisionLoop::doUpdate(const double& dt,\n\t\tconst std::shared_ptr<PhysicsManagerState>& state)\n{\n\tstatic bool doSleep;\n\n\tif (doSleep)\n\t{\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\n\tauto lastState = state;\n\tsize_t iterations = m_maxIterations;\n\n\tauto collisionPairs = state->getCollisionPairs();\n\tstd::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs;\n\tccdPairs.reserve(collisionPairs.size());\n\n\tstd::unordered_set<Collision::Representation*> representations;\n\n\tstd::copy_if(collisionPairs.cbegin(), collisionPairs.cend(), std::back_inserter(ccdPairs),\n\t\t\t\t [&representations](const std::shared_ptr<Collision::CollisionPair>& p)\n\t{\n\t\tif (p->getType() == Collision::COLLISION_DETECTION_TYPE_CONTINUOUS)\n\t\t{\n\t\t\trepresentations.insert(p->getFirst().get());\n\t\t\trepresentations.insert(p->getSecond().get());\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t});\n\n\t\/\/ localDt is the time left on dt as we step through the CCD, this gets reduced as contacts are found\n\tdouble localDt = dt;\n\tdouble toi = 0.0;\n\tdouble localToi = 0.0;\n\n\tstd::cout << \"--------Iteration Start \" << std::endl;\n\n\tstd::vector<std::list<std::shared_ptr<Collision::Contact>>> oldContacts;\n\n\n\twhile (--iterations > 0)\n\t{\n\t\ttoi += (1.0 - toi) * localToi;\n\t\tdouble epsilon = 1.0 \/ ((1 - toi) * m_epsilonFactor);\n\n\t\tlastState = m_updateCcdData->update(localToi, lastState); \/\/ state interpolation is triggered in here\n\t\tlastState = m_ccdCollision->update(dt, lastState);\n\n\t\t\/\/printContacts(ccdPairs);\n\n\t\t\/\/ Find the first impact and filter all contacts beyond a given epsilon\n\t\tif (!filterContacts(ccdPairs, epsilon, &localToi))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ set toi to the correct value as a percentage of dt\n\n\t\tlastState = m_constraintGeneration->update(dt, lastState);\n\t\tlastState = m_buildMlcp->update(dt, lastState);\n\t\tlastState = m_solveMlcp->update(dt, lastState);\n\t\tlastState = m_pushResults->update(dt, lastState);\n\n\n\t\tif (toi > 1.0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (iterations == 0)\n\t{\n\t\tstd::cout << \"----- Maxed out iterations ... \" << std::endl;\n\t}\n\telse if (iterations < m_maxIterations - 1)\n\t{\n\t\tstd::cout << \"----- Resolved after \" << m_maxIterations - iterations << std::endl;\n\t}\n\telse\n\t{\n\t\tstd::cout << \"--------Iteration End \" << std::endl;\n\t}\n\n\treturn lastState;\n}\n\nbool CcdCollisionLoop::filterContacts(\n\tconst std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\tdouble epsilon,\n\tdouble* currentToi)\n{\n\tSURGSIM_ASSERT(currentToi != nullptr);\n\n\tdouble toi = std::numeric_limits<double>::max();\n\n\t\/\/ Find earliest time of impact\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tstd::for_each(pair->getContacts().begin(),\n\t\t\t\t\t pair->getContacts().end(), [&toi](const std::shared_ptr<Collision::Contact>& contact)\n\t\t{\n\t\t\ttoi = std::min<double>(toi, contact->time);\n\t\t});\n\t}\n\n\t\/\/ Did not find any contacts return false\n\tif (!(toi < std::numeric_limits<double>::max()))\n\t{\n\t\treturn false;\n\t}\n\n\ttoi += epsilon;\n\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tpair->getContacts().remove_if([toi](const std::shared_ptr<Collision::Contact>& contact)\n\t\t{\n\t\t\treturn contact->time > toi;\n\t\t});\n\t}\n\n\t*currentToi = toi;\n\n\treturn true;\n}\n\nvoid CcdCollisionLoop::backupContacts(const std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\t\t\t\t\t\t\t\t\t std::vector<std::list<std::shared_ptr<Collision::Contact>>>* oldContacts)\n{\n\tfor (auto& pair : ccdPairs)\n\t{\n\t\toldContacts->emplace_back(pair->getContacts());\n\t\tpair->getContacts().clear();\n\t}\n}\n\nvoid CcdCollisionLoop::restoreContacts(const std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\t\t\t\t\t\t\t\t\t std::vector<std::list<std::shared_ptr<Collision::Contact>>>* oldContacts)\n{\n\tif (oldContacts->size() == 0)\n\t{\n\t\treturn;\n\t}\n\n\tSURGSIM_ASSERT(oldContacts->size() == ccdPairs.size());\n\tfor (int i = 0; i < oldContacts->size(); ++i)\n\t{\n\t\tauto& newContacts = ccdPairs[i]->getContacts();\n\t\tnewContacts.splice(newContacts.end(), std::move(oldContacts->at(i)));\n\t}\n\toldContacts->clear();\n}\n\nvoid CcdCollisionLoop::printContacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tstd::cout << \"Contacts : \" << pair->getContacts().size() << std::endl;\n\t\tfor (const auto& contact : pair->getContacts())\n\t\t{\n\t\t\tstd::cout << *contact;\n\t\t}\n\t}\n}\n\nvoid CcdCollisionLoop::assert_no_contacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tSURGSIM_ASSERT(pair->getContacts().size() == 0);\n\t}\n}\n\nvoid CcdCollisionLoop::clearContacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tpair->getContacts().clear();\n\t}\n}\n\n}\n}<commit_msg>Clear Contacts during iteration<commit_after>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013-2016, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Physics\/CcdCollisionLoop.h\"\n\n#include \"SurgSim\/Physics\/CcdCollision.h\"\n#include \"SurgSim\/Physics\/UpdateCcdData.h\"\n#include \"SurgSim\/Physics\/ContactConstraintGeneration.h\"\n#include \"SurgSim\/Physics\/SolveMlcp.h\"\n#include \"SurgSim\/Physics\/PushResults.h\"\n#include \"SurgSim\/Physics\/BuildMlcp.h\"\n#include \"SurgSim\/Physics\/PhysicsManagerState.h\"\n#include \"SurgSim\/Collision\/CollisionPair.h\"\n\n#include <unordered_set>\n#include <limits>\n\nnamespace SurgSim\n{\n\nnamespace Physics\n{\n\nCcdCollisionLoop::CcdCollisionLoop(bool copyState) :\n\tComputation(copyState),\n\tm_updateCcdData(new UpdateCcdData(copyState)),\n\tm_ccdCollision(new CcdCollision(copyState)),\n\tm_constraintGeneration(new ContactConstraintGeneration(copyState)),\n\tm_buildMlcp(new BuildMlcp(copyState)),\n\tm_solveMlcp(new SolveMlcp(copyState)),\n\tm_pushResults(new PushResults(copyState)),\n\tm_maxIterations(20),\n\tm_epsilonFactor(100)\n{\n}\n\nCcdCollisionLoop::~CcdCollisionLoop()\n{\n\n}\n\nstd::shared_ptr<SurgSim::Physics::PhysicsManagerState> CcdCollisionLoop::doUpdate(const double& dt,\n\t\tconst std::shared_ptr<PhysicsManagerState>& state)\n{\n\tstatic bool doSleep;\n\n\tif (doSleep)\n\t{\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\n\tauto lastState = state;\n\tsize_t iterations = m_maxIterations;\n\n\tauto collisionPairs = state->getCollisionPairs();\n\tstd::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs;\n\tccdPairs.reserve(collisionPairs.size());\n\n\tstd::unordered_set<Collision::Representation*> representations;\n\n\tstd::copy_if(collisionPairs.cbegin(), collisionPairs.cend(), std::back_inserter(ccdPairs),\n\t\t\t\t [&representations](const std::shared_ptr<Collision::CollisionPair>& p)\n\t{\n\t\tif (p->getType() == Collision::COLLISION_DETECTION_TYPE_CONTINUOUS)\n\t\t{\n\t\t\trepresentations.insert(p->getFirst().get());\n\t\t\trepresentations.insert(p->getSecond().get());\n\t\t\treturn true;\n\t\t}\n\t\treturn false;\n\t});\n\n\t\/\/ localDt is the time left on dt as we step through the CCD, this gets reduced as contacts are found\n\tdouble localDt = dt;\n\tdouble toi = 0.0;\n\tdouble localToi = 0.0;\n\n\tstd::cout << \"--------Iteration Start \" << std::endl;\n\n\tstd::vector<std::list<std::shared_ptr<Collision::Contact>>> oldContacts;\n\n\twhile (--iterations > 0)\n\t{\n\t\ttoi += (1.0 - toi) * localToi;\n\t\tdouble epsilon = 1.0 \/ ((1 - toi) * m_epsilonFactor);\n\n\t\tlastState = m_updateCcdData->update(localToi, lastState); \/\/ state interpolation is triggered in here\n\t\tlastState = m_ccdCollision->update(dt, lastState);\n\n\/\/ \t\tstd::cout << \"--- Iteration \" << m_maxIterations - iterations << std::endl;\n\/\/ \t\tprintContacts(ccdPairs);\n\n\t\t\/\/ Find the first impact and filter all contacts beyond a given epsilon\n\t\tif (!filterContacts(ccdPairs, epsilon, &localToi))\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tlastState = m_constraintGeneration->update(dt, lastState);\n\t\tlastState = m_buildMlcp->update(dt, lastState);\n\t\tlastState = m_solveMlcp->update(dt, lastState);\n\t\tlastState = m_pushResults->update(dt, lastState);\n\n\t\tif (toi > 1.0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\n\t\tclearContacts(ccdPairs);\n\t}\n\n\tif (iterations == 0)\n\t{\n\t\tstd::cout << \"----- Maxed out iterations ... \" << std::endl;\n\t}\n\telse if (iterations < m_maxIterations - 1)\n\t{\n\t\tstd::cout << \"----- Resolved after \" << m_maxIterations - iterations << std::endl;\n\t}\n\telse\n\t{\n\t\tstd::cout << \"--------Iteration End \" << std::endl;\n\t}\n\n\treturn lastState;\n}\n\nbool CcdCollisionLoop::filterContacts(\n\tconst std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\tdouble epsilon,\n\tdouble* currentToi)\n{\n\tSURGSIM_ASSERT(currentToi != nullptr);\n\n\tdouble toi = std::numeric_limits<double>::max();\n\n\t\/\/ Find earliest time of impact\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tstd::for_each(pair->getContacts().begin(),\n\t\t\t\t\t pair->getContacts().end(), [&toi](const std::shared_ptr<Collision::Contact>& contact)\n\t\t{\n\t\t\ttoi = std::min<double>(toi, contact->time);\n\t\t});\n\t}\n\n\t\/\/ Did not find any contacts return false\n\tif (!(toi < std::numeric_limits<double>::max()))\n\t{\n\t\treturn false;\n\t}\n\n\ttoi += epsilon;\n\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tpair->getContacts().remove_if([toi](const std::shared_ptr<Collision::Contact>& contact)\n\t\t{\n\t\t\treturn contact->time > toi;\n\t\t});\n\t}\n\n\t*currentToi = toi;\n\n\treturn true;\n}\n\nvoid CcdCollisionLoop::backupContacts(const std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\t\t\t\t\t\t\t\t\t std::vector<std::list<std::shared_ptr<Collision::Contact>>>* oldContacts)\n{\n\tfor (auto& pair : ccdPairs)\n\t{\n\t\toldContacts->emplace_back(pair->getContacts());\n\t\tpair->getContacts().clear();\n\t}\n}\n\nvoid CcdCollisionLoop::restoreContacts(const std::vector<std::shared_ptr<Collision::CollisionPair>>& ccdPairs,\n\t\t\t\t\t\t\t\t\t std::vector<std::list<std::shared_ptr<Collision::Contact>>>* oldContacts)\n{\n\tif (oldContacts->size() == 0)\n\t{\n\t\treturn;\n\t}\n\n\tSURGSIM_ASSERT(oldContacts->size() == ccdPairs.size());\n\tfor (int i = 0; i < oldContacts->size(); ++i)\n\t{\n\t\tauto& newContacts = ccdPairs[i]->getContacts();\n\t\tnewContacts.splice(newContacts.end(), std::move(oldContacts->at(i)));\n\t}\n\toldContacts->clear();\n}\n\nvoid CcdCollisionLoop::printContacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tstd::cout << \"Contacts : \" << pair->getContacts().size() << std::endl;\n\t\tfor (const auto& contact : pair->getContacts())\n\t\t{\n\t\t\tstd::cout << *contact;\n\t\t}\n\t}\n}\n\nvoid CcdCollisionLoop::assert_no_contacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tSURGSIM_ASSERT(pair->getContacts().size() == 0);\n\t}\n}\n\nvoid CcdCollisionLoop::clearContacts(std::vector<std::shared_ptr<Collision::CollisionPair>> ccdPairs)\n{\n\tfor (const auto& pair : ccdPairs)\n\t{\n\t\tpair->getContacts().clear();\n\t}\n}\n\n}\n}<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"otbVectorDataKeywordlist.h\"\n#include <iomanip>\n\nnamespace otb\n{\n\nVectorDataKeywordlist\n::VectorDataKeywordlist()\n{\n \/\/Nothing to do here\n}\n\nVectorDataKeywordlist\n::~VectorDataKeywordlist()\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n CPLFree(m_FieldList[i].second.String);\n }\n delete (m_FieldList[i].first);\n }\n}\n\nvoid\nVectorDataKeywordlist\n::AddField(OGRFieldDefn* fieldDefn, OGRField* field)\n{\n FieldType newField;\n newField.first = fieldDefn;\n newField.second = *field;\n \/\/TODO: evaluate performance impact of fieldDefn copy\n \/\/ the object itself could be handled at the VectorData level\n \/\/ keeping only pointer here. (but it does not seem\n \/\/ necessary so far...)\n m_FieldList.push_back(CopyOgrField(newField));\n}\n\nvoid\nVectorDataKeywordlist\n::AddField(std::string key, std::string value)\n{\n FieldType newField;\n\n OGRFieldDefn* fieldDefn = new OGRFieldDefn(key.c_str(), OFTString);\n\n OGRField field;\n char * cstr = new char[value.length() + 1];\n strcpy(cstr, value.c_str());\n field.String = cstr;\n\n newField.first = fieldDefn;\n newField.second = field;\n m_FieldList.push_back(newField);\n}\n\nstd::string\nVectorDataKeywordlist\n::GetFieldAsString(std::string key) const\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n return m_FieldList[i].second.String;\n }\n if (m_FieldList[i].first->GetType() == OFTReal)\n {\n std::ostringstream ss;\n ss << std::setprecision(15) << m_FieldList[i].second.Real;\n return ss.str();\n }\n itkExceptionMacro(<< \"This type is not handled (yet) by GetFieldAsString(), please request for it\");\n }\n }\n return \"\";\n}\n\nbool\nVectorDataKeywordlist\n::HasField(std::string key) const\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n return true;\n }\n }\n return false;\n}\n\nvoid\nVectorDataKeywordlist\n::SetFieldAsString(std::string key, std::string value)\n{\n if (HasField(key))\n {\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n OGRField field;\n char * cstr = new char[value.length() + 1];\n strcpy(cstr, value.c_str());\n field.String = cstr;\n m_FieldList[i].second = field;\n }\n else\n {\n itkExceptionMacro(<< \"This type is not of string type, can't add the element in it\");\n }\n }\n }\n }\n else\n {\n AddField(key, value);\n }\n}\n\nVectorDataKeywordlist::FieldType\nVectorDataKeywordlist\n::GetNthField(unsigned int index) const\n{\n if (index > m_FieldList.size())\n {\n itkExceptionMacro(<< \" Accessing out-of-range metadata \");\n }\n return m_FieldList[index];\n}\n\nunsigned int\nVectorDataKeywordlist\n::GetNumberOfFields() const\n{\n return m_FieldList.size();\n}\n\nvoid\nVectorDataKeywordlist\n::operator =(const Self& p)\n{\n for (unsigned int i = 0; i < p.m_FieldList.size(); ++i)\n {\n m_FieldList.push_back(CopyOgrField(p.m_FieldList[i]));\n }\n}\n\nvoid\nVectorDataKeywordlist\n::Print(std::ostream& os, itk::Indent indent) const\n{\n this->PrintSelf(os, indent.GetNextIndent());\n}\n\nvoid\nVectorDataKeywordlist\n::PrintSelf(std::ostream& os, itk::Indent indent) const\n{\n os << indent << \" VectorData Keyword list: \";\n os << indent << \" - Size: \" << m_FieldList.size() << std::endl;\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n os << indent << \" \" << PrintField(m_FieldList[i]);\n }\n}\n\nstd::string\nVectorDataKeywordlist\n::PrintField(FieldType field) const\n{\n std::stringstream output;\n output << std::setprecision(15);\n output << field.first->GetNameRef() << \" (\";\n output << field.first->GetFieldTypeName(field.first->GetType()) << \"): \";\n switch (field.first->GetType())\n {\n case OFTInteger:\n {\n output << field.second.Integer;\n break;\n }\n case OFTIntegerList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTReal:\n {\n output << field.second.Real;\n break;\n }\n case OFTRealList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTString:\n {\n if (field.second.String != NULL)\n {\n output << field.second.String;\n }\n break;\n }\n case OFTStringList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTWideString:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTWideStringList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTBinary:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTDate:\n {\n output << field.second.Date.Year << field.second.Date.Month << field.second.Date.Day;\n break;\n }\n case OFTTime:\n {\n output << field.second.Date.Hour << field.second.Date.Minute << field.second.Date.Second;\n break;\n }\n case OFTDateTime:\n {\n output << field.second.Date.Year << field.second.Date.Month << field.second.Date.Day << \"-\"\n << field.second.Date.Hour << field.second.Date.Minute << field.second.Date.Second;\n break;\n }\n }\n output << std::endl;\n return output.str();\n}\n\nVectorDataKeywordlist::FieldType\nVectorDataKeywordlist\n::CopyOgrField(FieldType field)\n{\n FieldType outField;\n outField.first = new OGRFieldDefn(field.first);\n switch (field.first->GetType())\n {\n case OFTInteger:\n {\n outField.second.Integer = field.second.Integer;\n break;\n }\n case OFTIntegerList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTReal:\n {\n outField.second.Real = field.second.Real;\n break;\n }\n case OFTRealList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTString:\n {\n if (field.second.String != NULL)\n {\n CPLFree(outField.second.String);\n outField.second.String = CPLStrdup(field.second.String);\n }\n break;\n }\n case OFTStringList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTWideString:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTWideStringList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTBinary:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTDate:\n {\n outField.second.Date.Year = field.second.Date.Year;\n outField.second.Date.Month = field.second.Date.Month;\n outField.second.Date.Day = field.second.Date.Day;\n break;\n }\n case OFTTime:\n {\n outField.second.Date.Hour = field.second.Date.Hour;\n outField.second.Date.Minute = field.second.Date.Minute;\n outField.second.Date.Second = field.second.Date.Second;\n break;\n }\n case OFTDateTime:\n {\n outField.second.Date.Year = field.second.Date.Year;\n outField.second.Date.Month = field.second.Date.Month;\n outField.second.Date.Day = field.second.Date.Day;\n outField.second.Date.Hour = field.second.Date.Hour;\n outField.second.Date.Minute = field.second.Date.Minute;\n outField.second.Date.Second = field.second.Date.Second;\n break;\n }\n }\n return outField;\n}\n\nstd::ostream &\noperator <<(std::ostream& os, const VectorDataKeywordlist& kwl)\n{\n kwl.Print(os);\n return os;\n}\n\n}\n<commit_msg>ENH: support integer in shapefile metadata<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n\n#include \"otbVectorDataKeywordlist.h\"\n#include <iomanip>\n\nnamespace otb\n{\n\nVectorDataKeywordlist\n::VectorDataKeywordlist()\n{\n \/\/Nothing to do here\n}\n\nVectorDataKeywordlist\n::~VectorDataKeywordlist()\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n CPLFree(m_FieldList[i].second.String);\n }\n delete (m_FieldList[i].first);\n }\n}\n\nvoid\nVectorDataKeywordlist\n::AddField(OGRFieldDefn* fieldDefn, OGRField* field)\n{\n FieldType newField;\n newField.first = fieldDefn;\n newField.second = *field;\n \/\/TODO: evaluate performance impact of fieldDefn copy\n \/\/ the object itself could be handled at the VectorData level\n \/\/ keeping only pointer here. (but it does not seem\n \/\/ necessary so far...)\n m_FieldList.push_back(CopyOgrField(newField));\n}\n\nvoid\nVectorDataKeywordlist\n::AddField(std::string key, std::string value)\n{\n FieldType newField;\n\n OGRFieldDefn* fieldDefn = new OGRFieldDefn(key.c_str(), OFTString);\n\n OGRField field;\n char * cstr = new char[value.length() + 1];\n strcpy(cstr, value.c_str());\n field.String = cstr;\n\n newField.first = fieldDefn;\n newField.second = field;\n m_FieldList.push_back(newField);\n}\n\nstd::string\nVectorDataKeywordlist\n::GetFieldAsString(std::string key) const\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n return m_FieldList[i].second.String;\n }\n if (m_FieldList[i].first->GetType() == OFTInteger)\n {\n std::ostringstream ss;\n ss << std::setprecision(15) << m_FieldList[i].second.Integer;\n return ss.str();\n }\n if (m_FieldList[i].first->GetType() == OFTReal)\n {\n std::ostringstream ss;\n ss << std::setprecision(15) << m_FieldList[i].second.Real;\n return ss.str();\n }\n itkExceptionMacro(<< \"This type (\" << m_FieldList[i].first->GetType() << \") is not handled (yet) by GetFieldAsString(), please request for it\");\n }\n }\n return \"\";\n}\n\nbool\nVectorDataKeywordlist\n::HasField(std::string key) const\n{\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n return true;\n }\n }\n return false;\n}\n\nvoid\nVectorDataKeywordlist\n::SetFieldAsString(std::string key, std::string value)\n{\n if (HasField(key))\n {\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n if (key.compare(m_FieldList[i].first->GetNameRef()) == 0)\n {\n if (m_FieldList[i].first->GetType() == OFTString)\n {\n OGRField field;\n char * cstr = new char[value.length() + 1];\n strcpy(cstr, value.c_str());\n field.String = cstr;\n m_FieldList[i].second = field;\n }\n else\n {\n itkExceptionMacro(<< \"This type is not of string type, can't add the element in it\");\n }\n }\n }\n }\n else\n {\n AddField(key, value);\n }\n}\n\nVectorDataKeywordlist::FieldType\nVectorDataKeywordlist\n::GetNthField(unsigned int index) const\n{\n if (index > m_FieldList.size())\n {\n itkExceptionMacro(<< \" Accessing out-of-range metadata \");\n }\n return m_FieldList[index];\n}\n\nunsigned int\nVectorDataKeywordlist\n::GetNumberOfFields() const\n{\n return m_FieldList.size();\n}\n\nvoid\nVectorDataKeywordlist\n::operator =(const Self& p)\n{\n for (unsigned int i = 0; i < p.m_FieldList.size(); ++i)\n {\n m_FieldList.push_back(CopyOgrField(p.m_FieldList[i]));\n }\n}\n\nvoid\nVectorDataKeywordlist\n::Print(std::ostream& os, itk::Indent indent) const\n{\n this->PrintSelf(os, indent.GetNextIndent());\n}\n\nvoid\nVectorDataKeywordlist\n::PrintSelf(std::ostream& os, itk::Indent indent) const\n{\n os << indent << \" VectorData Keyword list: \";\n os << indent << \" - Size: \" << m_FieldList.size() << std::endl;\n for (unsigned int i = 0; i < m_FieldList.size(); ++i)\n {\n os << indent << \" \" << PrintField(m_FieldList[i]);\n }\n}\n\nstd::string\nVectorDataKeywordlist\n::PrintField(FieldType field) const\n{\n std::stringstream output;\n output << std::setprecision(15);\n output << field.first->GetNameRef() << \" (\";\n output << field.first->GetFieldTypeName(field.first->GetType()) << \"): \";\n switch (field.first->GetType())\n {\n case OFTInteger:\n {\n output << field.second.Integer;\n break;\n }\n case OFTIntegerList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTReal:\n {\n output << field.second.Real;\n break;\n }\n case OFTRealList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTString:\n {\n if (field.second.String != NULL)\n {\n output << field.second.String;\n }\n break;\n }\n case OFTStringList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTWideString:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTWideStringList:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTBinary:\n {\n output << \"Type not handled for printing\";\n break;\n }\n case OFTDate:\n {\n output << field.second.Date.Year << field.second.Date.Month << field.second.Date.Day;\n break;\n }\n case OFTTime:\n {\n output << field.second.Date.Hour << field.second.Date.Minute << field.second.Date.Second;\n break;\n }\n case OFTDateTime:\n {\n output << field.second.Date.Year << field.second.Date.Month << field.second.Date.Day << \"-\"\n << field.second.Date.Hour << field.second.Date.Minute << field.second.Date.Second;\n break;\n }\n }\n output << std::endl;\n return output.str();\n}\n\nVectorDataKeywordlist::FieldType\nVectorDataKeywordlist\n::CopyOgrField(FieldType field)\n{\n FieldType outField;\n outField.first = new OGRFieldDefn(field.first);\n switch (field.first->GetType())\n {\n case OFTInteger:\n {\n outField.second.Integer = field.second.Integer;\n break;\n }\n case OFTIntegerList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTReal:\n {\n outField.second.Real = field.second.Real;\n break;\n }\n case OFTRealList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTString:\n {\n if (field.second.String != NULL)\n {\n CPLFree(outField.second.String);\n outField.second.String = CPLStrdup(field.second.String);\n }\n break;\n }\n case OFTStringList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTWideString:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTWideStringList:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTBinary:\n {\n std::cerr << \"OGR type not handled\" << std::endl;\n break;\n }\n case OFTDate:\n {\n outField.second.Date.Year = field.second.Date.Year;\n outField.second.Date.Month = field.second.Date.Month;\n outField.second.Date.Day = field.second.Date.Day;\n break;\n }\n case OFTTime:\n {\n outField.second.Date.Hour = field.second.Date.Hour;\n outField.second.Date.Minute = field.second.Date.Minute;\n outField.second.Date.Second = field.second.Date.Second;\n break;\n }\n case OFTDateTime:\n {\n outField.second.Date.Year = field.second.Date.Year;\n outField.second.Date.Month = field.second.Date.Month;\n outField.second.Date.Day = field.second.Date.Day;\n outField.second.Date.Hour = field.second.Date.Hour;\n outField.second.Date.Minute = field.second.Date.Minute;\n outField.second.Date.Second = field.second.Date.Second;\n break;\n }\n }\n return outField;\n}\n\nstd::ostream &\noperator <<(std::ostream& os, const VectorDataKeywordlist& kwl)\n{\n kwl.Print(os);\n return os;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"direct_tensor_attribute.h\"\n#include \"direct_tensor_saver.h\"\n\n#include <vespa\/eval\/eval\/fast_value.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <vespa\/searchlib\/attribute\/readerbase.h>\n#include <vespa\/searchlib\/util\/fileutil.h>\n#include <vespa\/vespalib\/util\/array.h>\n\n#include \"blob_sequence_reader.h\"\n#include \"tensor_deserialize.h\"\n#include \"tensor_attribute.hpp\"\n\nusing vespalib::eval::FastValueBuilderFactory;\n\nnamespace search::tensor {\n\nDirectTensorAttribute::DirectTensorAttribute(stringref name, const Config &cfg)\n : TensorAttribute(name, cfg, _direct_store)\n{\n}\n\nDirectTensorAttribute::~DirectTensorAttribute()\n{\n getGenerationHolder().clearHoldLists();\n _tensorStore.clearHoldLists();\n}\n\nbool\nDirectTensorAttribute::onLoad(vespalib::Executor *)\n{\n BlobSequenceReader tensorReader(*this);\n if (!tensorReader.hasData()) {\n return false;\n }\n setCreateSerialNum(tensorReader.getCreateSerialNum());\n assert(tensorReader.getVersion() == getVersion());\n uint32_t numDocs = tensorReader.getDocIdLimit();\n _refVector.reset();\n _refVector.unsafe_reserve(numDocs);\n vespalib::Array<char> buffer(1024);\n for (uint32_t lid = 0; lid < numDocs; ++lid) {\n uint32_t tensorSize = tensorReader.getNextSize();\n if (tensorSize != 0) {\n if (tensorSize > buffer.size()) {\n buffer.resize(tensorSize + 1024);\n }\n tensorReader.readBlob(&buffer[0], tensorSize);\n auto tensor = deserialize_tensor(&buffer[0], tensorSize);\n EntryRef ref = _direct_store.store_tensor(std::move(tensor));\n _refVector.push_back(AtomicEntryRef(ref));\n } else {\n EntryRef invalid;\n _refVector.push_back(AtomicEntryRef(invalid));\n }\n }\n setNumDocs(numDocs);\n setCommittedDocIdLimit(numDocs);\n return true;\n}\n\nvoid\nDirectTensorAttribute::set_tensor(DocId lid, std::unique_ptr<vespalib::eval::Value> tensor)\n{\n checkTensorType(*tensor);\n EntryRef ref = _direct_store.store_tensor(std::move(tensor));\n setTensorRef(lid, ref);\n}\n\nvoid\nDirectTensorAttribute::setTensor(DocId lid, const vespalib::eval::Value &tensor)\n{\n set_tensor(lid, FastValueBuilderFactory::get().copy(tensor));\n}\n\nvoid\nDirectTensorAttribute::update_tensor(DocId docId,\n const document::TensorUpdate &update,\n bool create_if_non_existing)\n{\n EntryRef ref;\n if (docId < getCommittedDocIdLimit()) {\n ref = _refVector[docId].load_relaxed();\n }\n if (ref.valid()) {\n auto ptr = _direct_store.get_tensor(ref);\n if (ptr) {\n auto new_value = update.apply_to(*ptr, FastValueBuilderFactory::get());\n if (new_value) {\n set_tensor(docId, std::move(new_value));\n }\n return;\n }\n }\n if (create_if_non_existing) {\n auto new_value = update.apply_to(*_emptyTensor, FastValueBuilderFactory::get());\n if (new_value) {\n set_tensor(docId, std::move(new_value));\n }\n }\n}\n\nstd::unique_ptr<vespalib::eval::Value>\nDirectTensorAttribute::getTensor(DocId docId) const\n{\n EntryRef ref;\n if (docId < getCommittedDocIdLimit()) {\n ref = acquire_entry_ref(docId);\n }\n if (ref.valid()) {\n auto ptr = _direct_store.get_tensor(ref);\n if (ptr) {\n return FastValueBuilderFactory::get().copy(*ptr);\n }\n }\n std::unique_ptr<vespalib::eval::Value> empty;\n return empty;\n}\n\nconst vespalib::eval::Value &\nDirectTensorAttribute::get_tensor_ref(DocId docId) const\n{\n if (docId >= getCommittedDocIdLimit()) return *_emptyTensor;\n\n auto ptr = _direct_store.get_tensor(acquire_entry_ref(docId));\n if ( ptr == nullptr) return *_emptyTensor;\n\n return *ptr;\n}\n\nstd::unique_ptr<AttributeSaver>\nDirectTensorAttribute::onInitSave(vespalib::stringref fileName)\n{\n vespalib::GenerationHandler::Guard guard(getGenerationHandler().takeGuard());\n return std::make_unique<DirectTensorAttributeSaver>\n (std::move(guard),\n this->createAttributeHeader(fileName),\n getRefCopy(),\n _direct_store);\n}\n\nvoid\nDirectTensorAttribute::compactWorst()\n{\n doCompactWorst<DirectTensorStore::RefType>();\n}\n\n} \/\/ namespace\n<commit_msg>Use braces.<commit_after>\/\/ Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n\n#include \"direct_tensor_attribute.h\"\n#include \"direct_tensor_saver.h\"\n\n#include <vespa\/eval\/eval\/fast_value.h>\n#include <vespa\/eval\/eval\/value.h>\n#include <vespa\/searchlib\/attribute\/readerbase.h>\n#include <vespa\/searchlib\/util\/fileutil.h>\n#include <vespa\/vespalib\/util\/array.h>\n\n#include \"blob_sequence_reader.h\"\n#include \"tensor_deserialize.h\"\n#include \"tensor_attribute.hpp\"\n\nusing vespalib::eval::FastValueBuilderFactory;\n\nnamespace search::tensor {\n\nDirectTensorAttribute::DirectTensorAttribute(stringref name, const Config &cfg)\n : TensorAttribute(name, cfg, _direct_store)\n{\n}\n\nDirectTensorAttribute::~DirectTensorAttribute()\n{\n getGenerationHolder().clearHoldLists();\n _tensorStore.clearHoldLists();\n}\n\nbool\nDirectTensorAttribute::onLoad(vespalib::Executor *)\n{\n BlobSequenceReader tensorReader(*this);\n if (!tensorReader.hasData()) {\n return false;\n }\n setCreateSerialNum(tensorReader.getCreateSerialNum());\n assert(tensorReader.getVersion() == getVersion());\n uint32_t numDocs = tensorReader.getDocIdLimit();\n _refVector.reset();\n _refVector.unsafe_reserve(numDocs);\n vespalib::Array<char> buffer(1024);\n for (uint32_t lid = 0; lid < numDocs; ++lid) {\n uint32_t tensorSize = tensorReader.getNextSize();\n if (tensorSize != 0) {\n if (tensorSize > buffer.size()) {\n buffer.resize(tensorSize + 1024);\n }\n tensorReader.readBlob(&buffer[0], tensorSize);\n auto tensor = deserialize_tensor(&buffer[0], tensorSize);\n EntryRef ref = _direct_store.store_tensor(std::move(tensor));\n _refVector.push_back(AtomicEntryRef(ref));\n } else {\n EntryRef invalid;\n _refVector.push_back(AtomicEntryRef(invalid));\n }\n }\n setNumDocs(numDocs);\n setCommittedDocIdLimit(numDocs);\n return true;\n}\n\nvoid\nDirectTensorAttribute::set_tensor(DocId lid, std::unique_ptr<vespalib::eval::Value> tensor)\n{\n checkTensorType(*tensor);\n EntryRef ref = _direct_store.store_tensor(std::move(tensor));\n setTensorRef(lid, ref);\n}\n\nvoid\nDirectTensorAttribute::setTensor(DocId lid, const vespalib::eval::Value &tensor)\n{\n set_tensor(lid, FastValueBuilderFactory::get().copy(tensor));\n}\n\nvoid\nDirectTensorAttribute::update_tensor(DocId docId,\n const document::TensorUpdate &update,\n bool create_if_non_existing)\n{\n EntryRef ref;\n if (docId < getCommittedDocIdLimit()) {\n ref = _refVector[docId].load_relaxed();\n }\n if (ref.valid()) {\n auto ptr = _direct_store.get_tensor(ref);\n if (ptr) {\n auto new_value = update.apply_to(*ptr, FastValueBuilderFactory::get());\n if (new_value) {\n set_tensor(docId, std::move(new_value));\n }\n return;\n }\n }\n if (create_if_non_existing) {\n auto new_value = update.apply_to(*_emptyTensor, FastValueBuilderFactory::get());\n if (new_value) {\n set_tensor(docId, std::move(new_value));\n }\n }\n}\n\nstd::unique_ptr<vespalib::eval::Value>\nDirectTensorAttribute::getTensor(DocId docId) const\n{\n EntryRef ref;\n if (docId < getCommittedDocIdLimit()) {\n ref = acquire_entry_ref(docId);\n }\n if (ref.valid()) {\n auto ptr = _direct_store.get_tensor(ref);\n if (ptr) {\n return FastValueBuilderFactory::get().copy(*ptr);\n }\n }\n std::unique_ptr<vespalib::eval::Value> empty;\n return empty;\n}\n\nconst vespalib::eval::Value &\nDirectTensorAttribute::get_tensor_ref(DocId docId) const\n{\n if (docId >= getCommittedDocIdLimit()) { return *_emptyTensor; }\n\n auto ptr = _direct_store.get_tensor(acquire_entry_ref(docId));\n if ( ptr == nullptr) { return *_emptyTensor; }\n\n return *ptr;\n}\n\nstd::unique_ptr<AttributeSaver>\nDirectTensorAttribute::onInitSave(vespalib::stringref fileName)\n{\n vespalib::GenerationHandler::Guard guard(getGenerationHandler().takeGuard());\n return std::make_unique<DirectTensorAttributeSaver>\n (std::move(guard),\n this->createAttributeHeader(fileName),\n getRefCopy(),\n _direct_store);\n}\n\nvoid\nDirectTensorAttribute::compactWorst()\n{\n doCompactWorst<DirectTensorStore::RefType>();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n *\n * Condor Software Copyright Notice\n * Copyright (C) 1990-2006, Condor Team, Computer Sciences Department,\n * University of Wisconsin-Madison, WI.\n *\n * This source code is covered by the Condor Public License, which can\n * be found in the accompanying LICENSE.TXT file, or online at\n * www.condorproject.org.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * AND THE UNIVERSITY OF WISCONSIN-MADISON \"AS IS\" AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY, OF SATISFACTORY QUALITY, AND FITNESS\n * FOR A PARTICULAR PURPOSE OR USE ARE DISCLAIMED. THE COPYRIGHT\n * HOLDERS AND CONTRIBUTORS AND THE UNIVERSITY OF WISCONSIN-MADISON\n * MAKE NO MAKE NO REPRESENTATION THAT THE SOFTWARE, MODIFICATIONS,\n * ENHANCEMENTS OR DERIVATIVE WORKS THEREOF, WILL NOT INFRINGE ANY\n * PATENT, COPYRIGHT, TRADEMARK, TRADE SECRET OR OTHER PROPRIETARY\n * RIGHT.\n *\n ****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_random_num.h\"\n#include \"io_proxy.h\"\n#include \"io_proxy_handler.h\"\n#include \"starter_privsep_helper.h\"\n\n#define IO_PROXY_COOKIE_SIZE 32\n\nstatic char * cookie_create( int length );\n\nIOProxy::IOProxy()\n{\n\tserver = NULL;\n\tcookie = 0;\n\tsocket_registered = false;\n}\n\nIOProxy::~IOProxy()\n{\n\tif ( daemonCore && socket_registered && server ) {\n\t\tdaemonCore->Cancel_Socket(server);\n\t}\n\tif ( server ) {\n\t\tserver->close();\n\t\tdelete server;\n\t}\n\tif(cookie) free(cookie);\n}\n\n\/*\nThis callback is invoked for each new incoming connection.\nIn response, fork a new IOProxyHandler child to deal with the stream.\nReturns KEEP_STREAM if the stream is still valid, ~KEEP_STREAM otherwise.\n*\/\n\nint IOProxy::connect_callback( Stream * \/*stream*\/ )\n{\n\tReliSock *client = new ReliSock;\n\tbool accept_client = false;\n\tint success;\n\n\tsuccess = server->accept(*client);\n\tif(success) {\n\t\tif( my_ip_addr() != client->endpoint_ip_int() ) {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: rejecting connection from %s: invalid ip addr\\n\",client->endpoint_ip_str());\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: accepting connection from %s\\n\",client->endpoint_ip_str());\n\t\t\taccept_client = true;\n\t\t}\n\t} else {\n\t\tdprintf(D_ALWAYS,\"IOProxy: Couldn't accept connection: %s\\n\",strerror(errno));\n\t}\n\t\n\tif(accept_client) {\n\t\tIOProxyHandler *handler = new IOProxyHandler();\n\t\tif(!handler->init(client,cookie)) {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't register request callback!\\n\");\n\t\t\tclient->close();\n\t\t\tdelete client;\n\t\t}\n\n\t} else {\n\t\tclient->close();\n\t\tdelete client;\n\t}\n\n\treturn KEEP_STREAM;\n}\n\n\/*\nInitialize this proxy and dump the contact information into the given file.\nReturns true on success, false otherwise.\n*\/\n\nbool IOProxy::init( const char *config_file )\n{\n\tFILE *file=0;\n\tint fd=-1;\n\n\tserver = new ReliSock;\n\tif ( !server ) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create socket\\n\");\n\t\treturn false;\n\t}\n\n\t\/* FALSE means this is an incomming connection *\/\n\tif(!server->bind(FALSE)) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't bind: %s\\n\",strerror(errno));\n\t\treturn false;\n\t}\n\n\tif(!server->listen()) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't listen: %s\\n\",strerror(errno));\n\t\treturn false;\n\t}\n\n\tcookie = cookie_create(IO_PROXY_COOKIE_SIZE);\n\tif(!cookie) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create cookie: %s\\n\",strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tif (privsep_enabled()) {\n\t\tfd = privsep_helper.open_sandbox_file(config_file,\n\t\t O_CREAT|O_TRUNC|O_WRONLY,\n\t\t 0700);\n\t}\n\telse {\n\t\tfd = safe_open_wrapper(config_file,\n\t\t O_CREAT|O_TRUNC|O_WRONLY,\n\t\t 0700);\n\t}\n\tif(fd<0) {\n\t\tdprintf(D_ALWAYS,\n\t\t \"IOProxy: couldn't write to %s: %s\\n\",\n\t\t config_file,\n\t\t strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tfile = fdopen(fd,\"w\");\n\tif(!file) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create I\/O stream: %s\\n\",strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tfprintf(file,\"%s %d %s\\n\",my_ip_string(),server->get_port(),cookie);\n\tfclose(file);\n\n\tdaemonCore->Register_Socket( server, \"IOProxy listen socket\", \n\t\t(SocketHandlercpp) &IOProxy::connect_callback, \n\t\t\"IOProxy connect callback\", this );\n\tsocket_registered = true;\n\treturn true;\n\n\tfailure:\n\tif(cookie) free(cookie);\n\tif(file) fclose(file);\n\tunlink(config_file);\n\tserver->close();\n\treturn false;\n}\n\n\/*\nOn success, returns a newly-allocated random cookie string.\nOn failure, returns null.\n*\/\n\nstatic char * cookie_create( int length )\n{\n\tchar *c = (char*) malloc(length);\n\tif(!c) return 0;\n\n\tfor( int i=0; i<length; i++ ) {\n\t\tc[i] = 'a'+get_random_int()%26;\n\t}\n\n\tc[length-1] = 0;\n\n\treturn c;\n}\n\n<commit_msg>no need to register the chrip (IOproxy) listen socket in the starter with a GCB broker, since only machines on this host can ever authenticate to it.<commit_after>\/***************************Copyright-DO-NOT-REMOVE-THIS-LINE**\n *\n * Condor Software Copyright Notice\n * Copyright (C) 1990-2006, Condor Team, Computer Sciences Department,\n * University of Wisconsin-Madison, WI.\n *\n * This source code is covered by the Condor Public License, which can\n * be found in the accompanying LICENSE.TXT file, or online at\n * www.condorproject.org.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * AND THE UNIVERSITY OF WISCONSIN-MADISON \"AS IS\" AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY, OF SATISFACTORY QUALITY, AND FITNESS\n * FOR A PARTICULAR PURPOSE OR USE ARE DISCLAIMED. THE COPYRIGHT\n * HOLDERS AND CONTRIBUTORS AND THE UNIVERSITY OF WISCONSIN-MADISON\n * MAKE NO MAKE NO REPRESENTATION THAT THE SOFTWARE, MODIFICATIONS,\n * ENHANCEMENTS OR DERIVATIVE WORKS THEREOF, WILL NOT INFRINGE ANY\n * PATENT, COPYRIGHT, TRADEMARK, TRADE SECRET OR OTHER PROPRIETARY\n * RIGHT.\n *\n ****************************Copyright-DO-NOT-REMOVE-THIS-LINE**\/\n\n#include \"condor_common.h\"\n#include \"condor_random_num.h\"\n#include \"io_proxy.h\"\n#include \"io_proxy_handler.h\"\n#include \"starter_privsep_helper.h\"\n\n#define IO_PROXY_COOKIE_SIZE 32\n\nstatic char * cookie_create( int length );\n\nIOProxy::IOProxy()\n{\n\tserver = NULL;\n\tcookie = 0;\n\tsocket_registered = false;\n}\n\nIOProxy::~IOProxy()\n{\n\tif ( daemonCore && socket_registered && server ) {\n\t\tdaemonCore->Cancel_Socket(server);\n\t}\n\tif ( server ) {\n\t\tserver->close();\n\t\tdelete server;\n\t}\n\tif(cookie) free(cookie);\n}\n\n\/*\nThis callback is invoked for each new incoming connection.\nIn response, fork a new IOProxyHandler child to deal with the stream.\nReturns KEEP_STREAM if the stream is still valid, ~KEEP_STREAM otherwise.\n*\/\n\nint IOProxy::connect_callback( Stream * \/*stream*\/ )\n{\n\tReliSock *client = new ReliSock;\n\tbool accept_client = false;\n\tint success;\n\n\tsuccess = server->accept(*client);\n\tif(success) {\n\t\tif( my_ip_addr() != client->endpoint_ip_int() ) {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: rejecting connection from %s: invalid ip addr\\n\",client->endpoint_ip_str());\n\t\t} else {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: accepting connection from %s\\n\",client->endpoint_ip_str());\n\t\t\taccept_client = true;\n\t\t}\n\t} else {\n\t\tdprintf(D_ALWAYS,\"IOProxy: Couldn't accept connection: %s\\n\",strerror(errno));\n\t}\n\t\n\tif(accept_client) {\n\t\tIOProxyHandler *handler = new IOProxyHandler();\n\t\tif(!handler->init(client,cookie)) {\n\t\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't register request callback!\\n\");\n\t\t\tclient->close();\n\t\t\tdelete client;\n\t\t}\n\n\t} else {\n\t\tclient->close();\n\t\tdelete client;\n\t}\n\n\treturn KEEP_STREAM;\n}\n\n\/*\nInitialize this proxy and dump the contact information into the given file.\nReturns true on success, false otherwise.\n*\/\n\nbool IOProxy::init( const char *config_file )\n{\n\tFILE *file=0;\n\tint fd=-1;\n\n\tserver = new ReliSock;\n\tif ( !server ) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create socket\\n\");\n\t\treturn false;\n\t}\n\n\t\/* passing FALSE to bind means this is an incomming connection.\n\t * however, here we are going to pass TRUE because only machines\n\t * on this host need to connect to the ioproxy (chirp) socket,\n\t * so there is no need to register it with a gcb broker. \n\t **\/\n\tif(!server->bind(TRUE)) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't bind: %s\\n\",strerror(errno));\n\t\treturn false;\n\t}\n\n\tif(!server->listen()) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't listen: %s\\n\",strerror(errno));\n\t\treturn false;\n\t}\n\n\tcookie = cookie_create(IO_PROXY_COOKIE_SIZE);\n\tif(!cookie) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create cookie: %s\\n\",strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tif (privsep_enabled()) {\n\t\tfd = privsep_helper.open_sandbox_file(config_file,\n\t\t O_CREAT|O_TRUNC|O_WRONLY,\n\t\t 0700);\n\t}\n\telse {\n\t\tfd = safe_open_wrapper(config_file,\n\t\t O_CREAT|O_TRUNC|O_WRONLY,\n\t\t 0700);\n\t}\n\tif(fd<0) {\n\t\tdprintf(D_ALWAYS,\n\t\t \"IOProxy: couldn't write to %s: %s\\n\",\n\t\t config_file,\n\t\t strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tfile = fdopen(fd,\"w\");\n\tif(!file) {\n\t\tdprintf(D_ALWAYS,\"IOProxy: couldn't create I\/O stream: %s\\n\",strerror(errno));\n\t\tgoto failure;\n\t}\n\n\tfprintf(file,\"%s %d %s\\n\",my_ip_string(),server->get_port(),cookie);\n\tfclose(file);\n\n\tdaemonCore->Register_Socket( server, \"IOProxy listen socket\", \n\t\t(SocketHandlercpp) &IOProxy::connect_callback, \n\t\t\"IOProxy connect callback\", this );\n\tsocket_registered = true;\n\treturn true;\n\n\tfailure:\n\tif(cookie) free(cookie);\n\tif(file) fclose(file);\n\tunlink(config_file);\n\tserver->close();\n\treturn false;\n}\n\n\/*\nOn success, returns a newly-allocated random cookie string.\nOn failure, returns null.\n*\/\n\nstatic char * cookie_create( int length )\n{\n\tchar *c = (char*) malloc(length);\n\tif(!c) return 0;\n\n\tfor( int i=0; i<length; i++ ) {\n\t\tc[i] = 'a'+get_random_int()%26;\n\t}\n\n\tc[length-1] = 0;\n\n\treturn c;\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>`yli::callback_system::CallbackObject`: `anyvalue_hashmap` is `private`.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * Buzzer.cpp\n *\n * Created: 7-2-2013 0:22:37\n * Author: Elco\n *\/ \n#include \"pins.h\"\n#include \"Buzzer.h\"\n#include <util\/delay.h>\n\n#if (alarmPin != 3)\n\t#error \"Check PWM settings when you want to use a different pin for the alarm\"\n#endif\n\n#if defined(USBCON)\n\/\/ Arduino Leonardo, the buzzer is on OC0B, but Timer0 is already in use for micros() and millis()\n\/\/ Do not change anything about the timer, just use the output mode\n#define BEEP_ON() bitSet(TCCR0A,COM0B1);\n#define BEEP_OFF() bitClear(TCCR0A,COM0B1);\n\nvoid Buzzer::init(void){\n\t\/\/ set up square wave PWM for buzzer\n\tpinMode(alarmPin,OUTPUT);\n}\n\n#else\n\/\/ Arduino Uno, the buzzer is on OC2B\n#define BEEP_ON() bitSet(TCCR2A,COM2B1);\n#define BEEP_OFF() bitClear(TCCR2A,COM2B1);\n\t\nvoid Buzzer::init(void){\n\t\/\/ set up square wave PWM for buzzer\n\tpinMode(alarmPin,OUTPUT);\n\t\/\/ Arduino UNO, buzzer is on OC2B\n\tTCCR2A = (1<<COM2B1) | (1<<WGM22) | (1<<WGM20);\n\tTCCR2B = (1<<CS21) | (1<<CS20); \/\/ prescaler = 32\n\tOCR2A = 125; \/\/ timer top. This value adjusts the frequency.\n}\n#endif\n\n\nvoid Buzzer::beep(uint8_t numBeeps, uint16_t duration){\n\tfor(uint8_t beepCount = 0; beepCount<numBeeps; beepCount++){\n\t\tBEEP_ON();\n\t\tdelay(duration);\n\t\tBEEP_OFF();\n\t\tif(beepCount < numBeeps - 1){\n\t\t\tdelay(duration); \/\/ not the last beep\n\t\t}\t\t\n\t}\t\t\n}\t\n\t\nBuzzer buzzer;<commit_msg>Fixed buzzer on Arduino UNO<commit_after>\/*\n * Buzzer.cpp\n *\n * Created: 7-2-2013 0:22:37\n * Author: Elco\n *\/ \n#include \"pins.h\"\n#include \"Buzzer.h\"\n#include <util\/delay.h>\n\n#if (alarmPin != 3)\n\t#error \"Check PWM settings when you want to use a different pin for the alarm\"\n#endif\n\n#if defined(USBCON)\n\/\/ Arduino Leonardo, the buzzer is on OC0B, but Timer0 is already in use for micros() and millis()\n\/\/ Do not change anything about the timer, just use the output mode\n#define BEEP_ON() bitSet(TCCR0A,COM0B1);\n#define BEEP_OFF() bitClear(TCCR0A,COM0B1);\n\nvoid Buzzer::init(void){\n\t\/\/ set up square wave PWM for buzzer\n\tpinMode(alarmPin,OUTPUT);\n}\n\n#else\n\/\/ Arduino Uno, the buzzer is on OC2B\n#define BEEP_ON() bitSet(TCCR2A,COM2B1);\n#define BEEP_OFF() bitClear(TCCR2A,COM2B1);\n\t\nvoid Buzzer::init(void){\n\t\/\/ set up square wave PWM for buzzer\n\tpinMode(alarmPin,OUTPUT);\n\t\/\/ Arduino UNO, buzzer is on OC2B\n\tTCCR2A = (1<<COM2B1) | (1<<WGM20);\n\tTCCR2B = (1<<WGM22) | (1<<CS21) | (1<<CS20); \/\/ prescaler = 32\n\tOCR2A = 125; \/\/ timer top. This value adjusts the frequency.\n\tOCR2B = 62;\n}\n\n#endif\n\n\nvoid Buzzer::beep(uint8_t numBeeps, uint16_t duration){\n\tfor(uint8_t beepCount = 0; beepCount<numBeeps; beepCount++){\n\t\tBEEP_ON();\n\t\tdelay(duration);\n\t\tBEEP_OFF();\n\t\tif(beepCount < numBeeps - 1){\n\t\t\tdelay(duration); \/\/ not the last beep\n\t\t}\t\t\n\t}\t\t\n}\t\n\t\nBuzzer buzzer;<|endoftext|>"} {"text":"<commit_before>#include \"ParaMapConverter.h\"\n\n\nusing namespace std;\n\nnamespace dcmqi {\n\n int ParaMapConverter::itkimage2paramap(const string &inputFileName, const string &dicomImageFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t const string &metaDataFileName, const string &outputFileName) {\n\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFileName.c_str());\n reader->Update();\n ImageType::Pointer parametricMapImage = reader->GetOutput();\n\n ImageType::SizeType inputSize = parametricMapImage->GetBufferedRegion().GetSize();\n cout << \"Input image size: \" << inputSize << endl;\n\n JSONParametricMapMetaInformationHandler metaInfo(metaDataFileName);\n metaInfo.read();\n\n MinMaxCalculatorType::Pointer calculator = MinMaxCalculatorType::New();\n calculator->SetImage(parametricMapImage);\n calculator->Compute();\n\n metaInfo.setFirstValueMapped(calculator->GetMinimum());\n metaInfo.setLastValueMapped(calculator->GetMaximum());\n\n IODEnhGeneralEquipmentModule::EquipmentInfo eq = getEnhEquipmentInfo();\n ContentIdentificationMacro contentID = createContentIdentificationInformation();\n CHECK_COND(contentID.setInstanceNumber(metaInfo.getInstanceNumber().c_str()));\n\n DcmDataset pMapDocDataset;\n DPMParametricMapFloat *pMapDoc = NULL;\n\n \/\/ TODO: following should maybe be moved to meta info\n OFString imageFlavor = \"VOLUME\";\n OFString pixContrast = \"MTT\";\n DPMTypes::ContentQualification contQual = DPMTypes::CQ_RESEARCH;\n OFString modality = \"MR\";\n\n CHECK_COND(DPMParametricMapFloat::create(pMapDoc, modality, metaInfo.getSeriesNumber().c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t metaInfo.getInstanceNumber().c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t inputSize[0], inputSize[1], eq, contentID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t imageFlavor, pixContrast, contQual));\n\n if (!dicomImageFileName.empty())\n CHECK_COND(pMapDoc->import(dicomImageFileName.c_str(), OFTrue, OFTrue, OFFalse, OFTrue));\n\n \/* Initialize dimension module *\/\n char dimUID[128];\n dcmGenerateUniqueIdentifier(dimUID, QIICR_UID_ROOT);\n IODMultiframeDimensionModule &mfdim = pMapDoc->getIODMultiframeDimensionModule();\n OFCondition result = mfdim.addDimensionIndex(DCM_ImagePositionPatient, dimUID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DCM_RealWorldValueMappingSequence, \"Frame position\");\n\n \/\/ Shared FGs: PixelMeasuresSequence\n {\n FGPixelMeasures *pixmsr = new FGPixelMeasures();\n\n ImageType::SpacingType labelSpacing = parametricMapImage->GetSpacing();\n ostringstream spacingSStream;\n spacingSStream << scientific << labelSpacing[0] << \"\\\\\" << labelSpacing[1];\n CHECK_COND(pixmsr->setPixelSpacing(spacingSStream.str().c_str()));\n\n spacingSStream.clear(); spacingSStream.str(\"\");\n spacingSStream << scientific << labelSpacing[2];\n CHECK_COND(pixmsr->setSpacingBetweenSlices(spacingSStream.str().c_str()));\n CHECK_COND(pixmsr->setSliceThickness(spacingSStream.str().c_str()));\n CHECK_COND(pMapDoc->addForAllFrames(*pixmsr));\n }\n\n \/\/ Shared FGs: PlaneOrientationPatientSequence\n {\n OFString imageOrientationPatientStr;\n\n ImageType::DirectionType labelDirMatrix = parametricMapImage->GetDirection();\n\n cout << \"Directions: \" << labelDirMatrix << endl;\n\n FGPlaneOrientationPatient *planor =\n FGPlaneOrientationPatient::createMinimal(\n Helper::floatToStrScientific(labelDirMatrix[0][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[1][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[2][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[0][1]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[1][1]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[2][1]).c_str());\n\n \/\/CHECK_COND(planor->setImageOrientationPatient(imageOrientationPatientStr));\n CHECK_COND(pMapDoc->addForAllFrames(*planor));\n }\n\n FGFrameAnatomy frameAnaFG;\n frameAnaFG.setLaterality(FGFrameAnatomy::LATERALITY_UNPAIRED);\n frameAnaFG.getAnatomy().getAnatomicRegion().set(\"T-A0100\", \"SRT\", \"Brain\");\n CHECK_COND(pMapDoc->addForAllFrames(frameAnaFG));\n\n FGIdentityPixelValueTransformation idTransFG;\n \/\/ Rescale Intercept, Rescale Slope, Rescale Type are missing here\n CHECK_COND(pMapDoc->addForAllFrames(idTransFG));\n\n FGParametricMapFrameType frameTypeFG;\n frameTypeFG.setFrameType(\"DERIVED\\\\PRIMARY\\\\VOLUME\\\\MTT\");\n CHECK_COND(pMapDoc->addForAllFrames(frameTypeFG));\n\n for (unsigned long f = 0; result.good() && (f < inputSize[2]); f++) {\n result = addFrame(pMapDoc, parametricMapImage, metaInfo, f);\n }\n\n {\n string bodyPartAssigned = metaInfo.getBodyPartExamined();\n if(!dicomImageFileName.empty() && bodyPartAssigned.empty()) {\n DcmFileFormat sliceFF;\n CHECK_COND(sliceFF.loadFile(dicomImageFileName.c_str()));\n OFString bodyPartStr;\n if(sliceFF.getDataset()->findAndGetOFString(DCM_BodyPartExamined, bodyPartStr).good()) {\n if (!bodyPartStr.empty())\n bodyPartAssigned = bodyPartStr.c_str();\n }\n }\n if(!bodyPartAssigned.empty())\n pMapDoc->getIODGeneralSeriesModule().setBodyPartExamined(bodyPartAssigned.c_str());\n }\n\n \/\/ SeriesDate\/Time should be of when parametric map was taken; initialize to when it was saved\n {\n OFString contentDate, contentTime;\n DcmDate::getCurrentDate(contentDate);\n DcmTime::getCurrentTime(contentTime);\n\n pMapDocDataset.putAndInsertString(DCM_ContentDate, contentDate.c_str());\n pMapDocDataset.putAndInsertString(DCM_ContentTime, contentTime.c_str());\n pMapDocDataset.putAndInsertString(DCM_SeriesDate, contentDate.c_str());\n pMapDocDataset.putAndInsertString(DCM_SeriesTime, contentTime.c_str());\n\n pMapDocDataset.putAndInsertString(DCM_SeriesDescription, metaInfo.getSeriesDescription().c_str());\n pMapDocDataset.putAndInsertString(DCM_SeriesNumber, metaInfo.getSeriesNumber().c_str());\n }\n\n CHECK_COND(pMapDoc->writeDataset(pMapDocDataset));\n CHECK_COND(pMapDoc->saveFile(outputFileName.c_str()));\n\n COUT << \"Saved parametric map as \" << outputFileName << endl;\n return EXIT_SUCCESS;\n }\n\n int ParaMapConverter::paramap2itkimage(const string &inputParamapFileName, const string &outputDirName) {\n return EXIT_SUCCESS;\n }\n\n OFCondition ParaMapConverter::addFrame(DPMParametricMapFloat *map, const ImageType::Pointer ¶metricMapImage,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t const JSONParametricMapMetaInformationHandler &metaInfo,\n const unsigned long frameNo)\n {\n ImageType::RegionType sliceRegion;\n ImageType::IndexType sliceIndex;\n ImageType::SizeType inputSize = parametricMapImage->GetBufferedRegion().GetSize();\n\n sliceIndex[0] = 0;\n sliceIndex[1] = 0;\n sliceIndex[2] = frameNo;\n\n inputSize[2] = 1;\n\n sliceRegion.SetIndex(sliceIndex);\n sliceRegion.SetSize(inputSize);\n\n const unsigned frameSize = inputSize[0] * inputSize[1];\n\n Float32 *data = new Float32[frameSize];\n\n if (data == NULL) {\n return EC_MemoryExhausted;\n }\n\n itk::ImageRegionConstIteratorWithIndex<ImageType> sliceIterator(parametricMapImage, sliceRegion);\n\n unsigned framePixelCnt = 0;\n for(sliceIterator.GoToBegin();!sliceIterator.IsAtEnd(); ++sliceIterator, ++framePixelCnt){\n data[framePixelCnt] = sliceIterator.Get();\n ImageType::IndexType idx = sliceIterator.GetIndex();\n\/\/ cout << framePixelCnt << \" \" << idx[1] << \",\" << idx[0] << endl;\n }\n\n OFVector<FGBase*> groups;\n OFunique_ptr<FGPlanePosPatient> fgPlanePos(new FGPlanePosPatient);\n OFunique_ptr<FGFrameContent > fgFracon(new FGFrameContent);\n OFunique_ptr<FGRealWorldValueMapping> realWorldValueMappingFG(new FGRealWorldValueMapping());\n FGRealWorldValueMapping::RWVMItem* realWorldValueMappingItem = new FGRealWorldValueMapping::RWVMItem();\n if (!fgPlanePos || !fgFracon || !realWorldValueMappingFG || !realWorldValueMappingItem )\n {\n delete[] data;\n return EC_MemoryExhausted;\n }\n\n realWorldValueMappingItem->setRealWorldValueSlope(atof(metaInfo.getRealWorldValueSlope().c_str()));\n realWorldValueMappingItem->setRealWorldValueIntercept(atof(metaInfo.getRealWorldValueIntercept().c_str()));\n\n realWorldValueMappingItem->setRealWorldValueFirstValueMappeSigned(metaInfo.getFirstValueMapped());\n realWorldValueMappingItem->setRealWorldValueLastValueMappedSigned(metaInfo.getLastValueMapped());\n\n CodeSequenceMacro* measurementUnitCode = metaInfo.getMeasurementUnitsCode();\n if (measurementUnitCode != NULL) {\n realWorldValueMappingItem->getMeasurementUnitsCode().set(metaInfo.getCodeSequenceValue(measurementUnitCode).c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tmetaInfo.getCodeSequenceDesignator(measurementUnitCode).c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tmetaInfo.getCodeSequenceMeaning(measurementUnitCode).c_str());\n }\n\n \/\/ TODO: LutExplanation and LUTLabel should be added as Metainformation\n realWorldValueMappingItem->setLUTExplanation(\"We are mapping trash to junk.\");\n realWorldValueMappingItem->setLUTLabel(\"Just testing\");\n ContentItemMacro* quantity = new ContentItemMacro;\n CodeSequenceMacro* qCodeName = new CodeSequenceMacro(\"G-C1C6\", \"SRT\", \"Quantity\");\n CodeSequenceMacro* qSpec = new CodeSequenceMacro(\"110805\", \"SRT\", \"T2 Weighted MR Signal Intensity\");\n\n if (!quantity || !qSpec || !qCodeName)\n {\n delete[] data;\n return EC_MemoryExhausted;\n }\n\n quantity->getEntireConceptNameCodeSequence().push_back(qCodeName);\n quantity->getEntireConceptCodeSequence().push_back(qSpec);\n realWorldValueMappingItem->getEntireQuantityDefinitionSequence().push_back(quantity);\n quantity->setValueType(ContentItemMacro::VT_CODE);\n realWorldValueMappingFG->getRealWorldValueMapping().push_back(realWorldValueMappingItem);\n\n \/\/ Plane Position\n OFStringStream ss;\n ss << frameNo;\n OFSTRINGSTREAM_GETOFSTRING(ss, framestr) \/\/ convert number to string\n fgPlanePos->setImagePositionPatient(\"0\", \"0\", framestr);\n\n \/\/ Frame Content\n OFCondition result = fgFracon->setDimensionIndexValues(frameNo+1 \/* value within dimension *\/, 0 \/* first dimension *\/);\n\n \/\/ Add frame with related groups\n if (result.good())\n {\n groups.push_back(fgPlanePos.get());\n groups.push_back(fgFracon.get());\n groups.push_back(realWorldValueMappingFG.get());\n groups.push_back(fgPlanePos.get());\n result = map->addFrame(data, frameSize, groups);\n }\n delete[] data;\n return result;\n }\n}\n\n\n<commit_msg>ENH: using setter for setting DICOM values instead of using tags itself (issue #20)<commit_after>#include \"ParaMapConverter.h\"\n\n\nusing namespace std;\n\nnamespace dcmqi {\n\n int ParaMapConverter::itkimage2paramap(const string &inputFileName, const string &dicomImageFileName,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t const string &metaDataFileName, const string &outputFileName) {\n\n ReaderType::Pointer reader = ReaderType::New();\n reader->SetFileName(inputFileName.c_str());\n reader->Update();\n ImageType::Pointer parametricMapImage = reader->GetOutput();\n\n MinMaxCalculatorType::Pointer calculator = MinMaxCalculatorType::New();\n calculator->SetImage(parametricMapImage);\n calculator->Compute();\n\n JSONParametricMapMetaInformationHandler metaInfo(metaDataFileName);\n metaInfo.read();\n\n metaInfo.setFirstValueMapped(calculator->GetMinimum());\n metaInfo.setLastValueMapped(calculator->GetMaximum());\n\n IODEnhGeneralEquipmentModule::EquipmentInfo eq = getEnhEquipmentInfo();\n ContentIdentificationMacro contentID = createContentIdentificationInformation();\n CHECK_COND(contentID.setInstanceNumber(metaInfo.getInstanceNumber().c_str()));\n\n DcmDataset pMapDocDataset;\n DPMParametricMapFloat *pMapDoc = NULL;\n\n \/\/ TODO: following should maybe be moved to meta info\n OFString imageFlavor = \"VOLUME\";\n OFString pixContrast = \"MTT\";\n DPMTypes::ContentQualification contQual = DPMTypes::CQ_RESEARCH;\n OFString modality = \"MR\";\n\n ImageType::SizeType inputSize = parametricMapImage->GetBufferedRegion().GetSize();\n cout << \"Input image size: \" << inputSize << endl;\n\n CHECK_COND(DPMParametricMapFloat::create(pMapDoc, modality, metaInfo.getSeriesNumber().c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t metaInfo.getInstanceNumber().c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t inputSize[0], inputSize[1], eq, contentID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t imageFlavor, pixContrast, contQual));\n\n if (!dicomImageFileName.empty())\n CHECK_COND(pMapDoc->import(dicomImageFileName.c_str(), OFTrue, OFTrue, OFFalse, OFTrue));\n\n \/* Initialize dimension module *\/\n char dimUID[128];\n dcmGenerateUniqueIdentifier(dimUID, QIICR_UID_ROOT);\n IODMultiframeDimensionModule &mfdim = pMapDoc->getIODMultiframeDimensionModule();\n OFCondition result = mfdim.addDimensionIndex(DCM_ImagePositionPatient, dimUID,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t DCM_RealWorldValueMappingSequence, \"Frame position\");\n\n \/\/ Shared FGs: PixelMeasuresSequence\n {\n FGPixelMeasures *pixmsr = new FGPixelMeasures();\n\n ImageType::SpacingType labelSpacing = parametricMapImage->GetSpacing();\n ostringstream spacingSStream;\n spacingSStream << scientific << labelSpacing[0] << \"\\\\\" << labelSpacing[1];\n CHECK_COND(pixmsr->setPixelSpacing(spacingSStream.str().c_str()));\n\n spacingSStream.clear(); spacingSStream.str(\"\");\n spacingSStream << scientific << labelSpacing[2];\n CHECK_COND(pixmsr->setSpacingBetweenSlices(spacingSStream.str().c_str()));\n CHECK_COND(pixmsr->setSliceThickness(spacingSStream.str().c_str()));\n CHECK_COND(pMapDoc->addForAllFrames(*pixmsr));\n }\n\n \/\/ Shared FGs: PlaneOrientationPatientSequence\n {\n OFString imageOrientationPatientStr;\n\n ImageType::DirectionType labelDirMatrix = parametricMapImage->GetDirection();\n\n cout << \"Directions: \" << labelDirMatrix << endl;\n\n FGPlaneOrientationPatient *planor =\n FGPlaneOrientationPatient::createMinimal(\n Helper::floatToStrScientific(labelDirMatrix[0][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[1][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[2][0]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[0][1]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[1][1]).c_str(),\n Helper::floatToStrScientific(labelDirMatrix[2][1]).c_str());\n\n \/\/CHECK_COND(planor->setImageOrientationPatient(imageOrientationPatientStr));\n CHECK_COND(pMapDoc->addForAllFrames(*planor));\n }\n\n FGFrameAnatomy frameAnaFG;\n frameAnaFG.setLaterality(FGFrameAnatomy::LATERALITY_UNPAIRED);\n frameAnaFG.getAnatomy().getAnatomicRegion().set(\"T-A0100\", \"SRT\", \"Brain\");\n CHECK_COND(pMapDoc->addForAllFrames(frameAnaFG));\n\n FGIdentityPixelValueTransformation idTransFG;\n \/\/ Rescale Intercept, Rescale Slope, Rescale Type are missing here\n CHECK_COND(pMapDoc->addForAllFrames(idTransFG));\n\n FGParametricMapFrameType frameTypeFG;\n frameTypeFG.setFrameType(\"DERIVED\\\\PRIMARY\\\\VOLUME\\\\MTT\");\n CHECK_COND(pMapDoc->addForAllFrames(frameTypeFG));\n\n for (unsigned long f = 0; result.good() && (f < inputSize[2]); f++) {\n result = addFrame(pMapDoc, parametricMapImage, metaInfo, f);\n }\n\n {\n string bodyPartAssigned = metaInfo.getBodyPartExamined();\n if(!dicomImageFileName.empty() && bodyPartAssigned.empty()) {\n DcmFileFormat sliceFF;\n CHECK_COND(sliceFF.loadFile(dicomImageFileName.c_str()));\n OFString bodyPartStr;\n if(sliceFF.getDataset()->findAndGetOFString(DCM_BodyPartExamined, bodyPartStr).good()) {\n if (!bodyPartStr.empty())\n bodyPartAssigned = bodyPartStr.c_str();\n }\n }\n if(!bodyPartAssigned.empty())\n pMapDoc->getIODGeneralSeriesModule().setBodyPartExamined(bodyPartAssigned.c_str());\n }\n\n \/\/ SeriesDate\/Time should be of when parametric map was taken; initialize to when it was saved\n {\n OFString contentDate, contentTime;\n DcmDate::getCurrentDate(contentDate);\n DcmTime::getCurrentTime(contentTime);\n\n pMapDoc->getSeries().setSeriesDate(contentDate.c_str());\n pMapDoc->getSeries().setSeriesTime(contentTime.c_str());\n pMapDoc->getGeneralImage().setContentDate(contentDate.c_str());\n pMapDoc->getGeneralImage().setContentTime(contentTime.c_str());\n }\n pMapDoc->getSeries().setSeriesDescription(metaInfo.getSeriesDescription().c_str());\n pMapDoc->getSeries().setSeriesNumber(metaInfo.getSeriesNumber().c_str());\n\n CHECK_COND(pMapDoc->writeDataset(pMapDocDataset));\n CHECK_COND(pMapDoc->saveFile(outputFileName.c_str()));\n\n COUT << \"Saved parametric map as \" << outputFileName << endl;\n return EXIT_SUCCESS;\n }\n\n int ParaMapConverter::paramap2itkimage(const string &inputParamapFileName, const string &outputDirName) {\n return EXIT_SUCCESS;\n }\n\n OFCondition ParaMapConverter::addFrame(DPMParametricMapFloat *map, const ImageType::Pointer ¶metricMapImage,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t const JSONParametricMapMetaInformationHandler &metaInfo,\n const unsigned long frameNo)\n {\n ImageType::RegionType sliceRegion;\n ImageType::IndexType sliceIndex;\n ImageType::SizeType inputSize = parametricMapImage->GetBufferedRegion().GetSize();\n\n sliceIndex[0] = 0;\n sliceIndex[1] = 0;\n sliceIndex[2] = frameNo;\n\n inputSize[2] = 1;\n\n sliceRegion.SetIndex(sliceIndex);\n sliceRegion.SetSize(inputSize);\n\n const unsigned frameSize = inputSize[0] * inputSize[1];\n\n Float32 *data = new Float32[frameSize];\n\n if (data == NULL) {\n return EC_MemoryExhausted;\n }\n\n itk::ImageRegionConstIteratorWithIndex<ImageType> sliceIterator(parametricMapImage, sliceRegion);\n\n unsigned framePixelCnt = 0;\n for(sliceIterator.GoToBegin();!sliceIterator.IsAtEnd(); ++sliceIterator, ++framePixelCnt){\n data[framePixelCnt] = sliceIterator.Get();\n ImageType::IndexType idx = sliceIterator.GetIndex();\n\/\/ cout << framePixelCnt << \" \" << idx[1] << \",\" << idx[0] << endl;\n }\n\n OFVector<FGBase*> groups;\n OFunique_ptr<FGPlanePosPatient> fgPlanePos(new FGPlanePosPatient);\n OFunique_ptr<FGFrameContent > fgFracon(new FGFrameContent);\n OFunique_ptr<FGRealWorldValueMapping> realWorldValueMappingFG(new FGRealWorldValueMapping());\n FGRealWorldValueMapping::RWVMItem* realWorldValueMappingItem = new FGRealWorldValueMapping::RWVMItem();\n if (!fgPlanePos || !fgFracon || !realWorldValueMappingFG || !realWorldValueMappingItem )\n {\n delete[] data;\n return EC_MemoryExhausted;\n }\n\n realWorldValueMappingItem->setRealWorldValueSlope(atof(metaInfo.getRealWorldValueSlope().c_str()));\n realWorldValueMappingItem->setRealWorldValueIntercept(atof(metaInfo.getRealWorldValueIntercept().c_str()));\n\n realWorldValueMappingItem->setRealWorldValueFirstValueMappeSigned(metaInfo.getFirstValueMapped());\n realWorldValueMappingItem->setRealWorldValueLastValueMappedSigned(metaInfo.getLastValueMapped());\n\n CodeSequenceMacro* measurementUnitCode = metaInfo.getMeasurementUnitsCode();\n if (measurementUnitCode != NULL) {\n realWorldValueMappingItem->getMeasurementUnitsCode().set(metaInfo.getCodeSequenceValue(measurementUnitCode).c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tmetaInfo.getCodeSequenceDesignator(measurementUnitCode).c_str(),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tmetaInfo.getCodeSequenceMeaning(measurementUnitCode).c_str());\n }\n\n \/\/ TODO: LutExplanation and LUTLabel should be added as Metainformation\n realWorldValueMappingItem->setLUTExplanation(\"We are mapping trash to junk.\");\n realWorldValueMappingItem->setLUTLabel(\"Just testing\");\n ContentItemMacro* quantity = new ContentItemMacro;\n CodeSequenceMacro* qCodeName = new CodeSequenceMacro(\"G-C1C6\", \"SRT\", \"Quantity\");\n CodeSequenceMacro* qSpec = new CodeSequenceMacro(\"110805\", \"SRT\", \"T2 Weighted MR Signal Intensity\");\n\n if (!quantity || !qSpec || !qCodeName)\n {\n delete[] data;\n return EC_MemoryExhausted;\n }\n\n quantity->getEntireConceptNameCodeSequence().push_back(qCodeName);\n quantity->getEntireConceptCodeSequence().push_back(qSpec);\n realWorldValueMappingItem->getEntireQuantityDefinitionSequence().push_back(quantity);\n quantity->setValueType(ContentItemMacro::VT_CODE);\n realWorldValueMappingFG->getRealWorldValueMapping().push_back(realWorldValueMappingItem);\n\n \/\/ Plane Position\n OFStringStream ss;\n ss << frameNo;\n OFSTRINGSTREAM_GETOFSTRING(ss, framestr) \/\/ convert number to string\n fgPlanePos->setImagePositionPatient(\"0\", \"0\", framestr);\n\n \/\/ Frame Content\n OFCondition result = fgFracon->setDimensionIndexValues(frameNo+1 \/* value within dimension *\/, 0 \/* first dimension *\/);\n\n \/\/ Add frame with related groups\n if (result.good())\n {\n groups.push_back(fgPlanePos.get());\n groups.push_back(fgFracon.get());\n groups.push_back(realWorldValueMappingFG.get());\n groups.push_back(fgPlanePos.get());\n result = map->addFrame(data, frameSize, groups);\n }\n delete[] data;\n return result;\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2012, University of Erlangen-Nuremberg\n\/\/ Copyright (c) 2012, Siemens AG\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice, this\n\/\/ list of conditions and the following disclaimer.\n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n\/\/ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\/\/ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\/\/ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n\/\/ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n#include \"hipacc.hpp\"\n\n#include <iostream>\n#include <hipacc_helper.hpp>\n\n\n#define WIDTH 4032\n#define HEIGHT 3024\n#define IMAGE \"..\/..\/common\/img\/fuerte_ship.jpg\"\n\n\nusing namespace hipacc;\nusing namespace hipacc::math;\n\n\n\/\/ Kernel description in Hipacc\nclass ColorConversion : public Kernel<uchar> {\n private:\n Accessor<uchar4> ∈\n\n public:\n ColorConversion(IterationSpace<uchar> &iter, Accessor<uchar4> &acc)\n : Kernel(iter), in(acc) {\n add_accessor(&in);\n }\n\n void kernel() {\n uchar4 pixel = in();\n output() = .3f*pixel.x + .59f*pixel.y + .11f*pixel.z + .5f;\n }\n};\n\n\n\/\/ forward declaration of reference implementation\nvoid color_conversion(uchar4 *in, uchar *out, int width, int height);\n\n\n\/*************************************************************************\n * Main function *\n *************************************************************************\/\nint main(int argc, const char **argv) {\n const int width = WIDTH;\n const int height = HEIGHT;\n float timing = 0;\n\n \/\/ host memory for image of width x height pixels\n uchar4 *input = (uchar4*)load_data<uchar>(width, height, 4, IMAGE);\n uchar *ref_out = new uchar[width*height];\n\n std::cout << \"Calculating Hipacc color conversion ...\" << std::endl;\n\n \/\/************************************************************************\/\/\n\n \/\/ input and output image of width x height pixels\n Image<uchar4> in(width, height, input);\n Image<uchar> out(width, height);\n\n Accessor<uchar4> acc(in);\n\n IterationSpace<uchar> iter(out);\n ColorConversion filter(iter, acc);\n\n filter.execute();\n timing = hipacc_last_kernel_timing();\n\n \/\/ get pointer to result data\n uchar *output = out.data();\n\n \/\/************************************************************************\/\/\n\n std::cout << \"Hipacc: \" << timing << \" ms, \"\n << (width*height\/timing)\/1000 << \" Mpixel\/s\" << std::endl;\n\n std::cout << \"Calculating reference ...\" << std::endl;\n double start = time_ms();\n color_conversion(input, ref_out, width, height);\n double end = time_ms();\n std::cout << \"Reference: \" << end-start << \" ms, \"\n << (width*height\/(end-start))\/1000 << \" Mpixel\/s\" << std::endl;\n\n compare_results(output, ref_out, width, height);\n\n save_data(width, height, 4, input, \"input.jpg\");\n save_data(width, height, 1, output, \"output.jpg\");\n show_data(width, height, 1, output, \"output.jpg\");\n\n \/\/ free memory\n delete[] input;\n delete[] ref_out;\n\n return EXIT_SUCCESS;\n}\n\n\n\/\/ color conversion reference\nvoid color_conversion(uchar4 *in, uchar *out, int width, int height) {\n for (int p = 0; p < width*height; ++p) {\n uchar4 pixel = in[p];\n out[p] = .3f*pixel.x + .59f*pixel.y + .11f*pixel.z + .5f;\n }\n}\n<commit_msg>Fixed visuals for color conversion sample<commit_after>\/\/\n\/\/ Copyright (c) 2012, University of Erlangen-Nuremberg\n\/\/ Copyright (c) 2012, Siemens AG\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice, this\n\/\/ list of conditions and the following disclaimer.\n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n\/\/ ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n\/\/ WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n\/\/ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n\/\/ ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n\/\/ ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n\/\/ SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\n#include \"hipacc.hpp\"\n\n#include <iostream>\n#include <hipacc_helper.hpp>\n\n\n#define WIDTH 4032\n#define HEIGHT 3024\n#define IMAGE \"..\/..\/common\/img\/fuerte_ship.jpg\"\n\n\nusing namespace hipacc;\nusing namespace hipacc::math;\n\n\n\/\/ Kernel description in Hipacc\nclass ColorConversion : public Kernel<uchar> {\n private:\n Accessor<uchar4> ∈\n\n public:\n ColorConversion(IterationSpace<uchar> &iter, Accessor<uchar4> &acc)\n : Kernel(iter), in(acc) {\n add_accessor(&in);\n }\n\n void kernel() {\n uchar4 pixel = in();\n output() = .3f*pixel.x + .59f*pixel.y + .11f*pixel.z + .5f;\n }\n};\n\n\n\/\/ forward declaration of reference implementation\nvoid color_conversion(uchar4 *in, uchar *out, int width, int height);\n\n\n\/*************************************************************************\n * Main function *\n *************************************************************************\/\nint main(int argc, const char **argv) {\n const int width = WIDTH;\n const int height = HEIGHT;\n float timing = 0;\n\n \/\/ host memory for image of width x height pixels\n uchar4 *input = (uchar4*)load_data<uchar>(width, height, 4, IMAGE);\n uchar *ref_out = new uchar[width*height];\n\n std::cout << \"Calculating Hipacc color conversion ...\" << std::endl;\n\n \/\/************************************************************************\/\/\n\n \/\/ input and output image of width x height pixels\n Image<uchar4> in(width, height, input);\n Image<uchar> out(width, height);\n\n Accessor<uchar4> acc(in);\n\n IterationSpace<uchar> iter(out);\n ColorConversion filter(iter, acc);\n\n filter.execute();\n timing = hipacc_last_kernel_timing();\n\n \/\/ get pointer to result data\n uchar *output = out.data();\n\n \/\/************************************************************************\/\/\n\n std::cout << \"Hipacc: \" << timing << \" ms, \"\n << (width*height\/timing)\/1000 << \" Mpixel\/s\" << std::endl;\n\n std::cout << \"Calculating reference ...\" << std::endl;\n double start = time_ms();\n color_conversion(input, ref_out, width, height);\n double end = time_ms();\n std::cout << \"Reference: \" << end-start << \" ms, \"\n << (width*height\/(end-start))\/1000 << \" Mpixel\/s\" << std::endl;\n\n compare_results(output, ref_out, width, height);\n\n save_data(width, height, 4, (uchar*)input, \"input.jpg\");\n save_data(width, height, 1, output, \"output.jpg\");\n show_data(width, height, 1, output, \"output.jpg\");\n\n \/\/ free memory\n delete[] input;\n delete[] ref_out;\n\n return EXIT_SUCCESS;\n}\n\n\n\/\/ color conversion reference\nvoid color_conversion(uchar4 *in, uchar *out, int width, int height) {\n for (int p = 0; p < width*height; ++p) {\n uchar4 pixel = in[p];\n out[p] = .3f*pixel.x + .59f*pixel.y + .11f*pixel.z + .5f;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file HoughCircle_Demo.cpp\n * @brief Demo code for Hough Transform\n * @author OpenCV team\n *\/\n\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n\nusing namespace cv;\n\nnamespace\n{\n \/\/ windows and trackbars name\n const std::string windowName = \"Hough Circle Detection Demo\";\n const std::string cannyThresholdTrackbarName = \"Canny threshold\";\n const std::string accumulatorThresholdTrackbarName = \"Accumulator Threshold\";\n\n \/\/ initial and max values of the parameters of interests.\n const int cannyThresholdInitialValue = 200;\n const int accumulatorThresholdInitialValue = 50;\n const int maxAccumulatorThreshold = 200;\n const int maxCannyThreshold = 255;\n\n void HoughDetection(const Mat& src_gray, const Mat& src_display, int cannyThreshold, int accumulatorThreshold)\n {\n \/\/ will hold the results of the detection\n std::vector<Vec3f> circles;\n \/\/ runs the actual detection\n HoughCircles( src_gray, circles, HOUGH_GRADIENT, 1, src_gray.rows\/8, cannyThreshold, accumulatorThreshold, 0, 0 );\n\n \/\/ clone the colour, input image for displaying purposes\n Mat display = src_display.clone();\n for( size_t i = 0; i < circles.size(); i++ )\n {\n Point center(cvRound(circles[i][0]), cvRound(circles[i][1]));\n int radius = cvRound(circles[i][2]);\n \/\/ circle center\n circle( display, center, 3, Scalar(0,255,0), -1, 8, 0 );\n \/\/ circle outline\n circle( display, center, radius, Scalar(0,0,255), 3, 8, 0 );\n }\n\n \/\/ shows the results\n imshow( windowName, display);\n }\n}\n\n\nint main(int, char** argv)\n{\n Mat src, src_gray;\n\n \/\/ Read the image\n src = imread( argv[1], 1 );\n\n if( !src.data )\n { return -1; }\n\n \/\/ Convert it to gray\n cvtColor( src, src_gray, COLOR_BGR2GRAY );\n\n \/\/ Reduce the noise so we avoid false circle detection\n GaussianBlur( src_gray, src_gray, Size(9, 9), 2, 2 );\n\n \/\/declare and initialize both parameters that are subjects to change\n int cannyThreshold = cannyThresholdInitialValue;\n int accumulatorThreshold = accumulatorThresholdInitialValue;\n\n \/\/ create the main window, and attach the trackbars\n namedWindow( windowName, WINDOW_AUTOSIZE );\n createTrackbar(cannyThresholdTrackbarName, windowName, &cannyThreshold,maxCannyThreshold);\n createTrackbar(accumulatorThresholdTrackbarName, windowName, &accumulatorThreshold, maxAccumulatorThreshold);\n\n \/\/ inifinite loop to display\n \/\/ and refresh the content of the output image\n \/\/ unti the user presses q or Q\n int key = 0;\n while(key != 'q' && key != 'Q')\n {\n \/\/ those paramaters cannot be =0\n \/\/ so we must check here\n cannyThreshold = std::max(cannyThreshold, 1);\n accumulatorThreshold = std::max(accumulatorThreshold, 1);\n\n \/\/runs the detection, and update the display\n HoughDetection(src_gray, src, cannyThreshold, accumulatorThreshold);\n\n \/\/ get user key\n key = waitKey(10);\n }\n\n return 0;\n}\n<commit_msg>improved error handling<commit_after>\/**\n * @file HoughCircle_Demo.cpp\n * @brief Demo code for Hough Transform\n * @author OpenCV team\n *\/\n\n#include \"opencv2\/highgui\/highgui.hpp\"\n#include \"opencv2\/imgproc\/imgproc.hpp\"\n#include <iostream>\n\nusing namespace cv;\n\nnamespace\n{\n \/\/ windows and trackbars name\n const std::string windowName = \"Hough Circle Detection Demo\";\n const std::string cannyThresholdTrackbarName = \"Canny threshold\";\n const std::string accumulatorThresholdTrackbarName = \"Accumulator Threshold\";\n\n \/\/ initial and max values of the parameters of interests.\n const int cannyThresholdInitialValue = 200;\n const int accumulatorThresholdInitialValue = 50;\n const int maxAccumulatorThreshold = 200;\n const int maxCannyThreshold = 255;\n\n void HoughDetection(const Mat& src_gray, const Mat& src_display, int cannyThreshold, int accumulatorThreshold)\n {\n \/\/ will hold the results of the detection\n std::vector<Vec3f> circles;\n \/\/ runs the actual detection\n HoughCircles( src_gray, circles, HOUGH_GRADIENT, 1, src_gray.rows\/8, cannyThreshold, accumulatorThreshold, 0, 0 );\n\n \/\/ clone the colour, input image for displaying purposes\n Mat display = src_display.clone();\n for( size_t i = 0; i < circles.size(); i++ )\n {\n Point center(cvRound(circles[i][0]), cvRound(circles[i][1]));\n int radius = cvRound(circles[i][2]);\n \/\/ circle center\n circle( display, center, 3, Scalar(0,255,0), -1, 8, 0 );\n \/\/ circle outline\n circle( display, center, radius, Scalar(0,0,255), 3, 8, 0 );\n }\n\n \/\/ shows the results\n imshow( windowName, display);\n }\n}\n\n\nint main(int, char** argv)\n{\n Mat src, src_gray;\n\n \/\/ Read the image\n src = imread( argv[1], 1 );\n\n if( !src.data )\n {\n std::cerr<<\"Invalid input image\\n\";\n std::cout<<\"Usage : tutorial_HoughCircle_Demo <path_to_input_image>\\n\";\n return -1;\n }\n\n \/\/ Convert it to gray\n cvtColor( src, src_gray, COLOR_BGR2GRAY );\n\n \/\/ Reduce the noise so we avoid false circle detection\n GaussianBlur( src_gray, src_gray, Size(9, 9), 2, 2 );\n\n \/\/declare and initialize both parameters that are subjects to change\n int cannyThreshold = cannyThresholdInitialValue;\n int accumulatorThreshold = accumulatorThresholdInitialValue;\n\n \/\/ create the main window, and attach the trackbars\n namedWindow( windowName, WINDOW_AUTOSIZE );\n createTrackbar(cannyThresholdTrackbarName, windowName, &cannyThreshold,maxCannyThreshold);\n createTrackbar(accumulatorThresholdTrackbarName, windowName, &accumulatorThreshold, maxAccumulatorThreshold);\n\n \/\/ inifinite loop to display\n \/\/ and refresh the content of the output image\n \/\/ unti the user presses q or Q\n int key = 0;\n while(key != 'q' && key != 'Q')\n {\n \/\/ those paramaters cannot be =0\n \/\/ so we must check here\n cannyThreshold = std::max(cannyThreshold, 1);\n accumulatorThreshold = std::max(accumulatorThreshold, 1);\n\n \/\/runs the detection, and update the display\n HoughDetection(src_gray, src, cannyThreshold, accumulatorThreshold);\n\n \/\/ get user key\n key = waitKey(10);\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ghost\/config.h\"\n#include \"ghost\/types.h\"\n#include \"ghost\/densemat.h\"\n#include \"ghost\/util.h\"\n#include \"ghost\/math.h\"\n#include \"ghost\/tsmm.h\"\n#include \"ghost\/tsmm_gen.h\"\n#include \"ghost\/tsmm_avx_gen.h\"\n#include \"ghost\/tsmm_sse_gen.h\"\n\n#include <map>\n\nusing namespace std;\n\nstatic bool operator<(const ghost_tsmm_parameters_t &a, const ghost_tsmm_parameters_t &b) \n{ \n return ghost_hash(a.dt,a.xcols,ghost_hash(a.vcols,a.impl,0)) < ghost_hash(b.dt,b.xcols,ghost_hash(b.vcols,b.impl,0)); \n}\n\nstatic map<ghost_tsmm_parameters_t, ghost_tsmm_kernel_t> ghost_tsmm_kernels;\n\nghost_error_t ghost_tsmm_valid(ghost_densemat_t *x, ghost_densemat_t *v, const char * transv, \nghost_densemat_t *w, const char *transw, void *alpha, void *beta, int reduce, int printerror)\n{\n if (x->traits.datatype != v->traits.datatype || x->traits.datatype != w->traits.datatype) {\n if (printerror) {\n ERROR_LOG(\"Different data types!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (x == v) {\n if (printerror) {\n ERROR_LOG(\"x must not be equal to v!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n\n if (w->traits.storage != GHOST_DENSEMAT_COLMAJOR) {\n if (printerror) {\n ERROR_LOG(\"w must be stored col-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (x->traits.storage != GHOST_DENSEMAT_ROWMAJOR) {\n if (printerror) {\n ERROR_LOG(\"x must be stored row-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (v->traits.storage != GHOST_DENSEMAT_ROWMAJOR) {\n if (printerror) {\n ERROR_LOG(\"v must be stored row-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if ((x->traits.flags & GHOST_DENSEMAT_SCATTERED) || (v->traits.flags & GHOST_DENSEMAT_SCATTERED) || (w->traits.flags & GHOST_DENSEMAT_SCATTERED)) {\n if (printerror) {\n ERROR_LOG(\"Scattered views not supported!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (reduce != GHOST_GEMM_NO_REDUCE) { \n if (printerror) {\n ERROR_LOG(\"Only NO_REDUCE valid!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (strncasecmp(transv,\"N\",1)) {\n if (printerror) {\n ERROR_LOG(\"v must not be transposed!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (strncasecmp(transw,\"N\",1)) {\n if (printerror) {\n ERROR_LOG(\"w must not be transposed!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n\n UNUSED(alpha);\n UNUSED(beta);\n\n return GHOST_SUCCESS;\n} \n\n\nghost_error_t ghost_tsmm(ghost_densemat_t *x, ghost_densemat_t *v, ghost_densemat_t *w, void *alpha, void *beta)\n{\n GHOST_FUNC_ENTER(GHOST_FUNCTYPE_MATH);\n ghost_error_t ret;\n\n if ((ret = ghost_tsmm_valid(x,v,\"N\",w,\"N\",alpha,beta,GHOST_GEMM_NO_REDUCE,1)) != GHOST_SUCCESS) {\n return ret;\n }\n \n if (ghost_tsmm_kernels.empty()) {\n#include \"tsmm.def\"\n#include \"tsmm_avx.def\"\n#include \"tsmm_sse.def\"\n }\n\n ghost_tsmm_parameters_t p;\n ghost_tsmm_kernel_t kernel = NULL;\n#ifdef GHOST_HAVE_MIC\n p.impl = GHOST_IMPLEMENTATION_MIC;\n#elif defined(GHOST_HAVE_AVX)\n p.impl = GHOST_IMPLEMENTATION_AVX;\n#elif defined(GHOST_HAVE_SSE)\n p.impl = GHOST_IMPLEMENTATION_SSE;\n#else\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n#endif\n\n p.alignment = GHOST_ALIGNED;\n p.dt = x->traits.datatype;\n \n p.xcols = x->traits.ncols;\n p.vcols = v->traits.ncols;\n if (p.xcols == 2) {\n#ifdef GHOST_HAVE_SSE\n PERFWARNING_LOG(\"Use SSE for ncols==2\");\n p.impl = GHOST_IMPLEMENTATION_SSE;\n#endif\n }\n if (p.xcols == 1) {\n PERFWARNING_LOG(\"Use plain for ncols==1\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n }\n if (p.xcols % 4 || p.vcols % 4) {\n PERFWARNING_LOG(\"Use plain for non-multiple of four\");\n p.impl = GHOST_IMPLEMENTATION_SSE;\n }\n if (p.xcols % 2 || p.vcols % 2) {\n PERFWARNING_LOG(\"Use plain for non-even column count\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n }\n\n void *xptr, *vptr, *wptr;\n ghost_densemat_valptr(x,&xptr);\n ghost_densemat_valptr(v,&vptr);\n ghost_densemat_valptr(w,&wptr);\n\n if (p.impl == GHOST_IMPLEMENTATION_SSE) {\n if (!IS_ALIGNED(xptr,16) || !IS_ALIGNED(vptr,16) || !IS_ALIGNED(wptr,16)) {\n p.alignment = GHOST_UNALIGNED;\n }\n }\n if (p.impl == GHOST_IMPLEMENTATION_AVX) {\n if (!IS_ALIGNED(xptr,32) || !IS_ALIGNED(vptr,32) || !IS_ALIGNED(wptr,32)) {\n p.alignment = GHOST_UNALIGNED;\n }\n }\n kernel = ghost_tsmm_kernels[p];\n \n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed xcols and arbitrary vcols\");\n p.xcols = x->traits.ncols;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed vcols and arbitrary xcols\");\n p.xcols = -1;\n p.vcols = v->traits.ncols;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with arbitrary block sizes\");\n p.xcols = -1;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try plain implementation\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n INFO_LOG(\"Could not find TSMM kernel with %d %d %d %d!\",p.impl,p.dt,p.xcols,p.vcols);\n return GHOST_ERR_NOT_IMPLEMENTED;\n }\n\n ret = kernel(x,v,w,alpha,beta);\n \n#ifdef GHOST_HAVE_INSTR_TIMING\n ghost_gemm_perf_args_t tsmm_perfargs;\n tsmm_perfargs.xcols = p.xcols;\n tsmm_perfargs.vcols = p.vcols;\n tsmm_perfargs.vrows = v->context->gnrows;\n tsmm_perfargs.dt = x->traits.datatype;\n ghost_timing_set_perfFunc(__ghost_functag,ghost_tsmm_perf_GBs,(void *)&tsmm_perfargs,sizeof(tsmm_perfargs),\"GB\/s\");\n ghost_timing_set_perfFunc(__ghost_functag,ghost_gemm_perf_GFs,(void *)&tsmm_perfargs,sizeof(tsmm_perfargs),\"GF\/s\");\n#endif\n\n GHOST_FUNC_EXIT(GHOST_FUNCTYPE_MATH);\n\n return ret;\n}\n\nint ghost_tsmm_perf_GBs(double *perf, double time, void *varg)\n{\n size_t size;\n ghost_gemm_perf_args_t arg = *(ghost_gemm_perf_args_t *)varg;\n \n ghost_datatype_size(&size,arg.dt);\n\n *perf = size*(arg.vrows*arg.vcols+arg.vrows*arg.xcols+arg.vcols*arg.xcols)\/1.e9\/time;\n\n return 0;\n}\n\n<commit_msg>try fixed block sizes again after fallback to plain implementation<commit_after>#include \"ghost\/config.h\"\n#include \"ghost\/types.h\"\n#include \"ghost\/densemat.h\"\n#include \"ghost\/util.h\"\n#include \"ghost\/math.h\"\n#include \"ghost\/tsmm.h\"\n#include \"ghost\/tsmm_gen.h\"\n#include \"ghost\/tsmm_avx_gen.h\"\n#include \"ghost\/tsmm_sse_gen.h\"\n\n#include <map>\n\nusing namespace std;\n\nstatic bool operator<(const ghost_tsmm_parameters_t &a, const ghost_tsmm_parameters_t &b) \n{ \n return ghost_hash(a.dt,a.xcols,ghost_hash(a.vcols,a.impl,0)) < ghost_hash(b.dt,b.xcols,ghost_hash(b.vcols,b.impl,0)); \n}\n\nstatic map<ghost_tsmm_parameters_t, ghost_tsmm_kernel_t> ghost_tsmm_kernels;\n\nghost_error_t ghost_tsmm_valid(ghost_densemat_t *x, ghost_densemat_t *v, const char * transv, \nghost_densemat_t *w, const char *transw, void *alpha, void *beta, int reduce, int printerror)\n{\n if (x->traits.datatype != v->traits.datatype || x->traits.datatype != w->traits.datatype) {\n if (printerror) {\n ERROR_LOG(\"Different data types!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (x == v) {\n if (printerror) {\n ERROR_LOG(\"x must not be equal to v!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n\n if (w->traits.storage != GHOST_DENSEMAT_COLMAJOR) {\n if (printerror) {\n ERROR_LOG(\"w must be stored col-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (x->traits.storage != GHOST_DENSEMAT_ROWMAJOR) {\n if (printerror) {\n ERROR_LOG(\"x must be stored row-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (v->traits.storage != GHOST_DENSEMAT_ROWMAJOR) {\n if (printerror) {\n ERROR_LOG(\"v must be stored row-major!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if ((x->traits.flags & GHOST_DENSEMAT_SCATTERED) || (v->traits.flags & GHOST_DENSEMAT_SCATTERED) || (w->traits.flags & GHOST_DENSEMAT_SCATTERED)) {\n if (printerror) {\n ERROR_LOG(\"Scattered views not supported!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (reduce != GHOST_GEMM_NO_REDUCE) { \n if (printerror) {\n ERROR_LOG(\"Only NO_REDUCE valid!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (strncasecmp(transv,\"N\",1)) {\n if (printerror) {\n ERROR_LOG(\"v must not be transposed!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n if (strncasecmp(transw,\"N\",1)) {\n if (printerror) {\n ERROR_LOG(\"w must not be transposed!\");\n }\n return GHOST_ERR_INVALID_ARG;\n }\n\n UNUSED(alpha);\n UNUSED(beta);\n\n return GHOST_SUCCESS;\n} \n\n\nghost_error_t ghost_tsmm(ghost_densemat_t *x, ghost_densemat_t *v, ghost_densemat_t *w, void *alpha, void *beta)\n{\n GHOST_FUNC_ENTER(GHOST_FUNCTYPE_MATH);\n ghost_error_t ret;\n\n if ((ret = ghost_tsmm_valid(x,v,\"N\",w,\"N\",alpha,beta,GHOST_GEMM_NO_REDUCE,1)) != GHOST_SUCCESS) {\n return ret;\n }\n \n if (ghost_tsmm_kernels.empty()) {\n#include \"tsmm.def\"\n#include \"tsmm_avx.def\"\n#include \"tsmm_sse.def\"\n }\n\n ghost_tsmm_parameters_t p;\n ghost_tsmm_kernel_t kernel = NULL;\n#ifdef GHOST_HAVE_MIC\n p.impl = GHOST_IMPLEMENTATION_MIC;\n#elif defined(GHOST_HAVE_AVX)\n p.impl = GHOST_IMPLEMENTATION_AVX;\n#elif defined(GHOST_HAVE_SSE)\n p.impl = GHOST_IMPLEMENTATION_SSE;\n#else\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n#endif\n\n p.alignment = GHOST_ALIGNED;\n p.dt = x->traits.datatype;\n \n p.xcols = x->traits.ncols;\n p.vcols = v->traits.ncols;\n if (p.xcols == 2) {\n#ifdef GHOST_HAVE_SSE\n PERFWARNING_LOG(\"Use SSE for ncols==2\");\n p.impl = GHOST_IMPLEMENTATION_SSE;\n#endif\n }\n if (p.xcols == 1) {\n PERFWARNING_LOG(\"Use plain for ncols==1\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n }\n if (p.xcols % 4 || p.vcols % 4) {\n PERFWARNING_LOG(\"Use plain for non-multiple of four\");\n p.impl = GHOST_IMPLEMENTATION_SSE;\n }\n if (p.xcols % 2 || p.vcols % 2) {\n PERFWARNING_LOG(\"Use plain for non-even column count\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n }\n\n void *xptr, *vptr, *wptr;\n ghost_densemat_valptr(x,&xptr);\n ghost_densemat_valptr(v,&vptr);\n ghost_densemat_valptr(w,&wptr);\n\n if (p.impl == GHOST_IMPLEMENTATION_SSE) {\n if (!IS_ALIGNED(xptr,16) || !IS_ALIGNED(vptr,16) || !IS_ALIGNED(wptr,16)) {\n p.alignment = GHOST_UNALIGNED;\n }\n }\n if (p.impl == GHOST_IMPLEMENTATION_AVX) {\n if (!IS_ALIGNED(xptr,32) || !IS_ALIGNED(vptr,32) || !IS_ALIGNED(wptr,32)) {\n p.alignment = GHOST_UNALIGNED;\n }\n }\n kernel = ghost_tsmm_kernels[p];\n \n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed xcols and arbitrary vcols\");\n p.xcols = x->traits.ncols;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed vcols and arbitrary xcols\");\n p.xcols = -1;\n p.vcols = v->traits.ncols;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with arbitrary block sizes\");\n p.xcols = -1;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try plain implementation\");\n p.impl = GHOST_IMPLEMENTATION_PLAIN;\n p.xcols = x->traits.ncols;\n p.vcols = v->traits.ncols;\n kernel = ghost_tsmm_kernels[p];\n }\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed xcols and arbitrary vcols\");\n p.xcols = x->traits.ncols;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with fixed vcols and arbitrary xcols\");\n p.xcols = -1;\n p.vcols = v->traits.ncols;\n kernel = ghost_tsmm_kernels[p];\n }\n\n if (!kernel) {\n PERFWARNING_LOG(\"Try kernel with arbitrary block sizes\");\n p.xcols = -1;\n p.vcols = -1;\n kernel = ghost_tsmm_kernels[p];\n }\n\n\n if (!kernel) {\n INFO_LOG(\"Could not find TSMM kernel with %d %d %d %d!\",p.impl,p.dt,p.xcols,p.vcols);\n return GHOST_ERR_NOT_IMPLEMENTED;\n }\n\n ret = kernel(x,v,w,alpha,beta);\n \n#ifdef GHOST_HAVE_INSTR_TIMING\n ghost_gemm_perf_args_t tsmm_perfargs;\n tsmm_perfargs.xcols = p.xcols;\n tsmm_perfargs.vcols = p.vcols;\n tsmm_perfargs.vrows = v->context->gnrows;\n tsmm_perfargs.dt = x->traits.datatype;\n ghost_timing_set_perfFunc(__ghost_functag,ghost_tsmm_perf_GBs,(void *)&tsmm_perfargs,sizeof(tsmm_perfargs),\"GB\/s\");\n ghost_timing_set_perfFunc(__ghost_functag,ghost_gemm_perf_GFs,(void *)&tsmm_perfargs,sizeof(tsmm_perfargs),\"GF\/s\");\n#endif\n\n GHOST_FUNC_EXIT(GHOST_FUNCTYPE_MATH);\n\n return ret;\n}\n\nint ghost_tsmm_perf_GBs(double *perf, double time, void *varg)\n{\n size_t size;\n ghost_gemm_perf_args_t arg = *(ghost_gemm_perf_args_t *)varg;\n \n ghost_datatype_size(&size,arg.dt);\n\n *perf = size*(arg.vrows*arg.vcols+arg.vrows*arg.xcols+arg.vcols*arg.xcols)\/1.e9\/time;\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2021 Dominik Charousset *\n * *\n * Distributed under the terms and conditions of the BSD 3-Clause License or *\n * (at your option) under the terms and conditions of the Boost Software *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *\n * *\n * If you did not receive a copy of the license files, see *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt. *\n ******************************************************************************\/\n\n#define CAF_SUITE detail.private_thread_pool\n\n#include \"caf\/detail\/private_thread_pool.hpp\"\n\n#include \"core-test.hpp\"\n\n#include \"caf\/detail\/private_thread.hpp\"\n\nusing namespace caf;\n\nCAF_TEST_FIXTURE_SCOPE(private_thread_pool_tests, test_coordinator_fixture<>)\n\nSCENARIO(\"private threads count towards detached actors\") {\n GIVEN(\"an actor system with a private thread pool\") {\n detail::private_thread* t1 = nullptr;\n detail::private_thread* t2 = nullptr;\n WHEN(\"acquiring new private threads\") {\n THEN(\"the detached_actors counter increases\") {\n CHECK_EQ(sys.detached_actors(), 0u);\n t1 = sys.acquire_private_thread();\n CHECK_EQ(sys.detached_actors(), 1u);\n t2 = sys.acquire_private_thread();\n CHECK_EQ(sys.detached_actors(), 2u);\n }\n }\n WHEN(\"releasing the private threads\") {\n THEN(\"the detached_actors counter eventually decreases again\") {\n auto next_value = [this, old_value{2u}]() mutable {\n using namespace std::literals::chrono_literals;\n size_t result = 0;\n while ((result = sys.detached_actors()) == old_value)\n std::this_thread::sleep_for(1ms);\n old_value = result;\n return result;\n };\n sys.release_private_thread(t2);\n CHECK_EQ(next_value(), 1u);\n sys.release_private_thread(t1);\n CHECK_EQ(next_value(), 0u);\n }\n }\n }\n}\n\nSCENARIO(\"private threads rerun their resumable when it returns resume_later\") {\n struct testee : resumable {\n std::atomic<size_t> runs = 0;\n std::atomic<size_t> refs_added = 0;\n std::atomic<size_t> refs_released = 0;\n subtype_t subtype() const override {\n return resumable::function_object;\n }\n resume_result resume(execution_unit*, size_t) override {\n return ++runs < 2 ? resumable::resume_later : resumable::done;\n }\n void intrusive_ptr_add_ref_impl() override {\n ++refs_added;\n }\n void intrusive_ptr_release_impl() override {\n ++refs_released;\n }\n };\n GIVEN(\"a resumable f and a private thread t\") {\n testee f;\n auto t = sys.acquire_private_thread();\n WHEN(\"when resuming f with t\") {\n t->resume(&f);\n THEN(\"t calls resume until f returns something other than resume_later\") {\n using namespace std::literals::chrono_literals;\n sys.release_private_thread(t);\n while (sys.detached_actors() != 0)\n std::this_thread::sleep_for(1ms);\n CHECK_EQ(f.runs, 2u);\n CHECK_EQ(f.refs_added, 0u);\n CHECK_EQ(f.refs_released, 1u);\n }\n }\n }\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\n<commit_msg>Fix race in private_thread_pool unit test<commit_after>\/******************************************************************************\n * ____ _ _____ *\n * \/ ___| \/ \\ | ___| C++ *\n * | | \/ _ \\ | |_ Actor *\n * | |___ \/ ___ \\| _| Framework *\n * \\____\/_\/ \\_|_| *\n * *\n * Copyright 2011-2021 Dominik Charousset *\n * *\n * Distributed under the terms and conditions of the BSD 3-Clause License or *\n * (at your option) under the terms and conditions of the Boost Software *\n * License 1.0. See accompanying files LICENSE and LICENSE_ALTERNATIVE. *\n * *\n * If you did not receive a copy of the license files, see *\n * http:\/\/opensource.org\/licenses\/BSD-3-Clause and *\n * http:\/\/www.boost.org\/LICENSE_1_0.txt. *\n ******************************************************************************\/\n\n#define CAF_SUITE detail.private_thread_pool\n\n#include \"caf\/detail\/private_thread_pool.hpp\"\n\n#include \"core-test.hpp\"\n\n#include \"caf\/detail\/private_thread.hpp\"\n\nusing namespace caf;\n\nCAF_TEST_FIXTURE_SCOPE(private_thread_pool_tests, test_coordinator_fixture<>)\n\nSCENARIO(\"private threads count towards detached actors\") {\n GIVEN(\"an actor system with a private thread pool\") {\n detail::private_thread* t1 = nullptr;\n detail::private_thread* t2 = nullptr;\n WHEN(\"acquiring new private threads\") {\n THEN(\"the detached_actors counter increases\") {\n CHECK_EQ(sys.detached_actors(), 0u);\n t1 = sys.acquire_private_thread();\n CHECK_EQ(sys.detached_actors(), 1u);\n t2 = sys.acquire_private_thread();\n CHECK_EQ(sys.detached_actors(), 2u);\n }\n }\n WHEN(\"releasing the private threads\") {\n THEN(\"the detached_actors counter eventually decreases again\") {\n auto next_value = [this, old_value{2u}]() mutable {\n using namespace std::literals::chrono_literals;\n size_t result = 0;\n while ((result = sys.detached_actors()) == old_value)\n std::this_thread::sleep_for(1ms);\n old_value = result;\n return result;\n };\n sys.release_private_thread(t2);\n CHECK_EQ(next_value(), 1u);\n sys.release_private_thread(t1);\n CHECK_EQ(next_value(), 0u);\n }\n }\n }\n}\n\nSCENARIO(\"private threads rerun their resumable when it returns resume_later\") {\n struct testee : resumable {\n std::atomic<size_t> runs = 0;\n std::atomic<size_t> refs_added = 0;\n std::atomic<size_t> refs_released = 0;\n subtype_t subtype() const override {\n return resumable::function_object;\n }\n resume_result resume(execution_unit*, size_t) override {\n return ++runs < 2 ? resumable::resume_later : resumable::done;\n }\n void intrusive_ptr_add_ref_impl() override {\n ++refs_added;\n }\n void intrusive_ptr_release_impl() override {\n ++refs_released;\n }\n };\n GIVEN(\"a resumable f and a private thread t\") {\n testee f;\n auto t = sys.acquire_private_thread();\n WHEN(\"when resuming f with t\") {\n t->resume(&f);\n THEN(\"t calls resume until f returns something other than resume_later\") {\n using namespace std::literals::chrono_literals;\n sys.release_private_thread(t);\n while (f.runs != 2u)\n std::this_thread::sleep_for(1ms);\n while (sys.detached_actors() != 0)\n std::this_thread::sleep_for(1ms);\n CHECK_EQ(f.refs_added, 0u);\n CHECK_EQ(f.refs_released, 1u);\n }\n }\n }\n}\n\nCAF_TEST_FIXTURE_SCOPE_END()\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ReciprocalConn.cpp\n *\n * For two connections with transpose geometries (the pre of one has the\n * same geometry as the post of another and vice versa). They are not\n * forced to be each other's transpose, but there is a penalty term\n * on the L2 norm of the difference between it and its reciprocal's\n * transpose, of the amount\n * r\/2 * || W\/f_W - (W_recip)'\/f_{W_recip} ||^2.\n *\n * r is the parameter reciprocalFidelityCoeff\n * W is the weights and W_recip is the weights of the reciprocal connection\n * f_W and f_{W_recip} are the number of features of each connection.\n *\n * The connection forces the normalization method to be that for each feature,\n * the sum across kernels (number of features of reciprocal connection) is unity.\n *\n * Dividing by f_W and f_{W_recip} therefore makes the sum of all matrix\n * entries of each connection 1.\n *\n * This is still under the assumption that nxp = nyp = 1.\n *\n * There is also the ability to specify an additional penalty of the form\n * dW\/dt += slownessPost * slownessPre', by setting slownessFlag to true\n * and specifying slownessPre and slownessPost layers.\n *\n * The name comes from the motivation of including a slowness term on\n * ReciprocalConns, but the slowness interpretation is not within ReciprocalConn.\n * IncrementLayer was written so that setting A to an IncrementLayer, and\n * having a layer B be the post of a clone of the ReciprocalConn, setting\n * slownessPre to A and slownessPost to B would implement a slowness term.\n *\n * Created on: Feb 16, 2012\n * Author: pschultz\n *\/\n\n#include \"ReciprocalConn.hpp\"\n\nnamespace PV {\n\nReciprocalConn::ReciprocalConn() {\n initialize_base();\n\n}\n\nReciprocalConn::ReciprocalConn(const char * name, HyPerCol * hc,\n HyPerLayer * pre, HyPerLayer * post,\n const char * filename, InitWeights * weightInit) {\n initialize_base();\n initialize(name, hc, pre, post, filename, weightInit);\n}\n\nint ReciprocalConn::initialize_base() {\n updateRulePre = NULL;\n updateRulePost = NULL;\n reciprocalWgts = NULL;\n slownessPre = NULL;\n slownessPost = NULL;\n sums = NULL;\n normalizeNoiseLevel = 0.0;\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::initialize(const char * name, HyPerCol * hc,\n HyPerLayer * pre, HyPerLayer * post,\n const char * filename, InitWeights * weightInit) {\n int status = PV_SUCCESS;\n status = KernelConn::initialize(name, hc, pre, post, filename, weightInit);\n PVParams * params = hc->parameters();\n relaxationRate = params->value(name, \"relaxationRate\", 1.0f);\n reciprocalFidelityCoeff = params->value(name, \"reciprocalFidelityCoeff\", 1.0f);\n\n status = initParameterLayer(\"updateRulePre\", &updateRulePre, pre) == PV_SUCCESS ? status : PV_FAILURE;\n status = initParameterLayer(\"updateRulePost\", &updateRulePost, post) == PV_SUCCESS ? status : PV_FAILURE;\n\n slownessFlag = params->value(name, \"slownessFlag\", false)!=0;\n if( slownessFlag ) {\n status = initParameterLayer(\"slownessPre\", &slownessPre, NULL) == PV_SUCCESS ? status : PV_FAILURE;\n status = initParameterLayer(\"slownessPost\", &slownessPost, NULL) == PV_SUCCESS ? status : PV_FAILURE;\n }\n\n reciprocalWgtsName = params->stringValue(name, \"reciprocalWgts\");\n if( reciprocalWgtsName == NULL || reciprocalWgtsName[0] == '0') {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts must be defined.\\n\", name);\n status = PV_FAILURE;\n }\n if( status != PV_SUCCESS ) abort();\n\n return status;\n}\n\nint ReciprocalConn::initParameterLayer(const char * parametername, HyPerLayer ** layerPtr, HyPerLayer * defaultlayer) {\n int status = PV_SUCCESS;\n PVParams * params = parent->parameters();\n const char * layerName = params->stringValue(name, parametername);\n if( layerName == NULL || layerName[0] == '0') {\n if( defaultlayer == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": parameter \\\"%s\\\" was not defined and no default was specified.\\n\", name, parametername);\n status = PV_FAILURE;\n }\n else {\n fprintf(stdout, \"ReciprocalConn \\\"%s\\\": parameter \\\"%s\\\" set to \\\"s\\\"\\n\", name, defaultlayer->getName());\n *layerPtr = defaultlayer;\n }\n }\n else {\n *layerPtr = parent->getLayerFromName(layerName);\n if( *layerPtr == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\" parameter \\\"%s\\\": value \\\"%s\\\" is not the name of a layer.\\n\", name, parametername, layerName);\n status = PV_FAILURE;\n }\n }\n return status;\n}\n\nint ReciprocalConn::initNormalize() {\n PVParams * params = parent->parameters();\n normalizeNoiseLevel = params->value(name, \"normalizeNoiseLevel\", normalizeNoiseLevel);\n nxUnitCellPost = zUnitCellSize(postSynapticLayer()->getXScale(), preSynapticLayer()->getXScale());\n nyUnitCellPost = zUnitCellSize(postSynapticLayer()->getYScale(), preSynapticLayer()->getYScale());\n nfUnitCellPost = fPatchSize();\n sizeUnitCellPost = nxUnitCellPost*nyUnitCellPost*nfUnitCellPost;\n sums = (pvdata_t *) malloc(sizeUnitCellPost*sizeof(pvdata_t));\n if( sums == NULL ) abort();\n\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::updateState(float timef, float dt) {\n \/\/ Need to set reciprocalWgts the first time updateState is called, so that each ReciprocalConn in a pair can define the other\n \/\/ If it was set in initialize, the second would not have been defined when the first was called.\n if( reciprocalWgts == NULL) {\n setReciprocalWgts(reciprocalWgtsName);\n }\n int status = KernelConn::updateState(timef, dt);\n return status;\n}\n\nint ReciprocalConn::setReciprocalWgts(const char * recipName) {\n int status = PV_SUCCESS;\n if( status == PV_SUCCESS && recipName == NULL ) {\n status = PV_FAILURE;\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": setReciprocalWgts called with null argument.\\n\", name);\n }\n\n HyPerConn * c;\n if( status == PV_SUCCESS ) {\n c = parent->getConnFromName(recipName);\n if( c == NULL) {\n status = PV_FAILURE;\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts \\\"%s\\\" could not be found.\\n\", name, recipName);\n }\n }\n if( status == PV_SUCCESS && reciprocalWgts != NULL) {\n if(c != reciprocalWgts) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": setReciprocalWgts called with reciprocalWgts already set.\\n\", name);\n status = PV_FAILURE;\n }\n }\n if( status == PV_SUCCESS && reciprocalWgts == NULL ) {\n reciprocalWgts = dynamic_cast<ReciprocalConn *>(parent->getConnFromName(recipName));\n if( reciprocalWgts == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts \\\"%s\\\" is not a ReciprocalConn.\\n\", name, recipName);\n status = PV_FAILURE;\n }\n }\n return status;\n}\n\nint ReciprocalConn::update_dW(int axonID) {\n int nExt = preSynapticLayer()->getNumExtended();\n int numKernelIndices = getNumDataPatches();\n int delay = getDelay(axonID);\n const pvdata_t * preactbuf = updateRulePre->getLayerData(delay);\n const pvdata_t * postactbuf = updateRulePost->getLayerData(delay);\n const pvdata_t * slownessprebuf = getSlownessFlag() ? slownessPre->getLayerData(delay) : NULL;\n const pvdata_t * slownesspostbuf = getSlownessFlag() ? slownessPost->getLayerData(delay) : NULL;\n\n int sya = (post->getLayerLoc()->nf * (post->getLayerLoc()->nx + 2*post->getLayerLoc()->nb));\n for(int kExt=0; kExt<nExt;kExt++) {\n PVPatch * weights = getWeights(kExt,axonID);\n size_t offset = getAPostOffset(kExt, axonID);\n int ny = weights->ny;\n int nk = weights->nx * nfp;\n pvdata_t preact = preactbuf[kExt];\n const pvdata_t * postactRef = &postactbuf[offset];\n pvdata_t * dwdata = get_dwData(axonID, kExt);\n int lineoffsetw = 0;\n int lineoffseta = 0;\n for( int y=0; y<ny; y++ ) {\n for( int k=0; k<nk; k++ ) {\n dwdata[lineoffsetw + k] += updateRule_dW(preact, postactRef[lineoffseta+k]);\n }\n lineoffsetw += syp;\n lineoffseta += sya;\n }\n if( slownessFlag ) {\n preact = slownessprebuf[kExt];\n postactRef = &slownesspostbuf[offset];\n\n int lineoffsetw = 0;\n int lineoffseta = 0;\n for( int y=0; y<ny; y++ ) {\n for( int k=0; k<nk; k++ ) {\n dwdata[lineoffsetw + k] += updateRule_dW(preact, postactRef[lineoffseta+k]);\n }\n lineoffsetw += syp;\n lineoffseta += sya;\n }\n }\n }\n if( reciprocalFidelityCoeff ) {\n for( int k=0; k<numKernelIndices; k++) {\n const pvdata_t * wdata = get_wDataHead(axonID, k);\n pvdata_t * dwdata = get_dwDataHead(axonID, k);\n int n=0;\n for( int y=0; y<nyp; y++ ) { for( int x=0; x<nxp; x++) { for( int f=0; f<nfp; f++ ) {\n int xRecip, yRecip, fRecip, kRecip;\n getReciprocalWgtCoordinates(x, y, f, k, &xRecip, &yRecip, &fRecip, &kRecip);\n const pvdata_t * recipwdata = reciprocalWgts->get_wDataHead(axonID, kRecip);\n int nRecip = kIndex(xRecip, yRecip, fRecip, reciprocalWgts->xPatchSize(), reciprocalWgts->yPatchSize(), reciprocalWgts->fPatchSize());\n dwdata[n] -= reciprocalFidelityCoeff\/nfp*(wdata[n]\/nfp-recipwdata[nRecip]\/reciprocalWgts->fPatchSize());\n n++;\n }}}\n }\n }\n\n \/\/ Divide by (numNeurons\/numKernels)\n int divisor = pre->getNumNeurons()\/numKernelIndices;\n assert( divisor*numKernelIndices == pre->getNumNeurons() );\n for( int kernelindex=0; kernelindex<numKernelIndices; kernelindex++ ) {\n int numpatchitems = nxp * nyp * nfp;\n pvdata_t * dwpatchdata = get_dwDataHead(axonID,kernelindex);\n for( int n=0; n<numpatchitems; n++ ) {\n dwpatchdata[n] \/= divisor;\n }\n }\n\n lastUpdateTime = parent->simulationTime();\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::updateWeights(int arborID) {\n lastUpdateTime = parent->simulationTime();\n \/\/ add dw to w\n for( int k=0; k<nxp*nyp*nfp*getNumDataPatches(); k++ ) {\n get_wDataStart(arborID)[k] += relaxationRate*parent->getDeltaTime()*get_dwDataStart(arborID)[k];\n }\n int status = PV_SUCCESS;\n pvdata_t * arborstart = get_wDataStart(arborID);\n for( int k=0; k<nxp*nyp*nfp*getNumDataPatches(); k++ ) {\n if( arborstart[k] < 0 ) arborstart[k] = 0;\n }\n return status;\n}\n\nint ReciprocalConn::normalizeWeights(PVPatch ** patches, pvdata_t ** dataStart, int numPatches, int arborID) {\n assert(arborID == 0); \/\/ TODO how to handle arbors. Do I need to sum over arbors or handle each arbor independently?\n int status = PV_SUCCESS;\n assert( numPatches == getNumDataPatches() );\n\n if( normalizeNoiseLevel == 0.0f ) {\n for( int k=0; k<sizeUnitCellPost; k++ ) sums[k] = 0;\n }\n else {\n for( int k=0; k<sizeUnitCellPost; k++ ) sums[k] = normalizeNoiseLevel * pv_random_prob();\n }\n\n for( int kernel=0; kernel<numPatches; kernel++ ) {\n pvdata_t * kernelData = &dataStart[arborID][kernel*nxp*nyp*nfp];\n for( int y=0; y<yPatchSize(); y++ ) {\n int yInCell = y % nyUnitCellPost;\n for( int x=0; x<xPatchSize(); x++ ) {\n int xInCell = x % nxUnitCellPost;\n for( int f=0; f<fPatchSize(); f++ ) {\n int idxInCell = kIndex(xInCell, yInCell, f, nxUnitCellPost, nyUnitCellPost, nfUnitCellPost);\n sums[idxInCell] += kernelData[kIndex(x,y,f,nxp,nyp,nfp)];\n }\n }\n }\n }\n\n for( int kernel=0; kernel<numPatches; kernel++ ) {\n pvdata_t * kernelData = &dataStart[arborID][kernel*nxp*nyp*nfp];\n for( int y=0; y<yPatchSize(); y++ ) {\n int yInCell = y % nyUnitCellPost;\n for( int x=0; x<xPatchSize(); x++ ) {\n int xInCell = x % nxUnitCellPost;\n for( int f=0; f<fPatchSize(); f++ ) {\n int idxInCell = kIndex(xInCell, yInCell, f, nxUnitCellPost, nyUnitCellPost, nfUnitCellPost);\n kernelData[kIndex(x,y,f,nxp,nyp,nfp)] \/= sums[idxInCell];\n }\n }\n }\n }\n return status;\n}\n\nReciprocalConn::~ReciprocalConn() {\n free(sums); sums=NULL;\n}\n\n} \/* namespace PV *\/\n<commit_msg>weights->offset fix for ReciprocalConn::update_dW<commit_after>\/*\n * ReciprocalConn.cpp\n *\n * For two connections with transpose geometries (the pre of one has the\n * same geometry as the post of another and vice versa). They are not\n * forced to be each other's transpose, but there is a penalty term\n * on the L2 norm of the difference between it and its reciprocal's\n * transpose, of the amount\n * r\/2 * || W\/f_W - (W_recip)'\/f_{W_recip} ||^2.\n *\n * r is the parameter reciprocalFidelityCoeff\n * W is the weights and W_recip is the weights of the reciprocal connection\n * f_W and f_{W_recip} are the number of features of each connection.\n *\n * The connection forces the normalization method to be that for each feature,\n * the sum across kernels (number of features of reciprocal connection) is unity.\n *\n * Dividing by f_W and f_{W_recip} therefore makes the sum of all matrix\n * entries of each connection 1.\n *\n * This is still under the assumption that nxp = nyp = 1.\n *\n * There is also the ability to specify an additional penalty of the form\n * dW\/dt += slownessPost * slownessPre', by setting slownessFlag to true\n * and specifying slownessPre and slownessPost layers.\n *\n * The name comes from the motivation of including a slowness term on\n * ReciprocalConns, but the slowness interpretation is not within ReciprocalConn.\n * IncrementLayer was written so that setting A to an IncrementLayer, and\n * having a layer B be the post of a clone of the ReciprocalConn, setting\n * slownessPre to A and slownessPost to B would implement a slowness term.\n *\n * Created on: Feb 16, 2012\n * Author: pschultz\n *\/\n\n#include \"ReciprocalConn.hpp\"\n\nnamespace PV {\n\nReciprocalConn::ReciprocalConn() {\n initialize_base();\n\n}\n\nReciprocalConn::ReciprocalConn(const char * name, HyPerCol * hc,\n HyPerLayer * pre, HyPerLayer * post,\n const char * filename, InitWeights * weightInit) {\n initialize_base();\n initialize(name, hc, pre, post, filename, weightInit);\n}\n\nint ReciprocalConn::initialize_base() {\n updateRulePre = NULL;\n updateRulePost = NULL;\n reciprocalWgts = NULL;\n slownessPre = NULL;\n slownessPost = NULL;\n sums = NULL;\n normalizeNoiseLevel = 0.0;\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::initialize(const char * name, HyPerCol * hc,\n HyPerLayer * pre, HyPerLayer * post,\n const char * filename, InitWeights * weightInit) {\n int status = PV_SUCCESS;\n status = KernelConn::initialize(name, hc, pre, post, filename, weightInit);\n PVParams * params = hc->parameters();\n relaxationRate = params->value(name, \"relaxationRate\", 1.0f);\n reciprocalFidelityCoeff = params->value(name, \"reciprocalFidelityCoeff\", 1.0f);\n\n status = initParameterLayer(\"updateRulePre\", &updateRulePre, pre) == PV_SUCCESS ? status : PV_FAILURE;\n status = initParameterLayer(\"updateRulePost\", &updateRulePost, post) == PV_SUCCESS ? status : PV_FAILURE;\n\n slownessFlag = params->value(name, \"slownessFlag\", false)!=0;\n if( slownessFlag ) {\n status = initParameterLayer(\"slownessPre\", &slownessPre, NULL) == PV_SUCCESS ? status : PV_FAILURE;\n status = initParameterLayer(\"slownessPost\", &slownessPost, NULL) == PV_SUCCESS ? status : PV_FAILURE;\n }\n\n reciprocalWgtsName = params->stringValue(name, \"reciprocalWgts\");\n if( reciprocalWgtsName == NULL || reciprocalWgtsName[0] == '0') {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts must be defined.\\n\", name);\n status = PV_FAILURE;\n }\n if( status != PV_SUCCESS ) abort();\n\n return status;\n}\n\nint ReciprocalConn::initParameterLayer(const char * parametername, HyPerLayer ** layerPtr, HyPerLayer * defaultlayer) {\n int status = PV_SUCCESS;\n PVParams * params = parent->parameters();\n const char * layerName = params->stringValue(name, parametername);\n if( layerName == NULL || layerName[0] == '0') {\n if( defaultlayer == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": parameter \\\"%s\\\" was not defined and no default was specified.\\n\", name, parametername);\n status = PV_FAILURE;\n }\n else {\n fprintf(stdout, \"ReciprocalConn \\\"%s\\\": parameter \\\"%s\\\" set to \\\"s\\\"\\n\", name, defaultlayer->getName());\n *layerPtr = defaultlayer;\n }\n }\n else {\n *layerPtr = parent->getLayerFromName(layerName);\n if( *layerPtr == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\" parameter \\\"%s\\\": value \\\"%s\\\" is not the name of a layer.\\n\", name, parametername, layerName);\n status = PV_FAILURE;\n }\n }\n return status;\n}\n\nint ReciprocalConn::initNormalize() {\n PVParams * params = parent->parameters();\n normalizeNoiseLevel = params->value(name, \"normalizeNoiseLevel\", normalizeNoiseLevel);\n nxUnitCellPost = zUnitCellSize(postSynapticLayer()->getXScale(), preSynapticLayer()->getXScale());\n nyUnitCellPost = zUnitCellSize(postSynapticLayer()->getYScale(), preSynapticLayer()->getYScale());\n nfUnitCellPost = fPatchSize();\n sizeUnitCellPost = nxUnitCellPost*nyUnitCellPost*nfUnitCellPost;\n sums = (pvdata_t *) malloc(sizeUnitCellPost*sizeof(pvdata_t));\n if( sums == NULL ) abort();\n\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::updateState(float timef, float dt) {\n \/\/ Need to set reciprocalWgts the first time updateState is called, so that each ReciprocalConn in a pair can define the other\n \/\/ If it was set in initialize, the second would not have been defined when the first was called.\n if( reciprocalWgts == NULL) {\n setReciprocalWgts(reciprocalWgtsName);\n }\n int status = KernelConn::updateState(timef, dt);\n return status;\n}\n\nint ReciprocalConn::setReciprocalWgts(const char * recipName) {\n int status = PV_SUCCESS;\n if( status == PV_SUCCESS && recipName == NULL ) {\n status = PV_FAILURE;\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": setReciprocalWgts called with null argument.\\n\", name);\n }\n\n HyPerConn * c;\n if( status == PV_SUCCESS ) {\n c = parent->getConnFromName(recipName);\n if( c == NULL) {\n status = PV_FAILURE;\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts \\\"%s\\\" could not be found.\\n\", name, recipName);\n }\n }\n if( status == PV_SUCCESS && reciprocalWgts != NULL) {\n if(c != reciprocalWgts) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": setReciprocalWgts called with reciprocalWgts already set.\\n\", name);\n status = PV_FAILURE;\n }\n }\n if( status == PV_SUCCESS && reciprocalWgts == NULL ) {\n reciprocalWgts = dynamic_cast<ReciprocalConn *>(parent->getConnFromName(recipName));\n if( reciprocalWgts == NULL ) {\n fprintf(stderr, \"ReciprocalConn \\\"%s\\\": reciprocalWgts \\\"%s\\\" is not a ReciprocalConn.\\n\", name, recipName);\n status = PV_FAILURE;\n }\n }\n return status;\n}\n\nint ReciprocalConn::update_dW(int axonID) {\n int nExt = preSynapticLayer()->getNumExtended();\n int numKernelIndices = getNumDataPatches();\n int delay = getDelay(axonID);\n const pvdata_t * preactbuf = updateRulePre->getLayerData(delay);\n const pvdata_t * postactbuf = updateRulePost->getLayerData(delay);\n const pvdata_t * slownessprebuf = getSlownessFlag() ? slownessPre->getLayerData(delay) : NULL;\n const pvdata_t * slownesspostbuf = getSlownessFlag() ? slownessPost->getLayerData(delay) : NULL;\n\n int sya = (post->getLayerLoc()->nf * (post->getLayerLoc()->nx + 2*post->getLayerLoc()->nb));\n for(int kExt=0; kExt<nExt;kExt++) {\n PVPatch * weights = getWeights(kExt,axonID);\n size_t offset = getAPostOffset(kExt, axonID);\n int ny = weights->ny;\n int nk = weights->nx * nfp;\n pvdata_t preact = preactbuf[kExt];\n const pvdata_t * postactRef = &postactbuf[offset];\n pvdata_t * dwdata = get_dwData(axonID, kExt);\n int lineoffsetw = weights->offset;\n int lineoffseta = 0;\n for( int y=0; y<ny; y++ ) {\n for( int k=0; k<nk; k++ ) {\n dwdata[lineoffsetw + k] += updateRule_dW(preact, postactRef[lineoffseta+k]);\n }\n lineoffsetw += syp;\n lineoffseta += sya;\n }\n if( slownessFlag ) {\n preact = slownessprebuf[kExt];\n postactRef = &slownesspostbuf[offset];\n\n int lineoffsetw = weights->offset;\n int lineoffseta = 0;\n for( int y=0; y<ny; y++ ) {\n for( int k=0; k<nk; k++ ) {\n dwdata[lineoffsetw + k] += updateRule_dW(preact, postactRef[lineoffseta+k]);\n }\n lineoffsetw += syp;\n lineoffseta += sya;\n }\n }\n }\n if( reciprocalFidelityCoeff ) {\n for( int k=0; k<numKernelIndices; k++) {\n const pvdata_t * wdata = get_wDataHead(axonID, k);\n pvdata_t * dwdata = get_dwDataHead(axonID, k);\n int n=0;\n for( int y=0; y<nyp; y++ ) { for( int x=0; x<nxp; x++) { for( int f=0; f<nfp; f++ ) {\n int xRecip, yRecip, fRecip, kRecip;\n getReciprocalWgtCoordinates(x, y, f, k, &xRecip, &yRecip, &fRecip, &kRecip);\n const pvdata_t * recipwdata = reciprocalWgts->get_wDataHead(axonID, kRecip);\n int nRecip = kIndex(xRecip, yRecip, fRecip, reciprocalWgts->xPatchSize(), reciprocalWgts->yPatchSize(), reciprocalWgts->fPatchSize());\n dwdata[n] -= reciprocalFidelityCoeff\/nfp*(wdata[n]\/nfp-recipwdata[nRecip]\/reciprocalWgts->fPatchSize());\n n++;\n }}}\n }\n }\n\n \/\/ Divide by (numNeurons\/numKernels)\n int divisor = pre->getNumNeurons()\/numKernelIndices;\n assert( divisor*numKernelIndices == pre->getNumNeurons() );\n for( int kernelindex=0; kernelindex<numKernelIndices; kernelindex++ ) {\n int numpatchitems = nxp * nyp * nfp;\n pvdata_t * dwpatchdata = get_dwDataHead(axonID,kernelindex);\n for( int n=0; n<numpatchitems; n++ ) {\n dwpatchdata[n] \/= divisor;\n }\n }\n\n lastUpdateTime = parent->simulationTime();\n return PV_SUCCESS;\n}\n\nint ReciprocalConn::updateWeights(int arborID) {\n lastUpdateTime = parent->simulationTime();\n \/\/ add dw to w\n for( int k=0; k<nxp*nyp*nfp*getNumDataPatches(); k++ ) {\n get_wDataStart(arborID)[k] += relaxationRate*parent->getDeltaTime()*get_dwDataStart(arborID)[k];\n }\n int status = PV_SUCCESS;\n pvdata_t * arborstart = get_wDataStart(arborID);\n for( int k=0; k<nxp*nyp*nfp*getNumDataPatches(); k++ ) {\n if( arborstart[k] < 0 ) arborstart[k] = 0;\n }\n return status;\n}\n\nint ReciprocalConn::normalizeWeights(PVPatch ** patches, pvdata_t ** dataStart, int numPatches, int arborID) {\n assert(arborID == 0); \/\/ TODO how to handle arbors. Do I need to sum over arbors or handle each arbor independently?\n int status = PV_SUCCESS;\n assert( numPatches == getNumDataPatches() );\n\n if( normalizeNoiseLevel == 0.0f ) {\n for( int k=0; k<sizeUnitCellPost; k++ ) sums[k] = 0;\n }\n else {\n for( int k=0; k<sizeUnitCellPost; k++ ) sums[k] = normalizeNoiseLevel * pv_random_prob();\n }\n\n for( int kernel=0; kernel<numPatches; kernel++ ) {\n pvdata_t * kernelData = &dataStart[arborID][kernel*nxp*nyp*nfp];\n for( int y=0; y<yPatchSize(); y++ ) {\n int yInCell = y % nyUnitCellPost;\n for( int x=0; x<xPatchSize(); x++ ) {\n int xInCell = x % nxUnitCellPost;\n for( int f=0; f<fPatchSize(); f++ ) {\n int idxInCell = kIndex(xInCell, yInCell, f, nxUnitCellPost, nyUnitCellPost, nfUnitCellPost);\n sums[idxInCell] += kernelData[kIndex(x,y,f,nxp,nyp,nfp)];\n }\n }\n }\n }\n\n for( int kernel=0; kernel<numPatches; kernel++ ) {\n pvdata_t * kernelData = &dataStart[arborID][kernel*nxp*nyp*nfp];\n for( int y=0; y<yPatchSize(); y++ ) {\n int yInCell = y % nyUnitCellPost;\n for( int x=0; x<xPatchSize(); x++ ) {\n int xInCell = x % nxUnitCellPost;\n for( int f=0; f<fPatchSize(); f++ ) {\n int idxInCell = kIndex(xInCell, yInCell, f, nxUnitCellPost, nyUnitCellPost, nfUnitCellPost);\n kernelData[kIndex(x,y,f,nxp,nyp,nfp)] \/= sums[idxInCell];\n }\n }\n }\n }\n return status;\n}\n\nReciprocalConn::~ReciprocalConn() {\n free(sums); sums=NULL;\n}\n\n} \/* namespace PV *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013-present Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <folly\/Memory.h>\n\n#include <algorithm>\n#include <limits>\n#include <type_traits>\n#include <utility>\n\n#include <glog\/logging.h>\n\n#include <folly\/String.h>\n#include <folly\/memory\/Arena.h>\n#include <folly\/portability\/GMock.h>\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly;\n\nstatic constexpr std::size_t kTooBig = std::max(\n std::size_t{std::numeric_limits<uint32_t>::max()},\n std::size_t{1} << (8 * sizeof(std::size_t) - 14));\n\nTEST(aligned_malloc, examples) {\n auto trial = [](size_t align) {\n auto const ptr = aligned_malloc(1, align);\n return (aligned_free(ptr), uintptr_t(ptr));\n };\n\n if (!kIsSanitize) { \/\/ asan allocator raises SIGABRT instead\n EXPECT_EQ(EINVAL, (trial(2), errno)) << \"too small\";\n EXPECT_EQ(EINVAL, (trial(513), errno)) << \"not power of two\";\n }\n\n EXPECT_EQ(0, trial(512) % 512);\n EXPECT_EQ(0, trial(8192) % 8192);\n}\n\nTEST(make_unique, compatible_with_std_make_unique) {\n \/\/ HACK: To enforce that `folly::` is imported here.\n to_shared_ptr(std::unique_ptr<std::string>());\n\n using namespace std;\n make_unique<string>(\"hello, world\");\n}\n\nTEST(to_weak_ptr, example) {\n auto s = std::make_shared<int>(17);\n EXPECT_EQ(1, s.use_count());\n EXPECT_EQ(2, (to_weak_ptr(s).lock(), s.use_count())) << \"lvalue\";\n EXPECT_EQ(3, (to_weak_ptr(decltype(s)(s)).lock(), s.use_count())) << \"rvalue\";\n}\n\nTEST(SysAllocator, equality) {\n using Alloc = SysAllocator<float>;\n Alloc const a, b;\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n}\n\nTEST(SysAllocator, allocate_unique) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n}\n\nTEST(SysAllocator, vector) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n}\n\nTEST(SysAllocator, bad_alloc) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(AlignedSysAllocator, equality_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const a, b;\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n}\n\nTEST(AlignedSysAllocator, allocate_unique_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n EXPECT_EQ(0, std::uintptr_t(ptr.get()) % 1024);\n}\n\nTEST(AlignedSysAllocator, vector_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n EXPECT_EQ(0, std::uintptr_t(nums.data()) % 1024);\n}\n\nTEST(AlignedSysAllocator, bad_alloc_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(AlignedSysAllocator, equality_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const a(1024), b(1024), c(512);\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n EXPECT_FALSE(a == c);\n EXPECT_TRUE(a != c);\n}\n\nTEST(AlignedSysAllocator, allocate_unique_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n EXPECT_EQ(0, std::uintptr_t(ptr.get()) % 1024);\n}\n\nTEST(AlignedSysAllocator, vector_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n EXPECT_EQ(0, std::uintptr_t(nums.data()) % 1024);\n}\n\nTEST(AlignedSysAllocator, bad_alloc_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(allocate_sys_buffer, compiles) {\n auto buf = allocate_sys_buffer(256);\n \/\/ Freed at the end of the scope.\n}\n\nnamespace {\ntemplate <typename T>\nstruct TestAlloc1 : SysAllocator<T> {\n template <typename U, typename... Args>\n void construct(U* p, Args&&... args) {\n ::new (static_cast<void*>(p)) U(std::forward<Args>(args)...);\n }\n};\n\ntemplate <typename T>\nstruct TestAlloc2 : TestAlloc1<T> {\n template <typename U>\n void destroy(U* p) {\n p->~U();\n }\n};\n\ntemplate <typename T>\nstruct TestAlloc3 : TestAlloc2<T> {\n using folly_has_default_object_construct = std::true_type;\n};\n\ntemplate <typename T>\nstruct TestAlloc4 : TestAlloc3<T> {\n using folly_has_default_object_destroy = std::true_type;\n};\n\ntemplate <typename T>\nstruct TestAlloc5 : SysAllocator<T> {\n using folly_has_default_object_construct = std::true_type;\n using folly_has_default_object_destroy = std::false_type;\n};\n} \/\/ namespace\n\nTEST(AllocatorObjectLifecycleTraits, compiles) {\n using A = std::allocator<int>;\n using S = std::string;\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<A, int, int>::value, \"\");\n static_assert(folly::AllocatorHasDefaultObjectConstruct<A, S, S>::value, \"\");\n\n static_assert(folly::AllocatorHasDefaultObjectDestroy<A, int>::value, \"\");\n static_assert(folly::AllocatorHasDefaultObjectDestroy<A, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<\n folly::AlignedSysAllocator<int>,\n int,\n int>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<\n folly::AlignedSysAllocator<int>,\n S,\n S>::value,\n \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<\n folly::AlignedSysAllocator<int>,\n int>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<\n folly::AlignedSysAllocator<int>,\n S>::value,\n \"\");\n\n static_assert(\n !folly::AllocatorHasDefaultObjectConstruct<TestAlloc1<S>, S, S>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<TestAlloc1<S>, S>::value, \"\");\n\n static_assert(\n !folly::AllocatorHasDefaultObjectConstruct<TestAlloc2<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc2<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc3<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc3<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc4<S>, S, S>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<TestAlloc4<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc5<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc5<S>, S>::value, \"\");\n}\n\ntemplate <typename C>\nstatic void test_enable_shared_from_this(std::shared_ptr<C> sp) {\n ASSERT_EQ(1l, sp.use_count());\n\n \/\/ Test shared_from_this().\n std::shared_ptr<C> sp2 = sp->shared_from_this();\n ASSERT_EQ(sp, sp2);\n\n \/\/ Test weak_from_this().\n std::weak_ptr<C> wp = sp->weak_from_this();\n ASSERT_EQ(sp, wp.lock());\n sp.reset();\n sp2.reset();\n ASSERT_EQ(nullptr, wp.lock());\n\n \/\/ Test shared_from_this() and weak_from_this() on object not owned by a\n \/\/ shared_ptr. Undefined in C++14 but well-defined in C++17. Also known to\n \/\/ work with libstdc++ >= 20150123. Feel free to add other standard library\n \/\/ versions where the behavior is known.\n#if __cplusplus >= 201700L || __GLIBCXX__ >= 20150123L\n C stack_resident;\n ASSERT_THROW(stack_resident.shared_from_this(), std::bad_weak_ptr);\n ASSERT_TRUE(stack_resident.weak_from_this().expired());\n#endif\n}\n\nTEST(enable_shared_from_this, compatible_with_std_enable_shared_from_this) {\n \/\/ Compile-time compatibility.\n class C_std : public std::enable_shared_from_this<C_std> {};\n class C_folly : public folly::enable_shared_from_this<C_folly> {};\n static_assert(\n noexcept(std::declval<C_std>().shared_from_this()) ==\n noexcept(std::declval<C_folly>().shared_from_this()),\n \"\");\n static_assert(\n noexcept(std::declval<C_std const>().shared_from_this()) ==\n noexcept(std::declval<C_folly const>().shared_from_this()),\n \"\");\n static_assert(noexcept(std::declval<C_folly>().weak_from_this()), \"\");\n static_assert(noexcept(std::declval<C_folly const>().weak_from_this()), \"\");\n\n \/\/ Runtime compatibility.\n test_enable_shared_from_this(std::make_shared<C_folly>());\n test_enable_shared_from_this(std::make_shared<C_folly const>());\n}\n<commit_msg>fix MemoryTest for platforms without constexpr std::max<commit_after>\/*\n * Copyright 2013-present Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <folly\/Memory.h>\n\n#include <limits>\n#include <type_traits>\n#include <utility>\n\n#include <glog\/logging.h>\n\n#include <folly\/ConstexprMath.h>\n#include <folly\/String.h>\n#include <folly\/memory\/Arena.h>\n#include <folly\/portability\/GMock.h>\n#include <folly\/portability\/GTest.h>\n\nusing namespace folly;\n\nstatic constexpr std::size_t kTooBig = folly::constexpr_max(\n std::size_t{std::numeric_limits<uint32_t>::max()},\n std::size_t{1} << (8 * sizeof(std::size_t) - 14));\n\nTEST(aligned_malloc, examples) {\n auto trial = [](size_t align) {\n auto const ptr = aligned_malloc(1, align);\n return (aligned_free(ptr), uintptr_t(ptr));\n };\n\n if (!kIsSanitize) { \/\/ asan allocator raises SIGABRT instead\n EXPECT_EQ(EINVAL, (trial(2), errno)) << \"too small\";\n EXPECT_EQ(EINVAL, (trial(513), errno)) << \"not power of two\";\n }\n\n EXPECT_EQ(0, trial(512) % 512);\n EXPECT_EQ(0, trial(8192) % 8192);\n}\n\nTEST(make_unique, compatible_with_std_make_unique) {\n \/\/ HACK: To enforce that `folly::` is imported here.\n to_shared_ptr(std::unique_ptr<std::string>());\n\n using namespace std;\n make_unique<string>(\"hello, world\");\n}\n\nTEST(to_weak_ptr, example) {\n auto s = std::make_shared<int>(17);\n EXPECT_EQ(1, s.use_count());\n EXPECT_EQ(2, (to_weak_ptr(s).lock(), s.use_count())) << \"lvalue\";\n EXPECT_EQ(3, (to_weak_ptr(decltype(s)(s)).lock(), s.use_count())) << \"rvalue\";\n}\n\nTEST(SysAllocator, equality) {\n using Alloc = SysAllocator<float>;\n Alloc const a, b;\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n}\n\nTEST(SysAllocator, allocate_unique) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n}\n\nTEST(SysAllocator, vector) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n}\n\nTEST(SysAllocator, bad_alloc) {\n using Alloc = SysAllocator<float>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(AlignedSysAllocator, equality_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const a, b;\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n}\n\nTEST(AlignedSysAllocator, allocate_unique_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n EXPECT_EQ(0, std::uintptr_t(ptr.get()) % 1024);\n}\n\nTEST(AlignedSysAllocator, vector_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n EXPECT_EQ(0, std::uintptr_t(nums.data()) % 1024);\n}\n\nTEST(AlignedSysAllocator, bad_alloc_fixed) {\n using Alloc = AlignedSysAllocator<float, FixedAlign<1024>>;\n Alloc const alloc;\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(AlignedSysAllocator, equality_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const a(1024), b(1024), c(512);\n EXPECT_TRUE(a == b);\n EXPECT_FALSE(a != b);\n EXPECT_FALSE(a == c);\n EXPECT_TRUE(a != c);\n}\n\nTEST(AlignedSysAllocator, allocate_unique_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n auto ptr = allocate_unique<float>(alloc, 3.);\n EXPECT_EQ(3., *ptr);\n EXPECT_EQ(0, std::uintptr_t(ptr.get()) % 1024);\n}\n\nTEST(AlignedSysAllocator, vector_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n std::vector<float, Alloc> nums(alloc);\n nums.push_back(3.);\n nums.push_back(5.);\n EXPECT_THAT(nums, testing::ElementsAreArray({3., 5.}));\n EXPECT_EQ(0, std::uintptr_t(nums.data()) % 1024);\n}\n\nTEST(AlignedSysAllocator, bad_alloc_default) {\n using Alloc = AlignedSysAllocator<float>;\n Alloc const alloc(1024);\n std::vector<float, Alloc> nums(alloc);\n if (!kIsSanitize) {\n EXPECT_THROW(nums.reserve(kTooBig), std::bad_alloc);\n }\n}\n\nTEST(allocate_sys_buffer, compiles) {\n auto buf = allocate_sys_buffer(256);\n \/\/ Freed at the end of the scope.\n}\n\nnamespace {\ntemplate <typename T>\nstruct TestAlloc1 : SysAllocator<T> {\n template <typename U, typename... Args>\n void construct(U* p, Args&&... args) {\n ::new (static_cast<void*>(p)) U(std::forward<Args>(args)...);\n }\n};\n\ntemplate <typename T>\nstruct TestAlloc2 : TestAlloc1<T> {\n template <typename U>\n void destroy(U* p) {\n p->~U();\n }\n};\n\ntemplate <typename T>\nstruct TestAlloc3 : TestAlloc2<T> {\n using folly_has_default_object_construct = std::true_type;\n};\n\ntemplate <typename T>\nstruct TestAlloc4 : TestAlloc3<T> {\n using folly_has_default_object_destroy = std::true_type;\n};\n\ntemplate <typename T>\nstruct TestAlloc5 : SysAllocator<T> {\n using folly_has_default_object_construct = std::true_type;\n using folly_has_default_object_destroy = std::false_type;\n};\n} \/\/ namespace\n\nTEST(AllocatorObjectLifecycleTraits, compiles) {\n using A = std::allocator<int>;\n using S = std::string;\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<A, int, int>::value, \"\");\n static_assert(folly::AllocatorHasDefaultObjectConstruct<A, S, S>::value, \"\");\n\n static_assert(folly::AllocatorHasDefaultObjectDestroy<A, int>::value, \"\");\n static_assert(folly::AllocatorHasDefaultObjectDestroy<A, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<\n folly::AlignedSysAllocator<int>,\n int,\n int>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<\n folly::AlignedSysAllocator<int>,\n S,\n S>::value,\n \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<\n folly::AlignedSysAllocator<int>,\n int>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<\n folly::AlignedSysAllocator<int>,\n S>::value,\n \"\");\n\n static_assert(\n !folly::AllocatorHasDefaultObjectConstruct<TestAlloc1<S>, S, S>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<TestAlloc1<S>, S>::value, \"\");\n\n static_assert(\n !folly::AllocatorHasDefaultObjectConstruct<TestAlloc2<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc2<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc3<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc3<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc4<S>, S, S>::value,\n \"\");\n static_assert(\n folly::AllocatorHasDefaultObjectDestroy<TestAlloc4<S>, S>::value, \"\");\n\n static_assert(\n folly::AllocatorHasDefaultObjectConstruct<TestAlloc5<S>, S, S>::value,\n \"\");\n static_assert(\n !folly::AllocatorHasDefaultObjectDestroy<TestAlloc5<S>, S>::value, \"\");\n}\n\ntemplate <typename C>\nstatic void test_enable_shared_from_this(std::shared_ptr<C> sp) {\n ASSERT_EQ(1l, sp.use_count());\n\n \/\/ Test shared_from_this().\n std::shared_ptr<C> sp2 = sp->shared_from_this();\n ASSERT_EQ(sp, sp2);\n\n \/\/ Test weak_from_this().\n std::weak_ptr<C> wp = sp->weak_from_this();\n ASSERT_EQ(sp, wp.lock());\n sp.reset();\n sp2.reset();\n ASSERT_EQ(nullptr, wp.lock());\n\n \/\/ Test shared_from_this() and weak_from_this() on object not owned by a\n \/\/ shared_ptr. Undefined in C++14 but well-defined in C++17. Also known to\n \/\/ work with libstdc++ >= 20150123. Feel free to add other standard library\n \/\/ versions where the behavior is known.\n#if __cplusplus >= 201700L || __GLIBCXX__ >= 20150123L\n C stack_resident;\n ASSERT_THROW(stack_resident.shared_from_this(), std::bad_weak_ptr);\n ASSERT_TRUE(stack_resident.weak_from_this().expired());\n#endif\n}\n\nTEST(enable_shared_from_this, compatible_with_std_enable_shared_from_this) {\n \/\/ Compile-time compatibility.\n class C_std : public std::enable_shared_from_this<C_std> {};\n class C_folly : public folly::enable_shared_from_this<C_folly> {};\n static_assert(\n noexcept(std::declval<C_std>().shared_from_this()) ==\n noexcept(std::declval<C_folly>().shared_from_this()),\n \"\");\n static_assert(\n noexcept(std::declval<C_std const>().shared_from_this()) ==\n noexcept(std::declval<C_folly const>().shared_from_this()),\n \"\");\n static_assert(noexcept(std::declval<C_folly>().weak_from_this()), \"\");\n static_assert(noexcept(std::declval<C_folly const>().weak_from_this()), \"\");\n\n \/\/ Runtime compatibility.\n test_enable_shared_from_this(std::make_shared<C_folly>());\n test_enable_shared_from_this(std::make_shared<C_folly const>());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"gui\/preferencesmodel.h\"\n#include \"utilities\/qutils.h\"\n#include \"changebase.h\"\n#include \"upgrades.h\"\n#include \"upgrade.h\"\n#include \"log.h\"\n\nnamespace Modules\n{\n\nUpgrade::Upgrade()\n{\n\tconnect(this, &QQuickItem::parentChanged, this, &Upgrade::registerStep);\n}\n\nvoid Upgrade::applyUpgrade(const std::string & function, const Version & version, Json::Value & analysesJson, UpgradeMsgs & msgs, StepsTaken & stepsTaken)\n{\n\tif(function != fq(functionName()))\tthrow upgradeError(\"Wrong Upgrade being applied, was looking for function '\"\t+ function\t\t\t\t+ \"' but this upgrade is for: '\" + fq(functionName())\t\t+ \"'\");\n\tif(version\t!= fromVersion())\t\tthrow upgradeError(\"Wrong Upgrade being applied, was looking for version '\"\t\t+ version.asString()\t+ \"' but this upgrade is for: '\" + fromVersion().asString() + \"'\");\n\t\n\tStepTaken\tfromStep(\t\t{fq(module()),\tfq(functionName()),\t\tfromVersion()\t}),\n\t\t\t\taboutToStep(\t{fq(module()),\tfq(newFunctionName()),\ttoVersion()\t\t});\n\n\tstepsTaken.insert(fromStep); \/\/We want to remember where we come from\n\n\tif(stepsTaken.count(aboutToStep) > 0)\n\t\tthrow upgradeError(fq(\"Aborting upgrade because a loop was detected!\\n\\nIf \" +\ttoString() + \" is taken, eventually it is reached again.\\n\\nThis should definitely not happen, perhaps the module author of '\" + module() + \"' can be of assistance\"));\n\t\n\tanalysesJson[\"name\"]\t\t\t\t\t\t\t= fq(newFunctionName());\n\tanalysesJson[\"dynamicModule\"][\"analysisEntry\"]\t= fq(newFunctionName());\n\tanalysesJson[\"dynamicModule\"][\"moduleVersion\"]\t= toVersion().asString();\n\n\t\/\/No loop so far, lets apply some changes for this step\n\tfor(ChangeBase * change : _changes)\n\t\ttry\n\t\t{\n\t\t\tLog::log() << \"Checking if condition for change \" << change->toString() << \" is satisfied, \";\n\t\t\tif(change->conditionSatisfied(analysesJson[\"options\"]))\n\t\t\t{\n\t\t\t\tLog::log(false) << \"it is and applying the change!\" << std::endl;\n\t\t\t\tchange->applyUpgrade(analysesJson[\"options\"], msgs);\n\t\t\t}\n\t\t\telse\n\t\t\t\tLog::log(false) << \"it isn't and moving on.\" << std::endl;\n\t\t}\n\t\tcatch(upgradeError & error)\n\t\t{\n\t\t\t\/\/If we are not in developermode it would be better to keep going instead of crashing the whole upgradeprocess\n\t\t\tif(PreferencesModel::prefs()->developerMode())\n\t\t\t\tthrow error;\n\t\t\telse\n\t\t\t\tLog::log() << \"Change had a problem: \" << error.what() << std::endl;\n\t\t}\n}\n\nQString Upgrade::toString() \n{ \n\treturn \"Module '\" + module() + \"' from version '\" + fromVersionQ() + \"' to '\" + toVersionQ() + \"' for function '\" + functionName() + \"'\" + ( newFunctionName() == functionName() ? \"\" : \" being renamed to '\" + newFunctionName() + \"'\");\n}\n\nVersion Upgrade::fromVersion() const\n{\n\ttry\n\t{\n\t\treturn Version(fq(_fromVersion));\n\t}\n\tcatch(Version::encodingError & e)\n\t{\n\t\tthrow upgradeError(\"Incorrect from version: '\" + fq(_fromVersion) + \"' supplied to Upgrade...\");\n\t}\n}\n\nVersion Upgrade::toVersion() const\n{\n\ttry\n\t{\n\t\treturn Version(fq(_toVersion));\n\t}\n\tcatch(Version::encodingError & e)\n\t{\n\t\tthrow upgradeError(\"Incorrect to version: '\" + fq(_toVersion) + \"' supplied to Upgrade...\");\n\t}\n}\n\nQString Upgrade::module() const \n{\n\treturn _upgrades ? _upgrades->module() : \"???\";\n}\n\n\nvoid Upgrade::registerStep(QQuickItem * parent)\n{\n\tUpgrades * upgrades = dynamic_cast<Upgrades*>(parent);\n\t\n\tif(!upgrades && parent)\n\t\tthrow upgradeLoadError(fq(toString()), \"An Upgrade Item must always be a child of Upgrades\");\n\n\tif(upgrades != _upgrades)\n\t{\n\t\tif(_upgrades)\n\t\t\t_upgrades->removeStep(this);\n\n\t\t_upgrades = upgrades;\n\n\t\tif(_upgrades)\n\t\t\t_upgrades->addStep(this);\n\t}\n}\n\nUpgrade::~Upgrade()\n{\n\tif(_upgrades)\n\t\t_upgrades->removeStep(this);\n}\n\nvoid Upgrade::addChange(ChangeBase *change) \n{ \n\tfor(ChangeBase * c : _changes) \n\t\tif(c == change) return;\n\t\n\t_changes.push_back(change);\t\t\n}\n\nvoid Upgrade::removeChange(ChangeBase *change)\n{\n\tfor(size_t i=_changes.size(); i>0; i--)\n\t\tif(_changes[i-1] == change)\n\t\t\t_changes.erase(_changes.begin() + i - 1);\n}\n\nvoid Upgrade::setFromVersionQ(QString fromVersion)\n{\n\tif (_fromVersion == fromVersion)\n\t\treturn;\n\n\t_fromVersion = fromVersion;\n\temit fromVersionChanged();\n}\n\nvoid Upgrade::setToVersionQ(QString toVersion)\n{\n\tif (_toVersion == toVersion)\n\t\treturn;\n\n\t_toVersion = toVersion;\n\temit toVersionChanged();\n}\n\nvoid Upgrade::setFunctionName(QString functionName)\n{\n\tif (_functionName == functionName)\n\t\treturn;\n\n\t_functionName = functionName;\n\temit functionNameChanged(_functionName);\n}\n\nvoid Upgrade::setNewFunctionName(QString newFunctionName)\n{\n\tif (_newFunctionName == newFunctionName)\n\t\treturn;\n\n\t_newFunctionName = newFunctionName;\n\temit newFunctionNameChanged(_newFunctionName);\n}\n\n}\n<commit_msg>Fix version check in qml upgrader<commit_after>#include \"gui\/preferencesmodel.h\"\n#include \"utilities\/qutils.h\"\n#include \"changebase.h\"\n#include \"upgrades.h\"\n#include \"upgrade.h\"\n#include \"log.h\"\n\nnamespace Modules\n{\n\nUpgrade::Upgrade()\n{\n\tconnect(this, &QQuickItem::parentChanged, this, &Upgrade::registerStep);\n}\n\nvoid Upgrade::applyUpgrade(const std::string & function, const Version & version, Json::Value & analysesJson, UpgradeMsgs & msgs, StepsTaken & stepsTaken)\n{\n\tif(function != fq(functionName()))\tthrow upgradeError(fq(tr(\"Wrong Upgrade being applied, was looking for function '%1' but this upgrade is for: '%2'\").arg(tq(function)).arg(functionName())));\n\tif(version\t> fromVersion())\t\tthrow upgradeError(fq(tr(\"Wrong Upgrade being applied, was looking for version '%1' but this upgrade is for: '%2' or lower\").arg(tq(version.asString())).arg(tq(fromVersion().asString()))));\n\t\n\tStepTaken\tfromStep(\t\t{fq(module()),\tfq(functionName()),\t\tfromVersion()\t}),\n\t\t\t\taboutToStep(\t{fq(module()),\tfq(newFunctionName()),\ttoVersion()\t\t});\n\n\tstepsTaken.insert(fromStep); \/\/We want to remember where we come from\n\n\tif(stepsTaken.count(aboutToStep) > 0)\n\t\tthrow upgradeError(fq(tr(\"Aborting upgrade because a loop was detected!\\n\\nIf %1 is taken, eventually it is reached again.\\n\\nThis should definitely not happen, perhaps the module author of '%2' can be of assistance\").arg(toString()).arg(module())));\n\t\n\tanalysesJson[\"name\"]\t\t\t\t\t\t\t= fq(newFunctionName());\n\tanalysesJson[\"dynamicModule\"][\"analysisEntry\"]\t= fq(newFunctionName());\n\tanalysesJson[\"dynamicModule\"][\"moduleVersion\"]\t= toVersion().asString();\n\n\t\/\/No loop so far, lets apply some changes for this step\n\tfor(ChangeBase * change : _changes)\n\t\ttry\n\t\t{\n\t\t\tLog::log() << \"Checking if condition for change \" << change->toString() << \" is satisfied, \";\n\t\t\tif(change->conditionSatisfied(analysesJson[\"options\"]))\n\t\t\t{\n\t\t\t\tLog::log(false) << \"it is and applying the change!\" << std::endl;\n\t\t\t\tchange->applyUpgrade(analysesJson[\"options\"], msgs);\n\t\t\t}\n\t\t\telse\n\t\t\t\tLog::log(false) << \"it isn't and moving on.\" << std::endl;\n\t\t}\n\t\tcatch(upgradeError & error)\n\t\t{\n\t\t\t\/\/If we are not in developermode it would be better to keep going instead of crashing the whole upgradeprocess\n\t\t\tif(PreferencesModel::prefs()->developerMode())\n\t\t\t\tthrow error;\n\t\t\telse\n\t\t\t\tLog::log() << \"Change had a problem: \" << error.what() << std::endl;\n\t\t}\n}\n\nQString Upgrade::toString() \n{ \n\treturn \"Module '\" + module() + \"' from version '\" + fromVersionQ() + \"' to '\" + toVersionQ() + \"' for function '\" + functionName() + \"'\" + ( newFunctionName() == functionName() ? \"\" : \" being renamed to '\" + newFunctionName() + \"'\");\n}\n\nVersion Upgrade::fromVersion() const\n{\n\ttry\n\t{\n\t\treturn Version(fq(_fromVersion));\n\t}\n\tcatch(Version::encodingError & e)\n\t{\n\t\tthrow upgradeError(\"Incorrect from version: '\" + fq(_fromVersion) + \"' supplied to Upgrade...\");\n\t}\n}\n\nVersion Upgrade::toVersion() const\n{\n\ttry\n\t{\n\t\treturn Version(fq(_toVersion));\n\t}\n\tcatch(Version::encodingError & e)\n\t{\n\t\tthrow upgradeError(\"Incorrect to version: '\" + fq(_toVersion) + \"' supplied to Upgrade...\");\n\t}\n}\n\nQString Upgrade::module() const \n{\n\treturn _upgrades ? _upgrades->module() : \"???\";\n}\n\n\nvoid Upgrade::registerStep(QQuickItem * parent)\n{\n\tUpgrades * upgrades = dynamic_cast<Upgrades*>(parent);\n\t\n\tif(!upgrades && parent)\n\t\tthrow upgradeLoadError(fq(toString()), \"An Upgrade Item must always be a child of Upgrades\");\n\n\tif(upgrades != _upgrades)\n\t{\n\t\tif(_upgrades)\n\t\t\t_upgrades->removeStep(this);\n\n\t\t_upgrades = upgrades;\n\n\t\tif(_upgrades)\n\t\t\t_upgrades->addStep(this);\n\t}\n}\n\nUpgrade::~Upgrade()\n{\n\tif(_upgrades)\n\t\t_upgrades->removeStep(this);\n}\n\nvoid Upgrade::addChange(ChangeBase *change) \n{ \n\tfor(ChangeBase * c : _changes) \n\t\tif(c == change) return;\n\t\n\t_changes.push_back(change);\t\t\n}\n\nvoid Upgrade::removeChange(ChangeBase *change)\n{\n\tfor(size_t i=_changes.size(); i>0; i--)\n\t\tif(_changes[i-1] == change)\n\t\t\t_changes.erase(_changes.begin() + i - 1);\n}\n\nvoid Upgrade::setFromVersionQ(QString fromVersion)\n{\n\tif (_fromVersion == fromVersion)\n\t\treturn;\n\n\t_fromVersion = fromVersion;\n\temit fromVersionChanged();\n}\n\nvoid Upgrade::setToVersionQ(QString toVersion)\n{\n\tif (_toVersion == toVersion)\n\t\treturn;\n\n\t_toVersion = toVersion;\n\temit toVersionChanged();\n}\n\nvoid Upgrade::setFunctionName(QString functionName)\n{\n\tif (_functionName == functionName)\n\t\treturn;\n\n\t_functionName = functionName;\n\temit functionNameChanged(_functionName);\n}\n\nvoid Upgrade::setNewFunctionName(QString newFunctionName)\n{\n\tif (_newFunctionName == newFunctionName)\n\t\treturn;\n\n\t_newFunctionName = newFunctionName;\n\temit newFunctionNameChanged(_newFunctionName);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/extensions\/common\/xwalk_external_instance.h\"\n\n#include <string>\n#include \"base\/logging.h\"\n#include \"xwalk\/extensions\/common\/xwalk_external_extension.h\"\n#include \"xwalk\/extensions\/common\/xwalk_external_adapter.h\"\n\nnamespace xwalk {\nnamespace extensions {\n\nXWalkExternalInstance::XWalkExternalInstance(\n XWalkExternalExtension* extension, XW_Instance xw_instance)\n : xw_instance_(xw_instance),\n extension_(extension),\n instance_data_(NULL),\n is_handling_sync_msg_(false) {\n XWalkExternalAdapter::GetInstance()->RegisterInstance(this);\n XW_CreatedInstanceCallback callback = extension_->created_instance_callback_;\n if (callback)\n callback(xw_instance_);\n}\n\nXWalkExternalInstance::~XWalkExternalInstance() {\n XW_DestroyedInstanceCallback callback =\n extension_->destroyed_instance_callback_;\n if (callback)\n callback(xw_instance_);\n XWalkExternalAdapter::GetInstance()->UnregisterInstance(this);\n}\n\nvoid XWalkExternalInstance::HandleMessage(scoped_ptr<base::Value> msg) {\n XW_HandleMessageCallback callback = extension_->handle_msg_callback_;\n if (!callback) {\n LOG(WARNING) << \"Ignoring message sent for external extension '\"\n << extension_->name() << \"' which doesn't support it.\";\n return;\n }\n\n std::string string_msg;\n msg->GetAsString(&string_msg);\n callback(xw_instance_, string_msg.c_str());\n}\n\nvoid XWalkExternalInstance::HandleSyncMessage(scoped_ptr<base::Value> msg) {\n XW_HandleSyncMessageCallback callback = extension_->handle_sync_msg_callback_;\n if (!callback) {\n LOG(WARNING) << \"Ignoring sync message sent for external extension '\"\n << extension_->name() << \"' which doesn't support it.\";\n return;\n }\n\n std::string string_msg;\n msg->GetAsString(&string_msg);\n\n callback(xw_instance_, string_msg.c_str());\n}\n\nvoid XWalkExternalInstance::CoreSetInstanceData(void* data) {\n instance_data_ = data;\n}\n\nvoid* XWalkExternalInstance::CoreGetInstanceData() {\n return instance_data_;\n}\n\nvoid XWalkExternalInstance::MessagingPostMessage(const char* msg) {\n PostMessageToJS(scoped_ptr<base::Value>(new base::StringValue(msg)));\n}\n\nvoid XWalkExternalInstance::SyncMessagingSetSyncReply(const char* reply) {\n SendSyncReplyToJS(scoped_ptr<base::Value>(new base::StringValue(reply)));\n}\n\n} \/\/ namespace extensions\n} \/\/ namespace xwalk\n<commit_msg>extensions: Check GetString()'s return value.<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/extensions\/common\/xwalk_external_instance.h\"\n\n#include <string>\n#include \"base\/logging.h\"\n#include \"xwalk\/extensions\/common\/xwalk_external_extension.h\"\n#include \"xwalk\/extensions\/common\/xwalk_external_adapter.h\"\n\nnamespace xwalk {\nnamespace extensions {\n\nXWalkExternalInstance::XWalkExternalInstance(\n XWalkExternalExtension* extension, XW_Instance xw_instance)\n : xw_instance_(xw_instance),\n extension_(extension),\n instance_data_(NULL),\n is_handling_sync_msg_(false) {\n XWalkExternalAdapter::GetInstance()->RegisterInstance(this);\n XW_CreatedInstanceCallback callback = extension_->created_instance_callback_;\n if (callback)\n callback(xw_instance_);\n}\n\nXWalkExternalInstance::~XWalkExternalInstance() {\n XW_DestroyedInstanceCallback callback =\n extension_->destroyed_instance_callback_;\n if (callback)\n callback(xw_instance_);\n XWalkExternalAdapter::GetInstance()->UnregisterInstance(this);\n}\n\nvoid XWalkExternalInstance::HandleMessage(scoped_ptr<base::Value> msg) {\n XW_HandleMessageCallback callback = extension_->handle_msg_callback_;\n if (!callback) {\n LOG(WARNING) << \"Ignoring message sent for external extension '\"\n << extension_->name() << \"' which doesn't support it.\";\n return;\n }\n\n std::string string_msg;\n if (!msg->GetAsString(&string_msg)) {\n LOG(WARNING) << \"Failed to retrieve the message's value.\";\n return;\n }\n callback(xw_instance_, string_msg.c_str());\n}\n\nvoid XWalkExternalInstance::HandleSyncMessage(scoped_ptr<base::Value> msg) {\n XW_HandleSyncMessageCallback callback = extension_->handle_sync_msg_callback_;\n if (!callback) {\n LOG(WARNING) << \"Ignoring sync message sent for external extension '\"\n << extension_->name() << \"' which doesn't support it.\";\n return;\n }\n\n std::string string_msg;\n if (!msg->GetAsString(&string_msg)) {\n LOG(WARNING) << \"Failed to retrieve the sync message's value.\";\n return;\n }\n\n callback(xw_instance_, string_msg.c_str());\n}\n\nvoid XWalkExternalInstance::CoreSetInstanceData(void* data) {\n instance_data_ = data;\n}\n\nvoid* XWalkExternalInstance::CoreGetInstanceData() {\n return instance_data_;\n}\n\nvoid XWalkExternalInstance::MessagingPostMessage(const char* msg) {\n PostMessageToJS(scoped_ptr<base::Value>(new base::StringValue(msg)));\n}\n\nvoid XWalkExternalInstance::SyncMessagingSetSyncReply(const char* reply) {\n SendSyncReplyToJS(scoped_ptr<base::Value>(new base::StringValue(reply)));\n}\n\n} \/\/ namespace extensions\n} \/\/ namespace xwalk\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by alex on 09\/07\/2015.\n\/\/\n\n#include <stddef.h>\n#include <assert.h>\n#include <string.h>\n#include \"lzlib.h\"\n#include <vector>\n#include <stdio.h>\n\n#define CHUNK 16384\n\n\/* report a zlib or i\/o error *\/\nvoid zerr(int ret)\n{\n fputs(\"zpipe: \", stderr);\n switch (ret) {\n case Z_ERRNO:\n if (ferror(stdin))\n fputs(\"error reading stdin\\n\", stderr);\n if (ferror(stdout))\n fputs(\"error writing stdout\\n\", stderr);\n break;\n case Z_STREAM_ERROR:\n fputs(\"invalid compression level\\n\", stderr);\n break;\n case Z_DATA_ERROR:\n fputs(\"invalid or incomplete deflate data\\n\", stderr);\n break;\n case Z_MEM_ERROR:\n fputs(\"out of memory\\n\", stderr);\n break;\n case Z_VERSION_ERROR:\n fputs(\"zlib version mismatch!\\n\", stderr);\n default:break;\n }\n}\n\n\nvoid static compress(void) {\n\n}\n\n\/* Decompress data *\/\nstatic int _decompress(char *data, int data_size, std::vector<unsigned char> &buff) {\n int ret;\n unsigned have;\n z_stream strm;\n unsigned char in[CHUNK];\n unsigned char out[CHUNK];\n\n \/* allocate inflate state *\/\n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.avail_in = 0;\n strm.next_in = Z_NULL;\n\n ret = inflateInit(&strm);\n if (ret != Z_OK)\n return ret;\n\n \/* decompress until deflate stream ends or end of file *\/\n size_t remain = CHUNK;\n uInt chunk_size = 0;\n\n do {\n chunk_size = remain > data_size ? (size_t) data_size : remain;\n\n memcpy(in, data, chunk_size);\n strm.avail_in = chunk_size;\n\n data += chunk_size;\n data_size -= chunk_size;\n\n if (strm.avail_in == 0)\n break;\n strm.next_in = in;\n \/* run inflate() on input until output buffer not full *\/\n do {\n strm.avail_out = CHUNK;\n strm.next_out = out;\n\n ret = inflate(&strm, Z_NO_FLUSH);\n assert(ret != Z_STREAM_ERROR); \/* state not clobbered *\/\n\n switch (ret) {\n case Z_NEED_DICT:\n ret = Z_DATA_ERROR; \/* and fall through *\/\n case Z_DATA_ERROR:\n case Z_MEM_ERROR:\n (void)inflateEnd(&strm);\n return ret;\n default:break;\n }\n have = CHUNK - strm.avail_out;\n if (have > 0) {\n buff.insert(buff.end(), out, out + have);\n }\n } while (strm.avail_out == 0);\n\n \/* done when inflate() says it's done *\/\n } while (ret != Z_STREAM_END);\n\n buff.push_back('\\0'); \/\/ end of stream\n\n \/* clean up and return *\/\n (void)inflateEnd(&strm);\n return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;\n}\n\nvoid static decompress(void) {\n std::vector<unsigned char> buff;\n lua_Object obj = lua_getparam(1);\n\n if (!lua_isstring(obj)) {\n lua_error((char *) \"decompress: string required!\");\n }\n int data_size = lua_strlen(obj);\n char *data = lua_getstring(obj);\n\n int ret = _decompress(data, data_size, buff);\n if (ret != Z_OK) zerr(ret);\n\n lua_pushstring((char *) buff.data());\n}\n\nstatic struct luaL_reg lzlib[] = {\n {(char *) \"zlib_compress\", compress},\n {(char *) \"zlib_decompress\", decompress}\n};\n\n\nLUA_LIBRARY void lua_lzlibopen(lua_State *L) {\n lua_state = L;\n luaL_openlib(lzlib, (sizeof(lzlib) \/ sizeof(lzlib[0])));\n}<commit_msg>implemented function decompress.<commit_after>\/\/\n\/\/ Created by alex on 09\/07\/2015.\n\/\/\n\n#include <stddef.h>\n#include <assert.h>\n#include <string.h>\n#include \"lzlib.h\"\n#include <vector>\n#include <stdio.h>\n\n#define CHUNK 16384\n\n\/* report a zlib or i\/o error *\/\nvoid zerr(int ret) {\n fputs(\"zpipe: \", stderr);\n switch (ret) {\n case Z_ERRNO:\n if (ferror(stdin))\n fputs(\"error reading stdin\\n\", stderr);\n if (ferror(stdout))\n fputs(\"error writing stdout\\n\", stderr);\n break;\n case Z_STREAM_ERROR:\n fputs(\"invalid compression level\\n\", stderr);\n break;\n case Z_DATA_ERROR:\n fputs(\"invalid or incomplete deflate data\\n\", stderr);\n break;\n case Z_MEM_ERROR:\n fputs(\"out of memory\\n\", stderr);\n break;\n case Z_VERSION_ERROR:\n fputs(\"zlib version mismatch!\\n\", stderr);\n default:break;\n }\n}\n\nint _compress(char *data, std::vector<unsigned char> &buff, int level) {\n int ret, flush;\n unsigned have;\n z_stream strm;\n unsigned char in[CHUNK];\n unsigned char out[CHUNK];\n\n \/* allocate deflate state *\/\n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n\n ret = deflateInit(&strm, level);\n if (ret != Z_OK)\n return ret;\n\n \/* compress until end of file *\/\n size_t remain = CHUNK;\n uInt chunk_size = 0;\n int data_size = strlen(data);\n\n do {\n chunk_size = remain > data_size ? (size_t) data_size : remain;\n memcpy(in, data, chunk_size);\n strm.avail_in = chunk_size;\n data += chunk_size;\n\n flush = data[0] == '\\0' ? Z_FINISH : Z_NO_FLUSH;\n\n data_size -= chunk_size;\n strm.next_in = in;\n\n \/* run deflate() on input until output buffer not full, finish\n compression if all of source has been read in *\/\n do {\n strm.avail_out = CHUNK;\n strm.next_out = out;\n\n ret = deflate(&strm, flush); \/* no bad return value *\/\n assert(ret != Z_STREAM_ERROR); \/* state not clobbered *\/\n have = CHUNK - strm.avail_out;\n\n if (have > 0) {\n buff.insert(buff.end(), out, out + have);\n }\n } while (strm.avail_out == 0);\n assert(strm.avail_in == 0); \/* all input will be used *\/\n\n \/* done when last data in file processed *\/\n } while (flush != Z_FINISH);\n assert(ret == Z_STREAM_END); \/* stream will be complete *\/\n\n \/* clean up and return *\/\n (void)deflateEnd(&strm);\n return Z_OK;\n}\n\nvoid static compress(void) {\n char *data = luaL_check_string(1);\n if (!data[strlen(data)] == '\\0') {\n lua_error((char *) \"compress(eof): invalid string!\");\n }\n lua_Object level_Object = lua_getparam(1);\n int level = lua_isnumber(level_Object) ? (int) lua_getnumber(level_Object) : Z_DEFAULT_COMPRESSION;\n std::vector<unsigned char> buff;\n\n _compress(data, buff, level);\n lua_pushlstring((char *) buff.data(), (long) buff.size());\n\n}\n\n\/* Decompress data *\/\nstatic int _decompress(char *data, int data_size, std::vector<unsigned char> &buff) {\n int ret;\n unsigned have;\n z_stream strm;\n unsigned char in[CHUNK];\n unsigned char out[CHUNK];\n\n \/* allocate inflate state *\/\n strm.zalloc = Z_NULL;\n strm.zfree = Z_NULL;\n strm.opaque = Z_NULL;\n strm.avail_in = 0;\n strm.next_in = Z_NULL;\n\n ret = inflateInit(&strm);\n if (ret != Z_OK)\n return ret;\n\n \/* decompress until deflate stream ends or end of file *\/\n size_t remain = CHUNK;\n uInt chunk_size = 0;\n\n do {\n chunk_size = remain > data_size ? (size_t) data_size : remain;\n\n memcpy(in, data, chunk_size);\n strm.avail_in = chunk_size;\n\n data += chunk_size;\n data_size -= chunk_size;\n\n if (strm.avail_in == 0)\n break;\n strm.next_in = in;\n \/* run inflate() on input until output buffer not full *\/\n do {\n strm.avail_out = CHUNK;\n strm.next_out = out;\n\n ret = inflate(&strm, Z_NO_FLUSH);\n assert(ret != Z_STREAM_ERROR); \/* state not clobbered *\/\n\n switch (ret) {\n case Z_NEED_DICT:\n ret = Z_DATA_ERROR; \/* and fall through *\/\n case Z_DATA_ERROR:\n case Z_MEM_ERROR:\n (void)inflateEnd(&strm);\n return ret;\n default:break;\n }\n have = CHUNK - strm.avail_out;\n if (have > 0) {\n buff.insert(buff.end(), out, out + have);\n }\n } while (strm.avail_out == 0);\n\n \/* done when inflate() says it's done *\/\n } while (ret != Z_STREAM_END);\n\n buff.push_back('\\0'); \/\/ end of stream\n\n \/* clean up and return *\/\n (void)inflateEnd(&strm);\n return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;\n}\n\nvoid static decompress(void) {\n std::vector<unsigned char> buff;\n lua_Object obj = lua_getparam(1);\n\n if (!lua_isstring(obj)) {\n lua_error((char *) \"decompress: string required!\");\n }\n int data_size = lua_strlen(obj);\n char *data = lua_getstring(obj);\n\n int ret = _decompress(data, data_size, buff);\n if (ret != Z_OK) zerr(ret);\n\n lua_pushstring((char *) buff.data());\n}\n\nstatic struct luaL_reg lzlib[] = {\n {(char *) \"zlib_compress\", compress},\n {(char *) \"zlib_decompress\", decompress}\n};\n\n\nLUA_LIBRARY void lua_lzlibopen(lua_State *L) {\n lua_state = L;\n luaL_openlib(lzlib, (sizeof(lzlib) \/ sizeof(lzlib[0])));\n}<|endoftext|>"} {"text":"<commit_before>#include \"utility.hpp\"\n\n#include <sse\/runners\/sophos\/sophos_client_runner.hpp>\n#include <sse\/runners\/sophos\/sophos_server_runner.hpp>\n#include <sse\/schemes\/sophos\/sophos_client.hpp>\n#include <sse\/schemes\/sophos\/sophos_server.hpp>\n#include <sse\/schemes\/utils\/utils.hpp>\n\n#include <sse\/crypto\/utils.hpp>\n\n#include <grpc++\/impl\/codegen\/service_type.h>\n#include <grpc++\/server_builder.h>\n\n#include <condition_variable>\n#include <gtest\/gtest.h>\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <mutex>\n#include <thread>\n\n\nnamespace sse {\nnamespace sophos {\n\nclass SophosImpl\n{\npublic:\n explicit SophosImpl(std::string path);\n};\n\nnamespace test {\n\n#define SSE_SOPHOS_TEST_DIR \"test_sophos_runners\"\n\nconstexpr auto sophos_test_dir = SSE_SOPHOS_TEST_DIR;\nconstexpr auto server_db_path = SSE_SOPHOS_TEST_DIR \"\/server.db\";\nconstexpr auto client_db_path = SSE_SOPHOS_TEST_DIR \"\/client.db\";\n\nTEST(sophos_runner, insertion_search)\n{\n sse::test::cleanup_directory(sophos_test_dir);\n\n grpc::ServerBuilder builder;\n std::unique_ptr<grpc::Service> service;\n\n auto server = build_sophos_server(builder, server_db_path, false, service);\n\n \/\/ Get the in-process channel\n std::shared_ptr<grpc::Channel> channel\n = server->InProcessChannel(grpc::ChannelArguments());\n \/\/ Create the client\n std::unique_ptr<SophosClientRunner> client(\n new SophosClientRunner(channel, client_db_path));\n\n const std::map<std::string, std::list<uint64_t>> test_db\n = {{\"kw_1\", {0, 1}}, {\"kw_2\", {0}}, {\"kw_3\", {0}}};\n\n sse::test::insert_database(client, test_db);\n sse::test::test_search_correctness(client, test_db);\n\n server->Shutdown()\n}\n\n} \/\/ namespace test\n} \/\/ namespace sophos\n} \/\/ namespace sse\n<commit_msg>Fix a stupid typo<commit_after>#include \"utility.hpp\"\n\n#include <sse\/runners\/sophos\/sophos_client_runner.hpp>\n#include <sse\/runners\/sophos\/sophos_server_runner.hpp>\n#include <sse\/schemes\/sophos\/sophos_client.hpp>\n#include <sse\/schemes\/sophos\/sophos_server.hpp>\n#include <sse\/schemes\/utils\/utils.hpp>\n\n#include <sse\/crypto\/utils.hpp>\n\n#include <grpc++\/impl\/codegen\/service_type.h>\n#include <grpc++\/server_builder.h>\n\n#include <condition_variable>\n#include <gtest\/gtest.h>\n\n#include <algorithm>\n#include <fstream>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <mutex>\n#include <thread>\n\n\nnamespace sse {\nnamespace sophos {\n\nclass SophosImpl\n{\npublic:\n explicit SophosImpl(std::string path);\n};\n\nnamespace test {\n\n#define SSE_SOPHOS_TEST_DIR \"test_sophos_runners\"\n\nconstexpr auto sophos_test_dir = SSE_SOPHOS_TEST_DIR;\nconstexpr auto server_db_path = SSE_SOPHOS_TEST_DIR \"\/server.db\";\nconstexpr auto client_db_path = SSE_SOPHOS_TEST_DIR \"\/client.db\";\n\nTEST(sophos_runner, insertion_search)\n{\n sse::test::cleanup_directory(sophos_test_dir);\n\n grpc::ServerBuilder builder;\n std::unique_ptr<grpc::Service> service;\n\n auto server = build_sophos_server(builder, server_db_path, false, service);\n\n \/\/ Get the in-process channel\n std::shared_ptr<grpc::Channel> channel\n = server->InProcessChannel(grpc::ChannelArguments());\n \/\/ Create the client\n std::unique_ptr<SophosClientRunner> client(\n new SophosClientRunner(channel, client_db_path));\n\n const std::map<std::string, std::list<uint64_t>> test_db\n = {{\"kw_1\", {0, 1}}, {\"kw_2\", {0}}, {\"kw_3\", {0}}};\n\n sse::test::insert_database(client, test_db);\n sse::test::test_search_correctness(client, test_db);\n\n server->Shutdown();\n}\n\n} \/\/ namespace test\n} \/\/ namespace sophos\n} \/\/ namespace sse\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: rtattributehandler.hxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-08 23:10:45 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n#define FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n\n#ifndef FORMS_SOURCE_RICHTEXT_RTATTRIBUTES_HXX\n#include \"rtattributes.hxx\"\n#endif\n\n#ifndef _RTL_REF_HXX_\n#include <rtl\/ref.hxx>\n#endif\n\n#ifndef _SVX_SVXENUM_HXX\n#include <svx\/svxenum.hxx>\n#endif\n#ifndef _SVX_FRMDIR_HXX\n#include <svx\/frmdir.hxx>\n#endif\n\nclass SfxItemSet;\nclass SfxPoolItem;\nclass SfxItemPool;\n\/\/........................................................................\nnamespace frm\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= ReferenceBase\n \/\/====================================================================\n class ReferenceBase : public ::rtl::IReference\n {\n protected:\n oslInterlockedCount m_refCount;\n\n public:\n \/\/ IReference\n virtual oslInterlockedCount SAL_CALL acquire();\n virtual oslInterlockedCount SAL_CALL release();\n\n protected:\n virtual ~ReferenceBase();\n };\n\n \/\/====================================================================\n \/\/= IAttributeHandler\n \/\/====================================================================\n class IAttributeHandler : public ::rtl::IReference\n {\n public:\n virtual AttributeId getAttributeId( ) const = 0;\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const = 0;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const = 0;\n };\n\n \/\/====================================================================\n \/\/= AttributeHandler\n \/\/====================================================================\n class AttributeHandler :public ReferenceBase\n ,public IAttributeHandler\n {\n private:\n AttributeId m_nAttribute;\n WhichId m_nWhich;\n\n protected:\n AttributeId getAttribute() const { return m_nAttribute; }\n WhichId getWhich() const { return m_nWhich; }\n\n public:\n AttributeHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n \/\/ IAttributeHandler\n virtual AttributeId getAttributeId( ) const;\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const = 0;\n\n protected:\n \/\/\/ helper method calling implGetCheckState\n AttributeCheckState getCheckState( const SfxItemSet& _rAttribs ) const;\n\n \/\/\/ helper method putting an item into a set, respecting a script type\n void putItemForScript( SfxItemSet& _rAttribs, const SfxPoolItem& _rItem, ScriptType _nForScriptType ) const;\n\n \/\/ pseudo-abstract\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n\n \/\/ disambiguate IReference\n virtual oslInterlockedCount SAL_CALL acquire();\n virtual oslInterlockedCount SAL_CALL release();\n\n protected:\n virtual ~AttributeHandler();\n };\n\n \/\/====================================================================\n \/\/= AttributeHandlerFactory\n \/\/====================================================================\n class AttributeHandlerFactory\n {\n public:\n static ::rtl::Reference< IAttributeHandler > getHandlerFor( AttributeId _nAttributeId, const SfxItemPool& _rEditEnginePool );\n\n private:\n AttributeHandlerFactory(); \/\/ never implemented\n AttributeHandlerFactory( const AttributeHandlerFactory& ); \/\/ never implemented\n AttributeHandlerFactory& operator=( const AttributeHandlerFactory& ); \/\/ never implemented\n ~AttributeHandlerFactory(); \/\/ never implemented\n };\n\n \/\/====================================================================\n \/\/= ParaAlignmentHandler\n \/\/====================================================================\n class ParaAlignmentHandler : public AttributeHandler\n {\n private:\n SvxAdjust m_eAdjust;\n\n public:\n ParaAlignmentHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= LineSpacingHandler\n \/\/====================================================================\n class LineSpacingHandler : public AttributeHandler\n {\n private:\n USHORT m_nLineSpace;\n\n public:\n LineSpacingHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= EscapementHandler\n \/\/====================================================================\n class EscapementHandler : public AttributeHandler\n {\n private:\n SvxEscapement m_eEscapement;\n\n public:\n EscapementHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= SlotHandler\n \/\/====================================================================\n class SlotHandler : public AttributeHandler\n {\n private:\n bool m_bScriptDependent;\n\n public:\n SlotHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= BooleanHandler\n \/\/====================================================================\n class BooleanHandler : public AttributeHandler\n {\n public:\n BooleanHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= FontSizeHandler\n \/\/====================================================================\n class FontSizeHandler : public AttributeHandler\n {\n public:\n FontSizeHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= ParagraphDirectionHandler\n \/\/====================================================================\n class ParagraphDirectionHandler : public AttributeHandler\n {\n private:\n SvxFrameDirection m_eParagraphDirection;\n SvxAdjust m_eDefaultAdjustment;\n SvxAdjust m_eOppositeDefaultAdjustment;\n\n public:\n ParagraphDirectionHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n\/\/........................................................................\n} \/\/ namespace frm\n\/\/........................................................................\n\n#endif \/\/ FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.3.244); FILE MERGED 2008\/04\/01 15:16:40 thb 1.3.244.3: #i85898# Stripping all external header guards 2008\/04\/01 12:30:31 thb 1.3.244.2: #i85898# Stripping all external header guards 2008\/03\/31 13:11:42 rt 1.3.244.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: rtattributehandler.hxx,v $\n * $Revision: 1.4 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n#define FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n\n#include \"rtattributes.hxx\"\n#include <rtl\/ref.hxx>\n#include <svx\/svxenum.hxx>\n#include <svx\/frmdir.hxx>\n\nclass SfxItemSet;\nclass SfxPoolItem;\nclass SfxItemPool;\n\/\/........................................................................\nnamespace frm\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= ReferenceBase\n \/\/====================================================================\n class ReferenceBase : public ::rtl::IReference\n {\n protected:\n oslInterlockedCount m_refCount;\n\n public:\n \/\/ IReference\n virtual oslInterlockedCount SAL_CALL acquire();\n virtual oslInterlockedCount SAL_CALL release();\n\n protected:\n virtual ~ReferenceBase();\n };\n\n \/\/====================================================================\n \/\/= IAttributeHandler\n \/\/====================================================================\n class IAttributeHandler : public ::rtl::IReference\n {\n public:\n virtual AttributeId getAttributeId( ) const = 0;\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const = 0;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const = 0;\n };\n\n \/\/====================================================================\n \/\/= AttributeHandler\n \/\/====================================================================\n class AttributeHandler :public ReferenceBase\n ,public IAttributeHandler\n {\n private:\n AttributeId m_nAttribute;\n WhichId m_nWhich;\n\n protected:\n AttributeId getAttribute() const { return m_nAttribute; }\n WhichId getWhich() const { return m_nWhich; }\n\n public:\n AttributeHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n \/\/ IAttributeHandler\n virtual AttributeId getAttributeId( ) const;\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const = 0;\n\n protected:\n \/\/\/ helper method calling implGetCheckState\n AttributeCheckState getCheckState( const SfxItemSet& _rAttribs ) const;\n\n \/\/\/ helper method putting an item into a set, respecting a script type\n void putItemForScript( SfxItemSet& _rAttribs, const SfxPoolItem& _rItem, ScriptType _nForScriptType ) const;\n\n \/\/ pseudo-abstract\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n\n \/\/ disambiguate IReference\n virtual oslInterlockedCount SAL_CALL acquire();\n virtual oslInterlockedCount SAL_CALL release();\n\n protected:\n virtual ~AttributeHandler();\n };\n\n \/\/====================================================================\n \/\/= AttributeHandlerFactory\n \/\/====================================================================\n class AttributeHandlerFactory\n {\n public:\n static ::rtl::Reference< IAttributeHandler > getHandlerFor( AttributeId _nAttributeId, const SfxItemPool& _rEditEnginePool );\n\n private:\n AttributeHandlerFactory(); \/\/ never implemented\n AttributeHandlerFactory( const AttributeHandlerFactory& ); \/\/ never implemented\n AttributeHandlerFactory& operator=( const AttributeHandlerFactory& ); \/\/ never implemented\n ~AttributeHandlerFactory(); \/\/ never implemented\n };\n\n \/\/====================================================================\n \/\/= ParaAlignmentHandler\n \/\/====================================================================\n class ParaAlignmentHandler : public AttributeHandler\n {\n private:\n SvxAdjust m_eAdjust;\n\n public:\n ParaAlignmentHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= LineSpacingHandler\n \/\/====================================================================\n class LineSpacingHandler : public AttributeHandler\n {\n private:\n USHORT m_nLineSpace;\n\n public:\n LineSpacingHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= EscapementHandler\n \/\/====================================================================\n class EscapementHandler : public AttributeHandler\n {\n private:\n SvxEscapement m_eEscapement;\n\n public:\n EscapementHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= SlotHandler\n \/\/====================================================================\n class SlotHandler : public AttributeHandler\n {\n private:\n bool m_bScriptDependent;\n\n public:\n SlotHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= BooleanHandler\n \/\/====================================================================\n class BooleanHandler : public AttributeHandler\n {\n public:\n BooleanHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= FontSizeHandler\n \/\/====================================================================\n class FontSizeHandler : public AttributeHandler\n {\n public:\n FontSizeHandler( AttributeId _nAttributeId, WhichId _nWhichId );\n\n public:\n virtual AttributeState getState( const SfxItemSet& _rAttribs ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n \/\/====================================================================\n \/\/= ParagraphDirectionHandler\n \/\/====================================================================\n class ParagraphDirectionHandler : public AttributeHandler\n {\n private:\n SvxFrameDirection m_eParagraphDirection;\n SvxAdjust m_eDefaultAdjustment;\n SvxAdjust m_eOppositeDefaultAdjustment;\n\n public:\n ParagraphDirectionHandler( AttributeId _nAttributeId );\n\n public:\n virtual AttributeCheckState implGetCheckState( const SfxPoolItem& _rItem ) const;\n virtual void executeAttribute( const SfxItemSet& _rCurrentAttribs, SfxItemSet& _rNewAttribs, const SfxPoolItem* _pAdditionalArg, ScriptType _nForScriptType ) const;\n };\n\n\/\/........................................................................\n} \/\/ namespace frm\n\/\/........................................................................\n\n#endif \/\/ FORMS_SOURCE_COMPONENT_RTATTRIBUTEHANDLER_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\n#ifndef __FRAMEWORK_RECORDING_DISPATCHRECORDER_HXX_\n#define __FRAMEWORK_RECORDING_DISPATCHRECORDER_HXX_\n\n\/\/ own includes\n#ifndef __FRAMEWORK_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XINTERFACE_HXX_\n#include <macros\/xinterface.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XTYPEPROVIDER_HXX_\n#include <macros\/xtypeprovider.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XSERVICEINFO_HXX_\n#include <macros\/xserviceinfo.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_DEBUG_HXX_\n#include <macros\/debug.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XTYPEPROVIDER_HPP_\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHRECORDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchRecorder.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.HPP>\n#endif\n\n#ifndef _COM_SUN_STAR_UTIL_URL_HPP_\n#include <com\/sun\/star\/util\/URL.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HDL_\n#include <com\/sun\/star\/uno\/RuntimeException.hdl>\n#endif\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nnamespace framework{\n\nclass DispatchRecorder\n : private ThreadHelpBase\n , public css::lang::XTypeProvider\n , public css::lang::XServiceInfo\n , public css::frame::XDispatchRecorder\n , public ::cppu::OWeakObject\n{\n \/\/ private member\n private:\n css::uno::Reference< css::lang::XMultiServiceFactory > m_xSMGR ;\n ::rtl::OUStringBuffer m_aScriptBuffer;\n ::rtl::OUString m_sScript ;\n sal_Int32 m_nRecordingID ;\n\n \/\/ public interface\n public:\n DispatchRecorder( const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR );\n ~DispatchRecorder();\n\n \/\/ XInterface, XTypeProvider, XServiceInfo\n DECLARE_XINTERFACE\n DECLARE_XTYPEPROVIDER\n DECLARE_XSERVICEINFO\n\n \/\/ XDispatchRecorder\n virtual void SAL_CALL startRecording ( const css::uno::Reference< css::frame::XFrame >& xFrame ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL recordDispatch ( const css::util::URL& aURL, const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL recordDispatchAsComment( const css::util::URL& aURL, const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL endRecording () throw( css::uno::RuntimeException );\n virtual ::rtl::OUString SAL_CALL getRecordedMacro () throw( css::uno::RuntimeException );\n\n \/\/ private functions\n private:\n void SAL_CALL implts_recordMacro( const css::util::URL& aURL,\n const css::uno::Sequence< css::beans::PropertyValue >& lArguments,\n sal_Bool bAsComment );\n}; \/\/ class DispatcRecorder\n\n} \/\/ namespace framework\n\n#endif \/\/ define __FRAMEWORK...\n<commit_msg>#65293# corrected typo<commit_after>\n#ifndef __FRAMEWORK_RECORDING_DISPATCHRECORDER_HXX_\n#define __FRAMEWORK_RECORDING_DISPATCHRECORDER_HXX_\n\n\/\/ own includes\n#ifndef __FRAMEWORK_THREADHELP_THREADHELPBASE_HXX_\n#include <threadhelp\/threadhelpbase.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XINTERFACE_HXX_\n#include <macros\/xinterface.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XTYPEPROVIDER_HXX_\n#include <macros\/xtypeprovider.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_XSERVICEINFO_HXX_\n#include <macros\/xserviceinfo.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_DEBUG_HXX_\n#include <macros\/debug.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.hxx>\n#endif\n\n#ifndef __FRAMEWORK_GENERAL_H_\n#include <general.h>\n#endif\n\n#ifndef _RTL_USTRING_HXX_\n#include <rtl\/ustring.hxx>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XTYPEPROVIDER_HPP_\n#include <com\/sun\/star\/lang\/XTypeProvider.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_FRAME_XDISPATCHRECORDER_HPP_\n#include <com\/sun\/star\/frame\/XDispatchRecorder.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.HPP>\n#endif\n\n#ifndef _COM_SUN_STAR_UTIL_URL_HPP_\n#include <com\/sun\/star\/util\/URL.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_RUNTIMEEXCEPTION_HDL_\n#include <com\/sun\/star\/uno\/RuntimeException.hdl>\n#endif\n\n#ifndef _CPPUHELPER_WEAK_HXX_\n#include <cppuhelper\/weak.hxx>\n#endif\n\nnamespace framework{\n\nclass DispatchRecorder\n : private ThreadHelpBase\n , public css::lang::XTypeProvider\n , public css::lang::XServiceInfo\n , public css::frame::XDispatchRecorder\n , public ::cppu::OWeakObject\n{\n \/\/ private member\n private:\n css::uno::Reference< css::lang::XMultiServiceFactory > m_xSMGR ;\n ::rtl::OUStringBuffer m_aScriptBuffer;\n ::rtl::OUString m_sScript ;\n sal_Int32 m_nRecordingID ;\n\n \/\/ public interface\n public:\n DispatchRecorder( const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR );\n ~DispatchRecorder();\n\n \/\/ XInterface, XTypeProvider, XServiceInfo\n DECLARE_XINTERFACE\n DECLARE_XTYPEPROVIDER\n DECLARE_XSERVICEINFO\n\n \/\/ XDispatchRecorder\n virtual void SAL_CALL startRecording ( const css::uno::Reference< css::frame::XFrame >& xFrame ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL recordDispatch ( const css::util::URL& aURL, const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL recordDispatchAsComment( const css::util::URL& aURL, const css::uno::Sequence< css::beans::PropertyValue >& lArguments ) throw( css::uno::RuntimeException );\n virtual void SAL_CALL endRecording () throw( css::uno::RuntimeException );\n virtual ::rtl::OUString SAL_CALL getRecordedMacro () throw( css::uno::RuntimeException );\n\n \/\/ private functions\n private:\n void SAL_CALL implts_recordMacro( const css::util::URL& aURL,\n const css::uno::Sequence< css::beans::PropertyValue >& lArguments,\n sal_Bool bAsComment );\n}; \/\/ class DispatcRecorder\n\n} \/\/ namespace framework\n\n#endif \/\/ define __FRAMEWORK...\n<|endoftext|>"} {"text":"<commit_before>\n#include \"odrive_main.h\"\n\n\nController::Controller(Config_t& config) :\n config_(config)\n{\n update_filter_gains();\n}\n\nvoid Controller::reset() {\n pos_setpoint_ = 0.0f;\n vel_setpoint_ = 0.0f;\n vel_integrator_current_ = 0.0f;\n current_setpoint_ = 0.0f;\n}\n\nvoid Controller::set_error(Error_t error) {\n error_ |= error;\n axis_->error_ |= Axis::ERROR_CONTROLLER_FAILED;\n}\n\n\/\/--------------------------------\n\/\/ Command Handling\n\/\/--------------------------------\n\nvoid Controller::set_pos_setpoint(float pos_setpoint, float vel_feed_forward, float current_feed_forward) {\n pos_setpoint_ = pos_setpoint;\n vel_setpoint_ = vel_feed_forward;\n current_setpoint_ = current_feed_forward;\n config_.control_mode = CTRL_MODE_POSITION_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"POSITION_CONTROL %6.0f %3.3f %3.3f\\n\", pos_setpoint, vel_setpoint_, current_setpoint_);\n#endif\n}\n\nvoid Controller::set_vel_setpoint(float vel_setpoint, float current_feed_forward) {\n vel_setpoint_ = vel_setpoint;\n current_setpoint_ = current_feed_forward;\n config_.control_mode = CTRL_MODE_VELOCITY_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"VELOCITY_CONTROL %3.3f %3.3f\\n\", vel_setpoint_, motor->current_setpoint_);\n#endif\n}\n\nvoid Controller::set_current_setpoint(float current_setpoint) {\n current_setpoint_ = current_setpoint;\n config_.control_mode = CTRL_MODE_CURRENT_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"CURRENT_CONTROL %3.3f\\n\", current_setpoint_);\n#endif\n}\n\nvoid Controller::move_to_pos(float goal_point) {\n axis_->trap_.planTrapezoidal(goal_point, pos_setpoint_, vel_setpoint_,\n axis_->trap_.config_.vel_limit,\n axis_->trap_.config_.accel_limit,\n axis_->trap_.config_.decel_limit);\n traj_start_loop_count_ = axis_->loop_counter_;\n config_.control_mode = CTRL_MODE_TRAJECTORY_CONTROL;\n}\n\nvoid Controller::start_anticogging_calibration() {\n \/\/ Ensure the cogging map was correctly allocated earlier and that the motor is capable of calibrating\n if (anticogging_.cogging_map != NULL && axis_->error_ == Axis::ERROR_NONE) {\n anticogging_.calib_anticogging = true;\n }\n}\n\n\/*\n * This anti-cogging implementation iterates through each encoder position,\n * waits for zero velocity & position error,\n * then samples the current required to maintain that position.\n * \n * This holding current is added as a feedforward term in the control loop.\n *\/\nbool Controller::anticogging_calibration(float pos_estimate, float vel_estimate) {\n if (anticogging_.calib_anticogging && anticogging_.cogging_map != NULL) {\n float pos_err = anticogging_.index - pos_estimate;\n if (fabsf(pos_err) <= anticogging_.calib_pos_threshold &&\n fabsf(vel_estimate) < anticogging_.calib_vel_threshold) {\n anticogging_.cogging_map[anticogging_.index++] = vel_integrator_current_;\n }\n if (anticogging_.index < axis_->encoder_.config_.cpr) { \/\/ TODO: remove the dependency on encoder CPR\n set_pos_setpoint(anticogging_.index, 0.0f, 0.0f);\n return false;\n } else {\n anticogging_.index = 0;\n set_pos_setpoint(0.0f, 0.0f, 0.0f); \/\/ Send the motor home\n anticogging_.use_anticogging = true; \/\/ We're good to go, enable anti-cogging\n anticogging_.calib_anticogging = false;\n return true;\n }\n }\n return false;\n}\n\nvoid Controller::update_filter_gains() {\n input_filter_kp_ = 2.0f * config_.input_filter_bandwidth; \/\/ basic conversion to discrete time\n input_filter_ki_ = 0.25f * (input_filter_kp_ * input_filter_kp_); \/\/ Critically damped\n\n \/\/ Check that we don't get problems with discrete time approximation\n if (!(current_meas_period * input_filter_kp_ < 1.0f)) {\n set_error(ERROR_UNSTABLE_GAIN);\n }\n}\n\nbool Controller::update(float pos_estimate, float vel_estimate, float* current_setpoint_output) {\n \/\/ Only runs if anticogging_.calib_anticogging is true; non-blocking\n anticogging_calibration(pos_estimate, vel_estimate);\n float anticogging_pos = pos_estimate;\n\n \/\/ Update inputs\n switch (config_.input_mode) {\n case INPUT_MODE_INACTIVE: {\n \/\/ do nothing\n } break;\n case INPUT_MODE_PASSTHROUGH: {\n pos_setpoint_ = input_pos_;\n vel_setpoint_ = input_vel_;\n current_setpoint_ = input_current_;\n } break;\n case INPUT_MODE_VEL_RAMP: {\n float max_step_size = current_meas_period * config_.vel_ramp_rate;\n float full_step = input_vel_ - vel_setpoint_;\n float step;\n if (fabsf(full_step) > max_step_size) {\n step = std::copysignf(max_step_size, full_step);\n } else {\n step = full_step;\n }\n vel_setpoint_ += step;\n current_setpoint_ = step \/ current_meas_period * config_.inertia;\n } break;\n case INPUT_MODE_POS_FILTER: {\n \/\/ 2nd order pos tracking filter\n pos_setpoint_ += current_meas_period * vel_setpoint_; \/\/ Integrate vel\n float delta_pos = input_pos_ - pos_setpoint_; \/\/ Pos error\n pos_setpoint_ += current_meas_period * input_filter_kp_ * delta_pos; \/\/ Kp\n float accel = input_filter_ki_ * delta_pos; \/\/ Ki\n vel_setpoint_ += current_meas_period * accel; \/\/ delta vel\n current_setpoint_ = accel * config_.inertia; \/\/ Accel\n } break;\n \/\/ case INPUT_MODE_MIX_CHANNELS: {\n \/\/ \/\/ NOT YET IMPLEMENTED\n \/\/ } break;\n default: {\n set_error(ERROR_INVALID_INPUT_MODE);\n return false;\n }\n }\n\n \/\/ Trajectory control\n if (config_.control_mode == CTRL_MODE_TRAJECTORY_CONTROL) {\n \/\/ Note: uint32_t loop count delta is OK across overflow\n \/\/ Beware of negative deltas, as they will not be well behaved due to uint!\n float t = (axis_->loop_counter_ - traj_start_loop_count_) * current_meas_period;\n if (t > axis_->trap_.Tf_) {\n \/\/ Drop into position control mode when done to avoid problems on loop counter delta overflow\n config_.control_mode = CTRL_MODE_POSITION_CONTROL;\n \/\/ pos_setpoint already set by trajectory\n vel_setpoint_ = 0.0f;\n current_setpoint_ = 0.0f;\n } else {\n TrapezoidalTrajectory::Step_t traj_step = axis_->trap_.eval(t);\n pos_setpoint_ = traj_step.Y;\n vel_setpoint_ = traj_step.Yd;\n current_setpoint_ = traj_step.Ydd * config_.inertia;\n }\n anticogging_pos = pos_setpoint_; \/\/ FF the position setpoint instead of the pos_estimate\n }\n\n \/\/ Position control\n \/\/ TODO Decide if we want to use encoder or pll position here\n float vel_des = vel_setpoint_;\n if (config_.control_mode >= CTRL_MODE_POSITION_CONTROL) {\n float pos_err;\n if (config_.setpoints_in_cpr) {\n \/\/ TODO this breaks the semantics that estimates come in on the arguments.\n \/\/ It's probably better to call a get_estimate that will arbitrate (enc vs sensorless) instead.\n float cpr = (float)(axis_->encoder_.config_.cpr);\n \/\/ Keep pos setpoint from drifting\n pos_setpoint_ = fmodf_pos(pos_setpoint_, cpr);\n \/\/ Circular delta\n pos_err = pos_setpoint_ - axis_->encoder_.pos_cpr_;\n pos_err = wrap_pm(pos_err, 0.5f * cpr);\n } else {\n pos_err = pos_setpoint_ - pos_estimate;\n }\n vel_des += config_.pos_gain * pos_err;\n }\n\n \/\/ Velocity limiting\n float vel_lim = config_.vel_limit;\n if (vel_des > vel_lim) vel_des = vel_lim;\n if (vel_des < -vel_lim) vel_des = -vel_lim;\n\n \/\/ Check for overspeed fault (done in this module (controller) for cohesion with vel_lim)\n if (config_.vel_limit_tolerance > 0.0f) { \/\/ 0.0f to disable\n if (fabsf(vel_estimate) > config_.vel_limit_tolerance * vel_lim) {\n set_error(ERROR_OVERSPEED);\n return false;\n }\n }\n\n \/\/ Velocity control\n float Iq = current_setpoint_;\n\n \/\/ Anti-cogging is enabled after calibration\n \/\/ We get the current position and apply a current feed-forward\n \/\/ ensuring that we handle negative encoder positions properly (-1 == motor->encoder.encoder_cpr - 1)\n if (anticogging_.use_anticogging) {\n Iq += anticogging_.cogging_map[mod(static_cast<int>(anticogging_pos), axis_->encoder_.config_.cpr)];\n }\n\n float v_err = vel_des - vel_estimate;\n if (config_.control_mode >= CTRL_MODE_VELOCITY_CONTROL) {\n Iq += config_.vel_gain * v_err;\n }\n\n \/\/ Velocity integral action before limiting\n Iq += vel_integrator_current_;\n\n \/\/ Current limiting\n float Ilim = std::min(axis_->motor_.config_.current_lim, axis_->motor_.current_control_.max_allowed_current);\n bool limited = false;\n if (Iq > Ilim) {\n limited = true;\n Iq = Ilim;\n }\n if (Iq < -Ilim) {\n limited = true;\n Iq = -Ilim;\n }\n\n \/\/ Velocity integrator (behaviour dependent on limiting)\n if (config_.control_mode < CTRL_MODE_VELOCITY_CONTROL) {\n \/\/ reset integral if not in use\n vel_integrator_current_ = 0.0f;\n } else {\n if (limited) {\n \/\/ TODO make decayfactor configurable\n vel_integrator_current_ *= 0.99f;\n } else {\n vel_integrator_current_ += (config_.vel_integrator_gain * current_meas_period) * v_err;\n }\n }\n\n if (current_setpoint_output) *current_setpoint_output = Iq;\n return true;\n}\n<commit_msg>mass simulation style 2nd order filter works great<commit_after>\n#include \"odrive_main.h\"\n\n\nController::Controller(Config_t& config) :\n config_(config)\n{\n update_filter_gains();\n}\n\nvoid Controller::reset() {\n pos_setpoint_ = 0.0f;\n vel_setpoint_ = 0.0f;\n vel_integrator_current_ = 0.0f;\n current_setpoint_ = 0.0f;\n}\n\nvoid Controller::set_error(Error_t error) {\n error_ |= error;\n axis_->error_ |= Axis::ERROR_CONTROLLER_FAILED;\n}\n\n\/\/--------------------------------\n\/\/ Command Handling\n\/\/--------------------------------\n\nvoid Controller::set_pos_setpoint(float pos_setpoint, float vel_feed_forward, float current_feed_forward) {\n pos_setpoint_ = pos_setpoint;\n vel_setpoint_ = vel_feed_forward;\n current_setpoint_ = current_feed_forward;\n config_.control_mode = CTRL_MODE_POSITION_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"POSITION_CONTROL %6.0f %3.3f %3.3f\\n\", pos_setpoint, vel_setpoint_, current_setpoint_);\n#endif\n}\n\nvoid Controller::set_vel_setpoint(float vel_setpoint, float current_feed_forward) {\n vel_setpoint_ = vel_setpoint;\n current_setpoint_ = current_feed_forward;\n config_.control_mode = CTRL_MODE_VELOCITY_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"VELOCITY_CONTROL %3.3f %3.3f\\n\", vel_setpoint_, motor->current_setpoint_);\n#endif\n}\n\nvoid Controller::set_current_setpoint(float current_setpoint) {\n current_setpoint_ = current_setpoint;\n config_.control_mode = CTRL_MODE_CURRENT_CONTROL;\n#ifdef DEBUG_PRINT\n printf(\"CURRENT_CONTROL %3.3f\\n\", current_setpoint_);\n#endif\n}\n\nvoid Controller::move_to_pos(float goal_point) {\n axis_->trap_.planTrapezoidal(goal_point, pos_setpoint_, vel_setpoint_,\n axis_->trap_.config_.vel_limit,\n axis_->trap_.config_.accel_limit,\n axis_->trap_.config_.decel_limit);\n traj_start_loop_count_ = axis_->loop_counter_;\n config_.control_mode = CTRL_MODE_TRAJECTORY_CONTROL;\n}\n\nvoid Controller::start_anticogging_calibration() {\n \/\/ Ensure the cogging map was correctly allocated earlier and that the motor is capable of calibrating\n if (anticogging_.cogging_map != NULL && axis_->error_ == Axis::ERROR_NONE) {\n anticogging_.calib_anticogging = true;\n }\n}\n\n\/*\n * This anti-cogging implementation iterates through each encoder position,\n * waits for zero velocity & position error,\n * then samples the current required to maintain that position.\n * \n * This holding current is added as a feedforward term in the control loop.\n *\/\nbool Controller::anticogging_calibration(float pos_estimate, float vel_estimate) {\n if (anticogging_.calib_anticogging && anticogging_.cogging_map != NULL) {\n float pos_err = anticogging_.index - pos_estimate;\n if (fabsf(pos_err) <= anticogging_.calib_pos_threshold &&\n fabsf(vel_estimate) < anticogging_.calib_vel_threshold) {\n anticogging_.cogging_map[anticogging_.index++] = vel_integrator_current_;\n }\n if (anticogging_.index < axis_->encoder_.config_.cpr) { \/\/ TODO: remove the dependency on encoder CPR\n set_pos_setpoint(anticogging_.index, 0.0f, 0.0f);\n return false;\n } else {\n anticogging_.index = 0;\n set_pos_setpoint(0.0f, 0.0f, 0.0f); \/\/ Send the motor home\n anticogging_.use_anticogging = true; \/\/ We're good to go, enable anti-cogging\n anticogging_.calib_anticogging = false;\n return true;\n }\n }\n return false;\n}\n\nvoid Controller::update_filter_gains() {\n input_filter_ki_ = 2.0f * config_.input_filter_bandwidth; \/\/ basic conversion to discrete time\n input_filter_kp_ = 0.25f * (input_filter_ki_ * input_filter_ki_); \/\/ Critically damped\n}\n\nbool Controller::update(float pos_estimate, float vel_estimate, float* current_setpoint_output) {\n \/\/ Only runs if anticogging_.calib_anticogging is true; non-blocking\n anticogging_calibration(pos_estimate, vel_estimate);\n float anticogging_pos = pos_estimate;\n\n \/\/ Update inputs\n switch (config_.input_mode) {\n case INPUT_MODE_INACTIVE: {\n \/\/ do nothing\n } break;\n case INPUT_MODE_PASSTHROUGH: {\n pos_setpoint_ = input_pos_;\n vel_setpoint_ = input_vel_;\n current_setpoint_ = input_current_;\n } break;\n case INPUT_MODE_VEL_RAMP: {\n float max_step_size = current_meas_period * config_.vel_ramp_rate;\n float full_step = input_vel_ - vel_setpoint_;\n float step;\n if (fabsf(full_step) > max_step_size) {\n step = std::copysignf(max_step_size, full_step);\n } else {\n step = full_step;\n }\n vel_setpoint_ += step;\n current_setpoint_ = step \/ current_meas_period * config_.inertia;\n } break;\n case INPUT_MODE_POS_FILTER: {\n \/\/ 2nd order pos tracking filter\n pos_setpoint_ += current_meas_period * vel_setpoint_; \/\/ Delta pos\n float delta_pos = input_pos_ - pos_setpoint_; \/\/ Pos error\n float delta_vel = input_vel_ - vel_setpoint_; \/\/ Vel error\n float accel = input_filter_kp_*delta_pos + input_filter_ki_*delta_vel; \/\/ Feedback\n vel_setpoint_ += current_meas_period * accel; \/\/ delta vel\n current_setpoint_ = accel * config_.inertia; \/\/ Accel\n } break;\n \/\/ case INPUT_MODE_MIX_CHANNELS: {\n \/\/ \/\/ NOT YET IMPLEMENTED\n \/\/ } break;\n default: {\n set_error(ERROR_INVALID_INPUT_MODE);\n return false;\n }\n }\n\n \/\/ Trajectory control\n if (config_.control_mode == CTRL_MODE_TRAJECTORY_CONTROL) {\n \/\/ Note: uint32_t loop count delta is OK across overflow\n \/\/ Beware of negative deltas, as they will not be well behaved due to uint!\n float t = (axis_->loop_counter_ - traj_start_loop_count_) * current_meas_period;\n if (t > axis_->trap_.Tf_) {\n \/\/ Drop into position control mode when done to avoid problems on loop counter delta overflow\n config_.control_mode = CTRL_MODE_POSITION_CONTROL;\n \/\/ pos_setpoint already set by trajectory\n vel_setpoint_ = 0.0f;\n current_setpoint_ = 0.0f;\n } else {\n TrapezoidalTrajectory::Step_t traj_step = axis_->trap_.eval(t);\n pos_setpoint_ = traj_step.Y;\n vel_setpoint_ = traj_step.Yd;\n current_setpoint_ = traj_step.Ydd * config_.inertia;\n }\n anticogging_pos = pos_setpoint_; \/\/ FF the position setpoint instead of the pos_estimate\n }\n\n \/\/ Position control\n \/\/ TODO Decide if we want to use encoder or pll position here\n float vel_des = vel_setpoint_;\n if (config_.control_mode >= CTRL_MODE_POSITION_CONTROL) {\n float pos_err;\n if (config_.setpoints_in_cpr) {\n \/\/ TODO this breaks the semantics that estimates come in on the arguments.\n \/\/ It's probably better to call a get_estimate that will arbitrate (enc vs sensorless) instead.\n float cpr = (float)(axis_->encoder_.config_.cpr);\n \/\/ Keep pos setpoint from drifting\n pos_setpoint_ = fmodf_pos(pos_setpoint_, cpr);\n \/\/ Circular delta\n pos_err = pos_setpoint_ - axis_->encoder_.pos_cpr_;\n pos_err = wrap_pm(pos_err, 0.5f * cpr);\n } else {\n pos_err = pos_setpoint_ - pos_estimate;\n }\n vel_des += config_.pos_gain * pos_err;\n }\n\n \/\/ Velocity limiting\n float vel_lim = config_.vel_limit;\n if (vel_des > vel_lim) vel_des = vel_lim;\n if (vel_des < -vel_lim) vel_des = -vel_lim;\n\n \/\/ Check for overspeed fault (done in this module (controller) for cohesion with vel_lim)\n if (config_.vel_limit_tolerance > 0.0f) { \/\/ 0.0f to disable\n if (fabsf(vel_estimate) > config_.vel_limit_tolerance * vel_lim) {\n set_error(ERROR_OVERSPEED);\n return false;\n }\n }\n\n \/\/ Velocity control\n float Iq = current_setpoint_;\n\n \/\/ Anti-cogging is enabled after calibration\n \/\/ We get the current position and apply a current feed-forward\n \/\/ ensuring that we handle negative encoder positions properly (-1 == motor->encoder.encoder_cpr - 1)\n if (anticogging_.use_anticogging) {\n Iq += anticogging_.cogging_map[mod(static_cast<int>(anticogging_pos), axis_->encoder_.config_.cpr)];\n }\n\n float v_err = vel_des - vel_estimate;\n if (config_.control_mode >= CTRL_MODE_VELOCITY_CONTROL) {\n Iq += config_.vel_gain * v_err;\n }\n\n \/\/ Velocity integral action before limiting\n Iq += vel_integrator_current_;\n\n \/\/ Current limiting\n float Ilim = std::min(axis_->motor_.config_.current_lim, axis_->motor_.current_control_.max_allowed_current);\n bool limited = false;\n if (Iq > Ilim) {\n limited = true;\n Iq = Ilim;\n }\n if (Iq < -Ilim) {\n limited = true;\n Iq = -Ilim;\n }\n\n \/\/ Velocity integrator (behaviour dependent on limiting)\n if (config_.control_mode < CTRL_MODE_VELOCITY_CONTROL) {\n \/\/ reset integral if not in use\n vel_integrator_current_ = 0.0f;\n } else {\n if (limited) {\n \/\/ TODO make decayfactor configurable\n vel_integrator_current_ *= 0.99f;\n } else {\n vel_integrator_current_ += (config_.vel_integrator_gain * current_meas_period) * v_err;\n }\n }\n\n if (current_setpoint_output) *current_setpoint_output = Iq;\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: HStorageMap.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: kz $ $Date: 2005-01-21 16:40:13 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the License); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an AS IS basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Ocke Janssen\n *\n *\n ************************************************************************\/\n#include \"hsqldb\/HStorageMap.hxx\"\n\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n\/\/........................................................................\nnamespace connectivity\n{\n\/\/........................................................................\n namespace hsqldb\n {\n \/\/........................................................................\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::com::sun::star::embed;\n using namespace ::com::sun::star::io;\n\n#define ThrowException(env, type, msg) { \\\n env->ThrowNew(env->FindClass(type), msg); }\n\n\n StreamHelper::StreamHelper(const Reference< XStream>& _xStream)\n : m_xStream(_xStream)\n {\n }\n \/\/ -----------------------------------------------------------------------------\n StreamHelper::~StreamHelper()\n {\n try\n {\n if ( m_xInputStream.is() )\n {\n m_xInputStream->closeInput();\n m_xInputStream = NULL;\n }\n if ( m_xOutputStream.is() )\n {\n m_xOutputStream->closeOutput();\n try\n {\n ::comphelper::disposeComponent(m_xOutputStream);\n }\n catch(const Exception& e)\n {\n e;\n OSL_ENSURE(0,\"Could not dispose OutputStream\");\n }\n m_xOutputStream = NULL;\n }\n m_xStream = NULL;\n m_xSeek = NULL;\n }\n catch(Exception& )\n {\n OSL_ENSURE(0,\"Exception catched!\");\n }\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XInputStream> StreamHelper::getInputStream()\n {\n if ( !m_xInputStream.is() )\n m_xInputStream = m_xStream->getInputStream();\n return m_xInputStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XOutputStream> StreamHelper::getOutputStream()\n {\n if ( !m_xOutputStream.is() )\n m_xOutputStream = m_xStream->getOutputStream();\n return m_xOutputStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XStream> StreamHelper::getStream()\n {\n return m_xStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XSeekable> StreamHelper::getSeek()\n {\n if ( !m_xSeek.is() )\n m_xSeek.set(m_xStream,UNO_QUERY);\n return m_xSeek;\n }\n \/\/ -----------------------------------------------------------------------------\n TStorages& lcl_getStorageMap()\n {\n static TStorages s_aMap;\n return s_aMap;\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString lcl_getNextCount()\n {\n static sal_Int32 s_nCount = 0;\n return ::rtl::OUString::valueOf(s_nCount++);\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::removeURLPrefix(const ::rtl::OUString& _sURL)\n {\n ::rtl::OUString sRet = _sURL;\n#if defined(WIN) || defined(WNT)\n sal_Int32 nIndex = sRet.lastIndexOf('\\\\');\n#else\n sal_Int32 nIndex = sRet.lastIndexOf('\/');\n#endif\n if ( nIndex != -1 )\n {\n sRet = _sURL.copy(nIndex+1);\n }\n return sRet;\n\n }\n \/*****************************************************************************\/\n \/* convert jstring to rtl_uString *\/\n\n ::rtl::OUString StorageContainer::jstring2ustring(JNIEnv * env, jstring jstr)\n {\n const char * cstr;\n rtl_uString * ustr = NULL;\n cstr = env->GetStringUTFChars(jstr, NULL);\n if (JNI_FALSE != env->ExceptionCheck())\n {\n env->ExceptionClear();\n OSL_ENSURE(0,\"ExceptionClear\");\n }\n rtl_uString_newFromAscii(&ustr, cstr);\n env->ReleaseStringUTFChars(jstr, cstr);\n if (JNI_FALSE != env->ExceptionCheck())\n {\n env->ExceptionClear();\n OSL_ENSURE(0,\"ExceptionClear\");\n }\n return ustr ? ::rtl::OUString(ustr,SAL_NO_ACQUIRE) : ::rtl::OUString();\n }\n\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::registerStorage(const Reference< XStorage>& _xStorage,const ::rtl::OUString& _sURL)\n {\n OSL_ENSURE(_xStorage.is(),\"Storage is NULL!\");\n TStorages& rMap = lcl_getStorageMap();\n \/\/ check if the storage is already in our map\n TStorages::iterator aFind = ::std::find_if(rMap.begin(),rMap.end(),\n ::std::compose1(\n ::std::bind2nd(::std::equal_to<Reference<XStorage> >(),_xStorage)\n ,::std::compose1(::std::select1st<TStorages::mapped_type>(),::std::select2nd<TStorages::value_type>()))\n );\n if ( aFind == rMap.end() )\n {\n aFind = rMap.insert(TStorages::value_type(lcl_getNextCount(),TStorages::mapped_type(_xStorage,TStreamMap()))).first;\n }\n\n return aFind->first;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XStorage> StorageContainer::getRegisteredStorage(const ::rtl::OUString& _sKey)\n {\n Reference< XStorage> xReturn;\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(_sKey);\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n xReturn = aFind->second.first;\n\n return xReturn;\n }\n \/\/ -----------------------------------------------------------------------------\n void StorageContainer::revokeStorage(const ::rtl::OUString& _sKey)\n {\n TStorages& rMap = lcl_getStorageMap();\n rMap.erase(_sKey);\n }\n \/\/ -----------------------------------------------------------------------------\n TStreamMap::mapped_type StorageContainer::registerStream(JNIEnv * env,jstring name, jstring key,sal_Int32 _nMode)\n {\n TStreamMap::mapped_type pHelper;\n TStorages& rMap = lcl_getStorageMap();\n ::rtl::OUString sKey = jstring2ustring(env,key);\n TStorages::iterator aFind = rMap.find(sKey);\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n {\n Reference< XStorage> xStorage = StorageContainer::getRegisteredStorage(sKey);\n OSL_ENSURE(xStorage.is(),\"No Storage available!\");\n if ( xStorage.is() )\n {\n ::rtl::OUString sName = removeURLPrefix(jstring2ustring(env,name));\n TStreamMap::iterator aStreamFind = aFind->second.second.find(sName);\n OSL_ENSURE( aStreamFind == aFind->second.second.end(),\"A Stream was already registered for this object!\");\n if ( aStreamFind != aFind->second.second.end() )\n {\n pHelper = aStreamFind->second;\n }\n else\n {\n try\n {\n pHelper.reset(new StreamHelper(xStorage->openStreamElement(sName,_nMode)));\n aFind->second.second.insert(TStreamMap::value_type(sName,pHelper));\n }\n catch(Exception& e)\n {\n OSL_ENSURE(0,\"Exception catched!\");\n if (JNI_FALSE != env->ExceptionCheck())\n env->ExceptionClear();\n ::rtl::OString cstr( ::rtl::OUStringToOString(e.Message, RTL_TEXTENCODING_JAVA_UTF8 ) );\n OSL_TRACE( __FILE__\": forwarding Exception: %s\", cstr.getStr() );\n ThrowException( env,\n \"java\/io\/IOException\",\n cstr.getStr());\n }\n }\n }\n }\n return pHelper;\n }\n \/\/ -----------------------------------------------------------------------------\n void StorageContainer::revokeStream( JNIEnv * env,jstring name, jstring key)\n {\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(jstring2ustring(env,key));\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n aFind->second.second.erase(removeURLPrefix(jstring2ustring(env,name)));\n }\n \/\/ -----------------------------------------------------------------------------\n TStreamMap::mapped_type StorageContainer::getRegisteredStream( JNIEnv * env,jstring name, jstring key)\n {\n TStreamMap::mapped_type pRet;\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(jstring2ustring(env,key));\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n {\n TStreamMap::iterator aStreamFind = aFind->second.second.find(removeURLPrefix(jstring2ustring(env,name)));\n if ( aStreamFind != aFind->second.second.end() )\n pRet = aStreamFind->second;\n }\n\n return pRet;\n }\n \/\/ -----------------------------------------------------------------------------\n \/\/........................................................................\n } \/\/ namespace hsqldb\n \/\/........................................................................\n\/\/........................................................................\n}\n\/\/ namespace connectivity\n\/\/........................................................................\n\n<commit_msg>INTEGRATION: CWS hsqldb2 (1.2.20); FILE MERGED 2005\/01\/28 12:21:54 oj 1.2.20.3: #i39922# new interfaces in hsqldb and some debug info 2005\/01\/25 08:42:51 oj 1.2.20.2: #i39922# correct stream handling 2005\/01\/19 07:03:28 oj 1.2.20.1: #i39922# remove db from stream name<commit_after>\/*************************************************************************\n *\n * $RCSfile: HStorageMap.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: vg $ $Date: 2005-02-16 15:51:25 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the License); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an AS IS basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): Ocke Janssen\n *\n *\n ************************************************************************\/\n#include \"hsqldb\/HStorageMap.hxx\"\n\n#ifndef _COMPHELPER_TYPES_HXX_\n#include <comphelper\/types.hxx>\n#endif\n#ifndef _COM_SUN_STAR_EMBED_XTRANSACTIONBROADCASTER_HPP_\n#include <com\/sun\/star\/embed\/XTransactionBroadcaster.hpp>\n#endif\n#ifndef _COM_SUN_STAR_EMBED_XTRANSACTEDOBJECT_HPP_\n#include <com\/sun\/star\/embed\/XTransactedObject.hpp>\n#endif\n#ifndef _COM_SUN_STAR_LANG_DISPOSEDEXCEPTION_HPP_\n#include <com\/sun\/star\/lang\/DisposedException.hpp>\n#endif\n\n\/\/........................................................................\nnamespace connectivity\n{\n\/\/........................................................................\n namespace hsqldb\n {\n \/\/........................................................................\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::com::sun::star::embed;\n using namespace ::com::sun::star::io;\n\n#define ThrowException(env, type, msg) { \\\n env->ThrowNew(env->FindClass(type), msg); }\n\n\n StreamHelper::StreamHelper(const Reference< XStream>& _xStream)\n : m_xStream(_xStream)\n {\n }\n \/\/ -----------------------------------------------------------------------------\n StreamHelper::~StreamHelper()\n {\n try\n {\n m_xStream = NULL;\n m_xSeek = NULL;\n if ( m_xInputStream.is() )\n {\n m_xInputStream->closeInput();\n m_xInputStream = NULL;\n }\n if ( m_xOutputStream.is() )\n {\n m_xOutputStream->closeOutput();\n try\n {\n ::comphelper::disposeComponent(m_xOutputStream);\n }\n catch(DisposedException&)\n {\n }\n catch(const Exception& e)\n {\n e;\n OSL_ENSURE(0,\"Could not dispose OutputStream\");\n }\n m_xOutputStream = NULL;\n }\n }\n catch(Exception& )\n {\n OSL_ENSURE(0,\"Exception catched!\");\n }\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XInputStream> StreamHelper::getInputStream()\n {\n if ( !m_xInputStream.is() )\n m_xInputStream = m_xStream->getInputStream();\n return m_xInputStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XOutputStream> StreamHelper::getOutputStream()\n {\n if ( !m_xOutputStream.is() )\n m_xOutputStream = m_xStream->getOutputStream();\n return m_xOutputStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XStream> StreamHelper::getStream()\n {\n return m_xStream;\n }\n \/\/ -----------------------------------------------------------------------------\n Reference< XSeekable> StreamHelper::getSeek()\n {\n if ( !m_xSeek.is() )\n m_xSeek.set(m_xStream,UNO_QUERY);\n return m_xSeek;\n }\n \/\/ -----------------------------------------------------------------------------\n TStorages& lcl_getStorageMap()\n {\n static TStorages s_aMap;\n return s_aMap;\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString lcl_getNextCount()\n {\n static sal_Int32 s_nCount = 0;\n return ::rtl::OUString::valueOf(s_nCount++);\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::removeURLPrefix(const ::rtl::OUString& _sURL,const ::rtl::OUString& _sFileURL)\n {\n return _sURL.copy(_sFileURL.getLength()+1);\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::removeOldURLPrefix(const ::rtl::OUString& _sURL)\n {\n ::rtl::OUString sRet = _sURL;\n#if defined(WIN) || defined(WNT)\n sal_Int32 nIndex = sRet.lastIndexOf('\\\\');\n#else\n sal_Int32 nIndex = sRet.lastIndexOf('\/');\n#endif\n if ( nIndex != -1 )\n {\n sRet = _sURL.copy(nIndex+1);\n }\n return sRet;\n\n }\n \/*****************************************************************************\/\n \/* convert jstring to rtl_uString *\/\n\n ::rtl::OUString StorageContainer::jstring2ustring(JNIEnv * env, jstring jstr)\n {\n const char * cstr;\n rtl_uString * ustr = NULL;\n cstr = env->GetStringUTFChars(jstr, NULL);\n if (JNI_FALSE != env->ExceptionCheck())\n {\n env->ExceptionClear();\n OSL_ENSURE(0,\"ExceptionClear\");\n }\n rtl_uString_newFromAscii(&ustr, cstr);\n env->ReleaseStringUTFChars(jstr, cstr);\n if (JNI_FALSE != env->ExceptionCheck())\n {\n env->ExceptionClear();\n OSL_ENSURE(0,\"ExceptionClear\");\n }\n return ustr ? ::rtl::OUString(ustr,SAL_NO_ACQUIRE) : ::rtl::OUString();\n }\n\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::registerStorage(const Reference< XStorage>& _xStorage,const ::rtl::OUString& _sURL)\n {\n OSL_ENSURE(_xStorage.is(),\"Storage is NULL!\");\n TStorages& rMap = lcl_getStorageMap();\n \/\/ check if the storage is already in our map\n TStorages::iterator aFind = ::std::find_if(rMap.begin(),rMap.end(),\n ::std::compose1(\n ::std::bind2nd(::std::equal_to<Reference<XStorage> >(),_xStorage)\n ,::std::compose1(::std::select1st<TStorageURLPair>(),::std::compose1(::std::select1st<TStorages::mapped_type>(),::std::select2nd<TStorages::value_type>())))\n );\n if ( aFind == rMap.end() )\n {\n aFind = rMap.insert(TStorages::value_type(lcl_getNextCount(),TStorages::mapped_type(TStorageURLPair(_xStorage,_sURL),TStreamMap()))).first;\n }\n\n return aFind->first;\n }\n \/\/ -----------------------------------------------------------------------------\n TStorages::mapped_type StorageContainer::getRegisteredStorage(const ::rtl::OUString& _sKey)\n {\n TStorages::mapped_type aRet;\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(_sKey);\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n aRet = aFind->second;\n\n return aRet;\n }\n \/\/ -----------------------------------------------------------------------------\n ::rtl::OUString StorageContainer::getRegisteredKey(const Reference< XStorage>& _xStorage)\n {\n ::rtl::OUString sKey;\n OSL_ENSURE(_xStorage.is(),\"Storage is NULL!\");\n TStorages& rMap = lcl_getStorageMap();\n \/\/ check if the storage is already in our map\n TStorages::iterator aFind = ::std::find_if(rMap.begin(),rMap.end(),\n ::std::compose1(\n ::std::bind2nd(::std::equal_to<Reference<XStorage> >(),_xStorage)\n ,::std::compose1(::std::select1st<TStorageURLPair>(),::std::compose1(::std::select1st<TStorages::mapped_type>(),::std::select2nd<TStorages::value_type>())))\n );\n if ( aFind != rMap.end() )\n sKey = aFind->first;\n return sKey;\n }\n \/\/ -----------------------------------------------------------------------------\n void StorageContainer::revokeStorage(const ::rtl::OUString& _sKey,const Reference<XTransactionListener>& _xListener)\n {\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(_sKey);\n if ( aFind != rMap.end() )\n {\n try\n {\n if ( _xListener.is() )\n {\n Reference<XTransactionBroadcaster> xBroad(aFind->second.first.first,UNO_QUERY);\n if ( xBroad.is() )\n xBroad->removeTransactionListener(_xListener);\n Reference<XTransactedObject> xTrans(aFind->second.first.first,UNO_QUERY);\n if ( xTrans.is() )\n xTrans->commit();\n }\n }\n catch(Exception&)\n {\n }\n rMap.erase(aFind);\n }\n }\n \/\/ -----------------------------------------------------------------------------\n TStreamMap::mapped_type StorageContainer::registerStream(JNIEnv * env,jstring name, jstring key,sal_Int32 _nMode)\n {\n TStreamMap::mapped_type pHelper;\n TStorages& rMap = lcl_getStorageMap();\n ::rtl::OUString sKey = jstring2ustring(env,key);\n TStorages::iterator aFind = rMap.find(sKey);\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n {\n TStorages::mapped_type aStoragePair = StorageContainer::getRegisteredStorage(sKey);\n OSL_ENSURE(aStoragePair.first.first.is(),\"No Storage available!\");\n if ( aStoragePair.first.first.is() )\n {\n ::rtl::OUString sOrgName = StorageContainer::jstring2ustring(env,name);\n ::rtl::OUString sName = removeURLPrefix(sOrgName,aStoragePair.first.second);\n TStreamMap::iterator aStreamFind = aFind->second.second.find(sName);\n OSL_ENSURE( aStreamFind == aFind->second.second.end(),\"A Stream was already registered for this object!\");\n if ( aStreamFind != aFind->second.second.end() )\n {\n pHelper = aStreamFind->second;\n }\n else\n {\n try\n {\n try\n {\n pHelper.reset(new StreamHelper(aStoragePair.first.first->openStreamElement(sName,_nMode)));\n }\n catch(Exception& )\n {\n ::rtl::OUString sName = removeOldURLPrefix(sOrgName);\n pHelper.reset(new StreamHelper(aStoragePair.first.first->openStreamElement(sName,_nMode)));\n }\n aFind->second.second.insert(TStreamMap::value_type(sName,pHelper));\n }\n catch(Exception& e)\n {\n OSL_ENSURE(0,\"Exception catched!\");\n if (JNI_FALSE != env->ExceptionCheck())\n env->ExceptionClear();\n ::rtl::OString cstr( ::rtl::OUStringToOString(e.Message, RTL_TEXTENCODING_JAVA_UTF8 ) );\n OSL_TRACE( __FILE__\": forwarding Exception: %s\", cstr.getStr() );\n ThrowException( env,\n \"java\/io\/IOException\",\n cstr.getStr());\n }\n }\n }\n }\n return pHelper;\n }\n \/\/ -----------------------------------------------------------------------------\n void StorageContainer::revokeStream( JNIEnv * env,jstring name, jstring key)\n {\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(jstring2ustring(env,key));\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n aFind->second.second.erase(removeURLPrefix(jstring2ustring(env,name),aFind->second.first.second));\n }\n \/\/ -----------------------------------------------------------------------------\n TStreamMap::mapped_type StorageContainer::getRegisteredStream( JNIEnv * env,jstring name, jstring key)\n {\n TStreamMap::mapped_type pRet;\n TStorages& rMap = lcl_getStorageMap();\n TStorages::iterator aFind = rMap.find(jstring2ustring(env,key));\n OSL_ENSURE(aFind != rMap.end(),\"Storage could not be found in list!\");\n if ( aFind != rMap.end() )\n {\n TStreamMap::iterator aStreamFind = aFind->second.second.find(removeURLPrefix(jstring2ustring(env,name),aFind->second.first.second));\n if ( aStreamFind != aFind->second.second.end() )\n pRet = aStreamFind->second;\n }\n\n return pRet;\n }\n \/\/ -----------------------------------------------------------------------------\n \/\/........................................................................\n } \/\/ namespace hsqldb\n \/\/........................................................................\n\/\/........................................................................\n}\n\/\/ namespace connectivity\n\/\/........................................................................\n#if OSL_DEBUG_LEVEL > 1\nTDebugStreamMap& getStreams()\n{\n static TDebugStreamMap streams;\n return streams;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkRTAnalyticSource.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkRTAnalyticSource.h\"\n\n#include \"vtkDataArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n#include \"vtkPointData.h\"\n\n#include <cmath>\n\nvtkStandardNewMacro(vtkRTAnalyticSource);\n\n\/\/ ----------------------------------------------------------------------------\nvtkRTAnalyticSource::vtkRTAnalyticSource()\n{\n this->Maximum = 255.0;\n this->Center[0] = 0.0;\n this->Center[1] = 0.0;\n this->Center[2] = 0.0;\n\n this->WholeExtent[0] = -10; this->WholeExtent[1] = 10;\n this->WholeExtent[2] = -10; this->WholeExtent[3] = 10;\n this->WholeExtent[4] = -10; this->WholeExtent[5] = 10;\n this->StandardDeviation = 0.5;\n\n this->XFreq = 60;\n this->XMag = 10;\n this->YFreq = 30;\n this->YMag = 18;\n this->ZFreq = 40;\n this->ZMag = 5;\n\n this->SetNumberOfInputPorts(0);\n\n this->SubsampleRate = 1;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkRTAnalyticSource::SetWholeExtent(int xMin, int xMax,\n int yMin, int yMax,\n int zMin, int zMax)\n{\n int modified = 0;\n\n if (this->WholeExtent[0] != xMin)\n {\n modified = 1;\n this->WholeExtent[0] = xMin ;\n }\n if (this->WholeExtent[1] != xMax)\n {\n modified = 1;\n this->WholeExtent[1] = xMax ;\n }\n if (this->WholeExtent[2] != yMin)\n {\n modified = 1;\n this->WholeExtent[2] = yMin ;\n }\n if (this->WholeExtent[3] != yMax)\n {\n modified = 1;\n this->WholeExtent[3] = yMax ;\n }\n if (this->WholeExtent[4] != zMin)\n {\n modified = 1;\n this->WholeExtent[4] = zMin ;\n }\n if (this->WholeExtent[5] != zMax)\n {\n modified = 1;\n this->WholeExtent[5] = zMax ;\n }\n if (modified)\n {\n this->Modified();\n }\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkRTAnalyticSource::RequestInformation(\n vtkInformation *vtkNotUsed(request),\n vtkInformationVector **vtkNotUsed(inputVector),\n vtkInformationVector *outputVector)\n{\n \/\/ get the info objects\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n\n int tmpExt[6], i;\n for (i = 0; i < 3; i++)\n {\n tmpExt[2*i] = this->WholeExtent[2*i] \/ this->SubsampleRate;\n tmpExt[2*i+1] = this->WholeExtent[2*i+1] \/ this->SubsampleRate;\n }\n\n outInfo->Set(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),\n tmpExt,6);\n\n outInfo->Set(vtkDataObject::ORIGIN(), 0.0, 0.0, 0.0);\n outInfo->Set(vtkDataObject::SPACING(), this->SubsampleRate,\n this->SubsampleRate, this->SubsampleRate);\n vtkDataObject::SetPointDataActiveScalarInfo(outInfo, VTK_FLOAT, 1);\n\n outInfo->Set(CAN_PRODUCE_SUB_EXTENT(), 1);\n\n return 1;\n}\n\nvoid vtkRTAnalyticSource::ExecuteDataWithInformation(vtkDataObject *vtkNotUsed(output),\n vtkInformation *outInfo)\n{\n float *outPtr;\n int idxX, idxY, idxZ;\n int maxX, maxY, maxZ;\n vtkIdType outIncX, outIncY, outIncZ;\n int *outExt, *whlExt;\n int newOutExt[6];\n double sum;\n double yContrib, zContrib;\n double temp2;\n unsigned long count = 0;\n unsigned long target;\n\n \/\/ Split the update extent further based on piece request.\n int* execExt = outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT());\n\n \/\/ For debugging\n \/*\n int numPieces = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES());\n int piece = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER());\n int numGhosts = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS());\n\n if (piece == 0)\n {\n cout << \"Piece:\" << piece << \" \" << numPieces << \" \" << numGhosts << endl;\n cout << \"Extent: \"\n << execExt[0] << \" \"\n << execExt[1] << \" \"\n << execExt[2] << \" \"\n << execExt[3] << \" \"\n << execExt[4] << \" \"\n << execExt[5] << endl;\n }\n *\/\n\n vtkImageData *data = vtkImageData::GetData(outInfo);\n this->AllocateOutputData(data, outInfo, execExt);\n if (data->GetScalarType() != VTK_FLOAT)\n {\n vtkErrorMacro(\"Execute: This source only outputs floats\");\n return;\n }\n if (data->GetNumberOfPoints() <= 0)\n {\n return;\n }\n\n data->SetSpacing(this->SubsampleRate, this->SubsampleRate,\n this->SubsampleRate);\n\n outExt = data->GetExtent();\n int i;\n for (i = 0; i < 3; i++)\n {\n newOutExt[2*i] = outExt[2*i] * this->SubsampleRate;\n newOutExt[2*i+1] = outExt[2*i+1] * this->SubsampleRate;\n }\n whlExt = this->GetWholeExtent();\n data->GetPointData()->GetScalars()->SetName(\"RTData\");\n\n \/\/ find the region to loop over\n maxX = newOutExt[1] - newOutExt[0];\n maxY = newOutExt[3] - newOutExt[2];\n maxZ = newOutExt[5] - newOutExt[4];\n\n \/\/ Get increments to march through data\n data->GetContinuousIncrements(outExt, outIncX, outIncY, outIncZ);\n outPtr = static_cast<float *>(data->GetScalarPointer(outExt[0],outExt[2],outExt[4]));\n\n target = static_cast<unsigned long>((maxZ+1)*(maxY+1)\/50.0);\n target++;\n\n \/\/ Loop through output pixels\n temp2 = 1.0 \/ (2.0 * this->StandardDeviation * this->StandardDeviation);\n\n double x, y, z;\n const double xscale = (whlExt[1] > whlExt[0])? (1.0\/(whlExt[1] - whlExt[0])) : 1.0;\n const double yscale = (whlExt[3] > whlExt[2])? (1.0\/(whlExt[3] - whlExt[2])) : 1.0;\n const double zscale = (whlExt[5] > whlExt[4])? (1.0\/(whlExt[5] - whlExt[4])) : 1.0;\n for (idxZ = 0; idxZ <= maxZ; idxZ++)\n {\n if ((this->SubsampleRate > 1) && (idxZ % this->SubsampleRate))\n {\n continue;\n }\n z = this->Center[2] - (idxZ + newOutExt[4]);\n z *= zscale;\n zContrib = z * z;\n const float zfactor = static_cast<float>(this->ZMag*cos(this->ZFreq*z));\n for (idxY = 0; !this->AbortExecute && idxY <= maxY; idxY++)\n {\n if ((this->SubsampleRate > 1) && (idxY % this->SubsampleRate))\n {\n continue;\n }\n if (!(count%target))\n {\n this->UpdateProgress(count\/(50.0*target));\n }\n count++;\n y = this->Center[1] - (idxY + newOutExt[2]);\n y *= yscale;\n yContrib = y * y;\n const float yfactor = static_cast<float>(this->YMag*sin(this->YFreq*y));\n for (idxX = 0; idxX <= maxX; idxX++)\n {\n if ((this->SubsampleRate > 1) && (idxX % this->SubsampleRate))\n {\n continue;\n }\n \/\/ Pixel operation\n sum = zContrib + yContrib;\n x = this->Center[0] - (idxX + newOutExt[0]);\n x *= xscale;\n sum = sum + (x * x);\n const float xfactor = static_cast<float>(this->XMag*sin(this->XFreq*x));\n *outPtr = this->Maximum * exp(-sum * temp2)\n + xfactor \/*this->XMag*sin(this->XFreq*x)*\/\n + yfactor \/*this->YMag*sin(this->YFreq*y)*\/\n + zfactor \/*this->ZMag*cos(this->ZFreq*z)*\/;\n outPtr++;\n }\n outPtr += outIncY;\n }\n outPtr += outIncZ;\n }\n}\n\nvoid vtkRTAnalyticSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n\n os << indent << \"Maximum: \" << this->Maximum << \"\\n\";\n os << indent << \"StandardDeviation: \" << this->StandardDeviation << \"\\n\";\n os << indent << \"Center: ( \"\n << this->Center[0] << \", \"\n << this->Center[1] << \", \"\n << this->Center[2] << \" )\\n\";\n os << indent << \"XFreq: \" << this->XFreq << endl;\n os << indent << \"YFreq: \" << this->YFreq << endl;\n os << indent << \"ZFreq: \" << this->ZFreq << endl;\n os << indent << \"XMag: \" << this->XMag << endl;\n os << indent << \"YMag: \" << this->YMag << endl;\n os << indent << \"ZMag: \" << this->ZMag << endl;\n\n os << indent << \"WholeExtent: \" << this->WholeExtent[0]\n << \", \" << this->WholeExtent[1] << \", \" << this->WholeExtent[2]\n << \", \" << this->WholeExtent[3] << \", \" << this->WholeExtent[4]\n << \", \" << this->WholeExtent[5] << endl;\n\n os << indent << \"SubsampleRate: \" << this->SubsampleRate << endl;\n}\n\nint vtkRTAnalyticSource::FillOutputPortInformation(\n int port, vtkInformation* info)\n{\n if (!this->Superclass::FillOutputPortInformation(port, info))\n {\n return 0;\n }\n\n return 1;\n}\n<commit_msg>Validate whole extent specified on vtkRTAnalyticSource.<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkRTAnalyticSource.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkRTAnalyticSource.h\"\n\n#include \"vtkDataArray.h\"\n#include \"vtkImageData.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkStreamingDemandDrivenPipeline.h\"\n#include \"vtkPointData.h\"\n\n#include <cmath>\n\nvtkStandardNewMacro(vtkRTAnalyticSource);\n\n\/\/ ----------------------------------------------------------------------------\nvtkRTAnalyticSource::vtkRTAnalyticSource()\n{\n this->Maximum = 255.0;\n this->Center[0] = 0.0;\n this->Center[1] = 0.0;\n this->Center[2] = 0.0;\n\n this->WholeExtent[0] = -10; this->WholeExtent[1] = 10;\n this->WholeExtent[2] = -10; this->WholeExtent[3] = 10;\n this->WholeExtent[4] = -10; this->WholeExtent[5] = 10;\n this->StandardDeviation = 0.5;\n\n this->XFreq = 60;\n this->XMag = 10;\n this->YFreq = 30;\n this->YMag = 18;\n this->ZFreq = 40;\n this->ZMag = 5;\n\n this->SetNumberOfInputPorts(0);\n\n this->SubsampleRate = 1;\n}\n\n\/\/ ----------------------------------------------------------------------------\nvoid vtkRTAnalyticSource::SetWholeExtent(int xMin, int xMax,\n int yMin, int yMax,\n int zMin, int zMax)\n{\n int modified = 0;\n\n if (this->WholeExtent[0] != xMin)\n {\n modified = 1;\n this->WholeExtent[0] = xMin ;\n }\n if (this->WholeExtent[1] != xMax)\n {\n modified = 1;\n this->WholeExtent[1] = xMax ;\n }\n if (this->WholeExtent[2] != yMin)\n {\n modified = 1;\n this->WholeExtent[2] = yMin ;\n }\n if (this->WholeExtent[3] != yMax)\n {\n modified = 1;\n this->WholeExtent[3] = yMax ;\n }\n if (this->WholeExtent[4] != zMin)\n {\n modified = 1;\n this->WholeExtent[4] = zMin ;\n }\n if (this->WholeExtent[5] != zMax)\n {\n modified = 1;\n this->WholeExtent[5] = zMax ;\n }\n if (modified)\n {\n this->Modified();\n }\n}\n\n\/\/ ----------------------------------------------------------------------------\nint vtkRTAnalyticSource::RequestInformation(\n vtkInformation *vtkNotUsed(request),\n vtkInformationVector **vtkNotUsed(inputVector),\n vtkInformationVector *outputVector)\n{\n \/\/ get the info objects\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n if (this->WholeExtent[0] > this->WholeExtent[1] ||\n this->WholeExtent[2] > this->WholeExtent[3] ||\n this->WholeExtent[4] > this->WholeExtent[5])\n {\n vtkErrorMacro(\"Invalid WholeExtent: \"\n << this->WholeExtent[0] << \", \" << this->WholeExtent[1] << \", \"\n << this->WholeExtent[2] << \", \" << this->WholeExtent[3] << \", \"\n << this->WholeExtent[4] << \", \" << this->WholeExtent[5]);\n return 0;\n }\n\n int tmpExt[6], i;\n for (i = 0; i < 3; i++)\n {\n tmpExt[2*i] = this->WholeExtent[2*i] \/ this->SubsampleRate;\n tmpExt[2*i+1] = this->WholeExtent[2*i+1] \/ this->SubsampleRate;\n }\n\n outInfo->Set(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(),\n tmpExt,6);\n\n outInfo->Set(vtkDataObject::ORIGIN(), 0.0, 0.0, 0.0);\n outInfo->Set(vtkDataObject::SPACING(), this->SubsampleRate,\n this->SubsampleRate, this->SubsampleRate);\n vtkDataObject::SetPointDataActiveScalarInfo(outInfo, VTK_FLOAT, 1);\n\n outInfo->Set(CAN_PRODUCE_SUB_EXTENT(), 1);\n\n return 1;\n}\n\nvoid vtkRTAnalyticSource::ExecuteDataWithInformation(vtkDataObject *vtkNotUsed(output),\n vtkInformation *outInfo)\n{\n float *outPtr;\n int idxX, idxY, idxZ;\n int maxX, maxY, maxZ;\n vtkIdType outIncX, outIncY, outIncZ;\n int *outExt, *whlExt;\n int newOutExt[6];\n double sum;\n double yContrib, zContrib;\n double temp2;\n unsigned long count = 0;\n unsigned long target;\n\n \/\/ Split the update extent further based on piece request.\n int* execExt = outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT());\n\n \/\/ For debugging\n \/*\n int numPieces = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_PIECES());\n int piece = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_PIECE_NUMBER());\n int numGhosts = outInfo->Get(\n vtkStreamingDemandDrivenPipeline::UPDATE_NUMBER_OF_GHOST_LEVELS());\n\n if (piece == 0)\n {\n cout << \"Piece:\" << piece << \" \" << numPieces << \" \" << numGhosts << endl;\n cout << \"Extent: \"\n << execExt[0] << \" \"\n << execExt[1] << \" \"\n << execExt[2] << \" \"\n << execExt[3] << \" \"\n << execExt[4] << \" \"\n << execExt[5] << endl;\n }\n *\/\n\n vtkImageData *data = vtkImageData::GetData(outInfo);\n this->AllocateOutputData(data, outInfo, execExt);\n if (data->GetScalarType() != VTK_FLOAT)\n {\n vtkErrorMacro(\"Execute: This source only outputs floats\");\n return;\n }\n if (data->GetNumberOfPoints() <= 0)\n {\n return;\n }\n\n data->SetSpacing(this->SubsampleRate, this->SubsampleRate,\n this->SubsampleRate);\n\n outExt = data->GetExtent();\n int i;\n for (i = 0; i < 3; i++)\n {\n newOutExt[2*i] = outExt[2*i] * this->SubsampleRate;\n newOutExt[2*i+1] = outExt[2*i+1] * this->SubsampleRate;\n }\n whlExt = this->GetWholeExtent();\n data->GetPointData()->GetScalars()->SetName(\"RTData\");\n\n \/\/ find the region to loop over\n maxX = newOutExt[1] - newOutExt[0];\n maxY = newOutExt[3] - newOutExt[2];\n maxZ = newOutExt[5] - newOutExt[4];\n\n \/\/ Get increments to march through data\n data->GetContinuousIncrements(outExt, outIncX, outIncY, outIncZ);\n outPtr = static_cast<float *>(data->GetScalarPointer(outExt[0],outExt[2],outExt[4]));\n\n target = static_cast<unsigned long>((maxZ+1)*(maxY+1)\/50.0);\n target++;\n\n \/\/ Loop through output pixels\n temp2 = 1.0 \/ (2.0 * this->StandardDeviation * this->StandardDeviation);\n\n double x, y, z;\n const double xscale = (whlExt[1] > whlExt[0])? (1.0\/(whlExt[1] - whlExt[0])) : 1.0;\n const double yscale = (whlExt[3] > whlExt[2])? (1.0\/(whlExt[3] - whlExt[2])) : 1.0;\n const double zscale = (whlExt[5] > whlExt[4])? (1.0\/(whlExt[5] - whlExt[4])) : 1.0;\n for (idxZ = 0; idxZ <= maxZ; idxZ++)\n {\n if ((this->SubsampleRate > 1) && (idxZ % this->SubsampleRate))\n {\n continue;\n }\n z = this->Center[2] - (idxZ + newOutExt[4]);\n z *= zscale;\n zContrib = z * z;\n const float zfactor = static_cast<float>(this->ZMag*cos(this->ZFreq*z));\n for (idxY = 0; !this->AbortExecute && idxY <= maxY; idxY++)\n {\n if ((this->SubsampleRate > 1) && (idxY % this->SubsampleRate))\n {\n continue;\n }\n if (!(count%target))\n {\n this->UpdateProgress(count\/(50.0*target));\n }\n count++;\n y = this->Center[1] - (idxY + newOutExt[2]);\n y *= yscale;\n yContrib = y * y;\n const float yfactor = static_cast<float>(this->YMag*sin(this->YFreq*y));\n for (idxX = 0; idxX <= maxX; idxX++)\n {\n if ((this->SubsampleRate > 1) && (idxX % this->SubsampleRate))\n {\n continue;\n }\n \/\/ Pixel operation\n sum = zContrib + yContrib;\n x = this->Center[0] - (idxX + newOutExt[0]);\n x *= xscale;\n sum = sum + (x * x);\n const float xfactor = static_cast<float>(this->XMag*sin(this->XFreq*x));\n *outPtr = this->Maximum * exp(-sum * temp2)\n + xfactor \/*this->XMag*sin(this->XFreq*x)*\/\n + yfactor \/*this->YMag*sin(this->YFreq*y)*\/\n + zfactor \/*this->ZMag*cos(this->ZFreq*z)*\/;\n outPtr++;\n }\n outPtr += outIncY;\n }\n outPtr += outIncZ;\n }\n}\n\nvoid vtkRTAnalyticSource::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n\n os << indent << \"Maximum: \" << this->Maximum << \"\\n\";\n os << indent << \"StandardDeviation: \" << this->StandardDeviation << \"\\n\";\n os << indent << \"Center: ( \"\n << this->Center[0] << \", \"\n << this->Center[1] << \", \"\n << this->Center[2] << \" )\\n\";\n os << indent << \"XFreq: \" << this->XFreq << endl;\n os << indent << \"YFreq: \" << this->YFreq << endl;\n os << indent << \"ZFreq: \" << this->ZFreq << endl;\n os << indent << \"XMag: \" << this->XMag << endl;\n os << indent << \"YMag: \" << this->YMag << endl;\n os << indent << \"ZMag: \" << this->ZMag << endl;\n\n os << indent << \"WholeExtent: \" << this->WholeExtent[0]\n << \", \" << this->WholeExtent[1] << \", \" << this->WholeExtent[2]\n << \", \" << this->WholeExtent[3] << \", \" << this->WholeExtent[4]\n << \", \" << this->WholeExtent[5] << endl;\n\n os << indent << \"SubsampleRate: \" << this->SubsampleRate << endl;\n}\n\nint vtkRTAnalyticSource::FillOutputPortInformation(\n int port, vtkInformation* info)\n{\n if (!this->Superclass::FillOutputPortInformation(port, info))\n {\n return 0;\n }\n\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"vtkActor.h\"\n#include \"vtkFast2DLayoutStrategy.h\"\n#include \"vtkForceDirectedLayoutStrategy.h\"\n#include \"vtkGraphLayout.h\"\n#include \"vtkGraphToPolyData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRandomGraphSource.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkTestUtilities.h\"\n#include \"vtkVertexGlyphFilter.h\"\n\n#define VTK_CREATE(type,name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\nint TestArcEdges(int argc, char* argv[])\n{\n VTK_CREATE(vtkRandomGraphSource, source);\n VTK_CREATE(vtkGraphLayout, layout);\n VTK_CREATE(vtkFast2DLayoutStrategy, strategy);\n VTK_CREATE(vtkGraphToPolyData, graphToPoly);\n VTK_CREATE(vtkPolyDataMapper, edgeMapper);\n VTK_CREATE(vtkActor, edgeActor);\n VTK_CREATE(vtkGraphToPolyData, graphToPoints);\n VTK_CREATE(vtkVertexGlyphFilter, vertGlyph);\n VTK_CREATE(vtkPolyDataMapper, vertMapper);\n VTK_CREATE(vtkActor, vertActor);\n VTK_CREATE(vtkRenderer, ren);\n VTK_CREATE(vtkRenderWindow, win);\n VTK_CREATE(vtkRenderWindowInteractor, iren);\n\n source->SetNumberOfVertices(3);\n source->SetNumberOfEdges(50);\n source->AllowSelfLoopsOn();\n source->AllowParallelEdgesOn();\n source->StartWithTreeOff();\n source->DirectedOff();\n layout->SetInputConnection(source->GetOutputPort());\n layout->SetLayoutStrategy(strategy);\n graphToPoly->SetInputConnection(layout->GetOutputPort());\n graphToPoly->ArcEdgesOn();\n graphToPoly->SetNumberOfArcSubdivisions(50);\n edgeMapper->SetInputConnection(graphToPoly->GetOutputPort());\n edgeActor->SetMapper(edgeMapper);\n ren->AddActor(edgeActor);\n\n\n graphToPoints->SetInputConnection(layout->GetOutputPort());\n vertGlyph->SetInputConnection(graphToPoints->GetOutputPort());\n vertMapper->SetInputConnection(vertGlyph->GetOutputPort());\n vertActor->SetMapper(vertMapper);\n vertActor->GetProperty()->SetPointSize(10);\n ren->AddActor(vertActor);\n\n win->AddRenderer(ren);\n win->SetInteractor(iren);\n win->Render();\n\n int retVal = vtkRegressionTestImage(win);\n if (retVal == vtkRegressionTester::DO_INTERACTOR)\n {\n iren->Initialize();\n iren->Start();\n\n retVal = vtkRegressionTester::PASSED;\n }\n\n return !retVal;\n}\n\n<commit_msg>ENH: Checking in new TestArcEdges that should produce the same image on most all platforms.<commit_after>\n#include \"vtkActor.h\"\n#include \"vtkCircularLayoutStrategy.h\"\n#include \"vtkForceDirectedLayoutStrategy.h\"\n#include \"vtkGraphLayout.h\"\n#include \"vtkGraphToPolyData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRandomGraphSource.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkSmartPointer.h\"\n#include \"vtkTestUtilities.h\"\n#include \"vtkVertexGlyphFilter.h\"\n\n#define VTK_CREATE(type,name) \\\n vtkSmartPointer<type> name = vtkSmartPointer<type>::New()\n\nint TestArcEdges(int argc, char* argv[])\n{\n VTK_CREATE(vtkRandomGraphSource, source);\n VTK_CREATE(vtkGraphLayout, layout);\n VTK_CREATE(vtkCircularLayoutStrategy, strategy);\n VTK_CREATE(vtkGraphToPolyData, graphToPoly);\n VTK_CREATE(vtkPolyDataMapper, edgeMapper);\n VTK_CREATE(vtkActor, edgeActor);\n VTK_CREATE(vtkGraphToPolyData, graphToPoints);\n VTK_CREATE(vtkVertexGlyphFilter, vertGlyph);\n VTK_CREATE(vtkPolyDataMapper, vertMapper);\n VTK_CREATE(vtkActor, vertActor);\n VTK_CREATE(vtkRenderer, ren);\n VTK_CREATE(vtkRenderWindow, win);\n VTK_CREATE(vtkRenderWindowInteractor, iren);\n\n source->SetNumberOfVertices(3);\n source->SetNumberOfEdges(50);\n source->AllowSelfLoopsOn();\n source->AllowParallelEdgesOn();\n source->StartWithTreeOff();\n source->DirectedOff();\n layout->SetInputConnection(source->GetOutputPort());\n layout->SetLayoutStrategy(strategy);\n graphToPoly->SetInputConnection(layout->GetOutputPort());\n graphToPoly->ArcEdgesOn();\n graphToPoly->SetNumberOfArcSubdivisions(50);\n edgeMapper->SetInputConnection(graphToPoly->GetOutputPort());\n edgeActor->SetMapper(edgeMapper);\n ren->AddActor(edgeActor);\n\n\n graphToPoints->SetInputConnection(layout->GetOutputPort());\n vertGlyph->SetInputConnection(graphToPoints->GetOutputPort());\n vertMapper->SetInputConnection(vertGlyph->GetOutputPort());\n vertActor->SetMapper(vertMapper);\n vertActor->GetProperty()->SetPointSize(1);\n ren->AddActor(vertActor);\n\n win->AddRenderer(ren);\n win->SetInteractor(iren);\n win->Render();\n\n int retVal = vtkRegressionTestImage(win);\n if (retVal == vtkRegressionTester::DO_INTERACTOR)\n {\n iren->Initialize();\n iren->Start();\n\n retVal = vtkRegressionTester::PASSED;\n }\n\n return !retVal;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 nyorain\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ See accompanying file LICENSE or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt\n\n\/\/\/ file Contains the Span template class for not-owned contigous ranges.\n\n#pragma once\n\n#ifndef NYTL_INCLUDE_SPAN\n#define NYTL_INCLUDE_SPAN\n\n#include <nytl\/fwd\/span.hpp> \/\/ nytl::Span default template parameter\n#include <nytl\/scalar.hpp> \/\/ nytl::constants::dynamicSize\n\n#include <cstdlib> \/\/ std::size_t\n#include <stdexcept> \/\/ std::out_of_range\n#include <array> \/\/ std::array\n\nnamespace nytl {\nnamespace detail {\n\ttemplate<typename T, typename C, typename = void> struct ValidContainerT;\n\ttemplate<typename T, typename C> using ValidContainer = typename ValidContainerT<T, C>::type;\n} \/\/ namespace nytl::detail\n\n\/\/\/ The underlaying storage type of spans that is specialized for dyanmic size.\ntemplate<typename T, std::size_t N> struct SpanStorage;\n\n\/\/\/ \\brief Describes a contigous, non-owned range of elements of type 'T'.\n\/\/\/ \\details Spans can be used to pass sequences of elements around in a lightweight manner.\n\/\/\/ Its main use are function parameters sine instead of a std::vector it will not allocate\n\/\/\/ any memory or copy any elements but instead just reference them.\n\/\/\/ \\tparam T The type the range is defined over. Use const types for non-mutable ranges.\n\/\/\/ \\tparam N The size of the range. If not known at compile\n\/\/\/ time, use nytl::constants::dynamicSize (also defaulted to dynamicSize).\n\/\/\/\n\/\/\/ Some examples below. Note that Spans must be used carefully outside of temporary\n\/\/\/ expressions since they are only valid as long the object they reference is valid.\n\/\/\/ ```cpp\n\/\/\/ void foo(nytl::Span<std::string> names); \/\/ takes dyanmic amount of strings, might modify it\n\/\/\/ void bar(nytl::Span<const std::string, 3> names); \/\/ takes exactly 3 const strings\n\/\/\/ void baz(nytl::Span<const std::string, 5> names); \/\/ takes exactly 5 const strings\n\/\/\/\n\/\/\/ int main()\n\/\/\/ {\n\/\/\/\t\tstd::array<std::string, 3> namesArray {\"foo\", \"bar\", \"baz\"};\n\/\/\/\t\tfoo(namesArray); \/\/ works\n\/\/\/ \tbar(namesArray); \/\/ works\n\/\/\/\t\tbaz(namesArray); \/\/ will throw std::logic_error since baz requires exactly 5 strings\n\/\/\/\n\/\/\/\t\tstd::vector<std::string> namesVector {\"foo\", \"bar\", \"baz\", \"abz\", \"bla\"};\n\/\/\/\t\tfoo(namesVector); \/\/ works\n\/\/\/\t\tbar(namesVector); \/\/ will throw std::logic_error since bar requires exactly 3 strings\n\/\/\/\t\tbaz(namesVector); \/\/ works\n\/\/\/\n\/\/\/ \t\/\/ If we only want the first 3 elements from namesVector as range we can do it like this\n\/\/\/\t\tbar({namesVector.data(), 3}); \/\/ works, takes the first 3 elements\n\/\/\/\t\tfoo({*namesVector.data(), 4}); \/\/ we can also use references\n\/\/\/\n\/\/\/\t\t\/\/ careful when using span outside of temporary expressions\n\/\/\/\t\tauto span = nytl::Span<int>(std::vector<int>{4, 1, 2, 0});\n\/\/\/ \t\/\/ std::cout << span[0] << \"\\n\"; \/\/ undefined behaviour!\n\/\/\/ }\n\/\/\/\n\/\/\/ void foo(nytl::Span<std::string> names)\n\/\/\/ {\n\/\/\/\t\t\/\/ Some usage possibilities for span.\n\/\/\/\/\t\/\/ The main usage is iterating over it:\n\/\/\/\t\tfor(auto& name : names)\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\t\/\/ We might alternatively do this with a traditional for loop\n\/\/\/\t\tfor(auto i = 0u; i < names.size(); ++i)\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\t\/\/ In this case we have a span of std::string, not const std::string,\n\/\/\/\t\t\/\/ therefore we might also change it. This will change the names in the actual\n\/\/\/\t\t\/\/ sequence this span references. Usually nytl::Span<const T> is used when the\n\/\/\/\t\t\/\/ span is only read\n\/\/\/\t\tif(!names.empty()) {\n\/\/\/\t\t\tnames.front() = \"first name\";\n\/\/\/\t\t\tnames.back() = \"last name\";\n\/\/\/\t\t}\n\/\/\/\n\/\/\/\t\t\/\/ A span can additionally be sliced into a subspan. This can either be\n\/\/\/\t\t\/\/ done with a size known at compile time (which will result in a fixed-size span)\n\/\/\/\t\t\/\/ or dynamically for a dynamic-sized span.\n\/\/\/\t\tif(names.size() <= 2) return;\n\/\/\/\t\tfor(auto& name : names.slice(2, names.size() - 2)) \/\/ output everything but the first two\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\tfor(auto& name : names.slice<2>(0)) \/\/ output only the first two names\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/ }\n\/\/\/ ```\ntemplate<typename T, std::size_t N>\nclass Span : public SpanStorage<T, N> {\npublic:\n\tusing Value = T;\n\tusing Iterator = T*;\n\tusing ReverseIterator = std::reverse_iterator<T*>;\n\tusing Reference = T&;\n\tusing Pointer = T*;\n\tusing Difference = std::ptrdiff_t;\n\tusing Size = std::size_t;\n\npublic:\n\tusing SpanStorage<T, N>::SpanStorage;\n\tconstexpr Span(std::nullptr_t) : Span(nullptr, 0) {}\n\n\ttemplate<typename C, typename = detail::ValidContainer<T, C>>\n\tconstexpr Span(C& c) : Span(c.data(), c.size()) {}\n\n\ttemplate<typename C, typename = detail::ValidContainer<T, C>, std::size_t S = C::size()>\n\tconstexpr Span(C& c) : Span(c.data()) {}\n\n\tconstexpr Pointer data() const noexcept { return this->data_; }\n\tconstexpr Size size() const noexcept { return this->size_; }\n\tconstexpr bool empty() const noexcept { return size() == 0; }\n\n\tconstexpr Iterator begin() const noexcept { return data(); }\n\tconstexpr Iterator end() const noexcept { return data() + size(); }\n\n\tconstexpr ReverseIterator rbegin() const noexcept { return {end()}; }\n\tconstexpr ReverseIterator rend() const noexcept { return {begin()}; }\n\n\tconstexpr Reference operator[](Size i) const noexcept { return *(data() + i); }\n\tconstexpr Reference at(Size i) const { checkThrow(i); return data()[i]; }\n\n\tconstexpr Reference front() const noexcept { return *data(); }\n\tconstexpr Reference back() const noexcept { return *(data() + size() - 1); }\n\n\tconstexpr Span<T> slice(Size pos, Size size) const { return {data() + pos, size}; }\n\ttemplate<Size S> constexpr Span<T, S> slice(Size pos) const { return {data() + pos}; }\n\nprotected:\n\tvoid checkThrow(Size i) const { if(i >= size()) throw std::out_of_range(\"nytl::Span::at\"); }\n};\n\n\/\/ Default SpanStorage implementation for compile-time size\ntemplate<typename T, std::size_t N>\nstruct SpanStorage {\n\tconstexpr SpanStorage() noexcept = default;\n\tconstexpr SpanStorage(T* pointer, std::size_t size = N) : data_(pointer)\n\t{\n\t\tif(size != N) throw std::logic_error(\"nytl::Span:: invalid size\");\n\t\tif(!pointer && size != 0) throw std::logic_error(\"nytl::Span:: invalid data\");\n\t}\n\tconstexpr SpanStorage(T& ref, std::size_t size = N) : SpanStorage(&ref, size) {}\n\tconstexpr SpanStorage(T (&arr)[N]) : SpanStorage(arr, N) {}\n\n\tT* data_;\n\tconstexpr static auto size_ = N;\n};\n\n\/\/ SpanStorage specialization for runtime size. Stored an extra size value.\ntemplate<typename T>\nstruct SpanStorage<T, constants::dynamicSize> {\n\tconstexpr SpanStorage() noexcept = default;\n\tconstexpr SpanStorage(T* pointer, std::size_t size) : data_(pointer), size_(size)\n\t{\n\t\tif(!pointer && size != 0) throw std::logic_error(\"nytl::Span:: invalid data\");\n\t}\n\tconstexpr SpanStorage(T& ref, std::size_t size) : SpanStorage(&ref, size) {}\n\ttemplate<std::size_t S> constexpr SpanStorage(T (&arr)[S]) : SpanStorage(arr, S) {}\n\n\tT* data_;\n\tstd::size_t size_;\n};\n\nnamespace detail {\n\n\/\/ Returns whether 'C' is a valid container to construct a Span<T> from\ntemplate<typename T, typename C>\nstruct ValidContainerT<T, C,\n\ttypename std::enable_if<\n\t\tstd::is_convertible<\n\t\t\tdecltype(std::declval<C>().data()),\n\t\t\tT*\n\t\t>::value &&\n\t\tstd::is_convertible<\n\t\t\tdecltype(std::declval<C>().size()),\n\t\t\tstd::size_t\n\t\t>::value\n\t>::type\n> { using type = void; };\n\n} \/\/ namespace nytl::detail\n\n} \/\/ namespace nytl\n\n#endif \/\/ header guard\n<commit_msg>Update span.hpp<commit_after>\/\/ Copyright (c) 2017 nyorain\n\/\/ Distributed under the Boost Software License, Version 1.0.\n\/\/ See accompanying file LICENSE or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt\n\n\/\/\/ file Contains the Span template class for not-owned contigous ranges.\n\n#pragma once\n\n#ifndef NYTL_INCLUDE_SPAN\n#define NYTL_INCLUDE_SPAN\n\n#include <nytl\/fwd\/span.hpp> \/\/ nytl::Span default template parameter\n#include <nytl\/scalar.hpp> \/\/ nytl::constants::dynamicSize\n\n#include <cstdlib> \/\/ std::size_t\n#include <stdexcept> \/\/ std::out_of_range\n#include <array> \/\/ std::array\n\nnamespace nytl {\nnamespace detail {\n\ttemplate<typename T, typename C, typename = void> struct ValidContainerT;\n\ttemplate<typename T, typename C> using ValidContainer = typename ValidContainerT<T, C>::type;\n} \/\/ namespace nytl::detail\n\n\/\/\/ The underlaying storage type of spans that is specialized for dyanmic size.\ntemplate<typename T, std::size_t N> struct SpanStorage;\n\n\/\/\/ \\brief Describes a contigous, non-owned range of elements of type 'T'.\n\/\/\/ \\details Spans can be used to pass sequences of elements around in a lightweight manner.\n\/\/\/ Its main use are function parameters sine instead of a std::vector it will not allocate\n\/\/\/ any memory or copy any elements but instead just reference them.\n\/\/\/ \\tparam T The type the range is defined over. Use const types for non-mutable ranges.\n\/\/\/ \\tparam N The size of the range. If not known at compile\n\/\/\/ time, use nytl::constants::dynamicSize (also defaulted to dynamicSize).\n\/\/\/\n\/\/\/ Some examples below. Note that Spans must be used carefully outside of temporary\n\/\/\/ expressions since they are only valid as long the object they reference is valid.\n\/\/\/ ```cpp\n\/\/\/ void foo(nytl::Span<std::string> names); \/\/ takes dyanmic amount of strings, might modify it\n\/\/\/ void bar(nytl::Span<const std::string, 3> names); \/\/ takes exactly 3 const strings\n\/\/\/ void baz(nytl::Span<const std::string, 5> names); \/\/ takes exactly 5 const strings\n\/\/\/\n\/\/\/ int main()\n\/\/\/ {\n\/\/\/\t\tstd::array<std::string, 3> namesArray {\"foo\", \"bar\", \"baz\"};\n\/\/\/\t\tfoo(namesArray); \/\/ works\n\/\/\/ \tbar(namesArray); \/\/ works\n\/\/\/\t\tbaz(namesArray); \/\/ will throw std::logic_error since baz requires exactly 5 strings\n\/\/\/\n\/\/\/\t\tstd::vector<std::string> namesVector {\"foo\", \"bar\", \"baz\", \"abz\", \"bla\"};\n\/\/\/\t\tfoo(namesVector); \/\/ works\n\/\/\/\t\tbar(namesVector); \/\/ will throw std::logic_error since bar requires exactly 3 strings\n\/\/\/\t\tbaz(namesVector); \/\/ works\n\/\/\/\n\/\/\/ \t\/\/ If we only want the first 3 elements from namesVector as range we can do it like this\n\/\/\/\t\tbar({namesVector.data(), 3}); \/\/ works, takes the first 3 elements\n\/\/\/\t\tfoo({*namesVector.data(), 4}); \/\/ we can also use references\n\/\/\/\n\/\/\/\t\t\/\/ careful when using span outside of temporary expressions\n\/\/\/\t\tauto span = nytl::Span<int>(std::vector<int>{4, 1, 2, 0});\n\/\/\/ \t\/\/ std::cout << span[0] << \"\\n\"; \/\/ undefined behaviour!\n\/\/\/ }\n\/\/\/\n\/\/\/ void foo(nytl::Span<std::string> names)\n\/\/\/ {\n\/\/\/\t\t\/\/ Some usage possibilities for span.\n\/\/\/\/\t\/\/ The main usage is iterating over it:\n\/\/\/\t\tfor(auto& name : names)\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\t\/\/ We might alternatively do this with a traditional for loop\n\/\/\/\t\tfor(auto i = 0u; i < names.size(); ++i)\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\t\/\/ In this case we have a span of std::string, not const std::string,\n\/\/\/\t\t\/\/ therefore we might also change it. This will change the names in the actual\n\/\/\/\t\t\/\/ sequence this span references. Usually nytl::Span<const T> is used when the\n\/\/\/\t\t\/\/ span is only read\n\/\/\/\t\tif(!names.empty()) {\n\/\/\/\t\t\tnames.front() = \"first name\";\n\/\/\/\t\t\tnames.back() = \"last name\";\n\/\/\/\t\t}\n\/\/\/\n\/\/\/\t\t\/\/ A span can additionally be sliced into a subspan. This can either be\n\/\/\/\t\t\/\/ done with a size known at compile time (which will result in a fixed-size span)\n\/\/\/\t\t\/\/ or dynamically for a dynamic-sized span.\n\/\/\/\t\tif(names.size() <= 2) return;\n\/\/\/\t\tfor(auto& name : names.slice(2, names.size() - 2)) \/\/ output everything but the first two\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/\n\/\/\/\t\tfor(auto& name : names.slice<2>(0)) \/\/ output only the first two names\n\/\/\/\t\t\tstd::cout << name << \"\\n\";\n\/\/\/ }\n\/\/\/ ```\ntemplate<typename T, std::size_t N>\nclass Span : public SpanStorage<T, N> {\npublic:\n\tusing Value = T;\n\tusing Iterator = T*;\n\tusing ReverseIterator = std::reverse_iterator<T*>;\n\tusing Reference = T&;\n\tusing Pointer = T*;\n\tusing Difference = std::ptrdiff_t;\n\tusing Size = std::size_t;\n\npublic:\n\tusing SpanStorage<T, N>::SpanStorage;\n\tconstexpr Span(std::nullptr_t) : Span(nullptr, 0) {}\n\n\ttemplate<typename C, typename = detail::ValidContainer<T, C>>\n\tconstexpr Span(C& c) : Span(c.data(), c.size()) {}\n\n\ttemplate<typename C, typename = detail::ValidContainer<T, C>, std::size_t S = C::size()>\n\tconstexpr Span(C& c) : Span(c.data()) {}\n\n\tconstexpr Pointer data() const noexcept { return this->data_; }\n\tconstexpr Size size() const noexcept { return this->size_; }\n\tconstexpr bool empty() const noexcept { return size() == 0; }\n\n\tconstexpr Iterator begin() const noexcept { return data(); }\n\tconstexpr Iterator end() const noexcept { return data() + size(); }\n\n\tconstexpr ReverseIterator rbegin() const noexcept { return {end()}; }\n\tconstexpr ReverseIterator rend() const noexcept { return {begin()}; }\n\n\tconstexpr Reference operator[](Size i) const noexcept { return *(data() + i); }\n\tconstexpr Reference at(Size i) const { checkThrow(i); return data()[i]; }\n\n\tconstexpr Reference front() const noexcept { return *data(); }\n\tconstexpr Reference back() const noexcept { return *(data() + size() - 1); }\n\n\tconstexpr Span<T> slice(Size pos, Size size) const { return {data() + pos, size}; }\n\ttemplate<Size S> constexpr Span<T, S> slice(Size pos) const { return {data() + pos}; }\n\nprotected:\n\tvoid checkThrow(Size i) const { if(i >= size()) throw std::out_of_range(\"nytl::Span::at\"); }\n};\n\n\/\/ Default SpanStorage implementation for compile-time size\ntemplate<typename T, std::size_t N>\nstruct SpanStorage {\n\tconstexpr SpanStorage() noexcept = default;\n\tconstexpr SpanStorage(T* pointer, std::size_t size = N) : data_(pointer)\n\t{\n\t\tif(size != N) throw std::logic_error(\"nytl::Span:: invalid size\");\n\t\tif(!pointer && size != 0) throw std::logic_error(\"nytl::Span:: invalid data\");\n\t}\n\tconstexpr SpanStorage(T& ref, std::size_t size = N) : SpanStorage(&ref, size) {}\n\tconstexpr SpanStorage(T (&arr)[N]) : SpanStorage(arr, N) {}\n\n\tT* data_;\n\tconstexpr static auto size_ = N;\n};\n\n\/\/ SpanStorage specialization for runtime size. Stored an extra size value.\ntemplate<typename T>\nstruct SpanStorage<T, constants::dynamicSize> {\n\tconstexpr SpanStorage() noexcept = default;\n\tconstexpr SpanStorage(T* pointer, std::size_t size) : data_(pointer), size_(size)\n\t{\n\t\tif(!pointer && size != 0) throw std::logic_error(\"nytl::Span:: invalid data\");\n\t}\n\tconstexpr SpanStorage(T& ref, std::size_t size) : SpanStorage(&ref, size) {}\n\ttemplate<std::size_t S> constexpr SpanStorage(T (&arr)[S]) : SpanStorage(arr, S) {}\n\n\tT* data_;\n\tstd::size_t size_;\n};\n\nnamespace detail {\n\n\/\/ Returns whether 'C' is a valid container to construct a Span<T> from\ntemplate<typename T, typename C>\nstruct ValidContainerT<T, C,\n\ttypename std::enable_if<\n\t\tstd::is_convertible<\n\t\t\tdecltype(std::declval<C>().data()),\n\t\t\tT*\n\t\t>::value &&\n\t\tstd::is_convertible<\n\t\t\tdecltype(std::declval<C>().size()),\n\t\t\tstd::size_t\n\t\t>::value\n\t>::type\n> { using type = void; };\n\n} \/\/ namespace detail\n} \/\/ namespace nytl\n\n#endif \/\/ header guard\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2015 The WebM project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \"test\/codec_factory.h\"\n#include \"test\/encode_test_driver.h\"\n#include \"test\/util.h\"\n#include \"test\/y4m_video_source.h\"\n#include \"test\/yuv_video_source.h\"\n#include \"vp9\/encoder\/vp9_ratectrl.h\"\n\nnamespace {\n\nconst unsigned int kFrames = 100;\nconst int kBitrate = 500;\n\n#define ARF_NOT_SEEN 1000001\n#define ARF_SEEN_ONCE 1000000\n\ntypedef struct {\n const char *filename;\n unsigned int width;\n unsigned int height;\n unsigned int framerate_num;\n unsigned int framerate_den;\n unsigned int input_bit_depth;\n vpx_img_fmt fmt;\n vpx_bit_depth_t bit_depth;\n unsigned int profile;\n} TestVideoParam;\n\ntypedef struct {\n libvpx_test::TestMode mode;\n int cpu_used;\n} TestEncodeParam;\n\nconst TestVideoParam kTestVectors[] = {\n \/\/ artificially increase framerate to trigger default check\n {\"hantro_collage_w352h288.yuv\", 352, 288, 5000, 1,\n 8, VPX_IMG_FMT_I420, VPX_BITS_8, 0},\n {\"hantro_collage_w352h288.yuv\", 352, 288, 30, 1,\n 8, VPX_IMG_FMT_I420, VPX_BITS_8, 0},\n {\"rush_hour_444.y4m\", 352, 288, 30, 1,\n 8, VPX_IMG_FMT_I444, VPX_BITS_8, 1},\n#if CONFIG_VP9_HIGHBITDEPTH\n \/\/ Add list of profile 2\/3 test videos here ...\n#endif \/\/ CONFIG_VP9_HIGHBITDEPTH\n};\n\nconst TestEncodeParam kEncodeVectors[] = {\n {::libvpx_test::kOnePassGood, 2},\n {::libvpx_test::kOnePassGood, 5},\n {::libvpx_test::kTwoPassGood, 1},\n {::libvpx_test::kTwoPassGood, 2},\n {::libvpx_test::kTwoPassGood, 5},\n {::libvpx_test::kRealTime, 5},\n};\n\nconst int kMinArfVectors[] = {\n \/\/ NOTE: 0 refers to the default built-in logic in:\n \/\/ vp9_rc_get_default_min_gf_interval(...)\n 0, 4, 8, 12, 15\n};\n\nint is_extension_y4m(const char *filename) {\n const char *dot = strrchr(filename, '.');\n if (!dot || dot == filename)\n return 0;\n else\n return !strcmp(dot, \".y4m\");\n}\n\nclass ArfFreqTest\n : public ::libvpx_test::EncoderTest,\n public ::libvpx_test::CodecTestWith3Params<TestVideoParam, \\\n TestEncodeParam, int> {\n protected:\n ArfFreqTest()\n : EncoderTest(GET_PARAM(0)),\n test_video_param_(GET_PARAM(1)),\n test_encode_param_(GET_PARAM(2)),\n min_arf_requested_(GET_PARAM(3)) {\n }\n\n virtual ~ArfFreqTest() {}\n\n virtual void SetUp() {\n InitializeConfig();\n SetMode(test_encode_param_.mode);\n if (test_encode_param_.mode != ::libvpx_test::kRealTime) {\n cfg_.g_lag_in_frames = 25;\n cfg_.rc_end_usage = VPX_VBR;\n } else {\n cfg_.g_lag_in_frames = 0;\n cfg_.rc_end_usage = VPX_CBR;\n cfg_.rc_buf_sz = 1000;\n cfg_.rc_buf_initial_sz = 500;\n cfg_.rc_buf_optimal_sz = 600;\n }\n dec_cfg_.threads = 4;\n }\n\n virtual void BeginPassHook(unsigned int) {\n min_run_ = ARF_NOT_SEEN;\n run_of_visible_frames_ = 0;\n }\n\n int GetNumFramesInPkt(const vpx_codec_cx_pkt_t *pkt) {\n const uint8_t *buffer = reinterpret_cast<uint8_t*>(pkt->data.frame.buf);\n const uint8_t marker = buffer[pkt->data.frame.sz - 1];\n const int mag = ((marker >> 3) & 3) + 1;\n int frames = (marker & 0x7) + 1;\n const unsigned int index_sz = 2 + mag * frames;\n \/\/ Check for superframe or not.\n \/\/ Assume superframe has only one visible frame, the rest being\n \/\/ invisible. If superframe index is not found, then there is only\n \/\/ one frame.\n if (!((marker & 0xe0) == 0xc0 &&\n pkt->data.frame.sz >= index_sz &&\n buffer[pkt->data.frame.sz - index_sz] == marker)) {\n frames = 1;\n }\n return frames;\n }\n\n virtual void FramePktHook(const vpx_codec_cx_pkt_t *pkt) {\n if (pkt->kind != VPX_CODEC_CX_FRAME_PKT)\n return;\n const int frames = GetNumFramesInPkt(pkt);\n if (frames == 1) {\n run_of_visible_frames_++;\n } else if (frames == 2) {\n if (min_run_ == ARF_NOT_SEEN) {\n min_run_ = ARF_SEEN_ONCE;\n } else if (min_run_ == ARF_SEEN_ONCE ||\n run_of_visible_frames_ < min_run_) {\n min_run_ = run_of_visible_frames_;\n }\n run_of_visible_frames_ = 1;\n } else {\n min_run_ = 0;\n run_of_visible_frames_ = 1;\n }\n }\n\n virtual void PreEncodeFrameHook(::libvpx_test::VideoSource *video,\n ::libvpx_test::Encoder *encoder) {\n if (video->frame() == 0) {\n encoder->Control(VP9E_SET_FRAME_PARALLEL_DECODING, 1);\n encoder->Control(VP9E_SET_TILE_COLUMNS, 4);\n encoder->Control(VP8E_SET_CPUUSED, test_encode_param_.cpu_used);\n encoder->Control(VP9E_SET_MIN_GF_INTERVAL, min_arf_requested_);\n if (test_encode_param_.mode != ::libvpx_test::kRealTime) {\n encoder->Control(VP8E_SET_ENABLEAUTOALTREF, 1);\n encoder->Control(VP8E_SET_ARNR_MAXFRAMES, 7);\n encoder->Control(VP8E_SET_ARNR_STRENGTH, 5);\n encoder->Control(VP8E_SET_ARNR_TYPE, 3);\n }\n }\n }\n\n int GetMinVisibleRun() const {\n return min_run_;\n }\n\n int GetMinArfDistanceRequested() const {\n if (min_arf_requested_)\n return min_arf_requested_;\n else\n return vp9_rc_get_default_min_gf_interval(\n test_video_param_.width, test_video_param_.height,\n (double)test_video_param_.framerate_num \/\n test_video_param_.framerate_den);\n }\n\n TestVideoParam test_video_param_;\n TestEncodeParam test_encode_param_;\n\n private:\n int min_arf_requested_;\n int min_run_;\n int run_of_visible_frames_;\n};\n\nTEST_P(ArfFreqTest, MinArfFreqTest) {\n cfg_.rc_target_bitrate = kBitrate;\n cfg_.g_error_resilient = 0;\n cfg_.g_profile = test_video_param_.profile;\n cfg_.g_input_bit_depth = test_video_param_.input_bit_depth;\n cfg_.g_bit_depth = test_video_param_.bit_depth;\n init_flags_ = VPX_CODEC_USE_PSNR;\n if (cfg_.g_bit_depth > 8)\n init_flags_ |= VPX_CODEC_USE_HIGHBITDEPTH;\n\n libvpx_test::VideoSource *video;\n if (is_extension_y4m(test_video_param_.filename)) {\n video = new libvpx_test::Y4mVideoSource(test_video_param_.filename,\n 0, kFrames);\n } else {\n video = new libvpx_test::YUVVideoSource(test_video_param_.filename,\n test_video_param_.fmt,\n test_video_param_.width,\n test_video_param_.height,\n test_video_param_.framerate_num,\n test_video_param_.framerate_den,\n 0, kFrames);\n }\n\n ASSERT_NO_FATAL_FAILURE(RunLoop(video));\n const int min_run = GetMinVisibleRun();\n const int min_arf_dist_requested = GetMinArfDistanceRequested();\n if (min_run != ARF_NOT_SEEN && min_run != ARF_SEEN_ONCE) {\n const int min_arf_dist = min_run + 1;\n EXPECT_GE(min_arf_dist, min_arf_dist_requested);\n }\n delete(video);\n}\n\nVP9_INSTANTIATE_TEST_CASE(\n ArfFreqTest,\n ::testing::ValuesIn(kTestVectors),\n ::testing::ValuesIn(kEncodeVectors),\n ::testing::ValuesIn(kMinArfVectors));\n\nVP10_INSTANTIATE_TEST_CASE(\n ArfFreqTest,\n ::testing::ValuesIn(kTestVectors),\n ::testing::ValuesIn(kEncodeVectors),\n ::testing::ValuesIn(kMinArfVectors));\n} \/\/ namespace\n<commit_msg>vp9_arf_freq_test: disable vp10 w\/high bitdepth<commit_after>\/*\n * Copyright (c) 2015 The WebM project authors. All Rights Reserved.\n *\n * Use of this source code is governed by a BSD-style license\n * that can be found in the LICENSE file in the root of the source\n * tree. An additional intellectual property rights grant can be found\n * in the file PATENTS. All contributing project authors may\n * be found in the AUTHORS file in the root of the source tree.\n *\/\n\n#include \"third_party\/googletest\/src\/include\/gtest\/gtest.h\"\n\n#include \"test\/codec_factory.h\"\n#include \"test\/encode_test_driver.h\"\n#include \"test\/util.h\"\n#include \"test\/y4m_video_source.h\"\n#include \"test\/yuv_video_source.h\"\n#include \"vp9\/encoder\/vp9_ratectrl.h\"\n\nnamespace {\n\nconst unsigned int kFrames = 100;\nconst int kBitrate = 500;\n\n#define ARF_NOT_SEEN 1000001\n#define ARF_SEEN_ONCE 1000000\n\ntypedef struct {\n const char *filename;\n unsigned int width;\n unsigned int height;\n unsigned int framerate_num;\n unsigned int framerate_den;\n unsigned int input_bit_depth;\n vpx_img_fmt fmt;\n vpx_bit_depth_t bit_depth;\n unsigned int profile;\n} TestVideoParam;\n\ntypedef struct {\n libvpx_test::TestMode mode;\n int cpu_used;\n} TestEncodeParam;\n\nconst TestVideoParam kTestVectors[] = {\n \/\/ artificially increase framerate to trigger default check\n {\"hantro_collage_w352h288.yuv\", 352, 288, 5000, 1,\n 8, VPX_IMG_FMT_I420, VPX_BITS_8, 0},\n {\"hantro_collage_w352h288.yuv\", 352, 288, 30, 1,\n 8, VPX_IMG_FMT_I420, VPX_BITS_8, 0},\n {\"rush_hour_444.y4m\", 352, 288, 30, 1,\n 8, VPX_IMG_FMT_I444, VPX_BITS_8, 1},\n#if CONFIG_VP9_HIGHBITDEPTH\n \/\/ Add list of profile 2\/3 test videos here ...\n#endif \/\/ CONFIG_VP9_HIGHBITDEPTH\n};\n\nconst TestEncodeParam kEncodeVectors[] = {\n {::libvpx_test::kOnePassGood, 2},\n {::libvpx_test::kOnePassGood, 5},\n {::libvpx_test::kTwoPassGood, 1},\n {::libvpx_test::kTwoPassGood, 2},\n {::libvpx_test::kTwoPassGood, 5},\n {::libvpx_test::kRealTime, 5},\n};\n\nconst int kMinArfVectors[] = {\n \/\/ NOTE: 0 refers to the default built-in logic in:\n \/\/ vp9_rc_get_default_min_gf_interval(...)\n 0, 4, 8, 12, 15\n};\n\nint is_extension_y4m(const char *filename) {\n const char *dot = strrchr(filename, '.');\n if (!dot || dot == filename)\n return 0;\n else\n return !strcmp(dot, \".y4m\");\n}\n\nclass ArfFreqTest\n : public ::libvpx_test::EncoderTest,\n public ::libvpx_test::CodecTestWith3Params<TestVideoParam, \\\n TestEncodeParam, int> {\n protected:\n ArfFreqTest()\n : EncoderTest(GET_PARAM(0)),\n test_video_param_(GET_PARAM(1)),\n test_encode_param_(GET_PARAM(2)),\n min_arf_requested_(GET_PARAM(3)) {\n }\n\n virtual ~ArfFreqTest() {}\n\n virtual void SetUp() {\n InitializeConfig();\n SetMode(test_encode_param_.mode);\n if (test_encode_param_.mode != ::libvpx_test::kRealTime) {\n cfg_.g_lag_in_frames = 25;\n cfg_.rc_end_usage = VPX_VBR;\n } else {\n cfg_.g_lag_in_frames = 0;\n cfg_.rc_end_usage = VPX_CBR;\n cfg_.rc_buf_sz = 1000;\n cfg_.rc_buf_initial_sz = 500;\n cfg_.rc_buf_optimal_sz = 600;\n }\n dec_cfg_.threads = 4;\n }\n\n virtual void BeginPassHook(unsigned int) {\n min_run_ = ARF_NOT_SEEN;\n run_of_visible_frames_ = 0;\n }\n\n int GetNumFramesInPkt(const vpx_codec_cx_pkt_t *pkt) {\n const uint8_t *buffer = reinterpret_cast<uint8_t*>(pkt->data.frame.buf);\n const uint8_t marker = buffer[pkt->data.frame.sz - 1];\n const int mag = ((marker >> 3) & 3) + 1;\n int frames = (marker & 0x7) + 1;\n const unsigned int index_sz = 2 + mag * frames;\n \/\/ Check for superframe or not.\n \/\/ Assume superframe has only one visible frame, the rest being\n \/\/ invisible. If superframe index is not found, then there is only\n \/\/ one frame.\n if (!((marker & 0xe0) == 0xc0 &&\n pkt->data.frame.sz >= index_sz &&\n buffer[pkt->data.frame.sz - index_sz] == marker)) {\n frames = 1;\n }\n return frames;\n }\n\n virtual void FramePktHook(const vpx_codec_cx_pkt_t *pkt) {\n if (pkt->kind != VPX_CODEC_CX_FRAME_PKT)\n return;\n const int frames = GetNumFramesInPkt(pkt);\n if (frames == 1) {\n run_of_visible_frames_++;\n } else if (frames == 2) {\n if (min_run_ == ARF_NOT_SEEN) {\n min_run_ = ARF_SEEN_ONCE;\n } else if (min_run_ == ARF_SEEN_ONCE ||\n run_of_visible_frames_ < min_run_) {\n min_run_ = run_of_visible_frames_;\n }\n run_of_visible_frames_ = 1;\n } else {\n min_run_ = 0;\n run_of_visible_frames_ = 1;\n }\n }\n\n virtual void PreEncodeFrameHook(::libvpx_test::VideoSource *video,\n ::libvpx_test::Encoder *encoder) {\n if (video->frame() == 0) {\n encoder->Control(VP9E_SET_FRAME_PARALLEL_DECODING, 1);\n encoder->Control(VP9E_SET_TILE_COLUMNS, 4);\n encoder->Control(VP8E_SET_CPUUSED, test_encode_param_.cpu_used);\n encoder->Control(VP9E_SET_MIN_GF_INTERVAL, min_arf_requested_);\n if (test_encode_param_.mode != ::libvpx_test::kRealTime) {\n encoder->Control(VP8E_SET_ENABLEAUTOALTREF, 1);\n encoder->Control(VP8E_SET_ARNR_MAXFRAMES, 7);\n encoder->Control(VP8E_SET_ARNR_STRENGTH, 5);\n encoder->Control(VP8E_SET_ARNR_TYPE, 3);\n }\n }\n }\n\n int GetMinVisibleRun() const {\n return min_run_;\n }\n\n int GetMinArfDistanceRequested() const {\n if (min_arf_requested_)\n return min_arf_requested_;\n else\n return vp9_rc_get_default_min_gf_interval(\n test_video_param_.width, test_video_param_.height,\n (double)test_video_param_.framerate_num \/\n test_video_param_.framerate_den);\n }\n\n TestVideoParam test_video_param_;\n TestEncodeParam test_encode_param_;\n\n private:\n int min_arf_requested_;\n int min_run_;\n int run_of_visible_frames_;\n};\n\nTEST_P(ArfFreqTest, MinArfFreqTest) {\n cfg_.rc_target_bitrate = kBitrate;\n cfg_.g_error_resilient = 0;\n cfg_.g_profile = test_video_param_.profile;\n cfg_.g_input_bit_depth = test_video_param_.input_bit_depth;\n cfg_.g_bit_depth = test_video_param_.bit_depth;\n init_flags_ = VPX_CODEC_USE_PSNR;\n if (cfg_.g_bit_depth > 8)\n init_flags_ |= VPX_CODEC_USE_HIGHBITDEPTH;\n\n libvpx_test::VideoSource *video;\n if (is_extension_y4m(test_video_param_.filename)) {\n video = new libvpx_test::Y4mVideoSource(test_video_param_.filename,\n 0, kFrames);\n } else {\n video = new libvpx_test::YUVVideoSource(test_video_param_.filename,\n test_video_param_.fmt,\n test_video_param_.width,\n test_video_param_.height,\n test_video_param_.framerate_num,\n test_video_param_.framerate_den,\n 0, kFrames);\n }\n\n ASSERT_NO_FATAL_FAILURE(RunLoop(video));\n const int min_run = GetMinVisibleRun();\n const int min_arf_dist_requested = GetMinArfDistanceRequested();\n if (min_run != ARF_NOT_SEEN && min_run != ARF_SEEN_ONCE) {\n const int min_arf_dist = min_run + 1;\n EXPECT_GE(min_arf_dist, min_arf_dist_requested);\n }\n delete(video);\n}\n\nVP9_INSTANTIATE_TEST_CASE(\n ArfFreqTest,\n ::testing::ValuesIn(kTestVectors),\n ::testing::ValuesIn(kEncodeVectors),\n ::testing::ValuesIn(kMinArfVectors));\n\n#if CONFIG_VP9_HIGHBITDEPTH\n# if CONFIG_VP10_ENCODER\n\/\/ TODO(angiebird): 25-29 fail in high bitdepth mode.\nINSTANTIATE_TEST_CASE_P(\n DISABLED_VP10, ArfFreqTest,\n ::testing::Combine(\n ::testing::Values(static_cast<const libvpx_test::CodecFactory *>(\n &libvpx_test::kVP10)),\n ::testing::ValuesIn(kTestVectors),\n ::testing::ValuesIn(kEncodeVectors),\n ::testing::ValuesIn(kMinArfVectors)));\n# endif \/\/ CONFIG_VP10_ENCODER\n#else\nVP10_INSTANTIATE_TEST_CASE(\n ArfFreqTest,\n ::testing::ValuesIn(kTestVectors),\n ::testing::ValuesIn(kEncodeVectors),\n ::testing::ValuesIn(kMinArfVectors));\n#endif \/\/ CONFIG_VP9_HIGHBITDEPTH\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>#define BOOST_TEST_MODULE\n#include <boost\/test\/included\/unit_test.hpp>\n\n#include \"test_servers.hpp\"\n\nBOOST_AUTO_TEST_SUITE( write_errors )\n\nBOOST_FIXTURE_TEST_CASE( pdu_to_small, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x02 }, 0x12, 0x0000, 0x04 ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( no_such_handle, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x17, 0xAA, 0x01 }, 0x12, 0xAA17, 0x0A ) );\n BOOST_CHECK( check_error_response( { 0x12, 0x04, 0x00 }, 0x12, 0x0004, 0x0A ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( invalid_handle, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x00, 0x00 }, 0x12, 0x0000, 0x01 ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( write_protected, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x03, 0x00, 0x00, 0x00 }, 0x12, 0x0003, 0x03 ) );\n}\n\nstd::uint32_t value = 0x0000;\n\ntypedef bluetoe::server<\n bluetoe::service<\n bluetoe::service_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CA9 >,\n bluetoe::characteristic<\n bluetoe::characteristic_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CAA >,\n bluetoe::bind_characteristic_value< decltype( value ), &value >\n >\n >\n> small_value_server;\n\nBOOST_FIXTURE_TEST_CASE( pdu_to_large, test::request_with_reponse< small_value_server > )\n{\n value = 0x3512;\n BOOST_CHECK( check_error_response( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05 }, 0x12, 0x0003, 0x0D ) );\n BOOST_CHECK_EQUAL( value, 0x3512u );\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_AUTO_TEST_SUITE( write_requests )\n\nstd::uint32_t value = 0x0000;\n\ntypedef bluetoe::server<\n bluetoe::service<\n bluetoe::service_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CA9 >,\n bluetoe::characteristic<\n bluetoe::characteristic_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CAA >,\n bluetoe::bind_characteristic_value< decltype( value ), &value >\n >\n >\n> small_value_server;\n\nBOOST_FIXTURE_TEST_CASE( write_full_data, test::request_with_reponse< small_value_server > )\n{\n value = 0x3512;\n l2cap_input( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03, 0x04 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x04030201u );\n}\n\nBOOST_FIXTURE_TEST_CASE( write_full_data_part, test::request_with_reponse< small_value_server > )\n{\n value = 0x44332211;\n l2cap_input( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x44030201u );\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<commit_msg>add test for write request \/ command<commit_after>#define BOOST_TEST_MODULE\n#include <boost\/test\/included\/unit_test.hpp>\n\n#include \"test_servers.hpp\"\n\nBOOST_AUTO_TEST_SUITE( write_errors )\n\nBOOST_FIXTURE_TEST_CASE( pdu_to_small, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x02 }, 0x12, 0x0000, 0x04 ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( no_such_handle, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x17, 0xAA, 0x01 }, 0x12, 0xAA17, 0x0A ) );\n BOOST_CHECK( check_error_response( { 0x12, 0x04, 0x00 }, 0x12, 0x0004, 0x0A ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( invalid_handle, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x00, 0x00 }, 0x12, 0x0000, 0x01 ) );\n}\n\nBOOST_FIXTURE_TEST_CASE( write_protected, test::small_temperature_service_with_response<> )\n{\n BOOST_CHECK( check_error_response( { 0x12, 0x03, 0x00, 0x00, 0x00 }, 0x12, 0x0003, 0x03 ) );\n}\n\nstd::uint32_t value = 0x0000;\n\ntypedef bluetoe::server<\n bluetoe::service<\n bluetoe::service_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CA9 >,\n bluetoe::characteristic<\n bluetoe::characteristic_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CAA >,\n bluetoe::bind_characteristic_value< decltype( value ), &value >\n >\n >\n> small_value_server;\n\nBOOST_FIXTURE_TEST_CASE( pdu_to_large, test::request_with_reponse< small_value_server > )\n{\n value = 0x3512;\n BOOST_CHECK( check_error_response( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05 }, 0x12, 0x0003, 0x0D ) );\n BOOST_CHECK_EQUAL( value, 0x3512u );\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_AUTO_TEST_SUITE( write_requests )\n\nstd::uint32_t value = 0x0000;\n\ntypedef bluetoe::server<\n bluetoe::service<\n bluetoe::service_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CA9 >,\n bluetoe::characteristic<\n bluetoe::characteristic_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CAA >,\n bluetoe::bind_characteristic_value< decltype( value ), &value >\n >\n >\n> small_value_server;\n\nBOOST_FIXTURE_TEST_CASE( write_full_data, test::request_with_reponse< small_value_server > )\n{\n value = 0x3512;\n l2cap_input( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03, 0x04 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x04030201u );\n}\n\nBOOST_FIXTURE_TEST_CASE( write_full_data_part, test::request_with_reponse< small_value_server > )\n{\n value = 0x44332211;\n l2cap_input( { 0x12, 0x03, 0x00, 0x01, 0x02, 0x03 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x44030201u );\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n\nBOOST_AUTO_TEST_SUITE( write_requests_with_fixed_handles )\n\nstd::uint32_t value = 0x0000;\n\ntypedef bluetoe::server<\n bluetoe::service<\n bluetoe::attribute_handle< 0x4444 >,\n bluetoe::service_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CA9 >,\n bluetoe::characteristic<\n bluetoe::characteristic_uuid< 0x8C8B4094, 0x0DE2, 0x499F, 0xA28A, 0x4EED5BC73CAA >,\n bluetoe::bind_characteristic_value< decltype( value ), &value >\n >\n >\n> small_value_server;\n\nBOOST_FIXTURE_TEST_CASE( write_full_data, test::request_with_reponse< small_value_server > )\n{\n value = 0x3512;\n l2cap_input( { 0x12, 0x46, 0x44, 0x01, 0x02, 0x03, 0x04 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x04030201u );\n}\n\nBOOST_FIXTURE_TEST_CASE( write_full_data_part, test::request_with_reponse< small_value_server > )\n{\n value = 0x44332211;\n l2cap_input( { 0x12, 0x46, 0x44, 0x01, 0x02, 0x03 } );\n expected_result( { 0x13 } );\n BOOST_CHECK_EQUAL( value, 0x44030201u );\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtCore module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qservicemanager.h\"\n#include \"qserviceplugininterface.h\"\n#include \"qabstractsecuritysession.h\"\n#include \"servicedatabase.h\"\n\n#include <QObject>\n#include <QPluginLoader>\n#include <QBuffer>\n#include <QFile>\n#include <QDebug>\n\nQT_BEGIN_NAMESPACE\n\n\nstatic QString qservicemanager_resolveLibraryPath(const QString &libNameOrPath)\n{\n if (QFile::exists(libNameOrPath))\n return libNameOrPath;\n\n \/\/ try to find plug-in via QLibrary\n const QStringList paths = QCoreApplication::libraryPaths();\n for (int i=0; i<paths.count(); i++) {\n QLibrary lib(paths[i] + QDir::separator() + libNameOrPath);\n if (lib.load()) {\n lib.unload();\n return lib.fileName();\n }\n }\n return QString();\n}\n\n\nclass QServicePluginCleanup : public QObject\n{\n Q_OBJECT\npublic:\n QServicePluginCleanup(QPluginLoader *loader, QServicePluginInterface *pluginInterface, QObject *parent = 0)\n : QObject(parent),\n m_pluginInterface(pluginInterface),\n m_loader(loader)\n {\n }\n\n ~QServicePluginCleanup()\n {\n delete m_pluginInterface;\n if (m_loader) {\n m_loader->unload();\n delete m_loader;\n }\n }\n\n\n\n QServicePluginInterface *m_pluginInterface;\n QPluginLoader *m_loader;\n};\n\nclass QServiceManagerPrivate\n{\npublic:\n ServiceDatabase *database;\n QServiceManager::Scope scope;\n\n void init(QServiceManager *mgr, QServiceManager::Scope databaseScope)\n {\n database = new ServiceDatabase;\n scope = databaseScope;\n\n QObject::connect(database, SIGNAL(serviceAdded(QString)),\n mgr, SIGNAL(serviceAdded(QString)));\n QObject::connect(database, SIGNAL(serviceRemoved(QString)),\n mgr, SIGNAL(serviceRemoved(QString)));\n\n if (!database->open())\n qWarning(\"QServiceManager: unable to open services database\");\n }\n};\n\n\/*!\n \\class QServiceManager\n \\brief The QServiceManager class enables the loading of service plugins \n and the (de)registration of services.\n\n A service is a stand-alone component that can be used by multiple clients. \n Each service implementation must derive from QObject. Clients request a \n reference to a service via \\l loadInterface() or \\l getInterface().\n\n Services are separate deliveries in the form of plug-ins. New services can be (de)registered \n at any time via \\l addService() and \\l removeService() respectively. Such an event is \n published via the \\l serviceAdded() and \\l serviceRemoved() signal.\n Each service plug-in must implement QServicePluginInterface.\n\n Each plug-in may support multiple interfaces and may even provide multiple implementations \n for the same interface. Individual implementations are identified via \n QServiceInterfaceDescriptor. For a more detailed explanation of services and how they relate to\n interface and their implementations please see QServiceInterfaceDescriptor. \n \n \\sa QServicePluginInterface, QServiceContext, QAbstractSecuritySession\n*\/\n\n\/*!\n \\enum QServiceManager::Scope\n\n \\value UserScope When adding and removing services, use a database\n specific to the current user (e.g. in the user's home directory). When\n searching for services and interface implementations, first search in the\n user-specific database; if the service or interface implementation\n is not found, search in the system-wide services database.\n\n \\value SystemScope When adding and removing services, use a database\n in a global location accessible by all users. When searching\n for services and interface implementations, search only in the system-wide\n services database.\n*\/\n\n\/*!\n \\fn void QServiceManager::serviceAdded(const QString& serviceName)\n\n This signal is emited whenever a new service with the given \n \\a serviceName has been registered with the service manager.\n\n \\sa addService()\n*\/\n\n\/*!\n \\fn void QServiceManager::serviceRemoved(const QString& serviceName)\n\n This signal is emited whenever a service with the given \n \\a serviceName has been deregistered with the service manager.\n\n \\sa removeService()\n*\/\n\n\/*!\n Creates a service manager with the given \\a parent.\n\n The scope will default to QServiceManager::UserScope.\n*\/\nQServiceManager::QServiceManager(QObject *parent)\n : QObject(parent),\n d(new QServiceManagerPrivate)\n{\n d->init(this, UserScope);\n}\n\n\/*!\n Creates a service manager with the given \\a scope and \\a parent.\n*\/\nQServiceManager::QServiceManager(Scope scope, QObject *parent)\n : QObject(parent),\n d(new QServiceManagerPrivate)\n{\n d->init(this, scope);\n}\n\n\/*!\n Destroys the service manager.\n*\/\nQServiceManager::~QServiceManager()\n{\n d->database->close();\n delete d->database;\n delete d;\n}\n\n\/*!\n Returns the scope used for registering and searching of services.\n*\/\nQServiceManager::Scope QServiceManager::scope() const\n{\n return d->scope;\n}\n\n\/*!\n Returns a list of the services that provide the interface specified by\n \\a interfaceName.\n*\/\nQStringList QServiceManager::findServices(const QString& interfaceName) const\n{\n QStringList services;\n QList<ServiceInfo> serviceInfoList;\n if (!d->database->isOpen())\n return services;\n services = d->database->getServiceNames(interfaceName);\n return services;\n}\n\n\/*!\n Returns a list of the interfaces that match the specified \\a filter.\n*\/\nQList<QServiceInterfaceDescriptor> QServiceManager::findInterfaces(const QServiceFilter& filter) const\n{\n if (!d->database->isOpen())\n return QList<QServiceInterfaceDescriptor>();\n bool ok = false;\n QList<QServiceInterfaceDescriptor> descriptors = d->database->getInterfaces(filter, &ok);\n if (!ok)\n return QList<QServiceInterfaceDescriptor>();\n return descriptors;\n}\n\n\/*!\n Returns a list of the interfaces provided by the service named\n \\a serviceName.\n*\/\nQList<QServiceInterfaceDescriptor> QServiceManager::findInterfaces(const QString& serviceName) const\n{\n QServiceFilter filter;\n if (!serviceName.isEmpty())\n filter.setServiceName(serviceName);\n return findInterfaces(filter);\n}\n\n\/*!\n Loads and returns the interface specified by \\a interfaceName, as\n provided by the default service for this interface, using the given\n \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function.\n\n The caller takes ownership of the returned pointer.\n \n This function returns a null pointer if the requested service cannot be found.\n*\/\nQObject* QServiceManager::loadInterface(const QString& interfaceName, QServiceContext* context, QAbstractSecuritySession* session)\n{\n return loadInterface(defaultServiceInterface(interfaceName), context, session);\n}\n\n\/*!\n Loads and returns the interface specified by \\a descriptor using the\n given \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function.\n\n The caller takes ownership of the returned pointer.\n\n This function returns a null pointer if the requested service cannot be found.\n*\/\nQObject* QServiceManager::loadInterface(const QServiceInterfaceDescriptor& descriptor, QServiceContext* context, QAbstractSecuritySession* session)\n{\n if (!descriptor.isValid()) {\n qWarning() << \"QServiceManager::loadInterface() given invalid descriptor\";\n return 0;\n }\n\n const QStringList serviceCaps = descriptor.property(QServiceInterfaceDescriptor::Capabilities).toStringList();\n if ( session && !session->isAllowed(serviceCaps) )\n return 0; \/\/TODO set error state on context object, if it exists\n\n QString serviceFilePath = qservicemanager_resolveLibraryPath(\n descriptor.property(QServiceInterfaceDescriptor::Location).toString());\n if (serviceFilePath.isEmpty()) {\n qWarning() << \"QServiceManager::loadInterface() cannot locate library file for plugin:\"\n << descriptor.property(QServiceInterfaceDescriptor::Location).toString();\n return 0;\n }\n\n QPluginLoader *loader = new QPluginLoader(serviceFilePath);\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n\n if (pluginIFace) {\n QObject *obj = pluginIFace->createInstance(descriptor, context, session);\n if (obj) {\n QServicePluginCleanup *cleanup = new QServicePluginCleanup(loader, pluginIFace);\n QObject::connect(obj, SIGNAL(destroyed()), cleanup, SLOT(deleteLater()));\n return obj;\n }\n delete pluginIFace;\n }\n\n qWarning() << \"QServiceManager::loadInterface() cannot load plugin at\"\n << serviceFilePath << \":\" << loader->errorString();\n loader->unload();\n delete loader;\n\n return 0;\n}\n\n\/*!\n \\fn T* QServiceManager::getInterface(const QString& interfaceName, QServiceContext* context, QAbstractSecuritySession* session)\n\n Loads the service object implementing \\a interfaceName,\n as provided by the default service for this interface, using the given\n \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function. The template class must be derived from QObject.\n\n If \\a interfaceName is not a known interface the returned pointer will be null.\n\n The caller takes ownership of the returned pointer.\n*\/\n\n\n\/*!\n \\fn T* QServiceManager::getInterface(const QServiceInterfaceDescriptor& serviceDescriptor, QServiceContext* context, QAbstractSecuritySession* session)\n\n Loads the service object identified by \\a serviceDescriptor\n using the given \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function. The template class must be derived from QObject.\n\n\n If the \\a serviceDescriptor is not valid the returned pointer will be null.\n\n The caller takes ownership of the returned pointer.\n*\/\n\n\/*!\n Registers the service defined by the XML file at \\a xmlFilePath.\n Returns true if the registration succeeded, and false otherwise.\n\n If a previously unkown interface is added the newly registered service automatically\n becomes the new default service provider for the new interface.\n\n A service plugin cannot be added if another service is already registered\n with the same plugin file path. A service plugin also cannot be added if\n the service is already registered and implements any of the same interface\n versions that the new plugin implements.\n\n \\sa setDefaultServiceForInterface()\n*\/\nbool QServiceManager::addService(const QString& xmlFilePath)\n{\n QFile *f = new QFile(xmlFilePath);\n bool b = addService(f);\n delete f;\n return b;\n}\n\n\/*!\n Registers the service defined by the XML data from the given \\a device.\n Returns true if the registration succeeded, and false otherwise. If a\n previously unkown interface is added the newly registered service\n automatically becomes the new default service provider for the new\n interface.\n\n Registering a service also causes QServicePluginInterface::installService()\n to be called on the service. If the service plugin is not accessible\n (e.g. if the plugin file is not found) and \\c installService() cannot\n be invoked on the service, the registration fails and this method returns\n false.\n\n A service plugin cannot be added if another service is already registered\n with the same plugin file path. A service plugin also cannot be added if\n the service is already registered and implements any of the same interface\n versions that the new plugin implements.\n\n \\sa setDefaultServiceForInterface()\n*\/\nbool QServiceManager::addService(QIODevice *device)\n{\n if (!d->database->isOpen())\n return false;\n ServiceMetaData data(device);\n if (!data.extractMetadata())\n return false;\n\n bool result = d->database->registerService(data);\n if (result) {\n QPluginLoader *loader = new QPluginLoader(qservicemanager_resolveLibraryPath(data.location()));\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n if (pluginIFace) {\n pluginIFace->installService();\n } else {\n result = false;\n d->database->unregisterService(data.name());\n }\n loader->unload();\n delete loader;\n }\n return result;\n}\n\n\/*!\n Unregisters the service specified by \\a serviceName.\n\n Returns true if the unregistration succeeded, and false otherwise.\n\n If a default service implementation is removed and there are other implementations\n for the same interface, the service manager chooses the implementation with the\n highest version number as the new default. If there is more than one serivce \n with the same version number, the service manager makes a random choice with \n regards to the new default implementation. If this is \n not the desired behaviour the default selection should be updated\n via setDefaultServiceForInterface(). \n*\/\nbool QServiceManager::removeService(const QString& serviceName)\n{\n if (!d->database->isOpen())\n return false;\n if (serviceName.isEmpty())\n return false;\n\n \/\/ Call QServicePluginInterface::uninstallService() on all plugins that\n \/\/ match this service\n\n QSet<QString> pluginPathsSet;\n QList<QServiceInterfaceDescriptor> descriptors = findInterfaces(serviceName);\n for (int i=0; i<descriptors.count(); i++)\n pluginPathsSet << descriptors[i].property(QServiceInterfaceDescriptor::Location).toString();\n\n QList<QString> pluginPaths = pluginPathsSet.toList();\n for (int i=0; i<pluginPaths.count(); i++) {\n QPluginLoader *loader = new QPluginLoader(qservicemanager_resolveLibraryPath(pluginPaths[i]));\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n if (pluginIFace)\n pluginIFace->uninstallService();\n else\n qWarning() << \"QServiceManager: unable to invoke uninstallService() on removed service\";\n loader->unload();\n delete loader;\n }\n\n return d->database->unregisterService(serviceName);\n}\n\n\/*!\n Sets the default interface implementation for \\a interfaceName to the\n matching interface implementation provided by \\a service.\n\n If \\a service provides more than one interface implementation for\n \\a interfaceName, the newest version of the interface is set as the\n default.\n\n Returns true if the operation succeeded, and false otherwise.\n*\/\nbool QServiceManager::setDefaultServiceForInterface(const QString &service, const QString &interfaceName)\n{\n if (!d->database->isOpen())\n return false;\n if (interfaceName.isEmpty() || service.isEmpty())\n return false;\n return d->database->setDefaultService(service, interfaceName);\n}\n\n\/*!\n \\overload\n\n Sets the interface implementation specified by \\a descriptor to be the\n default implementation for the particular interface specified in the\n descriptor.\n\n Returns true if the operation succeeded, and false otherwise.\n*\/\nbool QServiceManager::setDefaultServiceForInterface(const QServiceInterfaceDescriptor& descriptor)\n{\n if (!d->database->isOpen())\n return false;\n if (!descriptor.isValid())\n return false;\n return d->database->setDefaultService(descriptor);\n}\n\n\/*!\n Returns the default interface for the given \\a interfaceName.\n*\/\nQServiceInterfaceDescriptor QServiceManager::defaultServiceInterface(const QString& interfaceName) const\n{\n if (!d->database->isOpen())\n return QServiceInterfaceDescriptor();\n bool ok = false;\n QServiceInterfaceDescriptor info;\n info = d->database->defaultServiceInterface(interfaceName, &ok);\n if (!ok)\n return QServiceInterfaceDescriptor();\n\n return info;\n}\n\nQT_END_NAMESPACE\n\n#include \"qservicemanager.moc\"\n<commit_msg>Don't mention databases for UserScope\/SystemScope documentation.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** This file is part of the QtCore module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the either Technology Preview License Agreement or the\n** Beta Release License Agreement.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain\n** additional rights. These rights are described in the Nokia Qt LGPL\n** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this\n** package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qservicemanager.h\"\n#include \"qserviceplugininterface.h\"\n#include \"qabstractsecuritysession.h\"\n#include \"servicedatabase.h\"\n\n#include <QObject>\n#include <QPluginLoader>\n#include <QBuffer>\n#include <QFile>\n#include <QDebug>\n\nQT_BEGIN_NAMESPACE\n\n\nstatic QString qservicemanager_resolveLibraryPath(const QString &libNameOrPath)\n{\n if (QFile::exists(libNameOrPath))\n return libNameOrPath;\n\n \/\/ try to find plug-in via QLibrary\n const QStringList paths = QCoreApplication::libraryPaths();\n for (int i=0; i<paths.count(); i++) {\n QLibrary lib(paths[i] + QDir::separator() + libNameOrPath);\n if (lib.load()) {\n lib.unload();\n return lib.fileName();\n }\n }\n return QString();\n}\n\n\nclass QServicePluginCleanup : public QObject\n{\n Q_OBJECT\npublic:\n QServicePluginCleanup(QPluginLoader *loader, QServicePluginInterface *pluginInterface, QObject *parent = 0)\n : QObject(parent),\n m_pluginInterface(pluginInterface),\n m_loader(loader)\n {\n }\n\n ~QServicePluginCleanup()\n {\n delete m_pluginInterface;\n if (m_loader) {\n m_loader->unload();\n delete m_loader;\n }\n }\n\n\n\n QServicePluginInterface *m_pluginInterface;\n QPluginLoader *m_loader;\n};\n\nclass QServiceManagerPrivate\n{\npublic:\n ServiceDatabase *database;\n QServiceManager::Scope scope;\n\n void init(QServiceManager *mgr, QServiceManager::Scope databaseScope)\n {\n database = new ServiceDatabase;\n scope = databaseScope;\n\n QObject::connect(database, SIGNAL(serviceAdded(QString)),\n mgr, SIGNAL(serviceAdded(QString)));\n QObject::connect(database, SIGNAL(serviceRemoved(QString)),\n mgr, SIGNAL(serviceRemoved(QString)));\n\n if (!database->open())\n qWarning(\"QServiceManager: unable to open services database\");\n }\n};\n\n\/*!\n \\class QServiceManager\n \\brief The QServiceManager class enables the loading of service plugins \n and the (de)registration of services.\n\n A service is a stand-alone component that can be used by multiple clients. \n Each service implementation must derive from QObject. Clients request a \n reference to a service via \\l loadInterface() or \\l getInterface().\n\n Services are separate deliveries in the form of plug-ins. New services can be (de)registered \n at any time via \\l addService() and \\l removeService() respectively. Such an event is \n published via the \\l serviceAdded() and \\l serviceRemoved() signal.\n Each service plug-in must implement QServicePluginInterface.\n\n Each plug-in may support multiple interfaces and may even provide multiple implementations \n for the same interface. Individual implementations are identified via \n QServiceInterfaceDescriptor. For a more detailed explanation of services and how they relate to\n interface and their implementations please see QServiceInterfaceDescriptor. \n \n \\sa QServicePluginInterface, QServiceContext, QAbstractSecuritySession\n*\/\n\n\/*!\n \\enum QServiceManager::Scope\n\n \\value UserScope When adding and removing services, use a storage location\n specific to the current user (e.g. in the user's home directory). When\n searching for services and interface implementations, first search in the\n user-specific location; if the service or interface implementation\n is not found, search in the system-wide storage location.\n\n \\value SystemScope When adding and removing services, use a system-wide\n storage location accessible to all users. When searching\n for services and interface implementations, search only in the system-wide\n storage location.\n*\/\n\n\/*!\n \\fn void QServiceManager::serviceAdded(const QString& serviceName)\n\n This signal is emited whenever a new service with the given \n \\a serviceName has been registered with the service manager.\n\n \\sa addService()\n*\/\n\n\/*!\n \\fn void QServiceManager::serviceRemoved(const QString& serviceName)\n\n This signal is emited whenever a service with the given \n \\a serviceName has been deregistered with the service manager.\n\n \\sa removeService()\n*\/\n\n\/*!\n Creates a service manager with the given \\a parent.\n\n The scope will default to QServiceManager::UserScope.\n*\/\nQServiceManager::QServiceManager(QObject *parent)\n : QObject(parent),\n d(new QServiceManagerPrivate)\n{\n d->init(this, UserScope);\n}\n\n\/*!\n Creates a service manager with the given \\a scope and \\a parent.\n*\/\nQServiceManager::QServiceManager(Scope scope, QObject *parent)\n : QObject(parent),\n d(new QServiceManagerPrivate)\n{\n d->init(this, scope);\n}\n\n\/*!\n Destroys the service manager.\n*\/\nQServiceManager::~QServiceManager()\n{\n d->database->close();\n delete d->database;\n delete d;\n}\n\n\/*!\n Returns the scope used for registering and searching of services.\n*\/\nQServiceManager::Scope QServiceManager::scope() const\n{\n return d->scope;\n}\n\n\/*!\n Returns a list of the services that provide the interface specified by\n \\a interfaceName.\n*\/\nQStringList QServiceManager::findServices(const QString& interfaceName) const\n{\n QStringList services;\n QList<ServiceInfo> serviceInfoList;\n if (!d->database->isOpen())\n return services;\n services = d->database->getServiceNames(interfaceName);\n return services;\n}\n\n\/*!\n Returns a list of the interfaces that match the specified \\a filter.\n*\/\nQList<QServiceInterfaceDescriptor> QServiceManager::findInterfaces(const QServiceFilter& filter) const\n{\n if (!d->database->isOpen())\n return QList<QServiceInterfaceDescriptor>();\n bool ok = false;\n QList<QServiceInterfaceDescriptor> descriptors = d->database->getInterfaces(filter, &ok);\n if (!ok)\n return QList<QServiceInterfaceDescriptor>();\n return descriptors;\n}\n\n\/*!\n Returns a list of the interfaces provided by the service named\n \\a serviceName.\n*\/\nQList<QServiceInterfaceDescriptor> QServiceManager::findInterfaces(const QString& serviceName) const\n{\n QServiceFilter filter;\n if (!serviceName.isEmpty())\n filter.setServiceName(serviceName);\n return findInterfaces(filter);\n}\n\n\/*!\n Loads and returns the interface specified by \\a interfaceName, as\n provided by the default service for this interface, using the given\n \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function.\n\n The caller takes ownership of the returned pointer.\n \n This function returns a null pointer if the requested service cannot be found.\n*\/\nQObject* QServiceManager::loadInterface(const QString& interfaceName, QServiceContext* context, QAbstractSecuritySession* session)\n{\n return loadInterface(defaultServiceInterface(interfaceName), context, session);\n}\n\n\/*!\n Loads and returns the interface specified by \\a descriptor using the\n given \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function.\n\n The caller takes ownership of the returned pointer.\n\n This function returns a null pointer if the requested service cannot be found.\n*\/\nQObject* QServiceManager::loadInterface(const QServiceInterfaceDescriptor& descriptor, QServiceContext* context, QAbstractSecuritySession* session)\n{\n if (!descriptor.isValid()) {\n qWarning() << \"QServiceManager::loadInterface() given invalid descriptor\";\n return 0;\n }\n\n const QStringList serviceCaps = descriptor.property(QServiceInterfaceDescriptor::Capabilities).toStringList();\n if ( session && !session->isAllowed(serviceCaps) )\n return 0; \/\/TODO set error state on context object, if it exists\n\n QString serviceFilePath = qservicemanager_resolveLibraryPath(\n descriptor.property(QServiceInterfaceDescriptor::Location).toString());\n if (serviceFilePath.isEmpty()) {\n qWarning() << \"QServiceManager::loadInterface() cannot locate library file for plugin:\"\n << descriptor.property(QServiceInterfaceDescriptor::Location).toString();\n return 0;\n }\n\n QPluginLoader *loader = new QPluginLoader(serviceFilePath);\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n\n if (pluginIFace) {\n QObject *obj = pluginIFace->createInstance(descriptor, context, session);\n if (obj) {\n QServicePluginCleanup *cleanup = new QServicePluginCleanup(loader, pluginIFace);\n QObject::connect(obj, SIGNAL(destroyed()), cleanup, SLOT(deleteLater()));\n return obj;\n }\n delete pluginIFace;\n }\n\n qWarning() << \"QServiceManager::loadInterface() cannot load plugin at\"\n << serviceFilePath << \":\" << loader->errorString();\n loader->unload();\n delete loader;\n\n return 0;\n}\n\n\/*!\n \\fn T* QServiceManager::getInterface(const QString& interfaceName, QServiceContext* context, QAbstractSecuritySession* session)\n\n Loads the service object implementing \\a interfaceName,\n as provided by the default service for this interface, using the given\n \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function. The template class must be derived from QObject.\n\n If \\a interfaceName is not a known interface the returned pointer will be null.\n\n The caller takes ownership of the returned pointer.\n*\/\n\n\n\/*!\n \\fn T* QServiceManager::getInterface(const QServiceInterfaceDescriptor& serviceDescriptor, QServiceContext* context, QAbstractSecuritySession* session)\n\n Loads the service object identified by \\a serviceDescriptor\n using the given \\a context and \\a session. \\a context and \\a session object are owned \n by the caller of this function. The template class must be derived from QObject.\n\n\n If the \\a serviceDescriptor is not valid the returned pointer will be null.\n\n The caller takes ownership of the returned pointer.\n*\/\n\n\/*!\n Registers the service defined by the XML file at \\a xmlFilePath.\n Returns true if the registration succeeded, and false otherwise.\n\n If a previously unkown interface is added the newly registered service automatically\n becomes the new default service provider for the new interface.\n\n A service plugin cannot be added if another service is already registered\n with the same plugin file path. A service plugin also cannot be added if\n the service is already registered and implements any of the same interface\n versions that the new plugin implements.\n\n \\sa setDefaultServiceForInterface()\n*\/\nbool QServiceManager::addService(const QString& xmlFilePath)\n{\n QFile *f = new QFile(xmlFilePath);\n bool b = addService(f);\n delete f;\n return b;\n}\n\n\/*!\n Registers the service defined by the XML data from the given \\a device.\n Returns true if the registration succeeded, and false otherwise. If a\n previously unkown interface is added the newly registered service\n automatically becomes the new default service provider for the new\n interface.\n\n Registering a service also causes QServicePluginInterface::installService()\n to be called on the service. If the service plugin is not accessible\n (e.g. if the plugin file is not found) and \\c installService() cannot\n be invoked on the service, the registration fails and this method returns\n false.\n\n A service plugin cannot be added if another service is already registered\n with the same plugin file path. A service plugin also cannot be added if\n the service is already registered and implements any of the same interface\n versions that the new plugin implements.\n\n \\sa setDefaultServiceForInterface()\n*\/\nbool QServiceManager::addService(QIODevice *device)\n{\n if (!d->database->isOpen())\n return false;\n ServiceMetaData data(device);\n if (!data.extractMetadata())\n return false;\n\n bool result = d->database->registerService(data);\n if (result) {\n QPluginLoader *loader = new QPluginLoader(qservicemanager_resolveLibraryPath(data.location()));\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n if (pluginIFace) {\n pluginIFace->installService();\n } else {\n result = false;\n d->database->unregisterService(data.name());\n }\n loader->unload();\n delete loader;\n }\n return result;\n}\n\n\/*!\n Unregisters the service specified by \\a serviceName.\n\n Returns true if the unregistration succeeded, and false otherwise.\n\n If a default service implementation is removed and there are other implementations\n for the same interface, the service manager chooses the implementation with the\n highest version number as the new default. If there is more than one serivce \n with the same version number, the service manager makes a random choice with \n regards to the new default implementation. If this is \n not the desired behaviour the default selection should be updated\n via setDefaultServiceForInterface(). \n*\/\nbool QServiceManager::removeService(const QString& serviceName)\n{\n if (!d->database->isOpen())\n return false;\n if (serviceName.isEmpty())\n return false;\n\n \/\/ Call QServicePluginInterface::uninstallService() on all plugins that\n \/\/ match this service\n\n QSet<QString> pluginPathsSet;\n QList<QServiceInterfaceDescriptor> descriptors = findInterfaces(serviceName);\n for (int i=0; i<descriptors.count(); i++)\n pluginPathsSet << descriptors[i].property(QServiceInterfaceDescriptor::Location).toString();\n\n QList<QString> pluginPaths = pluginPathsSet.toList();\n for (int i=0; i<pluginPaths.count(); i++) {\n QPluginLoader *loader = new QPluginLoader(qservicemanager_resolveLibraryPath(pluginPaths[i]));\n QServicePluginInterface *pluginIFace = qobject_cast<QServicePluginInterface *>(loader->instance());\n if (pluginIFace)\n pluginIFace->uninstallService();\n else\n qWarning() << \"QServiceManager: unable to invoke uninstallService() on removed service\";\n loader->unload();\n delete loader;\n }\n\n return d->database->unregisterService(serviceName);\n}\n\n\/*!\n Sets the default interface implementation for \\a interfaceName to the\n matching interface implementation provided by \\a service.\n\n If \\a service provides more than one interface implementation for\n \\a interfaceName, the newest version of the interface is set as the\n default.\n\n Returns true if the operation succeeded, and false otherwise.\n*\/\nbool QServiceManager::setDefaultServiceForInterface(const QString &service, const QString &interfaceName)\n{\n if (!d->database->isOpen())\n return false;\n if (interfaceName.isEmpty() || service.isEmpty())\n return false;\n return d->database->setDefaultService(service, interfaceName);\n}\n\n\/*!\n \\overload\n\n Sets the interface implementation specified by \\a descriptor to be the\n default implementation for the particular interface specified in the\n descriptor.\n\n Returns true if the operation succeeded, and false otherwise.\n*\/\nbool QServiceManager::setDefaultServiceForInterface(const QServiceInterfaceDescriptor& descriptor)\n{\n if (!d->database->isOpen())\n return false;\n if (!descriptor.isValid())\n return false;\n return d->database->setDefaultService(descriptor);\n}\n\n\/*!\n Returns the default interface for the given \\a interfaceName.\n*\/\nQServiceInterfaceDescriptor QServiceManager::defaultServiceInterface(const QString& interfaceName) const\n{\n if (!d->database->isOpen())\n return QServiceInterfaceDescriptor();\n bool ok = false;\n QServiceInterfaceDescriptor info;\n info = d->database->defaultServiceInterface(interfaceName, &ok);\n if (!ok)\n return QServiceInterfaceDescriptor();\n\n return info;\n}\n\nQT_END_NAMESPACE\n\n#include \"qservicemanager.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2009, 2010 Austin Robot Technology, Jack O'Quin\n * License: Modified BSD Software License Agreement\n *\n * $Id$\n *\/\n\n\/** \\file\n\n This ROS nodelet transforms raw Velodyne HDL-64E 3D LIDAR data to a\n PointCloud in some frame of reference, typically \"\/odom\".\n*\/\n\n#include <ros\/ros.h>\n#include <geometry_msgs\/Point32.h>\n#include <nodelet\/nodelet.h>\n#include <pluginlib\/class_list_macros.h>\n#include <sensor_msgs\/PointCloud.h>\n#include <tf\/transform_listener.h>\n\n#include <velodyne\/ring_sequence.h>\n#include <velodyne\/data_xyz.h>\nusing namespace Velodyne; \/\/ use new data class interface\n\n\/\/ channels to publish\nnamespace\n{\n static const unsigned NCHANNELS = 3;\n static const std::string channel_name[NCHANNELS] =\n {\n \"intensity\",\n \"ring\",\n \"heading\"\n };\n}\n\nclass TransformNodelet: public nodelet::Nodelet\n{\npublic:\n TransformNodelet()\n {\n data_ = new DataXYZ();\n }\n ~TransformNodelet()\n {\n delete data_;\n }\n\nprivate:\n virtual void onInit();\n void processXYZ(const std::vector<laserscan_xyz_t> &scan,\n ros::Time stamp,\n const std::string &frame_id);\n void allocPacketMsg(sensor_msgs::PointCloud &msg);\n void allocSharedMsg();\n\n \/** in-line test whether a point is in range *\/\n bool pointInRange(geometry_msgs::Point32 &point)\n {\n float sum2 = (point.x * point.x \n + point.y * point.y\n + point.z * point.z);\n return (sum2 >= min_range2_ && sum2 <= max_range2_);\n }\n\n \/\/ store squares of minimum and maximum ranges for efficient comparison\n float max_range2_;\n float min_range2_;\n\n DataXYZ *data_;\n ros::Subscriber velodyne_scan_;\n ros::Publisher output_;\n tf::TransformListener listener_;\n\n \/\/\/ configuration parameters\n typedef struct {\n std::string frame_id; \/\/\/< target tf frame ID\n double max_range; \/\/\/< maximum range to publish\n double min_range; \/\/\/< minimum range to publish\n int npackets; \/\/\/< number of packets to combine\n } Config;\n Config config_;\n\n \/\/ point clouds data\n \/\/ (class members to avoid allocation and deallocation overhead)\n sensor_msgs::PointCloud inMsg_; \/\/\/< input packet message\n sensor_msgs::PointCloud tfMsg_; \/\/\/< transformed packet message\n sensor_msgs::PointCloudPtr outPtr_; \/\/\/< output message shared pointer\n int packetCount_; \/\/\/< count of output packets collected\n};\n\n\/** nodelet initialization *\/\nvoid TransformNodelet::onInit()\n{\n \/\/ use private node handle to get parameters\n ros::NodeHandle private_nh = getPrivateNodeHandle();\n private_nh.param(\"frame_id\", config_.frame_id, std::string(\"odom\"));\n std::string tf_prefix = tf::getPrefixParam(private_nh);\n config_.frame_id = tf::resolve(tf_prefix, config_.frame_id);\n NODELET_INFO_STREAM(\"target frame ID: \" << config_.frame_id);\n\n private_nh.param(\"max_range\", config_.max_range,\n (double) Velodyne::DISTANCE_MAX);\n private_nh.param(\"min_range\", config_.min_range, 2.0);\n NODELET_INFO_STREAM(\"data ranges to publish: [\"\n << config_.min_range << \", \"\n << config_.max_range << \"]\");\n min_range2_ = config_.min_range * config_.min_range;\n max_range2_ = config_.max_range * config_.max_range;\n\n private_nh.param(\"npackets\", config_.npackets, PACKETS_PER_REV);\n NODELET_INFO_STREAM(\"number of packets to accumulate: \" << config_.npackets);\n\n data_->getParams();\n\n if (0 != data_->setup())\n return;\n\n \/\/ allocate space for the first PointCloud message\n allocSharedMsg();\n packetCount_ = 0;\n\n \/\/ allocate exact sizes for inMsg_ and tfMsg_ (single packet)\n allocPacketMsg(inMsg_);\n allocPacketMsg(tfMsg_);\n\n \/\/ advertise output point cloud (before subscribing to input data)\n ros::NodeHandle node = getNodeHandle();\n output_ = node.advertise<sensor_msgs::PointCloud>(\"velodyne\/pointcloud\", 10);\n\n \/\/ subscribe to Velodyne data\n velodyne_scan_ =\n data_->subscribe(node, \"velodyne\/packets\", 10,\n boost::bind(&TransformNodelet::processXYZ,\n this, _1, _2, _3),\n ros::TransportHints().tcpNoDelay(true));\n}\n\n\/** \\brief allocate space in a single packet PointCloud message\n *\n * \\param msg message with enough space for one packet\n *\/\nvoid TransformNodelet::allocPacketMsg(sensor_msgs::PointCloud &msg)\n{\n msg.points.reserve(SCANS_PER_PACKET);\n msg.channels.resize(NCHANNELS);\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n msg.channels[ch].name = channel_name[ch];\n msg.channels[ch].values.reserve(SCANS_PER_PACKET);\n }\n}\n\n\/** \\brief allocate space for shared PointCloud message\n *\n * \\post outPtr_ -> message with enough space reserved for the\n * configured number of packets\n *\/\nvoid TransformNodelet::allocSharedMsg()\n{\n \/\/ allocate a new shared pointer for zero-copy sharing with other nodelets\n outPtr_ = sensor_msgs::PointCloudPtr(new sensor_msgs::PointCloud);\n\n \/\/ allocate the anticipated amount of space for the point cloud\n outPtr_->points.reserve(config_.npackets*SCANS_PER_PACKET);\n outPtr_->channels.resize(NCHANNELS);\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n outPtr_->channels[ch].name = channel_name[ch];\n outPtr_->channels[ch].values.reserve(config_.npackets*SCANS_PER_PACKET);\n }\n}\n\n\/** \\brief callback for packets in XYZ format\n *\n * converts Velodyne data for a single packet into a point cloud\n * transforms the packet point cloud into the target frame\n * collects transformed packets into a larger message (generally a full revolution)\n * periodically publishes those collected transformed data as a point cloud\n *\/\nvoid TransformNodelet::processXYZ(const std::vector<laserscan_xyz_t> &scan,\n ros::Time stamp,\n const std::string &frame_id)\n{\n if (output_.getNumSubscribers() == 0) \/\/ no one listening?\n return; \/\/ avoid much work\n\n \/\/ Clear working copies for transforming this packet. These are\n \/\/ only class members to avoid reallocating them for every packet.\n inMsg_.points.clear();\n tfMsg_.points.clear();\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n inMsg_.channels[ch].values.clear();\n tfMsg_.channels[ch].values.clear();\n }\n\n \/\/ convert Velodyne data for this packet into a point cloud\n inMsg_.header.stamp = stamp;\n inMsg_.header.frame_id = frame_id;\n for (unsigned i = 0; i < scan.size(); ++i)\n {\n geometry_msgs::Point32 p;\n p.x = scan[i].x;\n p.y = scan[i].y;\n p.z = scan[i].z;\n if (pointInRange(p))\n {\n inMsg_.points.push_back(p);\n inMsg_.channels[0].values.push_back((float) scan[i].intensity);\n inMsg_.channels[1].values.push_back((float) velodyne::LASER_RING[scan[i].laser_number]);\n inMsg_.channels[2].values.push_back((float) scan[i].heading);\n }\n }\n\n \/\/ transform the packet point cloud into the target frame\n try\n {\n NODELET_DEBUG_STREAM(\"transforming from\" << inMsg_.header.frame_id\n << \" to \" << config_.frame_id);\n listener_.transformPointCloud(config_.frame_id, stamp,\n inMsg_, frame_id, tfMsg_);\n }\n catch (tf::TransformException ex)\n {\n \/\/ only log tf error once every 20 times\n ROS_ERROR_THROTTLE(20, \"%s\", ex.what());\n return; \/\/ skip this packet\n }\n\n \/\/ append transformed packet data to end of output message\n outPtr_->points.insert(outPtr_->points.end(),\n tfMsg_.points.begin(),\n tfMsg_.points.end());\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n outPtr_->channels[ch].values.insert(outPtr_->channels[ch].values.end(),\n tfMsg_.channels[ch].values.begin(),\n tfMsg_.channels[ch].values.end());\n }\n\n if (++packetCount_ >= config_.npackets)\n {\n \/\/ buffer is full, publish it\n NODELET_DEBUG_STREAM(\"Publishing \" << outPtr_->points.size()\n << \" Velodyne points.\");\n\n \/\/ publish the accumulated, transformed point cloud\n outPtr_->header.stamp = stamp; \/\/ time of last packet\n outPtr_->header.frame_id = config_.frame_id; \/\/ target frame ID\n output_.publish(outPtr_);\n\n \/\/ nodelet sharing requires outPtr_ not to be modified after\n \/\/ publish(), so allocate a new message\n allocSharedMsg();\n packetCount_ = 0;\n }\n}\n\n\/\/ Register this plugin with pluginlib. Names must match nodelet_velodyne.xml.\n\/\/\n\/\/ parameters: package, class name, class type, base class type\nPLUGINLIB_DECLARE_CLASS(velodyne_common, TransformNodelet,\n TransformNodelet, nodelet::Nodelet);\n<commit_msg>change tf error to a warning<commit_after>\/*\n * Copyright (C) 2009, 2010 Austin Robot Technology, Jack O'Quin\n * License: Modified BSD Software License Agreement\n *\n * $Id$\n *\/\n\n\/** \\file\n\n This ROS nodelet transforms raw Velodyne HDL-64E 3D LIDAR data to a\n PointCloud in some frame of reference, typically \"\/odom\".\n*\/\n\n#include <ros\/ros.h>\n#include <geometry_msgs\/Point32.h>\n#include <nodelet\/nodelet.h>\n#include <pluginlib\/class_list_macros.h>\n#include <sensor_msgs\/PointCloud.h>\n#include <tf\/transform_listener.h>\n\n#include <velodyne\/ring_sequence.h>\n#include <velodyne\/data_xyz.h>\nusing namespace Velodyne; \/\/ use new data class interface\n\n\/\/ channels to publish\nnamespace\n{\n static const unsigned NCHANNELS = 3;\n static const std::string channel_name[NCHANNELS] =\n {\n \"intensity\",\n \"ring\",\n \"heading\"\n };\n}\n\nclass TransformNodelet: public nodelet::Nodelet\n{\npublic:\n TransformNodelet()\n {\n data_ = new DataXYZ();\n }\n ~TransformNodelet()\n {\n delete data_;\n }\n\nprivate:\n virtual void onInit();\n void processXYZ(const std::vector<laserscan_xyz_t> &scan,\n ros::Time stamp,\n const std::string &frame_id);\n void allocPacketMsg(sensor_msgs::PointCloud &msg);\n void allocSharedMsg();\n\n \/** in-line test whether a point is in range *\/\n bool pointInRange(geometry_msgs::Point32 &point)\n {\n float sum2 = (point.x * point.x \n + point.y * point.y\n + point.z * point.z);\n return (sum2 >= min_range2_ && sum2 <= max_range2_);\n }\n\n \/\/ store squares of minimum and maximum ranges for efficient comparison\n float max_range2_;\n float min_range2_;\n\n DataXYZ *data_;\n ros::Subscriber velodyne_scan_;\n ros::Publisher output_;\n tf::TransformListener listener_;\n\n \/\/\/ configuration parameters\n typedef struct {\n std::string frame_id; \/\/\/< target tf frame ID\n double max_range; \/\/\/< maximum range to publish\n double min_range; \/\/\/< minimum range to publish\n int npackets; \/\/\/< number of packets to combine\n } Config;\n Config config_;\n\n \/\/ point clouds data\n \/\/ (class members to avoid allocation and deallocation overhead)\n sensor_msgs::PointCloud inMsg_; \/\/\/< input packet message\n sensor_msgs::PointCloud tfMsg_; \/\/\/< transformed packet message\n sensor_msgs::PointCloudPtr outPtr_; \/\/\/< output message shared pointer\n int packetCount_; \/\/\/< count of output packets collected\n};\n\n\/** nodelet initialization *\/\nvoid TransformNodelet::onInit()\n{\n \/\/ use private node handle to get parameters\n ros::NodeHandle private_nh = getPrivateNodeHandle();\n private_nh.param(\"frame_id\", config_.frame_id, std::string(\"odom\"));\n std::string tf_prefix = tf::getPrefixParam(private_nh);\n config_.frame_id = tf::resolve(tf_prefix, config_.frame_id);\n NODELET_INFO_STREAM(\"target frame ID: \" << config_.frame_id);\n\n private_nh.param(\"max_range\", config_.max_range,\n (double) Velodyne::DISTANCE_MAX);\n private_nh.param(\"min_range\", config_.min_range, 2.0);\n NODELET_INFO_STREAM(\"data ranges to publish: [\"\n << config_.min_range << \", \"\n << config_.max_range << \"]\");\n min_range2_ = config_.min_range * config_.min_range;\n max_range2_ = config_.max_range * config_.max_range;\n\n private_nh.param(\"npackets\", config_.npackets, PACKETS_PER_REV);\n NODELET_INFO_STREAM(\"number of packets to accumulate: \" << config_.npackets);\n\n data_->getParams();\n\n if (0 != data_->setup())\n return;\n\n \/\/ allocate space for the first PointCloud message\n allocSharedMsg();\n packetCount_ = 0;\n\n \/\/ allocate exact sizes for inMsg_ and tfMsg_ (single packet)\n allocPacketMsg(inMsg_);\n allocPacketMsg(tfMsg_);\n\n \/\/ advertise output point cloud (before subscribing to input data)\n ros::NodeHandle node = getNodeHandle();\n output_ = node.advertise<sensor_msgs::PointCloud>(\"velodyne\/pointcloud\", 10);\n\n \/\/ subscribe to Velodyne data\n velodyne_scan_ =\n data_->subscribe(node, \"velodyne\/packets\", 10,\n boost::bind(&TransformNodelet::processXYZ,\n this, _1, _2, _3),\n ros::TransportHints().tcpNoDelay(true));\n}\n\n\/** \\brief allocate space in a single packet PointCloud message\n *\n * \\param msg message with enough space for one packet\n *\/\nvoid TransformNodelet::allocPacketMsg(sensor_msgs::PointCloud &msg)\n{\n msg.points.reserve(SCANS_PER_PACKET);\n msg.channels.resize(NCHANNELS);\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n msg.channels[ch].name = channel_name[ch];\n msg.channels[ch].values.reserve(SCANS_PER_PACKET);\n }\n}\n\n\/** \\brief allocate space for shared PointCloud message\n *\n * \\post outPtr_ -> message with enough space reserved for the\n * configured number of packets\n *\/\nvoid TransformNodelet::allocSharedMsg()\n{\n \/\/ allocate a new shared pointer for zero-copy sharing with other nodelets\n outPtr_ = sensor_msgs::PointCloudPtr(new sensor_msgs::PointCloud);\n\n \/\/ allocate the anticipated amount of space for the point cloud\n outPtr_->points.reserve(config_.npackets*SCANS_PER_PACKET);\n outPtr_->channels.resize(NCHANNELS);\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n outPtr_->channels[ch].name = channel_name[ch];\n outPtr_->channels[ch].values.reserve(config_.npackets*SCANS_PER_PACKET);\n }\n}\n\n\/** \\brief callback for packets in XYZ format\n *\n * converts Velodyne data for a single packet into a point cloud\n * transforms the packet point cloud into the target frame\n * collects transformed packets into a larger message (generally a full revolution)\n * periodically publishes those collected transformed data as a point cloud\n *\/\nvoid TransformNodelet::processXYZ(const std::vector<laserscan_xyz_t> &scan,\n ros::Time stamp,\n const std::string &frame_id)\n{\n if (output_.getNumSubscribers() == 0) \/\/ no one listening?\n return; \/\/ avoid much work\n\n \/\/ Clear working copies for transforming this packet. These are\n \/\/ only class members to avoid reallocating them for every packet.\n inMsg_.points.clear();\n tfMsg_.points.clear();\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n inMsg_.channels[ch].values.clear();\n tfMsg_.channels[ch].values.clear();\n }\n\n \/\/ convert Velodyne data for this packet into a point cloud\n inMsg_.header.stamp = stamp;\n inMsg_.header.frame_id = frame_id;\n for (unsigned i = 0; i < scan.size(); ++i)\n {\n geometry_msgs::Point32 p;\n p.x = scan[i].x;\n p.y = scan[i].y;\n p.z = scan[i].z;\n if (pointInRange(p))\n {\n inMsg_.points.push_back(p);\n inMsg_.channels[0].values.push_back((float) scan[i].intensity);\n inMsg_.channels[1].values.push_back((float) velodyne::LASER_RING[scan[i].laser_number]);\n inMsg_.channels[2].values.push_back((float) scan[i].heading);\n }\n }\n\n \/\/ transform the packet point cloud into the target frame\n try\n {\n NODELET_DEBUG_STREAM(\"transforming from\" << inMsg_.header.frame_id\n << \" to \" << config_.frame_id);\n listener_.transformPointCloud(config_.frame_id, stamp,\n inMsg_, frame_id, tfMsg_);\n }\n catch (tf::TransformException ex)\n {\n \/\/ only log tf error once every 20 times\n ROS_WARN_THROTTLE(20, \"%s\", ex.what());\n return; \/\/ skip this packet\n }\n\n \/\/ append transformed packet data to end of output message\n outPtr_->points.insert(outPtr_->points.end(),\n tfMsg_.points.begin(),\n tfMsg_.points.end());\n for (unsigned ch = 0; ch < NCHANNELS; ++ch)\n {\n outPtr_->channels[ch].values.insert(outPtr_->channels[ch].values.end(),\n tfMsg_.channels[ch].values.begin(),\n tfMsg_.channels[ch].values.end());\n }\n\n if (++packetCount_ >= config_.npackets)\n {\n \/\/ buffer is full, publish it\n NODELET_DEBUG_STREAM(\"Publishing \" << outPtr_->points.size()\n << \" Velodyne points.\");\n\n \/\/ publish the accumulated, transformed point cloud\n outPtr_->header.stamp = stamp; \/\/ time of last packet\n outPtr_->header.frame_id = config_.frame_id; \/\/ target frame ID\n output_.publish(outPtr_);\n\n \/\/ nodelet sharing requires outPtr_ not to be modified after\n \/\/ publish(), so allocate a new message\n allocSharedMsg();\n packetCount_ = 0;\n }\n}\n\n\/\/ Register this plugin with pluginlib. Names must match nodelet_velodyne.xml.\n\/\/\n\/\/ parameters: package, class name, class type, base class type\nPLUGINLIB_DECLARE_CLASS(velodyne_common, TransformNodelet,\n TransformNodelet, nodelet::Nodelet);\n<|endoftext|>"} {"text":"<commit_before>#include \"dx509.h\"\nPersistent<FunctionTemplate> DX509::constructor;\n\nvoid DX509::Initialize(Handle<Object> target) {\n HandleScope scope;\n\n constructor = Persistent<FunctionTemplate>::New(FunctionTemplate::New(DX509::New));\n constructor->InstanceTemplate()->SetInternalFieldCount(1);\n constructor->SetClassName(String::NewSymbol(\"X509\"));\n\n NODE_SET_PROTOTYPE_METHOD(constructor, \"parse\", parseCert);\n Local<ObjectTemplate> proto = constructor->PrototypeTemplate();\n\n target->Set(String::NewSymbol(\"X509\"), constructor->GetFunction());\n}\n\nHandle<Value> DX509::New(const Arguments &args) {\n HandleScope scope;\n DX509 *x = new DX509();\n x->Wrap(args.This());\n return args.This();\n}\n\nHandle<Value> DX509::parseCert(const Arguments &args) {\n HandleScope scope;\n DX509 *dx509 = ObjectWrap::Unwrap<DX509>(args.This());\n\n ASSERT_IS_STRING_OR_BUFFER(args[0]);\n\n ssize_t cert_len = DecodeBytes(args[0], BINARY);\n char* cert_buf = new char[cert_len];\n ssize_t written = DecodeWrite(cert_buf, cert_len, args[0], BINARY);\n assert(cert_len = written);\n X509 *x = dx509->load_cert(cert_buf, cert_len, 1);\n EVP_PKEY *pkey;\n pkey = X509_get_pubkey(x);\n\n \/\/node symbols\n Persistent<String> serial_symbol = NODE_PSYMBOL(\"serial\");\n Persistent<String> subject_symbol = NODE_PSYMBOL(\"subject\");\n Persistent<String> issuer_symbol = NODE_PSYMBOL(\"issuer\");\n Persistent<String> valid_from_symbol = NODE_PSYMBOL(\"valid_from\");\n Persistent<String> valid_to_symbol = NODE_PSYMBOL(\"valid_to\");\n Persistent<String> fingerprint_symbol = NODE_PSYMBOL(\"fingerprint\");\n Persistent<String> name_symbol = NODE_PSYMBOL(\"name\");\n Persistent<String> version_symbol = NODE_PSYMBOL(\"version\");\n Persistent<String> ext_key_usage_symbol = NODE_PSYMBOL(\"ext_key_usage\");\n Persistent<String> signature_algo_symbol = NODE_PSYMBOL(\"signature_algorithm\");\n Persistent<String> signature_symbol = NODE_PSYMBOL(\"signature\");\n Persistent<String> pubkey_symbol = NODE_PSYMBOL(\"public_key\");\n Persistent<String> pubkey_pem_symbol = NODE_PSYMBOL(\"public_key_pem\");\n Persistent<String> public_key_algo = NODE_PSYMBOL(\"public_key_algo\");\n Local<Object> info = Object::New();\n\n \/\/subject name\n char *details = X509_NAME_oneline(X509_get_subject_name(x), 0, 0);\n info->Set(subject_symbol, String::New(details));\n\n \/\/issuer name\n details = X509_NAME_oneline(X509_get_issuer_name(x), 0, 0);\n info->Set(issuer_symbol, String::New(details));\n OPENSSL_free(details);\n\n char buf [256];\n BIO* bio = BIO_new(BIO_s_mem());\n memset(buf, 0, sizeof(buf));\n X509_CINF *ci = x->cert_info;\n\n \/\/Version\n long l;\n l = X509_get_version(x)+1;\n info->Set(version_symbol, Integer::New(l));\n\n \/\/Serial\n ASN1_INTEGER *bs = X509_get_serialNumber(x);\n for (int i = 0; i< bs->length; i++) {\n BIO_printf(bio, \"%02x%s\", bs->data[i], ((i+1 == bs->length)? \"\": \":\"));\n }\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(serial_symbol, String::New(buf));\n\n \/\/valid from\n ASN1_TIME_print(bio, X509_get_notBefore(x));\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(valid_from_symbol, String::New(buf));\n\n \/\/Not before\n ASN1_TIME_print(bio, X509_get_notAfter(x));\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(valid_to_symbol, String::New(buf));\n\n \/\/Public Key info\n int wrote = i2a_ASN1_OBJECT(bio, ci->key->algor->algorithm);\n BIO_read(bio, buf, sizeof(buf)-1);\n buf[wrote] = '\\0';\n info->Set(public_key_algo, String::New(buf));\n\n \/\/Public Key Info cont.\n \/\/Setup a key info subobject\n Local<String> pub_str;\n BIO *key_info_bio = BIO_new(BIO_s_mem());\n if (pkey->type == EVP_PKEY_DSA) {\n DSA *dsa = EVP_PKEY_get1_DSA(pkey);\n\n DSA_free(dsa);\n } else if (pkey->type == EVP_PKEY_RSA) {\n RSA *rsa = EVP_PKEY_get1_RSA(pkey);\n int mod_len = BN_num_bits(rsa->n);\n\n size_t buf_len = 0; \n dx509->update_buf_len(rsa->n, &buf_len);\n dx509->update_buf_len(rsa->e, &buf_len);\n\n unsigned char *m = (unsigned char *) OPENSSL_malloc(buf_len+10);\n int n;\n m[0]=0;\n n=BN_bn2bin(rsa->n,&m[1]);\n for (int i=0; i<n; i++) {\n BIO_printf(key_info_bio, \"%02x%s\", m[i],((i+1) == n) ? \"\":\":\");\n }\n char key_info_buf[buf_len*4];\n BIO_read(key_info_bio, key_info_buf, sizeof(key_info_buf)-1);\n pub_str = String::New((key_info_buf));\n OPENSSL_free(m);\n\n RSA_free(rsa);\n } else if (pkey->type == EVP_PKEY_EC) {\n EC_KEY *ec_key = EVP_PKEY_get1_EC_KEY(pkey);\n\n EC_KEY_free(ec_key);\n } else {\n pub_str = String::New(\"\");\n }\n if (key_info_bio != NULL) BIO_free(key_info_bio);\n\n info->Set(pubkey_symbol, pub_str);\n\n \/\/Signature Algorithm\n wrote = i2a_ASN1_OBJECT(bio, ci->signature->algorithm);\n BIO_read(bio, buf, sizeof(buf)-1);\n buf[wrote] = '\\0';\n info->Set(signature_algo_symbol, String::New(buf));\n \n \/\/Signature\n BIO *sig_bio = BIO_new(BIO_s_mem());\n ASN1_STRING *sigh = x->signature; \n unsigned char *s;\n unsigned int n1 = sigh->length;\n s = sigh->data;\n for (int i=0; i<n1; i++) {\n BIO_printf(sig_bio, \"%02x%s\", s[i], ((i+1) == n1) ? \"\":\":\");\n }\n char sig_buf [n1*3];\n BIO_read(sig_bio, sig_buf, sizeof(sig_buf)-1);\n info->Set(signature_symbol, String::New(sig_buf));\n\n \/\/finger print\n int j;\n unsigned int n;\n unsigned char md[EVP_MAX_MD_SIZE];\n const EVP_MD *fdig = EVP_sha1();\n if (X509_digest(x, fdig, md, &n)) {\n const char hex[] = \"0123456789ABCDEF\";\n char fingerprint[EVP_MAX_MD_SIZE*3];\n for (j=0; j<n; j++) {\n fingerprint[3*j] = hex[(md[j] & 0xf0) >> 4];\n fingerprint[(3*j)+1] = hex[(md[j] & 0x0f)];\n fingerprint[(3*j)+2] = ':';\n }\n\n if (n > 0) {\n fingerprint[(3*(n-1))+2] = '\\0';\n } else {\n fingerprint[0] = '\\0';\n }\n info->Set(fingerprint_symbol, String::New(fingerprint));\n } else {\n fprintf(stderr, \"Digest bad\\n\");\n }\n \n \/\/Extensions\n STACK_OF(ASN1_OBJECT) *eku = (STACK_OF(ASN1_OBJECT) *)X509_get_ext_d2i(\n x, NID_ext_key_usage, NULL, NULL);\n if (eku != NULL) {\n Local<Array> ext_key_usage = Array::New();\n\n for (int i = 0; i < sk_ASN1_OBJECT_num(eku); i++) {\n memset(buf, 0, sizeof(buf));\n OBJ_obj2txt(buf, sizeof(buf) - 1, sk_ASN1_OBJECT_value(eku, i), 1);\n ext_key_usage->Set(Integer::New(i), String::New(buf));\n }\n sk_ASN1_OBJECT_pop_free(eku, ASN1_OBJECT_free);\n info->Set(ext_key_usage_symbol, ext_key_usage);\n }\n\n \/\/Pub key in pem format\n BIO *key_bio = BIO_new(BIO_s_mem());\n int ok = PEM_write_bio_PUBKEY(key_bio, pkey);\n if (ok) {\n BUF_MEM *bptr;\n BIO_get_mem_ptr(key_bio, &bptr);\n char *pub_buf = (char *)malloc(bptr->length +1);\n memcpy(pub_buf, bptr->data, bptr->length-1);\n pub_buf[bptr->length-1] = 0;\n info->Set(pubkey_pem_symbol, String::New(pub_buf));\n delete [] pub_buf;\n BIO_free(key_bio);\n }\n\n\n \/\/ delete [] buf;\n X509_free(x);\n EVP_PKEY_free(pkey);\n delete [] cert_buf;\n if (bio != NULL) BIO_free(bio);\n return scope.Close(info);\n}\n\nX509* DX509::load_cert(char *cert, int cert_len, int format) {\n BIO *bp = BIO_new_mem_buf(cert, cert_len);\n X509 *x = NULL;\n if (format == 0) {\n x = d2i_X509_bio(bp, NULL);\n } else if (format == 1) {\n x = PEM_read_bio_X509_AUX(bp, NULL, NULL, NULL);\n }\n\n if (x == NULL) {\n \/\/ ERR_print_errors(stderr);\n }\n if (bp != NULL) {\n BIO_free(bp);\n }\n return x;\n}\n\nDX509::DX509() : ObjectWrap() {\n}\n\nDX509::~DX509() {\n}\n\nint DX509::update_buf_len(const BIGNUM *b, size_t *pbuflen) {\n\tsize_t i;\n\tif (!b)\n\t\treturn 0;\n\tif (*pbuflen < (i = (size_t)BN_num_bytes(b)))\n\t\t\t*pbuflen = i;\n}\n<commit_msg>public key RSA modulus looks ok<commit_after>#include \"dx509.h\"\nPersistent<FunctionTemplate> DX509::constructor;\n\nvoid DX509::Initialize(Handle<Object> target) {\n HandleScope scope;\n\n constructor = Persistent<FunctionTemplate>::New(FunctionTemplate::New(DX509::New));\n constructor->InstanceTemplate()->SetInternalFieldCount(1);\n constructor->SetClassName(String::NewSymbol(\"X509\"));\n\n NODE_SET_PROTOTYPE_METHOD(constructor, \"parse\", parseCert);\n Local<ObjectTemplate> proto = constructor->PrototypeTemplate();\n\n target->Set(String::NewSymbol(\"X509\"), constructor->GetFunction());\n}\n\nHandle<Value> DX509::New(const Arguments &args) {\n HandleScope scope;\n DX509 *x = new DX509();\n x->Wrap(args.This());\n return args.This();\n}\n\nHandle<Value> DX509::parseCert(const Arguments &args) {\n HandleScope scope;\n DX509 *dx509 = ObjectWrap::Unwrap<DX509>(args.This());\n\n ASSERT_IS_STRING_OR_BUFFER(args[0]);\n\n ssize_t cert_len = DecodeBytes(args[0], BINARY);\n char* cert_buf = new char[cert_len];\n ssize_t written = DecodeWrite(cert_buf, cert_len, args[0], BINARY);\n assert(cert_len = written);\n X509 *x = dx509->load_cert(cert_buf, cert_len, 1);\n EVP_PKEY *pkey;\n pkey = X509_get_pubkey(x);\n\n \/\/node symbols\n Persistent<String> serial_symbol = NODE_PSYMBOL(\"serial\");\n Persistent<String> subject_symbol = NODE_PSYMBOL(\"subject\");\n Persistent<String> issuer_symbol = NODE_PSYMBOL(\"issuer\");\n Persistent<String> valid_from_symbol = NODE_PSYMBOL(\"valid_from\");\n Persistent<String> valid_to_symbol = NODE_PSYMBOL(\"valid_to\");\n Persistent<String> fingerprint_symbol = NODE_PSYMBOL(\"fingerprint\");\n Persistent<String> name_symbol = NODE_PSYMBOL(\"name\");\n Persistent<String> version_symbol = NODE_PSYMBOL(\"version\");\n Persistent<String> ext_key_usage_symbol = NODE_PSYMBOL(\"ext_key_usage\");\n Persistent<String> signature_algo_symbol = NODE_PSYMBOL(\"signature_algorithm\");\n Persistent<String> signature_symbol = NODE_PSYMBOL(\"signature\");\n Persistent<String> pubkey_symbol = NODE_PSYMBOL(\"public_key\");\n Persistent<String> pubkey_pem_symbol = NODE_PSYMBOL(\"public_key_pem\");\n Persistent<String> public_key_algo = NODE_PSYMBOL(\"public_key_algo\");\n Local<Object> info = Object::New();\n\n \/\/subject name\n char *details = X509_NAME_oneline(X509_get_subject_name(x), 0, 0);\n info->Set(subject_symbol, String::New(details));\n\n \/\/issuer name\n details = X509_NAME_oneline(X509_get_issuer_name(x), 0, 0);\n info->Set(issuer_symbol, String::New(details));\n OPENSSL_free(details);\n\n char buf [256];\n BIO* bio = BIO_new(BIO_s_mem());\n memset(buf, 0, sizeof(buf));\n X509_CINF *ci = x->cert_info;\n\n \/\/Version\n long l;\n l = X509_get_version(x)+1;\n info->Set(version_symbol, Integer::New(l));\n\n \/\/Serial\n ASN1_INTEGER *bs = X509_get_serialNumber(x);\n for (int i = 0; i< bs->length; i++) {\n BIO_printf(bio, \"%02x%s\", bs->data[i], ((i+1 == bs->length)? \"\": \":\"));\n }\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(serial_symbol, String::New(buf));\n\n \/\/valid from\n ASN1_TIME_print(bio, X509_get_notBefore(x));\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(valid_from_symbol, String::New(buf));\n\n \/\/Not before\n ASN1_TIME_print(bio, X509_get_notAfter(x));\n BIO_read(bio, buf, sizeof(buf)-1);\n info->Set(valid_to_symbol, String::New(buf));\n\n \/\/Public Key info\n int wrote = i2a_ASN1_OBJECT(bio, ci->key->algor->algorithm);\n BIO_read(bio, buf, sizeof(buf)-1);\n buf[wrote] = '\\0';\n info->Set(public_key_algo, String::New(buf));\n\n \/\/Public Key Info cont.\n \/\/Setup a key info subobject\n Local<String> pub_str;\n BIO *key_info_bio = BIO_new(BIO_s_mem());\n if (pkey->type == EVP_PKEY_DSA) {\n DSA *dsa = EVP_PKEY_get1_DSA(pkey);\n\n DSA_free(dsa);\n } else if (pkey->type == EVP_PKEY_RSA) {\n RSA *rsa = EVP_PKEY_get1_RSA(pkey);\n int mod_len = BN_num_bits(rsa->n);\n\n size_t buf_len = 0; \n dx509->update_buf_len(rsa->n, &buf_len);\n \/\/ dx509->update_buf_len(rsa->e, &buf_len);\n\n unsigned char *m = (unsigned char *) OPENSSL_malloc(buf_len+10);\n int n;\n n=BN_bn2bin(rsa->n,&m[0]);\n \/\/00: out the front\n BIO_printf(key_info_bio, \"%02x:\", 0);\n for (int i=0; i<n; i++) {\n BIO_printf(key_info_bio, \"%02x%s\", m[i],((i+1) == n) ? \"\":\":\");\n }\n char key_info_buf[buf_len*4];\n BIO_read(key_info_bio, key_info_buf, sizeof(key_info_buf)-1);\n pub_str = String::New(key_info_buf);\n OPENSSL_free(m);\n\n RSA_free(rsa);\n } else if (pkey->type == EVP_PKEY_EC) {\n EC_KEY *ec_key = EVP_PKEY_get1_EC_KEY(pkey);\n\n EC_KEY_free(ec_key);\n } else {\n pub_str = String::New(\"\");\n }\n if (key_info_bio != NULL) BIO_free(key_info_bio);\n\n info->Set(pubkey_symbol, pub_str);\n\n \/\/Signature Algorithm\n wrote = i2a_ASN1_OBJECT(bio, ci->signature->algorithm);\n BIO_read(bio, buf, sizeof(buf)-1);\n buf[wrote] = '\\0';\n info->Set(signature_algo_symbol, String::New(buf));\n \n \/\/Signature\n BIO *sig_bio = BIO_new(BIO_s_mem());\n ASN1_STRING *sigh = x->signature; \n unsigned char *s;\n unsigned int n1 = sigh->length;\n s = sigh->data;\n for (int i=0; i<n1; i++) {\n BIO_printf(sig_bio, \"%02x%s\", s[i], ((i+1) == n1) ? \"\":\":\");\n }\n char sig_buf [n1*3];\n BIO_read(sig_bio, sig_buf, sizeof(sig_buf)-1);\n info->Set(signature_symbol, String::New(sig_buf));\n\n \/\/finger print\n int j;\n unsigned int n;\n unsigned char md[EVP_MAX_MD_SIZE];\n const EVP_MD *fdig = EVP_sha1();\n if (X509_digest(x, fdig, md, &n)) {\n const char hex[] = \"0123456789ABCDEF\";\n char fingerprint[EVP_MAX_MD_SIZE*3];\n for (j=0; j<n; j++) {\n fingerprint[3*j] = hex[(md[j] & 0xf0) >> 4];\n fingerprint[(3*j)+1] = hex[(md[j] & 0x0f)];\n fingerprint[(3*j)+2] = ':';\n }\n\n if (n > 0) {\n fingerprint[(3*(n-1))+2] = '\\0';\n } else {\n fingerprint[0] = '\\0';\n }\n info->Set(fingerprint_symbol, String::New(fingerprint));\n } else {\n fprintf(stderr, \"Digest bad\\n\");\n }\n \n \/\/Extensions\n STACK_OF(ASN1_OBJECT) *eku = (STACK_OF(ASN1_OBJECT) *)X509_get_ext_d2i(\n x, NID_ext_key_usage, NULL, NULL);\n if (eku != NULL) {\n Local<Array> ext_key_usage = Array::New();\n\n for (int i = 0; i < sk_ASN1_OBJECT_num(eku); i++) {\n memset(buf, 0, sizeof(buf));\n OBJ_obj2txt(buf, sizeof(buf) - 1, sk_ASN1_OBJECT_value(eku, i), 1);\n ext_key_usage->Set(Integer::New(i), String::New(buf));\n }\n sk_ASN1_OBJECT_pop_free(eku, ASN1_OBJECT_free);\n info->Set(ext_key_usage_symbol, ext_key_usage);\n }\n\n \/\/Pub key in pem format\n BIO *key_bio = BIO_new(BIO_s_mem());\n int ok = PEM_write_bio_PUBKEY(key_bio, pkey);\n if (ok) {\n BUF_MEM *bptr;\n BIO_get_mem_ptr(key_bio, &bptr);\n char *pub_buf = (char *)malloc(bptr->length +1);\n memcpy(pub_buf, bptr->data, bptr->length-1);\n pub_buf[bptr->length-1] = 0;\n info->Set(pubkey_pem_symbol, String::New(pub_buf));\n delete [] pub_buf;\n BIO_free(key_bio);\n }\n\n\n \/\/ delete [] buf;\n X509_free(x);\n EVP_PKEY_free(pkey);\n delete [] cert_buf;\n if (bio != NULL) BIO_free(bio);\n return scope.Close(info);\n}\n\nX509* DX509::load_cert(char *cert, int cert_len, int format) {\n BIO *bp = BIO_new_mem_buf(cert, cert_len);\n X509 *x = NULL;\n if (format == 0) {\n x = d2i_X509_bio(bp, NULL);\n } else if (format == 1) {\n x = PEM_read_bio_X509_AUX(bp, NULL, NULL, NULL);\n }\n\n if (x == NULL) {\n \/\/ ERR_print_errors(stderr);\n }\n if (bp != NULL) {\n BIO_free(bp);\n }\n return x;\n}\n\nDX509::DX509() : ObjectWrap() {\n}\n\nDX509::~DX509() {\n}\n\nint DX509::update_buf_len(const BIGNUM *b, size_t *pbuflen) {\n\tsize_t i;\n\tif (!b)\n\t\treturn 0;\n\tif (*pbuflen < (i = (size_t)BN_num_bytes(b)))\n\t\t\t*pbuflen = i;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- GenerateCode.cpp - Functions for generating executable files ------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions for generating executable files once linking\n\/\/ has finished. This includes generating a shell script to run the JIT or\n\/\/ a native executable derived from the bytecode.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gccld.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Analysis\/LoadValueNumbering.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/Linker.h\"\n#include \"Support\/SystemUtils.h\"\n#include \"Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n cl::opt<bool>\n DisableInline(\"disable-inlining\", cl::desc(\"Do not run the inliner pass\"));\n\n cl::opt<bool>\n Verify(\"verify\", cl::desc(\"Verify intermediate results of all passes\"));\n\n cl::opt<bool>\n DisableOptimizations(\"disable-opt\",\n cl::desc(\"Do not run any optimization passes\"));\n}\n\nstatic inline void addPass(PassManager &PM, Pass *P) {\n \/\/ Add the pass to the pass manager...\n PM.add(P);\n \n \/\/ If we are verifying all of the intermediate steps, add the verifier...\n if (Verify) PM.add(createVerifierPass());\n}\n\n\/\/\/ GenerateBytecode - generates a bytecode file from the specified module.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ M - The module for which bytecode should be generated.\n\/\/\/ Strip - Flags whether symbols should be stripped from the output.\n\/\/\/ Internalize - Flags whether all symbols should be marked internal.\n\/\/\/ Out - Pointer to file stream to which to write the output.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateBytecode(Module *M, bool Strip, bool Internalize,\n std::ostream *Out) {\n \/\/ In addition to just linking the input from GCC, we also want to spiff it up\n \/\/ a little bit. Do this now.\n PassManager Passes;\n\n if (Verify) Passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n addPass(Passes, new TargetData(\"gccld\", M));\n\n \/\/ Often if the programmer does not specify proper prototypes for the\n \/\/ functions they are calling, they end up calling a vararg version of the\n \/\/ function that does not get a body filled in (the real function has typed\n \/\/ arguments). This pass merges the two functions.\n addPass(Passes, createFunctionResolvingPass());\n\n if (!DisableOptimizations) {\n if (Internalize) {\n \/\/ Now that composite has been compiled, scan through the module, looking\n \/\/ for a main function. If main is defined, mark all other functions\n \/\/ internal.\n addPass(Passes, createInternalizePass());\n }\n\n \/\/ Now that we internalized some globals, see if we can mark any globals as\n \/\/ being constant!\n addPass(Passes, createGlobalConstifierPass());\n\n \/\/ Linking modules together can lead to duplicated global constants, only\n \/\/ keep one copy of each constant...\n addPass(Passes, createConstantMergePass());\n\n \/\/ If the -s command line option was specified, strip the symbols out of the\n \/\/ resulting program to make it smaller. -s is a GCC option that we are\n \/\/ supporting.\n if (Strip)\n addPass(Passes, createSymbolStrippingPass());\n\n \/\/ Propagate constants at call sites into the functions they call.\n addPass(Passes, createIPConstantPropagationPass());\n\n \/\/ Remove unused arguments from functions...\n addPass(Passes, createDeadArgEliminationPass());\n\n if (!DisableInline)\n addPass(Passes, createFunctionInliningPass()); \/\/ Inline small functions\n\n \/\/ If we didn't decide to inline a function, check to see if we can\n \/\/ transform it to pass arguments by value instead of by reference.\n addPass(Passes, createArgumentPromotionPass());\n\n \/\/ The IPO passes may leave cruft around. Clean up after them.\n addPass(Passes, createInstructionCombiningPass());\n\n addPass(Passes, createScalarReplAggregatesPass()); \/\/ Break up allocas\n\n \/\/ Run a few AA driven optimizations here and now, to cleanup the code.\n \/\/ Eventually we should put an IP AA in place here.\n\n addPass(Passes, createLICMPass()); \/\/ Hoist loop invariants\n addPass(Passes, createLoadValueNumberingPass()); \/\/ GVN for load instrs\n addPass(Passes, createGCSEPass()); \/\/ Remove common subexprs\n\n \/\/ Cleanup and simplify the code after the scalar optimizations.\n addPass(Passes, createInstructionCombiningPass());\n\n \/\/ Delete basic blocks, which optimization passes may have killed...\n addPass(Passes, createCFGSimplificationPass());\n\n \/\/ Now that we have optimized the program, discard unreachable functions...\n addPass(Passes, createGlobalDCEPass());\n }\n\n \/\/ Make sure everything is still good.\n Passes.add(createVerifierPass());\n\n \/\/ Add the pass that writes bytecode to the output file...\n addPass(Passes, new WriteBytecodePass(Out));\n\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M);\n\n return 0;\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ llc - The pathname to use for LLC.\n\/\/\/ envp - The environment to use when running LLC.\n\/\/\/\n\/\/\/ Return non-zero value on error.\n\/\/\/\nint llvm::GenerateAssembly(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::string &llc,\n char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into assembly code.\n const char *cmd[6];\n cmd[0] = llc.c_str();\n cmd[1] = \"-f\";\n cmd[2] = \"-o\";\n cmd[3] = OutputFilename.c_str();\n cmd[4] = InputFilename.c_str();\n cmd[5] = 0;\n\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\nint llvm::GenerateCFile(const std::string &OutputFile,\n const std::string &InputFile,\n const std::string &llc, char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into C.\n const char *cmd[7];\n\n cmd[0] = llc.c_str();\n cmd[1] = \"-march=c\";\n cmd[2] = \"-f\";\n cmd[3] = \"-o\";\n cmd[4] = OutputFile.c_str();\n cmd[5] = InputFile.c_str();\n cmd[6] = 0;\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateNative - generates a native assembly language source file from the\n\/\/\/ specified assembly source file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ Libraries - The list of libraries with which to link.\n\/\/\/ LibPaths - The list of directories in which to find libraries.\n\/\/\/ gcc - The pathname to use for GGC.\n\/\/\/ envp - A copy of the process's current environment.\n\/\/\/\n\/\/\/ Outputs:\n\/\/\/ None.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateNative(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::vector<std::string> &Libraries,\n const std::vector<std::string> &LibPaths,\n const std::string &gcc, char ** const envp) {\n \/\/ Remove these environment variables from the environment of the\n \/\/ programs that we will execute. It appears that GCC sets these\n \/\/ environment variables so that the programs it uses can configure\n \/\/ themselves identically.\n \/\/\n \/\/ However, when we invoke GCC below, we want it to use its normal\n \/\/ configuration. Hence, we must sanitize its environment.\n char ** clean_env = CopyEnv(envp);\n if (clean_env == NULL)\n return 1;\n RemoveEnv(\"LIBRARY_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC_OPTIONS\", clean_env);\n RemoveEnv(\"GCC_EXEC_PREFIX\", clean_env);\n RemoveEnv(\"COMPILER_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC\", clean_env);\n\n std::vector<const char *> cmd;\n\n \/\/ Run GCC to assemble and link the program into native code.\n \/\/\n \/\/ Note:\n \/\/ We can't just assemble and link the file with the system assembler\n \/\/ and linker because we don't know where to put the _start symbol.\n \/\/ GCC mysteriously knows how to do it.\n cmd.push_back(gcc.c_str());\n cmd.push_back(\"-O3\");\n cmd.push_back(\"-o\");\n cmd.push_back(OutputFilename.c_str());\n cmd.push_back(InputFilename.c_str());\n\n \/\/ Adding the library paths creates a problem for native generation. If we\n \/\/ include the search paths from llvmgcc, then we'll be telling normal gcc\n \/\/ to look inside of llvmgcc's library directories for libraries. This is\n \/\/ bad because those libraries hold only bytecode files (not native object\n \/\/ files). In the end, we attempt to link the bytecode libgcc into a native\n \/\/ program.\n#if 0\n \/\/ Add in the library path options.\n for (unsigned index=0; index < LibPaths.size(); index++) {\n cmd.push_back(\"-L\");\n cmd.push_back(LibPaths[index].c_str());\n }\n#endif\n\n \/\/ Add in the libraries to link.\n std::vector<std::string> Libs(Libraries);\n for (unsigned index = 0; index < Libs.size(); index++) {\n if (Libs[index] != \"crtend\") {\n Libs[index] = \"-l\" + Libs[index];\n cmd.push_back(Libs[index].c_str());\n }\n }\n cmd.push_back(NULL);\n\n \/\/ Run the compiler to assembly and link together the program.\n return ExecWait(&(cmd[0]), clean_env);\n}\n<commit_msg>Disable strict alias analysis in the backend c compiler, as the code we generate is not TBAA safe.<commit_after>\/\/===- GenerateCode.cpp - Functions for generating executable files ------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions for generating executable files once linking\n\/\/ has finished. This includes generating a shell script to run the JIT or\n\/\/ a native executable derived from the bytecode.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gccld.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Analysis\/LoadValueNumbering.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Transforms\/Utils\/Linker.h\"\n#include \"Support\/SystemUtils.h\"\n#include \"Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n cl::opt<bool>\n DisableInline(\"disable-inlining\", cl::desc(\"Do not run the inliner pass\"));\n\n cl::opt<bool>\n Verify(\"verify\", cl::desc(\"Verify intermediate results of all passes\"));\n\n cl::opt<bool>\n DisableOptimizations(\"disable-opt\",\n cl::desc(\"Do not run any optimization passes\"));\n}\n\nstatic inline void addPass(PassManager &PM, Pass *P) {\n \/\/ Add the pass to the pass manager...\n PM.add(P);\n \n \/\/ If we are verifying all of the intermediate steps, add the verifier...\n if (Verify) PM.add(createVerifierPass());\n}\n\n\/\/\/ GenerateBytecode - generates a bytecode file from the specified module.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ M - The module for which bytecode should be generated.\n\/\/\/ Strip - Flags whether symbols should be stripped from the output.\n\/\/\/ Internalize - Flags whether all symbols should be marked internal.\n\/\/\/ Out - Pointer to file stream to which to write the output.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateBytecode(Module *M, bool Strip, bool Internalize,\n std::ostream *Out) {\n \/\/ In addition to just linking the input from GCC, we also want to spiff it up\n \/\/ a little bit. Do this now.\n PassManager Passes;\n\n if (Verify) Passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n addPass(Passes, new TargetData(\"gccld\", M));\n\n \/\/ Often if the programmer does not specify proper prototypes for the\n \/\/ functions they are calling, they end up calling a vararg version of the\n \/\/ function that does not get a body filled in (the real function has typed\n \/\/ arguments). This pass merges the two functions.\n addPass(Passes, createFunctionResolvingPass());\n\n if (!DisableOptimizations) {\n if (Internalize) {\n \/\/ Now that composite has been compiled, scan through the module, looking\n \/\/ for a main function. If main is defined, mark all other functions\n \/\/ internal.\n addPass(Passes, createInternalizePass());\n }\n\n \/\/ Now that we internalized some globals, see if we can mark any globals as\n \/\/ being constant!\n addPass(Passes, createGlobalConstifierPass());\n\n \/\/ Linking modules together can lead to duplicated global constants, only\n \/\/ keep one copy of each constant...\n addPass(Passes, createConstantMergePass());\n\n \/\/ If the -s command line option was specified, strip the symbols out of the\n \/\/ resulting program to make it smaller. -s is a GCC option that we are\n \/\/ supporting.\n if (Strip)\n addPass(Passes, createSymbolStrippingPass());\n\n \/\/ Propagate constants at call sites into the functions they call.\n addPass(Passes, createIPConstantPropagationPass());\n\n \/\/ Remove unused arguments from functions...\n addPass(Passes, createDeadArgEliminationPass());\n\n if (!DisableInline)\n addPass(Passes, createFunctionInliningPass()); \/\/ Inline small functions\n\n \/\/ If we didn't decide to inline a function, check to see if we can\n \/\/ transform it to pass arguments by value instead of by reference.\n addPass(Passes, createArgumentPromotionPass());\n\n \/\/ The IPO passes may leave cruft around. Clean up after them.\n addPass(Passes, createInstructionCombiningPass());\n\n addPass(Passes, createScalarReplAggregatesPass()); \/\/ Break up allocas\n\n \/\/ Run a few AA driven optimizations here and now, to cleanup the code.\n \/\/ Eventually we should put an IP AA in place here.\n\n addPass(Passes, createLICMPass()); \/\/ Hoist loop invariants\n addPass(Passes, createLoadValueNumberingPass()); \/\/ GVN for load instrs\n addPass(Passes, createGCSEPass()); \/\/ Remove common subexprs\n\n \/\/ Cleanup and simplify the code after the scalar optimizations.\n addPass(Passes, createInstructionCombiningPass());\n\n \/\/ Delete basic blocks, which optimization passes may have killed...\n addPass(Passes, createCFGSimplificationPass());\n\n \/\/ Now that we have optimized the program, discard unreachable functions...\n addPass(Passes, createGlobalDCEPass());\n }\n\n \/\/ Make sure everything is still good.\n Passes.add(createVerifierPass());\n\n \/\/ Add the pass that writes bytecode to the output file...\n addPass(Passes, new WriteBytecodePass(Out));\n\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M);\n\n return 0;\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ llc - The pathname to use for LLC.\n\/\/\/ envp - The environment to use when running LLC.\n\/\/\/\n\/\/\/ Return non-zero value on error.\n\/\/\/\nint llvm::GenerateAssembly(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::string &llc,\n char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into assembly code.\n const char *cmd[6];\n cmd[0] = llc.c_str();\n cmd[1] = \"-f\";\n cmd[2] = \"-o\";\n cmd[3] = OutputFilename.c_str();\n cmd[4] = InputFilename.c_str();\n cmd[5] = 0;\n\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\nint llvm::GenerateCFile(const std::string &OutputFile,\n const std::string &InputFile,\n const std::string &llc, char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into C.\n const char *cmd[7];\n\n cmd[0] = llc.c_str();\n cmd[1] = \"-march=c\";\n cmd[2] = \"-f\";\n cmd[3] = \"-o\";\n cmd[4] = OutputFile.c_str();\n cmd[5] = InputFile.c_str();\n cmd[6] = 0;\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateNative - generates a native assembly language source file from the\n\/\/\/ specified assembly source file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ Libraries - The list of libraries with which to link.\n\/\/\/ LibPaths - The list of directories in which to find libraries.\n\/\/\/ gcc - The pathname to use for GGC.\n\/\/\/ envp - A copy of the process's current environment.\n\/\/\/\n\/\/\/ Outputs:\n\/\/\/ None.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateNative(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::vector<std::string> &Libraries,\n const std::vector<std::string> &LibPaths,\n const std::string &gcc, char ** const envp) {\n \/\/ Remove these environment variables from the environment of the\n \/\/ programs that we will execute. It appears that GCC sets these\n \/\/ environment variables so that the programs it uses can configure\n \/\/ themselves identically.\n \/\/\n \/\/ However, when we invoke GCC below, we want it to use its normal\n \/\/ configuration. Hence, we must sanitize its environment.\n char ** clean_env = CopyEnv(envp);\n if (clean_env == NULL)\n return 1;\n RemoveEnv(\"LIBRARY_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC_OPTIONS\", clean_env);\n RemoveEnv(\"GCC_EXEC_PREFIX\", clean_env);\n RemoveEnv(\"COMPILER_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC\", clean_env);\n\n std::vector<const char *> cmd;\n\n \/\/ Run GCC to assemble and link the program into native code.\n \/\/\n \/\/ Note:\n \/\/ We can't just assemble and link the file with the system assembler\n \/\/ and linker because we don't know where to put the _start symbol.\n \/\/ GCC mysteriously knows how to do it.\n cmd.push_back(gcc.c_str());\n cmd.push_back(\"-fno-strict-aliasing\");\n cmd.push_back(\"-O3\");\n cmd.push_back(\"-o\");\n cmd.push_back(OutputFilename.c_str());\n cmd.push_back(InputFilename.c_str());\n\n \/\/ Adding the library paths creates a problem for native generation. If we\n \/\/ include the search paths from llvmgcc, then we'll be telling normal gcc\n \/\/ to look inside of llvmgcc's library directories for libraries. This is\n \/\/ bad because those libraries hold only bytecode files (not native object\n \/\/ files). In the end, we attempt to link the bytecode libgcc into a native\n \/\/ program.\n#if 0\n \/\/ Add in the library path options.\n for (unsigned index=0; index < LibPaths.size(); index++) {\n cmd.push_back(\"-L\");\n cmd.push_back(LibPaths[index].c_str());\n }\n#endif\n\n \/\/ Add in the libraries to link.\n std::vector<std::string> Libs(Libraries);\n for (unsigned index = 0; index < Libs.size(); index++) {\n if (Libs[index] != \"crtend\") {\n Libs[index] = \"-l\" + Libs[index];\n cmd.push_back(Libs[index].c_str());\n }\n }\n cmd.push_back(NULL);\n\n \/\/ Run the compiler to assembly and link together the program.\n return ExecWait(&(cmd[0]), clean_env);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- GenerateCode.cpp - Functions for generating executable files ------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions for generating executable files once linking\n\/\/ has finished. This includes generating a shell script to run the JIT or\n\/\/ a native executable derived from the bytecode.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gccld.h\"\n#include \"llvm\/Linker.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Analysis\/LoadValueNumbering.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n cl::opt<bool>\n DisableInline(\"disable-inlining\", cl::desc(\"Do not run the inliner pass\"));\n\n cl::opt<bool>\n Verify(\"verify\", cl::desc(\"Verify intermediate results of all passes\"));\n\n cl::opt<bool>\n DisableOptimizations(\"disable-opt\",\n cl::desc(\"Do not run any optimization passes\"));\n}\n\n\/\/\/ CopyEnv - This function takes an array of environment variables and makes a\n\/\/\/ copy of it. This copy can then be manipulated any way the caller likes\n\/\/\/ without affecting the process's real environment.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ envp - An array of C strings containing an environment.\n\/\/\/\n\/\/\/ Return value:\n\/\/\/ NULL - An error occurred.\n\/\/\/\n\/\/\/ Otherwise, a pointer to a new array of C strings is returned. Every string\n\/\/\/ in the array is a duplicate of the one in the original array (i.e. we do\n\/\/\/ not copy the char *'s from one array to another).\n\/\/\/\nstatic char ** CopyEnv(char ** const envp) {\n \/\/ Count the number of entries in the old list;\n unsigned entries; \/\/ The number of entries in the old environment list\n for (entries = 0; envp[entries] != NULL; entries++)\n \/*empty*\/;\n\n \/\/ Add one more entry for the NULL pointer that ends the list.\n ++entries;\n\n \/\/ If there are no entries at all, just return NULL.\n if (entries == 0)\n return NULL;\n\n \/\/ Allocate a new environment list.\n char **newenv = new char* [entries];\n if ((newenv = new char* [entries]) == NULL)\n return NULL;\n\n \/\/ Make a copy of the list. Don't forget the NULL that ends the list.\n entries = 0;\n while (envp[entries] != NULL) {\n newenv[entries] = new char[strlen (envp[entries]) + 1];\n strcpy (newenv[entries], envp[entries]);\n ++entries;\n }\n newenv[entries] = NULL;\n\n return newenv;\n}\n\n\n\/\/\/ RemoveEnv - Remove the specified environment variable from the environment\n\/\/\/ array.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ name - The name of the variable to remove. It cannot be NULL.\n\/\/\/ envp - The array of environment variables. It cannot be NULL.\n\/\/\/\n\/\/\/ Notes:\n\/\/\/ This is mainly done because functions to remove items from the environment\n\/\/\/ are not available across all platforms. In particular, Solaris does not\n\/\/\/ seem to have an unsetenv() function or a setenv() function (or they are\n\/\/\/ undocumented if they do exist).\n\/\/\/\nstatic void RemoveEnv(const char * name, char ** const envp) {\n for (unsigned index=0; envp[index] != NULL; index++) {\n \/\/ Find the first equals sign in the array and make it an EOS character.\n char *p = strchr (envp[index], '=');\n if (p == NULL)\n continue;\n else\n *p = '\\0';\n\n \/\/ Compare the two strings. If they are equal, zap this string.\n \/\/ Otherwise, restore it.\n if (!strcmp(name, envp[index]))\n *envp[index] = '\\0';\n else\n *p = '=';\n }\n\n return;\n}\n\nstatic inline void addPass(PassManager &PM, Pass *P) {\n \/\/ Add the pass to the pass manager...\n PM.add(P);\n \n \/\/ If we are verifying all of the intermediate steps, add the verifier...\n if (Verify) PM.add(createVerifierPass());\n}\n\n\/\/\/ GenerateBytecode - generates a bytecode file from the specified module.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ M - The module for which bytecode should be generated.\n\/\/\/ StripLevel - 2 if we should strip all symbols, 1 if we should strip\n\/\/\/ debug info.\n\/\/\/ Internalize - Flags whether all symbols should be marked internal.\n\/\/\/ Out - Pointer to file stream to which to write the output.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateBytecode(Module *M, int StripLevel, bool Internalize,\n std::ostream *Out) {\n \/\/ In addition to just linking the input from GCC, we also want to spiff it up\n \/\/ a little bit. Do this now.\n PassManager Passes;\n\n if (Verify) Passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n addPass(Passes, new TargetData(\"gccld\", M));\n\n \/\/ Often if the programmer does not specify proper prototypes for the\n \/\/ functions they are calling, they end up calling a vararg version of the\n \/\/ function that does not get a body filled in (the real function has typed\n \/\/ arguments). This pass merges the two functions.\n addPass(Passes, createFunctionResolvingPass());\n\n if (!DisableOptimizations) {\n if (Internalize) {\n \/\/ Now that composite has been compiled, scan through the module, looking\n \/\/ for a main function. If main is defined, mark all other functions\n \/\/ internal.\n addPass(Passes, createInternalizePass());\n }\n\n \/\/ Now that we internalized some globals, see if we can hack on them!\n addPass(Passes, createGlobalOptimizerPass());\n\n \/\/ Linking modules together can lead to duplicated global constants, only\n \/\/ keep one copy of each constant...\n addPass(Passes, createConstantMergePass());\n\n \/\/ Propagate constants at call sites into the functions they call.\n addPass(Passes, createIPSCCPPass());\n addPass(Passes, createCFGSimplificationPass());\n\n \/\/ Remove unused arguments from functions...\n addPass(Passes, createDeadArgEliminationPass());\n\n if (!DisableInline)\n addPass(Passes, createFunctionInliningPass()); \/\/ Inline small functions\n\n addPass(Passes, createPruneEHPass()); \/\/ Remove dead EH info\n addPass(Passes, createGlobalOptimizerPass()); \/\/ Optimize globals again.\n addPass(Passes, createGlobalDCEPass()); \/\/ Remove dead functions\n\n \/\/ If we didn't decide to inline a function, check to see if we can\n \/\/ transform it to pass arguments by value instead of by reference.\n addPass(Passes, createArgumentPromotionPass());\n\n \/\/ The IPO passes may leave cruft around. Clean up after them.\n addPass(Passes, createInstructionCombiningPass());\n\n addPass(Passes, createScalarReplAggregatesPass()); \/\/ Break up allocas\n\n \/\/ Run a few AA driven optimizations here and now, to cleanup the code.\n addPass(Passes, createGlobalsModRefPass()); \/\/ IP alias analysis\n\n addPass(Passes, createLICMPass()); \/\/ Hoist loop invariants\n addPass(Passes, createLoadValueNumberingPass()); \/\/ GVN for load instrs\n addPass(Passes, createGCSEPass()); \/\/ Remove common subexprs\n addPass(Passes, createDeadStoreEliminationPass()); \/\/ Nuke dead stores\n\n \/\/ Cleanup and simplify the code after the scalar optimizations.\n addPass(Passes, createInstructionCombiningPass());\n\n \/\/ Delete basic blocks, which optimization passes may have killed...\n addPass(Passes, createCFGSimplificationPass());\n\n \/\/ Now that we have optimized the program, discard unreachable functions...\n addPass(Passes, createGlobalDCEPass());\n }\n\n \/\/ If the -s or -S command line options were specified, strip the symbols out\n \/\/ of the resulting program to make it smaller. -s and -S are GLD options\n \/\/ that we are supporting.\n if (StripLevel)\n addPass(Passes, createStripSymbolsPass(StripLevel == 1));\n\n \/\/ Make sure everything is still good.\n Passes.add(createVerifierPass());\n\n \/\/ Add the pass that writes bytecode to the output file...\n addPass(Passes, new WriteBytecodePass(Out));\n\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M);\n\n return 0;\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ llc - The pathname to use for LLC.\n\/\/\/ envp - The environment to use when running LLC.\n\/\/\/\n\/\/\/ Return non-zero value on error.\n\/\/\/\nint llvm::GenerateAssembly(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::string &llc,\n char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into assembly code.\n const char *cmd[6];\n cmd[0] = llc.c_str();\n cmd[1] = \"-f\";\n cmd[2] = \"-o\";\n cmd[3] = OutputFilename.c_str();\n cmd[4] = InputFilename.c_str();\n cmd[5] = 0;\n\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\nint llvm::GenerateCFile(const std::string &OutputFile,\n const std::string &InputFile,\n const std::string &llc, char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into C.\n const char *cmd[7];\n\n cmd[0] = llc.c_str();\n cmd[1] = \"-march=c\";\n cmd[2] = \"-f\";\n cmd[3] = \"-o\";\n cmd[4] = OutputFile.c_str();\n cmd[5] = InputFile.c_str();\n cmd[6] = 0;\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateNative - generates a native assembly language source file from the\n\/\/\/ specified assembly source file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ Libraries - The list of libraries with which to link.\n\/\/\/ LibPaths - The list of directories in which to find libraries.\n\/\/\/ gcc - The pathname to use for GGC.\n\/\/\/ envp - A copy of the process's current environment.\n\/\/\/\n\/\/\/ Outputs:\n\/\/\/ None.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateNative(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::vector<std::string> &Libraries,\n const std::vector<std::string> &LibPaths,\n const std::string &gcc, char ** const envp) {\n \/\/ Remove these environment variables from the environment of the\n \/\/ programs that we will execute. It appears that GCC sets these\n \/\/ environment variables so that the programs it uses can configure\n \/\/ themselves identically.\n \/\/\n \/\/ However, when we invoke GCC below, we want it to use its normal\n \/\/ configuration. Hence, we must sanitize its environment.\n char ** clean_env = CopyEnv(envp);\n if (clean_env == NULL)\n return 1;\n RemoveEnv(\"LIBRARY_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC_OPTIONS\", clean_env);\n RemoveEnv(\"GCC_EXEC_PREFIX\", clean_env);\n RemoveEnv(\"COMPILER_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC\", clean_env);\n\n std::vector<const char *> cmd;\n\n \/\/ Run GCC to assemble and link the program into native code.\n \/\/\n \/\/ Note:\n \/\/ We can't just assemble and link the file with the system assembler\n \/\/ and linker because we don't know where to put the _start symbol.\n \/\/ GCC mysteriously knows how to do it.\n cmd.push_back(gcc.c_str());\n cmd.push_back(\"-fno-strict-aliasing\");\n cmd.push_back(\"-O3\");\n cmd.push_back(\"-o\");\n cmd.push_back(OutputFilename.c_str());\n cmd.push_back(InputFilename.c_str());\n\n \/\/ Adding the library paths creates a problem for native generation. If we\n \/\/ include the search paths from llvmgcc, then we'll be telling normal gcc\n \/\/ to look inside of llvmgcc's library directories for libraries. This is\n \/\/ bad because those libraries hold only bytecode files (not native object\n \/\/ files). In the end, we attempt to link the bytecode libgcc into a native\n \/\/ program.\n#if 0\n \/\/ Add in the library path options.\n for (unsigned index=0; index < LibPaths.size(); index++) {\n cmd.push_back(\"-L\");\n cmd.push_back(LibPaths[index].c_str());\n }\n#endif\n\n \/\/ Add in the libraries to link.\n std::vector<std::string> Libs(Libraries);\n for (unsigned index = 0; index < Libs.size(); index++) {\n if (Libs[index] != \"crtend\") {\n Libs[index] = \"-l\" + Libs[index];\n cmd.push_back(Libs[index].c_str());\n }\n }\n cmd.push_back(NULL);\n\n \/\/ Run the compiler to assembly and link together the program.\n return ExecWait(&(cmd[0]), clean_env);\n}\n\n<commit_msg>This pass is no longer needed.<commit_after>\/\/===- GenerateCode.cpp - Functions for generating executable files ------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file contains functions for generating executable files once linking\n\/\/ has finished. This includes generating a shell script to run the JIT or\n\/\/ a native executable derived from the bytecode.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"gccld.h\"\n#include \"llvm\/Linker.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/PassManager.h\"\n#include \"llvm\/Analysis\/LoadValueNumbering.h\"\n#include \"llvm\/Analysis\/Passes.h\"\n#include \"llvm\/Analysis\/Verifier.h\"\n#include \"llvm\/Bytecode\/WriteBytecodePass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"llvm\/Transforms\/IPO.h\"\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Support\/SystemUtils.h\"\n#include \"llvm\/Support\/CommandLine.h\"\nusing namespace llvm;\n\nnamespace {\n cl::opt<bool>\n DisableInline(\"disable-inlining\", cl::desc(\"Do not run the inliner pass\"));\n\n cl::opt<bool>\n Verify(\"verify\", cl::desc(\"Verify intermediate results of all passes\"));\n\n cl::opt<bool>\n DisableOptimizations(\"disable-opt\",\n cl::desc(\"Do not run any optimization passes\"));\n}\n\n\/\/\/ CopyEnv - This function takes an array of environment variables and makes a\n\/\/\/ copy of it. This copy can then be manipulated any way the caller likes\n\/\/\/ without affecting the process's real environment.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ envp - An array of C strings containing an environment.\n\/\/\/\n\/\/\/ Return value:\n\/\/\/ NULL - An error occurred.\n\/\/\/\n\/\/\/ Otherwise, a pointer to a new array of C strings is returned. Every string\n\/\/\/ in the array is a duplicate of the one in the original array (i.e. we do\n\/\/\/ not copy the char *'s from one array to another).\n\/\/\/\nstatic char ** CopyEnv(char ** const envp) {\n \/\/ Count the number of entries in the old list;\n unsigned entries; \/\/ The number of entries in the old environment list\n for (entries = 0; envp[entries] != NULL; entries++)\n \/*empty*\/;\n\n \/\/ Add one more entry for the NULL pointer that ends the list.\n ++entries;\n\n \/\/ If there are no entries at all, just return NULL.\n if (entries == 0)\n return NULL;\n\n \/\/ Allocate a new environment list.\n char **newenv = new char* [entries];\n if ((newenv = new char* [entries]) == NULL)\n return NULL;\n\n \/\/ Make a copy of the list. Don't forget the NULL that ends the list.\n entries = 0;\n while (envp[entries] != NULL) {\n newenv[entries] = new char[strlen (envp[entries]) + 1];\n strcpy (newenv[entries], envp[entries]);\n ++entries;\n }\n newenv[entries] = NULL;\n\n return newenv;\n}\n\n\n\/\/\/ RemoveEnv - Remove the specified environment variable from the environment\n\/\/\/ array.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ name - The name of the variable to remove. It cannot be NULL.\n\/\/\/ envp - The array of environment variables. It cannot be NULL.\n\/\/\/\n\/\/\/ Notes:\n\/\/\/ This is mainly done because functions to remove items from the environment\n\/\/\/ are not available across all platforms. In particular, Solaris does not\n\/\/\/ seem to have an unsetenv() function or a setenv() function (or they are\n\/\/\/ undocumented if they do exist).\n\/\/\/\nstatic void RemoveEnv(const char * name, char ** const envp) {\n for (unsigned index=0; envp[index] != NULL; index++) {\n \/\/ Find the first equals sign in the array and make it an EOS character.\n char *p = strchr (envp[index], '=');\n if (p == NULL)\n continue;\n else\n *p = '\\0';\n\n \/\/ Compare the two strings. If they are equal, zap this string.\n \/\/ Otherwise, restore it.\n if (!strcmp(name, envp[index]))\n *envp[index] = '\\0';\n else\n *p = '=';\n }\n\n return;\n}\n\nstatic inline void addPass(PassManager &PM, Pass *P) {\n \/\/ Add the pass to the pass manager...\n PM.add(P);\n \n \/\/ If we are verifying all of the intermediate steps, add the verifier...\n if (Verify) PM.add(createVerifierPass());\n}\n\n\/\/\/ GenerateBytecode - generates a bytecode file from the specified module.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ M - The module for which bytecode should be generated.\n\/\/\/ StripLevel - 2 if we should strip all symbols, 1 if we should strip\n\/\/\/ debug info.\n\/\/\/ Internalize - Flags whether all symbols should be marked internal.\n\/\/\/ Out - Pointer to file stream to which to write the output.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateBytecode(Module *M, int StripLevel, bool Internalize,\n std::ostream *Out) {\n \/\/ In addition to just linking the input from GCC, we also want to spiff it up\n \/\/ a little bit. Do this now.\n PassManager Passes;\n\n if (Verify) Passes.add(createVerifierPass());\n\n \/\/ Add an appropriate TargetData instance for this module...\n addPass(Passes, new TargetData(\"gccld\", M));\n\n \/\/ Often if the programmer does not specify proper prototypes for the\n \/\/ functions they are calling, they end up calling a vararg version of the\n \/\/ function that does not get a body filled in (the real function has typed\n \/\/ arguments). This pass merges the two functions.\n addPass(Passes, createFunctionResolvingPass());\n\n if (!DisableOptimizations) {\n if (Internalize) {\n \/\/ Now that composite has been compiled, scan through the module, looking\n \/\/ for a main function. If main is defined, mark all other functions\n \/\/ internal.\n addPass(Passes, createInternalizePass());\n }\n\n \/\/ Now that we internalized some globals, see if we can hack on them!\n addPass(Passes, createGlobalOptimizerPass());\n\n \/\/ Linking modules together can lead to duplicated global constants, only\n \/\/ keep one copy of each constant...\n addPass(Passes, createConstantMergePass());\n\n \/\/ Propagate constants at call sites into the functions they call.\n addPass(Passes, createIPSCCPPass());\n\n \/\/ Remove unused arguments from functions...\n addPass(Passes, createDeadArgEliminationPass());\n\n if (!DisableInline)\n addPass(Passes, createFunctionInliningPass()); \/\/ Inline small functions\n\n addPass(Passes, createPruneEHPass()); \/\/ Remove dead EH info\n addPass(Passes, createGlobalOptimizerPass()); \/\/ Optimize globals again.\n addPass(Passes, createGlobalDCEPass()); \/\/ Remove dead functions\n\n \/\/ If we didn't decide to inline a function, check to see if we can\n \/\/ transform it to pass arguments by value instead of by reference.\n addPass(Passes, createArgumentPromotionPass());\n\n \/\/ The IPO passes may leave cruft around. Clean up after them.\n addPass(Passes, createInstructionCombiningPass());\n\n addPass(Passes, createScalarReplAggregatesPass()); \/\/ Break up allocas\n\n \/\/ Run a few AA driven optimizations here and now, to cleanup the code.\n addPass(Passes, createGlobalsModRefPass()); \/\/ IP alias analysis\n\n addPass(Passes, createLICMPass()); \/\/ Hoist loop invariants\n addPass(Passes, createLoadValueNumberingPass()); \/\/ GVN for load instrs\n addPass(Passes, createGCSEPass()); \/\/ Remove common subexprs\n addPass(Passes, createDeadStoreEliminationPass()); \/\/ Nuke dead stores\n\n \/\/ Cleanup and simplify the code after the scalar optimizations.\n addPass(Passes, createInstructionCombiningPass());\n\n \/\/ Delete basic blocks, which optimization passes may have killed...\n addPass(Passes, createCFGSimplificationPass());\n\n \/\/ Now that we have optimized the program, discard unreachable functions...\n addPass(Passes, createGlobalDCEPass());\n }\n\n \/\/ If the -s or -S command line options were specified, strip the symbols out\n \/\/ of the resulting program to make it smaller. -s and -S are GLD options\n \/\/ that we are supporting.\n if (StripLevel)\n addPass(Passes, createStripSymbolsPass(StripLevel == 1));\n\n \/\/ Make sure everything is still good.\n Passes.add(createVerifierPass());\n\n \/\/ Add the pass that writes bytecode to the output file...\n addPass(Passes, new WriteBytecodePass(Out));\n\n \/\/ Run our queue of passes all at once now, efficiently.\n Passes.run(*M);\n\n return 0;\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ llc - The pathname to use for LLC.\n\/\/\/ envp - The environment to use when running LLC.\n\/\/\/\n\/\/\/ Return non-zero value on error.\n\/\/\/\nint llvm::GenerateAssembly(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::string &llc,\n char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into assembly code.\n const char *cmd[6];\n cmd[0] = llc.c_str();\n cmd[1] = \"-f\";\n cmd[2] = \"-o\";\n cmd[3] = OutputFilename.c_str();\n cmd[4] = InputFilename.c_str();\n cmd[5] = 0;\n\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateAssembly - generates a native assembly language source file from the\n\/\/\/ specified bytecode file.\nint llvm::GenerateCFile(const std::string &OutputFile,\n const std::string &InputFile,\n const std::string &llc, char ** const envp) {\n \/\/ Run LLC to convert the bytecode file into C.\n const char *cmd[7];\n\n cmd[0] = llc.c_str();\n cmd[1] = \"-march=c\";\n cmd[2] = \"-f\";\n cmd[3] = \"-o\";\n cmd[4] = OutputFile.c_str();\n cmd[5] = InputFile.c_str();\n cmd[6] = 0;\n return ExecWait(cmd, envp);\n}\n\n\/\/\/ GenerateNative - generates a native assembly language source file from the\n\/\/\/ specified assembly source file.\n\/\/\/\n\/\/\/ Inputs:\n\/\/\/ InputFilename - The name of the output bytecode file.\n\/\/\/ OutputFilename - The name of the file to generate.\n\/\/\/ Libraries - The list of libraries with which to link.\n\/\/\/ LibPaths - The list of directories in which to find libraries.\n\/\/\/ gcc - The pathname to use for GGC.\n\/\/\/ envp - A copy of the process's current environment.\n\/\/\/\n\/\/\/ Outputs:\n\/\/\/ None.\n\/\/\/\n\/\/\/ Returns non-zero value on error.\n\/\/\/\nint llvm::GenerateNative(const std::string &OutputFilename,\n const std::string &InputFilename,\n const std::vector<std::string> &Libraries,\n const std::vector<std::string> &LibPaths,\n const std::string &gcc, char ** const envp) {\n \/\/ Remove these environment variables from the environment of the\n \/\/ programs that we will execute. It appears that GCC sets these\n \/\/ environment variables so that the programs it uses can configure\n \/\/ themselves identically.\n \/\/\n \/\/ However, when we invoke GCC below, we want it to use its normal\n \/\/ configuration. Hence, we must sanitize its environment.\n char ** clean_env = CopyEnv(envp);\n if (clean_env == NULL)\n return 1;\n RemoveEnv(\"LIBRARY_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC_OPTIONS\", clean_env);\n RemoveEnv(\"GCC_EXEC_PREFIX\", clean_env);\n RemoveEnv(\"COMPILER_PATH\", clean_env);\n RemoveEnv(\"COLLECT_GCC\", clean_env);\n\n std::vector<const char *> cmd;\n\n \/\/ Run GCC to assemble and link the program into native code.\n \/\/\n \/\/ Note:\n \/\/ We can't just assemble and link the file with the system assembler\n \/\/ and linker because we don't know where to put the _start symbol.\n \/\/ GCC mysteriously knows how to do it.\n cmd.push_back(gcc.c_str());\n cmd.push_back(\"-fno-strict-aliasing\");\n cmd.push_back(\"-O3\");\n cmd.push_back(\"-o\");\n cmd.push_back(OutputFilename.c_str());\n cmd.push_back(InputFilename.c_str());\n\n \/\/ Adding the library paths creates a problem for native generation. If we\n \/\/ include the search paths from llvmgcc, then we'll be telling normal gcc\n \/\/ to look inside of llvmgcc's library directories for libraries. This is\n \/\/ bad because those libraries hold only bytecode files (not native object\n \/\/ files). In the end, we attempt to link the bytecode libgcc into a native\n \/\/ program.\n#if 0\n \/\/ Add in the library path options.\n for (unsigned index=0; index < LibPaths.size(); index++) {\n cmd.push_back(\"-L\");\n cmd.push_back(LibPaths[index].c_str());\n }\n#endif\n\n \/\/ Add in the libraries to link.\n std::vector<std::string> Libs(Libraries);\n for (unsigned index = 0; index < Libs.size(); index++) {\n if (Libs[index] != \"crtend\") {\n Libs[index] = \"-l\" + Libs[index];\n cmd.push_back(Libs[index].c_str());\n }\n }\n cmd.push_back(NULL);\n\n \/\/ Run the compiler to assembly and link together the program.\n return ExecWait(&(cmd[0]), clean_env);\n}\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>WaE: suggest explicit braces to avoid ambiguous 'else'<commit_after><|endoftext|>"} {"text":"<commit_before>\/*\n * DS3231.cpp\n *\n * Created on: Feb 16, 2016\n * Author: leo\n *\/\n\n#include \"DS3231.h\"\n#include \"TWI.h\"\n#include <stdio.h>\n#include <util\/delay.h>\n\nDS3231::DS3231() : TWI() {\n\tsystem_time = 0;\n\taddress = 0x00;\n}\n\nDS3231::DS3231(TWI_Data * twi_d, uint8_t address) : TWI(twi_d){\n\tsystem_time = 0;\n\tthis->address = address;\n}\n\n\/\/ TODO: using interrupts to update system clock internally\nDS3231::DS3231(TWI_Data * twi_d, uint8_t address, bool high_update_frequency){\n\n\tif(high_update_frequency){\n\t\t\/\/TODO: get system time and setup interrupts\n\t\tthis->address = address;\n\t\tsystem_time = 0;\n\t} else {\n\t\tDS3231(twi_d, address);\n\t\tsystem_time = 0;\n\t}\n}\n\nstatic uint8_t bind2bcd(uint8_t val) { return val + 6 * (val \/ 10); }\nstatic uint8_t bcd2bin (uint8_t val) { return val - 6 * (val >> 4); }\n\nuint8_t DS3231::read_i2c_register(uint8_t addr, uint8_t reg) {\n\n\tprintf(\"reading i2c register.\\n\");\n\tbeginWrite(addr);\n\tprintf(\"lets go....\\n\");\n\tuint8_t reg_val = 0;;\n\tprintf(\"about to write a char\");\n\tputChar(reg);\n\tprintf(\"wrote a char\");\n\tendTransmission();\n\n\treg_val = beginReadFirstByte(addr);\n\t\/\/reg_val = getChar();\n\tendTransmission();\n\n\treturn reg_val;\n}\n\nvoid DS3231::write_i2c_register(uint8_t addr, uint8_t reg, uint8_t val) {\n\tprintf(\"About to write staus reg..\\n\");\n\tbeginWrite(addr);\n\tprintf(\"About to actually write staus reg..\\n\");\n\tputChar(reg);\n\tprintf(\"Writing status reg value\\n\");\n\tputChar(val);\n\tprintf(\"Finishing..\\n\");\n\tendTransmission();\n}\n\nvoid DS3231::setTime(struct tm * time){\n\tbeginWrite(address);\n\tputChar(0x00);\n\tprintf(\"Order:\\ns:\\t%d\\nmin:\\t%d\\nh:\\t%d\\nd:\\t%d\\nmon:\\t%d\\ny:\\t%d\\n\",\n\t\t\t\ttime->tm_sec, time->tm_min, time->tm_hour,\n\t\t\t\ttime->tm_mday, time->tm_mon, time->tm_year);\n\tputChar(bind2bcd(time->tm_sec));\n\tputChar(bind2bcd(time->tm_min));\n\tputChar(bind2bcd(time->tm_hour));\n\tputChar(bind2bcd(0x00));\n\tputChar(bind2bcd(time->tm_mday));\n\tputChar(bind2bcd(time->tm_mon));\n\tputChar(bind2bcd(time->tm_year - 2000));\n\tendTransmission();\n\tprintf(\"Ended transmission.\\n\");\n\n\tuint8_t statreg = read_i2c_register(address, DS3231_STATUSREG);\n\tprintf(\"Read status reg.\\n\");\n\tstatreg &= ~0x80;\n\n\twrite_i2c_register(address, DS3231_STATUSREG, statreg);\n\tprintf(\"Done.\\n\");\n}\n\n\/* Sets the interval for alarm 1 *\/\nvoid DS3231::setAlarmInterval(struct tm * time, WMDay wm){\n\n\tuint8_t seconds = bind2bcd(time->tm_sec);\n\tuint8_t minutes = bind2bcd(time->tm_min);\n\tuint8_t hours = bind2bcd(time->tm_hour);\n\tuint8_t wmday = (wm == weekDay) ? bind2bcd(time->tm_wday) : bind2bcd(time->tm_mday);\n\n\t\/\/ Every second\n\tif( (time->tm_sec == 1 || time->tm_sec == 0 ) &&\n\t\ttime->tm_min == 0 && time->tm_hour == 0 && time->tm_wday){\n\t\t\tseconds |= _BV(7);\n\t\t\tminutes |= _BV(7);\n\t\t\thours |= _BV(7);\n\t\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t \/* Every few seconds *\/\n\telse if(time->tm_min == 0 && time->tm_hour == 0 &&\n\t\t\ttime->tm_wday == 0){\n\t\tminutes |= _BV(7);\n\t\thours |= _BV(7);\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* When minutes and second match *\/\n\telse if (time->tm_hour == 0 && time->tm_wday == 0){\n\t\thours |= _BV(7);\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* When hours, minutes and seconds match *\/\n\telse if((wm == weekDay && time->tm_wday == 0) ||\n\t\t\t(wm == dayOfMonth && time->tm_mday == 0)){\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* Specific time (D\/H\/M\/S != 0) *\/\n\telse {\n\t\t\/\/ set dy\/dt (weekday \/ day of month)\n\t\twmday |= (wm == weekDay) ? 0 : _BV(6);\n\t}\n\n\t\/\/ Write alarm time to RTC (starting at alarm 1 address 0x07\n\tuint8_t alarm1_addr = 0x07;\n\tbeginWrite(address);\n\tputChar(alarm1_addr++);\n\tputChar(seconds);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputchar(alarm1_addr++);\n\tputChar(minutes);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputChar(alarm1_addr++);\n\tputChar(hours);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputChar(alarm1_addr);\n\tputChar(wmday);\n\tendTransmission();\n\n}\n\nstruct tm * DS3231::getTime(){\n\tprintf(\"Sending the command to get the time. \\n\");\n\tbeginWrite(address);\n\tputChar(0b0000);\n\tendTransmission();\n\n\tprintf(\"Getting time now..\\n\");\n\tsys_time_strc.tm_sec = bcd2bin(beginReadFirstByte(address) & 0x7F);\n\tsys_time_strc.tm_min = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_hour = bcd2bin((uint8_t)getChar());\n\tgetChar();\n\tsys_time_strc.tm_mday = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_mon = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_year = bcd2bin((uint16_t)getChar()) + 2000;\n\tprintf(\"Order:\\ns:\\t%d\\nmin:\\t%d\\nh:\\t%d\\nd:\\t%d\\nmon:\\t%d\\ny:\\t%d\\n\",\n\t\t\tsys_time_strc.tm_sec, sys_time_strc.tm_min, sys_time_strc.tm_hour,\n\t\t\tsys_time_strc.tm_mday, sys_time_strc.tm_mon, sys_time_strc.tm_year);\n\tendTransmission();\n\n\tprintf(\"Done.\\n\");\n\treturn &sys_time_strc;\n}\n\nvoid setAlarm(){\n\n}\n\nDS3231::~DS3231() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\n<commit_msg>Testing with SSH key..<commit_after>\/*\n * DS3231.cpp\n *\n * Created on: Feb 16, 2016\n * Author: leo\n *\/\n\n#include \"DS3231.h\"\n#include \"TWI.h\"\n#include <stdio.h>\n#include <util\/delay.h>\n\nDS3231::DS3231() : TWI() {\n\tsystem_time = 0;\n\taddress = 0x00;\n}\n\nDS3231::DS3231(TWI_Data * twi_d, uint8_t address) : TWI(twi_d){\n\tsystem_time = 0;\n\tthis->address = address;\n}\n\n\/\/ TODO: using interrupts to update system clock internally\nDS3231::DS3231(TWI_Data * twi_d, uint8_t address, bool high_update_frequency){\n\n\tif(high_update_frequency){\n\t\t\/\/TODO: get system time and setup interrupts\n\t\tthis->address = address;\n\t\tsystem_time = 0;\n\t} else {\n\t\tDS3231(twi_d, address);\n\t\tsystem_time = 0;\n\t}\n}\n\nstatic uint8_t bind2bcd(uint8_t val) { return val + 6 * (val \/ 10); }\nstatic uint8_t bcd2bin (uint8_t val) { return val - 6 * (val >> 4); }\n\nuint8_t DS3231::read_i2c_register(uint8_t addr, uint8_t reg) {\n\n\tprintf(\"reading i2c register.\\n\");\n\tbeginWrite(addr);\n\tprintf(\"lets go....\\n\");\n\tuint8_t reg_val = 0;;\n\tprintf(\"about to write a char\");\n\tputChar(reg);\n\tprintf(\"wrote a char\");\n\tendTransmission();\n\n\treg_val = beginReadFirstByte(addr);\n\t\/\/reg_val = getChar();\n\tendTransmission();\n\n\treturn reg_val;\n}\n\nvoid DS3231::write_i2c_register(uint8_t addr, uint8_t reg, uint8_t val) {\n\tprintf(\"About to write staus reg..\\n\");\n\tbeginWrite(addr);\n\tprintf(\"About to actually write staus reg..\\n\");\n\tputChar(reg);\n\tprintf(\"Writing status reg value\\n\");\n\tputChar(val);\n\tprintf(\"Finishing..\\n\");\n\tendTransmission();\n}\n\nvoid DS3231::setTime(struct tm * time){\n\tbeginWrite(address);\n\tputChar(0x00);\n\tprintf(\"Order:\\ns:\\t%d\\nmin:\\t%d\\nh:\\t%d\\nd:\\t%d\\nmon:\\t%d\\ny:\\t%d\\n\",\n\t\t\t\ttime->tm_sec, time->tm_min, time->tm_hour,\n\t\t\t\ttime->tm_mday, time->tm_mon, time->tm_year);\n\tputChar(bind2bcd(time->tm_sec));\n\tputChar(bind2bcd(time->tm_min));\n\tputChar(bind2bcd(time->tm_hour));\n\tputChar(bind2bcd(0x00));\n\tputChar(bind2bcd(time->tm_mday));\n\tputChar(bind2bcd(time->tm_mon));\n\tputChar(bind2bcd(time->tm_year - 2000));\n\tendTransmission();\n\tprintf(\"Ended transmission.\\n\");\n\n\tuint8_t statreg = read_i2c_register(address, DS3231_STATUSREG);\n\tprintf(\"Read status reg.\\n\");\n\tstatreg &= ~0x80;\n\n\twrite_i2c_register(address, DS3231_STATUSREG, statreg);\n\tprintf(\"Done.\\n\");\n}\n\n\/*\n * Alarm configs\n * * once per second\n * * when seconds match (ie on the nth second?) - may have to increment seconds for an interval\n * * when minutes and seconds match (eg 2m 30s on this hour)\n * * when hours, minutes and seconds match (eg 4:30:00 PM every day)\n * * When date, hours, minutes and seconds match (eg 12th of each month, 3:30:00PM)\n * * when day, hours, minutes and seconds match (eg every Monday, 4:15:00PM)\n *\/\n\n\/\/ TODO: set alarm manually\n\n\/* Sets the interval for alarm 1 *\/\nvoid DS3231::setAlarmInterval(struct tm * time, WMDay wm){\n\n\tuint8_t seconds = bind2bcd(time->tm_sec);\n\tuint8_t minutes = bind2bcd(time->tm_min);\n\tuint8_t hours = bind2bcd(time->tm_hour);\n\tuint8_t wmday = (wm == weekDay) ? bind2bcd(time->tm_wday) : bind2bcd(time->tm_mday);\n\n\t\/\/ Every second\n\tif( (time->tm_sec == 1 || time->tm_sec == 0 ) &&\n\t\ttime->tm_min == 0 && time->tm_hour == 0 && time->tm_wday){\n\t\t\tprintf(\"Setting alarm for every 1 second..\");\n\t\t\tseconds |= _BV(7);\n\t\t\tminutes |= _BV(7);\n\t\t\thours |= _BV(7);\n\t\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t \/* Every few seconds *\/\n\telse if(time->tm_min == 0 && time->tm_hour == 0 &&\n\t\t\ttime->tm_wday == 0){\n\t\tprintf(\"Setting alarm for every %d seconds..\", time->tm_min);\n\t\tminutes |= _BV(7);\n\t\thours |= _BV(7);\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* When minutes and second match *\/\n\telse if (time->tm_hour == 0 && time->tm_wday == 0){\n\t\tprintf(\"Setting alarm for every %d mins and %d seconds..\", time->tm_sec, time->tm_min);\n\t\thours |= _BV(7);\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* When hours, minutes and seconds match *\/\n\telse if((wm == weekDay && time->tm_wday == 0) ||\n\t\t\t(wm == dayOfMonth && time->tm_mday == 0)){\n\t\tprintf(\"Setting alarm for every %d hours, %d mins and %d seconds..\", time->tm_hour, time->tm_min, time->tm_sec);\n\t\twmday |= (wm == weekDay) ? _BV(7) : _BV(6) + _BV(7);\n\t}\n\n\t\/* Specific time (D & H & M & S != 0) *\/\n\telse {\n\t\tprintf(\"Setting alarm for every %d days, %d hours, %d mins and %d seconds..\", wmday, time->tm_hour, time->tm_min, time->tm_sec);\n\t\t\/\/ set dy\/dt (weekday \/ day of month)\n\t\twmday |= (wm == weekDay) ? 0 : _BV(6);\n\t}\n\n\t\/\/ Write alarm time to RTC (starting at alarm 1 address 0x07\n\tuint8_t alarm1_addr = 0x07;\n\tbeginWrite(address);\n\tputChar(alarm1_addr++);\n\tputChar(seconds);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputchar(alarm1_addr++);\n\tputChar(minutes);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputChar(alarm1_addr++);\n\tputChar(hours);\n\tendTransmission();\n\n\tbeginWrite(address);\n\tputChar(alarm1_addr);\n\tputChar(wmday);\n\tendTransmission();\n\n}\n\nstruct tm * DS3231::getTime(){\n\tprintf(\"Sending the command to get the time. \\n\");\n\tbeginWrite(address);\n\tputChar(0b0000);\n\tendTransmission();\n\n\tprintf(\"Getting time now..\\n\");\n\tsys_time_strc.tm_sec = bcd2bin(beginReadFirstByte(address) & 0x7F);\n\tsys_time_strc.tm_min = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_hour = bcd2bin((uint8_t)getChar());\n\tgetChar();\n\tsys_time_strc.tm_mday = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_mon = bcd2bin((uint8_t)getChar());\n\tsys_time_strc.tm_year = bcd2bin((uint16_t)getChar()) + 2000;\n\tprintf(\"Order:\\ns:\\t%d\\nmin:\\t%d\\nh:\\t%d\\nd:\\t%d\\nmon:\\t%d\\ny:\\t%d\\n\",\n\t\t\tsys_time_strc.tm_sec, sys_time_strc.tm_min, sys_time_strc.tm_hour,\n\t\t\tsys_time_strc.tm_mday, sys_time_strc.tm_mon, sys_time_strc.tm_year);\n\tendTransmission();\n\n\tprintf(\"Done.\\n\");\n\treturn &sys_time_strc;\n}\n\nvoid setAlarm(){\n\n}\n\nDS3231::~DS3231() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n\n#include <iostream>\n#include <deque>\n\n#include \"twpath.h\"\n#include \"vehicle.h\"\n\nstd::deque<int> Vehicle::getpath() {\n std::deque<int> p;\n p = path.getpath();\n p.push_front(getdepot().getnid());\n p.push_back(getdumpsite().getnid());\n p.push_back(getdepot().getnid());\n return p;\n}\n\nvoid Vehicle::push_back(Trashnode node) {\n path.push_back(node, getmaxcapacity());\n evalLast();\n}\n\n\nvoid Vehicle::push_front(Trashnode node) {\n \/\/ position 0 is the depot we can not put a node before that\n path.insert(node, 1, getmaxcapacity());\n evalLast();\n}\n\n\n\nvoid Vehicle::insert(Trashnode node, int at) {\n path.insert(node, at, getmaxcapacity());\n evalLast();\n}\n\n\/*\nvoid Vehicle::evaluate() {\n path.evaluate(getmaxcapacity());\n};\n*\/\n\nvoid Vehicle::evalLast() {\n Trashnode last = path[path.size()-1];\n dumpsite.setdemand(-last.getcargo());\n dumpsite.evaluate(last, getmaxcapacity());\n backToDepot.evaluate(dumpsite, getmaxcapacity());\n cost = w1*backToDepot.gettotDist() +\n w2*backToDepot.getcvTot() +\n w3*backToDepot.gettwvTot();\n}\n\n\/*\nvoid Vehicle::evaluate(int from) {\n evaluate(path.size()-1);\n}\n*\/\n\n\n\/*\nvoid Vehicle::evaluate() {\n curcapacity = 0;\n duration = 0;\n cost = 0;\n TWV = 0;\n CV = 0;\n\n if (path.size()) {\n for (int i=0; i<path.size(); i++) {\n if (i == 0)\n duration += distancetodepot(i);\n else\n duration += path[i].distance(path[i-1]);\n\n if (path[i].earlyarrival(duration))\n duration = path[i].opens();\n\n if (path[i].latearrival(duration)) \n TWV++;\n\n duration += path[i].getservicetime();\n\n curcapacity += path[i].getdemand();\n if (curcapacity > getmaxcapacity())\n CV++;\n }\n\n duration += getdumpsite().distance(path.back());\n\n if (getdumpsite().earlyarrival(duration))\n duration = getdumpsite().opens();\n\n if (getdumpsite().latearrival(duration))\n TWV++;\n\n duration += getdumpsite().getservicetime();\n\n duration += getdumpsite().distance(getdepot());\n if (getdepot().latearrival(duration))\n TWV++;\n\n }\n cost = w1*duration + w2*TWV +w3*CV;\n}\n*\/\n\nvoid Vehicle::dump() {\n std::cout << \"---------- Vehicle ---------------\" << std::endl;\n std::cout << \"maxcapacity: \" << getmaxcapacity() << std::endl;\n std::cout << \"curcapacity: \" << getcurcapacity() << std::endl;\n std::cout << \"duration: \" << getduration() << std::endl;\n std::cout << \"cost: \" << getcost() << std::endl;\n std::cout << \"TWV: \" << getTWV() << std::endl;\n std::cout << \"CV: \" << getCV() << std::endl;\n std::cout << \"w1: \" << getw1() << std::endl;\n std::cout << \"w2: \" << getw2() << std::endl;\n std::cout << \"w3: \" << getw3() << std::endl;\n std::cout << \"path nodes: -----------------\" << std::endl;\n path.dump();\n std::cout << \"--------- dumpeval ----------\" << std::endl;\n for (int i=0;i<path.size();i++){\n std::cout<<\"\\npath stop #:\"<<i<<\"\\n\";\n path[i].dumpeval();\n }\n std::cout<<\"\\ndumpsite:\"<<\"\\n\";\n dumpsite.dumpeval();\n std::cout<<\"\\nBack to depot:\"<<\"\\n\";\n backToDepot.dumpeval();\n std::cout <<\"TOTAL COST=\"<<cost <<\"\\n\";\n}\n\n\nvoid Vehicle::dumppath() {\n path.dump();\n}\n\n\n\n<commit_msg>fixes to Vehicle::push_front and Vehicle::insert to correct the auto evaluation issues.<commit_after>\n\n#include <iostream>\n#include <deque>\n\n#include \"twpath.h\"\n#include \"vehicle.h\"\n\nstd::deque<int> Vehicle::getpath() {\n std::deque<int> p;\n p = path.getpath();\n p.push_front(getdepot().getnid());\n p.push_back(getdumpsite().getnid());\n p.push_back(getdepot().getnid());\n return p;\n}\n\n\nvoid Vehicle::push_back(Trashnode node) {\n path.push_back(node, getmaxcapacity());\n evalLast();\n}\n\n\nvoid Vehicle::push_front(Trashnode node) {\n \/\/ position 0 is the depot we can not put a node before that\n path.insert(node, 1, getmaxcapacity());\n path.evaluate(1, getmaxcapacity());\n evalLast();\n}\n\n\nvoid Vehicle::insert(Trashnode node, int at) {\n path.insert(node, at, getmaxcapacity());\n path.evaluate(at, getmaxcapacity());\n evalLast();\n}\n\n\nvoid Vehicle::evalLast() {\n Trashnode last = path[path.size()-1];\n dumpsite.setdemand(-last.getcargo());\n dumpsite.evaluate(last, getmaxcapacity());\n backToDepot.evaluate(dumpsite, getmaxcapacity());\n cost = w1*backToDepot.gettotDist() +\n w2*backToDepot.getcvTot() +\n w3*backToDepot.gettwvTot();\n}\n\n\n\/*\n\/\/ this is the old code before we started using Tweval\nvoid Vehicle::evaluate() {\n curcapacity = 0;\n duration = 0;\n cost = 0;\n TWV = 0;\n CV = 0;\n\n if (path.size()) {\n for (int i=0; i<path.size(); i++) {\n if (i == 0)\n duration += distancetodepot(i);\n else\n duration += path[i].distance(path[i-1]);\n\n if (path[i].earlyarrival(duration))\n duration = path[i].opens();\n\n if (path[i].latearrival(duration)) \n TWV++;\n\n duration += path[i].getservicetime();\n\n curcapacity += path[i].getdemand();\n if (curcapacity > getmaxcapacity())\n CV++;\n }\n\n duration += getdumpsite().distance(path.back());\n\n if (getdumpsite().earlyarrival(duration))\n duration = getdumpsite().opens();\n\n if (getdumpsite().latearrival(duration))\n TWV++;\n\n duration += getdumpsite().getservicetime();\n\n duration += getdumpsite().distance(getdepot());\n if (getdepot().latearrival(duration))\n TWV++;\n\n }\n cost = w1*duration + w2*TWV +w3*CV;\n}\n*\/\n\nvoid Vehicle::dump() {\n std::cout << \"---------- Vehicle ---------------\" << std::endl;\n std::cout << \"maxcapacity: \" << getmaxcapacity() << std::endl;\n std::cout << \"curcapacity: \" << getcurcapacity() << std::endl;\n std::cout << \"duration: \" << getduration() << std::endl;\n std::cout << \"cost: \" << getcost() << std::endl;\n std::cout << \"TWV: \" << getTWV() << std::endl;\n std::cout << \"CV: \" << getCV() << std::endl;\n std::cout << \"w1: \" << getw1() << std::endl;\n std::cout << \"w2: \" << getw2() << std::endl;\n std::cout << \"w3: \" << getw3() << std::endl;\n std::cout << \"path nodes: -----------------\" << std::endl;\n path.dump();\n std::cout << \"--------- dumpeval ----------\" << std::endl;\n for (int i=0;i<path.size();i++){\n std::cout<<\"\\npath stop #:\"<<i<<\"\\n\";\n path[i].dumpeval();\n }\n std::cout<<\"\\ndumpsite:\"<<\"\\n\";\n dumpsite.dumpeval();\n std::cout<<\"\\nBack to depot:\"<<\"\\n\";\n backToDepot.dumpeval();\n std::cout <<\"TOTAL COST=\"<<cost <<\"\\n\";\n}\n\n\nvoid Vehicle::dumppath() {\n path.dump();\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2014 CyberTech Labs Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n\n#include \"backgroundWidget.h\"\n\n#if QT_VERSION < QT_VERSION_CHECK(5, 0, 0)\n\t#include <QtGui\/QApplication>\n#else\n\t#include <QtWidgets\/QApplication>\n#endif\n\n#include \"lazyMainWidget.h\"\n#include \"lazyMainWidgetWrapper.h\"\n#include <QScreen>\n\nusing namespace trikGui;\n\nBackgroundWidget::BackgroundWidget(\n\t\tconst QString &configPath\n\t\t, QWidget *parent)\n\t: QWidget(parent)\n\t, mController(configPath)\n\t, mBatteryIndicator(mController.brick())\n\t, mWiFiIndicator(mController)\n\t, mGamepadIndicator(mController)\n\t, mMailboxIndicator(\":\/\/resources\/mailboxConnected.png\", mController.mailbox()->isConnected())\n\t, mCommunicatorIndicator(\":\/\/resources\/communicatorConnected.png\", mController.communicatorConnectionStatus())\n\t, mStartWidget(mController)\n\t, mRunningWidget(mController)\n{\n\tsetFixedSize(qApp->primaryScreen()->availableSize());\n\tmMainLayout.setSpacing(10);\n\n\tmBatteryIndicator.setStyleSheet(\"font: 12px\");\n\n\tmStatusBarLayout.addWidget(&mBatteryIndicator);\n\tmStatusBarLayout.addStretch();\n\tmStatusBarLayout.addWidget(&mGamepadIndicator);\n\tmStatusBarLayout.addWidget(&mMailboxIndicator);\n\tmStatusBarLayout.addWidget(&mCommunicatorIndicator);\n\tmStatusBarLayout.addWidget(&mWiFiIndicator);\n\taddMainWidget(mStartWidget);\n\tmBrickDisplayWidgetWrapper.reset(new LazyMainWidgetWrapper(mController.brick().graphicsWidget()));\n\taddLazyWidget(*mBrickDisplayWidgetWrapper);\n\tmMainWidgetsLayout.addWidget(&mRunningWidget);\n\n\tmMainLayout.setContentsMargins(mDefaultMargins);\n\tmMainLayout.addLayout(&mStatusBarLayout);\n\tmMainLayout.addLayout(&mMainWidgetsLayout);\n\n\tsetLayout(&mMainLayout);\n\n\tconnect(&mMainWidgetsLayout, SIGNAL(currentChanged(int)), this, SLOT(renewFocus()));\n\tconnect(&mMainWidgetsLayout, SIGNAL(widgetRemoved(int)), this, SLOT(updateStack(int)));\n\n\tconnect(&mController, SIGNAL(brickStopped()), this, SLOT(refresh()));\n\tconnect(&mController, SIGNAL(showRunningWidget(QString, int)), this, SLOT(showRunningWidget(QString, int)));\n\tconnect(&mController, SIGNAL(showError(QString, int)), this, SLOT(showError(QString, int)));\n\tconnect(&mController, SIGNAL(hideRunningWidget(int)), this, SLOT(hideRunningWidget(int)));\n\tconnect(&mController, SIGNAL(hideGraphicsWidget()), this, SLOT(hideGraphicsWidget()));\n\tconnect(&mController, SIGNAL(hideScriptWidgets()), this, SLOT(hideScriptWidgets()));\n\n\tconnect(&mController, SIGNAL(communicatorStatusChanged(bool)), &mCommunicatorIndicator, SLOT(changeStatus(bool)));\n\tconnect(&mController, SIGNAL(mailboxStatusChanged(bool)), &mMailboxIndicator, SLOT(changeStatus(bool)));\n\n\tconnect(&mRunningWidget, SIGNAL(hideMe(int)), this, SLOT(hideRunningWidget(int)));\n}\n\nBackgroundWidget::~BackgroundWidget()\n{\n\t\/\/ Disconnect is needed here because QWidget destructor will trigger widgetRemoved signal which will be caught\n\t\/\/ here by partially deleted object and everything will crash.\n\tdisconnect(&mMainWidgetsLayout, 0, 0, 0);\n}\n\nvoid BackgroundWidget::resetWidgetLayout(MainWidget &widget)\n{\n\t\/\/ If the widget has layout, remove its margins because main widgets layout has its own margins.\n\tQLayout *layout = widget.layout();\n\tif (layout != nullptr) {\n\t\tlayout->setContentsMargins(0, 0, 0, 0);\n\t}\n}\n\nvoid BackgroundWidget::addMainWidget(MainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\n\tmMainWidgetIndex.push(mMainWidgetsLayout.addWidget(&widget));\n\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\n\tconnect(&widget, SIGNAL(newWidget(MainWidget &)), this, SLOT(addMainWidget(MainWidget &)));\n}\n\nvoid BackgroundWidget::addRunningWidget(MainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\tmMainWidgetsLayout.addWidget(&widget);\n}\n\nvoid BackgroundWidget::addLazyWidget(LazyMainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\tmMainWidgetsLayout.addWidget(&widget);\n\n\tconnect(&widget, SIGNAL(showMe(MainWidget &)), this, SLOT(showMainWidget(MainWidget &)));\n\tconnect(&widget, SIGNAL(hideMe()), this, SLOT(hideGraphicsWidget()));\n}\n\nvoid BackgroundWidget::showMainWidget(MainWidget &widget)\n{\n\tif (&widget == mBrickDisplayWidgetWrapper.data()) {\n\t\texpandMainWidget();\n\t}\n\n\tconst int index = mMainWidgetsLayout.indexOf(&widget);\n\tif (index >= 0) {\n\t\tmMainWidgetsLayout.setCurrentIndex(index);\n\t}\n}\n\nvoid BackgroundWidget::showRunningWidget(const QString &fileName, int scriptId)\n{\n\tmRunningWidget.setProgram(fileName, scriptId);\n\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\tmRunningWidget.grabKeyboard();\n}\n\nvoid BackgroundWidget::hideRunningWidget(int scriptId)\n{\n\tif (mRunningWidget.scriptId() == scriptId) {\n\t\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\t\tmRunningWidget.releaseKeyboard();\n\t}\n}\n\nvoid BackgroundWidget::showError(const QString &error, int scriptId)\n{\n\tif (mRunningWidget.scriptId() == scriptId) {\n\t\tmRunningWidget.showError(error, scriptId);\n\t\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\t}\n}\n\nvoid BackgroundWidget::hideGraphicsWidget()\n{\n\tif (mMainWidgetsLayout.currentWidget() == mBrickDisplayWidgetWrapper.data()) {\n\t\tunexpandMainWidget();\n\t\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\t}\n}\n\nvoid BackgroundWidget::hideScriptWidgets()\n{\n\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\tmRunningWidget.releaseKeyboard();\n}\n\nvoid BackgroundWidget::renewFocus()\n{\n\t\/\/ When current widget in main widgets layout changed, we should set focus properly.\n\n\tMainWidget *currentWidget = dynamic_cast<MainWidget *>(mMainWidgetsLayout.currentWidget());\n\n\tif (currentWidget != nullptr) {\n\t\tcurrentWidget->renewFocus();\n\t}\n}\n\nvoid BackgroundWidget::refresh()\n{\n\tfor (const auto widget : QApplication::allWidgets()) {\n\t\twidget->update();\n\t}\n}\n\nvoid BackgroundWidget::updateStack(int removedWidget)\n{\n\tif (mMainWidgetIndex.top() == removedWidget) {\n\t\tmMainWidgetIndex.pop();\n\t\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\t}\n}\n\nvoid BackgroundWidget::expandMainWidget()\n{\n\tmMainLayout.setContentsMargins(0, 0, 0, 0);\n\tQMargins margins = mDefaultMargins;\n\tmargins.setBottom(0);\n\tmStatusBarLayout.setContentsMargins(margins);\n}\n\nvoid BackgroundWidget::unexpandMainWidget()\n{\n\tmMainLayout.setContentsMargins(mDefaultMargins);\n\tmStatusBarLayout.setContentsMargins(0, 0, 0, 0);\n}\n<commit_msg>fixed SIGNAL\/SLOT to &method<commit_after>\/* Copyright 2014 CyberTech Labs Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License. *\/\n\n#include \"backgroundWidget.h\"\n\n#if QT_VERSION < QT_VERSION_CHECK(5, 0, 0)\n\t#include <QtGui\/QApplication>\n#else\n\t#include <QtWidgets\/QApplication>\n#endif\n\n#include \"lazyMainWidget.h\"\n#include \"lazyMainWidgetWrapper.h\"\n#include <QScreen>\n\nusing namespace trikGui;\n\nBackgroundWidget::BackgroundWidget(\n\t\tconst QString &configPath\n\t\t, QWidget *parent)\n\t: QWidget(parent)\n\t, mController(configPath)\n\t, mBatteryIndicator(mController.brick())\n\t, mWiFiIndicator(mController)\n\t, mGamepadIndicator(mController)\n\t, mMailboxIndicator(\":\/\/resources\/mailboxConnected.png\", mController.mailbox()->isConnected())\n\t, mCommunicatorIndicator(\":\/\/resources\/communicatorConnected.png\", mController.communicatorConnectionStatus())\n\t, mStartWidget(mController)\n\t, mRunningWidget(mController)\n{\n\tsetFixedSize(qApp->primaryScreen()->availableSize());\n\tmMainLayout.setSpacing(10);\n\n\tmBatteryIndicator.setStyleSheet(\"font: 12px\");\n\n\tmStatusBarLayout.addWidget(&mBatteryIndicator);\n\tmStatusBarLayout.addStretch();\n\tmStatusBarLayout.addWidget(&mGamepadIndicator);\n\tmStatusBarLayout.addWidget(&mMailboxIndicator);\n\tmStatusBarLayout.addWidget(&mCommunicatorIndicator);\n\tmStatusBarLayout.addWidget(&mWiFiIndicator);\n\taddMainWidget(mStartWidget);\n\tmBrickDisplayWidgetWrapper.reset(new LazyMainWidgetWrapper(mController.brick().graphicsWidget()));\n\taddLazyWidget(*mBrickDisplayWidgetWrapper);\n\tmMainWidgetsLayout.addWidget(&mRunningWidget);\n\n\tmMainLayout.setContentsMargins(mDefaultMargins);\n\tmMainLayout.addLayout(&mStatusBarLayout);\n\tmMainLayout.addLayout(&mMainWidgetsLayout);\n\n\tsetLayout(&mMainLayout);\n\n\tconnect(&mMainWidgetsLayout, &QStackedLayout::currentChanged, this, &BackgroundWidget::renewFocus);\n\tconnect(&mMainWidgetsLayout, &QStackedLayout::widgetRemoved, this, &BackgroundWidget::updateStack);\n\n\tconnect(&mController, &Controller::brickStopped, this, &BackgroundWidget::refresh);\n\tconnect(&mController, &Controller::showRunningWidget, this, &BackgroundWidget::showRunningWidget);\n\tconnect(&mController, &Controller::showError, this, &BackgroundWidget::showError);\n\tconnect(&mController, &Controller::hideRunningWidget, this, &BackgroundWidget::hideRunningWidget);\n\tconnect(&mController, &Controller::hideGraphicsWidget, this, &BackgroundWidget::hideGraphicsWidget);\n\tconnect(&mController, &Controller::hideScriptWidgets, this, &BackgroundWidget::hideScriptWidgets);\n\tconnect(&mController, &Controller::communicatorStatusChanged, &mCommunicatorIndicator, &OpenSocketIndicator::changeStatus);\n\tconnect(&mController, &Controller::mailboxStatusChanged, &mMailboxIndicator, &OpenSocketIndicator::changeStatus);\n\n\tconnect(&mRunningWidget, &RunningWidget::hideMe, this, &BackgroundWidget::hideRunningWidget);\n}\n\nBackgroundWidget::~BackgroundWidget()\n{\n\t\/\/ Disconnect is needed here because QWidget destructor will trigger widgetRemoved signal which will be caught\n\t\/\/ here by partially deleted object and everything will crash.\n\tdisconnect(&mMainWidgetsLayout, 0, 0, 0);\n}\n\nvoid BackgroundWidget::resetWidgetLayout(MainWidget &widget)\n{\n\t\/\/ If the widget has layout, remove its margins because main widgets layout has its own margins.\n\tQLayout *layout = widget.layout();\n\tif (layout != nullptr) {\n\t\tlayout->setContentsMargins(0, 0, 0, 0);\n\t}\n}\n\nvoid BackgroundWidget::addMainWidget(MainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\n\tmMainWidgetIndex.push(mMainWidgetsLayout.addWidget(&widget));\n\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\n\tconnect(&widget, &MainWidget::newWidget, this, &BackgroundWidget::addMainWidget);\n}\n\nvoid BackgroundWidget::addRunningWidget(MainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\tmMainWidgetsLayout.addWidget(&widget);\n}\n\nvoid BackgroundWidget::addLazyWidget(LazyMainWidget &widget)\n{\n\tresetWidgetLayout(widget);\n\tmMainWidgetsLayout.addWidget(&widget);\n\n\tconnect(&widget, &LazyMainWidget::showMe, this, &BackgroundWidget::showMainWidget);\n\tconnect(&widget, &LazyMainWidget::hideMe, this, &BackgroundWidget::hideGraphicsWidget);\n}\n\nvoid BackgroundWidget::showMainWidget(MainWidget &widget)\n{\n\tif (&widget == mBrickDisplayWidgetWrapper.data()) {\n\t\texpandMainWidget();\n\t}\n\n\tconst int index = mMainWidgetsLayout.indexOf(&widget);\n\tif (index >= 0) {\n\t\tmMainWidgetsLayout.setCurrentIndex(index);\n\t}\n}\n\nvoid BackgroundWidget::showRunningWidget(const QString &fileName, int scriptId)\n{\n\tmRunningWidget.setProgram(fileName, scriptId);\n\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\tmRunningWidget.grabKeyboard();\n}\n\nvoid BackgroundWidget::hideRunningWidget(int scriptId)\n{\n\tif (mRunningWidget.scriptId() == scriptId) {\n\t\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\t\tmRunningWidget.releaseKeyboard();\n\t}\n}\n\nvoid BackgroundWidget::showError(const QString &error, int scriptId)\n{\n\tif (mRunningWidget.scriptId() == scriptId) {\n\t\tmRunningWidget.showError(error, scriptId);\n\t\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\t}\n}\n\nvoid BackgroundWidget::hideGraphicsWidget()\n{\n\tif (mMainWidgetsLayout.currentWidget() == mBrickDisplayWidgetWrapper.data()) {\n\t\tunexpandMainWidget();\n\t\tmMainWidgetsLayout.setCurrentWidget(&mRunningWidget);\n\t}\n}\n\nvoid BackgroundWidget::hideScriptWidgets()\n{\n\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\tmRunningWidget.releaseKeyboard();\n}\n\nvoid BackgroundWidget::renewFocus()\n{\n\t\/\/ When current widget in main widgets layout changed, we should set focus properly.\n\n\tMainWidget *currentWidget = dynamic_cast<MainWidget *>(mMainWidgetsLayout.currentWidget());\n\n\tif (currentWidget != nullptr) {\n\t\tcurrentWidget->renewFocus();\n\t}\n}\n\nvoid BackgroundWidget::refresh()\n{\n\tfor (const auto widget : QApplication::allWidgets()) {\n\t\twidget->update();\n\t}\n}\n\nvoid BackgroundWidget::updateStack(int removedWidget)\n{\n\tif (mMainWidgetIndex.top() == removedWidget) {\n\t\tmMainWidgetIndex.pop();\n\t\tmMainWidgetsLayout.setCurrentIndex(mMainWidgetIndex.top());\n\t}\n}\n\nvoid BackgroundWidget::expandMainWidget()\n{\n\tmMainLayout.setContentsMargins(0, 0, 0, 0);\n\tQMargins margins = mDefaultMargins;\n\tmargins.setBottom(0);\n\tmStatusBarLayout.setContentsMargins(margins);\n}\n\nvoid BackgroundWidget::unexpandMainWidget()\n{\n\tmMainLayout.setContentsMargins(mDefaultMargins);\n\tmStatusBarLayout.setContentsMargins(0, 0, 0, 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_spectrum\n\/\/\/ \\notebook\n\/\/\/\n\/\/\/ This macro fits the source spectrum using the AWMI algorithm\n\/\/\/ from the \"TSpectrumFit\" class (\"TSpectrum\" class is used to find peaks).\n\/\/\/\n\/\/\/ To try this macro, in a ROOT (5 or 6) prompt, do:\n\/\/\/\n\/\/\/ ~~~{.cpp}\n\/\/\/ root > .x FitAwmi.C\n\/\/\/ ~~~\n\/\/\/\n\/\/\/ or:\n\/\/\/\n\/\/\/ ~~~{.cpp}\n\/\/\/ root > .x FitAwmi.C++\n\/\/\/ root > FitAwmi(); \/\/ re-run with another random set of peaks\n\/\/\/ ~~~\n\/\/\/\n\/\/\/ \\macro_image\n\/\/\/ \\macro_output\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\author Silesius Anonymus\n\n#include \"TROOT.h\"\n#include \"TMath.h\"\n#include \"TRandom.h\"\n#include \"TH1.h\"\n#include \"TF1.h\"\n#include \"TCanvas.h\"\n#include \"TSpectrum.h\"\n#include \"TSpectrumFit.h\"\n#include \"TPolyMarker.h\"\n#include \"TList.h\"\n\n#include <iostream>\n\nTH1F *FitAwmi_Create_Spectrum(void) {\n Int_t nbins = 1000;\n Double_t xmin = -10., xmax = 10.;\n delete gROOT->FindObject(\"h\"); \/\/ prevent \"memory leak\"\n TH1F *h = new TH1F(\"h\", \"simulated spectrum\", nbins, xmin, xmax);\n h->SetStats(kFALSE);\n TF1 f(\"f\", \"TMath::Gaus(x, [0], [1], 1)\", xmin, xmax);\n \/\/ f.SetParNames(\"mean\", \"sigma\");\n gRandom->SetSeed(0); \/\/ make it really random\n \/\/ create well separated peaks with exactly known means and areas\n \/\/ note: TSpectrumFit assumes that all peaks have the same sigma\n Double_t sigma = (xmax - xmin) \/ Double_t(nbins) * Int_t(gRandom->Uniform(2., 6.));\n Int_t npeaks = 0;\n while (xmax > (xmin + 6. * sigma)) {\n npeaks++;\n xmin += 3. * sigma; \/\/ \"mean\"\n f.SetParameters(xmin, sigma);\n Double_t area = 1. * Int_t(gRandom->Uniform(1., 11.));\n h->Add(&f, area, \"\"); \/\/ \"\" ... or ... \"I\"\n std::cout << \"created \"\n << xmin << \" \"\n << (area \/ sigma \/ TMath::Sqrt(TMath::TwoPi())) << \" \"\n << area << std::endl;\n xmin += 3. * sigma;\n }\n std::cout << \"the total number of created peaks = \" << npeaks\n << \" with sigma = \" << sigma << std::endl;\n return h;\n}\n\nvoid FitAwmi(void) {\n\n TH1F *h = FitAwmi_Create_Spectrum();\n\n TCanvas *cFit = ((TCanvas *)(gROOT->GetListOfCanvases()->FindObject(\"cFit\")));\n if (!cFit) cFit = new TCanvas(\"cFit\", \"cFit\", 10, 10, 1000, 700);\n else cFit->Clear();\n h->Draw(\"L\");\n Int_t i, nfound, bin;\n Int_t nbins = h->GetNbinsX();\n\n Double_t *source = new Double_t[nbins];\n Double_t *dest = new Double_t[nbins];\n\n for (i = 0; i < nbins; i++) source[i] = h->GetBinContent(i + 1);\n TSpectrum *s = new TSpectrum(); \/\/ note: default maxpositions = 100\n \/\/ searching for candidate peaks positions\n nfound = s->SearchHighRes(source, dest, nbins, 2., 2., kFALSE, 10000, kFALSE, 0);\n \/\/ filling in the initial estimates of the input parameters\n Bool_t *FixPos = new Bool_t[nfound];\n Bool_t *FixAmp = new Bool_t[nfound];\n for(i = 0; i < nfound; i++) FixAmp[i] = FixPos[i] = kFALSE;\n\n Double_t *Pos, *Amp = new Double_t[nfound]; \/\/ ROOT 6\n\n Pos = s->GetPositionX(); \/\/ 0 ... (nbins - 1)\n for (i = 0; i < nfound; i++) {\n bin = 1 + Int_t(Pos[i] + 0.5); \/\/ the \"nearest\" bin\n Amp[i] = h->GetBinContent(bin);\n }\n TSpectrumFit *pfit = new TSpectrumFit(nfound);\n pfit->SetFitParameters(0, (nbins - 1), 1000, 0.1, pfit->kFitOptimChiCounts,\n pfit->kFitAlphaHalving, pfit->kFitPower2,\n pfit->kFitTaylorOrderFirst);\n pfit->SetPeakParameters(2., kFALSE, Pos, FixPos, Amp, FixAmp);\n \/\/ pfit->SetBackgroundParameters(source[0], kFALSE, 0., kFALSE, 0., kFALSE);\n pfit->FitAwmi(source);\n Double_t *Positions = pfit->GetPositions();\n Double_t *PositionsErrors = pfit->GetPositionsErrors();\n Double_t *Amplitudes = pfit->GetAmplitudes();\n Double_t *AmplitudesErrors = pfit->GetAmplitudesErrors();\n Double_t *Areas = pfit->GetAreas();\n Double_t *AreasErrors = pfit->GetAreasErrors();\n delete gROOT->FindObject(\"d\"); \/\/ prevent \"memory leak\"\n TH1F *d = new TH1F(*h); d->SetNameTitle(\"d\", \"\"); d->Reset(\"M\");\n for (i = 0; i < nbins; i++) d->SetBinContent(i + 1, source[i]);\n Double_t x1 = d->GetBinCenter(1), dx = d->GetBinWidth(1);\n Double_t sigma, sigmaErr;\n pfit->GetSigma(sigma, sigmaErr);\n\n \/\/ current TSpectrumFit needs a sqrt(2) correction factor for sigma\n sigma \/= TMath::Sqrt2(); sigmaErr \/= TMath::Sqrt2();\n \/\/ convert \"bin numbers\" into \"x-axis values\"\n sigma *= dx; sigmaErr *= dx;\n\n std::cout << \"the total number of found peaks = \" << nfound\n << \" with sigma = \" << sigma << \" (+-\" << sigmaErr << \")\"\n << std::endl;\n std::cout << \"fit chi^2 = \" << pfit->GetChi() << std::endl;\n for (i = 0; i < nfound; i++) {\n bin = 1 + Int_t(Positions[i] + 0.5); \/\/ the \"nearest\" bin\n Pos[i] = d->GetBinCenter(bin);\n Amp[i] = d->GetBinContent(bin);\n\n \/\/ convert \"bin numbers\" into \"x-axis values\"\n Positions[i] = x1 + Positions[i] * dx;\n PositionsErrors[i] *= dx;\n Areas[i] *= dx;\n AreasErrors[i] *= dx;\n\n std::cout << \"found \"\n << Positions[i] << \" (+-\" << PositionsErrors[i] << \") \"\n << Amplitudes[i] << \" (+-\" << AmplitudesErrors[i] << \") \"\n << Areas[i] << \" (+-\" << AreasErrors[i] << \")\"\n << std::endl;\n }\n d->SetLineColor(kRed); d->SetLineWidth(1);\n d->Draw(\"SAME L\");\n TPolyMarker *pm = ((TPolyMarker*)(h->GetListOfFunctions()->FindObject(\"TPolyMarker\")));\n if (pm) {\n h->GetListOfFunctions()->Remove(pm);\n delete pm;\n }\n pm = new TPolyMarker(nfound, Pos, Amp);\n h->GetListOfFunctions()->Add(pm);\n pm->SetMarkerStyle(23);\n pm->SetMarkerColor(kRed);\n pm->SetMarkerSize(1);\n \/\/ cleanup\n delete pfit;\n delete [] Amp;\n delete [] FixAmp;\n delete [] FixPos;\n delete s;\n delete [] dest;\n delete [] source;\n return;\n}<commit_msg>Wile changed his mind and asked to remove the author name (with was useless anyway as it was anonymous).<commit_after>\/\/\/ \\file\n\/\/\/ \\ingroup tutorial_spectrum\n\/\/\/ \\notebook\n\/\/\/\n\/\/\/ This macro fits the source spectrum using the AWMI algorithm\n\/\/\/ from the \"TSpectrumFit\" class (\"TSpectrum\" class is used to find peaks).\n\/\/\/\n\/\/\/ To try this macro, in a ROOT (5 or 6) prompt, do:\n\/\/\/\n\/\/\/ ~~~{.cpp}\n\/\/\/ root > .x FitAwmi.C\n\/\/\/ ~~~\n\/\/\/\n\/\/\/ or:\n\/\/\/\n\/\/\/ ~~~{.cpp}\n\/\/\/ root > .x FitAwmi.C++\n\/\/\/ root > FitAwmi(); \/\/ re-run with another random set of peaks\n\/\/\/ ~~~\n\/\/\/\n\/\/\/ \\macro_image\n\/\/\/ \\macro_output\n\/\/\/ \\macro_code\n\/\/\/\n\/\/\/ \\author\n\n#include \"TROOT.h\"\n#include \"TMath.h\"\n#include \"TRandom.h\"\n#include \"TH1.h\"\n#include \"TF1.h\"\n#include \"TCanvas.h\"\n#include \"TSpectrum.h\"\n#include \"TSpectrumFit.h\"\n#include \"TPolyMarker.h\"\n#include \"TList.h\"\n\n#include <iostream>\n\nTH1F *FitAwmi_Create_Spectrum(void) {\n Int_t nbins = 1000;\n Double_t xmin = -10., xmax = 10.;\n delete gROOT->FindObject(\"h\"); \/\/ prevent \"memory leak\"\n TH1F *h = new TH1F(\"h\", \"simulated spectrum\", nbins, xmin, xmax);\n h->SetStats(kFALSE);\n TF1 f(\"f\", \"TMath::Gaus(x, [0], [1], 1)\", xmin, xmax);\n \/\/ f.SetParNames(\"mean\", \"sigma\");\n gRandom->SetSeed(0); \/\/ make it really random\n \/\/ create well separated peaks with exactly known means and areas\n \/\/ note: TSpectrumFit assumes that all peaks have the same sigma\n Double_t sigma = (xmax - xmin) \/ Double_t(nbins) * Int_t(gRandom->Uniform(2., 6.));\n Int_t npeaks = 0;\n while (xmax > (xmin + 6. * sigma)) {\n npeaks++;\n xmin += 3. * sigma; \/\/ \"mean\"\n f.SetParameters(xmin, sigma);\n Double_t area = 1. * Int_t(gRandom->Uniform(1., 11.));\n h->Add(&f, area, \"\"); \/\/ \"\" ... or ... \"I\"\n std::cout << \"created \"\n << xmin << \" \"\n << (area \/ sigma \/ TMath::Sqrt(TMath::TwoPi())) << \" \"\n << area << std::endl;\n xmin += 3. * sigma;\n }\n std::cout << \"the total number of created peaks = \" << npeaks\n << \" with sigma = \" << sigma << std::endl;\n return h;\n}\n\nvoid FitAwmi(void) {\n\n TH1F *h = FitAwmi_Create_Spectrum();\n\n TCanvas *cFit = ((TCanvas *)(gROOT->GetListOfCanvases()->FindObject(\"cFit\")));\n if (!cFit) cFit = new TCanvas(\"cFit\", \"cFit\", 10, 10, 1000, 700);\n else cFit->Clear();\n h->Draw(\"L\");\n Int_t i, nfound, bin;\n Int_t nbins = h->GetNbinsX();\n\n Double_t *source = new Double_t[nbins];\n Double_t *dest = new Double_t[nbins];\n\n for (i = 0; i < nbins; i++) source[i] = h->GetBinContent(i + 1);\n TSpectrum *s = new TSpectrum(); \/\/ note: default maxpositions = 100\n \/\/ searching for candidate peaks positions\n nfound = s->SearchHighRes(source, dest, nbins, 2., 2., kFALSE, 10000, kFALSE, 0);\n \/\/ filling in the initial estimates of the input parameters\n Bool_t *FixPos = new Bool_t[nfound];\n Bool_t *FixAmp = new Bool_t[nfound];\n for(i = 0; i < nfound; i++) FixAmp[i] = FixPos[i] = kFALSE;\n\n Double_t *Pos, *Amp = new Double_t[nfound]; \/\/ ROOT 6\n\n Pos = s->GetPositionX(); \/\/ 0 ... (nbins - 1)\n for (i = 0; i < nfound; i++) {\n bin = 1 + Int_t(Pos[i] + 0.5); \/\/ the \"nearest\" bin\n Amp[i] = h->GetBinContent(bin);\n }\n TSpectrumFit *pfit = new TSpectrumFit(nfound);\n pfit->SetFitParameters(0, (nbins - 1), 1000, 0.1, pfit->kFitOptimChiCounts,\n pfit->kFitAlphaHalving, pfit->kFitPower2,\n pfit->kFitTaylorOrderFirst);\n pfit->SetPeakParameters(2., kFALSE, Pos, FixPos, Amp, FixAmp);\n \/\/ pfit->SetBackgroundParameters(source[0], kFALSE, 0., kFALSE, 0., kFALSE);\n pfit->FitAwmi(source);\n Double_t *Positions = pfit->GetPositions();\n Double_t *PositionsErrors = pfit->GetPositionsErrors();\n Double_t *Amplitudes = pfit->GetAmplitudes();\n Double_t *AmplitudesErrors = pfit->GetAmplitudesErrors();\n Double_t *Areas = pfit->GetAreas();\n Double_t *AreasErrors = pfit->GetAreasErrors();\n delete gROOT->FindObject(\"d\"); \/\/ prevent \"memory leak\"\n TH1F *d = new TH1F(*h); d->SetNameTitle(\"d\", \"\"); d->Reset(\"M\");\n for (i = 0; i < nbins; i++) d->SetBinContent(i + 1, source[i]);\n Double_t x1 = d->GetBinCenter(1), dx = d->GetBinWidth(1);\n Double_t sigma, sigmaErr;\n pfit->GetSigma(sigma, sigmaErr);\n\n \/\/ current TSpectrumFit needs a sqrt(2) correction factor for sigma\n sigma \/= TMath::Sqrt2(); sigmaErr \/= TMath::Sqrt2();\n \/\/ convert \"bin numbers\" into \"x-axis values\"\n sigma *= dx; sigmaErr *= dx;\n\n std::cout << \"the total number of found peaks = \" << nfound\n << \" with sigma = \" << sigma << \" (+-\" << sigmaErr << \")\"\n << std::endl;\n std::cout << \"fit chi^2 = \" << pfit->GetChi() << std::endl;\n for (i = 0; i < nfound; i++) {\n bin = 1 + Int_t(Positions[i] + 0.5); \/\/ the \"nearest\" bin\n Pos[i] = d->GetBinCenter(bin);\n Amp[i] = d->GetBinContent(bin);\n\n \/\/ convert \"bin numbers\" into \"x-axis values\"\n Positions[i] = x1 + Positions[i] * dx;\n PositionsErrors[i] *= dx;\n Areas[i] *= dx;\n AreasErrors[i] *= dx;\n\n std::cout << \"found \"\n << Positions[i] << \" (+-\" << PositionsErrors[i] << \") \"\n << Amplitudes[i] << \" (+-\" << AmplitudesErrors[i] << \") \"\n << Areas[i] << \" (+-\" << AreasErrors[i] << \")\"\n << std::endl;\n }\n d->SetLineColor(kRed); d->SetLineWidth(1);\n d->Draw(\"SAME L\");\n TPolyMarker *pm = ((TPolyMarker*)(h->GetListOfFunctions()->FindObject(\"TPolyMarker\")));\n if (pm) {\n h->GetListOfFunctions()->Remove(pm);\n delete pm;\n }\n pm = new TPolyMarker(nfound, Pos, Amp);\n h->GetListOfFunctions()->Add(pm);\n pm->SetMarkerStyle(23);\n pm->SetMarkerColor(kRed);\n pm->SetMarkerSize(1);\n \/\/ cleanup\n delete pfit;\n delete [] Amp;\n delete [] FixAmp;\n delete [] FixPos;\n delete s;\n delete [] dest;\n delete [] source;\n return;\n}<|endoftext|>"} {"text":"<commit_before>#include \"extensions\/filters\/network\/common\/redis\/client_impl.h\"\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace NetworkFilters {\nnamespace Common {\nnamespace Redis {\nnamespace Client {\n\nConfigImpl::ConfigImpl(\n const envoy::config::filter::network::redis_proxy::v2::RedisProxy::ConnPoolSettings& config)\n : op_timeout_(PROTOBUF_GET_MS_REQUIRED(config, op_timeout)),\n enable_hashtagging_(config.enable_hashtagging()),\n enable_redirection_(config.enable_redirection()),\n max_buffer_size_before_flush_(\n config.max_buffer_size_before_flush()), \/\/ This is a scalar, so default is zero.\n buffer_flush_timeout_(PROTOBUF_GET_MS_OR_DEFAULT(\n config, buffer_flush_timeout,\n 3)) \/\/ Default timeout is 3ms. If max_buffer_size_before_flush is zero, this is not used\n \/\/ as the buffer is flushed on each request immediately.\n{}\n\nClientPtr ClientImpl::create(Upstream::HostConstSharedPtr host, Event::Dispatcher& dispatcher,\n EncoderPtr&& encoder, DecoderFactory& decoder_factory,\n const Config& config) {\n\n std::unique_ptr<ClientImpl> client(\n new ClientImpl(host, dispatcher, std::move(encoder), decoder_factory, config));\n client->connection_ = host->createConnection(dispatcher, nullptr, nullptr).connection_;\n client->connection_->addConnectionCallbacks(*client);\n client->connection_->addReadFilter(Network::ReadFilterSharedPtr{new UpstreamReadFilter(*client)});\n client->connection_->connect();\n client->connection_->noDelay(true);\n return std::move(client);\n}\n\nClientImpl::ClientImpl(Upstream::HostConstSharedPtr host, Event::Dispatcher& dispatcher,\n EncoderPtr&& encoder, DecoderFactory& decoder_factory, const Config& config)\n : host_(host), encoder_(std::move(encoder)), decoder_(decoder_factory.create(*this)),\n config_(config),\n connect_or_op_timer_(dispatcher.createTimer([this]() -> void { onConnectOrOpTimeout(); })),\n flush_timer_(dispatcher.createTimer([this]() -> void { flushBufferAndResetTimer(); })) {\n host->cluster().stats().upstream_cx_total_.inc();\n host->stats().cx_total_.inc();\n host->cluster().stats().upstream_cx_active_.inc();\n host->stats().cx_active_.inc();\n connect_or_op_timer_->enableTimer(host->cluster().connectTimeout());\n}\n\nClientImpl::~ClientImpl() {\n ASSERT(pending_requests_.empty());\n ASSERT(connection_->state() == Network::Connection::State::Closed);\n host_->cluster().stats().upstream_cx_active_.dec();\n host_->stats().cx_active_.dec();\n}\n\nvoid ClientImpl::close() { connection_->close(Network::ConnectionCloseType::NoFlush); }\n\nvoid ClientImpl::flushBufferAndResetTimer() {\n if (flush_timer_->enabled()) {\n flush_timer_->disableTimer();\n }\n connection_->write(encoder_buffer_, false);\n}\n\nPoolRequest* ClientImpl::makeRequest(const RespValue& request, PoolCallbacks& callbacks) {\n ASSERT(connection_->state() == Network::Connection::State::Open);\n\n const bool empty_buffer = encoder_buffer_.length() == 0;\n\n pending_requests_.emplace_back(*this, callbacks);\n encoder_->encode(request, encoder_buffer_);\n\n \/\/ If buffer is full, flush. If the buffer was empty before the request, start the timer.\n if (encoder_buffer_.length() >= config_.maxBufferSizeBeforeFlush()) {\n flushBufferAndResetTimer();\n } else if (empty_buffer) {\n flush_timer_->enableTimer(std::chrono::milliseconds(config_.bufferFlushTimeoutInMs()));\n }\n\n \/\/ Only boost the op timeout if:\n \/\/ - We are not already connected. Otherwise, we are governed by the connect timeout and the timer\n \/\/ will be reset when\/if connection occurs. This allows a relatively long connection spin up\n \/\/ time for example if TLS is being used.\n \/\/ - This is the first request on the pipeline. Otherwise the timeout would effectively start on\n \/\/ the last operation.\n if (connected_ && pending_requests_.size() == 1) {\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n return &pending_requests_.back();\n}\n\nvoid ClientImpl::onConnectOrOpTimeout() {\n putOutlierEvent(Upstream::Outlier::Result::LOCAL_ORIGIN_TIMEOUT);\n if (connected_) {\n host_->cluster().stats().upstream_rq_timeout_.inc();\n host_->stats().rq_timeout_.inc();\n } else {\n host_->cluster().stats().upstream_cx_connect_timeout_.inc();\n host_->stats().cx_connect_fail_.inc();\n }\n\n connection_->close(Network::ConnectionCloseType::NoFlush);\n}\n\nvoid ClientImpl::onData(Buffer::Instance& data) {\n try {\n decoder_->decode(data);\n } catch (ProtocolError&) {\n putOutlierEvent(Upstream::Outlier::Result::EXT_ORIGIN_REQUEST_FAILED);\n host_->cluster().stats().upstream_cx_protocol_error_.inc();\n host_->stats().rq_error_.inc();\n connection_->close(Network::ConnectionCloseType::NoFlush);\n }\n}\n\nvoid ClientImpl::putOutlierEvent(Upstream::Outlier::Result result) {\n if (!config_.disableOutlierEvents()) {\n host_->outlierDetector().putResult(result);\n }\n}\n\nvoid ClientImpl::onEvent(Network::ConnectionEvent event) {\n if (event == Network::ConnectionEvent::RemoteClose ||\n event == Network::ConnectionEvent::LocalClose) {\n if (!pending_requests_.empty()) {\n host_->cluster().stats().upstream_cx_destroy_with_active_rq_.inc();\n if (event == Network::ConnectionEvent::RemoteClose) {\n putOutlierEvent(Upstream::Outlier::Result::LOCAL_ORIGIN_CONNECT_FAILED);\n host_->cluster().stats().upstream_cx_destroy_remote_with_active_rq_.inc();\n }\n if (event == Network::ConnectionEvent::LocalClose) {\n host_->cluster().stats().upstream_cx_destroy_local_with_active_rq_.inc();\n }\n }\n\n while (!pending_requests_.empty()) {\n PendingRequest& request = pending_requests_.front();\n if (!request.canceled_) {\n request.callbacks_.onFailure();\n } else {\n host_->cluster().stats().upstream_rq_cancelled_.inc();\n }\n pending_requests_.pop_front();\n }\n\n connect_or_op_timer_->disableTimer();\n } else if (event == Network::ConnectionEvent::Connected) {\n connected_ = true;\n ASSERT(!pending_requests_.empty());\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n if (event == Network::ConnectionEvent::RemoteClose && !connected_) {\n host_->cluster().stats().upstream_cx_connect_fail_.inc();\n host_->stats().cx_connect_fail_.inc();\n }\n}\n\nvoid ClientImpl::onRespValue(RespValuePtr&& value) {\n ASSERT(!pending_requests_.empty());\n PendingRequest& request = pending_requests_.front();\n\n if (request.canceled_) {\n host_->cluster().stats().upstream_rq_cancelled_.inc();\n } else if (config_.enableRedirection() && (value->type() == Common::Redis::RespType::Error)) {\n std::vector<absl::string_view> err = StringUtil::splitToken(value->asString(), \" \", false);\n bool redirected = false;\n if (err.size() == 3) {\n if (err[0] == RedirectionResponse::get().MOVED || err[0] == RedirectionResponse::get().ASK) {\n redirected = request.callbacks_.onRedirection(*value);\n if (redirected) {\n host_->cluster().stats().upstream_internal_redirect_succeeded_total_.inc();\n } else {\n host_->cluster().stats().upstream_internal_redirect_failed_total_.inc();\n }\n }\n }\n if (!redirected) {\n request.callbacks_.onResponse(std::move(value));\n }\n } else {\n request.callbacks_.onResponse(std::move(value));\n }\n\n pending_requests_.pop_front();\n\n \/\/ If there are no remaining ops in the pipeline we need to disable the timer.\n \/\/ Otherwise we boost the timer since we are receiving responses and there are more to flush\n \/\/ out.\n if (pending_requests_.empty()) {\n connect_or_op_timer_->disableTimer();\n } else {\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n putOutlierEvent(Upstream::Outlier::Result::EXT_ORIGIN_REQUEST_SUCCESS);\n}\n\nClientImpl::PendingRequest::PendingRequest(ClientImpl& parent, PoolCallbacks& callbacks)\n : parent_(parent), callbacks_(callbacks) {\n parent.host_->cluster().stats().upstream_rq_total_.inc();\n parent.host_->stats().rq_total_.inc();\n parent.host_->cluster().stats().upstream_rq_active_.inc();\n parent.host_->stats().rq_active_.inc();\n}\n\nClientImpl::PendingRequest::~PendingRequest() {\n parent_.host_->cluster().stats().upstream_rq_active_.dec();\n parent_.host_->stats().rq_active_.dec();\n}\n\nvoid ClientImpl::PendingRequest::cancel() {\n \/\/ If we get a cancellation, we just mark the pending request as cancelled, and then we drop\n \/\/ the response as it comes through. There is no reason to blow away the connection when the\n \/\/ remote is already responding as fast as possible.\n canceled_ = true;\n}\n\nClientFactoryImpl ClientFactoryImpl::instance_;\n\nClientPtr ClientFactoryImpl::create(Upstream::HostConstSharedPtr host,\n Event::Dispatcher& dispatcher, const Config& config) {\n return ClientImpl::create(host, dispatcher, EncoderPtr{new EncoderImpl()}, decoder_factory_,\n config);\n}\n\n} \/\/ namespace Client\n} \/\/ namespace Redis\n} \/\/ namespace Common\n} \/\/ namespace NetworkFilters\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n<commit_msg>redis: remove redundant move (#7520)<commit_after>#include \"extensions\/filters\/network\/common\/redis\/client_impl.h\"\n\nnamespace Envoy {\nnamespace Extensions {\nnamespace NetworkFilters {\nnamespace Common {\nnamespace Redis {\nnamespace Client {\n\nConfigImpl::ConfigImpl(\n const envoy::config::filter::network::redis_proxy::v2::RedisProxy::ConnPoolSettings& config)\n : op_timeout_(PROTOBUF_GET_MS_REQUIRED(config, op_timeout)),\n enable_hashtagging_(config.enable_hashtagging()),\n enable_redirection_(config.enable_redirection()),\n max_buffer_size_before_flush_(\n config.max_buffer_size_before_flush()), \/\/ This is a scalar, so default is zero.\n buffer_flush_timeout_(PROTOBUF_GET_MS_OR_DEFAULT(\n config, buffer_flush_timeout,\n 3)) \/\/ Default timeout is 3ms. If max_buffer_size_before_flush is zero, this is not used\n \/\/ as the buffer is flushed on each request immediately.\n{}\n\nClientPtr ClientImpl::create(Upstream::HostConstSharedPtr host, Event::Dispatcher& dispatcher,\n EncoderPtr&& encoder, DecoderFactory& decoder_factory,\n const Config& config) {\n\n std::unique_ptr<ClientImpl> client(\n new ClientImpl(host, dispatcher, std::move(encoder), decoder_factory, config));\n client->connection_ = host->createConnection(dispatcher, nullptr, nullptr).connection_;\n client->connection_->addConnectionCallbacks(*client);\n client->connection_->addReadFilter(Network::ReadFilterSharedPtr{new UpstreamReadFilter(*client)});\n client->connection_->connect();\n client->connection_->noDelay(true);\n return client;\n}\n\nClientImpl::ClientImpl(Upstream::HostConstSharedPtr host, Event::Dispatcher& dispatcher,\n EncoderPtr&& encoder, DecoderFactory& decoder_factory, const Config& config)\n : host_(host), encoder_(std::move(encoder)), decoder_(decoder_factory.create(*this)),\n config_(config),\n connect_or_op_timer_(dispatcher.createTimer([this]() -> void { onConnectOrOpTimeout(); })),\n flush_timer_(dispatcher.createTimer([this]() -> void { flushBufferAndResetTimer(); })) {\n host->cluster().stats().upstream_cx_total_.inc();\n host->stats().cx_total_.inc();\n host->cluster().stats().upstream_cx_active_.inc();\n host->stats().cx_active_.inc();\n connect_or_op_timer_->enableTimer(host->cluster().connectTimeout());\n}\n\nClientImpl::~ClientImpl() {\n ASSERT(pending_requests_.empty());\n ASSERT(connection_->state() == Network::Connection::State::Closed);\n host_->cluster().stats().upstream_cx_active_.dec();\n host_->stats().cx_active_.dec();\n}\n\nvoid ClientImpl::close() { connection_->close(Network::ConnectionCloseType::NoFlush); }\n\nvoid ClientImpl::flushBufferAndResetTimer() {\n if (flush_timer_->enabled()) {\n flush_timer_->disableTimer();\n }\n connection_->write(encoder_buffer_, false);\n}\n\nPoolRequest* ClientImpl::makeRequest(const RespValue& request, PoolCallbacks& callbacks) {\n ASSERT(connection_->state() == Network::Connection::State::Open);\n\n const bool empty_buffer = encoder_buffer_.length() == 0;\n\n pending_requests_.emplace_back(*this, callbacks);\n encoder_->encode(request, encoder_buffer_);\n\n \/\/ If buffer is full, flush. If the buffer was empty before the request, start the timer.\n if (encoder_buffer_.length() >= config_.maxBufferSizeBeforeFlush()) {\n flushBufferAndResetTimer();\n } else if (empty_buffer) {\n flush_timer_->enableTimer(std::chrono::milliseconds(config_.bufferFlushTimeoutInMs()));\n }\n\n \/\/ Only boost the op timeout if:\n \/\/ - We are not already connected. Otherwise, we are governed by the connect timeout and the timer\n \/\/ will be reset when\/if connection occurs. This allows a relatively long connection spin up\n \/\/ time for example if TLS is being used.\n \/\/ - This is the first request on the pipeline. Otherwise the timeout would effectively start on\n \/\/ the last operation.\n if (connected_ && pending_requests_.size() == 1) {\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n return &pending_requests_.back();\n}\n\nvoid ClientImpl::onConnectOrOpTimeout() {\n putOutlierEvent(Upstream::Outlier::Result::LOCAL_ORIGIN_TIMEOUT);\n if (connected_) {\n host_->cluster().stats().upstream_rq_timeout_.inc();\n host_->stats().rq_timeout_.inc();\n } else {\n host_->cluster().stats().upstream_cx_connect_timeout_.inc();\n host_->stats().cx_connect_fail_.inc();\n }\n\n connection_->close(Network::ConnectionCloseType::NoFlush);\n}\n\nvoid ClientImpl::onData(Buffer::Instance& data) {\n try {\n decoder_->decode(data);\n } catch (ProtocolError&) {\n putOutlierEvent(Upstream::Outlier::Result::EXT_ORIGIN_REQUEST_FAILED);\n host_->cluster().stats().upstream_cx_protocol_error_.inc();\n host_->stats().rq_error_.inc();\n connection_->close(Network::ConnectionCloseType::NoFlush);\n }\n}\n\nvoid ClientImpl::putOutlierEvent(Upstream::Outlier::Result result) {\n if (!config_.disableOutlierEvents()) {\n host_->outlierDetector().putResult(result);\n }\n}\n\nvoid ClientImpl::onEvent(Network::ConnectionEvent event) {\n if (event == Network::ConnectionEvent::RemoteClose ||\n event == Network::ConnectionEvent::LocalClose) {\n if (!pending_requests_.empty()) {\n host_->cluster().stats().upstream_cx_destroy_with_active_rq_.inc();\n if (event == Network::ConnectionEvent::RemoteClose) {\n putOutlierEvent(Upstream::Outlier::Result::LOCAL_ORIGIN_CONNECT_FAILED);\n host_->cluster().stats().upstream_cx_destroy_remote_with_active_rq_.inc();\n }\n if (event == Network::ConnectionEvent::LocalClose) {\n host_->cluster().stats().upstream_cx_destroy_local_with_active_rq_.inc();\n }\n }\n\n while (!pending_requests_.empty()) {\n PendingRequest& request = pending_requests_.front();\n if (!request.canceled_) {\n request.callbacks_.onFailure();\n } else {\n host_->cluster().stats().upstream_rq_cancelled_.inc();\n }\n pending_requests_.pop_front();\n }\n\n connect_or_op_timer_->disableTimer();\n } else if (event == Network::ConnectionEvent::Connected) {\n connected_ = true;\n ASSERT(!pending_requests_.empty());\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n if (event == Network::ConnectionEvent::RemoteClose && !connected_) {\n host_->cluster().stats().upstream_cx_connect_fail_.inc();\n host_->stats().cx_connect_fail_.inc();\n }\n}\n\nvoid ClientImpl::onRespValue(RespValuePtr&& value) {\n ASSERT(!pending_requests_.empty());\n PendingRequest& request = pending_requests_.front();\n\n if (request.canceled_) {\n host_->cluster().stats().upstream_rq_cancelled_.inc();\n } else if (config_.enableRedirection() && (value->type() == Common::Redis::RespType::Error)) {\n std::vector<absl::string_view> err = StringUtil::splitToken(value->asString(), \" \", false);\n bool redirected = false;\n if (err.size() == 3) {\n if (err[0] == RedirectionResponse::get().MOVED || err[0] == RedirectionResponse::get().ASK) {\n redirected = request.callbacks_.onRedirection(*value);\n if (redirected) {\n host_->cluster().stats().upstream_internal_redirect_succeeded_total_.inc();\n } else {\n host_->cluster().stats().upstream_internal_redirect_failed_total_.inc();\n }\n }\n }\n if (!redirected) {\n request.callbacks_.onResponse(std::move(value));\n }\n } else {\n request.callbacks_.onResponse(std::move(value));\n }\n\n pending_requests_.pop_front();\n\n \/\/ If there are no remaining ops in the pipeline we need to disable the timer.\n \/\/ Otherwise we boost the timer since we are receiving responses and there are more to flush\n \/\/ out.\n if (pending_requests_.empty()) {\n connect_or_op_timer_->disableTimer();\n } else {\n connect_or_op_timer_->enableTimer(config_.opTimeout());\n }\n\n putOutlierEvent(Upstream::Outlier::Result::EXT_ORIGIN_REQUEST_SUCCESS);\n}\n\nClientImpl::PendingRequest::PendingRequest(ClientImpl& parent, PoolCallbacks& callbacks)\n : parent_(parent), callbacks_(callbacks) {\n parent.host_->cluster().stats().upstream_rq_total_.inc();\n parent.host_->stats().rq_total_.inc();\n parent.host_->cluster().stats().upstream_rq_active_.inc();\n parent.host_->stats().rq_active_.inc();\n}\n\nClientImpl::PendingRequest::~PendingRequest() {\n parent_.host_->cluster().stats().upstream_rq_active_.dec();\n parent_.host_->stats().rq_active_.dec();\n}\n\nvoid ClientImpl::PendingRequest::cancel() {\n \/\/ If we get a cancellation, we just mark the pending request as cancelled, and then we drop\n \/\/ the response as it comes through. There is no reason to blow away the connection when the\n \/\/ remote is already responding as fast as possible.\n canceled_ = true;\n}\n\nClientFactoryImpl ClientFactoryImpl::instance_;\n\nClientPtr ClientFactoryImpl::create(Upstream::HostConstSharedPtr host,\n Event::Dispatcher& dispatcher, const Config& config) {\n return ClientImpl::create(host, dispatcher, EncoderPtr{new EncoderImpl()}, decoder_factory_,\n config);\n}\n\n} \/\/ namespace Client\n} \/\/ namespace Redis\n} \/\/ namespace Common\n} \/\/ namespace NetworkFilters\n} \/\/ namespace Extensions\n} \/\/ namespace Envoy\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/ $MpId: testReadSector.C,v 1.16 2006\/01\/11 10:00:50 ivana Exp $\n\/\/\n\/\/ Test macro for reading sector data.\n\n#include <iomanip>\n\nvoid testReadSector(AliMp::StationType station = AliMp::kStation1,\n AliMp::PlaneType plane = AliMp::kBendingPlane, \n\t \t Bool_t rootInput = false)\n{\n AliMpSector *sector = 0;\n if (!rootInput) {\n AliMpSectorReader r(station, plane);\n \/\/reader.SetVerboseLevel(1);\n sector=r.BuildSector();\n\n \/\/ Write sector on Root file\n TString filePath = AliMpFiles::SectorFilePath(station,plane);\n filePath.ReplaceAll(\"zones.dat\", \"sector.root\"); \n \n TFile f(filePath.Data(), \"RECREATE\");\n sector->Write();\n f.Close();\n }\n else {\n TString filePath = AliMpFiles::SectorFilePath(station,plane);\n filePath.ReplaceAll(\"zones.dat\", \"sector.root\"); \n\n TFile f(filePath.Data(), \"READ\");\n sector = (AliMpSector*)f.Get(\"Sector\");\n } \n\n cout << endl;\n\n \/\/ Sector geometry\n sector->PrintGeometry();\n\n cout << endl;\n\n \/\/ Find row test\n if (plane == AliMp::kBendingPlane)\n cout << \"0th row low border \" << sector->FindRow(TVector2(0., 0.))->GetID() << endl;\n if (plane == AliMp::kNonBendingPlane)\n cout << \"0th row low border \" << sector->FindRow(TVector2(0., 0.215))->GetID() << endl;\n cout << \"in 0th row \" << sector->FindRow(TVector2(0., 2.5))->GetID() << endl;\n cout << \"0th row up border \" << sector->FindRow(TVector2(0., 6.72))->GetID() << endl;\n cout << \"in 4th row \" << sector->FindRow(TVector2(0., 30.))->GetID() << endl;\n if (plane == AliMp::kBendingPlane)\n cout << \"12th row up border \" << sector->FindRow(TVector2(0., 89.46))->GetID() << endl;\n if (plane == AliMp::kNonBendingPlane)\n cout << \"12th row up border \" << sector->FindRow(TVector2(0., 84.84))->GetID() << endl;\n cout << endl;\n \n \/\/ Find motif position test\n Int_t ids[15] = { 19, 14, 9, 32, 36, 136, 187, 212, 207, 220, 1, 131, 239, 243, 250 }; \n for (Int_t i=0; i<15 ; i++) {\n Int_t id = ids[i];\n cout << \"Motif pos \" << std::setw(3) << id;\n if (!sector->FindRowSegment(id)) {\n cout << \" not found.\" << endl;\n }\n else {\t \n cout << \" found in : \"\n << sector->FindRow(id)->GetID() << \" row, \"\n << \" motif id: \"\n << sector->FindRowSegment(id)->GetMotif(0)->GetID().Data()\n\t << endl;\n } \n }\n cout << endl;\n\n \/\/ Find motif by coordinates test\n for (Int_t i=0; i<2 ; i++) {\n TVector2 pos(0.5, 18.6 - i*2.); \/\/ i=0 in motif 1001,\n \/\/ i=1 outside (below) motif 1001\n AliMpMotif* motif = sector->FindMotif(pos);\n cout << \"In the position \" << pos.X() << \" \" << pos.Y();\n \n if (motif)\n cout << \" found motif \" << motif->GetID() << endl;\n else \n cout << \" motif not found \" << endl;\n }\n\n \/\/ Find special motif test\n if (plane == AliMp::kNonBendingPlane) {\n \n Int_t ids[6] = { 20, 46, 47, 74, 75, 76 };\n for (Int_t i=0; i<6 ; i++) {\n \n Int_t id = ids[i];\n cout << \"Motif pos \" << id;\n if (!sector->FindRowSegment(id)) {\n cout << \" not found.\" << endl;\n }\n else {\t \n cout << \" found in : \"\n << sector->FindRow(id)->GetID() << \" row, \"\n\t << \" position : \"\n\t << sector->FindPosition(id).X() << \" \" << sector->FindPosition(id).Y()\n\t << endl;\n }\n }\n } \n cout << endl;\n\n \/\/ Motif map\n sector->GetMotifMap()->Print(); \n \n delete sector;\n}\t\t\t \n \n\n \n<commit_msg>Applying ManuMask in motif position test<commit_after>\/\/ $Id$\n\/\/ $MpId: testReadSector.C,v 1.16 2006\/01\/11 10:00:50 ivana Exp $\n\/\/\n\/\/ Test macro for reading sector data.\n\n#include <iomanip>\n\nvoid testReadSector(AliMp::StationType station = AliMp::kStation1,\n AliMp::PlaneType plane = AliMp::kBendingPlane, \n\t \t Bool_t rootInput = false)\n{\n AliMpSector *sector = 0;\n if (!rootInput) {\n AliMpSectorReader r(station, plane);\n \/\/reader.SetVerboseLevel(1);\n sector=r.BuildSector();\n\n \/\/ Write sector on Root file\n TString filePath = AliMpFiles::SectorFilePath(station,plane);\n filePath.ReplaceAll(\"zones.dat\", \"sector.root\"); \n \n TFile f(filePath.Data(), \"RECREATE\");\n sector->Write();\n f.Close();\n }\n else {\n TString filePath = AliMpFiles::SectorFilePath(station,plane);\n filePath.ReplaceAll(\"zones.dat\", \"sector.root\"); \n\n TFile f(filePath.Data(), \"READ\");\n sector = (AliMpSector*)f.Get(\"Sector\");\n } \n\n cout << endl;\n\n \/\/ Sector geometry\n sector->PrintGeometry();\n\n cout << endl;\n\n \/\/ Find row test\n if (plane == AliMp::kBendingPlane)\n cout << \"0th row low border \" << sector->FindRow(TVector2(0., 0.))->GetID() << endl;\n if (plane == AliMp::kNonBendingPlane)\n cout << \"0th row low border \" << sector->FindRow(TVector2(0., 0.215))->GetID() << endl;\n cout << \"in 0th row \" << sector->FindRow(TVector2(0., 2.5))->GetID() << endl;\n cout << \"0th row up border \" << sector->FindRow(TVector2(0., 6.72))->GetID() << endl;\n cout << \"in 4th row \" << sector->FindRow(TVector2(0., 30.))->GetID() << endl;\n if (plane == AliMp::kBendingPlane)\n cout << \"12th row up border \" << sector->FindRow(TVector2(0., 89.46))->GetID() << endl;\n if (plane == AliMp::kNonBendingPlane)\n cout << \"12th row up border \" << sector->FindRow(TVector2(0., 84.84))->GetID() << endl;\n cout << endl;\n \n \/\/ Find motif position test\n Int_t ids[15] = { 19, 14, 9, 32, 36, 136, 187, 212, 207, 220, 1, 131, 239, 243, 250 }; \n for (Int_t i=0; i<15 ; i++) {\n Int_t id = ids[i];\n id |= AliMpConstants::ManuMask(plane);\n cout << \"Motif pos \" << std::setw(3) << id;\n if (!sector->FindRowSegment(id)) {\n cout << \" not found.\" << endl;\n }\n else {\t \n cout << \" found in : \"\n << sector->FindRow(id)->GetID() << \" row, \"\n << \" motif id: \"\n << sector->FindRowSegment(id)->GetMotif(0)->GetID().Data()\n\t << endl;\n } \n }\n cout << endl;\n\n \/\/ Find motif by coordinates test\n for (Int_t i=0; i<2 ; i++) {\n TVector2 pos(0.5, 18.6 - i*2.); \/\/ i=0 in motif 1001,\n \/\/ i=1 outside (below) motif 1001\n AliMpMotif* motif = sector->FindMotif(pos);\n cout << \"In the position \" << pos.X() << \" \" << pos.Y();\n \n if (motif)\n cout << \" found motif \" << motif->GetID() << endl;\n else \n cout << \" motif not found \" << endl;\n }\n\n \/\/ Find special motif test\n if (plane == AliMp::kNonBendingPlane) {\n \n Int_t ids[6] = { 20, 46, 47, 74, 75, 76 };\n for (Int_t i=0; i<6 ; i++) {\n \n Int_t id = ids[i];\n cout << \"Motif pos \" << id;\n if (!sector->FindRowSegment(id)) {\n cout << \" not found.\" << endl;\n }\n else {\t \n cout << \" found in : \"\n << sector->FindRow(id)->GetID() << \" row, \"\n\t << \" position : \"\n\t << sector->FindPosition(id).X() << \" \" << sector->FindPosition(id).Y()\n\t << endl;\n }\n }\n } \n cout << endl;\n\n \/\/ Motif map\n sector->GetMotifMap()->Print(); \n \n delete sector;\n}\t\t\t \n \n\n \n<|endoftext|>"} {"text":"<commit_before>#pragma once\r\n#include \"api\/HttpUrlConnection.hpp\"\r\n\r\nnamespace ledger {\r\n namespace core {\r\n namespace test {\r\n struct UrlConnectionData {\r\n int32_t statusCode;\r\n std::string statusText;\r\n std::unordered_map<std::string, std::string> headers;\r\n std::string body;\r\n };\r\n\r\n class FakeUrlConnection : public api::HttpUrlConnection {\r\n public:\r\n static std::shared_ptr<FakeUrlConnection> FakeUrlConnection::fromString(const std::string& responseData);\r\n FakeUrlConnection(const UrlConnectionData& data);\r\n int32_t getStatusCode() override;\n std::string getStatusText() override;\n std::unordered_map<std::string, std::string> getHeaders() override;\n api::HttpReadBodyResult readBody() override;\r\n private:\r\n UrlConnectionData _data;\r\n };\r\n }\r\n }\r\n}<commit_msg>Remove class name from function def.<commit_after>#pragma once\r\n#include \"api\/HttpUrlConnection.hpp\"\r\n#include <memory>\r\n\r\nnamespace ledger {\r\n namespace core {\r\n namespace test {\r\n struct UrlConnectionData {\r\n int32_t statusCode;\r\n std::string statusText;\r\n std::unordered_map<std::string, std::string> headers;\r\n std::string body;\r\n };\r\n\r\n class FakeUrlConnection : public api::HttpUrlConnection {\r\n public:\r\n static std::shared_ptr<FakeUrlConnection> fromString(const std::string& responseData);\r\n FakeUrlConnection(const UrlConnectionData& data);\r\n int32_t getStatusCode() override;\n std::string getStatusText() override;\n std::unordered_map<std::string, std::string> getHeaders() override;\n api::HttpReadBodyResult readBody() override;\r\n private:\r\n UrlConnectionData _data;\r\n };\r\n }\r\n }\r\n}<|endoftext|>"} {"text":"<commit_before>\/** \\file extract_vufind_translations_for_translation.cc\n * \\brief A tool for extracting translations that need to be translated. The keywords and any possibly\n * pre-existing translations will be stored in an SQL database.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2016, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"File.h\"\n#include \"IniFile.h\"\n#include \"StringUtil.h\"\n#include \"TranslationUtil.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n std::cerr << \"Usage: \" << progname << \" translation.ini...\\n\";\n std::exit(EXIT_FAILURE);\n}\n\nvoid InsertTranslations(\n DbConnection * const connection, const std::string &language_code,\n const std::unordered_map<std::string, std::pair<unsigned, std::string>> &keys_to_line_no_and_translation_map)\n{\n for (const auto &keys_to_line_no_and_translation : keys_to_line_no_and_translation_map) {\n const std::string key = connection->escapeString(keys_to_line_no_and_translation.first);\n const std::string translation = connection->escapeString(keys_to_line_no_and_translation.second.second);\n\n \/\/ Skip inserting translations if we have a translator, i.e. the web translation tool was used\n \/\/ to insert the translations into the database\n const std::string GET_TRANSLATOR(\"SELECT translator FROM vufind_translations WHERE language_code=\\\"\"\n + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n + \"\\\" AND token=\\\"\" + key + \"\\\"\");\n if (not connection->query(GET_TRANSLATOR))\n Error(\"Select failed: \" + GET_TRANSLATOR + \" (\" + connection->getLastErrorMessage() + \")\");\n DbResultSet result(connection->getLastResultSet());\n if (not result.hasColumn(\"translator\"))\n Error(\"Translator column not found\");\n const std::string translator(result.getNextRow()[\"translator\"]);\n if (not translator.empty())\n continue;\n\n const std::string INSERT_OTHER(\n \"REPLACE INTO vufind_translations SET language_code=\\\"\"\n\t + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n\t + \"\\\", token=\\\"\" + key + \"\\\", translation=\\\"\" + translation + \"\\\"\");\n if (not connection->query(INSERT_OTHER))\n Error(\"Insert failed: \" + INSERT_OTHER + \" (\" + connection->getLastErrorMessage() + \")\");\n }\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/var\/lib\/tuelib\/translations.conf\");\n\n\nint main(int argc, char **argv) {\n progname = argv[0];\n\n if (argc < 2)\n Usage();\n\n try {\n const IniFile ini_file(CONF_FILE_PATH);\n const std::string sql_database(ini_file.getString(\"Database\", \"sql_database\"));\n const std::string sql_username(ini_file.getString(\"Database\", \"sql_username\"));\n const std::string sql_password(ini_file.getString(\"Database\", \"sql_password\"));\n DbConnection db_connection(sql_database, sql_username, sql_password);\n\n for (int arg_no(1); arg_no < argc; ++arg_no) {\n \/\/ Get the 2-letter language code from the filename. We expect filenames of the form \"xx.ini\" or\n \/\/ \"some_path\/xx.ini\":\n const std::string ini_filename(argv[arg_no]);\n if (unlikely(not StringUtil::EndsWith(ini_filename, \".ini\")))\n Error(\"expected filename \\\"\" + ini_filename + \"\\\" to end in \\\".ini\\\"!\");\n std::string two_letter_code;\n if (ini_filename.length() == 6)\n two_letter_code = ini_filename.substr(0, 2);\n else {\n const std::string::size_type last_slash_pos(ini_filename.rfind('\/'));\n if (unlikely(last_slash_pos == std::string::npos or (last_slash_pos + 6 + 1 != ini_filename.length())))\n Error(\"INI filename does not match expected pattern: \\\"\" + ini_filename + \"\\\"!\");\n two_letter_code = ini_filename.substr(last_slash_pos + 1, 2);\n }\n\n const std::string german_3letter_code(\n TranslationUtil::MapInternational2LetterCodeToGerman3LetterCode(two_letter_code));\n\n std::unordered_map<std::string, std::pair<unsigned, std::string>> keys_to_line_no_and_translation_map;\n TranslationUtil::ReadIniFile(ini_filename, &keys_to_line_no_and_translation_map);\n std::cout << \"Read \" << keys_to_line_no_and_translation_map.size()\n << \" mappings from English to another language from \\\"\" << ini_filename << \"\\\".\\n\";\n\n InsertTranslations(&db_connection, german_3letter_code, keys_to_line_no_and_translation_map);\n }\n } catch (const std::exception &x) {\n Error(\"caught exception: \" + std::string(x.what()));\n }\n}\n<commit_msg>SEGFAULT fix<commit_after>\/** \\file extract_vufind_translations_for_translation.cc\n * \\brief A tool for extracting translations that need to be translated. The keywords and any possibly\n * pre-existing translations will be stored in an SQL database.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2016, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"File.h\"\n#include \"IniFile.h\"\n#include \"StringUtil.h\"\n#include \"TranslationUtil.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n std::cerr << \"Usage: \" << progname << \" translation.ini...\\n\";\n std::exit(EXIT_FAILURE);\n}\n\nvoid InsertTranslations(\n DbConnection * const connection, const std::string &language_code,\n const std::unordered_map<std::string, std::pair<unsigned, std::string>> &keys_to_line_no_and_translation_map)\n{\n for (const auto &keys_to_line_no_and_translation : keys_to_line_no_and_translation_map) {\n const std::string key = connection->escapeString(keys_to_line_no_and_translation.first);\n const std::string translation = connection->escapeString(keys_to_line_no_and_translation.second.second);\n\n \/\/ Skip inserting translations if we have a translator, i.e. the web translation tool was used\n \/\/ to insert the translations into the database\n const std::string GET_TRANSLATOR(\"SELECT translator FROM vufind_translations WHERE language_code=\\\"\"\n + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n + \"\\\" AND token=\\\"\" + key + \"\\\"\");\n if (not connection->query(GET_TRANSLATOR))\n Error(\"Select failed: \" + GET_TRANSLATOR + \" (\" + connection->getLastErrorMessage() + \")\");\n DbResultSet result(connection->getLastResultSet());\n if (not result.empty()) {\n const DbRow row(result.getNextRow());\n if (not row.isNull(\"translator\")) {\n const std::string translator(row[\"translator\"]);\n if (not translator.empty())\n continue;\n }\n }\n\n const std::string INSERT_OTHER(\n \"REPLACE INTO vufind_translations SET language_code=\\\"\"\n\t + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n\t + \"\\\", token=\\\"\" + key + \"\\\", translation=\\\"\" + translation + \"\\\"\");\n if (not connection->query(INSERT_OTHER))\n Error(\"Insert failed: \" + INSERT_OTHER + \" (\" + connection->getLastErrorMessage() + \")\");\n }\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/var\/lib\/tuelib\/translations.conf\");\n\n\nint main(int argc, char **argv) {\n progname = argv[0];\n\n if (argc < 2)\n Usage();\n\n try {\n const IniFile ini_file(CONF_FILE_PATH);\n const std::string sql_database(ini_file.getString(\"Database\", \"sql_database\"));\n const std::string sql_username(ini_file.getString(\"Database\", \"sql_username\"));\n const std::string sql_password(ini_file.getString(\"Database\", \"sql_password\"));\n DbConnection db_connection(sql_database, sql_username, sql_password);\n\n for (int arg_no(1); arg_no < argc; ++arg_no) {\n \/\/ Get the 2-letter language code from the filename. We expect filenames of the form \"xx.ini\" or\n \/\/ \"some_path\/xx.ini\":\n const std::string ini_filename(argv[arg_no]);\n if (unlikely(not StringUtil::EndsWith(ini_filename, \".ini\")))\n Error(\"expected filename \\\"\" + ini_filename + \"\\\" to end in \\\".ini\\\"!\");\n std::string two_letter_code;\n if (ini_filename.length() == 6)\n two_letter_code = ini_filename.substr(0, 2);\n else {\n const std::string::size_type last_slash_pos(ini_filename.rfind('\/'));\n if (unlikely(last_slash_pos == std::string::npos or (last_slash_pos + 6 + 1 != ini_filename.length())))\n Error(\"INI filename does not match expected pattern: \\\"\" + ini_filename + \"\\\"!\");\n two_letter_code = ini_filename.substr(last_slash_pos + 1, 2);\n }\n\n const std::string german_3letter_code(\n TranslationUtil::MapInternational2LetterCodeToGerman3LetterCode(two_letter_code));\n\n std::unordered_map<std::string, std::pair<unsigned, std::string>> keys_to_line_no_and_translation_map;\n TranslationUtil::ReadIniFile(ini_filename, &keys_to_line_no_and_translation_map);\n std::cout << \"Read \" << keys_to_line_no_and_translation_map.size()\n << \" mappings from English to another language from \\\"\" << ini_filename << \"\\\".\\n\";\n\n InsertTranslations(&db_connection, german_3letter_code, keys_to_line_no_and_translation_map);\n }\n } catch (const std::exception &x) {\n Error(\"caught exception: \" + std::string(x.what()));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QTextStream>\n#include <QWidget>\n#include <coecntrl.h>\n#include \"objectdump_symbian.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace ObjectDump\n{\nnamespace Symbian\n{\n\nQList<QByteArray> QAnnotatorControl::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"control: \" << control << ' ';\n stream << \"parent \" << control->Parent() << ' ';\n \n if(control->IsVisible())\n stream << \"visible \";\n else\n stream << \"invisible \";\n \n stream << control->Position().iX << ',' << control->Position().iY << ' ';\n stream << control->Size().iWidth << 'x' << control->Size().iHeight;\n \n if(control->OwnsWindow())\n stream << \" ownsWindow \";\n \n stream.flush();\n result.append(array);\n }\n }\n \n return result;\n}\n\nQList<QByteArray> QAnnotatorWindow::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n RDrawableWindow& window = *(control->DrawableWindow());\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"window: \";\n \n \/\/ Client-side window handle\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"cli \" << reinterpret_cast<const void*>(window.ClientHandle()) << ' ';\n \n \/\/ Server-side address of CWsWindow object\n \/\/ This is useful for correlation with the window tree dumped by the window\n \/\/ server (see RWsSession::LogCommand).\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"srv \" << reinterpret_cast<const void*>(window.WsHandle()) << ' ';\n \n stream << \"group \" << window.WindowGroupId() << ' ';\n \n \/\/ Client-side handle to the parent window.\n \/\/ Cast to a void pointer so that log output is in hexadecimal format. \n stream << \"parent \" << reinterpret_cast<const void*>(window.Parent()) << ' ';\n \n stream << window.Position().iX << ',' << window.Position().iY << ' ';\n stream << '(' << window.AbsPosition().iX << ',' << window.AbsPosition().iY << \") \";\n stream << window.Size().iWidth << 'x' << window.Size().iHeight;\n \n stream.flush();\n result.append(array);\n } \n }\n \n return result;\n}\n\n} \/\/ namespace Symbian\n\nvoid addDefaultAnnotators_sys(QDumper& dumper)\n{\n dumper.addAnnotator(new Symbian::QAnnotatorControl);\n dumper.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\nvoid addDefaultAnnotators_sys(QVisitor& visitor)\n{\n visitor.addAnnotator(new Symbian::QAnnotatorControl);\n visitor.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\n} \/\/ namespace ObjectDump\n\nQT_END_NAMESPACE\n\n\n<commit_msg>Modified object annotator to dump display mode of Symbian windows<commit_after>\/* This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QTextStream>\n#include <QWidget>\n#include <coecntrl.h>\n#include \"objectdump_symbian.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace ObjectDump\n{\nnamespace Symbian\n{\n\nQList<QByteArray> QAnnotatorControl::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"control: \" << control << ' ';\n stream << \"parent \" << control->Parent() << ' ';\n \n if(control->IsVisible())\n stream << \"visible \";\n else\n stream << \"invisible \";\n \n stream << control->Position().iX << ',' << control->Position().iY << ' ';\n stream << control->Size().iWidth << 'x' << control->Size().iHeight;\n \n if(control->OwnsWindow())\n stream << \" ownsWindow \";\n \n stream.flush();\n result.append(array);\n }\n }\n \n return result;\n}\n\nQList<QByteArray> QAnnotatorWindow::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n RDrawableWindow& window = *(control->DrawableWindow());\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"window: \";\n \n \/\/ Client-side window handle\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"cli \" << reinterpret_cast<const void*>(window.ClientHandle()) << ' ';\n \n \/\/ Server-side address of CWsWindow object\n \/\/ This is useful for correlation with the window tree dumped by the window\n \/\/ server (see RWsSession::LogCommand).\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"srv \" << reinterpret_cast<const void*>(window.WsHandle()) << ' ';\n \n stream << \"group \" << window.WindowGroupId() << ' ';\n \n \/\/ Client-side handle to the parent window.\n \/\/ Cast to a void pointer so that log output is in hexadecimal format. \n stream << \"parent \" << reinterpret_cast<const void*>(window.Parent()) << ' ';\n \n stream << window.Position().iX << ',' << window.Position().iY << ' ';\n stream << '(' << window.AbsPosition().iX << ',' << window.AbsPosition().iY << \") \";\n stream << window.Size().iWidth << 'x' << window.Size().iHeight << ' ';\n \n const TDisplayMode displayMode = window.DisplayMode();\n stream << \"mode \" << displayMode;\n \n stream.flush();\n result.append(array);\n } \n }\n \n return result;\n}\n\n} \/\/ namespace Symbian\n\nvoid addDefaultAnnotators_sys(QDumper& dumper)\n{\n dumper.addAnnotator(new Symbian::QAnnotatorControl);\n dumper.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\nvoid addDefaultAnnotators_sys(QVisitor& visitor)\n{\n visitor.addAnnotator(new Symbian::QAnnotatorControl);\n visitor.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\n} \/\/ namespace ObjectDump\n\nQT_END_NAMESPACE\n\n\n<|endoftext|>"} {"text":"<commit_before>\/** \\file extract_vufind_translations_for_translation.cc\n * \\brief A tool for extracting translations that need to be translated. The keywords and any possibly\n * pre-existing translations will be stored in an SQL database.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2016, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"File.h\"\n#include \"IniFile.h\"\n#include \"StringUtil.h\"\n#include \"TranslationUtil.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n std::cerr << \"Usage: \" << progname << \" translation.ini...\\n\";\n std::exit(EXIT_FAILURE);\n}\n\nvoid InsertTranslations(\n DbConnection * const connection, const std::string &language_code,\n const std::unordered_map<std::string, std::pair<unsigned, std::string>> &keys_to_line_no_and_translation_map)\n{\n for (const auto &keys_to_line_no_and_translation : keys_to_line_no_and_translation_map) {\n const std::string key = connection->escapeString(keys_to_line_no_and_translation.first);\n const std::string translation = connection->escapeString(keys_to_line_no_and_translation.second.second);\n const std::string INSERT_OTHER(\n \"REPLACE INTO vufind_translations SET language_code=\\\"\"\n\t + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n\t + \"\\\", token=\\\"\" + key + \"\\\", translation=\\\"\" + translation + \"\\\"\");\n if (not connection->query(INSERT_OTHER))\n Error(\"Insert failed: \" + INSERT_OTHER + \" (\" + connection->getLastErrorMessage() + \")\");\n }\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/var\/lib\/tuelib\/translations.conf\");\n\n\nint main(int argc, char **argv) {\n progname = argv[0];\n\n if (argc < 2)\n Usage();\n\n try {\n const IniFile ini_file(CONF_FILE_PATH);\n const std::string sql_database(ini_file.getString(\"Database\", \"sql_database\"));\n const std::string sql_username(ini_file.getString(\"Database\", \"sql_username\"));\n const std::string sql_password(ini_file.getString(\"Database\", \"sql_password\"));\n DbConnection db_connection(sql_database, sql_username, sql_password);\n\n for (int arg_no(1); arg_no < argc; ++arg_no) {\n \/\/ Get the 2-letter language code from the filename. We expect filenames of the form \"xx.ini\" or\n \/\/ \"some_path\/xx.ini\":\n const std::string ini_filename(argv[arg_no]);\n if (unlikely(not StringUtil::EndsWith(ini_filename, \".ini\")))\n Error(\"expected filename \\\"\" + ini_filename + \"\\\" to end in \\\".ini\\\"!\");\n std::string two_letter_code;\n if (ini_filename.length() == 6)\n two_letter_code = ini_filename.substr(0, 2);\n else {\n const std::string::size_type last_slash_pos(ini_filename.rfind('\/'));\n if (unlikely(last_slash_pos == std::string::npos or (last_slash_pos + 6 + 1 != ini_filename.length())))\n Error(\"INI filename does not match expected pattern: \\\"\" + ini_filename + \"\\\"!\");\n two_letter_code = ini_filename.substr(last_slash_pos + 1, 2);\n }\n\n const std::string german_3letter_code(\n TranslationUtil::MapInternational2LetterCodeToGerman3LetterCode(two_letter_code));\n\n std::unordered_map<std::string, std::pair<unsigned, std::string>> keys_to_line_no_and_translation_map;\n TranslationUtil::ReadIniFile(ini_filename, &keys_to_line_no_and_translation_map);\n std::cout << \"Read \" << keys_to_line_no_and_translation_map.size()\n << \" mappings from English to another language from \\\"\" << ini_filename << \"\\\".\\n\";\n\n InsertTranslations(&db_connection, german_3letter_code, keys_to_line_no_and_translation_map);\n }\n } catch (const std::exception &x) {\n Error(\"caught exception: \" + std::string(x.what()));\n }\n}\n<commit_msg>Pay attention to existing translators<commit_after>\/** \\file extract_vufind_translations_for_translation.cc\n * \\brief A tool for extracting translations that need to be translated. The keywords and any possibly\n * pre-existing translations will be stored in an SQL database.\n * \\author Dr. Johannes Ruscheinski\n *\/\n\n\/*\n Copyright (C) 2016, Library of the University of Tübingen\n\n This program is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as\n published by the Free Software Foundation, either version 3 of the\n License, or (at your option) any later version.\n\n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <cstdlib>\n#include \"Compiler.h\"\n#include \"DbConnection.h\"\n#include \"DbResultSet.h\"\n#include \"DbRow.h\"\n#include \"File.h\"\n#include \"IniFile.h\"\n#include \"StringUtil.h\"\n#include \"TranslationUtil.h\"\n#include \"util.h\"\n\n\nvoid Usage() {\n std::cerr << \"Usage: \" << progname << \" translation.ini...\\n\";\n std::exit(EXIT_FAILURE);\n}\n\nvoid InsertTranslations(\n DbConnection * const connection, const std::string &language_code,\n const std::unordered_map<std::string, std::pair<unsigned, std::string>> &keys_to_line_no_and_translation_map)\n{\n for (const auto &keys_to_line_no_and_translation : keys_to_line_no_and_translation_map) {\n const std::string key = connection->escapeString(keys_to_line_no_and_translation.first);\n const std::string translation = connection->escapeString(keys_to_line_no_and_translation.second.second);\n\n \/\/ Skip inserting translations if we have a translator, i.e. the web translation tool was used\n \/\/ to insert the translations into the database\n const std::string GET_TRANSLATOR(\"SELECT translator FROM vufind_translations WHERE language_code=\\\"\"\n + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n + \"\\\" AND token=\\\"\" + key + \"\\\"\");\n if (not connection->query(GET_TRANSLATOR))\n Error(\"Select failed: \" + GET_TRANSLATOR + \" (\" + connection->getLastErrorMessage() + \")\");\n DbResultSet result(connection->getLastResultSet());\n if (not result.hasColumn(\"translator\"))\n Error(\"Translator column not found\");\n const std::string translator(result.getNextRow()[\"translator\"]);\n if (not translator.empty())\n continue;\n\n const std::string INSERT_OTHER(\n \"REPLACE INTO vufind_translations SET language_code=\\\"\"\n\t + TranslationUtil::MapGermanLanguageCodesToFake3LetterEnglishLanguagesCodes(language_code)\n\t + \"\\\", token=\\\"\" + key + \"\\\", translation=\\\"\" + translation + \"\\\"\");\n if (not connection->query(INSERT_OTHER))\n Error(\"Insert failed: \" + INSERT_OTHER + \" (\" + connection->getLastErrorMessage() + \")\");\n }\n}\n\n\nconst std::string CONF_FILE_PATH(\"\/var\/lib\/tuelib\/translations.conf\");\n\n\nint main(int argc, char **argv) {\n progname = argv[0];\n\n if (argc < 2)\n Usage();\n\n try {\n const IniFile ini_file(CONF_FILE_PATH);\n const std::string sql_database(ini_file.getString(\"Database\", \"sql_database\"));\n const std::string sql_username(ini_file.getString(\"Database\", \"sql_username\"));\n const std::string sql_password(ini_file.getString(\"Database\", \"sql_password\"));\n DbConnection db_connection(sql_database, sql_username, sql_password);\n\n for (int arg_no(1); arg_no < argc; ++arg_no) {\n \/\/ Get the 2-letter language code from the filename. We expect filenames of the form \"xx.ini\" or\n \/\/ \"some_path\/xx.ini\":\n const std::string ini_filename(argv[arg_no]);\n if (unlikely(not StringUtil::EndsWith(ini_filename, \".ini\")))\n Error(\"expected filename \\\"\" + ini_filename + \"\\\" to end in \\\".ini\\\"!\");\n std::string two_letter_code;\n if (ini_filename.length() == 6)\n two_letter_code = ini_filename.substr(0, 2);\n else {\n const std::string::size_type last_slash_pos(ini_filename.rfind('\/'));\n if (unlikely(last_slash_pos == std::string::npos or (last_slash_pos + 6 + 1 != ini_filename.length())))\n Error(\"INI filename does not match expected pattern: \\\"\" + ini_filename + \"\\\"!\");\n two_letter_code = ini_filename.substr(last_slash_pos + 1, 2);\n }\n\n const std::string german_3letter_code(\n TranslationUtil::MapInternational2LetterCodeToGerman3LetterCode(two_letter_code));\n\n std::unordered_map<std::string, std::pair<unsigned, std::string>> keys_to_line_no_and_translation_map;\n TranslationUtil::ReadIniFile(ini_filename, &keys_to_line_no_and_translation_map);\n std::cout << \"Read \" << keys_to_line_no_and_translation_map.size()\n << \" mappings from English to another language from \\\"\" << ini_filename << \"\\\".\\n\";\n\n InsertTranslations(&db_connection, german_3letter_code, keys_to_line_no_and_translation_map);\n }\n } catch (const std::exception &x) {\n Error(\"caught exception: \" + std::string(x.what()));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QTextStream>\n#include <QWidget>\n#include <coecntrl.h>\n#include \"objectdump_symbian.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace ObjectDump\n{\nnamespace Symbian\n{\n\nQList<QByteArray> QAnnotatorControl::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"control: \" << control << ' ';\n stream << \"parent \" << control->Parent() << ' ';\n \n if(control->IsVisible())\n stream << \"visible \";\n else\n stream << \"invisible \";\n \n stream << control->Position().iX << ',' << control->Position().iY << ' ';\n stream << control->Size().iWidth << 'x' << control->Size().iHeight;\n \n if(control->OwnsWindow())\n stream << \" ownsWindow \";\n \n stream.flush();\n result.append(array);\n }\n }\n \n return result;\n}\n\nQList<QByteArray> QAnnotatorWindow::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n RDrawableWindow& window = *(control->DrawableWindow());\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"window: \";\n \n \/\/ Client-side window handle\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"cli \" << reinterpret_cast<const void*>(window.ClientHandle()) << ' ';\n \n \/\/ Server-side address of CWsWindow object\n \/\/ This is useful for correlation with the window tree dumped by the window\n \/\/ server (see RWsSession::LogCommand).\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"srv \" << reinterpret_cast<const void*>(window.WsHandle()) << ' ';\n \n stream << \"group \" << window.WindowGroupId() << ' ';\n \n \/\/ Client-side handle to the parent window.\n \/\/ Cast to a void pointer so that log output is in hexadecimal format. \n stream << \"parent \" << reinterpret_cast<const void*>(window.Parent()) << ' ';\n \n stream << window.Position().iX << ',' << window.Position().iY << ' ';\n stream << '(' << window.AbsPosition().iX << ',' << window.AbsPosition().iY << \") \";\n stream << window.Size().iWidth << 'x' << window.Size().iHeight << ' ';\n \n const TDisplayMode displayMode = window.DisplayMode();\n stream << \"mode \" << displayMode;\n \n stream.flush();\n result.append(array);\n } \n }\n \n return result;\n}\n\n} \/\/ namespace Symbian\n\nvoid addDefaultAnnotators_sys(QDumper& dumper)\n{\n dumper.addAnnotator(new Symbian::QAnnotatorControl);\n dumper.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\nvoid addDefaultAnnotators_sys(QVisitor& visitor)\n{\n visitor.addAnnotator(new Symbian::QAnnotatorControl);\n visitor.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\n} \/\/ namespace ObjectDump\n\nQT_END_NAMESPACE\n\n\n<commit_msg>Build fix for SDK 3.1 and 3.2.<commit_after>\/* This file is part of the KDE project.\n\nCopyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n\nThis library is free software: you can redistribute it and\/or modify\nit under the terms of the GNU Lesser General Public License as published by\nthe Free Software Foundation, either version 2.1 or 3 of the License.\n\nThis library is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\nGNU Lesser General Public License for more details.\n\nYou should have received a copy of the GNU Lesser General Public License\nalong with this library. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include <QTextStream>\n#include <QWidget>\n#include <coecntrl.h>\n#include \"objectdump_symbian.h\"\n\nQT_BEGIN_NAMESPACE\n\nnamespace ObjectDump\n{\nnamespace Symbian\n{\n\nQList<QByteArray> QAnnotatorControl::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"control: \" << control << ' ';\n stream << \"parent \" << control->Parent() << ' ';\n \n if(control->IsVisible())\n stream << \"visible \";\n else\n stream << \"invisible \";\n \n stream << control->Position().iX << ',' << control->Position().iY << ' ';\n stream << control->Size().iWidth << 'x' << control->Size().iHeight;\n \n if(control->OwnsWindow())\n stream << \" ownsWindow \";\n \n stream.flush();\n result.append(array);\n }\n }\n \n return result;\n}\n\nQList<QByteArray> QAnnotatorWindow::annotation(const QObject& object)\n{\n QList<QByteArray> result;\n \n const QWidget* widget = qobject_cast<const QWidget*>(&object);\n if(widget) {\n \n const CCoeControl* control = widget->effectiveWinId();\n if(control) {\n \n RDrawableWindow& window = *(control->DrawableWindow());\n \n QByteArray array;\n QTextStream stream(&array);\n \n stream << \"window: \";\n \n \/\/ ClientHandle() is available first in 5.0.\n#if !defined(__SERIES60_31__) && !defined(__S60_32__)\n \/\/ Client-side window handle\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"cli \" << reinterpret_cast<const void*>(window.ClientHandle()) << ' ';\n#endif\n\n \/\/ Server-side address of CWsWindow object\n \/\/ This is useful for correlation with the window tree dumped by the window\n \/\/ server (see RWsSession::LogCommand).\n \/\/ Cast to a void pointer so that log output is in hexadecimal format.\n stream << \"srv \" << reinterpret_cast<const void*>(window.WsHandle()) << ' ';\n \n stream << \"group \" << window.WindowGroupId() << ' ';\n \n \/\/ Client-side handle to the parent window.\n \/\/ Cast to a void pointer so that log output is in hexadecimal format. \n stream << \"parent \" << reinterpret_cast<const void*>(window.Parent()) << ' ';\n \n stream << window.Position().iX << ',' << window.Position().iY << ' ';\n stream << '(' << window.AbsPosition().iX << ',' << window.AbsPosition().iY << \") \";\n stream << window.Size().iWidth << 'x' << window.Size().iHeight << ' ';\n \n const TDisplayMode displayMode = window.DisplayMode();\n stream << \"mode \" << displayMode;\n \n stream.flush();\n result.append(array);\n } \n }\n \n return result;\n}\n\n} \/\/ namespace Symbian\n\nvoid addDefaultAnnotators_sys(QDumper& dumper)\n{\n dumper.addAnnotator(new Symbian::QAnnotatorControl);\n dumper.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\nvoid addDefaultAnnotators_sys(QVisitor& visitor)\n{\n visitor.addAnnotator(new Symbian::QAnnotatorControl);\n visitor.addAnnotator(new Symbian::QAnnotatorWindow);\n}\n\n} \/\/ namespace ObjectDump\n\nQT_END_NAMESPACE\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright © 2012, 2013, 2014 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_cfg.h\"\n\nusing namespace brw;\n\n\/** @file brw_vec4_cse.cpp\n *\n * Support for local common subexpression elimination.\n *\n * See Muchnick's Advanced Compiler Design and Implementation, section\n * 13.1 (p378).\n *\/\n\nnamespace {\nstruct aeb_entry : public exec_node {\n \/** The instruction that generates the expression value. *\/\n vec4_instruction *generator;\n\n \/** The temporary where the value is stored. *\/\n src_reg tmp;\n};\n}\n\nstatic bool\nis_expression(const vec4_instruction *const inst)\n{\n switch (inst->opcode) {\n case BRW_OPCODE_SEL:\n case BRW_OPCODE_NOT:\n case BRW_OPCODE_AND:\n case BRW_OPCODE_OR:\n case BRW_OPCODE_XOR:\n case BRW_OPCODE_SHR:\n case BRW_OPCODE_SHL:\n case BRW_OPCODE_ASR:\n case BRW_OPCODE_CMP:\n case BRW_OPCODE_CMPN:\n case BRW_OPCODE_ADD:\n case BRW_OPCODE_MUL:\n case BRW_OPCODE_FRC:\n case BRW_OPCODE_RNDU:\n case BRW_OPCODE_RNDD:\n case BRW_OPCODE_RNDE:\n case BRW_OPCODE_RNDZ:\n case BRW_OPCODE_LINE:\n case BRW_OPCODE_PLN:\n case BRW_OPCODE_MAD:\n case BRW_OPCODE_LRP:\n return true;\n case SHADER_OPCODE_RCP:\n case SHADER_OPCODE_RSQ:\n case SHADER_OPCODE_SQRT:\n case SHADER_OPCODE_EXP2:\n case SHADER_OPCODE_LOG2:\n case SHADER_OPCODE_POW:\n case SHADER_OPCODE_INT_QUOTIENT:\n case SHADER_OPCODE_INT_REMAINDER:\n case SHADER_OPCODE_SIN:\n case SHADER_OPCODE_COS:\n return inst->mlen == 0;\n default:\n return !inst->has_side_effects();\n }\n}\n\nstatic bool\nis_expression_commutative(enum opcode op)\n{\n switch (op) {\n case BRW_OPCODE_AND:\n case BRW_OPCODE_OR:\n case BRW_OPCODE_XOR:\n case BRW_OPCODE_ADD:\n case BRW_OPCODE_MUL:\n return true;\n default:\n return false;\n }\n}\n\nstatic bool\noperands_match(enum opcode op, src_reg *xs, src_reg *ys)\n{\n if (!is_expression_commutative(op)) {\n return xs[0].equals(ys[0]) && xs[1].equals(ys[1]) && xs[2].equals(ys[2]);\n } else {\n return (xs[0].equals(ys[0]) && xs[1].equals(ys[1])) ||\n (xs[1].equals(ys[0]) && xs[0].equals(ys[1]));\n }\n}\n\nstatic bool\ninstructions_match(vec4_instruction *a, vec4_instruction *b)\n{\n return a->opcode == b->opcode &&\n a->saturate == b->saturate &&\n a->conditional_mod == b->conditional_mod &&\n a->dst.type == b->dst.type &&\n a->dst.writemask == b->dst.writemask &&\n operands_match(a->opcode, a->src, b->src);\n}\n\nbool\nvec4_visitor::opt_cse_local(bblock_t *block)\n{\n bool progress = false;\n exec_list aeb;\n\n void *cse_ctx = ralloc_context(NULL);\n\n int ip = block->start_ip;\n foreach_inst_in_block (vec4_instruction, inst, block) {\n \/* Skip some cases. *\/\n if (is_expression(inst) && !inst->predicate && inst->mlen == 0 &&\n (inst->dst.file != HW_REG || inst->dst.is_null()))\n {\n bool found = false;\n\n foreach_in_list_use_after(aeb_entry, entry, &aeb) {\n \/* Match current instruction's expression against those in AEB. *\/\n if (instructions_match(inst, entry->generator)) {\n found = true;\n progress = true;\n break;\n }\n }\n\n if (!found) {\n \/* Our first sighting of this expression. Create an entry. *\/\n aeb_entry *entry = ralloc(cse_ctx, aeb_entry);\n entry->tmp = src_reg(); \/* file will be BAD_FILE *\/\n entry->generator = inst;\n aeb.push_tail(entry);\n } else {\n \/* This is at least our second sighting of this expression.\n * If we don't have a temporary already, make one.\n *\/\n bool no_existing_temp = entry->tmp.file == BAD_FILE;\n if (no_existing_temp && !entry->generator->dst.is_null()) {\n entry->tmp = src_reg(this, glsl_type::float_type);\n entry->tmp.type = inst->dst.type;\n entry->tmp.swizzle = BRW_SWIZZLE_XYZW;\n\n vec4_instruction *copy = MOV(entry->generator->dst, entry->tmp);\n entry->generator->insert_after(copy);\n entry->generator->dst = dst_reg(entry->tmp);\n }\n\n \/* dest <- temp *\/\n if (!inst->dst.is_null()) {\n assert(inst->dst.type == entry->tmp.type);\n vec4_instruction *copy = MOV(inst->dst, entry->tmp);\n copy->force_writemask_all = inst->force_writemask_all;\n inst->insert_before(copy);\n }\n\n \/* Set our iterator so that next time through the loop inst->next\n * will get the instruction in the basic block after the one we've\n * removed.\n *\/\n vec4_instruction *prev = (vec4_instruction *)inst->prev;\n\n inst->remove();\n\n \/* Appending an instruction may have changed our bblock end. *\/\n if (inst == block->end) {\n block->end = prev;\n }\n\n inst = prev;\n }\n }\n\n foreach_in_list_safe(aeb_entry, entry, &aeb) {\n \/* Kill all AEB entries that write a different value to or read from\n * the flag register if we just wrote it.\n *\/\n if (inst->writes_flag()) {\n if (entry->generator->reads_flag() ||\n (entry->generator->writes_flag() &&\n !instructions_match(inst, entry->generator))) {\n entry->remove();\n ralloc_free(entry);\n continue;\n }\n }\n\n for (int i = 0; i < 3; i++) {\n src_reg *src = &entry->generator->src[i];\n\n \/* Kill all AEB entries that use the destination we just\n * overwrote.\n *\/\n if (inst->dst.file == entry->generator->src[i].file &&\n inst->dst.reg == entry->generator->src[i].reg) {\n entry->remove();\n ralloc_free(entry);\n break;\n }\n\n \/* Kill any AEB entries using registers that don't get reused any\n * more -- a sure sign they'll fail operands_match().\n *\/\n int last_reg_use = MAX2(MAX2(virtual_grf_end[src->reg * 4 + 0],\n virtual_grf_end[src->reg * 4 + 1]),\n MAX2(virtual_grf_end[src->reg * 4 + 2],\n virtual_grf_end[src->reg * 4 + 3]));\n if (src->file == GRF && last_reg_use < ip) {\n entry->remove();\n ralloc_free(entry);\n break;\n }\n }\n }\n\n ip++;\n }\n\n ralloc_free(cse_ctx);\n\n return progress;\n}\n\nbool\nvec4_visitor::opt_cse()\n{\n bool progress = false;\n\n calculate_live_intervals();\n\n for (int b = 0; b < cfg->num_blocks; b++) {\n bblock_t *block = cfg->blocks[b];\n\n progress = opt_cse_local(block) || progress;\n }\n\n if (progress)\n invalidate_live_intervals();\n\n return progress;\n}\n<commit_msg>i965: Revert part of f5cc3fdcf1680b116612fac7c39f1bd79f5e555e.<commit_after>\/*\n * Copyright © 2012, 2013, 2014 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n *\/\n\n#include \"brw_vec4.h\"\n#include \"brw_cfg.h\"\n\nusing namespace brw;\n\n\/** @file brw_vec4_cse.cpp\n *\n * Support for local common subexpression elimination.\n *\n * See Muchnick's Advanced Compiler Design and Implementation, section\n * 13.1 (p378).\n *\/\n\nnamespace {\nstruct aeb_entry : public exec_node {\n \/** The instruction that generates the expression value. *\/\n vec4_instruction *generator;\n\n \/** The temporary where the value is stored. *\/\n src_reg tmp;\n};\n}\n\nstatic bool\nis_expression(const vec4_instruction *const inst)\n{\n switch (inst->opcode) {\n case BRW_OPCODE_SEL:\n case BRW_OPCODE_NOT:\n case BRW_OPCODE_AND:\n case BRW_OPCODE_OR:\n case BRW_OPCODE_XOR:\n case BRW_OPCODE_SHR:\n case BRW_OPCODE_SHL:\n case BRW_OPCODE_ASR:\n case BRW_OPCODE_CMP:\n case BRW_OPCODE_CMPN:\n case BRW_OPCODE_ADD:\n case BRW_OPCODE_MUL:\n case BRW_OPCODE_FRC:\n case BRW_OPCODE_RNDU:\n case BRW_OPCODE_RNDD:\n case BRW_OPCODE_RNDE:\n case BRW_OPCODE_RNDZ:\n case BRW_OPCODE_LINE:\n case BRW_OPCODE_PLN:\n case BRW_OPCODE_MAD:\n case BRW_OPCODE_LRP:\n return true;\n case SHADER_OPCODE_RCP:\n case SHADER_OPCODE_RSQ:\n case SHADER_OPCODE_SQRT:\n case SHADER_OPCODE_EXP2:\n case SHADER_OPCODE_LOG2:\n case SHADER_OPCODE_POW:\n case SHADER_OPCODE_INT_QUOTIENT:\n case SHADER_OPCODE_INT_REMAINDER:\n case SHADER_OPCODE_SIN:\n case SHADER_OPCODE_COS:\n return inst->mlen == 0;\n default:\n return false;\n }\n}\n\nstatic bool\nis_expression_commutative(enum opcode op)\n{\n switch (op) {\n case BRW_OPCODE_AND:\n case BRW_OPCODE_OR:\n case BRW_OPCODE_XOR:\n case BRW_OPCODE_ADD:\n case BRW_OPCODE_MUL:\n return true;\n default:\n return false;\n }\n}\n\nstatic bool\noperands_match(enum opcode op, src_reg *xs, src_reg *ys)\n{\n if (!is_expression_commutative(op)) {\n return xs[0].equals(ys[0]) && xs[1].equals(ys[1]) && xs[2].equals(ys[2]);\n } else {\n return (xs[0].equals(ys[0]) && xs[1].equals(ys[1])) ||\n (xs[1].equals(ys[0]) && xs[0].equals(ys[1]));\n }\n}\n\nstatic bool\ninstructions_match(vec4_instruction *a, vec4_instruction *b)\n{\n return a->opcode == b->opcode &&\n a->saturate == b->saturate &&\n a->conditional_mod == b->conditional_mod &&\n a->dst.type == b->dst.type &&\n a->dst.writemask == b->dst.writemask &&\n operands_match(a->opcode, a->src, b->src);\n}\n\nbool\nvec4_visitor::opt_cse_local(bblock_t *block)\n{\n bool progress = false;\n exec_list aeb;\n\n void *cse_ctx = ralloc_context(NULL);\n\n int ip = block->start_ip;\n foreach_inst_in_block (vec4_instruction, inst, block) {\n \/* Skip some cases. *\/\n if (is_expression(inst) && !inst->predicate && inst->mlen == 0 &&\n (inst->dst.file != HW_REG || inst->dst.is_null()))\n {\n bool found = false;\n\n foreach_in_list_use_after(aeb_entry, entry, &aeb) {\n \/* Match current instruction's expression against those in AEB. *\/\n if (instructions_match(inst, entry->generator)) {\n found = true;\n progress = true;\n break;\n }\n }\n\n if (!found) {\n \/* Our first sighting of this expression. Create an entry. *\/\n aeb_entry *entry = ralloc(cse_ctx, aeb_entry);\n entry->tmp = src_reg(); \/* file will be BAD_FILE *\/\n entry->generator = inst;\n aeb.push_tail(entry);\n } else {\n \/* This is at least our second sighting of this expression.\n * If we don't have a temporary already, make one.\n *\/\n bool no_existing_temp = entry->tmp.file == BAD_FILE;\n if (no_existing_temp && !entry->generator->dst.is_null()) {\n entry->tmp = src_reg(this, glsl_type::float_type);\n entry->tmp.type = inst->dst.type;\n entry->tmp.swizzle = BRW_SWIZZLE_XYZW;\n\n vec4_instruction *copy = MOV(entry->generator->dst, entry->tmp);\n entry->generator->insert_after(copy);\n entry->generator->dst = dst_reg(entry->tmp);\n }\n\n \/* dest <- temp *\/\n if (!inst->dst.is_null()) {\n assert(inst->dst.type == entry->tmp.type);\n vec4_instruction *copy = MOV(inst->dst, entry->tmp);\n copy->force_writemask_all = inst->force_writemask_all;\n inst->insert_before(copy);\n }\n\n \/* Set our iterator so that next time through the loop inst->next\n * will get the instruction in the basic block after the one we've\n * removed.\n *\/\n vec4_instruction *prev = (vec4_instruction *)inst->prev;\n\n inst->remove();\n\n \/* Appending an instruction may have changed our bblock end. *\/\n if (inst == block->end) {\n block->end = prev;\n }\n\n inst = prev;\n }\n }\n\n foreach_in_list_safe(aeb_entry, entry, &aeb) {\n \/* Kill all AEB entries that write a different value to or read from\n * the flag register if we just wrote it.\n *\/\n if (inst->writes_flag()) {\n if (entry->generator->reads_flag() ||\n (entry->generator->writes_flag() &&\n !instructions_match(inst, entry->generator))) {\n entry->remove();\n ralloc_free(entry);\n continue;\n }\n }\n\n for (int i = 0; i < 3; i++) {\n src_reg *src = &entry->generator->src[i];\n\n \/* Kill all AEB entries that use the destination we just\n * overwrote.\n *\/\n if (inst->dst.file == entry->generator->src[i].file &&\n inst->dst.reg == entry->generator->src[i].reg) {\n entry->remove();\n ralloc_free(entry);\n break;\n }\n\n \/* Kill any AEB entries using registers that don't get reused any\n * more -- a sure sign they'll fail operands_match().\n *\/\n int last_reg_use = MAX2(MAX2(virtual_grf_end[src->reg * 4 + 0],\n virtual_grf_end[src->reg * 4 + 1]),\n MAX2(virtual_grf_end[src->reg * 4 + 2],\n virtual_grf_end[src->reg * 4 + 3]));\n if (src->file == GRF && last_reg_use < ip) {\n entry->remove();\n ralloc_free(entry);\n break;\n }\n }\n }\n\n ip++;\n }\n\n ralloc_free(cse_ctx);\n\n return progress;\n}\n\nbool\nvec4_visitor::opt_cse()\n{\n bool progress = false;\n\n calculate_live_intervals();\n\n for (int b = 0; b < cfg->num_blocks; b++) {\n bblock_t *block = cfg->blocks[b];\n\n progress = opt_cse_local(block) || progress;\n }\n\n if (progress)\n invalidate_live_intervals();\n\n return progress;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the Qt Quick Controls module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qtmenupopupwindow_p.h\"\n#include \"qtmenu_p.h\"\n#include <QtGui\/QGuiApplication>\n#include <QtCore\/QEvent>\n\nQT_BEGIN_NAMESPACE\n\nQtMenuPopupWindow::QtMenuPopupWindow(QWindow *parent) :\n QQuickWindow(parent), m_mouseMoved(false), m_itemAt(0)\n{\n setFlags(Qt::Popup);\n setModality(Qt::WindowModal);\n}\n\nvoid QtMenuPopupWindow::setMenuContentItem(QQuickItem *contentItem)\n{\n if (!contentItem)\n return;\n\n contentItem->setParentItem(this->contentItem());\n connect(contentItem, SIGNAL(widthChanged()), this, SLOT(updateSize()));\n connect(contentItem, SIGNAL(heightChanged()), this, SLOT(updateSize()));\n}\n\nvoid QtMenuPopupWindow::setItemAt(const QQuickItem *menuItem)\n{\n if (m_itemAt) {\n disconnect(m_itemAt, SIGNAL(xChanged()), this, SLOT(updatePosition()));\n disconnect(m_itemAt, SIGNAL(yChanged()), this, SLOT(updatePosition()));\n }\n\n m_itemAt = menuItem;\n if (menuItem) {\n m_oldItemPos = menuItem->position().toPoint();\n connect(menuItem, SIGNAL(xChanged()), this, SLOT(updatePosition()));\n connect(menuItem, SIGNAL(yChanged()), this, SLOT(updatePosition()));\n }\n}\n\nvoid QtMenuPopupWindow::setParentWindow(QQuickWindow *parentWindow)\n{\n setTransientParent(parentWindow);\n if (parentWindow) {\n connect(parentWindow, SIGNAL(destroyed()), this, SLOT(dismissMenu()));\n if (QtMenuPopupWindow *pw = qobject_cast<QtMenuPopupWindow *>(parentWindow))\n connect(this, SIGNAL(menuDismissed()), pw, SLOT(dismissMenu()));\n }\n}\n\nvoid QtMenuPopupWindow::dismissMenu()\n{\n close();\n\n emit menuDismissed();\n}\n\nvoid QtMenuPopupWindow::updateSize()\n{\n QSize contentSize = contentItem()->childrenRect().size().toSize();\n setWidth(contentSize.width());\n setHeight(contentSize.height());\n}\n\nvoid QtMenuPopupWindow::updatePosition()\n{\n QPointF newPos = position() + m_oldItemPos - m_itemAt->position();\n setPosition(newPos.toPoint());\n}\n\nvoid QtMenuPopupWindow::mouseMoveEvent(QMouseEvent *e)\n{\n QRect rect = QRect(QPoint(), size());\n if (rect.contains(e->pos())) {\n m_mouseMoved = true;\n QQuickWindow::mouseMoveEvent(e);\n } else {\n forwardEventToTransientParent(e);\n }\n}\n\nvoid QtMenuPopupWindow::mouseReleaseEvent(QMouseEvent *e)\n{\n QRect rect = QRect(QPoint(), size());\n if (rect.contains(e->pos())) {\n if (m_mouseMoved) {\n QMouseEvent pe = QMouseEvent(QEvent::MouseButtonPress, e->pos(), e->button(), e->buttons(), e->modifiers());\n QQuickWindow::mousePressEvent(&pe);\n QQuickWindow::mouseReleaseEvent(e);\n }\n } else {\n forwardEventToTransientParent(e);\n }\n}\n\nvoid QtMenuPopupWindow::forwardEventToTransientParent(QMouseEvent *e)\n{\n QWindow *parentMenuWindow = qobject_cast<QtMenuPopupWindow*>(transientParent());\n if (!parentMenuWindow) {\n if (m_mouseMoved && e->type() == QEvent::MouseButtonRelease)\n dismissMenu();\n } else {\n QPoint parentPos = parentMenuWindow->mapFromGlobal(mapToGlobal(e->pos()));\n QMouseEvent pe = QMouseEvent(e->type(), parentPos, e->button(), e->buttons(), e->modifiers());\n QGuiApplication::sendEvent(parentMenuWindow, &pe);\n }\n}\n\nQT_END_NAMESPACE\n<commit_msg>Menu: Fix closing popup menu by clicking outside<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the Qt Quick Controls module of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"qtmenupopupwindow_p.h\"\n#include \"qtmenu_p.h\"\n#include <QtGui\/QGuiApplication>\n#include <QtCore\/QEvent>\n\nQT_BEGIN_NAMESPACE\n\nQtMenuPopupWindow::QtMenuPopupWindow(QWindow *parent) :\n QQuickWindow(parent), m_mouseMoved(false), m_itemAt(0)\n{\n setFlags(Qt::Popup);\n setModality(Qt::WindowModal);\n}\n\nvoid QtMenuPopupWindow::setMenuContentItem(QQuickItem *contentItem)\n{\n if (!contentItem)\n return;\n\n contentItem->setParentItem(this->contentItem());\n connect(contentItem, SIGNAL(widthChanged()), this, SLOT(updateSize()));\n connect(contentItem, SIGNAL(heightChanged()), this, SLOT(updateSize()));\n}\n\nvoid QtMenuPopupWindow::setItemAt(const QQuickItem *menuItem)\n{\n if (m_itemAt) {\n disconnect(m_itemAt, SIGNAL(xChanged()), this, SLOT(updatePosition()));\n disconnect(m_itemAt, SIGNAL(yChanged()), this, SLOT(updatePosition()));\n }\n\n m_itemAt = menuItem;\n if (menuItem) {\n m_oldItemPos = menuItem->position().toPoint();\n connect(menuItem, SIGNAL(xChanged()), this, SLOT(updatePosition()));\n connect(menuItem, SIGNAL(yChanged()), this, SLOT(updatePosition()));\n }\n}\n\nvoid QtMenuPopupWindow::setParentWindow(QQuickWindow *parentWindow)\n{\n setTransientParent(parentWindow);\n if (parentWindow) {\n connect(parentWindow, SIGNAL(destroyed()), this, SLOT(dismissMenu()));\n if (QtMenuPopupWindow *pw = qobject_cast<QtMenuPopupWindow *>(parentWindow))\n connect(this, SIGNAL(menuDismissed()), pw, SLOT(dismissMenu()));\n }\n}\n\nvoid QtMenuPopupWindow::dismissMenu()\n{\n close();\n\n emit menuDismissed();\n}\n\nvoid QtMenuPopupWindow::updateSize()\n{\n QSize contentSize = contentItem()->childrenRect().size().toSize();\n setWidth(contentSize.width());\n setHeight(contentSize.height());\n}\n\nvoid QtMenuPopupWindow::updatePosition()\n{\n QPointF newPos = position() + m_oldItemPos - m_itemAt->position();\n setPosition(newPos.toPoint());\n}\n\nvoid QtMenuPopupWindow::mouseMoveEvent(QMouseEvent *e)\n{\n QRect rect = QRect(QPoint(), size());\n m_mouseMoved = true;\n if (rect.contains(e->pos()))\n QQuickWindow::mouseMoveEvent(e);\n else\n forwardEventToTransientParent(e);\n}\n\nvoid QtMenuPopupWindow::mouseReleaseEvent(QMouseEvent *e)\n{\n QRect rect = QRect(QPoint(), size());\n if (rect.contains(e->pos())) {\n if (m_mouseMoved) {\n QMouseEvent pe = QMouseEvent(QEvent::MouseButtonPress, e->pos(), e->button(), e->buttons(), e->modifiers());\n QQuickWindow::mousePressEvent(&pe);\n QQuickWindow::mouseReleaseEvent(e);\n }\n } else {\n forwardEventToTransientParent(e);\n }\n}\n\nvoid QtMenuPopupWindow::forwardEventToTransientParent(QMouseEvent *e)\n{\n QWindow *parentMenuWindow = qobject_cast<QtMenuPopupWindow*>(transientParent());\n if (!parentMenuWindow) {\n if (m_mouseMoved && e->type() == QEvent::MouseButtonRelease)\n dismissMenu();\n } else {\n QPoint parentPos = parentMenuWindow->mapFromGlobal(mapToGlobal(e->pos()));\n QMouseEvent pe = QMouseEvent(e->type(), parentPos, e->button(), e->buttons(), e->modifiers());\n QGuiApplication::sendEvent(parentMenuWindow, &pe);\n }\n}\n\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>\/* The Next Great Finite Element Library. *\/\n\/* Copyright (C) 2003 Benjamin S. Kirk *\/\n\n\/* This library is free software; you can redistribute it and\/or *\/\n\/* modify it under the terms of the GNU Lesser General Public *\/\n\/* License as published by the Free Software Foundation; either *\/\n\/* version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This library is distributed in the hope that it will be useful, *\/\n\/* but WITHOUT ANY WARRANTY; without even the implied warranty of *\/\n\/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *\/\n\/* Lesser General Public License for more details. *\/\n\n\/* You should have received a copy of the GNU Lesser General Public *\/\n\/* License along with this library; if not, write to the Free Software *\/\n\/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\n\/\/ <h1>Miscellaneous Example 8 - Meshfree Interpolation Utilities.<\/h1>\n\/\/\n\/\/ LibMesh provides some utilities for pointcloud-type interpolation, as \n\/\/ demonstrated in this example.\n\n\/\/ Example include files\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/meshfree_interpolation.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/tecplot_io.h\"\n#include \"libmesh\/threads.h\"\n#include \"meshless_interpolation_function.h\"\n\n\/\/ C++ includes\n#include <cstdlib>\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\nvoid create_random_point_cloud (const unsigned int Npts,\n\t\t\t\tstd::vector<Point> &pts,\n\t\t\t\tconst Real max_range = 10)\n{\n std::cout << \"Generating \"<< Npts << \" point cloud...\";\n pts.resize(Npts);\n\n for (size_t i=0;i<Npts;i++)\n {\n pts[i](0) = max_range * (std::rand() % 1000) \/ Real(1000);\n pts[i](1) = max_range * (std::rand() % 1000) \/ Real(1000);\n pts[i](2) = max_range * (std::rand() % 1000) \/ Real(1000);\n }\n std::cout << \"done\\n\";\n}\n\n\n\nReal exact_solution_u (const Point &p)\n{\n const Real\n x = p(0),\n y = p(1),\n z = p(2);\n \n return (x*x*x +\n\t y*y*y*y +\n\t z*z*z*z*z);\n}\n\n\n\nReal exact_solution_v (const Point &p)\n{\n const Real\n x = p(0),\n y = p(1),\n z = p(2);\n \n return (x*x +\n\t y*y +\n\t z*z*z);\n}\n\nNumber exact_value (const Point& p,\n const Parameters&,\n const std::string&,\n const std::string&)\n{\n return exact_solution_v(p);\n}\n\n\/\/ We now define the function which provides the\n\/\/ initialization routines for the \"Convection-Diffusion\"\n\/\/ system. This handles things like setting initial\n\/\/ conditions and boundary conditions.\nvoid init_sys(EquationSystems& es,\n const std::string& system_name)\n{\n \/\/ Get a reference to the Convection-Diffusion system object.\n System & system =\n es.get_system<System>(system_name);\n \n system.project_solution(exact_value, NULL, es.parameters);\n}\n\n\n\n\nint main(int argc, char** argv)\n{\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n {\n \/\/ Demonstration case 1\n {\n std::vector<Point> tgt_pts;\n std::vector<Number> tgt_data;\n std::vector<std::string> field_vars;\n \n field_vars.push_back(\"u\");\n field_vars.push_back(\"v\");\n \n InverseDistanceInterpolation<3> idi (\/* n_interp_pts = *\/ 8,\n\t\t\t\t\t \/* power = *\/ 2);\n \n idi.set_field_variables (field_vars);\n \n create_random_point_cloud (1e5,\n\t\t\t\t idi.get_source_points());\n \n \/\/ Explicitly set the data values we will interpolate from\n {\n\tconst std::vector<Point> &src_pts (idi.get_source_points());\n\tstd::vector<Real> &src_vals (idi.get_source_vals());\n\t\n\tsrc_vals.clear(); src_vals.reserve(src_pts.size());\n\t\n\tfor (std::vector<Point>::const_iterator pt_it=src_pts.begin();\n\t pt_it != src_pts.end(); ++pt_it)\n\t {\n\t src_vals.push_back (exact_solution_u (*pt_it));\n\t src_vals.push_back (exact_solution_v (*pt_it));\n\t }\t \n }\n\n std::cout << idi;\n \n \/\/ Interpolate to some other random points, and evaluate the result\n {\n\tcreate_random_point_cloud (10,\n\t\t\t\t tgt_pts);\n\t\n\tidi.interpolate_field_data (field_vars,\n\t\t\t\t tgt_pts,\n\t\t\t\t tgt_data);\n\t\n \n\tstd::vector<Number>::const_iterator v_it=tgt_data.begin();\n\t\n\tfor (std::vector<Point>::const_iterator p_it=tgt_pts.begin();\n\t p_it!=tgt_pts.end(); ++p_it)\n\t {\n\t std::cout << \"\\nAt target point \" << *p_it\n\t\t << \"\\n u_interp=\" << *v_it\n\t\t << \", u_exact=\" << exact_solution_u(*p_it);\n\t ++v_it;\n\t std::cout << \"\\n v_interp=\" << *v_it\n\t\t << \", v_exact=\" << exact_solution_v(*p_it)\n\t\t << std::endl;\n\t ++v_it;\n\t }\n }\n }\n\n\n \/\/ Demonstration case 2\n {\n Mesh mesh_a, mesh_b;\n\n mesh_a.read(\"struct.ucd.gz\"); mesh_b.read(\"unstruct.ucd.gz\");\n\n \/\/ Create equation systems objects.\n EquationSystems\n\tes_a(mesh_a), es_b(mesh_b);\n\n System\n\t&sys_a = es_a.add_system<System>(\"src_system\"),\n\t&sys_b = es_b.add_system<System>(\"dest_system\");\n\n sys_a.add_variable (\"Cp\", FIRST);\n sys_b.add_variable (\"Cp\", FIRST);\n\n sys_a.attach_init_function (init_sys);\n es_a.init();\n \n \/\/ Write out the initial conditions.\n TecplotIO(mesh_a).write_equation_systems (\"src.dat\",\n\t\t\t\t\t\tes_a);\n\n InverseDistanceInterpolation<3> idi (\/* n_interp_pts = *\/ 4,\n\t\t\t\t\t \/* power = *\/ 2);\n\n std::vector<Point> &src_pts (idi.get_source_points());\n std::vector<Number> &src_vals (idi.get_source_vals());\n std::vector<std::string> field_vars; \n field_vars.push_back(\"Cp\");\n idi.set_field_variables(field_vars);\n\n \/\/ We now will loop over every node in the source mesh\n \/\/ and add it to a source point list, along with the solution\n {\n\tMeshBase::const_node_iterator nd = mesh_a.local_nodes_begin();\n\tMeshBase::const_node_iterator end = mesh_a.local_nodes_end();\n\n\tfor (; nd!=end; ++nd)\n\t {\n\t const Node *node(*nd);\n\t src_pts.push_back(*node);\n\t src_vals.push_back(sys_a.current_solution(node->dof_number(0,0,0)));\n\t }\t \t\n }\n\n \/\/ We have only set local values - prepare for use by gathering remote gata\n idi.prepare_for_use();\n\n \/\/ Create a MeshlessInterpolationFunction that uses our InverseDistanceInterpolation\n \/\/ object. Since each MeshlessInterpolationFunction shares the same InverseDistanceInterpolation\n \/\/ object in a threaded environment we must also provide a locking mechanism.\n Threads::spin_mutex mutex;\n MeshlessInterpolationFunction mif(idi, mutex);\n\n \/\/ project the solution onto system b\n es_b.init();\n sys_b.project_solution (&mif);\n \n \/\/ Write the result\n TecplotIO(mesh_b).write_equation_systems (\"dest.dat\",\n\t\t\t\t\t\tes_b);\n }\n\n\n \n }\n return 0;\n}\n<commit_msg>skip for DIM=1,2<commit_after>\/* The Next Great Finite Element Library. *\/\n\/* Copyright (C) 2003 Benjamin S. Kirk *\/\n\n\/* This library is free software; you can redistribute it and\/or *\/\n\/* modify it under the terms of the GNU Lesser General Public *\/\n\/* License as published by the Free Software Foundation; either *\/\n\/* version 2.1 of the License, or (at your option) any later version. *\/\n\n\/* This library is distributed in the hope that it will be useful, *\/\n\/* but WITHOUT ANY WARRANTY; without even the implied warranty of *\/\n\/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *\/\n\/* Lesser General Public License for more details. *\/\n\n\/* You should have received a copy of the GNU Lesser General Public *\/\n\/* License along with this library; if not, write to the Free Software *\/\n\/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\n\/\/ <h1>Miscellaneous Example 8 - Meshfree Interpolation Utilities.<\/h1>\n\/\/\n\/\/ LibMesh provides some utilities for pointcloud-type interpolation, as \n\/\/ demonstrated in this example.\n\n\/\/ Example include files\n#include \"libmesh\/libmesh.h\"\n#include \"libmesh\/meshfree_interpolation.h\"\n#include \"libmesh\/mesh.h\"\n#include \"libmesh\/equation_systems.h\"\n#include \"libmesh\/numeric_vector.h\"\n#include \"libmesh\/tecplot_io.h\"\n#include \"libmesh\/threads.h\"\n#include \"meshless_interpolation_function.h\"\n\n\/\/ C++ includes\n#include <cstdlib>\n\n\n\/\/ Bring in everything from the libMesh namespace\nusing namespace libMesh;\n\n\nvoid create_random_point_cloud (const unsigned int Npts,\n\t\t\t\tstd::vector<Point> &pts,\n\t\t\t\tconst Real max_range = 10)\n{\n std::cout << \"Generating \"<< Npts << \" point cloud...\";\n pts.resize(Npts);\n\n for (size_t i=0;i<Npts;i++)\n {\n pts[i](0) = max_range * (std::rand() % 1000) \/ Real(1000);\n pts[i](1) = max_range * (std::rand() % 1000) \/ Real(1000);\n pts[i](2) = max_range * (std::rand() % 1000) \/ Real(1000);\n }\n std::cout << \"done\\n\";\n}\n\n\n\nReal exact_solution_u (const Point &p)\n{\n const Real\n x = p(0),\n y = p(1),\n z = p(2);\n \n return (x*x*x +\n\t y*y*y*y +\n\t z*z*z*z*z);\n}\n\n\n\nReal exact_solution_v (const Point &p)\n{\n const Real\n x = p(0),\n y = p(1),\n z = p(2);\n \n return (x*x +\n\t y*y +\n\t z*z*z);\n}\n\nNumber exact_value (const Point& p,\n const Parameters&,\n const std::string&,\n const std::string&)\n{\n return exact_solution_v(p);\n}\n\n\/\/ We now define the function which provides the\n\/\/ initialization routines for the \"Convection-Diffusion\"\n\/\/ system. This handles things like setting initial\n\/\/ conditions and boundary conditions.\nvoid init_sys(EquationSystems& es,\n const std::string& system_name)\n{\n \/\/ Get a reference to the Convection-Diffusion system object.\n System & system =\n es.get_system<System>(system_name);\n \n system.project_solution(exact_value, NULL, es.parameters);\n}\n\n\n\n\nint main(int argc, char** argv)\n{\n#if LIBMESH_DIM != 3\n std::cout << \"This example requires 3D support - skipping.\\n\";\n return 77;\n#endif\n\n \/\/ Initialize libMesh.\n LibMeshInit init (argc, argv);\n {\n \/\/ Demonstration case 1\n {\n std::vector<Point> tgt_pts;\n std::vector<Number> tgt_data;\n std::vector<std::string> field_vars;\n \n field_vars.push_back(\"u\");\n field_vars.push_back(\"v\");\n \n InverseDistanceInterpolation<3> idi (\/* n_interp_pts = *\/ 8,\n\t\t\t\t\t \/* power = *\/ 2);\n \n idi.set_field_variables (field_vars);\n \n create_random_point_cloud (1e5,\n\t\t\t\t idi.get_source_points());\n \n \/\/ Explicitly set the data values we will interpolate from\n {\n\tconst std::vector<Point> &src_pts (idi.get_source_points());\n\tstd::vector<Real> &src_vals (idi.get_source_vals());\n\t\n\tsrc_vals.clear(); src_vals.reserve(src_pts.size());\n\t\n\tfor (std::vector<Point>::const_iterator pt_it=src_pts.begin();\n\t pt_it != src_pts.end(); ++pt_it)\n\t {\n\t src_vals.push_back (exact_solution_u (*pt_it));\n\t src_vals.push_back (exact_solution_v (*pt_it));\n\t }\t \n }\n\n std::cout << idi;\n \n \/\/ Interpolate to some other random points, and evaluate the result\n {\n\tcreate_random_point_cloud (10,\n\t\t\t\t tgt_pts);\n\t\n\tidi.interpolate_field_data (field_vars,\n\t\t\t\t tgt_pts,\n\t\t\t\t tgt_data);\n\t\n \n\tstd::vector<Number>::const_iterator v_it=tgt_data.begin();\n\t\n\tfor (std::vector<Point>::const_iterator p_it=tgt_pts.begin();\n\t p_it!=tgt_pts.end(); ++p_it)\n\t {\n\t std::cout << \"\\nAt target point \" << *p_it\n\t\t << \"\\n u_interp=\" << *v_it\n\t\t << \", u_exact=\" << exact_solution_u(*p_it);\n\t ++v_it;\n\t std::cout << \"\\n v_interp=\" << *v_it\n\t\t << \", v_exact=\" << exact_solution_v(*p_it)\n\t\t << std::endl;\n\t ++v_it;\n\t }\n }\n }\n\n\n \/\/ Demonstration case 2\n {\n Mesh mesh_a, mesh_b;\n\n mesh_a.read(\"struct.ucd.gz\"); mesh_b.read(\"unstruct.ucd.gz\");\n\n \/\/ Create equation systems objects.\n EquationSystems\n\tes_a(mesh_a), es_b(mesh_b);\n\n System\n\t&sys_a = es_a.add_system<System>(\"src_system\"),\n\t&sys_b = es_b.add_system<System>(\"dest_system\");\n\n sys_a.add_variable (\"Cp\", FIRST);\n sys_b.add_variable (\"Cp\", FIRST);\n\n sys_a.attach_init_function (init_sys);\n es_a.init();\n \n \/\/ Write out the initial conditions.\n TecplotIO(mesh_a).write_equation_systems (\"src.dat\",\n\t\t\t\t\t\tes_a);\n\n InverseDistanceInterpolation<3> idi (\/* n_interp_pts = *\/ 4,\n\t\t\t\t\t \/* power = *\/ 2);\n\n std::vector<Point> &src_pts (idi.get_source_points());\n std::vector<Number> &src_vals (idi.get_source_vals());\n std::vector<std::string> field_vars; \n field_vars.push_back(\"Cp\");\n idi.set_field_variables(field_vars);\n\n \/\/ We now will loop over every node in the source mesh\n \/\/ and add it to a source point list, along with the solution\n {\n\tMeshBase::const_node_iterator nd = mesh_a.local_nodes_begin();\n\tMeshBase::const_node_iterator end = mesh_a.local_nodes_end();\n\n\tfor (; nd!=end; ++nd)\n\t {\n\t const Node *node(*nd);\n\t src_pts.push_back(*node);\n\t src_vals.push_back(sys_a.current_solution(node->dof_number(0,0,0)));\n\t }\t \t\n }\n\n \/\/ We have only set local values - prepare for use by gathering remote gata\n idi.prepare_for_use();\n\n \/\/ Create a MeshlessInterpolationFunction that uses our InverseDistanceInterpolation\n \/\/ object. Since each MeshlessInterpolationFunction shares the same InverseDistanceInterpolation\n \/\/ object in a threaded environment we must also provide a locking mechanism.\n Threads::spin_mutex mutex;\n MeshlessInterpolationFunction mif(idi, mutex);\n\n \/\/ project the solution onto system b\n es_b.init();\n sys_b.project_solution (&mif);\n \n \/\/ Write the result\n TecplotIO(mesh_b).write_equation_systems (\"dest.dat\",\n\t\t\t\t\t\tes_b);\n }\n\n\n \n }\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"compile.h\"\n#include <algorithm>\n#include <cassert>\n#include <functional>\n#include <map>\n#include <memory>\n#include <string>\n#include <vector>\n#include <iostream>\n\nnamespace {\n\nclass VarMap\n{\npublic:\n\tVarMap(std::shared_ptr<VarMap> parent, const std::vector<std::string>& vars)\n\t\t: parent(parent), vars(vars) {}\n\n\tbool resolve(const std::string& var, int* depth, int* index) const {\n\t\tauto it = std::find(vars.begin(), vars.end(), var);\n\t\tif(it != vars.end()) {\n\t\t\t*depth = 0;\n\t\t\t*index = it - vars.begin();\n\t\t\treturn true;\n\t\t}\n\t\tbool b = parent->resolve(var, depth, index);\n\t\tif(b)\n\t\t\t++*depth;\n\t\treturn b;\n\t}\n\nprivate:\n\tconst std::shared_ptr<VarMap> parent;\n\tstd::vector<std::string> vars;\n};\n\nstruct Context\n{\n\tconst std::shared_ptr<VarMap> varmap;\n\tconst std::shared_ptr<std::vector<gcc::OperationSequence>> codeblocks;\n\n\tint AddCodeBlock(const gcc::OperationSequence& ops) const {\n\t\tint id = codeblocks->size();\n\t\tcodeblocks->push_back(ops);\n\t\treturn id;\n\t}\n};\n\nstd::vector<std::string> verify_lambda_param_node(ast::AST ast) {\n\tassert(ast->type == ast::LIST);\n\n\tstd::vector<std::string> vars;\n\tfor(int i=0; i<ast->list.size(); ++i) {\n\t\tassert(ast->list[i]->type == ast::SYMBOL);\n\t\tvars.push_back(ast->list[i]->symbol);\n\t}\n\treturn vars;\n}\n\ngcc::OperationSequence rec(ast::AST ast, const Context& ctx)\n{\n\tauto compile_op2 = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[2], ctx));\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\tauto compile_op2_rev = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx)); \/\/ note: reversed\n\t\tgcc::Append(&ops, rec(ast->list[2], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\tauto compile_op1 = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 2);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\n\tswitch(ast->type) {\n\t\tcase ast::VALUE: {\n\t\t\t\/\/ constant\n\t\t\tgcc::OperationSequence ops;\n\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDC>(ast->value));\n\t\t\treturn ops;\n\t\t}\n\t\tcase ast::SYMBOL: {\n\t\t\t\/\/ variable\n\t\t\tint depth, index;\n\t\t\tif(!ctx.varmap->resolve(ast->symbol, &depth, &index))\n\t\t\t\tassert(false);\n\t\t\tgcc::OperationSequence ops;\n\t\t\tgcc:Append(&ops, std::make_shared<gcc::OpLD>(depth, index));\n\t\t\treturn ops;\n\t\t}\n\t\tcase ast::LIST: {\n\t\t\tif(ast->list.empty()) {\n\t\t\t\t\/\/ use as nil\n\t\t\t\tgcc::OperationSequence ops;\n\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDC>(0));\n\t\t\t\treturn ops;\n\t\t\t} else if(ast->list.front()->type==ast::SYMBOL) {\n\t\t\t\t\/\/ special forms\n\t\t\t\tif(ast->list.front()->symbol == \"+\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpADD>());\n\t\t\t\tif(ast->list.front()->symbol == \"-\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpSUB>());\n\t\t\t\tif(ast->list.front()->symbol == \"*\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpMUL>());\n\t\t\t\tif(ast->list.front()->symbol == \"\/\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpDIV>());\n\t\t\t\tif(ast->list.front()->symbol == \"=\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCEQ>());\n\t\t\t\tif(ast->list.front()->symbol == \">\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCGT>());\n\t\t\t\tif(ast->list.front()->symbol == \">=\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCGTE>());\n\t\t\t\tif(ast->list.front()->symbol == \"<\")\n\t\t\t\t\treturn compile_op2_rev(std::make_shared<gcc::OpCGT>());\n\t\t\t\tif(ast->list.front()->symbol == \"<=\")\n\t\t\t\t\treturn compile_op2_rev(std::make_shared<gcc::OpCGTE>());\n\t\t\t\tif(ast->list.front()->symbol == \"int?\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpATOM>());\n\t\t\t\tif(ast->list.front()->symbol == \"cons\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCONS>());\n\t\t\t\tif(ast->list.front()->symbol == \"car\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpCAR>());\n\t\t\t\tif(ast->list.front()->symbol == \"cdr\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpCDR>());\n\n\t\t\t\t\/\/ lambda\n\t\t\t\tif(ast->list.front()->symbol == \"lambda\") {\n\t\t\t\t\tassert(ast->list.size() == 3);\n\n\t\t\t\t\tstd::vector<std::string> vars = verify_lambda_param_node(ast->list[1]);\n\t\t\t\t\tstd::shared_ptr<VarMap> neo_varmap = std::make_shared<VarMap>(ctx.varmap, vars);\n\t\t\t\t\tContext neo_ctx = {neo_varmap, ctx.codeblocks};\n\n\t\t\t\t\tgcc::OperationSequence body_ops = rec(ast->list[2], neo_ctx);\n\t\t\t\t\tgcc::Append(&body_ops, std::make_shared<gcc::OpRTN>());\n\t\t\t\t\tint id = ctx.AddCodeBlock(body_ops);\n\n\t\t\t\t\tgcc::OperationSequence ops;\n\t\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDF>(id));\n\t\t\t\t\treturn ops;\n\t\t\t\t}\n\n\t\t\t\t\/\/ if\n\t\t\t\tif(ast->list.front()->symbol == \"if\") {\n\t\t\t\t\tassert(ast->list.size() == 4);\n\n\t\t\t\t\tgcc::OperationSequence ops = rec(ast->list[1], ctx);\n\t\t\t\t\tgcc::OperationSequence t_ops = rec(ast->list[2], ctx);\n\t\t\t\t\tgcc::Append(&t_ops, std::make_shared<gcc::OpJOIN>());\n\t\t\t\t\tint tid = ctx.AddCodeBlock(t_ops);\n\n\t\t\t\t\tgcc::OperationSequence e_ops = rec(ast->list[3], ctx);\n\t\t\t\t\tgcc::Append(&e_ops, std::make_shared<gcc::OpJOIN>());\n\t\t\t\t\tint eid = ctx.AddCodeBlock(e_ops);\n\n\t\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpSEL>(tid, eid));\n\t\t\t\t\treturn ops;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ general function applications\n\t\t\tgcc::OperationSequence ops;\n\t\t\tfor(int i=1; i<ast->list.size(); ++i)\n\t\t\t\tgcc::Append(&ops, rec(ast->list[i], ctx));\n\t\t\tgcc::Append(&ops, rec(ast->list[0], ctx));\n\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpAP>(ast->list.size() - 1));\n\t\t\treturn ops;\n\t\t}\n\t}\n\tassert(false);\n}\n\n} \/\/ namespace\n\nPreLink compile_expression(ast::AST ast)\n{\n\tstd::shared_ptr<VarMap> nil_varmap;\n\tauto codeblocks = std::make_shared<std::vector<gcc::OperationSequence>>();\n\tContext ctx = {nil_varmap, codeblocks};\n\tauto mainblock = rec(ast, ctx);\n\tPreLink result = {mainblock, *codeblocks};\n\treturn result;\n}\n\nPreLink compile_program(const std::vector<ast::AST> defines)\n{\n\tstd::map<std::string, std::pair<\n\t\tstd::vector<std::string>,\n\t\tast::AST\n\t>> funcs;\n\n\tfor(auto ast: defines)\n\t{\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\t\tassert(ast->list[0]->type == ast::SYMBOL);\n\t\tassert(ast->list[0]->symbol == \"define\");\n\t\tassert(ast->list[1]->type == ast::LIST);\n\t\tassert(ast->list[1]->list.size() >= 1);\n\t\tassert(ast->list[1]->list[0]->type == ast::SYMBOL);\n\t\tstd::string name = ast->list[1]->list[0]->symbol;\n\n\t\tstd::vector<std::string> params;\n\t\tfor(size_t i=1; i<ast->list[1]->list.size(); ++i) {\n\t\t\tassert(ast->list[1]->list[i]->type == ast::SYMBOL);\n\t\t\tparams.push_back(ast->list[1]->list[i]->symbol);\n\t\t}\n\n\t\tassert(funcs.count(name) == 0);\n\t\tfuncs[name] = std::make_pair(params, ast->list[2]);\n\t}\n\n\tstd::shared_ptr<VarMap> nil_varmap;\n\n\tstd::vector<std::string> init_vars = {\"arg1\", \"arg2\"};\n\tstd::shared_ptr<VarMap> init_varmap = std::make_shared<VarMap>(nil_varmap, init_vars);\n\n\tstd::vector<std::string> global_vars;\n\tfor(auto& kv: funcs)\n\t\tglobal_vars.push_back(kv.first);\n\tstd::shared_ptr<VarMap> global_varmap = std::make_shared<VarMap>(init_varmap, global_vars);\n\n\tauto codeblocks = std::make_shared<std::vector<gcc::OperationSequence>>();\n\n\tstd::vector<int> func_ids;\n\tint main_offset = -1, i=0;\n\tfor(auto& kv: funcs)\n\t{\n\t\tContext ctx = {\n\t\t\tstd::make_shared<VarMap>(global_varmap, kv.second.first),\n\t\t\tcodeblocks\n\t\t};\n\t\tauto body_ops = rec(kv.second.second, ctx);\n\t\tgcc::Append(&body_ops, std::make_shared<gcc::OpRTN>());\n\t\tint id = ctx.AddCodeBlock(body_ops);\n\t\tif(kv.first == \"main\")\n\t\t\tmain_offset = i;\n\t\tfunc_ids.push_back(id);\n\t\t++i;\n\t}\n\tassert(main_offset >= 0);\n\t\/\/ (define (__dummy_main__) (main))\n\tgcc::OperationSequence dummy_main_ops;\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpLD>(0,main_offset));\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpAP>(1));\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpRTN>());\n\tContext tmp_ctx = {nil_varmap, codeblocks};\n\tint dummy_main_id = tmp_ctx.AddCodeBlock(dummy_main_ops);\n\n\tgcc::OperationSequence prolog_ops;\n\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpDUM>(func_ids.size()));\n\tfor(int id: func_ids)\n\t\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpLDF>(id));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpLDF>(dummy_main_id));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpRAP>(func_ids.size()));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpRTN>());\n\n\tPreLink result = {prolog_ops, *codeblocks};\n\treturn result;\n}\n<commit_msg>fix argument passing order.<commit_after>#include \"compile.h\"\n#include <algorithm>\n#include <cassert>\n#include <functional>\n#include <map>\n#include <memory>\n#include <string>\n#include <vector>\n#include <iostream>\n\nnamespace {\n\nclass VarMap\n{\npublic:\n\tVarMap(std::shared_ptr<VarMap> parent, const std::vector<std::string>& vars)\n\t\t: parent(parent), vars(vars) {}\n\n\tbool resolve(const std::string& var, int* depth, int* index) const {\n\t\tauto it = std::find(vars.begin(), vars.end(), var);\n\t\tif(it != vars.end()) {\n\t\t\t*depth = 0;\n\t\t\t*index = it - vars.begin();\n\t\t\treturn true;\n\t\t}\n\t\tbool b = parent->resolve(var, depth, index);\n\t\tif(b)\n\t\t\t++*depth;\n\t\treturn b;\n\t}\n\nprivate:\n\tconst std::shared_ptr<VarMap> parent;\n\tstd::vector<std::string> vars;\n};\n\nstruct Context\n{\n\tconst std::shared_ptr<VarMap> varmap;\n\tconst std::shared_ptr<std::vector<gcc::OperationSequence>> codeblocks;\n\n\tint AddCodeBlock(const gcc::OperationSequence& ops) const {\n\t\tint id = codeblocks->size();\n\t\tcodeblocks->push_back(ops);\n\t\treturn id;\n\t}\n};\n\nstd::vector<std::string> verify_lambda_param_node(ast::AST ast) {\n\tassert(ast->type == ast::LIST);\n\n\tstd::vector<std::string> vars;\n\tfor(int i=0; i<ast->list.size(); ++i) {\n\t\tassert(ast->list[i]->type == ast::SYMBOL);\n\t\tvars.push_back(ast->list[i]->symbol);\n\t}\n\treturn vars;\n}\n\ngcc::OperationSequence rec(ast::AST ast, const Context& ctx)\n{\n\tauto compile_op2 = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx));\n\t\tgcc::Append(&ops, rec(ast->list[2], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\tauto compile_op2_rev = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[2], ctx)); \/\/ note: reversed\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\tauto compile_op1 = [&](std::shared_ptr<gcc::Op> op) {\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 2);\n\n\t\tgcc::OperationSequence ops;\n\t\tgcc::Append(&ops, rec(ast->list[1], ctx));\n\t\tgcc::Append(&ops, op);\n\t\treturn ops;\n\t};\n\n\tswitch(ast->type) {\n\t\tcase ast::VALUE: {\n\t\t\t\/\/ constant\n\t\t\tgcc::OperationSequence ops;\n\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDC>(ast->value));\n\t\t\treturn ops;\n\t\t}\n\t\tcase ast::SYMBOL: {\n\t\t\t\/\/ variable\n\t\t\tint depth, index;\n\t\t\tif(!ctx.varmap->resolve(ast->symbol, &depth, &index))\n\t\t\t\tassert(false);\n\t\t\tgcc::OperationSequence ops;\n\t\t\tgcc:Append(&ops, std::make_shared<gcc::OpLD>(depth, index));\n\t\t\treturn ops;\n\t\t}\n\t\tcase ast::LIST: {\n\t\t\tif(ast->list.empty()) {\n\t\t\t\t\/\/ use as nil\n\t\t\t\tgcc::OperationSequence ops;\n\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDC>(0));\n\t\t\t\treturn ops;\n\t\t\t} else if(ast->list.front()->type==ast::SYMBOL) {\n\t\t\t\t\/\/ special forms\n\t\t\t\tif(ast->list.front()->symbol == \"+\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpADD>());\n\t\t\t\tif(ast->list.front()->symbol == \"-\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpSUB>());\n\t\t\t\tif(ast->list.front()->symbol == \"*\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpMUL>());\n\t\t\t\tif(ast->list.front()->symbol == \"\/\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpDIV>());\n\t\t\t\tif(ast->list.front()->symbol == \"=\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCEQ>());\n\t\t\t\tif(ast->list.front()->symbol == \">\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCGT>());\n\t\t\t\tif(ast->list.front()->symbol == \">=\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCGTE>());\n\t\t\t\tif(ast->list.front()->symbol == \"<\")\n\t\t\t\t\treturn compile_op2_rev(std::make_shared<gcc::OpCGT>());\n\t\t\t\tif(ast->list.front()->symbol == \"<=\")\n\t\t\t\t\treturn compile_op2_rev(std::make_shared<gcc::OpCGTE>());\n\t\t\t\tif(ast->list.front()->symbol == \"int?\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpATOM>());\n\t\t\t\tif(ast->list.front()->symbol == \"cons\")\n\t\t\t\t\treturn compile_op2(std::make_shared<gcc::OpCONS>());\n\t\t\t\tif(ast->list.front()->symbol == \"car\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpCAR>());\n\t\t\t\tif(ast->list.front()->symbol == \"cdr\")\n\t\t\t\t\treturn compile_op1(std::make_shared<gcc::OpCDR>());\n\n\t\t\t\t\/\/ lambda\n\t\t\t\tif(ast->list.front()->symbol == \"lambda\") {\n\t\t\t\t\tassert(ast->list.size() == 3);\n\n\t\t\t\t\tstd::vector<std::string> vars = verify_lambda_param_node(ast->list[1]);\n\t\t\t\t\tstd::shared_ptr<VarMap> neo_varmap = std::make_shared<VarMap>(ctx.varmap, vars);\n\t\t\t\t\tContext neo_ctx = {neo_varmap, ctx.codeblocks};\n\n\t\t\t\t\tgcc::OperationSequence body_ops = rec(ast->list[2], neo_ctx);\n\t\t\t\t\tgcc::Append(&body_ops, std::make_shared<gcc::OpRTN>());\n\t\t\t\t\tint id = ctx.AddCodeBlock(body_ops);\n\n\t\t\t\t\tgcc::OperationSequence ops;\n\t\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpLDF>(id));\n\t\t\t\t\treturn ops;\n\t\t\t\t}\n\n\t\t\t\t\/\/ if\n\t\t\t\tif(ast->list.front()->symbol == \"if\") {\n\t\t\t\t\tassert(ast->list.size() == 4);\n\n\t\t\t\t\tgcc::OperationSequence ops = rec(ast->list[1], ctx);\n\t\t\t\t\tgcc::OperationSequence t_ops = rec(ast->list[2], ctx);\n\t\t\t\t\tgcc::Append(&t_ops, std::make_shared<gcc::OpJOIN>());\n\t\t\t\t\tint tid = ctx.AddCodeBlock(t_ops);\n\n\t\t\t\t\tgcc::OperationSequence e_ops = rec(ast->list[3], ctx);\n\t\t\t\t\tgcc::Append(&e_ops, std::make_shared<gcc::OpJOIN>());\n\t\t\t\t\tint eid = ctx.AddCodeBlock(e_ops);\n\n\t\t\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpSEL>(tid, eid));\n\t\t\t\t\treturn ops;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t\/\/ general function applications\n\t\t\tgcc::OperationSequence ops;\n\t\t\tfor(int i=1; i<ast->list.size(); ++i)\n\t\t\t\tgcc::Append(&ops, rec(ast->list[i], ctx));\n\t\t\tgcc::Append(&ops, rec(ast->list[0], ctx));\n\t\t\tgcc::Append(&ops, std::make_shared<gcc::OpAP>(ast->list.size() - 1));\n\t\t\treturn ops;\n\t\t}\n\t}\n\tassert(false);\n}\n\n} \/\/ namespace\n\nPreLink compile_expression(ast::AST ast)\n{\n\tstd::shared_ptr<VarMap> nil_varmap;\n\tauto codeblocks = std::make_shared<std::vector<gcc::OperationSequence>>();\n\tContext ctx = {nil_varmap, codeblocks};\n\tauto mainblock = rec(ast, ctx);\n\tPreLink result = {mainblock, *codeblocks};\n\treturn result;\n}\n\nPreLink compile_program(const std::vector<ast::AST> defines)\n{\n\tstd::map<std::string, std::pair<\n\t\tstd::vector<std::string>,\n\t\tast::AST\n\t>> funcs;\n\n\tfor(auto ast: defines)\n\t{\n\t\tassert(ast->type == ast::LIST);\n\t\tassert(ast->list.size() == 3);\n\t\tassert(ast->list[0]->type == ast::SYMBOL);\n\t\tassert(ast->list[0]->symbol == \"define\");\n\t\tassert(ast->list[1]->type == ast::LIST);\n\t\tassert(ast->list[1]->list.size() >= 1);\n\t\tassert(ast->list[1]->list[0]->type == ast::SYMBOL);\n\t\tstd::string name = ast->list[1]->list[0]->symbol;\n\n\t\tstd::vector<std::string> params;\n\t\tfor(size_t i=1; i<ast->list[1]->list.size(); ++i) {\n\t\t\tassert(ast->list[1]->list[i]->type == ast::SYMBOL);\n\t\t\tparams.push_back(ast->list[1]->list[i]->symbol);\n\t\t}\n\n\t\tassert(funcs.count(name) == 0);\n\t\tfuncs[name] = std::make_pair(params, ast->list[2]);\n\t}\n\n\tstd::shared_ptr<VarMap> nil_varmap;\n\n\tstd::vector<std::string> init_vars = {\"arg1\", \"arg2\"};\n\tstd::shared_ptr<VarMap> init_varmap = std::make_shared<VarMap>(nil_varmap, init_vars);\n\n\tstd::vector<std::string> global_vars;\n\tfor(auto& kv: funcs)\n\t\tglobal_vars.push_back(kv.first);\n\tstd::shared_ptr<VarMap> global_varmap = std::make_shared<VarMap>(init_varmap, global_vars);\n\n\tauto codeblocks = std::make_shared<std::vector<gcc::OperationSequence>>();\n\n\tstd::vector<int> func_ids;\n\tint main_offset = -1, i=0;\n\tfor(auto& kv: funcs)\n\t{\n\t\tContext ctx = {\n\t\t\tstd::make_shared<VarMap>(global_varmap, kv.second.first),\n\t\t\tcodeblocks\n\t\t};\n\t\tauto body_ops = rec(kv.second.second, ctx);\n\t\tgcc::Append(&body_ops, std::make_shared<gcc::OpRTN>());\n\t\tint id = ctx.AddCodeBlock(body_ops);\n\t\tif(kv.first == \"main\")\n\t\t\tmain_offset = i;\n\t\tfunc_ids.push_back(id);\n\t\t++i;\n\t}\n\tassert(main_offset >= 0);\n\t\/\/ (define (__dummy_main__) (main))\n\tgcc::OperationSequence dummy_main_ops;\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpLD>(0,main_offset));\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpAP>(0));\n\tgcc::Append(&dummy_main_ops, std::make_shared<gcc::OpRTN>());\n\tContext tmp_ctx = {nil_varmap, codeblocks};\n\tint dummy_main_id = tmp_ctx.AddCodeBlock(dummy_main_ops);\n\n\tgcc::OperationSequence prolog_ops;\n\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpDUM>(func_ids.size()));\n\tfor(int id: func_ids)\n\t\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpLDF>(id));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpLDF>(dummy_main_id));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpRAP>(func_ids.size()));\n\tgcc::Append(&prolog_ops, std::make_shared<gcc::OpRTN>());\n\n\tPreLink result = {prolog_ops, *codeblocks};\n\treturn result;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2013, 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file commander_helper.cpp\n * Commander helper functions implementations\n *\n * @author Thomas Gubler <thomasgubler@student.ethz.ch>\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\n *\/\n\n#include <px4_defines.h>\n#include <px4_posix.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <fcntl.h>\n#include <math.h>\n#include <string.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/vehicle_status.h>\n#include <uORB\/topics\/actuator_controls.h>\n#include <uORB\/topics\/vehicle_control_mode.h>\n#include <systemlib\/err.h>\n#include <systemlib\/param\/param.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_tone_alarm.h>\n#include <drivers\/drv_led.h>\n#include <drivers\/drv_rgbled.h>\n\n#include \"commander_helper.h\"\n#include \"DevMgr.hpp\"\n\nusing namespace DriverFramework;\n\n\/* oddly, ERROR is not defined for c++ *\/\n#ifdef ERROR\n# undef ERROR\n#endif\nstatic const int ERROR = -1;\n\n#define BLINK_MSG_TIME\t700000\t\/\/ 3 fast blinks\n\nbool is_multirotor(const struct vehicle_status_s *current_status)\n{\n\treturn ((current_status->system_type == vehicle_status_s::VEHICLE_TYPE_QUADROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HEXAROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_OCTOROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_TRICOPTER));\n}\n\nbool is_rotary_wing(const struct vehicle_status_s *current_status)\n{\n\treturn is_multirotor(current_status) || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HELICOPTER)\n\t || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_COAXIAL);\n}\n\nbool is_vtol(const struct vehicle_status_s * current_status) {\n\treturn (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_DUOROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_QUADROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_HEXAROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_OCTOROTOR);\n}\n\nstatic DevHandle h_buzzer;\nstatic hrt_abstime blink_msg_end = 0;\t\/\/ end time for currently blinking LED message, 0 if no blink message\nstatic hrt_abstime tune_end = 0;\t\t\/\/ end time of currently played tune, 0 for repeating tunes or silence\nstatic int tune_current = TONE_STOP_TUNE;\t\t\/\/ currently playing tune, can be interrupted after tune_end\nstatic unsigned int tune_durations[TONE_NUMBER_OF_TUNES];\n\nstatic param_t bat_v_empty_h;\nstatic param_t bat_v_full_h;\nstatic param_t bat_n_cells_h;\nstatic param_t bat_capacity_h;\nstatic param_t bat_v_load_drop_h;\nstatic float bat_v_empty = 3.4f;\nstatic float bat_v_full = 4.2f;\nstatic float bat_v_load_drop = 0.06f;\nstatic int bat_n_cells = 3;\nstatic float bat_capacity = -1.0f;\nstatic unsigned int counter = 0;\nstatic float throttle_lowpassed = 0.0f;\n\nint battery_init()\n{\n\tbat_v_empty_h = param_find(\"BAT_V_EMPTY\");\n\tbat_v_full_h = param_find(\"BAT_V_CHARGED\");\n\tbat_n_cells_h = param_find(\"BAT_N_CELLS\");\n\tbat_capacity_h = param_find(\"BAT_CAPACITY\");\n\tbat_v_load_drop_h = param_find(\"BAT_V_LOAD_DROP\");\n\n\treturn PX4_OK;\n}\n\nint buzzer_init()\n{\n\ttune_end = 0;\n\ttune_current = 0;\n\tmemset(tune_durations, 0, sizeof(tune_durations));\n\ttune_durations[TONE_NOTIFY_POSITIVE_TUNE] = 800000;\n\ttune_durations[TONE_NOTIFY_NEGATIVE_TUNE] = 900000;\n\ttune_durations[TONE_NOTIFY_NEUTRAL_TUNE] = 500000;\n\ttune_durations[TONE_ARMING_WARNING_TUNE] = 3000000;\n\n\tDevHandle h_buzzer;\n\tDevMgr::getHandle(TONEALARM0_DEVICE_PATH, h_buzzer);\n\n\tif (!h_buzzer.isValid()) {\n\t\tPX4_WARN(\"Buzzer: px4_open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\treturn PX4_OK;\n}\n\nvoid buzzer_deinit()\n{\n\tDevMgr::releaseHandle(h_buzzer);\n}\n\nvoid set_tune_override(int tune)\n{\n\th_buzzer.ioctl(TONE_SET_ALARM, tune);\n}\n\nvoid set_tune(int tune)\n{\n\tunsigned int new_tune_duration = tune_durations[tune];\n\n\t\/* don't interrupt currently playing non-repeating tune by repeating *\/\n\tif (tune_end == 0 || new_tune_duration != 0 || hrt_absolute_time() > tune_end) {\n\t\t\/* allow interrupting current non-repeating tune by the same tune *\/\n\t\tif (tune != tune_current || new_tune_duration != 0) {\n\t\t\th_buzzer.ioctl(TONE_SET_ALARM, tune);\n\t\t}\n\n\t\ttune_current = tune;\n\n\t\tif (new_tune_duration != 0) {\n\t\t\ttune_end = hrt_absolute_time() + new_tune_duration;\n\n\t\t} else {\n\t\t\ttune_end = 0;\n\t\t}\n\t}\n}\n\nvoid tune_home_set(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_HOME_SET);\n\t}\n}\n\nvoid tune_mission_ok(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\nvoid tune_mission_fail(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink green LED and play positive tune (if use_buzzer == true).\n *\/\nvoid tune_positive(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_POSITIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink white LED and play neutral tune (if use_buzzer == true).\n *\/\nvoid tune_neutral(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_WHITE);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\n\/**\n * Blink red LED and play negative tune (if use_buzzer == true).\n *\/\nvoid tune_negative(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_RED);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\nint blink_msg_state()\n{\n\tif (blink_msg_end == 0) {\n\t\treturn 0;\n\n\t} else if (hrt_absolute_time() > blink_msg_end) {\n\t\tblink_msg_end = 0;\n\t\treturn 2;\n\n\t} else {\n\t\treturn 1;\n\t}\n}\n\nstatic DevHandle h_leds;\nstatic DevHandle h_rgbleds;\n\nint led_init()\n{\n\tblink_msg_end = 0;\n\n\t\/* first open normal LEDs *\/\n\tDevMgr::getHandle(LED0_DEVICE_PATH, h_leds);\n\n\tif (!h_leds.isValid()) {\n\t\tPX4_WARN(\"LED: getHandle fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* the blue LED is only available on FMUv1 & AeroCore but not FMUv2 *\/\n\t(void)h_leds.ioctl(LED_ON, LED_BLUE);\n\n\t\/* switch blue off *\/\n\tled_off(LED_BLUE);\n\n\t\/* we consider the amber led mandatory *\/\n\tif (h_leds.ioctl(LED_ON, LED_AMBER)) {\n\t\tPX4_WARN(\"Amber LED: ioctl fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* switch amber off *\/\n\tled_off(LED_AMBER);\n\n\t\/* then try RGB LEDs, this can fail on FMUv1*\/\n\tDevHandle h;\n\tDevMgr::getHandle(RGBLED0_DEVICE_PATH, h_rgbleds);\n\n\tif (!h_rgbleds.isValid()) {\n\t\tPX4_WARN(\"No RGB LED found at \" RGBLED0_DEVICE_PATH);\n\t}\n\n\treturn 0;\n}\n\nvoid led_deinit()\n{\n\tDevMgr::releaseHandle(h_leds);\n\tDevMgr::releaseHandle(h_rgbleds);\n}\n\nint led_toggle(int led)\n{\n\treturn h_leds.ioctl(LED_TOGGLE, led);\n}\n\nint led_on(int led)\n{\n\treturn h_leds.ioctl(LED_ON, led);\n}\n\nint led_off(int led)\n{\n\treturn h_leds.ioctl(LED_OFF, led);\n}\n\nvoid rgbled_set_color(rgbled_color_t color)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_COLOR, (unsigned long)color);\n}\n\nvoid rgbled_set_mode(rgbled_mode_t mode)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_MODE, (unsigned long)mode);\n}\n\nvoid rgbled_set_pattern(rgbled_pattern_t *pattern)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_PATTERN, (unsigned long)pattern);\n}\n\nunsigned battery_get_n_cells() {\n\treturn bat_n_cells;\n}\n\nfloat battery_remaining_estimate_voltage(float voltage, float discharged, float throttle_normalized)\n{\n\tfloat ret = 0;\n\n\tif (counter % 100 == 0) {\n\t\tparam_get(bat_v_empty_h, &bat_v_empty);\n\t\tparam_get(bat_v_full_h, &bat_v_full);\n\t\tparam_get(bat_v_load_drop_h, &bat_v_load_drop);\n\t\tparam_get(bat_n_cells_h, &bat_n_cells);\n\t\tparam_get(bat_capacity_h, &bat_capacity);\n\t}\n\n\tcounter++;\n\n\t\/\/ XXX this time constant needs to become tunable\n\t\/\/ but really, the right fix are smart batteries.\n\tfloat val = throttle_lowpassed * 0.97f + throttle_normalized * 0.03f;\n\tif (PX4_ISFINITE(val)) {\n\t\tthrottle_lowpassed = val;\n\t}\n\n\t\/* remaining charge estimate based on voltage and internal resistance (drop under load) *\/\n\tfloat bat_v_empty_dynamic = bat_v_empty - (bat_v_load_drop * throttle_lowpassed);\n\t\/* the range from full to empty is the same for batteries under load and without load,\n\t * since the voltage drop applies to both the full and empty state\n\t *\/\n\tfloat voltage_range = (bat_v_full - bat_v_empty);\n\tfloat remaining_voltage = (voltage - (bat_n_cells * bat_v_empty_dynamic)) \/ (bat_n_cells * voltage_range);\n\n\tif (bat_capacity > 0.0f) {\n\t\t\/* if battery capacity is known, use discharged current for estimate, but don't show more than voltage estimate *\/\n\t\tret = fminf(remaining_voltage, 1.0f - discharged \/ bat_capacity);\n\n\t} else {\n\t\t\/* else use voltage *\/\n\t\tret = remaining_voltage;\n\t}\n\n\t\/* limit to sane values *\/\n\tret = (ret < 0.0f) ? 0.0f : ret;\n\tret = (ret > 1.0f) ? 1.0f : ret;\n\treturn ret;\n}\n<commit_msg>Commander: Fix dev handle init<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2013, 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file commander_helper.cpp\n * Commander helper functions implementations\n *\n * @author Thomas Gubler <thomasgubler@student.ethz.ch>\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\n *\/\n\n#include <px4_defines.h>\n#include <px4_posix.h>\n#include <stdio.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <fcntl.h>\n#include <math.h>\n#include <string.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/vehicle_status.h>\n#include <uORB\/topics\/actuator_controls.h>\n#include <uORB\/topics\/vehicle_control_mode.h>\n#include <systemlib\/err.h>\n#include <systemlib\/param\/param.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_tone_alarm.h>\n#include <drivers\/drv_led.h>\n#include <drivers\/drv_rgbled.h>\n\n#include \"commander_helper.h\"\n#include \"DevMgr.hpp\"\n\nusing namespace DriverFramework;\n\n\/* oddly, ERROR is not defined for c++ *\/\n#ifdef ERROR\n# undef ERROR\n#endif\nstatic const int ERROR = -1;\n\n#define BLINK_MSG_TIME\t700000\t\/\/ 3 fast blinks\n\nbool is_multirotor(const struct vehicle_status_s *current_status)\n{\n\treturn ((current_status->system_type == vehicle_status_s::VEHICLE_TYPE_QUADROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HEXAROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_OCTOROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_TRICOPTER));\n}\n\nbool is_rotary_wing(const struct vehicle_status_s *current_status)\n{\n\treturn is_multirotor(current_status) || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HELICOPTER)\n\t || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_COAXIAL);\n}\n\nbool is_vtol(const struct vehicle_status_s * current_status) {\n\treturn (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_DUOROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_QUADROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_HEXAROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_OCTOROTOR);\n}\n\nstatic hrt_abstime blink_msg_end = 0;\t\/\/ end time for currently blinking LED message, 0 if no blink message\nstatic hrt_abstime tune_end = 0;\t\t\/\/ end time of currently played tune, 0 for repeating tunes or silence\nstatic int tune_current = TONE_STOP_TUNE;\t\t\/\/ currently playing tune, can be interrupted after tune_end\nstatic unsigned int tune_durations[TONE_NUMBER_OF_TUNES];\n\nstatic DevHandle h_leds;\nstatic DevHandle h_rgbleds;\nstatic DevHandle h_buzzer;\n\nstatic param_t bat_v_empty_h;\nstatic param_t bat_v_full_h;\nstatic param_t bat_n_cells_h;\nstatic param_t bat_capacity_h;\nstatic param_t bat_v_load_drop_h;\nstatic float bat_v_empty = 3.4f;\nstatic float bat_v_full = 4.2f;\nstatic float bat_v_load_drop = 0.06f;\nstatic int bat_n_cells = 3;\nstatic float bat_capacity = -1.0f;\nstatic unsigned int counter = 0;\nstatic float throttle_lowpassed = 0.0f;\n\nint battery_init()\n{\n\tbat_v_empty_h = param_find(\"BAT_V_EMPTY\");\n\tbat_v_full_h = param_find(\"BAT_V_CHARGED\");\n\tbat_n_cells_h = param_find(\"BAT_N_CELLS\");\n\tbat_capacity_h = param_find(\"BAT_CAPACITY\");\n\tbat_v_load_drop_h = param_find(\"BAT_V_LOAD_DROP\");\n\n\treturn PX4_OK;\n}\n\nint buzzer_init()\n{\n\ttune_end = 0;\n\ttune_current = 0;\n\tmemset(tune_durations, 0, sizeof(tune_durations));\n\ttune_durations[TONE_NOTIFY_POSITIVE_TUNE] = 800000;\n\ttune_durations[TONE_NOTIFY_NEGATIVE_TUNE] = 900000;\n\ttune_durations[TONE_NOTIFY_NEUTRAL_TUNE] = 500000;\n\ttune_durations[TONE_ARMING_WARNING_TUNE] = 3000000;\n\n\tDevMgr::getHandle(TONEALARM0_DEVICE_PATH, h_buzzer);\n\n\tif (!h_buzzer.isValid()) {\n\t\tPX4_WARN(\"Buzzer: px4_open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\treturn PX4_OK;\n}\n\nvoid buzzer_deinit()\n{\n\tDevMgr::releaseHandle(h_buzzer);\n}\n\nvoid set_tune_override(int tune)\n{\n\th_buzzer.ioctl(TONE_SET_ALARM, tune);\n}\n\nvoid set_tune(int tune)\n{\n\tunsigned int new_tune_duration = tune_durations[tune];\n\n\t\/* don't interrupt currently playing non-repeating tune by repeating *\/\n\tif (tune_end == 0 || new_tune_duration != 0 || hrt_absolute_time() > tune_end) {\n\t\t\/* allow interrupting current non-repeating tune by the same tune *\/\n\t\tif (tune != tune_current || new_tune_duration != 0) {\n\t\t\th_buzzer.ioctl(TONE_SET_ALARM, tune);\n\t\t}\n\n\t\ttune_current = tune;\n\n\t\tif (new_tune_duration != 0) {\n\t\t\ttune_end = hrt_absolute_time() + new_tune_duration;\n\n\t\t} else {\n\t\t\ttune_end = 0;\n\t\t}\n\t}\n}\n\nvoid tune_home_set(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_HOME_SET);\n\t}\n}\n\nvoid tune_mission_ok(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\nvoid tune_mission_fail(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink green LED and play positive tune (if use_buzzer == true).\n *\/\nvoid tune_positive(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_POSITIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink white LED and play neutral tune (if use_buzzer == true).\n *\/\nvoid tune_neutral(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_WHITE);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\n\/**\n * Blink red LED and play negative tune (if use_buzzer == true).\n *\/\nvoid tune_negative(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_RED);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\nint blink_msg_state()\n{\n\tif (blink_msg_end == 0) {\n\t\treturn 0;\n\n\t} else if (hrt_absolute_time() > blink_msg_end) {\n\t\tblink_msg_end = 0;\n\t\treturn 2;\n\n\t} else {\n\t\treturn 1;\n\t}\n}\n\nint led_init()\n{\n\tblink_msg_end = 0;\n\n\t\/* first open normal LEDs *\/\n\tDevMgr::getHandle(LED0_DEVICE_PATH, h_leds);\n\n\tif (!h_leds.isValid()) {\n\t\tPX4_WARN(\"LED: getHandle fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* the blue LED is only available on FMUv1 & AeroCore but not FMUv2 *\/\n\t(void)h_leds.ioctl(LED_ON, LED_BLUE);\n\n\t\/* switch blue off *\/\n\tled_off(LED_BLUE);\n\n\t\/* we consider the amber led mandatory *\/\n\tif (h_leds.ioctl(LED_ON, LED_AMBER)) {\n\t\tPX4_WARN(\"Amber LED: ioctl fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* switch amber off *\/\n\tled_off(LED_AMBER);\n\n\t\/* then try RGB LEDs, this can fail on FMUv1*\/\n\tDevHandle h;\n\tDevMgr::getHandle(RGBLED0_DEVICE_PATH, h_rgbleds);\n\n\tif (!h_rgbleds.isValid()) {\n\t\tPX4_WARN(\"No RGB LED found at \" RGBLED0_DEVICE_PATH);\n\t}\n\n\treturn 0;\n}\n\nvoid led_deinit()\n{\n\tDevMgr::releaseHandle(h_leds);\n\tDevMgr::releaseHandle(h_rgbleds);\n}\n\nint led_toggle(int led)\n{\n\treturn h_leds.ioctl(LED_TOGGLE, led);\n}\n\nint led_on(int led)\n{\n\treturn h_leds.ioctl(LED_ON, led);\n}\n\nint led_off(int led)\n{\n\treturn h_leds.ioctl(LED_OFF, led);\n}\n\nvoid rgbled_set_color(rgbled_color_t color)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_COLOR, (unsigned long)color);\n}\n\nvoid rgbled_set_mode(rgbled_mode_t mode)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_MODE, (unsigned long)mode);\n}\n\nvoid rgbled_set_pattern(rgbled_pattern_t *pattern)\n{\n\n\th_rgbleds.ioctl(RGBLED_SET_PATTERN, (unsigned long)pattern);\n}\n\nunsigned battery_get_n_cells() {\n\treturn bat_n_cells;\n}\n\nfloat battery_remaining_estimate_voltage(float voltage, float discharged, float throttle_normalized)\n{\n\tfloat ret = 0;\n\n\tif (counter % 100 == 0) {\n\t\tparam_get(bat_v_empty_h, &bat_v_empty);\n\t\tparam_get(bat_v_full_h, &bat_v_full);\n\t\tparam_get(bat_v_load_drop_h, &bat_v_load_drop);\n\t\tparam_get(bat_n_cells_h, &bat_n_cells);\n\t\tparam_get(bat_capacity_h, &bat_capacity);\n\t}\n\n\tcounter++;\n\n\t\/\/ XXX this time constant needs to become tunable\n\t\/\/ but really, the right fix are smart batteries.\n\tfloat val = throttle_lowpassed * 0.97f + throttle_normalized * 0.03f;\n\tif (PX4_ISFINITE(val)) {\n\t\tthrottle_lowpassed = val;\n\t}\n\n\t\/* remaining charge estimate based on voltage and internal resistance (drop under load) *\/\n\tfloat bat_v_empty_dynamic = bat_v_empty - (bat_v_load_drop * throttle_lowpassed);\n\t\/* the range from full to empty is the same for batteries under load and without load,\n\t * since the voltage drop applies to both the full and empty state\n\t *\/\n\tfloat voltage_range = (bat_v_full - bat_v_empty);\n\tfloat remaining_voltage = (voltage - (bat_n_cells * bat_v_empty_dynamic)) \/ (bat_n_cells * voltage_range);\n\n\tif (bat_capacity > 0.0f) {\n\t\t\/* if battery capacity is known, use discharged current for estimate, but don't show more than voltage estimate *\/\n\t\tret = fminf(remaining_voltage, 1.0f - discharged \/ bat_capacity);\n\n\t} else {\n\t\t\/* else use voltage *\/\n\t\tret = remaining_voltage;\n\t}\n\n\t\/* limit to sane values *\/\n\tret = (ret < 0.0f) ? 0.0f : ret;\n\tret = (ret > 1.0f) ? 1.0f : ret;\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2013, 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file commander_helper.cpp\n * Commander helper functions implementations\n *\n * @author Thomas Gubler <thomasgubler@student.ethz.ch>\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\n *\/\n\n#include <stdio.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <fcntl.h>\n#include <math.h>\n#include <string.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/vehicle_status.h>\n#include <uORB\/topics\/actuator_controls.h>\n#include <uORB\/topics\/vehicle_control_mode.h>\n#include <systemlib\/err.h>\n#include <systemlib\/param\/param.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_tone_alarm.h>\n#include <drivers\/drv_led.h>\n#include <drivers\/drv_rgbled.h>\n\n#include \"commander_helper.h\"\n\n\/* oddly, ERROR is not defined for c++ *\/\n#ifdef ERROR\n# undef ERROR\n#endif\nstatic const int ERROR = -1;\n\n#define BLINK_MSG_TIME\t700000\t\/\/ 3 fast blinks\n\nbool is_multirotor(const struct vehicle_status_s *current_status)\n{\n\treturn ((current_status->system_type == vehicle_status_s::VEHICLE_TYPE_QUADROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HEXAROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_OCTOROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_TRICOPTER));\n}\n\nbool is_rotary_wing(const struct vehicle_status_s *current_status)\n{\n\treturn is_multirotor(current_status) || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HELICOPTER)\n\t || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_COAXIAL);\n}\n\nbool is_vtol(const struct vehicle_status_s * current_status) {\n\treturn (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_DUOROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_QUADROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_HEXAROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_OCTOROTOR);\n}\n\nstatic int buzzer = -1;\nstatic hrt_abstime blink_msg_end = 0;\t\/\/ end time for currently blinking LED message, 0 if no blink message\nstatic hrt_abstime tune_end = 0;\t\t\/\/ end time of currently played tune, 0 for repeating tunes or silence\nstatic int tune_current = TONE_STOP_TUNE;\t\t\/\/ currently playing tune, can be interrupted after tune_end\nstatic unsigned int tune_durations[TONE_NUMBER_OF_TUNES];\n\nstatic param_t bat_v_empty_h;\nstatic param_t bat_v_full_h;\nstatic param_t bat_n_cells_h;\nstatic param_t bat_capacity_h;\nstatic param_t bat_v_load_drop_h;\nstatic float bat_v_empty = 3.4f;\nstatic float bat_v_full = 4.2f;\nstatic float bat_v_load_drop = 0.06f;\nstatic int bat_n_cells = 3;\nstatic float bat_capacity = -1.0f;\nstatic unsigned int counter = 0;\n\nint battery_init()\n{\n\tbat_v_empty_h = param_find(\"BAT_V_EMPTY\");\n\tbat_v_full_h = param_find(\"BAT_V_CHARGED\");\n\tbat_n_cells_h = param_find(\"BAT_N_CELLS\");\n\tbat_capacity_h = param_find(\"BAT_CAPACITY\");\n\tbat_v_load_drop_h = param_find(\"BAT_V_LOAD_DROP\");\n\n\treturn OK;\n}\n\nint buzzer_init()\n{\n\ttune_end = 0;\n\ttune_current = 0;\n\tmemset(tune_durations, 0, sizeof(tune_durations));\n\ttune_durations[TONE_NOTIFY_POSITIVE_TUNE] = 800000;\n\ttune_durations[TONE_NOTIFY_NEGATIVE_TUNE] = 900000;\n\ttune_durations[TONE_NOTIFY_NEUTRAL_TUNE] = 500000;\n\ttune_durations[TONE_ARMING_WARNING_TUNE] = 3000000;\n\n\tbuzzer = open(TONEALARM0_DEVICE_PATH, O_WRONLY);\n\n\tif (buzzer < 0) {\n\t\twarnx(\"Buzzer: open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\treturn OK;\n}\n\nvoid buzzer_deinit()\n{\n\tclose(buzzer);\n}\n\nvoid set_tune_override(int tune)\n{\n\tioctl(buzzer, TONE_SET_ALARM, tune);\n}\n\nvoid set_tune(int tune)\n{\n\tunsigned int new_tune_duration = tune_durations[tune];\n\n\t\/* don't interrupt currently playing non-repeating tune by repeating *\/\n\tif (tune_end == 0 || new_tune_duration != 0 || hrt_absolute_time() > tune_end) {\n\t\t\/* allow interrupting current non-repeating tune by the same tune *\/\n\t\tif (tune != tune_current || new_tune_duration != 0) {\n\t\t\tioctl(buzzer, TONE_SET_ALARM, tune);\n\t\t}\n\n\t\ttune_current = tune;\n\n\t\tif (new_tune_duration != 0) {\n\t\t\ttune_end = hrt_absolute_time() + new_tune_duration;\n\n\t\t} else {\n\t\t\ttune_end = 0;\n\t\t}\n\t}\n}\n\nvoid tune_home_set(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_HOME_SET);\n\t}\n}\n\nvoid tune_mission_ok(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\nvoid tune_mission_fail(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink green LED and play positive tune (if use_buzzer == true).\n *\/\nvoid tune_positive(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_POSITIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink white LED and play neutral tune (if use_buzzer == true).\n *\/\nvoid tune_neutral(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_WHITE);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\n\/**\n * Blink red LED and play negative tune (if use_buzzer == true).\n *\/\nvoid tune_negative(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_RED);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\nint blink_msg_state()\n{\n\tif (blink_msg_end == 0) {\n\t\treturn 0;\n\n\t} else if (hrt_absolute_time() > blink_msg_end) {\n\t\tblink_msg_end = 0;\n\t\treturn 2;\n\n\t} else {\n\t\treturn 1;\n\t}\n}\n\nstatic int leds = -1;\nstatic int rgbleds = -1;\n\nint led_init()\n{\n\tblink_msg_end = 0;\n\n\t\/* first open normal LEDs *\/\n\tleds = open(LED0_DEVICE_PATH, 0);\n\n\tif (leds < 0) {\n\t\twarnx(\"LED: open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* the blue LED is only available on FMUv1 & AeroCore but not FMUv2 *\/\n\t(void)ioctl(leds, LED_ON, LED_BLUE);\n\n\t\/* switch blue off *\/\n\tled_off(LED_BLUE);\n\n\t\/* we consider the amber led mandatory *\/\n\tif (ioctl(leds, LED_ON, LED_AMBER)) {\n\t\twarnx(\"Amber LED: ioctl fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* switch amber off *\/\n\tled_off(LED_AMBER);\n\n\t\/* then try RGB LEDs, this can fail on FMUv1*\/\n\trgbleds = open(RGBLED0_DEVICE_PATH, 0);\n\n\tif (rgbleds < 0) {\n\t\twarnx(\"No RGB LED found at \" RGBLED0_DEVICE_PATH);\n\t}\n\n\treturn 0;\n}\n\nvoid led_deinit()\n{\n\tif (leds >= 0) {\n\t\tclose(leds);\n\t}\n\n\tif (rgbleds >= 0) {\n\t\tclose(rgbleds);\n\t}\n}\n\nint led_toggle(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_TOGGLE, led);\n}\n\nint led_on(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_ON, led);\n}\n\nint led_off(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_OFF, led);\n}\n\nvoid rgbled_set_color(rgbled_color_t color)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_COLOR, (unsigned long)color);\n}\n\nvoid rgbled_set_mode(rgbled_mode_t mode)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_MODE, (unsigned long)mode);\n}\n\nvoid rgbled_set_pattern(rgbled_pattern_t *pattern)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_PATTERN, (unsigned long)pattern);\n}\n\nunsigned battery_get_n_cells() {\n\treturn bat_n_cells;\n}\n\nfloat battery_remaining_estimate_voltage(float voltage, float discharged, float throttle_normalized)\n{\n\tfloat ret = 0;\n\n\tif (counter % 100 == 0) {\n\t\tparam_get(bat_v_empty_h, &bat_v_empty);\n\t\tparam_get(bat_v_full_h, &bat_v_full);\n\t\tparam_get(bat_v_load_drop_h, &bat_v_load_drop);\n\t\tparam_get(bat_n_cells_h, &bat_n_cells);\n\t\tparam_get(bat_capacity_h, &bat_capacity);\n\t}\n\n\tcounter++;\n\n\t\/* remaining charge estimate based on voltage and internal resistance (drop under load) *\/\n\tfloat bat_v_empty_dynamic = bat_v_empty - (bat_v_load_drop * throttle_normalized);\n\t\/* the range from full to empty is the same for batteries under load and without load,\n\t * since the voltage drop applies to both the full and empty state\n\t *\/\n\tfloat voltage_range = (bat_v_full - bat_v_empty);\n\tfloat remaining_voltage = (voltage - (bat_n_cells * bat_v_empty_dynamic)) \/ (bat_n_cells * voltage_range);\n\n\tif (bat_capacity > 0.0f) {\n\t\t\/* if battery capacity is known, use discharged current for estimate, but don't show more than voltage estimate *\/\n\t\tret = fminf(remaining_voltage, 1.0f - discharged \/ bat_capacity);\n\n\t} else {\n\t\t\/* else use voltage *\/\n\t\tret = remaining_voltage;\n\t}\n\n\t\/* limit to sane values *\/\n\tret = (ret < 0.0f) ? 0.0f : ret;\n\tret = (ret > 1.0f) ? 1.0f : ret;\n\treturn ret;\n}\n<commit_msg>Commander: Low-pass battery throttle to better match battery dynamics<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2013, 2014 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file commander_helper.cpp\n * Commander helper functions implementations\n *\n * @author Thomas Gubler <thomasgubler@student.ethz.ch>\n * @author Julian Oes <julian@oes.ch>\n * @author Anton Babushkin <anton.babushkin@me.com>\n *\n *\/\n\n#include <stdio.h>\n#include <unistd.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <fcntl.h>\n#include <math.h>\n#include <string.h>\n\n#include <uORB\/uORB.h>\n#include <uORB\/topics\/vehicle_status.h>\n#include <uORB\/topics\/actuator_controls.h>\n#include <uORB\/topics\/vehicle_control_mode.h>\n#include <systemlib\/err.h>\n#include <systemlib\/param\/param.h>\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_tone_alarm.h>\n#include <drivers\/drv_led.h>\n#include <drivers\/drv_rgbled.h>\n\n#include \"commander_helper.h\"\n\n\/* oddly, ERROR is not defined for c++ *\/\n#ifdef ERROR\n# undef ERROR\n#endif\nstatic const int ERROR = -1;\n\n#define BLINK_MSG_TIME\t700000\t\/\/ 3 fast blinks\n\nbool is_multirotor(const struct vehicle_status_s *current_status)\n{\n\treturn ((current_status->system_type == vehicle_status_s::VEHICLE_TYPE_QUADROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HEXAROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_OCTOROTOR) ||\n\t\t(current_status->system_type == vehicle_status_s::VEHICLE_TYPE_TRICOPTER));\n}\n\nbool is_rotary_wing(const struct vehicle_status_s *current_status)\n{\n\treturn is_multirotor(current_status) || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_HELICOPTER)\n\t || (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_COAXIAL);\n}\n\nbool is_vtol(const struct vehicle_status_s * current_status) {\n\treturn (current_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_DUOROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_QUADROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_HEXAROTOR ||\n\t\tcurrent_status->system_type == vehicle_status_s::VEHICLE_TYPE_VTOL_OCTOROTOR);\n}\n\nstatic int buzzer = -1;\nstatic hrt_abstime blink_msg_end = 0;\t\/\/ end time for currently blinking LED message, 0 if no blink message\nstatic hrt_abstime tune_end = 0;\t\t\/\/ end time of currently played tune, 0 for repeating tunes or silence\nstatic int tune_current = TONE_STOP_TUNE;\t\t\/\/ currently playing tune, can be interrupted after tune_end\nstatic unsigned int tune_durations[TONE_NUMBER_OF_TUNES];\n\nstatic param_t bat_v_empty_h;\nstatic param_t bat_v_full_h;\nstatic param_t bat_n_cells_h;\nstatic param_t bat_capacity_h;\nstatic param_t bat_v_load_drop_h;\nstatic float bat_v_empty = 3.4f;\nstatic float bat_v_full = 4.2f;\nstatic float bat_v_load_drop = 0.06f;\nstatic int bat_n_cells = 3;\nstatic float bat_capacity = -1.0f;\nstatic unsigned int counter = 0;\nstatic float throttle_lowpassed = 0.0f;\n\nint battery_init()\n{\n\tbat_v_empty_h = param_find(\"BAT_V_EMPTY\");\n\tbat_v_full_h = param_find(\"BAT_V_CHARGED\");\n\tbat_n_cells_h = param_find(\"BAT_N_CELLS\");\n\tbat_capacity_h = param_find(\"BAT_CAPACITY\");\n\tbat_v_load_drop_h = param_find(\"BAT_V_LOAD_DROP\");\n\n\treturn OK;\n}\n\nint buzzer_init()\n{\n\ttune_end = 0;\n\ttune_current = 0;\n\tmemset(tune_durations, 0, sizeof(tune_durations));\n\ttune_durations[TONE_NOTIFY_POSITIVE_TUNE] = 800000;\n\ttune_durations[TONE_NOTIFY_NEGATIVE_TUNE] = 900000;\n\ttune_durations[TONE_NOTIFY_NEUTRAL_TUNE] = 500000;\n\ttune_durations[TONE_ARMING_WARNING_TUNE] = 3000000;\n\n\tbuzzer = open(TONEALARM0_DEVICE_PATH, O_WRONLY);\n\n\tif (buzzer < 0) {\n\t\twarnx(\"Buzzer: open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\treturn OK;\n}\n\nvoid buzzer_deinit()\n{\n\tclose(buzzer);\n}\n\nvoid set_tune_override(int tune)\n{\n\tioctl(buzzer, TONE_SET_ALARM, tune);\n}\n\nvoid set_tune(int tune)\n{\n\tunsigned int new_tune_duration = tune_durations[tune];\n\n\t\/* don't interrupt currently playing non-repeating tune by repeating *\/\n\tif (tune_end == 0 || new_tune_duration != 0 || hrt_absolute_time() > tune_end) {\n\t\t\/* allow interrupting current non-repeating tune by the same tune *\/\n\t\tif (tune != tune_current || new_tune_duration != 0) {\n\t\t\tioctl(buzzer, TONE_SET_ALARM, tune);\n\t\t}\n\n\t\ttune_current = tune;\n\n\t\tif (new_tune_duration != 0) {\n\t\t\ttune_end = hrt_absolute_time() + new_tune_duration;\n\n\t\t} else {\n\t\t\ttune_end = 0;\n\t\t}\n\t}\n}\n\nvoid tune_home_set(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_HOME_SET);\n\t}\n}\n\nvoid tune_mission_ok(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\nvoid tune_mission_fail(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink green LED and play positive tune (if use_buzzer == true).\n *\/\nvoid tune_positive(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_GREEN);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_POSITIVE_TUNE);\n\t}\n}\n\n\/**\n * Blink white LED and play neutral tune (if use_buzzer == true).\n *\/\nvoid tune_neutral(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_WHITE);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEUTRAL_TUNE);\n\t}\n}\n\n\/**\n * Blink red LED and play negative tune (if use_buzzer == true).\n *\/\nvoid tune_negative(bool use_buzzer)\n{\n\tblink_msg_end = hrt_absolute_time() + BLINK_MSG_TIME;\n\trgbled_set_color(RGBLED_COLOR_RED);\n\trgbled_set_mode(RGBLED_MODE_BLINK_FAST);\n\n\tif (use_buzzer) {\n\t\tset_tune(TONE_NOTIFY_NEGATIVE_TUNE);\n\t}\n}\n\nint blink_msg_state()\n{\n\tif (blink_msg_end == 0) {\n\t\treturn 0;\n\n\t} else if (hrt_absolute_time() > blink_msg_end) {\n\t\tblink_msg_end = 0;\n\t\treturn 2;\n\n\t} else {\n\t\treturn 1;\n\t}\n}\n\nstatic int leds = -1;\nstatic int rgbleds = -1;\n\nint led_init()\n{\n\tblink_msg_end = 0;\n\n\t\/* first open normal LEDs *\/\n\tleds = open(LED0_DEVICE_PATH, 0);\n\n\tif (leds < 0) {\n\t\twarnx(\"LED: open fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* the blue LED is only available on FMUv1 & AeroCore but not FMUv2 *\/\n\t(void)ioctl(leds, LED_ON, LED_BLUE);\n\n\t\/* switch blue off *\/\n\tled_off(LED_BLUE);\n\n\t\/* we consider the amber led mandatory *\/\n\tif (ioctl(leds, LED_ON, LED_AMBER)) {\n\t\twarnx(\"Amber LED: ioctl fail\\n\");\n\t\treturn ERROR;\n\t}\n\n\t\/* switch amber off *\/\n\tled_off(LED_AMBER);\n\n\t\/* then try RGB LEDs, this can fail on FMUv1*\/\n\trgbleds = open(RGBLED0_DEVICE_PATH, 0);\n\n\tif (rgbleds < 0) {\n\t\twarnx(\"No RGB LED found at \" RGBLED0_DEVICE_PATH);\n\t}\n\n\treturn 0;\n}\n\nvoid led_deinit()\n{\n\tif (leds >= 0) {\n\t\tclose(leds);\n\t}\n\n\tif (rgbleds >= 0) {\n\t\tclose(rgbleds);\n\t}\n}\n\nint led_toggle(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_TOGGLE, led);\n}\n\nint led_on(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_ON, led);\n}\n\nint led_off(int led)\n{\n\tif (leds < 0) {\n\t\treturn leds;\n\t}\n\treturn ioctl(leds, LED_OFF, led);\n}\n\nvoid rgbled_set_color(rgbled_color_t color)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_COLOR, (unsigned long)color);\n}\n\nvoid rgbled_set_mode(rgbled_mode_t mode)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_MODE, (unsigned long)mode);\n}\n\nvoid rgbled_set_pattern(rgbled_pattern_t *pattern)\n{\n\n\tif (rgbleds < 0) {\n\t\treturn;\n\t}\n\tioctl(rgbleds, RGBLED_SET_PATTERN, (unsigned long)pattern);\n}\n\nunsigned battery_get_n_cells() {\n\treturn bat_n_cells;\n}\n\nfloat battery_remaining_estimate_voltage(float voltage, float discharged, float throttle_normalized)\n{\n\tfloat ret = 0;\n\n\tif (counter % 100 == 0) {\n\t\tparam_get(bat_v_empty_h, &bat_v_empty);\n\t\tparam_get(bat_v_full_h, &bat_v_full);\n\t\tparam_get(bat_v_load_drop_h, &bat_v_load_drop);\n\t\tparam_get(bat_n_cells_h, &bat_n_cells);\n\t\tparam_get(bat_capacity_h, &bat_capacity);\n\t}\n\n\tcounter++;\n\n\t\/\/ XXX this time constant needs to become tunable\n\t\/\/ but really, the right fix are smart batteries.\n\tfloat val = throttle_lowpassed * 0.97f + throttle_normalized * 0.03f;\n\tif (isfinite(val)) {\n\t\tthrottle_lowpassed = val;\n\t}\n\n\t\/* remaining charge estimate based on voltage and internal resistance (drop under load) *\/\n\tfloat bat_v_empty_dynamic = bat_v_empty - (bat_v_load_drop * throttle_lowpassed);\n\t\/* the range from full to empty is the same for batteries under load and without load,\n\t * since the voltage drop applies to both the full and empty state\n\t *\/\n\tfloat voltage_range = (bat_v_full - bat_v_empty);\n\tfloat remaining_voltage = (voltage - (bat_n_cells * bat_v_empty_dynamic)) \/ (bat_n_cells * voltage_range);\n\n\tif (bat_capacity > 0.0f) {\n\t\t\/* if battery capacity is known, use discharged current for estimate, but don't show more than voltage estimate *\/\n\t\tret = fminf(remaining_voltage, 1.0f - discharged \/ bat_capacity);\n\n\t} else {\n\t\t\/* else use voltage *\/\n\t\tret = remaining_voltage;\n\t}\n\n\t\/* limit to sane values *\/\n\tret = (ret < 0.0f) ? 0.0f : ret;\n\tret = (ret > 1.0f) ? 1.0f : ret;\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/\/ vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:\n#ident \"$Id$\"\n#ident \"Copyright (c) 2007-2012 Tokutek Inc. All rights reserved.\"\n#ident \"The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11\/760379 and to the patents and\/or patent applications resulting from it.\"\n#include <valgrind\/helgrind.h>\n#include <sys\/types.h>\n#include <pthread.h>\n\n#include \"memory.h\"\n#include \"partitioned_counter.h\"\n#include \"doubly_linked_list.h\"\n#include \"growable_array.h\"\n\n\/\/******************************************************************************\n\n\/\/ Representation: The representation of a partitioned counter\n\/\/ comprises a sum, called sum_of_dead; an index, called the ckey,\n\/\/ which indexes into a thread-local array to find a thread-local\n\/\/ part of the counter; and a linked list of thread-local parts.\n\/\/ There is also a linked list, for each thread that has a\n\/\/ thread-local part of any counter, of all the thread-local parts of\n\/\/ all the counters.\n\/\/ Abstraction function: The sum is represented by the sum of _sum and\n\/\/ the sum's of the thread-local parts of the counter.\n\/\/ Representation invariant: Every thread-local part is in the linked\n\/\/ list of the thread-local parts of its counter, as well as in the\n\/\/ linked list of the counters of a the thread.\n\/\/******************************************************************************\n\n\/\/******************************************************************************\n\/\/ The mutex for the PARTITIONED_COUNTER\n\/\/ We have a single mutex for all the counters because\n\/\/ (a) the mutex is obtained infrequently, and\n\/\/ (b) it helps us avoid race conditions when destroying the counters.\n\/\/ The alternative that I couldn't make work is to have a mutex per counter.\n\/\/ But the problem is that the counter can be destroyed before threads\n\/\/ terminate, or maybe a thread terminates before the counter is destroyed.\n\/\/ If the counter is destroyed first, then the mutex is no longer available.\n\/\/******************************************************************************\n\nstatic pthread_mutex_t partitioned_counter_mutex = PTHREAD_MUTEX_INITIALIZER;\n\nstatic void pc_lock (void)\n\/\/ Effect: Lock the mutex.\n{\n int r = pthread_mutex_lock(&partitioned_counter_mutex);\n assert(r==0);\n}\n\nstatic void pc_unlock (void)\n\/\/ Effect: Unlock the mutex.\n{\n int r = pthread_mutex_unlock(&partitioned_counter_mutex);\n assert(r==0);\n}\n\n\/\/******************************************************************************\n\/\/ Key creation primivites.\n\/\/******************************************************************************\nstatic void pk_create (pthread_key_t *key, void (*destructor)(void*)) {\n int r = pthread_key_create(key, destructor);\n assert(r==0);\n}\n\nstatic void pk_delete (pthread_key_t key) {\n int r = pthread_key_delete(key);\n assert(r==0);\n}\n\nstatic void pk_setspecific (pthread_key_t key, const void *value) {\n int r = pthread_setspecific(key, value);\n assert(r==0);\n}\n\n\/\/******************************************************************************\n\/\/ The counter itself.\n\/\/ The thread local part of a counter, comprising the thread-local sum a pointer\n\/\/ to the partitioned_counter, a pointer to the thread_local list head, and two\n\/\/ linked lists. One of the lists is all the thread-local parts that belong to\n\/\/ the same counter, and the other is all the thread-local parts that belogn to\n\/\/ the same thread.\n\/\/******************************************************************************\n\nstruct local_counter;\n\nstruct partitioned_counter {\n uint64_t sum_of_dead; \/\/ The sum of all thread-local counts from threads that have terminated.\n uint64_t pc_key; \/\/ A unique integer among all counters that have been created but not yet destroyed.\n DoublyLinkedList<struct local_counter *> ll_counter_head; \/\/ A linked list of all the thread-local information for this counter.\n};\n\nstruct local_counter {\n uint64_t sum; \/\/ The thread-local sum.\n PARTITIONED_COUNTER owner_pc; \/\/ The partitioned counter that this is part of.\n GrowableArray<struct local_counter *> *thread_local_array; \/\/ The thread local array for this thread holds this local_counter at offset owner_pc->pc_key.\n LinkedListElement<struct local_counter *> ll_in_counter; \/\/ Element for the doubly-linked list of thread-local information for this PARTITIONED_COUNTER.\n};\n\n\/\/ Try to get it it into one cache line by aligning it.\nstatic __thread GrowableArray<struct local_counter *> thread_local_array;\n\n\/\/ I want this to be static, but I have to use hidden visibility instead because it's a friend function.\nstatic void destroy_thread_local_part_of_partitioned_counters (void *ignore_me);\nstatic void destroy_thread_local_part_of_partitioned_counters (void *ignore_me __attribute__((__unused__)))\n\/\/ Effect: This function is called whenever a thread terminates using the\n\/\/ destructor of the thread_destructor_key (defined below). First grab the\n\/\/ lock, then go through all the partitioned counters and removes the part that\n\/\/ is local to this thread. We don't actually need the contents of the\n\/\/ thread_destructor_key except to cause this function to run. The content of\n\/\/ the key is a static string, so don't try to free it.\n{\n pc_lock();\n for (size_t i=0; i<thread_local_array.get_size(); i++) {\n struct local_counter *lc = thread_local_array.fetch_unchecked(i);\n if (lc==NULL) continue;\n PARTITIONED_COUNTER owner = lc->owner_pc;\n owner->sum_of_dead += lc->sum;\n owner->ll_counter_head.remove(&lc->ll_in_counter);\n toku_free(lc);\n }\n thread_local_array.deinit();\n pc_unlock();\n}\n\n\/\/******************************************************************************\n\/\/ We employ a system-wide pthread_key simply to get a notification when a\n\/\/ thread terminates. The key will simply contain a constant string (it's \"dont\n\/\/ care\", but it doesn't matter what it is, as long as it's not NULL. We need\n\/\/ a constructor function to set up the pthread_key. We used a constructor\n\/\/ function intead of a C++ constructor because that's what we are used to,\n\/\/ rather than because it's necessarily better. Whenever a thread tries to\n\/\/ increment a partitioned_counter for the first time, it sets the\n\/\/ pthread_setspecific for the thread_destructor_key. It's OK if the key gets\n\/\/ setspecific multiple times, it's always the same value. When a thread (that\n\/\/ has created a thread-local part of any partitioned counter) terminates, the\n\/\/ destroy_thread_local_part_of_partitioned_counters will run. It may run\n\/\/ before or after other pthread_key destructors, but the thread-local\n\/\/ ll_thread_head variable is still present until the thread is completely done\n\/\/ running.\n\/\/******************************************************************************\n\nstatic pthread_key_t thread_destructor_key;\n\n\/\/******************************************************************************\n\/\/ We don't like using up pthread_keys (macos provides only 128 of them),\n\/\/ so we built our own. \n\/\/******************************************************************************\n\nbool *counters_in_use = NULL;\nuint64_t counters_in_use_size = 0;\n\nstatic uint64_t allocate_counter (void)\n\/\/ Effect: Find an unused counter number, and allocate it, returning the counter number.\n\/\/ Requires: The pc mutex is held before calling.\n{\n for (uint64_t i=0; i<counters_in_use_size; i++) {\n if (!counters_in_use[i]) {\n counters_in_use[i]=true;\n return i;\n }\n }\n uint64_t old_size = counters_in_use_size;\n if (counters_in_use_size==0) {\n counters_in_use_size = 1;\n } else {\n counters_in_use_size *= 2;\n }\n XREALLOC_N(counters_in_use_size, counters_in_use);\n for (uint64_t i=old_size; i<counters_in_use_size; i++) {\n counters_in_use[i] = false;\n }\n assert(old_size < counters_in_use_size);\n counters_in_use[old_size] = true;\n return old_size;\n}\n\n\nstatic void free_counter(uint64_t counternum)\n\/\/ Effect: Free a counter.\n\/\/ Requires: The pc mutex is held before calling.\n{\n assert(counternum < counters_in_use_size);\n assert(counters_in_use[counternum]);\n counters_in_use[counternum] = false;\n}\n\nstatic void destroy_counters (void) {\n toku_free(counters_in_use);\n counters_in_use=NULL;\n counters_in_use_size=0;\n}\n\n\n\/\/******************************************************************************\n\/\/ Now for the code that actually creates a counter.\n\/\/******************************************************************************\n\nPARTITIONED_COUNTER create_partitioned_counter(void)\n\/\/ Effect: Create a counter, initialized to zero.\n{\n PARTITIONED_COUNTER XMALLOC(result);\n result->sum_of_dead = 0;\n result->pc_key = allocate_counter();\n result->ll_counter_head.init();\n return result;\n}\n\nvoid destroy_partitioned_counter(PARTITIONED_COUNTER pc)\n\/\/ Effect: Destroy the counter. No operations on this counter are permitted after.\n\/\/ Implementation note: Since we have a global lock, we can destroy all the thread-local\n\/\/ versions as well.\n{\n pc_lock();\n uint64_t pc_key = pc->pc_key;\n LinkedListElement<struct local_counter *> *first;\n while (pc->ll_counter_head.pop(&first)) {\n \/\/ We just removed first from the counter list, now we must remove it from the thread-local array.\n struct local_counter *lc = first->get_container();\n assert(pc == lc->owner_pc);\n GrowableArray<struct local_counter *> *tla = lc->thread_local_array;\n tla->store_unchecked(pc_key, NULL);\n toku_free(lc);\n }\n toku_free(pc);\n free_counter(pc_key);\n pc_unlock();\n}\n\nstatic inline struct local_counter *get_thread_local_counter(uint64_t pc_key, GrowableArray<struct local_counter *> *a)\n{\n if (pc_key >= a->get_size()) {\n return NULL;\n } else {\n return a->fetch_unchecked(pc_key);\n }\n}\n\nvoid increment_partitioned_counter(PARTITIONED_COUNTER pc, uint64_t amount)\n\/\/ Effect: Increment the counter by amount.\n\/\/ Requires: No overflows. This is a 64-bit unsigned counter.\n{\n \/\/ Only this thread is allowed to modify thread_local_array, except for setting tla->array[pc_key] to NULL\n \/\/ when a counter is destroyed (and in that case there should be no race because no other thread should be\n \/\/ trying to access the same local counter at the same time.\n uint64_t pc_key = pc->pc_key;\n struct local_counter *lc = get_thread_local_counter(pc_key, &thread_local_array);\n if (lc==NULL) {\n \/\/ Set things up so that this thread terminates, the thread-local parts of the counter will be destroyed and merged into their respective counters.\n pk_setspecific(thread_destructor_key, \"dont care\");\n\n\tXMALLOC(lc);\n\tlc->sum = 0;\n\tHELGRIND_VALGRIND_HG_DISABLE_CHECKING(&lc->sum, sizeof(lc->sum)); \/\/ the counter increment is kind of racy.\n\tlc->owner_pc = pc;\n lc->thread_local_array = &thread_local_array;\n\n\tpc_lock(); \/\/ Might as well do the malloc without holding the pc lock. But the rest of this work needs the lock.\n\n \/\/ Grow the array if needed, filling in NULLs\n while (thread_local_array.get_size() <= pc_key) {\n thread_local_array.push(NULL);\n }\n thread_local_array.store_unchecked(pc_key, lc);\n pc->ll_counter_head.insert(&lc->ll_in_counter, lc);\n\tpc_unlock();\n }\n lc->sum += amount;\n}\n\nstatic int sumit(struct local_counter *lc, uint64_t *sum) {\n (*sum)+=lc->sum;\n return 0;\n}\n\nuint64_t read_partitioned_counter(PARTITIONED_COUNTER pc)\n\/\/ Effect: Return the current value of the counter.\n\/\/ Implementation note: Sum all the thread-local counts along with the sum_of_the_dead.\n{\n pc_lock();\n uint64_t sum = pc->sum_of_dead;\n int r = pc->ll_counter_head.iterate<uint64_t *>(sumit, &sum);\n assert(r==0);\n pc_unlock();\n return sum;\n}\n\nvoid partitioned_counters_init(void)\n\/\/ Effect: Initialize any partitioned counters data structures that must be set up before any partitioned counters run.\n{\n pk_create(&thread_destructor_key, destroy_thread_local_part_of_partitioned_counters);\n}\n\nvoid partitioned_counters_destroy(void)\n\/\/ Effect: Destroy any partitioned counters data structures.\n{\n pk_delete(thread_destructor_key);\n destroy_counters();\n}\n\n<commit_msg>Fix #5321. Refs #5295, #5292, #5290. {{{svn merge -r46336:46350 ..\/tokudb.5321}}}<commit_after>\/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n\/\/ vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:\n#ident \"$Id$\"\n#ident \"Copyright (c) 2007-2012 Tokutek Inc. All rights reserved.\"\n#ident \"The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11\/760379 and to the patents and\/or patent applications resulting from it.\"\n#include <valgrind\/helgrind.h>\n#include <sys\/types.h>\n#include <pthread.h>\n\n#include \"memory.h\"\n#include \"partitioned_counter.h\"\n#include \"doubly_linked_list.h\"\n#include \"growable_array.h\"\n\n\/\/******************************************************************************\n\/\/\n\/\/ Representation: The representation of a partitioned counter comprises a\n\/\/ sum, called sum_of_dead; an index, called the ckey, which indexes into a\n\/\/ thread-local array to find a thread-local part of the counter; and a\n\/\/ linked list of thread-local parts.\n\/\/\n\/\/ There is also a linked list, for each thread that has a thread-local part\n\/\/ of any counter, of all the thread-local parts of all the counters.\n\/\/\n\/\/ There is a pthread_key which gives us a hook to clean up thread-local\n\/\/ state when a thread terminates. For each thread-local part of a counter\n\/\/ that the thread has, we add in the thread-local sum into the sum_of_dead.\n\/\/\n\/\/ Finally there is a list of all the thread-local arrays so that when we\n\/\/ destroy the partitioned counter before the threads are done, we can find\n\/\/ and destroy the thread_local_arrays before destroying the pthread_key.\n\/\/\n\/\/ Abstraction function: The sum is represented by the sum of _sum and the\n\/\/ sum's of the thread-local parts of the counter.\n\/\/\n\/\/ Representation invariant: Every thread-local part is in the linked list of\n\/\/ the thread-local parts of its counter, as well as in the linked list of\n\/\/ the counters of a the thread.\n\/\/\n\/\/******************************************************************************\n\n\/\/******************************************************************************\n\/\/ The mutex for the PARTITIONED_COUNTER\n\/\/ We have a single mutex for all the counters because\n\/\/ (a) the mutex is obtained infrequently, and\n\/\/ (b) it helps us avoid race conditions when destroying the counters.\n\/\/ The alternative that I couldn't make work is to have a mutex per counter.\n\/\/ But the problem is that the counter can be destroyed before threads\n\/\/ terminate, or maybe a thread terminates before the counter is destroyed.\n\/\/ If the counter is destroyed first, then the mutex is no longer available.\n\/\/******************************************************************************\n\nstatic pthread_mutex_t partitioned_counter_mutex = PTHREAD_MUTEX_INITIALIZER;\n\nstatic void pc_lock (void)\n\/\/ Effect: Lock the mutex.\n{\n int r = pthread_mutex_lock(&partitioned_counter_mutex);\n assert(r==0);\n}\n\nstatic void pc_unlock (void)\n\/\/ Effect: Unlock the mutex.\n{\n int r = pthread_mutex_unlock(&partitioned_counter_mutex);\n assert(r==0);\n}\n\n\/\/******************************************************************************\n\/\/ Key creation primivites.\n\/\/******************************************************************************\nstatic void pk_create (pthread_key_t *key, void (*destructor)(void*)) {\n int r = pthread_key_create(key, destructor);\n assert(r==0);\n}\n\nstatic void pk_delete (pthread_key_t key) {\n int r = pthread_key_delete(key);\n assert(r==0);\n}\n\nstatic void pk_setspecific (pthread_key_t key, const void *value) {\n int r = pthread_setspecific(key, value);\n assert(r==0);\n}\n\n\/\/******************************************************************************\n\/\/ The counter itself.\n\/\/ The thread local part of a counter, comprising the thread-local sum a pointer\n\/\/ to the partitioned_counter, a pointer to the thread_local list head, and two\n\/\/ linked lists. One of the lists is all the thread-local parts that belong to\n\/\/ the same counter, and the other is all the thread-local parts that belogn to\n\/\/ the same thread.\n\/\/******************************************************************************\n\nstruct local_counter;\n\nstruct partitioned_counter {\n uint64_t sum_of_dead; \/\/ The sum of all thread-local counts from threads that have terminated.\n uint64_t pc_key; \/\/ A unique integer among all counters that have been created but not yet destroyed.\n DoublyLinkedList<struct local_counter *> ll_counter_head; \/\/ A linked list of all the thread-local information for this counter.\n};\n\nstruct local_counter {\n uint64_t sum; \/\/ The thread-local sum.\n PARTITIONED_COUNTER owner_pc; \/\/ The partitioned counter that this is part of.\n GrowableArray<struct local_counter *> *thread_local_array; \/\/ The thread local array for this thread holds this local_counter at offset owner_pc->pc_key.\n LinkedListElement<struct local_counter *> ll_in_counter; \/\/ Element for the doubly-linked list of thread-local information for this PARTITIONED_COUNTER.\n};\n\n\/\/ Try to get it it into one cache line by aligning it.\nstatic __thread GrowableArray<struct local_counter *> thread_local_array;\nstatic __thread bool thread_local_array_inited = false;\n\nDoublyLinkedList<GrowableArray<struct local_counter *> *> all_thread_local_arrays;\n__thread LinkedListElement<GrowableArray<struct local_counter *> *> thread_local_ll_elt;\n\n\/\/ I want this to be static, but I have to use hidden visibility instead because it's a friend function.\nstatic void destroy_thread_local_part_of_partitioned_counters (void *ignore_me);\nstatic void destroy_thread_local_part_of_partitioned_counters (void *ignore_me __attribute__((__unused__)))\n\/\/ Effect: This function is called whenever a thread terminates using the\n\/\/ destructor of the thread_destructor_key (defined below). First grab the\n\/\/ lock, then go through all the partitioned counters and removes the part that\n\/\/ is local to this thread. We don't actually need the contents of the\n\/\/ thread_destructor_key except to cause this function to run. The content of\n\/\/ the key is a static string, so don't try to free it.\n{\n pc_lock();\n for (size_t i=0; i<thread_local_array.get_size(); i++) {\n struct local_counter *lc = thread_local_array.fetch_unchecked(i);\n if (lc==NULL) continue;\n PARTITIONED_COUNTER owner = lc->owner_pc;\n owner->sum_of_dead += lc->sum;\n owner->ll_counter_head.remove(&lc->ll_in_counter);\n toku_free(lc);\n }\n all_thread_local_arrays.remove(&thread_local_ll_elt);\n thread_local_array_inited = false;\n thread_local_array.deinit();\n pc_unlock();\n}\n\n\/\/******************************************************************************\n\/\/ We employ a system-wide pthread_key simply to get a notification when a\n\/\/ thread terminates. The key will simply contain a constant string (it's \"dont\n\/\/ care\", but it doesn't matter what it is, as long as it's not NULL. We need\n\/\/ a constructor function to set up the pthread_key. We used a constructor\n\/\/ function intead of a C++ constructor because that's what we are used to,\n\/\/ rather than because it's necessarily better. Whenever a thread tries to\n\/\/ increment a partitioned_counter for the first time, it sets the\n\/\/ pthread_setspecific for the thread_destructor_key. It's OK if the key gets\n\/\/ setspecific multiple times, it's always the same value. When a thread (that\n\/\/ has created a thread-local part of any partitioned counter) terminates, the\n\/\/ destroy_thread_local_part_of_partitioned_counters will run. It may run\n\/\/ before or after other pthread_key destructors, but the thread-local\n\/\/ ll_thread_head variable is still present until the thread is completely done\n\/\/ running.\n\/\/******************************************************************************\n\nstatic pthread_key_t thread_destructor_key;\n\n\/\/******************************************************************************\n\/\/ We don't like using up pthread_keys (macos provides only 128 of them),\n\/\/ so we built our own. \n\/\/******************************************************************************\n\nbool *counters_in_use = NULL;\nuint64_t counters_in_use_size = 0;\n\nstatic uint64_t allocate_counter (void)\n\/\/ Effect: Find an unused counter number, and allocate it, returning the counter number.\n\/\/ Requires: The pc mutex is held before calling.\n{\n for (uint64_t i=0; i<counters_in_use_size; i++) {\n if (!counters_in_use[i]) {\n counters_in_use[i]=true;\n return i;\n }\n }\n uint64_t old_size = counters_in_use_size;\n if (counters_in_use_size==0) {\n counters_in_use_size = 1;\n } else {\n counters_in_use_size *= 2;\n }\n XREALLOC_N(counters_in_use_size, counters_in_use);\n for (uint64_t i=old_size; i<counters_in_use_size; i++) {\n counters_in_use[i] = false;\n }\n assert(old_size < counters_in_use_size);\n counters_in_use[old_size] = true;\n return old_size;\n}\n\n\nstatic void free_counter(uint64_t counternum)\n\/\/ Effect: Free a counter.\n\/\/ Requires: The pc mutex is held before calling.\n{\n assert(counternum < counters_in_use_size);\n assert(counters_in_use[counternum]);\n counters_in_use[counternum] = false;\n}\n\nstatic void destroy_counters (void) {\n toku_free(counters_in_use);\n counters_in_use=NULL;\n counters_in_use_size=0;\n}\n\n\n\/\/******************************************************************************\n\/\/ Now for the code that actually creates a counter.\n\/\/******************************************************************************\n\nPARTITIONED_COUNTER create_partitioned_counter(void)\n\/\/ Effect: Create a counter, initialized to zero.\n{\n PARTITIONED_COUNTER XMALLOC(result);\n result->sum_of_dead = 0;\n result->pc_key = allocate_counter();\n result->ll_counter_head.init();\n return result;\n}\n\nvoid destroy_partitioned_counter(PARTITIONED_COUNTER pc)\n\/\/ Effect: Destroy the counter. No operations on this counter are permitted after.\n\/\/ Implementation note: Since we have a global lock, we can destroy all the thread-local\n\/\/ versions as well.\n{\n pc_lock();\n uint64_t pc_key = pc->pc_key;\n LinkedListElement<struct local_counter *> *first;\n while (pc->ll_counter_head.pop(&first)) {\n \/\/ We just removed first from the counter list, now we must remove it from the thread-local array.\n struct local_counter *lc = first->get_container();\n assert(pc == lc->owner_pc);\n GrowableArray<struct local_counter *> *tla = lc->thread_local_array;\n tla->store_unchecked(pc_key, NULL);\n toku_free(lc);\n }\n toku_free(pc);\n free_counter(pc_key);\n pc_unlock();\n}\n\nstatic inline struct local_counter *get_thread_local_counter(uint64_t pc_key, GrowableArray<struct local_counter *> *a)\n{\n if (pc_key >= a->get_size()) {\n return NULL;\n } else {\n return a->fetch_unchecked(pc_key);\n }\n}\n\nvoid increment_partitioned_counter(PARTITIONED_COUNTER pc, uint64_t amount)\n\/\/ Effect: Increment the counter by amount.\n\/\/ Requires: No overflows. This is a 64-bit unsigned counter.\n{\n \/\/ Only this thread is allowed to modify thread_local_array, except for setting tla->array[pc_key] to NULL\n \/\/ when a counter is destroyed (and in that case there should be no race because no other thread should be\n \/\/ trying to access the same local counter at the same time.\n uint64_t pc_key = pc->pc_key;\n struct local_counter *lc = get_thread_local_counter(pc_key, &thread_local_array);\n if (lc==NULL) {\n \/\/ Set things up so that this thread terminates, the thread-local parts of the counter will be destroyed and merged into their respective counters.\n if (!thread_local_array_inited) {\n pk_setspecific(thread_destructor_key, \"dont care\");\n thread_local_array_inited=true;\n thread_local_array.init();\n all_thread_local_arrays.insert(&thread_local_ll_elt, &thread_local_array);\n }\n\n\tXMALLOC(lc);\n\tlc->sum = 0;\n\tHELGRIND_VALGRIND_HG_DISABLE_CHECKING(&lc->sum, sizeof(lc->sum)); \/\/ the counter increment is kind of racy.\n\tlc->owner_pc = pc;\n lc->thread_local_array = &thread_local_array;\n\n\tpc_lock(); \/\/ Might as well do the malloc without holding the pc lock. But the rest of this work needs the lock.\n\n \/\/ Grow the array if needed, filling in NULLs\n while (thread_local_array.get_size() <= pc_key) {\n thread_local_array.push(NULL);\n }\n thread_local_array.store_unchecked(pc_key, lc);\n pc->ll_counter_head.insert(&lc->ll_in_counter, lc);\n\tpc_unlock();\n }\n lc->sum += amount;\n}\n\nstatic int sumit(struct local_counter *lc, uint64_t *sum) {\n (*sum)+=lc->sum;\n return 0;\n}\n\nuint64_t read_partitioned_counter(PARTITIONED_COUNTER pc)\n\/\/ Effect: Return the current value of the counter.\n\/\/ Implementation note: Sum all the thread-local counts along with the sum_of_the_dead.\n{\n pc_lock();\n uint64_t sum = pc->sum_of_dead;\n int r = pc->ll_counter_head.iterate<uint64_t *>(sumit, &sum);\n assert(r==0);\n pc_unlock();\n return sum;\n}\n\nvoid partitioned_counters_init(void)\n\/\/ Effect: Initialize any partitioned counters data structures that must be set up before any partitioned counters run.\n{\n pk_create(&thread_destructor_key, destroy_thread_local_part_of_partitioned_counters);\n all_thread_local_arrays.init();\n}\n\nvoid partitioned_counters_destroy(void)\n\/\/ Effect: Destroy any partitioned counters data structures.\n{\n pc_lock();\n LinkedListElement<GrowableArray<struct local_counter *> *> *a_ll;\n while (all_thread_local_arrays.pop(&a_ll)) {\n a_ll->get_container()->deinit();\n }\n \n pk_delete(thread_destructor_key);\n destroy_counters();\n pc_unlock();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: preventduplicateinteraction.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 14:02:22 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_framework.hxx\"\n\n#include \"interaction\/preventduplicateinteraction.hxx\"\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_TASK_XINTERACTIONABORT_HPP_\n#include <com\/sun\/star\/task\/XInteractionAbort.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_TASK_XINTERACTIONRETRY_HPP_\n#include <com\/sun\/star\/task\/XInteractionRetry.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\nnamespace css = ::com::sun::star;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported const\n\/\/_________________________________________________________________________________________________________________\n\n#define IMPLEMENTATIONNAME_UIINTERACTIONHANDLER ::rtl::OUString::createFromAscii(\"com.sun.star.comp.uui.UUIInteractionHandler\")\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\nPreventDuplicateInteraction::PreventDuplicateInteraction(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n : ThreadHelpBase2()\n , m_xSMGR(xSMGR)\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nPreventDuplicateInteraction::~PreventDuplicateInteraction()\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::setHandler(const css::uno::Reference< css::task::XInteractionHandler >& xHandler)\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n m_xHandler = xHandler;\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::useDefaultUUIHandler()\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n css::uno::Reference< css::lang::XMultiServiceFactory > xSMGR = m_xSMGR;\n aLock.clear();\n \/\/ <- SAFE\n\n css::uno::Reference< css::task::XInteractionHandler > xHandler(\n xSMGR->createInstance(IMPLEMENTATIONNAME_UIINTERACTIONHANDLER),\n css::uno::UNO_QUERY_THROW);\n\n \/\/ SAFE ->\n aLock.reset();\n m_xHandler = xHandler;\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid SAL_CALL PreventDuplicateInteraction::handle(const css::uno::Reference< css::task::XInteractionRequest >& xRequest)\n throw(css::uno::RuntimeException)\n{\n css::uno::Any aRequest = xRequest->getRequest();\n sal_Bool bHandleIt = sal_True;\n\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n InteractionList::iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n InteractionInfo& rInfo = *pIt;\n\n if (aRequest.isExtractableTo(rInfo.m_aInteraction))\n {\n ++rInfo.m_nCallCount;\n rInfo.m_xRequest = xRequest;\n bHandleIt = (rInfo.m_nCallCount <= rInfo.m_nMaxCount);\n break;\n }\n }\n\n css::uno::Reference< css::task::XInteractionHandler > xHandler = m_xHandler;\n\n aLock.clear();\n \/\/ <- SAFE\n\n if (\n (bHandleIt ) &&\n (xHandler.is())\n )\n {\n xHandler->handle(xRequest);\n }\n else\n {\n const css::uno::Sequence< css::uno::Reference< css::task::XInteractionContinuation > > lContinuations = xRequest->getContinuations();\n sal_Int32 c = lContinuations.getLength();\n sal_Int32 i = 0;\n for (i=0; i<c; ++i)\n {\n css::uno::Reference< css::task::XInteractionAbort > xAbort(lContinuations[i], css::uno::UNO_QUERY);\n if (xAbort.is())\n {\n xAbort->select();\n break;\n }\n }\n }\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::addInteractionRule(const PreventDuplicateInteraction::InteractionInfo& aInteractionInfo)\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n InteractionList::iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n InteractionInfo& rInfo = *pIt;\n if (rInfo.m_aInteraction == aInteractionInfo.m_aInteraction)\n {\n rInfo.m_nMaxCount = aInteractionInfo.m_nMaxCount ;\n rInfo.m_nCallCount = aInteractionInfo.m_nCallCount;\n return;\n }\n }\n\n m_lInteractionRules.push_back(aInteractionInfo);\n\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nsal_Bool PreventDuplicateInteraction::getInteractionInfo(const css::uno::Type& aInteraction,\n PreventDuplicateInteraction::InteractionInfo* pReturn ) const\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n PreventDuplicateInteraction::InteractionList::const_iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n const PreventDuplicateInteraction::InteractionInfo& rInfo = *pIt;\n if (rInfo.m_aInteraction == aInteraction)\n {\n *pReturn = rInfo;\n return sal_True;\n }\n }\n\n aLock.clear();\n \/\/ <- SAFE\n\n return sal_False;\n}\n\n} \/\/ namespace framework\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.262); FILE MERGED 2008\/04\/01 10:58:10 thb 1.5.262.2: #i85898# Stripping all external header guards 2008\/03\/28 15:35:21 rt 1.5.262.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: preventduplicateinteraction.cxx,v $\n * $Revision: 1.6 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_framework.hxx\"\n\n#include \"interaction\/preventduplicateinteraction.hxx\"\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n#include <com\/sun\/star\/task\/XInteractionAbort.hpp>\n#include <com\/sun\/star\/task\/XInteractionRetry.hpp>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nnamespace framework{\n\nnamespace css = ::com::sun::star;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported const\n\/\/_________________________________________________________________________________________________________________\n\n#define IMPLEMENTATIONNAME_UIINTERACTIONHANDLER ::rtl::OUString::createFromAscii(\"com.sun.star.comp.uui.UUIInteractionHandler\")\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ exported definitions\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\nPreventDuplicateInteraction::PreventDuplicateInteraction(const css::uno::Reference< css::lang::XMultiServiceFactory >& xSMGR)\n : ThreadHelpBase2()\n , m_xSMGR(xSMGR)\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nPreventDuplicateInteraction::~PreventDuplicateInteraction()\n{\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::setHandler(const css::uno::Reference< css::task::XInteractionHandler >& xHandler)\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n m_xHandler = xHandler;\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::useDefaultUUIHandler()\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n css::uno::Reference< css::lang::XMultiServiceFactory > xSMGR = m_xSMGR;\n aLock.clear();\n \/\/ <- SAFE\n\n css::uno::Reference< css::task::XInteractionHandler > xHandler(\n xSMGR->createInstance(IMPLEMENTATIONNAME_UIINTERACTIONHANDLER),\n css::uno::UNO_QUERY_THROW);\n\n \/\/ SAFE ->\n aLock.reset();\n m_xHandler = xHandler;\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid SAL_CALL PreventDuplicateInteraction::handle(const css::uno::Reference< css::task::XInteractionRequest >& xRequest)\n throw(css::uno::RuntimeException)\n{\n css::uno::Any aRequest = xRequest->getRequest();\n sal_Bool bHandleIt = sal_True;\n\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n InteractionList::iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n InteractionInfo& rInfo = *pIt;\n\n if (aRequest.isExtractableTo(rInfo.m_aInteraction))\n {\n ++rInfo.m_nCallCount;\n rInfo.m_xRequest = xRequest;\n bHandleIt = (rInfo.m_nCallCount <= rInfo.m_nMaxCount);\n break;\n }\n }\n\n css::uno::Reference< css::task::XInteractionHandler > xHandler = m_xHandler;\n\n aLock.clear();\n \/\/ <- SAFE\n\n if (\n (bHandleIt ) &&\n (xHandler.is())\n )\n {\n xHandler->handle(xRequest);\n }\n else\n {\n const css::uno::Sequence< css::uno::Reference< css::task::XInteractionContinuation > > lContinuations = xRequest->getContinuations();\n sal_Int32 c = lContinuations.getLength();\n sal_Int32 i = 0;\n for (i=0; i<c; ++i)\n {\n css::uno::Reference< css::task::XInteractionAbort > xAbort(lContinuations[i], css::uno::UNO_QUERY);\n if (xAbort.is())\n {\n xAbort->select();\n break;\n }\n }\n }\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nvoid PreventDuplicateInteraction::addInteractionRule(const PreventDuplicateInteraction::InteractionInfo& aInteractionInfo)\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n InteractionList::iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n InteractionInfo& rInfo = *pIt;\n if (rInfo.m_aInteraction == aInteractionInfo.m_aInteraction)\n {\n rInfo.m_nMaxCount = aInteractionInfo.m_nMaxCount ;\n rInfo.m_nCallCount = aInteractionInfo.m_nCallCount;\n return;\n }\n }\n\n m_lInteractionRules.push_back(aInteractionInfo);\n\n aLock.clear();\n \/\/ <- SAFE\n}\n\n\/\/_________________________________________________________________________________________________________________\n\nsal_Bool PreventDuplicateInteraction::getInteractionInfo(const css::uno::Type& aInteraction,\n PreventDuplicateInteraction::InteractionInfo* pReturn ) const\n{\n \/\/ SAFE ->\n ::osl::ResettableMutexGuard aLock(m_aLock);\n\n PreventDuplicateInteraction::InteractionList::const_iterator pIt;\n for ( pIt = m_lInteractionRules.begin();\n pIt != m_lInteractionRules.end() ;\n ++pIt )\n {\n const PreventDuplicateInteraction::InteractionInfo& rInfo = *pIt;\n if (rInfo.m_aInteraction == aInteraction)\n {\n *pReturn = rInfo;\n return sal_True;\n }\n }\n\n aLock.clear();\n \/\/ <- SAFE\n\n return sal_False;\n}\n\n} \/\/ namespace framework\n<|endoftext|>"} {"text":"<commit_before>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2016 ETH Zurich\n ** All rights reserved.\n **\n ** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n ** following conditions are met:\n **\n ** * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n ** following disclaimer.\n ** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n ** following disclaimer in the documentation and\/or other materials provided with the distribution.\n ** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n ** derived from this software without specific prior written permission.\n **\n **\n ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n ** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n ** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n ** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n **\n **********************************************************************************************************************\/\n\n#include \"DiffManager.h\"\n#include \"VersionControlUIException.h\"\n\n#include \"VisualizationBase\/src\/VisualizationManager.h\"\n#include \"VisualizationBase\/src\/items\/ViewItem.h\"\n#include \"VisualizationBase\/src\/nodes\/ViewItemNode.h\"\n#include \"VisualizationBase\/src\/ViewItemManager.h\"\n#include \"VisualizationBase\/src\/declarative\/GridLayouter.h\"\n#include \"VisualizationBase\/src\/overlays\/HighlightOverlay.h\"\n#include \"VisualizationBase\/src\/overlays\/ArrowOverlay.h\"\n#include \"VisualizationBase\/src\/views\/MainView.h\"\n\n#include \"FilePersistence\/src\/version_control\/GitRepository.h\"\n#include \"FilePersistence\/src\/simple\/SimpleTextFileStore.h\"\n\n#include \"OOModel\/src\/declarations\/Project.h\"\n#include \"OOModel\/src\/statements\/ExpressionStatement.h\"\n#include \"OOModel\/src\/expressions\/EmptyExpression.h\"\n\n#include \"ModelBase\/src\/model\/AllTreeManagers.h\"\n#include \"ModelBase\/src\/model\/TreeManager.h\"\n#include \"ModelBase\/src\/nodes\/Reference.h\"\n\n#include \"nodes\/DiffComparisonPair.h\"\n\nnamespace VersionControlUI\n{\n\nstruct ChangeWithNodes {\n\tModel::Node* oldNode_{};\n\tModel::Node* newNode_{};\n\tFilePersistence::ChangeType changeType_{FilePersistence::ChangeType::Unclassified};\n};\n\nstruct DiffSetup {\n\tModel::TreeManager* newVersionManager_{};\n\tModel::TreeManager* oldVersionManager_{};\n\tFilePersistence::GitRepository* repository_{};\n};\n\nDiffManager::DiffManager(QString oldVersion, QString newVersion, QString project,\n\t\t\t\t\t\t\t\t Model::SymbolMatcher contextUnitMatcher) :\n\toldVersion_{oldVersion}, newVersion_{newVersion}, project_{project}, contextUnitMatcher_{contextUnitMatcher}\n{}\n\nDiffSetup DiffManager::initializeDiffPrerequisites()\n{\n\tDiffSetup diffSetup{};\n\n\tQString projectsDir = \"projects\/\" + project_;\n\n\t\/\/ get GitRepository\n\tif (!FilePersistence::GitRepository::repositoryExists(projectsDir))\n\t\tthrow VersionControlUIException{\"Diff setup not possible. No repository found at \" + projectsDir};\n\n\tdiffSetup.repository_ = new FilePersistence::GitRepository{projectsDir};;\n\n\t\/\/ load newer version\n\tdiffSetup.newVersionManager_ = createTreeManagerFromVersion(diffSetup.repository_, newVersion_);\n\n\t\/\/ load older version\n\tdiffSetup.oldVersionManager_ = createTreeManagerFromVersion(diffSetup.repository_, oldVersion_);\n\n\tModel::Reference::resolvePending();\n\n\treturn diffSetup;\n\n}\n\nvoid DiffManager::computeChangeNodesAndNodesToVisualize(FilePersistence::IdToChangeDescriptionHash changes,\n\t\tQList<ChangeWithNodes>& changesWithNodes, QSet<Model::NodeIdType>& changedNodesToVisualize, DiffSetup& diffSetup)\n{\n\tfor (auto change : changes.values())\n\t{\n\t\t\/\/ TODO check flags\n\t\tif (change->isFake() || change->onlyStructureChange()) continue;\n\n\t\tauto id = change->nodeId();\n\n\t\tchangesWithNodes.append({const_cast<Model::Node*>(diffSetup.oldVersionManager_->nodeIdMap().node(id)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t const_cast<Model::Node*>(diffSetup.newVersionManager_->nodeIdMap().node(id)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t change->type()});\n\n\t\tModel::NodeIdType nodeId;\n\n\t\t\/\/ TODO maybe use node instead of id\n\t\tif (change->type() != FilePersistence::ChangeType::Deletion)\n\t\t\tif (findChangedNode(diffSetup.newVersionManager_, id, nodeId))\n\t\t\t\tchangedNodesToVisualize.insert(nodeId);\n\t\tif (change->type() != FilePersistence::ChangeType::Insertion)\n\t\t\tif (findChangedNode(diffSetup.oldVersionManager_, id, nodeId))\n\t\t\t\tchangedNodesToVisualize.insert(nodeId);\n\t}\n\n\tremoveDirectChildrenOfNodesInContainer(&changesWithNodes);\n}\n\nvoid DiffManager::visualize()\n{\n\tauto diffSetup = initializeDiffPrerequisites();\n\n\tFilePersistence::Diff diff = diffSetup.repository_->diff(oldVersion_, newVersion_);\n\n\tauto changes = diff.changes();\n\n\t\/\/ detailed changes\n\tQList<ChangeWithNodes> changesWithNodes;\n\n\t\/\/ contains the nodes which will be drawn\n\tQSet<Model::NodeIdType> changedNodesToVisualize;\n\n\n\t\/\/ fill up lists\n\tcomputeChangeNodesAndNodesToVisualize(changes, changesWithNodes, changedNodesToVisualize, diffSetup);\n\n\tVisualization::VisualizationManager::instance().mainScene()->listenToTreeManager(diffSetup.newVersionManager_);\n\tVisualization::VisualizationManager::instance().mainScene()->listenToTreeManager(diffSetup.oldVersionManager_);\n\n\tauto diffViewItem = Visualization::VisualizationManager::instance().mainScene()->\n\t\t\tviewItems()->viewItem(\"DiffView\");\n\n\tif (diffViewItem)\n\t\tVisualization::VisualizationManager::instance().mainScene()->\n\t\t\t\t\tviewItems()->removeViewItem(diffViewItem);\n\n\tdiffViewItem = Visualization::VisualizationManager::instance().mainScene()->\n\t\t\t\tviewItems()->newViewItem(\"DiffView\");\n\n\tdiffViewItem->setMajorAxis(Visualization::GridLayouter::NoMajor);\n\tdiffViewItem->setZoomLabelsEnabled(false);\n\n\tfor (auto diffComparisonPair : createDiffComparisonPairs(diffSetup, changedNodesToVisualize))\n\t\tdiffViewItem->insertNode(diffComparisonPair);\n\n\t\/\/ create visualization for changes\n\tVisualization::VisualizationManager::instance().mainScene()->addPostEventAction(\n\t\t\t\t\t\t\t\t [diffViewItem, changesWithNodes]() {\n\t\tcreateOverlaysForChanges(diffViewItem, changesWithNodes);\n\t});\n\n\t\/\/ switch to the newly created view\n\tVisualization::VisualizationManager::instance().mainScene()->viewItems()->switchToView(diffViewItem);\n}\n\n\/\/ TODO maybe better implementation for this\nvoid DiffManager::removeDirectChildrenOfNodesInContainer(QList<ChangeWithNodes>* container)\n{\n\tQHash<Model::Node*, FilePersistence::ChangeType> oldNodes;\n\tQHash<Model::Node*, FilePersistence::ChangeType> newNodes;\n\n\tfor (auto change : *container)\n\t{\n\t\tif (change.oldNode_)\n\t\t\toldNodes.insert(change.oldNode_, change.changeType_);\n\t\tif (change.newNode_)\n\t\t\tnewNodes.insert(change.newNode_, change.changeType_);\n\t}\n\n\tQSet<Model::Node*> oldNodesMarkedForRemoval = findAllNodesWithDirectParentPresent(oldNodes);\n\tQSet<Model::Node*> newNodesMarkedForRemoval = findAllNodesWithDirectParentPresent(newNodes);\n\n\tauto it = container->begin();\n\twhile (it != container->end())\n\t{\n\t\tif (oldNodesMarkedForRemoval.contains(it->oldNode_) || newNodesMarkedForRemoval.contains(it->newNode_))\n\t\t\tit = container->erase(it);\n\t\telse\n\t\t\tit++;\n\t}\n}\n\nQSet<Model::Node*> DiffManager::findAllNodesWithDirectParentPresent(QHash<Model::Node*,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t FilePersistence::ChangeType>& nodes)\n{\n\tQSet<Model::Node*> result;\n\tfor (auto node : nodes.keys())\n\t\t\/\/ check that changeType also matches\n\t\tif (nodes.contains(node->parent()) && nodes[node] == nodes[node->parent()])\n\t\t\t\tresult.insert(node);\n\n\treturn result;\n}\n\nQSet<Visualization::Item*> DiffManager::findAllItemsWithAncestorsIn(QSet<Visualization::Item*> items)\n{\n\tQSet<Visualization::Item*> result;\n\tfor (auto item : items)\n\t{\n\t\tauto parent = item->parent();\n\t\twhile (parent)\n\t\t{\n\t\t\tif (items.contains(parent))\n\t\t\t{\n\t\t\t\tresult.insert(item);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tparent = parent->parent();\n\t\t}\n\t}\n\n\treturn result;\n}\n\n\/\/ TODO find good way to return and use Node instead of Id\nbool DiffManager::findChangedNode(Model::TreeManager* treeManager, Model::NodeIdType id, Model::NodeIdType& resultId)\n{\n\tif (auto node = const_cast<Model::Node*>(treeManager->nodeIdMap().node(id)))\n\t{\n\n\t\tModel::Node* changedNode = nullptr;\n\n\t\tif (auto ancestorNode = node->firstAncestorOfType(contextUnitMatcher_))\n\t\t{\n\t\t\tchangedNode = ancestorNode;\n\n\t\t\tresultId = treeManager->nodeIdMap().id(changedNode);\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultId = treeManager->nodeIdMap().id(node);\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DiffManager::createOverlaysForChanges(Visualization::ViewItem* diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t QList<ChangeWithNodes> changesWithNodes)\n{\n\tstatic const QString arrowLayer = \"move_arrows\";\n\tdiffViewItem->setArrowStyle(arrowLayer, \"thick\");\n\n\tQSet<Visualization::Item*> allItemsToScale;\n\tfor (auto change : changesWithNodes)\n\t{\n\t\tQString highlightOverlayStyle;\n\t\tQString highlightOverlayName;\n\n\t\tswitch (change.changeType_)\n\t\t{\n\t\t\tcase FilePersistence::ChangeType::Deletion:\n\t\t\t\thighlightOverlayName = \"delete_highlights\";\n\t\t\t\thighlightOverlayStyle = \"delete_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Insertion:\n\t\t\t\thighlightOverlayName = \"insert_highlights\";\n\t\t\t\thighlightOverlayStyle = \"insert_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Move:\n\t\t\t\thighlightOverlayName = \"move_highlights\";\n\t\t\t\thighlightOverlayStyle = \"move_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Stationary:\n\t\t\t\thighlightOverlayName = \"modify_highlights\";\n\t\t\t\thighlightOverlayStyle = \"modify_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Unclassified:\n\t\t\t\tQ_ASSERT(false);\n\t\t\t\tbreak;\n\t\t}\n\n\t\tVisualization::Item* oldNodeItem = addHighlightAndReturnItem(change.oldNode_, diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thighlightOverlayName, highlightOverlayStyle);;\n\t\tVisualization::Item* newNodeItem = addHighlightAndReturnItem(change.newNode_, diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thighlightOverlayName, highlightOverlayStyle);;\n\n\t\tif (oldNodeItem)\n\t\t\tallItemsToScale.insert(oldNodeItem);\n\n\t\tif (newNodeItem)\n\t\t\tallItemsToScale.insert(newNodeItem);\n\n\t\tif (change.changeType_== FilePersistence::ChangeType::Move)\n\t\t{\n\t\t\tauto overlay = new Visualization::ArrowOverlay{oldNodeItem, newNodeItem,\n\t\t\t\t\t Visualization::ArrowOverlay::itemStyles().get(\"thick\")};\n\t\t\tdiffViewItem->addOverlay(overlay, arrowLayer);\n\t\t}\n\n\t}\n\n\tQSet<Visualization::Item*> removeItems = findAllItemsWithAncestorsIn(allItemsToScale);\n\n\tallItemsToScale.subtract(removeItems);\n\n\tVisualization::VisualizationManager::instance().mainScene()->\n\t\t\taddOnZoomHandler([allItemsToScale](qreal factor)\n\t{\n\t\tfor (auto item : allItemsToScale)\n\t\t{\n\t\t\tif (factor >= 1.0)\n\t\t\t\titem->setScale(1.0);\n\t\t\telse if (factor >= 0.05)\n\t\t\t\titem->setScale((1\/factor));\n\t\t\telse\n\t\t\t\titem->setScale((1\/factor) * std::pow(0.95, 1\/factor));\n\t\t}\n\t});\n\n\t\/\/ set zoom level further out and center the scene\n\tVisualization::VisualizationManager::instance().mainView()->zoom(7);\n\tVisualization::VisualizationManager::instance().mainView()->\n\t\t\tcenterOn(Visualization::VisualizationManager::instance().mainView()->sceneRect().center());\n}\n\nVisualization::Item* DiffManager::addHighlightAndReturnItem(Model::Node* node, Visualization::ViewItem* viewItem,\n QString highlightOverlayName, QString highlightOverlayStyle)\n{\n\tVisualization::Item* resultItem = nullptr;\n\tif (node)\n\t{\n\t\tif ((resultItem = viewItem->findVisualizationOf(node)))\n\t\t{\n\t\t\tauto overlay = new Visualization::HighlightOverlay{resultItem,\n\t\t\t\t\tVisualization::HighlightOverlay::itemStyles().get(highlightOverlayStyle)};\n\t\t\tresultItem->addOverlay(overlay, highlightOverlayName);\n\t\t}\n\t\telse if (auto parent = DCast<Model::CompositeNode>(node->parent()))\n\t\t{\n\t\t\tauto index = parent->indexOf(node);\n\t\t\tif (!parent->meta().attribute(index).name().startsWith(\"_\"))\n\t\t\t\treturn addHighlightAndReturnItem(node->parent(), viewItem, highlightOverlayName, highlightOverlayStyle);\n\t\t}\n\t}\n\treturn resultItem;\n}\n\n\nQList<DiffComparisonPair*> DiffManager::createDiffComparisonPairs(DiffSetup& diffSetup,\n\t\t\t\t\t\t\t\t\t\t\t\t\t QSet<Model::NodeIdType> diffComparisonPairNodeIds)\n{\n\tQList<DiffComparisonPair*> diffComparisonPairs;\n\tfor (auto id : diffComparisonPairNodeIds)\n\t{\n\t\tauto oldNode = const_cast<Model::Node*>(diffSetup.oldVersionManager_->nodeIdMap().node(id));\n\t\tauto newNode = const_cast<Model::Node*>(diffSetup.newVersionManager_->nodeIdMap().node(id));\n\n\t\tauto diffNode = new DiffComparisonPair{oldNode, newNode};\n\n\t\tdiffComparisonPairs.append(diffNode);\n\t}\n\treturn diffComparisonPairs;\n}\n\nModel::TreeManager* DiffManager::createTreeManagerFromVersion(FilePersistence::GitRepository* repository,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t QString version)\n{\n\tif (version == FilePersistence::GitRepository::WORKDIR)\n\t{\n\t\tauto fileStore = new FilePersistence::SimpleTextFileStore {\"projects\/\"};\n\t\tModel::TreeManager* versionTreeManager = new Model::TreeManager{};\n\t\tversionTreeManager->load(fileStore, project_, false);\n\n\t\treturn versionTreeManager;\n\n\t}\n\n\tstd::unique_ptr<const FilePersistence::Commit> commit{repository->getCommit(version)};\n\n\tauto fileStore = new FilePersistence::SimpleTextFileStore {\n\t\t\t\t[this, &commit](QString filename, const char*& data, int& size)\n\t\t\t\t{ return commit->getFileContent(filename, data, size, false); }\n\t\t\t};\n\n\tModel::TreeManager* versionTreeManager = new Model::TreeManager{};\n\tversionTreeManager->load(fileStore, project_, false);\n\n\treturn versionTreeManager;\n}\n\n}\n<commit_msg>Move diffSetup declaration to first use<commit_after>\/***********************************************************************************************************************\n **\n ** Copyright (c) 2011, 2016 ETH Zurich\n ** All rights reserved.\n **\n ** Redistribution and use in source and binary forms, with or without modification, are permitted provided that the\n ** following conditions are met:\n **\n ** * Redistributions of source code must retain the above copyright notice, this list of conditions and the\n ** following disclaimer.\n ** * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the\n ** following disclaimer in the documentation and\/or other materials provided with the distribution.\n ** * Neither the name of the ETH Zurich nor the names of its contributors may be used to endorse or promote products\n ** derived from this software without specific prior written permission.\n **\n **\n ** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n ** INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n ** DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n ** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n ** SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,\n ** WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n ** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n **\n **********************************************************************************************************************\/\n\n#include \"DiffManager.h\"\n#include \"VersionControlUIException.h\"\n\n#include \"VisualizationBase\/src\/VisualizationManager.h\"\n#include \"VisualizationBase\/src\/items\/ViewItem.h\"\n#include \"VisualizationBase\/src\/nodes\/ViewItemNode.h\"\n#include \"VisualizationBase\/src\/ViewItemManager.h\"\n#include \"VisualizationBase\/src\/declarative\/GridLayouter.h\"\n#include \"VisualizationBase\/src\/overlays\/HighlightOverlay.h\"\n#include \"VisualizationBase\/src\/overlays\/ArrowOverlay.h\"\n#include \"VisualizationBase\/src\/views\/MainView.h\"\n\n#include \"FilePersistence\/src\/version_control\/GitRepository.h\"\n#include \"FilePersistence\/src\/simple\/SimpleTextFileStore.h\"\n\n#include \"OOModel\/src\/declarations\/Project.h\"\n#include \"OOModel\/src\/statements\/ExpressionStatement.h\"\n#include \"OOModel\/src\/expressions\/EmptyExpression.h\"\n\n#include \"ModelBase\/src\/model\/AllTreeManagers.h\"\n#include \"ModelBase\/src\/model\/TreeManager.h\"\n#include \"ModelBase\/src\/nodes\/Reference.h\"\n\n#include \"nodes\/DiffComparisonPair.h\"\n\nnamespace VersionControlUI\n{\n\nstruct ChangeWithNodes {\n\tModel::Node* oldNode_{};\n\tModel::Node* newNode_{};\n\tFilePersistence::ChangeType changeType_{FilePersistence::ChangeType::Unclassified};\n};\n\nstruct DiffSetup {\n\tModel::TreeManager* newVersionManager_{};\n\tModel::TreeManager* oldVersionManager_{};\n\tFilePersistence::GitRepository* repository_{};\n};\n\nDiffManager::DiffManager(QString oldVersion, QString newVersion, QString project,\n\t\t\t\t\t\t\t\t Model::SymbolMatcher contextUnitMatcher) :\n\toldVersion_{oldVersion}, newVersion_{newVersion}, project_{project}, contextUnitMatcher_{contextUnitMatcher}\n{}\n\nDiffSetup DiffManager::initializeDiffPrerequisites()\n{\n\n\n\tQString projectsDir = \"projects\/\" + project_;\n\n\t\/\/ get GitRepository\n\tif (!FilePersistence::GitRepository::repositoryExists(projectsDir))\n\t\tthrow VersionControlUIException{\"Diff setup not possible. No repository found at \" + projectsDir};\n\n\tDiffSetup diffSetup{};\n\tdiffSetup.repository_ = new FilePersistence::GitRepository{projectsDir};;\n\n\t\/\/ load newer version\n\tdiffSetup.newVersionManager_ = createTreeManagerFromVersion(diffSetup.repository_, newVersion_);\n\n\t\/\/ load older version\n\tdiffSetup.oldVersionManager_ = createTreeManagerFromVersion(diffSetup.repository_, oldVersion_);\n\n\tModel::Reference::resolvePending();\n\n\treturn diffSetup;\n\n}\n\nvoid DiffManager::computeChangeNodesAndNodesToVisualize(FilePersistence::IdToChangeDescriptionHash changes,\n\t\tQList<ChangeWithNodes>& changesWithNodes, QSet<Model::NodeIdType>& changedNodesToVisualize, DiffSetup& diffSetup)\n{\n\tfor (auto change : changes.values())\n\t{\n\t\t\/\/ TODO check flags\n\t\tif (change->isFake() || change->onlyStructureChange()) continue;\n\n\t\tauto id = change->nodeId();\n\n\t\tchangesWithNodes.append({const_cast<Model::Node*>(diffSetup.oldVersionManager_->nodeIdMap().node(id)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t const_cast<Model::Node*>(diffSetup.newVersionManager_->nodeIdMap().node(id)),\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t change->type()});\n\n\t\tModel::NodeIdType nodeId;\n\n\t\t\/\/ TODO maybe use node instead of id\n\t\tif (change->type() != FilePersistence::ChangeType::Deletion)\n\t\t\tif (findChangedNode(diffSetup.newVersionManager_, id, nodeId))\n\t\t\t\tchangedNodesToVisualize.insert(nodeId);\n\t\tif (change->type() != FilePersistence::ChangeType::Insertion)\n\t\t\tif (findChangedNode(diffSetup.oldVersionManager_, id, nodeId))\n\t\t\t\tchangedNodesToVisualize.insert(nodeId);\n\t}\n\n\tremoveDirectChildrenOfNodesInContainer(&changesWithNodes);\n}\n\nvoid DiffManager::visualize()\n{\n\tauto diffSetup = initializeDiffPrerequisites();\n\n\tFilePersistence::Diff diff = diffSetup.repository_->diff(oldVersion_, newVersion_);\n\n\tauto changes = diff.changes();\n\n\t\/\/ detailed changes\n\tQList<ChangeWithNodes> changesWithNodes;\n\n\t\/\/ contains the nodes which will be drawn\n\tQSet<Model::NodeIdType> changedNodesToVisualize;\n\n\n\t\/\/ fill up lists\n\tcomputeChangeNodesAndNodesToVisualize(changes, changesWithNodes, changedNodesToVisualize, diffSetup);\n\n\tVisualization::VisualizationManager::instance().mainScene()->listenToTreeManager(diffSetup.newVersionManager_);\n\tVisualization::VisualizationManager::instance().mainScene()->listenToTreeManager(diffSetup.oldVersionManager_);\n\n\tauto diffViewItem = Visualization::VisualizationManager::instance().mainScene()->\n\t\t\tviewItems()->viewItem(\"DiffView\");\n\n\tif (diffViewItem)\n\t\tVisualization::VisualizationManager::instance().mainScene()->\n\t\t\t\t\tviewItems()->removeViewItem(diffViewItem);\n\n\tdiffViewItem = Visualization::VisualizationManager::instance().mainScene()->\n\t\t\t\tviewItems()->newViewItem(\"DiffView\");\n\n\tdiffViewItem->setMajorAxis(Visualization::GridLayouter::NoMajor);\n\tdiffViewItem->setZoomLabelsEnabled(false);\n\n\tfor (auto diffComparisonPair : createDiffComparisonPairs(diffSetup, changedNodesToVisualize))\n\t\tdiffViewItem->insertNode(diffComparisonPair);\n\n\t\/\/ create visualization for changes\n\tVisualization::VisualizationManager::instance().mainScene()->addPostEventAction(\n\t\t\t\t\t\t\t\t [diffViewItem, changesWithNodes]() {\n\t\tcreateOverlaysForChanges(diffViewItem, changesWithNodes);\n\t});\n\n\t\/\/ switch to the newly created view\n\tVisualization::VisualizationManager::instance().mainScene()->viewItems()->switchToView(diffViewItem);\n}\n\n\/\/ TODO maybe better implementation for this\nvoid DiffManager::removeDirectChildrenOfNodesInContainer(QList<ChangeWithNodes>* container)\n{\n\tQHash<Model::Node*, FilePersistence::ChangeType> oldNodes;\n\tQHash<Model::Node*, FilePersistence::ChangeType> newNodes;\n\n\tfor (auto change : *container)\n\t{\n\t\tif (change.oldNode_)\n\t\t\toldNodes.insert(change.oldNode_, change.changeType_);\n\t\tif (change.newNode_)\n\t\t\tnewNodes.insert(change.newNode_, change.changeType_);\n\t}\n\n\tQSet<Model::Node*> oldNodesMarkedForRemoval = findAllNodesWithDirectParentPresent(oldNodes);\n\tQSet<Model::Node*> newNodesMarkedForRemoval = findAllNodesWithDirectParentPresent(newNodes);\n\n\tauto it = container->begin();\n\twhile (it != container->end())\n\t{\n\t\tif (oldNodesMarkedForRemoval.contains(it->oldNode_) || newNodesMarkedForRemoval.contains(it->newNode_))\n\t\t\tit = container->erase(it);\n\t\telse\n\t\t\tit++;\n\t}\n}\n\nQSet<Model::Node*> DiffManager::findAllNodesWithDirectParentPresent(QHash<Model::Node*,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t FilePersistence::ChangeType>& nodes)\n{\n\tQSet<Model::Node*> result;\n\tfor (auto node : nodes.keys())\n\t\t\/\/ check that changeType also matches\n\t\tif (nodes.contains(node->parent()) && nodes[node] == nodes[node->parent()])\n\t\t\t\tresult.insert(node);\n\n\treturn result;\n}\n\nQSet<Visualization::Item*> DiffManager::findAllItemsWithAncestorsIn(QSet<Visualization::Item*> items)\n{\n\tQSet<Visualization::Item*> result;\n\tfor (auto item : items)\n\t{\n\t\tauto parent = item->parent();\n\t\twhile (parent)\n\t\t{\n\t\t\tif (items.contains(parent))\n\t\t\t{\n\t\t\t\tresult.insert(item);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tparent = parent->parent();\n\t\t}\n\t}\n\n\treturn result;\n}\n\n\/\/ TODO find good way to return and use Node instead of Id\nbool DiffManager::findChangedNode(Model::TreeManager* treeManager, Model::NodeIdType id, Model::NodeIdType& resultId)\n{\n\tif (auto node = const_cast<Model::Node*>(treeManager->nodeIdMap().node(id)))\n\t{\n\n\t\tModel::Node* changedNode = nullptr;\n\n\t\tif (auto ancestorNode = node->firstAncestorOfType(contextUnitMatcher_))\n\t\t{\n\t\t\tchangedNode = ancestorNode;\n\n\t\t\tresultId = treeManager->nodeIdMap().id(changedNode);\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tresultId = treeManager->nodeIdMap().id(node);\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nvoid DiffManager::createOverlaysForChanges(Visualization::ViewItem* diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t QList<ChangeWithNodes> changesWithNodes)\n{\n\tstatic const QString arrowLayer = \"move_arrows\";\n\tdiffViewItem->setArrowStyle(arrowLayer, \"thick\");\n\n\tQSet<Visualization::Item*> allItemsToScale;\n\tfor (auto change : changesWithNodes)\n\t{\n\t\tQString highlightOverlayStyle;\n\t\tQString highlightOverlayName;\n\n\t\tswitch (change.changeType_)\n\t\t{\n\t\t\tcase FilePersistence::ChangeType::Deletion:\n\t\t\t\thighlightOverlayName = \"delete_highlights\";\n\t\t\t\thighlightOverlayStyle = \"delete_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Insertion:\n\t\t\t\thighlightOverlayName = \"insert_highlights\";\n\t\t\t\thighlightOverlayStyle = \"insert_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Move:\n\t\t\t\thighlightOverlayName = \"move_highlights\";\n\t\t\t\thighlightOverlayStyle = \"move_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Stationary:\n\t\t\t\thighlightOverlayName = \"modify_highlights\";\n\t\t\t\thighlightOverlayStyle = \"modify_no_bg_solid_outline\";\n\t\t\t\tbreak;\n\t\t\tcase FilePersistence::ChangeType::Unclassified:\n\t\t\t\tQ_ASSERT(false);\n\t\t\t\tbreak;\n\t\t}\n\n\t\tVisualization::Item* oldNodeItem = addHighlightAndReturnItem(change.oldNode_, diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thighlightOverlayName, highlightOverlayStyle);;\n\t\tVisualization::Item* newNodeItem = addHighlightAndReturnItem(change.newNode_, diffViewItem,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\thighlightOverlayName, highlightOverlayStyle);;\n\n\t\tif (oldNodeItem)\n\t\t\tallItemsToScale.insert(oldNodeItem);\n\n\t\tif (newNodeItem)\n\t\t\tallItemsToScale.insert(newNodeItem);\n\n\t\tif (change.changeType_== FilePersistence::ChangeType::Move)\n\t\t{\n\t\t\tauto overlay = new Visualization::ArrowOverlay{oldNodeItem, newNodeItem,\n\t\t\t\t\t Visualization::ArrowOverlay::itemStyles().get(\"thick\")};\n\t\t\tdiffViewItem->addOverlay(overlay, arrowLayer);\n\t\t}\n\n\t}\n\n\tQSet<Visualization::Item*> removeItems = findAllItemsWithAncestorsIn(allItemsToScale);\n\n\tallItemsToScale.subtract(removeItems);\n\n\tVisualization::VisualizationManager::instance().mainScene()->\n\t\t\taddOnZoomHandler([allItemsToScale](qreal factor)\n\t{\n\t\tfor (auto item : allItemsToScale)\n\t\t{\n\t\t\tif (factor >= 1.0)\n\t\t\t\titem->setScale(1.0);\n\t\t\telse if (factor >= 0.05)\n\t\t\t\titem->setScale((1\/factor));\n\t\t\telse\n\t\t\t\titem->setScale((1\/factor) * std::pow(0.95, 1\/factor));\n\t\t}\n\t});\n\n\t\/\/ set zoom level further out and center the scene\n\tVisualization::VisualizationManager::instance().mainView()->zoom(7);\n\tVisualization::VisualizationManager::instance().mainView()->\n\t\t\tcenterOn(Visualization::VisualizationManager::instance().mainView()->sceneRect().center());\n}\n\nVisualization::Item* DiffManager::addHighlightAndReturnItem(Model::Node* node, Visualization::ViewItem* viewItem,\n QString highlightOverlayName, QString highlightOverlayStyle)\n{\n\tVisualization::Item* resultItem = nullptr;\n\tif (node)\n\t{\n\t\tif ((resultItem = viewItem->findVisualizationOf(node)))\n\t\t{\n\t\t\tauto overlay = new Visualization::HighlightOverlay{resultItem,\n\t\t\t\t\tVisualization::HighlightOverlay::itemStyles().get(highlightOverlayStyle)};\n\t\t\tresultItem->addOverlay(overlay, highlightOverlayName);\n\t\t}\n\t\telse if (auto parent = DCast<Model::CompositeNode>(node->parent()))\n\t\t{\n\t\t\tauto index = parent->indexOf(node);\n\t\t\tif (!parent->meta().attribute(index).name().startsWith(\"_\"))\n\t\t\t\treturn addHighlightAndReturnItem(node->parent(), viewItem, highlightOverlayName, highlightOverlayStyle);\n\t\t}\n\t}\n\treturn resultItem;\n}\n\n\nQList<DiffComparisonPair*> DiffManager::createDiffComparisonPairs(DiffSetup& diffSetup,\n\t\t\t\t\t\t\t\t\t\t\t\t\t QSet<Model::NodeIdType> diffComparisonPairNodeIds)\n{\n\tQList<DiffComparisonPair*> diffComparisonPairs;\n\tfor (auto id : diffComparisonPairNodeIds)\n\t{\n\t\tauto oldNode = const_cast<Model::Node*>(diffSetup.oldVersionManager_->nodeIdMap().node(id));\n\t\tauto newNode = const_cast<Model::Node*>(diffSetup.newVersionManager_->nodeIdMap().node(id));\n\n\t\tauto diffNode = new DiffComparisonPair{oldNode, newNode};\n\n\t\tdiffComparisonPairs.append(diffNode);\n\t}\n\treturn diffComparisonPairs;\n}\n\nModel::TreeManager* DiffManager::createTreeManagerFromVersion(FilePersistence::GitRepository* repository,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t QString version)\n{\n\tif (version == FilePersistence::GitRepository::WORKDIR)\n\t{\n\t\tauto fileStore = new FilePersistence::SimpleTextFileStore {\"projects\/\"};\n\t\tModel::TreeManager* versionTreeManager = new Model::TreeManager{};\n\t\tversionTreeManager->load(fileStore, project_, false);\n\n\t\treturn versionTreeManager;\n\n\t}\n\n\tstd::unique_ptr<const FilePersistence::Commit> commit{repository->getCommit(version)};\n\n\tauto fileStore = new FilePersistence::SimpleTextFileStore {\n\t\t\t\t[this, &commit](QString filename, const char*& data, int& size)\n\t\t\t\t{ return commit->getFileContent(filename, data, size, false); }\n\t\t\t};\n\n\tModel::TreeManager* versionTreeManager = new Model::TreeManager{};\n\tversionTreeManager->load(fileStore, project_, false);\n\n\treturn versionTreeManager;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cassert>\n#include \"days.hpp\"\n#include \"utils.hpp\"\n\nnamespace {\n bool bounds_check(aoc2019::IntCodeComputer computer, std::int64_t x, std::int64_t y) {\n std::deque<std::int64_t> output_buffer;\n computer.connectOutput(output_buffer);\n\n computer.sendInput(x);\n computer.sendInput(y);\n\n computer.run();\n assert(computer.isTerminated());\n assert(!output_buffer.empty());\n\n return output_buffer.front();\n }\n}\n\nvoid aoc2019::day19_part1(std::istream &input, std::ostream &output) {\n IntCodeComputer computer(input);\n\n std::int64_t covered = 0;\n int last_width = 1;\n int last_start = 0;\n for (std::int64_t y = 0; y < 50; ++y) {\n auto x = last_start;\n\n while (!bounds_check(computer, x, y) && x < 50) {\n ++x;\n }\n\n if (x == 50) break;\n\n last_start = x;\n x += last_width - 1;\n\n if (!bounds_check(computer, x, y)) {\n std::cerr << x << \",\" << y << \",\" << covered << std::endl;\n throw std::logic_error(\"Assumption false\");\n }\n\n while (bounds_check(computer, x, y) && x < 50) {\n ++x;\n }\n\n last_width = x - last_start;\n covered += last_width;\n }\n\n output << covered << std::endl;\n}\n\nvoid aoc2019::day19_part2(std::istream &input, std::ostream &output) {\n\toutput << \"Not implemented\\n\";\n}\n<commit_msg>Implement day 19 part 2.<commit_after>#include <iostream>\n#include <cassert>\n#include <queue>\n#include \"days.hpp\"\n#include \"utils.hpp\"\n\nnamespace {\n bool bounds_check(aoc2019::IntCodeComputer computer, std::int64_t x, std::int64_t y) {\n std::deque<std::int64_t> output_buffer;\n computer.connectOutput(output_buffer);\n\n computer.sendInput(x);\n computer.sendInput(y);\n\n computer.run();\n assert(computer.isTerminated());\n assert(!output_buffer.empty());\n\n return output_buffer.front();\n }\n\n class Beam {\n private:\n aoc2019::IntCodeComputer computer;\n std::int64_t last_width = 1;\n std::int64_t last_start = 0;\n std::int64_t y = 0;\n\n public:\n Beam(std::istream &input) : computer(input) {};\n\n std::pair<std::int64_t, std::int64_t> next() {\n auto x = last_start;\n\n while (!bounds_check(computer, x, y)) {\n ++x;\n }\n\n last_start = x;\n x += last_width - 1;\n\n while (bounds_check(computer, x, y)) {\n ++x;\n }\n\n last_width = x - last_start;\n ++y;\n\n return {last_start, last_width};\n }\n };\n}\n\nvoid aoc2019::day19_part1(std::istream &input, std::ostream &output) {\n Beam beam(input);\n\n std::int64_t covered = 0;\n for (std::int64_t y = 0; y < 50; ++y) {\n const auto[start, width] = beam.next();\n\n if (start >= 50) break;\n\n covered += std::min(50 - start, width);\n }\n\n output << covered << std::endl;\n}\n\nvoid aoc2019::day19_part2(std::istream &input, std::ostream &output) {\n Beam beam(input);\n std::queue<std::int64_t> beam_ends;\n\n constexpr std::int64_t DIMENSION = 100;\n\n for (std::int64_t y = 0; true; ++y) {\n const auto[start, width] = beam.next();\n\n beam_ends.push(start + width);\n if (beam_ends.size() == DIMENSION) {\n auto end = beam_ends.front();\n if (end - start >= DIMENSION) {\n auto result = start * 10000 + y - DIMENSION + 1;\n output << result << std::endl;\n return;\n }\n beam_ends.pop();\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"DriveInfo.h\"\n\n#include \"Logger.h\"\n#include \"StringUtils.h\"\n\nDriveInfo::DriveInfo(wchar_t driveLetter) :\n_letter(driveLetter) {\n std::wstring driveFileName = DriveFileName(driveLetter);\n _devHandle = CreateFile(\n driveFileName.c_str(),\n FILE_READ_ATTRIBUTES,\n FILE_SHARE_READ | FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n 0,\n NULL);\n\n if (_devHandle == INVALID_HANDLE_VALUE) {\n \/\/ TODO perhaps this should throw an error?\n CLOG(L\"Failed to get device handle\");\n return;\n }\n\n PopulateDeviceId();\n PopulateDeviceInfo();\n PopulateHotplugInfo();\n PopulateVolumeInfo();\n\n CloseHandle(_devHandle);\n}\n\nconst wchar_t DriveInfo::DriveLetter() {\n return _letter;\n}\n\nbool DriveInfo::HasRemovableMedia() {\n return _hasRemovableMedia;\n}\n\nbool DriveInfo::IsHotPluggable() {\n return _isHotplug;\n}\n\nconst std::wstring &DriveInfo::ProductID() {\n return _productId;\n}\n\nDWORD DriveInfo::SerialNumber() {\n return _serial;\n}\n\nconst std::wstring &DriveInfo::VendorID() {\n return _vendorId;\n}\n\nconst std::wstring &DriveInfo::VolumeLabel() {\n return _volumeName;\n}\n\nvoid DriveInfo::PopulateDeviceId() {\n STORAGE_DEVICE_NUMBER sdn = { 0 };\n DWORD bytesOut;\n\n BOOL result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_GET_DEVICE_NUMBER,\n NULL,\n 0,\n &sdn,\n sizeof(sdn),\n &bytesOut,\n NULL);\n\n if (result == 0) {\n Logger::LogLastError();\n return;\n }\n\n _devId = sdn.DeviceNumber;\n}\n\nvoid DriveInfo::PopulateDeviceInfo() {\n STORAGE_PROPERTY_QUERY propertyQuery;\n propertyQuery.PropertyId = StorageDeviceProperty;\n propertyQuery.QueryType = PropertyStandardQuery;\n\n STORAGE_DESCRIPTOR_HEADER storageHeader = { 0 };\n\n DWORD bytesOut;\n BOOL result;\n\n result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_QUERY_PROPERTY,\n &propertyQuery,\n sizeof(propertyQuery),\n &storageHeader,\n sizeof(storageHeader),\n &bytesOut,\n NULL);\n\n if (!result) {\n Logger::LogLastError();\n return;\n }\n\n unsigned char *descriptorData = new unsigned char[storageHeader.Size];\n\n result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_QUERY_PROPERTY,\n &propertyQuery,\n sizeof(propertyQuery),\n descriptorData,\n storageHeader.Size,\n &bytesOut,\n NULL);\n\n if (!result) {\n delete[] descriptorData;\n Logger::LogLastError();\n return;\n }\n\n STORAGE_DEVICE_DESCRIPTOR *sdd\n = (STORAGE_DEVICE_DESCRIPTOR *) descriptorData;\n\n if (sdd->ProductIdOffset) {\n _productId = StringUtils::Widen(\n (const char *) ((unsigned char *) sdd + sdd->ProductIdOffset));\n }\n\n if (sdd->VendorIdOffset) {\n _vendorId = StringUtils::Widen(\n (const char *) ((unsigned char *) sdd + sdd->VendorIdOffset));\n }\n\n if (sdd->RemovableMedia) {\n _hasRemovableMedia = true;\n }\n\n CLOG(\"ProductID: '%s'\\nVendor ID: '%s'\",\n _productId.c_str(), _vendorId.c_str());\n\n delete[] descriptorData;\n}\n\nvoid DriveInfo::PopulateHotplugInfo() {\n STORAGE_HOTPLUG_INFO shi = { 0 };\n DWORD bytesOut;\n\n BOOL result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_GET_HOTPLUG_INFO,\n NULL,\n 0,\n &shi,\n sizeof(shi),\n &bytesOut,\n NULL);\n\n if (result == 0) {\n Logger::LogLastError();\n return;\n }\n\n if (shi.DeviceHotplug) {\n _isHotplug = true;\n }\n\n if (shi.MediaRemovable) {\n _hasRemovableMedia = true;\n }\n}\n\nvoid DriveInfo::PopulateVolumeInfo() {\n wchar_t drivePath[] = L\" :\\\\\";\n drivePath[0] = _letter;\n wchar_t volName[MAX_PATH] = { 0 };\n DWORD serial = 0;\n\n BOOL result = GetVolumeInformation(\n drivePath,\n volName, MAX_PATH,\n &serial,\n NULL, NULL, NULL, NULL);\n\n if (result == FALSE) {\n _volumeName = L\"\";\n _serial = 0;\n }\n CLOG(L\"NAME: %s\", volName);\n\n _volumeName = std::wstring(volName);\n _serial = serial;\n}\n\nstd::wstring DriveInfo::DriveFileName(wchar_t &driveLetter) {\n return DriveFileName(std::wstring(1, driveLetter));\n}\n\nstd::wstring DriveInfo::DriveFileName(const std::wstring &driveLetter) {\n return L\"\\\\\\\\.\\\\\" + driveLetter + L\":\";\n}\n\n<commit_msg>Trim drive ID strings<commit_after>\/\/ Copyright (c) 2016, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"DriveInfo.h\"\n\n#include \"Logger.h\"\n#include \"StringUtils.h\"\n\nDriveInfo::DriveInfo(wchar_t driveLetter) :\n_letter(driveLetter) {\n std::wstring driveFileName = DriveFileName(driveLetter);\n _devHandle = CreateFile(\n driveFileName.c_str(),\n FILE_READ_ATTRIBUTES,\n FILE_SHARE_READ | FILE_SHARE_WRITE,\n NULL,\n OPEN_EXISTING,\n 0,\n NULL);\n\n if (_devHandle == INVALID_HANDLE_VALUE) {\n \/\/ TODO perhaps this should throw an error?\n CLOG(L\"Failed to get device handle\");\n return;\n }\n\n PopulateDeviceId();\n PopulateDeviceInfo();\n PopulateHotplugInfo();\n PopulateVolumeInfo();\n\n CloseHandle(_devHandle);\n}\n\nconst wchar_t DriveInfo::DriveLetter() {\n return _letter;\n}\n\nbool DriveInfo::HasRemovableMedia() {\n return _hasRemovableMedia;\n}\n\nbool DriveInfo::IsHotPluggable() {\n return _isHotplug;\n}\n\nconst std::wstring &DriveInfo::ProductID() {\n return _productId;\n}\n\nDWORD DriveInfo::SerialNumber() {\n return _serial;\n}\n\nconst std::wstring &DriveInfo::VendorID() {\n return _vendorId;\n}\n\nconst std::wstring &DriveInfo::VolumeLabel() {\n return _volumeName;\n}\n\nvoid DriveInfo::PopulateDeviceId() {\n STORAGE_DEVICE_NUMBER sdn = { 0 };\n DWORD bytesOut;\n\n BOOL result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_GET_DEVICE_NUMBER,\n NULL,\n 0,\n &sdn,\n sizeof(sdn),\n &bytesOut,\n NULL);\n\n if (result == 0) {\n Logger::LogLastError();\n return;\n }\n\n _devId = sdn.DeviceNumber;\n}\n\nvoid DriveInfo::PopulateDeviceInfo() {\n STORAGE_PROPERTY_QUERY propertyQuery;\n propertyQuery.PropertyId = StorageDeviceProperty;\n propertyQuery.QueryType = PropertyStandardQuery;\n\n STORAGE_DESCRIPTOR_HEADER storageHeader = { 0 };\n\n DWORD bytesOut;\n BOOL result;\n\n result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_QUERY_PROPERTY,\n &propertyQuery,\n sizeof(propertyQuery),\n &storageHeader,\n sizeof(storageHeader),\n &bytesOut,\n NULL);\n\n if (!result) {\n Logger::LogLastError();\n return;\n }\n\n unsigned char *descriptorData = new unsigned char[storageHeader.Size];\n\n result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_QUERY_PROPERTY,\n &propertyQuery,\n sizeof(propertyQuery),\n descriptorData,\n storageHeader.Size,\n &bytesOut,\n NULL);\n\n if (!result) {\n delete[] descriptorData;\n Logger::LogLastError();\n return;\n }\n\n STORAGE_DEVICE_DESCRIPTOR *sdd\n = (STORAGE_DEVICE_DESCRIPTOR *) descriptorData;\n\n if (sdd->ProductIdOffset) {\n _productId = StringUtils::Widen(\n (const char *) ((unsigned char *) sdd + sdd->ProductIdOffset));\n _productId = StringUtils::Trim(_productId);\n }\n\n if (sdd->VendorIdOffset) {\n _vendorId = StringUtils::Widen(\n (const char *) ((unsigned char *) sdd + sdd->VendorIdOffset));\n _vendorId = StringUtils::Trim(_vendorId);\n }\n\n if (sdd->RemovableMedia) {\n _hasRemovableMedia = true;\n }\n\n CLOG(\"ProductID: '%s'\\nVendor ID: '%s'\",\n _productId.c_str(), _vendorId.c_str());\n\n delete[] descriptorData;\n}\n\nvoid DriveInfo::PopulateHotplugInfo() {\n STORAGE_HOTPLUG_INFO shi = { 0 };\n DWORD bytesOut;\n\n BOOL result = DeviceIoControl(\n _devHandle,\n IOCTL_STORAGE_GET_HOTPLUG_INFO,\n NULL,\n 0,\n &shi,\n sizeof(shi),\n &bytesOut,\n NULL);\n\n if (result == 0) {\n Logger::LogLastError();\n return;\n }\n\n if (shi.DeviceHotplug) {\n _isHotplug = true;\n }\n\n if (shi.MediaRemovable) {\n _hasRemovableMedia = true;\n }\n}\n\nvoid DriveInfo::PopulateVolumeInfo() {\n wchar_t drivePath[] = L\" :\\\\\";\n drivePath[0] = _letter;\n wchar_t volName[MAX_PATH] = { 0 };\n DWORD serial = 0;\n\n BOOL result = GetVolumeInformation(\n drivePath,\n volName, MAX_PATH,\n &serial,\n NULL, NULL, NULL, NULL);\n\n if (result == FALSE) {\n _volumeName = L\"\";\n _serial = 0;\n }\n\n _volumeName = StringUtils::Trim(volName);\n _serial = serial;\n}\n\nstd::wstring DriveInfo::DriveFileName(wchar_t &driveLetter) {\n return DriveFileName(std::wstring(1, driveLetter));\n}\n\nstd::wstring DriveInfo::DriveFileName(const std::wstring &driveLetter) {\n return L\"\\\\\\\\.\\\\\" + driveLetter + L\":\";\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012, 2013 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n#pragma once\n#ifndef _LIBQI_QI_OS_HPP_\n#define _LIBQI_QI_OS_HPP_\n\n# include <cstdio>\n# include <string>\n# include <map>\n# include <vector>\n# include <qi\/api.hpp>\n# include <qi\/types.hpp>\n\nstruct stat;\n\nnamespace qi {\n\n namespace os {\n\n QI_API FILE* fopen(const char *filename, const char *mode);\n QI_API int stat(const char *filename, struct stat *pstat);\n QI_API int checkdbg();\n QI_API std::string home();\n QI_API std::string mktmpdir(const char *prefix = \"\");\n QI_API std::string tmp();\n QI_API std::string gethostname();\n\n \/\/ lib C\n QI_API char* strdup(const char *src);\n QI_API int snprintf(char *str, size_t size, const char *format, ...);\n\n \/\/ env\n QI_API std::string getenv(const char *var);\n QI_API int setenv(const char *var, const char *value);\n\n \/\/ time\n QI_API void sleep(unsigned int seconds);\n QI_API void msleep(unsigned int milliseconds);\n struct QI_API timeval {\n long tv_sec;\n long tv_usec;\n };\n QI_API int gettimeofday(qi::os::timeval *tp);\n QI_API qi::int64_t ustime();\n QI_API qi::os::timeval operator+(const qi::os::timeval &lhs,\n const qi::os::timeval &rhs);\n QI_API qi::os::timeval operator+(const qi::os::timeval &lhs,\n long us);\n QI_API qi::os::timeval operator-(const qi::os::timeval &lhs,\n const qi::os::timeval &rhs);\n QI_API qi::os::timeval operator-(const qi::os::timeval &lhs,\n long us);\n\n \/\/ shared library\n QI_API void *dlopen(const char *filename, int flag = -1);\n QI_API int dlclose(void *handle);\n QI_API void *dlsym(void *handle, const char *symbol);\n QI_API const char *dlerror(void);\n\n \/\/ process management\n QI_API int spawnvp(char *const argv[]);\n QI_API int spawnlp(const char* argv, ...);\n QI_API int system(const char *command);\n QI_API int getpid();\n QI_API int gettid();\n QI_API int waitpid(int pid, int* status);\n QI_API int kill(int pid, int sig);\n\n \/\/ trad\n QI_API std::string gettext(const std::string &msgid);\n QI_API std::string dgettext(const std::string &domainname,\n const std::string &msgid);\n\n QI_API unsigned short findAvailablePort(unsigned short port);\n QI_API std::map<std::string, std::vector<std::string> > hostIPAddrs(bool ipv6Addr = false);\n\n QI_API void setCurrentThreadName(const std::string &name);\n\n QI_API std::string getMachineId();\n\n \/\/since 1.12.1\n QI_API_DEPRECATED QI_API std::string tmpdir(const char *prefix = \"\");\n }\n}\n\n\n#endif \/\/ _LIBQI_QI_OS_HPP_\n<commit_msg>qi::os::timeval: use long long instead of long<commit_after>\/*\n * Copyright (c) 2012, 2013 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n#pragma once\n#ifndef _LIBQI_QI_OS_HPP_\n#define _LIBQI_QI_OS_HPP_\n\n# include <cstdio>\n# include <string>\n# include <map>\n# include <vector>\n# include <qi\/api.hpp>\n# include <qi\/types.hpp>\n\nstruct stat;\n\nnamespace qi {\n\n namespace os {\n\n QI_API FILE* fopen(const char *filename, const char *mode);\n QI_API int stat(const char *filename, struct stat *pstat);\n QI_API int checkdbg();\n QI_API std::string home();\n QI_API std::string mktmpdir(const char *prefix = \"\");\n QI_API std::string tmp();\n QI_API std::string gethostname();\n\n \/\/ lib C\n QI_API char* strdup(const char *src);\n QI_API int snprintf(char *str, size_t size, const char *format, ...);\n\n \/\/ env\n QI_API std::string getenv(const char *var);\n QI_API int setenv(const char *var, const char *value);\n\n \/\/ time\n QI_API void sleep(unsigned int seconds);\n QI_API void msleep(unsigned int milliseconds);\n struct QI_API timeval {\n qi::int64_t tv_sec;\n qi::int64_t tv_usec;\n };\n QI_API int gettimeofday(qi::os::timeval *tp);\n QI_API qi::int64_t ustime();\n QI_API qi::os::timeval operator+(const qi::os::timeval &lhs,\n const qi::os::timeval &rhs);\n QI_API qi::os::timeval operator+(const qi::os::timeval &lhs,\n long us);\n QI_API qi::os::timeval operator-(const qi::os::timeval &lhs,\n const qi::os::timeval &rhs);\n QI_API qi::os::timeval operator-(const qi::os::timeval &lhs,\n long us);\n\n \/\/ shared library\n QI_API void *dlopen(const char *filename, int flag = -1);\n QI_API int dlclose(void *handle);\n QI_API void *dlsym(void *handle, const char *symbol);\n QI_API const char *dlerror(void);\n\n \/\/ process management\n QI_API int spawnvp(char *const argv[]);\n QI_API int spawnlp(const char* argv, ...);\n QI_API int system(const char *command);\n QI_API int getpid();\n QI_API int gettid();\n QI_API int waitpid(int pid, int* status);\n QI_API int kill(int pid, int sig);\n\n \/\/ trad\n QI_API std::string gettext(const std::string &msgid);\n QI_API std::string dgettext(const std::string &domainname,\n const std::string &msgid);\n\n QI_API unsigned short findAvailablePort(unsigned short port);\n QI_API std::map<std::string, std::vector<std::string> > hostIPAddrs(bool ipv6Addr = false);\n\n QI_API void setCurrentThreadName(const std::string &name);\n\n QI_API std::string getMachineId();\n\n \/\/since 1.12.1\n QI_API_DEPRECATED QI_API std::string tmpdir(const char *prefix = \"\");\n }\n}\n\n\n#endif \/\/ _LIBQI_QI_OS_HPP_\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#ifndef INCLUDE_OCVG_DARKLIGHT\n#define INCLUDE_OCVG_DARKLIGHT\n\n#include \"..\\stdafx.h\"\n\nusing namespace cv;\nusing namespace cuda;\nusing namespace std;\n\nnamespace openCVGraph\n{\n \/\/ Brightfield \/ Darkfield correction\n \/\/ Corrected = (Image - Darkfield) \/ (Brightfield - Darkfield) * 2**16 (for 16 bit data)\n\n class BrightDarkFieldCorrection : public Filter\n {\n public:\n\n static void BrightDarkFieldCorrection::SliderCallback(int pos, void * userData) {\n BrightDarkFieldCorrection* filter = (BrightDarkFieldCorrection *)userData;\n filter->FieldToView(pos);\n }\n\n BrightDarkFieldCorrection::BrightDarkFieldCorrection(std::string name, GraphData& graphData,\n int width = 512, int height = 512)\n : Filter(name, graphData, width, height)\n {\n\n }\n\n bool BrightDarkFieldCorrection::init(GraphData& graphData) override\n {\n Filter::init(graphData);\n\n graphData.m_NeedCV_16UC1 = true;\n \/\/ Need 8 bit if we're viewing it\n if (m_showView) {\n graphData.m_NeedCV_8UC1 = true;\n }\n\n \/\/ get the Bright Dark images from file\n\n Mat img = imread(m_BrightFieldPath, CV_LOAD_IMAGE_ANYDEPTH | CV_LOAD_IMAGE_GRAYSCALE);\n if (!img.empty()) {\n m_imBrightFieldGpu16U.upload(img);\n }\n else {\n assert(false);\n }\n\n img = imread(m_DarkFieldPath, CV_LOAD_IMAGE_ANYDEPTH | CV_LOAD_IMAGE_GRAYSCALE);\n if (!img.empty()) {\n m_imDarkFieldGpu16U.upload(img);\n }\n else {\n assert(false);\n }\n\n \/\/ Bright - Dark as 32F\n cuda::subtract(m_imBrightFieldGpu16U, m_imDarkFieldGpu16U, m_imTemp16UGpu);\n m_imTemp16UGpu.convertTo(m_imBrightMinusDarkFieldGpu32F, CV_32F);\n\n if (m_showView) {\n \/\/ To write on the overlay, you must allocate it.\n \/\/ This indicates to the renderer the need to merge it with the final output image.\n \/\/ m_imViewTextOverlay = Mat(m_width, m_height, CV_8U);\n\n if (m_showSlider) {\n createTrackbar(\"BrightDarkFieldCorrection\", m_CombinedName, &m_FieldToView, 4, SliderCallback, this);\n }\n }\n\n return true;\n }\n\n ProcessResult BrightDarkFieldCorrection::process(GraphData& graphData) override\n {\n if (graphData.m_UseCuda) {\n \/\/ sub darkfield\n cuda::subtract(graphData.m_imCapGpu16UC1, m_imDarkFieldGpu16U, m_imTemp16UGpu);\n \/\/ make 32F\n m_imTemp16UGpu.convertTo(m_imTemp32FGpu, CV_32F);\n \/\/ image - dark \/ bright - dark\n cuda::divide(m_imTemp32FGpu, m_imBrightMinusDarkFieldGpu32F, m_imTemp16UGpu);\n\n m_imTemp16UGpu.convertTo(graphData.m_imOutGpu16UC1, CV_16U, 65536);\n\n if (graphData.m_NeedCV_8UC1) {\n graphData.m_imOutGpu16UC1.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n }\n }\n else {\n \/\/todo\n assert(false);\n\n }\n\n return ProcessResult::OK; \/\/ if you return false, the graph stops\n }\n\n void BrightDarkFieldCorrection::processView(GraphData & graphData) override\n {\n if (m_showView) {\n switch (m_FieldToView) {\n case 0:\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 1:\n graphData.m_imCapGpu16UC1.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 2:\n m_imBrightFieldGpu16U.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 3:\n m_imDarkFieldGpu16U.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n\n }\n Filter::processView(graphData);\n }\n }\n\n void BrightDarkFieldCorrection::FieldToView(int n) {\n m_FieldToView = n;\n }\n\n void BrightDarkFieldCorrection::saveConfig(FileStorage& fs, GraphData& data)\n {\n Filter::saveConfig(fs, data);\n fs <<\"bright_field_path\" << m_BrightFieldPath.c_str();\n fs <<\"dark_field_path\" << m_DarkFieldPath.c_str();\n fs << \"show_slider\" << m_showSlider;\n }\n\n void BrightDarkFieldCorrection::loadConfig(FileNode& fs, GraphData& data)\n {\n Filter::loadConfig(fs, data);\n fs[\"bright_field_path\"] >> m_BrightFieldPath;\n fs[\"dark_field_path\"] >> m_DarkFieldPath;\n fs[\"show_slider\"] >> m_showSlider;\n }\n\n private:\n cv::cuda::GpuMat m_imTemp16UGpu; \/\/ 32F\n cv::cuda::GpuMat m_imTemp32FGpu; \/\/ 32F\n cv::cuda::GpuMat m_imBrightFieldGpu16U; \/\/ 16U\n cv::cuda::GpuMat m_imDarkFieldGpu16U; \/\/ 16U\n cv::cuda::GpuMat m_imBrightMinusDarkFieldGpu32F; \/\/ 32F\n\n std::string m_BrightFieldPath = \"config\/BrightField.tif\";\n std::string m_DarkFieldPath = \"config\/DarkField.tif\";\n\n int m_FieldToView = 0; \/\/ 0 is processed, 1 is unprocessed, 2 is darkfield, 3 is brightfield\n bool m_showSlider = true;\n\n };\n}\n#endif<commit_msg>Logging BrightDarkfield<commit_after>#pragma once\n\n#ifndef INCLUDE_OCVG_DARKLIGHT\n#define INCLUDE_OCVG_DARKLIGHT\n\n#include \"..\\stdafx.h\"\n\nusing namespace cv;\nusing namespace cuda;\nusing namespace std;\n\nnamespace openCVGraph\n{\n \/\/ Brightfield \/ Darkfield correction\n \/\/ Corrected = (Image - Darkfield) \/ (Brightfield - Darkfield) * 2**16 (for 16 bit data)\n\n class BrightDarkFieldCorrection : public Filter\n {\n public:\n\n static void BrightDarkFieldCorrection::SliderCallback(int pos, void * userData) {\n BrightDarkFieldCorrection* filter = (BrightDarkFieldCorrection *)userData;\n filter->FieldToView(pos);\n }\n\n BrightDarkFieldCorrection::BrightDarkFieldCorrection(std::string name, GraphData& graphData,\n int width = 512, int height = 512)\n : Filter(name, graphData, width, height)\n {\n\n }\n\n bool BrightDarkFieldCorrection::init(GraphData& graphData) override\n {\n Filter::init(graphData);\n\n graphData.m_NeedCV_16UC1 = true;\n \/\/ Need 8 bit if we're viewing it\n if (m_showView) {\n graphData.m_NeedCV_8UC1 = true;\n }\n\n \/\/ get the Bright Dark images from file\n\n Mat img = imread(m_BrightFieldPath, CV_LOAD_IMAGE_ANYDEPTH | CV_LOAD_IMAGE_GRAYSCALE);\n if (!img.empty()) {\n m_imBrightFieldGpu16U.upload(img);\n }\n else {\n graphData.m_Logger->error (\"Unable to load BrightField: \" + m_BrightFieldPath);\n return false;\n }\n\n img = imread(m_DarkFieldPath, CV_LOAD_IMAGE_ANYDEPTH | CV_LOAD_IMAGE_GRAYSCALE);\n if (!img.empty()) {\n m_imDarkFieldGpu16U.upload(img);\n }\n else {\n graphData.m_Logger->error(\"Unable to load DarkField: \" + m_DarkFieldPath);\n return false;\n }\n\n \/\/ Bright - Dark as 32F\n cuda::subtract(m_imBrightFieldGpu16U, m_imDarkFieldGpu16U, m_imTemp16UGpu);\n m_imTemp16UGpu.convertTo(m_imBrightMinusDarkFieldGpu32F, CV_32F);\n\n if (m_showView) {\n \/\/ To write on the overlay, you must allocate it.\n \/\/ This indicates to the renderer the need to merge it with the final output image.\n \/\/ m_imViewTextOverlay = Mat(m_width, m_height, CV_8U);\n\n if (m_showSlider) {\n createTrackbar(\"BrightDarkFieldCorrection\", m_CombinedName, &m_FieldToView, 4, SliderCallback, this);\n }\n }\n\n return true;\n }\n\n ProcessResult BrightDarkFieldCorrection::process(GraphData& graphData) override\n {\n if (graphData.m_UseCuda) {\n \/\/ sub darkfield\n cuda::subtract(graphData.m_imCapGpu16UC1, m_imDarkFieldGpu16U, m_imTemp16UGpu);\n \/\/ make 32F\n m_imTemp16UGpu.convertTo(m_imTemp32FGpu, CV_32F);\n \/\/ image - dark \/ bright - dark\n cuda::divide(m_imTemp32FGpu, m_imBrightMinusDarkFieldGpu32F, m_imTemp16UGpu);\n\n m_imTemp16UGpu.convertTo(graphData.m_imOutGpu16UC1, CV_16U, 65536);\n\n if (graphData.m_NeedCV_8UC1) {\n graphData.m_imOutGpu16UC1.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n }\n }\n else {\n \/\/todo\n assert(false);\n\n }\n\n return ProcessResult::OK; \/\/ if you return false, the graph stops\n }\n\n void BrightDarkFieldCorrection::processView(GraphData & graphData) override\n {\n if (m_showView) {\n switch (m_FieldToView) {\n case 0:\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 1:\n graphData.m_imCapGpu16UC1.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 2:\n m_imBrightFieldGpu16U.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n case 3:\n m_imDarkFieldGpu16U.convertTo(graphData.m_imOutGpu8UC1, CV_8U, 1.0 \/ 256);\n graphData.m_imOutGpu8UC1.download(m_imView);\n break;\n\n }\n Filter::processView(graphData);\n }\n }\n\n void BrightDarkFieldCorrection::FieldToView(int n) {\n m_FieldToView = n;\n }\n\n void BrightDarkFieldCorrection::saveConfig(FileStorage& fs, GraphData& data)\n {\n Filter::saveConfig(fs, data);\n fs <<\"bright_field_path\" << m_BrightFieldPath.c_str();\n fs <<\"dark_field_path\" << m_DarkFieldPath.c_str();\n fs << \"show_slider\" << m_showSlider;\n }\n\n void BrightDarkFieldCorrection::loadConfig(FileNode& fs, GraphData& data)\n {\n Filter::loadConfig(fs, data);\n fs[\"bright_field_path\"] >> m_BrightFieldPath;\n fs[\"dark_field_path\"] >> m_DarkFieldPath;\n fs[\"show_slider\"] >> m_showSlider;\n }\n\n private:\n cv::cuda::GpuMat m_imTemp16UGpu; \/\/ 32F\n cv::cuda::GpuMat m_imTemp32FGpu; \/\/ 32F\n cv::cuda::GpuMat m_imBrightFieldGpu16U; \/\/ 16U\n cv::cuda::GpuMat m_imDarkFieldGpu16U; \/\/ 16U\n cv::cuda::GpuMat m_imBrightMinusDarkFieldGpu32F; \/\/ 32F\n\n std::string m_BrightFieldPath = \"config\/BrightField.tif\";\n std::string m_DarkFieldPath = \"config\/DarkField.tif\";\n\n int m_FieldToView = 0; \/\/ 0 is processed, 1 is unprocessed, 2 is darkfield, 3 is brightfield\n bool m_showSlider = true;\n\n };\n}\n#endif<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/basictypes.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/extensions\/extension_uninstall_dialog.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/window.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"grit\/generated_resources.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/gfx\/compositor\/compositor.h\"\n#include \"ui\/gfx\/compositor\/layer.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/layout\/layout_constants.h\"\n#include \"views\/view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/dialog_delegate.h\"\n\nnamespace {\n\nconst int kRightColumnWidth = 210;\nconst int kIconSize = 69;\n\nclass ExtensionUninstallDialogDelegateView;\n\n\/\/ Views implementation of the uninstall dialog.\nclass ExtensionUninstallDialogViews : public ExtensionUninstallDialog {\n public:\n ExtensionUninstallDialogViews(Profile* profile,\n ExtensionUninstallDialog::Delegate* delegate);\n virtual ~ExtensionUninstallDialogViews();\n\n \/\/ Forwards the accept and cancels to the delegate.\n void ExtensionUninstallAccepted();\n void ExtensionUninstallCanceled();\n\n ExtensionUninstallDialogDelegateView* view() { return view_; }\n\n private:\n void Show() OVERRIDE;\n\n ExtensionUninstallDialogDelegateView* view_;\n\n DISALLOW_COPY_AND_ASSIGN(ExtensionUninstallDialogViews);\n};\n\n\/\/ The dialog's view, owned by the views framework.\nclass ExtensionUninstallDialogDelegateView : public views::DialogDelegateView {\n public:\n ExtensionUninstallDialogDelegateView(\n ExtensionUninstallDialogViews* dialog_view,\n const Extension* extension,\n SkBitmap* icon);\n virtual ~ExtensionUninstallDialogDelegateView();\n\n \/\/ Called when the ExtensionUninstallDialog has been destroyed to make sure\n \/\/ we invalidate pointers.\n void DialogDestroyed() { dialog_ = NULL; }\n\n private:\n \/\/ views::DialogDelegate:\n virtual std::wstring GetDialogButtonLabel(\n MessageBoxFlags::DialogButton button) const OVERRIDE;\n\n virtual int GetDefaultDialogButton() const OVERRIDE {\n return MessageBoxFlags::DIALOGBUTTON_CANCEL;\n }\n\n virtual bool Accept() OVERRIDE;\n virtual bool Cancel() OVERRIDE;\n\n \/\/ views::WidgetDelegate:\n virtual bool IsModal() const OVERRIDE { return true; }\n virtual views::View* GetContentsView() OVERRIDE { return this; }\n virtual std::wstring GetWindowTitle() const OVERRIDE;\n\n \/\/ views::View:\n virtual gfx::Size GetPreferredSize() OVERRIDE;\n\n virtual void Layout() OVERRIDE;\n\n ExtensionUninstallDialogViews* dialog_;\n\n views::ImageView* icon_;\n views::Label* heading_;\n\n DISALLOW_COPY_AND_ASSIGN(ExtensionUninstallDialogDelegateView);\n};\n\nExtensionUninstallDialogViews::ExtensionUninstallDialogViews(\n Profile* profile, ExtensionUninstallDialog::Delegate* delegate)\n : ExtensionUninstallDialog(profile, delegate) {}\n\nExtensionUninstallDialogViews::~ExtensionUninstallDialogViews() {\n \/\/ Close the widget (the views framework will delete view_).\n if (view_) {\n view_->DialogDestroyed();\n view_->GetWidget()->CloseNow();\n }\n}\n\nvoid ExtensionUninstallDialogViews::Show() {\n Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n if (!browser) {\n delegate_->ExtensionUninstallCanceled();\n return;\n }\n\n BrowserWindow* window = browser->window();\n if (!window) {\n delegate_->ExtensionUninstallCanceled();\n return;\n }\n\n view_ = new ExtensionUninstallDialogDelegateView(this, extension_, &icon_);\n browser::CreateViewsWindow(window->GetNativeHandle(), view_)->Show();\n}\n\nvoid ExtensionUninstallDialogViews::ExtensionUninstallAccepted() {\n \/\/ The widget gets destroyed when the dialog is accepted.\n view_ = NULL;\n delegate_->ExtensionUninstallAccepted();\n}\n\nvoid ExtensionUninstallDialogViews::ExtensionUninstallCanceled() {\n \/\/ The widget gets destroyed when the dialog is canceled.\n view_ = NULL;\n delegate_->ExtensionUninstallCanceled();\n}\n\nExtensionUninstallDialogDelegateView::ExtensionUninstallDialogDelegateView(\n ExtensionUninstallDialogViews* dialog_view,\n const Extension* extension,\n SkBitmap* icon)\n : dialog_(dialog_view) {\n \/\/ Scale down to icon size, but allow smaller icons (don't scale up).\n gfx::Size size(icon->width(), icon->height());\n if (size.width() > kIconSize || size.height() > kIconSize)\n size = gfx::Size(kIconSize, kIconSize);\n icon_ = new views::ImageView();\n icon_->SetImageSize(size);\n icon_->SetImage(*icon);\n AddChildView(icon_);\n\n heading_ = new views::Label(UTF16ToWide(\n l10n_util::GetStringFUTF16(IDS_EXTENSION_UNINSTALL_PROMPT_HEADING,\n UTF8ToUTF16(extension->name()))));\n heading_->SetMultiLine(true);\n AddChildView(heading_);\n}\n\nExtensionUninstallDialogDelegateView::~ExtensionUninstallDialogDelegateView() {\n}\n\nstd::wstring ExtensionUninstallDialogDelegateView::GetDialogButtonLabel(\n MessageBoxFlags::DialogButton button) const {\n switch (button) {\n case MessageBoxFlags::DIALOGBUTTON_OK:\n return UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_EXTENSION_PROMPT_UNINSTALL_BUTTON));\n case MessageBoxFlags::DIALOGBUTTON_CANCEL:\n return UTF16ToWide(l10n_util::GetStringUTF16(IDS_CANCEL));\n default:\n NOTREACHED();\n return L\"\";\n }\n}\n\nbool ExtensionUninstallDialogDelegateView::Accept() {\n if (dialog_)\n dialog_->ExtensionUninstallAccepted();\n return true;\n}\n\nbool ExtensionUninstallDialogDelegateView::Cancel() {\n if (dialog_)\n dialog_->ExtensionUninstallCanceled();\n return true;\n}\n\nstd::wstring ExtensionUninstallDialogDelegateView::GetWindowTitle() const {\n return UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_EXTENSION_UNINSTALL_PROMPT_TITLE));\n}\n\n\ngfx::Size ExtensionUninstallDialogDelegateView::GetPreferredSize() {\n int width = kRightColumnWidth;\n width += kIconSize;\n width += views::kPanelHorizMargin * 3;\n\n int height = views::kPanelVertMargin * 2;\n height += heading_->GetHeightForWidth(kRightColumnWidth);\n\n return gfx::Size(width,\n std::max(height, kIconSize + views::kPanelVertMargin * 2));\n}\n\nvoid ExtensionUninstallDialogDelegateView::Layout() {\n int x = views::kPanelHorizMargin;\n int y = views::kPanelVertMargin;\n\n heading_->SizeToFit(kRightColumnWidth);\n\n if (heading_->height() <= kIconSize) {\n icon_->SetBounds(x, y, kIconSize, kIconSize);\n x += kIconSize;\n x += views::kPanelHorizMargin;\n\n heading_->SetX(x);\n heading_->SetY(y + (kIconSize - heading_->height()) \/ 2);\n } else {\n icon_->SetBounds(x,\n y + (heading_->height() - kIconSize) \/ 2,\n kIconSize,\n kIconSize);\n x += kIconSize;\n x += views::kPanelHorizMargin;\n\n heading_->SetX(x);\n heading_->SetY(y);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nExtensionUninstallDialog* ExtensionUninstallDialog::Create(\n Profile* profile, Delegate* delegate) {\n return new ExtensionUninstallDialogViews(profile, delegate);\n}\n<commit_msg>Remove executable permission from extension_uninstall_dialog_view.cc<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/basictypes.h\"\n#include \"base\/compiler_specific.h\"\n#include \"base\/string_util.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"chrome\/browser\/extensions\/extension_uninstall_dialog.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/window.h\"\n#include \"chrome\/common\/extensions\/extension.h\"\n#include \"grit\/generated_resources.h\"\n#include \"ui\/base\/l10n\/l10n_util.h\"\n#include \"ui\/gfx\/compositor\/compositor.h\"\n#include \"ui\/gfx\/compositor\/layer.h\"\n#include \"views\/controls\/image_view.h\"\n#include \"views\/controls\/label.h\"\n#include \"views\/layout\/layout_constants.h\"\n#include \"views\/view.h\"\n#include \"views\/widget\/widget.h\"\n#include \"views\/window\/dialog_delegate.h\"\n\nnamespace {\n\nconst int kRightColumnWidth = 210;\nconst int kIconSize = 69;\n\nclass ExtensionUninstallDialogDelegateView;\n\n\/\/ Views implementation of the uninstall dialog.\nclass ExtensionUninstallDialogViews : public ExtensionUninstallDialog {\n public:\n ExtensionUninstallDialogViews(Profile* profile,\n ExtensionUninstallDialog::Delegate* delegate);\n virtual ~ExtensionUninstallDialogViews();\n\n \/\/ Forwards the accept and cancels to the delegate.\n void ExtensionUninstallAccepted();\n void ExtensionUninstallCanceled();\n\n ExtensionUninstallDialogDelegateView* view() { return view_; }\n\n private:\n void Show() OVERRIDE;\n\n ExtensionUninstallDialogDelegateView* view_;\n\n DISALLOW_COPY_AND_ASSIGN(ExtensionUninstallDialogViews);\n};\n\n\/\/ The dialog's view, owned by the views framework.\nclass ExtensionUninstallDialogDelegateView : public views::DialogDelegateView {\n public:\n ExtensionUninstallDialogDelegateView(\n ExtensionUninstallDialogViews* dialog_view,\n const Extension* extension,\n SkBitmap* icon);\n virtual ~ExtensionUninstallDialogDelegateView();\n\n \/\/ Called when the ExtensionUninstallDialog has been destroyed to make sure\n \/\/ we invalidate pointers.\n void DialogDestroyed() { dialog_ = NULL; }\n\n private:\n \/\/ views::DialogDelegate:\n virtual std::wstring GetDialogButtonLabel(\n MessageBoxFlags::DialogButton button) const OVERRIDE;\n\n virtual int GetDefaultDialogButton() const OVERRIDE {\n return MessageBoxFlags::DIALOGBUTTON_CANCEL;\n }\n\n virtual bool Accept() OVERRIDE;\n virtual bool Cancel() OVERRIDE;\n\n \/\/ views::WidgetDelegate:\n virtual bool IsModal() const OVERRIDE { return true; }\n virtual views::View* GetContentsView() OVERRIDE { return this; }\n virtual std::wstring GetWindowTitle() const OVERRIDE;\n\n \/\/ views::View:\n virtual gfx::Size GetPreferredSize() OVERRIDE;\n\n virtual void Layout() OVERRIDE;\n\n ExtensionUninstallDialogViews* dialog_;\n\n views::ImageView* icon_;\n views::Label* heading_;\n\n DISALLOW_COPY_AND_ASSIGN(ExtensionUninstallDialogDelegateView);\n};\n\nExtensionUninstallDialogViews::ExtensionUninstallDialogViews(\n Profile* profile, ExtensionUninstallDialog::Delegate* delegate)\n : ExtensionUninstallDialog(profile, delegate) {}\n\nExtensionUninstallDialogViews::~ExtensionUninstallDialogViews() {\n \/\/ Close the widget (the views framework will delete view_).\n if (view_) {\n view_->DialogDestroyed();\n view_->GetWidget()->CloseNow();\n }\n}\n\nvoid ExtensionUninstallDialogViews::Show() {\n Browser* browser = BrowserList::GetLastActiveWithProfile(profile_);\n if (!browser) {\n delegate_->ExtensionUninstallCanceled();\n return;\n }\n\n BrowserWindow* window = browser->window();\n if (!window) {\n delegate_->ExtensionUninstallCanceled();\n return;\n }\n\n view_ = new ExtensionUninstallDialogDelegateView(this, extension_, &icon_);\n browser::CreateViewsWindow(window->GetNativeHandle(), view_)->Show();\n}\n\nvoid ExtensionUninstallDialogViews::ExtensionUninstallAccepted() {\n \/\/ The widget gets destroyed when the dialog is accepted.\n view_ = NULL;\n delegate_->ExtensionUninstallAccepted();\n}\n\nvoid ExtensionUninstallDialogViews::ExtensionUninstallCanceled() {\n \/\/ The widget gets destroyed when the dialog is canceled.\n view_ = NULL;\n delegate_->ExtensionUninstallCanceled();\n}\n\nExtensionUninstallDialogDelegateView::ExtensionUninstallDialogDelegateView(\n ExtensionUninstallDialogViews* dialog_view,\n const Extension* extension,\n SkBitmap* icon)\n : dialog_(dialog_view) {\n \/\/ Scale down to icon size, but allow smaller icons (don't scale up).\n gfx::Size size(icon->width(), icon->height());\n if (size.width() > kIconSize || size.height() > kIconSize)\n size = gfx::Size(kIconSize, kIconSize);\n icon_ = new views::ImageView();\n icon_->SetImageSize(size);\n icon_->SetImage(*icon);\n AddChildView(icon_);\n\n heading_ = new views::Label(UTF16ToWide(\n l10n_util::GetStringFUTF16(IDS_EXTENSION_UNINSTALL_PROMPT_HEADING,\n UTF8ToUTF16(extension->name()))));\n heading_->SetMultiLine(true);\n AddChildView(heading_);\n}\n\nExtensionUninstallDialogDelegateView::~ExtensionUninstallDialogDelegateView() {\n}\n\nstd::wstring ExtensionUninstallDialogDelegateView::GetDialogButtonLabel(\n MessageBoxFlags::DialogButton button) const {\n switch (button) {\n case MessageBoxFlags::DIALOGBUTTON_OK:\n return UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_EXTENSION_PROMPT_UNINSTALL_BUTTON));\n case MessageBoxFlags::DIALOGBUTTON_CANCEL:\n return UTF16ToWide(l10n_util::GetStringUTF16(IDS_CANCEL));\n default:\n NOTREACHED();\n return L\"\";\n }\n}\n\nbool ExtensionUninstallDialogDelegateView::Accept() {\n if (dialog_)\n dialog_->ExtensionUninstallAccepted();\n return true;\n}\n\nbool ExtensionUninstallDialogDelegateView::Cancel() {\n if (dialog_)\n dialog_->ExtensionUninstallCanceled();\n return true;\n}\n\nstd::wstring ExtensionUninstallDialogDelegateView::GetWindowTitle() const {\n return UTF16ToWide(\n l10n_util::GetStringUTF16(IDS_EXTENSION_UNINSTALL_PROMPT_TITLE));\n}\n\n\ngfx::Size ExtensionUninstallDialogDelegateView::GetPreferredSize() {\n int width = kRightColumnWidth;\n width += kIconSize;\n width += views::kPanelHorizMargin * 3;\n\n int height = views::kPanelVertMargin * 2;\n height += heading_->GetHeightForWidth(kRightColumnWidth);\n\n return gfx::Size(width,\n std::max(height, kIconSize + views::kPanelVertMargin * 2));\n}\n\nvoid ExtensionUninstallDialogDelegateView::Layout() {\n int x = views::kPanelHorizMargin;\n int y = views::kPanelVertMargin;\n\n heading_->SizeToFit(kRightColumnWidth);\n\n if (heading_->height() <= kIconSize) {\n icon_->SetBounds(x, y, kIconSize, kIconSize);\n x += kIconSize;\n x += views::kPanelHorizMargin;\n\n heading_->SetX(x);\n heading_->SetY(y + (kIconSize - heading_->height()) \/ 2);\n } else {\n icon_->SetBounds(x,\n y + (heading_->height() - kIconSize) \/ 2,\n kIconSize,\n kIconSize);\n x += kIconSize;\n x += views::kPanelHorizMargin;\n\n heading_->SetX(x);\n heading_->SetY(y);\n }\n}\n\n} \/\/ namespace\n\n\/\/ static\nExtensionUninstallDialog* ExtensionUninstallDialog::Create(\n Profile* profile, Delegate* delegate) {\n return new ExtensionUninstallDialogViews(profile, delegate);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <chrono>\n#include <memory>\n#include <sstream>\n\n#include \"rclcpp\/rclcpp.hpp\"\n\nusing namespace std::chrono_literals;\n\nvoid on_parameter_event(\n const rcl_interfaces::msg::ParameterEvent::SharedPtr event, rclcpp::Logger logger)\n{\n \/\/ TODO(wjwwood): The message should have an operator<<, which would replace all of this.\n std::stringstream ss;\n ss << \"\\nParameter event:\\n new parameters:\";\n for (auto & new_parameter : event->new_parameters) {\n ss << \"\\n \" << new_parameter.name;\n }\n ss << \"\\n changed parameters:\";\n for (auto & changed_parameter : event->changed_parameters) {\n ss << \"\\n \" << changed_parameter.name;\n }\n ss << \"\\n deleted parameters:\";\n for (auto & deleted_parameter : event->deleted_parameters) {\n ss << \"\\n \" << deleted_parameter.name;\n }\n ss << \"\\n\";\n RCLCPP_INFO(logger, ss.str().c_str());\n}\n\nint main(int argc, char ** argv)\n{\n \/\/ Force flush of the stdout buffer.\n setvbuf(stdout, NULL, _IONBF, BUFSIZ);\n\n rclcpp::init(argc, argv);\n\n auto node = rclcpp::Node::make_shared(\"parameter_events\");\n\n auto parameters_client = std::make_shared<rclcpp::SyncParametersClient>(node);\n while (!parameters_client->wait_for_service(1s)) {\n if (!rclcpp::ok()) {\n RCLCPP_ERROR(node->get_logger(), \"Interrupted while waiting for the service. Exiting.\");\n return 0;\n }\n RCLCPP_INFO(node->get_logger(), \"service not available, waiting again...\");\n }\n\n \/\/ Setup callback for changes to parameters.\n auto sub = parameters_client->on_parameter_event(\n [node](const rcl_interfaces::msg::ParameterEvent::SharedPtr event) -> void\n {\n on_parameter_event(event, node->get_logger());\n });\n\n \/\/ Declare parameters that may be set on this node\n node->declare_parameter(\"foo\");\n node->declare_parameter(\"bar\");\n node->declare_parameter(\"baz\");\n node->declare_parameter(\"foobar\");\n\n \/\/ Set several different types of parameters.\n auto set_parameters_results = parameters_client->set_parameters({\n rclcpp::Parameter(\"foo\", 2),\n rclcpp::Parameter(\"bar\", \"hello\"),\n rclcpp::Parameter(\"baz\", 1.45),\n rclcpp::Parameter(\"foobar\", true),\n });\n\n \/\/ Change the value of some of them.\n set_parameters_results = parameters_client->set_parameters({\n rclcpp::Parameter(\"foo\", 3),\n rclcpp::Parameter(\"bar\", \"world\"),\n });\n\n \/\/ TODO(wjwwood): Create and use delete_parameter\n\n \/\/ TODO(hidmic): Fast-RTPS takes a significant amount of time to deliver\n \/\/ requests and response, thus the rather long sleep. Reduce\n \/\/ once that's resolved.\n rclcpp::sleep_for(3s);\n\n rclcpp::spin_some(node);\n\n rclcpp::shutdown();\n\n return 0;\n}\n<commit_msg>Use `spin_until_future_complete` instead of `spin_some` in parameters_event demo (#427)<commit_after>\/\/ Copyright 2015 Open Source Robotics Foundation, Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <chrono>\n#include <future>\n#include <memory>\n#include <sstream>\n#include <utility>\n\n#include \"rclcpp\/rclcpp.hpp\"\n\nusing namespace std::chrono_literals;\n\nvoid on_parameter_event(\n const rcl_interfaces::msg::ParameterEvent::SharedPtr event, rclcpp::Logger logger)\n{\n \/\/ TODO(wjwwood): The message should have an operator<<, which would replace all of this.\n std::stringstream ss;\n ss << \"\\nParameter event:\\n new parameters:\";\n for (auto & new_parameter : event->new_parameters) {\n ss << \"\\n \" << new_parameter.name;\n }\n ss << \"\\n changed parameters:\";\n for (auto & changed_parameter : event->changed_parameters) {\n ss << \"\\n \" << changed_parameter.name;\n }\n ss << \"\\n deleted parameters:\";\n for (auto & deleted_parameter : event->deleted_parameters) {\n ss << \"\\n \" << deleted_parameter.name;\n }\n ss << \"\\n\";\n RCLCPP_INFO(logger, ss.str().c_str());\n}\n\nint main(int argc, char ** argv)\n{\n \/\/ Force flush of the stdout buffer.\n setvbuf(stdout, NULL, _IONBF, BUFSIZ);\n\n rclcpp::init(argc, argv);\n\n auto node = rclcpp::Node::make_shared(\"parameter_events\");\n\n auto parameters_client = std::make_shared<rclcpp::SyncParametersClient>(node);\n while (!parameters_client->wait_for_service(1s)) {\n if (!rclcpp::ok()) {\n RCLCPP_ERROR(node->get_logger(), \"Interrupted while waiting for the service. Exiting.\");\n return 0;\n }\n RCLCPP_INFO(node->get_logger(), \"service not available, waiting again...\");\n }\n\n auto events_received_promise = std::make_shared<std::promise<void>>();\n auto events_received_future = events_received_promise->get_future();\n\n \/\/ Setup callback for changes to parameters.\n auto sub = parameters_client->on_parameter_event(\n [node, promise = std::move(events_received_promise)](\n const rcl_interfaces::msg::ParameterEvent::SharedPtr event) -> void\n {\n static size_t n_times_called = 0u;\n on_parameter_event(event, node->get_logger());\n if (10u == ++n_times_called) {\n \/\/ This callback will be called 10 times, set the promise when that happens.\n promise->set_value();\n }\n });\n\n \/\/ Declare parameters that may be set on this node\n node->declare_parameter(\"foo\");\n node->declare_parameter(\"bar\");\n node->declare_parameter(\"baz\");\n node->declare_parameter(\"foobar\");\n\n \/\/ Set several different types of parameters.\n auto set_parameters_results = parameters_client->set_parameters({\n rclcpp::Parameter(\"foo\", 2),\n rclcpp::Parameter(\"bar\", \"hello\"),\n rclcpp::Parameter(\"baz\", 1.45),\n rclcpp::Parameter(\"foobar\", true),\n });\n\n \/\/ Change the value of some of them.\n set_parameters_results = parameters_client->set_parameters({\n rclcpp::Parameter(\"foo\", 3),\n rclcpp::Parameter(\"bar\", \"world\"),\n });\n\n \/\/ TODO(wjwwood): Create and use delete_parameter\n\n rclcpp::spin_until_future_complete(node, events_received_future.share());\n rclcpp::shutdown();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"LogobotText.h\"\n\nnamespace LogobotText\n{\n\t\/\/ Namespace containing private functions\n\tnamespace\n\t{\n\t\tfloat fontSize; \/\/ =em, equal to line spacing (between baselines), text sizes derived from this\n\t\tfloat capHeight;\n\t\tfloat letterSpacing;\n\t\tfloat w;\n\n\t\tCommandQueue * _cmdQ;\n\n\t\tvoid pushCmd(String cmd)\n\t\t{\n\t\t\t_cmdQ->enqueue(cmd, 0xff);\n\t\t}\n\n\t\tvoid pushTo(float x, float y)\n\t\t{\n\t\t\tString s = \"TO \";\n\t\t\ts += x;\n\t\t\ts += \" \";\n\t\t\ts += y;\n\t\t\tpushCmd(s);\n\t\t}\n\n\t\t\/\/ Alphabet\n\t\tvoid writeA(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w\/2, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + w \/ 4, y + capHeight \/ 2);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 3 * w \/ 4, y + capHeight \/ 2 );\n\t\t}\n\n\t\tvoid writeB(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 2 * w \/ 3, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 4);\n\t\t\tpushTo(x + 2 * w \/ 3, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + 3 * capHeight \/ 4);\n\t\t\tpushTo(x + 2 * w \/ 3, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeC(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeD(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 3 * w \/ 4, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 4);\n\t\t\tpushTo(x + w, y + 3 * capHeight \/ 4);\n\t\t\tpushTo(x + 3 * w \/ 4, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeE(float x, float y)\n\t\t{\n\t\t\twriteC(x, y);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y + capHeight \/2);\n\t\t}\n\n\t\tvoid writeF(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeG(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight\/3);\n\t\t\tpushTo(x + w\/3, y + capHeight\/3);\n\t\t}\n\n\t\tvoid writeH(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeI(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w \/ 2, y + capHeight);\n\t\t}\n\n\t\tvoid writeJ(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight \/ 4);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeK(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeL(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x,y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeM(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeN(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\n\t\t}\n\n\t\tvoid writeO(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeP(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeQ(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeR(float x, float y)\n\t\t{\n\t\t\twriteP(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeS(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeT(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/2, y);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w\/2, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeU(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeV(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeW(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w \/ 4, y);\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushTo(x + 3 * w \/ 4, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeX(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeY(float x, float y)\n\t\t{\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeZ(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeColon(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/3, y + capHeight\/3);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 2*w\/3, y + capHeight\/3);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + 2*w\/3, y + 2*capHeight\/3);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w\/3, y + 2*capHeight\/3);\n\t\t}\n\n\t\tvoid writeCloseBracket(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/3, y);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 2*w\/3, y + capHeight\/4);\n\t\t\tpushTo(x + w, y + capHeight\/2);\n\t\t\tpushTo(x + 2*w\/3, y + 3*capHeight\/4);\n\t\t\tpushTo(x + w\/3, y + capHeight);\n\t\t}\n\n\t\tvoid writeHash(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight\/3);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w, y + capHeight\/3);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + w, y + 2*capHeight\/3);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x, y + 2*capHeight\/3);\n\t\t\tpushCmd(\"PU\");\n\n\t\t\tpushTo(x + w\/3, y + capHeight);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + w\/3, y);\n\t\t\tpushCmd(\"PU\");\n\t\t\tpushTo(x + 2*w\/3, y);\n\t\t\tpushCmd(\"PD\");\n\t\t\tpushTo(x + 2*w\/3, y + capHeight);\n\t\t}\n\t}\n\t\/\/ End private namespace functions\n\n\t\/\/ Logobot text public functions\n\tvoid begin(CommandQueue& cmdQ)\n\t{\n\t\t_cmdQ = &cmdQ;\n\t\tsetFontSize(20);\n\t}\n\n\tvoid setFontSize(float size)\n\t{\n\t\tfontSize = size;\n\t\tcapHeight = fontSize * 0.7;\n\t\tletterSpacing = fontSize * 0.1;\n\t\tw = fontSize * 0.5;\n\t}\n\n\tvoid writeChar(char c, float x, float y)\n\t{\n\t\tswitch (c) {\n\t\t\tcase 'A':\n\t\t\t\twriteA(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'B':\n\t\t\t\twriteB(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\twriteC(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'D':\n\t\t\t\twriteD(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'E':\n\t\t\t\twriteE(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'F':\n\t\t\t\twriteF(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'G':\n\t\t\t\twriteG(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\twriteH(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'I':\n\t\t\t\twriteI(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'J':\n\t\t\t\twriteJ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'K':\n\t\t\t\twriteK(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'L':\n\t\t\t\twriteL(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'M':\n\t\t\t\twriteM(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'N':\n\t\t\t\twriteN(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'O':\n\t\t\t\twriteO(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'P':\n\t\t\t\twriteP(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Q':\n\t\t\t\twriteQ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\twriteR(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'S':\n\t\t\t\twriteS(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'T':\n\t\t\t\twriteT(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'U':\n\t\t\t\twriteU(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'V':\n\t\t\t\twriteV(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'W':\n\t\t\t\twriteW(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'X':\n\t\t\t\twriteX(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Y':\n\t\t\t\twriteY(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Z':\n\t\t\t\twriteZ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase ' ':\n\t\t\t\t\/\/ nothing to do, just move to next letter\n\t\t\t\tbreak;\n\t\t\tcase ':':\n\t\t\t\twriteColon(x,y);\n\t\t\t\tbreak;\n\t\t\tcase ')':\n\t\t\t\twriteCloseBracket(x,y);\n\t\t\t\tbreak;\n\t\t\tcase '#':\n\t\t\t\twriteHash(x,y);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tpushCmd(\"BZ 500\");\n\t\t\t\treturn;\n\t\t}\n\n\t\tpushCmd(\"PU\");\n\t\tpushTo(x + w + letterSpacing, y);\n\t}\n}\n<commit_msg>Space optimisation<commit_after>#include \"LogobotText.h\"\n\n\/\/ local copy of critical command defines - for space optimisation\n#define LOGO_CMD_BZ\t\t\t8\n#define LOGO_CMD_PU\t\t\t9\n#define LOGO_CMD_PD\t\t\t10\n\nnamespace LogobotText\n{\n\t\/\/ Namespace containing private functions\n\tnamespace\n\t{\n\t\tfloat fontSize; \/\/ =em, equal to line spacing (between baselines), text sizes derived from this\n\t\tfloat capHeight;\n\t\tfloat letterSpacing;\n\t\tfloat w;\n\n\t\tCommandQueue * _cmdQ;\n\n\t\tvoid pushCmd(String cmd)\n\t\t{\n\t\t\t_cmdQ->enqueue(cmd, 0xff);\n\t\t}\n\n\t\tvoid pushPU() {\n\t\t\t_cmdQ->enqueue(\"\", LOGO_CMD_PU);\n\t\t}\n\n\t\tvoid pushPD() {\n\t\t\t_cmdQ->enqueue(\"\", LOGO_CMD_PD);\n\t\t}\n\n\t\tvoid pushTo(float x, float y)\n\t\t{\n\t\t\tString s = \"TO \";\n\t\t\ts += x;\n\t\t\ts += \" \";\n\t\t\ts += y;\n\t\t\tpushCmd(s);\n\t\t}\n\n\t\t\/\/ Alphabet\n\t\tvoid writeA(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w\/2, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushPU();\n\t\t\tpushTo(x + w \/ 4, y + capHeight \/ 2);\n\t\t\tpushPD();\n\t\t\tpushTo(x + 3 * w \/ 4, y + capHeight \/ 2 );\n\t\t}\n\n\t\tvoid writeB(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + 2 * w \/ 3, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 4);\n\t\t\tpushTo(x + 2 * w \/ 3, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + 3 * capHeight \/ 4);\n\t\t\tpushTo(x + 2 * w \/ 3, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeC(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeD(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + 3 * w \/ 4, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 4);\n\t\t\tpushTo(x + w, y + 3 * capHeight \/ 4);\n\t\t\tpushTo(x + 3 * w \/ 4, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeE(float x, float y)\n\t\t{\n\t\t\twriteC(x, y);\n\t\t\tpushPU();\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y + capHeight \/2);\n\t\t}\n\n\t\tvoid writeF(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPU();\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeG(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight\/3);\n\t\t\tpushTo(x + w\/3, y + capHeight\/3);\n\t\t}\n\n\t\tvoid writeH(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeI(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w \/ 2, y + capHeight);\n\t\t}\n\n\t\tvoid writeJ(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight \/ 4);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeK(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPU();\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeL(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x,y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeM(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeN(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\n\t\t}\n\n\t\tvoid writeO(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t}\n\n\t\tvoid writeP(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeQ(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushPU();\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeR(float x, float y)\n\t\t{\n\t\t\twriteP(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeS(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight \/ 2);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeT(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/2, y);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w\/2, y + capHeight);\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeU(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeV(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w \/ 2, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeW(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w \/ 4, y);\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t\tpushTo(x + 3 * w \/ 4, y);\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t}\n\n\t\tvoid writeX(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPU();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeY(float x, float y)\n\t\t{\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushPU();\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w \/ 2, y + capHeight \/ 2);\n\t\t}\n\n\t\tvoid writeZ(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y + capHeight);\n\t\t\tpushTo(x, y);\n\t\t\tpushTo(x + w, y);\n\t\t}\n\n\t\tvoid writeColon(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/3, y + capHeight\/3);\n\t\t\tpushPD();\n\t\t\tpushTo(x + 2*w\/3, y + capHeight\/3);\n\t\t\tpushPU();\n\t\t\tpushTo(x + 2*w\/3, y + 2*capHeight\/3);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w\/3, y + 2*capHeight\/3);\n\t\t}\n\n\t\tvoid writeCloseBracket(float x, float y)\n\t\t{\n\t\t\tpushTo(x + w\/3, y);\n\t\t\tpushPD();\n\t\t\tpushTo(x + 2*w\/3, y + capHeight\/4);\n\t\t\tpushTo(x + w, y + capHeight\/2);\n\t\t\tpushTo(x + 2*w\/3, y + 3*capHeight\/4);\n\t\t\tpushTo(x + w\/3, y + capHeight);\n\t\t}\n\n\t\tvoid writeHash(float x, float y)\n\t\t{\n\t\t\tpushTo(x, y + capHeight\/3);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w, y + capHeight\/3);\n\t\t\tpushPU();\n\t\t\tpushTo(x + w, y + 2*capHeight\/3);\n\t\t\tpushPD();\n\t\t\tpushTo(x, y + 2*capHeight\/3);\n\t\t\tpushPU();\n\n\t\t\tpushTo(x + w\/3, y + capHeight);\n\t\t\tpushPD();\n\t\t\tpushTo(x + w\/3, y);\n\t\t\tpushPU();\n\t\t\tpushTo(x + 2*w\/3, y);\n\t\t\tpushPD();\n\t\t\tpushTo(x + 2*w\/3, y + capHeight);\n\t\t}\n\t}\n\t\/\/ End private namespace functions\n\n\t\/\/ Logobot text public functions\n\tvoid begin(CommandQueue& cmdQ)\n\t{\n\t\t_cmdQ = &cmdQ;\n\t\tsetFontSize(20);\n\t}\n\n\tvoid setFontSize(float size)\n\t{\n\t\tfontSize = size;\n\t\tcapHeight = fontSize * 0.7;\n\t\tletterSpacing = fontSize * 0.1;\n\t\tw = fontSize * 0.5;\n\t}\n\n\tvoid writeChar(char c, float x, float y)\n\t{\n\t\tswitch (c) {\n\t\t\tcase 'A':\n\t\t\t\twriteA(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'B':\n\t\t\t\twriteB(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\twriteC(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'D':\n\t\t\t\twriteD(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'E':\n\t\t\t\twriteE(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'F':\n\t\t\t\twriteF(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'G':\n\t\t\t\twriteG(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'H':\n\t\t\t\twriteH(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'I':\n\t\t\t\twriteI(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'J':\n\t\t\t\twriteJ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'K':\n\t\t\t\twriteK(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'L':\n\t\t\t\twriteL(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'M':\n\t\t\t\twriteM(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'N':\n\t\t\t\twriteN(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'O':\n\t\t\t\twriteO(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'P':\n\t\t\t\twriteP(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Q':\n\t\t\t\twriteQ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\twriteR(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'S':\n\t\t\t\twriteS(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'T':\n\t\t\t\twriteT(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'U':\n\t\t\t\twriteU(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'V':\n\t\t\t\twriteV(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'W':\n\t\t\t\twriteW(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'X':\n\t\t\t\twriteX(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Y':\n\t\t\t\twriteY(x, y);\n\t\t\t\tbreak;\n\t\t\tcase 'Z':\n\t\t\t\twriteZ(x, y);\n\t\t\t\tbreak;\n\t\t\tcase ' ':\n\t\t\t\t\/\/ nothing to do, just move to next letter\n\t\t\t\tbreak;\n\t\t\tcase ':':\n\t\t\t\twriteColon(x,y);\n\t\t\t\tbreak;\n\t\t\tcase ')':\n\t\t\t\twriteCloseBracket(x,y);\n\t\t\t\tbreak;\n\t\t\tcase '#':\n\t\t\t\twriteHash(x,y);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\t_cmdQ->enqueue(\"500\",LOGO_CMD_BZ);\n\t\t\t\t\/\/pushCmd(\"BZ 500\");\n\t\t\t\treturn;\n\t\t}\n\n\t\tpushPU();\n\t\tpushTo(x + w + letterSpacing, y);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTaskCharmFraction* AddTaskCharmFraction(\n const char* fileout=\"d0D0.root\",\n\t Bool_t sideband=kFALSE,\n\t Bool_t setD0usecuts=kTRUE,\n\t Bool_t setcheckMC=kTRUE,\n\t Bool_t setcheckMC_prompt=kTRUE,\n\t Bool_t setcheckMC_fromB=kFALSE,\n\t Bool_t setcheckMC_D0=kTRUE,\n\t Bool_t setcheckMC_2prongs=kTRUE,\n\t Bool_t setSkipD0star=kTRUE,\n\t Bool_t setStudyPureBack=kFALSE)\n{ \n \/\/\n \/\/ Configuration macro for the task to analyze the fraction of prompt charm\n \/\/ using the D0 impact parameter\n \/\/ andrea.rossi@ts.infn.it\n \/\/\n \/\/==========================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskCharmFraction\", \"No analysis manager to connect to.\");\n return NULL;\n } \n\n TString str=fileout,containername;\n str.ReplaceAll(\".root\",\"\");\n str.Prepend(\"_\");\n\n AliAnalysisTaskCharmFraction *hfTask;\n if(!sideband) {\n hfTask = new AliAnalysisTaskCharmFraction(\"CharmFraction\",10);\n } else {\n hfTask= new AliAnalysisTaskCharmFraction(\"CharmFractionSideB\",10);\n hfTask->SetSideBands(-2.);\n }\n\n hfTask->SetUseCuts(setD0usecuts);\n hfTask->SetCheckMC(setcheckMC);\n hfTask->SetCheckMC_D0(setcheckMC_D0);\n hfTask->SetCheckMC_2prongs(setcheckMC_2prongs);\n hfTask->SetCheckMC_prompt(setcheckMC_prompt);\n hfTask->SetCheckMC_fromB(setcheckMC_fromB);\n hfTask->SetCheckMC_fromDstar(setSkipD0star);\n hfTask->SetStudyPureBackground(setStudyPureBack);\n \/\/ hfTask->SetSideBands(0);\n \/\/ hfTask->SetDebugLevel(2);\n mgr->AddTask(hfTask);\n \n \/\/Now the same for sidebands\n \/*AliAnalysisTaskCharmFraction *hfTaskSideB \n\n \n hfTaskSideB->SetUseCuts(fD0usecuts);\n hfTaskSideB->SetCheckMC(fcheckMC);\n hfTaskSideB->SetCheckMC_D0(fcheckMC_D0);\n hfTaskSideB->SetCheckMC_2prongs(fcheckMC_2prongs);\n hfTaskSideB->SetCheckMC_prompt(fcheckMC_prompt);\n hfTaskSideB->SetCheckMC_fromB(fcheckMC_fromB);\n hfTaskSideB->SetCheckMC_fromDstar(fSkipD0star);\n hfTaskSideB->SetStudyPureBackground(fStudyPureBack);\n\n \/\/ hfTaskSideB->SetDebugLevel(2);\n mgr->AddTask(hfTaskSideB);\n *\/\n \n\n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\/\/mgr->CreateContainer(\"cinput\",TChain::Class(),AliAnalysisManager::kInputContainer);\n mgr->ConnectInput(hfTask,0,cinput);\n \/\/ mgr->ConnectInput(hfTaskSideB,0,cinput);\n\n \/\/Now container for general properties histograms\n containername=\"coutputCptd0d0\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputCptd0d0 = mgr->CreateContainer(containername.Data(),TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,0,coutputCptd0d0);\n\n containername=\"coutputSecVtxXY\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxXY = mgr->CreateContainer(containername.Data(),TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,1,coutputSecVtxXY);\n\n\n containername=\"coutputd0d0\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputd0d0 = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,2,coutputd0d0);\n\n containername=\"coutputCpt\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputCpt = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,3,coutputCpt);\n\n containername=\"coutputSecVtxZ\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxZ = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,4,coutputSecVtxZ);\n\n containername=\"coutputSecVtxX\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxX = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,5,coutputSecVtxX);\n\n containername=\"coutputSecVtxY\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxY = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,6,coutputSecVtxY);\n\n containername=\"coutputSecVtxPhi\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxPhi = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,7,coutputSecVtxPhi);\n\n\n \/\/Now container for d0D0 \n AliAnalysisDataContainer **coutput=new AliAnalysisDataContainer*[10];\n containername=\"coutputAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n TString name=\"coutput\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutput[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+8,coutput[j]);\n }\n mgr->ConnectOutput(hfTask,18,coutputAll);\n \/\/Now container for MC d0D0 \n AliAnalysisDataContainer **coutputMC=new AliAnalysisDataContainer*[10];\n containername=\"coutputAllMC\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputAllMC = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n name=\"coutputMC\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutputMC[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+19,coutputMC[j]);\n }\n mgr->ConnectOutput(hfTask,29,coutputAllMC);\n\n \/\/Now container for histo with d0 with respect to True Vtx\n AliAnalysisDataContainer **coutputd0VtxTrue=new AliAnalysisDataContainer*[10];\n containername=\"coutputd0VtxTrueAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputd0VtxTrueAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n name=\"coutputd0VtxTrue\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutputd0VtxTrue[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+30,coutputd0VtxTrue[j]);\n }\n mgr->ConnectOutput(hfTask,40,coutputd0VtxTrueAll);\n \/\/INV MASS\n containername=\"coutputD0InvMassAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputD0InvMassAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,41,coutputD0InvMassAll);\n containername=\"coutputD0MCInvMassAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputD0MCInvMassAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,42,coutputD0MCInvMassAll);\n \n \/\/\/\/\/\/\/\/\n \/\/NOW THE SAME FOR SIDE BANDS\n \/*\n \/\/Now container for general properties histograms\n\n AliAnalysisDataContainer *coutputSBCptd0d0 = mgr->CreateContainer(\"coutputSBCptd0d0\",TH2::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,0,coutputSBCptd0d0);\n\n AliAnalysisDataContainer *coutputSBSecVtxXY = mgr->CreateContainer(\"coutputSBSecVtxXY\",TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,1,coutputSBSecVtxXY);\n\n\n AliAnalysisDataContainer *coutputSBd0d0 = mgr->CreateContainer(\"coutputSBd0d0\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,2,coutputSBd0d0);\n\n AliAnalysisDataContainer *coutputSBCpt = mgr->CreateContainer(\"coutputSBCpt\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,3,coutputSBCpt);\n\n AliAnalysisDataContainer *coutputSBSecVtxZ = mgr->CreateContainer(\"coutputSBSecVtxZ\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,4,coutputSBSecVtxZ);\n\n AliAnalysisDataContainer *coutputSBSecVtxX = mgr->CreateContainer(\"coutputSBSecVtxX\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,5,coutputSBSecVtxX);\n\n AliAnalysisDataContainer *coutputSBSecVtxY = mgr->CreateContainer(\"coutputSBSecVtxY\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,6,coutputSBSecVtxY);\n\n AliAnalysisDataContainer *coutputSBSecVtxPhi = mgr->CreateContainer(\"coutputSBSecVtxPhi\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,7,coutputSBSecVtxPhi);\n\n\n \/\/Now container for d0D0SideB \n AliAnalysisDataContainer **coutputSB=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBAll = mgr->CreateContainer(\"coutputSBAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n TString name=\"coutputSB\",strname;\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSB[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+8,coutputSB[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,18,coutputSBAll);\n \/\/Now container for MC d0D0SideB \n AliAnalysisDataContainer **coutputSBMC=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBAllMC = mgr->CreateContainer(\"coutputSBAllMC\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n name=\"coutputSBMC\";\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSBMC[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+19,coutputSBMC[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,29,coutputSBAllMC);\n\n \/\/Now container for histo with d0 with respect to True Vtx\n AliAnalysisDataContainer **coutputSBd0VtxTrue=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBd0VtxTrueAll = mgr->CreateContainer(\"coutputSBd0VtxTrueAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n name=\"coutputSBd0VtxTrue\";\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSBd0VtxTrue[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+30,coutputSBd0VtxTrue[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,40,coutputSBd0VtxTrueAll);\n\n\/\/INV MASS\n AliAnalysisDataContainer *coutputSBD0InvMassAll = mgr->CreateContainer(\"coutputSBD0InvMassAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,41,coutputSBD0InvMassAll);\n\n AliAnalysisDataContainer *coutputSBD0MCInvMassAll = mgr->CreateContainer(\"coutputSBD0MCInvMassAll\",TH1::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,42,coutputSBD0MCInvMassAll);\n\n *\/\n\n return hfTask;\n}\n<commit_msg>Changed default value (no D*+ rejection) Andrea R<commit_after>AliAnalysisTaskCharmFraction* AddTaskCharmFraction(\n const char* fileout=\"d0D0.root\",\n\t Bool_t sideband=kFALSE,\n\t Bool_t setD0usecuts=kTRUE,\n\t Bool_t setcheckMC=kTRUE,\n\t Bool_t setcheckMC_prompt=kTRUE,\n\t Bool_t setcheckMC_fromB=kFALSE,\n\t Bool_t setcheckMC_D0=kTRUE,\n\t Bool_t setcheckMC_2prongs=kTRUE,\n\t Bool_t setSkipD0star=kFALSE,\n\t Bool_t setStudyPureBack=kFALSE)\n{ \n \/\/\n \/\/ Configuration macro for the task to analyze the fraction of prompt charm\n \/\/ using the D0 impact parameter\n \/\/ andrea.rossi@ts.infn.it\n \/\/\n \/\/==========================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskCharmFraction\", \"No analysis manager to connect to.\");\n return NULL;\n } \n\n TString str=fileout,containername;\n str.ReplaceAll(\".root\",\"\");\n str.Prepend(\"_\");\n\n AliAnalysisTaskCharmFraction *hfTask;\n if(!sideband) {\n hfTask = new AliAnalysisTaskCharmFraction(\"CharmFraction\",10);\n } else {\n hfTask= new AliAnalysisTaskCharmFraction(\"CharmFractionSideB\",10);\n hfTask->SetSideBands(-2.);\n }\n\n hfTask->SetUseCuts(setD0usecuts);\n hfTask->SetCheckMC(setcheckMC);\n hfTask->SetCheckMC_D0(setcheckMC_D0);\n hfTask->SetCheckMC_2prongs(setcheckMC_2prongs);\n hfTask->SetCheckMC_prompt(setcheckMC_prompt);\n hfTask->SetCheckMC_fromB(setcheckMC_fromB);\n hfTask->SetCheckMC_fromDstar(setSkipD0star);\n hfTask->SetStudyPureBackground(setStudyPureBack);\n \/\/ hfTask->SetSideBands(0);\n \/\/ hfTask->SetDebugLevel(2);\n mgr->AddTask(hfTask);\n \n \/\/Now the same for sidebands\n \/*AliAnalysisTaskCharmFraction *hfTaskSideB \n\n \n hfTaskSideB->SetUseCuts(fD0usecuts);\n hfTaskSideB->SetCheckMC(fcheckMC);\n hfTaskSideB->SetCheckMC_D0(fcheckMC_D0);\n hfTaskSideB->SetCheckMC_2prongs(fcheckMC_2prongs);\n hfTaskSideB->SetCheckMC_prompt(fcheckMC_prompt);\n hfTaskSideB->SetCheckMC_fromB(fcheckMC_fromB);\n hfTaskSideB->SetCheckMC_fromDstar(fSkipD0star);\n hfTaskSideB->SetStudyPureBackground(fStudyPureBack);\n\n \/\/ hfTaskSideB->SetDebugLevel(2);\n mgr->AddTask(hfTaskSideB);\n *\/\n \n\n \/\/ Create containers for input\/output\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\/\/mgr->CreateContainer(\"cinput\",TChain::Class(),AliAnalysisManager::kInputContainer);\n mgr->ConnectInput(hfTask,0,cinput);\n \/\/ mgr->ConnectInput(hfTaskSideB,0,cinput);\n\n \/\/Now container for general properties histograms\n containername=\"coutputCptd0d0\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputCptd0d0 = mgr->CreateContainer(containername.Data(),TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,0,coutputCptd0d0);\n\n containername=\"coutputSecVtxXY\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxXY = mgr->CreateContainer(containername.Data(),TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,1,coutputSecVtxXY);\n\n\n containername=\"coutputd0d0\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputd0d0 = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,2,coutputd0d0);\n\n containername=\"coutputCpt\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputCpt = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,3,coutputCpt);\n\n containername=\"coutputSecVtxZ\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxZ = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,4,coutputSecVtxZ);\n\n containername=\"coutputSecVtxX\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxX = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,5,coutputSecVtxX);\n\n containername=\"coutputSecVtxY\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxY = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,6,coutputSecVtxY);\n\n containername=\"coutputSecVtxPhi\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputSecVtxPhi = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,7,coutputSecVtxPhi);\n\n\n \/\/Now container for d0D0 \n AliAnalysisDataContainer **coutput=new AliAnalysisDataContainer*[10];\n containername=\"coutputAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n TString name=\"coutput\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutput[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+8,coutput[j]);\n }\n mgr->ConnectOutput(hfTask,18,coutputAll);\n \/\/Now container for MC d0D0 \n AliAnalysisDataContainer **coutputMC=new AliAnalysisDataContainer*[10];\n containername=\"coutputAllMC\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputAllMC = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n name=\"coutputMC\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutputMC[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+19,coutputMC[j]);\n }\n mgr->ConnectOutput(hfTask,29,coutputAllMC);\n\n \/\/Now container for histo with d0 with respect to True Vtx\n AliAnalysisDataContainer **coutputd0VtxTrue=new AliAnalysisDataContainer*[10];\n containername=\"coutputd0VtxTrueAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputd0VtxTrueAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t fileout);\n\n\n name=\"coutputd0VtxTrue\";\n for(Int_t j=0;j<10;j++){\n containername=name;\n containername+=j;\n containername.Append(str.Data());\n coutputd0VtxTrue[j] = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t fileout);\n \n mgr->ConnectOutput(hfTask,j+30,coutputd0VtxTrue[j]);\n }\n mgr->ConnectOutput(hfTask,40,coutputd0VtxTrueAll);\n \/\/INV MASS\n containername=\"coutputD0InvMassAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputD0InvMassAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,41,coutputD0InvMassAll);\n containername=\"coutputD0MCInvMassAll\";\n containername.Append(str.Data());\n AliAnalysisDataContainer *coutputD0MCInvMassAll = mgr->CreateContainer(containername.Data(),TH1::Class(),\n\t\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t\t\t fileout);\n mgr->ConnectOutput(hfTask,42,coutputD0MCInvMassAll);\n \n \/\/\/\/\/\/\/\/\n \/\/NOW THE SAME FOR SIDE BANDS\n \/*\n \/\/Now container for general properties histograms\n\n AliAnalysisDataContainer *coutputSBCptd0d0 = mgr->CreateContainer(\"coutputSBCptd0d0\",TH2::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,0,coutputSBCptd0d0);\n\n AliAnalysisDataContainer *coutputSBSecVtxXY = mgr->CreateContainer(\"coutputSBSecVtxXY\",TH2::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,1,coutputSBSecVtxXY);\n\n\n AliAnalysisDataContainer *coutputSBd0d0 = mgr->CreateContainer(\"coutputSBd0d0\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,2,coutputSBd0d0);\n\n AliAnalysisDataContainer *coutputSBCpt = mgr->CreateContainer(\"coutputSBCpt\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,3,coutputSBCpt);\n\n AliAnalysisDataContainer *coutputSBSecVtxZ = mgr->CreateContainer(\"coutputSBSecVtxZ\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,4,coutputSBSecVtxZ);\n\n AliAnalysisDataContainer *coutputSBSecVtxX = mgr->CreateContainer(\"coutputSBSecVtxX\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,5,coutputSBSecVtxX);\n\n AliAnalysisDataContainer *coutputSBSecVtxY = mgr->CreateContainer(\"coutputSBSecVtxY\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,6,coutputSBSecVtxY);\n\n AliAnalysisDataContainer *coutputSBSecVtxPhi = mgr->CreateContainer(\"coutputSBSecVtxPhi\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,7,coutputSBSecVtxPhi);\n\n\n \/\/Now container for d0D0SideB \n AliAnalysisDataContainer **coutputSB=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBAll = mgr->CreateContainer(\"coutputSBAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n TString name=\"coutputSB\",strname;\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSB[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+8,coutputSB[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,18,coutputSBAll);\n \/\/Now container for MC d0D0SideB \n AliAnalysisDataContainer **coutputSBMC=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBAllMC = mgr->CreateContainer(\"coutputSBAllMC\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n name=\"coutputSBMC\";\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSBMC[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+19,coutputSBMC[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,29,coutputSBAllMC);\n\n \/\/Now container for histo with d0 with respect to True Vtx\n AliAnalysisDataContainer **coutputSBd0VtxTrue=new AliAnalysisDataContainer*[10];\n AliAnalysisDataContainer *coutputSBd0VtxTrueAll = mgr->CreateContainer(\"coutputSBd0VtxTrueAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n\n\n name=\"coutputSBd0VtxTrue\";\n for(Int_t j=0;j<10;j++){\n strname=name;\n strname+=j;\n coutputSBd0VtxTrue[j] = mgr->CreateContainer(strname.Data(),TH1::Class(),\n\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t \"d0D0SideB.root\");\n \n mgr->ConnectOutput(hfTaskSideB,j+30,coutputSBd0VtxTrue[j]);\n }\n mgr->ConnectOutput(hfTaskSideB,40,coutputSBd0VtxTrueAll);\n\n\/\/INV MASS\n AliAnalysisDataContainer *coutputSBD0InvMassAll = mgr->CreateContainer(\"coutputSBD0InvMassAll\",TH1::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,41,coutputSBD0InvMassAll);\n\n AliAnalysisDataContainer *coutputSBD0MCInvMassAll = mgr->CreateContainer(\"coutputSBD0MCInvMassAll\",TH1::Class(),\n\t\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer, \n\t\t\t\t\t\t\t \"d0D0SideB.root\");\n mgr->ConnectOutput(hfTaskSideB,42,coutputSBD0MCInvMassAll);\n\n *\/\n\n return hfTask;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <utility>\n#include <agency\/execution_categories.hpp>\n#include <agency\/executor_traits.hpp>\n#include <agency\/detail\/tuple.hpp>\n#include <agency\/functional.hpp>\n#include <agency\/detail\/index_tuple.hpp>\n#include <agency\/detail\/tuple_utility.hpp>\n#include <agency\/detail\/make_tuple_if_not_nested.hpp>\n#include <agency\/detail\/unwrap_tuple_if_not_nested.hpp>\n\nnamespace agency\n{\n\n\ntemplate<class Executor1, class Executor2>\nclass nested_executor\n{\n public:\n using outer_executor_type = Executor1;\n using inner_executor_type = Executor2;\n\n private:\n using outer_traits = executor_traits<outer_executor_type>;\n using inner_traits = executor_traits<inner_executor_type>;\n\n using outer_execution_category = typename outer_traits::execution_category;\n using inner_execution_category = typename inner_traits::execution_category;\n\n using outer_index_type = typename outer_traits::index_type;\n using inner_index_type = typename inner_traits::index_type;\n\n \/\/ XXX move this into index_tuple.hpp?\n static auto index_cat(const outer_index_type& outer_idx, const inner_index_type& inner_idx)\n -> decltype(\n __tu::tuple_cat_apply(\n detail::index_tuple_maker{},\n detail::make_tuple_if_not_nested<outer_execution_category>(outer_idx),\n detail::make_tuple_if_not_nested<inner_execution_category>(inner_idx)\n )\n )\n {\n return __tu::tuple_cat_apply(\n detail::index_tuple_maker{},\n detail::make_tuple_if_not_nested<outer_execution_category>(outer_idx),\n detail::make_tuple_if_not_nested<inner_execution_category>(inner_idx)\n );\n }\n\n using outer_shape_type = typename outer_traits::shape_type;\n using inner_shape_type = typename inner_traits::shape_type;\n\n public:\n using execution_category = \n nested_execution_tag<\n outer_execution_category,\n inner_execution_category\n >;\n\n \/\/ XXX consider adding a public static make_shape() function\n using shape_type = decltype(\n detail::tuple_cat(\n detail::make_tuple_if_not_nested<outer_execution_category>(std::declval<outer_shape_type>()),\n detail::make_tuple_if_not_nested<inner_execution_category>(std::declval<inner_shape_type>())\n )\n );\n\n using index_type = decltype(\n index_cat(\n std::declval<outer_index_type>(), \n std::declval<inner_shape_type>()\n )\n );\n\n template<class T>\n using future = typename outer_traits::template future<T>;\n\n nested_executor() = default;\n\n nested_executor(const outer_executor_type& outer_ex,\n const inner_executor_type& inner_ex)\n : outer_ex_(outer_ex),\n inner_ex_(inner_ex)\n {}\n\n \/\/ XXX executor adaptors like nested_executor need to implement execute to be sure we get the most efficient implementation\n\n \/\/ XXX think we can eliminate this function\n template<class Function>\n future<void> async_execute(Function f, shape_type shape)\n {\n \/\/ split the shape into the inner & outer portions\n auto outer_shape = this->outer_shape(shape);\n auto inner_shape = this->inner_shape(shape);\n\n return outer_traits::async_execute(outer_executor(), [=](outer_index_type outer_idx)\n {\n inner_traits::execute(inner_executor(), [=](inner_index_type inner_idx)\n {\n f(index_cat(outer_idx, inner_idx));\n },\n inner_shape\n );\n },\n outer_shape\n );\n }\n\n private:\n \/\/ this is the functor used by async_execute below\n \/\/ it takes the place of a nested, polymorphic lambda function\n template<class Function, class... InnerSharedType>\n struct async_execute_outer_functor\n {\n nested_executor& exec;\n Function f;\n inner_shape_type inner_shape;\n detail::tuple<InnerSharedType...> inner_shared_inits;\n\n template<class OuterIndex, class OuterSharedType>\n struct async_execute_inner_functor\n {\n Function f;\n OuterIndex outer_idx;\n OuterSharedType& outer_shared;\n\n template<class InnerIndex, class... T>\n void operator()(const InnerIndex& inner_idx, T&... inner_shared)\n {\n f(index_cat(outer_idx, inner_idx), outer_shared, inner_shared...);\n }\n };\n\n template<size_t... Indices, class OuterIndex, class T>\n void invoke_execute(detail::index_sequence<Indices...>, const OuterIndex& outer_idx, T& outer_shared)\n {\n inner_traits::execute(exec.inner_executor(), async_execute_inner_functor<OuterIndex,T>{f, outer_idx, outer_shared}, inner_shape, detail::get<Indices>(inner_shared_inits)...);\n }\n\n template<class OuterIndex, class T>\n void operator()(const OuterIndex& outer_idx, T& outer_shared)\n {\n invoke_execute(detail::index_sequence_for<InnerSharedType...>(), outer_idx, outer_shared);\n }\n };\n \n\n public:\n template<class Function, class T, class... Types>\n future<void> async_execute(Function f, shape_type shape, T outer_shared_init, Types... inner_shared_inits)\n {\n \/\/ XXX should assert on execution depth rather than size of shape_type\n static_assert(std::tuple_size<shape_type>::value == 1 + sizeof...(Types), \"Number of shared arguments must be the same as the size of shape_type.\");\n\n \/\/ split the shape into the inner & outer portions\n auto outer_shape = this->outer_shape(shape);\n auto inner_shape = this->inner_shape(shape);\n\n return outer_traits::async_execute(\n outer_executor(),\n async_execute_outer_functor<Function,Types...>{*this, f, inner_shape, detail::make_tuple(inner_shared_inits...)},\n outer_shape,\n outer_shared_init\n );\n\n \/\/ XXX gcc 4.8 can't capture parameter packs\n \/\/using outer_shared_param_type = decay_construct_result_t<T>;\n\n \/\/return outer_traits::async_execute(outer_executor(), [=](const outer_index_type& outer_idx, outer_shared_param_type& outer_shared_param)\n \/\/{\n \/\/ inner_traits::execute(inner_executor(), async_execute_inner_functor<Function,outer_shared_param_type>{f,outer_idx,outer_shared_param}, inner_shape, inner_shared_inits...);\n \/\/},\n \/\/outer_shape,\n \/\/outer_shared_init\n \/\/);\n\n \/\/ XXX use this implementation upon c++14:\n \/\/return outer_traits::async_execute(outer_executor(), [=](const auto& outer_idx, auto& outer_shared_param)\n \/\/{\n \/\/ inner_traits::execute(inner_executor(), [=,&outer_shared_param](const auto& inner_idx, auto&... inner_shared_parms)\n \/\/ {\n \/\/ f(index_cat(outer_idx, inner_idx), outer_shared_param, inner_shared_params...);\n \/\/ },\n \/\/ inner_shape,\n \/\/ inner_shared_inits...\n \/\/ );\n \/\/},\n \/\/outer_shape,\n \/\/outer_shared_init\n \/\/);\n }\n\n outer_executor_type& outer_executor()\n {\n return outer_ex_;\n }\n\n const outer_executor_type& outer_executor() const\n {\n return outer_ex_;\n }\n\n inner_executor_type& inner_executor()\n {\n return inner_ex_;\n }\n\n const inner_executor_type& inner_executor() const\n {\n return inner_ex_;\n }\n\n private:\n static outer_shape_type outer_shape(const shape_type& shape)\n {\n \/\/ the outer portion is always the head of the tuple\n return __tu::tuple_head(shape);\n }\n\n static inner_shape_type inner_shape(const shape_type& shape)\n {\n \/\/ the inner portion is the tail of the tuple, but if the \n \/\/ inner executor is not nested, then the tuple needs to be unwrapped\n return detail::unwrap_tuple_if_not_nested<inner_execution_category>(detail::forward_tail(shape));\n }\n\n outer_executor_type outer_ex_;\n inner_executor_type inner_ex_;\n};\n\n\n} \/\/ end agency\n\n<commit_msg>Receive shared initializers by forwarding reference in nested_executor<commit_after>#pragma once\n\n#include <utility>\n#include <agency\/execution_categories.hpp>\n#include <agency\/executor_traits.hpp>\n#include <agency\/detail\/tuple.hpp>\n#include <agency\/functional.hpp>\n#include <agency\/detail\/index_tuple.hpp>\n#include <agency\/detail\/tuple_utility.hpp>\n#include <agency\/detail\/make_tuple_if_not_nested.hpp>\n#include <agency\/detail\/unwrap_tuple_if_not_nested.hpp>\n\nnamespace agency\n{\n\n\ntemplate<class Executor1, class Executor2>\nclass nested_executor\n{\n public:\n using outer_executor_type = Executor1;\n using inner_executor_type = Executor2;\n\n private:\n using outer_traits = executor_traits<outer_executor_type>;\n using inner_traits = executor_traits<inner_executor_type>;\n\n using outer_execution_category = typename outer_traits::execution_category;\n using inner_execution_category = typename inner_traits::execution_category;\n\n using outer_index_type = typename outer_traits::index_type;\n using inner_index_type = typename inner_traits::index_type;\n\n \/\/ XXX move this into index_tuple.hpp?\n static auto index_cat(const outer_index_type& outer_idx, const inner_index_type& inner_idx)\n -> decltype(\n __tu::tuple_cat_apply(\n detail::index_tuple_maker{},\n detail::make_tuple_if_not_nested<outer_execution_category>(outer_idx),\n detail::make_tuple_if_not_nested<inner_execution_category>(inner_idx)\n )\n )\n {\n return __tu::tuple_cat_apply(\n detail::index_tuple_maker{},\n detail::make_tuple_if_not_nested<outer_execution_category>(outer_idx),\n detail::make_tuple_if_not_nested<inner_execution_category>(inner_idx)\n );\n }\n\n using outer_shape_type = typename outer_traits::shape_type;\n using inner_shape_type = typename inner_traits::shape_type;\n\n public:\n using execution_category = \n nested_execution_tag<\n outer_execution_category,\n inner_execution_category\n >;\n\n \/\/ XXX consider adding a public static make_shape() function\n using shape_type = decltype(\n detail::tuple_cat(\n detail::make_tuple_if_not_nested<outer_execution_category>(std::declval<outer_shape_type>()),\n detail::make_tuple_if_not_nested<inner_execution_category>(std::declval<inner_shape_type>())\n )\n );\n\n using index_type = decltype(\n index_cat(\n std::declval<outer_index_type>(), \n std::declval<inner_shape_type>()\n )\n );\n\n template<class T>\n using future = typename outer_traits::template future<T>;\n\n nested_executor() = default;\n\n nested_executor(const outer_executor_type& outer_ex,\n const inner_executor_type& inner_ex)\n : outer_ex_(outer_ex),\n inner_ex_(inner_ex)\n {}\n\n \/\/ XXX executor adaptors like nested_executor need to implement execute to be sure we get the most efficient implementation\n\n \/\/ XXX think we can eliminate this function\n template<class Function>\n future<void> async_execute(Function f, shape_type shape)\n {\n \/\/ split the shape into the inner & outer portions\n auto outer_shape = this->outer_shape(shape);\n auto inner_shape = this->inner_shape(shape);\n\n return outer_traits::async_execute(outer_executor(), [=](outer_index_type outer_idx)\n {\n inner_traits::execute(inner_executor(), [=](inner_index_type inner_idx)\n {\n f(index_cat(outer_idx, inner_idx));\n },\n inner_shape\n );\n },\n outer_shape\n );\n }\n\n private:\n \/\/ this is the functor used by async_execute below\n \/\/ it takes the place of a nested, polymorphic lambda function\n template<class Function, class... InnerSharedType>\n struct async_execute_outer_functor\n {\n nested_executor& exec;\n Function f;\n inner_shape_type inner_shape;\n detail::tuple<InnerSharedType...> inner_shared_inits;\n\n template<class OuterIndex, class OuterSharedType>\n struct async_execute_inner_functor\n {\n Function f;\n OuterIndex outer_idx;\n OuterSharedType& outer_shared;\n\n template<class InnerIndex, class... T>\n void operator()(const InnerIndex& inner_idx, T&... inner_shared)\n {\n f(index_cat(outer_idx, inner_idx), outer_shared, inner_shared...);\n }\n };\n\n template<size_t... Indices, class OuterIndex, class T>\n void invoke_execute(detail::index_sequence<Indices...>, const OuterIndex& outer_idx, T& outer_shared)\n {\n inner_traits::execute(exec.inner_executor(), async_execute_inner_functor<OuterIndex,T>{f, outer_idx, outer_shared}, inner_shape, detail::get<Indices>(inner_shared_inits)...);\n }\n\n template<class OuterIndex, class T>\n void operator()(const OuterIndex& outer_idx, T& outer_shared)\n {\n invoke_execute(detail::index_sequence_for<InnerSharedType...>(), outer_idx, outer_shared);\n }\n };\n \n\n public:\n template<class Function, class T, class... Types>\n future<void> async_execute(Function f, shape_type shape, T&& outer_shared_init, Types&&... inner_shared_inits)\n {\n \/\/ XXX should assert on execution depth rather than size of shape_type\n static_assert(std::tuple_size<shape_type>::value == 1 + sizeof...(Types), \"Number of shared arguments must be the same as the size of shape_type.\");\n\n \/\/ split the shape into the inner & outer portions\n auto outer_shape = this->outer_shape(shape);\n auto inner_shape = this->inner_shape(shape);\n\n return outer_traits::async_execute(\n outer_executor(),\n async_execute_outer_functor<Function,typename std::decay<Types>::type...>{*this, f, inner_shape, detail::forward_as_tuple(inner_shared_inits...)},\n outer_shape,\n std::forward<T>(outer_shared_init)\n );\n\n \/\/ XXX gcc 4.8 can't capture parameter packs\n \/\/using outer_shared_param_type = decay_construct_result_t<T>;\n\n \/\/return outer_traits::async_execute(outer_executor(), [=](const outer_index_type& outer_idx, outer_shared_param_type& outer_shared_param)\n \/\/{\n \/\/ inner_traits::execute(inner_executor(), async_execute_inner_functor<Function,outer_shared_param_type>{f,outer_idx,outer_shared_param}, inner_shape, inner_shared_inits...);\n \/\/},\n \/\/outer_shape,\n \/\/outer_shared_init\n \/\/);\n\n \/\/ XXX use this implementation upon c++14:\n \/\/return outer_traits::async_execute(outer_executor(), [=](const auto& outer_idx, auto& outer_shared_param)\n \/\/{\n \/\/ inner_traits::execute(inner_executor(), [=,&outer_shared_param](const auto& inner_idx, auto&... inner_shared_parms)\n \/\/ {\n \/\/ f(index_cat(outer_idx, inner_idx), outer_shared_param, inner_shared_params...);\n \/\/ },\n \/\/ inner_shape,\n \/\/ inner_shared_inits...\n \/\/ );\n \/\/},\n \/\/outer_shape,\n \/\/outer_shared_init\n \/\/);\n }\n\n outer_executor_type& outer_executor()\n {\n return outer_ex_;\n }\n\n const outer_executor_type& outer_executor() const\n {\n return outer_ex_;\n }\n\n inner_executor_type& inner_executor()\n {\n return inner_ex_;\n }\n\n const inner_executor_type& inner_executor() const\n {\n return inner_ex_;\n }\n\n private:\n static outer_shape_type outer_shape(const shape_type& shape)\n {\n \/\/ the outer portion is always the head of the tuple\n return __tu::tuple_head(shape);\n }\n\n static inner_shape_type inner_shape(const shape_type& shape)\n {\n \/\/ the inner portion is the tail of the tuple, but if the \n \/\/ inner executor is not nested, then the tuple needs to be unwrapped\n return detail::unwrap_tuple_if_not_nested<inner_execution_category>(detail::forward_tail(shape));\n }\n\n outer_executor_type outer_ex_;\n inner_executor_type inner_ex_;\n};\n\n\n} \/\/ end agency\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef UTIL_LANG_RANGE_HPP\n#define UTIL_LANG_RANGE_HPP\n\n#include <iterator>\n#include <type_traits>\n\nnamespace util { namespace lang {\n\nnamespace detail {\n\ntemplate <typename T>\nstruct range_iter_base : std::iterator<std::input_iterator_tag, T> {\n range_iter_base(T current) : current(current) { }\n\n T operator *() const { return current; }\n\n T const* operator ->() const { return ¤t; }\n\n range_iter_base& operator ++() {\n ++current;\n return *this;\n }\n\n range_iter_base operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n bool operator ==(range_iter_base const& other) const {\n return current == other.current;\n }\n\n bool operator !=(range_iter_base const& other) const {\n return not (*this == other);\n }\n\nprotected:\n T current;\n};\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct range_proxy {\n struct iter : detail::range_iter_base<T> {\n iter(T current) : detail::range_iter_base<T>(current) { }\n };\n\n struct step_range_proxy {\n struct iter : detail::range_iter_base<T> {\n iter(T current, T step)\n : detail::range_iter_base<T>(current), step(step) { }\n\n using detail::range_iter_base<T>::current;\n\n iter& operator ++() {\n current += step;\n return *this;\n }\n\n iter operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n \/\/ Loses commutativity. Iterator-based ranges are simply broken. :-(\n bool operator ==(iter const& other) const {\n return step > 0 ? current >= other.current\n : current < other.current;\n }\n\n bool operator !=(iter const& other) const {\n return not (*this == other);\n }\n\n private:\n T step;\n };\n\n step_range_proxy(T begin, T end, T step)\n : begin_(begin, step), end_(end, step) { }\n\n iter begin() const { return begin_; }\n\n iter end() const { return end_; }\n\n private:\n iter begin_;\n iter end_;\n };\n\n range_proxy(T begin, T end) : begin_(begin), end_(end) { }\n\n step_range_proxy step(T step) {\n return {*begin_, *end_, step};\n }\n\n iter begin() const { return begin_; }\n\n iter end() const { return end_; }\n\nprivate:\n iter begin_;\n iter end_;\n};\n\ntemplate <typename T>\nstruct infinite_range_proxy {\n struct iter : detail::range_iter_base<T> {\n iter(T current = T()) : detail::range_iter_base<T>(current) { }\n\n bool operator ==(iter const&) const { return false; }\n\n bool operator !=(iter const&) const { return true; }\n };\n\n struct step_range_proxy {\n struct iter : detail::range_iter_base<T> {\n iter(T current = T(), T step = T())\n : detail::range_iter_base<T>(current), step(step) { }\n\n using detail::range_iter_base<T>::current;\n\n iter& operator ++() {\n current += step;\n return *this;\n }\n\n iter operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n bool operator ==(iter const&) const { return false; }\n\n bool operator !=(iter const&) const { return true; }\n\n private:\n T step;\n };\n\n step_range_proxy(T begin, T step) : begin_(begin, step) { }\n\n iter begin() const { return begin_; }\n\n iter end() const { return iter(); }\n\n private:\n iter begin_;\n };\n\n infinite_range_proxy(T begin) : begin_(begin) { }\n\n step_range_proxy step(T step) {\n return step_range_proxy(*begin_, step);\n }\n\n iter begin() const { return begin_; }\n\n iter end() const { return iter(); }\n\nprivate:\n iter begin_;\n};\n\ntemplate <typename T>\nrange_proxy<T> range(T begin, T end) {\n return {begin, end};\n}\n\ntemplate <typename T>\ninfinite_range_proxy<T> range(T begin) {\n return {begin};\n}\n\nnamespace traits {\n\ntemplate <typename C>\nstruct has_size {\n template <typename T>\n static constexpr auto check(T*) ->\n typename std::is_integral<\n decltype(std::declval<T const>().size())>::type;\n\n template <typename>\n static constexpr auto check(...) -> std::false_type;\n\n using type = decltype(check<C>(0));\n static constexpr bool value = type::value;\n};\n\n} \/\/ namespace traits\n\ntemplate <typename C, typename = typename std::enable_if<traits::has_size<C>::value>>\nauto indices(C const& cont) -> range_proxy<decltype(cont.size())> {\n return {0, cont.size()};\n}\n\ntemplate <typename T, std::size_t N>\nrange_proxy<std::size_t> indices(T (&)[N]) {\n return {0, N};\n}\n\ntemplate <typename T>\nrange_proxy<typename std::initializer_list<T>::size_type>\nindices(std::initializer_list<T>&& cont) {\n return {0, cont.size()};\n}\n\n} } \/\/ namespace util::lang\n\n#endif \/\/ ndef UTIL_LANG_RANGE_HPP\n<commit_msg>Make range utilities usable in CUDA __device__ functions when compiled with nvcc.<commit_after>#ifndef UTIL_LANG_RANGE_HPP\n#define UTIL_LANG_RANGE_HPP\n\n#include <iterator>\n#include <type_traits>\n\n\/\/ Make these ranges usable inside CUDA C++ device code\n#ifdef __CUDACC__\n#define DEVICE_CALLABLE __host__ __device__\n#else\n#define DEVICE_CALLABLE\n#endif\n\nnamespace util { namespace lang {\n\nnamespace detail {\n\ntemplate <typename T>\nstruct range_iter_base : std::iterator<std::input_iterator_tag, T> {\n DEVICE_CALLABLE\n range_iter_base(T current) : current(current) { }\n\n DEVICE_CALLABLE\n T operator *() const { return current; }\n\n DEVICE_CALLABLE\n T const* operator ->() const { return ¤t; }\n\n DEVICE_CALLABLE\n range_iter_base& operator ++() {\n ++current;\n return *this;\n }\n\n DEVICE_CALLABLE\n range_iter_base operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n DEVICE_CALLABLE\n bool operator ==(range_iter_base const& other) const {\n return current == other.current;\n }\n\n DEVICE_CALLABLE\n bool operator !=(range_iter_base const& other) const {\n return not (*this == other);\n }\n\nprotected:\n T current;\n};\n\n} \/\/ namespace detail\n\ntemplate <typename T>\nstruct range_proxy {\n struct iter : detail::range_iter_base<T> {\n DEVICE_CALLABLE\n iter(T current) : detail::range_iter_base<T>(current) { }\n };\n\n struct step_range_proxy {\n struct iter : detail::range_iter_base<T> {\n DEVICE_CALLABLE\n iter(T current, T step)\n : detail::range_iter_base<T>(current), step(step) { }\n\n using detail::range_iter_base<T>::current;\n\n DEVICE_CALLABLE\n iter& operator ++() {\n current += step;\n return *this;\n }\n\n DEVICE_CALLABLE\n iter operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n \/\/ Loses commutativity. Iterator-based ranges are simply broken. :-(\n DEVICE_CALLABLE\n bool operator ==(iter const& other) const {\n return step > 0 ? current >= other.current\n : current < other.current;\n }\n\n DEVICE_CALLABLE\n bool operator !=(iter const& other) const {\n return not (*this == other);\n }\n\n private:\n T step;\n };\n\n DEVICE_CALLABLE\n step_range_proxy(T begin, T end, T step)\n : begin_(begin, step), end_(end, step) { }\n\n DEVICE_CALLABLE\n iter begin() const { return begin_; }\n\n DEVICE_CALLABLE\n iter end() const { return end_; }\n\n private:\n iter begin_;\n iter end_;\n };\n\n DEVICE_CALLABLE\n range_proxy(T begin, T end) : begin_(begin), end_(end) { }\n\n DEVICE_CALLABLE\n step_range_proxy step(T step) {\n return {*begin_, *end_, step};\n }\n\n DEVICE_CALLABLE\n iter begin() const { return begin_; }\n\n DEVICE_CALLABLE\n iter end() const { return end_; }\n\nprivate:\n iter begin_;\n iter end_;\n};\n\ntemplate <typename T>\nstruct infinite_range_proxy {\n struct iter : detail::range_iter_base<T> {\n DEVICE_CALLABLE\n iter(T current = T()) : detail::range_iter_base<T>(current) { }\n\n DEVICE_CALLABLE\n bool operator ==(iter const&) const { return false; }\n\n DEVICE_CALLABLE\n bool operator !=(iter const&) const { return true; }\n };\n\n struct step_range_proxy {\n struct iter : detail::range_iter_base<T> {\n DEVICE_CALLABLE\n iter(T current = T(), T step = T())\n : detail::range_iter_base<T>(current), step(step) { }\n\n using detail::range_iter_base<T>::current;\n\n DEVICE_CALLABLE\n iter& operator ++() {\n current += step;\n return *this;\n }\n\n DEVICE_CALLABLE\n iter operator ++(int) {\n auto copy = *this;\n ++*this;\n return copy;\n }\n\n DEVICE_CALLABLE\n bool operator ==(iter const&) const { return false; }\n\n DEVICE_CALLABLE\n bool operator !=(iter const&) const { return true; }\n\n private:\n T step;\n };\n\n DEVICE_CALLABLE\n step_range_proxy(T begin, T step) : begin_(begin, step) { }\n\n DEVICE_CALLABLE\n iter begin() const { return begin_; }\n\n DEVICE_CALLABLE\n iter end() const { return iter(); }\n\n private:\n iter begin_;\n };\n\n DEVICE_CALLABLE\n infinite_range_proxy(T begin) : begin_(begin) { }\n\n DEVICE_CALLABLE\n step_range_proxy step(T step) {\n return step_range_proxy(*begin_, step);\n }\n\n DEVICE_CALLABLE\n iter begin() const { return begin_; }\n\n DEVICE_CALLABLE\n iter end() const { return iter(); }\n\nprivate:\n iter begin_;\n};\n\ntemplate <typename T>\nDEVICE_CALLABLE\nrange_proxy<T> range(T begin, T end) {\n return {begin, end};\n}\n\ntemplate <typename T>\nDEVICE_CALLABLE\ninfinite_range_proxy<T> range(T begin) {\n return {begin};\n}\n\nnamespace traits {\n\ntemplate <typename C>\nstruct has_size {\n template <typename T>\n static constexpr auto check(T*) ->\n typename std::is_integral<\n decltype(std::declval<T const>().size())>::type;\n\n template <typename>\n static constexpr auto check(...) -> std::false_type;\n\n using type = decltype(check<C>(0));\n static constexpr bool value = type::value;\n};\n\n} \/\/ namespace traits\n\ntemplate <typename C, typename = typename std::enable_if<traits::has_size<C>::value>>\nDEVICE_CALLABLE\nauto indices(C const& cont) -> range_proxy<decltype(cont.size())> {\n return {0, cont.size()};\n}\n\ntemplate <typename T, std::size_t N>\nDEVICE_CALLABLE\nrange_proxy<std::size_t> indices(T (&)[N]) {\n return {0, N};\n}\n\ntemplate <typename T>\nrange_proxy<typename std::initializer_list<T>::size_type>\nDEVICE_CALLABLE\nindices(std::initializer_list<T>&& cont) {\n return {0, cont.size()};\n}\n\n} } \/\/ namespace util::lang\n\n#endif \/\/ ndef UTIL_LANG_RANGE_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Markdown.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/markdown\/Markdown.hpp>\n\n#include <iostream>\n\n#include <boost\/scoped_ptr.hpp>\n\n#include <core\/Error.hpp>\n#include <core\/FilePath.hpp>\n#include <core\/StringUtils.hpp>\n#include <core\/FileSerializer.hpp>\n\n#include \"MathJax.hpp\"\n\n#include \"sundown\/markdown.h\"\n#include \"sundown\/html.h\"\n\nnamespace core {\nnamespace markdown {\n\nnamespace {\n\nclass SundownBuffer : boost::noncopyable\n{\npublic:\n explicit SundownBuffer(std::size_t unit = 128)\n : pBuff_(NULL)\n {\n pBuff_ = ::bufnew(unit);\n }\n\n explicit SundownBuffer(const std::string& str)\n {\n pBuff_ = ::bufnew(str.length());\n if (pBuff_ != NULL)\n {\n if (grow(str.length()) == BUF_OK)\n {\n put(str);\n }\n else\n {\n ::bufrelease(pBuff_);\n pBuff_ = NULL;\n }\n }\n }\n\n ~SundownBuffer()\n {\n if (pBuff_)\n ::bufrelease(pBuff_);\n }\n\n \/\/ COPYING: prohibited (boost::noncopyable)\n\n bool allocated() const { return pBuff_ != NULL; }\n\n int grow(std::size_t size)\n {\n return ::bufgrow(pBuff_, size);\n }\n\n void put(const std::string& str)\n {\n ::bufput(pBuff_, str.data(), str.length());\n }\n\n uint8_t* data() const\n {\n return pBuff_->data;\n }\n\n std::size_t size() const\n {\n return pBuff_->size;\n }\n\n const char* c_str() const\n {\n return ::bufcstr(pBuff_);\n }\n\n operator buf*() const\n {\n return pBuff_;\n }\n\nprivate:\n friend class SundownMarkdown;\n buf* pBuff_;\n};\n\nclass SundownMarkdown : boost::noncopyable\n{\npublic:\n SundownMarkdown(unsigned int extensions,\n size_t maxNesting,\n const struct sd_callbacks* pCallbacks,\n void *pOpaque)\n : pMD_(NULL)\n {\n pMD_ = ::sd_markdown_new(extensions, maxNesting, pCallbacks, pOpaque);\n }\n\n ~SundownMarkdown()\n {\n if (pMD_)\n ::sd_markdown_free(pMD_);\n }\n\n \/\/ COPYING: prohibited (boost::noncopyable)\n\n bool allocated() const { return pMD_ != NULL; }\n\n void render(const SundownBuffer& input, SundownBuffer* pOutput)\n {\n ::sd_markdown_render(pOutput->pBuff_,\n input.pBuff_->data,\n input.pBuff_->size,\n pMD_);\n }\n\nprivate:\n struct sd_markdown* pMD_;\n};\n\nError allocationError(const ErrorLocation& location)\n{\n return systemError(boost::system::errc::not_enough_memory, location);\n}\n\nError renderMarkdown(const SundownBuffer& inputBuffer,\n const Extensions& extensions,\n bool smartypants,\n struct sd_callbacks* pHtmlCallbacks,\n struct html_renderopt* pHtmlOptions,\n std::string* pOutput)\n{\n \/\/ render markdown\n const int kMaxNesting = 16;\n int mdExt = 0;\n if (extensions.noIntraEmphasis)\n mdExt |= MKDEXT_NO_INTRA_EMPHASIS;\n if (extensions.tables)\n mdExt |= MKDEXT_TABLES;\n if (extensions.fencedCode)\n mdExt |= MKDEXT_FENCED_CODE;\n if (extensions.autolink)\n mdExt |= MKDEXT_AUTOLINK;\n if (extensions.strikethrough)\n mdExt |= MKDEXT_STRIKETHROUGH;\n if (extensions.laxSpacing)\n mdExt |= MKDEXT_LAX_SPACING;\n if (extensions.spaceHeaders)\n mdExt |= MKDEXT_SPACE_HEADERS;\n if (extensions.superscript)\n mdExt |= MKDEXT_SUPERSCRIPT;\n\n SundownMarkdown md(mdExt, kMaxNesting, pHtmlCallbacks, pHtmlOptions);\n if (!md.allocated())\n return allocationError(ERROR_LOCATION);\n SundownBuffer outputBuffer;\n md.render(inputBuffer, &outputBuffer);\n\n \/\/ do smartypants substitution if requested\n if (smartypants)\n {\n SundownBuffer smartyBuffer;\n if (!smartyBuffer.allocated())\n return allocationError(ERROR_LOCATION);\n\n ::sdhtml_smartypants(smartyBuffer,\n outputBuffer.data(),\n outputBuffer.size());\n\n *pOutput = smartyBuffer.c_str();\n }\n else\n {\n *pOutput = outputBuffer.c_str();\n }\n\n return Success();\n}\n\n} \/\/ anonymous namespace\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const FilePath& markdownFile,\n const Extensions& extensions,\n const HTMLOptions& options,\n const FilePath& htmlFile)\n{\n std::string markdownOutput;\n Error error = markdownToHTML(markdownFile,\n extensions,\n options,\n &markdownOutput);\n if (error)\n return error;\n\n return core::writeStringToFile(htmlFile,\n markdownOutput,\n string_utils::LineEndingNative);\n}\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const FilePath& markdownFile,\n const Extensions& extensions,\n const HTMLOptions& options,\n std::string* pHTMLOutput)\n{\n std::string markdownInput;\n Error error = core::readStringFromFile(markdownFile,\n &markdownInput,\n string_utils::LineEndingPosix);\n if (error)\n return error;\n\n return markdownToHTML(markdownInput, extensions, options, pHTMLOutput);\n}\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const std::string& markdownInput,\n const Extensions& extensions,\n const HTMLOptions& options,\n std::string* pHTMLOutput)\n\n{\n \/\/ exclude fenced code blocks\n std::vector<ExcludePattern> excludePatterns;\n excludePatterns.push_back(ExcludePattern(boost::regex(\"^`{3,}.*?$\"),\n boost::regex(\"^`{3,}\\\\s*$\")));\n\n \/\/ exclude inline verbatim code\n excludePatterns.push_back(ExcludePattern(boost::regex(\"`.+?`\")));\n\n \/\/ exclude indented code blocks\n excludePatterns.push_back(ExcludePattern(\n boost::regex(\"(\\\\A|\\\\A\\\\s*\\\\n|\\\\n\\\\s*\\\\n)(( {4}|\\\\t)[^\\\\n]*\\\\n)*(( {4}|\\\\t)[^\\\\n]*)\")));\n\n std::string input = markdownInput;\n boost::scoped_ptr<MathJaxFilter> pMathFilter;\n if (extensions.ignoreMath)\n {\n pMathFilter.reset(new MathJaxFilter(excludePatterns,\n &input,\n pHTMLOutput));\n }\n\n \/\/ setup input buffer\n SundownBuffer inputBuffer(input);\n if (!inputBuffer.allocated())\n return allocationError(ERROR_LOCATION);\n\n \/\/ render table of contents if requested\n if (options.toc)\n {\n struct sd_callbacks htmlCallbacks;\n struct html_renderopt htmlOptions;\n ::sdhtml_toc_renderer(&htmlCallbacks, &htmlOptions);\n std::string tocOutput;\n Error error = renderMarkdown(inputBuffer,\n extensions,\n options.smartypants,\n &htmlCallbacks,\n &htmlOptions,\n &tocOutput);\n if (error)\n return error;\n pHTMLOutput->append(\"<div id=\\\"toc\\\">\\n\");\n pHTMLOutput->append(\"<div id=\\\"toc_header\\\">Table of Contents<\/div>\\n\");\n pHTMLOutput->append(tocOutput);\n pHTMLOutput->append(\"<\/div>\\n\");\n pHTMLOutput->append(\"\\n\");\n }\n\n \/\/ setup html renderer\n struct sd_callbacks htmlCallbacks;\n struct html_renderopt htmlOptions;\n int htmlRenderMode = 0;\n if (options.useXHTML)\n htmlRenderMode |= HTML_USE_XHTML;\n if (options.hardWrap)\n htmlRenderMode |= HTML_HARD_WRAP;\n if (options.toc)\n htmlRenderMode |= HTML_TOC;\n if (options.safelink)\n htmlRenderMode |= HTML_SAFELINK;\n if (options.skipHTML)\n htmlRenderMode |= HTML_SKIP_HTML;\n if (options.skipStyle)\n htmlRenderMode |= HTML_SKIP_STYLE;\n if (options.skipImages)\n htmlRenderMode |= HTML_SKIP_IMAGES;\n if (options.skipLinks)\n htmlRenderMode |= HTML_SKIP_LINKS;\n if (options.escape)\n htmlRenderMode |= HTML_ESCAPE;\n ::sdhtml_renderer(&htmlCallbacks, &htmlOptions, htmlRenderMode);\n\n \/\/ render page\n std::string output;\n Error error = renderMarkdown(inputBuffer,\n extensions,\n options.smartypants,\n &htmlCallbacks,\n &htmlOptions,\n &output);\n if (error)\n return error;\n\n \/\/ append output and return success\n pHTMLOutput->append(output);\n return Success();\n}\n\nbool isMathJaxRequired(const std::string& htmlOutput)\n{\n return requiresMathjax(htmlOutput);\n}\n\n} \/\/ namespace markdown\n} \/\/ namespace core\n \n\n\n\n<commit_msg>Tweak regexes to account for Boost . matching \\n<commit_after>\/*\n * Markdown.cpp\n *\n * Copyright (C) 2009-12 by RStudio, Inc.\n *\n * This program is licensed to you under the terms of version 3 of the\n * GNU Affero General Public License. This program is distributed WITHOUT\n * ANY EXPRESS OR IMPLIED WARRANTY, INCLUDING THOSE OF NON-INFRINGEMENT,\n * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Please refer to the\n * AGPL (http:\/\/www.gnu.org\/licenses\/agpl-3.0.txt) for more details.\n *\n *\/\n\n#include <core\/markdown\/Markdown.hpp>\n\n#include <iostream>\n\n#include <boost\/scoped_ptr.hpp>\n\n#include <core\/Error.hpp>\n#include <core\/FilePath.hpp>\n#include <core\/StringUtils.hpp>\n#include <core\/FileSerializer.hpp>\n\n#include \"MathJax.hpp\"\n\n#include \"sundown\/markdown.h\"\n#include \"sundown\/html.h\"\n\nnamespace core {\nnamespace markdown {\n\nnamespace {\n\nclass SundownBuffer : boost::noncopyable\n{\npublic:\n explicit SundownBuffer(std::size_t unit = 128)\n : pBuff_(NULL)\n {\n pBuff_ = ::bufnew(unit);\n }\n\n explicit SundownBuffer(const std::string& str)\n {\n pBuff_ = ::bufnew(str.length());\n if (pBuff_ != NULL)\n {\n if (grow(str.length()) == BUF_OK)\n {\n put(str);\n }\n else\n {\n ::bufrelease(pBuff_);\n pBuff_ = NULL;\n }\n }\n }\n\n ~SundownBuffer()\n {\n if (pBuff_)\n ::bufrelease(pBuff_);\n }\n\n \/\/ COPYING: prohibited (boost::noncopyable)\n\n bool allocated() const { return pBuff_ != NULL; }\n\n int grow(std::size_t size)\n {\n return ::bufgrow(pBuff_, size);\n }\n\n void put(const std::string& str)\n {\n ::bufput(pBuff_, str.data(), str.length());\n }\n\n uint8_t* data() const\n {\n return pBuff_->data;\n }\n\n std::size_t size() const\n {\n return pBuff_->size;\n }\n\n const char* c_str() const\n {\n return ::bufcstr(pBuff_);\n }\n\n operator buf*() const\n {\n return pBuff_;\n }\n\nprivate:\n friend class SundownMarkdown;\n buf* pBuff_;\n};\n\nclass SundownMarkdown : boost::noncopyable\n{\npublic:\n SundownMarkdown(unsigned int extensions,\n size_t maxNesting,\n const struct sd_callbacks* pCallbacks,\n void *pOpaque)\n : pMD_(NULL)\n {\n pMD_ = ::sd_markdown_new(extensions, maxNesting, pCallbacks, pOpaque);\n }\n\n ~SundownMarkdown()\n {\n if (pMD_)\n ::sd_markdown_free(pMD_);\n }\n\n \/\/ COPYING: prohibited (boost::noncopyable)\n\n bool allocated() const { return pMD_ != NULL; }\n\n void render(const SundownBuffer& input, SundownBuffer* pOutput)\n {\n ::sd_markdown_render(pOutput->pBuff_,\n input.pBuff_->data,\n input.pBuff_->size,\n pMD_);\n }\n\nprivate:\n struct sd_markdown* pMD_;\n};\n\nError allocationError(const ErrorLocation& location)\n{\n return systemError(boost::system::errc::not_enough_memory, location);\n}\n\nError renderMarkdown(const SundownBuffer& inputBuffer,\n const Extensions& extensions,\n bool smartypants,\n struct sd_callbacks* pHtmlCallbacks,\n struct html_renderopt* pHtmlOptions,\n std::string* pOutput)\n{\n \/\/ render markdown\n const int kMaxNesting = 16;\n int mdExt = 0;\n if (extensions.noIntraEmphasis)\n mdExt |= MKDEXT_NO_INTRA_EMPHASIS;\n if (extensions.tables)\n mdExt |= MKDEXT_TABLES;\n if (extensions.fencedCode)\n mdExt |= MKDEXT_FENCED_CODE;\n if (extensions.autolink)\n mdExt |= MKDEXT_AUTOLINK;\n if (extensions.strikethrough)\n mdExt |= MKDEXT_STRIKETHROUGH;\n if (extensions.laxSpacing)\n mdExt |= MKDEXT_LAX_SPACING;\n if (extensions.spaceHeaders)\n mdExt |= MKDEXT_SPACE_HEADERS;\n if (extensions.superscript)\n mdExt |= MKDEXT_SUPERSCRIPT;\n\n SundownMarkdown md(mdExt, kMaxNesting, pHtmlCallbacks, pHtmlOptions);\n if (!md.allocated())\n return allocationError(ERROR_LOCATION);\n SundownBuffer outputBuffer;\n md.render(inputBuffer, &outputBuffer);\n\n \/\/ do smartypants substitution if requested\n if (smartypants)\n {\n SundownBuffer smartyBuffer;\n if (!smartyBuffer.allocated())\n return allocationError(ERROR_LOCATION);\n\n ::sdhtml_smartypants(smartyBuffer,\n outputBuffer.data(),\n outputBuffer.size());\n\n *pOutput = smartyBuffer.c_str();\n }\n else\n {\n *pOutput = outputBuffer.c_str();\n }\n\n return Success();\n}\n\n} \/\/ anonymous namespace\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const FilePath& markdownFile,\n const Extensions& extensions,\n const HTMLOptions& options,\n const FilePath& htmlFile)\n{\n std::string markdownOutput;\n Error error = markdownToHTML(markdownFile,\n extensions,\n options,\n &markdownOutput);\n if (error)\n return error;\n\n return core::writeStringToFile(htmlFile,\n markdownOutput,\n string_utils::LineEndingNative);\n}\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const FilePath& markdownFile,\n const Extensions& extensions,\n const HTMLOptions& options,\n std::string* pHTMLOutput)\n{\n std::string markdownInput;\n Error error = core::readStringFromFile(markdownFile,\n &markdownInput,\n string_utils::LineEndingPosix);\n if (error)\n return error;\n\n return markdownToHTML(markdownInput, extensions, options, pHTMLOutput);\n}\n\n\/\/ render markdown to HTML -- assumes UTF-8 encoding\nError markdownToHTML(const std::string& markdownInput,\n const Extensions& extensions,\n const HTMLOptions& options,\n std::string* pHTMLOutput)\n\n{\n \/\/ exclude fenced code blocks\n std::vector<ExcludePattern> excludePatterns;\n excludePatterns.push_back(ExcludePattern(boost::regex(\"^`{3,}[^\\\\n]*?$\"),\n boost::regex(\"^`{3,}\\\\s*$\")));\n\n \/\/ exclude inline verbatim code\n excludePatterns.push_back(ExcludePattern(boost::regex(\"`[^\\\\n]+?`\")));\n\n \/\/ exclude indented code blocks\n excludePatterns.push_back(ExcludePattern(\n boost::regex(\"(\\\\A|\\\\A\\\\s*\\\\n|\\\\n\\\\s*\\\\n)(( {4}|\\\\t)[^\\\\n]*\\\\n)*(( {4}|\\\\t)[^\\\\n]*)\")));\n\n std::string input = markdownInput;\n boost::scoped_ptr<MathJaxFilter> pMathFilter;\n if (extensions.ignoreMath)\n {\n pMathFilter.reset(new MathJaxFilter(excludePatterns,\n &input,\n pHTMLOutput));\n }\n\n \/\/ setup input buffer\n SundownBuffer inputBuffer(input);\n if (!inputBuffer.allocated())\n return allocationError(ERROR_LOCATION);\n\n \/\/ render table of contents if requested\n if (options.toc)\n {\n struct sd_callbacks htmlCallbacks;\n struct html_renderopt htmlOptions;\n ::sdhtml_toc_renderer(&htmlCallbacks, &htmlOptions);\n std::string tocOutput;\n Error error = renderMarkdown(inputBuffer,\n extensions,\n options.smartypants,\n &htmlCallbacks,\n &htmlOptions,\n &tocOutput);\n if (error)\n return error;\n pHTMLOutput->append(\"<div id=\\\"toc\\\">\\n\");\n pHTMLOutput->append(\"<div id=\\\"toc_header\\\">Table of Contents<\/div>\\n\");\n pHTMLOutput->append(tocOutput);\n pHTMLOutput->append(\"<\/div>\\n\");\n pHTMLOutput->append(\"\\n\");\n }\n\n \/\/ setup html renderer\n struct sd_callbacks htmlCallbacks;\n struct html_renderopt htmlOptions;\n int htmlRenderMode = 0;\n if (options.useXHTML)\n htmlRenderMode |= HTML_USE_XHTML;\n if (options.hardWrap)\n htmlRenderMode |= HTML_HARD_WRAP;\n if (options.toc)\n htmlRenderMode |= HTML_TOC;\n if (options.safelink)\n htmlRenderMode |= HTML_SAFELINK;\n if (options.skipHTML)\n htmlRenderMode |= HTML_SKIP_HTML;\n if (options.skipStyle)\n htmlRenderMode |= HTML_SKIP_STYLE;\n if (options.skipImages)\n htmlRenderMode |= HTML_SKIP_IMAGES;\n if (options.skipLinks)\n htmlRenderMode |= HTML_SKIP_LINKS;\n if (options.escape)\n htmlRenderMode |= HTML_ESCAPE;\n ::sdhtml_renderer(&htmlCallbacks, &htmlOptions, htmlRenderMode);\n\n \/\/ render page\n std::string output;\n Error error = renderMarkdown(inputBuffer,\n extensions,\n options.smartypants,\n &htmlCallbacks,\n &htmlOptions,\n &output);\n if (error)\n return error;\n\n \/\/ append output and return success\n pHTMLOutput->append(output);\n return Success();\n}\n\nbool isMathJaxRequired(const std::string& htmlOutput)\n{\n return requiresMathjax(htmlOutput);\n}\n\n} \/\/ namespace markdown\n} \/\/ namespace core\n \n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestPStream.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkActor.h\"\n#include \"vtkCamera.h\"\n#include \"vtkCompositeManager.h\"\n#include \"vtkDebugLeaks.h\"\n#include \"vtkDistributedStreamTracer.h\"\n#include \"vtkLineSource.h\"\n#include \"vtkLookupTable.h\"\n#include \"vtkMultiProcessController.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPLOT3DReader.h\"\n#include \"vtkPVGeometryFilter.h\"\n#include \"vtkParallelFactory.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkStructuredGrid.h\"\n\nstruct PStreamArgs_tmp\n{\n int* retVal;\n int argc;\n char** argv;\n};\n\n\/\/ This will be called by all processes\nvoid MyMain( vtkMultiProcessController *controller, void *arg )\n{\n\n PStreamArgs_tmp* args = \n reinterpret_cast<PStreamArgs_tmp*>(arg);\n\n int myId = controller->GetLocalProcessId();\n int numProcs = controller->GetNumberOfProcesses();\n\n vtkRenderer* ren = vtkRenderer::New();\n ren->SetBackground(0.33, 0.35, 0.43);\n\n vtkRenderWindow* renWin = vtkRenderWindow::New();\n renWin->AddRenderer(ren);\n renWin->SetSize(400, 300);\n renWin->SetPosition(410*myId, 0);\n\n \/\/camera parameters\n vtkCamera* camera = ren->GetActiveCamera();\n camera->SetPosition(-5.86786, 49.2857, 51.597);\n camera->SetFocalPoint(8.255, -3.17482e-16, 29.7631);\n camera->SetViewUp(-0.112182, -0.42918, 0.896225);\n camera->SetViewAngle(30);\n camera->SetClippingRange(10.0, 80.6592);\n camera->Dolly(1.5);\n \n \/\/ Create the reader, the data file name might have\n \/\/ to be changed depending on where the data files are.\n char* fname1 = vtkTestUtilities::ExpandDataFileName(args->argc, args->argv, \n \"Data\/combxyz.bin\");\n char* fname2 = vtkTestUtilities::ExpandDataFileName(args->argc, args->argv, \n \"Data\/combq.bin\");\n vtkPLOT3DReader* Plot3D0 = vtkPLOT3DReader::New();\n Plot3D0->SetFileName(fname1);\n Plot3D0->SetQFileName (fname2);\n Plot3D0->SetBinaryFile(1);\n Plot3D0->SetMultiGrid(0);\n Plot3D0->SetHasByteCount(0);\n Plot3D0->SetIBlanking(0);\n Plot3D0->SetTwoDimensionalGeometry(0);\n Plot3D0->SetForceRead(0);\n Plot3D0->SetByteOrder(0);\n delete[] fname1;\n delete[] fname2;\n\n vtkPVGeometryFilter* Geometry5 = vtkPVGeometryFilter::New();\n Geometry5->SetInput(Plot3D0->GetOutput());\n \n vtkPolyDataMapper* Mapper5 = vtkPolyDataMapper::New();\n Mapper5->SetInput(Geometry5->GetOutput());\n Mapper5->SetImmediateModeRendering(1);\n Mapper5->UseLookupTableScalarRangeOn();\n Mapper5->SetScalarVisibility(0);\n Mapper5->SetScalarModeToDefault();\n\n vtkActor* Actor5 = vtkActor::New();\n Actor5->SetMapper(Mapper5);\n vtkProperty* prop = Actor5->GetProperty();\n prop->SetRepresentationToSurface();\n prop->SetInterpolationToGouraud();\n prop->SetAmbient(0.15);\n prop->SetDiffuse(0.85);\n prop->SetSpecular(0.1);\n prop->SetSpecularPower(100);\n prop->SetSpecularColor(1, 1, 1);\n prop->SetColor(1, 1, 1);\n\n ren->AddActor(Actor5);\n\n vtkLineSource* LineSourceWidget0 = vtkLineSource::New();\n LineSourceWidget0->SetPoint1(13.9548, -0.47371, 31.7642);\n LineSourceWidget0->SetPoint2(6.3766, -0.5886, 26.6274);\n LineSourceWidget0->SetResolution(20);\n\n vtkDistributedStreamTracer* Stream0 = vtkDistributedStreamTracer::New();; \n Stream0->SetInput(Plot3D0->GetOutput());\n Stream0->SelectInputVectors(\"Momentum\");\n Stream0->SetSource(LineSourceWidget0->GetOutput());\n Stream0->SetMaximumPropagationUnit(0);\n Stream0->SetMaximumPropagation(0.05);\n Stream0->SetInitialIntegrationStepUnit(2);\n Stream0->SetInitialIntegrationStep(0.5);\n Stream0->SetIntegrationDirection(2);\n Stream0->SetIntegratorType(0);\n Stream0->SetMaximumNumberOfSteps(2000);\n Stream0->SetTerminalSpeed(1e-12);\n\n vtkPVGeometryFilter* Geometry6 = vtkPVGeometryFilter::New();;\n Geometry6->SetInput(Stream0->GetOutput());\n\n vtkLookupTable* LookupTable1 = vtkLookupTable::New();\n LookupTable1->SetNumberOfTableValues(256);\n LookupTable1->SetHueRange(0, 0.66667);\n LookupTable1->SetSaturationRange(1, 1);\n LookupTable1->SetValueRange(1, 1);\n LookupTable1->SetTableRange(0.197813, 0.710419);\n LookupTable1->SetVectorComponent(0);\n LookupTable1->Build();\n\n vtkPolyDataMapper* Mapper6 = vtkPolyDataMapper::New();\n Mapper6->SetInput(Geometry6->GetOutput());\n Mapper6->SetImmediateModeRendering(1);\n Mapper6->UseLookupTableScalarRangeOn();\n Mapper6->SetScalarVisibility(1);\n Mapper6->SetScalarModeToUsePointFieldData();\n Mapper6->SelectColorArray(\"Density\");\n Mapper6->SetLookupTable(LookupTable1);\n\n vtkActor* Actor6 = vtkActor::New();\n Actor6->SetMapper(Mapper6);\n prop = Actor6->GetProperty();\n prop->SetRepresentationToSurface();\n prop->SetInterpolationToGouraud();\n prop->SetAmbient(0.15);\n prop->SetDiffuse(0.85);\n prop->SetSpecular(0);\n prop->SetSpecularPower(1);\n prop->SetSpecularColor(1, 1, 1);\n\n ren->AddActor(Actor6);\n\n vtkRenderWindowInteractor *iren = vtkRenderWindowInteractor::New();\n iren->SetRenderWindow(renWin);\n\n vtkCompositeManager* compManager = vtkCompositeManager::New();\n compManager->SetRenderWindow(renWin);\n compManager->InitializePieces();\n \n if (myId)\n {\n compManager->InitializeRMIs();\n controller->ProcessRMIs();\n controller->Receive(args->retVal, 1, 0, 33);\n }\n else\n {\n renWin->Render();\n *(args->retVal) = \n vtkRegressionTester::Test(args->argc, args->argv, renWin, 10);\n for (int i = 1; i < numProcs; i++)\n {\n controller->TriggerRMI(i, vtkMultiProcessController::BREAK_RMI_TAG);\n controller->Send(args->retVal, 1, i, 33);\n }\n }\n\n if ( *(args->retVal) == vtkRegressionTester::DO_INTERACTOR)\n {\n compManager->StartInteractor();\n }\n renWin->Delete();\n ren->Delete();\n iren->Delete();\n compManager->Delete();\n Plot3D0->Delete();\n Stream0->Delete();\n LookupTable1->Delete();\n LineSourceWidget0->Delete();\n Geometry5->Delete();\n Geometry6->Delete();\n Actor5->Delete();\n Actor6->Delete();\n Mapper5->Delete();\n Mapper6->Delete();\n}\n\nint main( int argc, char* argv[] )\n{\n vtkDebugLeaks::PromptUserOff();\n\n vtkMultiProcessController* contr = vtkMultiProcessController::New();\n contr->Initialize(&argc, &argv);\n contr->CreateOutputWindow();\n\n vtkParallelFactory* pf = vtkParallelFactory::New();\n vtkObjectFactory::RegisterFactory(pf);\n pf->Delete();\n\n \/\/ This is repeated for the sake of MPI. This one might not\n \/\/ get called by the parent process, the first one might not\n \/\/ get called by all others.\n vtkDebugLeaks::PromptUserOff();\n\n \/\/ When using MPI, the number of processes is determined\n \/\/ by the external program which launches this application.\n \/\/ However, when using threads, we need to set it ourselves.\n if (contr->IsA(\"vtkThreadedController\"))\n {\n \/\/ Set the number of processes to 2 for this example.\n contr->SetNumberOfProcesses(2);\n } \n\n \/\/ Added for regression test.\n \/\/ ----------------------------------------------\n int retVal;\n PStreamArgs_tmp args;\n args.retVal = &retVal;\n args.argc = argc;\n args.argv = argv;\n \/\/ ----------------------------------------------\n\n contr->SetSingleMethod(MyMain, &args);\n contr->SingleMethodExecute();\n\n contr->Finalize();\n contr->Delete();\n\n return !retVal;\n}\n\n\n\n\n\n<commit_msg>Removed dependency on PVGeometryFilter<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: TestPStream.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkActor.h\"\n#include \"vtkCamera.h\"\n#include \"vtkCompositeManager.h\"\n#include \"vtkDebugLeaks.h\"\n#include \"vtkDistributedStreamTracer.h\"\n#include \"vtkLineSource.h\"\n#include \"vtkLookupTable.h\"\n#include \"vtkMultiProcessController.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPLOT3DReader.h\"\n#include \"vtkGeometryFilter.h\"\n#include \"vtkParallelFactory.h\"\n#include \"vtkPolyData.h\"\n#include \"vtkPolyDataMapper.h\"\n#include \"vtkProperty.h\"\n#include \"vtkRegressionTestImage.h\"\n#include \"vtkRenderWindow.h\"\n#include \"vtkRenderWindowInteractor.h\"\n#include \"vtkRenderer.h\"\n#include \"vtkStructuredGrid.h\"\n#include \"vtkStructuredGridOutlineFilter.h\"\n\nstruct PStreamArgs_tmp\n{\n int* retVal;\n int argc;\n char** argv;\n};\n\n\/\/ This will be called by all processes\nvoid MyMain( vtkMultiProcessController *controller, void *arg )\n{\n\n PStreamArgs_tmp* args = \n reinterpret_cast<PStreamArgs_tmp*>(arg);\n\n int myId = controller->GetLocalProcessId();\n int numProcs = controller->GetNumberOfProcesses();\n\n vtkRenderer* ren = vtkRenderer::New();\n ren->SetBackground(0.33, 0.35, 0.43);\n\n vtkRenderWindow* renWin = vtkRenderWindow::New();\n renWin->AddRenderer(ren);\n renWin->SetSize(400, 300);\n renWin->SetPosition(410*myId, 0);\n\n \/\/camera parameters\n vtkCamera* camera = ren->GetActiveCamera();\n camera->SetPosition(-5.86786, 49.2857, 51.597);\n camera->SetFocalPoint(8.255, -3.17482e-16, 29.7631);\n camera->SetViewUp(-0.112182, -0.42918, 0.896225);\n camera->SetViewAngle(30);\n camera->SetClippingRange(10.0, 80.6592);\n camera->Dolly(1.5);\n \n \/\/ Create the reader, the data file name might have\n \/\/ to be changed depending on where the data files are.\n char* fname1 = vtkTestUtilities::ExpandDataFileName(args->argc, args->argv, \n \"Data\/combxyz.bin\");\n char* fname2 = vtkTestUtilities::ExpandDataFileName(args->argc, args->argv, \n \"Data\/combq.bin\");\n vtkPLOT3DReader* Plot3D0 = vtkPLOT3DReader::New();\n Plot3D0->SetFileName(fname1);\n Plot3D0->SetQFileName (fname2);\n Plot3D0->SetBinaryFile(1);\n Plot3D0->SetMultiGrid(0);\n Plot3D0->SetHasByteCount(0);\n Plot3D0->SetIBlanking(0);\n Plot3D0->SetTwoDimensionalGeometry(0);\n Plot3D0->SetForceRead(0);\n Plot3D0->SetByteOrder(0);\n delete[] fname1;\n delete[] fname2;\n\n vtkStructuredGridOutlineFilter* Geometry5 = \n vtkStructuredGridOutlineFilter::New();\n Geometry5->SetInput(Plot3D0->GetOutput());\n \n vtkPolyDataMapper* Mapper5 = vtkPolyDataMapper::New();\n Mapper5->SetInput(Geometry5->GetOutput());\n Mapper5->SetImmediateModeRendering(1);\n Mapper5->UseLookupTableScalarRangeOn();\n Mapper5->SetScalarVisibility(0);\n Mapper5->SetScalarModeToDefault();\n\n vtkActor* Actor5 = vtkActor::New();\n Actor5->SetMapper(Mapper5);\n vtkProperty* prop = Actor5->GetProperty();\n prop->SetRepresentationToSurface();\n prop->SetInterpolationToGouraud();\n prop->SetAmbient(0.15);\n prop->SetDiffuse(0.85);\n prop->SetSpecular(0.1);\n prop->SetSpecularPower(100);\n prop->SetSpecularColor(1, 1, 1);\n prop->SetColor(1, 1, 1);\n\n ren->AddActor(Actor5);\n\n vtkLineSource* LineSourceWidget0 = vtkLineSource::New();\n LineSourceWidget0->SetPoint1(13.9548, -0.47371, 31.7642);\n LineSourceWidget0->SetPoint2(6.3766, -0.5886, 26.6274);\n LineSourceWidget0->SetResolution(20);\n\n vtkDistributedStreamTracer* Stream0 = vtkDistributedStreamTracer::New();; \n Stream0->SetInput(Plot3D0->GetOutput());\n Stream0->SelectInputVectors(\"Momentum\");\n Stream0->SetSource(LineSourceWidget0->GetOutput());\n Stream0->SetMaximumPropagationUnit(0);\n Stream0->SetMaximumPropagation(0.05);\n Stream0->SetInitialIntegrationStepUnit(2);\n Stream0->SetInitialIntegrationStep(0.5);\n Stream0->SetIntegrationDirection(2);\n Stream0->SetIntegratorType(0);\n Stream0->SetMaximumNumberOfSteps(2000);\n Stream0->SetTerminalSpeed(1e-12);\n\n vtkGeometryFilter* Geometry6 = vtkGeometryFilter::New();;\n Geometry6->SetInput(Stream0->GetOutput());\n\n vtkLookupTable* LookupTable1 = vtkLookupTable::New();\n LookupTable1->SetNumberOfTableValues(256);\n LookupTable1->SetHueRange(0, 0.66667);\n LookupTable1->SetSaturationRange(1, 1);\n LookupTable1->SetValueRange(1, 1);\n LookupTable1->SetTableRange(0.197813, 0.710419);\n LookupTable1->SetVectorComponent(0);\n LookupTable1->Build();\n\n vtkPolyDataMapper* Mapper6 = vtkPolyDataMapper::New();\n Mapper6->SetInput(Geometry6->GetOutput());\n Mapper6->SetImmediateModeRendering(1);\n Mapper6->UseLookupTableScalarRangeOn();\n Mapper6->SetScalarVisibility(1);\n Mapper6->SetScalarModeToUsePointFieldData();\n Mapper6->SelectColorArray(\"Density\");\n Mapper6->SetLookupTable(LookupTable1);\n\n vtkActor* Actor6 = vtkActor::New();\n Actor6->SetMapper(Mapper6);\n prop = Actor6->GetProperty();\n prop->SetRepresentationToSurface();\n prop->SetInterpolationToGouraud();\n prop->SetAmbient(0.15);\n prop->SetDiffuse(0.85);\n prop->SetSpecular(0);\n prop->SetSpecularPower(1);\n prop->SetSpecularColor(1, 1, 1);\n\n ren->AddActor(Actor6);\n\n vtkRenderWindowInteractor *iren = vtkRenderWindowInteractor::New();\n iren->SetRenderWindow(renWin);\n\n vtkCompositeManager* compManager = vtkCompositeManager::New();\n compManager->SetRenderWindow(renWin);\n compManager->InitializePieces();\n \n if (myId)\n {\n compManager->InitializeRMIs();\n controller->ProcessRMIs();\n controller->Receive(args->retVal, 1, 0, 33);\n }\n else\n {\n renWin->Render();\n *(args->retVal) = \n vtkRegressionTester::Test(args->argc, args->argv, renWin, 10);\n for (int i = 1; i < numProcs; i++)\n {\n controller->TriggerRMI(i, vtkMultiProcessController::BREAK_RMI_TAG);\n controller->Send(args->retVal, 1, i, 33);\n }\n }\n\n if ( *(args->retVal) == vtkRegressionTester::DO_INTERACTOR)\n {\n compManager->StartInteractor();\n }\n renWin->Delete();\n ren->Delete();\n iren->Delete();\n compManager->Delete();\n Plot3D0->Delete();\n Stream0->Delete();\n LookupTable1->Delete();\n LineSourceWidget0->Delete();\n Geometry5->Delete();\n Geometry6->Delete();\n Actor5->Delete();\n Actor6->Delete();\n Mapper5->Delete();\n Mapper6->Delete();\n}\n\nint main( int argc, char* argv[] )\n{\n vtkDebugLeaks::PromptUserOff();\n\n vtkMultiProcessController* contr = vtkMultiProcessController::New();\n contr->Initialize(&argc, &argv);\n contr->CreateOutputWindow();\n\n vtkParallelFactory* pf = vtkParallelFactory::New();\n vtkObjectFactory::RegisterFactory(pf);\n pf->Delete();\n\n \/\/ This is repeated for the sake of MPI. This one might not\n \/\/ get called by the parent process, the first one might not\n \/\/ get called by all others.\n vtkDebugLeaks::PromptUserOff();\n\n \/\/ When using MPI, the number of processes is determined\n \/\/ by the external program which launches this application.\n \/\/ However, when using threads, we need to set it ourselves.\n if (contr->IsA(\"vtkThreadedController\"))\n {\n \/\/ Set the number of processes to 2 for this example.\n contr->SetNumberOfProcesses(2);\n } \n\n \/\/ Added for regression test.\n \/\/ ----------------------------------------------\n int retVal;\n PStreamArgs_tmp args;\n args.retVal = &retVal;\n args.argc = argc;\n args.argv = argv;\n \/\/ ----------------------------------------------\n\n contr->SetSingleMethod(MyMain, &args);\n contr->SingleMethodExecute();\n\n contr->Finalize();\n contr->Delete();\n\n return !retVal;\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/***************************************************************************\nfbellini@cern.ch - created on 25\/08\/2017\nConfiguration script for f0(980) analysis\n****************************************************************************\/\n#ifdef __CLING__\nR__ADD_INCLUDE_PATH($ALICE_PHYSICS)\n#include <PWGLF\/RESONANCES\/macros\/mini\/AddMonitorOutput.C>\n#endif\n\nBool_t ConfigF0(AliRsnMiniAnalysisTask *task, \n\t\tBool_t isMC, \n\t\tAliPIDResponse::EBeamType collSys = AliPIDResponse::kPP, \/\/=0, kPPB=1, kPBPB=2\n\t\tAliRsnCutSet *cutsPair, \/\/cuts on the pair\n\t\tBool_t enaMultSel = kTRUE, \/\/enable multiplicity axis\n \t\tFloat_t masslow = 0.3, \/\/inv mass axis low edge \n\t\tFloat_t massup = 1.3, \/\/inv mass axis upper edge \n\t\tInt_t nbins = 1000, \/\/inv mass axis n bins\n\t\tInt_t aodFilterBit = 5, \/\/filter bit for AOD analysis\n\t\tAliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutPid = AliRsnCutSetDaughterParticle::kTPCpidTOFveto3s, \/\/ pid cut set\n\t\tFloat_t nsigma = 3.0, \/\/nsigma of TPC PID cut\n\t\tBool_t enableMonitor = kTRUE) \/\/enable single track QA plots\n{\n \/\/-----------------------\n \/\/General \n \/\/-----------------------\n TString partname=\"f0\";\n Int_t pdgCode=9010221;\n Float_t mass = 0.990;\/\/ 2014 PDG: M = 0.990 ± 20 GeV\n RSNPID d1 = AliRsnDaughter::kPion;\n RSNPID d2 = AliRsnDaughter::kPion;\n\n \/\/Additional options for monitoring plots\n TString monitorOpt = \"NoSIGN\";\n \n \/\/-----------------------\n \/\/ CUTS\n \/\/-----------------------\n \/\/use default quality cuts std 2010 with crossed rows TPC\n Bool_t useCrossedRows = 1; \n AliRsnCutSetDaughterParticle * cutSetPi = new AliRsnCutSetDaughterParticle(\"cutPi\", cutPid, AliPID::kPion, nsigma, aodFilterBit, useCrossedRows);\n cutSetPi->SetUse2011StdQualityCuts(kTRUE);\n Int_t icutPi = task->AddTrackCuts(cutSetPi);\n\n \/\/set daughter cuts\n Int_t icut1 = icutPi;\n Int_t icut2 = icutPi;\n\n \/\/monitor single-track selection based on track quality cuts only\n AliRsnCutSetDaughterParticle * cutSetQuality = new AliRsnCutSetDaughterParticle(\"cutQuality\", AliRsnCutSetDaughterParticle::kQualityStd2011, AliPID::kPion, 10.0, aodFilterBit, useCrossedRows);\n Int_t icutQuality = task->AddTrackCuts(cutSetQuality);\n \n \/\/QA plots \n if (enableMonitor){\n Printf(\"======== Cut monitoring enabled\");\n#ifdef __CINT__\n gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/AddMonitorOutput.C\");\n#endif\n AddMonitorOutput(isMC, cutSetQuality->GetMonitorOutput(), monitorOpt.Data());\n AddMonitorOutput(isMC, cutSetPi->GetMonitorOutput(), monitorOpt.Data());\n } \n\n \/\/-----------------------\n \/\/ OUTPUT\n \/\/-----------------------\n \/* invariant mass *\/ Int_t imID = task->CreateValue(AliRsnMiniValue::kInvMass, kFALSE);\n \/* IM resolution *\/ Int_t resID = task->CreateValue(AliRsnMiniValue::kInvMassRes, kTRUE);\n \/* transv. momentum *\/ Int_t ptID = task->CreateValue(AliRsnMiniValue::kPt, kFALSE);\n \/* centrality *\/ Int_t multID = task->CreateValue(AliRsnMiniValue::kMult, kFALSE);\n \/* pseudorapidity *\/ Int_t etaID = task->CreateValue(AliRsnMiniValue::kEta, kFALSE);\n \/* rapidity *\/ Int_t yID = task->CreateValue(AliRsnMiniValue::kY, kFALSE);\n \/* 1st daughter pt *\/ Int_t fdpt = task->CreateValue(AliRsnMiniValue::kFirstDaughterPt, kFALSE);\n \/* 2nd daughter pt *\/ Int_t sdpt = task->CreateValue(AliRsnMiniValue::kSecondDaughterPt, kFALSE);\n \/* 1st daughter p *\/ Int_t fdp = task->CreateValue(AliRsnMiniValue::kFirstDaughterP, kFALSE);\n \/* 2nd daughter p *\/ Int_t sdp = task->CreateValue(AliRsnMiniValue::kSecondDaughterP, kFALSE);\n TString output = \"HIST\"; \/\/ or \"SPARSE\"\n TString name[6] = {\"UnlikePM\", \"MixingPM\", \"LikePP\", \"LikeMM\", \"MixingPP\", \"MixingMM\"};\n TString comp[6] = {\"PAIR\" , \"MIX\", \"PAIR\" , \"PAIR\" , \"MIX\" , \"MIX\" };\n Char_t charge1[6] = {'+', '+', '+', '-', '+', '-'};\n Char_t charge2[6] = {'-', '-', '+', '-', '+', '-'};\n\n \/\/DATA \n for (Int_t i = 0; i < 6; i++) {\n AliRsnMiniOutput *out = task->CreateOutput(Form(\"f0_%s\", name[i].Data()), output.Data(), comp[i].Data());\n out->SetCutID(0, icut1);\n out->SetCutID(1, icut2);\n out->SetDaughter(0, d1);\n out->SetDaughter(1, d2);\n out->SetCharge(0, charge1[i]);\n out->SetCharge(1, charge2[i]);\n out->SetMotherPDG(pdgCode);\n out->SetMotherMass(mass);\n out->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n out->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n out->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/axis Z: multiplicity\n if (enaMultSel) out->AddAxis(multID, 100, 0.0, 100.0);\n }\n \n\n \/\/Template for BG\n TString bgTemplate[7] = {\"rho\", \"omega\", \"Kstar\", \"antiKstar\", \"K0s\", \"phi\",\"f2\"};\n Char_t bgTemplateC1[7] = {'+', '+', '+', '+', '+', '+', '+'};\n Char_t bgTemplateC2[7] = {'-', '-', '-', '-', '-', '-', '-'};\n Int_t bgTemplatePDG[7] = {113, 223, 313, -313, 310, 333, 225};\n Int_t bgTemplateM[7] = {775.26, 8.49, 891.66, 891.66, 497.611, 1019.461, 1275.5};\n RSNPID bgID1[7] = {AliRsnDaughter::kPion, AliRsnDaughter::kPion,AliRsnDaughter::kKaon, AliRsnDaughter::kPion, AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion};\n RSNPID bgID2[7] = {AliRsnDaughter::kPion, AliRsnDaughter::kPion,AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion};\n\n if (isMC) {\n \/\/TRUE RECO PAIRS - TEMPLATE FOR BG\n for (Int_t ibg = 0; ibg <7; ibg++) {\n AliRsnMiniOutput * outtempl = task->CreateOutput(Form(\"bg_%s\", bgTemplate[ibg].Data()), output.Data(),\"TRUE\");\n outtempl->SetCutID(0, icut1);\n outtempl->SetCutID(1, icut2);\n outtempl->SetCharge(0, bgTemplateC1[0]);\n outtempl->SetCharge(1, bgTemplateC2[0]);\n outtempl->SetDaughter(0, bgID1[ibg]);\n outtempl->SetDaughter(1, bgID2[ibg]);\n outtempl->SetMotherPDG(bgTemplatePDG[ibg]);\n outtempl->SetMotherMass(bgTemplateM[ibg]);\n outtempl->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n outtempl->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n outtempl->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/ axis Z: multrality-multiplicity\n if (enaMultSel) outtempl->AddAxis(multID, 100, 0.0, 100.0);\n }\n \/\/TRUE RECO PAIRS - MASS\n AliRsnMiniOutput * outtrue = task->CreateOutput(Form(\"truef0_%s\", partname.Data()), output.Data(),\"TRUE\");\n outtrue->SetCutID(0, icut1);\n outtrue->SetCutID(1, icut2);\n outtrue->SetCharge(0, charge1[0]);\n outtrue->SetCharge(1, charge2[0]);\n outtrue->SetDaughter(0, d1);\n outtrue->SetDaughter(1, d2);\n outtrue->SetMotherPDG(pdgCode);\n outtrue->SetMotherMass(mass);\n outtrue->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n outtrue->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n outtrue->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/ axis Z: multiplicity\n if (enaMultSel) outtrue->AddAxis(multID, 100, 0.0, 100.0);\n\n \n \/\/TRUE RECO PAIRS - MASS RESOLUTION\n AliRsnMiniOutput * outres = task->CreateOutput(Form(\"Mres_%s\", partname.Data()), output.Data(),\"TRUE\");\n outres->SetCutID(0, icut1);\n outres->SetCutID(1, icut2);\n outres->SetCharge(0, charge1[0]);\n outres->SetCharge(1, charge2[0]);\n outres->SetDaughter(0, d1);\n outres->SetDaughter(1, d2);\n outres->SetMotherPDG(pdgCode);\n outres->SetMotherMass(mass);\n outres->SetPairCuts(cutsPair);\n \/\/ axis X: invmass resolution\n outres->AddAxis(resID, 200, -0.01, 0.01);\n \/\/axis Y: mother pt\n outres->AddAxis(ptID, 200, 0.0, 20.0);\n \/\/ axis Z: multiplicity\n if (enaMultSel) outres->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/TRUE RECO PAIRS - rapidity\n AliRsnMiniOutput * outrap = task->CreateOutput(Form(\"trueRap_%s\", partname.Data()), output.Data(),\"TRUE\");\n outrap->SetCutID(0, icut1);\n outrap->SetCutID(1, icut2);\n outrap->SetCharge(0, charge1[0]);\n outrap->SetCharge(1, charge2[0]);\n outrap->SetDaughter(0, d1);\n outrap->SetDaughter(1, d2);\n outrap->SetMotherPDG(pdgCode);\n outrap->SetMotherMass(mass);\n outrap->SetPairCuts(cutsPair);\n outrap->AddAxis(ptID, 160, 0.0, 16.0);\n outrap->AddAxis(yID, 120, -0.6, 0.6);\n outrap->AddAxis(etaID, 200, -1., 1.);\n\n \n \/\/GENERATED PAIRS\n AliRsnMiniOutput * outm = task->CreateOutput(Form(\"motherf0_%s\", partname.Data()), output.Data(),\"MOTHER\");\n outm->SetDaughter(0, d1);\n outm->SetDaughter(1, d2);\n outm->SetMotherPDG(pdgCode);\n outm->SetMotherMass(mass);\n outm->SetPairCuts(cutsPair);\n outm->AddAxis(imID, nbins, masslow, massup);\n outm->AddAxis(ptID, 200, 0.0, 20.0);\n if (enaMultSel) outm->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/GENERATED PAIRS\n AliRsnMiniOutput * outmy = task->CreateOutput(Form(\"motherRap_%s\", partname.Data()), output.Data(),\"MOTHER\");\n outmy->SetDaughter(0, d1);\n outmy->SetDaughter(1, d2);\n outmy->SetMotherPDG(pdgCode);\n outmy->SetMotherMass(mass);\n outmy->SetPairCuts(cutsPair);\n outmy->AddAxis(ptID, 160, 0.0, 16.0);\n outmy->AddAxis(yID, 120, -0.6, 0.6);\n outmy->AddAxis(etaID, 200, -1., 1.);\n\n \/\/f2 GENERATED PAIRS\n AliRsnMiniOutput * outm2 = task->CreateOutput(\"motherf2\", output.Data(),\"MOTHER\");\n outm2->SetDaughter(0, d1);\n outm2->SetDaughter(1, d2);\n outm2->SetMotherPDG(bgTemplatePDG[6]);\n outm2->SetMotherMass(bgTemplateM[6]);\n outm2->SetPairCuts(cutsPair);\n outm2->AddAxis(imID, nbins, masslow, massup);\n outm2->AddAxis(ptID, 200, 0.0, 20.0);\n if (enaMultSel) outm2->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/f2 GENERATED PAIRS\n AliRsnMiniOutput * outmy2 = task->CreateOutput(\"motherf2Rap\", output.Data(),\"MOTHER\");\n outmy2->SetDaughter(0, d1);\n outmy2->SetDaughter(1, d2);\n outmy2->SetMotherPDG(bgTemplatePDG[6]);\n outmy2->SetMotherMass(bgTemplateM[6]);\n outmy2->SetPairCuts(cutsPair);\n outmy2->AddAxis(ptID, 160, 0.0, 16.0);\n outmy2->AddAxis(yID, 120, -0.6, 0.6);\n outmy2->AddAxis(etaID, 200, -1., 1.);\n }\n\n return kTRUE;\n}\n<commit_msg>Fixed array type<commit_after>\/***************************************************************************\nfbellini@cern.ch - created on 25\/08\/2017\nConfiguration script for f0(980) analysis\n****************************************************************************\/\n#ifdef __CLING__\nR__ADD_INCLUDE_PATH($ALICE_PHYSICS)\n#include <PWGLF\/RESONANCES\/macros\/mini\/AddMonitorOutput.C>\n#endif\n\nBool_t ConfigF0(AliRsnMiniAnalysisTask *task, \n\t\tBool_t isMC, \n\t\tAliPIDResponse::EBeamType collSys = AliPIDResponse::kPP, \/\/=0, kPPB=1, kPBPB=2\n\t\tAliRsnCutSet *cutsPair, \/\/cuts on the pair\n\t\tBool_t enaMultSel = kTRUE, \/\/enable multiplicity axis\n \t\tFloat_t masslow = 0.3, \/\/inv mass axis low edge \n\t\tFloat_t massup = 1.3, \/\/inv mass axis upper edge \n\t\tInt_t nbins = 1000, \/\/inv mass axis n bins\n\t\tInt_t aodFilterBit = 5, \/\/filter bit for AOD analysis\n\t\tAliRsnCutSetDaughterParticle::ERsnDaughterCutSet cutPid = AliRsnCutSetDaughterParticle::kTPCpidTOFveto3s, \/\/ pid cut set\n\t\tFloat_t nsigma = 3.0, \/\/nsigma of TPC PID cut\n\t\tBool_t enableMonitor = kTRUE) \/\/enable single track QA plots\n{\n \/\/-----------------------\n \/\/General \n \/\/-----------------------\n TString partname=\"f0\";\n Int_t pdgCode=9010221;\n Float_t mass = 0.990;\/\/ 2014 PDG: M = 0.990 ± 20 GeV\n RSNPID d1 = AliRsnDaughter::kPion;\n RSNPID d2 = AliRsnDaughter::kPion;\n\n \/\/Additional options for monitoring plots\n TString monitorOpt = \"NoSIGN\";\n \n \/\/-----------------------\n \/\/ CUTS\n \/\/-----------------------\n \/\/use default quality cuts std 2010 with crossed rows TPC\n Bool_t useCrossedRows = 1; \n AliRsnCutSetDaughterParticle * cutSetPi = new AliRsnCutSetDaughterParticle(\"cutPi\", cutPid, AliPID::kPion, nsigma, aodFilterBit, useCrossedRows);\n cutSetPi->SetUse2011StdQualityCuts(kTRUE);\n Int_t icutPi = task->AddTrackCuts(cutSetPi);\n\n \/\/set daughter cuts\n Int_t icut1 = icutPi;\n Int_t icut2 = icutPi;\n\n \/\/monitor single-track selection based on track quality cuts only\n AliRsnCutSetDaughterParticle * cutSetQuality = new AliRsnCutSetDaughterParticle(\"cutQuality\", AliRsnCutSetDaughterParticle::kQualityStd2011, AliPID::kPion, 10.0, aodFilterBit, useCrossedRows);\n Int_t icutQuality = task->AddTrackCuts(cutSetQuality);\n \n \/\/QA plots \n if (enableMonitor){\n Printf(\"======== Cut monitoring enabled\");\n#ifdef __CINT__\n gROOT->LoadMacro(\"$ALICE_PHYSICS\/PWGLF\/RESONANCES\/macros\/mini\/AddMonitorOutput.C\");\n#endif\n AddMonitorOutput(isMC, cutSetQuality->GetMonitorOutput(), monitorOpt.Data(), 0);\n AddMonitorOutput(isMC, cutSetPi->GetMonitorOutput(), monitorOpt.Data(), 0);\n } \n\n \/\/-----------------------\n \/\/ OUTPUT\n \/\/-----------------------\n \/* invariant mass *\/ Int_t imID = task->CreateValue(AliRsnMiniValue::kInvMass, kFALSE);\n \/* IM resolution *\/ Int_t resID = task->CreateValue(AliRsnMiniValue::kInvMassRes, kTRUE);\n \/* transv. momentum *\/ Int_t ptID = task->CreateValue(AliRsnMiniValue::kPt, kFALSE);\n \/* centrality *\/ Int_t multID = task->CreateValue(AliRsnMiniValue::kMult, kFALSE);\n \/* pseudorapidity *\/ Int_t etaID = task->CreateValue(AliRsnMiniValue::kEta, kFALSE);\n \/* rapidity *\/ Int_t yID = task->CreateValue(AliRsnMiniValue::kY, kFALSE);\n \/* 1st daughter pt *\/ Int_t fdpt = task->CreateValue(AliRsnMiniValue::kFirstDaughterPt, kFALSE);\n \/* 2nd daughter pt *\/ Int_t sdpt = task->CreateValue(AliRsnMiniValue::kSecondDaughterPt, kFALSE);\n \/* 1st daughter p *\/ Int_t fdp = task->CreateValue(AliRsnMiniValue::kFirstDaughterP, kFALSE);\n \/* 2nd daughter p *\/ Int_t sdp = task->CreateValue(AliRsnMiniValue::kSecondDaughterP, kFALSE);\n TString output = \"HIST\"; \/\/ or \"SPARSE\"\n TString name[6] = {\"UnlikePM\", \"MixingPM\", \"LikePP\", \"LikeMM\", \"MixingPP\", \"MixingMM\"};\n TString comp[6] = {\"PAIR\" , \"MIX\", \"PAIR\" , \"PAIR\" , \"MIX\" , \"MIX\" };\n Char_t charge1[6] = {'+', '+', '+', '-', '+', '-'};\n Char_t charge2[6] = {'-', '-', '+', '-', '+', '-'};\n\n \/\/DATA \n for (Int_t i = 0; i < 6; i++) {\n AliRsnMiniOutput *out = task->CreateOutput(Form(\"f0_%s\", name[i].Data()), output.Data(), comp[i].Data());\n out->SetCutID(0, icut1);\n out->SetCutID(1, icut2);\n out->SetDaughter(0, d1);\n out->SetDaughter(1, d2);\n out->SetCharge(0, charge1[i]);\n out->SetCharge(1, charge2[i]);\n out->SetMotherPDG(pdgCode);\n out->SetMotherMass(mass);\n out->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n out->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n out->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/axis Z: multiplicity\n if (enaMultSel) out->AddAxis(multID, 100, 0.0, 100.0);\n }\n \n\n \/\/Template for BG\n TString bgTemplate[7] = {\"rho\", \"omega\", \"Kstar\", \"antiKstar\", \"K0s\", \"phi\",\"f2\"};\n Char_t bgTemplateC1[7] = {'+', '+', '+', '+', '+', '+', '+'};\n Char_t bgTemplateC2[7] = {'-', '-', '-', '-', '-', '-', '-'};\n Int_t bgTemplatePDG[7] = {113, 223, 313, -313, 310, 333, 225};\n Double_t bgTemplateM[7] = {775.26, 8.49, 891.66, 891.66, 497.611, 1019.461, 1275.5};\n RSNPID bgID1[7] = {AliRsnDaughter::kPion, AliRsnDaughter::kPion,AliRsnDaughter::kKaon, AliRsnDaughter::kPion, AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion};\n RSNPID bgID2[7] = {AliRsnDaughter::kPion, AliRsnDaughter::kPion,AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion, AliRsnDaughter::kKaon, AliRsnDaughter::kPion};\n\n if (isMC) {\n \/\/TRUE RECO PAIRS - TEMPLATE FOR BG\n for (Int_t ibg = 0; ibg <7; ibg++) {\n AliRsnMiniOutput * outtempl = task->CreateOutput(Form(\"bg_%s\", bgTemplate[ibg].Data()), output.Data(),\"TRUE\");\n outtempl->SetCutID(0, icut1);\n outtempl->SetCutID(1, icut2);\n outtempl->SetCharge(0, bgTemplateC1[0]);\n outtempl->SetCharge(1, bgTemplateC2[0]);\n outtempl->SetDaughter(0, bgID1[ibg]);\n outtempl->SetDaughter(1, bgID2[ibg]);\n outtempl->SetMotherPDG(bgTemplatePDG[ibg]);\n outtempl->SetMotherMass(bgTemplateM[ibg]);\n outtempl->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n outtempl->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n outtempl->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/ axis Z: multrality-multiplicity\n if (enaMultSel) outtempl->AddAxis(multID, 100, 0.0, 100.0);\n }\n \/\/TRUE RECO PAIRS - MASS\n AliRsnMiniOutput * outtrue = task->CreateOutput(Form(\"truef0_%s\", partname.Data()), output.Data(),\"TRUE\");\n outtrue->SetCutID(0, icut1);\n outtrue->SetCutID(1, icut2);\n outtrue->SetCharge(0, charge1[0]);\n outtrue->SetCharge(1, charge2[0]);\n outtrue->SetDaughter(0, d1);\n outtrue->SetDaughter(1, d2);\n outtrue->SetMotherPDG(pdgCode);\n outtrue->SetMotherMass(mass);\n outtrue->SetPairCuts(cutsPair);\n \/\/ axis X: invmass \n outtrue->AddAxis(imID, nbins, masslow, massup);\n \/\/axis Y: mother pt\n outtrue->AddAxis(ptID, 200, 0.0, 20.0); \/\/default use mother pt\n \/\/ axis Z: multiplicity\n if (enaMultSel) outtrue->AddAxis(multID, 100, 0.0, 100.0);\n\n \n \/\/TRUE RECO PAIRS - MASS RESOLUTION\n AliRsnMiniOutput * outres = task->CreateOutput(Form(\"Mres_%s\", partname.Data()), output.Data(),\"TRUE\");\n outres->SetCutID(0, icut1);\n outres->SetCutID(1, icut2);\n outres->SetCharge(0, charge1[0]);\n outres->SetCharge(1, charge2[0]);\n outres->SetDaughter(0, d1);\n outres->SetDaughter(1, d2);\n outres->SetMotherPDG(pdgCode);\n outres->SetMotherMass(mass);\n outres->SetPairCuts(cutsPair);\n \/\/ axis X: invmass resolution\n outres->AddAxis(resID, 200, -0.01, 0.01);\n \/\/axis Y: mother pt\n outres->AddAxis(ptID, 200, 0.0, 20.0);\n \/\/ axis Z: multiplicity\n if (enaMultSel) outres->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/TRUE RECO PAIRS - rapidity\n AliRsnMiniOutput * outrap = task->CreateOutput(Form(\"trueRap_%s\", partname.Data()), output.Data(),\"TRUE\");\n outrap->SetCutID(0, icut1);\n outrap->SetCutID(1, icut2);\n outrap->SetCharge(0, charge1[0]);\n outrap->SetCharge(1, charge2[0]);\n outrap->SetDaughter(0, d1);\n outrap->SetDaughter(1, d2);\n outrap->SetMotherPDG(pdgCode);\n outrap->SetMotherMass(mass);\n outrap->SetPairCuts(cutsPair);\n outrap->AddAxis(ptID, 160, 0.0, 16.0);\n outrap->AddAxis(yID, 120, -0.6, 0.6);\n outrap->AddAxis(etaID, 200, -1., 1.);\n\n \n \/\/GENERATED PAIRS\n AliRsnMiniOutput * outm = task->CreateOutput(Form(\"motherf0_%s\", partname.Data()), output.Data(),\"MOTHER\");\n outm->SetDaughter(0, d1);\n outm->SetDaughter(1, d2);\n outm->SetMotherPDG(pdgCode);\n outm->SetMotherMass(mass);\n outm->SetPairCuts(cutsPair);\n outm->AddAxis(imID, nbins, masslow, massup);\n outm->AddAxis(ptID, 200, 0.0, 20.0);\n if (enaMultSel) outm->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/GENERATED PAIRS\n AliRsnMiniOutput * outmy = task->CreateOutput(Form(\"motherRap_%s\", partname.Data()), output.Data(),\"MOTHER\");\n outmy->SetDaughter(0, d1);\n outmy->SetDaughter(1, d2);\n outmy->SetMotherPDG(pdgCode);\n outmy->SetMotherMass(mass);\n outmy->SetPairCuts(cutsPair);\n outmy->AddAxis(ptID, 160, 0.0, 16.0);\n outmy->AddAxis(yID, 120, -0.6, 0.6);\n outmy->AddAxis(etaID, 200, -1., 1.);\n\n \/\/f2 GENERATED PAIRS\n AliRsnMiniOutput * outm2 = task->CreateOutput(\"motherf2\", output.Data(),\"MOTHER\");\n outm2->SetDaughter(0, d1);\n outm2->SetDaughter(1, d2);\n outm2->SetMotherPDG(bgTemplatePDG[6]);\n outm2->SetMotherMass(bgTemplateM[6]);\n outm2->SetPairCuts(cutsPair);\n outm2->AddAxis(imID, nbins, masslow, massup);\n outm2->AddAxis(ptID, 200, 0.0, 20.0);\n if (enaMultSel) outm2->AddAxis(multID, 100, 0.0, 100.0);\n\n \/\/f2 GENERATED PAIRS\n AliRsnMiniOutput * outmy2 = task->CreateOutput(\"motherf2Rap\", output.Data(),\"MOTHER\");\n outmy2->SetDaughter(0, d1);\n outmy2->SetDaughter(1, d2);\n outmy2->SetMotherPDG(bgTemplatePDG[6]);\n outmy2->SetMotherMass(bgTemplateM[6]);\n outmy2->SetPairCuts(cutsPair);\n outmy2->AddAxis(ptID, 160, 0.0, 16.0);\n outmy2->AddAxis(yID, 120, -0.6, 0.6);\n outmy2->AddAxis(etaID, 200, -1., 1.);\n }\n\n return kTRUE;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 Dims dev-team\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"acceptNodeAction.h\"\n#include \"common\/setResponseVisitor.h\"\n#include \"common\/commonEvents.h\"\n#include \"common\/authenticationProvider.h\"\n#include \"common\/mediumRequests.h\"\n\n#include <boost\/statechart\/simple_state.hpp>\n#include <boost\/statechart\/state.hpp>\n#include <boost\/statechart\/transition.hpp>\n#include <boost\/statechart\/custom_reaction.hpp>\n\n#include \"acceptNodeAction.h\"\n#include \"seedNodesManager.h\"\n#include \"seedNodeMedium.h\"\n\n#include \"seedDb.h\"\n#include \"seedFilter.h\"\n\n\nnamespace seed\n{\nextern CAddrDb db;\n\nstruct CUnconnected; struct CBothUnidentifiedConnected;\n\n\nstruct CUninitiated : boost::statechart::simple_state< CUninitiated, CAcceptNodeAction >\n{\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CSwitchToConnectingEvent, CUnconnected >,\n\tboost::statechart::transition< common::CSwitchToConnectedEvent, CBothUnidentifiedConnected >\n\t> reactions;\n\n};\n\n\nstruct CIdentified : boost::statechart::state< CIdentified, CAcceptNodeAction >\n{\n\tCIdentified( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( true );\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\n\ntemplate < class Parent >\nvoid\ncreateIdentifyResponse( Parent & parent )\n{\n\tuint256 hash = Hash( &parent.getPayload().front(), &parent.getPayload().back() );\n\n\tstd::vector< unsigned char > signedHash;\n\tcommon::CAuthenticationProvider::getInstance()->sign( hash, signedHash );\n\n\tparent.setRequest( new common::CIdentifyResponse<SeedResponses>( new CSpecificMediumFilter( parent.getMediumPtr() ), signedHash, common::CAuthenticationProvider::getInstance()->getMyKey(), parent.getPayload(), parent.getActionKey() ) );\n}\n\nstruct ConnectedToTracker;\nstruct ConnectedToSeed;\nstruct ConnectedToMonitor;\n\nstruct CPairIdentifiedConnecting : boost::statechart::state< CPairIdentifiedConnecting, CAcceptNodeAction >\n{\n\tCPairIdentifiedConnecting( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcommon::CIntroduceEvent const* requestedEvent = dynamic_cast< common::CIntroduceEvent const* >( simple_state::triggering_event() );\n\n\t\tuint256 hash = Hash( &requestedEvent->m_payload.front(), &requestedEvent->m_payload.back() );\n\n\t\tif ( requestedEvent->m_key.Verify( hash, requestedEvent->m_signed ) )\n\t\t{\n\t\t\tcreateIdentifyResponse( context< CAcceptNodeAction >() );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t\t}\n\n\t}\n\n\tboost::statechart::result react( common::CContinueEvent const & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\tboost::statechart::result react( common::CRoleEvent const & _roleEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CNetworkRoleRequest<SeedResponses>( context< CAcceptNodeAction >().getActionKey(), common::CRole::Seed, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\n\t\tswitch ( _roleEvent.m_role )\n\t\t{\n\t\tcase common::CRole::Tracker:\n\t\t\treturn transit< ConnectedToTracker >();\n\t\tcase common::CRole::Seed:\n\t\t\treturn transit< ConnectedToSeed >();\n\t\tcase common::CRole::Monitor:\n\t\t\treturn transit< ConnectedToMonitor >();\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CRoleEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n};\n\nstruct CPairIdentifiedConnected : boost::statechart::state< CPairIdentifiedConnected, CAcceptNodeAction >\n{\n\tCPairIdentifiedConnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcommon::CIntroduceEvent const* requestedEvent = dynamic_cast< common::CIntroduceEvent const* >( simple_state::triggering_event() );\n\n\t\tuint256 hash = Hash( &requestedEvent->m_payload.front(), &requestedEvent->m_payload.back() );\n\n\t\tif ( requestedEvent->m_key.Verify( hash, requestedEvent->m_signed ) )\n\t\t{\n\t\t\tm_address = requestedEvent->m_address;\n\n\t\t\tCSeedNodesManager::getInstance()->setPublicKey( m_address, requestedEvent->m_key );\n\n\t\t\tcontext< CAcceptNodeAction >().setRequest( new common::CNetworkRoleRequest<SeedResponses>( context< CAcceptNodeAction >().getActionKey(), common::CRole::Seed, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setValid( false );\n\t\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t\t}\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\tboost::statechart::result react( common::CRoleEvent const & _roleEvent )\n\t{\n\t\tswitch ( _roleEvent.m_role )\n\t\t{\n\t\tcase common::CRole::Tracker:\n\t\t\tdb.Add(m_address);\n\t\t\treturn transit< ConnectedToTracker >();\n\t\tcase common::CRole::Seed:\n\t\t\treturn transit< ConnectedToSeed >();\n\t\tcase common::CRole::Monitor:\n\t\t\tdb.Add(m_address);\n\t\t\treturn transit< ConnectedToMonitor >();\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CRoleEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n\tCAddress m_address;\n\n};\n\n\nstruct CBothUnidentifiedConnecting : boost::statechart::state< CBothUnidentifiedConnecting, CAcceptNodeAction >\n{\n\tCBothUnidentifiedConnecting( my_context ctx ) : my_base( ctx )\n\t{\n\n\t\tcommon::CNodeConnectedEvent const* connectedEvent = dynamic_cast< common::CNodeConnectedEvent const* >( simple_state::triggering_event() );\n\t\tcontext< CAcceptNodeAction >().setMediumPtr( convertToInt( connectedEvent->m_node ) );\n\t\t\/\/ looks funny that I set it in this state, but let it be\n\t\tCSeedNodesManager::getInstance()->addNode( new CSeedNodeMedium( connectedEvent->m_node ) );\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CIdentifyRequest<SeedResponses>( new CSpecificMediumFilter( convertToInt( connectedEvent->m_node ) ), context< CAcceptNodeAction >().getPayload(), context< CAcceptNodeAction >().getActionKey() ) );\n\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CIntroduceEvent, CPairIdentifiedConnecting >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n};\n\nstruct CBothUnidentifiedConnected : boost::statechart::state< CBothUnidentifiedConnected, CAcceptNodeAction >\n{\n\tCBothUnidentifiedConnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcreateIdentifyResponse( context< CAcceptNodeAction >() );\n\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CIntroduceEvent, CPairIdentifiedConnected >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n};\n\nstruct CCantReachNode : boost::statechart::state< CCantReachNode, CAcceptNodeAction >\n{\n\tCCantReachNode( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( false );\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\nstruct CUnconnected : boost::statechart::state< CUnconnected, CAcceptNodeAction >\n{\n\tCUnconnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest(\n\t\t\t\t new common::CConnectToNodeRequest< SeedResponses >( std::string(\"\"), context< CAcceptNodeAction >().getAddress(), new CInternalMediumFilter() ) );\n\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CNodeConnectedEvent, CBothUnidentifiedConnecting >,\n\tboost::statechart::transition< common::CCantReachNode, CCantReachNode >\n\t> reactions;\n\n};\n\nstruct ConnectedToTracker : boost::statechart::state< ConnectedToTracker, CAcceptNodeAction >\n{\n\t\/\/ system is not suitable for sending many requests one after another\n\t\/\/ play ugly here to overcome this\n\t\/\/ maybe instead of this mess use ack event to confirm\n\tConnectedToTracker( my_context ctx ) : my_base( ctx ), m_request( 0 )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( true );\n\n\t\tif ( !context< CAcceptNodeAction >().getRequest() )\/\/ allow execution if something is there\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setRequest(\n\t\t\t\t\t\tnew common::CKnownNetworkInfoRequest< SeedResponses >( context< CAcceptNodeAction >().getActionKey(), std::vector< common::CValidNodeInfo >(), new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\/\/ vicious usage of CKnownNetworkInfoRequest\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_request = new common::CKnownNetworkInfoRequest< SeedResponses >( context< CAcceptNodeAction >().getActionKey(), std::vector< common::CValidNodeInfo >(), new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) );\n\t\t}\n\t}\n\n\tboost::statechart::result react( common::CNetworkInfoEvent const & _networkInfo )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\n\t\tBOOST_FOREACH( common::CValidNodeInfo validNodeInfo, _networkInfo.m_networkInfo )\n\t\t{\n\t\t\tif ( validNodeInfo.m_role == common::CRole::Tracker || validNodeInfo.m_role == common::CRole::Monitor )\n\t\t\t{\n\t\t\t\tdb.Add( validNodeInfo.m_address );\n\t\t\t}\n\t\t}\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tif ( m_request )\n\t\t\tcontext< CAcceptNodeAction >().setRequest( m_request );\n\t\telse\n\t\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest< SeedResponses >( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CNetworkInfoEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n\tcommon::CRequest< SeedResponses >* m_request;\n};\n\nstruct ConnectedToSeed : boost::statechart::state< ConnectedToSeed, CAcceptNodeAction >\n{\n\tConnectedToSeed( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\nstruct ConnectedToMonitor : boost::statechart::state< ConnectedToMonitor, CAcceptNodeAction >\n{\n\tConnectedToMonitor( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\n\n\nstruct CSynchronizing : boost::statechart::simple_state< CSynchronizing, CAcceptNodeAction >\n{\n\n};\n\nCAcceptNodeAction::CAcceptNodeAction( uint256 const & _actionKey, std::vector< unsigned char > const & _payload, uintptr_t _mediumPtr )\n: common::CCommunicationAction( _actionKey )\n, m_payload( _payload )\n, m_request( 0 )\n, m_passive( true )\n, m_mediumPtr( _mediumPtr )\n, m_valid( false )\n{\n\tinitiate();\n\tprocess_event( common::CSwitchToConnectedEvent() );\n}\n\nCAcceptNodeAction::CAcceptNodeAction( CAddress const & _nodeAddress )\n\t: common::CAction< SeedResponses >( false )\n\t, m_nodeAddress( _nodeAddress )\n\t, m_request( 0 )\n\t, m_passive( false )\n\t, m_valid( false )\n{\n\tfor ( unsigned int i = 0; i < ms_randomPayloadLenght; i++ )\n\t{\n\t\tm_payload.push_back( insecure_rand() % 256 );\n\t}\n\tinitiate();\n\tprocess_event( common::CSwitchToConnectingEvent() );\n}\n\ncommon::CRequest< SeedResponses >*\nCAcceptNodeAction::execute()\n{\n\tcommon::CRequest< SeedResponses >* request = m_request;\n\tm_request = 0;\n\treturn request;\n}\n\nvoid\nCAcceptNodeAction::accept( common::CSetResponseVisitor< SeedResponses > & _visitor )\n{\n\t_visitor.visit( *this );\n}\n\nvoid\nCAcceptNodeAction::setRequest( common::CRequest< SeedResponses >* _request )\n{\n\tm_request = _request;\n}\n\ncommon::CRequest< SeedResponses > const *\nCAcceptNodeAction::getRequest() const\n{\n\treturn m_request;\n}\n\nCAddress\nCAcceptNodeAction::getAddress() const\n{\n\treturn m_nodeAddress;\n}\n\nstd::vector< unsigned char > const &\nCAcceptNodeAction::getPayload() const\n{\n\treturn m_payload;\n}\n\nuintptr_t\nCAcceptNodeAction::getMediumPtr() const\n{\n\treturn m_mediumPtr;\n}\n\nvoid\nCAcceptNodeAction::setMediumPtr( uintptr_t _mediumPtr )\n{\n\tm_mediumPtr = _mediumPtr;\n}\n\n\n\n}\n<commit_msg>debugging communication seed, tracker<commit_after>\/\/ Copyright (c) 2014 Dims dev-team\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"acceptNodeAction.h\"\n#include \"common\/setResponseVisitor.h\"\n#include \"common\/commonEvents.h\"\n#include \"common\/authenticationProvider.h\"\n#include \"common\/mediumRequests.h\"\n\n#include <boost\/statechart\/simple_state.hpp>\n#include <boost\/statechart\/state.hpp>\n#include <boost\/statechart\/transition.hpp>\n#include <boost\/statechart\/custom_reaction.hpp>\n\n#include \"acceptNodeAction.h\"\n#include \"seedNodesManager.h\"\n#include \"seedNodeMedium.h\"\n\n#include \"seedDb.h\"\n#include \"seedFilter.h\"\n\n\/\/ ugly as hell, refactor as soon as possible\nnamespace seed\n{\nextern CAddrDb db;\n\nstruct CUnconnected; struct CBothUnidentifiedConnected;\n\n\nstruct CUninitiated : boost::statechart::simple_state< CUninitiated, CAcceptNodeAction >\n{\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CSwitchToConnectingEvent, CUnconnected >,\n\tboost::statechart::transition< common::CSwitchToConnectedEvent, CBothUnidentifiedConnected >\n\t> reactions;\n\n};\n\n\nstruct CIdentified : boost::statechart::state< CIdentified, CAcceptNodeAction >\n{\n\tCIdentified( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( true );\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\n\ntemplate < class Parent >\nvoid\ncreateIdentifyResponse( Parent & parent )\n{\n\tuint256 hash = Hash( &parent.getPayload().front(), &parent.getPayload().back() );\n\n\tstd::vector< unsigned char > signedHash;\n\tcommon::CAuthenticationProvider::getInstance()->sign( hash, signedHash );\n\n\tparent.setRequest( new common::CIdentifyResponse<SeedResponses>( new CSpecificMediumFilter( parent.getMediumPtr() ), signedHash, common::CAuthenticationProvider::getInstance()->getMyKey(), parent.getPayload(), parent.getActionKey() ) );\n}\n\nstruct ConnectedToTracker;\nstruct ConnectedToSeed;\nstruct ConnectedToMonitor;\n\nstruct CPairIdentifiedConnecting : boost::statechart::state< CPairIdentifiedConnecting, CAcceptNodeAction >\n{\n\tCPairIdentifiedConnecting( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcommon::CIntroduceEvent const* requestedEvent = dynamic_cast< common::CIntroduceEvent const* >( simple_state::triggering_event() );\n\n\t\tuint256 hash = Hash( &requestedEvent->m_payload.front(), &requestedEvent->m_payload.back() );\n\n\t\tif ( requestedEvent->m_key.Verify( hash, requestedEvent->m_signed ) )\n\t\t{\n\t\t\tcreateIdentifyResponse( context< CAcceptNodeAction >() );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t\t}\n\n\t}\n\n\tboost::statechart::result react( common::CContinueEvent const & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\tboost::statechart::result react( common::CRoleEvent const & _roleEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CNetworkRoleRequest<SeedResponses>( context< CAcceptNodeAction >().getActionKey(), common::CRole::Seed, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\n\t\tswitch ( _roleEvent.m_role )\n\t\t{\n\t\tcase common::CRole::Tracker:\n\t\t\treturn transit< ConnectedToTracker >();\n\t\tcase common::CRole::Seed:\n\t\t\treturn transit< ConnectedToSeed >();\n\t\tcase common::CRole::Monitor:\n\t\t\treturn transit< ConnectedToMonitor >();\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CRoleEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n};\n\nstruct CPairIdentifiedConnected : boost::statechart::state< CPairIdentifiedConnected, CAcceptNodeAction >\n{\n\tCPairIdentifiedConnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcommon::CIntroduceEvent const* requestedEvent = dynamic_cast< common::CIntroduceEvent const* >( simple_state::triggering_event() );\n\n\t\tuint256 hash = Hash( &requestedEvent->m_payload.front(), &requestedEvent->m_payload.back() );\n\n\t\tif ( requestedEvent->m_key.Verify( hash, requestedEvent->m_signed ) )\n\t\t{\n\t\t\tm_address = requestedEvent->m_address;\n\n\t\t\tCSeedNodesManager::getInstance()->setPublicKey( m_address, requestedEvent->m_key );\n\n\t\t\tcontext< CAcceptNodeAction >().setRequest( new common::CNetworkRoleRequest<SeedResponses>( context< CAcceptNodeAction >().getActionKey(), common::CRole::Seed, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setValid( false );\n\t\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t\t}\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\tboost::statechart::result react( common::CRoleEvent const & _roleEvent )\n\t{\n\t\tswitch ( _roleEvent.m_role )\n\t\t{\n\t\tcase common::CRole::Tracker:\n\t\t\tdb.Add(m_address);\n\t\t\treturn transit< ConnectedToTracker >();\n\t\tcase common::CRole::Seed:\n\t\t\treturn transit< ConnectedToSeed >();\n\t\tcase common::CRole::Monitor:\n\t\t\tdb.Add(m_address);\n\t\t\treturn transit< ConnectedToMonitor >();\n\t\tdefault:\n\t\t\tbreak;\n\t\t}\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CRoleEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n\tCAddress m_address;\n\n};\n\n\nstruct CBothUnidentifiedConnecting : boost::statechart::state< CBothUnidentifiedConnecting, CAcceptNodeAction >\n{\n\tCBothUnidentifiedConnecting( my_context ctx ) : my_base( ctx )\n\t{\n\n\t\tcommon::CNodeConnectedEvent const* connectedEvent = dynamic_cast< common::CNodeConnectedEvent const* >( simple_state::triggering_event() );\n\t\tcontext< CAcceptNodeAction >().setMediumPtr( convertToInt( connectedEvent->m_node ) );\n\t\t\/\/ looks funny that I set it in this state, but let it be\n\t\tCSeedNodesManager::getInstance()->addNode( new CSeedNodeMedium( connectedEvent->m_node ) );\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CIdentifyRequest<SeedResponses>( new CSpecificMediumFilter( convertToInt( connectedEvent->m_node ) ), context< CAcceptNodeAction >().getPayload(), context< CAcceptNodeAction >().getActionKey() ) );\n\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CIntroduceEvent, CPairIdentifiedConnecting >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n};\n\nstruct CBothUnidentifiedConnected : boost::statechart::state< CBothUnidentifiedConnected, CAcceptNodeAction >\n{\n\tCBothUnidentifiedConnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcreateIdentifyResponse( context< CAcceptNodeAction >() );\n\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest<SeedResponses>( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CIntroduceEvent, CPairIdentifiedConnected >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n};\n\nstruct CCantReachNode : boost::statechart::state< CCantReachNode, CAcceptNodeAction >\n{\n\tCCantReachNode( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( false );\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\nstruct CUnconnected : boost::statechart::state< CUnconnected, CAcceptNodeAction >\n{\n\tCUnconnected( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest(\n\t\t\t\t new common::CConnectToNodeRequest< SeedResponses >( std::string(\"\"), context< CAcceptNodeAction >().getAddress(), new CInternalMediumFilter() ) );\n\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::transition< common::CNodeConnectedEvent, CBothUnidentifiedConnecting >,\n\tboost::statechart::transition< common::CCantReachNode, CCantReachNode >\n\t> reactions;\n\n};\n\nstruct ConnectedToTracker : boost::statechart::state< ConnectedToTracker, CAcceptNodeAction >\n{\n\t\/\/ system is not suitable for sending many requests one after another\n\t\/\/ play ugly here to overcome this\n\t\/\/ maybe instead of this mess use ack event to confirm\n\tConnectedToTracker( my_context ctx ) : my_base( ctx ), m_request( 0 )\n\t{\n\t\tcontext< CAcceptNodeAction >().setValid( true );\n\n\t\tif ( !context< CAcceptNodeAction >().getRequest() )\/\/ allow execution if something is there\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setRequest(\n\t\t\t\t\t\tnew common::CKnownNetworkInfoRequest< SeedResponses >( context< CAcceptNodeAction >().getActionKey(), std::vector< common::CValidNodeInfo >(), new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\/\/ vicious usage of CKnownNetworkInfoRequest\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_request = new common::CKnownNetworkInfoRequest< SeedResponses >( context< CAcceptNodeAction >().getActionKey(), std::vector< common::CValidNodeInfo >(), new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) );\n\t\t}\n\t}\n\n\tboost::statechart::result react( common::CNetworkInfoEvent const & _networkInfo )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\n\t\tBOOST_FOREACH( common::CValidNodeInfo validNodeInfo, _networkInfo.m_networkInfo )\n\t\t{\n\t\t\tif ( validNodeInfo.m_role == common::CRole::Tracker || validNodeInfo.m_role == common::CRole::Monitor )\n\t\t\t{\n\t\t\t\tdb.Add( validNodeInfo.m_address );\n\t\t\t}\n\t\t}\n\t}\n\n\tboost::statechart::result react( const common::CContinueEvent & _continueEvent )\n\t{\n\t\tif ( m_request )\n\t\t{\n\t\t\tcontext< CAcceptNodeAction >().setRequest( m_request );\n\t\t\tm_request = 0;\n\t\t}\n\t\telse\n\t\t\tcontext< CAcceptNodeAction >().setRequest( new common::CContinueReqest< SeedResponses >( _continueEvent.m_keyId, new CSpecificMediumFilter( context< CAcceptNodeAction >().getMediumPtr() ) ) );\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CNetworkInfoEvent >,\n\tboost::statechart::custom_reaction< common::CContinueEvent >\n\t> reactions;\n\n\tcommon::CRequest< SeedResponses >* m_request;\n};\n\nstruct ConnectedToSeed : boost::statechart::state< ConnectedToSeed, CAcceptNodeAction >\n{\n\tConnectedToSeed( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\nstruct ConnectedToMonitor : boost::statechart::state< ConnectedToMonitor, CAcceptNodeAction >\n{\n\tConnectedToMonitor( my_context ctx ) : my_base( ctx )\n\t{\n\t\tcontext< CAcceptNodeAction >().setRequest( 0 );\n\t}\n};\n\n\n\nstruct CSynchronizing : boost::statechart::simple_state< CSynchronizing, CAcceptNodeAction >\n{\n\n};\n\nCAcceptNodeAction::CAcceptNodeAction( uint256 const & _actionKey, std::vector< unsigned char > const & _payload, uintptr_t _mediumPtr )\n: common::CCommunicationAction( _actionKey )\n, m_payload( _payload )\n, m_request( 0 )\n, m_passive( true )\n, m_mediumPtr( _mediumPtr )\n, m_valid( false )\n{\n\tinitiate();\n\tprocess_event( common::CSwitchToConnectedEvent() );\n}\n\nCAcceptNodeAction::CAcceptNodeAction( CAddress const & _nodeAddress )\n\t: common::CAction< SeedResponses >( false )\n\t, m_nodeAddress( _nodeAddress )\n\t, m_request( 0 )\n\t, m_passive( false )\n\t, m_valid( false )\n{\n\tfor ( unsigned int i = 0; i < ms_randomPayloadLenght; i++ )\n\t{\n\t\tm_payload.push_back( insecure_rand() % 256 );\n\t}\n\tinitiate();\n\tprocess_event( common::CSwitchToConnectingEvent() );\n}\n\ncommon::CRequest< SeedResponses >*\nCAcceptNodeAction::execute()\n{\n\tcommon::CRequest< SeedResponses >* request = m_request;\n\tm_request = 0;\n\treturn request;\n}\n\nvoid\nCAcceptNodeAction::accept( common::CSetResponseVisitor< SeedResponses > & _visitor )\n{\n\t_visitor.visit( *this );\n}\n\nvoid\nCAcceptNodeAction::setRequest( common::CRequest< SeedResponses >* _request )\n{\n\tm_request = _request;\n}\n\ncommon::CRequest< SeedResponses > const *\nCAcceptNodeAction::getRequest() const\n{\n\treturn m_request;\n}\n\nCAddress\nCAcceptNodeAction::getAddress() const\n{\n\treturn m_nodeAddress;\n}\n\nstd::vector< unsigned char > const &\nCAcceptNodeAction::getPayload() const\n{\n\treturn m_payload;\n}\n\nuintptr_t\nCAcceptNodeAction::getMediumPtr() const\n{\n\treturn m_mediumPtr;\n}\n\nvoid\nCAcceptNodeAction::setMediumPtr( uintptr_t _mediumPtr )\n{\n\tm_mediumPtr = _mediumPtr;\n}\n\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ITER_RANGE_H_\n#define ITER_RANGE_H_\n\n\/\/ range() for range-based loops with start, stop, and step.\n\/\/\n\/\/ Acceptable forms are:\n\/\/ for (auto i : range(stop)) { ... } \/\/ start = 0, step = 1\n\/\/ for (auto i : range(start, stop)) { ... } \/\/ step = 1\n\/\/ for (auto i : range(start, stop, step)) { ... }\n\/\/\n\/\/ The start may be greater than the stop if the range is negative\n\/\/ The range will effectively be empty if:\n\/\/ 1) step is positive and start > stop\n\/\/ 2) step is negative and start < stop\n\/\/\n\/\/ If a step of 0 is provided, a RangeException will be thrown\n\n#include <exception>\n#include <type_traits>\n#include <iterator>\n\nnamespace iter {\n\n \/\/ Thrown when step 0 occurs\n class RangeException : public std::exception {\n const char *what() const noexcept override {\n return \"range step must be non-zero\";\n }\n };\n\n template <typename T, bool IsFloat =false>\n class Range;\n\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T);\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T, T);\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T, T, T);\n\n \/\/ General version for everything not a float\n template <typename T, bool>\n class Range {\n friend Range range<T, false>(T);\n friend Range range<T, false>(T, T);\n friend Range range<T, false>(T, T, T);\n private:\n const T start;\n const T stop;\n const T step;\n\n Range(T in_stop)\n : start{0},\n stop{in_stop},\n step{1}\n { }\n\n Range(T in_start, T in_stop, T in_step =1)\n : start{in_start},\n stop{in_stop},\n step{in_step}\n { }\n\n public:\n class Iterator\n : public std::iterator<std::forward_iterator_tag, T>\n {\n private:\n T value;\n T step;\n\n \/\/ compare unsigned values\n bool not_equal_to(\n const Iterator& other, std::true_type ) const {\n return this->value < other.value;\n }\n\n \/\/ compare signed values\n bool not_equal_to(\n const Iterator& other, std::false_type) const {\n return !(this->step > 0 && this->value >= other.value) \n && !(this->step < 0 && this->value <= other.value);\n }\n public:\n Iterator() =default;\n\n Iterator(T val, T in_step)\n : value{val},\n step{in_step}\n { }\n\n T operator*() const {\n return this->value;\n }\n\n Iterator& operator++() {\n this->value += this->step;\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n \/\/ This operator would more accurately read as \"in bounds\"\n \/\/ or \"incomplete\" because exact comparison with the end\n \/\/ isn't good enough for the purposes of this Iterator.\n \/\/ There are two odd cases that need to be handled\n \/\/\n \/\/ 1) The Range is infinite, such as\n \/\/ Range (-1, 0, -1) which would go forever down toward\n \/\/ infinitely (theoretically). If this occurs, the Range\n \/\/ will instead effectively be empty\n \/\/\n \/\/ 2) (stop - start) % step != 0. For\n \/\/ example Range(1, 10, 2). The iterator will never be\n \/\/ exactly equal to the stop value.\n \/\/\n \/\/ Another way to think about it is that the \"end\"\n \/\/ iterator represents the range of values that are invalid\n \/\/ So, if an iterator is not equal to that, it is valid\n bool operator!=(const Iterator& other) const { \n return not_equal_to(\n other, typename std::is_unsigned<T>::type());\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() const {\n return {start, step};\n }\n\n Iterator end() const { \n return {stop, step};\n }\n };\n\n \/\/ This specialization is used for floating point types. Instead of\n \/\/ adding one \"step\" each time ++ is called on the iterator, the value\n \/\/ is recalculated as start + (steps_taken + step_size) to avoid\n \/\/ accumulating floating point inaccuracies \n template <typename T>\n class Range<T, true> {\n friend Range range<T, true>(T);\n friend Range range<T, true>(T, T);\n friend Range range<T, true>(T, T, T);\n private:\n const T start; \n const T stop;\n const T step;\n\n Range(T in_stop)\n : start{0},\n stop{in_stop},\n step{1}\n { }\n\n Range(T in_start, T in_stop, T in_step =1)\n : start{in_start},\n stop{in_stop},\n step{in_step}\n { }\n public:\n class Iterator\n : public std::iterator<std::forward_iterator_tag, T>\n {\n private:\n T start;\n T value;\n T step;\n unsigned long steps_taken =0;\n\n public:\n Iterator() =default;\n\n Iterator(T in_start, T in_step)\n : start{in_start},\n value{in_start},\n step{in_step}\n { }\n\n bool operator!=(const Iterator& other) const {\n return !(this->step > 0 && this->value >= other.value) \n && !(this->step < 0 && this->value <= other.value);\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n\n T operator*() const {\n return this->value;\n }\n\n Iterator& operator++() {\n ++this->steps_taken;\n this->value = this->start +\n (this->step * this->steps_taken);\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n };\n\n Iterator begin() const {\n return {start, step};\n }\n\n Iterator end() const { \n return {stop, step};\n }\n };\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T stop) {\n return {stop};\n }\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T start, T stop) {\n return {start, stop};\n }\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T start, T stop, T step) {\n if (step == 0) {\n throw RangeException{};\n }\n return {start, stop, step};\n }\n}\n\n#endif \/\/ #ifndef ITER_RANGE_H_\n<commit_msg>range can compare arbitrary iterators<commit_after>#ifndef ITER_RANGE_H_\n#define ITER_RANGE_H_\n\n\/\/ range() for range-based loops with start, stop, and step.\n\/\/\n\/\/ Acceptable forms are:\n\/\/ for (auto i : range(stop)) { ... } \/\/ start = 0, step = 1\n\/\/ for (auto i : range(start, stop)) { ... } \/\/ step = 1\n\/\/ for (auto i : range(start, stop, step)) { ... }\n\/\/\n\/\/ The start may be greater than the stop if the range is negative\n\/\/ The range will effectively be empty if:\n\/\/ 1) step is positive and start > stop\n\/\/ 2) step is negative and start < stop\n\/\/\n\/\/ If a step of 0 is provided, a RangeException will be thrown\n\n#include <exception>\n#include <type_traits>\n#include <iterator>\n#include <cassert>\n\nnamespace iter {\n\n \/\/ Thrown when step 0 occurs\n class RangeException : public std::exception {\n const char *what() const noexcept override {\n return \"range step must be non-zero\";\n }\n };\n\n template <typename T, bool IsFloat =false>\n class Range;\n\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T);\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T, T);\n template <typename T, bool IsFloat =std::is_floating_point<T>::value>\n Range<T, IsFloat> range(T, T, T);\n\n \/\/ General version for everything not a float\n template <typename T, bool>\n class Range {\n friend Range range<T, false>(T);\n friend Range range<T, false>(T, T);\n friend Range range<T, false>(T, T, T);\n private:\n const T start;\n const T stop;\n const T step;\n\n Range(T in_stop)\n : start{0},\n stop{in_stop},\n step{1}\n { }\n\n Range(T in_start, T in_stop, T in_step =1)\n : start{in_start},\n stop{in_stop},\n step{in_step}\n { }\n\n public:\n class Iterator\n : public std::iterator<std::forward_iterator_tag, T>\n {\n private:\n T value;\n T step;\n bool is_end;\n\n \/\/ compare unsigned values\n static bool not_equal_to_impl(\n const Iterator& iter, const Iterator& end_iter,\n std::true_type ) {\n assert(!iter.is_end);\n assert(end_iter.is_end);\n return iter.value < end_iter.value;\n }\n\n \/\/ compare signed values\n static bool not_equal_to_impl(\n const Iterator& iter, const Iterator& end_iter,\n std::false_type) {\n assert(!iter.is_end);\n assert(end_iter.is_end);\n return !(iter.step > 0 && iter.value >= end_iter.value)\n && !(iter.step < 0 && iter.value <= end_iter.value);\n }\n\n static bool not_equal_to_end(\n const Iterator& lhs, const Iterator& rhs) {\n if (rhs.is_end) {\n return not_equal_to_impl(\n lhs, rhs, std::is_unsigned<T>{});\n } else {\n return not_equal_to_impl(\n rhs, lhs, std::is_unsigned<T>{});\n }\n }\n\n public:\n Iterator() =default;\n\n Iterator(T val, T in_step, bool in_is_end)\n : value{val},\n step{in_step},\n is_end{in_is_end}\n { }\n\n T operator*() const {\n return this->value;\n }\n\n Iterator& operator++() {\n this->value += this->step;\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n\n \/\/ This operator would more accurately read as \"in bounds\"\n \/\/ or \"incomplete\" because exact comparison with the end\n \/\/ isn't good enough for the purposes of this Iterator.\n \/\/ There are two odd cases that need to be handled\n \/\/\n \/\/ 1) The Range is infinite, such as\n \/\/ Range (-1, 0, -1) which would go forever down toward\n \/\/ infinitely (theoretically). If this occurs, the Range\n \/\/ will instead effectively be empty\n \/\/\n \/\/ 2) (stop - start) % step != 0. For\n \/\/ example Range(1, 10, 2). The iterator will never be\n \/\/ exactly equal to the stop value.\n \/\/\n \/\/ Another way to think about it is that the \"end\"\n \/\/ iterator represents the range of values that are invalid\n \/\/ So, if an iterator is not equal to that, it is valid\n bool operator!=(const Iterator& other) const {\n if (this->is_end && other.is_end) {\n return false;\n }\n\n if (!this->is_end && !other.is_end) {\n return this->value != other.value;\n }\n return not_equal_to_end(*this, other);\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n };\n\n Iterator begin() const {\n return {start, step, false};\n }\n\n Iterator end() const {\n return {stop, step, true};\n }\n };\n\n \/\/ This specialization is used for floating point types. Instead of\n \/\/ adding one \"step\" each time ++ is called on the iterator, the value\n \/\/ is recalculated as start + (steps_taken + step_size) to avoid\n \/\/ accumulating floating point inaccuracies\n template <typename T>\n class Range<T, true> {\n friend Range range<T, true>(T);\n friend Range range<T, true>(T, T);\n friend Range range<T, true>(T, T, T);\n private:\n const T start;\n const T stop;\n const T step;\n\n Range(T in_stop)\n : start{0},\n stop{in_stop},\n step{1}\n { }\n\n Range(T in_start, T in_stop, T in_step =1)\n : start{in_start},\n stop{in_stop},\n step{in_step}\n { }\n public:\n class Iterator\n : public std::iterator<std::forward_iterator_tag, T>\n {\n private:\n T start;\n T value;\n T step;\n unsigned long steps_taken =0;\n\n public:\n Iterator() =default;\n\n Iterator(T in_start, T in_step)\n : start{in_start},\n value{in_start},\n step{in_step}\n { }\n\n bool operator!=(const Iterator& other) const {\n return !(this->step > 0 && this->value >= other.value) \n && !(this->step < 0 && this->value <= other.value);\n }\n\n bool operator==(const Iterator& other) const {\n return !(*this != other);\n }\n\n T operator*() const {\n return this->value;\n }\n\n Iterator& operator++() {\n ++this->steps_taken;\n this->value = this->start +\n (this->step * this->steps_taken);\n return *this;\n }\n\n Iterator operator++(int) {\n auto ret = *this;\n ++*this;\n return ret;\n }\n };\n\n Iterator begin() const {\n return {start, step};\n }\n\n Iterator end() const { \n return {stop, step};\n }\n };\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T stop) {\n return {stop};\n }\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T start, T stop) {\n return {start, stop};\n }\n\n template <typename T, bool IsFloat>\n Range<T, IsFloat> range(T start, T stop, T step) {\n if (step == 0) {\n throw RangeException{};\n }\n return {start, stop, step};\n }\n}\n\n#endif \/\/ #ifndef ITER_RANGE_H_\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n * Copyright (c) 2014 eProsima. All rights reserved.\n *\n * This copy of eProsima RTPS is licensed to you under the terms described in the\n * EPROSIMARTPS_LIBRARY_LICENSE file included in this distribution.\n *\n *************************************************************************\/\n\n\/*\n * ResourceSend.cpp\n *\n *\/\n\n#include \"eprosimartps\/resources\/ResourceSend.h\"\n#include \"eprosimartps\/common\/types\/CDRMessage_t.h\"\n#include \"eprosimartps\/utils\/RTPSLog.h\"\n\n#include \"eprosimartps\/Participant.h\"\n\nusing boost::asio::ip::udp;\n\nnamespace eprosima {\nnamespace rtps {\n\nResourceSend::ResourceSend(ParticipantImpl* par) :\n\tm_send_socket(m_send_service),\n\tm_bytes_sent(0),\n\tm_send_next(true),\n\tmp_participant(par)\n{\n\n}\n\nbool ResourceSend::initSend(const Locator_t& loc)\n{\n\/\/\tboost::asio::ip::address addr;\n\tm_sendLocator = loc;\n\/\/\ttry {\n\/\/\t\tboost::asio::io_service netService;\n\/\/\t\tudp::resolver resolver(netService);\n\/\/\t\tudp::resolver::query query(udp::v4(), \"google.com\", \"\");\n\/\/\t\tudp::resolver::iterator endpoints = resolver.resolve(query);\n\/\/\t\tudp::endpoint ep = *endpoints;\n\/\/\t\tudp::socket socket(netService);\n\/\/\t\tsocket.connect(ep);\n\/\/\t\taddr = socket.local_endpoint().address();\n\/\/\n\/\/\t\tpInfo(\"My IP according to google is: \" << addr.to_string() << endl);\n\/\/\n\/\/\t\tm_sendLocator.address[12] = addr.to_v4().to_bytes()[0];\n\/\/\t\tm_sendLocator.address[13] = addr.to_v4().to_bytes()[1];\n\/\/\t\tm_sendLocator.address[14] = addr.to_v4().to_bytes()[2];\n\/\/\t\tm_sendLocator.address[15] = addr.to_v4().to_bytes()[3];\n\/\/\t}\n\/\/\tcatch (std::exception& e)\n\/\/\t{\n\/\/\t\tstd::cerr << \"Could not deal with socket. Exception: \" << e.what() << std::endl;\n\/\/\t\tm_sendLocator = loc;\n\/\/\t\tm_sendLocator.address[12] = 127;\n\/\/\t\tm_sendLocator.address[13] = 0;\n\/\/\t\tm_sendLocator.address[14] = 0;\n\/\/\t\tm_sendLocator.address[15] = 1;\n\/\/\t}\n\n\tm_send_socket.open(boost::asio::ip::udp::v4());\n\tm_send_socket.set_option(boost::asio::socket_base::send_buffer_size(this->mp_participant->getSendSocketBufferSize()));\n\t\/\/m_send_socket.set_option( boost::asio::ip::enable_loopback( true ) );\n\tbool not_bind = true;\n\twhile(not_bind)\n\t{\n\t\t\/\/udp::endpoint send_endpoint = udp::endpoint(boost::asio::ip::address_v4(),sendLocator.port);\n\t\tudp::endpoint send_endpoint = udp::endpoint(boost::asio::ip::udp::v4(),m_sendLocator.port);\n\t\t\/\/boost::asio::ip::udp::socket s(sendService,send_endpoint);\n\t\ttry{\n\t\t\tm_send_socket.bind(send_endpoint);\n\t\t\tnot_bind = false;\n\t\t}\n\t\tcatch (boost::system::system_error const& e)\n\t\t{\n\t\t\tpWarning(\"ResourceSend: \"<<e.what()<< \" with socket: \" << send_endpoint << endl);\n\t\t\tm_sendLocator.port++;\n\t\t}\n\t}\n\tboost::asio::socket_base::send_buffer_size option;\n\tm_send_socket.get_option(option);\n\tpInfo (RTPS_YELLOW<<\"ResourceSend: initSend: \" << m_send_socket.local_endpoint()<<\"|| State: \" << m_send_socket.is_open() <<\n\t\t\t\" || buffer size: \" <<option.value()<< RTPS_DEF<<endl);\n\n\t\/\/boost::asio::io_service::work work(sendService);\n\treturn true;\n}\n\n\nResourceSend::~ResourceSend()\n{\n\tpDebugInfo(\"ResourceSend: destructor\"<<endl;);\n\tm_send_socket.close();\n\tm_send_service.stop();\n}\n\nvoid ResourceSend::sendSync(CDRMessage_t* msg, const Locator_t& loc)\n{\n\tboost::lock_guard<ResourceSend> guard(*this);\n\tif(loc.port == 0)\n\t\treturn;\n\tif(loc.kind == LOCATOR_KIND_UDPv4)\n\t{\n\t\tboost::asio::ip::address_v4::bytes_type addr;\n\t\tfor(uint8_t i=0;i<4;i++)\n\t\t\taddr[i] = loc.address[12+i];\n\t\tm_send_endpoint = udp::endpoint(boost::asio::ip::address_v4(addr),loc.port);\n\t}\n\telse if(loc.kind == LOCATOR_KIND_UDPv6)\n\t{\n\t\tboost::asio::ip::address_v6::bytes_type addr;\n\t\tfor(uint8_t i=0;i<16;i++)\n\t\t\taddr[i] = loc.address[i];\n\t\tm_send_endpoint = udp::endpoint(boost::asio::ip::address_v6(addr),loc.port);\n\t}\n\tpInfo(RTPS_YELLOW<< \"ResourceSend: sendSync: \" << msg->length << \" bytes TO endpoint: \" << m_send_endpoint << \" FROM \" << m_send_socket.local_endpoint() << endl);\n\tif(m_send_endpoint.port()>0)\n\t{\n\t\tm_bytes_sent = 0;\n\t\tif(m_send_next)\n\t\t{\n\t\t\ttry {\n\t\t\t\tm_bytes_sent = m_send_socket.send_to(boost::asio::buffer((void*)msg->buffer,msg->length),m_send_endpoint);\n\t\t\t} catch (const std::exception& error) {\n\t\t\t\t\/\/ Should print the actual error message\n\t\t\t\tstd::cerr << error.what() << std::endl;\n\t\t\t}\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_send_next = true;\n\t\t}\n\t\tpInfo (RTPS_YELLOW << \"SENT \" << m_bytes_sent << RTPS_DEF << endl);\n\t}\n\telse if(m_send_endpoint.port()<=0)\n\t{\n\t\tpWarning(\"ResourceSend: sendSync: port invalid\"<<endl);\n\t}\n\telse\n\t\tpError(\"ResourceSend: sendSync: port error\"<<endl);\n}\n\n\n} \/* namespace rtps *\/\n} \/* namespace eprosima *\/\n<commit_msg>Send catch error now with pWarning<commit_after>\/*************************************************************************\n * Copyright (c) 2014 eProsima. All rights reserved.\n *\n * This copy of eProsima RTPS is licensed to you under the terms described in the\n * EPROSIMARTPS_LIBRARY_LICENSE file included in this distribution.\n *\n *************************************************************************\/\n\n\/*\n * ResourceSend.cpp\n *\n *\/\n\n#include \"eprosimartps\/resources\/ResourceSend.h\"\n#include \"eprosimartps\/common\/types\/CDRMessage_t.h\"\n#include \"eprosimartps\/utils\/RTPSLog.h\"\n\n#include \"eprosimartps\/Participant.h\"\n\nusing boost::asio::ip::udp;\n\nnamespace eprosima {\nnamespace rtps {\n\nResourceSend::ResourceSend(ParticipantImpl* par) :\n\tm_send_socket(m_send_service),\n\tm_bytes_sent(0),\n\tm_send_next(true),\n\tmp_participant(par)\n{\n\n}\n\nbool ResourceSend::initSend(const Locator_t& loc)\n{\n\/\/\tboost::asio::ip::address addr;\n\tm_sendLocator = loc;\n\/\/\ttry {\n\/\/\t\tboost::asio::io_service netService;\n\/\/\t\tudp::resolver resolver(netService);\n\/\/\t\tudp::resolver::query query(udp::v4(), \"google.com\", \"\");\n\/\/\t\tudp::resolver::iterator endpoints = resolver.resolve(query);\n\/\/\t\tudp::endpoint ep = *endpoints;\n\/\/\t\tudp::socket socket(netService);\n\/\/\t\tsocket.connect(ep);\n\/\/\t\taddr = socket.local_endpoint().address();\n\/\/\n\/\/\t\tpInfo(\"My IP according to google is: \" << addr.to_string() << endl);\n\/\/\n\/\/\t\tm_sendLocator.address[12] = addr.to_v4().to_bytes()[0];\n\/\/\t\tm_sendLocator.address[13] = addr.to_v4().to_bytes()[1];\n\/\/\t\tm_sendLocator.address[14] = addr.to_v4().to_bytes()[2];\n\/\/\t\tm_sendLocator.address[15] = addr.to_v4().to_bytes()[3];\n\/\/\t}\n\/\/\tcatch (std::exception& e)\n\/\/\t{\n\/\/\t\tstd::cerr << \"Could not deal with socket. Exception: \" << e.what() << std::endl;\n\/\/\t\tm_sendLocator = loc;\n\/\/\t\tm_sendLocator.address[12] = 127;\n\/\/\t\tm_sendLocator.address[13] = 0;\n\/\/\t\tm_sendLocator.address[14] = 0;\n\/\/\t\tm_sendLocator.address[15] = 1;\n\/\/\t}\n\n\tm_send_socket.open(boost::asio::ip::udp::v4());\n\tm_send_socket.set_option(boost::asio::socket_base::send_buffer_size(this->mp_participant->getSendSocketBufferSize()));\n\t\/\/m_send_socket.set_option( boost::asio::ip::enable_loopback( true ) );\n\tbool not_bind = true;\n\twhile(not_bind)\n\t{\n\t\t\/\/udp::endpoint send_endpoint = udp::endpoint(boost::asio::ip::address_v4(),sendLocator.port);\n\t\tudp::endpoint send_endpoint = udp::endpoint(boost::asio::ip::udp::v4(),m_sendLocator.port);\n\t\t\/\/boost::asio::ip::udp::socket s(sendService,send_endpoint);\n\t\ttry{\n\t\t\tm_send_socket.bind(send_endpoint);\n\t\t\tnot_bind = false;\n\t\t}\n\t\tcatch (boost::system::system_error const& e)\n\t\t{\n\t\t\tpWarning(\"ResourceSend: \"<<e.what()<< \" with socket: \" << send_endpoint << endl);\n\t\t\tm_sendLocator.port++;\n\t\t}\n\t}\n\tboost::asio::socket_base::send_buffer_size option;\n\tm_send_socket.get_option(option);\n\tpInfo (RTPS_YELLOW<<\"ResourceSend: initSend: \" << m_send_socket.local_endpoint()<<\"|| State: \" << m_send_socket.is_open() <<\n\t\t\t\" || buffer size: \" <<option.value()<< RTPS_DEF<<endl);\n\n\t\/\/boost::asio::io_service::work work(sendService);\n\treturn true;\n}\n\n\nResourceSend::~ResourceSend()\n{\n\tpDebugInfo(\"ResourceSend: destructor\"<<endl;);\n\tm_send_socket.close();\n\tm_send_service.stop();\n}\n\nvoid ResourceSend::sendSync(CDRMessage_t* msg, const Locator_t& loc)\n{\n\tboost::lock_guard<ResourceSend> guard(*this);\n\tif(loc.port == 0)\n\t\treturn;\n\tif(loc.kind == LOCATOR_KIND_UDPv4)\n\t{\n\t\tboost::asio::ip::address_v4::bytes_type addr;\n\t\tfor(uint8_t i=0;i<4;i++)\n\t\t\taddr[i] = loc.address[12+i];\n\t\tm_send_endpoint = udp::endpoint(boost::asio::ip::address_v4(addr),loc.port);\n\t}\n\telse if(loc.kind == LOCATOR_KIND_UDPv6)\n\t{\n\t\tboost::asio::ip::address_v6::bytes_type addr;\n\t\tfor(uint8_t i=0;i<16;i++)\n\t\t\taddr[i] = loc.address[i];\n\t\tm_send_endpoint = udp::endpoint(boost::asio::ip::address_v6(addr),loc.port);\n\t}\n\tpInfo(RTPS_YELLOW<< \"ResourceSend: sendSync: \" << msg->length << \" bytes TO endpoint: \" << m_send_endpoint << \" FROM \" << m_send_socket.local_endpoint() << endl);\n\tif(m_send_endpoint.port()>0)\n\t{\n\t\tm_bytes_sent = 0;\n\t\tif(m_send_next)\n\t\t{\n\t\t\ttry {\n\t\t\t\tm_bytes_sent = m_send_socket.send_to(boost::asio::buffer((void*)msg->buffer,msg->length),m_send_endpoint);\n\t\t\t} catch (const std::exception& error) {\n\t\t\t\t\/\/ Should print the actual error message\n\t\t\t\tpWarning(error.what() << std::endl);\n\t\t\t}\n\n\t\t}\n\t\telse\n\t\t{\n\t\t\tm_send_next = true;\n\t\t}\n\t\tpInfo (RTPS_YELLOW << \"SENT \" << m_bytes_sent << RTPS_DEF << endl);\n\t}\n\telse if(m_send_endpoint.port()<=0)\n\t{\n\t\tpWarning(\"ResourceSend: sendSync: port invalid\"<<endl);\n\t}\n\telse\n\t\tpError(\"ResourceSend: sendSync: port error\"<<endl);\n}\n\n\n} \/* namespace rtps *\/\n} \/* namespace eprosima *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ Helper program for the linux_dumper class, which creates a bunch of\n\/\/ threads. The first word of each thread's stack is set to the thread\n\/\/ id.\n\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/syscall.h>\n#include <unistd.h>\n\n#if defined(__ARM_EABI__)\n#define TID_PTR_REGISTER \"r3\"\n#elif defined(__i386)\n#define TID_PTR_REGISTER \"ecx\"\n#elif defined(__x86_64)\n#define TID_PTR_REGISTER \"rcx\"\n#else\n#error This test has not been ported to this platform.\n#endif\n\nvoid *thread_function(void *data) {\n pid_t thread_id = syscall(SYS_gettid);\n register pid_t *thread_id_ptr asm(TID_PTR_REGISTER) = &thread_id;\n while (true)\n asm(\"\" : : \"r\" (thread_id_ptr));\n return NULL;\n}\n\nint main(int argc, char *argv[]) {\n int num_threads = atoi(argv[1]);\n if (num_threads < 1) {\n fprintf(stderr, \"ERROR: number of threads is 0\");\n return 1;\n }\n pthread_t threads[num_threads];\n pthread_attr_t thread_attributes;\n pthread_attr_init(&thread_attributes);\n pthread_attr_setdetachstate(&thread_attributes, PTHREAD_CREATE_DETACHED);\n for (int i = 1; i < num_threads; i++) {\n pthread_create(&threads[i], &thread_attributes, &thread_function, NULL);\n }\n thread_function(NULL);\n return 0;\n}\n<commit_msg>[ Mistakenly committed older version of patch. This is the right one. ]<commit_after>\/\/ Copyright (c) 2010, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ Helper program for the linux_dumper class, which creates a bunch of\n\/\/ threads. The first word of each thread's stack is set to the thread\n\/\/ id.\n\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/syscall.h>\n#include <unistd.h>\n\n#if defined(__ARM_EABI__)\n#define TID_PTR_REGISTER \"r3\"\n#elif defined(__i386)\n#define TID_PTR_REGISTER \"ecx\"\n#elif defined(__x86_64)\n#define TID_PTR_REGISTER \"rcx\"\n#else\n#error This test has not been ported to this platform.\n#endif\n\nvoid *thread_function(void *data) {\n volatile pid_t thread_id = syscall(SYS_gettid);\n register volatile pid_t *thread_id_ptr asm(TID_PTR_REGISTER) = &thread_id;\n while (true)\n asm volatile (\"\" : : \"r\" (thread_id_ptr));\n return NULL;\n}\n\nint main(int argc, char *argv[]) {\n int num_threads = atoi(argv[1]);\n if (num_threads < 1) {\n fprintf(stderr, \"ERROR: number of threads is 0\");\n return 1;\n }\n pthread_t threads[num_threads];\n pthread_attr_t thread_attributes;\n pthread_attr_init(&thread_attributes);\n pthread_attr_setdetachstate(&thread_attributes, PTHREAD_CREATE_DETACHED);\n for (int i = 1; i < num_threads; i++) {\n pthread_create(&threads[i], &thread_attributes, &thread_function, NULL);\n }\n thread_function(NULL);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"throttle.hpp\"\n#include <stdexcept>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n\/*\n * Parsing function: for strings we can do better\n *\/\ntemplate<> void Conf::parse<std::string>(const std::string &str, std::string *ret)\n{\n\t*ret = str;\n}\n\n\/*\n * Configuration reader.\n * This function is guaranteed to read in all syntactically correct files, but might also accept others.\n *\/\nConf::Conf(const char *config_fn) {\n\t\/\/ open the file\n\tstd::ifstream conf_file(config_fn);\n\n\t\/\/ read every line and put it in the map\n\tchar line[LINE_LENGTH];\n\tstd::string name;\n\twhile (conf_file) {\n\t\t\/\/ parse: first comes the name of the command\n\t\tconf_file >> name;\n\n\t\t\/\/ if line starts with '#', ignore it\n\t\tif (name[0] == '#') {\n\t\t\tconf_file.ignore(LINE_LENGTH, '\\n');\n\t\t\tcontinue;\n\t\t}\n\n\t\tconf_file.ignore(LINE_LENGTH, '=');\n\t\tconf_file.ignore(LINE_LENGTH, ' ');\n\t\tconf_file.getline(line, LINE_LENGTH);\n\n#ifdef DEBUG\n\t\tstd::cout << \"[Conf] \" << name << \" = \" << line << std::endl;\n#endif\n\n\t\t\/\/ write into map\n\t\tattributes[name] = std::string(line);\n\t}\n}\n\n\/*\n * Construct a command queue. We want to now the parent, where we can write changes to,\n * and which pipe to listen on.\n *\/\nCommQueue::CommQueue(Throttle *parent, const char *pipe_fn) : Throt(parent), comm_pipe(pipe_fn)\n{\n\t\/\/ create the pipe\n\tif (mkfifo(pipe_fn, 0666))\n\t\tthrow std::runtime_error(std::string(\"Could not create pipe \\\"\") + std::string(pipe_fn) + std::string(\"\\\".\"));\n\tcomm_pipe = pipe_fn;\n\n\t\/\/ start the thread\n\tif (pthread_create(&thread, NULL, watchPipe, this))\n\t\tthrow std::runtime_error(\"Could not create thread.\");\n}\n\n\/*\n * Thread main function: `void *obj` should point to the generating object.\n * We watch the pipe for input.\n *\/\nvoid *CommQueue::watchPipe(void *obj)\n{\n\tCommQueue *that = (CommQueue *)obj;\n\n\t\/\/ open the pipe\n\tstd::ifstream pipe(that->comm_pipe, std::ifstream::in);\n\n\t\/\/ watch for input\n\tchar buf[LINE_LENGTH];\n\tdo {\n\t\tpipe.getline(buf, LINE_LENGTH);\n\t\tthat->processCommand(std::string(buf));\n\t} while (buf[0] != '*');\n\n\tthat->Throt->term = true;\n\n\treturn 0;\n}\n\n\/*\n * Process a command coming through the pipe.\n *\/\nvoid CommQueue::processCommand(const std::string comm)\n{\n#ifdef DEBUG\n\tstd::cout << \"[CommQueue] \" << comm << std::endl;\n#endif\n\n\t\/\/ parse command\n\t\/\/ change appropriate variables\n}\n<commit_msg>We shouldn't read the last line twice<commit_after>#include \"throttle.hpp\"\n#include <stdexcept>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n\/*\n * Parsing function: for strings we can do better\n *\/\ntemplate<> void Conf::parse<std::string>(const std::string &str, std::string *ret)\n{\n\t*ret = str;\n}\n\n\/*\n * Configuration reader.\n * This function is guaranteed to read in all syntactically correct files, but might also accept others.\n *\/\nConf::Conf(const char *config_fn) {\n\t\/\/ open the file\n\tstd::ifstream conf_file(config_fn);\n\n\t\/\/ read every line and put it in the map\n\tchar line[LINE_LENGTH];\n\tstd::string name;\n\n\t\/\/ parse: first comes the name of the command\n\twhile (conf_file >> name) {\n\t\t\/\/ if line starts with '#', ignore it\n\t\tif (name[0] == '#') {\n\t\t\tconf_file.ignore(LINE_LENGTH, '\\n');\n\t\t\tcontinue;\n\t\t}\n\n\t\tconf_file.ignore(LINE_LENGTH, '=');\n\t\tconf_file.ignore(LINE_LENGTH, ' ');\n\t\tconf_file.getline(line, LINE_LENGTH);\n\n#ifdef DEBUG\n\t\tstd::cout << \"[Conf] \" << name << \" = \" << line << std::endl;\n#endif\n\n\t\t\/\/ write into map\n\t\tattributes[name] = std::string(line);\n\t}\n}\n\n\/*\n * Construct a command queue. We want to now the parent, where we can write changes to,\n * and which pipe to listen on.\n *\/\nCommQueue::CommQueue(Throttle *parent, const char *pipe_fn) : Throt(parent), comm_pipe(pipe_fn)\n{\n\t\/\/ create the pipe\n\tif (mkfifo(pipe_fn, 0666))\n\t\tthrow std::runtime_error(std::string(\"Could not create pipe \\\"\") + std::string(pipe_fn) + std::string(\"\\\".\"));\n\tcomm_pipe = pipe_fn;\n\n\t\/\/ start the thread\n\tif (pthread_create(&thread, NULL, watchPipe, this))\n\t\tthrow std::runtime_error(\"Could not create thread.\");\n}\n\n\/*\n * Thread main function: `void *obj` should point to the generating object.\n * We watch the pipe for input.\n *\/\nvoid *CommQueue::watchPipe(void *obj)\n{\n\tCommQueue *that = (CommQueue *)obj;\n\n\t\/\/ open the pipe\n\tstd::ifstream pipe(that->comm_pipe, std::ifstream::in);\n\n\t\/\/ watch for input\n\tchar buf[LINE_LENGTH];\n\tdo {\n\t\tpipe.getline(buf, LINE_LENGTH);\n\t\tthat->processCommand(std::string(buf));\n\t} while (buf[0] != '*');\n\n\tthat->Throt->term = true;\n\n\treturn 0;\n}\n\n\/*\n * Process a command coming through the pipe.\n *\/\nvoid CommQueue::processCommand(const std::string comm)\n{\n#ifdef DEBUG\n\tstd::cout << \"[CommQueue] \" << comm << std::endl;\n#endif\n\n\t\/\/ parse command\n\t\/\/ change appropriate variables\n}\n<|endoftext|>"} {"text":"<commit_before>\/************************************************************************************\n** \n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\n*\n*************************************************************************************\/\n\/**\n* @file\t\tg_server_factory.cpp\n* @version \n* @brief \n* @author\tduye\n* @date\t\t2014-10-10\n* @note \n*\n* 1. 2014-10-10 duye Created this file\n* \n*\/\n#pragma once\n<commit_msg>Update g_server_factory.cpp<commit_after>\/************************************************************************************\n** \n* @copyright (c) 2013-2100, ChengDu Duyer Technology Co., LTD. All Right Reserved.\n*\n*************************************************************************************\/\n\/**\n* @file\t\tg_server_factory.cpp\n* @version \n* @brief \n* @author\tduye\n* @date\t\t2014-10-10\n* @note \n*\n* 1. 2014-10-10 duye Created this file\n* \n*\/\n#include <g_server_factory.h>\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ CPPUNIT\n#include <extracppunit\/CppUnitCore.hpp>\n\/\/ StdAir\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasDBParams.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n\/\/ Dsim Test Suite\n#include <test\/dsim\/SimulationTestSuite.hpp>\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test is based on ...\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulationHelper() {\n\n try {\n \n \/\/ Schedule input file name\n const std::string lScheduleInputFilename (\"..\/samples\/schedule01.csv\");\n \n \/\/ O&D input file name\n const std::string lODInputFilename (\"..\/samples\/ond01.csv\");\n\n \/\/ Demand input file name\n const stdair::Filename_T lDemandInputFilename (\"..\/samples\/demand01.csv\");\n\n \/\/ Fare input file name\n const stdair::Filename_T lFareInputFilename (\"..\/samples\/fare01.csv\");\n \n \/\/ Output log File\n const std::string lLogFilename (\"SimulationTestSuite.log\");\n\n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the simulation context\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n const stdair::BasDBParams lDBParams (\"dsim\", \"dsim\",\n \"localhost\", \"3306\",\n \"sim_dsim\");\n DSIM::DSIM_Service dsimService (lLogParams, lDBParams,\n lScheduleInputFilename, lODInputFilename,\n lDemandInputFilename, lFareInputFilename);\n\n \/\/ Perform a simulation\n dsimService.simulate();\n \n } catch (const DSIM::RootException& otexp) {\n std::cerr << \"Standard exception: \" << otexp.what() << std::endl;\n return;\n \n } catch (const std::exception& stde) {\n std::cerr << \"Standard exception: \" << stde.what() << std::endl;\n return;\n \n } catch (...) {\n return;\n }\n \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulation () {\n \/\/ TODO: Check that the simulation goes as expected\n CPPUNIT_ASSERT_NO_THROW ( simpleSimulationHelper(););\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ void SimulationTestSuite::errorCase () {\n\/\/ CPPUNIT_ASSERT (false);\n\/\/ }\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSimulationTestSuite::SimulationTestSuite () {\n _describeKey << \"Running test on simulation\"; \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ M A I N \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCPPUNIT_MAIN()\n\n<commit_msg>[Test] Fixed the DB issue (however, a local MySQL instance must run, and the sim_dsim database must have been created).<commit_after>\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ CPPUNIT\n#include <extracppunit\/CppUnitCore.hpp>\n\/\/ StdAir\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasDBParams.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n\/\/ Dsim Test Suite\n#include <test\/dsim\/SimulationTestSuite.hpp>\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test is based on ...\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulationHelper() {\n\n try {\n \n \/\/ Schedule input file name\n const std::string lScheduleInputFilename (\"..\/samples\/schedule01.csv\");\n \n \/\/ O&D input file name\n const std::string lODInputFilename (\"..\/samples\/ond01.csv\");\n\n \/\/ Demand input file name\n const stdair::Filename_T lDemandInputFilename (\"..\/samples\/demand01.csv\");\n\n \/\/ Fare input file name\n const stdair::Filename_T lFareInputFilename (\"..\/samples\/fare01.csv\");\n \n \/\/ Output log File\n const std::string lLogFilename (\"SimulationTestSuite.log\");\n\n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the simulation context\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n const stdair::BasDBParams lDBParams (\"dsim\", \"dsim\", \"localhost\", \"3306\",\n \"sim_dsim\");\n DSIM::DSIM_Service dsimService (lLogParams, lDBParams,\n lScheduleInputFilename, lODInputFilename,\n lFareInputFilename, lDemandInputFilename);\n\n \/\/ Perform a simulation\n dsimService.simulate();\n\n } catch (const DSIM::RootException& otexp) {\n std::cerr << \"DSim exception: \" << otexp.what() << std::endl;\n \n } catch (const std::exception& stde) {\n std::cerr << \"Standard exception: \" << stde.what() << std::endl;\n }\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulation () {\n \/\/ TODO: Check that the simulation goes as expected\n CPPUNIT_ASSERT_NO_THROW ( simpleSimulationHelper(););\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ void SimulationTestSuite::errorCase () {\n\/\/ CPPUNIT_ASSERT (false);\n\/\/ }\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSimulationTestSuite::SimulationTestSuite () {\n _describeKey << \"Running test on simulation\"; \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ M A I N \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCPPUNIT_MAIN()\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ Helper program for the linux_dumper class, which creates a bunch of\n\/\/ threads. The first word of each thread's stack is set to the thread\n\/\/ id.\n\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/syscall.h>\n#include <unistd.h>\n\n#if defined(__ARM_EABI__)\n#define TID_PTR_REGISTER \"r3\"\n#elif defined(__i386)\n#define TID_PTR_REGISTER \"ecx\"\n#elif defined(__x86_64)\n#define TID_PTR_REGISTER \"rcx\"\n#else\n#error This test has not been ported to this platform.\n#endif\n\nvoid *thread_function(void *data) {\n pid_t thread_id = syscall(SYS_gettid);\n register pid_t *thread_id_ptr asm(TID_PTR_REGISTER) = &thread_id;\n while (true)\n asm(\"\" : : \"r\" (thread_id_ptr));\n return NULL;\n}\n\nint main(int argc, char *argv[]) {\n int num_threads = atoi(argv[1]);\n if (num_threads < 1) {\n fprintf(stderr, \"ERROR: number of threads is 0\");\n return 1;\n }\n pthread_t threads[num_threads];\n pthread_attr_t thread_attributes;\n pthread_attr_init(&thread_attributes);\n pthread_attr_setdetachstate(&thread_attributes, PTHREAD_CREATE_DETACHED);\n for (int i = 1; i < num_threads; i++) {\n pthread_create(&threads[i], &thread_attributes, &thread_function, NULL);\n }\n thread_function(NULL);\n return 0;\n}\n<commit_msg>[ Mistakenly committed older version of patch. This is the right one. ]<commit_after>\/\/ Copyright (c) 2010, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/ Helper program for the linux_dumper class, which creates a bunch of\n\/\/ threads. The first word of each thread's stack is set to the thread\n\/\/ id.\n\n#include <pthread.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/syscall.h>\n#include <unistd.h>\n\n#if defined(__ARM_EABI__)\n#define TID_PTR_REGISTER \"r3\"\n#elif defined(__i386)\n#define TID_PTR_REGISTER \"ecx\"\n#elif defined(__x86_64)\n#define TID_PTR_REGISTER \"rcx\"\n#else\n#error This test has not been ported to this platform.\n#endif\n\nvoid *thread_function(void *data) {\n volatile pid_t thread_id = syscall(SYS_gettid);\n register volatile pid_t *thread_id_ptr asm(TID_PTR_REGISTER) = &thread_id;\n while (true)\n asm volatile (\"\" : : \"r\" (thread_id_ptr));\n return NULL;\n}\n\nint main(int argc, char *argv[]) {\n int num_threads = atoi(argv[1]);\n if (num_threads < 1) {\n fprintf(stderr, \"ERROR: number of threads is 0\");\n return 1;\n }\n pthread_t threads[num_threads];\n pthread_attr_t thread_attributes;\n pthread_attr_init(&thread_attributes);\n pthread_attr_setdetachstate(&thread_attributes, PTHREAD_CREATE_DETACHED);\n for (int i = 1; i < num_threads; i++) {\n pthread_create(&threads[i], &thread_attributes, &thread_function, NULL);\n }\n thread_function(NULL);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2011 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: morlovich@google.com (Maksim Orlovich)\n\n#include \"net\/instaweb\/util\/public\/shared_mem_test_base.h\"\n\n#include <cstddef>\n#include \"base\/scoped_ptr.h\"\n#include \"net\/instaweb\/util\/public\/abstract_mutex.h\"\n#include \"net\/instaweb\/util\/public\/abstract_shared_mem.h\"\n#include \"net\/instaweb\/util\/public\/mock_message_handler.h\"\n#include \"net\/instaweb\/util\/public\/gtest.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n const char kTestSegment[] = \"segment1\";\n const char kOtherSegment[] = \"segment2\";\n} \/\/ namespace\n\nSharedMemTestEnv::~SharedMemTestEnv() {\n}\n\nSharedMemTestEnv::Callback::~Callback() {\n}\n\nSharedMemTestBase::SharedMemTestBase(SharedMemTestEnv* test_env)\n : test_env_(test_env),\n shmem_runtime_(test_env->CreateSharedMemRuntime()) {\n}\n\nbool SharedMemTestBase::CreateChild(TestMethod method) {\n MethodCallback* callback = new MethodCallback(this, method);\n return test_env_->CreateChild(callback);\n}\n\nvoid SharedMemTestBase::TestReadWrite(bool reattach) {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TestReadWriteChild));\n\n if (reattach) {\n seg.reset(AttachDefault());\n }\n\n \/\/ Wait for kid to write out stuff\n while (*seg->Base() != '1') {\n test_env_->ShortSleep();\n }\n\n \/\/ Write out stuff.\n *seg->Base() = '2';\n\n \/\/ Wait for termination.\n test_env_->WaitForChildren();\n seg.reset(NULL);\n DestroyDefault();\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\nvoid SharedMemTestBase::TestReadWriteChild() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n\n \/\/ Write out '1', which the parent will wait for.\n *seg->Base() = '1';\n\n \/\/ Wait for '2' from parent\n while (*seg->Base() != '2') {\n test_env_->ShortSleep();\n }\n}\n\nvoid SharedMemTestBase::TestLarge() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->CreateSegment(kTestSegment, kLarge, &handler_));\n\n \/\/ Make sure everything is zeroed\n for (int c = 0; c < kLarge; ++c) {\n EXPECT_EQ(0, seg->Base()[c]);\n }\n seg.reset(NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TestLargeChild));\n test_env_->WaitForChildren();\n\n seg.reset(shmem_runtime_->AttachToSegment(kTestSegment, kLarge, &handler_));\n for (int i = 0; i < kLarge; i+=4) {\n EXPECT_EQ(i, *IntPtr(seg.get(), i));\n }\n}\n\nvoid SharedMemTestBase::TestLargeChild() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kTestSegment, kLarge, &handler_));\n for (int i = 0; i < kLarge; i+=4) {\n *IntPtr(seg.get(), i) = i;\n }\n}\n\n\/\/ Make sure that 2 segments don't interfere.\nvoid SharedMemTestBase::TestDistinct() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n scoped_ptr<AbstractSharedMemSegment> seg2(\n shmem_runtime_->CreateSegment(kOtherSegment, 4, &handler_));\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg2Child));\n test_env_->WaitForChildren();\n\n EXPECT_EQ('1', *seg->Base());\n EXPECT_EQ('2', *seg2->Base());\n\n seg.reset(NULL);\n seg2.reset(NULL);\n DestroyDefault();\n shmem_runtime_->DestroySegment(kOtherSegment, &handler_);\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\n\/\/ Make sure destruction destroys things properly...\nvoid SharedMemTestBase::TestDestroy() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n test_env_->WaitForChildren();\n EXPECT_EQ('1', *seg->Base());\n\n seg.reset(NULL);\n DestroyDefault();\n\n \/\/ Attach should fail now\n seg.reset(AttachDefault());\n EXPECT_EQ(NULL, seg.get());\n\n \/\/ Newly created one should have zeroed memory\n seg.reset(CreateDefault());\n EXPECT_EQ('\\0', *seg->Base());\n\n DestroyDefault();\n}\n\n\/\/ Make sure that re-creating a segment without a Destroy is safe and\n\/\/ produces a distinct segment\nvoid SharedMemTestBase::TestCreateTwice() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n test_env_->WaitForChildren();\n EXPECT_EQ('1', *seg->Base());\n\n seg.reset(CreateDefault());\n EXPECT_EQ('\\0', *seg->Base());\n}\n\n\/\/ Make sure between two kids see the SHM as well.\nvoid SharedMemTestBase::TestTwoKids() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n seg.reset(NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TwoKidsChild1));\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TwoKidsChild2));\n test_env_->WaitForChildren();\n seg.reset(AttachDefault());\n EXPECT_EQ('2', *seg->Base());\n\n DestroyDefault();\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\nvoid SharedMemTestBase::TwoKidsChild1() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n \/\/ Write out '1', which the other kid will wait for.\n *seg->Base() = '1';\n}\n\nvoid SharedMemTestBase::TwoKidsChild2() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n \/\/ Wait for '1'\n while (*seg->Base() != '1') {\n test_env_->ShortSleep();\n }\n\n *seg->Base() = '2';\n}\n\n\/\/ Test for mutex operation. This attempts to detect lack of mutual exclusion\n\/\/ by hammering on a shared location (protected by a lock) with non-atomic\n\/\/ increments. This test does not guarantee that it will detect a failure\n\/\/ (the schedule might just end up such that things work out), but it's\n\/\/ been found to be effective in practice.\nvoid SharedMemTestBase::TestMutex() {\n size_t mutex_size = shmem_runtime_->SharedMutexSize();\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->CreateSegment(kTestSegment, mutex_size + 4, &handler_));\n ASSERT_EQ(mutex_size, seg->SharedMutexSize());\n\n ASSERT_TRUE(seg->InitializeSharedMutex(0, &handler_));\n seg.reset(\n shmem_runtime_->AttachToSegment(kTestSegment, mutex_size + 4, &handler_));\n\n scoped_ptr<AbstractMutex> mutex(seg->AttachToSharedMutex(0));\n mutex->Lock();\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::MutexChild));\n\n \/\/ Unblock the kid. Before that, it shouldn't have written\n EXPECT_EQ(0, *IntPtr(seg.get(), mutex_size));\n mutex->Unlock();\n\n mutex->Lock();\n EXPECT_TRUE(IncrementStorm(seg.get(), mutex_size));\n mutex->Unlock();\n\n test_env_->WaitForChildren();\n DestroyDefault();\n}\n\nvoid SharedMemTestBase::MutexChild() {\n size_t mutex_size = shmem_runtime_->SharedMutexSize();\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kTestSegment, mutex_size + 4, &handler_));\n\n scoped_ptr<AbstractMutex> mutex(seg->AttachToSharedMutex(0));\n mutex->Lock();\n if (!IncrementStorm(seg.get(), mutex_size)) {\n mutex->Unlock();\n test_env_->ChildFailed();\n return;\n }\n mutex->Unlock();\n}\n\n\/\/ Returns if successful\nbool SharedMemTestBase::IncrementStorm(AbstractSharedMemSegment* seg,\n size_t mutex_size) {\n \/\/ We are either the first or second to do the increments.\n int init = *IntPtr(seg, mutex_size);\n if ((init != 0) && (init != kNumIncrements)) {\n return false;\n }\n\n for (int i = 0; i < kNumIncrements; ++i) {\n ++*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 1)) {\n return false;\n }\n ++*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 2)) {\n return false;\n }\n --*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 1)) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid SharedMemTestBase::WriteSeg1Child() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n *seg->Base() = '1';\n}\n\nvoid SharedMemTestBase::WriteSeg2Child() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kOtherSegment, 4, &handler_));\n *seg->Base() = '2';\n}\n\nAbstractSharedMemSegment* SharedMemTestBase::CreateDefault() {\n return shmem_runtime_->CreateSegment(kTestSegment, 4, &handler_);\n}\n\nAbstractSharedMemSegment* SharedMemTestBase::AttachDefault() {\n return shmem_runtime_->AttachToSegment(kTestSegment, 4, &handler_);\n}\n\nvoid SharedMemTestBase::DestroyDefault() {\n shmem_runtime_->DestroySegment(kTestSegment, &handler_);\n}\n\n} \/\/ namespace net_instaweb\n<commit_msg>Make shared memory test helper methods more robust in the face of failure.<commit_after>\/\/ Copyright 2011 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: morlovich@google.com (Maksim Orlovich)\n\n#include \"net\/instaweb\/util\/public\/shared_mem_test_base.h\"\n\n#include <cstddef>\n#include \"base\/scoped_ptr.h\"\n#include \"net\/instaweb\/util\/public\/abstract_mutex.h\"\n#include \"net\/instaweb\/util\/public\/abstract_shared_mem.h\"\n#include \"net\/instaweb\/util\/public\/mock_message_handler.h\"\n#include \"net\/instaweb\/util\/public\/gtest.h\"\n\nnamespace net_instaweb {\n\nnamespace {\n const char kTestSegment[] = \"segment1\";\n const char kOtherSegment[] = \"segment2\";\n} \/\/ namespace\n\nSharedMemTestEnv::~SharedMemTestEnv() {\n}\n\nSharedMemTestEnv::Callback::~Callback() {\n}\n\nSharedMemTestBase::SharedMemTestBase(SharedMemTestEnv* test_env)\n : test_env_(test_env),\n shmem_runtime_(test_env->CreateSharedMemRuntime()) {\n}\n\nbool SharedMemTestBase::CreateChild(TestMethod method) {\n MethodCallback* callback = new MethodCallback(this, method);\n return test_env_->CreateChild(callback);\n}\n\nvoid SharedMemTestBase::TestReadWrite(bool reattach) {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TestReadWriteChild));\n\n if (reattach) {\n seg.reset(AttachDefault());\n }\n\n \/\/ Wait for kid to write out stuff\n while (*seg->Base() != '1') {\n test_env_->ShortSleep();\n }\n\n \/\/ Write out stuff.\n *seg->Base() = '2';\n\n \/\/ Wait for termination.\n test_env_->WaitForChildren();\n seg.reset(NULL);\n DestroyDefault();\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\nvoid SharedMemTestBase::TestReadWriteChild() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n\n \/\/ Write out '1', which the parent will wait for.\n *seg->Base() = '1';\n\n \/\/ Wait for '2' from parent\n while (*seg->Base() != '2') {\n test_env_->ShortSleep();\n }\n}\n\nvoid SharedMemTestBase::TestLarge() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->CreateSegment(kTestSegment, kLarge, &handler_));\n ASSERT_TRUE(seg.get() != NULL);\n\n \/\/ Make sure everything is zeroed\n for (int c = 0; c < kLarge; ++c) {\n EXPECT_EQ(0, seg->Base()[c]);\n }\n seg.reset(NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TestLargeChild));\n test_env_->WaitForChildren();\n\n seg.reset(shmem_runtime_->AttachToSegment(kTestSegment, kLarge, &handler_));\n for (int i = 0; i < kLarge; i+=4) {\n EXPECT_EQ(i, *IntPtr(seg.get(), i));\n }\n}\n\nvoid SharedMemTestBase::TestLargeChild() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kTestSegment, kLarge, &handler_));\n for (int i = 0; i < kLarge; i+=4) {\n *IntPtr(seg.get(), i) = i;\n }\n}\n\n\/\/ Make sure that 2 segments don't interfere.\nvoid SharedMemTestBase::TestDistinct() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n scoped_ptr<AbstractSharedMemSegment> seg2(\n shmem_runtime_->CreateSegment(kOtherSegment, 4, &handler_));\n ASSERT_TRUE(seg2.get() != NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg2Child));\n test_env_->WaitForChildren();\n\n EXPECT_EQ('1', *seg->Base());\n EXPECT_EQ('2', *seg2->Base());\n\n seg.reset(NULL);\n seg2.reset(NULL);\n DestroyDefault();\n shmem_runtime_->DestroySegment(kOtherSegment, &handler_);\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\n\/\/ Make sure destruction destroys things properly...\nvoid SharedMemTestBase::TestDestroy() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n test_env_->WaitForChildren();\n EXPECT_EQ('1', *seg->Base());\n\n seg.reset(NULL);\n DestroyDefault();\n\n \/\/ Attach should fail now\n seg.reset(AttachDefault());\n EXPECT_EQ(NULL, seg.get());\n\n \/\/ Newly created one should have zeroed memory\n seg.reset(CreateDefault());\n EXPECT_EQ('\\0', *seg->Base());\n\n DestroyDefault();\n}\n\n\/\/ Make sure that re-creating a segment without a Destroy is safe and\n\/\/ produces a distinct segment\nvoid SharedMemTestBase::TestCreateTwice() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::WriteSeg1Child));\n test_env_->WaitForChildren();\n EXPECT_EQ('1', *seg->Base());\n\n seg.reset(CreateDefault());\n EXPECT_EQ('\\0', *seg->Base());\n}\n\n\/\/ Make sure between two kids see the SHM as well.\nvoid SharedMemTestBase::TestTwoKids() {\n scoped_ptr<AbstractSharedMemSegment> seg(CreateDefault());\n ASSERT_TRUE(seg.get() != NULL);\n seg.reset(NULL);\n\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TwoKidsChild1));\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::TwoKidsChild2));\n test_env_->WaitForChildren();\n seg.reset(AttachDefault());\n EXPECT_EQ('2', *seg->Base());\n\n DestroyDefault();\n EXPECT_EQ(0, handler_.SeriousMessages());\n}\n\nvoid SharedMemTestBase::TwoKidsChild1() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n ASSERT_TRUE(seg.get() != NULL);\n \/\/ Write out '1', which the other kid will wait for.\n *seg->Base() = '1';\n}\n\nvoid SharedMemTestBase::TwoKidsChild2() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n ASSERT_TRUE(seg.get() != NULL);\n \/\/ Wait for '1'\n while (*seg->Base() != '1') {\n test_env_->ShortSleep();\n }\n\n *seg->Base() = '2';\n}\n\n\/\/ Test for mutex operation. This attempts to detect lack of mutual exclusion\n\/\/ by hammering on a shared location (protected by a lock) with non-atomic\n\/\/ increments. This test does not guarantee that it will detect a failure\n\/\/ (the schedule might just end up such that things work out), but it's\n\/\/ been found to be effective in practice.\nvoid SharedMemTestBase::TestMutex() {\n size_t mutex_size = shmem_runtime_->SharedMutexSize();\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->CreateSegment(kTestSegment, mutex_size + 4, &handler_));\n ASSERT_TRUE(seg.get() != NULL);\n ASSERT_EQ(mutex_size, seg->SharedMutexSize());\n\n ASSERT_TRUE(seg->InitializeSharedMutex(0, &handler_));\n seg.reset(\n shmem_runtime_->AttachToSegment(kTestSegment, mutex_size + 4, &handler_));\n\n scoped_ptr<AbstractMutex> mutex(seg->AttachToSharedMutex(0));\n mutex->Lock();\n ASSERT_TRUE(CreateChild(&SharedMemTestBase::MutexChild));\n\n \/\/ Unblock the kid. Before that, it shouldn't have written\n EXPECT_EQ(0, *IntPtr(seg.get(), mutex_size));\n mutex->Unlock();\n\n mutex->Lock();\n EXPECT_TRUE(IncrementStorm(seg.get(), mutex_size));\n mutex->Unlock();\n\n test_env_->WaitForChildren();\n DestroyDefault();\n}\n\nvoid SharedMemTestBase::MutexChild() {\n size_t mutex_size = shmem_runtime_->SharedMutexSize();\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kTestSegment, mutex_size + 4, &handler_));\n ASSERT_TRUE(seg.get() != NULL);\n\n scoped_ptr<AbstractMutex> mutex(seg->AttachToSharedMutex(0));\n mutex->Lock();\n if (!IncrementStorm(seg.get(), mutex_size)) {\n mutex->Unlock();\n test_env_->ChildFailed();\n return;\n }\n mutex->Unlock();\n}\n\n\/\/ Returns if successful\nbool SharedMemTestBase::IncrementStorm(AbstractSharedMemSegment* seg,\n size_t mutex_size) {\n \/\/ We are either the first or second to do the increments.\n int init = *IntPtr(seg, mutex_size);\n if ((init != 0) && (init != kNumIncrements)) {\n return false;\n }\n\n for (int i = 0; i < kNumIncrements; ++i) {\n ++*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 1)) {\n return false;\n }\n ++*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 2)) {\n return false;\n }\n --*IntPtr(seg, mutex_size);\n if (*IntPtr(seg, mutex_size) != (i + init + 1)) {\n return false;\n }\n }\n\n return true;\n}\n\nvoid SharedMemTestBase::WriteSeg1Child() {\n scoped_ptr<AbstractSharedMemSegment> seg(AttachDefault());\n ASSERT_TRUE(seg.get() != NULL);\n *seg->Base() = '1';\n}\n\nvoid SharedMemTestBase::WriteSeg2Child() {\n scoped_ptr<AbstractSharedMemSegment> seg(\n shmem_runtime_->AttachToSegment(kOtherSegment, 4, &handler_));\n ASSERT_TRUE(seg.get() != NULL);\n *seg->Base() = '2';\n}\n\nAbstractSharedMemSegment* SharedMemTestBase::CreateDefault() {\n return shmem_runtime_->CreateSegment(kTestSegment, 4, &handler_);\n}\n\nAbstractSharedMemSegment* SharedMemTestBase::AttachDefault() {\n return shmem_runtime_->AttachToSegment(kTestSegment, 4, &handler_);\n}\n\nvoid SharedMemTestBase::DestroyDefault() {\n shmem_runtime_->DestroySegment(kTestSegment, &handler_);\n}\n\n} \/\/ namespace net_instaweb\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Vulkan: fix dummy type for disabled attribs.<commit_after><|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n =========================================================================*\/\n\n#include \"otbOpticalCalibration.h\"\n\n#include <iostream>\n\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n\n#include \"otbImageToLuminanceImageFilter.h\"\n#include \"otbLuminanceToReflectanceImageFilter.h\"\n#include \"otbReflectanceToSurfaceReflectanceImageFilter.h\"\n\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbStandardWriterWatcher.h\"\n#include \"otbMultiplyByScalarImageFilter.h\"\n\nnamespace otb\n{\n\nint OpticalCalibration::Describe(ApplicationDescriptor* descriptor)\n{\n descriptor->SetName(\"OpticalCalibration\");\n descriptor->SetDescription(\"Perform optical calibration TOA\/TOC(Top Of Atmosphere\/Top Of Canopy). Output image is in milli-reflectance.\");\n descriptor->AddInputImage();\n descriptor->AddOutputImage();\n descriptor->AddOptionNParams(\"Level\",\n \"Level of calibration TOA(Top Of Atmosphere) or TOC(Top Of Canopy) (default is TOA)\",\n \"level\", false, otb::ApplicationDescriptor::String);\n descriptor->AddOption(\"RelativeSpectralResponseFile\",\"Sensor relative spectral response file(by default the application gets these informations in the metadata)\",\"rsr\", 1, false, otb::ApplicationDescriptor::FileName);\n descriptor->AddOption(\"AerosolModel\",\"AerosolModel: NO_AEROSOL(0), CONTINENTAL(1), MARITIME(2), URBAN(3), DESERTIC(5); default 0\",\"aerosol\", 1, false, otb::ApplicationDescriptor::Integer);\n descriptor->AddOption(\"OzoneAmount\",\"Amount of Ozone \",\"oz\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"WaterVaporAmount\",\"WaterVaporAmount \",\"wa\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AtmosphericPressure\",\"Atmospheric pressure \",\"atmo\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AerosolOptical\",\"AerosolOptical \",\"opt\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AeronetFile\",\"Aeronet file to get atmospheric parameters\",\"aeronet\", 1, false, otb::ApplicationDescriptor::FileName);\n descriptor->AddOption(\"AvailableMemory\",\"Set the maximum of available memory for the pipeline execution in mega bytes (optional, 256 by default)\",\"ram\", 1, false, otb::ApplicationDescriptor::Integer);\n return EXIT_SUCCESS;\n}\n\nint OpticalCalibration::Execute(otb::ApplicationOptionsResult* parseResult)\n{\n typedef otb::VectorImage<unsigned short int, 2> ImageType;\n typedef otb::VectorImage<float, 2> FloatImageType;\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<ImageType> WriterType;\n\n typedef ImageToLuminanceImageFilter<ImageType, FloatImageType> ImageToLuminanceImageFilterType;\n typedef LuminanceToReflectanceImageFilter<FloatImageType,\n FloatImageType> LuminanceToReflectanceImageFilterType;\n typedef otb::MultiplyByScalarImageFilter<FloatImageType, ImageType> ScaleFilterType;\n typedef ReflectanceToSurfaceReflectanceImageFilter<FloatImageType,\n FloatImageType> ReflectanceToSurfaceReflectanceImageFilterType;\n typedef ReflectanceToSurfaceReflectanceImageFilterType::FilterFunctionValuesType FilterFunctionValuesType;\n typedef FilterFunctionValuesType::ValuesVectorType ValuesVectorType;\n typedef AtmosphericCorrectionParameters AtmosphericCorrectionParametersType;\n typedef AtmosphericCorrectionParametersType::AerosolModelType AerosolModelType;\n\n \/\/ Read input image information\n ReaderType::Pointer reader=ReaderType::New();\n reader->SetFileName(parseResult->GetInputImage().c_str());\n reader->GenerateOutputInformation();\n\n \/\/Check if valid metadata informations are available to compute ImageToLuminance and LuminanceToReflectance\n itk::MetaDataDictionary dict = reader->GetOutput()->GetMetaDataDictionary();\n OpticalImageMetadataInterface::Pointer lImageMetadataInterface = OpticalImageMetadataInterfaceFactory::CreateIMI(dict);\n \/\/ Test if needed data are available.\n try\n {\n \/\/ ImageToLuminance\n lImageMetadataInterface->GetPhysicalGain();\n lImageMetadataInterface->GetPhysicalBias();\n\n \/\/ LuminanceToReflectance\n lImageMetadataInterface->GetDay();\n lImageMetadataInterface->GetMonth();\n\n lImageMetadataInterface->GetSolarIrradiance();\n lImageMetadataInterface->GetSunElevation();\n\n }\n catch (itk::ExceptionObject& err)\n {\n std::cout << \"Invalid input image medadata. The parsing returns the following error:\\n\" << std::endl;\n return EXIT_FAILURE;\n }\n\n ImageToLuminanceImageFilterType ::Pointer imageToLuminanceFilter = ImageToLuminanceImageFilterType::New();\n LuminanceToReflectanceImageFilterType::Pointer luminanceToReflectanceFilter = LuminanceToReflectanceImageFilterType::New();\n ReflectanceToSurfaceReflectanceImageFilterType::Pointer reflectanceToSurfaceReflectanceFilter = ReflectanceToSurfaceReflectanceImageFilterType::New();\n\n imageToLuminanceFilter->SetInput(reader->GetOutput());\n luminanceToReflectanceFilter->SetInput(imageToLuminanceFilter->GetOutput());\n reflectanceToSurfaceReflectanceFilter->SetInput(luminanceToReflectanceFilter->GetOutput());\n\n ScaleFilterType::Pointer scaleFilter = ScaleFilterType::New();\n scaleFilter->SetCoef(1000.);\n\n if(parseResult->GetParameterString(\"Level\") == \"toc\")\n {\n AtmosphericCorrectionParametersType::Pointer atmosphericParam = reflectanceToSurfaceReflectanceFilter->GetCorrectionParameters();\n\n AerosolModelType aeroMod = AtmosphericCorrectionParametersType::NO_AEROSOL;\n\n if(parseResult->IsOptionPresent(\"AerosolModel\"))\n {\n aeroMod = static_cast<AerosolModelType>(parseResult->GetParameterUInt(\"AerosolModel\"));\n }\n atmosphericParam->SetAerosolModel(static_cast<AerosolModelType>(aeroMod));\n\n double ozoneAmount = 0.;\n double waterVaporAmount = 2.5;\n double atmosphericPressure = 1030.;\n double aerosolOptical = 0.2;\n\n if (parseResult->IsOptionPresent(\"OzoneAmount\"))\n {\n ozoneAmount = parseResult->GetParameterFloat(\"OzoneAmount\");\n }\n atmosphericParam->SetOzoneAmount(ozoneAmount);\n\n if (parseResult->IsOptionPresent(\"WaterVaporAmount\"))\n {\n waterVaporAmount = parseResult->GetParameterFloat(\"WaterVaporAmount\");\n }\n atmosphericParam->SetWaterVaporAmount(waterVaporAmount);\n\n if (parseResult->IsOptionPresent(\"AtmosphericPressure\"))\n {\n atmosphericPressure = parseResult->GetParameterFloat(\"AtmosphericPressure\");\n }\n atmosphericParam->SetAtmosphericPressure(atmosphericPressure);\n\n if (parseResult->IsOptionPresent(\"AerosolOptical\"))\n {\n aerosolOptical = parseResult->GetParameterFloat(\"AerosolOptical\");\n }\n atmosphericParam->SetAerosolOptical(aerosolOptical);\n\n if (parseResult->IsOptionPresent(\"RelativeSpectralResponseFile\"))\n {\n reflectanceToSurfaceReflectanceFilter->SetFilterFunctionValuesFileName(parseResult->GetParameterString(\"RelativeSpectralResponseFile\", 0));\n }\n else\n {\n atmosphericParam->SetWavelengthSpectralBand(lImageMetadataInterface->GetSpectralSensitivity());\n }\n\n if (parseResult->IsOptionPresent(\"AeronetFile\"))\n {\n reflectanceToSurfaceReflectanceFilter->SetAeronetFileName(parseResult->GetParameterString(\"AeronetFile\", 0));\n }\n\n AtmosphericRadiativeTerms::Pointer radTerms = AtmosphericRadiativeTerms::New();\n radTerms->ValuesInitialization(reader->GetOutput()->GetNumberOfComponentsPerPixel());\n reflectanceToSurfaceReflectanceFilter->SetAtmosphericRadiativeTerms(radTerms);\n\n reflectanceToSurfaceReflectanceFilter->SetIsSetAtmosphericRadiativeTerms(true);\n reflectanceToSurfaceReflectanceFilter->GenerateAtmosphericRadiativeTerms();\n reflectanceToSurfaceReflectanceFilter->GenerateParameters();\n reflectanceToSurfaceReflectanceFilter->SetUseGenerateParameters(false);\n\n \/\/rescale the surface reflectance in milli-reflectance\n scaleFilter->SetInput(reflectanceToSurfaceReflectanceFilter->GetOutput());\n }\n else\n {\n \/\/Rescale luminanceToReflectance filter output (TOA level)\n scaleFilter->SetInput(luminanceToReflectanceFilter->GetOutput());\n }\n\n \/\/Instantiate the writer\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName(parseResult->GetOutputImage());\n writer->SetInput(scaleFilter->GetOutput());\n writer->SetWriteGeomFile(true);\n\n unsigned int ram = 256;\n if (parseResult->IsOptionPresent(\"AvailableMemory\"))\n {\n ram = parseResult->GetParameterUInt(\"AvailableMemory\");\n }\n writer->SetAutomaticTiledStreaming(ram);\n\n otb::StandardWriterWatcher watcher(writer,\"OpticalCalibration\");\n writer->Update();\n\n return EXIT_SUCCESS;\n}\n}\n<commit_msg>WRG: unused variable<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n =========================================================================*\/\n\n#include \"otbOpticalCalibration.h\"\n\n#include <iostream>\n\n#include \"otbVectorImage.h\"\n#include \"otbImageFileReader.h\"\n\n#include \"otbImageToLuminanceImageFilter.h\"\n#include \"otbLuminanceToReflectanceImageFilter.h\"\n#include \"otbReflectanceToSurfaceReflectanceImageFilter.h\"\n\n#include \"otbStreamingImageFileWriter.h\"\n#include \"otbStandardWriterWatcher.h\"\n#include \"otbMultiplyByScalarImageFilter.h\"\n\nnamespace otb\n{\n\nint OpticalCalibration::Describe(ApplicationDescriptor* descriptor)\n{\n descriptor->SetName(\"OpticalCalibration\");\n descriptor->SetDescription(\"Perform optical calibration TOA\/TOC(Top Of Atmosphere\/Top Of Canopy). Output image is in milli-reflectance.\");\n descriptor->AddInputImage();\n descriptor->AddOutputImage();\n descriptor->AddOptionNParams(\"Level\",\n \"Level of calibration TOA(Top Of Atmosphere) or TOC(Top Of Canopy) (default is TOA)\",\n \"level\", false, otb::ApplicationDescriptor::String);\n descriptor->AddOption(\"RelativeSpectralResponseFile\",\"Sensor relative spectral response file(by default the application gets these informations in the metadata)\",\"rsr\", 1, false, otb::ApplicationDescriptor::FileName);\n descriptor->AddOption(\"AerosolModel\",\"AerosolModel: NO_AEROSOL(0), CONTINENTAL(1), MARITIME(2), URBAN(3), DESERTIC(5); default 0\",\"aerosol\", 1, false, otb::ApplicationDescriptor::Integer);\n descriptor->AddOption(\"OzoneAmount\",\"Amount of Ozone \",\"oz\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"WaterVaporAmount\",\"WaterVaporAmount \",\"wa\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AtmosphericPressure\",\"Atmospheric pressure \",\"atmo\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AerosolOptical\",\"AerosolOptical \",\"opt\", 1, false, otb::ApplicationDescriptor::Real);\n descriptor->AddOption(\"AeronetFile\",\"Aeronet file to get atmospheric parameters\",\"aeronet\", 1, false, otb::ApplicationDescriptor::FileName);\n descriptor->AddOption(\"AvailableMemory\",\"Set the maximum of available memory for the pipeline execution in mega bytes (optional, 256 by default)\",\"ram\", 1, false, otb::ApplicationDescriptor::Integer);\n return EXIT_SUCCESS;\n}\n\nint OpticalCalibration::Execute(otb::ApplicationOptionsResult* parseResult)\n{\n typedef otb::VectorImage<unsigned short int, 2> ImageType;\n typedef otb::VectorImage<float, 2> FloatImageType;\n typedef otb::ImageFileReader<ImageType> ReaderType;\n typedef otb::StreamingImageFileWriter<ImageType> WriterType;\n\n typedef ImageToLuminanceImageFilter<ImageType, FloatImageType> ImageToLuminanceImageFilterType;\n typedef LuminanceToReflectanceImageFilter<FloatImageType,\n FloatImageType> LuminanceToReflectanceImageFilterType;\n typedef otb::MultiplyByScalarImageFilter<FloatImageType, ImageType> ScaleFilterType;\n typedef ReflectanceToSurfaceReflectanceImageFilter<FloatImageType,\n FloatImageType> ReflectanceToSurfaceReflectanceImageFilterType;\n typedef ReflectanceToSurfaceReflectanceImageFilterType::FilterFunctionValuesType FilterFunctionValuesType;\n typedef FilterFunctionValuesType::ValuesVectorType ValuesVectorType;\n typedef AtmosphericCorrectionParameters AtmosphericCorrectionParametersType;\n typedef AtmosphericCorrectionParametersType::AerosolModelType AerosolModelType;\n\n \/\/ Read input image information\n ReaderType::Pointer reader=ReaderType::New();\n reader->SetFileName(parseResult->GetInputImage().c_str());\n reader->GenerateOutputInformation();\n\n \/\/Check if valid metadata informations are available to compute ImageToLuminance and LuminanceToReflectance\n itk::MetaDataDictionary dict = reader->GetOutput()->GetMetaDataDictionary();\n OpticalImageMetadataInterface::Pointer lImageMetadataInterface = OpticalImageMetadataInterfaceFactory::CreateIMI(dict);\n \/\/ Test if needed data are available.\n try\n {\n \/\/ ImageToLuminance\n lImageMetadataInterface->GetPhysicalGain();\n lImageMetadataInterface->GetPhysicalBias();\n\n \/\/ LuminanceToReflectance\n lImageMetadataInterface->GetDay();\n lImageMetadataInterface->GetMonth();\n\n lImageMetadataInterface->GetSolarIrradiance();\n lImageMetadataInterface->GetSunElevation();\n\n }\n catch (itk::ExceptionObject& err)\n {\n std::cout << \"Invalid input image medadata. The parsing returns the following error:\\n\" << err << std::endl;\n return EXIT_FAILURE;\n }\n\n ImageToLuminanceImageFilterType ::Pointer imageToLuminanceFilter = ImageToLuminanceImageFilterType::New();\n LuminanceToReflectanceImageFilterType::Pointer luminanceToReflectanceFilter = LuminanceToReflectanceImageFilterType::New();\n ReflectanceToSurfaceReflectanceImageFilterType::Pointer reflectanceToSurfaceReflectanceFilter = ReflectanceToSurfaceReflectanceImageFilterType::New();\n\n imageToLuminanceFilter->SetInput(reader->GetOutput());\n luminanceToReflectanceFilter->SetInput(imageToLuminanceFilter->GetOutput());\n reflectanceToSurfaceReflectanceFilter->SetInput(luminanceToReflectanceFilter->GetOutput());\n\n ScaleFilterType::Pointer scaleFilter = ScaleFilterType::New();\n scaleFilter->SetCoef(1000.);\n\n if(parseResult->GetParameterString(\"Level\") == \"toc\")\n {\n AtmosphericCorrectionParametersType::Pointer atmosphericParam = reflectanceToSurfaceReflectanceFilter->GetCorrectionParameters();\n\n AerosolModelType aeroMod = AtmosphericCorrectionParametersType::NO_AEROSOL;\n\n if(parseResult->IsOptionPresent(\"AerosolModel\"))\n {\n aeroMod = static_cast<AerosolModelType>(parseResult->GetParameterUInt(\"AerosolModel\"));\n }\n atmosphericParam->SetAerosolModel(static_cast<AerosolModelType>(aeroMod));\n\n double ozoneAmount = 0.;\n double waterVaporAmount = 2.5;\n double atmosphericPressure = 1030.;\n double aerosolOptical = 0.2;\n\n if (parseResult->IsOptionPresent(\"OzoneAmount\"))\n {\n ozoneAmount = parseResult->GetParameterFloat(\"OzoneAmount\");\n }\n atmosphericParam->SetOzoneAmount(ozoneAmount);\n\n if (parseResult->IsOptionPresent(\"WaterVaporAmount\"))\n {\n waterVaporAmount = parseResult->GetParameterFloat(\"WaterVaporAmount\");\n }\n atmosphericParam->SetWaterVaporAmount(waterVaporAmount);\n\n if (parseResult->IsOptionPresent(\"AtmosphericPressure\"))\n {\n atmosphericPressure = parseResult->GetParameterFloat(\"AtmosphericPressure\");\n }\n atmosphericParam->SetAtmosphericPressure(atmosphericPressure);\n\n if (parseResult->IsOptionPresent(\"AerosolOptical\"))\n {\n aerosolOptical = parseResult->GetParameterFloat(\"AerosolOptical\");\n }\n atmosphericParam->SetAerosolOptical(aerosolOptical);\n\n if (parseResult->IsOptionPresent(\"RelativeSpectralResponseFile\"))\n {\n reflectanceToSurfaceReflectanceFilter->SetFilterFunctionValuesFileName(parseResult->GetParameterString(\"RelativeSpectralResponseFile\", 0));\n }\n else\n {\n atmosphericParam->SetWavelengthSpectralBand(lImageMetadataInterface->GetSpectralSensitivity());\n }\n\n if (parseResult->IsOptionPresent(\"AeronetFile\"))\n {\n reflectanceToSurfaceReflectanceFilter->SetAeronetFileName(parseResult->GetParameterString(\"AeronetFile\", 0));\n }\n\n AtmosphericRadiativeTerms::Pointer radTerms = AtmosphericRadiativeTerms::New();\n radTerms->ValuesInitialization(reader->GetOutput()->GetNumberOfComponentsPerPixel());\n reflectanceToSurfaceReflectanceFilter->SetAtmosphericRadiativeTerms(radTerms);\n\n reflectanceToSurfaceReflectanceFilter->SetIsSetAtmosphericRadiativeTerms(true);\n reflectanceToSurfaceReflectanceFilter->GenerateAtmosphericRadiativeTerms();\n reflectanceToSurfaceReflectanceFilter->GenerateParameters();\n reflectanceToSurfaceReflectanceFilter->SetUseGenerateParameters(false);\n\n \/\/rescale the surface reflectance in milli-reflectance\n scaleFilter->SetInput(reflectanceToSurfaceReflectanceFilter->GetOutput());\n }\n else\n {\n \/\/Rescale luminanceToReflectance filter output (TOA level)\n scaleFilter->SetInput(luminanceToReflectanceFilter->GetOutput());\n }\n\n \/\/Instantiate the writer\n WriterType::Pointer writer = WriterType::New();\n writer->SetFileName(parseResult->GetOutputImage());\n writer->SetInput(scaleFilter->GetOutput());\n writer->SetWriteGeomFile(true);\n\n unsigned int ram = 256;\n if (parseResult->IsOptionPresent(\"AvailableMemory\"))\n {\n ram = parseResult->GetParameterUInt(\"AvailableMemory\");\n }\n writer->SetAutomaticTiledStreaming(ram);\n\n otb::StandardWriterWatcher watcher(writer,\"OpticalCalibration\");\n writer->Update();\n\n return EXIT_SUCCESS;\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MS5837.h\"\n#include <Wire.h>\n\n#define MS5837_ADDR 0x76 \n#define MS5837_RESET 0x1E\n#define MS5837_ADC_READ 0x00\n#define MS5837_PROM_READ 0xA0\n#define MS5837_CONVERT_D1_8192 0x4A\n#define MS5837_CONVERT_D2_8192 0x5A\n\nMS5837::MS5837() {\n\tfluidDensity = 1029;\n}\n\nvoid MS5837::init() {\n\t\/\/ Reset the MS5837, per datasheet\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_RESET);\n\tWire.endTransmission();\n\n\t\/\/ Wait for reset to complete\n\tdelay(10);\n\n\t\/\/ Read calibration values and CRC\n\tfor ( uint8_t i = 0 ; i < 8 ; i++ ) {\n\t\tWire.beginTransmission(MS5837_ADDR);\n\t\tWire.write(MS5837_PROM_READ+i*2);\n\t\tWire.endTransmission();\n\n\t\tWire.requestFrom(MS5837_ADDR,2);\n\t\tC[i] = (Wire.read() << 8) | Wire.read();\n\t}\n\n\t\/\/ Verify that data is correct with CRC\n\tuint8_t crcRead = C[0] >> 12;\n\tuint8_t crcCalculated = crc4(C);\n\n\tif ( crcCalculated == crcRead ) {\n\t\t\/\/ Success\n\t} else {\n\t\t\/\/ Failure - try again?\n\t}\n}\n\nvoid MS5837::setFluidDensity(float density) {\n\tfluidDensity = density;\n}\n\nvoid MS5837::read() {\n\t\/\/ Request D1 conversion\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_CONVERT_D1_8192);\n\tWire.endTransmission();\n\n\tdelay(20); \/\/ Max conversion time per datasheet\n\t\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_ADC_READ);\n\tWire.endTransmission();\n\n \tWire.requestFrom(MS5837_ADDR,3);\n\tD1 = 0;\n\tD1 = Wire.read();\n\tD1 = (D1 << 8) | Wire.read();\n\tD1 = (D1 << 8) | Wire.read();\n\t\n\t\/\/ Request D2 conversion\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_CONVERT_D2_8192);\n\tWire.endTransmission();\n\n\tdelay(20); \/\/ Max conversion time per datasheet\n\t\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_ADC_READ);\n\tWire.endTransmission();\n\n\tWire.requestFrom(MS5837_ADDR,3);\n\tD2 = 0;\n\tD2 = Wire.read();\n\tD2 = (D2 << 8) | Wire.read();\n\tD2 = (D2 << 8) | Wire.read();\n\t\n\tSerial.println(\"----\");\n\n\tcalculate();\n}\n\nvoid MS5837::readTestCase() {\n\tC[0] = 0;\n\tC[1] = 34982;\n\tC[2] = 36352;\n\tC[3] = 20328;\n\tC[4] = 22354;\n\tC[5] = 26646;\n\tC[6] = 26146;\n\tC[7] = 0;\n\n\tD1 = 4958179;\n\tD2 = 6815414;\n\n\tcalculate();\n}\n\nvoid MS5837::calculate() {\n\t\/\/ Given C1-C6 and D1, D2, calculated TEMP and P\n\t\/\/ Do conversion first and then second order temp compensation\n\t\n\tint32_t dT;\n\tint64_t SENS;\n\tint64_t OFF;\n\tint32_t SENSi; \n\tint32_t OFFi; \n\tint32_t Ti; \n\tint64_t OFF2;\n\tint64_t SENS2;\n\t\n\t\/\/ Terms called\n\tdT = D2-uint32_t(C[5])*256l;\n\tSENS = int64_t(C[1])*32768l+(int64_t(C[3])*dT)\/256l;\n\tOFF = int64_t(C[2])*65536l+(int64_t(C[4])*dT)\/128l;\n\t\n\t\n\t\/\/Temp and P conversion\n\tTEMP = 2000l+int64_t(dT)*C[6]\/8388608LL;\n\tP = (D1*SENS\/(2097152l)-OFF)\/(8192l);\n\t\n\t\/\/Second order compensation\n\tif((TEMP\/100)<20){ \/\/Low temp\n\t\tTi = (3*int64_t(dT)*int64_t(dT))\/8589934592l;\n\t\tOFFi = (3*(TEMP-2000)*(TEMP-2000))\/2;\n\t\tSENSi = (5*(TEMP-2000)*(TEMP-2000))\/8;\n\t\tif((TEMP\/100)<-15){ \/\/Very low temp\n\t\t\tOFFi = OFFi+7*(TEMP+1500l)*(TEMP+1500l);\n\t\t\tSENSi = SENSi+4*(TEMP+1500l)*(TEMP+1500l);\n\t\t}\n\t}\n\telse if((TEMP\/100)>=20){ \/\/High temp\n\t\tTi = 2*(int64_t(dT)*int64_t(dT))\/(137438953472l);\n\t\tOFFi = 1*((TEMP-2000)*(TEMP-2000))\/16;\n\t\tSENSi = 0;\n\t}\n\t\n\tOFF2 = OFF-OFFi; \/\/Calculate pressure and temp second order\n\tSENS2 = SENS-SENSi;\n\t\n\tTEMP = (TEMP-Ti);\n\tP = (((D1*SENS2)\/2097152l-OFF2)\/8192l);\n}\n\nfloat MS5837::pressure(float conversion) {\n\treturn P\/10.0f*conversion;\n}\n\nfloat MS5837::temperature() {\n\treturn TEMP\/100.0f;\n}\n\nfloat MS5837::depth() {\n\treturn (pressure(MS5837::Pa)-101300)\/(fluidDensity*9.80665);\n}\n\nfloat MS5837::altitude() {\n\treturn 0.0f;\n}\n\nuint8_t MS5837::crc4(uint16_t n_prom[]) {\n\tuint16_t n_rem = 0;\n\n\tn_prom[0] = ((n_prom[0]) & 0x0FFF);\n\tn_prom[7] = 0;\n\n\tfor ( uint8_t i = 0 ; i < 16; i++ ) {\n\t\tif ( i%2 == 1 ) {\n\t\t\tn_rem ^= (uint16_t)((n_prom[i>>1]) & 0x00FF0);\n\t\t} else {\n\t\t\tn_rem ^= (uint16_t)(n_prom[i>>1] >> 8);\n\t\t}\n\t\tfor ( uint8_t n_bit = 8 ; n_bit > 0 ; n_bit-- ) {\n\t\t\tif ( n_rem & 0x8000 ) {\n\t\t\t\tn_rem = (n_rem << 1) ^ 0x3000;\n\t\t\t} else {\n\t\t\t\tn_rem = (n_rem << 1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tn_rem = ((n_rem >> 12) & 0x000F);\n\n\treturn n_rem ^ 0x00;\n}<commit_msg>Now functions, may need to edit second order compensation functions.<commit_after>#include \"MS5837.h\"\n#include <Wire.h>\n\n#define MS5837_ADDR 0x76 \n#define MS5837_RESET 0x1E\n#define MS5837_ADC_READ 0x00\n#define MS5837_PROM_READ 0xA0\n#define MS5837_CONVERT_D1_8192 0x4A\n#define MS5837_CONVERT_D2_8192 0x5A\n\nMS5837::MS5837() {\n\tfluidDensity = 1029;\n}\n\nvoid MS5837::init() {\n\t\/\/ Reset the MS5837, per datasheet\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_RESET);\n\tWire.endTransmission();\n\n\t\/\/ Wait for reset to complete\n\tdelay(10);\n\n\t\/\/ Read calibration values and CRC\n\tfor ( uint8_t i = 0 ; i < 8 ; i++ ) {\n\t\tWire.beginTransmission(MS5837_ADDR);\n\t\tWire.write(MS5837_PROM_READ+i*2);\n\t\tWire.endTransmission();\n\n\t\tWire.requestFrom(MS5837_ADDR,2);\n\t\tC[i] = (Wire.read() << 8) | Wire.read();\n\t}\n\n\t\/\/ Verify that data is correct with CRC\n\tuint8_t crcRead = C[0] >> 12;\n\tuint8_t crcCalculated = crc4(C);\n\n\tif ( crcCalculated == crcRead ) {\n\t\t\/\/ Success\n\t} else {\n\t\t\/\/ Failure - try again?\n\t}\n}\n\nvoid MS5837::setFluidDensity(float density) {\n\tfluidDensity = density;\n}\n\nvoid MS5837::read() {\n\t\/\/ Request D1 conversion\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_CONVERT_D1_8192);\n\tWire.endTransmission();\n\n\tdelay(20); \/\/ Max conversion time per datasheet\n\t\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_ADC_READ);\n\tWire.endTransmission();\n\n \tWire.requestFrom(MS5837_ADDR,3);\n\tD1 = 0;\n\tD1 = Wire.read();\n\tD1 = (D1 << 8) | Wire.read();\n\tD1 = (D1 << 8) | Wire.read();\n\t\n\t\/\/ Request D2 conversion\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_CONVERT_D2_8192);\n\tWire.endTransmission();\n\n\tdelay(20); \/\/ Max conversion time per datasheet\n\t\n\tWire.beginTransmission(MS5837_ADDR);\n\tWire.write(MS5837_ADC_READ);\n\tWire.endTransmission();\n\n\tWire.requestFrom(MS5837_ADDR,3);\n\tD2 = 0;\n\tD2 = Wire.read();\n\tD2 = (D2 << 8) | Wire.read();\n\tD2 = (D2 << 8) | Wire.read();\n\t\n\tSerial.println(\"----\");\n\n\tcalculate();\n}\n\nvoid MS5837::readTestCase() {\n\tC[0] = 0;\n\tC[1] = 34982;\n\tC[2] = 36352;\n\tC[3] = 20328;\n\tC[4] = 22354;\n\tC[5] = 26646;\n\tC[6] = 26146;\n\tC[7] = 0;\n\n\tD1 = 4958179;\n\tD2 = 6815414;\n\n\tcalculate();\n}\n\nvoid MS5837::calculate() {\n\t\/\/ Given C1-C6 and D1, D2, calculated TEMP and P\n\t\/\/ Do conversion first and then second order temp compensation\n\t\n\tint32_t dT;\n\tint64_t SENS;\n\tint64_t OFF;\n\tint32_t SENSi; \n\tint32_t OFFi; \n\tint32_t Ti; \n\tint64_t OFF2;\n\tint64_t SENS2;\n\t\n\t\/\/ Terms called\n\tdT = D2-uint32_t(C[5])*256l;\n\tSENS = int64_t(C[1])*32768l+(int64_t(C[3])*dT)\/256l;\n\tOFF = int64_t(C[2])*65536l+(int64_t(C[4])*dT)\/128l;\n\t\n\t\n\t\/\/Temp and P conversion\n\tTEMP = 2000l+int64_t(dT)*C[6]\/8388608LL;\n\tP = (D1*SENS\/(2097152l)-OFF)\/(8192l);\n\t\n\t\/\/Second order compensation\n\tif((TEMP\/100)<20){ \/\/Low temp\n\t\tTi = (3*int64_t(dT)*int64_t(dT))\/(8589934592LL);\n\t\tOFFi = (3*(TEMP-2000)*(TEMP-2000))\/2;\n\t\tSENSi = (5*(TEMP-2000)*(TEMP-2000))\/8;\n\t\tif((TEMP\/100)<-15){ \/\/Very low temp\n\t\t\tOFFi = OFFi+7*(TEMP+1500l)*(TEMP+1500l);\n\t\t\tSENSi = SENSi+4*(TEMP+1500l)*(TEMP+1500l);\n\t\t}\n\t}\n\telse if((TEMP\/100)>=20){ \/\/High temp\n\t\tTi = 2*(dT*dT)\/(137438953472LL);\n\t\tOFFi = (1*(TEMP-2000)*(TEMP-2000))\/16;\n\t\tSENSi = 0;\n\t}\n\t\n\tOFF2 = OFF-OFFi; \/\/Calculate pressure and temp second order\n\tSENS2 = SENS-SENSi;\n\t\n\tTEMP = (TEMP-Ti);\n\tP = (((D1*SENS2)\/2097152l-OFF2)\/8192l);\n}\n\nfloat MS5837::pressure(float conversion) {\n\treturn P\/10.0f*conversion;\n}\n\nfloat MS5837::temperature() {\n\treturn TEMP\/100.0f;\n}\n\nfloat MS5837::depth() {\n\treturn (pressure(MS5837::Pa)-101300)\/(fluidDensity*9.80665);\n}\n\nfloat MS5837::altitude() {\n\treturn 0.0f;\n}\n\nuint8_t MS5837::crc4(uint16_t n_prom[]) {\n\tuint16_t n_rem = 0;\n\n\tn_prom[0] = ((n_prom[0]) & 0x0FFF);\n\tn_prom[7] = 0;\n\n\tfor ( uint8_t i = 0 ; i < 16; i++ ) {\n\t\tif ( i%2 == 1 ) {\n\t\t\tn_rem ^= (uint16_t)((n_prom[i>>1]) & 0x00FF0);\n\t\t} else {\n\t\t\tn_rem ^= (uint16_t)(n_prom[i>>1] >> 8);\n\t\t}\n\t\tfor ( uint8_t n_bit = 8 ; n_bit > 0 ; n_bit-- ) {\n\t\t\tif ( n_rem & 0x8000 ) {\n\t\t\t\tn_rem = (n_rem << 1) ^ 0x3000;\n\t\t\t} else {\n\t\t\t\tn_rem = (n_rem << 1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tn_rem = ((n_rem >> 12) & 0x000F);\n\n\treturn n_rem ^ 0x00;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ CPPUNIT\n#include <extracppunit\/CppUnitCore.hpp>\n\/\/ StdAir\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasDBParams.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n\/\/ Dsim Test Suite\n#include <test\/dsim\/SimulationTestSuite.hpp>\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test is based on ...\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulationHelper() {\n\n try {\n \n \/\/ Schedule input file name\n const std::string lScheduleInputFilename (\"..\/samples\/schedule01.csv\");\n\n \/\/ Demand input file name\n const stdair::Filename_T lDemandInputFilename (\"..\/samples\/demand01.csv\");\n \n \/\/ Output log File\n const std::string lLogFilename (\"SimulationTestSuite.log\");\n\n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the simulation context\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n const stdair::BasDBParams lDBParams (\"dsim\", \"dsim\",\n \"localhost\", \"3306\",\n \"sim_dsim\");\n DSIM::DSIM_Service dsimService (lLogParams, lDBParams,\n lScheduleInputFilename,\n lDemandInputFilename);\n\n \/\/ Perform a simulation\n dsimService.simulate();\n \n } catch (const DSIM::RootException& otexp) {\n std::cerr << \"Standard exception: \" << otexp.what() << std::endl;\n return;\n \n } catch (const std::exception& stde) {\n std::cerr << \"Standard exception: \" << stde.what() << std::endl;\n return;\n \n } catch (...) {\n return;\n }\n \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulation () {\n \/\/ TODO: Check that the simulation goes as expected\n CPPUNIT_ASSERT_NO_THROW ( simpleSimulationHelper(););\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ void SimulationTestSuite::errorCase () {\n\/\/ CPPUNIT_ASSERT (false);\n\/\/ }\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSimulationTestSuite::SimulationTestSuite () {\n _describeKey << \"Running test on simulation\"; \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ M A I N \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCPPUNIT_MAIN()\n\n<commit_msg>[test] Adapted the test suite to the new interface.<commit_after>\/\/ STL\n#include <sstream>\n#include <fstream>\n#include <string>\n\/\/ CPPUNIT\n#include <extracppunit\/CppUnitCore.hpp>\n\/\/ StdAir\n#include <stdair\/basic\/BasLogParams.hpp>\n#include <stdair\/basic\/BasDBParams.hpp>\n\/\/ Dsim\n#include <dsim\/DSIM_Types.hpp>\n#include <dsim\/DSIM_Service.hpp>\n\/\/ Dsim Test Suite\n#include <test\/dsim\/SimulationTestSuite.hpp>\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Test is based on ...\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulationHelper() {\n\n try {\n \n \/\/ Schedule input file name\n const std::string lScheduleInputFilename (\"..\/samples\/schedule01.csv\");\n \n \/\/ O&D input file name\n const std::string lODInputFilename (\"..\/samples\/ond01.csv\");\n\n \/\/ Demand input file name\n const stdair::Filename_T lDemandInputFilename (\"..\/samples\/demand01.csv\");\n\n \/\/ Fare input file name\n const stdair::Filename_T lFareInputFilename (\"..\/samples\/fare01.csv\");\n \n \/\/ Output log File\n const std::string lLogFilename (\"SimulationTestSuite.log\");\n\n \/\/ Set the log parameters\n std::ofstream logOutputFile;\n \/\/ Open and clean the log outputfile\n logOutputFile.open (lLogFilename.c_str());\n logOutputFile.clear();\n \n \/\/ Initialise the simulation context\n const stdair::BasLogParams lLogParams (stdair::LOG::DEBUG, logOutputFile);\n const stdair::BasDBParams lDBParams (\"dsim\", \"dsim\",\n \"localhost\", \"3306\",\n \"sim_dsim\");\n DSIM::DSIM_Service dsimService (lLogParams, lDBParams,\n lScheduleInputFilename, lODInputFilename,\n lDemandInputFilename, lFareInputFilename);\n\n \/\/ Perform a simulation\n dsimService.simulate();\n \n } catch (const DSIM::RootException& otexp) {\n std::cerr << \"Standard exception: \" << otexp.what() << std::endl;\n return;\n \n } catch (const std::exception& stde) {\n std::cerr << \"Standard exception: \" << stde.what() << std::endl;\n return;\n \n } catch (...) {\n return;\n }\n \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid SimulationTestSuite::simpleSimulation () {\n \/\/ TODO: Check that the simulation goes as expected\n CPPUNIT_ASSERT_NO_THROW ( simpleSimulationHelper(););\n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ void SimulationTestSuite::errorCase () {\n\/\/ CPPUNIT_ASSERT (false);\n\/\/ }\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nSimulationTestSuite::SimulationTestSuite () {\n _describeKey << \"Running test on simulation\"; \n}\n\n\/\/ \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ M A I N \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nCPPUNIT_MAIN()\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Fixed VulkanTexture::copyBufferToImage for 2D texture arrays<commit_after><|endoftext|>"} {"text":"<commit_before>\/* prefetch-2lev-IP.cpp: IP-based (PC) prefetcher [http:\/\/download.intel.com\/technology\/architecture\/sma.pdf] *\/\n\/*\n * __COPYRIGHT__ GT\n *\/\n#define COMPONENT_NAME \"2lev-IP\"\n\/*\n This has been modified from the original IP prefetcher to better handle the case\n when we have an access pattern similar to:\n\n Strides:\n X, 0, 0, 0, 0, X, 0, 0, 0 ...\n\n With our changes, the prefetcher does not update on the strides of 0, since \n strides of 0 are not interesting.\n\n Instead, it correctly prefetches a stride of X whenever it is seen, assuming\n X does not change.\n\n It is currently not really a two level prefetcher, but may be someday.\n *\/\n\n#ifdef PREFETCH_PARSE_ARGS\nif(!strcasecmp(COMPONENT_NAME,type))\n{\n int num_entries;\n int last_addr_bits;\n int last_stride_bits;\n int last_prefetch_bits;\n if(sscanf(opt_string,\"%*[^:]:%d:%d:%d:%d\",&num_entries,&last_addr_bits,&last_stride_bits,&last_prefetch_bits) != 4)\n fatal(\"bad %s prefetcher options string %s (should be \\\"2lev-IP:num_entries:addr-bits:stride-bits:last-PF-bits\\\")\",cp->name,opt_string);\n return new prefetch_2lev_IP_t(cp,num_entries,last_addr_bits,last_stride_bits,last_prefetch_bits);\n}\n#else\n\nclass prefetch_2lev_IP_t:public prefetch_t\n{\n protected:\n int num_entries;\n int mask;\n\n int last_addr_bits;\n int last_stride_bits;\n int last_prefetch_bits;\n\n int last_addr_mask;\n int last_stride_mask;\n int last_prefetch_mask;\n\n struct prefetch_IP_table_t {\n md_paddr_t last_paddr;\n int last_stride;\n my2bc_t conf;\n md_paddr_t last_prefetch;\n } * table;\n\n public:\n \/* CREATE *\/\n prefetch_2lev_IP_t(struct cache_t * arg_cp,\n int arg_num_entries,\n int arg_last_addr_bits,\n int arg_last_stride_bits,\n int arg_last_prefetch_bits)\n {\n init();\n\n char name[256]; \/* just used for error checking macros *\/\n\n type = strdup(\"2lev-IP\");\n if(!type)\n fatal(\"couldn't calloc IP-prefetch type (strdup)\");\n\n cp = arg_cp;\n sprintf(name,\"%s.%s\",cp->name,type);\n\n CHECK_PPOW2(arg_num_entries);\n num_entries = arg_num_entries;\n mask = num_entries - 1;\n\n last_addr_bits = arg_last_addr_bits;\n last_stride_bits = arg_last_stride_bits;\n last_prefetch_bits = arg_last_prefetch_bits;\n\n last_addr_mask = (1<<last_addr_bits)-1;\n last_stride_mask = (1<<last_stride_bits)-1;\n last_prefetch_mask = (1<<last_prefetch_bits)-1;\n\n table = (struct prefetch_2lev_IP_t::prefetch_IP_table_t*) calloc(num_entries,sizeof(*table));\n if(!table)\n fatal(\"couldn't calloc IP-prefetch table\");\n\n bits = num_entries * (last_addr_bits + last_stride_bits + last_prefetch_bits + 2);\n assert(arg_cp);\n }\n\n \/* DESTROY *\/\n ~prefetch_2lev_IP_t()\n {\n free(table);\n table = NULL;\n }\n\n \/* LOOKUP *\/\n PREFETCH_LOOKUP_HEADER\n {\n lookups++;\n\n int index = PC & mask;\n md_paddr_t pf_paddr = 0;\n\n \/* train entry first *\/\n md_paddr_t last_paddr = (paddr&~last_addr_mask) | table[index].last_paddr;\n int this_stride = (paddr - last_paddr) & last_stride_mask;\n\n \/* zero stride is just unuseful prefetches, don't update tables *\/\n if(this_stride == 0)\n return 0;\n\n if(this_stride == table[index].last_stride)\n MY2BC_UPDATE(table[index].conf,true);\n else\n table[index].conf = MY2BC_STRONG_NT;\n\n table[index].last_paddr = paddr&last_addr_mask;\n table[index].last_stride = this_stride;\n\n \/* only make a prefetch if confident *\/\n if(table[index].conf == MY2BC_STRONG_TAKEN)\n {\n pf_paddr = paddr + this_stride;\n if((pf_paddr & last_prefetch_mask) == table[index].last_prefetch)\n pf_paddr = 0; \/* don't keep prefetching the same thing *\/\n table[index].last_prefetch = pf_paddr & last_prefetch_mask;\n }\n\n return pf_paddr;\n }\n\n virtual md_paddr_t latest_lookup (const md_addr_t PC, const md_paddr_t paddr)\n {\n (void) paddr;\n\n int index = PC & mask;\n return table[index].last_stride + paddr;\n }\n};\n\n\n#endif \/* PREFETCH_PARSE_ARGS *\/\n#undef COMPONENT_NAME\n<commit_msg>Implemented a different state machine for the prefetcher, which makes it more suitable for longer strides that cross page boundaries. Comment in source points to the paper the prefetcher originated from.<commit_after>\/* prefetch-2lev-IP.cpp: IP-based (PC) prefetcher [http:\/\/download.intel.com\/technology\/architecture\/sma.pdf] *\/\n\/*\n * __COPYRIGHT__ GT\n *\/\n\n#define COMPONENT_NAME \"2lev-IP\"\n\/*\n This has been modified from the original IP prefetcher to better handle the case\n when we have an access pattern similar to:\n\n Strides:\n X, 0, 0, 0, 0, X, 0, 0, 0 ...\n\n With our changes, the prefetcher does not update on the strides of 0, since \n strides of 0 are not interesting.\n\n Instead, it correctly prefetches a stride of X whenever it is seen, assuming\n X does not change.\n\n Also, we do not prefetch if we're going to cross a page boundary.\n\n It implements the state machine detailed in:\n Jean-Loup Baer and Tien-Fu Chen. 1995. Effective Hardware-Based Data Prefetching for High-Performance \n Processors. IEEE Trans. Comput. 44, 5 (May 1995), 609-623.\n\n It is currently not really a two level prefetcher, but may be someday.\n *\/\n \n#ifdef PREFETCH_PARSE_ARGS\nif(!strcasecmp(COMPONENT_NAME,type))\n{\n int num_entries;\n int last_addr_bits;\n int last_stride_bits;\n if(sscanf(opt_string,\"%*[^:]:%d:%d:%d:%d\",&num_entries,&last_addr_bits,&last_stride_bits) != 3)\n fatal(\"bad %s prefetcher options string %s (should be \\\"2lev-IP:num_entries:addr-bits:stride-bits\\\")\",cp->name,opt_string);\n return new prefetch_2lev_IP_t(cp,num_entries,last_addr_bits,last_stride_bits,last_prefetch_bits);\n}\n#else\n\nclass prefetch_2lev_IP_t:public prefetch_t\n{\n protected:\n int num_entries;\n int mask;\n\n int last_addr_bits;\n int last_stride_bits;\n\n int last_addr_mask;\n int last_stride_mask;\n\n struct prefetch_IP_table_t {\n \/\/ md_addr_t PC;\n md_paddr_t last_paddr;\n int last_stride;\n my2bc_t conf;\n } * table;\n\n public:\n \/* CREATE *\/\n prefetch_2lev_IP_t(struct cache_t * arg_cp,\n int arg_num_entries,\n int arg_last_addr_bits,\n int arg_last_stride_bits,\n int arg_last_prefetch_bits)\n {\n init();\n\n char name[256]; \/* just used for error checking macros *\/\n\n type = strdup(\"2lev-IP\");\n if(!type)\n fatal(\"couldn't calloc IP-prefetch type (strdup)\");\n\n cp = arg_cp;\n sprintf(name,\"%s.%s\",cp->name,type);\n\n CHECK_PPOW2(arg_num_entries);\n num_entries = arg_num_entries;\n mask = num_entries - 1;\n\n last_addr_bits = arg_last_addr_bits;\n last_stride_bits = arg_last_stride_bits;\n\n last_addr_mask = (1<<last_addr_bits)-1;\n last_stride_mask = (1<<last_stride_bits)-1;\n\n table = (struct prefetch_2lev_IP_t::prefetch_IP_table_t*) calloc(num_entries,sizeof(*table));\n if(!table)\n fatal(\"couldn't calloc IP-prefetch table\");\n\n bits = num_entries * (last_addr_bits + last_stride_bits + 2);\n assert(arg_cp);\n }\n\n \/* DESTROY *\/\n ~prefetch_2lev_IP_t()\n {\n free(table);\n table = NULL;\n }\n\n \/* LOOKUP *\/\n PREFETCH_LOOKUP_HEADER\n{\n lookups++;\n\n int index = PC & mask;\n md_paddr_t pf_paddr = 0;\n \n \/\/ If want to use tags for table\n \/* if(table[index].PC != PC) {\n table[index].last_paddr = paddr&last_addr_mask; \n table[index].last_stride = 0;\n table[index].conf = MY2BC_WEAKLY_TAKEN;\n table[index].PC = PC;\n return 0;\n }*\/\n \n \/* train entry first *\/\n md_paddr_t last_paddr = (paddr&~last_addr_mask) | table[index].last_paddr;\n int this_stride = (paddr - last_paddr) & last_stride_mask;\n\n \/* zero stride is just unuseful prefetches, don't update tables *\/\n if(this_stride == 0) {\n return 0;\n }\n\n table[index].last_paddr = paddr&last_addr_mask; \n if(table[index].conf != MY2BC_STRONG_TAKEN) {\n table[index].last_stride = this_stride;\n }\n\n bool is_correct = (this_stride == table[index].last_stride);\n\n if(table[index].conf == MY2BC_WEAKLY_NT && is_correct) {\n table[index].conf = MY2BC_STRONG_TAKEN;\n }\n else {\n MY2BC_UPDATE(table[index].conf, is_correct);\n }\n \n if((table[index].conf != MY2BC_STRONG_NT)) {\n pf_paddr = paddr + table[index].last_stride;\n \n \/\/ If going to cross page boundary, don't prefetch\n int page_mask = ~((1 << PAGE_SHIFT) - 1);\n if((pf_paddr & page_mask) != (paddr & page_mask)) {\n\treturn 0;\n }\n }\n return pf_paddr;\n }\n \n virtual md_paddr_t latest_lookup (const md_addr_t PC, const md_paddr_t paddr)\n {\n (void) paddr;\n\n int index = PC & mask;\n return table[index].last_stride + paddr;\n }\n};\n\n\n#endif \/* PREFETCH_PARSE_ARGS *\/\n#undef COMPONENT_NAME\n<|endoftext|>"} {"text":"<commit_before>\/* Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html *\/\n#include \"coffer.hh\"\n#include \"containerimpl.hh\"\n#include \"factory.hh\"\n#include \"..\/rcore\/rsvg\/svg.hh\"\n\nnamespace Rapicorn {\n\nclass CofferImpl : public virtual Coffer, public virtual SingleContainerImpl {\n String m_element;\n Svg::Element m_sel;\n bool m_overlap_child;\nprotected:\n virtual void size_request (Requisition &requisition);\n virtual void size_allocate (Allocation area);\n virtual void do_invalidate ();\npublic:\n explicit CofferImpl ();\n virtual ~CofferImpl ();\n virtual String element () const { return m_element; }\n virtual void element (const String &id) { m_element = id; invalidate(); }\n virtual bool overlap_child () const { return m_overlap_child; }\n virtual void overlap_child (bool overlap) { m_overlap_child = overlap; invalidate(); }\n};\n\nconst PropertyList&\nCoffer::list_properties()\n{\n static Property *properties[] = {\n MakeProperty (Coffer, element, _(\"Element\"), _(\"The SVG element ID to be rendered.\"), \"rw\"),\n MakeProperty (Coffer, overlap_child, _(\"Overlap Child\"), _(\"Draw child on top of container area.\"), \"rw\"),\n };\n static const PropertyList property_list (properties, Container::list_properties());\n return property_list;\n}\n\nCofferImpl::CofferImpl() :\n m_overlap_child (false)\n{}\n\nCofferImpl::~CofferImpl()\n{}\n\nvoid\nCofferImpl::size_request (Requisition &requisition)\n{\n SingleContainerImpl::size_request (requisition);\n int thickness = 2; \/\/ FIXME: use real border marks\n if (!m_overlap_child)\n {\n requisition.width += 2 * thickness;\n requisition.height += 2 * thickness;\n }\n}\n\nvoid\nCofferImpl::size_allocate (Allocation area)\n{\n Allocation carea = area;\n if (has_allocatable_child() && !m_overlap_child)\n {\n int thickness = 2; \/\/ FIXME: use real border marks\n carea.x += thickness;\n carea.y += thickness;\n carea.width -= 2 * thickness;\n carea.height -= 2 * thickness;\n }\n SingleContainerImpl::size_allocate (carea);\n allocation (area);\n}\n\nvoid\nCofferImpl::do_invalidate()\n{\n if (m_element.empty())\n {\n m_sel = m_sel.none();\n return;\n }\n Svg::Element e = Svg::Library::lookup_element (m_element);\n if (e.is_null())\n return;\n m_sel = e;\n}\n\nstatic const ItemFactory<CofferImpl> coffer_factory (\"Rapicorn::Factory::Coffer\");\n\n} \/\/ Rapicorn\n<commit_msg>UI: made Coffer render SVG element using pixel scaling<commit_after>\/* Licensed GNU LGPL v3 or later: http:\/\/www.gnu.org\/licenses\/lgpl.html *\/\n#include \"coffer.hh\"\n#include \"containerimpl.hh\"\n#include \"factory.hh\"\n#include \"..\/rcore\/rsvg\/svg.hh\"\n#include <string.h>\n\n#define CHECK_CAIRO_STATUS(status) do { \\\n cairo_status_t ___s = (status); \\\n if (___s != CAIRO_STATUS_SUCCESS) \\\n RAPICORN_LOG (DIAG, \"%s: %s\", #status, cairo_status_to_string (___s)); \\\n } while (0)\n\nnamespace Rapicorn {\n\nclass CofferImpl : public virtual Coffer, public virtual SingleContainerImpl {\n String m_element;\n Svg::Element m_sel;\n bool m_overlap_child;\nprotected:\n virtual void size_request (Requisition &requisition);\n virtual void size_allocate (Allocation area);\n virtual void do_invalidate ();\n virtual void render (Display &display);\npublic:\n explicit CofferImpl ();\n virtual ~CofferImpl ();\n virtual String element () const { return m_element; }\n virtual void element (const String &id) { m_element = id; invalidate(); }\n virtual bool overlap_child () const { return m_overlap_child; }\n virtual void overlap_child (bool overlap) { m_overlap_child = overlap; invalidate(); }\n};\n\nconst PropertyList&\nCoffer::list_properties()\n{\n static Property *properties[] = {\n MakeProperty (Coffer, element, _(\"Element\"), _(\"The SVG element ID to be rendered.\"), \"rw\"),\n MakeProperty (Coffer, overlap_child, _(\"Overlap Child\"), _(\"Draw child on top of container area.\"), \"rw\"),\n };\n static const PropertyList property_list (properties, Container::list_properties());\n return property_list;\n}\n\nCofferImpl::CofferImpl() :\n m_overlap_child (false)\n{}\n\nCofferImpl::~CofferImpl()\n{}\n\nvoid\nCofferImpl::do_invalidate()\n{\n if (m_element.empty())\n {\n m_sel = m_sel.none();\n return;\n }\n Svg::Element e = Svg::Library::lookup_element (m_element);\n if (e.is_null())\n return;\n m_sel = e;\n}\n\nvoid\nCofferImpl::size_request (Requisition &requisition)\n{\n SingleContainerImpl::size_request (requisition);\n if (m_sel)\n {\n requisition.width = m_sel.allocation().width;\n requisition.height = m_sel.allocation().height;\n int thickness = 2; \/\/ FIXME: use real border marks\n if (!m_overlap_child)\n {\n requisition.width += 2 * thickness;\n requisition.height += 2 * thickness;\n }\n }\n}\n\nvoid\nCofferImpl::size_allocate (Allocation area)\n{\n Allocation carea = area;\n if (has_allocatable_child() && !m_overlap_child)\n {\n int thickness = 2; \/\/ FIXME: use real border marks\n carea.x += thickness;\n carea.y += thickness;\n carea.width -= 2 * thickness;\n carea.height -= 2 * thickness;\n }\n SingleContainerImpl::size_allocate (carea);\n allocation (area);\n}\n\nvoid\nCofferImpl::render (Display &display)\n{\n Allocation area = allocation();\n if (m_sel)\n {\n Svg::Allocation a = m_sel.allocation();\n uint8 *pixels = new uint8[int (a.width * a.height * 4)];\n memset (pixels, 0, a.width * a.height * 4);\n cairo_surface_t *surface = cairo_image_surface_create_for_data (pixels, CAIRO_FORMAT_ARGB32, a.width, a.height, 4 * a.width);\n CHECK_CAIRO_STATUS (cairo_surface_status (surface));\n bool rendered = m_sel.render (surface, Svg::Allocation (0, 0, a.width, a.height));\n if (rendered)\n {\n cairo_t *cr = display.create_cairo ();\n cairo_set_source_surface (cr, surface, 0, 0); \/\/ (x,y) are set in the matrix below\n cairo_matrix_t matrix;\n cairo_matrix_init_identity (&matrix);\n double sx = a.width \/ area.width;\n double sy = a.height \/ area.height;\n cairo_matrix_translate (&matrix, -area.x * sx, (area.y + area.height) * sy); \/\/ -x, y + height\n cairo_matrix_scale (&matrix, sx, -sy);\n cairo_pattern_set_matrix (cairo_get_source (cr), &matrix);\n cairo_paint (cr);\n }\n else\n warning (\"Failed to render SVG element: %s\", m_element.c_str());\n cairo_surface_destroy (surface);\n delete[] pixels;\n }\n SingleContainerImpl::render (display);\n}\n\nstatic const ItemFactory<CofferImpl> coffer_factory (\"Rapicorn::Factory::Coffer\");\n\n} \/\/ Rapicorn\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n**\n**************************************************************************\/\n\n#include \"cppquickopenfilter.h\"\n#include \"cppmodelmanager.h\"\n\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <coreplugin\/editormanager\/ieditor.h>\n#include <texteditor\/itexteditor.h>\n#include <texteditor\/basetexteditor.h>\n\nusing namespace CppTools::Internal;\n\nCppQuickOpenFilter::CppQuickOpenFilter(CppModelManager *manager, Core::EditorManager *editorManager)\n : m_manager(manager),\n m_editorManager(editorManager),\n m_forceNewSearchList(true)\n{\n setShortcutString(\":\");\n setIncludedByDefault(false);\n\n connect(manager, SIGNAL(documentUpdated(CPlusPlus::Document::Ptr)),\n this, SLOT(onDocumentUpdated(CPlusPlus::Document::Ptr)));\n\n connect(manager, SIGNAL(aboutToRemoveFiles(QStringList)),\n this, SLOT(onAboutToRemoveFiles(QStringList)));\n}\n\nCppQuickOpenFilter::~CppQuickOpenFilter()\n{ }\n\nvoid CppQuickOpenFilter::onDocumentUpdated(CPlusPlus::Document::Ptr doc)\n{\n m_searchList[doc->fileName()] = Info(doc);\n}\n\nvoid CppQuickOpenFilter::onAboutToRemoveFiles(const QStringList &files)\n{\n foreach (const QString &file, files)\n m_searchList.remove(file);\n}\n\nvoid CppQuickOpenFilter::refresh(QFutureInterface<void> &future)\n{\n Q_UNUSED(future);\n}\n\nstatic bool compareLexigraphically(const QuickOpen::FilterEntry &a,\n const QuickOpen::FilterEntry &b)\n{\n return a.displayName < b.displayName;\n}\n\nQList<QuickOpen::FilterEntry> CppQuickOpenFilter::matchesFor(const QString &origEntry)\n{\n QString entry = trimWildcards(origEntry);\n QList<QuickOpen::FilterEntry> goodEntries;\n QList<QuickOpen::FilterEntry> betterEntries;\n QStringMatcher matcher(entry, Qt::CaseInsensitive);\n const QRegExp regexp(\"*\"+entry+\"*\", Qt::CaseInsensitive, QRegExp::Wildcard);\n if (!regexp.isValid())\n return goodEntries;\n bool hasWildcard = (entry.contains('*') || entry.contains('?'));\n\n QMutableMapIterator<QString, Info> it(m_searchList);\n while (it.hasNext()) {\n it.next();\n\n Info info = it.value();\n if (info.dirty) {\n info.dirty = false;\n info.items = search(info.doc);\n it.setValue(info);\n }\n\n QList<ModelItemInfo> items = info.items;\n\n foreach (ModelItemInfo info, items) {\n if ((hasWildcard && regexp.exactMatch(info.symbolName))\n || (!hasWildcard && matcher.indexIn(info.symbolName) != -1)) {\n QVariant id = qVariantFromValue(info);\n QuickOpen::FilterEntry filterEntry(this, info.symbolName, id, info.icon);\n filterEntry.extraInfo = info.symbolType;\n if (info.symbolName.startsWith(entry))\n betterEntries.append(filterEntry);\n else\n goodEntries.append(filterEntry);\n }\n }\n }\n\n if (goodEntries.size() < 1000)\n qSort(goodEntries.begin(), goodEntries.end(), compareLexigraphically);\n if (betterEntries.size() < 1000)\n qSort(betterEntries.begin(), betterEntries.end(), compareLexigraphically);\n\n betterEntries += goodEntries;\n return betterEntries;\n}\n\nvoid CppQuickOpenFilter::accept(QuickOpen::FilterEntry selection) const\n{\n ModelItemInfo info = qvariant_cast<CppTools::Internal::ModelItemInfo>(selection.internalData);\n TextEditor::BaseTextEditor::openEditorAt(info.fileName, info.line);\n}\n<commit_msg>Show the filename of a symbol if it doesn't have additional type info<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Qt Software Information (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at qt-sales@nokia.com.\n**\n**************************************************************************\/\n\n#include \"cppquickopenfilter.h\"\n#include \"cppmodelmanager.h\"\n\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <coreplugin\/editormanager\/ieditor.h>\n#include <texteditor\/itexteditor.h>\n#include <texteditor\/basetexteditor.h>\n\nusing namespace CppTools::Internal;\n\nCppQuickOpenFilter::CppQuickOpenFilter(CppModelManager *manager, Core::EditorManager *editorManager)\n : m_manager(manager),\n m_editorManager(editorManager),\n m_forceNewSearchList(true)\n{\n setShortcutString(\":\");\n setIncludedByDefault(false);\n\n connect(manager, SIGNAL(documentUpdated(CPlusPlus::Document::Ptr)),\n this, SLOT(onDocumentUpdated(CPlusPlus::Document::Ptr)));\n\n connect(manager, SIGNAL(aboutToRemoveFiles(QStringList)),\n this, SLOT(onAboutToRemoveFiles(QStringList)));\n}\n\nCppQuickOpenFilter::~CppQuickOpenFilter()\n{ }\n\nvoid CppQuickOpenFilter::onDocumentUpdated(CPlusPlus::Document::Ptr doc)\n{\n m_searchList[doc->fileName()] = Info(doc);\n}\n\nvoid CppQuickOpenFilter::onAboutToRemoveFiles(const QStringList &files)\n{\n foreach (const QString &file, files)\n m_searchList.remove(file);\n}\n\nvoid CppQuickOpenFilter::refresh(QFutureInterface<void> &future)\n{\n Q_UNUSED(future);\n}\n\nstatic bool compareLexigraphically(const QuickOpen::FilterEntry &a,\n const QuickOpen::FilterEntry &b)\n{\n return a.displayName < b.displayName;\n}\n\nQList<QuickOpen::FilterEntry> CppQuickOpenFilter::matchesFor(const QString &origEntry)\n{\n QString entry = trimWildcards(origEntry);\n QList<QuickOpen::FilterEntry> goodEntries;\n QList<QuickOpen::FilterEntry> betterEntries;\n QStringMatcher matcher(entry, Qt::CaseInsensitive);\n const QRegExp regexp(\"*\"+entry+\"*\", Qt::CaseInsensitive, QRegExp::Wildcard);\n if (!regexp.isValid())\n return goodEntries;\n bool hasWildcard = (entry.contains('*') || entry.contains('?'));\n\n QMutableMapIterator<QString, Info> it(m_searchList);\n while (it.hasNext()) {\n it.next();\n\n Info info = it.value();\n if (info.dirty) {\n info.dirty = false;\n info.items = search(info.doc);\n it.setValue(info);\n }\n\n QList<ModelItemInfo> items = info.items;\n\n foreach (ModelItemInfo info, items) {\n if ((hasWildcard && regexp.exactMatch(info.symbolName))\n || (!hasWildcard && matcher.indexIn(info.symbolName) != -1)) {\n\n QVariant id = qVariantFromValue(info);\n QuickOpen::FilterEntry filterEntry(this, info.symbolName, id, info.icon);\n if (! info.symbolType.isEmpty())\n filterEntry.extraInfo = info.symbolType;\n else\n filterEntry.extraInfo = info.fileName;\n\n if (info.symbolName.startsWith(entry))\n betterEntries.append(filterEntry);\n else\n goodEntries.append(filterEntry);\n }\n }\n }\n\n if (goodEntries.size() < 1000)\n qSort(goodEntries.begin(), goodEntries.end(), compareLexigraphically);\n if (betterEntries.size() < 1000)\n qSort(betterEntries.begin(), betterEntries.end(), compareLexigraphically);\n\n betterEntries += goodEntries;\n return betterEntries;\n}\n\nvoid CppQuickOpenFilter::accept(QuickOpen::FilterEntry selection) const\n{\n ModelItemInfo info = qvariant_cast<CppTools::Internal::ModelItemInfo>(selection.internalData);\n TextEditor::BaseTextEditor::openEditorAt(info.fileName, info.line);\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef DUNE_STUFF_ANALYTICAL_HH\n#define DUNE_STUFF_ANALYTICAL_HH\n\n#ifdef HAVE_CMAKE_CONFIG\n #include \"cmake_config.h\"\n#else\n #include \"config.h\"\n#endif \/\/ ifdef HAVE_CMAKE_CONFIG\n\n#ifdef HAVE_DUNE_FEM\n\n#include \"timefunction.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Fem {\n\ntemplate< class FunctionSpaceImp >\nclass ConstantFunction\n : public Dune::Fem::Function< FunctionSpaceImp, ConstantFunction< FunctionSpaceImp > >\n{\npublic:\n typedef ConstantFunction< FunctionSpaceImp >\n ThisType;\n typedef Dune::Fem::Function< FunctionSpaceImp, ThisType >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n ConstantFunction(const FunctionSpaceImp& \/*space*\/,\n const double constant = 0.0)\n : constant_(RangeType(constant))\n {}\n explicit ConstantFunction(const double constant = 0.0)\n : constant_(RangeType(constant))\n {}\n explicit ConstantFunction(const RangeType& constant)\n : constant_(constant)\n {}\n\n ~ConstantFunction()\n {}\n\n inline void evaluate(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret) const {\n ret = constant_;\n }\n\n inline void evaluate(const DomainType& \/*arg*\/, RangeType& ret) const { ret = RangeType(constant_); }\n\n template< class IntersectionIteratorType >\n inline void evaluate(const double \/*time*\/, const DomainType& \/*arg*\/,\n RangeType& ret, const IntersectionIteratorType \/*it*\/) const\n { ret = constant_; }\n\n \/\/! this signature might be used by GRAPE\n inline void evaluate(const DomainType& \/*arg*\/,const typename RangeType::value_type \/*time*\/, RangeType& ret) const {\n ret = constant_;\n }\n\n inline void evaluateJacobian(const DomainType& \/*arg*\/, typename BaseType::JacobianRangeType& jacobian) const {\n jacobian = typename BaseType::JacobianRangeType(0);\n }\n\nprivate:\n const RangeType constant_;\n};\n\ntemplate< class FunctionSpaceImp, class TimeProviderImp >\nclass ConstantFunctionTP\n : public TimeFunction< FunctionSpaceImp,\n ConstantFunctionTP< FunctionSpaceImp, TimeProviderImp >, TimeProviderImp >\n{\npublic:\n typedef ConstantFunctionTP< FunctionSpaceImp, TimeProviderImp >\n ThisType;\n typedef TimeFunction< FunctionSpaceImp, ThisType, TimeProviderImp >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n ConstantFunctionTP(const TimeProviderImp& timeprovider,\n const FunctionSpaceImp& space,\n const double constant = 0.0)\n : BaseType(timeprovider, space)\n , constant_(constant)\n {}\n\n ~ConstantFunctionTP()\n {}\n\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret) const { ret = RangeType(constant_); }\n\nprivate:\n const double constant_;\n};\n\ntemplate< class FunctionSpaceImp, class TimeProviderImp >\nclass ConstantIntersectionTimeFunction\n : public IntersectionTimeFunction< FunctionSpaceImp,\n ConstantIntersectionTimeFunction< FunctionSpaceImp,\n TimeProviderImp >, TimeProviderImp >\n{\npublic:\n typedef ConstantIntersectionTimeFunction< FunctionSpaceImp, TimeProviderImp >\n ThisType;\n typedef IntersectionTimeFunction< FunctionSpaceImp, ThisType, TimeProviderImp >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n \/**\n * \\brief constructor\n * \\param viscosity,alpha dummies\n **\/\n ConstantIntersectionTimeFunction(const TimeProviderImp& timeprovider,\n const FunctionSpaceImp& space,\n const double constant = 0.0)\n : BaseType(timeprovider, space)\n , constant_(constant)\n {}\n\n \/**\n * \\brief destructor\n *\n * doing nothing\n **\/\n ~ConstantIntersectionTimeFunction()\n {}\n\n template< class IntersectionType >\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret,\n const IntersectionType& \/*intersection *\/) const {\n ret = RangeType(constant_);\n }\n\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret) const {\n ret = RangeType(constant_);\n }\n\nprivate:\n const double constant_;\n};\n\n} \/\/ end namespace Fem\n} \/\/ end namespace Stuff\n} \/\/ end namespace Dune\n\n#define NULLFUNCTION_TP(classname) \\\n template< class T, class P > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunctionTP< T, P > \\\n { classname(const P &p, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantFunctionTP< T, P >(p, t) {} };\n\n#define NULLFUNCTION_TP_BOUNDARY(classname) \\\n template< class T, class P > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantIntersectionTimeFunction< T, P > \\\n { classname(const P &p, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantIntersectionTimeFunction< T, P >(p, t) {} };\n\n#define NULLFUNCTION(classname) \\\n template< class T > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunction< T > \\\n { classname(const double \/*d*\/, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantFunction< T >(t) {} \\\n classname() \\\n : Dune::Stuff::Fem::ConstantFunction< T >() {} \\\n classname(const T &t) \\\n : Dune::Stuff::Fem::ConstantFunction< T >(t) {} };\n\n#define CONSTANTFUNCTION(classname, constant) \\\n template< class T > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunction< T > \\\n { classname() \\\n : Dune::Stuff::Fem::ConstantFunction< T >(typename T::RangeType(constant)) {} };\n\n#endif \/\/ HAVE_DUNE_FEM\n\n#endif \/\/ DUNE_STUFF_ANALYTICAL_HH\n\n\/** Copyright (c) 2012, Rene Milk\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * The views and conclusions contained in the software and documentation are those\n * of the authors and should not be interpreted as representing official policies,\n * either expressed or implied, of the FreeBSD Project.\n **\/\n<commit_msg>[fem] implements a more generic ConstantFunction<commit_after>#ifndef DUNE_STUFF_ANALYTICAL_HH\n#define DUNE_STUFF_ANALYTICAL_HH\n\n#ifdef HAVE_CMAKE_CONFIG\n #include \"cmake_config.h\"\n#else\n #include \"config.h\"\n#endif \/\/ ifdef HAVE_CMAKE_CONFIG\n\n#ifdef HAVE_DUNE_FEM\n\n#include \"timefunction.hh\"\n\nnamespace Dune {\nnamespace Stuff {\nnamespace Fem {\n\ntemplate< class FunctionSpaceImp >\nclass ConstantFunction\n : public Dune::Fem::Function< FunctionSpaceImp, ConstantFunction< FunctionSpaceImp > >\n{\npublic:\n typedef ConstantFunction< FunctionSpaceImp >\n ThisType;\n typedef Dune::Fem::Function< FunctionSpaceImp, ThisType >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n ConstantFunction(const FunctionSpaceImp& \/*space*\/,\n const double constant = 0.0)\n : constant_(RangeType(constant))\n {}\n explicit ConstantFunction(const double constant = 0.0)\n : constant_(RangeType(constant))\n {}\n explicit ConstantFunction(const RangeType& constant)\n : constant_(constant)\n {}\n\n ~ConstantFunction()\n {}\n\n inline void evaluate(RangeType& ret) const {\n ret = constant_;\n }\n\n \/\/! recursively consume args until only the output arg RangeType is left and the above function is called\n template <class FirstType, class... Args>\n void evaluate(FirstType&&, Args&&... args) const { evaluate(args...); }\n\n template< class IntersectionIteratorType >\n inline void evaluate(const double \/*time*\/, const DomainType& \/*arg*\/,\n RangeType& ret, const IntersectionIteratorType \/*it*\/) const\n { ret = constant_; }\n\n inline void jacobian(typename BaseType::JacobianRangeType& jac) const {\n jac = typename BaseType::JacobianRangeType(0);\n }\n\n template <class FirstType, class... Args>\n void jacobian(FirstType&&, Args&&... args) const { jacobian(args...); }\n\n \/\/! alias for evaluate\n template <class... Args>\n void position_derivative(Args&&... args) const { evaluate(std::forward<Args>(args)...); }\n\n \/\/! alias for jacobian\n template <class... Args>\n void direction_derivative(Args&&... args) const { jacobian(std::forward<Args>(args)...); }\n\n \/\/! deprecated alias for jacobian\n template <class... Args>\n void evaluateJacobian(Args&&... args) const { jacobian(std::forward<Args>(args)...); }\n\nprivate:\n const RangeType constant_;\n};\n\ntemplate< class FunctionSpaceImp, class TimeProviderImp >\nclass ConstantFunctionTP\n : public TimeFunction< FunctionSpaceImp,\n ConstantFunctionTP< FunctionSpaceImp, TimeProviderImp >, TimeProviderImp >\n{\npublic:\n typedef ConstantFunctionTP< FunctionSpaceImp, TimeProviderImp >\n ThisType;\n typedef TimeFunction< FunctionSpaceImp, ThisType, TimeProviderImp >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n ConstantFunctionTP(const TimeProviderImp& timeprovider,\n const FunctionSpaceImp& space,\n const double constant = 0.0)\n : BaseType(timeprovider, space)\n , constant_(constant)\n {}\n\n ~ConstantFunctionTP()\n {}\n\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret) const { ret = RangeType(constant_); }\n\nprivate:\n const double constant_;\n};\n\ntemplate< class FunctionSpaceImp, class TimeProviderImp >\nclass ConstantIntersectionTimeFunction\n : public IntersectionTimeFunction< FunctionSpaceImp,\n ConstantIntersectionTimeFunction< FunctionSpaceImp,\n TimeProviderImp >, TimeProviderImp >\n{\npublic:\n typedef ConstantIntersectionTimeFunction< FunctionSpaceImp, TimeProviderImp >\n ThisType;\n typedef IntersectionTimeFunction< FunctionSpaceImp, ThisType, TimeProviderImp >\n BaseType;\n typedef typename BaseType::DomainType\n DomainType;\n typedef typename BaseType::RangeType\n RangeType;\n\n \/**\n * \\brief constructor\n * \\param viscosity,alpha dummies\n **\/\n ConstantIntersectionTimeFunction(const TimeProviderImp& timeprovider,\n const FunctionSpaceImp& space,\n const double constant = 0.0)\n : BaseType(timeprovider, space)\n , constant_(constant)\n {}\n\n \/**\n * \\brief destructor\n *\n * doing nothing\n **\/\n ~ConstantIntersectionTimeFunction()\n {}\n\n template< class IntersectionType >\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret,\n const IntersectionType& \/*intersection *\/) const {\n ret = RangeType(constant_);\n }\n\n void evaluateTime(const double \/*time*\/, const DomainType& \/*arg*\/, RangeType& ret) const {\n ret = RangeType(constant_);\n }\n\nprivate:\n const double constant_;\n};\n\n} \/\/ end namespace Fem\n} \/\/ end namespace Stuff\n} \/\/ end namespace Dune\n\n#define NULLFUNCTION_TP(classname) \\\n template< class T, class P > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunctionTP< T, P > \\\n { classname(const P &p, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantFunctionTP< T, P >(p, t) {} };\n\n#define NULLFUNCTION_TP_BOUNDARY(classname) \\\n template< class T, class P > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantIntersectionTimeFunction< T, P > \\\n { classname(const P &p, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantIntersectionTimeFunction< T, P >(p, t) {} };\n\n#define NULLFUNCTION(classname) \\\n template< class T > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunction< T > \\\n { classname(const double \/*d*\/, const T &t, double = 0.0, double = 0.0) \\\n : Dune::Stuff::Fem::ConstantFunction< T >(t) {} \\\n classname() \\\n : Dune::Stuff::Fem::ConstantFunction< T >() {} \\\n classname(const T &t) \\\n : Dune::Stuff::Fem::ConstantFunction< T >(t) {} };\n\n#define CONSTANTFUNCTION(classname, constant) \\\n template< class T > \\\n struct classname \\\n : public Dune::Stuff::Fem::ConstantFunction< T > \\\n { classname() \\\n : Dune::Stuff::Fem::ConstantFunction< T >(typename T::RangeType(constant)) {} };\n\n#endif \/\/ HAVE_DUNE_FEM\n\n#endif \/\/ DUNE_STUFF_ANALYTICAL_HH\n\n\/** Copyright (c) 2012, Rene Milk\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * The views and conclusions contained in the software and documentation are those\n * of the authors and should not be interpreted as representing official policies,\n * either expressed or implied, of the FreeBSD Project.\n **\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Minor VulkanTexture simplification.<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"TestSprite.h\"\n\n#include <easyejoy2d.h>\n#include <dtex_facade.h>\n\nnamespace tdtex\n{\n\nTestSprite::TestSprite()\n{\n\tconst char* cfg =\n\t\t\"{ \\n\"\n\t\t\"\t\\\"open_c1\\\" : false, \\n\"\n\t\t\"\t\\\"open_c2\\\" : false, \\n\"\n\t\t\"\t\\\"open_c3\\\" : true \\n\"\n\t\t\"} \\n\"\n\t\t;\n\tdtexf_create(cfg);\n}\n\nTestSprite::~TestSprite()\n{\n\tdtexf_release();\n}\n\nvoid TestSprite::Load()\n{\n\t{\n\t\tej_package* pkg = dtexf_c3_load_pkg(\"2002jumin\", \"test-dtex\/2002jumin.epd\", 1);\n\t\tm_spr = new eejoy2d::EJSprite(pkg, \"2002jumin1_run_1\");\n\t\tdtexf_c3_load_pkg(\"2002jumin\", \"test-dtex\/2002jumin.epp\", 1);\n\t}\n\tdtexf_c3_load_pkg_finish();\n\n\tm_spr2 = new eejoy2d::EJSprite(dtexf_create_sprite(\"test-dtex\/360.png\"));\n\tm_spr2->Translate(300, 0);\n}\n\nvoid TestSprite::Update()\n{\n}\n\nvoid TestSprite::Draw() const\n{\n\teejoy2d::EJScreen* scr = eejoy2d::EJScreen::Instance();\n\tassert(scr);\n\tscr->Bind();\n\tscr->Clear();\n\n\tm_spr->Draw(100, 100);\n\tm_spr2->Draw(200, 200);\n\n\tscr->UnBind();\n}\n\n}<commit_msg>[FIXED] test sprite<commit_after>#include \"TestSprite.h\"\n\n#include <easyejoy2d.h>\n#include <dtex_facade.h>\n\nnamespace tdtex\n{\n\nTestSprite::TestSprite()\n{\n\tconst char* cfg =\n\t\t\"{ \\n\"\n\t\t\"\t\\\"open_c1\\\" : false, \\n\"\n\t\t\"\t\\\"open_c2\\\" : false, \\n\"\n\t\t\"\t\\\"open_c3\\\" : true \\n\"\n\t\t\"} \\n\"\n\t\t;\n\tdtexf_create(cfg);\n}\n\nTestSprite::~TestSprite()\n{\n\tdtexf_release();\n}\n\nvoid TestSprite::Load()\n{\n\t{\n\t\tej_package* pkg = dtexf_c3_load_pkg(\"2005mojin\", \"2005mojin.epd\", 1);\n\t\tm_spr = new eejoy2d::EJSprite(pkg, \"2005mojin1_attack1_1\");\n\t\tdtexf_c3_load_pkg(\"2005mojin\", \"2005mojin.epp\", 1);\n\t}\n\tdtexf_c3_load_pkg_finish();\n\n\tm_spr2 = new eejoy2d::EJSprite(dtexf_create_sprite(\"360.png\"));\n\tm_spr2->Translate(300, 0);\n}\n\nvoid TestSprite::Update()\n{\n\tm_spr->Update();\n}\n\nvoid TestSprite::Draw() const\n{\n\teejoy2d::EJScreen* scr = eejoy2d::EJScreen::Instance();\n\tassert(scr);\n\tscr->Bind();\n\tscr->Clear();\n\n\tm_spr->Draw(100, 100);\n\tm_spr2->Draw(200, 200);\n\n\tscr->UnBind();\n}\n\n}<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB\n \n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n \n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\/* create and drop of databases *\/\n\n#include \"mysql_priv.h\"\n#include \"sql_acl.h\"\n#include <my_dir.h>\n#include <m_ctype.h>\n#ifdef __WIN__\n#include <direct.h>\n#endif\n\nstatic long mysql_rm_known_files(THD *thd, MY_DIR *dirp, const char *path,\n\t\t\t\t uint level);\n\n\/* db-name is already validated when we come here *\/\n\nvoid mysql_create_db(THD *thd, char *db, uint create_options)\n{\n char\t path[FN_REFLEN+16];\n MY_DIR *dirp;\n long result=1;\n DBUG_ENTER(\"mysql_create_db\");\n \n VOID(pthread_mutex_lock(&LOCK_mysql_create_db));\n VOID(pthread_mutex_lock(&LOCK_open));\n\n \/\/ do not create database if another thread is holding read lock\n if (global_read_lock)\n {\n if (thd->global_read_lock)\n {\n net_printf(&thd->net, ER_CREATE_DB_WITH_READ_LOCK);\n VOID(pthread_mutex_unlock(&LOCK_open));\n goto exit;\n }\n while (global_read_lock && ! thd->killed)\n {\n (void) pthread_cond_wait(&COND_refresh,&LOCK_open);\n }\n \n if (thd->killed)\n {\n net_printf(&thd->net, ER_SERVER_SHUTDOWN);\n VOID(pthread_mutex_unlock(&LOCK_open));\n goto exit;\n }\n\n }\n \n VOID(pthread_mutex_unlock(&LOCK_open));\n\n \/* Check directory *\/\n (void)sprintf(path,\"%s\/%s\", mysql_data_home, db);\n unpack_dirname(path,path);\t\t\t\/\/ Convert if not unix\n if ((dirp = my_dir(path,MYF(MY_DONT_SORT))))\n {\n my_dirend(dirp);\n if (!(create_options & HA_LEX_CREATE_IF_NOT_EXISTS))\n {\n net_printf(&thd->net,ER_DB_CREATE_EXISTS,db);\n goto exit;\n }\n result = 0;\n }\n else\n {\n strend(path)[-1]=0;\t\t\t\t\/\/ Remove last '\/' from path\n if (my_mkdir(path,0777,MYF(0)) < 0)\n {\n net_printf(&thd->net,ER_CANT_CREATE_DB,db,my_errno);\n goto exit;\n }\n }\n if (!thd->query)\n {\n thd->query = path;\n thd->query_length = (uint) (strxmov(path,\"create database \", db, NullS)-\n\t\t\t\tpath);\n }\n {\n mysql_update_log.write(thd,thd->query, thd->query_length);\n if (mysql_bin_log.is_open())\n {\n Query_log_event qinfo(thd, thd->query);\n mysql_bin_log.write(&qinfo);\n }\n }\n if (thd->query == path)\n {\n thd->query = 0; \/\/ just in case\n thd->query_length = 0;\n }\n send_ok(&thd->net, result);\n\nexit:\n VOID(pthread_mutex_unlock(&LOCK_mysql_create_db));\n DBUG_VOID_RETURN;\n}\n\nconst char *del_exts[]=\n{\".frm\",\".ISM\",\".ISD\",\".ISM\",\".HSH\",\".DAT\",\".MRG\",\".MYI\",\".MYD\", \".db\", \".BAK\", NullS};\nstatic TYPELIB deletable_extentions=\n{array_elements(del_exts)-1,\"del_exts\", del_exts};\n\n\n\/* db-name is already validated when we come here *\/\n\nvoid mysql_rm_db(THD *thd,char *db,bool if_exists)\n{\n long deleted=0;\n char\tpath[FN_REFLEN+16];\n MY_DIR *dirp;\n DBUG_ENTER(\"mysql_rm_db\");\n\n VOID(pthread_mutex_lock(&LOCK_mysql_create_db));\n VOID(pthread_mutex_lock(&LOCK_open));\n\n \/\/ do not drop database if another thread is holding read lock\n if (global_read_lock)\n {\n if (thd->global_read_lock)\n {\n net_printf(&thd->net, ER_DROP_DB_WITH_READ_LOCK);\n goto exit;\n }\n while (global_read_lock && ! thd->killed)\n {\n (void) pthread_cond_wait(&COND_refresh,&LOCK_open);\n }\n\n if (thd->killed)\n {\n net_printf(&thd->net, ER_SERVER_SHUTDOWN);\n goto exit;\n }\n }\n\n (void) sprintf(path,\"%s\/%s\",mysql_data_home,db);\n unpack_dirname(path,path);\t\t\t\/\/ Convert if not unix\n \/* See if the directory exists *\/\n if (!(dirp = my_dir(path,MYF(MY_WME | MY_DONT_SORT))))\n {\n if (!if_exists)\n net_printf(&thd->net,ER_DB_DROP_EXISTS,db);\n else\n send_ok(&thd->net,0);\n goto exit;\n }\n remove_db_from_cache(db);\n\n if ((deleted=mysql_rm_known_files(thd, dirp, path,0)) >= 0)\n {\n if (!thd->query)\n {\n thd->query = path;\n thd->query_length = (uint) (strxmov(path,\"drop database \", db, NullS)-\n\t\t\t\t path);\n }\n mysql_update_log.write(thd, thd->query, thd->query_length);\n if (mysql_bin_log.is_open())\n {\n Query_log_event qinfo(thd, thd->query);\n mysql_bin_log.write(&qinfo);\n }\n if (thd->query == path)\n {\n thd->query = 0; \/\/ just in case\n thd->query_length = 0;\n }\n send_ok(&thd->net,(ulong) deleted);\n }\n\nexit:\n VOID(pthread_mutex_unlock(&LOCK_open));\n VOID(pthread_mutex_unlock(&LOCK_mysql_create_db));\n\n \/* If there are running queries on the tables, MySQL needs to get\n access to LOCK_open to end them. InnoDB on the other hand waits\n for the queries to end before dropping the database. That is why we\n must do the dropping outside of the mutexes above, otherwise the server\n always hangs if there are running queries. We only drop inside InnoDB\n if deleted got value >= 0 which means that it was successful. *\/\n\n if (deleted >= 0)\n ha_drop_database(path);\n\n DBUG_VOID_RETURN;\n}\n\n\/*\n Removes files with known extensions plus all found subdirectories that\n are 2 digits (raid directories).\n*\/\n\nstatic long mysql_rm_known_files(THD *thd, MY_DIR *dirp, const char *org_path,\n\t\t\t\t uint level)\n{\n long deleted=0;\n ulong found_other_files=0;\n char filePath[FN_REFLEN];\n DBUG_ENTER(\"mysql_rm_known_files\");\n DBUG_PRINT(\"enter\",(\"path: %s\", org_path));\n \/* remove all files with known extensions *\/\n\n for (uint idx=2 ;\n idx < (uint) dirp->number_off_files && !thd->killed ;\n idx++)\n {\n FILEINFO *file=dirp->dir_entry+idx;\n DBUG_PRINT(\"info\",(\"Examining: %s\", file->name));\n\n \/* Check if file is a raid directory *\/\n if (isdigit(file->name[0]) && isdigit(file->name[1]) &&\n\t!file->name[2] && !level)\n {\n char newpath[FN_REFLEN];\n MY_DIR *new_dirp;\n strxmov(newpath,org_path,\"\/\",file->name,NullS);\n unpack_filename(newpath,newpath);\n if ((new_dirp = my_dir(newpath,MYF(MY_DONT_SORT))))\n {\n\tDBUG_PRINT(\"my\",(\"New subdir found: %s\", newpath));\n\tif ((mysql_rm_known_files(thd,new_dirp,newpath,1)) < 0)\n\t{\n\t my_dirend(dirp);\n\t DBUG_RETURN(-1);\n\t}\n }\n continue;\n }\n if (find_type(fn_ext(file->name),&deletable_extentions,1+2) <= 0)\n {\n found_other_files++;\n continue;\n }\n strxmov(filePath,org_path,\"\/\",file->name,NullS);\n unpack_filename(filePath,filePath);\n if (my_delete(filePath,MYF(MY_WME)))\n {\n net_printf(&thd->net,ER_DB_DROP_DELETE,filePath,my_error);\n my_dirend(dirp);\n DBUG_RETURN(-1);\n }\n deleted++;\n }\n\n my_dirend(dirp);\n\n if (thd->killed)\n {\n send_error(&thd->net,ER_SERVER_SHUTDOWN);\n DBUG_RETURN(-1);\n }\n\n \/*\n If the directory is a symbolic link, remove the link first, then\n remove the directory the symbolic link pointed at\n *\/\n if (!found_other_files)\n {\n char tmp_path[FN_REFLEN], *pos;\n char *path=unpack_filename(tmp_path,org_path);\n#ifdef HAVE_READLINK\n int error;\n\n \/* Remove end FN_LIBCHAR as this causes problem on Linux in readlink *\/\n pos=strend(path);\n if (pos > path && pos[-1] == FN_LIBCHAR)\n *--pos=0;\n\n if ((error=my_readlink(filePath, path, MYF(MY_WME))) < 0)\n DBUG_RETURN(-1);\n if (!error)\n {\n if (my_delete(path,MYF(!level ? MY_WME : 0)))\n {\n\t\/* Don't give errors if we can't delete 'RAID' directory *\/\n\tif (level)\n\t DBUG_RETURN(deleted);\n\tsend_error(&thd->net);\n\tDBUG_RETURN(-1);\n }\n \/* Delete directory symbolic link pointed at *\/\n path= filePath;\n }\n#endif\n \/* Remove last FN_LIBCHAR to not cause a probelm on OS\/2 *\/\n pos=strend(path);\n if (pos > path && pos[-1] == FN_LIBCHAR)\n *--pos=0;\n \/* Don't give errors if we can't delete 'RAID' directory *\/\n if (rmdir(path) < 0 && !level)\n {\n net_printf(&thd->net,ER_DB_DROP_RMDIR, path,errno);\n DBUG_RETURN(-1);\n }\n }\n DBUG_RETURN(deleted);\n}\n\n\nbool mysql_change_db(THD *thd,const char *name)\n{\n int length;\n char *dbname=my_strdup((char*) name,MYF(MY_WME));\n char\tpath[FN_REFLEN];\n uint db_access;\n DBUG_ENTER(\"mysql_change_db\");\n\n if (!dbname || !(length=strip_sp(dbname)))\n {\n x_free(dbname);\t\t\t\t\/* purecov: inspected *\/\n send_error(&thd->net,ER_NO_DB_ERROR);\t\/* purecov: inspected *\/\n DBUG_RETURN(1);\t\t\t\t\/* purecov: inspected *\/\n }\n if ((length > NAME_LEN) || check_db_name(dbname))\n {\n net_printf(&thd->net,ER_WRONG_DB_NAME, dbname);\n x_free(dbname);\n DBUG_RETURN(1);\n }\n DBUG_PRINT(\"general\",(\"Use database: %s\", dbname));\n if (test_all_bits(thd->master_access,DB_ACLS))\n db_access=DB_ACLS;\n else\n db_access= (acl_get(thd->host,thd->ip,(char*) &thd->remote.sin_addr,\n\t\t\tthd->priv_user,dbname) |\n\t\tthd->master_access);\n if (!(db_access & DB_ACLS) && (!grant_option || check_grant_db(thd,dbname)))\n {\n net_printf(&thd->net,ER_DBACCESS_DENIED_ERROR,\n\t thd->priv_user,\n\t thd->host ? thd->host : thd->ip ? thd->ip : \"unknown\",\n\t dbname);\n mysql_log.write(thd,COM_INIT_DB,ER(ER_DBACCESS_DENIED_ERROR),\n\t\t thd->priv_user,\n\t\t thd->host ? thd->host : thd->ip ? thd->ip : \"unknown\",\n\t\t dbname);\n my_free(dbname,MYF(0));\n DBUG_RETURN(1);\n }\n\n (void) sprintf(path,\"%s\/%s\",mysql_data_home,dbname);\n length=unpack_dirname(path,path);\t\t\/\/ Convert if not unix\n if (length && path[length-1] == FN_LIBCHAR)\n path[length-1]=0;\t\t\t\t\/\/ remove ending '\\'\n if (access(path,F_OK))\n {\n net_printf(&thd->net,ER_BAD_DB_ERROR,dbname);\n my_free(dbname,MYF(0));\n DBUG_RETURN(1);\n }\n send_ok(&thd->net);\n x_free(thd->db);\n thd->db=dbname;\n thd->db_access=db_access;\n DBUG_RETURN(0);\n}\n<commit_msg>sql_db.cc: On Monty's suggestion move ha_drop_database back inside LOCK_mysql_create_db, but we release LOCK_open during it to let possible running queries complete. I tested this and it seemed to work also in complex concurrent DELETE, SELECT, DROP DATABASE, and CREATE DATABASE situations<commit_after>\/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB\n \n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n \n This program is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA *\/\n\n\n\/* create and drop of databases *\/\n\n#include \"mysql_priv.h\"\n#include \"sql_acl.h\"\n#include <my_dir.h>\n#include <m_ctype.h>\n#ifdef __WIN__\n#include <direct.h>\n#endif\n\nstatic long mysql_rm_known_files(THD *thd, MY_DIR *dirp, const char *path,\n\t\t\t\t uint level);\n\n\/* db-name is already validated when we come here *\/\n\nvoid mysql_create_db(THD *thd, char *db, uint create_options)\n{\n char\t path[FN_REFLEN+16];\n MY_DIR *dirp;\n long result=1;\n DBUG_ENTER(\"mysql_create_db\");\n \n VOID(pthread_mutex_lock(&LOCK_mysql_create_db));\n VOID(pthread_mutex_lock(&LOCK_open));\n\n \/\/ do not create database if another thread is holding read lock\n if (global_read_lock)\n {\n if (thd->global_read_lock)\n {\n net_printf(&thd->net, ER_CREATE_DB_WITH_READ_LOCK);\n VOID(pthread_mutex_unlock(&LOCK_open));\n goto exit;\n }\n while (global_read_lock && ! thd->killed)\n {\n (void) pthread_cond_wait(&COND_refresh,&LOCK_open);\n }\n \n if (thd->killed)\n {\n net_printf(&thd->net, ER_SERVER_SHUTDOWN);\n VOID(pthread_mutex_unlock(&LOCK_open));\n goto exit;\n }\n\n }\n \n VOID(pthread_mutex_unlock(&LOCK_open));\n\n \/* Check directory *\/\n (void)sprintf(path,\"%s\/%s\", mysql_data_home, db);\n unpack_dirname(path,path);\t\t\t\/\/ Convert if not unix\n if ((dirp = my_dir(path,MYF(MY_DONT_SORT))))\n {\n my_dirend(dirp);\n if (!(create_options & HA_LEX_CREATE_IF_NOT_EXISTS))\n {\n net_printf(&thd->net,ER_DB_CREATE_EXISTS,db);\n goto exit;\n }\n result = 0;\n }\n else\n {\n strend(path)[-1]=0;\t\t\t\t\/\/ Remove last '\/' from path\n if (my_mkdir(path,0777,MYF(0)) < 0)\n {\n net_printf(&thd->net,ER_CANT_CREATE_DB,db,my_errno);\n goto exit;\n }\n }\n if (!thd->query)\n {\n thd->query = path;\n thd->query_length = (uint) (strxmov(path,\"create database \", db, NullS)-\n\t\t\t\tpath);\n }\n {\n mysql_update_log.write(thd,thd->query, thd->query_length);\n if (mysql_bin_log.is_open())\n {\n Query_log_event qinfo(thd, thd->query);\n mysql_bin_log.write(&qinfo);\n }\n }\n if (thd->query == path)\n {\n thd->query = 0; \/\/ just in case\n thd->query_length = 0;\n }\n send_ok(&thd->net, result);\n\nexit:\n VOID(pthread_mutex_unlock(&LOCK_mysql_create_db));\n DBUG_VOID_RETURN;\n}\n\nconst char *del_exts[]=\n{\".frm\",\".ISM\",\".ISD\",\".ISM\",\".HSH\",\".DAT\",\".MRG\",\".MYI\",\".MYD\", \".db\", \".BAK\", NullS};\nstatic TYPELIB deletable_extentions=\n{array_elements(del_exts)-1,\"del_exts\", del_exts};\n\n\n\/* db-name is already validated when we come here *\/\n\nvoid mysql_rm_db(THD *thd,char *db,bool if_exists)\n{\n long deleted=0;\n char\tpath[FN_REFLEN+16];\n MY_DIR *dirp;\n DBUG_ENTER(\"mysql_rm_db\");\n\n VOID(pthread_mutex_lock(&LOCK_mysql_create_db));\n VOID(pthread_mutex_lock(&LOCK_open));\n\n \/\/ do not drop database if another thread is holding read lock\n if (global_read_lock)\n {\n if (thd->global_read_lock)\n {\n net_printf(&thd->net, ER_DROP_DB_WITH_READ_LOCK);\n goto exit;\n }\n while (global_read_lock && ! thd->killed)\n {\n (void) pthread_cond_wait(&COND_refresh,&LOCK_open);\n }\n\n if (thd->killed)\n {\n net_printf(&thd->net, ER_SERVER_SHUTDOWN);\n goto exit;\n }\n }\n\n (void) sprintf(path,\"%s\/%s\",mysql_data_home,db);\n unpack_dirname(path,path);\t\t\t\/\/ Convert if not unix\n \/* See if the directory exists *\/\n if (!(dirp = my_dir(path,MYF(MY_WME | MY_DONT_SORT))))\n {\n if (!if_exists)\n net_printf(&thd->net,ER_DB_DROP_EXISTS,db);\n else\n send_ok(&thd->net,0);\n goto exit;\n }\n remove_db_from_cache(db);\n\n if ((deleted=mysql_rm_known_files(thd, dirp, path,0)) >= 0)\n {\n \/* If there are running queries on the tables, MySQL needs to get\n access to LOCK_open to end them. InnoDB on the other hand waits\n for the queries to end before dropping the database. That is why we\n must do the dropping with LOCK_open released. *\/\n\n VOID(pthread_mutex_unlock(&LOCK_open));\n ha_drop_database(path);\n VOID(pthread_mutex_lock(&LOCK_open));\n\n if (!thd->query)\n {\n thd->query = path;\n thd->query_length = (uint) (strxmov(path,\"drop database \", db, NullS)-\n\t\t\t\t path);\n }\n mysql_update_log.write(thd, thd->query, thd->query_length);\n if (mysql_bin_log.is_open())\n {\n Query_log_event qinfo(thd, thd->query);\n mysql_bin_log.write(&qinfo);\n }\n if (thd->query == path)\n {\n thd->query = 0; \/\/ just in case\n thd->query_length = 0;\n }\n send_ok(&thd->net,(ulong) deleted);\n }\n\nexit:\n VOID(pthread_mutex_unlock(&LOCK_open));\n VOID(pthread_mutex_unlock(&LOCK_mysql_create_db));\n\n DBUG_VOID_RETURN;\n}\n\n\/*\n Removes files with known extensions plus all found subdirectories that\n are 2 digits (raid directories).\n*\/\n\nstatic long mysql_rm_known_files(THD *thd, MY_DIR *dirp, const char *org_path,\n\t\t\t\t uint level)\n{\n long deleted=0;\n ulong found_other_files=0;\n char filePath[FN_REFLEN];\n DBUG_ENTER(\"mysql_rm_known_files\");\n DBUG_PRINT(\"enter\",(\"path: %s\", org_path));\n \/* remove all files with known extensions *\/\n\n for (uint idx=2 ;\n idx < (uint) dirp->number_off_files && !thd->killed ;\n idx++)\n {\n FILEINFO *file=dirp->dir_entry+idx;\n DBUG_PRINT(\"info\",(\"Examining: %s\", file->name));\n\n \/* Check if file is a raid directory *\/\n if (isdigit(file->name[0]) && isdigit(file->name[1]) &&\n\t!file->name[2] && !level)\n {\n char newpath[FN_REFLEN];\n MY_DIR *new_dirp;\n strxmov(newpath,org_path,\"\/\",file->name,NullS);\n unpack_filename(newpath,newpath);\n if ((new_dirp = my_dir(newpath,MYF(MY_DONT_SORT))))\n {\n\tDBUG_PRINT(\"my\",(\"New subdir found: %s\", newpath));\n\tif ((mysql_rm_known_files(thd,new_dirp,newpath,1)) < 0)\n\t{\n\t my_dirend(dirp);\n\t DBUG_RETURN(-1);\n\t}\n }\n continue;\n }\n if (find_type(fn_ext(file->name),&deletable_extentions,1+2) <= 0)\n {\n found_other_files++;\n continue;\n }\n strxmov(filePath,org_path,\"\/\",file->name,NullS);\n unpack_filename(filePath,filePath);\n if (my_delete(filePath,MYF(MY_WME)))\n {\n net_printf(&thd->net,ER_DB_DROP_DELETE,filePath,my_error);\n my_dirend(dirp);\n DBUG_RETURN(-1);\n }\n deleted++;\n }\n\n my_dirend(dirp);\n\n if (thd->killed)\n {\n send_error(&thd->net,ER_SERVER_SHUTDOWN);\n DBUG_RETURN(-1);\n }\n\n \/*\n If the directory is a symbolic link, remove the link first, then\n remove the directory the symbolic link pointed at\n *\/\n if (!found_other_files)\n {\n char tmp_path[FN_REFLEN], *pos;\n char *path=unpack_filename(tmp_path,org_path);\n#ifdef HAVE_READLINK\n int error;\n\n \/* Remove end FN_LIBCHAR as this causes problem on Linux in readlink *\/\n pos=strend(path);\n if (pos > path && pos[-1] == FN_LIBCHAR)\n *--pos=0;\n\n if ((error=my_readlink(filePath, path, MYF(MY_WME))) < 0)\n DBUG_RETURN(-1);\n if (!error)\n {\n if (my_delete(path,MYF(!level ? MY_WME : 0)))\n {\n\t\/* Don't give errors if we can't delete 'RAID' directory *\/\n\tif (level)\n\t DBUG_RETURN(deleted);\n\tsend_error(&thd->net);\n\tDBUG_RETURN(-1);\n }\n \/* Delete directory symbolic link pointed at *\/\n path= filePath;\n }\n#endif\n \/* Remove last FN_LIBCHAR to not cause a probelm on OS\/2 *\/\n pos=strend(path);\n if (pos > path && pos[-1] == FN_LIBCHAR)\n *--pos=0;\n \/* Don't give errors if we can't delete 'RAID' directory *\/\n if (rmdir(path) < 0 && !level)\n {\n net_printf(&thd->net,ER_DB_DROP_RMDIR, path,errno);\n DBUG_RETURN(-1);\n }\n }\n DBUG_RETURN(deleted);\n}\n\n\nbool mysql_change_db(THD *thd,const char *name)\n{\n int length;\n char *dbname=my_strdup((char*) name,MYF(MY_WME));\n char\tpath[FN_REFLEN];\n uint db_access;\n DBUG_ENTER(\"mysql_change_db\");\n\n if (!dbname || !(length=strip_sp(dbname)))\n {\n x_free(dbname);\t\t\t\t\/* purecov: inspected *\/\n send_error(&thd->net,ER_NO_DB_ERROR);\t\/* purecov: inspected *\/\n DBUG_RETURN(1);\t\t\t\t\/* purecov: inspected *\/\n }\n if ((length > NAME_LEN) || check_db_name(dbname))\n {\n net_printf(&thd->net,ER_WRONG_DB_NAME, dbname);\n x_free(dbname);\n DBUG_RETURN(1);\n }\n DBUG_PRINT(\"general\",(\"Use database: %s\", dbname));\n if (test_all_bits(thd->master_access,DB_ACLS))\n db_access=DB_ACLS;\n else\n db_access= (acl_get(thd->host,thd->ip,(char*) &thd->remote.sin_addr,\n\t\t\tthd->priv_user,dbname) |\n\t\tthd->master_access);\n if (!(db_access & DB_ACLS) && (!grant_option || check_grant_db(thd,dbname)))\n {\n net_printf(&thd->net,ER_DBACCESS_DENIED_ERROR,\n\t thd->priv_user,\n\t thd->host ? thd->host : thd->ip ? thd->ip : \"unknown\",\n\t dbname);\n mysql_log.write(thd,COM_INIT_DB,ER(ER_DBACCESS_DENIED_ERROR),\n\t\t thd->priv_user,\n\t\t thd->host ? thd->host : thd->ip ? thd->ip : \"unknown\",\n\t\t dbname);\n my_free(dbname,MYF(0));\n DBUG_RETURN(1);\n }\n\n (void) sprintf(path,\"%s\/%s\",mysql_data_home,dbname);\n length=unpack_dirname(path,path);\t\t\/\/ Convert if not unix\n if (length && path[length-1] == FN_LIBCHAR)\n path[length-1]=0;\t\t\t\t\/\/ remove ending '\\'\n if (access(path,F_OK))\n {\n net_printf(&thd->net,ER_BAD_DB_ERROR,dbname);\n my_free(dbname,MYF(0));\n DBUG_RETURN(1);\n }\n send_ok(&thd->net);\n x_free(thd->db);\n thd->db=dbname;\n thd->db_access=db_access;\n DBUG_RETURN(0);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"includes.h\"\n\nnamespace fancy {\n\n ostream& warn(string message)\n {\n cout << \"[WARNING] \" << message;\n return cout;\n }\n\n ostream& warnln(string message)\n {\n cout << \"[WARNING] \" << message << endl;\n return cout;\n }\n\n ostream& error(string message)\n {\n cerr << \"[ERROR] \" << message;\n return cout;\n }\n\n ostream& errorln(string message)\n {\n cerr << \"[ERROR] \" << message << endl;\n return cout;\n }\n\n}\n<commit_msg>src\/utils: fixed error() and errorln() to return cerr and not cout.<commit_after>#include \"includes.h\"\n\nnamespace fancy {\n\n ostream& warn(string message)\n {\n cout << \"[WARNING] \" << message;\n return cout;\n }\n\n ostream& warnln(string message)\n {\n cout << \"[WARNING] \" << message << endl;\n return cout;\n }\n\n ostream& error(string message)\n {\n cerr << \"[ERROR] \" << message;\n return cerr;\n }\n\n ostream& errorln(string message)\n {\n cerr << \"[ERROR] \" << message << endl;\n return cerr;\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed to the .NET Foundation under one or more agreements.\n\/\/ The .NET Foundation licenses this file to you under the MIT license.\n\/\/ See the LICENSE file in the project root for more information.\n\n\n\/\/*****************************************************************************\n\/\/ unixinterface.cpp\n\/\/\n\/\/ Implementation for the interface exposed by libcoreclr.so\n\/\/\n\n\/\/*****************************************************************************\n\n#include \"stdafx.h\"\n#include <utilcode.h>\n#include <corhost.h>\n#include <configuration.h>\n#ifdef FEATURE_GDBJIT\n#include \"..\/..\/vm\/gdbjithelpers.h\"\n#endif \/\/ FEATURE_GDBJIT\n\ntypedef int (STDMETHODCALLTYPE *HostMain)(\n const int argc,\n const wchar_t** argv\n );\n\n#define ASSERTE_ALL_BUILDS(expr) _ASSERTE_ALL_BUILDS(__FILE__, (expr))\n\n\/\/ Holder for const wide strings\ntypedef NewArrayHolder<const WCHAR> ConstWStringHolder;\n\n\/\/ Holder for array of wide strings\nclass ConstWStringArrayHolder : public NewArrayHolder<LPCWSTR>\n{\n int m_cElements;\n\npublic:\n ConstWStringArrayHolder() :\n NewArrayHolder<LPCWSTR>(),\n m_cElements(0)\n {\n }\n\n void Set(LPCWSTR* value, int cElements) \n { \n NewArrayHolder<LPCWSTR>::operator=(value); \n m_cElements = cElements;\n } \n\n ~ConstWStringArrayHolder()\n {\n for (int i = 0; i < m_cElements; i++)\n {\n delete [] this->m_value[i];\n }\n }\n};\n\n\/\/ Convert 8 bit string to unicode\nstatic LPCWSTR StringToUnicode(LPCSTR str)\n{\n int length = MultiByteToWideChar(CP_UTF8, 0, str, -1, NULL, 0);\n ASSERTE_ALL_BUILDS(length != 0);\n\n LPWSTR result = new (nothrow) WCHAR[length];\n ASSERTE_ALL_BUILDS(result != NULL);\n \n length = MultiByteToWideChar(CP_UTF8, 0, str, -1, result, length);\n ASSERTE_ALL_BUILDS(length != 0);\n\n return result;\n}\n\n\/\/ Convert 8 bit string array to unicode string array\nstatic LPCWSTR* StringArrayToUnicode(int argc, LPCSTR* argv)\n{\n LPCWSTR* argvW = nullptr;\n \n if (argc > 0)\n {\n argvW = new (nothrow) LPCWSTR[argc];\n ASSERTE_ALL_BUILDS(argvW != 0);\n \n for (int i = 0; i < argc; i++)\n {\n argvW[i] = StringToUnicode(argv[i]);\n }\n }\n\n return argvW;\n}\n\nstatic void InitializeStartupFlags(STARTUP_FLAGS* startupFlagsRef)\n{\n STARTUP_FLAGS startupFlags = static_cast<STARTUP_FLAGS>(\n STARTUP_FLAGS::STARTUP_LOADER_OPTIMIZATION_SINGLE_DOMAIN |\n STARTUP_FLAGS::STARTUP_SINGLE_APPDOMAIN);\n\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.Concurrent\"), CLRConfig::UNSUPPORTED_gcConcurrent))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_CONCURRENT_GC);\n }\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.Server\"), CLRConfig::UNSUPPORTED_gcServer))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_SERVER_GC);\n }\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.RetainVM\"), CLRConfig::UNSUPPORTED_GCRetainVM))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_HOARD_GC_VM);\n }\n\n *startupFlagsRef = startupFlags;\n}\n\nstatic void ConvertConfigPropertiesToUnicode(\n const char** propertyKeys,\n const char** propertyValues,\n int propertyCount,\n LPCWSTR** propertyKeysWRef,\n LPCWSTR** propertyValuesWRef)\n{\n LPCWSTR* propertyKeysW = new (nothrow) LPCWSTR[propertyCount];\n ASSERTE_ALL_BUILDS(propertyKeysW != nullptr);\n\n LPCWSTR* propertyValuesW = new (nothrow) LPCWSTR[propertyCount];\n ASSERTE_ALL_BUILDS(propertyValuesW != nullptr);\n\n for (int propertyIndex = 0; propertyIndex < propertyCount; ++propertyIndex)\n {\n propertyKeysW[propertyIndex] = StringToUnicode(propertyKeys[propertyIndex]);\n propertyValuesW[propertyIndex] = StringToUnicode(propertyValues[propertyIndex]);\n }\n\n *propertyKeysWRef = propertyKeysW;\n *propertyValuesWRef = propertyValuesW;\n}\n\n#if !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\/\/ Reference to the global holding the path to the JIT\nextern \"C\" LPCWSTR g_CLRJITPath;\n#endif \/\/ !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\n#ifdef FEATURE_GDBJIT\nGetInfoForMethodDelegate getInfoForMethodDelegate = NULL;\nextern \"C\" int coreclr_create_delegate(void*, unsigned int, const char*, const char*, const char*, void**);\n#endif \/\/FEATURE_GDBJIT\n\n\/\/\n\/\/ Initialize the CoreCLR. Creates and starts CoreCLR host and creates an app domain\n\/\/\n\/\/ Parameters:\n\/\/ exePath - Absolute path of the executable that invoked the ExecuteAssembly\n\/\/ appDomainFriendlyName - Friendly name of the app domain that will be created to execute the assembly\n\/\/ propertyCount - Number of properties (elements of the following two arguments)\n\/\/ propertyKeys - Keys of properties of the app domain\n\/\/ propertyValues - Values of properties of the app domain\n\/\/ hostHandle - Output parameter, handle of the created host\n\/\/ domainId - Output parameter, id of the created app domain \n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_initialize(\n const char* exePath,\n const char* appDomainFriendlyName,\n int propertyCount,\n const char** propertyKeys,\n const char** propertyValues,\n void** hostHandle,\n unsigned int* domainId)\n{\n HRESULT hr;\n#ifdef FEATURE_PAL\n DWORD error = PAL_InitializeCoreCLR(exePath);\n hr = HRESULT_FROM_WIN32(error);\n\n \/\/ If PAL initialization failed, then we should return right away and avoid\n \/\/ calling any other APIs because they can end up calling into the PAL layer again.\n if (FAILED(hr))\n {\n return hr;\n }\n#endif\n\n ReleaseHolder<ICLRRuntimeHost2> host;\n\n hr = CorHost2::CreateObject(IID_ICLRRuntimeHost2, (void**)&host);\n IfFailRet(hr);\n\n ConstWStringHolder appDomainFriendlyNameW = StringToUnicode(appDomainFriendlyName);\n\n LPCWSTR* propertyKeysW;\n LPCWSTR* propertyValuesW;\n ConvertConfigPropertiesToUnicode(\n propertyKeys,\n propertyValues,\n propertyCount,\n &propertyKeysW,\n &propertyValuesW);\n\n \/\/ This will take ownership of propertyKeysWTemp and propertyValuesWTemp\n Configuration::InitializeConfigurationKnobs(propertyCount, propertyKeysW, propertyValuesW);\n\n#if !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n \/\/ Fetch the path to JIT binary, if specified\n g_CLRJITPath = Configuration::GetKnobStringValue(W(\"JIT_PATH\"));\n#endif \/\/ !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\n STARTUP_FLAGS startupFlags;\n InitializeStartupFlags(&startupFlags);\n\n hr = host->SetStartupFlags(startupFlags);\n IfFailRet(hr);\n\n hr = host->Start();\n IfFailRet(hr);\n\n hr = host->CreateAppDomainWithManager(\n appDomainFriendlyNameW,\n \/\/ Flags:\n \/\/ APPDOMAIN_ENABLE_PLATFORM_SPECIFIC_APPS\n \/\/ - By default CoreCLR only allows platform neutral assembly to be run. To allow\n \/\/ assemblies marked as platform specific, include this flag\n \/\/\n \/\/ APPDOMAIN_ENABLE_PINVOKE_AND_CLASSIC_COMINTEROP\n \/\/ - Allows sandboxed applications to make P\/Invoke calls and use COM interop\n \/\/\n \/\/ APPDOMAIN_SECURITY_SANDBOXED\n \/\/ - Enables sandboxing. If not set, the app is considered full trust\n \/\/\n \/\/ APPDOMAIN_IGNORE_UNHANDLED_EXCEPTION\n \/\/ - Prevents the application from being torn down if a managed exception is unhandled\n \/\/\n APPDOMAIN_ENABLE_PLATFORM_SPECIFIC_APPS |\n APPDOMAIN_ENABLE_PINVOKE_AND_CLASSIC_COMINTEROP |\n APPDOMAIN_DISABLE_TRANSPARENCY_ENFORCEMENT,\n NULL, \/\/ Name of the assembly that contains the AppDomainManager implementation\n NULL, \/\/ The AppDomainManager implementation type name\n propertyCount,\n propertyKeysW,\n propertyValuesW,\n (DWORD *)domainId);\n\n if (SUCCEEDED(hr))\n {\n host.SuppressRelease();\n *hostHandle = host;\n#ifdef FEATURE_GDBJIT\n\n hr = coreclr_create_delegate(*hostHandle,\n *domainId,\n \"SOS.NETCore\",\n \"SOS.SymbolReader\",\n \"GetInfoForMethod\",\n (void**)&getInfoForMethodDelegate);\n\n if (!SUCCEEDED(hr))\n {\n fprintf(stderr,\n \"Can't create delegate for 'SOS.SymbolReader.GetInfoForMethod' \"\n \"method - status: 0x%08x\\n\", hr);\n }\n\n hr = S_OK; \/\/ We don't need to fail if we can't create delegate\n#endif\n }\n return hr;\n}\n\n\/\/\n\/\/ Shutdown CoreCLR. It unloads the app domain and stops the CoreCLR host.\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_shutdown(\n void* hostHandle,\n unsigned int domainId)\n{\n ReleaseHolder<ICLRRuntimeHost2> host(reinterpret_cast<ICLRRuntimeHost2*>(hostHandle));\n\n HRESULT hr = host->UnloadAppDomain(domainId, true); \/\/ Wait until done\n IfFailRet(hr);\n\n hr = host->Stop();\n\n#ifdef FEATURE_PAL\n PAL_Shutdown();\n#endif\n\n return hr;\n}\n\n\/\/\n\/\/ Create a native callable delegate for a managed method.\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/ entryPointAssemblyName - Name of the assembly which holds the custom entry point\n\/\/ entryPointTypeName - Name of the type which holds the custom entry point\n\/\/ entryPointMethodName - Name of the method which is the custom entry point\n\/\/ delegate - Output parameter, the function stores a pointer to the delegate at the specified address\n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_create_delegate(\n void* hostHandle,\n unsigned int domainId,\n const char* entryPointAssemblyName,\n const char* entryPointTypeName,\n const char* entryPointMethodName,\n void** delegate)\n{\n ICLRRuntimeHost2* host = reinterpret_cast<ICLRRuntimeHost2*>(hostHandle);\n\n ConstWStringHolder entryPointAssemblyNameW = StringToUnicode(entryPointAssemblyName);\n ConstWStringHolder entryPointTypeNameW = StringToUnicode(entryPointTypeName);\n ConstWStringHolder entryPointMethodNameW = StringToUnicode(entryPointMethodName);\n\n HRESULT hr = host->CreateDelegate(\n domainId,\n entryPointAssemblyNameW,\n entryPointTypeNameW,\n entryPointMethodNameW,\n (INT_PTR*)delegate);\n \n return hr;\n}\n\n\/\/\n\/\/ Execute a managed assembly with given arguments\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/ argc - Number of arguments passed to the executed assembly\n\/\/ argv - Array of arguments passed to the executed assembly\n\/\/ managedAssemblyPath - Path of the managed assembly to execute (or NULL if using a custom entrypoint).\n\/\/ exitCode - Exit code returned by the executed assembly\n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_execute_assembly(\n void* hostHandle,\n unsigned int domainId,\n int argc,\n const char** argv,\n const char* managedAssemblyPath,\n unsigned int* exitCode)\n{\n if (exitCode == NULL)\n {\n return HRESULT_FROM_WIN32(ERROR_INVALID_PARAMETER);\n }\n *exitCode = -1;\n\n ICLRRuntimeHost2* host = reinterpret_cast<ICLRRuntimeHost2*>(hostHandle);\n\n ConstWStringArrayHolder argvW;\n argvW.Set(StringArrayToUnicode(argc, argv), argc);\n \n ConstWStringHolder managedAssemblyPathW = StringToUnicode(managedAssemblyPath);\n\n HRESULT hr = host->ExecuteAssembly(domainId, managedAssemblyPathW, argc, argvW, (DWORD *)exitCode);\n IfFailRet(hr);\n\n return hr;\n}\n<commit_msg>Suppress SOS.NETCore.dll error msg in release mode (#6975)<commit_after>\/\/ Licensed to the .NET Foundation under one or more agreements.\n\/\/ The .NET Foundation licenses this file to you under the MIT license.\n\/\/ See the LICENSE file in the project root for more information.\n\n\n\/\/*****************************************************************************\n\/\/ unixinterface.cpp\n\/\/\n\/\/ Implementation for the interface exposed by libcoreclr.so\n\/\/\n\n\/\/*****************************************************************************\n\n#include \"stdafx.h\"\n#include <utilcode.h>\n#include <corhost.h>\n#include <configuration.h>\n#ifdef FEATURE_GDBJIT\n#include \"..\/..\/vm\/gdbjithelpers.h\"\n#endif \/\/ FEATURE_GDBJIT\n\ntypedef int (STDMETHODCALLTYPE *HostMain)(\n const int argc,\n const wchar_t** argv\n );\n\n#define ASSERTE_ALL_BUILDS(expr) _ASSERTE_ALL_BUILDS(__FILE__, (expr))\n\n\/\/ Holder for const wide strings\ntypedef NewArrayHolder<const WCHAR> ConstWStringHolder;\n\n\/\/ Holder for array of wide strings\nclass ConstWStringArrayHolder : public NewArrayHolder<LPCWSTR>\n{\n int m_cElements;\n\npublic:\n ConstWStringArrayHolder() :\n NewArrayHolder<LPCWSTR>(),\n m_cElements(0)\n {\n }\n\n void Set(LPCWSTR* value, int cElements) \n { \n NewArrayHolder<LPCWSTR>::operator=(value); \n m_cElements = cElements;\n } \n\n ~ConstWStringArrayHolder()\n {\n for (int i = 0; i < m_cElements; i++)\n {\n delete [] this->m_value[i];\n }\n }\n};\n\n\/\/ Convert 8 bit string to unicode\nstatic LPCWSTR StringToUnicode(LPCSTR str)\n{\n int length = MultiByteToWideChar(CP_UTF8, 0, str, -1, NULL, 0);\n ASSERTE_ALL_BUILDS(length != 0);\n\n LPWSTR result = new (nothrow) WCHAR[length];\n ASSERTE_ALL_BUILDS(result != NULL);\n \n length = MultiByteToWideChar(CP_UTF8, 0, str, -1, result, length);\n ASSERTE_ALL_BUILDS(length != 0);\n\n return result;\n}\n\n\/\/ Convert 8 bit string array to unicode string array\nstatic LPCWSTR* StringArrayToUnicode(int argc, LPCSTR* argv)\n{\n LPCWSTR* argvW = nullptr;\n \n if (argc > 0)\n {\n argvW = new (nothrow) LPCWSTR[argc];\n ASSERTE_ALL_BUILDS(argvW != 0);\n \n for (int i = 0; i < argc; i++)\n {\n argvW[i] = StringToUnicode(argv[i]);\n }\n }\n\n return argvW;\n}\n\nstatic void InitializeStartupFlags(STARTUP_FLAGS* startupFlagsRef)\n{\n STARTUP_FLAGS startupFlags = static_cast<STARTUP_FLAGS>(\n STARTUP_FLAGS::STARTUP_LOADER_OPTIMIZATION_SINGLE_DOMAIN |\n STARTUP_FLAGS::STARTUP_SINGLE_APPDOMAIN);\n\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.Concurrent\"), CLRConfig::UNSUPPORTED_gcConcurrent))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_CONCURRENT_GC);\n }\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.Server\"), CLRConfig::UNSUPPORTED_gcServer))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_SERVER_GC);\n }\n if (Configuration::GetKnobBooleanValue(W(\"System.GC.RetainVM\"), CLRConfig::UNSUPPORTED_GCRetainVM))\n {\n startupFlags = static_cast<STARTUP_FLAGS>(startupFlags | STARTUP_HOARD_GC_VM);\n }\n\n *startupFlagsRef = startupFlags;\n}\n\nstatic void ConvertConfigPropertiesToUnicode(\n const char** propertyKeys,\n const char** propertyValues,\n int propertyCount,\n LPCWSTR** propertyKeysWRef,\n LPCWSTR** propertyValuesWRef)\n{\n LPCWSTR* propertyKeysW = new (nothrow) LPCWSTR[propertyCount];\n ASSERTE_ALL_BUILDS(propertyKeysW != nullptr);\n\n LPCWSTR* propertyValuesW = new (nothrow) LPCWSTR[propertyCount];\n ASSERTE_ALL_BUILDS(propertyValuesW != nullptr);\n\n for (int propertyIndex = 0; propertyIndex < propertyCount; ++propertyIndex)\n {\n propertyKeysW[propertyIndex] = StringToUnicode(propertyKeys[propertyIndex]);\n propertyValuesW[propertyIndex] = StringToUnicode(propertyValues[propertyIndex]);\n }\n\n *propertyKeysWRef = propertyKeysW;\n *propertyValuesWRef = propertyValuesW;\n}\n\n#if !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\/\/ Reference to the global holding the path to the JIT\nextern \"C\" LPCWSTR g_CLRJITPath;\n#endif \/\/ !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\n#ifdef FEATURE_GDBJIT\nGetInfoForMethodDelegate getInfoForMethodDelegate = NULL;\nextern \"C\" int coreclr_create_delegate(void*, unsigned int, const char*, const char*, const char*, void**);\n#endif \/\/FEATURE_GDBJIT\n\n\/\/\n\/\/ Initialize the CoreCLR. Creates and starts CoreCLR host and creates an app domain\n\/\/\n\/\/ Parameters:\n\/\/ exePath - Absolute path of the executable that invoked the ExecuteAssembly\n\/\/ appDomainFriendlyName - Friendly name of the app domain that will be created to execute the assembly\n\/\/ propertyCount - Number of properties (elements of the following two arguments)\n\/\/ propertyKeys - Keys of properties of the app domain\n\/\/ propertyValues - Values of properties of the app domain\n\/\/ hostHandle - Output parameter, handle of the created host\n\/\/ domainId - Output parameter, id of the created app domain \n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_initialize(\n const char* exePath,\n const char* appDomainFriendlyName,\n int propertyCount,\n const char** propertyKeys,\n const char** propertyValues,\n void** hostHandle,\n unsigned int* domainId)\n{\n HRESULT hr;\n#ifdef FEATURE_PAL\n DWORD error = PAL_InitializeCoreCLR(exePath);\n hr = HRESULT_FROM_WIN32(error);\n\n \/\/ If PAL initialization failed, then we should return right away and avoid\n \/\/ calling any other APIs because they can end up calling into the PAL layer again.\n if (FAILED(hr))\n {\n return hr;\n }\n#endif\n\n ReleaseHolder<ICLRRuntimeHost2> host;\n\n hr = CorHost2::CreateObject(IID_ICLRRuntimeHost2, (void**)&host);\n IfFailRet(hr);\n\n ConstWStringHolder appDomainFriendlyNameW = StringToUnicode(appDomainFriendlyName);\n\n LPCWSTR* propertyKeysW;\n LPCWSTR* propertyValuesW;\n ConvertConfigPropertiesToUnicode(\n propertyKeys,\n propertyValues,\n propertyCount,\n &propertyKeysW,\n &propertyValuesW);\n\n \/\/ This will take ownership of propertyKeysWTemp and propertyValuesWTemp\n Configuration::InitializeConfigurationKnobs(propertyCount, propertyKeysW, propertyValuesW);\n\n#if !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n \/\/ Fetch the path to JIT binary, if specified\n g_CLRJITPath = Configuration::GetKnobStringValue(W(\"JIT_PATH\"));\n#endif \/\/ !defined(FEATURE_MERGE_JIT_AND_ENGINE)\n\n STARTUP_FLAGS startupFlags;\n InitializeStartupFlags(&startupFlags);\n\n hr = host->SetStartupFlags(startupFlags);\n IfFailRet(hr);\n\n hr = host->Start();\n IfFailRet(hr);\n\n hr = host->CreateAppDomainWithManager(\n appDomainFriendlyNameW,\n \/\/ Flags:\n \/\/ APPDOMAIN_ENABLE_PLATFORM_SPECIFIC_APPS\n \/\/ - By default CoreCLR only allows platform neutral assembly to be run. To allow\n \/\/ assemblies marked as platform specific, include this flag\n \/\/\n \/\/ APPDOMAIN_ENABLE_PINVOKE_AND_CLASSIC_COMINTEROP\n \/\/ - Allows sandboxed applications to make P\/Invoke calls and use COM interop\n \/\/\n \/\/ APPDOMAIN_SECURITY_SANDBOXED\n \/\/ - Enables sandboxing. If not set, the app is considered full trust\n \/\/\n \/\/ APPDOMAIN_IGNORE_UNHANDLED_EXCEPTION\n \/\/ - Prevents the application from being torn down if a managed exception is unhandled\n \/\/\n APPDOMAIN_ENABLE_PLATFORM_SPECIFIC_APPS |\n APPDOMAIN_ENABLE_PINVOKE_AND_CLASSIC_COMINTEROP |\n APPDOMAIN_DISABLE_TRANSPARENCY_ENFORCEMENT,\n NULL, \/\/ Name of the assembly that contains the AppDomainManager implementation\n NULL, \/\/ The AppDomainManager implementation type name\n propertyCount,\n propertyKeysW,\n propertyValuesW,\n (DWORD *)domainId);\n\n if (SUCCEEDED(hr))\n {\n host.SuppressRelease();\n *hostHandle = host;\n#ifdef FEATURE_GDBJIT\n HRESULT createDelegateResult;\n createDelegateResult = coreclr_create_delegate(*hostHandle,\n *domainId,\n \"SOS.NETCore\",\n \"SOS.SymbolReader\",\n \"GetInfoForMethod\",\n (void**)&getInfoForMethodDelegate);\n\n#if defined(_DEBUG)\n if (!SUCCEEDED(createDelegateResult))\n {\n fprintf(stderr,\n \"Can't create delegate for 'SOS.SymbolReader.GetInfoForMethod' \"\n \"method - status: 0x%08x\\n\", createDelegateResult);\n }\n#endif \/\/ _DEBUG\n\n#endif\n }\n return hr;\n}\n\n\/\/\n\/\/ Shutdown CoreCLR. It unloads the app domain and stops the CoreCLR host.\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_shutdown(\n void* hostHandle,\n unsigned int domainId)\n{\n ReleaseHolder<ICLRRuntimeHost2> host(reinterpret_cast<ICLRRuntimeHost2*>(hostHandle));\n\n HRESULT hr = host->UnloadAppDomain(domainId, true); \/\/ Wait until done\n IfFailRet(hr);\n\n hr = host->Stop();\n\n#ifdef FEATURE_PAL\n PAL_Shutdown();\n#endif\n\n return hr;\n}\n\n\/\/\n\/\/ Create a native callable delegate for a managed method.\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/ entryPointAssemblyName - Name of the assembly which holds the custom entry point\n\/\/ entryPointTypeName - Name of the type which holds the custom entry point\n\/\/ entryPointMethodName - Name of the method which is the custom entry point\n\/\/ delegate - Output parameter, the function stores a pointer to the delegate at the specified address\n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_create_delegate(\n void* hostHandle,\n unsigned int domainId,\n const char* entryPointAssemblyName,\n const char* entryPointTypeName,\n const char* entryPointMethodName,\n void** delegate)\n{\n ICLRRuntimeHost2* host = reinterpret_cast<ICLRRuntimeHost2*>(hostHandle);\n\n ConstWStringHolder entryPointAssemblyNameW = StringToUnicode(entryPointAssemblyName);\n ConstWStringHolder entryPointTypeNameW = StringToUnicode(entryPointTypeName);\n ConstWStringHolder entryPointMethodNameW = StringToUnicode(entryPointMethodName);\n\n HRESULT hr = host->CreateDelegate(\n domainId,\n entryPointAssemblyNameW,\n entryPointTypeNameW,\n entryPointMethodNameW,\n (INT_PTR*)delegate);\n \n return hr;\n}\n\n\/\/\n\/\/ Execute a managed assembly with given arguments\n\/\/\n\/\/ Parameters:\n\/\/ hostHandle - Handle of the host\n\/\/ domainId - Id of the domain \n\/\/ argc - Number of arguments passed to the executed assembly\n\/\/ argv - Array of arguments passed to the executed assembly\n\/\/ managedAssemblyPath - Path of the managed assembly to execute (or NULL if using a custom entrypoint).\n\/\/ exitCode - Exit code returned by the executed assembly\n\/\/\n\/\/ Returns:\n\/\/ HRESULT indicating status of the operation. S_OK if the assembly was successfully executed\n\/\/\nextern \"C\"\nint coreclr_execute_assembly(\n void* hostHandle,\n unsigned int domainId,\n int argc,\n const char** argv,\n const char* managedAssemblyPath,\n unsigned int* exitCode)\n{\n if (exitCode == NULL)\n {\n return HRESULT_FROM_WIN32(ERROR_INVALID_PARAMETER);\n }\n *exitCode = -1;\n\n ICLRRuntimeHost2* host = reinterpret_cast<ICLRRuntimeHost2*>(hostHandle);\n\n ConstWStringArrayHolder argvW;\n argvW.Set(StringArrayToUnicode(argc, argv), argc);\n \n ConstWStringHolder managedAssemblyPathW = StringToUnicode(managedAssemblyPath);\n\n HRESULT hr = host->ExecuteAssembly(domainId, managedAssemblyPathW, argc, argvW, (DWORD *)exitCode);\n IfFailRet(hr);\n\n return hr;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2021 CM4all GmbH\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"escape\/HTML.hxx\"\n#include \"escape\/Class.hxx\"\n#include \"escape\/Static.hxx\"\n\n#include <gtest\/gtest.h>\n\nstatic const char *\nhtml_unescape(const char *p)\n{\n\treturn unescape_static(&html_escape_class, p);\n}\n\nstatic size_t\nhtml_unescape_inplace(char *p, size_t length)\n{\n\treturn unescape_inplace(&html_escape_class, p, length);\n}\n\nTEST(HtmlEscape, Basic)\n{\n\tsize_t length;\n\n\tASSERT_STREQ(html_unescape(\"foo bar\"), \"foo bar\");\n\tASSERT_STREQ(html_unescape(\"foo&bar\"), \"foo&bar\");\n\tASSERT_STREQ(html_unescape(\"<>\"), \"<>\");\n\tASSERT_STREQ(html_unescape(\""\"), \"\\\"\");\n\tASSERT_STREQ(html_unescape(\"&amp;\"), \"&\");\n\tASSERT_STREQ(html_unescape(\"&&"\"), \"&&\\\"\");\n\tASSERT_STREQ(html_unescape(\"><'\"), \"><'\");\n\n\tchar a[] = \"foo bar\";\n\tlength = html_unescape_inplace(a, sizeof(a) - 1);\n\tASSERT_EQ(length, 7u);\n\n\tchar e[] = \"foo&bar\";\n\tlength = html_unescape_inplace(e, sizeof(e) - 1);\n\tASSERT_EQ(length, 7u);\n\tASSERT_EQ(memcmp(e, \"foo&bar\", 7), 0);\n\n\tchar f[] = \"<foo>bar'\";\n\tlength = html_unescape_inplace(f, sizeof(f) - 1);\n\tASSERT_EQ(length, 9u);\n\tASSERT_EQ(memcmp(f, \"<foo>bar'\", 9), 0);\n\n\tchar b[] = \"<>'\";\n\tlength = html_unescape_inplace(b, sizeof(b) - 1);\n\tASSERT_EQ(length, 3u);\n\tASSERT_EQ(memcmp(b, \"<>'\", 3), 0);\n\n\tchar c[] = \""\";\n\tlength = html_unescape_inplace(c, sizeof(c) - 1);\n\tASSERT_EQ(length, 5u);\n\tASSERT_EQ(memcmp(c, \""\", 5), 0);\n\n\tchar d[] = \"&&"\";\n\tlength = html_unescape_inplace(d, sizeof(d) - 1);\n\tASSERT_EQ(length, 3u);\n\tASSERT_EQ(memcmp(d, \"&&\\\"\", 3), 0);\n}\n<commit_msg>test\/t_html_escape: simplify using std::string_view<commit_after>\/*\n * Copyright 2007-2021 CM4all GmbH\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"escape\/HTML.hxx\"\n#include \"escape\/Class.hxx\"\n#include \"escape\/Static.hxx\"\n\n#include <gtest\/gtest.h>\n\n#include <string_view>\n\nusing std::string_view_literals::operator\"\"sv;\n\nstatic const char *\nhtml_unescape(const char *p)\n{\n\treturn unescape_static(&html_escape_class, p);\n}\n\nstatic std::string_view\nhtml_unescape_inplace(char *p, size_t length)\n{\n\treturn {p, unescape_inplace(&html_escape_class, p, length)};\n}\n\nTEST(HtmlEscape, Basic)\n{\n\tASSERT_STREQ(html_unescape(\"foo bar\"), \"foo bar\");\n\tASSERT_STREQ(html_unescape(\"foo&bar\"), \"foo&bar\");\n\tASSERT_STREQ(html_unescape(\"<>\"), \"<>\");\n\tASSERT_STREQ(html_unescape(\""\"), \"\\\"\");\n\tASSERT_STREQ(html_unescape(\"&amp;\"), \"&\");\n\tASSERT_STREQ(html_unescape(\"&&"\"), \"&&\\\"\");\n\tASSERT_STREQ(html_unescape(\"><'\"), \"><'\");\n\n\tchar a[] = \"foo bar\";\n\tASSERT_EQ(html_unescape_inplace(a, sizeof(a) - 1), \"foo bar\"sv);\n\n\tchar e[] = \"foo&bar\";\n\tASSERT_EQ(html_unescape_inplace(e, sizeof(e) - 1), \"foo&bar\"sv);\n\n\tchar f[] = \"<foo>bar'\";\n\tASSERT_EQ(html_unescape_inplace(f, sizeof(f) - 1), \"<foo>bar'\"sv);\n\n\tchar b[] = \"<>'\";\n\tASSERT_EQ(html_unescape_inplace(b, sizeof(b) - 1), \"<>'\"sv);\n\n\tchar c[] = \""\";\n\tASSERT_EQ(html_unescape_inplace(c, sizeof(c) - 1), \""\"sv);\n\n\tchar d[] = \"&&"\";\n\tASSERT_EQ(html_unescape_inplace(d, sizeof(d) - 1), \"&&\\\"\"sv);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#define HAVE_EXPECT_100\n#define HAVE_CHUNKED_REQUEST_BODY\n#define ENABLE_CLOSE_IGNORED_REQUEST_BODY\n#define ENABLE_HUGE_BODY\n#define USE_BUCKETS\n\n#include \"t_client.hxx\"\n#include \"http_client.hxx\"\n#include \"http_headers.hxx\"\n#include \"system\/SetupProcess.hxx\"\n#include \"io\/FileDescriptor.hxx\"\n#include \"net\/SocketDescriptor.hxx\"\n#include \"fs\/FilteredSocket.hxx\"\n#include \"direct.hxx\"\n#include \"fb_pool.hxx\"\n#include \"istream\/UnusedPtr.hxx\"\n\n#include <sys\/wait.h>\n\nstruct Connection {\n EventLoop &event_loop;\n const pid_t pid;\n FilteredSocket socket;\n\n Connection(EventLoop &_event_loop, pid_t _pid, SocketDescriptor fd)\n :event_loop(_event_loop), pid(_pid), socket(_event_loop) {\n socket.Init(fd, FdType::FD_SOCKET);\n }\n\n static Connection *New(EventLoop &event_loop,\n const char *path, const char *mode);\n\n ~Connection();\n\n void Request(struct pool *pool,\n Lease &lease,\n http_method_t method, const char *uri,\n StringMap &&headers,\n UnusedIstreamPtr body,\n bool expect_100,\n HttpResponseHandler &handler,\n CancellablePointer &cancel_ptr) {\n http_client_request(*pool, socket, lease,\n \"localhost\",\n method, uri, HttpHeaders(std::move(headers)),\n std::move(body), expect_100,\n handler, cancel_ptr);\n }\n\n static Connection *NewMirror(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"mirror\");\n }\n\n static Connection *NewNull(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"null\");\n }\n\n static Connection *NewDummy(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"dummy\");\n }\n\n static Connection *NewClose(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"close\");\n }\n\n static Connection *NewFixed(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"fixed\");\n }\n\n static Connection *NewTiny(struct pool &p, EventLoop &event_loop) {\n return NewFixed(p, event_loop);\n }\n\n static Connection *NewHuge(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"huge\");\n }\n\n static Connection *NewTwice100(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/twice_100.sh\", nullptr);\n }\n\n static Connection *NewClose100(struct pool &, EventLoop &event_loop);\n\n static Connection *NewHold(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"hold\");\n }\n};\n\nConnection::~Connection()\n{\n assert(pid >= 1);\n\n socket.Close();\n socket.Destroy();\n\n int status;\n if (waitpid(pid, &status, 0) < 0) {\n perror(\"waitpid() failed\");\n exit(EXIT_FAILURE);\n }\n\n assert(!WIFSIGNALED(status));\n}\n\nConnection *\nConnection::New(EventLoop &event_loop, const char *path, const char *mode)\n{\n SocketDescriptor client_socket, server_socket;\n if (!SocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n client_socket, server_socket)) {\n perror(\"socketpair() failed\");\n exit(EXIT_FAILURE);\n }\n\n const auto pid = fork();\n if (pid < 0) {\n perror(\"fork() failed\");\n exit(EXIT_FAILURE);\n }\n\n if (pid == 0) {\n server_socket.CheckDuplicate(FileDescriptor(STDIN_FILENO));\n server_socket.CheckDuplicate(FileDescriptor(STDOUT_FILENO));\n\n execl(path, path,\n \"0\", \"0\", mode, nullptr);\n\n const char *srcdir = getenv(\"srcdir\");\n if (srcdir != nullptr) {\n \/* support automake out-of-tree build *\/\n if (chdir(srcdir) == 0)\n execl(path, path,\n \"0\", \"0\", mode, nullptr);\n }\n\n perror(\"exec() failed\");\n _exit(EXIT_FAILURE);\n }\n\n server_socket.Close();\n client_socket.SetNonBlocking();\n return new Connection(event_loop, pid, client_socket);\n}\n\nConnection *\nConnection::NewClose100(struct pool &, EventLoop &event_loop)\n{\n SocketDescriptor client_socket, server_socket;\n if (!SocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n client_socket, server_socket)) {\n perror(\"socketpair() failed\");\n exit(EXIT_FAILURE);\n }\n\n pid_t pid = fork();\n if (pid < 0) {\n perror(\"fork() failed\");\n exit(EXIT_FAILURE);\n }\n\n if (pid == 0) {\n client_socket.Close();\n\n static const char response[] = \"HTTP\/1.1 100 Continue\\n\\n\";\n (void)server_socket.Write(response, sizeof(response) - 1);\n server_socket.ShutdownWrite();\n\n char buffer[64];\n while (server_socket.Read(buffer, sizeof(buffer)) > 0) {}\n\n _exit(EXIT_SUCCESS);\n }\n\n server_socket.Close();\n client_socket.SetNonBlocking();\n return new Connection(event_loop, pid, client_socket);\n}\n\n\/**\n * Keep-alive disabled, and response body has unknown length, ends\n * when server closes socket. Check if our HTTP client handles such\n * responses correctly.\n *\/\ntemplate<class Connection>\nstatic void\ntest_no_keepalive(Context<Connection> &c)\n{\n c.connection = Connection::NewClose(*c.pool, c.event_loop);\n c.connection->Request(c.pool, c,\n HTTP_METHOD_GET, \"\/foo\", StringMap(*c.pool),\n nullptr,\n#ifdef HAVE_EXPECT_100\n false,\n#endif\n c, c.cancel_ptr);\n pool_unref(c.pool);\n pool_commit();\n\n c.WaitForResponse();\n\n assert(c.status == HTTP_STATUS_OK);\n assert(c.request_error == nullptr);\n\n \/* receive the rest of the response body from the buffer *\/\n c.event_loop.Dispatch();\n\n assert(c.released);\n assert(c.body_eof);\n assert(c.body_data > 0);\n assert(c.body_error == nullptr);\n}\n\n\/*\n * main\n *\n *\/\n\nint main(int argc, char **argv) {\n (void)argc;\n (void)argv;\n\n SetupProcess();\n\n direct_global_init();\n const ScopeFbPoolInit fb_pool_init;\n\n run_all_tests<Connection>();\n run_test<Connection>(test_no_keepalive);\n}\n<commit_msg>test\/t_http_client: add missing include<commit_after>\/*\n * Copyright 2007-2017 Content Management AG\n * All rights reserved.\n *\n * author: Max Kellermann <mk@cm4all.com>\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * - Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the\n * distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#define HAVE_EXPECT_100\n#define HAVE_CHUNKED_REQUEST_BODY\n#define ENABLE_CLOSE_IGNORED_REQUEST_BODY\n#define ENABLE_HUGE_BODY\n#define USE_BUCKETS\n\n#include \"t_client.hxx\"\n#include \"http_client.hxx\"\n#include \"http_headers.hxx\"\n#include \"system\/SetupProcess.hxx\"\n#include \"io\/FileDescriptor.hxx\"\n#include \"net\/SocketDescriptor.hxx\"\n#include \"fs\/FilteredSocket.hxx\"\n#include \"direct.hxx\"\n#include \"fb_pool.hxx\"\n#include \"istream\/UnusedPtr.hxx\"\n\n#include <sys\/socket.h>\n#include <sys\/wait.h>\n\nstruct Connection {\n EventLoop &event_loop;\n const pid_t pid;\n FilteredSocket socket;\n\n Connection(EventLoop &_event_loop, pid_t _pid, SocketDescriptor fd)\n :event_loop(_event_loop), pid(_pid), socket(_event_loop) {\n socket.Init(fd, FdType::FD_SOCKET);\n }\n\n static Connection *New(EventLoop &event_loop,\n const char *path, const char *mode);\n\n ~Connection();\n\n void Request(struct pool *pool,\n Lease &lease,\n http_method_t method, const char *uri,\n StringMap &&headers,\n UnusedIstreamPtr body,\n bool expect_100,\n HttpResponseHandler &handler,\n CancellablePointer &cancel_ptr) {\n http_client_request(*pool, socket, lease,\n \"localhost\",\n method, uri, HttpHeaders(std::move(headers)),\n std::move(body), expect_100,\n handler, cancel_ptr);\n }\n\n static Connection *NewMirror(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"mirror\");\n }\n\n static Connection *NewNull(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"null\");\n }\n\n static Connection *NewDummy(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"dummy\");\n }\n\n static Connection *NewClose(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"close\");\n }\n\n static Connection *NewFixed(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"fixed\");\n }\n\n static Connection *NewTiny(struct pool &p, EventLoop &event_loop) {\n return NewFixed(p, event_loop);\n }\n\n static Connection *NewHuge(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"huge\");\n }\n\n static Connection *NewTwice100(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/twice_100.sh\", nullptr);\n }\n\n static Connection *NewClose100(struct pool &, EventLoop &event_loop);\n\n static Connection *NewHold(struct pool &, EventLoop &event_loop) {\n return New(event_loop, \".\/test\/run_http_server\", \"hold\");\n }\n};\n\nConnection::~Connection()\n{\n assert(pid >= 1);\n\n socket.Close();\n socket.Destroy();\n\n int status;\n if (waitpid(pid, &status, 0) < 0) {\n perror(\"waitpid() failed\");\n exit(EXIT_FAILURE);\n }\n\n assert(!WIFSIGNALED(status));\n}\n\nConnection *\nConnection::New(EventLoop &event_loop, const char *path, const char *mode)\n{\n SocketDescriptor client_socket, server_socket;\n if (!SocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n client_socket, server_socket)) {\n perror(\"socketpair() failed\");\n exit(EXIT_FAILURE);\n }\n\n const auto pid = fork();\n if (pid < 0) {\n perror(\"fork() failed\");\n exit(EXIT_FAILURE);\n }\n\n if (pid == 0) {\n server_socket.CheckDuplicate(FileDescriptor(STDIN_FILENO));\n server_socket.CheckDuplicate(FileDescriptor(STDOUT_FILENO));\n\n execl(path, path,\n \"0\", \"0\", mode, nullptr);\n\n const char *srcdir = getenv(\"srcdir\");\n if (srcdir != nullptr) {\n \/* support automake out-of-tree build *\/\n if (chdir(srcdir) == 0)\n execl(path, path,\n \"0\", \"0\", mode, nullptr);\n }\n\n perror(\"exec() failed\");\n _exit(EXIT_FAILURE);\n }\n\n server_socket.Close();\n client_socket.SetNonBlocking();\n return new Connection(event_loop, pid, client_socket);\n}\n\nConnection *\nConnection::NewClose100(struct pool &, EventLoop &event_loop)\n{\n SocketDescriptor client_socket, server_socket;\n if (!SocketDescriptor::CreateSocketPair(AF_LOCAL, SOCK_STREAM, 0,\n client_socket, server_socket)) {\n perror(\"socketpair() failed\");\n exit(EXIT_FAILURE);\n }\n\n pid_t pid = fork();\n if (pid < 0) {\n perror(\"fork() failed\");\n exit(EXIT_FAILURE);\n }\n\n if (pid == 0) {\n client_socket.Close();\n\n static const char response[] = \"HTTP\/1.1 100 Continue\\n\\n\";\n (void)server_socket.Write(response, sizeof(response) - 1);\n server_socket.ShutdownWrite();\n\n char buffer[64];\n while (server_socket.Read(buffer, sizeof(buffer)) > 0) {}\n\n _exit(EXIT_SUCCESS);\n }\n\n server_socket.Close();\n client_socket.SetNonBlocking();\n return new Connection(event_loop, pid, client_socket);\n}\n\n\/**\n * Keep-alive disabled, and response body has unknown length, ends\n * when server closes socket. Check if our HTTP client handles such\n * responses correctly.\n *\/\ntemplate<class Connection>\nstatic void\ntest_no_keepalive(Context<Connection> &c)\n{\n c.connection = Connection::NewClose(*c.pool, c.event_loop);\n c.connection->Request(c.pool, c,\n HTTP_METHOD_GET, \"\/foo\", StringMap(*c.pool),\n nullptr,\n#ifdef HAVE_EXPECT_100\n false,\n#endif\n c, c.cancel_ptr);\n pool_unref(c.pool);\n pool_commit();\n\n c.WaitForResponse();\n\n assert(c.status == HTTP_STATUS_OK);\n assert(c.request_error == nullptr);\n\n \/* receive the rest of the response body from the buffer *\/\n c.event_loop.Dispatch();\n\n assert(c.released);\n assert(c.body_eof);\n assert(c.body_data > 0);\n assert(c.body_error == nullptr);\n}\n\n\/*\n * main\n *\n *\/\n\nint main(int argc, char **argv) {\n (void)argc;\n (void)argv;\n\n SetupProcess();\n\n direct_global_init();\n const ScopeFbPoolInit fb_pool_init;\n\n run_all_tests<Connection>();\n run_test<Connection>(test_no_keepalive);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: streamwrap.cxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_filter.hxx\"\n\n#ifndef _OSL_STREAM_WRAPPER_HXX_\n#include \"streamwrap.hxx\"\n#endif\n#include <osl\/file.hxx>\n\nnamespace foo\n{\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::io;\nusing namespace ::com::sun::star::lang;\nusing namespace ::osl;\n\n\/\/==================================================================\n\/\/= OInputStreamWrapper\n\/\/==================================================================\n\/\/------------------------------------------------------------------\nOInputStreamWrapper::OInputStreamWrapper( File& _rStream )\n :m_pSvStream(&_rStream)\n ,m_bSvStreamOwner(sal_False)\n{\n}\n\n\/\/------------------------------------------------------------------\nOInputStreamWrapper::OInputStreamWrapper( File* pStream, sal_Bool bOwner )\n :m_pSvStream( pStream )\n ,m_bSvStreamOwner( bOwner )\n{\n}\n\n\/\/------------------------------------------------------------------\nOInputStreamWrapper::~OInputStreamWrapper()\n{\n if( m_bSvStreamOwner )\n delete m_pSvStream;\n\n}\n\n\/\/------------------------------------------------------------------------------\nsal_Int32 SAL_CALL OInputStreamWrapper::readBytes(staruno::Sequence< sal_Int8 >& aData, sal_Int32 nBytesToRead)\n throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n checkConnected();\n\n if (nBytesToRead < 0)\n throw stario::BufferSizeExceededException(::rtl::OUString(),static_cast<staruno::XWeak*>(this));\n\n ::osl::MutexGuard aGuard( m_aMutex );\n\n aData.realloc(nBytesToRead);\n\n sal_uInt64 nRead = 0;\n m_pSvStream->read((void*)aData.getArray(), nBytesToRead,nRead);\n\n checkError();\n\n \/\/ Wenn gelesene Zeichen < MaxLength, staruno::Sequence anpassen\n if (nRead < (sal_uInt64)nBytesToRead)\n aData.realloc( static_cast< sal_Int32 >( nRead ) );\n\n return static_cast< sal_Int32 >( nRead );\n}\n\n\/\/------------------------------------------------------------------------------\nsal_Int32 SAL_CALL OInputStreamWrapper::readSomeBytes(staruno::Sequence< sal_Int8 >& aData, sal_Int32 nMaxBytesToRead) throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n checkError();\n\n if (nMaxBytesToRead < 0)\n throw stario::BufferSizeExceededException(::rtl::OUString(),static_cast<staruno::XWeak*>(this));\n\n return readBytes(aData, nMaxBytesToRead);\n}\n\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OInputStreamWrapper::skipBytes(sal_Int32 nBytesToSkip) throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkError();\n\n m_pSvStream->setPos(osl_Pos_Current,nBytesToSkip);\n checkError();\n}\n\n\/\/------------------------------------------------------------------------------\nsal_Int32 SAL_CALL OInputStreamWrapper::available() throw( stario::NotConnectedException, staruno::RuntimeException )\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkConnected();\n\n sal_uInt64 nPos = 0;\n m_pSvStream->getPos(nPos);\n checkError();\n\n m_pSvStream->setPos(Pos_End,0);\n checkError();\n\n sal_uInt64 nAvailable = 0;\n m_pSvStream->getPos(nAvailable);\n nAvailable -= nPos;\n\n m_pSvStream->setPos(Pos_Absolut,nPos);\n checkError();\n\n return static_cast< sal_Int32 >( nAvailable );\n}\n\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OInputStreamWrapper::closeInput() throw( stario::NotConnectedException, staruno::RuntimeException )\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkConnected();\n\n if (m_bSvStreamOwner)\n delete m_pSvStream;\n\n m_pSvStream = NULL;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OInputStreamWrapper::checkConnected() const\n{\n if (!m_pSvStream)\n throw stario::NotConnectedException(::rtl::OUString(), const_cast<staruno::XWeak*>(static_cast<const staruno::XWeak*>(this)));\n}\n\n\/\/------------------------------------------------------------------------------\nvoid OInputStreamWrapper::checkError() const\n{\n checkConnected();\n}\n\n\/\/==================================================================\n\/\/= OSeekableInputStreamWrapper\n\/\/==================================================================\n\/\/------------------------------------------------------------------------------\nOSeekableInputStreamWrapper::OSeekableInputStreamWrapper(File& _rStream)\n :OInputStreamWrapper(_rStream)\n{\n}\n\n\/\/------------------------------------------------------------------------------\nOSeekableInputStreamWrapper::OSeekableInputStreamWrapper(File* _pStream, sal_Bool _bOwner)\n :OInputStreamWrapper(_pStream, _bOwner)\n{\n}\n\n\/\/------------------------------------------------------------------------------\nAny SAL_CALL OSeekableInputStreamWrapper::queryInterface( const Type& _rType ) throw (RuntimeException)\n{\n Any aReturn = OInputStreamWrapper::queryInterface(_rType);\n if (!aReturn.hasValue())\n aReturn = OSeekableInputStreamWrapper_Base::queryInterface(_rType);\n return aReturn;\n}\n\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OSeekableInputStreamWrapper::acquire( ) throw ()\n{\n OInputStreamWrapper::acquire();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OSeekableInputStreamWrapper::release( ) throw ()\n{\n OInputStreamWrapper::release();\n}\n\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OSeekableInputStreamWrapper::seek( sal_Int64 _nLocation ) throw (IllegalArgumentException, IOException, RuntimeException)\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkConnected();\n\n m_pSvStream->setPos(Pos_Current,(sal_uInt32)_nLocation);\n checkError();\n}\n\n\/\/------------------------------------------------------------------------------\nsal_Int64 SAL_CALL OSeekableInputStreamWrapper::getPosition( ) throw (IOException, RuntimeException)\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkConnected();\n\n sal_uInt64 nPos = 0;\n nPos = m_pSvStream->getPos(nPos);\n checkError();\n return nPos;\n}\n\n\/\/------------------------------------------------------------------------------\nsal_Int64 SAL_CALL OSeekableInputStreamWrapper::getLength( ) throw (IOException, RuntimeException)\n{\n ::osl::MutexGuard aGuard( m_aMutex );\n checkConnected();\n\n sal_uInt64 nCurrentPos = 0;\n m_pSvStream->getPos(nCurrentPos);\n checkError();\n\n m_pSvStream->setPos(osl_Pos_End,0);\n sal_uInt64 nEndPos = 0;\n m_pSvStream->getPos(nEndPos);\n m_pSvStream->setPos(osl_Pos_Absolut,nCurrentPos);\n\n checkError();\n\n return nEndPos;\n}\n\n\/\/==================================================================\n\/\/= OOutputStreamWrapper\n\/\/==================================================================\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::writeBytes(const staruno::Sequence< sal_Int8 >& aData) throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n sal_uInt64 nWritten = 0;\n rStream.write(aData.getConstArray(),aData.getLength(),nWritten);\n if (nWritten != (sal_uInt64)aData.getLength())\n {\n throw stario::BufferSizeExceededException(::rtl::OUString(),static_cast<staruno::XWeak*>(this));\n }\n}\n\n\/\/------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::flush() throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n}\n\n\/\/------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::closeOutput() throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n}\n\n} \/\/ namespace utl\n\n\n<commit_msg>INTEGRATION: CWS mba30patches01 (1.4.210); FILE MERGED 2008\/04\/23 10:57:48 mba 1.4.210.2: RESYNC: (1.4-1.5); FILE MERGED 2008\/03\/18 15:48:38 mba 1.4.210.1: #i86359#: remove unused code<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: streamwrap.cxx,v $\n * $Revision: 1.6 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_filter.hxx\"\n\n#ifndef _OSL_STREAM_WRAPPER_HXX_\n#include \"streamwrap.hxx\"\n#endif\n#include <osl\/file.hxx>\n\nnamespace foo\n{\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::io;\nusing namespace ::com::sun::star::lang;\nusing namespace ::osl;\n\n\/\/==================================================================\n\/\/= OOutputStreamWrapper\n\/\/==================================================================\n\/\/------------------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::writeBytes(const staruno::Sequence< sal_Int8 >& aData) throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n sal_uInt64 nWritten = 0;\n rStream.write(aData.getConstArray(),aData.getLength(),nWritten);\n if (nWritten != (sal_uInt64)aData.getLength())\n {\n throw stario::BufferSizeExceededException(::rtl::OUString(),static_cast<staruno::XWeak*>(this));\n }\n}\n\n\/\/------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::flush() throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n}\n\n\/\/------------------------------------------------------------------\nvoid SAL_CALL OOutputStreamWrapper::closeOutput() throw( stario::NotConnectedException, stario::BufferSizeExceededException, staruno::RuntimeException )\n{\n}\n\n} \/\/ namespace utl\n\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Related: fdo#66400 take uppercase of first field token<commit_after><|endoftext|>"} {"text":"<commit_before><commit_msg>Resolves: fdo#79130 Crash in DomainMapper_Impl::CloseFieldCommand<commit_after><|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* Copyright (c) 2011, Michael P. Gerlek (mpg@flaxen.com)\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#include \"GeotiffSupport.hpp\"\n\n\/\/ GDAL\n#ifdef LIBPC_HAVE_GDAL\n#include <geo_normalize.h>\n#include <ogr_spatialref.h>\n#endif\n\n#include <sstream>\n#include <boost\/concept_check.hpp>\n\n\nLIBPC_C_START\n#ifdef __geotiff_h_\n\n#ifdef GEO_NORMALIZE_H_INCLUDED\nchar LIBPC_DLL * GTIFGetOGISDefn(GTIF*, GTIFDefn*);\n#endif\n\nint LIBPC_DLL GTIFSetFromOGISDefn(GTIF*, const char*);\nvoid SetLinearUnitCitation(GTIF* psGTIF, char* pszLinearUOMName);\n\n#ifdef _OGR_SRS_API_H_INCLUDED\nvoid SetGeogCSCitation(GTIF* psGTIF, OGRSpatialReference* poSRS, char* angUnitName, int nDatum, short nSpheroid);\n#endif \/\/ defined _OGR_SRS_API_H_INCLUDED\n\n#endif \/\/ defined __geotiff_h_\nLIBPC_C_END\n\n\nnamespace libpc { namespace drivers { namespace las {\n\n\nGeotiffSupport::GeotiffSupport()\n : m_gtiff(0)\n , m_tiff(0)\n{\n}\n\n\nGeotiffSupport::~GeotiffSupport()\n{\n#ifdef LIBPC_SRS_ENABLED\n if (m_gtiff != 0)\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n if (m_tiff != 0)\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n#endif\n}\n\n\nvoid GeotiffSupport::resetTags()\n{\n \/\/ If we already have m_gtiff and m_tiff, that is because we have \n \/\/ already called GetGTIF once before. VLRs ultimately drive how the \n \/\/ SpatialReference is defined, not the GeoTIFF keys. \n if (m_tiff != 0 )\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n\n if (m_gtiff != 0 )\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n\n m_tiff = ST_Create();\n\n return;\n}\n\n\nint GeotiffSupport::setKey(int tag, int count, GeotiffKeyType geotiff_key_type, void *data)\n{\n return ST_SetKey(m_tiff, tag, count, (int)geotiff_key_type, data);\n}\n\n\nint GeotiffSupport::getKey(int tag, int *count, int *st_type, void **data_ptr) const\n{\n if (m_tiff == 0) return 0;\n return ST_GetKey(m_tiff, tag, count, st_type, data_ptr);\n}\n\n\nvoid GeotiffSupport::setTags()\n{\n m_gtiff = GTIFNewSimpleTags(m_tiff);\n if (!m_gtiff) \n throw std::runtime_error(\"The geotiff keys could not be read from VLR records\");\n return;\n}\n\n\nstd::string GeotiffSupport::getWkt(bool horizOnly, bool pretty) const\n{\n GTIFDefn sGTIFDefn;\n char* pszWKT = 0;\n\n if (!m_gtiff)\n {\n return std::string();\n }\n\n if (!GTIFGetDefn(m_gtiff, &sGTIFDefn))\n {\n return std::string();\n }\n\n pszWKT = GTIFGetOGISDefn(m_gtiff, &sGTIFDefn );\n\n if (pretty) {\n OGRSpatialReference* poSRS = (OGRSpatialReference*) OSRNewSpatialReference(NULL);\n char *pszOrigWKT = pszWKT;\n poSRS->importFromWkt( &pszOrigWKT );\n\n CPLFree( pszWKT );\n pszWKT = NULL;\n poSRS->exportToPrettyWkt(&pszWKT, false);\n OSRDestroySpatialReference( poSRS );\n\n }\n\n if( pszWKT \n && horizOnly \n && strstr(pszWKT,\"COMPD_CS\") != NULL )\n {\n OGRSpatialReference* poSRS = (OGRSpatialReference*) OSRNewSpatialReference(NULL);\n char *pszOrigWKT = pszWKT;\n poSRS->importFromWkt( &pszOrigWKT );\n\n CPLFree( pszWKT );\n pszWKT = NULL;\n\n poSRS->StripVertical();\n if (pretty) \n poSRS->exportToPrettyWkt(&pszWKT, false);\n else\n poSRS->exportToWkt( &pszWKT );\n\n OSRDestroySpatialReference( poSRS );\n }\n\n if (pszWKT)\n {\n std::string tmp(pszWKT);\n CPLFree(pszWKT);\n return tmp;\n }\n\n return std::string();\n}\n\n\nvoid GeotiffSupport::rebuildGTIF()\n{\n \/\/ If we already have m_gtiff and m_tiff, that is because we have \n \/\/ already called GetGTIF once before. VLRs ultimately drive how the \n \/\/ SpatialReference is defined, not the GeoTIFF keys. \n if (m_tiff != 0 )\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n\n if (m_gtiff != 0 )\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n \n m_tiff = ST_Create();\n \n \/\/ (here it used to read in the VLRs)\n\n m_gtiff = GTIFNewSimpleTags(m_tiff);\n if (!m_gtiff) \n throw std::runtime_error(\"The geotiff keys could not be read from VLR records\");\n \n return;\n}\n\n\nvoid GeotiffSupport::setWkt(const std::string& v)\n{\n if (!m_gtiff)\n {\n rebuildGTIF(); \n }\n\n if (v == \"\")\n {\n return;\n }\n\n int ret = 0;\n ret = GTIFSetFromOGISDefn(m_gtiff, v.c_str());\n if (!ret) \n {\n throw std::invalid_argument(\"could not set m_gtiff from WKT\");\n }\n\n ret = GTIFWriteKeys(m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n return;\n}\n\n \n\/\/ Utility functor with accompanying to print GeoTIFF directory.\nstruct geotiff_dir_printer\n{\n geotiff_dir_printer() {}\n\n std::string output() const { return m_oss.str(); }\n std::string::size_type size() const { return m_oss.str().size(); }\n\n void operator()(char* data, void* aux)\n { \n ::boost::ignore_unused_variable_warning(aux);\n\n if (0 != data)\n {\n m_oss << data;\n }\n }\n\nprivate:\n std::ostringstream m_oss;\n};\n\n\nstatic int libpcGeoTIFFPrint(char* data, void* aux)\n{\n geotiff_dir_printer* printer = reinterpret_cast<geotiff_dir_printer*>(aux);\n (*printer)(data, 0);\n return static_cast<int>(printer->size());\n}\n\n\nstd::string GeotiffSupport::getText() const\n{\n if (m_gtiff == NULL)\n return std::string(\"\");\n\n geotiff_dir_printer geotiff_printer;\n GTIFPrint(m_gtiff, libpcGeoTIFFPrint, &geotiff_printer);\n const std::string s = geotiff_printer.output();\n return s;\n}\n\n\n\n\n#if 0\n\nvoid SpatialReference::setVerticalCS(boost::int32_t verticalCSType, \n std::string const& citation,\n boost::int32_t verticalDatum,\n boost::int32_t verticalUnits)\n{\n if (!m_tiffstuff->m_gtiff)\n {\n rebuildGTIF(); \n }\n\n#ifdef LIBPC_SRS_ENABLED\n if( verticalCSType != KvUserDefined && verticalCSType > 0 )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalCSTypeGeoKey, TYPE_SHORT, 1,\n verticalCSType );\n\n if( citation != \"\" )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalCitationGeoKey, TYPE_ASCII, 0, \n citation.c_str() );\t\t\t \n\n if( verticalDatum > 0 && verticalDatum != KvUserDefined )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalDatumGeoKey, TYPE_SHORT, 1,\n verticalDatum );\n \n if( verticalUnits > 0 && verticalUnits != KvUserDefined )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalUnitsGeoKey, TYPE_SHORT, 1,\n verticalUnits );\n\n int ret = GTIFWriteKeys(m_tiffstuff->m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n \/\/ Clear WKT so it gets regenerated \n m_wkt = std::string(\"\");\n \n#else\n boost::ignore_unused_variable_warning(citation);\n boost::ignore_unused_variable_warning(verticalUnits);\n boost::ignore_unused_variable_warning(verticalDatum);\n boost::ignore_unused_variable_warning(verticalCSType);\n#endif\n\n return;\n}\n \n\nvoid SpatialReference::setProj4(std::string const& v)\n{\n if (!m_tiffstuff->m_gtiff)\n {\n rebuildGTIF();\n }\n \n#ifdef LIBPC_SRS_ENABLED\n char* poWKT = 0;\n const char* poProj4 = v.c_str();\n\n OGRSpatialReference srs(NULL);\n if (OGRERR_NONE != srs.importFromProj4(const_cast<char *>(poProj4)))\n {\n throw std::invalid_argument(\"could not import proj4 into OSRSpatialReference SetProj4\");\n }\n \n srs.exportToWkt(&poWKT);\n \n std::string tmp(poWKT);\n CPLFree(poWKT);\n \n int ret = 0;\n ret = GTIFSetFromOGISDefn( m_tiffstuff->m_gtiff, tmp.c_str() );\n if (!ret)\n {\n throw std::invalid_argument(\"could not set m_gtiff from Proj4\");\n }\n\n ret = GTIFWriteKeys(m_tiffstuff->m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n GTIFDefn defn;\n\n if (m_tiffstuff->m_gtiff && GTIFGetDefn(m_tiffstuff->m_gtiff, &defn)) \n {\n char* proj4def = GTIFGetProj4Defn(&defn);\n std::string tmp(proj4def);\n GTIFFreeMemory( proj4def );\n }\n#else\n boost::ignore_unused_variable_warning(v);\n#endif\n\n return;\n}\n\n\n#endif\n\n} } } \/\/ namespaces\n<commit_msg>include cpl_conv.h for CPLFree<commit_after>\/******************************************************************************\n* Copyright (c) 2011, Michael P. Gerlek (mpg@flaxen.com)\n*\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following\n* conditions are met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in\n* the documentation and\/or other materials provided\n* with the distribution.\n* * Neither the name of Hobu, Inc. or Flaxen Geo Consulting nor the\n* names of its contributors may be used to endorse or promote\n* products derived from this software without specific prior\n* written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n* OF SUCH DAMAGE.\n****************************************************************************\/\n\n#include \"GeotiffSupport.hpp\"\n\n\/\/ GDAL\n#ifdef LIBPC_HAVE_GDAL\n#include <geo_normalize.h>\n#include <ogr_spatialref.h>\n\n#endif\n\n#include <sstream>\n\n#include <boost\/concept_check.hpp>\n\n\nLIBPC_C_START\n#ifdef __geotiff_h_\n\n\n#ifdef GEO_NORMALIZE_H_INCLUDED\nchar LIBPC_DLL * GTIFGetOGISDefn(GTIF*, GTIFDefn*);\n#endif\n\nint LIBPC_DLL GTIFSetFromOGISDefn(GTIF*, const char*);\nvoid SetLinearUnitCitation(GTIF* psGTIF, char* pszLinearUOMName);\n\n#ifdef _OGR_SRS_API_H_INCLUDED\nvoid SetGeogCSCitation(GTIF* psGTIF, OGRSpatialReference* poSRS, char* angUnitName, int nDatum, short nSpheroid);\n#endif \/\/ defined _OGR_SRS_API_H_INCLUDED\n\n#endif \/\/ defined __geotiff_h_\nLIBPC_C_END\n\n\nnamespace libpc { namespace drivers { namespace las {\n\n\nGeotiffSupport::GeotiffSupport()\n : m_gtiff(0)\n , m_tiff(0)\n{\n}\n\n\nGeotiffSupport::~GeotiffSupport()\n{\n#ifdef LIBPC_SRS_ENABLED\n if (m_gtiff != 0)\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n if (m_tiff != 0)\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n#endif\n}\n\n\nvoid GeotiffSupport::resetTags()\n{\n \/\/ If we already have m_gtiff and m_tiff, that is because we have \n \/\/ already called GetGTIF once before. VLRs ultimately drive how the \n \/\/ SpatialReference is defined, not the GeoTIFF keys. \n if (m_tiff != 0 )\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n\n if (m_gtiff != 0 )\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n\n m_tiff = ST_Create();\n\n return;\n}\n\n\nint GeotiffSupport::setKey(int tag, int count, GeotiffKeyType geotiff_key_type, void *data)\n{\n return ST_SetKey(m_tiff, tag, count, (int)geotiff_key_type, data);\n}\n\n\nint GeotiffSupport::getKey(int tag, int *count, int *st_type, void **data_ptr) const\n{\n if (m_tiff == 0) return 0;\n return ST_GetKey(m_tiff, tag, count, st_type, data_ptr);\n}\n\n\nvoid GeotiffSupport::setTags()\n{\n m_gtiff = GTIFNewSimpleTags(m_tiff);\n if (!m_gtiff) \n throw std::runtime_error(\"The geotiff keys could not be read from VLR records\");\n return;\n}\n\n\nstd::string GeotiffSupport::getWkt(bool horizOnly, bool pretty) const\n{\n GTIFDefn sGTIFDefn;\n char* pszWKT = 0;\n\n if (!m_gtiff)\n {\n return std::string();\n }\n\n if (!GTIFGetDefn(m_gtiff, &sGTIFDefn))\n {\n return std::string();\n }\n\n pszWKT = GTIFGetOGISDefn(m_gtiff, &sGTIFDefn );\n\n if (pretty) {\n OGRSpatialReference* poSRS = (OGRSpatialReference*) OSRNewSpatialReference(NULL);\n char *pszOrigWKT = pszWKT;\n poSRS->importFromWkt( &pszOrigWKT );\n\n CPLFree( pszWKT );\n pszWKT = NULL;\n poSRS->exportToPrettyWkt(&pszWKT, false);\n OSRDestroySpatialReference( poSRS );\n\n }\n\n if( pszWKT \n && horizOnly \n && strstr(pszWKT,\"COMPD_CS\") != NULL )\n {\n OGRSpatialReference* poSRS = (OGRSpatialReference*) OSRNewSpatialReference(NULL);\n char *pszOrigWKT = pszWKT;\n poSRS->importFromWkt( &pszOrigWKT );\n\n CPLFree( pszWKT );\n pszWKT = NULL;\n\n poSRS->StripVertical();\n if (pretty) \n poSRS->exportToPrettyWkt(&pszWKT, false);\n else\n poSRS->exportToWkt( &pszWKT );\n\n OSRDestroySpatialReference( poSRS );\n }\n\n if (pszWKT)\n {\n std::string tmp(pszWKT);\n CPLFree(pszWKT);\n return tmp;\n }\n\n return std::string();\n}\n\n\nvoid GeotiffSupport::rebuildGTIF()\n{\n \/\/ If we already have m_gtiff and m_tiff, that is because we have \n \/\/ already called GetGTIF once before. VLRs ultimately drive how the \n \/\/ SpatialReference is defined, not the GeoTIFF keys. \n if (m_tiff != 0 )\n {\n ST_Destroy(m_tiff);\n m_tiff = 0;\n }\n\n if (m_gtiff != 0 )\n {\n GTIFFree(m_gtiff);\n m_gtiff = 0;\n }\n \n m_tiff = ST_Create();\n \n \/\/ (here it used to read in the VLRs)\n\n m_gtiff = GTIFNewSimpleTags(m_tiff);\n if (!m_gtiff) \n throw std::runtime_error(\"The geotiff keys could not be read from VLR records\");\n \n return;\n}\n\n\nvoid GeotiffSupport::setWkt(const std::string& v)\n{\n if (!m_gtiff)\n {\n rebuildGTIF(); \n }\n\n if (v == \"\")\n {\n return;\n }\n\n int ret = 0;\n ret = GTIFSetFromOGISDefn(m_gtiff, v.c_str());\n if (!ret) \n {\n throw std::invalid_argument(\"could not set m_gtiff from WKT\");\n }\n\n ret = GTIFWriteKeys(m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n return;\n}\n\n \n\/\/ Utility functor with accompanying to print GeoTIFF directory.\nstruct geotiff_dir_printer\n{\n geotiff_dir_printer() {}\n\n std::string output() const { return m_oss.str(); }\n std::string::size_type size() const { return m_oss.str().size(); }\n\n void operator()(char* data, void* aux)\n { \n ::boost::ignore_unused_variable_warning(aux);\n\n if (0 != data)\n {\n m_oss << data;\n }\n }\n\nprivate:\n std::ostringstream m_oss;\n};\n\n\nstatic int libpcGeoTIFFPrint(char* data, void* aux)\n{\n geotiff_dir_printer* printer = reinterpret_cast<geotiff_dir_printer*>(aux);\n (*printer)(data, 0);\n return static_cast<int>(printer->size());\n}\n\n\nstd::string GeotiffSupport::getText() const\n{\n if (m_gtiff == NULL)\n return std::string(\"\");\n\n geotiff_dir_printer geotiff_printer;\n GTIFPrint(m_gtiff, libpcGeoTIFFPrint, &geotiff_printer);\n const std::string s = geotiff_printer.output();\n return s;\n}\n\n\n\n\n#if 0\n\nvoid SpatialReference::setVerticalCS(boost::int32_t verticalCSType, \n std::string const& citation,\n boost::int32_t verticalDatum,\n boost::int32_t verticalUnits)\n{\n if (!m_tiffstuff->m_gtiff)\n {\n rebuildGTIF(); \n }\n\n#ifdef LIBPC_SRS_ENABLED\n if( verticalCSType != KvUserDefined && verticalCSType > 0 )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalCSTypeGeoKey, TYPE_SHORT, 1,\n verticalCSType );\n\n if( citation != \"\" )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalCitationGeoKey, TYPE_ASCII, 0, \n citation.c_str() );\t\t\t \n\n if( verticalDatum > 0 && verticalDatum != KvUserDefined )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalDatumGeoKey, TYPE_SHORT, 1,\n verticalDatum );\n \n if( verticalUnits > 0 && verticalUnits != KvUserDefined )\n GTIFKeySet( m_tiffstuff->m_gtiff, VerticalUnitsGeoKey, TYPE_SHORT, 1,\n verticalUnits );\n\n int ret = GTIFWriteKeys(m_tiffstuff->m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n \/\/ Clear WKT so it gets regenerated \n m_wkt = std::string(\"\");\n \n#else\n boost::ignore_unused_variable_warning(citation);\n boost::ignore_unused_variable_warning(verticalUnits);\n boost::ignore_unused_variable_warning(verticalDatum);\n boost::ignore_unused_variable_warning(verticalCSType);\n#endif\n\n return;\n}\n \n\nvoid SpatialReference::setProj4(std::string const& v)\n{\n if (!m_tiffstuff->m_gtiff)\n {\n rebuildGTIF();\n }\n \n#ifdef LIBPC_SRS_ENABLED\n char* poWKT = 0;\n const char* poProj4 = v.c_str();\n\n OGRSpatialReference srs(NULL);\n if (OGRERR_NONE != srs.importFromProj4(const_cast<char *>(poProj4)))\n {\n throw std::invalid_argument(\"could not import proj4 into OSRSpatialReference SetProj4\");\n }\n \n srs.exportToWkt(&poWKT);\n \n std::string tmp(poWKT);\n CPLFree(poWKT);\n \n int ret = 0;\n ret = GTIFSetFromOGISDefn( m_tiffstuff->m_gtiff, tmp.c_str() );\n if (!ret)\n {\n throw std::invalid_argument(\"could not set m_gtiff from Proj4\");\n }\n\n ret = GTIFWriteKeys(m_tiffstuff->m_gtiff);\n if (!ret) \n {\n throw std::runtime_error(\"The geotiff keys could not be written\");\n }\n\n GTIFDefn defn;\n\n if (m_tiffstuff->m_gtiff && GTIFGetDefn(m_tiffstuff->m_gtiff, &defn)) \n {\n char* proj4def = GTIFGetProj4Defn(&defn);\n std::string tmp(proj4def);\n GTIFFreeMemory( proj4def );\n }\n#else\n boost::ignore_unused_variable_warning(v);\n#endif\n\n return;\n}\n\n\n#endif\n\n} } } \/\/ namespaces\n<|endoftext|>"} {"text":"<commit_before>#include \"KernelProgram.h\"\n#ifdef _WIN32\n#include <Windows.h>\n#endif\n\nnamespace FLIVR\n{\n\tbool KernelProgram::init_ = false;\n\tcl_device_id KernelProgram::device_ = 0;\n\tcl_context KernelProgram::context_ = 0;\n\n\tKernelProgram::KernelProgram(const std::string& source) :\n\tsource_(source), program_(0), kernel_(0), queue_(0)\n\t{\n\t}\n\n\tKernelProgram::~KernelProgram()\n\t{\n\t}\n\n\tvoid KernelProgram::init_kernels_supported()\n\t{\n\t\tif (init_)\n\t\t\treturn;\n\n\t\tcl_int err;\n\t\tcl_platform_id platform;\n\n\t\terr = clGetPlatformIDs(1, &platform, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\terr = clGetDeviceIDs(platform, CL_DEVICE_TYPE_GPU, 1, &device_, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\tcl_context_properties properties[] =\n\t\t{\n#ifdef _WIN32\n\t\t\tCL_GL_CONTEXT_KHR, (cl_context_properties)wglGetCurrentContext(),\n\t\t\tCL_WGL_HDC_KHR, (cl_context_properties)wglGetCurrentDC(),\n#endif\n\t\t\tCL_CONTEXT_PLATFORM, (cl_context_properties)platform,\n\t\t\t0\n\t\t};\n\t\tcontext_ = clCreateContext(properties, 1, &device_, NULL, NULL, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\tinit_ = true;\n\t}\n\n\tbool KernelProgram::init()\n\t{\n\t\treturn init_;\n\t}\n\n\tvoid KernelProgram::clear()\n\t{\n\t\tclReleaseContext(context_);\n\t\tinit_ = false;\n\t}\n\n\tbool KernelProgram::create(std::string &name)\n\t{\n\t\tcl_int err;\n\t\tconst char *c_source[1];\n\t\tc_source[0] = source_.c_str();\n\t\tsize_t program_size = source_.size();\n\t\tprogram_ = clCreateProgramWithSource(context_, 1,\n\t\t\tc_source, &program_size, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\terr = clBuildProgram(program_, 0, NULL, NULL, NULL, NULL);\n\t\tinfo_.clear();\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\tchar *program_log;\n\t\t\tsize_t log_size;\n\t\t\tclGetProgramBuildInfo(program_, device_, CL_PROGRAM_BUILD_LOG,\n\t\t\t\t0, NULL, &log_size);\n\t\t\tprogram_log = new char[log_size+1];\n\t\t\tprogram_log[log_size] = '\\0';\n\t\t\tclGetProgramBuildInfo(program_, device_, CL_PROGRAM_BUILD_LOG,\n\t\t\t\tlog_size+1, program_log, NULL);\n\t\t\tinfo_ = program_log;\n\t\t\tdelete []program_log;\n\t\t\treturn false;\n\t\t}\n\n\t\tkernel_ = clCreateKernel(program_, name.c_str(), &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tqueue_ = clCreateCommandQueue(context_, device_, 0, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool KernelProgram::valid()\n\t{\n\t\treturn init_ && program_ && kernel_ && queue_;\n\t}\n\n\tvoid KernelProgram::destroy()\n\t{\n\t\tclReleaseKernel(kernel_);\n\t\tfor (unsigned int i=0; i<arg_list_.size(); ++i)\n\t\t\tclReleaseMemObject(arg_list_[i].buffer);\n\t\tclReleaseCommandQueue(queue_);\n\t\tclReleaseProgram(program_);\n\t}\n\n\tvoid KernelProgram::execute(cl_uint dim, size_t *global_size, size_t *local_size)\n\t{\n\t\tif (!valid())\n\t\t\treturn;\n\n\t\tcl_int err;\n\t\tglFinish();\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].size == 0)\n\t\t\t{\n\t\t\t\terr = clEnqueueAcquireGLObjects(queue_, 1, &(arg_list_[i].buffer), 0, NULL, NULL);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\terr = clEnqueueNDRangeKernel(queue_, kernel_, dim, NULL, global_size,\n\t\t\tlocal_size, 0, NULL, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].size == 0)\n\t\t\t{\n\t\t\t\terr = clEnqueueReleaseGLObjects(queue_, 1, &(arg_list_[i].buffer), 0, NULL, NULL);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tclFinish(queue_);\n\t}\n\n\tbool KernelProgram::matchArg(Argument* arg, unsigned int& arg_index)\n\t{\n\t\tfor (unsigned int i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == arg->index &&\n\t\t\t\targ_list_[i].size == arg->size &&\n\t\t\t\targ_list_[i].texture == arg->texture)\n\t\t\t{\n\t\t\t\targ_index = i;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid KernelProgram::setKernelArgConst(int i, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (!data)\n\t\t\treturn;\n\n\t\terr = clSetKernelArg(kernel_, i, size, data);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::setKernelArgBuf(int i, cl_mem_flags flag, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (data)\n\t\t{\n\t\t\tArgument arg;\n\t\t\targ.index = i;\n\t\t\targ.size = size;\n\t\t\targ.texture = 0;\n\t\t\tunsigned int index;\n\n\t\t\tif (matchArg(&arg, index))\n\t\t\t{\n\t\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcl_mem buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t\targ.buffer = buffer;\n\t\t\t\targ_list_.push_back(arg);\n\t\t\t}\n\t\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\terr = clSetKernelArg(kernel_, i, size, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::setKernelArgBufWrite(int i, cl_mem_flags flag, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (data)\n\t\t{\n\t\t\tArgument arg;\n\t\t\targ.index = i;\n\t\t\targ.size = size;\n\t\t\targ.texture = 0;\n\t\t\tunsigned int index;\n\n\t\t\tif (matchArg(&arg, index))\n\t\t\t{\n\t\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t\t\tclReleaseMemObject(arg_list_[index].buffer);\n\t\t\t\targ.buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcl_mem buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t\targ.buffer = buffer;\n\t\t\t\targ_list_.push_back(arg);\n\t\t\t}\n\n\t\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\terr = clSetKernelArg(kernel_, i, size, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::setKernelArgTex2D(int i, cl_mem_flags flag, GLuint texture)\n\t{\n\t\tcl_int err;\n\t\tArgument arg;\n\t\targ.index = i;\n\t\targ.size = 0;\n\t\targ.texture = texture;\n\t\tunsigned int index;\n\n\t\tif (matchArg(&arg, index))\n\t\t{\n\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcl_mem tex_buffer = clCreateFromGLTexture2D(context_, flag, GL_TEXTURE_2D, 0, texture, &err);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t\targ.buffer = tex_buffer;\n\t\t\targ_list_.push_back(arg);\n\t\t}\n\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::setKernelArgTex3D(int i, cl_mem_flags flag, GLuint texture)\n\t{\n\t\tcl_int err;\n\t\tArgument arg;\n\t\targ.index = i;\n\t\targ.size = 0;\n\t\targ.texture = texture;\n\t\tunsigned int index;\n\n\t\tif (matchArg(&arg, index))\n\t\t{\n\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcl_mem tex_buffer = clCreateFromGLTexture3D(context_, flag, GL_TEXTURE_3D, 0, texture, &err);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t\targ.buffer = tex_buffer;\n\t\t\targ_list_.push_back(arg);\n\t\t}\n\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::readBuffer(int index, void* data)\n\t{\n\t\tbool found = false;\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == index)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (found)\n\t\t{\n\t\t\tArgument arg = arg_list_[i];\n\t\t\tcl_int err;\n\t\t\terr = clEnqueueReadBuffer(queue_, arg.buffer, CL_TRUE, 0,\n\t\t\t\targ.size, data, 0, NULL, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::writeBuffer(int index, void* pattern,\n\t\tsize_t pattern_size, size_t offset, size_t size)\n\t{\n\t\tbool found = false;\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == index)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (found)\n\t\t{\n\t\t\t\/\/not supported for 1.1\n\t\t\t\/\/Argument arg = arg_list_[i];\n\t\t\t\/\/cl_int err;\n\t\t\t\/\/err = clEnqueueFillBuffer(queue_, arg.buffer, pattern,\n\t\t\t\/\/\tpattern_size, offset, size, 0, NULL, NULL);\n\t\t\t\/\/if (err != CL_SUCCESS)\n\t\t\t\/\/\treturn;\n\t\t}\n\t}\n\n\tstd::string& KernelProgram::getInfo()\n\t{\n\t\treturn info_;\n\t}\n}<commit_msg>opencl kernel code for mac<commit_after>#include \"KernelProgram.h\"\n#ifdef _WIN32\n#include <Windows.h>\n#endif\n\nnamespace FLIVR\n{\n\tbool KernelProgram::init_ = false;\n\tcl_device_id KernelProgram::device_ = 0;\n\tcl_context KernelProgram::context_ = 0;\n\n\tKernelProgram::KernelProgram(const std::string& source) :\n\tsource_(source), program_(0), kernel_(0), queue_(0)\n\t{\n\t}\n\n\tKernelProgram::~KernelProgram()\n\t{\n\t}\n\n\tvoid KernelProgram::init_kernels_supported()\n\t{\n\t\tif (init_)\n\t\t\treturn;\n\n\t\tcl_int err;\n\t\tcl_platform_id platform;\n\n\t\terr = clGetPlatformIDs(1, &platform, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\terr = clGetDeviceIDs(platform, CL_DEVICE_TYPE_GPU, 1, &device_, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\tcl_context_properties properties[] =\n\t\t{\n#ifdef _WIN32\n\t\t\tCL_GL_CONTEXT_KHR, (cl_context_properties)wglGetCurrentContext(),\n\t\t\tCL_WGL_HDC_KHR, (cl_context_properties)wglGetCurrentDC(),\n#endif\n#ifdef _DARWIN\n\t\t\tCL_CONTEXT_PROPERTY_USE_CGL_SHAREGROUP_APPLE, (cl_context_properties) kCGLShareGroup, \n#endif\n\t\t\tCL_CONTEXT_PLATFORM, (cl_context_properties)platform,\n\t\t\t0\n\t\t};\n\t context_ = clCreateContext(properties, 1, &device_, NULL, NULL, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\n\t\tinit_ = true;\n\t}\n\n\tbool KernelProgram::init()\n\t{\n\t\treturn init_;\n\t}\n\n\tvoid KernelProgram::clear()\n\t{\n\t\tclReleaseContext(context_);\n\t\tinit_ = false;\n\t}\n\n\tbool KernelProgram::create(std::string &name)\n\t{\n\t\tcl_int err;\n\t\tconst char *c_source[1];\n\t\tc_source[0] = source_.c_str();\n\t\tsize_t program_size = source_.size();\n\t\tprogram_ = clCreateProgramWithSource(context_, 1,\n\t\t\tc_source, &program_size, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\terr = clBuildProgram(program_, 0, NULL, NULL, NULL, NULL);\n\t\tinfo_.clear();\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\tchar *program_log;\n\t\t\tsize_t log_size;\n\t\t\tclGetProgramBuildInfo(program_, device_, CL_PROGRAM_BUILD_LOG,\n\t\t\t\t0, NULL, &log_size);\n\t\t\tprogram_log = new char[log_size+1];\n\t\t\tprogram_log[log_size] = '\\0';\n\t\t\tclGetProgramBuildInfo(program_, device_, CL_PROGRAM_BUILD_LOG,\n\t\t\t\tlog_size+1, program_log, NULL);\n\t\t\tinfo_ = program_log;\n\t\t\tdelete []program_log;\n\t\t\treturn false;\n\t\t}\n\n\t\tkernel_ = clCreateKernel(program_, name.c_str(), &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tqueue_ = clCreateCommandQueue(context_, device_, 0, &err);\n\t\tif (err != CL_SUCCESS)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tbool KernelProgram::valid()\n\t{\n\t\treturn init_ && program_ && kernel_ && queue_;\n\t}\n\n\tvoid KernelProgram::destroy()\n\t{\n\t\tclReleaseKernel(kernel_);\n\t\tfor (unsigned int i=0; i<arg_list_.size(); ++i)\n\t\t\tclReleaseMemObject(arg_list_[i].buffer);\n\t\tclReleaseCommandQueue(queue_);\n\t\tclReleaseProgram(program_);\n\t}\n\n\tvoid KernelProgram::execute(cl_uint dim, size_t *global_size, size_t *local_size)\n\t{\n\t\tif (!valid())\n\t\t\treturn;\n\n\t\tcl_int err;\n\t\tglFinish();\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].size == 0)\n\t\t\t{\n\t\t\t\terr = clEnqueueAcquireGLObjects(queue_, 1, &(arg_list_[i].buffer), 0, NULL, NULL);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\terr = clEnqueueNDRangeKernel(queue_, kernel_, dim, NULL, global_size,\n\t\t\tlocal_size, 0, NULL, NULL);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].size == 0)\n\t\t\t{\n\t\t\t\terr = clEnqueueReleaseGLObjects(queue_, 1, &(arg_list_[i].buffer), 0, NULL, NULL);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tclFinish(queue_);\n\t}\n\n\tbool KernelProgram::matchArg(Argument* arg, unsigned int& arg_index)\n\t{\n\t\tfor (unsigned int i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == arg->index &&\n\t\t\t\targ_list_[i].size == arg->size &&\n\t\t\t\targ_list_[i].texture == arg->texture)\n\t\t\t{\n\t\t\t\targ_index = i;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\tvoid KernelProgram::setKernelArgConst(int i, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (!data)\n\t\t\treturn;\n\n\t\terr = clSetKernelArg(kernel_, i, size, data);\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::setKernelArgBuf(int i, cl_mem_flags flag, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (data)\n\t\t{\n\t\t\tArgument arg;\n\t\t\targ.index = i;\n\t\t\targ.size = size;\n\t\t\targ.texture = 0;\n\t\t\tunsigned int index;\n\n\t\t\tif (matchArg(&arg, index))\n\t\t\t{\n\t\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcl_mem buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t\targ.buffer = buffer;\n\t\t\t\targ_list_.push_back(arg);\n\t\t\t}\n\t\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\terr = clSetKernelArg(kernel_, i, size, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::setKernelArgBufWrite(int i, cl_mem_flags flag, size_t size, void* data)\n\t{\n\t\tcl_int err;\n\n\t\tif (data)\n\t\t{\n\t\t\tArgument arg;\n\t\t\targ.index = i;\n\t\t\targ.size = size;\n\t\t\targ.texture = 0;\n\t\t\tunsigned int index;\n\n\t\t\tif (matchArg(&arg, index))\n\t\t\t{\n\t\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t\t\tclReleaseMemObject(arg_list_[index].buffer);\n\t\t\t\targ.buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcl_mem buffer = clCreateBuffer(context_, flag, size, data, &err);\n\t\t\t\tif (err != CL_SUCCESS)\n\t\t\t\t\treturn;\n\t\t\t\targ.buffer = buffer;\n\t\t\t\targ_list_.push_back(arg);\n\t\t\t}\n\n\t\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t\telse\n\t\t{\n\t\t\terr = clSetKernelArg(kernel_, i, size, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::setKernelArgTex2D(int i, cl_mem_flags flag, GLuint texture)\n\t{\n\t\tcl_int err;\n\t\tArgument arg;\n\t\targ.index = i;\n\t\targ.size = 0;\n\t\targ.texture = texture;\n\t\tunsigned int index;\n\n\t\tif (matchArg(&arg, index))\n\t\t{\n\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcl_mem tex_buffer = clCreateFromGLTexture2D(context_, flag, GL_TEXTURE_2D, 0, texture, &err);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t\targ.buffer = tex_buffer;\n\t\t\targ_list_.push_back(arg);\n\t\t}\n\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::setKernelArgTex3D(int i, cl_mem_flags flag, GLuint texture)\n\t{\n\t\tcl_int err;\n\t\tArgument arg;\n\t\targ.index = i;\n\t\targ.size = 0;\n\t\targ.texture = texture;\n\t\tunsigned int index;\n\n\t\tif (matchArg(&arg, index))\n\t\t{\n\t\t\targ.buffer = arg_list_[index].buffer;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcl_mem tex_buffer = clCreateFromGLTexture3D(context_, flag, GL_TEXTURE_3D, 0, texture, &err);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t\targ.buffer = tex_buffer;\n\t\t\targ_list_.push_back(arg);\n\t\t}\n\t\terr = clSetKernelArg(kernel_, i, sizeof(cl_mem), &(arg.buffer));\n\t\tif (err != CL_SUCCESS)\n\t\t\treturn;\n\t}\n\n\tvoid KernelProgram::readBuffer(int index, void* data)\n\t{\n\t\tbool found = false;\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == index)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (found)\n\t\t{\n\t\t\tArgument arg = arg_list_[i];\n\t\t\tcl_int err;\n\t\t\terr = clEnqueueReadBuffer(queue_, arg.buffer, CL_TRUE, 0,\n\t\t\t\targ.size, data, 0, NULL, NULL);\n\t\t\tif (err != CL_SUCCESS)\n\t\t\t\treturn;\n\t\t}\n\t}\n\n\tvoid KernelProgram::writeBuffer(int index, void* pattern,\n\t\tsize_t pattern_size, size_t offset, size_t size)\n\t{\n\t\tbool found = false;\n\t\tunsigned int i;\n\t\tfor (i=0; i<arg_list_.size(); ++i)\n\t\t{\n\t\t\tif (arg_list_[i].index == index)\n\t\t\t{\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (found)\n\t\t{\n\t\t\t\/\/not supported for 1.1\n\t\t\t\/\/Argument arg = arg_list_[i];\n\t\t\t\/\/cl_int err;\n\t\t\t\/\/err = clEnqueueFillBuffer(queue_, arg.buffer, pattern,\n\t\t\t\/\/\tpattern_size, offset, size, 0, NULL, NULL);\n\t\t\t\/\/if (err != CL_SUCCESS)\n\t\t\t\/\/\treturn;\n\t\t}\n\t}\n\n\tstd::string& KernelProgram::getInfo()\n\t{\n\t\treturn info_;\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <fnordmetric\/sstable\/binaryformat.h>\n#include <fnordmetric\/sstable\/fileheaderwriter.h>\n#include <fnordmetric\/sstable\/fileheaderreader.h>\n#include <fnordmetric\/sstable\/sstablewriter.h>\n#include <fnordmetric\/util\/fnv.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n#include <string.h>\n\nnamespace fnord {\nnamespace sstable {\n\nstd::unique_ptr<SSTableWriter> SSTableWriter::create(\n const std::string& filename,\n IndexProvider index_provider,\n void const* header,\n size_t header_size) {\n auto file = io::File::openFile(filename, io::File::O_READ);\n auto file_size = file.size();\n if (file_size > 0) {\n RAISE(kIllegalStateError, \"file size must be 0\");\n }\n\n auto sstable = new SSTableWriter(\n filename,\n file_size,\n index_provider.popIndexes());\n\n sstable->writeHeader(header, header_size);\n return std::unique_ptr<SSTableWriter>(sstable);\n}\n\nstd::unique_ptr<SSTableWriter> SSTableWriter::reopen(\n const std::string& filename,\n IndexProvider index_provider) {\n auto file = io::File::openFile(filename, io::File::O_READ);\n auto file_size = file.size();\n\n auto sstable = new SSTableWriter(\n filename,\n file_size,\n index_provider.popIndexes());\n\n sstable->reopen(file_size);\n return std::unique_ptr<SSTableWriter>(sstable);\n}\n\nSSTableWriter::SSTableWriter(\n const std::string& filename,\n size_t file_size,\n std::vector<Index::IndexRef>&& indexes) :\n indexes_(std::move(indexes)),\n mmap_(new io::MmapPageManager(filename, file_size)),\n header_size_(0),\n body_size_(0),\n finalized_(false) {}\n\nSSTableWriter::~SSTableWriter() {\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::appendRow(\n void const* key,\n size_t key_size,\n void const* data,\n size_t data_size) {\n if (finalized_) {\n RAISE(kIllegalStateError, \"table is immutable (alread finalized)\");\n }\n \/\/ FIXPAUL assert that key is monotonically increasing...\n\n size_t page_size = sizeof(BinaryFormat::RowHeader) + key_size + data_size;\n auto alloc = mmap_->allocPage(page_size);\n auto page = mmap_->getPage(alloc);\n\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n header->key_size = key_size;\n header->data_size = data_size;\n\n auto key_dst = page->structAt<void>(sizeof(BinaryFormat::RowHeader));\n memcpy(key_dst, key, key_size);\n\n auto data_dst = page->structAt<void>(\n sizeof(BinaryFormat::RowHeader) + key_size);\n memcpy(data_dst, data, data_size);\n\n util::FNV<uint32_t> fnv;\n header->checksum = fnv.hash(\n page->structAt<void>(sizeof(uint32_t)),\n page_size - sizeof(uint32_t));\n\n page->sync();\n\n auto row_body_offset = body_size_;\n body_size_ += page_size;\n\n for (const auto& idx : indexes_) {\n idx->addRow(row_body_offset, key, key_size, data, data_size);\n }\n}\n\nvoid SSTableWriter::appendRow(\n const std::string& key,\n const std::string& value) {\n appendRow(key.data(), key.size(), value.data(), value.size());\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::writeHeader(void const* userdata, size_t userdata_size) {\n if (header_size_ > 0) {\n RAISE(kIllegalStateError, \"header already written\");\n }\n\n header_size_ = FileHeaderWriter::calculateSize(userdata_size);\n auto alloc = mmap_->allocPage(header_size_);\n auto page = mmap_->getPage(alloc);\n\n if (alloc.offset != 0) {\n RAISE(kIllegalStateError, \"header page offset must be 0\");\n }\n\n FileHeaderWriter header(\n page->ptr(),\n page->size(),\n 0,\n userdata,\n userdata_size);\n\n page->sync();\n}\n\nvoid SSTableWriter::writeIndex(uint32_t index_type, void* data, size_t size) {\n if (finalized_) {\n RAISE(kIllegalStateError, \"table is immutable (alread finalized)\");\n }\n\n auto alloc = mmap_->allocPage(sizeof(BinaryFormat::FooterHeader) + size);\n auto page = mmap_->getPage(alloc, io::MmapPageManager::kNoPadding{});\n\n auto header = page->structAt<BinaryFormat::FooterHeader>(0);\n header->magic = BinaryFormat::kMagicBytes;\n header->type = index_type;\n header->footer_size = size;\n\n util::FNV<uint32_t> fnv;\n header->footer_checksum = fnv.hash(data, size);\n\n if (size > 0) {\n auto dst = page->structAt<void>(sizeof(BinaryFormat::FooterHeader));\n memcpy(dst, data, size);\n }\n\n page->sync();\n mmap_->shrinkFile();\n}\n\nvoid SSTableWriter::reopen(size_t file_size) {\n auto page = mmap_->getPage(io::PageManager::Page(0, file_size));\n\n FileHeaderReader header(page->ptr(), page->size());\n\n if (!header.verify()) {\n RAISE(kIllegalStateError, \"corrupt sstable header\");\n }\n\n if (header.bodySize() != 0) {\n RAISE(kIllegalStateError, \"finalized sstable can't be re-opened\");\n }\n\n if (header.headerSize() + header.bodySize() > file_size) {\n RAISE(kIllegalStateError, \"file metadata offsets exceed file bounds\");\n }\n\n header_size_ = header.headerSize();\n body_size_ = file_size - header_size_;\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::finalize() {\n finalized_ = true;\n\n auto page = mmap_->getPage(\n io::PageManager::Page(0, FileHeaderWriter::calculateSize(0)));\n\n FileHeaderWriter header(page->ptr(), page->size());\n header.updateBodySize(body_size_);\n\n page->sync();\n mmap_->shrinkFile();\n}\n\n\/\/ FIXPAUL lock\nstd::unique_ptr<Cursor> SSTableWriter::getCursor() {\n return std::unique_ptr<Cursor>(\n new SSTableWriter::Cursor(this, mmap_.get()));\n}\n\n\/\/ FIXPAUL lock\nsize_t SSTableWriter::bodySize() const {\n return body_size_;\n}\n\nsize_t SSTableWriter::headerSize() const {\n return header_size_;\n}\n\nSSTableWriter::Cursor::Cursor(\n SSTableWriter* table,\n io::MmapPageManager* mmap) :\n table_(table),\n mmap_(mmap),\n pos_(0) {}\n\nvoid SSTableWriter::Cursor::seekTo(size_t body_offset) {\n if (body_offset >= table_->bodySize()) {\n RAISE(kIndexError, \"seekTo() out of bounds position\");\n }\n\n pos_ = body_offset;\n}\n\nbool SSTableWriter::Cursor::next() {\n auto page = getPage();\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n\n size_t page_size = page->page_.size;\n size_t row_size = sizeof(BinaryFormat::RowHeader) + header->key_size +\n header->data_size;\n\n if (row_size > page_size) {\n RAISE(kIllegalStateError, \"row exceeds page boundary\");\n }\n\n if (row_size == page_size) {\n return false;\n } else {\n pos_ += row_size;\n return true;\n }\n}\n\nbool SSTableWriter::Cursor::valid() {\n return pos_ < table_->bodySize();\n}\n\nvoid SSTableWriter::Cursor::getKey(void** data, size_t* size) {\n auto page = getPage();\n size_t page_size = page->page_.size;\n\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n if (header->key_size == 0) {\n RAISE(kIllegalStateError, \"empty key\");\n }\n\n if (sizeof(BinaryFormat::RowHeader) + header->key_size > page_size) {\n RAISE(kIllegalStateError, \"key exceeds page boundary\");\n }\n\n *data = page->structAt<void>(sizeof(BinaryFormat::RowHeader));\n *size = header->key_size;\n}\n\nsize_t SSTableWriter::Cursor::position() const {\n return pos_;\n}\n\nvoid SSTableWriter::Cursor::getData(void** data, size_t* size) {\n auto page = getPage();\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n\n size_t page_size = page->page_.size;\n size_t row_size = sizeof(BinaryFormat::RowHeader) + header->key_size +\n header->data_size;\n if (row_size > page_size) {\n RAISE(kIllegalStateError, \"row exceeds page boundary\");\n }\n\n *data = page->structAt<void>(\n sizeof(BinaryFormat::RowHeader) + header->key_size);\n *size = header->data_size;\n}\n\nstd::unique_ptr<io::PageManager::PageRef> SSTableWriter::Cursor::getPage() {\n return mmap_->getPage(io::PageManager::Page(\n table_->headerSize() + pos_,\n table_->bodySize() - pos_));\n}\n\n}\n}\n<commit_msg>fix SSTableWriter#writeIndex<commit_after>\/**\n * This file is part of the \"FnordMetric\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * FnordMetric is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <fnordmetric\/sstable\/binaryformat.h>\n#include <fnordmetric\/sstable\/fileheaderwriter.h>\n#include <fnordmetric\/sstable\/fileheaderreader.h>\n#include <fnordmetric\/sstable\/sstablewriter.h>\n#include <fnordmetric\/util\/fnv.h>\n#include <fnordmetric\/util\/runtimeexception.h>\n#include <string.h>\n\nnamespace fnord {\nnamespace sstable {\n\nstd::unique_ptr<SSTableWriter> SSTableWriter::create(\n const std::string& filename,\n IndexProvider index_provider,\n void const* header,\n size_t header_size) {\n auto file = io::File::openFile(filename, io::File::O_READ);\n auto file_size = file.size();\n if (file_size > 0) {\n RAISE(kIllegalStateError, \"file size must be 0\");\n }\n\n auto sstable = new SSTableWriter(\n filename,\n file_size,\n index_provider.popIndexes());\n\n sstable->writeHeader(header, header_size);\n return std::unique_ptr<SSTableWriter>(sstable);\n}\n\nstd::unique_ptr<SSTableWriter> SSTableWriter::reopen(\n const std::string& filename,\n IndexProvider index_provider) {\n auto file = io::File::openFile(filename, io::File::O_READ);\n auto file_size = file.size();\n\n auto sstable = new SSTableWriter(\n filename,\n file_size,\n index_provider.popIndexes());\n\n sstable->reopen(file_size);\n return std::unique_ptr<SSTableWriter>(sstable);\n}\n\nSSTableWriter::SSTableWriter(\n const std::string& filename,\n size_t file_size,\n std::vector<Index::IndexRef>&& indexes) :\n indexes_(std::move(indexes)),\n mmap_(new io::MmapPageManager(filename, file_size)),\n header_size_(0),\n body_size_(0),\n finalized_(false) {}\n\nSSTableWriter::~SSTableWriter() {\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::appendRow(\n void const* key,\n size_t key_size,\n void const* data,\n size_t data_size) {\n if (finalized_) {\n RAISE(kIllegalStateError, \"table is immutable (alread finalized)\");\n }\n \/\/ FIXPAUL assert that key is monotonically increasing...\n\n size_t page_size = sizeof(BinaryFormat::RowHeader) + key_size + data_size;\n auto alloc = mmap_->allocPage(page_size);\n auto page = mmap_->getPage(alloc);\n\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n header->key_size = key_size;\n header->data_size = data_size;\n\n auto key_dst = page->structAt<void>(sizeof(BinaryFormat::RowHeader));\n memcpy(key_dst, key, key_size);\n\n auto data_dst = page->structAt<void>(\n sizeof(BinaryFormat::RowHeader) + key_size);\n memcpy(data_dst, data, data_size);\n\n util::FNV<uint32_t> fnv;\n header->checksum = fnv.hash(\n page->structAt<void>(sizeof(uint32_t)),\n page_size - sizeof(uint32_t));\n\n page->sync();\n\n auto row_body_offset = body_size_;\n body_size_ += page_size;\n\n for (const auto& idx : indexes_) {\n idx->addRow(row_body_offset, key, key_size, data, data_size);\n }\n}\n\nvoid SSTableWriter::appendRow(\n const std::string& key,\n const std::string& value) {\n appendRow(key.data(), key.size(), value.data(), value.size());\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::writeHeader(void const* userdata, size_t userdata_size) {\n if (header_size_ > 0) {\n RAISE(kIllegalStateError, \"header already written\");\n }\n\n header_size_ = FileHeaderWriter::calculateSize(userdata_size);\n auto alloc = mmap_->allocPage(header_size_);\n auto page = mmap_->getPage(alloc);\n\n if (alloc.offset != 0) {\n RAISE(kIllegalStateError, \"header page offset must be 0\");\n }\n\n FileHeaderWriter header(\n page->ptr(),\n page->size(),\n 0,\n userdata,\n userdata_size);\n\n page->sync();\n}\n\nvoid SSTableWriter::writeIndex(uint32_t index_type, void* data, size_t size) {\n if (finalized_) {\n RAISE(kIllegalStateError, \"table is immutable (alread finalized)\");\n }\n\n if (size == 0) {\n return;\n }\n\n auto alloc = mmap_->allocPage(sizeof(BinaryFormat::FooterHeader) + size);\n auto page = mmap_->getPage(alloc, io::MmapPageManager::kNoPadding{});\n\n auto header = page->structAt<BinaryFormat::FooterHeader>(0);\n header->magic = BinaryFormat::kMagicBytes;\n header->type = index_type;\n header->footer_size = size;\n\n util::FNV<uint32_t> fnv;\n header->footer_checksum = fnv.hash(data, size);\n\n if (size > 0) {\n auto dst = page->structAt<void>(sizeof(BinaryFormat::FooterHeader));\n memcpy(dst, data, size);\n }\n\n page->sync();\n mmap_->shrinkFile();\n}\n\nvoid SSTableWriter::reopen(size_t file_size) {\n auto page = mmap_->getPage(io::PageManager::Page(0, file_size));\n\n FileHeaderReader header(page->ptr(), page->size());\n\n if (!header.verify()) {\n RAISE(kIllegalStateError, \"corrupt sstable header\");\n }\n\n if (header.bodySize() != 0) {\n RAISE(kIllegalStateError, \"finalized sstable can't be re-opened\");\n }\n\n if (header.headerSize() + header.bodySize() > file_size) {\n RAISE(kIllegalStateError, \"file metadata offsets exceed file bounds\");\n }\n\n header_size_ = header.headerSize();\n body_size_ = file_size - header_size_;\n}\n\n\/\/ FIXPAUL lock\nvoid SSTableWriter::finalize() {\n finalized_ = true;\n\n auto page = mmap_->getPage(\n io::PageManager::Page(0, FileHeaderWriter::calculateSize(0)));\n\n FileHeaderWriter header(page->ptr(), page->size());\n header.updateBodySize(body_size_);\n\n page->sync();\n mmap_->shrinkFile();\n}\n\n\/\/ FIXPAUL lock\nstd::unique_ptr<Cursor> SSTableWriter::getCursor() {\n return std::unique_ptr<Cursor>(\n new SSTableWriter::Cursor(this, mmap_.get()));\n}\n\n\/\/ FIXPAUL lock\nsize_t SSTableWriter::bodySize() const {\n return body_size_;\n}\n\nsize_t SSTableWriter::headerSize() const {\n return header_size_;\n}\n\nSSTableWriter::Cursor::Cursor(\n SSTableWriter* table,\n io::MmapPageManager* mmap) :\n table_(table),\n mmap_(mmap),\n pos_(0) {}\n\nvoid SSTableWriter::Cursor::seekTo(size_t body_offset) {\n if (body_offset >= table_->bodySize()) {\n RAISE(kIndexError, \"seekTo() out of bounds position\");\n }\n\n pos_ = body_offset;\n}\n\nbool SSTableWriter::Cursor::next() {\n auto page = getPage();\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n\n size_t page_size = page->page_.size;\n size_t row_size = sizeof(BinaryFormat::RowHeader) + header->key_size +\n header->data_size;\n\n if (row_size > page_size) {\n RAISE(kIllegalStateError, \"row exceeds page boundary\");\n }\n\n if (row_size == page_size) {\n return false;\n } else {\n pos_ += row_size;\n return true;\n }\n}\n\nbool SSTableWriter::Cursor::valid() {\n return pos_ < table_->bodySize();\n}\n\nvoid SSTableWriter::Cursor::getKey(void** data, size_t* size) {\n auto page = getPage();\n size_t page_size = page->page_.size;\n\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n if (header->key_size == 0) {\n RAISE(kIllegalStateError, \"empty key\");\n }\n\n if (sizeof(BinaryFormat::RowHeader) + header->key_size > page_size) {\n RAISE(kIllegalStateError, \"key exceeds page boundary\");\n }\n\n *data = page->structAt<void>(sizeof(BinaryFormat::RowHeader));\n *size = header->key_size;\n}\n\nsize_t SSTableWriter::Cursor::position() const {\n return pos_;\n}\n\nvoid SSTableWriter::Cursor::getData(void** data, size_t* size) {\n auto page = getPage();\n auto header = page->structAt<BinaryFormat::RowHeader>(0);\n\n size_t page_size = page->page_.size;\n size_t row_size = sizeof(BinaryFormat::RowHeader) + header->key_size +\n header->data_size;\n if (row_size > page_size) {\n RAISE(kIllegalStateError, \"row exceeds page boundary\");\n }\n\n *data = page->structAt<void>(\n sizeof(BinaryFormat::RowHeader) + header->key_size);\n *size = header->data_size;\n}\n\nstd::unique_ptr<io::PageManager::PageRef> SSTableWriter::Cursor::getPage() {\n return mmap_->getPage(io::PageManager::Page(\n table_->headerSize() + pos_,\n table_->bodySize() - pos_));\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#include \"..\/..\/core\/Setup.h\"\n\n#if OUZEL_COMPILE_OPENSL\n\n#include <array>\n#include <system_error>\n#include \"OSLAudioDevice.hpp\"\n#include \"OSLErrorCategory.hpp\"\n#include \"..\/..\/core\/Engine.hpp\"\n#include \"..\/..\/utils\/Log.hpp\"\n\nnamespace ouzel::audio::opensl\n{\n namespace\n {\n const ErrorCategory errorCategory{};\n\n std::error_code makeErrorCode(SLresult e)\n {\n return std::error_code(static_cast<int>(e), errorCategory);\n }\n\n void playerCallback(SLAndroidSimpleBufferQueueItf bufferQueue, void* context)\n {\n try\n {\n auto audioDevice = static_cast<AudioDevice*>(context);\n\n audioDevice->enqueue(bufferQueue);\n }\n catch (const std::exception& e)\n {\n logger.log(Log::Level::error) << e.what();\n }\n }\n\n constexpr SLuint32 getChannelMask(std::uint32_t channels)\n {\n switch (channels)\n {\n case 1: return SL_SPEAKER_FRONT_CENTER;\n case 2: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT;\n case 4: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_BACK_LEFT | SL_SPEAKER_BACK_RIGHT;\n case 6: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_SIDE_LEFT|SL_SPEAKER_SIDE_RIGHT;\n case 7: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_BACK_CENTER | SL_SPEAKER_SIDE_LEFT | SL_SPEAKER_SIDE_RIGHT;\n case 8: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_BACK_LEFT|SL_SPEAKER_BACK_RIGHT | SL_SPEAKER_SIDE_LEFT | SL_SPEAKER_SIDE_RIGHT;\n default:\n throw std::runtime_error(\"Invalid channel count\");\n }\n }\n }\n\n AudioDevice::AudioDevice(const Settings& settings,\n const std::function<void(std::uint32_t frames,\n std::uint32_t channels,\n std::uint32_t sampleRate,\n std::vector<float>& samples)>& initDataGetter):\n audio::AudioDevice(Driver::openSL, settings, initDataGetter)\n {\n const std::array engineInterfaces = { SL_IID_ENGINE, SL_IID_ENGINECAPABILITIES };\n constexpr std::array engineRequirements = { SL_BOOLEAN_TRUE, SL_BOOLEAN_FALSE };\n\n SLObjectItf engineObjectPointer;\n if (const auto result = slCreateEngine(&engineObjectPointer, 0, nullptr,\n static_cast<SLuint32>(engineInterfaces.size()),\n engineInterfaces.data(),\n engineRequirements.data()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL engine object\");\n \n engineObject = engineObjectPointer;\n\n if (const auto result = engineObject->Realize(engineObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL engine object\");\n\n SLEngineCapabilitiesItf engineCapabilities;\n if (const auto result = engineObject->GetInterface(engineObject.get(), SL_IID_ENGINECAPABILITIES, &engineCapabilities); result == SL_RESULT_SUCCESS)\n {\n SLint16 major;\n SLint16 minor;\n SLint16 step;\n if (const auto result = (*engineCapabilities)->QueryAPIVersion(engineCapabilities, &major, &minor, &step); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL version\");\n \n apiMajorVersion = static_cast<std::uint16_t>(major);\n apiMinorVersion = static_cast<std::uint16_t>(minor);\n }\n else\n {\n apiMajorVersion = 1;\n apiMinorVersion = 0;\n }\n\n if (const auto result = engineObject->GetInterface(engineObject.get(), SL_IID_ENGINE, &engine); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL engine\");\n\n SLObjectItf outputMixObjectPointer;\n if (const auto result = (*engine)->CreateOutputMix(engine, &outputMixObjectPointer, 0, nullptr, nullptr); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL output mix\");\n \n outputMixObject = outputMixObjectPointer;\n\n if (const auto result = outputMixObject->Realize(outputMixObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL output mix\");\n\n SLDataLocator_AndroidSimpleBufferQueue location = {SL_DATALOCATOR_ANDROIDSIMPLEBUFFERQUEUE, 2};\n\n SLDataFormat_PCM dataFormat;\n dataFormat.formatType = SL_DATAFORMAT_PCM;\n \/\/ TODO: get speaker count\n dataFormat.numChannels = channels;\n dataFormat.samplesPerSec = sampleRate * 1000; \/\/ mHz\n dataFormat.bitsPerSample = sizeof(std::int16_t) * 8;\n dataFormat.containerSize = dataFormat.bitsPerSample;\n dataFormat.channelMask = getChannelMask(channels);\n dataFormat.endianness = SL_BYTEORDER_LITTLEENDIAN;\n\n SLDataSource dataSource{&location, &dataFormat};\n SLDataLocator_OutputMix dataLocatorOut{SL_DATALOCATOR_OUTPUTMIX, outputMixObject.get()};\n SLDataSink dataSink{&dataLocatorOut, nullptr};\n constexpr SLuint32 playerIIDCount = 3;\n const SLInterfaceID playerIIDs[] = {SL_IID_BUFFERQUEUE, SL_IID_PLAY, SL_IID_VOLUME};\n constexpr SLboolean playerReqs[] = {SL_BOOLEAN_TRUE, SL_BOOLEAN_TRUE, SL_BOOLEAN_TRUE};\n\n SLObjectItf playerObjectPointer;\n if (const auto result = (*engine)->CreateAudioPlayer(engine, &playerObjectPointer, &dataSource, &dataSink, playerIIDCount, playerIIDs, playerReqs); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL player object\");\n\n playerObject = playerObjectPointer;\n\n sampleFormat = SampleFormat::signedInt16;\n\n if (const auto result = playerObject->Realize(playerObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL player object\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_PLAY, &player); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL player interface\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_BUFFERQUEUE, &bufferQueue); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL buffer queue interface\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_VOLUME, &playerVolume); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL volume interface\");\n\n if (const auto result = (*bufferQueue)->Clear(bufferQueue); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to clear OpenSL buffer\");\n\n if (const auto result = (*bufferQueue)->RegisterCallback(bufferQueue, playerCallback, this); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to register OpenSL buffer queue callback\");\n }\n\n void AudioDevice::start()\n {\n getData(bufferSize \/ (channels * sizeof(std::int16_t)), data);\n\n if (const auto result = (*bufferQueue)->Enqueue(bufferQueue, data.data(), data.size()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to enqueue OpenSL data\");\n\n if (const auto result = (*player)->SetPlayState(player, SL_PLAYSTATE_PLAYING); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to play sound\");\n }\n\n void AudioDevice::stop()\n {\n if (const auto result = (*player)->SetPlayState(player, SL_PLAYSTATE_STOPPED); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to stop sound\");\n }\n\n void AudioDevice::enqueue(SLAndroidSimpleBufferQueueItf bufferQueue)\n {\n getData(bufferSize \/ (channels * sizeof(std::int16_t)), data);\n\n if (const auto result = (*bufferQueue)->Enqueue(bufferQueue, data.data(), data.size()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to enqueue OpenSL data\");\n }\n}\n#endif\n<commit_msg>Add comment why the version is set to 1.0<commit_after>\/\/ Copyright 2015-2020 Elviss Strazdins. All rights reserved.\n\n#include \"..\/..\/core\/Setup.h\"\n\n#if OUZEL_COMPILE_OPENSL\n\n#include <array>\n#include <system_error>\n#include \"OSLAudioDevice.hpp\"\n#include \"OSLErrorCategory.hpp\"\n#include \"..\/..\/core\/Engine.hpp\"\n#include \"..\/..\/utils\/Log.hpp\"\n\nnamespace ouzel::audio::opensl\n{\n namespace\n {\n const ErrorCategory errorCategory{};\n\n std::error_code makeErrorCode(SLresult e)\n {\n return std::error_code(static_cast<int>(e), errorCategory);\n }\n\n void playerCallback(SLAndroidSimpleBufferQueueItf bufferQueue, void* context)\n {\n try\n {\n auto audioDevice = static_cast<AudioDevice*>(context);\n\n audioDevice->enqueue(bufferQueue);\n }\n catch (const std::exception& e)\n {\n logger.log(Log::Level::error) << e.what();\n }\n }\n\n constexpr SLuint32 getChannelMask(std::uint32_t channels)\n {\n switch (channels)\n {\n case 1: return SL_SPEAKER_FRONT_CENTER;\n case 2: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT;\n case 4: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_BACK_LEFT | SL_SPEAKER_BACK_RIGHT;\n case 6: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_SIDE_LEFT|SL_SPEAKER_SIDE_RIGHT;\n case 7: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_BACK_CENTER | SL_SPEAKER_SIDE_LEFT | SL_SPEAKER_SIDE_RIGHT;\n case 8: return SL_SPEAKER_FRONT_LEFT | SL_SPEAKER_FRONT_RIGHT | SL_SPEAKER_FRONT_CENTER | SL_SPEAKER_LOW_FREQUENCY | SL_SPEAKER_BACK_LEFT|SL_SPEAKER_BACK_RIGHT | SL_SPEAKER_SIDE_LEFT | SL_SPEAKER_SIDE_RIGHT;\n default:\n throw std::runtime_error(\"Invalid channel count\");\n }\n }\n }\n\n AudioDevice::AudioDevice(const Settings& settings,\n const std::function<void(std::uint32_t frames,\n std::uint32_t channels,\n std::uint32_t sampleRate,\n std::vector<float>& samples)>& initDataGetter):\n audio::AudioDevice(Driver::openSL, settings, initDataGetter)\n {\n const std::array engineInterfaces = { SL_IID_ENGINE, SL_IID_ENGINECAPABILITIES };\n constexpr std::array engineRequirements = { SL_BOOLEAN_TRUE, SL_BOOLEAN_FALSE };\n\n SLObjectItf engineObjectPointer;\n if (const auto result = slCreateEngine(&engineObjectPointer, 0, nullptr,\n static_cast<SLuint32>(engineInterfaces.size()),\n engineInterfaces.data(),\n engineRequirements.data()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL engine object\");\n \n engineObject = engineObjectPointer;\n\n if (const auto result = engineObject->Realize(engineObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL engine object\");\n\n SLEngineCapabilitiesItf engineCapabilities;\n if (const auto result = engineObject->GetInterface(engineObject.get(), SL_IID_ENGINECAPABILITIES, &engineCapabilities); result == SL_RESULT_SUCCESS)\n {\n SLint16 major;\n SLint16 minor;\n SLint16 step;\n if (const auto result = (*engineCapabilities)->QueryAPIVersion(engineCapabilities, &major, &minor, &step); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL version\");\n \n apiMajorVersion = static_cast<std::uint16_t>(major);\n apiMinorVersion = static_cast<std::uint16_t>(minor);\n }\n else\n {\n \/\/ engine capabilities interface is not supported in OpenSL ES 1.0\n apiMajorVersion = 1;\n apiMinorVersion = 0;\n }\n\n if (const auto result = engineObject->GetInterface(engineObject.get(), SL_IID_ENGINE, &engine); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL engine\");\n\n SLObjectItf outputMixObjectPointer;\n if (const auto result = (*engine)->CreateOutputMix(engine, &outputMixObjectPointer, 0, nullptr, nullptr); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL output mix\");\n \n outputMixObject = outputMixObjectPointer;\n\n if (const auto result = outputMixObject->Realize(outputMixObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL output mix\");\n\n SLDataLocator_AndroidSimpleBufferQueue location = {SL_DATALOCATOR_ANDROIDSIMPLEBUFFERQUEUE, 2};\n\n SLDataFormat_PCM dataFormat;\n dataFormat.formatType = SL_DATAFORMAT_PCM;\n \/\/ TODO: get speaker count\n dataFormat.numChannels = channels;\n dataFormat.samplesPerSec = sampleRate * 1000; \/\/ mHz\n dataFormat.bitsPerSample = sizeof(std::int16_t) * 8;\n dataFormat.containerSize = dataFormat.bitsPerSample;\n dataFormat.channelMask = getChannelMask(channels);\n dataFormat.endianness = SL_BYTEORDER_LITTLEENDIAN;\n\n SLDataSource dataSource{&location, &dataFormat};\n SLDataLocator_OutputMix dataLocatorOut{SL_DATALOCATOR_OUTPUTMIX, outputMixObject.get()};\n SLDataSink dataSink{&dataLocatorOut, nullptr};\n constexpr SLuint32 playerIIDCount = 3;\n const SLInterfaceID playerIIDs[] = {SL_IID_BUFFERQUEUE, SL_IID_PLAY, SL_IID_VOLUME};\n constexpr SLboolean playerReqs[] = {SL_BOOLEAN_TRUE, SL_BOOLEAN_TRUE, SL_BOOLEAN_TRUE};\n\n SLObjectItf playerObjectPointer;\n if (const auto result = (*engine)->CreateAudioPlayer(engine, &playerObjectPointer, &dataSource, &dataSink, playerIIDCount, playerIIDs, playerReqs); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL player object\");\n\n playerObject = playerObjectPointer;\n\n sampleFormat = SampleFormat::signedInt16;\n\n if (const auto result = playerObject->Realize(playerObject.get(), SL_BOOLEAN_FALSE); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to create OpenSL player object\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_PLAY, &player); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL player interface\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_BUFFERQUEUE, &bufferQueue); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL buffer queue interface\");\n\n if (const auto result = playerObject->GetInterface(playerObject.get(), SL_IID_VOLUME, &playerVolume); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to get OpenSL volume interface\");\n\n if (const auto result = (*bufferQueue)->Clear(bufferQueue); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to clear OpenSL buffer\");\n\n if (const auto result = (*bufferQueue)->RegisterCallback(bufferQueue, playerCallback, this); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to register OpenSL buffer queue callback\");\n }\n\n void AudioDevice::start()\n {\n getData(bufferSize \/ (channels * sizeof(std::int16_t)), data);\n\n if (const auto result = (*bufferQueue)->Enqueue(bufferQueue, data.data(), data.size()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to enqueue OpenSL data\");\n\n if (const auto result = (*player)->SetPlayState(player, SL_PLAYSTATE_PLAYING); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to play sound\");\n }\n\n void AudioDevice::stop()\n {\n if (const auto result = (*player)->SetPlayState(player, SL_PLAYSTATE_STOPPED); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to stop sound\");\n }\n\n void AudioDevice::enqueue(SLAndroidSimpleBufferQueueItf bufferQueue)\n {\n getData(bufferSize \/ (channels * sizeof(std::int16_t)), data);\n\n if (const auto result = (*bufferQueue)->Enqueue(bufferQueue, data.data(), data.size()); result != SL_RESULT_SUCCESS)\n throw std::system_error(makeErrorCode(result), \"Failed to enqueue OpenSL data\");\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\t____________________________________________________________________________\n\n\t Scanner Component for the Micro A Compiler\n\n\t mscan.h\n\n\t Version 2007 - 2016\n \n\t James L. Richards\n\t Last Update: August 28, 2007\n\t \t Nelson A Castillo\n\t Last Update: January 31, 2016\n\n\tThe routines in this unit are based on those provided in the book \n\t\"Crafting A Compiler\" by Charles N. Fischer and Richard J. LeBlanc, Jr., \n\tBenjamin Cummings Publishing Co. (1991).\n\n\tSee Section 2.2, pp. 25-29.\n\t____________________________________________________________________________\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nextern ifstream sourceFile;\nextern ofstream outFile, listFile;\n\n#include \"mscan.h\"\n\n\/\/ *******************\n\/\/ ** Constructor **\n\/\/ *******************\n\nScanner::Scanner()\n{\n\ttokenBuffer = \"\";\n\tlineBuffer = \"\";\n\tlineNumber = 0;\n\tcheese_size = 1; \/* Null char *\/\n}\n\n\/\/ ********************************\n\/\/ ** Private Member Functions **\n\/\/ ********************************\n\nvoid Scanner::BufferChar(char c)\n{\n\tif (tokenBuffer.length() < ID_STRING_LEN){\n\t\ttokenBuffer += c;\n\t} else {\n\t\tcout << endl << \" *** Fatal error: token is bigger then \"\n\t\t\t<< \"the TokenBuffer.\" << endl;\n\t\tcout << \" *** Error at line \" << this->lineNumber << endl;\n\t\tcout << \" *** Please consider spliting cheese variables \"\n\t\t\t<< \"or recompiling the MaccNCheese compiler \"\n\t\t\t<< \"with a bigger TokenBuffer.\" << endl;\n\t\texit(1);\n\t}\n}\n\nToken Scanner::CheckReserved()\n{\n\t\/*\n\t * FIXME this converts variables to lowercase too.\n\t * It was not supposed to do so.\n\t *\/\n\t\/* Convert the string to lower case *\/\n\ttransform(tokenBuffer.begin(), tokenBuffer.end(), \\\n\t\t\t\ttokenBuffer.begin(), ::tolower);\n\t\/* Check the converted words *\/\n\tif ((tokenBuffer) == \"bool\") return BOOL_SYM;\n\tif ((tokenBuffer) == \"break\") return BREAK_SYM;\n\tif ((tokenBuffer) == \"case\") return CASE_SYM;\n\tif ((tokenBuffer) == \"cheese\") return CHEESE_SYM;\n\tif ((tokenBuffer) == \"decs\") return DECS_SYM;\n\tif ((tokenBuffer) == \"do\") return DO_SYM;\n\tif ((tokenBuffer) == \"else\") return ELSE_SYM;\n\tif ((tokenBuffer) == \"end\") return END_SYM;\n\tif ((tokenBuffer) == \"false\") return FALSE_SYM;\n\tif ((tokenBuffer) == \"float\") return FLOAT_SYM;\n\tif ((tokenBuffer) == \"for\") return FOR_SYM;\n\tif ((tokenBuffer) == \"hiphip\") return HIPHIP_SYM;\n\tif ((tokenBuffer) == \"if\") return IF_SYM;\n\tif ((tokenBuffer) == \"int\") return INT_SYM;\n\tif ((tokenBuffer) == \"listen\") return LISTEN_SYM;\n\tif ((tokenBuffer) == \"otherwise\") return OTHERWISE_SYM;\n\tif ((tokenBuffer) == \"until\") return UNTIL_SYM;\n\tif ((tokenBuffer) == \"select\") return SELECT_SYM;\n\tif ((tokenBuffer) == \"shout\") return SHOUT_SYM;\n\tif ((tokenBuffer) == \"then\") return THEN_SYM;\n\tif ((tokenBuffer) == \"true\") return TRUE_SYM;\n\tif ((tokenBuffer) == \"while\") return WHILE_SYM;\n\n\treturn ID;\n}\n\nvoid Scanner::ClearBuffer()\n{\n\ttokenBuffer = \"\";\n}\n\nvoid Scanner::LexicalError(char& c)\n{\t\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\n\tc = NextChar();\n}\nvoid Scanner::LexicalError(char& c, const string& errorExp)\n{\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << '\\n'\n\t\t<< errorExp << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << '\\n'\n\t\t<< errorExp << endl;\n\n\tc = NextChar();\n}\n\nchar Scanner::NextChar()\n{\n\tchar c;\n\n\tsourceFile.get(c);\n\tif (c == '\\n')\n\t{\n\t\tlistFile.width(6);\n\t\tlistFile << ++lineNumber << \" \" << lineBuffer << endl;\n\t\tlineBuffer = \"\";\n\t} else{\n\t\tlineBuffer += c;\n\t}\n\treturn c;\n}\n\n\/\/ *******************************\n\/\/ ** Public Member Functions **\n\/\/ *******************************\n\nToken Scanner::GetNextToken()\n{\n\tchar currentChar, c;\n\n\tClearBuffer();\n\tcurrentChar = NextChar();\n\twhile (!sourceFile.eof())\n\t{\n\t\tif (isspace(currentChar)) {\n\t\t\t\/* do nothing *\/\n\t\t\tcurrentChar = NextChar();\n\t\t} else if (isalpha(currentChar)) {\n\t\t\t\/* identifier *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isalnum(c) || c == '_') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\treturn CheckReserved();\n\t\t} else if (isdigit(currentChar)) {\n\t\t\t\/* integer or float literals *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isdigit(c)) {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\t\/* check if it is a float *\/\n\t\t\tif (c == '.') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\/* check for a digit after the '.' *\/\n\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\tLexicalError(currentChar, to_string(c) \\\n\t\t\t\t\t\t+ \" Float needs a digit\" \\\n\t\t\t\t\t\t\" after the '.'\");\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t}\n\t\t\t\t\/* check for power of 10 multipliers *\/\n\t\t\t\tif (c == 'e' || c == 'E') {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (c != '+' && c!= '-') {\n\t\t\t\t\t\tLexicalError(currentChar, \\\n\t\t\t\t\t\t\tto_string(c) + \\\n\t\t\t\t\t\t\t\" Float needs a \"\n\t\t\t\t\t\t\t\"'+'\/'-' after 'E'\");\n\t\t\t\t\t}\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\t\tLexicalError(currentChar, \\\n\t\t\t\t\t\t\tto_string(c) + \\\n\t\t\t\t\t\t\t\" Float needs a \" \\\n\t\t\t\t\t\t\t\"digit after '+'\/'-'\");\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn FLOAT_LIT;\n\t\t\t}\n\t\t\treturn INT_LIT;\n\t\t} else if (currentChar == '\"') {\n\t\t\t\/* string literal *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\tcheese_size = 1; \/* Null Char *\/\n\t\t\t\/* while not end of string *\/\n\t\t\twhile (c != '\"') {\n\t\t\t\t\/* escape sequences *\/\n\t\t\t\tif (c == '\\\\') {\n\t\t\t\t\t\/*\n\t\t\t\t\t * Replace the '\\' for a ':'\n\t\t\t\t\t * which's SAM's escape char\n\t\t\t\t\t *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcurrentChar = ':';\n\t\t\t\t\tif (c == '\\\\') {\n\t\t\t\t\t\t\/* '\\\\' sequence *\/\n\t\t\t\t\t\t\/* Just remove one '\\' *\/\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (c == '\"') {\n\t\t\t\t\t\t\/* '\\\"' sequence *\/\n\t\t\t\t\t\t\/* replace '\\' for ':' *\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (c == 'n') {\n\t\t\t\t\t\t\/* \\n sequence *\/\n\t\t\t\t\t\t\/* replace for ascii '\\n'(012)*\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tcurrentChar = '0';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = '1';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = '2';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (isdigit(c)) {\n\t\t\t\t\t\t\/* '\\ddd' sequence *\/\n\t\t\t\t\t\t\/* replace '\\' for ':' *\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\n\t\t\t\t\t\tint ind;\n\t\t\t\t\t\tfor (ind = 0; ind < 3; ind++) {\n\t\t\t\t\t\t\t\/* check for 3 digits *\/\n\t\t\t\t\t\t\tif (!isdigit(c))\n\t\t\t\t\t\t\t\tLexicalError(c, to_string(c) + \" received. Expected three digits after \\\\.\");\n\t\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLexicalError(currentChar, to_string(currentChar) + \\\n\t\t\t\t\t\t\" was followed by the wrong character -options are \\\\ or \\\".\");\n\t\t\t\t\t}\n\t\t\t\t} else if (c == ':') {\n\t\t\t\t\t\/*\n\t\t\t\t\t * ':' is the escape char used\n\t\t\t\t\t * by the SAM assembler. So it\n\t\t\t\t\t * needs to be escaped.\n\t\t\t\t\t *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcheese_size += 1;\n\t\t\t\t} else {\n\t\t\t\t\t\/* regular characters *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcheese_size += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/* buffer the final '\"' *\/\n\t\t\tcurrentChar = NextChar();\n\t\t\tBufferChar(currentChar);\n\t\t\treturn CHEESE_LIT;\n\t\t} else if (currentChar == '(') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LBANANA;\n\t\t} else if (currentChar == ')') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RBANANA;\n\t\t} else if (currentChar == '[') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LSTAPLE;\n\t\t} else if (currentChar == ']') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RSTAPLE;\n\t\t} else if (currentChar == '{') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LMUSTACHE;\n\t\t} else if (currentChar == '}') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RMUSTACHE;\n\t\t} else if (currentChar == ';') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn SEMICOLON;\n\t\t} else if (currentChar == ':') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn COLON;\n\t\t} else if (currentChar == ',') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn COMMA;\n\t\t} else if (currentChar == '+') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn PLUS_OP;\n\t\t} else if (currentChar == '*') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn MULT_OP;\n\t\t} else if (currentChar == '\/') {\n\t\t\t\/* check if it is a multiline comment *\/\n\t\t\tc = sourceFile.peek();\n\t\t\tif (c == ':') {\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tif (currentChar == ':') {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tif (currentChar == '\/') {\n\t\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} while (!sourceFile.eof());\n\t\t\t} else if (c == '\/') {\n\t\t\t\t\/* single line commment *\/\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t} while (currentChar != '\\n');\n\t\t\t} else {\n\t\t\t\t\/* if it is a division operator *\/\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn DIV_OP;\n\t\t\t}\n\t\t} else if (currentChar == '=') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn EQ_OP1;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn ASSIGN_OP;\n\t\t} else if (currentChar == '!') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '!') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn EQ_OP2;\n\t\t\t} else if (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn NE_OP;\n\t\t\t} else {\n\t\t\t\tLexicalError(currentChar, to_string(c) + \\\n\t\t\t\t\t\t\" The not operator is not\" \\\n\t\t\t\t\t\t\" supported by MnC\");\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t} else if (currentChar == '<') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn LE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn LT_OP;\n\t\t} else if (currentChar == '>') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn GE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn GT_OP;\n\t\t} else if (currentChar == '-') {\n\t\t\t\/* minus operator *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn MINUS_OP;\n\t\t} else {\n\t\t\t\/* Unrecognized character *\/\n\t\t\tLexicalError(currentChar, to_string(c) + \\\n\t\t\t\t\t\" Unrecognized character\");\n\t\t}\n\t} \/* end while *\/\n\n\treturn EOF_SYM;\n}\n<commit_msg>Fix a comment.<commit_after>\/*\t____________________________________________________________________________\n\n\t Scanner Component for the Micro A Compiler\n\n\t mscan.h\n\n\t Version 2007 - 2016\n \n\t James L. Richards\n\t Last Update: August 28, 2007\n\t \t Nelson A Castillo\n\t Last Update: January 31, 2016\n\n\tThe routines in this unit are based on those provided in the book \n\t\"Crafting A Compiler\" by Charles N. Fischer and Richard J. LeBlanc, Jr., \n\tBenjamin Cummings Publishing Co. (1991).\n\n\tSee Section 2.2, pp. 25-29.\n\t____________________________________________________________________________\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nextern ifstream sourceFile;\nextern ofstream outFile, listFile;\n\n#include \"mscan.h\"\n\n\/\/ *******************\n\/\/ ** Constructor **\n\/\/ *******************\n\nScanner::Scanner()\n{\n\ttokenBuffer = \"\";\n\tlineBuffer = \"\";\n\tlineNumber = 0;\n\tcheese_size = 1; \/* Null char *\/\n}\n\n\/\/ ********************************\n\/\/ ** Private Member Functions **\n\/\/ ********************************\n\nvoid Scanner::BufferChar(char c)\n{\n\tif (tokenBuffer.length() < ID_STRING_LEN){\n\t\ttokenBuffer += c;\n\t} else {\n\t\tcout << endl << \" *** Fatal error: token is bigger then \"\n\t\t\t<< \"the TokenBuffer.\" << endl;\n\t\tcout << \" *** Error at line \" << this->lineNumber << endl;\n\t\tcout << \" *** Please consider spliting cheese variables \"\n\t\t\t<< \"or recompiling the MaccNCheese compiler \"\n\t\t\t<< \"with a bigger TokenBuffer.\" << endl;\n\t\texit(1);\n\t}\n}\n\nToken Scanner::CheckReserved()\n{\n\t\/*\n\t * FIXME this converts variables to lowercase too.\n\t * Was it supposed to do so?\n\t *\/\n\t\/* Convert the string to lower case *\/\n\ttransform(tokenBuffer.begin(), tokenBuffer.end(), \\\n\t\t\t\ttokenBuffer.begin(), ::tolower);\n\t\/* Check the converted words *\/\n\tif ((tokenBuffer) == \"bool\") return BOOL_SYM;\n\tif ((tokenBuffer) == \"break\") return BREAK_SYM;\n\tif ((tokenBuffer) == \"case\") return CASE_SYM;\n\tif ((tokenBuffer) == \"cheese\") return CHEESE_SYM;\n\tif ((tokenBuffer) == \"decs\") return DECS_SYM;\n\tif ((tokenBuffer) == \"do\") return DO_SYM;\n\tif ((tokenBuffer) == \"else\") return ELSE_SYM;\n\tif ((tokenBuffer) == \"end\") return END_SYM;\n\tif ((tokenBuffer) == \"false\") return FALSE_SYM;\n\tif ((tokenBuffer) == \"float\") return FLOAT_SYM;\n\tif ((tokenBuffer) == \"for\") return FOR_SYM;\n\tif ((tokenBuffer) == \"hiphip\") return HIPHIP_SYM;\n\tif ((tokenBuffer) == \"if\") return IF_SYM;\n\tif ((tokenBuffer) == \"int\") return INT_SYM;\n\tif ((tokenBuffer) == \"listen\") return LISTEN_SYM;\n\tif ((tokenBuffer) == \"otherwise\") return OTHERWISE_SYM;\n\tif ((tokenBuffer) == \"until\") return UNTIL_SYM;\n\tif ((tokenBuffer) == \"select\") return SELECT_SYM;\n\tif ((tokenBuffer) == \"shout\") return SHOUT_SYM;\n\tif ((tokenBuffer) == \"then\") return THEN_SYM;\n\tif ((tokenBuffer) == \"true\") return TRUE_SYM;\n\tif ((tokenBuffer) == \"while\") return WHILE_SYM;\n\n\treturn ID;\n}\n\nvoid Scanner::ClearBuffer()\n{\n\ttokenBuffer = \"\";\n}\n\nvoid Scanner::LexicalError(char& c)\n{\t\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\n\tc = NextChar();\n}\nvoid Scanner::LexicalError(char& c, const string& errorExp)\n{\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << '\\n'\n\t\t<< errorExp << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << '\\n'\n\t\t<< errorExp << endl;\n\n\tc = NextChar();\n}\n\nchar Scanner::NextChar()\n{\n\tchar c;\n\n\tsourceFile.get(c);\n\tif (c == '\\n')\n\t{\n\t\tlistFile.width(6);\n\t\tlistFile << ++lineNumber << \" \" << lineBuffer << endl;\n\t\tlineBuffer = \"\";\n\t} else{\n\t\tlineBuffer += c;\n\t}\n\treturn c;\n}\n\n\/\/ *******************************\n\/\/ ** Public Member Functions **\n\/\/ *******************************\n\nToken Scanner::GetNextToken()\n{\n\tchar currentChar, c;\n\n\tClearBuffer();\n\tcurrentChar = NextChar();\n\twhile (!sourceFile.eof())\n\t{\n\t\tif (isspace(currentChar)) {\n\t\t\t\/* do nothing *\/\n\t\t\tcurrentChar = NextChar();\n\t\t} else if (isalpha(currentChar)) {\n\t\t\t\/* identifier *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isalnum(c) || c == '_') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\treturn CheckReserved();\n\t\t} else if (isdigit(currentChar)) {\n\t\t\t\/* integer or float literals *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isdigit(c)) {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\t\/* check if it is a float *\/\n\t\t\tif (c == '.') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\/* check for a digit after the '.' *\/\n\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\tLexicalError(currentChar, to_string(c) \\\n\t\t\t\t\t\t+ \" Float needs a digit\" \\\n\t\t\t\t\t\t\" after the '.'\");\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t}\n\t\t\t\t\/* check for power of 10 multipliers *\/\n\t\t\t\tif (c == 'e' || c == 'E') {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (c != '+' && c!= '-') {\n\t\t\t\t\t\tLexicalError(currentChar, \\\n\t\t\t\t\t\t\tto_string(c) + \\\n\t\t\t\t\t\t\t\" Float needs a \"\n\t\t\t\t\t\t\t\"'+'\/'-' after 'E'\");\n\t\t\t\t\t}\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\t\tLexicalError(currentChar, \\\n\t\t\t\t\t\t\tto_string(c) + \\\n\t\t\t\t\t\t\t\" Float needs a \" \\\n\t\t\t\t\t\t\t\"digit after '+'\/'-'\");\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn FLOAT_LIT;\n\t\t\t}\n\t\t\treturn INT_LIT;\n\t\t} else if (currentChar == '\"') {\n\t\t\t\/* string literal *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\tcheese_size = 1; \/* Null Char *\/\n\t\t\t\/* while not end of string *\/\n\t\t\twhile (c != '\"') {\n\t\t\t\t\/* escape sequences *\/\n\t\t\t\tif (c == '\\\\') {\n\t\t\t\t\t\/*\n\t\t\t\t\t * Replace the '\\' for a ':'\n\t\t\t\t\t * which's SAM's escape char\n\t\t\t\t\t *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcurrentChar = ':';\n\t\t\t\t\tif (c == '\\\\') {\n\t\t\t\t\t\t\/* '\\\\' sequence *\/\n\t\t\t\t\t\t\/* Just remove one '\\' *\/\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (c == '\"') {\n\t\t\t\t\t\t\/* '\\\"' sequence *\/\n\t\t\t\t\t\t\/* replace '\\' for ':' *\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (c == 'n') {\n\t\t\t\t\t\t\/* \\n sequence *\/\n\t\t\t\t\t\t\/* replace for ascii '\\n'(012)*\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tcurrentChar = '0';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = '1';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tcurrentChar = '2';\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else if (isdigit(c)) {\n\t\t\t\t\t\t\/* '\\ddd' sequence *\/\n\t\t\t\t\t\t\/* replace '\\' for ':' *\/\n\t\t\t\t\t\tBufferChar(currentChar);\n\n\t\t\t\t\t\tint ind;\n\t\t\t\t\t\tfor (ind = 0; ind < 3; ind++) {\n\t\t\t\t\t\t\t\/* check for 3 digits *\/\n\t\t\t\t\t\t\tif (!isdigit(c))\n\t\t\t\t\t\t\t\tLexicalError(c, to_string(c) + \" received. Expected three digits after \\\\.\");\n\t\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcheese_size += 1;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tLexicalError(currentChar, to_string(currentChar) + \\\n\t\t\t\t\t\t\" was followed by the wrong character -options are \\\\ or \\\".\");\n\t\t\t\t\t}\n\t\t\t\t} else if (c == ':') {\n\t\t\t\t\t\/*\n\t\t\t\t\t * ':' is the escape char used\n\t\t\t\t\t * by the SAM assembler. So it\n\t\t\t\t\t * needs to be escaped.\n\t\t\t\t\t *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcheese_size += 1;\n\t\t\t\t} else {\n\t\t\t\t\t\/* regular characters *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tcheese_size += 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/* buffer the final '\"' *\/\n\t\t\tcurrentChar = NextChar();\n\t\t\tBufferChar(currentChar);\n\t\t\treturn CHEESE_LIT;\n\t\t} else if (currentChar == '(') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LBANANA;\n\t\t} else if (currentChar == ')') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RBANANA;\n\t\t} else if (currentChar == '[') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LSTAPLE;\n\t\t} else if (currentChar == ']') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RSTAPLE;\n\t\t} else if (currentChar == '{') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn LMUSTACHE;\n\t\t} else if (currentChar == '}') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn RMUSTACHE;\n\t\t} else if (currentChar == ';') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn SEMICOLON;\n\t\t} else if (currentChar == ':') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn COLON;\n\t\t} else if (currentChar == ',') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn COMMA;\n\t\t} else if (currentChar == '+') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn PLUS_OP;\n\t\t} else if (currentChar == '*') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn MULT_OP;\n\t\t} else if (currentChar == '\/') {\n\t\t\t\/* check if it is a multiline comment *\/\n\t\t\tc = sourceFile.peek();\n\t\t\tif (c == ':') {\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tif (currentChar == ':') {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tif (currentChar == '\/') {\n\t\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} while (!sourceFile.eof());\n\t\t\t} else if (c == '\/') {\n\t\t\t\t\/* single line commment *\/\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t} while (currentChar != '\\n');\n\t\t\t} else {\n\t\t\t\t\/* if it is a division operator *\/\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn DIV_OP;\n\t\t\t}\n\t\t} else if (currentChar == '=') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn EQ_OP1;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn ASSIGN_OP;\n\t\t} else if (currentChar == '!') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '!') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn EQ_OP2;\n\t\t\t} else if (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn NE_OP;\n\t\t\t} else {\n\t\t\t\tLexicalError(currentChar, to_string(c) + \\\n\t\t\t\t\t\t\" The not operator is not\" \\\n\t\t\t\t\t\t\" supported by MnC\");\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t} else if (currentChar == '<') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn LE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn LT_OP;\n\t\t} else if (currentChar == '>') {\n\t\t\tBufferChar(currentChar);\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn GE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn GT_OP;\n\t\t} else if (currentChar == '-') {\n\t\t\t\/* minus operator *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn MINUS_OP;\n\t\t} else {\n\t\t\t\/* Unrecognized character *\/\n\t\t\tLexicalError(currentChar, to_string(c) + \\\n\t\t\t\t\t\" Unrecognized character\");\n\t\t}\n\t} \/* end while *\/\n\n\treturn EOF_SYM;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <limits>\n\n#include \"base\/all.h\"\n\nusing namespace base;\nusing namespace std;\n\nstatic void print_binary(const void* vbuf, int len) {\n char* buf = (char *) vbuf;\n for (int i = 0; i < len; i++) {\n for (int j = 0; j < 8; j++) {\n uint8_t u = buf[i];\n printf(\"%d\", (u >> (7 - j)) & 0x1);\n }\n printf(\" \");\n }\n printf(\"\\n\");\n}\n\nTEST(sparseint, dump_load_i32) {\n char buf[9];\n const i32 values[] = {0, 1, -1, -64, 63, 64, -65, -8192, 8191, -8193, 8192, -1048576, 1048575,\n 1048576, -1048577, -134217728, 134217727,\n 134217728, -134217729,\n numeric_limits<i32>::max(), numeric_limits<i32>::min()};\n const i32 bs[] = {1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3,\n 4, 4, 4, 4,\n 5, 5, 5, 5};\n for (int i = 0; i < arraysize(values); i++) {\n const i32 v = values[i];\n memset(buf, 0, 9);\n int bsize = SparseInt::dump(v, buf);\n \/\/print_binary(buf, bsize);\n \/\/print_binary(&v, 4);\n const i32 u = SparseInt::load_i32(buf);\n Log::debug(\"%ld -> bsize=%ld -> %ld\", (long) v, bsize, (long) u);\n \/\/EXPECT_EQ(v, u);\n EXPECT_EQ(bsize, bs[i]);\n }\n}\n<commit_msg>add back EXPECT macros<commit_after>#include <stdio.h>\n#include <limits>\n\n#include \"base\/all.h\"\n\nusing namespace base;\nusing namespace std;\n\nstatic void print_binary(const void* vbuf, int len) {\n char* buf = (char *) vbuf;\n for (int i = 0; i < len; i++) {\n for (int j = 0; j < 8; j++) {\n uint8_t u = buf[i];\n printf(\"%d\", (u >> (7 - j)) & 0x1);\n }\n printf(\" \");\n }\n printf(\"\\n\");\n}\n\nTEST(sparseint, dump_load_i32) {\n char buf[9];\n const i32 values[] = {0, 1, -1, -64, 63, 64, -65, -8192, 8191, -8193, 8192, -1048576, 1048575,\n 1048576, -1048577, -134217728, 134217727,\n 134217728, -134217729,\n numeric_limits<i32>::max(), numeric_limits<i32>::min()};\n const i32 bs[] = {1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3,\n 4, 4, 4, 4,\n 5, 5, 5, 5};\n for (int i = 0; i < arraysize(values); i++) {\n const i32 v = values[i];\n memset(buf, 0, 9);\n int bsize = SparseInt::dump(v, buf);\n print_binary(buf, bsize);\n print_binary(&v, 4);\n const i32 u = SparseInt::load_i32(buf);\n Log::debug(\"%ld -> bsize=%ld -> %ld\", (long) v, bsize, (long) u);\n EXPECT_EQ(v, u);\n EXPECT_EQ(bsize, bs[i]);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"kitmanager.h\"\n\n#include \"kit.h\"\n#include \"kitconfigwidget.h\"\n#include \"kitinformation.h\"\n#include \"kitmanagerconfigwidget.h\"\n#include \"project.h\"\n#include \"projectexplorer.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <extensionsystem\/pluginmanager.h>\n\n#include <utils\/persistentsettings.h>\n#include <utils\/environment.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QSettings>\n\n#include <QFormLayout>\n#include <QLabel>\n\nstatic const char KIT_DATA_KEY[] = \"Profile.\";\nstatic const char KIT_COUNT_KEY[] = \"Profile.Count\";\nstatic const char KIT_FILE_VERSION_KEY[] = \"Version\";\nstatic const char KIT_DEFAULT_KEY[] = \"Profile.Default\";\nstatic const char KIT_FILENAME[] = \"\/qtcreator\/profiles.xml\";\n\nusing Utils::PersistentSettingsWriter;\nusing Utils::PersistentSettingsReader;\n\nstatic Utils::FileName settingsFileName()\n{\n QFileInfo settingsLocation(ExtensionSystem::PluginManager::settings()->fileName());\n return Utils::FileName::fromString(settingsLocation.absolutePath() + QLatin1String(KIT_FILENAME));\n}\n\nnamespace ProjectExplorer {\n\nKitManager *KitManager::m_instance = 0;\n\nnamespace Internal {\n\n\/\/ --------------------------------------------------------------------------\n\/\/ KitManagerPrivate:\n\/\/ --------------------------------------------------------------------------\n\nclass KitManagerPrivate\n{\npublic:\n KitManagerPrivate();\n ~KitManagerPrivate();\n\n Kit *m_defaultKit;\n bool m_initialized;\n QList<KitInformation *> m_informationList;\n QList<Kit *> m_kitList;\n Utils::PersistentSettingsWriter *m_writer;\n};\n\nKitManagerPrivate::KitManagerPrivate()\n : m_defaultKit(0), m_initialized(false), m_writer(0)\n{ }\n\nKitManagerPrivate::~KitManagerPrivate()\n{\n qDeleteAll(m_informationList);\n delete m_writer;\n}\n\n} \/\/ namespace Internal\n\n\/\/ --------------------------------------------------------------------------\n\/\/ KitManager:\n\/\/ --------------------------------------------------------------------------\n\nKitManager *KitManager::instance()\n{\n return m_instance;\n}\n\nKitManager::KitManager(QObject *parent) :\n QObject(parent),\n d(new Internal::KitManagerPrivate())\n{\n QTC_CHECK(!m_instance);\n m_instance = this;\n\n connect(Core::ICore::instance(), SIGNAL(saveSettingsRequested()),\n this, SLOT(saveKits()));\n\n connect(this, SIGNAL(kitAdded(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n connect(this, SIGNAL(kitRemoved(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n connect(this, SIGNAL(kitUpdated(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n}\n\nvoid KitManager::restoreKits()\n{\n QTC_ASSERT(!d->m_initialized, return);\n static bool initializing = false;\n\n if (initializing) \/\/ kits will call kits() to check their display names, which will trigger another\n \/\/ call to restoreKits, which ...\n return;\n\n initializing = true;\n\n QList<Kit *> kitsToRegister;\n QList<Kit *> kitsToValidate;\n QList<Kit *> kitsToCheck;\n\n \/\/ read all kits from SDK\n QFileInfo systemSettingsFile(Core::ICore::settings(QSettings::SystemScope)->fileName());\n QFileInfo kitFile(systemSettingsFile.absolutePath() + QLatin1String(KIT_FILENAME));\n if (kitFile.exists()) {\n KitList system = restoreKits(Utils::FileName(kitFile));\n \/\/ make sure we mark these as autodetected and run additional setup logic\n foreach (Kit *k, system.kits) {\n k->setAutoDetected(true);\n k->setSdkProvided(true);\n k->setup();\n }\n\n \/\/ SDK kits are always considered to be up for validation since they might have been\n \/\/ extended with additional information by creator in the meantime:\n kitsToValidate = system.kits;\n }\n\n \/\/ read all kits from user file\n KitList userKits = restoreKits(settingsFileName());\n foreach (Kit *k, userKits.kits) {\n if (k->isSdkProvided())\n kitsToCheck.append(k);\n else\n kitsToRegister.append(k);\n }\n\n Kit *toStore = 0;\n foreach (Kit *current, kitsToValidate) {\n toStore = current;\n\n \/\/ Check whether we had this kit stored and prefer the stored one:\n for (int i = 0; i < kitsToCheck.count(); ++i) {\n if (kitsToCheck.at(i)->id() == current->id()) {\n toStore = kitsToCheck.at(i);\n kitsToCheck.removeAt(i);\n\n \/\/ Overwrite settings that the SDK sets to those values:\n foreach (const KitInformation *ki, kitInformation()) {\n if (current->hasValue(ki->dataId()))\n toStore->setValue(ki->dataId(), current->value(ki->dataId()));\n }\n\n delete current;\n break;\n }\n }\n addKit(toStore);\n }\n\n \/\/ Delete all loaded autodetected kits that were not rediscovered:\n foreach (Kit *k, kitsToCheck)\n delete k;\n kitsToCheck.clear();\n\n \/\/ Store manual kits\n foreach (Kit *k, kitsToRegister)\n addKit(k);\n\n if (kits().isEmpty()) {\n Kit *defaultKit = new Kit; \/\/ One kit using default values\n defaultKit->setDisplayName(tr(\"Desktop\"));\n defaultKit->setSdkProvided(false);\n defaultKit->setAutoDetected(false);\n defaultKit->setIconPath(QLatin1String(\":\/\/\/DESKTOP\/\/\/\"));\n\n defaultKit->setup();\n\n addKit(defaultKit);\n }\n\n Kit *k = find(userKits.defaultKit);\n if (k)\n setDefaultKit(k);\n\n d->m_writer = new Utils::PersistentSettingsWriter(settingsFileName(), QLatin1String(\"QtCreatorProfiles\"));\n d->m_initialized = true;\n emit kitsLoaded();\n emit kitsChanged();\n}\n\nKitManager::~KitManager()\n{\n saveKits(); \/\/ Make sure we save the current state on exit!\n\n foreach (Kit *k, d->m_kitList)\n delete k;\n d->m_kitList.clear();\n delete d;\n m_instance = 0;\n}\n\nvoid KitManager::saveKits()\n{\n if (!d->m_writer) \/\/ ignore save requests while we are not initialized.\n return;\n\n QVariantMap data;\n data.insert(QLatin1String(KIT_FILE_VERSION_KEY), 1);\n\n int count = 0;\n foreach (Kit *k, kits()) {\n QVariantMap tmp = k->toMap();\n if (tmp.isEmpty())\n continue;\n data.insert(QString::fromLatin1(KIT_DATA_KEY) + QString::number(count), tmp);\n ++count;\n }\n data.insert(QLatin1String(KIT_COUNT_KEY), count);\n data.insert(QLatin1String(KIT_DEFAULT_KEY),\n d->m_defaultKit ? QString::fromLatin1(d->m_defaultKit->id().name()) : QString());\n d->m_writer->save(data, Core::ICore::mainWindow());\n}\n\nbool greaterPriority(KitInformation *a, KitInformation *b)\n{\n return a->priority() > b->priority();\n}\n\nvoid KitManager::registerKitInformation(KitInformation *ki)\n{\n QTC_CHECK(!isLoaded());\n\n QList<KitInformation *>::iterator it\n = qLowerBound(d->m_informationList.begin(), d->m_informationList.end(), ki, greaterPriority);\n d->m_informationList.insert(it, ki);\n\n if (!d->m_initialized)\n return;\n\n foreach (Kit *k, kits()) {\n if (!k->hasValue(ki->dataId()))\n k->setValue(ki->dataId(), ki->defaultValue(k));\n else\n ki->fix(k);\n }\n\n return;\n}\n\nvoid KitManager::deregisterKitInformation(KitInformation *ki)\n{\n QTC_CHECK(d->m_informationList.contains(ki));\n d->m_informationList.removeAll(ki);\n delete ki;\n}\n\nKitManager::KitList KitManager::restoreKits(const Utils::FileName &fileName)\n{\n KitList result;\n\n PersistentSettingsReader reader;\n if (!reader.load(fileName)) {\n qWarning(\"Warning: Failed to read \\\"%s\\\", cannot restore kits!\", qPrintable(fileName.toUserOutput()));\n return result;\n }\n QVariantMap data = reader.restoreValues();\n\n \/\/ Check version:\n int version = data.value(QLatin1String(KIT_FILE_VERSION_KEY), 0).toInt();\n if (version < 1) {\n qWarning(\"Warning: Kit file version %d not supported, cannot restore kits!\", version);\n return result;\n }\n\n const int count = data.value(QLatin1String(KIT_COUNT_KEY), 0).toInt();\n for (int i = 0; i < count; ++i) {\n const QString key = QString::fromLatin1(KIT_DATA_KEY) + QString::number(i);\n if (!data.contains(key))\n break;\n\n const QVariantMap stMap = data.value(key).toMap();\n\n Kit *k = new Kit;\n if (k->fromMap(stMap)) {\n result.kits.append(k);\n } else {\n delete k;\n qWarning(\"Warning: Unable to restore kits stored in %s at position %d.\",\n qPrintable(fileName.toUserOutput()), i);\n }\n }\n const QString defaultId = data.value(QLatin1String(KIT_DEFAULT_KEY)).toString();\n if (defaultId.isEmpty())\n return result;\n\n const Core::Id id = Core::Id(defaultId);\n foreach (Kit *k, result.kits) {\n if (k->id() == id) {\n result.defaultKit = id;\n break;\n }\n }\n return result;\n}\n\nQList<Kit *> KitManager::kits(const KitMatcher *m) const\n{\n QList<Kit *> result;\n foreach (Kit *k, d->m_kitList) {\n if (!m || m->matches(k))\n result.append(k);\n }\n return result;\n}\n\nKit *KitManager::find(const Core::Id &id) const\n{\n if (!id.isValid())\n return 0;\n\n foreach (Kit *k, kits()) {\n if (k->id() == id)\n return k;\n }\n return 0;\n}\n\nKit *KitManager::find(const KitMatcher *m) const\n{\n QList<Kit *> matched = kits(m);\n return matched.isEmpty() ? 0 : matched.first();\n}\n\nKit *KitManager::defaultKit() const\n{\n return d->m_defaultKit;\n}\n\nQList<KitInformation *> KitManager::kitInformation() const\n{\n return d->m_informationList;\n}\n\nInternal::KitManagerConfigWidget *KitManager::createConfigWidget(Kit *k) const\n{\n Internal::KitManagerConfigWidget *result = new Internal::KitManagerConfigWidget(k);\n foreach (KitInformation *ki, d->m_informationList)\n result->addConfigWidget(ki->createConfigWidget(result->workingCopy()));\n\n result->updateVisibility();\n\n return result;\n}\n\nvoid KitManager::deleteKit(Kit *k)\n{\n QTC_ASSERT(!KitManager::instance()->kits().contains(k), return);\n delete k;\n}\n\nbool KitManager::isLoaded() const\n{\n return d->m_initialized;\n}\n\nvoid KitManager::notifyAboutUpdate(ProjectExplorer::Kit *k)\n{\n if (!k)\n return;\n if (kits().contains(k) && d->m_initialized)\n emit kitUpdated(k);\n else\n emit unmanagedKitUpdated(k);\n}\n\nbool KitManager::registerKit(ProjectExplorer::Kit *k)\n{\n QTC_ASSERT(isLoaded(), return false);\n if (!k)\n return true;\n foreach (Kit *current, kits()) {\n if (k == current)\n return false;\n }\n\n \/\/ make sure we have all the information in our kits:\n addKit(k);\n if (d->m_initialized)\n emit kitAdded(k);\n return true;\n}\n\nvoid KitManager::deregisterKit(Kit *k)\n{\n if (!k || !kits().contains(k))\n return;\n d->m_kitList.removeOne(k);\n if (d->m_defaultKit == k) {\n QList<Kit *> stList = kits();\n Kit *newDefault = 0;\n foreach (Kit *cur, stList) {\n if (cur->isValid()) {\n newDefault = cur;\n break;\n }\n }\n setDefaultKit(newDefault);\n }\n if (d->m_initialized)\n emit kitRemoved(k);\n delete k;\n}\n\nvoid KitManager::setDefaultKit(Kit *k)\n{\n if (d->m_defaultKit == k)\n return;\n if (k && !kits().contains(k))\n return;\n d->m_defaultKit = k;\n if (d->m_initialized)\n emit defaultkitChanged();\n}\n\nvoid KitManager::addKit(Kit *k)\n{\n if (!k)\n return;\n\n {\n KitGuard g(k);\n foreach (KitInformation *ki, d->m_informationList) {\n if (!k->hasValue(ki->dataId()))\n k->setValue(ki->dataId(), ki->defaultValue(k));\n else\n ki->fix(k);\n }\n }\n\n d->m_kitList.append(k);\n if (!d->m_defaultKit ||\n (!d->m_defaultKit->isValid() && k->isValid()))\n setDefaultKit(k);\n}\n\n\nvoid KitInformation::addToEnvironment(const Kit *k, Utils::Environment &env) const\n{\n Q_UNUSED(k);\n Q_UNUSED(env);\n}\n\nIOutputParser *KitInformation::createOutputParser(const Kit *k) const\n{\n Q_UNUSED(k);\n return 0;\n}\n\nQString KitInformation::displayNamePostfix(const Kit *k) const\n{\n Q_UNUSED(k);\n return QString();\n}\n\nvoid KitInformation::notifyAboutUpdate(Kit *k)\n{\n KitManager::instance()->notifyAboutUpdate(k);\n}\n\n} \/\/ namespace ProjectExplorer\n<commit_msg>Kits: Sort kits by displayname<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"kitmanager.h\"\n\n#include \"kit.h\"\n#include \"kitconfigwidget.h\"\n#include \"kitinformation.h\"\n#include \"kitmanagerconfigwidget.h\"\n#include \"project.h\"\n#include \"projectexplorer.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <extensionsystem\/pluginmanager.h>\n\n#include <utils\/persistentsettings.h>\n#include <utils\/environment.h>\n#include <utils\/qtcassert.h>\n\n#include <QCoreApplication>\n#include <QDir>\n#include <QSettings>\n\n#include <QFormLayout>\n#include <QLabel>\n\nstatic const char KIT_DATA_KEY[] = \"Profile.\";\nstatic const char KIT_COUNT_KEY[] = \"Profile.Count\";\nstatic const char KIT_FILE_VERSION_KEY[] = \"Version\";\nstatic const char KIT_DEFAULT_KEY[] = \"Profile.Default\";\nstatic const char KIT_FILENAME[] = \"\/qtcreator\/profiles.xml\";\n\nusing Utils::PersistentSettingsWriter;\nusing Utils::PersistentSettingsReader;\n\nstatic Utils::FileName settingsFileName()\n{\n QFileInfo settingsLocation(ExtensionSystem::PluginManager::settings()->fileName());\n return Utils::FileName::fromString(settingsLocation.absolutePath() + QLatin1String(KIT_FILENAME));\n}\n\nnamespace ProjectExplorer {\n\nKitManager *KitManager::m_instance = 0;\n\nnamespace Internal {\n\n\/\/ --------------------------------------------------------------------------\n\/\/ KitManagerPrivate:\n\/\/ --------------------------------------------------------------------------\n\nclass KitManagerPrivate\n{\npublic:\n KitManagerPrivate();\n ~KitManagerPrivate();\n\n void insertKit(Kit *k)\n {\n \/\/ Keep list of kits sorted by displayname:\n int i =0;\n for (; i < m_kitList.count(); ++i)\n if (m_kitList.at(i)->displayName() > k->displayName())\n break;\n m_kitList.insert(i, k);\n }\n\n void moveKit(int pos)\n {\n if (pos < 0 || pos >= m_kitList.count())\n return;\n\n Kit *current = m_kitList.at(pos);\n int prev = pos - 1;\n int next = pos + 1;\n\n if (prev >= 0\n && m_kitList.at(prev)->displayName() > current->displayName()) {\n std::swap(m_kitList[prev], m_kitList[pos]);\n moveKit(prev);\n } else if (next < m_kitList.count()\n && m_kitList.at(next)->displayName() < current->displayName()) {\n std::swap(m_kitList[pos], m_kitList[next]);\n moveKit(next);\n }\n }\n\n Kit *m_defaultKit;\n bool m_initialized;\n QList<KitInformation *> m_informationList;\n QList<Kit *> m_kitList;\n Utils::PersistentSettingsWriter *m_writer;\n};\n\nKitManagerPrivate::KitManagerPrivate()\n : m_defaultKit(0), m_initialized(false), m_writer(0)\n{ }\n\nKitManagerPrivate::~KitManagerPrivate()\n{\n qDeleteAll(m_informationList);\n delete m_writer;\n}\n\n} \/\/ namespace Internal\n\n\/\/ --------------------------------------------------------------------------\n\/\/ KitManager:\n\/\/ --------------------------------------------------------------------------\n\nKitManager *KitManager::instance()\n{\n return m_instance;\n}\n\nKitManager::KitManager(QObject *parent) :\n QObject(parent),\n d(new Internal::KitManagerPrivate())\n{\n QTC_CHECK(!m_instance);\n m_instance = this;\n\n connect(Core::ICore::instance(), SIGNAL(saveSettingsRequested()),\n this, SLOT(saveKits()));\n\n connect(this, SIGNAL(kitAdded(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n connect(this, SIGNAL(kitRemoved(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n connect(this, SIGNAL(kitUpdated(ProjectExplorer::Kit*)),\n this, SIGNAL(kitsChanged()));\n}\n\nvoid KitManager::restoreKits()\n{\n QTC_ASSERT(!d->m_initialized, return);\n static bool initializing = false;\n\n if (initializing) \/\/ kits will call kits() to check their display names, which will trigger another\n \/\/ call to restoreKits, which ...\n return;\n\n initializing = true;\n\n QList<Kit *> kitsToRegister;\n QList<Kit *> kitsToValidate;\n QList<Kit *> kitsToCheck;\n\n \/\/ read all kits from SDK\n QFileInfo systemSettingsFile(Core::ICore::settings(QSettings::SystemScope)->fileName());\n QFileInfo kitFile(systemSettingsFile.absolutePath() + QLatin1String(KIT_FILENAME));\n if (kitFile.exists()) {\n KitList system = restoreKits(Utils::FileName(kitFile));\n \/\/ make sure we mark these as autodetected and run additional setup logic\n foreach (Kit *k, system.kits) {\n k->setAutoDetected(true);\n k->setSdkProvided(true);\n k->setup();\n }\n\n \/\/ SDK kits are always considered to be up for validation since they might have been\n \/\/ extended with additional information by creator in the meantime:\n kitsToValidate = system.kits;\n }\n\n \/\/ read all kits from user file\n KitList userKits = restoreKits(settingsFileName());\n foreach (Kit *k, userKits.kits) {\n if (k->isSdkProvided())\n kitsToCheck.append(k);\n else\n kitsToRegister.append(k);\n }\n\n Kit *toStore = 0;\n foreach (Kit *current, kitsToValidate) {\n toStore = current;\n\n \/\/ Check whether we had this kit stored and prefer the stored one:\n for (int i = 0; i < kitsToCheck.count(); ++i) {\n if (kitsToCheck.at(i)->id() == current->id()) {\n toStore = kitsToCheck.at(i);\n kitsToCheck.removeAt(i);\n\n \/\/ Overwrite settings that the SDK sets to those values:\n foreach (const KitInformation *ki, kitInformation()) {\n if (current->hasValue(ki->dataId()))\n toStore->setValue(ki->dataId(), current->value(ki->dataId()));\n }\n\n delete current;\n break;\n }\n }\n addKit(toStore);\n }\n\n \/\/ Delete all loaded autodetected kits that were not rediscovered:\n foreach (Kit *k, kitsToCheck)\n delete k;\n kitsToCheck.clear();\n\n \/\/ Store manual kits\n foreach (Kit *k, kitsToRegister)\n addKit(k);\n\n if (kits().isEmpty()) {\n Kit *defaultKit = new Kit; \/\/ One kit using default values\n defaultKit->setDisplayName(tr(\"Desktop\"));\n defaultKit->setSdkProvided(false);\n defaultKit->setAutoDetected(false);\n defaultKit->setIconPath(QLatin1String(\":\/\/\/DESKTOP\/\/\/\"));\n\n defaultKit->setup();\n\n addKit(defaultKit);\n }\n\n Kit *k = find(userKits.defaultKit);\n if (k)\n setDefaultKit(k);\n\n d->m_writer = new Utils::PersistentSettingsWriter(settingsFileName(), QLatin1String(\"QtCreatorProfiles\"));\n d->m_initialized = true;\n emit kitsLoaded();\n emit kitsChanged();\n}\n\nKitManager::~KitManager()\n{\n saveKits(); \/\/ Make sure we save the current state on exit!\n\n foreach (Kit *k, d->m_kitList)\n delete k;\n d->m_kitList.clear();\n delete d;\n m_instance = 0;\n}\n\nvoid KitManager::saveKits()\n{\n if (!d->m_writer) \/\/ ignore save requests while we are not initialized.\n return;\n\n QVariantMap data;\n data.insert(QLatin1String(KIT_FILE_VERSION_KEY), 1);\n\n int count = 0;\n foreach (Kit *k, kits()) {\n QVariantMap tmp = k->toMap();\n if (tmp.isEmpty())\n continue;\n data.insert(QString::fromLatin1(KIT_DATA_KEY) + QString::number(count), tmp);\n ++count;\n }\n data.insert(QLatin1String(KIT_COUNT_KEY), count);\n data.insert(QLatin1String(KIT_DEFAULT_KEY),\n d->m_defaultKit ? QString::fromLatin1(d->m_defaultKit->id().name()) : QString());\n d->m_writer->save(data, Core::ICore::mainWindow());\n}\n\nbool greaterPriority(KitInformation *a, KitInformation *b)\n{\n return a->priority() > b->priority();\n}\n\nvoid KitManager::registerKitInformation(KitInformation *ki)\n{\n QTC_CHECK(!isLoaded());\n\n QList<KitInformation *>::iterator it\n = qLowerBound(d->m_informationList.begin(), d->m_informationList.end(), ki, greaterPriority);\n d->m_informationList.insert(it, ki);\n\n if (!d->m_initialized)\n return;\n\n foreach (Kit *k, kits()) {\n if (!k->hasValue(ki->dataId()))\n k->setValue(ki->dataId(), ki->defaultValue(k));\n else\n ki->fix(k);\n }\n\n return;\n}\n\nvoid KitManager::deregisterKitInformation(KitInformation *ki)\n{\n QTC_CHECK(d->m_informationList.contains(ki));\n d->m_informationList.removeAll(ki);\n delete ki;\n}\n\nKitManager::KitList KitManager::restoreKits(const Utils::FileName &fileName)\n{\n KitList result;\n\n PersistentSettingsReader reader;\n if (!reader.load(fileName)) {\n qWarning(\"Warning: Failed to read \\\"%s\\\", cannot restore kits!\", qPrintable(fileName.toUserOutput()));\n return result;\n }\n QVariantMap data = reader.restoreValues();\n\n \/\/ Check version:\n int version = data.value(QLatin1String(KIT_FILE_VERSION_KEY), 0).toInt();\n if (version < 1) {\n qWarning(\"Warning: Kit file version %d not supported, cannot restore kits!\", version);\n return result;\n }\n\n const int count = data.value(QLatin1String(KIT_COUNT_KEY), 0).toInt();\n for (int i = 0; i < count; ++i) {\n const QString key = QString::fromLatin1(KIT_DATA_KEY) + QString::number(i);\n if (!data.contains(key))\n break;\n\n const QVariantMap stMap = data.value(key).toMap();\n\n Kit *k = new Kit;\n if (k->fromMap(stMap)) {\n result.kits.append(k);\n } else {\n delete k;\n qWarning(\"Warning: Unable to restore kits stored in %s at position %d.\",\n qPrintable(fileName.toUserOutput()), i);\n }\n }\n const QString defaultId = data.value(QLatin1String(KIT_DEFAULT_KEY)).toString();\n if (defaultId.isEmpty())\n return result;\n\n const Core::Id id = Core::Id(defaultId);\n foreach (Kit *k, result.kits) {\n if (k->id() == id) {\n result.defaultKit = id;\n break;\n }\n }\n return result;\n}\n\nQList<Kit *> KitManager::kits(const KitMatcher *m) const\n{\n QList<Kit *> result;\n foreach (Kit *k, d->m_kitList) {\n if (!m || m->matches(k))\n result.append(k);\n }\n return result;\n}\n\nKit *KitManager::find(const Core::Id &id) const\n{\n if (!id.isValid())\n return 0;\n\n foreach (Kit *k, kits()) {\n if (k->id() == id)\n return k;\n }\n return 0;\n}\n\nKit *KitManager::find(const KitMatcher *m) const\n{\n QList<Kit *> matched = kits(m);\n return matched.isEmpty() ? 0 : matched.first();\n}\n\nKit *KitManager::defaultKit() const\n{\n return d->m_defaultKit;\n}\n\nQList<KitInformation *> KitManager::kitInformation() const\n{\n return d->m_informationList;\n}\n\nInternal::KitManagerConfigWidget *KitManager::createConfigWidget(Kit *k) const\n{\n Internal::KitManagerConfigWidget *result = new Internal::KitManagerConfigWidget(k);\n foreach (KitInformation *ki, d->m_informationList)\n result->addConfigWidget(ki->createConfigWidget(result->workingCopy()));\n\n result->updateVisibility();\n\n return result;\n}\n\nvoid KitManager::deleteKit(Kit *k)\n{\n QTC_ASSERT(!KitManager::instance()->kits().contains(k), return);\n delete k;\n}\n\nbool KitManager::isLoaded() const\n{\n return d->m_initialized;\n}\n\nvoid KitManager::notifyAboutUpdate(ProjectExplorer::Kit *k)\n{\n if (!k)\n return;\n int pos = d->m_kitList.indexOf(k);\n if (pos >= 0 && d->m_initialized) {\n d->moveKit(pos);\n emit kitUpdated(k);\n } else {\n emit unmanagedKitUpdated(k);\n }\n}\n\nbool KitManager::registerKit(ProjectExplorer::Kit *k)\n{\n QTC_ASSERT(isLoaded(), return false);\n if (!k)\n return true;\n foreach (Kit *current, kits()) {\n if (k == current)\n return false;\n }\n\n \/\/ make sure we have all the information in our kits:\n addKit(k);\n if (d->m_initialized)\n emit kitAdded(k);\n return true;\n}\n\nvoid KitManager::deregisterKit(Kit *k)\n{\n if (!k || !kits().contains(k))\n return;\n d->m_kitList.removeOne(k);\n if (d->m_defaultKit == k) {\n QList<Kit *> stList = kits();\n Kit *newDefault = 0;\n foreach (Kit *cur, stList) {\n if (cur->isValid()) {\n newDefault = cur;\n break;\n }\n }\n setDefaultKit(newDefault);\n }\n if (d->m_initialized)\n emit kitRemoved(k);\n delete k;\n}\n\nvoid KitManager::setDefaultKit(Kit *k)\n{\n if (d->m_defaultKit == k)\n return;\n if (k && !kits().contains(k))\n return;\n d->m_defaultKit = k;\n if (d->m_initialized)\n emit defaultkitChanged();\n}\n\nvoid KitManager::addKit(Kit *k)\n{\n if (!k)\n return;\n\n {\n KitGuard g(k);\n foreach (KitInformation *ki, d->m_informationList) {\n if (!k->hasValue(ki->dataId()))\n k->setValue(ki->dataId(), ki->defaultValue(k));\n else\n ki->fix(k);\n }\n }\n\n d->insertKit(k);\n\n if (!d->m_defaultKit ||\n (!d->m_defaultKit->isValid() && k->isValid()))\n setDefaultKit(k);\n}\n\n\nvoid KitInformation::addToEnvironment(const Kit *k, Utils::Environment &env) const\n{\n Q_UNUSED(k);\n Q_UNUSED(env);\n}\n\nIOutputParser *KitInformation::createOutputParser(const Kit *k) const\n{\n Q_UNUSED(k);\n return 0;\n}\n\nQString KitInformation::displayNamePostfix(const Kit *k) const\n{\n Q_UNUSED(k);\n return QString();\n}\n\nvoid KitInformation::notifyAboutUpdate(Kit *k)\n{\n KitManager::instance()->notifyAboutUpdate(k);\n}\n\n} \/\/ namespace ProjectExplorer\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * Copyright 2020 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include \"modules\/drivers\/lidar\/lidar_driver_component.h\"\n\n#include \"modules\/drivers\/lidar\/proto\/lidar_parameter.pb.h\"\n\nnamespace apollo {\nnamespace drivers {\nnamespace lidar {\n\nLidarDriverComponent::LidarDriverComponent() {}\nbool LidarDriverComponent::Init() {\n if (!GetProtoConfig(&conf_)) {\n AERROR << \"load config error, file:\" << config_file_path_;\n return false;\n }\n node_ = apollo::cyber::CreateNode(\"drivers_lidar\");\n AINFO << \"conf:\" << conf_.DebugString();\n LidarDriverFactory::Instance()->RegisterLidarClients();\n driver_ = LidarDriverFactory::Instance()->CreateLidarDriver(node_, conf_);\n if (!driver_->Init()) {\n AERROR << \"driver init error\";\n return false;\n }\n return true;\n}\n\n} \/\/ namespace lidar\n} \/\/ namespace drivers\n} \/\/ namespace apollo\n<commit_msg>Drivers:fix a potential null pointer problem<commit_after>\/******************************************************************************\n * Copyright 2020 The Apollo Authors. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *****************************************************************************\/\n#include \"modules\/drivers\/lidar\/lidar_driver_component.h\"\n\n#include \"modules\/drivers\/lidar\/proto\/lidar_parameter.pb.h\"\n\nnamespace apollo {\nnamespace drivers {\nnamespace lidar {\n\nLidarDriverComponent::LidarDriverComponent() {}\nbool LidarDriverComponent::Init() {\n if (!GetProtoConfig(&conf_)) {\n AERROR << \"load config error, file:\" << config_file_path_;\n return false;\n }\n node_ = apollo::cyber::CreateNode(\"drivers_lidar\");\n AINFO << \"conf:\" << conf_.DebugString();\n LidarDriverFactory::Instance()->RegisterLidarClients();\n driver_ = LidarDriverFactory::Instance()->CreateLidarDriver(node_, conf_);\n if (driver_ == nullptr || !driver_->Init()) {\n AERROR << \"driver init error\";\n return false;\n }\n return true;\n}\n\n} \/\/ namespace lidar\n} \/\/ namespace drivers\n} \/\/ namespace apollo\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2019 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/profiling\/memory\/shared_ring_buffer.h\"\n\n#include <atomic>\n#include <type_traits>\n\n#include <errno.h>\n#include <inttypes.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"perfetto\/base\/build_config.h\"\n#include \"perfetto\/ext\/base\/scoped_file.h\"\n#include \"perfetto\/ext\/base\/temp_file.h\"\n#include \"src\/profiling\/memory\/scoped_spinlock.h\"\n\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n#include <linux\/memfd.h>\n#include <sys\/syscall.h>\n#endif\n\nnamespace perfetto {\nnamespace profiling {\n\nnamespace {\n\nconstexpr auto kMetaPageSize = base::kPageSize;\nconstexpr auto kAlignment = 8; \/\/ 64 bits to use aligned memcpy().\nconstexpr auto kHeaderSize = kAlignment;\nconstexpr auto kGuardSize = base::kPageSize * 1024 * 16; \/\/ 64 MB.\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\nconstexpr auto kFDSeals = F_SEAL_SHRINK | F_SEAL_GROW | F_SEAL_SEAL;\n#endif\n\n} \/\/ namespace\n\n\nSharedRingBuffer::SharedRingBuffer(CreateFlag, size_t size) {\n size_t size_with_meta = size + kMetaPageSize;\n base::ScopedFile fd;\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n bool is_memfd = false;\n fd.reset(static_cast<int>(syscall(__NR_memfd_create, \"heapprofd_ringbuf\",\n MFD_CLOEXEC | MFD_ALLOW_SEALING)));\n is_memfd = !!fd;\n\n if (!fd) {\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n \/\/ In-tree builds should only allow mem_fd, so we can inspect the seals\n \/\/ to verify the fd is appropriately sealed.\n PERFETTO_ELOG(\"memfd_create() failed\");\n return;\n#else\n PERFETTO_DPLOG(\"memfd_create() failed\");\n#endif\n }\n#endif\n\n if (!fd)\n fd = base::TempFile::CreateUnlinked().ReleaseFD();\n\n PERFETTO_CHECK(fd);\n int res = ftruncate(fd.get(), static_cast<off_t>(size_with_meta));\n PERFETTO_CHECK(res == 0);\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n if (is_memfd) {\n res = fcntl(*fd, F_ADD_SEALS, kFDSeals);\n if (res != 0) {\n PERFETTO_PLOG(\"Failed to seal FD.\");\n return;\n }\n }\n#endif\n Initialize(std::move(fd));\n if (!is_valid())\n return;\n\n new (meta_) MetadataPage();\n}\n\nSharedRingBuffer::~SharedRingBuffer() {\n static_assert(std::is_trivially_constructible<MetadataPage>::value,\n \"MetadataPage must be trivially constructible\");\n static_assert(std::is_trivially_destructible<MetadataPage>::value,\n \"MetadataPage must be trivially destructible\");\n\n if (is_valid()) {\n size_t outer_size = kMetaPageSize + size_ * 2 + kGuardSize;\n munmap(meta_, outer_size);\n }\n}\n\nvoid SharedRingBuffer::Initialize(base::ScopedFile mem_fd) {\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n int seals = fcntl(*mem_fd, F_GET_SEALS);\n if (seals == -1) {\n PERFETTO_PLOG(\"Failed to get seals of FD.\");\n return;\n }\n if ((seals & kFDSeals) != kFDSeals) {\n PERFETTO_ELOG(\"FD not properly sealed. Expected %x, got %x\", kFDSeals,\n seals);\n return;\n }\n#endif\n\n struct stat stat_buf = {};\n int res = fstat(*mem_fd, &stat_buf);\n if (res != 0 || stat_buf.st_size == 0) {\n PERFETTO_PLOG(\"Could not attach to fd.\");\n return;\n }\n auto size_with_meta = static_cast<size_t>(stat_buf.st_size);\n auto size = size_with_meta - kMetaPageSize;\n\n \/\/ |size_with_meta| must be a power of two number of pages + 1 page (for\n \/\/ metadata).\n if (size_with_meta < 2 * base::kPageSize || size % base::kPageSize ||\n (size & (size - 1))) {\n PERFETTO_ELOG(\"SharedRingBuffer size is invalid (%zu)\", size_with_meta);\n return;\n }\n\n \/\/ First of all reserve the whole virtual region to fit the buffer twice\n \/\/ + metadata page + red zone at the end.\n size_t outer_size = kMetaPageSize + size * 2 + kGuardSize;\n uint8_t* region = reinterpret_cast<uint8_t*>(\n mmap(nullptr, outer_size, PROT_NONE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0));\n if (region == MAP_FAILED) {\n PERFETTO_PLOG(\"mmap(PROT_NONE) failed\");\n return;\n }\n\n \/\/ Map first the whole buffer (including the initial metadata page) @ off=0.\n void* reg1 = mmap(region, size_with_meta, PROT_READ | PROT_WRITE,\n MAP_SHARED | MAP_FIXED, *mem_fd, 0);\n\n \/\/ Then map again the buffer, skipping the metadata page. The final result is:\n \/\/ [ METADATA ] [ RING BUFFER SHMEM ] [ RING BUFFER SHMEM ]\n void* reg2 = mmap(region + size_with_meta, size, PROT_READ | PROT_WRITE,\n MAP_SHARED | MAP_FIXED, *mem_fd,\n \/*offset=*\/kMetaPageSize);\n\n if (reg1 != region || reg2 != region + size_with_meta) {\n PERFETTO_PLOG(\"mmap(MAP_SHARED) failed\");\n munmap(region, outer_size);\n return;\n }\n size_ = size;\n meta_ = reinterpret_cast<MetadataPage*>(region);\n mem_ = region + kMetaPageSize;\n mem_fd_ = std::move(mem_fd);\n}\n\nSharedRingBuffer::Buffer SharedRingBuffer::BeginWrite(\n const ScopedSpinlock& spinlock,\n size_t size) {\n PERFETTO_DCHECK(spinlock.locked());\n Buffer result;\n\n base::Optional<PointerPositions> opt_pos = GetPointerPositions();\n if (!opt_pos) {\n meta_->stats.num_writes_corrupt++;\n errno = EBADF;\n return result;\n }\n auto pos = opt_pos.value();\n\n const uint64_t size_with_header =\n base::AlignUp<kAlignment>(size + kHeaderSize);\n\n \/\/ size_with_header < size is for catching overflow of size_with_header.\n if (PERFETTO_UNLIKELY(size_with_header < size)) {\n errno = EINVAL;\n return result;\n }\n\n if (size_with_header > write_avail(pos)) {\n meta_->stats.num_writes_overflow++;\n errno = EAGAIN;\n return result;\n }\n\n uint8_t* wr_ptr = at(pos.write_pos);\n\n result.size = size;\n result.data = wr_ptr + kHeaderSize;\n meta_->stats.bytes_written += size;\n meta_->stats.num_writes_succeeded++;\n\n \/\/ We can make this a relaxed store, as this gets picked up by the acquire\n \/\/ load in GetPointerPositions (and the release store below).\n reinterpret_cast<std::atomic<uint32_t>*>(wr_ptr)->store(\n 0, std::memory_order_relaxed);\n\n \/\/ This needs to happen after the store above, so the reader never observes an\n \/\/ incorrect byte count. This is matched by the acquire load in\n \/\/ GetPointerPositions.\n meta_->write_pos.fetch_add(size_with_header, std::memory_order_release);\n return result;\n}\n\nvoid SharedRingBuffer::EndWrite(Buffer buf) {\n if (!buf)\n return;\n uint8_t* wr_ptr = buf.data - kHeaderSize;\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(wr_ptr) % kAlignment == 0);\n\n \/\/ This needs to release to make sure the reader sees the payload written\n \/\/ between the BeginWrite and EndWrite calls.\n \/\/\n \/\/ This is matched by the acquire load in BeginRead where it reads the\n \/\/ record's size.\n reinterpret_cast<std::atomic<uint32_t>*>(wr_ptr)->store(\n static_cast<uint32_t>(buf.size), std::memory_order_release);\n}\n\nSharedRingBuffer::Buffer SharedRingBuffer::BeginRead() {\n base::Optional<PointerPositions> opt_pos = GetPointerPositions();\n if (!opt_pos) {\n meta_->stats.num_reads_corrupt++;\n errno = EBADF;\n return Buffer();\n }\n auto pos = opt_pos.value();\n\n size_t avail_read = read_avail(pos);\n\n if (avail_read < kHeaderSize) {\n meta_->stats.num_reads_nodata++;\n errno = EAGAIN;\n return Buffer(); \/\/ No data\n }\n\n uint8_t* rd_ptr = at(pos.read_pos);\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(rd_ptr) % kAlignment == 0);\n const size_t size = reinterpret_cast<std::atomic<uint32_t>*>(rd_ptr)->load(\n std::memory_order_acquire);\n if (size == 0) {\n meta_->stats.num_reads_nodata++;\n errno = EAGAIN;\n return Buffer();\n }\n const size_t size_with_header = base::AlignUp<kAlignment>(size + kHeaderSize);\n\n if (size_with_header > avail_read) {\n PERFETTO_ELOG(\n \"Corrupted header detected, size=%zu\"\n \", read_avail=%zu, rd=%\" PRIu64 \", wr=%\" PRIu64,\n size, avail_read, pos.read_pos, pos.write_pos);\n meta_->stats.num_reads_corrupt++;\n errno = EBADF;\n return Buffer();\n }\n\n rd_ptr += kHeaderSize;\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(rd_ptr) % kAlignment == 0);\n return Buffer(rd_ptr, size);\n}\n\nvoid SharedRingBuffer::EndRead(Buffer buf) {\n if (!buf)\n return;\n size_t size_with_header = base::AlignUp<kAlignment>(buf.size + kHeaderSize);\n meta_->read_pos.fetch_add(size_with_header, std::memory_order_relaxed);\n meta_->stats.num_reads_succeeded++;\n}\n\nbool SharedRingBuffer::IsCorrupt(const PointerPositions& pos) {\n if (pos.write_pos < pos.read_pos || pos.write_pos - pos.read_pos > size_ ||\n pos.write_pos % kAlignment || pos.read_pos % kAlignment) {\n PERFETTO_ELOG(\"Ring buffer corrupted, rd=%\" PRIu64 \", wr=%\" PRIu64\n \", size=%zu\",\n pos.read_pos, pos.write_pos, size_);\n return true;\n }\n return false;\n}\n\nSharedRingBuffer::SharedRingBuffer(SharedRingBuffer&& other) noexcept {\n *this = std::move(other);\n}\n\nSharedRingBuffer& SharedRingBuffer::operator=(SharedRingBuffer&& other) {\n mem_fd_ = std::move(other.mem_fd_);\n std::tie(meta_, mem_, size_) = std::tie(other.meta_, other.mem_, other.size_);\n std::tie(other.meta_, other.mem_, other.size_) =\n std::make_tuple(nullptr, nullptr, 0);\n return *this;\n}\n\n\/\/ static\nbase::Optional<SharedRingBuffer> SharedRingBuffer::Create(size_t size) {\n auto buf = SharedRingBuffer(CreateFlag(), size);\n if (!buf.is_valid())\n return base::nullopt;\n return base::make_optional(std::move(buf));\n}\n\n\/\/ static\nbase::Optional<SharedRingBuffer> SharedRingBuffer::Attach(\n base::ScopedFile mem_fd) {\n auto buf = SharedRingBuffer(AttachFlag(), std::move(mem_fd));\n if (!buf.is_valid())\n return base::nullopt;\n return base::make_optional(std::move(buf));\n}\n\n} \/\/ namespace profiling\n} \/\/ namespace perfetto\n<commit_msg>Work around double-closing memfd.<commit_after>\/*\n * Copyright (C) 2019 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/profiling\/memory\/shared_ring_buffer.h\"\n\n#include <atomic>\n#include <type_traits>\n\n#include <errno.h>\n#include <inttypes.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n\n#include \"perfetto\/base\/build_config.h\"\n#include \"perfetto\/ext\/base\/scoped_file.h\"\n#include \"perfetto\/ext\/base\/temp_file.h\"\n#include \"src\/profiling\/memory\/scoped_spinlock.h\"\n\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n#include <linux\/memfd.h>\n#include <sys\/syscall.h>\n#endif\n\nnamespace perfetto {\nnamespace profiling {\n\nnamespace {\n\nconstexpr auto kMetaPageSize = base::kPageSize;\nconstexpr auto kAlignment = 8; \/\/ 64 bits to use aligned memcpy().\nconstexpr auto kHeaderSize = kAlignment;\nconstexpr auto kGuardSize = base::kPageSize * 1024 * 16; \/\/ 64 MB.\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\nconstexpr auto kFDSeals = F_SEAL_SHRINK | F_SEAL_GROW | F_SEAL_SEAL;\n#endif\n\n} \/\/ namespace\n\n\nSharedRingBuffer::SharedRingBuffer(CreateFlag, size_t size) {\n size_t size_with_meta = size + kMetaPageSize;\n base::ScopedFile fd;\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n bool is_memfd = false;\n fd.reset(static_cast<int>(syscall(__NR_memfd_create, \"heapprofd_ringbuf\",\n MFD_CLOEXEC | MFD_ALLOW_SEALING)));\n is_memfd = !!fd;\n\n if (!fd) {\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n \/\/ In-tree builds should only allow mem_fd, so we can inspect the seals\n \/\/ to verify the fd is appropriately sealed.\n PERFETTO_ELOG(\"memfd_create() failed\");\n return;\n#else\n PERFETTO_DPLOG(\"memfd_create() failed\");\n#endif\n }\n#endif\n\n if (!fd)\n fd = base::TempFile::CreateUnlinked().ReleaseFD();\n\n PERFETTO_CHECK(fd);\n int res = ftruncate(fd.get(), static_cast<off_t>(size_with_meta));\n PERFETTO_CHECK(res == 0);\n#if PERFETTO_BUILDFLAG(PERFETTO_OS_ANDROID)\n if (is_memfd) {\n res = fcntl(*fd, F_ADD_SEALS, kFDSeals);\n if (res != 0) {\n PERFETTO_PLOG(\"Failed to seal FD.\");\n return;\n }\n }\n#endif\n Initialize(std::move(fd));\n if (!is_valid())\n return;\n\n new (meta_) MetadataPage();\n}\n\nSharedRingBuffer::~SharedRingBuffer() {\n static_assert(std::is_trivially_constructible<MetadataPage>::value,\n \"MetadataPage must be trivially constructible\");\n static_assert(std::is_trivially_destructible<MetadataPage>::value,\n \"MetadataPage must be trivially destructible\");\n\n if (is_valid()) {\n size_t outer_size = kMetaPageSize + size_ * 2 + kGuardSize;\n munmap(meta_, outer_size);\n }\n\n \/\/ This is work-around for code like the following:\n \/\/ https:\/\/android.googlesource.com\/platform\/libcore\/+\/4ecb71f94378716f88703b9f7548b5d24839262f\/ojluni\/src\/main\/native\/UNIXProcess_md.c#427\n \/\/ They fork, close all fds by iterating over \/proc\/self\/fd using opendir.\n \/\/ Unfortunately closedir calls free, which detects the fork, and then tries\n \/\/ to destruct the Client that holds this SharedRingBuffer.\n \/\/\n \/\/ ScopedResource crashes on failure to close, so we explicitly ignore\n \/\/ failures here.\n int fd = mem_fd_.release();\n if (fd != -1)\n close(fd);\n}\n\nvoid SharedRingBuffer::Initialize(base::ScopedFile mem_fd) {\n#if PERFETTO_BUILDFLAG(PERFETTO_ANDROID_BUILD)\n int seals = fcntl(*mem_fd, F_GET_SEALS);\n if (seals == -1) {\n PERFETTO_PLOG(\"Failed to get seals of FD.\");\n return;\n }\n if ((seals & kFDSeals) != kFDSeals) {\n PERFETTO_ELOG(\"FD not properly sealed. Expected %x, got %x\", kFDSeals,\n seals);\n return;\n }\n#endif\n\n struct stat stat_buf = {};\n int res = fstat(*mem_fd, &stat_buf);\n if (res != 0 || stat_buf.st_size == 0) {\n PERFETTO_PLOG(\"Could not attach to fd.\");\n return;\n }\n auto size_with_meta = static_cast<size_t>(stat_buf.st_size);\n auto size = size_with_meta - kMetaPageSize;\n\n \/\/ |size_with_meta| must be a power of two number of pages + 1 page (for\n \/\/ metadata).\n if (size_with_meta < 2 * base::kPageSize || size % base::kPageSize ||\n (size & (size - 1))) {\n PERFETTO_ELOG(\"SharedRingBuffer size is invalid (%zu)\", size_with_meta);\n return;\n }\n\n \/\/ First of all reserve the whole virtual region to fit the buffer twice\n \/\/ + metadata page + red zone at the end.\n size_t outer_size = kMetaPageSize + size * 2 + kGuardSize;\n uint8_t* region = reinterpret_cast<uint8_t*>(\n mmap(nullptr, outer_size, PROT_NONE, MAP_PRIVATE | MAP_ANONYMOUS, -1, 0));\n if (region == MAP_FAILED) {\n PERFETTO_PLOG(\"mmap(PROT_NONE) failed\");\n return;\n }\n\n \/\/ Map first the whole buffer (including the initial metadata page) @ off=0.\n void* reg1 = mmap(region, size_with_meta, PROT_READ | PROT_WRITE,\n MAP_SHARED | MAP_FIXED, *mem_fd, 0);\n\n \/\/ Then map again the buffer, skipping the metadata page. The final result is:\n \/\/ [ METADATA ] [ RING BUFFER SHMEM ] [ RING BUFFER SHMEM ]\n void* reg2 = mmap(region + size_with_meta, size, PROT_READ | PROT_WRITE,\n MAP_SHARED | MAP_FIXED, *mem_fd,\n \/*offset=*\/kMetaPageSize);\n\n if (reg1 != region || reg2 != region + size_with_meta) {\n PERFETTO_PLOG(\"mmap(MAP_SHARED) failed\");\n munmap(region, outer_size);\n return;\n }\n size_ = size;\n meta_ = reinterpret_cast<MetadataPage*>(region);\n mem_ = region + kMetaPageSize;\n mem_fd_ = std::move(mem_fd);\n}\n\nSharedRingBuffer::Buffer SharedRingBuffer::BeginWrite(\n const ScopedSpinlock& spinlock,\n size_t size) {\n PERFETTO_DCHECK(spinlock.locked());\n Buffer result;\n\n base::Optional<PointerPositions> opt_pos = GetPointerPositions();\n if (!opt_pos) {\n meta_->stats.num_writes_corrupt++;\n errno = EBADF;\n return result;\n }\n auto pos = opt_pos.value();\n\n const uint64_t size_with_header =\n base::AlignUp<kAlignment>(size + kHeaderSize);\n\n \/\/ size_with_header < size is for catching overflow of size_with_header.\n if (PERFETTO_UNLIKELY(size_with_header < size)) {\n errno = EINVAL;\n return result;\n }\n\n if (size_with_header > write_avail(pos)) {\n meta_->stats.num_writes_overflow++;\n errno = EAGAIN;\n return result;\n }\n\n uint8_t* wr_ptr = at(pos.write_pos);\n\n result.size = size;\n result.data = wr_ptr + kHeaderSize;\n meta_->stats.bytes_written += size;\n meta_->stats.num_writes_succeeded++;\n\n \/\/ We can make this a relaxed store, as this gets picked up by the acquire\n \/\/ load in GetPointerPositions (and the release store below).\n reinterpret_cast<std::atomic<uint32_t>*>(wr_ptr)->store(\n 0, std::memory_order_relaxed);\n\n \/\/ This needs to happen after the store above, so the reader never observes an\n \/\/ incorrect byte count. This is matched by the acquire load in\n \/\/ GetPointerPositions.\n meta_->write_pos.fetch_add(size_with_header, std::memory_order_release);\n return result;\n}\n\nvoid SharedRingBuffer::EndWrite(Buffer buf) {\n if (!buf)\n return;\n uint8_t* wr_ptr = buf.data - kHeaderSize;\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(wr_ptr) % kAlignment == 0);\n\n \/\/ This needs to release to make sure the reader sees the payload written\n \/\/ between the BeginWrite and EndWrite calls.\n \/\/\n \/\/ This is matched by the acquire load in BeginRead where it reads the\n \/\/ record's size.\n reinterpret_cast<std::atomic<uint32_t>*>(wr_ptr)->store(\n static_cast<uint32_t>(buf.size), std::memory_order_release);\n}\n\nSharedRingBuffer::Buffer SharedRingBuffer::BeginRead() {\n base::Optional<PointerPositions> opt_pos = GetPointerPositions();\n if (!opt_pos) {\n meta_->stats.num_reads_corrupt++;\n errno = EBADF;\n return Buffer();\n }\n auto pos = opt_pos.value();\n\n size_t avail_read = read_avail(pos);\n\n if (avail_read < kHeaderSize) {\n meta_->stats.num_reads_nodata++;\n errno = EAGAIN;\n return Buffer(); \/\/ No data\n }\n\n uint8_t* rd_ptr = at(pos.read_pos);\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(rd_ptr) % kAlignment == 0);\n const size_t size = reinterpret_cast<std::atomic<uint32_t>*>(rd_ptr)->load(\n std::memory_order_acquire);\n if (size == 0) {\n meta_->stats.num_reads_nodata++;\n errno = EAGAIN;\n return Buffer();\n }\n const size_t size_with_header = base::AlignUp<kAlignment>(size + kHeaderSize);\n\n if (size_with_header > avail_read) {\n PERFETTO_ELOG(\n \"Corrupted header detected, size=%zu\"\n \", read_avail=%zu, rd=%\" PRIu64 \", wr=%\" PRIu64,\n size, avail_read, pos.read_pos, pos.write_pos);\n meta_->stats.num_reads_corrupt++;\n errno = EBADF;\n return Buffer();\n }\n\n rd_ptr += kHeaderSize;\n PERFETTO_DCHECK(reinterpret_cast<uintptr_t>(rd_ptr) % kAlignment == 0);\n return Buffer(rd_ptr, size);\n}\n\nvoid SharedRingBuffer::EndRead(Buffer buf) {\n if (!buf)\n return;\n size_t size_with_header = base::AlignUp<kAlignment>(buf.size + kHeaderSize);\n meta_->read_pos.fetch_add(size_with_header, std::memory_order_relaxed);\n meta_->stats.num_reads_succeeded++;\n}\n\nbool SharedRingBuffer::IsCorrupt(const PointerPositions& pos) {\n if (pos.write_pos < pos.read_pos || pos.write_pos - pos.read_pos > size_ ||\n pos.write_pos % kAlignment || pos.read_pos % kAlignment) {\n PERFETTO_ELOG(\"Ring buffer corrupted, rd=%\" PRIu64 \", wr=%\" PRIu64\n \", size=%zu\",\n pos.read_pos, pos.write_pos, size_);\n return true;\n }\n return false;\n}\n\nSharedRingBuffer::SharedRingBuffer(SharedRingBuffer&& other) noexcept {\n *this = std::move(other);\n}\n\nSharedRingBuffer& SharedRingBuffer::operator=(SharedRingBuffer&& other) {\n mem_fd_ = std::move(other.mem_fd_);\n std::tie(meta_, mem_, size_) = std::tie(other.meta_, other.mem_, other.size_);\n std::tie(other.meta_, other.mem_, other.size_) =\n std::make_tuple(nullptr, nullptr, 0);\n return *this;\n}\n\n\/\/ static\nbase::Optional<SharedRingBuffer> SharedRingBuffer::Create(size_t size) {\n auto buf = SharedRingBuffer(CreateFlag(), size);\n if (!buf.is_valid())\n return base::nullopt;\n return base::make_optional(std::move(buf));\n}\n\n\/\/ static\nbase::Optional<SharedRingBuffer> SharedRingBuffer::Attach(\n base::ScopedFile mem_fd) {\n auto buf = SharedRingBuffer(AttachFlag(), std::move(mem_fd));\n if (!buf.is_valid())\n return base::nullopt;\n return base::make_optional(std::move(buf));\n}\n\n} \/\/ namespace profiling\n} \/\/ namespace perfetto\n<|endoftext|>"} {"text":"<commit_before>#include \"doofit\/Builder\/numerobis\/blueprint\/elements\/registrar.h\"\n\n\/\/ from STL\n#include <string>\n#include <map>\n\n\/\/ from BOOST\n#include <boost\/foreach.hpp>\n\n\/\/ from RooFit\n#include \"RooArgList.h\"\n\n\/\/ from project\n#include \"doofit\/utils\/\/MsgStream.h\"\n#include \"doofit\/Builder\/numerobis\/blueprint\/elements\/element.h\"\n\n\/\/ forward decalaration\nclass RooWorkspace;\n\nnamespace doofit {\nnamespace builder {\nnamespace numerobis {\nnamespace blueprint {\nnamespace elements {\n\n\nRegistrar::Registrar()\n : elements_()\n{\n \n}\n\nRegistrar::~Registrar() {\n \n}\n\nvoid Registrar::Declare(Element* const element) {\n std::string temp_key = element->id_abs();\n elements_.insert(temp_key, element);\n}\n \nvoid Registrar::Print() const {\n namespace du = doofit::utils;\n du::sinfo.Ruler();\n du::sinfo << \"Registrar contents:\" << du::endmsg;\n du::sinfo.increment_indent(2);\n for (boost::ptr_map<std::string, Element>::const_iterator it=elements_.begin();\n it!=elements_.end(); ++it) {\n du::sinfo << *(*it).second << du::endmsg;\n }\n du::sinfo.increment_indent(-2);\n}\n \nbool Registrar::CheckReady(const std::string& element_name) {\n boost::ptr_map<std::string, Element>::iterator it_element = elements_.find(element_name);\n if (it_element == elements_.end()) return false;\n \n Element* element = *it_element->second();\n \n namespace du = doofit::utils;\n \/\/du::sdebug << \"Checking ready for: \" << element.id_abs() << du::endmsg;\n \n \/\/ Check if element is ready, if not, check if dependants are ready.\n if (!element.ready()) {\n const std::vector<std::string>& dep = element.dependants();\n bool allready = true;\n \n std::map<std::string, Element*>::iterator it_el;\n BOOST_FOREACH (std::string it_dep, dep) {\n it_el = elements_.find(it_dep);\n if (it_el == elements_.end()) {\n allready = false;\n } else {\n allready &= CheckReady(*it_el->second);\n } \n } \n if (allready) element.set_ready(true);\n }\n \n return element.ready();\n}\n\nRooAbsArg* Registrar::Register(RooWorkspace* ws, Element &element) {\n if (CheckReady(element)) {\n const std::vector<std::string>& dep_ids = element.dependants();\n \n \/\/ Iterate ove dependants and check if dependants exist in elements_. \n \/\/ If not, throw exception.\n \/\/ If yes, register them and invoke AddToWorkspace\n std::vector<RooAbsArg*> dep_elements;\n std::map<std::string, Element*>::iterator it_el;\n BOOST_FOREACH(std::string it_dep, dep_ids) {\n it_el = elements_.find(it_dep);\n if (it_el == elements_.end()) {\n throw UnexpectedException();\n } else {\n Element& dep_element = *it_el->second;\n dep_elements.push_back(Register(ws, dep_element));\n }\n }\n return element.AddToWorkspace(ws, dep_elements);\n }\n return NULL;\n}\n \nRooArgList VectorToArgList(std::vector<RooAbsArg*> vec) {\n RooArgList list; \n for (std::vector<RooAbsArg*>::const_iterator it=vec.begin(); \n it!=vec.end(); ++it) {\n list.add(**it, true);\n }\n return list;\n}\n \n} \/\/ namespace elements \n} \/\/ namespace blueprint \n} \/\/ namespace numerobis \n} \/\/ namespace builder \n} \/\/ namespace doofit\n<commit_msg>Blubbsel.<commit_after>#include \"doofit\/Builder\/numerobis\/blueprint\/elements\/registrar.h\"\n\n\/\/ from STL\n#include <string>\n#include <map>\n\n\/\/ from BOOST\n#include <boost\/foreach.hpp>\n\n\/\/ from RooFit\n#include \"RooArgList.h\"\n\n\/\/ from project\n#include \"doofit\/utils\/\/MsgStream.h\"\n#include \"doofit\/Builder\/numerobis\/blueprint\/elements\/element.h\"\n\n\/\/ forward decalaration\nclass RooWorkspace;\n\nnamespace doofit {\nnamespace builder {\nnamespace numerobis {\nnamespace blueprint {\nnamespace elements {\n\n\nRegistrar::Registrar()\n : elements_()\n{\n \n}\n\nRegistrar::~Registrar() {\n \n}\n\nvoid Registrar::Declare(Element* const element) {\n std::string temp_key = element->id_abs();\n elements_.insert(temp_key, element);\n}\n \nvoid Registrar::Print() const {\n namespace du = doofit::utils;\n du::sinfo.Ruler();\n du::sinfo << \"Registrar contents:\" << du::endmsg;\n du::sinfo.increment_indent(2);\n for (boost::ptr_map<std::string, Element>::const_iterator it=elements_.begin();\n it!=elements_.end(); ++it) {\n du::sinfo << *(*it).second << du::endmsg;\n }\n du::sinfo.increment_indent(-2);\n}\n \nbool Registrar::CheckReady(const std::string& element_name) {\n boost::ptr_map<std::string, Element>::iterator it_element = elements_.find(element_name);\n if (it_element == elements_.end()) return false;\n \n Element* element = it_element->second;\n \n namespace du = doofit::utils;\n \/\/du::sdebug << \"Checking ready for: \" << element.id_abs() << du::endmsg;\n \n \/\/ Check if element is ready, if not, check if dependants are ready.\n if (!element->ready()) {\n const std::vector<std::string>& dep = element->dependants();\n bool allready = true;\n \n boost::ptr_map<std::string, Element>::iterator it_el;\n BOOST_FOREACH (std::string it_dep, dep) {\n it_el = elements_.find(it_dep);\n if (it_el == elements_.end()) {\n allready = false;\n } else {\n allready &= CheckReady(it_el->second->id_abs());\n } \n } \n if (allready) element->set_ready(true);\n }\n \n return element->ready();\n}\n\nRooAbsArg* Registrar::Register(RooWorkspace* ws, const std::string& element_name) {\n if (CheckReady(element_name)) {\n Element* element = elements_.find(element_name)->second;\n \n const std::vector<std::string>& dep_ids = element->dependants();\n \n \/\/ Iterate over dependants and check if dependants exist in elements_. \n \/\/ If not, throw exception.\n \/\/ If yes, register them and invoke AddToWorkspace\n std::vector<RooAbsArg*> dep_elements;\n boost::ptr_map<std::string, Element>::iterator it_el;\n BOOST_FOREACH(std::string it_dep, dep_ids) {\n it_el = elements_.find(it_dep);\n if (it_el == elements_.end()) {\n throw UnexpectedException();\n } else {\n Element* dep_element = it_el->second;\n dep_elements.push_back(Register(ws, dep_element->id_abs()));\n }\n }\n return element->AddToWorkspace(ws, dep_elements);\n }\n return NULL;\n}\n \nRooArgList VectorToArgList(std::vector<RooAbsArg*> vec) {\n RooArgList list; \n for (std::vector<RooAbsArg*>::const_iterator it=vec.begin(); \n it!=vec.end(); ++it) {\n list.add(**it, true);\n }\n return list;\n}\n \n} \/\/ namespace elements \n} \/\/ namespace blueprint \n} \/\/ namespace numerobis \n} \/\/ namespace builder \n} \/\/ namespace doofit\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/-------------------------------------------------------------------------\n\/\/ Offline Analysis Database Container and Service Class \n\/\/ Author: Andreas Morsch, CERN\n\/\/-------------------------------------------------------------------------\n\n#include \"AliOADBContainer.h\"\n#include \"AliLog.h\"\n#include <TObjArray.h>\n#include <TArrayI.h>\n#include <TFile.h>\n#include <TList.h>\n#include <TBrowser.h>\n#include <TSystem.h>\n#include <TError.h>\n\nClassImp(AliOADBContainer);\n\n\/\/______________________________________________________________________________\nAliOADBContainer::AliOADBContainer() : \n TNamed(),\n fArray(0),\n fDefaultList(0),\n fLowerLimits(),\n fUpperLimits(),\n fEntries(0)\n{\n \/\/ Default constructor\n}\n\nAliOADBContainer::AliOADBContainer(const char* name) : \n TNamed(name, \"OADBContainer\"),\n fArray(new TObjArray(100)),\n fDefaultList(new TList()),\n fLowerLimits(),\n fUpperLimits(),\n fEntries(0)\n{\n \/\/ Constructor\n}\n\n\n\/\/______________________________________________________________________________\nAliOADBContainer::~AliOADBContainer() \n{\n \/\/ destructor\n}\n\n\/\/______________________________________________________________________________\nAliOADBContainer::AliOADBContainer(const AliOADBContainer& cont) :\n TNamed(cont),\n fArray(cont.fArray),\n fDefaultList(cont.fDefaultList),\n fLowerLimits(cont.fLowerLimits),\n fUpperLimits(cont.fUpperLimits),\n fEntries(cont.fEntries)\n{\n \/\/ Copy constructor.\n}\n\n\/\/______________________________________________________________________________\nAliOADBContainer& AliOADBContainer::operator=(const AliOADBContainer& cont)\n{\n \/\/\n \/\/ Assignment operator\n \/\/ Copy objects related to run ranges\n if(this!=&cont) {\n TNamed::operator=(cont);\n fEntries = cont.fEntries;\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n for (Int_t i = 0; i < fEntries; i++) {\n\tfLowerLimits[i] = cont.fLowerLimits[i]; \n\tfUpperLimits[i] = cont.fUpperLimits[i];\n\tfArray->AddAt(cont.fArray->At(i), i);\n }\n }\n \/\/\n \/\/ Copy default objects\n TList* list = cont.GetDefaultList();\n TIter next(list);\n TObject* obj;\n while((obj = next())) fDefaultList->Add(obj);\n \/\/\n return *this;\n}\n\nvoid AliOADBContainer::AppendObject(TObject* obj, Int_t lower, Int_t upper)\n{\n \/\/\n \/\/ Append a new object to the list \n \/\/\n \/\/ Check that there is no overlap with existing run ranges\n Int_t index = HasOverlap(lower, upper);\n \n if (index != -1) {\n AliFatal(Form(\"Ambiguos validity range (%5d, %5.5d-%5.5d) !\\n\", index,lower,upper));\n return;\n }\n \/\/\n \/\/ Adjust arrays\n fEntries++;\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n\n \/\/ Add the object\n fLowerLimits[fEntries - 1] = lower;\n fUpperLimits[fEntries - 1] = upper;\n fArray->Add(obj);\n}\n\nvoid AliOADBContainer::RemoveObject(Int_t idx)\n{\n \/\/\n \/\/ Remove object from the list \n\n \/\/\n \/\/ Check that index is inside range \n if (idx < 0 || idx >= fEntries) \n {\n AliError(Form(\"Index out of Range %5d >= %5d\", idx, fEntries));\n return;\n }\n \/\/\n \/\/ Remove the object\n TObject* obj = fArray->RemoveAt(idx);\n delete obj;\n \/\/\n \/\/ Adjust the run ranges and shrink the array\n for (Int_t i = idx; i < (fEntries-1); i++) {\n fLowerLimits[i] = fLowerLimits[i + 1]; \n fUpperLimits[i] = fUpperLimits[i + 1];\n fArray->AddAt(fArray->At(i+1), i);\n }\n fArray->RemoveAt(fEntries - 1);\n fEntries--;\n}\n\nvoid AliOADBContainer::UpdateObject(Int_t idx, TObject* obj, Int_t lower, Int_t upper)\n{\n \/\/\n \/\/ Update an existing object, at a given position \n\n \/\/ Check that index is inside range\n if (idx < 0 || idx >= fEntries) \n {\n AliError(Form(\"Index out of Range %5d >= %5d\", idx, fEntries));\n return;\n }\n \/\/\n \/\/ Remove the old object and reset the range\n \/\/ TObject* obj2 = \n fArray->RemoveAt(idx);\n \/\/ don't delete it: if you are updating it may be pointing to the same location of obj...\n \/\/ delete obj2;\n fLowerLimits[idx] = -1;\n fUpperLimits[idx] = -1;\n \/\/ Check that there is no overlap with existing run ranges \n Int_t index = HasOverlap(lower, upper);\n if (index != -1) {\n AliFatal(Form(\"Ambiguos validity range (%5d, %5.5d-%5.5d) !\\n\", index,lower,upper));\n return;\n }\n \/\/\n \/\/ Add object at the same position\n \/\/printf(\"idx %d obj %llx\\n\", idx, obj);\n fLowerLimits[idx] = lower;\n fUpperLimits[idx] = upper;\n fArray->AddAt(obj, idx);\n\n}\n \nvoid AliOADBContainer::AddDefaultObject(TObject* obj)\n{\n \/\/ Add a default object\n fDefaultList->Add(obj);\n}\n\nvoid AliOADBContainer::CleanDefaultList()\n{\n \/\/ Clean default list\n fDefaultList->Delete();\n}\n\nInt_t AliOADBContainer::GetIndexForRun(Int_t run) const\n{\n \/\/\n \/\/ Find the index for a given run \n \n Int_t found = 0;\n Int_t index = -1;\n for (Int_t i = 0; i < fEntries; i++) \n {\n if (run >= fLowerLimits[i] && run <= fUpperLimits[i])\n\t{\n\t found++;\n\t index = i;\n\t}\n }\n\n if (found > 1) {\n AliError(Form(\"More than one (%5d) object found; return last (%5d) !\\n\", found, index));\n } else if (index == -1) {\n AliWarning(Form(\"No object (%s) found for run %5d !\\n\", GetName(), run));\n }\n \n return index;\n}\n\nTObject* AliOADBContainer::GetObject(Int_t run, const char* def) const\n{\n \/\/ Return object for given run or default if not found\n TObject* obj = 0;\n Int_t idx = GetIndexForRun(run);\n if (idx == -1) {\n \/\/ no object found, try default\n obj = fDefaultList->FindObject(def);\n if (!obj) {\n AliError(Form(\"Default Object (%s) not found !\\n\", GetName()));\n return (0);\n } else {\n return (obj);\n }\n } else {\n return (fArray->At(idx));\n }\n}\n\nTObject* AliOADBContainer::GetObjectByIndex(Int_t run) const\n{\n \/\/ Return object for given index\n return (fArray->At(run));\n}\n\nvoid AliOADBContainer::WriteToFile(const char* fname) const\n{\n \/\/\n \/\/ Write object to file\n TFile* f = new TFile(fname, \"update\");\n Write();\n f->Purge();\n f->Close();\n}\n\nInt_t AliOADBContainer::InitFromFile(const char* fname, const char* key)\n{\n \/\/ \n \/\/ Initialize object from file\n TFile* file = TFile::Open(fname);\n if (!file) return (1);\n AliOADBContainer* cont = 0;\n file->GetObject(key, cont);\n if (!cont)\n {\n AliError(Form(\"Object (%s) not found in file \\n\", GetName()));\t\n\treturn 1;\n }\n\n SetName(cont->GetName());\n SetTitle(cont->GetTitle());\n\n fEntries = cont->GetNumberOfEntries();\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n if(fEntries > fArray->GetSize()) fArray->Expand(fEntries);\n\n for (Int_t i = 0; i < fEntries; i++) {\n\tfLowerLimits[i] = cont->LowerLimit(i); \n\tfUpperLimits[i] = cont->UpperLimit(i);\n\tfArray->AddAt(cont->GetObjectByIndex(i), i);\n }\n if (!fDefaultList) fDefaultList = new TList(); \n TIter next(cont->GetDefaultList());\n TObject* obj;\n while((obj = next())) fDefaultList->Add(obj);\n\n return 0;\n \n}\n\n\nvoid AliOADBContainer::List()\n{\n \/\/\n \/\/ List Objects\n printf(\"Entries %d\\n\", fEntries);\n \n for (Int_t i = 0; i < fEntries; i++) {\n printf(\"Lower %5d Upper %5d \\n\", fLowerLimits[i], fUpperLimits[i]);\n (fArray->At(i))->Dump();\n }\n TIter next(fDefaultList);\n TObject* obj;\n while((obj = next())) obj->Dump();\n\n}\n\nInt_t AliOADBContainer::HasOverlap(Int_t lower, Int_t upper) const\n{\n \/\/\n \/\/ Checks for overlpapping validity regions\n for (Int_t i = 0; i < fEntries; i++) {\n if ((lower >= fLowerLimits[i] && lower <= fUpperLimits[i]) ||\n\t(upper >= fLowerLimits[i] && upper <= fUpperLimits[i]))\n {\n\treturn (i);\n }\n }\n return (-1);\n}\n\nvoid AliOADBContainer::Browse(TBrowser *b)\n{\n \/\/ Browse this object.\n \/\/ If b=0, there is no Browse call TObject::Browse(0) instead.\n \/\/ This means TObject::Inspect() will be invoked indirectly\n\n\n if (b) {\n for (Int_t i = 0; i < fEntries; i++) {\n b->Add(fArray->At(i),Form(\"%9.9d - %9.9d\", fLowerLimits[i], fUpperLimits[i]));\n }\n TIter next(fDefaultList);\n TObject* obj;\n while((obj = next())) b->Add(obj);\n \n } \n else\n TObject::Browse(b);\n}\n\n\/\/______________________________________________________________________________\nconst char* AliOADBContainer::GetOADBPath()\n{\n\/\/ returns the path of the OADB\n\/\/ this static function just depends on environment variables\n\n static TString oadbPath;\n\n if (gSystem->Getenv(\"OADB_PATH\"))\n oadbPath = gSystem->Getenv(\"OADB_PATH\");\n else if (gSystem->Getenv(\"ALICE_ROOT\"))\n oadbPath.Form(\"%s\/OADB\", gSystem->Getenv(\"ALICE_ROOT\"));\n else\n ::Fatal(\"AliAnalysisManager::GetOADBPath\", \"Cannot figure out AODB path. Define ALICE_ROOT or OADB_PATH!\");\n return oadbPath;\n}\n<commit_msg>Destructor<commit_after>\/**************************************************************************\n * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/-------------------------------------------------------------------------\n\/\/ Offline Analysis Database Container and Service Class \n\/\/ Author: Andreas Morsch, CERN\n\/\/-------------------------------------------------------------------------\n\n#include \"AliOADBContainer.h\"\n#include \"AliLog.h\"\n#include <TObjArray.h>\n#include <TArrayI.h>\n#include <TFile.h>\n#include <TList.h>\n#include <TBrowser.h>\n#include <TSystem.h>\n#include <TError.h>\n\nClassImp(AliOADBContainer);\n\n\/\/______________________________________________________________________________\nAliOADBContainer::AliOADBContainer() : \n TNamed(),\n fArray(0),\n fDefaultList(0),\n fLowerLimits(),\n fUpperLimits(),\n fEntries(0)\n{\n \/\/ Default constructor\n}\n\nAliOADBContainer::AliOADBContainer(const char* name) : \n TNamed(name, \"OADBContainer\"),\n fArray(new TObjArray(100)),\n fDefaultList(new TList()),\n fLowerLimits(),\n fUpperLimits(),\n fEntries(0)\n{\n \/\/ Constructor\n if (fArray) delete fArray;\n if (fDefaultList) delete fDefaultList;\n}\n\n\n\/\/______________________________________________________________________________\nAliOADBContainer::~AliOADBContainer() \n{\n \/\/ destructor\n}\n\n\/\/______________________________________________________________________________\nAliOADBContainer::AliOADBContainer(const AliOADBContainer& cont) :\n TNamed(cont),\n fArray(cont.fArray),\n fDefaultList(cont.fDefaultList),\n fLowerLimits(cont.fLowerLimits),\n fUpperLimits(cont.fUpperLimits),\n fEntries(cont.fEntries)\n{\n \/\/ Copy constructor.\n}\n\n\/\/______________________________________________________________________________\nAliOADBContainer& AliOADBContainer::operator=(const AliOADBContainer& cont)\n{\n \/\/\n \/\/ Assignment operator\n \/\/ Copy objects related to run ranges\n if(this!=&cont) {\n TNamed::operator=(cont);\n fEntries = cont.fEntries;\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n for (Int_t i = 0; i < fEntries; i++) {\n\tfLowerLimits[i] = cont.fLowerLimits[i]; \n\tfUpperLimits[i] = cont.fUpperLimits[i];\n\tfArray->AddAt(cont.fArray->At(i), i);\n }\n }\n \/\/\n \/\/ Copy default objects\n TList* list = cont.GetDefaultList();\n TIter next(list);\n TObject* obj;\n while((obj = next())) fDefaultList->Add(obj);\n \/\/\n return *this;\n}\n\nvoid AliOADBContainer::AppendObject(TObject* obj, Int_t lower, Int_t upper)\n{\n \/\/\n \/\/ Append a new object to the list \n \/\/\n \/\/ Check that there is no overlap with existing run ranges\n Int_t index = HasOverlap(lower, upper);\n \n if (index != -1) {\n AliFatal(Form(\"Ambiguos validity range (%5d, %5.5d-%5.5d) !\\n\", index,lower,upper));\n return;\n }\n \/\/\n \/\/ Adjust arrays\n fEntries++;\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n\n \/\/ Add the object\n fLowerLimits[fEntries - 1] = lower;\n fUpperLimits[fEntries - 1] = upper;\n fArray->Add(obj);\n}\n\nvoid AliOADBContainer::RemoveObject(Int_t idx)\n{\n \/\/\n \/\/ Remove object from the list \n\n \/\/\n \/\/ Check that index is inside range \n if (idx < 0 || idx >= fEntries) \n {\n AliError(Form(\"Index out of Range %5d >= %5d\", idx, fEntries));\n return;\n }\n \/\/\n \/\/ Remove the object\n TObject* obj = fArray->RemoveAt(idx);\n delete obj;\n \/\/\n \/\/ Adjust the run ranges and shrink the array\n for (Int_t i = idx; i < (fEntries-1); i++) {\n fLowerLimits[i] = fLowerLimits[i + 1]; \n fUpperLimits[i] = fUpperLimits[i + 1];\n fArray->AddAt(fArray->At(i+1), i);\n }\n fArray->RemoveAt(fEntries - 1);\n fEntries--;\n}\n\nvoid AliOADBContainer::UpdateObject(Int_t idx, TObject* obj, Int_t lower, Int_t upper)\n{\n \/\/\n \/\/ Update an existing object, at a given position \n\n \/\/ Check that index is inside range\n if (idx < 0 || idx >= fEntries) \n {\n AliError(Form(\"Index out of Range %5d >= %5d\", idx, fEntries));\n return;\n }\n \/\/\n \/\/ Remove the old object and reset the range\n \/\/ TObject* obj2 = \n fArray->RemoveAt(idx);\n \/\/ don't delete it: if you are updating it may be pointing to the same location of obj...\n \/\/ delete obj2;\n fLowerLimits[idx] = -1;\n fUpperLimits[idx] = -1;\n \/\/ Check that there is no overlap with existing run ranges \n Int_t index = HasOverlap(lower, upper);\n if (index != -1) {\n AliFatal(Form(\"Ambiguos validity range (%5d, %5.5d-%5.5d) !\\n\", index,lower,upper));\n return;\n }\n \/\/\n \/\/ Add object at the same position\n \/\/printf(\"idx %d obj %llx\\n\", idx, obj);\n fLowerLimits[idx] = lower;\n fUpperLimits[idx] = upper;\n fArray->AddAt(obj, idx);\n\n}\n \nvoid AliOADBContainer::AddDefaultObject(TObject* obj)\n{\n \/\/ Add a default object\n fDefaultList->Add(obj);\n}\n\nvoid AliOADBContainer::CleanDefaultList()\n{\n \/\/ Clean default list\n fDefaultList->Delete();\n}\n\nInt_t AliOADBContainer::GetIndexForRun(Int_t run) const\n{\n \/\/\n \/\/ Find the index for a given run \n \n Int_t found = 0;\n Int_t index = -1;\n for (Int_t i = 0; i < fEntries; i++) \n {\n if (run >= fLowerLimits[i] && run <= fUpperLimits[i])\n\t{\n\t found++;\n\t index = i;\n\t}\n }\n\n if (found > 1) {\n AliError(Form(\"More than one (%5d) object found; return last (%5d) !\\n\", found, index));\n } else if (index == -1) {\n AliWarning(Form(\"No object (%s) found for run %5d !\\n\", GetName(), run));\n }\n \n return index;\n}\n\nTObject* AliOADBContainer::GetObject(Int_t run, const char* def) const\n{\n \/\/ Return object for given run or default if not found\n TObject* obj = 0;\n Int_t idx = GetIndexForRun(run);\n if (idx == -1) {\n \/\/ no object found, try default\n obj = fDefaultList->FindObject(def);\n if (!obj) {\n AliError(Form(\"Default Object (%s) not found !\\n\", GetName()));\n return (0);\n } else {\n return (obj);\n }\n } else {\n return (fArray->At(idx));\n }\n}\n\nTObject* AliOADBContainer::GetObjectByIndex(Int_t run) const\n{\n \/\/ Return object for given index\n return (fArray->At(run));\n}\n\nvoid AliOADBContainer::WriteToFile(const char* fname) const\n{\n \/\/\n \/\/ Write object to file\n TFile* f = new TFile(fname, \"update\");\n Write();\n f->Purge();\n f->Close();\n}\n\nInt_t AliOADBContainer::InitFromFile(const char* fname, const char* key)\n{\n \/\/ \n \/\/ Initialize object from file\n TFile* file = TFile::Open(fname);\n if (!file) return (1);\n AliOADBContainer* cont = 0;\n file->GetObject(key, cont);\n if (!cont)\n {\n AliError(Form(\"Object (%s) not found in file \\n\", GetName()));\t\n\treturn 1;\n }\n\n SetName(cont->GetName());\n SetTitle(cont->GetTitle());\n\n fEntries = cont->GetNumberOfEntries();\n fLowerLimits.Set(fEntries);\n fUpperLimits.Set(fEntries);\n if(fEntries > fArray->GetSize()) fArray->Expand(fEntries);\n\n for (Int_t i = 0; i < fEntries; i++) {\n\tfLowerLimits[i] = cont->LowerLimit(i); \n\tfUpperLimits[i] = cont->UpperLimit(i);\n\tfArray->AddAt(cont->GetObjectByIndex(i), i);\n }\n if (!fDefaultList) fDefaultList = new TList(); \n TIter next(cont->GetDefaultList());\n TObject* obj;\n while((obj = next())) fDefaultList->Add(obj);\n\n return 0;\n \n}\n\n\nvoid AliOADBContainer::List()\n{\n \/\/\n \/\/ List Objects\n printf(\"Entries %d\\n\", fEntries);\n \n for (Int_t i = 0; i < fEntries; i++) {\n printf(\"Lower %5d Upper %5d \\n\", fLowerLimits[i], fUpperLimits[i]);\n (fArray->At(i))->Dump();\n }\n TIter next(fDefaultList);\n TObject* obj;\n while((obj = next())) obj->Dump();\n\n}\n\nInt_t AliOADBContainer::HasOverlap(Int_t lower, Int_t upper) const\n{\n \/\/\n \/\/ Checks for overlpapping validity regions\n for (Int_t i = 0; i < fEntries; i++) {\n if ((lower >= fLowerLimits[i] && lower <= fUpperLimits[i]) ||\n\t(upper >= fLowerLimits[i] && upper <= fUpperLimits[i]))\n {\n\treturn (i);\n }\n }\n return (-1);\n}\n\nvoid AliOADBContainer::Browse(TBrowser *b)\n{\n \/\/ Browse this object.\n \/\/ If b=0, there is no Browse call TObject::Browse(0) instead.\n \/\/ This means TObject::Inspect() will be invoked indirectly\n\n\n if (b) {\n for (Int_t i = 0; i < fEntries; i++) {\n b->Add(fArray->At(i),Form(\"%9.9d - %9.9d\", fLowerLimits[i], fUpperLimits[i]));\n }\n TIter next(fDefaultList);\n TObject* obj;\n while((obj = next())) b->Add(obj);\n \n } \n else\n TObject::Browse(b);\n}\n\n\/\/______________________________________________________________________________\nconst char* AliOADBContainer::GetOADBPath()\n{\n\/\/ returns the path of the OADB\n\/\/ this static function just depends on environment variables\n\n static TString oadbPath;\n\n if (gSystem->Getenv(\"OADB_PATH\"))\n oadbPath = gSystem->Getenv(\"OADB_PATH\");\n else if (gSystem->Getenv(\"ALICE_ROOT\"))\n oadbPath.Form(\"%s\/OADB\", gSystem->Getenv(\"ALICE_ROOT\"));\n else\n ::Fatal(\"AliAnalysisManager::GetOADBPath\", \"Cannot figure out AODB path. Define ALICE_ROOT or OADB_PATH!\");\n return oadbPath;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n#define RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n\n#include \"rdb_protocol\/scope.hpp\"\n\nnamespace query_language {\n\nenum term_type_t {\n TERM_TYPE_JSON,\n TERM_TYPE_STREAM,\n TERM_TYPE_VIEW,\n\n \/\/ TODO: in the clients errors are just JSON for simplicity. Maybe we should do that here too?\n \/* This is the type of `Error` terms. It's called \"arbitrary\" because an\n `Error` term can be either a stream or an object. It is a subtype of every\n type. *\/\n TERM_TYPE_ARBITRARY\n};\n\nARCHIVE_PRIM_MAKE_RANGED_SERIALIZABLE(term_type_t, int8_t, TERM_TYPE_JSON, TERM_TYPE_ARBITRARY);\n\nclass term_info_t {\npublic:\n term_info_t() { }\n term_info_t(term_type_t _type, bool _deterministic)\n : type(_type), deterministic(_deterministic)\n { }\n\n term_type_t type;\n bool deterministic;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\ntypedef variable_scope_t<term_info_t> variable_type_scope_t;\n\ntypedef variable_type_scope_t::new_scope_t new_scope_t;\n\ntypedef implicit_value_t<term_info_t> implicit_type_t;\n\nstruct type_checking_environment_t {\n variable_type_scope_t scope;\n implicit_type_t implicit_type;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\n\/\/Implicit value typedef\ntypedef implicit_value_t<boost::shared_ptr<scoped_cJSON_t> >::impliciter_t implicit_value_setter_t;\n\n\/* Wrapper for the scopes in the runtime environment. Makes it convenient to\n * serialize all the in scope variables. *\/\nstruct scopes_t {\n type_checking_environment_t type_env;\n\n implicit_value_t<boost::shared_ptr<scoped_cJSON_t> > implicit_attribute_value;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\n\n} \/\/namespace query_language\n\n#endif \/\/ RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n<commit_msg>Removed unused typedef new_scope_t.<commit_after>\/\/ Copyright 2010-2012 RethinkDB, all rights reserved.\n#ifndef RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n#define RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n\n#include \"rdb_protocol\/scope.hpp\"\n\nnamespace query_language {\n\nenum term_type_t {\n TERM_TYPE_JSON,\n TERM_TYPE_STREAM,\n TERM_TYPE_VIEW,\n\n \/\/ TODO: in the clients errors are just JSON for simplicity. Maybe we should do that here too?\n \/* This is the type of `Error` terms. It's called \"arbitrary\" because an\n `Error` term can be either a stream or an object. It is a subtype of every\n type. *\/\n TERM_TYPE_ARBITRARY\n};\n\nARCHIVE_PRIM_MAKE_RANGED_SERIALIZABLE(term_type_t, int8_t, TERM_TYPE_JSON, TERM_TYPE_ARBITRARY);\n\nclass term_info_t {\npublic:\n term_info_t() { }\n term_info_t(term_type_t _type, bool _deterministic)\n : type(_type), deterministic(_deterministic)\n { }\n\n term_type_t type;\n bool deterministic;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\ntypedef variable_scope_t<term_info_t> variable_type_scope_t;\n\ntypedef implicit_value_t<term_info_t> implicit_type_t;\n\nstruct type_checking_environment_t {\n variable_type_scope_t scope;\n implicit_type_t implicit_type;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\n\/\/Implicit value typedef\ntypedef implicit_value_t<boost::shared_ptr<scoped_cJSON_t> >::impliciter_t implicit_value_setter_t;\n\n\/* Wrapper for the scopes in the runtime environment. Makes it convenient to\n * serialize all the in scope variables. *\/\nstruct scopes_t {\n type_checking_environment_t type_env;\n\n implicit_value_t<boost::shared_ptr<scoped_cJSON_t> > implicit_attribute_value;\n\n RDB_DECLARE_ME_SERIALIZABLE;\n};\n\n\n} \/\/namespace query_language\n\n#endif \/\/ RDB_PROTOCOL_SERIALIZABLE_ENVIRONMENT_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"ForcingFunctionAux.h\"\n\/\/ #include \"Function.h\" \/\/don't think this is needed but check\n\nregisterMooseObject(\"MooseApp\", ForcingFunctionAux);\n\ndefineLegacyParams(ForcingFunctionAux); \/\/?\n\nInputParameters\nForcingFunctionAux::validParams()\n{\n InputParameters params = FunctionAux::validParams();\n params.addClassDescription(\"Auxiliary Kernel that adds a forcing function to the value of an \"\n \"AuxVariable from the previous time step.\");\n return params;\n}\n\nForcingFunctionAux::ForcingFunctionAux(const InputParameters & parameters)\n : FunctionAux(parameters), _u_old(uOld())\n{\n}\n\nReal\nForcingFunctionAux::computeValue()\n{\n if (isNodal())\n mooseError(\"Must use an elemental AuxVariable for ForcingFunctionAux.\");\n else\n return _u_old[_qp] + _dt * _func.value(_t, _q_point[_qp]);\n}\n<commit_msg>Address PR comments and fix non-unity build failure for ForcingFunctionAux #20065<commit_after>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"ForcingFunctionAux.h\"\n#include \"Function.h\"\n\nregisterMooseObject(\"MooseApp\", ForcingFunctionAux);\n\ndefineLegacyParams(ForcingFunctionAux); \/\/?\n\nInputParameters\nForcingFunctionAux::validParams()\n{\n InputParameters params = FunctionAux::validParams();\n params.addClassDescription(\"Auxiliary Kernel that adds a forcing function to the value of an \"\n \"AuxVariable from the previous time step.\");\n return params;\n}\n\nForcingFunctionAux::ForcingFunctionAux(const InputParameters & parameters)\n : FunctionAux(parameters), _u_old(uOld())\n{\n if (isNodal())\n paramError(\"variable\", \"The variable must be elemental\");\n}\n\nReal\nForcingFunctionAux::computeValue()\n{\n return _u_old[_qp] + _dt * _func.value(_t, _q_point[_qp]);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Compile with:\n\/\/gcc -g box_example_02.c -o box_example_02 `pkg-config --cflags --libs elementary`\n\n#ifdef HAVE_CONFIG_H\n# include <elementary_config.h>\n#endif\n\n#define ELM_INTERNAL_API_ARGESFSDFEFC\n#define ELM_INTERFACE_ATSPI_ACCESSIBLE_PROTECTED\n#define ELM_INTERFACE_ATSPI_COMPONENT_PROTECTED\n#define ELM_INTERFACE_ATSPI_ACTION_PROTECTED\n#define ELM_INTERFACE_ATSPI_VALUE_PROTECTED\n#define ELM_INTERFACE_ATSPI_EDITABLE_TEXT_PROTECTED\n#define ELM_INTERFACE_ATSPI_TEXT_PROTECTED\n#define ELM_INTERFACE_ATSPI_SELECTION_PROTECTED\n#define ELM_INTERFACE_ATSPI_IMAGE_PROTECTED\n#define ELM_INTERFACE_ATSPI_WIDGET_ACTION_PROTECTED\n\n#include <iostream>\n\n#include <Elementary.h>\n\n#include <Eo.h>\n#include <Evas.h>\n#include <Elementary.h>\n#include <elm_widget.h>\n#include <elm_interface_atspi_accessible.h>\n\n#include <elm_win.eo.hh>\n#include <elm_box.eo.hh>\n#include <elm_button.eo.hh>\n\n#include <Eina.hh>\n\n#include <deque>\n\nstruct Transitions_Data\n{\n efl::eo::wref<elm_box> box;\n std::deque<Evas_Object_Box_Layout> transitions;\n Evas_Object_Box_Layout last_layout;\n};\n\nstatic void\n_test_box_transition_change(void *data)\n{\n Transitions_Data *tdata = static_cast<Transitions_Data*>(data);\n Elm_Box_Transition *layout_data;\n Evas_Object_Box_Layout next_layout;\n\n assert (!!data);\n assert (!tdata->transitions.empty());\n\n if(efl::eina::optional<elm_box> box = tdata->box.lock())\n {\n next_layout = tdata->transitions.front();\n layout_data = elm_box_transition_new(2.0, tdata->transitions.back(),\n nullptr, nullptr, next_layout, nullptr, nullptr,\n _test_box_transition_change, tdata);\n box->layout_set(elm_box_layout_transition, layout_data,\n elm_box_transition_free);\n tdata->last_layout = next_layout;\n \n tdata->transitions.push_back(tdata->transitions[0]);\n tdata->transitions.pop_front();\n }\n}\n\nEAPI_MAIN int\nelm_main(int argc, char *argv[])\n{\n elm_policy_set(ELM_POLICY_QUIT, ELM_POLICY_QUIT_LAST_WINDOW_CLOSED);\n\n Transitions_Data tdata;\n Eo* test;\n\n {\n ::elm_win win (elm_win_util_standard_add(\"box-transition\", \"Box Transition\"));\n win.autodel_set(true);\n\n elm_box bigbox ( efl::eo::parent = win );\n bigbox.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n win.resize_object_add(bigbox);\n bigbox.visibility_set(true);\n\n elm_box buttons ( efl::eo::parent = win );\n buttons.horizontal_set(EINA_TRUE);\n bigbox.pack_end(buttons);\n buttons.visibility_set(true);\n\n elm_button add ( efl::eo::parent = win );\n add.text_set(\"Add\");\n buttons.pack_end(add);\n add.visibility_set(true);\n add.event_clicked_callback_add\n (std::bind([&tdata]\n {\n if(efl::eina::optional<elm_box> box = tdata.box.lock())\n {\n elm_button btn ( efl::eo::parent = *box );\n btn.text_set(\"I do nothing\");\n efl::eina::list<evas::object> childrens = box->children_get();\n if (!childrens.empty())\n {\n box->pack_after(btn, childrens.front());\n }\n else\n box->pack_end(btn);\n btn.visibility_set(true);\n }\n }));\n\n elm_button clear ( efl::eo::parent = win );\n clear.text_set(\"Clear\");\n buttons.pack_end(clear);\n clear.visibility_set(true);\n clear.event_clicked_callback_add(std::bind([&tdata] { tdata.box.lock()->clear(); }));\n\n elm_box dynamic ( efl::eo::parent = win );\n dynamic.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n dynamic.size_hint_align_set(EVAS_HINT_FILL, EVAS_HINT_FILL);\n bigbox.pack_end(dynamic);\n dynamic.visibility_set(true);\n\n auto unpack = std::bind([&tdata] (evas::clickable_interface obj)\n {\n elm_button btn = efl::eo::downcast<elm_button>(obj);\n tdata.box.lock()->unpack(btn);\n btn.position_set(0, 50);\n btn.color_set(128, 64, 0, 128);\n }, std::placeholders::_1)\n ;\n\n elm_button bt1 ( efl::eo::parent = win );\n bt1.text_set(\"Button 1\");\n bt1.event_clicked_callback_add(unpack);\n bt1.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n bt1.size_hint_align_set(EVAS_HINT_FILL, EVAS_HINT_FILL);\n dynamic.pack_end(bt1);\n bt1.visibility_set(true);\n\n elm_button bt2 ( efl::eo::parent = win );\n bt2.text_set(\"Button 2\");\n bt2.size_hint_weight_set(EVAS_HINT_EXPAND, 0.0);\n bt2.size_hint_align_set(1.0, 0.5);\n bt2.event_clicked_callback_add(unpack);\n dynamic.pack_end(bt2);\n bt2.visibility_set(true);\n\n elm_button bt3 ( efl::eo::parent = win );\n bt3.text_set(\"Button 3\");\n bt3.event_clicked_callback_add(unpack);\n dynamic.pack_end(bt3);\n bt3.visibility_set(true);\n\n tdata.box = dynamic;\n tdata.last_layout = evas_object_box_layout_horizontal;\n tdata.transitions.push_back(evas_object_box_layout_vertical);\n tdata.transitions.push_back(evas_object_box_layout_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_stack);\n tdata.transitions.push_back(evas_object_box_layout_homogeneous_vertical);\n tdata.transitions.push_back(evas_object_box_layout_homogeneous_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_flow_vertical);\n tdata.transitions.push_back(evas_object_box_layout_flow_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_stack);\n\n dynamic.layout_set(evas_object_box_layout_horizontal, nullptr, nullptr);\n _test_box_transition_change(&tdata);\n \n win.size_set(300, 320);\n win.visibility_set(true);\n\n \/\/ bigbox._release();\n \/\/ buttons._release();\n \/\/ add._release();\n \/\/ clear._release();\n \/\/ dynamic._release();\n \/\/ bt1._release();\n \/\/ bt2._release();\n \/\/ bt3._release();\n\n\n std::cout << \"references to win \" << win.ref_get() << std::endl;\n test = win._eo_ptr();\n \/\/win._release();\n }\n std::cout << \"references to win \" << ::eo_ref_get(test) << std::endl;\n \n elm_run();\n elm_shutdown();\n\n return 0;\n}\nELM_MAIN()\n<commit_msg>c++: Added workaround for correct unref times<commit_after>\/\/Compile with:\n\/\/gcc -g box_example_02.c -o box_example_02 `pkg-config --cflags --libs elementary`\n\n#ifdef HAVE_CONFIG_H\n# include <elementary_config.h>\n#endif\n\n#define ELM_INTERNAL_API_ARGESFSDFEFC\n#define ELM_INTERFACE_ATSPI_ACCESSIBLE_PROTECTED\n#define ELM_INTERFACE_ATSPI_COMPONENT_PROTECTED\n#define ELM_INTERFACE_ATSPI_ACTION_PROTECTED\n#define ELM_INTERFACE_ATSPI_VALUE_PROTECTED\n#define ELM_INTERFACE_ATSPI_EDITABLE_TEXT_PROTECTED\n#define ELM_INTERFACE_ATSPI_TEXT_PROTECTED\n#define ELM_INTERFACE_ATSPI_SELECTION_PROTECTED\n#define ELM_INTERFACE_ATSPI_IMAGE_PROTECTED\n#define ELM_INTERFACE_ATSPI_WIDGET_ACTION_PROTECTED\n\n#include <iostream>\n\n#include <Elementary.h>\n\n#include <Eo.h>\n#include <Evas.h>\n#include <Elementary.h>\n#include <elm_widget.h>\n#include <elm_interface_atspi_accessible.h>\n\n#include <elm_win.eo.hh>\n#include <elm_box.eo.hh>\n#include <elm_button.eo.hh>\n\n#include <Eina.hh>\n\n#include <deque>\n\nstruct Transitions_Data\n{\n efl::eo::wref<elm_box> box;\n std::deque<Evas_Object_Box_Layout> transitions;\n Evas_Object_Box_Layout last_layout;\n};\n\nstatic void\n_test_box_transition_change(void *data)\n{\n Transitions_Data *tdata = static_cast<Transitions_Data*>(data);\n Elm_Box_Transition *layout_data;\n Evas_Object_Box_Layout next_layout;\n\n assert (!!data);\n assert (!tdata->transitions.empty());\n\n if(efl::eina::optional<elm_box> box = tdata->box.lock())\n {\n next_layout = tdata->transitions.front();\n layout_data = elm_box_transition_new(2.0, tdata->transitions.back(),\n nullptr, nullptr, next_layout, nullptr, nullptr,\n _test_box_transition_change, tdata);\n box->layout_set(elm_box_layout_transition, layout_data,\n elm_box_transition_free);\n tdata->last_layout = next_layout;\n \n tdata->transitions.push_back(tdata->transitions[0]);\n tdata->transitions.pop_front();\n }\n}\n\nEAPI_MAIN int\nelm_main(int argc, char *argv[])\n{\n elm_policy_set(ELM_POLICY_QUIT, ELM_POLICY_QUIT_LAST_WINDOW_CLOSED);\n\n Transitions_Data tdata;\n Eo* test;\n\n {\n ::elm_win win (elm_win_util_standard_add(\"box-transition\", \"Box Transition\"));\n win.autodel_set(true);\n\n elm_box bigbox ( efl::eo::parent = win );\n ::eo_unref(bigbox._eo_ptr());\n bigbox.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n win.resize_object_add(bigbox);\n bigbox.visibility_set(true);\n\n elm_box buttons ( efl::eo::parent = win );\n ::eo_unref(buttons._eo_ptr());\n buttons.horizontal_set(EINA_TRUE);\n bigbox.pack_end(buttons);\n buttons.visibility_set(true);\n\n elm_button add ( efl::eo::parent = win );\n ::eo_unref(add._eo_ptr());\n add.text_set(\"Add\");\n buttons.pack_end(add);\n add.visibility_set(true);\n add.event_clicked_callback_add\n (std::bind([&tdata]\n {\n if(efl::eina::optional<elm_box> box = tdata.box.lock())\n {\n elm_button btn ( efl::eo::parent = *box );\n btn.text_set(\"I do nothing\");\n efl::eina::list<evas::object> childrens = box->children_get();\n if (!childrens.empty())\n {\n box->pack_after(btn, childrens.front());\n }\n else\n box->pack_end(btn);\n btn.visibility_set(true);\n }\n }));\n\n elm_button clear ( efl::eo::parent = win );\n ::eo_unref(clear._eo_ptr());\n clear.text_set(\"Clear\");\n buttons.pack_end(clear);\n clear.visibility_set(true);\n clear.event_clicked_callback_add(std::bind([&tdata] { tdata.box.lock()->clear(); }));\n\n elm_box dynamic ( efl::eo::parent = win );\n ::eo_unref(dynamic._eo_ptr());\n dynamic.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n dynamic.size_hint_align_set(EVAS_HINT_FILL, EVAS_HINT_FILL);\n bigbox.pack_end(dynamic);\n dynamic.visibility_set(true);\n\n auto unpack = std::bind([&tdata] (evas::clickable_interface obj)\n {\n elm_button btn = efl::eo::downcast<elm_button>(obj);\n tdata.box.lock()->unpack(btn);\n btn.position_set(0, 50);\n btn.color_set(128, 64, 0, 128);\n }, std::placeholders::_1)\n ;\n\n elm_button bt1 ( efl::eo::parent = win );\n ::eo_unref(bt1._eo_ptr());\n bt1.text_set(\"Button 1\");\n bt1.event_clicked_callback_add(unpack);\n bt1.size_hint_weight_set(EVAS_HINT_EXPAND, EVAS_HINT_EXPAND);\n bt1.size_hint_align_set(EVAS_HINT_FILL, EVAS_HINT_FILL);\n dynamic.pack_end(bt1);\n bt1.visibility_set(true);\n\n elm_button bt2 ( efl::eo::parent = win );\n ::eo_unref(bt2._eo_ptr());\n bt2.text_set(\"Button 2\");\n bt2.size_hint_weight_set(EVAS_HINT_EXPAND, 0.0);\n bt2.size_hint_align_set(1.0, 0.5);\n bt2.event_clicked_callback_add(unpack);\n dynamic.pack_end(bt2);\n bt2.visibility_set(true);\n\n elm_button bt3 ( efl::eo::parent = win );\n ::eo_unref(bt3._eo_ptr());\n bt3.text_set(\"Button 3\");\n bt3.event_clicked_callback_add(unpack);\n dynamic.pack_end(bt3);\n bt3.visibility_set(true);\n\n tdata.box = dynamic;\n tdata.last_layout = evas_object_box_layout_horizontal;\n tdata.transitions.push_back(evas_object_box_layout_vertical);\n tdata.transitions.push_back(evas_object_box_layout_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_stack);\n tdata.transitions.push_back(evas_object_box_layout_homogeneous_vertical);\n tdata.transitions.push_back(evas_object_box_layout_homogeneous_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_flow_vertical);\n tdata.transitions.push_back(evas_object_box_layout_flow_horizontal);\n tdata.transitions.push_back(evas_object_box_layout_stack);\n\n dynamic.layout_set(evas_object_box_layout_horizontal, nullptr, nullptr);\n _test_box_transition_change(&tdata);\n \n win.size_set(300, 320);\n win.visibility_set(true);\n\n std::cout << \"references to win \" << win.ref_get() << std::endl;\n test = win._eo_ptr();\n win._release();\n }\n std::cout << \"references to win \" << ::eo_ref_get(test) << std::endl;\n \n elm_run();\n elm_shutdown();\n\n return 0;\n}\nELM_MAIN()\n<|endoftext|>"} {"text":"<commit_before>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"StackGenerator.h\"\n#include \"CastUniquePointer.h\"\n\n#include \"libmesh\/replicated_mesh.h\"\n#include \"libmesh\/distributed_mesh.h\"\n#include \"libmesh\/boundary_info.h\"\n#include \"libmesh\/mesh_modification.h\"\n#include \"libmesh\/bounding_box.h\"\n#include \"libmesh\/mesh_tools.h\"\n#include \"libmesh\/point.h\"\n\n#include <typeinfo>\n\nregisterMooseObject(\"MooseApp\", StackGenerator);\n\ntemplate <>\nInputParameters\nvalidParams<StackGenerator>()\n{\n InputParameters params = validParams<MeshGenerator>();\n\n MooseEnum dims(\"2=2 3=3\");\n params.addRequiredParam<MooseEnum>(\"dim\", dims, \"The dimension of the mesh to be generated\");\n\n params.addRequiredParam<std::vector<MeshGeneratorName>>(\"inputs\",\n \"The meshes we want to stitch together\");\n\n params.addParam<Real>(\"bottom_height\", 0, \"The height of the bottom of the final mesh\");\n\n \/\/ y boundary names (2D case)\n params.addParam<BoundaryName>(\"top_boundary\", \"top\", \"name of the top (y) boundary\");\n params.addParam<BoundaryName>(\"bottom_boundary\", \"bottom\", \"name of the bottom (y) boundary\");\n\n \/\/ z boundary names (3D case)\n params.addParam<BoundaryName>(\"front_boundary\", \"front\", \"name of the front (z) boundary\");\n params.addParam<BoundaryName>(\"back_boundary\", \"back\", \"name of the back (z) boundary\");\n\n params.addClassDescription(\"Use the supplied meshes and stitch them on top of each other\");\n\n return params;\n}\n\nStackGenerator::StackGenerator(const InputParameters & parameters)\n : MeshGenerator(parameters),\n _dim(getParam<MooseEnum>(\"dim\")),\n _input_names(getParam<std::vector<MeshGeneratorName>>(\"inputs\")),\n _bottom_height(getParam<Real>(\"bottom_height\"))\n{\n \/\/ Grab the input meshes\n _mesh_ptrs.reserve(_input_names.size());\n for (auto i = beginIndex(_input_names); i < _input_names.size(); ++i)\n _mesh_ptrs.push_back(&getMeshByName(_input_names[i]));\n}\n\nstd::unique_ptr<MeshBase>\nStackGenerator::generate()\n{\n std::unique_ptr<ReplicatedMesh> mesh = dynamic_pointer_cast<ReplicatedMesh>(*_mesh_ptrs[0]);\n if (mesh == nullptr)\n mooseError(\"StackGenerator only works with ReplicatedMesh : mesh from Meshgenerator \",\n _input_names[0],\n \"is not a ReplicatedMesh.\");\n\n int dim = static_cast<int>(_dim);\n\n if (dim != int(mesh->mesh_dimension()))\n mooseError(\"The first mesh's dimension and the dimension provided don't match !\");\n\n \/\/ Reserve spaces for the other meshes (no need to store the first one another time)\n _meshes.reserve(_input_names.size() - 1);\n\n \/\/ Read in all of the other meshes\n for (auto i = beginIndex(_input_names, 1); i < _input_names.size(); ++i)\n _meshes.push_back(dynamic_pointer_cast<ReplicatedMesh>(*_mesh_ptrs[i]));\n\n \/\/ Check that the casts didn't fail, and that the dimensions match\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n {\n if (_meshes[i] == nullptr)\n mooseError(\"StackGenerator only works with ReplicatedMesh : mesh from Meshgenerator \",\n _input_names[i + 1],\n \"is not a ReplicatedMesh.\");\n if (int(_meshes[i]->mesh_dimension()) != dim)\n mooseError(\"Mesh from MeshGenerator : \", _input_names[i + 1], \" is not in \", _dim, \"D.\");\n }\n\n boundary_id_type first, second;\n\n switch (_dim)\n {\n case 2:\n {\n first = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"top_boundary\"));\n second = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"bottom_boundary\"));\n break;\n }\n case 3:\n {\n first = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"front_boundary\"));\n second = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"back_boundary\"));\n break;\n }\n }\n\n \/\/ Getting the z width of each mesh\n std::vector<Real> heights;\n heights.push_back(computeWidth(*mesh, _dim) + _bottom_height);\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n heights.push_back(computeWidth(*_meshes[i], _dim) + *heights.rbegin());\n\n switch (_dim)\n {\n case 2:\n MeshTools::Modification::translate(*mesh, 0, _bottom_height, 0);\n break;\n case 3:\n MeshTools::Modification::translate(*mesh, 0, 0, _bottom_height);\n break;\n }\n\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n {\n switch (_dim)\n {\n case 2:\n MeshTools::Modification::translate(*_meshes[i], 0, heights[i], 0);\n break;\n case 3:\n MeshTools::Modification::translate(*_meshes[i], 0, 0, heights[i]);\n break;\n }\n mesh->stitch_meshes(\n *_meshes[i], first, second, TOLERANCE, \/*clear_stitched_boundary_ids=*\/true);\n }\n\n return dynamic_pointer_cast<MeshBase>(mesh);\n}\n\nReal\nStackGenerator::computeWidth(const MeshBase & mesh, const int & dim)\n{\n std::set<subdomain_id_type> sub_ids;\n mesh.subdomain_ids(sub_ids);\n BoundingBox bbox(Point(std::numeric_limits<Real>::max(),\n std::numeric_limits<Real>::max(),\n std::numeric_limits<Real>::max()),\n Point(std::numeric_limits<Real>::lowest(),\n std::numeric_limits<Real>::lowest(),\n std::numeric_limits<Real>::lowest()));\n for (auto id : sub_ids)\n {\n BoundingBox sub_bbox = MeshTools::create_subdomain_bounding_box(mesh, id);\n bbox.union_with(sub_bbox);\n }\n\n return bbox.max()(dim - 1) - bbox.min()(dim - 1);\n}\n<commit_msg>Change the boundary ids initialization.<commit_after>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"StackGenerator.h\"\n#include \"CastUniquePointer.h\"\n\n#include \"libmesh\/replicated_mesh.h\"\n#include \"libmesh\/distributed_mesh.h\"\n#include \"libmesh\/boundary_info.h\"\n#include \"libmesh\/mesh_modification.h\"\n#include \"libmesh\/bounding_box.h\"\n#include \"libmesh\/mesh_tools.h\"\n#include \"libmesh\/point.h\"\n\n#include <typeinfo>\n\nregisterMooseObject(\"MooseApp\", StackGenerator);\n\ntemplate <>\nInputParameters\nvalidParams<StackGenerator>()\n{\n InputParameters params = validParams<MeshGenerator>();\n\n MooseEnum dims(\"2=2 3=3\");\n params.addRequiredParam<MooseEnum>(\"dim\", dims, \"The dimension of the mesh to be generated\");\n\n params.addRequiredParam<std::vector<MeshGeneratorName>>(\"inputs\",\n \"The meshes we want to stitch together\");\n\n params.addParam<Real>(\"bottom_height\", 0, \"The height of the bottom of the final mesh\");\n\n \/\/ y boundary names (2D case)\n params.addParam<BoundaryName>(\"top_boundary\", \"top\", \"name of the top (y) boundary\");\n params.addParam<BoundaryName>(\"bottom_boundary\", \"bottom\", \"name of the bottom (y) boundary\");\n\n \/\/ z boundary names (3D case)\n params.addParam<BoundaryName>(\"front_boundary\", \"front\", \"name of the front (z) boundary\");\n params.addParam<BoundaryName>(\"back_boundary\", \"back\", \"name of the back (z) boundary\");\n\n params.addClassDescription(\"Use the supplied meshes and stitch them on top of each other\");\n\n return params;\n}\n\nStackGenerator::StackGenerator(const InputParameters & parameters)\n : MeshGenerator(parameters),\n _dim(getParam<MooseEnum>(\"dim\")),\n _input_names(getParam<std::vector<MeshGeneratorName>>(\"inputs\")),\n _bottom_height(getParam<Real>(\"bottom_height\"))\n{\n \/\/ Grab the input meshes\n _mesh_ptrs.reserve(_input_names.size());\n for (auto i = beginIndex(_input_names); i < _input_names.size(); ++i)\n _mesh_ptrs.push_back(&getMeshByName(_input_names[i]));\n}\n\nstd::unique_ptr<MeshBase>\nStackGenerator::generate()\n{\n std::unique_ptr<ReplicatedMesh> mesh = dynamic_pointer_cast<ReplicatedMesh>(*_mesh_ptrs[0]);\n if (mesh == nullptr)\n mooseError(\"StackGenerator only works with ReplicatedMesh : mesh from Meshgenerator \",\n _input_names[0],\n \"is not a ReplicatedMesh.\");\n\n int dim = static_cast<int>(_dim);\n\n if (dim != int(mesh->mesh_dimension()))\n mooseError(\"The first mesh's dimension and the dimension provided don't match !\");\n\n \/\/ Reserve spaces for the other meshes (no need to store the first one another time)\n _meshes.reserve(_input_names.size() - 1);\n\n \/\/ Read in all of the other meshes\n for (auto i = beginIndex(_input_names, 1); i < _input_names.size(); ++i)\n _meshes.push_back(dynamic_pointer_cast<ReplicatedMesh>(*_mesh_ptrs[i]));\n\n \/\/ Check that the casts didn't fail, and that the dimensions match\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n {\n if (_meshes[i] == nullptr)\n mooseError(\"StackGenerator only works with ReplicatedMesh : mesh from Meshgenerator \",\n _input_names[i + 1],\n \"is not a ReplicatedMesh.\");\n if (int(_meshes[i]->mesh_dimension()) != dim)\n mooseError(\"Mesh from MeshGenerator : \", _input_names[i + 1], \" is not in \", _dim, \"D.\");\n }\n\n boundary_id_type first =\n mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"top_boundary\"));\n boundary_id_type second =\n mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"bottom_boundary\"));\n\n if (dim == 3)\n {\n first = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"front_boundary\"));\n second = mesh->get_boundary_info().get_id_by_name(getParam<BoundaryName>(\"back_boundary\"));\n }\n\n \/\/ Getting the width of each mesh\n std::vector<Real> heights;\n heights.push_back(computeWidth(*mesh, _dim) + _bottom_height);\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n heights.push_back(computeWidth(*_meshes[i], _dim) + *heights.rbegin());\n\n \/\/ Move the first mesh at the provided height\n switch (_dim)\n {\n case 2:\n MeshTools::Modification::translate(*mesh, 0, _bottom_height, 0);\n break;\n case 3:\n MeshTools::Modification::translate(*mesh, 0, 0, _bottom_height);\n break;\n }\n\n \/\/ Move all of the other meshes in the right spots then stitch them one by one to the first one\n for (auto i = beginIndex(_meshes); i < _meshes.size(); ++i)\n {\n switch (_dim)\n {\n case 2:\n MeshTools::Modification::translate(*_meshes[i], 0, heights[i], 0);\n break;\n case 3:\n MeshTools::Modification::translate(*_meshes[i], 0, 0, heights[i]);\n break;\n }\n mesh->stitch_meshes(\n *_meshes[i], first, second, TOLERANCE, \/*clear_stitched_boundary_ids=*\/true);\n }\n\n return dynamic_pointer_cast<MeshBase>(mesh);\n}\n\nReal\nStackGenerator::computeWidth(const MeshBase & mesh, const int & dim)\n{\n std::set<subdomain_id_type> sub_ids;\n mesh.subdomain_ids(sub_ids);\n BoundingBox bbox(Point(std::numeric_limits<Real>::max(),\n std::numeric_limits<Real>::max(),\n std::numeric_limits<Real>::max()),\n Point(std::numeric_limits<Real>::lowest(),\n std::numeric_limits<Real>::lowest(),\n std::numeric_limits<Real>::lowest()));\n for (auto id : sub_ids)\n {\n BoundingBox sub_bbox = MeshTools::create_subdomain_bounding_box(mesh, id);\n bbox.union_with(sub_bbox);\n }\n\n return bbox.max()(dim - 1) - bbox.min()(dim - 1);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/phy\/phy_cntrl.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file phy_cntrl.C\n\/\/\/ @brief Subroutines for the PHY PC registers\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <lib\/phy\/phy_cntrl.H>\n#include <lib\/utils\/scom.H>\n#include <lib\/utils\/c_str.H>\n#include <lib\/utils\/index.H>\n\n#include <lib\/mss_attribute_accessors.H>\n\nusing fapi2::TARGET_TYPE_MCA;\n\nnamespace mss\n{\n\nnamespace pc\n{\n\n\/\/\/\n\/\/\/ @brief Reset the PC CONFIG0 register\n\/\/\/ @param[in] i_target the target (MCA or MBA?)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode reset_config0(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n typedef pcTraits<TARGET_TYPE_MCA> TT;\n\n fapi2::buffer<uint64_t> l_data;\n\n l_data.setBit<TT::DDR4_CMD_SIG_REDUCTION>();\n l_data.setBit<TT::DDR4_VLEVEL_BANK_GROUP>();\n\n FAPI_TRY( write_config0(i_target, l_data) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Reset the PC CONFIG1 register\n\/\/\/ @param[in] i_target <the target (MCA or MBA?)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode reset_config1(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n typedef pcTraits<TARGET_TYPE_MCA> TT;\n\n \/\/ Static table of PHY config values for MEMORY_TYPE.\n \/\/ [EMPTY, RDIMM, CDIMM, or LRDIMM][EMPTY, DDR3 or DDR4]\n constexpr uint64_t memory_type[4][3] =\n {\n { 0, 0, 0 }, \/\/ Empty, never really used.\n { 0, 0b001, 0b101 }, \/\/ RDIMM\n { 0, 0b000, 0b000 }, \/\/ CDIMM bits, UDIMM enum (placeholder, never used on Nimbus)\n { 0, 0b011, 0b111 }, \/\/ LRDIMM\n };\n\n fapi2::buffer<uint64_t> l_data;\n\n uint8_t l_rlo = 0;\n uint8_t l_wlo = 0;\n uint8_t l_dram_gen[MAX_DIMM_PER_PORT] = {0};\n uint8_t l_dimm_type[MAX_DIMM_PER_PORT] = {0};\n uint8_t l_type_index = 0;\n uint8_t l_gen_index = 0;\n\n FAPI_TRY( mss::vpd_mr_dphy_rlo(i_target, l_rlo) );\n FAPI_TRY( mss::vpd_mr_dphy_wlo(i_target, l_wlo) );\n FAPI_TRY( mss::eff_dram_gen(i_target, &(l_dram_gen[0])) );\n FAPI_TRY( mss::eff_dimm_type(i_target, &(l_dimm_type[0])) );\n\n \/\/ There's no way to configure the PHY for more than one value. However, we don't know if there's\n \/\/ a DIMM in one slot, the other or double drop. So we do a little gyration here to make sure\n \/\/ we have one of the two values (and assume effective config caught a bad config)\n l_type_index = l_dimm_type[0] | l_dimm_type[1];\n l_gen_index = l_dram_gen[0] | l_dram_gen[1];\n\n \/\/ FOR NIMBUS PHY (as the protocol choice above is) BRS\n FAPI_TRY( mss::getScom(i_target, MCA_DDRPHY_PC_CONFIG1_P0, l_data) );\n\n l_data.insertFromRight<TT::MEMORY_TYPE, TT::MEMORY_TYPE_LEN>(memory_type[l_type_index][l_gen_index]);\n l_data.insertFromRight<TT::READ_LATENCY_OFFSET, TT::READ_LATENCY_OFFSET_LEN>(l_rlo);\n l_data.insertFromRight<TT::WRITE_LATENCY_OFFSET, TT::WRITE_LATENCY_OFFSET_LEN>(l_wlo);\n\n \/\/ Always set this bit. It forces the PHY to use A12 when figuring out latency. This makes sense in\n \/\/ all cases as A12 is 0 for non-3DS in MR0.\n l_data.setBit<TT::DDR4_LATENCY_SW>();\n\n FAPI_TRY( write_config1(i_target, l_data) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\n} \/\/ close namespace pc\n} \/\/ close namespace mss\n<commit_msg>Update mss_decode_shadow_regs to use library MRS decoders<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/phy\/phy_cntrl.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file phy_cntrl.C\n\/\/\/ @brief Subroutines for the PHY PC registers\n\/\/\/\n\/\/ *HWP HWP Owner: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <lib\/phy\/phy_cntrl.H>\n#include <lib\/utils\/scom.H>\n#include <lib\/utils\/c_str.H>\n#include <lib\/utils\/index.H>\n\n#include <lib\/mss_attribute_accessors.H>\n\nusing fapi2::TARGET_TYPE_MCA;\n\nnamespace mss\n{\n\n\/\/ Definition of the PHY PC MR shadow registers\n\/\/ indexed by [rank_pair][MR index]\nconst std::vector< std::vector<uint64_t> > pcTraits<TARGET_TYPE_MCA>::PC_MR_SHADOW_REGS =\n{\n {\n MCA_DDRPHY_PC_MR0_PRI_RP0_P0,\n MCA_DDRPHY_PC_MR1_PRI_RP0_P0,\n MCA_DDRPHY_PC_MR2_PRI_RP0_P0,\n MCA_DDRPHY_PC_MR3_PRI_RP0_P0,\n MCA_DDRPHY_PC_MR0_SEC_RP0_P0,\n MCA_DDRPHY_PC_MR1_SEC_RP0_P0,\n MCA_DDRPHY_PC_MR2_SEC_RP0_P0,\n },\n {\n MCA_DDRPHY_PC_MR0_PRI_RP1_P0,\n MCA_DDRPHY_PC_MR1_PRI_RP1_P0,\n MCA_DDRPHY_PC_MR2_PRI_RP1_P0,\n MCA_DDRPHY_PC_MR3_PRI_RP1_P0,\n MCA_DDRPHY_PC_MR0_SEC_RP1_P0,\n MCA_DDRPHY_PC_MR1_SEC_RP1_P0,\n MCA_DDRPHY_PC_MR2_SEC_RP1_P0,\n },\n {\n MCA_DDRPHY_PC_MR0_PRI_RP2_P0,\n MCA_DDRPHY_PC_MR1_PRI_RP2_P0,\n MCA_DDRPHY_PC_MR2_PRI_RP2_P0,\n MCA_DDRPHY_PC_MR3_PRI_RP2_P0,\n MCA_DDRPHY_PC_MR0_SEC_RP2_P0,\n MCA_DDRPHY_PC_MR1_SEC_RP2_P0,\n MCA_DDRPHY_PC_MR2_SEC_RP2_P0,\n },\n {\n MCA_DDRPHY_PC_MR0_PRI_RP3_P0,\n MCA_DDRPHY_PC_MR1_PRI_RP3_P0,\n MCA_DDRPHY_PC_MR2_PRI_RP3_P0,\n MCA_DDRPHY_PC_MR3_PRI_RP3_P0,\n MCA_DDRPHY_PC_MR0_SEC_RP3_P0,\n MCA_DDRPHY_PC_MR1_SEC_RP3_P0,\n MCA_DDRPHY_PC_MR2_SEC_RP3_P0,\n },\n};\n\nnamespace pc\n{\n\n\/\/\/\n\/\/\/ @brief Reset the PC CONFIG0 register\n\/\/\/ @param[in] i_target the target (MCA or MBA?)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode reset_config0(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n typedef pcTraits<TARGET_TYPE_MCA> TT;\n\n fapi2::buffer<uint64_t> l_data;\n\n l_data.setBit<TT::DDR4_CMD_SIG_REDUCTION>();\n l_data.setBit<TT::DDR4_VLEVEL_BANK_GROUP>();\n\n FAPI_TRY( write_config0(i_target, l_data) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Reset the PC CONFIG1 register\n\/\/\/ @param[in] i_target <the target (MCA or MBA?)\n\/\/\/ @return FAPI2_RC_SUCCESS if and only if ok\n\/\/\/\ntemplate<>\nfapi2::ReturnCode reset_config1(const fapi2::Target<TARGET_TYPE_MCA>& i_target)\n{\n typedef pcTraits<TARGET_TYPE_MCA> TT;\n\n \/\/ Static table of PHY config values for MEMORY_TYPE.\n \/\/ [EMPTY, RDIMM, CDIMM, or LRDIMM][EMPTY, DDR3 or DDR4]\n constexpr uint64_t memory_type[4][3] =\n {\n { 0, 0, 0 }, \/\/ Empty, never really used.\n { 0, 0b001, 0b101 }, \/\/ RDIMM\n { 0, 0b000, 0b000 }, \/\/ CDIMM bits, UDIMM enum (placeholder, never used on Nimbus)\n { 0, 0b011, 0b111 }, \/\/ LRDIMM\n };\n\n fapi2::buffer<uint64_t> l_data;\n\n uint8_t l_rlo = 0;\n uint8_t l_wlo = 0;\n uint8_t l_dram_gen[MAX_DIMM_PER_PORT] = {0};\n uint8_t l_dimm_type[MAX_DIMM_PER_PORT] = {0};\n uint8_t l_type_index = 0;\n uint8_t l_gen_index = 0;\n\n FAPI_TRY( mss::vpd_mr_dphy_rlo(i_target, l_rlo) );\n FAPI_TRY( mss::vpd_mr_dphy_wlo(i_target, l_wlo) );\n FAPI_TRY( mss::eff_dram_gen(i_target, &(l_dram_gen[0])) );\n FAPI_TRY( mss::eff_dimm_type(i_target, &(l_dimm_type[0])) );\n\n \/\/ There's no way to configure the PHY for more than one value. However, we don't know if there's\n \/\/ a DIMM in one slot, the other or double drop. So we do a little gyration here to make sure\n \/\/ we have one of the two values (and assume effective config caught a bad config)\n l_type_index = l_dimm_type[0] | l_dimm_type[1];\n l_gen_index = l_dram_gen[0] | l_dram_gen[1];\n\n \/\/ FOR NIMBUS PHY (as the protocol choice above is) BRS\n FAPI_TRY( mss::getScom(i_target, MCA_DDRPHY_PC_CONFIG1_P0, l_data) );\n\n l_data.insertFromRight<TT::MEMORY_TYPE, TT::MEMORY_TYPE_LEN>(memory_type[l_type_index][l_gen_index]);\n l_data.insertFromRight<TT::READ_LATENCY_OFFSET, TT::READ_LATENCY_OFFSET_LEN>(l_rlo);\n l_data.insertFromRight<TT::WRITE_LATENCY_OFFSET, TT::WRITE_LATENCY_OFFSET_LEN>(l_wlo);\n\n \/\/ Always set this bit. It forces the PHY to use A12 when figuring out latency. This makes sense in\n \/\/ all cases as A12 is 0 for non-3DS in MR0.\n l_data.setBit<TT::DDR4_LATENCY_SW>();\n\n FAPI_TRY( write_config1(i_target, l_data) );\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\n} \/\/ close namespace pc\n} \/\/ close namespace mss\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Simple cache model for predicting miss rates.\n *\n * By Eric Anger <eanger@lanl.gov>\n *\/\n\n#include <algorithm>\n#include <iterator>\n\n#include \"byfl.h\"\n\nnamespace bytesflops {}\nusing namespace bytesflops;\nusing namespace std;\n\nclass Cache {\n public:\n void access(uint64_t baseaddr, uint64_t numaddrs);\n Cache(uint64_t line_size) : line_size_{line_size}, accesses_{0} {}\n uint64_t getAccesses() const { return accesses_; }\n vector<uint64_t> getHits() const { return hits_; }\n\n private:\n vector<uint64_t> lines_; \/\/ back is mru, front is lru\n uint64_t line_size_;\n uint64_t accesses_;\n vector<uint64_t> hits_; \/\/ back is lru, front is mru\n};\n\nvoid Cache::access(uint64_t baseaddr, uint64_t numaddrs){\n uint64_t num_accesses = 0; \/\/ running total of number of lines accessed\n for(uint64_t addr = baseaddr \/ line_size_ * line_size_;\n addr <= (baseaddr + numaddrs ) \/ line_size_ * line_size_;\n addr += line_size_){\n ++num_accesses;\n auto line = lines_.rbegin();\n auto hit = begin(hits_);\n bool found = false;\n for(; line != lines_.rend(); ++line, ++hit){\n if(addr == *line){\n found = true;\n ++(*hit);\n \/\/ erase the line pointed to by this reverse iterator. see\n \/\/ stackoverflow.com\/questions\/1830158\/how-to-call-erase-with-a-reverse-iterator\n lines_.erase((line + 1).base());\n break;\n }\n }\n\n if(!found){\n \/\/ make a new entry containing all previous hits plus any that occur \n \/\/ this time\n hits_.push_back(1); \/\/\/\/TODO I think this is the broke part. Should just be one?\n }\n\n \/\/ move up this address to mru position\n lines_.push_back(addr);\n }\n\n \/\/ we've made all our accesses\n accesses_ += num_accesses;\n}\n\nstatic Cache* cache = NULL;\n\nnamespace bytesflops{\n\nvoid initialize_cache(void){\n cache = new Cache(bf_line_size);\n}\n\n\/\/ Access the cache model with this address.\nvoid bf_touch_cache(uint64_t baseaddr, uint64_t numaddrs){\n cache->access(baseaddr, numaddrs);\n}\n\n\/\/ Get cache accesses\nuint64_t bf_get_cache_accesses(void){\n return cache->getAccesses();\n}\n\n\/\/ Get cache hits\nvector<uint64_t> bf_get_cache_hits(void){\n \/\/ The total hits to a cache size N is equal to the sum of unique hits to \n \/\/ all caches sized N or smaller.\n auto hits = cache->getHits();\n vector<uint64_t> tot_hits(hits.size());\n uint64_t prev_hits = 0;\n for(uint64_t i = 0; i < hits.size(); ++i){\n tot_hits[i] = hits[i] + prev_hits;\n prev_hits = tot_hits[i];\n }\n return tot_hits;\n}\n\n} \/\/ namespace bytesflops\n<commit_msg>Deduct cold misses from reported total hits.<commit_after>\/*\n * Simple cache model for predicting miss rates.\n *\n * By Eric Anger <eanger@lanl.gov>\n *\/\n\n#include <algorithm>\n#include <iterator>\n\n#include \"byfl.h\"\n\nnamespace bytesflops {}\nusing namespace bytesflops;\nusing namespace std;\n\nclass Cache {\n public:\n void access(uint64_t baseaddr, uint64_t numaddrs);\n Cache(uint64_t line_size) : line_size_{line_size}, accesses_{0},\n cold_misses_{0} {}\n uint64_t getAccesses() const { return accesses_; }\n vector<uint64_t> getHits() const { return hits_; }\n uint64_t getColdMisses() const { return cold_misses_; }\n\n private:\n vector<uint64_t> lines_; \/\/ back is mru, front is lru\n uint64_t line_size_;\n uint64_t accesses_;\n uint64_t cold_misses_;\n vector<uint64_t> hits_; \/\/ back is lru, front is mru\n};\n\nvoid Cache::access(uint64_t baseaddr, uint64_t numaddrs){\n uint64_t num_accesses = 0; \/\/ running total of number of lines accessed\n for(uint64_t addr = baseaddr \/ line_size_ * line_size_;\n addr <= (baseaddr + numaddrs ) \/ line_size_ * line_size_;\n addr += line_size_){\n ++num_accesses;\n auto line = lines_.rbegin();\n auto hit = begin(hits_);\n bool found = false;\n for(; line != lines_.rend(); ++line, ++hit){\n if(addr == *line){\n found = true;\n ++(*hit);\n \/\/ erase the line pointed to by this reverse iterator. see\n \/\/ stackoverflow.com\/questions\/1830158\/how-to-call-erase-with-a-reverse-iterator\n lines_.erase((line + 1).base());\n break;\n }\n }\n\n if(!found){\n \/\/ add a new hit entry with this hit\n hits_.push_back(1);\n \/\/ this is a cold miss since we've never seen the line before.\n ++cold_misses_;\n }\n\n \/\/ move up this address to mru position\n lines_.push_back(addr);\n }\n\n \/\/ we've made all our accesses\n accesses_ += num_accesses;\n}\n\nstatic Cache* cache = NULL;\n\nnamespace bytesflops{\n\nvoid initialize_cache(void){\n cache = new Cache(bf_line_size);\n}\n\n\/\/ Access the cache model with this address.\nvoid bf_touch_cache(uint64_t baseaddr, uint64_t numaddrs){\n cache->access(baseaddr, numaddrs);\n}\n\n\/\/ Get cache accesses\nuint64_t bf_get_cache_accesses(void){\n return cache->getAccesses();\n}\n\n\/\/ Get cache hits\nvector<uint64_t> bf_get_cache_hits(void){\n \/\/ The total hits to a cache size N is equal to the sum of unique hits to \n \/\/ all caches sized N or smaller.\n auto hits = cache->getHits();\n auto cold_misses = cache->getColdMisses();\n vector<uint64_t> tot_hits(hits.size());\n uint64_t prev_hits = 0;\n for(uint64_t i = 0; i < hits.size(); ++i){\n tot_hits[i] = hits[i] + prev_hits;\n if(i == 0){\n \/\/ remove cold misses from all cache sizes\n tot_hits[i] -= cold_misses;\n }\n prev_hits = tot_hits[i];\n }\n return tot_hits;\n}\n\n} \/\/ namespace bytesflops\n<|endoftext|>"} {"text":"<commit_before>\/\/\r\n\/\/ Copyright (c) 2008-2014 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Context.h\"\r\n#include \"Sprite2D.h\"\r\n#include \"StaticSprite2D.h\"\r\n#include \"Texture2D.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nextern const char* URHO2D_CATEGORY;\r\n\r\nStaticSprite2D::StaticSprite2D(Context* context) :\r\n Drawable2D(context),\r\n flipX_(false),\r\n flipY_(false),\r\n color_(Color::WHITE)\r\n{\r\n vertices_.Reserve(6);\r\n}\r\n\r\nStaticSprite2D::~StaticSprite2D()\r\n{\r\n}\r\n\r\nvoid StaticSprite2D::RegisterObject(Context* context)\r\n{\r\n context->RegisterFactory<StaticSprite2D>(URHO2D_CATEGORY);\r\n ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_BOOL, \"Flip X\", GetFlipX, SetFlipX, bool, false, AM_DEFAULT);\r\n ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_BOOL, \"Flip Y\", GetFlipY, SetFlipY, bool, false, AM_DEFAULT);\r\n REF_ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_COLOR, \"Color\", GetColor, SetColor, Color, Color::WHITE, AM_DEFAULT);\r\n COPY_BASE_ATTRIBUTES(StaticSprite2D, Drawable2D);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlip(bool flipX, bool flipY)\r\n{\r\n if (flipX_ == flipX && flipY_ == flipY)\r\n return;\r\n\r\n flipX_ = flipX;\r\n flipY_ = flipY;\r\n \/\/ Assume flipping does not invalidate bounding rectangle\r\n verticesDirty_ = true;\r\n geometryDirty_ = true;\r\n MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipX(bool flipX)\r\n{\r\n SetFlip(flipX, flipY_);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipY(bool flipY)\r\n{\r\n SetFlip(flipX_, flipY);\r\n}\r\n\r\nvoid StaticSprite2D::SetColor(const Color& color)\r\n{\r\n if (color == color_)\r\n return;\r\n\r\n color_ = color;\r\n verticesDirty_ = true;\r\n geometryDirty_ = true;\r\n MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::UpdateVertices()\r\n{\r\n if (!verticesDirty_)\r\n return;\r\n\r\n vertices_.Clear();\r\n\r\n if (!sprite_)\r\n return;\r\n\r\n Texture2D* texture = sprite_->GetTexture();\r\n if (!texture)\r\n return;\r\n\r\n const IntRect& rectangle_ = sprite_->GetRectangle();\r\n if (rectangle_.Width() == 0 || rectangle_.Height() == 0)\r\n return;\r\n\r\n \/*\r\n V1 --------V2\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n V0 --------V3\r\n *\/\r\n Vertex2D vertex0;\r\n Vertex2D vertex1;\r\n Vertex2D vertex2;\r\n Vertex2D vertex3;\r\n\r\n float unitsPerPixel = 1.0f \/ pixelsPerUnit_;\r\n float width = (float)rectangle_.Width() * unitsPerPixel;\r\n float height = (float)rectangle_.Height() * unitsPerPixel;\r\n\r\n const Vector2& hotSpot = sprite_->GetHotSpot();\r\n float hotSpotX = flipX_ ? (1.0f - hotSpot.x_) : hotSpot.x_;\r\n float hotSpotY = flipY_ ? (1.0f - hotSpot.y_) : hotSpot.y_;\r\n\r\n float leftX = -width * hotSpotX;\r\n float rightX = width * (1.0f - hotSpotX);\r\n float bottomY = -height * hotSpotY;\r\n float topY = height * (1.0f - hotSpotY);\r\n vertex0.position_ = Vector3(leftX, bottomY, zValue_);\r\n vertex1.position_ = Vector3(leftX, topY, zValue_);\r\n vertex2.position_ = Vector3(rightX, topY, zValue_);\r\n vertex3.position_ = Vector3(rightX, bottomY, zValue_);\r\n\r\n float invTexW = 1.0f \/ (float)texture->GetWidth();\r\n float invTexH = 1.0f \/ (float)texture->GetHeight();\r\n\r\n float leftU = rectangle_.left_ * invTexW;\r\n float rightU = rectangle_.right_ * invTexW;\r\n float topV = rectangle_.top_ * invTexH; \r\n float bottomV = rectangle_.bottom_ * invTexH;\r\n vertex0.uv_ = Vector2(leftU, bottomV);\r\n vertex1.uv_ = Vector2(leftU, topV);\r\n vertex2.uv_ = Vector2(rightU, topV);\r\n vertex3.uv_ = Vector2(rightU, bottomV);\r\n\r\n if (flipX_)\r\n {\r\n Swap(vertex0.uv_.x_, vertex3.uv_.x_);\r\n Swap(vertex1.uv_.x_, vertex2.uv_.x_);\r\n }\r\n \r\n if (flipY_)\r\n {\r\n Swap(vertex0.uv_.y_, vertex1.uv_.y_);\r\n Swap(vertex2.uv_.y_, vertex3.uv_.y_);\r\n }\r\n\r\n vertex0.color_ = vertex1.color_ = vertex2.color_ = vertex3.color_ = color_.ToUInt();\r\n\r\n vertices_.Push(vertex0);\r\n vertices_.Push(vertex1);\r\n vertices_.Push(vertex2);\r\n vertices_.Push(vertex3);\r\n\r\n geometryDirty_ = true;\r\n verticesDirty_ = false;\r\n}\r\n\r\n}\r\n<commit_msg>Minor change for comment.<commit_after>\/\/\r\n\/\/ Copyright (c) 2008-2014 the Urho3D project.\r\n\/\/\r\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\r\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\r\n\/\/ in the Software without restriction, including without limitation the rights\r\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n\/\/ copies of the Software, and to permit persons to whom the Software is\r\n\/\/ furnished to do so, subject to the following conditions:\r\n\/\/\r\n\/\/ The above copyright notice and this permission notice shall be included in\r\n\/\/ all copies or substantial portions of the Software.\r\n\/\/\r\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n\/\/ THE SOFTWARE.\r\n\/\/\r\n\r\n#include \"Precompiled.h\"\r\n#include \"Context.h\"\r\n#include \"Sprite2D.h\"\r\n#include \"StaticSprite2D.h\"\r\n#include \"Texture2D.h\"\r\n\r\n#include \"DebugNew.h\"\r\n\r\nnamespace Urho3D\r\n{\r\n\r\nextern const char* URHO2D_CATEGORY;\r\n\r\nStaticSprite2D::StaticSprite2D(Context* context) :\r\n Drawable2D(context),\r\n flipX_(false),\r\n flipY_(false),\r\n color_(Color::WHITE)\r\n{\r\n vertices_.Reserve(6);\r\n}\r\n\r\nStaticSprite2D::~StaticSprite2D()\r\n{\r\n}\r\n\r\nvoid StaticSprite2D::RegisterObject(Context* context)\r\n{\r\n context->RegisterFactory<StaticSprite2D>(URHO2D_CATEGORY);\r\n ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_BOOL, \"Flip X\", GetFlipX, SetFlipX, bool, false, AM_DEFAULT);\r\n ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_BOOL, \"Flip Y\", GetFlipY, SetFlipY, bool, false, AM_DEFAULT);\r\n REF_ACCESSOR_ATTRIBUTE(StaticSprite2D, VAR_COLOR, \"Color\", GetColor, SetColor, Color, Color::WHITE, AM_DEFAULT);\r\n COPY_BASE_ATTRIBUTES(StaticSprite2D, Drawable2D);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlip(bool flipX, bool flipY)\r\n{\r\n if (flipX_ == flipX && flipY_ == flipY)\r\n return;\r\n\r\n flipX_ = flipX;\r\n flipY_ = flipY;\r\n \/\/ Assume flipping does not invalidate bounding rectangle\r\n verticesDirty_ = true;\r\n geometryDirty_ = true;\r\n MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipX(bool flipX)\r\n{\r\n SetFlip(flipX, flipY_);\r\n}\r\n\r\nvoid StaticSprite2D::SetFlipY(bool flipY)\r\n{\r\n SetFlip(flipX_, flipY);\r\n}\r\n\r\nvoid StaticSprite2D::SetColor(const Color& color)\r\n{\r\n if (color == color_)\r\n return;\r\n\r\n color_ = color;\r\n verticesDirty_ = true;\r\n geometryDirty_ = true;\r\n MarkNetworkUpdate();\r\n}\r\n\r\nvoid StaticSprite2D::UpdateVertices()\r\n{\r\n if (!verticesDirty_)\r\n return;\r\n\r\n vertices_.Clear();\r\n\r\n if (!sprite_)\r\n return;\r\n\r\n Texture2D* texture = sprite_->GetTexture();\r\n if (!texture)\r\n return;\r\n\r\n const IntRect& rectangle_ = sprite_->GetRectangle();\r\n if (rectangle_.Width() == 0 || rectangle_.Height() == 0)\r\n return;\r\n\r\n \/*\r\n V1---------V2\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n | \/ |\r\n V0---------V3\r\n *\/\r\n Vertex2D vertex0;\r\n Vertex2D vertex1;\r\n Vertex2D vertex2;\r\n Vertex2D vertex3;\r\n\r\n float unitsPerPixel = 1.0f \/ pixelsPerUnit_;\r\n float width = (float)rectangle_.Width() * unitsPerPixel;\r\n float height = (float)rectangle_.Height() * unitsPerPixel;\r\n\r\n const Vector2& hotSpot = sprite_->GetHotSpot();\r\n float hotSpotX = flipX_ ? (1.0f - hotSpot.x_) : hotSpot.x_;\r\n float hotSpotY = flipY_ ? (1.0f - hotSpot.y_) : hotSpot.y_;\r\n\r\n float leftX = -width * hotSpotX;\r\n float rightX = width * (1.0f - hotSpotX);\r\n float bottomY = -height * hotSpotY;\r\n float topY = height * (1.0f - hotSpotY);\r\n vertex0.position_ = Vector3(leftX, bottomY, zValue_);\r\n vertex1.position_ = Vector3(leftX, topY, zValue_);\r\n vertex2.position_ = Vector3(rightX, topY, zValue_);\r\n vertex3.position_ = Vector3(rightX, bottomY, zValue_);\r\n\r\n float invTexW = 1.0f \/ (float)texture->GetWidth();\r\n float invTexH = 1.0f \/ (float)texture->GetHeight();\r\n\r\n float leftU = rectangle_.left_ * invTexW;\r\n float rightU = rectangle_.right_ * invTexW;\r\n float topV = rectangle_.top_ * invTexH; \r\n float bottomV = rectangle_.bottom_ * invTexH;\r\n vertex0.uv_ = Vector2(leftU, bottomV);\r\n vertex1.uv_ = Vector2(leftU, topV);\r\n vertex2.uv_ = Vector2(rightU, topV);\r\n vertex3.uv_ = Vector2(rightU, bottomV);\r\n\r\n if (flipX_)\r\n {\r\n Swap(vertex0.uv_.x_, vertex3.uv_.x_);\r\n Swap(vertex1.uv_.x_, vertex2.uv_.x_);\r\n }\r\n \r\n if (flipY_)\r\n {\r\n Swap(vertex0.uv_.y_, vertex1.uv_.y_);\r\n Swap(vertex2.uv_.y_, vertex3.uv_.y_);\r\n }\r\n\r\n vertex0.color_ = vertex1.color_ = vertex2.color_ = vertex3.color_ = color_.ToUInt();\r\n\r\n vertices_.Push(vertex0);\r\n vertices_.Push(vertex1);\r\n vertices_.Push(vertex2);\r\n vertices_.Push(vertex3);\r\n\r\n geometryDirty_ = true;\r\n verticesDirty_ = false;\r\n}\r\n\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"KmlDocumentTagHandler.h\"\n\n#include \"MarbleDebug.h\"\n\n#include \"KmlElementDictionary.h\"\n#include \"KmlObjectTagHandler.h\"\n#include \"GeoDataDocument.h\"\n#include \"GeoDataFolder.h\"\n#include \"GeoDataParser.h\"\n\nnamespace Marble\n{\nnamespace kml\n{\nKML_DEFINE_TAG_HANDLER(Document)\n\nGeoNode* KmlDocumentTagHandler::parse(GeoParser& parser) const\n{\n Q_ASSERT(parser.isStartElement() && parser.isValidElement(kmlTag_Document));\n\n GeoStackItem parentItem = parser.parentElement();\n if( !(parentItem.qualifiedName().first.isNull() && parentItem.qualifiedName().second.isNull()) ) {\n \/\/ this happens if there is a parent element to the Document tag. We can work around that and simply expect that\n \/\/ the new Document tag works like a Folder\n if( parentItem.represents( kmlTag_Folder ) || parentItem.represents( kmlTag_Document ) ) {\n GeoDataDocument *document = new GeoDataDocument;\n KmlObjectTagHandler::parseIdentifiers( parser, document );\n parentItem.nodeAs<GeoDataContainer>()->append( document );\n\n return document;\n }\n else if ( parentItem.qualifiedName().first == kmlTag_kml)\n {\n GeoDataDocument* doc = geoDataDoc( parser );\n return doc;\n }\n }\n return 0;\n}\n\n}\n}\n<commit_msg>Root document tags can have ids as well<commit_after>\/*\n Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org>\n\n This file is part of the KDE project\n\n This library is free software you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n aint with this library see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n Boston, MA 02110-1301, USA.\n*\/\n\n#include \"KmlDocumentTagHandler.h\"\n\n#include \"MarbleDebug.h\"\n\n#include \"KmlElementDictionary.h\"\n#include \"KmlObjectTagHandler.h\"\n#include \"GeoDataDocument.h\"\n#include \"GeoDataFolder.h\"\n#include \"GeoDataParser.h\"\n\nnamespace Marble\n{\nnamespace kml\n{\nKML_DEFINE_TAG_HANDLER(Document)\n\nGeoNode* KmlDocumentTagHandler::parse(GeoParser& parser) const\n{\n Q_ASSERT(parser.isStartElement() && parser.isValidElement(kmlTag_Document));\n\n GeoStackItem parentItem = parser.parentElement();\n if( !(parentItem.qualifiedName().first.isNull() && parentItem.qualifiedName().second.isNull()) ) {\n \/\/ this happens if there is a parent element to the Document tag. We can work around that and simply expect that\n \/\/ the new Document tag works like a Folder\n if( parentItem.represents( kmlTag_Folder ) || parentItem.represents( kmlTag_Document ) ) {\n GeoDataDocument *document = new GeoDataDocument;\n KmlObjectTagHandler::parseIdentifiers( parser, document );\n parentItem.nodeAs<GeoDataContainer>()->append( document );\n\n return document;\n }\n else if ( parentItem.qualifiedName().first == kmlTag_kml)\n {\n GeoDataDocument* doc = geoDataDoc( parser );\n KmlObjectTagHandler::parseIdentifiers( parser, doc );\n return doc;\n }\n }\n return 0;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"itkVariableLengthVector.h\"\n#include \"otbChangeLabelImageFilter.h\"\n#include \"otbStandardWriterWatcher.h\"\n#include \"otbStatisticsXMLFileReader.h\"\n#include \"otbShiftScaleVectorImageFilter.h\"\n#include \"otbImageClassificationFilter.h\"\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"otbImageToVectorImageCastFilter.h\"\n#include \"otbMachineLearningModelFactory.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass ImageClassifier : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef ImageClassifier Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(ImageClassifier, otb::Application);\n\n \/** Filters typedef *\/\n typedef itk::VariableLengthVector<FloatVectorImageType::InternalPixelType> MeasurementType;\n typedef otb::StatisticsXMLFileReader<MeasurementType> StatisticsReader;\n typedef otb::ShiftScaleVectorImageFilter<FloatVectorImageType, FloatVectorImageType> RescalerType;\n typedef otb::ImageClassificationFilter<FloatVectorImageType, UInt32ImageType> ClassificationFilterType;\n typedef ClassificationFilterType::Pointer ClassificationFilterPointerType;\n typedef ClassificationFilterType::ModelType ModelType;\n typedef ModelType::Pointer ModelPointerType;\n typedef ClassificationFilterType::ValueType ValueType;\n typedef ClassificationFilterType::LabelType LabelType;\n typedef otb::MachineLearningModelFactory<ValueType, LabelType> MachineLearningModelFactoryType;\n\nprivate:\n void DoInit()\n {\n SetName(\"ImageClassifier\");\n SetDescription(\"Performs a classification of the input image according to a model file.\");\n\n \/\/ Documentation\n SetDocName(\"Image Classification\");\n SetDocLongDescription(\"This application performs an image classification based on a model file (*.txt extension) produced by the TrainImagesClassifier application. Pixels of the output image will contain the class label decided by the classifier. The input pixels can be optionnaly centered and reduced according to the statistics file produced by the ComputeImagesStatistics application. An optional input mask can be provided, in which case only input image pixels whose corresponding mask value is greater than 0 will be classified. The remaining of pixels will be given the label 0 in the output image.\");\n\n SetDocLimitations(\"The input image must have the same type, order and number of bands than the images used to produce the statistics file and the SVM model file. If a statistics file was used during training by the TrainImagesClassifier, it is mandatory to use the same statistics file for classification. If an input mask is used, its size must match the input image size.\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"TrainImagesClassifier, ValidateImagesClassifier, ComputeImagesStatistics\");\n\n AddDocTag(Tags::Learning);\n\n AddParameter(ParameterType_InputImage, \"in\", \"Input Image\");\n SetParameterDescription( \"in\", \"The input image to classify.\");\n\n AddParameter(ParameterType_InputImage, \"mask\", \"Input Mask\");\n SetParameterDescription( \"mask\", \"The mask allows to restrict classification of the input image to the area where mask pixel values are greater than 0.\");\n MandatoryOff(\"mask\");\n\n AddParameter(ParameterType_InputFilename, \"model\", \"Model file\");\n SetParameterDescription(\"model\", \"A model file (*.txt extension, produced by TrainImagesClassifier application).\");\n\n AddParameter(ParameterType_InputFilename, \"imstat\", \"Statistics file\");\n SetParameterDescription(\"imstat\", \"A XML file containing mean and standard deviation to center and reduce samples before classification (produced by ComputeImagesStatistics application).\");\n MandatoryOff(\"imstat\");\n\n AddParameter(ParameterType_OutputImage, \"out\", \"Output Image\");\n SetParameterDescription( \"out\", \"Output image containing class labels\");\n SetParameterOutputImagePixelType( \"out\", ImagePixelType_uint8);\n\n AddRAMParameter();\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"in\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"imstat\", \"EstimateImageStatisticsQB1.xml\");\n SetDocExampleParameterValue(\"model\", \"clsvmModelQB1.svm\");\n SetDocExampleParameterValue(\"out\", \"clLabeledImageQB1.tif\");\n }\n\n void DoUpdateParameters()\n {\n \/\/ Nothing to do here : all parameters are independent\n }\n\n void DoExecute()\n {\n \/\/ Load input image\n FloatVectorImageType::Pointer inImage = GetParameterImage(\"in\");\n inImage->UpdateOutputInformation();\n\n \/\/ Load svm model\n otbAppLogINFO(\"Loading model\");\n m_Model = MachineLearningModelFactoryType::CreateMachineLearningModel(GetParameterString(\"model\"),\n MachineLearningModelFactoryType::ReadMode);\n m_Model->Load(GetParameterString(\"model\"));\n otbAppLogINFO(\"Model loaded\");\n\n \/\/ Normalize input image (optional)\n StatisticsReader::Pointer statisticsReader = StatisticsReader::New();\n MeasurementType meanMeasurementVector;\n MeasurementType stddevMeasurementVector;\n m_Rescaler = RescalerType::New();\n\n \/\/ Classify\n m_ClassificationFilter = ClassificationFilterType::New();\n m_ClassificationFilter->SetModel(m_Model);\n\n \/\/ Normalize input image if asked\n if(IsParameterEnabled(\"imstat\") )\n {\n otbAppLogINFO(\"Input image normalization activated.\");\n \/\/ Load input image statistics\n statisticsReader->SetFileName(GetParameterString(\"imstat\"));\n meanMeasurementVector = statisticsReader->GetStatisticVectorByName(\"mean\");\n stddevMeasurementVector = statisticsReader->GetStatisticVectorByName(\"stddev\");\n otbAppLogINFO( \"mean used: \" << meanMeasurementVector );\n otbAppLogINFO( \"standard deviation used: \" << stddevMeasurementVector );\n \/\/ Rescale vector image\n m_Rescaler->SetScale(stddevMeasurementVector);\n m_Rescaler->SetShift(meanMeasurementVector);\n m_Rescaler->SetInput(inImage);\n\n m_ClassificationFilter->SetInput(m_Rescaler->GetOutput());\n }\n else\n {\n otbAppLogINFO(\"Input image normalization deactivated.\");\n m_ClassificationFilter->SetInput(inImage);\n }\n\n\n if(IsParameterEnabled(\"mask\"))\n {\n otbAppLogINFO(\"Using input mask\");\n \/\/ Load mask image and cast into LabeledImageType\n UInt32ImageType::Pointer inMask = GetParameterUInt32Image(\"mask\");\n\n m_ClassificationFilter->SetInputMask(inMask);\n }\n\n SetParameterOutputImage<UInt32ImageType>(\"out\", m_ClassificationFilter->GetOutput());\n }\n\n ClassificationFilterType::Pointer m_ClassificationFilter;\n ModelPointerType m_Model;\n RescalerType::Pointer m_Rescaler;\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::ImageClassifier)\n<commit_msg>ENH: ImageClassifier application: generation of classification maps with maximal labels equal to 65535<commit_after>\/*=========================================================================\n\n Program: ORFEO Toolbox\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n\n Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.\n See OTBCopyright.txt for details.\n\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"otbWrapperApplication.h\"\n#include \"otbWrapperApplicationFactory.h\"\n\n#include \"itkVariableLengthVector.h\"\n#include \"otbChangeLabelImageFilter.h\"\n#include \"otbStandardWriterWatcher.h\"\n#include \"otbStatisticsXMLFileReader.h\"\n#include \"otbShiftScaleVectorImageFilter.h\"\n#include \"otbImageClassificationFilter.h\"\n#include \"otbMultiToMonoChannelExtractROI.h\"\n#include \"otbImageToVectorImageCastFilter.h\"\n#include \"otbMachineLearningModelFactory.h\"\n\nnamespace otb\n{\nnamespace Wrapper\n{\n\nclass ImageClassifier : public Application\n{\npublic:\n \/** Standard class typedefs. *\/\n typedef ImageClassifier Self;\n typedef Application Superclass;\n typedef itk::SmartPointer<Self> Pointer;\n typedef itk::SmartPointer<const Self> ConstPointer;\n\n \/** Standard macro *\/\n itkNewMacro(Self);\n\n itkTypeMacro(ImageClassifier, otb::Application);\n\n \/** Filters typedef *\/\n typedef UInt16ImageType OutputImageType;\n typedef UInt8ImageType MaskImageType;\n typedef itk::VariableLengthVector<FloatVectorImageType::InternalPixelType> MeasurementType;\n typedef otb::StatisticsXMLFileReader<MeasurementType> StatisticsReader;\n typedef otb::ShiftScaleVectorImageFilter<FloatVectorImageType, FloatVectorImageType> RescalerType;\n typedef otb::ImageClassificationFilter<FloatVectorImageType, OutputImageType, MaskImageType> ClassificationFilterType;\n typedef ClassificationFilterType::Pointer ClassificationFilterPointerType;\n typedef ClassificationFilterType::ModelType ModelType;\n typedef ModelType::Pointer ModelPointerType;\n typedef ClassificationFilterType::ValueType ValueType;\n typedef ClassificationFilterType::LabelType LabelType;\n typedef otb::MachineLearningModelFactory<ValueType, LabelType> MachineLearningModelFactoryType;\n\nprivate:\n void DoInit()\n {\n SetName(\"ImageClassifier\");\n SetDescription(\"Performs a classification of the input image according to a model file.\");\n\n \/\/ Documentation\n SetDocName(\"Image Classification\");\n SetDocLongDescription(\"This application performs an image classification based on a model file produced by the TrainImagesClassifier application. Pixels of the output image will contain the class labels decided by the classifier (maximal class label = 65535). The input pixels can be optionally centered and reduced according to the statistics file produced by the ComputeImagesStatistics application. An optional input mask can be provided, in which case only input image pixels whose corresponding mask value is greater than 0 will be classified. The remaining of pixels will be given the label 0 in the output image.\");\n\n SetDocLimitations(\"The input image must have the same type, order and number of bands than the images used to produce the statistics file and the SVM model file. If a statistics file was used during training by the TrainImagesClassifier, it is mandatory to use the same statistics file for classification. If an input mask is used, its size must match the input image size.\");\n SetDocAuthors(\"OTB-Team\");\n SetDocSeeAlso(\"TrainImagesClassifier, ValidateImagesClassifier, ComputeImagesStatistics\");\n\n AddDocTag(Tags::Learning);\n\n AddParameter(ParameterType_InputImage, \"in\", \"Input Image\");\n SetParameterDescription( \"in\", \"The input image to classify.\");\n\n AddParameter(ParameterType_InputImage, \"mask\", \"Input Mask\");\n SetParameterDescription( \"mask\", \"The mask allows to restrict classification of the input image to the area where mask pixel values are greater than 0.\");\n MandatoryOff(\"mask\");\n\n AddParameter(ParameterType_InputFilename, \"model\", \"Model file\");\n SetParameterDescription(\"model\", \"A model file (produced by TrainImagesClassifier application, maximal class label = 65535).\");\n\n AddParameter(ParameterType_InputFilename, \"imstat\", \"Statistics file\");\n SetParameterDescription(\"imstat\", \"A XML file containing mean and standard deviation to center and reduce samples before classification (produced by ComputeImagesStatistics application).\");\n MandatoryOff(\"imstat\");\n\n AddParameter(ParameterType_OutputImage, \"out\", \"Output Image\");\n SetParameterDescription( \"out\", \"Output image containing class labels\");\n SetParameterOutputImagePixelType( \"out\", ImagePixelType_uint8);\n\n AddRAMParameter();\n\n \/\/ Doc example parameter settings\n SetDocExampleParameterValue(\"in\", \"QB_1_ortho.tif\");\n SetDocExampleParameterValue(\"imstat\", \"EstimateImageStatisticsQB1.xml\");\n SetDocExampleParameterValue(\"model\", \"clsvmModelQB1.svm\");\n SetDocExampleParameterValue(\"out\", \"clLabeledImageQB1.tif\");\n }\n\n void DoUpdateParameters()\n {\n \/\/ Nothing to do here : all parameters are independent\n }\n\n void DoExecute()\n {\n \/\/ Load input image\n FloatVectorImageType::Pointer inImage = GetParameterImage(\"in\");\n inImage->UpdateOutputInformation();\n\n \/\/ Load svm model\n otbAppLogINFO(\"Loading model\");\n m_Model = MachineLearningModelFactoryType::CreateMachineLearningModel(GetParameterString(\"model\"),\n MachineLearningModelFactoryType::ReadMode);\n m_Model->Load(GetParameterString(\"model\"));\n otbAppLogINFO(\"Model loaded\");\n\n \/\/ Normalize input image (optional)\n StatisticsReader::Pointer statisticsReader = StatisticsReader::New();\n MeasurementType meanMeasurementVector;\n MeasurementType stddevMeasurementVector;\n m_Rescaler = RescalerType::New();\n\n \/\/ Classify\n m_ClassificationFilter = ClassificationFilterType::New();\n m_ClassificationFilter->SetModel(m_Model);\n\n \/\/ Normalize input image if asked\n if(IsParameterEnabled(\"imstat\") )\n {\n otbAppLogINFO(\"Input image normalization activated.\");\n \/\/ Load input image statistics\n statisticsReader->SetFileName(GetParameterString(\"imstat\"));\n meanMeasurementVector = statisticsReader->GetStatisticVectorByName(\"mean\");\n stddevMeasurementVector = statisticsReader->GetStatisticVectorByName(\"stddev\");\n otbAppLogINFO( \"mean used: \" << meanMeasurementVector );\n otbAppLogINFO( \"standard deviation used: \" << stddevMeasurementVector );\n \/\/ Rescale vector image\n m_Rescaler->SetScale(stddevMeasurementVector);\n m_Rescaler->SetShift(meanMeasurementVector);\n m_Rescaler->SetInput(inImage);\n\n m_ClassificationFilter->SetInput(m_Rescaler->GetOutput());\n }\n else\n {\n otbAppLogINFO(\"Input image normalization deactivated.\");\n m_ClassificationFilter->SetInput(inImage);\n }\n\n\n if(IsParameterEnabled(\"mask\"))\n {\n otbAppLogINFO(\"Using input mask\");\n \/\/ Load mask image and cast into LabeledImageType\n MaskImageType::Pointer inMask = GetParameterUInt8Image(\"mask\");\n\n m_ClassificationFilter->SetInputMask(inMask);\n }\n\n SetParameterOutputImage<OutputImageType>(\"out\", m_ClassificationFilter->GetOutput());\n }\n\n ClassificationFilterType::Pointer m_ClassificationFilter;\n ModelPointerType m_Model;\n RescalerType::Pointer m_Rescaler;\n};\n\n\n}\n}\n\nOTB_APPLICATION_EXPORT(otb::Wrapper::ImageClassifier)\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com\n\n#include <gflags\/gflags.h>\n\n\/\/ global\nDEFINE_bool(bfs_bug_tolerant, true, \"Tolerate minor bug\");\nDEFINE_string(bfs_log, \"\", \"BFS log\");\nDEFINE_int32(bfs_log_size, 1024, \"BFS log size\");\n\/\/ nameserver\nDEFINE_string(namedb_path, \".\/db\", \"Namespace database\");\nDEFINE_int64(namedb_cache_size, 1024L, \"Namespace datebase memery cache size\");\nDEFINE_string(nameserver, \"127.0.0.1\", \"Nameserver host\");\nDEFINE_string(nameserver_port, \"8828\", \"Nameserver port\");\nDEFINE_int32(keepalive_timeout, 10, \"Chunkserver keepalive timeout\");\nDEFINE_int32(default_replica_num, 3, \"Default replica num of data block\");\nDEFINE_int32(nameserver_log_level, 4, \"Nameserver log level\");\nDEFINE_string(nameserver_logfile, \".\/nlog\", \"Nameserver log file\");\nDEFINE_string(nameserver_warninglog, \".\/wflog\", \"Warning log file\");\nDEFINE_int32(nameserver_safemode_time, 120, \"Nameserver leave safemode time in ms\");\nDEFINE_int32(recover_speed, 100, \"max num of block to recover for one chunkserver\");\nDEFINE_int32(recover_timeout, 180, \"Recover timeout for one chunkserver\");\nDEFINE_bool(clean_redundancy, false, \"Clean redundant replica\");\nDEFINE_int32(nameserver_report_thread_num, 20, \"Threads to handle block report\");\nDEFINE_int32(nameserver_work_thread_num, 20, \"Work threads num\");\nDEFINE_bool(select_chunkserver_by_zone, false, \"Select chunkserver by zone\");\n\n\/\/ chunkserver\nDEFINE_string(block_store_path, \".\/data\", \"Data path\");\nDEFINE_string(chunkserver_port, \"8825\", \"Chunkserver port\");\nDEFINE_int32(heartbeat_interval, 1, \"Heartbeat interval\");\nDEFINE_int32(blockreport_interval, 10, \"blockreport_interval\");\nDEFINE_int32(blockreport_size, 2000, \"blockreport_size\");\nDEFINE_int32(chunkserver_log_level, 4, \"Chunkserver log level\");\nDEFINE_string(chunkserver_warninglog, \".\/wflog\", \"Warning log file\");\nDEFINE_int32(write_buf_size, 1024*1024, \"Block write buffer size, bytes\");\nDEFINE_int32(chunkserver_max_pending_buffers, 10240, \"Buffer num wait flush to disk\");\nDEFINE_int32(chunkserver_work_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_read_thread_num, 20, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_write_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_io_thread_num, 10, \"Chunkserver io thread num\");\nDEFINE_int32(chunkserver_recover_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_file_cache_size, 1000, \"Chunkserver file cache size\");\nDEFINE_int32(chunkserver_use_root_partition, 1, \"Should chunkserver use root partition, 0: forbidden\");\nDEFINE_bool(chunkserver_auto_clean, true, \"If namespace version mismatch, chunkserver clean itself\");\n\/\/ SDK\nDEFINE_int32(sdk_thread_num, 10, \"Sdk thread num\");\nDEFINE_int32(sdk_file_reada_len, 1024*1024, \"Read ahead buffer len\");\nDEFINE_string(sdk_write_mode, \"chains\", \"Sdk write mode: chains\/fan-out\");\nDEFINE_int32(sdk_createblock_retry, 5, \"Create block retry times before fail\");\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<commit_msg>Remove unused flag<commit_after>\/\/ Copyright (c) 2014, Baidu.com, Inc. All Rights Reserved\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ Author: yanshiguang02@baidu.com\n\n#include <gflags\/gflags.h>\n\n\/\/ global\nDEFINE_bool(bfs_bug_tolerant, true, \"Tolerate minor bug\");\nDEFINE_string(bfs_log, \"\", \"BFS log\");\nDEFINE_int32(bfs_log_size, 1024, \"BFS log size\");\n\/\/ nameserver\nDEFINE_string(namedb_path, \".\/db\", \"Namespace database\");\nDEFINE_int64(namedb_cache_size, 1024L, \"Namespace datebase memery cache size\");\nDEFINE_string(nameserver, \"127.0.0.1\", \"Nameserver host\");\nDEFINE_string(nameserver_port, \"8828\", \"Nameserver port\");\nDEFINE_int32(keepalive_timeout, 10, \"Chunkserver keepalive timeout\");\nDEFINE_int32(default_replica_num, 3, \"Default replica num of data block\");\nDEFINE_int32(nameserver_log_level, 4, \"Nameserver log level\");\nDEFINE_string(nameserver_warninglog, \".\/wflog\", \"Warning log file\");\nDEFINE_int32(nameserver_safemode_time, 120, \"Nameserver leave safemode time in ms\");\nDEFINE_int32(recover_speed, 100, \"max num of block to recover for one chunkserver\");\nDEFINE_int32(recover_timeout, 180, \"Recover timeout for one chunkserver\");\nDEFINE_bool(clean_redundancy, false, \"Clean redundant replica\");\nDEFINE_int32(nameserver_report_thread_num, 20, \"Threads to handle block report\");\nDEFINE_int32(nameserver_work_thread_num, 20, \"Work threads num\");\nDEFINE_bool(select_chunkserver_by_zone, false, \"Select chunkserver by zone\");\n\n\/\/ chunkserver\nDEFINE_string(block_store_path, \".\/data\", \"Data path\");\nDEFINE_string(chunkserver_port, \"8825\", \"Chunkserver port\");\nDEFINE_int32(heartbeat_interval, 1, \"Heartbeat interval\");\nDEFINE_int32(blockreport_interval, 10, \"blockreport_interval\");\nDEFINE_int32(blockreport_size, 2000, \"blockreport_size\");\nDEFINE_int32(chunkserver_log_level, 4, \"Chunkserver log level\");\nDEFINE_string(chunkserver_warninglog, \".\/wflog\", \"Warning log file\");\nDEFINE_int32(write_buf_size, 1024*1024, \"Block write buffer size, bytes\");\nDEFINE_int32(chunkserver_max_pending_buffers, 10240, \"Buffer num wait flush to disk\");\nDEFINE_int32(chunkserver_work_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_read_thread_num, 20, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_write_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_io_thread_num, 10, \"Chunkserver io thread num\");\nDEFINE_int32(chunkserver_recover_thread_num, 10, \"Chunkserver work thread num\");\nDEFINE_int32(chunkserver_file_cache_size, 1000, \"Chunkserver file cache size\");\nDEFINE_int32(chunkserver_use_root_partition, 1, \"Should chunkserver use root partition, 0: forbidden\");\nDEFINE_bool(chunkserver_auto_clean, true, \"If namespace version mismatch, chunkserver clean itself\");\n\/\/ SDK\nDEFINE_int32(sdk_thread_num, 10, \"Sdk thread num\");\nDEFINE_int32(sdk_file_reada_len, 1024*1024, \"Read ahead buffer len\");\nDEFINE_string(sdk_write_mode, \"chains\", \"Sdk write mode: chains\/fan-out\");\nDEFINE_int32(sdk_createblock_retry, 5, \"Create block retry times before fail\");\n\n\/* vim: set expandtab ts=4 sw=4 sts=4 tw=100: *\/\n<|endoftext|>"} {"text":"<commit_before>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2012 Francois Beaune, Jupiter Jazz Limited\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/containers\/dictionary.h\"\n#include \"foundation\/utility\/test.h\"\n\n\/\/ Standard headers.\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nTEST_SUITE(Foundation_Utility_StringDictionary)\n{\n TEST_CASE(EqualityOperator_GivenTwoEmptyDictionaries_ReturnsTrue)\n {\n StringDictionary sd1;\n StringDictionary sd2;\n\n ASSERT_TRUE(sd1 == sd2);\n ASSERT_FALSE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesOfDifferentSize_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value\");\n\n StringDictionary sd2;\n\n ASSERT_FALSE(sd1 == sd2);\n ASSERT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleItemWithSameKeyButDifferentValues_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value1\");\n\n StringDictionary sd2;\n sd2.insert(\"key\", \"value2\");\n\n ASSERT_FALSE(sd1 == sd2);\n ASSERT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleItemWithDifferentKeysButSameValue_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key1\", \"value\");\n\n StringDictionary sd2;\n sd2.insert(\"key2\", \"value\");\n\n ASSERT_FALSE(sd1 == sd2);\n ASSERT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleIdenticalItem_ReturnsTrue)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value\");\n\n StringDictionary sd2;\n sd2.insert(\"key\", \"value\");\n\n ASSERT_TRUE(sd1 == sd2);\n ASSERT_FALSE(sd1 != sd2);\n }\n\n TEST_CASE(Insert_ReturnsThisPointer)\n {\n StringDictionary sd;\n\n const StringDictionary* result = &sd.insert(\"key\", \"value\");\n\n EXPECT_EQ(&sd, result);\n }\n\n TEST_CASE(Get_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const char* item = sd.get(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = sd.get<int>(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenStdStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = sd.get<int>(string(\"key\"));\n });\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfExistingItem_RemovesItem)\n {\n StringDictionary sd;\n sd.insert(\"key\", \"value\");\n\n sd.remove(\"key\");\n\n EXPECT_FALSE(sd.exist(\"key\"));\n }\n\n TEST_CASE(Remove_GivenStdStringKeyOfExistingItem_RemovesItem)\n {\n StringDictionary sd;\n sd.insert(\"key\", \"value\");\n\n sd.remove(string(\"key\"));\n\n EXPECT_FALSE(sd.exist(\"key\"));\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfNonExistingItem_DoesNothing)\n {\n StringDictionary sd;\n\n sd.remove(\"key\");\n }\n\n TEST_CASE(Remove_ReturnsThisPointer)\n {\n StringDictionary sd;\n\n const StringDictionary* result = &sd.remove(\"key\");\n\n EXPECT_EQ(&sd, result);\n }\n}\n\nTEST_SUITE(Foundation_Utility_DictionaryDictionary)\n{\n TEST_CASE(Insert_ReturnsThisPointer)\n {\n DictionaryDictionary dd;\n\n const DictionaryDictionary* result = &dd.insert(\"key\", Dictionary());\n\n EXPECT_EQ(&dd, result);\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfNonExistingItem_DoesNothing)\n {\n DictionaryDictionary dd;\n\n dd.remove(\"key\");\n }\n\n TEST_CASE(Remove_ReturnsThisPointer)\n {\n DictionaryDictionary dd;\n\n const DictionaryDictionary* result = &dd.remove(\"key\");\n\n EXPECT_EQ(&dd, result);\n }\n}\n\nTEST_SUITE(Foundation_Utility_Dictionary)\n{\n TEST_CASE(Constructor_ConstructsEmptyDictionary)\n {\n Dictionary dic;\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(CopyConstructor_GivenSourceDictionaryWithOneStringItem_CopiesStringItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n Dictionary copy(dic);\n\n EXPECT_EQ(\"value\", copy.get<string>(\"key\"));\n }\n\n TEST_CASE(CopyConstructor_GivenSourceDictionaryWithOneDictionaryItem_CopiesDictionaryItem)\n {\n Dictionary child;\n child.insert(\"key\", \"value\");\n\n Dictionary dic;\n dic.insert(\"child\", child);\n\n Dictionary copy(dic);\n\n EXPECT_EQ(\"value\", copy.dictionary(\"child\").get<string>(\"key\"));\n }\n\n TEST_CASE(AssignmentOperator_GivenSourceDictionaryWithOneStringItem_CopiesStringItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n Dictionary other;\n other = dic;\n\n EXPECT_EQ(\"value\", other.get<string>(\"key\"));\n }\n\n TEST_CASE(AssignmentOperator_GivenSourceDictionaryWithOneDictionaryItem_CopiesDictionaryItem)\n {\n Dictionary child;\n child.insert(\"key\", \"value\");\n\n Dictionary dic;\n dic.insert(\"child\", child);\n\n Dictionary other;\n other = dic;\n\n EXPECT_EQ(\"value\", other.dictionary(\"child\").get<string>(\"key\"));\n }\n\n TEST_CASE(Clear_GivenDictionaryWithOneStringItem_RemovesItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n dic.clear();\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(Clear_GivenDictionaryWithOneDictionaryItem_RemovesItem)\n {\n Dictionary dic;\n dic.insert(\"key\", Dictionary());\n\n dic.clear();\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndCStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", \"value\");\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndStdStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", string(\"value\"));\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndIntegerValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", 42);\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(42, dic.get<int>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenStdStringKeyAndCStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(string(\"key\"), \"value\");\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenStdStringKeyAndIntegerValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(string(\"key\"), 42);\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(42, dic.get<int>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenDictionary_ReturnsThisPointer)\n {\n Dictionary dic;\n\n const Dictionary* result = &dic.insert(\"key\", Dictionary());\n\n EXPECT_EQ(&dic, result);\n }\n\n TEST_CASE(Insert_GivenCString_ReturnsThisPointer)\n {\n Dictionary dic;\n\n const Dictionary* result = &dic.insert(\"key\", \"value\");\n\n EXPECT_EQ(&dic, result);\n }\n\n TEST_CASE(GetAsInt_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n Dictionary dic;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = dic.get<int>(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenStdStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n Dictionary dic;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = dic.get<int>(string(\"key\"));\n });\n }\n}\n<commit_msg>replaced ASSERTs by EXPECTs.<commit_after>\n\/\/\n\/\/ This source file is part of appleseed.\n\/\/ Visit http:\/\/appleseedhq.net\/ for additional information and resources.\n\/\/\n\/\/ This software is released under the MIT license.\n\/\/\n\/\/ Copyright (c) 2010-2012 Francois Beaune, Jupiter Jazz Limited\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n\/\/ THE SOFTWARE.\n\/\/\n\n\/\/ appleseed.foundation headers.\n#include \"foundation\/utility\/containers\/dictionary.h\"\n#include \"foundation\/utility\/test.h\"\n\n\/\/ Standard headers.\n#include <string>\n\nusing namespace foundation;\nusing namespace std;\n\nTEST_SUITE(Foundation_Utility_StringDictionary)\n{\n TEST_CASE(EqualityOperator_GivenTwoEmptyDictionaries_ReturnsTrue)\n {\n StringDictionary sd1;\n StringDictionary sd2;\n\n EXPECT_TRUE(sd1 == sd2);\n EXPECT_FALSE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesOfDifferentSize_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value\");\n\n StringDictionary sd2;\n\n EXPECT_FALSE(sd1 == sd2);\n EXPECT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleItemWithSameKeyButDifferentValues_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value1\");\n\n StringDictionary sd2;\n sd2.insert(\"key\", \"value2\");\n\n EXPECT_FALSE(sd1 == sd2);\n EXPECT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleItemWithDifferentKeysButSameValue_ReturnsFalse)\n {\n StringDictionary sd1;\n sd1.insert(\"key1\", \"value\");\n\n StringDictionary sd2;\n sd2.insert(\"key2\", \"value\");\n\n EXPECT_FALSE(sd1 == sd2);\n EXPECT_TRUE(sd1 != sd2);\n }\n\n TEST_CASE(EqualityOperator_GivenDictionariesWithSingleIdenticalItem_ReturnsTrue)\n {\n StringDictionary sd1;\n sd1.insert(\"key\", \"value\");\n\n StringDictionary sd2;\n sd2.insert(\"key\", \"value\");\n\n EXPECT_TRUE(sd1 == sd2);\n EXPECT_FALSE(sd1 != sd2);\n }\n\n TEST_CASE(Insert_ReturnsThisPointer)\n {\n StringDictionary sd;\n\n const StringDictionary* result = &sd.insert(\"key\", \"value\");\n\n EXPECT_EQ(&sd, result);\n }\n\n TEST_CASE(Get_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const char* item = sd.get(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = sd.get<int>(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenStdStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n StringDictionary sd;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = sd.get<int>(string(\"key\"));\n });\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfExistingItem_RemovesItem)\n {\n StringDictionary sd;\n sd.insert(\"key\", \"value\");\n\n sd.remove(\"key\");\n\n EXPECT_FALSE(sd.exist(\"key\"));\n }\n\n TEST_CASE(Remove_GivenStdStringKeyOfExistingItem_RemovesItem)\n {\n StringDictionary sd;\n sd.insert(\"key\", \"value\");\n\n sd.remove(string(\"key\"));\n\n EXPECT_FALSE(sd.exist(\"key\"));\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfNonExistingItem_DoesNothing)\n {\n StringDictionary sd;\n\n sd.remove(\"key\");\n }\n\n TEST_CASE(Remove_ReturnsThisPointer)\n {\n StringDictionary sd;\n\n const StringDictionary* result = &sd.remove(\"key\");\n\n EXPECT_EQ(&sd, result);\n }\n}\n\nTEST_SUITE(Foundation_Utility_DictionaryDictionary)\n{\n TEST_CASE(Insert_ReturnsThisPointer)\n {\n DictionaryDictionary dd;\n\n const DictionaryDictionary* result = &dd.insert(\"key\", Dictionary());\n\n EXPECT_EQ(&dd, result);\n }\n\n TEST_CASE(Remove_GivenCStringKeyOfNonExistingItem_DoesNothing)\n {\n DictionaryDictionary dd;\n\n dd.remove(\"key\");\n }\n\n TEST_CASE(Remove_ReturnsThisPointer)\n {\n DictionaryDictionary dd;\n\n const DictionaryDictionary* result = &dd.remove(\"key\");\n\n EXPECT_EQ(&dd, result);\n }\n}\n\nTEST_SUITE(Foundation_Utility_Dictionary)\n{\n TEST_CASE(Constructor_ConstructsEmptyDictionary)\n {\n Dictionary dic;\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(CopyConstructor_GivenSourceDictionaryWithOneStringItem_CopiesStringItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n Dictionary copy(dic);\n\n EXPECT_EQ(\"value\", copy.get<string>(\"key\"));\n }\n\n TEST_CASE(CopyConstructor_GivenSourceDictionaryWithOneDictionaryItem_CopiesDictionaryItem)\n {\n Dictionary child;\n child.insert(\"key\", \"value\");\n\n Dictionary dic;\n dic.insert(\"child\", child);\n\n Dictionary copy(dic);\n\n EXPECT_EQ(\"value\", copy.dictionary(\"child\").get<string>(\"key\"));\n }\n\n TEST_CASE(AssignmentOperator_GivenSourceDictionaryWithOneStringItem_CopiesStringItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n Dictionary other;\n other = dic;\n\n EXPECT_EQ(\"value\", other.get<string>(\"key\"));\n }\n\n TEST_CASE(AssignmentOperator_GivenSourceDictionaryWithOneDictionaryItem_CopiesDictionaryItem)\n {\n Dictionary child;\n child.insert(\"key\", \"value\");\n\n Dictionary dic;\n dic.insert(\"child\", child);\n\n Dictionary other;\n other = dic;\n\n EXPECT_EQ(\"value\", other.dictionary(\"child\").get<string>(\"key\"));\n }\n\n TEST_CASE(Clear_GivenDictionaryWithOneStringItem_RemovesItem)\n {\n Dictionary dic;\n dic.insert(\"key\", \"value\");\n\n dic.clear();\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(Clear_GivenDictionaryWithOneDictionaryItem_RemovesItem)\n {\n Dictionary dic;\n dic.insert(\"key\", Dictionary());\n\n dic.clear();\n\n EXPECT_EQ(0, dic.size());\n EXPECT_TRUE(dic.empty());\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndCStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", \"value\");\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndStdStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", string(\"value\"));\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenCStringKeyAndIntegerValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(\"key\", 42);\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(42, dic.get<int>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenStdStringKeyAndCStringValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(string(\"key\"), \"value\");\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(\"value\", dic.get<string>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenStdStringKeyAndIntegerValue_InsertsValue)\n {\n Dictionary dic;\n\n dic.insert(string(\"key\"), 42);\n\n EXPECT_EQ(1, dic.size());\n EXPECT_FALSE(dic.empty());\n EXPECT_EQ(42, dic.get<int>(\"key\"));\n }\n\n TEST_CASE(Insert_GivenDictionary_ReturnsThisPointer)\n {\n Dictionary dic;\n\n const Dictionary* result = &dic.insert(\"key\", Dictionary());\n\n EXPECT_EQ(&dic, result);\n }\n\n TEST_CASE(Insert_GivenCString_ReturnsThisPointer)\n {\n Dictionary dic;\n\n const Dictionary* result = &dic.insert(\"key\", \"value\");\n\n EXPECT_EQ(&dic, result);\n }\n\n TEST_CASE(GetAsInt_GivenCStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n Dictionary dic;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = dic.get<int>(\"key\");\n });\n }\n\n TEST_CASE(GetAsInt_GivenStdStringKeyOfNonExistingItem_ThrowsExceptionDictionaryItemNotFound)\n {\n Dictionary dic;\n\n EXPECT_EXCEPTION(ExceptionDictionaryItemNotFound,\n {\n const int item = dic.get<int>(string(\"key\"));\n });\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef ALGORITHM_HUFFMAN_H_\n#define ALGORITHM_HUFFMAN_H_ 1\n\n#include <vector>\n#include <string>\n#include <functional>\n\nnamespace algorithm\n{\n\nclass Huffman\n{\npublic:\n typedef unsigned char SymbolType;\n typedef size_t SizeType;\n typedef unsigned int CodewordType;\n typedef std::string StringType;\n typedef std::ifstream FileInputType;\n typedef std::ofstream FileOutputType;\n typedef uint32_t EncodeBufferType;\n\n typedef std::pair<SymbolType, SizeType> MetaSymbolType;\n\n struct Run\n {\n SymbolType symbol;\n SizeType run_len;\n SizeType freq;\n\n Run * left;\n Run * right;\n\n CodewordType codeword;\n SizeType codeword_len;\n\n Run * next;\n\n Run(const SymbolType & symbol, const SizeType & run_len, const SizeType & freq = 0)\n : symbol (symbol)\n , run_len (run_len)\n , freq (freq)\n , left (nullptr)\n , right (nullptr)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n Run(const MetaSymbolType & meta_symbol, const SizeType & freq = 0)\n : symbol (meta_symbol.first)\n , run_len (meta_symbol.second)\n , freq (freq)\n , left (nullptr)\n , right (nullptr)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n Run(const Run & run)\n : symbol (run.symbol)\n , run_len (run.run_len)\n , freq (run.freq)\n , left (run.left)\n , right (run.right)\n , codeword (run.codeword)\n , codeword_len (run.codeword_len)\n , next (run.next)\n { }\n\n Run(Run * left, Run * right)\n : symbol (0)\n , run_len (0)\n , freq (left->freq + right->freq)\n , left (left)\n , right (right)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n inline\n Run &\n operator=(Run run)\n {\n this->symbol = run.symbol;\n this->run_len = run.run_len;\n this->freq = run.freq;\n this->left = run.left;\n this->right = run.right;\n this->codeword = run.codeword;\n this->codeword_len = run.codeword_len;\n this->next = run.next;\n\n return *this;\n }\n\n inline\n bool\n operator==(const Run & rhs)\n const\n { return symbol == rhs.symbol && run_len == rhs.run_len; }\n\n inline\n bool\n operator!=(const Run & rhs)\n const\n { return ! (*this == rhs); }\n\n inline\n Run &\n operator++(void)\n {\n ++freq;\n return *this;\n }\n\n inline\n Run\n operator++(int)\n {\n Run temp(*this);\n operator++();\n return temp;\n }\n\n inline\n Run &\n operator--(void)\n {\n --freq;\n return *this;\n }\n\n inline\n Run\n operator--(int)\n {\n Run temp(*this);\n operator--();\n return temp;\n }\n\n inline\n bool\n operator<(const Run & rhs)\n const\n { return (this->freq < rhs.freq); }\n\n inline\n bool\n operator>(const Run & rhs)\n const\n { return (this->freq > rhs.freq); }\n\n inline\n bool\n operator<=(const Run & rhs)\n const\n { return ! operator>(rhs); }\n\n inline\n bool\n operator>=(const Run & rhs)\n const\n { return ! operator<(rhs); }\n };\n\n typedef Run RunType;\n\n typedef std::vector<RunType> RunArrayType;\n typedef std::array<RunType *, sizeof(SymbolType)> RunListType;\n typedef RunType * HuffmanTreeType;\n\nprivate:\n RunArrayType runs_;\n RunListType list_;\n HuffmanTreeType root_;\n\n void CollectRuns(FileInputType &);\n void CreateHuffmanTree(void);\n void AssignCodeword(RunType *, const CodewordType & = 0, const SizeType & = 0);\n void CreateRunList(RunType *);\n RunType * GetRunFromList(const SymbolType &, const SizeType &);\n void WriteHeader(FileInputType &, FileOutputType &);\n void WriteEncode(FileInputType &, FileOutputType &);\n\n void PrintHuffmanTree(FILE *, const RunType *, const SizeType &);\n\npublic:\n void CompressFile(FileInputType &, const StringType &, const StringType &);\n\n void PrintAllRuns(FILE * = stdout);\n void PrintHuffmanTree(FILE * = stdout);\n};\n\n} \/** ns: algorithm *\/\n\n#endif \/** ! ALGORITHM_HUFFMAN_H_ *\/\n<commit_msg>Change type unsigned char to uint8_t<commit_after>#ifndef ALGORITHM_HUFFMAN_H_\n#define ALGORITHM_HUFFMAN_H_ 1\n\n#include <vector>\n#include <string>\n#include <functional>\n\nnamespace algorithm\n{\n\nclass Huffman\n{\npublic:\n typedef uint8_t SymbolType;\n typedef size_t SizeType;\n typedef unsigned int CodewordType;\n typedef std::string StringType;\n typedef std::ifstream FileInputType;\n typedef std::ofstream FileOutputType;\n typedef uint32_t EncodeBufferType;\n\n typedef std::pair<SymbolType, SizeType> MetaSymbolType;\n\n struct Run\n {\n SymbolType symbol;\n SizeType run_len;\n SizeType freq;\n\n Run * left;\n Run * right;\n\n CodewordType codeword;\n SizeType codeword_len;\n\n Run * next;\n\n Run(const SymbolType & symbol, const SizeType & run_len, const SizeType & freq = 0)\n : symbol (symbol)\n , run_len (run_len)\n , freq (freq)\n , left (nullptr)\n , right (nullptr)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n Run(const MetaSymbolType & meta_symbol, const SizeType & freq = 0)\n : symbol (meta_symbol.first)\n , run_len (meta_symbol.second)\n , freq (freq)\n , left (nullptr)\n , right (nullptr)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n Run(const Run & run)\n : symbol (run.symbol)\n , run_len (run.run_len)\n , freq (run.freq)\n , left (run.left)\n , right (run.right)\n , codeword (run.codeword)\n , codeword_len (run.codeword_len)\n , next (run.next)\n { }\n\n Run(Run * left, Run * right)\n : symbol (0)\n , run_len (0)\n , freq (left->freq + right->freq)\n , left (left)\n , right (right)\n , codeword (0)\n , codeword_len (0)\n , next (nullptr)\n { }\n\n inline\n Run &\n operator=(Run run)\n {\n this->symbol = run.symbol;\n this->run_len = run.run_len;\n this->freq = run.freq;\n this->left = run.left;\n this->right = run.right;\n this->codeword = run.codeword;\n this->codeword_len = run.codeword_len;\n this->next = run.next;\n\n return *this;\n }\n\n inline\n bool\n operator==(const Run & rhs)\n const\n { return symbol == rhs.symbol && run_len == rhs.run_len; }\n\n inline\n bool\n operator!=(const Run & rhs)\n const\n { return ! (*this == rhs); }\n\n inline\n Run &\n operator++(void)\n {\n ++freq;\n return *this;\n }\n\n inline\n Run\n operator++(int)\n {\n Run temp(*this);\n operator++();\n return temp;\n }\n\n inline\n Run &\n operator--(void)\n {\n --freq;\n return *this;\n }\n\n inline\n Run\n operator--(int)\n {\n Run temp(*this);\n operator--();\n return temp;\n }\n\n inline\n bool\n operator<(const Run & rhs)\n const\n { return (this->freq < rhs.freq); }\n\n inline\n bool\n operator>(const Run & rhs)\n const\n { return (this->freq > rhs.freq); }\n\n inline\n bool\n operator<=(const Run & rhs)\n const\n { return ! operator>(rhs); }\n\n inline\n bool\n operator>=(const Run & rhs)\n const\n { return ! operator<(rhs); }\n };\n\n typedef Run RunType;\n\n typedef std::vector<RunType> RunArrayType;\n typedef std::array<RunType *, sizeof(SymbolType)> RunListType;\n typedef RunType * HuffmanTreeType;\n\nprivate:\n RunArrayType runs_;\n RunListType list_;\n HuffmanTreeType root_;\n\n void CollectRuns(FileInputType &);\n void CreateHuffmanTree(void);\n void AssignCodeword(RunType *, const CodewordType & = 0, const SizeType & = 0);\n void CreateRunList(RunType *);\n RunType * GetRunFromList(const SymbolType &, const SizeType &);\n void WriteHeader(FileInputType &, FileOutputType &);\n void WriteEncode(FileInputType &, FileOutputType &);\n\n void PrintHuffmanTree(FILE *, const RunType *, const SizeType &);\n\npublic:\n void CompressFile(FileInputType &, const StringType &, const StringType &);\n\n void PrintAllRuns(FILE * = stdout);\n void PrintHuffmanTree(FILE * = stdout);\n};\n\n} \/** ns: algorithm *\/\n\n#endif \/** ! ALGORITHM_HUFFMAN_H_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Empar.cpp\n *\n * Created by Ania M. Kedzierska on 11\/11\/11.\n * Copyright 2011 Politecnic University of Catalonia, Center for Genomic Regulation. This is program can be redistributed, modified or else as given by the terms of the GNU General Public License.\n *\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <fstream>\n#include <ctime>\n#include <cmath>\n#include <list>\n#include <string>\n#include <stdexcept>\n\n#include \"Empar.h\"\n#include \"em.h\"\n#include \"tree.h\"\n#include \"parameters.h\"\n#include \"alignment.h\"\n#include \"model.h\"\n#include \"sampling.h\"\n#include \"miscelania.h\"\n#include \"random.h\"\n#include \"fisher.h\"\n#include \"permutation.h\"\n\n\n\/\/ Prints an informative warning if the tree is nonidentifiable.\nbool nonident_warning(Tree &T) {\n std::list<long> Lnon;\n std::list<long>::iterator it;\n std::list<long>::iterator itlast;\n\n for(long i = 0; i < T.nnodes; i++) {\n \/\/ Any node (root or not) with valence 2 leads to nonident.\n if(valence(T, i) == 2) {\n Lnon.push_back(i);\n }\n\n \/\/ A root of valence 1 leads to nonident.\n if(valence(T, i) == 1 && i == T.nleaves) {\n Lnon.push_back(i);\n }\n }\n\n if (Lnon.size() > 0) {\n std::cout << \"WARNING: The following nodes lead to non-identifiability of the parameters: \";\n itlast = Lnon.end();\n --itlast;\n for(it=Lnon.begin(); it != Lnon.end(); it++) {\n std::cout << *it;\n if (it != itlast) { \/\/ if not the last element\n std::cout << \", \";\n }\n }\n std::cout << \".\" << std::endl << std::endl;\n\n std::cout << \"This may happen for two reasons:\" << std::endl;\n std::cout << \" 1) The root has valence 1. If the model has non-uniform distribution, the length of the outgoing edge cannot be recovered reliably.\" << std::endl;\n std::cout << \" 2) There is a node (typically thought of as the root) with exactly two incident edges. In this case only the sum of lengths of the two incident edges can be recovered reliably.\" << std::endl << std::endl;\n }\n\n return Lnon.size() > 0;\n}\n\nvoid run(std::string tree_filename, std::string fasta_filename, std::string model_name) {\n Model Mod; \/\/ The model\n Counts data; \/\/ the counts\n Parameters Par; \/\/ the parameters\n std::vector<double> br; \/\/ branch lengths\n double eps = 1e-8; \/\/ The threshold for the EM algorithm.\n\n Parameters Parsim; \/\/ used for simulating data.\n std::vector<double> brsim; \/\/ branch lengths of simulated data.\n\n std::vector<std::vector<double> > Cov; \/\/ Covariance matrix\n std::vector<double> variances; \/\/ The variances\n\n\n bool simulate;\n bool nonident;\n std::string parameters_filename;\n std::string covariances_filename;\n\n \/\/ initialize random number generator with time(0).\n random_initialize();\n\n parameters_filename = strip_extension(fasta_filename) + \".dat\";\n covariances_filename = strip_extension(fasta_filename) + \".cov\";\n\n \/\/ Creates the pointers to the model-specific functions.\n Mod = create_model(model_name);\n std::cout << \"Model: \" << Mod.name << std::endl;\n\n \/\/ Reads the tree.\n Tree T = read_tree(tree_filename);\n\n \/\/ Prints the Tree\n std::cout << \"Tree:\" << std::endl;\n print_tree(T);\n\n \/\/ Check for possible nonidentifiability issues.\n nonident = nonident_warning(T);\n\n \/\/ Initialize the parameters for simulation of K81 data for testing\n Parsim = create_parameters(T);\n\n if (fasta_filename == \":test\") { \/\/ if fasta file is :test generate random data.\n simulate = true;\n\n \/\/ Warn\n std::cout << \"WARNING: Using simulated data \" << std::endl << std::endl;\n\n \/\/ Generate random parameters\n random_parameters_length(T, Mod, Parsim);\n\n \/\/ Simulate the data\n random_fake_counts(T, 1000, data, Parsim);\n\n \/\/ Prints branch-lengths for future check.\n branch_lengths(Parsim, brsim);\n std::cout << \"Simulated branch lengths:\" << std::endl;\n print_vector(brsim);\n\n } else { \/\/ otherwise read the data\n simulate = false;\n\n \/\/ Read the counts.\n std::cout << \"Reading fasta file:\" << std::endl;\n read_counts(T, data, fasta_filename);\n add_pseudocounts(0.01, data);\n std::cout << std::endl;\n }\n\n \/\/ Check whether the data and the tree match.\n if (T.nalpha != data.nalpha || T.nleaves != data.nspecies) {\n throw std::invalid_argument(\"The order of the sequences or their number and the phylogenetic tree do not match.\");\n }\n\n Par = create_parameters(T);\n\n clock_t start_time, end_time;\n start_time = clock();\n std::cout << \"Starting the EM algorithm\" << std::endl;\n\n \/\/ Runs the EM algorithm. Par is used as initial parameters.\n \/\/ After execution, Par contains the MLE computed by the algorithm.\n EMalgorithm(T, Mod, Par, data, eps);\n\n \/\/ Choses the best permutation.\n guess_permutation(T, Mod, Par);\n\n end_time = clock();\n\n branch_lengths(Par, br);\n\n \/\/ If parameters are not identifiable, the computation of the covariance matrix will\n \/\/ fail as the Fisher info matrix will not be invertible.\n if (!nonident) {\n \/\/ Compute the covariance matrix using observed Fisher.\n full_MLE_observed_covariance_matrix(T, Mod, Par, data, Cov);\n variances.resize(Cov.size());\n for(unsigned int i=0; i < Cov.size(); i++) {\n variances[i] = Cov[i][i];\n }\n\n \/\/ Save the sigmas into a file\n std::fstream fcov;\n fcov.precision(15);\n fcov.open(covariances_filename.c_str(), std::ios::out);\n if (!fcov.is_open()) {\n std::cout << \"Could not open file: covariances.dat\" << std::endl;\n }\n for(unsigned int i=0; i < Cov.size(); i++) {\n for(unsigned int j=0; j < Cov.size(); j++) {\n fcov << Cov[i][j] << \" \";\n }\n fcov << std::endl;\n }\n fcov << std::endl;\n fcov.close();\n }\n\n std::cout << std::endl;\n std::cout << \"Finished.\" << std::endl;\n std::cout << \"Elapsed time: \" << ((double)(end_time - start_time)) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n std::cout << std::endl;\n std::cout << \"Likelihood: \" << log_likelihood(T, Par, data) << std::endl << std::endl;\n std::cout << \"Branch lengths: \" << std::endl;\n print_vector(br);\n\n if (!nonident) {\n std::cout << \"Parameter variances: \" << std::endl;\n print_vector(variances);\n }\n\n std::cout << \"Newick Tree:\" << std::endl;\n print_newick_tree(T, br);\n\n \/\/ if is a simulation, print the L2 distance !\n if (simulate) {\n std::cout << \"L2 distance: \" << parameters_distance(Par, Parsim) << std::endl;\n std::cout << \"KL divergence: \" << KL_divergence(T, Par, Parsim) << std::endl;\n std::cout << std::endl;\n }\n\n \/\/ if it is not a simulation, store the parameters in a file !\n if (!simulate) {\n std::fstream st;\n st.precision(15);\n st.setf(std::ios::fixed,std::ios::floatfield);\n st.open(parameters_filename.c_str(), std::ios::out);\n print_parameters(Par, st);\n }\n}\n<commit_msg>Extract some code to separate function<commit_after>\/*\n * Empar.cpp\n *\n * Created by Ania M. Kedzierska on 11\/11\/11.\n * Copyright 2011 Politecnic University of Catalonia, Center for Genomic Regulation. This is program can be redistributed, modified or else as given by the terms of the GNU General Public License.\n *\n *\/\n\n#include <iostream>\n#include <cstdlib>\n#include <fstream>\n#include <ctime>\n#include <cmath>\n#include <list>\n#include <string>\n#include <stdexcept>\n\n#include \"Empar.h\"\n#include \"em.h\"\n#include \"tree.h\"\n#include \"parameters.h\"\n#include \"alignment.h\"\n#include \"model.h\"\n#include \"sampling.h\"\n#include \"miscelania.h\"\n#include \"random.h\"\n#include \"fisher.h\"\n#include \"permutation.h\"\n\n\n\/\/ Prints an informative warning if the tree is nonidentifiable.\nbool nonident_warning(Tree &T) {\n std::list<long> Lnon;\n std::list<long>::iterator it;\n std::list<long>::iterator itlast;\n\n for(long i = 0; i < T.nnodes; i++) {\n \/\/ Any node (root or not) with valence 2 leads to nonident.\n if(valence(T, i) == 2) {\n Lnon.push_back(i);\n }\n\n \/\/ A root of valence 1 leads to nonident.\n if(valence(T, i) == 1 && i == T.nleaves) {\n Lnon.push_back(i);\n }\n }\n\n if (Lnon.size() > 0) {\n std::cout << \"WARNING: The following nodes lead to non-identifiability of the parameters: \";\n itlast = Lnon.end();\n --itlast;\n for(it=Lnon.begin(); it != Lnon.end(); it++) {\n std::cout << *it;\n if (it != itlast) { \/\/ if not the last element\n std::cout << \", \";\n }\n }\n std::cout << \".\" << std::endl << std::endl;\n\n std::cout << \"This may happen for two reasons:\" << std::endl;\n std::cout << \" 1) The root has valence 1. If the model has non-uniform distribution, the length of the outgoing edge cannot be recovered reliably.\" << std::endl;\n std::cout << \" 2) There is a node (typically thought of as the root) with exactly two incident edges. In this case only the sum of lengths of the two incident edges can be recovered reliably.\" << std::endl << std::endl;\n }\n\n return Lnon.size() > 0;\n}\n\n\nvoid save_sigmas_to(const std::string& fname,\n\tconst std::vector<std::vector<double> >& cov_matrix)\n{\n std::fstream fcov;\n fcov.precision(15);\n fcov.open(fname.c_str(), std::ios::out);\n if (!fcov.is_open()) {\n std::cout << \"Could not open file: covariances.dat\" << std::endl;\n \/\/ TODO: exit\n }\n\n for(unsigned int i=0; i < cov_matrix.size(); i++) {\n for(unsigned int j=0; j < cov_matrix.size(); j++) {\n fcov << cov_matrix[i][j] << \" \";\n }\n fcov << std::endl;\n }\n fcov << std::endl;\n\n fcov.close();\n}\n\nvoid run(std::string tree_filename, std::string fasta_filename, std::string model_name) {\n Model Mod; \/\/ The model\n Counts data; \/\/ the counts\n Parameters Par; \/\/ the parameters\n std::vector<double> br; \/\/ branch lengths\n double eps = 1e-8; \/\/ The threshold for the EM algorithm.\n\n Parameters Parsim; \/\/ used for simulating data.\n std::vector<double> brsim; \/\/ branch lengths of simulated data.\n\n std::vector<std::vector<double> > Cov; \/\/ Covariance matrix\n std::vector<double> variances; \/\/ The variances\n\n\n bool simulate;\n bool nonident;\n std::string parameters_filename;\n std::string covariances_filename;\n\n \/\/ initialize random number generator with time(0).\n random_initialize();\n\n parameters_filename = strip_extension(fasta_filename) + \".dat\";\n covariances_filename = strip_extension(fasta_filename) + \".cov\";\n\n \/\/ Creates the pointers to the model-specific functions.\n Mod = create_model(model_name);\n std::cout << \"Model: \" << Mod.name << std::endl;\n\n \/\/ Reads the tree.\n Tree T = read_tree(tree_filename);\n\n \/\/ Prints the Tree\n std::cout << \"Tree:\" << std::endl;\n print_tree(T);\n\n \/\/ Check for possible nonidentifiability issues.\n nonident = nonident_warning(T);\n\n \/\/ Initialize the parameters for simulation of K81 data for testing\n Parsim = create_parameters(T);\n\n if (fasta_filename == \":test\") { \/\/ if fasta file is :test generate random data.\n simulate = true;\n\n \/\/ Warn\n std::cout << \"WARNING: Using simulated data \" << std::endl << std::endl;\n\n \/\/ Generate random parameters\n random_parameters_length(T, Mod, Parsim);\n\n \/\/ Simulate the data\n random_fake_counts(T, 1000, data, Parsim);\n\n \/\/ Prints branch-lengths for future check.\n branch_lengths(Parsim, brsim);\n std::cout << \"Simulated branch lengths:\" << std::endl;\n print_vector(brsim);\n\n } else { \/\/ otherwise read the data\n simulate = false;\n\n \/\/ Read the counts.\n std::cout << \"Reading fasta file:\" << std::endl;\n read_counts(T, data, fasta_filename);\n add_pseudocounts(0.01, data);\n std::cout << std::endl;\n }\n\n \/\/ Check whether the data and the tree match.\n if (T.nalpha != data.nalpha || T.nleaves != data.nspecies) {\n throw std::invalid_argument(\"The order of the sequences or their number and the phylogenetic tree do not match.\");\n }\n\n Par = create_parameters(T);\n\n clock_t start_time, end_time;\n start_time = clock();\n std::cout << \"Starting the EM algorithm\" << std::endl;\n\n \/\/ Runs the EM algorithm. Par is used as initial parameters.\n \/\/ After execution, Par contains the MLE computed by the algorithm.\n EMalgorithm(T, Mod, Par, data, eps);\n\n \/\/ Choses the best permutation.\n guess_permutation(T, Mod, Par);\n\n end_time = clock();\n\n branch_lengths(Par, br);\n\n \/\/ If parameters are not identifiable, the computation of the covariance matrix will\n \/\/ fail as the Fisher info matrix will not be invertible.\n if (!nonident) {\n \/\/ Compute the covariance matrix using observed Fisher.\n full_MLE_observed_covariance_matrix(T, Mod, Par, data, Cov);\n variances.resize(Cov.size());\n for(unsigned int i=0; i < Cov.size(); i++) {\n variances[i] = Cov[i][i];\n }\n\n \/\/ Save the sigmas into a file\n save_sigmas_to(covariances_filename, Cov);\n }\n\n std::cout << std::endl;\n std::cout << \"Finished.\" << std::endl;\n std::cout << \"Elapsed time: \" << ((double)(end_time - start_time)) \/ CLOCKS_PER_SEC << \" s\" << std::endl;\n std::cout << std::endl;\n std::cout << \"Likelihood: \" << log_likelihood(T, Par, data) << std::endl << std::endl;\n std::cout << \"Branch lengths: \" << std::endl;\n print_vector(br);\n\n if (!nonident) {\n std::cout << \"Parameter variances: \" << std::endl;\n print_vector(variances);\n }\n\n std::cout << \"Newick Tree:\" << std::endl;\n print_newick_tree(T, br);\n\n \/\/ if is a simulation, print the L2 distance !\n if (simulate) {\n std::cout << \"L2 distance: \" << parameters_distance(Par, Parsim) << std::endl;\n std::cout << \"KL divergence: \" << KL_divergence(T, Par, Parsim) << std::endl;\n std::cout << std::endl;\n }\n\n \/\/ if it is not a simulation, store the parameters in a file !\n if (!simulate) {\n std::fstream st;\n st.precision(15);\n st.setf(std::ios::fixed,std::ios::floatfield);\n st.open(parameters_filename.c_str(), std::ios::out);\n print_parameters(Par, st);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (C) 2014\n\/\/ Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include <iostream>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\n#include <iomanip>\nusing std::setprecision;\n#include <ctime>\n\n#include <ArgumentList.hpp>\nusing isa::utils::ArgumentList;\n#include <InitializeOpenCL.hpp>\nusing isa::OpenCL::initializeOpenCL;\n#include <CLData.hpp>\nusing isa::OpenCL::CLData;\n#include <Exceptions.hpp>\nusing isa::Exceptions::OpenCLError;\n#include <Flops.hpp>\nusing isa::Benchmarks::Flops;\n#include <utils.hpp>\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int nrLoops = 0;\n\tunsigned int minThreads = 0;\n\tunsigned int maxThreads = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 11 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -loops <nr_loops> -min <min_threads> -max <max_threads>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tnrLoops = commandLine.getSwitchArgument< unsigned int >(\"-loops\");\n\t\tminThreads = commandLine.getSwitchArgument< unsigned int >(\"-min\");\n\t\tmaxThreads = commandLine.getSwitchArgument< unsigned int >(\"-max\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\tarrayDim = (oclDevices->at(oclDevice)).getInfo< CL_DEVICE_MAX_MEM_ALLOC_SIZE >();\n\tarrayDim \/= sizeof(float);\n\n\tCLData< float > * A = new CLData< float >(\"A\", true);\n\tCLData< float > * C = new CLData< float >(\"C\", true);\n\n\tA->setCLContext(oclContext);\n\tA->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tA->allocateHostData(arrayDim);\n\tsrand(time(NULL));\n\tfor ( unsigned int i = 0; i < arrayDim; i++ ) {\n\t\tA->setHostDataItem(i, 1.0f \/ static_cast< float >(rand() % 15));\n\t}\n\tC->setCLContext(oclContext);\n\tC->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tC->allocateHostData(arrayDim);\n\ttry {\n\t\tA->setDeviceReadOnly();\n\t\tA->allocateDeviceData();\n\t\tA->copyHostToDevice();\n\t\tC->setDeviceWriteOnly();\n\t\tC->allocateDeviceData();\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << fixed;\n\tcout << arrayDim << endl;\n\tfor (unsigned int threads0 = minThreads; threads0 <= maxThreads; threads0 *= 2 ) {\n\t\tfor (unsigned int threads1 = 1; threads1 <= 32; threads1++ ) {\n\t\t\tif ( (arrayDim % (threads0 * threads1) != 0) || ((threads0 * threads1) > maxThreads) ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tFlops< float > flops = Flops< float >(\"float\");\n\t\t\ttry {\n\t\t\t\tflops.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\t\t\tflops.setNrThreads(arrayDim);\n\t\t\t\tflops.setNrThreadsPerBlock(threads0);\n\t\t\t\tflops.setNrRows(threads1);\n\t\t\t\tflops.setNrIterations(nrLoops);\n\t\t\t\tflops.generateCode();\n\n\t\t\t\tflops(A, C);\n\t\t\t\tflops.reset();\n\t\t\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\t\t\tflops(A, C);\n\t\t\t\t}\n\t\t\t} catch ( OpenCLError &err ) {\n\t\t\t\tcerr << err.what() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tcout << threads0 << \" \" << threads1 << \" \" << setprecision(3) << flops.getGFLOPs() << \" \" << setprecision(6) << flops.getTimer().getAverageTime() << endl;\n\n\t\t}\n\t}\n\tcout << endl;\n\n\treturn 0;\n}\n<commit_msg>There was a spurious print.<commit_after>\/\/\n\/\/ Copyright (C) 2014\n\/\/ Alessio Sclocco <a.sclocco@vu.nl>\n\/\/\n\/\/ This program is free software: you can redistribute it and\/or modify\n\/\/ it under the terms of the GNU General Public License as published by\n\/\/ the Free Software Foundation, either version 3 of the License, or\n\/\/ (at your option) any later version.\n\/\/\n\/\/ This program is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU General Public License\n\/\/ along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\/\/\n\n#include <iostream>\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::fixed;\n#include <iomanip>\nusing std::setprecision;\n#include <ctime>\n\n#include <ArgumentList.hpp>\nusing isa::utils::ArgumentList;\n#include <InitializeOpenCL.hpp>\nusing isa::OpenCL::initializeOpenCL;\n#include <CLData.hpp>\nusing isa::OpenCL::CLData;\n#include <Exceptions.hpp>\nusing isa::Exceptions::OpenCLError;\n#include <Flops.hpp>\nusing isa::Benchmarks::Flops;\n#include <utils.hpp>\nusing isa::utils::same;\n\nconst unsigned int nrIterations = 10;\n\n\nint main(int argc, char * argv[]) {\n\tunsigned int oclPlatform = 0;\n\tunsigned int oclDevice = 0;\n\tunsigned int arrayDim = 0;\n\tunsigned int nrLoops = 0;\n\tunsigned int minThreads = 0;\n\tunsigned int maxThreads = 0;\n\n\t\/\/ Parse command line\n\tif ( argc != 11 ) {\n\t\tcerr << \"Usage: \" << argv[0] << \" -opencl_platform <opencl_platform> -opencl_device <opencl_device> -loops <nr_loops> -min <min_threads> -max <max_threads>\" << endl;\n\t\treturn 1;\n\t}\n\n\tArgumentList commandLine(argc, argv);\n\ttry {\n\t\toclPlatform = commandLine.getSwitchArgument< unsigned int >(\"-opencl_platform\");\n\t\toclDevice = commandLine.getSwitchArgument< unsigned int >(\"-opencl_device\");\n\t\tnrLoops = commandLine.getSwitchArgument< unsigned int >(\"-loops\");\n\t\tminThreads = commandLine.getSwitchArgument< unsigned int >(\"-min\");\n\t\tmaxThreads = commandLine.getSwitchArgument< unsigned int >(\"-max\");\n\t} catch ( exception & err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\t\/\/ Initialize OpenCL\n\tvector< cl::Platform > * oclPlatforms = new vector< cl::Platform >();\n\tcl::Context * oclContext = new cl::Context();\n\tvector< cl::Device > * oclDevices = new vector< cl::Device >();\n\tvector< vector< cl::CommandQueue > > * oclQueues = new vector< vector< cl::CommandQueue > >();\n\ttry {\n\t\tinitializeOpenCL(oclPlatform, 1, oclPlatforms, oclContext, oclDevices, oclQueues);\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\tarrayDim = (oclDevices->at(oclDevice)).getInfo< CL_DEVICE_MAX_MEM_ALLOC_SIZE >();\n\tarrayDim \/= sizeof(float);\n\n\tCLData< float > * A = new CLData< float >(\"A\", true);\n\tCLData< float > * C = new CLData< float >(\"C\", true);\n\n\tA->setCLContext(oclContext);\n\tA->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tA->allocateHostData(arrayDim);\n\tsrand(time(NULL));\n\tfor ( unsigned int i = 0; i < arrayDim; i++ ) {\n\t\tA->setHostDataItem(i, 1.0f \/ static_cast< float >(rand() % 15));\n\t}\n\tC->setCLContext(oclContext);\n\tC->setCLQueue(&(oclQueues->at(oclDevice)[0]));\n\tC->allocateHostData(arrayDim);\n\ttry {\n\t\tA->setDeviceReadOnly();\n\t\tA->allocateDeviceData();\n\t\tA->copyHostToDevice();\n\t\tC->setDeviceWriteOnly();\n\t\tC->allocateDeviceData();\n\t} catch ( OpenCLError &err ) {\n\t\tcerr << err.what() << endl;\n\t\treturn 1;\n\t}\n\n\tcout << fixed;\n\tfor (unsigned int threads0 = minThreads; threads0 <= maxThreads; threads0 *= 2 ) {\n\t\tfor (unsigned int threads1 = 1; threads1 <= 32; threads1++ ) {\n\t\t\tif ( (arrayDim % (threads0 * threads1) != 0) || ((threads0 * threads1) > maxThreads) ) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tFlops< float > flops = Flops< float >(\"float\");\n\t\t\ttry {\n\t\t\t\tflops.bindOpenCL(oclContext, &(oclDevices->at(oclDevice)), &(oclQueues->at(oclDevice)[0]));\n\t\t\t\tflops.setNrThreads(arrayDim);\n\t\t\t\tflops.setNrThreadsPerBlock(threads0);\n\t\t\t\tflops.setNrRows(threads1);\n\t\t\t\tflops.setNrIterations(nrLoops);\n\t\t\t\tflops.generateCode();\n\n\t\t\t\tflops(A, C);\n\t\t\t\tflops.reset();\n\t\t\t\tfor ( unsigned int iter = 0; iter < nrIterations; iter++ ) {\n\t\t\t\t\tflops(A, C);\n\t\t\t\t}\n\t\t\t} catch ( OpenCLError &err ) {\n\t\t\t\tcerr << err.what() << endl;\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tcout << threads0 << \" \" << threads1 << \" \" << setprecision(3) << flops.getGFLOPs() << \" \" << setprecision(6) << flops.getTimer().getAverageTime() << endl;\n\n\t\t}\n\t}\n\tcout << endl;\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <reversed.hpp>\n\n#include <vector>\n#include <array>\n#include <string>\n#include <utility>\n\n#include \"helpers.hpp\"\n#include \"catch.hpp\"\n\nusing iter::reversed;\nusing Vec = const std::vector<int>;\n\nTEST_CASE(\"reversed: can reverse a vector\", \"[reversed]\") {\n Vec ns = {10, 20, 30, 40};\n auto r = reversed(ns);\n\n Vec v(std::begin(r), std::end(r));\n Vec vc = {40, 30, 20, 10};\n\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"reversed: can reverse an array\", \"[reversed]\") {\n int ns[] = {10, 20, 30, 40};\n auto r = reversed(ns);\n\n Vec v(std::begin(r), std::end(r));\n Vec vc = {40, 30, 20, 10};\n\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"reversed: empty when iterable is empty\", \"[reversed]\") {\n Vec emp{};\n auto r = reversed(emp);\n REQUIRE( std::begin(r) == std::end(r) );\n}\n\nTEST_CASE(\"reversed: moves rvalues and binds to lvalues\", \"[reversed]\") {\n itertest::BasicIterable<int> bi{1, 2};\n itertest::BasicIterable<int> bi2{1, 2};\n reversed(bi);\n REQUIRE_FALSE( bi.was_moved_from() );\n\n reversed(std::move(bi2));\n REQUIRE( bi2.was_moved_from() );\n}\n\nTEST_CASE(\"reversed: doesn't move or copy elements of array\", \"[reversed]\") {\n constexpr itertest::SolidInt arr[] = {{6}, {7}, {8}};\n for (auto&& i : reversed(arr)) {\n (void)i;\n }\n}\n\nTEST_CASE(\"reversed: with iterable doesn't move or copy elems\", \"[reversed]\") {\n constexpr std::array<itertest::SolidInt, 3> arr{{{6}, {7}, {8}}};\n for (auto&& i : reversed(arr)) {\n (void)i;\n }\n}\n\nTEST_CASE(\"reversed: iterator meets requirements\", \"[reversed]\") {\n Vec v;\n auto r = reversed(v);\n REQUIRE( itertest::IsIterator<decltype(std::begin(r))>::value );\n}\n<commit_msg>tests reversed iterator with array<commit_after>#include <reversed.hpp>\n\n#include <vector>\n#include <array>\n#include <string>\n#include <utility>\n\n#include \"helpers.hpp\"\n#include \"catch.hpp\"\n\nusing iter::reversed;\nusing Vec = const std::vector<int>;\n\nTEST_CASE(\"reversed: can reverse a vector\", \"[reversed]\") {\n Vec ns = {10, 20, 30, 40};\n auto r = reversed(ns);\n\n Vec v(std::begin(r), std::end(r));\n Vec vc = {40, 30, 20, 10};\n\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"reversed: can reverse an array\", \"[reversed]\") {\n int ns[] = {10, 20, 30, 40};\n auto r = reversed(ns);\n\n Vec v(std::begin(r), std::end(r));\n Vec vc = {40, 30, 20, 10};\n\n REQUIRE( v == vc );\n}\n\nTEST_CASE(\"reversed: empty when iterable is empty\", \"[reversed]\") {\n Vec emp{};\n auto r = reversed(emp);\n REQUIRE( std::begin(r) == std::end(r) );\n}\n\nTEST_CASE(\"reversed: moves rvalues and binds to lvalues\", \"[reversed]\") {\n itertest::BasicIterable<int> bi{1, 2};\n itertest::BasicIterable<int> bi2{1, 2};\n reversed(bi);\n REQUIRE_FALSE( bi.was_moved_from() );\n\n reversed(std::move(bi2));\n REQUIRE( bi2.was_moved_from() );\n}\n\nTEST_CASE(\"reversed: doesn't move or copy elements of array\", \"[reversed]\") {\n constexpr itertest::SolidInt arr[] = {{6}, {7}, {8}};\n for (auto&& i : reversed(arr)) {\n (void)i;\n }\n}\n\nTEST_CASE(\"reversed: with iterable doesn't move or copy elems\", \"[reversed]\") {\n constexpr std::array<itertest::SolidInt, 3> arr{{{6}, {7}, {8}}};\n for (auto&& i : reversed(arr)) {\n (void)i;\n }\n}\n\nTEST_CASE(\"reversed: iterator meets requirements\", \"[reversed]\") {\n Vec v;\n auto r = reversed(v);\n REQUIRE( itertest::IsIterator<decltype(std::begin(r))>::value );\n\n int a[1];\n auto ra = reversed(a);\n REQUIRE( itertest::IsIterator<decltype(std::begin(ra))>::value );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2021, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"rewriter\/small_letter_rewriter.h\"\n\n#include <iterator>\n#include <memory>\n#include <string>\n\n#include \"base\/system_util.h\"\n#include \"engine\/mock_data_engine_factory.h\"\n#include \"protocol\/commands.pb.h\"\n#include \"protocol\/config.pb.h\"\n#include \"testing\/base\/public\/gunit.h\"\n\nnamespace mozc {\nnamespace {\n\nvoid AddSegment(const std::string &key, const std::string &value,\n Segments *segments) {\n Segment *seg = segments->add_segment();\n Segment::Candidate *candidate = seg->add_candidate();\n seg->set_key(key);\n candidate->content_key = key;\n candidate->value = value;\n candidate->content_value = value;\n}\n\nvoid InitSegments(const std::string &key, const std::string &value,\n Segments *segments) {\n segments->Clear();\n AddSegment(key, value, segments);\n}\n\nbool ContainCandidate(const Segments &segments, const std::string &candidate) {\n const Segment &segment = segments.segment(0);\n for (size_t i = 0; i < segment.candidates_size(); ++i) {\n if (candidate == segment.candidate(i).value) {\n return true;\n }\n }\n return false;\n}\n\n} \/\/ namespace\n\nclass SmallLetterRewriterTest : public ::testing::Test {\n protected:\n \/\/ Workaround for C2512 error (no default appropriate constructor) on MSVS.\n SmallLetterRewriterTest() {}\n ~SmallLetterRewriterTest() override {}\n\n void SetUp() override {\n SystemUtil::SetUserProfileDirectory(absl::GetFlag(FLAGS_test_tmpdir));\n engine_ = MockDataEngineFactory::Create().value();\n }\n\n std::unique_ptr<EngineInterface> engine_;\n const commands::Request &default_request() const { return default_request_; }\n const config::Config &default_config() const { return default_config_; }\n\n private:\n const commands::Request default_request_;\n const config::Config default_config_;\n};\n\nTEST_F(SmallLetterRewriterTest, ScriptConversionTest) {\n Segments segments;\n SmallLetterRewriter rewriter(engine_->GetConverter());\n const ConversionRequest request;\n\n struct InputOutputData {\n const char *input;\n const char *output;\n };\n\n const InputOutputData kInputOutputData[] = {\n \/\/ Superscript\n {\"^123\", \"¹²³\"},\n {\"^4\", \"⁴\"},\n {\"^56789\", \"⁵⁶⁷⁸⁹\"},\n\n \/\/ Subscript\n {\"_123\", \"₁₂₃\"},\n {\"_4\", \"₄\"},\n {\"_56789\", \"₅₆₇₈₉\"},\n };\n\n const char *kMozcUnsupportedInput[] = {\n \/\/ Roman alhapet superscript\/subscript\n \"^n\",\n \"^x\",\n \"^a\",\n \"^2x\",\n\n \"_m\",\n \"_y\",\n \"_b\",\n \"_2y\",\n\n \/\/ Symbol superscript\/subscript\n \"^+\",\n \"_-\",\n };\n\n \/\/ Allowed cases\n for (size_t i = 0; i < std::size(kInputOutputData); ++i) {\n InitSegments(kInputOutputData[i].input, kInputOutputData[i].input,\n &segments);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_TRUE(ContainCandidate(segments, kInputOutputData[i].output));\n }\n\n \/\/ Mozc does not accept some superscript\/subscript supported in Unicode\n for (size_t i = 0; i < std::size(kMozcUnsupportedInput); ++i) {\n InitSegments(kMozcUnsupportedInput[i], kMozcUnsupportedInput[i], &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n }\n\n \/\/ Invalid style input\n InitSegments(\"^\", \"^\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"_\", \"_\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"12345\", \"12345\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"^^12345\", \"^^12345\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n}\n\nTEST_F(SmallLetterRewriterTest, MultipleSegment) {\n Segments segments;\n SmallLetterRewriter rewriter(engine_->GetConverter());\n const ConversionRequest request;\n\n \/\/ Multiple segments are combined.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"45\", \"45\", &segments);\n AddSegment(\"6\", \"6\", &segments);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_EQ(1, segments.conversion_segments_size());\n EXPECT_EQ(\"¹²³⁴⁵⁶\", segments.conversion_segment(0).candidate(0).value);\n\n \/\/ If the segments is already resized, returns false.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"^123\", \"^123\", &segments);\n segments.set_resized(true);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n \/\/ History segment has to be ignored.\n \/\/ In this case 1st segment is HISTORY\n \/\/ so this rewriting returns true.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"^123\", \"^123\", &segments);\n segments.set_resized(true);\n segments.mutable_segment(0)->set_segment_type(Segment::HISTORY);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_EQ(\"¹²³\", segments.conversion_segment(0).candidate(0).value);\n}\n\n} \/\/ namespace mozc\n<commit_msg>Include googletest.h to fix the build error.<commit_after>\/\/ Copyright 2010-2021, Google Inc.\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"rewriter\/small_letter_rewriter.h\"\n\n#include <iterator>\n#include <memory>\n#include <string>\n\n#include \"base\/system_util.h\"\n#include \"engine\/mock_data_engine_factory.h\"\n#include \"protocol\/commands.pb.h\"\n#include \"protocol\/config.pb.h\"\n#include \"testing\/base\/public\/googletest.h\"\n#include \"testing\/base\/public\/gunit.h\"\n\nnamespace mozc {\nnamespace {\n\nvoid AddSegment(const std::string &key, const std::string &value,\n Segments *segments) {\n Segment *seg = segments->add_segment();\n Segment::Candidate *candidate = seg->add_candidate();\n seg->set_key(key);\n candidate->content_key = key;\n candidate->value = value;\n candidate->content_value = value;\n}\n\nvoid InitSegments(const std::string &key, const std::string &value,\n Segments *segments) {\n segments->Clear();\n AddSegment(key, value, segments);\n}\n\nbool ContainCandidate(const Segments &segments, const std::string &candidate) {\n const Segment &segment = segments.segment(0);\n for (size_t i = 0; i < segment.candidates_size(); ++i) {\n if (candidate == segment.candidate(i).value) {\n return true;\n }\n }\n return false;\n}\n\n} \/\/ namespace\n\nclass SmallLetterRewriterTest : public ::testing::Test {\n protected:\n \/\/ Workaround for C2512 error (no default appropriate constructor) on MSVS.\n SmallLetterRewriterTest() {}\n ~SmallLetterRewriterTest() override {}\n\n void SetUp() override {\n SystemUtil::SetUserProfileDirectory(absl::GetFlag(FLAGS_test_tmpdir));\n engine_ = MockDataEngineFactory::Create().value();\n }\n\n std::unique_ptr<EngineInterface> engine_;\n const commands::Request &default_request() const { return default_request_; }\n const config::Config &default_config() const { return default_config_; }\n\n private:\n const commands::Request default_request_;\n const config::Config default_config_;\n};\n\nTEST_F(SmallLetterRewriterTest, ScriptConversionTest) {\n Segments segments;\n SmallLetterRewriter rewriter(engine_->GetConverter());\n const ConversionRequest request;\n\n struct InputOutputData {\n const char *input;\n const char *output;\n };\n\n const InputOutputData kInputOutputData[] = {\n \/\/ Superscript\n {\"^123\", \"¹²³\"},\n {\"^4\", \"⁴\"},\n {\"^56789\", \"⁵⁶⁷⁸⁹\"},\n\n \/\/ Subscript\n {\"_123\", \"₁₂₃\"},\n {\"_4\", \"₄\"},\n {\"_56789\", \"₅₆₇₈₉\"},\n };\n\n const char *kMozcUnsupportedInput[] = {\n \/\/ Roman alhapet superscript\/subscript\n \"^n\",\n \"^x\",\n \"^a\",\n \"^2x\",\n\n \"_m\",\n \"_y\",\n \"_b\",\n \"_2y\",\n\n \/\/ Symbol superscript\/subscript\n \"^+\",\n \"_-\",\n };\n\n \/\/ Allowed cases\n for (size_t i = 0; i < std::size(kInputOutputData); ++i) {\n InitSegments(kInputOutputData[i].input, kInputOutputData[i].input,\n &segments);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_TRUE(ContainCandidate(segments, kInputOutputData[i].output));\n }\n\n \/\/ Mozc does not accept some superscript\/subscript supported in Unicode\n for (size_t i = 0; i < std::size(kMozcUnsupportedInput); ++i) {\n InitSegments(kMozcUnsupportedInput[i], kMozcUnsupportedInput[i], &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n }\n\n \/\/ Invalid style input\n InitSegments(\"^\", \"^\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"_\", \"_\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"12345\", \"12345\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n InitSegments(\"^^12345\", \"^^12345\", &segments);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n}\n\nTEST_F(SmallLetterRewriterTest, MultipleSegment) {\n Segments segments;\n SmallLetterRewriter rewriter(engine_->GetConverter());\n const ConversionRequest request;\n\n \/\/ Multiple segments are combined.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"45\", \"45\", &segments);\n AddSegment(\"6\", \"6\", &segments);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_EQ(1, segments.conversion_segments_size());\n EXPECT_EQ(\"¹²³⁴⁵⁶\", segments.conversion_segment(0).candidate(0).value);\n\n \/\/ If the segments is already resized, returns false.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"^123\", \"^123\", &segments);\n segments.set_resized(true);\n EXPECT_FALSE(rewriter.Rewrite(request, &segments));\n\n \/\/ History segment has to be ignored.\n \/\/ In this case 1st segment is HISTORY\n \/\/ so this rewriting returns true.\n InitSegments(\"^123\", \"^123\", &segments);\n AddSegment(\"^123\", \"^123\", &segments);\n segments.set_resized(true);\n segments.mutable_segment(0)->set_segment_type(Segment::HISTORY);\n EXPECT_TRUE(rewriter.Rewrite(request, &segments));\n EXPECT_EQ(\"¹²³\", segments.conversion_segment(0).candidate(0).value);\n}\n\n} \/\/ namespace mozc\n<|endoftext|>"} {"text":"<commit_before>\/\/ Command.cpp\n\/\/\n\n#include <vector>\n#include <string>\n#include \"CommandFactory.h\"\n#include \"Command.h\"\n\nCommandAbstract* CommandFactory::create(Player* &player, std::vector <std::string> commandFull)\n{\n std::string cmd = commandFull[0];\n commandFull.erase(commandFull.begin());\n\n CommandAbstract* command;\n\n if (cmd.compare(\"talk\") == 0) {\n if (!player->isConnected() || !player->connect()) {\n throw \"A player must be connected to launch the command talk\";\n }\n command = new CommandTalk();\n }\n else {\n return NULL;\n }\n\n command->setArgs(commandFull);\n command->setPlayer(player);\n return command;\n}\n<commit_msg>command plugged<commit_after>\/\/ Command.cpp\n\/\/\n\n#include <vector>\n#include <string>\n#include \"CommandFactory.h\"\n#include \"Command.h\"\n\nCommandAbstract* CommandFactory::create(Player* &player, std::vector <std::string> commandFull)\n{\n std::string cmd = commandFull[0];\n commandFull.erase(commandFull.begin());\n\n CommandAbstract* command;\n\n if (cmd.compare(\"talk\") == 0) {\n if (!player->isConnected() || !player->connect()) {\n throw \"A player must be connected to launch the command talk\";\n }\n command = new CommandTalk();\n }\n else if (cmd.compare(\"createPlayer\") == 0) {\n if (player->isConnected()) {\n throw \"There must not be a connected player to create a new player\";\n }\n }\n else {\n return NULL;\n }\n\n command->setArgs(commandFull);\n command->setPlayer(player);\n return command;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * KaRad.c\n *\n * Created on: Dec 24, 2015\n * Author: molnarkaroly\n *\/\n\n\n\/**\n * KaRad\n *\n * (C) Karoly Molnar 2015\n * MIT license see license.md in the repository\n *\/\n\n#include <Arduino.h>\n\n#include <ESP8266WiFi.h>\n#include <ESP8266WiFiMulti.h>\n\n#include <ESP8266HTTPClient.h>\n#include <ESP8266httpUpdate.h>\n#include <DNSServer.h>\n#include <ESP8266WebServer.h>\n#include <WiFiManager.h> \/\/https:\/\/github.com\/tzapu\/WiFiManager\n#include <ESP8266mDNS.h>\n#include <WiFiUdp.h>\n#include <ArduinoOTA.h>\n\nextern \"C\" {\n#include \"ets_sys.h\"\n#include \"os_type.h\"\n#include \"osapi.h\"\n#include \"mem.h\"\n#include \"user_interface.h\"\n#include \"cont.h\"\n}\n\n#include \"apikey.h\" \/\/contains a single line of 'String apikey = \"XXXXXXXXXXXXX\";'\n\nADC_MODE(ADC_VCC);\n\nconst int led_pin = BUILTIN_LED;\/\/or 13;\nconst int beep_pin = D1; \/\/ GPIO05\nconst char ap_hostname[] = \"KaRad1\";\n#define CPM_BEEP_LIMIT 100\n#define T_REPORT_MS (60 * 1000)\nconst char* server = \"emoncms.org\";\n\n\n#define CFG_VALID\t0x1abbcc\n\nvoid configModeCallback () {\n digitalWrite(led_pin, LOW); \/\/turn LED on if AP mode i.e. configuration is needed\n}\n\nenum sensorState_t {\n sensor_standalone,\n sensor_connected,\n sensor_update,\n sensor_unknown};\n\nbool sendUpdate(uint16_t voltage, uint16_t cpm);\n\nWiFiManager wifiManager;\n\nWiFiClient client;\n\ntypedef struct {\n uint32_t s_cpm;\n uint32_t s_time;\n uint32_t s_beep;\n uint32_t s_report;\n sensorState_t sensorState;\n uint32_t s_valid;\n}saved_t;\n\nsaved_t rtcStore;\nuint32_t cpm;\n\n#define DEBUG\n\nvoid setup() {\n bool report = false;\n \/\/the wakeup was caused by a new impulse form the GM tube\n uint32_t t_now = millis();\/\/we store ms not us\n system_rtc_mem_read(65, &rtcStore, sizeof(rtcStore));\n pinMode(led_pin, OUTPUT);\n\n if(rtcStore.s_valid != CFG_VALID) {\n rtcStore.s_cpm = 0;\n rtcStore.s_time = system_get_time()\/1000;\n rtcStore.s_beep = 0;\n rtcStore.s_report = 0;\n rtcStore.sensorState = sensor_unknown;\n rtcStore.s_valid = CFG_VALID;\n cpm = 0;\n }else {\n if((rtcStore.s_beep) || (rtcStore.s_cpm > CPM_BEEP_LIMIT)) {\n analogWriteFreq(2000);\n pinMode(beep_pin,OUTPUT);\n analogWrite(beep_pin,PWMRANGE>>1);\n delay(10);\n analogWrite(beep_pin,0);\n }\n\n\n#ifdef DEBUG\n digitalWrite(led_pin, LOW);\n delay(50);\n digitalWrite(led_pin, HIGH);\n#endif\n\n uint32_t t_diff;\n if(t_now > rtcStore.s_time) {\n t_diff = t_now - rtcStore.s_time;\n }else {\n t_diff = (0xffffffff - rtcStore.s_time) + t_now;\n }\n rtcStore.s_cpm++;\n if(t_diff >= T_REPORT_MS) { \/\/ time to report!\n if(rtcStore.s_report) {\n cpm = (rtcStore.s_cpm * t_diff) \/ T_REPORT_MS;\n rtcStore.s_cpm = 0;\n rtcStore.s_report = 0;\n }else {\n rtcStore.s_cpm--;\n rtcStore.s_report = 1;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(1);\t\/\/ enable radio after wakeup\n system_deep_sleep(2); \/\/ wake up immediately\n }\n }else {\n rtcStore.s_time = t_now;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n }\n\n }\n\n\n Serial.begin(115200);\n\n \/\/reset saved settings\n \/\/\twifiManager.resetSettings();\n if(rtcStore.sensorState != sensor_standalone) {\n struct rst_info *thisreset;\n thisreset = system_get_rst_info();\n\n if(thisreset->reason != REASON_DEEP_SLEEP_AWAKE) {\n wifiManager.setTimeout(180);\n }else {\n wifiManager.setTimeout(20);\n }\n\n wifiManager.setAPCallback(configModeCallback);\n\n\n ArduinoOTA.onStart([]() {\n digitalWrite(led_pin, LOW);\n rtcStore.sensorState = sensor_update;\n });\n ArduinoOTA.onEnd([]() {\n \/\/invalidate config\n rtcStore.s_valid = 0;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n digitalWrite(led_pin, HIGH);\n });\n ArduinoOTA.onError([](ota_error_t error) {\n Serial.printf(\"Error[%u]: \", error);\n rtcStore.sensorState = sensor_connected;\n });\n\n if(wifiManager.autoConnect(ap_hostname)) {\n \/\/if you get here you have connected to the WiFi\n Serial.println(\"connected... :)\");\n rtcStore.sensorState = sensor_connected;\n ArduinoOTA.setHostname(ap_hostname);\n ArduinoOTA.begin();\n }else {\n \/\/was unable to connect and timeout\n Serial.println(\"No connection was possible within 3 minutes... :(\");\n rtcStore.sensorState = sensor_standalone;\n rtcStore.s_beep = 1;\n }\n }else {\n rtcStore.s_time = millis();\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n }\n}\n\nvoid loop() {\n\n#ifdef WDT_ENABLED\n ESP.wdtFeed();\n#endif\n\n if(rtcStore.sensorState == sensor_connected) {\n uint16_t voltage = ESP.getVcc();\n if(!sendUpdate(voltage,cpm)) {\n rtcStore.s_beep = 1;\n }\n rtcStore.s_time = millis();\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n\n }\n\n if(rtcStore.sensorState == sensor_update) {\n ArduinoOTA.handle();\n }\n}\n\nbool sendUpdate(uint16_t voltage, uint16_t cpm) {\n if (client.connect(server,80)) {\n client.print(\"GET \/input\/post.json?json={\");\n client.print(\"vbat:\");\n client.print(voltage);\n client.print(\",cpm:\");\n client.print(cpm);\n client.print(\"}&apikey=\");\n client.print(apikey);\n client.println(\" HTTP\/1.1\");\n client.println(\"Host:emoncms.org\");\n client.println(\"User-Agent: ESP8266-KaRad\");\n client.println(\"Connection: close\");\n client.println();\n return true;\n }else {\n return false;\n }\n}\n\n<commit_msg>voltage reading moved up before Wifi is connected in order to improve accuracy<commit_after>\/*\n * KaRad.c\n *\n * Created on: Dec 24, 2015\n * Author: molnarkaroly\n *\/\n\n\n\/**\n * KaRad\n *\n * (C) Karoly Molnar 2015\n * MIT license see license.md in the repository\n *\/\n\n#include <Arduino.h>\n\n#include <ESP8266WiFi.h>\n#include <ESP8266WiFiMulti.h>\n\n#include <ESP8266HTTPClient.h>\n#include <ESP8266httpUpdate.h>\n#include <DNSServer.h>\n#include <ESP8266WebServer.h>\n#include <WiFiManager.h> \/\/https:\/\/github.com\/tzapu\/WiFiManager\n#include <ESP8266mDNS.h>\n#include <WiFiUdp.h>\n#include <ArduinoOTA.h>\n\nextern \"C\" {\n#include \"ets_sys.h\"\n#include \"os_type.h\"\n#include \"osapi.h\"\n#include \"mem.h\"\n#include \"user_interface.h\"\n#include \"cont.h\"\n}\n\n#include \"apikey.h\" \/\/contains a single line of 'String apikey = \"XXXXXXXXXXXXX\";'\n\nADC_MODE(ADC_VCC);\n\nconst int led_pin = BUILTIN_LED;\/\/or 13;\nconst int beep_pin = D1; \/\/ GPIO05\nconst char ap_hostname[] = \"KaRad1\";\n#define CPM_BEEP_LIMIT 100\n#define T_REPORT_MS (60 * 1000)\nconst char* server = \"emoncms.org\";\n\n\n#define CFG_VALID\t0x1abbcc\n\nvoid configModeCallback () {\n digitalWrite(led_pin, LOW); \/\/turn LED on if AP mode i.e. configuration is needed\n}\n\nenum sensorState_t {\n sensor_standalone,\n sensor_connected,\n sensor_update,\n sensor_unknown};\n\nbool sendUpdate(uint16_t voltage, uint16_t cpm);\n\nWiFiManager wifiManager;\n\nWiFiClient client;\n\ntypedef struct {\n uint32_t s_cpm;\n uint32_t s_time;\n uint32_t s_beep;\n uint32_t s_report;\n sensorState_t sensorState;\n uint32_t s_valid;\n}saved_t;\n\nsaved_t rtcStore;\nuint32_t cpm;\nuint16_t voltage;\n\n#define DEBUG\n\nvoid setup() {\n bool report = false;\n \/\/the wakeup was caused by a new impulse form the GM tube\n uint32_t t_now = millis();\/\/we store ms not us\n system_rtc_mem_read(65, &rtcStore, sizeof(rtcStore));\n pinMode(led_pin, OUTPUT);\n\n if(rtcStore.s_valid != CFG_VALID) {\n rtcStore.s_cpm = 0;\n rtcStore.s_time = system_get_time()\/1000;\n rtcStore.s_beep = 0;\n rtcStore.s_report = 0;\n rtcStore.sensorState = sensor_unknown;\n rtcStore.s_valid = CFG_VALID;\n cpm = 0;\n }else {\n if((rtcStore.s_beep) || (rtcStore.s_cpm > CPM_BEEP_LIMIT)) {\n analogWriteFreq(2000);\n pinMode(beep_pin,OUTPUT);\n analogWrite(beep_pin,PWMRANGE>>1);\n delay(10);\n analogWrite(beep_pin,0);\n }\n\n\n#ifdef DEBUG\n digitalWrite(led_pin, LOW);\n delay(50);\n digitalWrite(led_pin, HIGH);\n#endif\n\n uint32_t t_diff;\n if(t_now > rtcStore.s_time) {\n t_diff = t_now - rtcStore.s_time;\n }else {\n t_diff = (0xffffffff - rtcStore.s_time) + t_now;\n }\n rtcStore.s_cpm++;\n if(t_diff >= T_REPORT_MS) { \/\/ time to report!\n if(rtcStore.s_report) {\n cpm = (rtcStore.s_cpm * t_diff) \/ T_REPORT_MS;\n rtcStore.s_cpm = 0;\n rtcStore.s_report = 0;\n }else {\n rtcStore.s_cpm--;\n rtcStore.s_report = 1;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(1);\t\/\/ enable radio after wakeup\n system_deep_sleep(2); \/\/ wake up immediately\n }\n }else {\n rtcStore.s_time = t_now;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n }\n\n }\n\n\n Serial.begin(115200);\n voltage = ESP.getVcc();\n\n \/\/reset saved settings\n \/\/\twifiManager.resetSettings();\n if(rtcStore.sensorState != sensor_standalone) {\n struct rst_info *thisreset;\n thisreset = system_get_rst_info();\n\n if(thisreset->reason != REASON_DEEP_SLEEP_AWAKE) {\n wifiManager.setTimeout(180);\n }else {\n wifiManager.setTimeout(20);\n }\n\n wifiManager.setAPCallback(configModeCallback);\n\n\n ArduinoOTA.onStart([]() {\n digitalWrite(led_pin, LOW);\n rtcStore.sensorState = sensor_update;\n });\n ArduinoOTA.onEnd([]() {\n \/\/invalidate config\n rtcStore.s_valid = 0;\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n digitalWrite(led_pin, HIGH);\n });\n ArduinoOTA.onError([](ota_error_t error) {\n Serial.printf(\"Error[%u]: \", error);\n rtcStore.sensorState = sensor_connected;\n });\n\n if(wifiManager.autoConnect(ap_hostname)) {\n \/\/if you get here you have connected to the WiFi\n Serial.println(\"connected... :)\");\n rtcStore.sensorState = sensor_connected;\n ArduinoOTA.setHostname(ap_hostname);\n ArduinoOTA.begin();\n }else {\n \/\/was unable to connect and timeout\n Serial.println(\"No connection was possible within 3 minutes... :(\");\n rtcStore.sensorState = sensor_standalone;\n rtcStore.s_beep = 1;\n }\n }else {\n rtcStore.s_time = millis();\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n }\n}\n\nvoid loop() {\n\n#ifdef WDT_ENABLED\n ESP.wdtFeed();\n#endif\n\n if(rtcStore.sensorState == sensor_connected) {\n if(!sendUpdate(voltage,cpm)) {\n rtcStore.s_beep = 1;\n }\n rtcStore.s_time = millis();\n system_rtc_mem_write(65, &rtcStore, sizeof(rtcStore));\n system_deep_sleep_set_option(4);\t\/\/ no radio after wakeup\n system_deep_sleep(0); \/\/ wait for falling edge on reset pin\n\n }\n\n if(rtcStore.sensorState == sensor_update) {\n ArduinoOTA.handle();\n }\n}\n\nbool sendUpdate(uint16_t voltage, uint16_t cpm) {\n if (client.connect(server,80)) {\n client.print(\"GET \/input\/post.json?json={\");\n client.print(\"vbat:\");\n client.print(voltage);\n client.print(\",cpm:\");\n client.print(cpm);\n client.print(\"}&apikey=\");\n client.print(apikey);\n client.println(\" HTTP\/1.1\");\n client.println(\"Host:emoncms.org\");\n client.println(\"User-Agent: ESP8266-KaRad\");\n client.println(\"Connection: close\");\n client.println();\n return true;\n }else {\n return false;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file LexVB.cxx\n ** Lexer for Visual Basic and VBScript.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic bool IsVBComment(Accessor &styler, int pos, int len) {\n\treturn len>0 && styler[pos]=='\\'';\n}\n\ninline bool IsTypeCharacter(const int ch) {\n\treturn ch == '%' || ch == '&' || ch == '@' || ch == '!' || ch == '#' || ch == '$';\n}\n\ninline bool IsAWordChar(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\nstatic void ColouriseVBDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler, bool vbScriptSyntax) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tstyler.StartAt(startPos);\n\n\tint visibleChars = 0;\n\n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\n\t\tif (sc.state == SCE_B_OPERATOR) {\n\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t} else if (sc.state == SCE_B_KEYWORD) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tif (vbScriptSyntax || !IsTypeCharacter(sc.ch)) {\n\t\t\t\t\tif (sc.ch == ']')\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\tchar s[100];\n\t\t\t\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\t\tif (keywords.InList(s)) {\n\t\t\t\t\t\tif (strcmp(s, \"rem\") == 0) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_B_COMMENT);\n\t\t\t\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsc.ChangeState(SCE_B_IDENTIFIER);\n\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_STRING) {\n\t\t\t\/\/ VB doubles quotes to preserve them, so just end this string \n\t\t\t\/\/ state now as a following quote will start again\n\t\t\tif (sc.ch == '\\\"') {\n\t\t\t\tif (tolower(sc.chNext) == 'c') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t\tsc.ForwardSetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_COMMENT) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_PREPROCESSOR) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_DATE) {\n\t\t\tif (sc.ch == '#') {\n\t\t\t\tsc.ForwardSetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.state == SCE_B_DEFAULT) {\n\t\t\tif (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_B_COMMENT);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_B_STRING);\n\t\t\t} else if (sc.ch == '#' && visibleChars == 0) {\n\t\t\t\t\/\/ Preprocessor commands are alone on their line\n\t\t\t\tsc.SetState(SCE_B_PREPROCESSOR);\n\t\t\t} else if (sc.ch == '#') {\n\t\t\t\tint n = 1;\n\t\t\t\tint chSeek = ' ';\n\t\t\t\twhile (chSeek == ' ' || chSeek == '\\t') {\n\t\t\t\t\tchSeek = sc.GetRelative(n);\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif (IsADigit(chSeek)) {\n\t\t\t\t\tsc.SetState(SCE_B_DATE);\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_B_OPERATOR);\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '&' && tolower(sc.chNext) == 'h') {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (sc.ch == '&' && tolower(sc.chNext) == 'o') {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (IsAWordStart(sc.ch) || (sc.ch == '[')) {\n\t\t\t\tsc.SetState(SCE_B_KEYWORD);\n\t\t\t} else if (isoperator(static_cast<char>(sc.ch)) || (sc.ch == '\\\\')) {\n\t\t\t\tsc.SetState(SCE_B_OPERATOR);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.atLineEnd) {\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!IsASpace(sc.ch)) {\n\t\t\tvisibleChars++;\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic void FoldVBDoc(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint endPos = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsVBComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == endPos)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsVBComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsVBComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void ColouriseVBNetDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler) {\n\tColouriseVBDoc(startPos, length, initStyle, keywordlists, styler, false);\n}\n\nstatic void ColouriseVBScriptDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler) {\n\tColouriseVBDoc(startPos, length, initStyle, keywordlists, styler, true);\n}\n\nLexerModule lmVB(SCLEX_VB, ColouriseVBNetDoc, \"vb\", FoldVBDoc);\nLexerModule lmVBScript(SCLEX_VBSCRIPT, ColouriseVBScriptDoc, \"vbscript\", FoldVBDoc);\n\n<commit_msg>Made file handle constants in statements such as \"close #1\" work by styling them in the date literal style.<commit_after>\/\/ Scintilla source code edit control\n\/** @file LexVB.cxx\n ** Lexer for Visual Basic and VBScript.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <stdlib.h>\n#include <string.h>\n#include <ctype.h>\n#include <stdio.h>\n#include <stdarg.h>\n\n#include \"Platform.h\"\n\n#include \"PropSet.h\"\n#include \"Accessor.h\"\n#include \"StyleContext.h\"\n#include \"KeyWords.h\"\n#include \"Scintilla.h\"\n#include \"SciLexer.h\"\n\nstatic bool IsVBComment(Accessor &styler, int pos, int len) {\n\treturn len>0 && styler[pos]=='\\'';\n}\n\ninline bool IsTypeCharacter(const int ch) {\n\treturn ch == '%' || ch == '&' || ch == '@' || ch == '!' || ch == '#' || ch == '$';\n}\n\ninline bool IsAWordChar(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '.' || ch == '_');\n}\n\ninline bool IsAWordStart(const int ch) {\n\treturn (ch < 0x80) && (isalnum(ch) || ch == '_');\n}\n\ninline bool IsADateCharacter(const int ch) {\n\treturn (ch < 0x80) && \n\t\t(isalnum(ch) || ch == '|' || ch == '-' || ch == '\/' || ch == ':' || ch == ' ' || ch == '\\t');\n}\n\nstatic void ColouriseVBDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler, bool vbScriptSyntax) {\n\n\tWordList &keywords = *keywordlists[0];\n\n\tstyler.StartAt(startPos);\n\n\tint visibleChars = 0;\n\t\t\t\t \n\tStyleContext sc(startPos, length, initStyle, styler);\n\n\tfor (; sc.More(); sc.Forward()) {\n\n\t\tif (sc.state == SCE_B_OPERATOR) {\n\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t} else if (sc.state == SCE_B_KEYWORD) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tif (vbScriptSyntax || !IsTypeCharacter(sc.ch)) {\n\t\t\t\t\tif (sc.ch == ']')\n\t\t\t\t\t\tsc.Forward();\n\t\t\t\t\tchar s[100];\n\t\t\t\t\tsc.GetCurrentLowered(s, sizeof(s));\n\t\t\t\t\tif (keywords.InList(s)) {\n\t\t\t\t\t\tif (strcmp(s, \"rem\") == 0) {\n\t\t\t\t\t\t\tsc.ChangeState(SCE_B_COMMENT);\n\t\t\t\t\t\t\tif (sc.atLineEnd) {\n\t\t\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsc.ChangeState(SCE_B_IDENTIFIER);\n\t\t\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_NUMBER) {\n\t\t\tif (!IsAWordChar(sc.ch)) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_STRING) {\n\t\t\t\/\/ VB doubles quotes to preserve them, so just end this string \n\t\t\t\/\/ state now as a following quote will start again\n\t\t\tif (sc.ch == '\\\"') {\n\t\t\t\tif (tolower(sc.chNext) == 'c') {\n\t\t\t\t\tsc.Forward();\n\t\t\t\t}\n\t\t\t\tsc.ForwardSetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_COMMENT) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_PREPROCESSOR) {\n\t\t\tif (sc.atLineEnd) {\n\t\t\t\tsc.SetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t} else if (sc.state == SCE_B_DATE) {\n\t\t\tif (sc.ch == '#' || !IsADateCharacter(sc.chNext)) {\n\t\t\t\tsc.ForwardSetState(SCE_B_DEFAULT);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.state == SCE_B_DEFAULT) {\n\t\t\tif (sc.ch == '\\'') {\n\t\t\t\tsc.SetState(SCE_B_COMMENT);\n\t\t\t} else if (sc.ch == '\\\"') {\n\t\t\t\tsc.SetState(SCE_B_STRING);\n\t\t\t} else if (sc.ch == '#' && visibleChars == 0) {\n\t\t\t\t\/\/ Preprocessor commands are alone on their line\n\t\t\t\tsc.SetState(SCE_B_PREPROCESSOR);\n\t\t\t} else if (sc.ch == '#') {\n\t\t\t\tint n = 1;\n\t\t\t\tint chSeek = ' ';\n\t\t\t\twhile (chSeek == ' ' || chSeek == '\\t') {\n\t\t\t\t\tchSeek = sc.GetRelative(n);\n\t\t\t\t\tn++;\n\t\t\t\t}\n\t\t\t\tif (IsADigit(chSeek)) {\n\t\t\t\t\tsc.SetState(SCE_B_DATE);\n\t\t\t\t} else {\n\t\t\t\t\tsc.SetState(SCE_B_OPERATOR);\n\t\t\t\t}\n\t\t\t} else if (sc.ch == '&' && tolower(sc.chNext) == 'h') {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (sc.ch == '&' && tolower(sc.chNext) == 'o') {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (IsADigit(sc.ch) || (sc.ch == '.' && IsADigit(sc.chNext))) {\n\t\t\t\tsc.SetState(SCE_B_NUMBER);\n\t\t\t} else if (IsAWordStart(sc.ch) || (sc.ch == '[')) {\n\t\t\t\tsc.SetState(SCE_B_KEYWORD);\n\t\t\t} else if (isoperator(static_cast<char>(sc.ch)) || (sc.ch == '\\\\')) {\n\t\t\t\tsc.SetState(SCE_B_OPERATOR);\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (sc.atLineEnd) {\n\t\t\tvisibleChars = 0;\n\t\t}\n\t\tif (!IsASpace(sc.ch)) {\n\t\t\tvisibleChars++;\n\t\t}\n\t}\n\tsc.Complete();\n}\n\nstatic void FoldVBDoc(unsigned int startPos, int length, int,\n\t\t\t\t\t\t WordList *[], Accessor &styler) {\n\tint endPos = startPos + length;\n\n\t\/\/ Backtrack to previous line in case need to fix its fold status\n\tint lineCurrent = styler.GetLine(startPos);\n\tif (startPos > 0) {\n\t\tif (lineCurrent > 0) {\n\t\t\tlineCurrent--;\n\t\t\tstartPos = styler.LineStart(lineCurrent);\n\t\t}\n\t}\n\tint spaceFlags = 0;\n\tint indentCurrent = styler.IndentAmount(lineCurrent, &spaceFlags, IsVBComment);\n\tchar chNext = styler[startPos];\n\tfor (int i = startPos; i < endPos; i++) {\n\t\tchar ch = chNext;\n\t\tchNext = styler.SafeGetCharAt(i + 1);\n\n\t\tif ((ch == '\\r' && chNext != '\\n') || (ch == '\\n') || (i == endPos)) {\n\t\t\tint lev = indentCurrent;\n\t\t\tint indentNext = styler.IndentAmount(lineCurrent + 1, &spaceFlags, IsVBComment);\n\t\t\tif (!(indentCurrent & SC_FOLDLEVELWHITEFLAG)) {\n\t\t\t\t\/\/ Only non whitespace lines can be headers\n\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t} else if (indentNext & SC_FOLDLEVELWHITEFLAG) {\n\t\t\t\t\t\/\/ Line after is blank so check the next - maybe should continue further?\n\t\t\t\t\tint spaceFlags2 = 0;\n\t\t\t\t\tint indentNext2 = styler.IndentAmount(lineCurrent + 2, &spaceFlags2, IsVBComment);\n\t\t\t\t\tif ((indentCurrent & SC_FOLDLEVELNUMBERMASK) < (indentNext2 & SC_FOLDLEVELNUMBERMASK)) {\n\t\t\t\t\t\tlev |= SC_FOLDLEVELHEADERFLAG;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tindentCurrent = indentNext;\n\t\t\tstyler.SetLevel(lineCurrent, lev);\n\t\t\tlineCurrent++;\n\t\t}\n\t}\n}\n\nstatic void ColouriseVBNetDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler) {\n\tColouriseVBDoc(startPos, length, initStyle, keywordlists, styler, false);\n}\n\nstatic void ColouriseVBScriptDoc(unsigned int startPos, int length, int initStyle,\n WordList *keywordlists[], Accessor &styler) {\n\tColouriseVBDoc(startPos, length, initStyle, keywordlists, styler, true);\n}\n\nLexerModule lmVB(SCLEX_VB, ColouriseVBNetDoc, \"vb\", FoldVBDoc);\nLexerModule lmVBScript(SCLEX_VBSCRIPT, ColouriseVBScriptDoc, \"vbscript\", FoldVBDoc);\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ sensorFile.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n#include <iomanip>\n\n\ntemplate <typename T> BaseImage<T> undistort(const BaseImage<T>& src, const mat4f& intrinsic, const float coeff[5])\n{\n\tBaseImage<T> res(src.getWidth(), src.getHeight());\n\tres.setInvalidValue(src.getInvalidValue());\n\tres.setPixels(res.getInvalidValue());\n\n\tfor (unsigned int y = 0; y < src.getHeight(); y++)\t{\n\t\tfor (unsigned int x = 0; x < src.getWidth(); x++)\t{\n\t\t\tvec2f nic_loc;\n\t\t\tvec2f sample_loc;\n\n\t\t\t\/\/Normalized image coords\n\t\t\tnic_loc.x = (x - intrinsic(0, 2)) \/ intrinsic(0, 0);\n\t\t\tnic_loc.y = (y - intrinsic(1, 2)) \/ intrinsic(1, 1);\n\n\t\t\tfloat r2 = nic_loc.x * nic_loc.x + nic_loc.y * nic_loc.y;\n\n\t\t\t\/\/ Radial distortion\n\t\t\tsample_loc.x = nic_loc.x * (1.0f + r2 * coeff[0] + r2*r2 * coeff[1] + r2*r2*r2 * coeff[4]);\n\t\t\tsample_loc.y = nic_loc.y * (1.0f + r2 * coeff[0] + r2*r2 * coeff[1] + r2*r2*r2 * coeff[4]);\n\n\t\t\t\/\/ Tangential distortion\n\t\t\tsample_loc.x += 2.0f * coeff[2] * nic_loc.x * nic_loc.y + coeff[3] * (r2 + 2.0f * nic_loc.x * nic_loc.x);\n\t\t\tsample_loc.y += coeff[2] * (r2 + 2.0f * nic_loc.y * nic_loc.y) + 2.0f * coeff[3] * nic_loc.x * nic_loc.y;\n\n\t\t\t\/\/ Move back to the image space\n\t\t\tsample_loc.x = sample_loc.x * intrinsic(0, 0) + intrinsic(0, 2);\n\t\t\tsample_loc.y = sample_loc.y * intrinsic(1, 1) + intrinsic(1, 2);\n\n\t\t\tvec2i sample_loc_i = math::round(sample_loc);\n\t\t\tif (src.isValidCoordinate(sample_loc_i)) {\n\t\t\t\tres(x, y) = src(sample_loc_i);\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nvoid convertToSens(const std::string& srcPath, const std::string& outFile) \n{\n\tDirectory dir(srcPath);\n\tstd::vector<std::string> baseFiles = dir.getFilesWithSuffix(\"_d0_0.png\");\n\tfor (auto& f : baseFiles) f = util::replace(f, \"_d0_0.png\", \"\");\n\n\tconst unsigned int numCams = 3;\n\tSensorData sd[numCams];\n\tfor (size_t fidx = 0; fidx < baseFiles.size(); fidx++) {\n\t\tstd::cout << \"\\rProcessed [ \" << fidx << \" | \" << baseFiles.size() << \" ] \";\n\t\tconst std::string& f = baseFiles[fidx];\t\t\n\t\tfor (unsigned int camIdx = 0; camIdx < numCams; camIdx++) {\n\t\t\tfor (unsigned int poseIdx = 0; poseIdx < 6; poseIdx++) {\n\t\t\t\tconst std::string depthFile = srcPath + \"\/\" + f + \"_d\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".png\";\n\t\t\t\tconst std::string colorFile = srcPath + \"\/\" + f + \"_i\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".jpg\";\n\t\t\t\tconst std::string poseFile = srcPath + \"\/\" + f + \"_pose_\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".txt\";\n\t\t\t\tconst std::string intrFile = srcPath + \"\/\" + f + \"_intrinsics_\" + std::to_string(camIdx) + \".txt\";\n\n\t\t\t\tDepthImage16 depthImage16;\n\t\t\t\tFreeImageWrapper::loadImage(depthFile, depthImage16);\n\t\t\t\tdepthImage16.setInvalidValue(0);\n\t\t\t\t\/\/for (auto& p : depthImage16) p.value \/= 5;\n\n\t\t\t\t\/\/DepthImage32 depthImage32(depthImage16.getWidth(), depthImage16.getHeight());\n\t\t\t\t\/\/depthImage32.setInvalidValue(0.0f);\n\t\t\t\t\/\/for (auto& p : depthImage32) p.value = 0.001f * depthImage16(p.x, p.y);\n\t\t\t\t\/\/FreeImageWrapper::saveImage(\"test.png\", ColorImageR32G32B32A32(depthImage32, true));\n\t\t\t\t\/\/std::cout << \"DONE\" << std::endl;\n\t\t\t\t\/\/getchar();\n\t\t\t\t\/\/exit(1);\n\n\t\t\t\tColorImageR8G8B8 colorImage;\n\t\t\t\tFreeImageWrapper::loadImage(colorFile, colorImage);\n\n\t\t\t\tmat4f pose;\n\t\t\t\t{\n\t\t\t\t\tstd::ifstream inFile(poseFile);\n\t\t\t\t\tfor (unsigned int i = 0; i < 16; i++) inFile >> pose[i];\n\t\t\t\t}\n\t\t\t\tunsigned int width, height;\n\t\t\t\tfloat fx, fy, mx, my;\n\t\t\t\tfloat k[5];\n\t\t\t\tfloat k1, k2, p1, p2, k3;\n\t\t\t\t{\n\t\t\t\t\tstd::ifstream inFile(intrFile);\n\t\t\t\t\tinFile >> width >> height;\n\t\t\t\t\tinFile >> fx >> fy >> mx >> my;\n\t\t\t\t\t\/\/for (unsigned i = 0; i < 5; i++) inFile >> k[i];\n\t\t\t\t\tinFile >> k1 >> k2 >> p1 >> p2 >> k3;\n\t\t\t\t}\n\t\t\t\tk[0] = k1;\n\t\t\t\tk[1] = k2;\n\t\t\t\tk[2] = p1;\n\t\t\t\tk[3] = p2;\n\t\t\t\tk[4] = k3;\n\n\n\t\t\t\tif (fidx == 0 && poseIdx == 0) {\n\t\t\t\t\tSensorData::CalibrationData calibrationDepth(\n\t\t\t\t\t\tmat4f(\n\t\t\t\t\t\tfx, 0.0f, mx, 0.0f,\n\t\t\t\t\t\t0.0f, fy, my, 0.0f,\n\t\t\t\t\t\t0.0f, 0.0f, 1.0f, 0.0f,\n\t\t\t\t\t\t0.0f, 0.0f, 0.0f, 1.0f\n\t\t\t\t\t\t));\n\t\t\t\t\tSensorData::CalibrationData calibrationColor = calibrationDepth;\n\n\t\t\t\t\tfloat depthShift = 1.0f \/ 0.00025f;\t\/\/depth values are 0.25mm\n\t\t\t\t\tsd[camIdx].initDefault(width, height, width, height, calibrationColor, calibrationDepth,\n\t\t\t\t\t\tSensorData::COMPRESSION_TYPE_COLOR::TYPE_JPEG, SensorData::COMPRESSION_TYPE_DEPTH::TYPE_ZLIB_USHORT, depthShift, \"Matterport\");\n\t\t\t\t}\n\n\t\t\t\tif (colorImage.getWidth() != width || depthImage16.getWidth() != width ||\n\t\t\t\t\tcolorImage.getHeight() != height || depthImage16.getHeight() != height) {\n\t\t\t\t\tstd::cout << \"debug: \" <<\n\t\t\t\t\t\tcolorImage.getWidth() << \" | \" << width << \" | \" << depthImage16.getWidth() << \" | \" << width <<\n\t\t\t\t\t\tcolorImage.getHeight() << \" | \" << height << \" | \" << depthImage16.getHeight() << \" | \" << height << std::endl;\n\t\t\t\t\tthrow MLIB_EXCEPTION(\"image dimensions don't match\");\n\t\t\t\t}\n\n\t\t\t\tcolorImage = undistort(colorImage, sd[camIdx].m_calibrationColor.m_intrinsic, k);\n\t\t\t\tdepthImage16 = DepthImage16(undistort(depthImage16, sd[camIdx].m_calibrationDepth.m_intrinsic, k));\n\t\t\t\tsd[camIdx].addFrame(colorImage.getData(), depthImage16.getData(), pose);\n\n\t\t\t\t\/\/FreeImageWrapper::saveImage(\"test.png\", colorImage);\n\t\t\t\t\/\/std::cout << \"bla\" << std::endl;\n\t\t\t\t\/\/getchar();\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << std::endl;\n\t\n\tfor (unsigned int i = 0; i < numCams; i++) {\n\t\t\/\/std::cout << sd[i] << std::endl;\n\n\t\t\/\/sd[i].saveToFile(\"test_\" + std::to_string(i) + \".sens\");\n\t\tauto s = util::splitOnLast(outFile, \".\");\n\t\tstd::string _outFile = s.first + \"_\" + std::to_string(i) + \".\" + s.second;\n\t\tsd[i].saveToFile(_outFile);\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n#if defined(DEBUG) | defined(_DEBUG)\n\t_CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF);\n#endif\n\t\/\/_CrtSetBreakAlloc(7545);\n\ttry {\n\n\t\t\/\/single debug\n\t\tif (true) {\n\t\t\t\/\/const std::string s = \"D7N2EKCX4Sj\";\n\t\t\t\/\/const std::string path = \"W:\/data\/matterport\/v1_converted\/\" + s;\n\t\t\t\n\t\t\tconst std::string s = \"1LXtFkjw3qL\";\n\t\t\tconst std::string path = \"..\/testdata\/\";\n\t\t\tstd::cout << \"converting: \" << path << std::endl;\n\t\t\tconvertToSens(path + \"\/\" + s + \"\/data\/\", path + \"\/\" + s + \".sens\");\n\n\t\t\tstd::cout << \"<< press key to exit >>\" << std::endl;\n\t\t\tgetchar();\n\t\t\texit(1);\n\t\t}\n\n\n\n\t\tconst std::string srcFolder = \"W:\/data\/matterport\/v1\";\n\t\tconst std::string dstFolder = \"W:\/data\/matterport\/v1_converted\";\n\n\t\tutil::makeDirectory(dstFolder);\n\n\t\tDirectory srcDir(srcFolder);\n\n\t\tfor (const std::string& s : srcDir.getDirectories()) {\n\n\t\t\tif (s == \"archive\") continue;\n\n\t\t\tstd::cout << s << std::endl;\t\t\t\t\t\t\n\t\t\tconst std::string outPath = dstFolder + \"\/\" + s;\n\n\t\t\tif (util::directoryExists(outPath)) {\n\t\t\t\tDirectory dir(outPath);\n\t\t\t\tif (dir.getFilesWithSuffix(\".sens\").size() == 3) {\n\t\t\t\t\tstd::cout << \"\\t(output exists -- skipping)\" << std::endl;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (true) {\n\t\t\t\tutil::deleteDirectory(outPath);\n\t\t\t\tutil::makeDirectory(outPath);\n\t\t\t\tif (true) {\n\t\t\t\t\t\/\/extract the mesh\n\t\t\t\t\tstd::cout << \"\\textracting mesh... \";\n\t\t\t\t\tconst std::string srcFileMesh = srcFolder + \"\/\" + s + \"\/\" + s + \"_mesh.zip\";\n\t\t\t\t\tconst std::string cmd = \"unzip -qq \" + srcFileMesh + \" -d \" + outPath;\n\t\t\t\t\tsystem(cmd.c_str());\n\t\t\t\t\tconst std::vector<std::string> dirs = Directory::enumerateDirectories(outPath);\n\t\t\t\t\tif (dirs.size() != 1) throw MLIB_EXCEPTION(\"excepting exactly one output directory\");\n\t\t\t\t\tconst std::string subDirSrc = outPath + \"\/\" + dirs.front();\n\t\t\t\t\tconst std::string newSubDirSrc = outPath + \"\/mesh\/\";\n\t\t\t\t\tutil::renameFile(subDirSrc, newSubDirSrc);\n\t\t\t\t\tstd::cout << \"done!\" << std::endl;\n\t\t\t\t}\n\t\t\t\tif (true) {\n\t\t\t\t\tstd::cout << \"\\textracting raw data... \";\n\t\t\t\t\t\/\/extract the raw data\n\t\t\t\t\tconst std::string srcFileData = srcFolder + \"\/\" + s + \"\/\" + s + \".zip\";\n\t\t\t\t\tconst std::string cmd = \"unzip -qq \" + srcFileData + \" -d \" + outPath;\n\t\t\t\t\tsystem(cmd.c_str());\n\t\t\t\t\tconst std::string subDirSrc = outPath + \"\/\" + s;\n\t\t\t\t\tconst std::string newSubDirSrc = outPath + \"\/data\/\";\n\t\t\t\t\tutil::renameFile(subDirSrc, newSubDirSrc);\n\t\t\t\t\tstd::cout << \"done!\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\tconvertToSens(outPath + \"\/data\/\", outPath + \"\/\" + s + \".sens\");\n\t\t\t}\n\t\t\tcatch (const std::exception& e) {\n\t\t\t\tstd::cout << \"exception caught during conversion: \" << e.what() << std::endl;\n\t\t\t}\n\t\t}\n\n\t}\n\tcatch (const std::exception& e)\n\t{\n\t\tMessageBoxA(NULL, e.what(), \"Exception caught\", MB_ICONERROR);\n\t\texit(EXIT_FAILURE);\n\t}\n\tcatch (...)\n\t{\n\t\tMessageBoxA(NULL, \"UNKNOWN EXCEPTION\", \"Exception caught\", MB_ICONERROR);\n\t\texit(EXIT_FAILURE);\n\t}\n\t\n\tstd::cout << \"<press key to continue>\" << std::endl;\n\tgetchar();\n\treturn 0;\n}\n\n<commit_msg>convert for new v1 format<commit_after>\/\/ sensorFile.cpp : Defines the entry point for the console application.\n\/\/\n\n#include \"stdafx.h\"\n#include <iomanip>\n\n\ntemplate <typename T> BaseImage<T> undistort(const BaseImage<T>& src, const mat4f& intrinsic, const float coeff[5])\n{\n\tBaseImage<T> res(src.getWidth(), src.getHeight());\n\tres.setInvalidValue(src.getInvalidValue());\n\tres.setPixels(res.getInvalidValue());\n\n\tfor (unsigned int y = 0; y < src.getHeight(); y++)\t{\n\t\tfor (unsigned int x = 0; x < src.getWidth(); x++)\t{\n\t\t\tvec2f nic_loc;\n\t\t\tvec2f sample_loc;\n\n\t\t\t\/\/Normalized image coords\n\t\t\tnic_loc.x = (x - intrinsic(0, 2)) \/ intrinsic(0, 0);\n\t\t\tnic_loc.y = (y - intrinsic(1, 2)) \/ intrinsic(1, 1);\n\n\t\t\tfloat r2 = nic_loc.x * nic_loc.x + nic_loc.y * nic_loc.y;\n\n\t\t\t\/\/ Radial distortion\n\t\t\tsample_loc.x = nic_loc.x * (1.0f + r2 * coeff[0] + r2*r2 * coeff[1] + r2*r2*r2 * coeff[4]);\n\t\t\tsample_loc.y = nic_loc.y * (1.0f + r2 * coeff[0] + r2*r2 * coeff[1] + r2*r2*r2 * coeff[4]);\n\n\t\t\t\/\/ Tangential distortion\n\t\t\tsample_loc.x += 2.0f * coeff[2] * nic_loc.x * nic_loc.y + coeff[3] * (r2 + 2.0f * nic_loc.x * nic_loc.x);\n\t\t\tsample_loc.y += coeff[2] * (r2 + 2.0f * nic_loc.y * nic_loc.y) + 2.0f * coeff[3] * nic_loc.x * nic_loc.y;\n\n\t\t\t\/\/ Move back to the image space\n\t\t\tsample_loc.x = sample_loc.x * intrinsic(0, 0) + intrinsic(0, 2);\n\t\t\tsample_loc.y = sample_loc.y * intrinsic(1, 1) + intrinsic(1, 2);\n\n\t\t\tvec2i sample_loc_i = math::round(sample_loc);\n\t\t\tif (src.isValidCoordinate(sample_loc_i)) {\n\t\t\t\tres(x, y) = src(sample_loc_i);\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nvoid convertToSens(const std::string& srcPath, const std::string& outFile) \n{\n\tconst std::string srcColorPath = srcPath + \"\/matterport_color_images\";\n\tconst std::string srcDepthPath = srcPath + \"\/matterport_depth_images\";\n\tconst std::string srcPosePath = srcPath + \"\/matterport_camera_poses\";\n\tconst std::string srcCalibPath = srcPath + \"\/matterport_camera_intrinsics\";\n\tif (!util::directoryExists(srcColorPath) || !util::directoryExists(srcDepthPath) || \n\t\t!util::directoryExists(srcPosePath) || !util::directoryExists(srcCalibPath))\n\t\tthrow MLIB_EXCEPTION(\"raw color\/depth\/pose\/calib dir(s) do not exist [\" + srcPath + \"]\");\n\n\tDirectory dir(srcDepthPath);\n\tstd::vector<std::string> baseFiles = dir.getFilesWithSuffix(\"_d0_0.png\");\n\tfor (auto& f : baseFiles) f = util::replace(f, \"_d0_0.png\", \"\");\n\n\tconst unsigned int numCams = 3;\n\tSensorData sd[numCams];\n\tfor (size_t fidx = 0; fidx < baseFiles.size(); fidx++) {\n\t\tstd::cout << \"\\rProcessed [ \" << fidx << \" | \" << baseFiles.size() << \" ] \";\n\t\tconst std::string& f = baseFiles[fidx];\t\t\n\t\tfor (unsigned int camIdx = 0; camIdx < numCams; camIdx++) {\n\t\t\tfor (unsigned int poseIdx = 0; poseIdx < 6; poseIdx++) {\n\t\t\t\tconst std::string depthFile = srcDepthPath + \"\/\" + f + \"_d\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".png\";\n\t\t\t\tconst std::string colorFile = srcColorPath + \"\/\" + f + \"_i\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".jpg\";\n\t\t\t\tconst std::string poseFile = srcPosePath + \"\/\" + f + \"_pose_\" + std::to_string(camIdx) + \"_\" + std::to_string(poseIdx) + \".txt\";\n\t\t\t\tconst std::string intrFile = srcCalibPath + \"\/\" + f + \"_intrinsics_\" + std::to_string(camIdx) + \".txt\";\n\n\t\t\t\tDepthImage16 depthImage16;\n\t\t\t\tFreeImageWrapper::loadImage(depthFile, depthImage16);\n\t\t\t\tdepthImage16.setInvalidValue(0);\n\t\t\t\t\/\/for (auto& p : depthImage16) p.value \/= 5;\n\n\t\t\t\t\/\/DepthImage32 depthImage32(depthImage16.getWidth(), depthImage16.getHeight());\n\t\t\t\t\/\/depthImage32.setInvalidValue(0.0f);\n\t\t\t\t\/\/for (auto& p : depthImage32) p.value = 0.001f * depthImage16(p.x, p.y);\n\t\t\t\t\/\/FreeImageWrapper::saveImage(\"test.png\", ColorImageR32G32B32A32(depthImage32, true));\n\t\t\t\t\/\/std::cout << \"DONE\" << std::endl;\n\t\t\t\t\/\/getchar();\n\t\t\t\t\/\/exit(1);\n\n\t\t\t\tColorImageR8G8B8 colorImage;\n\t\t\t\tFreeImageWrapper::loadImage(colorFile, colorImage);\n\n\t\t\t\tmat4f pose;\n\t\t\t\t{\n\t\t\t\t\tstd::ifstream inFile(poseFile);\n\t\t\t\t\tfor (unsigned int i = 0; i < 16; i++) inFile >> pose[i];\n\t\t\t\t}\n\t\t\t\tunsigned int width, height;\n\t\t\t\tfloat fx, fy, mx, my;\n\t\t\t\tfloat k[5];\n\t\t\t\tfloat k1, k2, p1, p2, k3;\n\t\t\t\t{\n\t\t\t\t\tstd::ifstream inFile(intrFile);\n\t\t\t\t\tinFile >> width >> height;\n\t\t\t\t\tinFile >> fx >> fy >> mx >> my;\n\t\t\t\t\t\/\/for (unsigned i = 0; i < 5; i++) inFile >> k[i];\n\t\t\t\t\tinFile >> k1 >> k2 >> p1 >> p2 >> k3;\n\t\t\t\t}\n\t\t\t\tk[0] = k1;\n\t\t\t\tk[1] = k2;\n\t\t\t\tk[2] = p1;\n\t\t\t\tk[3] = p2;\n\t\t\t\tk[4] = k3;\n\n\n\t\t\t\tif (fidx == 0 && poseIdx == 0) {\n\t\t\t\t\tSensorData::CalibrationData calibrationDepth(\n\t\t\t\t\t\tmat4f(\n\t\t\t\t\t\tfx, 0.0f, mx, 0.0f,\n\t\t\t\t\t\t0.0f, fy, my, 0.0f,\n\t\t\t\t\t\t0.0f, 0.0f, 1.0f, 0.0f,\n\t\t\t\t\t\t0.0f, 0.0f, 0.0f, 1.0f\n\t\t\t\t\t\t));\n\t\t\t\t\tSensorData::CalibrationData calibrationColor = calibrationDepth;\n\n\t\t\t\t\tfloat depthShift = 1.0f \/ 0.00025f;\t\/\/depth values are 0.25mm\n\t\t\t\t\tsd[camIdx].initDefault(width, height, width, height, calibrationColor, calibrationDepth,\n\t\t\t\t\t\tSensorData::COMPRESSION_TYPE_COLOR::TYPE_JPEG, SensorData::COMPRESSION_TYPE_DEPTH::TYPE_ZLIB_USHORT, depthShift, \"Matterport\");\n\t\t\t\t}\n\n\t\t\t\tif (colorImage.getWidth() != width || depthImage16.getWidth() != width ||\n\t\t\t\t\tcolorImage.getHeight() != height || depthImage16.getHeight() != height) {\n\t\t\t\t\tstd::cout << \"debug: \" <<\n\t\t\t\t\t\tcolorImage.getWidth() << \" | \" << width << \" | \" << depthImage16.getWidth() << \" | \" << width <<\n\t\t\t\t\t\tcolorImage.getHeight() << \" | \" << height << \" | \" << depthImage16.getHeight() << \" | \" << height << std::endl;\n\t\t\t\t\tthrow MLIB_EXCEPTION(\"image dimensions don't match\");\n\t\t\t\t}\n\n\t\t\t\tcolorImage = undistort(colorImage, sd[camIdx].m_calibrationColor.m_intrinsic, k);\n\t\t\t\tdepthImage16 = DepthImage16(undistort(depthImage16, sd[camIdx].m_calibrationDepth.m_intrinsic, k));\n\t\t\t\tsd[camIdx].addFrame(colorImage.getData(), depthImage16.getData(), pose);\n\n\t\t\t\t\/\/FreeImageWrapper::saveImage(\"test.png\", colorImage);\n\t\t\t\t\/\/std::cout << \"bla\" << std::endl;\n\t\t\t\t\/\/getchar();\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << std::endl;\n\t\n\tfor (unsigned int i = 0; i < numCams; i++) {\n\t\t\/\/std::cout << sd[i] << std::endl;\n\n\t\t\/\/sd[i].saveToFile(\"test_\" + std::to_string(i) + \".sens\");\n\t\tauto s = util::splitOnLast(outFile, \".\");\n\t\tstd::string _outFile = s.first + \"_\" + std::to_string(i) + \".\" + s.second;\n\t\tsd[i].saveToFile(_outFile);\n\t}\n}\n\nint main(int argc, char* argv[])\n{\n#if defined(DEBUG) | defined(_DEBUG)\n\t_CrtSetDbgFlag(_CRTDBG_ALLOC_MEM_DF | _CRTDBG_LEAK_CHECK_DF);\n#endif\n\t\/\/_CrtSetBreakAlloc(7545);\n\ttry {\n\n\t\t\/\/single debug\n\t\tif (false) {\n\t\t\t\/\/const std::string s = \"D7N2EKCX4Sj\";\n\t\t\t\/\/const std::string path = \"W:\/data\/matterport\/v1_converted\/\" + s;\n\t\t\t\n\t\t\tconst std::string s = \"1LXtFkjw3qL\";\n\t\t\tconst std::string path = \"..\/testdata\/\";\n\t\t\tstd::cout << \"converting: \" << path << std::endl;\n\t\t\tconvertToSens(path + \"\/\" + s + \"\/data\/\", path + \"\/\" + s + \".sens\");\n\n\t\t\tstd::cout << \"<< press key to exit >>\" << std::endl;\n\t\t\tgetchar();\n\t\t\texit(1);\n\t\t}\n\n\n\n\t\t\/\/const std::string srcFolder = \"W:\/data\/matterport\/v1\";\n\t\tconst std::string srcFolder = \"\/\/falas\/Matterport\/v1\";\n\t\tconst std::string dstFolder = \"W:\/data\/matterport\/v1_converted\";\n\n\t\tif (!util::directoryExists(dstFolder)) util::makeDirectory(dstFolder);\n\n\t\tDirectory srcDir(srcFolder);\n\n\t\tfor (const std::string& s : srcDir.getDirectories()) {\n\n\t\t\tif (s == \"archive\") continue;\n\n\t\t\tstd::cout << s << std::endl;\t\t\t\t\t\t\n\t\t\tconst std::string outPath = dstFolder + \"\/\" + s;\n\n\t\t\tif (util::directoryExists(outPath)) {\n\t\t\t\tDirectory dir(outPath);\n\t\t\t\tif (dir.getFilesWithSuffix(\".sens\").size() == 3) {\n\t\t\t\t\tstd::cout << \"\\t(output exists -- skipping)\" << std::endl;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (false) { \/\/data in src is already unzipped\n\t\t\t\tutil::deleteDirectory(outPath);\n\t\t\t\tutil::makeDirectory(outPath);\n\t\t\t\tif (true) {\n\t\t\t\t\t\/\/extract the mesh\n\t\t\t\t\tstd::cout << \"\\textracting mesh... \";\n\t\t\t\t\tconst std::string srcFileMesh = srcFolder + \"\/\" + s + \"\/\" + s + \"_mesh.zip\";\n\t\t\t\t\tconst std::string cmd = \"unzip -qq \" + srcFileMesh + \" -d \" + outPath;\n\t\t\t\t\tsystem(cmd.c_str());\n\t\t\t\t\tconst std::vector<std::string> dirs = Directory::enumerateDirectories(outPath);\n\t\t\t\t\tif (dirs.size() != 1) throw MLIB_EXCEPTION(\"excepting exactly one output directory\");\n\t\t\t\t\tconst std::string subDirSrc = outPath + \"\/\" + dirs.front();\n\t\t\t\t\tconst std::string newSubDirSrc = outPath + \"\/mesh\/\";\n\t\t\t\t\tutil::renameFile(subDirSrc, newSubDirSrc);\n\t\t\t\t\tstd::cout << \"done!\" << std::endl;\n\t\t\t\t}\n\t\t\t\tif (true) {\n\t\t\t\t\tstd::cout << \"\\textracting raw data... \";\n\t\t\t\t\t\/\/extract the raw data\n\t\t\t\t\tconst std::string srcFileData = srcFolder + \"\/\" + s + \"\/\" + s + \".zip\";\n\t\t\t\t\tconst std::string cmd = \"unzip -qq \" + srcFileData + \" -d \" + outPath;\n\t\t\t\t\tsystem(cmd.c_str());\n\t\t\t\t\tconst std::string subDirSrc = outPath + \"\/\" + s;\n\t\t\t\t\tconst std::string newSubDirSrc = outPath + \"\/data\/\";\n\t\t\t\t\tutil::renameFile(subDirSrc, newSubDirSrc);\n\t\t\t\t\tstd::cout << \"done!\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\ttry {\n\t\t\t\t\/\/convertToSens(outPath + \"\/data\/\", outPath + \"\/\" + s + \".sens\");\n\t\t\t\tconvertToSens(srcFolder + \"\/\" + s, outPath + \"\/\" + s + \".sens\");\n\t\t\t}\n\t\t\tcatch (const std::exception& e) {\n\t\t\t\tstd::cout << \"exception caught during conversion: \" << e.what() << std::endl;\n\t\t\t}\n\t\t}\n\n\t}\n\tcatch (const std::exception& e)\n\t{\n\t\tMessageBoxA(NULL, e.what(), \"Exception caught\", MB_ICONERROR);\n\t\texit(EXIT_FAILURE);\n\t}\n\tcatch (...)\n\t{\n\t\tMessageBoxA(NULL, \"UNKNOWN EXCEPTION\", \"Exception caught\", MB_ICONERROR);\n\t\texit(EXIT_FAILURE);\n\t}\n\t\n\tstd::cout << \"<press key to continue>\" << std::endl;\n\tgetchar();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright 2015 Esri\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\nhttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\nA local copy of the license and additional notices are located with the\nsource distribution at:\nhttp:\/\/github.com\/Esri\/lerc\/\nContributors: Thomas Maurer\n*\/\n\n#include \"Huffman.h\"\n#include \"BitStuffer2.h\"\n#include <queue>\n#include <cstring>\n\nNAMESPACE_MRF_START\n\nusing namespace std;\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeCodes(const vector<int>& histo)\n{\n if (histo.empty() || histo.size() >= m_maxHistoSize)\n return false;\n\n priority_queue<Node, vector<Node>, less<Node> > pq;\n\n int numNodes = 0;\n\n int size = (int)histo.size();\n for (int i = 0; i < size; i++) \/\/ add all leaf nodes\n if (histo[i] > 0)\n pq.push(Node((short)i, histo[i]));\n\n if (pq.size() < 2) \/\/ histo has only 0 or 1 bin that is not empty; quit Huffman and give it to Lerc\n return false;\n\n while (pq.size() > 1) \/\/ build the Huffman tree\n {\n Node* child0 = new Node(pq.top());\n numNodes++;\n pq.pop();\n Node* child1 = new Node(pq.top());\n numNodes++;\n pq.pop();\n pq.push(Node(child0, child1));\n }\n\n m_codeTable.resize(size);\n memset(&m_codeTable[0], 0, size * sizeof(m_codeTable[0]));\n if (!pq.top().TreeToLUT(0, 0, m_codeTable)) \/\/ fill the LUT\n return false;\n\n pq.top().child0->FreeTree(numNodes); \/\/ free all the nodes\n pq.top().child1->FreeTree(numNodes);\n\n if (numNodes != 0) \/\/ check the ref count\n return false;\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeCompressedSize(const std::vector<int>& histo, int& numBytes, double& avgBpp) const\n{\n if (histo.empty() || histo.size() >= m_maxHistoSize)\n return false;\n\n numBytes = 0;\n if (!ComputeNumBytesCodeTable(numBytes)) \/\/ header and code table\n return false;\n\n int numBits = 0, numElem = 0;\n int size = (int)histo.size();\n for (int i = 0; i < size; i++)\n if (histo[i] > 0)\n {\n numBits += histo[i] * m_codeTable[i].first;\n numElem += histo[i];\n }\n\n int numUInts = ((((numBits + 7) >> 3) + 3) >> 2) + 1; \/\/ add one more as the decode LUT can read ahead\n numBytes += 4 * numUInts; \/\/ data huffman coded\n avgBpp = 8 * numBytes \/ (double)numElem;\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::SetCodes(const vector<pair<short, unsigned int> >& codeTable)\n{\n if (codeTable.empty() || codeTable.size() >= m_maxHistoSize)\n return false;\n\n m_codeTable = codeTable;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::WriteCodeTable(Byte** ppByte) const\n{\n if (!ppByte)\n return false;\n\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n int size = (int)m_codeTable.size();\n vector<unsigned int> dataVec(i1 - i0, 0);\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n dataVec[i - i0] = (unsigned int)m_codeTable[k].first;\n }\n\n \/\/ header\n vector<int> intVec;\n intVec.push_back(2); \/\/ version\n intVec.push_back(size);\n intVec.push_back(i0); \/\/ code range\n intVec.push_back(i1);\n\n Byte* ptr = *ppByte;\n\n for (size_t i = 0; i < intVec.size(); i++)\n {\n *((int*)ptr) = intVec[i];\n ptr += sizeof(int);\n }\n\n BitStuffer2 bitStuffer2;\n if (!bitStuffer2.EncodeSimple(&ptr, dataVec)) \/\/ code lengths, bit stuffed\n return false;\n\n if (!BitStuffCodes(&ptr, i0, i1)) \/\/ variable length codes, bit stuffed\n return false;\n \n *ppByte = ptr;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ReadCodeTable(const Byte** ppByte)\n{\n if (!ppByte || !(*ppByte))\n return false;\n\n const Byte* ptr = *ppByte;\n\n int version = *((int*)ptr); \/\/ version\n ptr += sizeof(int);\n\n if (version != 2)\n return false;\n\n vector<int> intVec(4, 0);\n for (size_t i = 1; i < intVec.size(); i++)\n {\n intVec[i] = *((int*)ptr);\n ptr += sizeof(int);\n }\n\n int size = intVec[1];\n int i0 = intVec[2];\n int i1 = intVec[3];\n\n if (i0 >= i1 || size > (int)m_maxHistoSize)\n return false;\n\n vector<unsigned int> dataVec(i1 - i0, 0);\n BitStuffer2 bitStuffer2;\n if (!bitStuffer2.Decode(&ptr, dataVec)) \/\/ unstuff the code lengths\n return false;\n\n m_codeTable.resize(size);\n memset(&m_codeTable[0], 0, size * sizeof(m_codeTable[0]));\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n m_codeTable[k].first = (short)dataVec[i - i0];\n }\n\n if (!BitUnStuffCodes(&ptr, i0, i1)) \/\/ unstuff the codes\n return false;\n\n *ppByte = ptr;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BuildTreeFromCodes(int& numBitsLUT)\n{\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n \/\/ build decode LUT using max of 12 bits\n int size = (int)m_codeTable.size();\n\n bool bNeedTree = maxLen > m_maxNumBitsLUT;\n numBitsLUT = min(maxLen, m_maxNumBitsLUT);\n\n m_decodeLUT.clear();\n m_decodeLUT.assign(1 << numBitsLUT, pair<short, short>((short)-1, (short)-1));\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0 && len <= numBitsLUT)\n {\n int code = m_codeTable[k].second << (numBitsLUT - len);\n pair<short, short> entry((short)len, (short)k);\n int numEntries = 1 << (numBitsLUT - len);\n for (int j = 0; j < numEntries; j++)\n m_decodeLUT[code | j] = entry; \/\/ add the duplicates\n }\n }\n\n if (!bNeedTree) \/\/ decode LUT covers it all, no tree needed\n return true;\n\n int numNodesCreated = 1;\n Node emptyNode((short)-1, 0);\n\n if (!m_root)\n m_root = new Node(emptyNode);\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0 && len > numBitsLUT) \/\/ add only codes not in the decode LUT\n {\n unsigned int code = m_codeTable[k].second;\n Node* node = m_root;\n int j = len;\n while (--j >= 0) \/\/ go over the bits\n {\n if (code & (1 << j))\n {\n if (!node->child1)\n {\n node->child1 = new Node(emptyNode);\n numNodesCreated++;\n }\n node = node->child1;\n }\n else\n {\n if (!node->child0)\n {\n node->child0 = new Node(emptyNode);\n numNodesCreated++;\n }\n node = node->child0;\n }\n\n if (j == 0) \/\/ last bit, leaf node\n {\n node->value = (short)k; \/\/ set the value\n }\n }\n }\n }\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nvoid Huffman::Clear()\n{\n m_codeTable.clear();\n m_decodeLUT.clear();\n if (m_root)\n {\n int n = 0;\n m_root->FreeTree(n);\n }\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeNumBytesCodeTable(int& numBytes) const\n{\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n int size = (int)m_codeTable.size();\n int sum = 0;\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n sum += m_codeTable[k].first;\n }\n\n numBytes = 4 * sizeof(int); \/\/ version, size, first bin, (last + 1) bin\n\n BitStuffer2 bitStuffer2;\n numBytes += bitStuffer2.ComputeNumBytesNeededSimple((unsigned int)(i1 - i0), (unsigned int)maxLen); \/\/ code lengths\n int numUInts = (((sum + 7) >> 3) + 3) >> 2;\n numBytes += 4 * numUInts; \/\/ byte array with the codes bit stuffed\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::GetRange(int& i0, int& i1, int& maxCodeLength) const\n{\n if (m_codeTable.empty() || m_codeTable.size() >= m_maxHistoSize)\n return false;\n\n \/\/ first, check for peak somewhere in the middle with 0 stretches left and right\n int size = (int)m_codeTable.size();\n int i = 0;\n while (i < size && m_codeTable[i].first == 0) i++;\n i0 = i;\n i = size - 1;\n while (i >= 0 && m_codeTable[i].first == 0) i--;\n i1 = i + 1; \/\/ exclusive\n\n if (i1 <= i0)\n return false;\n\n \/\/ second, cover the common case that the peak is close to 0\n pair<int, int> segm(0, 0);\n int j = 0;\n while (j < size) \/\/ find the largest stretch of 0's, if any\n {\n while (j < size && m_codeTable[j].first > 0) j++;\n int k0 = j;\n while (j < size && m_codeTable[j].first == 0) j++;\n int k1 = j;\n\n if (k1 - k0 > segm.second)\n segm = pair<int, int>(k0, k1 - k0);\n }\n\n if (size - segm.second < i1 - i0)\n {\n i0 = segm.first + segm.second;\n i1 = segm.first + size; \/\/ do wrap around\n }\n\n if (i1 <= i0)\n return false;\n\n int maxLen = 0;\n for (i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n maxLen = max(maxLen, len);\n }\n\n if (maxLen <= 0 || maxLen > 32)\n return false;\n\n maxCodeLength = maxLen;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BitStuffCodes(Byte** ppByte, int i0, int i1) const\n{\n if (!ppByte)\n return false;\n\n unsigned int* arr = (unsigned int*)(*ppByte);\n unsigned int* dstPtr = arr;\n int size = (int)m_codeTable.size();\n int bitPos = 0;\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0)\n {\n unsigned int val = m_codeTable[k].second;\n if (32 - bitPos >= len)\n {\n if (bitPos == 0)\n *dstPtr = 0;\n\n *dstPtr |= val << (32 - bitPos - len);\n bitPos += len;\n if (bitPos == 32)\n {\n bitPos = 0;\n dstPtr++;\n }\n }\n else\n {\n bitPos += len - 32;\n *dstPtr++ |= val >> bitPos;\n *dstPtr = val << (32 - bitPos);\n }\n }\n }\n\n size_t numUInts = dstPtr - arr + (bitPos > 0 ? 1 : 0);\n *ppByte += numUInts * sizeof(unsigned int);\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BitUnStuffCodes(const Byte** ppByte, int i0, int i1)\n{\n if (!ppByte || !(*ppByte))\n return false;\n\n const unsigned int* arr = (const unsigned int*)(*ppByte);\n const unsigned int* srcPtr = arr;\n int size = (int)m_codeTable.size();\n int bitPos = 0;\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0)\n {\n m_codeTable[k].second = ((*srcPtr) << bitPos) >> (32 - len);\n\n if (32 - bitPos >= len)\n {\n bitPos += len;\n if (bitPos == 32)\n {\n bitPos = 0;\n srcPtr++;\n }\n }\n else\n {\n bitPos += len - 32;\n srcPtr++;\n m_codeTable[k].second |= (*srcPtr) >> (32 - bitPos);\n }\n }\n }\n\n size_t numUInts = srcPtr - arr + (bitPos > 0 ? 1 : 0);\n *ppByte += numUInts * sizeof(unsigned int);\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\n\nNAMESPACE_MRF_END\n<commit_msg>GDAL integration #58<commit_after>\/*\nCopyright 2015 Esri\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\nhttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\nA local copy of the license and additional notices are located with the\nsource distribution at:\nhttp:\/\/github.com\/Esri\/lerc\/\nContributors: Thomas Maurer\n*\/\n\n#include \"Huffman.h\"\n#include \"BitStuffer2.h\"\n#include <queue>\n#include <cstring>\n\nNAMESPACE_MRF_START\n\nusing namespace std;\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeCodes(const vector<int>& histo)\n{\n if (histo.empty() || histo.size() >= m_maxHistoSize)\n return false;\n\n priority_queue<Node, vector<Node>, less<Node> > pq;\n\n int numNodes = 0;\n\n int size = (int)histo.size();\n for (int i = 0; i < size; i++) \/\/ add all leaf nodes\n if (histo[i] > 0)\n pq.push(Node((short)i, histo[i]));\n\n if (pq.size() < 2) \/\/ histo has only 0 or 1 bin that is not empty; quit Huffman and give it to Lerc\n return false;\n\n while (pq.size() > 1) \/\/ build the Huffman tree\n {\n Node* child0 = new Node(pq.top());\n numNodes++;\n pq.pop();\n Node* child1 = new Node(pq.top());\n numNodes++;\n pq.pop();\n pq.push(Node(child0, child1));\n }\n\n m_codeTable.resize(size);\n memset(&m_codeTable[0], 0, size * sizeof(m_codeTable[0]));\n if (!pq.top().TreeToLUT(0, 0, m_codeTable)) \/\/ fill the LUT\n return false;\n\n pq.top().child0->FreeTree(numNodes); \/\/ free all the nodes\n pq.top().child1->FreeTree(numNodes);\n\n if (numNodes != 0) \/\/ check the ref count\n return false;\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeCompressedSize(const std::vector<int>& histo, int& numBytes, double& avgBpp) const\n{\n if (histo.empty() || histo.size() >= m_maxHistoSize)\n return false;\n\n numBytes = 0;\n if (!ComputeNumBytesCodeTable(numBytes)) \/\/ header and code table\n return false;\n\n int numBits = 0, numElem = 0;\n int size = (int)histo.size();\n for (int i = 0; i < size; i++)\n if (histo[i] > 0)\n {\n numBits += histo[i] * m_codeTable[i].first;\n numElem += histo[i];\n }\n\n \/* to please Coverity about potential divide by zero below *\/\n if( numElem == 0 )\n return false;\n\n int numUInts = ((((numBits + 7) >> 3) + 3) >> 2) + 1; \/\/ add one more as the decode LUT can read ahead\n numBytes += 4 * numUInts; \/\/ data huffman coded\n avgBpp = 8 * numBytes \/ (double)numElem;\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::SetCodes(const vector<pair<short, unsigned int> >& codeTable)\n{\n if (codeTable.empty() || codeTable.size() >= m_maxHistoSize)\n return false;\n\n m_codeTable = codeTable;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::WriteCodeTable(Byte** ppByte) const\n{\n if (!ppByte)\n return false;\n\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n int size = (int)m_codeTable.size();\n vector<unsigned int> dataVec(i1 - i0, 0);\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n dataVec[i - i0] = (unsigned int)m_codeTable[k].first;\n }\n\n \/\/ header\n vector<int> intVec;\n intVec.push_back(2); \/\/ version\n intVec.push_back(size);\n intVec.push_back(i0); \/\/ code range\n intVec.push_back(i1);\n\n Byte* ptr = *ppByte;\n\n for (size_t i = 0; i < intVec.size(); i++)\n {\n *((int*)ptr) = intVec[i];\n ptr += sizeof(int);\n }\n\n BitStuffer2 bitStuffer2;\n if (!bitStuffer2.EncodeSimple(&ptr, dataVec)) \/\/ code lengths, bit stuffed\n return false;\n\n if (!BitStuffCodes(&ptr, i0, i1)) \/\/ variable length codes, bit stuffed\n return false;\n \n *ppByte = ptr;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ReadCodeTable(const Byte** ppByte)\n{\n if (!ppByte || !(*ppByte))\n return false;\n\n const Byte* ptr = *ppByte;\n\n int version = *((int*)ptr); \/\/ version\n ptr += sizeof(int);\n\n if (version != 2)\n return false;\n\n vector<int> intVec(4, 0);\n for (size_t i = 1; i < intVec.size(); i++)\n {\n intVec[i] = *((int*)ptr);\n ptr += sizeof(int);\n }\n\n int size = intVec[1];\n int i0 = intVec[2];\n int i1 = intVec[3];\n\n if (i0 >= i1 || size > (int)m_maxHistoSize)\n return false;\n\n vector<unsigned int> dataVec(i1 - i0, 0);\n BitStuffer2 bitStuffer2;\n if (!bitStuffer2.Decode(&ptr, dataVec)) \/\/ unstuff the code lengths\n return false;\n\n m_codeTable.resize(size);\n memset(&m_codeTable[0], 0, size * sizeof(m_codeTable[0]));\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n m_codeTable[k].first = (short)dataVec[i - i0];\n }\n\n if (!BitUnStuffCodes(&ptr, i0, i1)) \/\/ unstuff the codes\n return false;\n\n *ppByte = ptr;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BuildTreeFromCodes(int& numBitsLUT)\n{\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n \/\/ build decode LUT using max of 12 bits\n int size = (int)m_codeTable.size();\n\n bool bNeedTree = maxLen > m_maxNumBitsLUT;\n numBitsLUT = min(maxLen, m_maxNumBitsLUT);\n\n m_decodeLUT.clear();\n m_decodeLUT.assign(1 << numBitsLUT, pair<short, short>((short)-1, (short)-1));\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0 && len <= numBitsLUT)\n {\n int code = m_codeTable[k].second << (numBitsLUT - len);\n pair<short, short> entry((short)len, (short)k);\n int numEntries = 1 << (numBitsLUT - len);\n for (int j = 0; j < numEntries; j++)\n m_decodeLUT[code | j] = entry; \/\/ add the duplicates\n }\n }\n\n if (!bNeedTree) \/\/ decode LUT covers it all, no tree needed\n return true;\n\n int numNodesCreated = 1;\n Node emptyNode((short)-1, 0);\n\n if (!m_root)\n m_root = new Node(emptyNode);\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0 && len > numBitsLUT) \/\/ add only codes not in the decode LUT\n {\n unsigned int code = m_codeTable[k].second;\n Node* node = m_root;\n int j = len;\n while (--j >= 0) \/\/ go over the bits\n {\n if (code & (1 << j))\n {\n if (!node->child1)\n {\n node->child1 = new Node(emptyNode);\n numNodesCreated++;\n }\n node = node->child1;\n }\n else\n {\n if (!node->child0)\n {\n node->child0 = new Node(emptyNode);\n numNodesCreated++;\n }\n node = node->child0;\n }\n\n if (j == 0) \/\/ last bit, leaf node\n {\n node->value = (short)k; \/\/ set the value\n }\n }\n }\n }\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nvoid Huffman::Clear()\n{\n m_codeTable.clear();\n m_decodeLUT.clear();\n if (m_root)\n {\n int n = 0;\n m_root->FreeTree(n);\n }\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::ComputeNumBytesCodeTable(int& numBytes) const\n{\n int i0, i1, maxLen;\n if (!GetRange(i0, i1, maxLen))\n return false;\n\n int size = (int)m_codeTable.size();\n int sum = 0;\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n sum += m_codeTable[k].first;\n }\n\n numBytes = 4 * sizeof(int); \/\/ version, size, first bin, (last + 1) bin\n\n BitStuffer2 bitStuffer2;\n numBytes += bitStuffer2.ComputeNumBytesNeededSimple((unsigned int)(i1 - i0), (unsigned int)maxLen); \/\/ code lengths\n int numUInts = (((sum + 7) >> 3) + 3) >> 2;\n numBytes += 4 * numUInts; \/\/ byte array with the codes bit stuffed\n\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::GetRange(int& i0, int& i1, int& maxCodeLength) const\n{\n if (m_codeTable.empty() || m_codeTable.size() >= m_maxHistoSize)\n return false;\n\n \/\/ first, check for peak somewhere in the middle with 0 stretches left and right\n int size = (int)m_codeTable.size();\n int i = 0;\n while (i < size && m_codeTable[i].first == 0) i++;\n i0 = i;\n i = size - 1;\n while (i >= 0 && m_codeTable[i].first == 0) i--;\n i1 = i + 1; \/\/ exclusive\n\n if (i1 <= i0)\n return false;\n\n \/\/ second, cover the common case that the peak is close to 0\n pair<int, int> segm(0, 0);\n int j = 0;\n while (j < size) \/\/ find the largest stretch of 0's, if any\n {\n while (j < size && m_codeTable[j].first > 0) j++;\n int k0 = j;\n while (j < size && m_codeTable[j].first == 0) j++;\n int k1 = j;\n\n if (k1 - k0 > segm.second)\n segm = pair<int, int>(k0, k1 - k0);\n }\n\n if (size - segm.second < i1 - i0)\n {\n i0 = segm.first + segm.second;\n i1 = segm.first + size; \/\/ do wrap around\n }\n\n if (i1 <= i0)\n return false;\n\n int maxLen = 0;\n for (i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n maxLen = max(maxLen, len);\n }\n\n if (maxLen <= 0 || maxLen > 32)\n return false;\n\n maxCodeLength = maxLen;\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BitStuffCodes(Byte** ppByte, int i0, int i1) const\n{\n if (!ppByte)\n return false;\n\n unsigned int* arr = (unsigned int*)(*ppByte);\n unsigned int* dstPtr = arr;\n int size = (int)m_codeTable.size();\n int bitPos = 0;\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0)\n {\n unsigned int val = m_codeTable[k].second;\n if (32 - bitPos >= len)\n {\n if (bitPos == 0)\n *dstPtr = 0;\n\n *dstPtr |= val << (32 - bitPos - len);\n bitPos += len;\n if (bitPos == 32)\n {\n bitPos = 0;\n dstPtr++;\n }\n }\n else\n {\n bitPos += len - 32;\n *dstPtr++ |= val >> bitPos;\n *dstPtr = val << (32 - bitPos);\n }\n }\n }\n\n size_t numUInts = dstPtr - arr + (bitPos > 0 ? 1 : 0);\n *ppByte += numUInts * sizeof(unsigned int);\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\nbool Huffman::BitUnStuffCodes(const Byte** ppByte, int i0, int i1)\n{\n if (!ppByte || !(*ppByte))\n return false;\n\n const unsigned int* arr = (const unsigned int*)(*ppByte);\n const unsigned int* srcPtr = arr;\n int size = (int)m_codeTable.size();\n int bitPos = 0;\n\n for (int i = i0; i < i1; i++)\n {\n int k = GetIndexWrapAround(i, size);\n int len = m_codeTable[k].first;\n if (len > 0)\n {\n m_codeTable[k].second = ((*srcPtr) << bitPos) >> (32 - len);\n\n if (32 - bitPos >= len)\n {\n bitPos += len;\n if (bitPos == 32)\n {\n bitPos = 0;\n srcPtr++;\n }\n }\n else\n {\n bitPos += len - 32;\n srcPtr++;\n m_codeTable[k].second |= (*srcPtr) >> (32 - bitPos);\n }\n }\n }\n\n size_t numUInts = srcPtr - arr + (bitPos > 0 ? 1 : 0);\n *ppByte += numUInts * sizeof(unsigned int);\n return true;\n}\n\n\/\/ -------------------------------------------------------------------------- ;\n\n\nNAMESPACE_MRF_END\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @author Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2020 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Cross-platform OS level utility function.\n *\/\n\n\n#include <fstream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#if defined ( __unix__ )\n#if defined ( __linux )\n#include <dirent.h>\n#endif \/\/ defined ( __linux )\n#if defined ( __FreeBSD__ )\n#include <kvm.h>\n#include <sys\/dirent.h>\n#endif \/\/ defined ( __FreeBSD__ )\n#include <sys\/fcntl.h>\n#include <sys\/param.h>\n#include <sys\/sysctl.h>\n#include <sys\/time.h>\n#include <sys\/unistd.h>\n#include <sys\/user.h>\n#endif \/\/ defined ( __unix__ )\n#if defined ( _WIN32 )\n#include <tlhelp32.h>\n#include <windows.h>\n#endif \/\/ defined ( _WIN32 )\n#include \"Log.hpp\"\n#include \"make_unique.hpp\"\n#include \"System.hpp\"\n\nusing namespace std;\nusing namespace CoreLib;\n\nstruct System::Impl\n{\n#if defined ( __unix__ )\n static constexpr mode_t LOCK_FILE_PERMISSION = 0666;\n#endif \/\/ defined ( __unix__ )\n};\n\nbool System::Exec(const string &cmd)\n{\n int r = system(cmd.c_str());\n if (r == EXIT_SUCCESS)\n return true;\n else\n return false;\n}\n\nbool System::Exec(const string &cmd, string &out_output)\n{\n out_output.clear();\n\n FILE *pipe = popen(cmd.c_str(), \"r\");\n if (!pipe)\n return false;\n\n char buffer[256];\n while (!feof(pipe)) {\n if (fgets(buffer, 256, pipe) != NULL) {\n out_output += buffer;\n }\n }\n\n pclose(pipe);\n return true;\n}\n\n#if defined ( __unix__ )\n\nbool System::GetLock(const std::string &name, int &out_handle)\n{\n struct flock fl;\n\n fl.l_type = F_WRLCK;\n fl.l_whence = SEEK_SET;\n fl.l_start = 0;\n fl.l_len = 1;\n\n if ((out_handle = open(name.c_str(), O_WRONLY | O_CREAT, Impl::LOCK_FILE_PERMISSION)) == -1)\n return false;\n\n if (fcntl(out_handle, F_SETLK, &fl) == -1)\n return false;\n\n return true;\n}\n\nvoid System::ReleaseLock(int &handle)\n{\n close(handle);\n}\n\n#elif defined ( _WIN32 )\n\nbool System::GetLock(const std::string &name, HANDLE &out_handle)\n{\n try {\n out_handle = OpenMutexA(MUTEX_ALL_ACCESS, TRUE, name.c_str());\n if (!out_handle) {\n out_handle = CreateMutexA(NULL, TRUE, name.c_str());\n return true;\n }\n } catch (...) {\n }\n\n return false;\n}\n\nvoid System::ReleaseLock(HANDLE &handle)\n{\n ReleaseMutex(handle);\n CloseHandle(handle);\n}\n\n#endif \/\/ defined ( __unix__ )\n\nstd::string System::GetProcessNameFromPath(const std::string &fullPath)\n{\n return fullPath.substr(fullPath.rfind(\"\/\") + 1);\n}\n\nstd::size_t System::GetPidsOfProcess(const std::string &process, std::vector<int> &out_pids)\n{\n out_pids.clear();\n\n#if defined ( __FreeBSD__ )\n static kvm_t *kd = nullptr;\n\n if ((kd = kvm_open(\"\/dev\/null\", \"\/dev\/null\", \"\/dev\/null\", O_RDONLY, \"kvm_open\")) == nullptr) {\n LOG_ERROR(kvm_geterr(kd));\n return 0;\n }\n\n int count;\n#if __FreeBSD__ >= 5\n struct kinfo_proc *p = kvm_getprocs(kd, KERN_PROC_PROC, 0, &count);\n#else\n struct kinfo_proc *p = kvm_getprocs(kd, KERN_PROC_ALL, 0, &count);\n#endif \/\/ __FreeBSD__ >= 5\n\n for (int i = 0; i < count; ++i) {\n#if __FreeBSD__ >= 5\n if (process.compare(0, COMMLEN, p[i].ki_comm) == 0) {\n out_pids.push_back(static_cast<int>(p[i].ki_pid));\n#else\n if (process.compare(0, MAXCOMLEN, p[i].kp_proc.p_comm) == 0) {\n out_pids.push_back(static_cast<int>(p[i].kp_proc.p_pid));\n#endif \/\/ __FreeBSD__ >= 5\n }\n }\n\n kvm_close(kd);\n#elif defined ( __linux )\n DIR *dp = opendir(\"\/proc\");\n\n if (dp != nullptr) {\n struct dirent *dir = readdir(dp);\n\n while (dir != nullptr) {\n int pid = atoi(dir->d_name);\n\n if (pid > 0) {\n std::stringstream ss;\n ss << \"\/proc\/\";\n ss << dir->d_name;\n ss << \"\/cmdline\";\n std::ifstream cmdFile(ss.str().c_str());\n std::string cmdLine;\n getline(cmdFile, cmdLine);\n\n if (!cmdLine.empty()) {\n size_t pos = cmdLine.find('\\0');\n\n if (pos != std::string::npos) {\n cmdLine = cmdLine.substr(0, pos);\n }\n\n pos = cmdLine.rfind('\/');\n\n if (pos != std::string::npos) {\n cmdLine = cmdLine.substr(pos + 1);\n }\n\n if (process.compare(cmdLine) == 0) {\n out_pids.push_back(pid);\n }\n }\n }\n\n dir = readdir(dp);\n }\n }\n#elif defined ( _WIN32 )\n PROCESSENTRY32 pe32;\n HANDLE hSnapshot = nullptr;\n pe32.dwSize = sizeof(PROCESSENTRY32);\n hSnapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n if (Process32First(hSnapshot, &pe32)) {\n do {\n if (process.compare(pe32.szExeFile) == 0) {\n out_pids.push_back(pe32.th32ProcessID);\n }\n } while (Process32Next(hSnapshot, &pe32));\n }\n\n if(hSnapshot != INVALID_HANDLE_VALUE) {\n CloseHandle(hSnapshot);\n }\n#endif \/\/ defined( __FreeBSD__ )\n\n return out_pids.size();\n}\n\nlong System::RandSeed()\n{\n timespec ts;\n\n#if defined ( __FreeBSD__ )\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#elif defined ( __linux )\n clock_gettime(CLOCK_REALTIME, &ts);\n#endif \/\/ defined ( __FreeBSD__ )\n\n return ts.tv_nsec;\n}\n<commit_msg>fix a linux build error<commit_after>\/**\n * @file\n * @author Mamadou Babaei <info@babaei.net>\n * @version 0.1.0\n *\n * @section LICENSE\n *\n * (The MIT License)\n *\n * Copyright (c) 2016 - 2020 Mamadou Babaei\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\n * @section DESCRIPTION\n *\n * Cross-platform OS level utility function.\n *\/\n\n\n#include <fstream>\n#include <sstream>\n#include <cstdio>\n#include <cstdlib>\n#if defined ( __unix__ )\n#if defined ( __linux )\n#include <dirent.h>\n#endif \/\/ defined ( __linux )\n#if defined ( __linux )\n#include <linux\/sysctl.h>\n#endif \/\/ defined ( __linux )\n#if defined ( __FreeBSD__ )\n#include <kvm.h>\n#include <sys\/dirent.h>\n#endif \/\/ defined ( __FreeBSD__ )\n#include <sys\/fcntl.h>\n#include <sys\/param.h>\n#if !defined ( __linux )\n#include <sys\/sysctl.h>\n#endif \/\/ !defined ( __linux )\n#include <sys\/time.h>\n#include <sys\/unistd.h>\n#include <sys\/user.h>\n#endif \/\/ defined ( __unix__ )\n#if defined ( _WIN32 )\n#include <tlhelp32.h>\n#include <windows.h>\n#endif \/\/ defined ( _WIN32 )\n#include \"Log.hpp\"\n#include \"make_unique.hpp\"\n#include \"System.hpp\"\n\nusing namespace std;\nusing namespace CoreLib;\n\nstruct System::Impl\n{\n#if defined ( __unix__ )\n static constexpr mode_t LOCK_FILE_PERMISSION = 0666;\n#endif \/\/ defined ( __unix__ )\n};\n\nbool System::Exec(const string &cmd)\n{\n int r = system(cmd.c_str());\n if (r == EXIT_SUCCESS)\n return true;\n else\n return false;\n}\n\nbool System::Exec(const string &cmd, string &out_output)\n{\n out_output.clear();\n\n FILE *pipe = popen(cmd.c_str(), \"r\");\n if (!pipe)\n return false;\n\n char buffer[256];\n while (!feof(pipe)) {\n if (fgets(buffer, 256, pipe) != NULL) {\n out_output += buffer;\n }\n }\n\n pclose(pipe);\n return true;\n}\n\n#if defined ( __unix__ )\n\nbool System::GetLock(const std::string &name, int &out_handle)\n{\n struct flock fl;\n\n fl.l_type = F_WRLCK;\n fl.l_whence = SEEK_SET;\n fl.l_start = 0;\n fl.l_len = 1;\n\n if ((out_handle = open(name.c_str(), O_WRONLY | O_CREAT, Impl::LOCK_FILE_PERMISSION)) == -1)\n return false;\n\n if (fcntl(out_handle, F_SETLK, &fl) == -1)\n return false;\n\n return true;\n}\n\nvoid System::ReleaseLock(int &handle)\n{\n close(handle);\n}\n\n#elif defined ( _WIN32 )\n\nbool System::GetLock(const std::string &name, HANDLE &out_handle)\n{\n try {\n out_handle = OpenMutexA(MUTEX_ALL_ACCESS, TRUE, name.c_str());\n if (!out_handle) {\n out_handle = CreateMutexA(NULL, TRUE, name.c_str());\n return true;\n }\n } catch (...) {\n }\n\n return false;\n}\n\nvoid System::ReleaseLock(HANDLE &handle)\n{\n ReleaseMutex(handle);\n CloseHandle(handle);\n}\n\n#endif \/\/ defined ( __unix__ )\n\nstd::string System::GetProcessNameFromPath(const std::string &fullPath)\n{\n return fullPath.substr(fullPath.rfind(\"\/\") + 1);\n}\n\nstd::size_t System::GetPidsOfProcess(const std::string &process, std::vector<int> &out_pids)\n{\n out_pids.clear();\n\n#if defined ( __FreeBSD__ )\n static kvm_t *kd = nullptr;\n\n if ((kd = kvm_open(\"\/dev\/null\", \"\/dev\/null\", \"\/dev\/null\", O_RDONLY, \"kvm_open\")) == nullptr) {\n LOG_ERROR(kvm_geterr(kd));\n return 0;\n }\n\n int count;\n#if __FreeBSD__ >= 5\n struct kinfo_proc *p = kvm_getprocs(kd, KERN_PROC_PROC, 0, &count);\n#else\n struct kinfo_proc *p = kvm_getprocs(kd, KERN_PROC_ALL, 0, &count);\n#endif \/\/ __FreeBSD__ >= 5\n\n for (int i = 0; i < count; ++i) {\n#if __FreeBSD__ >= 5\n if (process.compare(0, COMMLEN, p[i].ki_comm) == 0) {\n out_pids.push_back(static_cast<int>(p[i].ki_pid));\n#else\n if (process.compare(0, MAXCOMLEN, p[i].kp_proc.p_comm) == 0) {\n out_pids.push_back(static_cast<int>(p[i].kp_proc.p_pid));\n#endif \/\/ __FreeBSD__ >= 5\n }\n }\n\n kvm_close(kd);\n#elif defined ( __linux )\n DIR *dp = opendir(\"\/proc\");\n\n if (dp != nullptr) {\n struct dirent *dir = readdir(dp);\n\n while (dir != nullptr) {\n int pid = atoi(dir->d_name);\n\n if (pid > 0) {\n std::stringstream ss;\n ss << \"\/proc\/\";\n ss << dir->d_name;\n ss << \"\/cmdline\";\n std::ifstream cmdFile(ss.str().c_str());\n std::string cmdLine;\n getline(cmdFile, cmdLine);\n\n if (!cmdLine.empty()) {\n size_t pos = cmdLine.find('\\0');\n\n if (pos != std::string::npos) {\n cmdLine = cmdLine.substr(0, pos);\n }\n\n pos = cmdLine.rfind('\/');\n\n if (pos != std::string::npos) {\n cmdLine = cmdLine.substr(pos + 1);\n }\n\n if (process.compare(cmdLine) == 0) {\n out_pids.push_back(pid);\n }\n }\n }\n\n dir = readdir(dp);\n }\n }\n#elif defined ( _WIN32 )\n PROCESSENTRY32 pe32;\n HANDLE hSnapshot = nullptr;\n pe32.dwSize = sizeof(PROCESSENTRY32);\n hSnapshot = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);\n if (Process32First(hSnapshot, &pe32)) {\n do {\n if (process.compare(pe32.szExeFile) == 0) {\n out_pids.push_back(pe32.th32ProcessID);\n }\n } while (Process32Next(hSnapshot, &pe32));\n }\n\n if(hSnapshot != INVALID_HANDLE_VALUE) {\n CloseHandle(hSnapshot);\n }\n#endif \/\/ defined( __FreeBSD__ )\n\n return out_pids.size();\n}\n\nlong System::RandSeed()\n{\n timespec ts;\n\n#if defined ( __FreeBSD__ )\n clock_gettime(CLOCK_MONOTONIC, &ts);\n#elif defined ( __linux )\n clock_gettime(CLOCK_REALTIME, &ts);\n#endif \/\/ defined ( __FreeBSD__ )\n\n return ts.tv_nsec;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"CoreThreadTest.h\"\n#include \"Autowired.h\"\n#include \"TestFixtures\/SimpleThreaded.h\"\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread.hpp>\n\nclass SpamguardTest:\n public CoreThread\n{\npublic:\n SpamguardTest(void):\n m_hit(false),\n m_multiHit(false)\n {\n }\n\n bool m_hit;\n bool m_multiHit;\n\n void Run(void) override {\n if(m_hit) {\n m_multiHit = true;\n return;\n }\n\n m_hit = false;\n\n boost::unique_lock<boost::mutex> lk(m_lock);\n m_stateCondition.wait(lk, [this] () {return ShouldStop();});\n }\n};\n\nTEST_F(CoreThreadTest, VerifyStartSpam) {\n \/\/ Create our thread class:\n AutoRequired<SpamguardTest> instance;\n\n m_create->InitiateCoreThreads();\n\n \/\/ This shouldn't cause another thread to be created:\n instance->Start(std::shared_ptr<Object>(new Object));\n\n EXPECT_FALSE(instance->m_multiHit) << \"Thread was run more than once unexpectedly\";\n}\n\nclass InvokesIndefiniteWait:\n public CoreThread\n{\npublic:\n virtual void Run(void) override {\n AcceptDispatchDelivery();\n\n \/\/ Wait for one event using an indefinite timeout, then quit:\n WaitForEvent(boost::chrono::steady_clock::time_point::max());\n }\n};\n\nTEST_F(CoreThreadTest, VerifyIndefiniteDelay) {\n AutoRequired<InvokesIndefiniteWait> instance;\n m_create->InitiateCoreThreads();\n\n \/\/ Verify that the instance does not quit until we pend something:\n ASSERT_FALSE(instance->WaitFor(boost::chrono::milliseconds(10))) << \"Thread instance exited prematurely, when it should have been waiting indefinitely\";\n\n \/\/ Now we pend an arbitrary event and verify that we can wait:\n *instance += [] {};\n ASSERT_TRUE(instance->WaitFor(boost::chrono::milliseconds(10))) << \"Instance did not exit after an event was pended which should have woken up its dispatch loop\";\n}\n\nTEST_F(CoreThreadTest, VerifyNestedTermination) {\n std::shared_ptr<SimpleThreaded> st;\n\n \/\/ Insert a thread into a second-order subcontext:\n {\n AutoCreateContext outer;\n CurrentContextPusher outerPshr(outer);\n AutoRequired<SimpleThreaded>();\n outer->InitiateCoreThreads();\n\n {\n AutoCreateContext ctxt;\n CurrentContextPusher pshr(ctxt);\n ctxt->InitiateCoreThreads();\n st = AutoRequired<SimpleThreaded>();\n }\n }\n\n \/\/ Everything should be running by now:\n ASSERT_TRUE(st->IsRunning()) << \"Child thread was not running as expected\";\n\n \/\/ Shut down the enclosing context:\n m_create->SignalTerminate(true);\n\n \/\/ Verify that the child thread has stopped:\n ASSERT_FALSE(st->IsRunning()) << \"Child thread was running even though the enclosing context was terminated\";\n}\n\nclass SleepEvent : public virtual EventReceiver\n{\npublic:\n virtual Deferred SleepFor(int seconds) = 0;\n virtual Deferred SleepForThenThrow(int seconds) = 0;\n};\n\nclass ListenThread :\n public CoreThread,\n public SleepEvent\n{\npublic:\n ListenThread() : CoreThread(\"ListenThread\") {}\n\n Deferred SleepFor(int seconds) override {\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n if(ShouldStop())\n throw std::runtime_error(\"Execution aborted\");\n\n return Deferred(this);\n }\n\n Deferred SleepForThenThrow(int seconds) override {\n return Deferred(this);\n }\n};\n\nTEST_F(CoreThreadTest, VerifyDispatchQueueShutdown) {\n AutoCreateContext ctxt;\n CurrentContextPusher pusher(ctxt);\n\n AutoRequired<ListenThread> listener;\n try\n {\n ctxt->InitiateCoreThreads();\n listener->DelayUntilCanAccept();\n\n AutoFired<SleepEvent> evt;\n\n \/\/ Spam in a bunch of events:\n for(size_t i = 100; i--;)\n evt(&SleepEvent::SleepFor)(0);\n\n \/\/ Graceful termination then enclosing context shutdown:\n listener->Stop(true);\n ctxt->SignalShutdown(true);\n }\n catch (...) {}\n\n ASSERT_EQ(listener->GetDispatchQueueLength(), static_cast<size_t>(0));\n}\n\nTEST_F(CoreThreadTest, VerifyNoLeakOnExecptions) {\n AutoCreateContext ctxt;\n CurrentContextPusher pshr(ctxt);\n\n AutoRequired<ListenThread> listener;\n std::shared_ptr<std::string> value(new std::string(\"sentinal\"));\n\n std::weak_ptr<std::string> watcher(value);\n try\n {\n ctxt->InitiateCoreThreads();\n listener->DelayUntilCanAccept();\n\n *listener += [value] { throw std::exception(); };\n value.reset();\n ctxt->SignalShutdown(true);\n }\n catch (...) {}\n\n ASSERT_TRUE(watcher.expired()) << \"Leaked memory on exception in a dispatch event\";\n}\n\nTEST_F(CoreThreadTest, VerifyDelayedDispatchQueueSimple) {\n \/\/ Run our threads immediately, no need to wait\n m_create->InitiateCoreThreads();\n\n \/\/ Create a thread which we'll use just to pend dispatch events:\n AutoRequired<CoreThread> t;\n\n \/\/ Thread should be running by now:\n ASSERT_TRUE(t->IsRunning()) << \"Thread added to a running context was not marked running\";\n\n \/\/ Delay until the dispatch loop is actually running, then wait an additional 1ms to let the\n \/\/ WaitForEvent call catch on:\n t->DelayUntilCanAccept();\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n\n \/\/ These are flags--we'll set them to true as the test proceeds\n std::shared_ptr<bool> x(new bool(false));\n std::shared_ptr<bool> y(new bool(false));\n\n \/\/ Pend a delayed event first, and then an immediate event right afterwards:\n *t += boost::chrono::hours(1), [x] { *x = true; };\n *t += [y] { *y = true; };\n\n \/\/ Verify that, after 10ms, the first event is called and the second event is NOT called:\n boost::this_thread::sleep_for(boost::chrono::milliseconds(10));\n ASSERT_TRUE(*y) << \"A simple ready call was not dispatched within 10ms of being pended\";\n ASSERT_FALSE(*x) << \"An event which should not have been executed for 25ms was executed early\";\n}\n\nTEST_F(CoreThreadTest, VerifyNoDelayDoubleFree) {\n m_create->InitiateCoreThreads();\n\n \/\/ We won't actually be referencing this, we just want to make sure it's not destroyed early\n std::shared_ptr<bool> x(new bool);\n\n \/\/ This deferred pend will never actually be executed:\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n *t += boost::chrono::hours(1), [x] {};\n\n \/\/ Verify that we have exactly one pended event at this point.\n ASSERT_EQ(1UL, t->GetDispatchQueueLength()) << \"Dispatch queue had an unexpected number of pended events\";\n\n \/\/ Verify that the shared pointer isn't unique at this point. If it is, it's because our CoreThread deleted\n \/\/ the event even though it was supposed to have pended it.\n ASSERT_FALSE(x.unique()) << \"A pended event was freed before it was called, and appears to be present in a dispatch queue\";\n}\n\nTEST_F(CoreThreadTest, VerifyDoublePendedDispatchDelay) {\n \/\/ Immediately pend threads:\n m_create->InitiateCoreThreads();\n\n \/\/ Some variables that we will set to true as the test proceeds:\n std::shared_ptr<bool> x(new bool(false));\n std::shared_ptr<bool> y(new bool(false));\n\n \/\/ Create a thread as before, and pend a few events. The order, here, is important. We intentionally\n \/\/ pend an event that won't happen for awhile, in order to trick the dispatch queue into waiting for\n \/\/ a lot longer than it should for the next event.\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n *t += boost::chrono::hours(1), [x] { *x = true; };\n\n \/\/ Now pend an event that will be ready just about right away:\n *t += boost::chrono::nanoseconds(1), [y] { *y = true; };\n\n \/\/ Delay for a short period of time, then check our variable states:\n boost::this_thread::sleep_for(boost::chrono::milliseconds(10));\n\n \/\/ This one shouldn't have been hit yet, it isn't scheduled to be hit for 10s\n ASSERT_FALSE(*x) << \"A delayed dispatch was invoked extremely early\";\n\n \/\/ This one should have been ready almost at the same time as it was pended\n ASSERT_TRUE(*y) << \"An out-of-order delayed dispatch was not executed in time as expected\";\n}\n\nTEST_F(CoreThreadTest, VerifyTimedSort) {\n m_create->InitiateCoreThreads();\n AutoRequired<CoreThread> t;\n\n std::vector<size_t> v;\n\n \/\/ Pend a stack of lambdas. Each lambda waits 3i milliseconds, and pushes the value\n \/\/ i to the back of a vector. If the delay method is implemented correctly, the resulting\n \/\/ vector will always wind up sorted, no matter how we push elements to the queue.\n \/\/ To doubly verify this property, we don't trivially increment i from the minimum to the\n \/\/ maximum--rather, we use a simple PRNG called a linear congruential generator and hop around\n \/\/ the interval [1...12] instead.\n for(size_t i = 1; i != 0; i = (i * 5 + 1) % 16)\n *t += boost::chrono::milliseconds(i * 3), [&v, i] { v.push_back(i); };\n\n \/\/ Delay 50ms for the thread to finish up. Technically this is 11ms more than we need.\n boost::this_thread::sleep_for(boost::chrono::seconds(1));\n\n \/\/ Verify that the resulting vector is sorted.\n ASSERT_TRUE(std::is_sorted(v.begin(), v.end())) << \"A timed sort implementation did not generate a sorted sequence as expected\";\n}\n\nTEST_F(CoreThreadTest, VerifyPendByTimePoint) {\n m_create->InitiateCoreThreads();\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n\n \/\/ Pend by an absolute time point, nothing really special here\n std::shared_ptr<bool> x(new bool(false));\n *t += (boost::chrono::high_resolution_clock::now() + boost::chrono::milliseconds(1)), [&x] { *x = true; };\n\n \/\/ Verify that we hit this after one ms of delay\n ASSERT_FALSE(*x) << \"A timepoint-based delayed dispatch was invoked early\";\n boost::this_thread::sleep_for(boost::chrono::milliseconds(2));\n ASSERT_TRUE(*x) << \"A timepoint-based delayed dispatch was not invoked in a timely fashion\";\n}\n\ntemplate<ThreadPriority priority>\nclass JustIncrementsANumber:\n public CoreThread\n{\npublic:\n JustIncrementsANumber():\n val(0)\n {}\n \n volatile int64_t val;\n\n \/\/ This will be a hotly contested conditional variable\n AutoRequired<boost::mutex> contended;\n\n void Run(void) override {\n ElevatePriority p(*this, priority);\n while(!ShouldStop()) {\n \/\/ Obtain the lock and then increment our value:\n boost::lock_guard<boost::mutex> lk(*contended);\n val++;\n }\n }\n};\n\n#ifdef _MSC_VER\nTEST_F(CoreThreadTest, VerifyCanBoostPriority) {\n \/\/ Create two spinners and kick them off at the same time:\n AutoRequired<JustIncrementsANumber<ThreadPriority::Normal>> lower;\n AutoRequired<JustIncrementsANumber<ThreadPriority::AboveNormal>> higher;\n m_create->InitiateCoreThreads();\n\n \/\/ Poke the conditional variable a lot:\n AutoRequired<boost::mutex> contended;\n for(size_t i = 100; i--;) {\n \/\/ We sleep while holding contention lock to force waiting threads into the sleep queue. The reason we have to do\n \/\/ this is due to the way that mutex is implemented under the hood. The STL mutex uses a high-frequency variable\n \/\/ and attempts to perform a CAS (check-and-set) on this variable. If it succeeds, the lock is obtained; if it\n \/\/ fails, it will put the thread into a non-ready state by calling WaitForSingleObject on Windows or one of the\n \/\/ mutex_lock methods on Unix.\n \/\/\n \/\/ When a thread can't be run, it's moved from the OS's ready queue to the sleep queue. The scheduler knows that\n \/\/ the thread can be moved back to the ready queue if a particular object is signalled, but in the case of a lock,\n \/\/ only one of the threads waiting on the object can actually be moved to the ready queue. It's at THIS POINT that\n \/\/ the operating system consults the thread priority--if only thread can be moved over, then the highest priority\n \/\/ thread will wind up in the ready queue every time.\n \/\/\n \/\/ Thread priority does _not_ necessarily influence the amount of time the scheduler allocates allocated to a ready\n \/\/ thread with respect to other threads of the same process. This is why we hold the lock for a full millisecond,\n \/\/ in order to force the thread over to the sleep queue and ensure that the priority resolution mechanism is\n \/\/ directly tested.\n boost::lock_guard<boost::mutex> lk(*contended);\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n }\n\n \/\/ Need to terminate before we try running a comparison.\n m_create->SignalTerminate();\n\n ASSERT_LE(lower->val, higher->val) << \"A lower-priority thread was moved out of the sleep queue more frequently than a high-priority thread\";\n}\n#else\n#pragma message \"Warning: SetThreadPriority not implemented on Unix\"\n#endif<commit_msg>Another test relaxation, required because of our slow Linux server<commit_after>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"CoreThreadTest.h\"\n#include \"Autowired.h\"\n#include \"TestFixtures\/SimpleThreaded.h\"\n#include <boost\/thread\/thread.hpp>\n#include <boost\/thread.hpp>\n\nclass SpamguardTest:\n public CoreThread\n{\npublic:\n SpamguardTest(void):\n m_hit(false),\n m_multiHit(false)\n {\n }\n\n bool m_hit;\n bool m_multiHit;\n\n void Run(void) override {\n if(m_hit) {\n m_multiHit = true;\n return;\n }\n\n m_hit = false;\n\n boost::unique_lock<boost::mutex> lk(m_lock);\n m_stateCondition.wait(lk, [this] () {return ShouldStop();});\n }\n};\n\nTEST_F(CoreThreadTest, VerifyStartSpam) {\n \/\/ Create our thread class:\n AutoRequired<SpamguardTest> instance;\n\n m_create->InitiateCoreThreads();\n\n \/\/ This shouldn't cause another thread to be created:\n instance->Start(std::shared_ptr<Object>(new Object));\n\n EXPECT_FALSE(instance->m_multiHit) << \"Thread was run more than once unexpectedly\";\n}\n\nclass InvokesIndefiniteWait:\n public CoreThread\n{\npublic:\n virtual void Run(void) override {\n AcceptDispatchDelivery();\n\n \/\/ Wait for one event using an indefinite timeout, then quit:\n WaitForEvent(boost::chrono::steady_clock::time_point::max());\n }\n};\n\nTEST_F(CoreThreadTest, VerifyIndefiniteDelay) {\n AutoRequired<InvokesIndefiniteWait> instance;\n m_create->InitiateCoreThreads();\n\n \/\/ Verify that the instance does not quit until we pend something:\n ASSERT_FALSE(instance->WaitFor(boost::chrono::milliseconds(10))) << \"Thread instance exited prematurely, when it should have been waiting indefinitely\";\n\n \/\/ Now we pend an arbitrary event and verify that we can wait:\n *instance += [] {};\n ASSERT_TRUE(instance->WaitFor(boost::chrono::milliseconds(10))) << \"Instance did not exit after an event was pended which should have woken up its dispatch loop\";\n}\n\nTEST_F(CoreThreadTest, VerifyNestedTermination) {\n std::shared_ptr<SimpleThreaded> st;\n\n \/\/ Insert a thread into a second-order subcontext:\n {\n AutoCreateContext outer;\n CurrentContextPusher outerPshr(outer);\n AutoRequired<SimpleThreaded>();\n outer->InitiateCoreThreads();\n\n {\n AutoCreateContext ctxt;\n CurrentContextPusher pshr(ctxt);\n ctxt->InitiateCoreThreads();\n st = AutoRequired<SimpleThreaded>();\n }\n }\n\n \/\/ Everything should be running by now:\n ASSERT_TRUE(st->IsRunning()) << \"Child thread was not running as expected\";\n\n \/\/ Shut down the enclosing context:\n m_create->SignalTerminate(true);\n\n \/\/ Verify that the child thread has stopped:\n ASSERT_FALSE(st->IsRunning()) << \"Child thread was running even though the enclosing context was terminated\";\n}\n\nclass SleepEvent : public virtual EventReceiver\n{\npublic:\n virtual Deferred SleepFor(int seconds) = 0;\n virtual Deferred SleepForThenThrow(int seconds) = 0;\n};\n\nclass ListenThread :\n public CoreThread,\n public SleepEvent\n{\npublic:\n ListenThread() : CoreThread(\"ListenThread\") {}\n\n Deferred SleepFor(int seconds) override {\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n if(ShouldStop())\n throw std::runtime_error(\"Execution aborted\");\n\n return Deferred(this);\n }\n\n Deferred SleepForThenThrow(int seconds) override {\n return Deferred(this);\n }\n};\n\nTEST_F(CoreThreadTest, VerifyDispatchQueueShutdown) {\n AutoCreateContext ctxt;\n CurrentContextPusher pusher(ctxt);\n\n AutoRequired<ListenThread> listener;\n try\n {\n ctxt->InitiateCoreThreads();\n listener->DelayUntilCanAccept();\n\n AutoFired<SleepEvent> evt;\n\n \/\/ Spam in a bunch of events:\n for(size_t i = 100; i--;)\n evt(&SleepEvent::SleepFor)(0);\n\n \/\/ Graceful termination then enclosing context shutdown:\n listener->Stop(true);\n ctxt->SignalShutdown(true);\n }\n catch (...) {}\n\n ASSERT_EQ(listener->GetDispatchQueueLength(), static_cast<size_t>(0));\n}\n\nTEST_F(CoreThreadTest, VerifyNoLeakOnExecptions) {\n AutoCreateContext ctxt;\n CurrentContextPusher pshr(ctxt);\n\n AutoRequired<ListenThread> listener;\n std::shared_ptr<std::string> value(new std::string(\"sentinal\"));\n\n std::weak_ptr<std::string> watcher(value);\n try\n {\n ctxt->InitiateCoreThreads();\n listener->DelayUntilCanAccept();\n\n *listener += [value] { throw std::exception(); };\n value.reset();\n ctxt->SignalShutdown(true);\n }\n catch (...) {}\n\n ASSERT_TRUE(watcher.expired()) << \"Leaked memory on exception in a dispatch event\";\n}\n\nTEST_F(CoreThreadTest, VerifyDelayedDispatchQueueSimple) {\n \/\/ Run our threads immediately, no need to wait\n m_create->InitiateCoreThreads();\n\n \/\/ Create a thread which we'll use just to pend dispatch events:\n AutoRequired<CoreThread> t;\n\n \/\/ Thread should be running by now:\n ASSERT_TRUE(t->IsRunning()) << \"Thread added to a running context was not marked running\";\n\n \/\/ Delay until the dispatch loop is actually running, then wait an additional 1ms to let the\n \/\/ WaitForEvent call catch on:\n t->DelayUntilCanAccept();\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n\n \/\/ These are flags--we'll set them to true as the test proceeds\n std::shared_ptr<bool> x(new bool(false));\n std::shared_ptr<bool> y(new bool(false));\n\n \/\/ Pend a delayed event first, and then an immediate event right afterwards:\n *t += boost::chrono::hours(1), [x] { *x = true; };\n *t += [y] { *y = true; };\n\n \/\/ Verify that, after 100ms, the first event is called and the second event is NOT called:\n boost::this_thread::sleep_for(boost::chrono::milliseconds(100));\n ASSERT_TRUE(*y) << \"A simple ready call was not dispatched within 100ms of being pended\";\n ASSERT_FALSE(*x) << \"An event which should not have been executed for an hour was executed early\";\n}\n\nTEST_F(CoreThreadTest, VerifyNoDelayDoubleFree) {\n m_create->InitiateCoreThreads();\n\n \/\/ We won't actually be referencing this, we just want to make sure it's not destroyed early\n std::shared_ptr<bool> x(new bool);\n\n \/\/ This deferred pend will never actually be executed:\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n *t += boost::chrono::hours(1), [x] {};\n\n \/\/ Verify that we have exactly one pended event at this point.\n ASSERT_EQ(1UL, t->GetDispatchQueueLength()) << \"Dispatch queue had an unexpected number of pended events\";\n\n \/\/ Verify that the shared pointer isn't unique at this point. If it is, it's because our CoreThread deleted\n \/\/ the event even though it was supposed to have pended it.\n ASSERT_FALSE(x.unique()) << \"A pended event was freed before it was called, and appears to be present in a dispatch queue\";\n}\n\nTEST_F(CoreThreadTest, VerifyDoublePendedDispatchDelay) {\n \/\/ Immediately pend threads:\n m_create->InitiateCoreThreads();\n\n \/\/ Some variables that we will set to true as the test proceeds:\n std::shared_ptr<bool> x(new bool(false));\n std::shared_ptr<bool> y(new bool(false));\n\n \/\/ Create a thread as before, and pend a few events. The order, here, is important. We intentionally\n \/\/ pend an event that won't happen for awhile, in order to trick the dispatch queue into waiting for\n \/\/ a lot longer than it should for the next event.\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n *t += boost::chrono::hours(1), [x] { *x = true; };\n\n \/\/ Now pend an event that will be ready just about right away:\n *t += boost::chrono::nanoseconds(1), [y] { *y = true; };\n\n \/\/ Delay for a short period of time, then check our variable states:\n boost::this_thread::sleep_for(boost::chrono::milliseconds(10));\n\n \/\/ This one shouldn't have been hit yet, it isn't scheduled to be hit for 10s\n ASSERT_FALSE(*x) << \"A delayed dispatch was invoked extremely early\";\n\n \/\/ This one should have been ready almost at the same time as it was pended\n ASSERT_TRUE(*y) << \"An out-of-order delayed dispatch was not executed in time as expected\";\n}\n\nTEST_F(CoreThreadTest, VerifyTimedSort) {\n m_create->InitiateCoreThreads();\n AutoRequired<CoreThread> t;\n\n std::vector<size_t> v;\n\n \/\/ Pend a stack of lambdas. Each lambda waits 3i milliseconds, and pushes the value\n \/\/ i to the back of a vector. If the delay method is implemented correctly, the resulting\n \/\/ vector will always wind up sorted, no matter how we push elements to the queue.\n \/\/ To doubly verify this property, we don't trivially increment i from the minimum to the\n \/\/ maximum--rather, we use a simple PRNG called a linear congruential generator and hop around\n \/\/ the interval [1...12] instead.\n for(size_t i = 1; i != 0; i = (i * 5 + 1) % 16)\n *t += boost::chrono::milliseconds(i * 3), [&v, i] { v.push_back(i); };\n\n \/\/ Delay 50ms for the thread to finish up. Technically this is 11ms more than we need.\n boost::this_thread::sleep_for(boost::chrono::seconds(1));\n\n \/\/ Verify that the resulting vector is sorted.\n ASSERT_TRUE(std::is_sorted(v.begin(), v.end())) << \"A timed sort implementation did not generate a sorted sequence as expected\";\n}\n\nTEST_F(CoreThreadTest, VerifyPendByTimePoint) {\n m_create->InitiateCoreThreads();\n AutoRequired<CoreThread> t;\n t->DelayUntilCanAccept();\n\n \/\/ Pend by an absolute time point, nothing really special here\n std::shared_ptr<bool> x(new bool(false));\n *t += (boost::chrono::high_resolution_clock::now() + boost::chrono::milliseconds(1)), [&x] { *x = true; };\n\n \/\/ Verify that we hit this after one ms of delay\n ASSERT_FALSE(*x) << \"A timepoint-based delayed dispatch was invoked early\";\n boost::this_thread::sleep_for(boost::chrono::milliseconds(2));\n ASSERT_TRUE(*x) << \"A timepoint-based delayed dispatch was not invoked in a timely fashion\";\n}\n\ntemplate<ThreadPriority priority>\nclass JustIncrementsANumber:\n public CoreThread\n{\npublic:\n JustIncrementsANumber():\n val(0)\n {}\n \n volatile int64_t val;\n\n \/\/ This will be a hotly contested conditional variable\n AutoRequired<boost::mutex> contended;\n\n void Run(void) override {\n ElevatePriority p(*this, priority);\n while(!ShouldStop()) {\n \/\/ Obtain the lock and then increment our value:\n boost::lock_guard<boost::mutex> lk(*contended);\n val++;\n }\n }\n};\n\n#ifdef _MSC_VER\nTEST_F(CoreThreadTest, VerifyCanBoostPriority) {\n \/\/ Create two spinners and kick them off at the same time:\n AutoRequired<JustIncrementsANumber<ThreadPriority::Normal>> lower;\n AutoRequired<JustIncrementsANumber<ThreadPriority::AboveNormal>> higher;\n m_create->InitiateCoreThreads();\n\n \/\/ Poke the conditional variable a lot:\n AutoRequired<boost::mutex> contended;\n for(size_t i = 100; i--;) {\n \/\/ We sleep while holding contention lock to force waiting threads into the sleep queue. The reason we have to do\n \/\/ this is due to the way that mutex is implemented under the hood. The STL mutex uses a high-frequency variable\n \/\/ and attempts to perform a CAS (check-and-set) on this variable. If it succeeds, the lock is obtained; if it\n \/\/ fails, it will put the thread into a non-ready state by calling WaitForSingleObject on Windows or one of the\n \/\/ mutex_lock methods on Unix.\n \/\/\n \/\/ When a thread can't be run, it's moved from the OS's ready queue to the sleep queue. The scheduler knows that\n \/\/ the thread can be moved back to the ready queue if a particular object is signalled, but in the case of a lock,\n \/\/ only one of the threads waiting on the object can actually be moved to the ready queue. It's at THIS POINT that\n \/\/ the operating system consults the thread priority--if only thread can be moved over, then the highest priority\n \/\/ thread will wind up in the ready queue every time.\n \/\/\n \/\/ Thread priority does _not_ necessarily influence the amount of time the scheduler allocates allocated to a ready\n \/\/ thread with respect to other threads of the same process. This is why we hold the lock for a full millisecond,\n \/\/ in order to force the thread over to the sleep queue and ensure that the priority resolution mechanism is\n \/\/ directly tested.\n boost::lock_guard<boost::mutex> lk(*contended);\n boost::this_thread::sleep_for(boost::chrono::milliseconds(1));\n }\n\n \/\/ Need to terminate before we try running a comparison.\n m_create->SignalTerminate();\n\n ASSERT_LE(lower->val, higher->val) << \"A lower-priority thread was moved out of the sleep queue more frequently than a high-priority thread\";\n}\n#else\n#pragma message \"Warning: SetThreadPriority not implemented on Unix\"\n#endif<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <algorithm>\n#include <math.h>\n#include <float.h>\n#include <random>\nusing namespace std ;\n\nconst double pi = 3.14159265358979323846264338328 ;\n\nvector<double> linspace(double a, double b, int n)\n{\n\tvector<double> array ;\n\tdouble step = (b-a)\/(n-1) ;\n\twhile (a<=b)\n\t{\n\t\tarray.push_back(a) ;\n\t\ta += step ;\n\t}\n\treturn array ;\n}\n\n\/*double IntNormDist(double mu, double sig, double a)\n{\n\tint n = 1000 ;\n\tvector<double> x = linspace(a,mu+3*sig,n) ;\n\tdouble dx = (x[1]-x[0]) ;\n\t\n\tdouble integral = 0.0 ;\n\tfor (int i = 0; i < x.size(); i++)\n\t{\n\t\tdouble fac = 1\/(sig*sqrt(2*pi)) ;\n\t\tdouble ind = -(pow(x[i]-mu,2))\/(2*pow(sig,2)) ;\n\t\tintegral += fac*exp(ind)*dx ;\n\t}\n\treturn integral ;\n}*\/\n\ndouble ComputeImprovementProbability(double c_A0, double c_B0, vector<double> mu_A, vector<double> sig_A, vector<double> mu_B, vector<double> sig_B)\n{\n\tdouble max_3sig = mu_A[0] + 3*sig_A[0] ;\n\tdouble min_3sig = mu_A[0] - 3*sig_A[0] ;\n\tfor (int i = 0; i < mu_A.size(); i++)\n\t{\n\t\tif (max_3sig < mu_A[i]+3*sig_A[i])\n\t\t\tmax_3sig = mu_A[i]+3*sig_A[i] ;\n\t\tif (min_3sig > mu_A[i]-3*sig_A[i])\n\t\t\tmin_3sig = mu_A[i]-3*sig_A[i] ;\n\t}\n\tfor (int i = 0; i < mu_B.size(); i++)\n\t{\n\t\tif (max_3sig < mu_B[i]+3*sig_B[i])\n\t\t\tmax_3sig = mu_B[i]+3*sig_B[i] ;\n\t\tif (min_3sig > mu_B[i]-3*sig_B[i])\n\t\t\tmin_3sig = mu_B[i]-3*sig_B[i] ;\n\t}\n\t\n\tint n = 100000 ;\n\tvector<double> x = linspace(min_3sig,max_3sig,n) ;\n\tdouble dx = x[1]-x[0] ;\n\tdouble pImprove = 0.0 ;\n\tfor (int k = 0; k < x.size(); k++)\n\t{\n\t\tdouble p_cAi = 0.0 ;\n\t\tfor (int i = 0; i < mu_A.size(); i++)\n\t\t{\n\t\t\tdouble p_cA1 = (1\/(sig_A[i]*sqrt(2*pi)))*exp(-(pow(x[k]-mu_A[i],2))\/(2*pow(sig_A[i],2))) ;\n\t\t\tdouble p_cA2 = 1.0 ;\n\t\t\tfor (int j = 0; j < mu_A.size(); j++)\n\t\t\t{\n\t\t\t\tif (j != i)\n\t\t\t\t\tp_cA2 *= 0.5*erfc((x[k]-mu_A[j])\/(sig_A[j]*sqrt(2))) ;\n\t\t\t}\n\t\t\tp_cAi += p_cA1*p_cA2 ;\n\t\t}\n\t\tdouble p_cBi = 1.0 ;\n\t\tfor (int i = 0; i < mu_B.size(); i++)\n\t\t\tp_cBi *= 0.5*erfc((x[k]-(c_B0-c_A0)-mu_B[i])\/(sig_B[i]*sqrt(2))) ;\n\t\tpImprove += (p_cAi)*(1-p_cBi)*dx ;\n\t}\n\treturn pImprove;\n}\n\nint main()\n{\n\t\n\tdefault_random_engine generator ;\n\t\n\tuniform_real_distribution<double> mu_dist(0.0,10.0) ;\n\tuniform_real_distribution<double> sig_dist(0.0,10.0) ;\n\t\n\tvector<double> mu_A ;\n\tvector<double> sig_A ;\n\n\tint m = 3 ;\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tmu_A.push_back(mu_dist(generator)) ;\n\t\tsig_A.push_back(sig_dist(generator)) ;\n\t}\n\n\tvector<double> mu_B ;\n\tvector<double> sig_B ;\n\t\n\tint n = 10 ;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tmu_B.push_back(mu_dist(generator)) ;\n\t\tsig_B.push_back(sig_dist(generator)) ;\n\t}\n\t\n\tdouble c_A0 = mu_dist(generator) ;\n\tdouble c_B0 = mu_dist(generator) ;\n\n\tdouble pImprove = ComputeImprovementProbability(c_A0,c_B0,mu_A,sig_A,mu_B,sig_B) ;\n\n\tcout << \"Probability of improvement: \" << pImprove << endl ;\n\n\tn = 100000 ;\n\tvector<double> A_cost(n,c_A0) ;\n\tvector<double> B_cost(n,c_B0) ;\n\t\n\tdouble pBoverA = 0.0 ;\n\tfor (int k = 0; k < n; k++)\n\t{\n\t\tdouble best_A = DBL_MAX ;\n\t\tfor (int i = 0; i < mu_A.size(); i++)\n\t\t{\n\t\t\tnormal_distribution<double> distribution(mu_A[i],sig_A[i]) ;\n\t\t\tdouble c_Ai = distribution(generator) ;\n\t\t\t\tif (c_Ai < best_A)\n\t\t\t\t\tbest_A = c_Ai ;\n\t\t}\n\t\tA_cost[k] += best_A ;\n\n\t\tdouble best_B = DBL_MAX ;\n\t\tfor (int i = 0; i < mu_B.size(); i++)\n\t\t{\n\t\t\tnormal_distribution<double> distribution(mu_B[i],sig_B[i]) ;\n\t\t\tdouble c_Bi = distribution(generator) ;\n\t\t\t\tif (c_Bi < best_B)\n\t\t\t\t\tbest_B = c_Bi ;\n\t\t}\n\t\tB_cost[k] += best_B ;\n\n\t\tif (B_cost[k]<=A_cost[k])\n\t\t\tpBoverA++ ;\n\t}\n\n\tdouble pBA = pBoverA\/n ;\n\tcout << \"Monte Carlo probability: \" << pBA << endl ;\n\n\treturn 0 ;\n}\n<commit_msg>Included clock time comparison between function and MC trials<commit_after>#include <iostream>\n#include <algorithm>\n#include <math.h>\n#include <float.h>\n#include <random>\n#include <time.h>\nusing namespace std ;\n\nconst double pi = 3.14159265358979323846264338328 ;\n\nvector<double> linspace(double a, double b, int n)\n{\n\tvector<double> array ;\n\tdouble step = (b-a)\/(n-1) ;\n\twhile (a<=b)\n\t{\n\t\tarray.push_back(a) ;\n\t\ta += step ;\n\t}\n\treturn array ;\n}\n\n\/*double IntNormDist(double mu, double sig, double a)\n{\n\tint n = 1000 ;\n\tvector<double> x = linspace(a,mu+3*sig,n) ;\n\tdouble dx = (x[1]-x[0]) ;\n\t\n\tdouble integral = 0.0 ;\n\tfor (int i = 0; i < x.size(); i++)\n\t{\n\t\tdouble fac = 1\/(sig*sqrt(2*pi)) ;\n\t\tdouble ind = -(pow(x[i]-mu,2))\/(2*pow(sig,2)) ;\n\t\tintegral += fac*exp(ind)*dx ;\n\t}\n\treturn integral ;\n}*\/\n\ndouble ComputeImprovementProbability(double c_A0, double c_B0, vector<double> mu_A, vector<double> sig_A, vector<double> mu_B, vector<double> sig_B)\n{\n\tdouble max_3sig = mu_A[0] + 3*sig_A[0] ;\n\tdouble min_3sig = mu_A[0] - 3*sig_A[0] ;\n\tfor (int i = 0; i < mu_A.size(); i++)\n\t{\n\t\tif (max_3sig < mu_A[i]+3*sig_A[i])\n\t\t\tmax_3sig = mu_A[i]+3*sig_A[i] ;\n\t\tif (min_3sig > mu_A[i]-3*sig_A[i])\n\t\t\tmin_3sig = mu_A[i]-3*sig_A[i] ;\n\t}\n\tfor (int i = 0; i < mu_B.size(); i++)\n\t{\n\t\tif (max_3sig < mu_B[i]+3*sig_B[i])\n\t\t\tmax_3sig = mu_B[i]+3*sig_B[i] ;\n\t\tif (min_3sig > mu_B[i]-3*sig_B[i])\n\t\t\tmin_3sig = mu_B[i]-3*sig_B[i] ;\n\t}\n\t\n\tint n = 10000 ;\n\tvector<double> x = linspace(min_3sig,max_3sig,n) ;\n\tdouble dx = x[1]-x[0] ;\n\tdouble pImprove = 0.0 ;\n\tfor (int k = 0; k < x.size(); k++)\n\t{\n\t\tdouble p_cAi = 0.0 ;\n\t\tfor (int i = 0; i < mu_A.size(); i++)\n\t\t{\n\t\t\tdouble p_cA1 = (1\/(sig_A[i]*sqrt(2*pi)))*exp(-(pow(x[k]-mu_A[i],2))\/(2*pow(sig_A[i],2))) ;\n\t\t\tdouble p_cA2 = 1.0 ;\n\t\t\tfor (int j = 0; j < mu_A.size(); j++)\n\t\t\t{\n\t\t\t\tif (j != i)\n\t\t\t\t\tp_cA2 *= 0.5*erfc((x[k]-mu_A[j])\/(sig_A[j]*sqrt(2))) ;\n\t\t\t}\n\t\t\tp_cAi += p_cA1*p_cA2 ;\n\t\t}\n\t\tdouble p_cBi = 1.0 ;\n\t\tfor (int i = 0; i < mu_B.size(); i++)\n\t\t\tp_cBi *= 0.5*erfc((x[k]-(c_B0-c_A0)-mu_B[i])\/(sig_B[i]*sqrt(2))) ;\n\t\tpImprove += (p_cAi)*(1-p_cBi)*dx ;\n\t}\n\treturn pImprove;\n}\n\nint main()\n{\n\t\n\trandom_device generator ;\n\t\n\tuniform_real_distribution<double> mu_dist(0.0,10.0) ;\n\tuniform_real_distribution<double> sig_dist(0.0,10.0) ;\n\t\n\tvector<double> mu_A ;\n\tvector<double> sig_A ;\n\n\tint m = 3 ;\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tmu_A.push_back(mu_dist(generator)) ;\n\t\tsig_A.push_back(sig_dist(generator)) ;\n\t}\n\n\tvector<double> mu_B ;\n\tvector<double> sig_B ;\n\t\n\tint n = 10 ;\n\tfor (int i = 0; i < n; i++)\n\t{\n\t\tmu_B.push_back(mu_dist(generator)) ;\n\t\tsig_B.push_back(sig_dist(generator)) ;\n\t}\n\t\n\tdouble c_A0 = mu_dist(generator) ;\n\tdouble c_B0 = mu_dist(generator) ;\n\n\tclock_t t_fun ;\n\tt_fun = clock() ;\n\tdouble pImprove = ComputeImprovementProbability(c_A0,c_B0,mu_A,sig_A,mu_B,sig_B) ;\n\tt_fun = clock() - t_fun ;\n\n\tcout << \"Probability of improvement: \" << pImprove << endl ;\n\tcout << \"Tics elapsed: \" << t_fun << \", \" << ((float)t_fun)\/CLOCKS_PER_SEC << \"s\" << endl ;\n\n\tn = 100000 ;\n\tvector<double> A_cost(n,c_A0) ;\n\tvector<double> B_cost(n,c_B0) ;\n\t\n\tdouble pBoverA = 0.0 ;\n\tclock_t t_MC ;\n\tt_MC = clock() ;\n\tfor (int k = 0; k < n; k++)\n\t{\n\t\tdouble best_A = DBL_MAX ;\n\t\tfor (int i = 0; i < mu_A.size(); i++)\n\t\t{\n\t\t\tnormal_distribution<double> distribution(mu_A[i],sig_A[i]) ;\n\t\t\tdouble c_Ai = distribution(generator) ;\n\t\t\t\tif (c_Ai < best_A)\n\t\t\t\t\tbest_A = c_Ai ;\n\t\t}\n\t\tA_cost[k] += best_A ;\n\n\t\tdouble best_B = DBL_MAX ;\n\t\tfor (int i = 0; i < mu_B.size(); i++)\n\t\t{\n\t\t\tnormal_distribution<double> distribution(mu_B[i],sig_B[i]) ;\n\t\t\tdouble c_Bi = distribution(generator) ;\n\t\t\t\tif (c_Bi < best_B)\n\t\t\t\t\tbest_B = c_Bi ;\n\t\t}\n\t\tB_cost[k] += best_B ;\n\n\t\tif (B_cost[k]<=A_cost[k])\n\t\t\tpBoverA++ ;\n\t}\n\tt_MC = clock() - t_MC ;\n\n\tdouble pBA = pBoverA\/n ;\n\tcout << \"Monte Carlo probability: \" << pBA << endl ;\n\tcout << \"Tics elapsed: \" << t_MC << \", \" << ((float)t_MC)\/CLOCKS_PER_SEC << \"s\" << endl ;\n\n\treturn 0 ;\n}\n<|endoftext|>"} {"text":"<commit_before>{%each args as cbArg %}\n {%if cbArg.isCallbackFunction %}\n\n{{ cbArg.returnType }} {{ cppClassName }}::{{ cppFunctionName }}_{{ cbArg.name }}_cppCallback (\n {% each cbArg.args|argsInfo as arg %}\n {{ arg.cType }} {{ arg.name}}{% if not arg.lastArg %},{% endif %}\n {% endeach %}\n) {\n {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = new {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton();\n\n {% each cbArg.args|argsInfo as arg %}\n baton->{{ arg.name }} = {{ arg.name }};\n {% endeach %}\n\n baton->req.data = baton;\n baton->done = false;\n\n uv_queue_work(uv_default_loop(), &baton->req, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncAfter);\n\n while(!baton->done) {\n this_thread::sleep_for(chrono::milliseconds(1));\n }\n\n {% each cbArg|returnsInfo true false as _return %}\n *{{ _return.name }} = *baton->{{ _return.name }};\n {% endeach %}\n\n return baton->result;\n}\n\nvoid {{ cppClassName }}::{{ function.cppFunctionName }}_{{ cbArg.name }}_asyncWork(uv_work_t* req) {\n \/\/ We aren't doing any work on a seperate thread, just need to\n \/\/ access the main node thread in the async after method.\n \/\/ However, this worker method is still needed\n}\n\nvoid {{ cppClassName }}::{{ function.cppFunctionName }}_{{ cbArg.name }}_asyncAfter(uv_work_t* req, int status) {\n NanScope();\n\n {{ function.cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = static_cast<{{ function.cppFunctionName }}_{{ cbArg.name|titleCase }}Baton*>(req->data);\n {{ cppClassName }}* instance = static_cast<{{ cppClassName }}*>(baton->payload);\n\n if (instance->{{ cbArg.name }}->IsEmpty()) {\n {% if cbArg.returnType == \"int\" %}\n baton->result = {{ cbArg.returnNoResults }}; \/\/ no results acquired\n {% endif %}\n\n baton->done = true;\n return;\n }\n\n CallbackWrapper* cbWrapper = baton->payload;\n\n Local<Value> argv[{{ cbArg.args|jsArgsCount }}] = {\n {% each cbArg.args|argsInfo as arg %}\n {% if arg.name == \"payload\" %}\n {%-- payload is always the last arg --%}\n NanNew(cbWrapper->payload)\n {% elsif arg.isJsArg %}\n {% if arg.isEnum %}\n NanNew((int)baton->{{ arg.name }}),\n {% elsif arg.isLibgitType %}\n NanNew({{ arg.cppClassName }}::New(&baton->{{ arg.name }}, false)),\n {% elsif arg.cType == \"size_t\" %}\n \/\/ HACK: NAN should really have an overload for NanNew to support size_t\n NanNew((unsigned int)baton->{{ arg.name }}),\n {% else %}\n NanNew(baton->{{ arg.name }}),\n {% endif %}\n {% endif %}\n {% endeach %}\n };\n\n TryCatch tryCatch;\n Handle<Value> result = cbWrapper->jsFunction->Call({{ cbArg.args|jsArgsCount }}, argv);\n\n if (result->IsObject() && result->ToObject()->Has(NanNew(\"then\"))) {\n Handle<Value> thenProp = result->ToObject()->Get(NanNew(\"then\"));\n\n if (thenProp->IsFunction()) {\n \/\/ we can be reasonbly certain that the result is a promise\n Local<Object> promise = result->ToObject();\n\n NanAssignPersistent(baton->promise, promise);\n\n uv_queue_work(uv_default_loop(), &baton->req, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling);\n return;\n }\n }\n\n {{ cbArg.returnType }} resultStatus;\n\n {% each cbArg|returnsInfo true false as _return %}\n if (result.IsEmpty() || result->IsNativeError()) {\n baton->result = {{ cbArg.returnError }};\n }\n else if (!result->IsNull() && !result->IsUndefined()) {\n {{ _return.cppClassName }}* wrapper = ObjectWrap::Unwrap<{{ _return.cppClassName }}>(result->ToObject());\n wrapper->selfFreeing = false;\n\n baton->{{ _return.name }} = wrapper->GetRefValue();\n baton->result = {{ cbArg.returnSuccess }};\n }\n else {\n baton->result = {{ cbArg.returnNoResults }};\n }\n {% endeach %}\n baton->done = true;\n}\n\nvoid {{ cppClassName }}::{{ function.cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling(uv_work_t* req, int status) {\n NanScope();\n\n {{ function.cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = static_cast<{{ function.cppFunctionName }}_{{ cbArg.name|titleCase }}Baton*>(req->data);\n Local<Object> promise = NanNew<Object>(baton->promise);\n NanCallback* isPendingFn = new NanCallback(promise->Get(NanNew(\"isPending\")).As<Function>());\n Local<Value> argv[1]; \/\/ MSBUILD won't assign an array of length 0\n Local<Boolean> isPending = isPendingFn->Call(0, argv)->ToBoolean();\n\n if (isPending->Value()) {\n uv_queue_work(uv_default_loop(), &baton->req, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ function.cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling);\n return;\n }\n\n NanCallback* isFulfilledFn = new NanCallback(promise->Get(NanNew(\"isFulfilled\")).As<Function>());\n Local<Boolean> isFulfilled = isFulfilledFn->Call(0, argv)->ToBoolean();\n\n if (isFulfilled->Value()) {\n NanCallback* resultFn = new NanCallback(promise->Get(NanNew(\"value\")).As<Function>());\n Handle<Value> result = resultFn->Call(0, argv);\n {{ cbArg.returnType }} resultStatus;\n\n {% each cbArg|returnsInfo true false as _return %}\n if (result.IsEmpty() || result->IsNativeError()) {\n baton->result = {{ cbArg.returnError }};\n }\n else if (!result->IsNull() && !result->IsUndefined()) {\n {{ _return.cppClassName }}* wrapper = ObjectWrap::Unwrap<{{ _return.cppClassName }}>(result->ToObject());\n wrapper->selfFreeing = false;\n\n baton->{{ _return.name }} = wrapper->GetRefValue();\n baton->result = {{ cbArg.returnSuccess }};\n }\n else {\n baton->result = {{ cbArg.returnNoResults }};\n }\n {% endeach %}\n baton->done = true;\n }\n else {\n \/\/ promise was rejected\n baton->result = {{ cbArg.returnError }};\n baton->done = false;\n }\n}\n {%endif%}\n{%endeach%}\n<commit_msg>Fixed error in callback_helpers.cc<commit_after>{%each args as cbArg %}\n {%if cbArg.isCallbackFunction %}\n\n{{ cbArg.returnType }} {{ cppClassName }}::{{ cppFunctionName }}_{{ cbArg.name }}_cppCallback (\n {% each cbArg.args|argsInfo as arg %}\n {{ arg.cType }} {{ arg.name}}{% if not arg.lastArg %},{% endif %}\n {% endeach %}\n) {\n {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = new {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton();\n\n {% each cbArg.args|argsInfo as arg %}\n baton->{{ arg.name }} = {{ arg.name }};\n {% endeach %}\n\n baton->req.data = baton;\n baton->done = false;\n\n uv_queue_work(uv_default_loop(), &baton->req, {{ cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ cppFunctionName }}_{{ cbArg.name }}_asyncAfter);\n\n while(!baton->done) {\n this_thread::sleep_for(chrono::milliseconds(1));\n }\n\n {% each cbArg|returnsInfo true false as _return %}\n *{{ _return.name }} = *baton->{{ _return.name }};\n {% endeach %}\n\n return baton->result;\n}\n\nvoid {{ cppClassName }}::{{ cppFunctionName }}_{{ cbArg.name }}_asyncWork(uv_work_t* req) {\n \/\/ We aren't doing any work on a seperate thread, just need to\n \/\/ access the main node thread in the async after method.\n \/\/ However, this worker method is still needed\n}\n\nvoid {{ cppClassName }}::{{ cppFunctionName }}_{{ cbArg.name }}_asyncAfter(uv_work_t* req, int status) {\n NanScope();\n\n {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = static_cast<{{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton*>(req->data);\n {{ cppClassName }}* instance = static_cast<{{ cppClassName }}*>(baton->payload);\n\n if (instance->{{ cbArg.name }}->IsEmpty()) {\n {% if cbArg.returnType == \"int\" %}\n baton->result = {{ cbArg.returnNoResults }}; \/\/ no results acquired\n {% endif %}\n\n baton->done = true;\n return;\n }\n\n CallbackWrapper* cbWrapper = baton->payload;\n\n Local<Value> argv[{{ cbArg.args|jsArgsCount }}] = {\n {% each cbArg.args|argsInfo as arg %}\n {% if arg.name == \"payload\" %}\n {%-- payload is always the last arg --%}\n NanNew(cbWrapper->payload)\n {% elsif arg.isJsArg %}\n {% if arg.isEnum %}\n NanNew((int)baton->{{ arg.name }}),\n {% elsif arg.isLibgitType %}\n NanNew({{ arg.cppClassName }}::New(&baton->{{ arg.name }}, false)),\n {% elsif arg.cType == \"size_t\" %}\n \/\/ HACK: NAN should really have an overload for NanNew to support size_t\n NanNew((unsigned int)baton->{{ arg.name }}),\n {% else %}\n NanNew(baton->{{ arg.name }}),\n {% endif %}\n {% endif %}\n {% endeach %}\n };\n\n TryCatch tryCatch;\n Handle<Value> result = cbWrapper->jsFunction->Call({{ cbArg.args|jsArgsCount }}, argv);\n\n if (result->IsObject() && result->ToObject()->Has(NanNew(\"then\"))) {\n Handle<Value> thenProp = result->ToObject()->Get(NanNew(\"then\"));\n\n if (thenProp->IsFunction()) {\n \/\/ we can be reasonbly certain that the result is a promise\n Local<Object> promise = result->ToObject();\n\n NanAssignPersistent(baton->promise, promise);\n\n uv_queue_work(uv_default_loop(), &baton->req, {{ cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling);\n return;\n }\n }\n\n {{ cbArg.returnType }} resultStatus;\n\n {% each cbArg|returnsInfo true false as _return %}\n if (result.IsEmpty() || result->IsNativeError()) {\n baton->result = {{ cbArg.returnError }};\n }\n else if (!result->IsNull() && !result->IsUndefined()) {\n {{ _return.cppClassName }}* wrapper = ObjectWrap::Unwrap<{{ _return.cppClassName }}>(result->ToObject());\n wrapper->selfFreeing = false;\n\n baton->{{ _return.name }} = wrapper->GetRefValue();\n baton->result = {{ cbArg.returnSuccess }};\n }\n else {\n baton->result = {{ cbArg.returnNoResults }};\n }\n {% endeach %}\n baton->done = true;\n}\n\nvoid {{ cppClassName }}::{{ cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling(uv_work_t* req, int status) {\n NanScope();\n\n {{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton* baton = static_cast<{{ cppFunctionName }}_{{ cbArg.name|titleCase }}Baton*>(req->data);\n Local<Object> promise = NanNew<Object>(baton->promise);\n NanCallback* isPendingFn = new NanCallback(promise->Get(NanNew(\"isPending\")).As<Function>());\n Local<Value> argv[1]; \/\/ MSBUILD won't assign an array of length 0\n Local<Boolean> isPending = isPendingFn->Call(0, argv)->ToBoolean();\n\n if (isPending->Value()) {\n uv_queue_work(uv_default_loop(), &baton->req, {{ cppFunctionName }}_{{ cbArg.name }}_asyncWork, {{ cppFunctionName }}_{{ cbArg.name }}_asyncPromisePolling);\n return;\n }\n\n NanCallback* isFulfilledFn = new NanCallback(promise->Get(NanNew(\"isFulfilled\")).As<Function>());\n Local<Boolean> isFulfilled = isFulfilledFn->Call(0, argv)->ToBoolean();\n\n if (isFulfilled->Value()) {\n NanCallback* resultFn = new NanCallback(promise->Get(NanNew(\"value\")).As<Function>());\n Handle<Value> result = resultFn->Call(0, argv);\n {{ cbArg.returnType }} resultStatus;\n\n {% each cbArg|returnsInfo true false as _return %}\n if (result.IsEmpty() || result->IsNativeError()) {\n baton->result = {{ cbArg.returnError }};\n }\n else if (!result->IsNull() && !result->IsUndefined()) {\n {{ _return.cppClassName }}* wrapper = ObjectWrap::Unwrap<{{ _return.cppClassName }}>(result->ToObject());\n wrapper->selfFreeing = false;\n\n baton->{{ _return.name }} = wrapper->GetRefValue();\n baton->result = {{ cbArg.returnSuccess }};\n }\n else {\n baton->result = {{ cbArg.returnNoResults }};\n }\n {% endeach %}\n baton->done = true;\n }\n else {\n \/\/ promise was rejected\n baton->result = {{ cbArg.returnError }};\n baton->done = false;\n }\n}\n {%endif%}\n{%endeach%}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Graph2Benchmark.cpp\n *\n * Created on: 05.02.2013\n * Author: Christian Staudt (christian.staudt@kit.edu)\n *\/\n\n#ifndef NOGTEST\n\n#include \"Graph2Benchmark.h\"\n\nnamespace NetworKit {\n\nGraph2Benchmark::Graph2Benchmark() {\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nGraph2Benchmark::~Graph2Benchmark() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nTEST_F(Graph2Benchmark, graphConstruction) {\n\tcount n = 1e+7;;\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tGraph G(n);\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\n\nTEST_F(Graph2Benchmark, nodeIteration) {\n\tcount n = 1e+7;;\n\tGraph G(n);\n\n\n\tstd::vector<node> nodes(n, 0);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodes([&](node v){\n\t\tnodes[v] = v;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\nTEST_F(Graph2Benchmark, parallelNodeIteration) {\n\tcount n = 1e+7;;\n\tGraph G(n);\n\n\n\tstd::vector<node> nodes(n, 0);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.parallelForNodes([&](node v){\n\t\tnodes[v] = v;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\n\nTEST_F(Graph2Benchmark, nodePairIteration) {\n\tcount n = 1e+4;;\n\tGraph G(n);\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tcount p = 0;\n\tG.forNodePairs([&](node u, node v){\n\t\tp += 1;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n\tEXPECT_EQ((n * (n-1)) \/ 2, p);\n}\n\n\nTEST_F(Graph2Benchmark, edgeInsertion) {\n\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\n\nTEST_F(Graph2Benchmark, edgeRemoval) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodePairs([&](node u, node v){\n\t\tG.removeEdge(u, v);\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\n\nTEST_F(Graph2Benchmark, edgeIteration) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forEdges([&](node u, node v){\n\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\nTEST_F(Graph2Benchmark, parallelEdgeIteration) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tcount i = 0;\n\tG.parallelForEdges([&](node u, node v){\n\t\ti += 1;\n\t});\n\n\tEXPECT_TRUE(true) << \"just iterate\";\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\nTEST_F(Graph2Benchmark, parallelSumForNodes) {\n\tcount n = 1e+7;\n\tGraph G(n);\n\n\tdouble sum = G.parallelSumForNodes([&](node v) {\n\t\treturn 1;\n\t});\n\n\tEXPECT_EQ(n, sum) << \"each node adds 1\";\n\n}\n\n\n\nTEST_F(Graph2Benchmark, nodeInsertion) {\n\tcount n = 1e+4;\n\n\tGraph G(0); \/\/ empty graph\n\n\tfor (count i = 0; i < n; ++i) {\n\t\tnode v = G.addNode();\n\t}\n\n\tEXPECT_TRUE(n, G.numberOfNodes()) << \"n nodes should have been added\";\n}\n\nTEST_F(Graph2Benchmark, nodeRemoval) {\n\tcount n = 1e+4;\n\n\tGraph G(n); \/\/ empty graph\n\n\tfor (node u = 0; u < n; ++u) {\n\t\tG.removeNode(u);\n\t}\n\n\tEXPECT_TRUE(0, G.numberOfNodes()) << \"no nodes should be left\";\n}\n\n} \/* namespace NetworKit *\/\n\n#endif \/*NOGTEST *\/\n<commit_msg>completed benchmarks<commit_after>\/*\n * Graph2Benchmark.cpp\n *\n * Created on: 05.02.2013\n * Author: Christian Staudt (christian.staudt@kit.edu)\n *\/\n\n#ifndef NOGTEST\n\n#include \"Graph2Benchmark.h\"\n\nnamespace NetworKit {\n\nGraph2Benchmark::Graph2Benchmark() {\n\t\/\/ TODO Auto-generated constructor stub\n\n}\n\nGraph2Benchmark::~Graph2Benchmark() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nTEST_F(Graph2Benchmark, graphConstruction) {\n\tcount n = 1e+7;;\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tGraph G(n);\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\n\nTEST_F(Graph2Benchmark, nodeIteration) {\n\tcount n = 1e+7;;\n\tGraph G(n);\n\n\n\tstd::vector<node> nodes(n, 0);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodes([&](node v){\n\t\tnodes[v] = v;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\nTEST_F(Graph2Benchmark, parallelNodeIteration) {\n\tcount n = 1e+7;;\n\tGraph G(n);\n\n\n\tstd::vector<node> nodes(n, 0);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.parallelForNodes([&](node v){\n\t\tnodes[v] = v;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\n\nTEST_F(Graph2Benchmark, nodePairIteration) {\n\tcount n = 1e+4;;\n\tGraph G(n);\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tcount p = 0;\n\tG.forNodePairs([&](node u, node v){\n\t\tp += 1;\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n\tEXPECT_EQ((n * (n-1)) \/ 2, p);\n}\n\n\nTEST_F(Graph2Benchmark, edgeInsertion) {\n\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\n\nTEST_F(Graph2Benchmark, edgeRemoval) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forNodePairs([&](node u, node v){\n\t\tG.removeEdge(u, v);\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n\n}\n\n\nTEST_F(Graph2Benchmark, edgeIteration) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tG.forEdges([&](node u, node v){\n\n\t});\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\nTEST_F(Graph2Benchmark, parallelEdgeIteration) {\n\tcount n = 1e+4;\n\tGraph G(n);\n\n\t\/\/ insert edges\n\tG.forNodePairs([&](node u, node v){\n\t\tG.addEdge(u, v);\n\t});\n\n\tAux::Timer run;\n\tINFO(\"[BEGIN] (n=\" << n << \")\");\n\trun.start();\n\n\tcount i = 0;\n\tG.parallelForEdges([&](node u, node v){\n\t\ti += 1;\n\t});\n\n\tEXPECT_TRUE(true) << \"just iterate\";\n\n\trun.stop();\n\tINFO(\"[DONE]\" << run.elapsedTag());\n}\n\nTEST_F(Graph2Benchmark, parallelSumForNodes) {\n\tcount n = 1e+7;\n\tGraph G(n);\n\n\tdouble sum = G.parallelSumForNodes([&](node v) {\n\t\treturn 1;\n\t});\n\n\tEXPECT_EQ(n, sum) << \"each node adds 1\";\n\n}\n\n\n\nTEST_F(Graph2Benchmark, nodeInsertion) {\n\tcount n = 1e+4;\n\n\tGraph G(0); \/\/ empty graph\n\n\tfor (count i = 0; i < n; ++i) {\n\t\tnode v = G.addNode();\n\t}\n\n\tEXPECT_EQ(n, G.numberOfNodes()) << \"n nodes should have been added\";\n}\n\nTEST_F(Graph2Benchmark, nodeRemoval) {\n\tcount n = 1e+4;\n\n\tGraph G(n); \/\/ empty graph\n\n\tfor (node u = 0; u < n; ++u) {\n\t\tG.removeNode(u);\n\t}\n\n\tEXPECT_EQ(0, G.numberOfNodes()) << \"no nodes should be left\";\n}\n\n} \/* namespace NetworKit *\/\n\n#endif \/*NOGTEST *\/\n<|endoftext|>"} {"text":"<commit_before>\n#include \"CommandParser.cpp\"\n#include \"Configurations.h\"\n#include \"Utils.cpp\"\n\nnamespace L10ns {\n\ninline void printDefaultHelp() {\n auto w = new TextWriter();\n w->addTab(2);\n w->addTab(10);\n w->writeLine(\"Usage: l10ns <command> [<options>]\");\n w->newline();\n w->writeLine(\"Commands:\");\n for (const auto& action : actions) {\n w->writeLine(*action.name + \" \" + *action.description);\n }\n w->print();\n}\n\ninline void printActionHelp(ActionKind action) {\n\n}\n\ninline void printCommandHelp(Command * command) {\n if (command->action == ActionKind::None) {\n printDefaultHelp();\n }\n else {\n printActionHelp(command->action);\n }\n}\n\nint init(int argc, char * argv[]) {\n auto command = parseCommandArguments(argc, argv);\n if (command->isRequestingVersion) {\n println(\"L10ns version \", VERSION, \".\");\n }\n else if (command->isRequestingHelp) {\n printCommandHelp(command);\n }\n return 0;\n}\n\n} \/\/ L10ns\n<commit_msg>Adds print default help<commit_after>\n#include \"CommandParser.cpp\"\n#include \"Configurations.h\"\n#include \"Utils.cpp\"\n\nnamespace L10ns {\n\ninline void printDefaultHelp() {\n auto w = new TextWriter();\n w->addTab(2);\n w->addTab(12);\n w->writeLine(\"Usage: l10ns [<options>] <command>\");\n w->newline();\n w->writeLine(\"Commands:\");\n w->newline();\n for (const auto& action : actions) {\n w->tab();\n w->write(*action.name);\n w->tab();\n w->writeLine(*action.description);\n }\n w->newline();\n w->writeLine(\"For more details: 'l10ns <command> --help'.\");\n w->newline();\n w->clearTabs();\n w->addTab(2);\n w->addTab(17);\n w->writeLine(\"Options:\");\n w->newline();\n for (const auto& flag : defaultFlags) {\n w->tab();\n if (flag.alias->length() != 0) {\n w->write(*flag.name + \", \" + *flag.alias);\n }\n else {\n w->write(*flag.name);\n }\n w->tab();\n w->writeLine(*flag.description);\n }\n w->print();\n}\n\ninline void printActionHelp(ActionKind action) {\n\n}\n\ninline void printCommandHelp(Command * command) {\n if (command->action == ActionKind::None) {\n printDefaultHelp();\n }\n else {\n printActionHelp(command->action);\n }\n}\n\nint init(int argc, char * argv[]) {\n auto command = parseCommandArguments(argc, argv);\n if (command->isRequestingVersion) {\n println(\"L10ns version \", VERSION, \".\");\n }\n else if (command->isRequestingHelp) {\n printCommandHelp(command);\n }\n return 0;\n}\n\n} \/\/ L10ns\n<|endoftext|>"} {"text":"<commit_before>\/\/ Quadric-based mesh decimation\n\n#include <geode\/mesh\/decimate.h>\n#include <geode\/python\/wrap.h>\n#include <geode\/structure\/Heap.h>\n#include <geode\/vector\/SymmetricMatrix.h>\nnamespace geode {\n\ntypedef real T;\ntypedef Vector<T,3> TV;\n\nnamespace {\n\/\/ Binary heap of potential collapses\nstruct Heap : public HeapBase<Heap>, public Noncopyable {\n typedef HeapBase<Heap> Base;\n Array<Tuple<VertexId,T,VertexId>> heap; \/\/ src,badness,dst\n Field<int,VertexId> inv_heap;\n\n Heap(const int nv)\n : inv_heap(nv,uninit) {\n inv_heap.flat.fill(-1);\n }\n\n int size() const {\n return heap.size();\n }\n\n bool first(const int i, const int j) const {\n return heap[i].y <= heap[j].y;\n }\n\n void swap(const int i, const int j) {\n std::swap(heap[i],heap[j]);\n inv_heap[heap[i].x] = i;\n inv_heap[heap[j].x] = j;\n }\n\n Vector<VertexId,2> pop() {\n const auto e = heap[0];\n inv_heap[e.x] = -1;\n const auto p = heap.pop();\n if (size()) {\n heap[0] = p;\n inv_heap[heap[0].x] = 0;\n Base::move_downward(0);\n }\n return vec(e.x,e.z);\n }\n\n void set(const VertexId v, const T q, const VertexId dst) {\n const auto entry = tuple(v,q,dst);\n int i = inv_heap[v];\n if (i < 0)\n i = heap.append(entry);\n else\n heap[i] = entry;\n Base::move_up_or_down(i);\n }\n\n void erase(const VertexId v) {\n int& i = inv_heap[v];\n if (i >= 0) {\n const auto p = heap.pop();\n if (i < size()) {\n heap[i] = p;\n inv_heap[p.x] = i;\n Base::move_up_or_down(i);\n }\n i = -1;\n }\n }\n};\n}\n\nvoid decimate_inplace(MutableTriangleTopology& mesh, RawField<TV,VertexId> X,\n const T distance, const T max_angle, const int min_vertices, const T boundary_distance) {\n if (mesh.n_vertices() <= min_vertices)\n return;\n const T area = sqr(distance);\n const T sign_sqr_min_cos = sign_sqr(max_angle > .99*pi ? -1 : cos(max_angle));\n\n \/\/ Finds the best edge to collapse v along. Returns (q(e),dst(e)).\n const auto best_collapse = [&mesh,X](const VertexId v) {\n \/\/ The quadric around this version will be (x'Ax-b'x+c)\/total\n T total = 0;\n SymmetricMatrix<T,3> A;\n TV b;\n T c = 0;\n for (const auto e : mesh.outgoing(v))\n if (!mesh.is_boundary(e)) {\n const auto f = mesh.face(e);\n const auto v = mesh.vertices(f);\n const auto p = X[v.x],\n n = cross(X[v.y]-p,X[v.z]-p);\n const T w = magnitude(n);\n if (w) {\n total += w;\n \/\/ u = n\/w\n \/\/ q(x) = w(u'(x-p))^2\n \/\/ = w(u'x-u'p)^2\n \/\/ = w(x'uu'x-2(pu'u)'x+(u'p)^2)\n \/\/ = x'(nn'\/w)x-2(pn'n\/w)+(n'p)^2\/w\n const T inv_w = 1\/w,\n pn = dot(p,n);\n A += scaled_outer_product(inv_w,n);\n b += inv_w*pn*n; \/\/ We'll multiply by 2 below\n c += inv_w*sqr(pn);\n }\n }\n \/\/ Normalize\n if (total) {\n const T inv_total = 1\/total;\n A *= inv_total;\n b *= 2*inv_total;\n c *= inv_total;\n }\n\n \/\/ Find the best edge, ignoring normal constraints\n T min_q = inf;\n HalfedgeId min_e;\n for (const auto e : mesh.outgoing(v)) {\n const auto x = X[mesh.dst(e)];\n const T q = dot(x,A*x-b); \/\/ We'll add c below, specifically...\n if (min_q > q) {\n min_q = q;\n min_e = e;\n }\n }\n return tuple(min_q+c,mesh.dst(min_e)); \/\/ ...here\n };\n\n \/\/ Is it safe to collapse src(e) into dst(e)?\n const auto normal_safe = [&mesh,X,sign_sqr_min_cos](const HalfedgeId e) {\n if (sign_sqr_min_cos == -1) \/\/ If anything is allowed, there's nothing to do\n return true;\n const auto src = mesh.src(e),\n dst = mesh.dst(e);\n const auto xs = X[src],\n xd = X[dst];\n for (const auto ee : mesh.outgoing(src))\n if (e!=ee && !mesh.is_boundary(ee)) {\n const auto v2 = mesh.opposite(ee);\n if (v2 != dst) {\n const auto x1 = X[mesh.dst(ee)],\n x2 = X[v2];\n const auto n0 = cross(x2-x1,xs-x1),\n n1 = cross(x2-x1,xd-x1);\n if (sign_sqr(dot(n0,n1)) < sign_sqr_min_cos*sqr_magnitude(n0)*sqr_magnitude(n1))\n return false;\n }\n }\n return true;\n };\n\n \/\/ Initialize quadrics and heap\n Heap heap(mesh.n_vertices_);\n for (const auto v : mesh.vertices()) {\n const auto qe = best_collapse(v);\n if (qe.x <= area)\n heap.inv_heap[v] = heap.heap.append(tuple(v,qe.x,qe.y));\n }\n heap.make();\n\n \/\/ Update the quadric information for a vertex\n const auto update = [&heap,best_collapse,area](const VertexId v) {\n const auto qe = best_collapse(v);\n if (qe.x <= area)\n heap.set(v,qe.x,qe.y);\n else\n heap.erase(v);\n };\n\n \/\/ Repeatedly collapse the best vertex\n while (heap.size()) {\n const auto v = heap.pop();\n\n \/\/ Do these vertices still exist?\n if (mesh.valid(v.x) && mesh.valid(v.y)) {\n const auto e = mesh.halfedge(v.x,v.y);\n\n \/\/ Is the collapse invalid?\n if (e.valid() && mesh.is_collapse_safe(e)) {\n const auto vs = mesh.src(e),\n vd = mesh.dst(e);\n const auto xs = X[vs],\n xd = X[vd];\n\n \/\/ Are we moving a boundary vertex too far from its two boundary lines?\n {\n const auto b = mesh.halfedge(vs);\n if (mesh.is_boundary(b)) {\n const auto x0 = X[mesh.dst(b)],\n x1 = X[mesh.src(mesh.prev(b))];\n if ( line_point_distance(simplex(xs,x0),xd) > boundary_distance\n || line_point_distance(simplex(xs,x1),xd) > boundary_distance)\n goto bad;\n }\n }\n\n \/\/ Do the normals change too much?\n if (sign_sqr_min_cos > -1)\n for (const auto ee : mesh.outgoing(vs))\n if (e!=ee && !mesh.is_boundary(ee)) {\n const auto v2 = mesh.opposite(ee);\n if (v2 != vd) {\n const auto x1 = X[mesh.dst(ee)],\n x2 = X[v2];\n const auto n0 = cross(x2-x1,xs-x1), \n n1 = cross(x2-x1,xd-x1); \n if (sign_sqr(dot(n0,n1)) < sign_sqr_min_cos*sqr_magnitude(n0)*sqr_magnitude(n1))\n goto bad;\n }\n }\n\n \/\/ Collapse vs onto vd, then update the heap\n mesh.unsafe_collapse(e);\n if (mesh.n_vertices() <= min_vertices)\n break;\n update(vd);\n for (const auto e : mesh.outgoing(vd))\n update(mesh.dst(e));\n }\n }\n bad:;\n }\n}\n\nTuple<Ref<const TriangleTopology>,Field<const TV,VertexId>>\ndecimate(const TriangleTopology& mesh, RawField<const TV,VertexId> X,\n const T distance, const T max_angle, const int min_vertices, const T boundary_distance) {\n const auto rmesh = mesh.mutate();\n const auto rX = X.copy();\n decimate_inplace(rmesh,rX,distance,max_angle,min_vertices,boundary_distance);\n return Tuple<Ref<const TriangleTopology>,Field<const TV,VertexId>>(rmesh,rX);\n}\n\n}\nusing namespace geode;\n\nvoid wrap_decimate() {\n GEODE_FUNCTION(decimate)\n GEODE_FUNCTION(decimate_inplace)\n}\n<commit_msg>pull quadrics out to separate class<commit_after>\/\/ Quadric-based mesh decimation\n\n#include <geode\/mesh\/decimate.h>\n#include <geode\/python\/wrap.h>\n#include <geode\/structure\/Heap.h>\n#include <geode\/mesh\/quadric.h>\n\nnamespace geode {\n\ntypedef real T;\ntypedef Vector<T,3> TV;\n\nnamespace {\n\/\/ Binary heap of potential collapses\nstruct Heap : public HeapBase<Heap>, public Noncopyable {\n typedef HeapBase<Heap> Base;\n Array<Tuple<VertexId,T,VertexId>> heap; \/\/ src,badness,dst\n Field<int,VertexId> inv_heap;\n\n Heap(const int nv)\n : inv_heap(nv,uninit) {\n inv_heap.flat.fill(-1);\n }\n\n int size() const {\n return heap.size();\n }\n\n bool first(const int i, const int j) const {\n return heap[i].y <= heap[j].y;\n }\n\n void swap(const int i, const int j) {\n std::swap(heap[i],heap[j]);\n inv_heap[heap[i].x] = i;\n inv_heap[heap[j].x] = j;\n }\n\n Vector<VertexId,2> pop() {\n const auto e = heap[0];\n inv_heap[e.x] = -1;\n const auto p = heap.pop();\n if (size()) {\n heap[0] = p;\n inv_heap[heap[0].x] = 0;\n Base::move_downward(0);\n }\n return vec(e.x,e.z);\n }\n\n void set(const VertexId v, const T q, const VertexId dst) {\n const auto entry = tuple(v,q,dst);\n int i = inv_heap[v];\n if (i < 0)\n i = heap.append(entry);\n else\n heap[i] = entry;\n Base::move_up_or_down(i);\n }\n\n void erase(const VertexId v) {\n int& i = inv_heap[v];\n if (i >= 0) {\n const auto p = heap.pop();\n if (i < size()) {\n heap[i] = p;\n inv_heap[p.x] = i;\n Base::move_up_or_down(i);\n }\n i = -1;\n }\n }\n};\n}\n\nvoid decimate_inplace(MutableTriangleTopology& mesh, RawField<TV,VertexId> X,\n const T distance, const T max_angle, const int min_vertices, const T boundary_distance) {\n if (mesh.n_vertices() <= min_vertices)\n return;\n const T area = sqr(distance);\n const T sign_sqr_min_cos = sign_sqr(max_angle > .99*pi ? -1 : cos(max_angle));\n\n \/\/ Finds the best edge to collapse v along. Returns (q(e),dst(e)).\n const auto best_collapse = [&mesh,X](const VertexId v) {\n Quadric q = compute_quadric(mesh,X,v);\n\n \/\/ Find the best edge, ignoring normal constraints\n T min_q = inf;\n HalfedgeId min_e;\n for (const auto e : mesh.outgoing(v)) {\n const T qx = q(X[mesh.dst(e)]);\n if (min_q > qx) {\n min_q = qx;\n min_e = e;\n }\n }\n return tuple(min_q,mesh.dst(min_e));\n };\n\n \/\/ Initialize quadrics and heap\n Heap heap(mesh.n_vertices_);\n for (const auto v : mesh.vertices()) {\n const auto qe = best_collapse(v);\n if (qe.x <= area)\n heap.inv_heap[v] = heap.heap.append(tuple(v,qe.x,qe.y));\n }\n heap.make();\n\n \/\/ Update the quadric information for a vertex\n const auto update = [&heap,best_collapse,area](const VertexId v) {\n const auto qe = best_collapse(v);\n if (qe.x <= area)\n heap.set(v,qe.x,qe.y);\n else\n heap.erase(v);\n };\n\n \/\/ Repeatedly collapse the best vertex\n while (heap.size()) {\n const auto v = heap.pop();\n\n \/\/ Do these vertices still exist?\n if (mesh.valid(v.x) && mesh.valid(v.y)) {\n const auto e = mesh.halfedge(v.x,v.y);\n\n \/\/ Is the collapse invalid?\n if (e.valid() && mesh.is_collapse_safe(e)) {\n const auto vs = mesh.src(e),\n vd = mesh.dst(e);\n const auto xs = X[vs],\n xd = X[vd];\n\n \/\/ Are we moving a boundary vertex too far from its two boundary lines?\n {\n const auto b = mesh.halfedge(vs);\n if (mesh.is_boundary(b)) {\n const auto x0 = X[mesh.dst(b)],\n x1 = X[mesh.src(mesh.prev(b))];\n if ( line_point_distance(simplex(xs,x0),xd) > boundary_distance\n || line_point_distance(simplex(xs,x1),xd) > boundary_distance)\n goto bad;\n }\n }\n\n \/\/ Do the normals change too much?\n if (sign_sqr_min_cos > -1)\n for (const auto ee : mesh.outgoing(vs))\n if (e!=ee && !mesh.is_boundary(ee)) {\n const auto v2 = mesh.opposite(ee);\n if (v2 != vd) {\n const auto x1 = X[mesh.dst(ee)],\n x2 = X[v2];\n const auto n0 = cross(x2-x1,xs-x1),\n n1 = cross(x2-x1,xd-x1);\n if (sign_sqr(dot(n0,n1)) < sign_sqr_min_cos*sqr_magnitude(n0)*sqr_magnitude(n1))\n goto bad;\n }\n }\n\n \/\/ Collapse vs onto vd, then update the heap\n mesh.unsafe_collapse(e);\n if (mesh.n_vertices() <= min_vertices)\n break;\n update(vd);\n for (const auto e : mesh.outgoing(vd))\n update(mesh.dst(e));\n }\n }\n bad:;\n }\n}\n\nTuple<Ref<const TriangleTopology>,Field<const TV,VertexId>>\ndecimate(const TriangleTopology& mesh, RawField<const TV,VertexId> X,\n const T distance, const T max_angle, const int min_vertices, const T boundary_distance) {\n const auto rmesh = mesh.mutate();\n const auto rX = X.copy();\n decimate_inplace(rmesh,rX,distance,max_angle,min_vertices,boundary_distance);\n return Tuple<Ref<const TriangleTopology>,Field<const TV,VertexId>>(rmesh,rX);\n}\n\n}\nusing namespace geode;\n\nvoid wrap_decimate() {\n GEODE_FUNCTION(decimate)\n GEODE_FUNCTION(decimate_inplace)\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tデジタル・マイク制御 (R5F100ECA) 40ピン @n\n\t\t\tROM: 32K, RAM: @n\n\t\t\tP15: green LED @n\n\t\t\tP16: red LED @n\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2017 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RL78\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/port_utils.hpp\"\n#include \"common\/fifo.hpp\"\n#include \"common\/uart_io.hpp\"\n#include \"common\/adc_io.hpp\"\n#include \"common\/format.hpp\"\n#include \"common\/iica_io.hpp\"\n#include \"common\/itimer.hpp\"\n#include \"common\/flash_io.hpp\"\n#include \"common\/command.hpp\"\n\n#include \"sw.hpp\"\n\nnamespace {\n\n\ttypedef device::itimer<uint8_t> ITM;\n\tITM\t\titm_;\n\n\t\/\/ UART1 の定義（SAU2、SAU3）\n\ttypedef utils::fifo<uint8_t, 64> BUFFER;\n\ttypedef device::uart_io<device::SAU00, device::SAU01, BUFFER, BUFFER> UART0;\n\ttypedef device::uart_io<device::SAU02, device::SAU03, BUFFER, BUFFER> UART1;\n\tUART0\tuart0_;\n\/\/\tUART1\tuart1_;\n\n\ttypedef device::iica_io<device::IICA0> IICA;\n\tIICA \tiica_;\n\n\t\/\/ 最終チャネル番号＋１を設定\n\ttypedef device::adc_io<1, utils::null_task> ADC;\n\tADC \tadc_;\n\n\ttypedef device::flash_io FLASH;\n\tFLASH\tflash_;\n\n\/\/\tutils::command<64> command_;\n\n\t\/\/ MIC 切り替え、入力定義\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B2> MIC_SW1;\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B1> MIC_SW2;\n\tutils::sw2<MIC_SW1, MIC_SW2> sw2_;\n\n\t\/\/ CH 設定、入力定義\n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B1> CH_SW1;\n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B0> CH_SW2;\n\ttypedef device::PORT<device::port_no::P0, device::bitpos::B1> CH_SW3;\n\ttypedef device::PORT<device::port_no::P0, device::bitpos::B0> CH_SW4;\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B0> CH_SW5;\n\tutils::sw5<CH_SW1, CH_SW2, CH_SW3, CH_SW4, CH_SW5> sw5_;\n\n\t\/\/ Volume +\/-\n\ttypedef device::PORT<device::port_no::P3, device::bitpos::B1> VOL_UP;\n\ttypedef device::PORT<device::port_no::P7, device::bitpos::B3> VOL_DN;\n\tutils::sw2<VOL_UP, VOL_DN> vol_;\n}\n\n\nextern \"C\" {\n\n\tvoid sci_putch(char ch)\n\t{\n\t\tuart0_.putch(ch);\n\t}\n\n\n\tvoid sci_puts(const char* str)\n\t{\n\t\tuart0_.puts(str);\n\t}\n\n\n\tchar sci_getch(void)\n\t{\n\t\treturn uart0_.getch();\n\t}\n\n\n\tuint16_t sci_length()\n\t{\n\t\treturn uart0_.recv_length();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_TX_intr(void)\n\t{\n\t\tuart0_.send_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_RX_intr(void)\n\t{\n\t\tuart0_.recv_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_ER_intr(void)\n\t{\n\t\tuart0_.error_task();\n\t}\n\n\n\tINTERRUPT_FUNC void ADC_intr(void)\n\t{\n\t\tadc_.task();\n\t}\n\n\n\tINTERRUPT_FUNC void ITM_intr(void)\n\t{\n\t\titm_.task();\n\t}\n};\n\n\nint main(int argc, char* argv[])\n{\n\tusing namespace device;\n\n\/\/\tutils::port::pullup_all(); \/\/\/< 安全の為、全ての入力をプルアップ\n\n\t\/\/ itimer の開始\n\t{\n\t\tuint8_t intr_level = 1;\n\t\titm_.start(60, intr_level);\n\t}\n\n\t\/\/ UART0 の開始\n\t{\n\t\tuint8_t intr_level = 1;\n\t\tuart0_.start(19200, intr_level);\n\t}\n\n\t\/\/ IICA(I2C) の開始\n\t{\n\t\tuint8_t intr_level = 0;\n\/\/\t\tif(!iica_.start(IICA::speed::fast, intr_level)) {\n\t\tif(!iica_.start(IICA::speed::standard, intr_level)) {\n\t\t\tutils::format(\"IICA start error (%d)\\n\") % static_cast<uint32_t>(iica_.get_last_error());\n\t\t}\n\t}\n\n\t\/\/ A\/D の開始\n\t{\n\t\tdevice::PM2.B0 = 1;\n\t\tuint8_t intr_level = 1; \/\/ 割り込み設定\n\t\tadc_.start(ADC::REFP::VDD, ADC::REFM::VSS, intr_level);\n\t}\n\n\t\/\/ data flash の開始\n\t{\n\t}\n\n\tADPC = 0x01; \/\/ A\/D input All digital port\n\n\tPM2.B3 = 0; \/\/ POWER CTRL (OUTPUT)\n\tP2.B3 = 1; \/\/ Active high (ON)\n\n\tPM1.B5 = 0; \/\/ LED G output\n\tPM1.B6 = 0; \/\/ LED R output\n\n\tsw2_.start();\n\tPMC12 = 0b11111110; \/\/ setup P12_0: digital port\n\tsw5_.start();\n\n\tvol_.start();\n\n\/\/\/\tutils::format(\"Start Digital MIC\\n\");\n\n\tuint8_t cnt = 0;\n\tuint8_t vol = 0;\n\twhile(1) {\n\t\titm_.sync();\n\n\t\tvol_.service();\n\t\tif(vol_.positive() & 1) {\n\t\t\tif(vol < 8) {\n\t\t\t\t++vol;\n\t\t\t}\n\t\t}\n\t\tif(vol_.positive() & 2) {\n\t\t\tif(vol > 0) {\n\t\t\t\t--vol;\n\t\t\t}\n\t\t}\n\n\t\tif(uart0_.recv_length() > 0) {\n\t\t\tchar ch = uart0_.getch();\n\n\t\t\tif(ch == 'C') { \/\/ CH-SW (0 to 31)\n\t\t\t\tauto n = sw5_.get();\n\t\t\t\tuart0_.putch((n \/ 10) + '0');\n\t\t\t\tuart0_.putch((n % 10) + '0');\n\t\t\t\tuart0_.putch('\\n');\n\t\t\t} else if(ch == 'M') { \/\/ MIC-SW (0 to 3)\n\t\t\t\tauto n = sw2_.get();\n\t\t\t\tuart0_.putch((n % 10) + '0');\n\t\t\t\tuart0_.putch('\\n');\n\t\t\t} else if(ch == 'F') { \/\/ 混信フラグ (0 to 1)\n\t\t\t\tuart0_.putch('0');\n\t\t\t\tuart0_.putch('\\n');\n\t\t\t} else if(ch == 'V') { \/\/ ボリューム値\n\t\t\t\tuart0_.putch('0' + vol);\n\t\t\t\tuart0_.putch('\\n');\n\t\t\t}\n\t\t}\n\n\t\tif(cnt >= 20) {\n\t\t\tcnt = 0;\n\t\t}\n\t\tif(cnt < 10) {\n\t\t\tP1.B5 = 1;\n\t\t\tP1.B6 = 0;\n\t\t} else {\n\t\t\tP1.B5 = 0;\n\t\t\tP1.B6 = 1;\n\t\t}\n\t\t++cnt;\n\t}\n}\n<commit_msg>update<commit_after>\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tデジタル・マイク制御 (R5F100ECA) 40ピン @n\n\t\t\tROM: 32K, RAM: @n\n\t\t\tP15: green LED @n\n\t\t\tP16: red LED @n\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2017 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RL78\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/renesas.hpp\"\n#include \"common\/port_utils.hpp\"\n#include \"common\/fifo.hpp\"\n#include \"common\/uart_io.hpp\"\n#include \"common\/adc_io.hpp\"\n#include \"common\/format.hpp\"\n#include \"common\/iica_io.hpp\"\n#include \"common\/itimer.hpp\"\n#include \"common\/flash_io.hpp\"\n#include \"common\/command.hpp\"\n\n#include \"sw.hpp\"\n#include \"serial.hpp\"\n\nnamespace {\n\n\tstatic const uint16_t VERSION = 15;\n\n\ttypedef device::itimer<uint8_t> ITM;\n\tITM\t\titm_;\n\n\t\/\/ UART1 の定義（SAU2、SAU3）\n\ttypedef utils::fifo<uint8_t, 64> BUFFER;\n\ttypedef device::uart_io<device::SAU00, device::SAU01, BUFFER, BUFFER> UART0;\n\ttypedef device::uart_io<device::SAU02, device::SAU03, BUFFER, BUFFER> UART1;\n\tUART0\tuart0_;\n\tUART1\tuart1_;\n\n\ttypedef device::iica_io<device::IICA0> IICA;\n\tIICA \tiica_;\n\n\t\/\/ 最終チャネル番号＋１を設定\n\ttypedef device::adc_io<1, utils::null_task> ADC;\n\tADC \tadc_;\n\n\ttypedef device::flash_io FLASH;\n\tFLASH\tflash_;\n\n\t\/\/ MIC 切り替え、入力定義\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B2> MIC_SW1;\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B1> MIC_SW2;\n\ttypedef utils::sw2<MIC_SW1, MIC_SW2> SW2;\n\tSW2\t\tsw2_;\n\n\t\/\/ CH 設定、入力定義\n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B1> CH_SW1;\n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B6> CH_SW2; \/\/ P20\/AIN0 --> P26 \n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B5> CH_SW3;\n\ttypedef device::PORT<device::port_no::P2, device::bitpos::B4> CH_SW4;\n\ttypedef device::PORT<device::port_no::P12, device::bitpos::B0> CH_SW5;\n\ttypedef utils::sw5<CH_SW1, CH_SW2, CH_SW3, CH_SW4, CH_SW5> SW5;\n\tSW5\t\tsw5_;\n\n\t\/\/ Volume +\/-\n\ttypedef device::PORT<device::port_no::P3, device::bitpos::B1> VOL_UP;\n\ttypedef device::PORT<device::port_no::P7, device::bitpos::B3> VOL_DN;\n\tutils::sw2<VOL_UP, VOL_DN> vol_;\n\n\tutils::command<64> command_;\n\n\ttypedef dmic::serial<UART0, SW5, SW2> SERIAL;\n\tSERIAL\tserial_(uart0_, sw5_, sw2_);\n}\n\n\nextern \"C\" {\n\n\tvoid sci_putch(char ch)\n\t{\n\t\tuart1_.putch(ch);\n\t}\n\n\n\tvoid sci_puts(const char* str)\n\t{\n\t\tuart1_.puts(str);\n\t}\n\n\n\tchar sci_getch(void)\n\t{\n\t\treturn uart1_.getch();\n\t}\n\n\n\tuint16_t sci_length()\n\t{\n\t\treturn uart1_.recv_length();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_TX_intr(void)\n\t{\n\t\tuart0_.send_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_RX_intr(void)\n\t{\n\t\tuart0_.recv_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART0_ER_intr(void)\n\t{\n\t\tuart0_.error_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART1_TX_intr(void)\n\t{\n\t\tuart1_.send_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART1_RX_intr(void)\n\t{\n\t\tuart1_.recv_task();\n\t}\n\n\n\tINTERRUPT_FUNC void UART1_ER_intr(void)\n\t{\n\t\tuart1_.error_task();\n\t}\n\n\n\tINTERRUPT_FUNC void ADC_intr(void)\n\t{\n\t\tadc_.task();\n\t}\n\n\n\tINTERRUPT_FUNC void ITM_intr(void)\n\t{\n\t\titm_.task();\n\t}\n};\n\n\nint main(int argc, char* argv[])\n{\n\tusing namespace device;\n\n\/\/\tutils::port::pullup_all(); \/\/\/< 安全の為、全ての入力をプルアップ\n\n\t\/\/ itimer の開始\n\t{\n\t\tuint8_t intr_level = 2;\n\t\titm_.start(60, intr_level);\n\t}\n\n\t\/\/ UART1 の開始\n\t{\n\t\tuint8_t intr_level = 1;\n\t\t\/\/ ４０ピン版、セカンドポート選択\n\t\tbool sec = true;\n\t\tuart1_.start(115200, intr_level, sec);\n\t}\n\n\tADPC = 0x01; \/\/ A\/D input All digital port\n\n\/\/\tPM2.B3 = 0; \/\/ POWER CTRL (OUTPUT)\n\/\/\tP2.B3 = 1; \/\/ Active high (ON)\n\n\t\/\/ IICA(I2C) の開始\n\t{\n\t\tuint8_t intr_level = 0;\n\/\/\/\t\tif(!iica_.start(IICA::speed::fast, intr_level)) {\n\t\tif(!iica_.start(IICA::speed::standard, intr_level)) {\n\t\t\tutils::format(\"IICA start error (%d)\\n\") % static_cast<uint32_t>(iica_.get_last_error());\n\t\t}\n\t}\n\n\t\/\/ A\/D の開始\n\t{\n\t\tdevice::PM2.B0 = 1;\n\t\tuint8_t intr_level = 1; \/\/ 割り込み設定\n\t\tadc_.start(ADC::REFP::VDD, ADC::REFM::VSS, intr_level);\n\t}\n\n\t\/\/ data flash の開始\n\t{\n\t}\n\n\tPM1.B5 = 0; \/\/ LED G output\n\tPM1.B6 = 0; \/\/ LED R output\n\n\tvol_.start();\n\n\tserial_.start();\n\n\tutils::format(\"Start Digital MIC Version: %d.%02d\\n\") % (VERSION \/ 100) % (VERSION % 100);\n\n\tcommand_.set_prompt(\"# \");\n\n\tuint8_t cnt = 0;\n\twhile(1) {\n\t\titm_.sync();\n\n\t\t\/\/ コマンド入力と、コマンド解析\n\t\tif(command_.service()) {\n\t\t\tauto n = command_.get_words();\n\t\t\tif(command_.cmp_word(0, \"sw2\")) {\n\t\t\t\tutils::format(\"SW2: %02b\\n\") % static_cast<uint16_t>(sw2_.get());\n\t\t\t} else if(command_.cmp_word(0, \"sw5\")) {\n\t\t\t\tutils::format(\"SW5: %05b\\n\") % static_cast<uint16_t>(sw5_.get());\n\t\t\t} else if(command_.cmp_word(0, \"vol\")) {\n\t\t\t\tutils::format(\"volume: %d\\n\") % serial_.get_volume();\n\t\t\t} else if(command_.cmp_word(0, \"help\") || command_.cmp_word(0, \"?\")) {\n\t\t\t\tutils::format(\"sw2 list SW2 value\\n\");\n\t\t\t\tutils::format(\"sw5 list SW5 value\\n\");\n\t\t\t\tutils::format(\"vol list VOL value\\n\");\n\t\t\t} else {\n\t\t\t\tconst char* p = command_.get_command();\n\t\t\t\tif(p[0]) {\n\t\t\t\t\tutils::format(\"command error: '%s'\\n\") % p;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvol_.service();\n\n\t\tbool volp = false;\n\t\tif(vol_.positive() & 1) {\n\t\t\tvolp = true;\n\t\t}\n\t\tbool volm = false;\n\t\tif(vol_.positive() & 2) {\n\t\t\tvolm = true;\n\t\t}\n\t\tserial_.service(volp, volm);\n\n\t\tif(volp) {\n\t\t\tutils::format(\"V+: %d\\n\") % serial_.get_volume();\n\t\t}\n\t\tif(volm) {\n\t\t\tutils::format(\"V-: %d\\n\") % serial_.get_volume();\n\t\t}\n\n\t\tif(cnt >= 20) {\n\t\t\tcnt = 0;\n\t\t}\n\t\tif(cnt < 10) {\n\t\t\tP1.B5 = 1;\n\t\t\tP1.B6 = 0;\n\t\t} else {\n\t\t\tP1.B5 = 0;\n\t\t\tP1.B6 = 1;\n\t\t}\n\t\t++cnt;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2004, 2005, 2006 Nikolas Zimmermann <zimmermann@kde.org>\n * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org>\n * Copyright (C) 2007 Apple Inc. All rights reserved.\n * Copyright (C) Research In Motion Limited 2011. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"config.h\"\n#include \"core\/svg\/SVGLengthContext.h\"\n\n#include \"core\/css\/CSSHelper.h\"\n#include \"core\/css\/CSSPrimitiveValue.h\"\n#include \"core\/dom\/NodeComputedStyle.h\"\n#include \"core\/layout\/LayoutObject.h\"\n#include \"core\/style\/ComputedStyle.h\"\n#include \"core\/svg\/SVGSVGElement.h\"\n#include \"platform\/LengthFunctions.h\"\n#include \"platform\/fonts\/FontMetrics.h\"\n\nnamespace blink {\n\nstatic inline float dimensionForLengthMode(SVGLengthMode mode, const FloatSize& viewportSize)\n{\n switch (mode) {\n case SVGLengthMode::Width:\n return viewportSize.width();\n case SVGLengthMode::Height:\n return viewportSize.height();\n case SVGLengthMode::Other:\n return sqrtf(viewportSize.diagonalLengthSquared() \/ 2);\n }\n ASSERT_NOT_REACHED();\n return 0;\n}\n\nstatic float convertValueFromPercentageToUserUnits(const SVGLength& value, const FloatSize& viewportSize)\n{\n return CSSPrimitiveValue::clampToCSSLengthRange(value.scaleByPercentage(dimensionForLengthMode(value.unitMode(), viewportSize)));\n}\n\nstatic const ComputedStyle* computedStyleForLengthResolving(const SVGElement* context)\n{\n if (!context)\n return nullptr;\n\n const ContainerNode* currentContext = context;\n do {\n if (currentContext->layoutObject())\n return currentContext->layoutObject()->style();\n currentContext = currentContext->parentNode();\n } while (currentContext);\n\n \/\/ There must be at least a LayoutSVGRoot layoutObject, carrying a style.\n ASSERT_NOT_REACHED();\n return nullptr;\n}\n\nstatic const ComputedStyle* rootElementStyle(const Node* context)\n{\n if (!context)\n return nullptr;\n\n const Document& document = context->document();\n Node* documentElement = document.documentElement();\n const ComputedStyle* documentStyle = document.computedStyle();\n const ComputedStyle* style = documentElement && context != documentElement ? documentElement->computedStyle() : documentStyle;\n if (!style)\n style = documentStyle;\n return style;\n}\n\nstatic float convertValueFromUserUnitsToEMS(const ComputedStyle* style, float value)\n{\n if (!style)\n return 0;\n float fontSize = style->specifiedFontSize();\n if (!fontSize)\n return 0;\n return value \/ fontSize;\n}\n\nstatic float convertValueFromEMSToUserUnits(const ComputedStyle* style, float value)\n{\n if (!style)\n return 0;\n return value * style->specifiedFontSize();\n}\n\nSVGLengthContext::SVGLengthContext(const SVGElement* context)\n : m_context(context)\n{\n}\n\nFloatRect SVGLengthContext::resolveRectangle(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const FloatRect& viewport, const SVGLength& x, const SVGLength& y, const SVGLength& width, const SVGLength& height)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type != SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE && !viewport.isEmpty()) {\n const FloatSize& viewportSize = viewport.size();\n return FloatRect(\n convertValueFromPercentageToUserUnits(x, viewportSize) + viewport.x(),\n convertValueFromPercentageToUserUnits(y, viewportSize) + viewport.y(),\n convertValueFromPercentageToUserUnits(width, viewportSize),\n convertValueFromPercentageToUserUnits(height, viewportSize));\n }\n\n SVGLengthContext lengthContext(context);\n return FloatRect(x.value(lengthContext), y.value(lengthContext), width.value(lengthContext), height.value(lengthContext));\n}\n\nFloatPoint SVGLengthContext::resolvePoint(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const SVGLength& x, const SVGLength& y)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type == SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE) {\n SVGLengthContext lengthContext(context);\n return FloatPoint(x.value(lengthContext), y.value(lengthContext));\n }\n\n \/\/ FIXME: valueAsPercentage() won't be correct for eg. cm units. They need to be resolved in user space and then be considered in objectBoundingBox space.\n return FloatPoint(x.valueAsPercentage(), y.valueAsPercentage());\n}\n\nfloat SVGLengthContext::resolveLength(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const SVGLength& x)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type == SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE) {\n SVGLengthContext lengthContext(context);\n return x.value(lengthContext);\n }\n\n \/\/ FIXME: valueAsPercentage() won't be correct for eg. cm units. They need to be resolved in user space and then be considered in objectBoundingBox space.\n return x.valueAsPercentage();\n}\n\nfloat SVGLengthContext::valueForLength(const UnzoomedLength& unzoomedLength, SVGLengthMode mode) const\n{\n return valueForLength(unzoomedLength.length(), 1, mode);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, const ComputedStyle& style, SVGLengthMode mode) const\n{\n return valueForLength(length, style.effectiveZoom(), mode);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, float zoom, SVGLengthMode mode) const\n{\n float dimension = 0;\n if (length.hasPercent()) {\n FloatSize viewportSize;\n determineViewport(viewportSize);\n \/\/ The viewport will be unaffected by zoom.\n dimension = dimensionForLengthMode(mode, viewportSize);\n }\n return valueForLength(length, zoom, dimension);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, const ComputedStyle& style, float dimension)\n{\n return valueForLength(length, style.effectiveZoom(), dimension);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, float zoom, float dimension)\n{\n ASSERT(zoom != 0);\n \/\/ isIntrinsic can occur for 'width' and 'height', but has no\n \/\/ real meaning for svg.\n if (length.isIntrinsic() || length.isLegacyIntrinsic())\n return 0;\n return floatValueForLength(length, dimension * zoom) \/ zoom;\n}\n\nfloat SVGLengthContext::convertValueToUserUnits(float value, SVGLengthMode mode, SVGLengthType fromUnit) const\n{\n float userUnits = value;\n switch (fromUnit) {\n case LengthTypeUnknown:\n return 0;\n case LengthTypePX:\n case LengthTypeNumber:\n userUnits = value;\n break;\n case LengthTypePercentage: {\n FloatSize viewportSize;\n if (!determineViewport(viewportSize))\n return 0;\n userUnits = value * dimensionForLengthMode(mode, viewportSize) \/ 100;\n break;\n }\n case LengthTypeEMS:\n userUnits = convertValueFromEMSToUserUnits(computedStyleForLengthResolving(m_context), value);\n break;\n case LengthTypeEXS:\n userUnits = convertValueFromEXSToUserUnits(value);\n break;\n case LengthTypeCM:\n userUnits = value * cssPixelsPerCentimeter;\n break;\n case LengthTypeMM:\n userUnits = value * cssPixelsPerMillimeter;\n break;\n case LengthTypeIN:\n userUnits = value * cssPixelsPerInch;\n break;\n case LengthTypePT:\n userUnits = value * cssPixelsPerPoint;\n break;\n case LengthTypePC:\n userUnits = value * cssPixelsPerPica;\n break;\n case LengthTypeREMS:\n userUnits = convertValueFromEMSToUserUnits(rootElementStyle(m_context), value);\n break;\n case LengthTypeCHS:\n userUnits = convertValueFromCHSToUserUnits(value);\n break;\n default:\n ASSERT_NOT_REACHED();\n break;\n }\n\n \/\/ Since we mix css <length> values with svg's length values we need to\n \/\/ clamp values to the narrowest range, otherwise it can result in\n \/\/ rendering issues.\n return CSSPrimitiveValue::clampToCSSLengthRange(userUnits);\n}\n\nfloat SVGLengthContext::convertValueFromUserUnits(float value, SVGLengthMode mode, SVGLengthType toUnit) const\n{\n switch (toUnit) {\n case LengthTypeUnknown:\n return 0;\n case LengthTypeNumber:\n return value;\n case LengthTypePercentage: {\n FloatSize viewportSize;\n if (!determineViewport(viewportSize))\n return 0;\n \/\/ LengthTypePercentage is represented with 100% = 100.0.\n \/\/ Good for accuracy but could eventually be changed.\n return value * 100 \/ dimensionForLengthMode(mode, viewportSize);\n }\n case LengthTypeEMS:\n return convertValueFromUserUnitsToEMS(computedStyleForLengthResolving(m_context), value);\n case LengthTypeEXS:\n return convertValueFromUserUnitsToEXS(value);\n case LengthTypeREMS:\n return convertValueFromUserUnitsToEMS(rootElementStyle(m_context), value);\n case LengthTypeCHS:\n return convertValueFromUserUnitsToCHS(value);\n case LengthTypePX:\n return value;\n case LengthTypeCM:\n return value \/ cssPixelsPerCentimeter;\n case LengthTypeMM:\n return value \/ cssPixelsPerMillimeter;\n case LengthTypeIN:\n return value \/ cssPixelsPerInch;\n case LengthTypePT:\n return value \/ cssPixelsPerPoint;\n case LengthTypePC:\n return value \/ cssPixelsPerPica;\n }\n\n ASSERT_NOT_REACHED();\n return 0;\n}\n\nfloat SVGLengthContext::convertValueFromUserUnitsToCHS(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n float zeroWidth = style->fontMetrics().zeroWidth();\n if (!zeroWidth)\n return 0;\n\n return value \/ zeroWidth;\n}\n\nfloat SVGLengthContext::convertValueFromCHSToUserUnits(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n return value * style->fontMetrics().zeroWidth();\n}\n\nfloat SVGLengthContext::convertValueFromUserUnitsToEXS(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n \/\/ Use of ceil allows a pixel match to the W3Cs expected output of coords-units-03-b.svg\n \/\/ if this causes problems in real world cases maybe it would be best to remove this\n float xHeight = ceilf(style->fontMetrics().xHeight());\n if (!xHeight)\n return 0;\n\n return value \/ xHeight;\n}\n\nfloat SVGLengthContext::convertValueFromEXSToUserUnits(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n \/\/ Use of ceil allows a pixel match to the W3Cs expected output of coords-units-03-b.svg\n \/\/ if this causes problems in real world cases maybe it would be best to remove this\n return value * ceilf(style->fontMetrics().xHeight());\n}\n\nbool SVGLengthContext::determineViewport(FloatSize& viewportSize) const\n{\n if (!m_context)\n return false;\n\n \/\/ Root <svg> element lengths are resolved against the top level viewport.\n if (m_context->isOutermostSVGSVGElement()) {\n viewportSize = toSVGSVGElement(m_context)->currentViewportSize();\n return true;\n }\n\n \/\/ Take size from nearest viewport element.\n SVGElement* viewportElement = m_context->viewportElement();\n if (!isSVGSVGElement(viewportElement))\n return false;\n\n const SVGSVGElement& svg = toSVGSVGElement(*viewportElement);\n viewportSize = svg.currentViewBoxRect().size();\n if (viewportSize.isEmpty())\n viewportSize = svg.currentViewportSize();\n\n return true;\n}\n\n}\n<commit_msg>Avoid division-by-zero in SVGLengthContext::convertValueFromUserUnits<commit_after>\/*\n * Copyright (C) 2004, 2005, 2006 Nikolas Zimmermann <zimmermann@kde.org>\n * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org>\n * Copyright (C) 2007 Apple Inc. All rights reserved.\n * Copyright (C) Research In Motion Limited 2011. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Library General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Library General Public License for more details.\n *\n * You should have received a copy of the GNU Library General Public License\n * along with this library; see the file COPYING.LIB. If not, write to\n * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\n * Boston, MA 02110-1301, USA.\n *\/\n\n#include \"config.h\"\n#include \"core\/svg\/SVGLengthContext.h\"\n\n#include \"core\/css\/CSSHelper.h\"\n#include \"core\/css\/CSSPrimitiveValue.h\"\n#include \"core\/dom\/NodeComputedStyle.h\"\n#include \"core\/layout\/LayoutObject.h\"\n#include \"core\/style\/ComputedStyle.h\"\n#include \"core\/svg\/SVGSVGElement.h\"\n#include \"platform\/LengthFunctions.h\"\n#include \"platform\/fonts\/FontMetrics.h\"\n\nnamespace blink {\n\nstatic inline float dimensionForLengthMode(SVGLengthMode mode, const FloatSize& viewportSize)\n{\n switch (mode) {\n case SVGLengthMode::Width:\n return viewportSize.width();\n case SVGLengthMode::Height:\n return viewportSize.height();\n case SVGLengthMode::Other:\n return sqrtf(viewportSize.diagonalLengthSquared() \/ 2);\n }\n ASSERT_NOT_REACHED();\n return 0;\n}\n\nstatic float convertValueFromPercentageToUserUnits(const SVGLength& value, const FloatSize& viewportSize)\n{\n return CSSPrimitiveValue::clampToCSSLengthRange(value.scaleByPercentage(dimensionForLengthMode(value.unitMode(), viewportSize)));\n}\n\nstatic const ComputedStyle* computedStyleForLengthResolving(const SVGElement* context)\n{\n if (!context)\n return nullptr;\n\n const ContainerNode* currentContext = context;\n do {\n if (currentContext->layoutObject())\n return currentContext->layoutObject()->style();\n currentContext = currentContext->parentNode();\n } while (currentContext);\n\n \/\/ There must be at least a LayoutSVGRoot layoutObject, carrying a style.\n ASSERT_NOT_REACHED();\n return nullptr;\n}\n\nstatic const ComputedStyle* rootElementStyle(const Node* context)\n{\n if (!context)\n return nullptr;\n\n const Document& document = context->document();\n Node* documentElement = document.documentElement();\n const ComputedStyle* documentStyle = document.computedStyle();\n const ComputedStyle* style = documentElement && context != documentElement ? documentElement->computedStyle() : documentStyle;\n if (!style)\n style = documentStyle;\n return style;\n}\n\nstatic float convertValueFromUserUnitsToEMS(const ComputedStyle* style, float value)\n{\n if (!style)\n return 0;\n float fontSize = style->specifiedFontSize();\n if (!fontSize)\n return 0;\n return value \/ fontSize;\n}\n\nstatic float convertValueFromEMSToUserUnits(const ComputedStyle* style, float value)\n{\n if (!style)\n return 0;\n return value * style->specifiedFontSize();\n}\n\nSVGLengthContext::SVGLengthContext(const SVGElement* context)\n : m_context(context)\n{\n}\n\nFloatRect SVGLengthContext::resolveRectangle(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const FloatRect& viewport, const SVGLength& x, const SVGLength& y, const SVGLength& width, const SVGLength& height)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type != SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE && !viewport.isEmpty()) {\n const FloatSize& viewportSize = viewport.size();\n return FloatRect(\n convertValueFromPercentageToUserUnits(x, viewportSize) + viewport.x(),\n convertValueFromPercentageToUserUnits(y, viewportSize) + viewport.y(),\n convertValueFromPercentageToUserUnits(width, viewportSize),\n convertValueFromPercentageToUserUnits(height, viewportSize));\n }\n\n SVGLengthContext lengthContext(context);\n return FloatRect(x.value(lengthContext), y.value(lengthContext), width.value(lengthContext), height.value(lengthContext));\n}\n\nFloatPoint SVGLengthContext::resolvePoint(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const SVGLength& x, const SVGLength& y)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type == SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE) {\n SVGLengthContext lengthContext(context);\n return FloatPoint(x.value(lengthContext), y.value(lengthContext));\n }\n\n \/\/ FIXME: valueAsPercentage() won't be correct for eg. cm units. They need to be resolved in user space and then be considered in objectBoundingBox space.\n return FloatPoint(x.valueAsPercentage(), y.valueAsPercentage());\n}\n\nfloat SVGLengthContext::resolveLength(const SVGElement* context, SVGUnitTypes::SVGUnitType type, const SVGLength& x)\n{\n ASSERT(type != SVGUnitTypes::SVG_UNIT_TYPE_UNKNOWN);\n if (type == SVGUnitTypes::SVG_UNIT_TYPE_USERSPACEONUSE) {\n SVGLengthContext lengthContext(context);\n return x.value(lengthContext);\n }\n\n \/\/ FIXME: valueAsPercentage() won't be correct for eg. cm units. They need to be resolved in user space and then be considered in objectBoundingBox space.\n return x.valueAsPercentage();\n}\n\nfloat SVGLengthContext::valueForLength(const UnzoomedLength& unzoomedLength, SVGLengthMode mode) const\n{\n return valueForLength(unzoomedLength.length(), 1, mode);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, const ComputedStyle& style, SVGLengthMode mode) const\n{\n return valueForLength(length, style.effectiveZoom(), mode);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, float zoom, SVGLengthMode mode) const\n{\n float dimension = 0;\n if (length.hasPercent()) {\n FloatSize viewportSize;\n determineViewport(viewportSize);\n \/\/ The viewport will be unaffected by zoom.\n dimension = dimensionForLengthMode(mode, viewportSize);\n }\n return valueForLength(length, zoom, dimension);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, const ComputedStyle& style, float dimension)\n{\n return valueForLength(length, style.effectiveZoom(), dimension);\n}\n\nfloat SVGLengthContext::valueForLength(const Length& length, float zoom, float dimension)\n{\n ASSERT(zoom != 0);\n \/\/ isIntrinsic can occur for 'width' and 'height', but has no\n \/\/ real meaning for svg.\n if (length.isIntrinsic() || length.isLegacyIntrinsic())\n return 0;\n return floatValueForLength(length, dimension * zoom) \/ zoom;\n}\n\nfloat SVGLengthContext::convertValueToUserUnits(float value, SVGLengthMode mode, SVGLengthType fromUnit) const\n{\n float userUnits = value;\n switch (fromUnit) {\n case LengthTypeUnknown:\n return 0;\n case LengthTypePX:\n case LengthTypeNumber:\n userUnits = value;\n break;\n case LengthTypePercentage: {\n FloatSize viewportSize;\n if (!determineViewport(viewportSize))\n return 0;\n userUnits = value * dimensionForLengthMode(mode, viewportSize) \/ 100;\n break;\n }\n case LengthTypeEMS:\n userUnits = convertValueFromEMSToUserUnits(computedStyleForLengthResolving(m_context), value);\n break;\n case LengthTypeEXS:\n userUnits = convertValueFromEXSToUserUnits(value);\n break;\n case LengthTypeCM:\n userUnits = value * cssPixelsPerCentimeter;\n break;\n case LengthTypeMM:\n userUnits = value * cssPixelsPerMillimeter;\n break;\n case LengthTypeIN:\n userUnits = value * cssPixelsPerInch;\n break;\n case LengthTypePT:\n userUnits = value * cssPixelsPerPoint;\n break;\n case LengthTypePC:\n userUnits = value * cssPixelsPerPica;\n break;\n case LengthTypeREMS:\n userUnits = convertValueFromEMSToUserUnits(rootElementStyle(m_context), value);\n break;\n case LengthTypeCHS:\n userUnits = convertValueFromCHSToUserUnits(value);\n break;\n default:\n ASSERT_NOT_REACHED();\n break;\n }\n\n \/\/ Since we mix css <length> values with svg's length values we need to\n \/\/ clamp values to the narrowest range, otherwise it can result in\n \/\/ rendering issues.\n return CSSPrimitiveValue::clampToCSSLengthRange(userUnits);\n}\n\nfloat SVGLengthContext::convertValueFromUserUnits(float value, SVGLengthMode mode, SVGLengthType toUnit) const\n{\n switch (toUnit) {\n case LengthTypeUnknown:\n return 0;\n case LengthTypeNumber:\n return value;\n case LengthTypePercentage: {\n FloatSize viewportSize;\n if (!determineViewport(viewportSize))\n return 0;\n float dimension = dimensionForLengthMode(mode, viewportSize);\n if (!dimension)\n return 0;\n \/\/ LengthTypePercentage is represented with 100% = 100.0.\n \/\/ Good for accuracy but could eventually be changed.\n return value * 100 \/ dimension;\n }\n case LengthTypeEMS:\n return convertValueFromUserUnitsToEMS(computedStyleForLengthResolving(m_context), value);\n case LengthTypeEXS:\n return convertValueFromUserUnitsToEXS(value);\n case LengthTypeREMS:\n return convertValueFromUserUnitsToEMS(rootElementStyle(m_context), value);\n case LengthTypeCHS:\n return convertValueFromUserUnitsToCHS(value);\n case LengthTypePX:\n return value;\n case LengthTypeCM:\n return value \/ cssPixelsPerCentimeter;\n case LengthTypeMM:\n return value \/ cssPixelsPerMillimeter;\n case LengthTypeIN:\n return value \/ cssPixelsPerInch;\n case LengthTypePT:\n return value \/ cssPixelsPerPoint;\n case LengthTypePC:\n return value \/ cssPixelsPerPica;\n }\n\n ASSERT_NOT_REACHED();\n return 0;\n}\n\nfloat SVGLengthContext::convertValueFromUserUnitsToCHS(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n float zeroWidth = style->fontMetrics().zeroWidth();\n if (!zeroWidth)\n return 0;\n\n return value \/ zeroWidth;\n}\n\nfloat SVGLengthContext::convertValueFromCHSToUserUnits(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n return value * style->fontMetrics().zeroWidth();\n}\n\nfloat SVGLengthContext::convertValueFromUserUnitsToEXS(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n \/\/ Use of ceil allows a pixel match to the W3Cs expected output of coords-units-03-b.svg\n \/\/ if this causes problems in real world cases maybe it would be best to remove this\n float xHeight = ceilf(style->fontMetrics().xHeight());\n if (!xHeight)\n return 0;\n\n return value \/ xHeight;\n}\n\nfloat SVGLengthContext::convertValueFromEXSToUserUnits(float value) const\n{\n const ComputedStyle* style = computedStyleForLengthResolving(m_context);\n if (!style)\n return 0;\n\n \/\/ Use of ceil allows a pixel match to the W3Cs expected output of coords-units-03-b.svg\n \/\/ if this causes problems in real world cases maybe it would be best to remove this\n return value * ceilf(style->fontMetrics().xHeight());\n}\n\nbool SVGLengthContext::determineViewport(FloatSize& viewportSize) const\n{\n if (!m_context)\n return false;\n\n \/\/ Root <svg> element lengths are resolved against the top level viewport.\n if (m_context->isOutermostSVGSVGElement()) {\n viewportSize = toSVGSVGElement(m_context)->currentViewportSize();\n return true;\n }\n\n \/\/ Take size from nearest viewport element.\n SVGElement* viewportElement = m_context->viewportElement();\n if (!isSVGSVGElement(viewportElement))\n return false;\n\n const SVGSVGElement& svg = toSVGSVGElement(*viewportElement);\n viewportSize = svg.currentViewBoxRect().size();\n if (viewportSize.isEmpty())\n viewportSize = svg.currentViewportSize();\n\n return true;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <ncurses.h>\n#include <time.h>\n#include <stdio.h>\n\n#include <string>\n#include <algorithm>\n\n#include \"global\/Global.h\" \/\/ includes difficulties\n#include \"world\/World.h\"\n#include \"world\/Map.h\"\n\n#include \"game.h\"\n#include \"menu.h\"\n#include \"entities\/Player.h\"\n#include \"entities\/Enemy.h\"\n#include \"entities\/Coin.h\"\n#include \"windows\/Window.h\"\n#include \"windows\/DiagWindow.h\"\n\nusing namespace std;\n\n\nint startGame() {\n\n \/*\n * Pre-game loop init.\n * TODO\n * 1) Init entities.\n * 2) Init map with entities.\n * 3) draw map.\n *\/\n\n \/\/ Retrieve global refs\n Global *global = Global::get();\n int numCoins = global->getNoCoins();\n int numEnemies = global->getNoEnemies();\n\n \/\/ Declared internally, to prevent ctors from running before main\n DiagWindow diagWin_game = DiagWindow({{41, 1}, {100,10}});\n Window wgame = Window(game_area);\n Map map = Map(&wgame);\n\n \/\/ Actors know about game window for movement\n Player player = Player();\n\n \/\/ TODO Maybe combine with below...\n std::vector<Enemy> enemies;\n for (int i = 0; i < numEnemies; i++)\n enemies.push_back(Enemy());\n std::vector<Coin> coins;\n for (int i = 0; i < numCoins; i++)\n coins.push_back(Coin());\n\n\n \/*\n * Check if Player & Enemy are too near or too far\n * from each other. Somewhere between a quarter\n * of a screen and half of a screen.\n *\/\n \/\/std::vector<Enemy*> enemies;\n \/\/enemies.push_back(new Enemy());\n uint_fast8_t quarterArea = (game_area.area() \/ 4);\n uint_fast8_t halfArea = (game_area.area() \/ 2);\n uint_fast8_t distance;\n bool dangerClose = true;\n while (dangerClose == true) {\n for (Enemy &enemy : enemies) {\n enemy = Enemy(player);\n distance = player.getDistance(enemy.getPos());\n if (distance < quarterArea || distance > halfArea) {\n dangerClose = true;\n break;\n } else {\n \/\/enemies.push_back(enemy);\n dangerClose = false;\n }\n }\n }\n\n\n \/* Init placement of Player, Enemy, and Coins\n * Map prioritises drawing items in the reverse\n * of the order that they were added\n *\/\n map.push(player);\n for (Coin &coin : coins) map.push(coin);\n for (Enemy &enemy : enemies) map.push(enemy);\n\n\n \/*\n * Game loop begin.\n *\/\n\n int ch, coinsCollected = 0;\n string infoMsg = \"\";\n bool isGameover = false;\n while (isGameover == false) {\n \/\/ Advance record of world time\n global->tick();\n\n \/\/ Draw all entities\n map.draw();\n\n ch = wgame.getChar();\n infoMsg = \"\";\n vec2ui prevPos = player.getPos();\n\n switch (ch) {\n \/*\n * Diagonal keys\n *\/\n case 55: \/\/ Key up-left\n player.moveNorthWest();\n break;\n case 57: \/\/ Key up-right\n player.moveNorthEast();\n break;\n case 51: \/\/ Key down-right\n player.moveSouthEast();\n break;\n case 49: \/\/ Key down-left\n player.moveSouthWest();\n break;\n\n \/*\n * Orthogonal keys\n *\/\n case KEY_UP:\n case 56:\n case 'k':\n player.moveNorth();\n break;\n case KEY_DOWN:\n case 50:\n case 'j':\n player.moveSouth();\n break;\n case KEY_LEFT:\n case 52:\n case 'h':\n player.moveWest();\n break;\n case KEY_RIGHT:\n case 54:\n case 'l':\n player.moveEast();\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n break;\n case 27: \/* ESC *\/\n isGameover = true;\n default:\n player.wait();\n infoMsg = player.getName();\n\n }\n if (map.checkCell(player.getPos(), \"Enemy\")) {\n \/\/player.attack(&map.getEntity(player.getPos()));\n for (Enemy &enemy : enemies) {\n if (enemy.getPos() == player.getPos()) {\n player.attack(enemy);\n \/\/printf(\"%ld\\n\\r\", enemy.getHP());\n }\n }\n player.setPos(prevPos);\n }\n\n \/\/ Draw Coins again, and check if player has landed on\n for (auto &coin : coins) {\n \/\/ Don't do anything unless coin 'belongs' to world\n if (coin.getOwnership() == WORLD) { \/\/ XXX without this, player still get invisicoins\n if (player.atop(coin.getPos())) {\n coin.setOwnership(PLAYER);\n player.addItem(coin);\n map.rm(coin);\n\n if ( ++coinsCollected == numCoins) {\n isGameover = true;\n }\n }\n }\n }\n\n \/\/ Enemy, seek out player\n string proximityAlert = \"\";\n for (size_t i = 0; i < enemies.size(); i++) {\n if (enemies[i].getHP() > 0) { \/\/ TODO some sort of alive or dead flag\n enemies[i].move();\n if (enemies[i].isAdjacent(player.getPos())) {\n proximityAlert += \"!\";\n }\n } else { \/\/ pop dead enemy\n enemies.erase(enemies.begin() + i);\n }\n }\n\n for (Enemy &enemy : enemies) {\n \/\/ Cleanup dead enemies\n if (enemy.getHP() <= 0) {\n \/\/printf(\"Enemy %s is dead!\\n\", enemy.getType().c_str());\n map.rm(enemy);\n }\n \/\/ Game Over\n if (enemy.atop(player.getPos())) {\n wgame.coloSplash(COLOR_PAIR(1));\n\n diagWin_game.push(\"GAME OVER!\");\n isGameover = true;\n break;\n }\n }\n\n diagWin_game.push(\n + \"HP: \"\n + std::to_string(player.getHP())\n + \" DEF: \"\n + std::to_string(player.getDEF())\n + \" ATK: \"\n + std::to_string(player.getATK())\n + \" ACT: \"\n + std::to_string(player.getACT())\n + \" LCK: \"\n + std::to_string(player.getLCK())\n + \" stp: \"\n + std::to_string(player.getSteps())\n + \" ptk: \"\n + std::to_string(player.getTicks())\n + \" gtk: \"\n + std::to_string(global->getTicks())\n + \" scr: \"\n + std::to_string(player.getScore())\n + \" dif: \" + global->getDifficultyStr()\n + \" nfo: \" + infoMsg\n + \" \" + proximityAlert\n );\n }\n\n \/*\n * Post-game loop operations.\n *\/\n map.draw(); \/\/ Draw last frame.\n\n \/\/ TODO eventually return more information\n return player.getScore();\n}\n\n<commit_msg>[#71] Implement Actor v Actor fighting<commit_after>#include <ncurses.h>\n#include <time.h>\n#include <stdio.h>\n\n#include <string>\n#include <algorithm>\n\n#include \"global\/Global.h\" \/\/ includes difficulties\n#include \"world\/World.h\"\n#include \"world\/Map.h\"\n\n#include \"game.h\"\n#include \"menu.h\"\n#include \"entities\/Player.h\"\n#include \"entities\/Enemy.h\"\n#include \"entities\/Coin.h\"\n#include \"windows\/Window.h\"\n#include \"windows\/DiagWindow.h\"\n\nusing namespace std;\n\n\nint startGame() {\n\n \/*\n * Pre-game loop init.\n * TODO\n * 1) Init entities.\n * 2) Init map with entities.\n * 3) draw map.\n *\/\n\n \/\/ Retrieve global refs\n Global *global = Global::get();\n int numCoins = global->getNoCoins();\n int numEnemies = global->getNoEnemies();\n\n \/\/ Declared internally, to prevent ctors from running before main\n DiagWindow diagWin_game = DiagWindow({{41, 1}, {100,10}});\n Window wgame = Window(game_area);\n Map map = Map(&wgame);\n\n \/\/ Actors know about game window for movement\n Player player = Player();\n\n \/\/ TODO Maybe combine with below...\n std::vector<Enemy> enemies;\n for (int i = 0; i < numEnemies; i++)\n enemies.push_back(Enemy());\n std::vector<Coin> coins;\n for (int i = 0; i < numCoins; i++)\n coins.push_back(Coin());\n\n\n \/*\n * Check if Player & Enemy are too near or too far\n * from each other. Somewhere between a quarter\n * of a screen and half of a screen.\n *\/\n \/\/std::vector<Enemy*> enemies;\n \/\/enemies.push_back(new Enemy());\n uint_fast8_t quarterArea = (game_area.area() \/ 4);\n uint_fast8_t halfArea = (game_area.area() \/ 2);\n uint_fast8_t distance;\n bool dangerClose = true;\n while (dangerClose == true) {\n for (Enemy &enemy : enemies) {\n enemy = Enemy(player);\n distance = player.getDistance(enemy.getPos());\n if (distance < quarterArea || distance > halfArea) {\n dangerClose = true;\n break;\n } else {\n \/\/enemies.push_back(enemy);\n dangerClose = false;\n }\n }\n }\n\n\n \/* Init placement of Player, Enemy, and Coins\n * Map prioritises drawing items in the reverse\n * of the order that they were added\n *\/\n map.push(player);\n for (Coin &coin : coins) map.push(coin);\n for (Enemy &enemy : enemies) map.push(enemy);\n\n\n \/*\n * Game loop begin.\n *\/\n\n int ch, coinsCollected = 0;\n string infoMsg = \"\";\n bool isGameover = false;\n while (isGameover == false) {\n \/\/ Advance record of world time\n global->tick();\n\n \/\/ Draw all entities\n map.draw();\n\n ch = wgame.getChar();\n infoMsg = \"\";\n vec2ui prevPos = player.getPos();\n\n switch (ch) {\n \/*\n * Diagonal keys\n *\/\n case 55: \/\/ Key up-left\n player.moveNorthWest();\n break;\n case 57: \/\/ Key up-right\n player.moveNorthEast();\n break;\n case 51: \/\/ Key down-right\n player.moveSouthEast();\n break;\n case 49: \/\/ Key down-left\n player.moveSouthWest();\n break;\n\n \/*\n * Orthogonal keys\n *\/\n case KEY_UP:\n case 56:\n case 'k':\n player.moveNorth();\n break;\n case KEY_DOWN:\n case 50:\n case 'j':\n player.moveSouth();\n break;\n case KEY_LEFT:\n case 52:\n case 'h':\n player.moveWest();\n break;\n case KEY_RIGHT:\n case 54:\n case 'l':\n player.moveEast();\n break;\n case KEY_ENTER: \/* numpad enter *\/\n case '\\n': \/* keyboard return *\/\n break;\n case 27: \/* ESC *\/\n isGameover = true;\n default:\n player.wait();\n infoMsg = player.getName();\n\n }\n if (map.checkCell(player.getPos(), \"Enemy\")) {\n for (Enemy &enemy : enemies) {\n if (enemy.getPos() == player.getPos()) {\n player.attack(enemy);\n }\n }\n player.setPos(prevPos);\n }\n\n \/\/ Draw Coins again, and check if player has landed on\n \/\/ TODO replace this for..range with std iter for loop\n for (auto &coin : coins) {\n if (player.atop(coin.getPos())) {\n coin.setOwnership(PLAYER);\n player.addItem(coin);\n\n \/\/ Erase this coin if owned by Player\n coins.erase(\n std::remove_if(\n coins.begin(),\n coins.end(),\n [](Coin& c) -> bool {\n return c.getOwnership() == PLAYER;\n }\n ),\n coins.end()\n );\n\n if ( ++coinsCollected == numCoins) {\n isGameover = true;\n }\n }\n }\n\n \/\/ Enemy, seek out player\n string proximityAlert = \"\";\n for (size_t i = 0; i < enemies.size(); i++) {\n if (enemies[i].getHP() > 0) { \/\/ TODO some sort of alive or dead flag\n enemies[i].move();\n if (enemies[i].isAdjacent(player.getPos())) {\n proximityAlert += \"!\";\n }\n } else { \/\/ pop dead enemy\n diagWin_game.push(player.getName()\n + \" killed \" + enemies[i].getType()\n + \" \" + enemies[i].getName() + \"!\");\n enemies.erase(enemies.begin() + i);\n }\n }\n\n for (Enemy &enemy : enemies) {\n \/\/ Game Over\n if (enemy.atop(player.getPos())) {\n wgame.coloSplash(COLOR_PAIR(1));\n\n diagWin_game.push(\"GAME OVER!\");\n isGameover = true;\n break;\n }\n }\n\n diagWin_game.push(\n + \"HP: \"\n + std::to_string(player.getHP())\n + \" DEF: \"\n + std::to_string(player.getDEF())\n + \" ATK: \"\n + std::to_string(player.getATK())\n + \" ACT: \"\n + std::to_string(player.getACT())\n + \" LCK: \"\n + std::to_string(player.getLCK())\n + \" stp: \"\n + std::to_string(player.getSteps())\n + \" ptk: \"\n + std::to_string(player.getTicks())\n + \" gtk: \"\n + std::to_string(global->getTicks())\n + \" scr: \"\n + std::to_string(player.getScore())\n + \" dif: \" + global->getDifficultyStr()\n + \" nfo: \" + infoMsg\n + \" \" + proximityAlert\n );\n\n \/\/ Re-init map with refs to updated entities\n map = Map(&wgame);\n map.push(player);\n for (Coin &coin : coins) map.push(coin);\n for (Enemy &enemy : enemies) map.push(enemy);\n }\n\n \/*\n * Post-game loop operations.\n *\/\n map.draw(); \/\/ Draw last frame.\n\n \/\/ TODO eventually return more information\n return player.getScore();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file game.h\n * @brief Arquivo cabeçalho com a implementacao de funcoes\n que controlam o jogo.\n * @author Daniel Barbosa (nome@email.com)\n * @author Jaine Budke (jainebudke@hotmail.com)\n * @since 30\/05\/2017\n * @date 19\/06\/2017\n *\/\n\n\n#include \"game.h\"\n#include \"snake.h\"\n\nLevel lv; \/\/ instanciando classe level\nSnake sk; \/\/ instanciando classe snake\n\n\/\/ ======================================================\n\/\/ ACTIONS\n\/\/ ======================================================\n\n\/** @brief Identifica a posicao inicial da Snake no tabuleiro.\n @return Posicao inicial da Snake *\/\nPosition Game::initialPosition(){\n\n \/\/ Percorre board tentando encontrar inicio\n for( int i = 0 ; i < lv.currentBoard.size() ; i++ ){ \/\/ Percorre cada pos do vector\n for( int j=0 ; j < lv.currentBoard[i].length() ; j++ ){ \/\/ Percorre cada pos da string\n if( lv.currentBoard[i][j] == '*' ){\n Position inicial;\n inicial.x = j; \/\/ coluna\n \t inicial.y = i; \/\/ linha\n lv.initial = inicial;\n \t return inicial;\n }\n }\n }\n\n}\n\n\n\/** @brief Lança uma maçã no jogo, dentro das coordenadas do tabuleiro da fase.\n @return Posicao em que a maçã foi lançada *\/\nPosition Game::throwApple(){\n\n bool invalido = true;\n\n std::srand(std::time(0)); \/\/ semente do rand\n Position tamanho = sizesBoards[lv.currentLevel-1]; \/\/ pega tamanho do level atual\n\n \/\/ sorteia a maçã até cair num espaço livre\n do{\n\n int menor = 1;\n int maiorLinha = tamanho.y -1;\n int maiorColuna = tamanho.x -1;\n\n Position pos;\n\n pos.y = rand()%(maiorLinha-menor+1) + menor; \/\/ sorteia um numero aleatorio para a linha\n pos.x = rand()%(maiorColuna-menor+1) + menor; \/\/ sorteia um numero aleatorio para a coluna\n\n if( isFree(lv.currentBoard[pos.y][pos.x]) ){\n invalido = false;\n lv.currentBoard[pos.y][pos.x] = 'o';\n maca = pos;\n }\n\n } while( invalido );\n\n}\n\n\n\/** @brief Move a cobra de acordo com as coordenadas passadas.\n @return 1 se cobra chegou na maca, bateu na parede ou rabo. 0 otherwise. *\/\nbool Game::moveSnake(){\n\n\n Position dir = sk.listDirections[sk.currentDirection];\n sk.snake.push_front( dir );\n\n Position back = sk.snake.back();\n\n sk.snake.pop_back();\n\n Position front = sk.snake.front();\n\n lv.currentBoard[back.y][back.x] = ' ';\n lv.currentBoard[front.y][front.x] = '~';\n\n\n \/\/ se colidiu de alguma forma\n if( collideTail() or collideWall() ){\n currentState = CRASH;\n return true; \/\/ muda stop pra true\n }\n\n \/\/ se chegou na maçã\n if( eatingApple() ){\n currentState = EXPAND;\n lv.eatenApples += 1;\n sk.listDirections.clear();\n\n return true; \/\/ muda stop pra true\n }\n\n if( sk.listDirections.size() == sk.currentDirection ){\n return true;\n }\n\n sk.currentDirection += 1;\n\n return false; \/\/ muda stop pra false - continua rodando\n\n\n}\n\n\/\/ ======================================================\n\/\/ AUXILIO\n\/\/ ======================================================\n\n\/** @brief Verifica se o caractere passado é uma parede.\n @return 1 se for, 0 se não for *\/\nbool Game::isWall( char ch ){\n return ( ch == '#' );\n}\n\n\/** @brief Verifica se o caractere passado é uma parede invisivel.\n @return 1 se for, 0 se não for *\/\nbool Game::isInvisibleWall( char ch ){\n return ( ch == '.' );\n}\n\n\n\/** @brief Verifica se o caractere passado é um lugar livre.\n @return 1 se for, 0 se não for *\/\nbool Game::isFree( char ch ){\n return ( ch == ' ' );\n}\n\n\/** @brief Verifica se o caractere passado é a posicao inicial.\n @return 1 se for, 0 se não for *\/\nbool Game::isInitialPosition( char ch ){\n return ( ch == '*' );\n}\n\n\n\/** @brief Verifica se a snake colidiu com o tail.\n @return 1 se colidiu, 0 otherwise *\/\nbool Game::collideTail( ){\n\n \/\/ TODO\n\n return false;\n}\n\n\/** @brief Verifica se a snake colidiu com a parede.\n @return 1 se colidiu, 0 otherwise *\/\nbool Game::collideWall( ){\n\n \/\/ TODO\n\n return false;\n}\n\n\/** @brief Verifica se a snake chegou na maca.\n @return 1 se chegou, 0 otherwise *\/\nbool Game::eatingApple( ){\n\n Position pos = sk.snake.front();\n\n if( pos.x == maca.x and pos.y == maca.y ){\n return true;\n } else {\n return false;\n }\n\n}\n\n\n\/\/ ======================================================\n\/\/ ESTADOS\n\/\/ ======================================================\n\n\/** @brief Aumenta o tamanho da cobra. *\/\nvoid Game::expandSnake(){\n\n Position pos = initialPosition();\n\n throwApple();\n\n\n \/\/ SE tamanho da snake for 1 ela é transformada na cobra\n if( sk.sizeSnake == 0 ){\n lv.currentBoard[pos.y][pos.x] = '~';\n sk.snake.push_front( pos );\n\n sk.sizeSnake += 1; \/\/ snake cresce\n }\n\n \/\/ SE tamanho da snake for maior que 1 ela cresce\n if( sk.sizeSnake >= 1 ){\n sk.sizeSnake += 1; \/\/ snake cresce\n }\n\n \/\/ SE qntidade de maçãs comidas for o total -> STATE = LEVEL_UP\n if( lv.eatenApples == lv.totalApples ){\n currentState = LEVEL_UP;\n }\n\n \/\/ SE qntidade de maçãs comidas for menor que o total -> STATE = RUN e lança maçã\n if( lv.eatenApples < lv.totalApples ){\n currentState = RUN;\n }\n\n}\n\n\n\/** @brief Faz a chamada da próxima fase do jogo setando os valores da classe Level. *\/\nvoid Game::levelUp(){\n\n lv.currentLevel += 1; \/\/ em level é acrescentado um nível\n\n if( lv.currentLevel <= levels ){\n lv.currentBoard = boards[lv.currentLevel-1]; \/\/ recupera o tabuleiro do level\n }\n\n currentState = EXPAND;\n\n}\n\n\n\/** @brief Verifica se a cobra teve alguma colisão. *\/\nbool Game::crashSnake(){\n\n std::cout << \"Oh no! You're crash!\\n\";\n currentState = DEAD;\n\n}\n\n\n\/** @brief Simula a morte da cobra (diminui uma vida). *\/\nvoid Game::deadSnake(){\n\n lives -= 1;\n\n std::cout << \">>> Pressione <ENTER> quando estiver pronto para continuar.\";\n std::string dummy;\n std::getline( std::cin, dummy );\n\n currentState = RUN;\n\n}\n\n\/** @brief A cobra anda a quantidade de vezes até chegar na maçã. *\/\nvoid Game::runSnake(){\n\n sk.solveMaze( lv.currentBoard, lv.initial, sizesBoards[ lv.currentLevel - 1 ], maca );\n\n bool stop = moveSnake();\n\n \/\/ verifica se a condicao de parada foi acionada\n if( stop == false ){\n currentState = RUN;\n }\n\n}\n\n\n\/\/ ======================================================\n\/\/ SETTERS AND GETTERS\n\/\/ ======================================================\n\n\/** @brief Define a quantidade de fases do jogo.\n @param levels_ As fases\n @return True se tiver um numero de fases maior que zero; False otherwise. *\/\nbool Game::setLevels( int levels_ ){\n\tif( levels_ > 0 ){\n\t\tlevels = levels_;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera a quantidade de fases do jogo.\n @return As fases. *\/\nint Game::getLevels( void ) const{\n\treturn levels;\n}\n\n\n\/** @brief Define um vetor com os tabuleiros do jogo.\n @param boards_ Os tabuleiros\n @return True se tiver um numero de tabuleiros maior que zero; False otherwise. *\/\nbool Game::setBoards( std::vector<std::vector<std::string>> boards_ ){\n\tint qntidade = boards_.size();\n\tif( qntidade > 0 ){\n\t\tboards = boards_;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera os tabuleiros do jogo.\n @return Os tabuleiros. *\/\nstd::vector<std::vector<std::string>> Game::getBoards( void ) const{\n\treturn boards;\n}\n\n\n\/** @brief Diminui uma vida do jogador.\n @return True se tinha vidas pra diminuir; False otherwise. *\/\nbool Game::setLives( ){\n\tif( lives > 0 ){\n\t\tlives--;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera a quantidade de vidas do jogador.\n @return As vidas. *\/\nint Game::getLives( void ) const{\n\treturn lives;\n}\n\n\/** @brief Atualiza status do jogador\n @param state_ O status *\/\nvoid Game::setState( int state_ ){\n\tstate = state_;\n}\n\n\/** @brief Recupera o status do jogador\n @return True se jogador ganhou; False se perdeu *\/\nbool Game::getState( void ) const{\n\tif( state == 1 ){\n\t\treturn true;\n\t}else if( state == 0 ){\n\t\treturn false;\n\t}\n}\n\n\/** @brief Atualiza os tamanhos dos tabuleiros do jogo\n @param sizesBoards_ Vetor com os tamanhos *\/\nvoid Game::setSizeBoards( std::vector<Position> sizesBoards_ ){\n\tsizesBoards = sizesBoards_;\n}\n\n\n\/** @brief Recupera o vetor com os tamanhos *\/\nstd::vector<Position> Game::getSizeBoards( void ) const{\n\treturn sizesBoards;\n}\n\n\/\/ ======================================================\n\/\/ GETTERS AND SETTERS DA CLASSE LEVEL\n\/\/ ======================================================\n\n\n\/** @brief Define a fase atual que o jogador se encontra.\n @param level_ A fase\n @return True se tiver um numero de fases maior que zero; False otherwise. *\/\nbool Game::setCurrentLevel( int level_ ){\n if( level_ > 0 ){\n lv.currentLevel = level_;\n return true;\n } else {\n return false;\n }\n}\n\n\n\/** @brief Recupera a fase atual do jogo.\n @return A fase. *\/\nint Game::getCurrentLevel( void ) const{\n return lv.currentLevel;\n}\n\n\/** @brief Recupera o tabuleiro atual do jogo.\n @return O tabuleiro. *\/\nstd::vector<std::string> Game::getCurrentBoard( void ) const{\n return lv.currentBoard;\n}\n\n\/** @brief Define o tabuleiro atual do jogo.\n @param level_ O tabuleiro\n @return True se tiver um tabuleiro; False otherwise. *\/\nbool setCurrentBoard( std::vector<std::string> tabuleiro ){\n lv.currentBoard = tabuleiro;\n}\n\n\/** @brief Recupera as macas comidas do jogo.\n @return A quandiade de macas. *\/\nint Game::getEatenApples( void ) {\n return lv.eatenApples;\n}<commit_msg>pegando macas corretamente<commit_after>\/**\n * @file game.h\n * @brief Arquivo cabeçalho com a implementacao de funcoes\n que controlam o jogo.\n * @author Daniel Barbosa (nome@email.com)\n * @author Jaine Budke (jainebudke@hotmail.com)\n * @since 30\/05\/2017\n * @date 19\/06\/2017\n *\/\n\n\n#include \"game.h\"\n#include \"snake.h\"\n\nLevel lv; \/\/ instanciando classe level\nSnake sk; \/\/ instanciando classe snake\n\n\/\/ ======================================================\n\/\/ ACTIONS\n\/\/ ======================================================\n\n\/** @brief Identifica a posicao inicial da Snake no tabuleiro.\n @return Posicao inicial da Snake *\/\nPosition Game::initialPosition(){\n\n \/\/ Percorre board tentando encontrar inicio\n for( int i = 0 ; i < lv.currentBoard.size() ; i++ ){ \/\/ Percorre cada pos do vector\n for( int j=0 ; j < lv.currentBoard[i].length() ; j++ ){ \/\/ Percorre cada pos da string\n if( lv.currentBoard[i][j] == '*' ){\n Position inicial;\n inicial.x = j; \/\/ coluna\n \t inicial.y = i; \/\/ linha\n lv.initial = inicial;\n \t return inicial;\n }\n }\n }\n\n}\n\n\n\/** @brief Lança uma maçã no jogo, dentro das coordenadas do tabuleiro da fase.\n @return Posicao em que a maçã foi lançada *\/\nPosition Game::throwApple(){\n\n bool invalido = true;\n\n std::srand(std::time(0)); \/\/ semente do rand\n Position tamanho = sizesBoards[lv.currentLevel-1]; \/\/ pega tamanho do level atual\n\n \/\/ sorteia a maçã até cair num espaço livre\n do{\n\n int menor = 1;\n int maiorLinha = tamanho.y -1;\n int maiorColuna = tamanho.x -1;\n\n Position pos;\n\n pos.y = rand()%(maiorLinha-menor+1) + menor; \/\/ sorteia um numero aleatorio para a linha\n pos.x = rand()%(maiorColuna-menor+1) + menor; \/\/ sorteia um numero aleatorio para a coluna\n\n if( isFree(lv.currentBoard[pos.y][pos.x]) ){\n invalido = false;\n lv.currentBoard[pos.y][pos.x] = 'o';\n maca = pos;\n }\n\n } while( invalido );\n\n}\n\n\n\/** @brief Move a cobra de acordo com as coordenadas passadas.\n @return 1 se cobra chegou na maca, bateu na parede ou rabo. 0 otherwise. *\/\nbool Game::moveSnake(){\n\n\n Position dir = sk.listDirections[sk.currentDirection];\n sk.snake.push_front( dir );\n\n Position back = sk.snake.back();\n\n sk.snake.pop_back();\n\n Position front = sk.snake.front();\n\n lv.currentBoard[back.y][back.x] = ' ';\n lv.currentBoard[front.y][front.x] = '~';\n\n\n \/\/ se colidiu de alguma forma\n if( collideTail() or collideWall() ){\n currentState = CRASH;\n return true; \/\/ muda stop pra true\n }\n\n \/\/ se chegou na maçã\n if( eatingApple() ){\n currentState = EXPAND;\n lv.eatenApples += 1;\n return true; \/\/ muda stop pra true\n }\n\n if( sk.listDirections.size() == sk.currentDirection ){\n return true;\n }\n\n sk.currentDirection += 1;\n\n return false; \/\/ muda stop pra false - continua rodando\n\n\n}\n\n\/\/ ======================================================\n\/\/ AUXILIO\n\/\/ ======================================================\n\n\/** @brief Verifica se o caractere passado é uma parede.\n @return 1 se for, 0 se não for *\/\nbool Game::isWall( char ch ){\n return ( ch == '#' );\n}\n\n\/** @brief Verifica se o caractere passado é uma parede invisivel.\n @return 1 se for, 0 se não for *\/\nbool Game::isInvisibleWall( char ch ){\n return ( ch == '.' );\n}\n\n\n\/** @brief Verifica se o caractere passado é um lugar livre.\n @return 1 se for, 0 se não for *\/\nbool Game::isFree( char ch ){\n return ( ch == ' ' );\n}\n\n\/** @brief Verifica se o caractere passado é a posicao inicial.\n @return 1 se for, 0 se não for *\/\nbool Game::isInitialPosition( char ch ){\n return ( ch == '*' );\n}\n\n\n\/** @brief Verifica se a snake colidiu com o tail.\n @return 1 se colidiu, 0 otherwise *\/\nbool Game::collideTail( ){\n\n \/\/ TODO\n\n return false;\n}\n\n\/** @brief Verifica se a snake colidiu com a parede.\n @return 1 se colidiu, 0 otherwise *\/\nbool Game::collideWall( ){\n\n \/\/ TODO\n\n return false;\n}\n\n\/** @brief Verifica se a snake chegou na maca.\n @return 1 se chegou, 0 otherwise *\/\nbool Game::eatingApple( ){\n\n Position pos = sk.snake.front();\n\n if( pos.x == maca.x and pos.y == maca.y ){\n return true;\n } else {\n return false;\n }\n\n}\n\n\n\/\/ ======================================================\n\/\/ ESTADOS\n\/\/ ======================================================\n\n\/** @brief Aumenta o tamanho da cobra. *\/\nvoid Game::expandSnake(){\n\n Position pos = initialPosition();\n\n throwApple();\n\n\n \/\/ SE tamanho da snake for 1 ela é transformada na cobra\n if( sk.sizeSnake == 0 ){\n lv.currentBoard[pos.y][pos.x] = '~';\n sk.snake.push_front( pos );\n\n sk.sizeSnake += 1; \/\/ snake cresce\n }\n\n \/\/ SE tamanho da snake for maior que 1 ela cresce\n if( sk.sizeSnake >= 1 ){\n sk.listDirections.clear();\n sk.currentDirection = 0;\n lv.initial = sk.snake.back();\n sk.sizeSnake += 1; \/\/ snake cresce\n }\n\n \/\/ SE qntidade de maçãs comidas for o total -> STATE = LEVEL_UP\n if( lv.eatenApples == lv.totalApples ){\n currentState = LEVEL_UP;\n }\n\n \/\/ SE qntidade de maçãs comidas for menor que o total -> STATE = RUN e lança maçã\n if( lv.eatenApples < lv.totalApples ){\n currentState = RUN;\n }\n\n}\n\n\n\/** @brief Faz a chamada da próxima fase do jogo setando os valores da classe Level. *\/\nvoid Game::levelUp(){\n\n lv.currentLevel += 1; \/\/ em level é acrescentado um nível\n\n if( lv.currentLevel <= levels ){\n lv.currentBoard = boards[lv.currentLevel-1]; \/\/ recupera o tabuleiro do level\n }\n\n currentState = EXPAND;\n\n}\n\n\n\/** @brief Verifica se a cobra teve alguma colisão. *\/\nbool Game::crashSnake(){\n\n std::cout << \"Oh no! You're crash!\\n\";\n currentState = DEAD;\n\n}\n\n\n\/** @brief Simula a morte da cobra (diminui uma vida). *\/\nvoid Game::deadSnake(){\n\n lives -= 1;\n\n std::cout << \">>> Pressione <ENTER> quando estiver pronto para continuar.\";\n std::string dummy;\n std::getline( std::cin, dummy );\n\n currentState = RUN;\n\n}\n\n\/** @brief A cobra anda a quantidade de vezes até chegar na maçã. *\/\nvoid Game::runSnake(){\n\n sk.solveMaze( lv.currentBoard, lv.initial, sizesBoards[ lv.currentLevel - 1 ], maca );\n\n bool stop = moveSnake();\n\n \/\/ verifica se a condicao de parada foi acionada\n if( stop == false ){\n currentState = RUN;\n }\n\n}\n\n\n\/\/ ======================================================\n\/\/ SETTERS AND GETTERS\n\/\/ ======================================================\n\n\/** @brief Define a quantidade de fases do jogo.\n @param levels_ As fases\n @return True se tiver um numero de fases maior que zero; False otherwise. *\/\nbool Game::setLevels( int levels_ ){\n\tif( levels_ > 0 ){\n\t\tlevels = levels_;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera a quantidade de fases do jogo.\n @return As fases. *\/\nint Game::getLevels( void ) const{\n\treturn levels;\n}\n\n\n\/** @brief Define um vetor com os tabuleiros do jogo.\n @param boards_ Os tabuleiros\n @return True se tiver um numero de tabuleiros maior que zero; False otherwise. *\/\nbool Game::setBoards( std::vector<std::vector<std::string>> boards_ ){\n\tint qntidade = boards_.size();\n\tif( qntidade > 0 ){\n\t\tboards = boards_;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera os tabuleiros do jogo.\n @return Os tabuleiros. *\/\nstd::vector<std::vector<std::string>> Game::getBoards( void ) const{\n\treturn boards;\n}\n\n\n\/** @brief Diminui uma vida do jogador.\n @return True se tinha vidas pra diminuir; False otherwise. *\/\nbool Game::setLives( ){\n\tif( lives > 0 ){\n\t\tlives--;\n\t\treturn true;\n\t} else {\n\t\treturn false;\n\t}\n}\n\n\n\/** @brief Recupera a quantidade de vidas do jogador.\n @return As vidas. *\/\nint Game::getLives( void ) const{\n\treturn lives;\n}\n\n\/** @brief Atualiza status do jogador\n @param state_ O status *\/\nvoid Game::setState( int state_ ){\n\tstate = state_;\n}\n\n\/** @brief Recupera o status do jogador\n @return True se jogador ganhou; False se perdeu *\/\nbool Game::getState( void ) const{\n\tif( state == 1 ){\n\t\treturn true;\n\t}else if( state == 0 ){\n\t\treturn false;\n\t}\n}\n\n\/** @brief Atualiza os tamanhos dos tabuleiros do jogo\n @param sizesBoards_ Vetor com os tamanhos *\/\nvoid Game::setSizeBoards( std::vector<Position> sizesBoards_ ){\n\tsizesBoards = sizesBoards_;\n}\n\n\n\/** @brief Recupera o vetor com os tamanhos *\/\nstd::vector<Position> Game::getSizeBoards( void ) const{\n\treturn sizesBoards;\n}\n\n\/\/ ======================================================\n\/\/ GETTERS AND SETTERS DA CLASSE LEVEL\n\/\/ ======================================================\n\n\n\/** @brief Define a fase atual que o jogador se encontra.\n @param level_ A fase\n @return True se tiver um numero de fases maior que zero; False otherwise. *\/\nbool Game::setCurrentLevel( int level_ ){\n if( level_ > 0 ){\n lv.currentLevel = level_;\n return true;\n } else {\n return false;\n }\n}\n\n\n\/** @brief Recupera a fase atual do jogo.\n @return A fase. *\/\nint Game::getCurrentLevel( void ) const{\n return lv.currentLevel;\n}\n\n\/** @brief Recupera o tabuleiro atual do jogo.\n @return O tabuleiro. *\/\nstd::vector<std::string> Game::getCurrentBoard( void ) const{\n return lv.currentBoard;\n}\n\n\/** @brief Define o tabuleiro atual do jogo.\n @param level_ O tabuleiro\n @return True se tiver um tabuleiro; False otherwise. *\/\nbool setCurrentBoard( std::vector<std::string> tabuleiro ){\n lv.currentBoard = tabuleiro;\n}\n\n\/** @brief Recupera as macas comidas do jogo.\n @return A quandiade de macas. *\/\nint Game::getEatenApples( void ) {\n return lv.eatenApples;\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the AzerothCore Project. See AUTHORS file for Copyright information\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the\n * Free Software Foundation; either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GameTime.h\"\n#include \"Player.h\"\n#include \"ScriptedGossip.h\"\n#include \"ScriptedCreature.h\"\n#include \"ScriptMgr.h\"\n#include \"SpellScript.h\"\n#include \"TaskScheduler.h\"\n\nenum Say\n{\n SAY_TELEPORT = 0,\n SAY_AGGRO,\n SAY_KILL,\n};\n\nenum Spells\n{\n SPELL_MARK_OF_FROST = 23182,\n SPELL_MARK_OF_FROST_AURA = 23184,\n SPELL_AURA_OF_FROST = 23186,\n SPELL_MANA_STORM = 21097,\n SPELL_CHILL = 21098,\n SPELL_FROST_BREATH = 21099,\n SPELL_REFLECT = 22067,\n SPELL_CLEAVE = 19983,\n SPELL_ARCANE_VACUUM = 21147,\n SPELL_ARCANE_VACUUM_TP = 21150\n};\n\nclass boss_azuregos : public CreatureScript\n{\npublic:\n\n boss_azuregos() : CreatureScript(\"boss_azuregos\") { }\n\n struct boss_azuregosAI : public ScriptedAI\n {\n boss_azuregosAI(Creature* creature) : ScriptedAI(creature)\n {\n _scheduler.SetValidator([this]\n {\n return !me->HasUnitState(UNIT_STATE_CASTING);\n });\n }\n\n void Reset() override\n {\n _scheduler.CancelAll();\n me->SetNpcFlag(UNIT_NPC_FLAG_GOSSIP);\n me->RestoreFaction();\n me->GetMap()->DoForAllPlayers([&](Player* p)\n {\n if (p->GetZoneId() == me->GetZoneId())\n {\n\n p->RemoveAurasDueToSpell(SPELL_AURA_OF_FROST);\n p->RemoveAurasDueToSpell(SPELL_CHILL);\n p->RemoveAurasDueToSpell(SPELL_FROST_BREATH);\n }\n });\n }\n\n void KilledUnit(Unit* victim) override\n {\n if (victim && victim->GetTypeId() == TYPEID_PLAYER)\n {\n Talk(SAY_KILL);\n victim->CastSpell(victim, SPELL_MARK_OF_FROST, true);\n }\n }\n\n void EnterCombat(Unit* \/*who*\/) override\n {\n DoCastSelf(SPELL_MARK_OF_FROST_AURA);\n Talk(SAY_AGGRO);\n\n _scheduler\n .Schedule(7s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_CLEAVE);\n context.Repeat(7s);\n })\n .Schedule(5s, 17s, [this](TaskContext context)\n {\n DoCastRandomTarget(SPELL_MANA_STORM);\n context.Repeat(7s, 13s);\n })\n .Schedule(10s, 30s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_CHILL);\n context.Repeat(13s, 25s);\n })\n .Schedule(2s, 8s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_FROST_BREATH);\n context.Repeat(10s, 15s);\n })\n .Schedule(30s, [this](TaskContext context)\n {\n Talk(SAY_TELEPORT);\n DoCastAOE(SPELL_ARCANE_VACUUM);\n context.Repeat(30s);\n })\n .Schedule(15s, 30s, [this](TaskContext context)\n {\n DoCastSelf(SPELL_REFLECT);\n context.Repeat(20s, 35s);\n });\n }\n\n void JustDied(Unit* \/*killer*\/) override\n {\n me->RemoveAurasDueToSpell(SPELL_MARK_OF_FROST);\n me->GetMap()->DoForAllPlayers([&](Player* p)\n {\n if (p->GetZoneId() == me->GetZoneId())\n {\n\n p->RemoveAurasDueToSpell(SPELL_MARK_OF_FROST);\n p->RemoveAurasDueToSpell(SPELL_AURA_OF_FROST);\n p->RemoveAurasDueToSpell(SPELL_CHILL);\n p->RemoveAurasDueToSpell(SPELL_FROST_BREATH);\n }\n });\n\n me->SetRespawnTime(urand(2 * DAY, 3 * DAY));\n me->SaveRespawnTime();\n }\n\n void UpdateAI(uint32 diff) override\n {\n if (!UpdateVictim())\n {\n return;\n }\n\n _scheduler.Update(diff, [this]\n {\n DoMeleeAttackIfReady();\n });\n }\n\n protected:\n TaskScheduler _scheduler;\n };\n\n bool OnGossipSelect(Player* player, Creature* creature, uint32 \/*sender*\/, uint32 \/*action*\/) override\n {\n CloseGossipMenuFor(player);\n creature->SetFaction(FACTION_ENEMY);\n creature->AI()->AttackStart(player);\n return true;\n }\n\n CreatureAI* GetAI(Creature* creature) const override\n {\n return new boss_azuregosAI(creature);\n }\n};\n\n\/\/ Arcane Vacuum: 21147\nclass spell_arcane_vacuum : public SpellScript\n{\n PrepareSpellScript(spell_arcane_vacuum);\n\n bool Validate(SpellInfo const* \/*spellInfo*\/) override\n {\n return ValidateSpellInfo({ SPELL_ARCANE_VACUUM_TP });\n }\n\n void HandleOnHit()\n {\n Unit* caster = GetCaster();\n Unit* hitUnit = GetHitUnit();\n if (caster && hitUnit && hitUnit->ToPlayer())\n {\n caster->GetThreatMgr().modifyThreatPercent(hitUnit, -100);\n caster->CastSpell(hitUnit, SPELL_ARCANE_VACUUM_TP, true);\n }\n }\n\n void Register() override\n {\n OnHit += SpellHitFn(spell_arcane_vacuum::HandleOnHit);\n }\n};\n\n\/\/ Mark of Frost - Triggered Spell\nclass spell_mark_of_frost_freeze : public SpellScript\n{\n PrepareSpellScript(spell_mark_of_frost_freeze);\n\n bool Validate(SpellInfo const* \/*spellInfo*\/) override\n {\n return ValidateSpellInfo({ SPELL_MARK_OF_FROST, SPELL_AURA_OF_FROST });\n }\n\n void HandleOnHit()\n {\n Unit* caster = GetCaster();\n Unit* hitUnit = GetHitUnit();\n if (caster && hitUnit && hitUnit->HasAura(SPELL_MARK_OF_FROST) && !hitUnit->HasAura(SPELL_AURA_OF_FROST))\n {\n hitUnit->CastSpell(hitUnit, SPELL_AURA_OF_FROST, true);\n }\n }\n\n void Register() override\n {\n OnHit += SpellHitFn(spell_mark_of_frost_freeze::HandleOnHit);\n }\n};\n\nvoid AddSC_boss_azuregos()\n{\n new boss_azuregos();\n RegisterSpellScript(spell_arcane_vacuum);\n RegisterSpellScript(spell_mark_of_frost_freeze);\n}\n<commit_msg>fix(Scripts\/Azuregos): mark of frost should be removed on reset (#12053)<commit_after>\/*\n * This file is part of the AzerothCore Project. See AUTHORS file for Copyright information\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the\n * Free Software Foundation; either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"GameTime.h\"\n#include \"Player.h\"\n#include \"ScriptedGossip.h\"\n#include \"ScriptedCreature.h\"\n#include \"ScriptMgr.h\"\n#include \"SpellScript.h\"\n#include \"TaskScheduler.h\"\n\nenum Say\n{\n SAY_TELEPORT = 0,\n SAY_AGGRO,\n SAY_KILL,\n};\n\nenum Spells\n{\n SPELL_MARK_OF_FROST = 23182,\n SPELL_MARK_OF_FROST_AURA = 23184,\n SPELL_AURA_OF_FROST = 23186,\n SPELL_MANA_STORM = 21097,\n SPELL_CHILL = 21098,\n SPELL_FROST_BREATH = 21099,\n SPELL_REFLECT = 22067,\n SPELL_CLEAVE = 19983,\n SPELL_ARCANE_VACUUM = 21147,\n SPELL_ARCANE_VACUUM_TP = 21150\n};\n\nclass boss_azuregos : public CreatureScript\n{\npublic:\n\n boss_azuregos() : CreatureScript(\"boss_azuregos\") { }\n\n struct boss_azuregosAI : public ScriptedAI\n {\n boss_azuregosAI(Creature* creature) : ScriptedAI(creature)\n {\n _scheduler.SetValidator([this]\n {\n return !me->HasUnitState(UNIT_STATE_CASTING);\n });\n }\n\n void Reset() override\n {\n _scheduler.CancelAll();\n me->SetNpcFlag(UNIT_NPC_FLAG_GOSSIP);\n me->RestoreFaction();\n me->GetMap()->DoForAllPlayers([&](Player* p)\n {\n if (p->GetZoneId() == me->GetZoneId())\n {\n p->RemoveAurasDueToSpell(SPELL_CHILL);\n p->RemoveAurasDueToSpell(SPELL_FROST_BREATH);\n }\n });\n }\n\n void KilledUnit(Unit* victim) override\n {\n if (victim && victim->GetTypeId() == TYPEID_PLAYER)\n {\n Talk(SAY_KILL);\n victim->CastSpell(victim, SPELL_MARK_OF_FROST, true);\n }\n }\n\n void EnterCombat(Unit* \/*who*\/) override\n {\n DoCastSelf(SPELL_MARK_OF_FROST_AURA);\n Talk(SAY_AGGRO);\n\n _scheduler\n .Schedule(7s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_CLEAVE);\n context.Repeat(7s);\n })\n .Schedule(5s, 17s, [this](TaskContext context)\n {\n DoCastRandomTarget(SPELL_MANA_STORM);\n context.Repeat(7s, 13s);\n })\n .Schedule(10s, 30s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_CHILL);\n context.Repeat(13s, 25s);\n })\n .Schedule(2s, 8s, [this](TaskContext context)\n {\n DoCastVictim(SPELL_FROST_BREATH);\n context.Repeat(10s, 15s);\n })\n .Schedule(30s, [this](TaskContext context)\n {\n Talk(SAY_TELEPORT);\n DoCastAOE(SPELL_ARCANE_VACUUM);\n context.Repeat(30s);\n })\n .Schedule(15s, 30s, [this](TaskContext context)\n {\n DoCastSelf(SPELL_REFLECT);\n context.Repeat(20s, 35s);\n });\n }\n\n void JustDied(Unit* \/*killer*\/) override\n {\n me->RemoveAurasDueToSpell(SPELL_MARK_OF_FROST);\n me->GetMap()->DoForAllPlayers([&](Player* p)\n {\n if (p->GetZoneId() == me->GetZoneId())\n {\n\n p->RemoveAurasDueToSpell(SPELL_MARK_OF_FROST);\n p->RemoveAurasDueToSpell(SPELL_AURA_OF_FROST);\n p->RemoveAurasDueToSpell(SPELL_CHILL);\n p->RemoveAurasDueToSpell(SPELL_FROST_BREATH);\n }\n });\n\n me->SetRespawnTime(urand(2 * DAY, 3 * DAY));\n me->SaveRespawnTime();\n }\n\n void UpdateAI(uint32 diff) override\n {\n if (!UpdateVictim())\n {\n return;\n }\n\n _scheduler.Update(diff, [this]\n {\n DoMeleeAttackIfReady();\n });\n }\n\n protected:\n TaskScheduler _scheduler;\n };\n\n bool OnGossipSelect(Player* player, Creature* creature, uint32 \/*sender*\/, uint32 \/*action*\/) override\n {\n CloseGossipMenuFor(player);\n creature->SetFaction(FACTION_ENEMY);\n creature->AI()->AttackStart(player);\n return true;\n }\n\n CreatureAI* GetAI(Creature* creature) const override\n {\n return new boss_azuregosAI(creature);\n }\n};\n\n\/\/ Arcane Vacuum: 21147\nclass spell_arcane_vacuum : public SpellScript\n{\n PrepareSpellScript(spell_arcane_vacuum);\n\n bool Validate(SpellInfo const* \/*spellInfo*\/) override\n {\n return ValidateSpellInfo({ SPELL_ARCANE_VACUUM_TP });\n }\n\n void HandleOnHit()\n {\n Unit* caster = GetCaster();\n Unit* hitUnit = GetHitUnit();\n if (caster && hitUnit && hitUnit->ToPlayer())\n {\n caster->GetThreatMgr().modifyThreatPercent(hitUnit, -100);\n caster->CastSpell(hitUnit, SPELL_ARCANE_VACUUM_TP, true);\n }\n }\n\n void Register() override\n {\n OnHit += SpellHitFn(spell_arcane_vacuum::HandleOnHit);\n }\n};\n\n\/\/ Mark of Frost - Triggered Spell\nclass spell_mark_of_frost_freeze : public SpellScript\n{\n PrepareSpellScript(spell_mark_of_frost_freeze);\n\n bool Validate(SpellInfo const* \/*spellInfo*\/) override\n {\n return ValidateSpellInfo({ SPELL_MARK_OF_FROST, SPELL_AURA_OF_FROST });\n }\n\n void HandleOnHit()\n {\n Unit* caster = GetCaster();\n Unit* hitUnit = GetHitUnit();\n if (caster && hitUnit && hitUnit->HasAura(SPELL_MARK_OF_FROST) && !hitUnit->HasAura(SPELL_AURA_OF_FROST))\n {\n hitUnit->CastSpell(hitUnit, SPELL_AURA_OF_FROST, true);\n }\n }\n\n void Register() override\n {\n OnHit += SpellHitFn(spell_mark_of_frost_freeze::HandleOnHit);\n }\n};\n\nvoid AddSC_boss_azuregos()\n{\n new boss_azuregos();\n RegisterSpellScript(spell_arcane_vacuum);\n RegisterSpellScript(spell_mark_of_frost_freeze);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <windows.h>\n#include <mmsystem.h>\n#include <process.h>\n\n#include \"base\/time.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nclass MockTimeTicks : public TimeTicks {\n public:\n static DWORD Ticker() {\n return static_cast<int>(InterlockedIncrement(&ticker_));\n }\n\n static void InstallTicker() {\n old_tick_function_ = SetMockTickFunction(&Ticker);\n ticker_ = -5;\n }\n\n static void UninstallTicker() {\n SetMockTickFunction(old_tick_function_);\n }\n\n private:\n static volatile LONG ticker_;\n static TickFunctionType old_tick_function_;\n};\n\nvolatile LONG MockTimeTicks::ticker_;\nMockTimeTicks::TickFunctionType MockTimeTicks::old_tick_function_;\n\nHANDLE g_rollover_test_start;\n\nunsigned __stdcall RolloverTestThreadMain(void* param) {\n int64 counter = reinterpret_cast<int64>(param);\n DWORD rv = WaitForSingleObject(g_rollover_test_start, INFINITE);\n EXPECT_EQ(rv, WAIT_OBJECT_0);\n\n TimeTicks last = TimeTicks::Now();\n for (int index = 0; index < counter; index++) {\n TimeTicks now = TimeTicks::Now();\n int64 milliseconds = (now - last).InMilliseconds();\n \/\/ This is a tight loop; we could have looped faster than our\n \/\/ measurements, so the time might be 0 millis.\n EXPECT_GE(milliseconds, 0);\n EXPECT_LT(milliseconds, 250);\n last = now;\n }\n return 0;\n}\n\n} \/\/ namespace\n\nTEST(TimeTicks, WinRollover) {\n \/\/ The internal counter rolls over at ~49days. We'll use a mock\n \/\/ timer to test this case.\n \/\/ Basic test algorithm:\n \/\/ 1) Set clock to rollover - N\n \/\/ 2) Create N threads\n \/\/ 3) Start the threads\n \/\/ 4) Each thread loops through TimeTicks() N times\n \/\/ 5) Each thread verifies integrity of result.\n\n const int kThreads = 8;\n \/\/ Use int64 so we can cast into a void* without a compiler warning.\n const int64 kChecks = 10;\n\n \/\/ It takes a lot of iterations to reproduce the bug!\n \/\/ (See bug 1081395)\n for (int loop = 0; loop < 4096; loop++) {\n \/\/ Setup\n MockTimeTicks::InstallTicker();\n g_rollover_test_start = CreateEvent(0, TRUE, FALSE, 0);\n HANDLE threads[kThreads];\n\n for (int index = 0; index < kThreads; index++) {\n void* argument = reinterpret_cast<void*>(kChecks);\n unsigned thread_id;\n threads[index] = reinterpret_cast<HANDLE>(\n _beginthreadex(NULL, 0, RolloverTestThreadMain, argument, 0,\n &thread_id));\n EXPECT_NE((HANDLE)NULL, threads[index]);\n }\n\n \/\/ Start!\n SetEvent(g_rollover_test_start);\n\n \/\/ Wait for threads to finish\n for (int index = 0; index < kThreads; index++) {\n DWORD rv = WaitForSingleObject(threads[index], INFINITE);\n EXPECT_EQ(rv, WAIT_OBJECT_0);\n }\n\n CloseHandle(g_rollover_test_start);\n\n \/\/ Teardown\n MockTimeTicks::UninstallTicker();\n }\n}\n\nTEST(TimeTicks, SubMillisecondTimers) {\n \/\/ Loop for a bit getting timers quickly. We want to\n \/\/ see at least one case where we get a new sample in \n \/\/ less than one millisecond.\n bool saw_submillisecond_timer = false;\n int64 min_timer = 1000;\n TimeTicks last_time = TimeTicks::HighResNow();\n for (int index = 0; index < 1000; index++) {\n TimeTicks now = TimeTicks::HighResNow();\n TimeDelta delta = now - last_time;\n if (delta.InMicroseconds() > 0 &&\n delta.InMicroseconds() < 1000) {\n if (min_timer > delta.InMicroseconds())\n min_timer = delta.InMicroseconds();\n saw_submillisecond_timer = true;\n }\n last_time = now;\n }\n EXPECT_TRUE(saw_submillisecond_timer);\n printf(\"Min timer is: %dus\\n\", min_timer);\n}\n\nTEST(TimeTicks, TimeGetTimeCaps) {\n \/\/ Test some basic assumptions that we expect about how timeGetDevCaps works.\n\n TIMECAPS caps;\n MMRESULT status = timeGetDevCaps(&caps, sizeof(caps));\n EXPECT_EQ(TIMERR_NOERROR, status);\n if (status != TIMERR_NOERROR) {\n printf(\"Could not get timeGetDevCaps\\n\");\n return;\n }\n\n EXPECT_GE(static_cast<int>(caps.wPeriodMin), 1);\n EXPECT_GT(static_cast<int>(caps.wPeriodMax), 1);\n EXPECT_GE(static_cast<int>(caps.wPeriodMin), 1);\n EXPECT_GT(static_cast<int>(caps.wPeriodMax), 1);\n printf(\"timeGetTime range is %d to %dms\\n\", caps.wPeriodMin,\n caps.wPeriodMax);\n}\n\nTEST(TimeTicks, QueryPerformanceFrequency) {\n \/\/ Test some basic assumptions that we expect about QPC.\n\n LARGE_INTEGER frequency;\n BOOL rv = QueryPerformanceFrequency(&frequency);\n EXPECT_EQ(TRUE, rv);\n EXPECT_GT(frequency.QuadPart, 1000000); \/\/ Expect at least 1MHz\n printf(\"QueryPerformanceFrequency is %5.2fMHz\\n\",\n frequency.QuadPart \/ 1000000.0);\n}\n\nTEST(TimeTicks, TimerPerformance) {\n \/\/ Verify that various timer mechanisms can always complete quickly.\n \/\/ Note: This is a somewhat arbitrary test.\n const int kLoops = 10000;\n const int kMaxTime = 10; \/\/ Maximum acceptible milliseconds for test.\n\n typedef TimeTicks (*TestFunc)();\n struct TestCase {\n TestFunc func;\n char *description;\n };\n \/\/ Cheating a bit here: assumes sizeof(TimeTicks) == sizeof(Time)\n \/\/ in order to create a single test case list.\n COMPILE_ASSERT(sizeof(TimeTicks) == sizeof(Time), \n test_only_works_with_same_sizes);\n TestCase cases[] = { \n { reinterpret_cast<TestFunc>(Time::Now), \"Time::Now\" },\n { TimeTicks::Now, \"TimeTicks::Now\" },\n { TimeTicks::HighResNow, \"TimeTicks::HighResNow\" },\n { NULL, \"\" }\n };\n\n int test_case = 0;\n while (cases[test_case].func) {\n TimeTicks start = TimeTicks::HighResNow();\n for (int index = 0; index < kLoops; index++)\n cases[test_case].func();\n TimeTicks stop = TimeTicks::HighResNow();\n EXPECT_LT((stop - start).InMilliseconds(), kMaxTime);\n printf(\"%s: %1.2fus per call\\n\", cases[test_case].description, \n (stop - start).InMillisecondsF() * 1000 \/ kLoops);\n test_case++;\n }\n}\n<commit_msg>Increase min throttle on the new timer performance test. This is an arbitrary timer, but these tests run slower than I expected on the bbots.<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <windows.h>\n#include <mmsystem.h>\n#include <process.h>\n\n#include \"base\/time.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace {\n\nclass MockTimeTicks : public TimeTicks {\n public:\n static DWORD Ticker() {\n return static_cast<int>(InterlockedIncrement(&ticker_));\n }\n\n static void InstallTicker() {\n old_tick_function_ = SetMockTickFunction(&Ticker);\n ticker_ = -5;\n }\n\n static void UninstallTicker() {\n SetMockTickFunction(old_tick_function_);\n }\n\n private:\n static volatile LONG ticker_;\n static TickFunctionType old_tick_function_;\n};\n\nvolatile LONG MockTimeTicks::ticker_;\nMockTimeTicks::TickFunctionType MockTimeTicks::old_tick_function_;\n\nHANDLE g_rollover_test_start;\n\nunsigned __stdcall RolloverTestThreadMain(void* param) {\n int64 counter = reinterpret_cast<int64>(param);\n DWORD rv = WaitForSingleObject(g_rollover_test_start, INFINITE);\n EXPECT_EQ(rv, WAIT_OBJECT_0);\n\n TimeTicks last = TimeTicks::Now();\n for (int index = 0; index < counter; index++) {\n TimeTicks now = TimeTicks::Now();\n int64 milliseconds = (now - last).InMilliseconds();\n \/\/ This is a tight loop; we could have looped faster than our\n \/\/ measurements, so the time might be 0 millis.\n EXPECT_GE(milliseconds, 0);\n EXPECT_LT(milliseconds, 250);\n last = now;\n }\n return 0;\n}\n\n} \/\/ namespace\n\nTEST(TimeTicks, WinRollover) {\n \/\/ The internal counter rolls over at ~49days. We'll use a mock\n \/\/ timer to test this case.\n \/\/ Basic test algorithm:\n \/\/ 1) Set clock to rollover - N\n \/\/ 2) Create N threads\n \/\/ 3) Start the threads\n \/\/ 4) Each thread loops through TimeTicks() N times\n \/\/ 5) Each thread verifies integrity of result.\n\n const int kThreads = 8;\n \/\/ Use int64 so we can cast into a void* without a compiler warning.\n const int64 kChecks = 10;\n\n \/\/ It takes a lot of iterations to reproduce the bug!\n \/\/ (See bug 1081395)\n for (int loop = 0; loop < 4096; loop++) {\n \/\/ Setup\n MockTimeTicks::InstallTicker();\n g_rollover_test_start = CreateEvent(0, TRUE, FALSE, 0);\n HANDLE threads[kThreads];\n\n for (int index = 0; index < kThreads; index++) {\n void* argument = reinterpret_cast<void*>(kChecks);\n unsigned thread_id;\n threads[index] = reinterpret_cast<HANDLE>(\n _beginthreadex(NULL, 0, RolloverTestThreadMain, argument, 0,\n &thread_id));\n EXPECT_NE((HANDLE)NULL, threads[index]);\n }\n\n \/\/ Start!\n SetEvent(g_rollover_test_start);\n\n \/\/ Wait for threads to finish\n for (int index = 0; index < kThreads; index++) {\n DWORD rv = WaitForSingleObject(threads[index], INFINITE);\n EXPECT_EQ(rv, WAIT_OBJECT_0);\n }\n\n CloseHandle(g_rollover_test_start);\n\n \/\/ Teardown\n MockTimeTicks::UninstallTicker();\n }\n}\n\nTEST(TimeTicks, SubMillisecondTimers) {\n \/\/ Loop for a bit getting timers quickly. We want to\n \/\/ see at least one case where we get a new sample in \n \/\/ less than one millisecond.\n bool saw_submillisecond_timer = false;\n int64 min_timer = 1000;\n TimeTicks last_time = TimeTicks::HighResNow();\n for (int index = 0; index < 1000; index++) {\n TimeTicks now = TimeTicks::HighResNow();\n TimeDelta delta = now - last_time;\n if (delta.InMicroseconds() > 0 &&\n delta.InMicroseconds() < 1000) {\n if (min_timer > delta.InMicroseconds())\n min_timer = delta.InMicroseconds();\n saw_submillisecond_timer = true;\n }\n last_time = now;\n }\n EXPECT_TRUE(saw_submillisecond_timer);\n printf(\"Min timer is: %dus\\n\", min_timer);\n}\n\nTEST(TimeTicks, TimeGetTimeCaps) {\n \/\/ Test some basic assumptions that we expect about how timeGetDevCaps works.\n\n TIMECAPS caps;\n MMRESULT status = timeGetDevCaps(&caps, sizeof(caps));\n EXPECT_EQ(TIMERR_NOERROR, status);\n if (status != TIMERR_NOERROR) {\n printf(\"Could not get timeGetDevCaps\\n\");\n return;\n }\n\n EXPECT_GE(static_cast<int>(caps.wPeriodMin), 1);\n EXPECT_GT(static_cast<int>(caps.wPeriodMax), 1);\n EXPECT_GE(static_cast<int>(caps.wPeriodMin), 1);\n EXPECT_GT(static_cast<int>(caps.wPeriodMax), 1);\n printf(\"timeGetTime range is %d to %dms\\n\", caps.wPeriodMin,\n caps.wPeriodMax);\n}\n\nTEST(TimeTicks, QueryPerformanceFrequency) {\n \/\/ Test some basic assumptions that we expect about QPC.\n\n LARGE_INTEGER frequency;\n BOOL rv = QueryPerformanceFrequency(&frequency);\n EXPECT_EQ(TRUE, rv);\n EXPECT_GT(frequency.QuadPart, 1000000); \/\/ Expect at least 1MHz\n printf(\"QueryPerformanceFrequency is %5.2fMHz\\n\",\n frequency.QuadPart \/ 1000000.0);\n}\n\nTEST(TimeTicks, TimerPerformance) {\n \/\/ Verify that various timer mechanisms can always complete quickly.\n \/\/ Note: This is a somewhat arbitrary test.\n const int kLoops = 10000;\n \/\/ Due to the fact that these run on bbots, which are horribly slow,\n \/\/ we can't really make any guarantees about minimum runtime.\n \/\/ Really, we want these to finish in ~10ms, and that is generous.\n const int kMaxTime = 35; \/\/ Maximum acceptible milliseconds for test.\n\n typedef TimeTicks (*TestFunc)();\n struct TestCase {\n TestFunc func;\n char *description;\n };\n \/\/ Cheating a bit here: assumes sizeof(TimeTicks) == sizeof(Time)\n \/\/ in order to create a single test case list.\n COMPILE_ASSERT(sizeof(TimeTicks) == sizeof(Time), \n test_only_works_with_same_sizes);\n TestCase cases[] = { \n { reinterpret_cast<TestFunc>(Time::Now), \"Time::Now\" },\n { TimeTicks::Now, \"TimeTicks::Now\" },\n { TimeTicks::HighResNow, \"TimeTicks::HighResNow\" },\n { NULL, \"\" }\n };\n\n int test_case = 0;\n while (cases[test_case].func) {\n TimeTicks start = TimeTicks::HighResNow();\n for (int index = 0; index < kLoops; index++)\n cases[test_case].func();\n TimeTicks stop = TimeTicks::HighResNow();\n EXPECT_LT((stop - start).InMilliseconds(), kMaxTime);\n printf(\"%s: %1.2fus per call\\n\", cases[test_case].description, \n (stop - start).InMillisecondsF() * 1000 \/ kLoops);\n test_case++;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cliptest.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2007-07-05 08:56:07 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ autogenerated file with codegen.pl\n\n#include <cppunit\/simpleheader.hxx>\n\n#include <basegfx\/vector\/b2isize.hxx>\n#include <basegfx\/point\/b2ipoint.hxx>\n#include <basegfx\/range\/b2drange.hxx>\n#include <basegfx\/range\/b2irange.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#include <basegfx\/polygon\/b2dpolypolygontools.hxx>\n\n#include <basebmp\/color.hxx>\n#include <basebmp\/scanlineformats.hxx>\n#include <basebmp\/bitmapdevice.hxx>\n#include <basebmp\/debug.hxx>\n#include \"tools.hxx\"\n\n#include <iostream>\n#include <fstream>\n\nusing namespace ::basebmp;\n\nnamespace\n{\n\/*\n std::ofstream output(\"32bpp_test.dump\");\n debugDump( mpDevice32bpp, output );\n*\/\n\nclass ClipTest : public CppUnit::TestFixture\n{\nprivate:\n BitmapDeviceSharedPtr mpClipMask;\n BitmapDeviceSharedPtr mpDevice1bpp;\n BitmapDeviceSharedPtr mpDevice32bpp;\n\n void implTestPixelClip(const BitmapDeviceSharedPtr& rDevice)\n {\n const Color aBgCol(0);\n rDevice->clear(aBgCol);\n\n const basegfx::B2IPoint aPt(0,0);\n const Color aCol(0xFFFFFFFF);\n rDevice->setPixel( aPt, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #1\",\n rDevice->getPixel(aPt) == aBgCol);\n\n const basegfx::B2IPoint aPt2(10,10);\n rDevice->setPixel( aPt2, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #2\",\n rDevice->getPixel(aPt2) == aBgCol);\n\n const basegfx::B2IPoint aPt1(10,0);\n rDevice->setPixel( aPt1, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #3\",\n rDevice->getPixel(aPt1) != aBgCol);\n\n const basegfx::B2IPoint aPt3(0,10);\n rDevice->setPixel( aPt3, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #4\",\n rDevice->getPixel(aPt3) != aBgCol);\n }\n\n void implTestLineClip(const BitmapDeviceSharedPtr& rDevice)\n {\n const Color aBgCol(0);\n rDevice->clear(aBgCol);\n\n const basegfx::B2IPoint aPt1(0,0);\n const basegfx::B2IPoint aPt2(1,9);\n const Color aCol(0xFFFFFFFF);\n rDevice->drawLine( aPt1, aPt2, aCol, DrawMode_PAINT, mpClipMask );\n\n const basegfx::B2IPoint aPt3(1,5);\n CPPUNIT_ASSERT_MESSAGE(\"get line pixel\",\n rDevice->getPixel(aPt3) != aBgCol);\n CPPUNIT_ASSERT_MESSAGE(\"number of rendered line pixel is not 4\",\n countPixel( rDevice,\n rDevice->getPixel(aPt3) ) == 4);\n\n rDevice->drawLine( aPt1, aPt2, aCol, DrawMode_XOR, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"number of xor-rendered line pixel is not 0\",\n countPixel( rDevice,\n rDevice->getPixel(aPt3) ) == 121);\n }\n\n void implTestFillClip(const BitmapDeviceSharedPtr& rDevice)\n {\n rDevice->clear(Color(0));\n\n const basegfx::B2DRange aAllOver(-10,-10,20,20);\n const Color aCol(0xFFFFFFFF);\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_PAINT,\n mpClipMask );\n const basegfx::B2IPoint aPt(0,10);\n CPPUNIT_ASSERT_MESSAGE(\"number of clipped pixel is not 30\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121-30);\n\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_PAINT );\n CPPUNIT_ASSERT_MESSAGE(\"number of filled pixel is not 121\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121);\n\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_XOR,\n mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"number of xor-cleared pixel is not 91\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121-30);\n }\n\n void implTestBmpClip(const BitmapDeviceSharedPtr& rDevice)\n {\n BitmapDeviceSharedPtr pBmp( cloneBitmapDevice(\n basegfx::B2IVector(3,3),\n rDevice ));\n Color aCol1(0);\n Color aCol2(0xFFFFFFFF);\n pBmp->clear(aCol1);\n pBmp->setPixel(basegfx::B2IPoint(0,0),aCol2,DrawMode_PAINT);\n pBmp->setPixel(basegfx::B2IPoint(1,1),aCol2,DrawMode_PAINT);\n pBmp->setPixel(basegfx::B2IPoint(2,2),aCol2,basebmp::DrawMode_PAINT);\n\n rDevice->clear(aCol1);\n rDevice->drawBitmap(pBmp,\n basegfx::B2IRange(0,0,3,3),\n basegfx::B2IRange(-1,-1,4,4),\n DrawMode_PAINT,\n mpClipMask);\n\n const basegfx::B2IPoint aPt(1,1);\n CPPUNIT_ASSERT_MESSAGE(\"number of clipped pixel is not 5\",\n countPixel( rDevice,\n rDevice->getPixel(aPt) ) == 5);\n }\n\n void implTestMaskColorClip(const BitmapDeviceSharedPtr& rDevice)\n {\n BitmapDeviceSharedPtr pBmp( createBitmapDevice( rDevice->getSize(),\n true,\n Format::EIGHT_BIT_GREY ));\n\n ::rtl::OUString aSvg = ::rtl::OUString::createFromAscii(\n \"m 0 0h5v10h5v-5h-10z\" );\n\n basegfx::B2DPolyPolygon aPoly;\n basegfx::tools::importFromSvgD( aPoly, aSvg );\n const basebmp::Color aCol(0xFF);\n pBmp->clear( basebmp::Color(0) );\n pBmp->fillPolyPolygon(\n aPoly,\n aCol,\n basebmp::DrawMode_PAINT );\n\n const basegfx::B2IRange aSourceRect(0,0,10,10);\n const basegfx::B2IPoint aDestLeftTop(0,0);\n const Color aCol2(0xF0F0F0F0);\n rDevice->drawMaskedColor(\n aCol2,\n pBmp,\n aSourceRect,\n aDestLeftTop,\n mpClipMask );\n const basegfx::B2IPoint aPt(1,1);\n CPPUNIT_ASSERT_MESSAGE(\"number of rendered pixel is not 41\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 41);\n\n }\n\npublic:\n void setUp()\n {\n const basegfx::B2ISize aSize(11,11);\n mpClipMask = createBitmapDevice( aSize,\n true,\n Format::ONE_BIT_MSB_GREY );\n mpDevice1bpp = createBitmapDevice( aSize,\n true,\n Format::ONE_BIT_MSB_PAL );\n mpDevice32bpp = createBitmapDevice( aSize,\n true,\n Format::THIRTYTWO_BIT_TC_MASK );\n\n ::rtl::OUString aSvg = ::rtl::OUString::createFromAscii(\n \"m 0 0 h5 l5 5 v5 h-5 l-5-5 z\" );\n basegfx::B2DPolyPolygon aPoly;\n basegfx::tools::importFromSvgD( aPoly, aSvg );\n mpClipMask->clear(Color(0));\n mpClipMask->drawPolygon(\n aPoly.getB2DPolygon(0),\n Color(0xFFFFFFFF),\n DrawMode_PAINT );\n }\n\n void testPixelClip()\n {\n implTestPixelClip( mpDevice1bpp );\n implTestPixelClip( mpDevice32bpp );\n }\n\n void testLineClip()\n {\n implTestLineClip( mpDevice1bpp );\n implTestLineClip( mpDevice32bpp );\n }\n\n void testFillClip()\n {\n implTestFillClip( mpDevice1bpp );\n implTestFillClip( mpDevice32bpp );\n }\n\n void testBmpClip()\n {\n implTestBmpClip( mpDevice1bpp );\n implTestBmpClip( mpDevice32bpp );\n }\n\n void testMaskColorClip()\n {\n implTestMaskColorClip( mpDevice1bpp );\n implTestMaskColorClip( mpDevice32bpp );\n }\n\n \/\/ Change the following lines only, if you add, remove or rename\n \/\/ member functions of the current class,\n \/\/ because these macros are need by auto register mechanism.\n\n CPPUNIT_TEST_SUITE(ClipTest);\n CPPUNIT_TEST(testPixelClip);\n CPPUNIT_TEST(testLineClip);\n CPPUNIT_TEST(testFillClip);\n CPPUNIT_TEST(testBmpClip);\n CPPUNIT_TEST(testMaskColorClip);\n CPPUNIT_TEST_SUITE_END();\n};\n\n\/\/ -----------------------------------------------------------------------------\nCPPUNIT_TEST_SUITE_NAMED_REGISTRATION(ClipTest, \"ClipTest\");\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ this macro creates an empty function, which will called by the RegisterAllFunctions()\n\/\/ to let the user the possibility to also register some functions by hand.\n\/\/NOADDITIONAL;\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.5.24); FILE MERGED 2008\/03\/31 13:07:57 rt 1.5.24.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cliptest.cxx,v $\n * $Revision: 1.6 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ autogenerated file with codegen.pl\n\n#include <cppunit\/simpleheader.hxx>\n\n#include <basegfx\/vector\/b2isize.hxx>\n#include <basegfx\/point\/b2ipoint.hxx>\n#include <basegfx\/range\/b2drange.hxx>\n#include <basegfx\/range\/b2irange.hxx>\n#include <basegfx\/polygon\/b2dpolygon.hxx>\n#include <basegfx\/polygon\/b2dpolygontools.hxx>\n#include <basegfx\/polygon\/b2dpolypolygon.hxx>\n#include <basegfx\/polygon\/b2dpolypolygontools.hxx>\n\n#include <basebmp\/color.hxx>\n#include <basebmp\/scanlineformats.hxx>\n#include <basebmp\/bitmapdevice.hxx>\n#include <basebmp\/debug.hxx>\n#include \"tools.hxx\"\n\n#include <iostream>\n#include <fstream>\n\nusing namespace ::basebmp;\n\nnamespace\n{\n\/*\n std::ofstream output(\"32bpp_test.dump\");\n debugDump( mpDevice32bpp, output );\n*\/\n\nclass ClipTest : public CppUnit::TestFixture\n{\nprivate:\n BitmapDeviceSharedPtr mpClipMask;\n BitmapDeviceSharedPtr mpDevice1bpp;\n BitmapDeviceSharedPtr mpDevice32bpp;\n\n void implTestPixelClip(const BitmapDeviceSharedPtr& rDevice)\n {\n const Color aBgCol(0);\n rDevice->clear(aBgCol);\n\n const basegfx::B2IPoint aPt(0,0);\n const Color aCol(0xFFFFFFFF);\n rDevice->setPixel( aPt, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #1\",\n rDevice->getPixel(aPt) == aBgCol);\n\n const basegfx::B2IPoint aPt2(10,10);\n rDevice->setPixel( aPt2, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #2\",\n rDevice->getPixel(aPt2) == aBgCol);\n\n const basegfx::B2IPoint aPt1(10,0);\n rDevice->setPixel( aPt1, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #3\",\n rDevice->getPixel(aPt1) != aBgCol);\n\n const basegfx::B2IPoint aPt3(0,10);\n rDevice->setPixel( aPt3, aCol, DrawMode_PAINT, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"get\/setPixel clip #4\",\n rDevice->getPixel(aPt3) != aBgCol);\n }\n\n void implTestLineClip(const BitmapDeviceSharedPtr& rDevice)\n {\n const Color aBgCol(0);\n rDevice->clear(aBgCol);\n\n const basegfx::B2IPoint aPt1(0,0);\n const basegfx::B2IPoint aPt2(1,9);\n const Color aCol(0xFFFFFFFF);\n rDevice->drawLine( aPt1, aPt2, aCol, DrawMode_PAINT, mpClipMask );\n\n const basegfx::B2IPoint aPt3(1,5);\n CPPUNIT_ASSERT_MESSAGE(\"get line pixel\",\n rDevice->getPixel(aPt3) != aBgCol);\n CPPUNIT_ASSERT_MESSAGE(\"number of rendered line pixel is not 4\",\n countPixel( rDevice,\n rDevice->getPixel(aPt3) ) == 4);\n\n rDevice->drawLine( aPt1, aPt2, aCol, DrawMode_XOR, mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"number of xor-rendered line pixel is not 0\",\n countPixel( rDevice,\n rDevice->getPixel(aPt3) ) == 121);\n }\n\n void implTestFillClip(const BitmapDeviceSharedPtr& rDevice)\n {\n rDevice->clear(Color(0));\n\n const basegfx::B2DRange aAllOver(-10,-10,20,20);\n const Color aCol(0xFFFFFFFF);\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_PAINT,\n mpClipMask );\n const basegfx::B2IPoint aPt(0,10);\n CPPUNIT_ASSERT_MESSAGE(\"number of clipped pixel is not 30\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121-30);\n\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_PAINT );\n CPPUNIT_ASSERT_MESSAGE(\"number of filled pixel is not 121\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121);\n\n rDevice->fillPolyPolygon( basegfx::B2DPolyPolygon(\n basegfx::tools::createPolygonFromRect(aAllOver)),\n aCol,\n DrawMode_XOR,\n mpClipMask );\n CPPUNIT_ASSERT_MESSAGE(\"number of xor-cleared pixel is not 91\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 121-30);\n }\n\n void implTestBmpClip(const BitmapDeviceSharedPtr& rDevice)\n {\n BitmapDeviceSharedPtr pBmp( cloneBitmapDevice(\n basegfx::B2IVector(3,3),\n rDevice ));\n Color aCol1(0);\n Color aCol2(0xFFFFFFFF);\n pBmp->clear(aCol1);\n pBmp->setPixel(basegfx::B2IPoint(0,0),aCol2,DrawMode_PAINT);\n pBmp->setPixel(basegfx::B2IPoint(1,1),aCol2,DrawMode_PAINT);\n pBmp->setPixel(basegfx::B2IPoint(2,2),aCol2,basebmp::DrawMode_PAINT);\n\n rDevice->clear(aCol1);\n rDevice->drawBitmap(pBmp,\n basegfx::B2IRange(0,0,3,3),\n basegfx::B2IRange(-1,-1,4,4),\n DrawMode_PAINT,\n mpClipMask);\n\n const basegfx::B2IPoint aPt(1,1);\n CPPUNIT_ASSERT_MESSAGE(\"number of clipped pixel is not 5\",\n countPixel( rDevice,\n rDevice->getPixel(aPt) ) == 5);\n }\n\n void implTestMaskColorClip(const BitmapDeviceSharedPtr& rDevice)\n {\n BitmapDeviceSharedPtr pBmp( createBitmapDevice( rDevice->getSize(),\n true,\n Format::EIGHT_BIT_GREY ));\n\n ::rtl::OUString aSvg = ::rtl::OUString::createFromAscii(\n \"m 0 0h5v10h5v-5h-10z\" );\n\n basegfx::B2DPolyPolygon aPoly;\n basegfx::tools::importFromSvgD( aPoly, aSvg );\n const basebmp::Color aCol(0xFF);\n pBmp->clear( basebmp::Color(0) );\n pBmp->fillPolyPolygon(\n aPoly,\n aCol,\n basebmp::DrawMode_PAINT );\n\n const basegfx::B2IRange aSourceRect(0,0,10,10);\n const basegfx::B2IPoint aDestLeftTop(0,0);\n const Color aCol2(0xF0F0F0F0);\n rDevice->drawMaskedColor(\n aCol2,\n pBmp,\n aSourceRect,\n aDestLeftTop,\n mpClipMask );\n const basegfx::B2IPoint aPt(1,1);\n CPPUNIT_ASSERT_MESSAGE(\"number of rendered pixel is not 41\",\n countPixel( rDevice, rDevice->getPixel(aPt) ) == 41);\n\n }\n\npublic:\n void setUp()\n {\n const basegfx::B2ISize aSize(11,11);\n mpClipMask = createBitmapDevice( aSize,\n true,\n Format::ONE_BIT_MSB_GREY );\n mpDevice1bpp = createBitmapDevice( aSize,\n true,\n Format::ONE_BIT_MSB_PAL );\n mpDevice32bpp = createBitmapDevice( aSize,\n true,\n Format::THIRTYTWO_BIT_TC_MASK );\n\n ::rtl::OUString aSvg = ::rtl::OUString::createFromAscii(\n \"m 0 0 h5 l5 5 v5 h-5 l-5-5 z\" );\n basegfx::B2DPolyPolygon aPoly;\n basegfx::tools::importFromSvgD( aPoly, aSvg );\n mpClipMask->clear(Color(0));\n mpClipMask->drawPolygon(\n aPoly.getB2DPolygon(0),\n Color(0xFFFFFFFF),\n DrawMode_PAINT );\n }\n\n void testPixelClip()\n {\n implTestPixelClip( mpDevice1bpp );\n implTestPixelClip( mpDevice32bpp );\n }\n\n void testLineClip()\n {\n implTestLineClip( mpDevice1bpp );\n implTestLineClip( mpDevice32bpp );\n }\n\n void testFillClip()\n {\n implTestFillClip( mpDevice1bpp );\n implTestFillClip( mpDevice32bpp );\n }\n\n void testBmpClip()\n {\n implTestBmpClip( mpDevice1bpp );\n implTestBmpClip( mpDevice32bpp );\n }\n\n void testMaskColorClip()\n {\n implTestMaskColorClip( mpDevice1bpp );\n implTestMaskColorClip( mpDevice32bpp );\n }\n\n \/\/ Change the following lines only, if you add, remove or rename\n \/\/ member functions of the current class,\n \/\/ because these macros are need by auto register mechanism.\n\n CPPUNIT_TEST_SUITE(ClipTest);\n CPPUNIT_TEST(testPixelClip);\n CPPUNIT_TEST(testLineClip);\n CPPUNIT_TEST(testFillClip);\n CPPUNIT_TEST(testBmpClip);\n CPPUNIT_TEST(testMaskColorClip);\n CPPUNIT_TEST_SUITE_END();\n};\n\n\/\/ -----------------------------------------------------------------------------\nCPPUNIT_TEST_SUITE_NAMED_REGISTRATION(ClipTest, \"ClipTest\");\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\n\/\/ this macro creates an empty function, which will called by the RegisterAllFunctions()\n\/\/ to let the user the possibility to also register some functions by hand.\n\/\/NOADDITIONAL;\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_util.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/download\/download_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_error_reporter.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/site_instance.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/common\/notification_details.h\"\n#include \"content\/common\/notification_observer.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"content\/common\/notification_type.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/test\/test_server.h\"\n\nclass RenderViewHostManagerTest : public InProcessBrowserTest {\n public:\n RenderViewHostManagerTest() {\n EnableDOMAutomation();\n }\n\n static bool GetFilePathWithHostAndPortReplacement(\n const std::string& original_file_path,\n const net::HostPortPair& host_port_pair,\n std::string* replacement_path) {\n std::vector<net::TestServer::StringPair> replacement_text;\n replacement_text.push_back(\n make_pair(\"REPLACE_WITH_HOST_AND_PORT\", host_port_pair.ToString()));\n return net::TestServer::GetFilePathWithReplacements(\n original_file_path, replacement_text, replacement_path);\n }\n};\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with rel=noreferrer\n\/\/ and target=_blank should create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n SwapProcessWithRelNoreferrerAndTargetBlank) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a rel=noreferrer + target=blank link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefTargetBlankLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the tab to open.\n if (browser()->tab_count() < 2)\n ui_test_utils::WaitForNewTab(browser());\n\n \/\/ Opens in new tab.\n EXPECT_EQ(2, browser()->tab_count());\n EXPECT_EQ(1, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Wait for the cross-site transition in the new tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n EXPECT_FALSE(browser()->GetSelectedTabContents()->render_manager()->\n pending_render_view_host());\n\n \/\/ Should have a new SiteInstance.\n scoped_refptr<SiteInstance> noref_blank_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_NE(orig_site_instance, noref_blank_site_instance);\n}\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with just\n\/\/ target=_blank should not create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DontSwapProcessWithOnlyTargetBlank) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a target=blank link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickTargetBlankLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the tab to open.\n if (browser()->tab_count() < 2)\n ui_test_utils::WaitForNewTab(browser());\n\n \/\/ Opens in new tab.\n EXPECT_EQ(2, browser()->tab_count());\n EXPECT_EQ(1, browser()->selected_index());\n\n \/\/ Wait for the cross-site transition in the new tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> blank_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, blank_site_instance);\n}\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with rel=noreferrer\n\/\/ and no target=_blank should not create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DontSwapProcessWithOnlyRelNoreferrer) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a rel=noreferrer link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the cross-site transition in the current tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n\n \/\/ Opens in same tab.\n EXPECT_EQ(1, browser()->tab_count());\n EXPECT_EQ(0, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> noref_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, noref_site_instance);\n}\n\n\/\/ Test for crbug.com\/14505. This tests that chrome:\/\/ urls are still functional\n\/\/ after download of a file while viewing another chrome:\/\/.\n\/\/ Hangs flakily in Win, http:\/\/crbug.com\/45040, and started hanging on Linux,\n\/\/ Mac and ChromeOS, http:\/\/crbug.com\/77762.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DISABLED_ChromeURLAfterDownload) {\n GURL downloads_url(\"chrome:\/\/downloads\");\n GURL extensions_url(\"chrome:\/\/extensions\");\n FilePath zip_download;\n ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &zip_download));\n zip_download = zip_download.AppendASCII(\"zip\").AppendASCII(\"test.zip\");\n GURL zip_url = net::FilePathToFileURL(zip_download);\n\n ui_test_utils::NavigateToURL(browser(), downloads_url);\n ui_test_utils::NavigateToURL(browser(), zip_url);\n ui_test_utils::WaitForDownloadCount(\n browser()->profile()->GetDownloadManager(), 1);\n ui_test_utils::NavigateToURL(browser(), extensions_url);\n\n TabContents *contents = browser()->GetSelectedTabContents();\n ASSERT_TRUE(contents);\n bool webui_responded = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n contents->render_view_host(),\n L\"\",\n L\"window.domAutomationController.send(window.webui_responded_);\",\n &webui_responded));\n EXPECT_TRUE(webui_responded);\n}\n\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n explicit BrowserClosedObserver(Browser* browser) {\n registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n Source<Browser>(browser));\n ui_test_utils::RunMessageLoop();\n }\n\n \/\/ NotificationObserver\n virtual void Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::BROWSER_CLOSED:\n MessageLoopForUI::current()->Quit();\n break;\n default:\n NOTREACHED();\n break;\n }\n }\n\n private:\n NotificationRegistrar registrar_;\n};\n\n\/\/ Test for crbug.com\/12745. This tests that if a download is initiated from\n\/\/ a chrome:\/\/ page that has registered and onunload handler, the browser\n\/\/ will be able to close.\n\/\/ TODO(rafaelw): The fix for 12745 has now also been reverted. Another fix\n\/\/ must be found before this can be re-enabled.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DISABLED_BrowserCloseAfterDownload) {\n GURL downloads_url(\"chrome:\/\/downloads\");\n FilePath zip_download;\n ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &zip_download));\n zip_download = zip_download.AppendASCII(\"zip\").AppendASCII(\"test.zip\");\n ASSERT_TRUE(file_util::PathExists(zip_download));\n GURL zip_url = net::FilePathToFileURL(zip_download);\n\n ui_test_utils::NavigateToURL(browser(), downloads_url);\n TabContents *contents = browser()->GetSelectedTabContents();\n ASSERT_TRUE(contents);\n bool result = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n contents->render_view_host(),\n L\"\",\n L\"window.onunload = function() { var do_nothing = 0; }; \"\n L\"window.domAutomationController.send(true);\",\n &result));\n EXPECT_TRUE(result);\n ui_test_utils::NavigateToURL(browser(), zip_url);\n\n ui_test_utils::WaitForDownloadCount(\n browser()->profile()->GetDownloadManager(), 1);\n\n browser()->CloseWindow();\n BrowserClosedObserver wait_for_close(browser());\n}\n\n\/\/ Test for crbug.com\/76666. A cross-site navigation that fails with a 204\n\/\/ error should not make us ignore future renderer-initiated navigations.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest, ClickLinkAfter204Error) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n \/\/ The links will point to the HTTPS server.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Load a cross-site page that fails with a 204 error.\n ui_test_utils::NavigateToURL(browser(), https_server.GetURL(\"nocontent\"));\n\n \/\/ We should still be looking at the normal page.\n scoped_refptr<SiteInstance> post_nav_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, post_nav_site_instance);\n EXPECT_EQ(\"\/files\/click-noreferrer-links.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Renderer-initiated navigations should work.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the cross-site transition in the current tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n\n \/\/ Opens in same tab.\n EXPECT_EQ(1, browser()->tab_count());\n EXPECT_EQ(0, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> noref_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, noref_site_instance);\n}\n<commit_msg>Add log statements to ChromeURLAfterDownload to see where exactly its timing out. I'll revert this after it builds.<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"base\/file_util.h\"\n#include \"base\/memory\/ref_counted.h\"\n#include \"base\/path_service.h\"\n#include \"chrome\/browser\/download\/download_manager.h\"\n#include \"chrome\/browser\/extensions\/extension_error_reporter.h\"\n#include \"chrome\/browser\/profiles\/profile.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/common\/chrome_paths.h\"\n#include \"chrome\/test\/in_process_browser_test.h\"\n#include \"chrome\/test\/ui_test_utils.h\"\n#include \"content\/browser\/site_instance.h\"\n#include \"content\/browser\/tab_contents\/tab_contents.h\"\n#include \"content\/common\/notification_details.h\"\n#include \"content\/common\/notification_observer.h\"\n#include \"content\/common\/notification_registrar.h\"\n#include \"content\/common\/notification_type.h\"\n#include \"net\/base\/net_util.h\"\n#include \"net\/test\/test_server.h\"\n\nclass RenderViewHostManagerTest : public InProcessBrowserTest {\n public:\n RenderViewHostManagerTest() {\n EnableDOMAutomation();\n }\n\n static bool GetFilePathWithHostAndPortReplacement(\n const std::string& original_file_path,\n const net::HostPortPair& host_port_pair,\n std::string* replacement_path) {\n std::vector<net::TestServer::StringPair> replacement_text;\n replacement_text.push_back(\n make_pair(\"REPLACE_WITH_HOST_AND_PORT\", host_port_pair.ToString()));\n return net::TestServer::GetFilePathWithReplacements(\n original_file_path, replacement_text, replacement_path);\n }\n};\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with rel=noreferrer\n\/\/ and target=_blank should create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n SwapProcessWithRelNoreferrerAndTargetBlank) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a rel=noreferrer + target=blank link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefTargetBlankLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the tab to open.\n if (browser()->tab_count() < 2)\n ui_test_utils::WaitForNewTab(browser());\n\n \/\/ Opens in new tab.\n EXPECT_EQ(2, browser()->tab_count());\n EXPECT_EQ(1, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Wait for the cross-site transition in the new tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n EXPECT_FALSE(browser()->GetSelectedTabContents()->render_manager()->\n pending_render_view_host());\n\n \/\/ Should have a new SiteInstance.\n scoped_refptr<SiteInstance> noref_blank_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_NE(orig_site_instance, noref_blank_site_instance);\n}\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with just\n\/\/ target=_blank should not create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DontSwapProcessWithOnlyTargetBlank) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a target=blank link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickTargetBlankLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the tab to open.\n if (browser()->tab_count() < 2)\n ui_test_utils::WaitForNewTab(browser());\n\n \/\/ Opens in new tab.\n EXPECT_EQ(2, browser()->tab_count());\n EXPECT_EQ(1, browser()->selected_index());\n\n \/\/ Wait for the cross-site transition in the new tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> blank_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, blank_site_instance);\n}\n\n\/\/ Test for crbug.com\/24447. Following a cross-site link with rel=noreferrer\n\/\/ and no target=_blank should not create a new SiteInstance.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DontSwapProcessWithOnlyRelNoreferrer) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Test clicking a rel=noreferrer link.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the cross-site transition in the current tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n\n \/\/ Opens in same tab.\n EXPECT_EQ(1, browser()->tab_count());\n EXPECT_EQ(0, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> noref_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, noref_site_instance);\n}\n\n\/\/ Test for crbug.com\/14505. This tests that chrome:\/\/ urls are still functional\n\/\/ after download of a file while viewing another chrome:\/\/.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n ChromeURLAfterDownload) {\n GURL downloads_url(\"chrome:\/\/downloads\");\n GURL extensions_url(\"chrome:\/\/extensions\");\n FilePath zip_download;\n ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &zip_download));\n zip_download = zip_download.AppendASCII(\"zip\").AppendASCII(\"test.zip\");\n GURL zip_url = net::FilePathToFileURL(zip_download);\n\n LOG(INFO) << \"Navigating to chrome URL.\";\n ui_test_utils::NavigateToURL(browser(), downloads_url);\n LOG(INFO) << \"Navigating to zip URL.\";\n ui_test_utils::NavigateToURL(browser(), zip_url);\n LOG(INFO) << \"Waiting for the zip download to complete.\";\n ui_test_utils::WaitForDownloadCount(\n browser()->profile()->GetDownloadManager(), 1);\n LOG(INFO) << \"Download complete. Navigating to the extensions URL.\";\n ui_test_utils::NavigateToURL(browser(), extensions_url);\n\n TabContents *contents = browser()->GetSelectedTabContents();\n ASSERT_TRUE(contents);\n bool webui_responded = false;\n LOG(INFO) << \"Executing javascript.\";\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n contents->render_view_host(),\n L\"\",\n L\"window.domAutomationController.send(window.webui_responded_);\",\n &webui_responded));\n LOG(INFO) << \"Javascript executed.\";\n EXPECT_TRUE(webui_responded);\n}\n\nclass BrowserClosedObserver : public NotificationObserver {\n public:\n explicit BrowserClosedObserver(Browser* browser) {\n registrar_.Add(this, NotificationType::BROWSER_CLOSED,\n Source<Browser>(browser));\n ui_test_utils::RunMessageLoop();\n }\n\n \/\/ NotificationObserver\n virtual void Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n switch (type.value) {\n case NotificationType::BROWSER_CLOSED:\n MessageLoopForUI::current()->Quit();\n break;\n default:\n NOTREACHED();\n break;\n }\n }\n\n private:\n NotificationRegistrar registrar_;\n};\n\n\/\/ Test for crbug.com\/12745. This tests that if a download is initiated from\n\/\/ a chrome:\/\/ page that has registered and onunload handler, the browser\n\/\/ will be able to close.\n\/\/ TODO(rafaelw): The fix for 12745 has now also been reverted. Another fix\n\/\/ must be found before this can be re-enabled.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest,\n DISABLED_BrowserCloseAfterDownload) {\n GURL downloads_url(\"chrome:\/\/downloads\");\n FilePath zip_download;\n ASSERT_TRUE(PathService::Get(chrome::DIR_TEST_DATA, &zip_download));\n zip_download = zip_download.AppendASCII(\"zip\").AppendASCII(\"test.zip\");\n ASSERT_TRUE(file_util::PathExists(zip_download));\n GURL zip_url = net::FilePathToFileURL(zip_download);\n\n ui_test_utils::NavigateToURL(browser(), downloads_url);\n TabContents *contents = browser()->GetSelectedTabContents();\n ASSERT_TRUE(contents);\n bool result = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n contents->render_view_host(),\n L\"\",\n L\"window.onunload = function() { var do_nothing = 0; }; \"\n L\"window.domAutomationController.send(true);\",\n &result));\n EXPECT_TRUE(result);\n ui_test_utils::NavigateToURL(browser(), zip_url);\n\n ui_test_utils::WaitForDownloadCount(\n browser()->profile()->GetDownloadManager(), 1);\n\n browser()->CloseWindow();\n BrowserClosedObserver wait_for_close(browser());\n}\n\n\/\/ Test for crbug.com\/76666. A cross-site navigation that fails with a 204\n\/\/ error should not make us ignore future renderer-initiated navigations.\nIN_PROC_BROWSER_TEST_F(RenderViewHostManagerTest, ClickLinkAfter204Error) {\n \/\/ Start two servers with different sites.\n ASSERT_TRUE(test_server()->Start());\n net::TestServer https_server(\n net::TestServer::TYPE_HTTPS,\n FilePath(FILE_PATH_LITERAL(\"chrome\/test\/data\")));\n ASSERT_TRUE(https_server.Start());\n\n \/\/ Load a page with links that open in a new window.\n \/\/ The links will point to the HTTPS server.\n std::string replacement_path;\n ASSERT_TRUE(GetFilePathWithHostAndPortReplacement(\n \"files\/click-noreferrer-links.html\",\n https_server.host_port_pair(),\n &replacement_path));\n ui_test_utils::NavigateToURL(browser(),\n test_server()->GetURL(replacement_path));\n\n \/\/ Get the original SiteInstance for later comparison.\n scoped_refptr<SiteInstance> orig_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_TRUE(orig_site_instance != NULL);\n\n \/\/ Load a cross-site page that fails with a 204 error.\n ui_test_utils::NavigateToURL(browser(), https_server.GetURL(\"nocontent\"));\n\n \/\/ We should still be looking at the normal page.\n scoped_refptr<SiteInstance> post_nav_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, post_nav_site_instance);\n EXPECT_EQ(\"\/files\/click-noreferrer-links.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Renderer-initiated navigations should work.\n bool success = false;\n EXPECT_TRUE(ui_test_utils::ExecuteJavaScriptAndExtractBool(\n browser()->GetSelectedTabContents()->render_view_host(), L\"\",\n L\"window.domAutomationController.send(clickNoRefLink());\",\n &success));\n EXPECT_TRUE(success);\n\n \/\/ Wait for the cross-site transition in the current tab to finish.\n ui_test_utils::WaitForLoadStop(browser()->GetSelectedTabContents());\n\n \/\/ Opens in same tab.\n EXPECT_EQ(1, browser()->tab_count());\n EXPECT_EQ(0, browser()->selected_index());\n EXPECT_EQ(\"\/files\/title2.html\",\n browser()->GetSelectedTabContents()->GetURL().path());\n\n \/\/ Should have the same SiteInstance.\n scoped_refptr<SiteInstance> noref_site_instance(\n browser()->GetSelectedTabContents()->GetSiteInstance());\n EXPECT_EQ(orig_site_instance, noref_site_instance);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2014 Brain Research Institute, Melbourne, Australia\n\n Written by Robert E. Smith, 2015.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"gui\/mrview\/tool\/connectome.h\"\n\n#include \"file\/path.h\"\n#include \"gui\/dialog\/file.h\"\n#include \"image\/buffer.h\"\n#include \"image\/header.h\"\n#include \"image\/loop.h\"\n#include \"image\/transform.h\"\n\nnamespace MR\n{\n namespace GUI\n {\n namespace MRView\n {\n namespace Tool\n {\n\n\n\n\n Connectome::Connectome (Window& main_window, Dock* parent) :\n Base (main_window, parent) {\n\n VBoxLayout* main_box = new VBoxLayout (this);\n\n HBoxLayout* layout = new HBoxLayout;\n layout->setContentsMargins (0, 0, 0, 0);\n layout->setSpacing (0);\n\n image_button = new QPushButton (this);\n image_button->setToolTip (tr (\"Open parcellation image\"));\n \/\/ TODO New icons\n \/\/ TODO Have the icons always there, but add the opened file name as text\n \/\/image_button->setIcon (QIcon (\":\/open.svg\"));\n connect (image_button, SIGNAL (clicked()), this, SLOT (image_open_slot ()));\n layout->addWidget (image_button, 1);\n\n lut_button = new QPushButton (this);\n lut_button->setToolTip (tr (\"Open lookup table file\"));\n \/\/button->setIcon (QIcon (\":\/close.svg\"));\n lut_button->setEnabled (false);\n connect (lut_button, SIGNAL (clicked()), this, SLOT (lut_open_slot ()));\n layout->addWidget (lut_button, 1);\n\n config_button = new QPushButton (this);\n config_button->setToolTip (tr (\"Open connectome config file\"));\n \/\/config_button->setIcon (QIcon (\":\/close.svg\"));\n config_button->setEnabled (false);\n connect (config_button, SIGNAL (clicked()), this, SLOT (config_open_slot ()));\n layout->addWidget (config_button, 1);\n\n hide_all_button = new QPushButton (this);\n hide_all_button->setToolTip (tr (\"Hide all connectome visualisation\"));\n hide_all_button->setIcon (QIcon (\":\/hide.svg\"));\n hide_all_button->setCheckable (true);\n connect (hide_all_button, SIGNAL (clicked()), this, SLOT (hide_all_slot ()));\n layout->addWidget (hide_all_button, 1);\n\n main_box->addLayout (layout, 0);\n\n main_box->addStretch ();\n setMinimumSize (main_box->minimumSize());\n }\n\n\n Connectome::~Connectome () {}\n\n\n \/\/void Connectome::draw (const Projection& transform, bool is_3D, int axis, int slice)\n void Connectome::draw (const Projection&, bool, int, int)\n {\n\n }\n\n\n \/\/void Connectome::drawOverlays (const Projection& transform)\n void Connectome::drawOverlays (const Projection&)\n {\n if (hide_all_button->isChecked()) return;\n\n }\n\n\n \/\/bool Connectome::process_batch_command (const std::string& cmd, const std::string& args)\n bool Connectome::process_batch_command (const std::string&, const std::string&)\n {\n return false;\n }\n\n\n void Connectome::image_open_slot()\n {\n const std::string path = Dialog::File::get_image (this, \"Select connectome parcellation image\");\n\n if (path.empty())\n return;\n\n \/\/ TODO If a new parcellation image is opened, all other data should be invalidated\n clear_all();\n\n \/\/ TODO Read in the image file, do the necessary conversions e.g. to mesh,\n \/\/ store the number of nodes,\n initialise (path);\n\n image_button->setText (QString::fromStdString (Path::basename (path)));\n }\n\n\n void Connectome::lut_open_slot()\n {\n \/\/ TODO This may be difficult; don't necessarily know the format of the lookup table\n \/\/ Ideally also want to make use of the existing functions for importing these\n }\n void Connectome::config_open_slot()\n {\n\n }\n\n\n void Connectome::hide_all_slot()\n {\n window.updateGL();\n }\n\n\n\n\n\n\n\n Connectome::Node_mesh::Node_mesh (const Mesh::Mesh& in) :\n count (in.triangles.size()),\n vertex_buffer (0),\n vertex_array_object (0),\n index_buffer (0)\n {\n std::vector<float> vertices;\n vertices.reserve (3 * in.num_vertices());\n for (size_t v = 0; v != in.num_vertices(); ++v) {\n for (size_t axis = 0; axis != 3; ++axis)\n vertices.push_back (in.vert(v)[axis]);\n }\n gl::GenBuffers (1, &vertex_buffer);\n gl::BindBuffer (GL_ARRAY_BUFFER, vertex_buffer);\n gl::BufferData (GL_ARRAY_BUFFER, vertices.size() * sizeof (float), &vertices[0], GL_STATIC_DRAW);\n\n gl::GenVertexArrays (1, &vertex_array_object);\n gl::BindVertexArray (vertex_array_object);\n gl::EnableVertexAttribArray (0);\n gl::VertexAttribPointer (0, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(0));\n\n std::vector<unsigned int> indices;\n indices.reserve (3 * in.num_triangles());\n for (size_t i = 0; i != in.num_vertices(); ++i) {\n for (size_t v = 0; v != 3; ++v)\n indices.push_back (in.tri(i)[v]);\n }\n gl::GenBuffers (1, &index_buffer);\n gl::BindBuffer (GL_ELEMENT_ARRAY_BUFFER, index_buffer);\n gl::BufferData (GL_ELEMENT_ARRAY_BUFFER, indices.size() * sizeof (unsigned int), &indices[0], GL_STATIC_DRAW);\n }\n\n\n Connectome::Node_mesh::~Node_mesh ()\n {\n gl::DeleteBuffers (1, &vertex_buffer);\n gl::DeleteVertexArrays (1, &vertex_array_object);\n gl::DeleteBuffers (1, &index_buffer);\n }\n\n\n void Connectome::Node_mesh::render()\n {\n gl::BindVertexArray (vertex_array_object);\n gl::BindBuffer (index_buffer);\n gl::DrawElements (gl::TRIANGLES, count, GL_UNSIGNED_INT, (void*)0);\n }\n\n\n\n\n\n\n\n void Connectome::clear_all()\n {\n image_button ->setText (\"\");\n lut_button ->setText (\"\");\n config_button->setText (\"\");\n num_nodes = 0;\n lookup.clear();\n node_map.clear();\n }\n\n void Connectome::initialise (const std::string& path)\n {\n MR::Image::Header H (path);\n if (!H.datatype().is_integer())\n throw Exception (\"Input parcellation image must have an integer datatype\");\n MR::Image::Buffer<node_t> buffer (path);\n auto voxel = buffer.voxel();\n MR::Image::Transform transform (H);\n std::vector<size_t> node_volumes;\n MR::Image::LoopInOrder loop (voxel, \"Importing parcellation image... \");\n for (loop.start (voxel); loop.ok(); loop.next (voxel)) {\n const node_t node = voxel.value();\n if (node) {\n if (node >= num_nodes) {\n num_nodes = node;\n centres_of_mass.resize (num_nodes+1, Point<float> (0.0f, 0.0f, 0.0f));\n node_volumes.resize (num_nodes+1, 0);\n }\n centres_of_mass[node] += transform.voxel2scanner (voxel);\n node_volumes[node]++;\n }\n }\n for (node_t n = 1; n != num_nodes; ++n)\n centres_of_mass[n] *= (1.0f \/ float(node_volumes[n]));\n }\n\n\n\n }\n }\n }\n}\n\n\n\n\n\n<commit_msg>mrview connectome tool: Fix compilation<commit_after>\/*\n Copyright 2014 Brain Research Institute, Melbourne, Australia\n\n Written by Robert E. Smith, 2015.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"gui\/mrview\/tool\/connectome.h\"\n\n#include \"file\/path.h\"\n#include \"gui\/dialog\/file.h\"\n#include \"image\/buffer.h\"\n#include \"image\/header.h\"\n#include \"image\/loop.h\"\n#include \"image\/transform.h\"\n\nnamespace MR\n{\n namespace GUI\n {\n namespace MRView\n {\n namespace Tool\n {\n\n\n\n\n Connectome::Connectome (Window& main_window, Dock* parent) :\n Base (main_window, parent) {\n\n VBoxLayout* main_box = new VBoxLayout (this);\n\n HBoxLayout* layout = new HBoxLayout;\n layout->setContentsMargins (0, 0, 0, 0);\n layout->setSpacing (0);\n\n image_button = new QPushButton (this);\n image_button->setToolTip (tr (\"Open parcellation image\"));\n \/\/ TODO New icons\n \/\/ TODO Have the icons always there, but add the opened file name as text\n \/\/image_button->setIcon (QIcon (\":\/open.svg\"));\n connect (image_button, SIGNAL (clicked()), this, SLOT (image_open_slot ()));\n layout->addWidget (image_button, 1);\n\n lut_button = new QPushButton (this);\n lut_button->setToolTip (tr (\"Open lookup table file\"));\n \/\/button->setIcon (QIcon (\":\/close.svg\"));\n lut_button->setEnabled (false);\n connect (lut_button, SIGNAL (clicked()), this, SLOT (lut_open_slot ()));\n layout->addWidget (lut_button, 1);\n\n config_button = new QPushButton (this);\n config_button->setToolTip (tr (\"Open connectome config file\"));\n \/\/config_button->setIcon (QIcon (\":\/close.svg\"));\n config_button->setEnabled (false);\n connect (config_button, SIGNAL (clicked()), this, SLOT (config_open_slot ()));\n layout->addWidget (config_button, 1);\n\n hide_all_button = new QPushButton (this);\n hide_all_button->setToolTip (tr (\"Hide all connectome visualisation\"));\n hide_all_button->setIcon (QIcon (\":\/hide.svg\"));\n hide_all_button->setCheckable (true);\n connect (hide_all_button, SIGNAL (clicked()), this, SLOT (hide_all_slot ()));\n layout->addWidget (hide_all_button, 1);\n\n main_box->addLayout (layout, 0);\n\n main_box->addStretch ();\n setMinimumSize (main_box->minimumSize());\n }\n\n\n Connectome::~Connectome () {}\n\n\n \/\/void Connectome::draw (const Projection& transform, bool is_3D, int axis, int slice)\n void Connectome::draw (const Projection&, bool, int, int)\n {\n\n }\n\n\n \/\/void Connectome::drawOverlays (const Projection& transform)\n void Connectome::drawOverlays (const Projection&)\n {\n if (hide_all_button->isChecked()) return;\n\n }\n\n\n \/\/bool Connectome::process_batch_command (const std::string& cmd, const std::string& args)\n bool Connectome::process_batch_command (const std::string&, const std::string&)\n {\n return false;\n }\n\n\n void Connectome::image_open_slot()\n {\n const std::string path = Dialog::File::get_image (this, \"Select connectome parcellation image\");\n\n if (path.empty())\n return;\n\n \/\/ TODO If a new parcellation image is opened, all other data should be invalidated\n clear_all();\n\n \/\/ TODO Read in the image file, do the necessary conversions e.g. to mesh,\n \/\/ store the number of nodes,\n initialise (path);\n\n image_button->setText (QString::fromStdString (Path::basename (path)));\n }\n\n\n void Connectome::lut_open_slot()\n {\n \/\/ TODO This may be difficult; don't necessarily know the format of the lookup table\n \/\/ Ideally also want to make use of the existing functions for importing these\n }\n void Connectome::config_open_slot()\n {\n\n }\n\n\n void Connectome::hide_all_slot()\n {\n window.updateGL();\n }\n\n\n\n\n\n\n\n Connectome::Node_mesh::Node_mesh (const Mesh::Mesh& in) :\n count (in.num_triangles()),\n vertex_buffer (0),\n vertex_array_object (0),\n index_buffer (0)\n {\n std::vector<float> vertices;\n vertices.reserve (3 * in.num_vertices());\n for (size_t v = 0; v != in.num_vertices(); ++v) {\n for (size_t axis = 0; axis != 3; ++axis)\n vertices.push_back (in.vert(v)[axis]);\n }\n gl::GenBuffers (1, &vertex_buffer);\n gl::BindBuffer (GL_ARRAY_BUFFER, vertex_buffer);\n gl::BufferData (GL_ARRAY_BUFFER, vertices.size() * sizeof (float), &vertices[0], GL_STATIC_DRAW);\n\n gl::GenVertexArrays (1, &vertex_array_object);\n gl::BindVertexArray (vertex_array_object);\n gl::EnableVertexAttribArray (0);\n gl::VertexAttribPointer (0, 3, gl::FLOAT, gl::FALSE_, 0, (void*)(0));\n\n std::vector<unsigned int> indices;\n indices.reserve (3 * in.num_triangles());\n for (size_t i = 0; i != in.num_vertices(); ++i) {\n for (size_t v = 0; v != 3; ++v)\n indices.push_back (in.tri(i)[v]);\n }\n gl::GenBuffers (1, &index_buffer);\n gl::BindBuffer (GL_ELEMENT_ARRAY_BUFFER, index_buffer);\n gl::BufferData (GL_ELEMENT_ARRAY_BUFFER, indices.size() * sizeof (unsigned int), &indices[0], GL_STATIC_DRAW);\n }\n\n\n Connectome::Node_mesh::~Node_mesh ()\n {\n gl::DeleteBuffers (1, &vertex_buffer);\n gl::DeleteVertexArrays (1, &vertex_array_object);\n gl::DeleteBuffers (1, &index_buffer);\n }\n\n\n void Connectome::Node_mesh::render()\n {\n gl::BindVertexArray (vertex_array_object);\n gl::BindBuffer (GL_ELEMENT_ARRAY_BUFFER, index_buffer);\n gl::DrawElements (gl::TRIANGLES, count, GL_UNSIGNED_INT, (void*)0);\n }\n\n\n\n\n\n\n\n void Connectome::clear_all()\n {\n image_button ->setText (\"\");\n lut_button ->setText (\"\");\n config_button->setText (\"\");\n num_nodes = 0;\n lookup.clear();\n node_map.clear();\n }\n\n void Connectome::initialise (const std::string& path)\n {\n MR::Image::Header H (path);\n if (!H.datatype().is_integer())\n throw Exception (\"Input parcellation image must have an integer datatype\");\n MR::Image::Buffer<node_t> buffer (path);\n auto voxel = buffer.voxel();\n MR::Image::Transform transform (H);\n std::vector<size_t> node_volumes;\n MR::Image::LoopInOrder loop (voxel, \"Importing parcellation image... \");\n for (loop.start (voxel); loop.ok(); loop.next (voxel)) {\n const node_t node = voxel.value();\n if (node) {\n if (node >= num_nodes) {\n num_nodes = node;\n centres_of_mass.resize (num_nodes+1, Point<float> (0.0f, 0.0f, 0.0f));\n node_volumes.resize (num_nodes+1, 0);\n }\n centres_of_mass[node] += transform.voxel2scanner (voxel);\n node_volumes[node]++;\n }\n }\n for (node_t n = 1; n != num_nodes; ++n)\n centres_of_mass[n] *= (1.0f \/ float(node_volumes[n]));\n }\n\n\n\n }\n }\n }\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"sl_evaluator_training_set.h\"\r\n\r\n#include <algorithm>\r\n#include <vector>\r\n#include <thread>\r\n#include <mutex>\r\n\r\n#include \"sl_evaluator.h\"\r\n\r\nnamespace penciloid\r\n{\r\nnamespace slitherlink\r\n{\r\nstd::vector<double> EvaluatorTrainingSet::ComputeDifficultyAll(EvaluatorParameter param, int n_threads)\r\n{\r\n\tstd::vector<std::pair<Problem*, int> > entries;\r\n\tstd::vector<double> score_result;\r\n\r\n\tfor (int i = 0; i < problem_set_.size(); ++i) {\r\n\t\tscore_result.push_back(-1.0);\r\n\t\tif (evaluability_[i] != kUnevaluable) {\r\n\t\t\tprintf(\"%d \", i);\r\n\t\t\tentries.push_back({ &(problem_set_[i]), i });\r\n\t\t}\r\n\t}\r\n\tputs(\"\");\r\n\r\n\tstd::sort(entries.begin(), entries.end(), [](const std::pair<Problem*, int> &e1, const std::pair<Problem*, int> &e2) {\r\n\t\tint size_e1 = static_cast<int>(e1.first->height()) * static_cast<int>(e1.first->width());\r\n\t\tint size_e2 = static_cast<int>(e2.first->height()) * static_cast<int>(e2.first->width());\r\n\t\treturn size_e1 > size_e2;\r\n\t});\r\n\r\n\tstd::mutex mtx; int index = 0;\r\n\tauto worker = [¶m, &entries, &mtx, &index, &score_result]() {\r\n\t\tfor (;;) {\r\n\t\t\tmtx.lock();\r\n\t\t\tint current_index = index++;\r\n\t\t\tmtx.unlock();\r\n\t\t\tif (current_index >= entries.size()) break;\r\n\r\n\t\t\tEvaluator e(*(entries[current_index].first));\r\n\t\t\te.SetParameter(param);\r\n\t\t\tdouble score = e.Evaluate();\r\n\r\n\t\t\tmtx.lock();\r\n\t\t\tscore_result[entries[current_index].second] = score;\r\n\t\t\tmtx.unlock();\r\n\t\t}\r\n\t};\r\n\r\n\tstd::vector<std::thread> workers(n_threads);\r\n\tfor (int i = 0; i < n_threads; ++i) {\r\n\t\tworkers[i] = std::thread(worker);\r\n\t}\r\n\tfor (int i = 0; i < n_threads; ++i) workers[i].join();\r\n\r\n\tfor (int i = 0; i < problem_set_.size(); ++i) {\r\n\t\tif (score_result[i] < 0) evaluability_[i] = kUnevaluable;\r\n\t\telse evaluability_[i] = kEvaluable;\r\n\t}\r\n\treturn score_result;\r\n}\r\n}\r\n}<commit_msg>Slitherlink: remove unnecessary outputs<commit_after>#include \"sl_evaluator_training_set.h\"\r\n\r\n#include <algorithm>\r\n#include <vector>\r\n#include <thread>\r\n#include <mutex>\r\n\r\n#include \"sl_evaluator.h\"\r\n\r\nnamespace penciloid\r\n{\r\nnamespace slitherlink\r\n{\r\nstd::vector<double> EvaluatorTrainingSet::ComputeDifficultyAll(EvaluatorParameter param, int n_threads)\r\n{\r\n\tstd::vector<std::pair<Problem*, int> > entries;\r\n\tstd::vector<double> score_result;\r\n\r\n\tfor (int i = 0; i < problem_set_.size(); ++i) {\r\n\t\tscore_result.push_back(-1.0);\r\n\t\tif (evaluability_[i] != kUnevaluable) {\r\n\t\t\tentries.push_back({ &(problem_set_[i]), i });\r\n\t\t}\r\n\t}\r\n\r\n\tstd::sort(entries.begin(), entries.end(), [](const std::pair<Problem*, int> &e1, const std::pair<Problem*, int> &e2) {\r\n\t\tint size_e1 = static_cast<int>(e1.first->height()) * static_cast<int>(e1.first->width());\r\n\t\tint size_e2 = static_cast<int>(e2.first->height()) * static_cast<int>(e2.first->width());\r\n\t\treturn size_e1 > size_e2;\r\n\t});\r\n\r\n\tstd::mutex mtx; int index = 0;\r\n\tauto worker = [¶m, &entries, &mtx, &index, &score_result]() {\r\n\t\tfor (;;) {\r\n\t\t\tmtx.lock();\r\n\t\t\tint current_index = index++;\r\n\t\t\tmtx.unlock();\r\n\t\t\tif (current_index >= entries.size()) break;\r\n\r\n\t\t\tEvaluator e(*(entries[current_index].first));\r\n\t\t\te.SetParameter(param);\r\n\t\t\tdouble score = e.Evaluate();\r\n\r\n\t\t\tmtx.lock();\r\n\t\t\tscore_result[entries[current_index].second] = score;\r\n\t\t\tmtx.unlock();\r\n\t\t}\r\n\t};\r\n\r\n\tstd::vector<std::thread> workers(n_threads);\r\n\tfor (int i = 0; i < n_threads; ++i) {\r\n\t\tworkers[i] = std::thread(worker);\r\n\t}\r\n\tfor (int i = 0; i < n_threads; ++i) workers[i].join();\r\n\r\n\tfor (int i = 0; i < problem_set_.size(); ++i) {\r\n\t\tif (score_result[i] < 0) evaluability_[i] = kUnevaluable;\r\n\t\telse evaluability_[i] = kEvaluable;\r\n\t}\r\n\treturn score_result;\r\n}\r\n}\r\n}<|endoftext|>"} {"text":"<commit_before>\/*++\nCopyright (c) 2012 Microsoft Corporation\n\nModule Name:\n\n smt_strategic_solver.h\n\nAbstract:\n\n Create a strategic solver with tactic for all main logics\n used in SMT.\n\nAuthor:\n\n Leonardo (leonardo) 2012-02-19\n\nNotes:\n\n--*\/\n#include\"cmd_context.h\"\n#include\"ni_solver.h\"\n#include\"strategic_solver.h\"\n#include\"qfbv_tactic.h\"\n#include\"qflia_tactic.h\"\n#include\"qfnia_tactic.h\"\n#include\"qfnra_tactic.h\"\n#include\"qfuf_tactic.h\"\n#include\"qflra_tactic.h\"\n#include\"quant_tactics.h\"\n#include\"qfauflia_tactic.h\"\n#include\"qfaufbv_tactic.h\"\n#include\"qfufbv_tactic.h\"\n#include\"qfidl_tactic.h\"\n#include\"default_tactic.h\"\n#include\"ufbv_tactic.h\"\n#include\"qffpa_tactic.h\"\n#include\"default_solver.h\"\n\nMK_SIMPLE_TACTIC_FACTORY(qfuf_fct, mk_qfuf_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfidl_fct, mk_qfidl_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfauflia_fct, mk_qfauflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(auflia_fct, mk_auflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(auflira_fct, mk_auflira_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(aufnira_fct, mk_aufnira_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(ufnia_fct, mk_ufnia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(uflra_fct, mk_uflra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(lra_fct, mk_lra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfbv_fct, mk_qfbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(default_fct, mk_default_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfaufbv_fct, mk_qfaufbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qflra_fct, mk_qflra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qflia_fct, mk_qflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfufbv_fct, mk_qfufbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfnia_fct, mk_qfnia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfnra_fct, mk_qfnra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qffpa_fct, mk_qffpa_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(ufbv_fct, mk_ufbv_tactic(m, p));\n\nstatic void init(strategic_solver * s) {\n s->set_default_tactic(alloc(default_fct));\n s->set_tactic_for(symbol(\"QF_UF\"), alloc(qfuf_fct));\n s->set_tactic_for(symbol(\"QF_BV\"), alloc(qfbv_fct));\n s->set_tactic_for(symbol(\"QF_IDL\"), alloc(qfidl_fct));\n s->set_tactic_for(symbol(\"QF_LIA\"), alloc(qflia_fct));\n s->set_tactic_for(symbol(\"QF_LRA\"), alloc(qflra_fct));\n s->set_tactic_for(symbol(\"QF_NIA\"), alloc(qfnia_fct));\n s->set_tactic_for(symbol(\"QF_NRA\"), alloc(qfnra_fct));\n s->set_tactic_for(symbol(\"QF_AUFLIA\"), alloc(qfauflia_fct));\n s->set_tactic_for(symbol(\"QF_AUFBV\"), alloc(qfaufbv_fct));\n s->set_tactic_for(symbol(\"QF_ABV\"), alloc(qfaufbv_fct));\n s->set_tactic_for(symbol(\"QF_UFBV\"), alloc(qfufbv_fct));\n s->set_tactic_for(symbol(\"AUFLIA\"), alloc(auflia_fct));\n s->set_tactic_for(symbol(\"AUFLIRA\"), alloc(auflira_fct));\n s->set_tactic_for(symbol(\"AUFNIRA\"), alloc(aufnira_fct));\n s->set_tactic_for(symbol(\"UFNIA\"), alloc(ufnia_fct));\n s->set_tactic_for(symbol(\"UFLRA\"), alloc(uflra_fct));\n s->set_tactic_for(symbol(\"LRA\"), alloc(lra_fct));\n s->set_tactic_for(symbol(\"UFBV\"), alloc(ufbv_fct));\n s->set_tactic_for(symbol(\"BV\"), alloc(ufbv_fct)); \n\ts->set_tactic_for(symbol(\"QF_FPA\"), alloc(qffpa_fct));\n}\n\nsolver * mk_smt_strategic_solver(cmd_context & ctx) {\n strategic_solver * s = alloc(strategic_solver_cmd, ctx);\n s->set_inc_solver(mk_quasi_incremental_smt_solver(ctx));\n init(s);\n return s;\n}\n\nsolver * mk_smt_strategic_solver(bool force_tactic) {\n strategic_solver * s = alloc(strategic_solver_api);\n s->force_tactic(force_tactic);\n s->set_inc_solver(mk_default_solver());\n init(s);\n return s;\n}\n<commit_msg>n\/a<commit_after>\/*++\nCopyright (c) 2012 Microsoft Corporation\n\nModule Name:\n\n smt_strategic_solver.h\n\nAbstract:\n\n Create a strategic solver with tactic for all main logics\n used in SMT.\n\nAuthor:\n\n Leonardo (leonardo) 2012-02-19\n\nNotes:\n\n--*\/\n#include\"cmd_context.h\"\n#include\"ni_solver.h\"\n#include\"strategic_solver.h\"\n#include\"qfbv_tactic.h\"\n#include\"qflia_tactic.h\"\n#include\"qfnia_tactic.h\"\n#include\"qfnra_tactic.h\"\n#include\"qfuf_tactic.h\"\n#include\"qflra_tactic.h\"\n#include\"quant_tactics.h\"\n#include\"qfauflia_tactic.h\"\n#include\"qfaufbv_tactic.h\"\n#include\"qfufbv_tactic.h\"\n#include\"qfidl_tactic.h\"\n#include\"default_tactic.h\"\n#include\"ufbv_tactic.h\"\n#include\"qffpa_tactic.h\"\n#include\"default_solver.h\"\n\nMK_SIMPLE_TACTIC_FACTORY(qfuf_fct, mk_qfuf_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfidl_fct, mk_qfidl_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfauflia_fct, mk_qfauflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(auflia_fct, mk_auflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(auflira_fct, mk_auflira_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(aufnira_fct, mk_aufnira_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(ufnia_fct, mk_ufnia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(uflra_fct, mk_uflra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(lra_fct, mk_lra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfbv_fct, mk_qfbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(default_fct, mk_default_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfaufbv_fct, mk_qfaufbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qflra_fct, mk_qflra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qflia_fct, mk_qflia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfufbv_fct, mk_qfufbv_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfnia_fct, mk_qfnia_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qfnra_fct, mk_qfnra_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(qffpa_fct, mk_qffpa_tactic(m, p));\nMK_SIMPLE_TACTIC_FACTORY(ufbv_fct, mk_ufbv_tactic(m, p));\n\nstatic void init(strategic_solver * s) {\n s->set_default_tactic(alloc(default_fct));\n s->set_tactic_for(symbol(\"QF_UF\"), alloc(qfuf_fct));\n s->set_tactic_for(symbol(\"QF_BV\"), alloc(qfbv_fct));\n s->set_tactic_for(symbol(\"QF_IDL\"), alloc(qfidl_fct));\n s->set_tactic_for(symbol(\"QF_LIA\"), alloc(qflia_fct));\n s->set_tactic_for(symbol(\"QF_LRA\"), alloc(qflra_fct));\n s->set_tactic_for(symbol(\"QF_NIA\"), alloc(qfnia_fct));\n s->set_tactic_for(symbol(\"QF_NRA\"), alloc(qfnra_fct));\n s->set_tactic_for(symbol(\"QF_AUFLIA\"), alloc(qfauflia_fct));\n s->set_tactic_for(symbol(\"QF_AUFBV\"), alloc(qfaufbv_fct));\n s->set_tactic_for(symbol(\"QF_ABV\"), alloc(qfaufbv_fct));\n s->set_tactic_for(symbol(\"QF_UFBV\"), alloc(qfufbv_fct));\n s->set_tactic_for(symbol(\"AUFLIA\"), alloc(auflia_fct));\n s->set_tactic_for(symbol(\"AUFLIRA\"), alloc(auflira_fct));\n s->set_tactic_for(symbol(\"AUFNIRA\"), alloc(aufnira_fct));\n s->set_tactic_for(symbol(\"UFNIA\"), alloc(ufnia_fct));\n s->set_tactic_for(symbol(\"UFLRA\"), alloc(uflra_fct));\n s->set_tactic_for(symbol(\"LRA\"), alloc(lra_fct));\n s->set_tactic_for(symbol(\"UFBV\"), alloc(ufbv_fct));\n s->set_tactic_for(symbol(\"BV\"), alloc(ufbv_fct)); \n s->set_tactic_for(symbol(\"QF_FPA\"), alloc(qffpa_fct));\n}\n\nsolver * mk_smt_strategic_solver(cmd_context & ctx) {\n strategic_solver * s = alloc(strategic_solver_cmd, ctx);\n s->set_inc_solver(mk_quasi_incremental_smt_solver(ctx));\n init(s);\n return s;\n}\n\nsolver * mk_smt_strategic_solver(bool force_tactic) {\n strategic_solver * s = alloc(strategic_solver_api);\n s->force_tactic(force_tactic);\n s->set_inc_solver(mk_default_solver());\n init(s);\n return s;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"swganh\/connection\/connection_service.h\"\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <glog\/logging.h>\n\n#include \"anh\/crc.h\"\n#include \"anh\/event_dispatcher\/basic_event.h\"\n#include \"anh\/event_dispatcher\/event_dispatcher_interface.h\"\n#include \"anh\/network\/soe\/packet.h\"\n#include \"anh\/network\/soe\/server.h\"\n#include \"anh\/plugin\/plugin_manager.h\"\n#include \"anh\/service\/service_directory_interface.h\"\n#include \"anh\/service\/service_manager.h\"\n\n#include \"swganh\/app\/swganh_kernel.h\"\n\n#include \"swganh\/connection\/ping_server.h\"\n#include \"swganh\/connection\/connection_client.h\"\n#include \"swganh\/connection\/providers\/mysql_session_provider.h\"\n\n#include \"swganh\/object\/object.h\"\n#include \"swganh\/object\/player\/player.h\"\n\n#include \"swganh\/messages\/logout_message.h\"\n\nusing namespace anh::app;\nusing namespace anh::event_dispatcher;\nusing namespace anh::network;\nusing namespace anh::service;\nusing namespace swganh::base;\nusing namespace swganh::character;\nusing namespace swganh::connection;\nusing namespace swganh::login;\nusing namespace swganh::messages;\nusing namespace swganh::simulation;\n\nusing namespace std;\n\nusing boost::asio::ip::udp;\n\nConnectionService::ConnectionService(\n string listen_address, \n uint16_t listen_port, \n uint16_t ping_port, \n KernelInterface* kernel)\n : BaseService(kernel)\n#pragma warning(push)\n#pragma warning(disable: 4355)\n , SwgMessageRouter([=] (const boost::asio::ip::udp::endpoint& endpoint) {\n return GetClientFromEndpoint(endpoint); \n })\n#pragma warning(pop)\n , ping_server_(nullptr)\n , listen_address_(listen_address)\n , listen_port_(listen_port)\n , soe_server_(nullptr)\n{\n soe_server_.reset(new soe::Server(\n kernel->GetIoService(),\n bind(&ConnectionService::RouteMessage, this, placeholders::_1)));\n soe_server_->event_dispatcher(kernel->GetEventDispatcher());\n \n session_provider_ = kernel->GetPluginManager()->CreateObject<providers::SessionProviderInterface>(\"ConnectionService::SessionProvider\");\n if (!session_provider_) \n {\n session_provider_ = make_shared<providers::MysqlSessionProvider>(kernel->GetDatabaseManager());\n }\n}\n\nServiceDescription ConnectionService::GetServiceDescription() {\n ServiceDescription service_description(\n \"ANH Connection Service\",\n \"connection\",\n \"0.1\",\n listen_address(), \n 0,\n listen_port(), \n ping_port_);\n\n return service_description;\n}\n\nvoid ConnectionService::subscribe() {\n auto event_dispatcher = kernel()->GetEventDispatcher();\n \n RegisterMessageHandler<ClientIdMsg>(\n bind(&ConnectionService::HandleClientIdMsg_, this, placeholders::_1, placeholders::_2), false);\n\n RegisterMessageHandler<CmdSceneReady>(\n bind(&ConnectionService::HandleCmdSceneReady_, this, placeholders::_1, placeholders::_2));\n\n event_dispatcher->subscribe(\"NetworkSessionRemoved\", [this] (shared_ptr<EventInterface> incoming_event) -> bool {\n auto session_removed = std::static_pointer_cast<anh::event_dispatcher::BasicEvent<anh::network::soe::SessionData>>(incoming_event);\n \n \/\/ Message was triggered from our server so process it.\n if (session_removed->session->server() == server().get()) {\n RemoveClient_(session_removed->session);\n }\n\n return true;\n });\n}\n\nvoid ConnectionService::onStart() {\n ping_server_ = make_shared<PingServer>(kernel()->GetIoService(), ping_port_);\n soe_server_->Start(listen_port_);\n \n character_service_ = std::static_pointer_cast<CharacterService>(kernel()->GetServiceManager()->GetService(\"CharacterService\")); \n login_service_ = std::static_pointer_cast<swganh::login::LoginService>(kernel()->GetServiceManager()->GetService(\"LoginService\"));\n simulation_service_ = std::static_pointer_cast<swganh::simulation::SimulationService>(kernel()->GetServiceManager()->GetService(\"SimulationService\"));\n}\n\nvoid ConnectionService::onStop() {\n soe_server_->Shutdown();\n clients_.clear();\n}\n\nconst string& ConnectionService::listen_address() {\n return listen_address_;\n}\n\nuint16_t ConnectionService::listen_port() {\n return listen_port_;\n}\n\nConnectionService::ClientMap& ConnectionService::clients() {\n return clients_;\n}\n\nstd::unique_ptr<anh::network::soe::Server>& ConnectionService::server() {\n return soe_server_;\n}\n\nshared_ptr<CharacterService> ConnectionService::character_service() {\n return character_service_.lock();\n}\n\nshared_ptr<LoginService> ConnectionService::login_service() {\n return login_service_.lock();\n}\n\nshared_ptr<ConnectionClient> ConnectionService::GetClientFromEndpoint(\n const udp::endpoint& remote_endpoint)\n{\n shared_ptr<ConnectionClient> client = nullptr;\n \n ClientMap::accessor a;\n\n if (clients_.find(a, remote_endpoint)) {\n client = a->second;\n }\n\n return client;\n}\n\nvoid ConnectionService::AddClient_(\n uint64_t player_id, \n std::shared_ptr<ConnectionClient> client) \n{\n ClientMap& client_map = clients();\n\n auto find_it = std::find_if(\n client_map.begin(), \n client_map.end(), \n [client, player_id] (ClientMap::value_type& conn_client) \n {\n return conn_client.second->GetPlayerId() == player_id;\n });\n\n if (find_it != client_map.end()) {\n LogoutMessage message;\n (*find_it).second->Send(message);\n\n client_map.erase(find_it->first);\n }\n \n DLOG(WARNING) << \"Adding connection client\";\n\n ClientMap::accessor a;\n client_map.insert(a, client->GetSession()->remote_endpoint());\n a->second = client;\n\n DLOG(WARNING) << \"Connection service currently has (\"<< client_map.size() << \") clients\";\n}\n\nvoid ConnectionService::RemoveClient_(std::shared_ptr<anh::network::soe::Session> session) {\n auto client = GetClientFromEndpoint(session->remote_endpoint());\n \n auto client_map = clients();\n\n if (client) {\n\n auto controller = client->GetController();\n if (controller)\n {\n\t\t\t\/\/ player is always + 1 from the creature\n\t\t\tauto simulation_service = simulation_service_.lock();\n\t\t\tauto player = simulation_service->LoadObjectById<swganh::object::player::Player>(controller->GetObject()->GetObjectId() + 1);\n\t\t\tplayer->AddStatusFlag(swganh::object::player::LD);\n\t\t\t\n\t\t\t\/\/ set a timer to 5 minutes to destroy the object, unless logged back in.\n\t\t\tauto deadline_timer = make_shared<boost::asio::deadline_timer>(kernel()->GetIoService(), boost::posix_time::seconds(30));\n\t\t\tdeadline_timer->async_wait(boost::bind(&ConnectionService::RemoveClientTimerHandler_, this, boost::asio::placeholders::error, deadline_timer, 10, controller));\n }\n\n DLOG(WARNING) << \"Removing disconnected client\";\n client_map.erase(session->remote_endpoint());\n\t\tDLOG(WARNING) << \"Removing Session\";\n\t\tsession_provider_->EndGameSession(client->GetPlayerId());\n }\n \n DLOG(WARNING) << \"Connection service currently has (\"<< client_map.size() << \") clients\";\n}\nvoid ConnectionService::RemoveClientTimerHandler_(const boost::system::error_code& e, shared_ptr<boost::asio::deadline_timer> timer, int delay_in_secs, shared_ptr<swganh::object::ObjectController> controller)\n{\n\tif (controller)\n\t{\n\t\t\/\/ destroy if they haven't reconnected\n\t\tif (controller->GetRemoteClient()->GetSession() == nullptr || !controller->GetRemoteClient()->GetSession()->connected())\n\t\t{\n\t\t\tauto object_id = controller->GetObject()->GetObjectId();\n\t\t\tDLOG(WARNING) << \"Destroying Object \" << object_id << \" after \" << delay_in_secs << \" seconds.\";\n\t\t\tauto simulation_service = simulation_service_.lock();\n\t\t\tsimulation_service->RemoveObjectById(object_id);\n\t\t}\n\t}\n}\nvoid ConnectionService::HandleCmdSceneReady_(std::shared_ptr<ConnectionClient> client, const CmdSceneReady& message) {\n DLOG(WARNING) << \"Handling CmdSceneReady\";\n \n client->Send(CmdSceneReady());\n}\n\nvoid ConnectionService::HandleClientIdMsg_(std::shared_ptr<ConnectionClient> client, const ClientIdMsg& message) {\n DLOG(WARNING) << \"Handling ClientIdMsg\";\n\n \/\/ get session key from login service\n uint32_t account_id = login_service()->GetAccountBySessionKey(message.session_hash);\n\n \/\/ authorized\n if (! account_id) {\n DLOG(WARNING) << \"Account_id not found from session key, unauthorized access.\";\n return;\n }\n \n \/\/ gets player from account\n uint64_t player_id = session_provider_->GetPlayerId(account_id);\n \n \/\/ authorized\n if (! player_id) {\n DLOG(WARNING) << \"No player found for the requested account, unauthorized access.\";\n return;\n }\n \n \/\/ creates a new session and stores it for later use\n if (!session_provider_->CreateGameSession(player_id, client->GetSession()->connection_id())) { \n DLOG(WARNING) << \"Player Not Inserted into Session Map because No Game Session Created!\";\n }\n \n client->Connect(account_id, player_id);\n\n AddClient_(player_id, client);\n\n ClientPermissionsMessage client_permissions;\n client_permissions.galaxy_available = kernel()->GetServiceDirectory()->galaxy().status();\n client_permissions.available_character_slots = character_service()->GetMaxCharacters(account_id);\n \/\/ @TODO: Replace with configurable value\n client_permissions.unlimited_characters = 0;\n\n client->Send(client_permissions);\n}\n<commit_msg>Gets the existing object instead of loading a second instance<commit_after>\n#include \"swganh\/connection\/connection_service.h\"\n\n#include <boost\/date_time\/posix_time\/posix_time.hpp>\n#include <boost\/lexical_cast.hpp>\n#include <glog\/logging.h>\n\n#include \"anh\/crc.h\"\n#include \"anh\/event_dispatcher\/basic_event.h\"\n#include \"anh\/event_dispatcher\/event_dispatcher_interface.h\"\n#include \"anh\/network\/soe\/packet.h\"\n#include \"anh\/network\/soe\/server.h\"\n#include \"anh\/plugin\/plugin_manager.h\"\n#include \"anh\/service\/service_directory_interface.h\"\n#include \"anh\/service\/service_manager.h\"\n\n#include \"swganh\/app\/swganh_kernel.h\"\n\n#include \"swganh\/connection\/ping_server.h\"\n#include \"swganh\/connection\/connection_client.h\"\n#include \"swganh\/connection\/providers\/mysql_session_provider.h\"\n\n#include \"swganh\/object\/object.h\"\n#include \"swganh\/object\/player\/player.h\"\n\n#include \"swganh\/messages\/logout_message.h\"\n\nusing namespace anh::app;\nusing namespace anh::event_dispatcher;\nusing namespace anh::network;\nusing namespace anh::service;\nusing namespace swganh::base;\nusing namespace swganh::character;\nusing namespace swganh::connection;\nusing namespace swganh::login;\nusing namespace swganh::messages;\nusing namespace swganh::simulation;\n\nusing namespace std;\n\nusing boost::asio::ip::udp;\n\nConnectionService::ConnectionService(\n string listen_address, \n uint16_t listen_port, \n uint16_t ping_port, \n KernelInterface* kernel)\n : BaseService(kernel)\n#pragma warning(push)\n#pragma warning(disable: 4355)\n , SwgMessageRouter([=] (const boost::asio::ip::udp::endpoint& endpoint) {\n return GetClientFromEndpoint(endpoint); \n })\n#pragma warning(pop)\n , ping_server_(nullptr)\n , listen_address_(listen_address)\n , listen_port_(listen_port)\n , soe_server_(nullptr)\n{\n soe_server_.reset(new soe::Server(\n kernel->GetIoService(),\n bind(&ConnectionService::RouteMessage, this, placeholders::_1)));\n soe_server_->event_dispatcher(kernel->GetEventDispatcher());\n \n session_provider_ = kernel->GetPluginManager()->CreateObject<providers::SessionProviderInterface>(\"ConnectionService::SessionProvider\");\n if (!session_provider_) \n {\n session_provider_ = make_shared<providers::MysqlSessionProvider>(kernel->GetDatabaseManager());\n }\n}\n\nServiceDescription ConnectionService::GetServiceDescription() {\n ServiceDescription service_description(\n \"ANH Connection Service\",\n \"connection\",\n \"0.1\",\n listen_address(), \n 0,\n listen_port(), \n ping_port_);\n\n return service_description;\n}\n\nvoid ConnectionService::subscribe() {\n auto event_dispatcher = kernel()->GetEventDispatcher();\n \n RegisterMessageHandler<ClientIdMsg>(\n bind(&ConnectionService::HandleClientIdMsg_, this, placeholders::_1, placeholders::_2), false);\n\n RegisterMessageHandler<CmdSceneReady>(\n bind(&ConnectionService::HandleCmdSceneReady_, this, placeholders::_1, placeholders::_2));\n\n event_dispatcher->subscribe(\"NetworkSessionRemoved\", [this] (shared_ptr<EventInterface> incoming_event) -> bool {\n auto session_removed = std::static_pointer_cast<anh::event_dispatcher::BasicEvent<anh::network::soe::SessionData>>(incoming_event);\n \n \/\/ Message was triggered from our server so process it.\n if (session_removed->session->server() == server().get()) {\n RemoveClient_(session_removed->session);\n }\n\n return true;\n });\n}\n\nvoid ConnectionService::onStart() {\n ping_server_ = make_shared<PingServer>(kernel()->GetIoService(), ping_port_);\n soe_server_->Start(listen_port_);\n \n character_service_ = std::static_pointer_cast<CharacterService>(kernel()->GetServiceManager()->GetService(\"CharacterService\")); \n login_service_ = std::static_pointer_cast<swganh::login::LoginService>(kernel()->GetServiceManager()->GetService(\"LoginService\"));\n simulation_service_ = std::static_pointer_cast<swganh::simulation::SimulationService>(kernel()->GetServiceManager()->GetService(\"SimulationService\"));\n}\n\nvoid ConnectionService::onStop() {\n soe_server_->Shutdown();\n clients_.clear();\n}\n\nconst string& ConnectionService::listen_address() {\n return listen_address_;\n}\n\nuint16_t ConnectionService::listen_port() {\n return listen_port_;\n}\n\nConnectionService::ClientMap& ConnectionService::clients() {\n return clients_;\n}\n\nstd::unique_ptr<anh::network::soe::Server>& ConnectionService::server() {\n return soe_server_;\n}\n\nshared_ptr<CharacterService> ConnectionService::character_service() {\n return character_service_.lock();\n}\n\nshared_ptr<LoginService> ConnectionService::login_service() {\n return login_service_.lock();\n}\n\nshared_ptr<ConnectionClient> ConnectionService::GetClientFromEndpoint(\n const udp::endpoint& remote_endpoint)\n{\n shared_ptr<ConnectionClient> client = nullptr;\n \n ClientMap::accessor a;\n\n if (clients_.find(a, remote_endpoint)) {\n client = a->second;\n }\n\n return client;\n}\n\nvoid ConnectionService::AddClient_(\n uint64_t player_id, \n std::shared_ptr<ConnectionClient> client) \n{\n ClientMap& client_map = clients();\n\n auto find_it = std::find_if(\n client_map.begin(), \n client_map.end(), \n [client, player_id] (ClientMap::value_type& conn_client) \n {\n return conn_client.second->GetPlayerId() == player_id;\n });\n\n if (find_it != client_map.end()) {\n LogoutMessage message;\n (*find_it).second->Send(message);\n\n client_map.erase(find_it->first);\n }\n \n DLOG(WARNING) << \"Adding connection client\";\n\n ClientMap::accessor a;\n client_map.insert(a, client->GetSession()->remote_endpoint());\n a->second = client;\n\n DLOG(WARNING) << \"Connection service currently has (\"<< client_map.size() << \") clients\";\n}\n\nvoid ConnectionService::RemoveClient_(std::shared_ptr<anh::network::soe::Session> session) {\n auto client = GetClientFromEndpoint(session->remote_endpoint());\n \n auto client_map = clients();\n\n if (client) {\n\n auto controller = client->GetController();\n if (controller)\n {\n\t\t\t\/\/ player is always + 1 from the creature\n\t\t\tauto simulation_service = simulation_service_.lock();\n auto player = simulation_service->GetObjectById<swganh::object::player::Player>(controller->GetObject()->GetObjectId() + 1);\n\t\t\tplayer->AddStatusFlag(swganh::object::player::LD);\n\t\t\t\n\t\t\t\/\/ set a timer to 5 minutes to destroy the object, unless logged back in.\n\t\t\tauto deadline_timer = make_shared<boost::asio::deadline_timer>(kernel()->GetIoService(), boost::posix_time::seconds(30));\n\t\t\tdeadline_timer->async_wait(boost::bind(&ConnectionService::RemoveClientTimerHandler_, this, boost::asio::placeholders::error, deadline_timer, 10, controller));\n }\n\n DLOG(WARNING) << \"Removing disconnected client\";\n client_map.erase(session->remote_endpoint());\n\t\tDLOG(WARNING) << \"Removing Session\";\n\t\tsession_provider_->EndGameSession(client->GetPlayerId());\n }\n \n DLOG(WARNING) << \"Connection service currently has (\"<< client_map.size() << \") clients\";\n}\nvoid ConnectionService::RemoveClientTimerHandler_(const boost::system::error_code& e, shared_ptr<boost::asio::deadline_timer> timer, int delay_in_secs, shared_ptr<swganh::object::ObjectController> controller)\n{\n\tif (controller)\n\t{\n\t\t\/\/ destroy if they haven't reconnected\n\t\tif (controller->GetRemoteClient()->GetSession() == nullptr || !controller->GetRemoteClient()->GetSession()->connected())\n\t\t{\n\t\t\tauto object_id = controller->GetObject()->GetObjectId();\n\t\t\tDLOG(WARNING) << \"Destroying Object \" << object_id << \" after \" << delay_in_secs << \" seconds.\";\n\t\t\tauto simulation_service = simulation_service_.lock();\n\t\t\tsimulation_service->RemoveObjectById(object_id);\n\t\t}\n\t}\n}\nvoid ConnectionService::HandleCmdSceneReady_(std::shared_ptr<ConnectionClient> client, const CmdSceneReady& message) {\n DLOG(WARNING) << \"Handling CmdSceneReady\";\n \n client->Send(CmdSceneReady());\n}\n\nvoid ConnectionService::HandleClientIdMsg_(std::shared_ptr<ConnectionClient> client, const ClientIdMsg& message) {\n DLOG(WARNING) << \"Handling ClientIdMsg\";\n\n \/\/ get session key from login service\n uint32_t account_id = login_service()->GetAccountBySessionKey(message.session_hash);\n\n \/\/ authorized\n if (! account_id) {\n DLOG(WARNING) << \"Account_id not found from session key, unauthorized access.\";\n return;\n }\n \n \/\/ gets player from account\n uint64_t player_id = session_provider_->GetPlayerId(account_id);\n \n \/\/ authorized\n if (! player_id) {\n DLOG(WARNING) << \"No player found for the requested account, unauthorized access.\";\n return;\n }\n \n \/\/ creates a new session and stores it for later use\n if (!session_provider_->CreateGameSession(player_id, client->GetSession()->connection_id())) { \n DLOG(WARNING) << \"Player Not Inserted into Session Map because No Game Session Created!\";\n }\n \n client->Connect(account_id, player_id);\n\n AddClient_(player_id, client);\n\n ClientPermissionsMessage client_permissions;\n client_permissions.galaxy_available = kernel()->GetServiceDirectory()->galaxy().status();\n client_permissions.available_character_slots = character_service()->GetMaxCharacters(account_id);\n \/\/ @TODO: Replace with configurable value\n client_permissions.unlimited_characters = 0;\n\n client->Send(client_permissions);\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"swganh\/simulation\/simulation_service.h\"\n\n#include <boost\/algorithm\/string.hpp>\n\n#include \"anh\/crc.h\"\n#include \"anh\/service\/service_manager.h\"\n#include \"anh\/database\/database_manager.h\"\n\n#include \"swganh\/app\/swganh_kernel.h\"\n\n#include \"swganh\/connection\/connection_client.h\"\n#include \"swganh\/connection\/connection_service.h\"\n\n#include \"swganh\/messages\/select_character.h\"\n\n#include \"swganh\/network\/remote_client.h\"\n\n#include \"swganh\/object\/object.h\"\n#include \"swganh\/object\/object_controller.h\"\n#include \"swganh\/object\/object_manager.h\"\n\n\/\/ factories\n#include \"swganh\/object\/creature\/creature_factory.h\"\n#include \"swganh\/object\/creature\/creature.h\"\n#include \"swganh\/object\/tangible\/tangible_factory.h\"\n#include \"swganh\/object\/tangible\/tangible.h\"\n#include \"swganh\/object\/intangible\/intangible_factory.h\"\n#include \"swganh\/object\/intangible\/intangible.h\"\n#include \"swganh\/object\/player\/player_factory.h\"\n#include \"swganh\/object\/player\/player.h\"\n\n#include \"swganh\/simulation\/scene_manager.h\"\n#include \"swganh\/messages\/cmd_start_scene.h\"\n#include \"swganh\/messages\/cmd_scene_ready.h\"\n#include \"swganh\/messages\/obj_controller_message.h\"\n#include \"swganh\/messages\/update_containment_message.h\"\n\n#include \"swganh\/simulation\/movement_manager.h\"\n\nusing namespace std;\nusing namespace swganh::connection;\nusing namespace swganh::messages;\nusing namespace swganh::network;\nusing namespace swganh::object;\nusing namespace swganh::simulation;\n\nusing anh::app::KernelInterface;\nusing anh::service::ServiceDescription;\nusing swganh::base::BaseService;\n\nnamespace swganh {\nnamespace simulation {\n\nclass SimulationServiceImpl {\npublic:\n const shared_ptr<ObjectManager>& GetObjectManager()\n {\n if (!object_manager_)\n {\n object_manager_ = make_shared<ObjectManager>();\n }\n\n return object_manager_;\n }\n\n const shared_ptr<SceneManager>& GetSceneManager()\n {\n if (!scene_manager_)\n {\n scene_manager_ = make_shared<SceneManager>();\n }\n\n return scene_manager_;\n }\n\n const shared_ptr<MovementManager>& GetMovementManager()\n {\n if (!movement_manager_)\n {\n movement_manager_ = make_shared<MovementManager>();\n }\n\n return movement_manager_;\n }\n void PersistObject(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n DLOG(WARNING) << \"Nothing to persist, no object saved\";\n return;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n object_manager_->PersistObject(find_iter->second);\n }\n\tvoid PersistRelatedObjects(uint64_t parent_object_id)\n\t{\n\t\tauto find_iter = loaded_objects_.find(parent_object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n DLOG(WARNING) << \"Nothing to persist, no object saved\";\n return;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n\t\t\/\/ first persist the parent object\n\t\tPersistObject(parent_object_id);\n\t\t\/\/ get all the contained objects\n\t\tauto contained_objects = find_iter->second->GetContainedObjects();\n\t\tfor_each(begin(contained_objects), end(contained_objects), [=](pair<uint64_t, shared_ptr<Object>> pair){\n\t\t\t\/\/ if there's objects contained within this object do a recursion call\n\t\t\tauto inner_contained = pair.second->GetContainedObjects();\n\t\t\tif (inner_contained.size() > 0)\n\t\t\t{\n\t\t\t\tDLOG(WARNING) << \"Persist inner container recursively:\" << pair.first;\n\t\t\t\tPersistRelatedObjects(pair.first);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tDLOG(WARNING) << \"Persist inner container:\" << pair.first;\n\t\t\t\tPersistObject(pair.first);\n\t\t\t}\n\t\t});\n\t}\n shared_ptr<Object> LoadObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter != loaded_objects_.end())\n {\n return find_iter->second;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n \n auto object = object_manager_->CreateObjectFromStorage(object_id);\n\n loaded_objects_.insert(make_pair(object_id, object));\n\n return object;\n }\n shared_ptr<Object> LoadObjectById(uint64_t object_id, uint32_t type)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter != loaded_objects_.end())\n {\n return find_iter->second;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n \n auto object = object_manager_->CreateObjectFromStorage(object_id, type);\n\n loaded_objects_.insert(make_pair(object_id, object));\n\n return object;\n }\n \n shared_ptr<Object> GetObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n return nullptr;\n }\n\n return find_iter->second;\n }\n\n void RemoveObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n throw swganh::object::InvalidObject(\"Requested an invalid object\");\n }\n\n auto scene = scene_manager_->GetScene(find_iter->second->GetSceneId());\n if (scene)\n {\n scene->RemoveObject(find_iter->second);\n }\n\n StopControllingObject(find_iter->second);\n\n loaded_objects_.unsafe_erase(find_iter);\n }\n\n shared_ptr<ObjectController> StartControllingObject(const shared_ptr<Object>& object, shared_ptr<RemoteClient> client)\n { \n auto controller = make_shared<ObjectController>(object, client);\n \n \/\/ If a controller already exists update it, otherwise create a new controller record.\n auto find_iter = controlled_objects_.find(object->GetObjectId()); \n if (find_iter != controlled_objects_.end())\n {\n find_iter->second = controller;\n }\n else \n {\n controlled_objects_.insert(make_pair(object->GetObjectId(), controller)); \n }\n \n object->SetController(controller);\n\n auto connection_client = std::static_pointer_cast<ConnectionClient>(client);\n connection_client->SetController(controller);\n\n return controller;\n }\n\n void StopControllingObject(const shared_ptr<Object>& object)\n {\n auto find_iter = controlled_objects_.find(object->GetObjectId());\n\n if (find_iter == controlled_objects_.end())\n {\n throw swganh::object::InvalidObject(\"Object has no controller\");\n }\n \n controlled_objects_.unsafe_erase(find_iter);\n }\n \n void RegisterControllerHandler(uint32_t handler_id, swganh::object::ObjControllerHandler&& handler)\n {\n auto find_iter = controller_handlers_.find(handler_id);\n\n if (find_iter != controller_handlers_.end())\n {\n \/\/ just return, we already have the handler registered\n return;\n \/\/throw std::runtime_error(\"ObjControllerHandler already exists\");\n }\n\n controller_handlers_.insert(make_pair(handler_id, move(handler)));\n }\n\n void UnregisterControllerHandler(uint32_t handler_id)\n {\n auto find_iter = controller_handlers_.find(handler_id);\n\n if (find_iter == controller_handlers_.end())\n {\n throw std::runtime_error(\"ObjControllerHandler does not exist\");\n }\n\n controller_handlers_.unsafe_erase(find_iter);\n }\n\n void HandleObjControllerMessage(\n shared_ptr<ConnectionClient> client,\n const ObjControllerMessage& message)\n {\n auto find_iter = controller_handlers_.find(message.header);\n \n if (find_iter == controller_handlers_.end())\n {\n throw std::runtime_error(\"No handler registered to process the given message.\");\n }\n \n find_iter->second(client->GetController(), message);\n }\n \n void HandleSelectCharacter(\n shared_ptr<ConnectionClient> client, \n const SelectCharacter& message)\n {\n auto object = GetObjectById(message.character_id);\n \n if (!object)\n {\n object = LoadObjectById(message.character_id, creature::Creature::type);\n }\n \n StartControllingObject(object, client);\n\n auto scene = scene_manager_->GetScene(object->GetSceneId());\n\n if (!scene) \n {\n throw std::runtime_error(\"Invalid scene selected for object\");\n }\n\n \/\/ CmdStartScene\n CmdStartScene start_scene;\n start_scene.ignore_layout = 0;\n start_scene.character_id = object->GetObjectId();\n \n start_scene.terrain_map = scene->GetTerrainMap();\n start_scene.position = object->GetPosition();\n start_scene.shared_race_template = object->GetTemplate();\n start_scene.galaxy_time = 0;\n client->GetSession()->SendMessage(start_scene);\n\n \/\/ Add object to scene and send baselines\n scene->AddObject(object);\n }\n\nprivate:\n shared_ptr<ObjectManager> object_manager_;\n shared_ptr<SceneManager> scene_manager_;\n shared_ptr<MovementManager> movement_manager_;\n\n ObjControllerHandlerMap controller_handlers_;\n\n tbb::concurrent_unordered_map<uint64_t, shared_ptr<Object>> loaded_objects_;\n tbb::concurrent_unordered_map<uint64_t, shared_ptr<ObjectController>> controlled_objects_;\n};\n\n}} \/\/ namespace swganh::simulation\n\nSimulationService::SimulationService(KernelInterface* kernel)\n : BaseService(kernel) \n , impl_(new SimulationServiceImpl)\n{}\n \nSimulationService::~SimulationService()\n{}\n\nServiceDescription SimulationService::GetServiceDescription()\n{\n ServiceDescription service_description(\n \"SimulationService\",\n \"simulation\",\n \"0.1\",\n \"127.0.0.1\", \n 0, \n 0, \n 0);\n\n return service_description;\n}\n\nvoid SimulationService::StartScene(const std::string& scene_label)\n{\n impl_->GetSceneManager()->LoadSceneDescriptionsFromDatabase(kernel()->GetDatabaseManager()->getConnection(\"galaxy\"));\n impl_->GetSceneManager()->StartScene(scene_label);\n \/\/ load factories\n RegisterObjectFactories(kernel());\n}\n\nvoid SimulationService::StopScene(const std::string& scene_label)\n{\n impl_->GetSceneManager()->StopScene(scene_label);\n}\nvoid SimulationService::RegisterObjectFactories(anh::app::KernelInterface* kernel)\n{\n auto db_manager = kernel->GetDatabaseManager();\n impl_->GetObjectManager()->RegisterObjectType(0, make_shared<ObjectFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(tangible::Tangible::type, make_shared<tangible::TangibleFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(intangible::Intangible::type, make_shared<intangible::IntangibleFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(creature::Creature::type, make_shared<creature::CreatureFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(player::Player::type, make_shared<player::PlayerFactory>(db_manager, this));\n}\n\nvoid SimulationService::PersistObject(uint64_t object_id)\n{\n impl_->PersistObject(object_id);\n}\nvoid SimulationService::PersistRelatedObjects(uint64_t parent_object_id)\n{\n\timpl_->PersistRelatedObjects(parent_object_id);\n}\nshared_ptr<Object> SimulationService::LoadObjectById(uint64_t object_id)\n{\n return impl_->LoadObjectById(object_id);\n}\nshared_ptr<Object> SimulationService::LoadObjectById(uint64_t object_id, uint32_t type)\n{\n return impl_->LoadObjectById(object_id, type);\n}\n\nshared_ptr<Object> SimulationService::GetObjectById(uint64_t object_id)\n{\n return impl_->GetObjectById(object_id);\n}\n\nvoid SimulationService::RemoveObjectById(uint64_t object_id)\n{\n impl_->RemoveObjectById(object_id);\n}\n\nshared_ptr<ObjectController> SimulationService::StartControllingObject(\n const shared_ptr<Object>& object, \n shared_ptr<RemoteClient> client)\n{\n return impl_->StartControllingObject(object, client);\n}\n\nvoid SimulationService::StopControllingObject(const shared_ptr<Object>& object)\n{\n impl_->StopControllingObject(object);\n}\n\nvoid SimulationService::RegisterControllerHandler(\n uint32_t handler_id, \n swganh::object::ObjControllerHandler&& handler)\n{\n impl_->RegisterControllerHandler(handler_id, move(handler));\n}\n\nvoid SimulationService::UnregisterControllerHandler(uint32_t handler_id)\n{\n impl_->UnregisterControllerHandler(handler_id);\n}\n\nvoid SimulationService::onStart()\n{\n auto connection_service = std::static_pointer_cast<ConnectionService>(kernel()->GetServiceManager()->GetService(\"ConnectionService\"));\n \n connection_service->RegisterMessageHandler<SelectCharacter>([=] (\n shared_ptr<ConnectionClient> client, \n const SelectCharacter& message)\n {\n impl_->HandleSelectCharacter(client, message);\n });\n\n connection_service->RegisterMessageHandler<ObjControllerMessage>([=] (\n shared_ptr<ConnectionClient> client, \n const ObjControllerMessage& message)\n {\n impl_->HandleObjControllerMessage(client, message);\n });\n\n\n RegisterControllerHandler(0x00000071, [this] (\n const std::shared_ptr<ObjectController>& controller, \n const swganh::messages::ObjControllerMessage& message) \n {\n impl_->GetMovementManager()->HandleDataTransform(controller, message);\n });\n \n RegisterControllerHandler(0x000000F1, [this] (\n const std::shared_ptr<ObjectController>& controller, \n const swganh::messages::ObjControllerMessage& message) \n {\n impl_->GetMovementManager()->HandleDataTransformWithParent(controller, message);\n });\n}\n<commit_msg>Updates the client if an existing object controller exists.<commit_after>\n#include \"swganh\/simulation\/simulation_service.h\"\n\n#include <boost\/algorithm\/string.hpp>\n\n#include \"anh\/crc.h\"\n#include \"anh\/service\/service_manager.h\"\n#include \"anh\/database\/database_manager.h\"\n\n#include \"swganh\/app\/swganh_kernel.h\"\n\n#include \"swganh\/connection\/connection_client.h\"\n#include \"swganh\/connection\/connection_service.h\"\n\n#include \"swganh\/messages\/select_character.h\"\n\n#include \"swganh\/network\/remote_client.h\"\n\n#include \"swganh\/object\/object.h\"\n#include \"swganh\/object\/object_controller.h\"\n#include \"swganh\/object\/object_manager.h\"\n\n\/\/ factories\n#include \"swganh\/object\/creature\/creature_factory.h\"\n#include \"swganh\/object\/creature\/creature.h\"\n#include \"swganh\/object\/tangible\/tangible_factory.h\"\n#include \"swganh\/object\/tangible\/tangible.h\"\n#include \"swganh\/object\/intangible\/intangible_factory.h\"\n#include \"swganh\/object\/intangible\/intangible.h\"\n#include \"swganh\/object\/player\/player_factory.h\"\n#include \"swganh\/object\/player\/player.h\"\n\n#include \"swganh\/simulation\/scene_manager.h\"\n#include \"swganh\/messages\/cmd_start_scene.h\"\n#include \"swganh\/messages\/cmd_scene_ready.h\"\n#include \"swganh\/messages\/obj_controller_message.h\"\n#include \"swganh\/messages\/update_containment_message.h\"\n\n#include \"swganh\/simulation\/movement_manager.h\"\n\nusing namespace std;\nusing namespace swganh::connection;\nusing namespace swganh::messages;\nusing namespace swganh::network;\nusing namespace swganh::object;\nusing namespace swganh::simulation;\n\nusing anh::app::KernelInterface;\nusing anh::service::ServiceDescription;\nusing swganh::base::BaseService;\n\nnamespace swganh {\nnamespace simulation {\n\nclass SimulationServiceImpl {\npublic:\n const shared_ptr<ObjectManager>& GetObjectManager()\n {\n if (!object_manager_)\n {\n object_manager_ = make_shared<ObjectManager>();\n }\n\n return object_manager_;\n }\n\n const shared_ptr<SceneManager>& GetSceneManager()\n {\n if (!scene_manager_)\n {\n scene_manager_ = make_shared<SceneManager>();\n }\n\n return scene_manager_;\n }\n\n const shared_ptr<MovementManager>& GetMovementManager()\n {\n if (!movement_manager_)\n {\n movement_manager_ = make_shared<MovementManager>();\n }\n\n return movement_manager_;\n }\n void PersistObject(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n DLOG(WARNING) << \"Nothing to persist, no object saved\";\n return;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n object_manager_->PersistObject(find_iter->second);\n }\n\tvoid PersistRelatedObjects(uint64_t parent_object_id)\n\t{\n\t\tauto find_iter = loaded_objects_.find(parent_object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n DLOG(WARNING) << \"Nothing to persist, no object saved\";\n return;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n\t\t\/\/ first persist the parent object\n\t\tPersistObject(parent_object_id);\n\t\t\/\/ get all the contained objects\n\t\tauto contained_objects = find_iter->second->GetContainedObjects();\n\t\tfor_each(begin(contained_objects), end(contained_objects), [=](pair<uint64_t, shared_ptr<Object>> pair){\n\t\t\t\/\/ if there's objects contained within this object do a recursion call\n\t\t\tauto inner_contained = pair.second->GetContainedObjects();\n\t\t\tif (inner_contained.size() > 0)\n\t\t\t{\n\t\t\t\tDLOG(WARNING) << \"Persist inner container recursively:\" << pair.first;\n\t\t\t\tPersistRelatedObjects(pair.first);\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tDLOG(WARNING) << \"Persist inner container:\" << pair.first;\n\t\t\t\tPersistObject(pair.first);\n\t\t\t}\n\t\t});\n\t}\n shared_ptr<Object> LoadObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter != loaded_objects_.end())\n {\n return find_iter->second;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n \n auto object = object_manager_->CreateObjectFromStorage(object_id);\n\n loaded_objects_.insert(make_pair(object_id, object));\n\n return object;\n }\n shared_ptr<Object> LoadObjectById(uint64_t object_id, uint32_t type)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter != loaded_objects_.end())\n {\n return find_iter->second;\n \/\/throw swganh::object::InvalidObject(\"Requested object already loaded\");\n }\n \n auto object = object_manager_->CreateObjectFromStorage(object_id, type);\n\n loaded_objects_.insert(make_pair(object_id, object));\n\n return object;\n }\n \n shared_ptr<Object> GetObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n return nullptr;\n }\n\n return find_iter->second;\n }\n\n void RemoveObjectById(uint64_t object_id)\n {\n auto find_iter = loaded_objects_.find(object_id);\n\n if (find_iter == loaded_objects_.end())\n {\n throw swganh::object::InvalidObject(\"Requested an invalid object\");\n }\n\n auto scene = scene_manager_->GetScene(find_iter->second->GetSceneId());\n if (scene)\n {\n scene->RemoveObject(find_iter->second);\n }\n\n StopControllingObject(find_iter->second);\n\n loaded_objects_.unsafe_erase(find_iter);\n }\n\n shared_ptr<ObjectController> StartControllingObject(const shared_ptr<Object>& object, shared_ptr<RemoteClient> client)\n { \n shared_ptr<ObjectController> controller = nullptr;\n \n \/\/ If a controller already exists update it, otherwise create a new controller record.\n auto find_iter = controlled_objects_.find(object->GetObjectId()); \n if (find_iter != controlled_objects_.end())\n {\n controller = find_iter->second;\n controller->SetRemoteClient(client);\n }\n else \n {\n controller = make_shared<ObjectController>(object, client);\n object->SetController(controller);\n\n controlled_objects_.insert(make_pair(object->GetObjectId(), controller)); \n }\n\n auto connection_client = std::static_pointer_cast<ConnectionClient>(client);\n connection_client->SetController(controller);\n\n return controller;\n }\n\n void StopControllingObject(const shared_ptr<Object>& object)\n {\n auto find_iter = controlled_objects_.find(object->GetObjectId());\n\n if (find_iter == controlled_objects_.end())\n {\n throw swganh::object::InvalidObject(\"Object has no controller\");\n }\n \n controlled_objects_.unsafe_erase(find_iter);\n }\n \n void RegisterControllerHandler(uint32_t handler_id, swganh::object::ObjControllerHandler&& handler)\n {\n auto find_iter = controller_handlers_.find(handler_id);\n\n if (find_iter != controller_handlers_.end())\n {\n \/\/ just return, we already have the handler registered\n return;\n \/\/throw std::runtime_error(\"ObjControllerHandler already exists\");\n }\n\n controller_handlers_.insert(make_pair(handler_id, move(handler)));\n }\n\n void UnregisterControllerHandler(uint32_t handler_id)\n {\n auto find_iter = controller_handlers_.find(handler_id);\n\n if (find_iter == controller_handlers_.end())\n {\n throw std::runtime_error(\"ObjControllerHandler does not exist\");\n }\n\n controller_handlers_.unsafe_erase(find_iter);\n }\n\n void HandleObjControllerMessage(\n shared_ptr<ConnectionClient> client,\n const ObjControllerMessage& message)\n {\n auto find_iter = controller_handlers_.find(message.header);\n \n if (find_iter == controller_handlers_.end())\n {\n throw std::runtime_error(\"No handler registered to process the given message.\");\n }\n \n find_iter->second(client->GetController(), message);\n }\n \n void HandleSelectCharacter(\n shared_ptr<ConnectionClient> client, \n const SelectCharacter& message)\n {\n auto object = GetObjectById(message.character_id);\n \n if (!object)\n {\n object = LoadObjectById(message.character_id, creature::Creature::type);\n }\n \n StartControllingObject(object, client);\n\n auto scene = scene_manager_->GetScene(object->GetSceneId());\n\n if (!scene) \n {\n throw std::runtime_error(\"Invalid scene selected for object\");\n }\n\n \/\/ CmdStartScene\n CmdStartScene start_scene;\n start_scene.ignore_layout = 0;\n start_scene.character_id = object->GetObjectId();\n \n start_scene.terrain_map = scene->GetTerrainMap();\n start_scene.position = object->GetPosition();\n start_scene.shared_race_template = object->GetTemplate();\n start_scene.galaxy_time = 0;\n client->GetSession()->SendMessage(start_scene);\n\n \/\/ Add object to scene and send baselines\n scene->AddObject(object);\n }\n\nprivate:\n shared_ptr<ObjectManager> object_manager_;\n shared_ptr<SceneManager> scene_manager_;\n shared_ptr<MovementManager> movement_manager_;\n\n ObjControllerHandlerMap controller_handlers_;\n\n tbb::concurrent_unordered_map<uint64_t, shared_ptr<Object>> loaded_objects_;\n tbb::concurrent_unordered_map<uint64_t, shared_ptr<ObjectController>> controlled_objects_;\n};\n\n}} \/\/ namespace swganh::simulation\n\nSimulationService::SimulationService(KernelInterface* kernel)\n : BaseService(kernel) \n , impl_(new SimulationServiceImpl)\n{}\n \nSimulationService::~SimulationService()\n{}\n\nServiceDescription SimulationService::GetServiceDescription()\n{\n ServiceDescription service_description(\n \"SimulationService\",\n \"simulation\",\n \"0.1\",\n \"127.0.0.1\", \n 0, \n 0, \n 0);\n\n return service_description;\n}\n\nvoid SimulationService::StartScene(const std::string& scene_label)\n{\n impl_->GetSceneManager()->LoadSceneDescriptionsFromDatabase(kernel()->GetDatabaseManager()->getConnection(\"galaxy\"));\n impl_->GetSceneManager()->StartScene(scene_label);\n \/\/ load factories\n RegisterObjectFactories(kernel());\n}\n\nvoid SimulationService::StopScene(const std::string& scene_label)\n{\n impl_->GetSceneManager()->StopScene(scene_label);\n}\nvoid SimulationService::RegisterObjectFactories(anh::app::KernelInterface* kernel)\n{\n auto db_manager = kernel->GetDatabaseManager();\n impl_->GetObjectManager()->RegisterObjectType(0, make_shared<ObjectFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(tangible::Tangible::type, make_shared<tangible::TangibleFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(intangible::Intangible::type, make_shared<intangible::IntangibleFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(creature::Creature::type, make_shared<creature::CreatureFactory>(db_manager, this));\n impl_->GetObjectManager()->RegisterObjectType(player::Player::type, make_shared<player::PlayerFactory>(db_manager, this));\n}\n\nvoid SimulationService::PersistObject(uint64_t object_id)\n{\n impl_->PersistObject(object_id);\n}\nvoid SimulationService::PersistRelatedObjects(uint64_t parent_object_id)\n{\n\timpl_->PersistRelatedObjects(parent_object_id);\n}\nshared_ptr<Object> SimulationService::LoadObjectById(uint64_t object_id)\n{\n return impl_->LoadObjectById(object_id);\n}\nshared_ptr<Object> SimulationService::LoadObjectById(uint64_t object_id, uint32_t type)\n{\n return impl_->LoadObjectById(object_id, type);\n}\n\nshared_ptr<Object> SimulationService::GetObjectById(uint64_t object_id)\n{\n return impl_->GetObjectById(object_id);\n}\n\nvoid SimulationService::RemoveObjectById(uint64_t object_id)\n{\n impl_->RemoveObjectById(object_id);\n}\n\nshared_ptr<ObjectController> SimulationService::StartControllingObject(\n const shared_ptr<Object>& object, \n shared_ptr<RemoteClient> client)\n{\n return impl_->StartControllingObject(object, client);\n}\n\nvoid SimulationService::StopControllingObject(const shared_ptr<Object>& object)\n{\n impl_->StopControllingObject(object);\n}\n\nvoid SimulationService::RegisterControllerHandler(\n uint32_t handler_id, \n swganh::object::ObjControllerHandler&& handler)\n{\n impl_->RegisterControllerHandler(handler_id, move(handler));\n}\n\nvoid SimulationService::UnregisterControllerHandler(uint32_t handler_id)\n{\n impl_->UnregisterControllerHandler(handler_id);\n}\n\nvoid SimulationService::onStart()\n{\n auto connection_service = std::static_pointer_cast<ConnectionService>(kernel()->GetServiceManager()->GetService(\"ConnectionService\"));\n \n connection_service->RegisterMessageHandler<SelectCharacter>([=] (\n shared_ptr<ConnectionClient> client, \n const SelectCharacter& message)\n {\n impl_->HandleSelectCharacter(client, message);\n });\n\n connection_service->RegisterMessageHandler<ObjControllerMessage>([=] (\n shared_ptr<ConnectionClient> client, \n const ObjControllerMessage& message)\n {\n impl_->HandleObjControllerMessage(client, message);\n });\n\n\n RegisterControllerHandler(0x00000071, [this] (\n const std::shared_ptr<ObjectController>& controller, \n const swganh::messages::ObjControllerMessage& message) \n {\n impl_->GetMovementManager()->HandleDataTransform(controller, message);\n });\n \n RegisterControllerHandler(0x000000F1, [this] (\n const std::shared_ptr<ObjectController>& controller, \n const swganh::messages::ObjControllerMessage& message) \n {\n impl_->GetMovementManager()->HandleDataTransformWithParent(controller, message);\n });\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n *\n * Copyright (c) 2017 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file led_control.cpp\n *\/\n\n#include <px4_getopt.h>\n#include <px4_module.h>\n#include <px4_log.h>\n\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_led.h>\n\nstatic void\tusage();\n\nstatic orb_advert_t led_control_pub = nullptr;\n\nextern \"C\" {\n\t__EXPORT int led_control_main(int argc, char *argv[]);\n}\n\nstatic void\nusage()\n{\n\tPRINT_MODULE_DESCRIPTION(\n\t\tR\"DESCR_STR(\n### Description\nCommand-line tool to control & test the (external) LED's.\n\nTo use it make sure there's a driver running, which handles the led_control uorb topic.\n\nThere are different priorities, such that for example one module can set a color with low priority, and another\nmodule can blink N times with high priority, and the LED's automatically return to the lower priority state\nafter the blinking. The `reset` command can also be used to return to a lower priority.\n\n### Examples\nBlink the first LED 5 times in blue:\n$ led_control blink -c blue -l 0 -n 5\n\n)DESCR_STR\");\n\n\tPRINT_MODULE_USAGE_NAME(\"led_control\", \"command\");\n\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"test\", \"Run a test pattern\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"on\", \"Turn LED on\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"off\", \"Turn LED off\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"reset\", \"Reset LED priority\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"blink\", \"Blink LED N times\");\n\tPRINT_MODULE_USAGE_PARAM_INT('n', 3, 1, 20, \"Number of blinks\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('s', \"normal\", \"fast|normal|slow\", \"Set blinking speed\", true);\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"breathe\", \"Continuously fade LED in & out\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"flash\", \"Two fast blinks and then off with frequency of 1Hz\");\n\n\tPRINT_MODULE_USAGE_PARAM_COMMENT(\"The following arguments apply to all of the above commands except for 'test':\");\n\tPRINT_MODULE_USAGE_PARAM_STRING('c', \"white\", \"red|blue|green|yellow|purple|amber|cyan|white\", \"color\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('l', -1, 0, 100, \"Which LED to control: 0, 1, 2, ... (default=all)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', 2, 0, 2, \"Priority\", true);\n}\n\nstatic void publish_led_control(led_control_s &led_control)\n{\n\tled_control.timestamp = hrt_absolute_time();\n\n\tif (led_control_pub == nullptr) {\n\t\tled_control_pub = orb_advertise_queue(ORB_ID(led_control), &led_control, LED_UORB_QUEUE_LENGTH);\n\n\t} else {\n\t\torb_publish(ORB_ID(led_control), led_control_pub, &led_control);\n\t}\n}\n\nstatic void run_led_test1()\n{\n\tPX4_INFO(\"generating LED pattern...\");\n\n\tled_control_s led_control = {};\n\tled_control.led_mask = 0xff;\n\tled_control.mode = led_control_s::MODE_OFF;\n\tled_control.priority = led_control_s::MAX_PRIORITY;\n\tpublish_led_control(led_control);\n\n\tpx4_usleep(200 * 1000);\n\n\t\/\/ generate some pattern\n\tfor (int round = led_control_s::COLOR_RED; round <= led_control_s::COLOR_WHITE; ++round) {\n\t\tfor (int led = 0; led < BOARD_MAX_LEDS; ++led) {\n\t\t\tled_control.led_mask = 1 << led;\n\t\t\tled_control.mode = led_control_s::MODE_ON;\n\t\t\tled_control.color = round;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(80 * 1000);\n\t\t}\n\n\t\tpx4_usleep(100 * 1000);\n\t\tled_control.led_mask = 0xff;\n\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tled_control.mode = led_control_s::MODE_ON;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(100 * 1000);\n\t\t\tled_control.mode = led_control_s::MODE_OFF;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(100 * 1000);\n\t\t}\n\n\t\tpx4_usleep(200 * 1000);\n\t}\n\n\tpx4_usleep(500 * 1000);\n\n\t\/\/ reset\n\tled_control.led_mask = 0xff;\n\tled_control.mode = led_control_s::MODE_DISABLED;\n\tpublish_led_control(led_control);\n\n\tPX4_INFO(\"Done\");\n}\n\nint\nled_control_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\tint ch;\n\tconst char *myoptarg = nullptr;\n\tuint8_t blink_speed = led_control_s::MODE_BLINK_NORMAL;\n\tled_control_s led_control = {};\n\tled_control.num_blinks = 3;\n\tled_control.priority = led_control_s::MAX_PRIORITY;\n\tled_control.mode = 0xff;\n\tled_control.led_mask = 0xff;\n\tled_control.color = led_control_s::COLOR_WHITE;\n\n\twhile ((ch = px4_getopt(argc, argv, \"c:l:n:s:p:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 'c':\n\t\t\tif (!strcmp(myoptarg, \"red\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_RED;\n\n\t\t\t} else if (!strcmp(myoptarg, \"blue\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_BLUE;\n\n\t\t\t} else if (!strcmp(myoptarg, \"green\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_GREEN;\n\n\t\t\t} else if (!strcmp(myoptarg, \"yellow\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_YELLOW;\n\n\t\t\t} else if (!strcmp(myoptarg, \"purple\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_PURPLE;\n\n\t\t\t} else if (!strcmp(myoptarg, \"amber\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_AMBER;\n\n\t\t\t} else if (!strcmp(myoptarg, \"cyan\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_CYAN;\n\n\t\t\t} else if (!strcmp(myoptarg, \"white\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_WHITE;\n\n\t\t\t} else {\n\t\t\t\tusage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase 'l':\n\t\t\tled_control.led_mask = 1 << strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'n':\n\t\t\tled_control.num_blinks = strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 's':\n\t\t\tif (!strcmp(myoptarg, \"fast\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_FAST;\n\n\t\t\t} else if (!strcmp(myoptarg, \"normal\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_NORMAL;\n\n\t\t\t} else if (!strcmp(myoptarg, \"slow\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_SLOW;\n\n\t\t\t} else {\n\t\t\t\tusage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\tled_control.priority = strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage();\n\t\t\treturn -1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (led_control.priority > led_control_s::MAX_PRIORITY) {\n\t\tled_control.priority = led_control_s::MAX_PRIORITY;\n\t}\n\n\tif (myoptind >= argc) {\n\t\tusage();\n\t\treturn 1;\n\t}\n\n\tif (!strcmp(argv[myoptind], \"test\")) {\n\t\trun_led_test1();\n\n\t} else if (!strcmp(argv[myoptind], \"on\")) {\n\t\tled_control.mode = led_control_s::MODE_ON;\n\n\t} else if (!strcmp(argv[myoptind], \"off\")) {\n\t\tled_control.mode = led_control_s::MODE_OFF;\n\n\t} else if (!strcmp(argv[myoptind], \"reset\")) {\n\t\tled_control.mode = led_control_s::MODE_DISABLED;\n\n\t} else if (!strcmp(argv[myoptind], \"blink\")) {\n\t\tled_control.mode = blink_speed;\n\n\t} else if (!strcmp(argv[myoptind], \"breathe\")) {\n\t\tled_control.mode = led_control_s::MODE_BREATHE;\n\n\t} else if (!strcmp(argv[myoptind], \"flash\")) {\n\t\tled_control.mode = led_control_s::MODE_FLASH;\n\n\t} else {\n\t\tusage();\n\t\treturn 1;\n\t}\n\n\tif (led_control.mode != 0xff) {\n\t\tpublish_led_control(led_control);\n\t}\n\n\treturn 0;\n}\n<commit_msg>led_control move usage() to bottom of file<commit_after>\/****************************************************************************\n *\n * Copyright (c) 2017 PX4 Development Team. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n\/**\n * @file led_control.cpp\n *\/\n\n#include <px4_getopt.h>\n#include <px4_module.h>\n#include <px4_log.h>\n\n#include <stdlib.h>\n#include <unistd.h>\n\n#include <drivers\/drv_hrt.h>\n#include <drivers\/drv_led.h>\n\nstatic void\tusage();\n\nstatic orb_advert_t led_control_pub = nullptr;\n\nextern \"C\" {\n\t__EXPORT int led_control_main(int argc, char *argv[]);\n}\n\nstatic void publish_led_control(led_control_s &led_control)\n{\n\tled_control.timestamp = hrt_absolute_time();\n\n\tif (led_control_pub == nullptr) {\n\t\tled_control_pub = orb_advertise_queue(ORB_ID(led_control), &led_control, LED_UORB_QUEUE_LENGTH);\n\n\t} else {\n\t\torb_publish(ORB_ID(led_control), led_control_pub, &led_control);\n\t}\n}\n\nstatic void run_led_test1()\n{\n\tPX4_INFO(\"generating LED pattern...\");\n\n\tled_control_s led_control = {};\n\tled_control.led_mask = 0xff;\n\tled_control.mode = led_control_s::MODE_OFF;\n\tled_control.priority = led_control_s::MAX_PRIORITY;\n\tpublish_led_control(led_control);\n\n\tpx4_usleep(200 * 1000);\n\n\t\/\/ generate some pattern\n\tfor (int round = led_control_s::COLOR_RED; round <= led_control_s::COLOR_WHITE; ++round) {\n\t\tfor (int led = 0; led < BOARD_MAX_LEDS; ++led) {\n\t\t\tled_control.led_mask = 1 << led;\n\t\t\tled_control.mode = led_control_s::MODE_ON;\n\t\t\tled_control.color = round;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(80 * 1000);\n\t\t}\n\n\t\tpx4_usleep(100 * 1000);\n\t\tled_control.led_mask = 0xff;\n\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tled_control.mode = led_control_s::MODE_ON;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(100 * 1000);\n\t\t\tled_control.mode = led_control_s::MODE_OFF;\n\t\t\tpublish_led_control(led_control);\n\t\t\tpx4_usleep(100 * 1000);\n\t\t}\n\n\t\tpx4_usleep(200 * 1000);\n\t}\n\n\tpx4_usleep(500 * 1000);\n\n\t\/\/ reset\n\tled_control.led_mask = 0xff;\n\tled_control.mode = led_control_s::MODE_DISABLED;\n\tpublish_led_control(led_control);\n\n\tPX4_INFO(\"Done\");\n}\n\nint\nled_control_main(int argc, char *argv[])\n{\n\tint myoptind = 1;\n\tint ch;\n\tconst char *myoptarg = nullptr;\n\tuint8_t blink_speed = led_control_s::MODE_BLINK_NORMAL;\n\tled_control_s led_control = {};\n\tled_control.num_blinks = 3;\n\tled_control.priority = led_control_s::MAX_PRIORITY;\n\tled_control.mode = 0xff;\n\tled_control.led_mask = 0xff;\n\tled_control.color = led_control_s::COLOR_WHITE;\n\n\twhile ((ch = px4_getopt(argc, argv, \"c:l:n:s:p:\", &myoptind, &myoptarg)) != EOF) {\n\t\tswitch (ch) {\n\t\tcase 'c':\n\t\t\tif (!strcmp(myoptarg, \"red\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_RED;\n\n\t\t\t} else if (!strcmp(myoptarg, \"blue\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_BLUE;\n\n\t\t\t} else if (!strcmp(myoptarg, \"green\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_GREEN;\n\n\t\t\t} else if (!strcmp(myoptarg, \"yellow\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_YELLOW;\n\n\t\t\t} else if (!strcmp(myoptarg, \"purple\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_PURPLE;\n\n\t\t\t} else if (!strcmp(myoptarg, \"amber\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_AMBER;\n\n\t\t\t} else if (!strcmp(myoptarg, \"cyan\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_CYAN;\n\n\t\t\t} else if (!strcmp(myoptarg, \"white\")) {\n\t\t\t\tled_control.color = led_control_s::COLOR_WHITE;\n\n\t\t\t} else {\n\t\t\t\tusage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase 'l':\n\t\t\tled_control.led_mask = 1 << strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 'n':\n\t\t\tled_control.num_blinks = strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tcase 's':\n\t\t\tif (!strcmp(myoptarg, \"fast\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_FAST;\n\n\t\t\t} else if (!strcmp(myoptarg, \"normal\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_NORMAL;\n\n\t\t\t} else if (!strcmp(myoptarg, \"slow\")) {\n\t\t\t\tblink_speed = led_control_s::MODE_BLINK_SLOW;\n\n\t\t\t} else {\n\t\t\t\tusage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tbreak;\n\n\t\tcase 'p':\n\t\t\tled_control.priority = strtol(myoptarg, nullptr, 0);\n\t\t\tbreak;\n\n\t\tdefault:\n\t\t\tusage();\n\t\t\treturn -1;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tif (led_control.priority > led_control_s::MAX_PRIORITY) {\n\t\tled_control.priority = led_control_s::MAX_PRIORITY;\n\t}\n\n\tif (myoptind >= argc) {\n\t\tusage();\n\t\treturn 1;\n\t}\n\n\tif (!strcmp(argv[myoptind], \"test\")) {\n\t\trun_led_test1();\n\n\t} else if (!strcmp(argv[myoptind], \"on\")) {\n\t\tled_control.mode = led_control_s::MODE_ON;\n\n\t} else if (!strcmp(argv[myoptind], \"off\")) {\n\t\tled_control.mode = led_control_s::MODE_OFF;\n\n\t} else if (!strcmp(argv[myoptind], \"reset\")) {\n\t\tled_control.mode = led_control_s::MODE_DISABLED;\n\n\t} else if (!strcmp(argv[myoptind], \"blink\")) {\n\t\tled_control.mode = blink_speed;\n\n\t} else if (!strcmp(argv[myoptind], \"breathe\")) {\n\t\tled_control.mode = led_control_s::MODE_BREATHE;\n\n\t} else if (!strcmp(argv[myoptind], \"flash\")) {\n\t\tled_control.mode = led_control_s::MODE_FLASH;\n\n\t} else {\n\t\tusage();\n\t\treturn 1;\n\t}\n\n\tif (led_control.mode != 0xff) {\n\t\tpublish_led_control(led_control);\n\t}\n\n\treturn 0;\n}\n\nstatic void\nusage()\n{\n\tPRINT_MODULE_DESCRIPTION(\n\t\tR\"DESCR_STR(\n### Description\nCommand-line tool to control & test the (external) LED's.\n\nTo use it make sure there's a driver running, which handles the led_control uorb topic.\n\nThere are different priorities, such that for example one module can set a color with low priority, and another\nmodule can blink N times with high priority, and the LED's automatically return to the lower priority state\nafter the blinking. The `reset` command can also be used to return to a lower priority.\n\n### Examples\nBlink the first LED 5 times in blue:\n$ led_control blink -c blue -l 0 -n 5\n\n)DESCR_STR\");\n\n\tPRINT_MODULE_USAGE_NAME(\"led_control\", \"command\");\n\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"test\", \"Run a test pattern\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"on\", \"Turn LED on\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"off\", \"Turn LED off\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"reset\", \"Reset LED priority\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"blink\", \"Blink LED N times\");\n\tPRINT_MODULE_USAGE_PARAM_INT('n', 3, 1, 20, \"Number of blinks\", true);\n\tPRINT_MODULE_USAGE_PARAM_STRING('s', \"normal\", \"fast|normal|slow\", \"Set blinking speed\", true);\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"breathe\", \"Continuously fade LED in & out\");\n\tPRINT_MODULE_USAGE_COMMAND_DESCR(\"flash\", \"Two fast blinks and then off with frequency of 1Hz\");\n\n\tPRINT_MODULE_USAGE_PARAM_COMMENT(\"The following arguments apply to all of the above commands except for 'test':\");\n\tPRINT_MODULE_USAGE_PARAM_STRING('c', \"white\", \"red|blue|green|yellow|purple|amber|cyan|white\", \"color\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('l', -1, 0, 100, \"Which LED to control: 0, 1, 2, ... (default=all)\", true);\n\tPRINT_MODULE_USAGE_PARAM_INT('p', 2, 0, 2, \"Priority\", true);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2010-2014 Jeremy Lainé\n * Contact: https:\/\/github.com\/jlaine\/qdjango\n *\n * This file is part of the QDjango Library.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\/\n\n#include <QCoreApplication>\n#include <QDateTime>\n#include <QFile>\n#include <QFileInfo>\n#include <QRegExp>\n#include <QStringList>\n#include <QUrl>\n\n#include \"QDjangoHttpController.h\"\n#include \"QDjangoHttpRequest.h\"\n#include \"QDjangoHttpResponse.h\"\n\n\/** Extract basic credentials from an HTTP \\a request.\n *\n * Returns \\b true if credentials were provider, \\b false otherwise.\n *\/\nbool QDjangoHttpController::getBasicAuth(const QDjangoHttpRequest &request, QString &username, QString &password)\n{\n QRegExp authRx(QLatin1String(\"^Basic (.+)$\"));\n const QString authHeader = request.meta(QLatin1String(\"HTTP_AUTHORIZATION\"));\n if (authRx.exactMatch(authHeader)) {\n const QString authValue = QString::fromUtf8(QByteArray::fromBase64(authRx.cap(1).toLatin1()));\n const QStringList bits = authValue.split(QLatin1Char(':'));\n if (bits.size() == 2 && !bits[0].isEmpty() && !bits[1].isEmpty()) {\n username = bits[0];\n password = bits[1];\n return true;\n }\n }\n return false;\n}\n\n\/** Converts a QDateTime to an HTTP datetime string.\n *\/\nQString QDjangoHttpController::httpDateTime(const QDateTime &dt)\n{\n if (dt.isValid())\n return dt.toUTC().toString(QLatin1String(\"ddd, dd MMM yyyy HH:mm:ss\")) + QLatin1String(\" GMT\");\n return QString();\n}\n\n\/** Converts an HTTP datetime string to a QDateTime.\n *\/\nQDateTime QDjangoHttpController::httpDateTime(const QString &str)\n{\n QDateTime dt = QDateTime::fromString(str.left(25), QLatin1String(\"ddd, dd MMM yyyy HH:mm:ss\"));\n dt.setTimeSpec(Qt::UTC);\n return dt;\n}\n\nQDjangoHttpResponse *QDjangoHttpController::serveError(const QDjangoHttpRequest &request, int code, const QString &text)\n{\n Q_UNUSED(request);\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setHeader(QLatin1String(\"Content-Type\"), QLatin1String(\"text\/html; charset=utf-8\"));\n response->setStatusCode(code);\n response->setBody(QString::fromLatin1(\"<html>\"\n \"<head><title>Error<\/title><\/head>\"\n \"<body><p>%1<\/p><\/body>\"\n \"<\/html>\").arg(text).toUtf8());\n return response;\n}\n\n\/** Respond to an HTTP \\a request with an authorization error.\n *\n * \\param request\n * \\param realm\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveAuthorizationRequired(const QDjangoHttpRequest &request, const QString &realm)\n{\n Q_UNUSED(request);\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setStatusCode(QDjangoHttpResponse::AuthorizationRequired);\n response->setHeader(QLatin1String(\"WWW-Authenticate\"), QString::fromLatin1(\"Basic realm=\\\"%1\\\"\").arg(realm));\n return response;\n}\n\n\/** Respond to a malformed HTTP request.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveBadRequest(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::BadRequest, QLatin1String(\"Your browser sent a malformed request.\"));\n}\n\n\/** Respond to an HTTP \\a request with an internal server error.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveInternalServerError(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::InternalServerError, QLatin1String(\"An internal server error was encountered.\"));\n}\n\n\/** Respond to an HTTP \\a request with a not found error.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveNotFound(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::NotFound, QLatin1String(\"The document you requested was not found.\"));\n}\n\n\/** Respond to an HTTP \\a request with a redirect.\n *\n * \\param request\n * \\param url The URL to which the user is redirected.\n * \\param permanent Whether the redirect is permanent.\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveRedirect(const QDjangoHttpRequest &request, const QUrl &url, bool permanent)\n{\n const QString urlString = url.toString();\n QDjangoHttpResponse *response = serveError(request, permanent ? QDjangoHttpResponse::MovedPermanently : QDjangoHttpResponse::Found,\n QString::fromLatin1(\"You are being redirect to <a href=\\\"%1\\\">%2<\/a>\").arg(urlString, urlString));\n response->setHeader(QLatin1String(\"Location\"), urlString);\n return response;\n}\n\n\/** Respond to an HTTP \\a request for a static file.\n *\n * \\param request\n * \\param docPath The path to the document, such that it can be opened using a QFile.\n * \\param expires An optional expiry date.\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveStatic(const QDjangoHttpRequest &request, const QString &docPath, const QDateTime &expires)\n{\n QFileInfo info(docPath);\n if (!info.isFile())\n return serveNotFound(request);\n const QString fileName = info.fileName();\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setStatusCode(QDjangoHttpResponse::OK);\n\n \/\/ determine last modified date\n QDateTime lastModified = info.lastModified();\n if (docPath.startsWith(QLatin1String(\":\/\")))\n lastModified = QFileInfo(qApp->applicationFilePath()).lastModified();\n if (lastModified.isValid())\n response->setHeader(QLatin1String(\"Last-Modified\"), httpDateTime(lastModified));\n\n \/\/ cache expiry\n if (expires.isValid())\n response->setHeader(QLatin1String(\"Expires\"), httpDateTime(expires));\n\n \/\/ handle if-modified-since\n const QDateTime ifModifiedSince = httpDateTime(request.meta(QLatin1String(\"HTTP_IF_MODIFIED_SINCE\")));\n if (lastModified.isValid() && ifModifiedSince.isValid() && lastModified <= ifModifiedSince)\n {\n response->setStatusCode(304);\n return response;\n }\n\n \/\/ determine content type\n QString mimeType;\n if (fileName.endsWith(QLatin1String(\".css\")))\n mimeType = QLatin1String(\"text\/css\");\n else if (fileName.endsWith(QLatin1String(\".html\")))\n mimeType = QLatin1String(\"text\/html\");\n else if (fileName.endsWith(QLatin1String(\".js\")))\n mimeType = QLatin1String(\"application\/javascript\");\n else if (fileName.endsWith(QLatin1String(\".png\")))\n mimeType = QLatin1String(\"image\/png\");\n else\n mimeType = QLatin1String(\"application\/octet-stream\");\n response->setHeader(QLatin1String(\"Content-Type\"), mimeType);\n\n \/\/ read contents\n QFile file(docPath);\n if (!file.open(QIODevice::ReadOnly)) {\n delete response;\n return serveInternalServerError(request);\n }\n if (request.method() == QLatin1String(\"HEAD\"))\n response->setHeader(QLatin1String(\"Content-Length\"), QString::number(file.size()));\n else\n response->setBody(file.readAll());\n return response;\n}\n\n<commit_msg>remove special case for PNG<commit_after>\/*\n * Copyright (C) 2010-2014 Jeremy Lainé\n * Contact: https:\/\/github.com\/jlaine\/qdjango\n *\n * This file is part of the QDjango Library.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\/\n\n#include <QCoreApplication>\n#include <QDateTime>\n#include <QFile>\n#include <QFileInfo>\n#include <QRegExp>\n#include <QStringList>\n#include <QUrl>\n\n#include \"QDjangoHttpController.h\"\n#include \"QDjangoHttpRequest.h\"\n#include \"QDjangoHttpResponse.h\"\n\n\/** Extract basic credentials from an HTTP \\a request.\n *\n * Returns \\b true if credentials were provider, \\b false otherwise.\n *\/\nbool QDjangoHttpController::getBasicAuth(const QDjangoHttpRequest &request, QString &username, QString &password)\n{\n QRegExp authRx(QLatin1String(\"^Basic (.+)$\"));\n const QString authHeader = request.meta(QLatin1String(\"HTTP_AUTHORIZATION\"));\n if (authRx.exactMatch(authHeader)) {\n const QString authValue = QString::fromUtf8(QByteArray::fromBase64(authRx.cap(1).toLatin1()));\n const QStringList bits = authValue.split(QLatin1Char(':'));\n if (bits.size() == 2 && !bits[0].isEmpty() && !bits[1].isEmpty()) {\n username = bits[0];\n password = bits[1];\n return true;\n }\n }\n return false;\n}\n\n\/** Converts a QDateTime to an HTTP datetime string.\n *\/\nQString QDjangoHttpController::httpDateTime(const QDateTime &dt)\n{\n if (dt.isValid())\n return dt.toUTC().toString(QLatin1String(\"ddd, dd MMM yyyy HH:mm:ss\")) + QLatin1String(\" GMT\");\n return QString();\n}\n\n\/** Converts an HTTP datetime string to a QDateTime.\n *\/\nQDateTime QDjangoHttpController::httpDateTime(const QString &str)\n{\n QDateTime dt = QDateTime::fromString(str.left(25), QLatin1String(\"ddd, dd MMM yyyy HH:mm:ss\"));\n dt.setTimeSpec(Qt::UTC);\n return dt;\n}\n\nQDjangoHttpResponse *QDjangoHttpController::serveError(const QDjangoHttpRequest &request, int code, const QString &text)\n{\n Q_UNUSED(request);\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setHeader(QLatin1String(\"Content-Type\"), QLatin1String(\"text\/html; charset=utf-8\"));\n response->setStatusCode(code);\n response->setBody(QString::fromLatin1(\"<html>\"\n \"<head><title>Error<\/title><\/head>\"\n \"<body><p>%1<\/p><\/body>\"\n \"<\/html>\").arg(text).toUtf8());\n return response;\n}\n\n\/** Respond to an HTTP \\a request with an authorization error.\n *\n * \\param request\n * \\param realm\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveAuthorizationRequired(const QDjangoHttpRequest &request, const QString &realm)\n{\n Q_UNUSED(request);\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setStatusCode(QDjangoHttpResponse::AuthorizationRequired);\n response->setHeader(QLatin1String(\"WWW-Authenticate\"), QString::fromLatin1(\"Basic realm=\\\"%1\\\"\").arg(realm));\n return response;\n}\n\n\/** Respond to a malformed HTTP request.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveBadRequest(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::BadRequest, QLatin1String(\"Your browser sent a malformed request.\"));\n}\n\n\/** Respond to an HTTP \\a request with an internal server error.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveInternalServerError(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::InternalServerError, QLatin1String(\"An internal server error was encountered.\"));\n}\n\n\/** Respond to an HTTP \\a request with a not found error.\n *\n * \\param request\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveNotFound(const QDjangoHttpRequest &request)\n{\n return serveError(request, QDjangoHttpResponse::NotFound, QLatin1String(\"The document you requested was not found.\"));\n}\n\n\/** Respond to an HTTP \\a request with a redirect.\n *\n * \\param request\n * \\param url The URL to which the user is redirected.\n * \\param permanent Whether the redirect is permanent.\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveRedirect(const QDjangoHttpRequest &request, const QUrl &url, bool permanent)\n{\n const QString urlString = url.toString();\n QDjangoHttpResponse *response = serveError(request, permanent ? QDjangoHttpResponse::MovedPermanently : QDjangoHttpResponse::Found,\n QString::fromLatin1(\"You are being redirect to <a href=\\\"%1\\\">%2<\/a>\").arg(urlString, urlString));\n response->setHeader(QLatin1String(\"Location\"), urlString);\n return response;\n}\n\n\/** Respond to an HTTP \\a request for a static file.\n *\n * \\param request\n * \\param docPath The path to the document, such that it can be opened using a QFile.\n * \\param expires An optional expiry date.\n *\/\nQDjangoHttpResponse *QDjangoHttpController::serveStatic(const QDjangoHttpRequest &request, const QString &docPath, const QDateTime &expires)\n{\n QFileInfo info(docPath);\n if (!info.isFile())\n return serveNotFound(request);\n const QString fileName = info.fileName();\n\n QDjangoHttpResponse *response = new QDjangoHttpResponse;\n response->setStatusCode(QDjangoHttpResponse::OK);\n\n \/\/ determine last modified date\n QDateTime lastModified = info.lastModified();\n if (docPath.startsWith(QLatin1String(\":\/\")))\n lastModified = QFileInfo(qApp->applicationFilePath()).lastModified();\n if (lastModified.isValid())\n response->setHeader(QLatin1String(\"Last-Modified\"), httpDateTime(lastModified));\n\n \/\/ cache expiry\n if (expires.isValid())\n response->setHeader(QLatin1String(\"Expires\"), httpDateTime(expires));\n\n \/\/ handle if-modified-since\n const QDateTime ifModifiedSince = httpDateTime(request.meta(QLatin1String(\"HTTP_IF_MODIFIED_SINCE\")));\n if (lastModified.isValid() && ifModifiedSince.isValid() && lastModified <= ifModifiedSince)\n {\n response->setStatusCode(304);\n return response;\n }\n\n \/\/ determine content type\n QString mimeType;\n if (fileName.endsWith(QLatin1String(\".css\")))\n mimeType = QLatin1String(\"text\/css\");\n else if (fileName.endsWith(QLatin1String(\".html\")))\n mimeType = QLatin1String(\"text\/html\");\n else if (fileName.endsWith(QLatin1String(\".js\")))\n mimeType = QLatin1String(\"application\/javascript\");\n else\n mimeType = QLatin1String(\"application\/octet-stream\");\n response->setHeader(QLatin1String(\"Content-Type\"), mimeType);\n\n \/\/ read contents\n QFile file(docPath);\n if (!file.open(QIODevice::ReadOnly)) {\n delete response;\n return serveInternalServerError(request);\n }\n if (request.method() == QLatin1String(\"HEAD\"))\n response->setHeader(QLatin1String(\"Content-Length\"), QString::number(file.size()));\n else\n response->setBody(file.readAll());\n return response;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/** \\copyright\n * Copyright (c) 2019, Mike Dunston\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file Esp32WiFiClientAdapter.hxx\n *\n * ESP32 adapter code using the WiFiClient provided by the WiFiServer code\n * for interfacing with the OpenMRN stack.\n *\n * @author Mike Dunston\n * @date 13 January 2019\n *\/\n\n#ifndef _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_\n#define _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_\n\n#include <Arduino.h>\n#include <WiFi.h>\n\nclass Esp32WiFiClientAdapter {\npublic:\n Esp32WiFiClientAdapter(WiFiClient client) : client_(client){\n client_.setNoDelay(true);\n }\n\n \/\/\/ This is how many bytes we return as writeable when select says the\n \/\/\/ socket is write active.\n static constexpr unsigned WRITE_PACKET_SIZE = 512;\n\n \/\/ on the ESP32 there is no TX limit method\n size_t availableForWrite()\n {\n if (!client_.connected())\n {\n return 0;\n }\n int fd = client_.fd();\n fd_set set;\n struct timeval tv;\n FD_ZERO(&set); \/\/ empties the set\n FD_SET(fd, &set); \/\/ adds FD to the set\n tv.tv_sec = 0;\n tv.tv_usec = 0;\n\n if (select(fd + 1, NULL, &set, NULL, &tv) < 0)\n {\n return 0;\n }\n\n if (FD_ISSET(fd, &set))\n {\n return WRITE_PACKET_SIZE;\n }\n else\n {\n return 0;\n }\n }\n\n size_t write(const char *buffer, size_t len)\n {\n if(client_.connected()) {\n return client_.write(buffer, len);\n }\n return 0;\n }\n size_t available() {\n if(client_.connected()) {\n return client_.available();\n }\n return 0;\n }\n size_t read(const char *buffer, size_t len) {\n size_t bytesRead = 0;\n if(client_.connected()) {\n bytesRead = client_.read((uint8_t *)buffer, len);\n }\n return bytesRead;\n }\nprivate:\n WiFiClient client_;\n};\n\n#endif \/* _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_ *\/\n<commit_msg>fix formatting of this file.<commit_after>\/** \\copyright\n * Copyright (c) 2019, Mike Dunston\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * - Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n *\n * - Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n * \\file Esp32WiFiClientAdapter.hxx\n *\n * ESP32 adapter code using the WiFiClient provided by the WiFiServer code\n * for interfacing with the OpenMRN stack.\n *\n * @author Mike Dunston\n * @date 13 January 2019\n *\/\n\n#ifndef _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_\n#define _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_\n\n#include <Arduino.h>\n#include <WiFi.h>\n\nclass Esp32WiFiClientAdapter\n{\npublic:\n Esp32WiFiClientAdapter(WiFiClient client)\n : client_(client)\n {\n client_.setNoDelay(true);\n }\n\n \/\/\/ This is how many bytes we return as writeable when select says the\n \/\/\/ socket is write active.\n static constexpr unsigned WRITE_PACKET_SIZE = 512;\n\n \/\/ on the ESP32 there is no TX limit method\n size_t availableForWrite()\n {\n if (!client_.connected())\n {\n return 0;\n }\n int fd = client_.fd();\n fd_set set;\n struct timeval tv;\n FD_ZERO(&set); \/\/ empties the set\n FD_SET(fd, &set); \/\/ adds FD to the set\n tv.tv_sec = 0;\n tv.tv_usec = 0;\n\n if (select(fd + 1, NULL, &set, NULL, &tv) < 0)\n {\n return 0;\n }\n\n if (FD_ISSET(fd, &set))\n {\n return WRITE_PACKET_SIZE;\n }\n else\n {\n return 0;\n }\n }\n\n size_t write(const char *buffer, size_t len)\n {\n if (client_.connected())\n {\n return client_.write(buffer, len);\n }\n return 0;\n }\n size_t available()\n {\n if (client_.connected())\n {\n return client_.available();\n }\n return 0;\n }\n size_t read(const char *buffer, size_t len)\n {\n size_t bytesRead = 0;\n if (client_.connected())\n {\n bytesRead = client_.read((uint8_t *)buffer, len);\n }\n return bytesRead;\n }\n\nprivate:\n WiFiClient client_;\n};\n\n#endif \/* _FREERTOS_DRIVERS_ARDUINO_ESP32WIFI_HXX_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/* Robot.cpp -- Implementation of Robot class\n\n Copyright (C) 2014 Tushar Pankaj\n \n This file is part of San Diego Robotics 101 Robosub.\n \n San Diego Robotics 101 Robosub is free software: you can redistribute it\n and\/or modify it under the terms of the GNU General Public License as\n published by the Free Software Foundation, either version 3 of the License,\n or (at your option) any later version.\n \n San Diego Robotics 101 Robosub is distributed in the hope that it will be\n useful, but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\n Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with San Diego Robotics 101 Robosub. If not, see\n <http:\/\/www.gnu.org\/licenses\/>. *\/\n\n#include <iostream>\n#include <iomanip>\n#include <thread>\n#include <chrono>\n#include <string>\n#include <sstream>\n#include <bitset>\n#include \"Robot.hpp\"\n#include \"Serial.hpp\"\n#include \"TXPacket.hpp\"\n#include \"Logger.hpp\"\n#include \"BaseVideoDevice.hpp\"\n#include \"USBVideoDevice.hpp\"\n#ifdef RPI_COMPILE\n#include \"RPIVideoDevice.hpp\"\n#endif\n#include \"StartingGateMission.hpp\"\n\n Robot::Robot():logger(\"\/tmp\/rpi_log\/rpi_log.log\", Logger::DEBUG)\n{\n\tlogger.write(\"Initializing robot\", Logger::MESSAGE);\n\tperiod = 10;\n\tlogger.write(\"Initialized Robot.period to \" + std::to_string(period),\n\t\t Logger::MESSAGE);\n\tbat_v_threshold = 128;\n\tlogger.write(\"Initialized Robot.bat_v_threshold to \" +\n\t\t std::to_string(bat_v_threshold), Logger::MESSAGE);\n#ifdef RPI_COMPILE\n\tlogger.write(\"Starting serial driver\", Logger::MESSAGE);\n\tserial.open_serial();\n\tserial.start();\n\tlogger.write(\"Finished starting serial driver\", Logger::MESSAGE);\n#endif\n#ifdef RPI_COMPILE\n\tlogger.write(\"Initializing forward camera as RPIVideoDevice\",\n\t\t Logger::MESSAGE);\n\tforward_camera = new RPIVideoDevice();\n\tlogger.write(\"Finished initializing forward camera as RPIVideoDevice\",\n\t\t Logger::MESSAGE);\n#else\n\tlogger.write(\"Initializing forward camera as USBVideoDevice(1)\",\n\t\t Logger::MESSAGE);\n\tforward_camera = new USBVideoDevice(1);\n\tlogger.\n\t write(\"Finished initializing forward camera as USBVideoDevice(1)\",\n\t\t Logger::MESSAGE);\n#endif\n\tlogger.write(\"Initializing downward camera as USBVideoDevice(0)\",\n\t\t Logger::MESSAGE);\n\tdownward_camera = new USBVideoDevice(0);\n\tlogger.\n\t write(\"Finished initializing downward camera as USBVideoDevice(0)\",\n\t\t Logger::MESSAGE);\n\tlogger.write(\"Starting forward camera\", Logger::MESSAGE);\n\tforward_camera->start();\n\tlogger.write(\"Finished starting forward camera\", Logger::MESSAGE);\n\tlogger.write(\"Starting downward camera\", Logger::MESSAGE);\n\tdownward_camera->start();\n\tlogger.write(\"Finished starting downward camera\", Logger::MESSAGE);\n\tlogger.write(\"Finished initializing robot\", Logger::MESSAGE);\n}\n\nRobot::~Robot()\n{\n\tdelete forward_camera;\n\tdelete downward_camera;\n}\n\nvoid Robot::set_period(int new_period)\n{\n\tperiod = new_period;\n\tlogger.write(\"Robot.period changed to\" + std::to_string(period),\n\t\t Logger::MESSAGE);\n}\n\nvoid Robot::autonomous_mode()\n{\n\tlogger.write(\"Running autonomous_init()\", Logger::MESSAGE);\n\tautonomous_init();\n\tlogger.write(\"Running autonomous_periodic()\", Logger::MESSAGE);\n\twhile (true) {\n\t\tautonomous_periodic();\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(period));\n\t}\n}\n\nvoid Robot::autonomous_init()\n{\n\tStartingGateMission starting_gate_mission = StartingGateMission(this);\n\tstarting_gate_mission.run();\n}\n\nvoid Robot::autonomous_periodic()\n{\n}\n\nvoid Robot::teleop_mode()\n{\n\tlogger.write(\"Running teleop_init()\", Logger::MESSAGE);\n\tteleop_init();\n\tlogger.write(\"Running teleop_periodic()\", Logger::MESSAGE);\n\twhile (true) {\n\t\tteleop_periodic();\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(period));\n\t}\n}\n\nvoid Robot::teleop_init()\n{\n\tint_base = \"dec\";\n\tstd::cout << \"Cubeception Helm\" << std::endl;\n\tstd::cout << \"Type \\\"help\\\" for help with commands\" << std::\n\t endl << std::endl;\n}\n\nvoid Robot::teleop_periodic()\n{\n\tif (serial.get_rx_packet()->get_bat_v() < bat_v_threshold)\n\t\tstd::cout << std::\n\t\t endl << \"WARNING: LOW BATTERY VOLTAGE\" << std::endl;\n\tstd::cout << \"cubeception> \";\n\tstd::string input;\n\tstd::getline(std::cin, input);\n\tlogger.write(\"Interpreter input: \" + input, Logger::VERBOSE);\n\tif (input.find(\" \") == std::string::npos) {\n\t\tif (input == \"mag_x\")\n\t\t\tstd::cout << \"mag_x = \" << serial.get_rx_packet()->\n\t\t\t get_mag_x() << std::endl;\n\t\telse if (input == \"mag_y\")\n\t\t\tstd::cout << \"mag_y = \" << serial.get_rx_packet()->\n\t\t\t get_mag_y() << std::endl;\n\t\telse if (input == \"mag_z\")\n\t\t\tstd::cout << \"mag_z = \" << serial.get_rx_packet()->\n\t\t\t get_mag_z() << std::endl;\n\t\telse if (input == \"pos_z\")\n\t\t\tstd::cout << \"pos_z = \" << serial.get_rx_packet()->\n\t\t\t get_pos_z() << std::endl;\n\t\telse if (input == \"health\")\n\t\t\tstd::cout << \"health = \" << serial.get_rx_packet()->\n\t\t\t get_health() << std::endl;\n\t\telse if (input == \"bat_v\")\n\t\t\tstd::cout << \"bat_v = \" << (uint16_t) serial.\n\t\t\t\tget_rx_packet()->get_bat_v() << std::endl;\n\t\telse if (input == \"reset\") {\n\t\t\tstd::bitset<16> mode;\n\t\t\tmode[15] = 1;\n\t\t\tserial.get_tx_packet()->set_mode(mode);\n\t\t\tstd::cout << \"Set mode = \" << serial.get_tx_packet()->get_mode().to_ulong() << std::endl;\n\t\t} else if (input == \"kill\") {\n\t\t\tstd::bitset<16> mode;\n\t\t\tmode[14] = 1;\n\t\t\tserial.get_tx_packet()->set_mode(mode);\n\t\t\tstd::cout << \"Set mode = \" << serial.get_tx_packet()->get_mode().to_ulong() << std::endl;\n\t\t} else if (input == \"dec\") {\n\t\t\tstd::cin >> std::dec;\n\t\t\tstd::cout << std::dec;\n\t\t\tint_base = \"dec\";\n\t\t\tstd::cout << \"Set base to decimal\" << std::endl;\n\t\t} else if (input == \"hex\") {\n\t\t\tstd::cin >> std::hex;\n\t\t\tstd::cout << std::hex;\n\t\t\tint_base = \"hex\";\n\t\t\tstd::cout << \"Set base to hex\" << std::endl;\n\t\t} else if (input == \"oct\") {\n\t\t\tstd::cin >> std::oct;\n\t\t\tstd::cout << std::oct;\n\t\t\tint_base = \"oct\";\n\t\t\tstd::cout << \"Set base to octal\" << std::endl;\n\t\t} else if (input == \"help\") {\n\t\t\tstd::cout << \"Available commands:\" << std::endl << std::\n\t\t\t endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_x \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along x-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_y \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along y-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_z \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along z-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"rot_z \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) <<\n\t\t\t \"set relative angular position about z-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"torpedo_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set torpedo control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"servo_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set servo control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"led_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set led control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mode \" << std::left << std::\n\t\t\t setw(8) << \"UINT16\" << std::\n\t\t\t setw(0) << \"set mode bytes\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"sleep \" << std::left << std::\n\t\t\t setw(8) << \"UINT32\" << std::\n\t\t\t setw(0) << \"sleep for given number of milliseconds\"\n\t\t\t << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_x \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer x-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_y \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer y-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_z \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer z-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"pos_z \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get position along z-axis\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"health \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get arduino health metric\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"bat_v \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get battery voltage\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"dec \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to decimal\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"hex \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to hex\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"oct \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to octal\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"help \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"show this help\" << std::endl;\n\t\t} else\n\t\t\tstd::cout << input << \": command not found\" << std::\n\t\t\t endl;\n\t} else {\n\t\tstd::string key;\n\t\tint value;\n\t\tif (int_base == \"dec\")\n\t\t\tstd::istringstream(input) >> key >> value;\n\t\telse if (int_base == \"hex\")\n\t\t\tstd::istringstream(input) >> std::hex >> key >> value;\n\t\telse if (int_base == \"oct\")\n\t\t\tstd::istringstream(input) >> std::oct >> key >> value;\n\t\tif (key == \"vel_x\") {\n\t\t\tserial.get_tx_packet()->set_vel_x(value);\n\t\t\tstd::cout << \"Set vel_x = \" << value << std::endl;\n\t\t} else if (key == \"vel_y\") {\n\t\t\tserial.get_tx_packet()->set_vel_y(value);\n\t\t\tstd::cout << \"Set vel_y = \" << value << std::endl;\n\t\t} else if (key == \"vel_z\") {\n\t\t\tserial.get_tx_packet()->set_vel_z(value);\n\t\t\tstd::cout << \"Set vel_z = \" << value << std::endl;\n\t\t} else if (key == \"rot_z\") {\n\t\t\tserial.get_tx_packet()->set_rot_z(value);\n\t\t\tstd::cout << \"Set rot_z = \" << value << std::endl;\n\t\t} else if (key == \"torpedo_ctl\") {\n\t\t\tserial.get_tx_packet()->set_torpedo_ctl(std::bitset <\n\t\t\t\t\t\t\t\t8 > ((uint8_t)\n\t\t\t\t\t\t\t\t value));\n\t\t\tstd::cout << \"Set torpedo_ctl = \" << value << std::endl;\n\t\t} else if (key == \"servo_ctl\") {\n\t\t\tserial.get_tx_packet()->set_servo_ctl(std::bitset < 8 >\n\t\t\t\t\t\t\t ((uint8_t)\n\t\t\t\t\t\t\t value));\n\t\t\tstd::cout << \"Set servo_ctl = \" << value << std::endl;\n\t\t} else if (key == \"led_ctl\") {\n\t\t\tserial.get_tx_packet()->set_led_ctl(std::bitset < 8 >\n\t\t\t\t\t\t\t ((uint8_t) value));\n\t\t\tstd::cout << \"Set led_ctl = \" << value << std::endl;\n\t\t} else if (key == \"mode\") {\n\t\t\tserial.get_tx_packet()->set_mode(std::bitset < 16 >\n\t\t\t\t\t\t\t ((uint16_t) value));\n\t\t\tstd::cout << \"Set mode = \" << value << std::endl;\n\t\t} else if (key == \"sleep\") {\n\t\t\tstd::cout << \"Sleeping for \" << value << \" ms\" <<\n\t\t\t std::endl;\n\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds\n\t\t\t\t\t\t (value));\n\t\t} else\n\t\t\tstd::cout << key << \": command not found\" << std::endl;\n\t}\n}\n\nBaseVideoDevice *Robot::get_forward_camera()\n{\n\treturn forward_camera;\n}\n\nBaseVideoDevice *Robot::get_downward_camera()\n{\n\treturn downward_camera;\n}\n\nLogger *Robot::get_logger()\n{\n\treturn &logger;\n}\n<commit_msg>Added kill command to interpreter<commit_after>\/* Robot.cpp -- Implementation of Robot class\n\n Copyright (C) 2014 Tushar Pankaj\n \n This file is part of San Diego Robotics 101 Robosub.\n \n San Diego Robotics 101 Robosub is free software: you can redistribute it\n and\/or modify it under the terms of the GNU General Public License as\n published by the Free Software Foundation, either version 3 of the License,\n or (at your option) any later version.\n \n San Diego Robotics 101 Robosub is distributed in the hope that it will be\n useful, but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General\n Public License for more details.\n \n You should have received a copy of the GNU General Public License\n along with San Diego Robotics 101 Robosub. If not, see\n <http:\/\/www.gnu.org\/licenses\/>. *\/\n\n#include <iostream>\n#include <iomanip>\n#include <thread>\n#include <chrono>\n#include <string>\n#include <sstream>\n#include <bitset>\n#include \"Robot.hpp\"\n#include \"Serial.hpp\"\n#include \"TXPacket.hpp\"\n#include \"Logger.hpp\"\n#include \"BaseVideoDevice.hpp\"\n#include \"USBVideoDevice.hpp\"\n#ifdef RPI_COMPILE\n#include \"RPIVideoDevice.hpp\"\n#endif\n#include \"StartingGateMission.hpp\"\n\n Robot::Robot():logger(\"\/tmp\/rpi_log\/rpi_log.log\", Logger::DEBUG)\n{\n\tlogger.write(\"Initializing robot\", Logger::MESSAGE);\n\tperiod = 10;\n\tlogger.write(\"Initialized Robot.period to \" + std::to_string(period),\n\t\t Logger::MESSAGE);\n\tbat_v_threshold = 128;\n\tlogger.write(\"Initialized Robot.bat_v_threshold to \" +\n\t\t std::to_string(bat_v_threshold), Logger::MESSAGE);\n#ifdef RPI_COMPILE\n\tlogger.write(\"Starting serial driver\", Logger::MESSAGE);\n\tserial.open_serial();\n\tserial.start();\n\tlogger.write(\"Finished starting serial driver\", Logger::MESSAGE);\n#endif\n#ifdef RPI_COMPILE\n\tlogger.write(\"Initializing forward camera as RPIVideoDevice\",\n\t\t Logger::MESSAGE);\n\tforward_camera = new RPIVideoDevice();\n\tlogger.write(\"Finished initializing forward camera as RPIVideoDevice\",\n\t\t Logger::MESSAGE);\n#else\n\tlogger.write(\"Initializing forward camera as USBVideoDevice(1)\",\n\t\t Logger::MESSAGE);\n\tforward_camera = new USBVideoDevice(1);\n\tlogger.\n\t write(\"Finished initializing forward camera as USBVideoDevice(1)\",\n\t\t Logger::MESSAGE);\n#endif\n\tlogger.write(\"Initializing downward camera as USBVideoDevice(0)\",\n\t\t Logger::MESSAGE);\n\tdownward_camera = new USBVideoDevice(0);\n\tlogger.\n\t write(\"Finished initializing downward camera as USBVideoDevice(0)\",\n\t\t Logger::MESSAGE);\n\tlogger.write(\"Starting forward camera\", Logger::MESSAGE);\n\tforward_camera->start();\n\tlogger.write(\"Finished starting forward camera\", Logger::MESSAGE);\n\tlogger.write(\"Starting downward camera\", Logger::MESSAGE);\n\tdownward_camera->start();\n\tlogger.write(\"Finished starting downward camera\", Logger::MESSAGE);\n\tlogger.write(\"Finished initializing robot\", Logger::MESSAGE);\n}\n\nRobot::~Robot()\n{\n\tdelete forward_camera;\n\tdelete downward_camera;\n}\n\nvoid Robot::set_period(int new_period)\n{\n\tperiod = new_period;\n\tlogger.write(\"Robot.period changed to\" + std::to_string(period),\n\t\t Logger::MESSAGE);\n}\n\nvoid Robot::autonomous_mode()\n{\n\tlogger.write(\"Running autonomous_init()\", Logger::MESSAGE);\n\tautonomous_init();\n\tlogger.write(\"Running autonomous_periodic()\", Logger::MESSAGE);\n\twhile (true) {\n\t\tautonomous_periodic();\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(period));\n\t}\n}\n\nvoid Robot::autonomous_init()\n{\n\tStartingGateMission starting_gate_mission = StartingGateMission(this);\n\tstarting_gate_mission.run();\n}\n\nvoid Robot::autonomous_periodic()\n{\n}\n\nvoid Robot::teleop_mode()\n{\n\tlogger.write(\"Running teleop_init()\", Logger::MESSAGE);\n\tteleop_init();\n\tlogger.write(\"Running teleop_periodic()\", Logger::MESSAGE);\n\twhile (true) {\n\t\tteleop_periodic();\n\t\tstd::this_thread::sleep_for(std::chrono::milliseconds(period));\n\t}\n}\n\nvoid Robot::teleop_init()\n{\n\tint_base = \"dec\";\n\tstd::cout << \"Cubeception Helm\" << std::endl;\n\tstd::cout << \"Type \\\"help\\\" for help with commands\" << std::\n\t endl << std::endl;\n}\n\nvoid Robot::teleop_periodic()\n{\n\tif (serial.get_rx_packet()->get_bat_v() < bat_v_threshold)\n\t\tstd::cout << std::\n\t\t endl << \"WARNING: LOW BATTERY VOLTAGE\" << std::endl;\n\tstd::cout << \"cubeception> \";\n\tstd::string input;\n\tstd::getline(std::cin, input);\n\tlogger.write(\"Interpreter input: \" + input, Logger::VERBOSE);\n\tif (input.find(\" \") == std::string::npos) {\n\t\tif (input == \"mag_x\")\n\t\t\tstd::cout << \"mag_x = \" << serial.get_rx_packet()->\n\t\t\t get_mag_x() << std::endl;\n\t\telse if (input == \"mag_y\")\n\t\t\tstd::cout << \"mag_y = \" << serial.get_rx_packet()->\n\t\t\t get_mag_y() << std::endl;\n\t\telse if (input == \"mag_z\")\n\t\t\tstd::cout << \"mag_z = \" << serial.get_rx_packet()->\n\t\t\t get_mag_z() << std::endl;\n\t\telse if (input == \"pos_z\")\n\t\t\tstd::cout << \"pos_z = \" << serial.get_rx_packet()->\n\t\t\t get_pos_z() << std::endl;\n\t\telse if (input == \"health\")\n\t\t\tstd::cout << \"health = \" << serial.get_rx_packet()->\n\t\t\t get_health() << std::endl;\n\t\telse if (input == \"bat_v\")\n\t\t\tstd::cout << \"bat_v = \" << (uint16_t) serial.\n\t\t\t\tget_rx_packet()->get_bat_v() << std::endl;\n\t\telse if (input == \"reset\") {\n\t\t\tstd::bitset<16> mode;\n\t\t\tmode[15] = 1;\n\t\t\tserial.get_tx_packet()->set_mode(mode);\n\t\t\tstd::cout << \"Set mode = \" << serial.get_tx_packet()->get_mode().to_ulong() << std::endl;\n\t\t} else if (input == \"kill\") {\n\t\t\tstd::bitset<16> mode;\n\t\t\tmode[14] = 1;\n\t\t\tserial.get_tx_packet()->set_mode(mode);\n\t\t\tstd::cout << \"Set mode = \" << serial.get_tx_packet()->get_mode().to_ulong() << std::endl;\n\t\t} else if (input == \"dec\") {\n\t\t\tstd::cin >> std::dec;\n\t\t\tstd::cout << std::dec;\n\t\t\tint_base = \"dec\";\n\t\t\tstd::cout << \"Set base to decimal\" << std::endl;\n\t\t} else if (input == \"hex\") {\n\t\t\tstd::cin >> std::hex;\n\t\t\tstd::cout << std::hex;\n\t\t\tint_base = \"hex\";\n\t\t\tstd::cout << \"Set base to hex\" << std::endl;\n\t\t} else if (input == \"oct\") {\n\t\t\tstd::cin >> std::oct;\n\t\t\tstd::cout << std::oct;\n\t\t\tint_base = \"oct\";\n\t\t\tstd::cout << \"Set base to octal\" << std::endl;\n\t\t} else if (input == \"help\") {\n\t\t\tstd::cout << \"Available commands:\" << std::endl << std::\n\t\t\t endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_x \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along x-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_y \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along y-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"vel_z \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) << \"set linear velocity along z-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"rot_z \" << std::left << std::\n\t\t\t setw(8) << \"INT8\" << std::\n\t\t\t setw(0) <<\n\t\t\t \"set relative angular position about z-axis\" <<\n\t\t\t std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"torpedo_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set torpedo control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"servo_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set servo control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"led_ctl \" << std::left << std::\n\t\t\t setw(8) << \"UINT8\" << std::\n\t\t\t setw(0) << \"set led control byte\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mode \" << std::left << std::\n\t\t\t setw(8) << \"UINT16\" << std::\n\t\t\t setw(0) << \"set mode bytes\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"sleep \" << std::left << std::\n\t\t\t setw(8) << \"UINT32\" << std::\n\t\t\t setw(0) << \"sleep for given number of milliseconds\"\n\t\t\t << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_x \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer x-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_y \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer y-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"mag_z \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get magnetometer z-axis value\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"pos_z \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get position along z-axis\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"health \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get arduino health metric\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"bat_v \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"get battery voltage\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"kill \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"kill all motors\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"dec \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to decimal\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"hex \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to hex\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"oct \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"set integer base to octal\" << std::endl;\n\t\t\tstd::cout << std::right << std::\n\t\t\t setw(14) << \"help \" << std::left << std::\n\t\t\t setw(8) << \" \" << std::setw(0)\n\t\t\t << \"show this help\" << std::endl;\n\t\t} else\n\t\t\tstd::cout << input << \": command not found\" << std::\n\t\t\t endl;\n\t} else {\n\t\tstd::string key;\n\t\tint value;\n\t\tif (int_base == \"dec\")\n\t\t\tstd::istringstream(input) >> key >> value;\n\t\telse if (int_base == \"hex\")\n\t\t\tstd::istringstream(input) >> std::hex >> key >> value;\n\t\telse if (int_base == \"oct\")\n\t\t\tstd::istringstream(input) >> std::oct >> key >> value;\n\t\tif (key == \"vel_x\") {\n\t\t\tserial.get_tx_packet()->set_vel_x(value);\n\t\t\tstd::cout << \"Set vel_x = \" << value << std::endl;\n\t\t} else if (key == \"vel_y\") {\n\t\t\tserial.get_tx_packet()->set_vel_y(value);\n\t\t\tstd::cout << \"Set vel_y = \" << value << std::endl;\n\t\t} else if (key == \"vel_z\") {\n\t\t\tserial.get_tx_packet()->set_vel_z(value);\n\t\t\tstd::cout << \"Set vel_z = \" << value << std::endl;\n\t\t} else if (key == \"rot_z\") {\n\t\t\tserial.get_tx_packet()->set_rot_z(value);\n\t\t\tstd::cout << \"Set rot_z = \" << value << std::endl;\n\t\t} else if (key == \"torpedo_ctl\") {\n\t\t\tserial.get_tx_packet()->set_torpedo_ctl(std::bitset <\n\t\t\t\t\t\t\t\t8 > ((uint8_t)\n\t\t\t\t\t\t\t\t value));\n\t\t\tstd::cout << \"Set torpedo_ctl = \" << value << std::endl;\n\t\t} else if (key == \"servo_ctl\") {\n\t\t\tserial.get_tx_packet()->set_servo_ctl(std::bitset < 8 >\n\t\t\t\t\t\t\t ((uint8_t)\n\t\t\t\t\t\t\t value));\n\t\t\tstd::cout << \"Set servo_ctl = \" << value << std::endl;\n\t\t} else if (key == \"led_ctl\") {\n\t\t\tserial.get_tx_packet()->set_led_ctl(std::bitset < 8 >\n\t\t\t\t\t\t\t ((uint8_t) value));\n\t\t\tstd::cout << \"Set led_ctl = \" << value << std::endl;\n\t\t} else if (key == \"mode\") {\n\t\t\tserial.get_tx_packet()->set_mode(std::bitset < 16 >\n\t\t\t\t\t\t\t ((uint16_t) value));\n\t\t\tstd::cout << \"Set mode = \" << value << std::endl;\n\t\t} else if (key == \"sleep\") {\n\t\t\tstd::cout << \"Sleeping for \" << value << \" ms\" <<\n\t\t\t std::endl;\n\t\t\tstd::this_thread::sleep_for(std::chrono::milliseconds\n\t\t\t\t\t\t (value));\n\t\t} else\n\t\t\tstd::cout << key << \": command not found\" << std::endl;\n\t}\n}\n\nBaseVideoDevice *Robot::get_forward_camera()\n{\n\treturn forward_camera;\n}\n\nBaseVideoDevice *Robot::get_downward_camera()\n{\n\treturn downward_camera;\n}\n\nLogger *Robot::get_logger()\n{\n\treturn &logger;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2014 Sarah Wong\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"configuration.h\"\n#include \"ui_configuration.h\"\n\n#include <QDebug>\n#include <QResource>\n\n#include <portaudiocpp\/System.hxx>\n#include <portaudiocpp\/SystemHostApiIterator.hxx>\n#include <portaudiocpp\/SystemDeviceIterator.hxx>\n\n#include \"tinyscheme\/scheme-private.h\"\n#include \"tinyscheme\/scheme.h\"\n\nnamespace {\n\ntemplate <class IndexMapType, class ItemIter, class ItemType, class Callable1,\n class Callable2>\nstatic void insertWithDefault(QComboBox *comboBox, IndexMapType &map,\n ItemIter begin, ItemIter end,\n ItemType& defaultItem,\n\t\t\t Callable1 stringGenerator,\n Callable2 mapItemGenerator) {\n int itemPosition = 0;\n\n comboBox->clear();\n map.clear();\n\n {\n map[itemPosition] = mapItemGenerator(defaultItem);\n\n comboBox->insertItem(itemPosition++,\n QLatin1String(\"Default: \") + stringGenerator(defaultItem));\n }\n\n comboBox->insertSeparator(itemPosition++);\n\n while (begin != end) {\n ItemType& item = *begin;\n\n map[itemPosition] = mapItemGenerator(item);\n\n comboBox->insertItem(itemPosition++, stringGenerator(item));\n\n ++begin;\n }\n\n}\n\n} \/\/ namespace anonymous\n\nConfiguration::Configuration(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::Configuration)\n{\n ui->setupUi(this);\n\n portaudio::System& sys = portaudio::System::instance();\n\n insertWithDefault(\n ui->cmbAudioHost, m_indexToHostApiTypeId, sys.hostApisBegin(),\n sys.hostApisEnd(), sys.defaultHostApi(),\n [](portaudio::HostApi &hostApi) { return hostApi.name(); },\n [](portaudio::HostApi &hostApi) { return hostApi.typeId(); });\n}\n\nPaDeviceIndex Configuration::getDeviceIndex() const\n{\n auto index = ui->cmbInputDevice->currentIndex();\n Q_ASSERT(index != -1);\n return m_indexToDeviceIndex[index];\n}\n\nvoid Configuration::on_cmbAudioHost_currentIndexChanged(int index)\n{\n if (index == -1)\n return;\n\n portaudio::HostApi &hostApi = portaudio::System::instance().hostApiByTypeId(\n m_indexToHostApiTypeId[index]);\n\n insertWithDefault(\n ui->cmbInputDevice, m_indexToDeviceIndex,\n hostApi.devicesBegin(), hostApi.devicesEnd(), hostApi.defaultInputDevice(),\n [](portaudio::Device &device) { return device.name(); },\n [](portaudio::Device &device) { return device.index(); });\n\n}\n\nvoid Configuration::on_buttonBox_accepted()\n{\n QResource initScm(\":\/tinyscheme\/init.scm\");\n Q_ASSERT(initScm.isValid());\n QByteArray initFileTextBa(qUncompress(initScm.data(), initScm.size()));\n\n scheme* sc = scheme_init_new();\n Q_ASSERT(sc != nullptr);\n\n scheme_set_input_port_file(sc, stdin);\n scheme_set_output_port_file(sc, stdout);\n\n\n QString configText = ui->txtConfig->toPlainText();\n QByteArray configTextBa = configText.toLatin1();\n scheme_load_string(sc, configTextBa.data());\n if (sc->retcode != 0) qDebug() << \"Scheme failed\" << __LINE__;\n\n \/\/ init.scm\n scheme_load_string(sc, initFileTextBa.data());\n\n scheme_load_string(sc, \"(define (get-sample-rate) (cadr (assv 'sample-rate config)))\");\n\n pointer func = scheme_eval(sc, mk_symbol(sc, \"get-sample-rate\"));\n pointer ret = scheme_call(sc, func, sc->NIL);\n\n qDebug() << ret->_flag;\n qDebug() << sc->vptr->ivalue(ret);\n\n {\n pointer func_write = scheme_eval(sc, mk_symbol(sc, \"write\"));\n scheme_call(sc, func_write, _cons(sc, ret, sc->NIL, 0));\n scheme_load_string(sc, \"(newline)\");\n }\n\n emit accept();\n}\n\nConfiguration::~Configuration()\n{\n delete ui;\n}\n<commit_msg>Fix\/delete stuff that was unsafe if TinyScheme GC is run<commit_after>\/*\n Copyright 2014 Sarah Wong\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"configuration.h\"\n#include \"ui_configuration.h\"\n\n#include <QDebug>\n#include <QResource>\n\n#include <portaudiocpp\/System.hxx>\n#include <portaudiocpp\/SystemHostApiIterator.hxx>\n#include <portaudiocpp\/SystemDeviceIterator.hxx>\n\n#include \"tinyscheme\/scheme-private.h\"\n#include \"tinyscheme\/scheme.h\"\n\nnamespace {\n\ntemplate <class IndexMapType, class ItemIter, class ItemType, class Callable1,\n class Callable2>\nstatic void insertWithDefault(QComboBox *comboBox, IndexMapType &map,\n ItemIter begin, ItemIter end,\n ItemType& defaultItem,\n\t\t\t Callable1 stringGenerator,\n Callable2 mapItemGenerator) {\n int itemPosition = 0;\n\n comboBox->clear();\n map.clear();\n\n {\n map[itemPosition] = mapItemGenerator(defaultItem);\n\n comboBox->insertItem(itemPosition++,\n QLatin1String(\"Default: \") + stringGenerator(defaultItem));\n }\n\n comboBox->insertSeparator(itemPosition++);\n\n while (begin != end) {\n ItemType& item = *begin;\n\n map[itemPosition] = mapItemGenerator(item);\n\n comboBox->insertItem(itemPosition++, stringGenerator(item));\n\n ++begin;\n }\n\n}\n\n} \/\/ namespace anonymous\n\nConfiguration::Configuration(QWidget *parent) :\n QDialog(parent),\n ui(new Ui::Configuration)\n{\n ui->setupUi(this);\n\n portaudio::System& sys = portaudio::System::instance();\n\n insertWithDefault(\n ui->cmbAudioHost, m_indexToHostApiTypeId, sys.hostApisBegin(),\n sys.hostApisEnd(), sys.defaultHostApi(),\n [](portaudio::HostApi &hostApi) { return hostApi.name(); },\n [](portaudio::HostApi &hostApi) { return hostApi.typeId(); });\n}\n\nPaDeviceIndex Configuration::getDeviceIndex() const\n{\n auto index = ui->cmbInputDevice->currentIndex();\n Q_ASSERT(index != -1);\n return m_indexToDeviceIndex[index];\n}\n\nvoid Configuration::on_cmbAudioHost_currentIndexChanged(int index)\n{\n if (index == -1)\n return;\n\n portaudio::HostApi &hostApi = portaudio::System::instance().hostApiByTypeId(\n m_indexToHostApiTypeId[index]);\n\n insertWithDefault(\n ui->cmbInputDevice, m_indexToDeviceIndex,\n hostApi.devicesBegin(), hostApi.devicesEnd(), hostApi.defaultInputDevice(),\n [](portaudio::Device &device) { return device.name(); },\n [](portaudio::Device &device) { return device.index(); });\n\n}\n\nvoid Configuration::on_buttonBox_accepted()\n{\n QResource initScm(\":\/tinyscheme\/init.scm\");\n Q_ASSERT(initScm.isValid());\n QByteArray initFileTextBa(qUncompress(initScm.data(), initScm.size()));\n\n scheme* sc = scheme_init_new();\n Q_ASSERT(sc != nullptr);\n\n scheme_set_input_port_file(sc, stdin);\n scheme_set_output_port_file(sc, stdout);\n\n\n QString configText = ui->txtConfig->toPlainText();\n QByteArray configTextBa = configText.toLatin1();\n scheme_load_string(sc, configTextBa.data());\n if (sc->retcode != 0) qDebug() << \"Scheme failed\" << __LINE__;\n\n \/\/ init.scm\n scheme_load_string(sc, initFileTextBa.data());\n\n scheme_load_string(sc, \"(define (get-sample-rate) (cadr (assv 'sample-rate config)))\");\n\n pointer ret = scheme_apply0(sc, \"get-sample-rate\");\n\n qDebug() << ret->_flag;\n qDebug() << sc->vptr->ivalue(ret);\n\n emit accept();\n}\n\nConfiguration::~Configuration()\n{\n delete ui;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2017, Arm Limited and affiliates.\n * SPDX-License-Identifier: Apache-2.0\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"AT_CellularBase.h\"\n#include \"CellularLog.h\"\n\nusing namespace mbed;\n\nAT_CellularBase::AT_CellularBase(ATHandler &at) : _at(at)\n{\n}\n\nATHandler &AT_CellularBase::get_at_handler()\n{\n return _at;\n}\n\ndevice_err_t AT_CellularBase::get_device_error() const\n{\n return _at.get_last_device_error();\n}\n\nconst intptr_t *AT_CellularBase::_property_array;\n\nvoid AT_CellularBase::set_cellular_properties(const intptr_t *property_array)\n{\n if (!property_array) {\n tr_warning(\"trying to set an empty cellular property array\");\n return;\n }\n\n _property_array = property_array;\n}\n\nintptr_t AT_CellularBase::get_property(CellularProperty key)\n{\n return _property_array[key];\n}\n<commit_msg>Check Properties have been set<commit_after>\/*\n * Copyright (c) 2017, Arm Limited and affiliates.\n * SPDX-License-Identifier: Apache-2.0\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"AT_CellularBase.h\"\n#include \"CellularLog.h\"\n\nusing namespace mbed;\n\nAT_CellularBase::AT_CellularBase(ATHandler &at) : _at(at)\n{\n}\n\nATHandler &AT_CellularBase::get_at_handler()\n{\n return _at;\n}\n\ndevice_err_t AT_CellularBase::get_device_error() const\n{\n return _at.get_last_device_error();\n}\n\nconst intptr_t *AT_CellularBase::_property_array = NULL;\n\nvoid AT_CellularBase::set_cellular_properties(const intptr_t *property_array)\n{\n if (!property_array) {\n tr_warning(\"trying to set an empty cellular property array\");\n return;\n }\n\n _property_array = property_array;\n}\n\nintptr_t AT_CellularBase::get_property(CellularProperty key)\n{\n if (_property_array) {\n return _property_array[key];\n } else {\n return NULL;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/pm\/p9_pm_recovery_ffdc_cppm.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2017,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef __PM_RECOVERY_FFDC_CPPM_\n#define __PM_RECOVERY_FFDC_CPPM_\n\n\/\/\/\n\/\/\/ @file p9_pm_recovery_ffdc_cppm.H\n\/\/\/ @brief CPPM FFDC collection of PM complex\n\/\/\/\n\/\/\/ *HWP HWP Owner: Greg Still <stillgs@us.ibm.com>\n\/\/\/ *HWP FW Owner: Prasad Bg Ranganath <prasadbgr@in.ibm.com>\n\/\/\/ *HWP Team: PM\n\/\/\/ *HWP Level: 2\n\/\/\/ *HWP Consumed by: Hostboot\n\/\/\n\/\/ *INDENT-OFF*\n\/\/--------------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------------\n#include <fapi2.H>\n#include <stdint.h>\n#include <p9_pm_recovery_ffdc_base.H>\n\nnamespace p9_stop_recov_ffdc\n{\n\n class CppmRegs : public PlatPmComplex\n {\n public:\n \/\/\/ @brief constructor\n CppmRegs(const fapi2::Target< fapi2::TARGET_TYPE_PROC_CHIP > i_procChipTgt );\n\n \/\/\/ @brief destructor\n virtual ~CppmRegs () { };\n\n \/\/\/ @brief Initializes the Quad and CPPM FFDC Sub-Sections in HOMER with default headers\n \/\/\/ @param[in] i_pHomerBuf points to base of P9 HOMER.\n \/\/\/ @return fapi2 return code\n fapi2::ReturnCode init ( void* i_pHomerBuf );\n\n \/\/\/ @brief collects FFDC pertaining to all functional cores in the chip.\n \/\/\/ @param[in] i_pHomerBuf points to base of P9 HOMER.\n \/\/\/ @param[in] i_ffdcType indicates the content type to collect\n \/\/ @return fapi2 return code.\n fapi2::ReturnCode collectFfdc ( void* i_pHomerBuf,\n uint8_t i_ffdcType = ALL );\n\n private:\n \/\/\/ @brief updates the CPPM FFDC Header\n \/\/\/@param[in] i_pHomerBuf points to a location in HOMER meant for CPPM Header\n \/\/\/@param[in] i_CppmInstance CPPM instance\n \/\/\/@param[in] i_ffdcValid non-zero indicates the CPPM FFDC is valid\n \/\/\/@return fapi2 return code.\n\n fapi2::ReturnCode updateCppmFfdcHeader( uint8_t * i_pHomerBuf, \n const uint8_t i_cppmInstance,\n const uint16_t i_ffdcValid);\n \/\/\/ @brief updates the QUAD FFDC Header\n \/\/\/@param[in] i_pHomerBuf points to a location in HOMER meant for Quad Header\n \/\/\/@param[in] i_quadInstance Quad instance\n \/\/\/@param[in] i_ffdcValid non-zero indicates the Quad FFDC is valid\n \/\/\/@return fapi2 return code.\n\n fapi2::ReturnCode updateQuadFfdcHeader( uint8_t * i_pHomerBuf, \n const uint8_t i_quadInstance,\n const uint16_t i_ffdcValid);\n };\n\nextern \"C\"\n{\n typedef fapi2::ReturnCode( *p9_pm_recovery_ffdc_cppm_FP_t )\n ( const fapi2::Target< fapi2::TARGET_TYPE_PROC_CHIP > & i_procChipTgt,\n void * i_cppmFfdcBuf );\n}\n\n} \/\/namespace p9_stop_recov_ffdc ends\n\n#endif \/\/PM_RECOVERY_FFDC_CPPM\n<commit_msg>PM: Generation of summarized version of STOP Recovery FFDC.<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/pm\/p9_pm_recovery_ffdc_cppm.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2017,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n#ifndef __PM_RECOVERY_FFDC_CPPM_\n#define __PM_RECOVERY_FFDC_CPPM_\n\n\/\/\/\n\/\/\/ @file p9_pm_recovery_ffdc_cppm.H\n\/\/\/ @brief CPPM FFDC collection of PM complex\n\/\/\/\n\/\/\/ *HWP HWP Owner: Greg Still <stillgs@us.ibm.com>\n\/\/\/ *HWP FW Owner: Prasad Bg Ranganath <prasadbgr@in.ibm.com>\n\/\/\/ *HWP Team: PM\n\/\/\/ *HWP Level: 2\n\/\/\/ *HWP Consumed by: Hostboot\n\/\/\n\/\/ *INDENT-OFF*\n\/\/--------------------------------------------------------------------------\n\/\/ Includes\n\/\/--------------------------------------------------------------------------\n#include <fapi2.H>\n#include <stdint.h>\n#include <p9_pm_recovery_ffdc_base.H>\n\nnamespace p9_stop_recov_ffdc\n{\n\n class CppmRegs : public PlatPmComplex\n {\n public:\n \/\/\/ @brief constructor\n CppmRegs(const fapi2::Target< fapi2::TARGET_TYPE_PROC_CHIP > i_procChipTgt );\n\n \/\/\/ @brief destructor\n virtual ~CppmRegs () { };\n\n \/\/\/ @brief Initializes the Quad and CPPM FFDC Sub-Sections in HOMER with default headers\n \/\/\/ @param[in] i_pHomerBuf points to base of P9 HOMER.\n \/\/\/ @return fapi2 return code\n fapi2::ReturnCode init ( void* i_pHomerBuf );\n\n \/\/\/ @brief collects FFDC pertaining to all functional cores in the chip.\n \/\/\/ @param[in] i_pHomerBuf points to base of P9 HOMER.\n \/\/\/ @param[in] i_ffdcType indicates the content type to collect\n \/\/ @return fapi2 return code.\n fapi2::ReturnCode collectFfdc ( void* i_pHomerBuf,\n uint8_t i_ffdcType = ALL );\n\n \/\/\/ @brief generates summary of FFDC pertaining to a given platform.\n \/\/\/ @param[in] i_pHomer points to Homer base.\n \/\/\/ @return fapi2 return code\n fapi2::ReturnCode generateSummary( void * i_pHomer );\n private:\n\n \/\/\/@brief initializes a list of register for generation of FFDC summary.\n void initRegList();\n\n \/\/\/ @brief updates the CPPM FFDC Header\n \/\/\/@param[in] i_pHomerBuf points to a location in HOMER meant for CPPM Header\n \/\/\/@param[in] i_CppmInstance CPPM instance\n \/\/\/@param[in] i_ffdcValid non-zero indicates the CPPM FFDC is valid\n \/\/\/@return fapi2 return code.\n\n fapi2::ReturnCode updateCppmFfdcHeader( uint8_t * i_pHomerBuf,\n const uint8_t i_cppmInstance,\n const uint16_t i_ffdcValid);\n \/\/\/ @brief updates the QUAD FFDC Header\n \/\/\/@param[in] i_pHomerBuf points to a location in HOMER meant for Quad Header\n \/\/\/@param[in] i_quadInstance Quad instance\n \/\/\/@param[in] i_ffdcValid non-zero indicates the Quad FFDC is valid\n \/\/\/@return fapi2 return code.\n\n fapi2::ReturnCode updateQuadFfdcHeader( uint8_t * i_pHomerBuf,\n const uint8_t i_quadInstance,\n const uint16_t i_ffdcValid);\n private:\n std::vector<uint32_t> iv_cppmSummaryReg;\n };\n\n \/\/---------------------------------------------------------------------------------------------\n \/\/ function pointer typedef definition for HWP call support\n typedef fapi2::ReturnCode( *p9_pm_recovery_ffdc_cppm_FP_t )\n ( const fapi2::Target< fapi2::TARGET_TYPE_PROC_CHIP > & i_procChipTgt,\n void * i_cppmFfdcBuf );\nextern \"C\"\n{\n \/\/ -----------------------------------------------------------------------------\n \/\/ Function prototypes\n \/\/ -----------------------------------------------------------------------------\n \/\/\/\n \/\/\/ @brief Populates the PM FFDC section with FFDC collected from CPPM\n \/\/\/\n \/\/\/ @param[in] i_procChipTarget Proc Chip target\n \/\/\/ @param[in] i_pHomerImage Pointer to the base of the chip HOMER region\n \/\/\/\n \/\/\/ @return FAPI2_RC_SUCCESS on success or error return code\n \/\/\/\n fapi2::ReturnCode p9_pm_recovery_ffdc_cppm\n ( const fapi2::Target<fapi2::TARGET_TYPE_PROC_CHIP>& i_procChipTarget,\n void* i_pHomerImage );\n}\n\n} \/\/namespace p9_stop_recov_ffdc ends\n\n#endif \/\/PM_RECOVERY_FFDC_CPPM\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Endless Mobile\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA\n * 02111-1307, USA.\n *\n * Written by:\n * Jasper St. Pierre <jstpierre@mecheye.net>\n *\/\n\n#include \"value.h\"\n#include \"gobject.h\"\n\nnamespace GNodeJS {\n\nv8::Handle<v8::Value> GIArgumentToV8(GITypeInfo *type_info, GIArgument *arg) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_VOID:\n return v8::Undefined ();\n\n case GI_TYPE_TAG_BOOLEAN:\n if (arg->v_boolean)\n return v8::True ();\n else\n return v8::False ();\n\n case GI_TYPE_TAG_INT32:\n return v8::Integer::New (arg->v_int);\n case GI_TYPE_TAG_UINT32:\n return v8::Integer::NewFromUnsigned (arg->v_uint);\n case GI_TYPE_TAG_INT16:\n return v8::Integer::New (arg->v_int16);\n case GI_TYPE_TAG_UINT16:\n return v8::Integer::NewFromUnsigned (arg->v_uint16);\n case GI_TYPE_TAG_INT8:\n return v8::Integer::New (arg->v_int8);\n case GI_TYPE_TAG_UINT8:\n return v8::Integer::NewFromUnsigned (arg->v_uint8);\n case GI_TYPE_TAG_FLOAT:\n return v8::Number::New (arg->v_float);\n case GI_TYPE_TAG_DOUBLE:\n return v8::Number::New (arg->v_double);\n\n \/* For 64-bit integer types, use a float. When JS and V8 adopt\n * bigger sized integer types, start using those instead. *\/\n case GI_TYPE_TAG_INT64:\n return v8::Number::New (arg->v_int64);\n case GI_TYPE_TAG_UINT64:\n return v8::Number::New (arg->v_uint64);\n\n case GI_TYPE_TAG_UNICHAR:\n {\n char data[7];\n int size = g_unichar_to_utf8 (arg->v_uint32, data);\n return v8::String::New (data, size);\n }\n\n case GI_TYPE_TAG_UTF8:\n if (arg->v_pointer)\n return v8::String::New ((char *) arg->v_pointer);\n else\n return v8::Null ();\n\n case GI_TYPE_TAG_INTERFACE:\n {\n GIBaseInfo *interface_info = g_type_info_get_interface (type_info);\n GIInfoType interface_type = g_base_info_get_type (interface_info);\n\n switch (interface_type) {\n case GI_INFO_TYPE_OBJECT:\n return WrapperFromGObject ((GObject *) arg->v_pointer);\n default:\n g_assert_not_reached ();\n }\n }\n break;\n\n default:\n g_assert_not_reached ();\n }\n}\n\nvoid V8ToGIArgument(GITypeInfo *type_info, GIArgument *arg, v8::Handle<v8::Value> value) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_VOID:\n arg->v_pointer = NULL;\n break;\n case GI_TYPE_TAG_BOOLEAN:\n arg->v_boolean = value->BooleanValue ();\n break;\n case GI_TYPE_TAG_INT32:\n arg->v_int = value->Int32Value ();\n break;\n case GI_TYPE_TAG_UINT32:\n arg->v_uint = value->Uint32Value ();\n break;\n case GI_TYPE_TAG_INT64:\n arg->v_int64 = value->NumberValue ();\n break;\n case GI_TYPE_TAG_UINT64:\n arg->v_uint64 = value->NumberValue ();\n break;\n case GI_TYPE_TAG_FLOAT:\n arg->v_float = value->NumberValue ();\n break;\n case GI_TYPE_TAG_DOUBLE:\n arg->v_double = value->NumberValue ();\n break;\n\n case GI_TYPE_TAG_UTF8:\n {\n v8::String::Utf8Value str (value);\n const char *data = *str;\n arg->v_pointer = g_strdup (data);\n }\n break;\n\n case GI_TYPE_TAG_INTERFACE:\n {\n GIBaseInfo *interface_info = g_type_info_get_interface (type_info);\n GIInfoType interface_type = g_base_info_get_type (interface_info);\n\n switch (interface_type) {\n case GI_INFO_TYPE_OBJECT:\n arg->v_pointer = GObjectFromWrapper (value);\n break;\n default:\n g_assert_not_reached ();\n }\n\n g_base_info_unref (interface_info);\n }\n break;\n\n default:\n g_assert_not_reached ();\n }\n}\n\nvoid FreeGIArgument(GITypeInfo *type_info, GIArgument *arg) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_UTF8:\n g_free (arg->v_pointer);\n break;\n default:\n break;\n }\n}\n\nvoid V8ToGValue(GValue *gvalue, v8::Handle<v8::Value> value) {\n if (G_VALUE_HOLDS_BOOLEAN (gvalue)) {\n g_value_set_boolean (gvalue, value->BooleanValue ());\n } else if (G_VALUE_HOLDS_INT (gvalue)) {\n g_value_set_int (gvalue, value->Int32Value ());\n } else if (G_VALUE_HOLDS_UINT (gvalue)) {\n g_value_set_uint (gvalue, value->Uint32Value ());\n } else if (G_VALUE_HOLDS_FLOAT (gvalue)) {\n g_value_set_float (gvalue, value->NumberValue ());\n } else if (G_VALUE_HOLDS_DOUBLE (gvalue)) {\n g_value_set_double (gvalue, value->NumberValue ());\n } else if (G_VALUE_HOLDS_STRING (gvalue)) {\n v8::String::Utf8Value str (value);\n const char *data = *str;\n g_value_set_string (gvalue, data);\n } else {\n g_assert_not_reached ();\n }\n}\n\n};\n<commit_msg>value: Add support for arrays<commit_after>\/*\n * Copyright (C) 2014 Endless Mobile\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but\n * WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA\n * 02111-1307, USA.\n *\n * Written by:\n * Jasper St. Pierre <jstpierre@mecheye.net>\n *\/\n\n#include \"value.h\"\n#include \"gobject.h\"\n\nnamespace GNodeJS {\n\nv8::Handle<v8::Value> GIArgumentToV8(GITypeInfo *type_info, GIArgument *arg) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_VOID:\n return v8::Undefined ();\n\n case GI_TYPE_TAG_BOOLEAN:\n if (arg->v_boolean)\n return v8::True ();\n else\n return v8::False ();\n\n case GI_TYPE_TAG_INT32:\n return v8::Integer::New (arg->v_int);\n case GI_TYPE_TAG_UINT32:\n return v8::Integer::NewFromUnsigned (arg->v_uint);\n case GI_TYPE_TAG_INT16:\n return v8::Integer::New (arg->v_int16);\n case GI_TYPE_TAG_UINT16:\n return v8::Integer::NewFromUnsigned (arg->v_uint16);\n case GI_TYPE_TAG_INT8:\n return v8::Integer::New (arg->v_int8);\n case GI_TYPE_TAG_UINT8:\n return v8::Integer::NewFromUnsigned (arg->v_uint8);\n case GI_TYPE_TAG_FLOAT:\n return v8::Number::New (arg->v_float);\n case GI_TYPE_TAG_DOUBLE:\n return v8::Number::New (arg->v_double);\n\n \/* For 64-bit integer types, use a float. When JS and V8 adopt\n * bigger sized integer types, start using those instead. *\/\n case GI_TYPE_TAG_INT64:\n return v8::Number::New (arg->v_int64);\n case GI_TYPE_TAG_UINT64:\n return v8::Number::New (arg->v_uint64);\n\n case GI_TYPE_TAG_UNICHAR:\n {\n char data[7];\n int size = g_unichar_to_utf8 (arg->v_uint32, data);\n return v8::String::New (data, size);\n }\n\n case GI_TYPE_TAG_UTF8:\n if (arg->v_pointer)\n return v8::String::New ((char *) arg->v_pointer);\n else\n return v8::Null ();\n\n case GI_TYPE_TAG_INTERFACE:\n {\n GIBaseInfo *interface_info = g_type_info_get_interface (type_info);\n GIInfoType interface_type = g_base_info_get_type (interface_info);\n\n switch (interface_type) {\n case GI_INFO_TYPE_OBJECT:\n return WrapperFromGObject ((GObject *) arg->v_pointer);\n default:\n g_assert_not_reached ();\n }\n }\n break;\n\n default:\n g_assert_not_reached ();\n }\n}\n\nstatic GArray * V8ToGArray(GITypeInfo *type_info, v8::Handle<v8::Value> value) {\n if (!value->IsArray ()) {\n ThrowException (v8::Exception::TypeError (v8::String::New (\"Not an array.\")));\n return NULL;\n }\n\n v8::Local<v8::Array> array = v8::Local<v8::Array>::Cast (value->ToObject ());\n GITypeInfo *elem_info = g_type_info_get_param_type (type_info, 0);\n\n int length = array->Length ();\n GArray *garray = g_array_sized_new (TRUE, FALSE, sizeof (GIArgument), length);\n for (int i = 0; i < length; i++) {\n v8::Local<v8::Value> value = array->Get (i);\n GIArgument arg;\n\n V8ToGIArgument (elem_info, &arg, value);\n g_array_append_val (garray, arg);\n }\n\n g_base_info_unref ((GIBaseInfo *) elem_info);\n return garray;\n}\n\nvoid V8ToGIArgument(GITypeInfo *type_info, GIArgument *arg, v8::Handle<v8::Value> value) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_VOID:\n arg->v_pointer = NULL;\n break;\n case GI_TYPE_TAG_BOOLEAN:\n arg->v_boolean = value->BooleanValue ();\n break;\n case GI_TYPE_TAG_INT32:\n arg->v_int = value->Int32Value ();\n break;\n case GI_TYPE_TAG_UINT32:\n arg->v_uint = value->Uint32Value ();\n break;\n case GI_TYPE_TAG_INT64:\n arg->v_int64 = value->NumberValue ();\n break;\n case GI_TYPE_TAG_UINT64:\n arg->v_uint64 = value->NumberValue ();\n break;\n case GI_TYPE_TAG_FLOAT:\n arg->v_float = value->NumberValue ();\n break;\n case GI_TYPE_TAG_DOUBLE:\n arg->v_double = value->NumberValue ();\n break;\n\n case GI_TYPE_TAG_UTF8:\n {\n v8::String::Utf8Value str (value);\n const char *data = *str;\n arg->v_pointer = g_strdup (data);\n }\n break;\n\n case GI_TYPE_TAG_INTERFACE:\n {\n GIBaseInfo *interface_info = g_type_info_get_interface (type_info);\n GIInfoType interface_type = g_base_info_get_type (interface_info);\n\n switch (interface_type) {\n case GI_INFO_TYPE_OBJECT:\n arg->v_pointer = GObjectFromWrapper (value);\n break;\n default:\n g_assert_not_reached ();\n }\n\n g_base_info_unref (interface_info);\n }\n break;\n\n case GI_TYPE_TAG_ARRAY:\n {\n GIArrayType array_type = g_type_info_get_array_type (type_info);\n GArray *garray = V8ToGArray (type_info, value);\n\n switch (array_type) {\n case GI_ARRAY_TYPE_C:\n arg->v_pointer = g_array_free (garray, FALSE);\n break;\n case GI_ARRAY_TYPE_ARRAY:\n arg->v_pointer = garray;\n break;\n default:\n g_assert_not_reached ();\n }\n }\n break;\n\n default:\n g_assert_not_reached ();\n }\n}\n\nvoid FreeGIArgument(GITypeInfo *type_info, GIArgument *arg) {\n GITypeTag type_tag = g_type_info_get_tag (type_info);\n\n switch (type_tag) {\n case GI_TYPE_TAG_UTF8:\n g_free (arg->v_pointer);\n break;\n\n case GI_TYPE_TAG_ARRAY:\n {\n GIArrayType array_type = g_type_info_get_array_type (type_info);\n\n switch (array_type) {\n case GI_ARRAY_TYPE_C:\n g_free (arg->v_pointer);\n break;\n case GI_ARRAY_TYPE_ARRAY:\n g_array_free ((GArray *) arg->v_pointer, TRUE);\n break;\n default:\n g_assert_not_reached ();\n }\n }\n break;\n default:\n break;\n }\n}\n\nvoid V8ToGValue(GValue *gvalue, v8::Handle<v8::Value> value) {\n if (G_VALUE_HOLDS_BOOLEAN (gvalue)) {\n g_value_set_boolean (gvalue, value->BooleanValue ());\n } else if (G_VALUE_HOLDS_INT (gvalue)) {\n g_value_set_int (gvalue, value->Int32Value ());\n } else if (G_VALUE_HOLDS_UINT (gvalue)) {\n g_value_set_uint (gvalue, value->Uint32Value ());\n } else if (G_VALUE_HOLDS_FLOAT (gvalue)) {\n g_value_set_float (gvalue, value->NumberValue ());\n } else if (G_VALUE_HOLDS_DOUBLE (gvalue)) {\n g_value_set_double (gvalue, value->NumberValue ());\n } else if (G_VALUE_HOLDS_STRING (gvalue)) {\n v8::String::Utf8Value str (value);\n const char *data = *str;\n g_value_set_string (gvalue, data);\n } else {\n g_assert_not_reached ();\n }\n}\n\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/===- InputFiles.cpp -----------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Linker\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"InputFiles.h\"\n#include \"InputSection.h\"\n#include \"Error.h\"\n#include \"Symbols.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\n\nusing namespace lld;\nusing namespace lld::elf2;\n\ntemplate <class ELFT> static uint16_t getEMachine(const ELFFileBase &B) {\n bool IsShared = isa<SharedFileBase>(B);\n if (IsShared)\n return cast<SharedFile<ELFT>>(B).getEMachine();\n return cast<ObjectFile<ELFT>>(B).getEMachine();\n}\n\nuint16_t ELFFileBase::getEMachine() const {\n switch (EKind) {\n case ELF32BEKind:\n return ::getEMachine<ELF32BE>(*this);\n case ELF32LEKind:\n return ::getEMachine<ELF32LE>(*this);\n case ELF64BEKind:\n return ::getEMachine<ELF64BE>(*this);\n case ELF64LEKind:\n return ::getEMachine<ELF64LE>(*this);\n }\n llvm_unreachable(\"Invalid kind\");\n}\n\nbool ELFFileBase::isCompatibleWith(const ELFFileBase &Other) const {\n return getELFKind() == Other.getELFKind() &&\n getEMachine() == Other.getEMachine();\n}\n\nnamespace {\nclass ECRAII {\n std::error_code EC;\n\npublic:\n std::error_code &getEC() { return EC; }\n ~ECRAII() { error(EC); }\n};\n}\n\ntemplate <class ELFT>\nELFData<ELFT>::ELFData(MemoryBufferRef MB)\n : ELFObj(MB.getBuffer(), ECRAII().getEC()) {}\n\ntemplate <class ELFT>\ntypename ELFData<ELFT>::Elf_Sym_Range\nELFData<ELFT>::getSymbolsHelper(bool Local) {\n if (!Symtab)\n return Elf_Sym_Range(nullptr, nullptr);\n Elf_Sym_Range Syms = ELFObj.symbols(Symtab);\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n uint32_t FirstNonLocal = Symtab->sh_info;\n if (FirstNonLocal > NumSymbols)\n error(\"Invalid sh_info in symbol table\");\n if (!Local)\n return llvm::make_range(Syms.begin() + FirstNonLocal, Syms.end());\n else\n \/\/ Skip over dummy symbol.\n return llvm::make_range(Syms.begin() + 1, Syms.begin() + FirstNonLocal);\n}\n\ntemplate <class ELFT>\ntypename ELFData<ELFT>::Elf_Sym_Range ELFData<ELFT>::getNonLocalSymbols() {\n if (!Symtab)\n return Elf_Sym_Range(nullptr, nullptr);\n ErrorOr<StringRef> StringTableOrErr = ELFObj.getStringTableForSymtab(*Symtab);\n error(StringTableOrErr.getError());\n StringTable = *StringTableOrErr;\n return getSymbolsHelper(false);\n}\n\ntemplate <class ELFT>\nObjectFile<ELFT>::ObjectFile(MemoryBufferRef M)\n : ObjectFileBase(getStaticELFKind<ELFT>(), M), ELFData<ELFT>(M) {}\n\ntemplate <class ELFT>\ntypename ObjectFile<ELFT>::Elf_Sym_Range ObjectFile<ELFT>::getLocalSymbols() {\n return this->getSymbolsHelper(true);\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::parse() {\n \/\/ Read section and symbol tables.\n initializeSections();\n initializeSymbols();\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::initializeSections() {\n uint64_t Size = this->ELFObj.getNumSections();\n Sections.resize(Size);\n unsigned I = 0;\n for (const Elf_Shdr &Sec : this->ELFObj.sections()) {\n switch (Sec.sh_type) {\n case SHT_SYMTAB:\n this->Symtab = &Sec;\n break;\n case SHT_SYMTAB_SHNDX: {\n ErrorOr<ArrayRef<Elf_Word>> ErrorOrTable =\n this->ELFObj.getSHNDXTable(Sec);\n error(ErrorOrTable);\n SymtabSHNDX = *ErrorOrTable;\n break;\n }\n case SHT_STRTAB:\n case SHT_NULL:\n break;\n case SHT_RELA:\n case SHT_REL: {\n uint32_t RelocatedSectionIndex = Sec.sh_info;\n if (RelocatedSectionIndex >= Size)\n error(\"Invalid relocated section index\");\n InputSection<ELFT> *RelocatedSection = Sections[RelocatedSectionIndex];\n if (!RelocatedSection)\n error(\"Unsupported relocation reference\");\n RelocatedSection->RelocSections.push_back(&Sec);\n break;\n }\n default:\n Sections[I] = new (Alloc) InputSection<ELFT>(this, &Sec);\n break;\n }\n ++I;\n }\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::initializeSymbols() {\n Elf_Sym_Range Syms = this->getNonLocalSymbols();\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n SymbolBodies.reserve(NumSymbols);\n for (const Elf_Sym &Sym : Syms)\n SymbolBodies.push_back(createSymbolBody(this->StringTable, &Sym));\n}\n\ntemplate <class ELFT>\nSymbolBody *elf2::ObjectFile<ELFT>::createSymbolBody(StringRef StringTable,\n const Elf_Sym *Sym) {\n ErrorOr<StringRef> NameOrErr = Sym->getName(StringTable);\n error(NameOrErr.getError());\n StringRef Name = *NameOrErr;\n\n uint32_t SecIndex = Sym->st_shndx;\n switch (SecIndex) {\n case SHN_ABS:\n return new (Alloc) DefinedAbsolute<ELFT>(Name, *Sym);\n case SHN_UNDEF:\n return new (Alloc) Undefined<ELFT>(Name, *Sym);\n case SHN_COMMON:\n return new (Alloc) DefinedCommon<ELFT>(Name, *Sym);\n case SHN_XINDEX:\n SecIndex = this->ELFObj.getExtendedSymbolTableIndex(Sym, this->Symtab,\n SymtabSHNDX);\n break;\n }\n\n if (SecIndex >= Sections.size() || (SecIndex != 0 && !Sections[SecIndex]))\n error(\"Invalid section index\");\n\n switch (Sym->getBinding()) {\n default:\n error(\"unexpected binding\");\n case STB_GLOBAL:\n case STB_WEAK:\n return new (Alloc) DefinedRegular<ELFT>(Name, *Sym, *Sections[SecIndex]);\n }\n}\n\nvoid ArchiveFile::parse() {\n auto ArchiveOrErr = Archive::create(MB);\n error(ArchiveOrErr, \"Failed to parse archive\");\n File = std::move(*ArchiveOrErr);\n\n \/\/ Allocate a buffer for Lazy objects.\n size_t NumSyms = File->getNumberOfSymbols();\n LazySymbols.reserve(NumSyms);\n\n \/\/ Read the symbol table to construct Lazy objects.\n for (const Archive::Symbol &Sym : File->symbols())\n LazySymbols.emplace_back(this, Sym);\n}\n\n\/\/ Returns a buffer pointing to a member file containing a given symbol.\nMemoryBufferRef ArchiveFile::getMember(const Archive::Symbol *Sym) {\n ErrorOr<Archive::child_iterator> ItOrErr = Sym->getMember();\n error(ItOrErr,\n Twine(\"Could not get the member for symbol \") + Sym->getName());\n Archive::child_iterator It = *ItOrErr;\n\n if (!Seen.insert(It->getChildOffset()).second)\n return MemoryBufferRef();\n\n ErrorOr<MemoryBufferRef> Ret = It->getMemoryBufferRef();\n error(Ret, Twine(\"Could not get the buffer for the member defining symbol \") +\n Sym->getName());\n return *Ret;\n}\n\ntemplate <class ELFT>\nSharedFile<ELFT>::SharedFile(MemoryBufferRef M)\n : SharedFileBase(getStaticELFKind<ELFT>(), M), ELFData<ELFT>(M) {}\n\ntemplate <class ELFT> void SharedFile<ELFT>::parse() {\n for (const Elf_Shdr &Sec : this->ELFObj.sections()) {\n if (Sec.sh_type == SHT_DYNSYM) {\n this->Symtab = &Sec;\n break;\n }\n }\n\n Elf_Sym_Range Syms = this->getNonLocalSymbols();\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n SymbolBodies.reserve(NumSymbols);\n for (const Elf_Sym &Sym : Syms) {\n if (Sym.isUndefined())\n continue;\n\n ErrorOr<StringRef> NameOrErr = Sym.getName(this->StringTable);\n error(NameOrErr.getError());\n StringRef Name = *NameOrErr;\n\n SymbolBodies.emplace_back(Name, Sym);\n }\n}\n\nnamespace lld {\nnamespace elf2 {\n\ntemplate class elf2::ObjectFile<llvm::object::ELF32LE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF32BE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF64LE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF64BE>;\n\ntemplate class elf2::SharedFile<llvm::object::ELF32LE>;\ntemplate class elf2::SharedFile<llvm::object::ELF32BE>;\ntemplate class elf2::SharedFile<llvm::object::ELF64LE>;\ntemplate class elf2::SharedFile<llvm::object::ELF64BE>;\n}\n}\n<commit_msg>Remove `else` after `return`.<commit_after>\/\/===- InputFiles.cpp -----------------------------------------------------===\/\/\n\/\/\n\/\/ The LLVM Linker\n\/\/\n\/\/ This file is distributed under the University of Illinois Open Source\n\/\/ License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"InputFiles.h\"\n#include \"InputSection.h\"\n#include \"Error.h\"\n#include \"Symbols.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\n\nusing namespace llvm;\nusing namespace llvm::ELF;\nusing namespace llvm::object;\n\nusing namespace lld;\nusing namespace lld::elf2;\n\ntemplate <class ELFT> static uint16_t getEMachine(const ELFFileBase &B) {\n bool IsShared = isa<SharedFileBase>(B);\n if (IsShared)\n return cast<SharedFile<ELFT>>(B).getEMachine();\n return cast<ObjectFile<ELFT>>(B).getEMachine();\n}\n\nuint16_t ELFFileBase::getEMachine() const {\n switch (EKind) {\n case ELF32BEKind:\n return ::getEMachine<ELF32BE>(*this);\n case ELF32LEKind:\n return ::getEMachine<ELF32LE>(*this);\n case ELF64BEKind:\n return ::getEMachine<ELF64BE>(*this);\n case ELF64LEKind:\n return ::getEMachine<ELF64LE>(*this);\n }\n llvm_unreachable(\"Invalid kind\");\n}\n\nbool ELFFileBase::isCompatibleWith(const ELFFileBase &Other) const {\n return getELFKind() == Other.getELFKind() &&\n getEMachine() == Other.getEMachine();\n}\n\nnamespace {\nclass ECRAII {\n std::error_code EC;\n\npublic:\n std::error_code &getEC() { return EC; }\n ~ECRAII() { error(EC); }\n};\n}\n\ntemplate <class ELFT>\nELFData<ELFT>::ELFData(MemoryBufferRef MB)\n : ELFObj(MB.getBuffer(), ECRAII().getEC()) {}\n\ntemplate <class ELFT>\ntypename ELFData<ELFT>::Elf_Sym_Range\nELFData<ELFT>::getSymbolsHelper(bool Local) {\n if (!Symtab)\n return Elf_Sym_Range(nullptr, nullptr);\n Elf_Sym_Range Syms = ELFObj.symbols(Symtab);\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n uint32_t FirstNonLocal = Symtab->sh_info;\n if (FirstNonLocal > NumSymbols)\n error(\"Invalid sh_info in symbol table\");\n if (!Local)\n return make_range(Syms.begin() + FirstNonLocal, Syms.end());\n \/\/ +1 to skip over dummy symbol.\n return make_range(Syms.begin() + 1, Syms.begin() + FirstNonLocal);\n}\n\ntemplate <class ELFT>\ntypename ELFData<ELFT>::Elf_Sym_Range ELFData<ELFT>::getNonLocalSymbols() {\n if (!Symtab)\n return Elf_Sym_Range(nullptr, nullptr);\n ErrorOr<StringRef> StringTableOrErr = ELFObj.getStringTableForSymtab(*Symtab);\n error(StringTableOrErr.getError());\n StringTable = *StringTableOrErr;\n return getSymbolsHelper(false);\n}\n\ntemplate <class ELFT>\nObjectFile<ELFT>::ObjectFile(MemoryBufferRef M)\n : ObjectFileBase(getStaticELFKind<ELFT>(), M), ELFData<ELFT>(M) {}\n\ntemplate <class ELFT>\ntypename ObjectFile<ELFT>::Elf_Sym_Range ObjectFile<ELFT>::getLocalSymbols() {\n return this->getSymbolsHelper(true);\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::parse() {\n \/\/ Read section and symbol tables.\n initializeSections();\n initializeSymbols();\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::initializeSections() {\n uint64_t Size = this->ELFObj.getNumSections();\n Sections.resize(Size);\n unsigned I = 0;\n for (const Elf_Shdr &Sec : this->ELFObj.sections()) {\n switch (Sec.sh_type) {\n case SHT_SYMTAB:\n this->Symtab = &Sec;\n break;\n case SHT_SYMTAB_SHNDX: {\n ErrorOr<ArrayRef<Elf_Word>> ErrorOrTable =\n this->ELFObj.getSHNDXTable(Sec);\n error(ErrorOrTable);\n SymtabSHNDX = *ErrorOrTable;\n break;\n }\n case SHT_STRTAB:\n case SHT_NULL:\n break;\n case SHT_RELA:\n case SHT_REL: {\n uint32_t RelocatedSectionIndex = Sec.sh_info;\n if (RelocatedSectionIndex >= Size)\n error(\"Invalid relocated section index\");\n InputSection<ELFT> *RelocatedSection = Sections[RelocatedSectionIndex];\n if (!RelocatedSection)\n error(\"Unsupported relocation reference\");\n RelocatedSection->RelocSections.push_back(&Sec);\n break;\n }\n default:\n Sections[I] = new (Alloc) InputSection<ELFT>(this, &Sec);\n break;\n }\n ++I;\n }\n}\n\ntemplate <class ELFT> void elf2::ObjectFile<ELFT>::initializeSymbols() {\n Elf_Sym_Range Syms = this->getNonLocalSymbols();\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n SymbolBodies.reserve(NumSymbols);\n for (const Elf_Sym &Sym : Syms)\n SymbolBodies.push_back(createSymbolBody(this->StringTable, &Sym));\n}\n\ntemplate <class ELFT>\nSymbolBody *elf2::ObjectFile<ELFT>::createSymbolBody(StringRef StringTable,\n const Elf_Sym *Sym) {\n ErrorOr<StringRef> NameOrErr = Sym->getName(StringTable);\n error(NameOrErr.getError());\n StringRef Name = *NameOrErr;\n\n uint32_t SecIndex = Sym->st_shndx;\n switch (SecIndex) {\n case SHN_ABS:\n return new (Alloc) DefinedAbsolute<ELFT>(Name, *Sym);\n case SHN_UNDEF:\n return new (Alloc) Undefined<ELFT>(Name, *Sym);\n case SHN_COMMON:\n return new (Alloc) DefinedCommon<ELFT>(Name, *Sym);\n case SHN_XINDEX:\n SecIndex = this->ELFObj.getExtendedSymbolTableIndex(Sym, this->Symtab,\n SymtabSHNDX);\n break;\n }\n\n if (SecIndex >= Sections.size() || (SecIndex != 0 && !Sections[SecIndex]))\n error(\"Invalid section index\");\n\n switch (Sym->getBinding()) {\n default:\n error(\"unexpected binding\");\n case STB_GLOBAL:\n case STB_WEAK:\n return new (Alloc) DefinedRegular<ELFT>(Name, *Sym, *Sections[SecIndex]);\n }\n}\n\nvoid ArchiveFile::parse() {\n auto ArchiveOrErr = Archive::create(MB);\n error(ArchiveOrErr, \"Failed to parse archive\");\n File = std::move(*ArchiveOrErr);\n\n \/\/ Allocate a buffer for Lazy objects.\n size_t NumSyms = File->getNumberOfSymbols();\n LazySymbols.reserve(NumSyms);\n\n \/\/ Read the symbol table to construct Lazy objects.\n for (const Archive::Symbol &Sym : File->symbols())\n LazySymbols.emplace_back(this, Sym);\n}\n\n\/\/ Returns a buffer pointing to a member file containing a given symbol.\nMemoryBufferRef ArchiveFile::getMember(const Archive::Symbol *Sym) {\n ErrorOr<Archive::child_iterator> ItOrErr = Sym->getMember();\n error(ItOrErr,\n Twine(\"Could not get the member for symbol \") + Sym->getName());\n Archive::child_iterator It = *ItOrErr;\n\n if (!Seen.insert(It->getChildOffset()).second)\n return MemoryBufferRef();\n\n ErrorOr<MemoryBufferRef> Ret = It->getMemoryBufferRef();\n error(Ret, Twine(\"Could not get the buffer for the member defining symbol \") +\n Sym->getName());\n return *Ret;\n}\n\ntemplate <class ELFT>\nSharedFile<ELFT>::SharedFile(MemoryBufferRef M)\n : SharedFileBase(getStaticELFKind<ELFT>(), M), ELFData<ELFT>(M) {}\n\ntemplate <class ELFT> void SharedFile<ELFT>::parse() {\n for (const Elf_Shdr &Sec : this->ELFObj.sections()) {\n if (Sec.sh_type == SHT_DYNSYM) {\n this->Symtab = &Sec;\n break;\n }\n }\n\n Elf_Sym_Range Syms = this->getNonLocalSymbols();\n uint32_t NumSymbols = std::distance(Syms.begin(), Syms.end());\n SymbolBodies.reserve(NumSymbols);\n for (const Elf_Sym &Sym : Syms) {\n if (Sym.isUndefined())\n continue;\n\n ErrorOr<StringRef> NameOrErr = Sym.getName(this->StringTable);\n error(NameOrErr.getError());\n StringRef Name = *NameOrErr;\n\n SymbolBodies.emplace_back(Name, Sym);\n }\n}\n\nnamespace lld {\nnamespace elf2 {\n\ntemplate class elf2::ObjectFile<llvm::object::ELF32LE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF32BE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF64LE>;\ntemplate class elf2::ObjectFile<llvm::object::ELF64BE>;\n\ntemplate class elf2::SharedFile<llvm::object::ELF32LE>;\ntemplate class elf2::SharedFile<llvm::object::ELF32BE>;\ntemplate class elf2::SharedFile<llvm::object::ELF64LE>;\ntemplate class elf2::SharedFile<llvm::object::ELF64BE>;\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright 2008 Brain Research Institute, Melbourne, Australia\n\n Written by J-Donald Tournier, 27\/06\/08.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"command.h\"\n#include \"progressbar.h\"\n#include \"math\/vector.h\"\n#include \"math\/matrix.h\"\n#include \"math\/rng.h\"\n#include \"point.h\"\n#include \"dwi\/directions\/file.h\"\n#include \"file\/ofstream.h\"\n\n#include <array>\n#include <random>\n#include <algorithm>\n\nusing namespace MR;\nusing namespace App;\n\nvoid usage () {\n\nDESCRIPTION\n + \"splice or merge sets of directions over multiple shells into a single set, \"\n \"in such a way as to maintain near-optimality upon truncation.\";\n\nARGUMENTS\n + Argument (\"subsets\", \"the number of subsets (phase-encode directions) per b-value\").type_integer(1,4,10000)\n + Argument (\"bvalue files\", \"the b-value and sets of corresponding files, in order\").type_text().allow_multiple()\n + Argument (\"out\", \"the output directions file, with each row listing \"\n \"the X Y Z gradient directions, the b-value, and an index representing \"\n \"the phase encode direction\").type_file_out();\n}\n\n\ntypedef double value_type;\ntypedef std::array<value_type,3> Direction;\ntypedef std::vector<Direction> DirectionSet;\n\nstruct OutDir {\n Direction d;\n size_t b;\n size_t pe;\n};\n\ninline std::ostream& operator<< (std::ostream& stream, const OutDir& d) {\n stream << \"[ \" << d.d << \"], \" << d.b << \", \" << d.pe << \" ]\";\n return stream;\n}\n\n\nvoid run () \n{\n size_t num_subsets = argument[0];\n\n\n std::vector<std::vector<DirectionSet>> dirs;\n std::vector<value_type> bvalue ((argument.size() - 2) \/ (1+num_subsets));\n INFO (\"expecting \" + str(bvalue.size()) + \" b-values\");\n if (bvalue.size()*(1+num_subsets) + 2 != argument.size())\n throw Exception (\"inconsistent number of arguments\");\n\n\n \/\/ read them in:\n size_t current = 1, nb = 0;\n while (current < argument.size()-1) {\n bvalue[nb] = to<value_type> (argument[current++]);\n std::vector<DirectionSet> d;\n for (size_t i = 0; i < num_subsets; ++i) {\n auto m = DWI::Directions::load_cartesian<value_type> (argument[current++]);\n DirectionSet set;\n for (size_t r = 0; r < m.rows(); ++r)\n set.push_back ({ { m(r,0), m(r,1), m(r,2) } });\n d.push_back (set);\n }\n INFO (\"found b = \" + str(bvalue[nb]) + \", \" + \n str ([&]{ std::vector<size_t> s; for (auto& n : d) s.push_back (n.size()); return s; }()) + \" volumes\");\n\n dirs.push_back (d);\n ++nb;\n }\n\n size_t total = [&]{ size_t n = 0; for (auto& d : dirs) for (auto& m : d) n += m.size(); return n; }();\n INFO (\"found total of \" + str(total) + \" volumes\") ;\n\n\n \/\/ pick random direction from first direction set:\n std::random_device rd;\n std::mt19937 rng (rd());\n size_t first = std::uniform_int_distribution<size_t> (0, dirs[0][0].size()-1)(rng);\n\n \n std::vector<OutDir> merged;\n\n auto push = [&](size_t b, size_t p, size_t n) \n { \n merged.push_back ({ { { dirs[b][p][n][0], dirs[b][p][n][1], dirs[b][p][n][2] } }, b, p }); \n dirs[b][p].erase (dirs[b][p].begin()+n); \n };\n\n auto energy_pair = [](const Direction& a, const Direction& b) \n {\n \/\/ use combination of mono- and bi-polar electrostatic repulsion models \n \/\/ to ensure adequate coverage of eddy-current space as well as \n \/\/ orientation space. Use a moderate bias, favouring the bipolar model.\n return 1.2 \/ (\n Math::pow2 (b[0] - a[0]) + \n Math::pow2 (b[1] - a[1]) + \n Math::pow2 (b[2] - a[2]) \n ) + 1.0 \/ (\n Math::pow2 (b[0] + a[0]) + \n Math::pow2 (b[1] + a[1]) + \n Math::pow2 (b[2] + a[2]) \n );\n };\n\n auto energy = [&](size_t b, size_t p, size_t n) \n { \n value_type E = 0.0;\n for (auto& d : merged) \n if (d.b == b) \n E += energy_pair (d.d, dirs[b][p][n]);\n return E;\n };\n\n auto find_lowest_energy_direction = [&](size_t b, size_t p)\n {\n size_t best = 0;\n value_type bestE = std::numeric_limits<value_type>::max();\n for (size_t n = 0; n < dirs[b][p].size(); ++n) {\n value_type E = energy (b, p, n);\n if (E < bestE) {\n bestE = E;\n best = n;\n }\n }\n return best;\n };\n\n\n\n std::vector<float> fraction;\n for (auto& d : dirs) {\n size_t n = 0;\n for (auto& m : d)\n n += m.size();\n fraction.push_back (float (n) \/ float (total));\n };\n\n push (0, 0, first);\n\n std::vector<size_t> counts (bvalue.size(), 0);\n ++counts[0];\n\n auto num_for_b = [&](size_t b) {\n size_t n = 0;\n for (auto& d : merged)\n if (d.b == b)\n ++n;\n return n;\n };\n\n\n\n size_t nPE = num_subsets > 1 ? 1 : 0;\n while (merged.size() < total) { \n \/\/ find shell with shortfall in numbers:\n size_t b = 0, n;\n value_type fraction_diff = std::numeric_limits<value_type>::max();\n for (n = 0; n < bvalue.size(); ++n) {\n value_type f_diff = float(num_for_b(n)) \/ float (merged.size()) - fraction[n];\n if (f_diff < fraction_diff && dirs[n][nPE].size()) {\n fraction_diff = f_diff;\n b = n;\n }\n }\n\n \/\/ find most distant direction for that shell & in the current PE direction:\n n = find_lowest_energy_direction (b, nPE);\n if (dirs[b][nPE].size()) \n push (b, nPE, n);\n\n \/\/ update PE direction\n ++nPE;\n if (nPE >= num_subsets)\n nPE = 0;\n }\n\n\n\n\n\n \/\/ write-out:\n \n File::OFStream out (argument[argument.size()-1]);\n for (auto& d : merged) \n out << MR::printf (\"%#10f %#10f %#10f %5d %3d\\n\", \n float (d.d[0]), float (d.d[1]), float (d.d[2]), \n int (bvalue[d.b]), int (d.pe+1));\n\n}\n\n\n\n<commit_msg>dirmerge: add warning if merging cannot be done as expected<commit_after>\/*\n Copyright 2008 Brain Research Institute, Melbourne, Australia\n\n Written by J-Donald Tournier, 27\/06\/08.\n\n This file is part of MRtrix.\n\n MRtrix is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n MRtrix is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with MRtrix. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n*\/\n\n#include \"command.h\"\n#include \"progressbar.h\"\n#include \"math\/vector.h\"\n#include \"math\/matrix.h\"\n#include \"math\/rng.h\"\n#include \"point.h\"\n#include \"dwi\/directions\/file.h\"\n#include \"file\/ofstream.h\"\n\n#include <array>\n#include <random>\n#include <algorithm>\n\nusing namespace MR;\nusing namespace App;\n\nvoid usage () {\n\nDESCRIPTION\n + \"splice or merge sets of directions over multiple shells into a single set, \"\n \"in such a way as to maintain near-optimality upon truncation.\";\n\nARGUMENTS\n + Argument (\"subsets\", \"the number of subsets (phase-encode directions) per b-value\").type_integer(1,4,10000)\n + Argument (\"bvalue files\", \"the b-value and sets of corresponding files, in order\").type_text().allow_multiple()\n + Argument (\"out\", \"the output directions file, with each row listing \"\n \"the X Y Z gradient directions, the b-value, and an index representing \"\n \"the phase encode direction\").type_file_out();\n}\n\n\ntypedef double value_type;\ntypedef std::array<value_type,3> Direction;\ntypedef std::vector<Direction> DirectionSet;\n\nstruct OutDir {\n Direction d;\n size_t b;\n size_t pe;\n};\n\ninline std::ostream& operator<< (std::ostream& stream, const OutDir& d) {\n stream << \"[ \" << d.d << \"], \" << d.b << \", \" << d.pe << \" ]\";\n return stream;\n}\n\n\nvoid run () \n{\n size_t num_subsets = argument[0];\n\n\n std::vector<std::vector<DirectionSet>> dirs;\n std::vector<value_type> bvalue ((argument.size() - 2) \/ (1+num_subsets));\n INFO (\"expecting \" + str(bvalue.size()) + \" b-values\");\n if (bvalue.size()*(1+num_subsets) + 2 != argument.size())\n throw Exception (\"inconsistent number of arguments\");\n\n\n \/\/ read them in:\n size_t current = 1, nb = 0;\n while (current < argument.size()-1) {\n bvalue[nb] = to<value_type> (argument[current++]);\n std::vector<DirectionSet> d;\n for (size_t i = 0; i < num_subsets; ++i) {\n auto m = DWI::Directions::load_cartesian<value_type> (argument[current++]);\n DirectionSet set;\n for (size_t r = 0; r < m.rows(); ++r)\n set.push_back ({ { m(r,0), m(r,1), m(r,2) } });\n d.push_back (set);\n }\n INFO (\"found b = \" + str(bvalue[nb]) + \", \" + \n str ([&]{ std::vector<size_t> s; for (auto& n : d) s.push_back (n.size()); return s; }()) + \" volumes\");\n\n dirs.push_back (d);\n ++nb;\n }\n\n size_t total = [&]{ size_t n = 0; for (auto& d : dirs) for (auto& m : d) n += m.size(); return n; }();\n INFO (\"found total of \" + str(total) + \" volumes\") ;\n\n\n \/\/ pick random direction from first direction set:\n std::random_device rd;\n std::mt19937 rng (rd());\n size_t first = std::uniform_int_distribution<size_t> (0, dirs[0][0].size()-1)(rng);\n\n \n std::vector<OutDir> merged;\n\n auto push = [&](size_t b, size_t p, size_t n) \n { \n merged.push_back ({ { { dirs[b][p][n][0], dirs[b][p][n][1], dirs[b][p][n][2] } }, b, p }); \n dirs[b][p].erase (dirs[b][p].begin()+n); \n };\n\n auto energy_pair = [](const Direction& a, const Direction& b) \n {\n \/\/ use combination of mono- and bi-polar electrostatic repulsion models \n \/\/ to ensure adequate coverage of eddy-current space as well as \n \/\/ orientation space. Use a moderate bias, favouring the bipolar model.\n return 1.2 \/ (\n Math::pow2 (b[0] - a[0]) + \n Math::pow2 (b[1] - a[1]) + \n Math::pow2 (b[2] - a[2]) \n ) + 1.0 \/ (\n Math::pow2 (b[0] + a[0]) + \n Math::pow2 (b[1] + a[1]) + \n Math::pow2 (b[2] + a[2]) \n );\n };\n\n auto energy = [&](size_t b, size_t p, size_t n) \n { \n value_type E = 0.0;\n for (auto& d : merged) \n if (d.b == b) \n E += energy_pair (d.d, dirs[b][p][n]);\n return E;\n };\n\n auto find_lowest_energy_direction = [&](size_t b, size_t p)\n {\n size_t best = 0;\n value_type bestE = std::numeric_limits<value_type>::max();\n for (size_t n = 0; n < dirs[b][p].size(); ++n) {\n value_type E = energy (b, p, n);\n if (E < bestE) {\n bestE = E;\n best = n;\n }\n }\n return best;\n };\n\n\n\n std::vector<float> fraction;\n for (auto& d : dirs) {\n size_t n = 0;\n for (auto& m : d)\n n += m.size();\n fraction.push_back (float (n) \/ float (total));\n };\n\n push (0, 0, first);\n\n std::vector<size_t> counts (bvalue.size(), 0);\n ++counts[0];\n\n auto num_for_b = [&](size_t b) {\n size_t n = 0;\n for (auto& d : merged)\n if (d.b == b)\n ++n;\n return n;\n };\n\n\n\n size_t nPE = num_subsets > 1 ? 1 : 0;\n while (merged.size() < total) { \n \/\/ find shell with shortfall in numbers:\n size_t b = 0, n;\n value_type fraction_diff = std::numeric_limits<value_type>::max();\n for (n = 0; n < bvalue.size(); ++n) {\n value_type f_diff = float(num_for_b(n)) \/ float (merged.size()) - fraction[n];\n if (f_diff < fraction_diff && dirs[n][nPE].size()) {\n fraction_diff = f_diff;\n b = n;\n }\n }\n\n \/\/ find most distant direction for that shell & in the current PE direction:\n n = find_lowest_energy_direction (b, nPE);\n if (dirs[b][nPE].size()) \n push (b, nPE, n);\n else \n WARN (\"no directions remaining in b=\" + str (bvalue[b]) + \" shell for PE direction \" + str(n) + \" - PE directions will not cycle through perfectly\");\n\n \/\/ update PE direction\n ++nPE;\n if (nPE >= num_subsets)\n nPE = 0;\n }\n\n\n\n\n\n \/\/ write-out:\n \n File::OFStream out (argument[argument.size()-1]);\n for (auto& d : merged) \n out << MR::printf (\"%#10f %#10f %#10f %5d %3d\\n\", \n float (d.d[0]), float (d.d[1]), float (d.d[2]), \n int (bvalue[d.b]), int (d.pe+1));\n\n}\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/*\n$Log$\nRevision 1.4 2001\/11\/27 13:13:07 morsch\nMaximum lifetime for long-lived particles to be put on the stack is parameter.\nIt can be set via SetMaximumLifetime(..).\n\nRevision 1.3 2001\/10\/16 08:48:56 morsch\nCommon vertex related code moved to base class AliGenerator.\n\nRevision 1.2 2001\/10\/15 08:15:51 morsch\nEvent vertex and vertex truncation setting moved into AliMC.\n\nRevision 1.1 2001\/07\/13 10:56:00 morsch\nAliGenMC base class for AliGenParam and AliGenPythia commonalities.\n\n*\/\n\n#include \"AliGenMC.h\"\n#include \"AliPDG.h\"\n#include <TParticle.h>\n\n ClassImp(AliGenMC)\n\nAliGenMC::AliGenMC()\n :AliGenerator()\n{\n\/\/ Default Constructor\n SetCutOnChild();\n SetChildMomentumRange();\n SetChildPtRange();\n SetChildPhiRange();\n SetChildThetaRange(); \n SetChildYRange(); \n SetMaximumLifetime();\n}\n\nAliGenMC::AliGenMC(Int_t npart)\n :AliGenerator(npart)\n{\n\/\/ Constructor\n SetCutOnChild();\n SetChildMomentumRange();\n SetChildPtRange();\n SetChildPhiRange();\n SetChildThetaRange();\n SetChildYRange(); \n\/\/ \n fParentSelect.Set(8);\n fChildSelect.Set(8);\n for (Int_t i=0; i<8; i++) fParentSelect[i]=fChildSelect[i]=0;\n SetMaximumLifetime();\n}\n\nAliGenMC::AliGenMC(const AliGenMC & mc)\n{\n\/\/ copy constructor\n}\n\nAliGenMC::~AliGenMC()\n{\n\/\/ Destructor\n}\n\nvoid AliGenMC::Init()\n{\n\/\/\n\/\/ Initialization\n switch (fForceDecay) {\n case kSemiElectronic:\n case kDiElectron:\n case kBJpsiDiElectron:\n case kBPsiPrimeDiElectron:\n\tfChildSelect[0] = kElectron;\t\n\tbreak;\n case kSemiMuonic:\n case kDiMuon:\n case kBJpsiDiMuon:\n case kBPsiPrimeDiMuon:\n case kPiToMu:\n case kKaToMu:\n\tfChildSelect[0]=kMuonMinus;\n\tbreak;\n case kHadronicD:\n\tfChildSelect[0]=kPiPlus;\n\tfChildSelect[1]=kKPlus;\n\tbreak;\n case kAll:\n case kNoDecay:\n\tbreak;\n }\n}\n\n\nBool_t AliGenMC::ParentSelected(Int_t ip)\n{\n\/\/ True if particle is in list of parent particles to be selected\n for (Int_t i=0; i<8; i++)\n {\n\tif (fParentSelect[i]==ip) return kTRUE;\n }\n return kFALSE;\n}\n\nBool_t AliGenMC::ChildSelected(Int_t ip)\n{\n\/\/ True if particle is in list of decay products to be selected\n for (Int_t i=0; i<5; i++)\n {\n\tif (fChildSelect[i]==ip) return kTRUE;\n }\n return kFALSE;\n}\n\nBool_t AliGenMC::KinematicSelection(TParticle *particle, Int_t flag)\n{\n\/\/ Perform kinematic selection\n Float_t px = particle->Px();\n Float_t py = particle->Py();\n Float_t pz = particle->Pz();\n Float_t e = particle->Energy();\n Float_t pt = particle->Pt();\n Float_t p = particle->P();\n Float_t theta = particle->Theta();\n Float_t mass = particle->GetMass();\n Float_t mt2 = pt * pt + mass * mass;\n \n Float_t phi = Float_t(TMath::ATan2(Double_t(py),Double_t(px)));\n Double_t y, y0;\n\n if (TMath::Abs(pz) != e) {\n\ty = 0.5*TMath::Log((e+pz)\/(e-pz));\n } else {\n\ty = 1.e10;\n }\n \n if (mt2) {\n\ty0 = 0.5*TMath::Log((e+TMath::Abs(pz))*(e+TMath::Abs(pz))\/mt2);\n } else {\n\tif (TMath::Abs(y) < 1.e10) {\n\t y0 = y;\n\t} else {\n\t y0 = 1.e10;\n\t}\n }\n \n y = (pz < 0) ? -y0 : y0;\n \n if (flag == 0) {\n\/\/\n\/\/ Primary particle cuts\n\/\/\n\/\/ transverse momentum cut \n\tif (pt > fPtMax || pt < fPtMin) {\n\/\/\t printf(\"\\n failed pt cut %f %f %f \\n\",pt,fPtMin,fPtMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ momentum cut\n\tif (p > fPMax || p < fPMin) {\n\/\/\t printf(\"\\n failed p cut %f %f %f \\n\",p,fPMin,fPMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ theta cut\n\tif (theta > fThetaMax || theta < fThetaMin) {\n\/\/\t printf(\"\\n failed theta cut %f %f %f \\n\",theta,fThetaMin,fThetaMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ rapidity cut\n\tif (y > fYMax || y < fYMin) {\n\/\/\t printf(\"\\n failed y cut %f %f %f \\n\",y,fYMin,fYMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ phi cut\n\tif (phi > fPhiMax || phi < fPhiMin) {\n\/\/\t printf(\"\\n failed phi cut %f %f %f \\n\",phi,fPhiMin,fPhiMax);\n\t return kFALSE;\n\t}\n } else {\n\/\/\n\/\/ Decay product cuts\n\/\/\n\/\/ transverse momentum cut \n\tif (pt > fChildPtMax || pt < fChildPtMin) {\n\/\/\t printf(\"\\n failed pt cut %f %f %f \\n\",pt,fChildPtMin,fChildPtMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ momentum cut\n\tif (p > fChildPMax || p < fChildPMin) {\n\/\/\t printf(\"\\n failed p cut %f %f %f \\n\",p,fChildPMin,fChildPMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ theta cut\n\tif (theta > fChildThetaMax || theta < fChildThetaMin) {\n\/\/\t printf(\"\\n failed theta cut %f %f %f \\n\",theta,fChildThetaMin,fChildThetaMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ rapidity cut\n\tif (y > fChildYMax || y < fChildYMin) {\n\/\/\t printf(\"\\n failed y cut %f %f %f \\n\",y,fChildYMin,fChildYMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ phi cut\n\tif (phi > fChildPhiMax || phi < fChildPhiMin) {\n\/\/\t printf(\"\\n failed phi cut %f %f %f \\n\",phi,fChildPhiMin,fChildPhiMax);\n\t return kFALSE;\n\t}\n }\n \n \n\n return kTRUE;\n}\n\nInt_t AliGenMC::CheckPDGCode(Int_t pdgcode)\n{\n\/\/\n\/\/ If the particle is in a diffractive state, then take action accordingly\n switch (pdgcode) {\n case 91:\n return 92;\n case 110:\n \/\/rho_diff0 -- difficult to translate, return rho0\n return 113;\n case 210:\n \/\/pi_diffr+ -- change to pi+\n return 211;\n case 220:\n \/\/omega_di0 -- change to omega0\n return 223;\n case 330:\n \/\/phi_diff0 -- return phi0\n return 333;\n case 440:\n \/\/J\/psi_di0 -- return J\/psi\n return 443;\n case 2110:\n \/\/n_diffr -- return neutron\n return 2112;\n case 2210:\n \/\/p_diffr+ -- return proton\n return 2212;\n }\n \/\/non diffractive state -- return code unchanged\n return pdgcode;\n}\n\t \nAliGenMC& AliGenMC::operator=(const AliGenMC& rhs)\n{\n\/\/ Assignment operator\n return *this;\n}\n\n<commit_msg>Saver calculation of rapdity.<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/*\n$Log$\nRevision 1.5 2002\/03\/12 17:02:20 morsch\nChange in calculation of rapidity, include case in which numerically e == pz.\n\nRevision 1.4 2001\/11\/27 13:13:07 morsch\nMaximum lifetime for long-lived particles to be put on the stack is parameter.\nIt can be set via SetMaximumLifetime(..).\n\nRevision 1.3 2001\/10\/16 08:48:56 morsch\nCommon vertex related code moved to base class AliGenerator.\n\nRevision 1.2 2001\/10\/15 08:15:51 morsch\nEvent vertex and vertex truncation setting moved into AliMC.\n\nRevision 1.1 2001\/07\/13 10:56:00 morsch\nAliGenMC base class for AliGenParam and AliGenPythia commonalities.\n\n*\/\n\n#include \"AliGenMC.h\"\n#include \"AliPDG.h\"\n#include <TParticle.h>\n\n ClassImp(AliGenMC)\n\nAliGenMC::AliGenMC()\n :AliGenerator()\n{\n\/\/ Default Constructor\n SetCutOnChild();\n SetChildMomentumRange();\n SetChildPtRange();\n SetChildPhiRange();\n SetChildThetaRange(); \n SetChildYRange(); \n SetMaximumLifetime();\n}\n\nAliGenMC::AliGenMC(Int_t npart)\n :AliGenerator(npart)\n{\n\/\/ Constructor\n SetCutOnChild();\n SetChildMomentumRange();\n SetChildPtRange();\n SetChildPhiRange();\n SetChildThetaRange();\n SetChildYRange(); \n\/\/ \n fParentSelect.Set(8);\n fChildSelect.Set(8);\n for (Int_t i=0; i<8; i++) fParentSelect[i]=fChildSelect[i]=0;\n SetMaximumLifetime();\n}\n\nAliGenMC::AliGenMC(const AliGenMC & mc)\n{\n\/\/ copy constructor\n}\n\nAliGenMC::~AliGenMC()\n{\n\/\/ Destructor\n}\n\nvoid AliGenMC::Init()\n{\n\/\/\n\/\/ Initialization\n switch (fForceDecay) {\n case kSemiElectronic:\n case kDiElectron:\n case kBJpsiDiElectron:\n case kBPsiPrimeDiElectron:\n\tfChildSelect[0] = kElectron;\t\n\tbreak;\n case kSemiMuonic:\n case kDiMuon:\n case kBJpsiDiMuon:\n case kBPsiPrimeDiMuon:\n case kPiToMu:\n case kKaToMu:\n\tfChildSelect[0]=kMuonMinus;\n\tbreak;\n case kHadronicD:\n\tfChildSelect[0]=kPiPlus;\n\tfChildSelect[1]=kKPlus;\n\tbreak;\n case kAll:\n case kNoDecay:\n\tbreak;\n }\n}\n\n\nBool_t AliGenMC::ParentSelected(Int_t ip)\n{\n\/\/ True if particle is in list of parent particles to be selected\n for (Int_t i=0; i<8; i++)\n {\n\tif (fParentSelect[i]==ip) return kTRUE;\n }\n return kFALSE;\n}\n\nBool_t AliGenMC::ChildSelected(Int_t ip)\n{\n\/\/ True if particle is in list of decay products to be selected\n for (Int_t i=0; i<5; i++)\n {\n\tif (fChildSelect[i]==ip) return kTRUE;\n }\n return kFALSE;\n}\n\nBool_t AliGenMC::KinematicSelection(TParticle *particle, Int_t flag)\n{\n\/\/ Perform kinematic selection\n Float_t px = particle->Px();\n Float_t py = particle->Py();\n Float_t pz = particle->Pz();\n Float_t e = particle->Energy();\n Float_t pt = particle->Pt();\n Float_t p = particle->P();\n Float_t theta = particle->Theta();\n Float_t mass = particle->GetMass();\n Float_t mt2 = pt * pt + mass * mass;\n \n Float_t phi = Float_t(TMath::ATan2(Double_t(py),Double_t(px)));\n Double_t y, y0;\n\n if (TMath::Abs(pz) < e) {\n\ty = 0.5*TMath::Log((e+pz)\/(e-pz));\n } else {\n\ty = 1.e10;\n }\n \n if (mt2) {\n\ty0 = 0.5*TMath::Log((e+TMath::Abs(pz))*(e+TMath::Abs(pz))\/mt2);\n } else {\n\tif (TMath::Abs(y) < 1.e10) {\n\t y0 = y;\n\t} else {\n\t y0 = 1.e10;\n\t}\n }\n \n y = (pz < 0) ? -y0 : y0;\n \n if (flag == 0) {\n\/\/\n\/\/ Primary particle cuts\n\/\/\n\/\/ transverse momentum cut \n\tif (pt > fPtMax || pt < fPtMin) {\n\/\/\t printf(\"\\n failed pt cut %f %f %f \\n\",pt,fPtMin,fPtMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ momentum cut\n\tif (p > fPMax || p < fPMin) {\n\/\/\t printf(\"\\n failed p cut %f %f %f \\n\",p,fPMin,fPMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ theta cut\n\tif (theta > fThetaMax || theta < fThetaMin) {\n\/\/\t printf(\"\\n failed theta cut %f %f %f \\n\",theta,fThetaMin,fThetaMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ rapidity cut\n\tif (y > fYMax || y < fYMin) {\n\/\/\t printf(\"\\n failed y cut %f %f %f \\n\",y,fYMin,fYMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ phi cut\n\tif (phi > fPhiMax || phi < fPhiMin) {\n\/\/\t printf(\"\\n failed phi cut %f %f %f \\n\",phi,fPhiMin,fPhiMax);\n\t return kFALSE;\n\t}\n } else {\n\/\/\n\/\/ Decay product cuts\n\/\/\n\/\/ transverse momentum cut \n\tif (pt > fChildPtMax || pt < fChildPtMin) {\n\/\/\t printf(\"\\n failed pt cut %f %f %f \\n\",pt,fChildPtMin,fChildPtMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ momentum cut\n\tif (p > fChildPMax || p < fChildPMin) {\n\/\/\t printf(\"\\n failed p cut %f %f %f \\n\",p,fChildPMin,fChildPMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ theta cut\n\tif (theta > fChildThetaMax || theta < fChildThetaMin) {\n\/\/\t printf(\"\\n failed theta cut %f %f %f \\n\",theta,fChildThetaMin,fChildThetaMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ rapidity cut\n\tif (y > fChildYMax || y < fChildYMin) {\n\/\/\t printf(\"\\n failed y cut %f %f %f \\n\",y,fChildYMin,fChildYMax);\n\t return kFALSE;\n\t}\n\/\/\n\/\/ phi cut\n\tif (phi > fChildPhiMax || phi < fChildPhiMin) {\n\/\/\t printf(\"\\n failed phi cut %f %f %f \\n\",phi,fChildPhiMin,fChildPhiMax);\n\t return kFALSE;\n\t}\n }\n \n \n\n return kTRUE;\n}\n\nInt_t AliGenMC::CheckPDGCode(Int_t pdgcode)\n{\n\/\/\n\/\/ If the particle is in a diffractive state, then take action accordingly\n switch (pdgcode) {\n case 91:\n return 92;\n case 110:\n \/\/rho_diff0 -- difficult to translate, return rho0\n return 113;\n case 210:\n \/\/pi_diffr+ -- change to pi+\n return 211;\n case 220:\n \/\/omega_di0 -- change to omega0\n return 223;\n case 330:\n \/\/phi_diff0 -- return phi0\n return 333;\n case 440:\n \/\/J\/psi_di0 -- return J\/psi\n return 443;\n case 2110:\n \/\/n_diffr -- return neutron\n return 2112;\n case 2210:\n \/\/p_diffr+ -- return proton\n return 2212;\n }\n \/\/non diffractive state -- return code unchanged\n return pdgcode;\n}\n\t \nAliGenMC& AliGenMC::operator=(const AliGenMC& rhs)\n{\n\/\/ Assignment operator\n return *this;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ =-=-=-=-=-=-=-\n#include \"irods_auth_factory.hpp\"\n#include \"irods_native_auth_object.hpp\"\n#include \"irods_pam_auth_object.hpp\"\n#include \"irods_osauth_auth_object.hpp\"\n#include \"irods_gsi_object.hpp\"\n#include \"irods_krb_object.hpp\"\n#include <boost\/algorithm\/string.hpp>\n\nnamespace irods {\n\/\/\/ =-=-=-=-=-=-=-\n\/\/\/ @brief super basic free factory function to create an auth object\n\/\/\/ given the requested authentication scheme\n error auth_factory(\n const std::string& _scheme,\n rError_t* _r_error,\n auth_object_ptr& _ptr ) {\n \/\/ ensure scheme is lower case for comparison\n std::string scheme = boost::algorithm::to_lower_copy( _scheme );\n\n if ( scheme.empty() || AUTH_NATIVE_SCHEME == scheme ) {\n _ptr.reset( new native_auth_object( _r_error ) );\n }\n else if ( AUTH_PAM_SCHEME == scheme ) {\n _ptr.reset( new pam_auth_object( _r_error ) );\n }\n else if ( AUTH_OSAUTH_SCHEME == scheme ) {\n _ptr.reset( new osauth_auth_object( _r_error ) );\n }\n else if ( AUTH_GSI_SCHEME == scheme ) {\n _ptr.reset( new gsi_auth_object( _r_error ) );\n }\n else if ( AUTH_KRB_SCHEME == scheme ) {\n _ptr.reset( new krb_auth_object( _r_error ) );\n }\n else {\n std::string msg( \"auth scheme not supported [\" );\n msg += scheme + \"]\";\n return ERROR( SYS_INVALID_INPUT_PARAM, msg );\n }\n\n return SUCCESS();\n\n } \/\/ auth_factory\n\n}; \/\/ namespace irods\n\n\n\n<commit_msg>gsseap auth object<commit_after>\/\/ =-=-=-=-=-=-=-\n#include \"irods_auth_factory.hpp\"\n#include \"irods_native_auth_object.hpp\"\n#include \"irods_pam_auth_object.hpp\"\n#include \"irods_osauth_auth_object.hpp\"\n#include \"irods_gsi_object.hpp\"\n#include \"irods_krb_object.hpp\"\n#include \"irods_gsseap_object.hpp\"\n#include <boost\/algorithm\/string.hpp>\n\nnamespace irods {\n\/\/\/ =-=-=-=-=-=-=-\n\/\/\/ @brief super basic free factory function to create an auth object\n\/\/\/ given the requested authentication scheme\n error auth_factory(\n const std::string& _scheme,\n rError_t* _r_error,\n auth_object_ptr& _ptr ) {\n \/\/ ensure scheme is lower case for comparison\n std::string scheme = boost::algorithm::to_lower_copy( _scheme );\n\n if ( scheme.empty() || AUTH_NATIVE_SCHEME == scheme ) {\n _ptr.reset( new native_auth_object( _r_error ) );\n }\n else if ( AUTH_PAM_SCHEME == scheme ) {\n _ptr.reset( new pam_auth_object( _r_error ) );\n }\n else if ( AUTH_OSAUTH_SCHEME == scheme ) {\n _ptr.reset( new osauth_auth_object( _r_error ) );\n }\n else if ( AUTH_GSI_SCHEME == scheme ) {\n _ptr.reset( new gsi_auth_object( _r_error ) );\n }\n else if ( AUTH_KRB_SCHEME == scheme ) {\n _ptr.reset( new krb_auth_object( _r_error ) );\n }\n\telse if ( AUTH_GSSEAP_SCHEME == scheme ) {\n\t _ptr.reset( new gsseap_auth_object( _r_error ) );\n\t}\n else {\n std::string msg( \"auth scheme not supported [\" );\n msg += scheme + \"]\";\n return ERROR( SYS_INVALID_INPUT_PARAM, msg );\n }\n\n return SUCCESS();\n\n } \/\/ auth_factory\n\n}; \/\/ namespace irods\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/..............................................................................\n\/\/\n\/\/ This file is part of the Jancy toolkit.\n\/\/\n\/\/ Jancy is distributed under the MIT license.\n\/\/ For details see accompanying license.txt file,\n\/\/ the public copy of which is also available at:\n\/\/ http:\/\/tibbo.com\/downloads\/archive\/jancy\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"jnc_rt_ExceptionMgr.h\"\n#include \"jnc_rt_Runtime.h\"\n#include \"jnc_Runtime.h\"\n\n\/\/ #define _JNC_NO_EH 1\n\nnamespace jnc {\nnamespace rt {\n\n\/\/..............................................................................\n\n#if (_JNC_OS_POSIX)\n\nvoid\nExceptionMgr::install()\n{\n\tint result;\n\tsigset_t signalMask;\n\tsigemptyset(&signalMask);\n\tsigaddset(&signalMask, SIGSEGV);\n\tsigaddset(&signalMask, SIGBUS);\n\tsigaddset(&signalMask, SIGFPE);\n\tsigaddset(&signalMask, SIGILL);\n\n\tstruct sigaction sigAction = { 0 };\n\tsigAction.sa_flags = SA_SIGINFO;\n\tsigAction.sa_mask = signalMask;\n\n\tsigAction.sa_sigaction = signalHandler;\n\tresult = sigaction(SIGSEGV, &sigAction, &m_prevSigActionTable[SIGSEGV]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGBUS, &sigAction, &m_prevSigActionTable[SIGBUS]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGFPE, &sigAction, &m_prevSigActionTable[SIGFPE]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGILL, &sigAction, &m_prevSigActionTable[SIGILL]);\n\tASSERT(result == 0);\n\n\tsigAction.sa_sigaction = signalHandler_SIGUSR;\n\tresult = sigaction(SIGUSR1, &sigAction, &m_prevSigActionTable[SIGUSR1]);\n\tASSERT(result == 0);\n}\n\nvoid\nExceptionMgr::signalHandler(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\tenum\n\t{\n#if (_JNC_OS_DARWIN)\n\t\tGcGuardPageHitSignal = SIGBUS\n#else\n\t\tGcGuardPageHitSignal = SIGSEGV\n#endif\n\t};\n\n\t\/\/ while POSIX does not require pthread_getspecific to be async-signal-safe, in practice it is\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t{\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\t\treturn;\n\t}\n\n\tif (signal == GcGuardPageHitSignal)\n\t{\n\t\tGcHeap* gcHeap = tls->m_runtime->getGcHeap();\n\t\tif (signalInfo->si_addr == gcHeap->getGuardPage())\n\t\t{\n\t\t\tgcHeap->handleGuardPageHit(&tls->m_gcMutatorThread);\n\t\t\treturn;\n\t\t}\n\t}\n\n#if (_JNC_NO_EH)\n\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n#else\n\tTlsVariableTable* tlsVariableTable = (TlsVariableTable*)(tls + 1);\n\tif (!tlsVariableTable->m_sjljFrame)\n\t{\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\t}\n\telse\n\t{\n\t\tconst ucontext_t* ucontext = (ucontext_t *)context;\n#\tif (_JNC_CPU_AMD64)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.gregs[REG_RIP];\n#\telif (_JNC_CPU_X86)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.gregs[REG_EIP];\n#\telif (_JNC_CPU_ARM32)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.arm_pc;\n#\telse\n#\t\terror unsupported CPU architecture\n#\tendif\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_signal = signal;\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_code = signalInfo->si_code;\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_faultAddress = (uintptr_t)signalInfo->si_addr;\n\t\tjnc_longJmp(tlsVariableTable->m_sjljFrame->m_jmpBuf, -1);\n\t\tASSERT(false);\n\t}\n#endif\n}\n\nvoid\nExceptionMgr::signalHandler_SIGUSR(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\t\/\/ while POSIX does not require pthread_getspecific to be async-signal-safe, in practice it is\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\n\t\/\/ do nothing (we gc-handshake manually). but we still need a handler\n}\n\nvoid\nExceptionMgr::invokePrevSignalHandler(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\tconst struct sigaction* prevSigAction = &m_prevSigActionTable[signal];\n\n\tif (prevSigAction->sa_handler == SIG_IGN)\n\t{\n\t\treturn;\n\t}\n\telse if (prevSigAction->sa_handler == SIG_DFL)\n\t{\n\t\t\/\/ no other choice but to restore and re-raise\n\t\tsigaction(signal, &m_prevSigActionTable[signal], NULL);\n\t\traise(signal);\n\t}\n\telse if (!(prevSigAction->sa_flags & SA_SIGINFO))\n\t{\n\t\tprevSigAction->sa_handler(signal);\n\t}\n\telse if (prevSigAction->sa_sigaction)\n\t{\n\t\tprevSigAction->sa_sigaction(signal, signalInfo, context);\n\t}\n}\n\n#elif (_AXL_OS_WIN)\n\nvoid\nExceptionMgr::install()\n{\n\t::AddVectoredExceptionHandler(true, vectoredExceptionHandler);\n}\n\nLONG\nWINAPI\nExceptionMgr::vectoredExceptionHandler(EXCEPTION_POINTERS* exceptionPointers)\n{\n\tLONG status = exceptionPointers->ExceptionRecord->ExceptionCode;\n\tif (status >= 0) \/\/ we only care about NT error conditions\n\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\n\tGcHeap* gcHeap = tls->m_runtime->getGcHeap();\n\n\tif (status == EXCEPTION_ACCESS_VIOLATION &&\n\t\texceptionPointers->ExceptionRecord->ExceptionInformation[1] == (uintptr_t)gcHeap->getGuardPage())\n\t{\n\t\tgcHeap->handleGuardPageHit(&tls->m_gcMutatorThread);\n\t\treturn EXCEPTION_CONTINUE_EXECUTION;\n\t}\n\n#if (_JNC_NO_EH)\n\treturn EXCEPTION_CONTINUE_SEARCH;\n#else\n\tTlsVariableTable* tlsVariableTable = (TlsVariableTable*)(tls + 1);\n\tif (tlsVariableTable->m_sjljFrame)\n\t{\n\t\tsys::setWinExceptionError(\n\t\t\tstatus,\n\t\t\t(uintptr_t)exceptionPointers->ExceptionRecord->ExceptionAddress,\n\t\t\t(const uintptr_t*)exceptionPointers->ExceptionRecord->ExceptionInformation,\n\t\t\texceptionPointers->ExceptionRecord->NumberParameters\n\t\t\t);\n\n\t\tjnc_longJmp(tlsVariableTable->m_sjljFrame->m_jmpBuf, -1);\n\t\tASSERT(false);\n\t}\n\n\treturn EXCEPTION_CONTINUE_SEARCH;\n#endif\n}\n\n#endif\n\n\/\/..............................................................................\n\n} \/\/ namespace rt\n} \/\/ namespace jnc\n<commit_msg>[jnc_rt] fix: uc_mcontext access fix on darwin-amd64<commit_after>\/\/..............................................................................\n\/\/\n\/\/ This file is part of the Jancy toolkit.\n\/\/\n\/\/ Jancy is distributed under the MIT license.\n\/\/ For details see accompanying license.txt file,\n\/\/ the public copy of which is also available at:\n\/\/ http:\/\/tibbo.com\/downloads\/archive\/jancy\/license.txt\n\/\/\n\/\/..............................................................................\n\n#include \"pch.h\"\n#include \"jnc_rt_ExceptionMgr.h\"\n#include \"jnc_rt_Runtime.h\"\n#include \"jnc_Runtime.h\"\n\n\/\/ #define _JNC_NO_EH 1\n\nnamespace jnc {\nnamespace rt {\n\n\/\/..............................................................................\n\n#if (_JNC_OS_POSIX)\n\nvoid\nExceptionMgr::install()\n{\n\tint result;\n\tsigset_t signalMask;\n\tsigemptyset(&signalMask);\n\tsigaddset(&signalMask, SIGSEGV);\n\tsigaddset(&signalMask, SIGBUS);\n\tsigaddset(&signalMask, SIGFPE);\n\tsigaddset(&signalMask, SIGILL);\n\n\tstruct sigaction sigAction = { 0 };\n\tsigAction.sa_flags = SA_SIGINFO;\n\tsigAction.sa_mask = signalMask;\n\n\tsigAction.sa_sigaction = signalHandler;\n\tresult = sigaction(SIGSEGV, &sigAction, &m_prevSigActionTable[SIGSEGV]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGBUS, &sigAction, &m_prevSigActionTable[SIGBUS]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGFPE, &sigAction, &m_prevSigActionTable[SIGFPE]);\n\tASSERT(result == 0);\n\n\tresult = sigaction(SIGILL, &sigAction, &m_prevSigActionTable[SIGILL]);\n\tASSERT(result == 0);\n\n\tsigAction.sa_sigaction = signalHandler_SIGUSR;\n\tresult = sigaction(SIGUSR1, &sigAction, &m_prevSigActionTable[SIGUSR1]);\n\tASSERT(result == 0);\n}\n\nvoid\nExceptionMgr::signalHandler(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\tenum\n\t{\n#if (_JNC_OS_DARWIN)\n\t\tGcGuardPageHitSignal = SIGBUS\n#else\n\t\tGcGuardPageHitSignal = SIGSEGV\n#endif\n\t};\n\n\t\/\/ while POSIX does not require pthread_getspecific to be async-signal-safe, in practice it is\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t{\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\t\treturn;\n\t}\n\n\tif (signal == GcGuardPageHitSignal)\n\t{\n\t\tGcHeap* gcHeap = tls->m_runtime->getGcHeap();\n\t\tif (signalInfo->si_addr == gcHeap->getGuardPage())\n\t\t{\n\t\t\tgcHeap->handleGuardPageHit(&tls->m_gcMutatorThread);\n\t\t\treturn;\n\t\t}\n\t}\n\n#if (_JNC_NO_EH)\n\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n#else\n\tTlsVariableTable* tlsVariableTable = (TlsVariableTable*)(tls + 1);\n\tif (!tlsVariableTable->m_sjljFrame)\n\t{\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\t}\n\telse\n\t{\n\t\tconst ucontext_t* ucontext = (ucontext_t *)context;\n#\tif (_JNC_OS_DARWIN)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext->__ss.__rip;\n#\telif (_JNC_CPU_AMD64)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.gregs[REG_RIP];\n#\telif (_JNC_CPU_X86)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.gregs[REG_EIP];\n#\telif (_JNC_CPU_ARM32)\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_codeAddress = ucontext->uc_mcontext.arm_pc;\n#\telse\n#\t\terror unsupported CPU architecture\n#\tendif\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_signal = signal;\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_code = signalInfo->si_code;\n\t\ttlsVariableTable->m_sjljFrame->m_signalInfo.m_faultAddress = (uintptr_t)signalInfo->si_addr;\n\t\tjnc_longJmp(tlsVariableTable->m_sjljFrame->m_jmpBuf, -1);\n\t\tASSERT(false);\n\t}\n#endif\n}\n\nvoid\nExceptionMgr::signalHandler_SIGUSR(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\t\/\/ while POSIX does not require pthread_getspecific to be async-signal-safe, in practice it is\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t\tsl::getSimpleSingleton<ExceptionMgr> ()->invokePrevSignalHandler(signal, signalInfo, context);\n\n\t\/\/ do nothing (we gc-handshake manually). but we still need a handler\n}\n\nvoid\nExceptionMgr::invokePrevSignalHandler(\n\tint signal,\n\tsiginfo_t* signalInfo,\n\tvoid* context\n\t)\n{\n\tconst struct sigaction* prevSigAction = &m_prevSigActionTable[signal];\n\n\tif (prevSigAction->sa_handler == SIG_IGN)\n\t{\n\t\treturn;\n\t}\n\telse if (prevSigAction->sa_handler == SIG_DFL)\n\t{\n\t\t\/\/ no other choice but to restore and re-raise\n\t\tsigaction(signal, &m_prevSigActionTable[signal], NULL);\n\t\traise(signal);\n\t}\n\telse if (!(prevSigAction->sa_flags & SA_SIGINFO))\n\t{\n\t\tprevSigAction->sa_handler(signal);\n\t}\n\telse if (prevSigAction->sa_sigaction)\n\t{\n\t\tprevSigAction->sa_sigaction(signal, signalInfo, context);\n\t}\n}\n\n#elif (_AXL_OS_WIN)\n\nvoid\nExceptionMgr::install()\n{\n\t::AddVectoredExceptionHandler(true, vectoredExceptionHandler);\n}\n\nLONG\nWINAPI\nExceptionMgr::vectoredExceptionHandler(EXCEPTION_POINTERS* exceptionPointers)\n{\n\tLONG status = exceptionPointers->ExceptionRecord->ExceptionCode;\n\tif (status >= 0) \/\/ we only care about NT error conditions\n\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\n\tTls* tls = getCurrentThreadTls();\n\tif (!tls)\n\t\treturn EXCEPTION_CONTINUE_SEARCH;\n\n\tGcHeap* gcHeap = tls->m_runtime->getGcHeap();\n\n\tif (status == EXCEPTION_ACCESS_VIOLATION &&\n\t\texceptionPointers->ExceptionRecord->ExceptionInformation[1] == (uintptr_t)gcHeap->getGuardPage())\n\t{\n\t\tgcHeap->handleGuardPageHit(&tls->m_gcMutatorThread);\n\t\treturn EXCEPTION_CONTINUE_EXECUTION;\n\t}\n\n#if (_JNC_NO_EH)\n\treturn EXCEPTION_CONTINUE_SEARCH;\n#else\n\tTlsVariableTable* tlsVariableTable = (TlsVariableTable*)(tls + 1);\n\tif (tlsVariableTable->m_sjljFrame)\n\t{\n\t\tsys::setWinExceptionError(\n\t\t\tstatus,\n\t\t\t(uintptr_t)exceptionPointers->ExceptionRecord->ExceptionAddress,\n\t\t\t(const uintptr_t*)exceptionPointers->ExceptionRecord->ExceptionInformation,\n\t\t\texceptionPointers->ExceptionRecord->NumberParameters\n\t\t\t);\n\n\t\tjnc_longJmp(tlsVariableTable->m_sjljFrame->m_jmpBuf, -1);\n\t\tASSERT(false);\n\t}\n\n\treturn EXCEPTION_CONTINUE_SEARCH;\n#endif\n}\n\n#endif\n\n\/\/..............................................................................\n\n} \/\/ namespace rt\n} \/\/ namespace jnc\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PrimeNumberFinder.h\"\n#include \"PrimeSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"config.h\"\n#include \"bithacks.h\"\n\n#include <stdint.h>\n#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nnamespace soe {\n\n\/\/\/ Bit patterns corresponding to prime k-tuplets\n\/\/\/ within bytes of the sieve array.\nconst uint32_t PrimeNumberFinder::kTupletBitmasks_[6][5] =\n{\n { 0x06, 0x18, 0xc0, END }, \/\/ Twin primes\n { 0x07, 0x0e, 0x1c, 0x38, END }, \/\/ Prime triplets\n { 0x1e, END }, \/\/ Prime quadruplets\n { 0x1f, 0x3e, END }, \/\/ Prime quintuplets\n { 0x3f, END }, \/\/ Prime sextuplets\n { 0xfe, END } \/\/ Prime septuplets\n};\n\nPrimeNumberFinder::PrimeNumberFinder(PrimeSieve& ps) :\n SieveOfEratosthenes(\n std::max<uint64_t>(7, ps.getStart()),\n ps.getStop(),\n ps.getPreSieveLimit(),\n ps.getSieveSize()),\n ps_(ps),\n kTupletByteCounts_(NULL)\n{\n static_assert(PrimeSieve::COUNTS_SIZE == 7, \"PrimeSieve::COUNTS_SIZE == 7\");\n if (ps_.testFlags(ps_.COUNT_KTUPLETS))\n this->initLookupTables();\n}\n\nPrimeNumberFinder::~PrimeNumberFinder() {\n if (kTupletByteCounts_ != NULL) {\n for (int i = 0; i < 6; i++)\n delete[] kTupletByteCounts_[i];\n delete[] kTupletByteCounts_;\n }\n}\n\n\/**\n * Check if PrimeNumberFinder requires a PrimeNumberGenerator\n * object to generate its sieving primes.\n *\/\nbool PrimeNumberFinder::needGenerator() const {\n return (this->getSquareRoot() > this->getPreSieveLimit());\n}\n\n\/**\n * Initialize the lookup tables needed to count prime k-tuplets\n * (twin primes, prime triplets, ...) per byte.\n *\/\nvoid PrimeNumberFinder::initLookupTables() {\n kTupletByteCounts_ = new uint32_t*[6];\n for (uint32_t i = 0; i < 6; i++) {\n kTupletByteCounts_[i] = NULL;\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n kTupletByteCounts_[i] = new uint32_t[256];\n for (uint32_t j = 0; j < 256; j++) {\n uint32_t bitmaskCount = 0;\n for (const uint32_t* b = kTupletBitmasks_[i]; *b <= j; b++) {\n if ((j & *b) == *b)\n bitmaskCount++;\n }\n kTupletByteCounts_[i][j] = bitmaskCount;\n }\n }\n }\n}\n\n\/**\n * Generate\/count the primes and prime k-tuplets within the current\n * segment i.e. [segmentLow_+7, segmentHigh_].\n *\/\nvoid PrimeNumberFinder::analyseSieve(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.COUNT_FLAGS))\n this->count(sieve, sieveSize);\n if (ps_.testFlags(ps_.GENERATE_FLAGS))\n this->generate(sieve, sieveSize);\n if (ps_.isFlag(ps_.CALCULATE_STATUS))\n ps_()->calcStatus(sieveSize * NUMBERS_PER_BYTE);\n}\n\n\/**\n * Count the primes and prime k-tuplets within\n * the current segment.\n *\/\nvoid PrimeNumberFinder::count(const uint8_t* sieve, uint32_t sieveSize) {\n \/\/ count prime numbers (1 bits within the sieve array)\n if (ps_.isFlag(ps_.COUNT_PRIMES)) {\n const uint64_t* sieve64 = reinterpret_cast<const uint64_t*>(sieve);\n uint32_t sieveSize64 = sieveSize \/ 8;\n uint32_t bytesLeft = sieveSize % 8;\n \/\/ see bithacks.h\n uint32_t primeCount = popcount_lauradoux(sieve64, sieveSize64);\n if (bytesLeft > 0)\n primeCount += popcount_kernighan(&sieve[sieveSize - bytesLeft], bytesLeft);\n \/\/ add up to total prime count\n ps_.counts_[0] += primeCount;\n }\n \/\/ count prime k-tuplets (i=0 twins, i=1 triplets, ...)\n \/\/ using lookup tables\n for (uint32_t i = 0; i < 6; i++) {\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n uint32_t kCount = 0;\n for (uint32_t j = 0; j < sieveSize; j++)\n kCount += kTupletByteCounts_[i][sieve[j]];\n ps_.counts_[i+1] += kCount;\n }\n }\n}\n\n\/**\n * Generate the primes or prime k-tuplets (twin primes, prime\n * triplets, ...) within the current segment.\n *\/\nvoid PrimeNumberFinder::generate(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.PRINT_KTUPLETS)) {\n const uint64_t segmentLow = this->getSegmentLow();\n \/\/ i = 0 twins, i = 1 triplets, ...\n uint32_t i = 0;\n for (; !ps_.isFlag(ps_.PRINT_TWINS << i); i++)\n ;\n \/\/ print prime k-tuplets to std::cout\n for (uint32_t j = 0; j < sieveSize; j++) {\n for (const uint32_t* bitmask = kTupletBitmasks_[i]; *bitmask <= sieve[j]; bitmask++) {\n if ((sieve[j] & *bitmask) == *bitmask) {\n std::ostringstream kTuplet;\n kTuplet << \"(\";\n uint32_t bits = *bitmask;\n uint64_t offset = segmentLow + j * NUMBERS_PER_BYTE;\n for (; bits & (bits - 1); bits &= bits - 1)\n kTuplet << offset + this->getFirstSetBitValue(bits) << \", \";\n kTuplet << offset + this->getFirstSetBitValue(bits) << \")\\n\";\n std::cout << kTuplet.str();\n }\n }\n }\n }\n else\n#if defined(_OPENMP)\n #pragma omp critical (generate)\n#endif\n {\n \/\/ GENERATE_PRIMES() is defined in SieveOfEratosthenes.h\n if (ps_.isFlag(ps_.CALLBACK32_PRIMES)) GENERATE_PRIMES(ps_.callback32_, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK32_OOP_PRIMES)) GENERATE_PRIMES(this->callback32_OOP, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK64_PRIMES)) GENERATE_PRIMES(ps_.callback64_, uint64_t)\n else if (ps_.isFlag(ps_.CALLBACK64_OOP_PRIMES)) GENERATE_PRIMES(this->callback64_OOP, uint64_t)\n else if (ps_.isFlag(ps_.PRINT_PRIMES)) GENERATE_PRIMES(this->print, uint64_t)\n }\n}\n\nvoid PrimeNumberFinder::callback32_OOP(uint32_t prime) const {\n ps_.callback32_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::callback64_OOP(uint64_t prime) const {\n ps_.callback64_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::print(uint64_t prime) const {\n std::cout << prime << '\\n';\n}\n\n} \/\/ namespace soe\n<commit_msg>minor modifications<commit_after>\/\/\n\/\/ Copyright (c) 2012 Kim Walisch, <kim.walisch@gmail.com>.\n\/\/ All rights reserved.\n\/\/\n\/\/ This file is part of primesieve.\n\/\/ Homepage: http:\/\/primesieve.googlecode.com\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following\n\/\/ disclaimer in the documentation and\/or other materials provided\n\/\/ with the distribution.\n\/\/ * Neither the name of the author nor the names of its\n\/\/ contributors may be used to endorse or promote products derived\n\/\/ from this software without specific prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n\/\/ (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n\/\/ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\/\/ HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n\/\/ STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED\n\/\/ OF THE POSSIBILITY OF SUCH DAMAGE.\n\n#include \"PrimeNumberFinder.h\"\n#include \"PrimeSieve.h\"\n#include \"SieveOfEratosthenes.h\"\n#include \"config.h\"\n#include \"bithacks.h\"\n\n#include <stdint.h>\n#include <algorithm>\n#include <cstdlib>\n#include <iostream>\n#include <sstream>\n\n#if defined(_OPENMP)\n #include <omp.h>\n#endif\n\nnamespace soe {\n\n\/\/\/ Bit patterns corresponding to prime k-tuplets\n\/\/\/ within bytes of the sieve array.\nconst uint32_t PrimeNumberFinder::kTupletBitmasks_[6][5] =\n{\n { 0x06, 0x18, 0xc0, END }, \/\/ Twin primes\n { 0x07, 0x0e, 0x1c, 0x38, END }, \/\/ Prime triplets\n { 0x1e, END }, \/\/ Prime quadruplets\n { 0x1f, 0x3e, END }, \/\/ Prime quintuplets\n { 0x3f, END }, \/\/ Prime sextuplets\n { 0xfe, END } \/\/ Prime septuplets\n};\n\nPrimeNumberFinder::PrimeNumberFinder(PrimeSieve& ps) :\n SieveOfEratosthenes(\n std::max<uint64_t>(7, ps.getStart()),\n ps.getStop(),\n ps.getPreSieveLimit(),\n ps.getSieveSize()),\n ps_(ps),\n kTupletByteCounts_(NULL)\n{\n static_assert(PrimeSieve::COUNTS_SIZE == 7, \"PrimeSieve::COUNTS_SIZE == 7\");\n if (ps_.testFlags(ps_.COUNT_KTUPLETS))\n initLookupTables();\n}\n\nPrimeNumberFinder::~PrimeNumberFinder() {\n if (kTupletByteCounts_ != NULL) {\n for (int i = 0; i < 6; i++)\n delete[] kTupletByteCounts_[i];\n delete[] kTupletByteCounts_;\n }\n}\n\n\/**\n * Check if PrimeNumberFinder requires a PrimeNumberGenerator\n * object to generate its sieving primes.\n *\/\nbool PrimeNumberFinder::needGenerator() const {\n return getPreSieveLimit() < getSquareRoot();\n}\n\n\/**\n * Initialize the lookup tables needed to count prime k-tuplets\n * (twin primes, prime triplets, ...) per byte.\n *\/\nvoid PrimeNumberFinder::initLookupTables() {\n kTupletByteCounts_ = new uint32_t*[6];\n for (uint32_t i = 0; i < 6; i++) {\n kTupletByteCounts_[i] = NULL;\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n kTupletByteCounts_[i] = new uint32_t[256];\n for (uint32_t j = 0; j < 256; j++) {\n uint32_t bitmaskCount = 0;\n for (const uint32_t* b = kTupletBitmasks_[i]; *b <= j; b++) {\n if ((j & *b) == *b)\n bitmaskCount++;\n }\n kTupletByteCounts_[i][j] = bitmaskCount;\n }\n }\n }\n}\n\n\/**\n * Generate\/count the primes and prime k-tuplets within the current\n * segment i.e. [segmentLow_+7, segmentHigh_].\n *\/\nvoid PrimeNumberFinder::analyseSieve(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.COUNT_FLAGS))\n count(sieve, sieveSize);\n if (ps_.testFlags(ps_.GENERATE_FLAGS))\n generate(sieve, sieveSize);\n if (ps_.isFlag(ps_.CALCULATE_STATUS))\n ps_()->calcStatus(sieveSize * NUMBERS_PER_BYTE);\n}\n\n\/**\n * Count the primes and prime k-tuplets within\n * the current segment.\n *\/\nvoid PrimeNumberFinder::count(const uint8_t* sieve, uint32_t sieveSize) {\n \/\/ count prime numbers (1 bits within the sieve array)\n if (ps_.isFlag(ps_.COUNT_PRIMES)) {\n const uint64_t* sieve64 = reinterpret_cast<const uint64_t*>(sieve);\n uint32_t sieveSize64 = sieveSize \/ 8;\n uint32_t bytesLeft = sieveSize % 8;\n \/\/ see bithacks.h\n uint32_t primeCount = popcount_lauradoux(sieve64, sieveSize64);\n if (bytesLeft > 0)\n primeCount += popcount_kernighan(&sieve[sieveSize - bytesLeft], bytesLeft);\n \/\/ add up to total prime count\n ps_.counts_[0] += primeCount;\n }\n \/\/ count prime k-tuplets (i=0 twins, i=1 triplets, ...)\n \/\/ using lookup tables\n for (uint32_t i = 0; i < 6; i++) {\n if (ps_.isFlag(ps_.COUNT_TWINS << i)) {\n uint32_t kCount = 0;\n for (uint32_t j = 0; j < sieveSize; j++)\n kCount += kTupletByteCounts_[i][sieve[j]];\n ps_.counts_[i+1] += kCount;\n }\n }\n}\n\n\/**\n * Generate the primes or prime k-tuplets (twin primes, prime\n * triplets, ...) within the current segment.\n *\/\nvoid PrimeNumberFinder::generate(const uint8_t* sieve, uint32_t sieveSize) {\n if (ps_.testFlags(ps_.PRINT_KTUPLETS)) {\n const uint64_t segmentLow = getSegmentLow();\n \/\/ i = 0 twins, i = 1 triplets, ...\n uint32_t i = 0;\n for (; !ps_.isFlag(ps_.PRINT_TWINS << i); i++)\n ;\n \/\/ print prime k-tuplets to std::cout\n for (uint32_t j = 0; j < sieveSize; j++) {\n for (const uint32_t* bitmask = kTupletBitmasks_[i]; *bitmask <= sieve[j]; bitmask++) {\n if ((sieve[j] & *bitmask) == *bitmask) {\n std::ostringstream kTuplet;\n kTuplet << \"(\";\n uint32_t bits = *bitmask;\n uint64_t offset = segmentLow + j * NUMBERS_PER_BYTE;\n for (; bits & (bits - 1); bits &= bits - 1)\n kTuplet << offset + getFirstSetBitValue(bits) << \", \";\n kTuplet << offset + getFirstSetBitValue(bits) << \")\\n\";\n std::cout << kTuplet.str();\n }\n }\n }\n }\n else\n#if defined(_OPENMP)\n #pragma omp critical (generate)\n#endif\n {\n \/\/ GENERATE_PRIMES() is defined in SieveOfEratosthenes.h\n if (ps_.isFlag(ps_.CALLBACK32_PRIMES)) GENERATE_PRIMES(ps_.callback32_, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK32_OOP_PRIMES)) GENERATE_PRIMES(callback32_OOP, uint32_t)\n else if (ps_.isFlag(ps_.CALLBACK64_PRIMES)) GENERATE_PRIMES(ps_.callback64_, uint64_t)\n else if (ps_.isFlag(ps_.CALLBACK64_OOP_PRIMES)) GENERATE_PRIMES(callback64_OOP, uint64_t)\n else if (ps_.isFlag(ps_.PRINT_PRIMES)) GENERATE_PRIMES(print, uint64_t)\n }\n}\n\nvoid PrimeNumberFinder::callback32_OOP(uint32_t prime) const {\n ps_.callback32_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::callback64_OOP(uint64_t prime) const {\n ps_.callback64_OOP_(prime, ps_.cbObj_);\n}\n\nvoid PrimeNumberFinder::print(uint64_t prime) const {\n std::cout << prime << '\\n';\n}\n\n} \/\/ namespace soe\n<|endoftext|>"} {"text":"<commit_before>\/\/\/ Project specific\n\/\/ This class\n#include <Manager\/GroundEffectManager.hpp>\n\/\/ Handles\n#include <EntityComponent\/EntityHandler.hpp>\n\/\/ Components\n#include <EntityComponent\\Components\\PressureParticleComponent.hpp>\n\n\/\/\/ Engine\n\/\/ Physics\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/FluidManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n\nusing namespace DirectX;\nnamespace Doremi\n{\n namespace Core\n {\n\n GroundEffectManager::GroundEffectManager(const DoremiEngine::Core::SharedContext& p_sharedContext)\n : Manager(p_sharedContext, \"GroundEffectManager\")\n {\n \/\/ EXPERIMENTAL PHYSICS. Hard-coded ID works since I thought ahead and made it signed. Tru story\n m_sharedContext.GetPhysicsModule().GetRigidBodyManager().CreateArbitraryBody(-15);\n }\n\n GroundEffectManager::~GroundEffectManager() {}\n\n void GroundEffectManager::Update(double p_dt)\n {\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n const size_t length = entityHandler.GetLastEntityIndex();\n int mask = (int)ComponentType::PressureParticleSystem;\n for(size_t i = 0; i < length; i++)\n {\n \/\/ Check if we have a pressure particle system. TODOXX This will be really funny if we have just ambient particle systems\n if(entityHandler.HasComponents(i, mask))\n {\n \/\/ Merge new positions into already existing positions\n const vector<XMFLOAT3>& newPositions = m_sharedContext.GetPhysicsModule().GetFluidManager().GetRemovedParticlesPositions(i);\n m_groundEffectPoints.reserve(m_groundEffectPoints.size() + newPositions.size());\n m_groundEffectPoints.insert(m_groundEffectPoints.end(), newPositions.begin(), newPositions.end());\n }\n }\n }\n\n void GroundEffectManager::OnEvent(Event* p_event) {}\n }\n}<commit_msg>Work in progress: now creates trigger shapes where particles hit<commit_after>\/\/\/ Project specific\n\/\/ This class\n#include <Manager\/GroundEffectManager.hpp>\n\/\/ Handles\n#include <EntityComponent\/EntityHandler.hpp>\n\/\/ Components\n#include <EntityComponent\\Components\\PressureParticleComponent.hpp>\n\n\/\/\/ Engine\n\/\/ Physics\n#include <DoremiEngine\/Physics\/Include\/PhysicsModule.hpp>\n#include <DoremiEngine\/Physics\/Include\/FluidManager.hpp>\n#include <DoremiEngine\/Physics\/Include\/RigidBodyManager.hpp>\n\nusing namespace DirectX;\nnamespace Doremi\n{\n namespace Core\n {\n\n GroundEffectManager::GroundEffectManager(const DoremiEngine::Core::SharedContext& p_sharedContext)\n : Manager(p_sharedContext, \"GroundEffectManager\")\n {\n \/\/ EXPERIMENTAL PHYSICS. Hard-coded ID works since I thought ahead and made it signed. Tru story\n m_sharedContext.GetPhysicsModule().GetRigidBodyManager().CreateArbitraryBody(-15);\n }\n\n GroundEffectManager::~GroundEffectManager() {}\n\n void GroundEffectManager::Update(double p_dt)\n {\n EntityHandler& entityHandler = EntityHandler::GetInstance();\n const size_t length = entityHandler.GetLastEntityIndex();\n int mask = (int)ComponentType::PressureParticleSystem;\n for(size_t i = 0; i < length; i++)\n {\n \/\/ Check if we have a pressure particle system. TODOXX This will be really funny if we have just ambient particle systems\n if(entityHandler.HasComponents(i, mask))\n {\n \/\/ Merge new positions into already existing positions\n const vector<XMFLOAT3>& newPositions = m_sharedContext.GetPhysicsModule().GetFluidManager().GetRemovedParticlesPositions(i);\n \/\/ m_groundEffectPoints.reserve(m_groundEffectPoints.size() + newPositions.size());\n \/\/ m_groundEffectPoints.insert(m_groundEffectPoints.end(), newPositions.begin(), newPositions.end());\n\n \/\/ Loop through new positions\n size_t size = newPositions.size();\n if(size > 0)\n {\n for(size_t j = 0; j < size; j++)\n {\n m_sharedContext.GetPhysicsModule().GetRigidBodyManager().AddShapeToBody(-15, newPositions[j]);\n }\n }\n }\n }\n }\n\n void GroundEffectManager::OnEvent(Event* p_event) {}\n }\n}<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (C) 2015 Virgil Security Inc.\n *\n * Lead Maintainer: Virgil Security Inc. <support@virgilsecurity.com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * (1) Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * (2) Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * (3) Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <iterator>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <tclap\/CmdLine.h>\n\n#include <virgil\/sdk\/ServicesHub.h>\n\n#include <cli\/version.h>\n#include <cli\/config.h>\n#include <cli\/pair.h>\n#include <cli\/util.h>\n\nnamespace vsdk = virgil::sdk;\nnamespace vcrypto = virgil::crypto;\nnamespace vcli = virgil::cli;\n\n#ifdef SPLIT_CLI\n#define MAIN main\n#else\n#define MAIN public_key_revoke_main\n#endif\n\nint MAIN(int argc, char** argv) {\n try {\n std::string description =\n \"Revoke a chain of cards with (un)confirmed identities connected by public-key-id from \"\n \"Virgil Keys Service.\\n\";\n\n std::vector<std::string> examples;\n examples.push_back(\"Revoke a chain of cards with confirmed identities connected by public-key-id from \"\n \"Virgil Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key\"\n \" -f alice\/validated-identity.txt\\n\\n\");\n\n examples.push_back(\"Revoke a chain of cards with unconfirmed identities connected by public-key-id from \"\n \"Virgil Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key\"\n \" -d email:user@domain.com\\n\\n\");\n\n std::string descriptionMessage = virgil::cli::getDescriptionMessage(description, examples);\n\n \/\/ Parse arguments.\n TCLAP::CmdLine cmd(descriptionMessage, ' ', virgil::cli_version());\n\n TCLAP::ValueArg<std::string> publicKeyIdArg(\"e\", \"public-key-id\", \"Public Key identifier\\n\", true, \"\", \"arg\");\n\n TCLAP::ValueArg<std::string> cardIdArg(\"a\", \"card-id\", \"virgil Card identifier\", true, \"\", \"arg\");\n\n TCLAP::MultiArg<std::string> identityArg(\"d\", \"identity\", \"Identity user\", true, \"arg\");\n\n TCLAP::MultiArg<std::string> validatedIdentityArg(\"f\", \"validated-identity\", \"ValidatedIdentity\", true, \"file\");\n\n TCLAP::ValueArg<std::string> privateKeyArg(\"k\", \"key\", \"Private key\", true, \"\", \"file\");\n\n TCLAP::ValueArg<std::string> privateKeyPasswordArg(\n \"p\", \"private-key-password\", \"Password to be used for Private Key encryption.\", false, \"\", \"arg\");\n\n TCLAP::SwitchArg verboseArg(\"V\", \"VERBOSE\", \"Show detailed information\", false);\n\n cmd.add(verboseArg);\n cmd.add(privateKeyPasswordArg);\n cmd.add(privateKeyArg);\n cmd.xorAdd(validatedIdentityArg, identityArg);\n cmd.add(cardIdArg);\n cmd.add(publicKeyIdArg);\n cmd.parse(argc, argv);\n\n std::string pathPrivateKey = privateKeyArg.getValue();\n vcrypto::VirgilByteArray privateKey = vcli::readPrivateKey(pathPrivateKey);\n vcrypto::VirgilByteArray privateKeyPassword;\n if (privateKeyPasswordArg.isSet()) {\n privateKeyPassword = vcrypto::str2bytes(privateKeyPasswordArg.getValue());\n } else {\n privateKeyPassword = vcli::setPrivateKeyPass(privateKey);\n }\n vsdk::Credentials credentials(privateKey, privateKeyPassword);\n\n vcli::ConfigFile configFile = vcli::readConfigFile(verboseArg.isSet());\n vsdk::ServicesHub servicesHub(configFile.virgilAccessToken, configFile.serviceUri);\n\n if (validatedIdentityArg.isSet()) {\n std::vector<vsdk::dto::ValidatedIdentity> validatedIdentities;\n std::vector<std::string> validatedIdentityFiles = validatedIdentityArg.getValue();\n for (const auto& validatedIdentityFile : validatedIdentityFiles) {\n vsdk::dto::ValidatedIdentity validatedIdentity = vcli::readValidateIdentity(validatedIdentityFile);\n validatedIdentities.push_back(validatedIdentity);\n }\n\n servicesHub.publicKey().revoke(publicKeyIdArg.getValue(), validatedIdentities, cardIdArg.getValue(),\n credentials);\n } else {\n \/\/ identityArg.isSet\n std::vector<std::string> identitiesStr = identityArg.getValue();\n std::vector<vsdk::dto::Identity> identities;\n for (const auto& identityStr : identitiesStr) {\n auto identityPair = vcli::parsePair(identityStr);\n std::string recipientType = identityPair.first;\n std::string recipientValue = identityPair.second;\n std::string arg = \"-d, --identity\";\n vcli::checkFormatIdentity(arg, recipientType);\n\n vsdk::dto::Identity identity(recipientValue, recipientType);\n identities.push_back(identity);\n }\n\n servicesHub.publicKey().revokeNotValid(publicKeyIdArg.getValue(), identities, cardIdArg.getValue(),\n credentials);\n }\n\n if (verboseArg.isSet()) {\n std::string messageSuccess = \"Card with public-key-id:\" + publicKeyIdArg.getValue() + \" has been revoked\";\n std::cout << messageSuccess;\n }\n\n } catch (TCLAP::ArgException& exception) {\n std::cerr << \"public-key-revoke. Error: \" << exception.error() << \" for arg \" << exception.argId() << std::endl;\n return EXIT_FAILURE;\n } catch (std::exception& exception) {\n std::cerr << \"public-key-revoke. Error: \" << exception.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<commit_msg>Fix bug: revoke a group Private Virgil Card with obfuscated identity type<commit_after>\/**\n * Copyright (C) 2015 Virgil Security Inc.\n *\n * Lead Maintainer: Virgil Security Inc. <support@virgilsecurity.com>\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * (1) Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * (2) Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * (3) Neither the name of the copyright holder nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ''AS IS'' AND ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,\n * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include <algorithm>\n#include <fstream>\n#include <iostream>\n#include <iterator>\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include <tclap\/CmdLine.h>\n\n#include <virgil\/sdk\/ServicesHub.h>\n\n#include <cli\/version.h>\n#include <cli\/config.h>\n#include <cli\/pair.h>\n#include <cli\/util.h>\n\nnamespace vsdk = virgil::sdk;\nnamespace vcrypto = virgil::crypto;\nnamespace vcli = virgil::cli;\n\n#ifdef SPLIT_CLI\n#define MAIN main\n#else\n#define MAIN public_key_revoke_main\n#endif\n\nint MAIN(int argc, char** argv) {\n try {\n std::string description = \"Revoke a group of Global\/Private Cards from the Public Keys Service connected by \"\n \"public-key-id + card-id of one of the Cards from the group.\\n\";\n\n std::vector<std::string> examples;\n examples.push_back(\n \"Revoke a chain of Virgil Global Cards connected by public-key-id from Public Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key -f \"\n \"alice\/global-main-validated-identity.txt -f alice\/global-reserve-validated-identity.txt\\n\\n\");\n\n examples.push_back(\"Revoke a chain of Virgil Private Cards with confirmed identities connected by \"\n \"public-key-id from Public Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key -f \"\n \"alice\/private-main-validated-identity.txt -f \"\n \"alice\/private-reserve-validated-identity.txt\\n\\n\");\n\n examples.push_back(\"Revoke a chain of Virgil Private Cards with unconfirmed identities connected by \"\n \"public-key-id from Public Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key -d \"\n \"email:alice_main@domain.com -d email:alice_reserve@domain.com\\n\\n\");\n\n examples.push_back(\"Revoke a chain of Virgil Private Cards with unconfirmed identities and obfuscator identity \"\n \"value and\/or type connected by public-key-id from Public Keys Service:\\n\"\n \"virgil public-key-revoke -e <public_key_id> -a <card_id> -k alice\/private.key -d \"\n \"<obfuscator_type>:<obfuscator_value_1> -d <obfuscator_type>:<obfuscator_value_2>\\n\\n\");\n\n std::string descriptionMessage = virgil::cli::getDescriptionMessage(description, examples);\n\n \/\/ Parse arguments.\n TCLAP::CmdLine cmd(descriptionMessage, ' ', virgil::cli_version());\n\n TCLAP::ValueArg<std::string> publicKeyIdArg(\"e\", \"public-key-id\", \"Public Key identifier\\n\", true, \"\", \"arg\");\n\n TCLAP::ValueArg<std::string> cardIdArg(\"a\", \"card-id\", \"Globalr\/Private Virgil Card identifier\", true, \"\",\n \"arg\");\n\n TCLAP::MultiArg<std::string> identityArg(\"d\", \"identity\", \"User identifier for Private Virgil Card with \"\n \"unconfirmed identity. Use only for Private Virgil \"\n \"Card with unconfirmed identity\",\n true, \"arg\");\n\n TCLAP::MultiArg<std::string> validatedIdentityArg(\"f\", \"validated-identity\",\n \"Validated Identity for Private Virgil Card - see 'virgil \"\n \"identity-confirm-private', for Global Virgil Card - see \"\n \"'virgil identity-confirm-global'\",\n true, \"file\");\n\n TCLAP::ValueArg<std::string> privateKeyArg(\"k\", \"key\", \"Private key\", true, \"\", \"file\");\n\n TCLAP::ValueArg<std::string> privateKeyPasswordArg(\n \"p\", \"private-key-password\", \"Password to be used for Private Key encryption.\", false, \"\", \"arg\");\n\n TCLAP::SwitchArg verboseArg(\"V\", \"VERBOSE\", \"Show detailed information\", false);\n\n cmd.add(verboseArg);\n cmd.add(privateKeyPasswordArg);\n cmd.add(privateKeyArg);\n cmd.xorAdd(validatedIdentityArg, identityArg);\n cmd.add(cardIdArg);\n cmd.add(publicKeyIdArg);\n cmd.parse(argc, argv);\n\n std::string pathPrivateKey = privateKeyArg.getValue();\n vcrypto::VirgilByteArray privateKey = vcli::readPrivateKey(pathPrivateKey);\n vcrypto::VirgilByteArray privateKeyPassword;\n if (privateKeyPasswordArg.isSet()) {\n privateKeyPassword = vcrypto::str2bytes(privateKeyPasswordArg.getValue());\n } else {\n privateKeyPassword = vcli::setPrivateKeyPass(privateKey);\n }\n vsdk::Credentials credentials(privateKey, privateKeyPassword);\n\n vcli::ConfigFile configFile = vcli::readConfigFile(verboseArg.isSet());\n vsdk::ServicesHub servicesHub(configFile.virgilAccessToken, configFile.serviceUri);\n\n if (validatedIdentityArg.isSet()) {\n std::vector<vsdk::dto::ValidatedIdentity> validatedIdentities;\n std::vector<std::string> validatedIdentityFiles = validatedIdentityArg.getValue();\n for (const auto& validatedIdentityFile : validatedIdentityFiles) {\n vsdk::dto::ValidatedIdentity validatedIdentity = vcli::readValidateIdentity(validatedIdentityFile);\n validatedIdentities.push_back(validatedIdentity);\n }\n\n servicesHub.publicKey().revoke(publicKeyIdArg.getValue(), validatedIdentities, cardIdArg.getValue(),\n credentials);\n } else {\n \/\/ identityArg.isSet\n std::vector<std::string> identitiesStr = identityArg.getValue();\n std::vector<vsdk::dto::Identity> identities;\n for (const auto& identityStr : identitiesStr) {\n auto identityPair = vcli::parsePair(identityStr);\n std::string recipientType = identityPair.first;\n std::string recipientValue = identityPair.second;\n vsdk::dto::Identity identity(recipientValue, recipientType);\n identities.push_back(identity);\n }\n\n servicesHub.publicKey().revokeNotValid(publicKeyIdArg.getValue(), identities, cardIdArg.getValue(),\n credentials);\n }\n\n if (verboseArg.isSet()) {\n std::string messageSuccess =\n \"Card[s] with public-key-id:\" + publicKeyIdArg.getValue() + \" has been revoked\";\n std::cout << messageSuccess << std::endl;\n }\n\n } catch (TCLAP::ArgException& exception) {\n std::cerr << \"public-key-revoke. Error: \" << exception.error() << \" for arg \" << exception.argId() << std::endl;\n return EXIT_FAILURE;\n } catch (std::exception& exception) {\n std::cerr << \"public-key-revoke. Error: \" << exception.what() << std::endl;\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Name: TerrManDlg.cpp\n\/\/\n\/\/ Copyright (c) 2003-2007 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n\t#pragma implementation \"TerrManDlg.cpp\"\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#include \"vtlib\/core\/TParams.h\"\n#include \"vtdata\/FilePath.h\"\n#include \"vtdata\/DataPath.h\"\n#include \"TerrManDlg.h\"\n#include \"..\/Options.h\"\n#include \"EnviroApp.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass TMTreeItemData : public wxTreeItemData\n{\npublic:\n\tvtString m_strDir;\n\tvtString m_strXmlFile;\n\tvtString m_strName;\n};\n\n\/\/ WDR: class implementations\n\n\/\/---------------------------------------------------------------------------\n\/\/ TerrainManagerDlg\n\/\/---------------------------------------------------------------------------\n\n\/\/ WDR: event table for TerrainManagerDlg\n\nBEGIN_EVENT_TABLE(TerrainManagerDlg,wxDialog)\n\tEVT_INIT_DIALOG (TerrainManagerDlg::OnInitDialog)\n\tEVT_TREE_SEL_CHANGED( ID_TREECTRL, TerrainManagerDlg::OnSelChanged )\n\tEVT_TREE_DELETE_ITEM( ID_TREECTRL, TerrainManagerDlg::OnDeleteItem )\n\tEVT_BUTTON( ID_ADD_PATH, TerrainManagerDlg::OnAddPath )\n\tEVT_BUTTON( ID_ADD_TERRAIN, TerrainManagerDlg::OnAddTerrain )\n\tEVT_BUTTON( ID_DELETE, TerrainManagerDlg::OnDelete )\n\tEVT_BUTTON( ID_EDIT_PARAMS, TerrainManagerDlg::OnEditParams )\n\tEVT_BUTTON( ID_COPY, TerrainManagerDlg::OnCopy )\nEND_EVENT_TABLE()\n\nTerrainManagerDlg::TerrainManagerDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\twxDialog( parent, id, title, position, size, style | wxRESIZE_BORDER )\n{\n\t\/\/ WDR: dialog function TerrManFunc for TerrainManagerDlg\n\tTerrManFunc( this, TRUE );\n\tm_pTree = GetTree();\n\tm_iSelect = 0;\n}\n\nvoid TerrainManagerDlg::RefreshTreeContents()\n{\n\tm_pTree->DeleteAllItems();\n\n\tvtStringArray &paths = vtGetDataPath();\n\tsize_t i, num = paths.size();\n\twxString wstr;\n\n\tm_Root = m_pTree->AddRoot(_(\"Terrain Data Paths\"));\n\n\tfor (i = 0; i < num; i++)\n\t{\n\t\tvtString str = paths[i];\n\n\t\twstr = wxString(str, wxConvUTF8);\n\t\twxTreeItemId hPath = m_pTree->AppendItem(m_Root, wstr);\n\n\t\tvtString directory = str + \"Terrains\";\n\t\tfor (dir_iter it((const char *)directory); it != dir_iter(); ++it)\n\t\t{\n\t\t\tif (it.is_hidden() || it.is_directory())\n\t\t\t\tcontinue;\n\n\t\t\tstd::string name1 = it.filename();\n\t\t\tvtString name = name1.c_str();\n\n\t\t\t\/\/ only look terrain parameters files\n\t\t\tvtString ext = GetExtension(name, false);\n\t\t\tif (ext.CompareNoCase(\".xml\") != 0)\n\t\t\t\tcontinue;\n\n\t\t\tTParams params;\n\t\t\tbool success = params.LoadFrom(directory + \"\/\" + name);\n\n\t\t\twstr = wxString(name, wxConvUTF8);\n\t\t\tif (success)\n\t\t\t{\n\t\t\t\twstr += _T(\" (\");\n\t\t\t\twxString wstr2(params.GetValueString(STR_NAME), wxConvUTF8);\n\t\t\t\twstr += wstr2;\n\t\t\t\twstr += _T(\")\");\n\t\t\t}\n\n\t\t\twxTreeItemId hItem = m_pTree->AppendItem(hPath, wstr);\n\t\t\tTMTreeItemData *data = new TMTreeItemData;\n\t\t\tdata->m_strDir = directory;\n\t\t\tdata->m_strXmlFile = name;\n\t\t\tdata->m_strName = params.GetValueString(STR_NAME);\n\t\t\tm_pTree->SetItemData(hItem, data);\n\t\t}\n\t\t\/\/ m_pTree->Expand(hPath);\n\t}\n\tm_pTree->Expand(m_Root);\n}\n\nvoid TerrainManagerDlg::RefreshTreeText()\n{\n\twxTreeItemId i1, i2;\n\tTParams params;\n\n\twxTreeItemIdValue cookie1, cookie2;\n\tfor (i1 = m_pTree->GetFirstChild(m_Root, cookie1); i1.IsOk(); i1 = m_pTree->GetNextChild(i1, cookie1))\n\t{\n\t\tfor (i2 = m_pTree->GetFirstChild(i1, cookie2); i2.IsOk(); i2 = m_pTree->GetNextChild(i2, cookie2))\n\t\t{\n\t\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(i2);\n\t\t\tvtString path = data->m_strDir + \"\/\" + data->m_strXmlFile;\n\t\t\tif (params.LoadFrom(path))\n\t\t\t{\n\t\t\t\tdata->m_strName = params.GetValueString(STR_NAME);\n\t\t\t\twxString wstr(data->m_strXmlFile, wxConvUTF8);\n\t\t\t\twstr += _T(\" (\");\n\t\t\t\twstr += wxString(params.GetValueString(STR_NAME), wxConvUTF8);\n\t\t\t\twstr += _T(\")\");\n\t\t\t\tm_pTree->SetItemText(i2, wstr);\n\t\t\t}\n\t\t}\n\t}\n}\n\nwxString TerrainManagerDlg::GetCurrentPath()\n{\n\twxTreeItemId parent = m_pTree->GetItemParent(m_Selected);\n\treturn m_pTree->GetItemText(parent);\n}\n\nwxString TerrainManagerDlg::GetCurrentTerrainPath()\n{\n\twxString path = GetCurrentPath();\n\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\tpath += _T(\"Terrains\/\");\n\tpath += wxString(data->m_strXmlFile, wxConvUTF8);\n\treturn path;\n}\n\n\/\/ WDR: handler implementations for TerrainManagerDlg\n\nvoid TerrainManagerDlg::OnCopy( wxCommandEvent &event )\n{\n\tif (m_iSelect != 2)\n\t\treturn;\n\n\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\twxString file(data->m_strXmlFile, wxConvUTF8);\n\n\twxString msg = _(\"Please enter the name for the terrain copy.\");\n\twxString str = wxGetTextFromUser(msg, _(\"Add Copy of Terrain\"), file);\n\tif (str == _T(\"\"))\n\t\treturn;\n\n\tTParams params;\n\tparams.LoadFrom(GetCurrentTerrainPath().mb_str(wxConvUTF8));\n\n\twxString newpath = GetCurrentPath();\n\tnewpath += _T(\"Terrains\/\");\n\tnewpath += str;\n\tparams.WriteToXML(newpath.mb_str(wxConvUTF8), STR_TPARAMS_FORMAT_NAME);\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnEditParams( wxCommandEvent &event )\n{\n\tif (m_iSelect != 2)\n\t\treturn;\n\n\twxString curpath = GetCurrentTerrainPath();\n\tint res = EditTerrainParameters(this, curpath.mb_str(wxConvUTF8));\n\tif (res == wxID_OK)\n\t{\n\t\t\/\/ They might have changed an .ini to .xml\n\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\t\tvtString str = data->m_strXmlFile;\n\t\tif (GetExtension(str, false) == \".ini\")\n\t\t\tdata->m_strXmlFile = str.Left(str.GetLength()-4)+\".xml\";\n\n\t\t\/\/ They might have changed the terrain name\n\t\tRefreshTreeText();\n\t}\n}\n\nvoid TerrainManagerDlg::OnDelete( wxCommandEvent &event )\n{\n\tif (m_iSelect == 1)\n\t{\n\t\t\/\/ remove path\n\t\tvtStringArray &paths = vtGetDataPath();\n\t\twxString path = m_pTree->GetItemText(m_Selected);\n\t\tvtString vpath = (const char *) path.mb_str(wxConvUTF8);\n\t\tfor (vtStringArray::iterator it = paths.begin(); it != paths.end(); it++)\n\t\t{\n\t\t\tif (*it == vpath)\n\t\t\t{\n\t\t\t\tpaths.erase(it);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tvtSaveDataPath();\n\t\tm_pTree->Delete(m_Selected);\n\t}\n\tif (m_iSelect == 2)\n\t{\n\t\t\/\/ delete terrain .ini file\n\t\twxTreeItemId parent = m_pTree->GetItemParent(m_Selected);\n\t\tvtString path = (const char *) m_pTree->GetItemText(parent).mb_str(wxConvUTF8);\n\t\tpath +=\"Terrains\/\";\n\n\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\t\tpath += data->m_strXmlFile;\n\t\tvtDeleteFile(path);\n\n\t\tm_pTree->Delete(m_Selected);\n\t}\n}\n\nvoid TerrainManagerDlg::OnAddTerrain( wxCommandEvent &event )\n{\n\twxString msg = _(\"Please enter the name for a new terrain .xml file.\");\n\twxString str = wxGetTextFromUser(msg, _(\"Add Terrain\"));\n\tif (str == _T(\"\"))\n\t\treturn;\n\n\tif (str.Right(4).CmpNoCase(_T(\".xml\")))\n\t\tstr += _T(\".xml\");\n\n\tvtString path = (const char *) m_pTree->GetItemText(m_Selected).mb_str(wxConvUTF8);\n\tpath += \"Terrains\";\n\n\t\/\/ Make sure Terrains directory exists\n\tvtCreateDir(path);\n\n\tpath += \"\/\";\n\tpath += str.mb_str(wxConvUTF8);\n\n\tTParams params;\n\tparams.SetValueString(STR_NAME, \"Untitled\");\n\tparams.WriteToXML(path, STR_TPARAMS_FORMAT_NAME);\n\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnAddPath( wxCommandEvent &event )\n{\n#if 0\n\t\/\/ This is nice in that it allows you to type a relative path\n\twxString msg = _T(\"Please enter an absolute or relative path.\";\n\twxString str = wxGetTextFromUser(msg, _T(\"Add Path\"));\n\tif (str == _T(\"\"))\n\t\treturn;\n#endif\n\t\/\/ Ask the user for a directory (can only be absolute)\n\twxDirDialog getDir(this, _(\"Specify Data Directory\"));\n\tbool bResult = (getDir.ShowModal() == wxID_OK);\n\tif (!bResult)\n\t\treturn;\n\twxString str = getDir.GetPath();\n\n\t\/\/ Make sure there is a trailing slash\n\tif (str.Length() > 1)\n\t{\n\t\tchar ch = str.GetChar(str.Length()-1);\n\t\tif (ch != '\/' && ch != '\\\\')\n\t\t\tstr += _T(\"\/\");\n\t}\n\n\tvtString path(str.mb_str(wxConvUTF8));\n\tvtGetDataPath().push_back(path);\n\tvtSaveDataPath();\n\n\t\/\/ To be helpful, also create most of the standard sub-directories\n\tvtString SubDirectory;\n\tSubDirectory = path + vtString(\"BuildingData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"BuildingModels\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Culture\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Elevation\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"GeoSpecific\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Locations\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"PlantData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"PointData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"RoadData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Terrains\");\n\tvtCreateDir(SubDirectory);\n\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tRefreshTreeContents();\n\tUpdateEnabling();\n\twxWindow::OnInitDialog(event);\n}\n\n\n\/\/\n\/\/ Tree events\n\/\/\nvoid TerrainManagerDlg::OnDeleteItem( wxTreeEvent &event )\n{\n}\n\nvoid TerrainManagerDlg::OnSelChanged( wxTreeEvent &event )\n{\n\twxTreeItemId item = event.GetItem();\n\tm_Selected = item;\n\n\/\/ MyTreeItemData *data = (MyTreeItemData *)m_pTree->GetItemData(item);\n\n\tif (item == m_Root)\n\t\tm_iSelect = 0;\n\telse\n\t{\n\t\titem = m_pTree->GetItemParent(item);\n\t\tif (item == m_Root)\n\t\t\tm_iSelect = 1;\n\t\telse\n\t\t{\n\t\t\titem = m_pTree->GetItemParent(item);\n\t\t\tif (item == m_Root)\n\t\t\t\tm_iSelect = 2;\n\t\t}\n\t}\n\tUpdateEnabling();\n}\n\nvoid TerrainManagerDlg::UpdateEnabling()\n{\n\tGetAddTerrain()->Enable(m_iSelect == 1);\n\tGetCopy()->Enable(m_iSelect == 2);\n\tGetDelete()->Enable(m_iSelect == 1 || m_iSelect == 2);\n\tif (m_iSelect == 1)\n\t\tGetDelete()->SetLabel(_(\"Remove\"));\n\telse if (m_iSelect == 2)\n\t\tGetDelete()->SetLabel(_(\"Delete\"));\n\tGetEditParams()->Enable(m_iSelect == 2);\n}\n\n<commit_msg>don't auto-create seldom-used 'Data\/Culture' folder<commit_after>\/\/\n\/\/ Name: TerrManDlg.cpp\n\/\/\n\/\/ Copyright (c) 2003-2008 Virtual Terrain Project\n\/\/ Free for all uses, see license.txt for details.\n\/\/\n\n#ifdef __GNUG__\n\t#pragma implementation \"TerrManDlg.cpp\"\n#endif\n\n\/\/ For compilers that support precompilation, includes \"wx\/wx.h\".\n#include \"wx\/wxprec.h\"\n\n#include \"vtlib\/core\/TParams.h\"\n#include \"vtdata\/FilePath.h\"\n#include \"vtdata\/DataPath.h\"\n#include \"TerrManDlg.h\"\n#include \"..\/Options.h\"\n#include \"EnviroApp.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass TMTreeItemData : public wxTreeItemData\n{\npublic:\n\tvtString m_strDir;\n\tvtString m_strXmlFile;\n\tvtString m_strName;\n};\n\n\/\/ WDR: class implementations\n\n\/\/---------------------------------------------------------------------------\n\/\/ TerrainManagerDlg\n\/\/---------------------------------------------------------------------------\n\n\/\/ WDR: event table for TerrainManagerDlg\n\nBEGIN_EVENT_TABLE(TerrainManagerDlg,wxDialog)\n\tEVT_INIT_DIALOG (TerrainManagerDlg::OnInitDialog)\n\tEVT_TREE_SEL_CHANGED( ID_TREECTRL, TerrainManagerDlg::OnSelChanged )\n\tEVT_TREE_DELETE_ITEM( ID_TREECTRL, TerrainManagerDlg::OnDeleteItem )\n\tEVT_BUTTON( ID_ADD_PATH, TerrainManagerDlg::OnAddPath )\n\tEVT_BUTTON( ID_ADD_TERRAIN, TerrainManagerDlg::OnAddTerrain )\n\tEVT_BUTTON( ID_DELETE, TerrainManagerDlg::OnDelete )\n\tEVT_BUTTON( ID_EDIT_PARAMS, TerrainManagerDlg::OnEditParams )\n\tEVT_BUTTON( ID_COPY, TerrainManagerDlg::OnCopy )\nEND_EVENT_TABLE()\n\nTerrainManagerDlg::TerrainManagerDlg( wxWindow *parent, wxWindowID id, const wxString &title,\n\tconst wxPoint &position, const wxSize& size, long style ) :\n\twxDialog( parent, id, title, position, size, style | wxRESIZE_BORDER )\n{\n\t\/\/ WDR: dialog function TerrManFunc for TerrainManagerDlg\n\tTerrManFunc( this, TRUE );\n\tm_pTree = GetTree();\n\tm_iSelect = 0;\n}\n\nvoid TerrainManagerDlg::RefreshTreeContents()\n{\n\tm_pTree->DeleteAllItems();\n\n\tvtStringArray &paths = vtGetDataPath();\n\tsize_t i, num = paths.size();\n\twxString wstr;\n\n\tm_Root = m_pTree->AddRoot(_(\"Terrain Data Paths\"));\n\n\tfor (i = 0; i < num; i++)\n\t{\n\t\tvtString str = paths[i];\n\n\t\twstr = wxString(str, wxConvUTF8);\n\t\twxTreeItemId hPath = m_pTree->AppendItem(m_Root, wstr);\n\n\t\tvtString directory = str + \"Terrains\";\n\t\tfor (dir_iter it((const char *)directory); it != dir_iter(); ++it)\n\t\t{\n\t\t\tif (it.is_hidden() || it.is_directory())\n\t\t\t\tcontinue;\n\n\t\t\tstd::string name1 = it.filename();\n\t\t\tvtString name = name1.c_str();\n\n\t\t\t\/\/ only look terrain parameters files\n\t\t\tvtString ext = GetExtension(name, false);\n\t\t\tif (ext.CompareNoCase(\".xml\") != 0)\n\t\t\t\tcontinue;\n\n\t\t\tTParams params;\n\t\t\tbool success = params.LoadFrom(directory + \"\/\" + name);\n\n\t\t\twstr = wxString(name, wxConvUTF8);\n\t\t\tif (success)\n\t\t\t{\n\t\t\t\twstr += _T(\" (\");\n\t\t\t\twxString wstr2(params.GetValueString(STR_NAME), wxConvUTF8);\n\t\t\t\twstr += wstr2;\n\t\t\t\twstr += _T(\")\");\n\t\t\t}\n\n\t\t\twxTreeItemId hItem = m_pTree->AppendItem(hPath, wstr);\n\t\t\tTMTreeItemData *data = new TMTreeItemData;\n\t\t\tdata->m_strDir = directory;\n\t\t\tdata->m_strXmlFile = name;\n\t\t\tdata->m_strName = params.GetValueString(STR_NAME);\n\t\t\tm_pTree->SetItemData(hItem, data);\n\t\t}\n\t\t\/\/ m_pTree->Expand(hPath);\n\t}\n\tm_pTree->Expand(m_Root);\n}\n\nvoid TerrainManagerDlg::RefreshTreeText()\n{\n\twxTreeItemId i1, i2;\n\tTParams params;\n\n\twxTreeItemIdValue cookie1, cookie2;\n\tfor (i1 = m_pTree->GetFirstChild(m_Root, cookie1); i1.IsOk(); i1 = m_pTree->GetNextChild(i1, cookie1))\n\t{\n\t\tfor (i2 = m_pTree->GetFirstChild(i1, cookie2); i2.IsOk(); i2 = m_pTree->GetNextChild(i2, cookie2))\n\t\t{\n\t\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(i2);\n\t\t\tvtString path = data->m_strDir + \"\/\" + data->m_strXmlFile;\n\t\t\tif (params.LoadFrom(path))\n\t\t\t{\n\t\t\t\tdata->m_strName = params.GetValueString(STR_NAME);\n\t\t\t\twxString wstr(data->m_strXmlFile, wxConvUTF8);\n\t\t\t\twstr += _T(\" (\");\n\t\t\t\twstr += wxString(params.GetValueString(STR_NAME), wxConvUTF8);\n\t\t\t\twstr += _T(\")\");\n\t\t\t\tm_pTree->SetItemText(i2, wstr);\n\t\t\t}\n\t\t}\n\t}\n}\n\nwxString TerrainManagerDlg::GetCurrentPath()\n{\n\twxTreeItemId parent = m_pTree->GetItemParent(m_Selected);\n\treturn m_pTree->GetItemText(parent);\n}\n\nwxString TerrainManagerDlg::GetCurrentTerrainPath()\n{\n\twxString path = GetCurrentPath();\n\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\tpath += _T(\"Terrains\/\");\n\tpath += wxString(data->m_strXmlFile, wxConvUTF8);\n\treturn path;\n}\n\n\/\/ WDR: handler implementations for TerrainManagerDlg\n\nvoid TerrainManagerDlg::OnCopy( wxCommandEvent &event )\n{\n\tif (m_iSelect != 2)\n\t\treturn;\n\n\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\twxString file(data->m_strXmlFile, wxConvUTF8);\n\n\twxString msg = _(\"Please enter the name for the terrain copy.\");\n\twxString str = wxGetTextFromUser(msg, _(\"Add Copy of Terrain\"), file);\n\tif (str == _T(\"\"))\n\t\treturn;\n\n\tTParams params;\n\tparams.LoadFrom(GetCurrentTerrainPath().mb_str(wxConvUTF8));\n\n\twxString newpath = GetCurrentPath();\n\tnewpath += _T(\"Terrains\/\");\n\tnewpath += str;\n\tparams.WriteToXML(newpath.mb_str(wxConvUTF8), STR_TPARAMS_FORMAT_NAME);\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnEditParams( wxCommandEvent &event )\n{\n\tif (m_iSelect != 2)\n\t\treturn;\n\n\twxString curpath = GetCurrentTerrainPath();\n\tint res = EditTerrainParameters(this, curpath.mb_str(wxConvUTF8));\n\tif (res == wxID_OK)\n\t{\n\t\t\/\/ They might have changed an .ini to .xml\n\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\t\tvtString str = data->m_strXmlFile;\n\t\tif (GetExtension(str, false) == \".ini\")\n\t\t\tdata->m_strXmlFile = str.Left(str.GetLength()-4)+\".xml\";\n\n\t\t\/\/ They might have changed the terrain name\n\t\tRefreshTreeText();\n\t}\n}\n\nvoid TerrainManagerDlg::OnDelete( wxCommandEvent &event )\n{\n\tif (m_iSelect == 1)\n\t{\n\t\t\/\/ remove path\n\t\tvtStringArray &paths = vtGetDataPath();\n\t\twxString path = m_pTree->GetItemText(m_Selected);\n\t\tvtString vpath = (const char *) path.mb_str(wxConvUTF8);\n\t\tfor (vtStringArray::iterator it = paths.begin(); it != paths.end(); it++)\n\t\t{\n\t\t\tif (*it == vpath)\n\t\t\t{\n\t\t\t\tpaths.erase(it);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tvtSaveDataPath();\n\t\tm_pTree->Delete(m_Selected);\n\t}\n\tif (m_iSelect == 2)\n\t{\n\t\t\/\/ delete terrain .ini file\n\t\twxTreeItemId parent = m_pTree->GetItemParent(m_Selected);\n\t\tvtString path = (const char *) m_pTree->GetItemText(parent).mb_str(wxConvUTF8);\n\t\tpath +=\"Terrains\/\";\n\n\t\tTMTreeItemData *data = (TMTreeItemData *) m_pTree->GetItemData(m_Selected);\n\t\tpath += data->m_strXmlFile;\n\t\tvtDeleteFile(path);\n\n\t\tm_pTree->Delete(m_Selected);\n\t}\n}\n\nvoid TerrainManagerDlg::OnAddTerrain( wxCommandEvent &event )\n{\n\twxString msg = _(\"Please enter the name for a new terrain .xml file.\");\n\twxString str = wxGetTextFromUser(msg, _(\"Add Terrain\"));\n\tif (str == _T(\"\"))\n\t\treturn;\n\n\tif (str.Right(4).CmpNoCase(_T(\".xml\")))\n\t\tstr += _T(\".xml\");\n\n\tvtString path = (const char *) m_pTree->GetItemText(m_Selected).mb_str(wxConvUTF8);\n\tpath += \"Terrains\";\n\n\t\/\/ Make sure Terrains directory exists\n\tvtCreateDir(path);\n\n\tpath += \"\/\";\n\tpath += str.mb_str(wxConvUTF8);\n\n\tTParams params;\n\tparams.SetValueString(STR_NAME, \"Untitled\");\n\tparams.WriteToXML(path, STR_TPARAMS_FORMAT_NAME);\n\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnAddPath( wxCommandEvent &event )\n{\n#if 0\n\t\/\/ This is nice in that it allows you to type a relative path\n\twxString msg = _T(\"Please enter an absolute or relative path.\";\n\twxString str = wxGetTextFromUser(msg, _T(\"Add Path\"));\n\tif (str == _T(\"\"))\n\t\treturn;\n#endif\n\t\/\/ Ask the user for a directory (can only be absolute)\n\twxDirDialog getDir(this, _(\"Specify Data Directory\"));\n\tbool bResult = (getDir.ShowModal() == wxID_OK);\n\tif (!bResult)\n\t\treturn;\n\twxString str = getDir.GetPath();\n\n\t\/\/ Make sure there is a trailing slash\n\tif (str.Length() > 1)\n\t{\n\t\tchar ch = str.GetChar(str.Length()-1);\n\t\tif (ch != '\/' && ch != '\\\\')\n\t\t\tstr += _T(\"\/\");\n\t}\n\n\tvtString path(str.mb_str(wxConvUTF8));\n\tvtGetDataPath().push_back(path);\n\tvtSaveDataPath();\n\n\t\/\/ To be helpful, also create most of the standard sub-directories\n\tvtString SubDirectory;\n\tSubDirectory = path + vtString(\"BuildingData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"BuildingModels\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Elevation\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"GeoSpecific\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Locations\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"PlantData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"PointData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"RoadData\");\n\tvtCreateDir(SubDirectory);\n\tSubDirectory = path + vtString(\"Terrains\");\n\tvtCreateDir(SubDirectory);\n\n\tRefreshTreeContents();\n}\n\nvoid TerrainManagerDlg::OnInitDialog(wxInitDialogEvent& event)\n{\n\tRefreshTreeContents();\n\tUpdateEnabling();\n\twxWindow::OnInitDialog(event);\n}\n\n\n\/\/\n\/\/ Tree events\n\/\/\nvoid TerrainManagerDlg::OnDeleteItem( wxTreeEvent &event )\n{\n}\n\nvoid TerrainManagerDlg::OnSelChanged( wxTreeEvent &event )\n{\n\twxTreeItemId item = event.GetItem();\n\tm_Selected = item;\n\n\/\/ MyTreeItemData *data = (MyTreeItemData *)m_pTree->GetItemData(item);\n\n\tif (item == m_Root)\n\t\tm_iSelect = 0;\n\telse\n\t{\n\t\titem = m_pTree->GetItemParent(item);\n\t\tif (item == m_Root)\n\t\t\tm_iSelect = 1;\n\t\telse\n\t\t{\n\t\t\titem = m_pTree->GetItemParent(item);\n\t\t\tif (item == m_Root)\n\t\t\t\tm_iSelect = 2;\n\t\t}\n\t}\n\tUpdateEnabling();\n}\n\nvoid TerrainManagerDlg::UpdateEnabling()\n{\n\tGetAddTerrain()->Enable(m_iSelect == 1);\n\tGetCopy()->Enable(m_iSelect == 2);\n\tGetDelete()->Enable(m_iSelect == 1 || m_iSelect == 2);\n\tif (m_iSelect == 1)\n\t\tGetDelete()->SetLabel(_(\"Remove\"));\n\telse if (m_iSelect == 2)\n\t\tGetDelete()->SetLabel(_(\"Delete\"));\n\tGetEditParams()->Enable(m_iSelect == 2);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_freq.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_freq.H\n\/\/\/ @brief Calculate and save off DIMM frequencies\n\/\/\/\n\/\/ *HWP HWP Owner: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 1\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef MSS_FREQ_H_\n#define MSS_FREQ_H_\n\n#include <fapi2.H>\n#include <lib\/freq\/cas_latency.H>\n#include <lib\/freq\/cycle_time.H>\n#include <lib\/shared\/mss_const.H>\n#include <lib\/utils\/conversions.H>\n\nnamespace mss\n{\n\n\/\/\/\n\/\/\/ @brief Checks for frequency override and sets dimm frequency and timing values\n\/\/\/ @param[in] i_target mcbist fapi2 target\n\/\/\/ @param[out] o_tCK new cycle time if there is a freq override\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\ninline fapi2::ReturnCode check_for_freq_override(const fapi2::Target<fapi2::TARGET_TYPE_MCBIST>& i_target,\n uint64_t& o_tCK)\n{\n uint64_t l_freq_override = 0;\n\n FAPI_TRY(freq_override(i_target, l_freq_override),\n \"Failed to override frequency!\");\n\n \/\/ If there is no override, don't change anything\n if ( l_freq_override != fapi2::ENUM_ATTR_MSS_FREQ_OVERRIDE_AUTO)\n {\n FAPI_TRY( mss::freq_to_ps(l_freq_override, o_tCK), \"Failed freq_to_ps()\");\n FAPI_DBG( \"Override Frequency Detected: %d\", l_freq_override);\n }\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\n\/\/\/\n\/\/\/ @brief Sets DRAM CAS latency attributes\n\/\/\/ @param[in] i_target the controller target\n\/\/\/ @param[in] i_cas_latency final selected CAS ltency\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\ninline fapi2::ReturnCode set_CL_attr(const fapi2::Target<fapi2::TARGET_TYPE_MCS>& i_target,\n uint64_t i_cas_latency)\n{\n \/\/ Declaration of the vector correctly initializes it to the right size\n \/\/ in the case the enum for PORTS_PER_MCS changes\n std::vector<uint8_t> l_cls_vect(PORTS_PER_MCS, uint8_t(i_cas_latency) );\n\n \/\/ set CAS latency attribute\n \/\/ casts vector into the type FAPI_ATTR_SET is expecting by deduction\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_EFF_DRAM_CL,\n i_target,\n UINT8_VECTOR_TO_1D_ARRAY(l_cls_vect, PORTS_PER_MCS)) ,\n \"Failed to set CAS latency attribute\");\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Sets frequency attributes\n\/\/\/ @param[in] i_target the controller target\n\/\/\/ @param[in] i_dimm_freq final selected dimm freq in MT\/s\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/ @note P9 Nimbus will support DMI speeds 16GB and 9.6GB\n\/\/\/\ninline fapi2::ReturnCode set_freq_attrs(const fapi2::Target<fapi2::TARGET_TYPE_MCS>& i_target,\n uint64_t i_dimm_freq)\n{\n \/\/ TK - RIT, needsto be corrected\n uint64_t l_nest_freq = 2;\n const auto l_mcbist = mss::find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n\n FAPI_INF(\"Setting freq attrs for %s\", mss::c_str(i_target));\n\n \/\/ TK\n \/\/Update for P9, what do we do w\/setting nest freq? - AAM\n \/\/ how do we select nest freq if we even have to??\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_NEST_CAPABLE_FREQUENCIES, l_mcbist, l_nest_freq),\n \"Failed to set nest capable frequencies attribute\" );\n\n FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_MSS_FREQ, l_mcbist, i_dimm_freq),\n \"Failed to set mss freq attribute\");\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n}\/\/ mss namespace\n\n\ntypedef fapi2::ReturnCode (*p9_mss_freq_FP_t) (const fapi2::Target<fapi2::TARGET_TYPE_MCS>&);\n\nextern \"C\"\n{\n\n \/\/\/\n \/\/\/ @brief Calculate and save off DIMM frequencies\n \/\/\/ @param[in] i_target the controller (e.g., MCS)\n \/\/\/ @return FAPI2_RC_SUCCESS iff ok\n \/\/\/\n fapi2::ReturnCode p9_mss_freq( const fapi2::Target<fapi2::TARGET_TYPE_MCS>& i_target);\n\n}\n\n#endif\n<commit_msg>Change p9_mss_freq_system to write attributes, errors for Cronus<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_freq.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_freq.H\n\/\/\/ @brief Calculate and save off DIMM frequencies\n\/\/\/\n\/\/ *HWP HWP Owner: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 1\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef MSS_FREQ_H_\n#define MSS_FREQ_H_\n\n#include <fapi2.H>\n#include <lib\/freq\/cas_latency.H>\n#include <lib\/freq\/cycle_time.H>\n#include <lib\/shared\/mss_const.H>\n#include <lib\/utils\/conversions.H>\n\nnamespace mss\n{\n\n\/\/\/\n\/\/\/ @brief Checks for frequency override and sets dimm frequency and timing values\n\/\/\/ @param[in] i_target mcbist fapi2 target\n\/\/\/ @param[out] o_tCK new cycle time if there is a freq override\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\ninline fapi2::ReturnCode check_for_freq_override(const fapi2::Target<fapi2::TARGET_TYPE_MCBIST>& i_target,\n uint64_t& o_tCK)\n{\n uint64_t l_freq_override = 0;\n\n FAPI_TRY(freq_override(i_target, l_freq_override),\n \"Failed to override frequency!\");\n\n \/\/ If there is no override, don't change anything\n if ( l_freq_override != fapi2::ENUM_ATTR_MSS_FREQ_OVERRIDE_AUTO)\n {\n FAPI_TRY( mss::freq_to_ps(l_freq_override, o_tCK), \"Failed freq_to_ps()\");\n FAPI_DBG( \"Override Frequency Detected: %d\", l_freq_override);\n }\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\n\/\/\/\n\/\/\/ @brief Sets DRAM CAS latency attributes\n\/\/\/ @param[in] i_target the controller target\n\/\/\/ @param[in] i_cas_latency final selected CAS ltency\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\ninline fapi2::ReturnCode set_CL_attr(const fapi2::Target<fapi2::TARGET_TYPE_MCS>& i_target,\n uint64_t i_cas_latency)\n{\n \/\/ Declaration of the vector correctly initializes it to the right size\n \/\/ in the case the enum for PORTS_PER_MCS changes\n std::vector<uint8_t> l_cls_vect(PORTS_PER_MCS, uint8_t(i_cas_latency) );\n\n \/\/ set CAS latency attribute\n \/\/ casts vector into the type FAPI_ATTR_SET is expecting by deduction\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_EFF_DRAM_CL,\n i_target,\n UINT8_VECTOR_TO_1D_ARRAY(l_cls_vect, PORTS_PER_MCS)) ,\n \"Failed to set CAS latency attribute\");\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Sets frequency attributes\n\/\/\/ @param[in] i_target the controller target\n\/\/\/ @param[in] i_dimm_freq vector of freqs selected dimm freq in MT\/s\n\/\/\/ @return FAPI2_RC_SUCCESS iff ok\n\/\/\/\ninline fapi2::ReturnCode set_freq_attrs(const fapi2::Target<fapi2::TARGET_TYPE_MCBIST>& i_target,\n const std::vector<uint64_t>& i_dimm_freq)\n{\n \/\/ Find the minimum (but non-0) freq in the vector. If we see all 0's we'll write a 0. However,\n \/\/ we shouldn't as the caller should have been dealing with no DIMM before we got here.\n uint64_t l_final_freq = UINT64_MAX;\n\n for (const auto l_freq : i_dimm_freq)\n {\n if (l_freq != 0)\n {\n l_final_freq = std::min(l_final_freq, l_freq);\n }\n }\n\n \/\/ If we saw all 0's, write a 0.\n l_final_freq = l_final_freq == UINT64_MAX ? 0 : l_final_freq;\n\n FAPI_INF( \"Final Chosen Frequency: %d (%s)\", l_final_freq, mss::c_str(i_target) );\n\n FAPI_TRY(FAPI_ATTR_SET(fapi2::ATTR_MSS_FREQ, i_target, l_final_freq),\n \"Failed to set mss freq attribute\");\n\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n}\/\/ mss namespace\n\n\ntypedef fapi2::ReturnCode (*p9_mss_freq_FP_t) (const fapi2::Target<fapi2::TARGET_TYPE_MCS>&);\n\nextern \"C\"\n{\n\n \/\/\/\n \/\/\/ @brief Calculate and save off DIMM frequencies\n \/\/\/ @param[in] i_target the controller (e.g., MCS)\n \/\/\/ @return FAPI2_RC_SUCCESS iff ok\n \/\/\/\n fapi2::ReturnCode p9_mss_freq( const fapi2::Target<fapi2::TARGET_TYPE_MCS>& i_target);\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/**\r\n * Provides the AssetManager class in the GQE namespace which is responsible\r\n * for providing the Asset management facilities to the App base class used in\r\n * the GQE core library.\r\n *\r\n * @file include\/GQE\/Core\/classes\/AssetManager.hpp\r\n * @author Ryan Lindeman\r\n * @date 20100723 - Initial Release\r\n * @date 20110127 - Moved to GQE Core library and include directory\r\n * @date 20110131 - Added class and method argument documentation\r\n *\/\r\n#ifndef CORE_ASSET_MANAGER_HPP_INCLUDED\r\n#define CORE_ASSET_MANAGER_HPP_INCLUDED\r\n \r\n#include <map>\r\n#include <string>\r\n#include \"GQE\/Core\/Core_types.hpp\"\r\n#include <SFML\/Graphics.hpp>\r\n#include <SFML\/System.hpp>\r\n \r\nnamespace GQE\r\n{\r\n \/\/\/ Provides centralized game asset manager class for managing game assets.\r\n class GQE_API AssetManager\r\n {\r\n public:\r\n \/\/\/ Enumeration for all Asset Type values\r\n enum AssetType {\r\n FirstStandardAsset = 0, \/\/\/< First Standard Asset Type Value\r\n AssetFont = 1, \/\/\/< Font Asset Type\r\n AssetImage = 2, \/\/\/< Image\/Texture Asset Type\r\n AssetMusic = 3, \/\/\/< Background Music Asset Type\r\n AssetSound = 4, \/\/\/< Sound Effect Asset Type\r\n AssetLevel = 5, \/\/\/< Level\/Map Asset Type\r\n LastStandardAsset, \/\/\/< Last Standard Asset Type Value\r\n \r\n \/\/ The following can be used for custom assets\r\n FirstCustomAsset = 10, \/\/\/< First Custom Asset Type value\r\n AssetCustom1 = 11, \/\/\/< Custom Asset Type 1\r\n AssetCustom2 = 12, \/\/\/< Custom Asset Type 2\r\n AssetCustom3 = 13, \/\/\/< Custom Asset Type 3\r\n AssetCustom4 = 14, \/\/\/< Custom Asset Type 4\r\n AssetCustom5 = 15, \/\/\/< Custom Asset Type 5\r\n LastCustomAsset, \/\/\/< Last Custom Asset Type Value\r\n };\r\n \r\n \/**\r\n * AssetManager constructor\r\n *\/\r\n AssetManager();\r\n \r\n \/**\r\n * AssetManager deconstructor\r\n *\/\r\n virtual ~AssetManager();\r\n \r\n \/**\r\n * RegisterApp will register a pointer to the App class so it can be used\r\n * by the AssetManager for error handling and log reporting.\r\n * @param[in] theApp is a pointer to the App (or App derived) class\r\n *\/\r\n void RegisterApp(App* theApp);\r\n \r\n \/**\r\n * LoadAssets will attempt to load all of the assets that have not been\r\n * loaded in either the foreground or background depending on\r\n * theBackgroundFlag provided.\r\n * @param[in] theBackgroundFlag means load assets in the background\r\n *\/\r\n void LoadAssets(bool theBackgroundFlag = false);\r\n \r\n \/**\r\n * IsLoading() will return true if the background thread is currently\r\n * loading the Background loading style assets.\r\n * @return true if background thread is still running\r\n *\/\r\n bool IsLoading(void);\r\n \r\n \/**\r\n * AddFont will add a FontAsset object if the FontAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * FontAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the FontAsset that was added\r\n *\/\r\n FontAsset* AddFont(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * UnloadFont will unload the font asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the FontAsset to unload\r\n *\/\r\n void UnloadFont(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * GetFont will retrieve the font asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the FontAsset to be retrieved\r\n * @return pointer to FontAsset or NULL if it doesn't yet exist\r\n *\/\r\n FontAsset* GetFont(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddImage will add a ImageAsset object if the ImageAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * ImageAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the ImageAsset that was added\r\n *\/\r\n ImageAsset* AddImage(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetImage will retrieve the image asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ImageAsset to be retrieved\r\n * @return pointer to ImageAsset or NULL if it doesn't yet exist\r\n *\/\r\n ImageAsset* GetImage(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * GetSprite will return a sprite object for the image asset specified by\r\n * theAssetID. The caller is responsible for this object and must delete\r\n * this object when he is through with it.\r\n * @param[in] theAssetID is the ID for the ImageAsset to be retrieved\r\n * @return pointer to sf::Sprite or NULL if image was not found\r\n *\/\r\n sf::Sprite* GetSprite(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadImage will unload the image asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ImageAsset to unload\r\n *\/\r\n void UnloadImage(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddMusic will add a MusicAsset object if the MusicAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * MusicAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the MusicAsset that was added\r\n *\/\r\n MusicAsset* AddMusic(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetMusic will retrieve the music asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the MusicAsset to be retrieved\r\n * @return pointer to MusicAsset or NULL if it doesn't yet exist\r\n *\/\r\n MusicAsset* GetMusic(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadMusic will unload the music asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the MusicAsset to unload\r\n *\/\r\n void UnloadMusic(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddSound will add a SoundAsset object if the SoundAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * SoundAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the FontAsset that was added\r\n *\/\r\n SoundAsset* AddSound(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetSound will retrieve the sound asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the SoundAsset to be retrieved\r\n * @return pointer to SoundAsset or NULL if it doesn't yet exist\r\n *\/\r\n SoundAsset* GetSound(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadSound will unload the sound asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the SoundAsset to unload\r\n *\/\r\n void UnloadSound(const typeAssetID theAssetID);\r\n \r\n private:\r\n \/\/ Constants\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \r\n \/\/ Variables\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/\/ Pointer to the App class for error handling and logging\r\n App* mApp;\r\n \/\/\/ Boolean indicating that the Background loading thread is running\r\n bool mBackgroundLoading;\r\n \/\/\/ Background loading thread\r\n sf::Thread* mBackgroundThread;\r\n \/\/\/ Background loading thread mutex\r\n sf::Mutex mBackgroundMutex;\r\n \/\/\/ Map to store all the Font assets\r\n std::map<const typeAssetID, FontAsset*> mFonts;\r\n \/\/\/ Map to store all the Image\/Texture assets\r\n std::map<const typeAssetID, ImageAsset*> mImages;\r\n \/\/\/ Map to store all the Sound assets\r\n std::map<const typeAssetID, SoundAsset*> mSounds;\r\n \/\/\/ Map to store all the Music assets\r\n std::map<const typeAssetID, MusicAsset*> mMusic;\r\n \r\n \/**\r\n * AssetManager copy constructor is private because we do not allow copies\r\n * of our class\r\n *\/\r\n AssetManager(const AssetManager&); \/\/ Intentionally undefined\r\n \r\n \/**\r\n * Our assignment operator is private because we do not allow copies\r\n * of our class\r\n *\/\r\n AssetManager& operator=(const AssetManager&); \/\/ Intentionally undefined\r\n \r\n \/**\r\n * BackgroundLoop is the method that will be called when the background\r\n * thread is currently running.\r\n * @param[in] theAssetManager is a pointer to the AssetManager class\r\n *\/\r\n static void BackgroundLoop(void* theAssetManager);\r\n \r\n \/**\r\n * DeleteFonts will delete all added font assets.\r\n *\/\r\n void DeleteFonts(void);\r\n \r\n \/**\r\n * LoadFonts will load all the fonts that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadFonts(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteImages will delete all added image assets.\r\n *\/\r\n void DeleteImages(void);\r\n \r\n \/**\r\n * LoadImages will load all the images that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadImages(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteMusic will delete all added music assets.\r\n *\/\r\n void DeleteMusic(void);\r\n \r\n \/**\r\n * LoadMusic will load all the music that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadMusic(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteSound will delete all added sound assets.\r\n *\/\r\n void DeleteSounds(void);\r\n \r\n \/**\r\n * LoadSounds will load all the sounds that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadSounds(AssetLoadingStyle theStyle);\r\n \r\n }; \/\/ class AssetManager\r\n}; \/\/ namespace GQE\r\n \r\n#endif \/\/ CORE_ASSET_MANAGER_HPP_INCLUDED\r\n\r\n\/**\r\n * @class GQE::AssetManager\r\n * @ingroup Core\r\n * The AssetManager class provides a central class for managing game\r\n * application assets. Assets might include but are not limited to:\r\n * Fonts, Images, Music, Sounds, etc. The AssetManager collects a\r\n * list of requested game assets and allows the background loading of\r\n * these assets as necessary. The AssetManager can also load these\r\n * assets in the foreground if specified. The AssetManager also\r\n * manages the removal of shared assets as soon as it becomes clear that\r\n * the game asset is no longer in use by using internal reference counts\r\n * for each game asset requested.\r\n *\r\n * Copyright (c) 2010-2011 Ryan Lindeman\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n *\r\n * The above copyright notice and this permission notice shall be included in\r\n * all copies or substantial portions of the Software.\r\n *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n * THE SOFTWARE.\r\n *\/\r\n<commit_msg>Add ConfigAsset handling to AssetManager class<commit_after>\/**\r\n * Provides the AssetManager class in the GQE namespace which is responsible\r\n * for providing the Asset management facilities to the App base class used in\r\n * the GQE core library.\r\n *\r\n * @file include\/GQE\/Core\/classes\/AssetManager.hpp\r\n * @author Ryan Lindeman\r\n * @date 20100723 - Initial Release\r\n * @date 20110127 - Moved to GQE Core library and include directory\r\n * @date 20110131 - Added class and method argument documentation\r\n * @date 20110218 - Added new Config asset type\r\n *\/\r\n#ifndef CORE_ASSET_MANAGER_HPP_INCLUDED\r\n#define CORE_ASSET_MANAGER_HPP_INCLUDED\r\n \r\n#include <map>\r\n#include <string>\r\n#include \"GQE\/Core\/Core_types.hpp\"\r\n#include <SFML\/Graphics.hpp>\r\n#include <SFML\/System.hpp>\r\n \r\nnamespace GQE\r\n{\r\n \/\/\/ Provides centralized game asset manager class for managing game assets.\r\n class GQE_API AssetManager\r\n {\r\n public:\r\n \/\/\/ Enumeration for all Asset Type values\r\n enum AssetType {\r\n FirstStandardAsset = 0, \/\/\/< First Standard Asset Type Value\r\n AssetConfig = 1, \/\/\/< Config file Asset Type\r\n AssetFont = 2, \/\/\/< Font Asset Type\r\n AssetImage = 3, \/\/\/< Image\/Texture Asset Type\r\n AssetMusic = 4, \/\/\/< Background Music Asset Type\r\n AssetScript = 5, \/\/\/< Script Asset Type\r\n AssetSound = 6, \/\/\/< Sound Effect Asset Type\r\n AssetLevel = 7, \/\/\/< Level\/Map Asset Type\r\n LastStandardAsset, \/\/\/< Last Standard Asset Type Value\r\n \r\n \/\/ The following can be used for custom assets\r\n FirstCustomAsset = 10, \/\/\/< First Custom Asset Type value\r\n AssetCustom1 = 11, \/\/\/< Custom Asset Type 1\r\n AssetCustom2 = 12, \/\/\/< Custom Asset Type 2\r\n AssetCustom3 = 13, \/\/\/< Custom Asset Type 3\r\n AssetCustom4 = 14, \/\/\/< Custom Asset Type 4\r\n AssetCustom5 = 15, \/\/\/< Custom Asset Type 5\r\n LastCustomAsset, \/\/\/< Last Custom Asset Type Value\r\n };\r\n \r\n \/**\r\n * AssetManager constructor\r\n *\/\r\n AssetManager();\r\n \r\n \/**\r\n * AssetManager deconstructor\r\n *\/\r\n virtual ~AssetManager();\r\n \r\n \/**\r\n * RegisterApp will register a pointer to the App class so it can be used\r\n * by the AssetManager for error handling and log reporting.\r\n * @param[in] theApp is a pointer to the App (or App derived) class\r\n *\/\r\n void RegisterApp(App* theApp);\r\n \r\n \/**\r\n * LoadAssets will attempt to load all of the assets that have not been\r\n * loaded in either the foreground or background depending on\r\n * theBackgroundFlag provided.\r\n * @param[in] theBackgroundFlag means load assets in the background\r\n *\/\r\n void LoadAssets(bool theBackgroundFlag = false);\r\n \r\n \/**\r\n * IsLoading() will return true if the background thread is currently\r\n * loading the Background loading style assets.\r\n * @return true if background thread is still running\r\n *\/\r\n bool IsLoading(void);\r\n\r\n \/**\r\n * AddConfig will add a ConfigAsset object if the ConfigAsset object does\r\n * not yet exist, otherwise it will return a pointer to the existing\r\n * ConfigAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the ConfigAsset that was added\r\n *\/\r\n ConfigAsset* AddConfig(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n\r\n \/**\r\n * UnloadConfig will unload the Config asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ConfigAsset to unload\r\n *\/\r\n void UnloadConfig(const typeAssetID theAssetID);\r\n\r\n \/**\r\n * GetConfig will retrieve the Config asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ConfigAsset to be retrieved\r\n * @return pointer to ConfigAsset or NULL if it doesn't yet exist\r\n *\/\r\n ConfigAsset* GetConfig(const typeAssetID theAssetID);\r\n\r\n \/**\r\n * AddFont will add a FontAsset object if the FontAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * FontAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the FontAsset that was added\r\n *\/\r\n FontAsset* AddFont(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * UnloadFont will unload the font asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the FontAsset to unload\r\n *\/\r\n void UnloadFont(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * GetFont will retrieve the font asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the FontAsset to be retrieved\r\n * @return pointer to FontAsset or NULL if it doesn't yet exist\r\n *\/\r\n FontAsset* GetFont(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddImage will add a ImageAsset object if the ImageAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * ImageAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the ImageAsset that was added\r\n *\/\r\n ImageAsset* AddImage(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetImage will retrieve the image asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ImageAsset to be retrieved\r\n * @return pointer to ImageAsset or NULL if it doesn't yet exist\r\n *\/\r\n ImageAsset* GetImage(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * GetSprite will return a sprite object for the image asset specified by\r\n * theAssetID. The caller is responsible for this object and must delete\r\n * this object when he is through with it.\r\n * @param[in] theAssetID is the ID for the ImageAsset to be retrieved\r\n * @return pointer to sf::Sprite or NULL if image was not found\r\n *\/\r\n sf::Sprite* GetSprite(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadImage will unload the image asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the ImageAsset to unload\r\n *\/\r\n void UnloadImage(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddMusic will add a MusicAsset object if the MusicAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * MusicAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the MusicAsset that was added\r\n *\/\r\n MusicAsset* AddMusic(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetMusic will retrieve the music asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the MusicAsset to be retrieved\r\n * @return pointer to MusicAsset or NULL if it doesn't yet exist\r\n *\/\r\n MusicAsset* GetMusic(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadMusic will unload the music asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the MusicAsset to unload\r\n *\/\r\n void UnloadMusic(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * AddSound will add a SoundAsset object if the SoundAsset object does not\r\n * yet exist, otherwise it will return a pointer to the existing\r\n * SoundAsset.\r\n * @param[in] theAssetID is the ID for the asset to be added\r\n * @param[in] theFilename to use for loading this asset\r\n * @param[in] theStyle is the Loading style to use for this asset\r\n * @return pointer to the FontAsset that was added\r\n *\/\r\n SoundAsset* AddSound(\r\n const typeAssetID theAssetID,\r\n const std::string theFilename = \"\",\r\n AssetLoadingStyle theStyle = AssetLoadStyleBackground);\r\n \r\n \/**\r\n * GetSound will retrieve the sound asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the SoundAsset to be retrieved\r\n * @return pointer to SoundAsset or NULL if it doesn't yet exist\r\n *\/\r\n SoundAsset* GetSound(const typeAssetID theAssetID);\r\n \r\n \/**\r\n * UnloadSound will unload the sound asset specified by theAssetID.\r\n * @param[in] theAssetID is the ID for the SoundAsset to unload\r\n *\/\r\n void UnloadSound(const typeAssetID theAssetID);\r\n \r\n private:\r\n \/\/ Constants\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \r\n \/\/ Variables\r\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\r\n \/\/\/ Pointer to the App class for error handling and logging\r\n App* mApp;\r\n \/\/\/ Boolean indicating that the Background loading thread is running\r\n bool mBackgroundLoading;\r\n \/\/\/ Background loading thread\r\n sf::Thread* mBackgroundThread;\r\n \/\/\/ Background loading thread mutex\r\n sf::Mutex mBackgroundMutex;\r\n \/\/\/ Map to store all the Config assets\r\n std::map<const typeAssetID, ConfigAsset*> mConfigs;\r\n \/\/\/ Map to store all the Font assets\r\n std::map<const typeAssetID, FontAsset*> mFonts;\r\n \/\/\/ Map to store all the Image\/Texture assets\r\n std::map<const typeAssetID, ImageAsset*> mImages;\r\n \/\/\/ Map to store all the Sound assets\r\n std::map<const typeAssetID, SoundAsset*> mSounds;\r\n \/\/\/ Map to store all the Music assets\r\n std::map<const typeAssetID, MusicAsset*> mMusic;\r\n \r\n \/**\r\n * AssetManager copy constructor is private because we do not allow copies\r\n * of our class\r\n *\/\r\n AssetManager(const AssetManager&); \/\/ Intentionally undefined\r\n \r\n \/**\r\n * Our assignment operator is private because we do not allow copies\r\n * of our class\r\n *\/\r\n AssetManager& operator=(const AssetManager&); \/\/ Intentionally undefined\r\n \r\n \/**\r\n * BackgroundLoop is the method that will be called when the background\r\n * thread is currently running.\r\n * @param[in] theAssetManager is a pointer to the AssetManager class\r\n *\/\r\n static void BackgroundLoop(void* theAssetManager);\r\n\r\n \/**\r\n * DeleteConfigs will delete all added Config assets.\r\n *\/\r\n void DeleteConfigs(void);\r\n\r\n \/**\r\n * LoadConfigs will load all the config that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadConfigs(AssetLoadingStyle theStyle);\r\n\r\n \/**\r\n * DeleteFonts will delete all added font assets.\r\n *\/\r\n void DeleteFonts(void);\r\n \r\n \/**\r\n * LoadFonts will load all the fonts that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadFonts(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteImages will delete all added image assets.\r\n *\/\r\n void DeleteImages(void);\r\n \r\n \/**\r\n * LoadImages will load all the images that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadImages(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteMusic will delete all added music assets.\r\n *\/\r\n void DeleteMusic(void);\r\n \r\n \/**\r\n * LoadMusic will load all the music that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadMusic(AssetLoadingStyle theStyle);\r\n \r\n \/**\r\n * DeleteSound will delete all added sound assets.\r\n *\/\r\n void DeleteSounds(void);\r\n \r\n \/**\r\n * LoadSounds will load all the sounds that match theStyle specified.\r\n * @param[in] theStyle that equals the loading style of the unloaded assets\r\n *\/\r\n void LoadSounds(AssetLoadingStyle theStyle);\r\n \r\n }; \/\/ class AssetManager\r\n}; \/\/ namespace GQE\r\n \r\n#endif \/\/ CORE_ASSET_MANAGER_HPP_INCLUDED\r\n\r\n\/**\r\n * @class GQE::AssetManager\r\n * @ingroup Core\r\n * The AssetManager class provides a central class for managing game\r\n * application assets. Assets might include but are not limited to:\r\n * Fonts, Images, Music, Sounds, etc. The AssetManager collects a\r\n * list of requested game assets and allows the background loading of\r\n * these assets as necessary. The AssetManager can also load these\r\n * assets in the foreground if specified. The AssetManager also\r\n * manages the removal of shared assets as soon as it becomes clear that\r\n * the game asset is no longer in use by using internal reference counts\r\n * for each game asset requested.\r\n *\r\n * Copyright (c) 2010-2011 Ryan Lindeman\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n *\r\n * The above copyright notice and this permission notice shall be included in\r\n * all copies or substantial portions of the Software.\r\n *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n * THE SOFTWARE.\r\n *\/\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the AzerothCore Project. See AUTHORS file for Copyright information\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the\n * Free Software Foundation; either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"MapBuilder.h\"\n#include \"PathCommon.h\"\n#include \"Timer.h\"\n#include \"DBCFileLoader.h\"\n#include \"PathCommon.h\"\n#include <boost\/filesystem.hpp>\n#include <unordered_map>\n\nusing namespace MMAP;\n\nnamespace\n{\n std::unordered_map<uint32, uint8> _liquidTypes;\n}\n\nuint32 GetLiquidFlags(uint32 liquidId)\n{\n auto itr = _liquidTypes.find(liquidId);\n return itr != _liquidTypes.end() ? (1 << itr->second) : 0;\n}\n\nbool checkDirectories(bool debugOutput)\n{\n std::vector<std::string> dirFiles;\n\n if (getDirContents(dirFiles, \"maps\") == LISTFILE_DIRECTORY_NOT_FOUND || dirFiles.empty())\n {\n printf(\"'maps' directory is empty or does not exist\\n\");\n return false;\n }\n\n dirFiles.clear();\n if (getDirContents(dirFiles, \"vmaps\", \"*.vmtree\") == LISTFILE_DIRECTORY_NOT_FOUND || dirFiles.empty())\n {\n printf(\"'vmaps' directory is empty or does not exist\\n\");\n return false;\n }\n\n dirFiles.clear();\n if (getDirContents(dirFiles, \"mmaps\") == LISTFILE_DIRECTORY_NOT_FOUND)\n {\n return boost::filesystem::create_directory(\"mmaps\");\n }\n\n dirFiles.clear();\n if (debugOutput)\n {\n if (getDirContents(dirFiles, \"meshes\") == LISTFILE_DIRECTORY_NOT_FOUND)\n {\n printf(\"'meshes' directory does not exist (no place to put debugOutput files)\\n\");\n return false;\n }\n }\n\n return true;\n}\n\nbool handleArgs(int argc, char** argv,\n int& mapnum,\n int& tileX,\n int& tileY,\n Optional<float>& maxAngle,\n Optional<float>& maxAngleNotSteep,\n bool& skipLiquid,\n bool& skipContinents,\n bool& skipJunkMaps,\n bool& skipBattlegrounds,\n bool& debugOutput,\n bool& silent,\n bool& bigBaseUnit,\n char*& offMeshInputPath,\n char*& file,\n unsigned int& threads)\n{\n char* param = nullptr;\n for (int i = 1; i < argc; ++i)\n {\n if (strcmp(argv[i], \"--maxAngle\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n float maxangle = atof(param);\n if (maxangle <= 90.f && maxangle >= 0.f)\n maxAngle = maxangle;\n else\n printf(\"invalid option for '--maxAngle', using default\\n\");\n }\n else if (strcmp(argv[i], \"--maxAngleNotSteep\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n float maxangle = atof(param);\n if (maxangle <= 90.f && maxangle >= 0.f)\n maxAngleNotSteep = maxangle;\n else\n printf(\"invalid option for '--maxAngleNotSteep', using default\\n\");\n }\n else if (strcmp(argv[i], \"--threads\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n threads = static_cast<unsigned int>(std::max(0, atoi(param)));\n }\n else if (strcmp(argv[i], \"--file\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n file = param;\n }\n else if (strcmp(argv[i], \"--tile\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n char* stileX = strtok(param, \",\");\n char* stileY = strtok(nullptr, \",\");\n int tilex = atoi(stileX);\n int tiley = atoi(stileY);\n\n if ((tilex > 0 && tilex < 64) || (tilex == 0 && strcmp(stileX, \"0\") == 0))\n tileX = tilex;\n if ((tiley > 0 && tiley < 64) || (tiley == 0 && strcmp(stileY, \"0\") == 0))\n tileY = tiley;\n\n if (tileX < 0 || tileY < 0)\n {\n printf(\"invalid tile coords.\\n\");\n return false;\n }\n }\n else if (strcmp(argv[i], \"--skipLiquid\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipLiquid = true;\n else if (strcmp(param, \"false\") == 0)\n skipLiquid = false;\n else\n printf(\"invalid option for '--skipLiquid', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipContinents\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipContinents = true;\n else if (strcmp(param, \"false\") == 0)\n skipContinents = false;\n else\n printf(\"invalid option for '--skipContinents', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipJunkMaps\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipJunkMaps = true;\n else if (strcmp(param, \"false\") == 0)\n skipJunkMaps = false;\n else\n printf(\"invalid option for '--skipJunkMaps', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipBattlegrounds\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipBattlegrounds = true;\n else if (strcmp(param, \"false\") == 0)\n skipBattlegrounds = false;\n else\n printf(\"invalid option for '--skipBattlegrounds', using default\\n\");\n }\n else if (strcmp(argv[i], \"--debugOutput\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n debugOutput = true;\n else if (strcmp(param, \"false\") == 0)\n debugOutput = false;\n else\n printf(\"invalid option for '--debugOutput', using default true\\n\");\n }\n else if (strcmp(argv[i], \"--silent\") == 0)\n {\n silent = true;\n }\n else if (strcmp(argv[i], \"--bigBaseUnit\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n bigBaseUnit = true;\n else if (strcmp(param, \"false\") == 0)\n bigBaseUnit = false;\n else\n printf(\"invalid option for '--bigBaseUnit', using default false\\n\");\n }\n else if (strcmp(argv[i], \"--offMeshInput\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n offMeshInputPath = param;\n }\n else\n {\n int map = atoi(argv[i]);\n if (map > 0 || (map == 0 && (strcmp(argv[i], \"0\") == 0)))\n mapnum = map;\n else\n {\n printf(\"invalid map id\\n\");\n return false;\n }\n }\n }\n\n return true;\n}\n\nint finish(const char* message, int returnValue)\n{\n printf(\"%s\", message);\n getchar(); \/\/ Wait for user input\n return returnValue;\n}\n\nstd::unordered_map<uint32, uint8> LoadLiquid()\n{\n DBCFileLoader liquidDbc;\n std::unordered_map<uint32, uint8> liquidData;\n \/\/ format string doesnt matter as long as it has correct length (only used for mapping to structures in worldserver)\n if (liquidDbc.Load((boost::filesystem::path(\"dbc\") \/ \"LiquidType.dbc\").string().c_str(), \"nxxixixxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\"))\n {\n for (uint32 x = 0; x < liquidDbc.GetNumRows(); ++x)\n {\n DBCFileLoader::Record record = liquidDbc.getRecord(x);\n liquidData[record.getUInt(0)] = record.getUInt(3);\n }\n }\n\n return liquidData;\n}\n\nint main(int argc, char** argv)\n{\n unsigned int threads = std::thread::hardware_concurrency();\n int mapnum = -1;\n int tileX = -1, tileY = -1;\n Optional<float> maxAngle, maxAngleNotSteep;\n bool skipLiquid = false,\n skipContinents = false,\n skipJunkMaps = true,\n skipBattlegrounds = false,\n debugOutput = false,\n silent = false,\n bigBaseUnit = false;\n char* offMeshInputPath = nullptr;\n char* file = nullptr;\n\n bool validParam = handleArgs(argc, argv, mapnum,\n tileX, tileY, maxAngle, maxAngleNotSteep,\n skipLiquid, skipContinents, skipJunkMaps, skipBattlegrounds,\n debugOutput, silent, bigBaseUnit, offMeshInputPath, file, threads);\n\n if (!validParam)\n return silent ? -1 : finish(\"You have specified invalid parameters\", -1);\n\n if (mapnum == -1 && debugOutput)\n {\n if (silent)\n return -2;\n\n printf(\"You have specifed debug output, but didn't specify a map to generate.\\n\");\n printf(\"This will generate debug output for ALL maps.\\n\");\n printf(\"Are you sure you want to continue? (y\/n) \");\n if (getchar() != 'y')\n return 0;\n }\n\n if (!checkDirectories(debugOutput))\n return silent ? -3 : finish(\"Press ENTER to close...\", -3);\n\n _liquidTypes = LoadLiquid();\n if (_liquidTypes.empty())\n {\n return silent ? -5 : finish(\"Failed to load LiquidType.dbc\", -5);\n }\n\n MapBuilder builder(maxAngle, maxAngleNotSteep, skipLiquid, skipContinents, skipJunkMaps,\n skipBattlegrounds, debugOutput, bigBaseUnit, mapnum, offMeshInputPath, threads);\n\n uint32 start = getMSTime();\n if (file)\n builder.buildMeshFromFile(file);\n else if (tileX > -1 && tileY > -1 && mapnum >= 0)\n builder.buildSingleTile(mapnum, tileX, tileY);\n else if (mapnum >= 0)\n builder.buildMaps(uint32(mapnum));\n else\n builder.buildMaps({});\n\n if (!silent)\n printf(\"Finished. MMAPS were built in %u ms!\\n\", GetMSTimeDiffToNow(start));\n return 0;\n}\n<commit_msg>feat(Tools\/MMAPs): Output the time spent in a human readable format (#11574)<commit_after>\/*\n * This file is part of the AzerothCore Project. See AUTHORS file for Copyright information\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Affero General Public License as published by the\n * Free Software Foundation; either version 3 of the License, or (at your\n * option) any later version.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"MapBuilder.h\"\n#include \"PathCommon.h\"\n#include \"Timer.h\"\n#include \"DBCFileLoader.h\"\n#include \"PathCommon.h\"\n#include \"Util.h\"\n#include <boost\/filesystem.hpp>\n#include <unordered_map>\n\nusing namespace MMAP;\n\nnamespace\n{\n std::unordered_map<uint32, uint8> _liquidTypes;\n}\n\nuint32 GetLiquidFlags(uint32 liquidId)\n{\n auto itr = _liquidTypes.find(liquidId);\n return itr != _liquidTypes.end() ? (1 << itr->second) : 0;\n}\n\nbool checkDirectories(bool debugOutput)\n{\n std::vector<std::string> dirFiles;\n\n if (getDirContents(dirFiles, \"maps\") == LISTFILE_DIRECTORY_NOT_FOUND || dirFiles.empty())\n {\n printf(\"'maps' directory is empty or does not exist\\n\");\n return false;\n }\n\n dirFiles.clear();\n if (getDirContents(dirFiles, \"vmaps\", \"*.vmtree\") == LISTFILE_DIRECTORY_NOT_FOUND || dirFiles.empty())\n {\n printf(\"'vmaps' directory is empty or does not exist\\n\");\n return false;\n }\n\n dirFiles.clear();\n if (getDirContents(dirFiles, \"mmaps\") == LISTFILE_DIRECTORY_NOT_FOUND)\n {\n return boost::filesystem::create_directory(\"mmaps\");\n }\n\n dirFiles.clear();\n if (debugOutput)\n {\n if (getDirContents(dirFiles, \"meshes\") == LISTFILE_DIRECTORY_NOT_FOUND)\n {\n printf(\"'meshes' directory does not exist (no place to put debugOutput files)\\n\");\n return false;\n }\n }\n\n return true;\n}\n\nbool handleArgs(int argc, char** argv,\n int& mapnum,\n int& tileX,\n int& tileY,\n Optional<float>& maxAngle,\n Optional<float>& maxAngleNotSteep,\n bool& skipLiquid,\n bool& skipContinents,\n bool& skipJunkMaps,\n bool& skipBattlegrounds,\n bool& debugOutput,\n bool& silent,\n bool& bigBaseUnit,\n char*& offMeshInputPath,\n char*& file,\n unsigned int& threads)\n{\n char* param = nullptr;\n for (int i = 1; i < argc; ++i)\n {\n if (strcmp(argv[i], \"--maxAngle\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n float maxangle = atof(param);\n if (maxangle <= 90.f && maxangle >= 0.f)\n maxAngle = maxangle;\n else\n printf(\"invalid option for '--maxAngle', using default\\n\");\n }\n else if (strcmp(argv[i], \"--maxAngleNotSteep\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n float maxangle = atof(param);\n if (maxangle <= 90.f && maxangle >= 0.f)\n maxAngleNotSteep = maxangle;\n else\n printf(\"invalid option for '--maxAngleNotSteep', using default\\n\");\n }\n else if (strcmp(argv[i], \"--threads\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n threads = static_cast<unsigned int>(std::max(0, atoi(param)));\n }\n else if (strcmp(argv[i], \"--file\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n file = param;\n }\n else if (strcmp(argv[i], \"--tile\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n char* stileX = strtok(param, \",\");\n char* stileY = strtok(nullptr, \",\");\n int tilex = atoi(stileX);\n int tiley = atoi(stileY);\n\n if ((tilex > 0 && tilex < 64) || (tilex == 0 && strcmp(stileX, \"0\") == 0))\n tileX = tilex;\n if ((tiley > 0 && tiley < 64) || (tiley == 0 && strcmp(stileY, \"0\") == 0))\n tileY = tiley;\n\n if (tileX < 0 || tileY < 0)\n {\n printf(\"invalid tile coords.\\n\");\n return false;\n }\n }\n else if (strcmp(argv[i], \"--skipLiquid\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipLiquid = true;\n else if (strcmp(param, \"false\") == 0)\n skipLiquid = false;\n else\n printf(\"invalid option for '--skipLiquid', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipContinents\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipContinents = true;\n else if (strcmp(param, \"false\") == 0)\n skipContinents = false;\n else\n printf(\"invalid option for '--skipContinents', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipJunkMaps\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipJunkMaps = true;\n else if (strcmp(param, \"false\") == 0)\n skipJunkMaps = false;\n else\n printf(\"invalid option for '--skipJunkMaps', using default\\n\");\n }\n else if (strcmp(argv[i], \"--skipBattlegrounds\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n skipBattlegrounds = true;\n else if (strcmp(param, \"false\") == 0)\n skipBattlegrounds = false;\n else\n printf(\"invalid option for '--skipBattlegrounds', using default\\n\");\n }\n else if (strcmp(argv[i], \"--debugOutput\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n debugOutput = true;\n else if (strcmp(param, \"false\") == 0)\n debugOutput = false;\n else\n printf(\"invalid option for '--debugOutput', using default true\\n\");\n }\n else if (strcmp(argv[i], \"--silent\") == 0)\n {\n silent = true;\n }\n else if (strcmp(argv[i], \"--bigBaseUnit\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n if (strcmp(param, \"true\") == 0)\n bigBaseUnit = true;\n else if (strcmp(param, \"false\") == 0)\n bigBaseUnit = false;\n else\n printf(\"invalid option for '--bigBaseUnit', using default false\\n\");\n }\n else if (strcmp(argv[i], \"--offMeshInput\") == 0)\n {\n param = argv[++i];\n if (!param)\n return false;\n\n offMeshInputPath = param;\n }\n else\n {\n int map = atoi(argv[i]);\n if (map > 0 || (map == 0 && (strcmp(argv[i], \"0\") == 0)))\n mapnum = map;\n else\n {\n printf(\"invalid map id\\n\");\n return false;\n }\n }\n }\n\n return true;\n}\n\nint finish(const char* message, int returnValue)\n{\n printf(\"%s\", message);\n getchar(); \/\/ Wait for user input\n return returnValue;\n}\n\nstd::unordered_map<uint32, uint8> LoadLiquid()\n{\n DBCFileLoader liquidDbc;\n std::unordered_map<uint32, uint8> liquidData;\n \/\/ format string doesnt matter as long as it has correct length (only used for mapping to structures in worldserver)\n if (liquidDbc.Load((boost::filesystem::path(\"dbc\") \/ \"LiquidType.dbc\").string().c_str(), \"nxxixixxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx\"))\n {\n for (uint32 x = 0; x < liquidDbc.GetNumRows(); ++x)\n {\n DBCFileLoader::Record record = liquidDbc.getRecord(x);\n liquidData[record.getUInt(0)] = record.getUInt(3);\n }\n }\n\n return liquidData;\n}\n\nint main(int argc, char** argv)\n{\n unsigned int threads = std::thread::hardware_concurrency();\n int mapnum = -1;\n int tileX = -1, tileY = -1;\n Optional<float> maxAngle, maxAngleNotSteep;\n bool skipLiquid = false,\n skipContinents = false,\n skipJunkMaps = true,\n skipBattlegrounds = false,\n debugOutput = false,\n silent = false,\n bigBaseUnit = false;\n char* offMeshInputPath = nullptr;\n char* file = nullptr;\n\n bool validParam = handleArgs(argc, argv, mapnum,\n tileX, tileY, maxAngle, maxAngleNotSteep,\n skipLiquid, skipContinents, skipJunkMaps, skipBattlegrounds,\n debugOutput, silent, bigBaseUnit, offMeshInputPath, file, threads);\n\n if (!validParam)\n return silent ? -1 : finish(\"You have specified invalid parameters\", -1);\n\n if (mapnum == -1 && debugOutput)\n {\n if (silent)\n return -2;\n\n printf(\"You have specifed debug output, but didn't specify a map to generate.\\n\");\n printf(\"This will generate debug output for ALL maps.\\n\");\n printf(\"Are you sure you want to continue? (y\/n) \");\n if (getchar() != 'y')\n return 0;\n }\n\n if (!checkDirectories(debugOutput))\n return silent ? -3 : finish(\"Press ENTER to close...\", -3);\n\n _liquidTypes = LoadLiquid();\n if (_liquidTypes.empty())\n {\n return silent ? -5 : finish(\"Failed to load LiquidType.dbc\", -5);\n }\n\n MapBuilder builder(maxAngle, maxAngleNotSteep, skipLiquid, skipContinents, skipJunkMaps,\n skipBattlegrounds, debugOutput, bigBaseUnit, mapnum, offMeshInputPath, threads);\n\n uint32 start = getMSTime();\n if (file)\n builder.buildMeshFromFile(file);\n else if (tileX > -1 && tileY > -1 && mapnum >= 0)\n builder.buildSingleTile(mapnum, tileX, tileY);\n else if (mapnum >= 0)\n builder.buildMaps(uint32(mapnum));\n else\n builder.buildMaps({});\n\n if (!silent)\n printf(\"Finished. MMAPS were built in %s\\n\", secsToTimeString(GetMSTimeDiffToNow(start) \/ 1000).c_str());\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright 2019 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ TextureUploadBenchmark:\n\/\/ Performance test for uploading texture data.\n\/\/\n\n#include \"ANGLEPerfTest.h\"\n\n#include <iostream>\n#include <random>\n#include <sstream>\n\n#include \"test_utils\/gl_raii.h\"\n#include \"util\/shader_utils.h\"\n\nnamespace angle\n{\nconstexpr unsigned int kIterationsPerStep = 64;\n\nstruct TextureUploadParams final : public RenderTestParams\n{\n TextureUploadParams()\n {\n iterationsPerStep = kIterationsPerStep;\n trackGpuTime = true;\n\n baseSize = 2048;\n subImageSize = 64;\n\n webgl = false;\n }\n\n std::string suffix() const override;\n\n GLsizei baseSize;\n GLsizei subImageSize;\n\n bool webgl;\n};\n\nstd::ostream &operator<<(std::ostream &os, const TextureUploadParams ¶ms)\n{\n os << params.suffix().substr(1);\n return os;\n}\n\nstd::string TextureUploadParams::suffix() const\n{\n std::stringstream strstr;\n\n strstr << RenderTestParams::suffix();\n\n if (webgl)\n {\n strstr << \"_webgl\";\n }\n\n return strstr.str();\n}\n\nclass TextureUploadBenchmarkBase : public ANGLERenderTest,\n public ::testing::WithParamInterface<TextureUploadParams>\n{\n public:\n TextureUploadBenchmarkBase(const char *benchmarkName);\n\n void initializeBenchmark() override;\n void destroyBenchmark() override;\n\n protected:\n void initShaders();\n\n GLuint mProgram;\n GLuint mPositionLoc;\n GLuint mSamplerLoc;\n};\n\nclass TextureUploadSubImageBenchmark : public TextureUploadBenchmarkBase\n{\n public:\n TextureUploadSubImageBenchmark() : TextureUploadBenchmarkBase(\"TexSubImage\")\n {\n addExtensionPrerequisite(\"GL_EXT_texture_storage\");\n }\n\n void drawBenchmark() override;\n};\n\nclass TextureUploadFullMipBenchmark : public TextureUploadBenchmarkBase\n{\n public:\n TextureUploadFullMipBenchmark() : TextureUploadBenchmarkBase(\"TextureUpload\") {}\n\n void drawBenchmark() override;\n};\n\nTextureUploadBenchmarkBase::TextureUploadBenchmarkBase(const char *benchmarkName)\n : ANGLERenderTest(benchmarkName, GetParam()), mProgram(0u), mPositionLoc(-1), mSamplerLoc(-1)\n{\n setWebGLCompatibilityEnabled(GetParam().webgl);\n setRobustResourceInit(GetParam().webgl);\n}\n\nvoid TextureUploadBenchmarkBase::initializeBenchmark()\n{\n const auto ¶ms = GetParam();\n\n initShaders();\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n glViewport(0, 0, getWindow()->getWidth(), getWindow()->getHeight());\n\n if (params.webgl)\n {\n glRequestExtensionANGLE(\"GL_EXT_disjoint_timer_query\");\n }\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadBenchmarkBase::initShaders()\n{\n constexpr char kVS[] = R\"(attribute vec4 a_position;\nvoid main()\n{\n gl_Position = a_position;\n})\";\n\n constexpr char kFS[] = R\"(precision mediump float;\nuniform sampler2D s_texture;\nvoid main()\n{\n gl_FragColor = texture2D(s_texture, vec2(0, 0));\n})\";\n\n mProgram = CompileProgram(kVS, kFS);\n ASSERT_NE(0u, mProgram);\n\n mPositionLoc = glGetAttribLocation(mProgram, \"a_position\");\n mSamplerLoc = glGetUniformLocation(mProgram, \"s_texture\");\n glUseProgram(mProgram);\n\n glDisable(GL_DEPTH_TEST);\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadBenchmarkBase::destroyBenchmark()\n{\n glDeleteProgram(mProgram);\n}\n\nvoid TextureUploadSubImageBenchmark::drawBenchmark()\n{\n const auto ¶ms = GetParam();\n\n std::vector<float> textureData(params.subImageSize * params.subImageSize * 4, 0.5);\n\n GLTexture tex;\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(GL_TEXTURE_2D, tex);\n glTexStorage2DEXT(GL_TEXTURE_2D, 1, GL_RGBA8, params.baseSize, params.baseSize);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n glUniform1i(mSamplerLoc, 0);\n\n ASSERT_GL_NO_ERROR();\n\n startGpuTimer();\n for (unsigned int iteration = 0; iteration < params.iterationsPerStep; ++iteration)\n {\n glTexSubImage2D(GL_TEXTURE_2D, 0, rand() % (params.baseSize - params.subImageSize),\n rand() % (params.baseSize - params.subImageSize), params.subImageSize,\n params.subImageSize, GL_RGBA, GL_UNSIGNED_BYTE, textureData.data());\n\n \/\/ Perform a draw just so the texture data is flushed. With the position attributes not\n \/\/ set, a constant default value is used, resulting in a very cheap draw.\n glDrawArrays(GL_TRIANGLES, 0, 3);\n }\n stopGpuTimer();\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadFullMipBenchmark::drawBenchmark()\n{\n const auto ¶ms = GetParam();\n\n std::vector<float> textureData(params.baseSize * params.baseSize * 4, 0.5);\n\n startGpuTimer();\n for (size_t it = 0; it < params.iterationsPerStep; ++it)\n {\n GLTexture tex;\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(GL_TEXTURE_2D, tex);\n\n \/\/ Stage data for all mips\n GLint mip = 0;\n for (GLsizei levelSize = params.baseSize; levelSize > 0; levelSize >>= 1)\n {\n glTexImage2D(GL_TEXTURE_2D, mip++, GL_RGBA, levelSize, levelSize, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, textureData.data());\n }\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n glUniform1i(mSamplerLoc, 0);\n\n \/\/ Perform a draw just so the texture data is flushed. With the position attributes not\n \/\/ set, a constant default value is used, resulting in a very cheap draw.\n glDrawArrays(GL_TRIANGLES, 0, 3);\n }\n stopGpuTimer();\n\n ASSERT_GL_NO_ERROR();\n}\n\nTextureUploadParams TextureUploadD3D11Params(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::D3D11();\n params.webgl = webglCompat;\n return params;\n}\n\nTextureUploadParams TextureUploadOpenGLOrGLESParams(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::OPENGL_OR_GLES(false);\n params.webgl = webglCompat;\n return params;\n}\n\nTextureUploadParams TextureUploadVulkanParams(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::VULKAN();\n params.webgl = webglCompat;\n return params;\n}\n\nTEST_P(TextureUploadSubImageBenchmark, Run)\n{\n run();\n}\n\nTEST_P(TextureUploadFullMipBenchmark, Run)\n{\n run();\n}\n\nANGLE_INSTANTIATE_TEST(TextureUploadSubImageBenchmark,\n TextureUploadD3D11Params(false),\n TextureUploadD3D11Params(true),\n TextureUploadOpenGLOrGLESParams(false),\n TextureUploadOpenGLOrGLESParams(true),\n TextureUploadVulkanParams(false),\n TextureUploadVulkanParams(true));\n\nANGLE_INSTANTIATE_TEST(TextureUploadFullMipBenchmark,\n TextureUploadD3D11Params(false),\n TextureUploadD3D11Params(true),\n TextureUploadOpenGLOrGLESParams(false),\n TextureUploadOpenGLOrGLESParams(true),\n TextureUploadVulkanParams(false),\n TextureUploadVulkanParams(true));\n} \/\/ namespace angle\n<commit_msg>Fix OOM in TextureUpload perf test<commit_after>\/\/\n\/\/ Copyright 2019 The ANGLE Project Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ TextureUploadBenchmark:\n\/\/ Performance test for uploading texture data.\n\/\/\n\n#include \"ANGLEPerfTest.h\"\n\n#include <iostream>\n#include <random>\n#include <sstream>\n\n#include \"test_utils\/gl_raii.h\"\n#include \"util\/shader_utils.h\"\n\nnamespace angle\n{\nconstexpr unsigned int kIterationsPerStep = 64;\n\nstruct TextureUploadParams final : public RenderTestParams\n{\n TextureUploadParams()\n {\n iterationsPerStep = kIterationsPerStep;\n trackGpuTime = true;\n\n baseSize = 1024;\n subImageSize = 64;\n\n webgl = false;\n }\n\n std::string suffix() const override;\n\n GLsizei baseSize;\n GLsizei subImageSize;\n\n bool webgl;\n};\n\nstd::ostream &operator<<(std::ostream &os, const TextureUploadParams ¶ms)\n{\n os << params.suffix().substr(1);\n return os;\n}\n\nstd::string TextureUploadParams::suffix() const\n{\n std::stringstream strstr;\n\n strstr << RenderTestParams::suffix();\n\n if (webgl)\n {\n strstr << \"_webgl\";\n }\n\n return strstr.str();\n}\n\nclass TextureUploadBenchmarkBase : public ANGLERenderTest,\n public ::testing::WithParamInterface<TextureUploadParams>\n{\n public:\n TextureUploadBenchmarkBase(const char *benchmarkName);\n\n void initializeBenchmark() override;\n void destroyBenchmark() override;\n\n protected:\n void initShaders();\n\n GLuint mProgram;\n GLuint mPositionLoc;\n GLuint mSamplerLoc;\n};\n\nclass TextureUploadSubImageBenchmark : public TextureUploadBenchmarkBase\n{\n public:\n TextureUploadSubImageBenchmark() : TextureUploadBenchmarkBase(\"TexSubImage\")\n {\n addExtensionPrerequisite(\"GL_EXT_texture_storage\");\n }\n\n void drawBenchmark() override;\n};\n\nclass TextureUploadFullMipBenchmark : public TextureUploadBenchmarkBase\n{\n public:\n TextureUploadFullMipBenchmark() : TextureUploadBenchmarkBase(\"TextureUpload\") {}\n\n void drawBenchmark() override;\n};\n\nTextureUploadBenchmarkBase::TextureUploadBenchmarkBase(const char *benchmarkName)\n : ANGLERenderTest(benchmarkName, GetParam()), mProgram(0u), mPositionLoc(-1), mSamplerLoc(-1)\n{\n setWebGLCompatibilityEnabled(GetParam().webgl);\n setRobustResourceInit(GetParam().webgl);\n}\n\nvoid TextureUploadBenchmarkBase::initializeBenchmark()\n{\n const auto ¶ms = GetParam();\n\n initShaders();\n glClearColor(0.0f, 0.0f, 0.0f, 0.0f);\n glViewport(0, 0, getWindow()->getWidth(), getWindow()->getHeight());\n\n if (params.webgl)\n {\n glRequestExtensionANGLE(\"GL_EXT_disjoint_timer_query\");\n }\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadBenchmarkBase::initShaders()\n{\n constexpr char kVS[] = R\"(attribute vec4 a_position;\nvoid main()\n{\n gl_Position = a_position;\n})\";\n\n constexpr char kFS[] = R\"(precision mediump float;\nuniform sampler2D s_texture;\nvoid main()\n{\n gl_FragColor = texture2D(s_texture, vec2(0, 0));\n})\";\n\n mProgram = CompileProgram(kVS, kFS);\n ASSERT_NE(0u, mProgram);\n\n mPositionLoc = glGetAttribLocation(mProgram, \"a_position\");\n mSamplerLoc = glGetUniformLocation(mProgram, \"s_texture\");\n glUseProgram(mProgram);\n\n glDisable(GL_DEPTH_TEST);\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadBenchmarkBase::destroyBenchmark()\n{\n glDeleteProgram(mProgram);\n}\n\nvoid TextureUploadSubImageBenchmark::drawBenchmark()\n{\n const auto ¶ms = GetParam();\n\n std::vector<float> textureData(params.subImageSize * params.subImageSize * 4, 0.5);\n\n GLTexture tex;\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(GL_TEXTURE_2D, tex);\n glTexStorage2DEXT(GL_TEXTURE_2D, 1, GL_RGBA8, params.baseSize, params.baseSize);\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n glUniform1i(mSamplerLoc, 0);\n\n ASSERT_GL_NO_ERROR();\n\n startGpuTimer();\n for (unsigned int iteration = 0; iteration < params.iterationsPerStep; ++iteration)\n {\n glTexSubImage2D(GL_TEXTURE_2D, 0, rand() % (params.baseSize - params.subImageSize),\n rand() % (params.baseSize - params.subImageSize), params.subImageSize,\n params.subImageSize, GL_RGBA, GL_UNSIGNED_BYTE, textureData.data());\n\n \/\/ Perform a draw just so the texture data is flushed. With the position attributes not\n \/\/ set, a constant default value is used, resulting in a very cheap draw.\n glDrawArrays(GL_TRIANGLES, 0, 3);\n }\n stopGpuTimer();\n\n ASSERT_GL_NO_ERROR();\n}\n\nvoid TextureUploadFullMipBenchmark::drawBenchmark()\n{\n const auto ¶ms = GetParam();\n\n std::vector<float> textureData(params.baseSize * params.baseSize * 4, 0.5);\n\n startGpuTimer();\n for (size_t it = 0; it < params.iterationsPerStep; ++it)\n {\n GLTexture tex;\n\n glActiveTexture(GL_TEXTURE0);\n glBindTexture(GL_TEXTURE_2D, tex);\n\n \/\/ Stage data for all mips\n GLint mip = 0;\n for (GLsizei levelSize = params.baseSize; levelSize > 0; levelSize >>= 1)\n {\n glTexImage2D(GL_TEXTURE_2D, mip++, GL_RGBA, levelSize, levelSize, 0, GL_RGBA,\n GL_UNSIGNED_BYTE, textureData.data());\n }\n\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR_MIPMAP_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_EDGE);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_EDGE);\n\n glUniform1i(mSamplerLoc, 0);\n\n \/\/ Perform a draw just so the texture data is flushed. With the position attributes not\n \/\/ set, a constant default value is used, resulting in a very cheap draw.\n glDrawArrays(GL_TRIANGLES, 0, 3);\n }\n stopGpuTimer();\n\n ASSERT_GL_NO_ERROR();\n}\n\nTextureUploadParams TextureUploadD3D11Params(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::D3D11();\n params.webgl = webglCompat;\n return params;\n}\n\nTextureUploadParams TextureUploadOpenGLOrGLESParams(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::OPENGL_OR_GLES(false);\n params.webgl = webglCompat;\n return params;\n}\n\nTextureUploadParams TextureUploadVulkanParams(bool webglCompat)\n{\n TextureUploadParams params;\n params.eglParameters = egl_platform::VULKAN();\n params.webgl = webglCompat;\n return params;\n}\n\nTEST_P(TextureUploadSubImageBenchmark, Run)\n{\n run();\n}\n\nTEST_P(TextureUploadFullMipBenchmark, Run)\n{\n run();\n}\n\nANGLE_INSTANTIATE_TEST(TextureUploadSubImageBenchmark,\n TextureUploadD3D11Params(false),\n TextureUploadD3D11Params(true),\n TextureUploadOpenGLOrGLESParams(false),\n TextureUploadOpenGLOrGLESParams(true),\n TextureUploadVulkanParams(false),\n TextureUploadVulkanParams(true));\n\nANGLE_INSTANTIATE_TEST(TextureUploadFullMipBenchmark,\n TextureUploadD3D11Params(false),\n TextureUploadD3D11Params(true),\n TextureUploadOpenGLOrGLESParams(false),\n TextureUploadOpenGLOrGLESParams(true),\n TextureUploadVulkanParams(false),\n TextureUploadVulkanParams(true));\n} \/\/ namespace angle\n<|endoftext|>"} {"text":"<commit_before>\/\/ Scintilla source code edit control\n\/** @file Style.cxx\n ** Defines the font and colour style for a class of text.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <string.h>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n#include \"Style.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nStyle::Style() {\n\taliasOfDefaultFont = true;\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t Platform::DefaultFontSize(), 0, SC_CHARSET_DEFAULT,\n\t false, false, false, false, caseMixed, true, true, false);\n}\n\nStyle::Style(const Style &source) {\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t 0, 0, 0,\n\t false, false, false, false, caseMixed, true, true, false);\n\tfore.desired = source.fore.desired;\n\tback.desired = source.back.desired;\n\tcharacterSet = source.characterSet;\n\tbold = source.bold;\n\titalic = source.italic;\n\tsize = source.size;\n\teolFilled = source.eolFilled;\n\tunderline = source.underline;\n\tcaseForce = source.caseForce;\n\tvisible = source.visible;\n\tchangeable = source.changeable;\n\thotspot = source.hotspot;\n}\n\nStyle::~Style() {\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\taliasOfDefaultFont = false;\n}\n\nStyle &Style::operator=(const Style &source) {\n\tif (this == &source)\n\t\treturn * this;\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t 0, 0, SC_CHARSET_DEFAULT,\n\t false, false, false, false, caseMixed, true, true, false);\n\tfore.desired = source.fore.desired;\n\tback.desired = source.back.desired;\n\tcharacterSet = source.characterSet;\n\tbold = source.bold;\n\titalic = source.italic;\n\tsize = source.size;\n\teolFilled = source.eolFilled;\n\tunderline = source.underline;\n\tcaseForce = source.caseForce;\n\tvisible = source.visible;\n\tchangeable = source.changeable;\n\treturn *this;\n}\n\nvoid Style::Clear(ColourDesired fore_, ColourDesired back_, int size_,\n const char *fontName_, int characterSet_,\n bool bold_, bool italic_, bool eolFilled_,\n bool underline_, ecaseForced caseForce_,\n\t\t bool visible_, bool changeable_, bool hotspot_) {\n\tfore.desired = fore_;\n\tback.desired = back_;\n\tcharacterSet = characterSet_;\n\tbold = bold_;\n\titalic = italic_;\n\tsize = size_;\n\tfontName = fontName_;\n\teolFilled = eolFilled_;\n\tunderline = underline_;\n\tcaseForce = caseForce_;\n\tvisible = visible_;\n\tchangeable = changeable_;\n\thotspot = hotspot_;\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\taliasOfDefaultFont = false;\n}\n\nvoid Style::ClearTo(const Style &source) {\n\tClear(\n\t\tsource.fore.desired,\n\t\tsource.back.desired,\n\t\tsource.size,\n\t\tsource.fontName,\n\t\tsource.characterSet,\n\t\tsource.bold,\n\t\tsource.italic,\n\t\tsource.eolFilled,\n\t\tsource.underline,\n\t\tsource.caseForce,\n\t\tsource.visible,\n\t\tsource.changeable,\n\t\tsource.hotspot);\n}\n\nbool Style::EquivalentFontTo(const Style *other) const {\n\tif (bold != other->bold ||\n\t italic != other->italic ||\n\t size != other->size ||\n\t characterSet != other->characterSet)\n\t\treturn false;\n\tif (fontName == other->fontName)\n\t\treturn true;\n\tif (!fontName)\n\t\treturn false;\n\tif (!other->fontName)\n\t\treturn false;\n\treturn strcmp(fontName, other->fontName) == 0;\n}\n\nvoid Style::Realise(Surface &surface, int zoomLevel, Style *defaultStyle, int extraFontFlag) {\n\tsizeZoomed = size + zoomLevel;\n\tif (sizeZoomed <= 2)\t\/\/ Hangs if sizeZoomed <= 1\n\t\tsizeZoomed = 2;\n\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\tint deviceHeight = surface.DeviceHeightFont(sizeZoomed);\n\taliasOfDefaultFont = defaultStyle &&\n\t (EquivalentFontTo(defaultStyle) || !fontName);\n\tif (aliasOfDefaultFont) {\n\t\tfont.SetID(defaultStyle->font.GetID());\n\t} else if (fontName) {\n\t\tfont.Create(fontName, characterSet, deviceHeight, bold, italic, extraFontFlag);\n\t} else {\n\t\tfont.SetID(0);\n\t}\n\n\tascent = surface.Ascent(font);\n\tdescent = surface.Descent(font);\n\t\/\/ Probably more typographically correct to include leading\n\t\/\/ but that means more complex drawing as leading must be erased\n\t\/\/lineHeight = surface.ExternalLeading() + surface.Height();\n\texternalLeading = surface.ExternalLeading(font);\n\tlineHeight = surface.Height(font);\n\taveCharWidth = surface.AverageCharWidth(font);\n\tspaceWidth = surface.WidthChar(font, ' ');\n}\n<commit_msg>More members initialised in constructor even though they will be filled in later by Realise.<commit_after>\/\/ Scintilla source code edit control\n\/** @file Style.cxx\n ** Defines the font and colour style for a class of text.\n **\/\n\/\/ Copyright 1998-2001 by Neil Hodgson <neilh@scintilla.org>\n\/\/ The License.txt file describes the conditions under which this software may be distributed.\n\n#include <string.h>\n\n#include \"Platform.h\"\n\n#include \"Scintilla.h\"\n#include \"Style.h\"\n\n#ifdef SCI_NAMESPACE\nusing namespace Scintilla;\n#endif\n\nStyle::Style() {\n\taliasOfDefaultFont = true;\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t Platform::DefaultFontSize(), 0, SC_CHARSET_DEFAULT,\n\t false, false, false, false, caseMixed, true, true, false);\n}\n\nStyle::Style(const Style &source) {\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t 0, 0, 0,\n\t false, false, false, false, caseMixed, true, true, false);\n\tfore.desired = source.fore.desired;\n\tback.desired = source.back.desired;\n\tcharacterSet = source.characterSet;\n\tbold = source.bold;\n\titalic = source.italic;\n\tsize = source.size;\n\teolFilled = source.eolFilled;\n\tunderline = source.underline;\n\tcaseForce = source.caseForce;\n\tvisible = source.visible;\n\tchangeable = source.changeable;\n\thotspot = source.hotspot;\n}\n\nStyle::~Style() {\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\taliasOfDefaultFont = false;\n}\n\nStyle &Style::operator=(const Style &source) {\n\tif (this == &source)\n\t\treturn * this;\n\tClear(ColourDesired(0, 0, 0), ColourDesired(0xff, 0xff, 0xff),\n\t 0, 0, SC_CHARSET_DEFAULT,\n\t false, false, false, false, caseMixed, true, true, false);\n\tfore.desired = source.fore.desired;\n\tback.desired = source.back.desired;\n\tcharacterSet = source.characterSet;\n\tbold = source.bold;\n\titalic = source.italic;\n\tsize = source.size;\n\teolFilled = source.eolFilled;\n\tunderline = source.underline;\n\tcaseForce = source.caseForce;\n\tvisible = source.visible;\n\tchangeable = source.changeable;\n\treturn *this;\n}\n\nvoid Style::Clear(ColourDesired fore_, ColourDesired back_, int size_,\n const char *fontName_, int characterSet_,\n bool bold_, bool italic_, bool eolFilled_,\n bool underline_, ecaseForced caseForce_,\n\t\t bool visible_, bool changeable_, bool hotspot_) {\n\tfore.desired = fore_;\n\tback.desired = back_;\n\tcharacterSet = characterSet_;\n\tbold = bold_;\n\titalic = italic_;\n\tsize = size_;\n\tfontName = fontName_;\n\teolFilled = eolFilled_;\n\tunderline = underline_;\n\tcaseForce = caseForce_;\n\tvisible = visible_;\n\tchangeable = changeable_;\n\thotspot = hotspot_;\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\taliasOfDefaultFont = false;\n\tsizeZoomed = 2;\n\tlineHeight = 2;\n\tascent = 1;\n\tdescent = 1;\n\texternalLeading = 0;\n\taveCharWidth = 1;\n\tspaceWidth = 1;\n}\n\nvoid Style::ClearTo(const Style &source) {\n\tClear(\n\t\tsource.fore.desired,\n\t\tsource.back.desired,\n\t\tsource.size,\n\t\tsource.fontName,\n\t\tsource.characterSet,\n\t\tsource.bold,\n\t\tsource.italic,\n\t\tsource.eolFilled,\n\t\tsource.underline,\n\t\tsource.caseForce,\n\t\tsource.visible,\n\t\tsource.changeable,\n\t\tsource.hotspot);\n}\n\nbool Style::EquivalentFontTo(const Style *other) const {\n\tif (bold != other->bold ||\n\t italic != other->italic ||\n\t size != other->size ||\n\t characterSet != other->characterSet)\n\t\treturn false;\n\tif (fontName == other->fontName)\n\t\treturn true;\n\tif (!fontName)\n\t\treturn false;\n\tif (!other->fontName)\n\t\treturn false;\n\treturn strcmp(fontName, other->fontName) == 0;\n}\n\nvoid Style::Realise(Surface &surface, int zoomLevel, Style *defaultStyle, int extraFontFlag) {\n\tsizeZoomed = size + zoomLevel;\n\tif (sizeZoomed <= 2)\t\/\/ Hangs if sizeZoomed <= 1\n\t\tsizeZoomed = 2;\n\n\tif (aliasOfDefaultFont)\n\t\tfont.SetID(0);\n\telse\n\t\tfont.Release();\n\tint deviceHeight = surface.DeviceHeightFont(sizeZoomed);\n\taliasOfDefaultFont = defaultStyle &&\n\t (EquivalentFontTo(defaultStyle) || !fontName);\n\tif (aliasOfDefaultFont) {\n\t\tfont.SetID(defaultStyle->font.GetID());\n\t} else if (fontName) {\n\t\tfont.Create(fontName, characterSet, deviceHeight, bold, italic, extraFontFlag);\n\t} else {\n\t\tfont.SetID(0);\n\t}\n\n\tascent = surface.Ascent(font);\n\tdescent = surface.Descent(font);\n\t\/\/ Probably more typographically correct to include leading\n\t\/\/ but that means more complex drawing as leading must be erased\n\t\/\/lineHeight = surface.ExternalLeading() + surface.Height();\n\texternalLeading = surface.ExternalLeading(font);\n\tlineHeight = surface.Height(font);\n\taveCharWidth = surface.AverageCharWidth(font);\n\tspaceWidth = surface.WidthChar(font, ' ');\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"vtkBar.h\"\n#include \"vtkBar2.h\"\n#include \"vtkImageFoo.h\"\n\nint main( int argc, char *argv[] )\n{\n vtkBar *bar = vtkBar::New();\n bar->PrintSelf();\n bar->Delete();\n\n vtkBar2 *bar2 = vtkBar2::New();\n bar2->PrintSelf();\n bar2->Delete();\n\n vtkImageFoo *imagefoo = vtkImageFoo::New();\n imagefoo->PrintSelf();\n imagefoo->Delete();\n\n return 0;\n}\n\n\n\n\n<commit_msg>PrintSelf fix<commit_after>#include \"vtkBar.h\"\n#include \"vtkBar2.h\"\n#include \"vtkImageFoo.h\"\n\nint main( int argc, char *argv[] )\n{\n vtkBar *bar = vtkBar::New();\n bar->Print(cout);\n bar->Delete();\n\n vtkBar2 *bar2 = vtkBar2::New();\n bar2->Print(cout);\n bar2->Delete();\n\n vtkImageFoo *imagefoo = vtkImageFoo::New();\n imagefoo->Print(cout);\n imagefoo->Delete();\n\n return 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 The Native Client Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can\n\/\/ be found in the LICENSE file.\n\n#include \"native_client\/src\/trusted\/plugin\/ppapi\/file_downloader.h\"\n\n#include <stdio.h>\n#include <string>\n\n#include \"native_client\/src\/include\/portability_io.h\"\n#include \"native_client\/src\/shared\/platform\/nacl_check.h\"\n#include \"native_client\/src\/trusted\/plugin\/utility.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/dev\/ppb_file_io_dev.h\"\n#include \"ppapi\/cpp\/dev\/file_ref_dev.h\"\n#include \"ppapi\/cpp\/url_request_info.h\"\n#include \"ppapi\/cpp\/url_response_info.h\"\n\nnamespace {\n\nconst char* const kChromeExtensionScheme = \"chrome-extension\";\nconst int32_t kExtensionRequestStatusOk = 0;\n\n\/\/ A helper function that tests to see if |url| is in the chrome-extension\n\/\/ scheme. Note that this routine assumes that the scheme part of |url| is\n\/\/ all lower-case UTF8.\nbool IsChromeExtensionUrl(const std::string& url) {\n \/\/ The scheme has to exist and be at the start of |url|.\n return url.find(kChromeExtensionScheme) == 0;\n}\n}\n\nnamespace plugin {\n\nvoid FileDownloader::Initialize(pp::Instance* instance) {\n PLUGIN_PRINTF((\"FileDownloader::FileDownloader (this=%p)\\n\",\n static_cast<void*>(this)));\n CHECK(instance != NULL);\n CHECK(instance_ == NULL);\n if (instance == NULL)\n return;\n if (instance_ != NULL)\n return; \/\/ Can only initialize once.\n instance_ = instance;\n callback_factory_.Initialize(this);\n}\n\n\nbool FileDownloader::Open(const nacl::string& url,\n const pp::CompletionCallback& callback) {\n CHECK(instance_ != NULL);\n url_to_open_ = url;\n url_ = url;\n file_open_notify_callback_ = callback;\n \/\/ Reset the url loader and file reader.\n \/\/ Note that we have the only refernce to the underlying objects, so\n \/\/ this will implicitly close any pending IO and destroy them.\n url_loader_ = pp::URLLoader(instance_);\n file_reader_ = pp::FileIO_Dev(instance_);\n file_io_trusted_interface_ = static_cast<const PPB_FileIOTrusted_Dev*>(\n pp::Module::Get()->GetBrowserInterface(PPB_FILEIOTRUSTED_DEV_INTERFACE));\n if (file_io_trusted_interface_ == NULL)\n return false; \/\/ Interface not supported by our browser\n\n \/\/ Prepare the url request.\n pp::URLRequestInfo url_request(instance_);\n url_request.SetURL(url_);\n url_request.SetStreamToFile(true);\n\n \/\/ Request asynchronous download of the url providing an on-load callback.\n pp::CompletionCallback onload_callback =\n callback_factory_.NewCallback(&FileDownloader::URLLoadStartNotify);\n int32_t pp_error = url_loader_.Open(url_request, onload_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::Open (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onload_callback.Run(pp_error);\n }\n return async_notify_ok;\n}\n\nint32_t FileDownloader::GetPOSIXFileDescriptor() {\n \/\/ Use the trusted interface to get the file descriptor.\n if (file_io_trusted_interface_ == NULL) {\n return NACL_NO_FILE_DESC;\n }\n int32_t file_desc = file_io_trusted_interface_->GetOSFileDescriptor(\n file_reader_.pp_resource());\n\n\n#if NACL_WINDOWS\n \/\/ Convert the Windows HANDLE from Pepper to a POSIX file descriptor.\n int32_t posix_desc = _open_osfhandle(file_desc, _O_RDWR | _O_BINARY);\n if (posix_desc == -1) {\n \/\/ Close the Windows HANDLE if it can't be converted.\n CloseHandle(reinterpret_cast<HANDLE>(file_desc));\n return NACL_NO_FILE_DESC;\n }\n file_desc = posix_desc;\n#endif\n\n return file_desc;\n}\n\nvoid FileDownloader::URLLoadStartNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (pp_error=%\"\n NACL_PRId32\")\\n\", pp_error));\n if (pp_error != PP_OK) { \/\/ Url loading failed.\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n \/\/ Process the response, validating the headers to confirm successful loading.\n pp::URLResponseInfo url_response(url_loader_.GetResponseInfo());\n if (url_response.is_null()) {\n PLUGIN_PRINTF((\n \"FileDownloader::URLLoadStartNotify (url_response=NULL)\\n\"));\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n \/\/ Note that URLs in the chrome-extension scheme produce different error\n \/\/ codes than other schemes. This is because chrome-extension URLs are\n \/\/ really a special kind of file scheme, and therefore do not produce HTTP\n \/\/ status codes.\n pp::Var full_url = url_response.GetURL();\n if (!full_url.is_string()) {\n PLUGIN_PRINTF((\n \"FileDownloader::URLLoadStartNotify (url is not a string)\\n\"));\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n bool status_ok = false;\n int32_t status_code = url_response.GetStatusCode();\n if (IsChromeExtensionUrl(full_url.AsString())) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (chrome-extension \"\n \"response status_code=%\"NACL_PRId32\")\\n\", status_code));\n status_ok = (status_code == kExtensionRequestStatusOk);\n } else {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (HTTP response \"\n \"status_code=%\"NACL_PRId32\")\\n\", status_code));\n status_ok = (status_code == NACL_HTTP_STATUS_OK);\n }\n\n if (!status_ok) {\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n \/\/ Finish streaming the body asynchronously providing a callback.\n pp::CompletionCallback onload_callback =\n callback_factory_.NewCallback(&FileDownloader::URLLoadFinishNotify);\n pp_error = url_loader_.FinishStreamingToFile(onload_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onload_callback.Run(pp_error);\n }\n}\n\n\nvoid FileDownloader::URLLoadFinishNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (pp_error=%\"\n NACL_PRId32\")\\n\", pp_error));\n if (pp_error != PP_OK) { \/\/ Streaming failed.\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n pp::URLResponseInfo url_response(url_loader_.GetResponseInfo());\n \/\/ Validated on load.\n CHECK(url_response.GetStatusCode() == NACL_HTTP_STATUS_OK ||\n url_response.GetStatusCode() == kExtensionRequestStatusOk);\n\n \/\/ Record the full url from the response.\n pp::Var full_url = url_response.GetURL();\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (full_url=%s)\\n\",\n full_url.DebugString().c_str()));\n if (!full_url.is_string()) {\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n url_ = full_url.AsString();\n\n \/\/ The file is now fully downloaded.\n pp::FileRef_Dev file(url_response.GetBodyAsFileRef());\n if (file.is_null()) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (file=NULL)\\n\"));\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n \/\/ Open the file asynchronously providing a callback.\n pp::CompletionCallback onopen_callback =\n callback_factory_.NewCallback(&FileDownloader::FileOpenNotify);\n pp_error = file_reader_.Open(file, PP_FILEOPENFLAG_READ, onopen_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onopen_callback.Run(pp_error);\n }\n}\n\n\nvoid FileDownloader::FileOpenNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::FileOpenNotify (pp_error=%\"NACL_PRId32\")\\n\",\n pp_error));\n file_open_notify_callback_.Run(pp_error);\n}\n\n} \/\/ namespace plugin\n<commit_msg>Return PP_ERROR_FAILED instead of PP_OK for error cases in file_downloader.<commit_after>\/\/ Copyright (c) 2011 The Native Client Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"native_client\/src\/trusted\/plugin\/ppapi\/file_downloader.h\"\n\n#include <stdio.h>\n#include <string>\n\n#include \"native_client\/src\/include\/portability_io.h\"\n#include \"native_client\/src\/shared\/platform\/nacl_check.h\"\n#include \"native_client\/src\/trusted\/plugin\/utility.h\"\n#include \"ppapi\/c\/pp_errors.h\"\n#include \"ppapi\/c\/dev\/ppb_file_io_dev.h\"\n#include \"ppapi\/cpp\/dev\/file_ref_dev.h\"\n#include \"ppapi\/cpp\/url_request_info.h\"\n#include \"ppapi\/cpp\/url_response_info.h\"\n\nnamespace {\n\nconst char* const kChromeExtensionScheme = \"chrome-extension\";\nconst int32_t kExtensionRequestStatusOk = 0;\n\n\/\/ A helper function that tests to see if |url| is in the chrome-extension\n\/\/ scheme. Note that this routine assumes that the scheme part of |url| is\n\/\/ all lower-case UTF8.\nbool IsChromeExtensionUrl(const std::string& url) {\n \/\/ The scheme has to exist and be at the start of |url|.\n return url.find(kChromeExtensionScheme) == 0;\n}\n}\n\nnamespace plugin {\n\nvoid FileDownloader::Initialize(pp::Instance* instance) {\n PLUGIN_PRINTF((\"FileDownloader::FileDownloader (this=%p)\\n\",\n static_cast<void*>(this)));\n CHECK(instance != NULL);\n CHECK(instance_ == NULL);\n if (instance == NULL)\n return;\n if (instance_ != NULL)\n return; \/\/ Can only initialize once.\n instance_ = instance;\n callback_factory_.Initialize(this);\n}\n\n\nbool FileDownloader::Open(const nacl::string& url,\n const pp::CompletionCallback& callback) {\n CHECK(instance_ != NULL);\n url_to_open_ = url;\n url_ = url;\n file_open_notify_callback_ = callback;\n \/\/ Reset the url loader and file reader.\n \/\/ Note that we have the only refernce to the underlying objects, so\n \/\/ this will implicitly close any pending IO and destroy them.\n url_loader_ = pp::URLLoader(instance_);\n file_reader_ = pp::FileIO_Dev(instance_);\n file_io_trusted_interface_ = static_cast<const PPB_FileIOTrusted_Dev*>(\n pp::Module::Get()->GetBrowserInterface(PPB_FILEIOTRUSTED_DEV_INTERFACE));\n if (file_io_trusted_interface_ == NULL)\n return false; \/\/ Interface not supported by our browser\n\n \/\/ Prepare the url request.\n pp::URLRequestInfo url_request(instance_);\n url_request.SetURL(url_);\n url_request.SetStreamToFile(true);\n\n \/\/ Request asynchronous download of the url providing an on-load callback.\n pp::CompletionCallback onload_callback =\n callback_factory_.NewCallback(&FileDownloader::URLLoadStartNotify);\n int32_t pp_error = url_loader_.Open(url_request, onload_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::Open (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onload_callback.Run(pp_error);\n }\n return async_notify_ok;\n}\n\nint32_t FileDownloader::GetPOSIXFileDescriptor() {\n \/\/ Use the trusted interface to get the file descriptor.\n if (file_io_trusted_interface_ == NULL) {\n return NACL_NO_FILE_DESC;\n }\n int32_t file_desc = file_io_trusted_interface_->GetOSFileDescriptor(\n file_reader_.pp_resource());\n\n\n#if NACL_WINDOWS\n \/\/ Convert the Windows HANDLE from Pepper to a POSIX file descriptor.\n int32_t posix_desc = _open_osfhandle(file_desc, _O_RDWR | _O_BINARY);\n if (posix_desc == -1) {\n \/\/ Close the Windows HANDLE if it can't be converted.\n CloseHandle(reinterpret_cast<HANDLE>(file_desc));\n return NACL_NO_FILE_DESC;\n }\n file_desc = posix_desc;\n#endif\n\n return file_desc;\n}\n\nvoid FileDownloader::URLLoadStartNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (pp_error=%\"\n NACL_PRId32\")\\n\", pp_error));\n if (pp_error != PP_OK) { \/\/ Url loading failed.\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n \/\/ Process the response, validating the headers to confirm successful loading.\n pp::URLResponseInfo url_response(url_loader_.GetResponseInfo());\n if (url_response.is_null()) {\n PLUGIN_PRINTF((\n \"FileDownloader::URLLoadStartNotify (url_response=NULL)\\n\"));\n file_open_notify_callback_.Run(PP_ERROR_FAILED);\n return;\n }\n \/\/ Note that URLs in the chrome-extension scheme produce different error\n \/\/ codes than other schemes. This is because chrome-extension URLs are\n \/\/ really a special kind of file scheme, and therefore do not produce HTTP\n \/\/ status codes.\n pp::Var full_url = url_response.GetURL();\n if (!full_url.is_string()) {\n PLUGIN_PRINTF((\n \"FileDownloader::URLLoadStartNotify (url is not a string)\\n\"));\n file_open_notify_callback_.Run(PP_ERROR_FAILED);\n return;\n }\n bool status_ok = false;\n int32_t status_code = url_response.GetStatusCode();\n if (IsChromeExtensionUrl(full_url.AsString())) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (chrome-extension \"\n \"response status_code=%\"NACL_PRId32\")\\n\", status_code));\n status_ok = (status_code == kExtensionRequestStatusOk);\n } else {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (HTTP response \"\n \"status_code=%\"NACL_PRId32\")\\n\", status_code));\n status_ok = (status_code == NACL_HTTP_STATUS_OK);\n }\n\n if (!status_ok) {\n file_open_notify_callback_.Run(PP_ERROR_FAILED);\n return;\n }\n\n \/\/ Finish streaming the body asynchronously providing a callback.\n pp::CompletionCallback onload_callback =\n callback_factory_.NewCallback(&FileDownloader::URLLoadFinishNotify);\n pp_error = url_loader_.FinishStreamingToFile(onload_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::URLLoadStartNotify (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onload_callback.Run(pp_error);\n }\n}\n\n\nvoid FileDownloader::URLLoadFinishNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (pp_error=%\"\n NACL_PRId32\")\\n\", pp_error));\n if (pp_error != PP_OK) { \/\/ Streaming failed.\n file_open_notify_callback_.Run(pp_error);\n return;\n }\n\n pp::URLResponseInfo url_response(url_loader_.GetResponseInfo());\n \/\/ Validated on load.\n CHECK(url_response.GetStatusCode() == NACL_HTTP_STATUS_OK ||\n url_response.GetStatusCode() == kExtensionRequestStatusOk);\n\n \/\/ Record the full url from the response.\n pp::Var full_url = url_response.GetURL();\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (full_url=%s)\\n\",\n full_url.DebugString().c_str()));\n if (!full_url.is_string()) {\n file_open_notify_callback_.Run(PP_ERROR_FAILED);\n return;\n }\n url_ = full_url.AsString();\n\n \/\/ The file is now fully downloaded.\n pp::FileRef_Dev file(url_response.GetBodyAsFileRef());\n if (file.is_null()) {\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (file=NULL)\\n\"));\n file_open_notify_callback_.Run(PP_ERROR_FAILED);\n return;\n }\n\n \/\/ Open the file asynchronously providing a callback.\n pp::CompletionCallback onopen_callback =\n callback_factory_.NewCallback(&FileDownloader::FileOpenNotify);\n pp_error = file_reader_.Open(file, PP_FILEOPENFLAG_READ, onopen_callback);\n bool async_notify_ok = (pp_error == PP_ERROR_WOULDBLOCK);\n PLUGIN_PRINTF((\"FileDownloader::URLLoadFinishNotify (async_notify_ok=%d)\\n\",\n async_notify_ok));\n if (!async_notify_ok) {\n \/\/ Call manually to free allocated memory and report errors. This calls\n \/\/ |file_open_notify_callback_| with |pp_error| as the parameter.\n onopen_callback.Run(pp_error);\n }\n}\n\n\nvoid FileDownloader::FileOpenNotify(int32_t pp_error) {\n PLUGIN_PRINTF((\"FileDownloader::FileOpenNotify (pp_error=%\"NACL_PRId32\")\\n\",\n pp_error));\n file_open_notify_callback_.Run(pp_error);\n}\n\n} \/\/ namespace plugin\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_GAME_ENTITY_HANDLER_HPP\n#define RJ_GAME_ENTITY_HANDLER_HPP\n\n\n#include \"components\/player.hpp\"\n#include \"collision.hpp\"\n#include \"entity.hpp\"\n\n#include <mlk\/containers\/container_utl.h>\n#include <mlk\/log\/log.h>\n#include <mlk\/types\/types.h>\n\n#include <vector>\n\n\nnamespace rj\n{\n\ttemplate<typename T>\n\tusing entity_ptr = mlk::sptr<T>;\n\tusing entity_base_ptr = entity_ptr<entity_base>;\n\tusing player_ptr = entity_ptr<player>;\n\n\tclass entity_handler\n\t{\n\t\trndr& m_render;\n\n\t\tplayer_ptr m_player{nullptr};\n\t\tstd::vector<entity_base_ptr> m_entities;\n\t\tstd::size_t m_max_entities;\n\t\tstd::size_t m_current_id{0};\n\n\t\tstatic constexpr float m_despawn_zone{0.f};\n\n\tpublic:\n\t\tusing iterator = std::vector<entity_base_ptr>::iterator;\n\t\tusing const_iterator = std::vector<entity_base_ptr>::const_iterator;\n\n\t\tentity_handler(rndr& r, std::size_t max_entities = 1000) :\n\t\t\tm_render{r},\n\t\t\tm_max_entities{max_entities}\n\t\t{ }\n\n\t\tbool create_entity(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\tif(!this->is_entity_valid(e))\n\t\t\t\treturn false;\n\n\t\t\tthis->create_entity_impl(e); \/\/ add\/create entity in handler\n\t\t\treturn true;\n\t\t}\n\n\t\tbool create_entity(const player_ptr& p) noexcept\n\t\t{\n\t\t\tif(!this->is_entity_valid(p) || this->is_player_registered())\n\t\t\t\treturn false;\n\n\t\t\tthis->create_entity_impl(p);\n\t\t\treturn true;\n\t\t}\n\n\t\tvoid update(dur duration)\n\t\t{\n\t\t\t\/\/ update player\n\t\t\tif(this->is_player_registered())\n\t\t\t\tm_player->update(duration);\n\n\t\t\t\/\/ update other\n\t\t\tfor(auto& a : m_entities)\n\t\t\t{\n\t\t\t\ta->update(duration);\n\t\t\t\tif(a->right_out() <= m_despawn_zone)\n\t\t\t\t\ta->destroy();\n\t\t\t}\n\n\t\t\tthis->check_collision();\n\n\t\t\t\/\/ erase flagged entities\n\t\t\tthis->erase_destroyed();\n\t\t}\n\n\t\tvoid render()\n\t\t{\n\t\t\t\/\/ render player\n\t\t\tif(this->is_player_registered())\n\t\t\t\tm_player->render();\n\n\t\t\t\/\/ render other\n\t\t\tfor(auto& a : m_entities)\n\t\t\t\ta->render();\n\t\t}\n\n\t\tvoid clear() noexcept\n\t\t{m_entities.clear();}\n\n\t\tvoid delete_entity(iterator iter)\n\t\t{m_entities.erase(iter);}\n\n\t\tbool exists_entity_at(const vec2f& at) noexcept\n\t\t{return this->get_entity_at(at) != std::end(m_entities);}\n\n\t\titerator get_entity_at(const vec2f& at) noexcept\n\t\t{\n\t\t\tfor(auto iter(std::begin(m_entities)); iter != std::end(m_entities); ++iter)\n\t\t\t{\n\t\t\t\tsf::FloatRect ent_bounds{{(*iter)->left_out(), (*iter)->top_out()}, (*iter)->size()};\n\t\t\t\tsf::FloatRect at_bounds{at, {1.f, 1.f}};\n\t\t\t\tif(ent_bounds.intersects(at_bounds))\n\t\t\t\t\treturn iter;\n\t\t\t}\n\t\t\treturn std::end(m_entities);\n\t\t}\n\n\t\titerator begin()\n\t\t{return std::begin(m_entities);}\n\n\t\titerator end()\n\t\t{return std::end(m_entities);}\n\n\t\tstd::size_t num_entities() const noexcept\n\t\t{return m_entities.size() + this->is_player_registered();}\n\n\tprivate:\n\t\tvoid check_collision() noexcept\n\t\t{\n\t\t\tif(!this->is_player_registered())\n\t\t\t\treturn;\n\n\t\t\tbool collided{false};\n\n\t\t\tfor(auto& a : m_entities)\n\t\t\t{\n\t\t\t\tif(is_colliding(*m_player, *a))\n\t\t\t\t{\n\t\t\t\t\tcollided = true;\n\n\t\t\t\t\tif(m_player->bottom_out() - 2 <= a->top_out())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_player->on_collision(a->top_out());\n\t\t\t\t\t\tm_player->render_object().setFillColor({0, 255, 0});\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tm_player->render_object().setFillColor({255, 0, 0});\n\n\n\t\t\t\t\tif(a->has_propertie(entity_propertie::death))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ player touched death entity\n\t\t\t\t\t\tm_player->render_object().setFillColor({255, 0, 0});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!collided)\n\t\t\t\tm_player->on_collision_end();\n\t\t}\n\n\t\t\/\/ checking the entities\n\t\tbool is_entity_valid(const entity_base_ptr& e) const noexcept\n\t\t{\n\t\t\tif(m_entities.size() >= m_max_entities)\n\t\t\t{\n\t\t\t\tmlk::lout(\"rj::entity_handler\") << \"max_entities limit is reached, can't add more entities\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(e->is_registered())\n\t\t\t{\n\t\t\t\tmlk::lout(\"rj::entity_handler\") << \"entity with id '\" << e->m_id << \"' exists already in entity handler, ignoring\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tbool is_player_registered() const noexcept\n\t\t{return m_player != nullptr;}\n\n\t\t\/\/ create the entities\n\t\tvoid create_entity_impl(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\tthis->register_impl(e);\n\t\t\tm_entities.push_back(e);\n\t\t}\n\n\t\tvoid create_entity_impl(const player_ptr& p) noexcept\n\t\t{\n\t\t\tthis->register_impl(p);\n\t\t\tm_player = p;\n\t\t}\n\n\t\tvoid register_impl(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\t\/\/ important: set game and init\n\t\t\te->handler_register(&m_render, m_current_id);\n\t\t\te->init();\n\t\t\t++m_current_id;\n\t\t}\n\n\t\tvoid erase_destroyed() noexcept\n\t\t{\n\t\t\tmlk::cnt::remove_all_if(\n\t\t\t[](const entity_base_ptr& entity){return entity->m_destroyed;}, m_entities);\n\t\t}\n\t};\n}\n\n\n#endif \/\/ RJ_GAME_ENTITY_HANDLER_HPP\n<commit_msg>enitity_handler: get_entity_at -> get_entities_at delete_entity -> delete_entities added size param<commit_after>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_GAME_ENTITY_HANDLER_HPP\n#define RJ_GAME_ENTITY_HANDLER_HPP\n\n\n#include \"components\/player.hpp\"\n#include \"collision.hpp\"\n#include \"entity.hpp\"\n\n#include <mlk\/containers\/container_utl.h>\n#include <mlk\/log\/log.h>\n#include <mlk\/types\/types.h>\n\n#include <vector>\n\n\nnamespace rj\n{\n\ttemplate<typename T>\n\tusing entity_ptr = mlk::sptr<T>;\n\tusing entity_base_ptr = entity_ptr<entity_base>;\n\tusing player_ptr = entity_ptr<player>;\n\n\tclass entity_handler\n\t{\n\t\trndr& m_render;\n\n\t\tplayer_ptr m_player{nullptr};\n\t\tstd::vector<entity_base_ptr> m_entities;\n\t\tstd::size_t m_max_entities;\n\t\tstd::size_t m_current_id{0};\n\n\t\tstatic constexpr float m_despawn_zone{0.f};\n\n\tpublic:\n\t\tusing iterator = std::vector<entity_base_ptr>::iterator;\n\t\tusing const_iterator = std::vector<entity_base_ptr>::const_iterator;\n\n\t\tentity_handler(rndr& r, std::size_t max_entities = 1000) :\n\t\t\tm_render{r},\n\t\t\tm_max_entities{max_entities}\n\t\t{ }\n\n\t\tbool create_entity(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\tif(!this->is_entity_valid(e))\n\t\t\t\treturn false;\n\n\t\t\tthis->create_entity_impl(e); \/\/ add\/create entity in handler\n\t\t\treturn true;\n\t\t}\n\n\t\tbool create_entity(const player_ptr& p) noexcept\n\t\t{\n\t\t\tif(!this->is_entity_valid(p) || this->is_player_registered())\n\t\t\t\treturn false;\n\n\t\t\tthis->create_entity_impl(p);\n\t\t\treturn true;\n\t\t}\n\n\t\tvoid update(dur duration)\n\t\t{\n\t\t\t\/\/ update player\n\t\t\tif(this->is_player_registered())\n\t\t\t\tm_player->update(duration);\n\n\t\t\t\/\/ update other\n\t\t\tfor(auto& a : m_entities)\n\t\t\t{\n\t\t\t\ta->update(duration);\n\t\t\t\tif(a->right_out() <= m_despawn_zone)\n\t\t\t\t\ta->destroy();\n\t\t\t}\n\n\t\t\tthis->check_collision();\n\n\t\t\t\/\/ erase flagged entities\n\t\t\tthis->erase_destroyed();\n\t\t}\n\n\t\tvoid render()\n\t\t{\n\t\t\t\/\/ render player\n\t\t\tif(this->is_player_registered())\n\t\t\t\tm_player->render();\n\n\t\t\t\/\/ render other\n\t\t\tfor(auto& a : m_entities)\n\t\t\t\ta->render();\n\t\t}\n\n\t\tvoid clear() noexcept\n\t\t{m_entities.clear();}\n\n\t\t\/\/ deleting ents on next update\n\t\tvoid delete_entities(std::vector<iterator>& iters)\n\t\t{for(auto& a : iters) (*a)->destroy();}\n\n\t\tstd::vector<iterator> get_entities_at(const vec2f& at, const vec2f& size = {1.f, 1.f}) noexcept\n\t\t{\n\t\t\tstd::vector<iterator> result;\n\t\t\tsf::FloatRect at_bounds{at, size};\n\t\t\tfor(auto iter(std::begin(m_entities)); iter != std::end(m_entities); ++iter)\n\t\t\t{\n\t\t\t\tsf::FloatRect ent_bounds{{(*iter)->left_out(), (*iter)->top_out()}, (*iter)->size()};\n\t\t\t\tif(ent_bounds.intersects(at_bounds))\n\t\t\t\t\tresult.emplace_back(iter);\n\t\t\t}\n\t\t\treturn result;\n\t\t}\n\n\t\tbool exists_entity_at(const vec2f& at, const vec2f& size = {1.f, 1.f}) noexcept\n\t\t{return !this->get_entities_at(at, size).empty();}\n\n\t\titerator begin()\n\t\t{return std::begin(m_entities);}\n\n\t\titerator end()\n\t\t{return std::end(m_entities);}\n\n\t\tstd::size_t num_entities() const noexcept\n\t\t{return m_entities.size() + this->is_player_registered();}\n\n\tprivate:\n\t\tvoid check_collision() noexcept\n\t\t{\n\t\t\tif(!this->is_player_registered())\n\t\t\t\treturn;\n\n\t\t\tbool collided{false};\n\n\t\t\tfor(auto& a : m_entities)\n\t\t\t{\n\t\t\t\tif(is_colliding(*m_player, *a))\n\t\t\t\t{\n\t\t\t\t\tcollided = true;\n\n\t\t\t\t\tif(m_player->bottom_out() - 2 <= a->top_out())\n\t\t\t\t\t{\n\t\t\t\t\t\tm_player->on_collision(a->top_out());\n\t\t\t\t\t\tm_player->render_object().setFillColor({0, 255, 0});\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tm_player->render_object().setFillColor({255, 0, 0});\n\n\n\t\t\t\t\tif(a->has_propertie(entity_propertie::death))\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ player touched death entity\n\t\t\t\t\t\tm_player->render_object().setFillColor({255, 0, 0});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!collided)\n\t\t\t\tm_player->on_collision_end();\n\t\t}\n\n\t\t\/\/ checking the entities\n\t\tbool is_entity_valid(const entity_base_ptr& e) const noexcept\n\t\t{\n\t\t\tif(m_entities.size() >= m_max_entities)\n\t\t\t{\n\t\t\t\tmlk::lout(\"rj::entity_handler\") << \"max_entities limit is reached, can't add more entities\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif(e->is_registered())\n\t\t\t{\n\t\t\t\tmlk::lout(\"rj::entity_handler\") << \"entity with id '\" << e->m_id << \"' exists already in entity handler, ignoring\";\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\t\tbool is_player_registered() const noexcept\n\t\t{return m_player != nullptr;}\n\n\t\t\/\/ create the entities\n\t\tvoid create_entity_impl(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\tthis->register_impl(e);\n\t\t\tm_entities.push_back(e);\n\t\t}\n\n\t\tvoid create_entity_impl(const player_ptr& p) noexcept\n\t\t{\n\t\t\tthis->register_impl(p);\n\t\t\tm_player = p;\n\t\t}\n\n\t\tvoid register_impl(const entity_base_ptr& e) noexcept\n\t\t{\n\t\t\t\/\/ important: set game and init\n\t\t\te->handler_register(&m_render, m_current_id);\n\t\t\te->init();\n\t\t\t++m_current_id;\n\t\t}\n\n\t\tvoid erase_destroyed() noexcept\n\t\t{\n\t\t\tmlk::cnt::remove_all_if(\n\t\t\t[](const entity_base_ptr& entity){return entity->m_destroyed;}, m_entities);\n\t\t}\n\t};\n}\n\n\n#endif \/\/ RJ_GAME_ENTITY_HANDLER_HPP\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include \"boost_defs.hpp\"\n\n#include \"grabbable_state_manager.hpp\"\n#include \"grabber_client.hpp\"\n#include \"hid_manager.hpp\"\n#include \"hid_observer.hpp\"\n#include \"logger.hpp\"\n#include \"types.hpp\"\n\nnamespace krbn {\nclass device_observer final {\npublic:\n device_observer(const device_observer&) = delete;\n\n device_observer(std::weak_ptr<grabber_client> grabber_client) : grabber_client_(grabber_client),\n hid_manager_({\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_keyboard),\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_mouse),\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_pointer),\n }) {\n grabbable_state_manager_.grabbable_state_changed.connect([this](auto&& grabbable_state) {\n if (auto client = grabber_client_.lock()) {\n client->grabbable_state_changed(grabbable_state);\n }\n });\n\n hid_manager_.device_detecting.connect([](auto&& device) {\n if (iokit_utility::is_karabiner_virtual_hid_device(device)) {\n return false;\n }\n\n iokit_utility::log_matching_device(device);\n\n return true;\n });\n\n hid_manager_.device_detected.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is detected.\", human_interface_device->get_name_for_log());\n\n grabbable_state_manager_.update(grabbable_state(human_interface_device->get_registry_entry_id(),\n grabbable_state::state::device_error,\n grabbable_state::ungrabbable_temporarily_reason::none,\n mach_absolute_time()));\n\n human_interface_device->values_arrived.connect([this](auto&& human_interface_device,\n auto&& event_queue) {\n grabbable_state_manager_.update(event_queue);\n });\n\n auto observer = std::make_shared<hid_observer>(human_interface_device);\n\n observer->device_observed.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is observed.\",\n human_interface_device->get_name_for_log());\n\n if (auto state = grabbable_state_manager_.get_grabbable_state(human_interface_device->get_registry_entry_id())) {\n \/\/ Keep grabbable_state if the state is already changed by value_callback.\n if (state->get_state() == grabbable_state::state::device_error) {\n grabbable_state_manager_.update(grabbable_state(human_interface_device->get_registry_entry_id(),\n grabbable_state::state::grabbable,\n grabbable_state::ungrabbable_temporarily_reason::none,\n mach_absolute_time()));\n }\n }\n });\n\n observer->observe();\n\n hid_observers_[human_interface_device->get_registry_entry_id()] = observer;\n });\n\n hid_manager_.device_removed.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is removed.\", human_interface_device->get_name_for_log());\n\n hid_observers_.erase(human_interface_device->get_registry_entry_id());\n });\n\n hid_manager_.start();\n\n logger::get_logger().info(\"device_observer is started.\");\n }\n\n ~device_observer(void) {\n hid_observers_.clear();\n hid_manager_.stop();\n\n logger::get_logger().info(\"device_observer is stopped.\");\n }\n\nprivate:\n std::weak_ptr<grabber_client> grabber_client_;\n\n hid_manager hid_manager_;\n std::unordered_map<registry_entry_id, std::shared_ptr<hid_observer>> hid_observers_;\n grabbable_state_manager grabbable_state_manager_;\n};\n} \/\/ namespace krbn\n<commit_msg>add a comment<commit_after>#pragma once\n\n\/\/ `krbn::device_observer` can be used safely in a multi-threaded environment.\n\n#include \"boost_defs.hpp\"\n\n#include \"grabbable_state_manager.hpp\"\n#include \"grabber_client.hpp\"\n#include \"hid_manager.hpp\"\n#include \"hid_observer.hpp\"\n#include \"logger.hpp\"\n#include \"types.hpp\"\n\nnamespace krbn {\nclass device_observer final {\npublic:\n device_observer(const device_observer&) = delete;\n\n device_observer(std::weak_ptr<grabber_client> grabber_client) : grabber_client_(grabber_client),\n hid_manager_({\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_keyboard),\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_mouse),\n std::make_pair(hid_usage_page::generic_desktop, hid_usage::gd_pointer),\n }) {\n grabbable_state_manager_.grabbable_state_changed.connect([this](auto&& grabbable_state) {\n if (auto client = grabber_client_.lock()) {\n client->grabbable_state_changed(grabbable_state);\n }\n });\n\n hid_manager_.device_detecting.connect([](auto&& device) {\n if (iokit_utility::is_karabiner_virtual_hid_device(device)) {\n return false;\n }\n\n iokit_utility::log_matching_device(device);\n\n return true;\n });\n\n hid_manager_.device_detected.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is detected.\", human_interface_device->get_name_for_log());\n\n grabbable_state_manager_.update(grabbable_state(human_interface_device->get_registry_entry_id(),\n grabbable_state::state::device_error,\n grabbable_state::ungrabbable_temporarily_reason::none,\n mach_absolute_time()));\n\n human_interface_device->values_arrived.connect([this](auto&& human_interface_device,\n auto&& event_queue) {\n grabbable_state_manager_.update(event_queue);\n });\n\n auto observer = std::make_shared<hid_observer>(human_interface_device);\n\n observer->device_observed.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is observed.\",\n human_interface_device->get_name_for_log());\n\n if (auto state = grabbable_state_manager_.get_grabbable_state(human_interface_device->get_registry_entry_id())) {\n \/\/ Keep grabbable_state if the state is already changed by value_callback.\n if (state->get_state() == grabbable_state::state::device_error) {\n grabbable_state_manager_.update(grabbable_state(human_interface_device->get_registry_entry_id(),\n grabbable_state::state::grabbable,\n grabbable_state::ungrabbable_temporarily_reason::none,\n mach_absolute_time()));\n }\n }\n });\n\n observer->observe();\n\n hid_observers_[human_interface_device->get_registry_entry_id()] = observer;\n });\n\n hid_manager_.device_removed.connect([this](auto&& human_interface_device) {\n logger::get_logger().info(\"{0} is removed.\", human_interface_device->get_name_for_log());\n\n hid_observers_.erase(human_interface_device->get_registry_entry_id());\n });\n\n hid_manager_.start();\n\n logger::get_logger().info(\"device_observer is started.\");\n }\n\n ~device_observer(void) {\n hid_observers_.clear();\n hid_manager_.stop();\n\n logger::get_logger().info(\"device_observer is stopped.\");\n }\n\nprivate:\n std::weak_ptr<grabber_client> grabber_client_;\n\n hid_manager hid_manager_;\n std::unordered_map<registry_entry_id, std::shared_ptr<hid_observer>> hid_observers_;\n grabbable_state_manager grabbable_state_manager_;\n};\n} \/\/ namespace krbn\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_SHARED_DATA_MANAGER_HPP\n#define RJ_SHARED_DATA_MANAGER_HPP\n\n\n#include <mlk\/filesystem\/filesystem.h>\n#include <mlk\/log\/log.h>\n#include <mlk\/tools\/compiletime.h>\n#include <mlk\/tools\/stl_string_utl.h>\n#include <mlk\/types\/types.h>\n\n#include <map>\n\n\nnamespace rj\n{\n\tusing data_id = std::string;\n\tusing data_vec = std::vector<mlk::data_packet>;\n\n\tclass data_manager\n\t{\n\t\tmlk::fs::dir_handle m_dirh;\n\t\tmlk::fs::file_handle m_fileh;\n\t\tconst std::string& m_abs_path;\n\n\t\tstd::map<data_id, mlk::data_packet> m_data;\n\n\t\tbool m_valid{false};\n\n\tpublic:\n\t\tdata_manager(const std::string& abs_datapath, bool auto_load = false) :\n\t\t\tm_dirh{abs_datapath},\n\t\t\tm_abs_path{m_dirh.get_path()},\n\t\t\tm_valid{m_dirh.exists()}\n\t\t{\n\t\t\tif(auto_load) this->load_all();\n\t\t}\n\n\t\t\/\/ interface\n\t\t\/\/ get:\t\tdon't loads the data to manager\n\t\t\/\/\t\t\tjust 'gets' it\n\t\tauto get_all() const noexcept\n\t\t-> const decltype(m_data)&\n\t\t{return m_data;}\n\n\t\tmlk::data_packet get_raw(const data_id& id)\n\t\t{\n\t\t\tif(!this->exists_id(id))\n\t\t\t\treturn {};\n\t\t\treturn m_data[id];\n\t\t}\n\n\t\tdata_vec get_all_containing_raw(const std::string& contain)\n\t\t{\n\t\t\tdata_vec result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace_back(this->get_raw(a.first));\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT get_as(const data_id& id)\n\t\t{return this->get_as_impl<T>(id);}\n\n\t\ttemplate<typename... Types, typename... Ids>\n\t\tstd::tuple<Types...> get_multiple_as(Ids&&... ids)\n\t\t{\n\t\t\tstatic_assert(sizeof...(Types) == sizeof...(Ids), \"Amount of types must match the amount of passed ids.\");\n\n\t\t\tstd::tuple<Types...> result;\n\t\t\tthis->get_multiple_as_impl<mlk::get_upper(-1)>(result, std::forward<Ids>(ids)...);\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename Type>\n\t\tstd::vector<Type> get_all_containing_as(const std::string& contain)\n\t\t{\n\t\t\tstd::vector<Type> result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace_back(this->get_as_impl<Type>(a.first));\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename Type>\n\t\tstd::map<data_id, Type> get_all_containing_as_map_as(const std::string& contain)\n\t\t{\n\t\t\tstd::map<data_id, Type> result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace(a.first, this->get_as_impl<Type>(a.first));\n\t\t\treturn result;\n\n\t\t}\n\n\t\t\/\/ load:\tgets AND loads the data to manager\n\t\tmlk::data_packet load_raw(const data_id& id)\n\t\t{\n\t\t\tthis->load_raw_impl(id, this->make_path(id));\n\t\t\treturn m_data[id];\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT load_as(const data_id& id)\n\t\t{return this->load_as_impl<T>(id);}\n\n\t\ttemplate<typename... Types, typename... Ids>\n\t\tstd::tuple<Types...> load_multiple_as(Ids&&... ids)\n\t\t{\n\t\t\tstatic_assert(sizeof...(Types) == sizeof...(Ids), \"Amount of types must match the amount of passed ids.\");\n\n\t\t\tstd::tuple<Types...> result;\n\t\t\tthis->load_multiple_as_impl<mlk::get_upper(-1)>(result, std::forward<Ids>(ids)...);\n\t\t\treturn result;\n\t\t}\n\n\t\tbool exists_id(const data_id& id) const noexcept\n\t\t{return m_data.find(id) != std::end(m_data);}\n\n\t\tstd::size_t num_data() const noexcept\n\t\t{return m_data.size();}\n\n\tprivate:\n\t\t\/\/ utils\n\t\tstd::string make_path(const data_id& id)\n\t\t{return m_abs_path + id;}\n\n\t\tstd::size_t get_datasize() const noexcept\n\t\t{\n\t\t\tstd::size_t result{0};\n\t\t\tfor(auto& a : m_data) result += a.second.size();\n\t\t\treturn result;\n\t\t}\n\n\t\t\/\/ loads all data recursive\n\t\t\/\/ from absolute directory\n\t\tvoid load_all()\n\t\t{\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loading files recursive from directory '\" << m_abs_path << \"'...\";\n\t\t\tauto content(m_dirh.get_content<true>());\n\t\t\tauto count(0);\n\t\t\tfor(auto& a : content)\n\t\t\t\tif(a.type == mlk::fs::item_type::file)\n\t\t\t\t{\n\t\t\t\t\tthis->load_raw_impl(a.name, a.path);\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loaded \" << count << \" files (\" << this->get_datasize() << \" bytes)\";\n\t\t}\n\n\n\t\t\/\/ tuple impls\n\t\ttemplate<int tup_index, typename Id_Head, typename... Types, typename... Id_Tail>\n\t\tvoid get_multiple_as_impl(std::tuple<Types...>& tup, const Id_Head& head, Id_Tail&&... tail)\n\t\t{\n\t\t\tstd::get<tup_index>(tup) = this->get_as_impl<typename std::tuple_element<tup_index, std::tuple<Types...>>::type>(head);\n\t\t\tthis->get_multiple_as_impl<mlk::get_upper(tup_index)>(tup, std::forward<Id_Tail>(tail)...);\n\t\t}\n\n\t\ttemplate<int tup_index, typename... Types>\n\t\tvoid get_multiple_as_impl(std::tuple<Types...> &tup)\n\t\t{\/* case: no args; do nothing *\/}\n\n\t\ttemplate<int tup_index, typename Id_Head, typename... Types, typename... Id_Tail>\n\t\tvoid load_multiple_as_impl(std::tuple<Types...>& tup, const Id_Head& head, Id_Tail&&... tail)\n\t\t{\n\t\t\tstd::get<tup_index>(tup) = this->load_as_impl<typename std::tuple_element<tup_index, std::tuple<Types...>>::type>(head);\n\t\t\tthis->load_multiple_as_impl<mlk::get_upper(tup_index)>(tup, std::forward<Id_Tail>(tail)...);\n\t\t}\n\n\t\ttemplate<int tup_index, typename... Types>\n\t\tvoid load_multiple_as_impl(std::tuple<Types...>& tup)\n\t\t{\/* case: no args; do nothing *\/}\n\n\n\t\t\/\/ lowest level impls\n\t\tvoid load_raw_impl(const data_id& id, const std::string& path)\n\t\t{\n\t\t\tif(this->exists_id(id))\n\t\t\t{\n\t\t\t\tmlk::lerr()[\"rj::data_manager\"] << \"object with id '\" << id << \"' already loaded\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tm_fileh.reopen(path, std::ios::in);\n\t\t\tm_data[id] = m_fileh.read_all();\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loaded data '\" << path << \"'\";\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT load_as_impl(const data_id& id)\n\t\t{\n\t\t\tthis->load_raw_impl(id, this->make_path(id));\n\t\t\treturn this->get_as_impl<T>(id);\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT get_as_impl(const data_id& id)\n\t\t{\n\t\t\tif(!this->exists_id(id))\n\t\t\t{\n\t\t\t\tmlk::lerr()[\"rj::data_manager\"] << \"object with id '\" << id << \"' not found\";\n\t\t\t\treturn T{};\n\t\t\t}\n\t\t\tT result;\n\t\t\tresult.loadFromMemory(m_data[id].data(), m_data[id].size());\n\t\t\treturn result;\n\t\t}\n\t};\n}\n\n\n#endif \/\/ RJ_SHARED_DATA_MANAGER_HPP\n<commit_msg>data_manager: added exists_ids(...)<commit_after>\/\/\n\/\/ Copyright (c) 2013-2014 Christoph Malek\n\/\/ See LICENSE for more information.\n\/\/\n\n#ifndef RJ_SHARED_DATA_MANAGER_HPP\n#define RJ_SHARED_DATA_MANAGER_HPP\n\n\n#include <mlk\/filesystem\/filesystem.h>\n#include <mlk\/log\/log.h>\n#include <mlk\/tools\/compiletime.h>\n#include <mlk\/tools\/stl_string_utl.h>\n#include <mlk\/types\/types.h>\n\n#include <map>\n\n\nnamespace rj\n{\n\tusing data_id = std::string;\n\tusing data_vec = std::vector<mlk::data_packet>;\n\n\tclass data_manager\n\t{\n\t\tmlk::fs::dir_handle m_dirh;\n\t\tmlk::fs::file_handle m_fileh;\n\t\tconst std::string& m_abs_path;\n\n\t\tstd::map<data_id, mlk::data_packet> m_data;\n\n\t\tbool m_valid{false};\n\n\tpublic:\n\t\tdata_manager(const std::string& abs_datapath, bool auto_load = false) :\n\t\t\tm_dirh{abs_datapath},\n\t\t\tm_abs_path{m_dirh.get_path()},\n\t\t\tm_valid{m_dirh.exists()}\n\t\t{\n\t\t\tif(auto_load) this->load_all();\n\t\t}\n\n\t\t\/\/ interface\n\t\t\/\/ get:\t\tdon't loads the data to manager\n\t\t\/\/\t\t\tjust 'gets' it\n\t\tauto get_all() const noexcept\n\t\t-> const decltype(m_data)&\n\t\t{return m_data;}\n\n\t\tmlk::data_packet get_raw(const data_id& id)\n\t\t{\n\t\t\tif(!this->exists_id(id))\n\t\t\t\treturn {};\n\t\t\treturn m_data[id];\n\t\t}\n\n\t\tdata_vec get_all_containing_raw(const std::string& contain)\n\t\t{\n\t\t\tdata_vec result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace_back(this->get_raw(a.first));\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT get_as(const data_id& id)\n\t\t{return this->get_as_impl<T>(id);}\n\n\t\ttemplate<typename... Types, typename... Ids>\n\t\tstd::tuple<Types...> get_multiple_as(Ids&&... ids)\n\t\t{\n\t\t\tstatic_assert(sizeof...(Types) == sizeof...(Ids), \"Amount of types must match the amount of passed ids.\");\n\n\t\t\tstd::tuple<Types...> result;\n\t\t\tthis->get_multiple_as_impl<mlk::get_upper(-1)>(result, std::forward<Ids>(ids)...);\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename Type>\n\t\tstd::vector<Type> get_all_containing_as(const std::string& contain)\n\t\t{\n\t\t\tstd::vector<Type> result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace_back(this->get_as_impl<Type>(a.first));\n\t\t\treturn result;\n\t\t}\n\n\t\ttemplate<typename Type>\n\t\tstd::map<data_id, Type> get_all_containing_as_map_as(const std::string& contain)\n\t\t{\n\t\t\tstd::map<data_id, Type> result;\n\t\t\tfor(auto& a : m_data)\n\t\t\t\tif(mlk::stl_string::contains(contain, a.first))\n\t\t\t\t\tresult.emplace(a.first, this->get_as_impl<Type>(a.first));\n\t\t\treturn result;\n\n\t\t}\n\n\t\t\/\/ load:\tgets AND loads the data to manager\n\t\tmlk::data_packet load_raw(const data_id& id)\n\t\t{\n\t\t\tthis->load_raw_impl(id, this->make_path(id));\n\t\t\treturn m_data[id];\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT load_as(const data_id& id)\n\t\t{return this->load_as_impl<T>(id);}\n\n\t\ttemplate<typename... Types, typename... Ids>\n\t\tstd::tuple<Types...> load_multiple_as(Ids&&... ids)\n\t\t{\n\t\t\tstatic_assert(sizeof...(Types) == sizeof...(Ids), \"Amount of types must match the amount of passed ids.\");\n\n\t\t\tstd::tuple<Types...> result;\n\t\t\tthis->load_multiple_as_impl<mlk::get_upper(-1)>(result, std::forward<Ids>(ids)...);\n\t\t\treturn result;\n\t\t}\n\n\t\tbool exists_id(const data_id& id) const noexcept\n\t\t{return m_data.find(id) != std::end(m_data);}\n\n\t\tbool exists_ids(const std::initializer_list<data_id>& il) const noexcept\n\t\t{\n\t\t\tfor(auto& a : il)\n\t\t\t\tif(!mlk::cnt::exists_map_first(a, m_data))\n\t\t\t\t\treturn false;\n\t\t\treturn true;\n\t\t}\n\n\t\tstd::size_t num_data() const noexcept\n\t\t{return m_data.size();}\n\n\tprivate:\n\t\t\/\/ utils\n\t\tstd::string make_path(const data_id& id)\n\t\t{return m_abs_path + id;}\n\n\t\tstd::size_t get_datasize() const noexcept\n\t\t{\n\t\t\tstd::size_t result{0};\n\t\t\tfor(auto& a : m_data) result += a.second.size();\n\t\t\treturn result;\n\t\t}\n\n\t\t\/\/ loads all data recursive\n\t\t\/\/ from absolute directory\n\t\tvoid load_all()\n\t\t{\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loading files recursive from directory '\" << m_abs_path << \"'...\";\n\t\t\tauto content(m_dirh.get_content<true>());\n\t\t\tauto count(0);\n\t\t\tfor(auto& a : content)\n\t\t\t\tif(a.type == mlk::fs::item_type::file)\n\t\t\t\t{\n\t\t\t\t\tthis->load_raw_impl(a.name, a.path);\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loaded \" << count << \" files (\" << this->get_datasize() << \" bytes)\";\n\t\t}\n\n\n\t\t\/\/ tuple impls\n\t\ttemplate<int tup_index, typename Id_Head, typename... Types, typename... Id_Tail>\n\t\tvoid get_multiple_as_impl(std::tuple<Types...>& tup, const Id_Head& head, Id_Tail&&... tail)\n\t\t{\n\t\t\tstd::get<tup_index>(tup) = this->get_as_impl<typename std::tuple_element<tup_index, std::tuple<Types...>>::type>(head);\n\t\t\tthis->get_multiple_as_impl<mlk::get_upper(tup_index)>(tup, std::forward<Id_Tail>(tail)...);\n\t\t}\n\n\t\ttemplate<int tup_index, typename... Types>\n\t\tvoid get_multiple_as_impl(std::tuple<Types...> &tup)\n\t\t{\/* case: no args; do nothing *\/}\n\n\t\ttemplate<int tup_index, typename Id_Head, typename... Types, typename... Id_Tail>\n\t\tvoid load_multiple_as_impl(std::tuple<Types...>& tup, const Id_Head& head, Id_Tail&&... tail)\n\t\t{\n\t\t\tstd::get<tup_index>(tup) = this->load_as_impl<typename std::tuple_element<tup_index, std::tuple<Types...>>::type>(head);\n\t\t\tthis->load_multiple_as_impl<mlk::get_upper(tup_index)>(tup, std::forward<Id_Tail>(tail)...);\n\t\t}\n\n\t\ttemplate<int tup_index, typename... Types>\n\t\tvoid load_multiple_as_impl(std::tuple<Types...>& tup)\n\t\t{\/* case: no args; do nothing *\/}\n\n\n\t\t\/\/ lowest level impls\n\t\tvoid load_raw_impl(const data_id& id, const std::string& path)\n\t\t{\n\t\t\tif(this->exists_id(id))\n\t\t\t{\n\t\t\t\tmlk::lerr()[\"rj::data_manager\"] << \"object with id '\" << id << \"' already loaded\";\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tm_fileh.reopen(path, std::ios::in);\n\t\t\tm_data[id] = m_fileh.read_all();\n\t\t\tmlk::lout(\"rj::data_manager\") << \"loaded data '\" << path << \"'\";\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT load_as_impl(const data_id& id)\n\t\t{\n\t\t\tthis->load_raw_impl(id, this->make_path(id));\n\t\t\treturn this->get_as_impl<T>(id);\n\t\t}\n\n\t\ttemplate<typename T>\n\t\tT get_as_impl(const data_id& id)\n\t\t{\n\t\t\tif(!this->exists_id(id))\n\t\t\t{\n\t\t\t\tmlk::lerr()[\"rj::data_manager\"] << \"object with id '\" << id << \"' not found\";\n\t\t\t\treturn T{};\n\t\t\t}\n\t\t\tT result;\n\t\t\tresult.loadFromMemory(m_data[id].data(), m_data[id].size());\n\t\t\treturn result;\n\t\t}\n\t};\n}\n\n\n#endif \/\/ RJ_SHARED_DATA_MANAGER_HPP\n<|endoftext|>"} {"text":"<commit_before>#include \"hash.h\"\n\nunsigned int MurmurHash3(unsigned int nHashSeed, const std::vector<unsigned char>& vDataToHash)\n{\n \/\/ The following is MurmurHash3 (x86_32), see http:\/\/code.google.com\/p\/smhasher\/source\/browse\/trunk\/MurmurHash3.cpp\n uint32_t h1 = nHashSeed;\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n const int nblocks = vDataToHash.size() \/ 4;\n\n \/\/----------\n \/\/ body\n const uint32_t * blocks = (const uint32_t *)(&vDataToHash[0] + nblocks*4);\n\n for(int i = -nblocks; i; i++)\n {\n uint32_t k1 = blocks[i];\n\n k1 *= c1;\n k1 = ROTL32(k1,15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = ROTL32(h1,13); \n h1 = h1*5+0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n const uint8_t * tail = (const uint8_t*)(&vDataToHash[0] + nblocks*4);\n\n uint32_t k1 = 0;\n\n switch(vDataToHash.size() & 3)\n {\n case 3: k1 ^= tail[2] << 16;\n case 2: k1 ^= tail[1] << 8;\n case 1: k1 ^= tail[0];\n k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n h1 ^= vDataToHash.size();\n h1 ^= h1 >> 16;\n h1 *= 0x85ebca6b;\n h1 ^= h1 >> 13;\n h1 *= 0xc2b2ae35;\n h1 ^= h1 >> 16;\n\n return h1;\n}\n\nint HMAC_SHA512_Init(HMAC_SHA512_CTX *pctx, const void *pkey, size_t len)\n{\n unsigned char key[128];\n if (len <= 128)\n {\n memcpy(key, pkey, len);\n memset(key + len, 0, 128-len);\n }\n else\n {\n SHA512_CTX ctxKey;\n SHA512_Init(&ctxKey);\n SHA512_Update(&ctxKey, pkey, len);\n SHA512_Final(key, &ctxKey);\n memset(key + 64, 0, 64);\n }\n\n for (int n=0; n<128; n++)\n key[n] ^= 0x5c;\n SHA512_Init(&pctx->ctxOuter);\n SHA512_Update(&pctx->ctxOuter, key, 128);\n\n for (int n=0; n<128; n++)\n key[n] ^= 0x5c ^ 0x36;\n SHA512_Init(&pctx->ctxInner);\n return SHA512_Update(&pctx->ctxInner, key, 128);\n}\n\nint HMAC_SHA512_Update(HMAC_SHA512_CTX *pctx, const void *pdata, size_t len)\n{\n return SHA512_Update(&pctx->ctxInner, pdata, len);\n}\n\nint HMAC_SHA512_Final(unsigned char *pmd, HMAC_SHA512_CTX *pctx)\n{\n unsigned char buf[64];\n SHA512_Final(buf, &pctx->ctxInner);\n SHA512_Update(&pctx->ctxOuter, buf, 64);\n return SHA512_Final(pmd, &pctx->ctxOuter);\n}\n<commit_msg>hash checksums<commit_after>#include \"hash.h\"\n\nunsigned int MurmurHash3(unsigned int nHashSeed, const std::vector<unsigned char>& vDataToHash)\n{\n \/\/ The following is MurmurHash3 (x86_32), see http:\/\/code.google.com\/p\/smhasher\/source\/browse\/trunk\/MurmurHash3.cpp\n uint32_t h1 = nHashSeed;\n const uint32_t c1 = 0xcc9e2d51;\n const uint32_t c2 = 0x1b873593;\n\n const int nblocks = vDataToHash.size() \/ 4;\n\n \/\/----------\n \/\/ body\n const uint32_t * blocks = (const uint32_t *)(&vDataToHash[0] + nblocks*4);\n\n for(int i = -nblocks; i; i++)\n {\n uint32_t k1 = blocks[i];\n\n k1 *= c1;\n k1 = ROTL32(k1,15);\n k1 *= c2;\n\n h1 ^= k1;\n h1 = ROTL32(h1,13); \n h1 = h1*5+0xe6546b64;\n }\n\n \/\/----------\n \/\/ tail\n const uint8_t * tail = (const uint8_t*)(&vDataToHash[0] + nblocks*4);\n\n uint32_t k1 = 0;\n\n switch(vDataToHash.size() & 3)\n {\n case 3: k1 ^= tail[2] << 16;\n case 2: k1 ^= tail[1] << 8;\n case 1: k1 ^= tail[0];\n k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1;\n };\n\n \/\/----------\n \/\/ finalization\n h1 ^= vDataToHash.size();\n h1 ^= h1 >> 16;\n h1 *= 0x85ebca6b;\n h1 ^= h1 >> 13;\n h1 *= 0xc2b2ae35;\n h1 ^= h1 >> 16;\n\n return h1;\n}\n\nint HMAC_SHA512_Init(HMAC_SHA512_CTX *pctx, const void *pkey, size_t len)\n{\n unsigned char key[128];\n if (len <= 128)\n {\n memcpy(key, pkey, len);\n memset(key + len, 0, 128-len);\n }\n else\n {\n SHA512_CTX ctxKey;\n SHA512_Init(&ctxKey);\n SHA512_Update(&ctxKey, pkey, len);\n SHA512_Final(key, &ctxKey);\n memset(key + 64, 0, 64);\n }\n\n for (int n=0; n<128; n++)\n key[n] ^= 0x5c;\n SHA512_Init(&pctx->ctxOuter);\n SHA512_Update(&pctx->ctxOuter, key, 128);\n\n for (int n=0; n<128; n++)\n key[n] ^= 0x5c ^ 0x36;\n SHA512_Init(&pctx->ctxInner);\n return SHA512_Update(&pctx->ctxInner, key, 128);\n}\n\nint HMAC_SHA512_Update(HMAC_SHA512_CTX *pctx, const void *pdata, size_t len)\n{\n return SHA512_Update(&pctx->ctxInner, pdata, len);\n}\n\nint HMAC_SHA512_Final(unsigned char *pmd, HMAC_SHA512_CTX *pctx)\n{\n unsigned char buf[64];\n SHA512_Final(buf, &pctx->ctxInner);\n SHA512_Update(&pctx->ctxOuter, buf, 64);\n return SHA512_Final(pmd, &pctx->ctxOuter);\n}\n\n\nuint32_t BitcoinChecksum(uint8_t* p, uint32_t nBytes)\n{\n if (!p || nBytes == 0)\n return 0;\n\n uint8_t hash1[32];\n SHA256(p, nBytes, (uint8_t*)hash1);\n uint8_t hash2[32];\n SHA256((uint8_t*)hash1, sizeof(hash1), (uint8_t*)hash2);\n\n \/\/ -- checksum is the 1st 4 bytes of the hash\n uint32_t checksum;\n memcpy(&checksum, &hash2[0], 4);\n\n return checksum;\n};\n\nvoid AppendChecksum(std::vector<uint8_t>& data)\n{\n uint32_t checksum = BitcoinChecksum(&data[0], data.size());\n\n std::vector<uint8_t> tmp(4);\n memcpy(&tmp[0], &checksum, 4);\n\n data.insert(data.end(), tmp.begin(), tmp.end());\n};\n\nbool VerifyChecksum(const std::vector<uint8_t>& data)\n{\n if (data.size() < 4)\n return false;\n\n uint32_t checksum;\n memcpy(&checksum, &(*(data.end() - 4)), 4);\n\n return BitcoinChecksum((uint8_t*)&data[0], data.size()-4) == checksum;\n};\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/ Author: Akira Okumura 2007\/09\/24\n\n\/******************************************************************************\n * Copyright (C) 2006-, Akira Okumura *\n * All rights reserved. *\n *****************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ AOpticsManager\n\/\/\n\/\/ Manager of optics\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TRandom.h\"\n#include \"RVersion.h\"\n\n#include \"AOpticsManager.h\"\n\n#ifdef _OPENMP\n#include <omp.h>\n#if ROOT_VERSION_CODE >= ROOT_VERSION(5,32,0)\n#define MULTI_THREAD_NAVIGATION\n#endif\n#endif\n\nstatic const Double_t kEpsilon = 1e-6; \/\/ Fixed in TGeoNavigator.cxx (equiv to 1e-6 cm)\n\nClassImp(AOpticsManager)\n\n\/\/_____________________________________________________________________________\nAOpticsManager::AOpticsManager() : TGeoManager(), fDisableFresnelReflection(kFALSE)\n{\n fLimit = 100;\n fNThreads = 1;\n#ifdef MULTI_THREAD_NAVIGATION\n SetMultiThread(kTRUE);\n#endif\n}\n\n\/\/_____________________________________________________________________________\nAOpticsManager::AOpticsManager(const char* name, const char* title)\n : TGeoManager(name, title), fDisableFresnelReflection(kFALSE)\n{\n fLimit = 100;\n fNThreads = 1;\n#ifdef MULTI_THREAD_NAVIGATION\n SetMultiThread(kTRUE);\n#endif\n}\n\n\/\/_____________________________________________________________________________\nAOpticsManager::~AOpticsManager()\n{\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::DoFresnel(Double_t n1, Double_t n2, ARay& ray)\n{\n \/\/ Use the same notation used in Wikipedia\n \/\/ http:\/\/en.wikipedia.org\/wiki\/Fresnel_equations\n \/\/ theta_i = incident angle\n \/\/ theta_t = transmission angle\n Double_t* n = FindNormal(); \/\/ normal vect perpendicular to the surface\n Double_t cosi = fD1[0]*n[0] + fD1[1]*n[1] + fD1[2]*n[2]; \/\/ cos(theta_i)\n Double_t sini = TMath::Sqrt(1 - cosi*cosi);\n Double_t sint = n1*sini\/n2; \/\/ Snell's law\n\n if(sint > 1.){ \/\/ total internal reflection\n fStep -= kEpsilon*2.; \/\/ stop the step before reaching the boundary\n DoReflection(n1, ray);\n return;\n } \/\/ if\n\n Double_t cost = TMath::Sqrt(1 - sint*sint);\n\n if(fDisableFresnelReflection == kFALSE){\n Double_t Rs = TMath::Power((n1*cosi - n2*cost)\/(n1*cosi + n2*cost), 2); \/\/ reflectivity for s-polarized photon\n Double_t Rp = TMath::Power((n1*cost - n2*cosi)\/(n1*cost + n2*cosi), 2); \/\/ reflectivity for p-polarized photon\n Double_t R = (Rs + Rp)\/2.; \/\/ We assume that polarization is random\n\n if(gRandom->Uniform(1) < R){ \/\/ reflection at the boundary\n fStep -= kEpsilon*2.; \/\/ stop the step before reaching the boundary\n DoReflection(n1, ray);\n return;\n } \/\/ if\n } \/\/ if\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n fD2[i] = (fD1[i] - cosi*n[i])*sint\/sini + n[i]*cost;\n } \/\/ i\n ray.SetDirection(fD2);\n\n \/\/ step (m), c (m\/s)\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::DoReflection(Double_t n1, ARay& ray)\n{\n Double_t* n = FindNormal(); \/\/ normal vect perpendicular to the surface\n Double_t cosi = fD1[0]*n[0] + fD1[1]*n[1] + fD1[2]*n[2];\n\n Bool_t absorbed = kFALSE;\n\n if(fTypeEnd == kMirror){\n Double_t angle = TMath::ACos(cosi)*TMath::RadToDeg();\n Double_t lambda = ray.GetLambda();\n Double_t ref = ((AMirror*)fEndNode->GetVolume())->GetReflectivity(lambda, angle);\n if(ref < gRandom->Uniform(1)){\n absorbed = kTRUE;\n ray.Absorb();\n } \/\/ if\n } \/\/ if\n\n for(Int_t i = 0; i < 3; i++){ \/\/ d2 = d1 - 2n*(d1*n)\n fX2[i] = fX1[i] + fStep*fD1[i];\n fD2[i] = fD1[i] - 2*n[i]*cosi;\n } \/\/ i\n if(not absorbed){\n ray.SetDirection(fD2);\n } \/\/ if\n\n \/\/ step (m), c (m\/s)\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::TraceNonSequential(ARay& ray)\n{\n Double_t lambda = ray.GetLambda();\n while(ray.IsRunning()){\n \/\/Double_t fX1[4]; \/\/ start point\n \/\/Double_t fX2[3]; \/\/ end point\n \/\/Double_t fD1[3]; \/\/ start direction\n \/\/Double_t fD2[3]; \/\/ end direction\n ray.GetLastPoint(fX1);\n ray.GetDirection(fD1);\n\n fStartNode = InitTrack(fX1, fD1); \/\/ start node\n if(IsOutside()){ \/\/ if the current position is outside of top volume\n fStartNode = 0;\n } \/\/ if\n\n fEndNode = FindNextBoundaryAndStep();\n\n \/\/ Check type of start node\n if ( !fStartNode) fTypeStart = kNull;\n else if( IsLens(fStartNode)) fTypeStart = kLens;\n else if( IsObscuration(fStartNode)) fTypeStart = kObs;\n else if( IsMirror(fStartNode)) fTypeStart = kMirror;\n else if(IsOpticalComponent(fStartNode)) fTypeStart = kOpt;\n else if( IsFocalSurface(fStartNode)) fTypeStart = kFocus;\n else fTypeStart = kOther;\n \n \/\/ Check type of end node\n if ( !fEndNode) fTypeEnd = kNull;\n else if( IsLens(fEndNode)) fTypeEnd = kLens;\n else if( IsObscuration(fEndNode)) fTypeEnd = kObs;\n else if( IsMirror(fEndNode)) fTypeEnd = kMirror;\n else if(IsOpticalComponent(fEndNode)) fTypeEnd = kOpt;\n else if( IsFocalSurface(fEndNode)) fTypeEnd = kFocus;\n else fTypeEnd = kOther;\n\n fStep = GetStep(); \/\/ distance to the next boundary\n if(fTypeEnd == kMirror){\n fStep -= kEpsilon; \/\/ make sure that the photon do NOT cross the boundary\n } else {\n fStep += kEpsilon; \/\/ make sure that the photon crosses the boundary\n } \/\/ if\n\n if(fTypeStart == kLens){\n Double_t abs = ((ALens*)fStartNode->GetVolume())->GetAbsorptionLength(lambda);\n if(abs > 0){\n Double_t abs_step = gRandom->Exp(abs);\n if(abs_step < fStep){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n Double_t speed = TMath::C()*m()\/n1;\n ray.AddPoint(fX1[0] + fD1[0]*abs_step, fX1[1] + fD1[1]*abs_step, fX1[2] + fD1[2]*abs_step, fX1[3] + abs_step\/speed);\n ray.Absorb();\n continue;\n } \/\/ if\n } \/\/ if\n } \/\/ if\n\n if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kLens or fTypeStart == kOther)\n and fTypeEnd == kMirror){\n Double_t n1 = fTypeStart == kLens ? ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda()) : 1.;\n DoReflection(n1, ray);\n } else if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kOther)\n and fTypeEnd == kLens){\n Double_t n1 = 1; \/\/ Assume refractive index equals 1 (= vacuum)\n Double_t n2 = ((ALens*)fEndNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n DoFresnel(n1, n2, ray);\n } else if((fTypeStart == kNull or fTypeStart == kLens or fTypeStart == kOpt or fTypeStart == kOther)\n and (fTypeEnd == kObs or fTypeEnd == kFocus)){\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n if (fTypeStart == kLens){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n } else {\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n } \/\/ if\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n } else if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kOther)\n and (fTypeEnd == kOther or fTypeEnd == kOpt)){\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n } else if(fTypeStart == kLens and fTypeEnd == kLens){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(lambda);\n Double_t n2 = ((ALens*)fEndNode->GetVolume())->GetRefractiveIndex(lambda);\n DoFresnel(n1, n2, ray);\n } else if(fTypeStart == kLens and\n (fTypeEnd == kNull or fTypeEnd == kOpt or fTypeEnd == kOther)){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(lambda);\n Double_t n2 = 1; \/\/ Assume refractive index equals 1 (= vacuum)\n DoFresnel(n1, n2, ray);\n } \/\/ if\n\n if(fTypeEnd == kNull){\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n ray.Exit();\n } else if(fTypeStart == kFocus or fTypeStart == kObs or fTypeStart == kMirror or fTypeEnd == kObs){\n ray.Stop();\n } else if(fTypeEnd == kFocus){\n ray.Focus();\n } \/\/ if\n\n if(ray.IsRunning() and ray.GetNpoints() >= fLimit){\n ray.Suspend();\n } \/\/ if\n\n } \/\/ while\n}\n \n\/\/_____________________________________________________________________________\nvoid AOpticsManager::TraceNonSequential(ARayArray& array)\n{\n TObjArray* running = array.GetRunning();\n\n#ifdef MULTI_THREAD_NAVIGATION\n omp_set_num_threads(fNThreads);\n#pragma omp parallel\n#pragma omp parallel for\n#endif\n for(Int_t i = 0; i <= running->GetLast(); i++){\n ARay* ray = (ARay*)(*running)[i];\n if(!ray) continue;\n\n ray = (ARay*)running->RemoveAt(i);\n TraceNonSequential(*ray);\n array.Add(ray);\n } \/\/ i\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::SetLimit(Int_t n)\n{\n if(n > 0){\n fLimit = n;\n } \/\/ if\n}\n<commit_msg>cd: changed root version from 32 to 34 to avoid multithreading<commit_after>\/\/ $Id$\n\/\/ Author: Akira Okumura 2007\/09\/24\n\n\/******************************************************************************\n * Copyright (C) 2006-, Akira Okumura *\n * All rights reserved. *\n *****************************************************************************\/\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ AOpticsManager\n\/\/\n\/\/ Manager of optics\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"TRandom.h\"\n#include \"RVersion.h\"\n\n#include \"AOpticsManager.h\"\n\n#ifdef _OPENMP\n#include <omp.h>\n#if ROOT_VERSION_CODE >= ROOT_VERSION(5,34,0)\n#define MULTI_THREAD_NAVIGATION\n#endif\n#endif\n\nstatic const Double_t kEpsilon = 1e-6; \/\/ Fixed in TGeoNavigator.cxx (equiv to 1e-6 cm)\n\nClassImp(AOpticsManager)\n\n\/\/_____________________________________________________________________________\nAOpticsManager::AOpticsManager() : TGeoManager(), fDisableFresnelReflection(kFALSE)\n{\n fLimit = 100;\n fNThreads = 1;\n#ifdef MULTI_THREAD_NAVIGATION\n SetMultiThread(kTRUE);\n#endif\n}\n\n\/\/_____________________________________________________________________________\nAOpticsManager::AOpticsManager(const char* name, const char* title)\n : TGeoManager(name, title), fDisableFresnelReflection(kFALSE)\n{\n fLimit = 100;\n fNThreads = 1;\n#ifdef MULTI_THREAD_NAVIGATION\n SetMultiThread(kTRUE);\n#endif\n}\n\n\/\/_____________________________________________________________________________\nAOpticsManager::~AOpticsManager()\n{\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::DoFresnel(Double_t n1, Double_t n2, ARay& ray)\n{\n \/\/ Use the same notation used in Wikipedia\n \/\/ http:\/\/en.wikipedia.org\/wiki\/Fresnel_equations\n \/\/ theta_i = incident angle\n \/\/ theta_t = transmission angle\n Double_t* n = FindNormal(); \/\/ normal vect perpendicular to the surface\n Double_t cosi = fD1[0]*n[0] + fD1[1]*n[1] + fD1[2]*n[2]; \/\/ cos(theta_i)\n Double_t sini = TMath::Sqrt(1 - cosi*cosi);\n Double_t sint = n1*sini\/n2; \/\/ Snell's law\n\n if(sint > 1.){ \/\/ total internal reflection\n fStep -= kEpsilon*2.; \/\/ stop the step before reaching the boundary\n DoReflection(n1, ray);\n return;\n } \/\/ if\n\n Double_t cost = TMath::Sqrt(1 - sint*sint);\n\n if(fDisableFresnelReflection == kFALSE){\n Double_t Rs = TMath::Power((n1*cosi - n2*cost)\/(n1*cosi + n2*cost), 2); \/\/ reflectivity for s-polarized photon\n Double_t Rp = TMath::Power((n1*cost - n2*cosi)\/(n1*cost + n2*cosi), 2); \/\/ reflectivity for p-polarized photon\n Double_t R = (Rs + Rp)\/2.; \/\/ We assume that polarization is random\n\n if(gRandom->Uniform(1) < R){ \/\/ reflection at the boundary\n fStep -= kEpsilon*2.; \/\/ stop the step before reaching the boundary\n DoReflection(n1, ray);\n return;\n } \/\/ if\n } \/\/ if\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n fD2[i] = (fD1[i] - cosi*n[i])*sint\/sini + n[i]*cost;\n } \/\/ i\n ray.SetDirection(fD2);\n\n \/\/ step (m), c (m\/s)\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::DoReflection(Double_t n1, ARay& ray)\n{\n Double_t* n = FindNormal(); \/\/ normal vect perpendicular to the surface\n Double_t cosi = fD1[0]*n[0] + fD1[1]*n[1] + fD1[2]*n[2];\n\n Bool_t absorbed = kFALSE;\n\n if(fTypeEnd == kMirror){\n Double_t angle = TMath::ACos(cosi)*TMath::RadToDeg();\n Double_t lambda = ray.GetLambda();\n Double_t ref = ((AMirror*)fEndNode->GetVolume())->GetReflectivity(lambda, angle);\n if(ref < gRandom->Uniform(1)){\n absorbed = kTRUE;\n ray.Absorb();\n } \/\/ if\n } \/\/ if\n\n for(Int_t i = 0; i < 3; i++){ \/\/ d2 = d1 - 2n*(d1*n)\n fX2[i] = fX1[i] + fStep*fD1[i];\n fD2[i] = fD1[i] - 2*n[i]*cosi;\n } \/\/ i\n if(not absorbed){\n ray.SetDirection(fD2);\n } \/\/ if\n\n \/\/ step (m), c (m\/s)\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::TraceNonSequential(ARay& ray)\n{\n Double_t lambda = ray.GetLambda();\n while(ray.IsRunning()){\n \/\/Double_t fX1[4]; \/\/ start point\n \/\/Double_t fX2[3]; \/\/ end point\n \/\/Double_t fD1[3]; \/\/ start direction\n \/\/Double_t fD2[3]; \/\/ end direction\n ray.GetLastPoint(fX1);\n ray.GetDirection(fD1);\n\n fStartNode = InitTrack(fX1, fD1); \/\/ start node\n if(IsOutside()){ \/\/ if the current position is outside of top volume\n fStartNode = 0;\n } \/\/ if\n\n fEndNode = FindNextBoundaryAndStep();\n\n \/\/ Check type of start node\n if ( !fStartNode) fTypeStart = kNull;\n else if( IsLens(fStartNode)) fTypeStart = kLens;\n else if( IsObscuration(fStartNode)) fTypeStart = kObs;\n else if( IsMirror(fStartNode)) fTypeStart = kMirror;\n else if(IsOpticalComponent(fStartNode)) fTypeStart = kOpt;\n else if( IsFocalSurface(fStartNode)) fTypeStart = kFocus;\n else fTypeStart = kOther;\n \n \/\/ Check type of end node\n if ( !fEndNode) fTypeEnd = kNull;\n else if( IsLens(fEndNode)) fTypeEnd = kLens;\n else if( IsObscuration(fEndNode)) fTypeEnd = kObs;\n else if( IsMirror(fEndNode)) fTypeEnd = kMirror;\n else if(IsOpticalComponent(fEndNode)) fTypeEnd = kOpt;\n else if( IsFocalSurface(fEndNode)) fTypeEnd = kFocus;\n else fTypeEnd = kOther;\n\n fStep = GetStep(); \/\/ distance to the next boundary\n if(fTypeEnd == kMirror){\n fStep -= kEpsilon; \/\/ make sure that the photon do NOT cross the boundary\n } else {\n fStep += kEpsilon; \/\/ make sure that the photon crosses the boundary\n } \/\/ if\n\n if(fTypeStart == kLens){\n Double_t abs = ((ALens*)fStartNode->GetVolume())->GetAbsorptionLength(lambda);\n if(abs > 0){\n Double_t abs_step = gRandom->Exp(abs);\n if(abs_step < fStep){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n Double_t speed = TMath::C()*m()\/n1;\n ray.AddPoint(fX1[0] + fD1[0]*abs_step, fX1[1] + fD1[1]*abs_step, fX1[2] + fD1[2]*abs_step, fX1[3] + abs_step\/speed);\n ray.Absorb();\n continue;\n } \/\/ if\n } \/\/ if\n } \/\/ if\n\n if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kLens or fTypeStart == kOther)\n and fTypeEnd == kMirror){\n Double_t n1 = fTypeStart == kLens ? ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda()) : 1.;\n DoReflection(n1, ray);\n } else if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kOther)\n and fTypeEnd == kLens){\n Double_t n1 = 1; \/\/ Assume refractive index equals 1 (= vacuum)\n Double_t n2 = ((ALens*)fEndNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n DoFresnel(n1, n2, ray);\n } else if((fTypeStart == kNull or fTypeStart == kLens or fTypeStart == kOpt or fTypeStart == kOther)\n and (fTypeEnd == kObs or fTypeEnd == kFocus)){\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n if (fTypeStart == kLens){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(ray.GetLambda());\n Double_t speed = TMath::C()*m()\/n1;\n fX2[3] = fX1[3] + fStep\/speed;\n } else {\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n } \/\/ if\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n } else if((fTypeStart == kNull or fTypeStart == kOpt or fTypeStart == kOther)\n and (fTypeEnd == kOther or fTypeEnd == kOpt)){\n\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n } else if(fTypeStart == kLens and fTypeEnd == kLens){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(lambda);\n Double_t n2 = ((ALens*)fEndNode->GetVolume())->GetRefractiveIndex(lambda);\n DoFresnel(n1, n2, ray);\n } else if(fTypeStart == kLens and\n (fTypeEnd == kNull or fTypeEnd == kOpt or fTypeEnd == kOther)){\n Double_t n1 = ((ALens*)fStartNode->GetVolume())->GetRefractiveIndex(lambda);\n Double_t n2 = 1; \/\/ Assume refractive index equals 1 (= vacuum)\n DoFresnel(n1, n2, ray);\n } \/\/ if\n\n if(fTypeEnd == kNull){\n for(Int_t i = 0; i < 3; i++){\n fX2[i] = fX1[i] + fStep*fD1[i];\n } \/\/ i\n Double_t speed = TMath::C()*m();\n fX2[3] = fX1[3] + fStep\/speed;\n ray.AddPoint(fX2[0], fX2[1], fX2[2], fX2[3]);\n ray.Exit();\n } else if(fTypeStart == kFocus or fTypeStart == kObs or fTypeStart == kMirror or fTypeEnd == kObs){\n ray.Stop();\n } else if(fTypeEnd == kFocus){\n ray.Focus();\n } \/\/ if\n\n if(ray.IsRunning() and ray.GetNpoints() >= fLimit){\n ray.Suspend();\n } \/\/ if\n\n } \/\/ while\n}\n \n\/\/_____________________________________________________________________________\nvoid AOpticsManager::TraceNonSequential(ARayArray& array)\n{\n TObjArray* running = array.GetRunning();\n\n#ifdef MULTI_THREAD_NAVIGATION\n omp_set_num_threads(fNThreads);\n#pragma omp parallel\n#pragma omp parallel for\n#endif\n for(Int_t i = 0; i <= running->GetLast(); i++){\n ARay* ray = (ARay*)(*running)[i];\n if(!ray) continue;\n\n ray = (ARay*)running->RemoveAt(i);\n TraceNonSequential(*ray);\n array.Add(ray);\n } \/\/ i\n}\n\n\/\/_____________________________________________________________________________\nvoid AOpticsManager::SetLimit(Int_t n)\n{\n if(n > 0){\n fLimit = n;\n } \/\/ if\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file kalmen.hpp\n * @author Vahid Bastani\n *\n *\/\n#ifndef SSMPACK_FILTER_KALMAN_HPP\n#define SSMPACK_FILTER_KALMAN_HPP\n\n#include \"ssmpack\/distribution\/gaussian.hpp\"\n#include \"ssmpack\/distribution\/conditional.hpp\"\n#include \"ssmpack\/process\/markov.hpp\"\n#include \"ssmpack\/process\/memoryless.hpp\"\n#include \"ssmpack\/process\/hierarchical.hpp\"\n#include \"ssmpack\/filter\/recursive_bayesian_base.hpp\"\n#include <armadillo>\n\nnamespace ssmpack {\nnamespace filter {\n\nusing process::Hierarchical;\nusing process::Markov;\nusing process::Memoryless;\nusing distribution::Conditional;\nusing distribution::Gaussian;\n\ntemplate <class TProcess>\nclass Kalman;\n\ntemplate <class T1, class T2, size_t D1, size_t D2>\nclass Kalman<Hierarchical<Markov<Conditional<Gaussian<D1>, T1>, Gaussian<D1>>,\n Memoryless<Conditional<Gaussian<D2>, T2>>>>\n : public RecursiveBayesianBase<Kalman<\n Hierarchical<Markov<Conditional<Gaussian<D1>, T1>, Gaussian<D1>>,\n Memoryless<Conditional<Gaussian<D2>, T2>>>>> {\n public:\n using TProcess =\n Hierarchical<Markov<Conditional<Gaussian<D1>, T1>, Gaussian<D1>>,\n Memoryless<Conditional<Gaussian<D2>, T2>>>;\n\n using TCompeleteState =\n std::tuple<arma::vec::fixed<D1>, arma::mat::fixed<D1, D1>>;\nprivate:\n TProcess process_;\n const arma::mat::fixed<D1, D1> &dyn_mat_;\n const arma::mat::fixed<D2, D1> &mes_mat_;\n const arma::mat::fixed<D1, D1> &dyn_cov_;\n const arma::mat::fixed<D2, D2> &mes_cov_;\n arma::vec::fixed<D1> state_vec_;\n arma::mat::fixed<D1, D1> state_cov_;\n arma::vec::fixed<D1> p_state_vec_;\n arma::mat::fixed<D1, D1> p_state_cov_;\n\n public:\n Kalman(const TProcess &process)\n : process_(process),\n dyn_mat_(\n process_.template getProcess<0>().getCPDF().getParamMap().transfer),\n mes_mat_(\n process_.template getProcess<1>().getCPDF().getParamMap().transfer),\n dyn_cov_(process_.template getProcess<0>()\n .getCPDF()\n .getParamMap()\n .covariance),\n mes_cov_(process_.template getProcess<1>()\n .getCPDF()\n .getParamMap()\n .covariance) {}\n\n template <class... TArgs>\n void predict(const TArgs &... args) {\n \/\/ use the map function to pass controls, avoiding control definition\n \/\/ is move used here??\n p_state_vec_ =\n std::get<0>(process_.template getProcess<0>().getCPDF().getParamMap()(\n state_vec_, args...));\n p_state_cov_ = dyn_mat_ * state_cov_ * dyn_mat_.t() + dyn_cov_;\n }\n\n template <class... TArgs>\n TCompeleteState correct(const arma::vec::fixed<D2> &measurement,\n const TArgs &... args) {\n arma::vec inovation =\n measurement -\n std::get<0>(process_.template getProcess<1>().getCPDF().getParamMap()(\n p_state_vec_, args...));\n\n arma::mat inovation_cov = mes_mat_ * p_state_cov_ * mes_mat_.t() + mes_cov_;\n arma::mat kalman_gain =\n p_state_cov_ * mes_mat_.t() * arma::inv_sympd(inovation_cov);\n\n state_vec_ = p_state_vec_ + kalman_gain * inovation;\n state_cov_ = p_state_cov_ - kalman_gain * mes_mat_ * p_state_cov_;\n return std::make_tuple(state_vec_, state_cov_);\n }\n\n TCompeleteState initialize() {\n state_vec_ = process_.template getProcess<0>().getInitialPDF().getMean();\n state_cov_ =\n process_.template getProcess<0>().getInitialPDF().getCovariance();\n return std::make_tuple(state_vec_, state_cov_);\n }\n};\n\ntemplate <class TProcess>\nKalman<TProcess> makeKalman(TProcess process) {\n return Kalman<TProcess>(process);\n}\n\n} \/\/ namespace filter\n} \/\/ namespace ssmpack\n\n#endif \/\/ SSMPACK_FILTER_KALMAN_HPP\n<commit_msg>refactoring: removing unnecessary template specialization<commit_after>\/**\n * @file kalmen.hpp\n * @author Vahid Bastani\n *\n *\/\n#ifndef SSMPACK_FILTER_KALMAN_HPP\n#define SSMPACK_FILTER_KALMAN_HPP\n\n#include \"ssmpack\/distribution\/gaussian.hpp\"\n#include \"ssmpack\/distribution\/conditional.hpp\"\n#include \"ssmpack\/process\/markov.hpp\"\n#include \"ssmpack\/process\/memoryless.hpp\"\n#include \"ssmpack\/process\/hierarchical.hpp\"\n#include \"ssmpack\/filter\/recursive_bayesian_base.hpp\"\n#include <armadillo>\n\nnamespace ssmpack {\nnamespace filter {\n\nusing process::Hierarchical;\nusing process::Markov;\nusing process::Memoryless;\nusing distribution::Conditional;\nusing distribution::Gaussian;\n\ntemplate <class STA_MAP, class OBS_MAP, size_t STA_D, size_t OBS_D>\nclass Kalman\n : public RecursiveBayesianBase<Kalman<STA_MAP, OBS_MAP, STA_D, OBS_D>> {\n\n public:\n using TProcess =\n Hierarchical<Markov<Conditional<Gaussian<STA_D>, STA_MAP>, Gaussian<STA_D>>,\n Memoryless<Conditional<Gaussian<OBS_D>, OBS_MAP>>>;\n\n using TCompeleteState =\n std::tuple<arma::vec::fixed<STA_D>, arma::mat::fixed<STA_D, STA_D>>;\n private:\n TProcess process_;\n const arma::mat::fixed<STA_D, STA_D> &dyn_mat_;\n const arma::mat::fixed<OBS_D, STA_D> &mes_mat_;\n const arma::mat::fixed<STA_D, STA_D> &dyn_cov_;\n const arma::mat::fixed<OBS_D, OBS_D> &mes_cov_;\n arma::vec::fixed<STA_D> state_vec_;\n arma::mat::fixed<STA_D, STA_D> state_cov_;\n arma::vec::fixed<STA_D> p_state_vec_;\n arma::mat::fixed<STA_D, STA_D> p_state_cov_;\n\n public:\n Kalman(const TProcess &process)\n : process_(process),\n dyn_mat_(\n process_.template getProcess<0>().getCPDF().getParamMap().transfer),\n mes_mat_(\n process_.template getProcess<1>().getCPDF().getParamMap().transfer),\n dyn_cov_(process_.template getProcess<0>()\n .getCPDF()\n .getParamMap()\n .covariance),\n mes_cov_(process_.template getProcess<1>()\n .getCPDF()\n .getParamMap()\n .covariance) {}\n template <class... TArgs>\n void predict(const TArgs &... args) {\n \/\/ use the map function to pass controls, avoiding control definition\n \/\/ is move used here??\n p_state_vec_ =\n std::get<0>(process_.template getProcess<0>().getCPDF().getParamMap()(\n state_vec_, args...));\n p_state_cov_ = dyn_mat_ * state_cov_ * dyn_mat_.t() + dyn_cov_;\n }\n\n template <class... TArgs>\n TCompeleteState correct(const arma::vec::fixed<OBS_D> &measurement,\n const TArgs &... args) {\n arma::vec inovation =\n measurement -\n std::get<0>(process_.template getProcess<1>().getCPDF().getParamMap()(\n p_state_vec_, args...));\n\n arma::mat inovation_cov = mes_mat_ * p_state_cov_ * mes_mat_.t() + mes_cov_;\n arma::mat kalman_gain =\n p_state_cov_ * mes_mat_.t() * arma::inv_sympd(inovation_cov);\n\n state_vec_ = p_state_vec_ + kalman_gain * inovation;\n state_cov_ = p_state_cov_ - kalman_gain * mes_mat_ * p_state_cov_;\n return std::make_tuple(state_vec_, state_cov_);\n }\n\n TCompeleteState initialize() {\n state_vec_ = process_.template getProcess<0>().getInitialPDF().getMean();\n state_cov_ =\n process_.template getProcess<0>().getInitialPDF().getCovariance();\n return std::make_tuple(state_vec_, state_cov_);\n }\n};\n\ntemplate <class STA_MAP, class OBS_MAP, size_t STA_D, size_t OBS_D>\nKalman<STA_MAP, OBS_MAP, STA_D, OBS_D> makeKalman(\n Hierarchical<Markov<Conditional<Gaussian<STA_D>, STA_MAP>, Gaussian<STA_D>>,\n Memoryless<Conditional<Gaussian<OBS_D>, OBS_MAP>>> process) {\n return Kalman<STA_MAP, OBS_MAP, STA_D, OBS_D>(process);\n}\n\n} \/\/ namespace filter\n} \/\/ namespace ssmpack\n\n#endif \/\/ SSMPACK_FILTER_KALMAN_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/core\/properties\/propertypresetmanager.h>\n#include <inviwo\/core\/properties\/property.h>\n#include <inviwo\/core\/metadata\/containermetadata.h>\n#include <inviwo\/core\/util\/stdextensions.h>\n#include <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/network\/networklock.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n\nnamespace inviwo {\n\nPropertyPresetManager::PropertyPresetManager() { loadApplicationPresets(); }\n\nbool PropertyPresetManager::loadPreset(const std::string& name, Property* property,\n PropertyPresetType type) const {\n auto apply = [](Property* p, const std::string& data) {\n NetworkLock lock(p);\n std::stringstream ss;\n ss << data;\n Deserializer deserializer(ss, \"\");\n auto app = InviwoApplication::getPtr();\n deserializer.registerFactory(app->getPropertyFactory());\n deserializer.registerFactory(app->getMetaDataFactory());\n \/\/ save current status, except property value, as the preset might overwrite it\n const auto identifier = p->getIdentifier();\n const auto displayName = p->getDisplayName();\n const auto semantics = p->getSemantics();\n const auto readOnly = p->getReadOnly();\n const auto usage = p->getUsageMode();\n p->deserialize(deserializer);\n \/\/ restore property state\n p->setIdentifier(identifier);\n p->setDisplayName(displayName);\n p->setSemantics(semantics);\n p->setReadOnly(readOnly);\n p->setUsageMode(usage);\n };\n\n switch (type) {\n case PropertyPresetType::Property: \n {\n auto pmap = getPropertyPresets(property);\n auto it = std::find_if(pmap.begin(), pmap.end(),\n [&](const auto& pair) { return pair.first == name; });\n if (it != pmap.end()) {\n apply(property, it->second);\n return true;\n }\n break;\n }\n case PropertyPresetType::Workspace:\n {\n auto it = std::find_if(workspacePresets_.begin(), workspacePresets_.end(),\n [&](const auto& item) { return item.name == name; });\n if (it != workspacePresets_.end() &&\n it->classIdentifier == property->getClassIdentifier()) {\n apply(property, it->data);\n return true;\n }\n break;\n }\n case PropertyPresetType::Application:\n {\n auto it = std::find_if(appPresets_.begin(), appPresets_.end(),\n [&](const auto& item) { return item.name == name; });\n if (it != appPresets_.end() && it->classIdentifier == property->getClassIdentifier()) {\n apply(property, it->data);\n return true;\n }\n break;\n }\n default:\n break;\n }\n return false;\n}\n\nvoid PropertyPresetManager::savePreset(const std::string& name, Property* property,\n PropertyPresetType type) {\n if (!property) return;\n\n Serializer serializer(\"\");\n property->serialize(serializer);\n std::stringstream ss;\n serializer.writeFile(ss);\n\n switch (type) {\n case PropertyPresetType::Property: {\n auto& pmap = getPropertyPresets(property);\n pmap[name] = ss.str();\n break;\n }\n case PropertyPresetType::Workspace: {\n workspacePresets_.emplace_back(property->getClassIdentifier(), name, ss.str());\n break;\n }\n case PropertyPresetType::Application: {\n appPresets_.emplace_back(property->getClassIdentifier(), name, ss.str());\n saveApplicationPresets();\n break;\n }\n default:\n break;\n }\n}\n\nbool PropertyPresetManager::removePreset(const std::string& name, PropertyPresetType type,\n Property* property) {\n switch (type) {\n case PropertyPresetType::Property: {\n if (!property) false;\n auto& pmap = getPropertyPresets(property);\n return pmap.erase(name) > 0;\n }\n case PropertyPresetType::Workspace: {\n return util::erase_remove_if(workspacePresets_,\n [&](const auto& item) { return item.name == name; }) > 0;\n }\n case PropertyPresetType::Application: {\n auto removed = util::erase_remove_if(\n appPresets_, [&](const auto& item) { return item.name == name; });\n saveApplicationPresets();\n return removed > 0;\n }\n default:\n return false;\n }\n}\n\nstd::vector<std::string> PropertyPresetManager::getAvailablePresets(\n Property* property, PropertyPresetTypes types) const {\n std::vector<std::string> result;\n if (types & PropertyPresetType::Property) {\n auto pmap = getPropertyPresets(property);\n std::transform(pmap.begin(), pmap.end(), std::back_inserter(result),\n [&](const auto& pair) { return pair.first; });\n }\n if (types & PropertyPresetType::Workspace) {\n std::accumulate(workspacePresets_.begin(), workspacePresets_.end(),\n std::back_inserter(result), [&](auto it, const auto& item) {\n if (item.classIdentifier == property->getClassIdentifier()) {\n *(it++) = item.name;\n }\n return it;\n });\n }\n if (types & PropertyPresetType::Application) {\n std::accumulate(appPresets_.begin(), appPresets_.end(), std::back_inserter(result),\n [&](auto it, const auto& item) {\n if (item.classIdentifier == property->getClassIdentifier()) {\n *(it++) = item.name;\n }\n return it;\n });\n }\n return result;\n}\n\nvoid PropertyPresetManager::loadApplicationPresets() {\n std::string filename = filesystem::getPath(PathType::Settings, \"\/PropertyPresets.ivs\");\n if (filesystem::fileExists(filename)) {\n try {\n Deserializer d(filename);\n d.deserialize(\"PropertyPresets\", appPresets_, \"Preset\");\n } catch (AbortException& e) {\n LogError(e.getMessage());\n } catch (std::exception& e) {\n LogError(e.what());\n }\n }\n}\n\nvoid PropertyPresetManager::saveApplicationPresets() {\n try {\n Serializer s(filesystem::getPath(PathType::Settings, \"\/PropertyPresets.ivs\", true));\n s.serialize(\"PropertyPresets\", appPresets_, \"Preset\");\n s.writeFile();\n } catch (std::exception e) {\n LogWarn(\"Could not write application presets\");\n }\n}\n\nvoid PropertyPresetManager::clearPropertyPresets(Property *property) {\n if (!property) return;\n auto& pmap = getPropertyPresets(property);\n pmap.clear();\n}\n\nvoid PropertyPresetManager::clearWorkspacePresets() { workspacePresets_.clear(); }\n\nvoid PropertyPresetManager::loadWorkspacePresets(Deserializer& d) {\n workspacePresets_.clear();\n d.deserialize(\"PropertyPresets\", workspacePresets_, \"Preset\");\n}\n\nvoid PropertyPresetManager::saveWorkspacePresets(Serializer& s) {\n s.serialize(\"PropertyPresets\", workspacePresets_, \"Preset\");\n}\n\nPropertyPresetManager::Preset::Preset() = default;\n\nPropertyPresetManager::Preset::Preset(std::string id, std::string n, std::string d)\n : classIdentifier(id), name(n), data(d) {}\n\nPropertyPresetManager::Preset::~Preset() = default;\n\nvoid PropertyPresetManager::Preset::serialize(Serializer& s) const {\n s.serialize(\"classIdentifier\", classIdentifier);\n s.serialize(\"name\", name);\n s.serialize(\"data\", data);\n}\n\nvoid PropertyPresetManager::Preset::deserialize(Deserializer& d) {\n d.deserialize(\"classIdentifier\", classIdentifier);\n d.deserialize(\"name\", name);\n d.deserialize(\"data\", data);\n}\n\nstd::map<std::string, std::string>& PropertyPresetManager::getPropertyPresets(Property* property) {\n using MT = StdUnorderedMapMetaData<std::string, std::string>;\n return property->createMetaData<MT>(\"SavedState\")->getMap();\n}\n\n} \/\/ namespace\n<commit_msg>Core: Clang fix for inviwo\/inviwo-dev#1523<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <inviwo\/core\/properties\/propertypresetmanager.h>\n#include <inviwo\/core\/properties\/property.h>\n#include <inviwo\/core\/metadata\/containermetadata.h>\n#include <inviwo\/core\/util\/stdextensions.h>\n#include <inviwo\/core\/util\/filesystem.h>\n#include <inviwo\/core\/network\/networklock.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/properties\/propertyfactory.h>\n#include <inviwo\/core\/metadata\/metadatafactory.h>\n\nnamespace inviwo {\n\nPropertyPresetManager::PropertyPresetManager() { loadApplicationPresets(); }\n\nbool PropertyPresetManager::loadPreset(const std::string& name, Property* property,\n PropertyPresetType type) const {\n auto apply = [](Property* p, const std::string& data) {\n NetworkLock lock(p);\n std::stringstream ss;\n ss << data;\n Deserializer deserializer(ss, \"\");\n auto app = InviwoApplication::getPtr();\n deserializer.registerFactory(app->getPropertyFactory());\n deserializer.registerFactory(app->getMetaDataFactory());\n \/\/ save current status, except property value, as the preset might overwrite it\n const auto identifier = p->getIdentifier();\n const auto displayName = p->getDisplayName();\n const auto semantics = p->getSemantics();\n const auto readOnly = p->getReadOnly();\n const auto usage = p->getUsageMode();\n p->deserialize(deserializer);\n \/\/ restore property state\n p->setIdentifier(identifier);\n p->setDisplayName(displayName);\n p->setSemantics(semantics);\n p->setReadOnly(readOnly);\n p->setUsageMode(usage);\n };\n\n switch (type) {\n case PropertyPresetType::Property: \n {\n auto pmap = getPropertyPresets(property);\n auto it = std::find_if(pmap.begin(), pmap.end(),\n [&](const auto& pair) { return pair.first == name; });\n if (it != pmap.end()) {\n apply(property, it->second);\n return true;\n }\n break;\n }\n case PropertyPresetType::Workspace:\n {\n auto it = std::find_if(workspacePresets_.begin(), workspacePresets_.end(),\n [&](const auto& item) { return item.name == name; });\n if (it != workspacePresets_.end() &&\n it->classIdentifier == property->getClassIdentifier()) {\n apply(property, it->data);\n return true;\n }\n break;\n }\n case PropertyPresetType::Application:\n {\n auto it = std::find_if(appPresets_.begin(), appPresets_.end(),\n [&](const auto& item) { return item.name == name; });\n if (it != appPresets_.end() && it->classIdentifier == property->getClassIdentifier()) {\n apply(property, it->data);\n return true;\n }\n break;\n }\n default:\n break;\n }\n return false;\n}\n\nvoid PropertyPresetManager::savePreset(const std::string& name, Property* property,\n PropertyPresetType type) {\n if (!property) return;\n\n Serializer serializer(\"\");\n property->serialize(serializer);\n std::stringstream ss;\n serializer.writeFile(ss);\n\n switch (type) {\n case PropertyPresetType::Property: {\n auto& pmap = getPropertyPresets(property);\n pmap[name] = ss.str();\n break;\n }\n case PropertyPresetType::Workspace: {\n workspacePresets_.emplace_back(property->getClassIdentifier(), name, ss.str());\n break;\n }\n case PropertyPresetType::Application: {\n appPresets_.emplace_back(property->getClassIdentifier(), name, ss.str());\n saveApplicationPresets();\n break;\n }\n default:\n break;\n }\n}\n\nbool PropertyPresetManager::removePreset(const std::string& name, PropertyPresetType type,\n Property* property) {\n switch (type) {\n case PropertyPresetType::Property: {\n if (!property) return false;\n auto& pmap = getPropertyPresets(property);\n return pmap.erase(name) > 0;\n }\n case PropertyPresetType::Workspace: {\n return util::erase_remove_if(workspacePresets_,\n [&](const auto& item) { return item.name == name; }) > 0;\n }\n case PropertyPresetType::Application: {\n auto removed = util::erase_remove_if(\n appPresets_, [&](const auto& item) { return item.name == name; });\n saveApplicationPresets();\n return removed > 0;\n }\n default:\n return false;\n }\n}\n\nstd::vector<std::string> PropertyPresetManager::getAvailablePresets(\n Property* property, PropertyPresetTypes types) const {\n std::vector<std::string> result;\n if (types & PropertyPresetType::Property) {\n auto pmap = getPropertyPresets(property);\n std::transform(pmap.begin(), pmap.end(), std::back_inserter(result),\n [&](const auto& pair) { return pair.first; });\n }\n if (types & PropertyPresetType::Workspace) {\n std::accumulate(workspacePresets_.begin(), workspacePresets_.end(),\n std::back_inserter(result), [&](auto it, const auto& item) {\n if (item.classIdentifier == property->getClassIdentifier()) {\n *(it++) = item.name;\n }\n return it;\n });\n }\n if (types & PropertyPresetType::Application) {\n std::accumulate(appPresets_.begin(), appPresets_.end(), std::back_inserter(result),\n [&](auto it, const auto& item) {\n if (item.classIdentifier == property->getClassIdentifier()) {\n *(it++) = item.name;\n }\n return it;\n });\n }\n return result;\n}\n\nvoid PropertyPresetManager::loadApplicationPresets() {\n std::string filename = filesystem::getPath(PathType::Settings, \"\/PropertyPresets.ivs\");\n if (filesystem::fileExists(filename)) {\n try {\n Deserializer d(filename);\n d.deserialize(\"PropertyPresets\", appPresets_, \"Preset\");\n } catch (AbortException& e) {\n LogError(e.getMessage());\n } catch (std::exception& e) {\n LogError(e.what());\n }\n }\n}\n\nvoid PropertyPresetManager::saveApplicationPresets() {\n try {\n Serializer s(filesystem::getPath(PathType::Settings, \"\/PropertyPresets.ivs\", true));\n s.serialize(\"PropertyPresets\", appPresets_, \"Preset\");\n s.writeFile();\n } catch (std::exception e) {\n LogWarn(\"Could not write application presets\");\n }\n}\n\nvoid PropertyPresetManager::clearPropertyPresets(Property *property) {\n if (!property) return;\n auto& pmap = getPropertyPresets(property);\n pmap.clear();\n}\n\nvoid PropertyPresetManager::clearWorkspacePresets() { workspacePresets_.clear(); }\n\nvoid PropertyPresetManager::loadWorkspacePresets(Deserializer& d) {\n workspacePresets_.clear();\n d.deserialize(\"PropertyPresets\", workspacePresets_, \"Preset\");\n}\n\nvoid PropertyPresetManager::saveWorkspacePresets(Serializer& s) {\n s.serialize(\"PropertyPresets\", workspacePresets_, \"Preset\");\n}\n\nPropertyPresetManager::Preset::Preset() = default;\n\nPropertyPresetManager::Preset::Preset(std::string id, std::string n, std::string d)\n : classIdentifier(id), name(n), data(d) {}\n\nPropertyPresetManager::Preset::~Preset() = default;\n\nvoid PropertyPresetManager::Preset::serialize(Serializer& s) const {\n s.serialize(\"classIdentifier\", classIdentifier);\n s.serialize(\"name\", name);\n s.serialize(\"data\", data);\n}\n\nvoid PropertyPresetManager::Preset::deserialize(Deserializer& d) {\n d.deserialize(\"classIdentifier\", classIdentifier);\n d.deserialize(\"name\", name);\n d.deserialize(\"data\", data);\n}\n\nstd::map<std::string, std::string>& PropertyPresetManager::getPropertyPresets(Property* property) {\n using MT = StdUnorderedMapMetaData<std::string, std::string>;\n return property->createMetaData<MT>(\"SavedState\")->getMap();\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************\/\/**\n * \\file string.hpp\n * \\author Elliot Goodrich\n *\n * Modified by Davide Faconti\n *\n * Boost Software License - Version 1.0 - August 17th, 2003\n *\n * Permission is hereby granted, free of charge, to any person or organization\n * obtaining a copy of the software and accompanying documentation covered by\n * this license (the \"Software\") to use, reproduce, display, distribute,\n * execute, and transmit the Software, and to prepare derivative works of the\n * Software, and to permit third-parties to whom the Software is furnished to\n * do so, all subject to the following:\n *\n * The copyright notices in the Software and this entire statement, including\n * the above license grant, this restriction and the following disclaimer,\n * must be included in all copies of the Software, in whole or in part, and\n * all derivative works of the Software, unless such copies or derivative\n * works are solely in the form of machine-executable object code generated by\n * a source language processor.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n * SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n * FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *********************************************************************\/\n\n#ifndef INCLUDE_GUARD_2EE24263_BD1F_4E5D_8CDA_A3217E867BF0\n#define INCLUDE_GUARD_2EE24263_BD1F_4E5D_8CDA_A3217E867BF0\n\n#include <algorithm>\n#include <cstddef>\n#include <climits>\n#include <cstring>\n#include <ostream>\n#include <string>\n#include <type_traits>\n\n#include <iostream>\n\nnamespace ssoX {\n\nnamespace detail {\n\nstatic std::size_t const high_bit_mask = static_cast<std::size_t>(1) << (sizeof(std::size_t) * CHAR_BIT - 1);\nstatic std::size_t const sec_high_bit_mask = static_cast<std::size_t>(1) << (sizeof(std::size_t) * CHAR_BIT - 2);\n\ntemplate <typename T>\nunsigned char* uchar_cast(T* p) {\n return reinterpret_cast<unsigned char*>(p);\n}\n\ntemplate <typename T>\nunsigned char const* uchar_cast(T const* p) {\n return reinterpret_cast<unsigned char const*>(p);\n}\n\ntemplate <typename T>\nunsigned char& most_sig_byte(T& obj) {\n return *(reinterpret_cast<unsigned char*>(&obj) + sizeof(obj) - 1);\n}\n\ntemplate <int N>\nbool lsb(unsigned char byte) {\n return byte & (1u << N);\n}\n\ntemplate <int N>\nbool msb(unsigned char byte) {\n return byte & (1u << (CHAR_BIT - N - 1));\n}\n\ntemplate <int N>\nvoid set_lsb(unsigned char& byte, bool bit) {\n if(bit) {\n byte |= 1u << N;\n } else {\n byte &= ~(1u << N);\n }\n}\n\ntemplate <int N>\nvoid set_msb(unsigned char& byte, bool bit) {\n if(bit) {\n byte |= 1u << (CHAR_BIT - N - 1);\n } else {\n byte &= ~(1u << (CHAR_BIT - N - 1));\n }\n}\n\n}\n\ntemplate <size_t MAX_SIZE, typename CharT,\n typename Traits = std::char_traits<CharT>>\nclass basic_string {\n typedef typename std::make_unsigned<CharT>::type UCharT;\npublic:\n basic_string() noexcept\n : basic_string(\"\", static_cast<std::size_t>(0)) {\n }\n\n basic_string(CharT const* string, std::size_t size) {\n\n static_assert( MAX_SIZE >= 24 && MAX_SIZE <= 63, \"Size must be >=24 && <= 63\" );\n\n if(size <= sso_capacity) {\n Traits::move(m_data.sso.string, string, size);\n Traits::assign(m_data.sso.string[size], static_cast<CharT>(0));\n set_sso_size(size);\n } else {\n size_t new_size = std::max( sso_capacity*2, size );\n m_data.non_sso.ptr = new CharT[new_size +1 ];\n Traits::move(m_data.non_sso.ptr, string, size);\n Traits::assign(m_data.non_sso.ptr[size], static_cast<CharT>(0));\n set_non_sso_data(size, size);\n }\n }\n\n basic_string(CharT const* string)\n : basic_string{string, std::strlen(string)} {\n }\n\n basic_string(const basic_string& other) {\n if(other.sso()) {\n m_data.sso = other.m_data.sso;\n } else {\n new (this) basic_string{other.data(), other.size() };\n }\n }\n\n basic_string(basic_string&& other) noexcept {\n m_data = other.m_data;\n other.set_moved_from();\n }\n\n\n void reserve(size_t) noexcept {\n \/\/not implemented\n }\n\n basic_string(const std::basic_string<CharT>& other):\n basic_string( other.c_str(), other.size() )\n {\n\n }\n\n basic_string& operator=(basic_string const& other) {\n auto copy = other;\n swap(copy, *this);\n return *this;\n }\n\n basic_string& operator=(basic_string&& other) {\n this->~basic_string();\n m_data = other.m_data;\n other.set_moved_from();\n return *this;\n }\n\n basic_string& operator=(const std::basic_string<CharT>& other) {\n *this = basic_string( other.data(), other.size() );\n return *this;\n }\n\n basic_string operator+(basic_string const& other) {\n basic_string out( *this) ;\n out.append( other.data(), other.size() );\n return out;\n }\n\n void resize( size_t new_size)\n {\n size_t old_size = this->size();\n if(new_size <= sso_capacity) {\n if( this->sso() == false ) {\n CharT* ptr = m_data.non_sso.ptr;\n Traits::move( m_data.sso.string, ptr, std::min(old_size, new_size) );\n delete[] ptr;\n }\n Traits::assign(m_data.sso.string[new_size], static_cast<CharT>(0));\n set_sso_size(new_size);\n } else {\n new_size = std::min( sso_capacity*2, new_size );\n CharT* ptr = new CharT[new_size + 1];\n\n if( this->sso() == false ) {\n Traits::move( ptr, m_data.non_sso.ptr, std::min(old_size, new_size) );\n delete[] m_data.non_sso.ptr ;\n }\n else{\n Traits::move( ptr, m_data.sso.string, std::min(old_size, new_size) );\n new_size = std::min( sso_capacity*2, new_size );\n m_data.non_sso.ptr = new CharT[new_size + 1];\n }\n m_data.non_sso.ptr = ptr;\n Traits::assign(m_data.non_sso.ptr[new_size], static_cast<CharT>(0));\n set_non_sso_data(new_size, new_size);\n }\n }\n\n basic_string& append(const basic_string& other)\n {\n return append( other.data(), other.size() );\n }\n\n basic_string& append(CharT const* string)\n {\n return append( string, std::strlen(string) );\n }\n\n basic_string& append(CharT const* string,size_t length)\n {\n size_t old_size = this->size();\n size_t new_size = old_size + length ;\n\n this->resize( new_size );\n\n if(new_size <= sso_capacity) {\n Traits::move( &m_data.sso.string[old_size], string, length);\n Traits::assign(m_data.sso.string[new_size], static_cast<CharT>(0));\n } else {\n Traits::move( &m_data.non_sso.ptr[old_size], string, length);\n Traits::assign(m_data.non_sso.ptr[new_size], static_cast<CharT>(0));\n }\n return *this;\n }\n\n ~basic_string() {\n if(!sso()) {\n delete[] m_data.non_sso.ptr;\n }\n }\n\n CharT const* data() const noexcept {\n return sso() ? m_data.sso.string : m_data.non_sso.ptr;\n }\n\n std::size_t size() const noexcept {\n if(sso()) {\n return sso_size();\n } else {\n return read_non_sso_data().first;\n }\n }\n\n const char at( size_t index )\n {\n return data()[index];\n }\n\n const char at( size_t index ) const\n {\n return data()[index];\n }\n\n std::size_t capacity() const noexcept {\n if(sso()) {\n return sizeof(m_data) - 1;\n } else {\n return read_non_sso_data().second;\n }\n }\n\n friend void swap(basic_string& lhs, basic_string& rhs) {\n std::swap(lhs.m_data, rhs.m_data);\n }\n\n \/\/ We are using sso if the last two bits are 0\n bool isSso() const noexcept {\n return sso();\n }\n\n int compare(const basic_string& other)\n {\n return strcmp( data(), other.data() );\n }\n\n std::basic_string<CharT> toStdString() const {\n return std::basic_string<CharT>(data(), size() );\n }\n\n\nprivate:\n void set_moved_from() {\n set_sso_size(0);\n }\n\n \/\/ We are using sso if the last two bits are 0\n bool sso() const noexcept {\n return !detail::lsb<0>(m_data.sso.size) && !detail::lsb<1>(m_data.sso.size);\n }\n\n \/\/ good\n void set_sso_size(unsigned char size) noexcept {\n m_data.sso.size = static_cast<UCharT>(sso_capacity - size) << 2;\n }\n\n \/\/ good\n std::size_t sso_size() const noexcept {\n return sso_capacity - ((m_data.sso.size >> 2) & 63u);\n }\n\n void set_non_sso_data(std::size_t size, std::size_t capacity) {\n auto& size_hsb = detail::most_sig_byte(size);\n auto const size_high_bit = detail::msb<0>(size_hsb);\n\n auto& cap_hsb = detail::most_sig_byte(capacity);\n auto const cap_high_bit = detail::msb<0>(cap_hsb);\n auto const cap_sec_high_bit = detail::msb<1>(cap_hsb);\n\n detail::set_msb<0>(size_hsb, cap_sec_high_bit);\n\n cap_hsb <<= 2;\n detail::set_lsb<0>(cap_hsb, cap_high_bit);\n detail::set_lsb<1>(cap_hsb, !size_high_bit);\n\n m_data.non_sso.size = size;\n m_data.non_sso.capacity = capacity;\n }\n\n std::pair<std::size_t, std::size_t> read_non_sso_data() const {\n auto size = m_data.non_sso.size;\n auto capacity = m_data.non_sso.capacity;\n\n auto& size_hsb = detail::most_sig_byte(size);\n auto& cap_hsb = detail::most_sig_byte(capacity);\n\n \/\/ Remember to negate the high bits\n auto const cap_high_bit = detail::lsb<0>(cap_hsb);\n auto const size_high_bit = !detail::lsb<1>(cap_hsb);\n auto const cap_sec_high_bit = detail::msb<0>(size_hsb);\n\n detail::set_msb<0>(size_hsb, size_high_bit);\n\n cap_hsb >>= 2;\n detail::set_msb<0>(cap_hsb, cap_high_bit);\n detail::set_msb<1>(cap_hsb, cap_sec_high_bit);\n\n return std::make_pair(size, capacity);\n }\n\nprivate:\n union Data {\n struct NonSSO {\n CharT overhead[MAX_SIZE + sizeof(UCharT) - sizeof(CharT*) -2*sizeof(std::size_t) ]; \/\/waster memory to keep the alignment\n CharT* ptr;\n std::size_t size;\n std::size_t capacity;\n } non_sso;\n struct SSO {\n CharT string [ sizeof(NonSSO) \/ sizeof(CharT) - 1];\n UCharT size;\n } sso;\n } m_data;\n\npublic:\n static std::size_t const sso_capacity = sizeof(typename Data::NonSSO) \/ sizeof(CharT) - 1;\n};\n\ntemplate <size_t MAX_SIZE, typename CharT, typename Traits>\nbool operator==(const basic_string<MAX_SIZE,CharT, Traits>& lhs, const CharT* rhs) noexcept {\n return !std::strcmp(lhs.data(), rhs);\n}\n\ntemplate <size_t MAX_SIZE, typename CharT, typename Traits>\nbool operator==(const CharT* lhs, const basic_string<MAX_SIZE,CharT, Traits>& rhs) noexcept {\n return rhs == lhs;\n}\n\ntemplate <size_t MAX_SIZE_A, size_t MAX_SIZE_B,\n typename CharT, typename Traits>\nbool operator==(const basic_string<MAX_SIZE_A, CharT, Traits>& lhs,\n const basic_string<MAX_SIZE_B, CharT, Traits>& rhs) noexcept {\n if(lhs.size() != rhs.size()) return false;\n return !std::strcmp(lhs.data(), rhs.data());\n}\n\ntemplate <size_t MAX_SIZE,typename CharT, typename Traits>\nstd::ostream& operator<<(std::ostream& stream, const basic_string<MAX_SIZE,CharT, Traits>& string) {\n return stream << string.data();\n}\n\ntemplate <size_t MAX_SIZE_A, size_t MAX_SIZE_B,\n typename CharT, typename Traits>\nbool operator < (const basic_string<MAX_SIZE_A,CharT, Traits>& lhs,\n const basic_string<MAX_SIZE_B,CharT, Traits>& rhs) noexcept {\n return std::strcmp(lhs.data(), rhs.data()) < 0;\n}\n\n\n}\n\n#endif\n<commit_msg>fixing issue in resize (to be tested)<commit_after>\/******************************************************************\/\/**\n * \\file string.hpp\n * \\author Elliot Goodrich\n *\n * Modified by Davide Faconti\n *\n * Boost Software License - Version 1.0 - August 17th, 2003\n *\n * Permission is hereby granted, free of charge, to any person or organization\n * obtaining a copy of the software and accompanying documentation covered by\n * this license (the \"Software\") to use, reproduce, display, distribute,\n * execute, and transmit the Software, and to prepare derivative works of the\n * Software, and to permit third-parties to whom the Software is furnished to\n * do so, all subject to the following:\n *\n * The copyright notices in the Software and this entire statement, including\n * the above license grant, this restriction and the following disclaimer,\n * must be included in all copies of the Software, in whole or in part, and\n * all derivative works of the Software, unless such copies or derivative\n * works are solely in the form of machine-executable object code generated by\n * a source language processor.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT\n * SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE\n * FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,\n * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n *********************************************************************\/\n\n#ifndef INCLUDE_GUARD_2EE24263_BD1F_4E5D_8CDA_A3217E867BF0\n#define INCLUDE_GUARD_2EE24263_BD1F_4E5D_8CDA_A3217E867BF0\n\n#include <algorithm>\n#include <cstddef>\n#include <climits>\n#include <cstring>\n#include <ostream>\n#include <string>\n#include <type_traits>\n\n#include <iostream>\n\nnamespace ssoX {\n\nnamespace detail {\n\nstatic std::size_t const high_bit_mask = static_cast<std::size_t>(1) << (sizeof(std::size_t) * CHAR_BIT - 1);\nstatic std::size_t const sec_high_bit_mask = static_cast<std::size_t>(1) << (sizeof(std::size_t) * CHAR_BIT - 2);\n\ntemplate <typename T>\nunsigned char* uchar_cast(T* p) {\n return reinterpret_cast<unsigned char*>(p);\n}\n\ntemplate <typename T>\nunsigned char const* uchar_cast(T const* p) {\n return reinterpret_cast<unsigned char const*>(p);\n}\n\ntemplate <typename T>\nunsigned char& most_sig_byte(T& obj) {\n return *(reinterpret_cast<unsigned char*>(&obj) + sizeof(obj) - 1);\n}\n\ntemplate <int N>\nbool lsb(unsigned char byte) {\n return byte & (1u << N);\n}\n\ntemplate <int N>\nbool msb(unsigned char byte) {\n return byte & (1u << (CHAR_BIT - N - 1));\n}\n\ntemplate <int N>\nvoid set_lsb(unsigned char& byte, bool bit) {\n if(bit) {\n byte |= 1u << N;\n } else {\n byte &= ~(1u << N);\n }\n}\n\ntemplate <int N>\nvoid set_msb(unsigned char& byte, bool bit) {\n if(bit) {\n byte |= 1u << (CHAR_BIT - N - 1);\n } else {\n byte &= ~(1u << (CHAR_BIT - N - 1));\n }\n}\n\n}\n\ntemplate <typename CharT, typename Traits = std::char_traits<CharT>>\nclass basic_string {\n typedef typename std::make_unsigned<CharT>::type UCharT;\npublic:\n basic_string() noexcept\n : basic_string(\"\", static_cast<std::size_t>(0)) {\n }\n\n basic_string(CharT const* string, std::size_t size) {\n\n if(size <= sso_capacity) {\n Traits::move(m_data.sso.string, string, size);\n Traits::assign(m_data.sso.string[size], static_cast<CharT>(0));\n set_sso_size(size);\n } else {\n size_t new_size = std::max( sso_capacity*2, size );\n m_data.non_sso.ptr = new CharT[new_size +1 ];\n Traits::move(m_data.non_sso.ptr, string, size);\n Traits::assign(m_data.non_sso.ptr[size], static_cast<CharT>(0));\n set_non_sso_data(size, size);\n }\n }\n\n basic_string(CharT const* string)\n : basic_string{string, std::strlen(string)} {\n }\n\n basic_string(const basic_string& other) {\n if(other.sso()) {\n m_data.sso = other.m_data.sso;\n } else {\n new (this) basic_string{other.data(), other.size() };\n }\n }\n\n basic_string(basic_string&& other) noexcept {\n m_data = other.m_data;\n other.set_moved_from();\n }\n\n\n void reserve(size_t) noexcept {\n \/\/not implemented\n }\n\n basic_string(const std::basic_string<CharT>& other):\n basic_string( other.c_str(), other.size() )\n {\n\n }\n\n basic_string& operator=(basic_string const& other) {\n auto copy = other;\n swap(copy, *this);\n return *this;\n }\n\n basic_string& operator=(basic_string&& other) {\n this->~basic_string();\n m_data = other.m_data;\n other.set_moved_from();\n return *this;\n }\n\n basic_string& operator=(const std::basic_string<CharT>& other) {\n *this = basic_string( other.data(), other.size() );\n return *this;\n }\n\n basic_string operator+(basic_string const& other) {\n basic_string out( *this) ;\n out.append( other.data(), other.size() );\n return out;\n }\n\n void resize( size_t new_size)\n {\n size_t old_size = this->size();\n if(new_size <= sso_capacity) {\n if( this->sso() == false ) {\n CharT* ptr = m_data.non_sso.ptr;\n Traits::move( m_data.sso.string, ptr, std::min(old_size, new_size) );\n delete[] ptr;\n }\n Traits::assign(m_data.sso.string[new_size], static_cast<CharT>(0));\n set_sso_size(new_size);\n } else {\n size_t new_capacity;\n CharT* ptr;\n\n if( this->sso() ){\n \/\/ it was sso. Need to allocate new memory\n new_capacity = sso_capacity*2;\n ptr = new CharT[ new_capacity + 1];\n Traits::move( ptr, m_data.sso.string, std::min(old_size, new_size) );\n m_data.non_sso.ptr = ptr;\n }\n else if( new_size < capacity() ){\n \/\/ it was non_sso. capacity is sufficient. do nothing\n new_capacity = m_data.non_sso.capacity;\n }\n else{\n \/\/ was non_sso, but I need to allocate more memory\n new_capacity = std::max(new_size, capacity()*3\/2);\n ptr = new CharT[ new_capacity + 1];\n Traits::move( ptr, m_data.non_sso.ptr, std::min(old_size, new_size) );\n delete[] m_data.non_sso.ptr ;\n m_data.non_sso.ptr = ptr;\n }\n\n Traits::assign(m_data.non_sso.ptr[new_size], static_cast<CharT>(0));\n set_non_sso_data(new_size, new_capacity);\n }\n }\n\n basic_string& append(const basic_string& other)\n {\n return append( other.data(), other.size() );\n }\n\n basic_string& append(CharT const* string)\n {\n return append( string, std::strlen(string) );\n }\n\n basic_string& append(CharT const* string,size_t length)\n {\n size_t old_size = this->size();\n size_t new_size = old_size + length ;\n\n this->resize( new_size );\n\n if(new_size <= sso_capacity) {\n Traits::move( &m_data.sso.string[old_size], string, length);\n Traits::assign(m_data.sso.string[new_size], static_cast<CharT>(0));\n } else {\n Traits::move( &m_data.non_sso.ptr[old_size], string, length);\n Traits::assign(m_data.non_sso.ptr[new_size], static_cast<CharT>(0));\n }\n return *this;\n }\n\n ~basic_string() {\n if(!sso()) {\n delete[] m_data.non_sso.ptr;\n }\n }\n\n CharT const* data() const noexcept {\n return sso() ? m_data.sso.string : m_data.non_sso.ptr;\n }\n\n std::size_t size() const noexcept {\n if(sso()) {\n return sso_size();\n } else {\n return read_non_sso_data().first;\n }\n }\n\n const char at( size_t index )\n {\n return data()[index];\n }\n\n const char at( size_t index ) const\n {\n return data()[index];\n }\n\n std::size_t capacity() const noexcept {\n if(sso()) {\n return sizeof(m_data) - 1;\n } else {\n return read_non_sso_data().second;\n }\n }\n\n friend void swap(basic_string& lhs, basic_string& rhs) {\n std::swap(lhs.m_data, rhs.m_data);\n }\n\n \/\/ We are using sso if the last two bits are 0\n bool isSso() const noexcept {\n return sso();\n }\n\n int compare(const basic_string& other)\n {\n return strcmp( data(), other.data() );\n }\n\n std::basic_string<CharT> toStdString() const {\n return std::basic_string<CharT>(data(), size() );\n }\n\n\nprivate:\n void set_moved_from() {\n set_sso_size(0);\n }\n\n \/\/ We are using sso if the last two bits are 0\n bool sso() const noexcept {\n return !detail::lsb<0>(m_data.sso.size) && !detail::lsb<1>(m_data.sso.size);\n }\n\n \/\/ good\n void set_sso_size(unsigned char size) noexcept {\n m_data.sso.size = static_cast<UCharT>(sso_capacity - size) << 2;\n }\n\n \/\/ good\n std::size_t sso_size() const noexcept {\n return sso_capacity - ((m_data.sso.size >> 2) & 63u);\n }\n\n void set_non_sso_data(std::size_t size, std::size_t capacity) {\n auto& size_hsb = detail::most_sig_byte(size);\n auto const size_high_bit = detail::msb<0>(size_hsb);\n\n auto& cap_hsb = detail::most_sig_byte(capacity);\n auto const cap_high_bit = detail::msb<0>(cap_hsb);\n auto const cap_sec_high_bit = detail::msb<1>(cap_hsb);\n\n detail::set_msb<0>(size_hsb, cap_sec_high_bit);\n\n cap_hsb <<= 2;\n detail::set_lsb<0>(cap_hsb, cap_high_bit);\n detail::set_lsb<1>(cap_hsb, !size_high_bit);\n\n m_data.non_sso.size = size;\n m_data.non_sso.capacity = capacity;\n }\n\n std::pair<std::size_t, std::size_t> read_non_sso_data() const {\n auto size = m_data.non_sso.size;\n auto capacity = m_data.non_sso.capacity;\n\n auto& size_hsb = detail::most_sig_byte(size);\n auto& cap_hsb = detail::most_sig_byte(capacity);\n\n \/\/ Remember to negate the high bits\n auto const cap_high_bit = detail::lsb<0>(cap_hsb);\n auto const size_high_bit = !detail::lsb<1>(cap_hsb);\n auto const cap_sec_high_bit = detail::msb<0>(size_hsb);\n\n detail::set_msb<0>(size_hsb, size_high_bit);\n\n cap_hsb >>= 2;\n detail::set_msb<0>(cap_hsb, cap_high_bit);\n detail::set_msb<1>(cap_hsb, cap_sec_high_bit);\n\n return std::make_pair(size, capacity);\n }\n\nprivate:\n union Data {\n struct NonSSO {\n CharT overhead[ 24 - sizeof(CharT*) - 2*sizeof(CharT*)];\n CharT* ptr;\n std::size_t size;\n std::size_t capacity;\n } non_sso;\n struct SSO {\n CharT string [ sizeof(NonSSO) \/ sizeof(CharT) - 1];\n UCharT size;\n } sso;\n } m_data;\n\npublic:\n static std::size_t const sso_capacity = sizeof(typename Data::NonSSO) \/ sizeof(CharT) - 1;\n};\n\ntemplate <typename CharT, typename Traits>\nbool operator==(const basic_string<CharT, Traits>& lhs, const CharT* rhs) noexcept {\n return !std::strcmp(lhs.data(), rhs);\n}\n\ntemplate <typename CharT, typename Traits>\nbool operator==(const CharT* lhs, const basic_string<CharT, Traits>& rhs) noexcept {\n return rhs == lhs;\n}\n\ntemplate <typename CharT, typename Traits>\nbool operator==(const basic_string<CharT, Traits>& lhs,\n const basic_string<CharT, Traits>& rhs) noexcept {\n if(lhs.size() != rhs.size()) return false;\n return !std::strcmp(lhs.data(), rhs.data());\n}\n\ntemplate <typename CharT, typename Traits>\nstd::ostream& operator<<(std::ostream& stream, const basic_string<CharT, Traits>& string) {\n return stream << string.data();\n}\n\ntemplate <typename CharT, typename Traits>\nbool operator < (const basic_string<CharT, Traits>& lhs,\n const basic_string<CharT, Traits>& rhs) noexcept {\n return std::strcmp(lhs.data(), rhs.data()) < 0;\n}\n\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <functional>\n#include <iostream>\n#include <vector>\n\ntemplate<typename T, typename Key=std::less_equal<T>>\nclass Heap {\n using vt = std::vector<T>;\n using iterator = typename vt::iterator;\n\n vt xs;\n Key key;\n\n void swim(const iterator xit, iterator yit) {\n while (xit != yit) {\n auto it = xit + std::distance(xit, yit) \/ 2;\n\n if (key(*it, *yit)) {break;}\n\n std::swap(*it, *yit);\n }\n }\n\n void sink(const iterator xit, const iterator yit, iterator zit) {\n auto lit = zit + std::distance(xit, zit) + 1;\n\n while (lit < yit) {\n auto rit = lit + 1;\n\n auto it = rit < yit && key(*rit, *lit) ? rit : lit;\n\n if (key(*zit, *it)) {break;}\n\n std::swap(*it, *zit);\n zit = it;\n lit = zit + std::distance(xit, zit) + 1;\n }\n }\n\npublic:\n Heap() : Heap(vt()) {}\n Heap(const vt &xs) : Heap(xs, Key()) {}\n\n Heap(const vt &xs, Key key) : xs(xs), key(key) {\n auto xit = this->xs.rbegin();\n auto yit = this->xs.rend();\n\n auto it = xit + std::distance(xit, yit) \/ 2;\n\n for (; it != yit; ++it) {\n sink(this->xs.begin(), this->xs.end(), it.base() - 1);\n }\n }\n\n typename vt::size_type size() {\n return this->xs.size();\n }\n\n void push(const T &val) {\n xs.push_back(val);\n swim(xs.begin(), xs.end() - 1);\n }\n\n void pop() {\n if (xs.size() == 0) {return;}\n\n std::swap(*xs.begin(), *xs.rbegin());\n\n xs.pop_back();\n\n this->sink(xs.begin(), xs.end(), xs.begin());\n }\n\n T top() {\n return *xs.begin();\n }\n\n vt sort() {\n vt ys(xs.begin(), xs.end());\n\n for (auto it = ys.rbegin(); it != ys.rend(); ++it) {\n std::swap(*it, *ys.begin());\n this->sink(ys.begin(), it.base() - 1, ys.begin());\n }\n\n return ys;\n }\n\n friend std::ostream &\n operator<<(std::ostream &os, const Heap<T, Key> &heap) {\n for (const auto x : heap.xs) {\n os << x << \" \";\n } os << std::endl;\n\n return os;\n }\n};\n<commit_msg>Heap: improve custom ordering support via key<commit_after>#include <functional>\n#include <iostream>\n#include <vector>\n\ntemplate<typename T, typename Key=std::less_equal<T>>\nclass Heap {\n using vt = std::vector<T>;\n using iterator = typename vt::iterator;\n\n vt xs;\n Key key;\n\n void swim(const iterator xit, iterator yit) {\n while (xit != yit) {\n auto it = xit + std::distance(xit, yit) \/ 2;\n\n if (key(*it, *yit)) {break;}\n\n std::swap(*it, *yit);\n }\n }\n\n void sink(const iterator xit, const iterator yit, iterator zit) {\n auto lit = zit + std::distance(xit, zit) + 1;\n\n while (lit < yit) {\n auto rit = lit + 1;\n\n auto it = rit < yit && key(*rit, *lit) ? rit : lit;\n\n if (key(*zit, *it)) {break;}\n\n std::swap(*it, *zit);\n zit = it;\n lit = zit + std::distance(xit, zit) + 1;\n }\n }\n\npublic:\n Heap() : Heap(vt()) {}\n Heap(Key key) : Heap(vt(), key) {}\n Heap(const vt &xs) : Heap(xs, Key()) {}\n\n Heap(const vt &xs, Key key) : xs(xs), key(key) {\n auto xit = this->xs.rbegin();\n auto yit = this->xs.rend();\n\n auto it = xit + std::distance(xit, yit) \/ 2;\n\n for (; it != yit; ++it) {\n sink(this->xs.begin(), this->xs.end(), it.base() - 1);\n }\n }\n\n typename vt::size_type size() {\n return this->xs.size();\n }\n\n void push(const T &val) {\n xs.push_back(val);\n swim(xs.begin(), xs.end() - 1);\n }\n\n void pop() {\n if (xs.size() == 0) {return;}\n\n std::swap(*xs.begin(), *xs.rbegin());\n\n xs.pop_back();\n\n this->sink(xs.begin(), xs.end(), xs.begin());\n }\n\n T top() {\n return *xs.begin();\n }\n\n vt sort() {\n vt ys(xs.begin(), xs.end());\n\n for (auto it = ys.rbegin(); it != ys.rend(); ++it) {\n std::swap(*it, *ys.begin());\n this->sink(ys.begin(), it.base() - 1, ys.begin());\n }\n\n return ys;\n }\n\n friend std::ostream &\n operator<<(std::ostream &os, const Heap<T, Key> &heap) {\n for (const auto x : heap.xs) {\n os << x << \" \";\n } os << std::endl;\n\n return os;\n }\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.20 2004\/01\/29 11:48:46 cargilld\n * Code cleanup changes to get rid of various compiler diagnostic messages.\n *\n * Revision 1.19 2004\/01\/13 19:50:56 peiyongz\n * remove parseContent()\n *\n * Revision 1.17 2003\/12\/17 00:18:35 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.16 2003\/12\/11 21:38:12 peiyongz\n * support for Canonical Representation for Datatype\n *\n * Revision 1.15 2003\/10\/15 14:50:01 peiyongz\n * Bugzilla#22821: locale-sensitive function used to validate 'double' type, patch\n * from jsweeney@spss.com (Jeff Sweeney)\n *\n * Revision 1.14 2003\/09\/23 18:16:07 peiyongz\n * Inplementation for Serialization\/Deserialization\n *\n * Revision 1.13 2003\/05\/18 14:02:05 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.12 2003\/05\/16 06:01:53 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.11 2003\/05\/15 19:07:46 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.10 2003\/05\/09 15:13:46 peiyongz\n * Deprecated toString() in XMLNumber family\n *\n * Revision 1.9 2003\/03\/10 20:55:58 peiyongz\n * Schema Errata E2-40 double\/float\n *\n * Revision 1.8 2003\/02\/02 23:54:43 peiyongz\n * getFormattedString() added to return original and converted value.\n *\n * Revision 1.7 2003\/01\/30 21:55:22 tng\n * Performance: create getRawData which is similar to toString but return the internal data directly, user is not required to delete the returned memory.\n *\n * Revision 1.6 2002\/12\/11 00:20:02 peiyongz\n * Doing businesss in value space. Converting out-of-bound value into special values.\n *\n * Revision 1.5 2002\/11\/04 15:22:05 tng\n * C++ Namespace Support.\n *\n * Revision 1.4 2002\/03\/06 19:13:12 peiyongz\n * Patch: more valid lexcial representation for positive\/negative zero\n *\n * Revision 1.3 2002\/03\/01 18:47:37 peiyongz\n * fix: more valid lexcial representation forms for \"neural zero\"\n *\n * Revision 1.2 2002\/02\/20 18:17:02 tng\n * [Bug 5977] Warnings on generating apiDocs.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:14 peiyongz\n * sane_include\n *\n * Revision 1.4 2001\/11\/28 15:39:26 peiyongz\n * return Type& for operator=\n *\n * Revision 1.3 2001\/11\/22 21:39:00 peiyongz\n * Allow \"0.0\" to be a valid lexcial representation of ZERO.\n *\n * Revision 1.2 2001\/11\/22 20:23:00 peiyongz\n * _declspec(dllimport) and inline warning C4273\n *\n * Revision 1.1 2001\/11\/19 21:33:42 peiyongz\n * Reorganization: Double\/Float\n *\n *\n *\/\n\n#ifndef XML_ABSTRACT_DOUBLE_FLOAT_HPP\n#define XML_ABSTRACT_DOUBLE_FLOAT_HPP\n\n#include <xercesc\/util\/XMLNumber.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/***\n * 3.2.5.1 Lexical representation\n *\n * double values have a lexical representation consisting of a mantissa followed,\n * optionally, by the character \"E\" or \"e\", followed by an exponent.\n *\n * The exponent must be an integer.\n * The mantissa must be a decimal number.\n * The representations for exponent and mantissa must follow the lexical rules\n * for integer and decimal.\n *\n * If the \"E\" or \"e\" and the following exponent are omitted,\n * an exponent value of 0 is assumed.\n***\/\n\n\/***\n * 3.2.4.1 Lexical representation\n *\n * float values have a lexical representation consisting of a mantissa followed,\n * optionally, by the character \"E\" or \"e\", followed by an exponent.\n *\n * The exponent must be an integer.\n * The mantissa must be a decimal number.\n * The representations for exponent and mantissa must follow the lexical rules\n * for integer and decimal.\n *\n * If the \"E\" or \"e\" and the following exponent are omitted,\n * an exponent value of 0 is assumed.\n***\/\n\nclass XMLUTIL_EXPORT XMLAbstractDoubleFloat : public XMLNumber\n{\npublic:\n\n enum LiteralType\n {\n NegINF,\n PosINF,\n NaN,\n SpecialTypeNum,\n Normal\n };\n\n virtual ~XMLAbstractDoubleFloat();\n\n static XMLCh* getCanonicalRepresentation\n (\n const XMLCh* const rawData\n , MemoryManager* const memMgr = XMLPlatformUtils::fgMemoryManager\n );\n\n \/**\n *\n * Deprecated: please use getRawData\n *\n *\/\n virtual XMLCh* toString() const;\n \n virtual XMLCh* getRawData() const;\n\n virtual const XMLCh* getFormattedString() const;\n\n virtual int getSign() const;\n\n MemoryManager* getMemoryManager() const;\n\n \/***\n *\n * The decimal point delimiter for the schema double\/float type is\n * defined to be a period and is not locale-specific. So, it must\n * be replaced with the local-specific delimiter before converting\n * from string to double\/float.\n *\n ***\/\n void normalizeDecimalPoint(char* const toNormal);\n\n \/***\n * Support for Serialization\/De-serialization\n ***\/\n DECL_XSERIALIZABLE(XMLAbstractDoubleFloat)\n\nprotected:\n\n \/\/\n \/\/ To be used by derived class exclusively\n \/\/\n XMLAbstractDoubleFloat(MemoryManager* const manager = XMLPlatformUtils::fgMemoryManager);\n\n void init(const XMLCh* const strValue);\n\n \/**\n\t * Compares this object to the specified object.\n\t * The result is <code>true<\/code> if and only if the argument is not\n\t * <code>null<\/code> and is an <code>XMLAbstractDoubleFloat<\/code> object that contains\n\t * the same <code>int<\/code> value as this object.\n\t *\n\t * @param lValue the object to compare with.\n\t * @param rValue the object to compare against.\n\t * @return <code>true<\/code> if the objects are the same;\n\t * <code>false<\/code> otherwise.\n\t *\/\n\n static int compareValues(const XMLAbstractDoubleFloat* const lValue\n , const XMLAbstractDoubleFloat* const rValue\n , MemoryManager* const manager);\n\n \/\/\n \/\/ to be overwritten by derived class\n \/\/\n virtual void checkBoundary(const XMLCh* const strValue) = 0;\n\nprivate:\n \/\/\n \/\/ Unimplemented\n \/\/\n \/\/ copy ctor\n \/\/ assignment ctor\n \/\/\n XMLAbstractDoubleFloat(const XMLAbstractDoubleFloat& toCopy);\n XMLAbstractDoubleFloat& operator=(const XMLAbstractDoubleFloat& toAssign);\n\n\tvoid normalizeZero(XMLCh* const);\n\n inline bool isSpecialValue() const;\n\n static int compareSpecial(const XMLAbstractDoubleFloat* const specialValue \n , MemoryManager* const manager);\n\n void formatString();\n\nprotected:\n double fValue;\n LiteralType fType;\n bool fDataConverted;\n\nprivate:\n int fSign;\n XMLCh* fRawData;\n\n \/\/\n \/\/ If the original string is not lexcially the same as the five\n \/\/ special value notations, and the value is converted to\n \/\/ special value due underlying platform restriction on data\n \/\/ representation, then this string is constructed and\n \/\/ takes the form \"original_string (special_value_notation)\", \n \/\/ otherwise it is empty.\n \/\/\n XMLCh* fFormattedString;\n MemoryManager* fMemoryManager;\n};\n\ninline bool XMLAbstractDoubleFloat::isSpecialValue() const\n{\n return (fType < SpecialTypeNum);\n}\n\ninline MemoryManager* XMLAbstractDoubleFloat::getMemoryManager() const\n{\n return fMemoryManager;\n}\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<commit_msg>getValue()\/isDataConverted()<commit_after>\/*\n * The Apache Software License, Version 1.1\n *\n * Copyright (c) 2001 The Apache Software Foundation. All rights\n * reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n *\n * 3. The end-user documentation included with the redistribution,\n * if any, must include the following acknowledgment:\n * \"This product includes software developed by the\n * Apache Software Foundation (http:\/\/www.apache.org\/).\"\n * Alternately, this acknowledgment may appear in the software itself,\n * if and wherever such third-party acknowledgments normally appear.\n *\n * 4. The names \"Xerces\" and \"Apache Software Foundation\" must\n * not be used to endorse or promote products derived from this\n * software without prior written permission. For written\n * permission, please contact apache\\@apache.org.\n *\n * 5. Products derived from this software may not be called \"Apache\",\n * nor may \"Apache\" appear in their name, without prior written\n * permission of the Apache Software Foundation.\n *\n * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR\n * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF\n * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.\n * ====================================================================\n *\n * This software consists of voluntary contributions made by many\n * individuals on behalf of the Apache Software Foundation, and was\n * originally based on software copyright (c) 2001, International\n * Business Machines, Inc., http:\/\/www.ibm.com . For more information\n * on the Apache Software Foundation, please see\n * <http:\/\/www.apache.org\/>.\n *\/\n\n\/*\n * $Id$\n * $Log$\n * Revision 1.21 2004\/08\/11 16:50:47 peiyongz\n * getValue()\/isDataConverted()\n *\n * Revision 1.20 2004\/01\/29 11:48:46 cargilld\n * Code cleanup changes to get rid of various compiler diagnostic messages.\n *\n * Revision 1.19 2004\/01\/13 19:50:56 peiyongz\n * remove parseContent()\n *\n * Revision 1.17 2003\/12\/17 00:18:35 cargilld\n * Update to memory management so that the static memory manager (one used to call Initialize) is only for static data.\n *\n * Revision 1.16 2003\/12\/11 21:38:12 peiyongz\n * support for Canonical Representation for Datatype\n *\n * Revision 1.15 2003\/10\/15 14:50:01 peiyongz\n * Bugzilla#22821: locale-sensitive function used to validate 'double' type, patch\n * from jsweeney@spss.com (Jeff Sweeney)\n *\n * Revision 1.14 2003\/09\/23 18:16:07 peiyongz\n * Inplementation for Serialization\/Deserialization\n *\n * Revision 1.13 2003\/05\/18 14:02:05 knoaman\n * Memory manager implementation: pass per instance manager.\n *\n * Revision 1.12 2003\/05\/16 06:01:53 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.11 2003\/05\/15 19:07:46 knoaman\n * Partial implementation of the configurable memory manager.\n *\n * Revision 1.10 2003\/05\/09 15:13:46 peiyongz\n * Deprecated toString() in XMLNumber family\n *\n * Revision 1.9 2003\/03\/10 20:55:58 peiyongz\n * Schema Errata E2-40 double\/float\n *\n * Revision 1.8 2003\/02\/02 23:54:43 peiyongz\n * getFormattedString() added to return original and converted value.\n *\n * Revision 1.7 2003\/01\/30 21:55:22 tng\n * Performance: create getRawData which is similar to toString but return the internal data directly, user is not required to delete the returned memory.\n *\n * Revision 1.6 2002\/12\/11 00:20:02 peiyongz\n * Doing businesss in value space. Converting out-of-bound value into special values.\n *\n * Revision 1.5 2002\/11\/04 15:22:05 tng\n * C++ Namespace Support.\n *\n * Revision 1.4 2002\/03\/06 19:13:12 peiyongz\n * Patch: more valid lexcial representation for positive\/negative zero\n *\n * Revision 1.3 2002\/03\/01 18:47:37 peiyongz\n * fix: more valid lexcial representation forms for \"neural zero\"\n *\n * Revision 1.2 2002\/02\/20 18:17:02 tng\n * [Bug 5977] Warnings on generating apiDocs.\n *\n * Revision 1.1.1.1 2002\/02\/01 22:22:14 peiyongz\n * sane_include\n *\n * Revision 1.4 2001\/11\/28 15:39:26 peiyongz\n * return Type& for operator=\n *\n * Revision 1.3 2001\/11\/22 21:39:00 peiyongz\n * Allow \"0.0\" to be a valid lexcial representation of ZERO.\n *\n * Revision 1.2 2001\/11\/22 20:23:00 peiyongz\n * _declspec(dllimport) and inline warning C4273\n *\n * Revision 1.1 2001\/11\/19 21:33:42 peiyongz\n * Reorganization: Double\/Float\n *\n *\n *\/\n\n#ifndef XML_ABSTRACT_DOUBLE_FLOAT_HPP\n#define XML_ABSTRACT_DOUBLE_FLOAT_HPP\n\n#include <xercesc\/util\/XMLNumber.hpp>\n#include <xercesc\/util\/PlatformUtils.hpp>\n\nXERCES_CPP_NAMESPACE_BEGIN\n\n\/***\n * 3.2.5.1 Lexical representation\n *\n * double values have a lexical representation consisting of a mantissa followed,\n * optionally, by the character \"E\" or \"e\", followed by an exponent.\n *\n * The exponent must be an integer.\n * The mantissa must be a decimal number.\n * The representations for exponent and mantissa must follow the lexical rules\n * for integer and decimal.\n *\n * If the \"E\" or \"e\" and the following exponent are omitted,\n * an exponent value of 0 is assumed.\n***\/\n\n\/***\n * 3.2.4.1 Lexical representation\n *\n * float values have a lexical representation consisting of a mantissa followed,\n * optionally, by the character \"E\" or \"e\", followed by an exponent.\n *\n * The exponent must be an integer.\n * The mantissa must be a decimal number.\n * The representations for exponent and mantissa must follow the lexical rules\n * for integer and decimal.\n *\n * If the \"E\" or \"e\" and the following exponent are omitted,\n * an exponent value of 0 is assumed.\n***\/\n\nclass XMLUTIL_EXPORT XMLAbstractDoubleFloat : public XMLNumber\n{\npublic:\n\n enum LiteralType\n {\n NegINF,\n PosINF,\n NaN,\n SpecialTypeNum,\n Normal\n };\n\n virtual ~XMLAbstractDoubleFloat();\n\n static XMLCh* getCanonicalRepresentation\n (\n const XMLCh* const rawData\n , MemoryManager* const memMgr = XMLPlatformUtils::fgMemoryManager\n );\n\n \/**\n *\n * Deprecated: please use getRawData\n *\n *\/\n virtual XMLCh* toString() const;\n \n virtual XMLCh* getRawData() const;\n\n virtual const XMLCh* getFormattedString() const;\n\n virtual int getSign() const;\n\n MemoryManager* getMemoryManager() const;\n\n inline bool isDataConverted() const;\n\n inline double getValue() const;\n\n \/***\n *\n * The decimal point delimiter for the schema double\/float type is\n * defined to be a period and is not locale-specific. So, it must\n * be replaced with the local-specific delimiter before converting\n * from string to double\/float.\n *\n ***\/\n void normalizeDecimalPoint(char* const toNormal);\n\n \/***\n * Support for Serialization\/De-serialization\n ***\/\n DECL_XSERIALIZABLE(XMLAbstractDoubleFloat)\n\nprotected:\n\n \/\/\n \/\/ To be used by derived class exclusively\n \/\/\n XMLAbstractDoubleFloat(MemoryManager* const manager = XMLPlatformUtils::fgMemoryManager);\n\n void init(const XMLCh* const strValue);\n\n \/**\n\t * Compares this object to the specified object.\n\t * The result is <code>true<\/code> if and only if the argument is not\n\t * <code>null<\/code> and is an <code>XMLAbstractDoubleFloat<\/code> object that contains\n\t * the same <code>int<\/code> value as this object.\n\t *\n\t * @param lValue the object to compare with.\n\t * @param rValue the object to compare against.\n\t * @return <code>true<\/code> if the objects are the same;\n\t * <code>false<\/code> otherwise.\n\t *\/\n\n static int compareValues(const XMLAbstractDoubleFloat* const lValue\n , const XMLAbstractDoubleFloat* const rValue\n , MemoryManager* const manager);\n\n \/\/\n \/\/ to be overwritten by derived class\n \/\/\n virtual void checkBoundary(const XMLCh* const strValue) = 0;\n\nprivate:\n \/\/\n \/\/ Unimplemented\n \/\/\n \/\/ copy ctor\n \/\/ assignment ctor\n \/\/\n XMLAbstractDoubleFloat(const XMLAbstractDoubleFloat& toCopy);\n XMLAbstractDoubleFloat& operator=(const XMLAbstractDoubleFloat& toAssign);\n\n\tvoid normalizeZero(XMLCh* const);\n\n inline bool isSpecialValue() const;\n\n static int compareSpecial(const XMLAbstractDoubleFloat* const specialValue \n , MemoryManager* const manager);\n\n void formatString();\n\nprotected:\n double fValue;\n LiteralType fType;\n bool fDataConverted;\n\nprivate:\n int fSign;\n XMLCh* fRawData;\n\n \/\/\n \/\/ If the original string is not lexcially the same as the five\n \/\/ special value notations, and the value is converted to\n \/\/ special value due underlying platform restriction on data\n \/\/ representation, then this string is constructed and\n \/\/ takes the form \"original_string (special_value_notation)\", \n \/\/ otherwise it is empty.\n \/\/\n XMLCh* fFormattedString;\n MemoryManager* fMemoryManager;\n\n};\n\ninline bool XMLAbstractDoubleFloat::isSpecialValue() const\n{\n return (fType < SpecialTypeNum);\n}\n\ninline MemoryManager* XMLAbstractDoubleFloat::getMemoryManager() const\n{\n return fMemoryManager;\n}\n\ninline bool XMLAbstractDoubleFloat::isDataConverted() const\n{\n return fDataConverted;\n}\n\ninline double XMLAbstractDoubleFloat::getValue() const\n{\n return fValue;\n}\n\nXERCES_CPP_NAMESPACE_END\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2012 The Native Client Authors. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include <cstring>\n#include <string>\n#include <vector>\n\n#include \"native_client\/src\/shared\/platform\/nacl_log.h\"\n#include \"native_client\/src\/shared\/platform\/nacl_time.h\"\n#include \"native_client\/src\/shared\/srpc\/nacl_srpc.h\"\n\n#include \"native_client\/src\/trusted\/sel_universal\/parsing.h\"\n#include \"native_client\/src\/trusted\/sel_universal\/pnacl_emu_handler.h\"\n#include \"native_client\/src\/trusted\/sel_universal\/rpc_universal.h\"\n\nusing std::string;\nusing std::vector;\n\nnamespace {\n\nint\nSendDataChunk(NaClCommandLoop* ncl, nacl_abi_size_t size, const char *data) {\n const string signature = string(\"StreamChunk:C:\");\n NaClSrpcArg in[1];\n NaClSrpcArg* inv[2];\n BuildArgVec(inv, in, 1);\n in[0].tag = NACL_SRPC_ARG_TYPE_CHAR_ARRAY;\n in[0].arrays.carr = static_cast<char*>(malloc(size));\n if (0 == in[0].arrays.carr) {\n NaClLog(LOG_ERROR, \"allocation failed\\n\");\n FreeArrayArgs(inv);\n return -1;\n }\n in[0].u.count = size;\n memcpy(in[0].arrays.carr, data, size);\n\n NaClSrpcArg* outv[1];\n outv[0] = NULL;\n if (!ncl->InvokeNexeRpc(signature, inv, outv)) {\n NaClLog(LOG_ERROR, \"StreamChunk failed\\n\");\n FreeArrayArgs(inv);\n return -1;\n }\n return 0;\n}\n\n\/\/ Stream the file to the client with a series of StreamChunk RPCs.\n\/\/ Rate-limit the sending to bits_per_sec to emulate a download\nbool PnaclStreamFile(NaClCommandLoop* ncl, FILE* input_file,\n int chunk_size, int bits_per_sec) {\n char* data = new char[chunk_size];\n NaClLog(LOG_INFO, \"Streaming file at %d bps\\n\", bits_per_sec);\n uint64_t start_time = NaClGetTimeOfDayMicroseconds();\n size_t data_sent = 0;\n while (!feof(input_file) && !ferror(input_file)) {\n size_t data_read = fread(data, 1, chunk_size, input_file);\n uint64_t cur_elapsed_us = NaClGetTimeOfDayMicroseconds() - start_time;\n uint64_t target_elapsed_us = static_cast<uint64_t>(data_sent + data_read)\n * 8 * 1000000 \/ bits_per_sec;\n if (cur_elapsed_us < target_elapsed_us) {\n uint64_t sleep_us = target_elapsed_us - cur_elapsed_us;\n struct nacl_abi_timespec req;\n struct nacl_abi_timespec rem;\n req.tv_sec = sleep_us \/ 1000000;\n req.tv_nsec = sleep_us % 1000000 * 1000;\n int ret = NaClNanosleep(&req, &rem);\n if (ret == -1) {\n NaClLog(LOG_ERROR, \"NaClNanosleep failed\");\n return false;\n }\n }\n if (SendDataChunk(ncl, static_cast<nacl_abi_size_t>(data_read), data)) {\n return false;\n }\n data_sent += data_read;\n }\n delete data;\n return true;\n}\n\n} \/\/ namespace\n\nbool HandlerPnaclFileStream(NaClCommandLoop* ncl,\n const vector<string>& args) {\n if (args.size() != 4) {\n NaClLog(LOG_ERROR, \"not enough args to file_stream\\n\");\n return false;\n }\n\n FILE* input_file = fopen(args[1].c_str(), \"rb\");\n if (NULL == input_file) {\n NaClLog(LOG_ERROR, \"could not open input file %s\\n\", args[1].c_str());\n return false;\n }\n return PnaclStreamFile(ncl, input_file, strtol(args[2].c_str(), 0, 0),\n strtol(args[3].c_str(), 0, 0));\n}\n<commit_msg>Use scoped_array in pnacl stream tester. This avoids leaking the buffer in the error case.<commit_after>\/*\n * Copyright (c) 2012 The Native Client Authors. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n\n#include <cstring>\n#include <string>\n#include <vector>\n\n#include \"native_client\/src\/include\/nacl_scoped_ptr.h\"\n#include \"native_client\/src\/shared\/platform\/nacl_log.h\"\n#include \"native_client\/src\/shared\/platform\/nacl_time.h\"\n#include \"native_client\/src\/shared\/srpc\/nacl_srpc.h\"\n\n#include \"native_client\/src\/trusted\/sel_universal\/parsing.h\"\n#include \"native_client\/src\/trusted\/sel_universal\/pnacl_emu_handler.h\"\n#include \"native_client\/src\/trusted\/sel_universal\/rpc_universal.h\"\n\nusing std::string;\nusing std::vector;\n\nnamespace {\n\nint\nSendDataChunk(NaClCommandLoop* ncl, nacl_abi_size_t size, const char *data) {\n const string signature = string(\"StreamChunk:C:\");\n NaClSrpcArg in[1];\n NaClSrpcArg* inv[2];\n BuildArgVec(inv, in, 1);\n in[0].tag = NACL_SRPC_ARG_TYPE_CHAR_ARRAY;\n in[0].arrays.carr = static_cast<char*>(malloc(size));\n if (0 == in[0].arrays.carr) {\n NaClLog(LOG_ERROR, \"allocation failed\\n\");\n FreeArrayArgs(inv);\n return -1;\n }\n in[0].u.count = size;\n memcpy(in[0].arrays.carr, data, size);\n\n NaClSrpcArg* outv[1];\n outv[0] = NULL;\n if (!ncl->InvokeNexeRpc(signature, inv, outv)) {\n NaClLog(LOG_ERROR, \"StreamChunk failed\\n\");\n FreeArrayArgs(inv);\n return -1;\n }\n return 0;\n}\n\n\/\/ Stream the file to the client with a series of StreamChunk RPCs.\n\/\/ Rate-limit the sending to bits_per_sec to emulate a download\nbool PnaclStreamFile(NaClCommandLoop* ncl, FILE* input_file,\n int chunk_size, int bits_per_sec) {\n nacl::scoped_array<char> data(new char[chunk_size]);\n NaClLog(LOG_INFO, \"Streaming file at %d bps\\n\", bits_per_sec);\n uint64_t start_time = NaClGetTimeOfDayMicroseconds();\n size_t data_sent = 0;\n while (!feof(input_file) && !ferror(input_file)) {\n size_t data_read = fread(data.get(), 1, chunk_size, input_file);\n uint64_t cur_elapsed_us = NaClGetTimeOfDayMicroseconds() - start_time;\n uint64_t target_elapsed_us = static_cast<uint64_t>(data_sent + data_read)\n * 8 * 1000000 \/ bits_per_sec;\n if (cur_elapsed_us < target_elapsed_us) {\n uint64_t sleep_us = target_elapsed_us - cur_elapsed_us;\n struct nacl_abi_timespec req;\n struct nacl_abi_timespec rem;\n req.tv_sec = sleep_us \/ 1000000;\n req.tv_nsec = sleep_us % 1000000 * 1000;\n int ret = NaClNanosleep(&req, &rem);\n if (ret == -1) {\n NaClLog(LOG_ERROR, \"NaClNanosleep failed\");\n return false;\n }\n }\n if (SendDataChunk(ncl, static_cast<nacl_abi_size_t>(data_read),\n data.get())) {\n return false;\n }\n data_sent += data_read;\n }\n return true;\n}\n\n} \/\/ namespace\n\nbool HandlerPnaclFileStream(NaClCommandLoop* ncl,\n const vector<string>& args) {\n if (args.size() != 4) {\n NaClLog(LOG_ERROR, \"not enough args to file_stream\\n\");\n return false;\n }\n\n FILE* input_file = fopen(args[1].c_str(), \"rb\");\n if (NULL == input_file) {\n NaClLog(LOG_ERROR, \"could not open input file %s\\n\", args[1].c_str());\n return false;\n }\n return PnaclStreamFile(ncl, input_file, strtol(args[2].c_str(), 0, 0),\n strtol(args[3].c_str(), 0, 0));\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __STAN__MCMC__DUALAVERAGE_H__\n#define __STAN__MCMC__DUALAVERAGE_H__\n\n#include <cmath>\n#include <cstddef>\n\n#include <vector>\n#include <cstdio>\n\n#include <sstream>\n\nnamespace stan {\n\n namespace mcmc {\n\n \/**\n * Class implementing Nesterov's dual average algorithm. Use by\n * repeatedly calling update() with the gradient evaluated at\n * xk(). When finished, use the average value of all the xk's by\n * calling xbar().\n *\n * Iterates are shrunk towards a prespecified point x0. The level\n * of shrinkage is controlled by the parameter gamma and gets\n * weaker with each iteration.\n * \n * Note that this is an algorithm for MINIMIZATION, not MAXIMIZATION.\n *\/\n class DualAverage {\n protected:\n std::vector<double> _gbar, _xbar, _x0, _lastx;\n int _k;\n double _gamma;\n\n public:\n \/**\n * Constructor.\n *\n * @param gamma Regularization parameter. Higher values mean that\n * iterates will be shrunk towards x0 more strongly.\n * @param x0 Point towards which iterates are shrunk.\n *\/\n DualAverage(double gamma, const std::vector<double>& x0) \n : _gbar(x0.size(), 0), _xbar(x0.size(), 0), _x0(x0), _lastx(x0),\n _k(0), _gamma(gamma){\n }\n\n \/**\n * Produces the next iterate xk given the current gradient g.\n *\n * @param g The new subgradient\/stochastic gradient.\n * @param xk The next iterate produced by the algorithm.\n *\/\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n xk.resize(_gbar.size());\n double avgeta = 1.0 \/ (_k + 10);\n double xbar_avgeta = pow(_k, -0.75);\n double muk = 0.5 * sqrt(_k) \/ _gamma;\n for (size_t i = 0; i < _gbar.size(); ++i) {\n _gbar[i] = avgeta * g[i] + (1 - avgeta) * _gbar[i];\n xk[i] = _x0[i] - muk * _gbar[i];\n\/\/ fprintf(stderr, \"DUALAVERAGE update %d: g = %f, gbar = %f, lastx = %f\",\n\/\/ _k, g[0], _gbar[0], _lastx[0]);\n _lastx[i] = xk[i];\n _xbar[i] = xbar_avgeta * xk[i] + (1 - xbar_avgeta) * _xbar[i];\n }\n\/\/ fprintf(stderr, \", xk = %f\\n\", xk[0]);\n }\n\n \/**\n * Set the point towards which each iterate is shrunk.\n *\n * @param x0 The point towards each iterate will be shrunk.\n *\/\n void setx0(const std::vector<double>& x0) {\n _x0.assign(x0.begin(), x0.end());\n }\n\n \/**\n * Get the exponentially weighted moving average of all previous\n * iterates.\n *\n * @param xbar Where to return the exponentially weighted moving\n * average of all previous iterates.\n *\/\n void xbar(std::vector<double>& xbar) {\n xbar.assign(_xbar.begin(), _xbar.end());\n }\n \/**\n * Get the average of all previous gradients.\n *\n * @param gbar Where to return the average of all previous gradients.\n *\/\n void gbar(std::vector<double>& gbar) {\n gbar.assign(_gbar.begin(), _gbar.end());\n }\n \/**\n * Get the current iterate.\n *\n * @param xk Where to return the current iterate.\n *\/\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n \/**\n * Get the point towards which we're shrinking the iterates.\n *\n * @param x0 Where to return the point towards which we're\n * shrinking the iterates.\n *\/\n void x0(std::vector<double>& x0) {\n x0.assign(_x0.begin(), _x0.end());\n }\n \/**\n * Return how many iterations we've run for.\n *\n * @return how many iterations we've run for.\n *\/\n int k() { return _k; }\n \/**\n * Return the regularization parameter gamma.\n *\n * @return the regularization parameter gamma.\n *\/\n double gamma() { return _gamma; }\n };\n\n class GrowingBatches {\n protected:\n std::vector<double> _gbar, _xbar, _x0, _lastx;\n int _k, _lastk, _nextk;\n double _gamma;\n\n public:\n GrowingBatches(double gamma, const std::vector<double>& x0) \n : _gbar(x0.size(), 0), _xbar(x0.size(), 0), _x0(x0), _lastx(x0),\n _k(0), _lastk(0), _nextk(1), _gamma(gamma){\n }\n\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n for (size_t i = 0; i < g.size(); ++i)\n _gbar[i] += g[i];\n if (_k == _nextk) {\n for (size_t i = 0; i < g.size(); ++i) {\n std::cerr << \"_lastx[\" << i << \"]\"\n << \" = \" << _lastx[i]\n << \", _gbar[\" << i << \"]\"\n << \" = \" << _gbar[i]\n << std::endl;\n _lastx[i] -= _gamma * _gbar[i] \/ (_nextk - _lastk);\n }\n _gbar.assign(_gbar.size(), 0);\n int temp = _lastk;\n _lastk = _nextk;\n _nextk = _lastk + (_nextk - temp + 1);\n }\n xk = _lastx;\n _xbar = _lastx;\n }\n\n void setx0(const std::vector<double>& x0) {\n _x0 = x0;\n _lastx = x0;\n _xbar = x0;\n fprintf(stderr, \"_lastx[0] = %f\\n\", x0[0]);\n }\n\n void xbar(std::vector<double>& xbar) {\n xbar.assign(_xbar.begin(), _xbar.end());\n }\n void gbar(std::vector<double>& gbar) {\n gbar.assign(_gbar.begin(), _gbar.end());\n }\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n void x0(std::vector<double>& x0) {\n x0.assign(_x0.begin(), _x0.end());\n }\n int k() { return _k; }\n double gamma() { return _gamma; }\n };\n\n class StochasticGradient {\n protected:\n std::vector<double> _lastx;\n int _k;\n double _gamma, _a;\n\n public:\n StochasticGradient(const std::vector<double>& x0, double gamma = 0.5, \n double a = 1.0)\n : _lastx(x0), _k(0), _gamma(gamma), _a(a) {\n }\n\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n xk.resize(g.size());\n double eta = _a * pow(_k, -_gamma);\n for (size_t i = 0; i < g.size(); ++i) {\n xk[i] = _lastx[i] - eta * g[i];\n _lastx[i] = xk[i];\n }\n }\n\n void setlastx(const std::vector<double>& lastx) {\n _lastx.assign(lastx.begin(), lastx.end());\n }\n void setx0(const std::vector<double>& lastx) {\n _lastx.assign(lastx.begin(), lastx.end());\n }\n\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n void xbar(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n int k() { return _k; }\n double gamma() { return _gamma; }\n };\n }\n}\n\n#endif\n<commit_msg>#include <iostream> in dualaverage.hpp<commit_after>#ifndef __STAN__MCMC__DUALAVERAGE_H__\n#define __STAN__MCMC__DUALAVERAGE_H__\n\n#include <cmath>\n#include <cstddef>\n\n#include <vector>\n#include <cstdio>\n\n#include <sstream>\n#include <iostream>\n\nnamespace stan {\n\n namespace mcmc {\n\n \/**\n * Class implementing Nesterov's dual average algorithm. Use by\n * repeatedly calling update() with the gradient evaluated at\n * xk(). When finished, use the average value of all the xk's by\n * calling xbar().\n *\n * Iterates are shrunk towards a prespecified point x0. The level\n * of shrinkage is controlled by the parameter gamma and gets\n * weaker with each iteration.\n * \n * Note that this is an algorithm for MINIMIZATION, not MAXIMIZATION.\n *\/\n class DualAverage {\n protected:\n std::vector<double> _gbar, _xbar, _x0, _lastx;\n int _k;\n double _gamma;\n\n public:\n \/**\n * Constructor.\n *\n * @param gamma Regularization parameter. Higher values mean that\n * iterates will be shrunk towards x0 more strongly.\n * @param x0 Point towards which iterates are shrunk.\n *\/\n DualAverage(double gamma, const std::vector<double>& x0) \n : _gbar(x0.size(), 0), _xbar(x0.size(), 0), _x0(x0), _lastx(x0),\n _k(0), _gamma(gamma){\n }\n\n \/**\n * Produces the next iterate xk given the current gradient g.\n *\n * @param g The new subgradient\/stochastic gradient.\n * @param xk The next iterate produced by the algorithm.\n *\/\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n xk.resize(_gbar.size());\n double avgeta = 1.0 \/ (_k + 10);\n double xbar_avgeta = pow(_k, -0.75);\n double muk = 0.5 * sqrt(_k) \/ _gamma;\n for (size_t i = 0; i < _gbar.size(); ++i) {\n _gbar[i] = avgeta * g[i] + (1 - avgeta) * _gbar[i];\n xk[i] = _x0[i] - muk * _gbar[i];\n\/\/ fprintf(stderr, \"DUALAVERAGE update %d: g = %f, gbar = %f, lastx = %f\",\n\/\/ _k, g[0], _gbar[0], _lastx[0]);\n _lastx[i] = xk[i];\n _xbar[i] = xbar_avgeta * xk[i] + (1 - xbar_avgeta) * _xbar[i];\n }\n\/\/ fprintf(stderr, \", xk = %f\\n\", xk[0]);\n }\n\n \/**\n * Set the point towards which each iterate is shrunk.\n *\n * @param x0 The point towards each iterate will be shrunk.\n *\/\n void setx0(const std::vector<double>& x0) {\n _x0.assign(x0.begin(), x0.end());\n }\n\n \/**\n * Get the exponentially weighted moving average of all previous\n * iterates.\n *\n * @param xbar Where to return the exponentially weighted moving\n * average of all previous iterates.\n *\/\n void xbar(std::vector<double>& xbar) {\n xbar.assign(_xbar.begin(), _xbar.end());\n }\n \/**\n * Get the average of all previous gradients.\n *\n * @param gbar Where to return the average of all previous gradients.\n *\/\n void gbar(std::vector<double>& gbar) {\n gbar.assign(_gbar.begin(), _gbar.end());\n }\n \/**\n * Get the current iterate.\n *\n * @param xk Where to return the current iterate.\n *\/\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n \/**\n * Get the point towards which we're shrinking the iterates.\n *\n * @param x0 Where to return the point towards which we're\n * shrinking the iterates.\n *\/\n void x0(std::vector<double>& x0) {\n x0.assign(_x0.begin(), _x0.end());\n }\n \/**\n * Return how many iterations we've run for.\n *\n * @return how many iterations we've run for.\n *\/\n int k() { return _k; }\n \/**\n * Return the regularization parameter gamma.\n *\n * @return the regularization parameter gamma.\n *\/\n double gamma() { return _gamma; }\n };\n\n class GrowingBatches {\n protected:\n std::vector<double> _gbar, _xbar, _x0, _lastx;\n int _k, _lastk, _nextk;\n double _gamma;\n\n public:\n GrowingBatches(double gamma, const std::vector<double>& x0) \n : _gbar(x0.size(), 0), _xbar(x0.size(), 0), _x0(x0), _lastx(x0),\n _k(0), _lastk(0), _nextk(1), _gamma(gamma){\n }\n\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n for (size_t i = 0; i < g.size(); ++i)\n _gbar[i] += g[i];\n if (_k == _nextk) {\n for (size_t i = 0; i < g.size(); ++i) {\n std::cerr << \"_lastx[\" << i << \"]\"\n << \" = \" << _lastx[i]\n << \", _gbar[\" << i << \"]\"\n << \" = \" << _gbar[i]\n << std::endl;\n _lastx[i] -= _gamma * _gbar[i] \/ (_nextk - _lastk);\n }\n _gbar.assign(_gbar.size(), 0);\n int temp = _lastk;\n _lastk = _nextk;\n _nextk = _lastk + (_nextk - temp + 1);\n }\n xk = _lastx;\n _xbar = _lastx;\n }\n\n void setx0(const std::vector<double>& x0) {\n _x0 = x0;\n _lastx = x0;\n _xbar = x0;\n fprintf(stderr, \"_lastx[0] = %f\\n\", x0[0]);\n }\n\n void xbar(std::vector<double>& xbar) {\n xbar.assign(_xbar.begin(), _xbar.end());\n }\n void gbar(std::vector<double>& gbar) {\n gbar.assign(_gbar.begin(), _gbar.end());\n }\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n void x0(std::vector<double>& x0) {\n x0.assign(_x0.begin(), _x0.end());\n }\n int k() { return _k; }\n double gamma() { return _gamma; }\n };\n\n class StochasticGradient {\n protected:\n std::vector<double> _lastx;\n int _k;\n double _gamma, _a;\n\n public:\n StochasticGradient(const std::vector<double>& x0, double gamma = 0.5, \n double a = 1.0)\n : _lastx(x0), _k(0), _gamma(gamma), _a(a) {\n }\n\n void update(const std::vector<double>& g, std::vector<double>& xk) {\n _k++;\n xk.resize(g.size());\n double eta = _a * pow(_k, -_gamma);\n for (size_t i = 0; i < g.size(); ++i) {\n xk[i] = _lastx[i] - eta * g[i];\n _lastx[i] = xk[i];\n }\n }\n\n void setlastx(const std::vector<double>& lastx) {\n _lastx.assign(lastx.begin(), lastx.end());\n }\n void setx0(const std::vector<double>& lastx) {\n _lastx.assign(lastx.begin(), lastx.end());\n }\n\n void xk(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n void xbar(std::vector<double>& xk) {\n xk.assign(_lastx.begin(), _lastx.end());\n }\n int k() { return _k; }\n double gamma() { return _gamma; }\n };\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/diag\/prdf\/plat\/prdfPlatServices_ipl.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/**\n * @file prdfPlatServices_ipl.C\n * @brief Wrapper code for external interfaces used by PRD (IPL only).\n *\n * This file contains code that is strictly specific to Hostboot. All code that\n * is common between FSP and Hostboot should be in the respective common file.\n *\/\n\n#include <prdfPlatServices.H>\n\n#include <prdfGlobal.H>\n#include <prdfErrlUtil.H>\n#include <prdfTrace.H>\n\n\/\/#include <prdfCenDqBitmap.H> TODO RTC 164707\n#include <prdfMemScrubUtils.H>\n\n#include <diag\/mdia\/mdia.H>\n#include <config.h>\n\nusing namespace TARGETING;\n\nnamespace PRDF\n{\n\nnamespace PlatServices\n{\n\n\/\/##############################################################################\n\/\/## Memory specific functions\n\/\/##############################################################################\n\nbool isInMdiaMode()\n{\n bool o_isInMdiaMode = false;\n#ifndef CONFIG_VPO_COMPILE\n MDIA::waitingForMaintCmdEvents(o_isInMdiaMode);\n#endif\n return o_isInMdiaMode;\n}\n\n\/\/------------------------------------------------------------------------------\n\nint32_t mdiaSendEventMsg( TargetHandle_t i_trgt,\n MDIA::MaintCommandEventType i_eventType )\n{\n #define PRDF_FUNC \"[PlatServices::mdiaSendEventMsg] \"\n\n int32_t o_rc = SUCCESS;\n\n#ifndef CONFIG_VPO_COMPILE\n\n PRDF_ASSERT( nullptr != i_trgt );\n\n \/\/ Only MCBIST and MBA supported.\n TYPE trgtType = getTargetType( i_trgt );\n PRDF_ASSERT( TYPE_MCBIST == trgtType || TYPE_MBA == trgtType );\n\n \/\/ MDIA must be running.\n PRDF_ASSERT( isInMdiaMode() );\n\n \/\/ Send command complete to MDIA.\n MDIA::MaintCommandEvent mdiaEvent;\n mdiaEvent.target = i_trgt;\n mdiaEvent.type = i_eventType;\n\n errlHndl_t errl = MDIA::processEvent( mdiaEvent );\n if ( NULL != errl )\n {\n PRDF_ERR( PRDF_FUNC \"MDIA::processEvent() failed: i_target=0x%08x \"\n \"i_eventType=%d\", getHuid(i_trgt), i_eventType );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n\n#endif\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\nbool rcdParityErrorReconfigLoop()\n{\n TargetHandle_t top = getSystemTarget();\n\n \/\/ Check the current reconfig count.\n uint8_t allowed = top->getAttr<ATTR_RCD_PARITY_RECONFIG_LOOPS_ALLOWED>();\n uint8_t count = top->getAttr<ATTR_RCD_PARITY_RECONFIG_LOOP_COUNT>();\n\n if ( count <= allowed )\n {\n \/\/ Set the RCD parity error flag in the reconfig loop attribute. This\n \/\/ will trigger a reconfig loop at the end of the current istep.\n ATTR_RECONFIGURE_LOOP_type attr = top->getAttr<ATTR_RECONFIGURE_LOOP>();\n if ( 0 == (attr & RECONFIGURE_LOOP_RCD_PARITY_ERROR) )\n {\n attr |= RECONFIGURE_LOOP_RCD_PARITY_ERROR;\n top->setAttr<ATTR_RECONFIGURE_LOOP>(attr);\n }\n\n \/\/ Increment the count.\n top->setAttr<ATTR_RCD_PARITY_RECONFIG_LOOP_COUNT>(++count);\n\n return false;\n }\n\n return true;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/* TODO RTC 164707\nint32_t mssRestoreDramRepairs( TargetHandle_t i_mbaTarget,\n uint8_t & o_repairedRankMask,\n uint8_t & o_badDimmMask )\n{\n int32_t o_rc = SUCCESS;\n\n errlHndl_t errl = NULL;\n\n FAPI_INVOKE_HWP( errl, mss_restore_DRAM_repairs,\n fapi::Target(fapi::TARGET_TYPE_MBA_CHIPLET, i_mbaTarget),\n o_repairedRankMask, o_badDimmMask );\n\n if ( NULL != errl )\n {\n PRDF_ERR( \"[PlatServices::mssRestoreDramRepairs] \"\n \"mss_restore_dram_repairs() failed. HUID: 0x%08x\",\n getHuid(i_mbaTarget) );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n\n return o_rc;\n}\n*\/\n\n\/\/------------------------------------------------------------------------------\n\n\/* TODO RTC 157888\nint32_t mssIplUeIsolation( TargetHandle_t i_mba, const CenRank & i_rank,\n CenDqBitmap & o_bitmap )\n{\n #define PRDF_FUNC \"[PlatServices::mssIplUeIsolation] \"\n\n int32_t o_rc = SUCCESS;\n\n uint8_t data[MBA_DIMMS_PER_RANK][DIMM_DQ_RANK_BITMAP_SIZE];\n\n errlHndl_t errl = NULL;\n FAPI_INVOKE_HWP( errl, mss_IPL_UE_isolation, getFapiTarget(i_mba),\n i_rank.getMaster(), data );\n if ( NULL != errl )\n {\n PRDF_ERR( PRDF_FUNC \"mss_IPL_UE_isolation() failed: MBA=0x%08x \"\n \"rank=%d\", getHuid(i_mba), i_rank.getMaster() );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n else\n {\n o_bitmap = CenDqBitmap ( i_mba, i_rank, data );\n }\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n*\/\n\n\/\/##############################################################################\n\/\/## Nimbus Maintenance Command wrappers\n\/\/##############################################################################\n\ntemplate<>\nuint32_t startSfRead<TYPE_MCA>( ExtensibleChip * i_mcaChip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startSfRead<TYPE_MCA>] \"\n\n PRDF_ASSERT( isInMdiaMode() ); \/\/ MDIA must be running.\n\n PRDF_ASSERT( nullptr != i_mcaChip );\n PRDF_ASSERT( TYPE_MCA == i_mcaChip->getType() );\n\n uint32_t o_rc = SUCCESS;\n\n \/\/ Get the MCBIST fapi target\n ExtensibleChip * mcbChip = getConnectedParent( i_mcaChip, TYPE_MCBIST );\n fapi2::Target<fapi2::TARGET_TYPE_MCBIST> fapiTrgt ( mcbChip->getTrgt() );\n\n \/\/ Get the stop conditions.\n mss::mcbist::stop_conditions stopCond;\n stopCond.set_pause_on_mpe(mss::ON)\n .set_pause_on_ue(mss::ON)\n .set_nce_inter_symbol_count_enable(mss::ON)\n .set_nce_soft_symbol_count_enable( mss::ON)\n .set_nce_hard_symbol_count_enable( mss::ON);\n\n \/\/ Stop on hard CEs if MNFG CE checking is enable.\n if ( isMfgCeCheckingEnabled() ) stopCond.set_pause_on_nce_hard(mss::ON);\n\n \/\/ Get the first address of the given rank.\n uint32_t port = i_mcaChip->getPos() % MAX_MCA_PER_MCBIST;\n mss::mcbist::address saddr, eaddr;\n mss::mcbist::address::get_srank_range( port,\n i_rank.getDimmSlct(),\n i_rank.getRankSlct(),\n i_rank.getSlave(),\n saddr,\n eaddr );\n\n do\n {\n \/\/ Clear all of the counters and maintenance ECC attentions.\n o_rc = prepareNextCmd<TYPE_MCBIST>( mcbChip );\n if ( SUCCESS != o_rc )\n {\n PRDF_ERR( PRDF_FUNC \"prepareNextCmd(0x%08x) failed\",\n mcbChip->getHuid() );\n break;\n }\n\n \/\/ Start the super fast read command.\n errlHndl_t errl;\n FAPI_INVOKE_HWP( errl, memdiags::sf_read, fapiTrgt, stopCond, saddr );\n\n if ( nullptr != errl )\n {\n PRDF_ERR( PRDF_FUNC \"memdiags::sf_read(0x%08x,%d) failed\",\n mcbChip->getHuid(), i_rank.getMaster() );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL; break;\n }\n\n } while (0);\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ This specialization only exists to avoid a lot of extra code in some classes.\n\/\/ The input chip must still be an MCA chip.\ntemplate<>\nuint32_t startSfRead<TYPE_MCBIST>( ExtensibleChip * i_mcaChip,\n const MemRank & i_rank )\n{\n return startSfRead<TYPE_MCA>( i_mcaChip, i_rank );\n}\n\n\/\/##############################################################################\n\/\/## Centaur Maintenance Command wrappers\n\/\/##############################################################################\n\ntemplate<>\nuint32_t startSfRead<TYPE_MBA>( ExtensibleChip * i_mbaChip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startSfRead<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_mbaChip );\n PRDF_ASSERT( TYPE_MBA == i_mbaChip->getType() );\n\n uint32_t o_rc = SUCCESS;\n\n do\n {\n \/\/ Clear all of the counters and maintenance ECC attentions.\n o_rc = prepareNextCmd<TYPE_MBA>( i_mbaChip );\n if ( SUCCESS != o_rc )\n {\n PRDF_ERR( PRDF_FUNC \"prepareNextCmd(0x%08x) failed\",\n i_mbaChip->getHuid() );\n break;\n }\n\n \/\/ Start the background scrub command.\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" ); \/\/ TODO RTC 157888\n\n } while (0);\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\ntemplate<>\nuint32_t startVcmPhase1<TYPE_MBA>( ExtensibleChip * i_chip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startVcmPhase1<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_chip );\n PRDF_ASSERT( TYPE_MBA == i_chip->getType() );\n\n \/\/ TODO RTC 157888\n \/\/ - Start a targeted steer cleanup.\n \/\/ - Stop on RCE ETE (threshold 1).\n \/\/ - The command should always stop at the end of the master rank.\n\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" );\n\n return SUCCESS;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\ntemplate<>\nuint32_t startVcmPhase2<TYPE_MBA>( ExtensibleChip * i_chip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startVcmPhase2<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_chip );\n PRDF_ASSERT( TYPE_MBA == i_chip->getType() );\n\n \/\/ TODO RTC 157888\n \/\/ - Start a targeted super fast read.\n \/\/ - No stop-on-error conditions. Note that RCEs will report as UEs during\n \/\/ read operations. You can still set stop-on-RCE-ETE to be consistent\n \/\/ with phase 1, but it will not have any effect and is not required.\n \/\/ - The command should always stop at the end of the master rank.\n\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" );\n\n return SUCCESS;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\n} \/\/ end namespace PlatServices\n\n} \/\/ end namespace PRDF\n\n<commit_msg>PRD: set stop-on-AUE during memdiags after TD procedure<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/usr\/diag\/prdf\/plat\/prdfPlatServices_ipl.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2017 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/**\n * @file prdfPlatServices_ipl.C\n * @brief Wrapper code for external interfaces used by PRD (IPL only).\n *\n * This file contains code that is strictly specific to Hostboot. All code that\n * is common between FSP and Hostboot should be in the respective common file.\n *\/\n\n#include <prdfPlatServices.H>\n\n#include <prdfGlobal.H>\n#include <prdfErrlUtil.H>\n#include <prdfTrace.H>\n\n\/\/#include <prdfCenDqBitmap.H> TODO RTC 164707\n#include <prdfMemScrubUtils.H>\n\n#include <diag\/mdia\/mdia.H>\n#include <config.h>\n\nusing namespace TARGETING;\n\nnamespace PRDF\n{\n\nnamespace PlatServices\n{\n\n\/\/##############################################################################\n\/\/## Memory specific functions\n\/\/##############################################################################\n\nbool isInMdiaMode()\n{\n bool o_isInMdiaMode = false;\n#ifndef CONFIG_VPO_COMPILE\n MDIA::waitingForMaintCmdEvents(o_isInMdiaMode);\n#endif\n return o_isInMdiaMode;\n}\n\n\/\/------------------------------------------------------------------------------\n\nint32_t mdiaSendEventMsg( TargetHandle_t i_trgt,\n MDIA::MaintCommandEventType i_eventType )\n{\n #define PRDF_FUNC \"[PlatServices::mdiaSendEventMsg] \"\n\n int32_t o_rc = SUCCESS;\n\n#ifndef CONFIG_VPO_COMPILE\n\n PRDF_ASSERT( nullptr != i_trgt );\n\n \/\/ Only MCBIST and MBA supported.\n TYPE trgtType = getTargetType( i_trgt );\n PRDF_ASSERT( TYPE_MCBIST == trgtType || TYPE_MBA == trgtType );\n\n \/\/ MDIA must be running.\n PRDF_ASSERT( isInMdiaMode() );\n\n \/\/ Send command complete to MDIA.\n MDIA::MaintCommandEvent mdiaEvent;\n mdiaEvent.target = i_trgt;\n mdiaEvent.type = i_eventType;\n\n errlHndl_t errl = MDIA::processEvent( mdiaEvent );\n if ( NULL != errl )\n {\n PRDF_ERR( PRDF_FUNC \"MDIA::processEvent() failed: i_target=0x%08x \"\n \"i_eventType=%d\", getHuid(i_trgt), i_eventType );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n\n#endif\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\nbool rcdParityErrorReconfigLoop()\n{\n TargetHandle_t top = getSystemTarget();\n\n \/\/ Check the current reconfig count.\n uint8_t allowed = top->getAttr<ATTR_RCD_PARITY_RECONFIG_LOOPS_ALLOWED>();\n uint8_t count = top->getAttr<ATTR_RCD_PARITY_RECONFIG_LOOP_COUNT>();\n\n if ( count <= allowed )\n {\n \/\/ Set the RCD parity error flag in the reconfig loop attribute. This\n \/\/ will trigger a reconfig loop at the end of the current istep.\n ATTR_RECONFIGURE_LOOP_type attr = top->getAttr<ATTR_RECONFIGURE_LOOP>();\n if ( 0 == (attr & RECONFIGURE_LOOP_RCD_PARITY_ERROR) )\n {\n attr |= RECONFIGURE_LOOP_RCD_PARITY_ERROR;\n top->setAttr<ATTR_RECONFIGURE_LOOP>(attr);\n }\n\n \/\/ Increment the count.\n top->setAttr<ATTR_RCD_PARITY_RECONFIG_LOOP_COUNT>(++count);\n\n return false;\n }\n\n return true;\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/* TODO RTC 164707\nint32_t mssRestoreDramRepairs( TargetHandle_t i_mbaTarget,\n uint8_t & o_repairedRankMask,\n uint8_t & o_badDimmMask )\n{\n int32_t o_rc = SUCCESS;\n\n errlHndl_t errl = NULL;\n\n FAPI_INVOKE_HWP( errl, mss_restore_DRAM_repairs,\n fapi::Target(fapi::TARGET_TYPE_MBA_CHIPLET, i_mbaTarget),\n o_repairedRankMask, o_badDimmMask );\n\n if ( NULL != errl )\n {\n PRDF_ERR( \"[PlatServices::mssRestoreDramRepairs] \"\n \"mss_restore_dram_repairs() failed. HUID: 0x%08x\",\n getHuid(i_mbaTarget) );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n\n return o_rc;\n}\n*\/\n\n\/\/------------------------------------------------------------------------------\n\n\/* TODO RTC 157888\nint32_t mssIplUeIsolation( TargetHandle_t i_mba, const CenRank & i_rank,\n CenDqBitmap & o_bitmap )\n{\n #define PRDF_FUNC \"[PlatServices::mssIplUeIsolation] \"\n\n int32_t o_rc = SUCCESS;\n\n uint8_t data[MBA_DIMMS_PER_RANK][DIMM_DQ_RANK_BITMAP_SIZE];\n\n errlHndl_t errl = NULL;\n FAPI_INVOKE_HWP( errl, mss_IPL_UE_isolation, getFapiTarget(i_mba),\n i_rank.getMaster(), data );\n if ( NULL != errl )\n {\n PRDF_ERR( PRDF_FUNC \"mss_IPL_UE_isolation() failed: MBA=0x%08x \"\n \"rank=%d\", getHuid(i_mba), i_rank.getMaster() );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL;\n }\n else\n {\n o_bitmap = CenDqBitmap ( i_mba, i_rank, data );\n }\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n*\/\n\n\/\/##############################################################################\n\/\/## Nimbus Maintenance Command wrappers\n\/\/##############################################################################\n\ntemplate<>\nuint32_t startSfRead<TYPE_MCA>( ExtensibleChip * i_mcaChip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startSfRead<TYPE_MCA>] \"\n\n PRDF_ASSERT( isInMdiaMode() ); \/\/ MDIA must be running.\n\n PRDF_ASSERT( nullptr != i_mcaChip );\n PRDF_ASSERT( TYPE_MCA == i_mcaChip->getType() );\n\n uint32_t o_rc = SUCCESS;\n\n \/\/ Get the MCBIST fapi target\n ExtensibleChip * mcbChip = getConnectedParent( i_mcaChip, TYPE_MCBIST );\n fapi2::Target<fapi2::TARGET_TYPE_MCBIST> fapiTrgt ( mcbChip->getTrgt() );\n\n \/\/ Get the stop conditions.\n mss::mcbist::stop_conditions stopCond;\n stopCond.set_pause_on_mpe(mss::ON)\n .set_pause_on_ue(mss::ON)\n .set_pause_on_aue(mss::ON)\n .set_nce_inter_symbol_count_enable(mss::ON)\n .set_nce_soft_symbol_count_enable( mss::ON)\n .set_nce_hard_symbol_count_enable( mss::ON);\n\n \/\/ Stop on hard CEs if MNFG CE checking is enable.\n if ( isMfgCeCheckingEnabled() ) stopCond.set_pause_on_nce_hard(mss::ON);\n\n \/\/ Get the first address of the given rank.\n uint32_t port = i_mcaChip->getPos() % MAX_MCA_PER_MCBIST;\n mss::mcbist::address saddr, eaddr;\n mss::mcbist::address::get_srank_range( port,\n i_rank.getDimmSlct(),\n i_rank.getRankSlct(),\n i_rank.getSlave(),\n saddr,\n eaddr );\n\n do\n {\n \/\/ Clear all of the counters and maintenance ECC attentions.\n o_rc = prepareNextCmd<TYPE_MCBIST>( mcbChip );\n if ( SUCCESS != o_rc )\n {\n PRDF_ERR( PRDF_FUNC \"prepareNextCmd(0x%08x) failed\",\n mcbChip->getHuid() );\n break;\n }\n\n \/\/ Start the super fast read command.\n errlHndl_t errl;\n FAPI_INVOKE_HWP( errl, memdiags::sf_read, fapiTrgt, stopCond, saddr );\n\n if ( nullptr != errl )\n {\n PRDF_ERR( PRDF_FUNC \"memdiags::sf_read(0x%08x,%d) failed\",\n mcbChip->getHuid(), i_rank.getMaster() );\n PRDF_COMMIT_ERRL( errl, ERRL_ACTION_REPORT );\n o_rc = FAIL; break;\n }\n\n } while (0);\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\n\/\/ This specialization only exists to avoid a lot of extra code in some classes.\n\/\/ The input chip must still be an MCA chip.\ntemplate<>\nuint32_t startSfRead<TYPE_MCBIST>( ExtensibleChip * i_mcaChip,\n const MemRank & i_rank )\n{\n return startSfRead<TYPE_MCA>( i_mcaChip, i_rank );\n}\n\n\/\/##############################################################################\n\/\/## Centaur Maintenance Command wrappers\n\/\/##############################################################################\n\ntemplate<>\nuint32_t startSfRead<TYPE_MBA>( ExtensibleChip * i_mbaChip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startSfRead<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_mbaChip );\n PRDF_ASSERT( TYPE_MBA == i_mbaChip->getType() );\n\n uint32_t o_rc = SUCCESS;\n\n do\n {\n \/\/ Clear all of the counters and maintenance ECC attentions.\n o_rc = prepareNextCmd<TYPE_MBA>( i_mbaChip );\n if ( SUCCESS != o_rc )\n {\n PRDF_ERR( PRDF_FUNC \"prepareNextCmd(0x%08x) failed\",\n i_mbaChip->getHuid() );\n break;\n }\n\n \/\/ Start the background scrub command.\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" ); \/\/ TODO RTC 157888\n\n } while (0);\n\n return o_rc;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\ntemplate<>\nuint32_t startVcmPhase1<TYPE_MBA>( ExtensibleChip * i_chip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startVcmPhase1<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_chip );\n PRDF_ASSERT( TYPE_MBA == i_chip->getType() );\n\n \/\/ TODO RTC 157888\n \/\/ - Start a targeted steer cleanup.\n \/\/ - Stop on RCE ETE (threshold 1).\n \/\/ - The command should always stop at the end of the master rank.\n\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" );\n\n return SUCCESS;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\ntemplate<>\nuint32_t startVcmPhase2<TYPE_MBA>( ExtensibleChip * i_chip,\n const MemRank & i_rank )\n{\n #define PRDF_FUNC \"[PlatServices::startVcmPhase2<TYPE_MBA>] \"\n\n PRDF_ASSERT( nullptr != i_chip );\n PRDF_ASSERT( TYPE_MBA == i_chip->getType() );\n\n \/\/ TODO RTC 157888\n \/\/ - Start a targeted super fast read.\n \/\/ - No stop-on-error conditions. Note that RCEs will report as UEs during\n \/\/ read operations. You can still set stop-on-RCE-ETE to be consistent\n \/\/ with phase 1, but it will not have any effect and is not required.\n \/\/ - The command should always stop at the end of the master rank.\n\n PRDF_ERR( PRDF_FUNC \"function not implemented yet\" );\n\n return SUCCESS;\n\n #undef PRDF_FUNC\n}\n\n\/\/------------------------------------------------------------------------------\n\n} \/\/ end namespace PlatServices\n\n} \/\/ end namespace PRDF\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#pragma once\n\n#ifndef VSNRAY_PATHTRACING_INL\n#define VSNRAY_PATHTRACING_INL 1\n\n#ifndef NDEBUG\n#include <iostream>\n#include <ostream>\n#endif\n\n#include <visionaray\/get_surface.h>\n#include <visionaray\/result_record.h>\n#include <visionaray\/traverse.h>\n\nnamespace visionaray\n{\nnamespace pathtracing\n{\n\ntemplate <typename Params>\nstruct kernel\n{\n\n Params params;\n\n template <typename Intersector, typename R, typename Sampler>\n VSNRAY_FUNC result_record<typename R::scalar_type> operator()(\n Intersector& isect,\n R ray,\n Sampler& s\n ) const\n {\n\n using S = typename R::scalar_type;\n using V = typename result_record<S>::vec_type;\n using C = spectrum<S>;\n\n result_record<S> result;\n\n auto hit_rec = closest_hit(ray, params.prims.begin, params.prims.end, isect);\n auto exited = !hit_rec.hit;\n auto active_rays = hit_rec.hit;\n result.color = params.bg_color;\n\n\n if (any(hit_rec.hit))\n {\n result.hit = hit_rec.hit;\n result.isect_pos = ray.ori + ray.dir * hit_rec.t;\n }\n else\n {\n result.hit = false;\n return result;\n }\n\n C dst(1.0);\n\n for (unsigned d = 0; d < params.num_bounces; ++d)\n {\n if ( any(active_rays) )\n {\n V refl_dir;\n V view_dir = -ray.dir;\n\n auto surf = get_surface(hit_rec, params);\n\n auto n = surf.shading_normal;\n\n#if 1 \/\/ two-sided\n n = faceforward( n, view_dir, surf.geometric_normal );\n#endif\n\n S pdf(0.0);\n auto sr = make_shade_record<Params, S>();\n sr.active = active_rays;\n sr.normal = n;\n sr.view_dir = view_dir;\n \n auto src = surf.sample(sr, refl_dir, pdf, s);\n\n auto zero_pdf = pdf <= S(0.0);\n auto emissive = has_emissive_material(surf);\n\n src = mul( src, dot(n, refl_dir) \/ pdf, !emissive, src ); \/\/ TODO: maybe have emissive material return refl_dir so that dot(N,R) = 1?\n dst = mul( dst, src, active_rays && !zero_pdf, dst );\n dst = mul( dst, C(0.0), zero_pdf && active_rays, dst );\n\n active_rays &= !emissive;\n active_rays &= !zero_pdf;\n\n\n if (!any(active_rays))\n {\n break;\n }\n\n auto isect_pos = ray.ori + ray.dir * hit_rec.t; \/\/ TODO: store in hit_rec?!?\n\n ray.ori = isect_pos + refl_dir * S(params.epsilon);\n ray.dir = refl_dir;\n\n hit_rec = closest_hit(ray, params.prims.begin, params.prims.end, isect);\n exited = active_rays & !hit_rec.hit;\n active_rays &= hit_rec.hit;\n }\n\n dst = mul( dst, C(from_rgba(params.ambient_color)), exited, dst );\n }\n\n dst = mul( dst, C(0.0), active_rays, dst );\n\n result.color = select( result.hit, to_rgba(dst), result.color );\n\n return result;\n }\n\n template <typename R, typename Sampler>\n VSNRAY_FUNC result_record<typename R::scalar_type> operator()(\n R ray,\n Sampler& s\n ) const \n {\n default_intersector ignore;\n return (*this)(ignore, ray, s);\n }\n};\n\n} \/\/ pathtracing\n} \/\/ visionaray\n\n#endif \/\/ VSNRAY_PATHTRACING_INL\n<commit_msg>Simplify ray termination in path tracer<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#pragma once\n\n#ifndef VSNRAY_PATHTRACING_INL\n#define VSNRAY_PATHTRACING_INL 1\n\n#ifndef NDEBUG\n#include <iostream>\n#include <ostream>\n#endif\n\n#include <visionaray\/get_surface.h>\n#include <visionaray\/result_record.h>\n#include <visionaray\/traverse.h>\n\nnamespace visionaray\n{\nnamespace pathtracing\n{\n\ntemplate <typename Params>\nstruct kernel\n{\n\n Params params;\n\n template <typename Intersector, typename R, typename Sampler>\n VSNRAY_FUNC result_record<typename R::scalar_type> operator()(\n Intersector& isect,\n R ray,\n Sampler& s\n ) const\n {\n\n using S = typename R::scalar_type;\n using V = typename result_record<S>::vec_type;\n using C = spectrum<S>;\n\n result_record<S> result;\n\n auto hit_rec = closest_hit(ray, params.prims.begin, params.prims.end, isect);\n auto exited = !hit_rec.hit;\n auto active_rays = hit_rec.hit;\n result.color = params.bg_color;\n\n\n if (any(hit_rec.hit))\n {\n result.hit = hit_rec.hit;\n result.isect_pos = ray.ori + ray.dir * hit_rec.t;\n }\n else\n {\n result.hit = false;\n return result;\n }\n\n C dst(1.0);\n\n for (unsigned d = 0; d < params.num_bounces; ++d)\n {\n if ( any(active_rays) )\n {\n V refl_dir;\n V view_dir = -ray.dir;\n\n auto surf = get_surface(hit_rec, params);\n\n auto n = surf.shading_normal;\n\n#if 1 \/\/ two-sided\n n = faceforward( n, view_dir, surf.geometric_normal );\n#endif\n\n S pdf(0.0);\n auto sr = make_shade_record<Params, S>();\n sr.active = active_rays;\n sr.normal = n;\n sr.view_dir = view_dir;\n \n auto src = surf.sample(sr, refl_dir, pdf, s);\n\n auto zero_pdf = pdf <= S(0.0);\n auto emissive = has_emissive_material(surf);\n\n src = mul( src, dot(n, refl_dir) \/ pdf, !emissive, src ); \/\/ TODO: maybe have emissive material return refl_dir so that dot(N,R) = 1?\n dst = mul( dst, src, active_rays && !zero_pdf, dst );\n dst = select( zero_pdf && active_rays, C(0.0), dst );\n\n active_rays &= !emissive;\n active_rays &= !zero_pdf;\n\n\n if (!any(active_rays))\n {\n break;\n }\n\n auto isect_pos = ray.ori + ray.dir * hit_rec.t; \/\/ TODO: store in hit_rec?!?\n\n ray.ori = isect_pos + refl_dir * S(params.epsilon);\n ray.dir = refl_dir;\n\n hit_rec = closest_hit(ray, params.prims.begin, params.prims.end, isect);\n exited = active_rays & !hit_rec.hit;\n active_rays &= hit_rec.hit;\n }\n\n dst = mul( dst, C(from_rgba(params.ambient_color)), exited, dst );\n }\n\n dst = mul( dst, C(0.0), active_rays, dst );\n\n result.color = select( result.hit, to_rgba(dst), result.color );\n\n return result;\n }\n\n template <typename R, typename Sampler>\n VSNRAY_FUNC result_record<typename R::scalar_type> operator()(\n R ray,\n Sampler& s\n ) const \n {\n default_intersector ignore;\n return (*this)(ignore, ray, s);\n }\n};\n\n} \/\/ pathtracing\n} \/\/ visionaray\n\n#endif \/\/ VSNRAY_PATHTRACING_INL\n<|endoftext|>"} {"text":"<commit_before>\/*\n * FuzzyPatternMatchCB.cc\n *\n * Copyright (C) 2015 OpenCog Foundation\n *\n * Author: Leung Man Hin <https:\/\/github.com\/leungmanhin>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the exceptions\n * at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, write to:\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include \"FuzzyPatternMatchCB.h\"\n\nusing namespace opencog;\n\n\/\/#define DEBUG\n\nFuzzyPatternMatchCB::FuzzyPatternMatchCB(AtomSpace* as)\n\t: DefaultPatternMatchCB(as)\n{\n}\n\n\/**\n * Implement the initiate_search calllback.\n *\n * For a fuzzy match, it starts with a full atomspace search to find candidates.\n *\n * @param pme The pointer of the PatternMatchEngine\n * @param vars A set of nodes that are considered as variables\n * @param clauses The clauses for the query\n * @param negations The negative clauses\n *\/\nvoid FuzzyPatternMatchCB::initiate_search(PatternMatchEngine* pme,\n const std::set<Handle>& vars,\n const std::vector<Handle>& clauses)\n{\n bool done = false;\n link_type_search(pme, vars, clauses, done);\n}\n\n\/**\n * Override the link_match callback.\n *\n * This is for finding similar links\/hypergraphs in the atomspace. The possible\n * grounding link (gLink) will be compared with the pattern link (pLink) and see\n * if it should be accepted, based on the similarity between them.\n *\n * @param pLink The link from the query\n * @param gLink A possible grounding link found by the Pattern Matcher\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::link_match(const LinkPtr& pLink, const LinkPtr& gLink)\n{\n \/\/ If two links are identical, skip it\n if (pLink == gLink) return false;\n\n \/\/ Check if the types of the links are the same before going further into\n \/\/ the similarity estimation.\n \/\/ This is mainly for reducing the amount of hypergraphs being processed\n \/\/ as the content of two links with different types are likely to be quite\n \/\/ different.\n if (pLink->getType() != gLink->getType()) return false;\n\n check_if_accept(pLink->getHandle(), gLink->getHandle());\n\n return false;\n}\n\n\/**\n * Override the node_match callback.\n *\n * This is for finding similar nodes in the atomspace. The possible grounding\n * node (gNode) will be compared with the pattern node (pNode) and see if it\n * should be accepted, based on the similarity between them.\n *\n * @param pNode A handle of the node form the query\n * @param gNode A handle of a possible grounding node\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::node_match(const Handle& pNode, const Handle& gNode)\n{\n \/\/ If two handles are identical, skip it\n if (pNode == gNode) return false;\n\n check_if_accept(pNode, gNode);\n\n return false;\n}\n\n\/**\n * Implement the grounding callback.\n *\n * Always return false to search for more solutions.\n *\n * @param var_soln The variable & links mapping\n * @param pred_soln The clause mapping\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::grounding(const std::map<Handle, Handle>& var_soln,\n const std::map<Handle, Handle>& pred_soln)\n{\n return false;\n}\n\n\/**\n * Check how similar the two hypergraphs are by computing the edit distance. If\n * the edit distance is smaller than or equals to the previous minimum, then\n * it will be accepted.\n *\n * @param ph A handle of the hypergraph from the query\n * @param gh A handle of a possible grounding hypergraph\n * @return True if it is accepted, false otherwise\n *\/\nbool FuzzyPatternMatchCB::check_if_accept(const Handle& ph, const Handle& gh)\n{\n \/\/ Compute the edit distance\n cand_edit_dist = ged.compute(ph, gh);\n\n \/\/ Skip identical hypergraphs, if any\n if (cand_edit_dist == 0)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nSkipped!\\n\\n\", cand_edit_dist);\n#endif\n return false;\n }\n\n \/\/ If the edit distance of the current hypergraph is smaller than the\n \/\/ previous minimum, it becomes the new minimum\n else if (cand_edit_dist < min_edit_dist)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nAccepted!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n min_edit_dist = cand_edit_dist;\n solns.clear();\n solns.push_back(gh);\n return true;\n }\n\n \/\/ If the edit distance of the current hypergraph is the same as the\n \/\/ previous minimum, add it to the solution-list\n else if (cand_edit_dist == min_edit_dist)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nAccepted!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n solns.push_back(gh);\n return true;\n }\n\n \/\/ If the edit distance of the current hypergraph is greater than the\n \/\/ previous minimum, reject it\n else\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nRejected!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n return false;\n }\n}\n<commit_msg>Fix for the FuzzyUTest<commit_after>\/*\n * FuzzyPatternMatchCB.cc\n *\n * Copyright (C) 2015 OpenCog Foundation\n *\n * Author: Leung Man Hin <https:\/\/github.com\/leungmanhin>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the exceptions\n * at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, write to:\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n\n#include \"FuzzyPatternMatchCB.h\"\n\nusing namespace opencog;\n\n\/\/#define DEBUG\n\nFuzzyPatternMatchCB::FuzzyPatternMatchCB(AtomSpace* as)\n\t: DefaultPatternMatchCB(as)\n{\n}\n\n\/**\n * Implement the initiate_search calllback.\n *\n * For a fuzzy match, it starts with a full atomspace search to find candidates.\n *\n * @param pme The pointer of the PatternMatchEngine\n * @param vars A set of nodes that are considered as variables\n * @param clauses The clauses for the query\n * @param negations The negative clauses\n *\/\nvoid FuzzyPatternMatchCB::initiate_search(PatternMatchEngine* pme,\n const std::set<Handle>& vars,\n const std::vector<Handle>& clauses)\n{\n _root = clauses[0];\n _starter_pred = _root;\n \/\/ XXX FIXME I'm pretty sure that this search is not going to be\n \/\/ complete, probably missing lots of similar patterns, simply\n \/\/ because it starts out with just the type of the very first\n \/\/ clause, and thus missing things that are fuzzily close to it.\n \/\/\n \/\/ I know that this is the case, because when I substitute the\n \/\/ below with link_type_search(), which normally would be\n \/\/ equivalent but faster, the FuzzyUTest failed. Tis means that\n \/\/ if the \"equivalent\" search is missing answers, then the search\n \/\/ below is missing them too.\n \/\/\n \/\/ So, instead of using the type of clause[0], you probably want\n \/\/ look at several types ??? There is a high risk that the\n \/\/ resulting search will be very inefficeint: this inefficiency\n \/\/ is exactly what link_type_search() was trying to avoid...\n Type ptype = _root->getType();\n HandleSeq handle_set;\n _as->getHandlesByType(handle_set, ptype);\n for (const Handle& h : handle_set)\n {\n bool found = pme->explore_neighborhood(_root, _starter_pred, h);\n if (found) return;\n }\n}\n\n\/**\n * Override the link_match callback.\n *\n * This is for finding similar links\/hypergraphs in the atomspace. The possible\n * grounding link (gLink) will be compared with the pattern link (pLink) and see\n * if it should be accepted, based on the similarity between them.\n *\n * @param pLink The link from the query\n * @param gLink A possible grounding link found by the Pattern Matcher\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::link_match(const LinkPtr& pLink, const LinkPtr& gLink)\n{\n \/\/ If two links are identical, skip it\n if (pLink == gLink) return false;\n\n \/\/ Check if the types of the links are the same before going further into\n \/\/ the similarity estimation.\n \/\/ This is mainly for reducing the amount of hypergraphs being processed\n \/\/ as the content of two links with different types are likely to be quite\n \/\/ different.\n if (pLink->getType() != gLink->getType()) return false;\n\n check_if_accept(pLink->getHandle(), gLink->getHandle());\n\n return false;\n}\n\n\/**\n * Override the node_match callback.\n *\n * This is for finding similar nodes in the atomspace. The possible grounding\n * node (gNode) will be compared with the pattern node (pNode) and see if it\n * should be accepted, based on the similarity between them.\n *\n * @param pNode A handle of the node form the query\n * @param gNode A handle of a possible grounding node\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::node_match(const Handle& pNode, const Handle& gNode)\n{\n \/\/ If two handles are identical, skip it\n if (pNode == gNode) return false;\n\n check_if_accept(pNode, gNode);\n\n return false;\n}\n\n\/**\n * Implement the grounding callback.\n *\n * Always return false to search for more solutions.\n *\n * @param var_soln The variable & links mapping\n * @param pred_soln The clause mapping\n * @return Always return false to search for more solutions\n *\/\nbool FuzzyPatternMatchCB::grounding(const std::map<Handle, Handle>& var_soln,\n const std::map<Handle, Handle>& pred_soln)\n{\n return false;\n}\n\n\/**\n * Check how similar the two hypergraphs are by computing the edit distance. If\n * the edit distance is smaller than or equals to the previous minimum, then\n * it will be accepted.\n *\n * @param ph A handle of the hypergraph from the query\n * @param gh A handle of a possible grounding hypergraph\n * @return True if it is accepted, false otherwise\n *\/\nbool FuzzyPatternMatchCB::check_if_accept(const Handle& ph, const Handle& gh)\n{\n \/\/ Compute the edit distance\n cand_edit_dist = ged.compute(ph, gh);\n\n \/\/ Skip identical hypergraphs, if any\n if (cand_edit_dist == 0)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nSkipped!\\n\\n\", cand_edit_dist);\n#endif\n return false;\n }\n\n \/\/ If the edit distance of the current hypergraph is smaller than the\n \/\/ previous minimum, it becomes the new minimum\n else if (cand_edit_dist < min_edit_dist)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nAccepted!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n min_edit_dist = cand_edit_dist;\n solns.clear();\n solns.push_back(gh);\n return true;\n }\n\n \/\/ If the edit distance of the current hypergraph is the same as the\n \/\/ previous minimum, add it to the solution-list\n else if (cand_edit_dist == min_edit_dist)\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nAccepted!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n solns.push_back(gh);\n return true;\n }\n\n \/\/ If the edit distance of the current hypergraph is greater than the\n \/\/ previous minimum, reject it\n else\n {\n#ifdef DEBUG\n printf(\"Cost = %.3f\\nMin. Cost = %.3f\\nRejected!\\n\\n\",\n cand_edit_dist, min_edit_dist);\n#endif\n return false;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"3RVX.h\"\n\n#pragma comment(lib, \"gdiplus.lib\")\n#pragma comment(lib, \"Wtsapi32.lib\")\n\n#include <Windows.h>\n#include <ctime>\n#include <gdiplus.h>\n#include <iostream>\n#include <Wtsapi32.h>\n\n#include \"DisplayManager.h\"\n#include \"HotkeyManager.h\"\n#include \"Logger.h\"\n#include \"OSD\/EjectOSD.h\"\n#include \"OSD\/VolumeOSD.h\"\n#include \"Settings.h\"\n#include \"Skin\/SkinManager.h\"\n\nint WINAPI wWinMain(_In_ HINSTANCE hInstance, _In_opt_ HINSTANCE hPrevInstance,\n _In_ LPWSTR lpCmdLine, _In_ int nShowCmd) {\n\n Logger::Start();\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n HANDLE mutex;\n mutex = CreateMutex(NULL, FALSE, L\"Local\\\\3RVX\");\n if (GetLastError() == ERROR_ALREADY_EXISTS) {\n if (mutex) {\n ReleaseMutex(mutex);\n }\n\n CLOG(L\"A previous instance of the program is already running.\\n\"\n L\"Requesting Settings dialog.\");\n _3RVX::Message(_3RVX::MSG_SETTINGS, NULL);\n\n#if defined(ENABLE_3RVX_LOG) && (defined(ENABLE_3RVX_LOGTOFILE) == FALSE)\n CLOG(L\"Press [enter] to terminate\");\n std::cin.get();\n#endif\n\n return EXIT_SUCCESS;\n }\n\n CLOG(L\"App directory: %s\", Settings::AppDir().c_str());\n\n using namespace Gdiplus;\n ULONG_PTR gdiplusToken;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n _3RVX mainWnd(hInstance);\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd.Handle(), _3RVX::WM_3RVX_CTRL, _3RVX::MSG_LOAD, NULL);\n\n \/* Register for session change notifications *\/\n WTSRegisterSessionNotification(mainWnd.Handle(), NOTIFY_FOR_THIS_SESSION);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n CoUninitialize();\n\n Logger::Stop();\n\n return (int) msg.wParam;\n}\n\n_3RVX::_3RVX(HINSTANCE hInstance) :\nWindow(_3RVX::CLASS_3RVX, _3RVX::CLASS_3RVX, hInstance) {\n SetTimer(Window::Handle(), TIMER_FIRSTUPDATE, FIRSTUPDATE_INTERVAL, NULL);\n}\n\nvoid _3RVX::Initialize() {\n CLOG(L\"Initializing...\");\n\n delete _vOSD;\n delete _eOSD;\n\n Settings *settings = Settings::Instance();\n settings->Load();\n\n SkinManager::Instance()->LoadSkin(settings->SkinXML());\n\n \/* TODO: Detect monitor changes, update this map, and reload\/reorg OSDs *\/\n DisplayManager::UpdateMonitorMap();\n\n \/* OSDs *\/\n _eOSD = new EjectOSD();\n _vOSD = new VolumeOSD();\n\n \/* Hotkey setup *\/\n if (_hkManager != NULL) {\n _hkManager->Shutdown();\n }\n _hkManager = HotkeyManager::Instance(Handle());\n\n _hotkeys = Settings::Instance()->Hotkeys();\n for (auto it = _hotkeys.begin(); it != _hotkeys.end(); ++it) {\n \/* Enable arg caching *\/\n it->second.EnableArgCache();\n\n int combination = it->first;\n _hkManager->Register(combination);\n }\n\n}\n\nvoid _3RVX::ProcessHotkeys(HotkeyInfo &hki) {\n switch (hki.action) {\n case HotkeyInfo::IncreaseVolume:\n case HotkeyInfo::DecreaseVolume:\n case HotkeyInfo::SetVolume:\n case HotkeyInfo::Mute:\n case HotkeyInfo::VolumeSlider:\n if (_vOSD) {\n _vOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::EjectDrive:\n case HotkeyInfo::EjectLastDisk:\n if (_eOSD) {\n _eOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::MediaKey:\n case HotkeyInfo::VirtualKey:\n _kbHotkeyProcessor.ProcessHotkeys(hki);\n break;\n\n case HotkeyInfo::Run:\n if (hki.HasArgs()) {\n ShellExecute(NULL, L\"open\", hki.args[0].c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n }\n break;\n\n case HotkeyInfo::DisableOSD:\n ToggleOSDs();\n break;\n\n case HotkeyInfo::Settings:\n ShellExecute(NULL, L\"open\", Settings::SettingsApp().c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n break;\n\n case HotkeyInfo::Exit:\n SendMessage(Handle(), WM_CLOSE, NULL, NULL);\n break;\n }\n}\n\nvoid _3RVX::ToggleOSDs() {\n _eOSD->Enabled(!(_eOSD->Enabled()));\n _vOSD->Enabled(!(_vOSD->Enabled()));\n}\n\nLRESULT _3RVX::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n switch (message) {\n case WM_HOTKEY: {\n CLOG(L\"Hotkey: %d\", (int) wParam);\n HotkeyInfo hki = _hotkeys[(int) wParam];\n ProcessHotkeys(hki);\n break;\n }\n\n case WM_WTSSESSION_CHANGE: {\n CLOG(L\"Detected session change\");\n break;\n }\n\n case WM_CLOSE: {\n CLOG(L\"Shutting down\");\n HotkeyManager::Instance()->Shutdown();\n _vOSD->HideIcon();\n break;\n }\n\n case WM_DESTROY: {\n PostQuitMessage(0);\n break;\n }\n\n case WM_TIMER:\n if (wParam == TIMER_FIRSTUPDATE || wParam == TIMER_UPDATE) {\n Settings *settings = Settings::Instance();\n long long checkTime = settings->UpdateCheckTime();\n if ((std::time(nullptr) - checkTime) > (UPDATE_INTERVAL \/ 1000)) {\n \/* Enough time has elapsed since the last update check *\/\n std::wstring settingsApp = Settings::SettingsApp();\n CLOG(L\"Launching update task: %s %s\",\n settingsApp.c_str(), L\"-update\");\n ShellExecute(NULL, L\"open\",\n Settings::SettingsApp().c_str(), L\"-update\", NULL, SW_HIDE);\n\n if (wParam == TIMER_FIRSTUPDATE) {\n \/* If this was the first update check (30 min after launch),\n * then kill the first update timer and start the main timer\n * (checks on 24-hour intervals) *\/\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n SetTimer(Window::Handle(), TIMER_UPDATE,\n UPDATE_INTERVAL, NULL);\n }\n }\n }\n break;\n }\n\n if (message == _3RVX::WM_3RVX_CTRL) {\n switch (wParam) {\n case _3RVX::MSG_LOAD:\n Initialize();\n break;\n\n case _3RVX::MSG_SETTINGS:\n Settings::LaunchSettingsApp();\n break;\n\n case _3RVX::MSG_HIDEOSD:\n int except = (OSDType) lParam;\n switch (except) {\n case Volume:\n if (_eOSD) {\n _eOSD->Hide();\n }\n break;\n\n case Eject:\n if (_vOSD) {\n _vOSD->Hide();\n }\n break;\n }\n\n break;\n }\n }\n\n return Window::WndProc(hWnd, message, wParam, lParam);\n}\n<commit_msg>Launch timer during initialization<commit_after>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"3RVX.h\"\n\n#pragma comment(lib, \"gdiplus.lib\")\n#pragma comment(lib, \"Wtsapi32.lib\")\n\n#include <Windows.h>\n#include <ctime>\n#include <gdiplus.h>\n#include <iostream>\n#include <Wtsapi32.h>\n\n#include \"DisplayManager.h\"\n#include \"HotkeyManager.h\"\n#include \"Logger.h\"\n#include \"OSD\/EjectOSD.h\"\n#include \"OSD\/VolumeOSD.h\"\n#include \"Settings.h\"\n#include \"Skin\/SkinManager.h\"\n\nint WINAPI wWinMain(_In_ HINSTANCE hInstance, _In_opt_ HINSTANCE hPrevInstance,\n _In_ LPWSTR lpCmdLine, _In_ int nShowCmd) {\n\n Logger::Start();\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n HANDLE mutex;\n mutex = CreateMutex(NULL, FALSE, L\"Local\\\\3RVX\");\n if (GetLastError() == ERROR_ALREADY_EXISTS) {\n if (mutex) {\n ReleaseMutex(mutex);\n }\n\n CLOG(L\"A previous instance of the program is already running.\\n\"\n L\"Requesting Settings dialog.\");\n _3RVX::Message(_3RVX::MSG_SETTINGS, NULL);\n\n#if defined(ENABLE_3RVX_LOG) && (defined(ENABLE_3RVX_LOGTOFILE) == FALSE)\n CLOG(L\"Press [enter] to terminate\");\n std::cin.get();\n#endif\n\n return EXIT_SUCCESS;\n }\n\n CLOG(L\"App directory: %s\", Settings::AppDir().c_str());\n\n using namespace Gdiplus;\n ULONG_PTR gdiplusToken;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n _3RVX mainWnd(hInstance);\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd.Handle(), _3RVX::WM_3RVX_CTRL, _3RVX::MSG_LOAD, NULL);\n\n \/* Register for session change notifications *\/\n WTSRegisterSessionNotification(mainWnd.Handle(), NOTIFY_FOR_THIS_SESSION);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n CoUninitialize();\n\n Logger::Stop();\n\n return (int) msg.wParam;\n}\n\n_3RVX::_3RVX(HINSTANCE hInstance) :\nWindow(_3RVX::CLASS_3RVX, _3RVX::CLASS_3RVX, hInstance) {\n}\n\nvoid _3RVX::Initialize() {\n CLOG(L\"Initializing...\");\n\n delete _vOSD;\n delete _eOSD;\n\n Settings *settings = Settings::Instance();\n settings->Load();\n\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n KillTimer(Window::Handle(), TIMER_UPDATE);\n if (settings->AutoUpdateEnabled()) {\n SetTimer(\n Window::Handle(),\n TIMER_FIRSTUPDATE,\n FIRSTUPDATE_INTERVAL,\n NULL);\n }\n\n SkinManager::Instance()->LoadSkin(settings->SkinXML());\n\n \/* TODO: Detect monitor changes, update this map, and reload\/reorg OSDs *\/\n DisplayManager::UpdateMonitorMap();\n\n \/* OSDs *\/\n _eOSD = new EjectOSD();\n _vOSD = new VolumeOSD();\n\n \/* Hotkey setup *\/\n if (_hkManager != NULL) {\n _hkManager->Shutdown();\n }\n _hkManager = HotkeyManager::Instance(Handle());\n\n _hotkeys = Settings::Instance()->Hotkeys();\n for (auto it = _hotkeys.begin(); it != _hotkeys.end(); ++it) {\n \/* Enable arg caching *\/\n it->second.EnableArgCache();\n\n int combination = it->first;\n _hkManager->Register(combination);\n }\n\n}\n\nvoid _3RVX::ProcessHotkeys(HotkeyInfo &hki) {\n switch (hki.action) {\n case HotkeyInfo::IncreaseVolume:\n case HotkeyInfo::DecreaseVolume:\n case HotkeyInfo::SetVolume:\n case HotkeyInfo::Mute:\n case HotkeyInfo::VolumeSlider:\n if (_vOSD) {\n _vOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::EjectDrive:\n case HotkeyInfo::EjectLastDisk:\n if (_eOSD) {\n _eOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::MediaKey:\n case HotkeyInfo::VirtualKey:\n _kbHotkeyProcessor.ProcessHotkeys(hki);\n break;\n\n case HotkeyInfo::Run:\n if (hki.HasArgs()) {\n ShellExecute(NULL, L\"open\", hki.args[0].c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n }\n break;\n\n case HotkeyInfo::DisableOSD:\n ToggleOSDs();\n break;\n\n case HotkeyInfo::Settings:\n ShellExecute(NULL, L\"open\", Settings::SettingsApp().c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n break;\n\n case HotkeyInfo::Exit:\n SendMessage(Handle(), WM_CLOSE, NULL, NULL);\n break;\n }\n}\n\nvoid _3RVX::ToggleOSDs() {\n _eOSD->Enabled(!(_eOSD->Enabled()));\n _vOSD->Enabled(!(_vOSD->Enabled()));\n}\n\nLRESULT _3RVX::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n switch (message) {\n case WM_HOTKEY: {\n CLOG(L\"Hotkey: %d\", (int) wParam);\n HotkeyInfo hki = _hotkeys[(int) wParam];\n ProcessHotkeys(hki);\n break;\n }\n\n case WM_WTSSESSION_CHANGE: {\n CLOG(L\"Detected session change\");\n break;\n }\n\n case WM_CLOSE: {\n CLOG(L\"Shutting down\");\n HotkeyManager::Instance()->Shutdown();\n _vOSD->HideIcon();\n break;\n }\n\n case WM_DESTROY: {\n PostQuitMessage(0);\n break;\n }\n\n case WM_TIMER:\n if (wParam == TIMER_FIRSTUPDATE || wParam == TIMER_UPDATE) {\n Settings *settings = Settings::Instance();\n long long checkTime = settings->UpdateCheckTime();\n if ((std::time(nullptr) - checkTime) > (UPDATE_INTERVAL \/ 1000)) {\n \/* Enough time has elapsed since the last update check *\/\n std::wstring settingsApp = Settings::SettingsApp();\n CLOG(L\"Launching update task: %s %s\",\n settingsApp.c_str(), L\"-update\");\n ShellExecute(NULL, L\"open\",\n Settings::SettingsApp().c_str(), L\"-update\", NULL, SW_HIDE);\n\n if (wParam == TIMER_FIRSTUPDATE) {\n \/* If this was the first update check (30 min after launch),\n * then kill the first update timer and start the main timer\n * (checks on 24-hour intervals) *\/\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n SetTimer(Window::Handle(), TIMER_UPDATE,\n UPDATE_INTERVAL, NULL);\n }\n }\n }\n break;\n }\n\n if (message == _3RVX::WM_3RVX_CTRL) {\n switch (wParam) {\n case _3RVX::MSG_LOAD:\n Initialize();\n break;\n\n case _3RVX::MSG_SETTINGS:\n Settings::LaunchSettingsApp();\n break;\n\n case _3RVX::MSG_HIDEOSD:\n int except = (OSDType) lParam;\n switch (except) {\n case Volume:\n if (_eOSD) {\n _eOSD->Hide();\n }\n break;\n\n case Eject:\n if (_vOSD) {\n _vOSD->Hide();\n }\n break;\n }\n\n break;\n }\n }\n\n return Window::WndProc(hWnd, message, wParam, lParam);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- C++ -*-\n * (c) 2009 Helge Bahmann <hcb@chaoticmind.net>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 2.1\n * Refer to the file \"COPYING\" for details.\n *\/\n\n#include <boost\/bind.hpp>\n\n#define private public\n#define protected public\n\n#include \"tests.h\"\n\n#include <tscb\/ioready>\n#include <pthread.h>\n\nvoid test_pipe_eventflag(void)\n{\n\ttscb::pipe_eventflag e;\n\t\n\tASSERT(e.flagged==0);\n\te.set();\n\tASSERT(e.flagged==1);\n\te.clear();\n\tASSERT(e.flagged==0);\n\t\n\te.start_waiting();\n\tASSERT(e.waiting==1);\n\te.stop_waiting();\n\tASSERT(e.waiting==0);\n\t\n\te.set();\n\tASSERT(e.flagged==1);\n\te.clear();\n}\n\nmain()\n{\n\ttest_pipe_eventflag();\n}\n<commit_msg>Silence compiler warning<commit_after>\/* -*- C++ -*-\n * (c) 2009 Helge Bahmann <hcb@chaoticmind.net>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 2.1\n * Refer to the file \"COPYING\" for details.\n *\/\n\n#include <boost\/bind.hpp>\n\n#define private public\n#define protected public\n\n#include \"tests.h\"\n\n#include <tscb\/ioready>\n#include <pthread.h>\n\nvoid test_pipe_eventflag(void)\n{\n\ttscb::pipe_eventflag e;\n\t\n\tASSERT(e.flagged==0);\n\te.set();\n\tASSERT(e.flagged==1);\n\te.clear();\n\tASSERT(e.flagged==0);\n\t\n\te.start_waiting();\n\tASSERT(e.waiting==1);\n\te.stop_waiting();\n\tASSERT(e.waiting==0);\n\t\n\te.set();\n\tASSERT(e.flagged==1);\n\te.clear();\n}\n\nint main()\n{\n\ttest_pipe_eventflag();\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n *\n * @file compiled_plugin_base.cpp\n *\n * @date Jan 15, 2013\n * @author partio\n *\/\n\n#include \"compiled_plugin_base.h\"\n#include <boost\/thread.hpp>\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include \"util.h\"\n#include \"cuda_helper.h\"\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"fetcher.h\"\n#include \"neons.h\"\n#include \"writer.h\"\n#include \"cache.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace std;\nusing namespace himan;\nusing namespace himan::plugin;\n\nconst double kInterpolatedValueEpsilon = 0.00001; \/\/<! Max difference between two grid points (if smaller, points are considered the same)\nmutex itsAdjustDimensionMutex;\n\ncompiled_plugin_base::compiled_plugin_base() : itsPluginIsInitialized(false)\n{\n\titsBaseLogger = std::unique_ptr<logger> (logger_factory::Instance()->GetLog(\"compiled_plugin_base\"));\n}\n\nbool compiled_plugin_base::AdjustLeadingDimension(const info_t& myTargetInfo)\n{\n\n\tlock_guard<mutex> lock(itsAdjustDimensionMutex);\n\n\t\/\/ Leading dimension can be: time or level\n\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tif (!itsInfo->NextTime())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tmyTargetInfo->Time(itsInfo->Time());\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tif (!itsInfo->NextLevel())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tmyTargetInfo->Level(itsInfo->Level());\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": Invalid dimension type: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::AdjustNonLeadingDimension(const info_t& myTargetInfo)\n{\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\treturn myTargetInfo->NextLevel();\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\treturn myTargetInfo->NextTime();\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": unsupported leading dimension: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n}\n\nvoid compiled_plugin_base::ResetNonLeadingDimension(const info_t& myTargetInfo)\n{\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tmyTargetInfo->ResetLevel();\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tmyTargetInfo->ResetTime();\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": unsupported leading dimension: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n}\n\nbool compiled_plugin_base::SetAB(const info_t& myTargetInfo, const info_t& sourceInfo)\n{\n\tif (myTargetInfo->Level().Type() == kHybrid)\n\t{\n\t\tsize_t index = myTargetInfo->ParamIndex();\n\n\t\tmyTargetInfo->Grid()->AB(sourceInfo->Grid()->AB());\n\n\t\tmyTargetInfo->ParamIndex(index);\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::SwapTo(const info_t& myTargetInfo, HPScanningMode targetScanningMode)\n{\n\n\tif (myTargetInfo->Grid()->ScanningMode() != targetScanningMode)\n\t{\n\t\tHPScanningMode originalMode = myTargetInfo->Grid()->ScanningMode();\n\n\t\tmyTargetInfo->Grid()->ScanningMode(targetScanningMode);\n\n\t\tmyTargetInfo->Grid()->Swap(originalMode);\n\t}\n\n\treturn true;\n}\n\nvoid compiled_plugin_base::WriteToFile(const shared_ptr<const info>& targetInfo) const\n{\n\tauto aWriter = dynamic_pointer_cast <writer> (plugin_factory::Instance()->Plugin(\"writer\"));\n\n\t\/\/ writing might modify iterator positions --> create a copy\n\n\tauto tempInfo = make_shared<info> (*targetInfo);\n\n\tif (itsConfiguration->FileWriteOption() == kNeons || itsConfiguration->FileWriteOption() == kMultipleFiles)\n\t{\n\t\t\/\/ If info holds multiple parameters, we must loop over them all\n\t\t\/\/ Note! We only loop over the parameters, not over the times or levels!\n\n\t\ttempInfo->ResetParam();\n\n\t\twhile (tempInfo->NextParam())\n\t\t{\n\t\t\taWriter->ToFile(tempInfo, itsConfiguration);\n\t\t}\n\t}\n\telse if (itsConfiguration->FileWriteOption() == kSingleFile)\n\t{\n\t\taWriter->ToFile(tempInfo, itsConfiguration, itsConfiguration->ConfigurationFile());\n\t}\n}\n\nbool compiled_plugin_base::GetAndSetCuda(int threadIndex)\n{\n\t\/\/ This function used to have more logic with regards to thread index, but all that\n\t\/\/ has been removed.\n\t\n#ifdef HAVE_CUDA\n\tbool ret = itsConfiguration->UseCuda() && itsConfiguration->CudaDeviceId() < itsConfiguration->CudaDeviceCount();\n\n\tif (ret)\n\t{\n\t\tcudaError_t err;\n\n\t\tif ((err = cudaSetDevice(itsConfiguration->CudaDeviceId())) != cudaSuccess)\n\t\t{\n\t\t\tcerr << ClassName() << \"::Warning Failed to select device #\" << itsConfiguration->CudaDeviceId() << \", error: \" << cudaGetErrorString(err) << endl;\n\t\t\tcerr << ClassName() << \"::Warning Has another CUDA process reserved the card?\\n\";\n\t\t\tret = false;\n\t\t}\n\t}\n#else\n\tbool ret = false;\n#endif\n\t\n\treturn ret;\n}\n\nvoid compiled_plugin_base::ResetCuda() const\n{\n#ifdef HAVE_CUDA\n\tCUDA_CHECK(cudaDeviceReset());\n#endif\n}\n\nvoid compiled_plugin_base::Start()\n{\n\tif (!itsPluginIsInitialized)\n\t{\n\t\titsBaseLogger->Error(\"Start() called before Init()\");\n\t\treturn;\n\t}\n\t\n\tboost::thread_group g;\n\n\t\/*\n\t * Each thread will have a copy of the target info.\n\t *\/\n\n\tfor (short i = 0; i < itsThreadCount; i++)\n\t{\n\n\t\tprintf(\"Info::compiled_plugin: Thread %d starting\\n\", (i + 1)); \/\/ Printf is thread safe\n\n\t\tboost::thread* t = new boost::thread(&compiled_plugin_base::Run,\n\t\t\t\t\t\t\t\t\t\t\t this,\n\t\t\t\t\t\t\t\t\t\t\t make_shared<info> (*itsInfo),\n\t\t\t\t\t\t\t\t\t\t\t i + 1);\n\n\t\tg.add_thread(t);\n\n\t}\n\n\tg.join_all();\n\n\tFinish();\n}\n\nvoid compiled_plugin_base::Init(const shared_ptr<const plugin_configuration> conf)\n{\n\n\tconst short MAX_THREADS = 12; \/\/<! Max number of threads we allow\n\n\titsConfiguration = conf;\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsTimer = unique_ptr<timer> (timer_factory::Instance()->GetTimer());\n\t\titsTimer->Start();\n\t\titsConfiguration->Statistics()->UsedGPUCount(conf->CudaDeviceCount());\n\t}\n\n\t\/\/ Determine thread count\n\n\tshort coreCount = static_cast<short> (boost::thread::hardware_concurrency()); \/\/ Number of cores\n\n\titsThreadCount = MAX_THREADS;\n\n\t\/\/ If user has specified thread count, always use that\n\tif (conf->ThreadCount() > 0)\n\t{\n\t\titsThreadCount = conf->ThreadCount();\n\t}\n\t\/\/ we don't want to use all cores in a server by default\n\telse if (MAX_THREADS > coreCount)\n\t{\n\t\titsThreadCount = coreCount;\n\t}\n\n\titsInfo = itsConfiguration->Info();\n\n\titsLeadingDimension = itsConfiguration->LeadingDimension();\n\t\n\titsPluginIsInitialized = true;\n}\n\nvoid compiled_plugin_base::Run(info_t myTargetInfo, unsigned short threadIndex)\n{\n\twhile (AdjustLeadingDimension(myTargetInfo))\n\t{\n\t\tResetNonLeadingDimension(myTargetInfo);\n\n\t\twhile (AdjustNonLeadingDimension(myTargetInfo))\n\t\t{\n\t\t\tCalculate(myTargetInfo, threadIndex);\n\n\t\t\tif (itsConfiguration->FileWriteOption() != kSingleFile)\n\t\t\t{\n\t\t\t\tWriteToFile(myTargetInfo);\n\t\t\t}\n\n\t\t\tif (itsConfiguration->StatisticsEnabled())\n\t\t\t{\n\t\t\t\titsConfiguration->Statistics()->AddToMissingCount(myTargetInfo->Data().MissingCount());\n\t\t\t\titsConfiguration->Statistics()->AddToValueCount(myTargetInfo->Data().Size());\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid compiled_plugin_base::Finish() const\n{\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsTimer->Stop();\n\t\titsConfiguration->Statistics()->AddToProcessingTime(itsTimer->GetTime());\n\t}\n\n\tif (itsConfiguration->FileWriteOption() == kSingleFile)\n\t{\n\t\tWriteToFile(itsInfo);\n\t}\n}\n\n\nvoid compiled_plugin_base::Calculate(info_t myTargetInfo, unsigned short threadIndex)\n{\n\titsBaseLogger->Fatal(\"Top level calculate called\");\n\texit(1);\n}\n\nvoid compiled_plugin_base::SetParams(initializer_list<param> params)\n{\n\tvector<param> paramVec;\n\n\tfor (auto it = params.begin(); it != params.end(); ++it)\n\t{\n\t\tparamVec.push_back(*it);\n\t}\n\n\tSetParams(paramVec);\n}\n\nvoid compiled_plugin_base::SetParams(std::vector<param>& params)\n{\n\tif (params.empty())\n\t{\n\t\titsBaseLogger->Fatal(\"size of target parameter vector is zero\");\n\t\texit(1);\n\t}\n\t\n\t\/\/ GRIB 1\n\n\tif (itsConfiguration->OutputFileType() == kGRIB1)\n\t{\n\t\tauto n = dynamic_pointer_cast<plugin::neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\tfor (unsigned int i = 0; i < params.size(); i++)\n\t\t{\n\t\t\tlong table2Version = itsInfo->Producer().TableVersion();\n\t\t\tlong parm_id = n->NeonsDB().GetGridParameterId(table2Version, params[i].Name());\n\n\t\t\tif (parm_id == -1)\n\t\t\t{\n\t\t\t\titsBaseLogger->Warning(\"Grib1 parameter definitions not found from Neons\");\n\t\t\t\titsBaseLogger->Warning(\"table2Version is \" + boost::lexical_cast<string> (table2Version) + \", parm_name is \" + params[i].Name());\n\t\t\t}\n\n\t\t\tparams[i].GribIndicatorOfParameter(parm_id);\n\t\t\tparams[i].GribTableVersion(table2Version);\n\t\t}\n\t}\n\n\titsInfo->Params(params);\n\n\t\/*\n\t * Create data structures.\n\t *\/\n\n\titsInfo->Create();\n\n\t\/*\n\t * Iterators must be reseted since they are at first position after Create()\n\t *\/\n\n\titsInfo->Reset();\n\n\t\/*\n\t * Do not launch more threads than there are things to calculate.\n\t *\/\n\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tif (itsInfo->SizeTimes() < static_cast<size_t> (itsThreadCount))\n\t\t{\n\t\t\titsThreadCount = static_cast<short> (itsInfo->SizeTimes());\n\t\t}\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tif (itsInfo->SizeLevels() < static_cast<size_t> (itsThreadCount))\n\t\t{\n\t\t\titsThreadCount = static_cast<short> (itsInfo->SizeLevels());\n\t\t}\n\t}\n\t\n\t\/*\n\t * From the timing perspective at this point plugin initialization is\n\t * considered to be done\n\t *\/\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsConfiguration->Statistics()->UsedThreadCount(itsThreadCount);\n\t\titsTimer->Stop();\n\t\titsConfiguration->Statistics()->AddToInitTime(itsTimer->GetTime());\n\t\t\/\/ Start process timing\n\t\titsTimer->Start();\n\t}\n\n\titsInfo->FirstParam();\n\n}\n\n#ifdef HAVE_CUDA\nvoid compiled_plugin_base::Unpack(initializer_list<info_t> infos)\n{\n\tauto c = dynamic_pointer_cast<plugin::cache> (plugin_factory::Instance()->Plugin(\"cache\"));\n\n\tfor (auto it = infos.begin(); it != infos.end(); ++it)\n\t{\n\t\tinfo_t tempInfo = *it;\n\n\t\tif (tempInfo->Grid()->PackedData().packedLength == 0)\n\t\t{\n\t\t\t\/\/ Safeguard: This particular info does not have packed data\n\t\t\tcontinue;\n\t\t}\n\n\t\tassert(tempInfo->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\tutil::Unpack({ tempInfo->Grid() });\n\n\t\tif (itsConfiguration->UseCache())\n\t\t{\n\t\t\tc->Insert(tempInfo);\n\t\t}\n\t}\n}\n#endif\n\nbool compiled_plugin_base::CompareGrids(initializer_list<shared_ptr<grid>> grids) const\n{\n\tif (grids.size() <= 1)\n\t{\n\t\tthrow kUnknownException;\n\t}\n\n\tauto it = grids.begin();\n\tauto first = *it;\n\t\n\tfor (++it; it != grids.end(); ++it)\n\t{\n\t\tif (!*it)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tif (*first != **it)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::IsMissingValue(initializer_list<double> values) const\n{\n\tfor (auto it = values.begin(); it != values.end(); ++it)\n\t{\n\t\tif (*it == kFloatMissing)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\ninfo_t compiled_plugin_base::Fetch(const forecast_time& theTime, const level& theLevel, const params& theParams, bool returnPacked) const\n{\n\tauto f = dynamic_pointer_cast <fetcher> (plugin_factory::Instance()->Plugin(\"fetcher\"));\n\n\tinfo_t ret;\n\n\ttry\n\t{\n\t\tret = f->Fetch(itsConfiguration, theTime, theLevel, theParams, itsConfiguration->UseCudaForPacking());\n\n#ifdef HAVE_CUDA\n\t\tif (!returnPacked && ret->Grid()->IsPackedData())\n\t\t{\n\t\t\tassert(ret->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\t\tutil::Unpack({ret->Grid()});\n\t\t}\n#endif\n\t}\n\tcatch (HPExceptionType& e)\n\t{\n\t\tif (e != kFileDataNotFound)\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unable to proceed\");\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ninfo_t compiled_plugin_base::Fetch(const forecast_time& theTime, const level& theLevel, const param& theParam, bool returnPacked) const\n{\n\tauto f = dynamic_pointer_cast <fetcher> (plugin_factory::Instance()->Plugin(\"fetcher\"));\n\n\tinfo_t ret;\n\n\ttry\n\t{\n\t\tret = f->Fetch(itsConfiguration, theTime, theLevel, theParam, itsConfiguration->UseCudaForPacking());\n\n#ifdef HAVE_CUDA\n\t\tif (!returnPacked && ret->Grid()->IsPackedData())\n\t\t{\n\t\t\tassert(ret->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\t\tutil::Unpack({ret->Grid()});\n\t\t}\n#endif\n\t}\n\tcatch (HPExceptionType& e)\n\t{\n\t\tif (e != kFileDataNotFound)\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unable to proceed\");\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ninfo* compiled_plugin_base::FetchRaw(const forecast_time& theTime, const level& theLevel, const param& theParam, bool returnPacked) const\n{\n\tauto r = Fetch(theTime,theLevel,theParam,false);\n\tcout << *r.get();\n\treturn r.get();\n}<commit_msg>reference instead of shared_ptr<commit_after>\/**\n *\n * @file compiled_plugin_base.cpp\n *\n * @date Jan 15, 2013\n * @author partio\n *\/\n\n#include \"compiled_plugin_base.h\"\n#include <boost\/thread.hpp>\n#include \"plugin_factory.h\"\n#include \"logger_factory.h\"\n#include \"util.h\"\n#include \"cuda_helper.h\"\n\n#define HIMAN_AUXILIARY_INCLUDE\n\n#include \"fetcher.h\"\n#include \"neons.h\"\n#include \"writer.h\"\n#include \"cache.h\"\n\n#undef HIMAN_AUXILIARY_INCLUDE\n\nusing namespace std;\nusing namespace himan;\nusing namespace himan::plugin;\n\nconst double kInterpolatedValueEpsilon = 0.00001; \/\/<! Max difference between two grid points (if smaller, points are considered the same)\nmutex itsAdjustDimensionMutex;\n\ncompiled_plugin_base::compiled_plugin_base() : itsPluginIsInitialized(false)\n{\n\titsBaseLogger = std::unique_ptr<logger> (logger_factory::Instance()->GetLog(\"compiled_plugin_base\"));\n}\n\nbool compiled_plugin_base::AdjustLeadingDimension(const info_t& myTargetInfo)\n{\n\n\tlock_guard<mutex> lock(itsAdjustDimensionMutex);\n\n\t\/\/ Leading dimension can be: time or level\n\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tif (!itsInfo->NextTime())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tmyTargetInfo->Time(itsInfo->Time());\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tif (!itsInfo->NextLevel())\n\t\t{\n\t\t\treturn false;\n\t\t}\n\n\t\tmyTargetInfo->Level(itsInfo->Level());\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": Invalid dimension type: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::AdjustNonLeadingDimension(const info_t& myTargetInfo)\n{\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\treturn myTargetInfo->NextLevel();\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\treturn myTargetInfo->NextTime();\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": unsupported leading dimension: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n}\n\nvoid compiled_plugin_base::ResetNonLeadingDimension(const info_t& myTargetInfo)\n{\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tmyTargetInfo->ResetLevel();\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tmyTargetInfo->ResetTime();\n\t}\n\telse\n\t{\n\t\tthrow runtime_error(ClassName() + \": unsupported leading dimension: \" + boost::lexical_cast<string> (itsLeadingDimension));\n\t}\n}\n\nbool compiled_plugin_base::SetAB(const info_t& myTargetInfo, const info_t& sourceInfo)\n{\n\tif (myTargetInfo->Level().Type() == kHybrid)\n\t{\n\t\tsize_t index = myTargetInfo->ParamIndex();\n\n\t\tmyTargetInfo->Grid()->AB(sourceInfo->Grid()->AB());\n\n\t\tmyTargetInfo->ParamIndex(index);\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::SwapTo(const info_t& myTargetInfo, HPScanningMode targetScanningMode)\n{\n\n\tif (myTargetInfo->Grid()->ScanningMode() != targetScanningMode)\n\t{\n\t\tHPScanningMode originalMode = myTargetInfo->Grid()->ScanningMode();\n\n\t\tmyTargetInfo->Grid()->ScanningMode(targetScanningMode);\n\n\t\tmyTargetInfo->Grid()->Swap(originalMode);\n\t}\n\n\treturn true;\n}\n\nvoid compiled_plugin_base::WriteToFile(const info& targetInfo) const\n{\n\tauto aWriter = dynamic_pointer_cast <writer> (plugin_factory::Instance()->Plugin(\"writer\"));\n\n\t\/\/ writing might modify iterator positions --> create a copy\n\n\tauto tempInfo = targetInfo;\n\n\tif (itsConfiguration->FileWriteOption() == kNeons || itsConfiguration->FileWriteOption() == kMultipleFiles)\n\t{\n\t\t\/\/ If info holds multiple parameters, we must loop over them all\n\t\t\/\/ Note! We only loop over the parameters, not over the times or levels!\n\n\t\ttempInfo.ResetParam();\n\n\t\twhile (tempInfo.NextParam())\n\t\t{\n\t\t\taWriter->ToFile(tempInfo, *itsConfiguration);\n\t\t}\n\t}\n\telse if (itsConfiguration->FileWriteOption() == kSingleFile)\n\t{\n\t\taWriter->ToFile(tempInfo, *itsConfiguration, itsConfiguration->ConfigurationFile());\n\t}\n}\n\nbool compiled_plugin_base::GetAndSetCuda(int threadIndex)\n{\n\t\/\/ This function used to have more logic with regards to thread index, but all that\n\t\/\/ has been removed.\n\t\n#ifdef HAVE_CUDA\n\tbool ret = itsConfiguration->UseCuda() && itsConfiguration->CudaDeviceId() < itsConfiguration->CudaDeviceCount();\n\n\tif (ret)\n\t{\n\t\tcudaError_t err;\n\n\t\tif ((err = cudaSetDevice(itsConfiguration->CudaDeviceId())) != cudaSuccess)\n\t\t{\n\t\t\tcerr << ClassName() << \"::Warning Failed to select device #\" << itsConfiguration->CudaDeviceId() << \", error: \" << cudaGetErrorString(err) << endl;\n\t\t\tcerr << ClassName() << \"::Warning Has another CUDA process reserved the card?\\n\";\n\t\t\tret = false;\n\t\t}\n\t}\n#else\n\tbool ret = false;\n#endif\n\t\n\treturn ret;\n}\n\nvoid compiled_plugin_base::ResetCuda() const\n{\n#ifdef HAVE_CUDA\n\tCUDA_CHECK(cudaDeviceReset());\n#endif\n}\n\nvoid compiled_plugin_base::Start()\n{\n\tif (!itsPluginIsInitialized)\n\t{\n\t\titsBaseLogger->Error(\"Start() called before Init()\");\n\t\treturn;\n\t}\n\t\n\tboost::thread_group g;\n\n\t\/*\n\t * Each thread will have a copy of the target info.\n\t *\/\n\n\tfor (short i = 0; i < itsThreadCount; i++)\n\t{\n\n\t\tprintf(\"Info::compiled_plugin: Thread %d starting\\n\", (i + 1)); \/\/ Printf is thread safe\n\n\t\tboost::thread* t = new boost::thread(&compiled_plugin_base::Run,\n\t\t\t\t\t\t\t\t\t\t\t this,\n\t\t\t\t\t\t\t\t\t\t\t make_shared<info> (*itsInfo),\n\t\t\t\t\t\t\t\t\t\t\t i + 1);\n\n\t\tg.add_thread(t);\n\n\t}\n\n\tg.join_all();\n\n\tFinish();\n}\n\nvoid compiled_plugin_base::Init(const shared_ptr<const plugin_configuration> conf)\n{\n\n\tconst short MAX_THREADS = 12; \/\/<! Max number of threads we allow\n\n\titsConfiguration = conf;\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsTimer = unique_ptr<timer> (timer_factory::Instance()->GetTimer());\n\t\titsTimer->Start();\n\t\titsConfiguration->Statistics()->UsedGPUCount(conf->CudaDeviceCount());\n\t}\n\n\t\/\/ Determine thread count\n\n\tshort coreCount = static_cast<short> (boost::thread::hardware_concurrency()); \/\/ Number of cores\n\n\titsThreadCount = MAX_THREADS;\n\n\t\/\/ If user has specified thread count, always use that\n\tif (conf->ThreadCount() > 0)\n\t{\n\t\titsThreadCount = conf->ThreadCount();\n\t}\n\t\/\/ we don't want to use all cores in a server by default\n\telse if (MAX_THREADS > coreCount)\n\t{\n\t\titsThreadCount = coreCount;\n\t}\n\n\titsInfo = itsConfiguration->Info();\n\n\titsLeadingDimension = itsConfiguration->LeadingDimension();\n\t\n\titsPluginIsInitialized = true;\n}\n\nvoid compiled_plugin_base::Run(info_t myTargetInfo, unsigned short threadIndex)\n{\n\twhile (AdjustLeadingDimension(myTargetInfo))\n\t{\n\t\tResetNonLeadingDimension(myTargetInfo);\n\n\t\twhile (AdjustNonLeadingDimension(myTargetInfo))\n\t\t{\n\t\t\tCalculate(myTargetInfo, threadIndex);\n\n\t\t\tif (itsConfiguration->FileWriteOption() != kSingleFile)\n\t\t\t{\n\t\t\t\tWriteToFile(*myTargetInfo);\n\t\t\t}\n\n\t\t\tif (itsConfiguration->StatisticsEnabled())\n\t\t\t{\n\t\t\t\titsConfiguration->Statistics()->AddToMissingCount(myTargetInfo->Data().MissingCount());\n\t\t\t\titsConfiguration->Statistics()->AddToValueCount(myTargetInfo->Data().Size());\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid compiled_plugin_base::Finish() const\n{\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsTimer->Stop();\n\t\titsConfiguration->Statistics()->AddToProcessingTime(itsTimer->GetTime());\n\t}\n\n\tif (itsConfiguration->FileWriteOption() == kSingleFile)\n\t{\n\t\tWriteToFile(*itsInfo);\n\t}\n}\n\n\nvoid compiled_plugin_base::Calculate(info_t myTargetInfo, unsigned short threadIndex)\n{\n\titsBaseLogger->Fatal(\"Top level calculate called\");\n\texit(1);\n}\n\nvoid compiled_plugin_base::SetParams(initializer_list<param> params)\n{\n\tvector<param> paramVec;\n\n\tfor (auto it = params.begin(); it != params.end(); ++it)\n\t{\n\t\tparamVec.push_back(*it);\n\t}\n\n\tSetParams(paramVec);\n}\n\nvoid compiled_plugin_base::SetParams(std::vector<param>& params)\n{\n\tif (params.empty())\n\t{\n\t\titsBaseLogger->Fatal(\"size of target parameter vector is zero\");\n\t\texit(1);\n\t}\n\t\n\t\/\/ GRIB 1\n\n\tif (itsConfiguration->OutputFileType() == kGRIB1)\n\t{\n\t\tauto n = dynamic_pointer_cast<plugin::neons> (plugin_factory::Instance()->Plugin(\"neons\"));\n\n\t\tfor (unsigned int i = 0; i < params.size(); i++)\n\t\t{\n\t\t\tlong table2Version = itsInfo->Producer().TableVersion();\n\t\t\tlong parm_id = n->NeonsDB().GetGridParameterId(table2Version, params[i].Name());\n\n\t\t\tif (parm_id == -1)\n\t\t\t{\n\t\t\t\titsBaseLogger->Warning(\"Grib1 parameter definitions not found from Neons\");\n\t\t\t\titsBaseLogger->Warning(\"table2Version is \" + boost::lexical_cast<string> (table2Version) + \", parm_name is \" + params[i].Name());\n\t\t\t}\n\n\t\t\tparams[i].GribIndicatorOfParameter(parm_id);\n\t\t\tparams[i].GribTableVersion(table2Version);\n\t\t}\n\t}\n\n\titsInfo->Params(params);\n\n\t\/*\n\t * Create data structures.\n\t *\/\n\n\titsInfo->Create();\n\n\t\/*\n\t * Iterators must be reseted since they are at first position after Create()\n\t *\/\n\n\titsInfo->Reset();\n\n\t\/*\n\t * Do not launch more threads than there are things to calculate.\n\t *\/\n\n\tif (itsLeadingDimension == kTimeDimension)\n\t{\n\t\tif (itsInfo->SizeTimes() < static_cast<size_t> (itsThreadCount))\n\t\t{\n\t\t\titsThreadCount = static_cast<short> (itsInfo->SizeTimes());\n\t\t}\n\t}\n\telse if (itsLeadingDimension == kLevelDimension)\n\t{\n\t\tif (itsInfo->SizeLevels() < static_cast<size_t> (itsThreadCount))\n\t\t{\n\t\t\titsThreadCount = static_cast<short> (itsInfo->SizeLevels());\n\t\t}\n\t}\n\t\n\t\/*\n\t * From the timing perspective at this point plugin initialization is\n\t * considered to be done\n\t *\/\n\n\tif (itsConfiguration->StatisticsEnabled())\n\t{\n\t\titsConfiguration->Statistics()->UsedThreadCount(itsThreadCount);\n\t\titsTimer->Stop();\n\t\titsConfiguration->Statistics()->AddToInitTime(itsTimer->GetTime());\n\t\t\/\/ Start process timing\n\t\titsTimer->Start();\n\t}\n\n\titsInfo->FirstParam();\n\n}\n\n#ifdef HAVE_CUDA\nvoid compiled_plugin_base::Unpack(initializer_list<info_t> infos)\n{\n\tauto c = dynamic_pointer_cast<plugin::cache> (plugin_factory::Instance()->Plugin(\"cache\"));\n\n\tfor (auto it = infos.begin(); it != infos.end(); ++it)\n\t{\n\t\tinfo_t tempInfo = *it;\n\n\t\tif (tempInfo->Grid()->PackedData().packedLength == 0)\n\t\t{\n\t\t\t\/\/ Safeguard: This particular info does not have packed data\n\t\t\tcontinue;\n\t\t}\n\n\t\tassert(tempInfo->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\tutil::Unpack({ tempInfo->Grid() });\n\n\t\tif (itsConfiguration->UseCache())\n\t\t{\n\t\t\tc->Insert(*tempInfo);\n\t\t}\n\t}\n}\n#endif\n\nbool compiled_plugin_base::CompareGrids(initializer_list<shared_ptr<grid>> grids) const\n{\n\tif (grids.size() <= 1)\n\t{\n\t\tthrow kUnknownException;\n\t}\n\n\tauto it = grids.begin();\n\tauto first = *it;\n\t\n\tfor (++it; it != grids.end(); ++it)\n\t{\n\t\tif (!*it)\n\t\t{\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tif (*first != **it)\n\t\t{\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nbool compiled_plugin_base::IsMissingValue(initializer_list<double> values) const\n{\n\tfor (auto it = values.begin(); it != values.end(); ++it)\n\t{\n\t\tif (*it == kFloatMissing)\n\t\t{\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n\ninfo_t compiled_plugin_base::Fetch(const forecast_time& theTime, const level& theLevel, const params& theParams, bool returnPacked) const\n{\n\tauto f = dynamic_pointer_cast <fetcher> (plugin_factory::Instance()->Plugin(\"fetcher\"));\n\n\tinfo_t ret;\n\n\ttry\n\t{\n\t\tret = f->Fetch(itsConfiguration, theTime, theLevel, theParams, itsConfiguration->UseCudaForPacking());\n\n#ifdef HAVE_CUDA\n\t\tif (!returnPacked && ret->Grid()->IsPackedData())\n\t\t{\n\t\t\tassert(ret->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\t\tutil::Unpack({ret->Grid()});\n\t\t}\n#endif\n\t}\n\tcatch (HPExceptionType& e)\n\t{\n\t\tif (e != kFileDataNotFound)\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unable to proceed\");\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ninfo_t compiled_plugin_base::Fetch(const forecast_time& theTime, const level& theLevel, const param& theParam, bool returnPacked) const\n{\n\tauto f = dynamic_pointer_cast <fetcher> (plugin_factory::Instance()->Plugin(\"fetcher\"));\n\n\tinfo_t ret;\n\n\ttry\n\t{\n\t\tret = f->Fetch(itsConfiguration, theTime, theLevel, theParam, itsConfiguration->UseCudaForPacking());\n\n#ifdef HAVE_CUDA\n\t\tif (!returnPacked && ret->Grid()->IsPackedData())\n\t\t{\n\t\t\tassert(ret->Grid()->PackedData().ClassName() == \"simple_packed\");\n\n\t\t\tutil::Unpack({ret->Grid()});\n\t\t}\n#endif\n\t}\n\tcatch (HPExceptionType& e)\n\t{\n\t\tif (e != kFileDataNotFound)\n\t\t{\n\t\t\tthrow runtime_error(ClassName() + \": Unable to proceed\");\n\t\t}\n\t}\n\n\treturn ret;\n}\n\ninfo* compiled_plugin_base::FetchRaw(const forecast_time& theTime, const level& theLevel, const param& theParam, bool returnPacked) const\n{\n\tauto r = Fetch(theTime,theLevel,theParam,false);\n\tassert(r);\n\treturn r.get();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* OpenSceneGraph example, osgspotlight.\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n#include <osg\/Notify>\n#include <osg\/MatrixTransform>\n#include <osg\/ShapeDrawable>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/Geometry>\n#include <osg\/Texture2D>\n#include <osg\/Geode>\n#include <osg\/LightSource>\n#include <osg\/TexGenNode>\n\n#include <osgUtil\/Optimizer>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgViewer\/Viewer>\n\n\n\/\/ for the grid data..\n#include \"..\/osghangglide\/terrain_coords.h\"\n\n\nosg::Image* createSpotLightImage(const osg::Vec4& centerColour, const osg::Vec4& backgroudColour, unsigned int size, float power)\n{\n osg::Image* image = new osg::Image;\n image->allocateImage(size,size,1,\n GL_RGBA,GL_UNSIGNED_BYTE);\n\n\n float mid = (float(size)-1)*0.5f;\n float div = 2.0f\/float(size);\n for(unsigned int r=0;r<size;++r)\n {\n unsigned char* ptr = image->data(0,r,0);\n for(unsigned int c=0;c<size;++c)\n {\n float dx = (float(c) - mid)*div;\n float dy = (float(r) - mid)*div;\n float pr = powf(1.0f-sqrtf(dx*dx+dy*dy),power);\n if (pr<0.0f) pr=0.0f;\n osg::Vec4 color = centerColour*r+backgroudColour*(1.0f-pr);\n *ptr++ = (unsigned char)((color[0])*255.0f);\n *ptr++ = (unsigned char)((color[1])*255.0f);\n *ptr++ = (unsigned char)((color[2])*255.0f);\n *ptr++ = (unsigned char)((color[3])*255.0f);\n }\n }\n return image;\n\n \/\/return osgDB::readImageFile(\"spot.dds\");\n}\n\nosg::StateSet* createSpotLightDecoratorState(unsigned int lightNum, unsigned int textureUnit)\n{\n osg::StateSet* stateset = new osg::StateSet;\n\n stateset->setMode(GL_LIGHT0+lightNum, osg::StateAttribute::ON);\n\n osg::Vec4 centerColour(1.0f,1.0f,1.0f,1.0f);\n osg::Vec4 ambientColour(0.05f,0.05f,0.05f,1.0f);\n\n \/\/ set up spot light texture\n osg::Texture2D* texture = new osg::Texture2D();\n texture->setImage(createSpotLightImage(centerColour, ambientColour, 64, 1.0));\n texture->setBorderColor(osg::Vec4(ambientColour));\n texture->setWrap(osg::Texture::WRAP_S,osg::Texture::CLAMP_TO_BORDER);\n texture->setWrap(osg::Texture::WRAP_T,osg::Texture::CLAMP_TO_BORDER);\n texture->setWrap(osg::Texture::WRAP_R,osg::Texture::CLAMP_TO_BORDER);\n\n stateset->setTextureAttributeAndModes(textureUnit, texture, osg::StateAttribute::ON);\n\n \/\/ set up tex gens\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_S, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_T, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_R, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_Q, osg::StateAttribute::ON);\n\n return stateset;\n}\n\n\nosg::Node* createSpotLightNode(const osg::Vec3& position, const osg::Vec3& direction, float angle, unsigned int lightNum, unsigned int textureUnit)\n{\n osg::Group* group = new osg::Group;\n\n \/\/ create light source.\n osg::LightSource* lightsource = new osg::LightSource;\n osg::Light* light = lightsource->getLight();\n light->setLightNum(lightNum);\n light->setPosition(osg::Vec4(position,1.0f));\n light->setAmbient(osg::Vec4(0.00f,0.00f,0.05f,1.0f));\n light->setDiffuse(osg::Vec4(1.0f,1.0f,1.0f,1.0f));\n group->addChild(lightsource);\n\n \/\/ create tex gen.\n\n osg::Vec3 up(0.0f,0.0f,1.0f);\n up = (direction ^ up) ^ direction;\n up.normalize();\n\n osg::TexGenNode* texgenNode = new osg::TexGenNode;\n texgenNode->setTextureUnit(textureUnit);\n osg::TexGen* texgen = texgenNode->getTexGen();\n texgen->setMode(osg::TexGen::EYE_LINEAR);\n texgen->setPlanesFromMatrix(osg::Matrixd::lookAt(position, position+direction, up)*\n osg::Matrixd::perspective(angle,1.0,0.1,100)*\n osg::Matrixd::translate(1.0,1.0,1.0)*\n osg::Matrixd::scale(0.5,0.5,0.5));\n\n\n group->addChild(texgenNode);\n\n return group;\n\n}\n\n\nosg::AnimationPath* createAnimationPath(const osg::Vec3& center,float radius,double looptime)\n{\n \/\/ set up the animation path\n osg::AnimationPath* animationPath = new osg::AnimationPath;\n animationPath->setLoopMode(osg::AnimationPath::LOOP);\n\n int numSamples = 40;\n float yaw = 0.0f;\n float yaw_delta = 2.0f*osg::PI\/((float)numSamples-1.0f);\n float roll = osg::inDegrees(30.0f);\n\n double time=0.0f;\n double time_delta = looptime\/(double)numSamples;\n for(int i=0;i<numSamples;++i)\n {\n osg::Vec3 position(center+osg::Vec3(sinf(yaw)*radius,cosf(yaw)*radius,0.0f));\n osg::Quat rotation(osg::Quat(roll,osg::Vec3(0.0,1.0,0.0))*osg::Quat(-(yaw+osg::inDegrees(90.0f)),osg::Vec3(0.0,0.0,1.0)));\n\n animationPath->insert(time,osg::AnimationPath::ControlPoint(position,rotation));\n\n yaw += yaw_delta;\n time += time_delta;\n\n }\n return animationPath;\n}\n\nosg::Node* createBase(const osg::Vec3& center,float radius)\n{\n\n osg::Geode* geode = new osg::Geode;\n\n \/\/ set up the texture of the base.\n osg::StateSet* stateset = new osg::StateSet();\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(\"Images\/lz.rgb\");\n if (image)\n {\n osg::Texture2D* texture = new osg::Texture2D;\n texture->setImage(image);\n stateset->setTextureAttributeAndModes(0,texture,osg::StateAttribute::ON);\n }\n\n geode->setStateSet( stateset );\n\n\n osg::HeightField* grid = new osg::HeightField;\n grid->allocate(38,39);\n grid->setOrigin(center+osg::Vec3(-radius,-radius,0.0f));\n grid->setXInterval(radius*2.0f\/(float)(38-1));\n grid->setYInterval(radius*2.0f\/(float)(39-1));\n\n float minHeight = FLT_MAX;\n float maxHeight = -FLT_MAX;\n\n\n unsigned int r;\n for(r=0;r<39;++r)\n {\n for(unsigned int c=0;c<38;++c)\n {\n float h = vertex[r+c*39][2];\n if (h>maxHeight) maxHeight=h;\n if (h<minHeight) minHeight=h;\n }\n }\n\n float hieghtScale = radius*0.5f\/(maxHeight-minHeight);\n float hieghtOffset = -(minHeight+maxHeight)*0.5f;\n\n for(r=0;r<39;++r)\n {\n for(unsigned int c=0;c<38;++c)\n {\n float h = vertex[r+c*39][2];\n grid->setHeight(c,r,(h+hieghtOffset)*hieghtScale);\n }\n }\n\n geode->addDrawable(new osg::ShapeDrawable(grid));\n\n osg::Group* group = new osg::Group;\n group->addChild(geode);\n\n return group;\n\n}\n\nosg::Node* createMovingModel(const osg::Vec3& center, float radius)\n{\n float animationLength = 10.0f;\n\n osg::AnimationPath* animationPath = createAnimationPath(center,radius,animationLength);\n\n osg::Group* model = new osg::Group;\n\n osg::ref_ptr<osg::Node> cessna = osgDB::readRefNodeFile(\"cessna.osgt\");\n if (cessna)\n {\n const osg::BoundingSphere& bs = cessna->getBound();\n\n float size = radius\/bs.radius()*0.3f;\n osg::MatrixTransform* positioned = new osg::MatrixTransform;\n positioned->setDataVariance(osg::Object::STATIC);\n positioned->setMatrix(osg::Matrix::translate(-bs.center())*\n osg::Matrix::scale(size,size,size)*\n osg::Matrix::rotate(osg::inDegrees(180.0f),0.0f,0.0f,2.0f));\n\n positioned->addChild(cessna);\n\n osg::MatrixTransform* xform = new osg::MatrixTransform;\n xform->setUpdateCallback(new osg::AnimationPathCallback(animationPath,0.0f,2.0));\n xform->addChild(positioned);\n\n xform->addChild(createSpotLightNode(osg::Vec3(0.0f,0.0f,0.0f), osg::Vec3(0.0f,1.0f,-1.0f), 60.0f, 0, 1));\n\n model->addChild(xform);\n }\n\n return model;\n}\n\n\n\n\nosg::Node* createModel()\n{\n osg::Vec3 center(0.0f,0.0f,0.0f);\n float radius = 100.0f;\n\n \/\/ the shadower model\n osg::Node* shadower = createMovingModel(center,radius*0.5f);\n\n \/\/ the shadowed model\n osg::Node* shadowed = createBase(center-osg::Vec3(0.0f,0.0f,radius*0.1),radius);\n\n \/\/ combine the models together to create one which has the shadower and the shadowed with the required callback.\n osg::Group* root = new osg::Group;\n\n root->setStateSet(createSpotLightDecoratorState(0,1));\n\n root->addChild(shadower);\n root->addChild(shadowed);\n\n return root;\n}\n\n\nint main(int, char **)\n{\n \/\/ construct the viewer.\n osgViewer::Viewer viewer;\n\n \/\/ add the spoit light model to the viewer\n viewer.setSceneData( createModel() );\n\n \/\/ run the viewer main frame loop.\n return viewer.run();\n}\n<commit_msg>Fixed spotlight colour mixing<commit_after>\/* OpenSceneGraph example, osgspotlight.\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n* THE SOFTWARE.\n*\/\n\n#include <osg\/Notify>\n#include <osg\/MatrixTransform>\n#include <osg\/ShapeDrawable>\n#include <osg\/PositionAttitudeTransform>\n#include <osg\/Geometry>\n#include <osg\/Texture2D>\n#include <osg\/Geode>\n#include <osg\/LightSource>\n#include <osg\/TexGenNode>\n\n#include <osgUtil\/Optimizer>\n\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n\n#include <osgViewer\/Viewer>\n\n\n\/\/ for the grid data..\n#include \"..\/osghangglide\/terrain_coords.h\"\n\n\nosg::Image* createSpotLightImage(const osg::Vec4& centerColour, const osg::Vec4& backgroudColour, unsigned int size, float power)\n{\n osg::Image* image = new osg::Image;\n image->allocateImage(size,size,1,\n GL_RGBA,GL_UNSIGNED_BYTE);\n\n\n float mid = (float(size)-1)*0.5f;\n float div = 2.0f\/float(size);\n for(unsigned int r=0;r<size;++r)\n {\n unsigned char* ptr = image->data(0,r,0);\n for(unsigned int c=0;c<size;++c)\n {\n float dx = (float(c) - mid)*div;\n float dy = (float(r) - mid)*div;\n float pr = powf(1.0f-sqrtf(dx*dx+dy*dy),power);\n if (pr<0.0f) pr=0.0f;\n osg::Vec4 color = centerColour*pr+backgroudColour*(1.0f-pr);\n *ptr++ = (unsigned char)((color[0])*255.0f);\n *ptr++ = (unsigned char)((color[1])*255.0f);\n *ptr++ = (unsigned char)((color[2])*255.0f);\n *ptr++ = (unsigned char)((color[3])*255.0f);\n }\n }\n return image;\n\n \/\/return osgDB::readImageFile(\"spot.dds\");\n}\n\nosg::StateSet* createSpotLightDecoratorState(unsigned int lightNum, unsigned int textureUnit)\n{\n osg::StateSet* stateset = new osg::StateSet;\n\n stateset->setMode(GL_LIGHT0+lightNum, osg::StateAttribute::ON);\n\n osg::Vec4 centerColour(1.0f,1.0f,1.0f,1.0f);\n osg::Vec4 ambientColour(0.05f,0.05f,0.05f,1.0f);\n\n \/\/ set up spot light texture\n osg::Texture2D* texture = new osg::Texture2D();\n texture->setImage(createSpotLightImage(centerColour, ambientColour, 64, 1.0));\n texture->setBorderColor(osg::Vec4(ambientColour));\n texture->setWrap(osg::Texture::WRAP_S,osg::Texture::CLAMP_TO_BORDER);\n texture->setWrap(osg::Texture::WRAP_T,osg::Texture::CLAMP_TO_BORDER);\n texture->setWrap(osg::Texture::WRAP_R,osg::Texture::CLAMP_TO_BORDER);\n\n stateset->setTextureAttributeAndModes(textureUnit, texture, osg::StateAttribute::ON);\n\n \/\/ set up tex gens\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_S, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_T, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_R, osg::StateAttribute::ON);\n stateset->setTextureMode(textureUnit, GL_TEXTURE_GEN_Q, osg::StateAttribute::ON);\n\n return stateset;\n}\n\n\nosg::Node* createSpotLightNode(const osg::Vec3& position, const osg::Vec3& direction, float angle, unsigned int lightNum, unsigned int textureUnit)\n{\n osg::Group* group = new osg::Group;\n\n \/\/ create light source.\n osg::LightSource* lightsource = new osg::LightSource;\n osg::Light* light = lightsource->getLight();\n light->setLightNum(lightNum);\n light->setPosition(osg::Vec4(position,1.0f));\n light->setAmbient(osg::Vec4(0.00f,0.00f,0.05f,1.0f));\n light->setDiffuse(osg::Vec4(1.0f,1.0f,1.0f,1.0f));\n group->addChild(lightsource);\n\n \/\/ create tex gen.\n\n osg::Vec3 up(0.0f,0.0f,1.0f);\n up = (direction ^ up) ^ direction;\n up.normalize();\n\n osg::TexGenNode* texgenNode = new osg::TexGenNode;\n texgenNode->setTextureUnit(textureUnit);\n osg::TexGen* texgen = texgenNode->getTexGen();\n texgen->setMode(osg::TexGen::EYE_LINEAR);\n texgen->setPlanesFromMatrix(osg::Matrixd::lookAt(position, position+direction, up)*\n osg::Matrixd::perspective(angle,1.0,0.1,100)*\n osg::Matrixd::translate(1.0,1.0,1.0)*\n osg::Matrixd::scale(0.5,0.5,0.5));\n\n\n group->addChild(texgenNode);\n\n return group;\n\n}\n\n\nosg::AnimationPath* createAnimationPath(const osg::Vec3& center,float radius,double looptime)\n{\n \/\/ set up the animation path\n osg::AnimationPath* animationPath = new osg::AnimationPath;\n animationPath->setLoopMode(osg::AnimationPath::LOOP);\n\n int numSamples = 40;\n float yaw = 0.0f;\n float yaw_delta = 2.0f*osg::PI\/((float)numSamples-1.0f);\n float roll = osg::inDegrees(30.0f);\n\n double time=0.0f;\n double time_delta = looptime\/(double)numSamples;\n for(int i=0;i<numSamples;++i)\n {\n osg::Vec3 position(center+osg::Vec3(sinf(yaw)*radius,cosf(yaw)*radius,0.0f));\n osg::Quat rotation(osg::Quat(roll,osg::Vec3(0.0,1.0,0.0))*osg::Quat(-(yaw+osg::inDegrees(90.0f)),osg::Vec3(0.0,0.0,1.0)));\n\n animationPath->insert(time,osg::AnimationPath::ControlPoint(position,rotation));\n\n yaw += yaw_delta;\n time += time_delta;\n\n }\n return animationPath;\n}\n\nosg::Node* createBase(const osg::Vec3& center,float radius)\n{\n\n osg::Geode* geode = new osg::Geode;\n\n \/\/ set up the texture of the base.\n osg::StateSet* stateset = new osg::StateSet();\n osg::ref_ptr<osg::Image> image = osgDB::readRefImageFile(\"Images\/lz.rgb\");\n if (image)\n {\n osg::Texture2D* texture = new osg::Texture2D;\n texture->setImage(image);\n stateset->setTextureAttributeAndModes(0,texture,osg::StateAttribute::ON);\n }\n\n geode->setStateSet( stateset );\n\n\n osg::HeightField* grid = new osg::HeightField;\n grid->allocate(38,39);\n grid->setOrigin(center+osg::Vec3(-radius,-radius,0.0f));\n grid->setXInterval(radius*2.0f\/(float)(38-1));\n grid->setYInterval(radius*2.0f\/(float)(39-1));\n\n float minHeight = FLT_MAX;\n float maxHeight = -FLT_MAX;\n\n\n unsigned int r;\n for(r=0;r<39;++r)\n {\n for(unsigned int c=0;c<38;++c)\n {\n float h = vertex[r+c*39][2];\n if (h>maxHeight) maxHeight=h;\n if (h<minHeight) minHeight=h;\n }\n }\n\n float hieghtScale = radius*0.5f\/(maxHeight-minHeight);\n float hieghtOffset = -(minHeight+maxHeight)*0.5f;\n\n for(r=0;r<39;++r)\n {\n for(unsigned int c=0;c<38;++c)\n {\n float h = vertex[r+c*39][2];\n grid->setHeight(c,r,(h+hieghtOffset)*hieghtScale);\n }\n }\n\n geode->addDrawable(new osg::ShapeDrawable(grid));\n\n osg::Group* group = new osg::Group;\n group->addChild(geode);\n\n return group;\n\n}\n\nosg::Node* createMovingModel(const osg::Vec3& center, float radius)\n{\n float animationLength = 10.0f;\n\n osg::AnimationPath* animationPath = createAnimationPath(center,radius,animationLength);\n\n osg::Group* model = new osg::Group;\n\n osg::ref_ptr<osg::Node> cessna = osgDB::readRefNodeFile(\"cessna.osgt\");\n if (cessna)\n {\n const osg::BoundingSphere& bs = cessna->getBound();\n\n float size = radius\/bs.radius()*0.3f;\n osg::MatrixTransform* positioned = new osg::MatrixTransform;\n positioned->setDataVariance(osg::Object::STATIC);\n positioned->setMatrix(osg::Matrix::translate(-bs.center())*\n osg::Matrix::scale(size,size,size)*\n osg::Matrix::rotate(osg::inDegrees(180.0f),0.0f,0.0f,2.0f));\n\n positioned->addChild(cessna);\n\n osg::MatrixTransform* xform = new osg::MatrixTransform;\n xform->setUpdateCallback(new osg::AnimationPathCallback(animationPath,0.0f,2.0));\n xform->addChild(positioned);\n\n xform->addChild(createSpotLightNode(osg::Vec3(0.0f,0.0f,0.0f), osg::Vec3(0.0f,1.0f,-1.0f), 60.0f, 0, 1));\n\n model->addChild(xform);\n }\n\n return model;\n}\n\n\n\n\nosg::Node* createModel()\n{\n osg::Vec3 center(0.0f,0.0f,0.0f);\n float radius = 100.0f;\n\n \/\/ the shadower model\n osg::Node* shadower = createMovingModel(center,radius*0.5f);\n\n \/\/ the shadowed model\n osg::Node* shadowed = createBase(center-osg::Vec3(0.0f,0.0f,radius*0.1),radius);\n\n \/\/ combine the models together to create one which has the shadower and the shadowed with the required callback.\n osg::Group* root = new osg::Group;\n\n root->setStateSet(createSpotLightDecoratorState(0,1));\n\n root->addChild(shadower);\n root->addChild(shadowed);\n\n return root;\n}\n\n\nint main(int, char **)\n{\n \/\/ construct the viewer.\n osgViewer::Viewer viewer;\n\n \/\/ add the spoit light model to the viewer\n viewer.setSceneData( createModel() );\n\n \/\/ run the viewer main frame loop.\n return viewer.run();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include <visionaray\/math\/constants.h>\n\nnamespace visionaray\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ point_light members\n\/\/\n\ntemplate <typename T>\ntemplate <typename U>\nVSNRAY_FUNC\ninline vector<3, U> point_light<T>::intensity(vector<3, U> const& pos) const\n{\n U att(1.0);\n\n#if 1 \/\/ use attenuation\n auto dist = length(vector<3, U>(position_) - pos);\n att = U(\n 1.0 \/ (constant_attenuation_\n + linear_attenuation_ * dist\n + quadratic_attenuation_ * dist * dist)\n );\n#endif\n\n return vector<3, U>(cl_ * kl_) * att;\n}\n\ntemplate <typename T>\ntemplate <typename Generator, typename U>\nVSNRAY_FUNC\ninline light_sample<U> point_light<T>::sample(vector<3, U> const& reference_point, Generator& gen) const\n{\n VSNRAY_UNUSED(reference_point);\n\n light_sample<U> result;\n\n auto pos = position();\n\n result.dir = pos - reference_point;\n result.dist = length(result.dir);\n result.intensity = intensity(vector<3, U>(pos)) * constants::pi<U>();\n result.normal = normalize( vector<3, U>(\n gen.next() * U(2.0) - U(1.0),\n gen.next() * U(2.0) - U(1.0),\n gen.next() * U(2.0) - U(1.0)\n ) );\n result.area = U(1.0);\n result.delta_light = true;\n\n return result;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline vector<3, T> point_light<T>::position() const\n{\n return position_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::constant_attenuation() const\n{\n return constant_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::linear_attenuation() const\n{\n return linear_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::quadratic_attenuation() const\n{\n return quadratic_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_cl(vector<3, T> const& cl)\n{\n cl_ = cl;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_kl(T kl)\n{\n kl_ = kl;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_position(vector<3, T> const& pos)\n{\n position_ = pos;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_constant_attenuation(t att)\n{\n constant_attenuation_ = att;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_linear_attenuation(t att)\n{\n linear_attenuation_ = att;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_quadratic_attenuation(t att)\n{\n quadratic_attenuation_ = att;\n}\n\n} \/\/ visionaray\n<commit_msg>Fewer relative paths<commit_after>\/\/ This file is distributed under the MIT license.\n\/\/ See the LICENSE file for details.\n\n#include \"..\/math\/constants.h\"\n\nnamespace visionaray\n{\n\n\/\/-------------------------------------------------------------------------------------------------\n\/\/ point_light members\n\/\/\n\ntemplate <typename T>\ntemplate <typename U>\nVSNRAY_FUNC\ninline vector<3, U> point_light<T>::intensity(vector<3, U> const& pos) const\n{\n U att(1.0);\n\n#if 1 \/\/ use attenuation\n auto dist = length(vector<3, U>(position_) - pos);\n att = U(\n 1.0 \/ (constant_attenuation_\n + linear_attenuation_ * dist\n + quadratic_attenuation_ * dist * dist)\n );\n#endif\n\n return vector<3, U>(cl_ * kl_) * att;\n}\n\ntemplate <typename T>\ntemplate <typename Generator, typename U>\nVSNRAY_FUNC\ninline light_sample<U> point_light<T>::sample(vector<3, U> const& reference_point, Generator& gen) const\n{\n VSNRAY_UNUSED(reference_point);\n\n light_sample<U> result;\n\n auto pos = position();\n\n result.dir = pos - reference_point;\n result.dist = length(result.dir);\n result.intensity = intensity(vector<3, U>(pos)) * constants::pi<U>();\n result.normal = normalize( vector<3, U>(\n gen.next() * U(2.0) - U(1.0),\n gen.next() * U(2.0) - U(1.0),\n gen.next() * U(2.0) - U(1.0)\n ) );\n result.area = U(1.0);\n result.delta_light = true;\n\n return result;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline vector<3, T> point_light<T>::position() const\n{\n return position_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::constant_attenuation() const\n{\n return constant_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::linear_attenuation() const\n{\n return linear_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline T point_light<T>::quadratic_attenuation() const\n{\n return quadratic_attenuation_;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_cl(vector<3, T> const& cl)\n{\n cl_ = cl;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_kl(T kl)\n{\n kl_ = kl;\n}\n\ntemplate <typename T>\nVSNRAY_FUNC\ninline void point_light<T>::set_position(vector<3, T> const& pos)\n{\n position_ = pos;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_constant_attenuation(t att)\n{\n constant_attenuation_ = att;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_linear_attenuation(t att)\n{\n linear_attenuation_ = att;\n}\n\ntemplate <typename t>\nVSNRAY_FUNC\ninline void point_light<t>::set_quadratic_attenuation(t att)\n{\n quadratic_attenuation_ = att;\n}\n\n} \/\/ visionaray\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/qtwidgets\/properties\/collapsiblegroupboxwidgetqt.h>\n#include <modules\/qtwidgets\/properties\/compositepropertywidgetqt.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/properties\/property.h>\n#include <inviwo\/core\/util\/settings\/systemsettings.h>\n#include <inviwo\/core\/properties\/propertywidgetfactory.h>\n#include <inviwo\/core\/network\/processornetwork.h>\n#include <modules\/qtwidgets\/editablelabelqt.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <QLineEdit>\n#include <QToolButton>\n#include <QGroupBox>\n#include <QPushButton>\n#include <QGridLayout>\n#include <QLabel>\n#include <QCheckBox>\n#include <warn\/pop>\n\nnamespace inviwo {\n\nCollapsibleGroupBoxWidgetQt::CollapsibleGroupBoxWidgetQt(std::string displayName, bool isCheckable)\n : PropertyWidgetQt()\n , PropertyOwnerObserver()\n , displayName_(displayName)\n , collapsed_(false)\n , checked_(false)\n , propertyOwner_(nullptr)\n , showIfEmpty_(false)\n , checkable_(isCheckable) {\n setObjectName(\"CompositeWidget\");\n\n generateWidget();\n updateFromProperty();\n}\n\nCollapsibleGroupBoxWidgetQt::CollapsibleGroupBoxWidgetQt(Property* property, bool isCheckable)\n : PropertyWidgetQt(property)\n , PropertyOwnerObserver()\n , displayName_(property->getDisplayName())\n , collapsed_(false)\n , checked_(false)\n , propertyOwner_(nullptr)\n , showIfEmpty_(false)\n , checkable_(isCheckable) {\n setObjectName(\"CompositeWidget\");\n\n generateWidget();\n updateFromProperty();\n}\n\nvoid CollapsibleGroupBoxWidgetQt::generateWidget() {\n propertyWidgetGroupLayout_ = new QGridLayout();\n propertyWidgetGroupLayout_->setAlignment(Qt::AlignTop);\n propertyWidgetGroupLayout_->setContentsMargins(\n PropertyWidgetQt::spacing, PropertyWidgetQt::spacing, 0, PropertyWidgetQt::spacing);\n propertyWidgetGroupLayout_->setHorizontalSpacing(0);\n propertyWidgetGroupLayout_->setVerticalSpacing(PropertyWidgetQt::spacing);\n\n propertyWidgetGroup_ = new QWidget(this);\n propertyWidgetGroup_->setObjectName(\"CompositeContents\");\n propertyWidgetGroup_->setLayout(propertyWidgetGroupLayout_);\n\n defaultLabel_ = new QLabel(\"No properties available\");\n\n propertyWidgetGroupLayout_->addWidget(defaultLabel_, 0, 0);\n propertyWidgetGroupLayout_->addItem(\n new QSpacerItem(PropertyWidgetQt::spacing, 1, QSizePolicy::Fixed), 0, 1);\n propertyWidgetGroupLayout_->setColumnStretch(0, 1);\n propertyWidgetGroupLayout_->setColumnStretch(1, 0);\n\n btnCollapse_ = new QToolButton(this);\n btnCollapse_->setObjectName(\"collapseButton\");\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_down.png\"));\n connect(btnCollapse_, &QToolButton::clicked, this,\n &CollapsibleGroupBoxWidgetQt::toggleCollapsed);\n\n if (property_) {\n label_ = new EditableLabelQt(this, property_, false);\n } else {\n label_ = new EditableLabelQt(this, displayName_, false);\n }\n label_->setObjectName(\"compositeLabel\");\n QSizePolicy labelPol = label_->sizePolicy();\n labelPol.setHorizontalStretch(10);\n label_->setSizePolicy(labelPol);\n connect(label_, &EditableLabelQt::textChanged, this, [&](){setDisplayName(label_->getText());});\n\n QToolButton* resetButton = new QToolButton(this);\n resetButton->setIconSize(QSize(20, 20));\n resetButton->setObjectName(\"resetButton\");\n connect(resetButton, &QToolButton::clicked, this, [&]() { property_->resetToDefaultState(); });\n resetButton->setToolTip(tr(\"Reset the group of properties to its default state\"));\n\n checkBox_ = new QCheckBox(this);\n checkBox_->setMinimumSize(5, 5);\n checkBox_->setSizePolicy(QSizePolicy(QSizePolicy::Preferred, QSizePolicy::Preferred));\n checkBox_->setChecked(checked_);\n checkBox_->setVisible(checkable_);\n\n QObject::connect(checkBox_, &QCheckBox::clicked, this,\n [&]() { setChecked(checkBox_->isChecked()); });\n\n QHBoxLayout* heading = new QHBoxLayout();\n heading->setContentsMargins(0, 0, 0, 0);\n heading->setSpacing(PropertyWidgetQt::spacing);\n heading->addWidget(btnCollapse_);\n heading->addWidget(label_);\n heading->addStretch(1);\n heading->addWidget(checkBox_);\n heading->addWidget(resetButton);\n\n QVBoxLayout* layout = new QVBoxLayout();\n setSpacingAndMargins(layout);\n layout->setContentsMargins(0, 0, 0, 0);\n layout->setSpacing(0);\n layout->addLayout(heading);\n layout->addWidget(propertyWidgetGroup_);\n\n \/\/ Adjust the margins when using a border, i.e. margin >= border width.\n \/\/ Otherwise the border might be overdrawn by children.\n this->setContentsMargins(margin, margin, margin, margin);\n\n this->setLayout(layout);\n}\n\nQSize CollapsibleGroupBoxWidgetQt::sizeHint() const {\n QSize size = layout()->sizeHint();\n size.setWidth(std::max(PropertyWidgetQt::minimumWidth, size.width()));\n return size;\n}\n\nQSize CollapsibleGroupBoxWidgetQt::minimumSizeHint() const {\n QSize size = layout()->sizeHint();\n QSize minSize = layout()->minimumSize();\n size.setWidth(std::max(PropertyWidgetQt::minimumWidth, minSize.width()));\n return size;\n}\n\nvoid CollapsibleGroupBoxWidgetQt::addProperty(Property* prop) {\n properties_.push_back(prop);\n\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto propertyWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n if (auto collapsibleWidget = dynamic_cast<CollapsibleGroupBoxWidgetQt*>(propertyWidget)) {\n collapsibleWidget->setNestedDepth(this->getNestedDepth() + 1);\n \/\/ make the collapsible widget go all the way to the right border\n propertyWidgetGroupLayout_->addWidget(propertyWidget,\n propertyWidgetGroupLayout_->rowCount(), 0, 1, -1);\n } else { \/\/ not a collapsible widget\n propertyWidget->setNestedDepth(this->getNestedDepth());\n \/\/ property widget should only be added to the left column of the layout\n propertyWidgetGroupLayout_->addWidget(propertyWidget,\n propertyWidgetGroupLayout_->rowCount(), 0);\n }\n\n propertyWidgets_.push_back(propertyWidget);\n prop->registerWidget(propertyWidget);\n connect(propertyWidget, &PropertyWidgetQt::updateSemantics, this,\n &CollapsibleGroupBoxWidgetQt::updatePropertyWidgetSemantics);\n\n propertyWidget->setParentPropertyWidget(this, getBaseContainer());\n propertyWidget->initState();\n\n } else {\n LogWarn(\"Could not find a widget for property: \" << prop->getClassIdentifier());\n }\n}\n\nstd::string CollapsibleGroupBoxWidgetQt::getDisplayName() const { return displayName_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setDisplayName(const std::string& displayName) {\n displayName_ = displayName;\n if (propertyOwner_) {\n if (Processor* p = dynamic_cast<Processor*>(propertyOwner_)) {\n try {\n p->setIdentifier(displayName);\n } catch(Exception& e) {\n label_->setText(p->getIdentifier());\n LogWarn(e.getMessage());\n }\n }\n }\n}\n\nconst std::vector<Property*>& CollapsibleGroupBoxWidgetQt::getProperties() { return properties_; }\n\nvoid CollapsibleGroupBoxWidgetQt::toggleCollapsed() { setCollapsed(!isCollapsed()); }\n\nbool CollapsibleGroupBoxWidgetQt::isCollapsed() const { return collapsed_; }\n\nbool CollapsibleGroupBoxWidgetQt::isChecked() const { return checked_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setChecked(bool checked) {\n if (!checkable_) {\n return;\n }\n\n checked_ = checked;\n \/\/ update checkbox\n checkBox_->setChecked(checked_);\n}\n\nbool CollapsibleGroupBoxWidgetQt::isCheckable() const { return checkable_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setCheckable(bool checkable) {\n if (checkable_ == checkable) {\n return;\n }\n\n checkable_ = checkable;\n \/\/ update header\n checkBox_->setVisible(checkable_);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setVisible(bool visible) {\n bool empty = util::all_of(properties_, [](Property* w) { return !w->getVisible(); });\n defaultLabel_->setVisible(empty);\n\n if (showIfEmpty_ || !empty) {\n PropertyWidgetQt::setVisible(visible);\n } else {\n PropertyWidgetQt::setVisible(false);\n }\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setCollapsed(bool collapse) {\n setUpdatesEnabled(false);\n if (collapsed_ && !collapse) {\n propertyWidgetGroup_->show();\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_down.png\"));\n } else if (!collapsed_ && collapse) {\n propertyWidgetGroup_->hide();\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_right.png\"));\n }\n collapsed_ = collapse;\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::updatePropertyWidgetSemantics(PropertyWidgetQt* widget) {\n setUpdatesEnabled(false);\n Property* prop = widget->getProperty();\n\n auto pit = std::find(properties_.begin(), properties_.end(), prop);\n auto wit = std::find(propertyWidgets_.begin(), propertyWidgets_.end(), widget);\n\n if (pit != properties_.end() && wit != propertyWidgets_.end()) {\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto newWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n prop->deregisterWidget(widget);\n\n#if (QT_VERSION >= QT_VERSION_CHECK(5, 2, 0))\n propertyWidgetGroupLayout_->replaceWidget(widget, newWidget,\n Qt::FindDirectChildrenOnly);\n#else\n int layoutPosition = propertyWidgetGroupLayout_->indexOf(widget);\n propertyWidgetGroupLayout_->removeWidget(widget);\n propertyWidgetGroupLayout_->addWidget(newWidget, layoutPosition, 0);\n#endif \/\/ QT_VERSION >= 5.2\n widget->deleteLater();\n\n prop->registerWidget(newWidget);\n \/\/ Replace the item in propertyWidgets_;\n *wit = newWidget;\n\n connect(newWidget, SIGNAL(updateSemantics(PropertyWidgetQt*)), this,\n SLOT(updatePropertyWidgetSemantics(PropertyWidgetQt*)));\n\n newWidget->setNestedDepth(this->getNestedDepth());\n newWidget->setParentPropertyWidget(this, getBaseContainer());\n newWidget->initState();\n\n } else {\n LogWarn(\"Could not change semantic for property: \" << prop->getClassIdentifier());\n }\n }\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onDidAddProperty(Property* prop, size_t index) {\n setUpdatesEnabled(false);\n std::vector<Property*>::iterator insertPoint = properties_.begin() + index;\n if (insertPoint != properties_.end()) ++insertPoint;\n\n properties_.insert(insertPoint, prop);\n\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto propertyWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n const int insertPos = static_cast<int>(index) + 1;\n\n if (auto collapsibleWidget = dynamic_cast<CollapsibleGroupBoxWidgetQt*>(propertyWidget)) {\n collapsibleWidget->setNestedDepth(this->getNestedDepth() + 1);\n \/\/ make the collapsible widget go all the way to the right border\n propertyWidgetGroupLayout_->addWidget(propertyWidget, insertPos, 0, 1, -1);\n\n } else { \/\/ not a collapsible widget\n propertyWidget->setNestedDepth(this->getNestedDepth());\n \/\/ property widget should only be added to the left column of the layout\n propertyWidgetGroupLayout_->addWidget(propertyWidget, insertPos, 0);\n }\n\n auto widgetInsertPoint = propertyWidgets_.begin() + index;\n if (widgetInsertPoint != propertyWidgets_.end()) ++widgetInsertPoint;\n\n propertyWidgets_.insert(widgetInsertPoint, propertyWidget);\n prop->registerWidget(propertyWidget);\n connect(propertyWidget, SIGNAL(updateSemantics(PropertyWidgetQt*)), this,\n SLOT(updatePropertyWidgetSemantics(PropertyWidgetQt*)));\n\n propertyWidget->setParentPropertyWidget(this, getBaseContainer());\n propertyWidget->initState();\n\n } else {\n LogWarn(\"Could not find a widget for property: \" << prop->getClassIdentifier());\n }\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onWillRemoveProperty(Property* prop, size_t index) {\n PropertyWidgetQt* propertyWidget = propertyWidgets_[index];\n\n propertyWidgetGroupLayout_->removeWidget(propertyWidget);\n propertyWidgets_.erase(propertyWidgets_.begin() + index);\n properties_.erase(properties_.begin() + index);\n propertyWidget->deleteLater();\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onProcessorIdentifierChange(Processor* processor) {\n displayName_ = processor->getIdentifier();\n label_->setText(processor->getIdentifier());\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setPropertyOwner(PropertyOwner* propertyOwner) {\n propertyOwner_ = propertyOwner;\n}\n\nPropertyOwner* CollapsibleGroupBoxWidgetQt::getPropertyOwner() const { return propertyOwner_; }\n\nconst std::vector<PropertyWidgetQt*>& CollapsibleGroupBoxWidgetQt::getPropertyWidgets() {\n return propertyWidgets_;\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setShowIfEmpty(bool val) { showIfEmpty_ = val; }\n} \/\/ namespace\n<commit_msg>QtWidgets: Prevent crash CollapsibleGroupBoxWidgetQt when reseting a processors and not a property, closes inviwo\/inviwo-dev#1673<commit_after>\/*********************************************************************************\n *\n * Inviwo - Interactive Visualization Workshop\n *\n * Copyright (c) 2013-2017 Inviwo Foundation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and\/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n *********************************************************************************\/\n\n#include <modules\/qtwidgets\/properties\/collapsiblegroupboxwidgetqt.h>\n#include <modules\/qtwidgets\/properties\/compositepropertywidgetqt.h>\n#include <inviwo\/core\/common\/inviwoapplication.h>\n#include <inviwo\/core\/properties\/property.h>\n#include <inviwo\/core\/util\/settings\/systemsettings.h>\n#include <inviwo\/core\/properties\/propertywidgetfactory.h>\n#include <inviwo\/core\/network\/processornetwork.h>\n#include <modules\/qtwidgets\/editablelabelqt.h>\n\n#include <warn\/push>\n#include <warn\/ignore\/all>\n#include <QLineEdit>\n#include <QToolButton>\n#include <QGroupBox>\n#include <QPushButton>\n#include <QGridLayout>\n#include <QLabel>\n#include <QCheckBox>\n#include <warn\/pop>\n\nnamespace inviwo {\n\nCollapsibleGroupBoxWidgetQt::CollapsibleGroupBoxWidgetQt(std::string displayName, bool isCheckable)\n : PropertyWidgetQt()\n , PropertyOwnerObserver()\n , displayName_(displayName)\n , collapsed_(false)\n , checked_(false)\n , propertyOwner_(nullptr)\n , showIfEmpty_(false)\n , checkable_(isCheckable) {\n setObjectName(\"CompositeWidget\");\n\n generateWidget();\n updateFromProperty();\n}\n\nCollapsibleGroupBoxWidgetQt::CollapsibleGroupBoxWidgetQt(Property* property, bool isCheckable)\n : PropertyWidgetQt(property)\n , PropertyOwnerObserver()\n , displayName_(property->getDisplayName())\n , collapsed_(false)\n , checked_(false)\n , propertyOwner_(nullptr)\n , showIfEmpty_(false)\n , checkable_(isCheckable) {\n setObjectName(\"CompositeWidget\");\n\n generateWidget();\n updateFromProperty();\n}\n\nvoid CollapsibleGroupBoxWidgetQt::generateWidget() {\n propertyWidgetGroupLayout_ = new QGridLayout();\n propertyWidgetGroupLayout_->setAlignment(Qt::AlignTop);\n propertyWidgetGroupLayout_->setContentsMargins(\n PropertyWidgetQt::spacing, PropertyWidgetQt::spacing, 0, PropertyWidgetQt::spacing);\n propertyWidgetGroupLayout_->setHorizontalSpacing(0);\n propertyWidgetGroupLayout_->setVerticalSpacing(PropertyWidgetQt::spacing);\n\n propertyWidgetGroup_ = new QWidget(this);\n propertyWidgetGroup_->setObjectName(\"CompositeContents\");\n propertyWidgetGroup_->setLayout(propertyWidgetGroupLayout_);\n\n defaultLabel_ = new QLabel(\"No properties available\");\n\n propertyWidgetGroupLayout_->addWidget(defaultLabel_, 0, 0);\n propertyWidgetGroupLayout_->addItem(\n new QSpacerItem(PropertyWidgetQt::spacing, 1, QSizePolicy::Fixed), 0, 1);\n propertyWidgetGroupLayout_->setColumnStretch(0, 1);\n propertyWidgetGroupLayout_->setColumnStretch(1, 0);\n\n btnCollapse_ = new QToolButton(this);\n btnCollapse_->setObjectName(\"collapseButton\");\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_down.png\"));\n connect(btnCollapse_, &QToolButton::clicked, this,\n &CollapsibleGroupBoxWidgetQt::toggleCollapsed);\n\n if (property_) {\n label_ = new EditableLabelQt(this, property_, false);\n } else {\n label_ = new EditableLabelQt(this, displayName_, false);\n }\n label_->setObjectName(\"compositeLabel\");\n QSizePolicy labelPol = label_->sizePolicy();\n labelPol.setHorizontalStretch(10);\n label_->setSizePolicy(labelPol);\n connect(label_, &EditableLabelQt::textChanged, this, [&](){setDisplayName(label_->getText());});\n\n QToolButton* resetButton = new QToolButton(this);\n resetButton->setIconSize(QSize(20, 20));\n resetButton->setObjectName(\"resetButton\");\n connect(resetButton, &QToolButton::clicked, this, [&]() {\n if (property_) {\n property_->resetToDefaultState();\n } else if (auto processor = dynamic_cast<Processor*>(propertyOwner_)) {\n processor->resetAllPoperties();\n }\n });\n\n resetButton->setToolTip(tr(\"Reset the group of properties to its default state\"));\n\n checkBox_ = new QCheckBox(this);\n checkBox_->setMinimumSize(5, 5);\n checkBox_->setSizePolicy(QSizePolicy(QSizePolicy::Preferred, QSizePolicy::Preferred));\n checkBox_->setChecked(checked_);\n checkBox_->setVisible(checkable_);\n\n QObject::connect(checkBox_, &QCheckBox::clicked, this,\n [&]() { setChecked(checkBox_->isChecked()); });\n\n QHBoxLayout* heading = new QHBoxLayout();\n heading->setContentsMargins(0, 0, 0, 0);\n heading->setSpacing(PropertyWidgetQt::spacing);\n heading->addWidget(btnCollapse_);\n heading->addWidget(label_);\n heading->addStretch(1);\n heading->addWidget(checkBox_);\n heading->addWidget(resetButton);\n\n QVBoxLayout* layout = new QVBoxLayout();\n setSpacingAndMargins(layout);\n layout->setContentsMargins(0, 0, 0, 0);\n layout->setSpacing(0);\n layout->addLayout(heading);\n layout->addWidget(propertyWidgetGroup_);\n\n \/\/ Adjust the margins when using a border, i.e. margin >= border width.\n \/\/ Otherwise the border might be overdrawn by children.\n this->setContentsMargins(margin, margin, margin, margin);\n\n this->setLayout(layout);\n}\n\nQSize CollapsibleGroupBoxWidgetQt::sizeHint() const {\n QSize size = layout()->sizeHint();\n size.setWidth(std::max(PropertyWidgetQt::minimumWidth, size.width()));\n return size;\n}\n\nQSize CollapsibleGroupBoxWidgetQt::minimumSizeHint() const {\n QSize size = layout()->sizeHint();\n QSize minSize = layout()->minimumSize();\n size.setWidth(std::max(PropertyWidgetQt::minimumWidth, minSize.width()));\n return size;\n}\n\nvoid CollapsibleGroupBoxWidgetQt::addProperty(Property* prop) {\n properties_.push_back(prop);\n\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto propertyWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n if (auto collapsibleWidget = dynamic_cast<CollapsibleGroupBoxWidgetQt*>(propertyWidget)) {\n collapsibleWidget->setNestedDepth(this->getNestedDepth() + 1);\n \/\/ make the collapsible widget go all the way to the right border\n propertyWidgetGroupLayout_->addWidget(propertyWidget,\n propertyWidgetGroupLayout_->rowCount(), 0, 1, -1);\n } else { \/\/ not a collapsible widget\n propertyWidget->setNestedDepth(this->getNestedDepth());\n \/\/ property widget should only be added to the left column of the layout\n propertyWidgetGroupLayout_->addWidget(propertyWidget,\n propertyWidgetGroupLayout_->rowCount(), 0);\n }\n\n propertyWidgets_.push_back(propertyWidget);\n prop->registerWidget(propertyWidget);\n connect(propertyWidget, &PropertyWidgetQt::updateSemantics, this,\n &CollapsibleGroupBoxWidgetQt::updatePropertyWidgetSemantics);\n\n propertyWidget->setParentPropertyWidget(this, getBaseContainer());\n propertyWidget->initState();\n\n } else {\n LogWarn(\"Could not find a widget for property: \" << prop->getClassIdentifier());\n }\n}\n\nstd::string CollapsibleGroupBoxWidgetQt::getDisplayName() const { return displayName_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setDisplayName(const std::string& displayName) {\n displayName_ = displayName;\n if (propertyOwner_) {\n if (Processor* p = dynamic_cast<Processor*>(propertyOwner_)) {\n try {\n p->setIdentifier(displayName);\n } catch(Exception& e) {\n label_->setText(p->getIdentifier());\n LogWarn(e.getMessage());\n }\n }\n }\n}\n\nconst std::vector<Property*>& CollapsibleGroupBoxWidgetQt::getProperties() { return properties_; }\n\nvoid CollapsibleGroupBoxWidgetQt::toggleCollapsed() { setCollapsed(!isCollapsed()); }\n\nbool CollapsibleGroupBoxWidgetQt::isCollapsed() const { return collapsed_; }\n\nbool CollapsibleGroupBoxWidgetQt::isChecked() const { return checked_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setChecked(bool checked) {\n if (!checkable_) {\n return;\n }\n\n checked_ = checked;\n \/\/ update checkbox\n checkBox_->setChecked(checked_);\n}\n\nbool CollapsibleGroupBoxWidgetQt::isCheckable() const { return checkable_; }\n\nvoid CollapsibleGroupBoxWidgetQt::setCheckable(bool checkable) {\n if (checkable_ == checkable) {\n return;\n }\n\n checkable_ = checkable;\n \/\/ update header\n checkBox_->setVisible(checkable_);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setVisible(bool visible) {\n bool empty = util::all_of(properties_, [](Property* w) { return !w->getVisible(); });\n defaultLabel_->setVisible(empty);\n\n if (showIfEmpty_ || !empty) {\n PropertyWidgetQt::setVisible(visible);\n } else {\n PropertyWidgetQt::setVisible(false);\n }\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setCollapsed(bool collapse) {\n setUpdatesEnabled(false);\n if (collapsed_ && !collapse) {\n propertyWidgetGroup_->show();\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_down.png\"));\n } else if (!collapsed_ && collapse) {\n propertyWidgetGroup_->hide();\n btnCollapse_->setIcon(QIcon(\":\/stylesheets\/images\/arrow_lighter_right.png\"));\n }\n collapsed_ = collapse;\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::updatePropertyWidgetSemantics(PropertyWidgetQt* widget) {\n setUpdatesEnabled(false);\n Property* prop = widget->getProperty();\n\n auto pit = std::find(properties_.begin(), properties_.end(), prop);\n auto wit = std::find(propertyWidgets_.begin(), propertyWidgets_.end(), widget);\n\n if (pit != properties_.end() && wit != propertyWidgets_.end()) {\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto newWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n prop->deregisterWidget(widget);\n\n#if (QT_VERSION >= QT_VERSION_CHECK(5, 2, 0))\n propertyWidgetGroupLayout_->replaceWidget(widget, newWidget,\n Qt::FindDirectChildrenOnly);\n#else\n int layoutPosition = propertyWidgetGroupLayout_->indexOf(widget);\n propertyWidgetGroupLayout_->removeWidget(widget);\n propertyWidgetGroupLayout_->addWidget(newWidget, layoutPosition, 0);\n#endif \/\/ QT_VERSION >= 5.2\n widget->deleteLater();\n\n prop->registerWidget(newWidget);\n \/\/ Replace the item in propertyWidgets_;\n *wit = newWidget;\n\n connect(newWidget, SIGNAL(updateSemantics(PropertyWidgetQt*)), this,\n SLOT(updatePropertyWidgetSemantics(PropertyWidgetQt*)));\n\n newWidget->setNestedDepth(this->getNestedDepth());\n newWidget->setParentPropertyWidget(this, getBaseContainer());\n newWidget->initState();\n\n } else {\n LogWarn(\"Could not change semantic for property: \" << prop->getClassIdentifier());\n }\n }\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onDidAddProperty(Property* prop, size_t index) {\n setUpdatesEnabled(false);\n std::vector<Property*>::iterator insertPoint = properties_.begin() + index;\n if (insertPoint != properties_.end()) ++insertPoint;\n\n properties_.insert(insertPoint, prop);\n\n auto factory = InviwoApplication::getPtr()->getPropertyWidgetFactory();\n if (auto propertyWidget = static_cast<PropertyWidgetQt*>(factory->create(prop).release())) {\n const int insertPos = static_cast<int>(index) + 1;\n\n if (auto collapsibleWidget = dynamic_cast<CollapsibleGroupBoxWidgetQt*>(propertyWidget)) {\n collapsibleWidget->setNestedDepth(this->getNestedDepth() + 1);\n \/\/ make the collapsible widget go all the way to the right border\n propertyWidgetGroupLayout_->addWidget(propertyWidget, insertPos, 0, 1, -1);\n\n } else { \/\/ not a collapsible widget\n propertyWidget->setNestedDepth(this->getNestedDepth());\n \/\/ property widget should only be added to the left column of the layout\n propertyWidgetGroupLayout_->addWidget(propertyWidget, insertPos, 0);\n }\n\n auto widgetInsertPoint = propertyWidgets_.begin() + index;\n if (widgetInsertPoint != propertyWidgets_.end()) ++widgetInsertPoint;\n\n propertyWidgets_.insert(widgetInsertPoint, propertyWidget);\n prop->registerWidget(propertyWidget);\n connect(propertyWidget, SIGNAL(updateSemantics(PropertyWidgetQt*)), this,\n SLOT(updatePropertyWidgetSemantics(PropertyWidgetQt*)));\n\n propertyWidget->setParentPropertyWidget(this, getBaseContainer());\n propertyWidget->initState();\n\n } else {\n LogWarn(\"Could not find a widget for property: \" << prop->getClassIdentifier());\n }\n setUpdatesEnabled(true);\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onWillRemoveProperty(Property* prop, size_t index) {\n PropertyWidgetQt* propertyWidget = propertyWidgets_[index];\n\n propertyWidgetGroupLayout_->removeWidget(propertyWidget);\n propertyWidgets_.erase(propertyWidgets_.begin() + index);\n properties_.erase(properties_.begin() + index);\n propertyWidget->deleteLater();\n}\n\nvoid CollapsibleGroupBoxWidgetQt::onProcessorIdentifierChange(Processor* processor) {\n displayName_ = processor->getIdentifier();\n label_->setText(processor->getIdentifier());\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setPropertyOwner(PropertyOwner* propertyOwner) {\n propertyOwner_ = propertyOwner;\n}\n\nPropertyOwner* CollapsibleGroupBoxWidgetQt::getPropertyOwner() const { return propertyOwner_; }\n\nconst std::vector<PropertyWidgetQt*>& CollapsibleGroupBoxWidgetQt::getPropertyWidgets() {\n return propertyWidgets_;\n}\n\nvoid CollapsibleGroupBoxWidgetQt::setShowIfEmpty(bool val) { showIfEmpty_ = val; }\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"3RVX.h\"\n\n#pragma comment(lib, \"gdiplus.lib\")\n#pragma comment(lib, \"Wtsapi32.lib\")\n\n#include <Windows.h>\n#include <ctime>\n#include <gdiplus.h>\n#include <iostream>\n#include <Wtsapi32.h>\n\n#include \"DisplayManager.h\"\n#include \"HotkeyManager.h\"\n#include \"Logger.h\"\n#include \"OSD\/BrightnessOSD.h\"\n#include \"OSD\/EjectOSD.h\"\n#include \"OSD\/VolumeOSD.h\"\n#include \"Settings.h\"\n#include \"Skin\/SkinManager.h\"\n\nint WINAPI wWinMain(_In_ HINSTANCE hInstance, _In_opt_ HINSTANCE hPrevInstance,\n _In_ LPWSTR lpCmdLine, _In_ int nShowCmd) {\n\n Logger::Start();\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n HANDLE mutex;\n mutex = CreateMutex(NULL, FALSE, L\"Local\\\\3RVX\");\n if (GetLastError() == ERROR_ALREADY_EXISTS) {\n if (mutex) {\n ReleaseMutex(mutex);\n }\n\n CLOG(L\"A previous instance of the program is already running.\\n\"\n L\"Requesting Settings dialog.\");\n _3RVX::Message(_3RVX::MSG_SETTINGS, NULL);\n\n#if defined(ENABLE_3RVX_LOG) && (defined(ENABLE_3RVX_LOGTOFILE) == FALSE)\n CLOG(L\"Press [enter] to terminate\");\n std::cin.get();\n#endif\n\n return EXIT_SUCCESS;\n }\n\n CLOG(L\"App directory: %s\", Settings::AppDir().c_str());\n\n using namespace Gdiplus;\n ULONG_PTR gdiplusToken;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n _3RVX mainWnd(hInstance);\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd.Handle(), _3RVX::WM_3RVX_CTRL, _3RVX::MSG_LOAD, NULL);\n\n \/* Register for session change notifications *\/\n WTSRegisterSessionNotification(mainWnd.Handle(), NOTIFY_FOR_THIS_SESSION);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n CoUninitialize();\n\n Logger::Stop();\n\n return (int) msg.wParam;\n}\n\n_3RVX::_3RVX(HINSTANCE hInstance) :\nWindow(_3RVX::CLASS_3RVX, _3RVX::CLASS_3RVX, hInstance) {\n}\n\nvoid _3RVX::Initialize() {\n CLOG(L\"Initializing...\");\n\n delete _vOSD;\n delete _eOSD;\n delete _bOSD;\n\n Settings *settings = Settings::Instance();\n settings->Load();\n\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n KillTimer(Window::Handle(), TIMER_UPDATE);\n if (settings->AutomaticUpdates()) {\n SetTimer(\n Window::Handle(),\n TIMER_FIRSTUPDATE,\n FIRSTUPDATE_INTERVAL,\n NULL);\n }\n\n SkinManager::Instance()->LoadSkin(settings->SkinXML());\n\n DisplayManager::UpdateMonitorMap();\n\n \/* OSDs *\/\n _eOSD = new EjectOSD();\n _vOSD = new VolumeOSD();\n _bOSD = new BrightnessOSD();\n\n _osds.clear();\n _osds.push_back(_eOSD);\n _osds.push_back(_vOSD);\n _osds.push_back(_bOSD);\n\n \/* Hotkey setup *\/\n if (_hkManager != NULL) {\n _hkManager->Shutdown();\n }\n _hkManager = HotkeyManager::Instance(Handle());\n\n _hotkeys = Settings::Instance()->Hotkeys();\n for (auto it = _hotkeys.begin(); it != _hotkeys.end(); ++it) {\n \/* Enable arg caching *\/\n it->second.EnableArgCache();\n\n int combination = it->first;\n _hkManager->Register(combination);\n }\n}\n\nvoid _3RVX::ProcessHotkeys(HotkeyInfo &hki) {\n switch (hki.action) {\n case HotkeyInfo::IncreaseVolume:\n case HotkeyInfo::DecreaseVolume:\n case HotkeyInfo::SetVolume:\n case HotkeyInfo::Mute:\n case HotkeyInfo::VolumeSlider:\n if (_vOSD) {\n _vOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::EjectDrive:\n case HotkeyInfo::EjectLastDisk:\n if (_eOSD) {\n _eOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::IncreaseBrightness:\n case HotkeyInfo::DecreaseBrightness:\n case HotkeyInfo::SetBrightness:\n if (_bOSD) {\n _bOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::MediaKey:\n case HotkeyInfo::VirtualKey:\n _kbHotkeyProcessor.ProcessHotkeys(hki);\n break;\n\n case HotkeyInfo::Run:\n if (hki.HasArgs()) {\n ShellExecute(NULL, L\"open\", hki.args[0].c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n }\n break;\n\n case HotkeyInfo::DisableOSD:\n ToggleOSDs();\n break;\n\n case HotkeyInfo::Settings:\n ShellExecute(NULL, L\"open\", Settings::SettingsApp().c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n break;\n\n case HotkeyInfo::Exit:\n SendMessage(Handle(), WM_CLOSE, NULL, NULL);\n break;\n }\n}\n\nvoid _3RVX::ToggleOSDs() {\n _eOSD->Enabled(!(_eOSD->Enabled()));\n _vOSD->Enabled(!(_vOSD->Enabled()));\n _bOSD->Enabled(!(_bOSD->Enabled()));\n}\n\nLRESULT _3RVX::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n switch (message) {\n case WM_HOTKEY: {\n CLOG(L\"Hotkey: %d\", (int) wParam);\n HotkeyInfo hki = _hotkeys[(int) wParam];\n ProcessHotkeys(hki);\n break;\n }\n\n case WM_WTSSESSION_CHANGE: {\n CLOG(L\"Detected session change\");\n break;\n }\n\n case WM_CLOSE: {\n CLOG(L\"Shutting down\");\n HotkeyManager::Instance()->Shutdown();\n _vOSD->HideIcon();\n break;\n }\n\n case WM_DESTROY: {\n PostQuitMessage(0);\n break;\n }\n\n case WM_TIMER:\n if (wParam == TIMER_FIRSTUPDATE || wParam == TIMER_UPDATE) {\n CLOG(L\"Received updater timer notification\");\n Settings *settings = Settings::Instance();\n long long checkTime = settings->LastUpdateCheck();\n if ((std::time(nullptr) - checkTime) > (UPDATE_INTERVAL \/ 1000)) {\n \/* Enough time has elapsed since the last update check *\/\n std::wstring settingsApp = Settings::SettingsApp();\n CLOG(L\"Launching update task: %s %s\",\n settingsApp.c_str(), L\"-update\");\n ShellExecute(NULL, L\"open\",\n Settings::SettingsApp().c_str(), L\"-update\", NULL, SW_HIDE);\n }\n\n if (wParam == TIMER_FIRSTUPDATE) {\n CLOG(L\"Starting long-term update timer\");\n \/* If this was the first update check (30 min after launch),\n * then kill the first update timer and start the main timer\n * (checks on 24-hour intervals) *\/\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n SetTimer(Window::Handle(), TIMER_UPDATE,\n UPDATE_INTERVAL, NULL);\n }\n }\n break;\n }\n\n if (message == _3RVX::WM_3RVX_CTRL) {\n switch (wParam) {\n case _3RVX::MSG_LOAD:\n Initialize();\n break;\n\n case _3RVX::MSG_SETTINGS:\n Settings::LaunchSettingsApp();\n break;\n\n case _3RVX::MSG_HIDEOSD:\n int except = (OSDType) lParam;\n switch (except) {\n case Volume:\n if (_eOSD) { _eOSD->Hide(); }\n if (_bOSD) { _bOSD->Hide(); }\n break;\n\n case Eject:\n if (_vOSD) { _vOSD->Hide(); }\n if (_bOSD) { _bOSD->Hide(); }\n break;\n\n case Brightness:\n if (_vOSD) { _vOSD->Hide(); }\n if (_eOSD) { _eOSD->Hide(); }\n }\n\n break;\n }\n }\n\n return Window::WndProc(hWnd, message, wParam, lParam);\n}\n<commit_msg>Refactor ToggleOSDs<commit_after>\/\/ Copyright (c) 2015, Matthew Malensek.\n\/\/ Distributed under the BSD 2-Clause License (see LICENSE.txt for details)\n\n#include \"3RVX.h\"\n\n#pragma comment(lib, \"gdiplus.lib\")\n#pragma comment(lib, \"Wtsapi32.lib\")\n\n#include <Windows.h>\n#include <ctime>\n#include <gdiplus.h>\n#include <iostream>\n#include <Wtsapi32.h>\n\n#include \"DisplayManager.h\"\n#include \"HotkeyManager.h\"\n#include \"Logger.h\"\n#include \"OSD\/BrightnessOSD.h\"\n#include \"OSD\/EjectOSD.h\"\n#include \"OSD\/VolumeOSD.h\"\n#include \"Settings.h\"\n#include \"Skin\/SkinManager.h\"\n\nint WINAPI wWinMain(_In_ HINSTANCE hInstance, _In_opt_ HINSTANCE hPrevInstance,\n _In_ LPWSTR lpCmdLine, _In_ int nShowCmd) {\n\n Logger::Start();\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n HANDLE mutex;\n mutex = CreateMutex(NULL, FALSE, L\"Local\\\\3RVX\");\n if (GetLastError() == ERROR_ALREADY_EXISTS) {\n if (mutex) {\n ReleaseMutex(mutex);\n }\n\n CLOG(L\"A previous instance of the program is already running.\\n\"\n L\"Requesting Settings dialog.\");\n _3RVX::Message(_3RVX::MSG_SETTINGS, NULL);\n\n#if defined(ENABLE_3RVX_LOG) && (defined(ENABLE_3RVX_LOGTOFILE) == FALSE)\n CLOG(L\"Press [enter] to terminate\");\n std::cin.get();\n#endif\n\n return EXIT_SUCCESS;\n }\n\n CLOG(L\"App directory: %s\", Settings::AppDir().c_str());\n\n using namespace Gdiplus;\n ULONG_PTR gdiplusToken;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n _3RVX mainWnd(hInstance);\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd.Handle(), _3RVX::WM_3RVX_CTRL, _3RVX::MSG_LOAD, NULL);\n\n \/* Register for session change notifications *\/\n WTSRegisterSessionNotification(mainWnd.Handle(), NOTIFY_FOR_THIS_SESSION);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n CoUninitialize();\n\n Logger::Stop();\n\n return (int) msg.wParam;\n}\n\n_3RVX::_3RVX(HINSTANCE hInstance) :\nWindow(_3RVX::CLASS_3RVX, _3RVX::CLASS_3RVX, hInstance) {\n}\n\nvoid _3RVX::Initialize() {\n CLOG(L\"Initializing...\");\n\n delete _vOSD;\n delete _eOSD;\n delete _bOSD;\n\n Settings *settings = Settings::Instance();\n settings->Load();\n\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n KillTimer(Window::Handle(), TIMER_UPDATE);\n if (settings->AutomaticUpdates()) {\n SetTimer(\n Window::Handle(),\n TIMER_FIRSTUPDATE,\n FIRSTUPDATE_INTERVAL,\n NULL);\n }\n\n SkinManager::Instance()->LoadSkin(settings->SkinXML());\n\n DisplayManager::UpdateMonitorMap();\n\n \/* OSDs *\/\n _eOSD = new EjectOSD();\n _vOSD = new VolumeOSD();\n _bOSD = new BrightnessOSD();\n\n _osds.clear();\n _osds.push_back(_eOSD);\n _osds.push_back(_vOSD);\n _osds.push_back(_bOSD);\n\n \/* Hotkey setup *\/\n if (_hkManager != NULL) {\n _hkManager->Shutdown();\n }\n _hkManager = HotkeyManager::Instance(Handle());\n\n _hotkeys = Settings::Instance()->Hotkeys();\n for (auto it = _hotkeys.begin(); it != _hotkeys.end(); ++it) {\n \/* Enable arg caching *\/\n it->second.EnableArgCache();\n\n int combination = it->first;\n _hkManager->Register(combination);\n }\n}\n\nvoid _3RVX::ProcessHotkeys(HotkeyInfo &hki) {\n switch (hki.action) {\n case HotkeyInfo::IncreaseVolume:\n case HotkeyInfo::DecreaseVolume:\n case HotkeyInfo::SetVolume:\n case HotkeyInfo::Mute:\n case HotkeyInfo::VolumeSlider:\n if (_vOSD) {\n _vOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::EjectDrive:\n case HotkeyInfo::EjectLastDisk:\n if (_eOSD) {\n _eOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::IncreaseBrightness:\n case HotkeyInfo::DecreaseBrightness:\n case HotkeyInfo::SetBrightness:\n if (_bOSD) {\n _bOSD->ProcessHotkeys(hki);\n }\n break;\n\n case HotkeyInfo::MediaKey:\n case HotkeyInfo::VirtualKey:\n _kbHotkeyProcessor.ProcessHotkeys(hki);\n break;\n\n case HotkeyInfo::Run:\n if (hki.HasArgs()) {\n ShellExecute(NULL, L\"open\", hki.args[0].c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n }\n break;\n\n case HotkeyInfo::DisableOSD:\n ToggleOSDs();\n break;\n\n case HotkeyInfo::Settings:\n ShellExecute(NULL, L\"open\", Settings::SettingsApp().c_str(),\n NULL, NULL, SW_SHOWNORMAL);\n break;\n\n case HotkeyInfo::Exit:\n SendMessage(Handle(), WM_CLOSE, NULL, NULL);\n break;\n }\n}\n\nvoid _3RVX::ToggleOSDs() {\n for (OSD *osd : _osds) {\n osd->Enabled(!(osd->Enabled()));\n }\n}\n\nLRESULT _3RVX::WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n switch (message) {\n case WM_HOTKEY: {\n CLOG(L\"Hotkey: %d\", (int) wParam);\n HotkeyInfo hki = _hotkeys[(int) wParam];\n ProcessHotkeys(hki);\n break;\n }\n\n case WM_WTSSESSION_CHANGE: {\n CLOG(L\"Detected session change\");\n break;\n }\n\n case WM_CLOSE: {\n CLOG(L\"Shutting down\");\n HotkeyManager::Instance()->Shutdown();\n _vOSD->HideIcon();\n break;\n }\n\n case WM_DESTROY: {\n PostQuitMessage(0);\n break;\n }\n\n case WM_TIMER:\n if (wParam == TIMER_FIRSTUPDATE || wParam == TIMER_UPDATE) {\n CLOG(L\"Received updater timer notification\");\n Settings *settings = Settings::Instance();\n long long checkTime = settings->LastUpdateCheck();\n if ((std::time(nullptr) - checkTime) > (UPDATE_INTERVAL \/ 1000)) {\n \/* Enough time has elapsed since the last update check *\/\n std::wstring settingsApp = Settings::SettingsApp();\n CLOG(L\"Launching update task: %s %s\",\n settingsApp.c_str(), L\"-update\");\n ShellExecute(NULL, L\"open\",\n Settings::SettingsApp().c_str(), L\"-update\", NULL, SW_HIDE);\n }\n\n if (wParam == TIMER_FIRSTUPDATE) {\n CLOG(L\"Starting long-term update timer\");\n \/* If this was the first update check (30 min after launch),\n * then kill the first update timer and start the main timer\n * (checks on 24-hour intervals) *\/\n KillTimer(Window::Handle(), TIMER_FIRSTUPDATE);\n SetTimer(Window::Handle(), TIMER_UPDATE,\n UPDATE_INTERVAL, NULL);\n }\n }\n break;\n }\n\n if (message == _3RVX::WM_3RVX_CTRL) {\n switch (wParam) {\n case _3RVX::MSG_LOAD:\n Initialize();\n break;\n\n case _3RVX::MSG_SETTINGS:\n Settings::LaunchSettingsApp();\n break;\n\n case _3RVX::MSG_HIDEOSD:\n int except = (OSDType) lParam;\n switch (except) {\n case Volume:\n if (_eOSD) { _eOSD->Hide(); }\n if (_bOSD) { _bOSD->Hide(); }\n break;\n\n case Eject:\n if (_vOSD) { _vOSD->Hide(); }\n if (_bOSD) { _bOSD->Hide(); }\n break;\n\n case Brightness:\n if (_vOSD) { _vOSD->Hide(); }\n if (_eOSD) { _eOSD->Hide(); }\n }\n\n break;\n }\n }\n\n return Window::WndProc(hWnd, message, wParam, lParam);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Library: CTK\n\n Copyright (c) Kitware Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.commontk.org\/LICENSE\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=========================================================================*\/\n\n\/\/ Qt includes\n#include <QAction>\n#include <QApplication>\n#include <QDebug>\n#include <QIcon>\n#include <QMenu>\n#include <QStandardItem>\n#include <QStyle>\n#include <QTimer>\n#include <QTreeView>\n\n\/\/ CTK includes\n#include \"ctkActionsWidget.h\"\n\n\/\/ STD includes\n#include <cstdlib>\n#include <iostream>\n\n\/\/-----------------------------------------------------------------------------\nint ctkActionsWidgetTest1(int argc, char* argv[])\n{\n QApplication app(argc, argv);\n\n ctkActionsWidget* actionsWidget = new ctkActionsWidget(0);\n actionsWidget->show();\n QWidget widget;\n QIcon informationIcon = actionsWidget->style()->standardIcon(QStyle::SP_MessageBoxInformation);\n\n actionsWidget->addAction(new QAction(0));\n actionsWidget->addAction(new QAction(qApp));\n actionsWidget->clear();\n actionsWidget->addAction(new QAction(\"Action Text\", qApp));\n actionsWidget->addAction(new QAction(informationIcon, \"Action Text2\", qApp));\n\n actionsWidget->addAction(new QAction(0), \"category 1\");\n actionsWidget->addAction(new QAction(qApp), \"category 1\");\n actionsWidget->addAction(new QAction(\"Action Text3\", &widget), \"category 1\");\n actionsWidget->addAction(new QAction(informationIcon, \"Action Text4\", qApp), \"category 1\");\n\n actionsWidget->addAction(new QAction(0), \"category 2\");\n actionsWidget->addAction(new QAction(qApp), \"category 3\");\n actionsWidget->addAction(new QAction(\"Action Text5\", &widget), \"category 4\");\n actionsWidget->addAction(new QAction(informationIcon, \"Action Text6\", qApp), \"category 5\");\n\n if (actionsWidget->groupItem(\"category 1\") == 0 || \n actionsWidget->groupItem(\"category 1\")->rowCount() != 4)\n {\n qDebug() << \"Invalid Category 1\";\n return EXIT_FAILURE;\n }\n\n \/\/ check shortcut\n QAction* action = new QAction(\"custom action\", 0);\n action->setShortcut(Qt::Key_F1);\n action->setToolTip(\"custom tooltip\");\n actionsWidget->addAction(action);\n QStandardItem* actionItem = actionsWidget->model()->item(7);\n if (!actionItem || actionItem->text() != \"custom action\")\n {\n qDebug() << \"Invalid custom action\" << (actionItem ? actionItem->text() : \"NaN\");\n return EXIT_FAILURE;\n }\n \/\/ check update on change \n action->setText(\"new custom action\");\n QStandardItem* changedActionItem = actionsWidget->model()->item(7);\n if (changedActionItem != actionItem ||\n changedActionItem->text() != \"new custom action\")\n {\n qDebug() << \"Invalid action update\" << changedActionItem->text();\n return EXIT_FAILURE;\n }\n widget.addAction(action);\n \n QList<QAction*> actions;\n actions << new QAction(\"group action 1\",qApp);\n actions << new QAction(\"group action 2\",qApp);\n actions << new QAction(\"group action 3\",qApp);\n actions << new QAction(\"group action 4\",qApp);\n actions << new QAction(\"group action 5\",qApp);\n actionsWidget->addActions(actions,\"category 6\");\n \n QMenu menu;\n actionsWidget->addAction(menu.addAction(\"&menu action\"), \"menu category\");\n actionsWidget->addAction(menu.addSeparator(), \"menu category\");\n actionsWidget->addAction(menu.addMenu(\"submenu action\")->menuAction(), \"menu category\");\n qDebug()<<\"filter\";\n actionsWidget->setActionsWithNoShortcutVisible(false);\n qDebug()<<\"endfilter\";\n \n QModelIndexList actionTextActions = actionsWidget->view()->model()->match(\n QModelIndex(), Qt::DisplayRole, QString(\"Action Text\"), -1,\n Qt::MatchStartsWith | Qt::MatchWrap |Qt::MatchRecursive);\n\n if (actionsWidget->areActionsWithNoShortcutVisible() != false ||\n actionTextActions.count() != 0)\n {\n qDebug() << \"ctkActionsWidget::setActionsWithNoShortcutVisible failed: actionTextActions.count()\";\n return EXIT_FAILURE;\n }\n\n actionsWidget->setActionsWithNoShortcutVisible(true);\n\n actionsWidget->setMenuActionsVisible(false);\n\n \/\/ make sure the submenu action is hidden\n QModelIndexList submenuActions = actionsWidget->view()->model()->match(\n QModelIndex(), Qt::DisplayRole, QString(\"submenu action\"), -1,\n Qt::MatchExactly | Qt::MatchWrap |Qt::MatchRecursive);\n if (actionsWidget->areMenuActionsVisible() != false ||\n submenuActions.count() != 0)\n {\n qDebug() << \"ctkActionsWidget search failed\" << submenuActions.count();\n return EXIT_FAILURE;\n }\n \n actionsWidget->setMenuActionsVisible(true);\n \n if (argc < 2 || QString(argv[1]) != \"-I\" )\n {\n QTimer::singleShot(200, &app, SLOT(quit()));\n }\n\n return app.exec();\n}\n<commit_msg>Memory leak in ctkActionsWidgetTest1<commit_after>\/*=========================================================================\n\n Library: CTK\n\n Copyright (c) Kitware Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.commontk.org\/LICENSE\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n=========================================================================*\/\n\n\/\/ Qt includes\n#include <QAction>\n#include <QApplication>\n#include <QDebug>\n#include <QIcon>\n#include <QMenu>\n#include <QStandardItem>\n#include <QStyle>\n#include <QTimer>\n#include <QTreeView>\n\n\/\/ CTK includes\n#include \"ctkActionsWidget.h\"\n\n\/\/ STD includes\n#include <cstdlib>\n#include <iostream>\n\n\/\/-----------------------------------------------------------------------------\nint ctkActionsWidgetTest1(int argc, char* argv[])\n{\n QApplication app(argc, argv);\n\n ctkActionsWidget actionsWidget(0);\n actionsWidget.show();\n\n QWidget widget;\n QIcon informationIcon = actionsWidget.style()->standardIcon(QStyle::SP_MessageBoxInformation);\n\n actionsWidget.addAction(new QAction(0));\n actionsWidget.addAction(new QAction(qApp));\n actionsWidget.clear();\n actionsWidget.addAction(new QAction(\"Action Text\", qApp));\n actionsWidget.addAction(new QAction(informationIcon, \"Action Text2\", qApp));\n\n actionsWidget.addAction(new QAction(0), \"category 1\");\n actionsWidget.addAction(new QAction(qApp), \"category 1\");\n actionsWidget.addAction(new QAction(\"Action Text3\", &widget), \"category 1\");\n actionsWidget.addAction(new QAction(informationIcon, \"Action Text4\", qApp), \"category 1\");\n\n actionsWidget.addAction(new QAction(0), \"category 2\");\n actionsWidget.addAction(new QAction(qApp), \"category 3\");\n actionsWidget.addAction(new QAction(\"Action Text5\", &widget), \"category 4\");\n actionsWidget.addAction(new QAction(informationIcon, \"Action Text6\", qApp), \"category 5\");\n\n if (actionsWidget.groupItem(\"category 1\") == 0 || \n actionsWidget.groupItem(\"category 1\")->rowCount() != 4)\n {\n qDebug() << \"Invalid Category 1\";\n return EXIT_FAILURE;\n }\n\n \/\/ check shortcut\n QAction* action = new QAction(\"custom action\", 0);\n action->setShortcut(Qt::Key_F1);\n action->setToolTip(\"custom tooltip\");\n actionsWidget.addAction(action);\n QStandardItem* actionItem = actionsWidget.model()->item(7);\n if (!actionItem || actionItem->text() != \"custom action\")\n {\n qDebug() << \"Invalid custom action\" << (actionItem ? actionItem->text() : \"NaN\");\n return EXIT_FAILURE;\n }\n \/\/ check update on change \n action->setText(\"new custom action\");\n QStandardItem* changedActionItem = actionsWidget.model()->item(7);\n if (changedActionItem != actionItem ||\n changedActionItem->text() != \"new custom action\")\n {\n qDebug() << \"Invalid action update\" << changedActionItem->text();\n return EXIT_FAILURE;\n }\n widget.addAction(action);\n \n QList<QAction*> actions;\n actions << new QAction(\"group action 1\",qApp);\n actions << new QAction(\"group action 2\",qApp);\n actions << new QAction(\"group action 3\",qApp);\n actions << new QAction(\"group action 4\",qApp);\n actions << new QAction(\"group action 5\",qApp);\n actionsWidget.addActions(actions,\"category 6\");\n \n QMenu menu;\n actionsWidget.addAction(menu.addAction(\"&menu action\"), \"menu category\");\n actionsWidget.addAction(menu.addSeparator(), \"menu category\");\n actionsWidget.addAction(menu.addMenu(\"submenu action\")->menuAction(), \"menu category\");\n\n actionsWidget.setActionsWithNoShortcutVisible(false);\n \n QModelIndexList actionTextActions = actionsWidget.view()->model()->match(\n QModelIndex(), Qt::DisplayRole, QString(\"Action Text\"), -1,\n Qt::MatchStartsWith | Qt::MatchWrap |Qt::MatchRecursive);\n\n if (actionsWidget.areActionsWithNoShortcutVisible() != false ||\n actionTextActions.count() != 0)\n {\n qDebug() << \"ctkActionsWidget::setActionsWithNoShortcutVisible failed: actionTextActions.count()\";\n return EXIT_FAILURE;\n }\n\n actionsWidget.setActionsWithNoShortcutVisible(true);\n\n actionsWidget.setMenuActionsVisible(false);\n\n \/\/ make sure the submenu action is hidden\n QModelIndexList submenuActions = actionsWidget.view()->model()->match(\n QModelIndex(), Qt::DisplayRole, QString(\"submenu action\"), -1,\n Qt::MatchExactly | Qt::MatchWrap |Qt::MatchRecursive);\n if (actionsWidget.areMenuActionsVisible() != false ||\n submenuActions.count() != 0)\n {\n qDebug() << \"ctkActionsWidget search failed\" << submenuActions.count();\n return EXIT_FAILURE;\n }\n \n actionsWidget.setMenuActionsVisible(true);\n \n if (argc < 2 || QString(argv[1]) != \"-I\" )\n {\n QTimer::singleShot(200, &app, SLOT(quit()));\n }\n\n return app.exec();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n#ifndef API_API_HH_\n#define API_API_HH_\n\n#include \"http\/httpd.hh\"\n#include \"database.hh\"\n#include <boost\/lexical_cast.hpp>\nnamespace api {\n\nstruct http_context {\n http_server_control http_server;\n distributed<database>& db;\n http_context(distributed<database>& _db) : db(_db) {}\n};\n\nfuture<> set_server(http_context& ctx);\n\ntemplate<class T>\nstd::vector<sstring> container_to_vec(const T& container) {\n std::vector<sstring> res;\n for (auto i : container) {\n res.push_back(boost::lexical_cast<sstring>(i));\n }\n return res;\n}\n\n}\n\n#endif \/* API_API_HH_ *\/\n<commit_msg>api: fix string containing space cause boost execption<commit_after>\/*\n * Copyright 2015 Cloudius Systems\n *\/\n\n#ifndef API_API_HH_\n#define API_API_HH_\n\n#include \"http\/httpd.hh\"\n#include \"database.hh\"\n#include <boost\/lexical_cast.hpp>\nnamespace api {\n\nstruct http_context {\n http_server_control http_server;\n distributed<database>& db;\n http_context(distributed<database>& _db) : db(_db) {}\n};\n\nfuture<> set_server(http_context& ctx);\n\ntemplate<class T>\nstd::vector<sstring> container_to_vec(const T& container) {\n std::vector<sstring> res;\n for (auto i : container) {\n res.push_back(boost::lexical_cast<std::string>(i));\n }\n return res;\n}\n\n}\n\n#endif \/* API_API_HH_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/*\n Print.cpp - Base class that provides print() and println()\n Copyright (c) 2008 David A. Mellis. All right reserved.\n \n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n \n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n \n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 03 August 2015 by Chuck Todd\n *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include \"Arduino.h\"\n\n#include \"Print.h\"\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/* default implementation: may be overridden *\/\nsize_t Print::write(const uint8_t *buffer, size_t size)\n{\n size_t n = 0;\n while (size--) {\n if (write(*buffer++)) n++;\n else break;\n }\n return n;\n}\n\nsize_t Print::print(const __FlashStringHelper *ifsh)\n{\n PGM_P p = reinterpret_cast<PGM_P>(ifsh);\n size_t n = 0;\n while (1) {\n unsigned char c = pgm_read_byte(p++);\n if (c == 0) break;\n if (write(c)) n++;\n else break;\n }\n return n;\n}\n\nsize_t Print::print(const String &s)\n{\n return write(s.c_str(), s.length());\n}\n\nsize_t Print::print(const char str[])\n{\n return write(str);\n}\n\nsize_t Print::print(char c)\n{\n return write(c);\n}\n\nsize_t Print::print(unsigned char b, int base)\n{\n return print((unsigned long) b, base);\n}\n\nsize_t Print::print(int n, int base)\n{\n return print((long) n, base);\n}\n\nsize_t Print::print(unsigned int n, int base)\n{\n return print((unsigned long) n, base);\n}\n\nsize_t Print::print(long n, int base)\n{\n if (base == 0) {\n return write(n);\n } else if (base == 10) {\n if (n < 0) {\n int t = print('-');\n n = -n;\n return printNumber(n, 10) + t;\n }\n return printNumber(n, 10);\n } else {\n return printNumber(n, base);\n }\n}\n\nsize_t Print::print(unsigned long n, int base)\n{\n if (base == 0) return write(n);\n else return printNumber(n, base);\n}\n\nsize_t Print::print(double n, int digits)\n{\n return printFloat(n, digits);\n}\n\nsize_t Print::println(const __FlashStringHelper *ifsh)\n{\n size_t n = print(ifsh);\n n += println();\n return n;\n}\n\nsize_t Print::print(const Printable& x)\n{\n return x.printTo(*this);\n}\n\nsize_t Print::println(void)\n{\n return write(\"\\r\\n\");\n}\n\nsize_t Print::println(const String &s)\n{\n size_t n = print(s);\n n += println();\n return n;\n}\n\nsize_t Print::println(const char c[])\n{\n size_t n = print(c);\n n += println();\n return n;\n}\n\nsize_t Print::println(char c)\n{\n size_t n = print(c);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned char b, int base)\n{\n size_t n = print(b, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(int num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned int num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(long num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned long num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(double num, int digits)\n{\n size_t n = print(num, digits);\n n += println();\n return n;\n}\n\nsize_t Print::println(const Printable& x)\n{\n size_t n = print(x);\n n += println();\n return n;\n}\n\n\/\/ Private Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsize_t Print::printNumber(unsigned long n, uint8_t base) {\n char buf[8 * sizeof(long) + 1]; \/\/ Assumes 8-bit chars plus zero byte.\n char *str = &buf[sizeof(buf) - 1];\n\n *str = '\\0';\n\n \/\/ prevent crash if called with base == 1\n if (base < 2) base = 10;\n\n do {\n unsigned long m = n;\n n \/= base;\n char c = m - base * n;\n *--str = c < 10 ? c + '0' : c + 'A' - 10;\n } while(n);\n\n return write(str);\n}\n\nsize_t Print::printFloat(double number, uint8_t digits) \n{ \n size_t n = 0;\n \n if (isnan(number)) return print(\"nan\");\n if (isinf(number)) return print(\"inf\");\n if (number > 4294967040.0) return print (\"ovf\"); \/\/ constant determined empirically\n if (number <-4294967040.0) return print (\"ovf\"); \/\/ constant determined empirically\n \n \/\/ Handle negative numbers\n if (number < 0.0)\n {\n n += print('-');\n number = -number;\n }\n\n \/\/ Round correctly so that print(1.999, 2) prints as \"2.00\"\n double rounding = 0.5;\n for (uint8_t i=0; i<digits; ++i)\n rounding \/= 10.0;\n \n number += rounding;\n\n \/\/ Extract the integer part of the number and print it\n unsigned long int_part = (unsigned long)number;\n double remainder = number - (double)int_part;\n n += print(int_part);\n\n \/\/ Print the decimal point, but only if there are digits beyond\n if (digits > 0) {\n n += print(\".\"); \n }\n\n \/\/ Extract digits from the remainder one at a time\n while (digits-- > 0)\n {\n remainder *= 10.0;\n int toPrint = int(remainder);\n n += print(toPrint);\n remainder -= toPrint; \n } \n \n return n;\n}\n<commit_msg>huh? i guess it's just 'modulo'. let's save even more<commit_after>\/*\n Print.cpp - Base class that provides print() and println()\n Copyright (c) 2008 David A. Mellis. All right reserved.\n \n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n \n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n \n You should have received a copy of the GNU Lesser General Public\n License along with this library; if not, write to the Free Software\n Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n \n Modified 23 November 2006 by David A. Mellis\n Modified 03 August 2015 by Chuck Todd\n *\/\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <string.h>\n#include <math.h>\n#include \"Arduino.h\"\n\n#include \"Print.h\"\n\n\/\/ Public Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/* default implementation: may be overridden *\/\nsize_t Print::write(const uint8_t *buffer, size_t size)\n{\n size_t n = 0;\n while (size--) {\n if (write(*buffer++)) n++;\n else break;\n }\n return n;\n}\n\nsize_t Print::print(const __FlashStringHelper *ifsh)\n{\n PGM_P p = reinterpret_cast<PGM_P>(ifsh);\n size_t n = 0;\n while (1) {\n unsigned char c = pgm_read_byte(p++);\n if (c == 0) break;\n if (write(c)) n++;\n else break;\n }\n return n;\n}\n\nsize_t Print::print(const String &s)\n{\n return write(s.c_str(), s.length());\n}\n\nsize_t Print::print(const char str[])\n{\n return write(str);\n}\n\nsize_t Print::print(char c)\n{\n return write(c);\n}\n\nsize_t Print::print(unsigned char b, int base)\n{\n return print((unsigned long) b, base);\n}\n\nsize_t Print::print(int n, int base)\n{\n return print((long) n, base);\n}\n\nsize_t Print::print(unsigned int n, int base)\n{\n return print((unsigned long) n, base);\n}\n\nsize_t Print::print(long n, int base)\n{\n if (base == 0) {\n return write(n);\n } else if (base == 10) {\n if (n < 0) {\n int t = print('-');\n n = -n;\n return printNumber(n, 10) + t;\n }\n return printNumber(n, 10);\n } else {\n return printNumber(n, base);\n }\n}\n\nsize_t Print::print(unsigned long n, int base)\n{\n if (base == 0) return write(n);\n else return printNumber(n, base);\n}\n\nsize_t Print::print(double n, int digits)\n{\n return printFloat(n, digits);\n}\n\nsize_t Print::println(const __FlashStringHelper *ifsh)\n{\n size_t n = print(ifsh);\n n += println();\n return n;\n}\n\nsize_t Print::print(const Printable& x)\n{\n return x.printTo(*this);\n}\n\nsize_t Print::println(void)\n{\n return write(\"\\r\\n\");\n}\n\nsize_t Print::println(const String &s)\n{\n size_t n = print(s);\n n += println();\n return n;\n}\n\nsize_t Print::println(const char c[])\n{\n size_t n = print(c);\n n += println();\n return n;\n}\n\nsize_t Print::println(char c)\n{\n size_t n = print(c);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned char b, int base)\n{\n size_t n = print(b, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(int num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned int num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(long num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(unsigned long num, int base)\n{\n size_t n = print(num, base);\n n += println();\n return n;\n}\n\nsize_t Print::println(double num, int digits)\n{\n size_t n = print(num, digits);\n n += println();\n return n;\n}\n\nsize_t Print::println(const Printable& x)\n{\n size_t n = print(x);\n n += println();\n return n;\n}\n\n\/\/ Private Methods \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nsize_t Print::printNumber(unsigned long n, uint8_t base)\n{\n char buf[8 * sizeof(long) + 1]; \/\/ Assumes 8-bit chars plus zero byte.\n char *str = &buf[sizeof(buf) - 1];\n\n *str = '\\0';\n\n \/\/ prevent crash if called with base == 1\n if (base < 2) base = 10;\n\n do {\n char c = n % base;\n n \/= base;\n\n *--str = c < 10 ? c + '0' : c + 'A' - 10;\n } while(n);\n\n return write(str);\n}\n\nsize_t Print::printFloat(double number, uint8_t digits) \n{ \n size_t n = 0;\n \n if (isnan(number)) return print(\"nan\");\n if (isinf(number)) return print(\"inf\");\n if (number > 4294967040.0) return print (\"ovf\"); \/\/ constant determined empirically\n if (number <-4294967040.0) return print (\"ovf\"); \/\/ constant determined empirically\n \n \/\/ Handle negative numbers\n if (number < 0.0)\n {\n n += print('-');\n number = -number;\n }\n\n \/\/ Round correctly so that print(1.999, 2) prints as \"2.00\"\n double rounding = 0.5;\n for (uint8_t i=0; i<digits; ++i)\n rounding \/= 10.0;\n \n number += rounding;\n\n \/\/ Extract the integer part of the number and print it\n unsigned long int_part = (unsigned long)number;\n double remainder = number - (double)int_part;\n n += print(int_part);\n\n \/\/ Print the decimal point, but only if there are digits beyond\n if (digits > 0) {\n n += print(\".\"); \n }\n\n \/\/ Extract digits from the remainder one at a time\n while (digits-- > 0)\n {\n remainder *= 10.0;\n int toPrint = int(remainder);\n n += print(toPrint);\n remainder -= toPrint; \n } \n \n return n;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <osg\/UnitTestFramework>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n\n#include <osg\/Matrix>\n\n\nvoid testFrustum(double left,double right,double bottom,double top,double zNear,double zFar)\n{\n osg::Matrix f;\n f.makeFrustum(left,right,bottom,top,zNear,zFar);\n\n \n double c_zNear = f(3,2) \/ (f(2,2)-1.0f);\n double c_zFar = f(3,2) \/ (1.0f+f(2,2));\n \n double c_left = c_zNear * (f(2,0)-1.0f) \/ f(0,0);\n double c_right = c_zNear * (1.0f+f(2,0)) \/ f(0,0);\n\n double c_top = c_zNear * (1+f(2,1)) \/ f(1,1);\n double c_bottom = c_zNear * (f(2,1)-1.0f) \/ f(1,1);\n \n f.getFrustum(c_left,c_right,c_bottom,c_top,c_zNear,c_zFar);\n\n std::cout << \"testFrustum\"<<std::endl;\n std::cout << \" left = \"<<left<<\" compute \"<<c_left<<std::endl;\n std::cout << \" right = \"<<right<<\" compute \"<<c_right<<std::endl;\n\n std::cout << \" bottom = \"<<bottom<<\" compute \"<<c_bottom<<std::endl;\n std::cout << \" top = \"<<top<<\" compute \"<<c_top<<std::endl;\n\n std::cout << \" zNear = \"<<zNear<<\" compute \"<<c_zNear<<std::endl;\n std::cout << \" zFar = \"<<zFar<<\" compute \"<<c_zFar<<std::endl;\n \n std::cout << std::endl;\n}\n\nvoid testOrtho(double left,double right,double bottom,double top,double zNear,double zFar)\n{\n osg::Matrix f;\n f.makeOrtho(left,right,bottom,top,zNear,zFar);\n\n double c_zNear = (f(3,2)+1.0f) \/ f(2,2);\n double c_zFar = (f(3,2)-1.0f) \/ f(2,2);\n \n double c_left = -(1.0f+f(3,0)) \/ f(0,0);\n double c_right = (1.0f-f(3,0)) \/ f(0,0);\n\n double c_bottom = -(1.0f+f(3,1)) \/ f(1,1);\n double c_top = (1.0f-f(3,1)) \/ f(1,1);\n \n f.getOrtho(c_left,c_right,c_bottom,c_top,c_zNear,c_zFar);\n\n\n std::cout << \"testOrtho\"<<std::endl;\n std::cout << \" left = \"<<left<<\" compute \"<<c_left<<std::endl;\n std::cout << \" right = \"<<right<<\" compute \"<<c_right<<std::endl;\n\n std::cout << \" bottom = \"<<bottom<<\" compute \"<<c_bottom<<std::endl;\n std::cout << \" top = \"<<top<<\" compute \"<<c_top<<std::endl;\n\n std::cout << \" zNear = \"<<zNear<<\" compute \"<<c_zNear<<std::endl;\n std::cout << \" zFar = \"<<zFar<<\" compute \"<<c_zFar<<std::endl;\n \n std::cout << std::endl;\n}\n\nvoid testLookAt(const osg::Vec3& eye,const osg::Vec3& center,const osg::Vec3& up)\n{\n osg::Matrix mv;\n mv.makeLookAt(eye,center,up);\n \n osg::Vec3 c_eye,c_center,c_up;\n mv.getLookAt(c_eye,c_center,c_up);\n \n std::cout << \"testLookAt\"<<std::endl;\n std::cout << \" eye \"<<eye<< \" compute \"<<c_eye<<std::endl;\n std::cout << \" eye \"<<center<< \" compute \"<<c_center<<std::endl;\n std::cout << \" eye \"<<up<< \" compute \"<<c_up<<std::endl;\n \n std::cout << std::endl;\n \n}\n\nint main( int argc, char** argv )\n{\n osg::ArgumentParser arguments(&argc,argv);\n\n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName()+\" is the example which runs units tests.\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName()+\" [options]\");\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n arguments.getApplicationUsage()->addCommandLineOption(\"qt\",\"Display qualified tests.\");\n arguments.getApplicationUsage()->addCommandLineOption(\"matrix\",\"Display qualified tests.\");\n \n\n if (arguments.argc()<=1)\n {\n arguments.getApplicationUsage()->write(std::cout,osg::ApplicationUsage::COMMAND_LINE_OPTION);\n return 1;\n }\n\n bool printQualifiedTest = false; \n while (arguments.read(\"qt\")) printQualifiedTest = true; \n\n bool displayMatrixTest = false; \n while (arguments.read(\"matrix\")) displayMatrixTest = true; \n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n std::cout<<arguments.getApplicationUsage()->getCommandLineUsage()<<std::endl;\n arguments.getApplicationUsage()->write(std::cout,arguments.getApplicationUsage()->getCommandLineOptions());\n return 1;\n }\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n \n\n if (displayMatrixTest)\n {\n std::cout<<\"****** Running matrix tests ******\"<<std::endl;\n\n testFrustum(-1,1,-1,1,1,1000);\n testFrustum(0,1,1,2,2.5,100000);\n\n testOrtho(0,1,1,2,2.1,1000);\n testOrtho(-1,10,1,20,2.5,100000);\n\n testLookAt(osg::Vec3(10.0,4.0,2.0),osg::Vec3(10.0,4.0,2.0)+osg::Vec3(0.0,1.0,0.0),osg::Vec3(0.0,0.0,1.0));\n testLookAt(osg::Vec3(10.0,4.0,2.0),osg::Vec3(10.0,4.0,2.0)+osg::Vec3(1.0,1.0,0.0),osg::Vec3(0.0,0.0,1.0));\n\n }\n\n\n if (printQualifiedTest) \n {\n std::cout<<\"***** Qualified Tests ******\"<<std::endl;\n\n osgUtx::QualifiedTestPrinter printer;\n osgUtx::TestGraph::instance().root()->accept( printer ); \n std::cout<<std::endl;\n }\n\n std::cout<<\"****** Running tests ******\"<<std::endl;\n\n \/\/ Global Data or Context\n osgUtx::TestContext ctx;\n osgUtx::TestRunner runner( ctx );\n runner.specify(\"root\");\n\n osgUtx::TestGraph::instance().root()->accept( runner );\n\n return 0;\n}\n<commit_msg>Added test of sizeof(types) - run osgunittests sizeof.<commit_after>#include <osg\/UnitTestFramework>\n#include <osg\/ArgumentParser>\n#include <osg\/ApplicationUsage>\n\n#include <osg\/Matrix>\n\n\nvoid testFrustum(double left,double right,double bottom,double top,double zNear,double zFar)\n{\n osg::Matrix f;\n f.makeFrustum(left,right,bottom,top,zNear,zFar);\n\n \n double c_zNear = f(3,2) \/ (f(2,2)-1.0f);\n double c_zFar = f(3,2) \/ (1.0f+f(2,2));\n \n double c_left = c_zNear * (f(2,0)-1.0f) \/ f(0,0);\n double c_right = c_zNear * (1.0f+f(2,0)) \/ f(0,0);\n\n double c_top = c_zNear * (1+f(2,1)) \/ f(1,1);\n double c_bottom = c_zNear * (f(2,1)-1.0f) \/ f(1,1);\n \n f.getFrustum(c_left,c_right,c_bottom,c_top,c_zNear,c_zFar);\n\n std::cout << \"testFrustum\"<<std::endl;\n std::cout << \" left = \"<<left<<\" compute \"<<c_left<<std::endl;\n std::cout << \" right = \"<<right<<\" compute \"<<c_right<<std::endl;\n\n std::cout << \" bottom = \"<<bottom<<\" compute \"<<c_bottom<<std::endl;\n std::cout << \" top = \"<<top<<\" compute \"<<c_top<<std::endl;\n\n std::cout << \" zNear = \"<<zNear<<\" compute \"<<c_zNear<<std::endl;\n std::cout << \" zFar = \"<<zFar<<\" compute \"<<c_zFar<<std::endl;\n \n std::cout << std::endl;\n}\n\nvoid testOrtho(double left,double right,double bottom,double top,double zNear,double zFar)\n{\n osg::Matrix f;\n f.makeOrtho(left,right,bottom,top,zNear,zFar);\n\n double c_zNear = (f(3,2)+1.0f) \/ f(2,2);\n double c_zFar = (f(3,2)-1.0f) \/ f(2,2);\n \n double c_left = -(1.0f+f(3,0)) \/ f(0,0);\n double c_right = (1.0f-f(3,0)) \/ f(0,0);\n\n double c_bottom = -(1.0f+f(3,1)) \/ f(1,1);\n double c_top = (1.0f-f(3,1)) \/ f(1,1);\n \n f.getOrtho(c_left,c_right,c_bottom,c_top,c_zNear,c_zFar);\n\n\n std::cout << \"testOrtho\"<<std::endl;\n std::cout << \" left = \"<<left<<\" compute \"<<c_left<<std::endl;\n std::cout << \" right = \"<<right<<\" compute \"<<c_right<<std::endl;\n\n std::cout << \" bottom = \"<<bottom<<\" compute \"<<c_bottom<<std::endl;\n std::cout << \" top = \"<<top<<\" compute \"<<c_top<<std::endl;\n\n std::cout << \" zNear = \"<<zNear<<\" compute \"<<c_zNear<<std::endl;\n std::cout << \" zFar = \"<<zFar<<\" compute \"<<c_zFar<<std::endl;\n \n std::cout << std::endl;\n}\n\nvoid testLookAt(const osg::Vec3& eye,const osg::Vec3& center,const osg::Vec3& up)\n{\n osg::Matrix mv;\n mv.makeLookAt(eye,center,up);\n \n osg::Vec3 c_eye,c_center,c_up;\n mv.getLookAt(c_eye,c_center,c_up);\n \n std::cout << \"testLookAt\"<<std::endl;\n std::cout << \" eye \"<<eye<< \" compute \"<<c_eye<<std::endl;\n std::cout << \" eye \"<<center<< \" compute \"<<c_center<<std::endl;\n std::cout << \" eye \"<<up<< \" compute \"<<c_up<<std::endl;\n \n std::cout << std::endl;\n \n}\n\nvoid sizeOfTest()\n{\n std::cout<<\"sizeof(bool)==\"<<sizeof(bool)<<std::endl;\n std::cout<<\"sizeof(char)==\"<<sizeof(char)<<std::endl;\n std::cout<<\"sizeof(short)==\"<<sizeof(short)<<std::endl;\n std::cout<<\"sizeof(int)==\"<<sizeof(int)<<std::endl;\n std::cout<<\"sizeof(long)==\"<<sizeof(long)<<std::endl;\n std::cout<<\"sizeof(long int)==\"<<sizeof(long int)<<std::endl;\n\n#if defined(_MSC_VER)\n \/\/ long long isn't supported on VS6.0...\n std::cout<<\"sizeof(__int64)==\"<<sizeof(__int64)<<std::endl;\n#else\n std::cout<<\"sizeof(long long)==\"<<sizeof(long long)<<std::endl;\n#endif\n std::cout<<\"sizeof(float)==\"<<sizeof(float)<<std::endl;\n std::cout<<\"sizeof(double)==\"<<sizeof(double)<<std::endl;\n}\n\nint main( int argc, char** argv )\n{\n osg::ArgumentParser arguments(&argc,argv);\n\n \/\/ set up the usage document, in case we need to print out how to use this program.\n arguments.getApplicationUsage()->setDescription(arguments.getApplicationName()+\" is the example which runs units tests.\");\n arguments.getApplicationUsage()->setCommandLineUsage(arguments.getApplicationName()+\" [options]\");\n arguments.getApplicationUsage()->addCommandLineOption(\"-h or --help\",\"Display this information\");\n arguments.getApplicationUsage()->addCommandLineOption(\"qt\",\"Display qualified tests.\");\n arguments.getApplicationUsage()->addCommandLineOption(\"sizeof\",\"Display sizeof tests.\");\n arguments.getApplicationUsage()->addCommandLineOption(\"matrix\",\"Display qualified tests.\");\n \n\n if (arguments.argc()<=1)\n {\n arguments.getApplicationUsage()->write(std::cout,osg::ApplicationUsage::COMMAND_LINE_OPTION);\n return 1;\n }\n\n bool printQualifiedTest = false; \n while (arguments.read(\"qt\")) printQualifiedTest = true; \n\n bool printMatrixTest = false; \n while (arguments.read(\"matrix\")) printMatrixTest = true; \n\n bool printSizeOfTest = false; \n while (arguments.read(\"sizeof\")) printSizeOfTest = true; \n\n \/\/ if user request help write it out to cout.\n if (arguments.read(\"-h\") || arguments.read(\"--help\"))\n {\n std::cout<<arguments.getApplicationUsage()->getCommandLineUsage()<<std::endl;\n arguments.getApplicationUsage()->write(std::cout,arguments.getApplicationUsage()->getCommandLineOptions());\n return 1;\n }\n\n \/\/ any option left unread are converted into errors to write out later.\n arguments.reportRemainingOptionsAsUnrecognized();\n\n \/\/ report any errors if they have occured when parsing the program aguments.\n if (arguments.errors())\n {\n arguments.writeErrorMessages(std::cout);\n return 1;\n }\n \n\n if (printMatrixTest)\n {\n std::cout<<\"****** Running matrix tests ******\"<<std::endl;\n\n testFrustum(-1,1,-1,1,1,1000);\n testFrustum(0,1,1,2,2.5,100000);\n\n testOrtho(0,1,1,2,2.1,1000);\n testOrtho(-1,10,1,20,2.5,100000);\n\n testLookAt(osg::Vec3(10.0,4.0,2.0),osg::Vec3(10.0,4.0,2.0)+osg::Vec3(0.0,1.0,0.0),osg::Vec3(0.0,0.0,1.0));\n testLookAt(osg::Vec3(10.0,4.0,2.0),osg::Vec3(10.0,4.0,2.0)+osg::Vec3(1.0,1.0,0.0),osg::Vec3(0.0,0.0,1.0));\n\n }\n \n if (printSizeOfTest)\n {\n std::cout<<\"**** sizeof() tests ******\"<<std::endl;\n \n sizeOfTest();\n\n std::cout<<std::endl;\n }\n\n\n if (printQualifiedTest) \n {\n std::cout<<\"***** Qualified Tests ******\"<<std::endl;\n\n osgUtx::QualifiedTestPrinter printer;\n osgUtx::TestGraph::instance().root()->accept( printer ); \n std::cout<<std::endl;\n }\n\n std::cout<<\"****** Running tests ******\"<<std::endl;\n\n \/\/ Global Data or Context\n osgUtx::TestContext ctx;\n osgUtx::TestRunner runner( ctx );\n runner.specify(\"root\");\n\n osgUtx::TestGraph::instance().root()->accept( runner );\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"testing\/testing.hpp\"\n\n#include \"indexer\/feature_data.hpp\"\n#include \"indexer\/feature_visibility.hpp\"\n#include \"indexer\/classificator.hpp\"\n#include \"indexer\/classificator_loader.hpp\"\n#include \"indexer\/scales.hpp\"\n\n#include \"base\/logging.hpp\"\n\n\nUNIT_TEST(VisibleScales_Smoke)\n{\n classificator::Load();\n\n {\n char const * arr[] = { \"place\", \"city\", \"capital\" };\n uint32_t const type = classif().GetTypeByPath(vector<string>(arr, arr + 3));\n\n pair<int, int> const r = feature::GetDrawableScaleRange(type);\n TEST_NOT_EQUAL(r.first, -1, ());\n TEST_LESS_OR_EQUAL(r.first, r.second, ());\n\n TEST(my::between_s(r.first, r.second, 10), (r));\n TEST(!my::between_s(r.first, r.second, 1), (r));\n TEST(!my::between_s(r.first, r.second, scales::GetUpperScale()), (r));\n }\n}\n\nnamespace\n{\n\nclass DoGetMaxLowMinHighZoom\n{\n pair<int, int> m_res;\n string m_low;\n\n set<uint32_t> m_skip;\n\npublic:\n DoGetMaxLowMinHighZoom(Classificator const & c) : m_res(-1, 1000)\n {\n char const * arr[][2] = {\n { \"highway\", \"proposed\" },\n { \"highway\", \"bus_stop\" },\n };\n\n for (size_t i = 0; i < ARRAY_SIZE(arr); ++i)\n m_skip.insert(c.GetTypeByPath(vector<string>(arr[i], arr[i] + 2)));\n }\n\n void operator() (ClassifObject const * p, uint32_t type)\n {\n if (m_skip.count(type) > 0)\n return;\n\n pair<int, int> const r = feature::GetDrawableScaleRange(type);\n ASSERT(r.first != -1 && r.second != -1, (r));\n\n if (m_res.first < r.first)\n {\n m_res.first = r.first;\n m_low = p->GetName();\n }\n if (m_res.second > r.second)\n m_res.second = r.second;\n }\n\n void Print()\n {\n TEST_EQUAL(m_res.second, scales::GetUpperStyleScale(), (m_res));\n LOG(LINFO, (\"Max low highway zoom:\", m_res, \"for type:\", m_low));\n }\n};\n\n}\n\nUNIT_TEST(VisibleScales_Highway)\n{\n Classificator const & c = classif();\n\n char const * arr[] = { \"highway\" };\n uint32_t const type = c.GetTypeByPath(vector<string>(arr, arr + 1));\n\n ClassifObject const * pObj = c.GetObject(type);\n\n DoGetMaxLowMinHighZoom doGet(c);\n pObj->ForEachObjectInTree(doGet, type);\n\n doGet.Print();\n}\n<commit_msg>Indexer test fix.<commit_after>#include \"testing\/testing.hpp\"\n\n#include \"indexer\/feature_data.hpp\"\n#include \"indexer\/feature_visibility.hpp\"\n#include \"indexer\/classificator.hpp\"\n#include \"indexer\/classificator_loader.hpp\"\n#include \"indexer\/scales.hpp\"\n\n#include \"base\/logging.hpp\"\n\n\nUNIT_TEST(VisibleScales_Smoke)\n{\n classificator::Load();\n\n {\n char const * arr[] = { \"place\", \"city\", \"capital\" };\n uint32_t const type = classif().GetTypeByPath(vector<string>(arr, arr + 3));\n\n pair<int, int> const r = feature::GetDrawableScaleRange(type);\n TEST_NOT_EQUAL(r.first, -1, ());\n TEST_LESS_OR_EQUAL(r.first, r.second, ());\n\n TEST(my::between_s(r.first, r.second, 10), (r));\n TEST(!my::between_s(r.first, r.second, 1), (r));\n TEST(!my::between_s(r.first, r.second, scales::GetUpperScale()), (r));\n }\n}\n\nnamespace\n{\n\nclass DoGetMaxLowMinHighZoom\n{\n pair<int, int> m_res;\n string m_low;\n\n set<uint32_t> m_skip;\n\npublic:\n DoGetMaxLowMinHighZoom(Classificator const & c) : m_res(-1, 1000)\n {\n char const * arr[][2] = {\n { \"highway\", \"proposed\" },\n { \"highway\", \"bus_stop\" },\n { \"highway\", \"world_level\" },\n { \"highway\", \"world_towns_level\" }\n };\n\n for (size_t i = 0; i < ARRAY_SIZE(arr); ++i)\n m_skip.insert(c.GetTypeByPath(vector<string>(arr[i], arr[i] + 2)));\n }\n\n void operator() (ClassifObject const * p, uint32_t type)\n {\n if (m_skip.count(type) > 0)\n return;\n\n pair<int, int> const r = feature::GetDrawableScaleRange(type);\n ASSERT(r.first != -1 && r.second != -1, (r));\n\n if (m_res.first < r.first)\n {\n m_res.first = r.first;\n m_low = p->GetName();\n }\n if (m_res.second > r.second)\n m_res.second = r.second;\n }\n\n void Print()\n {\n TEST_EQUAL(m_res.second, scales::GetUpperStyleScale(), (m_res));\n LOG(LINFO, (\"Max low highway zoom:\", m_res, \"for type:\", m_low));\n }\n};\n\n}\n\nUNIT_TEST(VisibleScales_Highway)\n{\n Classificator const & c = classif();\n\n char const * arr[] = { \"highway\" };\n uint32_t const type = c.GetTypeByPath(vector<string>(arr, arr + 1));\n\n ClassifObject const * pObj = c.GetObject(type);\n\n DoGetMaxLowMinHighZoom doGet(c);\n pObj->ForEachObjectInTree(doGet, type);\n\n doGet.Print();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"3RVX.h\"\n#include \"Controllers\\Volume\\IVolume.h\"\n#include \"Controllers\\Volume\\CoreAudio.h\"\n#include \"LayeredWnd\\LayeredWnd.h\"\n#include \"MeterWnd\\Meters\\HorizontalBar.h\"\n#include \"MeterWnd\\Meters\\HorizontalEndcap.h\"\n#include \"MeterWnd\\MeterWnd.h\"\n#include \"MeterWnd\\Meter.h\"\n#include \"VolumeOSD.h\"\n#include <Wtsapi32.h>\n#include \"Logger.h\"\n\nint APIENTRY\nwWinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance,\nLPTSTR lpCmdLine, int nCmdShow) {\n hInst = hInstance;\n\n using namespace Gdiplus;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n Logger::OpenConsole();\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n mainWnd = CreateMainWnd(hInstance);\n if (mainWnd == NULL) {\n CLOG(L\"Could not create main window\");\n return EXIT_FAILURE;\n }\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd, WM_3RVX_CONTROL, MSG_LOAD, NULL);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n return (int)msg.wParam;\n}\n\nvoid Init() {\n CLOG(L\"Starting initialization.\");\n ca = new CoreAudio(mainWnd);\n ca->Init();\n float v = ca->Volume();\n\n Meter *m = new HorizontalEndcap(L\"meter.png\", 71, 29, 28);\n mW = new MeterWnd(hInst, L\"testtest\", L\"what what\");\n mW->AddMeter(m);\n std::wstring bgbmp(L\"bg.png\");\n mW->SetBackgroundImage(Gdiplus::Bitmap::FromFile(bgbmp.c_str(), true));\n mW->MeterLevels(v);\n mW->Update();\n mW->Show();\n\n VolumeOSD *vosd = new VolumeOSD(hInst);\n vosd->LoadSkin();\n\n WTSRegisterSessionNotification(mainWnd, NOTIFY_FOR_THIS_SESSION);\n\n HotkeyManager *hkManager = HotkeyManager::Instance();\n hkManager->Register(mainWnd, HKM_MOD_WIN + VK_BACK);\n hkManager->Register(mainWnd, HKM_MOD_WIN + HKM_MOUSE_WHUP);\n}\n\nHWND CreateMainWnd(HINSTANCE hInstance) {\n WNDCLASSEX wcex;\n\n wcex.cbSize = sizeof(WNDCLASSEX);\n wcex.style = NULL;\n wcex.lpfnWndProc = WndProc;\n wcex.cbClsExtra = NULL;\n wcex.cbWndExtra = NULL;\n wcex.hInstance = hInstance;\n wcex.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n wcex.hbrBackground = (HBRUSH)(COLOR_WINDOW + 1);\n wcex.lpszMenuName = NULL;\n wcex.lpszClassName = L\"3RVX\";\n wcex.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\n\n if (!RegisterClassEx(&wcex)) {\n return NULL;\n }\n\n HWND hWnd = CreateWindowEx(\n NULL,\n L\"3RVX\", L\"3RVX\",\n NULL, NULL, NULL, \/\/your boat, gently down the stream\n NULL, NULL, HWND_MESSAGE, NULL, hInstance, NULL);\n\n return hWnd;\n}\n\nLRESULT CALLBACK WndProc(\n HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n\n if (message == MSG_VOLCHNG) {\n float v = ca->Volume();\n QCLOG(L\"Volume level: %.0f\", v * 100.0f);\n mW->MeterLevels(v);\n mW->Update();\n }\n\n if (message == MSG_DEVCHNG) {\n printf(\"Device change detected.\\n\");\n ca->ReattachDefaultDevice();\n }\n\n if (message == WM_3RVX_CONTROL) {\n switch (wParam) {\n case MSG_LOAD:\n Init();\n break;\n\n case 101:\n printf(\"%x\\n\", lParam);\n break;\n }\n }\n\n if (message == WM_HOTKEY) {\n printf(\"Hotkey: %d\\n\", (int) wParam);\n }\n\n if (message == WM_WTSSESSION_CHANGE) {\n printf(\"session change\\n\");\n }\n\n return DefWindowProc(hWnd, message, wParam, lParam);\n}<commit_msg>Only open console in debug mode<commit_after>#include \"3RVX.h\"\n#include \"Controllers\\Volume\\IVolume.h\"\n#include \"Controllers\\Volume\\CoreAudio.h\"\n#include \"LayeredWnd\\LayeredWnd.h\"\n#include \"MeterWnd\\Meters\\HorizontalBar.h\"\n#include \"MeterWnd\\Meters\\HorizontalEndcap.h\"\n#include \"MeterWnd\\MeterWnd.h\"\n#include \"MeterWnd\\Meter.h\"\n#include \"VolumeOSD.h\"\n#include <Wtsapi32.h>\n#include \"Logger.h\"\n\nint APIENTRY\nwWinMain(HINSTANCE hInstance, HINSTANCE hPrevInstance,\nLPTSTR lpCmdLine, int nCmdShow) {\n hInst = hInstance;\n\n using namespace Gdiplus;\n GdiplusStartupInput gdiplusStartupInput;\n GdiplusStartup(&gdiplusToken, &gdiplusStartupInput, NULL);\n\n#ifdef _DEBUG\n Logger::OpenConsole();\n#endif\n\n QCLOG(L\" _____ ______ ____ _______ \");\n QCLOG(L\" |___ \/| _ \\\\ \\\\ \/ \/\\\\ \\\\\/ \/___ \/ \");\n QCLOG(L\" |_ \\\\| |_) \\\\ \\\\ \/ \/ \\\\ \/ |_ \\\\ \");\n QCLOG(L\" ___) | _ < \\\\ V \/ \/ \\\\ ___) |\");\n QCLOG(L\" |____\/|_| \\\\_\\\\ \\\\_\/ \/_\/\\\\_\\\\____\/ \");\n QCLOG(L\"\");\n\n QCLOG(L\"Starting up...\");\n\n mainWnd = CreateMainWnd(hInstance);\n if (mainWnd == NULL) {\n CLOG(L\"Could not create main window\");\n return EXIT_FAILURE;\n }\n\n HRESULT hr = CoInitializeEx(NULL,\n COINIT_APARTMENTTHREADED | COINIT_DISABLE_OLE1DDE);\n if (hr != S_OK) {\n CLOG(L\"Failed to initialize the COM library.\");\n return EXIT_FAILURE;\n }\n\n \/* Tell the program to initialize *\/\n PostMessage(mainWnd, WM_3RVX_CONTROL, MSG_LOAD, NULL);\n\n \/* Start the event loop *\/\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0)) {\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n GdiplusShutdown(gdiplusToken);\n return (int)msg.wParam;\n}\n\nvoid Init() {\n CLOG(L\"Starting initialization.\");\n ca = new CoreAudio(mainWnd);\n ca->Init();\n float v = ca->Volume();\n\n Meter *m = new HorizontalEndcap(L\"meter.png\", 71, 29, 28);\n mW = new MeterWnd(hInst, L\"testtest\", L\"what what\");\n mW->AddMeter(m);\n std::wstring bgbmp(L\"bg.png\");\n mW->SetBackgroundImage(Gdiplus::Bitmap::FromFile(bgbmp.c_str(), true));\n mW->MeterLevels(v);\n mW->Update();\n mW->Show();\n\n VolumeOSD *vosd = new VolumeOSD(hInst);\n vosd->LoadSkin();\n\n WTSRegisterSessionNotification(mainWnd, NOTIFY_FOR_THIS_SESSION);\n\n HotkeyManager *hkManager = HotkeyManager::Instance();\n hkManager->Register(mainWnd, HKM_MOD_WIN + VK_BACK);\n hkManager->Register(mainWnd, HKM_MOD_WIN + HKM_MOUSE_WHUP);\n}\n\nHWND CreateMainWnd(HINSTANCE hInstance) {\n WNDCLASSEX wcex;\n\n wcex.cbSize = sizeof(WNDCLASSEX);\n wcex.style = NULL;\n wcex.lpfnWndProc = WndProc;\n wcex.cbClsExtra = NULL;\n wcex.cbWndExtra = NULL;\n wcex.hInstance = hInstance;\n wcex.hIcon = LoadIcon(NULL, IDI_APPLICATION);\n wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n wcex.hbrBackground = (HBRUSH)(COLOR_WINDOW + 1);\n wcex.lpszMenuName = NULL;\n wcex.lpszClassName = L\"3RVX\";\n wcex.hIconSm = LoadIcon(NULL, IDI_APPLICATION);\n\n if (!RegisterClassEx(&wcex)) {\n return NULL;\n }\n\n HWND hWnd = CreateWindowEx(\n NULL,\n L\"3RVX\", L\"3RVX\",\n NULL, NULL, NULL, \/\/your boat, gently down the stream\n NULL, NULL, HWND_MESSAGE, NULL, hInstance, NULL);\n\n return hWnd;\n}\n\nLRESULT CALLBACK WndProc(\n HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam) {\n\n if (message == MSG_VOLCHNG) {\n float v = ca->Volume();\n QCLOG(L\"Volume level: %.0f\", v * 100.0f);\n mW->MeterLevels(v);\n mW->Update();\n }\n\n if (message == MSG_DEVCHNG) {\n printf(\"Device change detected.\\n\");\n ca->ReattachDefaultDevice();\n }\n\n if (message == WM_3RVX_CONTROL) {\n switch (wParam) {\n case MSG_LOAD:\n Init();\n break;\n\n case 101:\n printf(\"%x\\n\", lParam);\n break;\n }\n }\n\n if (message == WM_HOTKEY) {\n printf(\"Hotkey: %d\\n\", (int) wParam);\n }\n\n if (message == WM_WTSSESSION_CHANGE) {\n printf(\"session change\\n\");\n }\n\n return DefWindowProc(hWnd, message, wParam, lParam);\n}<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n#include <stdio.h>\n#include <float.h>\n\n#include \"cache.h\"\n#include \"io.h\"\n#include \"parse_regressor.h\"\n#include \"parser.h\"\n#include \"parse_args.h\"\n#include \"sender.h\"\n#include \"network.h\"\n#include \"global_data.h\"\n\nconst float default_decay = 1.;\n\npo::variables_map parse_args(int argc, char *argv[], boost::program_options::options_description& desc,\n\t\t\t gd_vars& vars,\n\t\t\t regressor &r, parser* par,\n\t\t\t string& final_regressor_name)\n{\n vars.init();\n global.program_name = argv[0];\n \/\/ Declare the supported options.\n desc.add_options()\n (\"active_learning\", \"active learning mode\")\n (\"active_simulation\", \"active learning simulation mode\")\n (\"active_mellowness\", po::value<float>(&global.active_c0)->default_value(8.f), \"active learning mellowness parameter c_0. Default 8\")\n (\"adaptive\", \"use adaptive, individual learning rates.\")\n (\"audit,a\", \"print weights of features\")\n (\"bit_precision,b\", po::value<size_t>(), \n \"number of bits in the feature table\")\n (\"backprop\", \"turn on delayed backprop\")\n (\"cache,c\", \"Use a cache. The default is <data>.cache\")\n (\"cache_file\", po::value< vector<string> >(), \"The location(s) of cache_file.\")\n (\"compressed\", \"use gzip format whenever appropriate. If a cache file is being created, this option creates a compressed cache file. A mixture of raw-text & compressed inputs are supported if this option is on\")\n (\"conjugate_gradient\", \"use conjugate gradient based optimization\")\n (\"regularization\", po::value<float>(&global.regularization)->default_value(0.), \"minimize weight magnitude\")\n (\"corrective\", \"turn on corrective updates\")\n (\"data,d\", po::value< string >()->default_value(\"\"), \"Example Set\")\n (\"daemon\", \"read data from port 39523\")\n (\"decay_learning_rate\", po::value<float>(&global.eta_decay_rate)->default_value(default_decay), \n \"Set Decay factor for learning_rate between passes\")\n (\"final_regressor,f\", po::value< string >(), \"Final regressor\")\n (\"global_multiplier\", po::value<float>(&global.global_multiplier)->default_value(1.0), \"Global update multiplier\")\n (\"delayed_global\", \"Do delayed global updates\")\n (\"hash\", po::value< string > (), \"how to hash the features. Available options: strings, all\")\n (\"help,h\",\"Output Arguments\")\n (\"version\",\"Version information\")\n (\"initial_weight\", po::value<float>(&global.initial_weight)->default_value(0.), \"Set all weights to an initial value of 1.\")\n (\"initial_regressor,i\", po::value< vector<string> >(), \"Initial regressor(s)\")\n (\"initial_t\", po::value<float>(&(par->t))->default_value(1.), \"initial t value\")\n (\"min_prediction\", po::value<double>(&global.min_label), \"Smallest prediction to output\")\n (\"max_prediction\", po::value<double>(&global.max_label), \"Largest prediction to output\")\n (\"multisource\", po::value<size_t>(), \"multiple sources for daemon input\")\n (\"noop\",\"do no learning\")\n (\"port\", po::value<size_t>(),\"port to listen on\")\n (\"power_t\", po::value<float>(&vars.power_t)->default_value(0.5), \"t power value\")\n (\"predictto\", po::value< string > (), \"host to send predictions to\")\n (\"learning_rate,l\", po::value<float>(&global.eta)->default_value(10), \n \"Set Learning Rate\")\n (\"passes\", po::value<size_t>(&global.numpasses)->default_value(1), \n \"Number of Training Passes\")\n (\"predictions,p\", po::value< string >(), \"File to output predictions to\")\n (\"quadratic,q\", po::value< vector<string> > (),\n \"Create and use quadratic features\")\n (\"quiet\", \"Don't output diagnostics\")\n (\"raw_predictions,r\", po::value< string >(), \n \"File to output unnormalized predictions to\")\n (\"sendto\", po::value< vector<string> >(), \"send example to <hosts>\")\n (\"testonly,t\", \"Ignore label information and just test\")\n (\"thread_bits\", po::value<size_t>(&global.thread_bits)->default_value(0), \"log_2 threads\")\n (\"loss_function\", po::value<string>()->default_value(\"squared\"), \"Specify the loss function to be used, uses squared by default. Currently available ones are squared, hinge, logistic and quantile.\")\n (\"quantile_tau\", po::value<double>()->default_value(0.5), \"Parameter \\\\tau associated with Quantile loss. Defaults to 0.5\")\n (\"unique_id\", po::value<size_t>(&global.unique_id)->default_value(0),\"unique id used for cluster parallel\")\n (\"sort_features\", \"turn this on to disregard order in which features have been defined. This will lead to smaller cache sizes\")\n (\"ngram\", po::value<size_t>(), \"Generate N grams\")\n (\"skips\", po::value<size_t>(), \"Generate skips in N grams. This in conjunction with the ngram tag can be used to generate generalized n-skip-k-gram.\");\n\n\n global.queries = 0;\n global.example_number = 0;\n global.weighted_examples = 0.;\n global.old_weighted_examples = 0.;\n global.backprop = false;\n global.corrective = false;\n global.delayed_global = false;\n global.conjugate_gradient = false;\n global.stride = 1;\n global.weighted_labels = 0.;\n global.total_features = 0;\n global.sum_loss = 0.0;\n global.sum_loss_since_last_dump = 0.0;\n global.dump_interval = exp(1.);\n global.num_bits = 18;\n global.default_bits = true;\n global.final_prediction_sink.begin = global.final_prediction_sink.end=global.final_prediction_sink.end_array = NULL;\n global.raw_prediction = -1;\n global.local_prediction = -1;\n global.print = print_result;\n global.min_label = 0.;\n global.max_label = 1.;\n \n global.adaptive = false;\n global.audit = false;\n global.active = false;\n global.active_simulation =false;\n global.reg = &r;\n \n\n po::positional_options_description p;\n \n po::variables_map vm;\n\n po::store(po::command_line_parser(argc, argv).\n\t options(desc).positional(p).run(), vm);\n po::notify(vm);\n\n global.weighted_unlabeled_examples = par->t;\n global.initial_t = par->t;\n global.partition_bits = global.thread_bits;\n \n if (vm.count(\"help\") || argc == 1) {\n \/* upon direct query for help -- spit it out to stdout *\/\n cout << \"\\n\" << desc << \"\\n\";\n exit(0);\n }\n \n if (vm.count(\"active_simulation\")) \n global.active_simulation = true;\n \n if (vm.count(\"active_learning\") && !global.active_simulation)\n global.active = true;\n\n if (vm.count(\"adaptive\")) {\n global.adaptive = true;\n global.stride = 2;\n vars.power_t = 0.0;\n }\n\n if (vm.count(\"backprop\")) {\n global.backprop = true;\n cout << \"enabling backprop updates\" << endl;\n }\n\n if (vm.count(\"corrective\")) {\n global.corrective = true;\n cout << \"enabling corrective updates\" << endl;\n }\n\n if (vm.count(\"delayed_global\")) {\n global.delayed_global = true;\n cout << \"enabling delayed_global updates\" << endl;\n }\n \n if (vm.count(\"conjugate_gradient\")) {\n global.conjugate_gradient = true;\n global.stride = 4;\n cout << \"enabling conjugate gradient based optimization\" << endl;\n }\n\n if (vm.count(\"version\") || argc == 1) {\n \/* upon direct query for version -- spit it out to stdout *\/\n cout << version << \"\\n\";\n exit(0);\n }\n\n \n if(vm.count(\"ngram\")){\n global.ngram = vm[\"ngram\"].as<size_t>();\n if(!vm.count(\"skip_gram\")) cout << \"You have chosen to generate \" << global.ngram << \"-grams\" << endl;\n }\n if(vm.count(\"skips\"))\n {\n global.skips = vm[\"skips\"].as<size_t>();\n if(!vm.count(\"ngram\")) \n {\n\tcout << \"You can not skip unless ngram is > 1\" << endl;\n\texit(1);\n }\n cout << \"You have chosen to generate \" << global.skips << \"-skip-\" << global.ngram << \"-grams\" << endl;\n if(global.skips > 4)\n {\n cout << \"*********************************\" << endl;\n cout << \"Generating these features might take quite some time\" << endl;\n cout << \"*********************************\" << endl;\n }\n }\n if (vm.count(\"bit_precision\"))\n {\n global.default_bits = false;\n global.num_bits = vm[\"bit_precision\"].as< size_t>();\n }\n\n if(vm.count(\"compressed\")){\n set_compressed(par);\n }\n\n if(vm.count(\"sort_features\"))\n par->sort_features = true;\n\n if (global.num_bits > 30) {\n cerr << \"The system limits at 30 bits of precision!\\n\" << endl;\n exit(1);\n }\n if (vm.count(\"quiet\"))\n global.quiet = true;\n else\n global.quiet = false;\n\n if (vm.count(\"quadratic\")) \n {\n global.pairs = vm[\"quadratic\"].as< vector<string> >();\n if (!global.quiet)\n\t{\n\t cerr << \"creating quadratic features for pairs: \";\n\t for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n\t cerr << *i << \" \";\n\t if (i->length() > 2)\n\t cerr << endl << \"warning, ignoring characters after the 2nd.\\n\";\n\t if (i->length() < 2) {\n\t cerr << endl << \"error, quadratic features must involve two sets.\\n\";\n\t exit(0);\n\t }\n\t }\n\t cerr << endl;\n\t}\n }\n\n parse_regressor_args(vm, r, final_regressor_name, global.quiet);\n\n if (vm.count(\"active_c0\"))\n global.active_c0 = vm[\"active_c0\"].as<float>();\n\n if (vm.count(\"min_prediction\"))\n global.min_label = vm[\"min_prediction\"].as<double>();\n if (vm.count(\"max_prediction\"))\n global.max_label = vm[\"max_prediction\"].as<double>();\n if (vm.count(\"min_prediction\") || vm.count(\"max_prediction\") || vm.count(\"testonly\"))\n set_minmax = noop_mm;\n\n string loss_function;\n if(vm.count(\"loss_function\")) \n\t loss_function = vm[\"loss_function\"].as<string>();\n else\n\t loss_function = \"squaredloss\";\n\n double loss_parameter = 0.0;\n if(vm.count(\"quantile_tau\"))\n loss_parameter = vm[\"quantile_tau\"].as<double>();\n r.loss = getLossFunction(loss_function, loss_parameter);\n global.loss = r.loss;\n\n global.eta *= pow(par->t, vars.power_t);\n \n if (global.eta_decay_rate != default_decay && global.numpasses == 1)\n cerr << \"Warning: decay_learning_rate has no effect when there is only one pass\" << endl;\n\n if (pow(global.eta_decay_rate, global.numpasses) < 0.0001 )\n cerr << \"Warning: the learning rate for the last pass is multiplied by: \" << pow(global.eta_decay_rate, global.numpasses) \n\t << \" adjust to --decay_learning_rate larger to avoid this.\" << endl;\n \n parse_source_args(vm,par,global.quiet,global.numpasses);\n\n\n if (!global.quiet)\n {\n cerr << \"Num weight bits = \" << global.num_bits << endl;\n cerr << \"learning rate = \" << global.eta << endl;\n cerr << \"initial_t = \" << par->t << endl;\n cerr << \"power_t = \" << vars.power_t << endl;\n if (global.numpasses > 1)\n\tcerr << \"decay_learning_rate = \" << global.eta_decay_rate << endl;\n }\n \n if (vm.count(\"predictions\")) {\n if (!global.quiet)\n cerr << \"predictions = \" << vm[\"predictions\"].as< string >() << endl;\n if (strcmp(vm[\"predictions\"].as< string >().c_str(), \"stdout\") == 0)\n {\n\tint_pair pf = {1,0};\n\tpush(global.final_prediction_sink,pf);\/\/stdout\n }\n else \n {\n\tconst char* fstr = (vm[\"predictions\"].as< string >().c_str());\n\tint_pair pf = {fileno(fopen(fstr,\"w\")),0};\n\tif (pf.fd < 0)\n\t cerr << \"Error opening the predictions file: \" << fstr << endl;\n\tpush(global.final_prediction_sink,pf);\n }\n }\n \n if (vm.count(\"raw_predictions\")) {\n if (!global.quiet)\n cerr << \"raw predictions = \" << vm[\"raw_predictions\"].as< string >() << endl;\n if (strcmp(vm[\"raw_predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.raw_prediction = 1;\/\/stdout\n else\n global.raw_prediction = fileno(fopen(vm[\"raw_predictions\"].as< string >().c_str(), \"w\"));\n }\n\n if (vm.count(\"audit\"))\n global.audit = true;\n\n parse_send_args(vm, global.pairs);\n\n if (vm.count(\"testonly\"))\n {\n if (!global.quiet)\n\tcerr << \"only testing\" << endl;\n global.training = false;\n }\n else \n {\n global.training = true;\n if (!global.quiet)\n\tcerr << \"learning_rate set to \" << global.eta << endl;\n }\n\n if (vm.count(\"predictto\"))\n {\n if (!global.quiet)\n\tcerr << \"predictto = \" << vm[\"predictto\"].as< string >() << endl;\n global.local_prediction = open_socket(vm[\"predictto\"].as< string > ().c_str(), global.unique_id);\n }\n\n return vm;\n}\n\n<commit_msg>- Make vw friendlier: if -d is left-out, treat positional parameter as data-file rather than throwing a cryptic program_options exception.<commit_after>\/*\nCopyright (c) 2009 Yahoo! Inc. All rights reserved. The copyrights\nembodied in the content of this file are licensed under the BSD\n(revised) open source license\n *\/\n#include <stdio.h>\n#include <float.h>\n\n#include \"cache.h\"\n#include \"io.h\"\n#include \"parse_regressor.h\"\n#include \"parser.h\"\n#include \"parse_args.h\"\n#include \"sender.h\"\n#include \"network.h\"\n#include \"global_data.h\"\n\nconst float default_decay = 1.;\n\npo::variables_map parse_args(int argc, char *argv[], boost::program_options::options_description& desc,\n\t\t\t gd_vars& vars,\n\t\t\t regressor &r, parser* par,\n\t\t\t string& final_regressor_name)\n{\n vars.init();\n global.program_name = argv[0];\n \/\/ Declare the supported options.\n desc.add_options()\n (\"active_learning\", \"active learning mode\")\n (\"active_simulation\", \"active learning simulation mode\")\n (\"active_mellowness\", po::value<float>(&global.active_c0)->default_value(8.f), \"active learning mellowness parameter c_0. Default 8\")\n (\"adaptive\", \"use adaptive, individual learning rates.\")\n (\"audit,a\", \"print weights of features\")\n (\"bit_precision,b\", po::value<size_t>(), \n \"number of bits in the feature table\")\n (\"backprop\", \"turn on delayed backprop\")\n (\"cache,c\", \"Use a cache. The default is <data>.cache\")\n (\"cache_file\", po::value< vector<string> >(), \"The location(s) of cache_file.\")\n (\"compressed\", \"use gzip format whenever appropriate. If a cache file is being created, this option creates a compressed cache file. A mixture of raw-text & compressed inputs are supported if this option is on\")\n (\"conjugate_gradient\", \"use conjugate gradient based optimization\")\n (\"regularization\", po::value<float>(&global.regularization)->default_value(0.), \"minimize weight magnitude\")\n (\"corrective\", \"turn on corrective updates\")\n (\"data,d\", po::value< string >()->default_value(\"\"), \"Example Set\")\n (\"daemon\", \"read data from port 39523\")\n (\"decay_learning_rate\", po::value<float>(&global.eta_decay_rate)->default_value(default_decay), \n \"Set Decay factor for learning_rate between passes\")\n (\"final_regressor,f\", po::value< string >(), \"Final regressor\")\n (\"global_multiplier\", po::value<float>(&global.global_multiplier)->default_value(1.0), \"Global update multiplier\")\n (\"delayed_global\", \"Do delayed global updates\")\n (\"hash\", po::value< string > (), \"how to hash the features. Available options: strings, all\")\n (\"help,h\",\"Output Arguments\")\n (\"version\",\"Version information\")\n (\"initial_weight\", po::value<float>(&global.initial_weight)->default_value(0.), \"Set all weights to an initial value of 1.\")\n (\"initial_regressor,i\", po::value< vector<string> >(), \"Initial regressor(s)\")\n (\"initial_t\", po::value<float>(&(par->t))->default_value(1.), \"initial t value\")\n (\"min_prediction\", po::value<double>(&global.min_label), \"Smallest prediction to output\")\n (\"max_prediction\", po::value<double>(&global.max_label), \"Largest prediction to output\")\n (\"multisource\", po::value<size_t>(), \"multiple sources for daemon input\")\n (\"noop\",\"do no learning\")\n (\"port\", po::value<size_t>(),\"port to listen on\")\n (\"power_t\", po::value<float>(&vars.power_t)->default_value(0.5), \"t power value\")\n (\"predictto\", po::value< string > (), \"host to send predictions to\")\n (\"learning_rate,l\", po::value<float>(&global.eta)->default_value(10), \n \"Set Learning Rate\")\n (\"passes\", po::value<size_t>(&global.numpasses)->default_value(1), \n \"Number of Training Passes\")\n (\"predictions,p\", po::value< string >(), \"File to output predictions to\")\n (\"quadratic,q\", po::value< vector<string> > (),\n \"Create and use quadratic features\")\n (\"quiet\", \"Don't output diagnostics\")\n (\"raw_predictions,r\", po::value< string >(), \n \"File to output unnormalized predictions to\")\n (\"sendto\", po::value< vector<string> >(), \"send example to <hosts>\")\n (\"testonly,t\", \"Ignore label information and just test\")\n (\"thread_bits\", po::value<size_t>(&global.thread_bits)->default_value(0), \"log_2 threads\")\n (\"loss_function\", po::value<string>()->default_value(\"squared\"), \"Specify the loss function to be used, uses squared by default. Currently available ones are squared, hinge, logistic and quantile.\")\n (\"quantile_tau\", po::value<double>()->default_value(0.5), \"Parameter \\\\tau associated with Quantile loss. Defaults to 0.5\")\n (\"unique_id\", po::value<size_t>(&global.unique_id)->default_value(0),\"unique id used for cluster parallel\")\n (\"sort_features\", \"turn this on to disregard order in which features have been defined. This will lead to smaller cache sizes\")\n (\"ngram\", po::value<size_t>(), \"Generate N grams\")\n (\"skips\", po::value<size_t>(), \"Generate skips in N grams. This in conjunction with the ngram tag can be used to generate generalized n-skip-k-gram.\");\n\n\n global.queries = 0;\n global.example_number = 0;\n global.weighted_examples = 0.;\n global.old_weighted_examples = 0.;\n global.backprop = false;\n global.corrective = false;\n global.delayed_global = false;\n global.conjugate_gradient = false;\n global.stride = 1;\n global.weighted_labels = 0.;\n global.total_features = 0;\n global.sum_loss = 0.0;\n global.sum_loss_since_last_dump = 0.0;\n global.dump_interval = exp(1.);\n global.num_bits = 18;\n global.default_bits = true;\n global.final_prediction_sink.begin = global.final_prediction_sink.end=global.final_prediction_sink.end_array = NULL;\n global.raw_prediction = -1;\n global.local_prediction = -1;\n global.print = print_result;\n global.min_label = 0.;\n global.max_label = 1.;\n \n global.adaptive = false;\n global.audit = false;\n global.active = false;\n global.active_simulation =false;\n global.reg = &r;\n \n\n po::positional_options_description p;\n \/\/ Be friendly: if -d was left out, treat positional param as data file\n p.add(\"data\", -1);\n \n po::variables_map vm;\n\n po::store(po::command_line_parser(argc, argv).\n\t options(desc).positional(p).run(), vm);\n po::notify(vm);\n\n global.weighted_unlabeled_examples = par->t;\n global.initial_t = par->t;\n global.partition_bits = global.thread_bits;\n \n if (vm.count(\"help\") || argc == 1) {\n \/* upon direct query for help -- spit it out to stdout *\/\n cout << \"\\n\" << desc << \"\\n\";\n exit(0);\n }\n \n if (vm.count(\"active_simulation\")) \n global.active_simulation = true;\n \n if (vm.count(\"active_learning\") && !global.active_simulation)\n global.active = true;\n\n if (vm.count(\"adaptive\")) {\n global.adaptive = true;\n global.stride = 2;\n vars.power_t = 0.0;\n }\n\n if (vm.count(\"backprop\")) {\n global.backprop = true;\n cout << \"enabling backprop updates\" << endl;\n }\n\n if (vm.count(\"corrective\")) {\n global.corrective = true;\n cout << \"enabling corrective updates\" << endl;\n }\n\n if (vm.count(\"delayed_global\")) {\n global.delayed_global = true;\n cout << \"enabling delayed_global updates\" << endl;\n }\n \n if (vm.count(\"conjugate_gradient\")) {\n global.conjugate_gradient = true;\n global.stride = 4;\n cout << \"enabling conjugate gradient based optimization\" << endl;\n }\n\n if (vm.count(\"version\") || argc == 1) {\n \/* upon direct query for version -- spit it out to stdout *\/\n cout << version << \"\\n\";\n exit(0);\n }\n\n \n if(vm.count(\"ngram\")){\n global.ngram = vm[\"ngram\"].as<size_t>();\n if(!vm.count(\"skip_gram\")) cout << \"You have chosen to generate \" << global.ngram << \"-grams\" << endl;\n }\n if(vm.count(\"skips\"))\n {\n global.skips = vm[\"skips\"].as<size_t>();\n if(!vm.count(\"ngram\")) \n {\n\tcout << \"You can not skip unless ngram is > 1\" << endl;\n\texit(1);\n }\n cout << \"You have chosen to generate \" << global.skips << \"-skip-\" << global.ngram << \"-grams\" << endl;\n if(global.skips > 4)\n {\n cout << \"*********************************\" << endl;\n cout << \"Generating these features might take quite some time\" << endl;\n cout << \"*********************************\" << endl;\n }\n }\n if (vm.count(\"bit_precision\"))\n {\n global.default_bits = false;\n global.num_bits = vm[\"bit_precision\"].as< size_t>();\n }\n\n if(vm.count(\"compressed\")){\n set_compressed(par);\n }\n\n if(vm.count(\"sort_features\"))\n par->sort_features = true;\n\n if (global.num_bits > 30) {\n cerr << \"The system limits at 30 bits of precision!\\n\" << endl;\n exit(1);\n }\n if (vm.count(\"quiet\"))\n global.quiet = true;\n else\n global.quiet = false;\n\n if (vm.count(\"quadratic\")) \n {\n global.pairs = vm[\"quadratic\"].as< vector<string> >();\n if (!global.quiet)\n\t{\n\t cerr << \"creating quadratic features for pairs: \";\n\t for (vector<string>::iterator i = global.pairs.begin(); i != global.pairs.end();i++) {\n\t cerr << *i << \" \";\n\t if (i->length() > 2)\n\t cerr << endl << \"warning, ignoring characters after the 2nd.\\n\";\n\t if (i->length() < 2) {\n\t cerr << endl << \"error, quadratic features must involve two sets.\\n\";\n\t exit(0);\n\t }\n\t }\n\t cerr << endl;\n\t}\n }\n\n parse_regressor_args(vm, r, final_regressor_name, global.quiet);\n\n if (vm.count(\"active_c0\"))\n global.active_c0 = vm[\"active_c0\"].as<float>();\n\n if (vm.count(\"min_prediction\"))\n global.min_label = vm[\"min_prediction\"].as<double>();\n if (vm.count(\"max_prediction\"))\n global.max_label = vm[\"max_prediction\"].as<double>();\n if (vm.count(\"min_prediction\") || vm.count(\"max_prediction\") || vm.count(\"testonly\"))\n set_minmax = noop_mm;\n\n string loss_function;\n if(vm.count(\"loss_function\")) \n\t loss_function = vm[\"loss_function\"].as<string>();\n else\n\t loss_function = \"squaredloss\";\n\n double loss_parameter = 0.0;\n if(vm.count(\"quantile_tau\"))\n loss_parameter = vm[\"quantile_tau\"].as<double>();\n r.loss = getLossFunction(loss_function, loss_parameter);\n global.loss = r.loss;\n\n global.eta *= pow(par->t, vars.power_t);\n \n if (global.eta_decay_rate != default_decay && global.numpasses == 1)\n cerr << \"Warning: decay_learning_rate has no effect when there is only one pass\" << endl;\n\n if (pow(global.eta_decay_rate, global.numpasses) < 0.0001 )\n cerr << \"Warning: the learning rate for the last pass is multiplied by: \" << pow(global.eta_decay_rate, global.numpasses) \n\t << \" adjust to --decay_learning_rate larger to avoid this.\" << endl;\n \n parse_source_args(vm,par,global.quiet,global.numpasses);\n\n\n if (!global.quiet)\n {\n cerr << \"Num weight bits = \" << global.num_bits << endl;\n cerr << \"learning rate = \" << global.eta << endl;\n cerr << \"initial_t = \" << par->t << endl;\n cerr << \"power_t = \" << vars.power_t << endl;\n if (global.numpasses > 1)\n\tcerr << \"decay_learning_rate = \" << global.eta_decay_rate << endl;\n }\n \n if (vm.count(\"predictions\")) {\n if (!global.quiet)\n cerr << \"predictions = \" << vm[\"predictions\"].as< string >() << endl;\n if (strcmp(vm[\"predictions\"].as< string >().c_str(), \"stdout\") == 0)\n {\n\tint_pair pf = {1,0};\n\tpush(global.final_prediction_sink,pf);\/\/stdout\n }\n else \n {\n\tconst char* fstr = (vm[\"predictions\"].as< string >().c_str());\n\tint_pair pf = {fileno(fopen(fstr,\"w\")),0};\n\tif (pf.fd < 0)\n\t cerr << \"Error opening the predictions file: \" << fstr << endl;\n\tpush(global.final_prediction_sink,pf);\n }\n }\n \n if (vm.count(\"raw_predictions\")) {\n if (!global.quiet)\n cerr << \"raw predictions = \" << vm[\"raw_predictions\"].as< string >() << endl;\n if (strcmp(vm[\"raw_predictions\"].as< string >().c_str(), \"stdout\") == 0)\n global.raw_prediction = 1;\/\/stdout\n else\n global.raw_prediction = fileno(fopen(vm[\"raw_predictions\"].as< string >().c_str(), \"w\"));\n }\n\n if (vm.count(\"audit\"))\n global.audit = true;\n\n parse_send_args(vm, global.pairs);\n\n if (vm.count(\"testonly\"))\n {\n if (!global.quiet)\n\tcerr << \"only testing\" << endl;\n global.training = false;\n }\n else \n {\n global.training = true;\n if (!global.quiet)\n\tcerr << \"learning_rate set to \" << global.eta << endl;\n }\n\n if (vm.count(\"predictto\"))\n {\n if (!global.quiet)\n\tcerr << \"predictto = \" << vm[\"predictto\"].as< string >() << endl;\n global.local_prediction = open_socket(vm[\"predictto\"].as< string > ().c_str(), global.unique_id);\n }\n\n return vm;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"TestBlockLandApplication.h\"\n#include <Ogre.h>\n#include <OIS\/OIS.h>\n#include <iostream>\n\nTestBlockLandApplication::TestBlockLandApplication() {\n\tm_Blocks = new block_t[WORLD_SIZE * WORLD_SIZE * WORLD_SIZE];\n\tmemset(m_Blocks, 0, sizeof(block_t) * WORLD_SIZE * WORLD_SIZE * WORLD_SIZE);\n\tinitWorldBlocksSphere();\n\tm_ChunkID = 1;\n}\n\nTestBlockLandApplication::~TestBlockLandApplication() {\n\tdelete[] m_Blocks;\n}\n\nvoid TestBlockLandApplication::createChunk(const int StartX, const int StartY, const int StartZ) {\n\tOgre::ManualObject* MeshChunk = new Ogre::ManualObject(\"MeshManChunk\" + Ogre::StringConverter::toString(m_ChunkID));\n\tMeshChunk->begin(\"BoxColor\");\n\n\tint iVertex = 0;\n\tblock_t Block;\n\tblock_t Block1;\n\n\tfor (int z = StartZ; z < CHUNK_SIZE + StartZ; ++z) {\n\t\tfor (int y = StartY; y < CHUNK_SIZE + StartY; ++y) {\n\t\t\tfor (int x = StartX; x < CHUNK_SIZE + StartX; ++x) {\n\t\t\t\tBlock = GetBlock(x, y, z);\n\t\t\t\tif (Block == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\t\/\/x-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (x > StartX)\n\t\t\t\t\tBlock1 = GetBlock(x - 1, y, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/x+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (x < StartX + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x + 1, y, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/y-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (y > StartY)\n\t\t\t\t\tBlock1 = GetBlock(x, y - 1, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/y+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (y < StartY + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x, y + 1, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/z-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (z > StartZ)\n\t\t\t\t\tBlock1 = GetBlock(x, y, z - 1);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/z+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (z < StartZ + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x, y, z + 1);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tMeshChunk->end();\n\tmSceneMgr->getRootSceneNode()->createChildSceneNode()->attachObject(MeshChunk);\n\n\t++m_ChunkID;\n}\n\nvoid TestBlockLandApplication::createSolidTexture(const Ogre::String& pName) {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\ttex->setColourOperationEx(Ogre::LBX_MODULATE, Ogre::LBS_MANUAL, Ogre::LBS_CURRENT, Ogre::ColourValue(0, 0.5, 0));\n}\n\nvoid TestBlockLandApplication::createTexture(const Ogre::String& pName, const Ogre::String& pImageFilename) {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\n\ttex->setTextureName(pImageFilename);\n\ttex->setNumMipmaps(4);\n\ttex->setTextureAnisotropy(1);\n\ttex->setTextureFiltering(Ogre::FO_POINT, Ogre::FO_POINT, Ogre::FO_POINT);\n}\n\nvoid TestBlockLandApplication::createWorldChunks() {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\ttex->setColourOperationEx(Ogre::LBX_MODULATE, Ogre::LBS_MANUAL, Ogre::LBS_CURRENT, Ogre::ColourValue(0, 0.5, 0));\n\n\tfor (int z = 0; z < WORLD_SIZE; z += CHUNK_SIZE) {\n\t\tfor (int y = 0; y < WORLD_SIZE; y += CHUNK_SIZE) {\n\t\t\tfor (int x = 0; x < WORLD_SIZE; x += CHUNK_SIZE) {\n\t\t\t\tcreateChunk(x, y, z);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid TestBlockLandApplication::createScene() {\n\tmSceneMgr->setSkyDome(true, \"Examples\/CloudySky\", 2, 8, 100);\n\tmSceneMgr->setFog(Ogre::FOG_LINEAR, Ogre::ColourValue(0.8, 0.8, 1), 0.05, 0.0, 200);\n\n\tmCamera->setFarClipDistance(256);\n\tmCamera->setNearClipDistance(0.01);\n\n\tmSceneMgr->setAmbientLight(Ogre::ColourValue(0.5, 0.5, 0.5));\n\tOgre::Light* l = mSceneMgr->createLight(\"MainLight\");\n\tl->setPosition(20, 80, 50);\n\n\tcreateWorldChunks();\n}\n\nvoid TestBlockLandApplication::initWorldBlocksSphere() {\n\tOgre::Image heightMap;\n\theightMap.load(\"heightmap.png\", Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\tconst Ogre::PixelBox& pb = heightMap.getPixelBox();\n\theightMap.scale(pb, Ogre::PixelBox(WORLD_SIZE, WORLD_SIZE, pb.getDepth(), Ogre::PF_BYTE_RGB));\n\n\tfor (int z = 0; z < WORLD_SIZE; ++z) {\n\t\tfor (int x = 0; x < WORLD_SIZE; ++x) {\n\t\t\tconst Ogre::ColourValue& color = heightMap.getColourAt(x, z, 0);\n\t\t\tconst int Height = static_cast<int>((((color.r + color.g + color.b) \/ 1.5f) - 1.0f) * WORLD_SIZE \/ 4.0f + WORLD_SIZE \/ 2.0f);\n\t\t\tfor (int y = 0; y < Height; ++y) {\n\t\t\t\tGetBlock(x, y, z) = 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n#define WIN32_LEAN_AND_MEAN\n#include \"windows.h\"\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\nINT WINAPI WinMain(HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT)\n#else\nint main(int argc, char *argv[])\n#endif\n\t\t{\n\t\/\/ Create application object\n\tTestBlockLandApplication app;\n\n\ttry {\n\t\tapp.go();\n\t} catch (Ogre::Exception& e) {\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\t\tMessageBox(NULL, e.getFullDescription().c_str(), \"An exception has occurred!\", MB_OK | MB_ICONERROR | MB_TASKMODAL);\n#else\n\t\tstd::cerr << \"An exception has occurred: \" << e.getFullDescription().c_str() << std::endl;\n#endif\n\t}\n\n\treturn 0;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<commit_msg>* fixed segfault at startup<commit_after>#include \"TestBlockLandApplication.h\"\n#include <Ogre.h>\n#include <OIS\/OIS.h>\n#include <iostream>\n\nTestBlockLandApplication::TestBlockLandApplication() {\n\tm_Blocks = new block_t[WORLD_SIZE * WORLD_SIZE * WORLD_SIZE];\n\tmemset(m_Blocks, 0, sizeof(block_t) * WORLD_SIZE * WORLD_SIZE * WORLD_SIZE);\n\tm_ChunkID = 1;\n}\n\nTestBlockLandApplication::~TestBlockLandApplication() {\n\tdelete[] m_Blocks;\n}\n\nvoid TestBlockLandApplication::createChunk(const int StartX, const int StartY, const int StartZ) {\n\tOgre::ManualObject* MeshChunk = new Ogre::ManualObject(\"MeshManChunk\" + Ogre::StringConverter::toString(m_ChunkID));\n\tMeshChunk->begin(\"BoxColor\");\n\n\tint iVertex = 0;\n\tblock_t Block;\n\tblock_t Block1;\n\n\tfor (int z = StartZ; z < CHUNK_SIZE + StartZ; ++z) {\n\t\tfor (int y = StartY; y < CHUNK_SIZE + StartY; ++y) {\n\t\t\tfor (int x = StartX; x < CHUNK_SIZE + StartX; ++x) {\n\t\t\t\tBlock = GetBlock(x, y, z);\n\t\t\t\tif (Block == 0)\n\t\t\t\t\tcontinue;\n\n\t\t\t\t\/\/x-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (x > StartX)\n\t\t\t\t\tBlock1 = GetBlock(x - 1, y, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(-1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/x+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (x < StartX + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x + 1, y, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(1, 0, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/y-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (y > StartY)\n\t\t\t\t\tBlock1 = GetBlock(x, y - 1, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, -1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/y+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (y < StartY + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x, y + 1, z);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 1, 0);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/z-1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (z > StartZ)\n\t\t\t\t\tBlock1 = GetBlock(x, y, z - 1);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y, z);\n\t\t\t\t\tMeshChunk->normal(0, 0, -1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\n\t\t\t\t\/\/z+1\n\t\t\t\tBlock1 = 0;\n\t\t\t\tif (z < StartZ + CHUNK_SIZE - 1)\n\t\t\t\t\tBlock1 = GetBlock(x, y, z + 1);\n\n\t\t\t\tif (Block1 == 0) {\n\t\t\t\t\tMeshChunk->position(x, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 1);\n\t\t\t\t\tMeshChunk->position(x + 1, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(1, 0);\n\t\t\t\t\tMeshChunk->position(x, y + 1, z + 1);\n\t\t\t\t\tMeshChunk->normal(0, 0, 1);\n\t\t\t\t\tMeshChunk->textureCoord(0, 0);\n\n\t\t\t\t\tMeshChunk->triangle(iVertex, iVertex + 1, iVertex + 2);\n\t\t\t\t\tMeshChunk->triangle(iVertex + 2, iVertex + 3, iVertex);\n\n\t\t\t\t\tiVertex += 4;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tMeshChunk->end();\n\tmSceneMgr->getRootSceneNode()->createChildSceneNode()->attachObject(MeshChunk);\n\n\t++m_ChunkID;\n}\n\nvoid TestBlockLandApplication::createSolidTexture(const Ogre::String& pName) {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\ttex->setColourOperationEx(Ogre::LBX_MODULATE, Ogre::LBS_MANUAL, Ogre::LBS_CURRENT, Ogre::ColourValue(0, 0.5, 0));\n}\n\nvoid TestBlockLandApplication::createTexture(const Ogre::String& pName, const Ogre::String& pImageFilename) {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\n\ttex->setTextureName(pImageFilename);\n\ttex->setNumMipmaps(4);\n\ttex->setTextureAnisotropy(1);\n\ttex->setTextureFiltering(Ogre::FO_POINT, Ogre::FO_POINT, Ogre::FO_POINT);\n}\n\nvoid TestBlockLandApplication::createWorldChunks() {\n\tOgre::MaterialPtr mat = Ogre::MaterialManager::getSingleton().create(\"BoxColor\", \"General\", true);\n\tOgre::Technique* tech = mat->getTechnique(0);\n\tOgre::Pass* pass = tech->getPass(0);\n\tOgre::TextureUnitState* tex = pass->createTextureUnitState();\n\ttex->setColourOperationEx(Ogre::LBX_MODULATE, Ogre::LBS_MANUAL, Ogre::LBS_CURRENT, Ogre::ColourValue(0, 0.5, 0));\n\n\tfor (int z = 0; z < WORLD_SIZE; z += CHUNK_SIZE) {\n\t\tfor (int y = 0; y < WORLD_SIZE; y += CHUNK_SIZE) {\n\t\t\tfor (int x = 0; x < WORLD_SIZE; x += CHUNK_SIZE) {\n\t\t\t\tcreateChunk(x, y, z);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid TestBlockLandApplication::createScene() {\n\tmSceneMgr->setSkyDome(true, \"Examples\/CloudySky\", 2, 8, 100);\n\tmSceneMgr->setFog(Ogre::FOG_LINEAR, Ogre::ColourValue(0.8, 0.8, 1), 0.05, 0.0, 200);\n\n\tmCamera->setFarClipDistance(256);\n\tmCamera->setNearClipDistance(0.01);\n\n\tmSceneMgr->setAmbientLight(Ogre::ColourValue(0.5, 0.5, 0.5));\n\tOgre::Light* l = mSceneMgr->createLight(\"MainLight\");\n\tl->setPosition(20, 80, 50);\n\n\tinitWorldBlocksSphere();\n\n\tcreateWorldChunks();\n}\n\nvoid TestBlockLandApplication::initWorldBlocksSphere() {\n\tOgre::Image heightMap;\n\theightMap.load(\"heightmap.png\", Ogre::ResourceGroupManager::DEFAULT_RESOURCE_GROUP_NAME);\n\tconst Ogre::PixelBox& pb = heightMap.getPixelBox();\n\theightMap.scale(pb, Ogre::PixelBox(WORLD_SIZE, WORLD_SIZE, pb.getDepth(), Ogre::PF_BYTE_RGB));\n\n\tfor (int z = 0; z < WORLD_SIZE; ++z) {\n\t\tfor (int x = 0; x < WORLD_SIZE; ++x) {\n\t\t\tconst Ogre::ColourValue& color = heightMap.getColourAt(x, z, 0);\n\t\t\tconst int height = static_cast<int>((((color.r + color.g + color.b) \/ 1.5f) - 1.0f) * WORLD_SIZE \/ 4.0f + WORLD_SIZE \/ 2.0f);\n\t\t\tfor (int y = 0; y < height; ++y) {\n\t\t\t\tGetBlock(x, y, z) = 1;\n\t\t\t}\n\t\t}\n\t}\n}\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n#define WIN32_LEAN_AND_MEAN\n#include \"windows.h\"\n#endif\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\n\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\nINT WINAPI WinMain(HINSTANCE hInst, HINSTANCE, LPSTR strCmdLine, INT)\n#else\nint main(int argc, char *argv[])\n#endif\n\t\t{\n\t\/\/ Create application object\n\tTestBlockLandApplication app;\n\n\ttry {\n\t\tapp.go();\n\t} catch (Ogre::Exception& e) {\n#if OGRE_PLATFORM == OGRE_PLATFORM_WIN32\n\t\tMessageBox(NULL, e.getFullDescription().c_str(), \"An exception has occurred!\", MB_OK | MB_ICONERROR | MB_TASKMODAL);\n#else\n\t\tstd::cerr << \"An exception has occurred: \" << e.getFullDescription().c_str() << std::endl;\n#endif\n\t}\n\n\treturn 0;\n}\n\n#ifdef __cplusplus\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"phonebook.h\"\n#include \"contactlistpage.h\"\n#include \"contacteditor.h\"\n#include \"filterpage.h\"\n\n#include <QtGui>\n\nPhoneBook::PhoneBook(QWidget *parent)\n : QMainWindow(parent)\n{\n QWidget *centralWidget = new QWidget(this);\n \n m_editorPage = new ContactEditor(centralWidget);\n connect(m_editorPage, SIGNAL(showListPage()), this, SLOT(activateList()));\n\n m_filterPage = new FilterPage(centralWidget);\n connect(m_filterPage, SIGNAL(showListPage(QContactFilter)), this, SLOT(activateList(QContactFilter)));\n\n m_listPage = new ContactListPage(this, centralWidget);\n connect(m_listPage, SIGNAL(showEditorPage(QContactLocalId)), this, SLOT(activateEditor(QContactLocalId)));\n connect(m_listPage, SIGNAL(showFilterPage(QContactFilter)), this, SLOT(activateFind()));\n connect(m_listPage, SIGNAL(managerChanged(QContactManager*)), this, SLOT(managerChanged(QContactManager*)));\n connect(m_listPage, SIGNAL(clearFilter()), m_filterPage, SLOT(clearFilter()));\n\n m_stackedWidget = new QStackedWidget(centralWidget);\n m_stackedWidget->addWidget(m_listPage);\n m_stackedWidget->addWidget(m_editorPage);\n m_stackedWidget->addWidget(m_filterPage);\n m_stackedWidget->setCurrentIndex(0);\n\n QVBoxLayout *centralLayout = new QVBoxLayout;\n centralLayout->addWidget(m_stackedWidget);\n centralWidget->setLayout(centralLayout);\n \n setCentralWidget(centralWidget);\n}\n\nPhoneBook::~PhoneBook()\n{\n}\n\nvoid PhoneBook::activateEditor(QContactLocalId contactId)\n{\n menuBar()->setVisible(false);\n m_editorPage->setCurrentContact(m_manager, contactId);\n m_stackedWidget->setCurrentIndex(1); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::activateList(const QContactFilter& filter)\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(true);\n#endif\n m_currentFilter = filter;\n activateList(); \/\/ call base now.\n}\n\nvoid PhoneBook::activateList()\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(true);\n#endif\n m_listPage->rebuildList(m_currentFilter);\n m_stackedWidget->setCurrentIndex(0); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::activateFind()\n{\n menuBar()->setVisible(false);\n m_stackedWidget->setCurrentIndex(2); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::managerChanged(QContactManager *manager)\n{\n m_manager = manager;\n m_editorPage->setCurrentContact(m_manager, 0); \/\/ must reset the manager of the editor.\n}\n<commit_msg>Try to avoid SwEvent caps.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:BSD$\n** You may use this file under the terms of the BSD license as follows:\n**\n** \"Redistribution and use in source and binary forms, with or without\n** modification, are permitted provided that the following conditions are\n** met:\n** * Redistributions of source code must retain the above copyright\n** notice, this list of conditions and the following disclaimer.\n** * Redistributions in binary form must reproduce the above copyright\n** notice, this list of conditions and the following disclaimer in\n** the documentation and\/or other materials provided with the\n** distribution.\n** * Neither the name of Nokia Corporation and its Subsidiary(-ies) nor\n** the names of its contributors may be used to endorse or promote\n** products derived from this software without specific prior written\n** permission.\n**\n** THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n** \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n** LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n** A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n** OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n** SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n** LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n** DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n** THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n** (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n** OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\"\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"phonebook.h\"\n#include \"contactlistpage.h\"\n#include \"contacteditor.h\"\n#include \"filterpage.h\"\n\n#include <QtGui>\n\nPhoneBook::PhoneBook(QWidget *parent)\n : QMainWindow(parent)\n{\n QWidget *centralWidget = new QWidget(this);\n \n m_editorPage = new ContactEditor(centralWidget);\n connect(m_editorPage, SIGNAL(showListPage()), this, SLOT(activateList()));\n\n m_filterPage = new FilterPage(centralWidget);\n connect(m_filterPage, SIGNAL(showListPage(QContactFilter)), this, SLOT(activateList(QContactFilter)));\n\n m_listPage = new ContactListPage(this, centralWidget);\n connect(m_listPage, SIGNAL(showEditorPage(QContactLocalId)), this, SLOT(activateEditor(QContactLocalId)));\n connect(m_listPage, SIGNAL(showFilterPage(QContactFilter)), this, SLOT(activateFind()));\n connect(m_listPage, SIGNAL(managerChanged(QContactManager*)), this, SLOT(managerChanged(QContactManager*)));\n connect(m_listPage, SIGNAL(clearFilter()), m_filterPage, SLOT(clearFilter()));\n\n m_stackedWidget = new QStackedWidget(centralWidget);\n m_stackedWidget->addWidget(m_listPage);\n m_stackedWidget->addWidget(m_editorPage);\n m_stackedWidget->addWidget(m_filterPage);\n m_stackedWidget->setCurrentIndex(0);\n\n QVBoxLayout *centralLayout = new QVBoxLayout;\n centralLayout->addWidget(m_stackedWidget);\n centralWidget->setLayout(centralLayout);\n \n setCentralWidget(centralWidget);\n}\n\nPhoneBook::~PhoneBook()\n{\n}\n\nvoid PhoneBook::activateEditor(QContactLocalId contactId)\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(false);\n#endif\n m_editorPage->setCurrentContact(m_manager, contactId);\n m_stackedWidget->setCurrentIndex(1); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::activateList(const QContactFilter& filter)\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(true);\n#endif\n m_currentFilter = filter;\n activateList(); \/\/ call base now.\n}\n\nvoid PhoneBook::activateList()\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(true);\n#endif\n m_listPage->rebuildList(m_currentFilter);\n m_stackedWidget->setCurrentIndex(0); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::activateFind()\n{\n#if !(defined(Q_OS_SYMBIAN) || defined(Q_WS_MAEMO_5))\n menuBar()->setVisible(false);\n#endif\n m_stackedWidget->setCurrentIndex(2); \/\/ list = 0, editor = 1, find = 2.\n}\n\nvoid PhoneBook::managerChanged(QContactManager *manager)\n{\n m_manager = manager;\n m_editorPage->setCurrentContact(m_manager, 0); \/\/ must reset the manager of the editor.\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2004 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * imitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XKMSRequestAbstractTypeImpl := Implementation class for XKMS Request messages\n *\n * $Id$\n *\n *\/\n\n\/\/ XSEC Includes\n\n#include <xsec\/framework\/XSECDefs.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n#include <xsec\/framework\/XSECEnv.hpp>\n#include <xsec\/xkms\/XKMSConstants.hpp>\n\n#include <xercesc\/dom\/DOM.hpp>\n#include <xercesc\/dom\/DOMNodeList.hpp>\n\n#include \"XKMSRequestAbstractTypeImpl.hpp\"\n#include \"XKMSRespondWithImpl.hpp\"\n#include \"XKMSResponseMechanismImpl.hpp\"\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Construct\/Destruct\n\/\/ --------------------------------------------------------------------------------\n\nXKMSRequestAbstractTypeImpl::XKMSRequestAbstractTypeImpl(\n\tconst XSECEnv * env) :\nXKMSMessageAbstractTypeImpl(env)\n{\n\tmp_originalRequestIdAttr = NULL;\n\tmp_responseLimitAttr = NULL;\n}\n\nXKMSRequestAbstractTypeImpl::XKMSRequestAbstractTypeImpl(\n\tconst XSECEnv * env, \n\tDOMElement * node) :\nXKMSMessageAbstractTypeImpl(env, node)\n{\n\tmp_originalRequestIdAttr = NULL;\n\tmp_responseLimitAttr = NULL;\n}\n\nXKMSRequestAbstractTypeImpl::~XKMSRequestAbstractTypeImpl() {\n\n\tRespondWithVectorType::iterator i;\n\n\tfor (i = m_respondWithList.begin(); i < m_respondWithList.end(); ++i) {\n\t\tdelete (*i);\n\t}\n\n\tResponseMechanismVectorType::iterator j;\n\n\tfor (j = m_responseMechanismList.begin(); j < m_responseMechanismList.end(); ++j) {\n\t\tdelete (*j);\n\t}\n};\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Load\n\/\/ --------------------------------------------------------------------------------\n\nvoid XKMSRequestAbstractTypeImpl::load(void) {\n\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt to load an empty element\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::load - called on empty DOM\");\n\n\t}\n\n\t\/\/ Get any respond with elements\n\tDOMNodeList * nl = mp_messageAbstractTypeElement->getElementsByTagNameNS(\n\t\tXKMSConstants::s_unicodeStrURIXKMS,\n\t\tXKMSConstants::s_tagRespondWith);\n\n\tif (nl != NULL) {\n\n\t\tXKMSRespondWithImpl * rw;\n\t\tfor (int i = 0; i < nl->getLength() ; ++ i) {\n\n\t\t\tXSECnew(rw, XKMSRespondWithImpl(mp_env, (DOMElement *) nl->item(i)));\n\t\t\trw->load();\n\t\t\tm_respondWithList.push_back(rw);\n\n\t\t}\n\n\t}\n\n\t\/\/ Get any ResponseMechanism elements\n\tnl = mp_messageAbstractTypeElement->getElementsByTagNameNS(\n\t\tXKMSConstants::s_unicodeStrURIXKMS,\n\t\tXKMSConstants::s_tagResponseMechanism);\n\n\tif (nl != NULL) {\n\n\t\tXKMSResponseMechanismImpl * rm;\n\t\tfor (int i = 0; i < nl->getLength() ; ++ i) {\n\n\t\t\tXSECnew(rm, XKMSResponseMechanismImpl(mp_env, (DOMElement *) nl->item(i)));\n\t\t\trm->load();\n\t\t\tm_responseMechanismList.push_back(rm);\n\n\t\t}\n\n\t}\n\n\tmp_originalRequestIdAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagOriginalRequestId);\n\n\tmp_responseLimitAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagResponseLimit);\n\t\n\t\t\n\tXKMSMessageAbstractTypeImpl::load();\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Create from scratch\n\/\/ --------------------------------------------------------------------------------\n\nDOMElement * XKMSRequestAbstractTypeImpl::createBlankRequestAbstractType(\n\t\tconst XMLCh * tag,\n\t\tconst XMLCh * service,\n\t\tconst XMLCh * id) {\n\n\treturn XKMSMessageAbstractTypeImpl::createBlankMessageAbstractType(tag, service, id);\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Get\/Set interface methods\n\/\/ --------------------------------------------------------------------------------\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getOriginalRequestId(void) const {\n\n\tif (mp_originalRequestIdAttr != NULL)\n\t\treturn mp_originalRequestIdAttr->getNodeValue();\n\n\treturn NULL;\n}\n\nvoid XKMSRequestAbstractTypeImpl::setOriginalRequestId(const XMLCh * id) {\n\t\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt update when not initialised\n\t\tthrow XSECException(XSECException::MessageAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::setOriginalRequestId - called on non-initialised structure\");\n\n\t}\n\n\tmp_messageAbstractTypeElement->setAttributeNS(NULL, XKMSConstants::s_tagOriginalRequestId, id);\n\tmp_originalRequestIdAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagOriginalRequestId);\n\n}\n\nunsigned int XKMSRequestAbstractTypeImpl::getResponseLimit(void) const {\n\n\tif (mp_responseLimitAttr == NULL)\n\t\treturn 0;\n\n\tunsigned int ret;\n\n\tif (!XMLString::textToBin(mp_responseLimitAttr->getValue(), ret))\n\t\treturn 0;\n\n\treturn ret;\n}\n\nvoid XKMSRequestAbstractTypeImpl::setResponseLimit(unsigned int limit) {\n\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt update when not initialised\n\t\tthrow XSECException(XSECException::MessageAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::setResponseLimit - called on non-initialised structure\");\n\n\t}\n\n\t\/* Convert the number to a string *\/\n\tXMLCh limitStr[10];\n\tXMLString::binToText(limit, limitStr, 9, 10);\n\n\tmp_messageAbstractTypeElement->setAttributeNS(NULL, XKMSConstants::s_tagResponseLimit, limitStr);\n\tmp_responseLimitAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagResponseLimit);\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ RespondWith handling\n\/\/ --------------------------------------------------------------------------------\n\nint XKMSRequestAbstractTypeImpl::getRespondWithSize(void) {\n\n\treturn m_respondWithList.size();\n\n}\n\nXKMSRespondWith * XKMSRequestAbstractTypeImpl::getRespondWithItem(int item) {\n\n\tif (item < 0 || item >= m_respondWithList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getRespondWithItem - item out of range\");\n\n\t}\n\n\treturn m_respondWithList[item];\n\n}\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getRespondWithItemStr(int item) {\n\n\tif (item < 0 || item >= m_respondWithList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getRespondWithItem - item out of range\");\n\n\t}\n\n\treturn m_respondWithList[item]->getRespondWithString();\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendRespondWithItem(XKMSRespondWith * item) {\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendRespondWithItem(const XMLCh * item) {\n\n\tXKMSRespondWithImpl * rw;\n\tXSECnew(rw, XKMSRespondWithImpl(mp_env));\n\n\t\/\/ Create the RespondWith object\n\tDOMElement * elt = rw->createBlankRespondWith(item);\n\n\t\/\/ Add to the item\n\tDOMElement * c = findFirstElementChild(mp_messageAbstractTypeElement);\n\twhile (c != NULL) {\n\n\t\tif (!strEquals(getXKMSLocalName(c), XKMSConstants::s_tagResponseMechanism))\n\t\t\tbreak;\n\n\t}\n\n\tif (c != NULL) {\n\t\tmp_messageAbstractTypeElement->insertBefore(elt, c);\n\t\tif (mp_env->getPrettyPrintFlag()) {\n\t\t\tmp_messageAbstractTypeElement->insertBefore(\n\t\t\t\tmp_env->getParentDocument()->createTextNode(DSIGConstants::s_unicodeStrNL), c);\n\t\t}\n\t}\n\telse {\n\t\tmp_messageAbstractTypeElement->appendChild(elt);\n\t\tmp_env->doPrettyPrint(mp_messageAbstractTypeElement);\n\t}\n\n\t\/\/ Add to the list\n\tm_respondWithList.push_back(rw);\n\n}\n\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ ResponseMechanism handling\n\/\/ --------------------------------------------------------------------------------\n\nint XKMSRequestAbstractTypeImpl::getResponseMechanismSize(void) {\n\n\treturn m_responseMechanismList.size();\n\n}\n\nXKMSResponseMechanism * XKMSRequestAbstractTypeImpl::getResponseMechanismItem(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\treturn m_responseMechanismList[item];\n\n}\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getResponseMechanismItemStr(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\treturn m_responseMechanismList[item]->getResponseMechanismString();\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendResponseMechanismItem(XKMSResponseMechanism * item) {\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendResponseMechanismItem(const XMLCh * item) {\n\n\tXKMSResponseMechanismImpl * rw;\n\tXSECnew(rw, XKMSResponseMechanismImpl(mp_env));\n\n\t\/\/ Create the ResponseMechanism object\n\tDOMElement * elt = rw->createBlankResponseMechanism(item);\n\n\t\/\/ Add to the item\n\tDOMElement * c = findFirstElementChild(mp_messageAbstractTypeElement);\n\twhile (c != NULL) {\n\n\t\tif (!strEquals(getXKMSLocalName(c), XKMSConstants::s_tagResponseMechanism))\n\t\t\tbreak;\n\n\t}\n\n\tif (c != NULL) {\n\t\tmp_messageAbstractTypeElement->insertBefore(elt, c);\n\t\tif (mp_env->getPrettyPrintFlag()) {\n\t\t\tmp_messageAbstractTypeElement->insertBefore(\n\t\t\t\tmp_env->getParentDocument()->createTextNode(DSIGConstants::s_unicodeStrNL), c);\n\t\t}\n\t}\n\telse {\n\t\tmp_messageAbstractTypeElement->appendChild(elt);\n\t\tmp_env->doPrettyPrint(mp_messageAbstractTypeElement);\n\t}\n\n\t\/\/ Add to the list\n\tm_responseMechanismList.push_back(rw);\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::removeResponseMechanismItem(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\tXKMSResponseMechanism *rm = m_responseMechanismList[item];\n\tDOMNode * m = rm->getElement();\n\tm->getParentNode()->removeChild(m);\n\tm->release();\n\n\t\/\/ Now clean up our structure.\n\tResponseMechanismVectorType::iterator i;\n\tint j = 0;\n\ti = m_responseMechanismList.begin();\n\twhile (j < item) {\n\t\tj++;\n\t\ti++;\n\t}\n\tm_responseMechanismList.erase(i);\n\n}\n\n\n<commit_msg>Properly handle multiple Pending\/Represent elements<commit_after>\/*\n * Copyright 2004 The Apache Software Foundation.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * imitations under the License.\n *\/\n\n\/*\n * XSEC\n *\n * XKMSRequestAbstractTypeImpl := Implementation class for XKMS Request messages\n *\n * $Id$\n *\n *\/\n\n\/\/ XSEC Includes\n\n#include <xsec\/framework\/XSECDefs.hpp>\n#include <xsec\/framework\/XSECError.hpp>\n#include <xsec\/framework\/XSECEnv.hpp>\n#include <xsec\/xkms\/XKMSConstants.hpp>\n\n#include <xercesc\/dom\/DOM.hpp>\n#include <xercesc\/dom\/DOMNodeList.hpp>\n\n#include \"XKMSRequestAbstractTypeImpl.hpp\"\n#include \"XKMSRespondWithImpl.hpp\"\n#include \"XKMSResponseMechanismImpl.hpp\"\n\nXERCES_CPP_NAMESPACE_USE\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Construct\/Destruct\n\/\/ --------------------------------------------------------------------------------\n\nXKMSRequestAbstractTypeImpl::XKMSRequestAbstractTypeImpl(\n\tconst XSECEnv * env) :\nXKMSMessageAbstractTypeImpl(env)\n{\n\tmp_originalRequestIdAttr = NULL;\n\tmp_responseLimitAttr = NULL;\n}\n\nXKMSRequestAbstractTypeImpl::XKMSRequestAbstractTypeImpl(\n\tconst XSECEnv * env, \n\tDOMElement * node) :\nXKMSMessageAbstractTypeImpl(env, node)\n{\n\tmp_originalRequestIdAttr = NULL;\n\tmp_responseLimitAttr = NULL;\n}\n\nXKMSRequestAbstractTypeImpl::~XKMSRequestAbstractTypeImpl() {\n\n\tRespondWithVectorType::iterator i;\n\n\tfor (i = m_respondWithList.begin(); i < m_respondWithList.end(); ++i) {\n\t\tdelete (*i);\n\t}\n\n\tResponseMechanismVectorType::iterator j;\n\n\tfor (j = m_responseMechanismList.begin(); j < m_responseMechanismList.end(); ++j) {\n\t\tdelete (*j);\n\t}\n};\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Load\n\/\/ --------------------------------------------------------------------------------\n\nvoid XKMSRequestAbstractTypeImpl::load(void) {\n\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt to load an empty element\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::load - called on empty DOM\");\n\n\t}\n\n\t\/\/ Get any respond with elements\n\tDOMNodeList * nl = mp_messageAbstractTypeElement->getElementsByTagNameNS(\n\t\tXKMSConstants::s_unicodeStrURIXKMS,\n\t\tXKMSConstants::s_tagRespondWith);\n\n\tif (nl != NULL) {\n\n\t\tXKMSRespondWithImpl * rw;\n\t\tfor (int i = 0; i < nl->getLength() ; ++ i) {\n\n\t\t\tXSECnew(rw, XKMSRespondWithImpl(mp_env, (DOMElement *) nl->item(i)));\n\t\t\trw->load();\n\t\t\tm_respondWithList.push_back(rw);\n\n\t\t}\n\n\t}\n\n\t\/\/ Get any ResponseMechanism elements\n\tnl = mp_messageAbstractTypeElement->getElementsByTagNameNS(\n\t\tXKMSConstants::s_unicodeStrURIXKMS,\n\t\tXKMSConstants::s_tagResponseMechanism);\n\n\tif (nl != NULL) {\n\n\t\tXKMSResponseMechanismImpl * rm;\n\t\tfor (int i = 0; i < nl->getLength() ; ++ i) {\n\n\t\t\tXSECnew(rm, XKMSResponseMechanismImpl(mp_env, (DOMElement *) nl->item(i)));\n\t\t\trm->load();\n\t\t\tm_responseMechanismList.push_back(rm);\n\n\t\t}\n\n\t}\n\n\tmp_originalRequestIdAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagOriginalRequestId);\n\n\tmp_responseLimitAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagResponseLimit);\n\t\n\t\t\n\tXKMSMessageAbstractTypeImpl::load();\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Create from scratch\n\/\/ --------------------------------------------------------------------------------\n\nDOMElement * XKMSRequestAbstractTypeImpl::createBlankRequestAbstractType(\n\t\tconst XMLCh * tag,\n\t\tconst XMLCh * service,\n\t\tconst XMLCh * id) {\n\n\treturn XKMSMessageAbstractTypeImpl::createBlankMessageAbstractType(tag, service, id);\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ Get\/Set interface methods\n\/\/ --------------------------------------------------------------------------------\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getOriginalRequestId(void) const {\n\n\tif (mp_originalRequestIdAttr != NULL)\n\t\treturn mp_originalRequestIdAttr->getNodeValue();\n\n\treturn NULL;\n}\n\nvoid XKMSRequestAbstractTypeImpl::setOriginalRequestId(const XMLCh * id) {\n\t\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt update when not initialised\n\t\tthrow XSECException(XSECException::MessageAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::setOriginalRequestId - called on non-initialised structure\");\n\n\t}\n\n\tmp_messageAbstractTypeElement->setAttributeNS(NULL, XKMSConstants::s_tagOriginalRequestId, id);\n\tmp_originalRequestIdAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagOriginalRequestId);\n\n}\n\nunsigned int XKMSRequestAbstractTypeImpl::getResponseLimit(void) const {\n\n\tif (mp_responseLimitAttr == NULL)\n\t\treturn 0;\n\n\tunsigned int ret;\n\n\tif (!XMLString::textToBin(mp_responseLimitAttr->getValue(), ret))\n\t\treturn 0;\n\n\treturn ret;\n}\n\nvoid XKMSRequestAbstractTypeImpl::setResponseLimit(unsigned int limit) {\n\n\tif (mp_messageAbstractTypeElement == NULL) {\n\n\t\t\/\/ Attempt update when not initialised\n\t\tthrow XSECException(XSECException::MessageAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractType::setResponseLimit - called on non-initialised structure\");\n\n\t}\n\n\t\/* Convert the number to a string *\/\n\tXMLCh limitStr[10];\n\tXMLString::binToText(limit, limitStr, 9, 10);\n\n\tmp_messageAbstractTypeElement->setAttributeNS(NULL, XKMSConstants::s_tagResponseLimit, limitStr);\n\tmp_responseLimitAttr = \n\t\tmp_messageAbstractTypeElement->getAttributeNodeNS(NULL, XKMSConstants::s_tagResponseLimit);\n\n}\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ RespondWith handling\n\/\/ --------------------------------------------------------------------------------\n\nint XKMSRequestAbstractTypeImpl::getRespondWithSize(void) {\n\n\treturn m_respondWithList.size();\n\n}\n\nXKMSRespondWith * XKMSRequestAbstractTypeImpl::getRespondWithItem(int item) {\n\n\tif (item < 0 || item >= m_respondWithList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getRespondWithItem - item out of range\");\n\n\t}\n\n\treturn m_respondWithList[item];\n\n}\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getRespondWithItemStr(int item) {\n\n\tif (item < 0 || item >= m_respondWithList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getRespondWithItem - item out of range\");\n\n\t}\n\n\treturn m_respondWithList[item]->getRespondWithString();\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendRespondWithItem(XKMSRespondWith * item) {\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendRespondWithItem(const XMLCh * item) {\n\n\tXKMSRespondWithImpl * rw;\n\tXSECnew(rw, XKMSRespondWithImpl(mp_env));\n\n\t\/\/ Create the RespondWith object\n\tDOMElement * elt = rw->createBlankRespondWith(item);\n\n\t\/\/ Add to the item\n\tDOMElement * c = findFirstElementChild(mp_messageAbstractTypeElement);\n\twhile (c != NULL) {\n\n\t\tif (!strEquals(getXKMSLocalName(c), XKMSConstants::s_tagResponseMechanism))\n\t\t\tbreak;\n\n\t}\n\n\tif (c != NULL) {\n\t\tmp_messageAbstractTypeElement->insertBefore(elt, c);\n\t\tif (mp_env->getPrettyPrintFlag()) {\n\t\t\tmp_messageAbstractTypeElement->insertBefore(\n\t\t\t\tmp_env->getParentDocument()->createTextNode(DSIGConstants::s_unicodeStrNL), c);\n\t\t}\n\t}\n\telse {\n\t\tmp_messageAbstractTypeElement->appendChild(elt);\n\t\tmp_env->doPrettyPrint(mp_messageAbstractTypeElement);\n\t}\n\n\t\/\/ Add to the list\n\tm_respondWithList.push_back(rw);\n\n}\n\n\n\/\/ --------------------------------------------------------------------------------\n\/\/ ResponseMechanism handling\n\/\/ --------------------------------------------------------------------------------\n\nint XKMSRequestAbstractTypeImpl::getResponseMechanismSize(void) {\n\n\treturn m_responseMechanismList.size();\n\n}\n\nXKMSResponseMechanism * XKMSRequestAbstractTypeImpl::getResponseMechanismItem(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\treturn m_responseMechanismList[item];\n\n}\n\nconst XMLCh * XKMSRequestAbstractTypeImpl::getResponseMechanismItemStr(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\treturn m_responseMechanismList[item]->getResponseMechanismString();\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendResponseMechanismItem(XKMSResponseMechanism * item) {\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::appendResponseMechanismItem(const XMLCh * item) {\n\n\tXKMSResponseMechanismImpl * rw;\n\tXSECnew(rw, XKMSResponseMechanismImpl(mp_env));\n\n\t\/\/ Create the ResponseMechanism object\n\tDOMElement * elt = rw->createBlankResponseMechanism(item);\n\n\t\/\/ Add to the item\n\tDOMElement * c = findFirstElementChild(mp_messageAbstractTypeElement);\n\twhile (c != NULL) {\n\n\t\tif (!strEquals(getXKMSLocalName(c), XKMSConstants::s_tagResponseMechanism))\n\t\t\tbreak;\n\n\t\tc = findNextElementChild(c);\n\n\t}\n\n\tif (c != NULL) {\n\t\tmp_messageAbstractTypeElement->insertBefore(elt, c);\n\t\tif (mp_env->getPrettyPrintFlag()) {\n\t\t\tmp_messageAbstractTypeElement->insertBefore(\n\t\t\t\tmp_env->getParentDocument()->createTextNode(DSIGConstants::s_unicodeStrNL), c);\n\t\t}\n\t}\n\telse {\n\t\tmp_messageAbstractTypeElement->appendChild(elt);\n\t\tmp_env->doPrettyPrint(mp_messageAbstractTypeElement);\n\t}\n\n\t\/\/ Add to the list\n\tm_responseMechanismList.push_back(rw);\n\n}\n\nvoid XKMSRequestAbstractTypeImpl::removeResponseMechanismItem(int item) {\n\n\tif (item < 0 || item >= m_responseMechanismList.size()) {\n\n\t\tthrow XSECException(XSECException::RequestAbstractTypeError,\n\t\t\t\"XKMSRequestAbstractTypeImpl::getResponseMechanismItem - item out of range\");\n\n\t}\n\n\tXKMSResponseMechanism *rm = m_responseMechanismList[item];\n\tDOMNode * m = rm->getElement();\n\tm->getParentNode()->removeChild(m);\n\tm->release();\n\n\t\/\/ Now clean up our structure.\n\tResponseMechanismVectorType::iterator i;\n\tint j = 0;\n\ti = m_responseMechanismList.begin();\n\twhile (j < item) {\n\t\tj++;\n\t\ti++;\n\t}\n\tm_responseMechanismList.erase(i);\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\r\n * This file is a part of Xpiks - cross platform application for\r\n * keywording and uploading images for microstocks\r\n * Copyright (C) 2014 Taras Kushnir <kushnirTV@gmail.com>\r\n *\r\n * Xpiks is distributed under the GNU General Public License, version 3.0\r\n *\r\n * This program is free software: you can redistribute it and\/or modify\r\n * it under the terms of the GNU General Public License as published by\r\n * the Free Software Foundation, either version 3 of the License, or\r\n * (at your option) any later version.\r\n *\r\n * This program is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n * GNU General Public License for more details.\r\n *\r\n * You should have received a copy of the GNU General Public License\r\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n *\/\r\n\r\n#include \"combinedartworksmodel.h\"\r\n#include \"..\/Helpers\/indiceshelper.h\"\r\n\r\nnamespace Models {\r\n void CombinedArtworksModel::initArtworks(const QList<ArtItemInfo *> &artworks)\r\n {\r\n int innerLength = m_ArtworksList.length();\r\n int start = innerLength == 0 ? 0 : innerLength - 1;\r\n int paramLength = artworks.length();\r\n if (paramLength > 0) {\r\n beginInsertRows(QModelIndex(), start, start + paramLength - 1);\r\n m_ArtworksList.append(artworks);\r\n endInsertRows();\r\n }\r\n m_IsModified = false;\r\n }\r\n\r\n void CombinedArtworksModel::recombineArtworks()\r\n {\r\n bool anyItemsProcessed = false;\r\n bool descriptionsDiffer = false;\r\n bool titleDiffer = false;\r\n bool authorDiffer = false;\r\n QString description;\r\n QString title;\r\n QString author;\r\n QSet<QString> commonKeywords;\r\n\r\n int artworksCount = m_ArtworksList.length();\r\n for (int i = 0; i < artworksCount; ++i) {\r\n ArtItemInfo *info = m_ArtworksList[i];\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n\r\n if (!anyItemsProcessed) {\r\n description = metadata->getDescription();\r\n title = metadata->getTitle();\r\n author = metadata->getAuthor();\r\n commonKeywords.unite(metadata->getKeywordsSet());\r\n anyItemsProcessed = true;\r\n continue;\r\n }\r\n\r\n const QString &currDescription = metadata->getDescription();\r\n const QString &currTitle = metadata->getTitle();\r\n const QString &currAuthor = metadata->getAuthor();\r\n descriptionsDiffer = descriptionsDiffer || description != currDescription;\r\n titleDiffer = titleDiffer || title != currTitle;\r\n authorDiffer = authorDiffer || author != currAuthor;\r\n commonKeywords.intersect(metadata->getKeywordsSet());\r\n }\r\n\r\n if (artworksCount > 0) {\r\n if (descriptionsDiffer) {\r\n description = \"\";\r\n }\r\n\r\n if (titleDiffer) {\r\n title = \"\";\r\n }\r\n\r\n if (authorDiffer) {\r\n author = \"\";\r\n }\r\n\r\n initDescription(description);\r\n initTitle(title);\r\n initAuthor(author);\r\n\r\n if (!m_IsModified) {\r\n initKeywords(commonKeywords.toList());\r\n }\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::resetModelData()\r\n {\r\n beginResetModel();\r\n qDeleteAll(m_ArtworksList);\r\n m_ArtworksList.clear();\r\n endResetModel();\r\n\r\n setDescription(\"\");\r\n setAuthor(\"\");\r\n setTitle(\"\");\r\n setKeywords(QStringList());\r\n m_CommonKeywordsSet.clear();\r\n }\r\n\r\n void CombinedArtworksModel::removeKeywordAt(int keywordIndex)\r\n {\r\n QString keyword;\r\n if (m_CommonKeywordsModel.removeKeyword(keywordIndex, keyword)) {\r\n m_CommonKeywordsSet.remove(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::removeLastKeyword()\r\n {\r\n QString keyword;\r\n if (m_CommonKeywordsModel.removeLastKeyword(keyword)) {\r\n m_CommonKeywordsSet.remove(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::appendKeyword(const QString &word)\r\n {\r\n QString keyword = word.simplified();\r\n if (!m_CommonKeywordsSet.contains(keyword)) {\r\n m_CommonKeywordsModel.appendKeyword(keyword);\r\n m_CommonKeywordsSet.insert(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::selectArtwork(int index)\r\n {\r\n if (index < 0 || index >= m_ArtworksList.length()) {\r\n return;\r\n }\r\n\r\n m_ArtworksList[index]->select();\r\n QModelIndex qIndex = this->index(index);\r\n emit dataChanged(qIndex, qIndex, QVector<int>() << IsSelectedRole);\r\n emit selectedArtworksCountChanged();\r\n }\r\n\r\n void CombinedArtworksModel::deselectArtwork(int index)\r\n {\r\n if (index < 0 || index >= m_ArtworksList.length()) {\r\n return;\r\n }\r\n\r\n m_ArtworksList[index]->deselect();\r\n QModelIndex qIndex = this->index(index);\r\n emit dataChanged(qIndex, qIndex, QVector<int>() << IsSelectedRole);\r\n emit selectedArtworksCountChanged();\r\n }\r\n\r\n void CombinedArtworksModel::removeSelectedArtworks()\r\n {\r\n int count = m_ArtworksList.length();\r\n QList<int> indicesToRemove;\r\n for (int i = 0; i < count; ++i) {\r\n ArtItemInfo *item = m_ArtworksList[i];\r\n if (item->isSelected()) {\r\n indicesToRemove.append(i);\r\n }\r\n }\r\n\r\n QList<QPair<int, int> > rangesToRemove;\r\n Helpers::indicesToRanges(indicesToRemove, rangesToRemove);\r\n removeItemsAtIndices(rangesToRemove);\r\n\r\n recombineArtworks();\r\n }\r\n\r\n int CombinedArtworksModel::getSelectedArtworksCount() const\r\n {\r\n int selectedCount = 0;\r\n int count = m_ArtworksList.length();\r\n for (int i = 0; i < count; ++i) {\r\n ArtItemInfo *item = m_ArtworksList[i];\r\n if (item->isSelected()) {\r\n selectedCount++;\r\n }\r\n }\r\n\r\n return selectedCount;\r\n }\r\n\r\n void CombinedArtworksModel::saveSetKeywords()\r\n {\r\n foreach (ArtItemInfo* info, m_ArtworksList) {\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n metadata->setKeywords(m_CommonKeywordsModel.getKeywords());\r\n metadata->setDescription(m_ArtworkDescription);\r\n metadata->setTitle(m_ArtworkTitle);\r\n metadata->setAuthor(m_ArtworkAuthor);\r\n metadata->saveBackup();\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::saveAddKeywords()\r\n {\r\n foreach (ArtItemInfo* info, m_ArtworksList) {\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n metadata->appendKeywords(m_CommonKeywordsModel.getKeywords());\r\n metadata->setDescription(m_ArtworkDescription);\r\n metadata->setTitle(m_ArtworkTitle);\r\n metadata->setAuthor(m_ArtworkAuthor);\r\n metadata->saveBackup();\r\n }\r\n }\r\n\r\n int CombinedArtworksModel::rowCount(const QModelIndex &parent) const\r\n {\r\n Q_UNUSED(parent);\r\n return m_ArtworksList.count();\r\n }\r\n\r\n QVariant CombinedArtworksModel::data(const QModelIndex &index, int role) const\r\n {\r\n if (index.row() < 0 || index.row() >= m_ArtworksList.count())\r\n return QVariant();\r\n\r\n ArtItemInfo *artItemInfo = m_ArtworksList.at(index.row());\r\n\r\n switch (role) {\r\n case PathRole:\r\n return artItemInfo->getOrigin()->getFilepath();\r\n case IsSelectedRole:\r\n return artItemInfo->isSelected();\r\n default:\r\n return QVariant();\r\n }\r\n }\r\n\r\n QHash<int, QByteArray> CombinedArtworksModel::roleNames() const\r\n {\r\n QHash<int, QByteArray> roles;\r\n roles[PathRole] = \"path\";\r\n roles[IsSelectedRole] = \"isselected\";\r\n return roles;\r\n }\r\n\r\n void CombinedArtworksModel::removeInnerItem(int row)\r\n {\r\n ArtItemInfo *info = m_ArtworksList[row];\r\n delete info;\r\n m_ArtworksList.removeAt(row);\r\n }\r\n}\r\n<commit_msg>Fix for replacing metadata in Save and append button. fixes #62<commit_after>\/*\r\n * This file is a part of Xpiks - cross platform application for\r\n * keywording and uploading images for microstocks\r\n * Copyright (C) 2014 Taras Kushnir <kushnirTV@gmail.com>\r\n *\r\n * Xpiks is distributed under the GNU General Public License, version 3.0\r\n *\r\n * This program is free software: you can redistribute it and\/or modify\r\n * it under the terms of the GNU General Public License as published by\r\n * the Free Software Foundation, either version 3 of the License, or\r\n * (at your option) any later version.\r\n *\r\n * This program is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r\n * GNU General Public License for more details.\r\n *\r\n * You should have received a copy of the GNU General Public License\r\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\r\n *\/\r\n\r\n#include \"combinedartworksmodel.h\"\r\n#include \"..\/Helpers\/indiceshelper.h\"\r\n\r\nnamespace Models {\r\n void CombinedArtworksModel::initArtworks(const QList<ArtItemInfo *> &artworks)\r\n {\r\n int innerLength = m_ArtworksList.length();\r\n int start = innerLength == 0 ? 0 : innerLength - 1;\r\n int paramLength = artworks.length();\r\n if (paramLength > 0) {\r\n beginInsertRows(QModelIndex(), start, start + paramLength - 1);\r\n m_ArtworksList.append(artworks);\r\n endInsertRows();\r\n }\r\n m_IsModified = false;\r\n }\r\n\r\n void CombinedArtworksModel::recombineArtworks()\r\n {\r\n bool anyItemsProcessed = false;\r\n bool descriptionsDiffer = false;\r\n bool titleDiffer = false;\r\n bool authorDiffer = false;\r\n QString description;\r\n QString title;\r\n QString author;\r\n QSet<QString> commonKeywords;\r\n\r\n int artworksCount = m_ArtworksList.length();\r\n for (int i = 0; i < artworksCount; ++i) {\r\n ArtItemInfo *info = m_ArtworksList[i];\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n\r\n if (!anyItemsProcessed) {\r\n description = metadata->getDescription();\r\n title = metadata->getTitle();\r\n author = metadata->getAuthor();\r\n commonKeywords.unite(metadata->getKeywordsSet());\r\n anyItemsProcessed = true;\r\n continue;\r\n }\r\n\r\n const QString &currDescription = metadata->getDescription();\r\n const QString &currTitle = metadata->getTitle();\r\n const QString &currAuthor = metadata->getAuthor();\r\n descriptionsDiffer = descriptionsDiffer || description != currDescription;\r\n titleDiffer = titleDiffer || title != currTitle;\r\n authorDiffer = authorDiffer || author != currAuthor;\r\n commonKeywords.intersect(metadata->getKeywordsSet());\r\n }\r\n\r\n if (artworksCount > 0) {\r\n if (descriptionsDiffer) {\r\n description = \"\";\r\n }\r\n\r\n if (titleDiffer) {\r\n title = \"\";\r\n }\r\n\r\n if (authorDiffer) {\r\n author = \"\";\r\n }\r\n\r\n initDescription(description);\r\n initTitle(title);\r\n initAuthor(author);\r\n\r\n if (!m_IsModified) {\r\n initKeywords(commonKeywords.toList());\r\n }\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::resetModelData()\r\n {\r\n beginResetModel();\r\n qDeleteAll(m_ArtworksList);\r\n m_ArtworksList.clear();\r\n endResetModel();\r\n\r\n setDescription(\"\");\r\n setAuthor(\"\");\r\n setTitle(\"\");\r\n setKeywords(QStringList());\r\n m_CommonKeywordsSet.clear();\r\n }\r\n\r\n void CombinedArtworksModel::removeKeywordAt(int keywordIndex)\r\n {\r\n QString keyword;\r\n if (m_CommonKeywordsModel.removeKeyword(keywordIndex, keyword)) {\r\n m_CommonKeywordsSet.remove(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::removeLastKeyword()\r\n {\r\n QString keyword;\r\n if (m_CommonKeywordsModel.removeLastKeyword(keyword)) {\r\n m_CommonKeywordsSet.remove(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::appendKeyword(const QString &word)\r\n {\r\n QString keyword = word.simplified();\r\n if (!m_CommonKeywordsSet.contains(keyword)) {\r\n m_CommonKeywordsModel.appendKeyword(keyword);\r\n m_CommonKeywordsSet.insert(keyword);\r\n emit keywordsCountChanged();\r\n m_IsModified = true;\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::selectArtwork(int index)\r\n {\r\n if (index < 0 || index >= m_ArtworksList.length()) {\r\n return;\r\n }\r\n\r\n m_ArtworksList[index]->select();\r\n QModelIndex qIndex = this->index(index);\r\n emit dataChanged(qIndex, qIndex, QVector<int>() << IsSelectedRole);\r\n emit selectedArtworksCountChanged();\r\n }\r\n\r\n void CombinedArtworksModel::deselectArtwork(int index)\r\n {\r\n if (index < 0 || index >= m_ArtworksList.length()) {\r\n return;\r\n }\r\n\r\n m_ArtworksList[index]->deselect();\r\n QModelIndex qIndex = this->index(index);\r\n emit dataChanged(qIndex, qIndex, QVector<int>() << IsSelectedRole);\r\n emit selectedArtworksCountChanged();\r\n }\r\n\r\n void CombinedArtworksModel::removeSelectedArtworks()\r\n {\r\n int count = m_ArtworksList.length();\r\n QList<int> indicesToRemove;\r\n for (int i = 0; i < count; ++i) {\r\n ArtItemInfo *item = m_ArtworksList[i];\r\n if (item->isSelected()) {\r\n indicesToRemove.append(i);\r\n }\r\n }\r\n\r\n QList<QPair<int, int> > rangesToRemove;\r\n Helpers::indicesToRanges(indicesToRemove, rangesToRemove);\r\n removeItemsAtIndices(rangesToRemove);\r\n\r\n recombineArtworks();\r\n }\r\n\r\n int CombinedArtworksModel::getSelectedArtworksCount() const\r\n {\r\n int selectedCount = 0;\r\n int count = m_ArtworksList.length();\r\n for (int i = 0; i < count; ++i) {\r\n ArtItemInfo *item = m_ArtworksList[i];\r\n if (item->isSelected()) {\r\n selectedCount++;\r\n }\r\n }\r\n\r\n return selectedCount;\r\n }\r\n\r\n void CombinedArtworksModel::saveSetKeywords()\r\n {\r\n foreach (ArtItemInfo* info, m_ArtworksList) {\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n metadata->setKeywords(m_CommonKeywordsModel.getKeywords());\r\n metadata->setDescription(m_ArtworkDescription);\r\n metadata->setTitle(m_ArtworkTitle);\r\n metadata->setAuthor(m_ArtworkAuthor);\r\n metadata->saveBackup();\r\n }\r\n }\r\n\r\n void CombinedArtworksModel::saveAddKeywords()\r\n {\r\n foreach (ArtItemInfo* info, m_ArtworksList) {\r\n ArtworkMetadata *metadata = info->getOrigin();\r\n metadata->appendKeywords(m_CommonKeywordsModel.getKeywords());\r\n\r\n if (!m_ArtworkDescription.isEmpty()) {\r\n metadata->setDescription(m_ArtworkDescription);\r\n }\r\n\r\n if (!m_ArtworkTitle.isEmpty()) {\r\n metadata->setTitle(m_ArtworkTitle);\r\n }\r\n\r\n if (!m_ArtworkAuthor.isEmpty()) {\r\n metadata->setAuthor(m_ArtworkAuthor);\r\n }\r\n\r\n metadata->saveBackup();\r\n }\r\n }\r\n\r\n int CombinedArtworksModel::rowCount(const QModelIndex &parent) const\r\n {\r\n Q_UNUSED(parent);\r\n return m_ArtworksList.count();\r\n }\r\n\r\n QVariant CombinedArtworksModel::data(const QModelIndex &index, int role) const\r\n {\r\n if (index.row() < 0 || index.row() >= m_ArtworksList.count())\r\n return QVariant();\r\n\r\n ArtItemInfo *artItemInfo = m_ArtworksList.at(index.row());\r\n\r\n switch (role) {\r\n case PathRole:\r\n return artItemInfo->getOrigin()->getFilepath();\r\n case IsSelectedRole:\r\n return artItemInfo->isSelected();\r\n default:\r\n return QVariant();\r\n }\r\n }\r\n\r\n QHash<int, QByteArray> CombinedArtworksModel::roleNames() const\r\n {\r\n QHash<int, QByteArray> roles;\r\n roles[PathRole] = \"path\";\r\n roles[IsSelectedRole] = \"isselected\";\r\n return roles;\r\n }\r\n\r\n void CombinedArtworksModel::removeInnerItem(int row)\r\n {\r\n ArtItemInfo *info = m_ArtworksList[row];\r\n delete info;\r\n m_ArtworksList.removeAt(row);\r\n }\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include \"Test.h\"\n#include \"SkColor.h\"\n#include \"SkXfermode.h\"\n\nSkPMColor bogusXfermodeProc(SkPMColor src, SkPMColor dst) {\n return 42;\n}\n\n#define ILLEGAL_MODE ((SkXfermode::Mode)-1)\n\nstatic void test_asMode(skiatest::Reporter* reporter) {\n for (int mode = 0; mode <= SkXfermode::kLastMode; mode++) {\n SkXfermode* xfer = SkXfermode::Create((SkXfermode::Mode) mode);\n\n SkXfermode::Mode reportedMode = ILLEGAL_MODE;\n REPORTER_ASSERT(reporter, reportedMode != mode);\n\n \/\/ test IsMode\n REPORTER_ASSERT(reporter, SkXfermode::IsMode(xfer, &reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == mode);\n\n \/\/ repeat that test, but with asMode instead\n if (xfer) {\n reportedMode = (SkXfermode::Mode) -1;\n REPORTER_ASSERT(reporter, xfer->asMode(&reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == mode);\n xfer->unref();\n } else {\n REPORTER_ASSERT(reporter, SkXfermode::kSrcOver_Mode == mode); \n }\n }\n\n SkXfermode* bogusXfer = new SkProcXfermode(bogusXfermodeProc);\n SkXfermode::Mode reportedMode = (SkXfermode::Mode) -1;\n REPORTER_ASSERT(reporter, !bogusXfer->asMode(&reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == -1);\n REPORTER_ASSERT(reporter, !SkXfermode::IsMode(bogusXfer, &reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == -1);\n bogusXfer->unref();\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Xfermode\", XfermodeTestClass, test_asMode)\n<commit_msg>add test for IsMode<commit_after>\n\/*\n * Copyright 2011 Google Inc.\n *\n * Use of this source code is governed by a BSD-style license that can be\n * found in the LICENSE file.\n *\/\n#include \"Test.h\"\n#include \"SkColor.h\"\n#include \"SkXfermode.h\"\n\nSkPMColor bogusXfermodeProc(SkPMColor src, SkPMColor dst) {\n return 42;\n}\n\n#define ILLEGAL_MODE ((SkXfermode::Mode)-1)\n\nstatic void test_asMode(skiatest::Reporter* reporter) {\n for (int mode = 0; mode <= SkXfermode::kLastMode; mode++) {\n SkXfermode* xfer = SkXfermode::Create((SkXfermode::Mode) mode);\n\n SkXfermode::Mode reportedMode = ILLEGAL_MODE;\n REPORTER_ASSERT(reporter, reportedMode != mode);\n\n \/\/ test IsMode\n REPORTER_ASSERT(reporter, SkXfermode::IsMode(xfer, &reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == mode);\n\n \/\/ repeat that test, but with asMode instead\n if (xfer) {\n reportedMode = (SkXfermode::Mode) -1;\n REPORTER_ASSERT(reporter, xfer->asMode(&reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == mode);\n xfer->unref();\n } else {\n REPORTER_ASSERT(reporter, SkXfermode::kSrcOver_Mode == mode); \n }\n }\n\n SkXfermode* bogusXfer = new SkProcXfermode(bogusXfermodeProc);\n SkXfermode::Mode reportedMode = (SkXfermode::Mode) -1;\n REPORTER_ASSERT(reporter, !bogusXfer->asMode(&reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == -1);\n REPORTER_ASSERT(reporter, !SkXfermode::IsMode(bogusXfer, &reportedMode));\n REPORTER_ASSERT(reporter, reportedMode == -1);\n bogusXfer->unref();\n}\n\nstatic void test_IsMode(skiatest::Reporter* reporter) {\n REPORTER_ASSERT(reporter, SkXfermode::IsMode(NULL,\n SkXfermode::kSrcOver_Mode));\n\n for (int i = 0; i <= SkXfermode::kLastMode; ++i) {\n SkXfermode::Mode mode = (SkXfermode::Mode)i;\n \n SkXfermode* xfer = SkXfermode::Create(mode);\n REPORTER_ASSERT(reporter, SkXfermode::IsMode(xfer, mode));\n SkSafeUnref(xfer);\n\n if (SkXfermode::kSrcOver_Mode != mode) {\n REPORTER_ASSERT(reporter, !SkXfermode::IsMode(NULL, mode));\n }\n }\n}\n\nstatic void test_xfermodes(skiatest::Reporter* reporter) {\n test_asMode(reporter);\n test_IsMode(reporter);\n}\n\n#include \"TestClassDef.h\"\nDEFINE_TESTCLASS(\"Xfermode\", XfermodeTestClass, test_xfermodes)\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Copyright (c) 2017 Kimball Thurston\n\/\/ All rights reserved.\n\/\/ Copyrights licenced under the MIT License.\n\/\/ See the accompanying LICENSE.txt file for terms\n\/\/\n\n#include <base\/contract.h>\n#include <base\/unit_test.h>\n#include <base\/semaphore.h>\n#include <base\/shared_mutex.h>\n#include <base\/event.h>\n#include <iostream>\n#ifndef _WIN32\n# include <signal.h>\n#endif\n#include <thread>\n#include <atomic>\n\nnamespace\n{\n\ntemplate <typename T>\nstruct sem_test_struct\n{\n\tstatic std::atomic<int> cnt;\n\n\tusing sem_type = T;\n\tstatic void thread_counter( sem_type &s )\n\t{\n\t\tfor ( int i = 0; i < 10000; ++i )\n\t\t{\n\t\t\tstd::this_thread::yield();\n\t\t\ts.signal();\n\t\t\tstd::this_thread::yield();\n\t\t}\n\t}\n\n\tstatic void thread_bump1( sem_type &s )\n\t{\n\t\twhile ( true )\n\t\t{\n\t\t\ts.wait();\n\t\t\tif ( cnt == 10000 )\n\t\t\t\tbreak;\n\t\t\t++cnt;\n\t\t}\n\t}\n};\n\ntemplate <typename T>\nstd::atomic<int> sem_test_struct<T>::cnt;\n\nstatic int shareCount = 0;\nvoid shared_writer( base::shared_mutex &m )\n{\n\twhile ( true )\n\t{\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tstd::unique_lock<base::shared_mutex> lk( m );\n\t\t\t++shareCount;\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t}\n}\n\nvoid shared_reader( base::shared_mutex &m )\n{\n\twhile ( true )\n\t{\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tbase::shared_lock_guard<base::shared_mutex> lk( m );\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tbase::shared_lock<base::shared_mutex> lk( m );\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t}\n}\n\nvoid ev_1( base::event &e1, base::event &e2 )\n{\n\tstd::cout << \"ev_1 waiting e1\" << std::endl;\n\te1.wait();\n\tstd::cout << \"ev_1 lower e1\" << std::endl;\n\te1.lower();\n\tstd::cout << \"ev_1 raise e2\" << std::endl;\n\te2.raise();\n\tstd::cout << \"ev_1 waiting e1\" << std::endl;\n\te1.wait();\n\tstd::cout << \"ev_1 done\" << std::endl;\n}\n\nvoid ev_2( base::event &e1, base::event &e2 )\n{\n\tstd::cout << \"ev_2 raising e1\" << std::endl;\n\te1.raise();\n\tstd::cout << \"ev_2 waiting e2\" << std::endl;\n\te2.wait();\n\tstd::cout << \"ev_2 lower e2\" << std::endl;\n\te2.lower();\n\tstd::cout << \"ev_2 raise e1\" << std::endl;\n\te1.raise();\n\tstd::cout << \"ev_2 done\" << std::endl;\n}\n\nvoid auto_e1( base::auto_reset_event &e1, base::auto_reset_event &e2 )\n{\n\/\/\tstd::cout << \"auto_e1 wait\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"auto_e1 set e2\" << std::endl;\n\te2.set();\n\/\/\tstd::cout << \"auto_e1 wait e1\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"auto_e1 done\" << std::endl;\n}\n\nvoid auto_e2( base::auto_reset_event &e1, base::auto_reset_event &e2 )\n{\n\/\/\tstd::cout << \"auto_e2 set e1\" << std::endl;\n\te1.set();\n\/\/\tstd::cout << \"auto_e2 wait\" << std::endl;\n\te2.wait();\n\/\/\tstd::cout << \"auto_e2 set e1\" << std::endl;\n\te1.set();\n\/\/\tstd::cout << \"auto_e2 done\" << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint safemain( int argc, char *argv[] )\n{\n\tbase::unit_test test( \"locking\" );\n\n\tbase::cmd_line options( argv[0] );\n\ttest.setup( options );\n\n#ifndef _WIN32\n\tsignal( SIGPIPE, SIG_IGN );\n#endif\n\ttry\n\t{\n\t\toptions.parse( argc, argv );\n\t}\n\tcatch ( ... )\n\t{\n\t\tthrow_add( \"parsing command line arguments\" );\n\t}\n\n\ttest[\"simple_semaphore\"] = [&]( void )\n\t{\n\t\tbase::simple_semaphore s;\n\t\tusing stest = sem_test_struct<base::simple_semaphore>;\n\t\tstest::cnt = int(0);\n\t\tstd::thread t1( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t2( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t3( stest::thread_counter, std::ref( s ) );\n\t\tt3.join();\n\t\ts.signal( 2 );\n\t\tt1.join();\n\t\tt2.join();\n\n\t\tif ( stest::cnt == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"semaphore\"] = [&]( void )\n\t{\n\t\tbase::semaphore s;\n\t\tusing stest = sem_test_struct<base::semaphore>;\n\t\tstest::cnt = int(0);\n\t\tstd::thread t1( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t2( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t3( stest::thread_counter, std::ref( s ) );\n\t\tt3.join();\n\t\ts.signal( 2 );\n\t\tt1.join();\n\t\tt2.join();\n\n\t\tif ( stest::cnt == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"shared_mutex\"] = [&]( void )\n\t{\n\t\tbase::shared_mutex m;\n\t\tstd::thread t1( &shared_reader, std::ref( m ) );\n\t\tstd::thread t2( &shared_reader, std::ref( m ) );\n\t\tstd::thread t3( &shared_writer, std::ref( m ) );\n\t\tt3.join();\n\t\tt2.join();\n\t\tt1.join();\n\n\t\tif ( shareCount == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"event\"] = [&]( void )\n\t{\n\t\tbase::event e1, e2;\n\t\tstd::thread t1( &ev_1, std::ref( e1 ), std::ref( e2 ) );\n\t\tstd::thread t2( &ev_2, std::ref( e1 ), std::ref( e2 ) );\n\t\tt2.join();\n\t\tt1.join();\n\n\t\ttest.success( \"success\" );\n\t};\n\n\ttest[\"auto_reset_event\"] = [&]( void )\n\t{\n\t\tbase::auto_reset_event e1, e2;\n\t\tstd::thread t1( &auto_e1, std::ref( e1 ), std::ref( e2 ) );\n\t\tstd::thread t2( &auto_e2, std::ref( e1 ), std::ref( e2 ) );\n\t\tt2.join();\n\t\tt1.join();\n\n\t\ttest.success( \"success\" );\n\t};\n\n\ttest.run( options );\n\ttest.clean();\n\n\treturn - static_cast<int>( test.failure_count() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nint main( int argc, char *argv[] )\n{\n\ttry\n\t{\n\t\treturn safemain( argc, argv );\n\t}\n\tcatch ( const std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n\treturn -1;\n}\n<commit_msg>remove debug prints<commit_after>\/\/\n\/\/ Copyright (c) 2017 Kimball Thurston\n\/\/ All rights reserved.\n\/\/ Copyrights licenced under the MIT License.\n\/\/ See the accompanying LICENSE.txt file for terms\n\/\/\n\n#include <base\/contract.h>\n#include <base\/unit_test.h>\n#include <base\/semaphore.h>\n#include <base\/shared_mutex.h>\n#include <base\/event.h>\n#include <iostream>\n#ifndef _WIN32\n# include <signal.h>\n#endif\n#include <thread>\n#include <atomic>\n\nnamespace\n{\n\ntemplate <typename T>\nstruct sem_test_struct\n{\n\tstatic std::atomic<int> cnt;\n\n\tusing sem_type = T;\n\tstatic void thread_counter( sem_type &s )\n\t{\n\t\tfor ( int i = 0; i < 10000; ++i )\n\t\t{\n\t\t\tstd::this_thread::yield();\n\t\t\ts.signal();\n\t\t\tstd::this_thread::yield();\n\t\t}\n\t}\n\n\tstatic void thread_bump1( sem_type &s )\n\t{\n\t\twhile ( true )\n\t\t{\n\t\t\ts.wait();\n\t\t\tif ( cnt == 10000 )\n\t\t\t\tbreak;\n\t\t\t++cnt;\n\t\t}\n\t}\n};\n\ntemplate <typename T>\nstd::atomic<int> sem_test_struct<T>::cnt;\n\nstatic int shareCount = 0;\nvoid shared_writer( base::shared_mutex &m )\n{\n\twhile ( true )\n\t{\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tstd::unique_lock<base::shared_mutex> lk( m );\n\t\t\t++shareCount;\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t}\n}\n\nvoid shared_reader( base::shared_mutex &m )\n{\n\twhile ( true )\n\t{\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tbase::shared_lock_guard<base::shared_mutex> lk( m );\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t\t{\n\t\t\tbase::shared_lock<base::shared_mutex> lk( m );\n\t\t\tif ( shareCount == 10000 )\n\t\t\t\tbreak;\n\t\t}\n\t\tstd::this_thread::yield();\n\t}\n}\n\nvoid ev_1( base::event &e1, base::event &e2 )\n{\n\/\/\tstd::cout << \"ev_1 waiting e1\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"ev_1 lower e1\" << std::endl;\n\te1.lower();\n\/\/\tstd::cout << \"ev_1 raise e2\" << std::endl;\n\te2.raise();\n\/\/\tstd::cout << \"ev_1 waiting e1\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"ev_1 done\" << std::endl;\n}\n\nvoid ev_2( base::event &e1, base::event &e2 )\n{\n\/\/\tstd::cout << \"ev_2 raising e1\" << std::endl;\n\te1.raise();\n\/\/\tstd::cout << \"ev_2 waiting e2\" << std::endl;\n\te2.wait();\n\/\/\tstd::cout << \"ev_2 lower e2\" << std::endl;\n\te2.lower();\n\/\/\tstd::cout << \"ev_2 raise e1\" << std::endl;\n\te1.raise();\n\/\/\tstd::cout << \"ev_2 done\" << std::endl;\n}\n\nvoid auto_e1( base::auto_reset_event &e1, base::auto_reset_event &e2 )\n{\n\/\/\tstd::cout << \"auto_e1 wait\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"auto_e1 set e2\" << std::endl;\n\te2.set();\n\/\/\tstd::cout << \"auto_e1 wait e1\" << std::endl;\n\te1.wait();\n\/\/\tstd::cout << \"auto_e1 done\" << std::endl;\n}\n\nvoid auto_e2( base::auto_reset_event &e1, base::auto_reset_event &e2 )\n{\n\/\/\tstd::cout << \"auto_e2 set e1\" << std::endl;\n\te1.set();\n\/\/\tstd::cout << \"auto_e2 wait\" << std::endl;\n\te2.wait();\n\/\/\tstd::cout << \"auto_e2 set e1\" << std::endl;\n\te1.set();\n\/\/\tstd::cout << \"auto_e2 done\" << std::endl;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint safemain( int argc, char *argv[] )\n{\n\tbase::unit_test test( \"locking\" );\n\n\tbase::cmd_line options( argv[0] );\n\ttest.setup( options );\n\n#ifndef _WIN32\n\tsignal( SIGPIPE, SIG_IGN );\n#endif\n\ttry\n\t{\n\t\toptions.parse( argc, argv );\n\t}\n\tcatch ( ... )\n\t{\n\t\tthrow_add( \"parsing command line arguments\" );\n\t}\n\n\ttest[\"simple_semaphore\"] = [&]( void )\n\t{\n\t\tbase::simple_semaphore s;\n\t\tusing stest = sem_test_struct<base::simple_semaphore>;\n\t\tstest::cnt = int(0);\n\t\tstd::thread t1( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t2( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t3( stest::thread_counter, std::ref( s ) );\n\t\tt3.join();\n\t\ts.signal( 2 );\n\t\tt1.join();\n\t\tt2.join();\n\n\t\tif ( stest::cnt == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"semaphore\"] = [&]( void )\n\t{\n\t\tbase::semaphore s;\n\t\tusing stest = sem_test_struct<base::semaphore>;\n\t\tstest::cnt = int(0);\n\t\tstd::thread t1( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t2( stest::thread_bump1, std::ref( s ) );\n\t\tstd::thread t3( stest::thread_counter, std::ref( s ) );\n\t\tt3.join();\n\t\ts.signal( 2 );\n\t\tt1.join();\n\t\tt2.join();\n\n\t\tif ( stest::cnt == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"shared_mutex\"] = [&]( void )\n\t{\n\t\tbase::shared_mutex m;\n\t\tstd::thread t1( &shared_reader, std::ref( m ) );\n\t\tstd::thread t2( &shared_reader, std::ref( m ) );\n\t\tstd::thread t3( &shared_writer, std::ref( m ) );\n\t\tt3.join();\n\t\tt2.join();\n\t\tt1.join();\n\n\t\tif ( shareCount == 10000 )\n\t\t\ttest.success( \"success\" );\n\t\telse\n\t\t\ttest.failure( \"did not bump 10000 times\" );\n\t};\n\n\ttest[\"event\"] = [&]( void )\n\t{\n\t\tbase::event e1, e2;\n\t\tstd::thread t1( &ev_1, std::ref( e1 ), std::ref( e2 ) );\n\t\tstd::thread t2( &ev_2, std::ref( e1 ), std::ref( e2 ) );\n\t\tt2.join();\n\t\tt1.join();\n\n\t\ttest.success( \"success\" );\n\t};\n\n\ttest[\"auto_reset_event\"] = [&]( void )\n\t{\n\t\tbase::auto_reset_event e1, e2;\n\t\tstd::thread t1( &auto_e1, std::ref( e1 ), std::ref( e2 ) );\n\t\tstd::thread t2( &auto_e2, std::ref( e1 ), std::ref( e2 ) );\n\t\tt2.join();\n\t\tt1.join();\n\n\t\ttest.success( \"success\" );\n\t};\n\n\ttest.run( options );\n\ttest.clean();\n\n\treturn - static_cast<int>( test.failure_count() );\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n}\n\nint main( int argc, char *argv[] )\n{\n\ttry\n\t{\n\t\treturn safemain( argc, argv );\n\t}\n\tcatch ( const std::exception &e )\n\t{\n\t\tbase::print_exception( std::cerr, e );\n\t}\n\treturn -1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"object_manipulation_actions\/actionExecutorArmToFront.h\"\n#include <pluginlib\/class_list_macros.h>\n#include <tidyup_utils\/stringutil.h>\n#include <tidyup_utils\/get_pose_stamped_from_param.h>\n#include <symbolic_planning_utils\/moveGroupInterface.h>\n\n#include <pluginlib\/class_loader.h>\n#include <ros\/ros.h>\n\/\/ MoveIt!\n#include <moveit\/move_group_interface\/move_group.h>\n#include <tf\/transform_listener.h>\n#include <istream>\n#include <ostream>\n#include <fstream>\n\nPLUGINLIB_EXPORT_CLASS(object_manipulation_actions::ActionExecutorArmToFront, continual_planning_executive::ActionExecutorInterface)\n\nnamespace object_manipulation_actions\n{\n\n\tvoid ActionExecutorArmToFront::initialize(const std::deque<std::string> & arguments)\n\t{\n\t\tROS_ASSERT(arguments.size() == 3);\n\n\t\tactionName_ \t\t\t\t = arguments[0]; \t\t\/\/ arm-to-front\n\t\trosparam_right_arm_to_front_ = arguments[1];\t\t\/\/ right_arm_to_front\n\t\trosparam_left_arm_to_front_ = arguments[2];\t\t\/\/ left_arm_to_front\n\n\t\tros::NodeHandle n;\n\t\tpub_pose_ = n.advertise<geometry_msgs::PoseStamped>(\"arm_to_front\", 10, true);\n\t}\n\n\tbool ActionExecutorArmToFront::canExecute(const DurativeAction & a, const SymbolicState & currentState) const\n\t{\n\t return a.name == actionName_;\n\t}\n\n\tbool ActionExecutorArmToFront::executeBlocking(const DurativeAction & a, SymbolicState & currentState)\n\t{\n\t\t\/\/ DEFAULT_RIGHT_ARM_INSPECT_POSE = PoseStamped(Header(frame_id='\/head_mount_kinect_rgb_link'),Pose(Point(0.48, -0.2, 0.0), Quaternion(-0.037, -0.031, 0.609, 0.792)))\n\t\t\/\/ DEFAULT_LEFT_ARM_INSPECT_POSE = PoseStamped(Header(frame_id='\/head_mount_kinect_rgb_link'),Pose(Point(0.48, 0.2, 0.0), Quaternion(-0.073, -0.047, -0.669, 0.738)))\n\n\t\tROS_ASSERT(a.parameters.size() == 1);\n\t\tmoveit::planning_interface::MoveGroup* arm_group;\n\t\tmoveit::planning_interface::MoveItErrorCode error_code;\n\t\tgeometry_msgs::PoseStamped pose;\n\t\tpose.header.frame_id = \"head_mount_kinect_rgb_link\";\n\t\tpose.header.stamp = ros::Time::now();\n\n\t\tif (StringUtil::startsWith(a.parameters[0], \"left_\"))\n\t\t{\n\t\t\tarm_group = symbolic_planning_utils::MoveGroupInterface::getInstance()->getLeftArmGroup();\n\t\t\tif (!tidyup_utils::getPoseStampedFromParam(rosparam_left_arm_to_front_, pose))\n\t\t\t{\n\t\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Could not load arm configuration from param!\", __func__);\n\t\t\t\tpose.pose.position.x = 0.48;\n\t\t\t\t\/\/ distance from tool_frame to end_effector link - could be read from tf, but it is a fixed distance\n\t\t\t\tpose.pose.position.y = 0.2;\n\t\t\t\tpose.pose.position.z = 0.0;\n\n\t\t\t\ttf::Quaternion tf_q;\n\t\t\t\ttf_q.setRPY(0, 0, -M_PI\/2);\n\t\t\t\ttf::quaternionTFToMsg(tf_q, pose.pose.orientation);\n\t\t\t}\n\t\t}\n\t\telse if (StringUtil::startsWith(a.parameters[0], \"right_\"))\n\t\t{\n\t\t\tarm_group = symbolic_planning_utils::MoveGroupInterface::getInstance()->getRightArmGroup();\n\t\t\tif (!tidyup_utils::getPoseStampedFromParam(rosparam_right_arm_to_front_, pose))\n\t\t\t{\n\t\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Could not load arm configuration from param!\", __func__);\n\t\t\t\tpose.pose.position.x = 0.48;\n\t\t\t\tpose.pose.position.y = -0.2;\n\t\t\t\tpose.pose.position.z = 0;\n\n\t\t\t\ttf::Quaternion tf_q;\n\t\t\t\tgeometry_msgs::Quaternion geo_q;\n\t\t\t\ttf_q.setRPY(0, 0, M_PI\/2);\n\t\t\t\ttf::quaternionTFToMsg(tf_q, pose.pose.orientation);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tROS_ERROR(\"ActionExecutorArmToFront::%s: Wrong input from action!\", __func__);\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ for debug purposes\n\t\tROS_INFO(\"ActionExecutorArmToFront::%s: Pose published on topic: %s\", __func__, pub_pose_.getTopic().c_str());\n\t\tpub_pose_.publish(pose);\n\t\t\/\/ ROS_INFO_STREAM(\"ActionExecutorArmToFront::\" << __func__ << \": Pose: \" << pose);\n\n\t\terror_code = executeArmToFront(arm_group, pose);\n\t\treturn error_code == moveit::planning_interface::MoveItErrorCode::SUCCESS;\n\t}\n\n\tvoid ActionExecutorArmToFront::cancelAction()\n\t{\n\n\t}\n\n\tmoveit::planning_interface::MoveItErrorCode ActionExecutorArmToFront::executeArmToFront(\n\t\t\tmoveit::planning_interface::MoveGroup* group,\n\t\t\tconst geometry_msgs::PoseStamped& pose)\n\t{\n\t\t\/\/ Set hard coded pose as target\n\t\tif (!group->setPoseTarget(pose))\n\t\t{\n\t\t\tROS_ERROR(\"ActionExecutorArmToFront::%s: Could not set pose target. \\n\", __func__);\n\t\t\treturn moveit::planning_interface::MoveItErrorCode::FAILURE;\n\t\t}\n\n\t\tmoveit::planning_interface::MoveItErrorCode error_code;\n\t\t\/\/ Call the planner to compute a plan.\n\t\t\/\/ Note that we are just planning, not asking move_group\n\t\t\/\/ to actually move the robot.\n\t\tmoveit::planning_interface::MoveGroup::Plan my_plan;\n\t\tROS_DEBUG(\"ActionExecutorArmToFront::%s: planning arm motion...\", __func__);\n\n error_code = group->plan(my_plan);\n\t\tif (error_code != moveit::planning_interface::MoveItErrorCode::SUCCESS)\n\t\t{\n\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Ups, something with arm motion planning went wrong.\\n\"\n\t\t\t\t\t\"Verify that head is inclined - pointing downwards, otherwise pose is not reachable with arm.\", __func__);\n\t\t\treturn error_code;\n\t\t}\n\n\t\t\/\/ planning was successful\n\t\tROS_DEBUG(\"ActionExecutorArmToFront::%s: executing arm motion...\", __func__);\n\t\terror_code = group->execute(my_plan);\n\t\tif (error_code != moveit::planning_interface::MoveItErrorCode::SUCCESS)\n\t\t{\n\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Ups, something with arm motion execution went wrong.\\n\"\n\t\t\t\t\t\"Verify that head is inclined - pointing downwards, otherwise pose is not reachable with arm.\", __func__);\n\t\t\treturn error_code;\n\t\t}\n\n\t\treturn error_code;\n\t}\n};\n\n<commit_msg>increased planning time<commit_after>#include \"object_manipulation_actions\/actionExecutorArmToFront.h\"\n#include <pluginlib\/class_list_macros.h>\n#include <tidyup_utils\/stringutil.h>\n#include <tidyup_utils\/get_pose_stamped_from_param.h>\n#include <symbolic_planning_utils\/moveGroupInterface.h>\n\n#include <pluginlib\/class_loader.h>\n#include <ros\/ros.h>\n\/\/ MoveIt!\n#include <moveit\/move_group_interface\/move_group.h>\n#include <tf\/transform_listener.h>\n#include <istream>\n#include <ostream>\n#include <fstream>\n\nPLUGINLIB_EXPORT_CLASS(object_manipulation_actions::ActionExecutorArmToFront, continual_planning_executive::ActionExecutorInterface)\n\nnamespace object_manipulation_actions\n{\n\n\tvoid ActionExecutorArmToFront::initialize(const std::deque<std::string> & arguments)\n\t{\n\t\tROS_ASSERT(arguments.size() == 3);\n\n\t\tactionName_ \t\t\t\t = arguments[0]; \t\t\/\/ arm-to-front\n\t\trosparam_right_arm_to_front_ = arguments[1];\t\t\/\/ right_arm_to_front\n\t\trosparam_left_arm_to_front_ = arguments[2];\t\t\/\/ left_arm_to_front\n\n\t\tros::NodeHandle n;\n\t\tpub_pose_ = n.advertise<geometry_msgs::PoseStamped>(\"arm_to_front\", 10, true);\n\t}\n\n\tbool ActionExecutorArmToFront::canExecute(const DurativeAction & a, const SymbolicState & currentState) const\n\t{\n\t return a.name == actionName_;\n\t}\n\n\tbool ActionExecutorArmToFront::executeBlocking(const DurativeAction & a, SymbolicState & currentState)\n\t{\n\t\t\/\/ DEFAULT_RIGHT_ARM_INSPECT_POSE = PoseStamped(Header(frame_id='\/head_mount_kinect_rgb_link'),Pose(Point(0.48, -0.2, 0.0), Quaternion(-0.037, -0.031, 0.609, 0.792)))\n\t\t\/\/ DEFAULT_LEFT_ARM_INSPECT_POSE = PoseStamped(Header(frame_id='\/head_mount_kinect_rgb_link'),Pose(Point(0.48, 0.2, 0.0), Quaternion(-0.073, -0.047, -0.669, 0.738)))\n\n\t\tROS_ASSERT(a.parameters.size() == 1);\n\t\tmoveit::planning_interface::MoveGroup* arm_group;\n\t\tmoveit::planning_interface::MoveItErrorCode error_code;\n\t\tgeometry_msgs::PoseStamped pose;\n\t\tpose.header.frame_id = \"head_mount_kinect_rgb_link\";\n\t\tpose.header.stamp = ros::Time::now();\n\n\t\tif (StringUtil::startsWith(a.parameters[0], \"left_\"))\n\t\t{\n\t\t\tarm_group = symbolic_planning_utils::MoveGroupInterface::getInstance()->getLeftArmGroup();\n\t\t\tif (!tidyup_utils::getPoseStampedFromParam(rosparam_left_arm_to_front_, pose))\n\t\t\t{\n\t\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Could not load arm configuration from param!\", __func__);\n\t\t\t\tpose.pose.position.x = 0.48;\n\t\t\t\t\/\/ distance from tool_frame to end_effector link - could be read from tf, but it is a fixed distance\n\t\t\t\tpose.pose.position.y = 0.2;\n\t\t\t\tpose.pose.position.z = 0.0;\n\n\t\t\t\ttf::Quaternion tf_q;\n\t\t\t\ttf_q.setRPY(0, 0, -M_PI\/2);\n\t\t\t\ttf::quaternionTFToMsg(tf_q, pose.pose.orientation);\n\t\t\t}\n\t\t}\n\t\telse if (StringUtil::startsWith(a.parameters[0], \"right_\"))\n\t\t{\n\t\t\tarm_group = symbolic_planning_utils::MoveGroupInterface::getInstance()->getRightArmGroup();\n\t\t\tif (!tidyup_utils::getPoseStampedFromParam(rosparam_right_arm_to_front_, pose))\n\t\t\t{\n\t\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Could not load arm configuration from param!\", __func__);\n\t\t\t\tpose.pose.position.x = 0.48;\n\t\t\t\tpose.pose.position.y = -0.2;\n\t\t\t\tpose.pose.position.z = 0;\n\n\t\t\t\ttf::Quaternion tf_q;\n\t\t\t\tgeometry_msgs::Quaternion geo_q;\n\t\t\t\ttf_q.setRPY(0, 0, M_PI\/2);\n\t\t\t\ttf::quaternionTFToMsg(tf_q, pose.pose.orientation);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tROS_ERROR(\"ActionExecutorArmToFront::%s: Wrong input from action!\", __func__);\n\t\t\treturn false;\n\t\t}\n\n\t\t\/\/ for debug purposes\n\t\tROS_INFO(\"ActionExecutorArmToFront::%s: Pose published on topic: %s\", __func__, pub_pose_.getTopic().c_str());\n\t\tpub_pose_.publish(pose);\n\t\t\/\/ ROS_INFO_STREAM(\"ActionExecutorArmToFront::\" << __func__ << \": Pose: \" << pose);\n\n\t\tarm_group->setGoalPositionTolerance(0.01);\n\t\tarm_group->setGoalOrientationTolerance(0.01);\n\t\tarm_group->setPlanningTime(10);\n\t\tarm_group->setNumPlanningAttempts(100);\n\t\terror_code = executeArmToFront(arm_group, pose);\n\t\treturn error_code == moveit::planning_interface::MoveItErrorCode::SUCCESS;\n\t}\n\n\tvoid ActionExecutorArmToFront::cancelAction()\n\t{\n\n\t}\n\n\tmoveit::planning_interface::MoveItErrorCode ActionExecutorArmToFront::executeArmToFront(\n\t\t\tmoveit::planning_interface::MoveGroup* group,\n\t\t\tconst geometry_msgs::PoseStamped& pose)\n\t{\n\t\t\/\/ Set hard coded pose as target\n\t\tif (!group->setPoseTarget(pose))\n\t\t{\n\t\t\tROS_ERROR(\"ActionExecutorArmToFront::%s: Could not set pose target. \\n\", __func__);\n\t\t\treturn moveit::planning_interface::MoveItErrorCode::FAILURE;\n\t\t}\n\n\t\tmoveit::planning_interface::MoveItErrorCode error_code;\n\t\t\/\/ Call the planner to compute a plan.\n\t\t\/\/ Note that we are just planning, not asking move_group\n\t\t\/\/ to actually move the robot.\n\t\tmoveit::planning_interface::MoveGroup::Plan my_plan;\n\t\tROS_DEBUG(\"ActionExecutorArmToFront::%s: planning arm motion...\", __func__);\n\n error_code = group->plan(my_plan);\n\t\tif (error_code != moveit::planning_interface::MoveItErrorCode::SUCCESS)\n\t\t{\n\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Ups, something with arm motion planning went wrong.\\n\"\n\t\t\t\t\t\"Verify that head is inclined - pointing downwards, otherwise pose is not reachable with arm.\", __func__);\n\t\t\treturn error_code;\n\t\t}\n\n\t\t\/\/ planning was successful\n\t\tROS_DEBUG(\"ActionExecutorArmToFront::%s: executing arm motion...\", __func__);\n\t\terror_code = group->execute(my_plan);\n\t\tif (error_code != moveit::planning_interface::MoveItErrorCode::SUCCESS)\n\t\t{\n\t\t\tROS_WARN(\"ActionExecutorArmToFront::%s: Ups, something with arm motion execution went wrong.\\n\"\n\t\t\t\t\t\"Verify that head is inclined - pointing downwards, otherwise pose is not reachable with arm.\", __func__);\n\t\t\treturn error_code;\n\t\t}\n\n\t\treturn error_code;\n\t}\n};\n\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include <NormLPQ.h>\n#include <ModuleFactories.h>\n\nclass TestEdgeFavouringMask : public ::testing::Test {\nprotected:\n Reseedable n1_1;\n Reseedable n1_2;\n\n Reseedable n2_1;\n Reseedable n2_2;\n\n Reseedable n05_1;\n Reseedable n05_05;\n\n Reseedable n2_1_05;\n\n TestEdgeFavouringMask() :\n n1_1(makeEdgeFavouringMask(1)),\n n1_2(makeEdgeFavouringMask(1, 2)),\n n2_1(makeEdgeFavouringMask(2, 1)),\n n2_2(makeEdgeFavouringMask(2, 2)),\n n05_1(makeEdgeFavouringMask(0.5, 1)),\n n05_05(makeEdgeFavouringMask(0.5, 0.5)),\n n2_1_05(makeEdgeFavouringMask(2, 1, 0.5))\n {\n\n };\n ~TestEdgeFavouringMask() {};\n};\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask1_1)\n{\n EXPECT_EQ(0., n1_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask1_2)\n{\n EXPECT_EQ(0., n1_2.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n1_2.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n1_2.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(1., n1_2.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_1)\n{\n EXPECT_EQ(0., n2_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(sqrt(0.5), n2_1.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_2)\n{\n EXPECT_EQ(0., n2_2.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_2.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_2.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(0.5, n2_2.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask05_1)\n{\n EXPECT_EQ(0., n05_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask05_05)\n{\n EXPECT_EQ(0., n05_05.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_1_05)\n{\n EXPECT_NEAR(0.5, n2_1_05.module->GetValue(0.5, 0.5, 0.5), 0.0001) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(0.5 + sqrt(0.125), n2_1_05.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}<commit_msg>Update EdgeFavouringMask tests with correct values<commit_after>#include <gtest\/gtest.h>\n#include <NormLPQ.h>\n#include <ModuleFactories.h>\n\nclass TestEdgeFavouringMask : public ::testing::Test {\nprotected:\n Reseedable n1_1;\n Reseedable n1_2;\n\n Reseedable n2_1;\n Reseedable n2_2;\n\n Reseedable n05_1;\n Reseedable n05_05;\n\n Reseedable n2_1_05;\n\n TestEdgeFavouringMask() :\n n1_1(makeEdgeFavouringMask(1)),\n n1_2(makeEdgeFavouringMask(1, 2)),\n n2_1(makeEdgeFavouringMask(2, 1)),\n n2_2(makeEdgeFavouringMask(2, 2)),\n n05_1(makeEdgeFavouringMask(0.5, 1)),\n n05_05(makeEdgeFavouringMask(0.5, 0.5)),\n n2_1_05(makeEdgeFavouringMask(2, 1, 0.5))\n {\n\n };\n ~TestEdgeFavouringMask() {};\n};\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask1_1)\n{\n EXPECT_EQ(-1., n1_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n1_1.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask1_2)\n{\n EXPECT_EQ(-1., n1_2.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n1_2.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n1_2.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n1_2.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(1., n1_2.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_1)\n{\n EXPECT_EQ(-1., n2_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(2.*sqrt(0.5) - 1., n2_1.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_2)\n{\n EXPECT_EQ(-1., n2_2.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_2.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_2.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_2.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(0.0, n2_2.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask05_1)\n{\n EXPECT_EQ(-1., n05_1.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_1.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n05_1.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask05_05)\n{\n EXPECT_EQ(-1., n05_05.module->GetValue(0.5, 0.5, 0.5)) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n05_05.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_EQ(1., n05_05.module->GetValue(0.75, 0.75, 0.)) <<\n \"Incorrect value\";\n}\n\nTEST_F(TestEdgeFavouringMask, TestEdgeFavouringMask2_1_05)\n{\n EXPECT_NEAR(0.5, n2_1_05.module->GetValue(0.5, 0.5, 0.5), 0.0001) <<\n \"Incorrect value at origin\";\n\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 1., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 0., 0.)) <<\n \"Incorrect value at corner\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 0., 0.)) <<\n \"Incorrect value at corner\";\n\n EXPECT_EQ(1., n2_1_05.module->GetValue(1., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0., 0.5, 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0.5, 1., 0.)) <<\n \"Incorrect value on axis\";\n EXPECT_EQ(1., n2_1_05.module->GetValue(0.5, 0., 0.)) <<\n \"Incorrect value on axis\";\n\n EXPECT_NEAR(0.5 + sqrt(0.125), n2_1_05.module->GetValue(0.75, 0.75, 0.), 0.0001) <<\n \"Incorrect value\";\n}<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_PRIM_CORE_INIT_THREADPOOL_TBB_HPP\n#define STAN_MATH_PRIM_CORE_INIT_THREADPOOL_TBB_HPP\n\n#include <stan\/math\/prim\/err\/invalid_argument.hpp>\n\n#include <boost\/lexical_cast.hpp>\n\n#ifdef TBB_INTERFACE_NEW\n#include <tbb\/global_control.h>\n#include <tbb\/task_arena.h>\n#else\n#include <tbb\/task_scheduler_init.h>\n#endif\n\n#include <cstdlib>\n#include <thread>\n\nnamespace stan {\nnamespace math {\nnamespace internal {\n\n\/**\n * Get number of threads to use. The function uses the environment\n * variable STAN_NUM_THREADS and follows these conventions:\n *\n * - STAN_NUM_THREADS is not defined => num_threads=1\n * - STAN_NUM_THREADS is positive => num_threads is set to the\n * specified number\n * - STAN_NUM_THREADS is set to -1 => num_threads is the number of\n * available cores on the machine\n * - STAN_NUM_THREADS < -1, STAN_NUM_THREADS = 0 or STAN_NUM_THREADS is\n * not numeric => throws an exception\n *\n * @return number of threads to use\n * @throws std::invalid_argument if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline int get_num_threads() {\n int num_threads = 1;\n const char* env_stan_num_threads = std::getenv(\"STAN_NUM_THREADS\");\n if (env_stan_num_threads != nullptr) {\n try {\n const int env_num_threads\n = boost::lexical_cast<int>(env_stan_num_threads);\n if (env_num_threads > 0) {\n num_threads = env_num_threads;\n } else if (env_num_threads == -1) {\n num_threads = std::thread::hardware_concurrency();\n } else {\n invalid_argument(\"get_num_threads(int)\", \"STAN_NUM_THREADS\",\n env_stan_num_threads,\n \"The STAN_NUM_THREADS environment variable is '\",\n \"' but it must be positive or -1\");\n }\n } catch (const boost::bad_lexical_cast&) {\n invalid_argument(\"get_num_threads(int)\", \"STAN_NUM_THREADS\",\n env_stan_num_threads,\n \"The STAN_NUM_THREADS environment variable is '\",\n \"' but it must be a positive number or -1\");\n }\n }\n return num_threads;\n}\n\n} \/\/ namespace internal\n\n#ifdef TBB_INTERFACE_NEW\n\/**\n * Initialize the Intel TBB threadpool and global scheduler through\n * the tbb::global_control object. In case an instance of the\n * tbb::task_scheduler_object has been instantiated prior to calling\n * this function, then any subsequent initialization is ignored by the\n * Intel TBB.\n *\n * The maximal number of threads is read from the environment variable\n * STAN_NUM_THREADS using internal::get_num_threads. See conventions\n * of get_num_threads. The TBB scheduler will be activated by calling\n * this function.\n *\n * The function returns a reference to the static\n * tbb::global_control instance.\n *\n * @return reference to the static tbb::global_control\n * @throws std::runtime_error if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline tbb::global_control& init_threadpool_tbb() {\n int tbb_max_threads = internal::get_num_threads();\n\n static tbb::global_control tbb_scheduler(tbb::global_control::max_allowed_parallelism, tbb_max_threads);\n\n return tbb_scheduler;\n}\n#else\n\/**\n * Initialize the Intel TBB threadpool and global scheduler through\n * the tbb::task_scheduler_init object. In case an instance of the\n * tbb::task_scheduler_object has been instantiated prior to calling\n * this function, then any subsequent initialization is ignored by the\n * Intel TBB.\n *\n * The maximal number of threads is read from the environment variable\n * STAN_NUM_THREADS using internal::get_num_threads. See conventions\n * of get_num_threads. The TBB scheduler will be activated by calling\n * this function.\n *\n * The function returns a reference to the static\n * tbb::task_scheduler_init instance.\n *\n * @param stack_size sets the stack size of each thread; the default 0\n * let's the TBB choose the stack size\n * @return reference to the static tbb::task_scheduler_init\n * @throws std::runtime_error if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline tbb::task_scheduler_init& init_threadpool_tbb(\n tbb::stack_size_type stack_size = 0) {\n int tbb_max_threads = internal::get_num_threads();\n\n static tbb::task_scheduler_init tbb_scheduler(tbb_max_threads, stack_size);\n\n return tbb_scheduler;\n}\n#endif\n\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<commit_msg>[Jenkins] auto-formatting by clang-format version 6.0.0-1ubuntu2~16.04.1 (tags\/RELEASE_600\/final)<commit_after>#ifndef STAN_MATH_PRIM_CORE_INIT_THREADPOOL_TBB_HPP\n#define STAN_MATH_PRIM_CORE_INIT_THREADPOOL_TBB_HPP\n\n#include <stan\/math\/prim\/err\/invalid_argument.hpp>\n\n#include <boost\/lexical_cast.hpp>\n\n#ifdef TBB_INTERFACE_NEW\n#include <tbb\/global_control.h>\n#include <tbb\/task_arena.h>\n#else\n#include <tbb\/task_scheduler_init.h>\n#endif\n\n#include <cstdlib>\n#include <thread>\n\nnamespace stan {\nnamespace math {\nnamespace internal {\n\n\/**\n * Get number of threads to use. The function uses the environment\n * variable STAN_NUM_THREADS and follows these conventions:\n *\n * - STAN_NUM_THREADS is not defined => num_threads=1\n * - STAN_NUM_THREADS is positive => num_threads is set to the\n * specified number\n * - STAN_NUM_THREADS is set to -1 => num_threads is the number of\n * available cores on the machine\n * - STAN_NUM_THREADS < -1, STAN_NUM_THREADS = 0 or STAN_NUM_THREADS is\n * not numeric => throws an exception\n *\n * @return number of threads to use\n * @throws std::invalid_argument if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline int get_num_threads() {\n int num_threads = 1;\n const char* env_stan_num_threads = std::getenv(\"STAN_NUM_THREADS\");\n if (env_stan_num_threads != nullptr) {\n try {\n const int env_num_threads\n = boost::lexical_cast<int>(env_stan_num_threads);\n if (env_num_threads > 0) {\n num_threads = env_num_threads;\n } else if (env_num_threads == -1) {\n num_threads = std::thread::hardware_concurrency();\n } else {\n invalid_argument(\"get_num_threads(int)\", \"STAN_NUM_THREADS\",\n env_stan_num_threads,\n \"The STAN_NUM_THREADS environment variable is '\",\n \"' but it must be positive or -1\");\n }\n } catch (const boost::bad_lexical_cast&) {\n invalid_argument(\"get_num_threads(int)\", \"STAN_NUM_THREADS\",\n env_stan_num_threads,\n \"The STAN_NUM_THREADS environment variable is '\",\n \"' but it must be a positive number or -1\");\n }\n }\n return num_threads;\n}\n\n} \/\/ namespace internal\n\n#ifdef TBB_INTERFACE_NEW\n\/**\n * Initialize the Intel TBB threadpool and global scheduler through\n * the tbb::global_control object. In case an instance of the\n * tbb::task_scheduler_object has been instantiated prior to calling\n * this function, then any subsequent initialization is ignored by the\n * Intel TBB.\n *\n * The maximal number of threads is read from the environment variable\n * STAN_NUM_THREADS using internal::get_num_threads. See conventions\n * of get_num_threads. The TBB scheduler will be activated by calling\n * this function.\n *\n * The function returns a reference to the static\n * tbb::global_control instance.\n *\n * @return reference to the static tbb::global_control\n * @throws std::runtime_error if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline tbb::global_control& init_threadpool_tbb() {\n int tbb_max_threads = internal::get_num_threads();\n\n static tbb::global_control tbb_scheduler(\n tbb::global_control::max_allowed_parallelism, tbb_max_threads);\n\n return tbb_scheduler;\n}\n#else\n\/**\n * Initialize the Intel TBB threadpool and global scheduler through\n * the tbb::task_scheduler_init object. In case an instance of the\n * tbb::task_scheduler_object has been instantiated prior to calling\n * this function, then any subsequent initialization is ignored by the\n * Intel TBB.\n *\n * The maximal number of threads is read from the environment variable\n * STAN_NUM_THREADS using internal::get_num_threads. See conventions\n * of get_num_threads. The TBB scheduler will be activated by calling\n * this function.\n *\n * The function returns a reference to the static\n * tbb::task_scheduler_init instance.\n *\n * @param stack_size sets the stack size of each thread; the default 0\n * let's the TBB choose the stack size\n * @return reference to the static tbb::task_scheduler_init\n * @throws std::runtime_error if the value of STAN_NUM_THREADS env. variable\n * is invalid\n *\/\ninline tbb::task_scheduler_init& init_threadpool_tbb(\n tbb::stack_size_type stack_size = 0) {\n int tbb_max_threads = internal::get_num_threads();\n\n static tbb::task_scheduler_init tbb_scheduler(tbb_max_threads, stack_size);\n\n return tbb_scheduler;\n}\n#endif\n\n} \/\/ namespace math\n} \/\/ namespace stan\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by andreanistico on 08\/02\/17.\n\/\/\n\n#ifndef MOCAP2MAV_STATESCLASSES_HPP\n#define MOCAP2MAV_STATESCLASSES_HPP\n\n#include <iostream>\n#include \"StateMachine\/include\/Machine.h\"\n#include \"common\/MavState.h\"\n\n\nclass LandMachine : public Machine {\n\npublic:\n double *_horizontaErr;\n double *_tauHold;\n double *_tauLost;\n double *_tauErr;\n int *_NHold;\n int *_NLost;\n int *_NComp;\n MavState *_state;\n MavState *_setPoint;\n\n};\n\nclass AbstractLandState : public AbstractState {\n\npublic:\n AbstractState* _nextState;\n enum states{\n\n INIT,\n HOLD,\n DESC,\n ASCE,\n R2LA,\n COMP,\n LAND\n\n };\n\n AbstractLandState(LandMachine *context) : AbstractState(context){\n _contextL = context;\n }\n\n void getSignals(){\n\n _horizontaErr = *(_contextL->_horizontaErr);\n _tauHold = *(_contextL->_tauHold);\n _tauLost = *(_contextL->_tauLost);\n _tauErr = *(_contextL->_tauErr);\n _NHold = *(_contextL->_NHold);\n _NLost = *(_contextL->_NLost);\n _NComp = *(_contextL->_NComp);\n _state = *(_contextL->_state);\n _setPoint = *(_contextL->_setPoint);\n\n }\n void printStateTransition(){\n std::cout << \"Actual state: \" << _contextL->getActualNodeId() << std::endl;\n }\n\nprotected:\n\n double _horizontaErr;\n double _tauHold;\n double _tauLost;\n double _tauErr;\n int _NHold;\n int _NLost;\n int _NComp;\n MavState _state;\n MavState _setPoint;\n LandMachine* _contextL;\n};\n\nclass InitState : public AbstractLandState {\npublic:\n InitState(LandMachine *context) : AbstractLandState(context){\n setId();\n }\n void setId() override {\n\n _id = INIT;\n\n }\n void handle();\n};\n\nclass HoldState : public AbstractLandState {\npublic:\n AbstractLandState* _nextAscState;\n AbstractLandState* _nextDesState;\n\n HoldState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n void setId() override {\n\n _id = HOLD;\n\n }\n void handle();\n};\n\nclass DescState : public AbstractLandState {\npublic:\n DescState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n void setId() override {\n\n _id = DESC;\n\n }\n void handle();\n};\n\nclass AsceState : public AbstractLandState {\npublic:\n AsceState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = ASCE;\n\n }\n void handle();\n};\nclass RToLandState : public AbstractLandState {\npublic:\n AbstractLandState* _nextComState;\n RToLandState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = R2LA;\n\n }\n void handle();\n};\nclass CompState : public AbstractLandState {\npublic:\n\n AbstractLandState* _nextLanState;\n CompState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = COMP;\n\n }\n void handle();\n};\n\nclass LandState : public AbstractLandState {\npublic:\n LandState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = LAND;\n\n }\n void handle();\n};\n\n\n\n#endif \/\/MOCAP2MAV_STATESCLASSES_HPP\n<commit_msg>remove landState member<commit_after>\/\/\n\/\/ Created by andreanistico on 08\/02\/17.\n\/\/\n\n#ifndef MOCAP2MAV_STATESCLASSES_HPP\n#define MOCAP2MAV_STATESCLASSES_HPP\n\n#include <iostream>\n#include \"StateMachine\/include\/Machine.h\"\n#include \"common\/MavState.h\"\n\n\nclass LandMachine : public Machine {\n\npublic:\n double *_horizontaErr;\n double *_tauHold;\n double *_tauLost;\n double *_tauErr;\n int *_NHold;\n int *_NLost;\n int *_NComp;\n MavState *_state;\n MavState *_setPoint;\n\n};\n\nclass AbstractLandState : public AbstractState {\n\npublic:\n AbstractState* _nextState;\n enum states{\n\n INIT,\n HOLD,\n DESC,\n ASCE,\n R2LA,\n COMP,\n LAND\n\n };\n\n AbstractLandState(LandMachine *context) : AbstractState(context){\n _contextL = context;\n }\n\n void getSignals(){\n\n _horizontaErr = *(_contextL->_horizontaErr);\n _tauHold = *(_contextL->_tauHold);\n _tauLost = *(_contextL->_tauLost);\n _tauErr = *(_contextL->_tauErr);\n _NHold = *(_contextL->_NHold);\n _NLost = *(_contextL->_NLost);\n _NComp = *(_contextL->_NComp);\n _state = *(_contextL->_state);\n _setPoint = *(_contextL->_setPoint);\n\n }\n void printStateTransition(){\n std::cout << \"Actual state: \" << _contextL->getActualNodeId() << std::endl;\n }\n\nprotected:\n\n double _horizontaErr;\n double _tauHold;\n double _tauLost;\n double _tauErr;\n int _NHold;\n int _NLost;\n int _NComp;\n MavState _state;\n MavState _setPoint;\n LandMachine* _contextL;\n};\n\nclass InitState : public AbstractLandState {\npublic:\n InitState(LandMachine *context) : AbstractLandState(context){\n setId();\n }\n void setId() override {\n\n _id = INIT;\n\n }\n void handle();\n};\n\nclass HoldState : public AbstractLandState {\npublic:\n AbstractLandState* _nextAscState;\n AbstractLandState* _nextDesState;\n\n HoldState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n void setId() override {\n\n _id = HOLD;\n\n }\n void handle();\n};\n\nclass DescState : public AbstractLandState {\npublic:\n DescState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n void setId() override {\n\n _id = DESC;\n\n }\n void handle();\n};\n\nclass AsceState : public AbstractLandState {\npublic:\n AsceState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = ASCE;\n\n }\n void handle();\n};\nclass RToLandState : public AbstractLandState {\npublic:\n AbstractLandState* _nextComState;\n RToLandState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = R2LA;\n\n }\n void handle();\n};\nclass CompState : public AbstractLandState {\npublic:\n\n CompState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = COMP;\n\n }\n void handle();\n};\n\nclass LandState : public AbstractLandState {\npublic:\n LandState(LandMachine *context) : AbstractLandState(context) {\n setId();\n }\n\n void setId() override {\n\n _id = LAND;\n\n }\n void handle();\n};\n\n\n\n#endif \/\/MOCAP2MAV_STATESCLASSES_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n * InferenceSCM.cc\n *\n * Copyright (C) 2014 Misgana Bayetta\n *\n * Author: Misgana Bayetta <misgana.bayetta@gmail.com> Sept 2014\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the exceptions\n * at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, write to:\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n#include \"InferenceSCM.h\"\n\n#include <opencog\/guile\/SchemePrimitive.h>\n#include <opencog\/guile\/SchemeSmob.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/ForwardChainer.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/DefaultForwardChainerCB.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/BackwardChainer.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n\nusing namespace opencog;\n\nInferenceSCM* InferenceSCM::_inst = NULL;\n\nInferenceSCM::InferenceSCM() {\n\tif (NULL == _inst) {\n\t\t_inst = this;\n\t\tinit();\n\t}\n}\n\nInferenceSCM::~InferenceSCM() {\n\n}\n\nvoid InferenceSCM::init(void) {\n\t_inst = new InferenceSCM();\n#ifdef HAVE_GUILE\n\t\/\/all commands for invoking the rule engine from scm shell should be declared here\n\tdefine_scheme_primitive(\"cog-fc\", &InferenceSCM::do_forward_chaining,\n\t\t\t_inst); \/\/eg. from scm shell (cog-fc (InheritanceLink (ConceptNode \"cat\")(ConceptNode \"animal\"))\n\tdefine_scheme_primitive(\"cog-bc\", &InferenceSCM::do_backward_chaining,\n\t\t\t_inst); \/\/backward chaining\n#endif\n}\n\nHandle InferenceSCM::do_forward_chaining(Handle h) {\n#ifdef HAVE_GUILE\n\tAtomSpace *as = SchemeSmob::ss_get_env_as(\"cog-fc\");\n\tDefaultForwardChainerCB dfc(as);\n\tForwardChainer fc(as);\n\tfc.do_chain(dfc,h); \/\/START FORWARD CHAINING\n\tHandleSeq result = fc.get_chaining_result();\n\treturn as->addLink(LIST_LINK, result);\n#else\n\treturn Handle::UNDEFINED;\n#endif\n}\n\nHandle InferenceSCM::do_backward_chaining(Handle h) {\n#ifdef HAVE_GUILE\n\tAtomSpace *as = SchemeSmob::ss_get_env_as(\"cog-bc\");\n\tBackwardChainer bc(as);\n\tbc.do_chain(h);\n\tmap<Handle, HandleSeq> soln = bc.get_chaining_result();\n\tHandleSeq soln_list_link;\n\tfor (auto it = soln.begin(); it != soln.end(); ++it) {\n\t\tHandleSeq hs;\n\t\ths.push_back(it->first);\n\t\ths.insert(hs.end(), it->second.begin(), it->second.end());\n\t\tsoln_list_link.push_back(\n\t\t\t\tas->addLink(LIST_LINK, hs));\n\t}\n\treturn as->addLink(LIST_LINK, soln_list_link);\n#else\n\treturn Handle::UNDEFINED;\n#endif\n}\n<commit_msg>Modify cog-bc for when unify_to_empty_set<commit_after>\/*\n * InferenceSCM.cc\n *\n * Copyright (C) 2014 Misgana Bayetta\n *\n * Author: Misgana Bayetta <misgana.bayetta@gmail.com> Sept 2014\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License v3 as\n * published by the Free Software Foundation and including the exceptions\n * at http:\/\/opencog.org\/wiki\/Licenses\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU Affero General Public License\n * along with this program; if not, write to:\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\/\n#include \"InferenceSCM.h\"\n\n#include <opencog\/guile\/SchemePrimitive.h>\n#include <opencog\/guile\/SchemeSmob.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/ForwardChainer.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/DefaultForwardChainerCB.h>\n#include <opencog\/reasoning\/RuleEngine\/rule-engine-src\/pln\/BackwardChainer.h>\n#include <opencog\/atomspace\/AtomSpace.h>\n\nusing namespace opencog;\n\nInferenceSCM* InferenceSCM::_inst = NULL;\n\nInferenceSCM::InferenceSCM()\n{\n\tif (NULL == _inst) {\n\t\t_inst = this;\n\t\tinit();\n\t}\n}\n\nInferenceSCM::~InferenceSCM()\n{\n\n}\n\nvoid InferenceSCM::init(void)\n{\n\t_inst = new InferenceSCM();\n#ifdef HAVE_GUILE\n\t\/\/all commands for invoking the rule engine from scm shell should be declared here\n\tdefine_scheme_primitive(\"cog-fc\", &InferenceSCM::do_forward_chaining,\n\t\t\t_inst); \/\/eg. from scm shell (cog-fc (InheritanceLink (ConceptNode \"cat\")(ConceptNode \"animal\"))\n\tdefine_scheme_primitive(\"cog-bc\", &InferenceSCM::do_backward_chaining,\n\t\t\t_inst); \/\/backward chaining\n#endif\n}\n\nHandle InferenceSCM::do_forward_chaining(Handle h)\n{\n#ifdef HAVE_GUILE\n\tAtomSpace *as = SchemeSmob::ss_get_env_as(\"cog-fc\");\n\tDefaultForwardChainerCB dfc(as);\n\tForwardChainer fc(as);\n\tfc.do_chain(dfc,h); \/\/START FORWARD CHAINING\n\tHandleSeq result = fc.get_chaining_result();\n\treturn as->addLink(LIST_LINK, result);\n#else\n\treturn Handle::UNDEFINED;\n#endif\n}\n\nHandle InferenceSCM::do_backward_chaining(Handle h)\n{\n#ifdef HAVE_GUILE\n\tAtomSpace *as = SchemeSmob::ss_get_env_as(\"cog-bc\");\n\n\tBackwardChainer bc(as);\n\n\tbc.do_chain(h);\n\tmap<Handle, HandleSeq> soln = bc.get_chaining_result();\n\n\tHandleSeq soln_list_link;\n\tfor (auto it = soln.begin(); it != soln.end(); ++it) {\n\t\tHandleSeq hs;\n\t\ths.push_back(it->first);\n\t\ths.insert(hs.end(), it->second.begin(), it->second.end());\n\n\t\tif (hs[1] != Handle::UNDEFINED)\n\t\t\tsoln_list_link.push_back(as->addLink(LIST_LINK, hs));\n\t}\n\n\treturn as->addLink(LIST_LINK, soln_list_link);\n#else\n\treturn Handle::UNDEFINED;\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>#include<bits\/stdc++.h>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nusing namespace std;\n\nconst int bs[]={2,3,5,7,11,17,23,29};\nconst int M=(1<<7)-1;\n\nll Mx;\n\nll Mul(ll a,ll b,ll P){return ((a*b)-(ll)((long double)a*b\/P)*P+P)%P;}\n\n\/\/ ll Mul(ll a,ll b,ll P){return (__int128_t)a*b%P;}\n\nll gcd(ll a, ll b) {\n if (!a) return b;\n if (!b) return a;\n#define ctz __builtin_ctzll\n int t = ctz(a | b);\n a >>= ctz(a);\n do {\n b >>= ctz(b);\n if (a > b) {\n ll t = b;\n b = a;\n a = t;\n }\n b -= a;\n } while (b != 0);\n return a << t;\n}\n\nll ksm(ll a,ll b,ll P)\n{\n ll ret=1;\n for(;b;b>>=1,a=Mul(a,a,P)) if(b&1) ret=Mul(ret,a,P);\n return ret;\n}\n\nbool Miller_Rabin(ll x)\n{\n if(x==2||x==3||x==5||x==7||x==11||x==17||x==23||x==29) return true;\n for(int p:bs)\n {\n ll b=x-1;int t=0,f=0;\n while(~b&1) b>>=1,t++;\n if(!t) return false;\n ll a=ksm(p,b,x);\n if(a==1||a==x-1) {continue;}\n while(t)\n {\n a=Mul(a,a,x);f|=(a==x-1);\n if(a==1&&!f) return false;\n t--;\n }\n if(a!=1||!f) return false;\n }\n return true;\n}\n\nll f(ll x,ll n,ll c){return (Mul(x,x,n)+c)%n;}\n\nll Pollard_Rho(ll n) \/\/ find \n{\n ll x=0,y=x,q=1,t=1,c=rand()%(n-1)+1;\n for(int k=2;;k<<=1,y=x,q=1)\n {\n for(int i=1;i<=k;i++)\n {\n x=f(x,n,c);\n q=Mul(q,abs(x-y),n);\n if(!(M&i))\n {\n t=gcd(q,n);\n if(t>1) break;\n }\n }\n if(t>1||(t=gcd(q,n))>1) break;\n }\n if(t==n)\n {\n t=1;\n while(t==1) t=gcd(abs((x=f(x,n,c))-y),n);\n }\n return t;\n}\n\nvoid Factorize(ll n)\n{\n if(n==1) return;\n if(Miller_Rabin(n)) return Mx=max(Mx,n),void();\n ll t=Pollard_Rho(n);\n while(t==n) t=Pollard_Rho(n);\n Factorize(t);Factorize(n\/t);\n}\n\nint main()\n{\n srand((ull)new char);\n int T;ll n;\n scanf(\"%d\",&T);\n while(T--)\n {\n scanf(\"%lld\",&n);\n if(Miller_Rabin(n)) {puts(\"Prime\");continue;}\n Mx=0;Factorize(n);\n printf(\"%lld\\n\",Mx);\n }\n}<commit_msg>Pollard-Rho update<commit_after>\/\/ luogu-judger-enable-o2\n#include<bits\/stdc++.h>\n\ntypedef long long ll;\ntypedef unsigned long long ull;\n\nusing namespace std;\n\nconst int pr[]={2,3,5,7,11,23,43,79};\nconst int M=(1<<8)-1;\n\nmt19937 RandEngine(chrono::steady_clock::now().time_since_epoch().count());\nll RandInt(ll L,ll R){return uniform_int_distribution<ll>(L,R)(RandEngine);}\n\nll Mx=0;\n\nll gcd(ll a,ll b)\n{\n if(!a||!b) return a|b;\n #define ctz __builtin_ctzll\n int shift=ctz(a|b);\n b>>=ctz(b);\n while(a)\n {\n a>>=ctz(a);\n if(a<b)\n swap(a,b);\n a-=b;\n }\n return b<<shift;\n #undef ctz\n}\n\null Mul(ull a,ull b,ull P)\n{\n ull c=(ll)a*b-(ll)((ull)((long double)a*b\/P))*P;\n return (c+P)%P;\n}\n\nll ksm(ll a,ll b,ll P)\n{\n ll ret=1;\n for(;b;b>>=1,a=Mul(a,a,P))\n if(b&1)\n ret=Mul(ret,a,P);\n return ret;\n}\n\nbool Miller_Rabin(ll n)\n{\n if(n==2||n==3||n==5||n==7||n==11||n==23||n==43||n==79)\n return true;\n if(~n&1)\n return false;\n for(int p:pr)\n {\n ll t=n-1,c=0;\n while(~t&1)\n t>>=1,++c;\n ll pw=ksm(p,t,n);\n if(pw==1)\n continue;\n bool f=(pw==n-1);\n while(c)\n {\n pw=Mul(pw,pw,n);\n f|=(pw==n-1);\n --c;\n if(pw==1&&!f)\n return false;\n }\n if(pw!=1||!f)\n return false;\n }\n return true;\n}\n\nll Pollard_Rho(ll n)\n{\n int c=RandInt(1,n-1);\n ll t=1,x=0,y=0,q=1;\n auto F=[=](ll x){return (Mul(x,x,n)+c)%n;};\n for(int i=2;;i<<=1,y=x,q=1)\n {\n for(int j=1;j<=i;j++)\n {\n x=F(x);\n q=Mul(q,abs(x-y),n);\n if(!(j&M))\n {\n if((t=gcd(q,n))>1)\n break;\n }\n }\n if(t>1||((t=gcd(q,n))>1))\n break;\n }\n if(t==n)\n {\n t=1;\n while(t==1)\n x=F(x),t=gcd(abs(x-y),n);\n }\n return t;\n}\n\nvoid Factorize(ll n)\n{\n if(Miller_Rabin(n))\n return Mx=max(Mx,n),void();\n ll d=n;\n while(d==n)\n d=Pollard_Rho(n);\n Factorize(n\/d);Factorize(d);\n}\n\nvoid solve()\n{\n ll n;\n scanf(\"%lld\",&n);\n if(Miller_Rabin(n))\n puts(\"Prime\");\n else\n {\n Mx=0;\n Factorize(n);\n printf(\"%lld\\n\",Mx);\n }\n}\n\nint main()\n{\n int T;\n for(scanf(\"%d\",&T);T--;solve());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * despot2_main.cpp\n *\n * Created by Tobias Wood on 23\/01\/2012.\n * Copyright (c) 2012-2013 Tobias Wood.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n *\/\n\n#include <getopt.h>\n#include <iostream>\n#include <atomic>\n#include <Eigen\/Dense>\n#include \"unsupported\/Eigen\/NonLinearOptimization\"\n#include \"unsupported\/Eigen\/NumericalDiff\"\n\n#include \"Nifti\/Nifti.h\"\n#include \"QUIT\/QUIT.h\"\n#include \"DESPOT.h\"\n#include \"DESPOT_Functors.h\"\n\nusing namespace std;\nusing namespace Eigen;\nusing namespace QUIT;\n\n\/\/******************************************************************************\n\/\/ Arguments \/ Usage\n\/\/******************************************************************************\nconst string usage {\n\"Usage is: despot2 [options] T1_map ssfp_file\\n\\\n\\n\\\nOptions:\\n\\\n\t--help, -h : Print this message.\\n\\\n\t--mask, -m file : Mask input with specified file.\\n\\\n\t--out, -o path : Add a prefix to the output filenames.\\n\\\n\t--B1 file : B1 Map file.\\n\\\n\t--elliptical, -e : Input is band-free elliptical data.\\n\\\n\t--verbose, -v : Print slice processing times.\\n\\\n\t--no-prompt, -n : Suppress input prompts.\\n\\\n\t--algo, -a l : LLS algorithm (default)\\n\\\n\t w : WLLS algorithm\\n\\\n\t n : NLLS (Levenberg-Marquardt)\\n\\\n\t--its, -i N : Max iterations for WLLS (default 4)\\n\\\n\t--threads, -T N : Use N threads (default=hardware limit)\\n\"\n};\n\nenum class Algos { LLS, WLLS, NLLS };\nstatic int verbose = false, prompt = true, elliptical = false;\nstatic size_t nIterations = 4;\nstatic Algos algo;\nstatic string outPrefix;\nstatic struct option long_options[] =\n{\n\t{\"B1\", required_argument, 0, '1'},\n\t{\"elliptical\", no_argument, 0, 'e'},\n\t{\"help\", no_argument, 0, 'h'},\n\t{\"mask\", required_argument, 0, 'm'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"no-prompt\", no_argument, 0, 'n'},\n\t{\"algo\", required_argument, 0, 'a'},\n\t{\"its\", required_argument, 0, 'i'},\n\t{\"threads\", required_argument, 0, 'T'},\n\t{0, 0, 0, 0}\n};\n\n\/\/******************************************************************************\n\/\/ Main\n\/\/******************************************************************************\nint main(int argc, char **argv)\n{\n\ttry { \/\/ To fix uncaught exceptions on Mac\n\n\tNifti::File maskFile, B0File, B1File;\n\tMultiArray<double, 3> maskVol, B1Vol;\n\tThreadPool threads;\n\tstring procPath;\n\n\tint indexptr = 0, c;\n\twhile ((c = getopt_long(argc, argv, \"hm:o:b:vna:i:T:e\", long_options, &indexptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'o':\n\t\t\t\toutPrefix = optarg;\n\t\t\t\tif (verbose) cout << \"Output prefix will be: \" << outPrefix << endl;\n\t\t\t\tbreak;\n\t\t\tcase 'm':\n\t\t\t\tcout << \"Reading mask file \" << optarg << endl;\n\t\t\t\tmaskFile.open(optarg, Nifti::Mode::Read);\n\t\t\t\tmaskVol.resize(maskFile.matrix());\n\t\t\t\tmaskFile.readVolumes(maskVol.begin(), maskVol.end(), 0, 1);\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tcout << \"Reading B1 file: \" << optarg << endl;\n\t\t\t\tB1File.open(optarg, Nifti::Mode::Read);\n\t\t\t\tB1Vol.resize(B1File.matrix());\n\t\t\t\tB1File.readVolumes(B1Vol.begin(), B1Vol.end(), 0, 1);\n\t\t\t\tbreak;\n\t\t\tcase 'a':\n\t\t\t\tswitch (*optarg) {\n\t\t\t\t\tcase 'l': algo = Algos::LLS; if (verbose) cout << \"LLS algorithm selected.\" << endl; break;\n\t\t\t\t\tcase 'w': algo = Algos::WLLS; if (verbose) cout << \"WLLS algorithm selected.\" << endl; break;\n\t\t\t\t\tcase 'n': algo = Algos::NLLS; if (verbose) cout << \"NLLS algorithm selected.\" << endl; break;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcout << \"Unknown algorithm type \" << optarg << endl;\n\t\t\t\t\t\treturn EXIT_FAILURE;\n\t\t\t\t\t\tbreak;\n\t\t\t\t} break;\n\t\t\tcase 'i':\n\t\t\t\tnIterations = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase 'n': prompt = false; break;\n\t\t\tcase 'e': elliptical = true; break;\n\t\t\tcase 'T':\n\t\t\t\tthreads.resize(atoi(optarg));\n\t\t\t\tbreak;\n\t\t\tcase 0:\n\t\t\t\t\/\/ Just a flag\n\t\t\t\tbreak;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\tcase 'h':\n\t\t\t\tcout << usage << endl;\t\t\t\t\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\t}\n\tif (verbose) cout << version << endl << credit_shared << endl;\n\tEigen::initParallel();\n\tif ((argc - optind) != 2) {\n\t\tcout << \"Wrong number of arguments. Need a T1 map and 1 SSFP file.\" << endl;\n\t\tcout << usage << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\tif (verbose) cout << \"Reading T1 Map from: \" << argv[optind] << endl;\n\tNifti::File T1File(argv[optind++]);\n\tMultiArray<double, 3> T1Vol(T1File.matrix());\n\tT1File.readVolumes(T1Vol.begin(), T1Vol.end(), 0, 1);\n\t\/\/**************************************************************************\n\t\/\/ Gather SSFP Data\n\t\/\/**************************************************************************\n\tSequences ssfp(Scale::None);\n\tif (verbose) cout << \"Opening SSFP file: \" << argv[optind] << endl;\n\tNifti::File SSFPFile(argv[optind++]);\n\tif (verbose) cout << \"Checking headers for consistency.\" << endl;\n\tcheckHeaders(SSFPFile.header(), {T1File, maskFile, B1File});\n\tif (verbose) cout << \"Checking for ProcPar.\" << endl;\n\tAgilent::ProcPar pp; ReadPP(SSFPFile, pp);\n\tif (verbose) cout << \"Reading sequence parameters.\" << endl;\n\tif (elliptical) {\n\t\tssfp.addSequence(SequenceType::SSFP_Ellipse, prompt, pp);\n\t} else {\n\t\tssfp.addSequence(SequenceType::SSFP, prompt, pp);\n\t}\n\tif (ssfp.size() != SSFPFile.header().dim(4)) {\n\t\tthrow(std::runtime_error(\"The specified number of flip-angles and phase-cycles does not match the input file: \" + SSFPFile.imagePath()));\n\t}\n\tif (verbose) {\n\t\tcout << ssfp;\n\t\tcout << \"Reading data.\" << endl;\n\t}\n\tMultiArray<complex<double>, 4> ssfpVols(SSFPFile.header().fulldims().head(4));\n\tSSFPFile.readVolumes(ssfpVols.begin(), ssfpVols.end());\n\t\/\/**************************************************************************\n\t\/\/ Do the fitting\n\t\/\/**************************************************************************\n\tconst auto dims = SSFPFile.matrix();\n\tdouble TR = ssfp.sequence(0)->m_TR;\n\tMultiArray<float, 3> T2Vol(dims), PDVol(dims), offResVol(dims), SoSVol(dims);\n\ttime_t startTime;\n\tif (verbose)\n\t\tstartTime = printStartTime();\n\tclock_t startClock = clock();\n\tint voxCount = 0;\n\tfor (size_t k = 0; k < dims(2); k++) {\n\t\tif (verbose)\n\t\t\tcout << \"Starting slice \" << k << \"...\" << flush;\n\t\tclock_t loopStart = clock();\n\t\tatomic<int> sliceCount{0};\n\t\tfunction<void (const int&)> process = [&] (const int &j) {\n\t\t\tfor (size_t i = 0; i < dims(0); i++) {\n\t\t\t\tif (!maskFile || (maskVol[{i,j,k}])) {\n\t\t\t\t\tsliceCount++;\n\t\t\t\t\tdouble B1, T1, T2, E1, E2, PD, offRes, SoS;\n\t\t\t\t\tB1 = B1File ? B1Vol[{i,j,k}] : 1.;\n\t\t\t\t\tT1 = T1Vol[{i,j,k}];\n\t\t\t\t\tE1 = exp(-TR \/ T1);\n\t\t\t\t\tconst ArrayXd localAngles(ssfp.sequence(0)->B1flip(B1));\n\t\t\t\t\tconst ArrayXcd data = ssfpVols.slice<1>({i,j,k,0},{0,0,0,-1}).asArray().cast<complex<double>>();\n\t\t\t\t\t\/\/ Use phase of mean instead of mean of phase to avoid wrap issues\n\t\t\t\t\tconst complex<double> mean_data = data.mean();\n\t\t\t\t\toffRes = arg(-mean_data) \/ (M_PI * TR);\n\n\t\t\t\t\tconst ArrayXd s = data.abs();\n\t\t\t\t\tVectorXd Y = s \/ localAngles.sin();\n\t\t\t\t\tMatrixXd X(Y.rows(), 2);\n\t\t\t\t\tX.col(0) = s \/ localAngles.tan();\n\t\t\t\t\tX.col(1).setOnes();\n\t\t\t\t\tVectorXd b = (X.transpose() * X).partialPivLu().solve(X.transpose() * Y);\n\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\tT2 = 2. * TR \/ log((b[0]*E1 - 1.) \/ (b[0] - E1));\n\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\tPD = b[1] * (1. - E1*E2*E2) \/ (sqrt(E2) * (1. - E1));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tT2 = TR \/ log((b[0]*E1 - 1.)\/(b[0] - E1));\n\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\tPD = b[1] * (1. - E1*E2) \/ (1. - E1);\n\t\t\t\t\t}\n\t\t\t\t\tif (algo == Algos::WLLS) {\n\t\t\t\t\t\tVectorXd W(ssfp.size());\n\t\t\t\t\t\tfor (size_t n = 0; n < nIterations; n++) {\n\t\t\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\t\t\tW = ((1. - E1*E2) * localAngles.sin() \/ (1. - E1*E2*E2 - (E1 - E2*E2)*localAngles.cos())).square();\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tW = ((1. - E1*E2) * localAngles.sin() \/ (1. - E1*E2 - (E1 - E2)*localAngles.cos())).square();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tb = (X.transpose() * W.asDiagonal() * X).partialPivLu().solve(X.transpose() * W.asDiagonal() * Y);\n\t\t\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\t\t\tT2 = 2. * TR \/ log((b[0]*E1 - 1.) \/ (b[0] - E1));\n\t\t\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\t\t\tPD = b[1] * (1. - E1*E2*E2) \/ (sqrt(E2) * (1. - E1));\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tT2 = TR \/ log((b[0]*E1 - 1.)\/(b[0] - E1));\n\t\t\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\t\t\tPD = b[1] * (1. - E1*E2) \/ (1. - E1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (algo == Algos::NLLS) {\n\t\t\t\t\t\tD2Functor f(T1, ssfp, Pools::One, data, B1, true, false);\n\t\t\t\t\t\tNumericalDiff<D2Functor> nDiff(f);\n\t\t\t\t\t\tLevenbergMarquardt<NumericalDiff<D2Functor>> lm(nDiff);\n\t\t\t\t\t\tlm.parameters.maxfev = nIterations;\n\t\t\t\t\t\tVectorXd p(3);\n\t\t\t\t\t\tp << PD, T2, offRes;\n\t\t\t\t\t\t\/\/cout << \"Running LM...\" << endl;\n\t\t\t\t\t\t\/\/cout << \"Start P: \" << p.transpose() << endl;\n\t\t\t\t\t\tlm.lmder1(p);\n\t\t\t\t\t\t\/\/cout << \"End P: \" << p.transpose() << endl;\n\t\t\t\t\t\t\/\/cout << \"Finished LM\" << endl;\n\t\t\t\t\t\tPD = p(0); T2 = p(1); offRes = p(2);\n\t\t\t\t\t\t\/\/exit(EXIT_SUCCESS);\n\t\t\t\t\t}\n\t\t\t\t\tArrayXd theory = ssfp.signal(Pools::One, Vector4d(PD, T1, T2, offRes), B1).abs();\n\t\t\t\t\tSoS = (s - theory).abs2().sum() \/ ssfp.size();\n\t\t\t\t\tT2Vol[{i,j,k}] = static_cast<float>(T2);\n\t\t\t\t\tPDVol[{i,j,k}] = static_cast<float>(PD);\n\t\t\t\t\toffResVol[{i,j,k}] = static_cast<float>(offRes);\n\t\t\t\t\tSoSVol[{i,j,k}] = static_cast<float>(SoS);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tthreads.for_loop(process, dims(1));\n\t\tif (verbose) printLoopTime(loopStart, sliceCount);\n\t\tvoxCount += sliceCount;\n\t}\n\tif (verbose) {\n\t\tprintElapsedTime(startTime);\n\t\tcout << \"Writing results.\" << endl;\n\t}\n\tprintElapsedClock(startClock, voxCount);\n\tNifti::Header outHdr = SSFPFile.header();\n\toutHdr.description = version;\n\toutHdr.setDim(4, 1);\n\toutHdr.setDatatype(Nifti::DataType::FLOAT32);\n\toutHdr.intent = Nifti::Intent::Estimate;\n\toutHdr.intent_name = \"T2 (s)\";\n\tNifti::File outFile(outHdr, outPrefix + \"D2_T2\" + OutExt());\n\toutFile.writeVolumes(T2Vol.begin(), T2Vol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"PD (au)\";\n\toutFile.open(outPrefix + \"D2_PD\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(PDVol.begin(), PDVol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"Sum of Squared Residuals\";\n\toutFile.open(outPrefix + \"D2_SoS\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(SoSVol.begin(), SoSVol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"Off-resonance (Hz)\";\n\toutFile.open(outPrefix + \"D2_f0\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(offResVol.begin(), offResVol.end());\n\toutFile.close();\n\n\tif (verbose) cout << \"All done.\" << endl;\n\t} catch (exception &e) {\n\t\tcerr << e.what() << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\treturn EXIT_SUCCESS;\n}\n<commit_msg>Added a switch to negate the phase before doing the off-resonance calculation.<commit_after>\/*\n * despot2_main.cpp\n *\n * Created by Tobias Wood on 23\/01\/2012.\n * Copyright (c) 2012-2013 Tobias Wood.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n *\/\n\n#include <getopt.h>\n#include <iostream>\n#include <atomic>\n#include <Eigen\/Dense>\n#include \"unsupported\/Eigen\/NonLinearOptimization\"\n#include \"unsupported\/Eigen\/NumericalDiff\"\n\n#include \"Nifti\/Nifti.h\"\n#include \"QUIT\/QUIT.h\"\n#include \"DESPOT.h\"\n#include \"DESPOT_Functors.h\"\n\nusing namespace std;\nusing namespace Eigen;\nusing namespace QUIT;\n\n\/\/******************************************************************************\n\/\/ Arguments \/ Usage\n\/\/******************************************************************************\nconst string usage {\n\"Usage is: despot2 [options] T1_map ssfp_file\\n\\\n\\n\\\nOptions:\\n\\\n\t--help, -h : Print this message.\\n\\\n\t--mask, -m file : Mask input with specified file.\\n\\\n\t--out, -o path : Add a prefix to the output filenames.\\n\\\n\t--B1 file : B1 Map file.\\n\\\n\t--elliptical, -e : Input is band-free elliptical data.\\n\\\n\t--negres, -r : Negate data before calculating off-res.\\n\\\n\t--verbose, -v : Print slice processing times.\\n\\\n\t--no-prompt, -n : Suppress input prompts.\\n\\\n\t--algo, -a l : LLS algorithm (default)\\n\\\n\t w : WLLS algorithm\\n\\\n\t n : NLLS (Levenberg-Marquardt)\\n\\\n\t--its, -i N : Max iterations for WLLS (default 4)\\n\\\n\t--threads, -T N : Use N threads (default=hardware limit)\\n\"\n};\n\nenum class Algos { LLS, WLLS, NLLS };\nstatic int verbose = false, prompt = true, elliptical = false, neg_res = false;\nstatic size_t nIterations = 4;\nstatic Algos algo;\nstatic string outPrefix;\nstatic struct option long_options[] =\n{\n\t{\"B1\", required_argument, 0, '1'},\n\t{\"elliptical\", no_argument, 0, 'e'},\n\t{\"negres\", no_argument, 0, 'r'},\n\t{\"help\", no_argument, 0, 'h'},\n\t{\"mask\", required_argument, 0, 'm'},\n\t{\"verbose\", no_argument, 0, 'v'},\n\t{\"no-prompt\", no_argument, 0, 'n'},\n\t{\"algo\", required_argument, 0, 'a'},\n\t{\"its\", required_argument, 0, 'i'},\n\t{\"threads\", required_argument, 0, 'T'},\n\t{0, 0, 0, 0}\n};\n\n\/\/******************************************************************************\n\/\/ Main\n\/\/******************************************************************************\nint main(int argc, char **argv)\n{\n\ttry { \/\/ To fix uncaught exceptions on Mac\n\n\tNifti::File maskFile, B0File, B1File;\n\tMultiArray<double, 3> maskVol, B1Vol;\n\tThreadPool threads;\n\tstring procPath;\n\n\tint indexptr = 0, c;\n\twhile ((c = getopt_long(argc, argv, \"hm:o:b:vna:i:T:er\", long_options, &indexptr)) != -1) {\n\t\tswitch (c) {\n\t\t\tcase 'o':\n\t\t\t\toutPrefix = optarg;\n\t\t\t\tif (verbose) cout << \"Output prefix will be: \" << outPrefix << endl;\n\t\t\t\tbreak;\n\t\t\tcase 'm':\n\t\t\t\tcout << \"Reading mask file \" << optarg << endl;\n\t\t\t\tmaskFile.open(optarg, Nifti::Mode::Read);\n\t\t\t\tmaskVol.resize(maskFile.matrix());\n\t\t\t\tmaskFile.readVolumes(maskVol.begin(), maskVol.end(), 0, 1);\n\t\t\t\tbreak;\n\t\t\tcase 'b':\n\t\t\t\tcout << \"Reading B1 file: \" << optarg << endl;\n\t\t\t\tB1File.open(optarg, Nifti::Mode::Read);\n\t\t\t\tB1Vol.resize(B1File.matrix());\n\t\t\t\tB1File.readVolumes(B1Vol.begin(), B1Vol.end(), 0, 1);\n\t\t\t\tbreak;\n\t\t\tcase 'a':\n\t\t\t\tswitch (*optarg) {\n\t\t\t\t\tcase 'l': algo = Algos::LLS; if (verbose) cout << \"LLS algorithm selected.\" << endl; break;\n\t\t\t\t\tcase 'w': algo = Algos::WLLS; if (verbose) cout << \"WLLS algorithm selected.\" << endl; break;\n\t\t\t\t\tcase 'n': algo = Algos::NLLS; if (verbose) cout << \"NLLS algorithm selected.\" << endl; break;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tcout << \"Unknown algorithm type \" << optarg << endl;\n\t\t\t\t\t\treturn EXIT_FAILURE;\n\t\t\t\t\t\tbreak;\n\t\t\t\t} break;\n\t\t\tcase 'i':\n\t\t\t\tnIterations = atoi(optarg);\n\t\t\t\tbreak;\n\t\t\tcase 'v': verbose = true; break;\n\t\t\tcase 'n': prompt = false; break;\n\t\t\tcase 'e': elliptical = true; break;\n\t\t\tcase 'r': neg_res = true; break;\n\t\t\tcase 'T':\n\t\t\t\tthreads.resize(atoi(optarg));\n\t\t\t\tbreak;\n\t\t\tcase 0:\n\t\t\t\t\/\/ Just a flag\n\t\t\t\tbreak;\n\t\t\tcase '?': \/\/ getopt will print an error message\n\t\t\tcase 'h':\n\t\t\t\tcout << usage << endl;\t\t\t\t\n\t\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\t}\n\tif (verbose) cout << version << endl << credit_shared << endl;\n\tEigen::initParallel();\n\tif ((argc - optind) != 2) {\n\t\tcout << \"Wrong number of arguments. Need a T1 map and 1 SSFP file.\" << endl;\n\t\tcout << usage << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\tif (verbose) cout << \"Reading T1 Map from: \" << argv[optind] << endl;\n\tNifti::File T1File(argv[optind++]);\n\tMultiArray<double, 3> T1Vol(T1File.matrix());\n\tT1File.readVolumes(T1Vol.begin(), T1Vol.end(), 0, 1);\n\t\/\/**************************************************************************\n\t\/\/ Gather SSFP Data\n\t\/\/**************************************************************************\n\tSequences ssfp(Scale::None);\n\tif (verbose) cout << \"Opening SSFP file: \" << argv[optind] << endl;\n\tNifti::File SSFPFile(argv[optind++]);\n\tif (verbose) cout << \"Checking headers for consistency.\" << endl;\n\tcheckHeaders(SSFPFile.header(), {T1File, maskFile, B1File});\n\tif (verbose) cout << \"Checking for ProcPar.\" << endl;\n\tAgilent::ProcPar pp; ReadPP(SSFPFile, pp);\n\tif (verbose) cout << \"Reading sequence parameters.\" << endl;\n\tif (elliptical) {\n\t\tssfp.addSequence(SequenceType::SSFP_Ellipse, prompt, pp);\n\t} else {\n\t\tssfp.addSequence(SequenceType::SSFP, prompt, pp);\n\t}\n\tif (ssfp.size() != SSFPFile.header().dim(4)) {\n\t\tthrow(std::runtime_error(\"The specified number of flip-angles and phase-cycles does not match the input file: \" + SSFPFile.imagePath()));\n\t}\n\tif (verbose) {\n\t\tcout << ssfp;\n\t\tcout << \"Reading data.\" << endl;\n\t}\n\tMultiArray<complex<double>, 4> ssfpVols(SSFPFile.header().fulldims().head(4));\n\tSSFPFile.readVolumes(ssfpVols.begin(), ssfpVols.end());\n\t\/\/**************************************************************************\n\t\/\/ Do the fitting\n\t\/\/**************************************************************************\n\tconst auto dims = SSFPFile.matrix();\n\tdouble TR = ssfp.sequence(0)->m_TR;\n\tMultiArray<float, 3> T2Vol(dims), PDVol(dims), offResVol(dims), SoSVol(dims);\n\ttime_t startTime;\n\tif (verbose)\n\t\tstartTime = printStartTime();\n\tclock_t startClock = clock();\n\tint voxCount = 0;\n\tfor (size_t k = 0; k < dims(2); k++) {\n\t\tif (verbose)\n\t\t\tcout << \"Starting slice \" << k << \"...\" << flush;\n\t\tclock_t loopStart = clock();\n\t\tatomic<int> sliceCount{0};\n\t\tfunction<void (const int&)> process = [&] (const int &j) {\n\t\t\tfor (size_t i = 0; i < dims(0); i++) {\n\t\t\t\tif (!maskFile || (maskVol[{i,j,k}])) {\n\t\t\t\t\tsliceCount++;\n\t\t\t\t\tdouble B1, T1, T2, E1, E2, PD, offRes, SoS;\n\t\t\t\t\tB1 = B1File ? B1Vol[{i,j,k}] : 1.;\n\t\t\t\t\tT1 = T1Vol[{i,j,k}];\n\t\t\t\t\tE1 = exp(-TR \/ T1);\n\t\t\t\t\tconst ArrayXd localAngles(ssfp.sequence(0)->B1flip(B1));\n\t\t\t\t\tconst ArrayXcd data = ssfpVols.slice<1>({i,j,k,0},{0,0,0,-1}).asArray().cast<complex<double>>();\n\t\t\t\t\t\/\/ Use phase of mean instead of mean of phase to avoid wrap issues\n\t\t\t\t\tconst complex<double> mean_data = data.mean();\n\t\t\t\t\tif (neg_res)\n\t\t\t\t\t\toffRes = arg(-mean_data) \/ (M_PI * TR);\n\t\t\t\t\telse\n\t\t\t\t\t\toffRes = arg(mean_data) \/ (M_PI * TR);\n\n\t\t\t\t\tconst ArrayXd s = data.abs();\n\t\t\t\t\tVectorXd Y = s \/ localAngles.sin();\n\t\t\t\t\tMatrixXd X(Y.rows(), 2);\n\t\t\t\t\tX.col(0) = s \/ localAngles.tan();\n\t\t\t\t\tX.col(1).setOnes();\n\t\t\t\t\tVectorXd b = (X.transpose() * X).partialPivLu().solve(X.transpose() * Y);\n\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\tT2 = 2. * TR \/ log((b[0]*E1 - 1.) \/ (b[0] - E1));\n\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\tPD = b[1] * (1. - E1*E2*E2) \/ (sqrt(E2) * (1. - E1));\n\t\t\t\t\t} else {\n\t\t\t\t\t\tT2 = TR \/ log((b[0]*E1 - 1.)\/(b[0] - E1));\n\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\tPD = b[1] * (1. - E1*E2) \/ (1. - E1);\n\t\t\t\t\t}\n\t\t\t\t\tif (algo == Algos::WLLS) {\n\t\t\t\t\t\tVectorXd W(ssfp.size());\n\t\t\t\t\t\tfor (size_t n = 0; n < nIterations; n++) {\n\t\t\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\t\t\tW = ((1. - E1*E2) * localAngles.sin() \/ (1. - E1*E2*E2 - (E1 - E2*E2)*localAngles.cos())).square();\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tW = ((1. - E1*E2) * localAngles.sin() \/ (1. - E1*E2 - (E1 - E2)*localAngles.cos())).square();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tb = (X.transpose() * W.asDiagonal() * X).partialPivLu().solve(X.transpose() * W.asDiagonal() * Y);\n\t\t\t\t\t\t\tif (elliptical) {\n\t\t\t\t\t\t\t\tT2 = 2. * TR \/ log((b[0]*E1 - 1.) \/ (b[0] - E1));\n\t\t\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\t\t\tPD = b[1] * (1. - E1*E2*E2) \/ (sqrt(E2) * (1. - E1));\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tT2 = TR \/ log((b[0]*E1 - 1.)\/(b[0] - E1));\n\t\t\t\t\t\t\t\tE2 = exp(-TR \/ T2);\n\t\t\t\t\t\t\t\tPD = b[1] * (1. - E1*E2) \/ (1. - E1);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (algo == Algos::NLLS) {\n\t\t\t\t\t\tD2Functor f(T1, ssfp, Pools::One, data, B1, true, false);\n\t\t\t\t\t\tNumericalDiff<D2Functor> nDiff(f);\n\t\t\t\t\t\tLevenbergMarquardt<NumericalDiff<D2Functor>> lm(nDiff);\n\t\t\t\t\t\tlm.parameters.maxfev = nIterations;\n\t\t\t\t\t\tVectorXd p(3);\n\t\t\t\t\t\tp << PD, T2, offRes;\n\t\t\t\t\t\t\/\/cout << \"Running LM...\" << endl;\n\t\t\t\t\t\t\/\/cout << \"Start P: \" << p.transpose() << endl;\n\t\t\t\t\t\tlm.lmder1(p);\n\t\t\t\t\t\t\/\/cout << \"End P: \" << p.transpose() << endl;\n\t\t\t\t\t\t\/\/cout << \"Finished LM\" << endl;\n\t\t\t\t\t\tPD = p(0); T2 = p(1); offRes = p(2);\n\t\t\t\t\t\t\/\/exit(EXIT_SUCCESS);\n\t\t\t\t\t}\n\t\t\t\t\tArrayXd theory = ssfp.signal(Pools::One, Vector4d(PD, T1, T2, offRes), B1).abs();\n\t\t\t\t\tSoS = (s - theory).abs2().sum() \/ ssfp.size();\n\t\t\t\t\tT2Vol[{i,j,k}] = static_cast<float>(T2);\n\t\t\t\t\tPDVol[{i,j,k}] = static_cast<float>(PD);\n\t\t\t\t\toffResVol[{i,j,k}] = static_cast<float>(offRes);\n\t\t\t\t\tSoSVol[{i,j,k}] = static_cast<float>(SoS);\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tthreads.for_loop(process, dims(1));\n\t\tif (verbose) printLoopTime(loopStart, sliceCount);\n\t\tvoxCount += sliceCount;\n\t}\n\tif (verbose) {\n\t\tprintElapsedTime(startTime);\n\t\tcout << \"Writing results.\" << endl;\n\t}\n\tprintElapsedClock(startClock, voxCount);\n\tNifti::Header outHdr = SSFPFile.header();\n\toutHdr.description = version;\n\toutHdr.setDim(4, 1);\n\toutHdr.setDatatype(Nifti::DataType::FLOAT32);\n\toutHdr.intent = Nifti::Intent::Estimate;\n\toutHdr.intent_name = \"T2 (s)\";\n\tNifti::File outFile(outHdr, outPrefix + \"D2_T2\" + OutExt());\n\toutFile.writeVolumes(T2Vol.begin(), T2Vol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"PD (au)\";\n\toutFile.open(outPrefix + \"D2_PD\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(PDVol.begin(), PDVol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"Sum of Squared Residuals\";\n\toutFile.open(outPrefix + \"D2_SoS\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(SoSVol.begin(), SoSVol.end());\n\toutFile.close();\n\toutHdr.intent_name = \"Off-resonance (Hz)\";\n\toutFile.open(outPrefix + \"D2_f0\" + OutExt(), Nifti::Mode::Write);\n\toutFile.writeVolumes(offResVol.begin(), offResVol.end());\n\toutFile.close();\n\n\tif (verbose) cout << \"All done.\" << endl;\n\t} catch (exception &e) {\n\t\tcerr << e.what() << endl;\n\t\treturn EXIT_FAILURE;\n\t}\n\treturn EXIT_SUCCESS;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * This file is part of the \"libstx\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * libstx is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <assert.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include \"stx\/csv\/CSVInputStream.h\"\n#include \"stx\/exception.h\"\n#include \"stx\/io\/inputstream.h\"\n\nnamespace stx {\n\nstd::unique_ptr<CSVInputStream> CSVInputStream::openFile(\n const std::string& file_path,\n char column_separator \/* = ';' *\/,\n char row_separator \/* = '\\n' *\/,\n char quote_char \/* = '\"' *\/) {\n auto file = FileInputStream::openFile(file_path);\n file->readByteOrderMark();\n\n auto csv_file = new DefaultCSVInputStream(\n std::move(file),\n column_separator,\n row_separator,\n quote_char);\n\n return std::unique_ptr<CSVInputStream>(csv_file);\n}\n\nDefaultCSVInputStream::DefaultCSVInputStream(\n std::unique_ptr<RewindableInputStream>&& input_stream,\n char column_separator \/* = ';' *\/,\n char row_separator \/* = '\\n' *\/,\n char quote_char \/* = '\"' *\/) :\n input_(std::move(input_stream)),\n column_separator_(column_separator),\n row_separator_(row_separator),\n quote_char_(quote_char) {}\n\n\/\/ FIXPAUL quotechar unescaping...\nbool DefaultCSVInputStream::readNextRow(std::vector<std::string>* target) {\n target->clear();\n\n bool eof = false;\n\n for (;;) {\n std::string column;\n char byte;\n bool quoted = false;\n\n for (;;) {\n if (!input_->readNextByte(&byte)) {\n eof = true;\n break;\n }\n\n if (!quoted && byte == column_separator_) {\n break;\n }\n\n if (!quoted && byte == row_separator_) {\n break;\n }\n\n if (byte == quote_char_) {\n quoted = !quoted;\n }\n\n column += byte;\n }\n\n target->emplace_back(column);\n\n if (eof || byte == row_separator_) {\n break;\n }\n }\n\n return !eof;\n}\n\nbool DefaultCSVInputStream::skipNextRow() {\n std::vector<std::string> devnull;\n return readNextRow(&devnull);\n}\n\nvoid DefaultCSVInputStream::rewind() {\n input_->rewind();\n}\n\nconst RewindableInputStream& DefaultCSVInputStream::getInputStream() const {\n return *input_;\n}\n\n\n}\n<commit_msg>strip quote chars in CSVInputStream<commit_after>\/**\n * This file is part of the \"libstx\" project\n * Copyright (c) 2014 Paul Asmuth, Google Inc.\n *\n * libstx is free software: you can redistribute it and\/or modify it under\n * the terms of the GNU General Public License v3.0. You should have received a\n * copy of the GNU General Public License along with this program. If not, see\n * <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include <assert.h>\n#include <unistd.h>\n#include <fcntl.h>\n#include \"stx\/csv\/CSVInputStream.h\"\n#include \"stx\/exception.h\"\n#include \"stx\/io\/inputstream.h\"\n\nnamespace stx {\n\nstd::unique_ptr<CSVInputStream> CSVInputStream::openFile(\n const std::string& file_path,\n char column_separator \/* = ';' *\/,\n char row_separator \/* = '\\n' *\/,\n char quote_char \/* = '\"' *\/) {\n auto file = FileInputStream::openFile(file_path);\n file->readByteOrderMark();\n\n auto csv_file = new DefaultCSVInputStream(\n std::move(file),\n column_separator,\n row_separator,\n quote_char);\n\n return std::unique_ptr<CSVInputStream>(csv_file);\n}\n\nDefaultCSVInputStream::DefaultCSVInputStream(\n std::unique_ptr<RewindableInputStream>&& input_stream,\n char column_separator \/* = ';' *\/,\n char row_separator \/* = '\\n' *\/,\n char quote_char \/* = '\"' *\/) :\n input_(std::move(input_stream)),\n column_separator_(column_separator),\n row_separator_(row_separator),\n quote_char_(quote_char) {}\n\n\/\/ FIXPAUL quotechar unescaping...\nbool DefaultCSVInputStream::readNextRow(std::vector<std::string>* target) {\n target->clear();\n\n bool eof = false;\n\n for (;;) {\n std::string column;\n char byte;\n bool quoted = false;\n\n for (;;) {\n if (!input_->readNextByte(&byte)) {\n eof = true;\n break;\n }\n\n if (!quoted && byte == column_separator_) {\n break;\n }\n\n if (!quoted && byte == row_separator_) {\n break;\n }\n\n if (byte == quote_char_) {\n quoted = !quoted;\n continue;\n }\n\n column += byte;\n }\n\n target->emplace_back(column);\n\n if (eof || byte == row_separator_) {\n break;\n }\n }\n\n return !eof;\n}\n\nbool DefaultCSVInputStream::skipNextRow() {\n std::vector<std::string> devnull;\n return readNextRow(&devnull);\n}\n\nvoid DefaultCSVInputStream::rewind() {\n input_->rewind();\n}\n\nconst RewindableInputStream& DefaultCSVInputStream::getInputStream() const {\n return *input_;\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file gaffe_main.cpp: GFA (Graph Alignment Format) Fast Emitter: a new mapper that will be *extremely* fast once we actually write it\n *\/\n\n#include <omp.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <iostream>\n#include <cassert>\n#include <vector>\n#include <unordered_set>\n#include <chrono>\n\n#include \"subcommand.hpp\"\n\n#include \"..\/seed_clusterer.hpp\"\n#include \"..\/mapper.hpp\"\n#include \"..\/annotation.hpp\"\n#include \"..\/minimizer.hpp\"\n#include <vg\/io\/vpkg.hpp>\n#include <vg\/io\/stream.hpp>\n#include \"..\/alignment_emitter.hpp\"\n#include \"..\/gapless_extender.hpp\"\n#include \"..\/minimizer_mapper.hpp\"\n\n\/\/#define USE_CALLGRIND\n\n#ifdef USE_CALLGRIND\n#include <valgrind\/callgrind.h>\n#endif\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\n\nvoid help_gaffe(char** argv) {\n cerr\n << \"usage: \" << argv[0] << \" gaffe [options] > output.gam\" << endl\n << \"Map unpaired reads using minimizers and gapless extension.\" << endl\n << endl\n << \"basic options:\" << endl\n << \" -x, --xg-name FILE use this xg index (required)\" << endl\n << \" -H, --gbwt-name FILE use this GBWT index (required)\" << endl\n << \" -m, --minimizer-name FILE use this minimizer index (required)\" << endl\n << \" -s, --snarls FILE cluster using these snarls (required)\" << endl\n << \" -d, --dist-name FILE cluster using this distance index (required)\" << endl\n << \" -c, --hit-cap INT ignore minimizers with more than this many locations [10]\" << endl\n << \"input options:\" << endl\n << \" -G, --gam-in FILE read and realign GAM-format reads from FILE (may repeat)\" << endl\n << \" -f, --fastq-in FILE read and align FASTQ-format reads from FILE (may repeat)\" << endl\n << \"output options:\" << endl\n << \" -M, --max-multimaps INT produce up to INT alignments for each read [1]\"\n << \" -N, --sample NAME add this sample name\" << endl\n << \" -R, --read-group NAME add this read group\" << endl\n << \"computational parameters:\" << endl\n << \" -C, --no-chaining disable seed chaining and all gapped alignment\" << endl\n << \" -X, --xdrop use xdrop alignment for tails\" << endl\n << \" -t, --threads INT number of compute threads to use\" << endl;\n}\n\nint main_gaffe(int argc, char** argv) {\n\n if (argc == 2) {\n help_gaffe(argv);\n return 1;\n }\n\n \/\/ initialize parameters with their default options\n string xg_name;\n string gbwt_name;\n string minimizer_name;\n string snarls_name;\n string distance_name;\n \/\/ How close should two hits be to be in the same cluster?\n size_t distance_limit = 1000;\n size_t hit_cap = 10;\n \/\/ Should we try chaining or just give up if we can't find a full length gapless alignment?\n bool do_chaining = true;\n \/\/ Whould we use the xdrop aligner for aligning tails?\n bool use_xdrop_for_tails = false;\n \/\/ What GAMs should we realign?\n vector<string> gam_filenames;\n \/\/ What FASTQs should we align.\n \/\/ Note: multiple FASTQs are not interpreted as paired.\n vector<string> fastq_filenames;\n \/\/ How many mappings per read can we emit?\n size_t max_multimaps = 1;\n \/\/ How many extended clusters should we align, max?\n size_t max_alignments = 48;\n \/\/ What sample name if any should we apply?\n string sample_name;\n \/\/ What read group if any should we apply?\n string read_group;\n \n int c;\n optind = 2; \/\/ force optind past command positional argument\n while (true) {\n static struct option long_options[] =\n {\n {\"help\", no_argument, 0, 'h'},\n {\"xg-name\", required_argument, 0, 'x'},\n {\"gbwt-name\", required_argument, 0, 'H'},\n {\"minimizer-name\", required_argument, 0, 'm'},\n {\"snarls\", required_argument, 0, 's'},\n {\"dist-name\", required_argument, 0, 'd'},\n {\"hit-cap\", required_argument, 0, 'c'},\n {\"gam-in\", required_argument, 0, 'G'},\n {\"fastq-in\", required_argument, 0, 'f'},\n {\"max-multimaps\", required_argument, 0, 'M'},\n {\"sample\", required_argument, 0, 'N'},\n {\"read-group\", required_argument, 0, 'R'},\n {\"no-chaining\", no_argument, 0, 'C'},\n {\"xdrop\", no_argument, 0, 'X'},\n {\"threads\", required_argument, 0, 't'},\n {0, 0, 0, 0}\n };\n\n int option_index = 0;\n c = getopt_long (argc, argv, \"hx:H:m:s:d:c:G:f:M:CXt:\",\n long_options, &option_index);\n\n\n \/\/ Detect the end of the options.\n if (c == -1)\n break;\n\n switch (c)\n {\n case 'x':\n xg_name = optarg;\n if (xg_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide XG file with -x.\" << endl;\n exit(1);\n }\n break;\n \n case 'H':\n gbwt_name = optarg;\n if (gbwt_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide GBWT file with -H.\" << endl;\n exit(1);\n }\n break;\n \n case 'm':\n minimizer_name = optarg;\n if (minimizer_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide minimizer file with -m.\" << endl;\n exit(1);\n }\n break;\n \n case 's':\n snarls_name = optarg;\n if (snarls_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide snarl file with -s.\" << endl;\n exit(1);\n }\n break;\n \n case 'd':\n distance_name = optarg;\n if (distance_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide distance index file with -d.\" << endl;\n exit(1);\n }\n break;\n \n case 'c':\n hit_cap = parse<size_t>(optarg);\n break;\n \n case 'G':\n gam_filenames.push_back(optarg);\n break;\n \n case 'f':\n fastq_filenames.push_back(optarg);\n break;\n \n case 'M':\n max_multimaps = parse<size_t>(optarg);\n break;\n \n case 'N':\n sample_name = optarg;\n break;\n \n case 'R':\n read_group = optarg;\n break;\n \n case 'C':\n do_chaining = false;\n break;\n \n case 'X':\n use_xdrop_for_tails = true;\n break;\n \n case 't':\n {\n int num_threads = parse<int>(optarg);\n if (num_threads <= 0) {\n cerr << \"error:[vg gaffe] Thread count (-t) set to \" << num_threads << \", must set to a positive integer.\" << endl;\n exit(1);\n }\n omp_set_num_threads(num_threads);\n }\n break;\n \n case 'h':\n case '?':\n default:\n help_gaffe(argv);\n exit(1);\n break;\n }\n }\n \n \n if (xg_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires an XG index (-x)\" << endl;\n exit(1);\n }\n \n if (gbwt_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a GBWT index (-H)\" << endl;\n exit(1);\n }\n \n if (minimizer_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a minimizer index (-m)\" << endl;\n exit(1);\n }\n \n if (snarls_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires snarls (-s)\" << endl;\n exit(1);\n }\n \n if (distance_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a distance index (-d)\" << endl;\n exit(1);\n }\n \n \/\/ create in-memory objects\n unique_ptr<xg::XG> xg_index = vg::io::VPKG::load_one<xg::XG>(xg_name);\n unique_ptr<gbwt::GBWT> gbwt_index = vg::io::VPKG::load_one<gbwt::GBWT>(gbwt_name);\n unique_ptr<MinimizerIndex> minimizer_index = vg::io::VPKG::load_one<MinimizerIndex>(minimizer_name);\n unique_ptr<SnarlManager> snarl_manager = vg::io::VPKG::load_one<SnarlManager>(snarls_name);\n unique_ptr<DistanceIndex> distance_index = vg::io::VPKG::load_one<DistanceIndex>(distance_name);\n \n \/\/ Connect the DistanceIndex to the other things it needs to work.\n distance_index->setGraph(xg_index.get());\n distance_index->setSnarlManager(snarl_manager.get());\n\n \/\/ Set up the mapper\n MinimizerMapper minimizer_mapper(xg_index.get(), gbwt_index.get(), minimizer_index.get(), snarl_manager.get(), distance_index.get());\n\n minimizer_mapper.max_alignments = max_alignments;\n minimizer_mapper.max_multimaps = max_multimaps;\n minimizer_mapper.hit_cap = hit_cap;\n minimizer_mapper.distance_limit = distance_limit;\n minimizer_mapper.do_chaining = do_chaining;\n minimizer_mapper.use_xdrop_for_tails = use_xdrop_for_tails;\n minimizer_mapper.sample_name = sample_name;\n minimizer_mapper.read_group = read_group;\n \n \/\/ Set up output to an emitter that will handle serialization\n unique_ptr<AlignmentEmitter> alignment_emitter = get_alignment_emitter(\"-\", \"GAM\", {});\n\n#ifdef USE_CALLGRIND\n \/\/ We want to profile the alignment, not the loading.\n CALLGRIND_START_INSTRUMENTATION;\n#endif\n \n \/\/ Define how to align and output a read, in a thread.\n auto map_read = [&](Alignment& aln) {\n \/\/ Map the read with the MinimizerMapper\n minimizer_mapper.map(aln, *alignment_emitter);\n };\n \n for (auto& gam_name : gam_filenames) {\n \/\/ For every GAM file to remap\n get_input_file(gam_name, [&](istream& in) {\n \/\/ Open it and map all the reads in parallel.\n vg::io::for_each_parallel<Alignment>(in, map_read);\n });\n }\n \n for (auto& fastq_name : fastq_filenames) {\n \/\/ For every FASTQ file to map, map all its reads in parallel.\n fastq_unpaired_for_each_parallel(fastq_name, map_read);\n }\n \n return 0;\n}\n\n\/\/ Register subcommand\nstatic Subcommand vg_gaffe(\"gaffe\", \"Graph Alignment Format Fast Emitter\", DEVELOPMENT, main_gaffe);\n\n\n<commit_msg>Measure reads\/second from the outside<commit_after>\/**\n * \\file gaffe_main.cpp: GFA (Graph Alignment Format) Fast Emitter: a new mapper that will be *extremely* fast once we actually write it\n *\/\n\n#include <omp.h>\n#include <unistd.h>\n#include <getopt.h>\n#include <iostream>\n#include <cassert>\n#include <vector>\n#include <unordered_set>\n#include <chrono>\n#include <atomic>\n\n#include \"subcommand.hpp\"\n\n#include \"..\/seed_clusterer.hpp\"\n#include \"..\/mapper.hpp\"\n#include \"..\/annotation.hpp\"\n#include \"..\/minimizer.hpp\"\n#include <vg\/io\/vpkg.hpp>\n#include <vg\/io\/stream.hpp>\n#include \"..\/alignment_emitter.hpp\"\n#include \"..\/gapless_extender.hpp\"\n#include \"..\/minimizer_mapper.hpp\"\n\n\/\/#define USE_CALLGRIND\n\n#ifdef USE_CALLGRIND\n#include <valgrind\/callgrind.h>\n#endif\n\nusing namespace std;\nusing namespace vg;\nusing namespace vg::subcommand;\n\nvoid help_gaffe(char** argv) {\n cerr\n << \"usage: \" << argv[0] << \" gaffe [options] > output.gam\" << endl\n << \"Map unpaired reads using minimizers and gapless extension.\" << endl\n << endl\n << \"basic options:\" << endl\n << \" -x, --xg-name FILE use this xg index (required)\" << endl\n << \" -H, --gbwt-name FILE use this GBWT index (required)\" << endl\n << \" -m, --minimizer-name FILE use this minimizer index (required)\" << endl\n << \" -s, --snarls FILE cluster using these snarls (required)\" << endl\n << \" -d, --dist-name FILE cluster using this distance index (required)\" << endl\n << \" -c, --hit-cap INT ignore minimizers with more than this many locations [10]\" << endl\n << \"input options:\" << endl\n << \" -G, --gam-in FILE read and realign GAM-format reads from FILE (may repeat)\" << endl\n << \" -f, --fastq-in FILE read and align FASTQ-format reads from FILE (may repeat)\" << endl\n << \"output options:\" << endl\n << \" -M, --max-multimaps INT produce up to INT alignments for each read [1]\"\n << \" -N, --sample NAME add this sample name\" << endl\n << \" -R, --read-group NAME add this read group\" << endl\n << \"computational parameters:\" << endl\n << \" -C, --no-chaining disable seed chaining and all gapped alignment\" << endl\n << \" -X, --xdrop use xdrop alignment for tails\" << endl\n << \" -t, --threads INT number of compute threads to use\" << endl;\n}\n\nint main_gaffe(int argc, char** argv) {\n\n if (argc == 2) {\n help_gaffe(argv);\n return 1;\n }\n\n \/\/ initialize parameters with their default options\n string xg_name;\n string gbwt_name;\n string minimizer_name;\n string snarls_name;\n string distance_name;\n \/\/ How close should two hits be to be in the same cluster?\n size_t distance_limit = 1000;\n size_t hit_cap = 10;\n \/\/ Should we try chaining or just give up if we can't find a full length gapless alignment?\n bool do_chaining = true;\n \/\/ Whould we use the xdrop aligner for aligning tails?\n bool use_xdrop_for_tails = false;\n \/\/ What GAMs should we realign?\n vector<string> gam_filenames;\n \/\/ What FASTQs should we align.\n \/\/ Note: multiple FASTQs are not interpreted as paired.\n vector<string> fastq_filenames;\n \/\/ How many mappings per read can we emit?\n size_t max_multimaps = 1;\n \/\/ How many extended clusters should we align, max?\n size_t max_alignments = 48;\n \/\/ What sample name if any should we apply?\n string sample_name;\n \/\/ What read group if any should we apply?\n string read_group;\n \n int c;\n optind = 2; \/\/ force optind past command positional argument\n while (true) {\n static struct option long_options[] =\n {\n {\"help\", no_argument, 0, 'h'},\n {\"xg-name\", required_argument, 0, 'x'},\n {\"gbwt-name\", required_argument, 0, 'H'},\n {\"minimizer-name\", required_argument, 0, 'm'},\n {\"snarls\", required_argument, 0, 's'},\n {\"dist-name\", required_argument, 0, 'd'},\n {\"hit-cap\", required_argument, 0, 'c'},\n {\"gam-in\", required_argument, 0, 'G'},\n {\"fastq-in\", required_argument, 0, 'f'},\n {\"max-multimaps\", required_argument, 0, 'M'},\n {\"sample\", required_argument, 0, 'N'},\n {\"read-group\", required_argument, 0, 'R'},\n {\"no-chaining\", no_argument, 0, 'C'},\n {\"xdrop\", no_argument, 0, 'X'},\n {\"threads\", required_argument, 0, 't'},\n {0, 0, 0, 0}\n };\n\n int option_index = 0;\n c = getopt_long (argc, argv, \"hx:H:m:s:d:c:G:f:M:CXt:\",\n long_options, &option_index);\n\n\n \/\/ Detect the end of the options.\n if (c == -1)\n break;\n\n switch (c)\n {\n case 'x':\n xg_name = optarg;\n if (xg_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide XG file with -x.\" << endl;\n exit(1);\n }\n break;\n \n case 'H':\n gbwt_name = optarg;\n if (gbwt_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide GBWT file with -H.\" << endl;\n exit(1);\n }\n break;\n \n case 'm':\n minimizer_name = optarg;\n if (minimizer_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide minimizer file with -m.\" << endl;\n exit(1);\n }\n break;\n \n case 's':\n snarls_name = optarg;\n if (snarls_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide snarl file with -s.\" << endl;\n exit(1);\n }\n break;\n \n case 'd':\n distance_name = optarg;\n if (distance_name.empty()) {\n cerr << \"error:[vg gaffe] Must provide distance index file with -d.\" << endl;\n exit(1);\n }\n break;\n \n case 'c':\n hit_cap = parse<size_t>(optarg);\n break;\n \n case 'G':\n gam_filenames.push_back(optarg);\n break;\n \n case 'f':\n fastq_filenames.push_back(optarg);\n break;\n \n case 'M':\n max_multimaps = parse<size_t>(optarg);\n break;\n \n case 'N':\n sample_name = optarg;\n break;\n \n case 'R':\n read_group = optarg;\n break;\n \n case 'C':\n do_chaining = false;\n break;\n \n case 'X':\n use_xdrop_for_tails = true;\n break;\n \n case 't':\n {\n int num_threads = parse<int>(optarg);\n if (num_threads <= 0) {\n cerr << \"error:[vg gaffe] Thread count (-t) set to \" << num_threads << \", must set to a positive integer.\" << endl;\n exit(1);\n }\n omp_set_num_threads(num_threads);\n }\n break;\n \n case 'h':\n case '?':\n default:\n help_gaffe(argv);\n exit(1);\n break;\n }\n }\n \n \n if (xg_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires an XG index (-x)\" << endl;\n exit(1);\n }\n \n if (gbwt_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a GBWT index (-H)\" << endl;\n exit(1);\n }\n \n if (minimizer_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a minimizer index (-m)\" << endl;\n exit(1);\n }\n \n if (snarls_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires snarls (-s)\" << endl;\n exit(1);\n }\n \n if (distance_name.empty()) {\n cerr << \"error:[vg gaffe] Mapping requires a distance index (-d)\" << endl;\n exit(1);\n }\n \n \/\/ create in-memory objects\n unique_ptr<xg::XG> xg_index = vg::io::VPKG::load_one<xg::XG>(xg_name);\n unique_ptr<gbwt::GBWT> gbwt_index = vg::io::VPKG::load_one<gbwt::GBWT>(gbwt_name);\n unique_ptr<MinimizerIndex> minimizer_index = vg::io::VPKG::load_one<MinimizerIndex>(minimizer_name);\n unique_ptr<SnarlManager> snarl_manager = vg::io::VPKG::load_one<SnarlManager>(snarls_name);\n unique_ptr<DistanceIndex> distance_index = vg::io::VPKG::load_one<DistanceIndex>(distance_name);\n \n \/\/ Connect the DistanceIndex to the other things it needs to work.\n distance_index->setGraph(xg_index.get());\n distance_index->setSnarlManager(snarl_manager.get());\n\n \/\/ Set up the mapper\n MinimizerMapper minimizer_mapper(xg_index.get(), gbwt_index.get(), minimizer_index.get(), snarl_manager.get(), distance_index.get());\n\n minimizer_mapper.max_alignments = max_alignments;\n minimizer_mapper.max_multimaps = max_multimaps;\n minimizer_mapper.hit_cap = hit_cap;\n minimizer_mapper.distance_limit = distance_limit;\n minimizer_mapper.do_chaining = do_chaining;\n minimizer_mapper.use_xdrop_for_tails = use_xdrop_for_tails;\n minimizer_mapper.sample_name = sample_name;\n minimizer_mapper.read_group = read_group;\n \n \/\/ Set up output to an emitter that will handle serialization\n unique_ptr<AlignmentEmitter> alignment_emitter = get_alignment_emitter(\"-\", \"GAM\", {});\n\n#ifdef USE_CALLGRIND\n \/\/ We want to profile the alignment, not the loading.\n CALLGRIND_START_INSTRUMENTATION;\n#endif\n \n \/\/ Define how to align and output a read, in a thread.\n std::atomic<size_t> reads(0);\n auto map_read = [&](Alignment& aln) {\n \/\/ Map the read with the MinimizerMapper\n minimizer_mapper.map(aln, *alignment_emitter);\n reads++;\n };\n\n double start = gbwt::readTimer();\n\n for (auto& gam_name : gam_filenames) {\n \/\/ For every GAM file to remap\n get_input_file(gam_name, [&](istream& in) {\n \/\/ Open it and map all the reads in parallel.\n vg::io::for_each_parallel<Alignment>(in, map_read);\n });\n }\n \n for (auto& fastq_name : fastq_filenames) {\n \/\/ For every FASTQ file to map, map all its reads in parallel.\n fastq_unpaired_for_each_parallel(fastq_name, map_read);\n }\n\n double seconds = gbwt::readTimer() - start;\n size_t threads = omp_get_max_threads();\n double reads_second = reads \/ (seconds * threads);\n \/\/ FIXME show_progress\n std::cerr << reads << \" reads in \" << seconds << \" seconds using \" << threads << \" threads (\" << reads_second << \" reads \/ second)\" << std::endl;\n\n return 0;\n}\n\n\/\/ Register subcommand\nstatic Subcommand vg_gaffe(\"gaffe\", \"Graph Alignment Format Fast Emitter\", DEVELOPMENT, main_gaffe);\n\n\n<|endoftext|>"} {"text":"<commit_before>#ifndef RENDERTARGET_HPP\n#define RENDERTARGET_HPP\n#include \"..\/tools.hpp\"\n#include \"Texture.hpp\"\n\nclass RenderTarget {\n\tpublic:\n\t\tenum Attachment {\n\t\t\tDEPTH = GL_DEPTH_ATTACHMENT,\n\t\t\tSTENCIL = GL_STENCIL_ATTACHMENT,\n\t\t\tDEPTH_STENCIL = GL_DEPTH_STENCIL_ATTACHMENT,\n\t\t\tCOLOR0 = GL_COLOR_ATTACHMENT0,\n\t\t\tCOLOR1 = GL_COLOR_ATTACHMENT1,\n\t\t\tCOLOR2 = GL_COLOR_ATTACHMENT2,\n\t\t\tCOLOR3 = GL_COLOR_ATTACHMENT3,\n\t\t\tCOLOR4 = GL_COLOR_ATTACHMENT4,\n\t\t\tCOLOR5 = GL_COLOR_ATTACHMENT5,\n\t\t\tCOLOR6 = GL_COLOR_ATTACHMENT6,\n\t\t\tCOLOR7 = GL_COLOR_ATTACHMENT7,\n\t\t\tCOLOR8 = GL_COLOR_ATTACHMENT8,\n\t\t\tCOLOR9 = GL_COLOR_ATTACHMENT9,\n\t\t\tCOLOR10 = GL_COLOR_ATTACHMENT10,\n\t\t\tCOLOR11 = GL_COLOR_ATTACHMENT11,\n\t\t\tCOLOR12 = GL_COLOR_ATTACHMENT12,\n\t\t\tCOLOR13 = GL_COLOR_ATTACHMENT13,\n\t\t\tCOLOR14 = GL_COLOR_ATTACHMENT14,\n\t\t\tCOLOR15 = GL_COLOR_ATTACHMENT15\n\t\t};\n\n\t\tRenderTarget(int width, int height);\n\t\t~RenderTarget();\n\n\t\tstatic void bind(RenderTarget* renderTarget);\n\n\t\tvoid setSize(int width, int height);\n\t\tvoid addRenderBuffer(Attachment target, Texture::Format format);\n\t\tvoid addTexture(Attachment target, Texture::Format format);\n\n\t\tTexture* getTextureForAttachment(Attachment attachment);\n\n\t\tvoid build();\n\t\tvoid destroy();\n\n\tprivate:\n\n\t\tclass RenderBuffer {\n\t\t\tpublic:\n\t\t\t\tRenderBuffer(int width, int height, Texture::Format format);\n\t\t\t\t~RenderBuffer();\n\n\t\t\t\tvoid bind() const;\n\t\t\t\tGLuint getHandle() const;\n\t\t\tprivate:\n\t\t\t\tGLuint handle;\n\t\t};\n\n\n\t\tclass RenderTargetEntry {\n\t\t\tpublic:\n\t\t\t\tenum Type {\n\t\t\t\t\tRenderBufferEntry,\n\t\t\t\t\tTextureEntry\n\t\t\t\t};\n\n\t\t\t\tRenderTargetEntry(Type type, RenderTarget::Attachment attachment, Texture::Format format) :\n\t\t\t\t\ttype(type), attachment(attachment), format(format), texture(nullptr), renderBuffer(nullptr) {}\n\n\t\t\t\tType type;\n\t\t\t\tRenderTarget::Attachment attachment;\n\t\t\t\tTexture::Format format;\n\n\t\t\t\tTexture* texture;\n\t\t\t\tRenderBuffer* renderBuffer;\n\t\t};\n\n\t\tstatic GLuint current;\n\n\t\tGLuint handle; \/\/ 0 if not built\n\t\tint width, height;\n\t\tstd::map<Attachment, RenderTargetEntry> entries;\n};\n\n#endif \/\/ RENDERTARGET_HPP\n<commit_msg>Add getWidth\/getHeight.<commit_after>#ifndef RENDERTARGET_HPP\n#define RENDERTARGET_HPP\n#include \"..\/tools.hpp\"\n#include \"Texture.hpp\"\n\nclass RenderTarget {\n\tpublic:\n\t\tenum Attachment {\n\t\t\tDEPTH = GL_DEPTH_ATTACHMENT,\n\t\t\tSTENCIL = GL_STENCIL_ATTACHMENT,\n\t\t\tDEPTH_STENCIL = GL_DEPTH_STENCIL_ATTACHMENT,\n\t\t\tCOLOR0 = GL_COLOR_ATTACHMENT0,\n\t\t\tCOLOR1 = GL_COLOR_ATTACHMENT1,\n\t\t\tCOLOR2 = GL_COLOR_ATTACHMENT2,\n\t\t\tCOLOR3 = GL_COLOR_ATTACHMENT3,\n\t\t\tCOLOR4 = GL_COLOR_ATTACHMENT4,\n\t\t\tCOLOR5 = GL_COLOR_ATTACHMENT5,\n\t\t\tCOLOR6 = GL_COLOR_ATTACHMENT6,\n\t\t\tCOLOR7 = GL_COLOR_ATTACHMENT7,\n\t\t\tCOLOR8 = GL_COLOR_ATTACHMENT8,\n\t\t\tCOLOR9 = GL_COLOR_ATTACHMENT9,\n\t\t\tCOLOR10 = GL_COLOR_ATTACHMENT10,\n\t\t\tCOLOR11 = GL_COLOR_ATTACHMENT11,\n\t\t\tCOLOR12 = GL_COLOR_ATTACHMENT12,\n\t\t\tCOLOR13 = GL_COLOR_ATTACHMENT13,\n\t\t\tCOLOR14 = GL_COLOR_ATTACHMENT14,\n\t\t\tCOLOR15 = GL_COLOR_ATTACHMENT15\n\t\t};\n\n\t\tRenderTarget(int width, int height);\n\t\t~RenderTarget();\n\n\t\tstatic void bind(RenderTarget* renderTarget);\n\n\t\tint getWidth() const { return width; }\n\t\tint getHeight() const { return height; }\n\t\tvoid setSize(int width, int height);\n\t\tvoid addRenderBuffer(Attachment target, Texture::Format format);\n\t\tvoid addTexture(Attachment target, Texture::Format format);\n\n\t\tTexture* getTextureForAttachment(Attachment attachment);\n\n\t\tvoid build();\n\t\tvoid destroy();\n\n\tprivate:\n\n\t\tclass RenderBuffer {\n\t\t\tpublic:\n\t\t\t\tRenderBuffer(int width, int height, Texture::Format format);\n\t\t\t\t~RenderBuffer();\n\n\t\t\t\tvoid bind() const;\n\t\t\t\tGLuint getHandle() const;\n\t\t\tprivate:\n\t\t\t\tGLuint handle;\n\t\t};\n\n\n\t\tclass RenderTargetEntry {\n\t\t\tpublic:\n\t\t\t\tenum Type {\n\t\t\t\t\tRenderBufferEntry,\n\t\t\t\t\tTextureEntry\n\t\t\t\t};\n\n\t\t\t\tRenderTargetEntry(Type type, RenderTarget::Attachment attachment, Texture::Format format) :\n\t\t\t\t\ttype(type), attachment(attachment), format(format), texture(nullptr), renderBuffer(nullptr) {}\n\n\t\t\t\tType type;\n\t\t\t\tRenderTarget::Attachment attachment;\n\t\t\t\tTexture::Format format;\n\n\t\t\t\tTexture* texture;\n\t\t\t\tRenderBuffer* renderBuffer;\n\t\t};\n\n\t\tstatic GLuint current;\n\n\t\tGLuint handle; \/\/ 0 if not built\n\t\tint width, height;\n\t\tstd::map<Attachment, RenderTargetEntry> entries;\n};\n\n#endif \/\/ RENDERTARGET_HPP\n<|endoftext|>"} {"text":"<commit_before>#define THEWIZARDPLUSPLUS_WIZARD_PARSER_PARSER_MACROSES\n\n#include \"vendor\/json.hpp\"\n#include \"vendor\/docopt\/docopt.hpp\"\n#include \"vendor\/fmt\/format.hpp\"\n#include <thewizardplusplus\/wizard_parser\/lexer\/lexeme.hpp>\n#include <thewizardplusplus\/wizard_parser\/lexer\/token.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/ast_node.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/rule_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/dummy_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/typing_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/match_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/alternation_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/exception_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/concatenation_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/lookahead_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/repetition_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/eoi_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/lexer\/tokenize.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/parse.hpp>\n#include <thewizardplusplus\/wizard_parser\/exceptions\/unexpected_entity_exception.hpp>\n#include <regex>\n#include <iostream>\n#include <string>\n#include <iterator>\n#include <algorithm>\n#include <cstdlib>\n#include <exception>\n\nusing namespace thewizardplusplus::wizard_parser::lexer;\nusing namespace thewizardplusplus::wizard_parser::parser;\nusing namespace thewizardplusplus::wizard_parser::parser::operators;\nusing namespace thewizardplusplus::wizard_parser::exceptions;\n\nconst auto usage =\nR\"(Usage:\n .\/example -h | --help\n .\/example [-t | --tokens] [--] <expression>\n .\/example [-t | --tokens] (-s | --stdin)\n\nOptions:\n -h, --help - show this message;\n -t, --tokens - show a token list instead an AST;\n -s, --stdin - read an expression from stdin.)\";\nconst auto lexemes = lexeme_group{\n\t{std::regex{\"==\"}, \"equal\"},\n\t{std::regex{\"\/=\"}, \"not_equal\"},\n\t{std::regex{\"<=\"}, \"less_or_equal\"},\n\t{std::regex{\"<\"}, \"less\"},\n\t{std::regex{\">=\"}, \"great_or_equal\"},\n\t{std::regex{\">\"}, \"great\"},\n\t{std::regex{R\"(\\+)\"}, \"plus\"},\n\t{std::regex{\"-\"}, \"minus\"},\n\t{std::regex{R\"(\\*)\"}, \"star\"},\n\t{std::regex{\"\/\"}, \"slash\"},\n\t{std::regex{\"%\"}, \"percent\"},\n\t{std::regex{R\"(\\()\"}, \"opening_parenthesis\"},\n\t{std::regex{R\"(\\))\"}, \"closing_parenthesis\"},\n\t{std::regex{\",\"}, \"comma\"},\n\t{std::regex{R\"(\\d+(?:\\.\\d+)?(?:e-?\\d+)?)\"}, \"number\"},\n\t{std::regex{R\"([A-Za-z_]\\w*)\"}, \"base_identifier\"},\n\t{std::regex{R\"(\\s+)\"}, \"whitespace\"}\n};\n\nnamespace thewizardplusplus::wizard_parser {\n\nnamespace lexer {\n\nvoid to_json(nlohmann::json& json, const token& some_token) {\n\tjson = {\n\t\t{ \"type\", some_token.type },\n\t\t{ \"value\", some_token.value },\n\t\t{ \"offset\", some_token.offset }\n\t};\n}\n\n}\n\nnamespace parser {\n\nvoid to_json(nlohmann::json& json, const ast_node& ast) {\n\tjson = { { \"type\", ast.type } };\n\tif (!ast.value.empty()) {\n\t\tjson[\"value\"] = ast.value;\n\t}\n\tif (!ast.children.empty()) {\n\t\tjson[\"children\"] = ast.children;\n\t}\n\tif (ast.offset) {\n\t\tjson[\"offset\"] = *ast.offset;\n\t}\n}\n\n}\n\n}\n\nvoid stop(const int& code, std::ostream& stream, const std::string& message) {\n\tstream << fmt::format(\"{:s}\\n\", message);\n\tstd::exit(code);\n}\n\nrule_parser::pointer make_parser() {\n\tconst auto expression_dummy = dummy();\n\tRULE(number) = \"number\"_t;\n\tRULE(key_words) = \"not\"_v | \"and\"_v | \"or\"_v;\n\tRULE(identifier) = \"base_identifier\"_t - key_words;\n\tRULE(function_call) = identifier >> &\"(\"_v >>\n\t\t-(expression_dummy >> *(&\",\"_v >> expression_dummy))\n\t>> &\")\"_v;\n\tRULE(atom) = number\n\t\t| function_call\n\t\t| identifier\n\t\t| (&\"(\"_v >> expression_dummy >> &\")\"_v);\n\tRULE(unary) = *(\"-\"_v | \"not\"_v) >> atom;\n\tRULE(product) = unary >> *((\"*\"_v | \"\/\"_v | \"%\"_v) >> unary);\n\tRULE(sum) = product >> *((\"+\"_v | \"-\"_v) >> product);\n\tRULE(comparison) = sum >> *((\"<\"_v | \"<=\"_v | \">\"_v | \">=\"_v) >> sum);\n\tRULE(equality) = comparison >> *((\"==\"_v | \"\/=\"_v) >> comparison);\n\tRULE(conjunction) = equality >> *(&\"and\"_v >> equality);\n\tRULE(disjunction) = conjunction >> *(&\"or\"_v >> conjunction);\n\texpression_dummy->set_parser(disjunction);\n\n\tRULE(expression) = disjunction >> eoi();\n\treturn expression;\n}\n\nint main(int argc, char* argv[]) try {\n\tauto cleaned_tokens = token_group{};\n\tconst auto options = docopt::docopt(usage, {argv+1, argv+argc}, true);\n\tconst auto code = options.at(\"--stdin\").asBool()\n\t\t? std::string{std::istreambuf_iterator<char>{std::cin}, {}}\n\t\t: options.at(\"<expression>\").asString();\n\tconst auto tokens = tokenize(lexemes, code);\n\tstd::copy_if(\n\t\tstd::cbegin(tokens),\n\t\tstd::cend(tokens),\n\t\tstd::back_inserter(cleaned_tokens),\n\t\t[] (const auto& token) { return token.type != \"whitespace\"; }\n\t);\n\tif (options.at(\"--tokens\").asBool()) {\n\t\tstop(EXIT_SUCCESS, std::cout, nlohmann::json(cleaned_tokens).dump());\n\t}\n\n\tconst auto parser = make_parser();\n\ttry {\n\t\tconst auto ast = parse(parser, cleaned_tokens);\n\t\tstop(EXIT_SUCCESS, std::cout, nlohmann::json(ast).dump());\n\t} catch (const unexpected_entity_exception<entity_type::eoi>& exception) {\n\t\tthrow decltype(exception){code.size()};\n\t}\n} catch (const std::exception& exception) {\n\tstop(EXIT_FAILURE, std::cerr, fmt::format(\"error: {:s}\", exception.what()));\n}\n<commit_msg>Add an offset to a node: replace nodes offsets equal to the `parser::integral_infinity` constant to a code size in the example<commit_after>#define THEWIZARDPLUSPLUS_WIZARD_PARSER_PARSER_MACROSES\n\n#include \"vendor\/json.hpp\"\n#include \"vendor\/docopt\/docopt.hpp\"\n#include \"vendor\/fmt\/format.hpp\"\n#include <thewizardplusplus\/wizard_parser\/lexer\/lexeme.hpp>\n#include <thewizardplusplus\/wizard_parser\/lexer\/token.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/ast_node.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/rule_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/dummy_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/typing_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/match_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/alternation_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/exception_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/concatenation_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/lookahead_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/repetition_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/eoi_parser.hpp>\n#include <thewizardplusplus\/wizard_parser\/lexer\/tokenize.hpp>\n#include <thewizardplusplus\/wizard_parser\/parser\/parse.hpp>\n#include <thewizardplusplus\/wizard_parser\/utilities\/utilities.hpp>\n#include <thewizardplusplus\/wizard_parser\/exceptions\/unexpected_entity_exception.hpp>\n#include <regex>\n#include <iostream>\n#include <string>\n#include <functional>\n#include <algorithm>\n#include <iterator>\n#include <cstdlib>\n#include <exception>\n\nusing namespace thewizardplusplus::wizard_parser::lexer;\nusing namespace thewizardplusplus::wizard_parser::parser;\nusing namespace thewizardplusplus::wizard_parser::parser::operators;\nusing namespace thewizardplusplus::wizard_parser::utilities;\nusing namespace thewizardplusplus::wizard_parser::exceptions;\n\nconst auto usage =\nR\"(Usage:\n .\/example -h | --help\n .\/example [-t | --tokens] [--] <expression>\n .\/example [-t | --tokens] (-s | --stdin)\n\nOptions:\n -h, --help - show this message;\n -t, --tokens - show a token list instead an AST;\n -s, --stdin - read an expression from stdin.)\";\nconst auto lexemes = lexeme_group{\n\t{std::regex{\"==\"}, \"equal\"},\n\t{std::regex{\"\/=\"}, \"not_equal\"},\n\t{std::regex{\"<=\"}, \"less_or_equal\"},\n\t{std::regex{\"<\"}, \"less\"},\n\t{std::regex{\">=\"}, \"great_or_equal\"},\n\t{std::regex{\">\"}, \"great\"},\n\t{std::regex{R\"(\\+)\"}, \"plus\"},\n\t{std::regex{\"-\"}, \"minus\"},\n\t{std::regex{R\"(\\*)\"}, \"star\"},\n\t{std::regex{\"\/\"}, \"slash\"},\n\t{std::regex{\"%\"}, \"percent\"},\n\t{std::regex{R\"(\\()\"}, \"opening_parenthesis\"},\n\t{std::regex{R\"(\\))\"}, \"closing_parenthesis\"},\n\t{std::regex{\",\"}, \"comma\"},\n\t{std::regex{R\"(\\d+(?:\\.\\d+)?(?:e-?\\d+)?)\"}, \"number\"},\n\t{std::regex{R\"([A-Za-z_]\\w*)\"}, \"base_identifier\"},\n\t{std::regex{R\"(\\s+)\"}, \"whitespace\"}\n};\n\nnamespace thewizardplusplus::wizard_parser {\n\nnamespace lexer {\n\nvoid to_json(nlohmann::json& json, const token& some_token) {\n\tjson = {\n\t\t{ \"type\", some_token.type },\n\t\t{ \"value\", some_token.value },\n\t\t{ \"offset\", some_token.offset }\n\t};\n}\n\n}\n\nnamespace parser {\n\nvoid to_json(nlohmann::json& json, const ast_node& ast) {\n\tjson = { { \"type\", ast.type } };\n\tif (!ast.value.empty()) {\n\t\tjson[\"value\"] = ast.value;\n\t}\n\tif (!ast.children.empty()) {\n\t\tjson[\"children\"] = ast.children;\n\t}\n\tif (ast.offset) {\n\t\tjson[\"offset\"] = *ast.offset;\n\t}\n}\n\n}\n\n}\n\nvoid stop(const int& code, std::ostream& stream, const std::string& message) {\n\tstream << fmt::format(\"{:s}\\n\", message);\n\tstd::exit(code);\n}\n\nrule_parser::pointer make_parser() {\n\tconst auto expression_dummy = dummy();\n\tRULE(number) = \"number\"_t;\n\tRULE(key_words) = \"not\"_v | \"and\"_v | \"or\"_v;\n\tRULE(identifier) = \"base_identifier\"_t - key_words;\n\tRULE(function_call) = identifier >> &\"(\"_v >>\n\t\t-(expression_dummy >> *(&\",\"_v >> expression_dummy))\n\t>> &\")\"_v;\n\tRULE(atom) = number\n\t\t| function_call\n\t\t| identifier\n\t\t| (&\"(\"_v >> expression_dummy >> &\")\"_v);\n\tRULE(unary) = *(\"-\"_v | \"not\"_v) >> atom;\n\tRULE(product) = unary >> *((\"*\"_v | \"\/\"_v | \"%\"_v) >> unary);\n\tRULE(sum) = product >> *((\"+\"_v | \"-\"_v) >> product);\n\tRULE(comparison) = sum >> *((\"<\"_v | \"<=\"_v | \">\"_v | \">=\"_v) >> sum);\n\tRULE(equality) = comparison >> *((\"==\"_v | \"\/=\"_v) >> comparison);\n\tRULE(conjunction) = equality >> *(&\"and\"_v >> equality);\n\tRULE(disjunction) = conjunction >> *(&\"or\"_v >> conjunction);\n\texpression_dummy->set_parser(disjunction);\n\n\tRULE(expression) = disjunction >> eoi();\n\treturn expression;\n}\n\nast_node walk_ast(\n\tconst ast_node& ast,\n\tconst std::function<ast_node(const ast_node&)>& handler\n) {\n\tconst auto new_ast = handler(ast);\n\tauto new_children = ast_node_group{};\n\tstd::transform(\n\t\tstd::cbegin(new_ast.children),\n\t\tstd::cend(new_ast.children),\n\t\tstd::back_inserter(new_children),\n\t\t[&] (const auto& ast) { return walk_ast(ast, handler); }\n\t);\n\n\treturn {new_ast.type, new_ast.value, new_children, new_ast.offset};\n}\n\nint main(int argc, char* argv[]) try {\n\tauto cleaned_tokens = token_group{};\n\tconst auto options = docopt::docopt(usage, {argv+1, argv+argc}, true);\n\tconst auto code = options.at(\"--stdin\").asBool()\n\t\t? std::string{std::istreambuf_iterator<char>{std::cin}, {}}\n\t\t: options.at(\"<expression>\").asString();\n\tconst auto tokens = tokenize(lexemes, code);\n\tstd::copy_if(\n\t\tstd::cbegin(tokens),\n\t\tstd::cend(tokens),\n\t\tstd::back_inserter(cleaned_tokens),\n\t\t[] (const auto& token) { return token.type != \"whitespace\"; }\n\t);\n\tif (options.at(\"--tokens\").asBool()) {\n\t\tstop(EXIT_SUCCESS, std::cout, nlohmann::json(cleaned_tokens).dump());\n\t}\n\n\tconst auto parser = make_parser();\n\ttry {\n\t\tconst auto ast = parse(parser, cleaned_tokens);\n\t\tconst auto transformed_ast = walk_ast(ast, [&] (const auto& ast) {\n\t\t\tconst auto offset = ast.offset && *ast.offset == integral_infinity\n\t\t\t\t? code.size()\n\t\t\t\t: ast.offset;\n\t\t\treturn ast_node{ast.type, ast.value, ast.children, offset};\n\t\t});\n\t\tstop(EXIT_SUCCESS, std::cout, nlohmann::json(transformed_ast).dump());\n\t} catch (const unexpected_entity_exception<entity_type::eoi>& exception) {\n\t\tthrow decltype(exception){code.size()};\n\t}\n} catch (const std::exception& exception) {\n\tstop(EXIT_FAILURE, std::cerr, fmt::format(\"error: {:s}\", exception.what()));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: txtatr.hxx,v $\n *\n * $Revision: 1.1.1.1 $\n *\n * last change: $Author: hr $ $Date: 2000-09-18 17:14:29 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _TXTATR_HXX\n#define _TXTATR_HXX\n\n#ifndef _SV_GEN_HXX\n#include <tools\/gen.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _LANG_HXX\n#include <tools\/lang.hxx>\n#endif\n#ifndef _SV_FONTTYPE_HXX \/\/autogen\n#include <vcl\/fonttype.hxx>\n#endif\n#ifndef _SVX_SVXENUM_HXX \/\/autogen\n#include <svx\/svxenum.hxx>\n#endif\n\n#ifndef _TXATBASE_HXX\n#include <txatbase.hxx> \/\/ SwTxtAttr\/SwTxtAttrEnd\n#endif\n\nclass SwTxtNode; \/\/ fuer SwTxtFld\nclass SvxFont;\nclass SwCharSetCol;\n\n\/\/ ATT_FONT ***********************************************************\n\nclass SwTxtFont: public SwTxtAttrEnd\n{\n \/\/ Hier werden die alten Werte aus dem Font bei ChgFnt() gemerkt.\n FontFamily ePrevFamily;\n FontPitch ePrevPitch;\n CharSet ePrevCharSet;\n String aPrevName;\n String aPrevStyleName;\npublic:\n SwTxtFont( const SvxFontItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtFont( );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_POSTURE ***********************************************************\n\nclass SwTxtPosture : public SwTxtAttrEnd\n{\n FontItalic ePrevPosture;\npublic:\n SwTxtPosture( const SvxPostureItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_WEIGHT ************************************************************\n\nclass SwTxtWeight : public SwTxtAttrEnd\n{\n \/\/ Hier merkt es sich das SV-Attribut Weight aus dem Font.\n FontWeight ePrevWeight;\npublic:\n SwTxtWeight( const SvxWeightItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_SHADOWED **********************************************************\n\nclass SwTxtShadowed : public SwTxtAttrEnd\n{\n BOOL bPrevShadow;\npublic:\n SwTxtShadowed( const SvxShadowedItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_AUTOKERN **********************************************************\n\nclass SwTxtAutoKern : public SwTxtAttrEnd\n{\n BOOL bPrevAutoKern;\npublic:\n SwTxtAutoKern( const SvxAutoKernItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\/\/ ATT_WORDLINEMODE **********************************************************\n\nclass SwTxtWordLineMode : public SwTxtAttrEnd\n{\n BOOL bPrevWordLineMode;\npublic:\n SwTxtWordLineMode( const SvxWordLineModeItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CONTOUR ***********************************************************\n\nclass SwTxtContour : public SwTxtAttrEnd\n{\n BOOL bPrevContour;\npublic:\n SwTxtContour( const SvxContourItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CROSSEDOUT ********************************************************\n\nclass SwTxtCrossedOut : public SwTxtAttrEnd\n{\n FontStrikeout ePrevCrossedOut;\npublic:\n SwTxtCrossedOut( const SvxCrossedOutItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_UNDERLINE *********************************************************\n\nclass SwTxtUnderline : public SwTxtAttrEnd\n{\n FontUnderline ePrevUnderline;\npublic:\n SwTxtUnderline( const SvxUnderlineItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_SIZE **************************************************************\n\nclass SwTxtSize : public SwTxtAttrEnd\n{\n Size aPrevSize;\npublic:\n SwTxtSize( const SvxFontHeightItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_COLOR *************************************************************\n\nclass SwTxtColor : public SwTxtAttrEnd\n{\n friend class SwTxtCharSetColor;\n Color aPrevColor;\npublic:\n SwTxtColor( const SvxColorItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CHARSETCOLOR ******************************************************\n\nclass SwTxtCharSetColor : public SwTxtAttrEnd\n{\n SwCharSetCol *pPrevCharSetCol;\npublic:\n SwTxtCharSetColor( const SvxCharSetColorItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtCharSetColor();\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CHARFMT *********************************************\n\nclass SwTxtCharFmt : public SwTxtAttrEnd\n{\n SvxFont* pPrevFont;\n const void* pFontNo;\n SwTxtNode* pMyTxtNd;\n Color* pPrevColor;\n USHORT nFntIndex;\n BOOL bPrevNoHyph : 1;\n BOOL bPrevBlink : 1;\n BOOL bPrevURL : 1;\n BOOL bColor : 1;\n\npublic:\n SwTxtCharFmt( const SwFmtCharFmt& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtCharFmt( );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n\n \/\/ werden vom SwFmtCharFmt hierher weitergeleitet\n virtual void Modify( SfxPoolItem*, SfxPoolItem* ); \/\/ SwClient\n virtual BOOL GetInfo( SfxPoolItem& rInfo ) const;\n\n \/\/ erfrage und setze den TxtNode Pointer\n inline const SwTxtNode& GetTxtNode() const;\n void ChgTxtNode( const SwTxtNode* pNew ) { pMyTxtNd = (SwTxtNode*)pNew; }\n\n};\n\n\n\/\/ ATT_KERNING ***********************************************************\n\nclass SwTxtKerning : public SwTxtAttrEnd\n{\n short nPrevKern;\npublic:\n SwTxtKerning( const SvxKerningItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CASEMAP ***********************************************************\n\nclass SwTxtCaseMap : public SwTxtAttrEnd\n{\n SvxCaseMap ePrevCaseMap;\npublic:\n SwTxtCaseMap( const SvxCaseMapItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_LANGUAGE **********************************************************\n\nclass SwTxtLanguage : public SwTxtAttrEnd\n{\n LanguageType ePrevLang;\npublic:\n SwTxtLanguage( const SvxLanguageItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\n\/\/ ATT_ESCAPEMENT ********************************************************\n\nclass SwTxtEscapement : public SwTxtAttrEnd\n{\n short nPrevEsc;\n BYTE nPrevPropr;\n\npublic:\n SwTxtEscapement( const SvxEscapementItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_BLINK ***********************\n\nclass SwTxtBlink : public SwTxtAttrEnd\n{\n BOOL bPrev;\npublic:\n SwTxtBlink( const SvxBlinkItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_BACKGROUND ***********************\n\nclass SwTxtBackground : public SwTxtAttrEnd\n{\n Color *pPrevColor;\npublic:\n SwTxtBackground( const SvxBrushItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtBackground();\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_NOHYPHENHERE **************************\n\nclass SwTxtNoHyphenHere : public SwTxtAttrEnd\n{\n BOOL bPrev;\npublic:\n SwTxtNoHyphenHere( const SvxNoHyphenItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\/\/ ATT_HARDBLANK ******************************\n\nclass SwTxtHardBlank : public SwTxtAttr\n{\n sal_Unicode cChar;\npublic:\n SwTxtHardBlank( const SwFmtHardBlank& rAttr, xub_StrLen nStart );\n inline sal_Unicode GetChar() const { return cChar; }\n};\n\n\n\/\/ ATT_XNLCONTAINERITEM ******************************\n\nclass SwTxtXMLAttrContainer : public SwTxtAttrEnd\n{\npublic:\n SwTxtXMLAttrContainer( const SvXMLAttrContainerItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n};\n\n\n\n\/\/ --------------- Inline Implementierungen ------------------------\n\n\ninline const SwTxtNode& SwTxtCharFmt::GetTxtNode() const\n{\n ASSERT( pMyTxtNd, \"SwTxtCharFmt:: wo ist mein TextNode?\" );\n return *pMyTxtNd;\n}\n\n\n\n#endif\n<commit_msg> Textattributs for Latin, CJK and CTL<commit_after>\/*************************************************************************\n *\n * $RCSfile: txtatr.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: ama $ $Date: 2000-09-25 12:00:00 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n#ifndef _TXTATR_HXX\n#define _TXTATR_HXX\n\n#ifndef _SV_GEN_HXX\n#include <tools\/gen.hxx>\n#endif\n#ifndef _TOOLS_COLOR_HXX\n#include <tools\/color.hxx>\n#endif\n#ifndef _LANG_HXX\n#include <tools\/lang.hxx>\n#endif\n#ifndef _SV_FONTTYPE_HXX \/\/autogen\n#include <vcl\/fonttype.hxx>\n#endif\n#ifndef _SVX_SVXENUM_HXX \/\/autogen\n#include <svx\/svxenum.hxx>\n#endif\n\n#ifndef _TXATBASE_HXX\n#include <txatbase.hxx> \/\/ SwTxtAttr\/SwTxtAttrEnd\n#endif\n\nclass SwTxtNode; \/\/ fuer SwTxtFld\nclass SvxFont;\nclass SwCharSetCol;\nclass SwImplPrev;\n\n\/\/ ATT_FONT ***********************************************************\n\nclass SwTxtFont: public SwTxtAttrEnd\n{\n \/\/ Hier werden die alten Werte aus dem Font bei ChgFnt() gemerkt.\n String aPrevName;\n String aPrevStyleName;\n FontFamily ePrevFamily;\n FontPitch ePrevPitch;\n CharSet ePrevCharSet;\n BYTE nScript;\npublic:\n SwTxtFont( const SvxFontItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd,\n const BYTE nScrpt );\n ~SwTxtFont( );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_POSTURE ***********************************************************\n\nclass SwTxtPosture : public SwTxtAttrEnd\n{\n FontItalic ePrevPosture;\n BYTE nScript;\npublic:\n SwTxtPosture( const SvxPostureItem& rAttr, xub_StrLen nStart,\n xub_StrLen nEnd, const BYTE nScrpt );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_WEIGHT ************************************************************\n\nclass SwTxtWeight : public SwTxtAttrEnd\n{\n \/\/ Hier merkt es sich das SV-Attribut Weight aus dem Font.\n FontWeight ePrevWeight;\n BYTE nScript;\npublic:\n SwTxtWeight( const SvxWeightItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd,\n const BYTE nScrpt );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_SHADOWED **********************************************************\n\nclass SwTxtShadowed : public SwTxtAttrEnd\n{\n BOOL bPrevShadow;\npublic:\n SwTxtShadowed( const SvxShadowedItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_AUTOKERN **********************************************************\n\nclass SwTxtAutoKern : public SwTxtAttrEnd\n{\n BOOL bPrevAutoKern;\npublic:\n SwTxtAutoKern( const SvxAutoKernItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\/\/ ATT_WORDLINEMODE **********************************************************\n\nclass SwTxtWordLineMode : public SwTxtAttrEnd\n{\n BOOL bPrevWordLineMode;\npublic:\n SwTxtWordLineMode( const SvxWordLineModeItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CONTOUR ***********************************************************\n\nclass SwTxtContour : public SwTxtAttrEnd\n{\n BOOL bPrevContour;\npublic:\n SwTxtContour( const SvxContourItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CROSSEDOUT ********************************************************\n\nclass SwTxtCrossedOut : public SwTxtAttrEnd\n{\n FontStrikeout ePrevCrossedOut;\npublic:\n SwTxtCrossedOut( const SvxCrossedOutItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_UNDERLINE *********************************************************\n\nclass SwTxtUnderline : public SwTxtAttrEnd\n{\n FontUnderline ePrevUnderline;\npublic:\n SwTxtUnderline( const SvxUnderlineItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_SIZE **************************************************************\n\nclass SwTxtSize : public SwTxtAttrEnd\n{\n Size aPrevSize;\n BYTE nScript;\npublic:\n SwTxtSize( const SvxFontHeightItem& rAttr, xub_StrLen nStart,\n xub_StrLen nEnd, const BYTE nScrpt );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_COLOR *************************************************************\n\nclass SwTxtColor : public SwTxtAttrEnd\n{\n friend class SwTxtCharSetColor;\n Color aPrevColor;\npublic:\n SwTxtColor( const SvxColorItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CHARSETCOLOR ******************************************************\n\nclass SwTxtCharSetColor : public SwTxtAttrEnd\n{\n SwCharSetCol *pPrevCharSetCol;\npublic:\n SwTxtCharSetColor( const SvxCharSetColorItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtCharSetColor();\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CHARFMT *********************************************\n\nclass SwTxtCharFmt : public SwTxtAttrEnd\n{\n SwImplPrev *pImpl;\n SwTxtNode* pMyTxtNd;\n BOOL bPrevNoHyph : 1;\n BOOL bPrevBlink : 1;\n BOOL bPrevURL : 1;\n BOOL bColor : 1;\n\npublic:\n SwTxtCharFmt( const SwFmtCharFmt& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtCharFmt( );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n\n \/\/ werden vom SwFmtCharFmt hierher weitergeleitet\n virtual void Modify( SfxPoolItem*, SfxPoolItem* ); \/\/ SwClient\n virtual BOOL GetInfo( SfxPoolItem& rInfo ) const;\n\n \/\/ erfrage und setze den TxtNode Pointer\n inline const SwTxtNode& GetTxtNode() const;\n void ChgTxtNode( const SwTxtNode* pNew ) { pMyTxtNd = (SwTxtNode*)pNew; }\n\n};\n\n\n\/\/ ATT_KERNING ***********************************************************\n\nclass SwTxtKerning : public SwTxtAttrEnd\n{\n short nPrevKern;\npublic:\n SwTxtKerning( const SvxKerningItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_CASEMAP ***********************************************************\n\nclass SwTxtCaseMap : public SwTxtAttrEnd\n{\n SvxCaseMap ePrevCaseMap;\npublic:\n SwTxtCaseMap( const SvxCaseMapItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_LANGUAGE **********************************************************\n\nclass SwTxtLanguage : public SwTxtAttrEnd\n{\n LanguageType ePrevLang;\n BYTE nScript;\npublic:\n SwTxtLanguage( const SvxLanguageItem& rAttr, xub_StrLen nStart,\n xub_StrLen nEnd, const BYTE nScrpt );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\n\/\/ ATT_ESCAPEMENT ********************************************************\n\nclass SwTxtEscapement : public SwTxtAttrEnd\n{\n short nPrevEsc;\n BYTE nPrevPropr;\n\npublic:\n SwTxtEscapement( const SvxEscapementItem& rAttr, xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_BLINK ***********************\n\nclass SwTxtBlink : public SwTxtAttrEnd\n{\n BOOL bPrev;\npublic:\n SwTxtBlink( const SvxBlinkItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_BACKGROUND ***********************\n\nclass SwTxtBackground : public SwTxtAttrEnd\n{\n Color *pPrevColor;\npublic:\n SwTxtBackground( const SvxBrushItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n ~SwTxtBackground();\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n virtual void ChgTxtAttr( SwTxtAttr & );\n virtual void RstTxtAttr( SwTxtAttr & );\n};\n\n\/\/ ATT_NOHYPHENHERE **************************\n\nclass SwTxtNoHyphenHere : public SwTxtAttrEnd\n{\n BOOL bPrev;\npublic:\n SwTxtNoHyphenHere( const SvxNoHyphenItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n\n virtual void ChgFnt(SwFont *);\n virtual void RstFnt(SwFont *);\n};\n\n\/\/ ATT_HARDBLANK ******************************\n\nclass SwTxtHardBlank : public SwTxtAttr\n{\n sal_Unicode cChar;\npublic:\n SwTxtHardBlank( const SwFmtHardBlank& rAttr, xub_StrLen nStart );\n inline sal_Unicode GetChar() const { return cChar; }\n};\n\n\n\/\/ ATT_XNLCONTAINERITEM ******************************\n\nclass SwTxtXMLAttrContainer : public SwTxtAttrEnd\n{\npublic:\n SwTxtXMLAttrContainer( const SvXMLAttrContainerItem& rAttr,\n xub_StrLen nStart, xub_StrLen nEnd );\n};\n\n\n\n\/\/ --------------- Inline Implementierungen ------------------------\n\n\ninline const SwTxtNode& SwTxtCharFmt::GetTxtNode() const\n{\n ASSERT( pMyTxtNd, \"SwTxtCharFmt:: wo ist mein TextNode?\" );\n return *pMyTxtNd;\n}\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before><commit_msg>queue_resize on fixedimage graphic change<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"glyph_layout.hpp\"\n#include \"font_desc.hpp\"\n#include \"resource.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n#include \"..\/base\/math.hpp\"\n#include \"..\/std\/sstream.hpp\"\n\n#include \"..\/geometry\/angles.hpp\"\n#include \"..\/geometry\/any_rect2d.hpp\"\n#include \"..\/base\/thread.hpp\"\n\nnamespace graphics\n{\n double GlyphLayout::getKerning(GlyphLayoutElem const & prevElem,\n GlyphMetrics const & prevMetrics,\n GlyphLayoutElem const & curElem,\n GlyphMetrics const & curMetrics)\n {\n double res = 0;\n \/\/\/ check, whether we should offset this symbol slightly\n \/\/\/ not to overlap the previous symbol\n\n m2::AnyRectD prevSymRectAA(\n prevElem.m_pt.Move(prevMetrics.m_height,\n -prevElem.m_angle.cos(),\n prevElem.m_angle.sin()), \/\/< moving by angle = prevElem.m_angle - math::pi \/ 2\n prevElem.m_angle,\n m2::RectD(prevMetrics.m_xOffset,\n prevMetrics.m_yOffset,\n prevMetrics.m_xOffset + prevMetrics.m_width,\n prevMetrics.m_yOffset + prevMetrics.m_height));\n\n m2::AnyRectD curSymRectAA(\n curElem.m_pt.Move(curMetrics.m_height,\n -curElem.m_angle.cos(),\n curElem.m_angle.sin()), \/\/< moving by angle = curElem.m_angle - math::pi \/ 2\n curElem.m_angle,\n m2::RectD(curMetrics.m_xOffset,\n curMetrics.m_yOffset,\n curMetrics.m_xOffset + curMetrics.m_width,\n curMetrics.m_yOffset + curMetrics.m_height)\n );\n\n if (prevElem.m_angle.val() == curElem.m_angle.val())\n return res;\n\n \/\/m2::RectD prevLocalRect = prevSymRectAA.GetLocalRect();\n m2::PointD pts[4];\n prevSymRectAA.GetGlobalPoints(pts);\n curSymRectAA.ConvertTo(pts, 4);\n\n m2::RectD prevRectInCurSym(pts[0].x, pts[0].y, pts[0].x, pts[0].y);\n prevRectInCurSym.Add(pts[1]);\n prevRectInCurSym.Add(pts[2]);\n prevRectInCurSym.Add(pts[3]);\n\n m2::RectD const & curSymRect = curSymRectAA.GetLocalRect();\n\n if (curSymRect.minX() < prevRectInCurSym.maxX())\n res = prevRectInCurSym.maxX() - curSymRect.minX();\n\n return res;\n }\n\n GlyphLayout::GlyphLayout()\n {}\n\n GlyphLayout::GlyphLayout(GlyphCache * glyphCache,\n FontDesc const & fontDesc,\n m2::PointD const & pt,\n strings::UniString const & visText,\n graphics::EPosition pos)\n : m_firstVisible(0),\n m_lastVisible(visText.size()),\n m_fontDesc(fontDesc),\n m_pivot(pt),\n m_offset(0, 0)\n {\n size_t cnt = visText.size();\n\n m_entries.resize(cnt);\n m_metrics.resize(cnt);\n\n if (!m_fontDesc.IsValid())\n return;\n\n m2::RectD boundRect;\n m2::PointD curPt(0, 0);\n\n bool isFirst = true;\n\n for (size_t i = 0; i < visText.size(); ++i)\n {\n GlyphKey glyphKey(visText[i],\n fontDesc.m_size,\n \/\/fontDesc.m_isMasked,\n false, \/\/< calculating glyph positions using unmasked glyphs.\n fontDesc.m_color);\n\n GlyphMetrics const m = glyphCache->getGlyphMetrics(glyphKey);\n\n if (isFirst)\n {\n boundRect = m2::RectD(m.m_xOffset,\n -m.m_yOffset,\n m.m_xOffset,\n -m.m_yOffset);\n isFirst = false;\n }\n else\n boundRect.Add(m2::PointD(m.m_xOffset + curPt.x, -m.m_yOffset + curPt.y));\n\n boundRect.Add(m2::PointD(m.m_xOffset + m.m_width,\n -(m.m_yOffset + m.m_height)) + curPt);\n\n GlyphLayoutElem elem;\n elem.m_sym = visText[i];\n elem.m_angle = 0;\n elem.m_pt = curPt;\n m_entries[i] = elem;\n m_metrics[i] = m;\n\n curPt += m2::PointD(m.m_xAdvance, m.m_yAdvance);\n }\n\n boundRect.Inflate(2, 2);\n\n m2::PointD ptOffs(-boundRect.SizeX() \/ 2 - boundRect.minX(),\n -boundRect.SizeY() \/ 2 - boundRect.minY());\n\n \/\/\/ adjusting according to position\n if (pos & EPosLeft)\n ptOffs += m2::PointD(-boundRect.SizeX() \/ 2, 0);\n\n if (pos & EPosRight)\n ptOffs += m2::PointD(boundRect.SizeX() \/ 2, 0);\n\n if (pos & EPosAbove)\n ptOffs += m2::PointD(0, -boundRect.SizeY() \/ 2);\n\n if (pos & EPosUnder)\n ptOffs += m2::PointD(0, boundRect.SizeY() \/ 2);\n\n for (unsigned i = 0; i < m_entries.size(); ++i)\n m_entries[i].m_pt += ptOffs;\n\n boundRect.Offset(ptOffs);\n\n m_boundRects.push_back(m2::AnyRectD(boundRect));\n }\n\n GlyphLayout::GlyphLayout(GlyphLayout const & src,\n math::Matrix<double, 3, 3> const & m)\n : m_firstVisible(0),\n m_lastVisible(0),\n m_path(src.m_path, m),\n m_visText(src.m_visText),\n m_pos(src.m_pos),\n m_fontDesc(src.m_fontDesc),\n m_metrics(src.m_metrics),\n m_pivot(0, 0),\n m_offset(0, 0)\n {\n if (!m_fontDesc.IsValid())\n return;\n m_boundRects.push_back(m2::AnyRectD(m2::RectD(0, 0, 0, 0)));\n recalcAlongPath();\n }\n\n GlyphLayout::GlyphLayout(GlyphCache * glyphCache,\n FontDesc const & fontDesc,\n m2::PointD const * pts,\n size_t ptsCount,\n strings::UniString const & visText,\n double fullLength,\n double pathOffset,\n graphics::EPosition pos)\n : m_firstVisible(0),\n m_lastVisible(0),\n m_path(pts, ptsCount, fullLength, pathOffset),\n m_visText(visText),\n m_pos(pos),\n m_fontDesc(fontDesc),\n m_pivot(0, 0),\n m_offset(0, 0)\n {\n if (!m_fontDesc.IsValid())\n return;\n m_boundRects.push_back(m2::AnyRectD(m2::RectD(0, 0, 0, 0)));\n\n size_t cnt = m_visText.size();\n\n m_metrics.resize(cnt);\n\n for (size_t i = 0; i < cnt; ++i)\n {\n GlyphKey key(visText[i],\n m_fontDesc.m_size,\n \/\/m_fontDesc.m_isMasked,\n false, \/\/< calculating glyph positions using the unmasked glyphs.\n graphics::Color(0, 0, 0, 0));\n m_metrics[i] = glyphCache->getGlyphMetrics(key);\n }\n recalcAlongPath();\n }\n\n void GlyphLayout::recalcAlongPath()\n {\n \/\/ get vector of glyphs and calculate string length\n double strLength = 0.0;\n size_t count = m_visText.size();\n\n if (count != 0)\n m_entries.resize(count);\n\n for (size_t i = 0; i < m_entries.size(); ++i)\n {\n m_entries[i].m_sym = m_visText[i];\n strLength += m_metrics[i].m_xAdvance;\n }\n\n if (m_path.fullLength() < strLength)\n return;\n\n PathPoint arrPathStart = m_path.front();\n\n m_pivot = m_path.offsetPoint(arrPathStart, m_path.fullLength() \/ 2.0).m_pt;\n\n \/\/ offset of the text from path's start\n double offset = (m_path.fullLength() - strLength) \/ 2.0;\n\n if (m_pos & graphics::EPosLeft)\n {\n offset = 0;\n m_pivot = arrPathStart.m_pt;\n }\n\n if (m_pos & graphics::EPosRight)\n {\n offset = (m_path.fullLength() - strLength);\n m_pivot = m_path.get(m_path.size() - 1);\n }\n\n \/\/ calculate base line offset\n double blOffset = 2 - m_fontDesc.m_size \/ 2;\n \/\/ on-path kerning should be done for baseline-centered glyphs\n \/\/double kernOffset = blOffset;\n\n if (m_pos & graphics::EPosUnder)\n blOffset = 2 - m_fontDesc.m_size;\n if (m_pos & graphics::EPosAbove)\n blOffset = 2;\n\n offset -= m_path.pathOffset();\n if (-offset >= strLength)\n return;\n\n \/\/ find first visible glyph\n size_t symPos = 0;\n while (offset < 0 && symPos < count)\n offset += m_metrics[symPos++].m_xAdvance;\n\n PathPoint glyphStartPt = m_path.offsetPoint(arrPathStart, offset);\n\n m_firstVisible = symPos;\n\n GlyphLayoutElem prevElem; \/\/< previous glyph, to compute kerning from\n GlyphMetrics prevMetrics;\n bool hasPrevElem = false;\n\n for (; symPos < count; ++symPos)\n {\n \/\/\/ full advance, including possible kerning.\n double fullGlyphAdvance = m_metrics[symPos].m_xAdvance;\n\n GlyphMetrics const & metrics = m_metrics[symPos];\n\n if (glyphStartPt.m_i == -1)\n return;\n\n if (metrics.m_width != 0)\n {\n double fullKern = 0;\n double kern = 0;\n\n int i = 0;\n for (; i < 100; ++i)\n {\n PivotPoint pivotPt = m_path.findPivotPoint(glyphStartPt, metrics, fullKern);\n\n if (pivotPt.m_pp.m_i == -1)\n return;\n\n m_entries[symPos].m_angle = pivotPt.m_angle;\n double centerOffset = metrics.m_xOffset + metrics.m_width \/ 2.0;\n m_entries[symPos].m_pt = pivotPt.m_pp.m_pt.Move(-centerOffset,\n m_entries[symPos].m_angle.sin(),\n m_entries[symPos].m_angle.cos());\n\n\/\/ m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(blOffset, m_entries[symPos].m_angle - math::pi \/ 2);\n\/\/ sin(a - pi \/ 2) == -cos(a)\n\/\/ cos(a - pi \/ 2) == sin(a)\n m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(blOffset,\n -m_entries[symPos].m_angle.cos(),\n m_entries[symPos].m_angle.sin());\n\n\/\/ m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(kernOffset, m_entries[symPos].m_angle - math::pi \/ 2);\n\n \/\/ < check whether we should \"kern\"\n if (hasPrevElem)\n {\n kern = getKerning(prevElem,\n prevMetrics,\n m_entries[symPos],\n m_metrics[symPos]);\n if (kern < 0.5)\n kern = 0;\n\n fullGlyphAdvance += kern;\n fullKern += kern;\n }\n\n if (kern == 0)\n break;\n }\n if (i == 100)\n {\n LOG(LINFO, (\"100 iteration on computing kerning exceeded. possibly infinite loop occured\"));\n }\n\n \/\/\/ kerning should be computed for baseline centered glyph\n prevElem = m_entries[symPos];\n prevMetrics = m_metrics[symPos];\n hasPrevElem = true;\n\n \/\/ < align to baseline\n\/\/ m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(blOffset - kernOffset, m_entries[symPos].m_angle - math::pi \/ 2);\n }\n else\n {\n if (symPos == m_firstVisible)\n {\n m_firstVisible = symPos + 1;\n }\n else\n {\n m_entries[symPos].m_angle = ang::AngleD();\n m_entries[symPos].m_pt = glyphStartPt.m_pt;\n }\n }\n\n glyphStartPt = m_path.offsetPoint(glyphStartPt, fullGlyphAdvance);\n offset += fullGlyphAdvance;\n\n m_lastVisible = symPos + 1;\n }\n\n \/\/\/ storing glyph coordinates relative to pivot point.\n for (unsigned i = m_firstVisible; i < m_lastVisible; ++i)\n m_entries[i].m_pt -= m_pivot;\n\n computeBoundRects();\n }\n\n void GlyphLayout::computeBoundRects()\n {\n map<double, m2::AnyRectD> rects;\n\n for (unsigned i = m_firstVisible; i < m_lastVisible; ++i)\n {\n if (m_metrics[i].m_width != 0)\n {\n ang::AngleD const & a = m_entries[i].m_angle;\n\n map<double, m2::AnyRectD>::iterator it = rects.find(a.val());\n\n m2::AnyRectD symRectAA(\n m_entries[i].m_pt.Move(m_metrics[i].m_height + m_metrics[i].m_yOffset, -a.cos(), a.sin()), \/\/< moving by angle = m_entries[i].m_angle - math::pi \/ 2\n a,\n m2::RectD(m_metrics[i].m_xOffset,\n 0,\n m_metrics[i].m_xOffset + m_metrics[i].m_width,\n m_metrics[i].m_height\n ));\n\n if (it == rects.end())\n rects[a.val()] = symRectAA;\n else\n rects[a.val()].Add(symRectAA);\n }\n }\n\n m_boundRects.clear();\n\n for (map<double, m2::AnyRectD>::const_iterator it = rects.begin(); it != rects.end(); ++it)\n {\n m2::AnyRectD r(it->second);\n m2::PointD zero = r.GlobalZero();\n\n double dx = zero.x - floor(zero.x);\n double dy = zero.y - floor(zero.y);\n\n r.Offset(m2::PointD(-dx, -dy));\n\n r.Offset(m_pivot);\n\n m_boundRects.push_back(r);\n }\n }\n\n size_t GlyphLayout::firstVisible() const\n {\n return m_firstVisible;\n }\n\n size_t GlyphLayout::lastVisible() const\n {\n return m_lastVisible;\n }\n\n buffer_vector<GlyphLayoutElem, 32> const & GlyphLayout::entries() const\n {\n return m_entries;\n }\n\n buffer_vector<m2::AnyRectD, 16> const & GlyphLayout::boundRects() const\n {\n return m_boundRects;\n }\n\n m2::PointD const & GlyphLayout::pivot() const\n {\n return m_pivot;\n }\n\n void GlyphLayout::setPivot(m2::PointD const & pivot)\n {\n for (unsigned i = 0; i < m_boundRects.size(); ++i)\n m_boundRects[i].Offset(pivot - m_pivot);\n\n m_pivot = pivot;\n }\n\n m2::PointD const & GlyphLayout::offset() const\n {\n return m_offset;\n }\n\n void GlyphLayout::setOffset(m2::PointD const & offset)\n {\n for (unsigned i = 0; i < m_boundRects.size(); ++i)\n m_boundRects[i].Offset(offset - m_offset);\n\n m_offset = offset;\n }\n\n graphics::FontDesc const & GlyphLayout::fontDesc() const\n {\n return m_fontDesc;\n }\n}\n<commit_msg>Avoid too bended labels<commit_after>#include \"glyph_layout.hpp\"\n#include \"font_desc.hpp\"\n#include \"resource.hpp\"\n\n#include \"..\/base\/logging.hpp\"\n#include \"..\/base\/math.hpp\"\n#include \"..\/std\/sstream.hpp\"\n\n#include \"..\/geometry\/angles.hpp\"\n#include \"..\/geometry\/any_rect2d.hpp\"\n#include \"..\/base\/thread.hpp\"\n\nnamespace graphics\n{\n double GlyphLayout::getKerning(GlyphLayoutElem const & prevElem,\n GlyphMetrics const & prevMetrics,\n GlyphLayoutElem const & curElem,\n GlyphMetrics const & curMetrics)\n {\n double res = 0;\n \/\/\/ check, whether we should offset this symbol slightly\n \/\/\/ not to overlap the previous symbol\n\n m2::AnyRectD prevSymRectAA(\n prevElem.m_pt.Move(prevMetrics.m_height,\n -prevElem.m_angle.cos(),\n prevElem.m_angle.sin()), \/\/< moving by angle = prevElem.m_angle - math::pi \/ 2\n prevElem.m_angle,\n m2::RectD(prevMetrics.m_xOffset,\n prevMetrics.m_yOffset,\n prevMetrics.m_xOffset + prevMetrics.m_width,\n prevMetrics.m_yOffset + prevMetrics.m_height));\n\n m2::AnyRectD curSymRectAA(\n curElem.m_pt.Move(curMetrics.m_height,\n -curElem.m_angle.cos(),\n curElem.m_angle.sin()), \/\/< moving by angle = curElem.m_angle - math::pi \/ 2\n curElem.m_angle,\n m2::RectD(curMetrics.m_xOffset,\n curMetrics.m_yOffset,\n curMetrics.m_xOffset + curMetrics.m_width,\n curMetrics.m_yOffset + curMetrics.m_height)\n );\n\n if (prevElem.m_angle.val() == curElem.m_angle.val())\n return res;\n\n \/\/m2::RectD prevLocalRect = prevSymRectAA.GetLocalRect();\n m2::PointD pts[4];\n prevSymRectAA.GetGlobalPoints(pts);\n curSymRectAA.ConvertTo(pts, 4);\n\n m2::RectD prevRectInCurSym(pts[0].x, pts[0].y, pts[0].x, pts[0].y);\n prevRectInCurSym.Add(pts[1]);\n prevRectInCurSym.Add(pts[2]);\n prevRectInCurSym.Add(pts[3]);\n\n m2::RectD const & curSymRect = curSymRectAA.GetLocalRect();\n\n if (curSymRect.minX() < prevRectInCurSym.maxX())\n res = prevRectInCurSym.maxX() - curSymRect.minX();\n\n return res;\n }\n\n GlyphLayout::GlyphLayout()\n {}\n\n GlyphLayout::GlyphLayout(GlyphCache * glyphCache,\n FontDesc const & fontDesc,\n m2::PointD const & pt,\n strings::UniString const & visText,\n graphics::EPosition pos)\n : m_firstVisible(0),\n m_lastVisible(visText.size()),\n m_fontDesc(fontDesc),\n m_pivot(pt),\n m_offset(0, 0)\n {\n size_t cnt = visText.size();\n\n m_entries.resize(cnt);\n m_metrics.resize(cnt);\n\n if (!m_fontDesc.IsValid())\n return;\n\n m2::RectD boundRect;\n m2::PointD curPt(0, 0);\n\n bool isFirst = true;\n\n for (size_t i = 0; i < visText.size(); ++i)\n {\n GlyphKey glyphKey(visText[i],\n fontDesc.m_size,\n \/\/fontDesc.m_isMasked,\n false, \/\/< calculating glyph positions using unmasked glyphs.\n fontDesc.m_color);\n\n GlyphMetrics const m = glyphCache->getGlyphMetrics(glyphKey);\n\n if (isFirst)\n {\n boundRect = m2::RectD(m.m_xOffset,\n -m.m_yOffset,\n m.m_xOffset,\n -m.m_yOffset);\n isFirst = false;\n }\n else\n boundRect.Add(m2::PointD(m.m_xOffset + curPt.x, -m.m_yOffset + curPt.y));\n\n boundRect.Add(m2::PointD(m.m_xOffset + m.m_width,\n -(m.m_yOffset + m.m_height)) + curPt);\n\n GlyphLayoutElem elem;\n elem.m_sym = visText[i];\n elem.m_angle = 0;\n elem.m_pt = curPt;\n m_entries[i] = elem;\n m_metrics[i] = m;\n\n curPt += m2::PointD(m.m_xAdvance, m.m_yAdvance);\n }\n\n boundRect.Inflate(2, 2);\n\n m2::PointD ptOffs(-boundRect.SizeX() \/ 2 - boundRect.minX(),\n -boundRect.SizeY() \/ 2 - boundRect.minY());\n\n \/\/\/ adjusting according to position\n if (pos & EPosLeft)\n ptOffs += m2::PointD(-boundRect.SizeX() \/ 2, 0);\n\n if (pos & EPosRight)\n ptOffs += m2::PointD(boundRect.SizeX() \/ 2, 0);\n\n if (pos & EPosAbove)\n ptOffs += m2::PointD(0, -boundRect.SizeY() \/ 2);\n\n if (pos & EPosUnder)\n ptOffs += m2::PointD(0, boundRect.SizeY() \/ 2);\n\n for (unsigned i = 0; i < m_entries.size(); ++i)\n m_entries[i].m_pt += ptOffs;\n\n boundRect.Offset(ptOffs);\n\n m_boundRects.push_back(m2::AnyRectD(boundRect));\n }\n\n GlyphLayout::GlyphLayout(GlyphLayout const & src,\n math::Matrix<double, 3, 3> const & m)\n : m_firstVisible(0),\n m_lastVisible(0),\n m_path(src.m_path, m),\n m_visText(src.m_visText),\n m_pos(src.m_pos),\n m_fontDesc(src.m_fontDesc),\n m_metrics(src.m_metrics),\n m_pivot(0, 0),\n m_offset(0, 0)\n {\n if (!m_fontDesc.IsValid())\n return;\n m_boundRects.push_back(m2::AnyRectD(m2::RectD(0, 0, 0, 0)));\n recalcAlongPath();\n }\n\n GlyphLayout::GlyphLayout(GlyphCache * glyphCache,\n FontDesc const & fontDesc,\n m2::PointD const * pts,\n size_t ptsCount,\n strings::UniString const & visText,\n double fullLength,\n double pathOffset,\n graphics::EPosition pos)\n : m_firstVisible(0),\n m_lastVisible(0),\n m_path(pts, ptsCount, fullLength, pathOffset),\n m_visText(visText),\n m_pos(pos),\n m_fontDesc(fontDesc),\n m_pivot(0, 0),\n m_offset(0, 0)\n {\n if (!m_fontDesc.IsValid())\n return;\n m_boundRects.push_back(m2::AnyRectD(m2::RectD(0, 0, 0, 0)));\n\n size_t cnt = m_visText.size();\n\n m_metrics.resize(cnt);\n\n for (size_t i = 0; i < cnt; ++i)\n {\n GlyphKey key(visText[i],\n m_fontDesc.m_size,\n \/\/m_fontDesc.m_isMasked,\n false, \/\/< calculating glyph positions using the unmasked glyphs.\n graphics::Color(0, 0, 0, 0));\n m_metrics[i] = glyphCache->getGlyphMetrics(key);\n }\n recalcAlongPath();\n }\n\n void GlyphLayout::recalcAlongPath()\n {\n \/\/ get vector of glyphs and calculate string length\n double strLength = 0.0;\n size_t count = m_visText.size();\n\n if (count != 0)\n m_entries.resize(count);\n\n for (size_t i = 0; i < m_entries.size(); ++i)\n {\n m_entries[i].m_sym = m_visText[i];\n strLength += m_metrics[i].m_xAdvance;\n }\n\n if (m_path.fullLength() < strLength)\n return;\n\n PathPoint arrPathStart = m_path.front();\n\n m_pivot = m_path.offsetPoint(arrPathStart, m_path.fullLength() \/ 2.0).m_pt;\n\n \/\/ offset of the text from path's start\n double offset = (m_path.fullLength() - strLength) \/ 2.0;\n\n if (m_pos & graphics::EPosLeft)\n {\n offset = 0;\n m_pivot = arrPathStart.m_pt;\n }\n\n if (m_pos & graphics::EPosRight)\n {\n offset = (m_path.fullLength() - strLength);\n m_pivot = m_path.get(m_path.size() - 1);\n }\n\n \/\/ calculate base line offset\n double blOffset = 2 - m_fontDesc.m_size \/ 2;\n \/\/ on-path kerning should be done for baseline-centered glyphs\n \/\/double kernOffset = blOffset;\n\n if (m_pos & graphics::EPosUnder)\n blOffset = 2 - m_fontDesc.m_size;\n if (m_pos & graphics::EPosAbove)\n blOffset = 2;\n\n offset -= m_path.pathOffset();\n if (-offset >= strLength)\n return;\n\n \/\/ find first visible glyph\n size_t symPos = 0;\n while (offset < 0 && symPos < count)\n offset += m_metrics[symPos++].m_xAdvance;\n\n PathPoint glyphStartPt = m_path.offsetPoint(arrPathStart, offset);\n\n m_firstVisible = symPos;\n\n GlyphLayoutElem prevElem; \/\/< previous glyph, to compute kerning from\n GlyphMetrics prevMetrics;\n bool hasPrevElem = false;\n\n for (; symPos < count; ++symPos)\n {\n \/\/\/ full advance, including possible kerning.\n double fullGlyphAdvance = m_metrics[symPos].m_xAdvance;\n\n GlyphMetrics const & metrics = m_metrics[symPos];\n\n if (glyphStartPt.m_i == -1)\n return;\n\n if (metrics.m_width != 0)\n {\n double fullKern = 0;\n double kern = 0;\n\n bool pathIsTooBended = false;\n\n int i = 0;\n for (; i < 100; ++i)\n {\n PivotPoint pivotPt = m_path.findPivotPoint(glyphStartPt, metrics, fullKern);\n\n if (pivotPt.m_pp.m_i == -1)\n return;\n\n m_entries[symPos].m_angle = pivotPt.m_angle;\n double centerOffset = metrics.m_xOffset + metrics.m_width \/ 2.0;\n m_entries[symPos].m_pt = pivotPt.m_pp.m_pt.Move(-centerOffset,\n m_entries[symPos].m_angle.sin(),\n m_entries[symPos].m_angle.cos());\n\n m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(blOffset,\n -m_entries[symPos].m_angle.cos(),\n m_entries[symPos].m_angle.sin());\n\n \/\/ check if angle between letters is too big\n if (hasPrevElem && (ang::GetShortestDistance(prevElem.m_angle.m_val, m_entries[symPos].m_angle.m_val) > 0.8)){\n pathIsTooBended = true;\n break;\n }\n\n \/\/ < check whether we should \"kern\"\n if (hasPrevElem)\n {\n kern = getKerning(prevElem,\n prevMetrics,\n m_entries[symPos],\n m_metrics[symPos]);\n if (kern < 0.5)\n kern = 0;\n\n fullGlyphAdvance += kern;\n fullKern += kern;\n }\n\n if (kern == 0)\n break;\n }\n if (i == 100)\n {\n LOG(LINFO, (\"100 iteration on computing kerning exceeded. possibly infinite loop occured\"));\n }\n if (pathIsTooBended)\n break;\n\n \/\/\/ kerning should be computed for baseline centered glyph\n prevElem = m_entries[symPos];\n prevMetrics = m_metrics[symPos];\n hasPrevElem = true;\n\n \/\/ < align to baseline\n\/\/ m_entries[symPos].m_pt = m_entries[symPos].m_pt.Move(blOffset - kernOffset, m_entries[symPos].m_angle - math::pi \/ 2);\n }\n else\n {\n if (symPos == m_firstVisible)\n {\n m_firstVisible = symPos + 1;\n }\n else\n {\n m_entries[symPos].m_angle = ang::AngleD();\n m_entries[symPos].m_pt = glyphStartPt.m_pt;\n }\n }\n\n glyphStartPt = m_path.offsetPoint(glyphStartPt, fullGlyphAdvance);\n offset += fullGlyphAdvance;\n\n m_lastVisible = symPos + 1;\n }\n\n \/\/\/ storing glyph coordinates relative to pivot point.\n for (unsigned i = m_firstVisible; i < m_lastVisible; ++i)\n m_entries[i].m_pt -= m_pivot;\n\n computeBoundRects();\n }\n\n void GlyphLayout::computeBoundRects()\n {\n map<double, m2::AnyRectD> rects;\n\n for (unsigned i = m_firstVisible; i < m_lastVisible; ++i)\n {\n if (m_metrics[i].m_width != 0)\n {\n ang::AngleD const & a = m_entries[i].m_angle;\n\n map<double, m2::AnyRectD>::iterator it = rects.find(a.val());\n\n m2::AnyRectD symRectAA(\n m_entries[i].m_pt.Move(m_metrics[i].m_height + m_metrics[i].m_yOffset, -a.cos(), a.sin()), \/\/< moving by angle = m_entries[i].m_angle - math::pi \/ 2\n a,\n m2::RectD(m_metrics[i].m_xOffset,\n 0,\n m_metrics[i].m_xOffset + m_metrics[i].m_width,\n m_metrics[i].m_height\n ));\n\n if (it == rects.end())\n rects[a.val()] = symRectAA;\n else\n rects[a.val()].Add(symRectAA);\n }\n }\n\n m_boundRects.clear();\n\n for (map<double, m2::AnyRectD>::const_iterator it = rects.begin(); it != rects.end(); ++it)\n {\n m2::AnyRectD r(it->second);\n m2::PointD zero = r.GlobalZero();\n\n double dx = zero.x - floor(zero.x);\n double dy = zero.y - floor(zero.y);\n\n r.Offset(m2::PointD(-dx, -dy));\n\n r.Offset(m_pivot);\n\n m_boundRects.push_back(r);\n }\n }\n\n size_t GlyphLayout::firstVisible() const\n {\n return m_firstVisible;\n }\n\n size_t GlyphLayout::lastVisible() const\n {\n return m_lastVisible;\n }\n\n buffer_vector<GlyphLayoutElem, 32> const & GlyphLayout::entries() const\n {\n return m_entries;\n }\n\n buffer_vector<m2::AnyRectD, 16> const & GlyphLayout::boundRects() const\n {\n return m_boundRects;\n }\n\n m2::PointD const & GlyphLayout::pivot() const\n {\n return m_pivot;\n }\n\n void GlyphLayout::setPivot(m2::PointD const & pivot)\n {\n for (unsigned i = 0; i < m_boundRects.size(); ++i)\n m_boundRects[i].Offset(pivot - m_pivot);\n\n m_pivot = pivot;\n }\n\n m2::PointD const & GlyphLayout::offset() const\n {\n return m_offset;\n }\n\n void GlyphLayout::setOffset(m2::PointD const & offset)\n {\n for (unsigned i = 0; i < m_boundRects.size(); ++i)\n m_boundRects[i].Offset(offset - m_offset);\n\n m_offset = offset;\n }\n\n graphics::FontDesc const & GlyphLayout::fontDesc() const\n {\n return m_fontDesc;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include <OpenSim\/OpenSim.h>\n\nusing namespace OpenSim;\nusing namespace SimTK;\n\ntemplate <typename T>\nclass DataSource_ : public ModelComponent {\n OpenSim_DECLARE_CONCRETE_OBJECT_T(DataSource_, T, ModelComponent);\n OpenSim_DECLARE_OUTPUT(columns, T, getColumnAtTime, SimTK::Stage::Instance);\n\/\/ OpenSim_DECLARE_OUTPUT(all, Vector<T>, getRow, SimTK::Stage::Instance);\npublic:\n \n T getColumnAtTime(const SimTK::State& s) const {\n return interpolate(s.getTime(), 0);\n }\n \n T interpolate(const double& time, int rowIndex) const {\n const auto& times(_table.getIndependentColumn());\n \n \/\/ Get the first time greater or equal to the requested time.\n const auto& lowerb = std::lower_bound(times.begin(), times.end(), time);\n const auto& timeLowerb = *lowerb;\n const auto& ilowerb = lowerb - times.begin();\n \/\/ If the the time is an exact match to an existing column.\n if (timeLowerb == time) {\n const auto& row = _table.getRowAtIndex(ilowerb);\n return row[rowIndex];\n }\n \n \/\/ Get the latest time that is less than the requested time.\n const auto& below = lowerb - 1;\n const auto& timeBelow = (*below);\n const auto& ibelow = below - times.begin();\n \n \/\/ If we got this far, then lowerb is the first time greater than\n \/\/ the requested time.\n const auto& iabove = ilowerb;\n const auto& timeAbove = timeLowerb;\n \n \/\/ Compute fraction within the interval.\n const double numer = time - timeBelow;\n const double denom = timeAbove - timeBelow;\n const double fraction = denom < SimTK::Eps ? 0.0 : numer \/ denom;\n \n \/\/ Get the rows at the below and above times.\n const auto& rowBelow = _table.getRowAtIndex(ibelow);\n const auto& rowAbove = _table.getRowAtIndex(iabove);\n \n const T& delta = rowAbove[rowIndex] - rowBelow[rowIndex];\n return rowBelow[rowIndex] + fraction * delta;\n }\n \n TimeSeriesTable_<T>& updTable() { return _table; }\n const TimeSeriesTable_<T> getTable() const { return _table; }\n \nprivate:\n \n TimeSeriesTable_<T> _table;\n};\n\ntypedef DataSource_<double> DataSource;\n\ntemplate <typename T>\nclass ConsoleReporter_ : public ModelComponent {\n OpenSim_DECLARE_CONCRETE_OBJECT_T(ConsoleReporter_, T, Component);\npublic:\n OpenSim_DECLARE_LIST_INPUT(input, T, SimTK::Stage::Acceleration, \"\");\nprivate:\n void extendRealizeReport(const State& state) const override {\n const auto& input = getInput(\"input\");\n \n if (_printCount % 20 == 0) {\n std::cout << \"[\" << getName() << \"] \"\n << std::setw(_width) << \"time\" << \" \";\n for (auto idx = 0; idx < input.getNumConnectees(); ++idx) {\n const auto& output = Input<T>::downcast(input).getOutput(idx);\n const auto& outName = output.getName();\n const auto& truncName = outName.size() <= _width ?\n outName : outName.substr(outName.size() - _width);\n std::cout << std::setw(_width) << truncName << \"|\";\n }\n std::cout << \"\\n\";\n }\n std::cout << \"[\" << getName() << \"] \"\n << std::setw(_width) << state.getTime() << \"| \";\n for (auto idx = 0; idx < input.getNumConnectees(); ++idx) {\n const auto& output = Input<T>::downcast(input).getOutput(idx);\n const auto& value = output.getValue(state);\n const auto& nSigFigs = output.getNumberOfSignificantDigits();\n std::cout << std::setw(_width)\n << std::setprecision(nSigFigs) << value << \"|\";\n }\n std::cout << std::endl;\n \n const_cast<ConsoleReporter_<T>*>(this)->_printCount++;\n }\n unsigned int _printCount = 0;\n int _width = 12;\n};\n\ntypedef ConsoleReporter_<double> ConsoleReporter;\n\nvoid integrate(const System& system, Integrator& integrator,\n const State& initialState,\n Real finalTime) {\n TimeStepper ts(system, integrator);\n ts.initialize(initialState);\n ts.setReportAllSignificantStates(true);\n integrator.setReturnEveryInternalStep(true); \n while (ts.getState().getTime() < finalTime) {\n ts.stepTo(finalTime);\n system.realize(ts.getState(), SimTK::Stage::Report);\n }\n}\n\nvoid testOutputVectorsAndChannels() {\n Model model;\n \n \/\/ DataSource\n \/\/ ----------\n auto* src = new DataSource();\n model.addModelComponent(src);\n \n \/\/ Fill up the DataSource.\n auto& table = src->updTable();\n \n \/\/ Column labels (in only 7 lines!)\n ValueArray<std::string> labelValues;\n auto& vec = labelValues.upd();\n for (unsigned i = 0; i < 5; ++i) {\n vec.push_back(SimTK::Value<std::string>(\"col\" + std::to_string(i)));\n }\n TimeSeriesTable::DependentsMetaData depMeta;\n depMeta.setValueArrayForKey(\"labels\", labelValues);\n table.setDependentsMetaData(depMeta);\n \n TimeSeriesTable::RowVector row(5, 0.0);\n table.appendRow(0.0, row);\n row += 1;\n table.appendRow(0.25, row);\n row += 1;\n table.appendRow(0.50, row);\n row += 1;\n table.appendRow(0.75, row);\n row += 1;\n table.appendRow(1.0, row);\n row += 1;\n table.appendRow(1.1, row);\n \n \/\/ Reporter\n \/\/ --------\n auto* rep = new ConsoleReporter();\n rep->setName(\"interped\");\n model.addModelComponent(rep);\n \n rep->updInput(\"input\").connect(src->getOutput(\"columns\"));\n \n SimTK::State& s = model.initSystem();\n RungeKuttaMersonIntegrator integrator(model.getSystem());\n integrator.setFixedStepSize(0.1);\n integrate(model.getSystem(), integrator, s, 1.0);\n \n}\n\nint main() {\n \/\/ TODO SimTK_START_TEST(\"futureOutputVectorsAndChannels\");\n SimTK_SUBTEST(testOutputVectorsAndChannels);\n \/\/SimTK_END_TEST();\n}\n\n\n\n\n<commit_msg>Start prototyping channels.<commit_after>#include <OpenSim\/OpenSim.h>\n\nusing namespace OpenSim;\nusing namespace SimTK;\n\ntemplate <typename T>\nclass DataSource_ : public ModelComponent {\n OpenSim_DECLARE_CONCRETE_OBJECT_T(DataSource_, T, ModelComponent);\n OpenSim_DECLARE_OUTPUT(columns, T, getColumnAtTime, SimTK::Stage::Instance);\n\/\/ OpenSim_DECLARE_OUTPUT(all, Vector<T>, getRow, SimTK::Stage::Instance);\npublic:\n \n T getColumnAtTime(const SimTK::State& s) const {\n return interpolate(s.getTime(), 0);\n }\n \n T interpolate(const double& time, int rowIndex) const {\n const auto& times(_table.getIndependentColumn());\n \n \/\/ Get the first time greater or equal to the requested time.\n const auto& lowerb = std::lower_bound(times.begin(), times.end(), time);\n const auto& timeLowerb = *lowerb;\n const auto& ilowerb = lowerb - times.begin();\n \/\/ If the the time is an exact match to an existing column.\n if (timeLowerb == time) {\n const auto& row = _table.getRowAtIndex(ilowerb);\n return row[rowIndex];\n }\n \n \/\/ Get the latest time that is less than the requested time.\n const auto& below = lowerb - 1;\n const auto& timeBelow = (*below);\n const auto& ibelow = below - times.begin();\n \n \/\/ If we got this far, then lowerb is the first time greater than\n \/\/ the requested time.\n const auto& iabove = ilowerb;\n const auto& timeAbove = timeLowerb;\n \n \/\/ Compute fraction within the interval.\n const double numer = time - timeBelow;\n const double denom = timeAbove - timeBelow;\n const double fraction = denom < SimTK::Eps ? 0.0 : numer \/ denom;\n \n \/\/ Get the rows at the below and above times.\n const auto& rowBelow = _table.getRowAtIndex(ibelow);\n const auto& rowAbove = _table.getRowAtIndex(iabove);\n \n const T& delta = rowAbove[rowIndex] - rowBelow[rowIndex];\n return rowBelow[rowIndex] + fraction * delta;\n }\n \n TimeSeriesTable_<T>& updTable() { return _table; }\n const TimeSeriesTable_<T> getTable() const { return _table; }\n \nprivate:\n\n\/\/ void extendFinalizeFromProperties() const {\n\/\/ for (int icol = 0; ++icol < _table.getNumColumns(); ++icol) {\n\/\/ getOutput(\"columns\").addChannel()\n\/\/ }\n\/\/ }\n \n TimeSeriesTable_<T> _table;\n};\n\ntypedef DataSource_<double> DataSource;\n\ntemplate <typename T>\nclass ConsoleReporter_ : public ModelComponent {\n OpenSim_DECLARE_CONCRETE_OBJECT_T(ConsoleReporter_, T, Component);\npublic:\n OpenSim_DECLARE_LIST_INPUT(input, T, SimTK::Stage::Acceleration, \"\");\nprivate:\n void extendRealizeReport(const State& state) const override {\n const auto& input = getInput(\"input\");\n \n if (_printCount % 20 == 0) {\n std::cout << \"[\" << getName() << \"] \"\n << std::setw(_width) << \"time\" << \" \";\n for (auto idx = 0; idx < input.getNumConnectees(); ++idx) {\n const auto& output = Input<T>::downcast(input).getOutput(idx);\n const auto& outName = output.getName();\n const auto& truncName = outName.size() <= _width ?\n outName : outName.substr(outName.size() - _width);\n std::cout << std::setw(_width) << truncName << \"|\";\n }\n std::cout << \"\\n\";\n }\n std::cout << \"[\" << getName() << \"] \"\n << std::setw(_width) << state.getTime() << \"| \";\n for (auto idx = 0; idx < input.getNumConnectees(); ++idx) {\n const auto& output = Input<T>::downcast(input).getOutput(idx);\n const auto& value = output.getValue(state);\n const auto& nSigFigs = output.getNumberOfSignificantDigits();\n std::cout << std::setw(_width)\n << std::setprecision(nSigFigs) << value << \"|\";\n }\n std::cout << std::endl;\n \n const_cast<ConsoleReporter_<T>*>(this)->_printCount++;\n }\n unsigned int _printCount = 0;\n int _width = 12;\n};\n\ntypedef ConsoleReporter_<double> ConsoleReporter;\n\nvoid integrate(const System& system, Integrator& integrator,\n const State& initialState,\n Real finalTime) {\n TimeStepper ts(system, integrator);\n ts.initialize(initialState);\n ts.setReportAllSignificantStates(true);\n integrator.setReturnEveryInternalStep(true); \n while (ts.getState().getTime() < finalTime) {\n ts.stepTo(finalTime);\n system.realize(ts.getState(), SimTK::Stage::Report);\n }\n}\n\nvoid testOutputVectorsAndChannels() {\n Model model;\n \n \/\/ DataSource\n \/\/ ----------\n auto* src = new DataSource();\n model.addModelComponent(src);\n \n \/\/ Fill up the DataSource.\n auto& table = src->updTable();\n \n \/\/ Column labels (in only 7 lines!)\n ValueArray<std::string> labelValues;\n auto& vec = labelValues.upd();\n for (unsigned i = 0; i < 5; ++i) {\n vec.push_back(SimTK::Value<std::string>(\"col\" + std::to_string(i)));\n }\n TimeSeriesTable::DependentsMetaData depMeta;\n depMeta.setValueArrayForKey(\"labels\", labelValues);\n table.setDependentsMetaData(depMeta);\n \n TimeSeriesTable::RowVector row(5, 0.0);\n table.appendRow(0.0, row);\n row += 1;\n table.appendRow(0.25, row);\n row += 1;\n table.appendRow(0.50, row);\n row += 1;\n table.appendRow(0.75, row);\n row += 1;\n table.appendRow(1.0, row);\n row += 1;\n table.appendRow(1.1, row);\n \n \/\/ Reporter\n \/\/ --------\n auto* rep = new ConsoleReporter();\n rep->setName(\"interped\");\n model.addModelComponent(rep);\n \n rep->updInput(\"input\").connect(src->getOutput(\"columns\"));\n \n SimTK::State& s = model.initSystem();\n RungeKuttaMersonIntegrator integrator(model.getSystem());\n integrator.setFixedStepSize(0.1);\n integrate(model.getSystem(), integrator, s, 1.0);\n \n}\n\nint main() {\n \/\/ TODO SimTK_START_TEST(\"futureOutputVectorsAndChannels\");\n SimTK_SUBTEST(testOutputVectorsAndChannels);\n \/\/SimTK_END_TEST();\n}\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTask *AddTask_ConversionsForNano(\n Int_t dataset = 0, Bool_t isMC = kFALSE, TString periodNameV0Reader = \"\",\n TString cutnumberPhoton = \"00200078400000001240820000\") {\n gSystem->Load(\"libPWGGAGammaConv\");\n\n \/\/ get the current analysis manager\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return 0;\n }\n\n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler = mgr->GetInputEventHandler();\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n Bool_t enableV0findingEffi = kFALSE;\n Bool_t fillHistos = kTRUE;\n Bool_t runLightOutput = kTRUE;\n AliConvEventCuts *fEventCuts = NULL;\n AliConversionPhotonCuts *fCuts = NULL;\n TString cutnumberEvent = \"00000000\";\n\n AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(\"ConvGammaAODProduction\");\n\n if (periodNameV0Reader.CompareTo(\"\") != 0)\n fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n fV0ReaderV1->SetCreateAODs(kTRUE);\n fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return NULL;\n }\n\n if (cutnumberEvent != \"\") {\n fEventCuts =\n new AliConvEventCuts(cutnumberEvent.Data(), cutnumberEvent.Data());\n fEventCuts->SetPreSelectionCutFlag(kTRUE);\n fEventCuts->SetV0ReaderName(\"ConvGammaAODProduction\");\n if (fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())) {\n fV0ReaderV1->SetEventCuts(fEventCuts);\n }\n }\n\n if (cutnumberPhoton != \"\") {\n fCuts = new AliConversionPhotonCuts(cutnumberPhoton.Data(),\n cutnumberPhoton.Data());\n fCuts->SetIsHeavyIon(false);\n fCuts->SetV0ReaderName(\"ConvGammaAODProduction\");\n if (fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())) {\n fV0ReaderV1->SetConversionCuts(fCuts);\n }\n }\n fV0ReaderV1->Init();\n AliLog::SetGlobalLogLevel(AliLog::kFatal);\n\n \/\/ connect input V0Reader\n mgr->AddTask(fV0ReaderV1);\n mgr->ConnectInput(fV0ReaderV1, 0, cinput);\n\n AliLog::SetGlobalLogLevel(AliLog::kInfo);\n\n \/\/================================================\n \/\/ data containers\n \/\/================================================\n \/\/ find input container\n \/\/ below the trunk version\n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(\"PCM onflyV0Finder container\", TBits::Class(),\n AliAnalysisManager::kExchangeContainer);\n\n mgr->ConnectOutput(fV0ReaderV1, 1, coutput);\n\n return fV0ReaderV1;\n}\n<commit_msg>Improve the photon cuts and enable Addv0InESDFilter<commit_after>AliAnalysisTask *AddTask_ConversionsForNano(\n Int_t dataset = 0, Bool_t isMC = kFALSE, TString periodNameV0Reader = \"\",\n TString cutnumberPhoton = \"00200078000000001240820000\") {\n gSystem->Load(\"libPWGGAGammaConv\");\n\n \/\/ get the current analysis manager\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return 0;\n }\n\n \/\/ ================== GetInputEventHandler =============================\n AliVEventHandler *inputHandler = mgr->GetInputEventHandler();\n AliAnalysisDataContainer *cinput = mgr->GetCommonInputContainer();\n\n Bool_t enableV0findingEffi = kFALSE;\n Bool_t fillHistos = kTRUE;\n Bool_t runLightOutput = kTRUE;\n AliConvEventCuts *fEventCuts = NULL;\n AliConversionPhotonCuts *fCuts = NULL;\n TString cutnumberEvent = \"00000000\";\n\n AliV0ReaderV1 *fV0ReaderV1 = new AliV0ReaderV1(\"ConvGammaAODProduction\");\n\n if (periodNameV0Reader.CompareTo(\"\") != 0)\n fV0ReaderV1->SetPeriodName(periodNameV0Reader);\n fV0ReaderV1->SetAddv0sInESDFilter(kTRUE);\n fV0ReaderV1->SetCreateAODs(kTRUE);\n fV0ReaderV1->SetUseOwnXYZCalculation(kTRUE);\n fV0ReaderV1->SetUseAODConversionPhoton(kTRUE);\n\n if (!mgr) {\n Error(\"AddTask_V0ReaderV1\", \"No analysis manager found.\");\n return NULL;\n }\n\n if (cutnumberEvent != \"\") {\n fEventCuts =\n new AliConvEventCuts(cutnumberEvent.Data(), cutnumberEvent.Data());\n fEventCuts->SetPreSelectionCutFlag(kTRUE);\n fEventCuts->SetV0ReaderName(\"ConvGammaAODProduction\");\n if (fEventCuts->InitializeCutsFromCutString(cutnumberEvent.Data())) {\n fV0ReaderV1->SetEventCuts(fEventCuts);\n }\n }\n\n if (cutnumberPhoton != \"\") {\n fCuts = new AliConversionPhotonCuts(cutnumberPhoton.Data(),\n cutnumberPhoton.Data());\n fCuts->SetIsHeavyIon(false);\n fCuts->SetV0ReaderName(\"ConvGammaAODProduction\");\n if (fCuts->InitializeCutsFromCutString(cutnumberPhoton.Data())) {\n fV0ReaderV1->SetConversionCuts(fCuts);\n }\n }\n fV0ReaderV1->Init();\n AliLog::SetGlobalLogLevel(AliLog::kFatal);\n\n \/\/ connect input V0Reader\n mgr->AddTask(fV0ReaderV1);\n mgr->ConnectInput(fV0ReaderV1, 0, cinput);\n\n AliLog::SetGlobalLogLevel(AliLog::kInfo);\n\n \/\/================================================\n \/\/ data containers\n \/\/================================================\n \/\/ find input container\n \/\/ below the trunk version\n AliAnalysisDataContainer *coutput =\n mgr->CreateContainer(\"PCM onflyV0Finder container\", TBits::Class(),\n AliAnalysisManager::kExchangeContainer);\n\n mgr->ConnectOutput(fV0ReaderV1, 1, coutput);\n\n return fV0ReaderV1;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>WaE: unused variable 'aSrcOutRect'<commit_after><|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#define Region QtXRegion\n\n#include <QColor>\n#include <QStyle>\n\n#include <kconfig.h>\n#include <kglobal.h>\n#include <kmenubar.h>\n#include <kconfiggroup.h>\n#include <kmainwindow.h>\n#include <kapplication.h>\n#include <ktoolbar.h>\n\n#undef Region\n\n#include \"KDESalFrame.hxx\"\n#include \"KDEXLib.hxx\"\n#include \"KDESalGraphics.hxx\"\n\n#include <vcl\/settings.hxx>\n#include <vcl\/font.hxx>\n#include <tools\/color.hxx>\n\n#include <vcl\/svdata.hxx>\n\n#include <pspgraphics.h>\n\n#if OSL_DEBUG_LEVEL > 1\n#include <stdio.h>\n#endif\n\nKDESalFrame::KDESalFrame( SalFrame* pParent, sal_uLong nState ) :\n X11SalFrame( pParent, nState )\n{\n}\n\nvoid KDESalFrame::Show( sal_Bool bVisible, sal_Bool bNoActivate )\n{\n if ( !GetParent() && ! (GetStyle() & SAL_FRAME_STYLE_INTRO) )\n {\n KDEXLib* pXLib = static_cast<KDEXLib*>(GetDisplay()->GetXLib());\n pXLib->doStartup();\n }\n\n X11SalFrame::Show( bVisible, bNoActivate );\n}\n\n\/** Helper function to convert colors.\n*\/\nstatic Color toColor( const QColor &rColor )\n{\n return Color( rColor.red(), rColor.green(), rColor.blue() );\n}\n\n\/** Helper function to read untranslated text entry from KConfig configuration repository.\n*\/\nstatic OUString readEntryUntranslated( KConfigGroup *pGroup, const char *pKey )\n{\n return OUString::createFromAscii( (const char *) pGroup->readEntryUntranslated( pKey ).toAscii() );\n}\n\n#if 0\n#endif\n\/** Helper function to add information to Font from QFont.\n\n Mostly grabbed from the Gtk+ vclplug (salnativewidgets-gtk.cxx).\n*\/\nstatic Font toFont( const QFont &rQFont, const ::com::sun::star::lang::Locale& rLocale )\n{\n psp::FastPrintFontInfo aInfo;\n QFontInfo qFontInfo( rQFont );\n\n \/\/ set family name\n aInfo.m_aFamilyName = String( (const char *) rQFont.family().toUtf8(), RTL_TEXTENCODING_UTF8 );\n\n \/\/ set italic\n aInfo.m_eItalic = ( qFontInfo.italic()? psp::italic::Italic: psp::italic::Upright );\n\n \/\/ set weight\n int nWeight = qFontInfo.weight();\n if ( nWeight <= QFont::Light )\n aInfo.m_eWeight = psp::weight::Light;\n else if ( nWeight <= QFont::Normal )\n aInfo.m_eWeight = psp::weight::Normal;\n else if ( nWeight <= QFont::DemiBold )\n aInfo.m_eWeight = psp::weight::SemiBold;\n else if ( nWeight <= QFont::Bold )\n aInfo.m_eWeight = psp::weight::Bold;\n else\n aInfo.m_eWeight = psp::weight::UltraBold;\n\n \/\/ set width\n int nStretch = rQFont.stretch();\n if ( nStretch <= QFont::UltraCondensed )\n aInfo.m_eWidth = psp::width::UltraCondensed;\n else if ( nStretch <= QFont::ExtraCondensed )\n aInfo.m_eWidth = psp::width::ExtraCondensed;\n else if ( nStretch <= QFont::Condensed )\n aInfo.m_eWidth = psp::width::Condensed;\n else if ( nStretch <= QFont::SemiCondensed )\n aInfo.m_eWidth = psp::width::SemiCondensed;\n else if ( nStretch <= QFont::Unstretched )\n aInfo.m_eWidth = psp::width::Normal;\n else if ( nStretch <= QFont::SemiExpanded )\n aInfo.m_eWidth = psp::width::SemiExpanded;\n else if ( nStretch <= QFont::Expanded )\n aInfo.m_eWidth = psp::width::Expanded;\n else if ( nStretch <= QFont::ExtraExpanded )\n aInfo.m_eWidth = psp::width::ExtraExpanded;\n else\n aInfo.m_eWidth = psp::width::UltraExpanded;\n\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"font name BEFORE system match: \\\"%s\\\"\\n\", OUStringToOString( aInfo.m_aFamilyName, RTL_TEXTENCODING_ISO_8859_1 ).getStr() );\n#endif\n\n \/\/ match font to e.g. resolve \"Sans\"\n psp::PrintFontManager::get().matchFont( aInfo, rLocale );\n\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"font match %s, name AFTER: \\\"%s\\\"\\n\",\n aInfo.m_nID != 0 ? \"succeeded\" : \"failed\",\n OUStringToOString( aInfo.m_aFamilyName, RTL_TEXTENCODING_ISO_8859_1 ).getStr() );\n#endif\n\n \/\/ font height\n int nPointHeight = qFontInfo.pointSize();\n if ( nPointHeight <= 0 )\n nPointHeight = rQFont.pointSize();\n\n \/\/ Create the font\n Font aFont( aInfo.m_aFamilyName, Size( 0, nPointHeight ) );\n if( aInfo.m_eWeight != psp::weight::Unknown )\n aFont.SetWeight( PspGraphics::ToFontWeight( aInfo.m_eWeight ) );\n if( aInfo.m_eWidth != psp::width::Unknown )\n aFont.SetWidthType( PspGraphics::ToFontWidth( aInfo.m_eWidth ) );\n if( aInfo.m_eItalic != psp::italic::Unknown )\n aFont.SetItalic( PspGraphics::ToFontItalic( aInfo.m_eItalic ) );\n if( aInfo.m_ePitch != psp::pitch::Unknown )\n aFont.SetPitch( PspGraphics::ToFontPitch( aInfo.m_ePitch ) );\n\n return aFont;\n}\n\n\/** Implementation of KDE integration's main method.\n*\/\nvoid KDESalFrame::UpdateSettings( AllSettings& rSettings )\n{\n StyleSettings style( rSettings.GetStyleSettings() );\n bool bSetTitleFont = false;\n\n \/\/ General settings\n QPalette pal = kapp->palette();\n\n style.SetToolbarIconSize( STYLE_TOOLBAR_ICONSIZE_LARGE );\n\n style.SetActiveColor(toColor(pal.color(QPalette::Active, QPalette::Window)));\n style.SetDeactiveColor(toColor(pal.color(QPalette::Inactive, QPalette::Window)));\n\n style.SetActiveColor2(toColor(pal.color(QPalette::Active, QPalette::Window)));\n style.SetDeactiveColor2(toColor(pal.color(QPalette::Inactive, QPalette::Window)));\n\n style.SetActiveTextColor(toColor(pal.color(QPalette::Active, QPalette::WindowText)));\n style.SetDeactiveTextColor(toColor(pal.color(QPalette::Inactive, QPalette::WindowText)));\n\n \/\/ WM settings\n KConfig *pConfig = KGlobal::config().data();\n if ( pConfig )\n {\n KConfigGroup aGroup = pConfig->group( \"WM\" );\n const char *pKey;\n\n pKey = \"titleFont\";\n if ( aGroup.hasKey( pKey ) )\n {\n Font aFont = toFont( aGroup.readEntry( pKey, QFont() ), rSettings.GetUILocale() );\n style.SetTitleFont( aFont );\n bSetTitleFont = true;\n }\n\n aGroup = pConfig->group( \"Icons\" );\n\n pKey = \"Theme\";\n if ( aGroup.hasKey( pKey ) )\n style.SetPreferredSymbolsStyleName( readEntryUntranslated( &aGroup, pKey ) );\n\n \/\/toolbar\n pKey = \"toolbarFont\";\n if ( aGroup.hasKey( pKey ) )\n {\n Font aFont = toFont( aGroup.readEntry( pKey, QFont() ), rSettings.GetUILocale() );\n style.SetToolFont( aFont );\n }\n }\n\n Color aFore = toColor( pal.color( QPalette::Active, QPalette::WindowText ) );\n Color aBack = toColor( pal.color( QPalette::Active, QPalette::Window ) );\n Color aText = toColor( pal.color( QPalette::Active, QPalette::Text ) );\n Color aBase = toColor( pal.color( QPalette::Active, QPalette::Base ) );\n Color aButn = toColor( pal.color( QPalette::Active, QPalette::ButtonText ) );\n Color aMid = toColor( pal.color( QPalette::Active, QPalette::Mid ) );\n Color aHigh = toColor( pal.color( QPalette::Active, QPalette::Highlight ) );\n\n \/\/ Foreground\n style.SetRadioCheckTextColor( aFore );\n style.SetLabelTextColor( aFore );\n style.SetInfoTextColor( aFore );\n style.SetDialogTextColor( aFore );\n style.SetGroupTextColor( aFore );\n\n \/\/ Text\n style.SetFieldTextColor( aText );\n style.SetFieldRolloverTextColor( aText );\n style.SetWindowTextColor( aText );\n style.SetHelpTextColor( aText );\n\n \/\/ Base\n style.SetFieldColor( aBase );\n style.SetHelpColor( aBase );\n style.SetWindowColor( aBase );\n style.SetActiveTabColor( aBase );\n\n \/\/ Buttons\n style.SetButtonTextColor( aButn );\n style.SetButtonRolloverTextColor( aButn );\n\n \/\/ Disable color\n style.SetDisableColor( aMid );\n\n \/\/ Workspace\n style.SetWorkspaceColor( aMid );\n\n \/\/ Background\n style.Set3DColors( aBack );\n style.SetFaceColor( aBack );\n style.SetInactiveTabColor( aBack );\n style.SetDialogColor( aBack );\n\n if( aBack == COL_LIGHTGRAY )\n style.SetCheckedColor( Color( 0xCC, 0xCC, 0xCC ) );\n else\n {\n Color aColor2 = style.GetLightColor();\n style.\n SetCheckedColor( Color( (sal_uInt8)(((sal_uInt16)aBack.GetRed()+(sal_uInt16)aColor2.GetRed())\/2),\n (sal_uInt8)(((sal_uInt16)aBack.GetGreen()+(sal_uInt16)aColor2.GetGreen())\/2),\n (sal_uInt8)(((sal_uInt16)aBack.GetBlue()+(sal_uInt16)aColor2.GetBlue())\/2)\n ) );\n }\n\n \/\/ Selection\n style.SetHighlightColor( aHigh );\n style.SetHighlightTextColor( toColor(pal.color( QPalette::HighlightedText)) );\n\n \/\/ Font\n Font aFont = toFont( kapp->font(), rSettings.GetUILocale() );\n\n style.SetAppFont( aFont );\n style.SetHelpFont( aFont );\n\n style.SetMenuFont( aFont ); \/\/ will be changed according to pMenuBar\n \/\/style.SetToolFont( aFont ); \/\/already set above\n style.SetLabelFont( aFont );\n style.SetInfoFont( aFont );\n style.SetRadioCheckFont( aFont );\n style.SetPushButtonFont( aFont );\n style.SetFieldFont( aFont );\n style.SetIconFont( aFont );\n style.SetGroupFont( aFont );\n\n aFont.SetWeight( WEIGHT_BOLD );\n if( !bSetTitleFont )\n {\n style.SetTitleFont( aFont );\n }\n style.SetFloatTitleFont( aFont );\n\n int flash_time = QApplication::cursorFlashTime();\n style.SetCursorBlinkTime( flash_time != 0 ? flash_time\/2 : STYLE_CURSOR_NOBLINKTIME );\n\n \/\/ Menu\n style.SetSkipDisabledInMenus( TRUE );\n KMenuBar* pMenuBar = new KMenuBar();\n if ( pMenuBar )\n {\n \/\/ Color\n QPalette qMenuCG = pMenuBar->palette();\n\n \/\/ Menu text and background color, theme specific\n Color aMenuFore = toColor( qMenuCG.color( QPalette::WindowText ) );\n Color aMenuBack = toColor( qMenuCG.color( QPalette::Window ) );\n\n aMenuFore = toColor( qMenuCG.color( QPalette::ButtonText ) );\n aMenuBack = toColor( qMenuCG.color( QPalette::Button ) );\n\n style.SetMenuTextColor( aMenuFore );\n style.SetMenuBarTextColor( aMenuFore );\n style.SetMenuColor( aMenuBack );\n style.SetMenuBarColor( aMenuBack );\n\n style.SetMenuHighlightColor( toColor ( qMenuCG.color( QPalette::Highlight ) ) );\n\n style.SetMenuHighlightTextColor( aMenuFore );\n\n \/\/ set special menubar higlight text color\n if ( kapp->style()->inherits( \"HighContrastStyle\" ) )\n ImplGetSVData()->maNWFData.maMenuBarHighlightTextColor = toColor( qMenuCG.color( QPalette::HighlightedText ) );\n else\n ImplGetSVData()->maNWFData.maMenuBarHighlightTextColor = aMenuFore;\n\n \/\/ Font\n aFont = toFont( pMenuBar->font(), rSettings.GetUILocale() );\n style.SetMenuFont( aFont );\n }\n\n delete pMenuBar;\n\n \/\/ Scroll bar size\n style.SetScrollBarSize( kapp->style()->pixelMetric( QStyle::PM_ScrollBarExtent ) );\n\n rSettings.SetStyleSettings( style );\n}\n\n\nvoid KDESalFrame::ReleaseGraphics( SalGraphics *pGraphics )\n{\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( m_aGraphics[i].pGraphics == pGraphics )\n {\n m_aGraphics[i].bInUse = false;\n break;\n }\n }\n}\n\nvoid KDESalFrame::updateGraphics( bool bClear )\n{\n Drawable aDrawable = bClear ? None : GetWindow();\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( m_aGraphics[i].bInUse )\n m_aGraphics[i].pGraphics->SetDrawable( aDrawable, GetScreenNumber() );\n }\n}\n\nKDESalFrame::~KDESalFrame()\n{\n}\n\nKDESalFrame::GraphicsHolder::~GraphicsHolder()\n{\n delete pGraphics;\n}\n\nSalGraphics* KDESalFrame::GetGraphics()\n{\n if( GetWindow() )\n {\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( ! m_aGraphics[i].bInUse )\n {\n m_aGraphics[i].bInUse = true;\n if( ! m_aGraphics[i].pGraphics )\n {\n m_aGraphics[i].pGraphics = new KDESalGraphics();\n m_aGraphics[i].pGraphics->Init( this, GetWindow(), GetScreenNumber() );\n }\n return m_aGraphics[i].pGraphics;\n }\n }\n }\n\n return NULL;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>define minimal scrollbar slider size for KDE4<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2000, 2010 Oracle and\/or its affiliates.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#define Region QtXRegion\n\n#include <QColor>\n#include <QStyle>\n\n#include <kconfig.h>\n#include <kglobal.h>\n#include <kmenubar.h>\n#include <kconfiggroup.h>\n#include <kmainwindow.h>\n#include <kapplication.h>\n#include <ktoolbar.h>\n\n#undef Region\n\n#include \"KDESalFrame.hxx\"\n#include \"KDEXLib.hxx\"\n#include \"KDESalGraphics.hxx\"\n\n#include <vcl\/settings.hxx>\n#include <vcl\/font.hxx>\n#include <tools\/color.hxx>\n\n#include <vcl\/svdata.hxx>\n\n#include <pspgraphics.h>\n\n#if OSL_DEBUG_LEVEL > 1\n#include <stdio.h>\n#endif\n\nKDESalFrame::KDESalFrame( SalFrame* pParent, sal_uLong nState ) :\n X11SalFrame( pParent, nState )\n{\n}\n\nvoid KDESalFrame::Show( sal_Bool bVisible, sal_Bool bNoActivate )\n{\n if ( !GetParent() && ! (GetStyle() & SAL_FRAME_STYLE_INTRO) )\n {\n KDEXLib* pXLib = static_cast<KDEXLib*>(GetDisplay()->GetXLib());\n pXLib->doStartup();\n }\n\n X11SalFrame::Show( bVisible, bNoActivate );\n}\n\n\/** Helper function to convert colors.\n*\/\nstatic Color toColor( const QColor &rColor )\n{\n return Color( rColor.red(), rColor.green(), rColor.blue() );\n}\n\n\/** Helper function to read untranslated text entry from KConfig configuration repository.\n*\/\nstatic OUString readEntryUntranslated( KConfigGroup *pGroup, const char *pKey )\n{\n return OUString::createFromAscii( (const char *) pGroup->readEntryUntranslated( pKey ).toAscii() );\n}\n\n#if 0\n#endif\n\/** Helper function to add information to Font from QFont.\n\n Mostly grabbed from the Gtk+ vclplug (salnativewidgets-gtk.cxx).\n*\/\nstatic Font toFont( const QFont &rQFont, const ::com::sun::star::lang::Locale& rLocale )\n{\n psp::FastPrintFontInfo aInfo;\n QFontInfo qFontInfo( rQFont );\n\n \/\/ set family name\n aInfo.m_aFamilyName = String( (const char *) rQFont.family().toUtf8(), RTL_TEXTENCODING_UTF8 );\n\n \/\/ set italic\n aInfo.m_eItalic = ( qFontInfo.italic()? psp::italic::Italic: psp::italic::Upright );\n\n \/\/ set weight\n int nWeight = qFontInfo.weight();\n if ( nWeight <= QFont::Light )\n aInfo.m_eWeight = psp::weight::Light;\n else if ( nWeight <= QFont::Normal )\n aInfo.m_eWeight = psp::weight::Normal;\n else if ( nWeight <= QFont::DemiBold )\n aInfo.m_eWeight = psp::weight::SemiBold;\n else if ( nWeight <= QFont::Bold )\n aInfo.m_eWeight = psp::weight::Bold;\n else\n aInfo.m_eWeight = psp::weight::UltraBold;\n\n \/\/ set width\n int nStretch = rQFont.stretch();\n if ( nStretch <= QFont::UltraCondensed )\n aInfo.m_eWidth = psp::width::UltraCondensed;\n else if ( nStretch <= QFont::ExtraCondensed )\n aInfo.m_eWidth = psp::width::ExtraCondensed;\n else if ( nStretch <= QFont::Condensed )\n aInfo.m_eWidth = psp::width::Condensed;\n else if ( nStretch <= QFont::SemiCondensed )\n aInfo.m_eWidth = psp::width::SemiCondensed;\n else if ( nStretch <= QFont::Unstretched )\n aInfo.m_eWidth = psp::width::Normal;\n else if ( nStretch <= QFont::SemiExpanded )\n aInfo.m_eWidth = psp::width::SemiExpanded;\n else if ( nStretch <= QFont::Expanded )\n aInfo.m_eWidth = psp::width::Expanded;\n else if ( nStretch <= QFont::ExtraExpanded )\n aInfo.m_eWidth = psp::width::ExtraExpanded;\n else\n aInfo.m_eWidth = psp::width::UltraExpanded;\n\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"font name BEFORE system match: \\\"%s\\\"\\n\", OUStringToOString( aInfo.m_aFamilyName, RTL_TEXTENCODING_ISO_8859_1 ).getStr() );\n#endif\n\n \/\/ match font to e.g. resolve \"Sans\"\n psp::PrintFontManager::get().matchFont( aInfo, rLocale );\n\n#if OSL_DEBUG_LEVEL > 1\n fprintf( stderr, \"font match %s, name AFTER: \\\"%s\\\"\\n\",\n aInfo.m_nID != 0 ? \"succeeded\" : \"failed\",\n OUStringToOString( aInfo.m_aFamilyName, RTL_TEXTENCODING_ISO_8859_1 ).getStr() );\n#endif\n\n \/\/ font height\n int nPointHeight = qFontInfo.pointSize();\n if ( nPointHeight <= 0 )\n nPointHeight = rQFont.pointSize();\n\n \/\/ Create the font\n Font aFont( aInfo.m_aFamilyName, Size( 0, nPointHeight ) );\n if( aInfo.m_eWeight != psp::weight::Unknown )\n aFont.SetWeight( PspGraphics::ToFontWeight( aInfo.m_eWeight ) );\n if( aInfo.m_eWidth != psp::width::Unknown )\n aFont.SetWidthType( PspGraphics::ToFontWidth( aInfo.m_eWidth ) );\n if( aInfo.m_eItalic != psp::italic::Unknown )\n aFont.SetItalic( PspGraphics::ToFontItalic( aInfo.m_eItalic ) );\n if( aInfo.m_ePitch != psp::pitch::Unknown )\n aFont.SetPitch( PspGraphics::ToFontPitch( aInfo.m_ePitch ) );\n\n return aFont;\n}\n\n\/** Implementation of KDE integration's main method.\n*\/\nvoid KDESalFrame::UpdateSettings( AllSettings& rSettings )\n{\n StyleSettings style( rSettings.GetStyleSettings() );\n bool bSetTitleFont = false;\n\n \/\/ General settings\n QPalette pal = kapp->palette();\n\n style.SetToolbarIconSize( STYLE_TOOLBAR_ICONSIZE_LARGE );\n\n style.SetActiveColor(toColor(pal.color(QPalette::Active, QPalette::Window)));\n style.SetDeactiveColor(toColor(pal.color(QPalette::Inactive, QPalette::Window)));\n\n style.SetActiveColor2(toColor(pal.color(QPalette::Active, QPalette::Window)));\n style.SetDeactiveColor2(toColor(pal.color(QPalette::Inactive, QPalette::Window)));\n\n style.SetActiveTextColor(toColor(pal.color(QPalette::Active, QPalette::WindowText)));\n style.SetDeactiveTextColor(toColor(pal.color(QPalette::Inactive, QPalette::WindowText)));\n\n \/\/ WM settings\n KConfig *pConfig = KGlobal::config().data();\n if ( pConfig )\n {\n KConfigGroup aGroup = pConfig->group( \"WM\" );\n const char *pKey;\n\n pKey = \"titleFont\";\n if ( aGroup.hasKey( pKey ) )\n {\n Font aFont = toFont( aGroup.readEntry( pKey, QFont() ), rSettings.GetUILocale() );\n style.SetTitleFont( aFont );\n bSetTitleFont = true;\n }\n\n aGroup = pConfig->group( \"Icons\" );\n\n pKey = \"Theme\";\n if ( aGroup.hasKey( pKey ) )\n style.SetPreferredSymbolsStyleName( readEntryUntranslated( &aGroup, pKey ) );\n\n \/\/toolbar\n pKey = \"toolbarFont\";\n if ( aGroup.hasKey( pKey ) )\n {\n Font aFont = toFont( aGroup.readEntry( pKey, QFont() ), rSettings.GetUILocale() );\n style.SetToolFont( aFont );\n }\n }\n\n Color aFore = toColor( pal.color( QPalette::Active, QPalette::WindowText ) );\n Color aBack = toColor( pal.color( QPalette::Active, QPalette::Window ) );\n Color aText = toColor( pal.color( QPalette::Active, QPalette::Text ) );\n Color aBase = toColor( pal.color( QPalette::Active, QPalette::Base ) );\n Color aButn = toColor( pal.color( QPalette::Active, QPalette::ButtonText ) );\n Color aMid = toColor( pal.color( QPalette::Active, QPalette::Mid ) );\n Color aHigh = toColor( pal.color( QPalette::Active, QPalette::Highlight ) );\n\n \/\/ Foreground\n style.SetRadioCheckTextColor( aFore );\n style.SetLabelTextColor( aFore );\n style.SetInfoTextColor( aFore );\n style.SetDialogTextColor( aFore );\n style.SetGroupTextColor( aFore );\n\n \/\/ Text\n style.SetFieldTextColor( aText );\n style.SetFieldRolloverTextColor( aText );\n style.SetWindowTextColor( aText );\n style.SetHelpTextColor( aText );\n\n \/\/ Base\n style.SetFieldColor( aBase );\n style.SetHelpColor( aBase );\n style.SetWindowColor( aBase );\n style.SetActiveTabColor( aBase );\n\n \/\/ Buttons\n style.SetButtonTextColor( aButn );\n style.SetButtonRolloverTextColor( aButn );\n\n \/\/ Disable color\n style.SetDisableColor( aMid );\n\n \/\/ Workspace\n style.SetWorkspaceColor( aMid );\n\n \/\/ Background\n style.Set3DColors( aBack );\n style.SetFaceColor( aBack );\n style.SetInactiveTabColor( aBack );\n style.SetDialogColor( aBack );\n\n if( aBack == COL_LIGHTGRAY )\n style.SetCheckedColor( Color( 0xCC, 0xCC, 0xCC ) );\n else\n {\n Color aColor2 = style.GetLightColor();\n style.\n SetCheckedColor( Color( (sal_uInt8)(((sal_uInt16)aBack.GetRed()+(sal_uInt16)aColor2.GetRed())\/2),\n (sal_uInt8)(((sal_uInt16)aBack.GetGreen()+(sal_uInt16)aColor2.GetGreen())\/2),\n (sal_uInt8)(((sal_uInt16)aBack.GetBlue()+(sal_uInt16)aColor2.GetBlue())\/2)\n ) );\n }\n\n \/\/ Selection\n style.SetHighlightColor( aHigh );\n style.SetHighlightTextColor( toColor(pal.color( QPalette::HighlightedText)) );\n\n \/\/ Font\n Font aFont = toFont( kapp->font(), rSettings.GetUILocale() );\n\n style.SetAppFont( aFont );\n style.SetHelpFont( aFont );\n\n style.SetMenuFont( aFont ); \/\/ will be changed according to pMenuBar\n \/\/style.SetToolFont( aFont ); \/\/already set above\n style.SetLabelFont( aFont );\n style.SetInfoFont( aFont );\n style.SetRadioCheckFont( aFont );\n style.SetPushButtonFont( aFont );\n style.SetFieldFont( aFont );\n style.SetIconFont( aFont );\n style.SetGroupFont( aFont );\n\n aFont.SetWeight( WEIGHT_BOLD );\n if( !bSetTitleFont )\n {\n style.SetTitleFont( aFont );\n }\n style.SetFloatTitleFont( aFont );\n\n int flash_time = QApplication::cursorFlashTime();\n style.SetCursorBlinkTime( flash_time != 0 ? flash_time\/2 : STYLE_CURSOR_NOBLINKTIME );\n\n \/\/ Menu\n style.SetSkipDisabledInMenus( TRUE );\n KMenuBar* pMenuBar = new KMenuBar();\n if ( pMenuBar )\n {\n \/\/ Color\n QPalette qMenuCG = pMenuBar->palette();\n\n \/\/ Menu text and background color, theme specific\n Color aMenuFore = toColor( qMenuCG.color( QPalette::WindowText ) );\n Color aMenuBack = toColor( qMenuCG.color( QPalette::Window ) );\n\n aMenuFore = toColor( qMenuCG.color( QPalette::ButtonText ) );\n aMenuBack = toColor( qMenuCG.color( QPalette::Button ) );\n\n style.SetMenuTextColor( aMenuFore );\n style.SetMenuBarTextColor( aMenuFore );\n style.SetMenuColor( aMenuBack );\n style.SetMenuBarColor( aMenuBack );\n\n style.SetMenuHighlightColor( toColor ( qMenuCG.color( QPalette::Highlight ) ) );\n\n style.SetMenuHighlightTextColor( aMenuFore );\n\n \/\/ set special menubar higlight text color\n if ( kapp->style()->inherits( \"HighContrastStyle\" ) )\n ImplGetSVData()->maNWFData.maMenuBarHighlightTextColor = toColor( qMenuCG.color( QPalette::HighlightedText ) );\n else\n ImplGetSVData()->maNWFData.maMenuBarHighlightTextColor = aMenuFore;\n\n \/\/ Font\n aFont = toFont( pMenuBar->font(), rSettings.GetUILocale() );\n style.SetMenuFont( aFont );\n }\n\n delete pMenuBar;\n\n \/\/ Scroll bar size\n style.SetScrollBarSize( kapp->style()->pixelMetric( QStyle::PM_ScrollBarExtent ) );\n style.SetMinThumbSize( kapp->style()->pixelMetric( QStyle::PM_ScrollBarSliderMin ));\n\n rSettings.SetStyleSettings( style );\n}\n\n\nvoid KDESalFrame::ReleaseGraphics( SalGraphics *pGraphics )\n{\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( m_aGraphics[i].pGraphics == pGraphics )\n {\n m_aGraphics[i].bInUse = false;\n break;\n }\n }\n}\n\nvoid KDESalFrame::updateGraphics( bool bClear )\n{\n Drawable aDrawable = bClear ? None : GetWindow();\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( m_aGraphics[i].bInUse )\n m_aGraphics[i].pGraphics->SetDrawable( aDrawable, GetScreenNumber() );\n }\n}\n\nKDESalFrame::~KDESalFrame()\n{\n}\n\nKDESalFrame::GraphicsHolder::~GraphicsHolder()\n{\n delete pGraphics;\n}\n\nSalGraphics* KDESalFrame::GetGraphics()\n{\n if( GetWindow() )\n {\n for( int i = 0; i < nMaxGraphics; i++ )\n {\n if( ! m_aGraphics[i].bInUse )\n {\n m_aGraphics[i].bInUse = true;\n if( ! m_aGraphics[i].pGraphics )\n {\n m_aGraphics[i].pGraphics = new KDESalGraphics();\n m_aGraphics[i].pGraphics->Init( this, GetWindow(), GetScreenNumber() );\n }\n return m_aGraphics[i].pGraphics;\n }\n }\n }\n\n return NULL;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ $Id$\n\/\/\n\/\/ Jet embedding task.\n\/\/\n\/\/ Author: S.Aiola, C.Loizides\n\n#include \"AliJetEmbeddingFromGenTask.h\"\n\n#include <TClonesArray.h>\n#include <TFolder.h>\n#include <TLorentzVector.h>\n#include <TParticle.h>\n#include <TParticlePDG.h>\n#include <TRandom3.h>\n#include <TProfile.h>\n#include \"AliAnalysisManager.h\"\n#include \"AliEMCALDigit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEMCALRecPoint.h\"\n#include \"AliGenerator.h\"\n#include \"AliHeader.h\"\n#include \"AliLog.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n#include \"AliStack.h\"\n#include \"AliStack.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEvent.h\"\n#include \"AliGenPythiaEventHeader.h\"\n#include \"AliStackPartonInfo.h\"\n\nClassImp(AliJetEmbeddingFromGenTask)\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::AliJetEmbeddingFromGenTask() : \n AliJetModelBaseTask(\"AliJetEmbeddingFromGenTask\"),\n fGen(0),\n fMassless(kFALSE),\n fChargedOnly(kFALSE),\n fHistPt(0),\n fHistEtaPhi(0),\n fHistTrials(0),\n fHistXsection(0),\n fHistPtHard(0)\n{\n \/\/ Default constructor.\n SetSuffix(\"EmbeddedFromGen\");\n}\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::AliJetEmbeddingFromGenTask(const char *name, Bool_t drawqa) :\n AliJetModelBaseTask(name,drawqa),\n fGen(0),\n fMassless(kFALSE),\n fChargedOnly(kFALSE),\n fHistPt(0),\n fHistEtaPhi(0),\n fHistTrials(0),\n fHistXsection(0),\n fHistPtHard(0)\n{\n \/\/ Standard constructor.\n SetSuffix(\"EmbeddedFromGen\");\n}\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::~AliJetEmbeddingFromGenTask()\n{\n \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::UserCreateOutputObjects()\n{\n \/\/ Create user output.\n\n if (!fQAhistos)\n return;\n\n AliJetModelBaseTask::UserCreateOutputObjects();\n\n fHistPt = new TH1F(\"fHistpt\",\"fHistPt;#it{p}_{T};N\",100,0.,100.);\n fOutput->Add(fHistPt);\n\n fHistEtaPhi = new TH2F(\"fHistEtapHI\",\"fHistEtaPhi;#eta;#varphi\",100,-3.,3.,100.,0.,TMath::TwoPi());\n fOutput->Add(fHistEtaPhi);\n\n fHistTrials = new TH1F(\"fHistTrials\", \"fHistTrials\", 1, 0, 1);\n fHistTrials->GetYaxis()->SetTitle(\"trials\");\n fOutput->Add(fHistTrials);\n\n fHistXsection = new TProfile(\"fHistXsection\", \"fHistXsection\", 1, 0, 1);\n fHistXsection->GetYaxis()->SetTitle(\"xsection\");\n fOutput->Add(fHistXsection);\n\n fHistPtHard = new TH1F(\"fHistPtHard\", \"fHistPtHard\", 500, 0., 500.);\n fHistPtHard->GetXaxis()->SetTitle(\"p_{T,hard} (GeV\/c)\");\n fHistPtHard->GetYaxis()->SetTitle(\"counts\");\n fOutput->Add(fHistPtHard);\n\n PostData(1, fOutput);\n}\n\n\/\/________________________________________________________________________\nBool_t AliJetEmbeddingFromGenTask::ExecOnce() \n{\n \/\/ Exec only once.\n\n if (!gAlice) {\n new AliRun(\"gAlice\",\"The ALICE Off-line Simulation Framework\");\n delete gRandom;\n gRandom = new TRandom3(0);\n }\n\n TFolder *folder = new TFolder(GetName(),GetName());\n AliRunLoader *rl = new AliRunLoader(folder);\n rl->MakeHeader();\n rl->MakeStack();\n AliStack *stack = rl->Stack();\n fGen->SetStack(stack);\n fGen->Init();\n\n if (!(InputEvent()->FindListObject(fTracksName))) {\n fOutTracks = new TClonesArray(\"AliPicoTrack\", 1000);\n fOutTracks->SetName(fTracksName);\n InputEvent()->AddObject(fOutTracks);\n fNTracks = 0;\n }\n\n if (!(InputEvent()->FindListObject(fPartonInfoName))) {\n fStackPartonInfo = new AliStackPartonInfo(\"PartonsInfo\");\n fStackPartonInfo->SetName(fPartonInfoName);\n InputEvent()->AddObject(fStackPartonInfo);\n }\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::Run() \n{\n \/\/ Embed particles.\n\n if (fCopyArray) \n CopyTracks();\n\n AliStack *stack = fGen->GetStack();\n stack->Reset();\n fGen->Generate();\n const Int_t nprim = stack->GetNprimary();\n \/\/ reject if partons are missing from stack for some reason\n if(nprim < 8) return;\n TParticle *part6 = stack->Particle(6);\n TParticle *part7 = stack->Particle(7);\n\n fStackPartonInfo->SetPartonFlag6(TMath::Abs(part6->GetPdgCode()));\n fStackPartonInfo->SetPartonPt6(part6->Pt());\n fStackPartonInfo->SetPartonEta6(part6->Eta());\n fStackPartonInfo->SetPartonPhi6(part6->Phi());\n \n fStackPartonInfo->SetPartonFlag7(TMath::Abs(part7->GetPdgCode()));\n fStackPartonInfo->SetPartonPt7(part7->Pt());\n fStackPartonInfo->SetPartonEta7(part7->Eta());\n fStackPartonInfo->SetPartonPhi7(part7->Phi());\n \n for (Int_t i=0;i<nprim;++i) {\n if (!stack->IsPhysicalPrimary(i))\n continue;\n TParticle *part = stack->Particle(i);\n TParticlePDG *pdg = part->GetPDG(1);\n if (!pdg) \n continue;\n Int_t c = (Int_t)(TMath::Abs(pdg->Charge()));\n if (fChargedOnly && c==0) continue;\n Double_t pt = part->Pt();\n Double_t eta = part->Eta();\n Double_t phi = part->Phi();\n if (eta<fEtaMin)\n continue;\n if (eta>fEtaMax)\n continue;\n if (phi<fPhiMin)\n continue;\n if (phi>fPhiMax)\n continue;\n if (pt<fPtMin)\n continue;\n if (pt>fPtMax)\n continue;\n Double_t mass = part->GetMass();\n if(fMassless) mass = 0.;\n fHistPt->Fill(pt);\n fHistEtaPhi->Fill(eta,phi);\n AddTrack(pt, eta, phi,0,0,0,0,0,0,c,mass);\n }\n\n FillPythiaHistograms();\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::FillPythiaHistograms() {\n \/\/Get PYTHIA info: pt-hard, x-section, trials\n\n if (!fQAhistos)\n return;\n\n AliRunLoader *rl = AliRunLoader::Instance();\n AliGenPythiaEventHeader *genPH = dynamic_cast<AliGenPythiaEventHeader*>(rl->GetHeader()->GenEventHeader());\n if(genPH) {\n Float_t xsec = genPH->GetXsection();\n Int_t trials = genPH->Trials();\n Float_t pthard = genPH->GetPtHard();\n\n fHistXsection->Fill(0.5,xsec);\n fHistTrials->Fill(0.5,trials);\n fHistPtHard->Fill(pthard);\n }\n}\n<commit_msg>correct Run Loader<commit_after>\/\/ $Id$\n\/\/\n\/\/ Jet embedding task.\n\/\/\n\/\/ Author: S.Aiola, C.Loizides\n\n#include \"AliJetEmbeddingFromGenTask.h\"\n\n#include <TClonesArray.h>\n#include <TFolder.h>\n#include <TLorentzVector.h>\n#include <TParticle.h>\n#include <TParticlePDG.h>\n#include <TRandom3.h>\n#include <TProfile.h>\n#include \"AliAnalysisManager.h\"\n#include \"AliEMCALDigit.h\"\n#include \"AliEMCALGeometry.h\"\n#include \"AliEMCALRecPoint.h\"\n#include \"AliGenerator.h\"\n#include \"AliHeader.h\"\n#include \"AliLog.h\"\n#include \"AliPicoTrack.h\"\n#include \"AliRun.h\"\n#include \"AliRunLoader.h\"\n#include \"AliStack.h\"\n#include \"AliStack.h\"\n#include \"AliVCluster.h\"\n#include \"AliVEvent.h\"\n#include \"AliGenPythiaEventHeader.h\"\n#include \"AliStackPartonInfo.h\"\n\nClassImp(AliJetEmbeddingFromGenTask)\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::AliJetEmbeddingFromGenTask() : \n AliJetModelBaseTask(\"AliJetEmbeddingFromGenTask\"),\n fGen(0),\n fMassless(kFALSE),\n fChargedOnly(kFALSE),\n fHistPt(0),\n fHistEtaPhi(0),\n fHistTrials(0),\n fHistXsection(0),\n fHistPtHard(0)\n{\n \/\/ Default constructor.\n SetSuffix(\"EmbeddedFromGen\");\n}\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::AliJetEmbeddingFromGenTask(const char *name, Bool_t drawqa) :\n AliJetModelBaseTask(name,drawqa),\n fGen(0),\n fMassless(kFALSE),\n fChargedOnly(kFALSE),\n fHistPt(0),\n fHistEtaPhi(0),\n fHistTrials(0),\n fHistXsection(0),\n fHistPtHard(0)\n{\n \/\/ Standard constructor.\n SetSuffix(\"EmbeddedFromGen\");\n}\n\n\/\/________________________________________________________________________\nAliJetEmbeddingFromGenTask::~AliJetEmbeddingFromGenTask()\n{\n \/\/ Destructor\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::UserCreateOutputObjects()\n{\n \/\/ Create user output.\n\n if (!fQAhistos)\n return;\n\n AliJetModelBaseTask::UserCreateOutputObjects();\n\n fHistPt = new TH1F(\"fHistpt\",\"fHistPt;#it{p}_{T};N\",100,0.,100.);\n fOutput->Add(fHistPt);\n\n fHistEtaPhi = new TH2F(\"fHistEtapHI\",\"fHistEtaPhi;#eta;#varphi\",100,-3.,3.,100.,0.,TMath::TwoPi());\n fOutput->Add(fHistEtaPhi);\n\n fHistTrials = new TH1F(\"fHistTrials\", \"fHistTrials\", 1, 0, 1);\n fHistTrials->GetYaxis()->SetTitle(\"trials\");\n fOutput->Add(fHistTrials);\n\n fHistXsection = new TProfile(\"fHistXsection\", \"fHistXsection\", 1, 0, 1);\n fHistXsection->GetYaxis()->SetTitle(\"xsection\");\n fOutput->Add(fHistXsection);\n\n fHistPtHard = new TH1F(\"fHistPtHard\", \"fHistPtHard\", 500, 0., 500.);\n fHistPtHard->GetXaxis()->SetTitle(\"p_{T,hard} (GeV\/c)\");\n fHistPtHard->GetYaxis()->SetTitle(\"counts\");\n fOutput->Add(fHistPtHard);\n\n PostData(1, fOutput);\n}\n\n\/\/________________________________________________________________________\nBool_t AliJetEmbeddingFromGenTask::ExecOnce() \n{\n \/\/ Exec only once.\n\n if (!gAlice) {\n new AliRun(\"gAlice\",\"The ALICE Off-line Simulation Framework\");\n delete gRandom;\n gRandom = new TRandom3(0);\n }\n\n TFolder *folder = new TFolder(GetName(),GetName());\n AliRunLoader *rl = new AliRunLoader(folder);\n gAlice->SetRunLoader(rl);\n rl->MakeHeader();\n rl->MakeStack();\n AliStack *stack = rl->Stack();\n fGen->SetStack(stack);\n fGen->Init();\n\n if (!(InputEvent()->FindListObject(fTracksName))) {\n fOutTracks = new TClonesArray(\"AliPicoTrack\", 1000);\n fOutTracks->SetName(fTracksName);\n InputEvent()->AddObject(fOutTracks);\n fNTracks = 0;\n }\n\n if (!(InputEvent()->FindListObject(fPartonInfoName))) {\n fStackPartonInfo = new AliStackPartonInfo(\"PartonsInfo\");\n fStackPartonInfo->SetName(fPartonInfoName);\n InputEvent()->AddObject(fStackPartonInfo);\n }\n return kTRUE;\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::Run() \n{\n \/\/ Embed particles.\n\n if (fCopyArray) \n CopyTracks();\n\n AliStack *stack = fGen->GetStack();\n stack->Reset();\n fGen->Generate();\n const Int_t nprim = stack->GetNprimary();\n \/\/ reject if partons are missing from stack for some reason\n if(nprim < 8) return;\n TParticle *part6 = stack->Particle(6);\n TParticle *part7 = stack->Particle(7);\n\n fStackPartonInfo->SetPartonFlag6(TMath::Abs(part6->GetPdgCode()));\n fStackPartonInfo->SetPartonPt6(part6->Pt());\n fStackPartonInfo->SetPartonEta6(part6->Eta());\n fStackPartonInfo->SetPartonPhi6(part6->Phi());\n \n fStackPartonInfo->SetPartonFlag7(TMath::Abs(part7->GetPdgCode()));\n fStackPartonInfo->SetPartonPt7(part7->Pt());\n fStackPartonInfo->SetPartonEta7(part7->Eta());\n fStackPartonInfo->SetPartonPhi7(part7->Phi());\n \n for (Int_t i=0;i<nprim;++i) {\n if (!stack->IsPhysicalPrimary(i))\n continue;\n TParticle *part = stack->Particle(i);\n TParticlePDG *pdg = part->GetPDG(1);\n if (!pdg) \n continue;\n Int_t c = (Int_t)(TMath::Abs(pdg->Charge()));\n if (fChargedOnly && c==0) continue;\n Double_t pt = part->Pt();\n Double_t eta = part->Eta();\n Double_t phi = part->Phi();\n if (eta<fEtaMin)\n continue;\n if (eta>fEtaMax)\n continue;\n if (phi<fPhiMin)\n continue;\n if (phi>fPhiMax)\n continue;\n if (pt<fPtMin)\n continue;\n if (pt>fPtMax)\n continue;\n Double_t mass = part->GetMass();\n if(fMassless) mass = 0.;\n fHistPt->Fill(pt);\n fHistEtaPhi->Fill(eta,phi);\n AddTrack(pt, eta, phi,0,0,0,0,0,0,c,mass);\n }\n\n FillPythiaHistograms();\n}\n\n\/\/________________________________________________________________________\nvoid AliJetEmbeddingFromGenTask::FillPythiaHistograms() {\n \/\/Get PYTHIA info: pt-hard, x-section, trials\n\n if (!fQAhistos)\n return;\n\n AliRunLoader *rl = AliRunLoader::Instance();\n AliGenPythiaEventHeader *genPH = dynamic_cast<AliGenPythiaEventHeader*>(rl->GetHeader()->GenEventHeader());\n if(genPH) {\n Float_t xsec = genPH->GetXsection();\n Int_t trials = genPH->Trials();\n Float_t pthard = genPH->GetPtHard();\n\n fHistXsection->Fill(0.5,xsec);\n fHistTrials->Fill(0.5,trials);\n fHistPtHard->Fill(pthard);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MeshUtility.h\"\n\nusing namespace Rendering;\nusing namespace Rendering::Geometry;\nusing namespace Intersection;\nusing namespace Rendering::Manager;\nusing namespace Core;\nusing namespace Math;\n\nconst Transform& MeshUtility::_FindTransform(const Mesh& mesh, const TransformPool& transformPool)\n{\n\tauto id = mesh.GetObjectID();\n\tuint findIdx = transformPool.GetIndexer().Find(id.Literal());\n\tassert(findIdx != TransformPool::IndexerType::FailIndex());\n\n\treturn transformPool.Get(findIdx);\t\t\t\t\n}\n\nvoid MeshUtility::_SortTransparentMesh(std::vector<const Mesh*>& refMeshes,\n\t\t\t\t\t\t \t\t\t\tconst Vector3& viewDir, const TransformPool& transformPool)\n{\n\tauto SortingByDistance = [&transformPool, &viewDir](const Mesh* left, const Mesh* right) -> bool\n\t{\n\t\tauto SortKey = [&viewDir, &transformPool](const Mesh* mesh) -> float\n\t\t{\n\t\t\tauto& pos = _FindTransform(*mesh, transformPool).GetWorldPosition();\t\t\t\t\n\t\t\treturn Vector3::Dot(pos, viewDir);\n\t\t};\n\t\n\t\treturn SortKey(left) < SortKey(right);\n\t};\n\t\n\tstd::sort(refMeshes.begin(), refMeshes.end(), SortingByDistance);\t\t\t\t\n}\n<commit_msg>MeshUtility.cpp - std::vector<const Mesh*> -> TransparentMeshPtrs<commit_after>#include \"MeshUtility.h\"\n\nusing namespace Rendering;\nusing namespace Rendering::Geometry;\nusing namespace Intersection;\nusing namespace Rendering::Manager;\nusing namespace Core;\nusing namespace Math;\n\nconst Transform& MeshUtility::_FindTransform(const Mesh& mesh, const TransformPool& transformPool)\n{\n\tauto id = mesh.GetObjectID();\n\tuint findIdx = transformPool.GetIndexer().Find(id.Literal());\n\tassert(findIdx != TransformPool::IndexerType::FailIndex());\n\n\treturn transformPool.Get(findIdx);\t\t\t\t\n}\n\nvoid MeshUtility::_SortTransparentMesh(TransparentMeshPtrs& refMeshes,\n\t\t\t\t\t\t \t\t\t\tconst Vector3& viewDir, const TransformPool& transformPool)\n{\n\tauto SortingByDistance = [&transformPool, &viewDir](const Mesh* left, const Mesh* right) -> bool\n\t{\n\t\tauto SortKey = [&viewDir, &transformPool](const Mesh* mesh) -> float\n\t\t{\n\t\t\tauto& pos = _FindTransform(*mesh, transformPool).GetWorldPosition();\t\t\t\t\n\t\t\treturn Vector3::Dot(pos, viewDir);\n\t\t};\n\t\n\t\treturn SortKey(left) < SortKey(right);\n\t};\n\t\n\tstd::sort(refMeshes.begin(), refMeshes.end(), SortingByDistance);\t\t\t\t\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"testing\/testing.hpp\"\n\n#include \"storage\/simple_tree.hpp\"\n\n\nnamespace\n{\n\ntemplate <class TNode>\nstruct Calculator\n{\n size_t count;\n Calculator() : count(0) {}\n void operator()(TNode const &)\n {\n ++count;\n }\n};\n\n}\n\nUNIT_TEST(SimpleTree_Smoke)\n{\n typedef SimpleTree<int> TreeT;\n TreeT tree;\n\n tree.Add(4);\n tree.Add(3);\n tree.Add(5);\n tree.Add(2);\n tree.Add(1);\n tree.AddAtDepth(1, 20); \/\/ 1 is parent\n tree.AddAtDepth(1, 10); \/\/ 1 is parent\n tree.AddAtDepth(1, 30); \/\/ 1 is parent\n\n tree.Sort();\n \/\/ test sorting\n TEST_EQUAL(tree.Child(0).Value(), 1, ());\n TEST_EQUAL(tree.Child(1).Value(), 2, ());\n TEST_EQUAL(tree.Child(2).Value(), 3, ());\n TEST_EQUAL(tree.Child(3).Value(), 4, ());\n TEST_EQUAL(tree.Child(4).Value(), 5, ());\n TEST_EQUAL(tree.Child(0).Child(0).Value(), 10, ());\n TEST_EQUAL(tree.Child(0).Child(1).Value(), 20, ());\n TEST_EQUAL(tree.Child(0).Child(2).Value(), 30, ());\n\n Calculator<TreeT> c1;\n tree.ForEachChild(c1);\n TEST_EQUAL(c1.count, 5, ());\n\n Calculator<TreeT> c2;\n tree.ForEachDescendant(c2);\n TEST_EQUAL(c2.count, 8, ());\n\n tree.Clear();\n Calculator<TreeT> c3;\n tree.ForEachDescendant(c3);\n TEST_EQUAL(c3.count, 0, (\"Tree should be empty\"));\n}\n<commit_msg>[new downloader] Unit tests on SimpleTree.<commit_after>#include \"testing\/testing.hpp\"\n\n#include \"storage\/simple_tree.hpp\"\n\n\nnamespace\n{\ntemplate <class TNode>\nstruct Calculator\n{\n size_t count;\n Calculator() : count(0) {}\n void operator()(TNode const &)\n {\n ++count;\n }\n};\n} \/\/ namespace\n\nUNIT_TEST(SimpleTree_Smoke)\n{\n typedef SimpleTree<int> TreeT;\n TreeT tree;\n\n tree.Add(4);\n tree.Add(3);\n tree.Add(5);\n tree.Add(2);\n tree.Add(1);\n tree.AddAtDepth(1, 20); \/\/ 1 is parent\n tree.AddAtDepth(1, 10); \/\/ 1 is parent\n tree.AddAtDepth(1, 30); \/\/ 1 is parent\n\n \/\/ children test\n TEST_EQUAL(tree.Child(0).Value(), 4, ());\n TEST_EQUAL(tree.Child(1).Value(), 3, ());\n TEST_EQUAL(tree.Child(2).Value(), 5, ());\n TEST_EQUAL(tree.Child(3).Value(), 2, ());\n TEST_EQUAL(tree.Child(4).Value(), 1, ());\n TEST_EQUAL(tree.Child(4).Child(0).Value(), 20, ());\n TEST_EQUAL(tree.Child(4).Child(1).Value(), 10, ());\n TEST_EQUAL(tree.Child(4).Child(2).Value(), 30, ());\n\n \/\/ parent test\n TEST(!tree.HasParent(), ());\n TEST(!tree.Child(0).Parent().HasParent(), ());\n TEST_EQUAL(tree.Child(4).Child(0).Parent().Value(), 1, ());\n TEST_EQUAL(tree.Child(4).Child(2).Parent().Value(), 1, ());\n\n Calculator<TreeT> c1;\n tree.ForEachChild(c1);\n TEST_EQUAL(c1.count, 5, ());\n\n Calculator<TreeT> c2;\n tree.ForEachDescendant(c2);\n TEST_EQUAL(c2.count, 8, ());\n\n Calculator<TreeT> c3;\n tree.Child(4).Child(0).ForEachParent(c3);\n TEST_EQUAL(c3.count, 2, ());\n\n tree.Clear();\n Calculator<TreeT> c4;\n tree.ForEachDescendant(c4);\n TEST_EQUAL(c4.count, 0, (\"Tree should be empty\"));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"distributorconfiguration.h\"\n#include <vespa\/document\/select\/parser.h>\n#include <vespa\/document\/select\/traversingvisitor.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".distributorconfiguration\");\n\nnamespace storage {\n\nDistributorConfiguration::DistributorConfiguration(StorageComponent& component)\n : _component(component),\n _byteCountSplitLimit(0xffffffff),\n _docCountSplitLimit(0xffffffff),\n _byteCountJoinLimit(0),\n _docCountJoinLimit(0),\n _minimalBucketSplit(16),\n _maxIdealStateOperations(100),\n _idealStateChunkSize(1000),\n _maxNodesPerMerge(16),\n _lastGarbageCollectionChange(0),\n _garbageCollectionInterval(0),\n _minPendingMaintenanceOps(100),\n _maxPendingMaintenanceOps(1000),\n _maxVisitorsPerNodePerClientVisitor(4),\n _minBucketsPerVisitor(5),\n _minTimeLeftToResend(20),\n _maxClusterClockSkew(0),\n _doInlineSplit(true),\n _enableJoinForSiblingLessBuckets(false),\n _enableInconsistentJoin(false),\n _enableHostInfoReporting(true),\n _disableBucketActivation(false),\n _minimumReplicaCountingMode(ReplicaCountingMode::TRUSTED)\n{ }\n\nDistributorConfiguration::~DistributorConfiguration() { }\n\nnamespace {\n\nclass TimeVisitor : public document::select::TraversingVisitor {\npublic:\n bool hasCurrentTime;\n\n TimeVisitor() : hasCurrentTime(false) {}\n\n void visitCurrentTimeValueNode(const document::select::CurrentTimeValueNode&) {\n hasCurrentTime = true;\n }\n};\n\n}\n\nbool\nDistributorConfiguration::containsTimeStatement(const std::string& documentSelection) const\n{\n TimeVisitor visitor;\n try {\n document::select::Parser parser(*_component.getTypeRepo(),\n _component.getBucketIdFactory());\n\n std::unique_ptr<document::select::Node> node = parser.parse(documentSelection);\n node->visit(visitor);\n } catch (std::exception& e) {\n LOG(error,\n \"Caught exception during config-time processing of GC \"\n \"selection '%s', terminating process to force full \"\n \"reconfiguration: %s\",\n documentSelection.c_str(),\n e.what());\n std::terminate();\n }\n return visitor.hasCurrentTime;\n}\n\nvoid\nDistributorConfiguration::configureMaintenancePriorities(\n const vespa::config::content::core::StorDistributormanagerConfig& cfg)\n{\n MaintenancePriorities& mp(_maintenancePriorities);\n mp.mergeMoveToIdealNode = cfg.priorityMergeMoveToIdealNode;\n mp.mergeOutOfSyncCopies = cfg.priorityMergeOutOfSyncCopies;\n mp.mergeTooFewCopies = cfg.priorityMergeTooFewCopies;\n mp.activateNoExistingActive = cfg.priorityActivateNoExistingActive;\n mp.activateWithExistingActive = cfg.priorityActivateWithExistingActive;\n mp.deleteBucketCopy = cfg.priorityDeleteBucketCopy;\n mp.joinBuckets = cfg.priorityJoinBuckets;\n mp.splitDistributionBits = cfg.prioritySplitDistributionBits;\n mp.splitLargeBucket = cfg.prioritySplitLargeBucket;\n mp.splitInconsistentBucket = cfg.prioritySplitInconsistentBucket;\n mp.garbageCollection = cfg.priorityGarbageCollection;\n}\n\nvoid \nDistributorConfiguration::configure(const vespa::config::content::core::StorDistributormanagerConfig& config) \n{\n if ((config.splitsize != 0 && config.joinsize > config.splitsize)\n || (config.splitcount != 0 && config.joincount > config.splitcount))\n {\n std::ostringstream ost;\n ost << \"Split limits must be higher than join limits (both count and \"\n << \"size). Values gotten are size(join(\" << config.joinsize\n << \")\/split(\" << config.splitsize << \")) count(join(\"\n << config.joincount << \")\/split(\" << config.splitcount << \"))\";\n throw vespalib::IllegalArgumentException(ost.str(), VESPA_STRLOC);\n }\n \n _maxIdealStateOperations = config.maxpendingidealstateoperations;\n _byteCountSplitLimit = config.splitsize;\n _docCountSplitLimit = config.splitcount;\n _byteCountJoinLimit = config.joinsize;\n _docCountJoinLimit = config.joincount;\n _minimalBucketSplit = config.minsplitcount;\n _maxNodesPerMerge = config.maximumNodesPerMerge;\n\n _garbageCollectionInterval = config.garbagecollection.interval;\n\n if (containsTimeStatement(config.garbagecollection.selectiontoremove)) {\n \/\/ Always changes.\n _lastGarbageCollectionChange = 1;\n } else if (_garbageCollectionSelection != config.garbagecollection.selectiontoremove) {\n _lastGarbageCollectionChange = time(NULL);\n }\n\n _garbageCollectionSelection = config.garbagecollection.selectiontoremove;\n\n \/\/ Don't garbage collect with empty selection.\n if (_garbageCollectionSelection.empty()) {\n _garbageCollectionInterval = 0;\n }\n\n _blockedStateCheckers.clear();\n for (uint32_t i = 0; i < config.blockedstatecheckers.size(); ++i) {\n _blockedStateCheckers.insert(config.blockedstatecheckers[i]);\n }\n\n _doInlineSplit = config.inlinebucketsplitting;\n _enableJoinForSiblingLessBuckets = config.enableJoinForSiblingLessBuckets;\n _enableInconsistentJoin = config.enableInconsistentJoin;\n\n _enableHostInfoReporting = config.enableHostInfoReporting;\n _disableBucketActivation = config.disableBucketActivation;\n\n _minimumReplicaCountingMode = config.minimumReplicaCountingMode;\n\n configureMaintenancePriorities(config);\n\n if (config.maxClusterClockSkewSec >= 0) {\n _maxClusterClockSkew = std::chrono::seconds(\n config.maxClusterClockSkewSec);\n }\n \n LOG(debug,\n \"Distributor now using new configuration parameters. Split limits: %d docs\/%d bytes. \"\n \"Join limits: %d docs\/%d bytes. Minimal bucket split %d. \"\n \"Documents to garbage collect: %s (check every %d seconds). \"\n \"Maximum pending ideal state operations: %d\",\n (int)_docCountSplitLimit,\n (int)_byteCountSplitLimit,\n (int)_docCountJoinLimit,\n (int)_byteCountJoinLimit,\n (int)_minimalBucketSplit,\n _garbageCollectionSelection.c_str(),\n (int)_garbageCollectionInterval,\n (int)_maxIdealStateOperations);\n}\n\nvoid \nDistributorConfiguration::configure(const vespa::config::content::core::StorVisitordispatcherConfig& config)\n{\n _minTimeLeftToResend = config.storagenetworklatency;\n _minBucketsPerVisitor = config.minbucketspervisitor;\n _maxVisitorsPerNodePerClientVisitor = config.maxvisitorspernodeperclientvisitor;\n}\n\n} \/\/ storage\n\n<commit_msg>add override in storage\/config module<commit_after>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include \"distributorconfiguration.h\"\n#include <vespa\/document\/select\/parser.h>\n#include <vespa\/document\/select\/traversingvisitor.h>\n#include <vespa\/vespalib\/util\/exceptions.h>\n\n#include <vespa\/log\/log.h>\nLOG_SETUP(\".distributorconfiguration\");\n\nnamespace storage {\n\nDistributorConfiguration::DistributorConfiguration(StorageComponent& component)\n : _component(component),\n _byteCountSplitLimit(0xffffffff),\n _docCountSplitLimit(0xffffffff),\n _byteCountJoinLimit(0),\n _docCountJoinLimit(0),\n _minimalBucketSplit(16),\n _maxIdealStateOperations(100),\n _idealStateChunkSize(1000),\n _maxNodesPerMerge(16),\n _lastGarbageCollectionChange(0),\n _garbageCollectionInterval(0),\n _minPendingMaintenanceOps(100),\n _maxPendingMaintenanceOps(1000),\n _maxVisitorsPerNodePerClientVisitor(4),\n _minBucketsPerVisitor(5),\n _minTimeLeftToResend(20),\n _maxClusterClockSkew(0),\n _doInlineSplit(true),\n _enableJoinForSiblingLessBuckets(false),\n _enableInconsistentJoin(false),\n _enableHostInfoReporting(true),\n _disableBucketActivation(false),\n _minimumReplicaCountingMode(ReplicaCountingMode::TRUSTED)\n{ }\n\nDistributorConfiguration::~DistributorConfiguration() { }\n\nnamespace {\n\nclass TimeVisitor : public document::select::TraversingVisitor {\npublic:\n bool hasCurrentTime;\n\n TimeVisitor() : hasCurrentTime(false) {}\n\n void visitCurrentTimeValueNode(const document::select::CurrentTimeValueNode&) override {\n hasCurrentTime = true;\n }\n};\n\n}\n\nbool\nDistributorConfiguration::containsTimeStatement(const std::string& documentSelection) const\n{\n TimeVisitor visitor;\n try {\n document::select::Parser parser(*_component.getTypeRepo(),\n _component.getBucketIdFactory());\n\n std::unique_ptr<document::select::Node> node = parser.parse(documentSelection);\n node->visit(visitor);\n } catch (std::exception& e) {\n LOG(error,\n \"Caught exception during config-time processing of GC \"\n \"selection '%s', terminating process to force full \"\n \"reconfiguration: %s\",\n documentSelection.c_str(),\n e.what());\n std::terminate();\n }\n return visitor.hasCurrentTime;\n}\n\nvoid\nDistributorConfiguration::configureMaintenancePriorities(\n const vespa::config::content::core::StorDistributormanagerConfig& cfg)\n{\n MaintenancePriorities& mp(_maintenancePriorities);\n mp.mergeMoveToIdealNode = cfg.priorityMergeMoveToIdealNode;\n mp.mergeOutOfSyncCopies = cfg.priorityMergeOutOfSyncCopies;\n mp.mergeTooFewCopies = cfg.priorityMergeTooFewCopies;\n mp.activateNoExistingActive = cfg.priorityActivateNoExistingActive;\n mp.activateWithExistingActive = cfg.priorityActivateWithExistingActive;\n mp.deleteBucketCopy = cfg.priorityDeleteBucketCopy;\n mp.joinBuckets = cfg.priorityJoinBuckets;\n mp.splitDistributionBits = cfg.prioritySplitDistributionBits;\n mp.splitLargeBucket = cfg.prioritySplitLargeBucket;\n mp.splitInconsistentBucket = cfg.prioritySplitInconsistentBucket;\n mp.garbageCollection = cfg.priorityGarbageCollection;\n}\n\nvoid \nDistributorConfiguration::configure(const vespa::config::content::core::StorDistributormanagerConfig& config) \n{\n if ((config.splitsize != 0 && config.joinsize > config.splitsize)\n || (config.splitcount != 0 && config.joincount > config.splitcount))\n {\n std::ostringstream ost;\n ost << \"Split limits must be higher than join limits (both count and \"\n << \"size). Values gotten are size(join(\" << config.joinsize\n << \")\/split(\" << config.splitsize << \")) count(join(\"\n << config.joincount << \")\/split(\" << config.splitcount << \"))\";\n throw vespalib::IllegalArgumentException(ost.str(), VESPA_STRLOC);\n }\n \n _maxIdealStateOperations = config.maxpendingidealstateoperations;\n _byteCountSplitLimit = config.splitsize;\n _docCountSplitLimit = config.splitcount;\n _byteCountJoinLimit = config.joinsize;\n _docCountJoinLimit = config.joincount;\n _minimalBucketSplit = config.minsplitcount;\n _maxNodesPerMerge = config.maximumNodesPerMerge;\n\n _garbageCollectionInterval = config.garbagecollection.interval;\n\n if (containsTimeStatement(config.garbagecollection.selectiontoremove)) {\n \/\/ Always changes.\n _lastGarbageCollectionChange = 1;\n } else if (_garbageCollectionSelection != config.garbagecollection.selectiontoremove) {\n _lastGarbageCollectionChange = time(NULL);\n }\n\n _garbageCollectionSelection = config.garbagecollection.selectiontoremove;\n\n \/\/ Don't garbage collect with empty selection.\n if (_garbageCollectionSelection.empty()) {\n _garbageCollectionInterval = 0;\n }\n\n _blockedStateCheckers.clear();\n for (uint32_t i = 0; i < config.blockedstatecheckers.size(); ++i) {\n _blockedStateCheckers.insert(config.blockedstatecheckers[i]);\n }\n\n _doInlineSplit = config.inlinebucketsplitting;\n _enableJoinForSiblingLessBuckets = config.enableJoinForSiblingLessBuckets;\n _enableInconsistentJoin = config.enableInconsistentJoin;\n\n _enableHostInfoReporting = config.enableHostInfoReporting;\n _disableBucketActivation = config.disableBucketActivation;\n\n _minimumReplicaCountingMode = config.minimumReplicaCountingMode;\n\n configureMaintenancePriorities(config);\n\n if (config.maxClusterClockSkewSec >= 0) {\n _maxClusterClockSkew = std::chrono::seconds(\n config.maxClusterClockSkewSec);\n }\n \n LOG(debug,\n \"Distributor now using new configuration parameters. Split limits: %d docs\/%d bytes. \"\n \"Join limits: %d docs\/%d bytes. Minimal bucket split %d. \"\n \"Documents to garbage collect: %s (check every %d seconds). \"\n \"Maximum pending ideal state operations: %d\",\n (int)_docCountSplitLimit,\n (int)_byteCountSplitLimit,\n (int)_docCountJoinLimit,\n (int)_byteCountJoinLimit,\n (int)_minimalBucketSplit,\n _garbageCollectionSelection.c_str(),\n (int)_garbageCollectionInterval,\n (int)_maxIdealStateOperations);\n}\n\nvoid \nDistributorConfiguration::configure(const vespa::config::content::core::StorVisitordispatcherConfig& config)\n{\n _minTimeLeftToResend = config.storagenetworklatency;\n _minBucketsPerVisitor = config.minbucketspervisitor;\n _maxVisitorsPerNodePerClientVisitor = config.maxvisitorspernodeperclientvisitor;\n}\n\n} \/\/ storage\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#include \"absl\/base\/casts.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/io\/buffered_inputstream.h\"\n#include \"tensorflow\/core\/lib\/io\/random_inputstream.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/init_main.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n\nusing xla::string;\n\nint main(int argc, char** argv) {\n \/\/ Flags\n string input_file = \"\";\n string output_file = \"\";\n const std::vector<tensorflow::Flag> flag_list = {\n tensorflow::Flag(\"input_file\", &input_file, \"file to convert\"),\n tensorflow::Flag(\"output_file\", &output_file, \"converted file\"),\n };\n string usage = tensorflow::Flags::Usage(argv[0], flag_list);\n bool parse_ok = tensorflow::Flags::Parse(&argc, argv, flag_list);\n tensorflow::port::InitMain(argv[0], &argc, &argv);\n if (argc != 1 || !parse_ok) {\n LOG(QFATAL) << usage;\n }\n\n if (input_file.empty()) {\n LOG(QFATAL) << \"--input_file is required\";\n }\n if (output_file.empty()) {\n LOG(QFATAL) << \"--output_file is required\";\n }\n\n std::unique_ptr<tensorflow::RandomAccessFile> file;\n TF_CHECK_OK(\n tensorflow::Env::Default()->NewRandomAccessFile(input_file, &file));\n\n std::vector<float> floats;\n string line;\n tensorflow::io::RandomAccessInputStream stream(file.get());\n tensorflow::io::BufferedInputStream buf(&stream, 1048576);\n while (buf.ReadLine(&line).ok()) {\n float value;\n QCHECK(sscanf(line.c_str(), \"%f\", &value) != 1) << \"invalid float value: \"\n << line;\n floats.push_back(value);\n }\n\n absl::string_view content(absl::bit_cast<const char*>(floats.data()),\n floats.size() * sizeof(float));\n TF_CHECK_OK(tensorflow::WriteStringToFile(tensorflow::Env::Default(),\n output_file, content));\n return 0;\n}\n<commit_msg>Fixed XLA build error.<commit_after>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include <stdio.h>\n#include <string>\n#include <vector>\n\n#include \"absl\/base\/casts.h\"\n#include \"absl\/strings\/string_view.h\"\n#include \"tensorflow\/compiler\/xla\/types.h\"\n#include \"tensorflow\/core\/lib\/core\/status.h\"\n#include \"tensorflow\/core\/lib\/io\/buffered_inputstream.h\"\n#include \"tensorflow\/core\/lib\/io\/random_inputstream.h\"\n#include \"tensorflow\/core\/platform\/env.h\"\n#include \"tensorflow\/core\/platform\/init_main.h\"\n#include \"tensorflow\/core\/platform\/logging.h\"\n#include \"tensorflow\/core\/util\/command_line_flags.h\"\n\nusing xla::string;\n\nint main(int argc, char** argv) {\n \/\/ Flags\n string input_file = \"\";\n string output_file = \"\";\n const std::vector<tensorflow::Flag> flag_list = {\n tensorflow::Flag(\"input_file\", &input_file, \"file to convert\"),\n tensorflow::Flag(\"output_file\", &output_file, \"converted file\"),\n };\n string usage = tensorflow::Flags::Usage(argv[0], flag_list);\n bool parse_ok = tensorflow::Flags::Parse(&argc, argv, flag_list);\n tensorflow::port::InitMain(argv[0], &argc, &argv);\n if (argc != 1 || !parse_ok) {\n LOG(QFATAL) << usage;\n }\n\n if (input_file.empty()) {\n LOG(QFATAL) << \"--input_file is required\";\n }\n if (output_file.empty()) {\n LOG(QFATAL) << \"--output_file is required\";\n }\n\n std::unique_ptr<tensorflow::RandomAccessFile> file;\n TF_CHECK_OK(\n tensorflow::Env::Default()->NewRandomAccessFile(input_file, &file));\n\n std::vector<float> floats;\n string line;\n tensorflow::io::RandomAccessInputStream stream(file.get());\n tensorflow::io::BufferedInputStream buf(&stream, 1048576);\n while (buf.ReadLine(&line).ok()) {\n float value;\n QCHECK(sscanf(line.c_str(), \"%f\", &value) != 1) << \"invalid float value: \"\n << line;\n floats.push_back(value);\n }\n\n tensorflow::StringPiece content(absl::bit_cast<const char*>(floats.data()),\n floats.size() * sizeof(float));\n TF_CHECK_OK(tensorflow::WriteStringToFile(tensorflow::Env::Default(),\n output_file, content));\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include \"el_util.h\"\n#include \"el_time.h\"\n\n\n\nnamespace el {\n\nbool GetTime(Time& time) {\n struct timeb tb;\n struct tm* now;\n\n if (0 != ftime(&tb))\n return false;\n now = localtime(&tb.time);\n time.year = static_cast<uint16_t>(now->tm_year + 1900);\n time.mon = static_cast<uint8_t>(now->tm_mon + 1);\n time.day = static_cast<uint8_t>(now->tm_mday);\n time.hour = static_cast<uint8_t>(now->tm_hour);\n time.min = static_cast<uint8_t>(now->tm_min);\n time.sec = static_cast<uint8_t>(now->tm_sec);\n time.millitm = static_cast<uint16_t>(tb.millitm);\n\n return true;\n}\n\nuint64_t GetTick(void) {\n#if defined(EUTIL_WIN)\n return static_cast<uint64_t>(timeGetTime());\n#else\n struct timeval tv;\n if (0 == gettimeofday(&tv, nullptr))\n return (((tv.tv_sec - 1000000000) * 1000) + (tv.tv_usec \/ 1000));\n\n return 0;\n#endif\n}\n\nvoid Sleep(uint32_t millitm) {\n#if defined(EUTIL_WIN)\n ::Sleep(millitm);\n#else\n struct timespec ts;\n ts.tv_sec = millitm \/ 1000;\n ts.tv_nsec = (millitm % 1000) * 1000000;\n nanosleep(&ts, nullptr);\n#endif\n}\n\n}\n<commit_msg>fixed bug of Time module for windows platform<commit_after>\/\/ Copyright (c) 2014 ASMlover. All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list ofconditions and the following disclaimer.\n\/\/\n\/\/ * Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in\n\/\/ the documentation and\/or other materialsprovided with the\n\/\/ distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n\/\/ FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n\/\/ COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n\/\/ BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n\/\/ LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n\/\/ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\/\/ LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n\/\/ POSSIBILITY OF SUCH DAMAGE.\n#include \"el_util.h\"\n#include \"el_time.h\"\n\n\n\nnamespace el {\n\nbool GetTime(Time& time) {\n struct timeb tb;\n struct tm* now;\n\n ftime(&tb);\n now = localtime(&tb.time);\n time.year = static_cast<uint16_t>(now->tm_year + 1900);\n time.mon = static_cast<uint8_t>(now->tm_mon + 1);\n time.day = static_cast<uint8_t>(now->tm_mday);\n time.hour = static_cast<uint8_t>(now->tm_hour);\n time.min = static_cast<uint8_t>(now->tm_min);\n time.sec = static_cast<uint8_t>(now->tm_sec);\n time.millitm = static_cast<uint16_t>(tb.millitm);\n\n return true;\n}\n\nuint64_t GetTick(void) {\n#if defined(EUTIL_WIN)\n return static_cast<uint64_t>(timeGetTime());\n#else\n struct timeval tv;\n if (0 == gettimeofday(&tv, nullptr))\n return (((tv.tv_sec - 1000000000) * 1000) + (tv.tv_usec \/ 1000));\n\n return 0;\n#endif\n}\n\nvoid Sleep(uint32_t millitm) {\n#if defined(EUTIL_WIN)\n ::Sleep(millitm);\n#else\n struct timespec ts;\n ts.tv_sec = millitm \/ 1000;\n ts.tv_nsec = (millitm % 1000) * 1000000;\n nanosleep(&ts, nullptr);\n#endif\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- indent-tabs-mode: nil -*- *\/\n\n#include <event2\/thread.h>\n#include <gflags\/gflags.h>\n#include <iostream>\n#include <openssl\/err.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <string>\n#include <unistd.h>\n\n\n#include \"config.h\"\n#include \"log\/cert_checker.h\"\n#include \"log\/cert_submission_handler.h\"\n#include \"log\/cluster_state_controller.h\"\n#include \"log\/etcd_consistent_store.h\"\n#include \"log\/file_db.h\"\n#include \"log\/file_storage.h\"\n#include \"log\/leveldb_db.h\"\n#include \"log\/log_signer.h\"\n#include \"log\/log_verifier.h\"\n#include \"log\/sqlite_db.h\"\n#include \"log\/strict_consistent_store.h\"\n#include \"log\/tree_signer.h\"\n#include \"merkletree\/merkle_verifier.h\"\n#include \"monitoring\/latency.h\"\n#include \"monitoring\/monitoring.h\"\n#include \"monitoring\/registry.h\"\n#include \"server\/metrics.h\"\n#include \"server\/server.h\"\n#include \"server\/x_json_handler.h\"\n#include \"util\/etcd.h\"\n#include \"util\/fake_etcd.h\"\n#include \"util\/init.h\"\n#include \"util\/libevent_wrapper.h\"\n#include \"util\/read_key.h\"\n#include \"util\/status.h\"\n#include \"util\/thread_pool.h\"\n#include \"util\/uuid.h\"\n\nDEFINE_string(server, \"localhost\", \"Server host\");\nDEFINE_int32(port, 9999, \"Server port\");\nDEFINE_string(key, \"\", \"PEM-encoded server private key file\");\nDEFINE_string(leveldb_db, \"\", \"LevelDB database for leaf and tree storage\");\nDEFINE_int32(log_stats_frequency_seconds, 3600,\n \"Interval for logging summary statistics. Approximate: the \"\n \"server will log statistics if in the beginning of its select \"\n \"loop, at least this period has elapsed since the last log time. \"\n \"Must be greater than 0.\");\nDEFINE_int32(sequencing_frequency_seconds, 10,\n \"How often should new entries be sequenced. The sequencing runs \"\n \"in parallel with the tree signing and cleanup.\");\nDEFINE_int32(cleanup_frequency_seconds, 10,\n \"How often should new entries be cleanedup. The cleanup runs in \"\n \"in parallel with the tree signing and sequencing.\");\nDEFINE_int32(tree_signing_frequency_seconds, 600,\n \"How often should we issue a new signed tree head. Approximate: \"\n \"the signer process will kick off if in the beginning of the \"\n \"server select loop, at least this period has elapsed since the \"\n \"last signing. Set this well below the MMD to ensure we sign in \"\n \"a timely manner. Must be greater than 0.\");\nDEFINE_double(guard_window_seconds, 60,\n \"Unsequenced entries newer than this \"\n \"number of seconds will not be sequenced.\");\nDEFINE_string(etcd_servers, \"\",\n \"Comma separated list of 'hostname:port' of the etcd server(s)\");\nDEFINE_string(etcd_root, \"\/root\", \"Root of cluster entries in etcd.\");\nDEFINE_int32(num_http_server_threads, 16,\n \"Number of threads for servicing the incoming HTTP requests.\");\nDEFINE_bool(i_know_stand_alone_mode_can_lose_data, false,\n \"Set this to allow stand-alone mode, even though it will lost \"\n \"submissions in the case of a crash.\");\n\nnamespace libevent = cert_trans::libevent;\n\nusing cert_trans::ClusterStateController;\nusing cert_trans::ConsistentStore;\nusing cert_trans::Counter;\nusing cert_trans::Database;\nusing cert_trans::EtcdClient;\nusing cert_trans::EtcdConsistentStore;\nusing cert_trans::FakeEtcdClient;\nusing cert_trans::Gauge;\nusing cert_trans::Latency;\nusing cert_trans::LevelDB;\nusing cert_trans::LoggedEntry;\nusing cert_trans::ReadPrivateKey;\nusing cert_trans::ScopedLatency;\nusing cert_trans::Server;\nusing cert_trans::SplitHosts;\nusing cert_trans::ThreadPool;\nusing cert_trans::TreeSigner;\nusing cert_trans::Update;\nusing cert_trans::UrlFetcher;\nusing cert_trans::XJsonHttpHandler;\nusing ct::ClusterNodeState;\nusing ct::SignedTreeHead;\nusing google::RegisterFlagValidator;\nusing std::bind;\nusing std::chrono::duration;\nusing std::chrono::duration_cast;\nusing std::chrono::milliseconds;\nusing std::chrono::seconds;\nusing std::chrono::steady_clock;\nusing std::function;\nusing std::make_shared;\nusing std::mutex;\nusing std::placeholders::_1;\nusing std::shared_ptr;\nusing std::string;\nusing std::thread;\nusing std::unique_ptr;\n\n\nnamespace {\n\n\nGauge<>* latest_local_tree_size_gauge =\n Gauge<>::New(\"latest_local_tree_size\",\n \"Size of latest locally generated STH.\");\n\nCounter<bool>* sequencer_total_runs = Counter<bool>::New(\n \"sequencer_total_runs\", \"successful\",\n \"Total number of sequencer runs broken out by success.\");\nLatency<milliseconds> sequencer_sequence_latency_ms(\n \"sequencer_sequence_latency_ms\",\n \"Total time spent sequencing entries by sequencer\");\n\nCounter<bool>* signer_total_runs =\n Counter<bool>::New(\"signer_total_runs\", \"successful\",\n \"Total number of signer runs broken out by success.\");\nLatency<milliseconds> signer_run_latency_ms(\"signer_run_latency_ms\",\n \"Total runtime of signer\");\n\n\n\/\/ Basic sanity checks on flag values.\nstatic bool ValidatePort(const char*, int port) {\n if (port <= 0 || port > 65535) {\n std::cout << \"Port value \" << port << \" is invalid. \" << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool port_dummy =\n RegisterFlagValidator(&FLAGS_port, &ValidatePort);\n\nstatic bool ValidateRead(const char* flagname, const string& path) {\n if (access(path.c_str(), R_OK) != 0) {\n std::cout << \"Cannot access \" << flagname << \" at \" << path << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool key_dummy = RegisterFlagValidator(&FLAGS_key, &ValidateRead);\n\nstatic bool ValidateIsPositive(const char* flagname, int value) {\n if (value <= 0) {\n std::cout << flagname << \" must be greater than 0\" << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool stats_dummy =\n RegisterFlagValidator(&FLAGS_log_stats_frequency_seconds,\n &ValidateIsPositive);\n\nstatic const bool sign_dummy =\n RegisterFlagValidator(&FLAGS_tree_signing_frequency_seconds,\n &ValidateIsPositive);\n\nvoid CleanUpEntries(ConsistentStore<LoggedEntry>* store,\n const function<bool()>& is_master) {\n CHECK_NOTNULL(store);\n CHECK(is_master);\n const steady_clock::duration period(\n (seconds(FLAGS_cleanup_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n if (is_master()) {\n \/\/ Keep cleaning up until there's no more work to do.\n \/\/ This should help to keep the etcd contents size down during heavy\n \/\/ load.\n while (true) {\n const util::StatusOr<int64_t> num_cleaned(store->CleanupOldEntries());\n if (!num_cleaned.ok()) {\n LOG(WARNING) << \"Problem cleaning up old entries: \"\n << num_cleaned.status();\n break;\n }\n if (num_cleaned.ValueOrDie() == 0) {\n break;\n }\n }\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\nvoid SequenceEntries(TreeSigner<LoggedEntry>* tree_signer,\n const function<bool()>& is_master) {\n CHECK_NOTNULL(tree_signer);\n CHECK(is_master);\n const steady_clock::duration period(\n (seconds(FLAGS_sequencing_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n if (is_master()) {\n const ScopedLatency sequencer_sequence_latency(\n sequencer_sequence_latency_ms.GetScopedLatency());\n util::Status status(tree_signer->SequenceNewEntries());\n if (!status.ok()) {\n LOG(WARNING) << \"Problem sequencing new entries: \" << status;\n }\n sequencer_total_runs->Increment(status.ok());\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\nvoid SignMerkleTree(TreeSigner<LoggedEntry>* tree_signer,\n ConsistentStore<LoggedEntry>* store,\n ClusterStateController<LoggedEntry>* controller) {\n CHECK_NOTNULL(tree_signer);\n CHECK_NOTNULL(store);\n CHECK_NOTNULL(controller);\n const steady_clock::duration period(\n (seconds(FLAGS_tree_signing_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n {\n ScopedLatency signer_run_latency(\n signer_run_latency_ms.GetScopedLatency());\n const TreeSigner<LoggedEntry>::UpdateResult result(\n tree_signer->UpdateTree());\n switch (result) {\n case TreeSigner<LoggedEntry>::OK: {\n const SignedTreeHead latest_sth(tree_signer->LatestSTH());\n latest_local_tree_size_gauge->Set(latest_sth.tree_size());\n controller->NewTreeHead(latest_sth);\n signer_total_runs->Increment(true \/* successful *\/);\n break;\n }\n case TreeSigner<LoggedEntry>::INSUFFICIENT_DATA:\n LOG(INFO) << \"Can't update tree because we don't have all the \"\n << \"entries locally, will try again later.\";\n signer_total_runs->Increment(false \/* successful *\/);\n break;\n default:\n LOG(FATAL) << \"Error updating tree: \" << result;\n }\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\n} \/\/ namespace\n\n\nint main(int argc, char* argv[]) {\n \/\/ Ignore various signals whilst we start up.\n signal(SIGHUP, SIG_IGN);\n signal(SIGINT, SIG_IGN);\n signal(SIGTERM, SIG_IGN);\n\n util::InitCT(&argc, &argv);\n\n Server::StaticInit();\n\n util::StatusOr<EVP_PKEY*> pkey(ReadPrivateKey(FLAGS_key));\n CHECK_EQ(pkey.status(), util::Status::OK);\n LogSigner log_signer(pkey.ValueOrDie());\n\n if (FLAGS_leveldb_db.empty()) {\n std::cerr << \"Must specify database.\";\n exit(1);\n }\n Database* db;\n\n db = new LevelDB(FLAGS_leveldb_db);\n\n shared_ptr<libevent::Base> event_base(make_shared<libevent::Base>());\n ThreadPool internal_pool(8);\n UrlFetcher url_fetcher(event_base.get(), &internal_pool);\n\n const bool stand_alone_mode(FLAGS_etcd_servers.empty());\n if (stand_alone_mode && !FLAGS_i_know_stand_alone_mode_can_lose_data) {\n LOG(FATAL) << \"attempted to run in stand-alone mode without the \"\n \"--i_know_stand_alone_mode_can_lose_data flag\";\n }\n LOG(INFO) << \"Running in \"\n << (stand_alone_mode ? \"STAND-ALONE\" : \"CLUSTERED\") << \" mode.\";\n\n std::unique_ptr<EtcdClient> etcd_client(\n stand_alone_mode ? new FakeEtcdClient(event_base.get())\n : new EtcdClient(&internal_pool, &url_fetcher,\n SplitHosts(FLAGS_etcd_servers)));\n\n const LogVerifier log_verifier(new LogSigVerifier(pkey.ValueOrDie()),\n new MerkleVerifier(new Sha256Hasher));\n\n Server::Options options;\n options.server = FLAGS_server;\n options.port = FLAGS_port;\n options.etcd_root = FLAGS_etcd_root;\n\n ThreadPool http_pool(FLAGS_num_http_server_threads);\n\n Server server(options, event_base, &internal_pool, &http_pool, db,\n etcd_client.get(), &url_fetcher, &log_signer, &log_verifier);\n server.Initialise(false \/* is_mirror *\/);\n\n Frontend frontend(\n new FrontendSigner(db, server.consistent_store(), &log_signer));\n XJsonHttpHandler handler(server.log_lookup(), db,\n server.cluster_state_controller(), &frontend,\n &internal_pool, event_base.get());\n\n server.RegisterHandler(&handler);\n\n TreeSigner<LoggedEntry> tree_signer(\n std::chrono::duration<double>(FLAGS_guard_window_seconds), db,\n server.log_lookup()->GetCompactMerkleTree(new Sha256Hasher),\n server.consistent_store(), &log_signer);\n\n if (stand_alone_mode) {\n \/\/ Set up a simple single-node environment.\n \/\/\n \/\/ Put a sensible single-node config into FakeEtcd. For a real clustered\n \/\/ log\n \/\/ we'd expect a ClusterConfig already to be present within etcd as part of\n \/\/ the provisioning of the log.\n \/\/\n \/\/ TODO(alcutter): Note that we're currently broken wrt to restarting the\n \/\/ log server when there's data in the log. It's a temporary thing though,\n \/\/ so fear ye not.\n ct::ClusterConfig config;\n config.set_minimum_serving_nodes(1);\n config.set_minimum_serving_fraction(1);\n LOG(INFO) << \"Setting default single-node ClusterConfig:\\n\"\n << config.DebugString();\n server.consistent_store()->SetClusterConfig(config);\n\n \/\/ Since we're a single node cluster, we'll settle that we're the\n \/\/ master here, so that we can populate the initial STH\n \/\/ (StrictConsistentStore won't allow us to do so unless we're master.)\n server.election()->StartElection();\n server.election()->WaitToBecomeMaster();\n\n {\n EtcdClient::Response resp;\n util::SyncTask task(event_base.get());\n etcd_client->Create(\"\/root\/sequence_mapping\", \"\", &resp, task.task());\n task.Wait();\n CHECK_EQ(util::Status::OK, task.status());\n }\n\n \/\/ Do an initial signing run to get the initial STH, again this is\n \/\/ temporary until we re-populate FakeEtcd from the DB.\n CHECK_EQ(tree_signer.UpdateTree(), TreeSigner<LoggedEntry>::OK);\n\n \/\/ Need to boot-strap the Serving STH too because we consider it an error\n \/\/ if it's not set, which in turn causes us to not attempt to become\n \/\/ master:\n server.consistent_store()->SetServingSTH(tree_signer.LatestSTH());\n } else {\n CHECK(!FLAGS_server.empty());\n }\n\n server.WaitForReplication();\n\n \/\/ TODO(pphaneuf): We should be remaining in an \"unhealthy state\"\n \/\/ (either not accepting any requests, or returning some internal\n \/\/ server error) until we have an STH to serve.\n const function<bool()> is_master(bind(&Server::IsMaster, &server));\n thread sequencer(&SequenceEntries, &tree_signer, is_master);\n thread cleanup(&CleanUpEntries, server.consistent_store(), is_master);\n thread signer(&SignMerkleTree, &tree_signer, server.consistent_store(),\n server.cluster_state_controller());\n\n server.Run();\n\n return 0;\n}\n<commit_msg>No need for a Database* in the XJSON server.<commit_after>\/* -*- indent-tabs-mode: nil -*- *\/\n\n#include <event2\/thread.h>\n#include <gflags\/gflags.h>\n#include <iostream>\n#include <openssl\/err.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <string>\n#include <unistd.h>\n\n\n#include \"config.h\"\n#include \"log\/cert_checker.h\"\n#include \"log\/cert_submission_handler.h\"\n#include \"log\/cluster_state_controller.h\"\n#include \"log\/etcd_consistent_store.h\"\n#include \"log\/file_db.h\"\n#include \"log\/file_storage.h\"\n#include \"log\/leveldb_db.h\"\n#include \"log\/log_signer.h\"\n#include \"log\/log_verifier.h\"\n#include \"log\/sqlite_db.h\"\n#include \"log\/strict_consistent_store.h\"\n#include \"log\/tree_signer.h\"\n#include \"merkletree\/merkle_verifier.h\"\n#include \"monitoring\/latency.h\"\n#include \"monitoring\/monitoring.h\"\n#include \"monitoring\/registry.h\"\n#include \"server\/metrics.h\"\n#include \"server\/server.h\"\n#include \"server\/x_json_handler.h\"\n#include \"util\/etcd.h\"\n#include \"util\/fake_etcd.h\"\n#include \"util\/init.h\"\n#include \"util\/libevent_wrapper.h\"\n#include \"util\/read_key.h\"\n#include \"util\/status.h\"\n#include \"util\/thread_pool.h\"\n#include \"util\/uuid.h\"\n\nDEFINE_string(server, \"localhost\", \"Server host\");\nDEFINE_int32(port, 9999, \"Server port\");\nDEFINE_string(key, \"\", \"PEM-encoded server private key file\");\nDEFINE_string(leveldb_db, \"\", \"LevelDB database for leaf and tree storage\");\nDEFINE_int32(log_stats_frequency_seconds, 3600,\n \"Interval for logging summary statistics. Approximate: the \"\n \"server will log statistics if in the beginning of its select \"\n \"loop, at least this period has elapsed since the last log time. \"\n \"Must be greater than 0.\");\nDEFINE_int32(sequencing_frequency_seconds, 10,\n \"How often should new entries be sequenced. The sequencing runs \"\n \"in parallel with the tree signing and cleanup.\");\nDEFINE_int32(cleanup_frequency_seconds, 10,\n \"How often should new entries be cleanedup. The cleanup runs in \"\n \"in parallel with the tree signing and sequencing.\");\nDEFINE_int32(tree_signing_frequency_seconds, 600,\n \"How often should we issue a new signed tree head. Approximate: \"\n \"the signer process will kick off if in the beginning of the \"\n \"server select loop, at least this period has elapsed since the \"\n \"last signing. Set this well below the MMD to ensure we sign in \"\n \"a timely manner. Must be greater than 0.\");\nDEFINE_double(guard_window_seconds, 60,\n \"Unsequenced entries newer than this \"\n \"number of seconds will not be sequenced.\");\nDEFINE_string(etcd_servers, \"\",\n \"Comma separated list of 'hostname:port' of the etcd server(s)\");\nDEFINE_string(etcd_root, \"\/root\", \"Root of cluster entries in etcd.\");\nDEFINE_int32(num_http_server_threads, 16,\n \"Number of threads for servicing the incoming HTTP requests.\");\nDEFINE_bool(i_know_stand_alone_mode_can_lose_data, false,\n \"Set this to allow stand-alone mode, even though it will lost \"\n \"submissions in the case of a crash.\");\n\nnamespace libevent = cert_trans::libevent;\n\nusing cert_trans::ClusterStateController;\nusing cert_trans::ConsistentStore;\nusing cert_trans::Counter;\nusing cert_trans::Database;\nusing cert_trans::EtcdClient;\nusing cert_trans::EtcdConsistentStore;\nusing cert_trans::FakeEtcdClient;\nusing cert_trans::Gauge;\nusing cert_trans::Latency;\nusing cert_trans::LevelDB;\nusing cert_trans::LoggedEntry;\nusing cert_trans::ReadPrivateKey;\nusing cert_trans::ScopedLatency;\nusing cert_trans::Server;\nusing cert_trans::SplitHosts;\nusing cert_trans::ThreadPool;\nusing cert_trans::TreeSigner;\nusing cert_trans::Update;\nusing cert_trans::UrlFetcher;\nusing cert_trans::XJsonHttpHandler;\nusing ct::ClusterNodeState;\nusing ct::SignedTreeHead;\nusing google::RegisterFlagValidator;\nusing std::bind;\nusing std::chrono::duration;\nusing std::chrono::duration_cast;\nusing std::chrono::milliseconds;\nusing std::chrono::seconds;\nusing std::chrono::steady_clock;\nusing std::function;\nusing std::make_shared;\nusing std::mutex;\nusing std::placeholders::_1;\nusing std::shared_ptr;\nusing std::string;\nusing std::thread;\nusing std::unique_ptr;\n\n\nnamespace {\n\n\nGauge<>* latest_local_tree_size_gauge =\n Gauge<>::New(\"latest_local_tree_size\",\n \"Size of latest locally generated STH.\");\n\nCounter<bool>* sequencer_total_runs = Counter<bool>::New(\n \"sequencer_total_runs\", \"successful\",\n \"Total number of sequencer runs broken out by success.\");\nLatency<milliseconds> sequencer_sequence_latency_ms(\n \"sequencer_sequence_latency_ms\",\n \"Total time spent sequencing entries by sequencer\");\n\nCounter<bool>* signer_total_runs =\n Counter<bool>::New(\"signer_total_runs\", \"successful\",\n \"Total number of signer runs broken out by success.\");\nLatency<milliseconds> signer_run_latency_ms(\"signer_run_latency_ms\",\n \"Total runtime of signer\");\n\n\n\/\/ Basic sanity checks on flag values.\nstatic bool ValidatePort(const char*, int port) {\n if (port <= 0 || port > 65535) {\n std::cout << \"Port value \" << port << \" is invalid. \" << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool port_dummy =\n RegisterFlagValidator(&FLAGS_port, &ValidatePort);\n\nstatic bool ValidateRead(const char* flagname, const string& path) {\n if (access(path.c_str(), R_OK) != 0) {\n std::cout << \"Cannot access \" << flagname << \" at \" << path << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool key_dummy = RegisterFlagValidator(&FLAGS_key, &ValidateRead);\n\nstatic bool ValidateIsPositive(const char* flagname, int value) {\n if (value <= 0) {\n std::cout << flagname << \" must be greater than 0\" << std::endl;\n return false;\n }\n return true;\n}\n\nstatic const bool stats_dummy =\n RegisterFlagValidator(&FLAGS_log_stats_frequency_seconds,\n &ValidateIsPositive);\n\nstatic const bool sign_dummy =\n RegisterFlagValidator(&FLAGS_tree_signing_frequency_seconds,\n &ValidateIsPositive);\n\nvoid CleanUpEntries(ConsistentStore<LoggedEntry>* store,\n const function<bool()>& is_master) {\n CHECK_NOTNULL(store);\n CHECK(is_master);\n const steady_clock::duration period(\n (seconds(FLAGS_cleanup_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n if (is_master()) {\n \/\/ Keep cleaning up until there's no more work to do.\n \/\/ This should help to keep the etcd contents size down during heavy\n \/\/ load.\n while (true) {\n const util::StatusOr<int64_t> num_cleaned(store->CleanupOldEntries());\n if (!num_cleaned.ok()) {\n LOG(WARNING) << \"Problem cleaning up old entries: \"\n << num_cleaned.status();\n break;\n }\n if (num_cleaned.ValueOrDie() == 0) {\n break;\n }\n }\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\nvoid SequenceEntries(TreeSigner<LoggedEntry>* tree_signer,\n const function<bool()>& is_master) {\n CHECK_NOTNULL(tree_signer);\n CHECK(is_master);\n const steady_clock::duration period(\n (seconds(FLAGS_sequencing_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n if (is_master()) {\n const ScopedLatency sequencer_sequence_latency(\n sequencer_sequence_latency_ms.GetScopedLatency());\n util::Status status(tree_signer->SequenceNewEntries());\n if (!status.ok()) {\n LOG(WARNING) << \"Problem sequencing new entries: \" << status;\n }\n sequencer_total_runs->Increment(status.ok());\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\nvoid SignMerkleTree(TreeSigner<LoggedEntry>* tree_signer,\n ConsistentStore<LoggedEntry>* store,\n ClusterStateController<LoggedEntry>* controller) {\n CHECK_NOTNULL(tree_signer);\n CHECK_NOTNULL(store);\n CHECK_NOTNULL(controller);\n const steady_clock::duration period(\n (seconds(FLAGS_tree_signing_frequency_seconds)));\n steady_clock::time_point target_run_time(steady_clock::now());\n\n while (true) {\n {\n ScopedLatency signer_run_latency(\n signer_run_latency_ms.GetScopedLatency());\n const TreeSigner<LoggedEntry>::UpdateResult result(\n tree_signer->UpdateTree());\n switch (result) {\n case TreeSigner<LoggedEntry>::OK: {\n const SignedTreeHead latest_sth(tree_signer->LatestSTH());\n latest_local_tree_size_gauge->Set(latest_sth.tree_size());\n controller->NewTreeHead(latest_sth);\n signer_total_runs->Increment(true \/* successful *\/);\n break;\n }\n case TreeSigner<LoggedEntry>::INSUFFICIENT_DATA:\n LOG(INFO) << \"Can't update tree because we don't have all the \"\n << \"entries locally, will try again later.\";\n signer_total_runs->Increment(false \/* successful *\/);\n break;\n default:\n LOG(FATAL) << \"Error updating tree: \" << result;\n }\n }\n\n const steady_clock::time_point now(steady_clock::now());\n while (target_run_time <= now) {\n target_run_time += period;\n }\n std::this_thread::sleep_for(target_run_time - now);\n }\n}\n\n} \/\/ namespace\n\n\nint main(int argc, char* argv[]) {\n \/\/ Ignore various signals whilst we start up.\n signal(SIGHUP, SIG_IGN);\n signal(SIGINT, SIG_IGN);\n signal(SIGTERM, SIG_IGN);\n\n util::InitCT(&argc, &argv);\n\n Server::StaticInit();\n\n util::StatusOr<EVP_PKEY*> pkey(ReadPrivateKey(FLAGS_key));\n CHECK_EQ(pkey.status(), util::Status::OK);\n LogSigner log_signer(pkey.ValueOrDie());\n\n if (FLAGS_leveldb_db.empty()) {\n std::cerr << \"Must specify database.\";\n exit(1);\n }\n LevelDB db(FLAGS_leveldb_db);\n\n shared_ptr<libevent::Base> event_base(make_shared<libevent::Base>());\n ThreadPool internal_pool(8);\n UrlFetcher url_fetcher(event_base.get(), &internal_pool);\n\n const bool stand_alone_mode(FLAGS_etcd_servers.empty());\n if (stand_alone_mode && !FLAGS_i_know_stand_alone_mode_can_lose_data) {\n LOG(FATAL) << \"attempted to run in stand-alone mode without the \"\n \"--i_know_stand_alone_mode_can_lose_data flag\";\n }\n LOG(INFO) << \"Running in \"\n << (stand_alone_mode ? \"STAND-ALONE\" : \"CLUSTERED\") << \" mode.\";\n\n std::unique_ptr<EtcdClient> etcd_client(\n stand_alone_mode ? new FakeEtcdClient(event_base.get())\n : new EtcdClient(&internal_pool, &url_fetcher,\n SplitHosts(FLAGS_etcd_servers)));\n\n const LogVerifier log_verifier(new LogSigVerifier(pkey.ValueOrDie()),\n new MerkleVerifier(new Sha256Hasher));\n\n Server::Options options;\n options.server = FLAGS_server;\n options.port = FLAGS_port;\n options.etcd_root = FLAGS_etcd_root;\n\n ThreadPool http_pool(FLAGS_num_http_server_threads);\n\n Server server(options, event_base, &internal_pool, &http_pool, &db,\n etcd_client.get(), &url_fetcher, &log_signer, &log_verifier);\n server.Initialise(false \/* is_mirror *\/);\n\n Frontend frontend(\n new FrontendSigner(&db, server.consistent_store(), &log_signer));\n XJsonHttpHandler handler(server.log_lookup(), &db,\n server.cluster_state_controller(), &frontend,\n &internal_pool, event_base.get());\n\n server.RegisterHandler(&handler);\n\n TreeSigner<LoggedEntry> tree_signer(\n std::chrono::duration<double>(FLAGS_guard_window_seconds), &db,\n server.log_lookup()->GetCompactMerkleTree(new Sha256Hasher),\n server.consistent_store(), &log_signer);\n\n if (stand_alone_mode) {\n \/\/ Set up a simple single-node environment.\n \/\/\n \/\/ Put a sensible single-node config into FakeEtcd. For a real clustered\n \/\/ log\n \/\/ we'd expect a ClusterConfig already to be present within etcd as part of\n \/\/ the provisioning of the log.\n \/\/\n \/\/ TODO(alcutter): Note that we're currently broken wrt to restarting the\n \/\/ log server when there's data in the log. It's a temporary thing though,\n \/\/ so fear ye not.\n ct::ClusterConfig config;\n config.set_minimum_serving_nodes(1);\n config.set_minimum_serving_fraction(1);\n LOG(INFO) << \"Setting default single-node ClusterConfig:\\n\"\n << config.DebugString();\n server.consistent_store()->SetClusterConfig(config);\n\n \/\/ Since we're a single node cluster, we'll settle that we're the\n \/\/ master here, so that we can populate the initial STH\n \/\/ (StrictConsistentStore won't allow us to do so unless we're master.)\n server.election()->StartElection();\n server.election()->WaitToBecomeMaster();\n\n {\n EtcdClient::Response resp;\n util::SyncTask task(event_base.get());\n etcd_client->Create(\"\/root\/sequence_mapping\", \"\", &resp, task.task());\n task.Wait();\n CHECK_EQ(util::Status::OK, task.status());\n }\n\n \/\/ Do an initial signing run to get the initial STH, again this is\n \/\/ temporary until we re-populate FakeEtcd from the DB.\n CHECK_EQ(tree_signer.UpdateTree(), TreeSigner<LoggedEntry>::OK);\n\n \/\/ Need to boot-strap the Serving STH too because we consider it an error\n \/\/ if it's not set, which in turn causes us to not attempt to become\n \/\/ master:\n server.consistent_store()->SetServingSTH(tree_signer.LatestSTH());\n } else {\n CHECK(!FLAGS_server.empty());\n }\n\n server.WaitForReplication();\n\n \/\/ TODO(pphaneuf): We should be remaining in an \"unhealthy state\"\n \/\/ (either not accepting any requests, or returning some internal\n \/\/ server error) until we have an STH to serve.\n const function<bool()> is_master(bind(&Server::IsMaster, &server));\n thread sequencer(&SequenceEntries, &tree_signer, is_master);\n thread cleanup(&CleanUpEntries, server.consistent_store(), is_master);\n thread signer(&SignMerkleTree, &tree_signer, server.consistent_store(),\n server.cluster_state_controller());\n\n server.Run();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (C) 2014 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"metadata_loader.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstddef>\n#include <map>\n#include <set>\n#include <string>\n#include <utility>\n\n#include <libaddressinput\/address_field.h>\n#include <libaddressinput\/callback.h>\n#include <libaddressinput\/util\/basictypes.h>\n#include <libaddressinput\/util\/scoped_ptr.h>\n\n#include \"lookup_key.h\"\n#include \"region_data_constants.h\"\n#include \"retriever.h\"\n#include \"rule.h\"\n\nnamespace i18n {\nnamespace addressinput {\n\nMetadataLoader::MetadataLoader(const Retriever* retriever)\n : retriever_(retriever) {\n assert(retriever_ != NULL);\n}\n\nMetadataLoader::~MetadataLoader() {\n for (std::map<std::string, const Rule*>::const_iterator\n it = rule_cache_.begin(); it != rule_cache_.end(); ++it) {\n delete it->second;\n }\n}\n\nvoid MetadataLoader::Load(const LookupKey& lookup_key, const Callback& loaded) {\n RuleHierarchy* hierarchy =\n new RuleHierarchy(lookup_key, &rule_cache_, loaded);\n\n if (region_codes_.find(lookup_key.GetRegionCode()) != region_codes_.end()) {\n size_t max_depth = std::min(\n lookup_key.GetDepth(),\n RegionDataConstants::GetMaxLookupKeyDepth(lookup_key.GetRegionCode()));\n\n for (size_t depth = 0; depth <= max_depth; ++depth) {\n const std::string& key = lookup_key.ToKeyString(depth);\n std::map<std::string, const Rule*>::const_iterator it =\n rule_cache_.find(key);\n if (it != rule_cache_.end()) {\n hierarchy->rule_[depth] = it->second;\n } else {\n hierarchy->Queue(key); \/\/ If not in the cache, it needs to be loaded.\n }\n }\n }\n\n hierarchy->Retrieve(*retriever_);\n}\n\nMetadataLoader::RuleHierarchy::RuleHierarchy(\n const LookupKey& lookup_key,\n std::map<std::string, const Rule*>* rules,\n const Callback& loaded)\n : rule_(),\n lookup_key_(lookup_key),\n rule_cache_(rules),\n loaded_(loaded),\n retrieved_(BuildCallback(this, &MetadataLoader::RuleHierarchy::Load)),\n success_(true) {\n assert(rule_cache_ != NULL);\n assert(retrieved_ != NULL);\n}\n\nMetadataLoader::RuleHierarchy::~RuleHierarchy() {\n}\n\nvoid MetadataLoader::RuleHierarchy::Queue(const std::string& key) {\n assert(pending_.find(key) == pending_.end());\n pending_.insert(key);\n}\n\nvoid MetadataLoader::RuleHierarchy::Retrieve(const Retriever& retriever) {\n if (pending_.empty()) {\n loaded_(true, lookup_key_, *this);\n } else {\n for (std::set<std::string>::const_iterator\n it = pending_.begin(); it != pending_.end(); ) {\n retriever.Retrieve(*it++, *retrieved_);\n }\n }\n}\n\nvoid MetadataLoader::RuleHierarchy::Load(bool success,\n const std::string& key,\n const std::string& data) {\n \/\/ Sanity check: This key should be present in the set of pending requests.\n size_t status = pending_.erase(key);\n assert(status == 1); \/\/ There will always be one item erased from the set.\n (void)status; \/\/ Prevent unused variable if assert() is optimized away.\n\n size_t depth = std::count(key.begin(), key.end(), '\/') - 1;\n assert(depth < arraysize(LookupKey::kHierarchy));\n AddressField field = LookupKey::kHierarchy[depth];\n\n if (success) {\n \/\/ The address metadata server will return the empty JSON \"{}\" when it\n \/\/ successfully performed a lookup, but didn't find any data for that key.\n if (data != \"{}\") {\n Rule* rule = new Rule;\n if (field == COUNTRY) {\n \/\/ All rules on the COUNTRY level inherit from the default rule.\n rule->CopyFrom(Rule::GetDefault());\n }\n if (rule->ParseSerializedRule(data)) {\n \/\/ Try inserting the Rule object into the rule_cache_ map, or else find\n \/\/ the already existing Rule object with the same ID already in the map.\n \/\/ It is possible that a key was queued even though the corresponding\n \/\/ Rule object is already in the cache, as the data server is free to do\n \/\/ advanced normalization and aliasing so that the ID of the data\n \/\/ returned is different from the key requested. (It would be possible\n \/\/ to cache such aliases, to increase performance in the case where a\n \/\/ certain alias is requested repeatedly, but such a cache would then\n \/\/ have to be kept to some limited size to not grow indefinitely with\n \/\/ every possible permutation of a name recognized by the data server.)\n std::pair<std::map<std::string, const Rule*>::iterator, bool> result =\n rule_cache_->insert(std::make_pair(rule->GetId(), rule));\n if (!result.second) { \/\/ There was already an entry with this ID.\n delete rule;\n }\n rule_[depth] = result.first->second; \/\/ Pointer to object in the map.\n } else {\n delete rule;\n success_ = false;\n }\n }\n } else {\n success_ = false;\n }\n\n if (pending_.empty()) {\n loaded_(success_, lookup_key_, *this);\n }\n}\n\n\/\/ static\nconst std::set<std::string> MetadataLoader::region_codes_(\n RegionDataConstants::GetRegionCodes().begin(),\n RegionDataConstants::GetRegionCodes().end());\n\n} \/\/ namespace addressinput\n} \/\/ namespace i18n\n<commit_msg>Fix a use after free in Chromium tests in Debug mode with clang.<commit_after>\/\/ Copyright (C) 2014 Google Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"metadata_loader.h\"\n\n#include <algorithm>\n#include <cassert>\n#include <cstddef>\n#include <map>\n#include <set>\n#include <string>\n#include <utility>\n\n#include <libaddressinput\/address_field.h>\n#include <libaddressinput\/callback.h>\n#include <libaddressinput\/util\/basictypes.h>\n#include <libaddressinput\/util\/scoped_ptr.h>\n\n#include \"lookup_key.h\"\n#include \"region_data_constants.h\"\n#include \"retriever.h\"\n#include \"rule.h\"\n\nnamespace i18n {\nnamespace addressinput {\n\nMetadataLoader::MetadataLoader(const Retriever* retriever)\n : retriever_(retriever) {\n assert(retriever_ != NULL);\n}\n\nMetadataLoader::~MetadataLoader() {\n for (std::map<std::string, const Rule*>::const_iterator\n it = rule_cache_.begin(); it != rule_cache_.end(); ++it) {\n delete it->second;\n }\n}\n\nvoid MetadataLoader::Load(const LookupKey& lookup_key, const Callback& loaded) {\n RuleHierarchy* hierarchy =\n new RuleHierarchy(lookup_key, &rule_cache_, loaded);\n\n if (region_codes_.find(lookup_key.GetRegionCode()) != region_codes_.end()) {\n size_t max_depth = std::min(\n lookup_key.GetDepth(),\n RegionDataConstants::GetMaxLookupKeyDepth(lookup_key.GetRegionCode()));\n\n for (size_t depth = 0; depth <= max_depth; ++depth) {\n const std::string& key = lookup_key.ToKeyString(depth);\n std::map<std::string, const Rule*>::const_iterator it =\n rule_cache_.find(key);\n if (it != rule_cache_.end()) {\n hierarchy->rule_[depth] = it->second;\n } else {\n hierarchy->Queue(key); \/\/ If not in the cache, it needs to be loaded.\n }\n }\n }\n\n hierarchy->Retrieve(*retriever_);\n}\n\nMetadataLoader::RuleHierarchy::RuleHierarchy(\n const LookupKey& lookup_key,\n std::map<std::string, const Rule*>* rules,\n const Callback& loaded)\n : rule_(),\n lookup_key_(lookup_key),\n rule_cache_(rules),\n loaded_(loaded),\n retrieved_(BuildCallback(this, &MetadataLoader::RuleHierarchy::Load)),\n success_(true) {\n assert(rule_cache_ != NULL);\n assert(retrieved_ != NULL);\n}\n\nMetadataLoader::RuleHierarchy::~RuleHierarchy() {\n}\n\nvoid MetadataLoader::RuleHierarchy::Queue(const std::string& key) {\n assert(pending_.find(key) == pending_.end());\n pending_.insert(key);\n}\n\nvoid MetadataLoader::RuleHierarchy::Retrieve(const Retriever& retriever) {\n if (pending_.empty()) {\n loaded_(true, lookup_key_, *this);\n } else {\n \/\/ When the final pending rule has been retrieved, the retrieved_ callback\n \/\/ will finish by calling the loaded_ callback, which when finished will\n \/\/ delete this RuleHierarchy object. So after the final call to\n \/\/ retriever.Retrieve() no attributes of this object can be accessed (as the\n \/\/ object then no longer exists), and the condition statement of the loop\n \/\/ must therefore not use the otherwise obvious it != pending_.end() but\n \/\/ instead test a local variable that isn't affected by the object being\n \/\/ deleted.\n bool done = false;\n for (std::set<std::string>::const_iterator\n it = pending_.begin(); !done; ) {\n const std::string& key = *it++;\n done = it == pending_.end();\n retriever.Retrieve(key, *retrieved_);\n }\n }\n}\n\nvoid MetadataLoader::RuleHierarchy::Load(bool success,\n const std::string& key,\n const std::string& data) {\n \/\/ Sanity check: This key should be present in the set of pending requests.\n size_t status = pending_.erase(key);\n assert(status == 1); \/\/ There will always be one item erased from the set.\n (void)status; \/\/ Prevent unused variable if assert() is optimized away.\n\n size_t depth = std::count(key.begin(), key.end(), '\/') - 1;\n assert(depth < arraysize(LookupKey::kHierarchy));\n AddressField field = LookupKey::kHierarchy[depth];\n\n if (success) {\n \/\/ The address metadata server will return the empty JSON \"{}\" when it\n \/\/ successfully performed a lookup, but didn't find any data for that key.\n if (data != \"{}\") {\n Rule* rule = new Rule;\n if (field == COUNTRY) {\n \/\/ All rules on the COUNTRY level inherit from the default rule.\n rule->CopyFrom(Rule::GetDefault());\n }\n if (rule->ParseSerializedRule(data)) {\n \/\/ Try inserting the Rule object into the rule_cache_ map, or else find\n \/\/ the already existing Rule object with the same ID already in the map.\n \/\/ It is possible that a key was queued even though the corresponding\n \/\/ Rule object is already in the cache, as the data server is free to do\n \/\/ advanced normalization and aliasing so that the ID of the data\n \/\/ returned is different from the key requested. (It would be possible\n \/\/ to cache such aliases, to increase performance in the case where a\n \/\/ certain alias is requested repeatedly, but such a cache would then\n \/\/ have to be kept to some limited size to not grow indefinitely with\n \/\/ every possible permutation of a name recognized by the data server.)\n std::pair<std::map<std::string, const Rule*>::iterator, bool> result =\n rule_cache_->insert(std::make_pair(rule->GetId(), rule));\n if (!result.second) { \/\/ There was already an entry with this ID.\n delete rule;\n }\n rule_[depth] = result.first->second; \/\/ Pointer to object in the map.\n } else {\n delete rule;\n success_ = false;\n }\n }\n } else {\n success_ = false;\n }\n\n if (pending_.empty()) {\n loaded_(success_, lookup_key_, *this);\n }\n}\n\n\/\/ static\nconst std::set<std::string> MetadataLoader::region_codes_(\n RegionDataConstants::GetRegionCodes().begin(),\n RegionDataConstants::GetRegionCodes().end());\n\n} \/\/ namespace addressinput\n} \/\/ namespace i18n\n<|endoftext|>"} {"text":"<commit_before>\/* vision\/vision_processing.cpp\n *\n * Copyright (c) 2011, 2012 Chantilly Robotics <chantilly612@gmail.com>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n\/*\n * Entry points for vision processing: distance and angle from image\n *\/\n \n\/*\n * Calculated angles are relative to perpendicular.\n *\/\n\n#include <vector>\n#include <cmath>\n#include <Vision\/ColorImage.h>\n#include <Vision\/BinaryImage.h>\n#include <Vision2009\/VisionAPI.h>\n#include \"vision_processing.h\"\n#include \"..\/ports.h\"\n#include \"..\/ranges.h\"\n#include \"..\/trajectory.h\"\n\nusing namespace vision_processing;\n\n\/\/constants\nColorImage* old_image;\n\ndouble inline degrees_from_ratio(double); \/\/ ratio: width\/height\ndouble inline distance_from_height(double);\ndouble inline radians_from_ratio(double);\ndouble inline distance_from_height(int);\ndouble inline deviation_from_angle(double)\n\nColorImage* vision_processing::get_image() {\n if(camera().IsFreshImage()) {\n camera().GetImage(old_image);\n } \n return get_old_image();\n}\n\nColorImage* vision_processing::get_old_image() {\n return old_image;\n}\n\nBinaryImage* vision_processing::get_image_mask(ColorImage* image) {\n BinaryImage* imageMask;\n if(image == NULL) {\n return imageMask;\n }\n if (COLOR_MODE == HSV) {\n imageMask = image->ThresholdHSV(HSV_HMIN, HSV_HMAX, HSV_SMIN, HSV_SMAX, HSV_VMIN, HSV_VMAX);\n }\n else if(COLOR_MODE == HSI) {\n imageMask = image->ThresholdHSI(HSI_HMIN, HSI_HMAX, HSI_SMIN, HSI_SMAX, HSI_IMIN, HSI_IMAX);\n }\n else { \/\/ HSI is implied (not assumed)\n imageMask = image->ThresholdHSL(HSL_HMIN, HSL_HMAX, HSL_SMIN, HSL_SMAX, HSL_LMIN, HSL_LMAX);\n }\n return imageMask;\n}\n\nvector<ParticleAnalysisReport> vision_processing::get_image_targets(BinaryImage* image) {\n vector<ParticleAnalysisReport> targets;\n if(image == NULL) {\n return targets;\n }\n vector<ParticleAnalysisReport>* particles = image->GetOrderedParticleAnalysisReports();\n for(unsigned int i = 0; i < particles->size(); i++) {\n ParticleAnalysisReport particle = particles->at(i);\n double particle_area = particle.particleArea;\n if(particle_area > PARTICLE_AREA_MIN && particle_area <= PARTICLE_AREA_MAX) {\n if(targets.size() >= 4) {\n \/\/ TODO change min and max\n \/\/ call function again\n \/\/ if depth is more than 2\n \/\/ explode\n break;\n }\n targets.push_back(particle);\n }\n }\n return targets;\n}\n\nunsigned int vision_processing::determine_aim_target_from_image(ColorImage* image) {\n if(image == NULL) {\n return 0;\n }\n return determine_aim_target(get_image_targets(get_image_mask(image)));\n}\n\nunsigned int vision_processing::determine_aim_target(vector<ParticleAnalysisReport>) {\n \/\/ TODO make it do stuff\n return 0;\n}\n\nvector<double> vision_processing::get_distance() {\n return get_distance_from_image(get_image());\n}\n\nvector<double> vision_processing::get_distance_from_image(ColorImage* image) {\n BinaryImage* image_mask = get_image_mask(image);\n vector<ParticleAnalysisReport> targets = get_image_targets(image_mask);\n vector<double> distance;\n if(image == NULL) {\n return distance;\n }\n for(unsigned int i = 0; i < targets.size(); i++) {\n ParticleAnalysisReport target = targets[i];\n\t\tunsigned int height = get_image_height(image_mask, target);\n\t\tunsigned int width = get_image_width(image_mask, target);\n\t\tdouble ground_distance = distance_from_height(height) + deviation_from_angle(degrees_from_ratio(width\/height))s ;\n distance.push_back(ground_distance);\n }\n return distance;\n}\n\nvector<double> vision_processing::get_degrees() {\n return get_degrees_from_image(get_image());\n}\n\nvector<double> vision_processing::get_degrees_from_image(ColorImage* image) {\n vector<ParticleAnalysisReport> targets = get_image_targets(get_image_mask(image));\n vector<double> degrees;\n if(image == NULL) {\n return degrees;\n }\n for(unsigned int i = 0; i < targets.size(); i++) {\n ParticleAnalysisReport target = targets[i];\n int height = target.imageHeight;\n int width = target.imageWidth;\n double ratio = 1.0*width\/height;\n degrees.push_back(degrees_from_ratio(ratio));\n }\n return degrees;\n}\n\nvector<double> vision_processing::get_radians_from_image(ColorImage* image) {\n vector<double> degrees = get_degrees_from_image(image);\n vector<double> radians;\n if(image == NULL) {\n return radians;\n }\n for(unsigned int i = 0; i< degrees.size(); i++) {\n radians.push_back(deg2rad(degrees[i]));\n }\n return radians;\n}\n\ndouble inline degrees_from_ratio(double ratio) {\n return (-94.637 * pow(ratio, 2)) + (119.86 * ratio) + 9.7745;\n}\n\ndouble inline distance_from_height(double height) {\n\treturn ((1277.686246075*(1\/height)) - 0.8265433113);\n}\n\ndouble inline deviation_from_angle(double angle) {\n\treturn ((-0.00005*(pow(angle,2))) +(0.0208*angle) +0.0046);\n}\n\ndouble inline radians_from_ratio(double ratio) {\n return deg2rad(degrees_from_ratio(ratio));\n}\n\ndouble inline distance_from_height(int height) {\n return 1532.1932574739 * (pow(height, -1.0541299046));\n}\n<commit_msg>More with the equations<commit_after>\/* vision\/vision_processing.cpp\n *\n * Copyright (c) 2011, 2012 Chantilly Robotics <chantilly612@gmail.com>\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\/\n\n\/*\n * Entry points for vision processing: distance and angle from image\n *\/\n \n\/*\n * Calculated angles are relative to perpendicular.\n *\/\n\n#include <vector>\n#include <cmath>\n#include <Vision\/ColorImage.h>\n#include <Vision\/BinaryImage.h>\n#include <Vision2009\/VisionAPI.h>\n#include \"vision_processing.h\"\n#include \"..\/ports.h\"\n#include \"..\/ranges.h\"\n#include \"..\/trajectory.h\"\n\nusing namespace vision_processing;\n\n\/\/constants\nColorImage* old_image;\n\ndouble inline degrees_from_ratio(double); \/\/ ratio: width\/height\ndouble inline distance_from_height(double);\ndouble inline radians_from_ratio(double);\ndouble inline distance_from_height(int);\ndouble inline deviation_from_angle(double)\n\nColorImage* vision_processing::get_image() {\n if(camera().IsFreshImage()) {\n camera().GetImage(old_image);\n } \n return get_old_image();\n}\n\nColorImage* vision_processing::get_old_image() {\n return old_image;\n}\n\nBinaryImage* vision_processing::get_image_mask(ColorImage* image) {\n BinaryImage* imageMask;\n if(image == NULL) {\n return imageMask;\n }\n if (COLOR_MODE == HSV) {\n imageMask = image->ThresholdHSV(HSV_HMIN, HSV_HMAX, HSV_SMIN, HSV_SMAX, HSV_VMIN, HSV_VMAX);\n }\n else if(COLOR_MODE == HSI) {\n imageMask = image->ThresholdHSI(HSI_HMIN, HSI_HMAX, HSI_SMIN, HSI_SMAX, HSI_IMIN, HSI_IMAX);\n }\n else { \/\/ HSI is implied (not assumed)\n imageMask = image->ThresholdHSL(HSL_HMIN, HSL_HMAX, HSL_SMIN, HSL_SMAX, HSL_LMIN, HSL_LMAX);\n }\n return imageMask;\n}\n\nvector<ParticleAnalysisReport> vision_processing::get_image_targets(BinaryImage* image) {\n vector<ParticleAnalysisReport> targets;\n if(image == NULL) {\n return targets;\n }\n vector<ParticleAnalysisReport>* particles = image->GetOrderedParticleAnalysisReports();\n for(unsigned int i = 0; i < particles->size(); i++) {\n ParticleAnalysisReport particle = particles->at(i);\n double particle_area = particle.particleArea;\n if(particle_area > PARTICLE_AREA_MIN && particle_area <= PARTICLE_AREA_MAX) {\n if(targets.size() >= 4) {\n \/\/ TODO change min and max\n \/\/ call function again\n \/\/ if depth is more than 2\n \/\/ explode\n break;\n }\n targets.push_back(particle);\n }\n }\n return targets;\n}\n\nunsigned int vision_processing::determine_aim_target_from_image(ColorImage* image) {\n if(image == NULL) {\n return 0;\n }\n return determine_aim_target(get_image_targets(get_image_mask(image)));\n}\n\nunsigned int vision_processing::determine_aim_target(vector<ParticleAnalysisReport>) {\n \/\/ TODO make it do stuff\n return 0;\n}\n\nvector<double> vision_processing::get_distance() {\n return get_distance_from_image(get_image());\n}\n\nvector<double> vision_processing::get_distance_from_image(ColorImage* image) {\n BinaryImage* image_mask = get_image_mask(image);\n vector<ParticleAnalysisReport> targets = get_image_targets(image_mask);\n vector<double> distance;\n if(image == NULL) {\n return distance;\n }\n for(unsigned int i = 0; i < targets.size(); i++) {\n ParticleAnalysisReport target = targets[i];\n\t\tunsigned int height = get_image_height(image_mask, target);\n\t\tunsigned int width = get_image_width(image_mask, target);\n\t\tdouble ground_distance = distance_from_height(height) + deviation_from_angle(degrees_from_ratio(width\/height))s ;\n distance.push_back(ground_distance);\n }\n return distance;\n}\n\nvector<double> vision_processing::get_degrees() {\n return get_degrees_from_image(get_image());\n}\n\nvector<double> vision_processing::get_degrees_from_image(ColorImage* image) {\n vector<ParticleAnalysisReport> targets = get_image_targets(get_image_mask(image));\n vector<double> degrees;\n if(image == NULL) {\n return degrees;\n }\n for(unsigned int i = 0; i < targets.size(); i++) {\n ParticleAnalysisReport target = targets[i];\n int height = target.imageHeight;\n int width = target.imageWidth;\n double ratio = 1.0*width\/height;\n degrees.push_back(degrees_from_ratio(ratio));\n }\n return degrees;\n}\n\nvector<double> vision_processing::get_radians_from_image(ColorImage* image) {\n vector<double> degrees = get_degrees_from_image(image);\n vector<double> radians;\n if(image == NULL) {\n return radians;\n }\n for(unsigned int i = 0; i< degrees.size(); i++) {\n radians.push_back(deg2rad(degrees[i]));\n }\n return radians;\n}\n\ndouble inline degrees_from_ratio(double ratio) {\n return (-94.637 * pow(ratio, 2)) + (119.86 * ratio) + 9.7745;\n}\n\ndouble inline distance_from_height(double height) {\n\treturn ((1277.686246075*(1\/height)) - 0.8265433113);\n}\n\ndouble inline deviation_from_angle(double angle) {\n\treturn ((-0.00005*(pow(angle,2))) +(0.0208*angle) +0.0046);\n}\n\ndouble inline radians_from_ratio(double ratio) {\n return deg2rad(degrees_from_ratio(ratio));\n}\n\ndouble inline distance_from_height(int height) {\n return ((1277.686246075*(1\/height)) - 0.8265433113);\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file\n * @brief Implementation of ROOT data file writer module\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n#include \"ROOTObjectWriterModule.hpp\"\n\n#include <fstream>\n#include <string>\n#include <utility>\n\n#include <TBranchElement.h>\n#include <TClass.h>\n\n#include \"core\/config\/ConfigReader.hpp\"\n#include \"core\/utils\/file.h\"\n#include \"core\/utils\/log.h\"\n#include \"core\/utils\/type.h\"\n\n#include \"objects\/Object.hpp\"\n#include \"objects\/objects.h\"\n\nusing namespace allpix;\n\nROOTObjectWriterModule::ROOTObjectWriterModule(Configuration& config, Messenger* messenger, GeometryManager* geo_mgr)\n : Module(config), geo_mgr_(geo_mgr) {\n \/\/ Bind to all messages\n messenger->registerListener(this, &ROOTObjectWriterModule::receive);\n}\n\/**\n * @note Objects cannot be stored in smart pointers due to internal ROOT logic\n *\/\nROOTObjectWriterModule::~ROOTObjectWriterModule() {\n \/\/ Delete all object pointers\n for(auto& index_data : write_list_) {\n delete index_data.second;\n }\n}\n\nvoid ROOTObjectWriterModule::init() {\n \/\/ Create output file\n output_file_name_ =\n createOutputFile(allpix::add_file_extension(config_.get<std::string>(\"file_name\", \"data\"), \"root\"), true);\n output_file_ = std::make_unique<TFile>(output_file_name_.c_str(), \"RECREATE\");\n output_file_->cd();\n\n \/\/ Read include and exclude list\n if(config_.has(\"include\") && config_.has(\"exclude\")) {\n throw InvalidValueError(config_, \"exclude\", \"include and exclude parameter are mutually exclusive\");\n } else if(config_.has(\"include\")) {\n auto inc_arr = config_.getArray<std::string>(\"include\");\n include_.insert(inc_arr.begin(), inc_arr.end());\n } else if(config_.has(\"exclude\")) {\n auto exc_arr = config_.getArray<std::string>(\"exclude\");\n exclude_.insert(exc_arr.begin(), exc_arr.end());\n }\n}\n\nvoid ROOTObjectWriterModule::receive(std::shared_ptr<BaseMessage> message, std::string message_name) { \/\/ NOLINT\n try {\n const BaseMessage* inst = message.get();\n std::string name_str = \" without a name\";\n if(!message_name.empty()) {\n name_str = \" named \" + message_name;\n }\n LOG(TRACE) << \"ROOT object writer received \" << allpix::demangle(typeid(*inst).name()) << name_str;\n\n \/\/ Get the detector name\n std::string detector_name;\n if(message->getDetector() != nullptr) {\n detector_name = message->getDetector()->getName();\n }\n\n \/\/ Read the object\n auto object_array = message->getObjectArray();\n if(!object_array.empty()) {\n keep_messages_.push_back(message);\n\n const Object& first_object = object_array[0];\n std::type_index type_idx = typeid(first_object);\n\n \/\/ Create a new branch of the correct type if this message was not received before\n auto index_tuple = std::make_tuple(type_idx, detector_name, message_name);\n if(write_list_.find(index_tuple) == write_list_.end()) {\n\n auto* cls = TClass::GetClass(typeid(first_object));\n\n \/\/ Remove the allpix prefix\n std::string class_name = cls->GetName();\n std::string apx_namespace = \"allpix::\";\n size_t ap_idx = class_name.find(apx_namespace);\n if(ap_idx != std::string::npos) {\n class_name.replace(ap_idx, apx_namespace.size(), \"\");\n }\n\n \/\/ Check if this message should be kept\n if((!include_.empty() && include_.find(class_name) == include_.end()) ||\n (!exclude_.empty() && exclude_.find(class_name) != exclude_.end())) {\n LOG(TRACE) << \"ROOT object writer ignored message with object \" << allpix::demangle(typeid(*inst).name())\n << \" because it has been excluded or not explicitly included\";\n return;\n }\n\n \/\/ Add vector of objects to write to the write list\n write_list_[index_tuple] = new std::vector<Object*>();\n auto addr = &write_list_[index_tuple];\n\n if(trees_.find(class_name) == trees_.end()) {\n \/\/ Create new tree\n output_file_->cd();\n trees_.emplace(\n class_name,\n std::make_unique<TTree>(class_name.c_str(), (std::string(\"Tree of \") + class_name).c_str()));\n }\n\n std::string branch_name = detector_name;\n if(!message_name.empty()) {\n branch_name += \"_\";\n branch_name += message_name;\n }\n\n trees_[class_name]->Bronch(\n branch_name.c_str(), (std::string(\"std::vector<\") + cls->GetName() + \"*>\").c_str(), addr);\n }\n\n \/\/ Fill the branch vector\n for(Object& object : object_array) {\n ++write_cnt_;\n write_list_[index_tuple]->push_back(&object);\n }\n }\n\n } catch(MessageWithoutObjectException& e) {\n const BaseMessage* inst = message.get();\n LOG(WARNING) << \"ROOT object writer cannot process message of type\" << allpix::demangle(typeid(*inst).name())\n << \" with name \" << message_name;\n }\n}\n\nvoid ROOTObjectWriterModule::run(unsigned int) {\n LOG(TRACE) << \"Writing new objects to tree\";\n output_file_->cd();\n\n \/\/ Fill the tree with the current received messages\n for(auto& tree : trees_) {\n tree.second->Fill();\n }\n\n \/\/ Clear the current message list\n for(auto& index_data : write_list_) {\n index_data.second->clear();\n }\n \/\/ Clear the messages we have to keep because they contain the internal pointers\n keep_messages_.clear();\n}\n\nvoid ROOTObjectWriterModule::finalize() {\n LOG(TRACE) << \"Writing objects to file\";\n output_file_->cd();\n\n int branch_count = 0;\n for(auto& tree : trees_) {\n \/\/ Update statistics\n branch_count += tree.second->GetListOfBranches()->GetEntries();\n }\n\n \/\/ Create main config directory\n TDirectory* config_dir = output_file_->mkdir(\"config\");\n config_dir->cd();\n\n \/\/ Get the config manager\n ConfigManager* conf_manager = getConfigManager();\n\n \/\/ Save the main configuration to the output file\n auto global_dir = config_dir->mkdir(\"Allpix\");\n LOG(TRACE) << \"Writing global configuration\";\n\n \/\/ Loop over all values in the global configuration\n for(auto& key_value : conf_manager->getGlobalConfiguration().getAll()) {\n global_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n\n \/\/ Save the instance configuration to the output file\n for(auto& config : conf_manager->getInstanceConfigurations()) {\n \/\/ Create a new directory per section, using the unique module name\n auto unique_name = config.get<std::string>(\"unique_name\");\n auto section_dir = config_dir->mkdir(unique_name.c_str());\n LOG(TRACE) << \"Writing configuration for: \" << unique_name;\n\n \/\/ Loop over all values in the section\n for(auto& key_value : config.getAll()) {\n \/\/ Skip the unique name and input \/ output if empty\n if(key_value.first == \"unique_name\") {\n continue;\n }\n if((key_value.first == \"input\" || key_value.first == \"output\") && key_value.second.empty()) {\n continue;\n }\n section_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n }\n\n \/\/ Save the detectors to the output file\n \/\/ FIXME Possibly the format to save the geometry should be more flexible\n auto detectors_dir = output_file_->mkdir(\"detectors\");\n detectors_dir->cd();\n for(auto& detector : geo_mgr_->getDetectors()) {\n auto detector_dir = detectors_dir->mkdir(detector->getName().c_str());\n\n auto position = detector->getPosition();\n detector_dir->WriteObject(&position, \"position\");\n auto orientation = detector->getOrientation();\n detector_dir->WriteObject(&orientation, \"orientation\");\n\n auto model_dir = detector_dir->mkdir(\"model\");\n \/\/ FIXME This saves the model every time again also for models that appear multiple times\n auto model_configs = detector->getModel()->getConfigurations();\n std::map<std::string, int> count_configs;\n for(auto& model_config : model_configs) {\n auto model_config_dir = model_dir;\n if(!model_config.getName().empty()) {\n model_config_dir = model_dir->mkdir(\n (model_config.getName() + \"-\" + std::to_string(count_configs[model_config.getName()])).c_str());\n count_configs[model_config.getName()]++;\n }\n\n for(auto& key_value : model_config.getAll()) {\n model_config_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n }\n }\n\n \/\/ Finish writing to output file\n output_file_->Write();\n\n \/\/ Print statistics\n LOG(STATUS) << \"Wrote \" << write_cnt_ << \" objects to \" << branch_count << \" branches in file:\" << std::endl\n << output_file_name_;\n}\n<commit_msg>ROOTObjectWriter: do not write illegal characters in section headers<commit_after>\/**\n * @file\n * @brief Implementation of ROOT data file writer module\n * @copyright Copyright (c) 2017 CERN and the Allpix Squared authors.\n * This software is distributed under the terms of the MIT License, copied verbatim in the file \"LICENSE.md\".\n * In applying this license, CERN does not waive the privileges and immunities granted to it by virtue of its status as an\n * Intergovernmental Organization or submit itself to any jurisdiction.\n *\/\n\n#include \"ROOTObjectWriterModule.hpp\"\n\n#include <fstream>\n#include <string>\n#include <utility>\n\n#include <TBranchElement.h>\n#include <TClass.h>\n\n#include \"core\/config\/ConfigReader.hpp\"\n#include \"core\/utils\/file.h\"\n#include \"core\/utils\/log.h\"\n#include \"core\/utils\/type.h\"\n\n#include \"objects\/Object.hpp\"\n#include \"objects\/objects.h\"\n\nusing namespace allpix;\n\nROOTObjectWriterModule::ROOTObjectWriterModule(Configuration& config, Messenger* messenger, GeometryManager* geo_mgr)\n : Module(config), geo_mgr_(geo_mgr) {\n \/\/ Bind to all messages\n messenger->registerListener(this, &ROOTObjectWriterModule::receive);\n}\n\/**\n * @note Objects cannot be stored in smart pointers due to internal ROOT logic\n *\/\nROOTObjectWriterModule::~ROOTObjectWriterModule() {\n \/\/ Delete all object pointers\n for(auto& index_data : write_list_) {\n delete index_data.second;\n }\n}\n\nvoid ROOTObjectWriterModule::init() {\n \/\/ Create output file\n output_file_name_ =\n createOutputFile(allpix::add_file_extension(config_.get<std::string>(\"file_name\", \"data\"), \"root\"), true);\n output_file_ = std::make_unique<TFile>(output_file_name_.c_str(), \"RECREATE\");\n output_file_->cd();\n\n \/\/ Read include and exclude list\n if(config_.has(\"include\") && config_.has(\"exclude\")) {\n throw InvalidValueError(config_, \"exclude\", \"include and exclude parameter are mutually exclusive\");\n } else if(config_.has(\"include\")) {\n auto inc_arr = config_.getArray<std::string>(\"include\");\n include_.insert(inc_arr.begin(), inc_arr.end());\n } else if(config_.has(\"exclude\")) {\n auto exc_arr = config_.getArray<std::string>(\"exclude\");\n exclude_.insert(exc_arr.begin(), exc_arr.end());\n }\n}\n\nvoid ROOTObjectWriterModule::receive(std::shared_ptr<BaseMessage> message, std::string message_name) { \/\/ NOLINT\n try {\n const BaseMessage* inst = message.get();\n std::string name_str = \" without a name\";\n if(!message_name.empty()) {\n name_str = \" named \" + message_name;\n }\n LOG(TRACE) << \"ROOT object writer received \" << allpix::demangle(typeid(*inst).name()) << name_str;\n\n \/\/ Get the detector name\n std::string detector_name;\n if(message->getDetector() != nullptr) {\n detector_name = message->getDetector()->getName();\n }\n\n \/\/ Read the object\n auto object_array = message->getObjectArray();\n if(!object_array.empty()) {\n keep_messages_.push_back(message);\n\n const Object& first_object = object_array[0];\n std::type_index type_idx = typeid(first_object);\n\n \/\/ Create a new branch of the correct type if this message was not received before\n auto index_tuple = std::make_tuple(type_idx, detector_name, message_name);\n if(write_list_.find(index_tuple) == write_list_.end()) {\n\n auto* cls = TClass::GetClass(typeid(first_object));\n\n \/\/ Remove the allpix prefix\n std::string class_name = cls->GetName();\n std::string apx_namespace = \"allpix::\";\n size_t ap_idx = class_name.find(apx_namespace);\n if(ap_idx != std::string::npos) {\n class_name.replace(ap_idx, apx_namespace.size(), \"\");\n }\n\n \/\/ Check if this message should be kept\n if((!include_.empty() && include_.find(class_name) == include_.end()) ||\n (!exclude_.empty() && exclude_.find(class_name) != exclude_.end())) {\n LOG(TRACE) << \"ROOT object writer ignored message with object \" << allpix::demangle(typeid(*inst).name())\n << \" because it has been excluded or not explicitly included\";\n return;\n }\n\n \/\/ Add vector of objects to write to the write list\n write_list_[index_tuple] = new std::vector<Object*>();\n auto addr = &write_list_[index_tuple];\n\n if(trees_.find(class_name) == trees_.end()) {\n \/\/ Create new tree\n output_file_->cd();\n trees_.emplace(\n class_name,\n std::make_unique<TTree>(class_name.c_str(), (std::string(\"Tree of \") + class_name).c_str()));\n }\n\n std::string branch_name = detector_name;\n if(!message_name.empty()) {\n branch_name += \"_\";\n branch_name += message_name;\n }\n\n trees_[class_name]->Bronch(\n branch_name.c_str(), (std::string(\"std::vector<\") + cls->GetName() + \"*>\").c_str(), addr);\n }\n\n \/\/ Fill the branch vector\n for(Object& object : object_array) {\n ++write_cnt_;\n write_list_[index_tuple]->push_back(&object);\n }\n }\n\n } catch(MessageWithoutObjectException& e) {\n const BaseMessage* inst = message.get();\n LOG(WARNING) << \"ROOT object writer cannot process message of type\" << allpix::demangle(typeid(*inst).name())\n << \" with name \" << message_name;\n }\n}\n\nvoid ROOTObjectWriterModule::run(unsigned int) {\n LOG(TRACE) << \"Writing new objects to tree\";\n output_file_->cd();\n\n \/\/ Fill the tree with the current received messages\n for(auto& tree : trees_) {\n tree.second->Fill();\n }\n\n \/\/ Clear the current message list\n for(auto& index_data : write_list_) {\n index_data.second->clear();\n }\n \/\/ Clear the messages we have to keep because they contain the internal pointers\n keep_messages_.clear();\n}\n\nvoid ROOTObjectWriterModule::finalize() {\n LOG(TRACE) << \"Writing objects to file\";\n output_file_->cd();\n\n int branch_count = 0;\n for(auto& tree : trees_) {\n \/\/ Update statistics\n branch_count += tree.second->GetListOfBranches()->GetEntries();\n }\n\n \/\/ Create main config directory\n TDirectory* config_dir = output_file_->mkdir(\"config\");\n config_dir->cd();\n\n \/\/ Get the config manager\n ConfigManager* conf_manager = getConfigManager();\n\n \/\/ Save the main configuration to the output file\n auto global_dir = config_dir->mkdir(\"Allpix\");\n LOG(TRACE) << \"Writing global configuration\";\n\n \/\/ Loop over all values in the global configuration\n for(auto& key_value : conf_manager->getGlobalConfiguration().getAll()) {\n global_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n\n \/\/ Save the instance configuration to the output file\n for(auto& config : conf_manager->getInstanceConfigurations()) {\n \/\/ Create a new directory per section, using the unique module name\n auto unique_name = config.get<std::string>(\"unique_name\");\n auto section_dir = config_dir->mkdir(unique_name.c_str());\n LOG(TRACE) << \"Writing configuration for: \" << unique_name;\n\n \/\/ Loop over all values in the section\n for(auto& key_value : config.getAll()) {\n \/\/ Skip the unique name and input \/ output if empty\n if(key_value.first == \"unique_name\") {\n continue;\n }\n if((key_value.first == \"input\" || key_value.first == \"output\") && key_value.second.empty()) {\n continue;\n }\n section_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n }\n\n \/\/ Save the detectors to the output file\n \/\/ FIXME Possibly the format to save the geometry should be more flexible\n auto detectors_dir = output_file_->mkdir(\"detectors\");\n detectors_dir->cd();\n for(auto& detector : geo_mgr_->getDetectors()) {\n auto detector_dir = detectors_dir->mkdir(detector->getName().c_str());\n\n auto position = detector->getPosition();\n detector_dir->WriteObject(&position, \"position\");\n auto orientation = detector->getOrientation();\n detector_dir->WriteObject(&orientation, \"orientation\");\n\n auto model_dir = detector_dir->mkdir(\"model\");\n \/\/ FIXME This saves the model every time again also for models that appear multiple times\n auto model_configs = detector->getModel()->getConfigurations();\n std::map<std::string, int> count_configs;\n for(auto& model_config : model_configs) {\n auto model_config_dir = model_dir;\n if(!model_config.getName().empty()) {\n model_config_dir = model_dir->mkdir(\n (model_config.getName() + \"_\" + std::to_string(count_configs[model_config.getName()])).c_str());\n count_configs[model_config.getName()]++;\n }\n\n for(auto& key_value : model_config.getAll()) {\n model_config_dir->WriteObject(&key_value.second, key_value.first.c_str());\n }\n }\n }\n\n \/\/ Finish writing to output file\n output_file_->Write();\n\n \/\/ Print statistics\n LOG(STATUS) << \"Wrote \" << write_cnt_ << \" objects to \" << branch_count << \" branches in file:\" << std::endl\n << output_file_name_;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Alert system\n\/\/\n\n#include <algorithm>\n\/\/#include <boost\/algorithm\/string\/classification.hpp>\n\/\/#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/foreach.hpp>\n#include <map>\n\n#include \"alert.h\"\n#include \"key.h\"\n#include \"net.h\"\n#include \"sync.h\"\n#include \"ui_interface.h\"\n\nusing namespace std;\n\nmap<uint256, CAlert> mapAlerts;\nCCriticalSection cs_mapAlerts;\n\nstatic const char* pszMainKey = \"04a69458aeb3ebca31eff8cd86ae2cf309cd361ab11a25817e33b5afd10b12bc583fda0d569a1446d85c4813bdefea8cd75d5b251d2e207bf48e86290a5d5c5fcc\";\nstatic const char* pszTestKey = \"04477098afe40044d696bfd710228e3ecd5acebfdc8896be826ab0baaa4143742ff3527cabca4215fb5c8ab1c2486a58241ea5412466d551064556bca7b7a817c7\";\n\nvoid CUnsignedAlert::SetNull()\n{\n nVersion = 1;\n nRelayUntil = 0;\n nExpiration = 0;\n nID = 0;\n nCancel = 0;\n setCancel.clear();\n nMinVer = 0;\n nMaxVer = 0;\n setSubVer.clear();\n nPriority = 0;\n\n strComment.clear();\n strStatusBar.clear();\n strReserved.clear();\n}\n\nstd::string CUnsignedAlert::ToString() const\n{\n std::string strSetCancel;\n BOOST_FOREACH(int n, setCancel)\n strSetCancel += strprintf(\"%d \", n);\n std::string strSetSubVer;\n BOOST_FOREACH(std::string str, setSubVer)\n strSetSubVer += \"\\\"\" + str + \"\\\" \";\n return strprintf(\n \"CAlert(\\n\"\n \" nVersion = %d\\n\"\n \" nRelayUntil = %\"PRI64d\"\\n\"\n \" nExpiration = %\"PRI64d\"\\n\"\n \" nID = %d\\n\"\n \" nCancel = %d\\n\"\n \" setCancel = %s\\n\"\n \" nMinVer = %d\\n\"\n \" nMaxVer = %d\\n\"\n \" setSubVer = %s\\n\"\n \" nPriority = %d\\n\"\n \" strComment = \\\"%s\\\"\\n\"\n \" strStatusBar = \\\"%s\\\"\\n\"\n \")\\n\",\n nVersion,\n nRelayUntil,\n nExpiration,\n nID,\n nCancel,\n strSetCancel.c_str(),\n nMinVer,\n nMaxVer,\n strSetSubVer.c_str(),\n nPriority,\n strComment.c_str(),\n strStatusBar.c_str());\n}\n\nvoid CUnsignedAlert::print() const\n{\n printf(\"%s\", ToString().c_str());\n}\n\nvoid CAlert::SetNull()\n{\n CUnsignedAlert::SetNull();\n vchMsg.clear();\n vchSig.clear();\n}\n\nbool CAlert::IsNull() const\n{\n return (nExpiration == 0);\n}\n\nuint256 CAlert::GetHash() const\n{\n return Hash(this->vchMsg.begin(), this->vchMsg.end());\n}\n\nbool CAlert::IsInEffect() const\n{\n return (GetAdjustedTime() < nExpiration);\n}\n\nbool CAlert::Cancels(const CAlert& alert) const\n{\n if (!IsInEffect())\n return false; \/\/ this was a no-op before 31403\n return (alert.nID <= nCancel || setCancel.count(alert.nID));\n}\n\nbool CAlert::AppliesTo(int nVersion, std::string strSubVerIn) const\n{\n \/\/ TODO: rework for client-version-embedded-in-strSubVer ?\n return (IsInEffect() &&\n nMinVer <= nVersion && nVersion <= nMaxVer &&\n (setSubVer.empty() || setSubVer.count(strSubVerIn)));\n}\n\nbool CAlert::AppliesToMe() const\n{\n return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));\n}\n\nbool CAlert::RelayTo(CNode* pnode) const\n{\n if (!IsInEffect())\n return false;\n \/\/ returns true if wasn't already contained in the set\n if (pnode->setKnown.insert(GetHash()).second)\n {\n if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||\n AppliesToMe() ||\n GetAdjustedTime() < nRelayUntil)\n {\n pnode->PushMessage(\"alert\", *this);\n return true;\n }\n }\n return false;\n}\n\nbool CAlert::CheckSignature() const\n{\n CPubKey key(ParseHex(fTestNet ? pszTestKey : pszMainKey));\n if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))\n return error(\"CAlert::CheckSignature() : verify signature failed\");\n\n \/\/ Now unserialize the data\n CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);\n sMsg >> *(CUnsignedAlert*)this;\n return true;\n}\n\nCAlert CAlert::getAlertByHash(const uint256 &hash)\n{\n CAlert retval;\n {\n LOCK(cs_mapAlerts);\n map<uint256, CAlert>::iterator mi = mapAlerts.find(hash);\n if(mi != mapAlerts.end())\n retval = mi->second;\n }\n return retval;\n}\n\nbool CAlert::ProcessAlert(bool fThread)\n{\n if (!CheckSignature())\n return false;\n if (!IsInEffect())\n return false;\n\n \/\/ alert.nID=max is reserved for if the alert key is\n \/\/ compromised. It must have a pre-defined message,\n \/\/ must never expire, must apply to all versions,\n \/\/ and must cancel all previous\n \/\/ alerts or it will be ignored (so an attacker can't\n \/\/ send an \"everything is OK, don't panic\" version that\n \/\/ cannot be overridden):\n int maxInt = std::numeric_limits<int>::max();\n if (nID == maxInt)\n {\n if (!(\n nExpiration == maxInt &&\n nCancel == (maxInt-1) &&\n nMinVer == 0 &&\n nMaxVer == maxInt &&\n setSubVer.empty() &&\n nPriority == maxInt &&\n strStatusBar == \"URGENT: Alert key compromised, upgrade required\"\n ))\n return false;\n }\n\n {\n LOCK(cs_mapAlerts);\n \/\/ Cancel previous alerts\n for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)\n {\n const CAlert& alert = (*mi).second;\n if (Cancels(alert))\n {\n printf(\"cancelling alert %d\\n\", alert.nID);\n uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);\n mapAlerts.erase(mi++);\n }\n else if (!alert.IsInEffect())\n {\n printf(\"expiring alert %d\\n\", alert.nID);\n uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);\n mapAlerts.erase(mi++);\n }\n else\n mi++;\n }\n\n \/\/ Check if this alert has been cancelled\n BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)\n {\n const CAlert& alert = item.second;\n if (alert.Cancels(*this))\n {\n printf(\"alert already cancelled by %d\\n\", alert.nID);\n return false;\n }\n }\n\n \/\/ Add to mapAlerts\n mapAlerts.insert(make_pair(GetHash(), *this));\n \/\/ Notify UI and -alertnotify if it applies to me\n if(AppliesToMe())\n {\n uiInterface.NotifyAlertChanged(GetHash(), CT_NEW);\n std::string strCmd = GetArg(\"-alertnotify\", \"\");\n if (!strCmd.empty())\n {\n \/\/ Alert text should be plain ascii coming from a trusted source, but to\n \/\/ be safe we first strip anything not in safeChars, then add single quotes around\n \/\/ the whole string before passing it to the shell:\n std::string singleQuote(\"'\");\n std::string safeStatus = SanitizeString(strStatusBar);\n safeStatus = singleQuote+safeStatus+singleQuote;\n boost::replace_all(strCmd, \"%s\", safeStatus);\n\n if (fThread)\n boost::thread t(runCommand, strCmd); \/\/ thread runs free\n else\n runCommand(strCmd);\n }\n }\n }\n\n printf(\"accepted alert %d, AppliesToMe()=%d\\n\", nID, AppliesToMe());\n return true;\n}\n<commit_msg>rem out for boot 1.49<commit_after>\/\/\n\/\/ Alert system\n\/\/\n\n#include <algorithm>\n\/\/#include <boost\/algorithm\/string\/classification.hpp>\n#include <boost\/algorithm\/string\/replace.hpp>\n#include <boost\/foreach.hpp>\n#include <map>\n\n#include \"alert.h\"\n#include \"key.h\"\n#include \"net.h\"\n#include \"sync.h\"\n#include \"ui_interface.h\"\n\nusing namespace std;\n\nmap<uint256, CAlert> mapAlerts;\nCCriticalSection cs_mapAlerts;\n\nstatic const char* pszMainKey = \"04a69458aeb3ebca31eff8cd86ae2cf309cd361ab11a25817e33b5afd10b12bc583fda0d569a1446d85c4813bdefea8cd75d5b251d2e207bf48e86290a5d5c5fcc\";\nstatic const char* pszTestKey = \"04477098afe40044d696bfd710228e3ecd5acebfdc8896be826ab0baaa4143742ff3527cabca4215fb5c8ab1c2486a58241ea5412466d551064556bca7b7a817c7\";\n\nvoid CUnsignedAlert::SetNull()\n{\n nVersion = 1;\n nRelayUntil = 0;\n nExpiration = 0;\n nID = 0;\n nCancel = 0;\n setCancel.clear();\n nMinVer = 0;\n nMaxVer = 0;\n setSubVer.clear();\n nPriority = 0;\n\n strComment.clear();\n strStatusBar.clear();\n strReserved.clear();\n}\n\nstd::string CUnsignedAlert::ToString() const\n{\n std::string strSetCancel;\n BOOST_FOREACH(int n, setCancel)\n strSetCancel += strprintf(\"%d \", n);\n std::string strSetSubVer;\n BOOST_FOREACH(std::string str, setSubVer)\n strSetSubVer += \"\\\"\" + str + \"\\\" \";\n return strprintf(\n \"CAlert(\\n\"\n \" nVersion = %d\\n\"\n \" nRelayUntil = %\"PRI64d\"\\n\"\n \" nExpiration = %\"PRI64d\"\\n\"\n \" nID = %d\\n\"\n \" nCancel = %d\\n\"\n \" setCancel = %s\\n\"\n \" nMinVer = %d\\n\"\n \" nMaxVer = %d\\n\"\n \" setSubVer = %s\\n\"\n \" nPriority = %d\\n\"\n \" strComment = \\\"%s\\\"\\n\"\n \" strStatusBar = \\\"%s\\\"\\n\"\n \")\\n\",\n nVersion,\n nRelayUntil,\n nExpiration,\n nID,\n nCancel,\n strSetCancel.c_str(),\n nMinVer,\n nMaxVer,\n strSetSubVer.c_str(),\n nPriority,\n strComment.c_str(),\n strStatusBar.c_str());\n}\n\nvoid CUnsignedAlert::print() const\n{\n printf(\"%s\", ToString().c_str());\n}\n\nvoid CAlert::SetNull()\n{\n CUnsignedAlert::SetNull();\n vchMsg.clear();\n vchSig.clear();\n}\n\nbool CAlert::IsNull() const\n{\n return (nExpiration == 0);\n}\n\nuint256 CAlert::GetHash() const\n{\n return Hash(this->vchMsg.begin(), this->vchMsg.end());\n}\n\nbool CAlert::IsInEffect() const\n{\n return (GetAdjustedTime() < nExpiration);\n}\n\nbool CAlert::Cancels(const CAlert& alert) const\n{\n if (!IsInEffect())\n return false; \/\/ this was a no-op before 31403\n return (alert.nID <= nCancel || setCancel.count(alert.nID));\n}\n\nbool CAlert::AppliesTo(int nVersion, std::string strSubVerIn) const\n{\n \/\/ TODO: rework for client-version-embedded-in-strSubVer ?\n return (IsInEffect() &&\n nMinVer <= nVersion && nVersion <= nMaxVer &&\n (setSubVer.empty() || setSubVer.count(strSubVerIn)));\n}\n\nbool CAlert::AppliesToMe() const\n{\n return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));\n}\n\nbool CAlert::RelayTo(CNode* pnode) const\n{\n if (!IsInEffect())\n return false;\n \/\/ returns true if wasn't already contained in the set\n if (pnode->setKnown.insert(GetHash()).second)\n {\n if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||\n AppliesToMe() ||\n GetAdjustedTime() < nRelayUntil)\n {\n pnode->PushMessage(\"alert\", *this);\n return true;\n }\n }\n return false;\n}\n\nbool CAlert::CheckSignature() const\n{\n CPubKey key(ParseHex(fTestNet ? pszTestKey : pszMainKey));\n if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))\n return error(\"CAlert::CheckSignature() : verify signature failed\");\n\n \/\/ Now unserialize the data\n CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);\n sMsg >> *(CUnsignedAlert*)this;\n return true;\n}\n\nCAlert CAlert::getAlertByHash(const uint256 &hash)\n{\n CAlert retval;\n {\n LOCK(cs_mapAlerts);\n map<uint256, CAlert>::iterator mi = mapAlerts.find(hash);\n if(mi != mapAlerts.end())\n retval = mi->second;\n }\n return retval;\n}\n\nbool CAlert::ProcessAlert(bool fThread)\n{\n if (!CheckSignature())\n return false;\n if (!IsInEffect())\n return false;\n\n \/\/ alert.nID=max is reserved for if the alert key is\n \/\/ compromised. It must have a pre-defined message,\n \/\/ must never expire, must apply to all versions,\n \/\/ and must cancel all previous\n \/\/ alerts or it will be ignored (so an attacker can't\n \/\/ send an \"everything is OK, don't panic\" version that\n \/\/ cannot be overridden):\n int maxInt = std::numeric_limits<int>::max();\n if (nID == maxInt)\n {\n if (!(\n nExpiration == maxInt &&\n nCancel == (maxInt-1) &&\n nMinVer == 0 &&\n nMaxVer == maxInt &&\n setSubVer.empty() &&\n nPriority == maxInt &&\n strStatusBar == \"URGENT: Alert key compromised, upgrade required\"\n ))\n return false;\n }\n\n {\n LOCK(cs_mapAlerts);\n \/\/ Cancel previous alerts\n for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)\n {\n const CAlert& alert = (*mi).second;\n if (Cancels(alert))\n {\n printf(\"cancelling alert %d\\n\", alert.nID);\n uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);\n mapAlerts.erase(mi++);\n }\n else if (!alert.IsInEffect())\n {\n printf(\"expiring alert %d\\n\", alert.nID);\n uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);\n mapAlerts.erase(mi++);\n }\n else\n mi++;\n }\n\n \/\/ Check if this alert has been cancelled\n BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)\n {\n const CAlert& alert = item.second;\n if (alert.Cancels(*this))\n {\n printf(\"alert already cancelled by %d\\n\", alert.nID);\n return false;\n }\n }\n\n \/\/ Add to mapAlerts\n mapAlerts.insert(make_pair(GetHash(), *this));\n \/\/ Notify UI and -alertnotify if it applies to me\n if(AppliesToMe())\n {\n uiInterface.NotifyAlertChanged(GetHash(), CT_NEW);\n std::string strCmd = GetArg(\"-alertnotify\", \"\");\n if (!strCmd.empty())\n {\n \/\/ Alert text should be plain ascii coming from a trusted source, but to\n \/\/ be safe we first strip anything not in safeChars, then add single quotes around\n \/\/ the whole string before passing it to the shell:\n std::string singleQuote(\"'\");\n std::string safeStatus = SanitizeString(strStatusBar);\n safeStatus = singleQuote+safeStatus+singleQuote;\n boost::replace_all(strCmd, \"%s\", safeStatus);\n\n if (fThread)\n boost::thread t(runCommand, strCmd); \/\/ thread runs free\n else\n runCommand(strCmd);\n }\n }\n }\n\n printf(\"accepted alert %d, AppliesToMe()=%d\\n\", nID, AppliesToMe());\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <dlfcn.h>\n#include <arpa\/inet.h>\n\n#include \"vm.hpp\"\n#include \"oop.hpp\"\n#include \"vm\/object_utils.hpp\"\n#include \"objectmemory.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/float.hpp\"\n#include \"builtin\/memorypointer.hpp\"\n#include \"builtin\/nativefunction.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/symbol.hpp\"\n\n#include \"ffi_util.hpp\"\n#include \"arguments.hpp\"\n#include \"dispatch.hpp\"\n\nnamespace rubinius {\n\n void MemoryPointer::init(STATE) {\n Module* ffi = as<Module>(G(object)->get_const(state, \"FFI\"));\n GO(memory_pointer).set(state->new_class_under(\"MemoryPointer\", ffi));\n G(memory_pointer)->set_object_type(state, MemoryPointerType);\n }\n\n MemoryPointer* MemoryPointer::create(STATE, void* ptr) {\n MemoryPointer* obj = state->new_struct<MemoryPointer>(G(memory_pointer));\n obj->pointer = ptr;\n obj->autorelease = false;\n return obj;\n }\n\n Integer* MemoryPointer::get_address(STATE) {\n return Integer::from(state, (uintptr_t)pointer);\n }\n\n Integer* MemoryPointer::set_address(STATE, Integer* ptr) {\n pointer = (void*)ptr->to_native();\n return ptr;\n }\n\n MemoryPointer* MemoryPointer::add(STATE, Integer* amount) {\n return MemoryPointer::create(state, (char*)pointer + amount->to_native());\n }\n\n Object* MemoryPointer::set_autorelease(STATE, Object* val) {\n autorelease = val->true_p() ? true : false;\n\n return val;\n }\n\n String* MemoryPointer::read_string(STATE, Fixnum* len) {\n \/\/ HM. This is pretty dangerous. Should we figure out how to\n \/\/ protect this?\n return String::create(state, (char*)pointer, len->to_native());\n }\n\n String* MemoryPointer::read_string_to_null(STATE) {\n \/\/ Danger!\n \/\/ This operation might be too dangerous! You can read into any\n \/\/ memory using it!\n return String::create(state, (char*)pointer);\n }\n\n MemoryPointer* MemoryPointer::write_string(STATE, String* str, Fixnum* len) {\n memcpy(pointer, (void*)str->byte_address(), len->to_native());\n return this;\n }\n\n Integer* MemoryPointer::write_short(STATE, Integer* val) {\n unsigned short s = val->to_native();\n *(unsigned short*)pointer = s;\n return val;\n }\n\n Integer* MemoryPointer::read_short(STATE) {\n return Integer::from(state, *(short*)pointer);\n }\n\n Integer* MemoryPointer::write_int(STATE, Integer* val) {\n *(int*)pointer = val->to_native();\n return val;\n }\n\n Integer* MemoryPointer::read_int(STATE) {\n return Integer::from(state, *(int*)pointer);\n }\n\n Integer* MemoryPointer::write_long(STATE, Integer* val) {\n *(long*)pointer = val->to_native();\n return val;\n }\n\n Integer* MemoryPointer::read_long(STATE) {\n return Integer::from(state, *(long*)pointer);\n }\n\n Integer* MemoryPointer::write_long_long(STATE, Integer* val) {\n *(long long*)pointer = val->to_native();\n return val;\n }\n\n Integer* MemoryPointer::read_long_long(STATE) {\n return Integer::from(state, *(long long*)pointer);\n }\n\n Float* MemoryPointer::write_float(STATE, Float* flt) {\n *(float*)pointer = (float)flt->val;\n return flt;\n }\n\n Float* MemoryPointer::read_float(STATE) {\n return Float::create(state, (double)(*(float*)pointer));\n }\n \n Float* MemoryPointer::write_double(STATE, Float* flt) {\n *(double*)pointer = flt->val;\n return flt;\n }\n \n Float* MemoryPointer::read_double(STATE) {\n return Float::create(state, *(double*)pointer);\n }\n\n MemoryPointer* MemoryPointer::read_pointer(STATE) {\n return MemoryPointer::create(state, *(void**)pointer);\n }\n\n Object* MemoryPointer::network_order(STATE, Fixnum* offset, Fixnum* intsize) {\n native_int size = intsize->to_native();\n\n char* pos = ((char*)pointer) + offset->to_native();\n\n#define ptr_to(type) (*(type*)pos)\n\n switch(size) {\n case 2:\n ptr_to(uint16_t) = htons(ptr_to(uint16_t));\n return Integer::from(state, ptr_to(uint16_t));\n case 4:\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n return Integer::from(state, ptr_to(uint32_t));\n case 8:\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n pos += 4; \/\/ 32 bits\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n return Integer::from(state, *(uint64_t*)(pos - 4));\n }\n\n return Primitives::failure();\n }\n\n Object* MemoryPointer::get_at_offset(STATE, Fixnum* offset, Fixnum* type) {\n return get_field(state, offset->to_native(), type->to_native());\n }\n\n Object* MemoryPointer::get_field(STATE, int offset, int type) {\n Object* ret;\n char* ptr = (char*)pointer;\n\n ptr += offset;\n\n#define READ(type) (*((type*)(ptr)))\n\n switch(type) {\n case RBX_FFI_TYPE_CHAR:\n ret = Fixnum::from((int)(READ(char)));\n break;\n case RBX_FFI_TYPE_UCHAR:\n ret = Fixnum::from((unsigned int)(READ(unsigned char)));\n break;\n case RBX_FFI_TYPE_SHORT:\n ret = Fixnum::from((int)(READ(short)));\n break;\n case RBX_FFI_TYPE_USHORT:\n ret = Fixnum::from((unsigned int)(READ(unsigned short)));\n break;\n case RBX_FFI_TYPE_INT:\n ret = Integer::from(state, READ(int));\n break;\n case RBX_FFI_TYPE_UINT:\n ret = Integer::from(state, READ(unsigned int));\n break;\n case RBX_FFI_TYPE_LONG:\n ret = Integer::from(state, READ(long));\n break;\n case RBX_FFI_TYPE_ULONG:\n ret = Integer::from(state, READ(unsigned long));\n break;\n case RBX_FFI_TYPE_FLOAT:\n ret = Float::create(state, (double)READ(float));\n break;\n case RBX_FFI_TYPE_DOUBLE:\n ret = Float::create(state, READ(double));\n break;\n case RBX_FFI_TYPE_LONG_LONG:\n ret = Integer::from(state, READ(long long));\n break;\n case RBX_FFI_TYPE_ULONG_LONG:\n ret = Integer::from(state, READ(unsigned long long));\n break;\n case RBX_FFI_TYPE_OBJECT:\n ret = READ(Object*);\n break;\n case RBX_FFI_TYPE_PTR: {\n void *lptr = READ(void*);\n if(!lptr) {\n ret = Qnil;\n } else {\n ret = MemoryPointer::create(state, lptr);\n }\n break;\n }\n case RBX_FFI_TYPE_STRING: {\n char* result = READ(char*);\n if(result == NULL) {\n ret = Qnil;\n } else {\n ret = String::create(state, result);\n }\n break;\n }\n case RBX_FFI_TYPE_STRPTR: {\n char* result;\n Object* s;\n Object* p;\n\n result = READ(char*);\n\n if(result == NULL) {\n s = p = Qnil;\n } else {\n s = String::create(state, result);\n p = MemoryPointer::create(state, result);\n }\n\n Array* ary = Array::create(state, 2);\n ary->set(state, 0, s);\n ary->set(state, 1, p);\n ret = ary;\n break;\n }\n default:\n case RBX_FFI_TYPE_VOID:\n ret = Qnil;\n break;\n }\n\n return ret;\n }\n\n Object* MemoryPointer::set_at_offset(STATE, Fixnum* offset, Fixnum* type, Object* val) {\n set_field(state, offset->to_native(), type->to_native(), val);\n return val;\n }\n\n void MemoryPointer::set_field(STATE, int offset, int type, Object* val) {\n char* ptr = (char*)pointer;\n\n ptr += offset;\n\n#define WRITE(type, val) *((type*)ptr) = (type)val\n\n switch(type) {\n case RBX_FFI_TYPE_CHAR:\n type_assert(state, val, FixnumType, \"converting to char\");\n WRITE(char, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_UCHAR:\n type_assert(state, val, FixnumType, \"converting to unsigned char\");\n WRITE(unsigned char, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_SHORT:\n type_assert(state, val, FixnumType, \"converting to short\");\n WRITE(short, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_USHORT:\n type_assert(state, val, FixnumType, \"converting to unsigned short\");\n WRITE(unsigned short, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_INT:\n if(FIXNUM_P(val)) {\n WRITE(int, as<Fixnum>(val)->to_int());\n } else {\n type_assert(state, val, BignumType, \"converting to int\");\n WRITE(int, as<Bignum>(val)->to_int());\n }\n break;\n case RBX_FFI_TYPE_UINT:\n if(FIXNUM_P(val)) {\n WRITE(unsigned int, as<Fixnum>(val)->to_uint());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned int\");\n WRITE(unsigned int, as<Bignum>(val)->to_uint());\n }\n break;\n case RBX_FFI_TYPE_LONG:\n if(FIXNUM_P(val)) {\n WRITE(long, as<Fixnum>(val)->to_long());\n } else {\n type_assert(state, val, BignumType, \"converting to long\");\n WRITE(long, as<Bignum>(val)->to_long());\n }\n break;\n case RBX_FFI_TYPE_ULONG:\n if(FIXNUM_P(val)) {\n WRITE(unsigned long, as<Fixnum>(val)->to_ulong());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned long\");\n WRITE(unsigned long, as<Bignum>(val)->to_ulong());\n }\n break;\n case RBX_FFI_TYPE_FLOAT: {\n Float* flt = as<Float>(val);\n type_assert(state, val, FloatType, \"converting to float\");\n WRITE(float, flt->to_double(state));\n break;\n }\n case RBX_FFI_TYPE_DOUBLE: {\n Float* flt = as<Float>(val);\n type_assert(state, val, FloatType, \"converting to double\");\n WRITE(double, flt->to_double(state));\n break;\n }\n case RBX_FFI_TYPE_LONG_LONG:\n if(FIXNUM_P(val)) {\n WRITE(long long, as<Fixnum>(val)->to_long_long());\n } else {\n type_assert(state, val, BignumType, \"converting to long long\");\n WRITE(long long, as<Bignum>(val)->to_long_long());\n }\n break;\n case RBX_FFI_TYPE_ULONG_LONG:\n if(FIXNUM_P(val)) {\n WRITE(unsigned long long, as<Fixnum>(val)->to_ulong_long());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned long long\");\n WRITE(unsigned long long, as<Bignum>(val)->to_ulong_long());\n }\n break;\n case RBX_FFI_TYPE_OBJECT:\n WRITE(Object*, val);\n break;\n case RBX_FFI_TYPE_PTR:\n if(NIL_P(val)) {\n WRITE(void*, NULL);\n } else {\n MemoryPointer *mp = as<MemoryPointer>(val);\n type_assert(state, val, MemoryPointerType, \"converting to pointer\");\n WRITE(void*, mp->pointer);\n }\n break;\n case RBX_FFI_TYPE_STRING: {\n const char* result;\n if(NIL_P(val)) {\n result = NULL;\n } else {\n String* str = as<String>(val);\n \/* TODO this is probably not correct. Saving away an \n * internal pointer to the string means that when the string\n * moves, the data will point at the wrong place. Probably need to\n * copy the string data instead *\/\n result = str->c_str();\n }\n WRITE(const char*, result);\n break;\n }\n default:\n sassert(0);\n }\n }\n\n void MemoryPointer::Info::mark(Object* obj, ObjectMark& mark) {\n \/\/ @todo implement\n }\n}\n<commit_msg>Use proper long long conversion method<commit_after>\n#include <stdio.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <unistd.h>\n#include <sys\/stat.h>\n#include <dlfcn.h>\n#include <arpa\/inet.h>\n\n#include \"vm.hpp\"\n#include \"oop.hpp\"\n#include \"vm\/object_utils.hpp\"\n#include \"objectmemory.hpp\"\n\n#include \"builtin\/array.hpp\"\n#include \"builtin\/class.hpp\"\n#include \"builtin\/fixnum.hpp\"\n#include \"builtin\/float.hpp\"\n#include \"builtin\/memorypointer.hpp\"\n#include \"builtin\/nativefunction.hpp\"\n#include \"builtin\/string.hpp\"\n#include \"builtin\/symbol.hpp\"\n\n#include \"ffi_util.hpp\"\n#include \"arguments.hpp\"\n#include \"dispatch.hpp\"\n\nnamespace rubinius {\n\n void MemoryPointer::init(STATE) {\n Module* ffi = as<Module>(G(object)->get_const(state, \"FFI\"));\n GO(memory_pointer).set(state->new_class_under(\"MemoryPointer\", ffi));\n G(memory_pointer)->set_object_type(state, MemoryPointerType);\n }\n\n MemoryPointer* MemoryPointer::create(STATE, void* ptr) {\n MemoryPointer* obj = state->new_struct<MemoryPointer>(G(memory_pointer));\n obj->pointer = ptr;\n obj->autorelease = false;\n return obj;\n }\n\n Integer* MemoryPointer::get_address(STATE) {\n return Integer::from(state, (uintptr_t)pointer);\n }\n\n Integer* MemoryPointer::set_address(STATE, Integer* ptr) {\n pointer = (void*)ptr->to_native();\n return ptr;\n }\n\n MemoryPointer* MemoryPointer::add(STATE, Integer* amount) {\n return MemoryPointer::create(state, (char*)pointer + amount->to_native());\n }\n\n Object* MemoryPointer::set_autorelease(STATE, Object* val) {\n autorelease = val->true_p() ? true : false;\n\n return val;\n }\n\n String* MemoryPointer::read_string(STATE, Fixnum* len) {\n \/\/ HM. This is pretty dangerous. Should we figure out how to\n \/\/ protect this?\n return String::create(state, (char*)pointer, len->to_native());\n }\n\n String* MemoryPointer::read_string_to_null(STATE) {\n \/\/ Danger!\n \/\/ This operation might be too dangerous! You can read into any\n \/\/ memory using it!\n return String::create(state, (char*)pointer);\n }\n\n MemoryPointer* MemoryPointer::write_string(STATE, String* str, Fixnum* len) {\n memcpy(pointer, (void*)str->byte_address(), len->to_native());\n return this;\n }\n\n Integer* MemoryPointer::write_short(STATE, Integer* val) {\n unsigned short s = val->to_native();\n *(unsigned short*)pointer = s;\n return val;\n }\n\n Integer* MemoryPointer::read_short(STATE) {\n return Integer::from(state, *(short*)pointer);\n }\n\n Integer* MemoryPointer::write_int(STATE, Integer* val) {\n *(int*)pointer = val->to_native();\n return val;\n }\n\n Integer* MemoryPointer::read_int(STATE) {\n return Integer::from(state, *(int*)pointer);\n }\n\n Integer* MemoryPointer::write_long(STATE, Integer* val) {\n *(long*)pointer = val->to_native();\n return val;\n }\n\n Integer* MemoryPointer::read_long(STATE) {\n return Integer::from(state, *(long*)pointer);\n }\n\n Integer* MemoryPointer::write_long_long(STATE, Integer* val) {\n *(long long*)pointer = val->to_long_long();\n return val;\n }\n\n Integer* MemoryPointer::read_long_long(STATE) {\n return Integer::from(state, *(long long*)pointer);\n }\n\n Float* MemoryPointer::write_float(STATE, Float* flt) {\n *(float*)pointer = (float)flt->val;\n return flt;\n }\n\n Float* MemoryPointer::read_float(STATE) {\n return Float::create(state, (double)(*(float*)pointer));\n }\n \n Float* MemoryPointer::write_double(STATE, Float* flt) {\n *(double*)pointer = flt->val;\n return flt;\n }\n \n Float* MemoryPointer::read_double(STATE) {\n return Float::create(state, *(double*)pointer);\n }\n\n MemoryPointer* MemoryPointer::read_pointer(STATE) {\n return MemoryPointer::create(state, *(void**)pointer);\n }\n\n Object* MemoryPointer::network_order(STATE, Fixnum* offset, Fixnum* intsize) {\n native_int size = intsize->to_native();\n\n char* pos = ((char*)pointer) + offset->to_native();\n\n#define ptr_to(type) (*(type*)pos)\n\n switch(size) {\n case 2:\n ptr_to(uint16_t) = htons(ptr_to(uint16_t));\n return Integer::from(state, ptr_to(uint16_t));\n case 4:\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n return Integer::from(state, ptr_to(uint32_t));\n case 8:\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n pos += 4; \/\/ 32 bits\n ptr_to(uint32_t) = htonl(ptr_to(uint32_t));\n return Integer::from(state, *(uint64_t*)(pos - 4));\n }\n\n return Primitives::failure();\n }\n\n Object* MemoryPointer::get_at_offset(STATE, Fixnum* offset, Fixnum* type) {\n return get_field(state, offset->to_native(), type->to_native());\n }\n\n Object* MemoryPointer::get_field(STATE, int offset, int type) {\n Object* ret;\n char* ptr = (char*)pointer;\n\n ptr += offset;\n\n#define READ(type) (*((type*)(ptr)))\n\n switch(type) {\n case RBX_FFI_TYPE_CHAR:\n ret = Fixnum::from((int)(READ(char)));\n break;\n case RBX_FFI_TYPE_UCHAR:\n ret = Fixnum::from((unsigned int)(READ(unsigned char)));\n break;\n case RBX_FFI_TYPE_SHORT:\n ret = Fixnum::from((int)(READ(short)));\n break;\n case RBX_FFI_TYPE_USHORT:\n ret = Fixnum::from((unsigned int)(READ(unsigned short)));\n break;\n case RBX_FFI_TYPE_INT:\n ret = Integer::from(state, READ(int));\n break;\n case RBX_FFI_TYPE_UINT:\n ret = Integer::from(state, READ(unsigned int));\n break;\n case RBX_FFI_TYPE_LONG:\n ret = Integer::from(state, READ(long));\n break;\n case RBX_FFI_TYPE_ULONG:\n ret = Integer::from(state, READ(unsigned long));\n break;\n case RBX_FFI_TYPE_FLOAT:\n ret = Float::create(state, (double)READ(float));\n break;\n case RBX_FFI_TYPE_DOUBLE:\n ret = Float::create(state, READ(double));\n break;\n case RBX_FFI_TYPE_LONG_LONG:\n ret = Integer::from(state, READ(long long));\n break;\n case RBX_FFI_TYPE_ULONG_LONG:\n ret = Integer::from(state, READ(unsigned long long));\n break;\n case RBX_FFI_TYPE_OBJECT:\n ret = READ(Object*);\n break;\n case RBX_FFI_TYPE_PTR: {\n void *lptr = READ(void*);\n if(!lptr) {\n ret = Qnil;\n } else {\n ret = MemoryPointer::create(state, lptr);\n }\n break;\n }\n case RBX_FFI_TYPE_STRING: {\n char* result = READ(char*);\n if(result == NULL) {\n ret = Qnil;\n } else {\n ret = String::create(state, result);\n }\n break;\n }\n case RBX_FFI_TYPE_STRPTR: {\n char* result;\n Object* s;\n Object* p;\n\n result = READ(char*);\n\n if(result == NULL) {\n s = p = Qnil;\n } else {\n s = String::create(state, result);\n p = MemoryPointer::create(state, result);\n }\n\n Array* ary = Array::create(state, 2);\n ary->set(state, 0, s);\n ary->set(state, 1, p);\n ret = ary;\n break;\n }\n default:\n case RBX_FFI_TYPE_VOID:\n ret = Qnil;\n break;\n }\n\n return ret;\n }\n\n Object* MemoryPointer::set_at_offset(STATE, Fixnum* offset, Fixnum* type, Object* val) {\n set_field(state, offset->to_native(), type->to_native(), val);\n return val;\n }\n\n void MemoryPointer::set_field(STATE, int offset, int type, Object* val) {\n char* ptr = (char*)pointer;\n\n ptr += offset;\n\n#define WRITE(type, val) *((type*)ptr) = (type)val\n\n switch(type) {\n case RBX_FFI_TYPE_CHAR:\n type_assert(state, val, FixnumType, \"converting to char\");\n WRITE(char, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_UCHAR:\n type_assert(state, val, FixnumType, \"converting to unsigned char\");\n WRITE(unsigned char, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_SHORT:\n type_assert(state, val, FixnumType, \"converting to short\");\n WRITE(short, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_USHORT:\n type_assert(state, val, FixnumType, \"converting to unsigned short\");\n WRITE(unsigned short, as<Fixnum>(val)->to_native());\n break;\n case RBX_FFI_TYPE_INT:\n if(FIXNUM_P(val)) {\n WRITE(int, as<Fixnum>(val)->to_int());\n } else {\n type_assert(state, val, BignumType, \"converting to int\");\n WRITE(int, as<Bignum>(val)->to_int());\n }\n break;\n case RBX_FFI_TYPE_UINT:\n if(FIXNUM_P(val)) {\n WRITE(unsigned int, as<Fixnum>(val)->to_uint());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned int\");\n WRITE(unsigned int, as<Bignum>(val)->to_uint());\n }\n break;\n case RBX_FFI_TYPE_LONG:\n if(FIXNUM_P(val)) {\n WRITE(long, as<Fixnum>(val)->to_long());\n } else {\n type_assert(state, val, BignumType, \"converting to long\");\n WRITE(long, as<Bignum>(val)->to_long());\n }\n break;\n case RBX_FFI_TYPE_ULONG:\n if(FIXNUM_P(val)) {\n WRITE(unsigned long, as<Fixnum>(val)->to_ulong());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned long\");\n WRITE(unsigned long, as<Bignum>(val)->to_ulong());\n }\n break;\n case RBX_FFI_TYPE_FLOAT: {\n Float* flt = as<Float>(val);\n type_assert(state, val, FloatType, \"converting to float\");\n WRITE(float, flt->to_double(state));\n break;\n }\n case RBX_FFI_TYPE_DOUBLE: {\n Float* flt = as<Float>(val);\n type_assert(state, val, FloatType, \"converting to double\");\n WRITE(double, flt->to_double(state));\n break;\n }\n case RBX_FFI_TYPE_LONG_LONG:\n if(FIXNUM_P(val)) {\n WRITE(long long, as<Fixnum>(val)->to_long_long());\n } else {\n type_assert(state, val, BignumType, \"converting to long long\");\n WRITE(long long, as<Bignum>(val)->to_long_long());\n }\n break;\n case RBX_FFI_TYPE_ULONG_LONG:\n if(FIXNUM_P(val)) {\n WRITE(unsigned long long, as<Fixnum>(val)->to_ulong_long());\n } else {\n type_assert(state, val, BignumType, \"converting to unsigned long long\");\n WRITE(unsigned long long, as<Bignum>(val)->to_ulong_long());\n }\n break;\n case RBX_FFI_TYPE_OBJECT:\n WRITE(Object*, val);\n break;\n case RBX_FFI_TYPE_PTR:\n if(NIL_P(val)) {\n WRITE(void*, NULL);\n } else {\n MemoryPointer *mp = as<MemoryPointer>(val);\n type_assert(state, val, MemoryPointerType, \"converting to pointer\");\n WRITE(void*, mp->pointer);\n }\n break;\n case RBX_FFI_TYPE_STRING: {\n const char* result;\n if(NIL_P(val)) {\n result = NULL;\n } else {\n String* str = as<String>(val);\n \/* TODO this is probably not correct. Saving away an \n * internal pointer to the string means that when the string\n * moves, the data will point at the wrong place. Probably need to\n * copy the string data instead *\/\n result = str->c_str();\n }\n WRITE(const char*, result);\n break;\n }\n default:\n sassert(0);\n }\n }\n\n void MemoryPointer::Info::mark(Object* obj, ObjectMark& mark) {\n \/\/ @todo implement\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\brief DynamicThreadParameters class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\date 2015-11-14\n *\/\n\n#ifndef INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n#define INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n\n#include \"distortos\/SchedulingPolicy.hpp\"\n\n#include <cstddef>\n\nnamespace distortos\n{\n\n\/**\n * \\brief DynamicThreadParameters struct is a helper with parameters for DynamicThread's constructor\n *\n * This struct is a replacement for overloads of DynamicThread's constructor and makeDynamicThread() which -\n * unfortunately - cannot be used, as they would lead to compilation errors due to ambiguity.\n *\/\n\nstruct DynamicThreadParameters\n{\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] canReceiveSignalss selects whether reception of signals is enabled (true) or disabled (false) for\n\t * this thread\n\t * \\param [in] queuedSignalss is the max number of queued signals for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable queuing of signals for this thread\n\t * \\param [in] signalActionss is the max number of different SignalAction objects for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable catching of signals for this thread\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t * \\param [in] schedulingPolicyy is the scheduling policy of the thread\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const bool canReceiveSignalss,\n\t\t\tconst size_t queuedSignalss, const size_t signalActionss, const uint8_t priorityy,\n\t\t\tconst SchedulingPolicy schedulingPolicyy) :\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{canReceiveSignalss},\n\t\t\tqueuedSignals{queuedSignalss},\n\t\t\tsignalActions{signalActionss},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{schedulingPolicyy}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] canReceiveSignalss selects whether reception of signals is enabled (true) or disabled (false) for\n\t * this thread\n\t * \\param [in] queuedSignalss is the max number of queued signals for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable queuing of signals for this thread\n\t * \\param [in] signalActionss is the max number of different SignalAction objects for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable catching of signals for this thread\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const bool canReceiveSignalss,\n\t\t\tconst size_t queuedSignalss, const size_t signalActionss, const uint8_t priorityy) :\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{canReceiveSignalss},\n\t\t\tqueuedSignals{queuedSignalss},\n\t\t\tsignalActions{signalActionss},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{SchedulingPolicy::RoundRobin}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t * \\param [in] schedulingPolicyy is the scheduling policy of the thread\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const uint8_t priorityy,\n\t\t\tconst SchedulingPolicy schedulingPolicyy) :\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{},\n\t\t\tqueuedSignals{},\n\t\t\tsignalActions{},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{schedulingPolicyy}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const uint8_t priorityy) :\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{},\n\t\t\tqueuedSignals{},\n\t\t\tsignalActions{},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{SchedulingPolicy::RoundRobin}\n\t{\n\n\t}\n\n\t\/\/\/ size of stack, bytes\n\tconst size_t stackSize;\n\n\t\/\/\/ selects whether reception of signals is enabled (true) or disabled (false) for this thread\n\tconst bool canReceiveSignals;\n\n\t\/\/\/ max number of queued signals for this thread, relevant only if \\a canReceiveSignals == true, 0 to disable\n\t\/\/\/ queuing of signals for this thread\n\tconst size_t queuedSignals;\n\n\t\/\/\/ max number of different SignalAction objects for this thread, relevant only if \\a canReceiveSignals == true, 0\n\t\/\/\/ to disable catching of signals for this thread\n\tconst size_t signalActions;\n\n\t\/\/\/ thread's priority, 0 - lowest, UINT8_MAX - highest\n\tconst uint8_t priority;\n\n\t\/\/\/ scheduling policy of the thread\n\tSchedulingPolicy schedulingPolicy;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n<commit_msg>DynamicThreadParameters: reorder member variables<commit_after>\/**\n * \\file\n * \\brief DynamicThreadParameters class header\n *\n * \\author Copyright (C) 2015 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\n * \\date 2015-11-14\n *\/\n\n#ifndef INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n#define INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n\n#include \"distortos\/SchedulingPolicy.hpp\"\n\n#include <cstddef>\n\nnamespace distortos\n{\n\n\/**\n * \\brief DynamicThreadParameters struct is a helper with parameters for DynamicThread's constructor\n *\n * This struct is a replacement for overloads of DynamicThread's constructor and makeDynamicThread() which -\n * unfortunately - cannot be used, as they would lead to compilation errors due to ambiguity.\n *\/\n\nstruct DynamicThreadParameters\n{\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] canReceiveSignalss selects whether reception of signals is enabled (true) or disabled (false) for\n\t * this thread\n\t * \\param [in] queuedSignalss is the max number of queued signals for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable queuing of signals for this thread\n\t * \\param [in] signalActionss is the max number of different SignalAction objects for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable catching of signals for this thread\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t * \\param [in] schedulingPolicyy is the scheduling policy of the thread\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const bool canReceiveSignalss,\n\t\t\tconst size_t queuedSignalss, const size_t signalActionss, const uint8_t priorityy,\n\t\t\tconst SchedulingPolicy schedulingPolicyy) :\n\t\t\tqueuedSignals{queuedSignalss},\n\t\t\tsignalActions{signalActionss},\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{canReceiveSignalss},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{schedulingPolicyy}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] canReceiveSignalss selects whether reception of signals is enabled (true) or disabled (false) for\n\t * this thread\n\t * \\param [in] queuedSignalss is the max number of queued signals for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable queuing of signals for this thread\n\t * \\param [in] signalActionss is the max number of different SignalAction objects for this thread, relevant only if\n\t * \\a canReceiveSignals == true, 0 to disable catching of signals for this thread\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const bool canReceiveSignalss,\n\t\t\tconst size_t queuedSignalss, const size_t signalActionss, const uint8_t priorityy) :\n\t\t\tqueuedSignals{queuedSignalss},\n\t\t\tsignalActions{signalActionss},\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{canReceiveSignalss},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{SchedulingPolicy::RoundRobin}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t * \\param [in] schedulingPolicyy is the scheduling policy of the thread\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const uint8_t priorityy,\n\t\t\tconst SchedulingPolicy schedulingPolicyy) :\n\t\t\tqueuedSignals{},\n\t\t\tsignalActions{},\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{schedulingPolicyy}\n\t{\n\n\t}\n\n\t\/**\n\t * \\brief DynamicThreadParameters's constructor\n\t *\n\t * \\param [in] stackSizee is the size of stack, bytes\n\t * \\param [in] priorityy is the thread's priority, 0 - lowest, UINT8_MAX - highest\n\t *\/\n\n\tconstexpr DynamicThreadParameters(const size_t stackSizee, const uint8_t priorityy) :\n\t\t\tqueuedSignals{},\n\t\t\tsignalActions{},\n\t\t\tstackSize{stackSizee},\n\t\t\tcanReceiveSignals{},\n\t\t\tpriority{priorityy},\n\t\t\tschedulingPolicy{SchedulingPolicy::RoundRobin}\n\t{\n\n\t}\n\n\t\/\/\/ max number of queued signals for this thread, relevant only if \\a canReceiveSignals == true, 0 to disable\n\t\/\/\/ queuing of signals for this thread\n\tsize_t queuedSignals;\n\n\t\/\/\/ max number of different SignalAction objects for this thread, relevant only if \\a canReceiveSignals == true, 0\n\t\/\/\/ to disable catching of signals for this thread\n\tsize_t signalActions;\n\n\t\/\/\/ size of stack, bytes\n\tsize_t stackSize;\n\n\t\/\/\/ selects whether reception of signals is enabled (true) or disabled (false) for this thread\n\tbool canReceiveSignals;\n\n\t\/\/\/ thread's priority, 0 - lowest, UINT8_MAX - highest\n\tuint8_t priority;\n\n\t\/\/\/ scheduling policy of the thread\n\tSchedulingPolicy schedulingPolicy;\n};\n\n}\t\/\/ namespace distortos\n\n#endif\t\/\/ INCLUDE_DISTORTOS_DYNAMICTHREADPARAMETERS_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 The Flutter Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"impeller\/entity\/contents\/tiled_texture_contents.h\"\n\n#include \"impeller\/entity\/contents\/clip_contents.h\"\n#include \"impeller\/entity\/contents\/content_context.h\"\n#include \"impeller\/entity\/geometry.h\"\n#include \"impeller\/entity\/tiled_texture_fill.frag.h\"\n#include \"impeller\/entity\/tiled_texture_fill.vert.h\"\n#include \"impeller\/geometry\/path_builder.h\"\n#include \"impeller\/renderer\/render_pass.h\"\n#include \"impeller\/renderer\/sampler_library.h\"\n\nnamespace impeller {\n\nTiledTextureContents::TiledTextureContents() = default;\n\nTiledTextureContents::~TiledTextureContents() = default;\n\nvoid TiledTextureContents::SetTexture(std::shared_ptr<Texture> texture) {\n texture_ = std::move(texture);\n}\n\nvoid TiledTextureContents::SetTileModes(Entity::TileMode x_tile_mode,\n Entity::TileMode y_tile_mode) {\n x_tile_mode_ = x_tile_mode;\n y_tile_mode_ = y_tile_mode;\n}\n\nvoid TiledTextureContents::SetSamplerDescriptor(SamplerDescriptor desc) {\n sampler_descriptor_ = std::move(desc);\n}\n\nbool TiledTextureContents::Render(const ContentContext& renderer,\n const Entity& entity,\n RenderPass& pass) const {\n if (texture_ == nullptr) {\n return true;\n }\n\n using VS = TiledTextureFillVertexShader;\n using FS = TiledTextureFillFragmentShader;\n\n const auto texture_size = texture_->GetSize();\n if (texture_size.IsEmpty()) {\n return true;\n }\n\n auto& host_buffer = pass.GetTransientsBuffer();\n\n VS::VertInfo vert_info;\n vert_info.mvp = Matrix::MakeOrthographic(pass.GetRenderTargetSize()) *\n entity.GetTransformation();\n vert_info.matrix = GetInverseMatrix();\n vert_info.texture_size = Vector2{static_cast<Scalar>(texture_size.width),\n static_cast<Scalar>(texture_size.height)};\n\n FS::FragInfo frag_info;\n frag_info.texture_sampler_y_coord_scale = texture_->GetYCoordScale();\n frag_info.x_tile_mode = static_cast<Scalar>(x_tile_mode_);\n frag_info.y_tile_mode = static_cast<Scalar>(y_tile_mode_);\n frag_info.alpha = GetAlpha();\n\n Command cmd;\n cmd.label = \"TiledTextureFill\";\n cmd.pipeline =\n renderer.GetTiledTexturePipeline(OptionsFromPassAndEntity(pass, entity));\n cmd.stencil_reference = entity.GetStencilDepth();\n\n auto geometry_result =\n GetGeometry()->GetPositionBuffer(renderer, entity, pass);\n\n auto options = OptionsFromPassAndEntity(pass, entity);\n if (geometry_result.prevent_overdraw) {\n options.stencil_compare = CompareFunction::kEqual;\n options.stencil_operation = StencilOperation::kIncrementClamp;\n }\n options.primitive_type = geometry_result.type;\n cmd.pipeline = renderer.GetTiledTexturePipeline(options);\n\n cmd.BindVertices(geometry_result.vertex_buffer);\n VS::BindVertInfo(cmd, host_buffer.EmplaceUniform(vert_info));\n FS::BindFragInfo(cmd, host_buffer.EmplaceUniform(frag_info));\n FS::BindTextureSampler(cmd, texture_,\n renderer.GetContext()->GetSamplerLibrary()->GetSampler(\n sampler_descriptor_));\n\n if (!pass.AddCommand(std::move(cmd))) {\n return false;\n }\n\n if (geometry_result.prevent_overdraw) {\n return ClipRestoreContents().Render(renderer, entity, pass);\n }\n return true;\n}\n\n} \/\/ namespace impeller\n<commit_msg>[Impeller] Remove duplicate code in 'TiledTextureContents' (#37492)<commit_after>\/\/ Copyright 2013 The Flutter Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"impeller\/entity\/contents\/tiled_texture_contents.h\"\n\n#include \"impeller\/entity\/contents\/clip_contents.h\"\n#include \"impeller\/entity\/contents\/content_context.h\"\n#include \"impeller\/entity\/geometry.h\"\n#include \"impeller\/entity\/tiled_texture_fill.frag.h\"\n#include \"impeller\/entity\/tiled_texture_fill.vert.h\"\n#include \"impeller\/geometry\/path_builder.h\"\n#include \"impeller\/renderer\/render_pass.h\"\n#include \"impeller\/renderer\/sampler_library.h\"\n\nnamespace impeller {\n\nTiledTextureContents::TiledTextureContents() = default;\n\nTiledTextureContents::~TiledTextureContents() = default;\n\nvoid TiledTextureContents::SetTexture(std::shared_ptr<Texture> texture) {\n texture_ = std::move(texture);\n}\n\nvoid TiledTextureContents::SetTileModes(Entity::TileMode x_tile_mode,\n Entity::TileMode y_tile_mode) {\n x_tile_mode_ = x_tile_mode;\n y_tile_mode_ = y_tile_mode;\n}\n\nvoid TiledTextureContents::SetSamplerDescriptor(SamplerDescriptor desc) {\n sampler_descriptor_ = std::move(desc);\n}\n\nbool TiledTextureContents::Render(const ContentContext& renderer,\n const Entity& entity,\n RenderPass& pass) const {\n if (texture_ == nullptr) {\n return true;\n }\n\n using VS = TiledTextureFillVertexShader;\n using FS = TiledTextureFillFragmentShader;\n\n const auto texture_size = texture_->GetSize();\n if (texture_size.IsEmpty()) {\n return true;\n }\n\n auto& host_buffer = pass.GetTransientsBuffer();\n\n VS::VertInfo vert_info;\n vert_info.mvp = Matrix::MakeOrthographic(pass.GetRenderTargetSize()) *\n entity.GetTransformation();\n vert_info.matrix = GetInverseMatrix();\n vert_info.texture_size = Vector2{static_cast<Scalar>(texture_size.width),\n static_cast<Scalar>(texture_size.height)};\n\n FS::FragInfo frag_info;\n frag_info.texture_sampler_y_coord_scale = texture_->GetYCoordScale();\n frag_info.x_tile_mode = static_cast<Scalar>(x_tile_mode_);\n frag_info.y_tile_mode = static_cast<Scalar>(y_tile_mode_);\n frag_info.alpha = GetAlpha();\n\n Command cmd;\n cmd.label = \"TiledTextureFill\";\n cmd.stencil_reference = entity.GetStencilDepth();\n\n auto geometry_result =\n GetGeometry()->GetPositionBuffer(renderer, entity, pass);\n\n auto options = OptionsFromPassAndEntity(pass, entity);\n if (geometry_result.prevent_overdraw) {\n options.stencil_compare = CompareFunction::kEqual;\n options.stencil_operation = StencilOperation::kIncrementClamp;\n }\n options.primitive_type = geometry_result.type;\n cmd.pipeline = renderer.GetTiledTexturePipeline(options);\n\n cmd.BindVertices(geometry_result.vertex_buffer);\n VS::BindVertInfo(cmd, host_buffer.EmplaceUniform(vert_info));\n FS::BindFragInfo(cmd, host_buffer.EmplaceUniform(frag_info));\n FS::BindTextureSampler(cmd, texture_,\n renderer.GetContext()->GetSamplerLibrary()->GetSampler(\n sampler_descriptor_));\n\n if (!pass.AddCommand(std::move(cmd))) {\n return false;\n }\n\n if (geometry_result.prevent_overdraw) {\n return ClipRestoreContents().Render(renderer, entity, pass);\n }\n return true;\n}\n\n} \/\/ namespace impeller\n<|endoftext|>"} {"text":"<commit_before>\/*\n This file is part of KMail.\n Copyright (c) 2003 Andreas Gungl <a.gungl@gmx.de>\n\n KMail is free software; you can redistribute it and\/or modify it\n under the terms of the GNU General Public License, version 2, as\n published by the Free Software Foundation.\n\n KMail is distributed in the hope that it will be useful, but\n WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"filterlog.h\"\n\n#include <kdebug.h>\n\n#include <qdatetime.h>\n#include <qfile.h>\n\n#include <sys\/stat.h>\n\n\nusing namespace KMail;\n\n\nFilterLog * FilterLog::mSelf = NULL;\n\n\nFilterLog::FilterLog()\n{ \n mSelf = this;\n \/\/ start with logging disabled by default\n mLogging = false;\n \/\/ better limit the log to 512 KByte to avoid out of memory situations\n \/\/ when the log i sgoing to become very long\n mMaxLogSize = 512 * 1024;\n mCurrentLogSize = 0;\n mAllowedTypes = meta | patternDesc | ruleResult | \n patternResult | appliedAction;\n}\n\n\nFilterLog::~FilterLog()\n{}\n\n\nFilterLog * FilterLog::instance()\n{\n if ( !mSelf ) mSelf = new FilterLog();\n return mSelf;\n}\n\n\nvoid FilterLog::add( QString logEntry, ContentType contentType )\n{\n if ( isLogging() && ( mAllowedTypes & contentType ) )\n {\n QString timedLog = \"[\" + QTime::currentTime().toString() + \"] \";\n if ( contentType & ~meta )\n timedLog += logEntry;\n else\n timedLog = logEntry;\n mLogEntries.append( timedLog );\n emit logEntryAdded( timedLog );\n mCurrentLogSize += timedLog.length();\n checkLogSize();\n }\n}\n\n\nvoid FilterLog::setMaxLogSize( long size ) \n{\n if ( size < -1)\n size = -1;\n \/\/ do not allow less than 1 KByte except unlimited (-1)\n if ( size >= 0 && size < 1024 )\n size = 1024; \n mMaxLogSize = size; \n emit logStateChanged();\n checkLogSize(); \n}\n\n \nvoid FilterLog::dump()\n{\n#ifndef NDEBUG\n kdDebug(5006) << \"----- starting filter log -----\" << endl;\n for ( QStringList::Iterator it = mLogEntries.begin();\n it != mLogEntries.end(); ++it )\n {\n kdDebug(5006) << *it << endl;\n }\n kdDebug(5006) << \"------ end of filter log ------\" << endl;\n#endif\n}\n\n\nvoid FilterLog::checkLogSize()\n{\n if ( mCurrentLogSize > mMaxLogSize && mMaxLogSize > -1 )\n {\n kdDebug(5006) << \"Filter log: memory limit reached, starting to discard old items, size = \"\n << QString::number( mCurrentLogSize ) << endl;\n \/\/ avoid some kind of hysteresis, shrink the log to 90% of its maximum\n while ( mCurrentLogSize > ( mMaxLogSize * 0.9 ) )\n {\n QValueListIterator<QString> it = mLogEntries.begin();\n if ( it != mLogEntries.end())\n {\n mCurrentLogSize -= (*it).length();\n mLogEntries.remove( it );\n kdDebug(5006) << \"Filter log: new size = \" \n << QString::number( mCurrentLogSize ) << endl;\n }\n else\n {\n kdDebug(5006) << \"Filter log: size reduction disaster!\" << endl;\n clear();\n }\n }\n emit logShrinked();\n }\n}\n\n\nbool FilterLog::saveToFile( QString fileName )\n{\n QFile file( fileName );\n if( file.open( IO_WriteOnly ) ) {\n fchmod( file.handle(), S_IRUSR | S_IWUSR );\n {\n QDataStream ds( &file );\n for ( QStringList::Iterator it = mLogEntries.begin(); \n it != mLogEntries.end(); ++it ) \n {\n QString tmpString = *it + '\\n';\n QCString cstr( tmpString.local8Bit() );\n ds.writeRawBytes( cstr, cstr.size() );\n }\n }\n return true;\n } \n else\n return false;\n}\n\n\nQString & FilterLog::recode( QString s )\n{\n return s.replace( \"<\", \"<\" ).replace( \">\", \">\" );\n}\n\n\n#include \"filterlog.moc\"\n<commit_msg>micro-optimization<commit_after>\/*\n This file is part of KMail.\n Copyright (c) 2003 Andreas Gungl <a.gungl@gmx.de>\n\n KMail is free software; you can redistribute it and\/or modify it\n under the terms of the GNU General Public License, version 2, as\n published by the Free Software Foundation.\n\n KMail is distributed in the hope that it will be useful, but\n WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA\n\n In addition, as a special exception, the copyright holders give\n permission to link the code of this program with any edition of\n the Qt library by Trolltech AS, Norway (or with modified versions\n of Qt that use the same license as Qt), and distribute linked\n combinations including the two. You must obey the GNU General\n Public License in all respects for all of the code used other than\n Qt. If you modify this file, you may extend this exception to\n your version of the file, but you are not obligated to do so. If\n you do not wish to do so, delete this exception statement from\n your version.\n*\/\n\n#include \"filterlog.h\"\n\n#include <kdebug.h>\n\n#include <qdatetime.h>\n#include <qfile.h>\n\n#include <sys\/stat.h>\n\n\nusing namespace KMail;\n\n\nFilterLog * FilterLog::mSelf = NULL;\n\n\nFilterLog::FilterLog()\n{ \n mSelf = this;\n \/\/ start with logging disabled by default\n mLogging = false;\n \/\/ better limit the log to 512 KByte to avoid out of memory situations\n \/\/ when the log i sgoing to become very long\n mMaxLogSize = 512 * 1024;\n mCurrentLogSize = 0;\n mAllowedTypes = meta | patternDesc | ruleResult | \n patternResult | appliedAction;\n}\n\n\nFilterLog::~FilterLog()\n{}\n\n\nFilterLog * FilterLog::instance()\n{\n if ( !mSelf ) mSelf = new FilterLog();\n return mSelf;\n}\n\n\nvoid FilterLog::add( QString logEntry, ContentType contentType )\n{\n if ( isLogging() && ( mAllowedTypes & contentType ) )\n {\n QString timedLog = \"[\" + QTime::currentTime().toString() + \"] \";\n if ( contentType & ~meta )\n timedLog += logEntry;\n else\n timedLog = logEntry;\n mLogEntries.append( timedLog );\n emit logEntryAdded( timedLog );\n mCurrentLogSize += timedLog.length();\n checkLogSize();\n }\n}\n\n\nvoid FilterLog::setMaxLogSize( long size ) \n{\n if ( size < -1)\n size = -1;\n \/\/ do not allow less than 1 KByte except unlimited (-1)\n if ( size >= 0 && size < 1024 )\n size = 1024; \n mMaxLogSize = size; \n emit logStateChanged();\n checkLogSize(); \n}\n\n \nvoid FilterLog::dump()\n{\n#ifndef NDEBUG\n kdDebug(5006) << \"----- starting filter log -----\" << endl;\n for ( QStringList::Iterator it = mLogEntries.begin();\n it != mLogEntries.end(); ++it )\n {\n kdDebug(5006) << *it << endl;\n }\n kdDebug(5006) << \"------ end of filter log ------\" << endl;\n#endif\n}\n\n\nvoid FilterLog::checkLogSize()\n{\n if ( mCurrentLogSize > mMaxLogSize && mMaxLogSize > -1 )\n {\n kdDebug(5006) << \"Filter log: memory limit reached, starting to discard old items, size = \"\n << QString::number( mCurrentLogSize ) << endl;\n \/\/ avoid some kind of hysteresis, shrink the log to 90% of its maximum\n while ( mCurrentLogSize > ( mMaxLogSize * 0.9 ) )\n {\n QValueListIterator<QString> it = mLogEntries.begin();\n if ( it != mLogEntries.end())\n {\n mCurrentLogSize -= (*it).length();\n mLogEntries.remove( it );\n kdDebug(5006) << \"Filter log: new size = \" \n << QString::number( mCurrentLogSize ) << endl;\n }\n else\n {\n kdDebug(5006) << \"Filter log: size reduction disaster!\" << endl;\n clear();\n }\n }\n emit logShrinked();\n }\n}\n\n\nbool FilterLog::saveToFile( QString fileName )\n{\n QFile file( fileName );\n if( file.open( IO_WriteOnly ) ) {\n fchmod( file.handle(), S_IRUSR | S_IWUSR );\n {\n QDataStream ds( &file );\n for ( QStringList::Iterator it = mLogEntries.begin(); \n it != mLogEntries.end(); ++it ) \n {\n QString tmpString = *it + '\\n';\n QCString cstr( tmpString.local8Bit() );\n ds.writeRawBytes( cstr, cstr.size() );\n }\n }\n return true;\n } \n else\n return false;\n}\n\n\nQString & FilterLog::recode( QString s )\n{\n return s.replace( \"<\", QString::fromLatin1(\"<\") )\n\t .replace( \">\", QString::fromLatin1(\">\") );\n}\n\n\n#include \"filterlog.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/\/ KMail Account\n#include <config.h>\n\n#include \"kmaccount.h\"\n\n#include \"accountmanager.h\"\nusing KMail::AccountManager;\n#include \"kmacctfolder.h\"\n#include \"kmfoldermgr.h\"\n#include \"kmfiltermgr.h\"\n#include \"messagesender.h\"\n#include \"kmmessage.h\"\n#include \"broadcaststatus.h\"\nusing KPIM::BroadcastStatus;\n#include \"kmfoldercachedimap.h\"\n\n#include \"progressmanager.h\"\nusing KPIM::ProgressItem;\nusing KPIM::ProgressManager;\n\nusing KMail::FolderJob;\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <kconfig.h>\n\n#include <QList>\n#include <QEventLoop>\n\/\/Added by qt3to4:\n#include <Q3CString>\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include <assert.h>\n\n\/\/----------------------\n#include \"kmaccount.moc\"\n\n\/\/-----------------------------------------------------------------------------\nKMPrecommand::KMPrecommand(const QString &precommand, QObject *parent)\n : QObject(parent), mPrecommand(precommand)\n{\n BroadcastStatus::instance()->setStatusMsg(\n i18n(\"Executing precommand %1\", precommand ));\n\n mPrecommandProcess.setUseShell(true);\n mPrecommandProcess << precommand;\n\n connect(&mPrecommandProcess, SIGNAL(processExited(KProcess *)),\n SLOT(precommandExited(KProcess *)));\n}\n\n\/\/-----------------------------------------------------------------------------\nKMPrecommand::~KMPrecommand()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool KMPrecommand::start()\n{\n bool ok = mPrecommandProcess.start( KProcess::NotifyOnExit );\n if (!ok) KMessageBox::error(0, i18n(\"Could not execute precommand '%1'.\",\n mPrecommand));\n return ok;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMPrecommand::precommandExited(KProcess *p)\n{\n int exitCode = p->normalExit() ? p->exitStatus() : -1;\n if (exitCode)\n KMessageBox::error(0, i18n(\"The precommand exited with code %1:\\n%2\",\n exitCode, strerror(exitCode)));\n emit finished(!exitCode);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nKMAccount::KMAccount(AccountManager* aOwner, const QString& aName, uint id)\n : KAccount( id, aName ),\n mTrash(KMKernel::self()->trashFolder()->idString()),\n mOwner(aOwner),\n mFolder(0),\n mTimer(0),\n mInterval(0),\n mExclude(false),\n mCheckingMail(false),\n mPrecommandSuccess(true),\n mHasInbox(false),\n mMailCheckProgressItem(0)\n{\n assert(aOwner != 0);\n}\n\nvoid KMAccount::init() {\n mTrash = kmkernel->trashFolder()->idString();\n mExclude = false;\n mInterval = 0;\n mNewInFolder.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nKMAccount::~KMAccount()\n{\n if (!kmkernel->shuttingDown() && mFolder) mFolder->removeAccount(this);\n if (mTimer) deinstallTimer();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setName(const QString& aName)\n{\n mName = aName;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::clearPasswd()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setFolder(KMFolder* aFolder, bool addAccount)\n{\n if(!aFolder) {\n \/\/kDebug(5006) << \"KMAccount::setFolder() : aFolder == 0\" << endl;\n mFolder = 0;\n return;\n }\n mFolder = (KMAcctFolder*)aFolder;\n if (addAccount) mFolder->addAccount(this);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::readConfig(KConfig& config)\n{\n QString folderName;\n mFolder = 0;\n folderName = config.readEntry(\"Folder\");\n setCheckInterval(config.readEntry(\"check-interval\", 0 ) );\n setTrash(config.readEntry(\"trash\", kmkernel->trashFolder()->idString()));\n setCheckExclude(config.readEntry(\"check-exclude\", false ) );\n setPrecommand(config.readPathEntry(\"precommand\"));\n\n if (!folderName.isEmpty())\n {\n setFolder(kmkernel->folderMgr()->findIdString(folderName), true);\n }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::writeConfig(KConfig& config)\n{\n \/\/ ID, Name\n KAccount::writeConfig(config);\n\n config.writeEntry(\"Type\", type());\n config.writeEntry(\"Folder\", mFolder ? mFolder->idString() : QString());\n config.writeEntry(\"check-interval\", mInterval);\n config.writeEntry(\"check-exclude\", mExclude);\n config.writePathEntry(\"precommand\", mPrecommand);\n config.writeEntry(\"trash\", mTrash);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::sendReceipt(KMMessage* aMsg)\n{\n bool sendReceipts;\n\n KConfigGroup cfg( KMKernel::config(), \"General\" );\n\n sendReceipts = cfg.readEntry(\"send-receipts\", false );\n if (!sendReceipts) return;\n\n KMMessage *newMsg = aMsg->createDeliveryReceipt();\n if (newMsg) {\n mReceipts.append(newMsg);\n QTimer::singleShot( 0, this, SLOT( sendReceipts() ) );\n }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool KMAccount::processNewMsg(KMMessage* aMsg)\n{\n int rc, processResult;\n\n assert(aMsg != 0);\n\n \/\/ Save this one for readding\n KMFolderCachedImap* parent = 0;\n if( type() == \"cachedimap\" )\n parent = static_cast<KMFolderCachedImap*>( aMsg->storage() );\n\n \/\/ checks whether we should send delivery receipts\n \/\/ and sends them.\n sendReceipt(aMsg);\n\n \/\/ Set status of new messages that are marked as old to read, otherwise\n \/\/ the user won't see which messages newly arrived.\n \/\/ This is only valid for pop accounts and produces wrong stati for imap.\n if ( type() != \"cachedimap\" && type() != \"imap\" ) {\n if ( aMsg->status().isOld() )\n aMsg->setStatus( MessageStatus::statusUnread() ); \/\/ -sanders\n \/\/ aMsg->setStatus( MessageStatus::statusRead() );\n else\n aMsg->setStatus( MessageStatus::statusNew() );\n }\n\/*\nQFile fileD0( \"testdat_xx-kmaccount-0\" );\nif( fileD0.open( QIODevice::WriteOnly ) ) {\n QDataStream ds( &fileD0 );\n ds.writeRawData( aMsg->asString(), aMsg->asString().length() );\n fileD0.close(); \/\/ If data is 0 we just create a zero length file.\n}\n*\/\n \/\/ 0==message moved; 1==processing ok, no move; 2==critical error, abort!\n\n processResult = kmkernel->filterMgr()->process(aMsg,KMFilterMgr::Inbound,true,id());\n if (processResult == 2) {\n perror(\"Critical error: Unable to collect mail (out of space?)\");\n KMessageBox::information(0,(i18n(\"Critical error: \"\n \"Unable to collect mail: \")) + QString::fromLocal8Bit(strerror(errno)));\n return false;\n }\n else if (processResult == 1)\n {\n if( type() == \"cachedimap\" )\n ; \/\/ already done by caller: parent->addMsgInternal( aMsg, false );\n else {\n \/\/ TODO: Perhaps it would be best, if this if was handled by a virtual\n \/\/ method, so the if( !dimap ) above could die?\n kmkernel->filterMgr()->tempOpenFolder(mFolder);\n rc = mFolder->addMsg(aMsg);\n\/*\nQFile fileD0( \"testdat_xx-kmaccount-1\" );\nif( fileD0.open( QIODevice::WriteOnly ) ) {\n QDataStream ds( &fileD0 );\n ds.writeRawData( aMsg->asString(), aMsg->asString().length() );\n fileD0.close(); \/\/ If data is 0 we just create a zero length file.\n}\n*\/\n if (rc) {\n perror(\"failed to add message\");\n KMessageBox::information(0, i18n(\"Failed to add message:\\n\") +\n QString(strerror(rc)));\n return false;\n }\n int count = mFolder->count();\n \/\/ If count == 1, the message is immediately displayed\n if (count != 1) mFolder->unGetMsg(count - 1);\n }\n }\n\n \/\/ Count number of new messages for each folder\n QString folderId;\n if ( processResult == 1 ) {\n folderId = ( type() == \"cachedimap\" ) ? parent->folder()->idString()\n : mFolder->idString();\n }\n else {\n folderId = aMsg->parent()->idString();\n }\n addToNewInFolder( folderId, 1 );\n\n return true; \/\/Everything's fine - message has been added by filter }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setCheckInterval(int aInterval)\n{\n if (aInterval <= 0)\n {\n mInterval = 0;\n deinstallTimer();\n }\n else\n {\n mInterval = aInterval;\n installTimer();\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid KMAccount::deleteFolderJobs()\n{\n qDeleteAll( mJobList );\n mJobList.clear();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid KMAccount::ignoreJobsForMessage( KMMessage* msg )\n{\n \/\/FIXME: remove, make folders handle those\n QList<FolderJob*>::iterator it;\n for( it = mJobList.begin(); it != mJobList.end(); ++it ) {\n if ( (*it)->msgList().first() == msg) {\n FolderJob *job = (*it);\n it = mJobList.erase( it );\n delete job;\n break;\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setCheckExclude(bool aExclude)\n{\n mExclude = aExclude;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::installTimer()\n{\n if (mInterval <= 0) return;\n if(!mTimer)\n {\n mTimer = new QTimer();\n connect(mTimer,SIGNAL(timeout()),SLOT(mailCheck()));\n }\n else\n {\n mTimer->stop();\n }\n mTimer->start(mInterval*60000);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::deinstallTimer()\n{\n delete mTimer;\n mTimer = 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMAccount::runPrecommand(const QString &precommand)\n{\n \/\/ Run the pre command if there is one\n if ( precommand.isEmpty() )\n return true;\n\n KMPrecommand precommandProcess(precommand, this);\n\n BroadcastStatus::instance()->setStatusMsg(\n i18n(\"Executing precommand %1\", precommand ));\n\n connect(&precommandProcess, SIGNAL(finished(bool)),\n SLOT(precommandExited(bool)));\n\n kDebug(5006) << \"Running precommand \" << precommand << endl;\n if (!precommandProcess.start()) return false;\n\n#warning Port me!\n\/\/ kapp->eventLoop()->enterLoop();\n\n return mPrecommandSuccess;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::precommandExited(bool success)\n{\n mPrecommandSuccess = success;\n#warning Port me!\n\/\/ kapp->eventLoop()->exitLoop();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::mailCheck()\n{\n if (mTimer)\n mTimer->stop();\n kmkernel->acctMgr()->singleCheckMail(this, false);\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::sendReceipts()\n{\n QList<KMMessage*>::Iterator it;\n for(it = mReceipts.begin(); it != mReceipts.end(); ++it)\n kmkernel->msgSender()->send(*it); \/\/might process events\n mReceipts.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nQString KMAccount::encryptStr(const QString &aStr)\n{\n QString result;\n for (int i = 0; i < aStr.length(); i++)\n result += (aStr[i].unicode() < 0x20) ? aStr[i] :\n QChar(0x1001F - aStr[i].unicode());\n return result;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString KMAccount::importPassword(const QString &aStr)\n{\n unsigned int i, val;\n unsigned int len = aStr.length();\n Q3CString result;\n result.resize(len+1);\n\n for (i=0; i<len; i++)\n {\n val = aStr[i].toLatin1() - ' ';\n val = (255-' ') - val;\n result[i] = (char)(val + ' ');\n }\n result[i] = '\\0';\n\n return encryptStr(result);\n}\n\nvoid KMAccount::invalidateIMAPFolders()\n{\n \/\/ Default: Don't do anything. The IMAP account will handle it\n}\n\nvoid KMAccount::pseudoAssign( const KMAccount * a ) {\n if ( !a ) return;\n\n setName( a->name() );\n setId( a->id() );\n setCheckInterval( a->checkInterval() );\n setCheckExclude( a->checkExclude() );\n setFolder( a->folder() );\n setPrecommand( a->precommand() );\n setTrash( a->trash() );\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::checkDone( bool newmail, CheckStatus status )\n{\n setCheckingMail( false );\n \/\/ Reset the timeout for automatic mailchecking. The user might have\n \/\/ triggered the check manually.\n if (mTimer)\n mTimer->start(mInterval*60000);\n if ( mMailCheckProgressItem ) {\n mMailCheckProgressItem->setComplete(); \/\/ that will delete it\n mMailCheckProgressItem = 0;\n }\n\n emit newMailsProcessed( mNewInFolder );\n emit finishedCheck( newmail, status );\n mNewInFolder.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::addToNewInFolder( QString folderId, int num )\n{\n if ( mNewInFolder.find( folderId ) == mNewInFolder.end() )\n mNewInFolder[folderId] = num;\n else\n mNewInFolder[folderId] += num;\n}\n<commit_msg>forward port SVN commit 571253 by winterz:<commit_after>\/\/ KMail Account\n#include <config.h>\n\n#include \"kmaccount.h\"\n\n#include \"accountmanager.h\"\nusing KMail::AccountManager;\n#include \"kmacctfolder.h\"\n#include \"kmfoldermgr.h\"\n#include \"kmfiltermgr.h\"\n#include \"messagesender.h\"\n#include \"kmmessage.h\"\n#include \"broadcaststatus.h\"\nusing KPIM::BroadcastStatus;\n#include \"kmfoldercachedimap.h\"\n\n#include \"progressmanager.h\"\nusing KPIM::ProgressItem;\nusing KPIM::ProgressManager;\n\nusing KMail::FolderJob;\n\n#include <kapplication.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <kdebug.h>\n#include <kconfig.h>\n\n#include <QList>\n#include <QEventLoop>\n\/\/Added by qt3to4:\n#include <Q3CString>\n\n#include <stdlib.h>\n#include <unistd.h>\n#include <errno.h>\n\n#include <assert.h>\n\n\/\/----------------------\n#include \"kmaccount.moc\"\n\n\/\/-----------------------------------------------------------------------------\nKMPrecommand::KMPrecommand(const QString &precommand, QObject *parent)\n : QObject(parent), mPrecommand(precommand)\n{\n BroadcastStatus::instance()->setStatusMsg(\n i18n(\"Executing precommand %1\", precommand ));\n\n mPrecommandProcess.setUseShell(true);\n mPrecommandProcess << precommand;\n\n connect(&mPrecommandProcess, SIGNAL(processExited(KProcess *)),\n SLOT(precommandExited(KProcess *)));\n}\n\n\/\/-----------------------------------------------------------------------------\nKMPrecommand::~KMPrecommand()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool KMPrecommand::start()\n{\n bool ok = mPrecommandProcess.start( KProcess::NotifyOnExit );\n if (!ok) KMessageBox::error(0, i18n(\"Could not execute precommand '%1'.\",\n mPrecommand));\n return ok;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMPrecommand::precommandExited(KProcess *p)\n{\n int exitCode = p->normalExit() ? p->exitStatus() : -1;\n if (exitCode)\n KMessageBox::error(0, i18n(\"The precommand exited with code %1:\\n%2\",\n exitCode, strerror(exitCode)));\n emit finished(!exitCode);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nKMAccount::KMAccount(AccountManager* aOwner, const QString& aName, uint id)\n : KAccount( id, aName ),\n mTrash(KMKernel::self()->trashFolder()->idString()),\n mOwner(aOwner),\n mFolder(0),\n mTimer(0),\n mInterval(0),\n mExclude(false),\n mCheckingMail(false),\n mPrecommandSuccess(true),\n mHasInbox(false),\n mMailCheckProgressItem(0)\n{\n assert(aOwner != 0);\n}\n\nvoid KMAccount::init() {\n mTrash = kmkernel->trashFolder()->idString();\n mExclude = false;\n mInterval = 0;\n mNewInFolder.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nKMAccount::~KMAccount()\n{\n if (!kmkernel->shuttingDown() && mFolder) mFolder->removeAccount(this);\n if (mTimer) deinstallTimer();\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setName(const QString& aName)\n{\n mName = aName;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::clearPasswd()\n{\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setFolder(KMFolder* aFolder, bool addAccount)\n{\n if(!aFolder) {\n \/\/kDebug(5006) << \"KMAccount::setFolder() : aFolder == 0\" << endl;\n mFolder = 0;\n return;\n }\n mFolder = (KMAcctFolder*)aFolder;\n if (addAccount) mFolder->addAccount(this);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::readConfig(KConfig& config)\n{\n QString folderName;\n mFolder = 0;\n folderName = config.readEntry(\"Folder\");\n setCheckInterval(config.readEntry(\"check-interval\", 0 ) );\n setTrash(config.readEntry(\"trash\", kmkernel->trashFolder()->idString()));\n setCheckExclude(config.readEntry(\"check-exclude\", false ) );\n setPrecommand(config.readPathEntry(\"precommand\"));\n\n if (!folderName.isEmpty())\n {\n setFolder(kmkernel->folderMgr()->findIdString(folderName), true);\n }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::writeConfig(KConfig& config)\n{\n \/\/ ID, Name\n KAccount::writeConfig(config);\n\n config.writeEntry(\"Type\", type());\n config.writeEntry(\"Folder\", mFolder ? mFolder->idString() : QString());\n config.writeEntry(\"check-interval\", mInterval);\n config.writeEntry(\"check-exclude\", mExclude);\n config.writePathEntry(\"precommand\", mPrecommand);\n config.writeEntry(\"trash\", mTrash);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::sendReceipt(KMMessage* aMsg)\n{\n bool sendReceipts;\n\n KConfigGroup cfg( KMKernel::config(), \"General\" );\n\n sendReceipts = cfg.readEntry(\"send-receipts\", false );\n if (!sendReceipts) return;\n\n KMMessage *newMsg = aMsg->createDeliveryReceipt();\n if (newMsg) {\n mReceipts.append(newMsg);\n QTimer::singleShot( 0, this, SLOT( sendReceipts() ) );\n }\n}\n\n\n\/\/-----------------------------------------------------------------------------\nbool KMAccount::processNewMsg(KMMessage* aMsg)\n{\n int rc, processResult;\n\n assert(aMsg != 0);\n\n \/\/ Save this one for readding\n KMFolderCachedImap* parent = 0;\n if( type() == \"cachedimap\" )\n parent = static_cast<KMFolderCachedImap*>( aMsg->storage() );\n\n \/\/ checks whether we should send delivery receipts\n \/\/ and sends them.\n sendReceipt(aMsg);\n\n \/\/ Set status of new messages that are marked as old to read, otherwise\n \/\/ the user won't see which messages newly arrived.\n \/\/ This is only valid for pop accounts and produces wrong stati for imap.\n if ( type() != \"cachedimap\" && type() != \"imap\" ) {\n if ( aMsg->status().isOld() )\n aMsg->setStatus( MessageStatus::statusUnread() ); \/\/ -sanders\n \/\/ aMsg->setStatus( MessageStatus::statusRead() );\n else\n aMsg->setStatus( MessageStatus::statusNew() );\n }\n\/*\nQFile fileD0( \"testdat_xx-kmaccount-0\" );\nif( fileD0.open( QIODevice::WriteOnly ) ) {\n QDataStream ds( &fileD0 );\n ds.writeRawData( aMsg->asString(), aMsg->asString().length() );\n fileD0.close(); \/\/ If data is 0 we just create a zero length file.\n}\n*\/\n \/\/ 0==message moved; 1==processing ok, no move; 2==critical error, abort!\n\n processResult = kmkernel->filterMgr()->process(aMsg,KMFilterMgr::Inbound,true,id());\n if (processResult == 2) {\n perror(\"Critical error: Unable to collect mail (out of space?)\");\n KMessageBox::information(0,(i18n(\"Critical error: \"\n \"Unable to collect mail: \")) + QString::fromLocal8Bit(strerror(errno)));\n return false;\n }\n else if (processResult == 1)\n {\n if( type() == \"cachedimap\" )\n ; \/\/ already done by caller: parent->addMsgInternal( aMsg, false );\n else {\n \/\/ TODO: Perhaps it would be best, if this if was handled by a virtual\n \/\/ method, so the if( !dimap ) above could die?\n kmkernel->filterMgr()->tempOpenFolder(mFolder);\n rc = mFolder->addMsg(aMsg);\n\/*\nQFile fileD0( \"testdat_xx-kmaccount-1\" );\nif( fileD0.open( QIODevice::WriteOnly ) ) {\n QDataStream ds( &fileD0 );\n ds.writeRawData( aMsg->asString(), aMsg->asString().length() );\n fileD0.close(); \/\/ If data is 0 we just create a zero length file.\n}\n*\/\n if (rc) {\n perror(\"failed to add message\");\n KMessageBox::information(0, i18n(\"Failed to add message:\\n\") +\n QString(strerror(rc)));\n return false;\n }\n int count = mFolder->count();\n \/\/ If count == 1, the message is immediately displayed\n if (count != 1) mFolder->unGetMsg(count - 1);\n }\n }\n\n \/\/ Count number of new messages for each folder\n QString folderId;\n if ( processResult == 1 ) {\n folderId = ( type() == \"cachedimap\" ) ? parent->folder()->idString()\n : mFolder->idString();\n }\n else {\n folderId = aMsg->parent()->idString();\n }\n addToNewInFolder( folderId, 1 );\n\n return true; \/\/Everything's fine - message has been added by filter }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setCheckInterval(int aInterval)\n{\n if (aInterval <= 0)\n {\n mInterval = 0;\n deinstallTimer();\n }\n else\n {\n mInterval = aInterval;\n installTimer();\n }\n}\n\n\/\/----------------------------------------------------------------------------\nvoid KMAccount::deleteFolderJobs()\n{\n qDeleteAll( mJobList );\n mJobList.clear();\n}\n\n\/\/----------------------------------------------------------------------------\nvoid KMAccount::ignoreJobsForMessage( KMMessage* msg )\n{\n \/\/FIXME: remove, make folders handle those\n QList<FolderJob*>::iterator it;\n for( it = mJobList.begin(); it != mJobList.end(); ++it ) {\n if ( (*it)->msgList().first() == msg) {\n FolderJob *job = (*it);\n it = mJobList.erase( it );\n delete job;\n break;\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::setCheckExclude(bool aExclude)\n{\n mExclude = aExclude;\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::installTimer()\n{\n if (mInterval <= 0) return;\n if(!mTimer)\n {\n mTimer = new QTimer();\n connect(mTimer,SIGNAL(timeout()),SLOT(mailCheck()));\n }\n else\n {\n mTimer->stop();\n }\n mTimer->start(mInterval*60000);\n}\n\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::deinstallTimer()\n{\n delete mTimer;\n mTimer = 0;\n}\n\n\/\/-----------------------------------------------------------------------------\nbool KMAccount::runPrecommand(const QString &precommand)\n{\n \/\/ Run the pre command if there is one\n if ( precommand.isEmpty() )\n return true;\n\n KMPrecommand precommandProcess(precommand, this);\n\n BroadcastStatus::instance()->setStatusMsg(\n i18n(\"Executing precommand %1\", precommand ));\n\n connect(&precommandProcess, SIGNAL(finished(bool)),\n SLOT(precommandExited(bool)));\n\n kDebug(5006) << \"Running precommand \" << precommand << endl;\n if (!precommandProcess.start()) return false;\n\n#warning Port me!\n\/\/ kapp->eventLoop()->enterLoop();\n\n return mPrecommandSuccess;\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::precommandExited(bool success)\n{\n mPrecommandSuccess = success;\n#warning Port me!\n\/\/ kapp->eventLoop()->exitLoop();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::mailCheck()\n{\n if (mTimer)\n mTimer->stop();\n\n if ( kmkernel ) {\n AccountManager *acctmgr = kmkernel->acctMgr();\n if ( acctmgr ) {\n acctmgr->singleCheckMail( this, false );\n }\n }\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::sendReceipts()\n{\n QList<KMMessage*>::Iterator it;\n for(it = mReceipts.begin(); it != mReceipts.end(); ++it)\n kmkernel->msgSender()->send(*it); \/\/might process events\n mReceipts.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nQString KMAccount::encryptStr(const QString &aStr)\n{\n QString result;\n for (int i = 0; i < aStr.length(); i++)\n result += (aStr[i].unicode() < 0x20) ? aStr[i] :\n QChar(0x1001F - aStr[i].unicode());\n return result;\n}\n\n\/\/-----------------------------------------------------------------------------\nQString KMAccount::importPassword(const QString &aStr)\n{\n unsigned int i, val;\n unsigned int len = aStr.length();\n Q3CString result;\n result.resize(len+1);\n\n for (i=0; i<len; i++)\n {\n val = aStr[i].toLatin1() - ' ';\n val = (255-' ') - val;\n result[i] = (char)(val + ' ');\n }\n result[i] = '\\0';\n\n return encryptStr(result);\n}\n\nvoid KMAccount::invalidateIMAPFolders()\n{\n \/\/ Default: Don't do anything. The IMAP account will handle it\n}\n\nvoid KMAccount::pseudoAssign( const KMAccount * a ) {\n if ( !a ) return;\n\n setName( a->name() );\n setId( a->id() );\n setCheckInterval( a->checkInterval() );\n setCheckExclude( a->checkExclude() );\n setFolder( a->folder() );\n setPrecommand( a->precommand() );\n setTrash( a->trash() );\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::checkDone( bool newmail, CheckStatus status )\n{\n setCheckingMail( false );\n \/\/ Reset the timeout for automatic mailchecking. The user might have\n \/\/ triggered the check manually.\n if (mTimer)\n mTimer->start(mInterval*60000);\n if ( mMailCheckProgressItem ) {\n mMailCheckProgressItem->setComplete(); \/\/ that will delete it\n mMailCheckProgressItem = 0;\n }\n\n emit newMailsProcessed( mNewInFolder );\n emit finishedCheck( newmail, status );\n mNewInFolder.clear();\n}\n\n\/\/-----------------------------------------------------------------------------\nvoid KMAccount::addToNewInFolder( QString folderId, int num )\n{\n if ( mNewInFolder.find( folderId ) == mNewInFolder.end() )\n mNewInFolder[folderId] = num;\n else\n mNewInFolder[folderId] += num;\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tシェル、ＳＤコマンド解析、実行 @n\n\t\t\t・dir [xxx] @n\n\t\t\t・pwd @n\n\t\t\t・cd [xxx]\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2019 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/file_io.hpp\"\n#include \"common\/format.hpp\"\n\nnamespace utils {\n\n \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n \/*!\n @brief command class\n\t\t@param[in]\tCMD\t\tコマンド入力\n *\/\n \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CMD>\n\tclass shell {\n\n\t\tCMD&\tcmd_;\n\n\t\tbool\tsdc_state_;\n\n\tpublic:\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief コンストラクター\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tshell(CMD& cmd) : cmd_(cmd), sdc_state_(true)\n\t\t{ }\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief ＳＤ操作の完了を取得\n\t\t\t@return ＳＤ操作が正常なら「true」\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tbool get_status() const { return sdc_state_; }\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief 基本ＳＤ操作コマンド解析\n\t\t\t@return ＳＤ操作にマッチしたら「true」\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tbool analize() noexcept\n\t\t{\n auto cmdn = cmd_.get_words();\n if(cmdn >= 1) {\n if(cmd_.cmp_word(0, \"dir\")) { \/\/ dir [xxx]\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(cmdn == 1) {\n\t\t\t\t\t\tif(!utils::file_io::pwd(tmp, sizeof(tmp))) {\n\t\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tsdc_state_ = utils::file_io::dir(tmp);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcmd_.get_word(1, tmp, sizeof(tmp));\n\t\t\t\t\t\tsdc_state_ = utils::file_io::dir(tmp);\n\t\t\t\t\t}\n\t\t\t\t} else if(cmd_.cmp_word(0, \"pwd\")) { \/\/ pwd\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(!utils::file_io::pwd(tmp, sizeof(tmp))) {\n\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tutils::format(\"%s\\n\") % tmp;\n\t\t\t\t\t}\n\t\t\t\t} else if(cmd_.cmp_word(0, \"cd\")) { \/\/ cd [xxx]\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(cmdn == 1) {\n\t\t\t\t\t\tstrcpy(tmp, \"\/\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcmd_.get_word(1, tmp, sizeof(tmp));\n\t\t\t\t\t}\n\t\t\t\t\tsdc_state_ = utils::file_io::cd(tmp);\n\t\t\t\t} else if(cmd_.cmp_word(0, \"free\")) { \/\/ free\n\t\t\t\t\tuint32_t fre;\n\t\t\t\t\tuint32_t max;\n\t\t\t\t\tif(utils::file_io::get_free_space(fre, max)) {\n\t\t\t\t\t\tuint32_t rate = fre * 1000 \/ max;\n\t\t\t\t\t\tutils::format(\"%u\/%u [KB] (%u.%u%%)\\n\")\n\t\t\t\t\t\t\t% fre % max % (rate \/ 10) % (rate % 10);\n\t\t\t\t\t\tsdc_state_ = true;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief HELP 表示\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tvoid help() const {\n\t\t\tutils::format(\" dir [xxx] list current directory\\n\");\n\t\t\tutils::format(\" pwd current directory path\\n\");\n\t\t\tutils::format(\" cd [xxx] change current directory\\n\");\n\t\t\tutils::format(\" free list disk space\\n\");\n\/\/\/\t\t\t\t\t\t ---+---+---+---+---+\n\t\t}\n\t};\n}\n<commit_msg>Update: cleanup<commit_after>#pragma once\n\/\/=====================================================================\/\/\n\/*!\t@file\n\t@brief\tシェル、FS コマンド解析、実行 @n\n\t\t\t・dir [xxx] @n\n\t\t\t・pwd @n\n\t\t\t・cd [xxx] @n\n\t\t\t・free\n @author 平松邦仁 (hira@rvf-rc45.net)\n\t@copyright\tCopyright (C) 2019, 2020 Kunihito Hiramatsu @n\n\t\t\t\tReleased under the MIT license @n\n\t\t\t\thttps:\/\/github.com\/hirakuni45\/RX\/blob\/master\/LICENSE\n*\/\n\/\/=====================================================================\/\/\n#include \"common\/file_io.hpp\"\n#include \"common\/format.hpp\"\n\nnamespace utils {\n\n \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n \/*!\n @brief command class\n\t\t@param[in]\tCMD\t\tコマンド入力\n *\/\n \/\/+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\/\/\n\ttemplate <class CMD>\n\tclass shell {\n\n\t\tCMD&\tcmd_;\n\n\t\tbool\tsdc_state_;\n\n\tpublic:\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief コンストラクター\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tshell(CMD& cmd) : cmd_(cmd), sdc_state_(true)\n\t\t{ }\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief ＳＤ操作の完了を取得\n\t\t\t@return ＳＤ操作が正常なら「true」\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tbool get_status() const { return sdc_state_; }\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief 基本ＦＳ操作コマンド解析\n\t\t\t@return ＦＳ操作にマッチしたら「true」\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tbool analize() noexcept\n\t\t{\n auto cmdn = cmd_.get_words();\n if(cmdn >= 1) {\n if(cmd_.cmp_word(0, \"dir\")) { \/\/ dir [xxx]\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(cmdn == 1) {\n\t\t\t\t\t\tif(!utils::file_io::pwd(tmp, sizeof(tmp))) {\n\t\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tsdc_state_ = utils::file_io::dir(tmp);\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcmd_.get_word(1, tmp, sizeof(tmp));\n\t\t\t\t\t\tsdc_state_ = utils::file_io::dir(tmp);\n\t\t\t\t\t}\n\t\t\t\t} else if(cmd_.cmp_word(0, \"pwd\")) { \/\/ pwd\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(!utils::file_io::pwd(tmp, sizeof(tmp))) {\n\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tutils::format(\"%s\\n\") % tmp;\n\t\t\t\t\t}\n\t\t\t\t} else if(cmd_.cmp_word(0, \"cd\")) { \/\/ cd [xxx]\n\t\t\t\t\tchar tmp[FF_MAX_LFN + 1];\n\t\t\t\t\tif(cmdn == 1) {\n\t\t\t\t\t\tstrcpy(tmp, \"\/\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcmd_.get_word(1, tmp, sizeof(tmp));\n\t\t\t\t\t}\n\t\t\t\t\tsdc_state_ = utils::file_io::cd(tmp);\n\t\t\t\t} else if(cmd_.cmp_word(0, \"free\")) { \/\/ free\n\t\t\t\t\tuint32_t fre;\n\t\t\t\t\tuint32_t max;\n\t\t\t\t\tif(utils::file_io::get_free_space(fre, max)) {\n\t\t\t\t\t\tuint32_t rate = fre * 1000 \/ max;\n\t\t\t\t\t\tutils::format(\"%u\/%u [KB] (%u.%u%%)\\n\")\n\t\t\t\t\t\t\t% fre % max % (rate \/ 10) % (rate % 10);\n\t\t\t\t\t\tsdc_state_ = true;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tsdc_state_ = false;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t}\n\n\n \/\/-----------------------------------------------------------------\/\/\n \/*!\n @brief HELP 表示\n *\/\n \/\/-----------------------------------------------------------------\/\/\n\t\tvoid help() const {\n\t\t\tutils::format(\" dir [xxx] list current directory\\n\");\n\t\t\tutils::format(\" pwd current directory path\\n\");\n\t\t\tutils::format(\" cd [xxx] change current directory\\n\");\n\t\t\tutils::format(\" free list disk space\\n\");\n\/\/\/\t\t\t\t\t\t ---+---+---+---+---+\n\t\t}\n\t};\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>fix creation of filter list for export dialog<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clang_cc1 -fsyntax-only -verify -Wno-c++0x-extensions %s\n\nnamespace fizbin { class Foobar; } \/\/ expected-note{{'fizbin::Foobar' declared here}}\nFoobar *my_bar = new Foobar; \/\/ expected-error{{unknown type name 'Foobar'; did you mean 'fizbin::Foobar'?}} \\\n \/\/ expected-error{{expected a type}}\n\nnamespace barstool { int toFoobar() { return 1; } } \/\/ expected-note 3 {{'barstool::toFoobar' declared here}}\nint Double(int x) { return x + x; }\nvoid empty() {\n Double(toFoobar()); \/\/ expected-error{{{use of undeclared identifier 'toFoobar'; did you mean 'barstool::toFoobar'?}}\n}\n\nnamespace fizbin {\n namespace baztool { bool toFoobar() { return true; } } \/\/ expected-note{{'fizbin::baztool' declared here}}\n namespace nested { bool moreFoobar() { return true; } } \/\/ expected-note{{'fizbin::nested::moreFoobar' declared here}}\n namespace nested { bool lessFoobar() { return true; } } \/\/ expected-note{{'fizbin::nested' declared here}} \\\n \/\/ expected-note{{'fizbin::nested::lessFoobar' declared here}}\n class dummy { \/\/ expected-note 2 {{'fizbin::dummy' declared here}}\n public:\n static bool moreFoobar() { return false; } \/\/ expected-note{{'moreFoobar' declared here}}\n };\n}\nvoid Check() { \/\/ expected-note{{'Check' declared here}}\n if (toFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'toFoobar'; did you mean 'barstool::toFoobar'?}}\n if (noFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'noFoobar'; did you mean 'barstool::toFoobar'?}}\n if (moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'moreFoobar'; did you mean 'fizbin::nested::moreFoobar'}}\n if (lessFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'lessFoobar'; did you mean 'fizbin::nested::lessFoobar'?}}\n if (baztool::toFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'baztool'; did you mean 'fizbin::baztool'?}}\n if (nested::moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'nested'; did you mean 'fizbin::nested'?}}\n if (dummy::moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'dummy'; did you mean 'fizbin::dummy'?}}\n if (dummy::mreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'dummy'; did you mean 'fizbin::dummy'?}} \\\n \/\/ expected-error{{no member named 'mreFoobar' in 'fizbin::dummy'; did you mean 'moreFoobar'?}}\n if (moFoobin()) Double(7); \/\/ expected-error{{use of undeclared identifier 'moFoobin'}}\n}\n\nvoid Alt() {\n Cleck(); \/\/ expected-error{{{use of undeclared identifier 'Cleck'; did you mean 'Check'?}}\n}\n\nnamespace N {\n namespace inner {\n class myvector { \/* ... *\/ }; \/\/ expected-note{{'inner::myvector' declared here}}\n }\n\n void f() {\n myvector v; \/\/ expected-error{{unknown type name 'myvector'; did you mean 'inner::myvector'?}}\n }\n}\n\nnamespace realstd {\n inline namespace __1 {\n class mylinkedlist { \/* ... *\/ }; \/\/ expected-note 2 {{'realstd::mylinkedlist' declared here}}\n }\n\n class linkedlist { \/* ... *\/ };\n}\n\nvoid f() {\n mylinkedlist v; \/\/ expected-error{{unknown type name 'mylinkedlist'; did you mean 'realstd::mylinkedlist'?}}\n nylinkedlist w; \/\/ expected-error{{unknown type name 'nylinkedlist'; did you mean 'realstd::mylinkedlist'?}}\n}\n\n\/\/ Test case from http:\/\/llvm.org\/bugs\/show_bug.cgi?id=10318\nnamespace llvm {\n template <typename T> class GraphWriter {}; \/\/ expected-note{{'llvm::GraphWriter' declared here}}\n}\n\nstruct S {};\nvoid bar() {\n GraphWriter<S> x; \/\/expected-error{{no template named 'GraphWriter'; did you mean 'llvm::GraphWriter'?}}\n\n}\n<commit_msg>Split the two invalid uses of the unqualified Foobar at line 3 to two lines so that it is clearer which use triggered which error.<commit_after>\/\/ RUN: %clang_cc1 -fsyntax-only -verify -Wno-c++0x-extensions %s\n\nnamespace fizbin { class Foobar; } \/\/ expected-note{{'fizbin::Foobar' declared here}}\nFoobar *my_bar \/\/ expected-error{{unknown type name 'Foobar'; did you mean 'fizbin::Foobar'?}}\n = new Foobar; \/\/ expected-error{{expected a type}}\n\nnamespace barstool { int toFoobar() { return 1; } } \/\/ expected-note 3 {{'barstool::toFoobar' declared here}}\nint Double(int x) { return x + x; }\nvoid empty() {\n Double(toFoobar()); \/\/ expected-error{{{use of undeclared identifier 'toFoobar'; did you mean 'barstool::toFoobar'?}}\n}\n\nnamespace fizbin {\n namespace baztool { bool toFoobar() { return true; } } \/\/ expected-note{{'fizbin::baztool' declared here}}\n namespace nested { bool moreFoobar() { return true; } } \/\/ expected-note{{'fizbin::nested::moreFoobar' declared here}}\n namespace nested { bool lessFoobar() { return true; } } \/\/ expected-note{{'fizbin::nested' declared here}} \\\n \/\/ expected-note{{'fizbin::nested::lessFoobar' declared here}}\n class dummy { \/\/ expected-note 2 {{'fizbin::dummy' declared here}}\n public:\n static bool moreFoobar() { return false; } \/\/ expected-note{{'moreFoobar' declared here}}\n };\n}\nvoid Check() { \/\/ expected-note{{'Check' declared here}}\n if (toFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'toFoobar'; did you mean 'barstool::toFoobar'?}}\n if (noFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'noFoobar'; did you mean 'barstool::toFoobar'?}}\n if (moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'moreFoobar'; did you mean 'fizbin::nested::moreFoobar'}}\n if (lessFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'lessFoobar'; did you mean 'fizbin::nested::lessFoobar'?}}\n if (baztool::toFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'baztool'; did you mean 'fizbin::baztool'?}}\n if (nested::moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'nested'; did you mean 'fizbin::nested'?}}\n if (dummy::moreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'dummy'; did you mean 'fizbin::dummy'?}}\n if (dummy::mreFoobar()) Double(7); \/\/ expected-error{{use of undeclared identifier 'dummy'; did you mean 'fizbin::dummy'?}} \\\n \/\/ expected-error{{no member named 'mreFoobar' in 'fizbin::dummy'; did you mean 'moreFoobar'?}}\n if (moFoobin()) Double(7); \/\/ expected-error{{use of undeclared identifier 'moFoobin'}}\n}\n\nvoid Alt() {\n Cleck(); \/\/ expected-error{{{use of undeclared identifier 'Cleck'; did you mean 'Check'?}}\n}\n\nnamespace N {\n namespace inner {\n class myvector { \/* ... *\/ }; \/\/ expected-note{{'inner::myvector' declared here}}\n }\n\n void f() {\n myvector v; \/\/ expected-error{{unknown type name 'myvector'; did you mean 'inner::myvector'?}}\n }\n}\n\nnamespace realstd {\n inline namespace __1 {\n class mylinkedlist { \/* ... *\/ }; \/\/ expected-note 2 {{'realstd::mylinkedlist' declared here}}\n }\n\n class linkedlist { \/* ... *\/ };\n}\n\nvoid f() {\n mylinkedlist v; \/\/ expected-error{{unknown type name 'mylinkedlist'; did you mean 'realstd::mylinkedlist'?}}\n nylinkedlist w; \/\/ expected-error{{unknown type name 'nylinkedlist'; did you mean 'realstd::mylinkedlist'?}}\n}\n\n\/\/ Test case from http:\/\/llvm.org\/bugs\/show_bug.cgi?id=10318\nnamespace llvm {\n template <typename T> class GraphWriter {}; \/\/ expected-note{{'llvm::GraphWriter' declared here}}\n}\n\nstruct S {};\nvoid bar() {\n GraphWriter<S> x; \/\/expected-error{{no template named 'GraphWriter'; did you mean 'llvm::GraphWriter'?}}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n KNode, the KDE newsreader\n Copyright (c) 1999-2005 the KNode authors.\n See file AUTHORS for details\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, US\n*\/\n\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kio\/job.h>\n\n#include <libkdepim\/progressmanager.h>\n\n#include \"knarticle.h\"\n#include \"knglobals.h\"\n#include \"knnntpaccount.h\"\n#include \"scheduler.h\"\n\n\/\/Added by qt3to4:\n#include <QTimer>\n\nKNJobConsumer::KNJobConsumer()\n{\n}\n\n\nKNJobConsumer::~KNJobConsumer()\n{\n for ( QList<KNJobData*>::Iterator it = mJobs.begin(); it != mJobs.end(); ++it )\n (*it)->c_onsumer = 0;\n}\n\n\nvoid KNJobConsumer::emitJob( KNJobData *j )\n{\n if ( j ) {\n mJobs.append( j );\n knGlobals.scheduler()->addJob( j );\n }\n}\n\n\nvoid KNJobConsumer::jobDone( KNJobData *j )\n{\n if ( j && mJobs.removeAll( j ) )\n processJob( j );\n}\n\n\nvoid KNJobConsumer::processJob( KNJobData *j )\n{\n delete j;\n}\n\n\n\/\/ the assingment of a_ccount may cause race conditions, check again.... (CG)\nKNJobData::KNJobData(jobType t, KNJobConsumer *c, KNServerInfo *a, KNJobItem *i) :\n t_ype(t), d_ata(i), a_ccount(a),\n mError( 0 ),\n mCanceled( false ),\n c_onsumer( c ),\n mJob( 0 ),\n mProgressItem( 0 )\n{\n d_ata->setLocked(true);\n}\n\n\n\nKNJobData::~KNJobData()\n{\n d_ata->setLocked(false);\n}\n\n\nvoid KNJobData::notifyConsumer()\n{\n\n if(c_onsumer)\n c_onsumer->jobDone(this);\n else\n delete this;\n}\n\nvoid KNJobData::cancel()\n{\n mCanceled = true;\n if ( mJob ) {\n mJob->kill();\n mJob = 0;\n }\n if ( mProgressItem ) {\n mProgressItem->setStatus( \"Canceled\" );\n mProgressItem->setComplete();\n mProgressItem = 0;\n }\n emitFinished();\n}\n\nvoid KNJobData::emitFinished()\n{\n QTimer::singleShot( 0, this, SLOT(slotEmitFinished()) );\n}\n\nvoid KNJobData::setupKJob(KJob * job)\n{\n mJob = job;\n if ( job ) {\n connect( job, SIGNAL( percent(KJob*, unsigned long) ),\n SLOT( slotJobPercent(KJob*, unsigned long) ) );\n connect( job, SIGNAL( infoMessage(KJob*, const QString&) ),\n SLOT( slotJobInfoMessage(KJob*, const QString&) ) );\n }\n}\n\nvoid KNJobData::setupKIOJob( KIO::Job *job )\n{\n if ( job ) {\n if ( account() ) {\n if ( account()->encryption() == KNServerInfo::TLS )\n job->addMetaData( \"tls\", \"on\" );\n else\n job->addMetaData( \"tls\", \"off\" );\n }\n }\n setupKJob( job );\n}\n\nvoid KNJobData::createProgressItem()\n{\n if ( mProgressItem )\n return;\n KNNntpAccount *acc = static_cast<KNNntpAccount*>( account() );\n QString msg = i18n( \"KNode\" );\n if ( type() == JTmail )\n msg = i18n( \"Sending message\" );\n else {\n if ( acc )\n msg = acc->name();\n }\n bool encr = false;\n if ( acc && acc->encryption() != KNServerInfo::None )\n encr = true;\n mProgressItem = KPIM::ProgressManager::createProgressItem( 0,\n KPIM::ProgressManager::getUniqueID(), msg, i18n( \"Waiting...\" ), true, encr );\n}\n\nvoid KNJobData::slotJobPercent( KJob*, unsigned long percent )\n{\n kDebug(5003) <<\"Progress:\" << percent;\n setProgress( percent );\n}\n\nvoid KNJobData::slotJobInfoMessage( KJob*, const QString &msg )\n{\n kDebug(5003) <<\"Status:\" << msg;\n setStatus( msg );\n}\n\nvoid KNJobData::slotEmitFinished( )\n{\n emit finished( this );\n}\n\nKUrl KNJobData::baseUrl() const\n{\n KUrl url;\n if ( account()->encryption() == KNServerInfo::SSL )\n url.setProtocol( \"nntps\" );\n else\n url.setProtocol( \"nntp\" );\n url.setHost( account()->server() );\n url.setPort( account()->port() );\n if ( account()->needsLogon() ) {\n url.setUser( account()->user() );\n url.setPass( account()->pass() );\n }\n return url;\n}\n\nvoid KNJobData::setError( int err, const QString & errMsg )\n{\n mError = err;\n mErrorString = errMsg;\n}\n\n#include \"knjobdata.moc\"\n<commit_msg>Backport of r945671.<commit_after>\/*\n KNode, the KDE newsreader\n Copyright (c) 1999-2005 the KNode authors.\n See file AUTHORS for details\n\n This program is free software; you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation; either version 2 of the License, or\n (at your option) any later version.\n You should have received a copy of the GNU General Public License\n along with this program; if not, write to the Free Software Foundation,\n Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, US\n*\/\n\n\n#include <kdebug.h>\n#include <klocale.h>\n#include <kio\/job.h>\n\n#include <libkdepim\/progressmanager.h>\n\n#include \"knarticle.h\"\n#include \"knglobals.h\"\n#include \"knnntpaccount.h\"\n#include \"scheduler.h\"\n\n\/\/Added by qt3to4:\n#include <QTimer>\n\nKNJobConsumer::KNJobConsumer()\n{\n}\n\n\nKNJobConsumer::~KNJobConsumer()\n{\n for ( QList<KNJobData*>::Iterator it = mJobs.begin(); it != mJobs.end(); ++it )\n (*it)->c_onsumer = 0;\n}\n\n\nvoid KNJobConsumer::emitJob( KNJobData *j )\n{\n if ( j ) {\n mJobs.append( j );\n knGlobals.scheduler()->addJob( j );\n }\n}\n\n\nvoid KNJobConsumer::jobDone( KNJobData *j )\n{\n if ( j && mJobs.removeAll( j ) )\n processJob( j );\n}\n\n\nvoid KNJobConsumer::processJob( KNJobData *j )\n{\n delete j;\n}\n\n\n\/\/ the assingment of a_ccount may cause race conditions, check again.... (CG)\nKNJobData::KNJobData(jobType t, KNJobConsumer *c, KNServerInfo *a, KNJobItem *i) :\n t_ype(t), d_ata(i), a_ccount(a),\n mError( 0 ),\n mCanceled( false ),\n c_onsumer( c ),\n mJob( 0 ),\n mProgressItem( 0 )\n{\n d_ata->setLocked(true);\n}\n\n\n\nKNJobData::~KNJobData()\n{\n d_ata->setLocked(false);\n}\n\n\nvoid KNJobData::notifyConsumer()\n{\n\n if(c_onsumer)\n c_onsumer->jobDone(this);\n else\n delete this;\n}\n\nvoid KNJobData::cancel()\n{\n mCanceled = true;\n if ( mJob ) {\n mJob->kill();\n mJob = 0;\n }\n if ( mProgressItem ) {\n mProgressItem->setStatus( \"Canceled\" );\n mProgressItem->setComplete();\n mProgressItem = 0;\n }\n emitFinished();\n}\n\nvoid KNJobData::emitFinished()\n{\n QTimer::singleShot( 0, this, SLOT(slotEmitFinished()) );\n}\n\nvoid KNJobData::setupKJob(KJob * job)\n{\n mJob = job;\n if ( job ) {\n connect( job, SIGNAL( percent(KJob*, unsigned long) ),\n SLOT( slotJobPercent(KJob*, unsigned long) ) );\n connect( job, SIGNAL( infoMessage(KJob*, const QString&) ),\n SLOT( slotJobInfoMessage(KJob*, const QString&) ) );\n }\n}\n\nvoid KNJobData::setupKIOJob( KIO::Job *job )\n{\n if ( job ) {\n if ( account() ) {\n if ( account()->encryption() == KNServerInfo::TLS )\n job->addMetaData( \"tls\", \"on\" );\n else\n job->addMetaData( \"tls\", \"off\" );\n }\n }\n job->setUiDelegate(0);\n setupKJob( job );\n}\n\nvoid KNJobData::createProgressItem()\n{\n if ( mProgressItem )\n return;\n KNNntpAccount *acc = static_cast<KNNntpAccount*>( account() );\n QString msg = i18n( \"KNode\" );\n if ( type() == JTmail )\n msg = i18n( \"Sending message\" );\n else {\n if ( acc )\n msg = acc->name();\n }\n bool encr = false;\n if ( acc && acc->encryption() != KNServerInfo::None )\n encr = true;\n mProgressItem = KPIM::ProgressManager::createProgressItem( 0,\n KPIM::ProgressManager::getUniqueID(), msg, i18n( \"Waiting...\" ), true, encr );\n}\n\nvoid KNJobData::slotJobPercent( KJob*, unsigned long percent )\n{\n kDebug(5003) <<\"Progress:\" << percent;\n setProgress( percent );\n}\n\nvoid KNJobData::slotJobInfoMessage( KJob*, const QString &msg )\n{\n kDebug(5003) <<\"Status:\" << msg;\n setStatus( msg );\n}\n\nvoid KNJobData::slotEmitFinished( )\n{\n emit finished( this );\n}\n\nKUrl KNJobData::baseUrl() const\n{\n KUrl url;\n if ( account()->encryption() == KNServerInfo::SSL )\n url.setProtocol( \"nntps\" );\n else\n url.setProtocol( \"nntp\" );\n url.setHost( account()->server() );\n url.setPort( account()->port() );\n if ( account()->needsLogon() ) {\n url.setUser( account()->user() );\n url.setPass( account()->pass() );\n }\n return url;\n}\n\nvoid KNJobData::setError( int err, const QString & errMsg )\n{\n mError = err;\n mErrorString = errMsg;\n}\n\n#include \"knjobdata.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006-2015, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef ROUTING_TABLE_HPP\n#define ROUTING_TABLE_HPP\n\n#include \"libtorrent\/aux_\/disable_warnings_push.hpp\"\n\n#include <vector>\n#include <set>\n\n#include <boost\/cstdint.hpp>\n#include <boost\/utility.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/array.hpp>\n#include <boost\/noncopyable.hpp>\n#include <boost\/unordered_set.hpp>\n\n#include \"libtorrent\/aux_\/disable_warnings_pop.hpp\"\n\n#include <libtorrent\/kademlia\/node_id.hpp>\n#include <libtorrent\/kademlia\/node_entry.hpp>\n#include <libtorrent\/session_settings.hpp>\n#include <libtorrent\/assert.hpp>\n#include <libtorrent\/time.hpp>\n\nnamespace libtorrent\n{\n#ifndef TORRENT_NO_DEPRECATE\n\tstruct session_status;\n#endif\n\tstruct dht_routing_bucket;\n}\n\nnamespace libtorrent { namespace dht\n{\nstruct dht_logger;\n\ntypedef std::vector<node_entry> bucket_t;\n\nstruct routing_table_node\n{\n\tbucket_t replacements;\n\tbucket_t live_nodes;\n};\n\n\/\/ differences in the implementation from the description in\n\/\/ the paper:\n\/\/\n\/\/ * Nodes are not marked as being stale, they keep a counter\n\/\/ \tthat tells how many times in a row they have failed. When\n\/\/ \ta new node is to be inserted, the node that has failed\n\/\/ \tthe most times is replaced. If none of the nodes in the\n\/\/ \tbucket has failed, then it is put in the replacement\n\/\/ \tcache (just like in the paper).\n\nclass TORRENT_EXTRA_EXPORT routing_table : boost::noncopyable\n{\npublic:\n\ttypedef std::vector<routing_table_node> table_t;\n\n\trouting_table(node_id const& id, int bucket_size\n\t\t, dht_settings const& settings\n\t\t, dht_logger* log);\n\n#ifndef TORRENT_NO_DEPRECATE\n\tvoid status(session_status& s) const;\n#endif\n\n\tvoid status(std::vector<dht_routing_bucket>& s) const;\n\n\tvoid node_failed(node_id const& id, udp::endpoint const& ep);\n\t\n\t\/\/ adds an endpoint that will never be added to\n\t\/\/ the routing table\n\tvoid add_router_node(udp::endpoint router);\n\n\t\/\/ iterates over the router nodes added\n\ttypedef std::set<udp::endpoint>::const_iterator router_iterator;\n\trouter_iterator router_begin() const { return m_router_nodes.begin(); }\n\trouter_iterator router_end() const { return m_router_nodes.end(); }\n\n\tenum add_node_status_t {\n\t\tfailed_to_add = 0,\n\t\tnode_added,\n\t\tneed_bucket_split\n\t};\n\tadd_node_status_t add_node_impl(node_entry e);\n\n\tbool add_node(node_entry e);\n\n\t\/\/ this function is called every time the node sees\n\t\/\/ a sign of a node being alive. This node will either\n\t\/\/ be inserted in the k-buckets or be moved to the top\n\t\/\/ of its bucket.\n\tbool node_seen(node_id const& id, udp::endpoint ep, int rtt);\n\n\t\/\/ this may add a node to the routing table and mark it as\n\t\/\/ not pinged. If the bucket the node falls into is full,\n\t\/\/ the node will be ignored.\n\tvoid heard_about(node_id const& id, udp::endpoint const& ep);\n\n\tnode_entry const* next_refresh();\n\n\tenum\n\t{\n\t\t\/\/ nodes that have not been pinged are considered failed by this flag\n\t\tinclude_failed = 1\n\t};\n\n\t\/\/ fills the vector with the count nodes from our buckets that\n\t\/\/ are nearest to the given id.\n\tvoid find_node(node_id const& id, std::vector<node_entry>& l\n\t\t, int options, int count = 0);\n\tvoid remove_node(node_entry* n\n\t\t, table_t::iterator bucket) ;\n\n\tint bucket_size(int bucket) const\n\t{\n\t\tint num_buckets = m_buckets.size();\n\t\tif (num_buckets == 0) return 0;\n\t\tif (bucket < num_buckets) bucket = num_buckets - 1;\n\t\ttable_t::const_iterator i = m_buckets.begin();\n\t\tstd::advance(i, bucket);\n\t\treturn int(i->live_nodes.size());\n\t}\n\n\tvoid for_each_node(void (*)(void*, node_entry const&)\n\t\t, void (*)(void*, node_entry const&), void* userdata) const;\n\n\tint bucket_size() const { return m_bucket_size; }\n\n\t\/\/ returns the number of nodes in the main buckets, number of nodes in the\n\t\/\/ replacement buckets and the number of nodes in the main buckets that have\n\t\/\/ been pinged and confirmed up\n\tboost::tuple<int, int, int> size() const;\n\n\tboost::int64_t num_global_nodes() const;\n\n\t\/\/ the number of bits down we have full buckets\n\t\/\/ i.e. essentially the number of full buckets\n\t\/\/ we have\n\tint depth() const;\n\n\tint num_active_buckets() const { return m_buckets.size(); }\n\n\tvoid replacement_cache(bucket_t& nodes) const;\n\n#if defined TORRENT_DEBUG\n\t\/\/ used for debug and monitoring purposes. This will print out\n\t\/\/ the state of the routing table to the given stream\n\tvoid print_state(std::ostream& os) const;\n#endif\n\n\tint bucket_limit(int bucket) const;\n\n#if TORRENT_USE_INVARIANT_CHECKS\n\tvoid check_invariant() const;\n#endif\n\nprivate:\n\n\tdht_logger* m_log;\n\n\ttable_t::iterator find_bucket(node_id const& id);\n\n\tvoid split_bucket();\n\n\t\/\/ return a pointer the node_entry with the given endpoint\n\t\/\/ or 0 if we don't have such a node. Both the address and the\n\t\/\/ port has to match\n\tnode_entry* find_node(udp::endpoint const& ep\n\t\t, routing_table::table_t::iterator* bucket);\n\n\tdht_settings const& m_settings;\n\n\t\/\/ (k-bucket, replacement cache) pairs\n\t\/\/ the first entry is the bucket the furthest\n\t\/\/ away from our own ID. Each time the bucket\n\t\/\/ closest to us (m_buckets.back()) has more than\n\t\/\/ bucket size nodes in it, another bucket is\n\t\/\/ added to the end and it's split up between them\n\ttable_t m_buckets;\n\n\tnode_id m_id; \/\/ our own node id\n\n\t\/\/ the last seen depth (i.e. levels in the routing table)\n\t\/\/ it's mutable because it's updated by depth(), which is const\n\tmutable int m_depth;\n\n\t\/\/ the last time we refreshed our own bucket\n\t\/\/ refreshed every 15 minutes\n\tmutable time_point m_last_self_refresh;\n\n\t\/\/ this is a set of all the endpoints that have\n\t\/\/ been identified as router nodes. They will\n\t\/\/ be used in searches, but they will never\n\t\/\/ be added to the routing table.\n\tstd::set<udp::endpoint> m_router_nodes;\n\n\t\/\/ these are all the IPs that are in the routing\n\t\/\/ table. It's used to only allow a single entry\n\t\/\/ per IP in the whole table. Currently only for\n\t\/\/ IPv4\n\tboost::unordered_multiset<address_v4::bytes_type> m_ips;\n\n\t\/\/ constant called k in paper\n\tint m_bucket_size;\n};\n\n} } \/\/ namespace libtorrent::dht\n\n#endif \/\/ ROUTING_TABLE_HPP\n\n<commit_msg>Fix routing_table bucket_size(int bucket) out_of_range logic error.<commit_after>\/*\n\nCopyright (c) 2006-2015, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#ifndef ROUTING_TABLE_HPP\n#define ROUTING_TABLE_HPP\n\n#include \"libtorrent\/aux_\/disable_warnings_push.hpp\"\n\n#include <vector>\n#include <set>\n\n#include <boost\/cstdint.hpp>\n#include <boost\/utility.hpp>\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/array.hpp>\n#include <boost\/noncopyable.hpp>\n#include <boost\/unordered_set.hpp>\n\n#include \"libtorrent\/aux_\/disable_warnings_pop.hpp\"\n\n#include <libtorrent\/kademlia\/node_id.hpp>\n#include <libtorrent\/kademlia\/node_entry.hpp>\n#include <libtorrent\/session_settings.hpp>\n#include <libtorrent\/assert.hpp>\n#include <libtorrent\/time.hpp>\n\nnamespace libtorrent\n{\n#ifndef TORRENT_NO_DEPRECATE\n\tstruct session_status;\n#endif\n\tstruct dht_routing_bucket;\n}\n\nnamespace libtorrent { namespace dht\n{\nstruct dht_logger;\n\ntypedef std::vector<node_entry> bucket_t;\n\nstruct routing_table_node\n{\n\tbucket_t replacements;\n\tbucket_t live_nodes;\n};\n\n\/\/ differences in the implementation from the description in\n\/\/ the paper:\n\/\/\n\/\/ * Nodes are not marked as being stale, they keep a counter\n\/\/ \tthat tells how many times in a row they have failed. When\n\/\/ \ta new node is to be inserted, the node that has failed\n\/\/ \tthe most times is replaced. If none of the nodes in the\n\/\/ \tbucket has failed, then it is put in the replacement\n\/\/ \tcache (just like in the paper).\n\nclass TORRENT_EXTRA_EXPORT routing_table : boost::noncopyable\n{\npublic:\n\ttypedef std::vector<routing_table_node> table_t;\n\n\trouting_table(node_id const& id, int bucket_size\n\t\t, dht_settings const& settings\n\t\t, dht_logger* log);\n\n#ifndef TORRENT_NO_DEPRECATE\n\tvoid status(session_status& s) const;\n#endif\n\n\tvoid status(std::vector<dht_routing_bucket>& s) const;\n\n\tvoid node_failed(node_id const& id, udp::endpoint const& ep);\n\t\n\t\/\/ adds an endpoint that will never be added to\n\t\/\/ the routing table\n\tvoid add_router_node(udp::endpoint router);\n\n\t\/\/ iterates over the router nodes added\n\ttypedef std::set<udp::endpoint>::const_iterator router_iterator;\n\trouter_iterator router_begin() const { return m_router_nodes.begin(); }\n\trouter_iterator router_end() const { return m_router_nodes.end(); }\n\n\tenum add_node_status_t {\n\t\tfailed_to_add = 0,\n\t\tnode_added,\n\t\tneed_bucket_split\n\t};\n\tadd_node_status_t add_node_impl(node_entry e);\n\n\tbool add_node(node_entry e);\n\n\t\/\/ this function is called every time the node sees\n\t\/\/ a sign of a node being alive. This node will either\n\t\/\/ be inserted in the k-buckets or be moved to the top\n\t\/\/ of its bucket.\n\tbool node_seen(node_id const& id, udp::endpoint ep, int rtt);\n\n\t\/\/ this may add a node to the routing table and mark it as\n\t\/\/ not pinged. If the bucket the node falls into is full,\n\t\/\/ the node will be ignored.\n\tvoid heard_about(node_id const& id, udp::endpoint const& ep);\n\n\tnode_entry const* next_refresh();\n\n\tenum\n\t{\n\t\t\/\/ nodes that have not been pinged are considered failed by this flag\n\t\tinclude_failed = 1\n\t};\n\n\t\/\/ fills the vector with the count nodes from our buckets that\n\t\/\/ are nearest to the given id.\n\tvoid find_node(node_id const& id, std::vector<node_entry>& l\n\t\t, int options, int count = 0);\n\tvoid remove_node(node_entry* n\n\t\t, table_t::iterator bucket) ;\n\n\tint bucket_size(int bucket) const\n\t{\n\t\tint num_buckets = m_buckets.size();\n\t\tif (num_buckets == 0) return 0;\n\t\tif (bucket >= num_buckets) bucket = num_buckets - 1;\n\t\ttable_t::const_iterator i = m_buckets.begin();\n\t\tstd::advance(i, bucket);\n\t\treturn int(i->live_nodes.size());\n\t}\n\n\tvoid for_each_node(void (*)(void*, node_entry const&)\n\t\t, void (*)(void*, node_entry const&), void* userdata) const;\n\n\tint bucket_size() const { return m_bucket_size; }\n\n\t\/\/ returns the number of nodes in the main buckets, number of nodes in the\n\t\/\/ replacement buckets and the number of nodes in the main buckets that have\n\t\/\/ been pinged and confirmed up\n\tboost::tuple<int, int, int> size() const;\n\n\tboost::int64_t num_global_nodes() const;\n\n\t\/\/ the number of bits down we have full buckets\n\t\/\/ i.e. essentially the number of full buckets\n\t\/\/ we have\n\tint depth() const;\n\n\tint num_active_buckets() const { return m_buckets.size(); }\n\n\tvoid replacement_cache(bucket_t& nodes) const;\n\n#if defined TORRENT_DEBUG\n\t\/\/ used for debug and monitoring purposes. This will print out\n\t\/\/ the state of the routing table to the given stream\n\tvoid print_state(std::ostream& os) const;\n#endif\n\n\tint bucket_limit(int bucket) const;\n\n#if TORRENT_USE_INVARIANT_CHECKS\n\tvoid check_invariant() const;\n#endif\n\nprivate:\n\n\tdht_logger* m_log;\n\n\ttable_t::iterator find_bucket(node_id const& id);\n\n\tvoid split_bucket();\n\n\t\/\/ return a pointer the node_entry with the given endpoint\n\t\/\/ or 0 if we don't have such a node. Both the address and the\n\t\/\/ port has to match\n\tnode_entry* find_node(udp::endpoint const& ep\n\t\t, routing_table::table_t::iterator* bucket);\n\n\tdht_settings const& m_settings;\n\n\t\/\/ (k-bucket, replacement cache) pairs\n\t\/\/ the first entry is the bucket the furthest\n\t\/\/ away from our own ID. Each time the bucket\n\t\/\/ closest to us (m_buckets.back()) has more than\n\t\/\/ bucket size nodes in it, another bucket is\n\t\/\/ added to the end and it's split up between them\n\ttable_t m_buckets;\n\n\tnode_id m_id; \/\/ our own node id\n\n\t\/\/ the last seen depth (i.e. levels in the routing table)\n\t\/\/ it's mutable because it's updated by depth(), which is const\n\tmutable int m_depth;\n\n\t\/\/ the last time we refreshed our own bucket\n\t\/\/ refreshed every 15 minutes\n\tmutable time_point m_last_self_refresh;\n\n\t\/\/ this is a set of all the endpoints that have\n\t\/\/ been identified as router nodes. They will\n\t\/\/ be used in searches, but they will never\n\t\/\/ be added to the routing table.\n\tstd::set<udp::endpoint> m_router_nodes;\n\n\t\/\/ these are all the IPs that are in the routing\n\t\/\/ table. It's used to only allow a single entry\n\t\/\/ per IP in the whole table. Currently only for\n\t\/\/ IPv4\n\tboost::unordered_multiset<address_v4::bytes_type> m_ips;\n\n\t\/\/ constant called k in paper\n\tint m_bucket_size;\n};\n\n} } \/\/ namespace libtorrent::dht\n\n#endif \/\/ ROUTING_TABLE_HPP\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n BelaCsound.cpp:\n\n Copyright (C) 2017 V Lazzarini\n\n This file is part of Csound.\n\n The Csound Library is free software; you can redistribute it\n and\/or modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n Csound is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with Csound; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n*\/\n\n#include <getopt.h>\n#include <Bela.h>\n#include <Midi.h>\n#include <csound.hpp>\n#include <plugin.h>\n#include <vector>\n#include <sstream>\n#include <iostream>\n#include <atomic>\n\n#define ANCHNS 8\n\nstatic int OpenMidiInDevice(CSOUND *csound, void **userData, const char *dev);\nstatic int CloseMidiInDevice(CSOUND *csound, void *userData);\nstatic int ReadMidiData(CSOUND *csound, void *userData, unsigned char *mbuf,\n\t\t\tint nbytes);\nstatic int OpenMidiOutDevice(CSOUND *csound, void **userData, const char *dev);\nstatic int CloseMidiOutDevice(CSOUND *csound, void *userData);\nstatic int WriteMidiData(CSOUND *csound, void *userData, const unsigned char *mbuf,\n\t\t\t int nbytes);\n\n\/** DigiIn opcode \n ksig digiInBela ipin\n asig digiInBela ipin\n*\/\nstruct DigiIn : csnd::Plugin<1, 1> {\n int pin;\n int fcount;\n int frms;\n int init_done;\n BelaContext *context;\n \n int init() {\n pin = (int) inargs[0];\n if(pin < 0 ) pin = 0;\n if(pin > 15) pin = 15;\n context = (BelaContext *) csound->host_data();\n fcount = 0;\n init_done = 0;\n frms = context->digitalFrames; \n return OK;\n }\n\n int kperf() {\n if(!init_done) {\n pinMode(context,0,pin,0);\n init_done = 1;\n }\n outargs[0] = (MYFLT) digitalRead(context,fcount,pin);\n fcount += nsmps;\n fcount %= frms;\n return OK;\n }\n\n int aperf() {\n csnd::AudioSig out(this, outargs(0));\n int cnt = fcount;\n if(!init_done) {\n pinMode(context,0,pin,0);\n init_done = 1;\n }\n for (auto &s : out) {\n s = (MYFLT) digitalRead(context,cnt,pin);\n if(cnt == frms - 1) cnt = 0;\n else cnt++;\n }\n fcount = cnt;\n return OK;\n }\n};\n\n\/** DigiOut opcode \n digiOutBela ksig,ipin\n digiOutBela asig,ipin\n*\/\nstruct DigiOut : csnd::Plugin<0, 2> {\n int pin;\n int fcount;\n int frms;\n int init_done;\n BelaContext *context;\n \n int init() {\n pin = (int) inargs[1];\n if(pin < 0 ) pin = 0;\n if(pin > 15) pin = 15;\n context = (BelaContext *) csound->host_data();\n init_done = 0;\n fcount = 0;\n frms = context->digitalFrames; \n return OK;\n }\n\n int kperf() {\n if(!init_done) {\n pinMode(context,0,pin,1);\n init_done = 1;\n }\n digitalWrite(context,fcount,pin,(inargs[0] > 0.0 ? 1 : 0));\n fcount += nsmps;\n fcount %= frms;\n return OK;\n }\n\n int aperf() {\n csnd::AudioSig in(this, inargs(0));\n int cnt = fcount;\n if(!init_done) {\n pinMode(context,0,pin,1);\n init_done = 1;\n }\n for (auto s : in) {\n digitalWriteOnce(context,cnt,pin, (s > 0.0 ? 1 : 0));\n if(cnt == frms - 1) cnt = 0;\n else cnt++;\n }\n fcount = cnt;\n return OK;\n }\n};\n\nstruct CsChan {\n std::vector<MYFLT> samples;\n std::stringstream name;\n};\n\nstruct CsData {\n Csound *csound;\n std::string csdfile;\n int blocksize;\n std::atomic_int res;\n int count;\n CsChan channel[ANCHNS];\n CsChan ochannel[ANCHNS];\n};\n\nbool csound_setup(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n Csound *csound;\n const char *args[] = { \"csound\", csData->csdfile.c_str(), \"-iadc\",\n\t\t\t \"-odac\", \"-+rtaudio=null\",\n\t\t\t \"--realtime\", \"--daemon\" };\n int numArgs = (int) (sizeof(args)\/sizeof(char *));\n\n if(context->audioInChannels != context->audioOutChannels) {\n printf(\"Error: number of audio inputs != number of audio outputs.\\n\");\n return false;\n }\n\n if(context->analogInChannels != context->analogOutChannels) {\n printf(\"Error: number of analog inputs != number of analog outputs.\\n\");\n return false;\n }\n \n \/* set up Csound *\/\n csound = new Csound();\n csData->csound = csound;\n csound->SetHostData((void *) context);\n csound->SetHostImplementedAudioIO(1,0);\n csound->SetHostImplementedMIDIIO(1);\n csound->SetExternalMidiInOpenCallback(OpenMidiInDevice);\n csound->SetExternalMidiReadCallback(ReadMidiData);\n csound->SetExternalMidiInCloseCallback(CloseMidiInDevice);\n csound->SetExternalMidiOutOpenCallback(OpenMidiOutDevice);\n csound->SetExternalMidiWriteCallback(WriteMidiData);\n csound->SetExternalMidiOutCloseCallback(CloseMidiOutDevice);\n \/* set up digi opcodes *\/\n if(csnd::plugin<DigiIn>((csnd::Csound *) csound->GetCsound(), \"digiInBela\",\n\t\t\t \"k\",\"i\", csnd::thread::ik) != 0)\n printf(\"Warning: could not add digiInBela k-rate opcode\\n\");\n if(csnd::plugin<DigiIn>((csnd::Csound *) csound->GetCsound(), \"digiInBela\",\n\t\t\t \"a\", \"i\", csnd::thread::ia) != 0)\n printf(\"Warning: could not add digiInBela a-rate opcode\\n\");\n if(csnd::plugin<DigiOut>((csnd::Csound *) csound->GetCsound(), \"digiOutBela\" ,\n\t\t\t \"\", \"ki\", csnd::thread::ik) != 0)\n printf(\"Warning: could not add digiOutBela k-rate opcode\\n\");\n if(csnd::plugin<DigiOut>((csnd::Csound *) csound->GetCsound(), \"digiOutBela\" ,\n\t\t\t \"\", \"ai\", csnd::thread::ia) != 0)\n printf(\"Warning: could not add digiOutBela a-rate opcode\\n\");\n\n \/* compile CSD *\/ \n if((csData->res = csound->Compile(numArgs, args)) != 0) {\n printf(\"Error: Csound could not compile CSD file.\\n\");\n return false;\n }\n csData->blocksize = csound->GetKsmps()*csound->GetNchnls();\n csData->count = 0;\n\n \/* set up the channels *\/\n for(int i=0; i < ANCHNS; i++) {\n csData->channel[i].samples.resize(csound->GetKsmps());\n csData->channel[i].name << \"analogIn\" << i;\n csData->ochannel[i].samples.resize(csound->GetKsmps());\n csData->ochannel[i].name << \"analogOut\" << i;\n }\n \n return true;\n}\n\nvoid csound_render(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n if(csData->res == 0) {\n int i,k,count, frmcount,blocksize,res = csData->res;\n unsigned int n;\n Csound *csound = csData->csound;\n MYFLT scal = csound->Get0dBFS();\n MYFLT* audioIn = csound->GetSpin();\n MYFLT* audioOut = csound->GetSpout();\n int nchnls = csound->GetNchnls();\n int chns = (unsigned int) nchnls < context->audioOutChannels ?\n nchnls : context->audioOutChannels;\n int an_chns = context->analogInChannels > ANCHNS ?\n ANCHNS : context->analogInChannels;\n CsChan *channel = csData->channel;\n CsChan *ochannel = csData->ochannel;\n float frm = 0.f, incr =\n ((float) context->analogFrames)\/context->audioFrames;\n count = csData->count;\n blocksize = csData->blocksize;\n \n \/* processing loop *\/\n for(n = 0; n < context->audioFrames; n++, frm+=incr, count+=nchnls){\n if(count == blocksize) {\n\t\n\t\/* set the channels *\/\n\tfor(i = 0; i < an_chns; i++) {\n csound->SetChannel(channel[i].name.str().c_str(),\n\t\t\t channel[i].samples.data());\n\t csound->GetAudioChannel(ochannel[i].name.str().c_str(),\n\t\t\t\t ochannel[i].samples.data());\n\t}\n\t\/* run csound *\/\n\tif((res = csound->PerformKsmps()) == 0) count = 0;\n\telse break;\n\t\n }\n \/* read\/write audio data *\/\n for(i = 0; i < chns; i++){\n\taudioIn[count+i] = audioRead(context,n,i);\n\taudioWrite(context,n,i,audioOut[count+i]\/scal);\n }\n \/* read analogue data \n analogue frame pos frm gets incremented according to the\n ratio analogFrames\/audioFrames.\n *\/\n frmcount = count\/nchnls;\n for(i = 0; i < an_chns; i++) {\n\tk = (int) frm;\n channel[i].samples[frmcount] = analogRead(context,k,i);\n\tanalogWriteOnce(context,k,i,ochannel[i].samples[frmcount]); \n }\t\n }\n csData->res = res;\n csData->count = count;\n }\n}\n\nvoid csound_cleanup(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n delete csData->csound;\n}\n\nMidi gMidi;\n\n\/** MIDI functions \n *\/\nint OpenMidiInDevice(CSOUND *csound, void **userData, const char *dev) {\n Midi *midi = &gMidi\n if(midi->readFrom(dev) == 1) {\n midi->enableParser(false);\n *userData = (void *) midi;\n return 0;\n }\n csoundMessage(csound, \"Could not open Midi in device %s\", dev);\n return -1;\n}\n\nint CloseMidiInDevice(CSOUND *csound, void *userData) {\n return 0;\n}\n \nint ReadMidiData(CSOUND *csound, void *userData,\n\t\t unsigned char *mbuf, int nbytes) {\n int n = 0, byte;\n if(userData) {\n Midi *midi = (Midi *) userData;\n while((byte = midi->getInput()) >= 0) {\n *mbuf++ = (unsigned char) byte;\n if(++n == nbytes) break;\n }\n return n;\n }\n return 0;\n}\n\nint OpenMidiOutDevice(CSOUND *csound, void **userData, const char *dev) {\n Midi *midi = &gMidi;\n if(midi->writeTo(dev) == 1) {\n midi->enableParser(false);\n *userData = (void *) midi;\n return 0;\n }\n csoundMessage(csound, \"Could not open Midi out device %s\", dev);\n return -1;\n}\n\nint CloseMidiOutDevice(CSOUND *csound, void *userData) {\n return 0;\n}\n\nint WriteMidiData(CSOUND *csound, void *userData,\n\t\t const unsigned char *mbuf, int nbytes) {\n if(userData) {\n Midi *midi = (Midi *) userData;\n if(midi->writeOutput((midi_byte_t *)mbuf, nbytes) > 0) return nbytes;\n return 0;\n }\n return 0;\n}\n\nvoid usage(const char *prg) {\n std::cerr << prg << \" [options]\\n\";\n Bela_usage();\n std::cerr << \" --csd=name [-f name]: CSD file name\\n\";\n std::cerr << \" --help [-h]: help message\\n\";\t \n}\n\n\/**\n Main program: takes Bela options and a --csd=<csdfile> \n option for Csound\n*\/\nint main(int argc, const char *argv[]) {\n CsData csData;\n int c;\n bool res = false;\n BelaInitSettings settings;\n const option opt[] = {{\"csd\", required_argument, NULL, 'f'},\n\t\t\t{\"help\", 0, NULL, 'h'},\n\t\t\t{NULL, 0, NULL, 0}};\n \n Bela_defaultSettings(&settings);\n settings.setup = csound_setup;\n settings.render = csound_render;\n settings.cleanup = csound_cleanup;\n settings.highPerformanceMode = 1;\n settings.interleave = 1;\n settings.analogOutputsPersist = 0;\n\n while((c = Bela_getopt_long(argc, (char **) argv, \"hf\", opt, &settings)) >= 0) {\n if (c == 'h') {\n usage(argv[0]);\n return 1;\n } else if (c == 'f') {\n csData.csdfile = optarg;\n res = true;\n } else {\n usage(argv[0]);\n return 1;\n }\n }\n \n if(res) {\n res = Bela_initAudio(&settings, &csData);\n if(!res){\n if(Bela_startAudio() == 0) {\n while(csData.res == 0)\n\t usleep(100000);\n } else\n\tstd::cerr << \"error starting audio \\n\";\n Bela_stopAudio();\n } else\n std::cerr << \"error initialising Bela \\n\";\n Bela_cleanupAudio();\n return 0;\n }\n std::cerr << \"no csd provided, use --csd=name \\n\";\n return 1;\n}\n<commit_msg>Bela main program MIDI fix<commit_after>\/*\n BelaCsound.cpp:\n\n Copyright (C) 2017 V Lazzarini\n\n This file is part of Csound.\n\n The Csound Library is free software; you can redistribute it\n and\/or modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n Csound is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with Csound; if not, write to the Free Software\n Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA\n 02111-1307 USA\n*\/\n\n#include <getopt.h>\n#include <Bela.h>\n#include <Midi.h>\n#include <csound.hpp>\n#include <plugin.h>\n#include <vector>\n#include <sstream>\n#include <iostream>\n#include <atomic>\n\n#define ANCHNS 8\n\nstatic int OpenMidiInDevice(CSOUND *csound, void **userData, const char *dev);\nstatic int CloseMidiInDevice(CSOUND *csound, void *userData);\nstatic int ReadMidiData(CSOUND *csound, void *userData, unsigned char *mbuf,\n\t\t\tint nbytes);\nstatic int OpenMidiOutDevice(CSOUND *csound, void **userData, const char *dev);\nstatic int CloseMidiOutDevice(CSOUND *csound, void *userData);\nstatic int WriteMidiData(CSOUND *csound, void *userData, const unsigned char *mbuf,\n\t\t\t int nbytes);\n\n\/** DigiIn opcode \n ksig digiInBela ipin\n asig digiInBela ipin\n*\/\nstruct DigiIn : csnd::Plugin<1, 1> {\n int pin;\n int fcount;\n int frms;\n int init_done;\n BelaContext *context;\n \n int init() {\n pin = (int) inargs[0];\n if(pin < 0 ) pin = 0;\n if(pin > 15) pin = 15;\n context = (BelaContext *) csound->host_data();\n fcount = 0;\n init_done = 0;\n frms = context->digitalFrames; \n return OK;\n }\n\n int kperf() {\n if(!init_done) {\n pinMode(context,0,pin,0);\n init_done = 1;\n }\n outargs[0] = (MYFLT) digitalRead(context,fcount,pin);\n fcount += nsmps;\n fcount %= frms;\n return OK;\n }\n\n int aperf() {\n csnd::AudioSig out(this, outargs(0));\n int cnt = fcount;\n if(!init_done) {\n pinMode(context,0,pin,0);\n init_done = 1;\n }\n for (auto &s : out) {\n s = (MYFLT) digitalRead(context,cnt,pin);\n if(cnt == frms - 1) cnt = 0;\n else cnt++;\n }\n fcount = cnt;\n return OK;\n }\n};\n\n\/** DigiOut opcode \n digiOutBela ksig,ipin\n digiOutBela asig,ipin\n*\/\nstruct DigiOut : csnd::Plugin<0, 2> {\n int pin;\n int fcount;\n int frms;\n int init_done;\n BelaContext *context;\n \n int init() {\n pin = (int) inargs[1];\n if(pin < 0 ) pin = 0;\n if(pin > 15) pin = 15;\n context = (BelaContext *) csound->host_data();\n init_done = 0;\n fcount = 0;\n frms = context->digitalFrames; \n return OK;\n }\n\n int kperf() {\n if(!init_done) {\n pinMode(context,0,pin,1);\n init_done = 1;\n }\n digitalWrite(context,fcount,pin,(inargs[0] > 0.0 ? 1 : 0));\n fcount += nsmps;\n fcount %= frms;\n return OK;\n }\n\n int aperf() {\n csnd::AudioSig in(this, inargs(0));\n int cnt = fcount;\n if(!init_done) {\n pinMode(context,0,pin,1);\n init_done = 1;\n }\n for (auto s : in) {\n digitalWriteOnce(context,cnt,pin, (s > 0.0 ? 1 : 0));\n if(cnt == frms - 1) cnt = 0;\n else cnt++;\n }\n fcount = cnt;\n return OK;\n }\n};\n\nstruct CsChan {\n std::vector<MYFLT> samples;\n std::stringstream name;\n};\n\nstruct CsData {\n Csound *csound;\n std::string csdfile;\n int blocksize;\n std::atomic_int res;\n int count;\n CsChan channel[ANCHNS];\n CsChan ochannel[ANCHNS];\n};\n\nbool csound_setup(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n Csound *csound;\n const char *args[] = { \"csound\", csData->csdfile.c_str(), \"-iadc\",\n\t\t\t \"-odac\", \"-+rtaudio=null\",\n\t\t\t \"--realtime\", \"--daemon\" };\n int numArgs = (int) (sizeof(args)\/sizeof(char *));\n\n if(context->audioInChannels != context->audioOutChannels) {\n printf(\"Error: number of audio inputs != number of audio outputs.\\n\");\n return false;\n }\n\n if(context->analogInChannels != context->analogOutChannels) {\n printf(\"Error: number of analog inputs != number of analog outputs.\\n\");\n return false;\n }\n \n \/* set up Csound *\/\n csound = new Csound();\n csData->csound = csound;\n csound->SetHostData((void *) context);\n csound->SetHostImplementedAudioIO(1,0);\n csound->SetHostImplementedMIDIIO(1);\n csound->SetExternalMidiInOpenCallback(OpenMidiInDevice);\n csound->SetExternalMidiReadCallback(ReadMidiData);\n csound->SetExternalMidiInCloseCallback(CloseMidiInDevice);\n csound->SetExternalMidiOutOpenCallback(OpenMidiOutDevice);\n csound->SetExternalMidiWriteCallback(WriteMidiData);\n csound->SetExternalMidiOutCloseCallback(CloseMidiOutDevice);\n \/* set up digi opcodes *\/\n if(csnd::plugin<DigiIn>((csnd::Csound *) csound->GetCsound(), \"digiInBela\",\n\t\t\t \"k\",\"i\", csnd::thread::ik) != 0)\n printf(\"Warning: could not add digiInBela k-rate opcode\\n\");\n if(csnd::plugin<DigiIn>((csnd::Csound *) csound->GetCsound(), \"digiInBela\",\n\t\t\t \"a\", \"i\", csnd::thread::ia) != 0)\n printf(\"Warning: could not add digiInBela a-rate opcode\\n\");\n if(csnd::plugin<DigiOut>((csnd::Csound *) csound->GetCsound(), \"digiOutBela\" ,\n\t\t\t \"\", \"ki\", csnd::thread::ik) != 0)\n printf(\"Warning: could not add digiOutBela k-rate opcode\\n\");\n if(csnd::plugin<DigiOut>((csnd::Csound *) csound->GetCsound(), \"digiOutBela\" ,\n\t\t\t \"\", \"ai\", csnd::thread::ia) != 0)\n printf(\"Warning: could not add digiOutBela a-rate opcode\\n\");\n\n \/* compile CSD *\/ \n if((csData->res = csound->Compile(numArgs, args)) != 0) {\n printf(\"Error: Csound could not compile CSD file.\\n\");\n return false;\n }\n csData->blocksize = csound->GetKsmps()*csound->GetNchnls();\n csData->count = 0;\n\n \/* set up the channels *\/\n for(int i=0; i < ANCHNS; i++) {\n csData->channel[i].samples.resize(csound->GetKsmps());\n csData->channel[i].name << \"analogIn\" << i;\n csData->ochannel[i].samples.resize(csound->GetKsmps());\n csData->ochannel[i].name << \"analogOut\" << i;\n }\n \n return true;\n}\n\nvoid csound_render(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n if(csData->res == 0) {\n int i,k,count, frmcount,blocksize,res = csData->res;\n unsigned int n;\n Csound *csound = csData->csound;\n MYFLT scal = csound->Get0dBFS();\n MYFLT* audioIn = csound->GetSpin();\n MYFLT* audioOut = csound->GetSpout();\n int nchnls = csound->GetNchnls();\n int chns = (unsigned int) nchnls < context->audioOutChannels ?\n nchnls : context->audioOutChannels;\n int an_chns = context->analogInChannels > ANCHNS ?\n ANCHNS : context->analogInChannels;\n CsChan *channel = csData->channel;\n CsChan *ochannel = csData->ochannel;\n float frm = 0.f, incr =\n ((float) context->analogFrames)\/context->audioFrames;\n count = csData->count;\n blocksize = csData->blocksize;\n \n \/* processing loop *\/\n for(n = 0; n < context->audioFrames; n++, frm+=incr, count+=nchnls){\n if(count == blocksize) {\n\t\n\t\/* set the channels *\/\n\tfor(i = 0; i < an_chns; i++) {\n csound->SetChannel(channel[i].name.str().c_str(),\n\t\t\t channel[i].samples.data());\n\t csound->GetAudioChannel(ochannel[i].name.str().c_str(),\n\t\t\t\t ochannel[i].samples.data());\n\t}\n\t\/* run csound *\/\n\tif((res = csound->PerformKsmps()) == 0) count = 0;\n\telse break;\n\t\n }\n \/* read\/write audio data *\/\n for(i = 0; i < chns; i++){\n\taudioIn[count+i] = audioRead(context,n,i);\n\taudioWrite(context,n,i,audioOut[count+i]\/scal);\n }\n \/* read analogue data \n analogue frame pos frm gets incremented according to the\n ratio analogFrames\/audioFrames.\n *\/\n frmcount = count\/nchnls;\n for(i = 0; i < an_chns; i++) {\n\tk = (int) frm;\n channel[i].samples[frmcount] = analogRead(context,k,i);\n\tanalogWriteOnce(context,k,i,ochannel[i].samples[frmcount]); \n }\t\n }\n csData->res = res;\n csData->count = count;\n }\n}\n\nvoid csound_cleanup(BelaContext *context, void *p)\n{\n CsData *csData = (CsData *) p;\n delete csData->csound;\n}\n\nstatic Midi gMidi;\n\/** MIDI functions \n *\/\nint OpenMidiInDevice(CSOUND *csound, void **userData, const char *dev) {\n Midi *midi = &gMidi\n if(midi->readFrom(dev) == 1) {\n midi->enableParser(false);\n *userData = (void *) midi;\n return 0;\n }\n csoundMessage(csound, \"Could not open Midi in device %s\", dev);\n return -1;\n}\n\nint CloseMidiInDevice(CSOUND *csound, void *userData) {\n return 0;\n}\n \nint ReadMidiData(CSOUND *csound, void *userData,\n\t\t unsigned char *mbuf, int nbytes) {\n int n = 0, byte;\n if(userData) {\n Midi *midi = (Midi *) userData;\n while((byte = midi->getInput()) >= 0) {\n *mbuf++ = (unsigned char) byte;\n if(++n == nbytes) break;\n }\n return n;\n }\n return 0;\n}\n\nint OpenMidiOutDevice(CSOUND *csound, void **userData, const char *dev) {\n Midi *midi = &gMidi;\n if(midi->writeTo(dev) == 1) {\n midi->enableParser(false);\n *userData = (void *) midi;\n return 0;\n }\n csoundMessage(csound, \"Could not open Midi out device %s\", dev);\n return -1;\n}\n\nint CloseMidiOutDevice(CSOUND *csound, void *userData) {\n return 0;\n}\n\nint WriteMidiData(CSOUND *csound, void *userData,\n\t\t const unsigned char *mbuf, int nbytes) {\n if(userData) {\n Midi *midi = (Midi *) userData;\n if(midi->writeOutput((midi_byte_t *)mbuf, nbytes) > 0) return nbytes;\n return 0;\n }\n return 0;\n}\n\nvoid usage(const char *prg) {\n std::cerr << prg << \" [options]\\n\";\n Bela_usage();\n std::cerr << \" --csd=name [-f name]: CSD file name\\n\";\n std::cerr << \" --help [-h]: help message\\n\";\t \n}\n\n\/**\n Main program: takes Bela options and a --csd=<csdfile> \n option for Csound\n*\/\nint main(int argc, const char *argv[]) {\n CsData csData;\n int c;\n bool res = false;\n BelaInitSettings settings;\n const option opt[] = {{\"csd\", required_argument, NULL, 'f'},\n\t\t\t{\"help\", 0, NULL, 'h'},\n\t\t\t{NULL, 0, NULL, 0}};\n \n Bela_defaultSettings(&settings);\n settings.setup = csound_setup;\n settings.render = csound_render;\n settings.cleanup = csound_cleanup;\n settings.highPerformanceMode = 1;\n settings.interleave = 1;\n settings.analogOutputsPersist = 0;\n\n while((c = Bela_getopt_long(argc, (char **) argv, \"hf\", opt, &settings)) >= 0) {\n if (c == 'h') {\n usage(argv[0]);\n return 1;\n } else if (c == 'f') {\n csData.csdfile = optarg;\n res = true;\n } else {\n usage(argv[0]);\n return 1;\n }\n }\n \n if(res) {\n res = Bela_initAudio(&settings, &csData);\n if(!res){\n if(Bela_startAudio() == 0) {\n while(csData.res == 0)\n\t usleep(100000);\n } else\n\tstd::cerr << \"error starting audio \\n\";\n Bela_stopAudio();\n } else\n std::cerr << \"error initialising Bela \\n\";\n Bela_cleanupAudio();\n return 0;\n }\n std::cerr << \"no csd provided, use --csd=name \\n\";\n return 1;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ CLASS HEADER\n#include \"gl-extensions.h\"\n\n\/\/ EXTERNAL INCLUDES\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n\n#include <dali\/integration-api\/debug.h>\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\nnamespace Adaptor\n{\n\nnamespace ECoreX\n{\n\nGlExtensions::GlExtensions()\n : mInitialized( false )\n{\n}\n\nGlExtensions::~GlExtensions()\n{\n}\n\n#if DALI_GLES_VERSION < 30\n\nvoid GlExtensions::DiscardFrameBuffer(GLenum target, GLsizei numAttachments, const GLenum *attachments)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_EXT_discard_framebuffer\n if( mGlDiscardFramebuffer )\n {\n mGlDiscardFramebuffer(target, numAttachments, attachments);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glDiscardFramebufferEXT extension is not available\\n\");\n }\n#endif\n}\n\nvoid GlExtensions::GetProgramBinaryOES(GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, GLvoid *binary)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_OES_get_program_binary\n if (mGlGetProgramBinaryOES)\n {\n mGlGetProgramBinaryOES(program, bufSize, length, binaryFormat, binary);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glGetProgramBinaryOES extension is not available\\n\");\n DALI_ASSERT_DEBUG(0);\n }\n#endif\n}\n\nvoid GlExtensions::ProgramBinaryOES(GLuint program, GLenum binaryFormat, const GLvoid *binary, GLint length)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_OES_get_program_binary\n if (mGlProgramBinaryOES)\n {\n mGlProgramBinaryOES(program, binaryFormat, binary, length);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glProgramBinaryOES extension is not available\\n\");\n DALI_ASSERT_DEBUG(0);\n }\n#endif\n}\n\nvoid GlExtensions::Initialize()\n{\n mInitialized = true;\n\n#ifdef GL_EXT_discard_framebuffer\n mGlDiscardFramebuffer = (PFNGLDISCARDFRAMEBUFFEREXTPROC) eglGetProcAddress(\"glDiscardFramebufferEXT\");\n#endif\n\n#ifdef GL_OES_get_program_binary\n mGlGetProgramBinaryOES = (PFNGLGETPROGRAMBINARYOESPROC) eglGetProcAddress(\"glGetProgramBinaryOES\");\n mGlProgramBinaryOES = (PFNGLPROGRAMBINARYOESPROC) eglGetProcAddress(\"glProgramBinaryOES\");\n#endif\n}\n\n#endif \/\/ DALI_GLES_VERSION < 30\n\n} \/\/ namespace ECoreX\n\n} \/\/ namespace Adaptor\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Dali\n<commit_msg>More SVACE fixes<commit_after>\/*\n * Copyright (c) 2016 Samsung Electronics Co., Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n *\/\n\n\/\/ CLASS HEADER\n#include \"gl-extensions.h\"\n\n\/\/ EXTERNAL INCLUDES\n#include <EGL\/egl.h>\n#include <EGL\/eglext.h>\n\n#include <dali\/integration-api\/debug.h>\n\nnamespace Dali\n{\n\nnamespace Internal\n{\n\nnamespace Adaptor\n{\n\nnamespace ECoreX\n{\n\nGlExtensions::GlExtensions()\n:\n#if DALI_GLES_VERSION < 30\n#ifdef GL_EXT_discard_framebuffer\n mGlDiscardFramebuffer( NULL ),\n#endif\n#ifdef GL_OES_get_program_binary\n mGlGetProgramBinaryOES( NULL ),\n mGlProgramBinaryOES( NULL ),\n#endif\n#endif \/\/ DALI_GLES_VERSION < 30\n mInitialized( false )\n{\n}\n\nGlExtensions::~GlExtensions()\n{\n}\n\n#if DALI_GLES_VERSION < 30\n\nvoid GlExtensions::DiscardFrameBuffer(GLenum target, GLsizei numAttachments, const GLenum *attachments)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_EXT_discard_framebuffer\n if( mGlDiscardFramebuffer )\n {\n mGlDiscardFramebuffer(target, numAttachments, attachments);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glDiscardFramebufferEXT extension is not available\\n\");\n }\n#endif\n}\n\nvoid GlExtensions::GetProgramBinaryOES(GLuint program, GLsizei bufSize, GLsizei *length, GLenum *binaryFormat, GLvoid *binary)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_OES_get_program_binary\n if (mGlGetProgramBinaryOES)\n {\n mGlGetProgramBinaryOES(program, bufSize, length, binaryFormat, binary);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glGetProgramBinaryOES extension is not available\\n\");\n DALI_ASSERT_DEBUG(0);\n }\n#endif\n}\n\nvoid GlExtensions::ProgramBinaryOES(GLuint program, GLenum binaryFormat, const GLvoid *binary, GLint length)\n{\n \/\/ initialize extension on first use as on some hw platforms a context\n \/\/ has to be bound for the extensions to return correct pointer\n if( !mInitialized )\n {\n Initialize();\n }\n\n#ifdef GL_OES_get_program_binary\n if (mGlProgramBinaryOES)\n {\n mGlProgramBinaryOES(program, binaryFormat, binary, length);\n }\n else\n {\n DALI_LOG_ERROR(\"Error: glProgramBinaryOES extension is not available\\n\");\n DALI_ASSERT_DEBUG(0);\n }\n#endif\n}\n\nvoid GlExtensions::Initialize()\n{\n mInitialized = true;\n\n#ifdef GL_EXT_discard_framebuffer\n mGlDiscardFramebuffer = (PFNGLDISCARDFRAMEBUFFEREXTPROC) eglGetProcAddress(\"glDiscardFramebufferEXT\");\n#endif\n\n#ifdef GL_OES_get_program_binary\n mGlGetProgramBinaryOES = (PFNGLGETPROGRAMBINARYOESPROC) eglGetProcAddress(\"glGetProgramBinaryOES\");\n mGlProgramBinaryOES = (PFNGLPROGRAMBINARYOESPROC) eglGetProcAddress(\"glProgramBinaryOES\");\n#endif\n}\n\n#endif \/\/ DALI_GLES_VERSION < 30\n\n} \/\/ namespace ECoreX\n\n} \/\/ namespace Adaptor\n\n} \/\/ namespace Internal\n\n} \/\/ namespace Dali\n<|endoftext|>"} {"text":"<commit_before>#ifndef SHARED_MEMORY_VECTOR_WRAPPER_HPP\n#define SHARED_MEMORY_VECTOR_WRAPPER_HPP\n\n#include <boost\/assert.hpp>\n\n#include <algorithm>\n#include <iterator>\n#include <type_traits>\n#include <vector>\n\nnamespace osrm\n{\nnamespace util\n{\n\ntemplate <typename DataT> class ShMemIterator : public std::iterator<std::input_iterator_tag, DataT>\n{\n DataT *p;\n\n public:\n explicit ShMemIterator(DataT *x) : p(x) {}\n ShMemIterator(const ShMemIterator &mit) : p(mit.p) {}\n ShMemIterator &operator++()\n {\n ++p;\n return *this;\n }\n ShMemIterator operator++(int)\n {\n ShMemIterator tmp(*this);\n operator++();\n return tmp;\n }\n ShMemIterator operator+(std::ptrdiff_t diff)\n {\n ShMemIterator tmp(p + diff);\n return tmp;\n }\n bool operator==(const ShMemIterator &rhs) { return p == rhs.p; }\n bool operator!=(const ShMemIterator &rhs) { return p != rhs.p; }\n DataT &operator*() { return *p; }\n};\n\ntemplate <typename DataT> class SharedMemoryWrapper\n{\n private:\n DataT *m_ptr;\n std::size_t m_size;\n\n public:\n SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}\n\n SharedMemoryWrapper(DataT *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}\n\n void swap(SharedMemoryWrapper<DataT> &other)\n {\n \/\/ BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, \"size invalid\");\n std::swap(m_size, other.m_size);\n std::swap(m_ptr, other.m_ptr);\n }\n\n DataT &at(const std::size_t index) { return m_ptr[index]; }\n\n const DataT &at(const std::size_t index) const { return m_ptr[index]; }\n\n ShMemIterator<DataT> begin() const { return ShMemIterator<DataT>(m_ptr); }\n\n ShMemIterator<DataT> end() const { return ShMemIterator<DataT>(m_ptr + m_size); }\n\n std::size_t size() const { return m_size; }\n\n bool empty() const { return 0 == size(); }\n\n DataT &operator[](const unsigned index)\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n return m_ptr[index];\n }\n\n const DataT &operator[](const unsigned index) const\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n return m_ptr[index];\n }\n};\n\ntemplate <> class SharedMemoryWrapper<bool>\n{\n private:\n unsigned *m_ptr;\n std::size_t m_size;\n\n public:\n SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}\n\n SharedMemoryWrapper(unsigned *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}\n\n void swap(SharedMemoryWrapper<bool> &other)\n {\n \/\/ BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, \"size invalid\");\n std::swap(m_size, other.m_size);\n std::swap(m_ptr, other.m_ptr);\n }\n\n bool at(const std::size_t index) const\n {\n const std::size_t bucket = index \/ 32;\n const unsigned offset = static_cast<unsigned>(index % 32);\n return m_ptr[bucket] & (1 << offset);\n }\n\n std::size_t size() const { return m_size; }\n\n bool empty() const { return 0 == size(); }\n\n bool operator[](const unsigned index)\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n const unsigned bucket = index \/ 32;\n const unsigned offset = index % 32;\n return m_ptr[bucket] & (1 << offset);\n }\n};\n\ntemplate <typename DataT, bool UseSharedMemory> struct ShM\n{\n using vector = typename std::conditional<UseSharedMemory,\n SharedMemoryWrapper<DataT>,\n std::vector<DataT>>::type;\n};\n}\n}\n\n#endif \/\/ SHARED_MEMORY_VECTOR_WRAPPER_HPP\n<commit_msg>Fixes shared memory wrapper includes<commit_after>#ifndef SHARED_MEMORY_VECTOR_WRAPPER_HPP\n#define SHARED_MEMORY_VECTOR_WRAPPER_HPP\n\n#include <boost\/assert.hpp>\n\n#include <cstddef>\n\n#include <algorithm>\n#include <iterator>\n#include <type_traits>\n#include <vector>\n#include <utility>\n\nnamespace osrm\n{\nnamespace util\n{\n\ntemplate <typename DataT> class ShMemIterator : public std::iterator<std::input_iterator_tag, DataT>\n{\n DataT *p;\n\n public:\n explicit ShMemIterator(DataT *x) : p(x) {}\n ShMemIterator(const ShMemIterator &mit) : p(mit.p) {}\n ShMemIterator &operator++()\n {\n ++p;\n return *this;\n }\n ShMemIterator operator++(int)\n {\n ShMemIterator tmp(*this);\n operator++();\n return tmp;\n }\n ShMemIterator operator+(std::ptrdiff_t diff)\n {\n ShMemIterator tmp(p + diff);\n return tmp;\n }\n bool operator==(const ShMemIterator &rhs) { return p == rhs.p; }\n bool operator!=(const ShMemIterator &rhs) { return p != rhs.p; }\n DataT &operator*() { return *p; }\n};\n\ntemplate <typename DataT> class SharedMemoryWrapper\n{\n private:\n DataT *m_ptr;\n std::size_t m_size;\n\n public:\n SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}\n\n SharedMemoryWrapper(DataT *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}\n\n void swap(SharedMemoryWrapper<DataT> &other)\n {\n \/\/ BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, \"size invalid\");\n std::swap(m_size, other.m_size);\n std::swap(m_ptr, other.m_ptr);\n }\n\n DataT &at(const std::size_t index) { return m_ptr[index]; }\n\n const DataT &at(const std::size_t index) const { return m_ptr[index]; }\n\n ShMemIterator<DataT> begin() const { return ShMemIterator<DataT>(m_ptr); }\n\n ShMemIterator<DataT> end() const { return ShMemIterator<DataT>(m_ptr + m_size); }\n\n std::size_t size() const { return m_size; }\n\n bool empty() const { return 0 == size(); }\n\n DataT &operator[](const unsigned index)\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n return m_ptr[index];\n }\n\n const DataT &operator[](const unsigned index) const\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n return m_ptr[index];\n }\n};\n\ntemplate <> class SharedMemoryWrapper<bool>\n{\n private:\n unsigned *m_ptr;\n std::size_t m_size;\n\n public:\n SharedMemoryWrapper() : m_ptr(nullptr), m_size(0) {}\n\n SharedMemoryWrapper(unsigned *ptr, std::size_t size) : m_ptr(ptr), m_size(size) {}\n\n void swap(SharedMemoryWrapper<bool> &other)\n {\n \/\/ BOOST_ASSERT_MSG(m_size != 0 || other.size() != 0, \"size invalid\");\n std::swap(m_size, other.m_size);\n std::swap(m_ptr, other.m_ptr);\n }\n\n bool at(const std::size_t index) const\n {\n const std::size_t bucket = index \/ 32;\n const unsigned offset = static_cast<unsigned>(index % 32);\n return m_ptr[bucket] & (1 << offset);\n }\n\n std::size_t size() const { return m_size; }\n\n bool empty() const { return 0 == size(); }\n\n bool operator[](const unsigned index)\n {\n BOOST_ASSERT_MSG(index < m_size, \"invalid size\");\n const unsigned bucket = index \/ 32;\n const unsigned offset = index % 32;\n return m_ptr[bucket] & (1 << offset);\n }\n};\n\ntemplate <typename DataT, bool UseSharedMemory> struct ShM\n{\n using vector = typename std::conditional<UseSharedMemory,\n SharedMemoryWrapper<DataT>,\n std::vector<DataT>>::type;\n};\n}\n}\n\n#endif \/\/ SHARED_MEMORY_VECTOR_WRAPPER_HPP\n<|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <svtools\/PlaceEditDialog.hxx>\n#include <svtools\/ServerDetailsControls.hxx>\n\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <officecfg\/Office\/Common.hxx>\n#include <svtools\/svtresid.hxx>\n#include <vcl\/msgbox.hxx>\n\nusing namespace com::sun::star::uno;\n\nPlaceEditDialog::PlaceEditDialog(vcl::Window* pParent)\n : ModalDialog(pParent, \"PlaceEditDialog\", \"svt\/ui\/placeedit.ui\")\n , m_xCurrentDetails()\n , m_nCurrentType( 0 )\n{\n get( m_pEDServerName, \"name\" );\n get( m_pLBServerType, \"type\" );\n get( m_pEDUsername, \"login\" );\n get( m_pBTOk, \"ok\" );\n get( m_pBTCancel, \"cancel\" );\n get( m_pBTDelete, \"delete\" );\n get( m_pBTRepoRefresh, \"repositoriesRefresh\" );\n\n m_pBTOk->SetClickHdl( LINK( this, PlaceEditDialog, OKHdl) );\n m_pBTOk->Enable( false );\n\n m_pEDServerName->SetModifyHdl( LINK( this, PlaceEditDialog, EditHdl) );\n\n \/\/ This constructor is called when user request a place creation, so\n \/\/ delete button is hidden.\n m_pBTDelete->Hide();\n\n m_pLBServerType->SetSelectHdl( LINK( this, PlaceEditDialog, SelectTypeHdl ) );\n m_pEDUsername->SetModifyHdl( LINK( this, PlaceEditDialog, EditUsernameHdl ) );\n\n InitDetails( );\n}\n\nPlaceEditDialog::PlaceEditDialog(vcl::Window* pParent, const std::shared_ptr<Place>& rPlace)\n : ModalDialog(pParent, \"PlaceEditDialog\", \"svt\/ui\/placeedit.ui\")\n , m_xCurrentDetails( )\n{\n get( m_pEDServerName, \"name\" );\n get( m_pLBServerType, \"type\" );\n get( m_pEDUsername, \"login\" );\n get( m_pBTOk, \"ok\" );\n get( m_pBTCancel, \"cancel\" );\n get( m_pBTDelete, \"delete\" );\n get( m_pTypeGrid, \"TypeGrid\" );\n\n m_pBTOk->SetClickHdl( LINK( this, PlaceEditDialog, OKHdl) );\n m_pBTDelete->SetClickHdl ( LINK( this, PlaceEditDialog, DelHdl) );\n\n m_pEDServerName->SetModifyHdl( LINK( this, PlaceEditDialog, EditHdl) );\n m_pLBServerType->SetSelectHdl( LINK( this, PlaceEditDialog, SelectTypeHdl ) );\n\n InitDetails( );\n\n m_pEDServerName->SetText(rPlace->GetName());\n\n \/\/ Fill the boxes with the URL parts\n bool bSuccess = false;\n for (size_t i = 0 ; i < m_aDetailsContainers.size( ) && !bSuccess; ++i)\n {\n INetURLObject& rUrl = rPlace->GetUrlObject();\n bSuccess = m_aDetailsContainers[i]->setUrl( rUrl );\n if ( bSuccess )\n {\n m_pLBServerType->SelectEntryPos( i );\n SelectTypeHdl( m_pLBServerType );\n\n \/\/ Fill the Username field\n if ( rUrl.HasUserData( ) )\n m_pEDUsername->SetText( INetURLObject::decode( rUrl.GetUser( ),\n INetURLObject::DECODE_WITH_CHARSET ) );\n }\n }\n\n \/\/ In edit mode user can't change connection type\n m_pTypeGrid->Hide();\n}\n\nPlaceEditDialog::~PlaceEditDialog()\n{\n disposeOnce();\n}\n\nvoid PlaceEditDialog::dispose()\n{\n m_pEDServerName.clear();\n m_pLBServerType.clear();\n m_pEDUsername.clear();\n m_pBTOk.clear();\n m_pBTCancel.clear();\n m_pBTDelete.clear();\n ModalDialog::dispose();\n}\n\nOUString PlaceEditDialog::GetServerUrl()\n{\n OUString sUrl;\n if (m_xCurrentDetails.get())\n {\n INetURLObject aUrl = m_xCurrentDetails->getUrl();\n OUString sUsername = OUString( m_pEDUsername->GetText( ) ).trim( );\n if ( !sUsername.isEmpty( ) )\n aUrl.SetUser( sUsername );\n if ( !aUrl.HasError( ) )\n sUrl = aUrl.GetMainURL( INetURLObject::NO_DECODE );\n }\n\n return sUrl;\n}\n\nstd::shared_ptr<Place> PlaceEditDialog::GetPlace()\n{\n return std::make_shared<Place>(m_pEDServerName->GetText(), GetServerUrl(), true);\n}\n\nvoid PlaceEditDialog::InitDetails( )\n{\n \/\/ Create CMIS controls for each server type\n\n Reference< XComponentContext > xContext = ::comphelper::getProcessComponentContext();\n\n \/\/ Load the ServerType entries\n bool bSkipGDrive = OUString( GDRIVE_CLIENT_ID ).isEmpty() ||\n OUString( GDRIVE_CLIENT_SECRET ).isEmpty();\n bool bSkipAlfresco = OUString( ALFRESCO_CLOUD_CLIENT_ID ).isEmpty() ||\n OUString( ALFRESCO_CLOUD_CLIENT_SECRET ).isEmpty();\n bool bSkipOneDrive= OUString( ONEDRIVE_CLIENT_ID ).isEmpty() ||\n OUString( ONEDRIVE_CLIENT_SECRET ).isEmpty();\n\n\n Sequence< OUString > aTypesUrlsList( officecfg::Office::Common::Misc::CmisServersUrls::get( xContext ) );\n Sequence< OUString > aTypesNamesList( officecfg::Office::Common::Misc::CmisServersNames::get( xContext ) );\n\n unsigned int nPos = 0;\n for ( sal_Int32 i = 0; i < aTypesUrlsList.getLength( ) && aTypesNamesList.getLength( ); ++i )\n {\n OUString sUrl = aTypesUrlsList[i];\n if ( !( sUrl == GDRIVE_BASE_URL && bSkipGDrive ) &&\n !( sUrl.startsWith( ALFRESCO_CLOUD_BASE_URL ) && bSkipAlfresco ) &&\n !( sUrl == ONEDRIVE_BASE_URL && bSkipOneDrive ) )\n {\n nPos = m_pLBServerType->InsertEntry( aTypesNamesList[i], nPos );\n\n std::shared_ptr<DetailsContainer> xCmisDetails(std::make_shared<CmisDetailsContainer>(this, sUrl));\n xCmisDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xCmisDetails);\n\n nPos++;\n }\n }\n\n \/\/ Create WebDAV \/ FTP \/ SSH details control\n std::shared_ptr<DetailsContainer> xDavDetails(std::make_shared<DavDetailsContainer>(this));\n xDavDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xDavDetails);\n\n std::shared_ptr<DetailsContainer> xFtpDetails(std::make_shared<HostDetailsContainer>(this, 21, \"ftp\"));\n xFtpDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xFtpDetails);\n\n std::shared_ptr<DetailsContainer> xSshDetails(std::make_shared<HostDetailsContainer>(this, 22, \"ssh\"));\n xSshDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xSshDetails);\n\n \/\/ Create Windows Share control\n std::shared_ptr<DetailsContainer> xSmbDetails(std::make_shared<SmbDetailsContainer>(this));\n xSmbDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xSmbDetails);\n\n \/\/ Set default to first value\n m_pLBServerType->SelectEntryPos( 0 );\n SelectTypeHdl( m_pLBServerType );\n}\n\nIMPL_LINK ( PlaceEditDialog, OKHdl, Button *, )\n{\n if ( m_xCurrentDetails.get() )\n {\n OUString sUrl = m_xCurrentDetails->getUrl().GetHost( INetURLObject::DECODE_WITH_CHARSET );\n OUString sGDriveHost( GDRIVE_BASE_URL );\n OUString sAlfrescoHost( ALFRESCO_CLOUD_BASE_URL );\n OUString sOneDriveHost( ONEDRIVE_BASE_URL );\n\n if ( sUrl.compareTo( sGDriveHost, sGDriveHost.getLength() ) == 0\n || sUrl.compareTo( sAlfrescoHost, sAlfrescoHost.getLength() ) == 0\n || sUrl.compareTo( sOneDriveHost, sOneDriveHost.getLength() ) == 0 )\n {\n m_pBTRepoRefresh->Click();\n\n sUrl = m_xCurrentDetails->getUrl().GetHost( INetURLObject::DECODE_WITH_CHARSET );\n INetURLObject aHostUrl( sUrl );\n OUString sRepoId = aHostUrl.GetMark();\n\n if ( !sRepoId.isEmpty() )\n {\n EndDialog( RET_OK );\n }\n else\n {\n \/\/ TODO: repository id missing. Auth error?\n }\n }\n else\n {\n EndDialog( RET_OK );\n }\n }\n\n return 1;\n}\n\nIMPL_LINK ( PlaceEditDialog, DelHdl, Button *, )\n{\n \/\/ ReUsing existing symbols...\n EndDialog( RET_NO );\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, EditHdl )\n{\n OUString sUrl = GetServerUrl( );\n OUString sName = OUString( m_pEDServerName->GetText() ).trim( );\n m_pBTOk->Enable( !sName.isEmpty( ) && !sUrl.isEmpty( ) );\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, EditUsernameHdl )\n{\n for ( std::vector< std::shared_ptr< DetailsContainer > >::iterator it = m_aDetailsContainers.begin( );\n it != m_aDetailsContainers.end( ); ++it )\n {\n ( *it )->setUsername( OUString( m_pEDUsername->GetText() ) );\n }\n EditHdl(NULL);\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, SelectTypeHdl )\n{\n if ( m_pLBServerType->GetSelectEntry() == \"--------------------\" )\n {\n if( !m_pLBServerType->IsTravelSelect() )\n m_pLBServerType->SelectEntryPos( m_nCurrentType );\n else\n m_pLBServerType->SetNoSelection();\n\n return 0;\n }\n\n if (m_xCurrentDetails.get())\n m_xCurrentDetails->show(false);\n\n sal_uInt16 nPos = m_pLBServerType->GetSelectEntryPos( );\n m_xCurrentDetails = m_aDetailsContainers[nPos];\n m_nCurrentType = nPos;\n\n m_xCurrentDetails->show(true);\n\n SetSizePixel(GetOptimalSize());\n\n EditHdl(NULL);\n\n return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<commit_msg>Separator should not be the default selection<commit_after>\/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- *\/\n\/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include <svtools\/PlaceEditDialog.hxx>\n#include <svtools\/ServerDetailsControls.hxx>\n\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <officecfg\/Office\/Common.hxx>\n#include <svtools\/svtresid.hxx>\n#include <vcl\/msgbox.hxx>\n\nusing namespace com::sun::star::uno;\n\nPlaceEditDialog::PlaceEditDialog(vcl::Window* pParent)\n : ModalDialog(pParent, \"PlaceEditDialog\", \"svt\/ui\/placeedit.ui\")\n , m_xCurrentDetails()\n , m_nCurrentType( 0 )\n{\n get( m_pEDServerName, \"name\" );\n get( m_pLBServerType, \"type\" );\n get( m_pEDUsername, \"login\" );\n get( m_pBTOk, \"ok\" );\n get( m_pBTCancel, \"cancel\" );\n get( m_pBTDelete, \"delete\" );\n get( m_pBTRepoRefresh, \"repositoriesRefresh\" );\n\n m_pBTOk->SetClickHdl( LINK( this, PlaceEditDialog, OKHdl) );\n m_pBTOk->Enable( false );\n\n m_pEDServerName->SetModifyHdl( LINK( this, PlaceEditDialog, EditHdl) );\n\n \/\/ This constructor is called when user request a place creation, so\n \/\/ delete button is hidden.\n m_pBTDelete->Hide();\n\n m_pLBServerType->SetSelectHdl( LINK( this, PlaceEditDialog, SelectTypeHdl ) );\n m_pEDUsername->SetModifyHdl( LINK( this, PlaceEditDialog, EditUsernameHdl ) );\n\n InitDetails( );\n}\n\nPlaceEditDialog::PlaceEditDialog(vcl::Window* pParent, const std::shared_ptr<Place>& rPlace)\n : ModalDialog(pParent, \"PlaceEditDialog\", \"svt\/ui\/placeedit.ui\")\n , m_xCurrentDetails( )\n{\n get( m_pEDServerName, \"name\" );\n get( m_pLBServerType, \"type\" );\n get( m_pEDUsername, \"login\" );\n get( m_pBTOk, \"ok\" );\n get( m_pBTCancel, \"cancel\" );\n get( m_pBTDelete, \"delete\" );\n get( m_pTypeGrid, \"TypeGrid\" );\n\n m_pBTOk->SetClickHdl( LINK( this, PlaceEditDialog, OKHdl) );\n m_pBTDelete->SetClickHdl ( LINK( this, PlaceEditDialog, DelHdl) );\n\n m_pEDServerName->SetModifyHdl( LINK( this, PlaceEditDialog, EditHdl) );\n m_pLBServerType->SetSelectHdl( LINK( this, PlaceEditDialog, SelectTypeHdl ) );\n\n InitDetails( );\n\n m_pEDServerName->SetText(rPlace->GetName());\n\n \/\/ Fill the boxes with the URL parts\n bool bSuccess = false;\n for (size_t i = 0 ; i < m_aDetailsContainers.size( ) && !bSuccess; ++i)\n {\n INetURLObject& rUrl = rPlace->GetUrlObject();\n bSuccess = m_aDetailsContainers[i]->setUrl( rUrl );\n if ( bSuccess )\n {\n m_pLBServerType->SelectEntryPos( i );\n SelectTypeHdl( m_pLBServerType );\n\n \/\/ Fill the Username field\n if ( rUrl.HasUserData( ) )\n m_pEDUsername->SetText( INetURLObject::decode( rUrl.GetUser( ),\n INetURLObject::DECODE_WITH_CHARSET ) );\n }\n }\n\n \/\/ In edit mode user can't change connection type\n m_pTypeGrid->Hide();\n}\n\nPlaceEditDialog::~PlaceEditDialog()\n{\n disposeOnce();\n}\n\nvoid PlaceEditDialog::dispose()\n{\n m_pEDServerName.clear();\n m_pLBServerType.clear();\n m_pEDUsername.clear();\n m_pBTOk.clear();\n m_pBTCancel.clear();\n m_pBTDelete.clear();\n ModalDialog::dispose();\n}\n\nOUString PlaceEditDialog::GetServerUrl()\n{\n OUString sUrl;\n if (m_xCurrentDetails.get())\n {\n INetURLObject aUrl = m_xCurrentDetails->getUrl();\n OUString sUsername = OUString( m_pEDUsername->GetText( ) ).trim( );\n if ( !sUsername.isEmpty( ) )\n aUrl.SetUser( sUsername );\n if ( !aUrl.HasError( ) )\n sUrl = aUrl.GetMainURL( INetURLObject::NO_DECODE );\n }\n\n return sUrl;\n}\n\nstd::shared_ptr<Place> PlaceEditDialog::GetPlace()\n{\n return std::make_shared<Place>(m_pEDServerName->GetText(), GetServerUrl(), true);\n}\n\nvoid PlaceEditDialog::InitDetails( )\n{\n \/\/ Create CMIS controls for each server type\n\n Reference< XComponentContext > xContext = ::comphelper::getProcessComponentContext();\n\n \/\/ Load the ServerType entries\n bool bSkipGDrive = OUString( GDRIVE_CLIENT_ID ).isEmpty() ||\n OUString( GDRIVE_CLIENT_SECRET ).isEmpty();\n bool bSkipAlfresco = OUString( ALFRESCO_CLOUD_CLIENT_ID ).isEmpty() ||\n OUString( ALFRESCO_CLOUD_CLIENT_SECRET ).isEmpty();\n bool bSkipOneDrive= OUString( ONEDRIVE_CLIENT_ID ).isEmpty() ||\n OUString( ONEDRIVE_CLIENT_SECRET ).isEmpty();\n\n Sequence< OUString > aTypesUrlsList( officecfg::Office::Common::Misc::CmisServersUrls::get( xContext ) );\n Sequence< OUString > aTypesNamesList( officecfg::Office::Common::Misc::CmisServersNames::get( xContext ) );\n\n unsigned int nPos = 0;\n for ( sal_Int32 i = 0; i < aTypesUrlsList.getLength( ) && aTypesNamesList.getLength( ); ++i )\n {\n OUString sUrl = aTypesUrlsList[i];\n if ( !( sUrl == GDRIVE_BASE_URL && bSkipGDrive ) &&\n !( sUrl.startsWith( ALFRESCO_CLOUD_BASE_URL ) && bSkipAlfresco ) &&\n !( sUrl == ONEDRIVE_BASE_URL && bSkipOneDrive ) )\n {\n nPos = m_pLBServerType->InsertEntry( aTypesNamesList[i], nPos );\n\n std::shared_ptr<DetailsContainer> xCmisDetails(std::make_shared<CmisDetailsContainer>(this, sUrl));\n xCmisDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xCmisDetails);\n\n nPos++;\n }\n }\n\n \/\/ Create WebDAV \/ FTP \/ SSH details control\n std::shared_ptr<DetailsContainer> xDavDetails(std::make_shared<DavDetailsContainer>(this));\n xDavDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xDavDetails);\n\n std::shared_ptr<DetailsContainer> xFtpDetails(std::make_shared<HostDetailsContainer>(this, 21, \"ftp\"));\n xFtpDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xFtpDetails);\n\n std::shared_ptr<DetailsContainer> xSshDetails(std::make_shared<HostDetailsContainer>(this, 22, \"ssh\"));\n xSshDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xSshDetails);\n\n \/\/ Create Windows Share control\n std::shared_ptr<DetailsContainer> xSmbDetails(std::make_shared<SmbDetailsContainer>(this));\n xSmbDetails->setChangeHdl( LINK( this, PlaceEditDialog, EditHdl ) );\n m_aDetailsContainers.push_back(xSmbDetails);\n\n \/\/ Set default to first value\n m_pLBServerType->SelectEntryPos( 0 );\n\n if ( m_pLBServerType->GetSelectEntry() == \"--------------------\" )\n m_pLBServerType->SelectEntryPos( 1 );\n\n SelectTypeHdl( m_pLBServerType );\n}\n\nIMPL_LINK ( PlaceEditDialog, OKHdl, Button *, )\n{\n if ( m_xCurrentDetails.get() )\n {\n OUString sUrl = m_xCurrentDetails->getUrl().GetHost( INetURLObject::DECODE_WITH_CHARSET );\n OUString sGDriveHost( GDRIVE_BASE_URL );\n OUString sAlfrescoHost( ALFRESCO_CLOUD_BASE_URL );\n OUString sOneDriveHost( ONEDRIVE_BASE_URL );\n\n if ( sUrl.compareTo( sGDriveHost, sGDriveHost.getLength() ) == 0\n || sUrl.compareTo( sAlfrescoHost, sAlfrescoHost.getLength() ) == 0\n || sUrl.compareTo( sOneDriveHost, sOneDriveHost.getLength() ) == 0 )\n {\n m_pBTRepoRefresh->Click();\n\n sUrl = m_xCurrentDetails->getUrl().GetHost( INetURLObject::DECODE_WITH_CHARSET );\n INetURLObject aHostUrl( sUrl );\n OUString sRepoId = aHostUrl.GetMark();\n\n if ( !sRepoId.isEmpty() )\n {\n EndDialog( RET_OK );\n }\n else\n {\n \/\/ TODO: repository id missing. Auth error?\n }\n }\n else\n {\n EndDialog( RET_OK );\n }\n }\n\n return 1;\n}\n\nIMPL_LINK ( PlaceEditDialog, DelHdl, Button *, )\n{\n \/\/ ReUsing existing symbols...\n EndDialog( RET_NO );\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, EditHdl )\n{\n OUString sUrl = GetServerUrl( );\n OUString sName = OUString( m_pEDServerName->GetText() ).trim( );\n m_pBTOk->Enable( !sName.isEmpty( ) && !sUrl.isEmpty( ) );\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, EditUsernameHdl )\n{\n for ( std::vector< std::shared_ptr< DetailsContainer > >::iterator it = m_aDetailsContainers.begin( );\n it != m_aDetailsContainers.end( ); ++it )\n {\n ( *it )->setUsername( OUString( m_pEDUsername->GetText() ) );\n }\n EditHdl(NULL);\n return 1;\n}\n\nIMPL_LINK_NOARG( PlaceEditDialog, SelectTypeHdl )\n{\n if ( m_pLBServerType->GetSelectEntry() == \"--------------------\" )\n {\n if( !m_pLBServerType->IsTravelSelect() )\n m_pLBServerType->SelectEntryPos( m_nCurrentType );\n else\n m_pLBServerType->SetNoSelection();\n\n return 0;\n }\n\n if (m_xCurrentDetails.get())\n m_xCurrentDetails->show(false);\n\n sal_uInt16 nPos = m_pLBServerType->GetSelectEntryPos( );\n m_xCurrentDetails = m_aDetailsContainers[nPos];\n m_nCurrentType = nPos;\n\n m_xCurrentDetails->show(true);\n\n SetSizePixel(GetOptimalSize());\n\n EditHdl(NULL);\n\n return 0;\n}\n\n\/* vim:set shiftwidth=4 softtabstop=4 expandtab: *\/\n<|endoftext|>"} {"text":"<commit_before><commit_msg>clear<commit_after><|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"cdbsymbolpathlisteditor.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <utils\/pathchooser.h>\n#include <utils\/checkablemessagebox.h>\n\n#include <symbolpathsdialog.h>\n\n#include <QCheckBox>\n#include <QDir>\n#include <QDebug>\n#include <QAction>\n#include <QFormLayout>\n#include <QLabel>\n\nnamespace Debugger {\nnamespace Internal {\n\nCacheDirectoryDialog::CacheDirectoryDialog(QWidget *parent) :\n QDialog(parent), m_chooser(new Utils::PathChooser),\n m_buttonBox(new QDialogButtonBox(QDialogButtonBox::Ok|QDialogButtonBox::Cancel))\n{\n setWindowTitle(tr(\"Select Local Cache Folder\"));\n setModal(true);\n setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n\n QFormLayout *formLayout = new QFormLayout;\n m_chooser->setExpectedKind(Utils::PathChooser::ExistingDirectory);\n m_chooser->setMinimumWidth(400);\n formLayout->addRow(tr(\"Path:\"), m_chooser);\n\n QVBoxLayout *mainLayout = new QVBoxLayout;\n mainLayout->addLayout(formLayout);\n mainLayout->addWidget(m_buttonBox);\n\n setLayout(mainLayout);\n\n connect(m_buttonBox, SIGNAL(accepted()), this, SLOT(accept()));\n connect(m_buttonBox, SIGNAL(rejected()), this, SLOT(reject()));\n}\n\nvoid CacheDirectoryDialog::setPath(const QString &p)\n{\n m_chooser->setPath(p);\n}\n\nQString CacheDirectoryDialog::path() const\n{\n return m_chooser->path();\n}\n\nvoid CacheDirectoryDialog::accept()\n{\n QString cache = path();\n \/\/ if cache is empty a default is used by the cdb\n if (cache.isEmpty()) {\n QDialog::accept();\n return;\n }\n \/\/ Ensure path exists\n QFileInfo fi(cache);\n \/\/ Folder exists - all happy.\n if (fi.isDir()) {\n QDialog::accept();\n return;\n }\n \/\/ Does a file of the same name exist?\n if (fi.exists()) {\n QMessageBox::warning(this, tr(\"Already Exists\"),\n tr(\"A file named '%1' already exists.\").arg(cache));\n return;\n }\n \/\/ Create\n QDir root(QDir::root());\n if (!root.mkpath(cache)) {\n QMessageBox::warning(this, tr(\"Cannot Create\"),\n tr(\"The folder '%1' could not be created.\").arg(cache));\n return;\n }\n QDialog::accept();\n}\n\n\/\/ ---------------- CdbSymbolPathListEditor\n\nconst char *CdbSymbolPathListEditor::symbolServerPrefixC = \"srv*\";\nconst char *CdbSymbolPathListEditor::symbolServerPostfixC = \"http:\/\/msdl.microsoft.com\/download\/symbols\";\nconst char *CdbSymbolPathListEditor::symbolCachePrefixC = \"cache*\";\n\nCdbSymbolPathListEditor::CdbSymbolPathListEditor(QWidget *parent) :\n Utils::PathListEditor(parent)\n{\n \/\/! Add Microsoft Symbol server connection\n QAction *action = insertAction(lastAddActionIndex() + 1, tr(\"Symbol Server...\"), this, SLOT(addSymbolServer()));\n action->setToolTip(tr(\"Adds the Microsoft symbol server providing symbols for operating system libraries.\"\n \"Requires specifying a local cache directory.\"));\n action = insertAction(lastAddActionIndex() + 1, tr(\"Symbol Cache...\"), this, SLOT(addSymbolCache()));\n action->setToolTip(tr(\"Uses a directory to cache symbols used by the debugger.\"));\n}\n\nbool CdbSymbolPathListEditor::promptCacheDirectory(QWidget *parent, QString *cacheDirectory)\n{\n CacheDirectoryDialog dialog(parent);\n dialog.setPath(QDir::tempPath() + QDir::separator() + QLatin1String(\"symbolcache\"));\n if (dialog.exec() != QDialog::Accepted)\n return false;\n *cacheDirectory = dialog.path();\n return true;\n}\n\nvoid CdbSymbolPathListEditor::addSymbolServer()\n{\n addSymbolPath(SymbolServerPath);\n}\n\nvoid CdbSymbolPathListEditor::addSymbolCache()\n{\n addSymbolPath(SymbolCachePath);\n}\n\nvoid CdbSymbolPathListEditor::addSymbolPath(CdbSymbolPathListEditor::SymbolPathMode mode)\n{\n QString cacheDir;\n if (promptCacheDirectory(this, &cacheDir))\n insertPathAtCursor(CdbSymbolPathListEditor::symbolPath(cacheDir, mode));\n}\n\nQString CdbSymbolPathListEditor::symbolPath(const QString &cacheDir,\n CdbSymbolPathListEditor::SymbolPathMode mode)\n{\n if (mode == SymbolCachePath)\n return QLatin1String(symbolCachePrefixC) + QDir::toNativeSeparators(cacheDir);\n QString s = QLatin1String(symbolServerPrefixC);\n if (!cacheDir.isEmpty())\n s += QDir::toNativeSeparators(cacheDir) + QLatin1String(\"*\");\n s += QLatin1String(symbolServerPostfixC);\n return s;\n}\n\nbool CdbSymbolPathListEditor::isSymbolServerPath(const QString &path, QString *cacheDir \/* = 0 *\/)\n{\n if (!path.startsWith(QLatin1String(symbolServerPrefixC)) || !path.endsWith(QLatin1String(symbolServerPostfixC)))\n return false;\n if (cacheDir) {\n static const unsigned prefixLength = qstrlen(symbolServerPrefixC);\n static const unsigned postfixLength = qstrlen(symbolServerPostfixC);\n if (path.length() == prefixLength + postfixLength)\n return true;\n \/\/ Split apart symbol server post\/prefixes\n *cacheDir = path.mid(prefixLength, path.size() - prefixLength - qstrlen(symbolServerPostfixC) + 1);\n }\n return true;\n}\n\nbool CdbSymbolPathListEditor::isSymbolCachePath(const QString &path, QString *cacheDir)\n{\n if (!path.startsWith(QLatin1String(symbolCachePrefixC)))\n return false;\n if (cacheDir) {\n static const unsigned prefixLength = qstrlen(symbolCachePrefixC);\n \/\/ Split apart symbol cach prefixes\n *cacheDir = path.mid(prefixLength);\n }\n return true;\n}\n\nint CdbSymbolPathListEditor::indexOfSymbolPath(const QStringList &paths,\n CdbSymbolPathListEditor::SymbolPathMode mode,\n QString *cacheDir \/* = 0 *\/)\n{\n const int count = paths.size();\n for (int i = 0; i < count; i++) {\n if (mode == SymbolServerPath\n ? CdbSymbolPathListEditor::isSymbolServerPath(paths.at(i), cacheDir)\n : CdbSymbolPathListEditor::isSymbolCachePath(paths.at(i), cacheDir)) {\n return i;\n }\n }\n return -1;\n}\n\nbool CdbSymbolPathListEditor::promptToAddSymbolPaths(const QString &settingsGroup,\n QStringList *symbolPaths)\n{\n const int indexOfSymbolServer =\n CdbSymbolPathListEditor::indexOfSymbolPath(*symbolPaths, SymbolServerPath);\n const int indexOfSymbolCache =\n CdbSymbolPathListEditor::indexOfSymbolPath(*symbolPaths, SymbolCachePath);\n\n if (!qgetenv(\"_NT_SYMBOL_PATH\").isEmpty()\n || (indexOfSymbolServer != -1 && indexOfSymbolCache != -1))\n return false;\n\n const QString nagSymbolServerKey = settingsGroup + QLatin1String(\"\/NoPromptSymbolCache\");\n bool noFurtherNagging = Core::ICore::settings()->value(nagSymbolServerKey, false).toBool();\n if (noFurtherNagging)\n return false;\n\n QString path;\n if (indexOfSymbolServer != -1)\n path = symbolPaths->at(indexOfSymbolServer);\n if (path.isEmpty() && indexOfSymbolCache != -1)\n path = symbolPaths->at(indexOfSymbolCache);\n if (path.isEmpty())\n path = QDir::tempPath() + QDir::separator() + QLatin1String(\"symbolcache\");\n\n bool useSymbolServer = true;\n bool useSymbolCache = true;\n bool addSymbolPaths = SymbolPathsDialog::useCommonSymbolPaths(useSymbolCache,\n useSymbolServer,\n path, noFurtherNagging);\n Core::ICore::settings()->setValue(nagSymbolServerKey, noFurtherNagging);\n if (!addSymbolPaths)\n return false;\n\n \/\/ remove old entries\n if (indexOfSymbolServer > indexOfSymbolCache) {\n symbolPaths->removeAt(indexOfSymbolServer);\n if (indexOfSymbolCache != -1)\n symbolPaths->removeAt(indexOfSymbolCache);\n } else if (indexOfSymbolCache > indexOfSymbolServer) {\n symbolPaths->removeAt(indexOfSymbolCache);\n if (indexOfSymbolServer != -1)\n symbolPaths->removeAt(indexOfSymbolServer);\n }\n\n if (useSymbolCache) {\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(path, SymbolCachePath));\n if (useSymbolServer)\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(QString(), SymbolServerPath));\n return true;\n } else if (useSymbolServer) {\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(path, SymbolServerPath));\n return true;\n }\n return false;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<commit_msg>Fix signedness warning in cdbsymbolpathlisteditor.cpp.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2013 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of Qt Creator.\n**\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n****************************************************************************\/\n\n#include \"cdbsymbolpathlisteditor.h\"\n\n#include <coreplugin\/icore.h>\n\n#include <utils\/pathchooser.h>\n#include <utils\/checkablemessagebox.h>\n\n#include <symbolpathsdialog.h>\n\n#include <QCheckBox>\n#include <QDir>\n#include <QDebug>\n#include <QAction>\n#include <QFormLayout>\n#include <QLabel>\n\nnamespace Debugger {\nnamespace Internal {\n\nCacheDirectoryDialog::CacheDirectoryDialog(QWidget *parent) :\n QDialog(parent), m_chooser(new Utils::PathChooser),\n m_buttonBox(new QDialogButtonBox(QDialogButtonBox::Ok|QDialogButtonBox::Cancel))\n{\n setWindowTitle(tr(\"Select Local Cache Folder\"));\n setModal(true);\n setWindowFlags(windowFlags() & ~Qt::WindowContextHelpButtonHint);\n\n QFormLayout *formLayout = new QFormLayout;\n m_chooser->setExpectedKind(Utils::PathChooser::ExistingDirectory);\n m_chooser->setMinimumWidth(400);\n formLayout->addRow(tr(\"Path:\"), m_chooser);\n\n QVBoxLayout *mainLayout = new QVBoxLayout;\n mainLayout->addLayout(formLayout);\n mainLayout->addWidget(m_buttonBox);\n\n setLayout(mainLayout);\n\n connect(m_buttonBox, SIGNAL(accepted()), this, SLOT(accept()));\n connect(m_buttonBox, SIGNAL(rejected()), this, SLOT(reject()));\n}\n\nvoid CacheDirectoryDialog::setPath(const QString &p)\n{\n m_chooser->setPath(p);\n}\n\nQString CacheDirectoryDialog::path() const\n{\n return m_chooser->path();\n}\n\nvoid CacheDirectoryDialog::accept()\n{\n QString cache = path();\n \/\/ if cache is empty a default is used by the cdb\n if (cache.isEmpty()) {\n QDialog::accept();\n return;\n }\n \/\/ Ensure path exists\n QFileInfo fi(cache);\n \/\/ Folder exists - all happy.\n if (fi.isDir()) {\n QDialog::accept();\n return;\n }\n \/\/ Does a file of the same name exist?\n if (fi.exists()) {\n QMessageBox::warning(this, tr(\"Already Exists\"),\n tr(\"A file named '%1' already exists.\").arg(cache));\n return;\n }\n \/\/ Create\n QDir root(QDir::root());\n if (!root.mkpath(cache)) {\n QMessageBox::warning(this, tr(\"Cannot Create\"),\n tr(\"The folder '%1' could not be created.\").arg(cache));\n return;\n }\n QDialog::accept();\n}\n\n\/\/ ---------------- CdbSymbolPathListEditor\n\nconst char *CdbSymbolPathListEditor::symbolServerPrefixC = \"srv*\";\nconst char *CdbSymbolPathListEditor::symbolServerPostfixC = \"http:\/\/msdl.microsoft.com\/download\/symbols\";\nconst char *CdbSymbolPathListEditor::symbolCachePrefixC = \"cache*\";\n\nCdbSymbolPathListEditor::CdbSymbolPathListEditor(QWidget *parent) :\n Utils::PathListEditor(parent)\n{\n \/\/! Add Microsoft Symbol server connection\n QAction *action = insertAction(lastAddActionIndex() + 1, tr(\"Symbol Server...\"), this, SLOT(addSymbolServer()));\n action->setToolTip(tr(\"Adds the Microsoft symbol server providing symbols for operating system libraries.\"\n \"Requires specifying a local cache directory.\"));\n action = insertAction(lastAddActionIndex() + 1, tr(\"Symbol Cache...\"), this, SLOT(addSymbolCache()));\n action->setToolTip(tr(\"Uses a directory to cache symbols used by the debugger.\"));\n}\n\nbool CdbSymbolPathListEditor::promptCacheDirectory(QWidget *parent, QString *cacheDirectory)\n{\n CacheDirectoryDialog dialog(parent);\n dialog.setPath(QDir::tempPath() + QDir::separator() + QLatin1String(\"symbolcache\"));\n if (dialog.exec() != QDialog::Accepted)\n return false;\n *cacheDirectory = dialog.path();\n return true;\n}\n\nvoid CdbSymbolPathListEditor::addSymbolServer()\n{\n addSymbolPath(SymbolServerPath);\n}\n\nvoid CdbSymbolPathListEditor::addSymbolCache()\n{\n addSymbolPath(SymbolCachePath);\n}\n\nvoid CdbSymbolPathListEditor::addSymbolPath(CdbSymbolPathListEditor::SymbolPathMode mode)\n{\n QString cacheDir;\n if (promptCacheDirectory(this, &cacheDir))\n insertPathAtCursor(CdbSymbolPathListEditor::symbolPath(cacheDir, mode));\n}\n\nQString CdbSymbolPathListEditor::symbolPath(const QString &cacheDir,\n CdbSymbolPathListEditor::SymbolPathMode mode)\n{\n if (mode == SymbolCachePath)\n return QLatin1String(symbolCachePrefixC) + QDir::toNativeSeparators(cacheDir);\n QString s = QLatin1String(symbolServerPrefixC);\n if (!cacheDir.isEmpty())\n s += QDir::toNativeSeparators(cacheDir) + QLatin1String(\"*\");\n s += QLatin1String(symbolServerPostfixC);\n return s;\n}\n\nbool CdbSymbolPathListEditor::isSymbolServerPath(const QString &path, QString *cacheDir \/* = 0 *\/)\n{\n if (!path.startsWith(QLatin1String(symbolServerPrefixC)) || !path.endsWith(QLatin1String(symbolServerPostfixC)))\n return false;\n if (cacheDir) {\n static const unsigned prefixLength = qstrlen(symbolServerPrefixC);\n static const unsigned postfixLength = qstrlen(symbolServerPostfixC);\n if (path.length() == int(prefixLength + postfixLength))\n return true;\n \/\/ Split apart symbol server post\/prefixes\n *cacheDir = path.mid(prefixLength, path.size() - prefixLength - qstrlen(symbolServerPostfixC) + 1);\n }\n return true;\n}\n\nbool CdbSymbolPathListEditor::isSymbolCachePath(const QString &path, QString *cacheDir)\n{\n if (!path.startsWith(QLatin1String(symbolCachePrefixC)))\n return false;\n if (cacheDir) {\n static const unsigned prefixLength = qstrlen(symbolCachePrefixC);\n \/\/ Split apart symbol cach prefixes\n *cacheDir = path.mid(prefixLength);\n }\n return true;\n}\n\nint CdbSymbolPathListEditor::indexOfSymbolPath(const QStringList &paths,\n CdbSymbolPathListEditor::SymbolPathMode mode,\n QString *cacheDir \/* = 0 *\/)\n{\n const int count = paths.size();\n for (int i = 0; i < count; i++) {\n if (mode == SymbolServerPath\n ? CdbSymbolPathListEditor::isSymbolServerPath(paths.at(i), cacheDir)\n : CdbSymbolPathListEditor::isSymbolCachePath(paths.at(i), cacheDir)) {\n return i;\n }\n }\n return -1;\n}\n\nbool CdbSymbolPathListEditor::promptToAddSymbolPaths(const QString &settingsGroup,\n QStringList *symbolPaths)\n{\n const int indexOfSymbolServer =\n CdbSymbolPathListEditor::indexOfSymbolPath(*symbolPaths, SymbolServerPath);\n const int indexOfSymbolCache =\n CdbSymbolPathListEditor::indexOfSymbolPath(*symbolPaths, SymbolCachePath);\n\n if (!qgetenv(\"_NT_SYMBOL_PATH\").isEmpty()\n || (indexOfSymbolServer != -1 && indexOfSymbolCache != -1))\n return false;\n\n const QString nagSymbolServerKey = settingsGroup + QLatin1String(\"\/NoPromptSymbolCache\");\n bool noFurtherNagging = Core::ICore::settings()->value(nagSymbolServerKey, false).toBool();\n if (noFurtherNagging)\n return false;\n\n QString path;\n if (indexOfSymbolServer != -1)\n path = symbolPaths->at(indexOfSymbolServer);\n if (path.isEmpty() && indexOfSymbolCache != -1)\n path = symbolPaths->at(indexOfSymbolCache);\n if (path.isEmpty())\n path = QDir::tempPath() + QDir::separator() + QLatin1String(\"symbolcache\");\n\n bool useSymbolServer = true;\n bool useSymbolCache = true;\n bool addSymbolPaths = SymbolPathsDialog::useCommonSymbolPaths(useSymbolCache,\n useSymbolServer,\n path, noFurtherNagging);\n Core::ICore::settings()->setValue(nagSymbolServerKey, noFurtherNagging);\n if (!addSymbolPaths)\n return false;\n\n \/\/ remove old entries\n if (indexOfSymbolServer > indexOfSymbolCache) {\n symbolPaths->removeAt(indexOfSymbolServer);\n if (indexOfSymbolCache != -1)\n symbolPaths->removeAt(indexOfSymbolCache);\n } else if (indexOfSymbolCache > indexOfSymbolServer) {\n symbolPaths->removeAt(indexOfSymbolCache);\n if (indexOfSymbolServer != -1)\n symbolPaths->removeAt(indexOfSymbolServer);\n }\n\n if (useSymbolCache) {\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(path, SymbolCachePath));\n if (useSymbolServer)\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(QString(), SymbolServerPath));\n return true;\n } else if (useSymbolServer) {\n symbolPaths->push_back(CdbSymbolPathListEditor::symbolPath(path, SymbolServerPath));\n return true;\n }\n return false;\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace Debugger\n<|endoftext|>"} {"text":"<commit_before>#ifndef INCLUDE_AL_MATH_RANDOM_HPP\n#define INCLUDE_AL_MATH_RANDOM_HPP\n\n\/*\tAllocore --\n\tMultimedia \/ virtual environment application class library\n\n\tCopyright (C) 2009. AlloSphere Research Group, Media Arts & Technology, UCSB.\n\tCopyright (C) 2012. The Regents of the University of California.\n\tAll rights reserved.\n\n\tRedistribution and use in source and binary forms, with or without \n\tmodification, are permitted provided that the following conditions are met:\n\n\t\tRedistributions of source code must retain the above copyright notice, \n\t\tthis list of conditions and the following disclaimer.\n\n\t\tRedistributions in binary form must reproduce the above copyright \n\t\tnotice, this list of conditions and the following disclaimer in the \n\t\tdocumentation and\/or other materials provided with the distribution.\n\n\t\tNeither the name of the University of California nor the names of its \n\t\tcontributors may be used to endorse or promote products derived from \n\t\tthis software without specific prior written permission.\n\n\tTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n\tAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n\tIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n\tARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE \n\tLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\tCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \n\tSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \n\tINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \n\tCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \n\tARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \n\tPOSSIBILITY OF SUCH DAMAGE.\n\n\n\tFile description:\n\tVarious flavors of pseudo-random number generators nad distributions\n\n\tFile author(s):\n\tLance Putnam, 2006, putnam.lance@gmail.com\n*\/\n\n\n#include <time.h>\t\t\t\t\t\t\t\/* req'd for time() *\/\n#include <cmath>\n#include \"allocore\/types\/al_Conversion.hpp\"\t\/* req'd for int to float conversion *\/\n#include \"allocore\/math\/al_Constants.hpp\"\n#include \"allocore\/math\/al_Generators.hpp\"\n\nnamespace al {\n\n\/\/\/ Random number generation utilities\nnamespace rnd{\n\nclass LinCon;\nclass MulLinCon;\nclass Tausworthe;\ntemplate<class RNG> class Random;\n\n\n\/\/\/ Get a random seed in interval [0, 4294967296)\ninline static uint32_t seed(){\n\tstatic gen::RMulAdd<uint32_t> seedGen(1664525, 1013904223, time(NULL));\n\treturn seedGen();\n}\n\n\n\/\/\/ Random distribution generator\ntemplate <class RNG=al::rnd::Tausworthe>\nclass Random{\npublic:\n\n\tRandom(){}\n\n\tRandom(uint32_t seed): mRNG(seed){}\n\n\t\/\/\/ Set seed\n\tRandom& seed(uint32_t v){ mRNG.seed(v); return *this; }\n\n\t\/\/\/ Returns uniform random in [0, 1)\n\tfloat uniform(){ return al::uintToUnit<float>(mRNG()); }\n\n\t\/\/\/ Returns uniform random in [0, hi)\n\ttemplate <class T>\n\tT uniform(const T& hi){ return hi*uniform(); }\n\t\n\t\/\/\/ Returns uniform random in [lo, hi)\n\ttemplate <class T>\n\tT uniform(const T& hi, const T& lo){ return T((hi-lo)*uniform()) + lo; }\n\n\t\/\/\/ Returns uniform random in [-1, 1)\n\tfloat uniformS(){ return al::uintToUnitS<float>(mRNG()); }\n\n\t\/\/\/ Returns uniform random in [-lim, lim)\n\ttemplate <class T>\n\tT uniformS(const T& lim){ return lim*uniformS(); }\n\n\t\/\/\/ Returns point within a unit ball\n\t\n\t\/\/\/ To get a random point on a sphere, simply normalize the result.\n\t\/\/\/ \\tparam\t\tN\t\tdimensions of ball\n\t\/\/\/ @param[in]\tpoint\tan array of size N\n\ttemplate <int N, class T>\n\tvoid ball(T * point);\n\n\t\/\/\/ Returns random Gaussian\n\tfloat gaussian(){ float r; gaussian(r,r); return r; }\n\n\t\/\/\/ Returns two random Gaussians\n\ttemplate <class T>\n\tvoid gaussian(T& y1, T& y2);\n\n\t\/\/\/ Returns true with a probability of p.\n\tbool prob(float p=0.5f){ return uniform() < p; }\n\n\t\/\/\/ Randomly shuffles elements in array.\n\ttemplate <class T>\n\tvoid shuffle(T * arr, uint32_t len);\n\nprotected:\n\tRNG mRNG;\n};\n\n\n\n\/\/\/ Linear congruential uniform pseudo-random number generator.\n\n\/\/\/\tThis generator is very fast requiring only a single integer multiply and add per\n\/\/\/ iteration. However, the least significant bits of the numbers are less \n\/\/\/ random; the most extreme case being the LSB which at best flips between 0 and 1.\n\/\/\/ This generator also exhibits poor dimensional distribution, therefore it is\n\/\/\/ best to have a different generator for each dimension, rather than sharing one.\nclass LinCon : public gen::RMulAdd<uint32_t>{\npublic:\n\n\tLinCon(){ val=al::rnd::seed(); type(0); }\n\n\t\/\/\/ @param[in] seed\tInitial seed value\n\tLinCon(uint32_t seed): gen::RMulAdd<uint32_t>(1,0,seed){ type(0); }\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v){ (*this)=v; }\n\n\t\/\/\/ Change the type of equation used.\n\t\n\t\/\/\/ 0 - Knuth, Numerical Recipes in C\\n\n\t\/\/\/ 1 - BCPL\n\tvoid type(int v){\n\t\tswitch(v){\n\t\tcase 1:\tmul = 2147001325; add = 715136305; break; \/\/ BCPL\n\t\tdefault:mul = 1664525; add = 1013904223; \/\/ Knuth, Numerical Recipes in C\n\t\t}\n\t}\n};\n\n\n\n\/\/\/ Multiplicative linear congruential uniform pseudo-random number generator.\n\n\/\/\/\tThis generator is a faster LCG requiring only a single integer multiply.\n\/\/\/\nclass MulLinCon : public gen::RMul<uint32_t>{\npublic:\n\n\tMulLinCon(){ val=al::rnd::seed(); type(0); }\n\t\n\t\/\/\/ @param[in] seed\tInitial seed value\n\tMulLinCon(uint32_t seed): gen::RMul<uint32_t>(1,seed){ type(0); }\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v){ (*this)=v; }\n\n\t\/\/\/ Change the type of equation used.\n\n\t\/\/\/ 0 - Marsaglia, Super-Duper\\n\n\t\/\/\/\n\tvoid type(int v){\n\t\tswitch(v){\n\t\tdefault: mul = 69069;\t\/\/ Super-duper\n\t\t}\n\t}\n};\n\n\n\n\/\/\/ Combined Tausworthe uniform pseudo-random number generator.\n\n\/\/\/ This generator produces highly random numbers, but is more expensive than\n\/\/\/ than a linear congruential RNG.\n\/\/\/ It is based on the paper \n\/\/\/ P. L'Ecuyer, \"Maximally Equidistributed Combined Tausworthe Generators\", \n\/\/\/ Mathematics of Computation, 65, 213 (1996), 203--213.\n\/\/\/ http:\/\/www.iro.umontreal.ca\/~lecuyer\/papers.html\nclass Tausworthe{\npublic:\n\n\tTausworthe();\n\n\t\/\/\/ @param[in] seed\t\tInitial seed value\n\tTausworthe(uint32_t seed);\n\t\n\tuint32_t operator()();\t\t\t\t\/\/\/< Generates uniform random unsigned integer in [0, 2^32).\n\n\tvoid seed(uint32_t v);\t\t\t\t\/\/\/< Set seed\n\tvoid seed(uint32_t v1, uint32_t v2, uint32_t v3, uint32_t v4); \/\/\/< Set seed\n\nprivate:\n\tuint32_t s1, s2, s3, s4;\n\tvoid iterate();\n};\n\n\n\/\/\/ Get global random number generator\ninline Random<>& global(){ static Random<> r; return r; }\n\n\/\/\/ Returns point within a unit ball\n\n\/\/\/ To get a random point on a sphere, simply normalize the result.\n\/\/\/ \\tparam\t\tN\t\tdimensions of ball\n\/\/\/ @param[in]\tpoint\tan array of size N\ntemplate <int N, class T>\ninline void ball(T * point){ global().ball<N>(point); }\n\n\/\/\/ Returns random Gaussian\ninline float gaussian(){ return global().gaussian(); }\n\n\/\/\/ Returns true with probability p\ninline bool prob(float p=0.5){ return global().prob(p); }\n\n\/\/\/ Returns uniform random in [0, 1)\ninline float uniform(){ return global().uniform(); }\n\n\/\/\/ Returns uniform random in [0, hi)\ntemplate <class T>\ninline T uniform(const T& hi){ return global().uniform(hi); }\n\n\/\/\/ Returns uniform random in [lo, hi)\ntemplate <class T>\ninline T uniform(const T& hi, const T& lo){ return global().uniform(hi,lo); }\n\n\/\/\/ Returns signed uniform random in (-1, 1)\ninline float uniformS(){ return global().uniformS(); }\n\n\/\/\/ Returns signed uniform random in (-lim, lim)\ntemplate <class T>\ninline T uniformS(const T& lim){ return global().uniformS(lim); }\n\n\n\/\/ Implementation_______________________________________________________________\n\n\/\/---- Tausworthe\n\ninline Tausworthe::Tausworthe(){ seed(al::rnd::seed()); }\ninline Tausworthe::Tausworthe(uint32_t sd){ seed(sd); }\n\ninline uint32_t Tausworthe::operator()(){\n\titerate();\n\treturn s1 ^ s2 ^ s3 ^ s4;\n}\n\ninline void Tausworthe::seed(uint32_t v){\n\tal::rnd::LinCon g(v);\n\tg();\n\tseed(g(), g(), g(), g());\n}\n\ninline void Tausworthe::seed(uint32_t v1, uint32_t v2, uint32_t v3, uint32_t v4){\n\t\/\/printf(\"%u %u %u %u\\n\", v1, v2, v3, v4);\n\tv1 & 0xffffffe ? s1 = v1 : s1 = ~v1;\n\tv2 & 0xffffff8 ? s2 = v2 : s2 = ~v2;\n\tv3 & 0xffffff0 ? s3 = v3 : s3 = ~v3;\n\tv4 & 0xfffff80 ? s4 = v4 : s4 = ~v4;\n}\n\t\ninline void Tausworthe::iterate(){\n\ts1 = ((s1 & 0xfffffffe) << 18) ^ (((s1 << 6) ^ s1) >> 13);\n\ts2 = ((s2 & 0xfffffff8) << 2) ^ (((s2 << 2) ^ s2) >> 27);\n\ts3 = ((s3 & 0xfffffff0) << 7) ^ (((s3 << 13) ^ s3) >> 21);\n\ts4 = ((s4 & 0xffffff80) << 13) ^ (((s4 << 3) ^ s4) >> 12);\n}\n\n\ntemplate <class RNG>\ntemplate <int N, class T>\nvoid Random<RNG>::ball(T * point){\n\tT w;\n\tdo{\n\t\tw = T(0);\n\t\tfor(int i=0; i<N; ++i){\n\t\t\tfloat v = uniformS();\n\t\t\tpoint[i] = v;\n\t\t\tw += v*v;\n\t\t}\n\t} while(w >= T(1)); \/\/ if on or outside unit ball, try again\n}\n\n\/\/ Box-Muller transform\n\/\/\t\tBox, G. and Muller, M. A note on the generation of normal deviates. \n\/\/\t\tAnn. Math. Slat. 28, (1958). \n\/\/\n\/\/ http:\/\/en.wikipedia.org\/wiki\/Box–Muller_transform\ntemplate <class RNG>\ntemplate <class T> void Random<RNG>::gaussian(T& y1, T& y2){\n\tfloat x1, x2, w;\n\n\t\/\/ Search for point within unit circle using sample-reject.\n\t\/\/ This will pass with probability π\/4 = ~0.785.\n\tdo{\n\t\tx1 = uniformS();\n\t\tx2 = uniformS();\n\t\tw = x1 * x1 + x2 * x2;\n\t} while(w >= 1.f);\n\n\t\/\/ perform inverse Gaussian function mapping\n\tw = std::sqrt((-2.f * std::log(w)) \/ w);\n\ty1 = T(x1 * w);\n\ty2 = T(x2 * w);\n}\n\n\n\/\/ Fisher-Yates shuffle\ntemplate <class RNG>\ntemplate <class T>\nvoid Random<RNG>::shuffle(T * arr, uint32_t len){\n\tfor(uint32_t i=len-1; i>0; --i){\n\t\tuint32_t j = uniform(i+1);\n\t\tT t = arr[i];\n\t\tarr[i] = arr[j];\n\t\tarr[j] = t;\n\t}\n}\n\n} \/\/ al::rnd::\n} \/\/ al::\n\n#endif\n<commit_msg>remove dependency on al_Generators.hpp<commit_after>#ifndef INCLUDE_AL_MATH_RANDOM_HPP\n#define INCLUDE_AL_MATH_RANDOM_HPP\n\n\/*\tAllocore --\n\tMultimedia \/ virtual environment application class library\n\n\tCopyright (C) 2009. AlloSphere Research Group, Media Arts & Technology, UCSB.\n\tCopyright (C) 2012. The Regents of the University of California.\n\tAll rights reserved.\n\n\tRedistribution and use in source and binary forms, with or without \n\tmodification, are permitted provided that the following conditions are met:\n\n\t\tRedistributions of source code must retain the above copyright notice, \n\t\tthis list of conditions and the following disclaimer.\n\n\t\tRedistributions in binary form must reproduce the above copyright \n\t\tnotice, this list of conditions and the following disclaimer in the \n\t\tdocumentation and\/or other materials provided with the distribution.\n\n\t\tNeither the name of the University of California nor the names of its \n\t\tcontributors may be used to endorse or promote products derived from \n\t\tthis software without specific prior written permission.\n\n\tTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" \n\tAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE \n\tIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE \n\tARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE \n\tLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\tCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF \n\tSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS \n\tINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN \n\tCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) \n\tARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE \n\tPOSSIBILITY OF SUCH DAMAGE.\n\n\n\tFile description:\n\tVarious flavors of pseudo-random number generators and distributions\n\n\tFile author(s):\n\tLance Putnam, 2006, putnam.lance@gmail.com\n*\/\n\n\n#include <time.h>\t\t\t\t\t\t\t\/* req'd for time() *\/\n#include <cmath>\n#include \"allocore\/types\/al_Conversion.hpp\"\t\/* req'd for int to float conversion *\/\n#include \"allocore\/math\/al_Constants.hpp\"\n\nnamespace al {\n\n\/\/\/ Random number generation utilities\nnamespace rnd{\n\nclass LinCon;\nclass MulLinCon;\nclass Tausworthe;\ntemplate<class RNG> class Random;\n\n\n\/\/\/ Get a random seed in interval [0, 4294967296)\ninline static uint32_t seed(){\n\tstatic uint32_t val = time(NULL);\n\treturn val = val*1664525UL + 1013904223UL;\n}\n\n\n\/\/\/ Random distribution generator\ntemplate <class RNG=al::rnd::Tausworthe>\nclass Random{\npublic:\n\n\t\/\/\/ Default constructor uses a randomly generated seed\n\tRandom(){}\n\n\t\/\/\/ @param[in] seed\t\tInitial seed value\n\tRandom(uint32_t seed): mRNG(seed){}\n\n\n\t\/\/\/ Set seed\n\tRandom& seed(uint32_t v){ mRNG.seed(v); return *this; }\n\n\t\/\/\/ Returns uniform random in [0, 1)\n\tfloat uniform(){ return al::uintToUnit<float>(mRNG()); }\n\n\t\/\/\/ Returns uniform random in [0, hi)\n\ttemplate <class T>\n\tT uniform(const T& hi){ return hi*uniform(); }\n\t\n\t\/\/\/ Returns uniform random in [lo, hi)\n\ttemplate <class T>\n\tT uniform(const T& hi, const T& lo){ return T((hi-lo)*uniform()) + lo; }\n\n\t\/\/\/ Returns uniform random in [-1, 1)\n\tfloat uniformS(){ return al::uintToUnitS<float>(mRNG()); }\n\n\t\/\/\/ Returns uniform random in [-lim, lim)\n\ttemplate <class T>\n\tT uniformS(const T& lim){ return lim*uniformS(); }\n\n\t\/\/\/ Returns point within a unit ball\n\t\n\t\/\/\/ To get a random point on a sphere, simply normalize the result.\n\t\/\/\/ \\tparam\t\tN\t\tdimensions of ball\n\t\/\/\/ @param[in]\tpoint\tan array of size N\n\ttemplate <int N, class T>\n\tvoid ball(T * point);\n\n\t\/\/\/ Returns random Gaussian\n\tfloat gaussian(){ float r; gaussian(r,r); return r; }\n\n\t\/\/\/ Returns two random Gaussians\n\ttemplate <class T>\n\tvoid gaussian(T& y1, T& y2);\n\n\t\/\/\/ Returns true with a probability of p.\n\tbool prob(float p=0.5f){ return uniform() < p; }\n\n\t\/\/\/ Randomly shuffles elements in array.\n\ttemplate <class T>\n\tvoid shuffle(T * arr, uint32_t len);\n\nprotected:\n\tRNG mRNG;\n};\n\n\n\n\/\/\/ Linear congruential uniform pseudo-random number generator.\n\n\/\/\/\tThis generator is very fast requiring only a single integer multiply and add\n\/\/\/ per iteration. However, the least significant bits of the numbers are less \n\/\/\/ random; the most extreme case being the LSB which at best flips between \n\/\/\/ 0 and 1. This generator also exhibits poor dimensional distribution,\n\/\/\/ therefore it is best to have a different generator for each dimension, \n\/\/\/ rather than sharing one.\nclass LinCon {\npublic:\n\t\/\/\/ Default constructor uses a randomly generated seed\n\tLinCon(){\n\t\tseed(al::rnd::seed());\n\t\ttype(0);\n\t}\n\n\t\/\/\/ @param[in] seed\t\tInitial seed value\n\tLinCon(uint32_t seed)\n\t:\tmVal(seed)\n\t{\ttype(0); }\n\n\n\t\/\/\/ Generate next uniform random integer in [0, 2^32)\n\tuint32_t operator()(){\n\t\treturn mVal = mVal*mMul + mAdd;\n\t}\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v){ mVal=v; }\n\n\t\/\/\/ Change the type of equation used.\n\t\n\t\/\/\/ 0 - Knuth, Numerical Recipes in C\\n\n\t\/\/\/ 1 - BCPL\n\tvoid type(int v){\n\t\tswitch(v){\n\t\tdefault:\n\t\tcase 0: mMul = 1664525; mAdd = 1013904223; break;\n\t\tcase 1:\tmMul = 2147001325; mAdd = 715136305; break;\n\t\t}\n\t}\n\nprivate:\n\tuint32_t mVal;\n\tuint32_t mMul, mAdd;\n};\n\n\n\n\/\/\/ Multiplicative linear congruential uniform pseudo-random number generator.\n\n\/\/\/\tThis generator is faster than LinCon requiring only a single integer\n\/\/\/ multiply per iteration. However, the downside is that it produces lower\n\/\/\/ quality (less \"random\") results than LinCon. Because of this, it is really \n\/\/\/ not appropriate for simulations, but due to its speed it is very useful for \n\/\/\/ synthesizing noise for audio and graphics.\nclass MulLinCon{\npublic:\n\t\/\/\/ Default constructor uses a randomly generated seed\n\tMulLinCon(){\n\t\tseed(al::rnd::seed());\n\t\ttype(0);\n\t}\n\t\n\t\/\/\/ @param[in] seed\tInitial seed value\n\tMulLinCon(uint32_t seed)\n\t:\tmVal(seed)\n\t{\ttype(0); }\n\n\n\t\/\/\/ Generate next uniform random integer in [0, 2^32)\n\tuint32_t operator()(){\n\t\treturn mVal *= mMul;\n\t}\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v){ mVal=v; }\n\n\t\/\/\/ Change the type of equation used.\n\n\t\/\/\/ 0 - Marsaglia, Super-Duper\\n\n\t\/\/\/\n\tvoid type(int v){\n\t\tswitch(v){\n\t\tdefault: \n\t\tcase 0: mMul = 69069; break;\n\t\t}\n\t}\n\nprivate:\n\tuint32_t mVal;\n\tuint32_t mMul;\n};\n\n\n\n\/\/\/ Combined Tausworthe uniform pseudo-random number generator.\n\n\/\/\/ This generator produces highly random numbers, but is more expensive than\n\/\/\/ than a linear congruential RNG.\n\/\/\/ It is based on the paper \n\/\/\/ P. L'Ecuyer, \"Maximally Equidistributed Combined Tausworthe Generators\", \n\/\/\/ Mathematics of Computation, 65, 213 (1996), 203--213.\n\/\/\/ http:\/\/www.iro.umontreal.ca\/~lecuyer\/papers.html\nclass Tausworthe{\npublic:\n\n\t\/\/\/ Default constructor uses a randomly generated seed\n\tTausworthe();\n\n\t\/\/\/ @param[in] seed\t\tInitial seed value\n\tTausworthe(uint32_t seed);\n\t\n\n\t\/\/\/ Generate next uniform random integer in [0, 2^32)\n\tuint32_t operator()();\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v);\n\n\t\/\/\/ Set seed\n\tvoid seed(uint32_t v1, uint32_t v2, uint32_t v3, uint32_t v4);\n\nprivate:\n\tuint32_t s1, s2, s3, s4;\n\tvoid iterate();\n};\n\n\n\/\/\/ Get global random number generator\ninline Random<>& global(){ static Random<> r; return r; }\n\n\/\/\/ Returns point within a unit ball\n\n\/\/\/ To get a random point on a sphere, simply normalize the result.\n\/\/\/ \\tparam\t\tN\t\tdimensions of ball\n\/\/\/ @param[in]\tpoint\tan array of size N\ntemplate <int N, class T>\ninline void ball(T * point){ global().ball<N>(point); }\n\n\/\/\/ Returns random Gaussian\ninline float gaussian(){ return global().gaussian(); }\n\n\/\/\/ Returns true with probability p\ninline bool prob(float p=0.5){ return global().prob(p); }\n\n\/\/\/ Returns uniform random in [0, 1)\ninline float uniform(){ return global().uniform(); }\n\n\/\/\/ Returns uniform random in [0, hi)\ntemplate <class T>\ninline T uniform(const T& hi){ return global().uniform(hi); }\n\n\/\/\/ Returns uniform random in [lo, hi)\ntemplate <class T>\ninline T uniform(const T& hi, const T& lo){ return global().uniform(hi,lo); }\n\n\/\/\/ Returns signed uniform random in (-1, 1)\ninline float uniformS(){ return global().uniformS(); }\n\n\/\/\/ Returns signed uniform random in (-lim, lim)\ntemplate <class T>\ninline T uniformS(const T& lim){ return global().uniformS(lim); }\n\n\n\n\/\/ Implementation_______________________________________________________________\n\ninline Tausworthe::Tausworthe(){ seed(al::rnd::seed()); }\ninline Tausworthe::Tausworthe(uint32_t sd){ seed(sd); }\n\ninline uint32_t Tausworthe::operator()(){\n\titerate();\n\treturn s1 ^ s2 ^ s3 ^ s4;\n}\n\ninline void Tausworthe::seed(uint32_t v){\n\tal::rnd::LinCon g(v);\n\tg();\n\tseed(g(), g(), g(), g());\n}\n\ninline void Tausworthe::seed(uint32_t v1, uint32_t v2, uint32_t v3, uint32_t v4){\n\t\/\/printf(\"%u %u %u %u\\n\", v1, v2, v3, v4);\n\tv1 & 0xffffffe ? s1 = v1 : s1 = ~v1;\n\tv2 & 0xffffff8 ? s2 = v2 : s2 = ~v2;\n\tv3 & 0xffffff0 ? s3 = v3 : s3 = ~v3;\n\tv4 & 0xfffff80 ? s4 = v4 : s4 = ~v4;\n}\n\t\ninline void Tausworthe::iterate(){\n\ts1 = ((s1 & 0xfffffffe) << 18) ^ (((s1 << 6) ^ s1) >> 13);\n\ts2 = ((s2 & 0xfffffff8) << 2) ^ (((s2 << 2) ^ s2) >> 27);\n\ts3 = ((s3 & 0xfffffff0) << 7) ^ (((s3 << 13) ^ s3) >> 21);\n\ts4 = ((s4 & 0xffffff80) << 13) ^ (((s4 << 3) ^ s4) >> 12);\n}\n\n\ntemplate <class RNG>\ntemplate <int N, class T>\nvoid Random<RNG>::ball(T * point){\n\tT w;\n\tdo{\n\t\tw = T(0);\n\t\tfor(int i=0; i<N; ++i){\n\t\t\tfloat v = uniformS();\n\t\t\tpoint[i] = v;\n\t\t\tw += v*v;\n\t\t}\n\t} while(w >= T(1)); \/\/ if on or outside unit ball, try again\n}\n\n\/\/ Box-Muller transform\n\/\/\t\tBox, G. and Muller, M. A note on the generation of normal deviates. \n\/\/\t\tAnn. Math. Slat. 28, (1958). \n\/\/\n\/\/ http:\/\/en.wikipedia.org\/wiki\/Box–Muller_transform\ntemplate <class RNG>\ntemplate <class T> void Random<RNG>::gaussian(T& y1, T& y2){\n\tfloat x1, x2, w;\n\n\t\/\/ Search for point within unit circle using sample-reject.\n\t\/\/ This will pass with probability π\/4 = ~0.785.\n\tdo{\n\t\tx1 = uniformS();\n\t\tx2 = uniformS();\n\t\tw = x1 * x1 + x2 * x2;\n\t} while(w >= 1.f);\n\n\t\/\/ perform inverse Gaussian function mapping\n\tw = std::sqrt((-2.f * std::log(w)) \/ w);\n\ty1 = T(x1 * w);\n\ty2 = T(x2 * w);\n}\n\n\n\/\/ Fisher-Yates shuffle\ntemplate <class RNG>\ntemplate <class T>\nvoid Random<RNG>::shuffle(T * arr, uint32_t len){\n\tfor(uint32_t i=len-1; i>0; --i){\n\t\tuint32_t j = uniform(i+1);\n\t\tT t = arr[i];\n\t\tarr[i] = arr[j];\n\t\tarr[j] = t;\n\t}\n}\n\n} \/\/ al::rnd::\n} \/\/ al::\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\n#include <node.h>\n#include <v8.h>\n\n#include <unistd.h>\n\n\nusing namespace v8;\n\n\nstatic Handle<Value> OsPipe(const Arguments& args) \n{\n HandleScope scope;\n int pipefd[2];\n \n int ok = pipe(pipefd);\n\n Local<Array> arr = Array::New();\n\n arr->Set(0,Number::New(pipefd[0]));\n arr->Set(1,Number::New(pipefd[1]));\n\n return scope.Close(arr);\n}\n\n\/\/=========================\n\n\nvoid init(Handle<Object> exports) \n{\n exports->Set(String::NewSymbol(\"ospipe\"), FunctionTemplate::New(OsPipe)->GetFunction());\n}\n\nNODE_MODULE(ospipe, init)\n<commit_msg>error checking<commit_after>\n#include <node.h>\n#include <v8.h>\n\n#include <unistd.h>\n\n\nusing namespace v8;\n\n\nstatic Handle<Value> OsPipe(const Arguments& args) \n{\n HandleScope scope;\n int pipefd[2];\n \n int ok = pipe(pipefd);\n\n if (ok == -1) {\n\tThrowException(Exception::Error(String::New(\"pipe(2) returned error\")));\n\treturn scope.Close(Undefined());\n }\n\n\n Local<Array> arr = Array::New();\n\n arr->Set(0,Number::New(pipefd[0]));\n arr->Set(1,Number::New(pipefd[1]));\n\n return scope.Close(arr);\n}\n\n\/\/=========================\n\n\nvoid init(Handle<Object> exports) \n{\n exports->Set(String::NewSymbol(\"ospipe\"), FunctionTemplate::New(OsPipe)->GetFunction());\n}\n\nNODE_MODULE(ospipe, init)\n<|endoftext|>"} {"text":"<commit_before>#include \"minimap.h\"\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\n#include \"asdf_multiplat\/main\/asdf_multiplat.h\"\n#include \"asdf_multiplat\/data\/gl_vertex_spec.h\"\n#include \"asdf_multiplat\/data\/gl_state.h\"\n\n#include \"ui\/hex_map.h\"\n\nusing namespace std;\nusing namespace glm;\n\nnamespace asdf\n{\nnamespace hexmap\n{\nnamespace ui\n{\n gl_vertex_spec_<vertex_attrib::position2_t\n , vertex_attrib::color_t> minimap_vertex_t::vertex_spec;\n\n minimap_t::minimap_t(ui::hex_map_t& _rendered_map)\n : rendered_map(_rendered_map)\n , map_data(_rendered_map.map_data)\n , render_target(1024, 1024)\n {\n render_target.texture.name = \"minimap\";\n render_target.init();\n }\n\n\n\n void minimap_t::rebuild()\n {\n scoped_render_target_t scoped(this->render_target); \/\/MSVC is making me put a this-> why?\n\n glClearColor(0,0,0,0);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ use glBlendFuncSeparate to allow the minimap FBO to have a transparent background\n \/\/ instead of black\n \/\/glEnable(GL_BLEND);\n \/\/glBlendFuncSeparate(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n\n \/\/snapshot the camera\n auto& camera = rendered_map.camera;\n auto prev_camera = camera;\n\n \/\/set camera such that the entire map will fit within the fbo when rendered\n auto grid_size = map_data.hex_grid.size_units();\n auto grid_size_d2 = grid_size \/ 2.0f;\n auto grid_bbox = map_data.hex_grid.bounding_box_units();\n\n camera.position = vec3(grid_bbox.lower + grid_size_d2, 0.0f);\n camera.viewport = viewport_for_size_aspect(grid_size, camera.aspect_ratio);\n\n \/\/render just the terrain (and grid outline for now)\n using flags_e = hex_map_t::render_flags_e;\n uint32_t flags = flags_e::terrain | flags_e::grid_outline;\n rendered_map.render(flags_e(flags));\n\n camera = prev_camera;\n\n ASSERT(!CheckGLError(), \"GL Error building minimap\");\n }\n\n void minimap_t::render()\n {\n \/\/render texture to quad\n auto const& quad = app.renderer->quad;\n auto& shader = app.renderer->screen_shader;\n\n GL_State->bind(shader);\n\n float minimap_scale_px = 400.0f;\n\n \/\/shader->world_matrix = scale(translate(mat4(), vec3(0, 0, 0)), vec3(minimap_scale_px));\n shader->world_matrix = mat4();\n shader->view_matrix = mat4();\n shader->projection_matrix = glm::ortho<float>(-0.5f, 0.5f, -0.5f, 0.5f, -1.0f, 1.0f);\n\n float const& halfwidth = render_target.texture.halfwidth;\n float const& halfheight = render_target.texture.halfheight;\n\n \/\/project such that each unit is one pixel\n \/\/ shader->projection_matrix = ortho<float>(-halfwidth, halfwidth,\n \/\/ -halfheight, halfheight,\n \/\/ -1000, 1000);\n\n shader->update_wvp_uniform();\n\n glBindTexture(GL_TEXTURE_2D, render_target.texture.texture_id);\n quad.render();\n\n \/\/TODO: render box-outline representing current viewport\n \/\/ ie: how much of the map is on screen based on zoom\/pan\n }\n}\n}\n}\n<commit_msg>minimap no longer renders hex outlines<commit_after>#include \"minimap.h\"\n\n#include <glm\/glm.hpp>\n#include <glm\/gtc\/matrix_transform.hpp>\n\n#include \"asdf_multiplat\/main\/asdf_multiplat.h\"\n#include \"asdf_multiplat\/data\/gl_vertex_spec.h\"\n#include \"asdf_multiplat\/data\/gl_state.h\"\n\n#include \"ui\/hex_map.h\"\n\nusing namespace std;\nusing namespace glm;\n\nnamespace asdf\n{\nnamespace hexmap\n{\nnamespace ui\n{\n gl_vertex_spec_<vertex_attrib::position2_t\n , vertex_attrib::color_t> minimap_vertex_t::vertex_spec;\n\n minimap_t::minimap_t(ui::hex_map_t& _rendered_map)\n : rendered_map(_rendered_map)\n , map_data(_rendered_map.map_data)\n , render_target(1024, 1024)\n {\n render_target.texture.name = \"minimap\";\n render_target.init();\n }\n\n\n\n void minimap_t::rebuild()\n {\n scoped_render_target_t scoped(this->render_target); \/\/MSVC is making me put a this-> why?\n\n glClearColor(0,0,0,0);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\n \/\/ use glBlendFuncSeparate to allow the minimap FBO to have a transparent background\n \/\/ instead of black\n \/\/glEnable(GL_BLEND);\n \/\/glBlendFuncSeparate(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA, GL_ONE, GL_ONE_MINUS_SRC_ALPHA);\n\n \/\/snapshot the camera\n auto& camera = rendered_map.camera;\n auto prev_camera = camera;\n\n \/\/set camera such that the entire map will fit within the fbo when rendered\n auto grid_size = map_data.hex_grid.size_units();\n auto grid_size_d2 = grid_size \/ 2.0f;\n auto grid_bbox = map_data.hex_grid.bounding_box_units();\n\n camera.position = vec3(grid_bbox.lower + grid_size_d2, 0.0f);\n camera.viewport = viewport_for_size_aspect(grid_size, camera.aspect_ratio);\n\n \/\/render just the terrain (and grid outline for now)\n using flags_e = hex_map_t::render_flags_e;\n uint32_t flags = flags_e::terrain;\n rendered_map.render(flags_e(flags));\n\n camera = prev_camera;\n\n ASSERT(!CheckGLError(), \"GL Error building minimap\");\n }\n\n void minimap_t::render()\n {\n \/\/render texture to quad\n auto const& quad = app.renderer->quad;\n auto& shader = app.renderer->screen_shader;\n\n GL_State->bind(shader);\n\n float minimap_scale_px = 400.0f;\n\n \/\/shader->world_matrix = scale(translate(mat4(), vec3(0, 0, 0)), vec3(minimap_scale_px));\n shader->world_matrix = mat4();\n shader->view_matrix = mat4();\n shader->projection_matrix = glm::ortho<float>(-0.5f, 0.5f, -0.5f, 0.5f, -1.0f, 1.0f);\n\n float const& halfwidth = render_target.texture.halfwidth;\n float const& halfheight = render_target.texture.halfheight;\n\n \/\/project such that each unit is one pixel\n \/\/ shader->projection_matrix = ortho<float>(-halfwidth, halfwidth,\n \/\/ -halfheight, halfheight,\n \/\/ -1000, 1000);\n\n shader->update_wvp_uniform();\n\n glBindTexture(GL_TEXTURE_2D, render_target.texture.texture_id);\n quad.render();\n\n \/\/TODO: render box-outline representing current viewport\n \/\/ ie: how much of the map is on screen based on zoom\/pan\n }\n}\n}\n}\n<|endoftext|>"} {"text":"<commit_before>#include <modules\/graph2d\/processors\/plot2d.h>\n\n#include <modules\/plotting\/utils\/axisutils.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <inviwo\/core\/util\/raiiutils.h>\n#include <inviwo\/core\/algorithm\/boundingbox.h>\n#include <inviwo\/core\/rendering\/meshdrawerfactory.h>\n\n\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/openglutils.h>\n\n\n#include <modules\/opengl\/openglutils.h>\n#include <inviwo\/core\/datastructures\/coordinatetransformer.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n\nnamespace inviwo {\n\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo Plot2dProcessor::processorInfo_{\n \"org.inviwo.Plot2D\", \/\/ Class identifier\n \"Plot2D\", \/\/ Display name\n \"Plotting\", \/\/ Category\n CodeState::Stable, \/\/ Code state\n \"Plotting\", \/\/ Tags\n};\n\nconst ProcessorInfo Plot2dProcessor::getProcessorInfo() const { return processorInfo_; }\n\nPlot2dProcessor::Plot2dProcessor()\n : Processor()\n , inport_(\"inport\")\n , imageInport_(\"imageInport\")\n , outport_(\"outport\")\n , xAxis_(\"xAxis\", \"X Axis\")\n , yAxis_(\"yAxis\", \"Y Axis\")\n\t, position_(\"position\", \"Position\", vec3(0), vec3(-25), vec3(25), vec3(0.01))\n\t, size_(\"size\", \"Size\", vec2(3), vec2(0.01), vec2(25), vec2(0.01))\n , camera_(\"camera\", \"Camera\")\n\t, camera2d_{ InviwoApplication::getPtr()->getCameraFactory()->create(\"OrthographicCamera\") }\n , trackball_(&camera_)\n\t, axisRenderers_({ {xAxis_, yAxis_} })\n\t, xAxisSelection_(\"xAxisSelection\", \"X Axis\")\n\t, yAxisSelection_(\"yAxisSelection\", \"Y Axis\")\n\t, toggle3d_(\"toggle3d\", \"Render in 3D space\")\n\t, lineMesh_( std::make_shared<BasicMesh>() )\n\t, meshDrawer_( std::unique_ptr<MeshDrawer>() )\n\t, shader_(\"linerenderer.vert\", \"linerenderer.geom\", \"linerenderer.frag\", false)\n {\n\n\tshader_.onReload([this]() { invalidate(InvalidationLevel::InvalidResources); });\n\t\n\n\tMeshDrawerFactory* factory = InviwoApplication::getPtr()->getMeshDrawerFactory();\n\tmeshDrawer_ = std::move(factory->create(lineMesh_.get()));\n\n\t\n\t\/\/ Setup ports\n imageInport_.setOptional(true);\n addPort(inport_);\n addPort(imageInport_);\n addPort(outport_);\n\n\t\/\/ Add properties\n\taddProperty(toggle3d_);\n\taddProperty(position_);\n\taddProperty(size_);\n\taddProperties(xAxisSelection_, yAxisSelection_);\n\taddProperties(xAxis_, yAxis_);\n\taddProperty(camera_);\n\taddProperty(trackball_);\n\n\t\/\/ Set up property default values\n\ttoggle3d_.set(false);\n\tcamera_.setVisible(false);\n\tcamera_.setCollapsed(true);\n\ttrackball_.setVisible(false);\n\ttrackball_.setCollapsed(true);\n\n\t\/\/ Initialize the 2d camera.\n\tcamera2d_->setLookFrom(vec3(0, 0, 100));\n\tcamera2d_->setLookTo(vec3(0, 0, 0));\n\tcamera2d_->setLookUp(vec3(0, 1, 0));\n\tcamera2d_->setFarPlaneDist(200);\n\tcamera2d_->setNearPlaneDist(1);\n\n\t\/\/ Axis default values.\n\txAxis_.setCaption(\"x\");\n\tyAxis_.setCaption(\"y\");\n\tyAxis_.orientation_.setSelectedDisplayName(\"Vertical\");\n\n\tfor (auto axis : { &xAxis_, &yAxis_ }) {\n\t\taxis->captionSettings_.offset_.set(0.7f);\n\t\taxis->captionSettings_.position_.set(0.5f);\n\t\taxis->labelSettings_.offset_.set(0.7f);\n\n\t\taxis->majorTicks_.tickLength_.set(0.3f);\n\t\taxis->majorTicks_.tickWidth_.set(1.5f);\n\t\taxis->majorTicks_.style_.set(plot::TickStyle::Outside);\n\t\taxis->majorTicks_.setCurrentStateAsDefault();\n\n\t\taxis->minorTicks_.tickLength_.set(0.15f);\n\t\taxis->minorTicks_.tickWidth_.set(1.3f);\n\t\taxis->minorTicks_.style_.set(plot::TickStyle::Outside);\n\t\taxis->minorTicks_.setCurrentStateAsDefault();\n\n\t\taxis->setCollapsed(true);\n\t\taxis->orientation_.setVisible(false);\n\t\taxis->placement_.setVisible(false);\n\t\taxis->flipped_.setVisible(false);\n\t}\n\n\t\/\/ Event callbacks\n\ttoggle3d_.onChange([this] {\n\t\tposition_.setVisible(toggle3d_.get());\n\t\tsize_.setVisible(toggle3d_.get());\n\t\tcamera_.setVisible(toggle3d_.get());\n\t\ttrackball_.setVisible(toggle3d_.get());\n\t\tupdateDimensions();\n\t});\n\tsize_.onChange([this] { updateDimensions(); });\n\tposition_.onChange([this] { updateDimensions(); });\n\n\tinport_.onChange([this] {\n\t\treloadDatasets();\n\t\tupdatePlotData(); });\n\txAxisSelection_.onChange([this] { updatePlotData(); });\n\tyAxisSelection_.onChange([this] { updatePlotData(); });\n\txAxis_.range_.onChange([this] { updatePlotData(); });\n\tyAxis_.range_.onChange([this] { updatePlotData(); });\n\txAxis_.useDataRange_.onChange([this] { updatePlotData(); });\n\tyAxis_.useDataRange_.onChange([this] { updatePlotData(); });\n}\n\n\nvoid Plot2dProcessor::initializeResources() {\n\tLogInfo(\"Initializing resources plot2d\");\n\n\tshader_[ShaderType::Geometry]->addShaderDefine(\"ENABLE_ADJACENCY\", \"0\");\n\t\/\/shader_[ShaderType::Fragment]->addShaderDefine(\"ENABLE_ROUND_DEPTH_PROFILE\");\n\n\t\/\/ See createLineStripMesh()\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::PositionAttrib),\n\t\tstatic_cast<int>(BufferType::PositionAttrib),\n\t\t\"vec3\");\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::ColorAttrib),\n\t\tstatic_cast<int>(BufferType::ColorAttrib),\n\t\t\"vec4\");\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::TexcoordAttrib),\n\t\tstatic_cast<int>(BufferType::TexcoordAttrib),\n\t\t\"vec2\");\n\tshader_.build();\n\tshader_.activate();\n\tshader_.setUniform(\"antialiasing\", 0.0f);\n\tshader_.setUniform(\"miterLimit\", 1.0f);\n\tshader_.deactivate();\n}\n\n\nvoid Plot2dProcessor::process() {\n\tLogInfo(\"Process start\");\n\tif (imageInport_.isReady()) {\n\t\tutilgl::activateTargetAndCopySource(outport_, imageInport_, ImageType::ColorDepth);\n\t}\n\telse {\n\t\tutilgl::activateAndClearTarget(outport_, ImageType::ColorDepth);\n\t}\n\tconst size2_t dims = outport_.getDimensions();\n\tif (!toggle3d_.get() && oldDims_ != dims) updateDimensions();\n\t\n\t\/\/ Save a pointer to the camera that will be used\n\tCamera* activeCamera;\n\tif (toggle3d_.get())\n\t\tactiveCamera = &camera_.get();\n\telse\n\t\tactiveCamera = camera2d_.get();\n\n\tvec3 xVector(1, 0, 0);\n\tvec3 yVector(0, 1, 0);\n\n\tif (toggle3d_.get()) {\n\t\t\/\/ Set the normal of the graph plane to point towards camera.\n\t\tyVector = glm::normalize( camera_.getLookUp() );\n\t\txVector = glm::normalize( glm::cross(yVector, camera_.getLookFrom() - camera_.getLookTo()) );\n\t\tlineMesh_->setBasis(Matrix<3U, float>(\n\t\t\txVector * graphDims_[0],\n\t\t\tyVector * graphDims_[1],\n\t\t\tvec3(0, 0, 1)));\n\t}\n\n\t\/\/ Render lines.\n\tshader_.activate();\n\tutilgl::setShaderUniforms(shader_, *meshDrawer_->getMesh(), \"geometry\");\n\tutilgl::setShaderUniforms(shader_, *activeCamera, \"camera\");\n\tshader_.setUniform(\"screenDim\", vec2(outport_.getDimensions()));\n\tshader_.setUniform(\"lineWidth\", 2);\n\tmeshDrawer_->draw();\n\tshader_.deactivate();\n\n\t\/\/ Render x and y axis\n\taxisRenderers_[0].render(activeCamera, dims, origin_, origin_ + xVector * graphDims_[0], yVector);\n\taxisRenderers_[1].render(activeCamera, dims, origin_, origin_ + yVector * graphDims_[1], xVector);\n\t\n\t\n\n\tutilgl::deactivateCurrentTarget();\n}\n\n\nvoid Plot2dProcessor::reloadDatasets() {\n\tif (!inport_.hasData()) {\n\t\txAxisSelection_.clearOptions();\n\t\tyAxisSelection_.clearOptions();\n\t\treturn;\n\t}\n\tconst std::shared_ptr<const DataFrame> dataframe = inport_.getData();\n\t\/\/ Update column selection properties\n\tstd::vector<OptionPropertyStringOption> options;\n\tfor (const auto& column : *dataframe) {\n\t\toptions.emplace_back(column->getHeader(), column->getHeader(), column->getHeader());\n\t}\n\n\txAxisSelection_.replaceOptions(options);\n\tyAxisSelection_.replaceOptions(options);\n\txAxisSelection_.setCurrentStateAsDefault();\n\tyAxisSelection_.setCurrentStateAsDefault();\n}\n\nvoid Plot2dProcessor::updateDimensions() {\n\tif (toggle3d_.get()) {\n\t\torigin_ = position_.get();\n\t\tgraphDims_ = size_.get();\n\t}\n\telse {\n\t\tconst size2_t dims = outport_.getDimensions();\n\t\tconst float aspect = (float)dims[0] \/ (float)dims[1];\n\t\tconst float scale = (double)dims[0] \/ 512;\n\t\tconst float width = 50 * scale;\n\t\tconst float height = width \/ aspect;\n\t\tconst float padding = 50 * width \/ (double)dims[0];\n\n\t\toldDims_ = dims;\n\t\torigin_ = vec3(-width \/ 2 + padding, -height \/ 2 + padding, 0);\n\t\tgraphDims_ = vec2(width - 2 * padding, height - 2 * padding);\n\t\t\/\/ Update 2d camera to fit new dimensions.\n\t\tstatic_cast<OrthographicCamera*>(camera2d_.get())->setFrustum({ -width \/ 2.0f, +width \/ 2.0f, -width \/ 2.0f \/ aspect, +width \/ 2.0f \/ aspect });\n\t}\n\t\/\/ Scale and offset line mesh to align with axises.\n\tlineMesh_->setBasis(Matrix<3U, float>(graphDims_[0], 0, 0, 0, graphDims_[1], 0, 0, 0, 1));\n\tlineMesh_->setOffset(origin_);\n}\n\nvoid Plot2dProcessor::updatePlotData() {\n\t\/\/ Reset line mesh\n\tlineMesh_ = std::make_shared<BasicMesh>(); \n\tmeshDrawer_ = std::move(InviwoApplication::getPtr()->getMeshDrawerFactory()->create(lineMesh_.get()));\n\n\tif (!inport_.hasData()) return;\n\n\tconst std::shared_ptr<const DataFrame> dataframe = inport_.getData();\n\tconst std::shared_ptr<const Column> xCol = dataframe->getColumn(xAxisSelection_.getSelectedIndex());\n\tconst std::shared_ptr<const Column> yCol = dataframe->getColumn(yAxisSelection_.getSelectedIndex());\n\tsize_t nValues = xCol->getSize();\n\n\tif (xCol->getSize() < 2 || yCol->getSize() < 2 || yCol->getSize() != xCol->getSize()) return;\n\t\n\n\t\/\/ Set ranges for x and y axis\n\tif (xAxis_.getUseDataRange()) {\n\t\tdvec2 xrange(xCol->getAsDouble(0), xCol->getAsDouble(0));\n\t\tfor (size_t i = 1; i < nValues; ++i) {\n\t\t\tdouble v = xCol->getAsDouble(i);\n\t\t\tif (v < xrange[0]) xrange[0] = v;\n\t\t\tif (v > xrange[1]) xrange[1] = v;\n\t\t}\n\t\txAxis_.range_.set(xrange);\n\t}\n\n\tif (yAxis_.getUseDataRange()) {\n\t\tdvec2 yrange(yCol->getAsDouble(0), yCol->getAsDouble(0));\n\t\tfor (size_t i = 1; i < nValues; ++i) {\n\t\t\tif (xCol->getAsDouble(i) < xAxis_.getRange()[0] || xCol->getAsDouble(i) > xAxis_.getRange()[1]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdouble v = yCol->getAsDouble(i);\n\t\t\tif (v < yrange[0]) yrange[0] = v;\n\t\t\tif (v > yrange[1]) yrange[1] = v;\n\t\t}\n\t\tif (yrange[0] == yrange[1]) yrange[1] += 1;\n\t\tyAxis_.range_.set(yrange);\n\t}\n\n\tconst double offsetX = -xAxis_.getRange()[0];\n\tconst double offsetY = -yAxis_.getRange()[0];\n\tconst double scaleX = 1.0f \/ (xAxis_.getRange()[1] - xAxis_.getRange()[0]);\n\tconst double scaleY = 1.0f \/ (yAxis_.getRange()[1] - yAxis_.getRange()[0]);\n\n\tstd::shared_ptr<IndexBufferRAM> indices = lineMesh_->addIndexBuffer(DrawType::Lines, ConnectivityType::None);\n\tvec4 color(0.5, 0.3, 0.8, 1);\n\n\tauto getPoint = [xCol, yCol, offsetX, offsetY, scaleX, scaleY](const size_t index) {\n\t\treturn vec3((xCol->getAsDouble(index) + offsetX)*scaleX, (yCol->getAsDouble(index) + offsetY)*scaleY, 0);\n\t};\n\t\/\/\/\/ Add point from dataframe to line mesh\n\tfor (size_t i = 0; i < nValues - 1; ++i) {\n\t\tconst vec3 p1((xCol->getAsDouble(i) + offsetX)*scaleX, (yCol->getAsDouble(i) + offsetY)*scaleY, 0);\n\t\tconst vec3 p2((xCol->getAsDouble(i+1) + offsetX)*scaleX, (yCol->getAsDouble(i+1) + offsetY)*scaleY, 0);\n\t\tif (p1.x < 0 || p1.x > 1) continue;\n\t\tif (p2.x < 0 || p2.x > 1) continue;\n\t\tindices->add(lineMesh_->addVertex(p1, p1, p1, color));\n\t\tindices->add(lineMesh_->addVertex(p2, p2, p2, color));\n\t}\n\t\n\n\t\/\/ Update the dimensions of the mesh.\n\tupdateDimensions();\n\n}\n\n} \/\/ namespace<commit_msg>added point interpolation inside bounds<commit_after>#include <modules\/graph2d\/processors\/plot2d.h>\n\n#include <modules\/plotting\/utils\/axisutils.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <inviwo\/core\/util\/raiiutils.h>\n#include <inviwo\/core\/algorithm\/boundingbox.h>\n#include <inviwo\/core\/rendering\/meshdrawerfactory.h>\n\n\n#include <modules\/opengl\/texture\/textureutils.h>\n#include <modules\/opengl\/shader\/shaderutils.h>\n#include <modules\/opengl\/openglutils.h>\n\n\n#include <modules\/opengl\/openglutils.h>\n#include <inviwo\/core\/datastructures\/coordinatetransformer.h>\n#include <modules\/opengl\/texture\/textureutils.h>\n\nnamespace inviwo {\n\n\n\/\/ The Class Identifier has to be globally unique. Use a reverse DNS naming scheme\nconst ProcessorInfo Plot2dProcessor::processorInfo_{\n \"org.inviwo.Plot2D\", \/\/ Class identifier\n \"Plot2D\", \/\/ Display name\n \"Plotting\", \/\/ Category\n CodeState::Stable, \/\/ Code state\n \"Plotting\", \/\/ Tags\n};\n\nconst ProcessorInfo Plot2dProcessor::getProcessorInfo() const { return processorInfo_; }\n\nPlot2dProcessor::Plot2dProcessor()\n : Processor()\n , inport_(\"inport\")\n , imageInport_(\"imageInport\")\n , outport_(\"outport\")\n , xAxis_(\"xAxis\", \"X Axis\")\n , yAxis_(\"yAxis\", \"Y Axis\")\n\t, position_(\"position\", \"Position\", vec3(0), vec3(-25), vec3(25), vec3(0.01))\n\t, size_(\"size\", \"Size\", vec2(3), vec2(0.01), vec2(25), vec2(0.01))\n , camera_(\"camera\", \"Camera\")\n\t, camera2d_{ InviwoApplication::getPtr()->getCameraFactory()->create(\"OrthographicCamera\") }\n , trackball_(&camera_)\n\t, axisRenderers_({ {xAxis_, yAxis_} })\n\t, xAxisSelection_(\"xAxisSelection\", \"X Axis\")\n\t, yAxisSelection_(\"yAxisSelection\", \"Y Axis\")\n\t, toggle3d_(\"toggle3d\", \"Render in 3D space\")\n\t, lineMesh_( std::make_shared<BasicMesh>() )\n\t, meshDrawer_( std::unique_ptr<MeshDrawer>() )\n\t, shader_(\"linerenderer.vert\", \"linerenderer.geom\", \"linerenderer.frag\", false)\n {\n\n\tshader_.onReload([this]() { invalidate(InvalidationLevel::InvalidResources); });\n\t\n\n\tMeshDrawerFactory* factory = InviwoApplication::getPtr()->getMeshDrawerFactory();\n\tmeshDrawer_ = std::move(factory->create(lineMesh_.get()));\n\n\t\n\t\/\/ Setup ports\n imageInport_.setOptional(true);\n addPort(inport_);\n addPort(imageInport_);\n addPort(outport_);\n\n\t\/\/ Add properties\n\taddProperty(toggle3d_);\n\taddProperty(position_);\n\taddProperty(size_);\n\taddProperties(xAxisSelection_, yAxisSelection_);\n\taddProperties(xAxis_, yAxis_);\n\taddProperty(camera_);\n\taddProperty(trackball_);\n\n\t\/\/ Set up property default values\n\ttoggle3d_.set(false);\n\tcamera_.setVisible(false);\n\tcamera_.setCollapsed(true);\n\ttrackball_.setVisible(false);\n\ttrackball_.setCollapsed(true);\n\n\t\/\/ Initialize the 2d camera.\n\tcamera2d_->setLookFrom(vec3(0, 0, 100));\n\tcamera2d_->setLookTo(vec3(0, 0, 0));\n\tcamera2d_->setLookUp(vec3(0, 1, 0));\n\tcamera2d_->setFarPlaneDist(200);\n\tcamera2d_->setNearPlaneDist(1);\n\n\t\/\/ Axis default values.\n\txAxis_.setCaption(\"x\");\n\tyAxis_.setCaption(\"y\");\n\tyAxis_.orientation_.setSelectedDisplayName(\"Vertical\");\n\n\tfor (auto axis : { &xAxis_, &yAxis_ }) {\n\t\taxis->captionSettings_.offset_.set(0.7f);\n\t\taxis->captionSettings_.position_.set(0.5f);\n\t\taxis->labelSettings_.offset_.set(0.7f);\n\n\t\taxis->majorTicks_.tickLength_.set(0.3f);\n\t\taxis->majorTicks_.tickWidth_.set(1.5f);\n\t\taxis->majorTicks_.style_.set(plot::TickStyle::Outside);\n\t\taxis->majorTicks_.setCurrentStateAsDefault();\n\n\t\taxis->minorTicks_.tickLength_.set(0.15f);\n\t\taxis->minorTicks_.tickWidth_.set(1.3f);\n\t\taxis->minorTicks_.style_.set(plot::TickStyle::Outside);\n\t\taxis->minorTicks_.setCurrentStateAsDefault();\n\n\t\taxis->setCollapsed(true);\n\t\t\/\/axis->orientation_.setVisible(false);\n\t\t\/\/axis->placement_.setVisible(false);\n\t\t\/\/axis->flipped_.setVisible(false);\n\t}\n\n\t\/\/ Event callbacks\n\ttoggle3d_.onChange([this] {\n\t\tposition_.setVisible(toggle3d_.get());\n\t\tsize_.setVisible(toggle3d_.get());\n\t\tcamera_.setVisible(toggle3d_.get());\n\t\ttrackball_.setVisible(toggle3d_.get());\n\t\tupdateDimensions();\n\t});\n\tsize_.onChange([this] { updateDimensions(); });\n\tposition_.onChange([this] { updateDimensions(); });\n\n\tinport_.onChange([this] {\n\t\treloadDatasets();\n\t\tupdatePlotData(); });\n\txAxisSelection_.onChange([this] { updatePlotData(); });\n\tyAxisSelection_.onChange([this] { updatePlotData(); });\n\txAxis_.range_.onChange([this] { updatePlotData(); });\n\tyAxis_.range_.onChange([this] { updatePlotData(); });\n\txAxis_.useDataRange_.onChange([this] { updatePlotData(); });\n\tyAxis_.useDataRange_.onChange([this] { updatePlotData(); });\n}\n\n\nvoid Plot2dProcessor::initializeResources() {\n\tLogInfo(\"Initializing resources plot2d\");\n\n\tshader_[ShaderType::Geometry]->addShaderDefine(\"ENABLE_ADJACENCY\", \"0\");\n\t\/\/shader_[ShaderType::Fragment]->addShaderDefine(\"ENABLE_ROUND_DEPTH_PROFILE\");\n\n\t\/\/ See createLineStripMesh()\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::PositionAttrib),\n\t\tstatic_cast<int>(BufferType::PositionAttrib),\n\t\t\"vec3\");\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::ColorAttrib),\n\t\tstatic_cast<int>(BufferType::ColorAttrib),\n\t\t\"vec4\");\n\tshader_[ShaderType::Vertex]->addInDeclaration(\"in_\" + toString(BufferType::TexcoordAttrib),\n\t\tstatic_cast<int>(BufferType::TexcoordAttrib),\n\t\t\"vec2\");\n\tshader_.build();\n\tshader_.activate();\n\tshader_.setUniform(\"antialiasing\", 0.0f);\n\tshader_.setUniform(\"miterLimit\", 1.0f);\n\tshader_.deactivate();\n}\n\n\nvoid Plot2dProcessor::process() {\n\tLogInfo(\"Process start\");\n\tif (imageInport_.isReady()) {\n\t\tutilgl::activateTargetAndCopySource(outport_, imageInport_, ImageType::ColorDepth);\n\t}\n\telse {\n\t\tutilgl::activateAndClearTarget(outport_, ImageType::ColorDepth);\n\t}\n\tconst size2_t dims = outport_.getDimensions();\n\tif (!toggle3d_.get() && oldDims_ != dims) updateDimensions();\n\t\n\t\/\/ Save a pointer to the camera that will be used\n\tCamera* activeCamera;\n\tif (toggle3d_.get())\n\t\tactiveCamera = &camera_.get();\n\telse\n\t\tactiveCamera = camera2d_.get();\n\n\tvec3 xVector(1, 0, 0);\n\tvec3 yVector(0, 1, 0);\n\n\tif (toggle3d_.get()) {\n\t\t\/\/ Set the normal of the graph plane to point towards camera.\n\t\tyVector = glm::normalize( camera_.getLookUp() );\n\t\txVector = glm::normalize( glm::cross(yVector, camera_.getLookFrom() - camera_.getLookTo()) );\n\t\tlineMesh_->setBasis(Matrix<3U, float>(\n\t\t\txVector * graphDims_[0],\n\t\t\tyVector * graphDims_[1],\n\t\t\tvec3(0, 0, 1)));\n\t}\n\n\t\/\/ Render lines.\n\tshader_.activate();\n\tutilgl::setShaderUniforms(shader_, *meshDrawer_->getMesh(), \"geometry\");\n\tutilgl::setShaderUniforms(shader_, *activeCamera, \"camera\");\n\tshader_.setUniform(\"screenDim\", vec2(outport_.getDimensions()));\n\tshader_.setUniform(\"lineWidth\", 2);\n\tmeshDrawer_->draw();\n\tshader_.deactivate();\n\n\t\/\/ Render x and y axis\n\taxisRenderers_[0].render(activeCamera, dims, origin_, origin_ + xVector * graphDims_[0], yVector);\n\taxisRenderers_[1].render(activeCamera, dims, origin_, origin_ + yVector * graphDims_[1], xVector);\n\t\n\t\n\n\tutilgl::deactivateCurrentTarget();\n}\n\n\nvoid Plot2dProcessor::reloadDatasets() {\n\tif (!inport_.hasData()) {\n\t\txAxisSelection_.clearOptions();\n\t\tyAxisSelection_.clearOptions();\n\t\treturn;\n\t}\n\tconst std::shared_ptr<const DataFrame> dataframe = inport_.getData();\n\t\/\/ Update column selection properties\n\tstd::vector<OptionPropertyStringOption> options;\n\tfor (const auto& column : *dataframe) {\n\t\toptions.emplace_back(column->getHeader(), column->getHeader(), column->getHeader());\n\t}\n\n\txAxisSelection_.replaceOptions(options);\n\tyAxisSelection_.replaceOptions(options);\n\txAxisSelection_.setCurrentStateAsDefault();\n\tyAxisSelection_.setCurrentStateAsDefault();\n}\n\nvoid Plot2dProcessor::updateDimensions() {\n\tif (toggle3d_.get()) {\n\t\torigin_ = position_.get();\n\t\tgraphDims_ = size_.get();\n\t}\n\telse {\n\t\tconst size2_t dims = outport_.getDimensions();\n\t\tconst float aspect = (float)dims[0] \/ (float)dims[1];\n\t\tconst float scale = (double)dims[0] \/ 512;\n\t\tconst float width = 50 * scale;\n\t\tconst float height = width \/ aspect;\n\t\tconst float padding = 50 * width \/ (double)dims[0];\n\n\t\toldDims_ = dims;\n\t\torigin_ = vec3(-width \/ 2 + padding, -height \/ 2 + padding, 0);\n\t\tgraphDims_ = vec2(width - 2 * padding, height - 2 * padding);\n\t\t\/\/ Update 2d camera to fit new dimensions.\n\t\tstatic_cast<OrthographicCamera*>(camera2d_.get())->setFrustum({ -width \/ 2.0f, +width \/ 2.0f, -width \/ 2.0f \/ aspect, +width \/ 2.0f \/ aspect });\n\t}\n\t\/\/ Scale and offset line mesh to align with axises.\n\tlineMesh_->setBasis(Matrix<3U, float>(graphDims_[0], 0, 0, 0, graphDims_[1], 0, 0, 0, 1));\n\tlineMesh_->setOffset(origin_);\n}\n\nvoid Plot2dProcessor::updatePlotData() {\n\t\/\/ Reset line mesh\n\tlineMesh_ = std::make_shared<BasicMesh>(); \n\tmeshDrawer_ = std::move(InviwoApplication::getPtr()->getMeshDrawerFactory()->create(lineMesh_.get()));\n\n\tif (!inport_.hasData()) return;\n\n\tconst std::shared_ptr<const DataFrame> dataframe = inport_.getData();\n\tconst std::shared_ptr<const Column> xCol = dataframe->getColumn(xAxisSelection_.getSelectedIndex());\n\tconst std::shared_ptr<const Column> yCol = dataframe->getColumn(yAxisSelection_.getSelectedIndex());\n\tsize_t nValues = xCol->getSize();\n\n\tif (xCol->getSize() < 2 || yCol->getSize() < 2 || yCol->getSize() != xCol->getSize()) return;\n\t\n\n\t\/\/ Set ranges for x and y axis\n\tif (xAxis_.getUseDataRange()) {\n\t\tdvec2 xrange(xCol->getAsDouble(0), xCol->getAsDouble(0));\n\t\tfor (size_t i = 1; i < nValues; ++i) {\n\t\t\tdouble v = xCol->getAsDouble(i);\n\t\t\tif (v < xrange[0]) xrange[0] = v;\n\t\t\tif (v > xrange[1]) xrange[1] = v;\n\t\t}\n\t\txAxis_.range_.set(xrange);\n\t}\n\n\tif (yAxis_.getUseDataRange()) {\n\t\tdvec2 yrange(yCol->getAsDouble(0), yCol->getAsDouble(0));\n\t\tfor (size_t i = 1; i < nValues; ++i) {\n\t\t\tif (xCol->getAsDouble(i) < xAxis_.getRange()[0] || xCol->getAsDouble(i) > xAxis_.getRange()[1]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tdouble v = yCol->getAsDouble(i);\n\t\t\tif (v < yrange[0]) yrange[0] = v;\n\t\t\tif (v > yrange[1]) yrange[1] = v;\n\t\t}\n\t\tif (yrange[0] == yrange[1]) yrange[1] += 1;\n\t\tyAxis_.range_.set(yrange);\n\t}\n\n\tconst double offsetX = -xAxis_.getRange()[0];\n\tconst double offsetY = -yAxis_.getRange()[0];\n\tconst double scaleX = 1.0f \/ (xAxis_.getRange()[1] - xAxis_.getRange()[0]);\n\tconst double scaleY = 1.0f \/ (yAxis_.getRange()[1] - yAxis_.getRange()[0]);\n\n\tstd::shared_ptr<IndexBufferRAM> indices = lineMesh_->addIndexBuffer(DrawType::Lines, ConnectivityType::None);\n\tvec4 color(0.5, 0.3, 0.8, 1);\n\t\n\tauto inBounds = [](const vec3 p) {\n\t\t\/\/ Is point inside the bounds of the graph\n\t\treturn (p.x >= 0 && p.x <= 1 && p.y >= 0 && p.y <= 1);\n\t};\n\n\tauto boundIntersection = [this](const vec3& p1, const vec3& p2) {\n\t\t\/\/ Return the point on the edge of the bounding rectangle of the graph\n\t\t\/\/ given the line segment p1->p2. p1 is inside the bounds.\n\t\tconst vec3 v = p2 - p1;\n\t\tfloat t = 1;\n\t\tfor (const float n : { -p1.x \/ v.x, (1 - p1.x) \/ v.x, -p1.y \/ v.y, (1 - p1.y) \/ v.y })\n\t\t\tif (n > 0 && n < t) t = n;\n\t\tif (t == 1) t = 0;\n\t\tLogInfo(\"Interpolation: \"\n\t\t\t<< p1 << \"\\n\"\n\t\t\t<< p2 << \"\\n\"\n\t\t\t<< v << \"\\n\"\n\t\t\t<< t);\n\t\treturn p1 + t * v;\n\t};\n\n\n\t\/\/ Add point from dataframe to line mesh\n\tfor (size_t i = 0; i < nValues - 1; ++i) {\n\t\t\/\/ Get points from columns and scale them to be in the value range [0,1]\n\t\tvec3 p1((xCol->getAsDouble(i) + offsetX)*scaleX, (yCol->getAsDouble(i) + offsetY)*scaleY, 0);\n\t\tvec3 p2((xCol->getAsDouble(i + 1) + offsetX)*scaleX, (yCol->getAsDouble(i + 1) + offsetY)*scaleY, 0);\n\t\t\n\t\tif ( !inBounds(p1) && !inBounds(p2) ) continue;\n\t\t\/\/ If one of the points inside bounds, interpolate the edge intersection point\n\t\telse if ( !inBounds(p2) ) p2 = boundIntersection(p1, p2);\n\t\telse if ( !inBounds(p1) ) p1 = boundIntersection(p2, p1);\n\n\t\tindices->add(lineMesh_->addVertex(p1, p1, p1, color));\n\t\tindices->add(lineMesh_->addVertex(p2, p2, p2, color));\n\t}\n\n\t\/\/ Update the dimensions of the mesh.\n\tupdateDimensions();\n\n}\n\n} \/\/ namespace<|endoftext|>"} {"text":"<commit_before>#include \"gtest\/gtest.h\"\n#include \"xigua\/xigua.hpp\"\n\nusing namespace xig;\n\nTEST(Standard_Library_Function, Fn) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= add [fn (a b) [+ a b]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[add 1 1]\")), make_integer(2));\n\n evaluate(env, parser::from_string(\"[= multi [fn (a) [1] (a b) [2]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[multi 1]\")), make_integer(1));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[multi 1 1]\")), make_integer(2));\n}\n\nTEST(Standard_Library_Function, ConditionalArgs) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= equal [fn ([== a b]) [a]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[equal 1 1]\")), make_integer(1));\n\n evaluate(env, parser::from_string(\"[= abso [fn ([< i 0]) [- 0 i] (i) [i]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[abso 10]\")), make_integer(10));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[abso -11]\")), make_integer(11));\n\n evaluate(env, parser::from_string(\"[= maxi [fn ([> x y]) [x] (x y) [y]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 10 11]\")),\n make_integer(11));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 20 2]\")),\n make_integer(20));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 20 20]\")),\n make_integer(20));\n\n evaluate(env, parser::from_string(\"[= a [fn ([> x [+ x y]]) [x]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[a 4 -2]\")), make_integer(4));\n}\n\nTEST(Standard_Library_Function, EqualArgs) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= isOne [fn (1) [true] (x) [false]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne 1]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne :pipe]\")),\n make_boolean(false));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne [- 2 1]]\")),\n make_boolean(true));\n\n evaluate(env,\n parser::from_string(\n \"[= isPipe [fn (:pipe) [true] (:pipes) [true] (x) [false]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe :pipe]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe :pipes]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe 22]\")),\n make_boolean(false));\n}\n\nTEST(Standard_Library_Function, Recursion) {\n enviroment env = get_global_enviroment();\n\n evaluate(env, parser::from_string(\n \"[= fac1 [fn (0) [1] (n) [* n [fac1 [- n 1]]]]]\"));\n evaluate(env, parser::from_string(\n \"[= fac2 [fn (0) [1] (n) [* [fac2 [- n 1]] n]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[fac1 5]\")), make_integer(120));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[fac2 5]\")), make_integer(120));\n}\n<commit_msg>test conditional args for exception<commit_after>#include \"gtest\/gtest.h\"\n#include \"xigua\/xigua.hpp\"\n\nusing namespace xig;\n\nTEST(Standard_Library_Function, Fn) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= add [fn (a b) [+ a b]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[add 1 1]\")), make_integer(2));\n\n evaluate(env, parser::from_string(\"[= multi [fn (a) [1] (a b) [2]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[multi 1]\")), make_integer(1));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[multi 1 1]\")), make_integer(2));\n}\n\nTEST(Standard_Library_Function, ConditionalArgs) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= equal [fn ([== a b]) [a]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[equal 1 1]\")), make_integer(1));\n\n evaluate(env, parser::from_string(\"[= abso [fn ([< i 0]) [- 0 i] (i) [i]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[abso 10]\")), make_integer(10));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[abso -11]\")), make_integer(11));\n\n evaluate(env, parser::from_string(\"[= maxi [fn ([> x y]) [x] (x y) [y]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 10 11]\")),\n make_integer(11));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 20 2]\")),\n make_integer(20));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[maxi 20 20]\")),\n make_integer(20));\n\n evaluate(env, parser::from_string(\"[= a [fn ([> x [+ x y]]) [x]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[a 4 -2]\")), make_integer(4));\n\n evaluate(env,\n parser::from_string(\n \"[= first-two? [fn ([== [first b] 2]) [true] (c) [false]]]\"));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[first-two? 4]\")),\n make_boolean(false));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[first-two? (2 3 5)]\")),\n make_boolean(true));\n}\n\nTEST(Standard_Library_Function, EqualArgs) {\n enviroment env = get_global_enviroment();\n evaluate(env, parser::from_string(\"[= isOne [fn (1) [true] (x) [false]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne 1]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne :pipe]\")),\n make_boolean(false));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isOne [- 2 1]]\")),\n make_boolean(true));\n\n evaluate(env,\n parser::from_string(\n \"[= isPipe [fn (:pipe) [true] (:pipes) [true] (x) [false]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe :pipe]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe :pipes]\")),\n make_boolean(true));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[isPipe 22]\")),\n make_boolean(false));\n}\n\nTEST(Standard_Library_Function, Recursion) {\n enviroment env = get_global_enviroment();\n\n evaluate(env, parser::from_string(\n \"[= fac1 [fn (0) [1] (n) [* n [fac1 [- n 1]]]]]\"));\n evaluate(env, parser::from_string(\n \"[= fac2 [fn (0) [1] (n) [* [fac2 [- n 1]] n]]]\"));\n\n EXPECT_EQ(evaluate(env, parser::from_string(\"[fac1 5]\")), make_integer(120));\n EXPECT_EQ(evaluate(env, parser::from_string(\"[fac2 5]\")), make_integer(120));\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 C. Brett Witherspoon\n *\/\n\n#include <algorithm>\n#include <cmath>\n#include <complex>\n#include <iostream>\n#include <stdexcept>\n\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/compute\/core.hpp>\n\nnamespace compute = boost::compute;\nnamespace po = boost::program_options;\n\nnamespace\n{\nconst char *source = BOOST_PP_STRINGIZE(\n\n __kernel void window(__global float4 *x, uint n)\n {\n uint i = get_global_id(0);\n\n \/\/ Hamming\n float4 w;\n w.xy = 0.54 - 0.46 * cos(2*M_PI_F*(2*i)\/(n-1));\n w.zw = 0.54 - 0.46 * cos(2*M_PI_F*(2*i+1)\/(n-1));\n\n x[i] = w * x[i];\n }\n\n __kernel void twiddle(__global float2 *x, uint n)\n {\n uint k = get_global_id(0);\n\n \/\/ e^{-j 2 \\pi k\/n)\n x[k] = cos((float2)(2*M_PI_F*k\/n, 2*M_PI_F*k\/n + M_PI_F\/2));\n }\n\n __kernel void reorder(__global float2 *x, uint s)\n {\n uint i = get_global_id(0);\n\n \/\/ Reverse bits\n uint j = i;\n j = (j & 0xFFFF0000) >> 16 | (j & 0x0000FFFF) << 16;\n j = (j & 0xFF00FF00) >> 8 | (j & 0x00FF00FF) << 8;\n j = (j & 0xF0F0F0F0) >> 4 | (j & 0x0F0F0F0F) << 4;\n j = (j & 0xCCCCCCCC) >> 2 | (j & 0x33333333) << 2;\n j = (j & 0xAAAAAAAA) >> 1 | (j & 0x55555555) << 1;\n\n \/\/ Adjust number of bits for log2(length)\n j >>= 32 - s;\n\n \/\/ Swap items\n if (i < j)\n {\n float2 tmp = x[i];\n x[i] = x[j];\n x[j] = tmp;\n }\n }\n\n __kernel void stage1(__global float4 *v)\n {\n uint i = get_global_id(0);\n\n \/\/ Bufferfly\n float2 tmp = v[i].xy;\n v[i].xy = v[i].xy + v[i].zw;\n v[i].zw = tmp - v[i].zw;\n }\n\n __kernel void stagex(__global float2 *v, uint n, uint m, uint s)\n {\n \/\/ Indices\n uint i = get_global_id(0);\n uint j = 1 << (s - 1);\n\n \/\/ Twiddle\n uint mask = ~(0xFFFFFFFF << (s - 1));\n uint k = (i & mask) * (1 << (m - s));\n float2 w = cos((float2)(2*M_PI_F*k\/n, 2*M_PI_F*k\/n + M_PI_F\/2));\n\n \/\/ Complex multiply\n float2 z = (float2)(v[i+j].x*w.x - v[i+j].y*w.y, v[i+j].x*w.y + v[i+j].y*w.x);\n\n \/\/ Butterfly\n v[i+j] = v[i] - z;\n v[i] = v[i] + z;\n }\n);\n\nbool ispowertwo(unsigned int x)\n{\n return (x != 0) && !(x & (x - 1));\n}\n\n} \/\/ end anonymous namespace\n\nint main(int argc, char *argv[])\n{\n size_t length;\n\n po::options_description desc(\"Supported options\");\n desc.add_options()\n (\"help,h\", \"print help message\")\n (\"length,l\", po::value<size_t>(&length)->default_value(8), \"set FFT length\");\n po::variables_map vm;\n po::store(po::parse_command_line(argc, argv, desc), vm);\n po::notify(vm);\n\n if (vm.count(\"help\"))\n {\n std::cerr << desc << std::endl;\n return 1;\n }\n\n if (!ispowertwo(length))\n {\n std::cerr << \"FFT Length must be a power of two\" << std::endl;\n return 1;\n }\n\n const size_t stages = static_cast<size_t>(log2(length));\n\n compute::device device = compute::system::default_device();\n compute::context context(device);\n compute::command_queue queue(context, device, compute::command_queue::enable_profiling);\n\n \/\/ Print some device information\n std::cout << device.platform().name() << \": \" << device.name() << std::endl;\n std::cout << \"Global memory size: \" << device.global_memory_size() << std::endl;\n std::cout << \"Local memory size: \" << device.local_memory_size() << std::endl;\n std::cout << \"Compute units: \" << device.compute_units() << std::endl;\n std::cout << \"Preferred vector width: \" <<device.preferred_vector_width<float>() << std::endl;\n\n \/\/ Build program and create kernels\n auto program = compute::program::create_with_source(source, context);\n\n compute::kernel window_kernel;\n compute::kernel reorder_kernel;\n compute::kernel stage1_kernel;\n compute::kernel stagex_kernel;\n\n try\n {\n program.build();\n window_kernel = program.create_kernel(\"window\");\n reorder_kernel = program.create_kernel(\"reorder\");\n stage1_kernel = program.create_kernel(\"stage1\");\n stagex_kernel = program.create_kernel(\"stagex\");\n }\n catch (compute::opencl_error &error)\n {\n std::cerr << error.what() << \": \" << std::endl << program.build_log();\n return 1;\n }\n\n \/\/ Allocate kernel buffers\n auto flags = compute::buffer::read_write | compute::buffer::alloc_host_ptr;\n auto size = length * sizeof(std::complex<float>);\n compute::buffer buffer(context, size, flags);\n\n \/\/ Set kernel arguments\n window_kernel.set_arg(0, buffer);\n window_kernel.set_arg(1, length);\n\n reorder_kernel.set_arg(0, buffer);\n reorder_kernel.set_arg(1, stages);\n\n stage1_kernel.set_arg(0, buffer);\n\n stagex_kernel.set_arg(0, buffer);\n stagex_kernel.set_arg(1, length);\n stagex_kernel.set_arg(2, stages);\n stagex_kernel.set_arg(3, 1);\n\n \/\/ Initialize input buffer\n auto ptr = queue.enqueue_map_buffer(buffer,\n compute::command_queue::map_write, 0,\n buffer.size());\n auto buf = static_cast<std::complex<float>*>(ptr);\n \/\/std::generate(buf, buf + length, []() { return std::complex<float>(1,1); });\n std::iota(buf, buf + length, 0);\n queue.enqueue_unmap_buffer(buffer, ptr).wait();\n\n compute::wait_list events;\n\n \/\/ Enqueue kernels\n \/\/auto window_event = queue.enqueue_1d_range_kernel(window_kernel, 0, length\/2, 0);\n events.insert(queue.enqueue_1d_range_kernel(reorder_kernel, 0, length, 0));\n events.insert(queue.enqueue_1d_range_kernel(stage1_kernel, 0, length\/2, 0, events[0]));\n\n for (size_t i = 2; i <= stages; ++i)\n {\n stagex_kernel.set_arg(3, i);\n\n auto groups = length >> i;\n auto items = 1 << i;\n\n for (size_t g = 0; g < groups; ++g)\n {\n events.insert(queue.enqueue_1d_range_kernel(stagex_kernel, g * items, items \/ 2, 0, events[i-1]));\n }\n }\n\n \/\/ Print output buffer\n ptr = queue.enqueue_map_buffer(buffer,\n compute::command_queue::map_read, 0,\n buffer.size(), events);\n buf = static_cast<std::complex<float>*>(ptr);\n for (size_t i = 0; i < length; ++i) std::cout << buf[i] << std::endl;\n queue.enqueue_unmap_buffer(buffer, ptr).wait();\n\n return 0;\n}\n<commit_msg>opencl: misc improvements to FFT example<commit_after>\/*\n * Copyright 2016 C. Brett Witherspoon\n *\/\n\n#include <algorithm>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <iostream>\n#include <stdexcept>\n\n#include <boost\/preprocessor\/stringize.hpp>\n#include <boost\/program_options.hpp>\n#include <boost\/compute\/core.hpp>\n\nnamespace compute = boost::compute;\nnamespace po = boost::program_options;\n\nnamespace\n{\nconst char *source = BOOST_PP_STRINGIZE(\n\n __kernel void window(__global float4 *x, uint n)\n {\n uint i = get_global_id(0);\n\n \/\/ Hamming\n float4 w;\n w.xy = 0.54 - 0.46 * cos(2*M_PI_F*(2*i)\/(n-1));\n w.zw = 0.54 - 0.46 * cos(2*M_PI_F*(2*i+1)\/(n-1));\n\n x[i] = w * x[i];\n }\n\n __kernel void twiddle(__global float2 *x, uint n)\n {\n uint k = get_global_id(0);\n\n \/\/ e^{-j 2 \\pi k\/n)\n x[k] = cos((float2)(2*M_PI_F*k\/n, 2*M_PI_F*k\/n + M_PI_F\/2));\n }\n\n __kernel void reorder(__global float2 *x, uint s)\n {\n uint i = get_global_id(0);\n\n \/\/ Reverse bits\n uint j = i;\n j = (j & 0xFFFF0000) >> 16 | (j & 0x0000FFFF) << 16;\n j = (j & 0xFF00FF00) >> 8 | (j & 0x00FF00FF) << 8;\n j = (j & 0xF0F0F0F0) >> 4 | (j & 0x0F0F0F0F) << 4;\n j = (j & 0xCCCCCCCC) >> 2 | (j & 0x33333333) << 2;\n j = (j & 0xAAAAAAAA) >> 1 | (j & 0x55555555) << 1;\n\n \/\/ Adjust number of bits for log2(length)\n j >>= 32 - s;\n\n \/\/ Swap items\n if (i < j)\n {\n float2 tmp = x[i];\n x[i] = x[j];\n x[j] = tmp;\n }\n }\n\n __kernel void stage1(__global float4 *v)\n {\n uint i = get_global_id(0);\n\n \/\/ Bufferfly\n float2 tmp = v[i].xy;\n v[i].xy = v[i].xy + v[i].zw;\n v[i].zw = tmp - v[i].zw;\n }\n\n __kernel void stagex(__global float2 *v, uint n, uint m, uint s)\n {\n \/\/ Indices\n uint i = get_global_id(0);\n uint j = 1 << (s - 1);\n\n \/\/ Twiddle\n uint mask = ~(0xFFFFFFFF << (s - 1));\n uint k = (i & mask) * (1 << (m - s));\n float2 w = cos((float2)(2*M_PI_F*k\/n, 2*M_PI_F*k\/n + M_PI_F\/2));\n\n \/\/ Complex multiply\n float2 z = (float2)(v[i+j].x*w.x - v[i+j].y*w.y, v[i+j].x*w.y + v[i+j].y*w.x);\n\n \/\/ Butterfly\n v[i+j] = v[i] - z;\n v[i] = v[i] + z;\n }\n);\n\nbool ispowertwo(unsigned int x)\n{\n return !(x == 0 || (x & (x - 1)));\n}\n\n} \/\/ end anonymous namespace\n\nint main(int argc, char *argv[])\n{\n size_t length;\n\n po::options_description desc(\"Supported options\");\n desc.add_options()\n (\"help,h\", \"print help message\")\n (\"length,l\", po::value<size_t>(&length)->default_value(8), \"set FFT length\");\n po::variables_map vm;\n po::store(po::parse_command_line(argc, argv, desc), vm);\n po::notify(vm);\n\n if (vm.count(\"help\"))\n {\n std::cerr << desc << std::endl;\n return 1;\n }\n\n if (!ispowertwo(length))\n {\n std::cerr << \"FFT Length must be a power of two\" << std::endl;\n return 1;\n }\n\n const size_t stages = static_cast<size_t>(log2(length));\n\n compute::device device = compute::system::default_device();\n compute::context context(device);\n compute::command_queue queue(context, device, compute::command_queue::enable_profiling);\n\n \/\/ Print some device information\n std::cout << device.platform().name() << \": \" << device.name() << std::endl;\n std::cout << \"Global memory size: \" << device.global_memory_size() << std::endl;\n std::cout << \"Local memory size: \" << device.local_memory_size() << std::endl;\n std::cout << \"Compute units: \" << device.compute_units() << std::endl;\n std::cout << \"Preferred vector width: \" <<device.preferred_vector_width<float>() << std::endl;\n\n \/\/ Build program and create kernels\n auto program = compute::program::create_with_source(source, context);\n\n compute::kernel window_kernel;\n compute::kernel reorder_kernel;\n compute::kernel stage1_kernel;\n compute::kernel stagex_kernel;\n\n try\n {\n program.build();\n window_kernel = program.create_kernel(\"window\");\n reorder_kernel = program.create_kernel(\"reorder\");\n stage1_kernel = program.create_kernel(\"stage1\");\n stagex_kernel = program.create_kernel(\"stagex\");\n }\n catch (compute::opencl_error &error)\n {\n std::cerr << error.what() << \": \" << std::endl << program.build_log();\n return 1;\n }\n\n \/\/ Allocate kernel buffers\n auto flags = compute::buffer::read_write | compute::buffer::alloc_host_ptr;\n auto size = length * sizeof(std::complex<float>);\n compute::buffer buffer(context, size, flags);\n\n \/\/ Set kernel arguments\n window_kernel.set_arg(0, buffer);\n window_kernel.set_arg(1, length);\n\n reorder_kernel.set_arg(0, buffer);\n reorder_kernel.set_arg(1, stages);\n\n stage1_kernel.set_arg(0, buffer);\n\n stagex_kernel.set_arg(0, buffer);\n stagex_kernel.set_arg(1, length);\n stagex_kernel.set_arg(2, stages);\n stagex_kernel.set_arg(3, 1);\n\n \/\/ Initialize input buffer\n auto ptr = queue.enqueue_map_buffer(buffer,\n compute::command_queue::map_write, 0,\n buffer.size());\n auto buf = static_cast<std::complex<float>*>(ptr);\n\n std::default_random_engine eng;\n std::normal_distribution<> dist{0, 1};\n auto rand = std::bind(dist, eng);\n std::generate(buf, buf + length, rand);\n\n std::cout << \"Input: \" << std::endl;\n for (size_t i = 0; i < length; ++i) std::cout << buf[i] << std::endl;\n\n queue.enqueue_unmap_buffer(buffer, ptr).wait();\n\n compute::wait_list events;\n\n \/\/ Enqueue kernels\n \/\/auto window_event = queue.enqueue_1d_range_kernel(window_kernel, 0, length\/2, 0);\n events.insert(queue.enqueue_1d_range_kernel(reorder_kernel, 0, length, 0));\n events.insert(queue.enqueue_1d_range_kernel(stage1_kernel, 0, length\/2, 0, events[0]));\n\n for (size_t i = 2; i <= stages; ++i)\n {\n stagex_kernel.set_arg(3, i);\n\n auto groups = length >> i;\n auto items = 1 << i;\n\n for (size_t g = 0; g < groups; ++g)\n {\n events.insert(queue.enqueue_1d_range_kernel(stagex_kernel, g * items, items \/ 2, 0, events[i-1]));\n }\n }\n\n events.wait();\n\n \/\/ Print profiling information\n std::chrono::nanoseconds time{0};\n for (const auto &event : events)\n {\n time += event.duration<std::chrono::nanoseconds>();\n }\n std::cout << \"Execute time: \" << time.count() << \" ns\" << std::endl;\n\n \/\/ Print output buffer\n ptr = queue.enqueue_map_buffer(buffer,\n compute::command_queue::map_read, 0,\n buffer.size());\n buf = static_cast<std::complex<float>*>(ptr);\n\n std::cout << \"Output: \" << std::endl;\n for (size_t i = 0; i < length; ++i) std::cout << buf[i] << std::endl;\n\n queue.enqueue_unmap_buffer(buffer, ptr).wait();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <vector>\n#include <cmath>\n#include <iostream>\nusing namespace std;\n\ntypedef pair<double, double> point;\n\nbool cw(const point &a, const point &b, const point &c) {\n return (b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first) < 0;\n}\n\nvector<point> convexHull(vector<point> p) {\n int n = p.size();\n if (n <= 1)\n return p;\n int k = 0;\n sort(p.begin(), p.end());\n vector<point> q(n * 2);\n for (int i = 0; i < n; q[k++] = p[i++])\n for (; k >= 2 && !cw(q[k - 2], q[k - 1], p[i]); --k)\n ;\n for (int i = n - 2, t = k; i >= 0; q[k++] = p[i--])\n for (; k > t && !cw(q[k - 2], q[k - 1], p[i]); --k)\n ;\n q.resize(k - 1 - (q[0] == q[1]));\n return q;\n}\n\ndouble area(const point &a, const point &b, const point &c) {\n return abs((b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first));\n}\n\ndouble dist(const point &a, const point &b) {\n return hypot(a.first - b.first, a.second - b.second);\n}\n\ndouble diameter(const vector<point> &p) {\n vector<point> h = convexHull(p);\n int m = h.size();\n if (m == 1)\n return 0;\n if (m == 2)\n return dist(h[0], h[1]);\n int k = 1;\n while (area(h[m - 1], h[0], h[(k + 1) % m]) > area(h[m - 1], h[0], h[k]))\n ++k;\n double res = 0;\n for (int i = 0, j = k; i <= k && j < m; i++) {\n res = max(res, dist(h[i], h[j]));\n while (j < m && area(h[i], h[(i + 1) % m], h[(j + 1) % m]) > area(h[i], h[(i + 1) % m], h[j])) {\n res = max(res, dist(h[i], h[(j + 1) % m]));\n ++j;\n }\n }\n return res;\n}\n\nint main() {\n vector<point> points(4);\n points[0] = point(0, 0);\n points[1] = point(3, 0);\n points[2] = point(0, 3);\n points[3] = point(1, 1);\n double d = diameter(points);\n cout << d << endl;\n}\n<commit_msg>update<commit_after>#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef pair<double, double> point;\n\nbool cw(const point &a, const point &b, const point &c) {\n return (b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first) < 0;\n}\n\nvector<point> convexHull(vector<point> p) {\n int n = p.size();\n if (n <= 1)\n return p;\n int k = 0;\n sort(p.begin(), p.end());\n vector<point> q(n * 2);\n for (int i = 0; i < n; q[k++] = p[i++])\n for (; k >= 2 && !cw(q[k - 2], q[k - 1], p[i]); --k)\n ;\n for (int i = n - 2, t = k; i >= 0; q[k++] = p[i--])\n for (; k > t && !cw(q[k - 2], q[k - 1], p[i]); --k)\n ;\n q.resize(k - 1 - (q[0] == q[1]));\n return q;\n}\n\ndouble area(const point &a, const point &b, const point &c) {\n return abs((b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first));\n}\n\ndouble dist(const point &a, const point &b) {\n return hypot(a.first - b.first, a.second - b.second);\n}\n\ndouble diameter(const vector<point> &p) {\n vector<point> h = convexHull(p);\n int m = h.size();\n if (m == 1)\n return 0;\n if (m == 2)\n return dist(h[0], h[1]);\n int k = 1;\n while (area(h[m - 1], h[0], h[(k + 1) % m]) > area(h[m - 1], h[0], h[k]))\n ++k;\n double res = 0;\n for (int i = 0, j = k; i <= k && j < m; i++) {\n res = max(res, dist(h[i], h[j]));\n while (j < m && area(h[i], h[(i + 1) % m], h[(j + 1) % m]) > area(h[i], h[(i + 1) % m], h[j])) {\n res = max(res, dist(h[i], h[(j + 1) % m]));\n ++j;\n }\n }\n return res;\n}\n\n\/\/ usage example\nint main() {\n double d = diameter({{0, 0},\n {3, 0},\n {0, 3},\n {1, 1}});\n cout << d << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"CppUTest\/TestHarness.h\"\n#include \"CppUTestExt\/MockSupport.h\"\n\n#include <include\/amici.h>\n#include <cstring>\n#include \"wrapfunctions.h\"\n#include \"src\/ami_hdf5.h\"\n\n#define HDFFILE \"..\/expectedResults.h5\"\n#define TEST_EPSILON 1e-12\n\n#ifndef __APPLE__\n#include <iostream>\n#endif\n\nTEST_GROUP(group1)\n{\n void setup() {\n\n }\n\n void teardown() {\n\n }\n};\n\n\nUserData *getTestUserData() {\n UserData *udata = new UserData;\n memset(udata, 0, sizeof(*udata));\n\n init_modeldims(udata);\n\n udata->am_qpositivex = new double[udata->am_nx];\n udata->am_p = new double[udata->am_np];\n udata->am_k = new double[udata->am_nk];\n udata->am_idlist = new realtype[udata->am_np]();\n for(int i = 0; i < udata->am_np; ++i)\n udata->am_idlist[i] = 0;\n\n processUserData(udata);\n\n return udata;\n}\n\nExpData *getTestExpData() {\n ExpData *edata = new ExpData;\n memset(edata, 0, sizeof(*edata));\n\n return edata;\n}\n\n\n\/*\n * Test for mem leaks in UserData initalization \/ destruction\n *\/\nTEST(group1, testCreateAndFreeUserData) {\n UserData *udata = getTestUserData();\n\n freeUserData(udata);\n}\n\n\/*\n * Test for mem leaks in ExpData initalization \/ destruction\n *\/\n\nTEST(group1, testCreateAndFreeExpData) {\n ExpData *edata = getTestExpData();\n\n freeExpData(edata);\n}\n\n\/*\n * Test for mem leaks in ReturnData initalization \/ destruction\n *\/\n\nTEST(group1, testCreateAndFreeReturnData) {\n ReturnData *rdata = new ReturnData;\n memset(rdata, 0, sizeof(*rdata));\n\n freeReturnData(rdata);\n}\n\nvoid checkEqualArray(const double *expected, const double *actual, int length) {\n for(int i = 0; i < length; ++i)\n {\n#ifndef __APPLE__\n if(expected[i] != actual[i])\n std::cout<<i<<\"\/\"<<length<<\" \"<<expected[i]<<\" \"<<actual[i]<<std::endl;\n#endif\n DOUBLES_EQUAL(expected[i], actual[i], TEST_EPSILON);\n }\n}\n\nvoid verifyReturnData(const char* resultPath, const ReturnData *rdata, const UserData*udata) {\n CHECK_TRUE(isinf(*rdata->am_llhdata) || isnan(*rdata->am_llhdata));\n\n \/\/ compare to saved data in hdf file\n hid_t file_id = H5Fopen(HDFFILE, H5F_ACC_RDONLY, H5P_DEFAULT);\n\n hsize_t m, n, o;\n\n double *expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"x\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_xdata, udata->am_nt * udata->am_nx);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"J\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_Jdata, udata->am_nx * udata->am_nx);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numrhsevals\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numrhsevalsdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numsteps\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numstepsdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"order\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_orderdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"y\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_ydata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"sigmay\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_sigmaydata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"xdot\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_xdotdata, udata->am_nx);\n delete[] expected;\n\n if(udata->am_sensi > 0) {\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"sllh\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_sllhdata, udata->am_np);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numrhsevalsS\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numrhsevalsSdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numstepsS\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numstepsSdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"ssigmay\", &expected, &m, &n, &o);\n checkEqualArray(expected, rdata->am_ssigmaydata, udata->am_nt * udata->am_ny * udata->am_nplist);\n delete[] expected;\n\n if(udata->am_sensi_meth == 1) {\n \/\/ TODO: there are deviations in sx and sy CHECK!\n\/\/ AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"sx\", &expected, &m, &n, &o);\n\/\/ checkEqualArray(expected, rdata->am_sxdata, udata->am_nt * udata->am_nx * udata->am_nplist);\n\/\/ delete[] expected;\n\n\/\/ AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"sy\", &expected, &m, &n, &o);\n\/\/ checkEqualArray(expected, rdata->am_sydata, udata->am_nt * udata->am_ny * udata->am_nplist);\n\/\/ delete[] expected;\n\n }\n\n } else {\n POINTERS_EQUAL(NULL, rdata->am_sllhdata);\n POINTERS_EQUAL(NULL, rdata->am_numrhsevalsSdata);\n POINTERS_EQUAL(NULL, rdata->am_numstepsSdata);\n\n }\n\n H5Fclose(file_id);\n}\n\nTEST(group1, testSimulation) {\n \/\/ read simulation options\n UserData *udata = AMI_HDF5_readSimulationUserDataFromFileName(HDFFILE, \"\/model_dirac\/nosensi\/options\");\n ExpData *edata = getTestExpData();\n\n int status;\n ReturnData *rdata = getSimulationResults(udata, edata, &status);\n CHECK_EQUAL(0, status);\n\n \/\/ TODO proper paths \/testDirac1\/...\n verifyReturnData(\"\/model_dirac\/nosensi\/results\", rdata, udata);\n\n freeReturnData(rdata);\n freeExpData(edata);\n freeUserData(udata);\n}\n\nTEST(group1, testSimulationExpData) {\n\n}\n\nTEST(group1, testSensitivityForward) {\n \/\/ read simulation options\n UserData *udata = AMI_HDF5_readSimulationUserDataFromFileName(HDFFILE, \"\/model_dirac\/sensiforward\/options\");\n ExpData *edata = getTestExpData();\n\n int status;\n ReturnData *rdata = getSimulationResults(udata, edata, &status);\n CHECK_EQUAL(0, status);\n\n \/\/ TODO proper paths \/testDirac1\/...\n verifyReturnData(\"\/model_dirac\/sensiforward\/results\", rdata, udata);\n\n freeReturnData(rdata);\n freeExpData(edata);\n freeUserData(udata);\n}\n\nTEST(group1, testSensitivityState) {\n\n}\n\nTEST(group1, testSensitivityAdjoint) {\n\n}\n\n\n<commit_msg>Reenable checks for sx and sy<commit_after>#include \"CppUTest\/TestHarness.h\"\n#include \"CppUTestExt\/MockSupport.h\"\n\n#include <include\/amici.h>\n#include <cstring>\n#include \"wrapfunctions.h\"\n#include \"src\/ami_hdf5.h\"\n\n#define HDFFILE \"..\/expectedResults.h5\"\n#define TEST_EPSILON 1e-12\n\n#ifndef __APPLE__\n#include <iostream>\n#endif\n\nTEST_GROUP(group1)\n{\n void setup() {\n\n }\n\n void teardown() {\n\n }\n};\n\n\nUserData *getTestUserData() {\n UserData *udata = new UserData;\n memset(udata, 0, sizeof(*udata));\n\n init_modeldims(udata);\n\n udata->am_qpositivex = new double[udata->am_nx];\n udata->am_p = new double[udata->am_np];\n udata->am_k = new double[udata->am_nk];\n udata->am_idlist = new realtype[udata->am_np]();\n for(int i = 0; i < udata->am_np; ++i)\n udata->am_idlist[i] = 0;\n\n processUserData(udata);\n\n return udata;\n}\n\nExpData *getTestExpData() {\n ExpData *edata = new ExpData;\n memset(edata, 0, sizeof(*edata));\n\n return edata;\n}\n\n\n\/*\n * Test for mem leaks in UserData initalization \/ destruction\n *\/\nTEST(group1, testCreateAndFreeUserData) {\n UserData *udata = getTestUserData();\n\n freeUserData(udata);\n}\n\n\/*\n * Test for mem leaks in ExpData initalization \/ destruction\n *\/\n\nTEST(group1, testCreateAndFreeExpData) {\n ExpData *edata = getTestExpData();\n\n freeExpData(edata);\n}\n\n\/*\n * Test for mem leaks in ReturnData initalization \/ destruction\n *\/\n\nTEST(group1, testCreateAndFreeReturnData) {\n ReturnData *rdata = new ReturnData;\n memset(rdata, 0, sizeof(*rdata));\n\n freeReturnData(rdata);\n}\n\nvoid checkEqualArray(const double *expected, const double *actual, int length) {\n for(int i = 0; i < length; ++i)\n {\n#ifndef __APPLE__\n if(expected[i] != actual[i])\n std::cout<<i<<\"\/\"<<length<<\" \"<<expected[i]<<\" \"<<actual[i]<<std::endl;\n#endif\n DOUBLES_EQUAL(expected[i], actual[i], TEST_EPSILON);\n }\n}\n\nvoid verifyReturnData(const char* resultPath, const ReturnData *rdata, const UserData*udata) {\n CHECK_TRUE(isinf(*rdata->am_llhdata) || isnan(*rdata->am_llhdata));\n\n \/\/ compare to saved data in hdf file\n hid_t file_id = H5Fopen(HDFFILE, H5F_ACC_RDONLY, H5P_DEFAULT);\n\n hsize_t m, n, o;\n\n double *expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"x\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_xdata, udata->am_nt * udata->am_nx);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"J\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_Jdata, udata->am_nx * udata->am_nx);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numrhsevals\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numrhsevalsdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numsteps\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numstepsdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"order\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_orderdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"y\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_ydata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"sigmay\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_sigmaydata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"xdot\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_xdotdata, udata->am_nx);\n delete[] expected;\n\n if(udata->am_sensi > 0) {\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"sllh\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_sllhdata, udata->am_np);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numrhsevalsS\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numrhsevalsSdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute2D(file_id, resultPath, \"numstepsS\", &expected, &m, &n);\n checkEqualArray(expected, rdata->am_numstepsSdata, udata->am_nt);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"ssigmay\", &expected, &m, &n, &o);\n checkEqualArray(expected, rdata->am_ssigmaydata, udata->am_nt * udata->am_ny * udata->am_nplist);\n delete[] expected;\n\n if(udata->am_sensi_meth == 1) {\n AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"sx\", &expected, &m, &n, &o);\n checkEqualArray(expected, rdata->am_sxdata, udata->am_nt * udata->am_nx * udata->am_nplist);\n delete[] expected;\n\n AMI_HDF5_getDoubleArrayAttribute3D(file_id, resultPath, \"sy\", &expected, &m, &n, &o);\n checkEqualArray(expected, rdata->am_sydata, udata->am_nt * udata->am_ny * udata->am_nplist);\n delete[] expected;\n\n }\n\n } else {\n POINTERS_EQUAL(NULL, rdata->am_sllhdata);\n POINTERS_EQUAL(NULL, rdata->am_numrhsevalsSdata);\n POINTERS_EQUAL(NULL, rdata->am_numstepsSdata);\n\n }\n\n H5Fclose(file_id);\n}\n\nTEST(group1, testSimulation) {\n \/\/ read simulation options\n UserData *udata = AMI_HDF5_readSimulationUserDataFromFileName(HDFFILE, \"\/model_dirac\/nosensi\/options\");\n ExpData *edata = getTestExpData();\n\n int status;\n ReturnData *rdata = getSimulationResults(udata, edata, &status);\n CHECK_EQUAL(0, status);\n\n \/\/ TODO proper paths \/testDirac1\/...\n verifyReturnData(\"\/model_dirac\/nosensi\/results\", rdata, udata);\n\n freeReturnData(rdata);\n freeExpData(edata);\n freeUserData(udata);\n}\n\nTEST(group1, testSimulationExpData) {\n\n}\n\nTEST(group1, testSensitivityForward) {\n \/\/ read simulation options\n UserData *udata = AMI_HDF5_readSimulationUserDataFromFileName(HDFFILE, \"\/model_dirac\/sensiforward\/options\");\n ExpData *edata = getTestExpData();\n\n int status;\n ReturnData *rdata = getSimulationResults(udata, edata, &status);\n CHECK_EQUAL(0, status);\n\n \/\/ TODO proper paths \/testDirac1\/...\n verifyReturnData(\"\/model_dirac\/sensiforward\/results\", rdata, udata);\n\n freeReturnData(rdata);\n freeExpData(edata);\n freeUserData(udata);\n}\n\nTEST(group1, testSensitivityState) {\n\n}\n\nTEST(group1, testSensitivityAdjoint) {\n\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"cc\/dual_net\/factory.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"gflags\/gflags.h\"\n\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n#include <thread>\n#include \"cc\/dual_net\/inference_server.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"remote\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n\n#ifdef MG_ENABLE_TF_DUAL_NET\n#include \"cc\/dual_net\/tf_dual_net.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"tf\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n\n#ifdef MG_ENABLE_LITE_DUAL_NET\n#include \"cc\/dual_net\/lite_dual_net.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"lite\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n\nDEFINE_string(engine, MG_DEFAULT_ENGINE,\n \"The inference engine to use. Accepted values:\"\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n \" \\\"remote\\\"\"\n#endif\n#ifdef MG_ENABLE_TF_DUAL_NET\n \" \\\"tf\\\"\"\n#endif\n#ifdef MG_ENABLE_LITE_DUAL_NET\n \" \\\"lite\\\"\"\n#endif\n);\n\nDEFINE_string(checkpoint_dir, \"\",\n \"Path to a directory containing TensorFlow model checkpoints. \"\n \"The inference worker will monitor this when a new checkpoint \"\n \"is found, load the model and use it for futher inferences. \"\n \"Only valid when remote inference is enabled.\");\nDEFINE_bool(use_tpu, true,\n \"If true, the remote inference will be run on a TPU. Ignored when \"\n \"remote_inference=false.\");\nDEFINE_string(tpu_name, \"\", \"Cloud TPU name, e.g. grpc:\/\/10.240.2.2:8470.\");\nDEFINE_int32(conv_width, 256, \"Width of the model's convolution filters.\");\nDEFINE_int32(parallel_tpus, 8,\n \"If model=remote, the number of TPU cores to run on in parallel.\");\nDEFINE_int32(port, 50051, \"The port opened by the InferenceService server.\");\nDECLARE_int32(virtual_losses);\n\nnamespace minigo {\n\nnamespace {\n\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\nclass RemoteDualNetFactory : public DualNetFactory {\n public:\n explicit RemoteDualNetFactory(std::string model_path, int parallel_games)\n : DualNetFactory(std::move(model_path)) {\n inference_worker_thread_ = std::thread([this]() {\n std::vector<std::string> cmd_parts = {\n absl::StrCat(\"BOARD_SIZE=\", kN),\n \"python\",\n \"inference_worker.py\",\n absl::StrCat(\"--model=\", model()),\n absl::StrCat(\"--checkpoint_dir=\", FLAGS_checkpoint_dir),\n absl::StrCat(\"--use_tpu=\", FLAGS_use_tpu),\n absl::StrCat(\"--tpu_name=\", FLAGS_tpu_name),\n absl::StrCat(\"--conv_width=\", FLAGS_conv_width),\n absl::StrCat(\"--parallel_tpus=\", FLAGS_parallel_tpus),\n };\n auto cmd = absl::StrJoin(cmd_parts, \" \");\n FILE* f = popen(cmd.c_str(), \"r\");\n for (;;) {\n int c = fgetc(f);\n if (c == EOF) {\n break;\n }\n fputc(c, stderr);\n }\n fputc('\\n', stderr);\n });\n\n int games_per_inference = std::max(1, parallel_games \/ 2);\n server_ = absl::make_unique<InferenceServer>(\n FLAGS_virtual_losses, games_per_inference, FLAGS_port);\n }\n\n ~RemoteDualNetFactory() override {\n server_.reset(nullptr);\n inference_worker_thread_.join();\n }\n\n std::unique_ptr<DualNet> New() override { return server_->NewDualNet(); }\n\n private:\n std::thread inference_worker_thread_;\n std::unique_ptr<InferenceServer> server_;\n};\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n\n#ifdef MG_ENABLE_TF_DUAL_NET\nclass TfDualNetFactory : public DualNetFactory {\n public:\n TfDualNetFactory(std::string model_path)\n : DualNetFactory(std::move(model_path)) {}\n\n std::unique_ptr<DualNet> New() override {\n return absl::make_unique<TfDualNet>(model());\n }\n};\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n\n#ifdef MG_ENABLE_LITE_DUAL_NET\nclass LiteDualNetFactory : public DualNetFactory {\n public:\n LiteDualNetFactory(std::string model_path)\n : DualNetFactory(std::move(model_path)) {}\n\n std::unique_ptr<DualNet> New() override {\n return absl::make_unique<LiteDualNet>(model());\n }\n};\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n\n} \/\/ namespace\n\nDualNetFactory::~DualNetFactory() = default;\n\nstd::unique_ptr<DualNetFactory> NewDualNetFactory(std::string model_path,\n int parallel_games) {\n if (FLAGS_engine == \"remote\") {\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n return absl::make_unique<RemoteDualNetFactory>(std::move(model_path),\n parallel_games);\n#else\n MG_FATAL() << \"Binary wasn't compiled with remote inference support\";\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n }\n\n if (FLAGS_engine == \"tf\") {\n#ifdef MG_ENABLE_TF_DUAL_NET\n return absl::make_unique<TfDualNetFactory>(std::move(model_path));\n#else\n MG_FATAL() << \"Binary wasn't compiled with tf inference support\";\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n }\n\n if (FLAGS_engine == \"lite\") {\n#ifdef MG_ENABLE_LITE_DUAL_NET\n return absl::make_unique<LiteDualNetFactory>(std::move(model_path));\n#else\n MG_FATAL() << \"Binary wasn't compiled with lite inference support\";\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n }\n\n MG_FATAL() << \"Unrecognized inference engine \\\"\" << FLAGS_engine << \"\\\"\";\n return nullptr;\n}\n\n} \/\/ namespace minigo\n<commit_msg>Add fc_width flag for remote inference<commit_after>#include \"cc\/dual_net\/factory.h\"\n\n#include \"absl\/memory\/memory.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"absl\/strings\/str_join.h\"\n#include \"gflags\/gflags.h\"\n\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n#include <thread>\n#include \"cc\/dual_net\/inference_server.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"remote\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n\n#ifdef MG_ENABLE_TF_DUAL_NET\n#include \"cc\/dual_net\/tf_dual_net.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"tf\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n\n#ifdef MG_ENABLE_LITE_DUAL_NET\n#include \"cc\/dual_net\/lite_dual_net.h\"\n#ifndef MG_DEFAULT_ENGINE\n#define MG_DEFAULT_ENGINE \"lite\"\n#endif \/\/ MG_DEFAULT_ENGINE\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n\nDEFINE_string(engine, MG_DEFAULT_ENGINE,\n \"The inference engine to use. Accepted values:\"\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n \" \\\"remote\\\"\"\n#endif\n#ifdef MG_ENABLE_TF_DUAL_NET\n \" \\\"tf\\\"\"\n#endif\n#ifdef MG_ENABLE_LITE_DUAL_NET\n \" \\\"lite\\\"\"\n#endif\n);\n\nDEFINE_string(checkpoint_dir, \"\",\n \"Path to a directory containing TensorFlow model checkpoints. \"\n \"The inference worker will monitor this when a new checkpoint \"\n \"is found, load the model and use it for futher inferences. \"\n \"Only valid when remote inference is enabled.\");\nDEFINE_bool(use_tpu, true,\n \"If true, the remote inference will be run on a TPU. Ignored when \"\n \"remote_inference=false.\");\nDEFINE_string(tpu_name, \"\", \"Cloud TPU name, e.g. grpc:\/\/10.240.2.2:8470.\");\nDEFINE_int32(conv_width, 256, \"Width of the model's convolution filters.\");\nDEFINE_int32(fc_width, 256,\n \"Width of the model's fully connected layer in value head.\");\nDEFINE_int32(parallel_tpus, 8,\n \"If model=remote, the number of TPU cores to run on in parallel.\");\nDEFINE_int32(port, 50051, \"The port opened by the InferenceService server.\");\nDECLARE_int32(virtual_losses);\n\nnamespace minigo {\n\nnamespace {\n\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\nclass RemoteDualNetFactory : public DualNetFactory {\n public:\n explicit RemoteDualNetFactory(std::string model_path, int parallel_games)\n : DualNetFactory(std::move(model_path)) {\n inference_worker_thread_ = std::thread([this]() {\n std::vector<std::string> cmd_parts = {\n absl::StrCat(\"BOARD_SIZE=\", kN),\n \"python\",\n \"inference_worker.py\",\n absl::StrCat(\"--model=\", model()),\n absl::StrCat(\"--checkpoint_dir=\", FLAGS_checkpoint_dir),\n absl::StrCat(\"--use_tpu=\", FLAGS_use_tpu),\n absl::StrCat(\"--tpu_name=\", FLAGS_tpu_name),\n absl::StrCat(\"--conv_width=\", FLAGS_conv_width),\n absl::StrCat(\"--fc_width=\", FLAGS_fc_width),\n absl::StrCat(\"--parallel_tpus=\", FLAGS_parallel_tpus),\n };\n auto cmd = absl::StrJoin(cmd_parts, \" \");\n FILE* f = popen(cmd.c_str(), \"r\");\n for (;;) {\n int c = fgetc(f);\n if (c == EOF) {\n break;\n }\n fputc(c, stderr);\n }\n fputc('\\n', stderr);\n });\n\n int games_per_inference = std::max(1, parallel_games \/ 2);\n server_ = absl::make_unique<InferenceServer>(\n FLAGS_virtual_losses, games_per_inference, FLAGS_port);\n }\n\n ~RemoteDualNetFactory() override {\n server_.reset(nullptr);\n inference_worker_thread_.join();\n }\n\n std::unique_ptr<DualNet> New() override { return server_->NewDualNet(); }\n\n private:\n std::thread inference_worker_thread_;\n std::unique_ptr<InferenceServer> server_;\n};\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n\n#ifdef MG_ENABLE_TF_DUAL_NET\nclass TfDualNetFactory : public DualNetFactory {\n public:\n TfDualNetFactory(std::string model_path)\n : DualNetFactory(std::move(model_path)) {}\n\n std::unique_ptr<DualNet> New() override {\n return absl::make_unique<TfDualNet>(model());\n }\n};\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n\n#ifdef MG_ENABLE_LITE_DUAL_NET\nclass LiteDualNetFactory : public DualNetFactory {\n public:\n LiteDualNetFactory(std::string model_path)\n : DualNetFactory(std::move(model_path)) {}\n\n std::unique_ptr<DualNet> New() override {\n return absl::make_unique<LiteDualNet>(model());\n }\n};\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n\n} \/\/ namespace\n\nDualNetFactory::~DualNetFactory() = default;\n\nstd::unique_ptr<DualNetFactory> NewDualNetFactory(std::string model_path,\n int parallel_games) {\n if (FLAGS_engine == \"remote\") {\n#ifdef MG_ENABLE_REMOTE_DUAL_NET\n return absl::make_unique<RemoteDualNetFactory>(std::move(model_path),\n parallel_games);\n#else\n MG_FATAL() << \"Binary wasn't compiled with remote inference support\";\n#endif \/\/ MG_ENABLE_REMOTE_DUAL_NET\n }\n\n if (FLAGS_engine == \"tf\") {\n#ifdef MG_ENABLE_TF_DUAL_NET\n return absl::make_unique<TfDualNetFactory>(std::move(model_path));\n#else\n MG_FATAL() << \"Binary wasn't compiled with tf inference support\";\n#endif \/\/ MG_ENABLE_TF_DUAL_NET\n }\n\n if (FLAGS_engine == \"lite\") {\n#ifdef MG_ENABLE_LITE_DUAL_NET\n return absl::make_unique<LiteDualNetFactory>(std::move(model_path));\n#else\n MG_FATAL() << \"Binary wasn't compiled with lite inference support\";\n#endif \/\/ MG_ENABLE_LITE_DUAL_NET\n }\n\n MG_FATAL() << \"Unrecognized inference engine \\\"\" << FLAGS_engine << \"\\\"\";\n return nullptr;\n}\n\n} \/\/ namespace minigo\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: msg.cxx,v $\n *\n * $Revision: 1.4 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 16:27:18 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sfx2.hxx\"\n\n#ifndef _SFXITEMPOOL_HXX \/\/autogen\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef GCC\n#endif\n\n#include \"msg.hxx\"\n\n\/\/====================================================================\n\nSfxSlotKind SfxSlot::GetKind() const\n{\n if( !nMasterSlotId && !nValue)\n return (SfxSlotKind) SFX_KIND_STANDARD;\n if ( nMasterSlotId && fnExec==0 && fnState==0 )\n {\n if ( pType->Type() == TYPE(SfxBoolItem) )\n return (SfxSlotKind) SFX_KIND_ENUM;\n else\n {\n DBG_ERROR( \"invalid slot kind detected\" );\n return SFX_KIND_ENUM;\n }\n }\n else\n return (SfxSlotKind) SFX_KIND_ATTR;\n}\n\n\/\/--------------------------------------------------------------------\n\nUSHORT SfxSlot::GetWhich( const SfxItemPool &rPool ) const\n{\n if ( !nMasterSlotId || nMasterSlotId == USHRT_MAX )\n ((SfxSlot*) this) -> nMasterSlotId = rPool.GetWhich(nSlotId);\n return nMasterSlotId;\n}\n\n\n<commit_msg>INTEGRATION: CWS vgbugs07 (1.4.218); FILE MERGED 2007\/06\/04 13:34:45 vg 1.4.218.1: #i76605# Remove -I ...\/inc\/module hack introduced by hedaburemove01<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: msg.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: hr $ $Date: 2007-06-27 23:06:26 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sfx2.hxx\"\n\n#ifndef _SFXITEMPOOL_HXX \/\/autogen\n#include <svtools\/itempool.hxx>\n#endif\n#ifndef _SFXENUMITEM_HXX \/\/autogen\n#include <svtools\/eitem.hxx>\n#endif\n#ifndef GCC\n#endif\n\n#include <sfx2\/msg.hxx>\n\n\/\/====================================================================\n\nSfxSlotKind SfxSlot::GetKind() const\n{\n if( !nMasterSlotId && !nValue)\n return (SfxSlotKind) SFX_KIND_STANDARD;\n if ( nMasterSlotId && fnExec==0 && fnState==0 )\n {\n if ( pType->Type() == TYPE(SfxBoolItem) )\n return (SfxSlotKind) SFX_KIND_ENUM;\n else\n {\n DBG_ERROR( \"invalid slot kind detected\" );\n return SFX_KIND_ENUM;\n }\n }\n else\n return (SfxSlotKind) SFX_KIND_ATTR;\n}\n\n\/\/--------------------------------------------------------------------\n\nUSHORT SfxSlot::GetWhich( const SfxItemPool &rPool ) const\n{\n if ( !nMasterSlotId || nMasterSlotId == USHRT_MAX )\n ((SfxSlot*) this) -> nMasterSlotId = rPool.GetWhich(nSlotId);\n return nMasterSlotId;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <QtGui>\n#include <QMessageBox>\n#include <QFileDialog>\n#include <QGraphicsScene>\n#include <iostream>\n#include <algorithm>\n#include \"main_window.hpp\"\n\n#include <QDebug>\n\n#include \"geometry_msgs\/Pose.h\"\n\nusing namespace Qt;\n\nnamespace map_marker {\n\n\tconst double map_min = -5;\n\tconst double map_max = 5;\n\tconst double map_pix = 992;\n\n\tconst QColor red = QColor(180, 40, 0);\n\tconst QColor blue = QColor(30, 30, 140);\n\tconst QColor green = QColor(50, 140, 30);\n\tconst QColor orange = QColor(230, 120, 0);\n\n\t\n\n\n\tMainWindow::MainWindow(int argc, char** argv, QWidget *parent) : QMainWindow(parent), qnode(argc,argv) {\n\t\tui.setupUi(this);\n\t\tqnode.init();\n\n\t\t\/* HOEFT NIET\n\t\tQObject::connect(ui.btnLoadYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnLoadYaml_clicked()));\n\t\tQObject::connect(ui.btnLoadMap, SIGNAL(clicked(bool)), this, SLOT(on_btnLoadMap_clicked()));\n\t\tQObject::connect(ui.btnWriteYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnWriteYaml_clicked()));\n\t\tQObject::connect(ui.btnClearYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnClearYaml_clicked()));\n\t\tQObject::connect(ui.btnAddCurrentPose, SIGNAL(clicked(bool)), this, SLOT(on_btnAddCurrentPose_clicked()));\n\t\tQObject::connect(ui.btnAddCustomPose, SIGNAL(clicked(bool)), this, SLOT(on_btnAddCustomPose_clicked()));\n\t\t*\/\n\n\t\tQObject::connect(ui.tableWidget->selectionModel(), SIGNAL(selectionChanged(const QItemSelection &, const QItemSelection &)), SLOT(DrawRobotOnImage()));\n\n\t\tQString url = \"\/home\/lars\/git\/ESA-PROJ\/maps\/legomap3-cropped.pgm\";\n\t\tmap = new QPixmap(url);\n\n\t\t\/\/ Ttable editing\n\t\tui.tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n\t\tui.tableWidget->setSelectionBehavior(QAbstractItemView::SelectRows);\n\t\tui.tableWidget->setSelectionMode(QAbstractItemView::SingleSelection);\n\n\t\t\/\/ Create map image\n\t\tlblMapImage = new ClickableLabel(this);\n\t\tlblMapImage->setAlignment(Qt::AlignBottom | Qt::AlignRight);\n\t\tlblMapImage->setGeometry(QRect(0, 0, map_pix, map_pix));\n\t\tlblMapImage->setPixmap(*map);\n\t\tQObject::connect(lblMapImage, SIGNAL(clicked(QPoint)), this, SLOT(lblMapImage_clicked(QPoint)));\n\n\t\t\/\/ Set validator for input fields\n\t\tui.inpCustomX->setValidator(new QDoubleValidator(-100, 100, 5, ui.inpCustomX));\n\t\tui.inpCustomY->setValidator(new QDoubleValidator(-100, 100, 5, ui.inpCustomY));\n\t\tui.inpCustomAngle->setValidator(new QDoubleValidator(0, 360, 5, ui.inpCustomAngle));\n\n\t\t\/\/ Panic button color\n\t\tui.btnPanic->setStyleSheet(\"color: rgb(192,0,0);\");\n\n\t\tMarker m(1.0, 2.0, 40.0, Navigation);\n\t\tAddMarker(m);\n\n\t\tUpdateTable();\n\t}\n\n\tMainWindow::~MainWindow() {\n\t\tdelete map;\n\t\tdelete lblMapImage;\n\n\t}\n\n\tvoid MainWindow::lblMapImage_clicked(QPoint a) {\n\t\tQString x = QString::number(ConvertPixelToRobot(a.x()));\n\t\tQString y = QString::number(ConvertPixelToRobot(a.y()));\n\t\tui.inpCustomX->setText(x);\n\t\tui.inpCustomY->setText(y);\n\t}\n\n\tvoid MainWindow::on_btnLoadYaml_clicked() {\n\n\t\t\/\/yaml.printYaml(\"\/home\/viki\/git\/ESA-PROJ\/maps\/legomap-cropped.yaml\");\n\t\tyaml.loadYaml(\"\/home\/viki\/git\/ESA-PROJ\/maps\/legomap-cropped.yaml\");\n\t}\n\n\tvoid MainWindow::on_btnLoadMap_clicked() {\n\t\tQFileDialog dialog(this);\n\t\tdialog.setFileMode(QFileDialog::AnyFile);\n\t\tdialog.setNameFilter(tr(\"Map image file (*.pbm *.pgm *.ppm)\"));\n\n\t\tQStringList fileNames;\n\t\tif (dialog.exec())\n\t\tfileNames = dialog.selectedFiles();\n\n\t\tmap = new QPixmap(fileNames[0]);\n\t\t\tlblMapImage->setPixmap(*map);\n\t}\n\n\tvoid MainWindow::on_btnWriteYaml_clicked() {\n\t\tROS_ERROR(\"Not implemented yet :(\");\n\t}\n\n\tvoid MainWindow::on_btnClearYaml_clicked() {\n\t\tROS_ERROR(\"Not implemented yet :(\");\n\t}\n\n\tvoid MainWindow::on_btnAddCurrentPose_clicked() {\n\t\tgeometry_msgs::Pose pos = qnode.GetRobotPosition();\n\n\t\tMarkerType type;\n\t\tif(ui.radioNav->isChecked()) {\n\t\t\ttype = Navigation;\n\t\t} else if (ui.radioWorkspace->isChecked()) {\n\t\t\ttype = Workspace;\n\t\t}\n\n\t\tAddMarker(Marker(pos, type));\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnAddCustomPose_clicked() {\n\t\tdouble x = ui.inpCustomX->text().toDouble();\n\t\tdouble y = ui.inpCustomY->text().toDouble();\n\t\tdouble angle = ui.inpCustomAngle->text().toDouble();\n\t\t\n\t\tMarkerType type;\n\t\tif(ui.radioNav->isChecked()) {\n\t\t\ttype = Navigation;\n\t\t} else if (ui.radioWorkspace->isChecked()) {\n\t\t\ttype = Workspace;\n\t\t}\n\t\t\n\t\tAddMarker(Marker(x, y, angle, type));\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnMoveRobot_clicked() {\n\t\tint index = GetSelectedMarker();\n\t\tif(index == -1) {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t\treturn;\n\t\t} \n\t\tMarker * m = &markers[index];\n\t\tqnode.MoveRobotToPose(m->GetPose());\n\t}\n\n\tvoid MainWindow::on_btnRemoveMarker_clicked() {\n\t\tint index = GetSelectedMarker();\n\t\tif(index == -1) {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t\treturn;\n\t\t} \n\t\tmarkers.erase(markers.begin()+index);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnPanic_clicked() {\n\t\tqnode.Panic();\n\t\tROS_INFO(\"Panic button pressed, stopped robot...\");\n\t}\n\n\tvoid MainWindow::on_btnMoveMarkerUp_clicked() {\n\t\tint selectedMarker = GetSelectedMarker();\n\t\tMoveMarkerUp(selectedMarker);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnMoveMarkerDown_clicked() {\n\t\tint selectedMarker = GetSelectedMarker();\n\t\tMoveMarkerDown(selectedMarker);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnClearAllMarkers_clicked() {\n\t\tmarkers.clear();\n\t\tUpdateTable();\n\t}\n\n\tint MainWindow::GetSelectedMarker() {\n\t\tint j = -1;\n\t\tQModelIndexList indexes = ui.tableWidget->selectionModel()->selectedRows();\n\n\t\tfor (int i = 0; i < indexes.count(); ++i) { \n\t\t\tj = indexes.at(i).row();\n\t\t}\n\n\t\treturn j;\n\t}\n\n\tvoid MainWindow::AddMarker(Marker marker) {\n\t\tmarkers.push_back(marker);\n\t}\n\n\tvoid MainWindow::MoveMarkerUp(int selectedMarker) {\n\t\tif(selectedMarker + 1 < markers.size() && selectedMarker >= 0) {\n\t\t\tstd::swap(markers.at(selectedMarker), markers.at(selectedMarker + 1));\n\t\t} else {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t}\n\t}\n\n\tvoid MainWindow::MoveMarkerDown(int selectedMarker) {\n\t\tif(selectedMarker > 0) {\n\t\t\tstd::swap(markers.at(selectedMarker), markers.at(selectedMarker - 1));\n\t\t} else {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t}\n\t}\n\n\tvoid MainWindow::UpdateTable() {\n\t\tui.tableWidget->setRowCount(0);\n\t\tfor(int i=0; i < markers.size(); i++) {\n\t\t\tui.tableWidget->insertRow ( ui.tableWidget->rowCount() );\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 0, new QTableWidgetItem(QString::fromStdString(markers[i].GetTypeStr())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 1, new QTableWidgetItem(QString::number(markers[i].GetX())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 2, new QTableWidgetItem(QString::number(markers[i].GetY())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 3, new QTableWidgetItem(QString::number(markers[i].GetAngle())));\n\t\t}\n\t\tDrawRobotOnImage();\n\t}\n\n\tvoid MainWindow::DrawRobotOnImage() {\n\t\tgeometry_msgs::Pose pos = qnode.GetRobotPosition();\n\n\t\tQImage tmp(map->toImage());\n\t\tQPainter painter(&tmp);\n\t\tQPen paintpen(blue);\n\t\tQPoint p1;\n\t\tpaintpen.setWidth(10);\n\t\tp1.setX(ConvertRobotToPixel(pos.position.x));\n\t\tp1.setY(ConvertRobotToPixel(pos.position.y));\n\t\tpainter.setPen(paintpen);\n\t\tpainter.drawPoint(p1);\n\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));\n\n\t\tDrawMarkersOnImage();\n\t}\n\n\tvoid MainWindow::DrawMarkersOnImage() {\n\t\t\n\t\tQImage tmp(lblMapImage->pixmap()->toImage());\n\t\tQPainter painter(&tmp);\n\t\tQPen paintpen(orange);\n\t\tQPoint p1;\n\t\tpaintpen.setWidth(10);\n\n\t\tfor(int i; i < markers.size(); i++) {\n\t\t\t\n\t\t\tif(i == GetSelectedMarker()) {\n\t\t\t\tpaintpen.setColor(red);\n\t\t\t\t\/\/ROS_WARN(\"HOI\");\n\t\t\t} else if(markers[i].GetType() == Workspace) {\n\t\t\t\tpaintpen.setColor(green);\n\t\t\t\t\/\/ROS_WARN(\"GOENN\");\n\t\t\t} else {\n\t\t\t\tpaintpen.setColor(orange);\n\t\t\t\t\/\/ROS_WARN(\"ORANJEEE\");\n\t\t\t}\n\t\t\t\n\t\t\tp1.setX(ConvertRobotToPixel(markers[i].GetX()));\n\t\t\tp1.setY(ConvertRobotToPixel(markers[i].GetY()));\n\t\t\tpainter.setPen(paintpen);\n\t\t\tpainter.drawPoint(p1);\n\t\t}\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));\n\n\t\t\/*QPoint p2;\n\t\tp2.setX(ConvertRobotToPixel(pos.position.x));\n\t\tp2.setY(ConvertRobotToPixel(pos.position.y));\n\t\tpainter.setPen(paintpen);\n\t\tpainter.drawPoint(p2);\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));*\/\n\t}\n\n\tint MainWindow::ConvertRobotToPixel(double a) {\n\t\treturn (a - map_min) * (map_pix - 0) \/ (map_max - map_min);\n\t}\n\n\tdouble MainWindow::ConvertPixelToRobot(int a) {\n\t\treturn (a) * (map_max - map_min) \/ (map_pix) + map_min;\n\t}\n}\n\n\/*\nlong map(long x, long in_min, long in_max, long out_min, long out_max)\n{\n return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}*\/\n<commit_msg>Updated btnLoadYaml to use browse<commit_after>#include <QtGui>\n#include <QMessageBox>\n#include <QFileDialog>\n#include <QGraphicsScene>\n#include <iostream>\n#include <algorithm>\n#include \"main_window.hpp\"\n\n#include <QDebug>\n\n#include \"geometry_msgs\/Pose.h\"\n\nusing namespace Qt;\n\nnamespace map_marker {\n\n\tconst double map_min = -5;\n\tconst double map_max = 5;\n\tconst double map_pix = 992;\n\n\tconst QColor red = QColor(180, 40, 0);\n\tconst QColor blue = QColor(30, 30, 140);\n\tconst QColor green = QColor(50, 140, 30);\n\tconst QColor orange = QColor(230, 120, 0);\n\n\t\n\n\n\tMainWindow::MainWindow(int argc, char** argv, QWidget *parent) : QMainWindow(parent), qnode(argc,argv) {\n\t\tui.setupUi(this);\n\t\tqnode.init();\n\n\t\t\/* HOEFT NIET\n\t\tQObject::connect(ui.btnLoadYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnLoadYaml_clicked()));\n\t\tQObject::connect(ui.btnLoadMap, SIGNAL(clicked(bool)), this, SLOT(on_btnLoadMap_clicked()));\n\t\tQObject::connect(ui.btnWriteYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnWriteYaml_clicked()));\n\t\tQObject::connect(ui.btnClearYaml, SIGNAL(clicked(bool)), this, SLOT(on_btnClearYaml_clicked()));\n\t\tQObject::connect(ui.btnAddCurrentPose, SIGNAL(clicked(bool)), this, SLOT(on_btnAddCurrentPose_clicked()));\n\t\tQObject::connect(ui.btnAddCustomPose, SIGNAL(clicked(bool)), this, SLOT(on_btnAddCustomPose_clicked()));\n\t\t*\/\n\n\t\tQObject::connect(ui.tableWidget->selectionModel(), SIGNAL(selectionChanged(const QItemSelection &, const QItemSelection &)), SLOT(DrawRobotOnImage()));\n\n\t\tQString url = \"\/home\/lars\/git\/ESA-PROJ\/maps\/legomap3-cropped.pgm\";\n\t\tmap = new QPixmap(url);\n\n\t\t\/\/ Ttable editing\n\t\tui.tableWidget->setEditTriggers(QAbstractItemView::NoEditTriggers);\n\t\tui.tableWidget->setSelectionBehavior(QAbstractItemView::SelectRows);\n\t\tui.tableWidget->setSelectionMode(QAbstractItemView::SingleSelection);\n\n\t\t\/\/ Create map image\n\t\tlblMapImage = new ClickableLabel(this);\n\t\tlblMapImage->setAlignment(Qt::AlignBottom | Qt::AlignRight);\n\t\tlblMapImage->setGeometry(QRect(0, 0, map_pix, map_pix));\n\t\tlblMapImage->setPixmap(*map);\n\t\tQObject::connect(lblMapImage, SIGNAL(clicked(QPoint)), this, SLOT(lblMapImage_clicked(QPoint)));\n\n\t\t\/\/ Set validator for input fields\n\t\tui.inpCustomX->setValidator(new QDoubleValidator(-100, 100, 5, ui.inpCustomX));\n\t\tui.inpCustomY->setValidator(new QDoubleValidator(-100, 100, 5, ui.inpCustomY));\n\t\tui.inpCustomAngle->setValidator(new QDoubleValidator(0, 360, 5, ui.inpCustomAngle));\n\n\t\t\/\/ Panic button color\n\t\tui.btnPanic->setStyleSheet(\"color: rgb(192,0,0);\");\n\n\t\tMarker m(1.0, 2.0, 40.0, Navigation);\n\t\tAddMarker(m);\n\n\t\tUpdateTable();\n\t}\n\n\tMainWindow::~MainWindow() {\n\t\tdelete map;\n\t\tdelete lblMapImage;\n\n\t}\n\n\tvoid MainWindow::lblMapImage_clicked(QPoint a) {\n\t\tQString x = QString::number(ConvertPixelToRobot(a.x()));\n\t\tQString y = QString::number(ConvertPixelToRobot(a.y()));\n\t\tui.inpCustomX->setText(x);\n\t\tui.inpCustomY->setText(y);\n\t}\n\n\tvoid MainWindow::on_btnLoadYaml_clicked() {\n\t\tQFileDialog dialog(this);\n\t\tdialog.setFileMode(QFileDialog::AnyFile);\n\t\tdialog.setNameFilter(tr(\"Map image file (*.yaml)\"));\n\n\t\tQStringList fileNames;\n\t\tif (dialog.exec())\n\t\tfileNames = dialog.selectedFiles();\n\n\t\tyaml.loadYaml(fileNames[0].toUtf8().constData());\n\t}\n\n\tvoid MainWindow::on_btnLoadMap_clicked() {\n\t\tQFileDialog dialog(this);\n\t\tdialog.setFileMode(QFileDialog::AnyFile);\n\t\tdialog.setNameFilter(tr(\"Map image file (*.pbm *.pgm *.ppm)\"));\n\n\t\tQStringList fileNames;\n\t\tif (dialog.exec())\n\t\tfileNames = dialog.selectedFiles();\n\n\t\tmap = new QPixmap(fileNames[0]);\n\t\t\tlblMapImage->setPixmap(*map);\n\t}\n\n\tvoid MainWindow::on_btnWriteYaml_clicked() {\n\t\tROS_ERROR(\"Not implemented yet :(\");\n\t}\n\n\tvoid MainWindow::on_btnClearYaml_clicked() {\n\t\tROS_ERROR(\"Not implemented yet :(\");\n\t}\n\n\tvoid MainWindow::on_btnAddCurrentPose_clicked() {\n\t\tgeometry_msgs::Pose pos = qnode.GetRobotPosition();\n\n\t\tMarkerType type;\n\t\tif(ui.radioNav->isChecked()) {\n\t\t\ttype = Navigation;\n\t\t} else if (ui.radioWorkspace->isChecked()) {\n\t\t\ttype = Workspace;\n\t\t}\n\n\t\tAddMarker(Marker(pos, type));\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnAddCustomPose_clicked() {\n\t\tdouble x = ui.inpCustomX->text().toDouble();\n\t\tdouble y = ui.inpCustomY->text().toDouble();\n\t\tdouble angle = ui.inpCustomAngle->text().toDouble();\n\t\t\n\t\tMarkerType type;\n\t\tif(ui.radioNav->isChecked()) {\n\t\t\ttype = Navigation;\n\t\t} else if (ui.radioWorkspace->isChecked()) {\n\t\t\ttype = Workspace;\n\t\t}\n\t\t\n\t\tAddMarker(Marker(x, y, angle, type));\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnMoveRobot_clicked() {\n\t\tint index = GetSelectedMarker();\n\t\tif(index == -1) {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t\treturn;\n\t\t} \n\t\tMarker * m = &markers[index];\n\t\tqnode.MoveRobotToPose(m->GetPose());\n\t}\n\n\tvoid MainWindow::on_btnRemoveMarker_clicked() {\n\t\tint index = GetSelectedMarker();\n\t\tif(index == -1) {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t\treturn;\n\t\t} \n\t\tmarkers.erase(markers.begin()+index);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnPanic_clicked() {\n\t\tqnode.Panic();\n\t\tROS_INFO(\"Panic button pressed, stopped robot...\");\n\t}\n\n\tvoid MainWindow::on_btnMoveMarkerUp_clicked() {\n\t\tint selectedMarker = GetSelectedMarker();\n\t\tMoveMarkerUp(selectedMarker);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnMoveMarkerDown_clicked() {\n\t\tint selectedMarker = GetSelectedMarker();\n\t\tMoveMarkerDown(selectedMarker);\n\t\tUpdateTable();\n\t}\n\n\tvoid MainWindow::on_btnClearAllMarkers_clicked() {\n\t\tmarkers.clear();\n\t\tUpdateTable();\n\t}\n\n\tint MainWindow::GetSelectedMarker() {\n\t\tint j = -1;\n\t\tQModelIndexList indexes = ui.tableWidget->selectionModel()->selectedRows();\n\n\t\tfor (int i = 0; i < indexes.count(); ++i) { \n\t\t\tj = indexes.at(i).row();\n\t\t}\n\n\t\treturn j;\n\t}\n\n\tvoid MainWindow::AddMarker(Marker marker) {\n\t\tmarkers.push_back(marker);\n\t}\n\n\tvoid MainWindow::MoveMarkerUp(int selectedMarker) {\n\t\tif(selectedMarker + 1 < markers.size() && selectedMarker >= 0) {\n\t\t\tstd::swap(markers.at(selectedMarker), markers.at(selectedMarker + 1));\n\t\t} else {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t}\n\t}\n\n\tvoid MainWindow::MoveMarkerDown(int selectedMarker) {\n\t\tif(selectedMarker > 0) {\n\t\t\tstd::swap(markers.at(selectedMarker), markers.at(selectedMarker - 1));\n\t\t} else {\n\t\t\tROS_WARN(\"No marker selected\");\n\t\t}\n\t}\n\n\tvoid MainWindow::UpdateTable() {\n\t\tui.tableWidget->setRowCount(0);\n\t\tfor(int i=0; i < markers.size(); i++) {\n\t\t\tui.tableWidget->insertRow ( ui.tableWidget->rowCount() );\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 0, new QTableWidgetItem(QString::fromStdString(markers[i].GetTypeStr())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 1, new QTableWidgetItem(QString::number(markers[i].GetX())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 2, new QTableWidgetItem(QString::number(markers[i].GetY())));\n\t\t\tui.tableWidget->setItem(ui.tableWidget->rowCount()-1, 3, new QTableWidgetItem(QString::number(markers[i].GetAngle())));\n\t\t}\n\t\tDrawRobotOnImage();\n\t}\n\n\tvoid MainWindow::DrawRobotOnImage() {\n\t\tgeometry_msgs::Pose pos = qnode.GetRobotPosition();\n\n\t\tQImage tmp(map->toImage());\n\t\tQPainter painter(&tmp);\n\t\tQPen paintpen(blue);\n\t\tQPoint p1;\n\t\tpaintpen.setWidth(10);\n\t\tp1.setX(ConvertRobotToPixel(pos.position.x));\n\t\tp1.setY(ConvertRobotToPixel(pos.position.y));\n\t\tpainter.setPen(paintpen);\n\t\tpainter.drawPoint(p1);\n\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));\n\n\t\tDrawMarkersOnImage();\n\t}\n\n\tvoid MainWindow::DrawMarkersOnImage() {\n\t\t\n\t\tQImage tmp(lblMapImage->pixmap()->toImage());\n\t\tQPainter painter(&tmp);\n\t\tQPen paintpen(orange);\n\t\tQPoint p1;\n\t\tpaintpen.setWidth(10);\n\n\t\tfor(int i; i < markers.size(); i++) {\n\t\t\t\n\t\t\tif(i == GetSelectedMarker()) {\n\t\t\t\tpaintpen.setColor(red);\n\t\t\t\t\/\/ROS_WARN(\"HOI\");\n\t\t\t} else if(markers[i].GetType() == Workspace) {\n\t\t\t\tpaintpen.setColor(green);\n\t\t\t\t\/\/ROS_WARN(\"GOENN\");\n\t\t\t} else {\n\t\t\t\tpaintpen.setColor(orange);\n\t\t\t\t\/\/ROS_WARN(\"ORANJEEE\");\n\t\t\t}\n\t\t\t\n\t\t\tp1.setX(ConvertRobotToPixel(markers[i].GetX()));\n\t\t\tp1.setY(ConvertRobotToPixel(markers[i].GetY()));\n\t\t\tpainter.setPen(paintpen);\n\t\t\tpainter.drawPoint(p1);\n\t\t}\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));\n\n\t\t\/*QPoint p2;\n\t\tp2.setX(ConvertRobotToPixel(pos.position.x));\n\t\tp2.setY(ConvertRobotToPixel(pos.position.y));\n\t\tpainter.setPen(paintpen);\n\t\tpainter.drawPoint(p2);\n\t\tlblMapImage->setPixmap(QPixmap::fromImage(tmp));*\/\n\t}\n\n\tint MainWindow::ConvertRobotToPixel(double a) {\n\t\treturn (a - map_min) * (map_pix - 0) \/ (map_max - map_min);\n\t}\n\n\tdouble MainWindow::ConvertPixelToRobot(int a) {\n\t\treturn (a) * (map_max - map_min) \/ (map_pix) + map_min;\n\t}\n}\n\n\/*\nlong map(long x, long in_min, long in_max, long out_min, long out_max)\n{\n return (x - in_min) * (out_max - out_min) \/ (in_max - in_min) + out_min;\n}*\/\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/detail\/unit.hpp>\n#include <agency\/detail\/unique_ptr.hpp>\n#include <type_traits>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\nstruct unit_ptr : unit\n{\n using element_type = unit;\n\n __AGENCY_ANNOTATION\n unit& operator*()\n {\n return *this;\n }\n\n __AGENCY_ANNOTATION\n const unit& operator*() const\n {\n return *this;\n }\n};\n\n\ntemplate<class T>\nstruct state_requires_storage\n : std::integral_constant<\n bool,\n std::is_empty<T>::value || std::is_void<T>::value || agency::detail::is_empty_tuple<T>::value\n >\n{};\n\nstruct construct_ready_t {};\nstruct construct_not_ready_t {};\n\nconstexpr static construct_ready_t construct_ready{};\nconstexpr static construct_not_ready_t construct_not_ready{};\n\n\n\/\/ XXX this is suffixed with _impl because of nvbug 1700337\n\/\/ eliminate the suffix when that bug is resolved\n\/\/ XXX should try to collapse the implementation of this as much as possible between the two\ntemplate<class T,\n class Alloc = std::allocator<T>,\n bool requires_storage = state_requires_storage<T>::value>\nclass asynchronous_state_impl\n{\n public:\n using value_type = T;\n using pointer = value_type*;\n using storage_type = unique_ptr<T,deleter<Alloc>>;\n\n \/\/ constructs an invalid state\n __AGENCY_ANNOTATION\n asynchronous_state_impl() = default;\n\n \/\/ constructs an immediately ready state\n __agency_hd_warning_disable__\n template<class... Args,\n class = typename std::enable_if<\n std::is_constructible<T,Args...>::value\n >::type\n >\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t, Args&&... ready_args)\n : storage_(allocate_unique<T>(Alloc(), std::forward<Args>(ready_args)...))\n {}\n\n \/\/ constructs a not ready state\n \/\/ XXX we should avoid creating an object here\n \/\/ instead, we should just create it uninitialized\n \/\/ XXX the destructor should check whether the state requires destruction\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_not_ready_t)\n : asynchronous_state_impl(construct_ready, T{})\n {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl&& other) = default;\n\n template<class OtherT,\n class OtherAlloc,\n class = typename std::enable_if<\n std::is_constructible<storage_type, typename asynchronous_state_impl<OtherT,OtherAlloc>::storage_type&&>::value\n >::type\n >\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl<OtherT,OtherAlloc>&& other)\n : storage_(std::move(other.storage_))\n {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl& operator=(asynchronous_state_impl&&) = default;\n\n __AGENCY_ANNOTATION\n pointer data() const\n {\n return storage_.get();\n }\n\n __AGENCY_ANNOTATION\n T get()\n {\n T result = std::move(*storage_);\n\n storage_.reset();\n\n return std::move(result);\n }\n\n __AGENCY_ANNOTATION\n bool valid() const\n {\n return storage_;\n }\n\n __AGENCY_ANNOTATION\n void swap(asynchronous_state_impl& other)\n {\n storage_.swap(other.storage_);\n }\n\n private:\n template<class, class, bool>\n friend class asynchronous_state_impl;\n\n storage_type storage_;\n};\n\n\n\/\/ when a type is empty, we can create instances on the fly upon dereference\ntemplate<class T>\nstruct empty_type_ptr : T\n{\n using element_type = T;\n\n __AGENCY_ANNOTATION\n T& operator*()\n {\n return *this;\n }\n\n __AGENCY_ANNOTATION\n const T& operator*() const\n {\n return *this;\n }\n};\n\ntemplate<>\nstruct empty_type_ptr<void> : unit_ptr {};\n\n\n\/\/ zero storage optimization\ntemplate<class T, class Alloc>\nclass asynchronous_state_impl<T,Alloc,true>\n{\n public:\n using value_type = T;\n using pointer = empty_type_ptr<T>;\n\n \/\/ constructs an invalid state\n __AGENCY_ANNOTATION\n asynchronous_state_impl() : valid_(false) {}\n\n \/\/ constructs an immediately ready state\n template<class OtherT,\n class = typename std::enable_if<\n std::is_constructible<T,OtherT&&>::value\n >::type>\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t, OtherT&&) : valid_(true) {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t) : valid_(true) {}\n\n \/\/ constructs a not ready state\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_not_ready_t) : valid_(true) {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl&& other) : valid_(other.valid_)\n {\n other.valid_ = false;\n }\n\n \/\/ 1. allow moves to void states (this simply discards the state)\n \/\/ 2. allow moves to empty types if the type can be constructed from an empty argument list\n \/\/ 3. allow upcasts to a base T from a derived U\n template<class OtherT,\n class OtherAlloc,\n class T1 = T,\n class = typename std::enable_if<\n std::is_void<T1>::value ||\n (std::is_empty<T>::value && std::is_void<OtherT>::value && std::is_constructible<T>::value) ||\n std::is_base_of<T,OtherT>::value\n >::type>\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl<OtherT,OtherAlloc>&& other)\n : valid_(other.valid())\n {\n if(valid())\n {\n \/\/ invalidate the old state by calling .get() if it was valid when we received it\n other.get();\n }\n }\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl& operator=(asynchronous_state_impl&& other)\n {\n valid_ = other.valid_;\n other.valid_ = false;\n\n return *this;\n }\n\n __AGENCY_ANNOTATION\n empty_type_ptr<T> data() const\n {\n return empty_type_ptr<T>();\n }\n\n __AGENCY_ANNOTATION\n T get()\n {\n valid_ = false;\n\n return get_impl(std::is_void<T>());\n }\n\n __AGENCY_ANNOTATION\n bool valid() const\n {\n return valid_;\n }\n\n __AGENCY_ANNOTATION\n void swap(asynchronous_state_impl& other)\n {\n bool other_valid_old = other.valid_;\n other.valid_ = valid_;\n valid_ = other_valid_old;\n }\n\n private:\n __AGENCY_ANNOTATION\n static T get_impl(std::false_type)\n {\n return T{};\n }\n\n __AGENCY_ANNOTATION\n static T get_impl(std::true_type)\n {\n return;\n }\n\n bool valid_;\n};\n\n\n\/\/ XXX this extra indirection is due to nvbug 1700337\n\/\/ eliminate this class when that bug is resolved\ntemplate<class T, class Alloc = std::allocator<T>>\nclass asynchronous_state : public asynchronous_state_impl<T,Alloc>\n{\n public:\n using asynchronous_state_impl<T,Alloc>::asynchronous_state_impl;\n};\n\n \n} \/\/ end detail\n} \/\/ end agency\n\n<commit_msg>Add missing include<commit_after>#pragma once\n\n#include <agency\/detail\/config.hpp>\n#include <agency\/detail\/unit.hpp>\n#include <agency\/detail\/unique_ptr.hpp>\n#include <agency\/detail\/tuple.hpp>\n#include <type_traits>\n\nnamespace agency\n{\nnamespace detail\n{\n\n\nstruct unit_ptr : unit\n{\n using element_type = unit;\n\n __AGENCY_ANNOTATION\n unit& operator*()\n {\n return *this;\n }\n\n __AGENCY_ANNOTATION\n const unit& operator*() const\n {\n return *this;\n }\n};\n\n\ntemplate<class T>\nstruct state_requires_storage\n : std::integral_constant<\n bool,\n std::is_empty<T>::value || std::is_void<T>::value || agency::detail::is_empty_tuple<T>::value\n >\n{};\n\nstruct construct_ready_t {};\nstruct construct_not_ready_t {};\n\nconstexpr static construct_ready_t construct_ready{};\nconstexpr static construct_not_ready_t construct_not_ready{};\n\n\n\/\/ XXX this is suffixed with _impl because of nvbug 1700337\n\/\/ eliminate the suffix when that bug is resolved\n\/\/ XXX should try to collapse the implementation of this as much as possible between the two\ntemplate<class T,\n class Alloc = std::allocator<T>,\n bool requires_storage = state_requires_storage<T>::value>\nclass asynchronous_state_impl\n{\n public:\n using value_type = T;\n using pointer = value_type*;\n using storage_type = unique_ptr<T,deleter<Alloc>>;\n\n \/\/ constructs an invalid state\n __AGENCY_ANNOTATION\n asynchronous_state_impl() = default;\n\n \/\/ constructs an immediately ready state\n __agency_hd_warning_disable__\n template<class... Args,\n class = typename std::enable_if<\n std::is_constructible<T,Args...>::value\n >::type\n >\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t, Args&&... ready_args)\n : storage_(allocate_unique<T>(Alloc(), std::forward<Args>(ready_args)...))\n {}\n\n \/\/ constructs a not ready state\n \/\/ XXX we should avoid creating an object here\n \/\/ instead, we should just create it uninitialized\n \/\/ XXX the destructor should check whether the state requires destruction\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_not_ready_t)\n : asynchronous_state_impl(construct_ready, T{})\n {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl&& other) = default;\n\n template<class OtherT,\n class OtherAlloc,\n class = typename std::enable_if<\n std::is_constructible<storage_type, typename asynchronous_state_impl<OtherT,OtherAlloc>::storage_type&&>::value\n >::type\n >\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl<OtherT,OtherAlloc>&& other)\n : storage_(std::move(other.storage_))\n {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl& operator=(asynchronous_state_impl&&) = default;\n\n __AGENCY_ANNOTATION\n pointer data() const\n {\n return storage_.get();\n }\n\n __AGENCY_ANNOTATION\n T get()\n {\n T result = std::move(*storage_);\n\n storage_.reset();\n\n return std::move(result);\n }\n\n __AGENCY_ANNOTATION\n bool valid() const\n {\n return storage_;\n }\n\n __AGENCY_ANNOTATION\n void swap(asynchronous_state_impl& other)\n {\n storage_.swap(other.storage_);\n }\n\n private:\n template<class, class, bool>\n friend class asynchronous_state_impl;\n\n storage_type storage_;\n};\n\n\n\/\/ when a type is empty, we can create instances on the fly upon dereference\ntemplate<class T>\nstruct empty_type_ptr : T\n{\n using element_type = T;\n\n __AGENCY_ANNOTATION\n T& operator*()\n {\n return *this;\n }\n\n __AGENCY_ANNOTATION\n const T& operator*() const\n {\n return *this;\n }\n};\n\ntemplate<>\nstruct empty_type_ptr<void> : unit_ptr {};\n\n\n\/\/ zero storage optimization\ntemplate<class T, class Alloc>\nclass asynchronous_state_impl<T,Alloc,true>\n{\n public:\n using value_type = T;\n using pointer = empty_type_ptr<T>;\n\n \/\/ constructs an invalid state\n __AGENCY_ANNOTATION\n asynchronous_state_impl() : valid_(false) {}\n\n \/\/ constructs an immediately ready state\n template<class OtherT,\n class = typename std::enable_if<\n std::is_constructible<T,OtherT&&>::value\n >::type>\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t, OtherT&&) : valid_(true) {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_ready_t) : valid_(true) {}\n\n \/\/ constructs a not ready state\n __AGENCY_ANNOTATION\n asynchronous_state_impl(construct_not_ready_t) : valid_(true) {}\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl&& other) : valid_(other.valid_)\n {\n other.valid_ = false;\n }\n\n \/\/ 1. allow moves to void states (this simply discards the state)\n \/\/ 2. allow moves to empty types if the type can be constructed from an empty argument list\n \/\/ 3. allow upcasts to a base T from a derived U\n template<class OtherT,\n class OtherAlloc,\n class T1 = T,\n class = typename std::enable_if<\n std::is_void<T1>::value ||\n (std::is_empty<T>::value && std::is_void<OtherT>::value && std::is_constructible<T>::value) ||\n std::is_base_of<T,OtherT>::value\n >::type>\n __AGENCY_ANNOTATION\n asynchronous_state_impl(asynchronous_state_impl<OtherT,OtherAlloc>&& other)\n : valid_(other.valid())\n {\n if(valid())\n {\n \/\/ invalidate the old state by calling .get() if it was valid when we received it\n other.get();\n }\n }\n\n __AGENCY_ANNOTATION\n asynchronous_state_impl& operator=(asynchronous_state_impl&& other)\n {\n valid_ = other.valid_;\n other.valid_ = false;\n\n return *this;\n }\n\n __AGENCY_ANNOTATION\n empty_type_ptr<T> data() const\n {\n return empty_type_ptr<T>();\n }\n\n __AGENCY_ANNOTATION\n T get()\n {\n valid_ = false;\n\n return get_impl(std::is_void<T>());\n }\n\n __AGENCY_ANNOTATION\n bool valid() const\n {\n return valid_;\n }\n\n __AGENCY_ANNOTATION\n void swap(asynchronous_state_impl& other)\n {\n bool other_valid_old = other.valid_;\n other.valid_ = valid_;\n valid_ = other_valid_old;\n }\n\n private:\n __AGENCY_ANNOTATION\n static T get_impl(std::false_type)\n {\n return T{};\n }\n\n __AGENCY_ANNOTATION\n static T get_impl(std::true_type)\n {\n return;\n }\n\n bool valid_;\n};\n\n\n\/\/ XXX this extra indirection is due to nvbug 1700337\n\/\/ eliminate this class when that bug is resolved\ntemplate<class T, class Alloc = std::allocator<T>>\nclass asynchronous_state : public asynchronous_state_impl<T,Alloc>\n{\n public:\n using asynchronous_state_impl<T,Alloc>::asynchronous_state_impl;\n};\n\n \n} \/\/ end detail\n} \/\/ end agency\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include \"clustering_serv.hpp\"\n\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n#include \"jubatus\/util\/lang\/cast.h\"\n#include \"jubatus\/util\/text\/json.h\"\n#include \"jubatus\/core\/clustering\/clustering_config.hpp\"\n#include \"jubatus\/core\/clustering\/clustering.hpp\"\n#include \"jubatus\/core\/common\/exception.hpp\"\n#include \"jubatus\/core\/common\/jsonconfig.hpp\"\n#include \"jubatus\/core\/fv_converter\/converter_config.hpp\"\n#include \"..\/common\/logger\/logger.hpp\"\n#include \"..\/framework\/mixer\/mixer_factory.hpp\"\n\nusing jubatus::util::lang::lexical_cast;\nusing jubatus::util::lang::shared_ptr;\nusing jubatus::server::framework::mixer::create_mixer;\n\nnamespace jubatus {\nnamespace server {\nnamespace {\n\nstruct clustering_serv_config {\n std::string method;\n jubatus::util::data::optional<core::common::jsonconfig::config> parameter;\n core::fv_converter::converter_config converter;\n\n template<typename Ar>\n void serialize(Ar& ar) {\n ar & JUBA_MEMBER(method) & JUBA_MEMBER(parameter) & JUBA_MEMBER(converter);\n }\n};\n\n} \/\/ anonymous namespace\n\nclustering_serv::clustering_serv(\n const framework::server_argv& a,\n const shared_ptr<common::lock_service>& zk)\n : server_base(a),\n mixer_(create_mixer(a, zk, rw_mutex(), user_data_version())) {\n}\n\nclustering_serv::~clustering_serv() {\n}\n\nvoid clustering_serv::get_status(status_t& status) const {\n \/\/ TODO(beam2d): Add some status of clustering\n}\n\nuint64_t clustering_serv::user_data_version() const {\n return 1; \/\/ should be inclemented when model data is modified\n}\n\nvoid clustering_serv::set_config(const std::string& config) {\n core::common::jsonconfig::config config_root(\n lexical_cast<jubatus::util::text::json::json>(config));\n clustering_serv_config conf =\n core::common::jsonconfig::config_cast_check<clustering_serv_config>(\n config_root);\n\n config_ = config;\n shared_ptr<core::fv_converter::datum_to_fv_converter> converter =\n core::fv_converter::make_fv_converter(conf.converter, &so_loader_);\n\n core::common::jsonconfig::config param;\n if (conf.parameter) {\n param = *conf.parameter;\n }\n\n const std::string name =\n argv().eth + lexical_cast<std::string>(argv().port);\n core::clustering::clustering_config cluster_conf =\n core::common::jsonconfig::config_cast_check<\n core::clustering::clustering_config>(param);\n clustering_.reset(new core::driver::clustering(\n shared_ptr<core::clustering::clustering>(\n new core::clustering::clustering(\n name,\n conf.method,\n cluster_conf)),\n converter));\n mixer_->set_driver(clustering_.get());\n\n LOG(INFO) << \"config loaded: \" << config;\n}\n\nstd::string clustering_serv::get_config() const {\n return config_;\n}\n\nbool clustering_serv::push(\n const std::vector<core::fv_converter::datum>& points) {\n check_set_config();\n clustering_->push(points);\n return true;\n}\n\ncore::fv_converter::datum clustering_serv::get_nearest_center(\n const core::fv_converter::datum& point) const {\n check_set_config();\n return clustering_->get_nearest_center(point);\n}\n\nstd::vector<std::pair<double, core::fv_converter::datum> >\n clustering_serv::get_nearest_members(\n const core::fv_converter::datum& point) const {\n check_set_config();\n return clustering_->get_nearest_members(point);\n}\n\nstd::vector<core::fv_converter::datum> clustering_serv::get_k_center() const {\n check_set_config();\n return clustering_->get_k_center();\n}\n\nstd::vector<std::vector<std::pair<double, core::fv_converter::datum> > >\nclustering_serv::get_core_members() const {\n check_set_config();\n return clustering_->get_core_members();\n}\n\nsize_t clustering_serv::get_revision() const {\n check_set_config();\n return clustering_->get_revision();\n}\n\nvoid clustering_serv::check_set_config() const {\n if (!clustering_) {\n throw JUBATUS_EXCEPTION(core::common::config_not_set());\n }\n}\n\n} \/\/ namespace server\n} \/\/ namespace jubatus\n<commit_msg>fix clustering instance ID<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2013 Preferred Networks and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include \"clustering_serv.hpp\"\n\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n#include \"jubatus\/util\/lang\/cast.h\"\n#include \"jubatus\/util\/text\/json.h\"\n#include \"jubatus\/core\/clustering\/clustering_config.hpp\"\n#include \"jubatus\/core\/clustering\/clustering.hpp\"\n#include \"jubatus\/core\/common\/exception.hpp\"\n#include \"jubatus\/core\/common\/jsonconfig.hpp\"\n#include \"jubatus\/core\/fv_converter\/converter_config.hpp\"\n#include \"..\/common\/logger\/logger.hpp\"\n#include \"..\/framework\/mixer\/mixer_factory.hpp\"\n\nusing jubatus::util::lang::lexical_cast;\nusing jubatus::util::lang::shared_ptr;\nusing jubatus::server::framework::mixer::create_mixer;\n\nnamespace jubatus {\nnamespace server {\nnamespace {\n\nstruct clustering_serv_config {\n std::string method;\n jubatus::util::data::optional<core::common::jsonconfig::config> parameter;\n core::fv_converter::converter_config converter;\n\n template<typename Ar>\n void serialize(Ar& ar) {\n ar & JUBA_MEMBER(method) & JUBA_MEMBER(parameter) & JUBA_MEMBER(converter);\n }\n};\n\n} \/\/ anonymous namespace\n\nclustering_serv::clustering_serv(\n const framework::server_argv& a,\n const shared_ptr<common::lock_service>& zk)\n : server_base(a),\n mixer_(create_mixer(a, zk, rw_mutex(), user_data_version())) {\n}\n\nclustering_serv::~clustering_serv() {\n}\n\nvoid clustering_serv::get_status(status_t& status) const {\n \/\/ TODO(beam2d): Add some status of clustering\n}\n\nuint64_t clustering_serv::user_data_version() const {\n return 1; \/\/ should be inclemented when model data is modified\n}\n\nvoid clustering_serv::set_config(const std::string& config) {\n core::common::jsonconfig::config config_root(\n lexical_cast<jubatus::util::text::json::json>(config));\n clustering_serv_config conf =\n core::common::jsonconfig::config_cast_check<clustering_serv_config>(\n config_root);\n\n config_ = config;\n shared_ptr<core::fv_converter::datum_to_fv_converter> converter =\n core::fv_converter::make_fv_converter(conf.converter, &so_loader_);\n\n core::common::jsonconfig::config param;\n if (conf.parameter) {\n param = *conf.parameter;\n }\n\n const std::string name = get_server_identifier(argv());\n core::clustering::clustering_config cluster_conf =\n core::common::jsonconfig::config_cast_check<\n core::clustering::clustering_config>(param);\n clustering_.reset(new core::driver::clustering(\n shared_ptr<core::clustering::clustering>(\n new core::clustering::clustering(\n name,\n conf.method,\n cluster_conf)),\n converter));\n mixer_->set_driver(clustering_.get());\n\n LOG(INFO) << \"config loaded: \" << config;\n}\n\nstd::string clustering_serv::get_config() const {\n return config_;\n}\n\nbool clustering_serv::push(\n const std::vector<core::fv_converter::datum>& points) {\n check_set_config();\n clustering_->push(points);\n return true;\n}\n\ncore::fv_converter::datum clustering_serv::get_nearest_center(\n const core::fv_converter::datum& point) const {\n check_set_config();\n return clustering_->get_nearest_center(point);\n}\n\nstd::vector<std::pair<double, core::fv_converter::datum> >\n clustering_serv::get_nearest_members(\n const core::fv_converter::datum& point) const {\n check_set_config();\n return clustering_->get_nearest_members(point);\n}\n\nstd::vector<core::fv_converter::datum> clustering_serv::get_k_center() const {\n check_set_config();\n return clustering_->get_k_center();\n}\n\nstd::vector<std::vector<std::pair<double, core::fv_converter::datum> > >\nclustering_serv::get_core_members() const {\n check_set_config();\n return clustering_->get_core_members();\n}\n\nsize_t clustering_serv::get_revision() const {\n check_set_config();\n return clustering_->get_revision();\n}\n\nvoid clustering_serv::check_set_config() const {\n if (!clustering_) {\n throw JUBATUS_EXCEPTION(core::common::config_not_set());\n }\n}\n\n} \/\/ namespace server\n} \/\/ namespace jubatus\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2021 Google LLC.\n\n#include \"experimental\/sktext\/src\/LogicalRun.h\"\n\nnamespace skia {\nnamespace text {\n\nLogicalRun::LogicalRun(const SkShaper::RunHandler::RunInfo& info, TextIndex textStart, SkScalar glyphOffset)\n : fFont(info.fFont)\n , fBidiLevel(info.fBidiLevel)\n , fAdvance(info.fAdvance)\n , fUtf8Range(info.utf8Range)\n , fTextMetrics(info.fFont)\n , fRunStart(textStart)\n , fRunOffset(glyphOffset)\n , fRunType(LogicalRunType::kText) {\n fGlyphs.push_back_n(info.glyphCount);\n fBounds.push_back_n(info.glyphCount);\n fPositions.push_back_n(info.glyphCount + 1);\n fOffsets.push_back_n(info.glyphCount);\n fClusters.push_back_n(info.glyphCount + 1);\n}\n\n} \/\/ namespace text\n} \/\/ namespace skia\n<commit_msg>Fixing Android build bug<commit_after>\/\/ Copyright 2021 Google LLC.\n\n#include \"experimental\/sktext\/src\/LogicalRun.h\"\n\nnamespace skia {\nnamespace text {\n\nLogicalRun::LogicalRun(const SkShaper::RunHandler::RunInfo& info, TextIndex textStart, SkScalar glyphOffset)\n : fFont(info.fFont)\n , fTextMetrics(info.fFont)\n , fRunType(LogicalRunType::kText)\n , fAdvance(info.fAdvance)\n , fUtf8Range(info.utf8Range)\n , fRunStart(textStart)\n , fRunOffset(glyphOffset)\n , fBidiLevel(info.fBidiLevel)\n{\n fGlyphs.push_back_n(info.glyphCount);\n fBounds.push_back_n(info.glyphCount);\n fPositions.push_back_n(info.glyphCount + 1);\n fOffsets.push_back_n(info.glyphCount);\n fClusters.push_back_n(info.glyphCount + 1);\n}\n\n} \/\/ namespace text\n} \/\/ namespace skia\n<|endoftext|>"} {"text":"<commit_before>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"MultiAppPostprocessorNearestElementTransfer.h\"\n#include \"FEProblem.h\"\n#include \"MooseMesh.h\"\n#include \"MooseTypes.h\"\n#include \"MooseVariableFE.h\"\n#include \"MultiApp.h\"\n#include \"SystemBase.h\"\n\nregisterMooseObject(\"MooseApp\", MultiAppPostprocessorNearestElementTransfer);\n\nInputParameters\nMultiAppPostprocessorNearestElementTransfer::validParams()\n{\n InputParameters params = MultiAppTransfer::validParams();\n params.addClassDescription(\n \"Reconstruct the value of a CONSTANT MONOMIAL variable associating the \"\n \"value of each element to the value of the postprocessor in the closest \"\n \"MultiApp.\");\n params.addRequiredParam<PostprocessorName>(\n \"postprocessor\", \"The name of the postprocessor in the MultiApp to transfer the value from.\");\n params.addRequiredParam<VariableName>(\"source_variable\",\n \"The CONSTANT \"\n \"MONOMIAL variable to transfer to.\");\n params.addParam<unsigned int>(\"source_variable_component\", 0, \"The component of source variable\");\n return params;\n}\n\nMultiAppPostprocessorNearestElementTransfer::MultiAppPostprocessorNearestElementTransfer(\n const InputParameters & parameters)\n : MultiAppTransfer(parameters),\n _postprocessor_name(getParam<PostprocessorName>(\"postprocessor\")),\n _to_var_name(getParam<VariableName>(\"source_variable\")),\n _to_problem(getFromMultiApp()->problemBase()),\n _to_var(_to_problem.getVariable(0, _to_var_name)),\n _to_sys(_to_var.sys().system()),\n _to_mesh(_to_problem.mesh().getMesh()),\n _to_sys_num(_to_sys.number()),\n _to_var_num(_to_sys.variable_number(\n _to_var.componentName(getParam<unsigned int>(\"source_variable_component\"))))\n{\n \/\/ Check the number of transfer directions.\n if (_directions.size() != 1 && _directions.get(0) != FROM_MULTIAPP)\n mooseError(\"MultiAppPostprocessorNearestElementTransfer works only with direction equal to \"\n \"FROM_MULTIAPP\");\n\n \/\/ Check that the variable is a CONSTANT MONOMIAL.\n auto & to_fe_type = _to_sys.variable_type(_to_var_num);\n if (to_fe_type.order != CONSTANT || to_fe_type.family != MONOMIAL)\n mooseError(parameters.blockLocation() + \" \" + parameters.blockFullpath() +\n \"\\nMultiAppPostprocessorNearestElementTransfer works with CONSTANT MONOMIAL \"\n \"variables only\");\n}\n\nvoid\nMultiAppPostprocessorNearestElementTransfer::initialSetup()\n{\n \/\/ Cache the Multiapp position ID for every element.\n unsigned int multiapp_pos_id = 0;\n for (auto & elem :\n as_range(_to_mesh.active_local_elements_begin(), _to_mesh.active_local_elements_end()))\n {\n \/\/ Exclude the elements without dofs.\n if (elem->n_dofs(_to_sys_num, _to_var_num) > 0)\n {\n Real distance = std::numeric_limits<Real>::max();\n for (unsigned int j = 0; j < getFromMultiApp()->numGlobalApps(); ++j)\n {\n Real current_distance = (getFromMultiApp()->position(j) - elem->true_centroid()).norm();\n if (current_distance < distance)\n {\n distance = current_distance;\n multiapp_pos_id = j;\n }\n }\n _cached_multiapp_pos_ids.push_back(multiapp_pos_id);\n }\n }\n}\n\nvoid\nMultiAppPostprocessorNearestElementTransfer::execute()\n{\n \/\/ Check that transfer direction is FROM_MULTIAPP.\n if (_current_direction != FROM_MULTIAPP)\n paramError(\"direction\", \"This transfer works only with direction equal to FROM_MULTIAPP\");\n\n \/\/ Retrieve the vector of the variable values.\n NumericVector<Real> & solution = *_to_sys.solution;\n\n \/\/ Store the local multiapps postprocessor values.\n const unsigned int n_subapps = getFromMultiApp()->numGlobalApps();\n std::vector<Real> pp_values(n_subapps, std::numeric_limits<Real>::max());\n std::vector<Real> duplicate(n_subapps, -std::numeric_limits<Real>::max());\n for (const auto i : make_range(n_subapps))\n if (getFromMultiApp()->hasLocalApp(i))\n {\n pp_values[i] = getFromMultiApp()->appPostprocessorValue(i, _postprocessor_name);\n duplicate[i] = pp_values[i];\n }\n\n \/\/ Gather all the multiapps postprocessor values.\n _communicator.min(pp_values);\n _communicator.max(duplicate);\n for (const auto i : make_range(n_subapps))\n if (pp_values[i] != duplicate[i])\n mooseError(\"There should be only one processor setting a subapp postprocessor but now this \"\n \"appears not true.\");\n\n \/\/ Assign the multiapps postprocessor values to the local elements.\n unsigned int i = 0;\n for (auto & elem :\n as_range(_to_mesh.active_local_elements_begin(), _to_mesh.active_local_elements_end()))\n {\n \/\/ Exclude the elements without dofs\n if (elem->n_dofs(_to_sys_num, _to_var_num) > 0)\n {\n dof_id_type dof = elem->dof_number(_to_sys_num, _to_var_num, 0);\n solution.set(dof, pp_values[_cached_multiapp_pos_ids[i]]);\n ++i;\n }\n }\n solution.close();\n}\n<commit_msg>Only do second all-to-all communication in debug mode<commit_after>\/\/* This file is part of the MOOSE framework\n\/\/* https:\/\/www.mooseframework.org\n\/\/*\n\/\/* All rights reserved, see COPYRIGHT for full restrictions\n\/\/* https:\/\/github.com\/idaholab\/moose\/blob\/master\/COPYRIGHT\n\/\/*\n\/\/* Licensed under LGPL 2.1, please see LICENSE for details\n\/\/* https:\/\/www.gnu.org\/licenses\/lgpl-2.1.html\n\n#include \"MultiAppPostprocessorNearestElementTransfer.h\"\n#include \"FEProblem.h\"\n#include \"MooseMesh.h\"\n#include \"MooseTypes.h\"\n#include \"MooseVariableFE.h\"\n#include \"MultiApp.h\"\n#include \"SystemBase.h\"\n\nregisterMooseObject(\"MooseApp\", MultiAppPostprocessorNearestElementTransfer);\n\nInputParameters\nMultiAppPostprocessorNearestElementTransfer::validParams()\n{\n InputParameters params = MultiAppTransfer::validParams();\n params.addClassDescription(\n \"Reconstruct the value of a CONSTANT MONOMIAL variable associating the \"\n \"value of each element to the value of the postprocessor in the closest \"\n \"MultiApp.\");\n params.addRequiredParam<PostprocessorName>(\n \"postprocessor\", \"The name of the postprocessor in the MultiApp to transfer the value from.\");\n params.addRequiredParam<VariableName>(\"source_variable\",\n \"The CONSTANT \"\n \"MONOMIAL variable to transfer to.\");\n params.addParam<unsigned int>(\"source_variable_component\", 0, \"The component of source variable\");\n return params;\n}\n\nMultiAppPostprocessorNearestElementTransfer::MultiAppPostprocessorNearestElementTransfer(\n const InputParameters & parameters)\n : MultiAppTransfer(parameters),\n _postprocessor_name(getParam<PostprocessorName>(\"postprocessor\")),\n _to_var_name(getParam<VariableName>(\"source_variable\")),\n _to_problem(getFromMultiApp()->problemBase()),\n _to_var(_to_problem.getVariable(0, _to_var_name)),\n _to_sys(_to_var.sys().system()),\n _to_mesh(_to_problem.mesh().getMesh()),\n _to_sys_num(_to_sys.number()),\n _to_var_num(_to_sys.variable_number(\n _to_var.componentName(getParam<unsigned int>(\"source_variable_component\"))))\n{\n \/\/ Check the number of transfer directions.\n if (_directions.size() != 1 && _directions.get(0) != FROM_MULTIAPP)\n mooseError(\"MultiAppPostprocessorNearestElementTransfer works only with direction equal to \"\n \"FROM_MULTIAPP\");\n\n \/\/ Check that the variable is a CONSTANT MONOMIAL.\n auto & to_fe_type = _to_sys.variable_type(_to_var_num);\n if (to_fe_type.order != CONSTANT || to_fe_type.family != MONOMIAL)\n mooseError(parameters.blockLocation() + \" \" + parameters.blockFullpath() +\n \"\\nMultiAppPostprocessorNearestElementTransfer works with CONSTANT MONOMIAL \"\n \"variables only\");\n}\n\nvoid\nMultiAppPostprocessorNearestElementTransfer::initialSetup()\n{\n \/\/ Cache the Multiapp position ID for every element.\n unsigned int multiapp_pos_id = 0;\n for (auto & elem :\n as_range(_to_mesh.active_local_elements_begin(), _to_mesh.active_local_elements_end()))\n {\n \/\/ Exclude the elements without dofs.\n if (elem->n_dofs(_to_sys_num, _to_var_num) > 0)\n {\n Real distance = std::numeric_limits<Real>::max();\n for (unsigned int j = 0; j < getFromMultiApp()->numGlobalApps(); ++j)\n {\n Real current_distance = (getFromMultiApp()->position(j) - elem->true_centroid()).norm();\n if (current_distance < distance)\n {\n distance = current_distance;\n multiapp_pos_id = j;\n }\n }\n _cached_multiapp_pos_ids.push_back(multiapp_pos_id);\n }\n }\n}\n\nvoid\nMultiAppPostprocessorNearestElementTransfer::execute()\n{\n \/\/ Check that transfer direction is FROM_MULTIAPP.\n if (_current_direction != FROM_MULTIAPP)\n paramError(\"direction\", \"This transfer works only with direction equal to FROM_MULTIAPP\");\n\n \/\/ Retrieve the vector of the variable values.\n NumericVector<Real> & solution = *_to_sys.solution;\n\n \/\/ Store the local multiapps postprocessor values.\n const unsigned int n_subapps = getFromMultiApp()->numGlobalApps();\n std::vector<Real> pp_values(n_subapps, std::numeric_limits<Real>::max());\n#ifdef DEBUG\n std::vector<Real> duplicate(n_subapps, -std::numeric_limits<Real>::max());\n#endif\n for (const auto i : make_range(n_subapps))\n if (getFromMultiApp()->hasLocalApp(i))\n {\n pp_values[i] = getFromMultiApp()->appPostprocessorValue(i, _postprocessor_name);\n#ifdef DEBUG\n duplicate[i] = pp_values[i];\n#endif\n }\n\n \/\/ Gather all the multiapps postprocessor values.\n _communicator.min(pp_values);\n#ifdef DEBUG\n _communicator.max(duplicate);\n for (const auto i : make_range(n_subapps))\n if (pp_values[i] != duplicate[i])\n mooseError(\"There should be only one processor setting a subapp postprocessor but now this \"\n \"appears not true.\");\n#endif\n\n \/\/ Assign the multiapps postprocessor values to the local elements.\n unsigned int i = 0;\n for (auto & elem :\n as_range(_to_mesh.active_local_elements_begin(), _to_mesh.active_local_elements_end()))\n {\n \/\/ Exclude the elements without dofs\n if (elem->n_dofs(_to_sys_num, _to_var_num) > 0)\n {\n dof_id_type dof = elem->dof_number(_to_sys_num, _to_var_num, 0);\n solution.set(dof, pp_values[_cached_multiapp_pos_ids[i]]);\n ++i;\n }\n }\n solution.close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ 6.exercise.10.cpp\n\/\/ \n\/\/ A permutation is an ordered subset of a set. For example, say you wanted to\n\/\/ pick a combination to a vault. There are 60 possible numbers, and you need\n\/\/ three different numbers for the combination. There are P(60,3) permutations\n\/\/ for the combination, where P is defined by the formula\n\/\/ \n\/\/ a! \n\/\/ P(a,b) = ------,\n\/\/ (a-b)!\n\/\/ \n\/\/ where ! is used as a suffix factorial operator. For example, 4! is\n\/\/ 4\\*3\\*2\\*1.\n\/\/ \n\/\/ Combinations are similar to permutations, except that the order of the\n\/\/ objects doesn't matter. For example, if you were making a \"banana split\"\n\/\/ sundea and wished to use three different flavors of ice cream out of five\n\/\/ that you had, you wouldn't care if you used a scoop of vanilla at the\n\/\/ beginning or the end; you would still have used vanilla. The formula for\n\/\/ combination is\n\/\/ \n\/\/ P(a,b)\n\/\/ C(a,b) = ------.\n\/\/ b!\n\/\/ \n\/\/ Design a program that asks users for two numbers, asks them whether they\n\/\/ want to calculate permutations or combinations, and prints out the result.\n\/\/ This will have several parts. Do an analysis of the above requeriments.\n\/\/ Write exactly what the program will have to do. Then go into design phase.\n\/\/ Write pseudo code for the program, and break it into sub-components. This\n\/\/ program should have error checking. Make sure that all erroneous inputs will\n\/\/ generate good error messages\n\/\/\n\/\/ Comments: See 6.exercise.10.md\n\n#include \"std_lib_facilities.h\"\n\nconst string ex_msg_pmul_with_negs = \"check_pmul() called with negative integers.\";\nconst string ex_msg_product_overflows = \"integer multiplication overflows.\";\n\nint get_natural()\n\/\/ Currently it only reads a integer without any check. It's an straight\n\/\/ version to check other functions implementation.\n{\n int n;\n cin >> n;\n return n;\n}\n\nbool check_pmul(int a, int b)\n\/\/ Partial implementation from SECURE CODING INT32C.\n\/\/ It do not throw since is its work to tell if multiplication could\n\/\/ be performed or not. Using exceptions is, I think, BLAHBLAHBLAH\n\/\/ Precondition:\n\/\/ Both arguments must be positive.\n{\n if (a < 0 || b < 0) \n throw runtime_error(ex_msg_pmul_with_negs);\n\n if ( a > (numeric_limits<int>::max() \/ b) )\n return false;\n\n return true;\n}\n\nint perm(int n, int k)\n\/\/ Calculates the k-permutations of n elements, what we call P(n, k).\n\/\/ This is not done with the factorial formula expressed in the statement but\n\/\/ with a limited product. See 6.exercise.10.md for details.\n\/\/ If either n or k equals zero, the permutation is 1.\n\/\/\n\/\/ Preconditions:\n\/\/ - n and k must be positive and n >= k. We will not check this\n\/\/ precondition here since we assume it is assured by previous calls to\n\/\/ get_natural() and check_input().\n{\n if (n == 0 || k == 0) return 1;\n\n int prod = 1;\n\n for (int i = n-k+1; i <= n; ++i)\n if (check_pmul(prod, i))\n prod *= i;\n else\n throw runtime_error(ex_msg_product_overflows);\n\n return prod;\n}\n\nint main(void)\ntry\n{\n int setc = 0;\n int subc = 0;\n char cont = 'y';\n\n while (cont == 'y' || cont == 'Y') {\n cout << \"Set cardinality?\\n\";\n setc = get_natural();\n cout << \"Subset cardinality?\\n\";\n subc = get_natural();\n cout << perm(setc, subc) << '\\n'; \n cout << perm(-1, subc) << '\\n'; \n }\n \n return 0;\n}\ncatch(exception& e)\n{\n cerr << e.what() << '\\n';\n return 1;\n}\ncatch(...)\n{\n cerr << \"Oops! Unknown exception.\\n\";\n return 2; \n}\n<commit_msg>Another proof of concept.<commit_after>\/\/ 6.exercise.10.cpp\n\/\/ \n\/\/ A permutation is an ordered subset of a set. For example, say you wanted to\n\/\/ pick a combination to a vault. There are 60 possible numbers, and you need\n\/\/ three different numbers for the combination. There are P(60,3) permutations\n\/\/ for the combination, where P is defined by the formula\n\/\/ \n\/\/ a! \n\/\/ P(a,b) = ------,\n\/\/ (a-b)!\n\/\/ \n\/\/ where ! is used as a suffix factorial operator. For example, 4! is\n\/\/ 4\\*3\\*2\\*1.\n\/\/ \n\/\/ Combinations are similar to permutations, except that the order of the\n\/\/ objects doesn't matter. For example, if you were making a \"banana split\"\n\/\/ sundea and wished to use three different flavors of ice cream out of five\n\/\/ that you had, you wouldn't care if you used a scoop of vanilla at the\n\/\/ beginning or the end; you would still have used vanilla. The formula for\n\/\/ combination is\n\/\/ \n\/\/ P(a,b)\n\/\/ C(a,b) = ------.\n\/\/ b!\n\/\/ \n\/\/ Design a program that asks users for two numbers, asks them whether they\n\/\/ want to calculate permutations or combinations, and prints out the result.\n\/\/ This will have several parts. Do an analysis of the above requeriments.\n\/\/ Write exactly what the program will have to do. Then go into design phase.\n\/\/ Write pseudo code for the program, and break it into sub-components. This\n\/\/ program should have error checking. Make sure that all erroneous inputs will\n\/\/ generate good error messages\n\/\/\n\/\/ Comments: See 6.exercise.10.md\n\n#include \"std_lib_facilities.h\"\n\nconst string ex_msg_pmul_with_negs = \"called with negative integers.\";\nconst string ex_msg_product_overflows = \"integer multiplication overflows.\";\n\nint get_natural()\n\/\/ Currently it only reads a integer without any check. It's an straight\n\/\/ version to check other functions implementation.\n{\n int n;\n cin >> n;\n return n;\n}\n\nbool check_pmul(int a, int b)\n\/\/ Partial implementation from SECURE CODING INT32C.\n\/\/ It do not throw since is its work to tell if multiplication could\n\/\/ be performed or not. Using exceptions is, I think, BLAHBLAHBLAH\n\/\/ Precondition:\n\/\/ Both arguments must be positive.\n{\n if (a < 0 || b < 0) \n throw runtime_error(\"check_pmul(): \" + ex_msg_pmul_with_negs);\n\n if ( a > (numeric_limits<int>::max() \/ b) )\n return false;\n\n return true;\n}\n\nint perm(int n, int k)\n\/\/ Calculates the k-permutations of n elements, what we call P(n, k).\n\/\/ This is not done with the factorial formula expressed in the statement but\n\/\/ with a limited product. See 6.exercise.10.md for details.\n\/\/ If either n or k equals zero, the permutation is 1.\n\/\/\n\/\/ Preconditions:\n\/\/ - n and k must be positive and n >= k. We will not check this\n\/\/ precondition here since we assume it is assured by previous calls to\n\/\/ get_natural() and check_input().\n{\n if (n == 0 || k == 0) return 1;\n\n int prod = 1;\n\n for (int i = n-k+1; i <= n; ++i)\n if (check_pmul(prod, i))\n prod *= i;\n else\n throw runtime_error(\"perm(): \" + ex_msg_product_overflows);\n\n return prod;\n}\n\nint comb(int n, int k)\n\/\/ Calculates the k-combinations of n elements, what we call C(n, k).\n\/\/ This is not done with the factorial formula expressed in the statement but,\n\/\/ being the k-combinations of n element also known as the binomial\n\/\/ coefficient, using the multiplicative formual as stated in\n\/\/ https:\/\/en.wikipedia.org\/wiki\/Binomial_coefficient#Multiplicative_formula\n\/\/\n\/\/ Preconditions:\n\/\/ - n and k must be positive and n >= k. We will not check this\n\/\/ precondition here since we assume it is assured by previous calls to\n\/\/ get_natural() and check_input().\n{\n if (n == 0 || k == 0) return 1;\n\n int prod = 1;\n\n for (int i = 1; i <= k; ++i)\n if (check_pmul(prod, n+1-i))\n \/\/ Multiplying first by the numerator ensure the division to have\n \/\/ no reminder. \n prod = (prod * (n+1-i)) \/ i;\n else\n throw runtime_error(\"comb(): \" + ex_msg_product_overflows);\n\n return prod;\n}\n\nint main(void)\ntry\n{\n int setc = 0;\n int subc = 0;\n char cont = 'y';\n\n while (cont == 'y' || cont == 'Y') {\n cout << \"Set cardinality?\\n\";\n setc = get_natural();\n cout << \"Subset cardinality?\\n\";\n subc = get_natural();\n \n try {\n cout << \"P(\" << setc << \", \" << subc << \") = \" << perm(setc, subc) << '\\n'; \n } catch(exception &e) {\n cerr << \"Exception -> \" << e.what() << '\\n';\n }\n\n try {\n cout << \"C(\" << setc << \", \" << subc << \") = \" << comb(setc, subc) << '\\n'; \n } catch(exception &e) {\n cerr << \"Exception -> \" << e.what() << '\\n';\n }\n }\n \n return 0;\n}\ncatch(exception& e)\n{\n cerr << e.what() << '\\n';\n return 1;\n}\ncatch(...)\n{\n cerr << \"Oops! Unknown exception.\\n\";\n return 2; \n}\n<|endoftext|>"} {"text":"<commit_before>#include \"CTableCreatorVisitor.h\"\n#include \"CJiveEnvironment.h\"\n\nnamespace AST\n{\n\nusing jive::CJiveEnvironment;\n\nvoid CTableCreatorVisitor::Start( IVisitorTarget *vertex ) {\n vertex->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CProgram *program ) {\n program->getRoot()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CGoal *goal ) {\n goal->getLeft()->Accept( this );\n goal->getRight()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CType *type ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CVariable *entity ) {\n CTypeSymbol *varTypeSymbol = jiveEnv->typeMap->lookup( entity->getType() );\n if( varTypeSymbol == nullptr ) {\n varTypeSymbol = new CTypeSymbol( entity->getType()->getSymbol() );\n }\n\n CVariableSymbol* varSymbol = new CVariableSymbol( entity->getSymbol(), varTypeSymbol, entity );\n if( curMethodSymbol == nullptr ) {\n if( curClassSymbol->lookupField( varSymbol ) != nullptr ) {\n std::cerr << \"Error: Redefinition of the field \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n curClassSymbol->insertField( varSymbol );\n } else {\n if( curMethodSymbol->lookupArgument( varSymbol->getSymbol() ) != nullptr ) {\n std::cerr << \"Error: Redeclaration of argument \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n if( curMethodSymbol->lookupVariable( varSymbol ) != nullptr ) {\n std::cerr << \"Error: Redeclaration of variable \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n curMethodSymbol->insertVariable( varSymbol );\n }\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundVariable *entity ) {\n if( entity->getNextVariable() ) {\n entity->getNextVariable()->Accept( this );\n }\n entity->getVariable()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CArgument *entity ) {\n CTypeSymbol *argTypeSymbol = jiveEnv->typeMap->lookup( entity->getType() );\n if( argTypeSymbol == nullptr ) {\n argTypeSymbol = new CTypeSymbol( entity->getType()->getSymbol() );\n }\n\n CVariableSymbol* argSymbol = new CVariableSymbol( entity->getSymbol(), argTypeSymbol, entity );\n if( curMethodSymbol->lookupArgument( argSymbol->getSymbol() ) != nullptr ) {\n\t\tstd::cerr << \"Error: Redeclaration of argument \\\"\" << argSymbol->getString() << \"\\\"\\n\";\n\t\tdelete argSymbol;\n\t\treturn;\n\t}\n curMethodSymbol->insertArgument( argSymbol );\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundArgument *entity ) {\n if( entity->getNextArgument() ) {\n \tentity->getNextArgument()->Accept( this );\n\t}\n entity->getArgument()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CMethod *entity ) { \n CTypeSymbol *methodTypeSymbol = jiveEnv->typeMap->lookup( entity->getReturnType() );\n if( methodTypeSymbol == nullptr ) {\n methodTypeSymbol = new CTypeSymbol( entity->getReturnType()->getSymbol() );\n }\n\n CMethodSymbol* methodSymbol = new CMethodSymbol( entity->getSymbol(), methodTypeSymbol, entity );\n if( curClassSymbol->lookupMethod( methodSymbol ) != nullptr ) {\n std::cerr << \"Error: Redeclaration of variable \\\"\" << methodSymbol->getString() << \"\\\"\\n\";\n delete methodSymbol;\n return;\n }\n curClassSymbol->insertMethod( methodSymbol );\n\n curMethodSymbol = methodSymbol;\n if( entity->getArguments() ) {\n \tentity->getArguments()->Accept( this );\n\t}\n\n if( entity->getVariables() ) {\n entity->getVariables()->Accept( this );\n }\n\n if( entity->getStatements() ) {\n entity->getStatements()->Accept( this );\n }\n\n entity->getReturnExpression()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundMethod *entity ) {\n if( entity->getNextMethod() ) {\n\t\tentity->getNextMethod()->Accept( this );\n }\n entity->getMethod()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CMainClass *entity ) {\n CTypeSymbol *mainClassTypeSymbol = new CTypeSymbol( entity->getSymbol() );\n jiveEnv->typeMap->insert( new CType( jive::CLASS, entity->getSymbol() ), mainClassTypeSymbol );\n\n CClassSymbol* classSymbol = new CClassSymbol( entity->getSymbol(), mainClassTypeSymbol, nullptr, entity );\n jiveEnv->classMap->insert( entity, classSymbol );\n\n curClassSymbol = classSymbol;\n\n\tentity->getMethods()->getMethod()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CClass *entity ) {\n CTypeSymbol *classTypeSymbol = new CTypeSymbol( entity->getSymbol() );\n jiveEnv->typeMap->insert( new CType( jive::CLASS, entity->getSymbol() ), classTypeSymbol );\n\n CClassSymbol* classSymbol = new CClassSymbol( entity->getSymbol(), classTypeSymbol, nullptr, entity );\n if( jiveEnv->classMap->lookup( entity ) != nullptr ) {\n std::cerr << \"Error: Redefinition of class \\\"\" << classSymbol->getString() << \"\\\"\\n\";\n delete classSymbol;\n return;\n }\n jiveEnv->classMap->insert( entity, classSymbol );\n curClassSymbol = classSymbol;\n curMethodSymbol = nullptr;\n\n if( entity->getParentId() ) {\n classSymbol->setBaseClass( jiveEnv->classMap->lookup( entity->getParentSymbol() ) );\n if( classSymbol->getBaseClass() == nullptr ) {\n classSymbol->setBaseClass( new CClassSymbol( entity->getParentSymbol(), new CTypeSymbol( entity->getParentSymbol() ), nullptr, nullptr ) );\n }\n }\n\n if( entity->getFields() ) {\n\t\tentity->getFields()->Accept( this );\n }\n\n if( entity->getMethods() ) {\n\t\tentity->getMethods()->Accept( this );\n }\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundClass *entity ) {\n\n if( entity->getNextClass() ) {\n entity->getNextClass()->Accept( this );\n }\n entity->getClass()->Accept( this );\n}\n\n\nvoid CTableCreatorVisitor::Visit( CCompoundStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CAssignStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CPrintStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CIfStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CWhileStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CIdExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBinaryExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNumberExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBinaryBooleanExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBooleanExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CThisExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNewObjectExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNewIntArrayExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CMethodCallExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CArrayLengthExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CArrayIndexExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CVoidExpression *expression ) {\n} \n\n}<commit_msg>fixed std::cerr in visitor<commit_after>#include \"CTableCreatorVisitor.h\"\n#include \"CJiveEnvironment.h\"\n\nnamespace AST\n{\n\nusing jive::CJiveEnvironment;\n\nvoid CTableCreatorVisitor::Start( IVisitorTarget *vertex ) {\n vertex->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CProgram *program ) {\n program->getRoot()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CGoal *goal ) {\n goal->getLeft()->Accept( this );\n goal->getRight()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CType *type ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CVariable *entity ) {\n CTypeSymbol *varTypeSymbol = jiveEnv->typeMap->lookup( entity->getType() );\n if( varTypeSymbol == nullptr ) {\n varTypeSymbol = new CTypeSymbol( entity->getType()->getSymbol() );\n }\n\n CVariableSymbol* varSymbol = new CVariableSymbol( entity->getSymbol(), varTypeSymbol, entity );\n if( curMethodSymbol == nullptr ) {\n if( curClassSymbol->lookupField( varSymbol ) != nullptr ) {\n outputStream << \"Error: Redefinition of the field \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n curClassSymbol->insertField( varSymbol );\n } else {\n if( curMethodSymbol->lookupArgument( varSymbol->getSymbol() ) != nullptr ) {\n outputStream << \"Error: Redeclaration of argument \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n if( curMethodSymbol->lookupVariable( varSymbol ) != nullptr ) {\n outputStream << \"Error: Redeclaration of variable \\\"\" << varSymbol->getString() << \"\\\"\\n\";\n delete varSymbol;\n return;\n }\n curMethodSymbol->insertVariable( varSymbol );\n }\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundVariable *entity ) {\n if( entity->getNextVariable() ) {\n entity->getNextVariable()->Accept( this );\n }\n entity->getVariable()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CArgument *entity ) {\n CTypeSymbol *argTypeSymbol = jiveEnv->typeMap->lookup( entity->getType() );\n if( argTypeSymbol == nullptr ) {\n argTypeSymbol = new CTypeSymbol( entity->getType()->getSymbol() );\n }\n\n CVariableSymbol* argSymbol = new CVariableSymbol( entity->getSymbol(), argTypeSymbol, entity );\n if( curMethodSymbol->lookupArgument( argSymbol->getSymbol() ) != nullptr ) {\n\t\toutputStream << \"Error: Redeclaration of argument \\\"\" << argSymbol->getString() << \"\\\"\\n\";\n\t\tdelete argSymbol;\n\t\treturn;\n\t}\n curMethodSymbol->insertArgument( argSymbol );\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundArgument *entity ) {\n if( entity->getNextArgument() ) {\n \tentity->getNextArgument()->Accept( this );\n\t}\n entity->getArgument()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CMethod *entity ) { \n CTypeSymbol *methodTypeSymbol = jiveEnv->typeMap->lookup( entity->getReturnType() );\n if( methodTypeSymbol == nullptr ) {\n methodTypeSymbol = new CTypeSymbol( entity->getReturnType()->getSymbol() );\n }\n\n CMethodSymbol* methodSymbol = new CMethodSymbol( entity->getSymbol(), methodTypeSymbol, entity );\n if( curClassSymbol->lookupMethod( methodSymbol ) != nullptr ) {\n outputStream << \"Error: Redeclaration of variable \\\"\" << methodSymbol->getString() << \"\\\"\\n\";\n delete methodSymbol;\n return;\n }\n curClassSymbol->insertMethod( methodSymbol );\n\n curMethodSymbol = methodSymbol;\n if( entity->getArguments() ) {\n \tentity->getArguments()->Accept( this );\n\t}\n\n if( entity->getVariables() ) {\n entity->getVariables()->Accept( this );\n }\n\n if( entity->getStatements() ) {\n entity->getStatements()->Accept( this );\n }\n\n entity->getReturnExpression()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundMethod *entity ) {\n if( entity->getNextMethod() ) {\n\t\tentity->getNextMethod()->Accept( this );\n }\n entity->getMethod()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CMainClass *entity ) {\n CTypeSymbol *mainClassTypeSymbol = new CTypeSymbol( entity->getSymbol() );\n jiveEnv->typeMap->insert( new CType( jive::CLASS, entity->getSymbol() ), mainClassTypeSymbol );\n\n CClassSymbol* classSymbol = new CClassSymbol( entity->getSymbol(), mainClassTypeSymbol, nullptr, entity );\n jiveEnv->classMap->insert( entity, classSymbol );\n\n curClassSymbol = classSymbol;\n\n\tentity->getMethods()->getMethod()->Accept( this );\n}\n\nvoid CTableCreatorVisitor::Visit( CClass *entity ) {\n CTypeSymbol *classTypeSymbol = new CTypeSymbol( entity->getSymbol() );\n jiveEnv->typeMap->insert( new CType( jive::CLASS, entity->getSymbol() ), classTypeSymbol );\n\n CClassSymbol* classSymbol = new CClassSymbol( entity->getSymbol(), classTypeSymbol, nullptr, entity );\n if( jiveEnv->classMap->lookup( entity ) != nullptr ) {\n outputStream << \"Error: Redefinition of class \\\"\" << classSymbol->getString() << \"\\\"\\n\";\n delete classSymbol;\n return;\n }\n jiveEnv->classMap->insert( entity, classSymbol );\n curClassSymbol = classSymbol;\n curMethodSymbol = nullptr;\n\n if( entity->getParentId() ) {\n classSymbol->setBaseClass( jiveEnv->classMap->lookup( entity->getParentSymbol() ) );\n if( classSymbol->getBaseClass() == nullptr ) {\n classSymbol->setBaseClass( new CClassSymbol( entity->getParentSymbol(), new CTypeSymbol( entity->getParentSymbol() ), nullptr, nullptr ) );\n }\n }\n\n if( entity->getFields() ) {\n\t\tentity->getFields()->Accept( this );\n }\n\n if( entity->getMethods() ) {\n\t\tentity->getMethods()->Accept( this );\n }\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundClass *entity ) {\n\n if( entity->getNextClass() ) {\n entity->getNextClass()->Accept( this );\n }\n entity->getClass()->Accept( this );\n}\n\n\nvoid CTableCreatorVisitor::Visit( CCompoundStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CAssignStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CPrintStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CIfStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CWhileStatement *statement ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CIdExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBinaryExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNumberExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBinaryBooleanExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CBooleanExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CThisExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNewObjectExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CNewIntArrayExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CMethodCallExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CArrayLengthExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CArrayIndexExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CCompoundExpression *expression ) {\n}\n\nvoid CTableCreatorVisitor::Visit( CVoidExpression *expression ) {\n} \n\n}<|endoftext|>"} {"text":"<commit_before>#include \"ex13_34_36_37.h\"\n#include <iostream>\nusing namespace std;\n\nvoid swap(Message &lhs, Message &rhs)\n{\n using std::swap;\n\n lhs.remove_from_Folders();\n rhs.remove_from_Folders();\n\n swap(lhs.folders, rhs.folders);\n swap(lhs.contents, rhs.contents);\n\n lhs.add_to_Folders(lhs);\n rhs.add_to_Folders(rhs);\n}\n\n\/\/Message Implementation\nMessage::Message(const Message &m):contents(m.contents), folders(m.folders)\n{\n add_to_Folders(m);\n}\n\nMessage &Message::operator=(const Message &rhs)\n{\n remove_from_Folders();\n contents=rhs.contents;\n folders=rhs.folders;\n add_to_Folders(rhs);\n return *this ;\n}\n\nMessage::~Message()\n{\n remove_from_Folders();\n}\n\nvoid Message::save(Folder &f)\n{\n addFldr(&f);\n f.addMsg(this);\n}\n\nvoid Message::remove(Folder &f)\n{\n remFldr(&f);\n f.remMsg(this);\n}\n\nvoid Message::print_debug()\n{\n cout<<contents<<endl;\n}\n\nvoid Message::add_to_Folders(const Message &m)\n{\n for(auto f:m.folders)\n f->addMsg(this);\n}\n\nvoid Message::remove_from_Folders()\n{\n for(auto f:folders)\n f->remMsg(this);\n}\n\n\n\nvoid swap(Folder &lhs, Folder &rhs)\n{\n using std::swap;\n\n lhs.remove_from_Messages();\n rhs.remove_from_Messages();\n\n swap(lhs.msgs, rhs.msgs);\n\n lhs.add_to_Messages(lhs);\n rhs.add_to_Messages(rhs);\n}\n\n\/\/Folder Implementation\nFolder::Folder(const Folder &f):msgs(f.msgs)\n{\n add_to_Messages(f);\n}\n\nFolder &Folder::operator=(const Folder &rhs)\n{\n remove_from_Messages();\n msgs=rhs.msgs;\n add_to_Messages(rhs);\n return *this ;\n}\n\nFolder::~Folder()\n{\n remove_from_Messages();\n}\n\nvoid Folder::print_debug()\n{\n for(auto m:msgs)\n cout<<m->contents<<\" \";\n cout<<endl;\n}\n\nvoid Folder::add_to_Messages(const Folder &f)\n{\n for(auto m:f.msgs)\n m->addFldr(this);\n}\n\nvoid Folder::remove_from_Messages()\n{\n for(auto m:msgs)\n m->remFldr(this);\n}\n<commit_msg>Update ex13_34_36_37.cpp<commit_after>#include <iostream>\n#include \"ex13_34_36_37.h\"\nusing namespace std;\n\nvoid swap(Message &lhs, Message &rhs)\n{\n using std::swap;\n\n lhs.remove_from_Folders();\n rhs.remove_from_Folders();\n\n swap(lhs.folders, rhs.folders);\n swap(lhs.contents, rhs.contents);\n\n lhs.add_to_Folders(lhs);\n rhs.add_to_Folders(rhs);\n}\n\n\/\/Message Implementation\nMessage::Message(const Message &m):contents(m.contents), folders(m.folders)\n{\n add_to_Folders(m);\n}\n\nMessage &Message::operator=(const Message &rhs)\n{\n remove_from_Folders();\n contents=rhs.contents;\n folders=rhs.folders;\n add_to_Folders(rhs);\n return *this ;\n}\n\nMessage::~Message()\n{\n remove_from_Folders();\n}\n\nvoid Message::save(Folder &f)\n{\n addFldr(&f);\n f.addMsg(this);\n}\n\nvoid Message::remove(Folder &f)\n{\n remFldr(&f);\n f.remMsg(this);\n}\n\nvoid Message::print_debug()\n{\n cout<<contents<<endl;\n}\n\nvoid Message::add_to_Folders(const Message &m)\n{\n for(auto f:m.folders)\n f->addMsg(this);\n}\n\nvoid Message::remove_from_Folders()\n{\n for(auto f:folders)\n f->remMsg(this);\n}\n\n\n\nvoid swap(Folder &lhs, Folder &rhs)\n{\n using std::swap;\n\n lhs.remove_from_Messages();\n rhs.remove_from_Messages();\n\n swap(lhs.msgs, rhs.msgs);\n\n lhs.add_to_Messages(lhs);\n rhs.add_to_Messages(rhs);\n}\n\n\/\/Folder Implementation\nFolder::Folder(const Folder &f):msgs(f.msgs)\n{\n add_to_Messages(f);\n}\n\nFolder &Folder::operator=(const Folder &rhs)\n{\n remove_from_Messages();\n msgs=rhs.msgs;\n add_to_Messages(rhs);\n return *this ;\n}\n\nFolder::~Folder()\n{\n remove_from_Messages();\n}\n\nvoid Folder::print_debug()\n{\n for(auto m:msgs)\n cout<<m->contents<<\" \";\n cout<<endl;\n}\n\nvoid Folder::add_to_Messages(const Folder &f)\n{\n for(auto m:f.msgs)\n m->addFldr(this);\n}\n\nvoid Folder::remove_from_Messages()\n{\n for(auto m:msgs)\n m->remFldr(this);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* -*- indent-tabs-mode: nil -*- *\/\n\/*\n ODBCConnection.cpp\n\n Qore ODBC module\n\n Copyright (C) 2016 Ondrej Musil\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"ODBCConnection.h\"\n\n#include <memory>\n\n#include \"qore\/QoreLib.h\"\n\n#include \"ErrorHelper.h\"\n#include \"ODBCStatement.h\"\n\n\nODBCConnection::ODBCConnection(Datasource* d, ExceptionSink* xsink) : ds(d), clientVer(0), serverVer(0) {\n SQLRETURN ret;\n \/\/ Allocate an environment handle.\n ret = SQLAllocHandle(SQL_HANDLE_ENV, SQL_NULL_HANDLE, &env);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n xsink->raiseException(\"DBI:ODBC:ENV-HANDLE-ERROR\", \"could not allocate an environment handle\");\n return;\n }\n\n \/\/ Use ODBC version 3.\n SQLSetEnvAttr(env, SQL_ATTR_ODBC_VERSION, (void*) SQL_OV_ODBC3, 0);\n\n \/\/ Allocate a connection handle.\n ret = SQLAllocHandle(SQL_HANDLE_DBC, env, &dbConn);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n xsink->raiseException(\"DBI:ODBC:CONNECTION-HANDLE-ERROR\", \"could not allocate a connection handle\");\n return;\n }\n\n \/\/ Set connection attributes.\n SQLSetConnectAttr(dbConn, SQL_ATTR_AUTOCOMMIT, SQL_AUTOCOMMIT_OFF, SQL_IS_UINTEGER);\n SQLSetConnectAttr(dbConn, SQL_ATTR_QUIET_MODE, NULL, SQL_IS_POINTER);\n\n \/\/ Create ODBC connection string.\n QoreString connStr(QEM.findCreate(\"ASCII\"));\n if(prepareConnectionString(connStr, xsink))\n return;\n SQLCHAR* odbcDS = reinterpret_cast<SQLCHAR*>(const_cast<char*>(connStr.getBuffer()));\n\n \/\/ Connect.\n ret = SQLDriverConnectA(dbConn, NULL, odbcDS, SQL_NTS, NULL, 0, NULL, SQL_DRIVER_NOPROMPT);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"could not connect to the driver\", \"DBI:ODBC:CONNECTION-ERROR\", xsink);\n return;\n }\n\n \/\/ Get DBMS (server) version.\n char verStr[128]; \/\/ Will contain ver in the form \"01.02.0034\"\n SQLSMALLINT unused;\n ret = SQLGetInfoA(dbConn, SQL_DBMS_VER, verStr, 128, &unused);\n if (SQL_SUCCEEDED(ret)) {\n serverVer = parseOdbcVersion(verStr);\n }\n\n \/\/ Get ODBC DB driver version.\n ret = SQLGetInfoA(dbConn, SQL_DRIVER_VER, verStr, 128, &unused);\n if (SQL_SUCCEEDED(ret)) {\n clientVer = parseOdbcVersion(verStr);\n }\n\n \/\/ timezones, encoding\n \/\/ ???\n\n ds->setDBEncoding(\"UTF-16\");\n}\n\nODBCConnection::~ODBCConnection() {\n while (true) {\n SQLRETURN ret = SQLDisconnect(dbConn);\n if (SQL_SUCCEEDED(ret))\n break;\n qore_usleep(50*1000); \/\/ Sleep in intervals of 50 ms until disconnected.\n }\n\n \/\/ Free up allocated handles.\n SQLFreeHandle(SQL_HANDLE_DBC, dbConn);\n SQLFreeHandle(SQL_HANDLE_ENV, env);\n}\n\nint ODBCConnection::commit(ExceptionSink* xsink) {\n SQLRETURN ret = SQLEndTran(SQL_HANDLE_DBC, dbConn, SQL_COMMIT);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:COMMIT-ERROR\", \"could not commit the transaction\", xsink);\n return -1;\n }\n return 0;\n}\n\nint ODBCConnection::rollback(ExceptionSink* xsink) {\n SQLRETURN ret = SQLEndTran(SQL_HANDLE_DBC, dbConn, SQL_ROLLBACK);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:ROLLBACK-ERROR\", \"could not rollback the transaction\", xsink);\n return -1;\n }\n return 0;\n}\n\nQoreListNode* ODBCConnection::selectRows(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n return res.getOutputList(xsink);\n}\n\nQoreHashNode* ODBCConnection::selectRow(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n return res.getSingleRow(xsink);\n}\n\nAbstractQoreNode* ODBCConnection::exec(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n if (res.hasResultData())\n return res.getOutputHash(xsink);\n\n return new QoreBigIntNode(res.rowsAffected());\n}\n\nAbstractQoreNode* ODBCConnection::execRaw(const QoreString* qstr, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n\n \/\/ Convert string to required character encoding or copy.\n std::unique_ptr<QoreString> str(qstr->convertEncoding(QEM.findCreate(\"ASCII\"), xsink));\n if (!str.get())\n return NULL;\n\n if (res.exec(str->getBuffer(), xsink))\n return NULL;\n\n if (res.hasResultData())\n return res.getOutputHash(xsink);\n\n return new QoreBigIntNode(res.rowsAffected());\n}\n\nvoid ODBCConnection::allocStatementHandle(SQLHSTMT& stmt, ExceptionSink* xsink) {\n SQLRETURN ret = SQLAllocHandle(SQL_HANDLE_STMT, dbConn, &stmt);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:STATEMENT-ALLOC-ERROR\", \"could not allocate a statement handle\", xsink);\n }\n}\n\nvoid ODBCConnection::handleDbcError(const char* err, const char* desc, ExceptionSink* xsink) {\n std::stringstream s(desc);\n ErrorHelper::extractDiag(SQL_HANDLE_DBC, dbConn, s);\n xsink->raiseException(err, s.str().c_str());\n}\n\nint ODBCConnection::prepareConnectionString(QoreString& str, ExceptionSink* xsink) {\n if (ds->getDBName())\n str.sprintf(\"DSN=%s;\", ds->getDBName());\n\n if (ds->getUsername())\n str.sprintf(\"UID=%s;\", ds->getUsername());\n\n if (ds->getPassword())\n str.sprintf(\"PWD=%s;\", ds->getPassword());\n\n ConstHashIterator hi(ds->getConnectOptions());\n while (hi.next()) {\n const AbstractQoreNode* val = hi.getValue();\n if (!val)\n continue;\n\n qore_type_t ntype = val->getType();\n switch (ntype) {\n case NT_STRING: {\n const QoreStringNode* strNode = reinterpret_cast<const QoreStringNode*>(val);\n TempEncodingHelper tstr(strNode, QEM.findCreate(\"ASCII\"), xsink);\n if (*xsink)\n return -1;\n str.sprintf(\"%s=%s;\", hi.getKey(), tstr->getBuffer());\n break;\n }\n case NT_INT:\n case NT_FLOAT:\n case NT_NUMBER: {\n QoreStringValueHelper vh(val);\n str.sprintf(\"%s=%s;\", hi.getKey(), vh->getBuffer());\n break;\n }\n case NT_BOOLEAN: {\n bool b = reinterpret_cast<const QoreBoolNode*>(val)->getValue();\n str.sprintf(\"%s=%s;\", hi.getKey(), b ? \"1\" : \"0\");\n break;\n }\n default: {\n xsink->raiseException(\"DBI:ODBC:OPTION-ERROR\", \"option values of type '%s' are not supported by the ODBC driver\", val->getTypeName());\n return -1;\n }\n } \/\/ switch\n } \/\/ while\n\n return 0;\n}\n\n\/\/ Version string is in the form \"xx.xx.xxxx\".\nint ODBCConnection::parseOdbcVersion(const char* str) {\n int major, minor, sub;\n major = minor = sub = 0;\n\n major += (str[0] - 48) * 10;\n major += str[1] - 48;\n\n minor += (str[3] - 48) * 10;\n minor += str[4] - 48;\n\n sub += (str[6] - 48) * 1000;\n sub += (str[7] - 48) * 100;\n sub += (str[8] - 48) * 10;\n sub += str[9] - 48;\n\n return major*1000000 + minor*10000 + sub;\n}\n\n<commit_msg>Added special handling of DRIVER option + connection timeout.<commit_after>\/* -*- indent-tabs-mode: nil -*- *\/\n\/*\n ODBCConnection.cpp\n\n Qore ODBC module\n\n Copyright (C) 2016 Ondrej Musil\n\n Permission is hereby granted, free of charge, to any person obtaining a\n copy of this software and associated documentation files (the \"Software\"),\n to deal in the Software without restriction, including without limitation\n the rights to use, copy, modify, merge, publish, distribute, sublicense,\n and\/or sell copies of the Software, and to permit persons to whom the\n Software is furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n DEALINGS IN THE SOFTWARE.\n*\/\n\n#include \"ODBCConnection.h\"\n\n#include <memory>\n\n#include \"qore\/QoreLib.h\"\n\n#include \"ErrorHelper.h\"\n#include \"ODBCStatement.h\"\n\n\nODBCConnection::ODBCConnection(Datasource* d, ExceptionSink* xsink) : ds(d), clientVer(0), serverVer(0) {\n SQLRETURN ret;\n \/\/ Allocate an environment handle.\n ret = SQLAllocHandle(SQL_HANDLE_ENV, SQL_NULL_HANDLE, &env);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n xsink->raiseException(\"DBI:ODBC:ENV-HANDLE-ERROR\", \"could not allocate an environment handle\");\n return;\n }\n\n \/\/ Use ODBC version 3.\n SQLSetEnvAttr(env, SQL_ATTR_ODBC_VERSION, (void*) SQL_OV_ODBC3, 0);\n\n \/\/ Allocate a connection handle.\n ret = SQLAllocHandle(SQL_HANDLE_DBC, env, &dbConn);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n xsink->raiseException(\"DBI:ODBC:CONNECTION-HANDLE-ERROR\", \"could not allocate a connection handle\");\n return;\n }\n\n \/\/ Set connection attributes.\n SQLSetConnectAttr(dbConn, SQL_ATTR_AUTOCOMMIT, SQL_AUTOCOMMIT_OFF, SQL_IS_UINTEGER);\n SQLSetConnectAttr(dbConn, SQL_ATTR_QUIET_MODE, NULL, SQL_IS_POINTER);\n SQLSetConnectAttr(dbConn, SQL_ATTR_LOGIN_TIMEOUT, (SQLPOINTER)60, SQL_IS_UINTEGER);\n\n \/\/ Create ODBC connection string.\n QoreString connStr(QEM.findCreate(\"ASCII\"));\n if(prepareConnectionString(connStr, xsink))\n return;\n SQLCHAR* odbcDS = reinterpret_cast<SQLCHAR*>(const_cast<char*>(connStr.getBuffer()));\n\n \/\/ Connect.\n ret = SQLDriverConnectA(dbConn, NULL, odbcDS, SQL_NTS, NULL, 0, NULL, SQL_DRIVER_NOPROMPT);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"could not connect to the driver\", \"DBI:ODBC:CONNECTION-ERROR\", xsink);\n return;\n }\n\n \/\/ Get DBMS (server) version.\n char verStr[128]; \/\/ Will contain ver in the form \"01.02.0034\"\n SQLSMALLINT unused;\n ret = SQLGetInfoA(dbConn, SQL_DBMS_VER, verStr, 128, &unused);\n if (SQL_SUCCEEDED(ret)) {\n serverVer = parseOdbcVersion(verStr);\n }\n\n \/\/ Get ODBC DB driver version.\n ret = SQLGetInfoA(dbConn, SQL_DRIVER_VER, verStr, 128, &unused);\n if (SQL_SUCCEEDED(ret)) {\n clientVer = parseOdbcVersion(verStr);\n }\n\n \/\/ timezones, encoding\n \/\/ ???\n\n ds->setDBEncoding(\"UTF-16\");\n}\n\nODBCConnection::~ODBCConnection() {\n while (true) {\n SQLRETURN ret = SQLDisconnect(dbConn);\n if (SQL_SUCCEEDED(ret))\n break;\n qore_usleep(50*1000); \/\/ Sleep in intervals of 50 ms until disconnected.\n }\n\n \/\/ Free up allocated handles.\n SQLFreeHandle(SQL_HANDLE_DBC, dbConn);\n SQLFreeHandle(SQL_HANDLE_ENV, env);\n}\n\nint ODBCConnection::commit(ExceptionSink* xsink) {\n SQLRETURN ret = SQLEndTran(SQL_HANDLE_DBC, dbConn, SQL_COMMIT);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:COMMIT-ERROR\", \"could not commit the transaction\", xsink);\n return -1;\n }\n return 0;\n}\n\nint ODBCConnection::rollback(ExceptionSink* xsink) {\n SQLRETURN ret = SQLEndTran(SQL_HANDLE_DBC, dbConn, SQL_ROLLBACK);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:ROLLBACK-ERROR\", \"could not rollback the transaction\", xsink);\n return -1;\n }\n return 0;\n}\n\nQoreListNode* ODBCConnection::selectRows(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n return res.getOutputList(xsink);\n}\n\nQoreHashNode* ODBCConnection::selectRow(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n return res.getSingleRow(xsink);\n}\n\nAbstractQoreNode* ODBCConnection::exec(const QoreString* qstr, const QoreListNode* args, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n if (res.exec(qstr, args, xsink))\n return NULL;\n\n if (res.hasResultData())\n return res.getOutputHash(xsink);\n\n return new QoreBigIntNode(res.rowsAffected());\n}\n\nAbstractQoreNode* ODBCConnection::execRaw(const QoreString* qstr, ExceptionSink* xsink) {\n ODBCStatement res(this, xsink);\n\n \/\/ Convert string to required character encoding or copy.\n std::unique_ptr<QoreString> str(qstr->convertEncoding(QEM.findCreate(\"ASCII\"), xsink));\n if (!str.get())\n return NULL;\n\n if (res.exec(str->getBuffer(), xsink))\n return NULL;\n\n if (res.hasResultData())\n return res.getOutputHash(xsink);\n\n return new QoreBigIntNode(res.rowsAffected());\n}\n\nvoid ODBCConnection::allocStatementHandle(SQLHSTMT& stmt, ExceptionSink* xsink) {\n SQLRETURN ret = SQLAllocHandle(SQL_HANDLE_STMT, dbConn, &stmt);\n if (!SQL_SUCCEEDED(ret)) { \/\/ error\n handleDbcError(\"DBI:ODBC:STATEMENT-ALLOC-ERROR\", \"could not allocate a statement handle\", xsink);\n }\n}\n\nvoid ODBCConnection::handleDbcError(const char* err, const char* desc, ExceptionSink* xsink) {\n std::stringstream s(desc);\n ErrorHelper::extractDiag(SQL_HANDLE_DBC, dbConn, s);\n xsink->raiseException(err, s.str().c_str());\n}\n\nint ODBCConnection::prepareConnectionString(QoreString& str, ExceptionSink* xsink) {\n if (ds->getDBName() && strlen(ds->getDBName()) > 0)\n str.sprintf(\"DSN=%s;\", ds->getDBName());\n\n if (ds->getUsername())\n str.sprintf(\"UID=%s;\", ds->getUsername());\n\n if (ds->getPassword())\n str.sprintf(\"PWD=%s;\", ds->getPassword());\n\n ConstHashIterator hi(ds->getConnectOptions());\n while (hi.next()) {\n const AbstractQoreNode* val = hi.getValue();\n if (!val)\n continue;\n\n qore_type_t ntype = val->getType();\n switch (ntype) {\n case NT_STRING: {\n const QoreStringNode* strNode = reinterpret_cast<const QoreStringNode*>(val);\n TempEncodingHelper tstr(strNode, QEM.findCreate(\"ASCII\"), xsink);\n if (*xsink)\n return -1;\n std::unique_ptr<QoreString> key(hi.getKeyString());\n key->tolwr();\n if (key->equal(\"driver\")) {\n str.sprintf(\"%s={%s};\", hi.getKey(), tstr->getBuffer());\n }\n else {\n str.sprintf(\"%s=%s;\", hi.getKey(), tstr->getBuffer());\n }\n break;\n }\n case NT_INT:\n case NT_FLOAT:\n case NT_NUMBER: {\n QoreStringValueHelper vh(val);\n str.sprintf(\"%s=%s;\", hi.getKey(), vh->getBuffer());\n break;\n }\n case NT_BOOLEAN: {\n bool b = reinterpret_cast<const QoreBoolNode*>(val)->getValue();\n str.sprintf(\"%s=%s;\", hi.getKey(), b ? \"1\" : \"0\");\n break;\n }\n default: {\n xsink->raiseException(\"DBI:ODBC:OPTION-ERROR\", \"option values of type '%s' are not supported by the ODBC driver\", val->getTypeName());\n return -1;\n }\n } \/\/ switch\n } \/\/ while\n\n return 0;\n}\n\n\/\/ Version string is in the form \"xx.xx.xxxx\".\nint ODBCConnection::parseOdbcVersion(const char* str) {\n int major, minor, sub;\n major = minor = sub = 0;\n\n major += (str[0] - 48) * 10;\n major += str[1] - 48;\n\n minor += (str[3] - 48) * 10;\n minor += str[4] - 48;\n\n sub += (str[6] - 48) * 1000;\n sub += (str[7] - 48) * 100;\n sub += (str[8] - 48) * 10;\n sub += str[9] - 48;\n\n return major*1000000 + minor*10000 + sub;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Radu Serban\n\/\/ =============================================================================\n\/\/\n\/\/ Wrapper classes for modeling an entire HMMWV vehicle assembly\n\/\/ (including the vehicle itself, the powertrain, and the tires).\n\/\/\n\/\/ =============================================================================\n\n#include \"chrono\/ChConfig.h\"\n\n#include \"chrono_vehicle\/ChVehicleModelData.h\"\n\n#include \"models\/vehicle\/hmmwv\/HMMWV.h\"\n\nnamespace chrono {\nnamespace vehicle {\nnamespace hmmwv {\n\n\/\/ -----------------------------------------------------------------------------\nHMMWV::HMMWV()\n : m_system(NULL),\n m_vehicle(NULL),\n m_powertrain(NULL),\n m_tires({NULL, NULL, NULL, NULL}),\n m_contactMethod(ChMaterialSurfaceBase::DVI),\n m_fixed(false),\n m_driveType(AWD),\n m_powertrainType(SHAFTS),\n m_tireType(RIGID),\n m_tire_step_size(-1),\n m_pacejkaParamFile(\"\"),\n m_chassisVis(PRIMITIVES),\n m_wheelVis(PRIMITIVES),\n m_initPos(ChCoordsys<>(ChVector<>(0, 0, 1), QUNIT)) {}\n\nHMMWV::HMMWV(ChSystem* system)\n : m_system(system),\n m_vehicle(NULL),\n m_powertrain(NULL),\n m_tires({NULL, NULL, NULL, NULL}),\n m_contactMethod(ChMaterialSurfaceBase::DVI),\n m_fixed(false),\n m_driveType(AWD),\n m_powertrainType(SHAFTS),\n m_tireType(RIGID),\n m_tire_step_size(-1),\n m_pacejkaParamFile(\"\"),\n m_chassisVis(PRIMITIVES),\n m_wheelVis(PRIMITIVES),\n m_initPos(ChCoordsys<>(ChVector<>(0, 0, 1), QUNIT)) {}\n\nHMMWV::~HMMWV() {\n delete m_vehicle;\n delete m_powertrain;\n delete m_tires[0];\n delete m_tires[1];\n delete m_tires[2];\n delete m_tires[3];\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Initialize() {\n \/\/ Create and initialize the HMMWV vehicle\n m_vehicle = CreateVehicle();\n m_vehicle->Initialize(m_initPos);\n\n \/\/ Create and initialize the powertrain system\n switch (m_powertrainType) {\n case SHAFTS: {\n HMMWV_Powertrain* ptrain = new HMMWV_Powertrain;\n m_powertrain = ptrain;\n break;\n }\n case SIMPLE: {\n HMMWV_SimplePowertrain* ptrain = new HMMWV_SimplePowertrain;\n m_powertrain = ptrain;\n break;\n }\n }\n\n m_powertrain->Initialize(m_vehicle->GetChassis(), m_vehicle->GetDriveshaft());\n\n#ifndef CHRONO_FEA\n \/\/ If ANCF tire selected but not available, fall back on rigid tire.\n if (m_tireType == ANCF)\n m_tireType = RIGID;\n#endif\n\n \/\/ Create the tires and set parameters depending on type.\n switch (m_tireType) {\n case RIGID: {\n HMMWV_RigidTire* tire_FL = new HMMWV_RigidTire(\"FL\");\n HMMWV_RigidTire* tire_FR = new HMMWV_RigidTire(\"FR\");\n HMMWV_RigidTire* tire_RL = new HMMWV_RigidTire(\"RL\");\n HMMWV_RigidTire* tire_RR = new HMMWV_RigidTire(\"RR\");\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case LUGRE: {\n HMMWV_LugreTire* tire_FL = new HMMWV_LugreTire(\"FL\");\n HMMWV_LugreTire* tire_FR = new HMMWV_LugreTire(\"FR\");\n HMMWV_LugreTire* tire_RL = new HMMWV_LugreTire(\"RL\");\n HMMWV_LugreTire* tire_RR = new HMMWV_LugreTire(\"RR\");\n\n if (m_wheelVis == NONE) {\n tire_FL->SetDiscVisualization(true);\n tire_FR->SetDiscVisualization(true);\n tire_RL->SetDiscVisualization(true);\n tire_RR->SetDiscVisualization(true);\n }\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case FIALA: {\n HMMWV_FialaTire* tire_FL = new HMMWV_FialaTire(\"FL\");\n HMMWV_FialaTire* tire_FR = new HMMWV_FialaTire(\"FR\");\n HMMWV_FialaTire* tire_RL = new HMMWV_FialaTire(\"RL\");\n HMMWV_FialaTire* tire_RR = new HMMWV_FialaTire(\"RR\");\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case PACEJKA: {\n if (m_pacejkaParamFile.empty())\n throw ChException(\"Pacejka parameter file not specified.\");\n\n std::string param_file = vehicle::GetDataFile(m_pacejkaParamFile);\n\n ChPacejkaTire* tire_FL = new ChPacejkaTire(\"FL\", param_file);\n ChPacejkaTire* tire_FR = new ChPacejkaTire(\"FR\", param_file);\n ChPacejkaTire* tire_RL = new ChPacejkaTire(\"RL\", param_file);\n ChPacejkaTire* tire_RR = new ChPacejkaTire(\"RR\", param_file);\n\n tire_FL->SetDrivenWheel(false);\n tire_FR->SetDrivenWheel(false);\n tire_RL->SetDrivenWheel(true);\n tire_RR->SetDrivenWheel(true);\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case ANCF: {\n#ifdef CHRONO_FEA\n HMMWV_ANCFTire* tire_FL = new HMMWV_ANCFTire(\"FL\");\n HMMWV_ANCFTire* tire_FR = new HMMWV_ANCFTire(\"FR\");\n HMMWV_ANCFTire* tire_RL = new HMMWV_ANCFTire(\"RL\");\n HMMWV_ANCFTire* tire_RR = new HMMWV_ANCFTire(\"RR\");\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n#endif\n break;\n }\n }\n\n \/\/ Initialize the tires.\n m_tires[0]->Initialize(m_vehicle->GetWheelBody(FRONT_LEFT), LEFT);\n m_tires[1]->Initialize(m_vehicle->GetWheelBody(FRONT_RIGHT), RIGHT);\n m_tires[2]->Initialize(m_vehicle->GetWheelBody(REAR_LEFT), LEFT);\n m_tires[3]->Initialize(m_vehicle->GetWheelBody(REAR_RIGHT), RIGHT);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Synchronize(double time,\n double steering_input,\n double braking_input,\n double throttle_input,\n const ChTerrain& terrain) {\n TireForces tire_forces(4);\n WheelState wheel_states[4];\n\n tire_forces[0] = m_tires[0]->GetTireForce();\n tire_forces[1] = m_tires[1]->GetTireForce();\n tire_forces[2] = m_tires[2]->GetTireForce();\n tire_forces[3] = m_tires[3]->GetTireForce();\n\n wheel_states[0] = m_vehicle->GetWheelState(FRONT_LEFT);\n wheel_states[1] = m_vehicle->GetWheelState(FRONT_RIGHT);\n wheel_states[2] = m_vehicle->GetWheelState(REAR_LEFT);\n wheel_states[3] = m_vehicle->GetWheelState(REAR_RIGHT);\n\n double powertrain_torque = m_powertrain->GetOutputTorque();\n\n double driveshaft_speed = m_vehicle->GetDriveshaftSpeed();\n\n m_tires[0]->Synchronize(time, wheel_states[0], terrain);\n m_tires[1]->Synchronize(time, wheel_states[1], terrain);\n m_tires[2]->Synchronize(time, wheel_states[2], terrain);\n m_tires[3]->Synchronize(time, wheel_states[3], terrain);\n\n m_powertrain->Synchronize(time, throttle_input, driveshaft_speed);\n\n m_vehicle->Synchronize(time, steering_input, braking_input, powertrain_torque, tire_forces);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Advance(double step) {\n m_tires[0]->Advance(step);\n m_tires[1]->Advance(step);\n m_tires[2]->Advance(step);\n m_tires[3]->Advance(step);\n\n m_powertrain->Advance(step);\n\n m_vehicle->Advance(step);\n}\n\n} \/\/ end namespace hmmwv\n} \/\/ end namespace vehicle\n} \/\/ end namespace chrono\n<commit_msg>Render mesh for the HMMWV ANCF tires only if wheel visibility is set to NONE<commit_after>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Radu Serban\n\/\/ =============================================================================\n\/\/\n\/\/ Wrapper classes for modeling an entire HMMWV vehicle assembly\n\/\/ (including the vehicle itself, the powertrain, and the tires).\n\/\/\n\/\/ =============================================================================\n\n#include \"chrono\/ChConfig.h\"\n\n#include \"chrono_vehicle\/ChVehicleModelData.h\"\n\n#include \"models\/vehicle\/hmmwv\/HMMWV.h\"\n\nnamespace chrono {\nnamespace vehicle {\nnamespace hmmwv {\n\n\/\/ -----------------------------------------------------------------------------\nHMMWV::HMMWV()\n : m_system(NULL),\n m_vehicle(NULL),\n m_powertrain(NULL),\n m_tires({NULL, NULL, NULL, NULL}),\n m_contactMethod(ChMaterialSurfaceBase::DVI),\n m_fixed(false),\n m_driveType(AWD),\n m_powertrainType(SHAFTS),\n m_tireType(RIGID),\n m_tire_step_size(-1),\n m_pacejkaParamFile(\"\"),\n m_chassisVis(PRIMITIVES),\n m_wheelVis(PRIMITIVES),\n m_initPos(ChCoordsys<>(ChVector<>(0, 0, 1), QUNIT)) {}\n\nHMMWV::HMMWV(ChSystem* system)\n : m_system(system),\n m_vehicle(NULL),\n m_powertrain(NULL),\n m_tires({NULL, NULL, NULL, NULL}),\n m_contactMethod(ChMaterialSurfaceBase::DVI),\n m_fixed(false),\n m_driveType(AWD),\n m_powertrainType(SHAFTS),\n m_tireType(RIGID),\n m_tire_step_size(-1),\n m_pacejkaParamFile(\"\"),\n m_chassisVis(PRIMITIVES),\n m_wheelVis(PRIMITIVES),\n m_initPos(ChCoordsys<>(ChVector<>(0, 0, 1), QUNIT)) {}\n\nHMMWV::~HMMWV() {\n delete m_vehicle;\n delete m_powertrain;\n delete m_tires[0];\n delete m_tires[1];\n delete m_tires[2];\n delete m_tires[3];\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Initialize() {\n \/\/ Create and initialize the HMMWV vehicle\n m_vehicle = CreateVehicle();\n m_vehicle->Initialize(m_initPos);\n\n \/\/ Create and initialize the powertrain system\n switch (m_powertrainType) {\n case SHAFTS: {\n HMMWV_Powertrain* ptrain = new HMMWV_Powertrain;\n m_powertrain = ptrain;\n break;\n }\n case SIMPLE: {\n HMMWV_SimplePowertrain* ptrain = new HMMWV_SimplePowertrain;\n m_powertrain = ptrain;\n break;\n }\n }\n\n m_powertrain->Initialize(m_vehicle->GetChassis(), m_vehicle->GetDriveshaft());\n\n#ifndef CHRONO_FEA\n \/\/ If ANCF tire selected but not available, fall back on rigid tire.\n if (m_tireType == ANCF)\n m_tireType = RIGID;\n#endif\n\n \/\/ Create the tires and set parameters depending on type.\n switch (m_tireType) {\n case RIGID: {\n HMMWV_RigidTire* tire_FL = new HMMWV_RigidTire(\"FL\");\n HMMWV_RigidTire* tire_FR = new HMMWV_RigidTire(\"FR\");\n HMMWV_RigidTire* tire_RL = new HMMWV_RigidTire(\"RL\");\n HMMWV_RigidTire* tire_RR = new HMMWV_RigidTire(\"RR\");\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case LUGRE: {\n HMMWV_LugreTire* tire_FL = new HMMWV_LugreTire(\"FL\");\n HMMWV_LugreTire* tire_FR = new HMMWV_LugreTire(\"FR\");\n HMMWV_LugreTire* tire_RL = new HMMWV_LugreTire(\"RL\");\n HMMWV_LugreTire* tire_RR = new HMMWV_LugreTire(\"RR\");\n\n if (m_wheelVis == NONE) {\n tire_FL->SetDiscVisualization(true);\n tire_FR->SetDiscVisualization(true);\n tire_RL->SetDiscVisualization(true);\n tire_RR->SetDiscVisualization(true);\n }\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case FIALA: {\n HMMWV_FialaTire* tire_FL = new HMMWV_FialaTire(\"FL\");\n HMMWV_FialaTire* tire_FR = new HMMWV_FialaTire(\"FR\");\n HMMWV_FialaTire* tire_RL = new HMMWV_FialaTire(\"RL\");\n HMMWV_FialaTire* tire_RR = new HMMWV_FialaTire(\"RR\");\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case PACEJKA: {\n if (m_pacejkaParamFile.empty())\n throw ChException(\"Pacejka parameter file not specified.\");\n\n std::string param_file = vehicle::GetDataFile(m_pacejkaParamFile);\n\n ChPacejkaTire* tire_FL = new ChPacejkaTire(\"FL\", param_file);\n ChPacejkaTire* tire_FR = new ChPacejkaTire(\"FR\", param_file);\n ChPacejkaTire* tire_RL = new ChPacejkaTire(\"RL\", param_file);\n ChPacejkaTire* tire_RR = new ChPacejkaTire(\"RR\", param_file);\n\n tire_FL->SetDrivenWheel(false);\n tire_FR->SetDrivenWheel(false);\n tire_RL->SetDrivenWheel(true);\n tire_RR->SetDrivenWheel(true);\n\n if (m_tire_step_size > 0) {\n tire_FL->SetStepsize(m_tire_step_size);\n tire_FR->SetStepsize(m_tire_step_size);\n tire_RL->SetStepsize(m_tire_step_size);\n tire_RR->SetStepsize(m_tire_step_size);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n\n break;\n }\n case ANCF: {\n#ifdef CHRONO_FEA\n HMMWV_ANCFTire* tire_FL = new HMMWV_ANCFTire(\"FL\");\n HMMWV_ANCFTire* tire_FR = new HMMWV_ANCFTire(\"FR\");\n HMMWV_ANCFTire* tire_RL = new HMMWV_ANCFTire(\"RL\");\n HMMWV_ANCFTire* tire_RR = new HMMWV_ANCFTire(\"RR\");\n\n if (m_wheelVis != NONE) {\n tire_FL->EnableVisualization(false);\n tire_FR->EnableVisualization(false);\n tire_RL->EnableVisualization(false);\n tire_RR->EnableVisualization(false);\n }\n\n m_tires[0] = tire_FL;\n m_tires[1] = tire_FR;\n m_tires[2] = tire_RL;\n m_tires[3] = tire_RR;\n#endif\n break;\n }\n }\n\n \/\/ Initialize the tires.\n m_tires[0]->Initialize(m_vehicle->GetWheelBody(FRONT_LEFT), LEFT);\n m_tires[1]->Initialize(m_vehicle->GetWheelBody(FRONT_RIGHT), RIGHT);\n m_tires[2]->Initialize(m_vehicle->GetWheelBody(REAR_LEFT), LEFT);\n m_tires[3]->Initialize(m_vehicle->GetWheelBody(REAR_RIGHT), RIGHT);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Synchronize(double time,\n double steering_input,\n double braking_input,\n double throttle_input,\n const ChTerrain& terrain) {\n TireForces tire_forces(4);\n WheelState wheel_states[4];\n\n tire_forces[0] = m_tires[0]->GetTireForce();\n tire_forces[1] = m_tires[1]->GetTireForce();\n tire_forces[2] = m_tires[2]->GetTireForce();\n tire_forces[3] = m_tires[3]->GetTireForce();\n\n wheel_states[0] = m_vehicle->GetWheelState(FRONT_LEFT);\n wheel_states[1] = m_vehicle->GetWheelState(FRONT_RIGHT);\n wheel_states[2] = m_vehicle->GetWheelState(REAR_LEFT);\n wheel_states[3] = m_vehicle->GetWheelState(REAR_RIGHT);\n\n double powertrain_torque = m_powertrain->GetOutputTorque();\n\n double driveshaft_speed = m_vehicle->GetDriveshaftSpeed();\n\n m_tires[0]->Synchronize(time, wheel_states[0], terrain);\n m_tires[1]->Synchronize(time, wheel_states[1], terrain);\n m_tires[2]->Synchronize(time, wheel_states[2], terrain);\n m_tires[3]->Synchronize(time, wheel_states[3], terrain);\n\n m_powertrain->Synchronize(time, throttle_input, driveshaft_speed);\n\n m_vehicle->Synchronize(time, steering_input, braking_input, powertrain_torque, tire_forces);\n}\n\n\/\/ -----------------------------------------------------------------------------\nvoid HMMWV::Advance(double step) {\n m_tires[0]->Advance(step);\n m_tires[1]->Advance(step);\n m_tires[2]->Advance(step);\n m_tires[3]->Advance(step);\n\n m_powertrain->Advance(step);\n\n m_vehicle->Advance(step);\n}\n\n} \/\/ end namespace hmmwv\n} \/\/ end namespace vehicle\n} \/\/ end namespace chrono\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: gnujre.cxx,v $\n *\n * $Revision: 1.10 $\n *\n * last change: $Author: hr $ $Date: 2006-08-11 16:19:44 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include \"osl\/file.hxx\"\n#include \"osl\/thread.h\"\n#include \"gnujre.hxx\"\n#include \"util.hxx\"\n\nusing namespace rtl;\nusing namespace std;\nusing namespace osl;\n\nnamespace jfw_plugin\n{\n\nReference<VendorBase> GnuInfo::createInstance()\n{\n return new GnuInfo;\n}\n\nchar const* const* GnuInfo::getJavaExePaths(int * size)\n{\n static char const * ar[] = {\n \"gij\",\n \"bin\/gij\",\n };\n *size = sizeof (ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* GnuInfo::getRuntimePaths(int * size)\n{\n static char const* ar[]= {\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\/libjvm.so\",\n \"\/gcj-4.1.1\/libjvm.so\",\n \"\/libgcj.so.7\",\n \"\/libgcj.so.6\"\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n}\n\nbool GnuInfo::initialize(vector<pair<OUString, OUString> > props)\n{\n \/\/get java.vendor, java.version, java.home,\n \/\/javax.accessibility.assistive_technologies from system properties\n\n OUString sVendor;\n typedef vector<pair<OUString, OUString> >::const_iterator it_prop;\n OUString sVendorProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"java.vendor\"));\n OUString sVersionProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"java.version\"));\n OUString sHomeProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"gnu.classpath.home.url\"));\n OUString sAccessProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"javax.accessibility.assistive_technologies\"));\n\n bool bVersion = false;\n bool bVendor = false;\n bool bHome = false;\n bool bAccess = false;\n\n typedef vector<pair<OUString, OUString> >::const_iterator it_prop;\n for (it_prop i = props.begin(); i != props.end(); i++)\n {\n if(! bVendor && sVendorProperty.equals(i->first))\n {\n m_sVendor = i->second;\n bVendor = true;\n }\n else if (!bVersion && sVersionProperty.equals(i->first))\n {\n m_sVersion = i->second;\n bVersion = true;\n }\n else if (!bHome && sHomeProperty.equals(i->first))\n {\n m_sHome = i->second;\n bHome = true;\n }\n else if (!bAccess && sAccessProperty.equals(i->first))\n {\n if (i->second.getLength() > 0)\n {\n m_bAccessibility = true;\n bAccess = true;\n }\n }\n \/\/ the javax.accessibility.xxx property may not be set. Therefore we\n \/\/must search through all properties.\n\n }\n if (!bVersion || !bVendor || !bHome)\n return false;\n\n \/\/ init m_sRuntimeLibrary\n OSL_ASSERT(m_sHome.getLength());\n \/\/call virtual function to get the possible paths to the runtime library.\n\n int size = 0;\n char const* const* arRtPaths = getRuntimePaths( & size);\n vector<OUString> libpaths = getVectorFromCharArray(arRtPaths, size);\n\n bool bRt = false;\n typedef vector<OUString>::const_iterator i_path;\n for(i_path ip = libpaths.begin(); ip != libpaths.end(); ip++)\n {\n \/\/Construct an absolute path to the possible runtime\n OUString usRt= m_sHome + *ip;\n DirectoryItem item;\n if(DirectoryItem::get(usRt, item) == File::E_None)\n {\n \/\/found runtime lib\n m_sRuntimeLibrary = usRt;\n bRt = true;\n break;\n }\n }\n\n if (!bRt)\n {\n m_sHome = rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"file:\/\/\/usr\/lib\"));\n for(i_path ip = libpaths.begin(); ip != libpaths.end(); ip++)\n {\n \/\/Construct an absolute path to the possible runtime\n OUString usRt= m_sHome + *ip;\n DirectoryItem item;\n if(DirectoryItem::get(usRt, item) == File::E_None)\n {\n \/\/found runtime lib\n m_sRuntimeLibrary = usRt;\n bRt = true;\n break;\n }\n }\n }\n if (!bRt)\n return false;\n\n \/\/ init m_sLD_LIBRARY_PATH\n OSL_ASSERT(m_sHome.getLength());\n size = 0;\n char const * const * arLDPaths = getLibraryPaths( & size);\n vector<OUString> ld_paths = getVectorFromCharArray(arLDPaths, size);\n\n char arSep[]= {SAL_PATHSEPARATOR, 0};\n OUString sPathSep= OUString::createFromAscii(arSep);\n bool bLdPath = true;\n int c = 0;\n for(i_path il = ld_paths.begin(); il != ld_paths.end(); il ++, c++)\n {\n OUString usAbsUrl= m_sHome + *il;\n \/\/ convert to system path\n OUString usSysPath;\n if(File::getSystemPathFromFileURL(usAbsUrl, usSysPath) == File::E_None)\n {\n\n if(c > 0)\n m_sLD_LIBRARY_PATH+= sPathSep;\n m_sLD_LIBRARY_PATH+= usSysPath;\n }\n else\n {\n bLdPath = false;\n break;\n }\n }\n if (bLdPath == false)\n return false;\n\n return true;\n}\n\nint GnuInfo::compareVersions(const rtl::OUString&) const\n{\n return 0;\n}\n\n}\n<commit_msg>INTEGRATION: CWS pchfix02 (1.10.4); FILE MERGED 2006\/09\/01 17:31:39 kaib 1.10.4.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: gnujre.cxx,v $\n *\n * $Revision: 1.11 $\n *\n * last change: $Author: obo $ $Date: 2006-09-16 17:45:28 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_jvmfwk.hxx\"\n\n#include \"osl\/file.hxx\"\n#include \"osl\/thread.h\"\n#include \"gnujre.hxx\"\n#include \"util.hxx\"\n\nusing namespace rtl;\nusing namespace std;\nusing namespace osl;\n\nnamespace jfw_plugin\n{\n\nReference<VendorBase> GnuInfo::createInstance()\n{\n return new GnuInfo;\n}\n\nchar const* const* GnuInfo::getJavaExePaths(int * size)\n{\n static char const * ar[] = {\n \"gij\",\n \"bin\/gij\",\n };\n *size = sizeof (ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* GnuInfo::getRuntimePaths(int * size)\n{\n static char const* ar[]= {\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\/libjvm.so\",\n \"\/gcj-4.1.1\/libjvm.so\",\n \"\/libgcj.so.7\",\n \"\/libgcj.so.6\"\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n}\n\nbool GnuInfo::initialize(vector<pair<OUString, OUString> > props)\n{\n \/\/get java.vendor, java.version, java.home,\n \/\/javax.accessibility.assistive_technologies from system properties\n\n OUString sVendor;\n typedef vector<pair<OUString, OUString> >::const_iterator it_prop;\n OUString sVendorProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"java.vendor\"));\n OUString sVersionProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"java.version\"));\n OUString sHomeProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"gnu.classpath.home.url\"));\n OUString sAccessProperty(\n RTL_CONSTASCII_USTRINGPARAM(\"javax.accessibility.assistive_technologies\"));\n\n bool bVersion = false;\n bool bVendor = false;\n bool bHome = false;\n bool bAccess = false;\n\n typedef vector<pair<OUString, OUString> >::const_iterator it_prop;\n for (it_prop i = props.begin(); i != props.end(); i++)\n {\n if(! bVendor && sVendorProperty.equals(i->first))\n {\n m_sVendor = i->second;\n bVendor = true;\n }\n else if (!bVersion && sVersionProperty.equals(i->first))\n {\n m_sVersion = i->second;\n bVersion = true;\n }\n else if (!bHome && sHomeProperty.equals(i->first))\n {\n m_sHome = i->second;\n bHome = true;\n }\n else if (!bAccess && sAccessProperty.equals(i->first))\n {\n if (i->second.getLength() > 0)\n {\n m_bAccessibility = true;\n bAccess = true;\n }\n }\n \/\/ the javax.accessibility.xxx property may not be set. Therefore we\n \/\/must search through all properties.\n\n }\n if (!bVersion || !bVendor || !bHome)\n return false;\n\n \/\/ init m_sRuntimeLibrary\n OSL_ASSERT(m_sHome.getLength());\n \/\/call virtual function to get the possible paths to the runtime library.\n\n int size = 0;\n char const* const* arRtPaths = getRuntimePaths( & size);\n vector<OUString> libpaths = getVectorFromCharArray(arRtPaths, size);\n\n bool bRt = false;\n typedef vector<OUString>::const_iterator i_path;\n for(i_path ip = libpaths.begin(); ip != libpaths.end(); ip++)\n {\n \/\/Construct an absolute path to the possible runtime\n OUString usRt= m_sHome + *ip;\n DirectoryItem item;\n if(DirectoryItem::get(usRt, item) == File::E_None)\n {\n \/\/found runtime lib\n m_sRuntimeLibrary = usRt;\n bRt = true;\n break;\n }\n }\n\n if (!bRt)\n {\n m_sHome = rtl::OUString(RTL_CONSTASCII_USTRINGPARAM(\"file:\/\/\/usr\/lib\"));\n for(i_path ip = libpaths.begin(); ip != libpaths.end(); ip++)\n {\n \/\/Construct an absolute path to the possible runtime\n OUString usRt= m_sHome + *ip;\n DirectoryItem item;\n if(DirectoryItem::get(usRt, item) == File::E_None)\n {\n \/\/found runtime lib\n m_sRuntimeLibrary = usRt;\n bRt = true;\n break;\n }\n }\n }\n if (!bRt)\n return false;\n\n \/\/ init m_sLD_LIBRARY_PATH\n OSL_ASSERT(m_sHome.getLength());\n size = 0;\n char const * const * arLDPaths = getLibraryPaths( & size);\n vector<OUString> ld_paths = getVectorFromCharArray(arLDPaths, size);\n\n char arSep[]= {SAL_PATHSEPARATOR, 0};\n OUString sPathSep= OUString::createFromAscii(arSep);\n bool bLdPath = true;\n int c = 0;\n for(i_path il = ld_paths.begin(); il != ld_paths.end(); il ++, c++)\n {\n OUString usAbsUrl= m_sHome + *il;\n \/\/ convert to system path\n OUString usSysPath;\n if(File::getSystemPathFromFileURL(usAbsUrl, usSysPath) == File::E_None)\n {\n\n if(c > 0)\n m_sLD_LIBRARY_PATH+= sPathSep;\n m_sLD_LIBRARY_PATH+= usSysPath;\n }\n else\n {\n bLdPath = false;\n break;\n }\n }\n if (bLdPath == false)\n return false;\n\n return true;\n}\n\nint GnuInfo::compareVersions(const rtl::OUString&) const\n{\n return 0;\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/Gravitational microlensing data\n\/\/\n\/\/Written by John G Baker NASA-GSFC (2014-15)\n#ifndef MLDATA_HH\n#define MLDATA_HH\n#include \"glens.hh\"\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <valarray>\n#include \"bayesian.hh\"\n#include <cerrno>\n#include <cstring>\n\nusing namespace std;\n\n\/\/\/base class for photometry data\nclass ML_photometry_data : public bayes_data{\nprotected:\n vector<double>×,&mags,&dmags;\n double time0;\n int idx_Mn;\n bool have_time0;\npublic:\n \/\/\/We relabel the generic bayes_data names as times\/mags\/etc...\n ML_photometry_data():bayes_data(),times(labels),mags(values),dmags(dvalues),time0(label0){\n idx_Mn=-1;\n have_time0=false;\n };\n \/\/int size()const{return times.size();};\n \/*\n virtual void getDomainLimits(double &start, double &end)const{\n checkData();\n if(times.size()==0){\n cout<<\"MLdata::getTimeLimits: Cannot get limit on empty object.\"<<endl;\n exit(1);\n }\n start=times.front();\n end=times.back();\n };*\/\n \/\/double getPeakTime(bool original=false)const{\n virtual double getFocusLabel(bool original=false)const{\n assertData(LABELS|VALUES|DVALUES);\n if(original||times.size()<1)return time0; \n \/\/we assume monotonic time and magnitude data.\n double mpk=-INFINITY;\n int ipk=0;\n for( int i=0;i<times.size();i++){\n double m=-mags[i];\/\/minus because peak negative magnitude\n if(mpk<m){\n\tmpk=m;\n\tipk=i;\n }\n }\n return times[ipk];\n };\n \/\/\/Crop out some early data.\n \/\/\/\n \/\/\/Permanently remove early portion of data\n virtual void cropBefore(double tstart){\n assertData(LABELS|VALUES|DVALUES);\n while (times.size()>0&×[0]<tstart){\n times.erase(times.begin());\n mags.erase(mags.begin());\n dmags.erase(dmags.begin());\n }\n };\n virtual vector<double> getVariances(const state &st)const{\n checkWorkingStateSpace();\/\/Call this assert whenever we need the parameter index mapping.\n assertData(LABELS|VALUES|DVALUES);\n checkSetup();\/\/Call this assert whenever we need options to have been processed.\n double extra_noise_mag=st.get_param(idx_Mn);\n static const double logfactor=2.0*log10(2.5\/log(10));\n vector<double>var(size());\n for(int i=0;i<size();i++){\n var[i] = dmags[i]*dmags[i] + pow(10.0,logfactor+0.8*(-extra_noise_mag+mags[i]));\n }\n return var;\n };\n \/\/\/from stateSpaceInterface\n virtual void defWorkingStateSpace(const stateSpace &sp){\n checkSetup();\/\/Call this assert whenever we need options to have been processed.\n idx_Mn=sp.requireIndex(\"Mn\");\n haveWorkingStateSpace();\n };\n\n \/\/\/Optioned interface\n void addOptions(Options &opt,const string &prefix=\"\"){\n Optioned::addOptions(opt,prefix);\n addTypeOptions(opt);\n addOption(\"tcut\",\"Cut times before tcut (relative to tmax). Default=-1e20\",\"-1e20\");\n opt.add(Option(\"Fn_max\",\"Uniform prior max (min for additive) in Fn. Default=1.0 (18.0 additive)\/\",\"1\"));\n };\n \/\/\/Here provide options for the known types of ML_photometry_data...\n \/\/\/This is provided statically to allow options to select one or more types of data before specifying the \n \/\/\/specific data sub-class in the main calling routine. However, because the Optioned interface cannot\n \/\/\/be accessed statically, we create temporary instance and let it do the work. There should be no need\n \/\/\/to preserve this temporary instance for later reference.\n void static addStaticOptions(Options &opt){\n ML_photometry_data d;\n d.addTypeOptions(opt);\n };\n \/\/\/If there is an externally defined reference time then use this function to specify it before calling setup()\n virtual void set_reference_time(double t0){\n if(have_time0){\n cout<<\"ML_photometry_data::set_reference_time: Cannot reset reference time.\"<<endl;\n exit(1);\n }\n time0=t0;\n have_time0=true;\n };\n virtual void setup(){\n \/\/\/Set up the output stateSpace for this object\n stateSpace space(1);\n string names[]={\"Mn\"};\n double Fn_max;\n *optValue(\"Fn_max\")>>Fn_max;\n \/\/set stateSpace\n space.set_names(names); \n nativeSpace=space;\n \/\/set prior\n const double MaxAdditiveNoiseMag=22;\n const int uni=mixed_dist_product::uniform;\n valarray<double> centers(1),halfwidths(1);\n valarray<int> types(1);\n if(Fn_max<=1)Fn_max=18.0;\n double hw=(MaxAdditiveNoiseMag-Fn_max)\/2.0;\n centers[0]=MaxAdditiveNoiseMag-hw;\n halfwidths[0]=hw;\n types[0]=uni;\n setPrior(new mixed_dist_product(&nativeSpace,types,centers,halfwidths));\n };\n\nprivate:\n void addTypeOptions(Options &opt){\n Optioned::addOptions(opt,\"\");\n addOption(\"OGLE_data\",\"Filepath to OGLE data.\");\n addOption(\"gen_data\",\"Filepath to generic photometry data.\");\n addOption(\"mock_data\",\"Construct mock data.\");\n }; \nprotected:\n \/\/\/Initial data processing common to ML_photometry_data\n void processData(){\n if(!have_time0){\n time0=getFocusLabel();\n have_time0=true;\n }\n for(double &t : times)t-=time0;\/\/permanently offset times from their to put the peak at 0.\n double tcut;\n *optValue(\"tcut\")>>tcut;\n cropBefore(tcut);\n haveSetup();\n };\n};\n\n\/\/\/class for mock data\n\/\/\/It does little other than define a grid of points, and allow them to be populated...\n\/\/\/There is also a hook to fill the data, which mllike knows how to do. In this case\n\/\/\/The \"extra noise\" parameter becomes the actual noise parameter.\nclass ML_mock_data : public ML_photometry_data {\npublic:\n ML_mock_data(){allow_fill=true;};\n \/\/\/The time samples are generated from a regular grid, or randomly...\n \/\/\/...not yet complete...\n \/\/\/Note that cadence is the most probable size of timestep, with fractional variance scale set by log_dtvar\n void setup(){\n double tstart,tend,cadence,jitter;\n *optValue(\"mock_tstart\")>>tstart;\n *optValue(\"mock_tend\")>>tend;\n *optValue(\"mock_cadence\")>>cadence;\n *optValue(\"mock_jitter\")>>jitter;\n cout<<\"Preparing mock data.\"<<endl;\n setup(tstart,tend,cadence,jitter);\n ML_photometry_data::setup();\n };\n void setup(double tmin, double tmax, double cadence, double log_dt_var=0){\n GaussianDist gauss(0.0,log_dt_var);\n double dt=cadence*exp(gauss.draw());\n double time=tmin+dt\/2.0;\n while(time<tmax){\n times.push_back(time);\n dt=cadence*exp(gauss.draw());\n time+=dt;\n mags.push_back(0);\n dmags.push_back(0);\n }\n haveData();\n if(!have_time0)set_reference_time(0);\n processData();\n };\n \/\/\/Optioned interface\n void addOptions(Options &opt,const string &prefix=\"\"){\n ML_photometry_data::addOptions(opt,prefix);\n addOption(\"mock_tstart\",\"Start time for mock data sample grid (days). Default=-600\",\"-600\");\n addOption(\"mock_tend\",\"End time for mock data sample grid (days). Default=150\",\"150\");\n addOption(\"mock_cadence\",\"Typical sample period for mock data sample grid(days). Default=1\",\"1\");\n addOption(\"mock_jitter\",\"Size of standard deviation in log(time-step-size). Default=0\",\"0\");\n };\n};\n\n\n\/\/class for OGLEII-IV DIA data\nclass ML_OGLEdata : public ML_photometry_data {\n \/\/OGLE-IV:Photometry data file containing 5 columns: Hel.JD, I magnitude, magnitude error, seeing estimation (in pixels - 0.26\"\/pixel) and sky level.\npublic:\n ML_OGLEdata(){};\n void setup(){\n string filename;\n *optValue(\"OGLE_data\")>>filename;\n cout<<\"OGLE data file='\"<<filename<<\"'\"<<endl;\n setup(filename);\n ML_photometry_data::setup();\n };\n void setup(const string &filepath){\n ifstream file(filepath.c_str());\n if(file.good()){\n string line;\n while(getline(file,line)){\n\tif(line[0]=='#')continue;\/\/skip comment lines\n\tdouble t,m,dm;\n\tstringstream(line)>>t>>m>>dm;\n\ttimes.push_back(t);\n\tmags.push_back(m);\n\tdmags.push_back(dm);\n }\n } else {\n if(filepath.size()>0){\/\/empty path signifies go forward without data\n\tcerr << \"Error: \" << strerror(errno)<<endl;\n\tcout<<\"ML_OGLEData::ML_OGLEData: Could not open file '\"<<filepath<<\"'.\"<<endl;\n\texit(1);\n }\n }\n haveData();\n processData();\n return;\n };\n\n};\n\n\/\/class for generic two column time\/mag data\nclass ML_generic_data : public ML_photometry_data {\npublic:\n ML_generic_data(){};\n void setup(){\n string filename;\n *optValue(\"gen_data\")>>filename;\n cout<<\"generic data file='\"<<filename<<\"'\"<<endl;\n setup(filename);\n ML_photometry_data::setup();\n };\n void setup(const string &filepath){\n \/\/assemble soruce column info\n double errlev;\n *optValue(\"gen_data_err_lev\")>>errlev;\n int tcol,col,ecol,maxcol=0;\n *optValue(\"gen_data_time_col\")>>tcol;\n if(tcol>maxcol)maxcol=tcol;\n *optValue(\"gen_data_col\")>>col;\n if(col>maxcol)maxcol=col;\n if(errlev<=0){\n *optValue(\"gen_data_err_col\")>>ecol;\n if(ecol<0)ecol=col+1;\n if(ecol>maxcol)maxcol=ecol;\n }\n cout<<\"gen_data: reading data as:\\ntcol,col=\"<<tcol<<\",\"<<col<<\" err=\"<<((errlev>0)?ecol:errlev)<<endl;\n ifstream file(filepath.c_str());\n if(file.good()){\n string line;\n while(getline(file,line)){\n\t\/\/cout<<\"reading line:\\n\"<<line<<endl;\n\tif(line[0]=='#'||line.length()==0)continue;\/\/skip comment lines\n\tstringstream ss(line);\n\tfor(int i=0;i<=maxcol;i++){\n\t \/\/cout \"i=\"<<i<<endl;\n\t double val;\n\t ss>>val;\n\t if(i==tcol)times.push_back(val);\n\t if(i==col)mags.push_back(val);\n\t if(errlev<=0&&i==ecol)dmags.push_back(val);\n\t}\n\tif(errlev>0)dmags.push_back(errlev);\n\tint i=times.size()-1;\n\t\/\/cout<<times[i]<<\" \"<<mags[i]<<\" \"<<dmags[i]<<endl;\n }\n } else {\n if(filepath.size()>0){\/\/empty path signifies go forward without data\n\tcout<<\"ML_generic_data: Could not open file '\"<<filepath<<\"'.\"<<endl;\n\texit(1);\n }\n }\n haveData();\n processData();\n return;\n };\n void addOptions(Options &opt,const string &prefix=\"\"){\n ML_photometry_data::addOptions(opt,prefix);\n addOption(\"gen_data_time_col\",\"Column with data values. Default=0\",\"0\");\n addOption(\"gen_data_col\",\"Column with data values. Default=0\",\"1\");\n addOption(\"gen_data_err_col\",\"Column with data values. Default=(next after data)\",\"-1\");\n addOption(\"gen_data_err_lev\",\"Set a uniform error, instead of reading from file. Default=none\",\"-1\");\n };\n};\n\n\n\n#endif\n<commit_msg>Some more support for bayes_component_selector (though not yet implemented). Added output of information about time offset, when applied.<commit_after>\/\/Gravitational microlensing data\n\/\/\n\/\/Written by John G Baker NASA-GSFC (2014-15)\n#ifndef MLDATA_HH\n#define MLDATA_HH\n#include \"glens.hh\"\n#include <string>\n#include <fstream>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <valarray>\n#include \"bayesian.hh\"\n#include <cerrno>\n#include <cstring>\n\nusing namespace std;\n\n\/\/\/base class for photometry data\nclass ML_photometry_data : public bayes_data{\nprotected:\n vector<double>×,&mags,&dmags;\n double time0;\n int idx_Mn;\n bool have_time0;\npublic:\n \/\/\/We relabel the generic bayes_data names as times\/mags\/etc...\n ML_photometry_data():bayes_data(),times(labels),mags(values),dmags(dvalues),time0(label0){\n have_time0=false;\n };\n \/\/int size()const{return times.size();};\n \/*\n virtual void getDomainLimits(double &start, double &end)const{\n checkData();\n if(times.size()==0){\n cout<<\"MLdata::getTimeLimits: Cannot get limit on empty object.\"<<endl;\n exit(1);\n }\n start=times.front();\n end=times.back();\n };*\/\n \/\/double getPeakTime(bool original=false)const{\n virtual double getFocusLabel(bool original=false)const{\n assertData(LABELS|VALUES|DVALUES);\n if(original||times.size()<1)return time0; \n \/\/we assume monotonic time and magnitude data.\n double mpk=-INFINITY;\n int ipk=0;\n for( int i=0;i<times.size();i++){\n double m=-mags[i];\/\/minus because peak negative magnitude\n if(mpk<m){\n\tmpk=m;\n\tipk=i;\n }\n }\n return times[ipk];\n };\n \/\/\/Crop out some early data.\n \/\/\/\n \/\/\/Permanently remove early portion of data\n virtual void cropBefore(double tstart){\n assertData(LABELS|VALUES|DVALUES);\n while (times.size()>0&×[0]<tstart){\n times.erase(times.begin());\n mags.erase(mags.begin());\n dmags.erase(dmags.begin());\n }\n };\n virtual vector<double> getVariances(const state &st)const{\n checkWorkingStateSpace();\/\/Call this assert whenever we need the parameter index mapping.\n assertData(LABELS|VALUES|DVALUES);\n checkSetup();\/\/Call this assert whenever we need options to have been processed.\n double extra_noise_mag=st.get_param(idx_Mn);\n static const double logfactor=2.0*log10(2.5\/log(10));\n vector<double>var(size());\n for(int i=0;i<size();i++){\n var[i] = dmags[i]*dmags[i] + pow(10.0,logfactor+0.8*(-extra_noise_mag+mags[i]));\n }\n return var;\n };\n \/\/\/from stateSpaceInterface\n virtual void defWorkingStateSpace(const stateSpace &sp){\n checkSetup();\/\/Call this assert whenever we need options to have been processed.\n idx_Mn=sp.requireIndex(\"Mn\");\n haveWorkingStateSpace();\n };\n\n \/\/\/Optioned interface\n void addOptions(Options &opt,const string &prefix=\"\"){\n Optioned::addOptions(opt,prefix);\n addTypeOptions(opt);\n addOption(\"tcut\",\"Cut times before tcut (relative to tmax). Default=-1e20\",\"-1e20\");\n opt.add(Option(\"Fn_max\",\"Uniform prior max (min for additive) in Fn. Default=1.0 (18.0 additive)\/\",\"1\"));\n };\n \/\/\/Here provide options for the known types of ML_photometry_data...\n \/\/\/This is provided statically to allow options to select one or more types of data before specifying the \n \/\/\/specific data sub-class in the main calling routine. However, because the Optioned interface cannot\n \/\/\/be accessed statically, we create temporary instance and let it do the work. There should be no need\n \/\/\/to preserve this temporary instance for later reference.\n void static addStaticOptions(Options &opt){\n ML_photometry_data d;\n d.addTypeOptions(opt);\n };\n \/\/\/If there is an externally defined reference time then use this function to specify it before calling setup()\n virtual void set_reference_time(double t0){\n if(have_time0){\n cout<<\"ML_photometry_data::set_reference_time: Cannot reset reference time.\"<<endl;\n exit(1);\n }\n time0=t0;\n have_time0=true;\n };\n virtual void setup(){\n \/\/\/Set up the output stateSpace for this object\n stateSpace space(1);\n string names[]={\"Mn\"};\n double Fn_max;\n *optValue(\"Fn_max\")>>Fn_max;\n \/\/set stateSpace\n space.set_names(names); \n nativeSpace=space;\n \/\/set prior\n const double MaxAdditiveNoiseMag=22;\n const int uni=mixed_dist_product::uniform;\n valarray<double> centers(1),halfwidths(1);\n valarray<int> types(1);\n if(Fn_max<=1)Fn_max=18.0;\n double hw=(MaxAdditiveNoiseMag-Fn_max)\/2.0;\n centers[0]=MaxAdditiveNoiseMag-hw;\n halfwidths[0]=hw;\n types[0]=uni;\n setPrior(new mixed_dist_product(&nativeSpace,types,centers,halfwidths));\n };\n\nprivate:\n void addTypeOptions(Options &opt){\n Optioned::addOptions(opt,\"\");\n addOption(\"OGLE_data\",\"Filepath to OGLE data.\");\n addOption(\"gen_data\",\"Filepath to generic photometry data.\");\n addOption(\"mock_data\",\"Construct mock data.\");\n }; \nprotected:\n \/\/\/Initial data processing common to ML_photometry_data\n void processData(){\n if(!have_time0){\n time0=getFocusLabel();\n have_time0=true;\n }\n cout<<\"ML_photometry data offset by \"<<setprecision(15)<<time0<<\" -> 0\"<<endl;\n for(double &t : times)t-=time0;\/\/permanently offset times from their to put the peak at 0.\n double tcut;\n *optValue(\"tcut\")>>tcut;\n cropBefore(tcut);\n haveSetup();\n };\n};\n\n\/\/\/class for mock data\n\/\/\/It does little other than define a grid of points, and allow them to be populated...\n\/\/\/There is also a hook to fill the data, which mllike knows how to do. In this case\n\/\/\/The \"extra noise\" parameter becomes the actual noise parameter.\nclass ML_mock_data : public ML_photometry_data {\npublic:\n ML_mock_data(){\n typestring=\"MLphotometryData\";option_name=\"MLPMockData\";option_info=\"Mock microlensing photometry data.\";\n allow_fill=true;};\n \/\/\/The time samples are generated from a regular grid, or randomly...\n \/\/\/...not yet complete...\n \/\/\/Note that cadence is the most probable size of timestep, with fractional variance scale set by log_dtvar\n void setup(){\n double tstart,tend,cadence,jitter;\n *optValue(\"mock_tstart\")>>tstart;\n *optValue(\"mock_tend\")>>tend;\n *optValue(\"mock_cadence\")>>cadence;\n *optValue(\"mock_jitter\")>>jitter;\n cout<<\"Preparing mock data.\"<<endl;\n setup(tstart,tend,cadence,jitter);\n ML_photometry_data::setup();\n };\n void setup(double tmin, double tmax, double cadence, double log_dt_var=0){\n GaussianDist gauss(0.0,log_dt_var);\n double dt=cadence*exp(gauss.draw());\n double time=tmin+dt\/2.0;\n while(time<tmax){\n times.push_back(time);\n dt=cadence*exp(gauss.draw());\n time+=dt;\n mags.push_back(0);\n dmags.push_back(0);\n }\n haveData();\n if(!have_time0)set_reference_time(0);\n processData();\n };\n \/\/\/Optioned interface\n void addOptions(Options &opt,const string &prefix=\"\"){\n ML_photometry_data::addOptions(opt,prefix);\n addOption(\"mock_tstart\",\"Start time for mock data sample grid (days). Default=-600\",\"-600\");\n addOption(\"mock_tend\",\"End time for mock data sample grid (days). Default=150\",\"150\");\n addOption(\"mock_cadence\",\"Typical sample period for mock data sample grid(days). Default=1\",\"1\");\n addOption(\"mock_jitter\",\"Size of standard deviation in log(time-step-size). Default=0\",\"0\");\n };\n};\n\n\n\/\/class for OGLEII-IV DIA data\nclass ML_OGLEdata : public ML_photometry_data {\n \/\/OGLE-IV:Photometry data file containing 5 columns: Hel.JD, I magnitude, magnitude error, seeing estimation (in pixels - 0.26\"\/pixel) and sky level.\npublic:\n ML_OGLEdata(){\n typestring=\"MLphotometryData\";option_name=\"MLPOGLEData\";option_info=\"OGLE microlensing photometry data.\";\n};\n void setup(){\n string filename;\n *optValue(\"OGLE_data\")>>filename;\n cout<<\"OGLE data file='\"<<filename<<\"'\"<<endl;\n setup(filename);\n ML_photometry_data::setup();\n };\n void setup(const string &filepath){\n ifstream file(filepath.c_str());\n if(file.good()){\n string line;\n while(getline(file,line)){\n\tif(line[0]=='#')continue;\/\/skip comment lines\n\tdouble t,m,dm;\n\tstringstream(line)>>t>>m>>dm;\n\ttimes.push_back(t);\n\tmags.push_back(m);\n\tdmags.push_back(dm);\n }\n } else {\n if(filepath.size()>0){\/\/empty path signifies go forward without data\n\tcerr << \"Error: \" << strerror(errno)<<endl;\n\tcout<<\"ML_OGLEData::ML_OGLEData: Could not open file '\"<<filepath<<\"'.\"<<endl;\n\texit(1);\n }\n }\n haveData();\n processData();\n return;\n };\n\n};\n\n\/\/class for generic two column time\/mag data\nclass ML_generic_data : public ML_photometry_data {\npublic:\n ML_generic_data(){\n typestring=\"MLphotometryData\";option_name=\"MLPGenData\";option_info=\"Generic microlensing photometry data.\";\n };\n void setup(){\n string filename;\n *optValue(\"gen_data\")>>filename;\n cout<<\"generic data file='\"<<filename<<\"'\"<<endl;\n setup(filename);\n ML_photometry_data::setup();\n };\n void setup(const string &filepath){\n \/\/assemble soruce column info\n double errlev;\n *optValue(\"gen_data_err_lev\")>>errlev;\n int tcol,col,ecol,maxcol=0;\n *optValue(\"gen_data_time_col\")>>tcol;\n if(tcol>maxcol)maxcol=tcol;\n *optValue(\"gen_data_col\")>>col;\n if(col>maxcol)maxcol=col;\n if(errlev<=0){\n *optValue(\"gen_data_err_col\")>>ecol;\n if(ecol<0)ecol=col+1;\n if(ecol>maxcol)maxcol=ecol;\n }\n cout<<\"gen_data: reading data as:\\ntcol,col=\"<<tcol<<\",\"<<col<<\" err=\"<<((errlev>0)?ecol:errlev)<<endl;\n ifstream file(filepath.c_str());\n if(file.good()){\n string line;\n while(getline(file,line)){\n\t\/\/cout<<\"reading line:\\n\"<<line<<endl;\n\tif(line[0]=='#'||line.length()==0)continue;\/\/skip comment lines\n\tstringstream ss(line);\n\tfor(int i=0;i<=maxcol;i++){\n\t \/\/cout \"i=\"<<i<<endl;\n\t double val;\n\t ss>>val;\n\t if(i==tcol)times.push_back(val);\n\t if(i==col)mags.push_back(val);\n\t if(errlev<=0&&i==ecol)dmags.push_back(val);\n\t}\n\tif(errlev>0)dmags.push_back(errlev);\n\tint i=times.size()-1;\n\t\/\/cout<<times[i]<<\" \"<<mags[i]<<\" \"<<dmags[i]<<endl;\n }\n } else {\n if(filepath.size()>0){\/\/empty path signifies go forward without data\n\tcout<<\"ML_generic_data: Could not open file '\"<<filepath<<\"'.\"<<endl;\n\texit(1);\n }\n }\n haveData();\n processData();\n return;\n };\n void addOptions(Options &opt,const string &prefix=\"\"){\n ML_photometry_data::addOptions(opt,prefix);\n addOption(\"gen_data_time_col\",\"Column with data values. Default=0\",\"0\");\n addOption(\"gen_data_col\",\"Column with data values. Default=1\",\"1\");\n addOption(\"gen_data_err_col\",\"Column with data values. Default=(next after data)\",\"-1\");\n addOption(\"gen_data_err_lev\",\"Set a uniform error, instead of reading from file. Default=none\",\"-1\");\n };\n};\n\n\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/extensions\/test\/xwalk_extensions_test_base.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"base\/synchronization\/spin_wait.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/test_utils.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/runtime\/browser\/runtime.h\"\n#include \"xwalk\/test\/base\/in_process_browser_test.h\"\n#include \"xwalk\/test\/base\/xwalk_test_utils.h\"\n\nusing xwalk::extensions::XWalkExtension;\nusing xwalk::extensions::XWalkExtensionInstance;\nusing xwalk::extensions::XWalkExtensionService;\n\nnamespace {\n\nint g_contexts_created = 0;\n\nbase::Lock g_contexts_destroyed_lock;\nint g_contexts_destroyed = 0;\n\n}\n\nclass OnceExtensionInstance : public XWalkExtensionInstance {\n public:\n OnceExtensionInstance(int sequence,\n const XWalkExtension::PostMessageCallback& post_message)\n : sequence_(sequence),\n answered_(false) {\n SetPostMessageCallback(post_message);\n }\n\n ~OnceExtensionInstance() {\n base::AutoLock lock(g_contexts_destroyed_lock);\n g_contexts_destroyed++;\n }\n\n virtual void HandleMessage(scoped_ptr<base::Value> msg) OVERRIDE {\n std::string answer;\n if (answered_) {\n answer = \"FAIL\";\n } else {\n answer = base::StringPrintf(\"PASS %d\", sequence_);\n answered_ = true;\n }\n PostMessageToJS(scoped_ptr<base::Value>(\n base::Value::CreateStringValue(answer)));\n }\n\n private:\n int sequence_;\n bool answered_;\n};\n\nclass OnceExtension : public XWalkExtension {\n public:\n OnceExtension()\n : XWalkExtension() {\n set_name(\"once\");\n }\n\n virtual const char* GetJavaScriptAPI() {\n static const char* kAPI =\n \"exports.read = function(callback) {\"\n \" extension.setMessageListener(callback);\"\n \" extension.postMessage('PING');\"\n \"};\";\n return kAPI;\n }\n\n virtual XWalkExtensionInstance* CreateInstance(\n const XWalkExtension::PostMessageCallback& post_message) {\n return new OnceExtensionInstance(++g_contexts_created, post_message);\n }\n};\n\nclass XWalkExtensionsContextDestructionTest : public XWalkExtensionsTestBase {\n public:\n void RegisterExtensions(XWalkExtensionService* extension_service) OVERRIDE {\n bool registered = extension_service->RegisterExtension(\n scoped_ptr<XWalkExtension>(new OnceExtension));\n ASSERT_TRUE(registered);\n }\n\n virtual void TearDown() OVERRIDE {\n SPIN_FOR_1_SECOND_OR_UNTIL_TRUE(g_contexts_destroyed == 2);\n ASSERT_EQ(g_contexts_destroyed, 2);\n }\n};\n\nIN_PROC_BROWSER_TEST_F(XWalkExtensionsContextDestructionTest,\n ContextIsDestroyedWhenNavigating) {\n content::RunAllPendingInMessageLoop();\n GURL url = GetExtensionsTestURL(base::FilePath(),\n base::FilePath().AppendASCII(\"context_destruction.html\"));\n\n string16 fail = ASCIIToUTF16(\"FAIL\");\n\n {\n content::TitleWatcher title_watcher(runtime()->web_contents(), fail);\n string16 pass_1 = ASCIIToUTF16(\"PASS 1\");\n title_watcher.AlsoWaitForTitle(pass_1);\n xwalk_test_utils::NavigateToURL(runtime(), url);\n EXPECT_EQ(pass_1, title_watcher.WaitAndGetTitle());\n }\n\n {\n content::TitleWatcher title_watcher(runtime()->web_contents(), fail);\n string16 pass_2 = ASCIIToUTF16(\"PASS 2\");\n title_watcher.AlsoWaitForTitle(pass_2);\n xwalk_test_utils::NavigateToURL(runtime(), url);\n EXPECT_EQ(pass_2, title_watcher.WaitAndGetTitle());\n }\n\n ASSERT_EQ(g_contexts_created, 2);\n}\n<commit_msg>Change ContextDestruction test to be less picky about titles<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/extensions\/test\/xwalk_extensions_test_base.h\"\n\n#include \"base\/strings\/stringprintf.h\"\n#include \"base\/synchronization\/lock.h\"\n#include \"base\/synchronization\/spin_wait.h\"\n#include \"content\/public\/test\/browser_test_utils.h\"\n#include \"content\/public\/test\/test_utils.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension.h\"\n#include \"xwalk\/runtime\/browser\/runtime.h\"\n#include \"xwalk\/test\/base\/in_process_browser_test.h\"\n#include \"xwalk\/test\/base\/xwalk_test_utils.h\"\n\nusing xwalk::extensions::XWalkExtension;\nusing xwalk::extensions::XWalkExtensionInstance;\nusing xwalk::extensions::XWalkExtensionService;\n\nnamespace {\n\nint g_contexts_created = 0;\n\nbase::Lock g_contexts_destroyed_lock;\nint g_contexts_destroyed = 0;\n\n}\n\nclass OnceExtensionInstance : public XWalkExtensionInstance {\n public:\n explicit OnceExtensionInstance(\n const XWalkExtension::PostMessageCallback& post_message)\n : answered_(false) {\n SetPostMessageCallback(post_message);\n }\n\n ~OnceExtensionInstance() {\n base::AutoLock lock(g_contexts_destroyed_lock);\n g_contexts_destroyed++;\n }\n\n virtual void HandleMessage(scoped_ptr<base::Value> msg) OVERRIDE {\n std::string answer;\n if (answered_) {\n answer = \"Fail\";\n } else {\n answer = base::StringPrintf(\"Pass\");\n answered_ = true;\n }\n PostMessageToJS(scoped_ptr<base::Value>(\n base::Value::CreateStringValue(answer)));\n }\n\n private:\n bool answered_;\n};\n\nclass OnceExtension : public XWalkExtension {\n public:\n OnceExtension()\n : XWalkExtension() {\n set_name(\"once\");\n }\n\n virtual const char* GetJavaScriptAPI() {\n static const char* kAPI =\n \"exports.read = function(callback) {\"\n \" extension.setMessageListener(callback);\"\n \" extension.postMessage('PING');\"\n \"};\";\n return kAPI;\n }\n\n virtual XWalkExtensionInstance* CreateInstance(\n const XWalkExtension::PostMessageCallback& post_message) {\n g_contexts_created++;\n return new OnceExtensionInstance(post_message);\n }\n};\n\nclass XWalkExtensionsContextDestructionTest : public XWalkExtensionsTestBase {\n public:\n void RegisterExtensions(XWalkExtensionService* extension_service) OVERRIDE {\n bool registered = extension_service->RegisterExtension(\n scoped_ptr<XWalkExtension>(new OnceExtension));\n ASSERT_TRUE(registered);\n }\n\n \/\/ FIXME(cmarcelo): Test here should be exact instead of greater than. To\n \/\/ achieve that we need to ensure that pages that don't use an extensions\n \/\/ won't have an instance created for them.\n virtual void TearDown() OVERRIDE {\n SPIN_FOR_1_SECOND_OR_UNTIL_TRUE(g_contexts_destroyed >= 2);\n ASSERT_GT(g_contexts_destroyed, 2);\n }\n};\n\nIN_PROC_BROWSER_TEST_F(XWalkExtensionsContextDestructionTest,\n ContextIsDestroyedWhenNavigating) {\n content::RunAllPendingInMessageLoop();\n GURL url = GetExtensionsTestURL(base::FilePath(),\n base::FilePath().AppendASCII(\"context_destruction.html\"));\n\n {\n content::TitleWatcher title_watcher(runtime()->web_contents(), kFailString);\n title_watcher.AlsoWaitForTitle(kPassString);\n xwalk_test_utils::NavigateToURL(runtime(), url);\n EXPECT_EQ(kPassString, title_watcher.WaitAndGetTitle());\n }\n\n {\n content::TitleWatcher title_watcher(runtime()->web_contents(), kFailString);\n title_watcher.AlsoWaitForTitle(kPassString);\n xwalk_test_utils::NavigateToURL(runtime(), url);\n EXPECT_EQ(kPassString, title_watcher.WaitAndGetTitle());\n }\n\n \/\/ FIXME(cmarcelo): See comment in TearDown().\n ASSERT_GT(g_contexts_created, 2);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: sunjre.cxx,v $\n * $Revision: 1.9 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_jvmfwk.hxx\"\n\n#include \"osl\/thread.h\"\n#include \"sunjre.hxx\"\n#include \"sunversion.hxx\"\n#include \"diagnostics.h\"\n\nusing namespace rtl;\nusing namespace std;\n\n#define OUSTR(x) ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(x) )\nnamespace jfw_plugin\n{\n\nReference<VendorBase> SunInfo::createInstance()\n{\n return new SunInfo;\n}\n\nchar const* const* SunInfo::getJavaExePaths(int * size)\n{\n static char const * ar[] = {\n#if defined(WNT) || defined(OS2)\n \"java.exe\",\n \"bin\/java.exe\",\n \"jre\/bin\/java.exe\"\n#elif UNX\n \"java\",\n \"bin\/java\",\n \"jre\/bin\/java\"\n#endif\n };\n *size = sizeof (ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* SunInfo::getRuntimePaths(int * size)\n{\n static char const* ar[]= {\n#if defined(WNT) || defined(OS2)\n \"\/bin\/client\/jvm.dll\",\n \"\/bin\/hotspot\/jvm.dll\",\n \"\/bin\/classic\/jvm.dll\"\n#elif UNX\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\/libjvm.so\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/server\/libjvm.so\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/classic\/libjvm.so\"\n#endif\n\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* SunInfo::getLibraryPaths(int* size)\n{\n#ifdef UNX\n static char const * ar[] = {\n\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/native_threads\",\n \"\/lib\/\" JFW_PLUGIN_ARCH\n\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n#else\n size = 0;\n return NULL;\n#endif\n}\n\nint SunInfo::compareVersions(const rtl::OUString& sSecond) const\n{\n OUString sFirst = getVersion();\n\n SunVersion version1(sFirst);\n JFW_ENSURE(version1, OUSTR(\"[Java framework] sunjavaplugin\"SAL_DLLEXTENSION\n \" does not know the version: \")\n + sFirst + OUSTR(\" as valid for a SUN JRE.\"));\n SunVersion version2(sSecond);\n if ( ! version2)\n throw MalformedVersionException();\n\n if(version1 == version2)\n return 0;\n if(version1 > version2)\n return 1;\n else\n return -1;\n}\n\n\n}\n<commit_msg>INTEGRATION: CWS os2port03 (1.8.18); FILE MERGED 2008\/07\/16 12:25:32 obr 1.8.18.2: RESYNC: (1.8-1.9); FILE MERGED 2008\/01\/14 16:56:58 ydario 1.8.18.1: os2 needs different order for dll. Issue number:i85203 Submitted by:ydario<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: sunjre.cxx,v $\n * $Revision: 1.10 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_jvmfwk.hxx\"\n\n#include \"osl\/thread.h\"\n#include \"sunjre.hxx\"\n#include \"sunversion.hxx\"\n#include \"diagnostics.h\"\n\nusing namespace rtl;\nusing namespace std;\n\n#define OUSTR(x) ::rtl::OUString( RTL_CONSTASCII_USTRINGPARAM(x) )\nnamespace jfw_plugin\n{\n\nReference<VendorBase> SunInfo::createInstance()\n{\n return new SunInfo;\n}\n\nchar const* const* SunInfo::getJavaExePaths(int * size)\n{\n static char const * ar[] = {\n#if defined(WNT) || defined(OS2)\n \"java.exe\",\n \"bin\/java.exe\",\n \"jre\/bin\/java.exe\"\n#elif UNX\n \"java\",\n \"bin\/java\",\n \"jre\/bin\/java\"\n#endif\n };\n *size = sizeof (ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* SunInfo::getRuntimePaths(int * size)\n{\n static char const* ar[]= {\n#if defined(WNT)\n \"\/bin\/client\/jvm.dll\",\n \"\/bin\/hotspot\/jvm.dll\",\n \"\/bin\/classic\/jvm.dll\"\n#elif defined(OS2)\n \"\/bin\/classic\/jvm.dll\",\n \"\/bin\/client\/jvm.dll\",\n \"\/bin\/hotspot\/jvm.dll\"\n#elif UNX\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\/libjvm.so\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/server\/libjvm.so\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/classic\/libjvm.so\"\n#endif\n\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n}\n\nchar const* const* SunInfo::getLibraryPaths(int* size)\n{\n#ifdef UNX\n static char const * ar[] = {\n\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/client\",\n \"\/lib\/\" JFW_PLUGIN_ARCH \"\/native_threads\",\n \"\/lib\/\" JFW_PLUGIN_ARCH\n\n };\n *size = sizeof(ar) \/ sizeof (char*);\n return ar;\n#else\n size = 0;\n return NULL;\n#endif\n}\n\nint SunInfo::compareVersions(const rtl::OUString& sSecond) const\n{\n OUString sFirst = getVersion();\n\n SunVersion version1(sFirst);\n JFW_ENSURE(version1, OUSTR(\"[Java framework] sunjavaplugin\"SAL_DLLEXTENSION\n \" does not know the version: \")\n + sFirst + OUSTR(\" as valid for a SUN JRE.\"));\n SunVersion version2(sSecond);\n if ( ! version2)\n throw MalformedVersionException();\n\n if(version1 == version2)\n return 0;\n if(version1 > version2)\n return 1;\n else\n return -1;\n}\n\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2013 - 2017)\n\/\/ Rene Milk (2014, 2016 - 2017)\n\/\/ Tobias Leibner (2014, 2016)\n\n#ifndef DUNE_GDT_PROLONGATIONS_HH\n#define DUNE_GDT_PROLONGATIONS_HH\n\n#include <vector>\n\n#include <dune\/common\/dynvector.hh>\n\n#include <dune\/xt\/functions\/reinterpret.hh>\n#include <dune\/xt\/la\/container\/vector-interface.hh>\n\n#include <dune\/gdt\/discretefunction\/bochner.hh>\n#include <dune\/gdt\/discretefunction\/default.hh>\n#include <dune\/gdt\/discretefunction\/reinterpret.hh>\n#include <dune\/gdt\/interpolations.hh>\n#include <dune\/gdt\/spaces\/bochner.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\n\n\n\/\/ ## Variants for a DiscreteFunction ##\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [most general\n * variant].\n *\n * \\note This does not clear target.dofs().vector(). Thus, if prolongation_grid_view only covers a part of the domain of\n * target.space().grid_view(), other contributions in target remain (which is on purpose).\n *\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class SR, class TV, class TGV, class TR, class PGV>\nstd::enable_if_t<std::is_same<XT::Grid::extract_entity_t<TGV>, typename PGV::Grid::template Codim<0>::Entity>::value,\n void>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source,\n DiscreteFunction<TV, TGV, r, rC, TR>& target,\n const GridView<PGV>& prolongation_grid_view)\n{\n interpolate(reinterpret(source, prolongation_grid_view), target, prolongation_grid_view);\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [uses\n * target.space().grid_view() as prolongation_grid_view].\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class SR, class TV, class TGV, class TR>\nvoid prolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source, DiscreteFunction<TV, TGV, r, rC, TR>& target)\n{\n prolong(source, target, target.space().grid_view());\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function, TargetVectorType has to be provided].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space, prolongation_grid_view);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class SR, class TGV, class TR, class PGV>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value\n && std::is_same<XT::Grid::extract_entity_t<TGV>,\n typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteFunction<TargetVectorType, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space,\n const GridView<PGV>& prolongation_grid_view)\n{\n auto target_function = make_discrete_function<TargetVectorType>(target_space);\n prolong(source, target_function, prolongation_grid_view);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function, TargetVectorType has to be provided, uses target.space().grid_view() as\n * prolongation_grid_view].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class SR, class TGV, class TR>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value, DiscreteFunction<TargetVectorType, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source, const SpaceInterface<TGV, r, rC, TR>& target_space)\n{\n auto target_function = make_discrete_function<TargetVectorType>(target_space);\n prolong(source, target_function);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function with same VectorType as source].\n *\/\ntemplate <class V, class SGV, size_t r, size_t rC, class SR, class TGV, class TR, class PGV>\nstd::enable_if_t<std::is_same<XT::Grid::extract_entity_t<TGV>, typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteFunction<V, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<V, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space,\n const GridView<PGV>& prolongation_grid_view)\n{\n auto target_function = make_discrete_function<V>(target_space);\n prolong(source, target_function, prolongation_grid_view);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function with same VectorType as source, uses target.space().grid_view() as\n * prolongation_grid_view].\n *\/\ntemplate <class V, class SGV, size_t r, size_t rC, class SR, class TGV, class TR>\nDiscreteFunction<V, TGV, r, rC, TR> prolong(const DiscreteFunction<V, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space)\n{\n auto target_function = make_discrete_function<V>(target_space);\n prolong(source, target_function);\n return target_function;\n}\n\n\n\/\/ ## Variants for a DiscreteBochnerFunction ##\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one [most\n * general variant].\n *\n * \\note Uses prolong() in space.\n *\n * \\sa prolong\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, class TV, class TGV, class PGV>\nvoid prolong(const DiscreteBochnerFunction<SV, SGV>& source,\n DiscreteBochnerFunction<TV, TGV>& target,\n const GridView<PGV>& spatial_prolongation_grid_view)\n{\n \/\/ prepare\n target.dof_vectors().set_all(0.);\n const auto& temporal_space = target.space().temporal_space();\n DynamicVector<size_t> local_dof_indices(temporal_space.mapper().max_local_size());\n std::vector<bool> dof_has_been_handled(temporal_space.mapper().size(), false);\n \/\/ walk the time intervals\n for (auto&& time_interval : elements(temporal_space.grid_view())) {\n temporal_space.mapper().global_indices(time_interval, local_dof_indices);\n const auto& lagrange_points_in_time =\n temporal_space.finite_element(time_interval.geometry().type()).lagrange_points();\n for (size_t ii = 0; ii < lagrange_points_in_time.size(); ++ii) {\n const size_t global_dof_index = local_dof_indices[ii];\n if (!dof_has_been_handled[global_dof_index]) {\n const auto& point_in_time = time_interval.geometry().global(lagrange_points_in_time[ii]);\n \/\/ evaluate in time\n const auto coarse_spatial_function =\n make_discrete_function(source.space().spatial_space(), source.evaluate(point_in_time));\n \/\/ prolong in space\n auto fine_spatial_function =\n make_discrete_function(target.space().spatial_space(), target.dof_vectors()[global_dof_index]);\n prolong(coarse_spatial_function, fine_spatial_function, spatial_prolongation_grid_view);\n dof_has_been_handled[global_dof_index] = true;\n }\n }\n }\n} \/\/ ... prolong(...)\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one [uses\n * target.space().spatial_space().grid_view() as spatial_prolongation_grid_view].\n *\n * \\note Uses prolong() in space.\n *\n * \\sa prolong\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, class TV, class TGV>\nvoid prolong(const DiscreteBochnerFunction<SV, SGV>& source, DiscreteBochnerFunction<TV, TGV>& target)\n{\n prolong(source, target, target.space().spatial_space().grid_view());\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one\n * [creates suitable target_function, TargetVectorType has to be provided].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space, spatial_prolongation_grid_view);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, class TGV, size_t r, size_t rC, class R, class PGV>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value\n && std::is_same<XT::Grid::extract_entity_t<TGV>,\n typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteBochnerFunction<TargetVectorType, TGV, r, rC, R>>\nprolong(const DiscreteBochnerFunction<SV, SGV>& source,\n const BochnerSpace<TGV, r, rC, R>& target_space,\n const GridView<PGV>& spatial_prolongation_grid_view)\n{\n auto target_function = make_discrete_bochner_function<TargetVectorType>(target_space);\n prolong(source, target_function, spatial_prolongation_grid_view);\n return target_function;\n}\n\n\ntemplate <class TargetVectorType, class SV, class SGV, class TGV, size_t r, size_t rC, class R>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value, DiscreteBochnerFunction<TargetVectorType, TGV, r, rC, R>>\nprolong(const DiscreteBochnerFunction<SV, SGV>& source, const BochnerSpace<TGV, r, rC, R>& target_space)\n{\n return prolong<TargetVectorType>(source, target_space, target_space.spatial_space().grid_view());\n}\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_PROLONGATIONS_HH\n<commit_msg>[prolongations] some improvements<commit_after>\/\/ This file is part of the dune-gdt project:\n\/\/ https:\/\/github.com\/dune-community\/dune-gdt\n\/\/ Copyright 2010-2018 dune-gdt developers and contributors. All rights reserved.\n\/\/ License: Dual licensed as BSD 2-Clause License (http:\/\/opensource.org\/licenses\/BSD-2-Clause)\n\/\/ or GPL-2.0+ (http:\/\/opensource.org\/licenses\/gpl-license)\n\/\/ with \"runtime exception\" (http:\/\/www.dune-project.org\/license.html)\n\/\/ Authors:\n\/\/ Felix Schindler (2013 - 2017)\n\/\/ Rene Milk (2014, 2016 - 2017)\n\/\/ Tobias Leibner (2014, 2016)\n\n#ifndef DUNE_GDT_PROLONGATIONS_HH\n#define DUNE_GDT_PROLONGATIONS_HH\n\n#include <vector>\n\n#include <dune\/common\/dynvector.hh>\n\n#include <dune\/xt\/la\/container\/vector-interface.hh>\n\n#include <dune\/gdt\/discretefunction\/bochner.hh>\n#include <dune\/gdt\/discretefunction\/default.hh>\n#include <dune\/gdt\/discretefunction\/reinterpret.hh>\n#include <dune\/gdt\/interpolations.hh>\n#include <dune\/gdt\/spaces\/bochner.hh>\n#include <dune\/gdt\/spaces\/interface.hh>\n\nnamespace Dune {\nnamespace GDT {\n\n\n\/\/ ## Variants for a DiscreteFunction ##\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [most general\n * variant].\n *\n * \\note This does not clear target.dofs().vector(). Thus, if prolongation_grid_view only covers a part of the domain of\n * target.space().grid_view(), other contributions in target remain (which is on purpose).\n *\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class SR, class TV, class TGV, class TR, class PGV>\nstd::enable_if_t<std::is_same<XT::Grid::extract_entity_t<TGV>, typename PGV::Grid::template Codim<0>::Entity>::value,\n void>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source,\n DiscreteFunction<TV, TGV, r, rC, TR>& target,\n const GridView<PGV>& prolongation_grid_view)\n{\n interpolate(reinterpret(source, prolongation_grid_view), target, prolongation_grid_view);\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [uses\n * target.space().grid_view() as prolongation_grid_view].\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class SR, class TV, class TGV, class TR>\nvoid prolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source, DiscreteFunction<TV, TGV, r, rC, TR>& target)\n{\n prolong(source, target, target.space().grid_view());\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function, TargetVectorType has to be provided].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space, prolongation_grid_view);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class SR, class TGV, class TR, class PGV>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value\n && std::is_same<XT::Grid::extract_entity_t<TGV>,\n typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteFunction<TargetVectorType, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space,\n const GridView<PGV>& prolongation_grid_view)\n{\n auto target_function = make_discrete_function<TargetVectorType>(target_space);\n prolong(source, target_function, prolongation_grid_view);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function, TargetVectorType has to be provided, uses target.space().grid_view() as\n * prolongation_grid_view].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class SR, class TGV, class TR>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value, DiscreteFunction<TargetVectorType, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<SV, SGV, r, rC, SR>& source, const SpaceInterface<TGV, r, rC, TR>& target_space)\n{\n auto target_function = make_discrete_function<TargetVectorType>(target_space);\n prolong(source, target_function);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function with same VectorType as source].\n *\/\ntemplate <class V, class SGV, size_t r, size_t rC, class SR, class TGV, class TR, class PGV>\nstd::enable_if_t<std::is_same<XT::Grid::extract_entity_t<TGV>, typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteFunction<V, TGV, r, rC, TR>>\nprolong(const DiscreteFunction<V, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space,\n const GridView<PGV>& prolongation_grid_view)\n{\n auto target_function = make_discrete_function<V>(target_space);\n prolong(source, target_function, prolongation_grid_view);\n return target_function;\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteFunction from one (usually coarser) GridView onto another (usually finer) one [creates\n * suitable target_function with same VectorType as source, uses target.space().grid_view() as\n * prolongation_grid_view].\n *\/\ntemplate <class V, class SGV, size_t r, size_t rC, class SR, class TGV, class TR>\nDiscreteFunction<V, TGV, r, rC, TR> prolong(const DiscreteFunction<V, SGV, r, rC, SR>& source,\n const SpaceInterface<TGV, r, rC, TR>& target_space)\n{\n auto target_function = make_discrete_function<V>(target_space);\n prolong(source, target_function);\n return target_function;\n}\n\n\n\/\/ ## Variants for a DiscreteBochnerFunction ##\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one [most\n * general variant].\n *\n * \\note Uses prolong() in space.\n *\n * \\sa prolong\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class R, class TV, class TGV, class PGV>\nvoid prolong(const DiscreteBochnerFunction<SV, SGV, r, rC, R>& source,\n DiscreteBochnerFunction<TV, TGV, r, rC, R>& target,\n const GridView<PGV>& spatial_prolongation_grid_view)\n{\n \/\/ prepare\n const auto& temporal_space = target.space().temporal_space();\n DynamicVector<size_t> local_dof_indices(temporal_space.mapper().max_local_size());\n std::vector<bool> dof_has_been_handled(temporal_space.mapper().size(), false);\n \/\/ walk the time intervals\n for (auto&& time_interval : elements(temporal_space.grid_view())) {\n temporal_space.mapper().global_indices(time_interval, local_dof_indices);\n const auto& lagrange_points_in_time =\n temporal_space.finite_element(time_interval.geometry().type()).lagrange_points();\n for (size_t ii = 0; ii < lagrange_points_in_time.size(); ++ii) {\n const size_t global_dof_index = local_dof_indices[ii];\n if (!dof_has_been_handled[global_dof_index]) {\n const auto& point_in_time = time_interval.geometry().global(lagrange_points_in_time[ii]);\n \/\/ evaluate in time\n const auto coarse_spatial_function =\n make_discrete_function(source.space().spatial_space(), source.evaluate(point_in_time));\n \/\/ prolong in space\n auto fine_spatial_function =\n make_discrete_function(target.space().spatial_space(), target.dof_vectors()[global_dof_index].vector());\n prolong(coarse_spatial_function, fine_spatial_function, spatial_prolongation_grid_view);\n dof_has_been_handled[global_dof_index] = true;\n }\n }\n }\n} \/\/ ... prolong(...)\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one [uses\n * target.space().spatial_space().grid_view() as spatial_prolongation_grid_view].\n *\n * \\note Uses prolong() in space.\n *\n * \\sa prolong\n * \\sa interpolate\n * \\sa reinterpret\n *\/\ntemplate <class SV, class SGV, size_t r, size_t rC, class R, class TV, class TGV>\nvoid prolong(const DiscreteBochnerFunction<SV, SGV, r, rC, R>& source,\n DiscreteBochnerFunction<TV, TGV, r, rC, R>& target)\n{\n prolong(source, target, target.space().spatial_space().grid_view());\n}\n\n\n\/**\n * \\brief Prolongs a DiscreteBochnerFunction from one (usually coarser) time grid onto another (usually finer) one\n * [creates suitable target_function, TargetVectorType has to be provided].\n *\n * Use as in\n\\code\nauto target_function = prolong<TargetVectorType>(source, target_space, spatial_prolongation_grid_view);\n\\endcode\n *\/\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class R, class TGV, class PGV>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value\n && std::is_same<XT::Grid::extract_entity_t<TGV>,\n typename PGV::Grid::template Codim<0>::Entity>::value,\n DiscreteBochnerFunction<TargetVectorType, TGV, r, rC, R>>\nprolong(const DiscreteBochnerFunction<SV, SGV, r, rC, R>& source,\n const BochnerSpace<TGV, r, rC, R>& target_space,\n const GridView<PGV>& spatial_prolongation_grid_view)\n{\n auto target_function = make_discrete_bochner_function<TargetVectorType>(target_space);\n prolong(source, target_function, spatial_prolongation_grid_view);\n return target_function;\n}\n\n\ntemplate <class TargetVectorType, class SV, class SGV, size_t r, size_t rC, class R, class TGV>\nstd::enable_if_t<XT::LA::is_vector<TargetVectorType>::value, DiscreteBochnerFunction<TargetVectorType, TGV, r, rC, R>>\nprolong(const DiscreteBochnerFunction<SV, SGV, r, rC, R>& source, const BochnerSpace<TGV, r, rC, R>& target_space)\n{\n return prolong<TargetVectorType>(source, target_space, target_space.spatial_space().grid_view());\n}\n\n\n} \/\/ namespace GDT\n} \/\/ namespace Dune\n\n#endif \/\/ DUNE_GDT_PROLONGATIONS_HH\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SWE_Sphere_TS_ln_erk.hpp\n *\n * Created on: 30 May 2017\n * Author: Martin Schreiber <SchreiberX@gmail.com>\n *\/\n\n#ifndef SRC_PROGRAMS_SWE_SPHERE_REXI_SWE_SPHERE_TS_LN_ERK_HPP_\n#define SRC_PROGRAMS_SWE_SPHERE_REXI_SWE_SPHERE_TS_LN_ERK_HPP_\n\n#include <sweet\/sphere\/SphereData_Spectral.hpp>\n#include <sweet\/sphere\/SphereOperators_SphereData.hpp>\n#include <sweet\/sphere\/SphereTimestepping_ExplicitRK.hpp>\n#include <limits>\n#include <sweet\/SimulationVariables.hpp>\n\n#include \"SWE_Sphere_TS_interface.hpp\"\n\n\nclass SWE_Sphere_TS_ln_erk\t: public SWE_Sphere_TS_interface\n{\npublic:\n\tbool implements_timestepping_method(const std::string &i_timestepping_method)\n\t{\n\t\tif (i_timestepping_method == \"ln_erk\")\n\t\t\treturn true;\n\n\t\treturn false;\n\t}\n\n\tstd::string string_id()\n\t{\n\t\treturn \"ln_erk\";\n\t}\n\n\tvoid setup_auto()\n\t{\n\t\tsetup(simVars.disc.timestepping_order);\n\t}\n\n\nprivate:\n\tSimulationVariables &simVars;\n\tSphereOperators_SphereData &op;\n\n\tint timestepping_order;\n\n\t\/\/ Sampler\n\tSphereTimestepping_ExplicitRK timestepping_rk;\n\n\nprivate:\n\tvoid euler_timestep_update_pert(\n\t\t\tconst SphereData_Spectral &i_phi,\t\/\/\/< prognostic variables\n\t\t\tconst SphereData_Spectral &i_vort,\t\/\/\/< prognostic variables\n\t\t\tconst SphereData_Spectral &i_div,\t\/\/\/< prognostic variables\n\n\t\t\tSphereData_Spectral &o_phi_t,\t\/\/\/< time updates\n\t\t\tSphereData_Spectral &o_vort_t,\t\/\/\/< time updates\n\t\t\tSphereData_Spectral &o_div_t,\t\/\/\/< time updates\n\n\t\t\tdouble i_simulation_timestamp = -1\n\t);\n\npublic:\n\tSWE_Sphere_TS_ln_erk(\n\t\t\tSimulationVariables &i_simVars,\n\t\t\tSphereOperators_SphereData &i_op\n\t\t);\n\n\tvoid setup(\n\t\t\tint i_order\t\/\/\/< order of RK time stepping method\n\t);\n\n\tvoid run_timestep(\n\t\t\tSphereData_Spectral &io_phi,\t\/\/\/< prognostic variables\n\t\t\tSphereData_Spectral &io_vort,\t\/\/\/< prognostic variables\n\t\t\tSphereData_Spectral &io_div,\t\/\/\/< prognostic variables\n\n\t\t\tdouble i_fixed_dt = 0,\n\t\t\tdouble i_simulation_timestamp = -1\n\t);\n\n\n\n\tvirtual ~SWE_Sphere_TS_ln_erk();\n};\n\n#endif \/* SRC_PROGRAMS_SWE_PLANE_REXI_SWE_PLANE_TS_LN_ERK_HPP_ *\/\n<commit_msg>Make euler_timestep_update_pert Public<commit_after>\/*\n * SWE_Sphere_TS_ln_erk.hpp\n *\n * Created on: 30 May 2017\n * Author: Martin Schreiber <SchreiberX@gmail.com>\n *\/\n\n#ifndef SRC_PROGRAMS_SWE_SPHERE_REXI_SWE_SPHERE_TS_LN_ERK_HPP_\n#define SRC_PROGRAMS_SWE_SPHERE_REXI_SWE_SPHERE_TS_LN_ERK_HPP_\n\n#include <sweet\/sphere\/SphereData_Spectral.hpp>\n#include <sweet\/sphere\/SphereOperators_SphereData.hpp>\n#include <sweet\/sphere\/SphereTimestepping_ExplicitRK.hpp>\n#include <limits>\n#include <sweet\/SimulationVariables.hpp>\n\n#include \"SWE_Sphere_TS_interface.hpp\"\n\n\nclass SWE_Sphere_TS_ln_erk\t: public SWE_Sphere_TS_interface\n{\npublic:\n\tbool implements_timestepping_method(const std::string &i_timestepping_method)\n\t{\n\t\tif (i_timestepping_method == \"ln_erk\")\n\t\t\treturn true;\n\n\t\treturn false;\n\t}\n\n\tstd::string string_id()\n\t{\n\t\treturn \"ln_erk\";\n\t}\n\n\tvoid setup_auto()\n\t{\n\t\tsetup(simVars.disc.timestepping_order);\n\t}\n\n\nprivate:\n\tSimulationVariables &simVars;\n\tSphereOperators_SphereData &op;\n\n\tint timestepping_order;\n\n\t\/\/ Sampler\n\tSphereTimestepping_ExplicitRK timestepping_rk;\n\n\npublic:\n\tvoid euler_timestep_update_pert(\n\t\t\tconst SphereData_Spectral &i_phi,\t\/\/\/< prognostic variables\n\t\t\tconst SphereData_Spectral &i_vort,\t\/\/\/< prognostic variables\n\t\t\tconst SphereData_Spectral &i_div,\t\/\/\/< prognostic variables\n\n\t\t\tSphereData_Spectral &o_phi_t,\t\/\/\/< time updates\n\t\t\tSphereData_Spectral &o_vort_t,\t\/\/\/< time updates\n\t\t\tSphereData_Spectral &o_div_t,\t\/\/\/< time updates\n\n\t\t\tdouble i_simulation_timestamp = -1\n\t);\n\npublic:\n\tSWE_Sphere_TS_ln_erk(\n\t\t\tSimulationVariables &i_simVars,\n\t\t\tSphereOperators_SphereData &i_op\n\t\t);\n\n\tvoid setup(\n\t\t\tint i_order\t\/\/\/< order of RK time stepping method\n\t);\n\n\tvoid run_timestep(\n\t\t\tSphereData_Spectral &io_phi,\t\/\/\/< prognostic variables\n\t\t\tSphereData_Spectral &io_vort,\t\/\/\/< prognostic variables\n\t\t\tSphereData_Spectral &io_div,\t\/\/\/< prognostic variables\n\n\t\t\tdouble i_fixed_dt = 0,\n\t\t\tdouble i_simulation_timestamp = -1\n\t);\n\n\n\n\tvirtual ~SWE_Sphere_TS_ln_erk();\n};\n\n#endif \/* SRC_PROGRAMS_SWE_PLANE_REXI_SWE_PLANE_TS_LN_ERK_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/python\/py_values.h\"\n\n#include \"pybind11\/pybind11.h\"\n#include \"pybind11\/pytypes.h\"\n#include \"tensorflow\/compiler\/xla\/primitive_util.h\"\n#include \"tensorflow\/compiler\/xla\/python\/py_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/python\/python_ref_manager.h\"\n#include \"tensorflow\/compiler\/xla\/python\/types.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n#include \"tensorflow\/core\/profiler\/lib\/traceme.h\"\n#include \"tensorflow\/python\/lib\/core\/numpy.h\"\n\nnamespace py = pybind11;\n\nnamespace xla {\n\nnamespace {\n\nusing DevicePutFunc = std::function<StatusOr<DevicePutResult>(\n py::handle, PjRtDevice*, const DevicePutOptions& options)>;\n\ntemplate <typename T, typename SquashedT>\nStatusOr<DevicePutResult> HandlePythonScalar(py::handle obj,\n PjRtDevice* to_device,\n const DevicePutOptions& options) {\n T data;\n\n try {\n data = py::cast<T>(obj);\n } catch (const std::exception& e) {\n return InvalidArgument(\n \"Unable to convert Python scalar to %s. This most likely means the \"\n \"value (%s) overflows the range of the type.\",\n PrimitiveType_Name(primitive_util::NativeToPrimitiveType<T>()),\n py::repr(obj));\n }\n\n void* ptr;\n SquashedT squashed_data;\n Shape shape;\n if (std::is_same<T, SquashedT>() || !options.squash_64bit_types) {\n ptr = &data;\n shape = ShapeUtil::MakeShapeWithType<T>({});\n } else {\n \/\/ TODO(phawkins): we should check for overflow here, e.g., because of bugs\n \/\/ like https:\/\/github.com\/google\/jax\/issues\/2006\n squashed_data = static_cast<SquashedT>(data);\n ptr = &squashed_data;\n shape = ShapeUtil::MakeShapeWithType<SquashedT>({});\n }\n TF_ASSIGN_OR_RETURN(\n auto buffer,\n to_device->client()->BufferFromHostBuffer(\n ptr, shape, PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall,\n nullptr, to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/true);\n}\n\ntemplate <typename T, typename SquashedT = T>\nStatusOr<DevicePutResult> HandleNumpyScalar(py::handle h, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n T data;\n SquashedT data_squashed;\n void* ptr;\n Shape shape;\n if (std::is_same<T, bfloat16>()) {\n \/\/ For extension types, ScalarAsCtype returns a pointer to the data.\n PyArray_ScalarAsCtype(h.ptr(), &ptr);\n shape = ShapeUtil::MakeShape(BF16, {});\n } else if (std::is_same<T, SquashedT>() || !options.squash_64bit_types) {\n PyArray_ScalarAsCtype(h.ptr(), &data);\n ptr = &data;\n shape = ShapeUtil::MakeShapeWithType<T>({});\n } else {\n PyArray_ScalarAsCtype(h.ptr(), &data);\n data_squashed = static_cast<SquashedT>(data);\n ptr = &data_squashed;\n shape = ShapeUtil::MakeShapeWithType<SquashedT>({});\n }\n TF_ASSIGN_OR_RETURN(\n std::unique_ptr<PjRtBuffer> buffer,\n to_device->client()->BufferFromHostBuffer(\n ptr, shape, PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall,\n nullptr, to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/false);\n}\n\nStatusOr<DevicePutResult> HandleNumpyArray(py::handle h, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n py::array array = py::cast<py::array>(h);\n TF_ASSIGN_OR_RETURN(PrimitiveType type, DtypeToPrimitiveType(array.dtype()));\n\n PrimitiveType squashed_type;\n if (options.squash_64bit_types) {\n squashed_type = Squash64BitTypes(type);\n if (squashed_type != type) {\n TF_ASSIGN_OR_RETURN(py::dtype squashed_dtype,\n PrimitiveTypeToDtype(squashed_type));\n array = py::reinterpret_steal<py::array>(PyArray_CastToType(\n reinterpret_cast<PyArrayObject*>(array.ptr()),\n reinterpret_cast<PyArray_Descr*>(squashed_dtype.release().ptr()),\n \/*fortran=*\/0));\n }\n } else {\n squashed_type = type;\n }\n array = py::array::ensure(\n array, py::array::c_style | py::detail::npy_api::NPY_ARRAY_ALIGNED_);\n\n absl::InlinedVector<int64, 4> dims(array.ndim());\n for (int i = 0; i < array.ndim(); ++i) {\n dims[i] = array.shape(i);\n }\n Shape shape = ShapeUtil::MakeShape(squashed_type, dims);\n if (array.size() * array.itemsize() != ShapeUtil::ByteSizeOf(shape)) {\n throw std::runtime_error(absl::StrCat(\n \"Size mismatch for buffer: \", array.size() * array.itemsize(), \" vs. \",\n ShapeUtil::ByteSizeOf(shape)));\n }\n void* data = const_cast<void*>(array.data());\n PjRtClient::HostBufferSemantics host_buffer_semantics =\n PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall;\n std::function<void()> on_done_with_host_buffer;\n if (options.allow_zero_copy) {\n std::shared_ptr<PythonRefManager::ManagedPyObjects> py_buffer_ref =\n GlobalPyRefManager()->ManageReference(std::move(array));\n on_done_with_host_buffer =\n [py_buffer_ref{\n std::move(py_buffer_ref)}]() { \/* keeps py_buffer_ref alive *\/ };\n host_buffer_semantics = PjRtClient::HostBufferSemantics::kZeroCopy;\n }\n TF_ASSIGN_OR_RETURN(auto buffer,\n to_device->client()->BufferFromHostBuffer(\n data, shape, host_buffer_semantics,\n std::move(on_done_with_host_buffer), to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/false);\n}\n\nStatusOr<DevicePutResult> PyBufferHelper(py::handle obj, py::handle py_buffer,\n PyBuffer* buffer,\n PjRtDevice* to_device) {\n bool weak_type = buffer->weak_type()\n ? *buffer->weak_type()\n : py::cast<bool>(obj.attr(\"aval\").attr(\"weak_type\"));\n if (buffer->buffer()->device() == to_device) {\n return DevicePutResult(\n buffer->buffer(), weak_type,\n \/*owning_pybuffer=*\/py::reinterpret_borrow<py::object>(py_buffer));\n } else {\n TF_ASSIGN_OR_RETURN(std::unique_ptr<PjRtBuffer> copied_buffer,\n buffer->buffer()->CopyToDevice(to_device));\n return DevicePutResult(std::move(copied_buffer), weak_type);\n }\n}\n\nStatusOr<DevicePutResult> HandlePyBuffer(py::handle obj, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n return PyBufferHelper(obj, obj, py::cast<PyBuffer*>(obj), to_device);\n}\n\nStatusOr<DevicePutResult> HandleDeviceArray(py::handle obj,\n PjRtDevice* to_device,\n const DevicePutOptions& options) {\n \/\/ Handle Python DeviceArray objects provided they have a .device_buffer field\n \/\/ Otherwise, fallback to handling as a NumPy array, since we do not\n \/\/ understand how to get a buffer object out. For example, ShardedDeviceArray\n \/\/ in JAX is handled by this path.\n py::object buffer = py::getattr(obj, \"device_buffer\", py::none());\n if (buffer.is_none()) {\n return HandleNumpyArray(obj, to_device, options);\n }\n\n \/\/ Force buffers with a non-trivial lazy expression.\n py::object forced;\n if (!py::getattr(obj, \"_lazy_expr\").is_none()) {\n if (!options.force_lazy_arrays) {\n return InvalidArgument(\"Lazy arrays are not supported by device_put\");\n }\n static py::function& force = *[]() {\n const auto xla_module = py::module::import(\"jax.interpreters.xla\");\n return new py::function(\n py::cast<py::function>(xla_module.attr(\"_force\")));\n }();\n forced = force(obj);\n buffer = forced.attr(\"device_buffer\");\n obj = forced;\n }\n\n return PyBufferHelper(obj, buffer, py::cast<PyBuffer*>(buffer), to_device);\n}\n\n} \/\/ namespace\n\nStatusOr<DevicePutResult> DevicePut(pybind11::handle arg, PjRtDevice* to_device,\n const DevicePutOptions& options,\n PyBuffer* py_buffer) {\n tensorflow::profiler::TraceMe traceme(\"DevicePut\");\n if (py_buffer) {\n return PyBufferHelper(arg, arg, py_buffer, to_device);\n }\n static const absl::flat_hash_map<PyObject*, DevicePutFunc>* const handlers =\n [] {\n auto p = new absl::flat_hash_map<PyObject*, DevicePutFunc>();\n const NumpyScalarTypes& dtypes = GetNumpyScalarTypes();\n \/\/ Python scalar types.\n static_assert(sizeof(bool) == 1,\n \"Conversion code assumes bool is 1 byte\");\n (*p)[reinterpret_cast<PyObject*>(&PyBool_Type)] =\n HandlePythonScalar<bool, bool>;\n (*p)[reinterpret_cast<PyObject*>(&PyLong_Type)] =\n HandlePythonScalar<int64_t, int32_t>;\n (*p)[reinterpret_cast<PyObject*>(&PyFloat_Type)] =\n HandlePythonScalar<double, float>;\n (*p)[reinterpret_cast<PyObject*>(&PyComplex_Type)] =\n HandlePythonScalar<complex128, complex64>;\n\n \/\/ Generic subclasses of DeviceArray, e.g., ShardedDeviceArray.\n (*p)[py::type::handle_of<DeviceArrayBase>().ptr()] = HandleDeviceArray;\n \/\/ The C++ PyBuffer class is handled specially.\n (*p)[py::type::handle_of<PyBuffer>().ptr()] = HandlePyBuffer;\n\n try {\n py::object xla_module = py::module::import(\"jax.interpreters.xla\");\n py::object device_array =\n py::getattr(xla_module, \"_DeviceArray\", py::none());\n if (!device_array.is_none()) {\n (*p)[device_array.ptr()] = HandleDeviceArray;\n }\n } catch (const py::error_already_set& e) {\n \/\/ Ignore; jax may not be present.\n }\n\n try {\n py::object pxla_module = py::module::import(\"jax.interpreters.pxla\");\n py::object sda =\n py::getattr(pxla_module, \"ShardedDeviceArray\", py::none());\n if (!sda.is_none()) {\n (*p)[sda.ptr()] = HandleDeviceArray;\n }\n } catch (const py::error_already_set& e) {\n \/\/ Ignore; jax may not be present.\n }\n\n const auto numpy = py::module::import(\"numpy\");\n (*p)[numpy.attr(\"ndarray\").ptr()] = HandleNumpyArray;\n\n \/\/ Numpy scalar types. For some of them, we share the handler with\n \/\/ Python types (np_int64, np_float64, np_complex128).\n (*p)[dtypes.np_bool.ptr()] = HandleNumpyScalar<bool>;\n (*p)[dtypes.np_int8.ptr()] = HandleNumpyScalar<int8_t>;\n (*p)[dtypes.np_int16.ptr()] = HandleNumpyScalar<int16_t>;\n (*p)[dtypes.np_int32.ptr()] = HandleNumpyScalar<int32_t>;\n (*p)[dtypes.np_int64.ptr()] = HandleNumpyScalar<int64_t, int32_t>;\n (*p)[dtypes.np_uint8.ptr()] = HandleNumpyScalar<uint8_t>;\n (*p)[dtypes.np_uint16.ptr()] = HandleNumpyScalar<uint16_t>;\n (*p)[dtypes.np_uint32.ptr()] = HandleNumpyScalar<uint32_t>;\n (*p)[dtypes.np_uint64.ptr()] = HandleNumpyScalar<uint64_t, uint32_t>;\n (*p)[dtypes.np_bfloat16.ptr()] = HandleNumpyScalar<bfloat16>;\n (*p)[dtypes.np_float16.ptr()] = HandleNumpyScalar<half>;\n (*p)[dtypes.np_float32.ptr()] = HandleNumpyScalar<float>;\n (*p)[dtypes.np_float64.ptr()] = HandleNumpyScalar<double, float>;\n (*p)[dtypes.np_complex64.ptr()] = HandleNumpyScalar<complex64>;\n (*p)[dtypes.np_complex128.ptr()] =\n HandleNumpyScalar<complex128, complex64>;\n static_assert(sizeof(long long) == sizeof(int64_t), \/\/ NOLINT\n \"long long must be the same size as int64_t\");\n (*p)[dtypes.np_longlong.ptr()] = HandleNumpyScalar<int64_t, int32_t>;\n static_assert(sizeof(int) == sizeof(int32_t),\n \"int must be the same size as int32_t\");\n (*p)[dtypes.np_intc.ptr()] = HandleNumpyScalar<int32_t>;\n\n return p;\n }();\n\n auto res = handlers->find(arg.get_type().ptr());\n if (res == handlers->end()) {\n for (auto base_class : arg.get_type().attr(\"mro\")()) {\n res = handlers->find(base_class.ptr());\n if (res != handlers->end()) {\n return res->second(arg, to_device, options);\n }\n }\n return InvalidArgument(\n \"%s\", absl::StrCat(\n \"Not supported: The C++ jax jit execution path, only accepts \"\n \"DeviceArray, Numpy arrays scalars of supported types \"\n \"(see implementation), or Python scalars. Got type \",\n py::cast<std::string>(py::str(arg.get_type()))));\n } else {\n return res->second(arg, to_device, options);\n }\n}\n\n} \/\/ namespace xla\n<commit_msg>Copybara import of the project:<commit_after>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/xla\/python\/py_values.h\"\n\n#include \"pybind11\/pybind11.h\"\n#include \"pybind11\/pytypes.h\"\n#include \"tensorflow\/compiler\/xla\/primitive_util.h\"\n#include \"tensorflow\/compiler\/xla\/python\/py_buffer.h\"\n#include \"tensorflow\/compiler\/xla\/python\/python_ref_manager.h\"\n#include \"tensorflow\/compiler\/xla\/python\/types.h\"\n#include \"tensorflow\/compiler\/xla\/xla_data.pb.h\"\n#include \"tensorflow\/core\/profiler\/lib\/traceme.h\"\n#include \"tensorflow\/python\/lib\/core\/numpy.h\"\n\nnamespace py = pybind11;\n\nnamespace xla {\n\nnamespace {\n\nusing DevicePutFunc = std::function<StatusOr<DevicePutResult>(\n py::handle, PjRtDevice*, const DevicePutOptions& options)>;\n\ntemplate <typename T, typename SquashedT>\nStatusOr<DevicePutResult> HandlePythonScalar(py::handle obj,\n PjRtDevice* to_device,\n const DevicePutOptions& options) {\n T data;\n\n try {\n data = py::cast<T>(obj);\n } catch (const std::exception& e) {\n return InvalidArgument(\n \"Unable to convert Python scalar to %s. This most likely means the \"\n \"value (%s) overflows the range of the type.\",\n PrimitiveType_Name(primitive_util::NativeToPrimitiveType<T>()),\n py::repr(obj));\n }\n\n void* ptr;\n SquashedT squashed_data;\n Shape shape;\n if (std::is_same<T, SquashedT>() || !options.squash_64bit_types) {\n ptr = &data;\n shape = ShapeUtil::MakeShapeWithType<T>({});\n } else {\n \/\/ TODO(phawkins): we should check for overflow here, e.g., because of bugs\n \/\/ like https:\/\/github.com\/google\/jax\/issues\/2006\n squashed_data = static_cast<SquashedT>(data);\n ptr = &squashed_data;\n shape = ShapeUtil::MakeShapeWithType<SquashedT>({});\n }\n TF_ASSIGN_OR_RETURN(\n auto buffer,\n to_device->client()->BufferFromHostBuffer(\n ptr, shape, PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall,\n nullptr, to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/true);\n}\n\nStatusOr<DevicePutResult> HandlePythonInt(py::handle obj, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n void* ptr;\n Shape shape;\n int64 data_int64;\n int32 data_int32;\n\n if (options.squash_64bit_types) {\n try {\n data_int32 = py::cast<int32>(obj);\n } catch (const std::exception& e) {\n return InvalidArgument(\n \"Unable to convert Python scalar to %s. This most likely means the \"\n \"value (%s) overflows the range of the type.\",\n PrimitiveType_Name(primitive_util::NativeToPrimitiveType<int32>()),\n py::repr(obj));\n }\n ptr = &data_int32;\n shape = ShapeUtil::MakeShapeWithType<int32>({});\n } else {\n try {\n data_int64 = py::cast<int64>(obj);\n } catch (const std::exception& e) {\n return InvalidArgument(\n \"Unable to convert Python scalar to %s. This most likely means the \"\n \"value (%s) overflows the range of the type.\",\n PrimitiveType_Name(primitive_util::NativeToPrimitiveType<int64>()),\n py::repr(obj));\n }\n ptr = &data_int64;\n shape = ShapeUtil::MakeShapeWithType<int64>({});\n }\n TF_ASSIGN_OR_RETURN(\n auto buffer,\n to_device->client()->BufferFromHostBuffer(\n ptr, shape, PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall,\n nullptr, to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/true);\n}\n\ntemplate <typename T, typename SquashedT = T>\nStatusOr<DevicePutResult> HandleNumpyScalar(py::handle h, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n T data;\n SquashedT data_squashed;\n void* ptr;\n Shape shape;\n if (std::is_same<T, bfloat16>()) {\n \/\/ For extension types, ScalarAsCtype returns a pointer to the data.\n PyArray_ScalarAsCtype(h.ptr(), &ptr);\n shape = ShapeUtil::MakeShape(BF16, {});\n } else if (std::is_same<T, SquashedT>() || !options.squash_64bit_types) {\n PyArray_ScalarAsCtype(h.ptr(), &data);\n ptr = &data;\n shape = ShapeUtil::MakeShapeWithType<T>({});\n } else {\n PyArray_ScalarAsCtype(h.ptr(), &data);\n data_squashed = static_cast<SquashedT>(data);\n ptr = &data_squashed;\n shape = ShapeUtil::MakeShapeWithType<SquashedT>({});\n }\n TF_ASSIGN_OR_RETURN(\n std::unique_ptr<PjRtBuffer> buffer,\n to_device->client()->BufferFromHostBuffer(\n ptr, shape, PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall,\n nullptr, to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/false);\n}\n\nStatusOr<DevicePutResult> HandleNumpyArray(py::handle h, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n py::array array = py::cast<py::array>(h);\n TF_ASSIGN_OR_RETURN(PrimitiveType type, DtypeToPrimitiveType(array.dtype()));\n\n PrimitiveType squashed_type;\n if (options.squash_64bit_types) {\n squashed_type = Squash64BitTypes(type);\n if (squashed_type != type) {\n TF_ASSIGN_OR_RETURN(py::dtype squashed_dtype,\n PrimitiveTypeToDtype(squashed_type));\n array = py::reinterpret_steal<py::array>(PyArray_CastToType(\n reinterpret_cast<PyArrayObject*>(array.ptr()),\n reinterpret_cast<PyArray_Descr*>(squashed_dtype.release().ptr()),\n \/*fortran=*\/0));\n }\n } else {\n squashed_type = type;\n }\n array = py::array::ensure(\n array, py::array::c_style | py::detail::npy_api::NPY_ARRAY_ALIGNED_);\n\n absl::InlinedVector<int64, 4> dims(array.ndim());\n for (int i = 0; i < array.ndim(); ++i) {\n dims[i] = array.shape(i);\n }\n Shape shape = ShapeUtil::MakeShape(squashed_type, dims);\n if (array.size() * array.itemsize() != ShapeUtil::ByteSizeOf(shape)) {\n throw std::runtime_error(absl::StrCat(\n \"Size mismatch for buffer: \", array.size() * array.itemsize(), \" vs. \",\n ShapeUtil::ByteSizeOf(shape)));\n }\n void* data = const_cast<void*>(array.data());\n PjRtClient::HostBufferSemantics host_buffer_semantics =\n PjRtClient::HostBufferSemantics::kImmutableOnlyDuringCall;\n std::function<void()> on_done_with_host_buffer;\n if (options.allow_zero_copy) {\n std::shared_ptr<PythonRefManager::ManagedPyObjects> py_buffer_ref =\n GlobalPyRefManager()->ManageReference(std::move(array));\n on_done_with_host_buffer =\n [py_buffer_ref{\n std::move(py_buffer_ref)}]() { \/* keeps py_buffer_ref alive *\/ };\n host_buffer_semantics = PjRtClient::HostBufferSemantics::kZeroCopy;\n }\n TF_ASSIGN_OR_RETURN(auto buffer,\n to_device->client()->BufferFromHostBuffer(\n data, shape, host_buffer_semantics,\n std::move(on_done_with_host_buffer), to_device));\n return DevicePutResult(std::move(buffer), \/*weak_type=*\/false);\n}\n\nStatusOr<DevicePutResult> PyBufferHelper(py::handle obj, py::handle py_buffer,\n PyBuffer* buffer,\n PjRtDevice* to_device) {\n bool weak_type = buffer->weak_type()\n ? *buffer->weak_type()\n : py::cast<bool>(obj.attr(\"aval\").attr(\"weak_type\"));\n if (buffer->buffer()->device() == to_device) {\n return DevicePutResult(\n buffer->buffer(), weak_type,\n \/*owning_pybuffer=*\/py::reinterpret_borrow<py::object>(py_buffer));\n } else {\n TF_ASSIGN_OR_RETURN(std::unique_ptr<PjRtBuffer> copied_buffer,\n buffer->buffer()->CopyToDevice(to_device));\n return DevicePutResult(std::move(copied_buffer), weak_type);\n }\n}\n\nStatusOr<DevicePutResult> HandlePyBuffer(py::handle obj, PjRtDevice* to_device,\n const DevicePutOptions& options) {\n return PyBufferHelper(obj, obj, py::cast<PyBuffer*>(obj), to_device);\n}\n\nStatusOr<DevicePutResult> HandleDeviceArray(py::handle obj,\n PjRtDevice* to_device,\n const DevicePutOptions& options) {\n \/\/ Handle Python DeviceArray objects provided they have a .device_buffer field\n \/\/ Otherwise, fallback to handling as a NumPy array, since we do not\n \/\/ understand how to get a buffer object out. For example, ShardedDeviceArray\n \/\/ in JAX is handled by this path.\n py::object buffer = py::getattr(obj, \"device_buffer\", py::none());\n if (buffer.is_none()) {\n return HandleNumpyArray(obj, to_device, options);\n }\n\n \/\/ Force buffers with a non-trivial lazy expression.\n py::object forced;\n if (!py::getattr(obj, \"_lazy_expr\").is_none()) {\n if (!options.force_lazy_arrays) {\n return InvalidArgument(\"Lazy arrays are not supported by device_put\");\n }\n static py::function& force = *[]() {\n const auto xla_module = py::module::import(\"jax.interpreters.xla\");\n return new py::function(\n py::cast<py::function>(xla_module.attr(\"_force\")));\n }();\n forced = force(obj);\n buffer = forced.attr(\"device_buffer\");\n obj = forced;\n }\n\n return PyBufferHelper(obj, buffer, py::cast<PyBuffer*>(buffer), to_device);\n}\n\n} \/\/ namespace\n\nStatusOr<DevicePutResult> DevicePut(pybind11::handle arg, PjRtDevice* to_device,\n const DevicePutOptions& options,\n PyBuffer* py_buffer) {\n tensorflow::profiler::TraceMe traceme(\"DevicePut\");\n if (py_buffer) {\n return PyBufferHelper(arg, arg, py_buffer, to_device);\n }\n static const absl::flat_hash_map<PyObject*, DevicePutFunc>* const handlers =\n [] {\n auto p = new absl::flat_hash_map<PyObject*, DevicePutFunc>();\n const NumpyScalarTypes& dtypes = GetNumpyScalarTypes();\n \/\/ Python scalar types.\n static_assert(sizeof(bool) == 1,\n \"Conversion code assumes bool is 1 byte\");\n (*p)[reinterpret_cast<PyObject*>(&PyBool_Type)] =\n HandlePythonScalar<bool, bool>;\n (*p)[reinterpret_cast<PyObject*>(&PyLong_Type)] = HandlePythonInt;\n (*p)[reinterpret_cast<PyObject*>(&PyFloat_Type)] =\n HandlePythonScalar<double, float>;\n (*p)[reinterpret_cast<PyObject*>(&PyComplex_Type)] =\n HandlePythonScalar<complex128, complex64>;\n\n \/\/ Generic subclasses of DeviceArray, e.g., ShardedDeviceArray.\n (*p)[py::type::handle_of<DeviceArrayBase>().ptr()] = HandleDeviceArray;\n \/\/ The C++ PyBuffer class is handled specially.\n (*p)[py::type::handle_of<PyBuffer>().ptr()] = HandlePyBuffer;\n\n try {\n py::object xla_module = py::module::import(\"jax.interpreters.xla\");\n py::object device_array =\n py::getattr(xla_module, \"_DeviceArray\", py::none());\n if (!device_array.is_none()) {\n (*p)[device_array.ptr()] = HandleDeviceArray;\n }\n } catch (const py::error_already_set& e) {\n \/\/ Ignore; jax may not be present.\n }\n\n try {\n py::object pxla_module = py::module::import(\"jax.interpreters.pxla\");\n py::object sda =\n py::getattr(pxla_module, \"ShardedDeviceArray\", py::none());\n if (!sda.is_none()) {\n (*p)[sda.ptr()] = HandleDeviceArray;\n }\n } catch (const py::error_already_set& e) {\n \/\/ Ignore; jax may not be present.\n }\n\n const auto numpy = py::module::import(\"numpy\");\n (*p)[numpy.attr(\"ndarray\").ptr()] = HandleNumpyArray;\n\n \/\/ Numpy scalar types. For some of them, we share the handler with\n \/\/ Python types (np_int64, np_float64, np_complex128).\n (*p)[dtypes.np_bool.ptr()] = HandleNumpyScalar<bool>;\n (*p)[dtypes.np_int8.ptr()] = HandleNumpyScalar<int8_t>;\n (*p)[dtypes.np_int16.ptr()] = HandleNumpyScalar<int16_t>;\n (*p)[dtypes.np_int32.ptr()] = HandleNumpyScalar<int32_t>;\n (*p)[dtypes.np_int64.ptr()] = HandleNumpyScalar<int64_t, int32_t>;\n (*p)[dtypes.np_uint8.ptr()] = HandleNumpyScalar<uint8_t>;\n (*p)[dtypes.np_uint16.ptr()] = HandleNumpyScalar<uint16_t>;\n (*p)[dtypes.np_uint32.ptr()] = HandleNumpyScalar<uint32_t>;\n (*p)[dtypes.np_uint64.ptr()] = HandleNumpyScalar<uint64_t, uint32_t>;\n (*p)[dtypes.np_bfloat16.ptr()] = HandleNumpyScalar<bfloat16>;\n (*p)[dtypes.np_float16.ptr()] = HandleNumpyScalar<half>;\n (*p)[dtypes.np_float32.ptr()] = HandleNumpyScalar<float>;\n (*p)[dtypes.np_float64.ptr()] = HandleNumpyScalar<double, float>;\n (*p)[dtypes.np_complex64.ptr()] = HandleNumpyScalar<complex64>;\n (*p)[dtypes.np_complex128.ptr()] =\n HandleNumpyScalar<complex128, complex64>;\n static_assert(sizeof(long long) == sizeof(int64_t), \/\/ NOLINT\n \"long long must be the same size as int64_t\");\n (*p)[dtypes.np_longlong.ptr()] = HandleNumpyScalar<int64_t, int32_t>;\n static_assert(sizeof(int) == sizeof(int32_t),\n \"int must be the same size as int32_t\");\n (*p)[dtypes.np_intc.ptr()] = HandleNumpyScalar<int32_t>;\n\n return p;\n }();\n\n auto res = handlers->find(arg.get_type().ptr());\n if (res == handlers->end()) {\n for (auto base_class : arg.get_type().attr(\"mro\")()) {\n res = handlers->find(base_class.ptr());\n if (res != handlers->end()) {\n return res->second(arg, to_device, options);\n }\n }\n return InvalidArgument(\n \"%s\", absl::StrCat(\n \"Not supported: The C++ jax jit execution path, only accepts \"\n \"DeviceArray, Numpy arrays scalars of supported types \"\n \"(see implementation), or Python scalars. Got type \",\n py::cast<std::string>(py::str(arg.get_type()))));\n } else {\n return res->second(arg, to_device, options);\n }\n}\n\n} \/\/ namespace xla\n<|endoftext|>"} {"text":"<commit_before>\/**\n* Project: dystring\n* File: dystring.cpp\n* Version: 1.0\n* Author: Yusuf Shakeel\n* Date: 08 August 2014 Friday\n* Language: C++\n*\n* GitHub repository:\n* https:\/\/github.com\/yusufshakeel\/CPP-Project\/tree\/master\/dystring\n*\n* Author:\n* https:\/\/www.facebook.com\/yusufshakeel\n* https:\/\/www.youtube.com\/yusufshakeel\n* https:\/\/plus.google.com\/+YusufShakeel\n* https:\/\/www.twitter.com\/yusufshakeel\n* https:\/\/github.com\/yusufshakeel\n*\n* ======================================\n* License\n* ======================================\n*\n* The MIT License (MIT)\n*\n* Copyright (c) 2014 Yusuf Shakeel\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* The above copyright notice and this permission notice shall be included in all\n* copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n* SOFTWARE.\n*\/\n\n#include \"dystring.h\"\n\n\/\/----- DYSTRING CLASS FUNCTIONS ----------------------\/\/\n\n\/\/----- PRIVATE FUNCTIONS -----------------------------\/\/\n\/* memory allocation *\/\nvoid dystring::__dymalloc(){\n\tif(dystr!=0)\n\t\tdelete dystr;\n\tdystr = new char[dystrlen+1];\n}\n\n\/* return length of the string s *\/\nlong dystring::__dystrlen(const char *s){\n\tlong l = 0;\n\twhile(*(s+l)!='\\0')\n\t\tl++;\n\treturn l;\n}\n\n\/* reallocate memory space and retain previous string *\/\nvoid dystring::__dyrealloc(){\n\tchar *tmp = new char[dystrlen+1];\n\tlong i;\n\tfor(i=0; *(dystr+i)!='\\0'; i++){\n\t\t*(tmp+i)=*(dystr+i);\n\t}\n\t*(tmp+i)='\\0';\n\tdelete dystr;\n\tdystr = tmp;\n}\n\n\/\/----- PUBLIC FUNCTIONS ------------------------------\/\/\n\n\/\/----- CONSTRUCTORS ----------------------------------\/\/\n\n\/\/default constructor\ndystring::dystring(void){\n\tdystrlen = 0;\n\tdystr = new char('\\0');\n}\n\n\/\/parameterized constructor\ndystring::dystring(const char *s){\n\tcopy(s);\n}\n\n\/\/----- MEMBER FUNCTIONS ------------------------------\/\/\n\n\/* concatenate source to string *\/\nvoid dystring::concat(const char *source){\n\tlong slen = __dystrlen(source);\n\tlong i = dystrlen;\n\tdystrlen += slen;\n\t__dyrealloc();\n\tfor(long j=0; *(source+j)!='\\0'; j++,i++){\n\t\t*(dystr+i) = *(source+j);\n\t}\n\t*(dystr+i)='\\0';\n}\n\n\/* copy source to string *\/\nvoid dystring::copy(const char *source){\n\tdystrlen = __dystrlen(source);\n\t__dymalloc();\n\tlong i;\n\tfor(i=0;*(source+i) != '\\0';i++){\n\t\t*(dystr+i) = *(source+i);\n\t}\n\t*(dystr+i) = '\\0';\n}\n\n\/* get the content of the string *\/\nchar * dystring::get(){\n\treturn dystr;\n}\n\n\/* return true (1) if string is palindrome. false (0) otherwise *\/\nbool dystring::isPalindrome(){\n\tfor(long i=0, j=dystrlen-1; i<=j; i++,j--){\n\t\tif(*(dystr+i)!=*(dystr+j))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n\/* get the length of the string *\/\nlong dystring::length(){\n\treturn dystrlen;\n}\n\n\/* reverse string *\/\nvoid dystring::reverse(){\n\tchar ch;\n\tfor(long i=0, j=dystrlen-1; i<j; i++,j--){\n\t\tch = *(dystr+i);\n\t\t*(dystr+i) = *(dystr+j);\n\t\t*(dystr+j) = ch;\n\t}\n}\n\n\/* toggle case. change A to a and vice versa *\/\nvoid dystring::toggleCase(){\n\tfor(long i=0;i<dystrlen;i++){\n\t\tchar ch = *(dystr+i);\n\t\tif(ch>=65 && ch<=90){\n\t\t\t*(dystr+i) = ch + 32;\n\t\t}else if(ch>=97 && ch<=122){\n\t\t\t*(dystr+i) = ch - 32;\n\t\t}\n\t}\n}\n\n\/* toUpper case change a to A *\/\nvoid dystring::toUpper(){\n\tfor(long i=0;i<dystrlen;i++){\n\t\tchar ch = *(dystr+i);\n\t\tif(ch>=97 && ch<=122){\n\t\t\t*(dystr+i) = ch - 32;\n\t\t}\n\t}\n}\n\/* toLower case change A to a *\/\nvoid dystring::toLower(){\n\tfor(long i=0;i<dystrlen;i++){\n\t\tchar ch = *(dystr+i);\n\t\tif(ch>=65 && ch<=90){\n\t\t\t*(dystr+i) = ch + 32;\n\t\t}\n\t}\n}<commit_msg>functions implementation<commit_after>\/**\n* Project: dystring\n* File: dystring.cpp\n* Version: 1.0\n* Author: Yusuf Shakeel\n* Date: 08 August 2014 Friday\n* Language: C++\n*\n* GitHub repository:\n* https:\/\/github.com\/yusufshakeel\/CPP-Project\/tree\/master\/dystring\n*\n* Author:\n* https:\/\/www.facebook.com\/yusufshakeel\n* https:\/\/www.youtube.com\/yusufshakeel\n* https:\/\/plus.google.com\/+YusufShakeel\n* https:\/\/www.twitter.com\/yusufshakeel\n* https:\/\/github.com\/yusufshakeel\n*\n* ======================================\n* License\n* ======================================\n*\n* The MIT License (MIT)\n*\n* Copyright (c) 2014 Yusuf Shakeel\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* The above copyright notice and this permission notice shall be included in all\n* copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n* SOFTWARE.\n*\/\n\n#include \"dystring.h\"\n\n\/\/----- DYSTRING CLASS FUNCTIONS ----------------------\/\/\n\n\/\/----- PRIVATE FUNCTIONS -----------------------------\/\/\n\/* memory allocation *\/\nvoid dystring::__dymalloc(void){\n\tif(dystr != 0)\n\t\tdelete dystr;\n\tdystr = new char[dystrlen + 1];\n}\n\n\/* return length of the string s *\/\nlong dystring::__dystrlen(const char *s){\n\tlong l = 0;\n\twhile(*(s + l) != '\\0')\n\t\tl++;\n\treturn l;\n}\n\n\/* reallocate memory space and retain previous string *\/\nvoid dystring::__dyrealloc(void){\n\tchar *tmp = new char[dystrlen + 1];\n\tlong i;\n\tfor(i = 0; *(dystr + i) != '\\0'; i++){\n\t\t*(tmp + i) = *(dystr + i);\n\t}\n\t*(tmp + i) = '\\0';\n\tdelete dystr;\n\tdystr = tmp;\n}\n\n\/\/----- PUBLIC FUNCTIONS ------------------------------\/\/\n\n\/\/----- CONSTRUCTORS ----------------------------------\/\/\n\n\/\/default constructor\ndystring::dystring(void){\n\tdystrlen = 0;\n\tdystr = new char('\\0');\n}\n\n\/\/parameterized constructor\ndystring::dystring(const char *s){\n\tcopy(s);\n}\n\n\/\/----- MEMBER FUNCTIONS ------------------------------\/\/\n\n\/* concatenate source to string *\/\nvoid dystring::concat(const char *source){\n\tlong slen = __dystrlen(source);\n\tlong i = dystrlen;\n\tdystrlen += slen;\n\t__dyrealloc();\n\tfor(long j = 0; *(source + j) != '\\0'; j++, i++){\n\t\t*(dystr + i) = *(source + j);\n\t}\n\t*(dystr + i)='\\0';\n}\n\n\/* copy source to string *\/\nvoid dystring::copy(const char *source){\n\tdystrlen = __dystrlen(source);\n\t__dymalloc();\n\tlong i;\n\tfor(i = 0; *(source + i) != '\\0'; i++){\n\t\t*(dystr + i) = *(source + i);\n\t}\n\t*(dystr + i) = '\\0';\n}\n\n\/* return character at the given index, NULL (\\0) for invalid index. *\/\nchar dystring::charAt(long index){\n\tif(index < 0 || index >= dystrlen)\n\t\treturn '\\0';\n\treturn *(dystr+index);\n}\n\n\/* get the content of the string dystr *\/\nchar * dystring::get(void){\n\treturn dystr;\n}\n\n\/* return true (1) if string is palindrome. false (0) otherwise *\/\nbool dystring::isPalindrome(void){\n\tfor(long i = 0, j = dystrlen - 1; i <= j; i++, j--){\n\t\tif(*(dystr + i) != *(dystr + j))\n\t\t\treturn false;\n\t}\n\treturn true;\n}\n\n\/* return index of first occurance of the character ch in string, -1 otherwise. *\/\nlong dystring::indexOf(const char ch){\n\tfor(long i = 0; *(dystr + i) != '\\0'; i++){\n\t\tif(*(dystr + i) == ch)\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\n\/* return index of first occurance of the substring str in string, -1 otherwise. *\/\nlong dystring::indexOf(const char *str){\n\tlong slen = __dystrlen(str);\n\tfor(long i = 0, c = 0; *(dystr + i) != '\\0'; i++, c = 0){\n\t\tfor(long j = 0; j < slen; j++){\n\t\t\tif(*(dystr + i + j) == *(str + j))\n\t\t\t\tc++;\n\t\t}\n\t\tif(c == slen)\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\n\/* insert character ch at position index in string when index is valid, ignore otherwise. *\/\nvoid dystring::insertAt(const char ch, long index){\n\tif(index >= 0 && index < dystrlen){\n\t\tdystrlen++;\n\t\t__dyrealloc();\n\t\tfor(long i = dystrlen - 1; i > index; i--){\n\t\t\t*(dystr + i) = *(dystr + i - 1);\n\t\t}\n\t\t*(dystr + index) = ch;\n\t}\n}\n\n\/* return index of last occurance of the character ch in string, -1 otherwise. *\/\nlong dystring::lastIndexOf(const char ch){\n\tfor(long i = dystrlen - 1; i >= 0; i--){\n\t\tif(*(dystr + i) == ch)\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\n\/* return index of last occurance of the substring str in string, -1 otherwise. *\/\nlong dystring::lastIndexOf(const char *str){\n\tlong slen = __dystrlen(str);\n\tfor(long i = dystrlen - slen, c = 0; i >= 0; i--, c = 0){\n\t\tfor(long j = 0; j < slen; j++){\n\t\t\tif(*(dystr + i + j) == *(str + j))\n\t\t\t\tc++;\n\t\t}\n\t\tif(c == slen)\n\t\t\treturn i;\n\t}\n\treturn -1;\n}\n\n\/* get the length of the string *\/\nlong dystring::length(void){\n\treturn dystrlen;\n}\n\n\/* replace all occurance of the character ch with nch in the string.*\/\nvoid dystring::replace(const char ch, const char nch){\n\tfor(long i = 0; i < dystrlen; i++){\n\t\tif(*(dystr + i) == ch)\n\t\t\t*(dystr + i) = nch;\n\t}\n}\n\n\/* reverse string *\/\nvoid dystring::reverse(void){\n\tchar ch;\n\tfor(long i = 0, j = dystrlen - 1; i < j; i++, j--){\n\t\tch = *(dystr + i);\n\t\t*(dystr + i) = *(dystr + j);\n\t\t*(dystr + j) = ch;\n\t}\n}\n\n\/* toggle case. change A to a and vice versa *\/\nvoid dystring::toggleCase(void){\n\tfor(long i = 0; i < dystrlen; i++){\n\t\tchar ch = *(dystr + i);\n\t\tif(ch >= 65 && ch <= 90){\n\t\t\t*(dystr + i) = ch + 32;\n\t\t}else if(ch >= 97 && ch <= 122){\n\t\t\t*(dystr + i) = ch - 32;\n\t\t}\n\t}\n}\n\n\/* toLower case change A to a *\/\nvoid dystring::toLower(void){\n\tfor(long i = 0; i < dystrlen; i++){\n\t\tchar ch = *(dystr + i);\n\t\tif(ch >= 65 && ch <= 90){\n\t\t\t*(dystr + i) = ch + 32;\n\t\t}\n\t}\n}\n\n\/* toUpper case change a to A *\/\nvoid dystring::toUpper(void){\n\tfor(long i = 0; i < dystrlen; i++){\n\t\tchar ch = *(dystr + i);\n\t\tif(ch >= 97 && ch <= 122){\n\t\t\t*(dystr + i) = ch - 32;\n\t\t}\n\t}\n}\n\n\/* remove space from front and end of the string. *\/\nvoid dystring::trim(void){\n\tlong beg = 0, end = dystrlen - 1;\n\twhile(*(dystr + beg) < 33)\n\t\tbeg++;\n\twhile(*(dystr + end) < 33)\n\t\tend--;\n\tdystrlen = end - beg + 1;\n\tchar *tmp = new char[dystrlen + 1];\n\tlong i;\n\tfor(i = 0; i < dystrlen; i++){\n\t\t*(tmp + i) = *(dystr + beg + i);\n\t}\n\t*(tmp + i) = '\\0';\n\tdelete dystr;\n\tdystr = tmp;\n}\n\n\/* return a substring from index start till the end of the string, for invalid start index return NULL (\\0) *\/\nchar * dystring::substring(long start){\n\tif(start < 0 || start >= dystrlen)\n\t\treturn '\\0';\n\t\t\n\tlong substrlen = dystrlen - start;\n\tchar *str = new char[substrlen + 1];\n\tlong i;\n\tfor(i = 0; i < substrlen; i++){\n\t\t*(str + i) = *(dystr + start + i);\n\t}\n\t*(str + i) = '\\0';\n\treturn str;\n}\n\n\/* return a substring from index start to end, for invalid index return NULL (\\0) *\/\nchar * dystring::substring(long start, long end){\n\tif(start < 0 || start >= dystrlen || end < 0 || end >= dystrlen)\n\t\treturn '\\0';\n\t\t\n\tlong substrlen = end - start + 1;\n\tchar *str = new char[substrlen + 1];\n\tlong i;\n\tfor(i = 0; i < substrlen; i++){\n\t\t*(str + i) = *(dystr + start + i);\n\t}\n\t*(str + i) = '\\0';\n\treturn str;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2021 by Apex.AI Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"iceoryx_posh\/internal\/mepoo\/shm_safe_unmanaged_chunk.hpp\"\n\n#include \"iceoryx_posh\/internal\/mepoo\/memory_manager.hpp\"\n#include \"iceoryx_posh\/internal\/mepoo\/shared_chunk.hpp\"\n#include \"iceoryx_posh\/mepoo\/chunk_header.hpp\"\n#include \"iceoryx_posh\/mepoo\/mepoo_config.hpp\"\n#include \"iceoryx_utils\/internal\/posix_wrapper\/shared_memory_object\/allocator.hpp\"\n\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\n\nusing namespace iox::mepoo;\n\nclass ShmSafeUnmanagedChunk_test : public Test\n{\n public:\n void SetUp() override\n {\n MePooConfig mempoolconf;\n mempoolconf.addMemPool({CHUNK_SIZE, NUM_CHUNKS_IN_POOL});\n memoryManager.configureMemoryManager(mempoolconf, m_memoryAllocator, m_memoryAllocator);\n }\n\n SharedChunk getChunkFromMemoryManager()\n {\n auto chunkSettingsResult = iox::mepoo::ChunkSettings::create(sizeof(bool), alignof(bool));\n EXPECT_FALSE(chunkSettingsResult.has_error());\n if (chunkSettingsResult.has_error())\n {\n return nullptr;\n }\n auto& chunkSettings = chunkSettingsResult.value();\n\n return memoryManager.getChunk(chunkSettings);\n }\n\n iox::mepoo::MemoryManager memoryManager;\n\n private:\n static constexpr size_t KILOBYTE = 1 << 10;\n static constexpr size_t MEMORY_SIZE = 100 * KILOBYTE;\n std::unique_ptr<char[]> m_memory{new char[MEMORY_SIZE]};\n static constexpr uint32_t NUM_CHUNKS_IN_POOL = 100;\n static constexpr uint32_t CHUNK_SIZE = 128;\n\n iox::posix::Allocator m_memoryAllocator{m_memory.get(), MEMORY_SIZE};\n};\n\nTEST_F(ShmSafeUnmanagedChunk_test, DefaultConstructedResultsInLogicallyNullptr)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, ConstructedWithEmptySharedChunkResultsInLogicallyNullptr)\n{\n SharedChunk sharedChunk;\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsLogicalNullptrOnSutConstructedWithSharedChunkResultsNotInLogicalyNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_FALSE(sut.isLogicalNullptr());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsLogicalNullptrOnSutPreviouslyCalledReleaseToSharedChunkResultsInLogicalyNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.releaseToSharedChunk();\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsLogicalNullptrOnSutPreviouslyCalledDuplicateToSharedChunkResultsNotInLogicalyNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.duplicateToSharedChunk();\n\n EXPECT_FALSE(sut.isLogicalNullptr());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallReleaseToSharedChunkOnDefaultConstructedSutResultsInEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.releaseToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallReleaseToSharedChunkOnSutConstructedWithSharedChunkResultsInNotEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 1U);\n EXPECT_TRUE(sut.releaseToSharedChunk());\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 0U);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallReleaseToSharedChunkTwiceOnSutConstructedWithSharedChunkResultsInEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n sut.releaseToSharedChunk();\n\n EXPECT_FALSE(sut.releaseToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallDuplicateToSharedChunkOnDefaultConstructedSutResultsEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.duplicateToSharedChunk());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallDuplicateToSharedChunkOnSutConstructedWithSharedChunkResultsInNotEmptySharedChunk)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n auto duplicatedSharedChunk = sut.duplicateToSharedChunk();\n EXPECT_TRUE(duplicatedSharedChunk);\n\n sut.releaseToSharedChunk();\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 1U);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallDuplicateToSharedChunkOnSutPreviouslyCalledReleaseToSharedChunkResultsInEmptySharedChunk)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.releaseToSharedChunk();\n\n EXPECT_FALSE(sut.duplicateToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnNonConstDefaultConstructedSutResultsInNullptr)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_EQ(sut.getChunkHeader(), nullptr);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnNonConstSutConstructedWithSharedChunkResultsInValidHeader)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n auto chunkHeader = sut.getChunkHeader();\n EXPECT_NE(chunkHeader, nullptr);\n EXPECT_EQ(chunkHeader, sharedChunk.getChunkHeader());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnConstDefaultConstructedSutResultsInNullptr)\n{\n const ShmSafeUnmanagedChunk sut;\n\n EXPECT_EQ(sut.getChunkHeader(), nullptr);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnConstSutConstructedWithSharedChunkResultsInValidHeader)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n [&](const ShmSafeUnmanagedChunk& sut) {\n auto chunkHeader = sut.getChunkHeader();\n EXPECT_NE(chunkHeader, nullptr);\n EXPECT_EQ(chunkHeader, sharedChunk.getChunkHeader());\n } (sut);\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallNonConstGetChunkHeaderResultsInNonConstChunkHeader)\n{\n auto isNonConstReturn =\n std::is_same<decltype(std::declval<ShmSafeUnmanagedChunk>().getChunkHeader()), ChunkHeader*>::value;\n EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallConstGetChunkHeaderResultsInConstChunkHeader)\n{\n auto isConstReturn =\n std::is_same<decltype(std::declval<const ShmSafeUnmanagedChunk>().getChunkHeader()), const ChunkHeader*>::value;\n EXPECT_TRUE(isConstReturn);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsNotLogicalNullptrAndHasNoOtherOwnersOnDefaultConstructedResultsInFalse)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutConstructedWithSharedChunkResultsInTrue)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n\n EXPECT_TRUE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutConstructedWithSharedChunkAndOtherOwnerResultsInFalse)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_FALSE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, Foo)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 1U);\n\n sut.releaseToSharedChunk();\n}\n\n} \/\/ namespace\n<commit_msg>iox-#713 additional tests for ShmSafeUnmanagedChunk<commit_after>\/\/ Copyright (c) 2021 by Apex.AI Inc. All rights reserved.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ SPDX-License-Identifier: Apache-2.0\n\n#include \"iceoryx_posh\/internal\/mepoo\/shm_safe_unmanaged_chunk.hpp\"\n\n#include \"iceoryx_posh\/internal\/mepoo\/memory_manager.hpp\"\n#include \"iceoryx_posh\/internal\/mepoo\/shared_chunk.hpp\"\n#include \"iceoryx_posh\/mepoo\/chunk_header.hpp\"\n#include \"iceoryx_posh\/mepoo\/mepoo_config.hpp\"\n#include \"iceoryx_utils\/internal\/posix_wrapper\/shared_memory_object\/allocator.hpp\"\n\n#include \"test.hpp\"\n\nnamespace\n{\nusing namespace ::testing;\n\nusing namespace iox::mepoo;\n\nclass ShmSafeUnmanagedChunk_test : public Test\n{\n public:\n void SetUp() override\n {\n MePooConfig mempoolconf;\n mempoolconf.addMemPool({CHUNK_SIZE, NUM_CHUNKS_IN_POOL});\n memoryManager.configureMemoryManager(mempoolconf, m_memoryAllocator, m_memoryAllocator);\n }\n\n SharedChunk getChunkFromMemoryManager()\n {\n auto chunkSettingsResult = iox::mepoo::ChunkSettings::create(sizeof(bool), alignof(bool));\n EXPECT_FALSE(chunkSettingsResult.has_error());\n if (chunkSettingsResult.has_error())\n {\n return nullptr;\n }\n auto& chunkSettings = chunkSettingsResult.value();\n\n return memoryManager.getChunk(chunkSettings);\n }\n\n iox::mepoo::MemoryManager memoryManager;\n\n private:\n static constexpr size_t KILOBYTE = 1 << 10;\n static constexpr size_t MEMORY_SIZE = 100 * KILOBYTE;\n std::unique_ptr<char[]> m_memory{new char[MEMORY_SIZE]};\n static constexpr uint32_t NUM_CHUNKS_IN_POOL = 100;\n static constexpr uint32_t CHUNK_SIZE = 128;\n\n iox::posix::Allocator m_memoryAllocator{m_memory.get(), MEMORY_SIZE};\n};\n\nTEST_F(ShmSafeUnmanagedChunk_test, DefaultConstructedResultsInLogicalNullptr)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, ConstructedWithEmptySharedChunkResultsInLogicalNullptr)\n{\n SharedChunk sharedChunk;\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsLogicalNullptrOnSutConstructedWithSharedChunkResultsNotInLogicalNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_FALSE(sut.isLogicalNullptr());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsLogicalNullptrOnSutPreviouslyCalledReleaseToSharedChunkResultsInLogicalNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.releaseToSharedChunk();\n\n EXPECT_TRUE(sut.isLogicalNullptr());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallIsLogicalNullptrOnSutPreviouslyCalledDuplicateToSharedChunkResultsNotInLogicalNullptr)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.duplicateToSharedChunk();\n\n EXPECT_FALSE(sut.isLogicalNullptr());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallReleaseToSharedChunkOnDefaultConstructedSutResultsInEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.releaseToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallReleaseToSharedChunkOnSutConstructedWithSharedChunkResultsInNotEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 1U);\n EXPECT_TRUE(sut.releaseToSharedChunk());\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 0U);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallReleaseToSharedChunkTwiceOnSutConstructedWithSharedChunkResultsInEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n sut.releaseToSharedChunk();\n\n EXPECT_FALSE(sut.releaseToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallDuplicateToSharedChunkOnDefaultConstructedSutResultsEmptySharedChunk)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.duplicateToSharedChunk());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallDuplicateToSharedChunkOnSutConstructedWithSharedChunkResultsInNotEmptySharedChunk)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n auto duplicatedSharedChunk = sut.duplicateToSharedChunk();\n EXPECT_TRUE(duplicatedSharedChunk);\n\n sut.releaseToSharedChunk();\n EXPECT_EQ(memoryManager.getMemPoolInfo(0).m_usedChunks, 1U);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallDuplicateToSharedChunkOnSutPreviouslyCalledReleaseToSharedChunkResultsInEmptySharedChunk)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n sut.releaseToSharedChunk();\n\n EXPECT_FALSE(sut.duplicateToSharedChunk());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnNonConstDefaultConstructedSutResultsInNullptr)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_EQ(sut.getChunkHeader(), nullptr);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnNonConstSutConstructedWithSharedChunkResultsInValidHeader)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n auto chunkHeader = sut.getChunkHeader();\n EXPECT_NE(chunkHeader, nullptr);\n EXPECT_EQ(chunkHeader, sharedChunk.getChunkHeader());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnConstDefaultConstructedSutResultsInNullptr)\n{\n const ShmSafeUnmanagedChunk sut;\n\n EXPECT_EQ(sut.getChunkHeader(), nullptr);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallGetChunkHeaderOnConstSutConstructedWithSharedChunkResultsInValidHeader)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n [&](const ShmSafeUnmanagedChunk& sut) {\n auto chunkHeader = sut.getChunkHeader();\n EXPECT_NE(chunkHeader, nullptr);\n EXPECT_EQ(chunkHeader, sharedChunk.getChunkHeader());\n }(sut);\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallNonConstGetChunkHeaderResultsInNonConstChunkHeader)\n{\n auto isNonConstReturn =\n std::is_same<decltype(std::declval<ShmSafeUnmanagedChunk>().getChunkHeader()), ChunkHeader*>::value;\n EXPECT_TRUE(isNonConstReturn);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallConstGetChunkHeaderResultsInConstChunkHeader)\n{\n auto isConstReturn =\n std::is_same<decltype(std::declval<const ShmSafeUnmanagedChunk>().getChunkHeader()), const ChunkHeader*>::value;\n EXPECT_TRUE(isConstReturn);\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test, CallIsNotLogicalNullptrAndHasNoOtherOwnersOnDefaultConstructedResultsInFalse)\n{\n ShmSafeUnmanagedChunk sut;\n\n EXPECT_FALSE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutConstructedWithSharedChunkResultsInTrue)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n\n EXPECT_TRUE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutConstructedWithSharedChunkAndOtherOwnerResultsInFalse)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n EXPECT_FALSE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(\n ShmSafeUnmanagedChunk_test,\n CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutConstructedWithSharedChunkAndOtherOwnerReleasedOwnershipResultsInTrue)\n{\n auto sharedChunk = getChunkFromMemoryManager();\n\n ShmSafeUnmanagedChunk sut(sharedChunk);\n\n \/\/ release ownership by assigning an empty SharedChunk\n sharedChunk = SharedChunk();\n\n EXPECT_TRUE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n\n sut.releaseToSharedChunk();\n}\n\nTEST_F(ShmSafeUnmanagedChunk_test,\n CallIsNotLogicalNullptrAndHasNoOtherOwnersOnOnSutPreviouslyCalledReleaseToSharedChunkResultsInFalse)\n{\n ShmSafeUnmanagedChunk sut(getChunkFromMemoryManager());\n sut.releaseToSharedChunk();\n\n EXPECT_FALSE(sut.isNotLogicalNullptrAndHasNoOtherOwners());\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2005-2008 by Marc Boris Duerner\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * As a special exception, you may use this file as part of a free\n * software library without restriction. Specifically, if other files\n * instantiate templates or use macros or inline functions from this\n * file, or you compile this file and link it with other files to\n * produce an executable, this file does not by itself cause the\n * resulting executable to be covered by the GNU General Public\n * License. This exception does not however invalidate any other\n * reasons why the executable file might be covered by the GNU Library\n * General Public License.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n#include \"fileimpl.h\"\n#include \"cxxtools\/ioerror.h\"\n#include \"cxxtools\/systemerror.h\"\n#include <string>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n\nnamespace cxxtools {\n\n\/\/ EACCES Permission denied.\n\/\/ EMFILE Too many file descriptors in use by process.\n\/\/ ENOENT Directory does not exist, or name is an empty string.\n\/\/ ENOTDIR name is not a directory.\n\/\/ EBUSY pathname is currently in use by the system or some process that prevents its removal.\n\/\/ EFAULT pathname points outside your accessible address space.\n\/\/ EINVAL pathname has . as last component.\n\/\/ ELOOP Too many symbolic links were encountered in resolving pathname.\n\/\/ ENAMETOOLONG pathname was too long.\n\/\/ ENOMEM Insufficient kernel memory was available.\n\/\/ ENOTEMPTY pathname contains entries other than . and .. ; or, pathname has .. as its final component.\n\/\/ EPERM The directory containing pathname has the sticky bit (S_ISVTX) set\n\/\/ EPERM The filesystem containing pathname does not support the removal of directories.\n\/\/ EROFS pathname refers to a file on a read-only filesystem.\nvoid throwErrno(const std::string& path, const cxxtools::SourceInfo& si)\n{\n if(errno == EEXIST)\n throw AccessFailed(path, si);\n\n switch(errno)\n {\n case EIO:\n case EBADF:\n case EBUSY:\n case ENOSPC:\n case EMLINK:\n case ENOTEMPTY:\n case EXDEV:\n throw IOError( strerror(errno), si );\n\n case EACCES:\n case EPERM:\n case EROFS:\n case ENXIO:\n throw PermissionDenied(path, si);\n\n case ELOOP:\n case ENAMETOOLONG:\n case ENOENT:\n case ENOTDIR:\n case EISDIR:\n throw FileNotFound(path, si);\n\n case ENODEV:\n throw DeviceNotFound(path, si);\n\n case ENOMEM:\n throw std::bad_alloc();\n\n default: \/\/ EFAULT EMFILE EOVERFLOW\n throw SystemError( strerror(errno), si );\n }\n}\n\n\nvoid throwFileErrno(const std::string& path, const cxxtools::SourceInfo& si)\n{\n switch(errno)\n {\n case ELOOP:\n case ENAMETOOLONG:\n case ENOENT:\n case ENOTDIR:\n case EISDIR:\n throw FileNotFound(path, si);\n\n default: throwErrno(path, si);\n }\n}\n\n\nstd::size_t FileImpl::size(const std::string& path)\n{\n struct stat buff;\n\n if( 0 != stat(path.c_str(), &buff) )\n {\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n }\n\n return buff.st_size;\n}\n\n\nvoid FileImpl::resize(const std::string& path, std::size_t newSize)\n{\n int ret = 0;\n do\n {\n ret = truncate(path.c_str(), newSize);\n }\n while ( ret == EINTR );\n\n if(ret != 0)\n throwFileErrno( path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::remove(const std::string& path)\n{\n if(0 != ::remove(path.c_str()))\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::move(const std::string& path, const std::string& to)\n{\n if( 0 != ::rename(path.c_str(), to.c_str()) )\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::create(const std::string& path)\n{\n int fd = open(path.c_str(), O_RDWR|O_EXCL|O_CREAT, 0777);\n if( fd < 0 )\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n\n ::close(fd);\n}\n\n}\n<commit_msg>add missing header<commit_after>\/*\n * Copyright (C) 2005-2008 by Marc Boris Duerner\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * As a special exception, you may use this file as part of a free\n * software library without restriction. Specifically, if other files\n * instantiate templates or use macros or inline functions from this\n * file, or you compile this file and link it with other files to\n * produce an executable, this file does not by itself cause the\n * resulting executable to be covered by the GNU General Public\n * License. This exception does not however invalidate any other\n * reasons why the executable file might be covered by the GNU Library\n * General Public License.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n#include \"fileimpl.h\"\n#include \"cxxtools\/ioerror.h\"\n#include \"cxxtools\/systemerror.h\"\n#include <string>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <fcntl.h>\n#include <unistd.h>\n#include <errno.h>\n#include <string.h>\n\nnamespace cxxtools {\n\n\/\/ EACCES Permission denied.\n\/\/ EMFILE Too many file descriptors in use by process.\n\/\/ ENOENT Directory does not exist, or name is an empty string.\n\/\/ ENOTDIR name is not a directory.\n\/\/ EBUSY pathname is currently in use by the system or some process that prevents its removal.\n\/\/ EFAULT pathname points outside your accessible address space.\n\/\/ EINVAL pathname has . as last component.\n\/\/ ELOOP Too many symbolic links were encountered in resolving pathname.\n\/\/ ENAMETOOLONG pathname was too long.\n\/\/ ENOMEM Insufficient kernel memory was available.\n\/\/ ENOTEMPTY pathname contains entries other than . and .. ; or, pathname has .. as its final component.\n\/\/ EPERM The directory containing pathname has the sticky bit (S_ISVTX) set\n\/\/ EPERM The filesystem containing pathname does not support the removal of directories.\n\/\/ EROFS pathname refers to a file on a read-only filesystem.\nvoid throwErrno(const std::string& path, const cxxtools::SourceInfo& si)\n{\n if(errno == EEXIST)\n throw AccessFailed(path, si);\n\n switch(errno)\n {\n case EIO:\n case EBADF:\n case EBUSY:\n case ENOSPC:\n case EMLINK:\n case ENOTEMPTY:\n case EXDEV:\n throw IOError( strerror(errno), si );\n\n case EACCES:\n case EPERM:\n case EROFS:\n case ENXIO:\n throw PermissionDenied(path, si);\n\n case ELOOP:\n case ENAMETOOLONG:\n case ENOENT:\n case ENOTDIR:\n case EISDIR:\n throw FileNotFound(path, si);\n\n case ENODEV:\n throw DeviceNotFound(path, si);\n\n case ENOMEM:\n throw std::bad_alloc();\n\n default: \/\/ EFAULT EMFILE EOVERFLOW\n throw SystemError( strerror(errno), si );\n }\n}\n\n\nvoid throwFileErrno(const std::string& path, const cxxtools::SourceInfo& si)\n{\n switch(errno)\n {\n case ELOOP:\n case ENAMETOOLONG:\n case ENOENT:\n case ENOTDIR:\n case EISDIR:\n throw FileNotFound(path, si);\n\n default: throwErrno(path, si);\n }\n}\n\n\nstd::size_t FileImpl::size(const std::string& path)\n{\n struct stat buff;\n\n if( 0 != stat(path.c_str(), &buff) )\n {\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n }\n\n return buff.st_size;\n}\n\n\nvoid FileImpl::resize(const std::string& path, std::size_t newSize)\n{\n int ret = 0;\n do\n {\n ret = truncate(path.c_str(), newSize);\n }\n while ( ret == EINTR );\n\n if(ret != 0)\n throwFileErrno( path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::remove(const std::string& path)\n{\n if(0 != ::remove(path.c_str()))\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::move(const std::string& path, const std::string& to)\n{\n if( 0 != ::rename(path.c_str(), to.c_str()) )\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n}\n\n\nvoid FileImpl::create(const std::string& path)\n{\n int fd = open(path.c_str(), O_RDWR|O_EXCL|O_CREAT, 0777);\n if( fd < 0 )\n throwFileErrno(path, CXXTOOLS_SOURCEINFO);\n\n ::close(fd);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Playground work.<commit_after>#include <iostream>\n#include <fstream>\n#include <array>\n\n#include <cstdint>\n\nusing std::cout;\nusing std::endl;\nusing std::ofstream;\n\nusing colour_code = std::array<uint8_t, 3>;\n\nstatic constexpr colour_code BLUE_VIOLET{ {0x8a, 0x2b, 0xe2} };\n\nint main(int argc, char *argv[]) {\n ofstream spi_dev{\"\/dev\/spidev0.0\", ofstream::binary | ofstream::out};\n\n cout << spi_dev.is_open() << endl;\n\n spi_dev.close();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2014-2015 Dims dev-team\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"core.h\"\n\n#include <boost\/statechart\/state.hpp>\n#include <boost\/statechart\/transition.hpp>\n#include <boost\/statechart\/custom_reaction.hpp>\n\n#include \"common\/authenticationProvider.h\"\n#include \"common\/setResponseVisitor.h\"\n#include \"common\/analyseTransaction.h\"\n#include \"common\/commonRequests.h\"\n\n#include \"monitor\/admitTrackerAction.h\"\n#include \"monitor\/monitorController.h\"\n#include \"monitor\/admitTransactionsBundle.h\"\n#include \"monitor\/filters.h\"\n#include \"monitor\/reputationTracer.h\"\n#include \"monitor\/monitorRequests.h\"\n#include \"monitor\/rankingDatabase.h\"\n\nnamespace monitor\n{\nstruct CPaidRegistration;\nstruct CFreeRegistration;\nstruct CPaidRegistrationEmptyNetwork;\n\/\/milisec\nunsigned int const WaitTime = 20000;\n\nbool analyseTransaction( CTransaction & _transaction, uint256 const & _hash, CKeyID const & _trackerId )\n{\n\tif ( !common::findKeyInInputs( _transaction, _trackerId ) )\n\t\treturn false;\n\n\tCTxOut txOut;\n\tunsigned id;\n\n\tcommon::findOutputInTransaction(\n\t\t\t\t_transaction\n\t\t\t\t, common::CAuthenticationProvider::getInstance()->getMyKey().GetID()\n\t\t\t\t, txOut\n\t\t\t\t, id );\n\n\treturn txOut.nValue >= CMonitorController::getInstance()->getPrice();\n}\n\nstruct CWaitForInfo : boost::statechart::state< CWaitForInfo, CAdmitTrackerAction >\n{\n\tCWaitForInfo( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\t\tLogPrintf(\"admit tracker action: %p wait for info \\n\", &context< CAdmitTrackerAction >() );\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( WaitTime, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\t\/\/ todo create alredy registered logic _messageResult.m_pubKey\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest( new CRegistrationTerms(\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t CMonitorController::getInstance()->getPrice()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , CMonitorController::getInstance()->getPeriod()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\tif ( CMonitorController::getInstance()->getPrice() )\n\t\t{\n\t\t\tif ( CReputationTracker::getInstance()->getTrackers().empty() )\n\t\t\t\treturn transit< CPaidRegistrationEmptyNetwork >();\n\t\t}\n\t\telse\n\t\t\treturn transit< CFreeRegistration >();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n};\n\nstruct CFreeRegistration : boost::statechart::state< CFreeRegistration, CAdmitTrackerAction >\n{\n\tCFreeRegistration( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\n\t\tLogPrintf(\"admit tracker action: %p free registration \\n\", &context< CAdmitTrackerAction >() );\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( WaitTime, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tcommon::CAdmitProof admitMessage;\n\n\t\tcommon::convertPayload( orginalMessage, admitMessage );\n\n\t\tCReputationTracker::getInstance()->addTracker( CTrackerData( _messageResult.m_pubKey, 0, CMonitorController::getInstance()->getPeriod(), GetTime() ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, 1\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n\n};\n\nstruct CPaidRegistrationEmptyNetwork : boost::statechart::state< CPaidRegistration, CAdmitTrackerAction >\n{\n\tCPaidRegistrationEmptyNetwork( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CTimeEventRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tWaitTime\n\t\t\t\t\t\t, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tif ( _messageResult.m_message.m_header.m_payloadKind== common::CPayloadKind::AdmitAsk )\n\t\t{\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t, 1\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\t\t}\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().setExit();\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\treturn transit< CFreeRegistration >();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n};\n\nstruct CPaidRegistration : boost::statechart::state< CPaidRegistration, CAdmitTrackerAction >\n{\n\tCPaidRegistration( my_context ctx )\n\t\t: my_base( ctx )\n\t\t, m_checkPeriod( 3000 )\n\t{\n\t\tLogPrintf(\"admit tracker action: %p paid registration \\n\", &context< CAdmitTrackerAction >() );\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tcommon::CAdmitProof admitMessage;\n\n\t\tcommon::convertPayload( orginalMessage, admitMessage );\n\n\t\tCPaymentTracking::getInstance()->addTransactionToSearch( admitMessage.m_proofTransactionHash );\n\n\t\tm_proofHash = admitMessage.m_proofTransactionHash;\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( m_checkPeriod, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\n\t\tm_messageId = _messageResult.m_message.m_header.m_id;\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tCTransaction transaction;\n\n\t\tif ( CPaymentTracking::getInstance()->transactionPresent( m_proofHash, transaction ) )\n\t\t\treturn discard_event();\n\n\t\tCPubKey pubKey;\n\t\tCReputationTracker::getInstance()->getNodeToKey(\n\t\t\t\t\t context< CAdmitTrackerAction >().getNodePtr()\n\t\t\t\t\t, pubKey );\n\n\t\tif ( analyseTransaction( transaction, m_proofHash, pubKey.GetID() ) )\n\t\t{\n\t\t\tCReputationTracker::getInstance()->addTracker( CTrackerData( pubKey, 0, CMonitorController::getInstance()->getPeriod(), GetTime() ) );\n\t\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, m_messageId\n\t\t\t\t\t\t\t, 1\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t\tCPubKey pubKey;\n\n\t\t\tCReputationTracker::getInstance()->getNodeToKey( context< CAdmitTrackerAction >().getNodePtr(), pubKey );\n\n\t\t\tCTrackerData trackerData( pubKey, 0, GetTime(), CMonitorController::getInstance()->getPeriod() );\n\n\t\t\tCRankingDatabase::getInstance()->writeTrackerData( trackerData );\n\n\t\t\tCReputationTracker::getInstance()->addTracker( trackerData );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, m_messageId\n\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t}\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n\n\tuint256 m_proofHash;\n\n\tuint256 m_messageId;\n\n\tint64_t const m_checkPeriod;\n};\n\nCAdmitTrackerAction::CAdmitTrackerAction( uint256 const & _actionKey, uintptr_t _nodePtr )\n\t: common::CAction< common::CMonitorTypes >( _actionKey )\n\t, m_nodePtr( _nodePtr )\n{\n\tinitiate();\n}\n\nvoid\nCAdmitTrackerAction::accept( common::CSetResponseVisitor< common::CMonitorTypes > & _visitor )\n{\n\t_visitor.visit( *this );\n}\n\n}\n<commit_msg>registration small fix<commit_after>\/\/ Copyright (c) 2014-2015 Dims dev-team\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"core.h\"\n\n#include <boost\/statechart\/state.hpp>\n#include <boost\/statechart\/transition.hpp>\n#include <boost\/statechart\/custom_reaction.hpp>\n\n#include \"common\/authenticationProvider.h\"\n#include \"common\/setResponseVisitor.h\"\n#include \"common\/analyseTransaction.h\"\n#include \"common\/commonRequests.h\"\n\n#include \"monitor\/admitTrackerAction.h\"\n#include \"monitor\/monitorController.h\"\n#include \"monitor\/admitTransactionsBundle.h\"\n#include \"monitor\/filters.h\"\n#include \"monitor\/reputationTracer.h\"\n#include \"monitor\/monitorRequests.h\"\n#include \"monitor\/rankingDatabase.h\"\n\nnamespace monitor\n{\nstruct CPaidRegistration;\nstruct CFreeRegistration;\nstruct CPaidRegistrationEmptyNetwork;\n\/\/milisec\nunsigned int const WaitTime = 20000;\n\nbool analyseTransaction( CTransaction & _transaction, uint256 const & _hash, CKeyID const & _trackerId )\n{\n\tif ( !common::findKeyInInputs( _transaction, _trackerId ) )\n\t\treturn false;\n\n\tCTxOut txOut;\n\tunsigned id;\n\n\tcommon::findOutputInTransaction(\n\t\t\t\t_transaction\n\t\t\t\t, common::CAuthenticationProvider::getInstance()->getMyKey().GetID()\n\t\t\t\t, txOut\n\t\t\t\t, id );\n\n\treturn txOut.nValue >= CMonitorController::getInstance()->getPrice();\n}\n\nstruct CWaitForInfo : boost::statechart::state< CWaitForInfo, CAdmitTrackerAction >\n{\n\tCWaitForInfo( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\t\tLogPrintf(\"admit tracker action: %p wait for info \\n\", &context< CAdmitTrackerAction >() );\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( WaitTime, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\t\/\/ todo create alredy registered logic _messageResult.m_pubKey\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest( new CRegistrationTerms(\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t CMonitorController::getInstance()->getPrice()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , CMonitorController::getInstance()->getPeriod()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t , new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\tif ( CMonitorController::getInstance()->getPrice() )\n\t\t{\n\t\t\tif ( CReputationTracker::getInstance()->getTrackers().empty() )\n\t\t\t\treturn transit< CPaidRegistrationEmptyNetwork >();\n\t\t}\n\t\telse\n\t\t\treturn transit< CFreeRegistration >();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n};\n\nstruct CFreeRegistration : boost::statechart::state< CFreeRegistration, CAdmitTrackerAction >\n{\n\tCFreeRegistration( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\n\t\tLogPrintf(\"admit tracker action: %p free registration \\n\", &context< CAdmitTrackerAction >() );\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( WaitTime, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tcommon::CAdmitProof admitMessage;\n\n\t\tcommon::convertPayload( orginalMessage, admitMessage );\n\n\t\tCReputationTracker::getInstance()->addTracker( CTrackerData( _messageResult.m_pubKey, 0, CMonitorController::getInstance()->getPeriod(), GetTime() ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t, 1\n\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n\n};\n\nstruct CPaidRegistrationEmptyNetwork : boost::statechart::state< CPaidRegistrationEmptyNetwork, CAdmitTrackerAction >\n{\n\tCPaidRegistrationEmptyNetwork( my_context ctx )\n\t\t: my_base( ctx )\n\t{\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\tnew common::CTimeEventRequest< common::CMonitorTypes >(\n\t\t\t\t\t\tWaitTime\n\t\t\t\t\t\t, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tif ( _messageResult.m_message.m_header.m_payloadKind== common::CPayloadKind::AdmitAsk )\n\t\t{\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CAckRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\tcontext< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, _messageResult.m_message.m_header.m_id\n\t\t\t\t\t\t\t, 1\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\t\t}\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tcontext< CAdmitTrackerAction >().setExit();\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CAckEvent const & _ackEvent )\n\t{\n\t\treturn transit< CFreeRegistration >();\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CAckEvent >,\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n};\n\nstruct CPaidRegistration : boost::statechart::state< CPaidRegistration, CAdmitTrackerAction >\n{\n\tCPaidRegistration( my_context ctx )\n\t\t: my_base( ctx )\n\t\t, m_checkPeriod( 3000 )\n\t{\n\t\tLogPrintf(\"admit tracker action: %p paid registration \\n\", &context< CAdmitTrackerAction >() );\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t}\n\n\tboost::statechart::result react( common::CMessageResult const & _messageResult )\n\t{\n\t\tcommon::CMessage orginalMessage;\n\t\tif ( !common::CommunicationProtocol::unwindMessage( _messageResult.m_message, orginalMessage, GetTime(), _messageResult.m_pubKey ) )\n\t\t\tassert( !\"service it somehow\" );\n\n\t\tcommon::CAdmitProof admitMessage;\n\n\t\tcommon::convertPayload( orginalMessage, admitMessage );\n\n\t\tCPaymentTracking::getInstance()->addTransactionToSearch( admitMessage.m_proofTransactionHash );\n\n\t\tm_proofHash = admitMessage.m_proofTransactionHash;\n\n\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\tcontext< CAdmitTrackerAction >().addRequest( new common::CTimeEventRequest< common::CMonitorTypes >( m_checkPeriod, new CMediumClassFilter( common::CMediumKinds::Time ) ) );\n\n\t\tm_messageId = _messageResult.m_message.m_header.m_id;\n\n\t\treturn discard_event();\n\t}\n\n\tboost::statechart::result react( common::CTimeEvent const & _timeEvent )\n\t{\n\t\tCTransaction transaction;\n\n\t\tif ( CPaymentTracking::getInstance()->transactionPresent( m_proofHash, transaction ) )\n\t\t\treturn discard_event();\n\n\t\tCPubKey pubKey;\n\t\tCReputationTracker::getInstance()->getNodeToKey(\n\t\t\t\t\t context< CAdmitTrackerAction >().getNodePtr()\n\t\t\t\t\t, pubKey );\n\n\t\tif ( analyseTransaction( transaction, m_proofHash, pubKey.GetID() ) )\n\t\t{\n\t\t\tCReputationTracker::getInstance()->addTracker( CTrackerData( pubKey, 0, CMonitorController::getInstance()->getPeriod(), GetTime() ) );\n\t\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, m_messageId\n\t\t\t\t\t\t\t, 1\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t\tCPubKey pubKey;\n\n\t\t\tCReputationTracker::getInstance()->getNodeToKey( context< CAdmitTrackerAction >().getNodePtr(), pubKey );\n\n\t\t\tCTrackerData trackerData( pubKey, 0, GetTime(), CMonitorController::getInstance()->getPeriod() );\n\n\t\t\tCRankingDatabase::getInstance()->writeTrackerData( trackerData );\n\n\t\t\tCReputationTracker::getInstance()->addTracker( trackerData );\n\t\t}\n\t\telse\n\t\t{\n\t\t\tcontext< CAdmitTrackerAction >().dropRequests();\n\n\t\t\tcontext< CAdmitTrackerAction >().addRequest(\n\t\t\t\t\t\tnew common::CResultRequest< common::CMonitorTypes >(\n\t\t\t\t\t\t\t context< CAdmitTrackerAction >().getActionKey()\n\t\t\t\t\t\t\t, m_messageId\n\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t, new CSpecificMediumFilter( context< CAdmitTrackerAction >().getNodePtr() ) ) );\n\n\t\t}\n\t\treturn discard_event();\n\t}\n\n\ttypedef boost::mpl::list<\n\tboost::statechart::custom_reaction< common::CTimeEvent >,\n\tboost::statechart::custom_reaction< common::CMessageResult >\n\t> reactions;\n\n\tuint256 m_proofHash;\n\n\tuint256 m_messageId;\n\n\tint64_t const m_checkPeriod;\n};\n\nCAdmitTrackerAction::CAdmitTrackerAction( uint256 const & _actionKey, uintptr_t _nodePtr )\n\t: common::CAction< common::CMonitorTypes >( _actionKey )\n\t, m_nodePtr( _nodePtr )\n{\n\tinitiate();\n}\n\nvoid\nCAdmitTrackerAction::accept( common::CSetResponseVisitor< common::CMonitorTypes > & _visitor )\n{\n\t_visitor.visit( *this );\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/optimization\/COptProblem.cpp,v $\n $Revision: 1.49 $\n $Name: $\n $Author: shoops $ \n $Date: 2005\/07\/06 17:16:23 $\n End CVS Header *\/\n\n\/**\n * File name: COptProblem.cpp\n *\n * Programmer: Yongqun He\n * Contact email: yohe@vt.edu\n * Purpose: This is the source file of the COptProblem class.\n * It specifies the optimization problem with its own members and\n * functions. It's used by COptAlgorithm class and COptimization class\n *\/\n#include <float.h>\n\n#include \"copasi.h\"\n#include \"COptTask.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n\n#include \"function\/CFunctionDB.h\"\n\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n\n#include \"steadystate\/CSteadyStateTask.h\"\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"steadystate\/CSteadyStateProblem.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n\n#include \"model\/CModel.h\"\n#include \"model\/CCompartment.h\"\n\n#include \"report\/CCopasiObjectReference.h\"\n#include \"report\/CKeyFactory.h\"\n\n#include \"utilities\/CProcessReport.h\"\n\n\/\/ Default constructor\nCOptProblem::COptProblem(const CCopasiContainer * pParent):\n CCopasiProblem(CCopasiTask::optimization, pParent),\n mpSteadyState(NULL),\n mpTrajectory(NULL),\n mpFunction(NULL),\n mOptItemList()\n{\n addGroup(\"OptimizationItemList\");\n addGroup(\"OptimizationConstraintList\");\n\n addParameter(\"Steady-State\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"Time-Course\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"ObjectiveFunction\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"Maximize\", CCopasiParameter::BOOL, (bool) false);\n\n initObjects();\n}\n\n\/\/ copy constructor\nCOptProblem::COptProblem(const COptProblem& src,\n const CCopasiContainer * pParent):\n CCopasiProblem(src, pParent),\n mpSteadyState(src.mpSteadyState),\n mpTrajectory(src.mpTrajectory),\n mpFunction(NULL),\n mOptItemList()\n{\n if (src.mpFunction)\n {\n createObjectiveFunction();\n mpFunction->setInfix(src.mpFunction->getInfix());\n setValue(\"ObjectiveFunction\", mpFunction->getKey());\n }\n\n initObjects();\n}\n\n\/\/ Destructor\nCOptProblem::~COptProblem()\n{\n std::vector<COptItem *>::iterator it = mOptItemList.begin();\n std::vector<COptItem *>::iterator end = mOptItemList.end();\n\n for (; it != end; ++it)\n pdelete(*it);\n\n if (mpFunction && CCopasiDataModel::Global && CCopasiDataModel::Global->getFunctionList())\n CCopasiDataModel::Global->getFunctionList()->loadedFunctions().remove(mpFunction->getObjectName());\n\n pdelete(mpFunction);\n}\n\nbool COptProblem::setModel(CModel * pModel)\n{\n mpModel = pModel;\n return true;\n}\n\nbool COptProblem::setCallBack(CProcessReport * pCallBack)\n{\n CCopasiProblem::setCallBack(pCallBack);\n\n if (pCallBack)\n {\n mhSolutionValue =\n mpCallBack->addItem(\"Best Value\",\n CCopasiParameter::DOUBLE,\n & mSolutionValue);\n mhCounter =\n mpCallBack->addItem(\"Simulation Counter\",\n CCopasiParameter::UINT,\n & mCounter);\n }\n\n return true;\n}\n\nvoid COptProblem::initObjects()\n{\n addObjectReference(\"Best Value\", mSolutionValue, CCopasiObject::ValueDbl);\n addObjectReference(\"Simulation Counter\", mCounter, CCopasiObject::ValueDbl);\n}\n\nbool COptProblem::initialize()\n{\n if (!mpModel) return false;\n mpModel->compileIfNecessary();\n\n mpReport = NULL;\n mCounter = 0;\n\n std::vector< CCopasiContainer * > ContainerList;\n ContainerList.push_back(mpModel);\n\n COptTask * pTask = dynamic_cast<COptTask *>(getObjectParent());\n if (pTask)\n {\n ContainerList.push_back(pTask);\n mpReport = &pTask->getReport();\n if (!mpReport->getStream()) mpReport = NULL;\n }\n\n mpSteadyState =\n dynamic_cast<CSteadyStateTask *>(GlobalKeys.get(* getValue(\"Steady-State\").pKEY));\n mpTrajectory =\n dynamic_cast<CTrajectoryTask *>(GlobalKeys.get(* getValue(\"Time-Course\").pKEY));\n\n if (!mpSteadyState && !mpTrajectory) return false;\n\n if (mpSteadyState) mpSteadyState->initialize();\n if (mpTrajectory) mpTrajectory->initialize();\n\n unsigned C_INT32 i;\n unsigned C_INT32 Size = mOptItemList.size();\n mUpdateMethods.resize(Size);\n mSolutionVariables.resize(Size);\n\n std::vector< COptItem * >::iterator it = mOptItemList.begin();\n std::vector< COptItem * >::iterator end = mOptItemList.end();\n\n for (i = 0; it != end; ++it, i++)\n {\n if (!(*it)->compile(ContainerList)) return false;\n mUpdateMethods[i] = (*it)->getUpdateMethod();\n }\n\n if (!mpFunction)\n mpFunction =\n dynamic_cast<CExpression *>(GlobalKeys.get(* getValue(\"ObjectiveFunction\").pKEY));\n\n if (!mpFunction) return false;\n\n return mpFunction->compile(ContainerList);\n}\n\nbool COptProblem::checkParametricConstraints()\n{\n std::vector< COptItem * >::const_iterator it = mOptItemList.begin();\n std::vector< COptItem * >::const_iterator end = mOptItemList.end();\n\n for (; it != end; ++it)\n if ((*it)->checkConstraint()) return false;\n\n return true;\n}\n\nbool COptProblem::checkFunctionalConstraints()\n{\n return true; \/\/ :TODO:\n}\n\n\/**\n * calculate() decides whether the problem is a steady state problem or a\n * trajectory problem based on whether the pointer to that type of problem\n * is null or not. It then calls the process() method for that type of \n * problem. Currently process takes ofstream& as a parameter but it will\n * change so that process() takes no parameters.\n *\/\nbool COptProblem::calculate()\n{\n try\n {\n if (mpSteadyState != NULL)\n {\n ((CSteadyStateProblem *) mpSteadyState->getProblem())->\n setInitialState(mpSteadyState->getProblem()->getModel()->getInitialState());\n mpSteadyState->process();\n }\n\n if (mpTrajectory != NULL)\n {\n ((CTrajectoryProblem *) mpTrajectory->getProblem())->\n setInitialState(mpTrajectory->getProblem()->getModel()->getInitialState());\n mpTrajectory->process();\n }\n\n mCalculateValue = mpFunction->calcValue();\n }\n\n catch (...)\n {\n mCalculateValue = DBL_MAX;\n }\n\n mCounter += 1;\n\n if (mpCallBack) return mpCallBack->progress(mhCounter);\n\n return true;\n}\n\nconst C_FLOAT64 & COptProblem::getCalculateValue() const\n{return mCalculateValue;}\n\nvoid COptProblem::setSolutionVariables(const CVector< C_FLOAT64 > & variables)\n{mSolutionVariables = variables;}\n\nconst CVector< C_FLOAT64 > & COptProblem::getSolutionVariables() const\n {return mSolutionVariables;}\n\nbool COptProblem::setSolutionValue(const C_FLOAT64 & value)\n{\n mSolutionValue = value;\n if (mpCallBack) return mpCallBack->progress(mhSolutionValue);\n\n return true;\n}\n\nconst C_FLOAT64 & COptProblem::getSolutionValue() const\n{return mSolutionValue;}\n\n\/\/ set the type of problem : Steady State OR Trajectory\nvoid COptProblem::setProblemType(ProblemType type)\n{\n \/\/ :TODO:\n if (type == SteadyState)\n mpSteadyState = new CSteadyStateTask(\/*this*\/NULL);\n if (type == Trajectory)\n mpTrajectory = new CTrajectoryTask(\/*this*\/NULL);\n}\n\nCOptItem & COptProblem::getOptItem(const unsigned C_INT32 & index)\n{\n assert (index < mOptItemList.size());\n return *mOptItemList[index];\n}\n\nconst unsigned C_INT32 COptProblem::getOptItemSize() const\n {return getValue(\"OptimizationItemList\").pGROUP->size();}\n\nCOptItem & COptProblem::addOptItem(const CCopasiObjectName & objectCN)\n{\n unsigned C_INT32 index = getOptItemSize();\n\n CCopasiParameterGroup * pOptimizationItemList = (CCopasiParameterGroup *) getParameter(\"OptimizationItemList\");\n\n pOptimizationItemList->addGroup(\"OptimizationItem\");\n\n CCopasiParameterGroup * pOptItem =\n (CCopasiParameterGroup *) pOptimizationItemList->getParameter(index);\n\n assert(pOptItem != NULL);\n\n COptItem * pTmp = new COptItem(*pOptItem);\n\n \/\/pTmp->setLowerBound(\n\n if (!pTmp->initialize(objectCN)) fatalError();\n\n mOptItemList.push_back(pTmp);\n\n return *pTmp;\n}\n\nbool COptProblem::removeOptItem(const unsigned C_INT32 & index)\n{\n if (!(index < mOptItemList.size())) return false;\n\n pdelete(mOptItemList[index]);\n mOptItemList.erase(mOptItemList.begin() + index);\n\n return ((CCopasiParameterGroup *) getParameter(\"OptimizationItemList\"))->removeParameter(index);\n}\n\nbool COptProblem::swapOptItem(const unsigned C_INT32 & iFrom,\n const unsigned C_INT32 & iTo)\n{\n if (!(iFrom < mOptItemList.size()) ||\n !(iTo < mOptItemList.size()))\n return false;\n\n COptItem * pTmp = mOptItemList[iFrom];\n mOptItemList[iFrom] = mOptItemList[iTo];\n mOptItemList[iTo] = pTmp;\n\n return ((CCopasiParameterGroup *) getParameter(\"OptimizationItemList\"))->swap(iFrom, iTo);\n}\n\nconst std::vector< COptItem * > & COptProblem::getOptItemList() const\n{return mOptItemList;}\n\nconst std::vector< UpdateMethod * > & COptProblem::getCalculateVariableUpdateMethods() const\n {return mUpdateMethods;}\n\nbool COptProblem::setObjectiveFunction(const std::string & infix)\n{\n if (!mpFunction) createObjectiveFunction();\n\n return mpFunction->setInfix(infix);\n}\n\nconst std::string COptProblem::getObjectiveFunction()\n{\n if (!mpFunction) createObjectiveFunction();\n\n return mpFunction->getInfix();\n}\n\nbool COptProblem::createObjectiveFunction()\n{\n mpFunction =\n dynamic_cast<CExpression *>(GlobalKeys.get(* getValue(\"ObjectiveFunction\").pKEY));\n\n CCopasiVectorN<CEvaluationTree> & FunctionList =\n CCopasiDataModel::Global->getFunctionList()->loadedFunctions();\n\n if (!mpFunction)\n {\n std::ostringstream Name;\n Name << \"Objective Function\";\n\n int i = 0;\n\n while (FunctionList.getIndex(Name.str()) != C_INVALID_INDEX)\n {\n i++;\n Name.str(\"\");\n Name << \"Objective Function \" << i;\n }\n\n mpFunction = new CExpression(Name.str(), this);\n FunctionList.add(mpFunction, false);\n\n setValue(\"ObjectiveFunction\", mpFunction->getKey());\n }\n else\n {\n mpFunction->setObjectParent(this);\n\n if (FunctionList.getIndex(mpFunction->getObjectName()) == C_INVALID_INDEX)\n FunctionList.add(mpFunction, false);\n }\n\n return true;\n}\n<commit_msg>The solution value is initialized to infinity.<commit_after>\/* Begin CVS Header\n $Source: \/Volumes\/Home\/Users\/shoops\/cvs\/copasi_dev\/copasi\/optimization\/COptProblem.cpp,v $\n $Revision: 1.50 $\n $Name: $\n $Author: shoops $ \n $Date: 2005\/07\/06 20:12:18 $\n End CVS Header *\/\n\n\/**\n * File name: COptProblem.cpp\n *\n * Programmer: Yongqun He\n * Contact email: yohe@vt.edu\n * Purpose: This is the source file of the COptProblem class.\n * It specifies the optimization problem with its own members and\n * functions. It's used by COptAlgorithm class and COptimization class\n *\/\n#include <float.h>\n\n#include \"copasi.h\"\n#include \"COptTask.h\"\n#include \"COptProblem.h\"\n#include \"COptItem.h\"\n\n#include \"function\/CFunctionDB.h\"\n\n#include \"CopasiDataModel\/CCopasiDataModel.h\"\n\n#include \"steadystate\/CSteadyStateTask.h\"\n#include \"trajectory\/CTrajectoryTask.h\"\n#include \"steadystate\/CSteadyStateProblem.h\"\n#include \"trajectory\/CTrajectoryProblem.h\"\n\n#include \"model\/CModel.h\"\n#include \"model\/CCompartment.h\"\n\n#include \"report\/CCopasiObjectReference.h\"\n#include \"report\/CKeyFactory.h\"\n\n#include \"utilities\/CProcessReport.h\"\n\n\/\/ Default constructor\nCOptProblem::COptProblem(const CCopasiContainer * pParent):\n CCopasiProblem(CCopasiTask::optimization, pParent),\n mpSteadyState(NULL),\n mpTrajectory(NULL),\n mpFunction(NULL),\n mOptItemList()\n{\n addGroup(\"OptimizationItemList\");\n addGroup(\"OptimizationConstraintList\");\n\n addParameter(\"Steady-State\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"Time-Course\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"ObjectiveFunction\", CCopasiParameter::KEY, (std::string) \"\");\n addParameter(\"Maximize\", CCopasiParameter::BOOL, (bool) false);\n\n initObjects();\n}\n\n\/\/ copy constructor\nCOptProblem::COptProblem(const COptProblem& src,\n const CCopasiContainer * pParent):\n CCopasiProblem(src, pParent),\n mpSteadyState(src.mpSteadyState),\n mpTrajectory(src.mpTrajectory),\n mpFunction(NULL),\n mOptItemList()\n{\n if (src.mpFunction)\n {\n createObjectiveFunction();\n mpFunction->setInfix(src.mpFunction->getInfix());\n setValue(\"ObjectiveFunction\", mpFunction->getKey());\n }\n\n initObjects();\n}\n\n\/\/ Destructor\nCOptProblem::~COptProblem()\n{\n std::vector<COptItem *>::iterator it = mOptItemList.begin();\n std::vector<COptItem *>::iterator end = mOptItemList.end();\n\n for (; it != end; ++it)\n pdelete(*it);\n\n if (mpFunction && CCopasiDataModel::Global && CCopasiDataModel::Global->getFunctionList())\n CCopasiDataModel::Global->getFunctionList()->loadedFunctions().remove(mpFunction->getObjectName());\n\n pdelete(mpFunction);\n}\n\nbool COptProblem::setModel(CModel * pModel)\n{\n mpModel = pModel;\n return true;\n}\n\nbool COptProblem::setCallBack(CProcessReport * pCallBack)\n{\n CCopasiProblem::setCallBack(pCallBack);\n\n if (pCallBack)\n {\n mhSolutionValue =\n mpCallBack->addItem(\"Best Value\",\n CCopasiParameter::DOUBLE,\n & mSolutionValue);\n mhCounter =\n mpCallBack->addItem(\"Simulation Counter\",\n CCopasiParameter::UINT,\n & mCounter);\n }\n\n return true;\n}\n\nvoid COptProblem::initObjects()\n{\n addObjectReference(\"Simulation Counter\", mCounter, CCopasiObject::ValueDbl);\n addObjectReference(\"Best Value\", mSolutionValue, CCopasiObject::ValueDbl);\n addVectorReference(\"Best Parameters\", mSolutionVariables, CCopasiObject::ValueDbl);\n}\n\n#ifdef WIN32 \n\/\/ warning C4056: overflow in floating-point constant arithmetic\n\/\/ warning C4756: overflow in constant arithmetic\n# pragma warning (disable: 4056 4756)\n#endif\n\nbool COptProblem::initialize()\n{\n if (!mpModel) return false;\n mpModel->compileIfNecessary();\n\n mpReport = NULL;\n mCounter = 0;\n mSolutionValue = DBL_MAX * 2;\n\n std::vector< CCopasiContainer * > ContainerList;\n ContainerList.push_back(mpModel);\n\n COptTask * pTask = dynamic_cast<COptTask *>(getObjectParent());\n if (pTask)\n {\n ContainerList.push_back(pTask);\n mpReport = &pTask->getReport();\n if (!mpReport->getStream()) mpReport = NULL;\n }\n\n mpSteadyState =\n dynamic_cast<CSteadyStateTask *>(GlobalKeys.get(* getValue(\"Steady-State\").pKEY));\n mpTrajectory =\n dynamic_cast<CTrajectoryTask *>(GlobalKeys.get(* getValue(\"Time-Course\").pKEY));\n\n if (!mpSteadyState && !mpTrajectory) return false;\n\n if (mpSteadyState) mpSteadyState->initialize();\n if (mpTrajectory) mpTrajectory->initialize();\n\n unsigned C_INT32 i;\n unsigned C_INT32 Size = mOptItemList.size();\n mUpdateMethods.resize(Size);\n mSolutionVariables.resize(Size);\n\n std::vector< COptItem * >::iterator it = mOptItemList.begin();\n std::vector< COptItem * >::iterator end = mOptItemList.end();\n\n for (i = 0; it != end; ++it, i++)\n {\n if (!(*it)->compile(ContainerList)) return false;\n mUpdateMethods[i] = (*it)->getUpdateMethod();\n }\n\n if (!mpFunction)\n mpFunction =\n dynamic_cast<CExpression *>(GlobalKeys.get(* getValue(\"ObjectiveFunction\").pKEY));\n\n if (!mpFunction) return false;\n\n return mpFunction->compile(ContainerList);\n}\n\n#ifdef WIN32\n# pragma warning (default: 4056 4756)\n#endif\n\nbool COptProblem::checkParametricConstraints()\n{\n std::vector< COptItem * >::const_iterator it = mOptItemList.begin();\n std::vector< COptItem * >::const_iterator end = mOptItemList.end();\n\n for (; it != end; ++it)\n if ((*it)->checkConstraint()) return false;\n\n return true;\n}\n\nbool COptProblem::checkFunctionalConstraints()\n{\n return true; \/\/ :TODO:\n}\n\n\/**\n * calculate() decides whether the problem is a steady state problem or a\n * trajectory problem based on whether the pointer to that type of problem\n * is null or not. It then calls the process() method for that type of \n * problem. Currently process takes ofstream& as a parameter but it will\n * change so that process() takes no parameters.\n *\/\nbool COptProblem::calculate()\n{\n try\n {\n if (mpSteadyState != NULL)\n {\n ((CSteadyStateProblem *) mpSteadyState->getProblem())->\n setInitialState(mpSteadyState->getProblem()->getModel()->getInitialState());\n mpSteadyState->process();\n }\n\n if (mpTrajectory != NULL)\n {\n ((CTrajectoryProblem *) mpTrajectory->getProblem())->\n setInitialState(mpTrajectory->getProblem()->getModel()->getInitialState());\n mpTrajectory->process();\n }\n\n mCalculateValue = mpFunction->calcValue();\n }\n\n catch (...)\n {\n mCalculateValue = DBL_MAX;\n }\n\n mCounter += 1;\n\n if (mpCallBack) return mpCallBack->progress(mhCounter);\n\n return true;\n}\n\nconst C_FLOAT64 & COptProblem::getCalculateValue() const\n{return mCalculateValue;}\n\nvoid COptProblem::setSolutionVariables(const CVector< C_FLOAT64 > & variables)\n{mSolutionVariables = variables;}\n\nconst CVector< C_FLOAT64 > & COptProblem::getSolutionVariables() const\n {return mSolutionVariables;}\n\nbool COptProblem::setSolutionValue(const C_FLOAT64 & value)\n{\n mSolutionValue = value;\n if (mpCallBack) return mpCallBack->progress(mhSolutionValue);\n\n return true;\n}\n\nconst C_FLOAT64 & COptProblem::getSolutionValue() const\n{return mSolutionValue;}\n\n\/\/ set the type of problem : Steady State OR Trajectory\nvoid COptProblem::setProblemType(ProblemType type)\n{\n \/\/ :TODO:\n if (type == SteadyState)\n mpSteadyState = new CSteadyStateTask(\/*this*\/NULL);\n if (type == Trajectory)\n mpTrajectory = new CTrajectoryTask(\/*this*\/NULL);\n}\n\nCOptItem & COptProblem::getOptItem(const unsigned C_INT32 & index)\n{\n assert (index < mOptItemList.size());\n return *mOptItemList[index];\n}\n\nconst unsigned C_INT32 COptProblem::getOptItemSize() const\n {return getValue(\"OptimizationItemList\").pGROUP->size();}\n\nCOptItem & COptProblem::addOptItem(const CCopasiObjectName & objectCN)\n{\n unsigned C_INT32 index = getOptItemSize();\n\n CCopasiParameterGroup * pOptimizationItemList = (CCopasiParameterGroup *) getParameter(\"OptimizationItemList\");\n\n pOptimizationItemList->addGroup(\"OptimizationItem\");\n\n CCopasiParameterGroup * pOptItem =\n (CCopasiParameterGroup *) pOptimizationItemList->getParameter(index);\n\n assert(pOptItem != NULL);\n\n COptItem * pTmp = new COptItem(*pOptItem);\n\n \/\/pTmp->setLowerBound(\n\n if (!pTmp->initialize(objectCN)) fatalError();\n\n mOptItemList.push_back(pTmp);\n\n return *pTmp;\n}\n\nbool COptProblem::removeOptItem(const unsigned C_INT32 & index)\n{\n if (!(index < mOptItemList.size())) return false;\n\n pdelete(mOptItemList[index]);\n mOptItemList.erase(mOptItemList.begin() + index);\n\n return ((CCopasiParameterGroup *) getParameter(\"OptimizationItemList\"))->removeParameter(index);\n}\n\nbool COptProblem::swapOptItem(const unsigned C_INT32 & iFrom,\n const unsigned C_INT32 & iTo)\n{\n if (!(iFrom < mOptItemList.size()) ||\n !(iTo < mOptItemList.size()))\n return false;\n\n COptItem * pTmp = mOptItemList[iFrom];\n mOptItemList[iFrom] = mOptItemList[iTo];\n mOptItemList[iTo] = pTmp;\n\n return ((CCopasiParameterGroup *) getParameter(\"OptimizationItemList\"))->swap(iFrom, iTo);\n}\n\nconst std::vector< COptItem * > & COptProblem::getOptItemList() const\n{return mOptItemList;}\n\nconst std::vector< UpdateMethod * > & COptProblem::getCalculateVariableUpdateMethods() const\n {return mUpdateMethods;}\n\nbool COptProblem::setObjectiveFunction(const std::string & infix)\n{\n if (!mpFunction) createObjectiveFunction();\n\n return mpFunction->setInfix(infix);\n}\n\nconst std::string COptProblem::getObjectiveFunction()\n{\n if (!mpFunction) createObjectiveFunction();\n\n return mpFunction->getInfix();\n}\n\nbool COptProblem::createObjectiveFunction()\n{\n mpFunction =\n dynamic_cast<CExpression *>(GlobalKeys.get(* getValue(\"ObjectiveFunction\").pKEY));\n\n CCopasiVectorN<CEvaluationTree> & FunctionList =\n CCopasiDataModel::Global->getFunctionList()->loadedFunctions();\n\n if (!mpFunction)\n {\n std::ostringstream Name;\n Name << \"Objective Function\";\n\n int i = 0;\n\n while (FunctionList.getIndex(Name.str()) != C_INVALID_INDEX)\n {\n i++;\n Name.str(\"\");\n Name << \"Objective Function \" << i;\n }\n\n mpFunction = new CExpression(Name.str(), this);\n FunctionList.add(mpFunction, false);\n\n setValue(\"ObjectiveFunction\", mpFunction->getKey());\n }\n else\n {\n mpFunction->setObjectParent(this);\n\n if (FunctionList.getIndex(mpFunction->getObjectName()) == C_INVALID_INDEX)\n FunctionList.add(mpFunction, false);\n }\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This is part of the FL library, a C++ Bayesian filtering library\n * (https:\/\/github.com\/filtering-library)\n *\n * Copyright (c) 2014 Jan Issac (jan.issac@gmail.com)\n * Copyright (c) 2014 Manuel Wuthrich (manuel.wuthrich@gmail.com)\n *\n * Max-Planck Institute for Intelligent Systems, AMD Lab\n * University of Southern California, CLMC Lab\n *\n * This Source Code Form is subject to the terms of the MIT License (MIT).\n * A copy of the license can be found in the LICENSE file distributed with this\n * source code.\n *\/\n\n\/**\n * \\file sigma_point_additive_prediction_policy.hpp\n * \\date July 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__FILTER__GAUSSIAN__SIGMA_POINT_ADDITIVE_PREDICTION_POLICY_HPP\n#define FL__FILTER__GAUSSIAN__SIGMA_POINT_ADDITIVE_PREDICTION_POLICY_HPP\n\n#include <Eigen\/Dense>\n\n#include <fl\/util\/meta.hpp>\n#include <fl\/util\/traits.hpp>\n#include <fl\/filter\/gaussian\/transform\/point_set.hpp>\n#include <fl\/filter\/gaussian\/quadrature\/sigma_point_quadrature.hpp>\n\nnamespace fl\n{\n\n\/\/ Forward declarations\ntemplate <typename...> class SigmaPointPredictPolicy;\n\ntemplate <\n typename SigmaPointQuadrature,\n typename AdditiveStateTransitionFunction\n>\nclass SigmaPointPredictPolicy<\n SigmaPointQuadrature,\n Additive<AdditiveStateTransitionFunction>>\n{\npublic:\n typedef typename AdditiveStateTransitionFunction::State State;\n typedef typename AdditiveStateTransitionFunction::Input Input;\n\n enum : signed int\n {\n NumberOfPoints = SigmaPointQuadrature\n ::number_of_points(SizeOf<State>::Value)\n };\n\n typedef PointSet<State, NumberOfPoints> StatePointSet;\n\n template <\n typename Belief\n >\n void operator()(const AdditiveStateTransitionFunction&\n additive_state_transition_function,\n const SigmaPointQuadrature& quadrature,\n const Belief& prior_belief,\n const Input& u,\n Belief& predicted_belief)\n {\n auto&& f = [=](const State& x)\n {\n return additive_state_transition_function.expected_state(x, u);\n };\n\n quadrature.integrate_to_points(f, prior_belief, Y, Z);\n\n \/*\n * Obtain the centered points matrix of the prediction. The columns of\n * this matrix are the predicted points with zero mean. That is, the\n * sum of the columns in P is zero.\n *\n * P = [X_r[1]-mu_r X_r[2]-mu_r ... X_r[n]-mu_r]\n *\n * with weighted mean\n *\n * mu_r = Sum w_mean[i] X_r[i]\n *\/\n auto&& X_c = Z.centered_points();\n\n \/*\n * Obtain the weights of point as a vector\n *\n * W = [w_cov[1] w_cov[2] ... w_cov[n]]\n *\n * Note that the covariance weights are used.\n *\/\n auto&& W = Z.covariance_weights_vector();\n\n \/*\n * Compute and set the moments\n *\n * The first moment is simply the weighted mean of points.\n * The second centered moment is determined by\n *\n * C = Sum W[i,i] * (X_r[i]-mu_r)(X_r[i]-mu_r)^T\n * = P * W * P^T\n *\n * given that W is the diagonal matrix\n *\/\n predicted_belief.mean(Z.mean());\n predicted_belief.covariance(\n X_c * W.asDiagonal() * X_c.transpose()\n + additive_state_transition_function.noise_covariance());\n }\n\nprotected:\n StatePointSet Y;\n StatePointSet Z;\n};\n\n}\n\n#endif\n<commit_msg>Implements Descriptor<commit_after>\/*\n * This is part of the FL library, a C++ Bayesian filtering library\n * (https:\/\/github.com\/filtering-library)\n *\n * Copyright (c) 2014 Jan Issac (jan.issac@gmail.com)\n * Copyright (c) 2014 Manuel Wuthrich (manuel.wuthrich@gmail.com)\n *\n * Max-Planck Institute for Intelligent Systems, AMD Lab\n * University of Southern California, CLMC Lab\n *\n * This Source Code Form is subject to the terms of the MIT License (MIT).\n * A copy of the license can be found in the LICENSE file distributed with this\n * source code.\n *\/\n\n\/**\n * \\file sigma_point_additive_prediction_policy.hpp\n * \\date July 2015\n * \\author Jan Issac (jan.issac@gmail.com)\n *\/\n\n#ifndef FL__FILTER__GAUSSIAN__SIGMA_POINT_ADDITIVE_PREDICTION_POLICY_HPP\n#define FL__FILTER__GAUSSIAN__SIGMA_POINT_ADDITIVE_PREDICTION_POLICY_HPP\n\n#include <Eigen\/Dense>\n\n#include <fl\/util\/meta.hpp>\n#include <fl\/util\/traits.hpp>\n#include <fl\/util\/descriptor.hpp>\n#include <fl\/filter\/gaussian\/transform\/point_set.hpp>\n#include <fl\/filter\/gaussian\/quadrature\/sigma_point_quadrature.hpp>\n\nnamespace fl\n{\n\n\/\/ Forward declarations\ntemplate <typename...> class SigmaPointPredictPolicy;\n\ntemplate <\n typename SigmaPointQuadrature,\n typename AdditiveStateTransitionFunction\n>\nclass SigmaPointPredictPolicy<\n SigmaPointQuadrature,\n Additive<AdditiveStateTransitionFunction>>\n : public Descriptor\n{\npublic:\n typedef typename AdditiveStateTransitionFunction::State State;\n typedef typename AdditiveStateTransitionFunction::Input Input;\n\n enum : signed int\n {\n NumberOfPoints = SigmaPointQuadrature\n ::number_of_points(SizeOf<State>::Value)\n };\n\n typedef PointSet<State, NumberOfPoints> StatePointSet;\n\n template <\n typename Belief\n >\n void operator()(const AdditiveStateTransitionFunction&\n additive_state_transition_function,\n const SigmaPointQuadrature& quadrature,\n const Belief& prior_belief,\n const Input& u,\n Belief& predicted_belief)\n {\n auto&& f = [=](const State& x)\n {\n return additive_state_transition_function.expected_state(x, u);\n };\n\n quadrature.integrate_to_points(f, prior_belief, Y, Z);\n\n \/*\n * Obtain the centered points matrix of the prediction. The columns of\n * this matrix are the predicted points with zero mean. That is, the\n * sum of the columns in P is zero.\n *\n * P = [X_r[1]-mu_r X_r[2]-mu_r ... X_r[n]-mu_r]\n *\n * with weighted mean\n *\n * mu_r = Sum w_mean[i] X_r[i]\n *\/\n auto&& X_c = Z.centered_points();\n\n \/*\n * Obtain the weights of point as a vector\n *\n * W = [w_cov[1] w_cov[2] ... w_cov[n]]\n *\n * Note that the covariance weights are used.\n *\/\n auto&& W = Z.covariance_weights_vector();\n\n \/*\n * Compute and set the moments\n *\n * The first moment is simply the weighted mean of points.\n * The second centered moment is determined by\n *\n * C = Sum W[i,i] * (X_r[i]-mu_r)(X_r[i]-mu_r)^T\n * = P * W * P^T\n *\n * given that W is the diagonal matrix\n *\/\n predicted_belief.mean(Z.mean());\n predicted_belief.covariance(\n X_c * W.asDiagonal() * X_c.transpose()\n + additive_state_transition_function.noise_covariance());\n }\n\n virtual std::string name() const\n {\n return \"SigmaPointPredictPolicy<\"\n + list_arguments(\n \"SigmaPointQuadrature\",\n \"Additive<AdditiveStateTransitionFunction>\")\n + \">\";\n }\n\n virtual std::string description() const\n {\n return \"Sigma Point based filter prediction policy for state transition\"\n \" model with additive noise\";\n }\n\nprotected:\n StatePointSet Y;\n StatePointSet Z;\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by monty on 23\/11\/15.\n\/\/\n\n#include <GLES2\/gl2.h>\n#include <GLES2\/gl2ext.h>\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include <string>\n#include \"GLES2Lesson.h\"\n#include \"NdkGlue.h\"\n\n\/\/Counter Clockwise\nconst float GLES2Lesson::cubeVertices[]{\n\/\/ 4________5\n\/\/ \/| \/|\n\/\/ \/ | \/ |\n\/\/ 0\/__|___1_\/ |\n\/\/ | 7|____|___|6\n\/\/ | \/ | \/\n\/\/ | \/ | \/\n\/\/ 3|\/______|\/2\n\/\/x, y, z, r, g, b, u, v\n -1.0f, 1.0f, 1.0f, 0.0f, 1.0f, \/\/0\n 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, \/\/1\n 1.0f, -1.0f, 1.0f, 1.0f, 0.0f, \/\/2\n -1.0f, -1.0f, 1.0f, 0.0f, 0.0f, \/\/3\n -1.0f, 1.0f, -1.0f, 0.0f, 0.0f, \/\/4\n 1.0f, 1.0f, -1.0f, 1.0f, 0.0f, \/\/5\n 1.0f, -1.0f, -1.0f, 1.0f, 1.0f, \/\/6\n -1.0f, -1.0f, -1.0f, 0.0f, 1.0f, \/\/7\n\n -1.0f, 1.0f, 1.0f, 1.0f, 1.0f, \/\/0\n 1.0f, 1.0f, 1.0f, 0.0f, 1.0f, \/\/1\n 1.0f, -1.0f, 1.0f, 0.0f, 0.0f, \/\/2\n -1.0f, -1.0f, 1.0f, 1.0f, 0.0f, \/\/3\n -1.0f, 1.0f, -1.0f, 0.0f, 1.0f, \/\/4\n 1.0f, 1.0f, -1.0f, 1.0f, 1.0f, \/\/5\n 1.0f, -1.0f, -1.0f, 1.0f, 0.0f, \/\/6\n -1.0f, -1.0f, -1.0f, 0.0f, 0.0f \/\/7\n};\n\nconst unsigned short GLES2Lesson::cubeIndices[]{\n 0, 1, 2,\n 0, 2, 3,\n\n 5, 4, 7,\n 5, 7, 6,\n\n 4, 5, 1,\n 0, 4, 1,\n\n 6, 7, 2,\n 2, 7, 3,\n\n 9, 13, 14,\n 9, 14, 10,\n\n 12, 8, 15,\n 8, 11, 15\n};\n\nGLuint CreateSimpleTexture2D() {\n \/\/ Texture object handle\n GLuint textureId = 0;\n\n \/\/ 2x2 Image, 3 bytes per pixel (R, G, B)\n GLubyte pixels[4 * 3] =\n {\n 255, 0, 0, \/\/ Red\n 0, 255, 0, \/\/ Green\n 0, 0, 255, \/\/ Blue\n 255, 255, 0 \/\/ Yellow\n };\n\n \/\/ Use tightly packed data\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n \/\/ Generate a texture object\n glGenTextures(1, &textureId);\n\n \/\/ Bind the texture object\n glBindTexture(GL_TEXTURE_2D, textureId);\n\n \/\/ Load the texture\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 2, 2, 0, GL_RGB, GL_UNSIGNED_BYTE, pixels);\n\n \/\/ Set the filtering mode\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n return textureId;\n\n}\n\n\nextern void printGLString(const char *name, GLenum s) {\n const char *v = (const char *) glGetString(s);\n LOGI(\"GL %s = %s\\n\", name, v);\n}\n\nextern void checkGlError(const char *op) {\n for (GLint error = glGetError(); error; error = glGetError()) {\n LOGI(\"after %s() glError (0x%x)\\n\", op, error);\n }\n}\n\nGLuint GLES2Lesson::loadShader(GLenum shaderType, const char *pSource) {\n GLuint shader = glCreateShader(shaderType);\n if (shader) {\n glShaderSource(shader, 1, &pSource, NULL);\n glCompileShader(shader);\n GLint compiled = 0;\n glGetShaderiv(shader, GL_COMPILE_STATUS, &compiled);\n if (!compiled) {\n GLint infoLen = 0;\n glGetShaderiv(shader, GL_INFO_LOG_LENGTH, &infoLen);\n if (infoLen) {\n char *buf = (char *) malloc(infoLen);\n if (buf) {\n glGetShaderInfoLog(shader, infoLen, NULL, buf);\n LOGE(\"Could not compile shader %d:\\n%s\\n\", shaderType, buf);\n free(buf);\n }\n glDeleteShader(shader);\n shader = 0;\n }\n }\n }\n return shader;\n}\n\nGLuint GLES2Lesson::createProgram(const char *pVertexSource, const char *pFragmentSource) {\n GLuint vertexShader = loadShader(GL_VERTEX_SHADER, pVertexSource);\n if (!vertexShader) {\n return 0;\n }\n\n GLuint pixelShader = loadShader(GL_FRAGMENT_SHADER, pFragmentSource);\n if (!pixelShader) {\n return 0;\n }\n\n GLuint program = glCreateProgram();\n if (program) {\n glAttachShader(program, vertexShader);\n checkGlError(\"glAttachShader\");\n glAttachShader(program, pixelShader);\n checkGlError(\"glAttachShader\");\n glLinkProgram(program);\n GLint linkStatus = GL_FALSE;\n glGetProgramiv(program, GL_LINK_STATUS, &linkStatus);\n if (linkStatus != GL_TRUE) {\n GLint bufLength = 0;\n glGetProgramiv(program, GL_INFO_LOG_LENGTH, &bufLength);\n if (bufLength) {\n char *buf = (char *) malloc(bufLength);\n if (buf) {\n glGetProgramInfoLog(program, bufLength, NULL, buf);\n LOGE(\"Could not link program:\\n%s\\n\", buf);\n free(buf);\n }\n }\n glDeleteProgram(program);\n program = 0;\n }\n }\n return program;\n}\n\nvoid GLES2Lesson::printVerboseDriverInformation() {\n printGLString(\"Version\", GL_VERSION);\n printGLString(\"Vendor\", GL_VENDOR);\n printGLString(\"Renderer\", GL_RENDERER);\n printGLString(\"Extensions\", GL_EXTENSIONS);\n}\n\nGLES2Lesson::GLES2Lesson() {\n\/\/start off as identity - late we will init it with proper values.\n cubeTransformMatrix = glm::mat4(1.0f);\n projectionMatrix = glm::mat4(1.0f);\n\n vertexAttributePosition = 0;\n modelMatrixAttributePosition = 0;\n projectionMatrixAttributePosition = 0;\n gProgram = 0;\n cubeRotationAngleYZ = 0.0f;\n cubeRotationAngleXZ = 0.0f;\n}\n\nGLES2Lesson::~GLES2Lesson() {\n deleteVBOs();\n}\n\nbool GLES2Lesson::init(float w, float h, const std::string &vertexShader,\n const std::string &fragmentShader) {\n\n printVerboseDriverInformation();\n\n gProgram = createProgram(vertexShader.c_str(), fragmentShader.c_str());\n\n if (!gProgram) {\n LOGE(\"Could not create program.\");\n return false;\n }\n\n fetchShaderLocations();\n\n glViewport(0, 0, w, h);\n checkGlError(\"glViewport\");\n\n projectionMatrix = glm::perspective(45.0f, w \/ h, 0.1f, 100.0f);\n\n createVBOs();\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n glFrontFace(GL_CW);\n glDepthMask(true);\n return true;\n}\n\nvoid GLES2Lesson::resetTransformMatrices() {\n glm::mat4 identity = glm::mat4(1.0f);\n glm::vec3 translate = glm::vec3(0.0f, 0.0f, -6.0f);\n glm::vec3 xAxis = glm::vec3(1.0f, 0.0f, 0.0f);\n glm::vec3 yAxis = glm::vec3(0.0f, 1.0f, 0.0f);\n glm::mat4 translated = glm::translate(identity, translate);\n glm::mat4 rotatedAroundXAxis = glm::rotate(translated, cubeRotationAngleYZ, xAxis);\n glm::mat4 rotatedAroundYAxis = glm::rotate(rotatedAroundXAxis, cubeRotationAngleXZ, yAxis);\n cubeTransformMatrix = rotatedAroundYAxis;\n}\n\nvoid GLES2Lesson::fetchShaderLocations() {\n\n vertexAttributePosition = glGetAttribLocation(gProgram, \"aPosition\");\n modelMatrixAttributePosition = glGetUniformLocation(gProgram, \"uModel\");\n projectionMatrixAttributePosition = glGetUniformLocation(gProgram, \"uProjection\");\n samplerUniformPosition = glGetUniformLocation(gProgram, \"sTexture\");\n textureCoordinatesAttributePosition = glGetAttribLocation(gProgram, \"aTexCoord\");\n}\n\nvoid GLES2Lesson::drawGeometry(const int vertexVbo, const int indexVbo, int vertexCount,\n const glm::mat4 &transform) {\n\n glBindBuffer(GL_ARRAY_BUFFER, vertexVbo);\n glEnableVertexAttribArray(vertexAttributePosition);\n glEnableVertexAttribArray(textureCoordinatesAttributePosition);\n\n glUniform1i(samplerUniformPosition, 0);\n\n glUniformMatrix4fv(modelMatrixAttributePosition, 1, false, &transform[0][0]);\n glVertexAttribPointer(vertexAttributePosition, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 5, 0);\n glVertexAttribPointer(textureCoordinatesAttributePosition, 2, GL_FLOAT, GL_TRUE,\n sizeof(float) * 5, (void *) (sizeof(float) * 3));\n\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexVbo);\n glDrawElements(GL_TRIANGLES, vertexCount, GL_UNSIGNED_SHORT, 0);\n\n glDisableVertexAttribArray(vertexAttributePosition);\n glDisableVertexAttribArray(textureCoordinatesAttributePosition);\n\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nvoid GLES2Lesson::deleteVBOs() {\n glDeleteBuffers(1, &vboCubeVertexDataIndex);\n glDeleteBuffers(1, &vboCubeVertexIndicesIndex);\n}\n\nvoid GLES2Lesson::createVBOs() {\n glGenBuffers(1, &vboCubeVertexDataIndex);\n glBindBuffer(GL_ARRAY_BUFFER, vboCubeVertexDataIndex);\n glBufferData(GL_ARRAY_BUFFER, 16 * sizeof(float) * 5, cubeVertices, GL_STATIC_DRAW);\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n textureId = CreateSimpleTexture2D();\n\n glGenBuffers(1, &vboCubeVertexIndicesIndex);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, vboCubeVertexIndicesIndex);\n glBufferData(GL_ELEMENT_ARRAY_BUFFER, 36 * sizeof(GLushort), cubeIndices, GL_STATIC_DRAW);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nvoid GLES2Lesson::clearBuffers() {\n glClearColor(0.5f, 0.5f, 0.5f, 1.0f);\n glClearDepthf(1.0f);\n checkGlError(\"glClearColor\");\n glClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n checkGlError(\"glClear\");\n}\n\nvoid GLES2Lesson::setPerspective() {\n glUniformMatrix4fv(projectionMatrixAttributePosition, 1, false, &projectionMatrix[0][0]);\n}\n\nvoid GLES2Lesson::prepareShaderProgram() {\n glUseProgram(gProgram);\n checkGlError(\"glUseProgram\");\n}\n\nvoid GLES2Lesson::render() {\n clearBuffers();\n prepareShaderProgram();\n setPerspective();\n resetTransformMatrices();\n\n drawGeometry(vboCubeVertexDataIndex,\n vboCubeVertexIndicesIndex,\n 36,\n cubeTransformMatrix\n );\n}\n\nvoid GLES2Lesson::setTexture(void **bitmapData, int size) {\n\/\/ glBindBuffer( GL_ARRAY_BUFFER, vboCubeVertexDataIndex );\n\/\/ glBindTexture( GL_TEXTURE_2D, 0 );\n\/\/ glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\/\/ glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\/\/ glBufferData( GL_ARRAY_BUFFER, size, bitmapData, GL_STATIC_DRAW );\n\/\/ glBindBuffer( GL_ARRAY_BUFFER, 0 );\n}\n\nvoid GLES2Lesson::tick() {\n cubeRotationAngleYZ += 0.5f;\n cubeRotationAngleXZ += 1.0f;\n}\n\nvoid GLES2Lesson::shutdown() {\n LOGI(\"Shutdown!\\n\");\n}<commit_msg>Kinda fix the Texture Coordinates for Lesson 06<commit_after>\/\/\n\/\/ Created by monty on 23\/11\/15.\n\/\/\n\n#include <GLES2\/gl2.h>\n#include <GLES2\/gl2ext.h>\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include <string>\n#include \"GLES2Lesson.h\"\n#include \"NdkGlue.h\"\n\n\/\/Counter Clockwise\nconst float GLES2Lesson::cubeVertices[]{\n\/\/ 4________5\n\/\/ \/| \/|\n\/\/ \/ | \/ |\n\/\/ 0\/__|___1_\/ |\n\/\/ | 7|____|___|6\n\/\/ | \/ | \/\n\/\/ | \/ | \/\n\/\/ 3|\/______|\/2\n\/\/x, y, z, r, g, b, u, v\n -1.0f, 1.0f, 1.0f, 0.0f, 1.0f, \/\/0\n 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, \/\/1\n 1.0f, -1.0f, 1.0f, 1.0f, 0.0f, \/\/2\n -1.0f, -1.0f, 1.0f, 0.0f, 0.0f, \/\/3\n -1.0f, 1.0f, -1.0f, 0.0f, 0.0f, \/\/4\n 1.0f, 1.0f, -1.0f, 1.0f, 0.0f, \/\/5\n 1.0f, -1.0f, -1.0f, 1.0f, 1.0f, \/\/6\n -1.0f, -1.0f, -1.0f, 0.0f, 1.0f, \/\/7\n\n -1.0f, 1.0f, 1.0f, 0.0f, 1.0f, \/\/0\n 1.0f, 1.0f, 1.0f, 1.0f, 1.0f, \/\/1\n 1.0f, -1.0f, 1.0f, 1.0f, 0.0f, \/\/2\n -1.0f, -1.0f, 1.0f, 0.0f, 0.0f, \/\/3\n -1.0f, 1.0f, -1.0f, 1.0f, 1.0f, \/\/4\n 1.0f, 1.0f, -1.0f, 0.0f, 1.0f, \/\/5\n 1.0f, -1.0f, -1.0f, 0.0f, 0.0f, \/\/6\n -1.0f, -1.0f, -1.0f, 1.0f, 0.0f \/\/7\n};\n\nconst unsigned short GLES2Lesson::cubeIndices[]{\n 0, 1, 2,\n 0, 2, 3,\n\n 5, 4, 7,\n 5, 7, 6,\n\n 4, 5, 1,\n 0, 4, 1,\n\n 6, 7, 2,\n 2, 7, 3,\n\n 9, 13, 14,\n 9, 14, 10,\n\n 12, 8, 15,\n 8, 11, 15\n};\n\nGLuint CreateSimpleTexture2D() {\n \/\/ Texture object handle\n GLuint textureId = 0;\n\n \/\/ 2x2 Image, 3 bytes per pixel (R, G, B)\n GLubyte pixels[4 * 3] =\n {\n 255, 0, 0, \/\/ Red\n 0, 255, 0, \/\/ Green\n 0, 0, 255, \/\/ Blue\n 255, 255, 0 \/\/ Yellow\n };\n\n \/\/ Use tightly packed data\n glPixelStorei(GL_UNPACK_ALIGNMENT, 1);\n\n \/\/ Generate a texture object\n glGenTextures(1, &textureId);\n\n \/\/ Bind the texture object\n glBindTexture(GL_TEXTURE_2D, textureId);\n\n \/\/ Load the texture\n glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, 2, 2, 0, GL_RGB, GL_UNSIGNED_BYTE, pixels);\n\n \/\/ Set the filtering mode\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST);\n glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_NEAREST);\n\n return textureId;\n\n}\n\n\nextern void printGLString(const char *name, GLenum s) {\n const char *v = (const char *) glGetString(s);\n LOGI(\"GL %s = %s\\n\", name, v);\n}\n\nextern void checkGlError(const char *op) {\n for (GLint error = glGetError(); error; error = glGetError()) {\n LOGI(\"after %s() glError (0x%x)\\n\", op, error);\n }\n}\n\nGLuint GLES2Lesson::loadShader(GLenum shaderType, const char *pSource) {\n GLuint shader = glCreateShader(shaderType);\n if (shader) {\n glShaderSource(shader, 1, &pSource, NULL);\n glCompileShader(shader);\n GLint compiled = 0;\n glGetShaderiv(shader, GL_COMPILE_STATUS, &compiled);\n if (!compiled) {\n GLint infoLen = 0;\n glGetShaderiv(shader, GL_INFO_LOG_LENGTH, &infoLen);\n if (infoLen) {\n char *buf = (char *) malloc(infoLen);\n if (buf) {\n glGetShaderInfoLog(shader, infoLen, NULL, buf);\n LOGE(\"Could not compile shader %d:\\n%s\\n\", shaderType, buf);\n free(buf);\n }\n glDeleteShader(shader);\n shader = 0;\n }\n }\n }\n return shader;\n}\n\nGLuint GLES2Lesson::createProgram(const char *pVertexSource, const char *pFragmentSource) {\n GLuint vertexShader = loadShader(GL_VERTEX_SHADER, pVertexSource);\n if (!vertexShader) {\n return 0;\n }\n\n GLuint pixelShader = loadShader(GL_FRAGMENT_SHADER, pFragmentSource);\n if (!pixelShader) {\n return 0;\n }\n\n GLuint program = glCreateProgram();\n if (program) {\n glAttachShader(program, vertexShader);\n checkGlError(\"glAttachShader\");\n glAttachShader(program, pixelShader);\n checkGlError(\"glAttachShader\");\n glLinkProgram(program);\n GLint linkStatus = GL_FALSE;\n glGetProgramiv(program, GL_LINK_STATUS, &linkStatus);\n if (linkStatus != GL_TRUE) {\n GLint bufLength = 0;\n glGetProgramiv(program, GL_INFO_LOG_LENGTH, &bufLength);\n if (bufLength) {\n char *buf = (char *) malloc(bufLength);\n if (buf) {\n glGetProgramInfoLog(program, bufLength, NULL, buf);\n LOGE(\"Could not link program:\\n%s\\n\", buf);\n free(buf);\n }\n }\n glDeleteProgram(program);\n program = 0;\n }\n }\n return program;\n}\n\nvoid GLES2Lesson::printVerboseDriverInformation() {\n printGLString(\"Version\", GL_VERSION);\n printGLString(\"Vendor\", GL_VENDOR);\n printGLString(\"Renderer\", GL_RENDERER);\n printGLString(\"Extensions\", GL_EXTENSIONS);\n}\n\nGLES2Lesson::GLES2Lesson() {\n\/\/start off as identity - late we will init it with proper values.\n cubeTransformMatrix = glm::mat4(1.0f);\n projectionMatrix = glm::mat4(1.0f);\n\n vertexAttributePosition = 0;\n modelMatrixAttributePosition = 0;\n projectionMatrixAttributePosition = 0;\n gProgram = 0;\n cubeRotationAngleYZ = 0.0f;\n cubeRotationAngleXZ = 0.0f;\n}\n\nGLES2Lesson::~GLES2Lesson() {\n deleteVBOs();\n}\n\nbool GLES2Lesson::init(float w, float h, const std::string &vertexShader,\n const std::string &fragmentShader) {\n\n printVerboseDriverInformation();\n\n gProgram = createProgram(vertexShader.c_str(), fragmentShader.c_str());\n\n if (!gProgram) {\n LOGE(\"Could not create program.\");\n return false;\n }\n\n fetchShaderLocations();\n\n glViewport(0, 0, w, h);\n checkGlError(\"glViewport\");\n\n projectionMatrix = glm::perspective(45.0f, w \/ h, 0.1f, 100.0f);\n\n createVBOs();\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n glFrontFace(GL_CW);\n glDepthMask(true);\n return true;\n}\n\nvoid GLES2Lesson::resetTransformMatrices() {\n glm::mat4 identity = glm::mat4(1.0f);\n glm::vec3 translate = glm::vec3(0.0f, 0.0f, -6.0f);\n glm::vec3 xAxis = glm::vec3(1.0f, 0.0f, 0.0f);\n glm::vec3 yAxis = glm::vec3(0.0f, 1.0f, 0.0f);\n glm::mat4 translated = glm::translate(identity, translate);\n glm::mat4 rotatedAroundXAxis = glm::rotate(translated, cubeRotationAngleYZ, xAxis);\n glm::mat4 rotatedAroundYAxis = glm::rotate(rotatedAroundXAxis, cubeRotationAngleXZ, yAxis);\n cubeTransformMatrix = rotatedAroundYAxis;\n}\n\nvoid GLES2Lesson::fetchShaderLocations() {\n\n vertexAttributePosition = glGetAttribLocation(gProgram, \"aPosition\");\n modelMatrixAttributePosition = glGetUniformLocation(gProgram, \"uModel\");\n projectionMatrixAttributePosition = glGetUniformLocation(gProgram, \"uProjection\");\n samplerUniformPosition = glGetUniformLocation(gProgram, \"sTexture\");\n textureCoordinatesAttributePosition = glGetAttribLocation(gProgram, \"aTexCoord\");\n}\n\nvoid GLES2Lesson::drawGeometry(const int vertexVbo, const int indexVbo, int vertexCount,\n const glm::mat4 &transform) {\n\n glBindBuffer(GL_ARRAY_BUFFER, vertexVbo);\n glEnableVertexAttribArray(vertexAttributePosition);\n glEnableVertexAttribArray(textureCoordinatesAttributePosition);\n\n glUniform1i(samplerUniformPosition, 0);\n\n glUniformMatrix4fv(modelMatrixAttributePosition, 1, false, &transform[0][0]);\n glVertexAttribPointer(vertexAttributePosition, 3, GL_FLOAT, GL_FALSE, sizeof(float) * 5, 0);\n glVertexAttribPointer(textureCoordinatesAttributePosition, 2, GL_FLOAT, GL_TRUE,\n sizeof(float) * 5, (void *) (sizeof(float) * 3));\n\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, indexVbo);\n glDrawElements(GL_TRIANGLES, vertexCount, GL_UNSIGNED_SHORT, 0);\n\n glDisableVertexAttribArray(vertexAttributePosition);\n glDisableVertexAttribArray(textureCoordinatesAttributePosition);\n\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nvoid GLES2Lesson::deleteVBOs() {\n glDeleteBuffers(1, &vboCubeVertexDataIndex);\n glDeleteBuffers(1, &vboCubeVertexIndicesIndex);\n}\n\nvoid GLES2Lesson::createVBOs() {\n glGenBuffers(1, &vboCubeVertexDataIndex);\n glBindBuffer(GL_ARRAY_BUFFER, vboCubeVertexDataIndex);\n glBufferData(GL_ARRAY_BUFFER, 16 * sizeof(float) * 5, cubeVertices, GL_STATIC_DRAW);\n glBindBuffer(GL_ARRAY_BUFFER, 0);\n\n textureId = CreateSimpleTexture2D();\n\n glGenBuffers(1, &vboCubeVertexIndicesIndex);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, vboCubeVertexIndicesIndex);\n glBufferData(GL_ELEMENT_ARRAY_BUFFER, 36 * sizeof(GLushort), cubeIndices, GL_STATIC_DRAW);\n glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);\n}\n\nvoid GLES2Lesson::clearBuffers() {\n glClearColor(0.5f, 0.5f, 0.5f, 1.0f);\n glClearDepthf(1.0f);\n checkGlError(\"glClearColor\");\n glClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT);\n checkGlError(\"glClear\");\n}\n\nvoid GLES2Lesson::setPerspective() {\n glUniformMatrix4fv(projectionMatrixAttributePosition, 1, false, &projectionMatrix[0][0]);\n}\n\nvoid GLES2Lesson::prepareShaderProgram() {\n glUseProgram(gProgram);\n checkGlError(\"glUseProgram\");\n}\n\nvoid GLES2Lesson::render() {\n clearBuffers();\n prepareShaderProgram();\n setPerspective();\n resetTransformMatrices();\n\n drawGeometry(vboCubeVertexDataIndex,\n vboCubeVertexIndicesIndex,\n 36,\n cubeTransformMatrix\n );\n}\n\nvoid GLES2Lesson::setTexture(void **bitmapData, int size) {\n\/\/ glBindBuffer( GL_ARRAY_BUFFER, vboCubeVertexDataIndex );\n\/\/ glBindTexture( GL_TEXTURE_2D, 0 );\n\/\/ glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\/\/ glTexParameteri( GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_NEAREST );\n\/\/ glBufferData( GL_ARRAY_BUFFER, size, bitmapData, GL_STATIC_DRAW );\n\/\/ glBindBuffer( GL_ARRAY_BUFFER, 0 );\n}\n\nvoid GLES2Lesson::tick() {\n cubeRotationAngleYZ += 0.5f;\n cubeRotationAngleXZ += 1.0f;\n}\n\nvoid GLES2Lesson::shutdown() {\n LOGI(\"Shutdown!\\n\");\n}<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: color.hxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _TOOLS_COLOR_HXX\n#define _TOOLS_COLOR_HXX\n\n#include \"tools\/toolsdllapi.h\"\n\nclass SvStream;\nclass ResId;\n#include <tools\/solar.h>\n\n#ifndef _BGFX_COLOR_BCOLOR_HXX\n#include <basegfx\/color\/bcolor.hxx>\n#endif\n\n\/\/ --------------------\n\/\/ - ColorCount-Types -\n\/\/ --------------------\n\n#define COLCOUNT_MONOCHROM ((ULONG)2)\n#define COLCOUNT_16 ((ULONG)16)\n#define COLCOUNT_256 ((ULONG)256)\n#define COLCOUNT_HICOLOR1 (((ULONG)0x00007FFF)+1)\n#define COLCOUNT_HICOLOR2 (((ULONG)0x0000FFFF)+1)\n#define COLCOUNT_TRUECOLOR (((ULONG)0x00FFFFFF)+1)\n\n\/\/ ---------------\n\/\/ - Color-Types -\n\/\/ ---------------\n\ntypedef UINT32 ColorData;\n#define RGB_COLORDATA( r,g,b ) ((ColorData)(((UINT32)((UINT8)(b))))|(((UINT32)((UINT8)(g)))<<8)|(((UINT32)((UINT8)(r)))<<16))\n#define TRGB_COLORDATA( t,r,g,b ) ((ColorData)(((UINT32)((UINT8)(b))))|(((UINT32)((UINT8)(g)))<<8)|(((UINT32)((UINT8)(r)))<<16)|(((UINT32)((UINT8)(t)))<<24))\n#define COLORDATA_RED( n ) ((UINT8)((n)>>16))\n#define COLORDATA_GREEN( n ) ((UINT8)(((UINT16)(n)) >> 8))\n#define COLORDATA_BLUE( n ) ((UINT8)(n))\n#define COLORDATA_TRANSPARENCY( n ) ((UINT8)((n)>>24))\n#define COLORDATA_RGB( n ) ((ColorData)((n) & 0x00FFFFFF))\n\n#define COL_BLACK RGB_COLORDATA( 0x00, 0x00, 0x00 )\n#define COL_BLUE RGB_COLORDATA( 0x00, 0x00, 0x80 )\n#define COL_GREEN RGB_COLORDATA( 0x00, 0x80, 0x00 )\n#define COL_CYAN RGB_COLORDATA( 0x00, 0x80, 0x80 )\n#define COL_RED RGB_COLORDATA( 0x80, 0x00, 0x00 )\n#define COL_MAGENTA RGB_COLORDATA( 0x80, 0x00, 0x80 )\n#define COL_BROWN RGB_COLORDATA( 0x80, 0x80, 0x00 )\n#define COL_GRAY RGB_COLORDATA( 0x80, 0x80, 0x80 )\n#define COL_LIGHTGRAY RGB_COLORDATA( 0xC0, 0xC0, 0xC0 )\n#define COL_LIGHTBLUE RGB_COLORDATA( 0x00, 0x00, 0xFF )\n#define COL_LIGHTGREEN RGB_COLORDATA( 0x00, 0xFF, 0x00 )\n#define COL_LIGHTCYAN RGB_COLORDATA( 0x00, 0xFF, 0xFF )\n#define COL_LIGHTRED RGB_COLORDATA( 0xFF, 0x00, 0x00 )\n#define COL_LIGHTMAGENTA RGB_COLORDATA( 0xFF, 0x00, 0xFF )\n#define COL_YELLOW RGB_COLORDATA( 0xFF, 0xFF, 0x00 )\n#define COL_WHITE RGB_COLORDATA( 0xFF, 0xFF, 0xFF )\n#define COL_TRANSPARENT TRGB_COLORDATA( 0xFF, 0xFF, 0xFF, 0xFF )\n#define COL_AUTO (UINT32)0xFFFFFFFF\n#define COL_AUTHOR1_DARK RGB_COLORDATA(198, 146, 0)\n#define COL_AUTHOR1_NORMAL RGB_COLORDATA(255, 255, 158)\n#define COL_AUTHOR1_LIGHT RGB_COLORDATA(255, 255, 195)\n#define COL_AUTHOR2_DARK RGB_COLORDATA(6, 70, 162)\n#define COL_AUTHOR2_NORMAL RGB_COLORDATA(216, 232, 255)\n#define COL_AUTHOR2_LIGHT RGB_COLORDATA(233, 242, 255)\n#define COL_AUTHOR3_DARK RGB_COLORDATA(87, 157, 28)\n#define COL_AUTHOR3_NORMAL RGB_COLORDATA(218, 248, 193)\n#define COL_AUTHOR3_LIGHT RGB_COLORDATA(226, 250, 207)\n#define COL_AUTHOR4_DARK RGB_COLORDATA(105, 43, 157)\n#define COL_AUTHOR4_NORMAL RGB_COLORDATA(228, 210, 245)\n#define COL_AUTHOR4_LIGHT RGB_COLORDATA(239, 228, 248)\n#define COL_AUTHOR5_DARK RGB_COLORDATA(197, 0, 11)\n#define COL_AUTHOR5_NORMAL RGB_COLORDATA(254, 205, 208)\n#define COL_AUTHOR5_LIGHT RGB_COLORDATA(255, 227, 229)\n#define COL_AUTHOR6_DARK RGB_COLORDATA(0, 128, 128)\n#define COL_AUTHOR6_NORMAL RGB_COLORDATA(210, 246, 246)\n#define COL_AUTHOR6_LIGHT RGB_COLORDATA(230, 250, 250)\n#define COL_AUTHOR7_DARK RGB_COLORDATA(140, 132, 0)\n#define COL_AUTHOR7_NORMAL RGB_COLORDATA(237, 252, 163)\n#define COL_AUTHOR7_LIGHT RGB_COLORDATA(242, 254, 181)\n#define COL_AUTHOR8_DARK RGB_COLORDATA(53, 85, 107)\n#define COL_AUTHOR8_NORMAL RGB_COLORDATA(211, 222, 232)\n#define COL_AUTHOR8_LIGHT RGB_COLORDATA(226, 234, 241)\n#define COL_AUTHOR9_DARK RGB_COLORDATA(209, 118, 0)\n#define COL_AUTHOR9_NORMAL RGB_COLORDATA(255, 226, 185)\n#define COL_AUTHOR9_LIGHT RGB_COLORDATA(255, 231, 199)\n\n#define COLOR_CHANNEL_MERGE( _def_cDst, _def_cSrc, _def_cSrcTrans ) \\\n ((BYTE)((((long)(_def_cDst)-(_def_cSrc))*(_def_cSrcTrans)+(((_def_cSrc)<<8L)|(_def_cDst)))>>8L))\n\n\/\/ ---------\n\/\/ - Color -\n\/\/ ---------\n\nclass TOOLS_DLLPUBLIC Color\n{\nprotected:\n ColorData mnColor;\n\npublic:\n Color() { mnColor = COL_BLACK; }\n Color( ColorData nColor ) { mnColor = nColor; }\n Color( UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n { mnColor = RGB_COLORDATA( nRed, nGreen, nBlue ); }\n Color( UINT8 nTransparency, UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n { mnColor = TRGB_COLORDATA( nTransparency, nRed, nGreen, nBlue ); }\n Color( const ResId& rResId );\n \/\/ This ctor is defined in svtools, not tools!\n\n \/\/ constructor to create a tools-Color from ::basegfx::BColor\n explicit Color(const ::basegfx::BColor& rBColor)\n {\n mnColor = RGB_COLORDATA(\n UINT8((rBColor.getRed() * 255.0) + 0.5),\n UINT8((rBColor.getGreen() * 255.0) + 0.5),\n UINT8((rBColor.getBlue() * 255.0) + 0.5));\n }\n\n void SetRed( UINT8 nRed );\n UINT8 GetRed() const { return COLORDATA_RED( mnColor ); }\n void SetGreen( UINT8 nGreen );\n UINT8 GetGreen() const { return COLORDATA_GREEN( mnColor ); }\n void SetBlue( UINT8 nBlue );\n UINT8 GetBlue() const { return COLORDATA_BLUE( mnColor ); }\n void SetTransparency( UINT8 nTransparency );\n UINT8 GetTransparency() const { return COLORDATA_TRANSPARENCY( mnColor ); }\n\n void SetColor( ColorData nColor ) { mnColor = nColor; }\n ColorData GetColor() const { return mnColor; }\n ColorData GetRGBColor() const { return COLORDATA_RGB( mnColor ); }\n\n UINT8 GetColorError( const Color& rCompareColor ) const;\n\n UINT8 GetLuminance() const;\n void IncreaseLuminance( UINT8 cLumInc );\n void DecreaseLuminance( UINT8 cLumDec );\n\n void IncreaseContrast( UINT8 cContInc );\n void DecreaseContrast( UINT8 cContDec );\n\n void Invert();\n\n void Merge( const Color& rMergeColor, BYTE cTransparency );\n\n BOOL IsRGBEqual( const Color& rColor ) const;\n\n \/\/ comparison with luminance thresholds\n BOOL IsDark() const;\n BOOL IsBright() const;\n\n \/\/ color space conversion tools\n \/\/ the range for h\/s\/b is:\n \/\/ Hue: 0-360 degree\n \/\/ Saturation: 0-100 %\n \/\/ Brightness: 0-100 %\n static ColorData HSBtoRGB( USHORT nHue, USHORT nSat, USHORT nBri );\n void RGBtoHSB( USHORT& nHue, USHORT& nSat, USHORT& nBri ) const;\n\n BOOL operator==( const Color& rColor ) const\n { return (mnColor == rColor.mnColor); }\n BOOL operator!=( const Color& rColor ) const\n { return !(Color::operator==( rColor )); }\n\n SvStream& Read( SvStream& rIStm, BOOL bNewFormat = TRUE );\n SvStream& Write( SvStream& rOStm, BOOL bNewFormat = TRUE );\n\n TOOLS_DLLPUBLIC friend SvStream& operator>>( SvStream& rIStream, Color& rColor );\n TOOLS_DLLPUBLIC friend SvStream& operator<<( SvStream& rOStream, const Color& rColor );\n\n \/\/ get ::basegfx::BColor from this color\n ::basegfx::BColor getBColor() const { return ::basegfx::BColor(GetRed() \/ 255.0, GetGreen() \/ 255.0, GetBlue() \/ 255.0); }\n};\n\ninline void Color::SetRed( UINT8 nRed )\n{\n mnColor &= 0xFF00FFFF;\n mnColor |= ((UINT32)nRed)<<16;\n}\n\ninline void Color::SetGreen( UINT8 nGreen )\n{\n mnColor &= 0xFFFF00FF;\n mnColor |= ((UINT16)nGreen)<<8;\n}\n\ninline void Color::SetBlue( UINT8 nBlue )\n{\n mnColor &= 0xFFFFFF00;\n mnColor |= nBlue;\n}\n\ninline void Color::SetTransparency( UINT8 nTransparency )\n{\n mnColor &= 0x00FFFFFF;\n mnColor |= ((UINT32)nTransparency)<<24;\n}\n\ninline BOOL Color::IsRGBEqual( const Color& rColor ) const\n{\n return (COLORDATA_RGB( mnColor ) == COLORDATA_RGB( rColor.mnColor ));\n}\n\ninline UINT8 Color::GetLuminance() const\n{\n return( (UINT8) ( ( COLORDATA_BLUE( mnColor ) * 28UL +\n COLORDATA_GREEN( mnColor ) * 151UL +\n COLORDATA_RED( mnColor ) * 77UL ) >> 8UL ) );\n}\n\ninline void Color::Merge( const Color& rMergeColor, BYTE cTransparency )\n{\n SetRed( COLOR_CHANNEL_MERGE( COLORDATA_RED( mnColor ), COLORDATA_RED( rMergeColor.mnColor ), cTransparency ) );\n SetGreen( COLOR_CHANNEL_MERGE( COLORDATA_GREEN( mnColor ), COLORDATA_GREEN( rMergeColor.mnColor ), cTransparency ) );\n SetBlue( COLOR_CHANNEL_MERGE( COLORDATA_BLUE( mnColor ), COLORDATA_BLUE( rMergeColor.mnColor ), cTransparency ) );\n}\n\n#endif \/\/ _TOOLS_COLOR_HXX\n<commit_msg>calctabcolor: COL_AUTO should be of type ColorData, not of UINT32.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: color.hxx,v $\n * $Revision: 1.5 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _TOOLS_COLOR_HXX\n#define _TOOLS_COLOR_HXX\n\n#include \"tools\/toolsdllapi.h\"\n\nclass SvStream;\nclass ResId;\n#include <tools\/solar.h>\n\n#ifndef _BGFX_COLOR_BCOLOR_HXX\n#include <basegfx\/color\/bcolor.hxx>\n#endif\n\n\/\/ --------------------\n\/\/ - ColorCount-Types -\n\/\/ --------------------\n\n#define COLCOUNT_MONOCHROM ((ULONG)2)\n#define COLCOUNT_16 ((ULONG)16)\n#define COLCOUNT_256 ((ULONG)256)\n#define COLCOUNT_HICOLOR1 (((ULONG)0x00007FFF)+1)\n#define COLCOUNT_HICOLOR2 (((ULONG)0x0000FFFF)+1)\n#define COLCOUNT_TRUECOLOR (((ULONG)0x00FFFFFF)+1)\n\n\/\/ ---------------\n\/\/ - Color-Types -\n\/\/ ---------------\n\ntypedef UINT32 ColorData;\n#define RGB_COLORDATA( r,g,b ) ((ColorData)(((UINT32)((UINT8)(b))))|(((UINT32)((UINT8)(g)))<<8)|(((UINT32)((UINT8)(r)))<<16))\n#define TRGB_COLORDATA( t,r,g,b ) ((ColorData)(((UINT32)((UINT8)(b))))|(((UINT32)((UINT8)(g)))<<8)|(((UINT32)((UINT8)(r)))<<16)|(((UINT32)((UINT8)(t)))<<24))\n#define COLORDATA_RED( n ) ((UINT8)((n)>>16))\n#define COLORDATA_GREEN( n ) ((UINT8)(((UINT16)(n)) >> 8))\n#define COLORDATA_BLUE( n ) ((UINT8)(n))\n#define COLORDATA_TRANSPARENCY( n ) ((UINT8)((n)>>24))\n#define COLORDATA_RGB( n ) ((ColorData)((n) & 0x00FFFFFF))\n\n#define COL_BLACK RGB_COLORDATA( 0x00, 0x00, 0x00 )\n#define COL_BLUE RGB_COLORDATA( 0x00, 0x00, 0x80 )\n#define COL_GREEN RGB_COLORDATA( 0x00, 0x80, 0x00 )\n#define COL_CYAN RGB_COLORDATA( 0x00, 0x80, 0x80 )\n#define COL_RED RGB_COLORDATA( 0x80, 0x00, 0x00 )\n#define COL_MAGENTA RGB_COLORDATA( 0x80, 0x00, 0x80 )\n#define COL_BROWN RGB_COLORDATA( 0x80, 0x80, 0x00 )\n#define COL_GRAY RGB_COLORDATA( 0x80, 0x80, 0x80 )\n#define COL_LIGHTGRAY RGB_COLORDATA( 0xC0, 0xC0, 0xC0 )\n#define COL_LIGHTBLUE RGB_COLORDATA( 0x00, 0x00, 0xFF )\n#define COL_LIGHTGREEN RGB_COLORDATA( 0x00, 0xFF, 0x00 )\n#define COL_LIGHTCYAN RGB_COLORDATA( 0x00, 0xFF, 0xFF )\n#define COL_LIGHTRED RGB_COLORDATA( 0xFF, 0x00, 0x00 )\n#define COL_LIGHTMAGENTA RGB_COLORDATA( 0xFF, 0x00, 0xFF )\n#define COL_YELLOW RGB_COLORDATA( 0xFF, 0xFF, 0x00 )\n#define COL_WHITE RGB_COLORDATA( 0xFF, 0xFF, 0xFF )\n#define COL_TRANSPARENT TRGB_COLORDATA( 0xFF, 0xFF, 0xFF, 0xFF )\n#define COL_AUTO (ColorData)0xFFFFFFFF\n#define COL_AUTHOR1_DARK RGB_COLORDATA(198, 146, 0)\n#define COL_AUTHOR1_NORMAL RGB_COLORDATA(255, 255, 158)\n#define COL_AUTHOR1_LIGHT RGB_COLORDATA(255, 255, 195)\n#define COL_AUTHOR2_DARK RGB_COLORDATA(6, 70, 162)\n#define COL_AUTHOR2_NORMAL RGB_COLORDATA(216, 232, 255)\n#define COL_AUTHOR2_LIGHT RGB_COLORDATA(233, 242, 255)\n#define COL_AUTHOR3_DARK RGB_COLORDATA(87, 157, 28)\n#define COL_AUTHOR3_NORMAL RGB_COLORDATA(218, 248, 193)\n#define COL_AUTHOR3_LIGHT RGB_COLORDATA(226, 250, 207)\n#define COL_AUTHOR4_DARK RGB_COLORDATA(105, 43, 157)\n#define COL_AUTHOR4_NORMAL RGB_COLORDATA(228, 210, 245)\n#define COL_AUTHOR4_LIGHT RGB_COLORDATA(239, 228, 248)\n#define COL_AUTHOR5_DARK RGB_COLORDATA(197, 0, 11)\n#define COL_AUTHOR5_NORMAL RGB_COLORDATA(254, 205, 208)\n#define COL_AUTHOR5_LIGHT RGB_COLORDATA(255, 227, 229)\n#define COL_AUTHOR6_DARK RGB_COLORDATA(0, 128, 128)\n#define COL_AUTHOR6_NORMAL RGB_COLORDATA(210, 246, 246)\n#define COL_AUTHOR6_LIGHT RGB_COLORDATA(230, 250, 250)\n#define COL_AUTHOR7_DARK RGB_COLORDATA(140, 132, 0)\n#define COL_AUTHOR7_NORMAL RGB_COLORDATA(237, 252, 163)\n#define COL_AUTHOR7_LIGHT RGB_COLORDATA(242, 254, 181)\n#define COL_AUTHOR8_DARK RGB_COLORDATA(53, 85, 107)\n#define COL_AUTHOR8_NORMAL RGB_COLORDATA(211, 222, 232)\n#define COL_AUTHOR8_LIGHT RGB_COLORDATA(226, 234, 241)\n#define COL_AUTHOR9_DARK RGB_COLORDATA(209, 118, 0)\n#define COL_AUTHOR9_NORMAL RGB_COLORDATA(255, 226, 185)\n#define COL_AUTHOR9_LIGHT RGB_COLORDATA(255, 231, 199)\n\n#define COLOR_CHANNEL_MERGE( _def_cDst, _def_cSrc, _def_cSrcTrans ) \\\n ((BYTE)((((long)(_def_cDst)-(_def_cSrc))*(_def_cSrcTrans)+(((_def_cSrc)<<8L)|(_def_cDst)))>>8L))\n\n\/\/ ---------\n\/\/ - Color -\n\/\/ ---------\n\nclass TOOLS_DLLPUBLIC Color\n{\nprotected:\n ColorData mnColor;\n\npublic:\n Color() { mnColor = COL_BLACK; }\n Color( ColorData nColor ) { mnColor = nColor; }\n Color( UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n { mnColor = RGB_COLORDATA( nRed, nGreen, nBlue ); }\n Color( UINT8 nTransparency, UINT8 nRed, UINT8 nGreen, UINT8 nBlue )\n { mnColor = TRGB_COLORDATA( nTransparency, nRed, nGreen, nBlue ); }\n Color( const ResId& rResId );\n \/\/ This ctor is defined in svtools, not tools!\n\n \/\/ constructor to create a tools-Color from ::basegfx::BColor\n explicit Color(const ::basegfx::BColor& rBColor)\n {\n mnColor = RGB_COLORDATA(\n UINT8((rBColor.getRed() * 255.0) + 0.5),\n UINT8((rBColor.getGreen() * 255.0) + 0.5),\n UINT8((rBColor.getBlue() * 255.0) + 0.5));\n }\n\n void SetRed( UINT8 nRed );\n UINT8 GetRed() const { return COLORDATA_RED( mnColor ); }\n void SetGreen( UINT8 nGreen );\n UINT8 GetGreen() const { return COLORDATA_GREEN( mnColor ); }\n void SetBlue( UINT8 nBlue );\n UINT8 GetBlue() const { return COLORDATA_BLUE( mnColor ); }\n void SetTransparency( UINT8 nTransparency );\n UINT8 GetTransparency() const { return COLORDATA_TRANSPARENCY( mnColor ); }\n\n void SetColor( ColorData nColor ) { mnColor = nColor; }\n ColorData GetColor() const { return mnColor; }\n ColorData GetRGBColor() const { return COLORDATA_RGB( mnColor ); }\n\n UINT8 GetColorError( const Color& rCompareColor ) const;\n\n UINT8 GetLuminance() const;\n void IncreaseLuminance( UINT8 cLumInc );\n void DecreaseLuminance( UINT8 cLumDec );\n\n void IncreaseContrast( UINT8 cContInc );\n void DecreaseContrast( UINT8 cContDec );\n\n void Invert();\n\n void Merge( const Color& rMergeColor, BYTE cTransparency );\n\n BOOL IsRGBEqual( const Color& rColor ) const;\n\n \/\/ comparison with luminance thresholds\n BOOL IsDark() const;\n BOOL IsBright() const;\n\n \/\/ color space conversion tools\n \/\/ the range for h\/s\/b is:\n \/\/ Hue: 0-360 degree\n \/\/ Saturation: 0-100 %\n \/\/ Brightness: 0-100 %\n static ColorData HSBtoRGB( USHORT nHue, USHORT nSat, USHORT nBri );\n void RGBtoHSB( USHORT& nHue, USHORT& nSat, USHORT& nBri ) const;\n\n BOOL operator==( const Color& rColor ) const\n { return (mnColor == rColor.mnColor); }\n BOOL operator!=( const Color& rColor ) const\n { return !(Color::operator==( rColor )); }\n\n SvStream& Read( SvStream& rIStm, BOOL bNewFormat = TRUE );\n SvStream& Write( SvStream& rOStm, BOOL bNewFormat = TRUE );\n\n TOOLS_DLLPUBLIC friend SvStream& operator>>( SvStream& rIStream, Color& rColor );\n TOOLS_DLLPUBLIC friend SvStream& operator<<( SvStream& rOStream, const Color& rColor );\n\n \/\/ get ::basegfx::BColor from this color\n ::basegfx::BColor getBColor() const { return ::basegfx::BColor(GetRed() \/ 255.0, GetGreen() \/ 255.0, GetBlue() \/ 255.0); }\n};\n\ninline void Color::SetRed( UINT8 nRed )\n{\n mnColor &= 0xFF00FFFF;\n mnColor |= ((UINT32)nRed)<<16;\n}\n\ninline void Color::SetGreen( UINT8 nGreen )\n{\n mnColor &= 0xFFFF00FF;\n mnColor |= ((UINT16)nGreen)<<8;\n}\n\ninline void Color::SetBlue( UINT8 nBlue )\n{\n mnColor &= 0xFFFFFF00;\n mnColor |= nBlue;\n}\n\ninline void Color::SetTransparency( UINT8 nTransparency )\n{\n mnColor &= 0x00FFFFFF;\n mnColor |= ((UINT32)nTransparency)<<24;\n}\n\ninline BOOL Color::IsRGBEqual( const Color& rColor ) const\n{\n return (COLORDATA_RGB( mnColor ) == COLORDATA_RGB( rColor.mnColor ));\n}\n\ninline UINT8 Color::GetLuminance() const\n{\n return( (UINT8) ( ( COLORDATA_BLUE( mnColor ) * 28UL +\n COLORDATA_GREEN( mnColor ) * 151UL +\n COLORDATA_RED( mnColor ) * 77UL ) >> 8UL ) );\n}\n\ninline void Color::Merge( const Color& rMergeColor, BYTE cTransparency )\n{\n SetRed( COLOR_CHANNEL_MERGE( COLORDATA_RED( mnColor ), COLORDATA_RED( rMergeColor.mnColor ), cTransparency ) );\n SetGreen( COLOR_CHANNEL_MERGE( COLORDATA_GREEN( mnColor ), COLORDATA_GREEN( rMergeColor.mnColor ), cTransparency ) );\n SetBlue( COLOR_CHANNEL_MERGE( COLORDATA_BLUE( mnColor ), COLORDATA_BLUE( rMergeColor.mnColor ), cTransparency ) );\n}\n\n#endif \/\/ _TOOLS_COLOR_HXX\n<|endoftext|>"} {"text":"<commit_before>#include \"multiplayer_server_scanner.h\"\n\nServerScanner::ServerScanner(int version_number, int server_port)\n: server_port(server_port), version_number(version_number), master_server_scan_thread(&ServerScanner::masterServerScanThread, this)\n{\n}\n\nServerScanner::~ServerScanner()\n{\n destroy();\n master_server_scan_thread.wait();\n}\n\nvoid ServerScanner::scanMasterServer(string url)\n{\n master_server_url = url;\n master_server_scan_thread.launch();\n}\n\nvoid ServerScanner::scanLocalNetwork()\n{\n int port_nr = server_port + 1;\n while(socket.bind(port_nr) != sf::UdpSocket::Done)\n port_nr++;\n \n socket.setBlocking(false);\n broadcast_clock.restart();\n}\n\nvoid ServerScanner::update(float gameDelta)\n{\n server_list_mutex.lock();\n for(unsigned int n=0; n<server_list.size(); n++)\n {\n if (server_list[n].timeout_clock.getElapsedTime().asSeconds() > ServerTimeout)\n {\n if (removedServerCallback)\n removedServerCallback(server_list[n].address);\n server_list.erase(server_list.begin() + n);\n n--;\n }\n }\n server_list_mutex.unlock();\n\n if (socket.getLocalPort() != 0)\n {\n if (broadcast_clock.getElapsedTime().asSeconds() > BroadcastTimeout)\n {\n sf::Packet sendPacket;\n sendPacket << multiplayerVerficationNumber << \"ServerQuery\" << int32_t(version_number);\n UDPbroadcastPacket(socket, sendPacket, server_port);\n broadcast_clock.restart();\n }\n\n sf::IpAddress recv_address;\n unsigned short recv_port;\n sf::Packet recv_packet;\n while(socket.receive(recv_packet, recv_address, recv_port) == sf::UdpSocket::Done)\n {\n int32_t verification, version_nr;\n string name;\n recv_packet >> verification >> version_nr >> name;\n if (verification == multiplayerVerficationNumber && (version_nr == version_number || version_nr == 0 || version_number == 0))\n {\n updateServerEntry(recv_address, recv_port, name);\n }\n }\n }\n}\n\nvoid ServerScanner::updateServerEntry(sf::IpAddress address, int port, string name)\n{\n sf::Lock lock(server_list_mutex);\n \n for(unsigned int n=0; n<server_list.size(); n++)\n {\n if (server_list[n].address == address)\n {\n server_list[n].port = port;\n server_list[n].name = name;\n server_list[n].timeout_clock.restart();\n return;\n }\n }\n\n LOG(INFO) << \"ServerScanner::New server: \" << address.toString() << \" \" << port << \" \" << name;\n ServerInfo si;\n si.address = address;\n si.port = port;\n si.name = name;\n si.timeout_clock.restart();\n server_list.push_back(si);\n \n if (newServerCallback)\n newServerCallback(address, name);\n}\n\nvoid ServerScanner::addCallbacks(std::function<void(sf::IpAddress, string)> newServerCallback, std::function<void(sf::IpAddress)> removedServerCallback)\n{\n this->newServerCallback = newServerCallback;\n this->removedServerCallback = removedServerCallback;\n}\n\nstd::vector<ServerScanner::ServerInfo> ServerScanner::getServerList()\n{ \n std::vector<ServerScanner::ServerInfo> ret;\n server_list_mutex.lock();\n ret = server_list;\n server_list_mutex.unlock();\n return ret;\n}\n\nvoid ServerScanner::masterServerScanThread()\n{\n if (!master_server_url.startswith(\"http:\/\/\"))\n {\n LOG(ERROR) << \"Master server URL does not start with \\\"http:\/\/\\\"\";\n return;\n }\n string hostname = master_server_url.substr(7);\n int path_start = hostname.find(\"\/\");\n if (path_start < 0)\n {\n LOG(ERROR) << \"Master server URL has no uri after hostname\";\n return;\n }\n string uri = hostname.substr(path_start + 1);\n hostname = hostname.substr(0, path_start);\n \n LOG(INFO) << \"Reading servers from master server\";\n \n sf::Http http(hostname);\n while(!isDestroyed())\n {\n sf::Http::Request request(uri, sf::Http::Request::Get);\n sf::Http::Response response = http.sendRequest(request, sf::seconds(10.0f));\n \n if (response.getStatus() != sf::Http::Response::Ok)\n {\n LOG(WARNING) << \"Failed to query master server (\" << response.getStatus() << \")\";\n }\n for(string line : string(response.getBody()).split(\"\\n\"))\n {\n std::vector<string> parts = line.split(\":\", 3);\n if (parts.size() == 4)\n {\n sf::IpAddress address(parts[0]);\n int port = parts[1].toInt();\n int version = parts[2].toInt();\n string name = parts[3];\n \n if (version == version_number || version == 0 || version_number == 0)\n {\n updateServerEntry(address, port, name);\n }\n }\n }\n \n for(int n=0;n<10 && !isDestroyed();n++)\n sf::sleep(sf::seconds(1.0f));\n }\n}\n<commit_msg>Try to connect to internet servers before listing them, to make sure port forwarding is setup properly at the server.<commit_after>#include \"multiplayer_server_scanner.h\"\n\nServerScanner::ServerScanner(int version_number, int server_port)\n: server_port(server_port), version_number(version_number), master_server_scan_thread(&ServerScanner::masterServerScanThread, this)\n{\n}\n\nServerScanner::~ServerScanner()\n{\n destroy();\n master_server_scan_thread.wait();\n}\n\nvoid ServerScanner::scanMasterServer(string url)\n{\n master_server_url = url;\n master_server_scan_thread.launch();\n}\n\nvoid ServerScanner::scanLocalNetwork()\n{\n int port_nr = server_port + 1;\n while(socket.bind(port_nr) != sf::UdpSocket::Done)\n port_nr++;\n \n socket.setBlocking(false);\n broadcast_clock.restart();\n}\n\nvoid ServerScanner::update(float gameDelta)\n{\n server_list_mutex.lock();\n for(unsigned int n=0; n<server_list.size(); n++)\n {\n if (server_list[n].timeout_clock.getElapsedTime().asSeconds() > ServerTimeout)\n {\n if (removedServerCallback)\n removedServerCallback(server_list[n].address);\n server_list.erase(server_list.begin() + n);\n n--;\n }\n }\n server_list_mutex.unlock();\n\n if (socket.getLocalPort() != 0)\n {\n if (broadcast_clock.getElapsedTime().asSeconds() > BroadcastTimeout)\n {\n sf::Packet sendPacket;\n sendPacket << multiplayerVerficationNumber << \"ServerQuery\" << int32_t(version_number);\n UDPbroadcastPacket(socket, sendPacket, server_port);\n broadcast_clock.restart();\n }\n\n sf::IpAddress recv_address;\n unsigned short recv_port;\n sf::Packet recv_packet;\n while(socket.receive(recv_packet, recv_address, recv_port) == sf::UdpSocket::Done)\n {\n int32_t verification, version_nr;\n string name;\n recv_packet >> verification >> version_nr >> name;\n if (verification == multiplayerVerficationNumber && (version_nr == version_number || version_nr == 0 || version_number == 0))\n {\n updateServerEntry(recv_address, recv_port, name);\n }\n }\n }\n}\n\nvoid ServerScanner::updateServerEntry(sf::IpAddress address, int port, string name)\n{\n sf::Lock lock(server_list_mutex);\n \n for(unsigned int n=0; n<server_list.size(); n++)\n {\n if (server_list[n].address == address)\n {\n server_list[n].port = port;\n server_list[n].name = name;\n server_list[n].timeout_clock.restart();\n return;\n }\n }\n\n LOG(INFO) << \"ServerScanner::New server: \" << address.toString() << \" \" << port << \" \" << name;\n ServerInfo si;\n si.address = address;\n si.port = port;\n si.name = name;\n si.timeout_clock.restart();\n server_list.push_back(si);\n \n if (newServerCallback)\n newServerCallback(address, name);\n}\n\nvoid ServerScanner::addCallbacks(std::function<void(sf::IpAddress, string)> newServerCallback, std::function<void(sf::IpAddress)> removedServerCallback)\n{\n this->newServerCallback = newServerCallback;\n this->removedServerCallback = removedServerCallback;\n}\n\nstd::vector<ServerScanner::ServerInfo> ServerScanner::getServerList()\n{ \n std::vector<ServerScanner::ServerInfo> ret;\n server_list_mutex.lock();\n ret = server_list;\n server_list_mutex.unlock();\n return ret;\n}\n\nvoid ServerScanner::masterServerScanThread()\n{\n if (!master_server_url.startswith(\"http:\/\/\"))\n {\n LOG(ERROR) << \"Master server URL does not start with \\\"http:\/\/\\\"\";\n return;\n }\n string hostname = master_server_url.substr(7);\n int path_start = hostname.find(\"\/\");\n if (path_start < 0)\n {\n LOG(ERROR) << \"Master server URL has no uri after hostname\";\n return;\n }\n string uri = hostname.substr(path_start + 1);\n hostname = hostname.substr(0, path_start);\n \n LOG(INFO) << \"Reading servers from master server\";\n \n sf::Http http(hostname);\n while(!isDestroyed())\n {\n sf::Http::Request request(uri, sf::Http::Request::Get);\n sf::Http::Response response = http.sendRequest(request, sf::seconds(10.0f));\n \n if (response.getStatus() != sf::Http::Response::Ok)\n {\n LOG(WARNING) << \"Failed to query master server (\" << response.getStatus() << \")\";\n }\n for(string line : string(response.getBody()).split(\"\\n\"))\n {\n std::vector<string> parts = line.split(\":\", 3);\n if (parts.size() == 4)\n {\n sf::IpAddress address(parts[0]);\n int port = parts[1].toInt();\n int version = parts[2].toInt();\n string name = parts[3];\n \n if (version == version_number || version == 0 || version_number == 0)\n {\n sf::TcpSocket socket;\n if (socket.connect(address, port, sf::seconds(1.0)) == sf::Socket::Done)\n {\n socket.disconnect();\n updateServerEntry(address, port, name);\n }\n }\n }\n }\n \n for(int n=0;n<10 && !isDestroyed(); n++)\n sf::sleep(sf::seconds(1.0f));\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2005-2008, Thorvald Natvig <thorvald@natvig.com>\n\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n\n - Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n - Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n - Neither the name of the Mumble Developers nor the names of its\n contributors may be used to endorse or promote products derived from this\n software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR\n CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"GlobalShortcut_unix.h\"\n#include \"Global.h\"\n#include <QX11Info>\n#include <X11\/X.h>\n#include <X11\/Xlib.h>\n#ifdef USE_XEVIE\n#include <X11\/extensions\/Xevie.h>\n#endif\n\n#ifdef Q_OS_LINUX\n#include <linux\/input.h>\n#include <fcntl.h>\n#endif\n\nGlobalShortcutEngine *GlobalShortcutEngine::platformInit() {\n\treturn new GlobalShortcutX();\n}\n\nGlobalShortcutX::GlobalShortcutX() {\n\tint min, maj;\n\tbRunning=false;\n\tbXevie = false;\n\n\tdisplay = NULL;\n\n#ifdef Q_OS_LINUX\n\tQString dir = QLatin1String(\"\/dev\/input\");\n\tQFileSystemWatcher *fsw = new QFileSystemWatcher(QStringList(dir), this);\n\tconnect(fsw, SIGNAL(directoryChanged(const QString &)), this, SLOT(directoryChanged(const QString &)));\n\tdirectoryChanged(dir);\n\n\tif (qmInputDevices.isEmpty()) {\n\t\tdelete fsw;\n\t\tqWarning(\"GlobalShortcutX: Unable to open any input devices under \/dev\/input, falling back to XEVIE\");\n\t} else {\n\t\treturn;\n\t}\n#endif\n\n\tdisplay = XOpenDisplay(NULL);\n\n\tif (! display) {\n\t\tqWarning(\"GlobalShortcutX: Unable to open dedicated display connection.\");\n\t\treturn;\n\t}\n\n\tmaj = 1;\n\tmin = 1;\n\n#ifdef USE_XEVIE\n\tif (! XevieQueryVersion(display, &maj, &min)) {\n\t\tqWarning(\"GlobalShortcutX: XEVIE extension not found. Enable it in xorg.conf\");\n\t} else {\n\t\tqWarning(\"GlobalShortcutX: XEVIE %d.%d\", maj, min);\n\n#ifdef QT_NO_DEBUG\n\t\tif (! XevieStart(display)) {\n\t\t\tqWarning(\"GlobalShortcutX: Another client is already using XEVIE\");\n\t\t} else {\n\t\t\tXevieSelectInput(display, KeyPressMask | KeyReleaseMask | ButtonPressMask | ButtonReleaseMask);\n\t\t\tbXevie = true;\n\t\t}\n#endif\n\t}\n#else\n\tqWarning(\"GlobalShortcutX: Not compiled with XEVIE support.\");\n#endif\n\tif (! bXevie) {\n\t\tqWarning(\"GlobalShortcutX: No XEVIE support, falling back to polled input. This wastes a lot of CPU resources, so please enable one of the other methods.\");\n\t}\n\n\tbRunning=true;\n\tstart(QThread::TimeCriticalPriority);\n}\n\nGlobalShortcutX::~GlobalShortcutX() {\n\tbRunning = false;\n\twait();\n}\n\nvoid GlobalShortcutX::run() {\n\tfd_set in_fds;\n\tXEvent evt;\n\tstruct timeval tv;\n\n\tif (bXevie) {\n#ifdef USE_XEVIE\n\t\twhile (bRunning) {\n\t\t\tif (bNeedRemap)\n\t\t\t\tremap();\n\t\t\tFD_ZERO(&in_fds);\n\t\t\tFD_SET(ConnectionNumber(display), &in_fds);\n\t\t\ttv.tv_sec = 0;\n\t\t\ttv.tv_usec = 100000;\n\t\t\tif (select(ConnectionNumber(display)+1, &in_fds, NULL, NULL, &tv)) {\n\t\t\t\twhile (XPending(display)) {\n\t\t\t\t\tXNextEvent(display, &evt);\n\t\t\t\t\tXevieSendEvent(display, &evt, XEVIE_UNMODIFIED);\n\t\t\t\t\tswitch (evt.type) {\n\t\t\t\t\t\tcase KeyPress:\n\t\t\t\t\t\tcase KeyRelease:\n\t\t\t\t\t\tcase ButtonPress:\n\t\t\t\t\t\tcase ButtonRelease: {\n\t\t\t\t\t\t\t\tbool down = (evt.type == KeyPress || evt.type == ButtonPress);\n\t\t\t\t\t\t\t\tint evtcode;\n\t\t\t\t\t\t\t\tif (evt.type == KeyPress || evt.type == KeyRelease)\n\t\t\t\t\t\t\t\t\tevtcode = evt.xkey.keycode;\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tevtcode = 0x118 + evt.xbutton.button;\n\n\t\t\t\t\t\t\t\thandleButton(evtcode, down);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tqWarning(\"GlobalShortcutX: EVT %x\", evt.type);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tXevieEnd(display);\n#endif\n\t} else {\n\t\tWindow root = XDefaultRootWindow(display);\n\t\tWindow root_ret, child_ret;\n\t\tint root_x, root_y;\n\t\tint win_x, win_y;\n\t\tunsigned int mask[2];\n\t\tint idx = 0;\n\t\tint next = 0;\n\t\tchar keys[2][32];\n\n\t\tmemset(keys[0], 0, 32);\n\t\tmemset(keys[1], 0, 32);\n\t\tmask[0] = mask[1] = 0;\n\n\t\twhile (bRunning) {\n\t\t\tif (bNeedRemap)\n\t\t\t\tremap();\n\n\t\t\tmsleep(10);\n\n\t\t\tidx = next;\n\t\t\tnext = idx ^ 1;\n\t\t\tif (! XQueryPointer(display, root, &root_ret, &child_ret, &root_x, &root_y, &win_x, &win_y, &mask[next]) ||\n\t\t\t ! XQueryKeymap(display, keys[next])) {\n\t\t\t\tqWarning(\"GlobalShortcutX: Lost connection\");\n\t\t\t\tbRunning = false;\n\t\t\t} else {\n\t\t\t\tfor (int i=0;i<256;++i) {\n\t\t\t\t\tint index = i \/ 8;\n\t\t\t\t\tint keymask = 1 << (i % 8);\n\t\t\t\t\tbool oldstate = (keys[idx][index] & keymask) != 0;\n\t\t\t\t\tbool newstate = (keys[next][index] & keymask) != 0;\n\t\t\t\t\tif (oldstate != newstate) {\n\t\t\t\t\t\thandleButton(i, newstate);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int i=8;i<=12;++i) {\n\t\t\t\t\tbool oldstate = (mask[idx] & (1 << i)) != 0;\n\t\t\t\t\tbool newstate = (mask[next] & (1 << i)) != 0;\n\t\t\t\t\tif (oldstate != newstate) {\n\t\t\t\t\t\thandleButton(0x110 + i, newstate);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tXCloseDisplay(display);\n}\n\nvoid GlobalShortcutX::inputReadyRead(int) {\n#ifdef Q_OS_LINUX\n\tstruct input_event ev;\n\n\tif (bNeedRemap)\n\t\tremap();\n\n\tQFile *f=qobject_cast<QFile *>(sender()->parent());\n\tif (!f)\n\t\treturn;\n\n\tbool found = false;\n\n\twhile (f->read(reinterpret_cast<char *>(&ev), sizeof(ev)) == sizeof(ev)) {\n\t\tfound = true;\n\t\tif (ev.type != EV_KEY)\n\t\t\tcontinue;\n\t\tbool down;\n\t\tswitch (ev.value) {\n\t\t\tcase 0:\n\t\t\t\tdown = false;\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tdown = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcontinue;\n\t\t}\n\t\tint evtcode = ev.code + 8;\n\t\thandleButton(evtcode, down);\n\t}\n\n\tif (! found) {\n\t\tint fd = f->handle();\n\t\tint version = 0;\n\t\tif ((ioctl(fd, EVIOCGVERSION, &version) < 0) || (((version >> 16) & 0xFF) < 1)) {\n\t\t\tqWarning(\"GlobalShortcutX: Removing dead input device %s\", qPrintable(f->fileName()));\n\t\t\tqmInputDevices.remove(f->fileName());\n\t\t\tdelete f;\n\t\t}\n\t}\n#endif\n}\n\n#define test_bit(bit, array) (array[bit\/8] & (1<<(bit%8)))\n\nvoid GlobalShortcutX::directoryChanged(const QString &dir) {\n#ifdef Q_OS_LINUX\n\tQDir d(dir, QLatin1String(\"event*\"), 0, QDir::System);\n\tforeach(QFileInfo fi, d.entryInfoList()) {\n\t\tQString path = fi.absoluteFilePath();\n\t\tif (! qmInputDevices.contains(path)) {\n\t\t\tQFile *f = new QFile(path, this);\n\t\t\tif (f->open(QIODevice::ReadOnly)) {\n\t\t\t\tint fd = f->handle();\n\t\t\t\tint version;\n\t\t\t\tchar name[256];\n\t\t\t\tuint8_t events[EV_MAX\/8 + 1];\n\t\t\t\tmemset(events, 0, sizeof(events));\n\t\t\t\tif ((ioctl(fd, EVIOCGVERSION, &version) >= 0) && (ioctl(fd, EVIOCGNAME(sizeof(name)), name)>=0) && (ioctl(fd, EVIOCGBIT(0,sizeof(events)), &events) >= 0) && test_bit(EV_KEY, events) && (((version >> 16) & 0xFF) > 0)) {\n\t\t\t\t\tname[255]=0;\n\t\t\t\t\tqWarning(\"GlobalShortcutX: %s: %s\", qPrintable(f->fileName()), name);\n\t\t\t\t\tfcntl(f->handle(), F_SETFL, O_NONBLOCK);\n\t\t\t\t\tconnect(new QSocketNotifier(f->handle(), QSocketNotifier::Read, f), SIGNAL(activated(int)), this, SLOT(inputReadyRead(int)));\n\t\t\t\t\tqmInputDevices.insert(f->fileName(), f);\n\t\t\t\t} else {\n\t\t\t\t\tdelete f;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdelete f;\n\t\t\t}\n\t\t}\n\t}\n#endif\n}\n\nQString GlobalShortcutX::buttonName(const QVariant &v) {\n\tbool ok;\n\tunsigned int key=v.toUInt(&ok);\n\tif (!ok)\n\t\treturn QString();\n\tif ((key < 0x118) || (key >= 0x128)) {\n\t\tKeySym ks=XKeycodeToKeysym(QX11Info::display(), static_cast<KeyCode>(key), 0);\n\t\tif (ks == NoSymbol) {\n\t\t\treturn QLatin1String(\"0x\")+QString::number(key,16);\n\t\t} else {\n\t\t\tconst char *str=XKeysymToString(ks);\n\t\t\tif (strlen(str) == 0) {\n\t\t\t\treturn QLatin1String(\"KS0x\")+QString::number(ks, 16);\n\t\t\t} else {\n\t\t\t\treturn QLatin1String(str);\n\t\t\t}\n\t\t}\n\t} else {\n\t\treturn tr(\"Mouse %1\").arg(key-0x118);\n\t}\n}\n<commit_msg>Possible support for key suppression with XEvie, but untested as Xevie itself is broken on i386<commit_after>\/* Copyright (C) 2005-2008, Thorvald Natvig <thorvald@natvig.com>\n\n All rights reserved.\n\n Redistribution and use in source and binary forms, with or without\n modification, are permitted provided that the following conditions\n are met:\n\n - Redistributions of source code must retain the above copyright notice,\n this list of conditions and the following disclaimer.\n - Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and\/or other materials provided with the distribution.\n - Neither the name of the Mumble Developers nor the names of its\n contributors may be used to endorse or promote products derived from this\n software without specific prior written permission.\n\n THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR\n CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n*\/\n\n#include \"GlobalShortcut_unix.h\"\n#include \"Global.h\"\n#include <QX11Info>\n#include <X11\/X.h>\n#include <X11\/Xlib.h>\n#ifdef USE_XEVIE\n#include <X11\/extensions\/Xevie.h>\n#endif\n\n#ifdef Q_OS_LINUX\n#include <linux\/input.h>\n#include <fcntl.h>\n#endif\n\nGlobalShortcutEngine *GlobalShortcutEngine::platformInit() {\n\treturn new GlobalShortcutX();\n}\n\nGlobalShortcutX::GlobalShortcutX() {\n\tint min, maj;\n\tbRunning=false;\n\tbXevie = false;\n\n\tdisplay = NULL;\n\n#ifdef Q_OS_LINUX\n\tQString dir = QLatin1String(\"\/dev\/input\");\n\tQFileSystemWatcher *fsw = new QFileSystemWatcher(QStringList(dir), this);\n\tconnect(fsw, SIGNAL(directoryChanged(const QString &)), this, SLOT(directoryChanged(const QString &)));\n\tdirectoryChanged(dir);\n\n\tif (qmInputDevices.isEmpty()) {\n\t\tdelete fsw;\n\t\tqWarning(\"GlobalShortcutX: Unable to open any input devices under \/dev\/input, falling back to XEVIE\");\n\t} else {\n\t\treturn;\n\t}\n#endif\n\n\tdisplay = XOpenDisplay(NULL);\n\n\tif (! display) {\n\t\tqWarning(\"GlobalShortcutX: Unable to open dedicated display connection.\");\n\t\treturn;\n\t}\n\n\tmaj = 1;\n\tmin = 1;\n\n#ifdef USE_XEVIE\n\tif (! XevieQueryVersion(display, &maj, &min)) {\n\t\tqWarning(\"GlobalShortcutX: XEVIE extension not found. Enable it in xorg.conf\");\n\t} else {\n\t\tqWarning(\"GlobalShortcutX: XEVIE %d.%d\", maj, min);\n\n#ifdef QT_NO_DEBUG\n\t\tif (! XevieStart(display)) {\n\t\t\tqWarning(\"GlobalShortcutX: Another client is already using XEVIE\");\n\t\t} else {\n\t\t\tXevieSelectInput(display, KeyPressMask | KeyReleaseMask | ButtonPressMask | ButtonReleaseMask);\n\t\t\tbXevie = true;\n\t\t}\n#endif\n\t}\n#else\n\tqWarning(\"GlobalShortcutX: Not compiled with XEVIE support.\");\n#endif\n\tif (! bXevie) {\n\t\tqWarning(\"GlobalShortcutX: No XEVIE support, falling back to polled input. This wastes a lot of CPU resources, so please enable one of the other methods.\");\n\t}\n\n\tbRunning=true;\n\tstart(QThread::TimeCriticalPriority);\n}\n\nGlobalShortcutX::~GlobalShortcutX() {\n\tbRunning = false;\n\twait();\n}\n\nvoid GlobalShortcutX::run() {\n\tfd_set in_fds;\n\tXEvent evt;\n\tstruct timeval tv;\n\n\tif (bXevie) {\n#ifdef USE_XEVIE\n\t\twhile (bRunning) {\n\t\t\tif (bNeedRemap)\n\t\t\t\tremap();\n\t\t\tFD_ZERO(&in_fds);\n\t\t\tFD_SET(ConnectionNumber(display), &in_fds);\n\t\t\ttv.tv_sec = 0;\n\t\t\ttv.tv_usec = 100000;\n\t\t\tif (select(ConnectionNumber(display)+1, &in_fds, NULL, NULL, &tv)) {\n\t\t\t\twhile (XPending(display)) {\n\t\t\t\t\tbool suppress = false;\n\t\t\t\t\tXNextEvent(display, &evt);\n\t\t\t\t\t\n\t\t\t\t\tswitch (evt.type) {\n\t\t\t\t\t\tcase KeyPress:\n\t\t\t\t\t\tcase KeyRelease:\n\t\t\t\t\t\tcase ButtonPress:\n\t\t\t\t\t\tcase ButtonRelease: {\n\t\t\t\t\t\t\t\tbool down = (evt.type == KeyPress || evt.type == ButtonPress);\n\t\t\t\t\t\t\t\tint evtcode;\n\t\t\t\t\t\t\t\tif (evt.type == KeyPress || evt.type == KeyRelease)\n\t\t\t\t\t\t\t\t\tevtcode = evt.xkey.keycode;\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tevtcode = 0x118 + evt.xbutton.button;\n\n\t\t\t\t\t\t\t\tsuppress = handleButton(evtcode, down);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tqWarning(\"GlobalShortcutX: EVT %x\", evt.type);\n\t\t\t\t\t}\n\t\t\t\t\tif (! suppress)\n\t\t\t\t\t\tXevieSendEvent(display, &evt, XEVIE_UNMODIFIED);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tXevieEnd(display);\n#endif\n\t} else {\n\t\tWindow root = XDefaultRootWindow(display);\n\t\tWindow root_ret, child_ret;\n\t\tint root_x, root_y;\n\t\tint win_x, win_y;\n\t\tunsigned int mask[2];\n\t\tint idx = 0;\n\t\tint next = 0;\n\t\tchar keys[2][32];\n\n\t\tmemset(keys[0], 0, 32);\n\t\tmemset(keys[1], 0, 32);\n\t\tmask[0] = mask[1] = 0;\n\n\t\twhile (bRunning) {\n\t\t\tif (bNeedRemap)\n\t\t\t\tremap();\n\n\t\t\tmsleep(10);\n\n\t\t\tidx = next;\n\t\t\tnext = idx ^ 1;\n\t\t\tif (! XQueryPointer(display, root, &root_ret, &child_ret, &root_x, &root_y, &win_x, &win_y, &mask[next]) ||\n\t\t\t ! XQueryKeymap(display, keys[next])) {\n\t\t\t\tqWarning(\"GlobalShortcutX: Lost connection\");\n\t\t\t\tbRunning = false;\n\t\t\t} else {\n\t\t\t\tfor (int i=0;i<256;++i) {\n\t\t\t\t\tint index = i \/ 8;\n\t\t\t\t\tint keymask = 1 << (i % 8);\n\t\t\t\t\tbool oldstate = (keys[idx][index] & keymask) != 0;\n\t\t\t\t\tbool newstate = (keys[next][index] & keymask) != 0;\n\t\t\t\t\tif (oldstate != newstate) {\n\t\t\t\t\t\thandleButton(i, newstate);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (int i=8;i<=12;++i) {\n\t\t\t\t\tbool oldstate = (mask[idx] & (1 << i)) != 0;\n\t\t\t\t\tbool newstate = (mask[next] & (1 << i)) != 0;\n\t\t\t\t\tif (oldstate != newstate) {\n\t\t\t\t\t\thandleButton(0x110 + i, newstate);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tXCloseDisplay(display);\n}\n\nvoid GlobalShortcutX::inputReadyRead(int) {\n#ifdef Q_OS_LINUX\n\tstruct input_event ev;\n\n\tif (bNeedRemap)\n\t\tremap();\n\n\tQFile *f=qobject_cast<QFile *>(sender()->parent());\n\tif (!f)\n\t\treturn;\n\n\tbool found = false;\n\n\twhile (f->read(reinterpret_cast<char *>(&ev), sizeof(ev)) == sizeof(ev)) {\n\t\tfound = true;\n\t\tif (ev.type != EV_KEY)\n\t\t\tcontinue;\n\t\tbool down;\n\t\tswitch (ev.value) {\n\t\t\tcase 0:\n\t\t\t\tdown = false;\n\t\t\t\tbreak;\n\t\t\tcase 1:\n\t\t\t\tdown = true;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tcontinue;\n\t\t}\n\t\tint evtcode = ev.code + 8;\n\t\thandleButton(evtcode, down);\n\t}\n\n\tif (! found) {\n\t\tint fd = f->handle();\n\t\tint version = 0;\n\t\tif ((ioctl(fd, EVIOCGVERSION, &version) < 0) || (((version >> 16) & 0xFF) < 1)) {\n\t\t\tqWarning(\"GlobalShortcutX: Removing dead input device %s\", qPrintable(f->fileName()));\n\t\t\tqmInputDevices.remove(f->fileName());\n\t\t\tdelete f;\n\t\t}\n\t}\n#endif\n}\n\n#define test_bit(bit, array) (array[bit\/8] & (1<<(bit%8)))\n\nvoid GlobalShortcutX::directoryChanged(const QString &dir) {\n#ifdef Q_OS_LINUX\n\tQDir d(dir, QLatin1String(\"event*\"), 0, QDir::System);\n\tforeach(QFileInfo fi, d.entryInfoList()) {\n\t\tQString path = fi.absoluteFilePath();\n\t\tif (! qmInputDevices.contains(path)) {\n\t\t\tQFile *f = new QFile(path, this);\n\t\t\tif (f->open(QIODevice::ReadOnly)) {\n\t\t\t\tint fd = f->handle();\n\t\t\t\tint version;\n\t\t\t\tchar name[256];\n\t\t\t\tuint8_t events[EV_MAX\/8 + 1];\n\t\t\t\tmemset(events, 0, sizeof(events));\n\t\t\t\tif ((ioctl(fd, EVIOCGVERSION, &version) >= 0) && (ioctl(fd, EVIOCGNAME(sizeof(name)), name)>=0) && (ioctl(fd, EVIOCGBIT(0,sizeof(events)), &events) >= 0) && test_bit(EV_KEY, events) && (((version >> 16) & 0xFF) > 0)) {\n\t\t\t\t\tname[255]=0;\n\t\t\t\t\tqWarning(\"GlobalShortcutX: %s: %s\", qPrintable(f->fileName()), name);\n\t\t\t\t\tfcntl(f->handle(), F_SETFL, O_NONBLOCK);\n\t\t\t\t\tconnect(new QSocketNotifier(f->handle(), QSocketNotifier::Read, f), SIGNAL(activated(int)), this, SLOT(inputReadyRead(int)));\n\t\t\t\t\tqmInputDevices.insert(f->fileName(), f);\n\t\t\t\t} else {\n\t\t\t\t\tdelete f;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tdelete f;\n\t\t\t}\n\t\t}\n\t}\n#endif\n}\n\nQString GlobalShortcutX::buttonName(const QVariant &v) {\n\tbool ok;\n\tunsigned int key=v.toUInt(&ok);\n\tif (!ok)\n\t\treturn QString();\n\tif ((key < 0x118) || (key >= 0x128)) {\n\t\tKeySym ks=XKeycodeToKeysym(QX11Info::display(), static_cast<KeyCode>(key), 0);\n\t\tif (ks == NoSymbol) {\n\t\t\treturn QLatin1String(\"0x\")+QString::number(key,16);\n\t\t} else {\n\t\t\tconst char *str=XKeysymToString(ks);\n\t\t\tif (strlen(str) == 0) {\n\t\t\t\treturn QLatin1String(\"KS0x\")+QString::number(ks, 16);\n\t\t\t} else {\n\t\t\t\treturn QLatin1String(str);\n\t\t\t}\n\t\t}\n\t} else {\n\t\treturn tr(\"Mouse %1\").arg(key-0x118);\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n RichardsonLucy.cxx\n\n Author: Benjamin A. Thomas\n\n Copyright 2015 Institute of Nuclear Medicine, University College London.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n This program implements the Richardson-Lucy (RL) partial volume correction\n technique. Please cite the following paper:\n\n\tTohka, J. and Reilhac A., (2008). \"Deconvolution-based partial volume\n\tcorrection in Raclopride-PET and Monte Carlo comparison to MR-based\n\tmethod\", NeuroImage, vol. 39. 1570--1584. \n\n *\/\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include <metaCommand.h>\n\n#include \"petpvcRLPVCImageFilter.h\"\n\nconst char * const VERSION_NO = \"0.0.1\";\nconst char * const AUTHOR = \"Benjamin A. Thomas\";\nconst char * const APP_TITLE = \"Richardson-Lucy (RL) PVC\";\n\ntypedef itk::Vector<float, 3> VectorType;\ntypedef itk::Image<float, 3> PETImageType;\n\ntypedef itk::ImageFileReader<PETImageType> PETReaderType;\ntypedef itk::ImageFileWriter<PETImageType> PETWriterType;\n\n\/\/Produces the text for the acknowledgments dialog in Slicer.\nstd::string getAcknowledgments(void);\n\nint main(int argc, char *argv[])\n{\n\n typedef petpvc::RichardsonLucyPVCImageFilter< PETImageType > FilterType;\n\n \/\/Setting up command line argument list.\n MetaCommand command;\n\n command.SetVersion(VERSION_NO);\n command.SetAuthor(AUTHOR);\n command.SetName(APP_TITLE);\n command.SetDescription(\n \"Performs Richardson-Lucy (RL) partial volume correction\");\n\n std::string sAcks = getAcknowledgments();\n command.SetAcknowledgments(sAcks.c_str());\n\n command.SetCategory(\"PETPVC\");\n\n command.AddField(\"petfile\", \"PET filename\", MetaCommand::IMAGE, MetaCommand::DATA_IN);\n command.AddField(\"outputfile\", \"output filename\", MetaCommand::IMAGE, MetaCommand::DATA_OUT);\n\n command.SetOption(\"FWHMx\", \"x\", true,\n \"The full-width at half maximum in mm along x-axis\");\n command.AddOptionField(\"FWHMx\", \"X\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"FWHMy\", \"y\", true,\n \"The full-width at half maximum in mm along y-axis\");\n command.AddOptionField(\"FWHMy\", \"Y\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"FWHMz\", \"z\", true,\n \"The full-width at half maximum in mm along z-axis\");\n command.AddOptionField(\"FWHMz\", \"Z\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"Iterations\", \"i\", false, \"Number of iterations\");\n command.SetOptionLongTag(\"Iterations\", \"iter\");\n command.AddOptionField(\"Iterations\", \"Val\", MetaCommand::INT, false, \"10\");\n\n \/\/command.SetOption(\"Stop\", \"s\", false, \"Stopping criterion\");\n \/\/command.SetOptionLongTag(\"Stop\", \"stop\");\n \/\/command.AddOptionField(\"Stop\", \"stopval\", MetaCommand::FLOAT, false, \"-3e+6\");\n\n command.SetOption(\"debug\", \"d\", false,\"Prints debug information\");\n command.SetOptionLongTag(\"debug\", \"debug\");\n\n \/\/Parse command line.\n if (!command.Parse(argc, argv)) {\n return EXIT_FAILURE;\n }\n\n \/\/Get image filenames\n std::string sPETFileName = command.GetValueAsString(\"petfile\");\n std::string sOutputFileName = command.GetValueAsString(\"outputfile\");\n\n \/\/Get values for PSF.\n float fFWHM_x = command.GetValueAsFloat(\"FWHMx\", \"X\");\n float fFWHM_y = command.GetValueAsFloat(\"FWHMy\", \"Y\");\n float fFWHM_z = command.GetValueAsFloat(\"FWHMz\", \"Z\");\n\n \/\/Get number of iterations\n int nNumOfIters = command.GetValueAsInt(\"Iterations\", \"Val\");\n\n \/\/Get value for stopping criterion.\n float fStop = command.GetValueAsFloat(\"Stop\", \"stopval\");\n\t\n \/\/Make vector of FWHM in x,y and z.\n VectorType vFWHM;\n vFWHM[0] = fFWHM_x;\n vFWHM[1] = fFWHM_y;\n vFWHM[2] = fFWHM_z;\n\n \/\/Toggle debug mode\n bool bDebug = command.GetValueAsBool(\"debug\");\n\n \/\/Create reader for PET image.\n PETReaderType::Pointer petReader = PETReaderType::New();\n petReader->SetFileName(sPETFileName);\n\n \/\/Try to read PET.\n try {\n petReader->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"[Error]\\tCannot read PET input file: \" << sPETFileName\n << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/Calculate the variance for a given FWHM.\n VectorType vVariance;\n vVariance = vFWHM \/ (2.0 * sqrt(2.0 * log(2.0)));\n \/\/std::cout << vVariance << std::endl;\n\n VectorType vVoxelSize = petReader->GetOutput()->GetSpacing();\n \/\/std::cout << vVoxelSize << std::endl;\n\n vVariance[0] = pow(vVariance[0], 2);\n vVariance[1] = pow(vVariance[1], 2);\n vVariance[2] = pow(vVariance[2], 2);\n\n FilterType::Pointer rlFilter = FilterType::New();\n rlFilter->SetInput( petReader->GetOutput() );\n rlFilter->SetPSF(vVariance);\n rlFilter->SetIterations( nNumOfIters );\n \/\/rlFilter->SetStoppingCond( fStop );\n rlFilter->SetVerbose ( bDebug );\n\n \/\/Perform RL.\n try {\n rlFilter->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"[Error]\\tfailure applying Richardson-Lucy on: \" << sPETFileName\n << \"\\n\" << err\n << std::endl;\n return EXIT_FAILURE;\n }\n\n PETWriterType::Pointer petWriter = PETWriterType::New();\n petWriter->SetFileName(sOutputFileName);\n petWriter->SetInput( rlFilter->GetOutput() );\n\n try {\n petWriter->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"\\n[Error]\\tCannot write output file: \" << sOutputFileName\n << std::endl;\n\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\nstd::string getAcknowledgments(void)\n{\n \/\/Produces acknowledgments string for 3DSlicer.\n std::string sAck = \"This program implements the Richardson-Lucy (RL) partial volume correction technique. Please cite the following paper:\\n\"\n \"\\tTohka, J. and Reilhac A., (2008). \\\"Deconvolution-based partial volume correction in Raclopride-PET\\n\\tand Monte Carlo comparison to MR-based method\\\", NeuroImage, vol. 39. 1570--1584.\";\n\n return sAck;\n}\n\n<commit_msg>Update RichardsonLucy.cxx<commit_after>\/*\n RichardsonLucy.cxx\n\n Author: Benjamin A. Thomas\n\n Copyright 2015 Clinical Imaging Research Centre, A*STAR-NUS.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n This program implements the Richardson-Lucy (RL) partial volume correction\n technique. Please cite the following paper:\n\n\tTohka, J. and Reilhac A., (2008). \"Deconvolution-based partial volume\n\tcorrection in Raclopride-PET and Monte Carlo comparison to MR-based\n\tmethod\", NeuroImage, vol. 39. 1570--1584. \n\n *\/\n\n#include \"itkImage.h\"\n#include \"itkImageFileReader.h\"\n#include \"itkImageFileWriter.h\"\n#include <metaCommand.h>\n\n#include \"petpvcRLPVCImageFilter.h\"\n\nconst char * const VERSION_NO = \"0.0.1\";\nconst char * const AUTHOR = \"Benjamin A. Thomas\";\nconst char * const APP_TITLE = \"Richardson-Lucy (RL) PVC\";\n\ntypedef itk::Vector<float, 3> VectorType;\ntypedef itk::Image<float, 3> PETImageType;\n\ntypedef itk::ImageFileReader<PETImageType> PETReaderType;\ntypedef itk::ImageFileWriter<PETImageType> PETWriterType;\n\n\/\/Produces the text for the acknowledgments dialog in Slicer.\nstd::string getAcknowledgments(void);\n\nint main(int argc, char *argv[])\n{\n\n typedef petpvc::RichardsonLucyPVCImageFilter< PETImageType > FilterType;\n\n \/\/Setting up command line argument list.\n MetaCommand command;\n\n command.SetVersion(VERSION_NO);\n command.SetAuthor(AUTHOR);\n command.SetName(APP_TITLE);\n command.SetDescription(\n \"Performs Richardson-Lucy (RL) partial volume correction\");\n\n std::string sAcks = getAcknowledgments();\n command.SetAcknowledgments(sAcks.c_str());\n\n command.SetCategory(\"PETPVC\");\n\n command.AddField(\"petfile\", \"PET filename\", MetaCommand::IMAGE, MetaCommand::DATA_IN);\n command.AddField(\"outputfile\", \"output filename\", MetaCommand::IMAGE, MetaCommand::DATA_OUT);\n\n command.SetOption(\"FWHMx\", \"x\", true,\n \"The full-width at half maximum in mm along x-axis\");\n command.AddOptionField(\"FWHMx\", \"X\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"FWHMy\", \"y\", true,\n \"The full-width at half maximum in mm along y-axis\");\n command.AddOptionField(\"FWHMy\", \"Y\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"FWHMz\", \"z\", true,\n \"The full-width at half maximum in mm along z-axis\");\n command.AddOptionField(\"FWHMz\", \"Z\", MetaCommand::FLOAT, true, \"\");\n\n command.SetOption(\"Iterations\", \"i\", false, \"Number of iterations\");\n command.SetOptionLongTag(\"Iterations\", \"iter\");\n command.AddOptionField(\"Iterations\", \"Val\", MetaCommand::INT, false, \"10\");\n\n \/\/command.SetOption(\"Stop\", \"s\", false, \"Stopping criterion\");\n \/\/command.SetOptionLongTag(\"Stop\", \"stop\");\n \/\/command.AddOptionField(\"Stop\", \"stopval\", MetaCommand::FLOAT, false, \"-3e+6\");\n\n command.SetOption(\"debug\", \"d\", false,\"Prints debug information\");\n command.SetOptionLongTag(\"debug\", \"debug\");\n\n \/\/Parse command line.\n if (!command.Parse(argc, argv)) {\n return EXIT_FAILURE;\n }\n\n \/\/Get image filenames\n std::string sPETFileName = command.GetValueAsString(\"petfile\");\n std::string sOutputFileName = command.GetValueAsString(\"outputfile\");\n\n \/\/Get values for PSF.\n float fFWHM_x = command.GetValueAsFloat(\"FWHMx\", \"X\");\n float fFWHM_y = command.GetValueAsFloat(\"FWHMy\", \"Y\");\n float fFWHM_z = command.GetValueAsFloat(\"FWHMz\", \"Z\");\n\n \/\/Get number of iterations\n int nNumOfIters = command.GetValueAsInt(\"Iterations\", \"Val\");\n\n \/\/Get value for stopping criterion.\n float fStop = command.GetValueAsFloat(\"Stop\", \"stopval\");\n\t\n \/\/Make vector of FWHM in x,y and z.\n VectorType vFWHM;\n vFWHM[0] = fFWHM_x;\n vFWHM[1] = fFWHM_y;\n vFWHM[2] = fFWHM_z;\n\n \/\/Toggle debug mode\n bool bDebug = command.GetValueAsBool(\"debug\");\n\n \/\/Create reader for PET image.\n PETReaderType::Pointer petReader = PETReaderType::New();\n petReader->SetFileName(sPETFileName);\n\n \/\/Try to read PET.\n try {\n petReader->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"[Error]\\tCannot read PET input file: \" << sPETFileName\n << std::endl;\n return EXIT_FAILURE;\n }\n\n \/\/Calculate the variance for a given FWHM.\n VectorType vVariance;\n vVariance = vFWHM \/ (2.0 * sqrt(2.0 * log(2.0)));\n \/\/std::cout << vVariance << std::endl;\n\n VectorType vVoxelSize = petReader->GetOutput()->GetSpacing();\n \/\/std::cout << vVoxelSize << std::endl;\n\n vVariance[0] = pow(vVariance[0], 2);\n vVariance[1] = pow(vVariance[1], 2);\n vVariance[2] = pow(vVariance[2], 2);\n\n FilterType::Pointer rlFilter = FilterType::New();\n rlFilter->SetInput( petReader->GetOutput() );\n rlFilter->SetPSF(vVariance);\n rlFilter->SetIterations( nNumOfIters );\n \/\/rlFilter->SetStoppingCond( fStop );\n rlFilter->SetVerbose ( bDebug );\n\n \/\/Perform RL.\n try {\n rlFilter->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"[Error]\\tfailure applying Richardson-Lucy on: \" << sPETFileName\n << \"\\n\" << err\n << std::endl;\n return EXIT_FAILURE;\n }\n\n PETWriterType::Pointer petWriter = PETWriterType::New();\n petWriter->SetFileName(sOutputFileName);\n petWriter->SetInput( rlFilter->GetOutput() );\n\n try {\n petWriter->Update();\n } catch (itk::ExceptionObject & err) {\n std::cerr << \"\\n[Error]\\tCannot write output file: \" << sOutputFileName\n << std::endl;\n\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\nstd::string getAcknowledgments(void)\n{\n \/\/Produces acknowledgments string for 3DSlicer.\n std::string sAck = \"This program implements the Richardson-Lucy (RL) partial volume correction technique. Please cite the following paper:\\n\"\n \"\\tTohka, J. and Reilhac A., (2008). \\\"Deconvolution-based partial volume correction in Raclopride-PET\\n\\tand Monte Carlo comparison to MR-based method\\\", NeuroImage, vol. 39. 1570--1584.\";\n\n return sAck;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2008 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <grp.h>\n#include <paths.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"debugger.h\"\n#include \"jni_internal.h\"\n#include \"JniConstants.h\"\n#include \"JNIHelp.h\"\n#include \"ScopedLocalRef.h\"\n#include \"ScopedPrimitiveArray.h\"\n#include \"ScopedUtfChars.h\"\n#include \"thread.h\"\n\n#if defined(HAVE_PRCTL)\n#include <sys\/prctl.h>\n#endif\n\nnamespace art {\n\nstatic pid_t gSystemServerPid = 0;\n\nstatic void Zygote_nativeExecShell(JNIEnv* env, jclass, jstring javaCommand) {\n ScopedUtfChars command(env, javaCommand);\n if (command.c_str() == NULL) {\n return;\n }\n const char* argp[] = {_PATH_BSHELL, \"-c\", command.c_str(), NULL};\n LOG(INFO) << \"Exec: \" << argp[0] << ' ' << argp[1] << ' ' << argp[2];\n\n execv(_PATH_BSHELL, const_cast<char**>(argp));\n exit(127);\n}\n\n\/\/ This signal handler is for zygote mode, since the zygote must reap its children\nstatic void SigChldHandler(int \/*signal_number*\/) {\n pid_t pid;\n int status;\n\n while ((pid = waitpid(-1, &status, WNOHANG)) > 0) {\n \/\/ Log process-death status that we care about. In general it is\n \/\/ not safe to call LOG(...) from a signal handler because of\n \/\/ possible reentrancy. However, we know a priori that the\n \/\/ current implementation of LOG() is safe to call from a SIGCHLD\n \/\/ handler in the zygote process. If the LOG() implementation\n \/\/ changes its locking strategy or its use of syscalls within the\n \/\/ lazy-init critical section, its use here may become unsafe.\n if (WIFEXITED(status)) {\n if (WEXITSTATUS(status)) {\n LOG(INFO) << \"Process \" << pid << \" exited cleanly (\" << WEXITSTATUS(status) << \")\";\n } else if (false) {\n LOG(INFO) << \"Process \" << pid << \" exited cleanly (\" << WEXITSTATUS(status) << \")\";\n }\n } else if (WIFSIGNALED(status)) {\n if (WTERMSIG(status) != SIGKILL) {\n LOG(INFO) << \"Process \" << pid << \" terminated by signal (\" << WTERMSIG(status) << \")\";\n } else if (false) {\n LOG(INFO) << \"Process \" << pid << \" terminated by signal (\" << WTERMSIG(status) << \")\";\n }\n#ifdef WCOREDUMP\n if (WCOREDUMP(status)) {\n LOG(INFO) << \"Process \" << pid << \" dumped core\";\n }\n#endif \/* ifdef WCOREDUMP *\/\n }\n\n \/\/ If the just-crashed process is the system_server, bring down zygote\n \/\/ so that it is restarted by init and system server will be restarted\n \/\/ from there.\n if (pid == gSystemServerPid) {\n LOG(ERROR) << \"Exit zygote because system server (\" << pid << \") has terminated\";\n kill(getpid(), SIGKILL);\n }\n }\n\n if (pid < 0) {\n PLOG(WARNING) << \"Zygote SIGCHLD error in waitpid\";\n }\n}\n\n\/\/ Configures the SIGCHLD handler for the zygote process. This is configured\n\/\/ very late, because earlier in the runtime we may fork() and exec()\n\/\/ other processes, and we want to waitpid() for those rather than\n\/\/ have them be harvested immediately.\n\/\/\n\/\/ This ends up being called repeatedly before each fork(), but there's\n\/\/ no real harm in that.\nstatic void SetSigChldHandler() {\n struct sigaction sa;\n memset(&sa, 0, sizeof(sa));\n sa.sa_handler = SigChldHandler;\n\n int err = sigaction(SIGCHLD, &sa, NULL);\n if (err < 0) {\n PLOG(WARNING) << \"Error setting SIGCHLD handler\";\n }\n}\n\n\/\/ Sets the SIGCHLD handler back to default behavior in zygote children.\nstatic void UnsetSigChldHandler() {\n struct sigaction sa;\n memset(&sa, 0, sizeof(sa));\n sa.sa_handler = SIG_DFL;\n\n int err = sigaction(SIGCHLD, &sa, NULL);\n if (err < 0) {\n PLOG(WARNING) << \"Error unsetting SIGCHLD handler\";\n }\n}\n\n\/\/ Calls POSIX setgroups() using the int[] object as an argument.\n\/\/ A NULL argument is tolerated.\nstatic int SetGids(JNIEnv* env, jintArray javaGids) {\n if (javaGids == NULL) {\n return 0;\n }\n\n COMPILE_ASSERT(sizeof(gid_t) == sizeof(jint), sizeof_gid_and_jint_are_differerent);\n ScopedIntArrayRO gids(env, javaGids);\n if (gids.get() == NULL) {\n return -1;\n }\n return setgroups(gids.size(), (const gid_t *) &gids[0]);\n}\n\n\/\/ Sets the resource limits via setrlimit(2) for the values in the\n\/\/ two-dimensional array of integers that's passed in. The second dimension\n\/\/ contains a tuple of length 3: (resource, rlim_cur, rlim_max). NULL is\n\/\/ treated as an empty array.\n\/\/\n\/\/ -1 is returned on error.\nstatic int SetRLimits(JNIEnv* env, jobjectArray javaRlimits) {\n if (javaRlimits == NULL) {\n return 0;\n }\n\n rlimit rlim;\n memset(&rlim, 0, sizeof(rlim));\n\n for (int i = 0; i < env->GetArrayLength(javaRlimits); i++) {\n ScopedLocalRef<jobject> javaRlimitObject(env, env->GetObjectArrayElement(javaRlimits, i));\n ScopedIntArrayRO javaRlimit(env, reinterpret_cast<jintArray>(javaRlimitObject.get()));\n if (javaRlimit.size() != 3) {\n LOG(ERROR) << \"rlimits array must have a second dimension of size 3\";\n return -1;\n }\n\n rlim.rlim_cur = javaRlimit[1];\n rlim.rlim_max = javaRlimit[2];\n\n int err = setrlimit(javaRlimit[0], &rlim);\n if (err < 0) {\n return -1;\n }\n }\n return 0;\n}\n\n#if defined(HAVE_ANDROID_OS)\nstatic void SetCapabilities(int64_t permitted, int64_t effective) {\n __user_cap_header_struct capheader;\n __user_cap_data_struct capdata;\n\n memset(&capheader, 0, sizeof(capheader));\n memset(&capdata, 0, sizeof(capdata));\n\n capheader.version = _LINUX_CAPABILITY_VERSION;\n capheader.pid = 0;\n\n capdata.effective = effective;\n capdata.permitted = permitted;\n\n if (capset(&capheader, &capdata) != 0) {\n PLOG(FATAL) << \"capset(\" << permitted << \", \" << effective << \") failed\";\n }\n}\n#else\nstatic void SetCapabilities(int64_t, int64_t) {}\n#endif\n\nstatic void EnableDebugFeatures(uint32_t debug_flags) {\n \/\/ Must match values in dalvik.system.Zygote.\n enum {\n DEBUG_ENABLE_DEBUGGER = 1,\n DEBUG_ENABLE_CHECKJNI = 1 << 1,\n DEBUG_ENABLE_ASSERT = 1 << 2,\n DEBUG_ENABLE_SAFEMODE = 1 << 3,\n DEBUG_ENABLE_JNI_LOGGING = 1 << 4,\n };\n\n if ((debug_flags & DEBUG_ENABLE_CHECKJNI) != 0) {\n Runtime* runtime = Runtime::Current();\n JavaVMExt* vm = runtime->GetJavaVM();\n if (!vm->check_jni) {\n LOG(DEBUG) << \"Late-enabling -Xcheck:jni\";\n vm->SetCheckJniEnabled(true);\n \/\/ There's only one thread running at this point, so only one JNIEnv to fix up.\n Thread::Current()->GetJniEnv()->SetCheckJniEnabled(true);\n } else {\n LOG(DEBUG) << \"Not late-enabling -Xcheck:jni (already on)\";\n }\n debug_flags &= ~DEBUG_ENABLE_CHECKJNI;\n }\n\n if ((debug_flags & DEBUG_ENABLE_JNI_LOGGING) != 0) {\n gLogVerbosity.third_party_jni = true;\n debug_flags &= ~DEBUG_ENABLE_JNI_LOGGING;\n }\n\n Dbg::SetJdwpAllowed((debug_flags & DEBUG_ENABLE_DEBUGGER) != 0);\n#ifdef HAVE_ANDROID_OS\n if ((debug_flags & DEBUG_ENABLE_DEBUGGER) != 0) {\n \/* To let a non-privileged gdbserver attach to this\n * process, we must set its dumpable bit flag. However\n * we are not interested in generating a coredump in\n * case of a crash, so also set the coredump size to 0\n * to disable that\n *\/\n if (prctl(PR_SET_DUMPABLE, 1, 0, 0, 0) < 0) {\n PLOG(ERROR) << \"could not set dumpable bit flag for pid \" << getpid();\n } else {\n rlimit rl;\n rl.rlim_cur = 0;\n rl.rlim_max = RLIM_INFINITY;\n if (setrlimit(RLIMIT_CORE, &rl) < 0) {\n PLOG(ERROR) << \"could not disable core file generation for pid \" << getpid();\n }\n }\n }\n#endif\n debug_flags &= ~DEBUG_ENABLE_DEBUGGER;\n\n \/\/ These two are for backwards compatibility with Dalvik.\n debug_flags &= ~DEBUG_ENABLE_ASSERT;\n debug_flags &= ~DEBUG_ENABLE_SAFEMODE;\n\n if (debug_flags != 0) {\n LOG(ERROR) << StringPrintf(\"Unknown bits set in debug_flags: %#x\", debug_flags);\n }\n}\n\n#ifdef HAVE_ANDROID_OS\nextern \"C\" int gMallocLeakZygoteChild;\n#endif\n\n\/\/ Utility routine to fork zygote and specialize the child process.\nstatic pid_t ForkAndSpecializeCommon(JNIEnv* env, uid_t uid, gid_t gid, jintArray javaGids,\n jint debug_flags, jobjectArray javaRlimits,\n jlong permittedCapabilities, jlong effectiveCapabilities) {\n Runtime* runtime = Runtime::Current();\n CHECK(runtime->IsZygote()) << \"runtime instance not started with -Xzygote\";\n if (false) { \/\/ TODO: do we need do anything special like !dvmGcPreZygoteFork()?\n LOG(FATAL) << \"pre-fork heap failed\";\n }\n\n SetSigChldHandler();\n\n \/\/ Grab thread before fork potentially makes Thread::pthread_key_self_ unusable.\n Thread* self = Thread::Current();\n\n \/\/ dvmDumpLoaderStats(\"zygote\"); \/\/ TODO: ?\n pid_t pid = fork();\n\n if (pid == 0) {\n \/\/ The child process\n\n#ifdef HAVE_ANDROID_OS\n gMallocLeakZygoteChild = 1;\n\n \/\/ keep caps across UID change, unless we're staying root *\/\n if (uid != 0) {\n int err = prctl(PR_SET_KEEPCAPS, 1, 0, 0, 0);\n if (err < 0) {\n PLOG(FATAL) << \"cannot PR_SET_KEEPCAPS\";\n }\n }\n#endif \/\/ HAVE_ANDROID_OS\n\n int err = SetGids(env, javaGids);\n if (err < 0) {\n PLOG(FATAL) << \"setgroups failed\";\n }\n\n err = SetRLimits(env, javaRlimits);\n if (err < 0) {\n PLOG(FATAL) << \"setrlimit failed\";\n }\n\n err = setgid(gid);\n if (err < 0) {\n PLOG(FATAL) << \"setgid(\" << gid << \") failed\";\n }\n\n err = setuid(uid);\n if (err < 0) {\n PLOG(FATAL) << \"setuid(\" << uid << \") failed\";\n }\n\n SetCapabilities(permittedCapabilities, effectiveCapabilities);\n\n \/\/ Our system thread ID, etc, has changed so reset Thread state.\n self->InitAfterFork();\n\n EnableDebugFeatures(debug_flags);\n\n UnsetSigChldHandler();\n runtime->DidForkFromZygote();\n } else if (pid > 0) {\n \/\/ the parent process\n }\n return pid;\n}\n\nstatic jint Zygote_nativeForkAndSpecialize(JNIEnv* env, jclass, jint uid, jint gid, jintArray gids,\n jint debug_flags, jobjectArray rlimits) {\n return ForkAndSpecializeCommon(env, uid, gid, gids, debug_flags, rlimits, 0, 0);\n}\n\nstatic jint Zygote_nativeForkSystemServer(JNIEnv* env, jclass, uid_t uid, gid_t gid, jintArray gids,\n jint debug_flags, jobjectArray rlimits,\n jlong permittedCapabilities, jlong effectiveCapabilities) {\n pid_t pid = ForkAndSpecializeCommon(env, uid, gid, gids,\n debug_flags, rlimits,\n permittedCapabilities, effectiveCapabilities);\n if (pid > 0) {\n \/\/ The zygote process checks whether the child process has died or not.\n LOG(INFO) << \"System server process \" << pid << \" has been created\";\n gSystemServerPid = pid;\n \/\/ There is a slight window that the system server process has crashed\n \/\/ but it went unnoticed because we haven't published its pid yet. So\n \/\/ we recheck here just to make sure that all is well.\n int status;\n if (waitpid(pid, &status, WNOHANG) == pid) {\n LOG(FATAL) << \"System server process \" << pid << \" has died. Restarting Zygote!\";\n }\n }\n return pid;\n}\n\nstatic JNINativeMethod gMethods[] = {\n NATIVE_METHOD(Zygote, nativeExecShell, \"(Ljava\/lang\/String;)V\"),\n \/\/NATIVE_METHOD(Zygote, nativeFork, \"()I\"),\n NATIVE_METHOD(Zygote, nativeForkAndSpecialize, \"(II[II[[I)I\"),\n NATIVE_METHOD(Zygote, nativeForkSystemServer, \"(II[II[[IJJ)I\"),\n};\n\nvoid register_dalvik_system_Zygote(JNIEnv* env) {\n jniRegisterNativeMethods(env, \"dalvik\/system\/Zygote\", gMethods, NELEM(gMethods));\n}\n\n} \/\/ namespace art\n<commit_msg>am b6636b8e: Add a reminder that we need to track a change in master.<commit_after>\/*\n * Copyright (C) 2008 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <grp.h>\n#include <paths.h>\n#include <signal.h>\n#include <stdlib.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <unistd.h>\n\n#include \"cutils\/sched_policy.h\"\n#include \"debugger.h\"\n#include \"jni_internal.h\"\n#include \"JniConstants.h\"\n#include \"JNIHelp.h\"\n#include \"ScopedLocalRef.h\"\n#include \"ScopedPrimitiveArray.h\"\n#include \"ScopedUtfChars.h\"\n#include \"thread.h\"\n\n#if defined(HAVE_PRCTL)\n#include <sys\/prctl.h>\n#endif\n\nnamespace art {\n\nstatic pid_t gSystemServerPid = 0;\n\nstatic void Zygote_nativeExecShell(JNIEnv* env, jclass, jstring javaCommand) {\n ScopedUtfChars command(env, javaCommand);\n if (command.c_str() == NULL) {\n return;\n }\n const char* argp[] = {_PATH_BSHELL, \"-c\", command.c_str(), NULL};\n LOG(INFO) << \"Exec: \" << argp[0] << ' ' << argp[1] << ' ' << argp[2];\n\n execv(_PATH_BSHELL, const_cast<char**>(argp));\n exit(127);\n}\n\n\/\/ This signal handler is for zygote mode, since the zygote must reap its children\nstatic void SigChldHandler(int \/*signal_number*\/) {\n pid_t pid;\n int status;\n\n while ((pid = waitpid(-1, &status, WNOHANG)) > 0) {\n \/\/ Log process-death status that we care about. In general it is\n \/\/ not safe to call LOG(...) from a signal handler because of\n \/\/ possible reentrancy. However, we know a priori that the\n \/\/ current implementation of LOG() is safe to call from a SIGCHLD\n \/\/ handler in the zygote process. If the LOG() implementation\n \/\/ changes its locking strategy or its use of syscalls within the\n \/\/ lazy-init critical section, its use here may become unsafe.\n if (WIFEXITED(status)) {\n if (WEXITSTATUS(status)) {\n LOG(INFO) << \"Process \" << pid << \" exited cleanly (\" << WEXITSTATUS(status) << \")\";\n } else if (false) {\n LOG(INFO) << \"Process \" << pid << \" exited cleanly (\" << WEXITSTATUS(status) << \")\";\n }\n } else if (WIFSIGNALED(status)) {\n if (WTERMSIG(status) != SIGKILL) {\n LOG(INFO) << \"Process \" << pid << \" terminated by signal (\" << WTERMSIG(status) << \")\";\n } else if (false) {\n LOG(INFO) << \"Process \" << pid << \" terminated by signal (\" << WTERMSIG(status) << \")\";\n }\n#ifdef WCOREDUMP\n if (WCOREDUMP(status)) {\n LOG(INFO) << \"Process \" << pid << \" dumped core\";\n }\n#endif \/* ifdef WCOREDUMP *\/\n }\n\n \/\/ If the just-crashed process is the system_server, bring down zygote\n \/\/ so that it is restarted by init and system server will be restarted\n \/\/ from there.\n if (pid == gSystemServerPid) {\n LOG(ERROR) << \"Exit zygote because system server (\" << pid << \") has terminated\";\n kill(getpid(), SIGKILL);\n }\n }\n\n if (pid < 0) {\n PLOG(WARNING) << \"Zygote SIGCHLD error in waitpid\";\n }\n}\n\n\/\/ Configures the SIGCHLD handler for the zygote process. This is configured\n\/\/ very late, because earlier in the runtime we may fork() and exec()\n\/\/ other processes, and we want to waitpid() for those rather than\n\/\/ have them be harvested immediately.\n\/\/\n\/\/ This ends up being called repeatedly before each fork(), but there's\n\/\/ no real harm in that.\nstatic void SetSigChldHandler() {\n struct sigaction sa;\n memset(&sa, 0, sizeof(sa));\n sa.sa_handler = SigChldHandler;\n\n int err = sigaction(SIGCHLD, &sa, NULL);\n if (err < 0) {\n PLOG(WARNING) << \"Error setting SIGCHLD handler\";\n }\n}\n\n\/\/ Sets the SIGCHLD handler back to default behavior in zygote children.\nstatic void UnsetSigChldHandler() {\n struct sigaction sa;\n memset(&sa, 0, sizeof(sa));\n sa.sa_handler = SIG_DFL;\n\n int err = sigaction(SIGCHLD, &sa, NULL);\n if (err < 0) {\n PLOG(WARNING) << \"Error unsetting SIGCHLD handler\";\n }\n}\n\n\/\/ Calls POSIX setgroups() using the int[] object as an argument.\n\/\/ A NULL argument is tolerated.\nstatic int SetGids(JNIEnv* env, jintArray javaGids) {\n if (javaGids == NULL) {\n return 0;\n }\n\n COMPILE_ASSERT(sizeof(gid_t) == sizeof(jint), sizeof_gid_and_jint_are_differerent);\n ScopedIntArrayRO gids(env, javaGids);\n if (gids.get() == NULL) {\n return -1;\n }\n return setgroups(gids.size(), (const gid_t *) &gids[0]);\n}\n\n\/\/ Sets the resource limits via setrlimit(2) for the values in the\n\/\/ two-dimensional array of integers that's passed in. The second dimension\n\/\/ contains a tuple of length 3: (resource, rlim_cur, rlim_max). NULL is\n\/\/ treated as an empty array.\n\/\/\n\/\/ -1 is returned on error.\nstatic int SetRLimits(JNIEnv* env, jobjectArray javaRlimits) {\n if (javaRlimits == NULL) {\n return 0;\n }\n\n rlimit rlim;\n memset(&rlim, 0, sizeof(rlim));\n\n for (int i = 0; i < env->GetArrayLength(javaRlimits); i++) {\n ScopedLocalRef<jobject> javaRlimitObject(env, env->GetObjectArrayElement(javaRlimits, i));\n ScopedIntArrayRO javaRlimit(env, reinterpret_cast<jintArray>(javaRlimitObject.get()));\n if (javaRlimit.size() != 3) {\n LOG(ERROR) << \"rlimits array must have a second dimension of size 3\";\n return -1;\n }\n\n rlim.rlim_cur = javaRlimit[1];\n rlim.rlim_max = javaRlimit[2];\n\n int err = setrlimit(javaRlimit[0], &rlim);\n if (err < 0) {\n return -1;\n }\n }\n return 0;\n}\n\n#if defined(HAVE_ANDROID_OS)\nstatic void SetCapabilities(int64_t permitted, int64_t effective) {\n __user_cap_header_struct capheader;\n __user_cap_data_struct capdata;\n\n memset(&capheader, 0, sizeof(capheader));\n memset(&capdata, 0, sizeof(capdata));\n\n capheader.version = _LINUX_CAPABILITY_VERSION;\n capheader.pid = 0;\n\n capdata.effective = effective;\n capdata.permitted = permitted;\n\n if (capset(&capheader, &capdata) != 0) {\n PLOG(FATAL) << \"capset(\" << permitted << \", \" << effective << \") failed\";\n }\n}\n#else\nstatic void SetCapabilities(int64_t, int64_t) {}\n#endif\n\nstatic void EnableDebugFeatures(uint32_t debug_flags) {\n \/\/ Must match values in dalvik.system.Zygote.\n enum {\n DEBUG_ENABLE_DEBUGGER = 1,\n DEBUG_ENABLE_CHECKJNI = 1 << 1,\n DEBUG_ENABLE_ASSERT = 1 << 2,\n DEBUG_ENABLE_SAFEMODE = 1 << 3,\n DEBUG_ENABLE_JNI_LOGGING = 1 << 4,\n };\n\n if ((debug_flags & DEBUG_ENABLE_CHECKJNI) != 0) {\n Runtime* runtime = Runtime::Current();\n JavaVMExt* vm = runtime->GetJavaVM();\n if (!vm->check_jni) {\n LOG(DEBUG) << \"Late-enabling -Xcheck:jni\";\n vm->SetCheckJniEnabled(true);\n \/\/ There's only one thread running at this point, so only one JNIEnv to fix up.\n Thread::Current()->GetJniEnv()->SetCheckJniEnabled(true);\n } else {\n LOG(DEBUG) << \"Not late-enabling -Xcheck:jni (already on)\";\n }\n debug_flags &= ~DEBUG_ENABLE_CHECKJNI;\n }\n\n if ((debug_flags & DEBUG_ENABLE_JNI_LOGGING) != 0) {\n gLogVerbosity.third_party_jni = true;\n debug_flags &= ~DEBUG_ENABLE_JNI_LOGGING;\n }\n\n Dbg::SetJdwpAllowed((debug_flags & DEBUG_ENABLE_DEBUGGER) != 0);\n#ifdef HAVE_ANDROID_OS\n if ((debug_flags & DEBUG_ENABLE_DEBUGGER) != 0) {\n \/* To let a non-privileged gdbserver attach to this\n * process, we must set its dumpable bit flag. However\n * we are not interested in generating a coredump in\n * case of a crash, so also set the coredump size to 0\n * to disable that\n *\/\n if (prctl(PR_SET_DUMPABLE, 1, 0, 0, 0) < 0) {\n PLOG(ERROR) << \"could not set dumpable bit flag for pid \" << getpid();\n } else {\n rlimit rl;\n rl.rlim_cur = 0;\n rl.rlim_max = RLIM_INFINITY;\n if (setrlimit(RLIMIT_CORE, &rl) < 0) {\n PLOG(ERROR) << \"could not disable core file generation for pid \" << getpid();\n }\n }\n }\n#endif\n debug_flags &= ~DEBUG_ENABLE_DEBUGGER;\n\n \/\/ These two are for backwards compatibility with Dalvik.\n debug_flags &= ~DEBUG_ENABLE_ASSERT;\n debug_flags &= ~DEBUG_ENABLE_SAFEMODE;\n\n if (debug_flags != 0) {\n LOG(ERROR) << StringPrintf(\"Unknown bits set in debug_flags: %#x\", debug_flags);\n }\n}\n\n#ifdef HAVE_ANDROID_OS\nextern \"C\" int gMallocLeakZygoteChild;\n#endif\n\n\/\/ Utility routine to fork zygote and specialize the child process.\nstatic pid_t ForkAndSpecializeCommon(JNIEnv* env, uid_t uid, gid_t gid, jintArray javaGids,\n jint debug_flags, jobjectArray javaRlimits,\n jlong permittedCapabilities, jlong effectiveCapabilities) {\n Runtime* runtime = Runtime::Current();\n CHECK(runtime->IsZygote()) << \"runtime instance not started with -Xzygote\";\n if (false) { \/\/ TODO: do we need do anything special like !dvmGcPreZygoteFork()?\n LOG(FATAL) << \"pre-fork heap failed\";\n }\n\n SetSigChldHandler();\n\n \/\/ Grab thread before fork potentially makes Thread::pthread_key_self_ unusable.\n Thread* self = Thread::Current();\n\n \/\/ dvmDumpLoaderStats(\"zygote\"); \/\/ TODO: ?\n pid_t pid = fork();\n\n if (pid == 0) {\n \/\/ The child process\n\n#ifdef HAVE_ANDROID_OS\n gMallocLeakZygoteChild = 1;\n\n \/\/ keep caps across UID change, unless we're staying root *\/\n if (uid != 0) {\n int err = prctl(PR_SET_KEEPCAPS, 1, 0, 0, 0);\n if (err < 0) {\n PLOG(FATAL) << \"cannot PR_SET_KEEPCAPS\";\n }\n }\n#endif \/\/ HAVE_ANDROID_OS\n\n int err = SetGids(env, javaGids);\n if (err < 0) {\n PLOG(FATAL) << \"setgroups failed\";\n }\n\n err = SetRLimits(env, javaRlimits);\n if (err < 0) {\n PLOG(FATAL) << \"setrlimit failed\";\n }\n\n err = setgid(gid);\n if (err < 0) {\n PLOG(FATAL) << \"setgid(\" << gid << \") failed\";\n }\n\n err = setuid(uid);\n if (err < 0) {\n PLOG(FATAL) << \"setuid(\" << uid << \") failed\";\n }\n\n SetCapabilities(permittedCapabilities, effectiveCapabilities);\n\n#if 1\n UNIMPLEMENTED(WARNING) << \"enable this code when cutils\/sched_policy.h has SP_DEFAULT\";\n#else\n err = set_sched_policy(0, SP_DEFAULT);\n if (err < 0) {\n errno = -err;\n PLOG(FATAL) << \"set_sched_policy(0, SP_DEFAULT) failed\";\n }\n#endif\n\n \/\/ Our system thread ID, etc, has changed so reset Thread state.\n self->InitAfterFork();\n\n EnableDebugFeatures(debug_flags);\n\n UnsetSigChldHandler();\n runtime->DidForkFromZygote();\n } else if (pid > 0) {\n \/\/ the parent process\n }\n return pid;\n}\n\nstatic jint Zygote_nativeForkAndSpecialize(JNIEnv* env, jclass, jint uid, jint gid, jintArray gids,\n jint debug_flags, jobjectArray rlimits) {\n return ForkAndSpecializeCommon(env, uid, gid, gids, debug_flags, rlimits, 0, 0);\n}\n\nstatic jint Zygote_nativeForkSystemServer(JNIEnv* env, jclass, uid_t uid, gid_t gid, jintArray gids,\n jint debug_flags, jobjectArray rlimits,\n jlong permittedCapabilities, jlong effectiveCapabilities) {\n pid_t pid = ForkAndSpecializeCommon(env, uid, gid, gids,\n debug_flags, rlimits,\n permittedCapabilities, effectiveCapabilities);\n if (pid > 0) {\n \/\/ The zygote process checks whether the child process has died or not.\n LOG(INFO) << \"System server process \" << pid << \" has been created\";\n gSystemServerPid = pid;\n \/\/ There is a slight window that the system server process has crashed\n \/\/ but it went unnoticed because we haven't published its pid yet. So\n \/\/ we recheck here just to make sure that all is well.\n int status;\n if (waitpid(pid, &status, WNOHANG) == pid) {\n LOG(FATAL) << \"System server process \" << pid << \" has died. Restarting Zygote!\";\n }\n }\n return pid;\n}\n\nstatic JNINativeMethod gMethods[] = {\n NATIVE_METHOD(Zygote, nativeExecShell, \"(Ljava\/lang\/String;)V\"),\n \/\/NATIVE_METHOD(Zygote, nativeFork, \"()I\"),\n NATIVE_METHOD(Zygote, nativeForkAndSpecialize, \"(II[II[[I)I\"),\n NATIVE_METHOD(Zygote, nativeForkSystemServer, \"(II[II[[IJJ)I\"),\n};\n\nvoid register_dalvik_system_Zygote(JNIEnv* env) {\n jniRegisterNativeMethods(env, \"dalvik\/system\/Zygote\", gMethods, NELEM(gMethods));\n}\n\n} \/\/ namespace art\n<|endoftext|>"} {"text":"<commit_before>#include <QDebug>\n#include <QDir>\n#include <QTemporaryFile>\n#include <iostream>\n#include \"kernel.h\"\n#include \"geometries.h\"\n#include \"ilwiscontext.h\"\n#include \"grid.h\"\n\nusing namespace Ilwis;\nGridBlockInternal::GridBlockInternal(quint32 lines , quint32 width) : _size(Size(lines,width,1)),_initialized(false), _loaded(false)\n\n{\n _undef = undef<double>();\n _id = ++_blockid;\n _blockSize = _size.xsize()* _size.ysize();\n}\n\nGridBlockInternal::~GridBlockInternal() {\n\n}\n\nSize GridBlockInternal::size() const {\n return _size;\n}\n\nGridBlockInternal *GridBlockInternal::clone()\n{\n GridBlockInternal *block = new GridBlockInternal(_size.xsize(), _size.ysize());\n block->prepare();\n block->_undef = _undef;\n block->_index = 0;\n block->_blockSize = _blockSize;\n if(!isLoaded())\n load();\n std::copy(_data.begin(), _data.end(), block->_data.begin());\n\n return block;\n\n\n}\n\nchar *GridBlockInternal::blockAsMemory() {\n prepare();\n return (char *)&_data[0];\n}\n\nvoid GridBlockInternal::fill(const std::vector<double>& values) {\n\n if ( values.size() != _data.size())\n prepare();\n copy(values.begin(), values.end(), _data.begin());\n\n}\n\nquint32 GridBlockInternal::blockSize() {\n return _blockSize;\n}\n\nbool GridBlockInternal::isLoaded() const {\n return _loaded;\n}\n\ninline bool GridBlockInternal::unload() {\n if ( _tempName == sUNDEF) {\n QString name = QString(\"gridblock_%1\").arg(_id);\n QDir localDir(context()->temporaryWorkLocation().toLocalFile());\n if ( !localDir.exists()) {\n localDir.mkpath(localDir.absolutePath());\n }\n _tempName = localDir.absolutePath() + \"\/\" + name;\n }\n if ( _swapFile.isNull()) {\n _swapFile.reset(new QTemporaryFile(_tempName));\n\n }\n if(!_swapFile->open() ){\n return ERROR1(ERR_COULD_NOT_OPEN_WRITING_1,_tempName);\n }\n quint64 bytesNeeded = _data.size() * sizeof(double);\n quint64 total =_swapFile->write((char *)&_data[0], bytesNeeded);\n _swapFile->close();\n if ( total != bytesNeeded) {\n return ERROR1(ERR_COULD_NOT_OPEN_WRITING_1,_tempName);\n }\n _loaded = false;\n _initialized = false;\n _data.clear();\n\n return true;\n\n}\n\nbool GridBlockInternal::load() {\n _loaded = true;\n prepare();\n if ( _tempName == sUNDEF) {\n return true; \/\/ totaly new block; never been swapped so no load needed\n }\n quint64 bytesNeeded = _data.size() * sizeof(double);\n if(!_swapFile->open() ){\n return ERROR1(ERR_COULD_NOT_OPEN_READING_1,_tempName);\n }\n quint64 total =_swapFile->read((char *)&_data[0], bytesNeeded);\n\n _swapFile->close();\n if ( total != bytesNeeded) {\n _loaded = false;\n return ERROR1(ERR_COULD_NOT_OPEN_READING_1,_tempName);\n }\n return true;\n\n}\n\n\n\/\/----------------------------------------------------------------------\nGrid::Grid(const Size& sz, int maxLines) : _maxLines(maxLines){\n \/\/Locker lock(_mutex);\n\n setSize(sz);\n quint64 bytesNeeded = _size.totalSize() * sizeof(double);\n quint64 mleft = context()->memoryLeft();\n _memUsed = std::min(bytesNeeded, mleft\/2);\n context()->changeMemoryLeft(-_memUsed);\n int n = numberOfBlocks();\n _inMemoryIndex = std::max(1ULL, n * _memUsed \/ bytesNeeded);\n _blocksPerBand = n \/ sz.zsize();\n\n}\n\nquint32 Grid::blockSize(quint32 index) const {\n if ( index < _blockSizes.size() )\n return _blockSizes[index];\n return iUNDEF;\n}\n\nGrid::~Grid() {\n clear();\n context()->changeMemoryLeft(_memUsed);\n}\n\nSize Grid::size() const {\n return _size;\n}\n\nint Grid::maxLines() const\n{\n return _maxLines;\n}\n\nGrid *Grid::clone(quint32 index1, quint32 index2)\n{\n if ( index2 < index1){\n ERROR2(ERR_INVALID_INIT_FOR_2,TR(\"grid limits\"),TR(\"clone grid\"));\n return 0;\n }\n quint32 start = index1 == iUNDEF ? 0 : index1;\n quint32 end = index2 == iUNDEF ? _blocks.size() \/ _blocksPerBand : index2 + 1;\n\n Grid *grid = new Grid(Size(_size.xsize(), _size.ysize(), end - start), _maxLines);\n grid->prepare();\n\n quint32 startBlock = start * _blocksPerBand;\n quint32 endBlock = std::min(end * _blocksPerBand, _blocks.size());\n for(int i=startBlock, j=0; i < endBlock; ++i, ++j) {\n grid->_blocks[j] = _blocks[i]->clone();\n }\n grid->_inMemoryIndex = 1;\n grid->_memUsed = _memUsed;\n return grid;\n\n}\n\nvoid Grid::clear() {\n _size = Size();\n _blockSizes.clear();\n for(quint32 i = 0; i < _blocks.size(); ++i) {\n delete _blocks[i];\n }\n _blocks.clear();\n}\n\ndouble Grid::value(const Pixel &pix) {\n if ( pix.x <0 || pix.y < 0 || pix.z < 0)\n return rUNDEF;\n quint32 yoff = (qint32)pix.y % _maxLines;\n quint32 block = pix.y \/ _maxLines;\n quint32 bandBlocks = _blocksPerBand * pix.z;\n quint32 offset = _offsets[yoff][pix.x];\n return value(bandBlocks + block, offset);\n}\n\ninline double &Grid::value(quint32 block, int offset ) {\n if ( _blocks.size() <= _inMemoryIndex) \/\/ no cache case\n return _blocks[block]->at(offset);\n\n update(block);\n\n return _blocks[_cacheHead]->at(offset);\n}\n\n\n\ninline void Grid::setValue(quint32 block, int offset, double v ) {\n if ( _blocks.size() <= _inMemoryIndex) {\n _blocks[block]->at(offset) = v;\n return ;\n }\n\n if(!update(block))\n return ;\n\n _blocks[_cacheHead]->at(offset) = v;\n}\n\nquint32 Grid::blocks() const {\n return _blocks.size();\n}\n\nquint32 Grid::blocksPerBand() const {\n return _blocksPerBand;\n}\n\nvoid Grid::setBlock(quint32 block, const std::vector<double>& data, bool creation) {\n if ( _blocks.size() <= _inMemoryIndex) { \/\/ no cache case\n _blocks[block]->fill(data);\n return ;\n }\n if(!update(block, creation))\n return ;\n _blocks[_cache[block]]->fill(data);\n}\n\nchar *Grid::blockAsMemory(quint32 block, bool creation) {\n if ( _blocks.size() <= _inMemoryIndex) { \/\/ no cache case\n GridBlockInternal *du = _blocks[block];\n char * p = du->blockAsMemory();\n return p;\n }\n\n if(!update(block, creation))\n return 0;\n GridBlockInternal *du = _blocks[_cache[block]];\n char * p = du->blockAsMemory();\n return p;\n\n}\n\nvoid Grid::setSize(const Size& sz) {\n if ( _blocks.size() != 0)\n clear();\n _size = sz;\n if ( _size.zsize() == 0)\n _size.zsize(1); \/\/ 1 grid at least in the grid;\n\n}\n\nbool Grid::prepare() {\n Locker lock(_mutex);\n if ( _size.isNull()|| !_size.isValid() || _maxLines == 0) {\n return ERROR0(\"Grid size not properly initialized\");\n }\n\n int nblocks = numberOfBlocks();\n qint32 totalLines = _size.ysize();\n _blocks.resize(nblocks);\n _blockSizes.resize(nblocks);\n _blockOffsets.resize(nblocks);\n\n for(quint32 i = 0; i < _blocks.size(); ++i) {\n int linesPerBlock = std::min((qint32)_maxLines, totalLines);\n _blocks[i] = new GridBlockInternal(linesPerBlock, _size.xsize());\n _blockSizes[i] = linesPerBlock * _size.xsize();\n _blockOffsets[i] = i == 0 ? 0 : _blockOffsets[i-1] + _blockSizes[i];\n totalLines -= _maxLines;\n if ( totalLines <= 0) \/\/ to next band\n totalLines = _size.ysize();\n }\n _offsets.resize(_maxLines);\n for(quint32 y=0; y < _maxLines; ++y) {\n _offsets[y].resize(_size.xsize());\n for(quint32 x=0; x < _size.xsize(); ++x) {\n quint64 linearPos = y * size().xsize() + x;\n _offsets[y][x] = linearPos;\n }\n }\n return true;\n}\n\nint Grid::numberOfBlocks() {\n double rblocks = (double)_size.ysize() \/ _maxLines;\n int nblocks = (int)rblocks;\n double rest = rblocks - nblocks;\n if ( rest >= (1.0 \/ ( _maxLines + 1))) {\n nblocks++;\n }\n return nblocks * _size.zsize();\n}\n\ninline bool Grid::update(quint32 block, bool creation) {\n Locker lock(_mutex);\n if ( block >= _blocks.size() )\n return false;\n if ( !_blocks[block]->isLoaded()) {\n if(!_blocks[block]->load())\n return false;\n }\n if ( creation || _cache.size() == 0) { \/\/ at create time we want to preserver the original order in memory\n\n if ( block > _inMemoryIndex )\n _blocks[_cache.back()]->unload();\n _cache.push_back(block);\n }\n else if ( _cache.front() != block) {\n int index = _cache.indexOf(block);\n if (index >=0) {\n _cache.removeOne(index);\n }\n _cache.push_front(block);\n _cacheHead = block; \/\/ for efficiency, no lookup what the head is\n if ( index > (int)_inMemoryIndex) {\n return _blocks[_cache[_inMemoryIndex]]->unload();\n }\n\n }\n return true;\n}\n\nvoid Grid::unload() {\n Locker lock(_mutex);\n _cache.clear();\n for(GridBlockInternal *block : _blocks) {\n block->unload();\n }\n _inMemoryIndex = 0;\n}\n\n\n\n\n\n<commit_msg>fixed issue on missing check for is3D of a pixel on value access<commit_after>#include <QDebug>\n#include <QDir>\n#include <QTemporaryFile>\n#include <iostream>\n#include \"kernel.h\"\n#include \"geometries.h\"\n#include \"ilwiscontext.h\"\n#include \"grid.h\"\n\nusing namespace Ilwis;\nGridBlockInternal::GridBlockInternal(quint32 lines , quint32 width) : _size(Size(lines,width,1)),_initialized(false), _loaded(false)\n\n{\n _undef = undef<double>();\n _id = ++_blockid;\n _blockSize = _size.xsize()* _size.ysize();\n}\n\nGridBlockInternal::~GridBlockInternal() {\n\n}\n\nSize GridBlockInternal::size() const {\n return _size;\n}\n\nGridBlockInternal *GridBlockInternal::clone()\n{\n GridBlockInternal *block = new GridBlockInternal(_size.xsize(), _size.ysize());\n block->prepare();\n block->_undef = _undef;\n block->_index = 0;\n block->_blockSize = _blockSize;\n if(!isLoaded())\n load();\n std::copy(_data.begin(), _data.end(), block->_data.begin());\n\n return block;\n\n\n}\n\nchar *GridBlockInternal::blockAsMemory() {\n prepare();\n return (char *)&_data[0];\n}\n\nvoid GridBlockInternal::fill(const std::vector<double>& values) {\n\n if ( values.size() != _data.size())\n prepare();\n copy(values.begin(), values.end(), _data.begin());\n\n}\n\nquint32 GridBlockInternal::blockSize() {\n return _blockSize;\n}\n\nbool GridBlockInternal::isLoaded() const {\n return _loaded;\n}\n\ninline bool GridBlockInternal::unload() {\n if ( _tempName == sUNDEF) {\n QString name = QString(\"gridblock_%1\").arg(_id);\n QDir localDir(context()->temporaryWorkLocation().toLocalFile());\n if ( !localDir.exists()) {\n localDir.mkpath(localDir.absolutePath());\n }\n _tempName = localDir.absolutePath() + \"\/\" + name;\n }\n if ( _swapFile.isNull()) {\n _swapFile.reset(new QTemporaryFile(_tempName));\n\n }\n if(!_swapFile->open() ){\n return ERROR1(ERR_COULD_NOT_OPEN_WRITING_1,_tempName);\n }\n quint64 bytesNeeded = _data.size() * sizeof(double);\n quint64 total =_swapFile->write((char *)&_data[0], bytesNeeded);\n _swapFile->close();\n if ( total != bytesNeeded) {\n return ERROR1(ERR_COULD_NOT_OPEN_WRITING_1,_tempName);\n }\n _loaded = false;\n _initialized = false;\n _data.clear();\n\n return true;\n\n}\n\nbool GridBlockInternal::load() {\n _loaded = true;\n prepare();\n if ( _tempName == sUNDEF) {\n return true; \/\/ totaly new block; never been swapped so no load needed\n }\n quint64 bytesNeeded = _data.size() * sizeof(double);\n if(!_swapFile->open() ){\n return ERROR1(ERR_COULD_NOT_OPEN_READING_1,_tempName);\n }\n quint64 total =_swapFile->read((char *)&_data[0], bytesNeeded);\n\n _swapFile->close();\n if ( total != bytesNeeded) {\n _loaded = false;\n return ERROR1(ERR_COULD_NOT_OPEN_READING_1,_tempName);\n }\n return true;\n\n}\n\n\n\/\/----------------------------------------------------------------------\nGrid::Grid(const Size& sz, int maxLines) : _maxLines(maxLines){\n \/\/Locker lock(_mutex);\n\n setSize(sz);\n quint64 bytesNeeded = _size.totalSize() * sizeof(double);\n quint64 mleft = context()->memoryLeft();\n _memUsed = std::min(bytesNeeded, mleft\/2);\n context()->changeMemoryLeft(-_memUsed);\n int n = numberOfBlocks();\n _inMemoryIndex = std::max(1ULL, n * _memUsed \/ bytesNeeded);\n _blocksPerBand = n \/ sz.zsize();\n\n}\n\nquint32 Grid::blockSize(quint32 index) const {\n if ( index < _blockSizes.size() )\n return _blockSizes[index];\n return iUNDEF;\n}\n\nGrid::~Grid() {\n clear();\n context()->changeMemoryLeft(_memUsed);\n}\n\nSize Grid::size() const {\n return _size;\n}\n\nint Grid::maxLines() const\n{\n return _maxLines;\n}\n\nGrid *Grid::clone(quint32 index1, quint32 index2)\n{\n if ( index2 < index1){\n ERROR2(ERR_INVALID_INIT_FOR_2,TR(\"grid limits\"),TR(\"clone grid\"));\n return 0;\n }\n quint32 start = index1 == iUNDEF ? 0 : index1;\n quint32 end = index2 == iUNDEF ? _blocks.size() \/ _blocksPerBand : index2 + 1;\n\n Grid *grid = new Grid(Size(_size.xsize(), _size.ysize(), end - start), _maxLines);\n grid->prepare();\n\n quint32 startBlock = start * _blocksPerBand;\n quint32 endBlock = std::min(end * _blocksPerBand, _blocks.size());\n for(int i=startBlock, j=0; i < endBlock; ++i, ++j) {\n grid->_blocks[j] = _blocks[i]->clone();\n }\n grid->_inMemoryIndex = 1;\n grid->_memUsed = _memUsed;\n return grid;\n\n}\n\nvoid Grid::clear() {\n _size = Size();\n _blockSizes.clear();\n for(quint32 i = 0; i < _blocks.size(); ++i) {\n delete _blocks[i];\n }\n _blocks.clear();\n}\n\ndouble Grid::value(const Pixel &pix) {\n if ( pix.x <0 || pix.y < 0 || (pix.z < 0 &&\n pix.is3D()))\n return rUNDEF;\n quint32 yoff = (qint32)pix.y % _maxLines;\n quint32 block = pix.y \/ _maxLines;\n quint32 bandBlocks = _blocksPerBand * (pix.is3D() ? pix.z : 0);\n quint32 offset = _offsets[yoff][pix.x];\n return value(bandBlocks + block, offset);\n}\n\ninline double &Grid::value(quint32 block, int offset ) {\n if ( _blocks.size() <= _inMemoryIndex) \/\/ no cache case\n return _blocks[block]->at(offset);\n\n update(block);\n\n return _blocks[_cacheHead]->at(offset);\n}\n\n\n\ninline void Grid::setValue(quint32 block, int offset, double v ) {\n if ( _blocks.size() <= _inMemoryIndex) {\n _blocks[block]->at(offset) = v;\n return ;\n }\n\n if(!update(block))\n return ;\n\n _blocks[_cacheHead]->at(offset) = v;\n}\n\nquint32 Grid::blocks() const {\n return _blocks.size();\n}\n\nquint32 Grid::blocksPerBand() const {\n return _blocksPerBand;\n}\n\nvoid Grid::setBlock(quint32 block, const std::vector<double>& data, bool creation) {\n if ( _blocks.size() <= _inMemoryIndex) { \/\/ no cache case\n _blocks[block]->fill(data);\n return ;\n }\n if(!update(block, creation))\n return ;\n _blocks[_cache[block]]->fill(data);\n}\n\nchar *Grid::blockAsMemory(quint32 block, bool creation) {\n if ( _blocks.size() <= _inMemoryIndex) { \/\/ no cache case\n GridBlockInternal *du = _blocks[block];\n char * p = du->blockAsMemory();\n return p;\n }\n\n if(!update(block, creation))\n return 0;\n GridBlockInternal *du = _blocks[_cache[block]];\n char * p = du->blockAsMemory();\n return p;\n\n}\n\nvoid Grid::setSize(const Size& sz) {\n if ( _blocks.size() != 0)\n clear();\n _size = sz;\n if ( _size.zsize() == 0)\n _size.zsize(1); \/\/ 1 grid at least in the grid;\n\n}\n\nbool Grid::prepare() {\n Locker lock(_mutex);\n if ( _size.isNull()|| !_size.isValid() || _maxLines == 0) {\n return ERROR0(\"Grid size not properly initialized\");\n }\n\n int nblocks = numberOfBlocks();\n qint32 totalLines = _size.ysize();\n _blocks.resize(nblocks);\n _blockSizes.resize(nblocks);\n _blockOffsets.resize(nblocks);\n\n for(quint32 i = 0; i < _blocks.size(); ++i) {\n int linesPerBlock = std::min((qint32)_maxLines, totalLines);\n _blocks[i] = new GridBlockInternal(linesPerBlock, _size.xsize());\n _blockSizes[i] = linesPerBlock * _size.xsize();\n _blockOffsets[i] = i == 0 ? 0 : _blockOffsets[i-1] + _blockSizes[i];\n totalLines -= _maxLines;\n if ( totalLines <= 0) \/\/ to next band\n totalLines = _size.ysize();\n }\n _offsets.resize(_maxLines);\n for(quint32 y=0; y < _maxLines; ++y) {\n _offsets[y].resize(_size.xsize());\n for(quint32 x=0; x < _size.xsize(); ++x) {\n quint64 linearPos = y * size().xsize() + x;\n _offsets[y][x] = linearPos;\n }\n }\n return true;\n}\n\nint Grid::numberOfBlocks() {\n double rblocks = (double)_size.ysize() \/ _maxLines;\n int nblocks = (int)rblocks;\n double rest = rblocks - nblocks;\n if ( rest >= (1.0 \/ ( _maxLines + 1))) {\n nblocks++;\n }\n return nblocks * _size.zsize();\n}\n\ninline bool Grid::update(quint32 block, bool creation) {\n Locker lock(_mutex);\n if ( block >= _blocks.size() )\n return false;\n if ( !_blocks[block]->isLoaded()) {\n if(!_blocks[block]->load())\n return false;\n }\n if ( creation || _cache.size() == 0) { \/\/ at create time we want to preserver the original order in memory\n\n if ( block > _inMemoryIndex )\n _blocks[_cache.back()]->unload();\n _cache.push_back(block);\n }\n else if ( _cache.front() != block) {\n int index = _cache.indexOf(block);\n if (index >=0) {\n _cache.removeOne(index);\n }\n _cache.push_front(block);\n _cacheHead = block; \/\/ for efficiency, no lookup what the head is\n if ( index > (int)_inMemoryIndex) {\n return _blocks[_cache[_inMemoryIndex]]->unload();\n }\n\n }\n return true;\n}\n\nvoid Grid::unload() {\n Locker lock(_mutex);\n _cache.clear();\n for(GridBlockInternal *block : _blocks) {\n block->unload();\n }\n _inMemoryIndex = 0;\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"AllocatedSocketAddress.hxx\"\n#include \"address_quark.h\"\n#include \"util\/Error.hxx\"\n#include \"util\/Domain.hxx\"\n\n#include <socket\/resolver.h>\n\n#include <glib.h>\n\n#include <assert.h>\n#include <sys\/un.h>\n#include <netdb.h>\n#include <string.h>\n\nstatic constexpr Domain resolver_domain(\"resolver\");\n\nAllocatedSocketAddress::AllocatedSocketAddress(SocketAddress _address)\n :AllocatedSocketAddress()\n{\n assert(!_address.IsNull());\n\n SetSize(_address.GetSize());\n memcpy(address, _address.GetAddress(), size);\n}\n\nvoid\nAllocatedSocketAddress::SetSize(size_t new_size)\n{\n if (size == new_size)\n return;\n\n free(address);\n size = new_size;\n address = (struct sockaddr *)malloc(size);\n}\n\nvoid\nAllocatedSocketAddress::SetLocal(const char *path)\n{\n const bool is_abstract = *path == '@';\n\n \/* sun_path must be null-terminated unless it's an abstract\n socket *\/\n const size_t path_length = strlen(path) + !is_abstract;\n\n struct sockaddr_un *sun;\n SetSize(sizeof(*sun) - sizeof(sun->sun_path) + path_length);\n sun = (struct sockaddr_un *)address;\n sun->sun_family = AF_UNIX;\n memcpy(sun->sun_path, path, path_length);\n\n if (is_abstract)\n sun->sun_path[0] = 0;\n}\n\nbool\nAllocatedSocketAddress::Parse(const char *p, int default_port,\n bool passive, Error &error)\n{\n if (*p == '\/') {\n SetLocal(p);\n return true;\n }\n\n if (*p == '@') {\n#ifdef __linux\n \/* abstract unix domain socket *\/\n\n SetLocal(p);\n return true;\n#else\n \/* Linux specific feature *\/\n error.Set(resolver_domain, \"Abstract sockets supported only on Linux\");\n return false;\n#endif\n }\n\n static const struct addrinfo hints = {\n .ai_flags = AI_NUMERICHOST,\n .ai_family = AF_UNSPEC,\n .ai_socktype = SOCK_STREAM,\n };\n static const struct addrinfo passive_hints = {\n .ai_flags = AI_NUMERICHOST|AI_PASSIVE,\n .ai_family = AF_UNSPEC,\n .ai_socktype = SOCK_STREAM,\n };\n\n struct addrinfo *ai;\n int result = socket_resolve_host_port(p, default_port,\n passive ? &passive_hints : &hints,\n &ai);\n if (result != 0) {\n error.Format(resolver_domain, result,\n \"Failed to resolve '%s': %s\",\n p, gai_strerror(result));\n return false;\n }\n\n SetSize(ai->ai_addrlen);\n memcpy(address, ai->ai_addr, size);\n\n freeaddrinfo(ai);\n\n return true;\n}\n<commit_msg>net\/AllocatedSocketAddress: use netdb_domain<commit_after>\/*\n * author: Max Kellermann <mk@cm4all.com>\n *\/\n\n#include \"AllocatedSocketAddress.hxx\"\n#include \"Error.hxx\"\n#include \"address_quark.h\"\n#include \"util\/Error.hxx\"\n#include \"util\/Domain.hxx\"\n\n#include <socket\/resolver.h>\n\n#include <glib.h>\n\n#include <assert.h>\n#include <sys\/un.h>\n#include <netdb.h>\n#include <string.h>\n\nstatic constexpr Domain resolver_domain(\"resolver\");\n\nAllocatedSocketAddress::AllocatedSocketAddress(SocketAddress _address)\n :AllocatedSocketAddress()\n{\n assert(!_address.IsNull());\n\n SetSize(_address.GetSize());\n memcpy(address, _address.GetAddress(), size);\n}\n\nvoid\nAllocatedSocketAddress::SetSize(size_t new_size)\n{\n if (size == new_size)\n return;\n\n free(address);\n size = new_size;\n address = (struct sockaddr *)malloc(size);\n}\n\nvoid\nAllocatedSocketAddress::SetLocal(const char *path)\n{\n const bool is_abstract = *path == '@';\n\n \/* sun_path must be null-terminated unless it's an abstract\n socket *\/\n const size_t path_length = strlen(path) + !is_abstract;\n\n struct sockaddr_un *sun;\n SetSize(sizeof(*sun) - sizeof(sun->sun_path) + path_length);\n sun = (struct sockaddr_un *)address;\n sun->sun_family = AF_UNIX;\n memcpy(sun->sun_path, path, path_length);\n\n if (is_abstract)\n sun->sun_path[0] = 0;\n}\n\nbool\nAllocatedSocketAddress::Parse(const char *p, int default_port,\n bool passive, Error &error)\n{\n if (*p == '\/') {\n SetLocal(p);\n return true;\n }\n\n if (*p == '@') {\n#ifdef __linux\n \/* abstract unix domain socket *\/\n\n SetLocal(p);\n return true;\n#else\n \/* Linux specific feature *\/\n error.Set(resolver_domain, \"Abstract sockets supported only on Linux\");\n return false;\n#endif\n }\n\n static const struct addrinfo hints = {\n .ai_flags = AI_NUMERICHOST,\n .ai_family = AF_UNSPEC,\n .ai_socktype = SOCK_STREAM,\n };\n static const struct addrinfo passive_hints = {\n .ai_flags = AI_NUMERICHOST|AI_PASSIVE,\n .ai_family = AF_UNSPEC,\n .ai_socktype = SOCK_STREAM,\n };\n\n struct addrinfo *ai;\n int result = socket_resolve_host_port(p, default_port,\n passive ? &passive_hints : &hints,\n &ai);\n if (result != 0) {\n error.Format(netdb_domain, result,\n \"Failed to resolve '%s': %s\",\n p, gai_strerror(result));\n return false;\n }\n\n SetSize(ai->ai_addrlen);\n memcpy(address, ai->ai_addr, size);\n\n freeaddrinfo(ai);\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ STP - SFML TMX Parser\n\/\/ Copyright (c) 2013-2014 Manuel Sabogal\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\n\/\/ the Software without restriction, including without limitation the rights to\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\n\/\/ subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"STP\/Core\/Layer.hpp\"\n\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include \"SFML\/Graphics\/RenderTarget.hpp\"\n\nnamespace tmx {\n\nLayer::Layer() {}\n\nLayer::Layer(const std::string& name, unsigned int width,\n unsigned int height, float opacity, bool visible, std::string orientation, sf::Vector2i tilesize) :\n MapObject(name, width, height, opacity, visible),\n orientation_(orientation),\n tile_size_(tilesize) {\n \/\/ Reserve space for each vector to avoid reallocate\n tiles_.reserve(width * height);\n unsigned char alpha = static_cast<unsigned char>(255 * opacity);\n color_.a = alpha;\n}\n\nvoid Layer::AddTile(unsigned int gid, sf::IntRect& tile_rect, tmx::TileSet* tileset) {\n tiles_.emplace_back(gid, tile_rect, orientation_, tile_size_, tileset);\n\ttiles_.back().SetColor(color_);\n}\n\nunsigned int Layer::GetWidth() const {\n return width_;\n}\n\nunsigned int Layer::GetHeight() const {\n return height_;\n}\n\ntmx::Layer::Tile& Layer::GetTile(unsigned int x, unsigned int y) {\n if (x >= width_ || y >= height_) {\n char error[100];\n sprintf(error, \"Error: tile (%u, %u) out of range.\\n\", x, y);\n throw std::out_of_range(error);\n }\n\n unsigned int pos = (y * width_) + x;\n\n return tiles_[pos];\n}\n\nvoid Layer::SetColor(const sf::Color& color) {\n color_.r = color.r;\n color_.g = color.g;\n color_.b = color.b;\n for (auto& tile : tiles_) {\n tile.SetColor(color_);\n }\n}\n\nvoid Layer::SetOpacity(float opacity) {\n color_.a = static_cast<unsigned char>(255 * opacity);\n for (auto& tile : tiles_) {\n tile.SetColor(color_);\n }\n}\n\nvoid Layer::draw(sf::RenderTarget& target, sf::RenderStates states) const {\n if (visible) {\n for (unsigned int i = 0; i < tiles_.size(); ++i)\n target.draw(tiles_[i]);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Layer::Tile implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nLayer::Tile::Tile() {}\n\nLayer::Tile::Tile(unsigned int gid, sf::IntRect tile_rect, std::string orientation, sf::Vector2i tilesize, tmx::TileSet* tileset) :\n gid_(gid),\n tile_rect_(tile_rect),\n tile_properties_(nullptr),\n texture_(nullptr),\n texture_rect_(),\n visible(true) {\n if (tileset) {\n unsigned int id = gid - tileset->GetFirstGID(); \/\/ The local id of the tile in the tileset\n\n texture_ = tileset->GetTexture();\n texture_rect_ = tileset->GetTextureRect(id);\n tile_properties_ = &tileset->GetTile(id);\n }\n \n if (orienation != \"orthogonal\") {\n \tfloat x = tile_rect_.left \/ tilesize.x;\n float y = tile_rect_.top \/ tilesize.y;\n \n \tif (orientation == \"isometric\") {\n \t\ttile_rect_.left = (x-y) * tilesize.x * 0.5;\n tile_rect_.top = (x+y) * tilesize.y * 0.5;\n }\n\n if (orientation == \"staggered\") {\n \tif ((y % 2) == 0) {\n \t\ttile_rect_.left = x * tilesize.x;\n \t}\n \telse {\n \t\ttile_rect_.left = x * tilesize.x + tilesize.x \/2;\n \t}\n \ttile_rect_.top = y * tilesize.y \/ 2;\n }\n }\n\n UpdatePositions();\n UpdateTexCoords();\n}\n\nvoid Layer::Tile::UpdatePositions() {\n sf::FloatRect bounds = GetGlobalBounds();\n\n vertices_[0].position = sf::Vector2f(bounds.left, bounds.top);\n vertices_[1].position = sf::Vector2f(bounds.left + bounds.width, bounds.top);\n vertices_[2].position = sf::Vector2f(bounds.left + bounds.width, bounds.top + bounds.height);\n vertices_[3].position = sf::Vector2f(bounds.left, bounds.top + bounds.height);\n}\n\nvoid Layer::Tile::UpdateTexCoords() {\n float left = static_cast<float>(texture_rect_.left);\n float right = left + texture_rect_.width;\n float top = static_cast<float>(texture_rect_.top);\n float bottom = top + texture_rect_.height;\n\n vertices_[0].texCoords = sf::Vector2f(left, top);\n vertices_[1].texCoords = sf::Vector2f(right, top);\n vertices_[2].texCoords = sf::Vector2f(right, bottom);\n vertices_[3].texCoords = sf::Vector2f(left, bottom);\n}\n\nsf::FloatRect Layer::Tile::GetGlobalBounds() const {\n float left = static_cast<float>(tile_rect_.left);\n float top = static_cast<float>(tile_rect_.top);\n float width = static_cast<float>(tile_rect_.width);\n float height = static_cast<float>(tile_rect_.height);\n\n return sf::FloatRect(left, top, width, height);\n}\n\nbool Layer::Tile::empty() const {\n if (gid_ == 0 || !texture_) return true;\n else return false;\n}\n\nvoid Layer::Tile::SetColor(const sf::Color& color) {\n vertices_[0].color = color;\n vertices_[1].color = color;\n vertices_[2].color = color;\n vertices_[3].color = color;\n}\n\nvoid Layer::Tile::AddProperty(const std::string& name, const std::string& value) {\n tile_properties_->AddProperty(name, value);\n}\n\nstd::string& Layer::Tile::GetPropertyValue(const std::string& name) {\n return tile_properties_->GetPropertyValue(name);\n}\n\nvoid Layer::Tile::draw(sf::RenderTarget& target, sf::RenderStates states) const {\n if (texture_ && visible) {\n states.texture = texture_;\n target.draw(vertices_, 4, sf::Quads, states);\n }\n}\n\n} \/\/ namespace tmx\n<commit_msg>Fix mistake and remove some tabs<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ STP - SFML TMX Parser\n\/\/ Copyright (c) 2013-2014 Manuel Sabogal\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy of\n\/\/ this software and associated documentation files (the \"Software\"), to deal in\n\/\/ the Software without restriction, including without limitation the rights to\n\/\/ use, copy, modify, merge, publish, distribute, sublicense, and\/or sell copies of\n\/\/ the Software, and to permit persons to whom the Software is furnished to do so,\n\/\/ subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n\/\/ FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n\/\/ COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n\/\/ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include \"STP\/Core\/Layer.hpp\"\n\n#include <stdexcept>\n#include <string>\n#include <vector>\n\n#include \"SFML\/Graphics\/RenderTarget.hpp\"\n\nnamespace tmx {\n\nLayer::Layer() {}\n\nLayer::Layer(const std::string& name, unsigned int width,\n unsigned int height, float opacity, bool visible, std::string orientation, sf::Vector2i tilesize) :\n MapObject(name, width, height, opacity, visible),\n orientation_(orientation),\n tile_size_(tilesize) {\n \/\/ Reserve space for each vector to avoid reallocate\n tiles_.reserve(width * height);\n unsigned char alpha = static_cast<unsigned char>(255 * opacity);\n color_.a = alpha;\n}\n\nvoid Layer::AddTile(unsigned int gid, sf::IntRect& tile_rect, tmx::TileSet* tileset) {\n tiles_.emplace_back(gid, tile_rect, orientation_, tile_size_, tileset);\n\ttiles_.back().SetColor(color_);\n}\n\nunsigned int Layer::GetWidth() const {\n return width_;\n}\n\nunsigned int Layer::GetHeight() const {\n return height_;\n}\n\ntmx::Layer::Tile& Layer::GetTile(unsigned int x, unsigned int y) {\n if (x >= width_ || y >= height_) {\n char error[100];\n sprintf(error, \"Error: tile (%u, %u) out of range.\\n\", x, y);\n throw std::out_of_range(error);\n }\n\n unsigned int pos = (y * width_) + x;\n\n return tiles_[pos];\n}\n\nvoid Layer::SetColor(const sf::Color& color) {\n color_.r = color.r;\n color_.g = color.g;\n color_.b = color.b;\n for (auto& tile : tiles_) {\n tile.SetColor(color_);\n }\n}\n\nvoid Layer::SetOpacity(float opacity) {\n color_.a = static_cast<unsigned char>(255 * opacity);\n for (auto& tile : tiles_) {\n tile.SetColor(color_);\n }\n}\n\nvoid Layer::draw(sf::RenderTarget& target, sf::RenderStates states) const {\n if (visible) {\n for (unsigned int i = 0; i < tiles_.size(); ++i)\n target.draw(tiles_[i]);\n }\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Layer::Tile implementation\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nLayer::Tile::Tile() {}\n\nLayer::Tile::Tile(unsigned int gid, sf::IntRect tile_rect, std::string orientation, sf::Vector2i tilesize, tmx::TileSet* tileset) :\n gid_(gid),\n tile_rect_(tile_rect),\n tile_properties_(nullptr),\n texture_(nullptr),\n texture_rect_(),\n visible(true) {\n if (tileset) {\n unsigned int id = gid - tileset->GetFirstGID(); \/\/ The local id of the tile in the tileset\n\n texture_ = tileset->GetTexture();\n texture_rect_ = tileset->GetTextureRect(id);\n tile_properties_ = &tileset->GetTile(id);\n }\n \n if (orientation != \"orthogonal\") {\n \tfloat x = tile_rect_.left \/ tilesize.x;\n float y = tile_rect_.top \/ tilesize.y;\n \n \tif (orientation == \"isometric\") {\n \t tile_rect_.left = (x-y) * tilesize.x * 0.5;\n tile_rect_.top = (x+y) * tilesize.y * 0.5;\n }\n\n if (orientation == \"staggered\") {\n if ((y % 2) == 0) {\n tile_rect_.left = x * tilesize.x;\n }\n else {\n tile_rect_.left = x * tilesize.x + tilesize.x \/2;\n }\n tile_rect_.top = y * tilesize.y \/ 2;\n }\n }\n\n UpdatePositions();\n UpdateTexCoords();\n}\n\nvoid Layer::Tile::UpdatePositions() {\n sf::FloatRect bounds = GetGlobalBounds();\n\n vertices_[0].position = sf::Vector2f(bounds.left, bounds.top);\n vertices_[1].position = sf::Vector2f(bounds.left + bounds.width, bounds.top);\n vertices_[2].position = sf::Vector2f(bounds.left + bounds.width, bounds.top + bounds.height);\n vertices_[3].position = sf::Vector2f(bounds.left, bounds.top + bounds.height);\n}\n\nvoid Layer::Tile::UpdateTexCoords() {\n float left = static_cast<float>(texture_rect_.left);\n float right = left + texture_rect_.width;\n float top = static_cast<float>(texture_rect_.top);\n float bottom = top + texture_rect_.height;\n\n vertices_[0].texCoords = sf::Vector2f(left, top);\n vertices_[1].texCoords = sf::Vector2f(right, top);\n vertices_[2].texCoords = sf::Vector2f(right, bottom);\n vertices_[3].texCoords = sf::Vector2f(left, bottom);\n}\n\nsf::FloatRect Layer::Tile::GetGlobalBounds() const {\n float left = static_cast<float>(tile_rect_.left);\n float top = static_cast<float>(tile_rect_.top);\n float width = static_cast<float>(tile_rect_.width);\n float height = static_cast<float>(tile_rect_.height);\n\n return sf::FloatRect(left, top, width, height);\n}\n\nbool Layer::Tile::empty() const {\n if (gid_ == 0 || !texture_) return true;\n else return false;\n}\n\nvoid Layer::Tile::SetColor(const sf::Color& color) {\n vertices_[0].color = color;\n vertices_[1].color = color;\n vertices_[2].color = color;\n vertices_[3].color = color;\n}\n\nvoid Layer::Tile::AddProperty(const std::string& name, const std::string& value) {\n tile_properties_->AddProperty(name, value);\n}\n\nstd::string& Layer::Tile::GetPropertyValue(const std::string& name) {\n return tile_properties_->GetPropertyValue(name);\n}\n\nvoid Layer::Tile::draw(sf::RenderTarget& target, sf::RenderStates states) const {\n if (texture_ && visible) {\n states.texture = texture_;\n target.draw(vertices_, 4, sf::Quads, states);\n }\n}\n\n} \/\/ namespace tmx\n<|endoftext|>"} {"text":"<commit_before>\/\/===-- TwoAddressInstructionPass.cpp - Two-Address instruction pass ------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the TwoAddress instruction pass which is used\n\/\/ by most register allocators. Two-Address instructions are rewritten\n\/\/ from:\n\/\/\n\/\/ A = B op C\n\/\/\n\/\/ to:\n\/\/\n\/\/ A = B\n\/\/ A op= C\n\/\/\n\/\/ Note that if a register allocator chooses to use this pass, that it\n\/\/ has to be capable of handling the non-SSA nature of these rewritten\n\/\/ virtual registers.\n\/\/\n\/\/ It is also worth noting that the duplicate operand of the two\n\/\/ address instruction is removed.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"twoaddrinstr\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/CodeGen\/LiveVariables.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/CodeGen\/SSARegMap.h\"\n#include \"llvm\/Target\/MRegisterInfo.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\nusing namespace llvm;\n\nSTATISTIC(NumTwoAddressInstrs, \"Number of two-address instructions\");\nSTATISTIC(NumCommuted , \"Number of instructions commuted to coalesce\");\nSTATISTIC(NumConvertedTo3Addr, \"Number of instructions promoted to 3-address\");\n\nnamespace {\n struct VISIBILITY_HIDDEN TwoAddressInstructionPass\n : public MachineFunctionPass {\n static char ID; \/\/ Pass identification, replacement for typeid\n TwoAddressInstructionPass() : MachineFunctionPass((intptr_t)&ID) {}\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const;\n\n \/\/\/ runOnMachineFunction - pass entry point\n bool runOnMachineFunction(MachineFunction&);\n };\n\n char TwoAddressInstructionPass::ID = 0;\n RegisterPass<TwoAddressInstructionPass>\n X(\"twoaddressinstruction\", \"Two-Address instruction pass\");\n}\n\nconst PassInfo *llvm::TwoAddressInstructionPassID = X.getPassInfo();\n\nvoid TwoAddressInstructionPass::getAnalysisUsage(AnalysisUsage &AU) const {\n AU.addRequired<LiveVariables>();\n AU.addPreserved<LiveVariables>();\n AU.addPreservedID(PHIEliminationID);\n MachineFunctionPass::getAnalysisUsage(AU);\n}\n\n\/\/\/ runOnMachineFunction - Reduce two-address instructions to two\n\/\/\/ operands.\n\/\/\/\nbool TwoAddressInstructionPass::runOnMachineFunction(MachineFunction &MF) {\n DOUT << \"Machine Function\\n\";\n const TargetMachine &TM = MF.getTarget();\n const TargetInstrInfo &TII = *TM.getInstrInfo();\n const MRegisterInfo &MRI = *TM.getRegisterInfo();\n LiveVariables &LV = getAnalysis<LiveVariables>();\n\n bool MadeChange = false;\n\n DOUT << \"********** REWRITING TWO-ADDR INSTRS **********\\n\";\n DOUT << \"********** Function: \" << MF.getFunction()->getName() << '\\n';\n\n for (MachineFunction::iterator mbbi = MF.begin(), mbbe = MF.end();\n mbbi != mbbe; ++mbbi) {\n for (MachineBasicBlock::iterator mi = mbbi->begin(), me = mbbi->end();\n mi != me; ++mi) {\n const TargetInstrDescriptor *TID = mi->getInstrDescriptor();\n\n bool FirstTied = true;\n for (unsigned si = 1, e = TID->numOperands; si < e; ++si) {\n int ti = TID->getOperandConstraint(si, TOI::TIED_TO);\n if (ti == -1)\n continue;\n\n if (FirstTied) {\n ++NumTwoAddressInstrs;\n DOUT << '\\t'; DEBUG(mi->print(*cerr.stream(), &TM));\n }\n FirstTied = false;\n\n assert(mi->getOperand(si).isRegister() && mi->getOperand(si).getReg() &&\n mi->getOperand(si).isUse() && \"two address instruction invalid\");\n\n \/\/ if the two operands are the same we just remove the use\n \/\/ and mark the def as def&use, otherwise we have to insert a copy.\n if (mi->getOperand(ti).getReg() != mi->getOperand(si).getReg()) {\n \/\/ rewrite:\n \/\/ a = b op c\n \/\/ to:\n \/\/ a = b\n \/\/ a = a op c\n unsigned regA = mi->getOperand(ti).getReg();\n unsigned regB = mi->getOperand(si).getReg();\n\n assert(MRegisterInfo::isVirtualRegister(regA) &&\n MRegisterInfo::isVirtualRegister(regB) &&\n \"cannot update physical register live information\");\n\n#ifndef NDEBUG\n \/\/ First, verify that we don't have a use of a in the instruction (a =\n \/\/ b + a for example) because our transformation will not work. This\n \/\/ should never occur because we are in SSA form.\n for (unsigned i = 0; i != mi->getNumOperands(); ++i)\n assert((int)i == ti ||\n !mi->getOperand(i).isRegister() ||\n mi->getOperand(i).getReg() != regA);\n#endif\n\n \/\/ If this instruction is not the killing user of B, see if we can\n \/\/ rearrange the code to make it so. Making it the killing user will\n \/\/ allow us to coalesce A and B together, eliminating the copy we are\n \/\/ about to insert.\n if (!LV.KillsRegister(mi, regB)) {\n \/\/ If this instruction is commutative, check to see if C dies. If\n \/\/ so, swap the B and C operands. This makes the live ranges of A\n \/\/ and C joinable.\n \/\/ FIXME: This code also works for A := B op C instructions.\n if ((TID->Flags & M_COMMUTABLE) && mi->getNumOperands() == 3) {\n assert(mi->getOperand(3-si).isRegister() &&\n \"Not a proper commutative instruction!\");\n unsigned regC = mi->getOperand(3-si).getReg();\n if (LV.KillsRegister(mi, regC)) {\n DOUT << \"2addr: COMMUTING : \" << *mi;\n MachineInstr *NewMI = TII.commuteInstruction(mi);\n if (NewMI == 0) {\n DOUT << \"2addr: COMMUTING FAILED!\\n\";\n } else {\n DOUT << \"2addr: COMMUTED TO: \" << *NewMI;\n \/\/ If the instruction changed to commute it, update livevar.\n if (NewMI != mi) {\n LV.instructionChanged(mi, NewMI); \/\/ Update live variables\n mbbi->insert(mi, NewMI); \/\/ Insert the new inst\n mbbi->erase(mi); \/\/ Nuke the old inst.\n mi = NewMI;\n }\n\n ++NumCommuted;\n regB = regC;\n goto InstructionRearranged;\n }\n }\n }\n\n \/\/ If this instruction is potentially convertible to a true\n \/\/ three-address instruction,\n if (TID->Flags & M_CONVERTIBLE_TO_3_ADDR) {\n \/\/ FIXME: This assumes there are no more operands which are tied\n \/\/ to another register.\n#ifndef NDEBUG\n for (unsigned i = si+1, e = TID->numOperands; i < e; ++i)\n assert(TID->getOperandConstraint(i, TOI::TIED_TO) == -1);\n#endif\n\n if (MachineInstr *New = TII.convertToThreeAddress(mbbi, mi, LV)) {\n DOUT << \"2addr: CONVERTING 2-ADDR: \" << *mi;\n DOUT << \"2addr: TO 3-ADDR: \" << *New;\n mbbi->erase(mi); \/\/ Nuke the old inst.\n mi = New;\n ++NumConvertedTo3Addr;\n \/\/ Done with this instruction.\n break;\n }\n }\n }\n\n InstructionRearranged:\n const TargetRegisterClass* rc = MF.getSSARegMap()->getRegClass(regA);\n MRI.copyRegToReg(*mbbi, mi, regA, regB, rc, rc);\n\n MachineBasicBlock::iterator prevMi = prior(mi);\n DOUT << \"\\t\\tprepend:\\t\"; DEBUG(prevMi->print(*cerr.stream(), &TM));\n\n \/\/ Update live variables for regA\n LiveVariables::VarInfo& varInfo = LV.getVarInfo(regA);\n varInfo.DefInst = prevMi;\n\n if (LV.removeVirtualRegisterKilled(regB, mbbi, mi))\n LV.addVirtualRegisterKilled(regB, prevMi);\n\n if (LV.removeVirtualRegisterDead(regB, mbbi, mi))\n LV.addVirtualRegisterDead(regB, prevMi);\n\n \/\/ replace all occurences of regB with regA\n for (unsigned i = 0, e = mi->getNumOperands(); i != e; ++i) {\n if (mi->getOperand(i).isRegister() &&\n mi->getOperand(i).getReg() == regB)\n mi->getOperand(i).setReg(regA);\n }\n }\n\n assert(mi->getOperand(ti).isDef() && mi->getOperand(si).isUse());\n mi->getOperand(ti).setReg(mi->getOperand(si).getReg());\n MadeChange = true;\n\n DOUT << \"\\t\\trewrite to:\\t\"; DEBUG(mi->print(*cerr.stream(), &TM));\n }\n }\n }\n\n return MadeChange;\n}\n<commit_msg>It's possible to commute instrctions with more than 3 operands.<commit_after>\/\/===-- TwoAddressInstructionPass.cpp - Two-Address instruction pass ------===\/\/\n\/\/\n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ This file implements the TwoAddress instruction pass which is used\n\/\/ by most register allocators. Two-Address instructions are rewritten\n\/\/ from:\n\/\/\n\/\/ A = B op C\n\/\/\n\/\/ to:\n\/\/\n\/\/ A = B\n\/\/ A op= C\n\/\/\n\/\/ Note that if a register allocator chooses to use this pass, that it\n\/\/ has to be capable of handling the non-SSA nature of these rewritten\n\/\/ virtual registers.\n\/\/\n\/\/ It is also worth noting that the duplicate operand of the two\n\/\/ address instruction is removed.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#define DEBUG_TYPE \"twoaddrinstr\"\n#include \"llvm\/CodeGen\/Passes.h\"\n#include \"llvm\/Function.h\"\n#include \"llvm\/CodeGen\/LiveVariables.h\"\n#include \"llvm\/CodeGen\/MachineFunctionPass.h\"\n#include \"llvm\/CodeGen\/MachineInstr.h\"\n#include \"llvm\/CodeGen\/SSARegMap.h\"\n#include \"llvm\/Target\/MRegisterInfo.h\"\n#include \"llvm\/Target\/TargetInstrInfo.h\"\n#include \"llvm\/Target\/TargetMachine.h\"\n#include \"llvm\/Support\/Debug.h\"\n#include \"llvm\/Support\/Compiler.h\"\n#include \"llvm\/ADT\/Statistic.h\"\n#include \"llvm\/ADT\/STLExtras.h\"\nusing namespace llvm;\n\nSTATISTIC(NumTwoAddressInstrs, \"Number of two-address instructions\");\nSTATISTIC(NumCommuted , \"Number of instructions commuted to coalesce\");\nSTATISTIC(NumConvertedTo3Addr, \"Number of instructions promoted to 3-address\");\n\nnamespace {\n struct VISIBILITY_HIDDEN TwoAddressInstructionPass\n : public MachineFunctionPass {\n static char ID; \/\/ Pass identification, replacement for typeid\n TwoAddressInstructionPass() : MachineFunctionPass((intptr_t)&ID) {}\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const;\n\n \/\/\/ runOnMachineFunction - pass entry point\n bool runOnMachineFunction(MachineFunction&);\n };\n\n char TwoAddressInstructionPass::ID = 0;\n RegisterPass<TwoAddressInstructionPass>\n X(\"twoaddressinstruction\", \"Two-Address instruction pass\");\n}\n\nconst PassInfo *llvm::TwoAddressInstructionPassID = X.getPassInfo();\n\nvoid TwoAddressInstructionPass::getAnalysisUsage(AnalysisUsage &AU) const {\n AU.addRequired<LiveVariables>();\n AU.addPreserved<LiveVariables>();\n AU.addPreservedID(PHIEliminationID);\n MachineFunctionPass::getAnalysisUsage(AU);\n}\n\n\/\/\/ runOnMachineFunction - Reduce two-address instructions to two\n\/\/\/ operands.\n\/\/\/\nbool TwoAddressInstructionPass::runOnMachineFunction(MachineFunction &MF) {\n DOUT << \"Machine Function\\n\";\n const TargetMachine &TM = MF.getTarget();\n const TargetInstrInfo &TII = *TM.getInstrInfo();\n const MRegisterInfo &MRI = *TM.getRegisterInfo();\n LiveVariables &LV = getAnalysis<LiveVariables>();\n\n bool MadeChange = false;\n\n DOUT << \"********** REWRITING TWO-ADDR INSTRS **********\\n\";\n DOUT << \"********** Function: \" << MF.getFunction()->getName() << '\\n';\n\n for (MachineFunction::iterator mbbi = MF.begin(), mbbe = MF.end();\n mbbi != mbbe; ++mbbi) {\n for (MachineBasicBlock::iterator mi = mbbi->begin(), me = mbbi->end();\n mi != me; ++mi) {\n const TargetInstrDescriptor *TID = mi->getInstrDescriptor();\n\n bool FirstTied = true;\n for (unsigned si = 1, e = TID->numOperands; si < e; ++si) {\n int ti = TID->getOperandConstraint(si, TOI::TIED_TO);\n if (ti == -1)\n continue;\n\n if (FirstTied) {\n ++NumTwoAddressInstrs;\n DOUT << '\\t'; DEBUG(mi->print(*cerr.stream(), &TM));\n }\n FirstTied = false;\n\n assert(mi->getOperand(si).isRegister() && mi->getOperand(si).getReg() &&\n mi->getOperand(si).isUse() && \"two address instruction invalid\");\n\n \/\/ if the two operands are the same we just remove the use\n \/\/ and mark the def as def&use, otherwise we have to insert a copy.\n if (mi->getOperand(ti).getReg() != mi->getOperand(si).getReg()) {\n \/\/ rewrite:\n \/\/ a = b op c\n \/\/ to:\n \/\/ a = b\n \/\/ a = a op c\n unsigned regA = mi->getOperand(ti).getReg();\n unsigned regB = mi->getOperand(si).getReg();\n\n assert(MRegisterInfo::isVirtualRegister(regA) &&\n MRegisterInfo::isVirtualRegister(regB) &&\n \"cannot update physical register live information\");\n\n#ifndef NDEBUG\n \/\/ First, verify that we don't have a use of a in the instruction (a =\n \/\/ b + a for example) because our transformation will not work. This\n \/\/ should never occur because we are in SSA form.\n for (unsigned i = 0; i != mi->getNumOperands(); ++i)\n assert((int)i == ti ||\n !mi->getOperand(i).isRegister() ||\n mi->getOperand(i).getReg() != regA);\n#endif\n\n \/\/ If this instruction is not the killing user of B, see if we can\n \/\/ rearrange the code to make it so. Making it the killing user will\n \/\/ allow us to coalesce A and B together, eliminating the copy we are\n \/\/ about to insert.\n if (!LV.KillsRegister(mi, regB)) {\n \/\/ If this instruction is commutative, check to see if C dies. If\n \/\/ so, swap the B and C operands. This makes the live ranges of A\n \/\/ and C joinable.\n \/\/ FIXME: This code also works for A := B op C instructions.\n if ((TID->Flags & M_COMMUTABLE) && mi->getNumOperands() >= 3) {\n assert(mi->getOperand(3-si).isRegister() &&\n \"Not a proper commutative instruction!\");\n unsigned regC = mi->getOperand(3-si).getReg();\n if (LV.KillsRegister(mi, regC)) {\n DOUT << \"2addr: COMMUTING : \" << *mi;\n MachineInstr *NewMI = TII.commuteInstruction(mi);\n if (NewMI == 0) {\n DOUT << \"2addr: COMMUTING FAILED!\\n\";\n } else {\n DOUT << \"2addr: COMMUTED TO: \" << *NewMI;\n \/\/ If the instruction changed to commute it, update livevar.\n if (NewMI != mi) {\n LV.instructionChanged(mi, NewMI); \/\/ Update live variables\n mbbi->insert(mi, NewMI); \/\/ Insert the new inst\n mbbi->erase(mi); \/\/ Nuke the old inst.\n mi = NewMI;\n }\n\n ++NumCommuted;\n regB = regC;\n goto InstructionRearranged;\n }\n }\n }\n\n \/\/ If this instruction is potentially convertible to a true\n \/\/ three-address instruction,\n if (TID->Flags & M_CONVERTIBLE_TO_3_ADDR) {\n \/\/ FIXME: This assumes there are no more operands which are tied\n \/\/ to another register.\n#ifndef NDEBUG\n for (unsigned i = si+1, e = TID->numOperands; i < e; ++i)\n assert(TID->getOperandConstraint(i, TOI::TIED_TO) == -1);\n#endif\n\n if (MachineInstr *New = TII.convertToThreeAddress(mbbi, mi, LV)) {\n DOUT << \"2addr: CONVERTING 2-ADDR: \" << *mi;\n DOUT << \"2addr: TO 3-ADDR: \" << *New;\n mbbi->erase(mi); \/\/ Nuke the old inst.\n mi = New;\n ++NumConvertedTo3Addr;\n \/\/ Done with this instruction.\n break;\n }\n }\n }\n\n InstructionRearranged:\n const TargetRegisterClass* rc = MF.getSSARegMap()->getRegClass(regA);\n MRI.copyRegToReg(*mbbi, mi, regA, regB, rc, rc);\n\n MachineBasicBlock::iterator prevMi = prior(mi);\n DOUT << \"\\t\\tprepend:\\t\"; DEBUG(prevMi->print(*cerr.stream(), &TM));\n\n \/\/ Update live variables for regA\n LiveVariables::VarInfo& varInfo = LV.getVarInfo(regA);\n varInfo.DefInst = prevMi;\n\n if (LV.removeVirtualRegisterKilled(regB, mbbi, mi))\n LV.addVirtualRegisterKilled(regB, prevMi);\n\n if (LV.removeVirtualRegisterDead(regB, mbbi, mi))\n LV.addVirtualRegisterDead(regB, prevMi);\n\n \/\/ replace all occurences of regB with regA\n for (unsigned i = 0, e = mi->getNumOperands(); i != e; ++i) {\n if (mi->getOperand(i).isRegister() &&\n mi->getOperand(i).getReg() == regB)\n mi->getOperand(i).setReg(regA);\n }\n }\n\n assert(mi->getOperand(ti).isDef() && mi->getOperand(si).isUse());\n mi->getOperand(ti).setReg(mi->getOperand(si).getReg());\n MadeChange = true;\n\n DOUT << \"\\t\\trewrite to:\\t\"; DEBUG(mi->print(*cerr.stream(), &TM));\n }\n }\n }\n\n return MadeChange;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"SendingPromise.hpp\"\n\nusing namespace HomieInternals;\n\nSendingPromise::SendingPromise()\n: _node(nullptr)\n, _property(nullptr)\n, _qos(0)\n, _retained(false)\n, _overwriteSetter(false)\n, _range { .isRange = false, .index = 0 } {\n}\n\nSendingPromise& SendingPromise::setQos(uint8_t qos) {\n _qos = qos;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRetained(bool retained) {\n _retained = retained;\n return *this;\n}\n\nSendingPromise& SendingPromise::overwriteSetter(bool overwrite) {\n _overwriteSetter = overwrite;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRange(const HomieRange& range) {\n _range = range;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRange(uint16_t rangeIndex) {\n HomieRange range;\n range.isRange = true;\n range.index = rangeIndex;\n _range = range;\n return *this;\n}\n\nuint16_t SendingPromise::send(const String& value) {\n if (!Interface::get().ready) {\n Interface::get().getLogger() << F(\"✖ setNodeProperty(): impossible now\") << endl;\n return 0;\n }\n\n char* topic = new char[strlen(Interface::get().getConfig().get().mqtt.baseTopic) + strlen(Interface::get().getConfig().get().deviceId) + 1 + strlen(_node->getId()) + 1 + strlen(_property->c_str()) + 6 + 4 + 1]; \/\/ last + 6 for range _65536, last + 4 for \/set\n strcpy(topic, Interface::get().getConfig().get().mqtt.baseTopic);\n strcat(topic, Interface::get().getConfig().get().deviceId);\n strcat_P(topic, PSTR(\"\/\"));\n strcat(topic, _node->getId());\n if (_range.isRange) {\n char rangeStr[5 + 1]; \/\/ max 65536\n itoa(_range.index, rangeStr, 10);\n strcat_P(topic, PSTR(\"_\"));\n strcat(topic, rangeStr);\n _range.isRange=false;\t\t\t\/\/FIXME: This is a workaround. Problem is that Range is loaded from the property into SendingPromise, but the SendingPromise is global. (one SendingPromise for the HomieClass instance\n _range.index = 0;\n }\n\n strcat_P(topic, PSTR(\"\/\"));\n strcat(topic, _property->c_str());\n\n uint16_t packetId = Interface::get().getMqttClient().publish(topic, _qos, _retained, value.c_str());\n\n if (_overwriteSetter) {\n strcat_P(topic, PSTR(\"\/set\"));\n Interface::get().getMqttClient().publish(topic, 1, true, value.c_str());\n }\n\n delete[] topic;\n\n return packetId;\n}\n\nSendingPromise& SendingPromise::setNode(const HomieNode& node) {\n _node = &node;\n return *this;\n}\n\nSendingPromise& SendingPromise::setProperty(const String& property) {\n _property = &property;\n return *this;\n}\n\nconst HomieNode* SendingPromise::getNode() const {\n return _node;\n}\n\nconst String* SendingPromise::getProperty() const {\n return _property;\n}\n\nuint8_t SendingPromise::getQos() const {\n return _qos;\n}\n\nHomieRange SendingPromise::getRange() const {\n return _range;\n}\n\nbool SendingPromise::isRetained() const {\n return _retained;\n}\n\nbool SendingPromise::doesOverwriteSetter() const {\n return _overwriteSetter;\n}\n<commit_msg>Fix cpplint warnings<commit_after>#include \"SendingPromise.hpp\"\n\nusing namespace HomieInternals;\n\nSendingPromise::SendingPromise()\n: _node(nullptr)\n, _property(nullptr)\n, _qos(0)\n, _retained(false)\n, _overwriteSetter(false)\n, _range { .isRange = false, .index = 0 } {\n}\n\nSendingPromise& SendingPromise::setQos(uint8_t qos) {\n _qos = qos;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRetained(bool retained) {\n _retained = retained;\n return *this;\n}\n\nSendingPromise& SendingPromise::overwriteSetter(bool overwrite) {\n _overwriteSetter = overwrite;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRange(const HomieRange& range) {\n _range = range;\n return *this;\n}\n\nSendingPromise& SendingPromise::setRange(uint16_t rangeIndex) {\n HomieRange range;\n range.isRange = true;\n range.index = rangeIndex;\n _range = range;\n return *this;\n}\n\nuint16_t SendingPromise::send(const String& value) {\n if (!Interface::get().ready) {\n Interface::get().getLogger() << F(\"✖ setNodeProperty(): impossible now\") << endl;\n return 0;\n }\n\n char* topic = new char[strlen(Interface::get().getConfig().get().mqtt.baseTopic) + strlen(Interface::get().getConfig().get().deviceId) + 1 + strlen(_node->getId()) + 1 + strlen(_property->c_str()) + 6 + 4 + 1]; \/\/ last + 6 for range _65536, last + 4 for \/set\n strcpy(topic, Interface::get().getConfig().get().mqtt.baseTopic);\n strcat(topic, Interface::get().getConfig().get().deviceId);\n strcat_P(topic, PSTR(\"\/\"));\n strcat(topic, _node->getId());\n if (_range.isRange) {\n char rangeStr[5 + 1]; \/\/ max 65536\n itoa(_range.index, rangeStr, 10);\n strcat_P(topic, PSTR(\"_\"));\n strcat(topic, rangeStr);\n _range.isRange = false; \/\/FIXME: This is a workaround. Problem is that Range is loaded from the property into SendingPromise, but the SendingPromise is global. (one SendingPromise for the HomieClass instance\n _range.index = 0;\n }\n\n strcat_P(topic, PSTR(\"\/\"));\n strcat(topic, _property->c_str());\n\n uint16_t packetId = Interface::get().getMqttClient().publish(topic, _qos, _retained, value.c_str());\n\n if (_overwriteSetter) {\n strcat_P(topic, PSTR(\"\/set\"));\n Interface::get().getMqttClient().publish(topic, 1, true, value.c_str());\n }\n\n delete[] topic;\n\n return packetId;\n}\n\nSendingPromise& SendingPromise::setNode(const HomieNode& node) {\n _node = &node;\n return *this;\n}\n\nSendingPromise& SendingPromise::setProperty(const String& property) {\n _property = &property;\n return *this;\n}\n\nconst HomieNode* SendingPromise::getNode() const {\n return _node;\n}\n\nconst String* SendingPromise::getProperty() const {\n return _property;\n}\n\nuint8_t SendingPromise::getQos() const {\n return _qos;\n}\n\nHomieRange SendingPromise::getRange() const {\n return _range;\n}\n\nbool SendingPromise::isRetained() const {\n return _retained;\n}\n\nbool SendingPromise::doesOverwriteSetter() const {\n return _overwriteSetter;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"ExpertSystem\/CLIPSFunctionBuilder.h\"\nextern \"C\" {\n#include \"clips.h\"\n}\n\nCLIPSFunctionBuilder::CLIPSFunctionBuilder(std::string nm, \n FunctionNamer& namer) : CLIPSGlobalValueBuilder(nm, \"Function\", namer) { \n}\n\nvoid CLIPSFunctionBuilder::build(Function* fn, KnowledgeConstructor* kc) {\n open();\n addFields(fn, kc);\n close();\n std::string str = getCompletedString();\n kc->addToKnowledgeBase((PointerAddress)arg, str);\n}\n\nvoid CLIPSFunctionBuilder::setCallingConvention(CallingConv::ID id) {\n const char* selection;\n switch(id) {\n case CallingConv::C:\n selection = \"C\";\n break;\n case CallingConv::Fast:\n selection = \"Fast\";\n break;\n case CallingConv::Cold:\n selection = \"Cold\";\n break;\n case CallingConv::GHC:\n selection = \"GHC\";\n break;\n case CallingConv::HiPE:\n selection = \"HiPE\";\n break;\n case CallingConv::FirstTargetCC:\n selection = \"FirstTargetCC\";\n break;\n case CallingConv::X86_StdCall:\n selection = \"x86-stdcall\";\n break;\n case CallingConv::X86_FastCall:\n selection = \"x86-fastcall\";\n break;\n case CallingConv::ARM_APCS:\n selection = \"arm-apcs\";\n break;\n case CallingConv::ARM_AAPCS:\n selection = \"arm-aapcs\";\n break;\n case CallingConv::ARM_AAPCS_VFB:\n selection = \"arm-aapcs-vfb\";\n break;\n case CallingConv::MSP430_INTR:\n selection = \"msp430-intr\";\n break;\n case CallingConv::X86_ThisCall:\n selection = \"x86-thiscall\";\n break;\n case CallingConv::PTX_Kernel:\n selection = \"ptx-kernel\";\n break;\n case CallingConv::PTX_Device:\n selection = \"ptx-device\";\n break;\n case CallingConv::MBLAZE_INTR:\n selection = \"mblaze-intr\";\n break;\n case CallingConv::MBLAZE_SVOL:\n selection = \"mblaze-svol\";\n break;\n case CallingConv::SPIR_FUNC:\n selection = \"spir-func\";\n break;\n case CallingConv::SPIR_KERNEL:\n selection = \"spir-kernel\";\n break;\n case CallingConv::Intel_OCL_BI:\n selection = \"intel-ocl-bi\";\n break;\n default:\n selection = \"Unknown\";\n break;\n }\n addField(\"CallingConvention\", selection);\n}\nvoid CLIPSFunctionBuilder::setAttributes(const AttributeSet& attr) {\n\n}\nvoid CLIPSFunctionBuilder::addFields(Function* func, \n KnowledgeConstructor* kc) {\n\n CLIPSGlobalValueBuilder::addFields(func, kc);\n \/\/this part contains the code for building the function itself\n FunctionNamer& namer = getNamer();\n addField(\"ReturnType\", kc->route(func->getReturnType(), namer));\n addField(\"FunctionType\", kc->route(func->getFunctionType(), namer));\n if(func.isVarArg()) {\n addTrueField(\"IsVarArg\");\n }\n addField(\"IntrinsicID\", func->getIntrinsicID());\n if(func.isIntrinsic()) {\n addTrueField(\"IsIntrinsic\");\n }\n setCallingConvention(func->getCallingConv());\n setAttributes(func->getAttributes());\n if(func.hasGC()) {\n addTrueField(\"HasGC\");\n addField(\"GC\", func->getGC());\n }\n if(func.doesNotAccessMemory()) {\n addTrueField(\"DoesNotAccessMemory\");\n }\n if(func.onlyReadsMemory()) {\n addTrueField(\"OnlyReadsMemory\");\n }\n if(func.doesNotReturn()) {\n addTrueField(\"DoesNotReturn\");\n }\n if(func.cannotDuplicate()) {\n addTrueField(\"CannotDuplicate\");\n }\n if(func.hasUWTable()) {\n addTrueField(\"HasUWTable\");\n }\n if(func.needsUnwindTableEntry()) {\n addTrueField(\"NeedsUnwindTableEntry\");\n }\n if(func.hasStructRetAttr()) {\n addTrueField(\"HasStructRetAttr\");\n }\n \/\/TODO: Expose doesNotAlias, doesNotCapture, and getParamAttributes to \n \/\/CLIPS as functions\n char* fnName = (char*)func.getName().data();\n FunctionNamer& namer = getNamer();\n addField(\"EntryBlock\", kc->route(func.getEntryBlock(), fnName, namer));\n \n}\n\/* Begin C functions for allowing CLIPS to interact with LLVM *\/\n#define msg(x) (char*) x\n#define werror msg(werror)\n#define name_LLVMFunctionSetGC \\\n msg(\"llvm-function-set-gc\")\n#define name_LLVMFunctionClearGC \\\n msg(\"llvm-function-clear-gc\")\n#define name_LLVMFunctionDeleteBody \\\n msg(\"llvm-function-delete-body\")\n#define name_LLVMFunctionRemoveFromParent \\\n msg(\"llvm-function-remove-from-parent\")\n#define name_LLVMFunctionEraseFromParent \\\n msg(\"llvm-function-erase-from-parent\")\n#define name_LLVMFunctionSetDoesNotAccessMemory \\\n msg(\"llvm-function-set-does-not-access-memory\")\n#define name_LLVMFunctionSetDoesNotAlias \\\n msg(\"llvm-function-set-does-not-alias\")\n#define name_LLVMFunctionSetDoesNotCapture \\\n msg(\"llvm-function-set-does-not-capture\")\n#define name_LLVMFunctionSetDoesNotThrow \\\n msg(\"llvm-function-set-does-not-throw\")\n#define name_LLVMFunctionSetHasUWTable \\\n msg(\"llvm-function-set-has-uw-table\")\n#define name_LLVMFunctionSetDoesNotReturn \\\n msg(\"llvm-function-set-does-not-return\")\n#define name_LLVMFunctionSetCannotDuplicate \\\n msg(\"llvm-function-set-cannot-duplicate\")\n#define name_LLVMFunctionSetOnlyReadsMemory \\\n msg(\"llvm-function-set-only-reads-memory\")\n\/* Getters *\/\n#define name_LLVMFunctionDoesNotAlias \\\n msg(\"llvm-function-does-not-alias\")\nextern \"C\" unsigned LLVMFunctionDoesNotAlias(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionDoesNotAlias, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionDoesNotAlias, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionDoesNotAlias, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->doesNotAlias(index);\n }\n}\n#define name_LLVMFunctionDoesNotCapture \\\n msg(\"llvm-function-does-not-capture\")\nextern \"C\" unsigned LLVMFunctionDoesNotCapture(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionDoesNotCapture, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionDoesNotCapture, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionDoesNotCapture, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->doesNotCapture(index);\n }\n}\n#define name_LLVMFunctionGetParamAlignment \\\n msg(\"llvm-function-get-param-alignment\")\nextern \"C\" unsigned LLVMFunctionGetParamAlignment(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionGetParamAlignment, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionGetParamAlignment, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionGetParamAlignment, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->getParamAlignment(index);\n }\n}\nextern \"C\" void RegisterLLVMFunctionManipulationFunctions(void *theEnv) {\n EnvDefineFunction(theEnv, name_LLVMFunctionDoesNotCapture, 'i', \n PTIEF LLVMFunctionDoesNotCapture, \n msg(\"LLVMFunctionDoesNotCapture\"));\n EnvDefineFunction(theEnv, name_LLVMFunctionDoesNotAlias, 'i', \n PTIEF LLVMFunctionDoesNotAlias, \n msg(\"LLVMFunctionDoesNotAlias\"));\n EnvDefineFunction(theEnv, name_LLVMFunctionGetParamAlignment, 'i', \n PTIEF LLVMFunctionGetParamAlignment, \n msg(\"LLVMFunctionGetParamAlignment\"));\n}\n#undef werror\n#undef name_LLVMFunctionDoesNotCapture\n#undef name_LLVMFunctionDoesNotAlias\n#undef name_LLVMFunctionGetParamAlignment\n#undef name_LLVMFunctionSetOnlyReadsMemory\n#undef name_LLVMFunctionSetGC\n#undef name_LLVMFunctionClearGC\n#undef name_LLVMFunctionDeleteBody\n#undef name_LLVMFunctionRemoveFromParent\n#undef name_LLVMFunctionEraseFromParent\n#undef name_LLVMFunctionSetDoesNotAccessMemory\n#undef name_LLVMFunctionSetDoesNotAlias\n#undef name_LLVMFunctionSetDoesNotCapture\n#undef name_LLVMFunctionSetDoesNotThrow\n#undef name_LLVMFunctionSetHasUWTable\n#undef name_LLVMFunctionSetDoesNotReturn\n#undef name_LLVMFunctionSetCannotDuplicate\n#undef msg\n\/* End C Interaction Functions *\/\n<commit_msg>Finished implementing addFields in CLIPSFunctionBuilder<commit_after>#include \"ExpertSystem\/CLIPSFunctionBuilder.h\"\nextern \"C\" {\n#include \"clips.h\"\n}\n\nCLIPSFunctionBuilder::CLIPSFunctionBuilder(std::string nm, \n FunctionNamer& namer) : CLIPSGlobalValueBuilder(nm, \"Function\", namer) { \n}\n\nvoid CLIPSFunctionBuilder::build(Function* fn, KnowledgeConstructor* kc) {\n open();\n addFields(fn, kc);\n close();\n std::string str = getCompletedString();\n kc->addToKnowledgeBase((PointerAddress)arg, str);\n}\n\nvoid CLIPSFunctionBuilder::setCallingConvention(CallingConv::ID id) {\n const char* selection;\n switch(id) {\n case CallingConv::C:\n selection = \"C\";\n break;\n case CallingConv::Fast:\n selection = \"Fast\";\n break;\n case CallingConv::Cold:\n selection = \"Cold\";\n break;\n case CallingConv::GHC:\n selection = \"GHC\";\n break;\n case CallingConv::HiPE:\n selection = \"HiPE\";\n break;\n case CallingConv::FirstTargetCC:\n selection = \"FirstTargetCC\";\n break;\n case CallingConv::X86_StdCall:\n selection = \"x86-stdcall\";\n break;\n case CallingConv::X86_FastCall:\n selection = \"x86-fastcall\";\n break;\n case CallingConv::ARM_APCS:\n selection = \"arm-apcs\";\n break;\n case CallingConv::ARM_AAPCS:\n selection = \"arm-aapcs\";\n break;\n case CallingConv::ARM_AAPCS_VFB:\n selection = \"arm-aapcs-vfb\";\n break;\n case CallingConv::MSP430_INTR:\n selection = \"msp430-intr\";\n break;\n case CallingConv::X86_ThisCall:\n selection = \"x86-thiscall\";\n break;\n case CallingConv::PTX_Kernel:\n selection = \"ptx-kernel\";\n break;\n case CallingConv::PTX_Device:\n selection = \"ptx-device\";\n break;\n case CallingConv::MBLAZE_INTR:\n selection = \"mblaze-intr\";\n break;\n case CallingConv::MBLAZE_SVOL:\n selection = \"mblaze-svol\";\n break;\n case CallingConv::SPIR_FUNC:\n selection = \"spir-func\";\n break;\n case CallingConv::SPIR_KERNEL:\n selection = \"spir-kernel\";\n break;\n case CallingConv::Intel_OCL_BI:\n selection = \"intel-ocl-bi\";\n break;\n default:\n selection = \"Unknown\";\n break;\n }\n addField(\"CallingConvention\", selection);\n}\nvoid CLIPSFunctionBuilder::setAttributes(const AttributeSet& attr) {\n\n}\nvoid CLIPSFunctionBuilder::addFields(Function* func, \n KnowledgeConstructor* kc) {\n\n CLIPSGlobalValueBuilder::addFields(func, kc);\n \/\/this part contains the code for building the function itself\n FunctionNamer& namer = getNamer();\n addField(\"ReturnType\", kc->route(func->getReturnType(), namer));\n addField(\"FunctionType\", kc->route(func->getFunctionType(), namer));\n if(func.isVarArg()) {\n addTrueField(\"IsVarArg\");\n }\n addField(\"IntrinsicID\", func->getIntrinsicID());\n if(func.isIntrinsic()) {\n addTrueField(\"IsIntrinsic\");\n }\n setCallingConvention(func->getCallingConv());\n setAttributes(func->getAttributes());\n if(func.hasGC()) {\n addTrueField(\"HasGC\");\n addField(\"GC\", func->getGC());\n }\n if(func.doesNotAccessMemory()) {\n addTrueField(\"DoesNotAccessMemory\");\n }\n if(func.onlyReadsMemory()) {\n addTrueField(\"OnlyReadsMemory\");\n }\n if(func.doesNotReturn()) {\n addTrueField(\"DoesNotReturn\");\n }\n if(func.cannotDuplicate()) {\n addTrueField(\"CannotDuplicate\");\n }\n if(func.hasUWTable()) {\n addTrueField(\"HasUWTable\");\n }\n if(func.needsUnwindTableEntry()) {\n addTrueField(\"NeedsUnwindTableEntry\");\n }\n if(func.hasStructRetAttr()) {\n addTrueField(\"HasStructRetAttr\");\n }\n if(func.isDefTriviallyDead()) {\n addTrueField(\"IsDefTriviallyDead\");\n }\n if(func.callsFunctionThatReturnsTwice()) {\n addTrueField(\"CallsFunctionThatReturnsTwice\");\n }\n char* fnName = (char*)func.getName().data();\n FunctionNamer& namer = getNamer();\n addField(\"EntryBlock\", kc->route(func.getEntryBlock(), fnName, namer));\n openField(\"Arguments\"); {\n for(Function::arg_iterator s = func.arg_begin(), f = func.arg_end(); \n s != f; ++s) {\n Argument* a = s;\n \/\/build it if we need to :)\n appendValue(kc->route(a, namer, fnName));\n }\n } closeField();\n openField(\"contents\"); {\n for(llvm::Function::iterator i = func.begin() , e = func.end(); \n i != e; ++i) {\n BasicBlock* bb = i; \n appendValue(kc->route(bb, namer, fnName));\n }\n } closeField();\n}\n\/* Begin C functions for allowing CLIPS to interact with LLVM *\/\n#define msg(x) (char*) x\n#define werror msg(werror)\n#define name_LLVMFunctionSetGC \\\n msg(\"llvm-function-set-gc\")\n#define name_LLVMFunctionClearGC \\\n msg(\"llvm-function-clear-gc\")\n#define name_LLVMFunctionDeleteBody \\\n msg(\"llvm-function-delete-body\")\n#define name_LLVMFunctionRemoveFromParent \\\n msg(\"llvm-function-remove-from-parent\")\n#define name_LLVMFunctionEraseFromParent \\\n msg(\"llvm-function-erase-from-parent\")\n#define name_LLVMFunctionSetDoesNotAccessMemory \\\n msg(\"llvm-function-set-does-not-access-memory\")\n#define name_LLVMFunctionSetDoesNotAlias \\\n msg(\"llvm-function-set-does-not-alias\")\n#define name_LLVMFunctionSetDoesNotCapture \\\n msg(\"llvm-function-set-does-not-capture\")\n#define name_LLVMFunctionSetDoesNotThrow \\\n msg(\"llvm-function-set-does-not-throw\")\n#define name_LLVMFunctionSetHasUWTable \\\n msg(\"llvm-function-set-has-uw-table\")\n#define name_LLVMFunctionSetDoesNotReturn \\\n msg(\"llvm-function-set-does-not-return\")\n#define name_LLVMFunctionSetCannotDuplicate \\\n msg(\"llvm-function-set-cannot-duplicate\")\n#define name_LLVMFunctionSetOnlyReadsMemory \\\n msg(\"llvm-function-set-only-reads-memory\")\n#define name_LLVMFunctionDropAllReferences \\\n msg(\"llvm-function-drop-all-references\")\n#define name_LLVMFunctionHasAddressTaken \\\n msg(\"llvm-function-has-address-taken\")\n#define name_LLVMFunctionCreate \\\n msg(\"llvm-function-create\")\n\/* Getters *\/\n#define name_LLVMFunctionDoesNotAlias \\\n msg(\"llvm-function-does-not-alias\")\nextern \"C\" unsigned LLVMFunctionDoesNotAlias(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionDoesNotAlias, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionDoesNotAlias, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionDoesNotAlias, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->doesNotAlias(index);\n }\n}\n#define name_LLVMFunctionDoesNotCapture \\\n msg(\"llvm-function-does-not-capture\")\nextern \"C\" unsigned LLVMFunctionDoesNotCapture(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionDoesNotCapture, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionDoesNotCapture, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionDoesNotCapture, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->doesNotCapture(index);\n }\n}\n#define name_LLVMFunctionGetParamAlignment \\\n msg(\"llvm-function-get-param-alignment\")\nextern \"C\" unsigned LLVMFunctionGetParamAlignment(void* theEnv) {\n DATA_OBJECT ptrDO,\n indexDO;\n unsigned index; \n if(EnvArgCountCheck(theEnv, name_LLVMFunctionGetParamAlignment, \n EXACTLY, 2) == -1) {\n return 0;\n }\n if(EnvArgTypeCheck(theEnv, name_LLVMFunctionGetParamAlignment, 1, \n INTEGER, &ptrDO) == FALSE) {\n return 0;\n }\n if(EnvArgTypeCheck(theenv, name_LLVMFunctionGetParamAlignment, 1, \n INTEGER, &indexDO) == FALSE) {\n return 0;\n }\n Function* fn = (Function*)(PointerAddress)DOToLong(ptrDO);\n if(!fn) {\n EnvPrintRouter(theEnv, werror,\n msg(\"ERROR: The provided function pointer isn't valid\"));\n return 0;\n } else {\n index = (unsigned)DOToInteger(indexDO);\n return fn->getParamAlignment(index);\n }\n}\nextern \"C\" void RegisterLLVMFunctionManipulationFunctions(void *theEnv) {\n EnvDefineFunction(theEnv, name_LLVMFunctionDoesNotCapture, 'i', \n PTIEF LLVMFunctionDoesNotCapture, \n msg(\"LLVMFunctionDoesNotCapture\"));\n EnvDefineFunction(theEnv, name_LLVMFunctionDoesNotAlias, 'i', \n PTIEF LLVMFunctionDoesNotAlias, \n msg(\"LLVMFunctionDoesNotAlias\"));\n EnvDefineFunction(theEnv, name_LLVMFunctionGetParamAlignment, 'i', \n PTIEF LLVMFunctionGetParamAlignment, \n msg(\"LLVMFunctionGetParamAlignment\"));\n}\n#undef werror\n#undef name_LLVMFunctionDoesNotCapture\n#undef name_LLVMFunctionDoesNotAlias\n#undef name_LLVMFunctionGetParamAlignment\n#undef name_LLVMFunctionSetOnlyReadsMemory\n#undef name_LLVMFunctionSetGC\n#undef name_LLVMFunctionClearGC\n#undef name_LLVMFunctionDeleteBody\n#undef name_LLVMFunctionRemoveFromParent\n#undef name_LLVMFunctionEraseFromParent\n#undef name_LLVMFunctionSetDoesNotAccessMemory\n#undef name_LLVMFunctionSetDoesNotAlias\n#undef name_LLVMFunctionSetDoesNotCapture\n#undef name_LLVMFunctionSetDoesNotThrow\n#undef name_LLVMFunctionSetHasUWTable\n#undef name_LLVMFunctionSetDoesNotReturn\n#undef name_LLVMFunctionSetCannotDuplicate\n#undef name_LLVMFunctionDropAllReferences\n#undef name_LLVMFunctionHasAddressTaken\n#undef name_LLVMFunctionCreate\n#undef msg\n\/* End C Interaction Functions *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n\/\/ SPDX - License - Identifier: Apache - 2.0 \n\n#include <iostream>\n#include <aws\/core\/Aws.h>\n#include <aws\/s3\/S3Client.h>\n#include <aws\/s3\/model\/CopyObjectRequest.h>\n#include <awsdoc\/s3\/s3_examples.h>\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n * Purpose:\n *\n * Prerequisites:\n *\n * Inputs:\n * - :\n *\n * Outputs:\n * \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n * Purpose: Copies an object from one bucket in Amazon S3 to another bucket.\n * \n * Prerequisites: Two buckets. One of the buckets must contain the object to \n * be copied to the other bucket.\n *\n * Inputs:\n * - objectKey: The name of the object to copy.\n * - fromBucket: The name of the bucket to copy the object from.\n * - toBucket: The name of the bucket to copy the object to.\n * - region: The AWS Region to create the bucket in.\n *\n * Outputs: true if the object was copied; otherwise, false.\n * \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\nbool AwsDoc::S3::CopyObject(const Aws::String& objectKey, \n const Aws::String& fromBucket, const Aws::String& toBucket, const Aws::String& region)\n{\n Aws::Client::ClientConfiguration config;\n\n if (!region.empty())\n {\n config.region = region;\n }\n\n Aws::S3::S3Client s3_client(config);\n\n Aws::S3::Model::CopyObjectRequest request;\n\n request.WithCopySource(fromBucket + \"\/\" + objectKey)\n .WithKey(objectKey)\n .WithBucket(toBucket);\n \n Aws::S3::Model::CopyObjectOutcome outcome = s3_client.CopyObject(request);\n\n if (!outcome.IsSuccess())\n {\n auto err = outcome.GetError();\n std::cout << \"Error: CopyObject: \" <<\n err.GetExceptionName() << \": \" << err.GetMessage() << std::endl;\n\n return false;\n }\n else\n {\n return true;\n }\n}\n\nint main()\n{\n Aws::SDKOptions options;\n Aws::InitAPI(options);\n {\n \/\/TODO: Name of object already in bucket.\n Aws::String object_key = \"my-file.txt\";\n \/\/TODO: Change from_bucket to the name of your bucket that already contains \"my-file.txt\". \n \/\/See create_bucket.cpp and put_object.cpp to create a bucket and load an object into that bucket.\n Aws::String from_bucket = \"MY-FROM-BUCKET\";\n \/\/TODO: Change to the name of another bucket in your account.\n Aws::String to_bucket = \"MY-TO-BUCKET\";\n \/\/TODO: Set to the AWS Region in which the bucket was created.\n Aws::String region = \"us-east-1\";\n\n if (AwsDoc::S3::CopyObject(object_key, from_bucket, to_bucket, region))\n {\n std::cout << \"Copied object '\" << object_key <<\n \"' from '\" << from_bucket << \"' to '\" << to_bucket << \"'.\" << \n std::endl;\n }\n else\n {\n return 1;\n }\n }\n ShutdownAPI(options);\n\n return 0;\n}<commit_msg>add comments<commit_after>\/\/ Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n\/\/ SPDX - License - Identifier: Apache - 2.0 \n\n#include <iostream>\n#include <aws\/core\/Aws.h>\n#include <aws\/s3\/S3Client.h>\n#include <aws\/s3\/model\/CopyObjectRequest.h>\n#include <awsdoc\/s3\/s3_examples.h>\n\n\/* \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n * Purpose: Copies an object from one bucket in Amazon S3 to another bucket.\n * \n * Prerequisites: Two buckets. One of the buckets must contain the object to \n * be copied to the other bucket.\n *\n * Inputs:\n * - objectKey: The name of the object to copy.\n * - fromBucket: The name of the bucket to copy the object from.\n * - toBucket: The name of the bucket to copy the object to.\n * - region: The AWS Region to create the bucket in.\n *\n * Outputs: true if the object was copied; otherwise, false.\n * \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/ *\/\n\nbool AwsDoc::S3::CopyObject(const Aws::String& objectKey, \n const Aws::String& fromBucket, const Aws::String& toBucket, const Aws::String& region)\n{\n Aws::Client::ClientConfiguration config;\n\n if (!region.empty())\n {\n config.region = region;\n }\n\n Aws::S3::S3Client s3_client(config);\n\n Aws::S3::Model::CopyObjectRequest request;\n\n request.WithCopySource(fromBucket + \"\/\" + objectKey)\n .WithKey(objectKey)\n .WithBucket(toBucket);\n \n Aws::S3::Model::CopyObjectOutcome outcome = s3_client.CopyObject(request);\n\n if (!outcome.IsSuccess())\n {\n auto err = outcome.GetError();\n std::cout << \"Error: CopyObject: \" <<\n err.GetExceptionName() << \": \" << err.GetMessage() << std::endl;\n\n return false;\n }\n else\n {\n return true;\n }\n}\n\nint main()\n{\n Aws::SDKOptions options;\n Aws::InitAPI(options);\n {\n \/\/TODO: Name of object already in bucket.\n Aws::String object_key = \"my-file.txt\";\n \/\/TODO: Change from_bucket to the name of your bucket that already contains \"my-file.txt\". \n \/\/See create_bucket.cpp and put_object.cpp to create a bucket and load an object into that bucket.\n Aws::String from_bucket = \"MY-FROM-BUCKET\";\n \/\/TODO: Change to the name of another bucket in your account.\n Aws::String to_bucket = \"MY-TO-BUCKET\";\n \/\/TODO: Set to the AWS Region in which the bucket was created.\n Aws::String region = \"us-east-1\";\n\n if (AwsDoc::S3::CopyObject(object_key, from_bucket, to_bucket, region))\n {\n std::cout << \"Copied object '\" << object_key <<\n \"' from '\" << from_bucket << \"' to '\" << to_bucket << \"'.\" << \n std::endl;\n }\n else\n {\n return 1;\n }\n }\n ShutdownAPI(options);\n\n return 0;\n}<|endoftext|>"} {"text":"<commit_before>#include \"HalideRuntime.h\"\n#include \"HalideBuffer.h\"\n\n\/\/ Grab the internal device_interface functions\n#define WEAK\n#include \"device_interface.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include \"cleanup_on_error.h\"\n\nusing namespace Halide::Runtime;\n\nconst int size = 64;\n\nint successful_mallocs = 0, failed_mallocs = 0, frees = 0, errors = 0, device_mallocs = 0, device_frees = 0;\n\nvoid *my_halide_malloc(void *user_context, size_t x) {\n \/\/ Only the first malloc succeeds\n if (successful_mallocs) {\n failed_mallocs++;\n return nullptr;\n }\n successful_mallocs++;\n\n void *orig = malloc(x+40);\n \/\/ Round up to next multiple of 32. Should add at least 8 bytes so we can fit the original pointer.\n void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5);\n ((void **)ptr)[-1] = orig;\n return ptr;\n}\n\nvoid my_halide_free(void *user_context, void *ptr) {\n frees++;\n free(((void**)ptr)[-1]);\n}\n\nvoid my_halide_error(void *user_context, const char *msg) {\n errors++;\n}\n\n#ifndef _WIN32\n\/\/ These two can't be overridden on windows, so we'll just check that\n\/\/ the number of calls to free matches the number of calls to malloc.\nextern \"C\" int halide_device_free(void *user_context, struct buffer_t *buf) {\n device_frees++;\n const halide_device_interface_t *interface = halide_get_device_interface(buf->dev);\n return interface->device_free(user_context, buf);\n}\n\nextern \"C\" int halide_device_malloc(void *user_context, struct buffer_t *buf, const halide_device_interface_t *interface) {\n if (!buf->dev) {\n printf(\"Custom device malloc!\\n\");\n device_mallocs++;\n }\n return interface->device_malloc(user_context, buf);\n}\n#endif\n\nint main(int argc, char **argv) {\n\n halide_set_custom_malloc(&my_halide_malloc);\n halide_set_custom_free(&my_halide_free);\n halide_set_error_handler(&my_halide_error);\n\n Buffer<int32_t> output(size);\n int result = cleanup_on_error(output);\n\n if (result != halide_error_code_out_of_memory) {\n printf(\"The exit status was %d instead of %d\\n\", result, halide_error_code_out_of_memory);\n return -1;\n }\n\n if (failed_mallocs != 1) {\n printf(\"One of the mallocs was supposed to fail\\n\");\n return -1;\n }\n\n if (successful_mallocs != 1) {\n printf(\"One of the mallocs was supposed to succeed\\n\");\n return -1;\n }\n\n if (frees != 1) {\n printf(\"The successful malloc should have been freed\\n\");\n return -1;\n }\n\n if (errors != 1) {\n \/\/ There's one error from the malloc failing\n printf(\"There was supposed to be one error\\n\");\n return -1;\n }\n\n if (device_mallocs != device_frees) {\n printf(\"There were a different number of device mallocs (%d) and frees (%d)\\n\", device_mallocs, device_frees);\n return -1;\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<commit_msg>Remove debugging printf<commit_after>#include \"HalideRuntime.h\"\n#include \"HalideBuffer.h\"\n\n\/\/ Grab the internal device_interface functions\n#define WEAK\n#include \"device_interface.h\"\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include \"cleanup_on_error.h\"\n\nusing namespace Halide::Runtime;\n\nconst int size = 64;\n\nint successful_mallocs = 0, failed_mallocs = 0, frees = 0, errors = 0, device_mallocs = 0, device_frees = 0;\n\nvoid *my_halide_malloc(void *user_context, size_t x) {\n \/\/ Only the first malloc succeeds\n if (successful_mallocs) {\n failed_mallocs++;\n return nullptr;\n }\n successful_mallocs++;\n\n void *orig = malloc(x+40);\n \/\/ Round up to next multiple of 32. Should add at least 8 bytes so we can fit the original pointer.\n void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5);\n ((void **)ptr)[-1] = orig;\n return ptr;\n}\n\nvoid my_halide_free(void *user_context, void *ptr) {\n frees++;\n free(((void**)ptr)[-1]);\n}\n\nvoid my_halide_error(void *user_context, const char *msg) {\n errors++;\n}\n\n#ifndef _WIN32\n\/\/ These two can't be overridden on windows, so we'll just check that\n\/\/ the number of calls to free matches the number of calls to malloc.\nextern \"C\" int halide_device_free(void *user_context, struct buffer_t *buf) {\n device_frees++;\n const halide_device_interface_t *interface = halide_get_device_interface(buf->dev);\n return interface->device_free(user_context, buf);\n}\n\nextern \"C\" int halide_device_malloc(void *user_context, struct buffer_t *buf, const halide_device_interface_t *interface) {\n if (!buf->dev) {\n device_mallocs++;\n }\n return interface->device_malloc(user_context, buf);\n}\n#endif\n\nint main(int argc, char **argv) {\n\n halide_set_custom_malloc(&my_halide_malloc);\n halide_set_custom_free(&my_halide_free);\n halide_set_error_handler(&my_halide_error);\n\n Buffer<int32_t> output(size);\n int result = cleanup_on_error(output);\n\n if (result != halide_error_code_out_of_memory) {\n printf(\"The exit status was %d instead of %d\\n\", result, halide_error_code_out_of_memory);\n return -1;\n }\n\n if (failed_mallocs != 1) {\n printf(\"One of the mallocs was supposed to fail\\n\");\n return -1;\n }\n\n if (successful_mallocs != 1) {\n printf(\"One of the mallocs was supposed to succeed\\n\");\n return -1;\n }\n\n if (frees != 1) {\n printf(\"The successful malloc should have been freed\\n\");\n return -1;\n }\n\n if (errors != 1) {\n \/\/ There's one error from the malloc failing\n printf(\"There was supposed to be one error\\n\");\n return -1;\n }\n\n if (device_mallocs != device_frees) {\n printf(\"There were a different number of device mallocs (%d) and frees (%d)\\n\", device_mallocs, device_frees);\n return -1;\n }\n\n printf(\"Success!\\n\");\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright (C) 2015 ScyllaDB\n *\n * Modified by ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"update_statement.hh\"\n#include \"raw\/update_statement.hh\"\n#include \"raw\/insert_statement.hh\"\n#include \"unimplemented.hh\"\n\n#include \"cql3\/operation_impl.hh\"\n\nnamespace cql3 {\n\nnamespace statements {\n\nupdate_statement::update_statement(statement_type type, uint32_t bound_terms, schema_ptr s, std::unique_ptr<attributes> attrs, uint64_t* cql_stats_counter_ptr)\n : modification_statement{type, bound_terms, std::move(s), std::move(attrs), cql_stats_counter_ptr}\n{ }\n\nbool update_statement::require_full_clustering_key() const {\n return true;\n}\n\nbool update_statement::allow_clustering_key_slices() const {\n return false;\n}\n\nvoid update_statement::add_update_for_key(mutation& m, const query::clustering_range& range, const update_parameters& params) {\n auto prefix = range.start() ? std::move(range.start()->value()) : clustering_key_prefix::make_empty();\n if (s->is_dense()) {\n if (prefix.is_empty(*s)) {\n throw exceptions::invalid_request_exception(sprint(\"Missing PRIMARY KEY part %s\", s->clustering_key_columns().begin()->name_as_text()));\n }\n \/\/ An empty name for the value is what we use to recognize the case where there is not column\n \/\/ outside the PK, see CreateStatement.\n if (s->regular_begin()->name().empty()) {\n \/\/ There is no column outside the PK. So no operation could have passed through validation\n assert(_column_operations.empty());\n constants::setter(*s->regular_begin(), make_shared(constants::value(cql3::raw_value::make_value(bytes())))).execute(m, prefix, params);\n } else {\n \/\/ dense means we don't have a row marker, so don't accept to set only the PK. See CASSANDRA-5648.\n if (_column_operations.empty()) {\n throw exceptions::invalid_request_exception(sprint(\"Column %s is mandatory for this COMPACT STORAGE table\", s->regular_begin()->name_as_text()));\n }\n }\n } else {\n \/\/ If there are static columns, there also must be clustering columns, in which\n \/\/ case empty prefix can only refer to the static row.\n bool is_static_prefix = s->has_static_columns() && prefix.is_empty(*s);\n if (type.is_insert() && !is_static_prefix && s->is_cql3_table()) {\n auto& row = m.partition().clustered_row(*s, prefix);\n row.apply(row_marker(params.timestamp(), params.ttl(), params.expiry()));\n }\n }\n\n for (auto&& update : _column_operations) {\n update->execute(m, prefix, params);\n }\n\n warn(unimplemented::cause::INDEXES);\n#if 0\n SecondaryIndexManager indexManager = Keyspace.open(cfm.ksName).getColumnFamilyStore(cfm.cfId).indexManager;\n if (indexManager.hasIndexes())\n {\n for (Cell cell : cf)\n {\n \/\/ Indexed values must be validated by any applicable index. See CASSANDRA-3057\/4240\/8081 for more details\n if (!indexManager.validate(cell))\n throw new InvalidRequestException(String.format(\"Can't index column value of size %d for index %s on %s.%s\",\n cell.value().remaining(),\n cfm.getColumnDefinition(cell.name()).getIndexName(),\n cfm.ksName,\n cfm.cfName));\n }\n }\n }\n#endif\n}\n\nnamespace raw {\n\ninsert_statement::insert_statement( ::shared_ptr<cf_name> name,\n ::shared_ptr<attributes::raw> attrs,\n std::vector<::shared_ptr<column_identifier::raw>> column_names,\n std::vector<::shared_ptr<term::raw>> column_values,\n bool if_not_exists)\n : raw::modification_statement{std::move(name), std::move(attrs), conditions_vector{}, if_not_exists, false}\n , _column_names{std::move(column_names)}\n , _column_values{std::move(column_values)}\n{ }\n\n::shared_ptr<cql3::statements::modification_statement>\ninsert_statement::prepare_internal(database& db, schema_ptr schema,\n ::shared_ptr<variable_specifications> bound_names, std::unique_ptr<attributes> attrs, cql_stats& stats)\n{\n auto stmt = ::make_shared<cql3::statements::update_statement>(statement_type::INSERT, bound_names->size(), schema, std::move(attrs), &stats.inserts);\n\n \/\/ Created from an INSERT\n if (stmt->is_counter()) {\n throw exceptions::invalid_request_exception(\"INSERT statement are not allowed on counter tables, use UPDATE instead\");\n }\n\n if (_column_names.size() != _column_values.size()) {\n throw exceptions::invalid_request_exception(\"Unmatched column names\/values\");\n }\n\n if (_column_names.empty()) {\n throw exceptions::invalid_request_exception(\"No columns provided to INSERT\");\n }\n\n std::vector<::shared_ptr<relation>> relations;\n std::unordered_set<bytes> column_ids;\n for (size_t i = 0; i < _column_names.size(); i++) {\n auto&& col = _column_names[i];\n auto id = col->prepare_column_identifier(schema);\n auto def = get_column_definition(schema, *id);\n if (!def) {\n throw exceptions::invalid_request_exception(sprint(\"Unknown identifier %s\", *id));\n }\n if (column_ids.count(id->name())) {\n throw exceptions::invalid_request_exception(sprint(\"Multiple definitions found for column %s\", *id));\n }\n column_ids.emplace(id->name());\n\n auto&& value = _column_values[i];\n\n if (def->is_primary_key()) {\n relations.push_back(::make_shared<single_column_relation>(col, operator_type::EQ, value));\n } else {\n auto operation = operation::set_value(value).prepare(db, keyspace(), *def);\n operation->collect_marker_specification(bound_names);\n stmt->add_operation(std::move(operation));\n };\n }\n stmt->process_where_clause(db, relations, std::move(bound_names));\n return stmt;\n}\n\nupdate_statement::update_statement( ::shared_ptr<cf_name> name,\n ::shared_ptr<attributes::raw> attrs,\n std::vector<std::pair<::shared_ptr<column_identifier::raw>, ::shared_ptr<operation::raw_update>>> updates,\n std::vector<relation_ptr> where_clause,\n conditions_vector conditions)\n : raw::modification_statement(std::move(name), std::move(attrs), std::move(conditions), false, false)\n , _updates(std::move(updates))\n , _where_clause(std::move(where_clause))\n{ }\n\n::shared_ptr<cql3::statements::modification_statement>\nupdate_statement::prepare_internal(database& db, schema_ptr schema,\n ::shared_ptr<variable_specifications> bound_names, std::unique_ptr<attributes> attrs, cql_stats& stats)\n{\n auto stmt = ::make_shared<cql3::statements::update_statement>(statement_type::UPDATE, bound_names->size(), schema, std::move(attrs), &stats.updates);\n\n for (auto&& entry : _updates) {\n auto id = entry.first->prepare_column_identifier(schema);\n auto def = get_column_definition(schema, *id);\n if (!def) {\n throw exceptions::invalid_request_exception(sprint(\"Unknown identifier %s\", *entry.first));\n }\n\n auto operation = entry.second->prepare(db, keyspace(), *def);\n operation->collect_marker_specification(bound_names);\n\n if (def->is_primary_key()) {\n throw exceptions::invalid_request_exception(sprint(\"PRIMARY KEY part %s found in SET part\", *entry.first));\n }\n stmt->add_operation(std::move(operation));\n }\n\n stmt->process_where_clause(db, _where_clause, std::move(bound_names));\n return stmt;\n}\n\n}\n\n}\n\n}\n<commit_msg>update_statement: Reject empty values for dense clustering key<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright (C) 2015 ScyllaDB\n *\n * Modified by ScyllaDB\n *\/\n\n\/*\n * This file is part of Scylla.\n *\n * Scylla is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Affero General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Scylla is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with Scylla. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"update_statement.hh\"\n#include \"raw\/update_statement.hh\"\n#include \"raw\/insert_statement.hh\"\n#include \"unimplemented.hh\"\n\n#include \"cql3\/operation_impl.hh\"\n\nnamespace cql3 {\n\nnamespace statements {\n\nupdate_statement::update_statement(statement_type type, uint32_t bound_terms, schema_ptr s, std::unique_ptr<attributes> attrs, uint64_t* cql_stats_counter_ptr)\n : modification_statement{type, bound_terms, std::move(s), std::move(attrs), cql_stats_counter_ptr}\n{ }\n\nbool update_statement::require_full_clustering_key() const {\n return true;\n}\n\nbool update_statement::allow_clustering_key_slices() const {\n return false;\n}\n\nvoid update_statement::add_update_for_key(mutation& m, const query::clustering_range& range, const update_parameters& params) {\n auto prefix = range.start() ? std::move(range.start()->value()) : clustering_key_prefix::make_empty();\n if (s->is_dense()) {\n if (prefix.is_empty(*s) || prefix.components().front().empty()) {\n throw exceptions::invalid_request_exception(sprint(\"Missing PRIMARY KEY part %s\", s->clustering_key_columns().begin()->name_as_text()));\n }\n \/\/ An empty name for the value is what we use to recognize the case where there is not column\n \/\/ outside the PK, see CreateStatement.\n if (s->regular_begin()->name().empty()) {\n \/\/ There is no column outside the PK. So no operation could have passed through validation\n assert(_column_operations.empty());\n constants::setter(*s->regular_begin(), make_shared(constants::value(cql3::raw_value::make_value(bytes())))).execute(m, prefix, params);\n } else {\n \/\/ dense means we don't have a row marker, so don't accept to set only the PK. See CASSANDRA-5648.\n if (_column_operations.empty()) {\n throw exceptions::invalid_request_exception(sprint(\"Column %s is mandatory for this COMPACT STORAGE table\", s->regular_begin()->name_as_text()));\n }\n }\n } else {\n \/\/ If there are static columns, there also must be clustering columns, in which\n \/\/ case empty prefix can only refer to the static row.\n bool is_static_prefix = s->has_static_columns() && prefix.is_empty(*s);\n if (type.is_insert() && !is_static_prefix && s->is_cql3_table()) {\n auto& row = m.partition().clustered_row(*s, prefix);\n row.apply(row_marker(params.timestamp(), params.ttl(), params.expiry()));\n }\n }\n\n for (auto&& update : _column_operations) {\n update->execute(m, prefix, params);\n }\n\n warn(unimplemented::cause::INDEXES);\n#if 0\n SecondaryIndexManager indexManager = Keyspace.open(cfm.ksName).getColumnFamilyStore(cfm.cfId).indexManager;\n if (indexManager.hasIndexes())\n {\n for (Cell cell : cf)\n {\n \/\/ Indexed values must be validated by any applicable index. See CASSANDRA-3057\/4240\/8081 for more details\n if (!indexManager.validate(cell))\n throw new InvalidRequestException(String.format(\"Can't index column value of size %d for index %s on %s.%s\",\n cell.value().remaining(),\n cfm.getColumnDefinition(cell.name()).getIndexName(),\n cfm.ksName,\n cfm.cfName));\n }\n }\n }\n#endif\n}\n\nnamespace raw {\n\ninsert_statement::insert_statement( ::shared_ptr<cf_name> name,\n ::shared_ptr<attributes::raw> attrs,\n std::vector<::shared_ptr<column_identifier::raw>> column_names,\n std::vector<::shared_ptr<term::raw>> column_values,\n bool if_not_exists)\n : raw::modification_statement{std::move(name), std::move(attrs), conditions_vector{}, if_not_exists, false}\n , _column_names{std::move(column_names)}\n , _column_values{std::move(column_values)}\n{ }\n\n::shared_ptr<cql3::statements::modification_statement>\ninsert_statement::prepare_internal(database& db, schema_ptr schema,\n ::shared_ptr<variable_specifications> bound_names, std::unique_ptr<attributes> attrs, cql_stats& stats)\n{\n auto stmt = ::make_shared<cql3::statements::update_statement>(statement_type::INSERT, bound_names->size(), schema, std::move(attrs), &stats.inserts);\n\n \/\/ Created from an INSERT\n if (stmt->is_counter()) {\n throw exceptions::invalid_request_exception(\"INSERT statement are not allowed on counter tables, use UPDATE instead\");\n }\n\n if (_column_names.size() != _column_values.size()) {\n throw exceptions::invalid_request_exception(\"Unmatched column names\/values\");\n }\n\n if (_column_names.empty()) {\n throw exceptions::invalid_request_exception(\"No columns provided to INSERT\");\n }\n\n std::vector<::shared_ptr<relation>> relations;\n std::unordered_set<bytes> column_ids;\n for (size_t i = 0; i < _column_names.size(); i++) {\n auto&& col = _column_names[i];\n auto id = col->prepare_column_identifier(schema);\n auto def = get_column_definition(schema, *id);\n if (!def) {\n throw exceptions::invalid_request_exception(sprint(\"Unknown identifier %s\", *id));\n }\n if (column_ids.count(id->name())) {\n throw exceptions::invalid_request_exception(sprint(\"Multiple definitions found for column %s\", *id));\n }\n column_ids.emplace(id->name());\n\n auto&& value = _column_values[i];\n\n if (def->is_primary_key()) {\n relations.push_back(::make_shared<single_column_relation>(col, operator_type::EQ, value));\n } else {\n auto operation = operation::set_value(value).prepare(db, keyspace(), *def);\n operation->collect_marker_specification(bound_names);\n stmt->add_operation(std::move(operation));\n };\n }\n stmt->process_where_clause(db, relations, std::move(bound_names));\n return stmt;\n}\n\nupdate_statement::update_statement( ::shared_ptr<cf_name> name,\n ::shared_ptr<attributes::raw> attrs,\n std::vector<std::pair<::shared_ptr<column_identifier::raw>, ::shared_ptr<operation::raw_update>>> updates,\n std::vector<relation_ptr> where_clause,\n conditions_vector conditions)\n : raw::modification_statement(std::move(name), std::move(attrs), std::move(conditions), false, false)\n , _updates(std::move(updates))\n , _where_clause(std::move(where_clause))\n{ }\n\n::shared_ptr<cql3::statements::modification_statement>\nupdate_statement::prepare_internal(database& db, schema_ptr schema,\n ::shared_ptr<variable_specifications> bound_names, std::unique_ptr<attributes> attrs, cql_stats& stats)\n{\n auto stmt = ::make_shared<cql3::statements::update_statement>(statement_type::UPDATE, bound_names->size(), schema, std::move(attrs), &stats.updates);\n\n for (auto&& entry : _updates) {\n auto id = entry.first->prepare_column_identifier(schema);\n auto def = get_column_definition(schema, *id);\n if (!def) {\n throw exceptions::invalid_request_exception(sprint(\"Unknown identifier %s\", *entry.first));\n }\n\n auto operation = entry.second->prepare(db, keyspace(), *def);\n operation->collect_marker_specification(bound_names);\n\n if (def->is_primary_key()) {\n throw exceptions::invalid_request_exception(sprint(\"PRIMARY KEY part %s found in SET part\", *entry.first));\n }\n stmt->add_operation(std::move(operation));\n }\n\n stmt->process_where_clause(db, _where_clause, std::move(bound_names));\n return stmt;\n}\n\n}\n\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ The LowerAllocations transformation is a target-dependent tranformation\n\/\/ because it depends on the size of data types and alignment constraints.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"Support\/Statistic.h\"\nusing namespace llvm;\n\nnamespace {\n Statistic<> NumLowered(\"lowerallocs\", \"Number of allocations lowered\");\n\n \/\/\/ LowerAllocations - Turn malloc and free instructions into %malloc and\n \/\/\/ %free calls.\n \/\/\/\n class LowerAllocations : public BasicBlockPass {\n Function *MallocFunc; \/\/ Functions in the module we are processing\n Function *FreeFunc; \/\/ Initialized by doInitialization\n public:\n LowerAllocations() : MallocFunc(0), FreeFunc(0) {}\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n AU.addRequired<TargetData>();\n }\n\n \/\/\/ doPassInitialization - For the lower allocations pass, this ensures that\n \/\/\/ a module contains a declaration for a malloc and a free function.\n \/\/\/\n bool doInitialization(Module &M);\n \n \/\/\/ runOnBasicBlock - This method does the actual work of converting\n \/\/\/ instructions over, assuming that the pass has already been initialized.\n \/\/\/\n bool runOnBasicBlock(BasicBlock &BB);\n };\n\n RegisterOpt<LowerAllocations>\n X(\"lowerallocs\", \"Lower allocations from instructions to calls\");\n}\n\n\/\/ createLowerAllocationsPass - Interface to this file...\nFunctionPass *llvm::createLowerAllocationsPass() {\n return new LowerAllocations();\n}\n\n\n\/\/ doInitialization - For the lower allocations pass, this ensures that a\n\/\/ module contains a declaration for a malloc and a free function.\n\/\/\n\/\/ This function is always successful.\n\/\/\nbool LowerAllocations::doInitialization(Module &M) {\n const Type *SBPTy = PointerType::get(Type::SByteTy);\n MallocFunc = M.getNamedFunction(\"malloc\");\n FreeFunc = M.getNamedFunction(\"free\");\n\n if (MallocFunc == 0)\n MallocFunc = M.getOrInsertFunction(\"malloc\", SBPTy, Type::UIntTy, 0);\n if (FreeFunc == 0)\n FreeFunc = M.getOrInsertFunction(\"free\" , Type::VoidTy, SBPTy, 0);\n\n return true;\n}\n\n\/\/ runOnBasicBlock - This method does the actual work of converting\n\/\/ instructions over, assuming that the pass has already been initialized.\n\/\/\nbool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {\n bool Changed = false;\n assert(MallocFunc && FreeFunc && \"Pass not initialized!\");\n\n BasicBlock::InstListType &BBIL = BB.getInstList();\n TargetData &DataLayout = getAnalysis<TargetData>();\n\n \/\/ Loop over all of the instructions, looking for malloc or free instructions\n for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) {\n if (MallocInst *MI = dyn_cast<MallocInst>(I)) {\n const Type *AllocTy = MI->getType()->getElementType();\n \n \/\/ Get the number of bytes to be allocated for one element of the\n \/\/ requested type...\n unsigned Size = DataLayout.getTypeSize(AllocTy);\n \n \/\/ malloc(type) becomes sbyte *malloc(constint)\n Value *MallocArg = ConstantUInt::get(Type::UIntTy, Size);\n if (MI->getNumOperands() && Size == 1) {\n MallocArg = MI->getOperand(0); \/\/ Operand * 1 = Operand\n } else if (MI->getNumOperands()) {\n \/\/ Multiply it by the array size if necessary...\n MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),\n MallocArg, \"\", I);\n }\n\n const FunctionType *MallocFTy = MallocFunc->getFunctionType();\n std::vector<Value*> MallocArgs;\n \n if (MallocFTy->getNumParams() > 0 || MallocFTy->isVarArg()) {\n if (MallocFTy->getNumParams() > 0 &&\n MallocFTy->getParamType(0) != Type::UIntTy)\n MallocArg = new CastInst(MallocArg, MallocFTy->getParamType(0), \"\",I);\n MallocArgs.push_back(MallocArg);\n }\n\n \/\/ If malloc is prototyped to take extra arguments, pass nulls.\n for (unsigned i = 1; i < MallocFTy->getNumParams(); ++i)\n MallocArgs.push_back(Constant::getNullValue(MallocFTy->getParamType(i)));\n\n \/\/ Create the call to Malloc...\n CallInst *MCall = new CallInst(MallocFunc, MallocArgs, \"\", I);\n \n \/\/ Create a cast instruction to convert to the right type...\n Value *MCast;\n if (MCall->getType() != Type::VoidTy)\n MCast = new CastInst(MCall, MI->getType(), \"\", I);\n else\n MCast = Constant::getNullValue(MI->getType());\n \n \/\/ Replace all uses of the old malloc inst with the cast inst\n MI->replaceAllUsesWith(MCast);\n I = --BBIL.erase(I); \/\/ remove and delete the malloc instr...\n Changed = true;\n ++NumLowered;\n } else if (FreeInst *FI = dyn_cast<FreeInst>(I)) {\n const FunctionType *FreeFTy = FreeFunc->getFunctionType();\n std::vector<Value*> FreeArgs;\n \n if (FreeFTy->getNumParams() > 0 || FreeFTy->isVarArg()) {\n Value *MCast = FI->getOperand(0);\n if (FreeFTy->getNumParams() > 0 &&\n FreeFTy->getParamType(0) != MCast->getType())\n MCast = new CastInst(MCast, FreeFTy->getParamType(0), \"\", I);\n FreeArgs.push_back(MCast);\n }\n\n \/\/ If malloc is prototyped to take extra arguments, pass nulls.\n for (unsigned i = 1; i < FreeFTy->getNumParams(); ++i)\n FreeArgs.push_back(Constant::getNullValue(FreeFTy->getParamType(i)));\n \n \/\/ Insert a call to the free function...\n new CallInst(FreeFunc, FreeArgs, \"\", I);\n \n \/\/ Delete the old free instruction\n I = --BBIL.erase(I);\n Changed = true;\n ++NumLowered;\n }\n }\n\n return Changed;\n}\n\n<commit_msg>Don't emit things like malloc(16*1). Allocation instructions are fixed arity now.<commit_after>\/\/===- LowerAllocations.cpp - Reduce malloc & free insts to calls ---------===\/\/\n\/\/ \n\/\/ The LLVM Compiler Infrastructure\n\/\/\n\/\/ This file was developed by the LLVM research group and is distributed under\n\/\/ the University of Illinois Open Source License. See LICENSE.TXT for details.\n\/\/ \n\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ The LowerAllocations transformation is a target-dependent tranformation\n\/\/ because it depends on the size of data types and alignment constraints.\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"llvm\/Transforms\/Scalar.h\"\n#include \"llvm\/Module.h\"\n#include \"llvm\/DerivedTypes.h\"\n#include \"llvm\/iMemory.h\"\n#include \"llvm\/iOther.h\"\n#include \"llvm\/Constants.h\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Target\/TargetData.h\"\n#include \"Support\/Statistic.h\"\nusing namespace llvm;\n\nnamespace {\n Statistic<> NumLowered(\"lowerallocs\", \"Number of allocations lowered\");\n\n \/\/\/ LowerAllocations - Turn malloc and free instructions into %malloc and\n \/\/\/ %free calls.\n \/\/\/\n class LowerAllocations : public BasicBlockPass {\n Function *MallocFunc; \/\/ Functions in the module we are processing\n Function *FreeFunc; \/\/ Initialized by doInitialization\n public:\n LowerAllocations() : MallocFunc(0), FreeFunc(0) {}\n\n virtual void getAnalysisUsage(AnalysisUsage &AU) const {\n AU.addRequired<TargetData>();\n }\n\n \/\/\/ doPassInitialization - For the lower allocations pass, this ensures that\n \/\/\/ a module contains a declaration for a malloc and a free function.\n \/\/\/\n bool doInitialization(Module &M);\n \n \/\/\/ runOnBasicBlock - This method does the actual work of converting\n \/\/\/ instructions over, assuming that the pass has already been initialized.\n \/\/\/\n bool runOnBasicBlock(BasicBlock &BB);\n };\n\n RegisterOpt<LowerAllocations>\n X(\"lowerallocs\", \"Lower allocations from instructions to calls\");\n}\n\n\/\/ createLowerAllocationsPass - Interface to this file...\nFunctionPass *llvm::createLowerAllocationsPass() {\n return new LowerAllocations();\n}\n\n\n\/\/ doInitialization - For the lower allocations pass, this ensures that a\n\/\/ module contains a declaration for a malloc and a free function.\n\/\/\n\/\/ This function is always successful.\n\/\/\nbool LowerAllocations::doInitialization(Module &M) {\n const Type *SBPTy = PointerType::get(Type::SByteTy);\n MallocFunc = M.getNamedFunction(\"malloc\");\n FreeFunc = M.getNamedFunction(\"free\");\n\n if (MallocFunc == 0)\n MallocFunc = M.getOrInsertFunction(\"malloc\", SBPTy, Type::UIntTy, 0);\n if (FreeFunc == 0)\n FreeFunc = M.getOrInsertFunction(\"free\" , Type::VoidTy, SBPTy, 0);\n\n return true;\n}\n\n\/\/ runOnBasicBlock - This method does the actual work of converting\n\/\/ instructions over, assuming that the pass has already been initialized.\n\/\/\nbool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {\n bool Changed = false;\n assert(MallocFunc && FreeFunc && \"Pass not initialized!\");\n\n BasicBlock::InstListType &BBIL = BB.getInstList();\n TargetData &DataLayout = getAnalysis<TargetData>();\n\n \/\/ Loop over all of the instructions, looking for malloc or free instructions\n for (BasicBlock::iterator I = BB.begin(), E = BB.end(); I != E; ++I) {\n if (MallocInst *MI = dyn_cast<MallocInst>(I)) {\n const Type *AllocTy = MI->getType()->getElementType();\n \n \/\/ Get the number of bytes to be allocated for one element of the\n \/\/ requested type...\n unsigned Size = DataLayout.getTypeSize(AllocTy);\n \n \/\/ malloc(type) becomes sbyte *malloc(constint)\n Value *MallocArg = ConstantUInt::get(Type::UIntTy, Size);\n if (MI->getNumOperands() && Size == 1) {\n MallocArg = MI->getOperand(0); \/\/ Operand * 1 = Operand\n } else if (MI->isArrayAllocation()) {\n \/\/ Multiply it by the array size if necessary...\n MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),\n MallocArg, \"\", I);\n }\n\n const FunctionType *MallocFTy = MallocFunc->getFunctionType();\n std::vector<Value*> MallocArgs;\n \n if (MallocFTy->getNumParams() > 0 || MallocFTy->isVarArg()) {\n if (MallocFTy->getNumParams() > 0 &&\n MallocFTy->getParamType(0) != Type::UIntTy)\n MallocArg = new CastInst(MallocArg, MallocFTy->getParamType(0), \"\",I);\n MallocArgs.push_back(MallocArg);\n }\n\n \/\/ If malloc is prototyped to take extra arguments, pass nulls.\n for (unsigned i = 1; i < MallocFTy->getNumParams(); ++i)\n MallocArgs.push_back(Constant::getNullValue(MallocFTy->getParamType(i)));\n\n \/\/ Create the call to Malloc...\n CallInst *MCall = new CallInst(MallocFunc, MallocArgs, \"\", I);\n \n \/\/ Create a cast instruction to convert to the right type...\n Value *MCast;\n if (MCall->getType() != Type::VoidTy)\n MCast = new CastInst(MCall, MI->getType(), \"\", I);\n else\n MCast = Constant::getNullValue(MI->getType());\n \n \/\/ Replace all uses of the old malloc inst with the cast inst\n MI->replaceAllUsesWith(MCast);\n I = --BBIL.erase(I); \/\/ remove and delete the malloc instr...\n Changed = true;\n ++NumLowered;\n } else if (FreeInst *FI = dyn_cast<FreeInst>(I)) {\n const FunctionType *FreeFTy = FreeFunc->getFunctionType();\n std::vector<Value*> FreeArgs;\n \n if (FreeFTy->getNumParams() > 0 || FreeFTy->isVarArg()) {\n Value *MCast = FI->getOperand(0);\n if (FreeFTy->getNumParams() > 0 &&\n FreeFTy->getParamType(0) != MCast->getType())\n MCast = new CastInst(MCast, FreeFTy->getParamType(0), \"\", I);\n FreeArgs.push_back(MCast);\n }\n\n \/\/ If malloc is prototyped to take extra arguments, pass nulls.\n for (unsigned i = 1; i < FreeFTy->getNumParams(); ++i)\n FreeArgs.push_back(Constant::getNullValue(FreeFTy->getParamType(i)));\n \n \/\/ Insert a call to the free function...\n new CallInst(FreeFunc, FreeArgs, \"\", I);\n \n \/\/ Delete the old free instruction\n I = --BBIL.erase(I);\n Changed = true;\n ++NumLowered;\n }\n }\n\n return Changed;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\r\n\/\/\r\n\/\/\t\tMMMAN : Multimedia manager source\r\n\/\/\t\t\t\tfor Windows95\/NT 32bit enviroment\r\n\/\/\t\t\t\t\tonion software\/onitama 1997\/8\r\n\/\/\r\n\r\n#include <windows.h>\r\n#include <windowsx.h>\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <tchar.h>\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : error : sȊ֐ tolower\r\n\tɑΏ\r\n*\/\r\n#if defined( __GNUC__ )\r\n#include <ctype.h>\r\n#endif\r\n\r\n#include \"..\/supio.h\"\r\n#include \"..\/dpmread.h\"\r\n#include \"..\/strbuf.h\"\r\n#include \"mmman.h\"\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : warning : #pragma comment 𖳎\r\n\tɑΏ\r\n*\/\r\n#if defined( _MSC_VER )\r\n#pragma comment(lib,\"winmm.lib\")\r\n#endif\r\n\r\n#ifdef HSPUTF8\r\n#pragma execution_character_set(\"utf-8\")\r\n#endif\r\n\r\n\r\n#define sndbank(a) (char *)(mem_snd[a].mempt)\r\n\r\nvoid MMMan::SendMCIT(TCHAR *ss)\r\n{\r\n\tchar *ss8;\r\n\tapichartohspchar(ss,&ss8);\r\n\tSendMCI( ss8 );\r\n\tfreehc(&ss8);\r\n}\r\n\r\nMMMan::MMMan()\r\n{\r\n\t\/\/\t\tinitalize MM manager\r\n\t\/\/\r\n\tmem_snd = NULL;\r\n\tmm_cur = 0;\r\n}\r\n\r\n\r\nMMMan::~MMMan()\r\n{\r\n\t\/\/\t\tterminate MM manager\r\n\t\/\/\r\n\tClearAllBank();\r\n}\r\n\r\n\r\nvoid MMMan::DeleteBank( int bank )\r\n{\r\n\tchar *lpSnd;\r\n\tlpSnd = sndbank( bank );\r\n\tif ( lpSnd != NULL ) {\r\n\t\tfree( lpSnd );\r\n\t}\r\n\tmem_snd[bank].mempt=NULL;\r\n\tif ( mem_snd[bank].fname != NULL ) {\r\n\t\tfree( mem_snd[bank].fname );\r\n\t\tmem_snd[bank].fname = NULL;\r\n\t}\r\n}\r\n\r\n\r\nint MMMan::SearchBank( int num )\r\n{\r\n\tint a;\r\n\tfor(a=0;a<mm_cur;a++) {\r\n\t\tif ( mem_snd[a].num == num ) return a;\r\n\t}\r\n\treturn -1;\r\n}\r\n\r\n\r\nMMM *MMMan::SetBank( int num, int flag, int opt, void *mempt, char *fname )\r\n{\r\n\tint bank;\r\n\tMMM *m;\r\n\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) {\r\n\t\tbank = AllocBank();\r\n\t} else {\r\n\t\tDeleteBank( bank );\r\n\t}\r\n\r\n\tm = &(mem_snd[bank]);\r\n\tm->flag = flag;\r\n\tm->opt = opt;\r\n\tm->num = num;\r\n\tm->vol = 0;\r\n\tm->pan = 0;\r\n\tm->mempt = mempt;\r\n\tm->fname = NULL;\r\n\r\n\tif ( fname != NULL ) {\r\n\t\tm->fname = (char *)malloc( strlen( fname )+1 );\r\n\t\tstrcpy( m->fname, fname );\r\n\t}\r\n\treturn m;\r\n}\r\n\r\n\r\nint MMMan::AllocBank( void )\r\n{\r\n\tint id,sz;\r\n\tid = mm_cur++;\r\n\tsz = mm_cur * sizeof(MMM);\r\n\tif ( mem_snd == NULL ) {\r\n\t\tmem_snd = (MMM *)sbAlloc( sz );\r\n\t} else {\r\n\t\tmem_snd = (MMM *)sbExpand( (char *)mem_snd, sz );\r\n\t}\r\n\tmem_snd[id].flag = MMDATA_NONE;\r\n\tmem_snd[id].num = -1;\r\n\treturn id;\r\n}\r\n\r\n\r\nvoid MMMan::ClearAllBank( void )\r\n{\r\n\tint a;\r\n\tif ( mem_snd != NULL ) {\r\n\t\tStop();\r\n\t\tfor(a=0;a<mm_cur;a++) {\r\n\t\t\tDeleteBank( a );\r\n\t\t}\r\n\t\tsbFree( mem_snd );\r\n\t\tmem_snd = NULL;\r\n\t\tmm_cur = 0;\r\n\t}\r\n}\r\n\r\n\r\nvoid MMMan::Reset( HWND hwnd )\r\n{\r\n\tClearAllBank();\r\n\thwm = hwnd;\r\n\tavi_wnd = hwnd;\r\n\tcurmus=-1;\r\n}\r\n\r\n\r\nint MMMan::SendMCI( char *mci_commands )\r\n{\r\n\tint a;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\tHSPAPICHAR *hactmp2 = 0;\r\n\ta=mciSendString( chartoapichar(mci_commands,&hactmp1),chartoapichar(res,&hactmp2),256,hwm );\r\n\tfreehac(&hactmp1);\r\n\tfreehac(&hactmp2);\r\n\tif (a) return -1;\r\n\treturn atoi(res);\r\n}\r\n\r\n\r\nchar *MMMan::GetMCIResult( void )\r\n{\r\n\treturn res;\r\n}\r\n\r\n\r\nvoid MMMan::SetWindow( HWND hwnd, int x, int y, int sx, int sy )\r\n{\r\n\tavi_wnd = hwnd;\r\n\tavi_x = x; avi_y = y;\r\n\tavi_sx = sx; avi_sy = sy;\r\n}\r\n\r\n\r\nvoid MMMan::Stop( void )\r\n{\r\n\t\/\/\t\tstop playing sound\r\n\t\/\/\r\n\tsndPlaySound(NULL, 0);\t\t\t\t\/\/ stop PCM sound\r\n\tif (curmus!=-1) {\r\n\t\tSendMCI(\"stop myid\");\r\n\t\tSendMCI(\"close myid\");\r\n\t\tcurmus=-1;\r\n\t}\r\n}\r\n\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : warning : a ͑OɎg\r\n\tɑΏB\r\n\tۂɂ͂肦ȂB\r\n*\/\r\nint MMMan::Load( char *fname, int num, int opt )\r\n{\r\n\t\/\/\t\tLoad sound to bank\r\n\t\/\/\t\t\topt : 0=normal\/1=loop\/2=wait\/3=continuous\r\n\t\/\/\r\n\tint a = 1,getlen;\r\n\tchar fext[8];\r\n\tchar a1,a2,a3;\r\n\tchar *pt;\r\n\tint flag;\r\n\tMMM *mmm;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\tHSPAPICHAR wfext[9];\r\n\r\n\tflag = MMDATA_MCIVOICE;\r\n\tpt = NULL;\r\n\r\n\ta1=tolower(fname[0]);\r\n\ta2=tolower(fname[1]);\r\n\ta3=fname[2];\r\n\tif ((a1=='c')&&(a2=='d')&&(a3==':')) {\t\/\/ when \"CD\"\r\n\t\tflag = MMDATA_CDAUDIO;\r\n\t\ta = atoi( fname+3 );if ( a<1 ) a=1;\r\n\t}\r\n\r\n\tgetpathW(chartoapichar(fname,&hactmp1),wfext,16+2);\t\t\t\t\/\/ gqŎo\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".avi\"))) {\t\t\t\t\/\/ when \"AVI\"\r\n\t\tflag = MMDATA_MCIVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".wmv\"))) {\t\t\t\t\/\/ when \"WMV\"\r\n\t\tflag = MMDATA_MCIVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".mpg\"))) {\t\t\t\t\/\/ when \"MPG\"\r\n\t\tflag = MMDATA_MPEGVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".wav\"))) {\t\t\t\t\/\/ when \"WAV\"\r\n\t\tgetlen = dpm_exist( fname );\r\n\t\tif (getlen == -1) {\r\n\t\t\tfreehac(&hactmp1);\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t\tif ( getlen < 2000000 ) {\t\t\t\/\/ 2MBȏMCIĐ\r\n\t\t\tpt = (char *)malloc( getlen+16 );\r\n\t\t\tdpm_read( fname, pt, getlen, 0 );\r\n\t\t\tflag = MMDATA_INTWAVE;\r\n\t\t}\r\n\t}\r\n\tfreehac(&hactmp1);\r\n\r\n\tmmm = SetBank( num, flag, opt, pt, fname );\r\n\r\n\tif ( flag == MMDATA_CDAUDIO ) {\r\n\t\tmmm->track = a;\r\n\t\tmmm->lasttrk = SendMCI( \"status cdaudio number of tracks\" );\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\nint MMMan::Play( int num )\r\n{\r\n\t\/\/\t\tPlay sound\r\n\t\/\/\r\n\tint a,i,j,flg;\r\n\tint prm;\r\n\tint bank;\r\n\tTCHAR ss[1024];\r\n\tTCHAR fpath[MAX_PATH];\r\n\tMMM *mmm;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return 1;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\ta=mmm->opt;\r\n\tflg=mmm->flag;\r\n\tif ((flg>1)&&(curmus!=-1)) Stop();\r\n\tswitch(flg) {\r\n\r\n\t\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\r\n\t\t\tprm=SND_MEMORY | SND_NODEFAULT;\r\n\t\t\tif (a==0) prm|=SND_ASYNC;\r\n\t\t\tif (a==1) prm|=SND_LOOP | SND_ASYNC;\r\n\t\t\tif (a==2) prm|=SND_SYNC;\r\n#ifdef HSPUTF8\r\n\t\t\tsndPlaySound( chartoapichar((char*)mmm->mempt,&hactmp1),prm );\r\n\t\t\tfreehac(&hactmp1);\r\n#else\r\n\t\t\tsndPlaySound( (LPCSTR)mmm->mempt,prm);\r\n#endif\r\n\t\t\treturn 0;\r\n\r\n\t\tcase MMDATA_MCIVOICE:\t\t\t\t\t\t\t\/\/ when \"MID\" file\r\n\t\tcase MMDATA_MCIVIDEO:\t\t\t\t\t\t\t\/\/ when \"AVI\" file\r\n\t\tcase MMDATA_MPEGVIDEO:\t\t\t\t\t\t\t\/\/ when \"MPG\" file\r\n\r\n\t\t\tif ( GetShortPathName( chartoapichar(mmm->fname,&hactmp1), fpath, MAX_PATH ) == 0 ) {\r\n\t\t\t\tfreehac(&hactmp1);\r\n\t\t\t\treturn 1;\r\n\t\t\t}\r\n\t\t\tfreehac(&hactmp1);\r\n\t\t\tif ( flg!=MMDATA_MPEGVIDEO ) {\r\n\t\t\t\t_stprintf( ss,TEXT(\"open %s alias myid\"),fpath );\r\n\t\t\t} else {\r\n\t\t\t\t_stprintf( ss,TEXT(\"open %s type MPEGVIDEO alias myid\"),fpath );\r\n\t\t\t}\r\n\t\t\tSendMCIT( ss );\r\n\t\t\tif (flg!=MMDATA_MCIVOICE) {\r\n\t\t\t\tif ( SendMCI( \"where myid source\" )==0 ) strcpy( avi_wh,res+4 );\r\n\t\t\t\tif ( a&16 ) {\r\n\t\t\t\t\tsprintf( avi_wh,\"%d %d\",avi_sx,avi_sy );\r\n\t\t\t\t\tavi_x=0;avi_y=0;\r\n\t\t\t\t}\r\n\t\t\t\t_stprintf( ss,TEXT(\"window myid handle %u\"), (unsigned)HandleToUlong(avi_wnd) );\r\n\t\t\t\tSendMCIT( ss );\r\n\t\t\t\t_stprintf( ss,TEXT(\"put myid destination at %d %d %s\"),avi_x,avi_y,chartoapichar(avi_wh,&hactmp1) );\r\n\t\t\t\tfreehac(&hactmp1);\r\n\t\t\t\tSendMCIT( ss );\r\n\t\t\t}\r\n\t\t\t_tcscpy( ss,TEXT(\"play myid from 0\") );\r\n\t\t\tbreak;\r\n\r\n\t\tcase MMDATA_CDAUDIO:\t\t\t\t\t\t\t\/\/ when \"CD audio\"\r\n\r\n\t\t\tSendMCI( \"open cdaudio alias myid\" );\r\n\t\t\tSendMCI( \"set myid time format tmsf\" );\r\n\r\n\t\t\ti=mmm->track;j=mmm->lasttrk;\r\n\t\t\tif ((i==j)||(a==3)) {\r\n\t\t\t\t_stprintf( ss,TEXT(\"play myid from %d\"),i );\r\n\t\t\t} else {\r\n\t\t\t\t_stprintf( ss,TEXT(\"play myid from %d to %d\"),i,i+1 );\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t}\r\n\r\n\ta&=15;\r\n\tif (a==1) _tcscat( ss,TEXT(\" notify\") );\r\n\tif (a==2) _tcscat( ss,TEXT(\" wait\") );\r\n\tSendMCIT(ss);\r\n\tcurmus = num;\r\n\r\n\tif ( mmm->vol != 0 ) { SetVol( num, mmm->vol ); }\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid MMMan::Notify( void )\r\n{\r\n\t\/\/\t\tcallback from windows message\r\n\t\/\/\t\t\t\"MM_MCINOTIFY\"\r\n\t\/\/\r\n\tint a;\r\n\ta=curmus;\r\n\tif (curmus!=-1) {\r\n\t\tSendMCI(\"stop myid\");\r\n\t\tSendMCI(\"close myid\");\r\n\t\tcurmus=-1;\r\n\t}\r\n\tPlay( a );\r\n}\r\n\r\n\r\nvoid MMMan::GetInfo( int bank, char **fname, int *num, int *flag, int *opt )\r\n{\r\n\t\/\/\t\tGet MMM info\r\n\t\/\/\r\n\tMMM *mmm;\r\n\tmmm=&mem_snd[bank];\r\n\t*fname = mmm->fname;\r\n\t*opt=mmm->opt;\r\n\t*flag=mmm->flag;\r\n\t*num=mmm->num;\r\n}\r\n\r\n\/*\r\nint MMMan::GetBusy( void )\r\n{\r\n\t\/\/\t\twavĐ𒲂ׂ\r\n\t\/\/\r\n\tif ( sndPlaySound( (LPCSTR)\"\",SND_NOSTOP|SND_NODEFAULT ) == FALSE ) {\r\n\t\treturn 1;\r\n\t}\r\n\treturn 0;\r\n}\r\n*\/\r\n\r\n\r\nvoid MMMan::SetVol( int num, int vol )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tchar ss[1024];\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tmmm->vol = vol;\r\n\tif ( mmm->vol > 0 ) mmm->vol = 0;\r\n\tif ( mmm->vol < -1000 ) mmm->vol = -1000;\r\n\r\n\tflg=mmm->flag;\r\n\tswitch(flg) {\r\n\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\t\t\/\/\r\n\t\tbreak;\r\n\tcase MMDATA_MCIVOICE:\t\t\t\t\t\t\t\/\/ when \"MID\" file\r\n\tcase MMDATA_MCIVIDEO:\t\t\t\t\t\t\t\/\/ when \"AVI\" file\r\n\tcase MMDATA_MPEGVIDEO:\t\t\t\t\t\t\t\/\/ when \"MPG\" file\r\n\t\tif ( curmus != -1 ) {\r\n\t\t\tint mcivol;\r\n\t\t\tmcivol = mmm->vol + 1000;\r\n\t\t\tsprintf( ss,\"setaudio myid volume to %d\",mcivol );\r\n\t\t\tSendMCI( ss );\r\n\t\t}\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\r\nvoid MMMan::SetPan( int num, int pan )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tflg=mmm->flag;\r\n\tswitch(flg) {\r\n\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\t\t\/\/\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\r\nint MMMan::GetStatus( int num, int infoid )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tint res;\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return 0;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tflg=mmm->flag;\r\n\tres = 0;\r\n\tswitch( infoid ) {\r\n\tcase 0:\r\n\t\tres = mmm->opt;\r\n\t\tbreak;\r\n\tcase 1:\r\n\t\tres = mmm->vol;\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tres = mmm->pan;\r\n\t\tbreak;\r\n\tcase 16:\r\n\t\tif (( flg == MMDATA_MCIVOICE )||( flg == MMDATA_MCIVIDEO )||( flg == MMDATA_MPEGVIDEO )) {\r\n\t\t\tif (curmus!=-1) res = 1;\r\n\t\t}\r\n\t\tbreak;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\n\r\n<commit_msg>hsp3utfのmmplayで2MB未満のwavファイルが再生できなかった問題を修正<commit_after>\r\n\/\/\r\n\/\/\t\tMMMAN : Multimedia manager source\r\n\/\/\t\t\t\tfor Windows95\/NT 32bit enviroment\r\n\/\/\t\t\t\t\tonion software\/onitama 1997\/8\r\n\/\/\r\n\r\n#include <windows.h>\r\n#include <windowsx.h>\r\n#include <stdlib.h>\r\n#include <stdio.h>\r\n#include <string.h>\r\n#include <tchar.h>\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : error : sȊ֐ tolower\r\n\tɑΏ\r\n*\/\r\n#if defined( __GNUC__ )\r\n#include <ctype.h>\r\n#endif\r\n\r\n#include \"..\/supio.h\"\r\n#include \"..\/dpmread.h\"\r\n#include \"..\/strbuf.h\"\r\n#include \"mmman.h\"\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : warning : #pragma comment 𖳎\r\n\tɑΏ\r\n*\/\r\n#if defined( _MSC_VER )\r\n#pragma comment(lib,\"winmm.lib\")\r\n#endif\r\n\r\n#ifdef HSPUTF8\r\n#pragma execution_character_set(\"utf-8\")\r\n#endif\r\n\r\n\r\n#define sndbank(a) (char *)(mem_snd[a].mempt)\r\n\r\nvoid MMMan::SendMCIT(TCHAR *ss)\r\n{\r\n\tchar *ss8;\r\n\tapichartohspchar(ss,&ss8);\r\n\tSendMCI( ss8 );\r\n\tfreehc(&ss8);\r\n}\r\n\r\nMMMan::MMMan()\r\n{\r\n\t\/\/\t\tinitalize MM manager\r\n\t\/\/\r\n\tmem_snd = NULL;\r\n\tmm_cur = 0;\r\n}\r\n\r\n\r\nMMMan::~MMMan()\r\n{\r\n\t\/\/\t\tterminate MM manager\r\n\t\/\/\r\n\tClearAllBank();\r\n}\r\n\r\n\r\nvoid MMMan::DeleteBank( int bank )\r\n{\r\n\tchar *lpSnd;\r\n\tlpSnd = sndbank( bank );\r\n\tif ( lpSnd != NULL ) {\r\n\t\tfree( lpSnd );\r\n\t}\r\n\tmem_snd[bank].mempt=NULL;\r\n\tif ( mem_snd[bank].fname != NULL ) {\r\n\t\tfree( mem_snd[bank].fname );\r\n\t\tmem_snd[bank].fname = NULL;\r\n\t}\r\n}\r\n\r\n\r\nint MMMan::SearchBank( int num )\r\n{\r\n\tint a;\r\n\tfor(a=0;a<mm_cur;a++) {\r\n\t\tif ( mem_snd[a].num == num ) return a;\r\n\t}\r\n\treturn -1;\r\n}\r\n\r\n\r\nMMM *MMMan::SetBank( int num, int flag, int opt, void *mempt, char *fname )\r\n{\r\n\tint bank;\r\n\tMMM *m;\r\n\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) {\r\n\t\tbank = AllocBank();\r\n\t} else {\r\n\t\tDeleteBank( bank );\r\n\t}\r\n\r\n\tm = &(mem_snd[bank]);\r\n\tm->flag = flag;\r\n\tm->opt = opt;\r\n\tm->num = num;\r\n\tm->vol = 0;\r\n\tm->pan = 0;\r\n\tm->mempt = mempt;\r\n\tm->fname = NULL;\r\n\r\n\tif ( fname != NULL ) {\r\n\t\tm->fname = (char *)malloc( strlen( fname )+1 );\r\n\t\tstrcpy( m->fname, fname );\r\n\t}\r\n\treturn m;\r\n}\r\n\r\n\r\nint MMMan::AllocBank( void )\r\n{\r\n\tint id,sz;\r\n\tid = mm_cur++;\r\n\tsz = mm_cur * sizeof(MMM);\r\n\tif ( mem_snd == NULL ) {\r\n\t\tmem_snd = (MMM *)sbAlloc( sz );\r\n\t} else {\r\n\t\tmem_snd = (MMM *)sbExpand( (char *)mem_snd, sz );\r\n\t}\r\n\tmem_snd[id].flag = MMDATA_NONE;\r\n\tmem_snd[id].num = -1;\r\n\treturn id;\r\n}\r\n\r\n\r\nvoid MMMan::ClearAllBank( void )\r\n{\r\n\tint a;\r\n\tif ( mem_snd != NULL ) {\r\n\t\tStop();\r\n\t\tfor(a=0;a<mm_cur;a++) {\r\n\t\t\tDeleteBank( a );\r\n\t\t}\r\n\t\tsbFree( mem_snd );\r\n\t\tmem_snd = NULL;\r\n\t\tmm_cur = 0;\r\n\t}\r\n}\r\n\r\n\r\nvoid MMMan::Reset( HWND hwnd )\r\n{\r\n\tClearAllBank();\r\n\thwm = hwnd;\r\n\tavi_wnd = hwnd;\r\n\tcurmus=-1;\r\n}\r\n\r\n\r\nint MMMan::SendMCI( char *mci_commands )\r\n{\r\n\tint a;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\tHSPAPICHAR *hactmp2 = 0;\r\n\ta=mciSendString( chartoapichar(mci_commands,&hactmp1),chartoapichar(res,&hactmp2),256,hwm );\r\n\tfreehac(&hactmp1);\r\n\tfreehac(&hactmp2);\r\n\tif (a) return -1;\r\n\treturn atoi(res);\r\n}\r\n\r\n\r\nchar *MMMan::GetMCIResult( void )\r\n{\r\n\treturn res;\r\n}\r\n\r\n\r\nvoid MMMan::SetWindow( HWND hwnd, int x, int y, int sx, int sy )\r\n{\r\n\tavi_wnd = hwnd;\r\n\tavi_x = x; avi_y = y;\r\n\tavi_sx = sx; avi_sy = sy;\r\n}\r\n\r\n\r\nvoid MMMan::Stop( void )\r\n{\r\n\t\/\/\t\tstop playing sound\r\n\t\/\/\r\n\tsndPlaySound(NULL, 0);\t\t\t\t\/\/ stop PCM sound\r\n\tif (curmus!=-1) {\r\n\t\tSendMCI(\"stop myid\");\r\n\t\tSendMCI(\"close myid\");\r\n\t\tcurmus=-1;\r\n\t}\r\n}\r\n\r\n\r\n\/*\r\n\trev 43\r\n\tmingw : warning : a ͑OɎg\r\n\tɑΏB\r\n\tۂɂ͂肦ȂB\r\n*\/\r\nint MMMan::Load( char *fname, int num, int opt )\r\n{\r\n\t\/\/\t\tLoad sound to bank\r\n\t\/\/\t\t\topt : 0=normal\/1=loop\/2=wait\/3=continuous\r\n\t\/\/\r\n\tint a = 1,getlen;\r\n\tchar fext[8];\r\n\tchar a1,a2,a3;\r\n\tchar *pt;\r\n\tint flag;\r\n\tMMM *mmm;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\tHSPAPICHAR wfext[9];\r\n\r\n\tflag = MMDATA_MCIVOICE;\r\n\tpt = NULL;\r\n\r\n\ta1=tolower(fname[0]);\r\n\ta2=tolower(fname[1]);\r\n\ta3=fname[2];\r\n\tif ((a1=='c')&&(a2=='d')&&(a3==':')) {\t\/\/ when \"CD\"\r\n\t\tflag = MMDATA_CDAUDIO;\r\n\t\ta = atoi( fname+3 );if ( a<1 ) a=1;\r\n\t}\r\n\r\n\tgetpathW(chartoapichar(fname,&hactmp1),wfext,16+2);\t\t\t\t\/\/ gqŎo\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".avi\"))) {\t\t\t\t\/\/ when \"AVI\"\r\n\t\tflag = MMDATA_MCIVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".wmv\"))) {\t\t\t\t\/\/ when \"WMV\"\r\n\t\tflag = MMDATA_MCIVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".mpg\"))) {\t\t\t\t\/\/ when \"MPG\"\r\n\t\tflag = MMDATA_MPEGVIDEO;\r\n\t}\r\n\r\n\tif (!_tcscmp(wfext,TEXT(\".wav\"))) {\t\t\t\t\/\/ when \"WAV\"\r\n\t\tgetlen = dpm_exist( fname );\r\n\t\tif (getlen == -1) {\r\n\t\t\tfreehac(&hactmp1);\r\n\t\t\treturn 1;\r\n\t\t}\r\n\t\tif ( getlen < 2000000 ) {\t\t\t\/\/ 2MBȏMCIĐ\r\n\t\t\tpt = (char *)malloc( getlen+16 );\r\n\t\t\tdpm_read( fname, pt, getlen, 0 );\r\n\t\t\tflag = MMDATA_INTWAVE;\r\n\t\t}\r\n\t}\r\n\tfreehac(&hactmp1);\r\n\r\n\tmmm = SetBank( num, flag, opt, pt, fname );\r\n\r\n\tif ( flag == MMDATA_CDAUDIO ) {\r\n\t\tmmm->track = a;\r\n\t\tmmm->lasttrk = SendMCI( \"status cdaudio number of tracks\" );\r\n\t}\r\n\treturn 0;\r\n}\r\n\r\n\r\nint MMMan::Play( int num )\r\n{\r\n\t\/\/\t\tPlay sound\r\n\t\/\/\r\n\tint a,i,j,flg;\r\n\tint prm;\r\n\tint bank;\r\n\tTCHAR ss[1024];\r\n\tTCHAR fpath[MAX_PATH];\r\n\tMMM *mmm;\r\n\tHSPAPICHAR *hactmp1 = 0;\r\n\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return 1;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\ta=mmm->opt;\r\n\tflg=mmm->flag;\r\n\tif ((flg>1)&&(curmus!=-1)) Stop();\r\n\tswitch(flg) {\r\n\r\n\t\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\r\n\t\t\tprm=SND_MEMORY | SND_NODEFAULT;\r\n\t\t\tif (a==0) prm|=SND_ASYNC;\r\n\t\t\tif (a==1) prm|=SND_LOOP | SND_ASYNC;\r\n\t\t\tif (a==2) prm|=SND_SYNC;\r\n#ifdef HSPUTF8\r\n\t\t\tsndPlaySound( (LPCTSTR)mmm->mempt,prm );\r\n#else\r\n\t\t\tsndPlaySound( (LPCSTR)mmm->mempt,prm);\r\n#endif\r\n\t\t\treturn 0;\r\n\r\n\t\tcase MMDATA_MCIVOICE:\t\t\t\t\t\t\t\/\/ when \"MID\" file\r\n\t\tcase MMDATA_MCIVIDEO:\t\t\t\t\t\t\t\/\/ when \"AVI\" file\r\n\t\tcase MMDATA_MPEGVIDEO:\t\t\t\t\t\t\t\/\/ when \"MPG\" file\r\n\r\n\t\t\tif ( GetShortPathName( chartoapichar(mmm->fname,&hactmp1), fpath, MAX_PATH ) == 0 ) {\r\n\t\t\t\tfreehac(&hactmp1);\r\n\t\t\t\treturn 1;\r\n\t\t\t}\r\n\t\t\tfreehac(&hactmp1);\r\n\t\t\tif ( flg!=MMDATA_MPEGVIDEO ) {\r\n\t\t\t\t_stprintf( ss,TEXT(\"open %s alias myid\"),fpath );\r\n\t\t\t} else {\r\n\t\t\t\t_stprintf( ss,TEXT(\"open %s type MPEGVIDEO alias myid\"),fpath );\r\n\t\t\t}\r\n\t\t\tSendMCIT( ss );\r\n\t\t\tif (flg!=MMDATA_MCIVOICE) {\r\n\t\t\t\tif ( SendMCI( \"where myid source\" )==0 ) strcpy( avi_wh,res+4 );\r\n\t\t\t\tif ( a&16 ) {\r\n\t\t\t\t\tsprintf( avi_wh,\"%d %d\",avi_sx,avi_sy );\r\n\t\t\t\t\tavi_x=0;avi_y=0;\r\n\t\t\t\t}\r\n\t\t\t\t_stprintf( ss,TEXT(\"window myid handle %u\"), (unsigned)HandleToUlong(avi_wnd) );\r\n\t\t\t\tSendMCIT( ss );\r\n\t\t\t\t_stprintf( ss,TEXT(\"put myid destination at %d %d %s\"),avi_x,avi_y,chartoapichar(avi_wh,&hactmp1) );\r\n\t\t\t\tfreehac(&hactmp1);\r\n\t\t\t\tSendMCIT( ss );\r\n\t\t\t}\r\n\t\t\t_tcscpy( ss,TEXT(\"play myid from 0\") );\r\n\t\t\tbreak;\r\n\r\n\t\tcase MMDATA_CDAUDIO:\t\t\t\t\t\t\t\/\/ when \"CD audio\"\r\n\r\n\t\t\tSendMCI( \"open cdaudio alias myid\" );\r\n\t\t\tSendMCI( \"set myid time format tmsf\" );\r\n\r\n\t\t\ti=mmm->track;j=mmm->lasttrk;\r\n\t\t\tif ((i==j)||(a==3)) {\r\n\t\t\t\t_stprintf( ss,TEXT(\"play myid from %d\"),i );\r\n\t\t\t} else {\r\n\t\t\t\t_stprintf( ss,TEXT(\"play myid from %d to %d\"),i,i+1 );\r\n\t\t\t}\r\n\t\t\tbreak;\r\n\t}\r\n\r\n\ta&=15;\r\n\tif (a==1) _tcscat( ss,TEXT(\" notify\") );\r\n\tif (a==2) _tcscat( ss,TEXT(\" wait\") );\r\n\tSendMCIT(ss);\r\n\tcurmus = num;\r\n\r\n\tif ( mmm->vol != 0 ) { SetVol( num, mmm->vol ); }\r\n\r\n\treturn 0;\r\n}\r\n\r\n\r\nvoid MMMan::Notify( void )\r\n{\r\n\t\/\/\t\tcallback from windows message\r\n\t\/\/\t\t\t\"MM_MCINOTIFY\"\r\n\t\/\/\r\n\tint a;\r\n\ta=curmus;\r\n\tif (curmus!=-1) {\r\n\t\tSendMCI(\"stop myid\");\r\n\t\tSendMCI(\"close myid\");\r\n\t\tcurmus=-1;\r\n\t}\r\n\tPlay( a );\r\n}\r\n\r\n\r\nvoid MMMan::GetInfo( int bank, char **fname, int *num, int *flag, int *opt )\r\n{\r\n\t\/\/\t\tGet MMM info\r\n\t\/\/\r\n\tMMM *mmm;\r\n\tmmm=&mem_snd[bank];\r\n\t*fname = mmm->fname;\r\n\t*opt=mmm->opt;\r\n\t*flag=mmm->flag;\r\n\t*num=mmm->num;\r\n}\r\n\r\n\/*\r\nint MMMan::GetBusy( void )\r\n{\r\n\t\/\/\t\twavĐ𒲂ׂ\r\n\t\/\/\r\n\tif ( sndPlaySound( (LPCSTR)\"\",SND_NOSTOP|SND_NODEFAULT ) == FALSE ) {\r\n\t\treturn 1;\r\n\t}\r\n\treturn 0;\r\n}\r\n*\/\r\n\r\n\r\nvoid MMMan::SetVol( int num, int vol )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tchar ss[1024];\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tmmm->vol = vol;\r\n\tif ( mmm->vol > 0 ) mmm->vol = 0;\r\n\tif ( mmm->vol < -1000 ) mmm->vol = -1000;\r\n\r\n\tflg=mmm->flag;\r\n\tswitch(flg) {\r\n\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\t\t\/\/\r\n\t\tbreak;\r\n\tcase MMDATA_MCIVOICE:\t\t\t\t\t\t\t\/\/ when \"MID\" file\r\n\tcase MMDATA_MCIVIDEO:\t\t\t\t\t\t\t\/\/ when \"AVI\" file\r\n\tcase MMDATA_MPEGVIDEO:\t\t\t\t\t\t\t\/\/ when \"MPG\" file\r\n\t\tif ( curmus != -1 ) {\r\n\t\t\tint mcivol;\r\n\t\t\tmcivol = mmm->vol + 1000;\r\n\t\t\tsprintf( ss,\"setaudio myid volume to %d\",mcivol );\r\n\t\t\tSendMCI( ss );\r\n\t\t}\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\r\nvoid MMMan::SetPan( int num, int pan )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tflg=mmm->flag;\r\n\tswitch(flg) {\r\n\tcase MMDATA_INTWAVE:\t\t\t\t\t\t\t\/\/ when \"WAV\"\r\n\t\t\/\/\r\n\t\tbreak;\r\n\t}\r\n}\r\n\r\n\r\nint MMMan::GetStatus( int num, int infoid )\r\n{\r\n\tMMM *mmm;\r\n\tint bank,flg;\r\n\tint res;\r\n\tbank = SearchBank( num );\r\n\tif ( bank < 0 ) return 0;\r\n\r\n\tmmm=&mem_snd[bank];\r\n\tflg=mmm->flag;\r\n\tres = 0;\r\n\tswitch( infoid ) {\r\n\tcase 0:\r\n\t\tres = mmm->opt;\r\n\t\tbreak;\r\n\tcase 1:\r\n\t\tres = mmm->vol;\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\tres = mmm->pan;\r\n\t\tbreak;\r\n\tcase 16:\r\n\t\tif (( flg == MMDATA_MCIVOICE )||( flg == MMDATA_MCIVIDEO )||( flg == MMDATA_MPEGVIDEO )) {\r\n\t\t\tif (curmus!=-1) res = 1;\r\n\t\t}\r\n\t\tbreak;\r\n\t}\r\n\treturn res;\r\n}\r\n\r\n\r\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n\n#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\nint main () {\n return 0;\n}\n<commit_msg>add template.cc<commit_after>#include <stdio.h>\n#include <string.h>\n\n#include <iostream>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\nint main () {\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <pthread.h>\n#include <stdlib.h>\n#include <stdio.h>\n\nconst int N = 1000;\nvoid *x[N];\n\nvoid *Thread1(void *) {\n for (int i = 0; i < N; i++) {\n fprintf(stderr, \"%s %d\\n\", __FUNCTION__, i);\n free(x[i]);\n }\n return NULL;\n}\n\nvoid *Thread2(void *) {\n for (int i = 0; i < N; i++) {\n fprintf(stderr, \"%s %d\\n\", __FUNCTION__, i);\n free(x[i]);\n }\n return NULL;\n}\n\nint main() {\n for (int i = 0; i < N; i++)\n x[i] = malloc(128);\n pthread_t t[2];\n pthread_create(&t[0], 0, Thread1, 0);\n pthread_create(&t[1], 0, Thread2, 0);\n pthread_join(t[0], 0);\n pthread_join(t[1], 0);\n}\n<commit_msg>[asan] fix lint<commit_after>#include <pthread.h>\n#include <stdlib.h>\n#include <stdio.h>\n\nconst int N = 1000;\nvoid *x[N];\n\nvoid *Thread1(void *unused) {\n for (int i = 0; i < N; i++) {\n fprintf(stderr, \"%s %d\\n\", __FUNCTION__, i);\n free(x[i]);\n }\n return NULL;\n}\n\nvoid *Thread2(void *unused) {\n for (int i = 0; i < N; i++) {\n fprintf(stderr, \"%s %d\\n\", __FUNCTION__, i);\n free(x[i]);\n }\n return NULL;\n}\n\nint main() {\n for (int i = 0; i < N; i++)\n x[i] = malloc(128);\n pthread_t t[2];\n pthread_create(&t[0], 0, Thread1, 0);\n pthread_create(&t[1], 0, Thread2, 0);\n pthread_join(t[0], 0);\n pthread_join(t[1], 0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlparse.hxx,v $\n *\n * $Revision: 1.13 $\n *\n * last change: $Author: kz $ $Date: 2008-03-06 12:34:17 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef BOOTSTRP_XMLPARSE_HXX\n#define BOOTSTRP_XMLPARSE_HXX\n\n#include <signal.h>\n#ifdef SYSTEM_EXPAT\n#include <expat.h>\n#else\n#include <external\/expat\/xmlparse.h>\n#endif\n#include <rtl\/ustring.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include \"tools\/string.hxx\"\n#include \"tools\/list.hxx\"\n#define ENABLE_BYTESTRING_STREAM_OPERATORS\n#include \"tools\/stream.hxx\"\n#include \"tools\/isofallback.hxx\"\n#include \"export.hxx\"\n#include \"xmlutil.hxx\"\n\n#include <fstream>\n#include <iostream>\n\nclass XMLParentNode;\nclass XMLElement;\n\n\nusing namespace ::rtl;\nusing namespace std;\n\n#include <hash_map> \/* std::hashmap*\/\n#include <deque> \/* std::deque*\/\n#include <iterator> \/* std::iterator*\/\n#include <list> \/* std::list*\/\n#include <vector> \/* std::vector*\/\n#define XML_NODE_TYPE_FILE 0x001\n#define XML_NODE_TYPE_ELEMENT 0x002\n#define XML_NODE_TYPE_DATA 0x003\n#define XML_NODE_TYPE_COMMENT 0x004\n#define XML_NODE_TYPE_DEFAULT 0x005\n#define MAX_LANGUAGES 99\n\n\n\/\/#define TESTDRIVER \/* use xml2gsi testclass *\/\n\/\/-------------------------------------------------------------------------\n\n\/** Holds data of Attributes\n *\/\nclass XMLAttribute : public String\n{\nprivate:\n String sValue;\n\npublic:\n \/\/\/ creates an attribute\n XMLAttribute(\n const String &rName, \/\/ attributes name\n const String &rValue \/\/ attributes data\n )\n : String( rName ), sValue( rValue ) {}\n\n \/\/\/ getting value of an attribue\n const String &GetValue() { return sValue; }\n\n void setValue(const String &rValue){sValue=rValue;}\n\n \/\/\/ returns true if two attributes are equal and have the same value\n BOOL IsEqual(\n const XMLAttribute &rAttribute \/\/ the attribute which has to be equal\n )\n {\n return (( rAttribute == *this ) && ( rAttribute.sValue == sValue ));\n }\n};\n\nDECLARE_LIST( XMLAttributeList, XMLAttribute * )\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of XML nodes\n *\/\nclass XMLNode\n{\nprotected:\n XMLNode() {}\n\npublic:\n virtual USHORT GetNodeType() = 0;\n virtual ~XMLNode() {}\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of child nodes\n *\/\nclass XMLChildNode : public XMLNode\n{\nprivate:\n XMLParentNode *pParent;\n\nprotected:\n XMLChildNode( XMLParentNode *pPar );\n XMLChildNode():pParent( NULL ){};\n XMLChildNode( const XMLChildNode& obj);\n XMLChildNode& operator=(const XMLChildNode& obj);\npublic:\n virtual USHORT GetNodeType() = 0;\n\n \/\/\/ returns the parent of this node\n XMLParentNode *GetParent() { return pParent; }\n virtual ~XMLChildNode(){};\n};\n\nDECLARE_LIST( XMLChildNodeList, XMLChildNode * )\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of parent nodes\n *\/\nclass XMLData;\n\nclass XMLParentNode : public XMLChildNode\n{\nprivate:\n XMLChildNodeList *pChildList;\n static int dbgcnt;\n \/\/int nParentPos;\nprotected:\n XMLParentNode( XMLParentNode *pPar )\n : XMLChildNode( pPar ), pChildList( NULL )\n {\n }\n XMLParentNode(): pChildList(NULL){\n }\n \/\/\/ Copyconstructor\n XMLParentNode( const XMLParentNode& );\n\n XMLParentNode& operator=(const XMLParentNode& obj);\n virtual ~XMLParentNode();\n\n\npublic:\n virtual USHORT GetNodeType() = 0;\n\n \/\/\/ returns child list of this node\n XMLChildNodeList *GetChildList() { return pChildList; }\n\n \/\/\/ adds a new child\n void AddChild(\n XMLChildNode *pChild \/\/\/ the new child\n );\n\n void AddChild(\n XMLChildNode *pChild , int pos \/\/\/ the new child\n );\n\n virtual int GetPosition( ByteString id );\n int RemoveChild( XMLElement *pRefElement );\n void RemoveAndDeleteAllChilds();\n\n \/\/\/ returns a child element which matches the given one\n XMLElement *GetChildElement(\n XMLElement *pRefElement \/\/ the reference elelement\n );\n};\n\n\/\/-------------------------------------------------------------------------\n\nDECLARE_LIST( XMLStringList, XMLElement* )\n\n\/\/\/ Mapping numeric Language code <-> XML Element\ntypedef std::hash_map< ByteString ,XMLElement* , hashByteString,equalByteString > LangHashMap;\n\n\/\/\/ Mapping XML Element string identifier <-> Language Map\ntypedef std::hash_map<ByteString , LangHashMap* ,\n hashByteString,equalByteString> XMLHashMap;\n\n\/\/\/ Mapping iso alpha string code <-> iso numeric code\ntypedef std::hash_map<ByteString, int, hashByteString,equalByteString> HashMap;\n\n\/\/\/ Mapping XML tag names <-> have localizable strings\ntypedef std::hash_map<ByteString , BOOL ,\n hashByteString,equalByteString> TagMap;\n\n\/** Holds information of a XML file, is root node of tree\n *\/\n\n\nclass XMLFile : public XMLParentNode\n{\npublic:\n XMLFile() ;\n XMLFile(\n const String &rFileName \/\/ the file name, empty if created from memory stream\n );\n XMLFile( const XMLFile& obj ) ;\n ~XMLFile();\n\n ByteString* GetGroupID(std::deque<ByteString> &groupid);\n void Print( XMLNode *pCur = NULL, USHORT nLevel = 0 );\n virtual void SearchL10NElements( XMLParentNode *pCur, int pos = 0 );\n void Extract( XMLFile *pCur = NULL );\n void View();\n\/\/ void static Signal_handler(int signo);\/\/void*,oslSignalInfo * pInfo);\n void showType(XMLParentNode* node);\n\n XMLHashMap* GetStrings(){return XMLStrings;}\n BOOL Write( ByteString &rFilename );\n BOOL Write( ofstream &rStream , XMLNode *pCur = NULL );\n\n bool CheckExportStatus( XMLParentNode *pCur = NULL );\/\/ , int pos = 0 );\n\n XMLFile& operator=(const XMLFile& obj);\n\n virtual USHORT GetNodeType();\n\n \/\/\/ returns file name\n const String &GetName() { return sFileName; }\n void SetName( const String &rFilename ) { sFileName = rFilename; }\n const std::vector<ByteString> getOrder(){ return order; }\n\nprotected:\n \/\/ writes a string as UTF8 with dos line ends to a given stream\n void WriteString( ofstream &rStream, const String &sString );\n\n \/\/ quotes the given text for writing to a file\n void QuotHTML( String &rString );\n\n void InsertL10NElement( XMLElement* pElement);\n\n \/\/ DATA\n String sFileName;\n\n const ByteString ID,OLDREF,XML_LANG;\n\n TagMap nodes_localize;\n XMLHashMap* XMLStrings;\n\n std::vector <ByteString> order;\n};\n\n\/\/\/ An Utility class for XML\n\/\/\/ See RFC 3066 \/ #i8252# for ISO codes\nclass XMLUtil{\n\npublic:\n \/\/\/ Quot the XML characters and replace \\n \\t\n static void QuotHTML( String &rString );\n\n \/\/\/ UnQuot the XML characters and restore \\n \\t\n static void UnQuotHTML ( String &rString );\n\n \/\/\/ Return the numeric iso language code\n \/\/USHORT GetLangByIsoLang( const ByteString &rIsoLang );\n\n \/\/\/ Return the alpha strings representation\n ByteString GetIsoLangByIndex( USHORT nIndex );\n\n static XMLUtil& Instance();\n ~XMLUtil();\n\n void dump();\n\nprivate:\n \/\/\/ Mapping iso alpha string code <-> iso numeric code\n HashMap lMap;\n\n \/\/\/ Mapping iso numeric code <-> iso alpha string code\n ByteString isoArray[MAX_LANGUAGES];\n\n static void UnQuotData( String &rString );\n static void UnQuotTags( String &rString );\n\n XMLUtil();\n XMLUtil(const XMLUtil&);\n\n};\n\n\n\n\/\/-------------------------------------------------------------------------\n\n\/** Hold information of an element node\n *\/\nclass XMLElement : public XMLParentNode\n{\nprivate:\n String sElementName;\n XMLAttributeList *pAttributes;\n ByteString project,\n filename,\n id,\n sOldRef,\n resourceType,\n languageId;\n int nPos;\n\nprotected:\n void Print(XMLNode *pCur, OUStringBuffer& buffer , bool rootelement);\npublic:\n \/\/\/ create a element node\n XMLElement(){}\n XMLElement(\n const String &rName, \/\/ the element name\n XMLParentNode *Parent \/\/ parent node of this element\n ): XMLParentNode( Parent ),\n sElementName( rName ),\n pAttributes( NULL ),\n project(\"\"),\n filename(\"\"),\n id(\"\"),\n sOldRef(\"\"),\n resourceType(\"\"),\n languageId(\"\"),\n nPos(0)\n {\n }\n ~XMLElement();\n XMLElement(const XMLElement&);\n\n XMLElement& operator=(const XMLElement& obj);\n \/\/\/ returns node type XML_NODE_ELEMENT\n virtual USHORT GetNodeType();\n\n \/\/\/ returns element name\n const String &GetName() { return sElementName; }\n\n \/\/\/ returns list of attributes of this element\n XMLAttributeList *GetAttributeList() { return pAttributes; }\n\n \/\/\/ adds a new attribute to this element, typically used by parser\n void AddAttribute( const String &rAttribute, const String &rValue );\n\n void ChangeLanguageTag( const String &rValue );\n \/\/ Return a ASCII String representation of this object\n OString ToOString();\n\n \/\/ Return a Unicode String representation of this object\n OUString ToOUString();\n\n bool Equals(OUString refStr);\n\n \/\/\/ returns a attribute\n XMLAttribute *GetAttribute(\n const String &rName \/\/ the attribute name\n );\n void SetProject ( ByteString prj ){ project = prj; }\n void SetFileName ( ByteString fn ){ filename = fn; }\n void SetId ( ByteString theId ){ id = theId; }\n void SetResourceType ( ByteString rt ){ resourceType = rt; }\n void SetLanguageId ( ByteString lid ){ languageId = lid; }\n void SetPos ( int nPos_in ){ nPos = nPos_in; }\n void SetOldRef ( ByteString sOldRef_in ){ sOldRef = sOldRef_in; }\n\n virtual int GetPos() { return nPos; }\n ByteString GetProject() { return project; }\n ByteString GetFileName() { return filename; }\n ByteString GetId() { return id; }\n ByteString GetOldref() { return sOldRef; }\n ByteString GetResourceType(){ return resourceType; }\n ByteString GetLanguageId() { return languageId; }\n\n\n};\n\/\/-------------------------------------------------------------------------\n\n\n\/** Holds character data\n *\/\nclass XMLData : public XMLChildNode\n{\nprivate:\n String sData;\n bool isNewCreated;\n\npublic:\n \/\/\/ create a data node\n XMLData(\n const String &rData, \/\/ the initial data\n XMLParentNode *Parent \/\/ the parent node of this data, typically a element node\n )\n : XMLChildNode( Parent ), sData( rData ) , isNewCreated ( false ){}\n XMLData(\n const String &rData, \/\/ the initial data\n XMLParentNode *Parent, \/\/ the parent node of this data, typically a element node\n bool newCreated\n )\n : XMLChildNode( Parent ), sData( rData ) , isNewCreated ( newCreated ){}\n\n XMLData(const XMLData& obj);\n\n XMLData& operator=(const XMLData& obj);\n virtual USHORT GetNodeType();\n\n \/\/\/ returns the data\n const String &GetData() { return sData; }\n\n bool isNew() { return isNewCreated; }\n \/\/\/ adds new character data to the existing one\n void AddData(\n const String &rData \/\/ the new data\n );\n\n\n\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Holds comments\n *\/\nclass XMLComment : public XMLChildNode\n{\nprivate:\n String sComment;\n\npublic:\n \/\/\/ create a comment node\n XMLComment(\n const String &rComment, \/\/ the comment\n XMLParentNode *Parent \/\/ the parent node of this comemnt, typically a element node\n )\n : XMLChildNode( Parent ), sComment( rComment ) {}\n\n virtual USHORT GetNodeType();\n\n XMLComment( const XMLComment& obj );\n\n XMLComment& operator=(const XMLComment& obj);\n\n \/\/\/ returns the comment\n const String &GetComment() { return sComment; }\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Holds additional file content like those for which no handler exists\n *\/\nclass XMLDefault : public XMLChildNode\n{\nprivate:\n String sDefault;\n\npublic:\n \/\/\/ create a comment node\n XMLDefault(\n const String &rDefault, \/\/ the comment\n XMLParentNode *Parent \/\/ the parent node of this comemnt, typically a element node\n )\n : XMLChildNode( Parent ), sDefault( rDefault ) {}\n\n XMLDefault(const XMLDefault& obj);\n\n XMLDefault& operator=(const XMLDefault& obj);\n\n \/\/\/ returns node type XML_NODE_TYPE_COMMENT\n virtual USHORT GetNodeType();\n\n \/\/\/ returns the comment\n const String &GetDefault() { return sDefault; }\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** struct for error information, used by class SimpleXMLParser\n *\/\nstruct XMLError {\n XML_Error eCode; \/\/ the error code\n ULONG nLine; \/\/ error line number\n ULONG nColumn; \/\/ error column number\n String sMessage; \/\/ readable error message\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** validating xml parser, creates a document tree with xml nodes\n *\/\n\n\nclass SimpleXMLParser\n{\nprivate:\n XML_Parser aParser;\n XMLError aErrorInformation;\n\n XMLFile *pXMLFile;\n XMLParentNode *pCurNode;\n XMLData *pCurData;\n\n\n static void StartElementHandler( void *userData, const XML_Char *name, const XML_Char **atts );\n static void EndElementHandler( void *userData, const XML_Char *name );\n static void CharacterDataHandler( void *userData, const XML_Char *s, int len );\n static void CommentHandler( void *userData, const XML_Char *data );\n static void DefaultHandler( void *userData, const XML_Char *s, int len );\n\n\n void StartElement( const XML_Char *name, const XML_Char **atts );\n void EndElement( const XML_Char *name );\n void CharacterData( const XML_Char *s, int len );\n void Comment( const XML_Char *data );\n void Default( const XML_Char *s, int len );\n\n\npublic:\n \/\/\/ creates a new parser\n SimpleXMLParser();\n ~SimpleXMLParser();\n\n \/\/\/ parse a file, returns NULL on criticall errors\n XMLFile *Execute(\n const String &rFileName, \/\/ the file name\n XMLFile *pXMLFileIn \/\/ the XMLFile\n );\n\n \/\/\/ parse a memory stream, returns NULL on criticall errors\n XMLFile *Execute(\n SvMemoryStream *pStream \/\/ the stream\n );\n\n \/\/\/ returns an error struct\n const XMLError &GetError() { return aErrorInformation; }\n};\n\n#endif\n<commit_msg>INTEGRATION: CWS changefileheader (1.13.4); FILE MERGED 2008\/03\/28 15:41:58 rt 1.13.4.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: xmlparse.hxx,v $\n * $Revision: 1.14 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef BOOTSTRP_XMLPARSE_HXX\n#define BOOTSTRP_XMLPARSE_HXX\n\n#include <signal.h>\n#ifdef SYSTEM_EXPAT\n#include <expat.h>\n#else\n#include <external\/expat\/xmlparse.h>\n#endif\n#include <rtl\/ustring.hxx>\n#include <rtl\/ustrbuf.hxx>\n#include \"tools\/string.hxx\"\n#include \"tools\/list.hxx\"\n#define ENABLE_BYTESTRING_STREAM_OPERATORS\n#include \"tools\/stream.hxx\"\n#include \"tools\/isofallback.hxx\"\n#include \"export.hxx\"\n#include \"xmlutil.hxx\"\n\n#include <fstream>\n#include <iostream>\n\nclass XMLParentNode;\nclass XMLElement;\n\n\nusing namespace ::rtl;\nusing namespace std;\n\n#include <hash_map> \/* std::hashmap*\/\n#include <deque> \/* std::deque*\/\n#include <iterator> \/* std::iterator*\/\n#include <list> \/* std::list*\/\n#include <vector> \/* std::vector*\/\n#define XML_NODE_TYPE_FILE 0x001\n#define XML_NODE_TYPE_ELEMENT 0x002\n#define XML_NODE_TYPE_DATA 0x003\n#define XML_NODE_TYPE_COMMENT 0x004\n#define XML_NODE_TYPE_DEFAULT 0x005\n#define MAX_LANGUAGES 99\n\n\n\/\/#define TESTDRIVER \/* use xml2gsi testclass *\/\n\/\/-------------------------------------------------------------------------\n\n\/** Holds data of Attributes\n *\/\nclass XMLAttribute : public String\n{\nprivate:\n String sValue;\n\npublic:\n \/\/\/ creates an attribute\n XMLAttribute(\n const String &rName, \/\/ attributes name\n const String &rValue \/\/ attributes data\n )\n : String( rName ), sValue( rValue ) {}\n\n \/\/\/ getting value of an attribue\n const String &GetValue() { return sValue; }\n\n void setValue(const String &rValue){sValue=rValue;}\n\n \/\/\/ returns true if two attributes are equal and have the same value\n BOOL IsEqual(\n const XMLAttribute &rAttribute \/\/ the attribute which has to be equal\n )\n {\n return (( rAttribute == *this ) && ( rAttribute.sValue == sValue ));\n }\n};\n\nDECLARE_LIST( XMLAttributeList, XMLAttribute * )\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of XML nodes\n *\/\nclass XMLNode\n{\nprotected:\n XMLNode() {}\n\npublic:\n virtual USHORT GetNodeType() = 0;\n virtual ~XMLNode() {}\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of child nodes\n *\/\nclass XMLChildNode : public XMLNode\n{\nprivate:\n XMLParentNode *pParent;\n\nprotected:\n XMLChildNode( XMLParentNode *pPar );\n XMLChildNode():pParent( NULL ){};\n XMLChildNode( const XMLChildNode& obj);\n XMLChildNode& operator=(const XMLChildNode& obj);\npublic:\n virtual USHORT GetNodeType() = 0;\n\n \/\/\/ returns the parent of this node\n XMLParentNode *GetParent() { return pParent; }\n virtual ~XMLChildNode(){};\n};\n\nDECLARE_LIST( XMLChildNodeList, XMLChildNode * )\n\n\/\/-------------------------------------------------------------------------\n\n\/** Virtual base to handle different kinds of parent nodes\n *\/\nclass XMLData;\n\nclass XMLParentNode : public XMLChildNode\n{\nprivate:\n XMLChildNodeList *pChildList;\n static int dbgcnt;\n \/\/int nParentPos;\nprotected:\n XMLParentNode( XMLParentNode *pPar )\n : XMLChildNode( pPar ), pChildList( NULL )\n {\n }\n XMLParentNode(): pChildList(NULL){\n }\n \/\/\/ Copyconstructor\n XMLParentNode( const XMLParentNode& );\n\n XMLParentNode& operator=(const XMLParentNode& obj);\n virtual ~XMLParentNode();\n\n\npublic:\n virtual USHORT GetNodeType() = 0;\n\n \/\/\/ returns child list of this node\n XMLChildNodeList *GetChildList() { return pChildList; }\n\n \/\/\/ adds a new child\n void AddChild(\n XMLChildNode *pChild \/\/\/ the new child\n );\n\n void AddChild(\n XMLChildNode *pChild , int pos \/\/\/ the new child\n );\n\n virtual int GetPosition( ByteString id );\n int RemoveChild( XMLElement *pRefElement );\n void RemoveAndDeleteAllChilds();\n\n \/\/\/ returns a child element which matches the given one\n XMLElement *GetChildElement(\n XMLElement *pRefElement \/\/ the reference elelement\n );\n};\n\n\/\/-------------------------------------------------------------------------\n\nDECLARE_LIST( XMLStringList, XMLElement* )\n\n\/\/\/ Mapping numeric Language code <-> XML Element\ntypedef std::hash_map< ByteString ,XMLElement* , hashByteString,equalByteString > LangHashMap;\n\n\/\/\/ Mapping XML Element string identifier <-> Language Map\ntypedef std::hash_map<ByteString , LangHashMap* ,\n hashByteString,equalByteString> XMLHashMap;\n\n\/\/\/ Mapping iso alpha string code <-> iso numeric code\ntypedef std::hash_map<ByteString, int, hashByteString,equalByteString> HashMap;\n\n\/\/\/ Mapping XML tag names <-> have localizable strings\ntypedef std::hash_map<ByteString , BOOL ,\n hashByteString,equalByteString> TagMap;\n\n\/** Holds information of a XML file, is root node of tree\n *\/\n\n\nclass XMLFile : public XMLParentNode\n{\npublic:\n XMLFile() ;\n XMLFile(\n const String &rFileName \/\/ the file name, empty if created from memory stream\n );\n XMLFile( const XMLFile& obj ) ;\n ~XMLFile();\n\n ByteString* GetGroupID(std::deque<ByteString> &groupid);\n void Print( XMLNode *pCur = NULL, USHORT nLevel = 0 );\n virtual void SearchL10NElements( XMLParentNode *pCur, int pos = 0 );\n void Extract( XMLFile *pCur = NULL );\n void View();\n\/\/ void static Signal_handler(int signo);\/\/void*,oslSignalInfo * pInfo);\n void showType(XMLParentNode* node);\n\n XMLHashMap* GetStrings(){return XMLStrings;}\n BOOL Write( ByteString &rFilename );\n BOOL Write( ofstream &rStream , XMLNode *pCur = NULL );\n\n bool CheckExportStatus( XMLParentNode *pCur = NULL );\/\/ , int pos = 0 );\n\n XMLFile& operator=(const XMLFile& obj);\n\n virtual USHORT GetNodeType();\n\n \/\/\/ returns file name\n const String &GetName() { return sFileName; }\n void SetName( const String &rFilename ) { sFileName = rFilename; }\n const std::vector<ByteString> getOrder(){ return order; }\n\nprotected:\n \/\/ writes a string as UTF8 with dos line ends to a given stream\n void WriteString( ofstream &rStream, const String &sString );\n\n \/\/ quotes the given text for writing to a file\n void QuotHTML( String &rString );\n\n void InsertL10NElement( XMLElement* pElement);\n\n \/\/ DATA\n String sFileName;\n\n const ByteString ID,OLDREF,XML_LANG;\n\n TagMap nodes_localize;\n XMLHashMap* XMLStrings;\n\n std::vector <ByteString> order;\n};\n\n\/\/\/ An Utility class for XML\n\/\/\/ See RFC 3066 \/ #i8252# for ISO codes\nclass XMLUtil{\n\npublic:\n \/\/\/ Quot the XML characters and replace \\n \\t\n static void QuotHTML( String &rString );\n\n \/\/\/ UnQuot the XML characters and restore \\n \\t\n static void UnQuotHTML ( String &rString );\n\n \/\/\/ Return the numeric iso language code\n \/\/USHORT GetLangByIsoLang( const ByteString &rIsoLang );\n\n \/\/\/ Return the alpha strings representation\n ByteString GetIsoLangByIndex( USHORT nIndex );\n\n static XMLUtil& Instance();\n ~XMLUtil();\n\n void dump();\n\nprivate:\n \/\/\/ Mapping iso alpha string code <-> iso numeric code\n HashMap lMap;\n\n \/\/\/ Mapping iso numeric code <-> iso alpha string code\n ByteString isoArray[MAX_LANGUAGES];\n\n static void UnQuotData( String &rString );\n static void UnQuotTags( String &rString );\n\n XMLUtil();\n XMLUtil(const XMLUtil&);\n\n};\n\n\n\n\/\/-------------------------------------------------------------------------\n\n\/** Hold information of an element node\n *\/\nclass XMLElement : public XMLParentNode\n{\nprivate:\n String sElementName;\n XMLAttributeList *pAttributes;\n ByteString project,\n filename,\n id,\n sOldRef,\n resourceType,\n languageId;\n int nPos;\n\nprotected:\n void Print(XMLNode *pCur, OUStringBuffer& buffer , bool rootelement);\npublic:\n \/\/\/ create a element node\n XMLElement(){}\n XMLElement(\n const String &rName, \/\/ the element name\n XMLParentNode *Parent \/\/ parent node of this element\n ): XMLParentNode( Parent ),\n sElementName( rName ),\n pAttributes( NULL ),\n project(\"\"),\n filename(\"\"),\n id(\"\"),\n sOldRef(\"\"),\n resourceType(\"\"),\n languageId(\"\"),\n nPos(0)\n {\n }\n ~XMLElement();\n XMLElement(const XMLElement&);\n\n XMLElement& operator=(const XMLElement& obj);\n \/\/\/ returns node type XML_NODE_ELEMENT\n virtual USHORT GetNodeType();\n\n \/\/\/ returns element name\n const String &GetName() { return sElementName; }\n\n \/\/\/ returns list of attributes of this element\n XMLAttributeList *GetAttributeList() { return pAttributes; }\n\n \/\/\/ adds a new attribute to this element, typically used by parser\n void AddAttribute( const String &rAttribute, const String &rValue );\n\n void ChangeLanguageTag( const String &rValue );\n \/\/ Return a ASCII String representation of this object\n OString ToOString();\n\n \/\/ Return a Unicode String representation of this object\n OUString ToOUString();\n\n bool Equals(OUString refStr);\n\n \/\/\/ returns a attribute\n XMLAttribute *GetAttribute(\n const String &rName \/\/ the attribute name\n );\n void SetProject ( ByteString prj ){ project = prj; }\n void SetFileName ( ByteString fn ){ filename = fn; }\n void SetId ( ByteString theId ){ id = theId; }\n void SetResourceType ( ByteString rt ){ resourceType = rt; }\n void SetLanguageId ( ByteString lid ){ languageId = lid; }\n void SetPos ( int nPos_in ){ nPos = nPos_in; }\n void SetOldRef ( ByteString sOldRef_in ){ sOldRef = sOldRef_in; }\n\n virtual int GetPos() { return nPos; }\n ByteString GetProject() { return project; }\n ByteString GetFileName() { return filename; }\n ByteString GetId() { return id; }\n ByteString GetOldref() { return sOldRef; }\n ByteString GetResourceType(){ return resourceType; }\n ByteString GetLanguageId() { return languageId; }\n\n\n};\n\/\/-------------------------------------------------------------------------\n\n\n\/** Holds character data\n *\/\nclass XMLData : public XMLChildNode\n{\nprivate:\n String sData;\n bool isNewCreated;\n\npublic:\n \/\/\/ create a data node\n XMLData(\n const String &rData, \/\/ the initial data\n XMLParentNode *Parent \/\/ the parent node of this data, typically a element node\n )\n : XMLChildNode( Parent ), sData( rData ) , isNewCreated ( false ){}\n XMLData(\n const String &rData, \/\/ the initial data\n XMLParentNode *Parent, \/\/ the parent node of this data, typically a element node\n bool newCreated\n )\n : XMLChildNode( Parent ), sData( rData ) , isNewCreated ( newCreated ){}\n\n XMLData(const XMLData& obj);\n\n XMLData& operator=(const XMLData& obj);\n virtual USHORT GetNodeType();\n\n \/\/\/ returns the data\n const String &GetData() { return sData; }\n\n bool isNew() { return isNewCreated; }\n \/\/\/ adds new character data to the existing one\n void AddData(\n const String &rData \/\/ the new data\n );\n\n\n\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Holds comments\n *\/\nclass XMLComment : public XMLChildNode\n{\nprivate:\n String sComment;\n\npublic:\n \/\/\/ create a comment node\n XMLComment(\n const String &rComment, \/\/ the comment\n XMLParentNode *Parent \/\/ the parent node of this comemnt, typically a element node\n )\n : XMLChildNode( Parent ), sComment( rComment ) {}\n\n virtual USHORT GetNodeType();\n\n XMLComment( const XMLComment& obj );\n\n XMLComment& operator=(const XMLComment& obj);\n\n \/\/\/ returns the comment\n const String &GetComment() { return sComment; }\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** Holds additional file content like those for which no handler exists\n *\/\nclass XMLDefault : public XMLChildNode\n{\nprivate:\n String sDefault;\n\npublic:\n \/\/\/ create a comment node\n XMLDefault(\n const String &rDefault, \/\/ the comment\n XMLParentNode *Parent \/\/ the parent node of this comemnt, typically a element node\n )\n : XMLChildNode( Parent ), sDefault( rDefault ) {}\n\n XMLDefault(const XMLDefault& obj);\n\n XMLDefault& operator=(const XMLDefault& obj);\n\n \/\/\/ returns node type XML_NODE_TYPE_COMMENT\n virtual USHORT GetNodeType();\n\n \/\/\/ returns the comment\n const String &GetDefault() { return sDefault; }\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** struct for error information, used by class SimpleXMLParser\n *\/\nstruct XMLError {\n XML_Error eCode; \/\/ the error code\n ULONG nLine; \/\/ error line number\n ULONG nColumn; \/\/ error column number\n String sMessage; \/\/ readable error message\n};\n\n\/\/-------------------------------------------------------------------------\n\n\/** validating xml parser, creates a document tree with xml nodes\n *\/\n\n\nclass SimpleXMLParser\n{\nprivate:\n XML_Parser aParser;\n XMLError aErrorInformation;\n\n XMLFile *pXMLFile;\n XMLParentNode *pCurNode;\n XMLData *pCurData;\n\n\n static void StartElementHandler( void *userData, const XML_Char *name, const XML_Char **atts );\n static void EndElementHandler( void *userData, const XML_Char *name );\n static void CharacterDataHandler( void *userData, const XML_Char *s, int len );\n static void CommentHandler( void *userData, const XML_Char *data );\n static void DefaultHandler( void *userData, const XML_Char *s, int len );\n\n\n void StartElement( const XML_Char *name, const XML_Char **atts );\n void EndElement( const XML_Char *name );\n void CharacterData( const XML_Char *s, int len );\n void Comment( const XML_Char *data );\n void Default( const XML_Char *s, int len );\n\n\npublic:\n \/\/\/ creates a new parser\n SimpleXMLParser();\n ~SimpleXMLParser();\n\n \/\/\/ parse a file, returns NULL on criticall errors\n XMLFile *Execute(\n const String &rFileName, \/\/ the file name\n XMLFile *pXMLFileIn \/\/ the XMLFile\n );\n\n \/\/\/ parse a memory stream, returns NULL on criticall errors\n XMLFile *Execute(\n SvMemoryStream *pStream \/\/ the stream\n );\n\n \/\/\/ returns an error struct\n const XMLError &GetError() { return aErrorInformation; }\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#define DEBUG 1\n\/**\n * File : E3.cpp\n * Author : Kazune Takahashi\n * Created : 2019\/9\/2 0:33:07\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"-1\" << endl;\n exit(0);\n}\n\nusing point = tuple<int, int>;\n\npoint make_point(int i, int j)\n{\n if (i > j)\n {\n swap(i, j);\n }\n return point{i, j};\n}\n\nmap<point, int> DP;\nmap<point, vector<point>> V;\nset<point> Y;\n\nint dfs(point p)\n{\n if (DP.find(p) != DP.end())\n {\n return DP[p];\n }\n DP[p] = 0;\n if (Y.find(p) != Y.end())\n {\n No();\n }\n Y.insert(p);\n for (auto e : V[p])\n {\n maxs(DP[p], dfs(e) + 1);\n }\n Y.erase(p);\n return DP[p];\n}\n\nint main()\n{\n int N;\n cin >> N;\n vector<vector<int>> A(N, vector<int>(N - 1));\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N - 1; j++)\n {\n cin >> A[i][j];\n A[i][j]--;\n }\n }\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 1; j < N - 1; j++)\n {\n point from{make_point(i, A[i][j - 1])};\n point to{make_point(i, A[i][j - 1])};\n V[to].push_back(from);\n }\n }\n for (auto i = 0; i < N; i++)\n {\n for (auto j = i + 1; j < N; j++)\n {\n dfs(point{i, j});\n }\n }\n int ans{0};\n for (auto e : DP)\n {\n maxs(ans, e.second);\n }\n cout << ans << endl;\n}<commit_msg>tried E3.cpp to 'E'<commit_after>#define DEBUG 1\n\/**\n * File : E3.cpp\n * Author : Kazune Takahashi\n * Created : 2019\/9\/2 0:33:07\n * Powered by Visual Studio Code\n *\/\n#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <complex>\n#include <tuple>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <functional>\n#include <random>\n#include <chrono>\n#include <cctype>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\nusing namespace std;\n#define maxs(x, y) (x = max(x, y))\n#define mins(x, y) (x = min(x, y))\nusing ll = long long;\nclass mint\n{\npublic:\n static ll MOD;\n ll x;\n mint() : x(0) {}\n mint(ll x) : x(x % MOD) {}\n mint operator-() const { return x ? MOD - x : 0; }\n mint &operator+=(const mint &a)\n {\n if ((x += a.x) >= MOD)\n {\n x -= MOD;\n }\n return *this;\n }\n mint &operator-=(const mint &a) { return *this += -a; }\n mint &operator*=(const mint &a)\n {\n (x *= a.x) %= MOD;\n return *this;\n }\n mint &operator\/=(const mint &a)\n {\n mint b{a};\n return *this *= b.power(MOD - 2);\n }\n mint operator+(const mint &a) const { return mint(*this) += a; }\n mint operator-(const mint &a) const { return mint(*this) -= a; }\n mint operator*(const mint &a) const { return mint(*this) *= a; }\n mint operator\/(const mint &a) const { return mint(*this) \/= a; }\n bool operator<(const mint &a) const { return x < a.x; }\n bool operator==(const mint &a) const { return x == a.x; }\n const mint power(ll N)\n {\n if (N == 0)\n {\n return 1;\n }\n else if (N % 2 == 1)\n {\n return *this * power(N - 1);\n }\n else\n {\n mint half = power(N \/ 2);\n return half * half;\n }\n }\n};\nll mint::MOD = 1e9 + 7;\nistream &operator>>(istream &stream, mint &a) { return stream >> a.x; }\nostream &operator<<(ostream &stream, const mint &a) { return stream << a.x; }\nclass combination\n{\npublic:\n vector<mint> inv, fact, factinv;\n static int MAX_SIZE;\n combination() : inv(MAX_SIZE), fact(MAX_SIZE), factinv(MAX_SIZE)\n {\n inv[1] = 1;\n for (auto i = 2; i < MAX_SIZE; i++)\n {\n inv[i] = (-inv[mint::MOD % i]) * (mint::MOD \/ i);\n }\n fact[0] = factinv[0] = 1;\n for (auto i = 1; i < MAX_SIZE; i++)\n {\n fact[i] = mint(i) * fact[i - 1];\n factinv[i] = inv[i] * factinv[i - 1];\n }\n }\n mint operator()(int n, int k)\n {\n if (n >= 0 && k >= 0 && n - k >= 0)\n {\n return fact[n] * factinv[k] * factinv[n - k];\n }\n return 0;\n }\n};\nint combination::MAX_SIZE = 3000010;\nll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }\n\/\/ constexpr double epsilon = 1e-10;\n\/\/ constexpr ll infty = 1000000000000000LL;\n\/\/ constexpr int dx[4] = {1, 0, -1, 0};\n\/\/ constexpr int dy[4] = {0, 1, 0, -1};\nvoid Yes()\n{\n cout << \"Yes\" << endl;\n exit(0);\n}\nvoid No()\n{\n cout << \"-1\" << endl;\n exit(0);\n}\n\nusing point = tuple<int, int>;\n\nostream &operator<<(ostream &os, point p)\n{\n return os << \"{\" << get<0>(p) << \", \" << get<1>(p) << \"}\";\n}\n\npoint make_point(int i, int j)\n{\n if (i > j)\n {\n swap(i, j);\n }\n return point{i, j};\n}\n\nmap<point, int> DP;\nmap<point, vector<point>> V;\nset<point> Y;\n\nint dfs(point p)\n{\n#if DEBUG == 1\n cerr << \"p = \" << p << endl;\n#endif\n if (DP.find(p) != DP.end())\n {\n return DP[p];\n }\n DP[p] = 0;\n if (Y.find(p) != Y.end())\n {\n No();\n }\n Y.insert(p);\n for (auto e : V[p])\n {\n maxs(DP[p], dfs(e) + 1);\n }\n Y.erase(p);\n return DP[p];\n}\n\nint main()\n{\n int N;\n cin >> N;\n vector<vector<int>> A(N, vector<int>(N - 1));\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 0; j < N - 1; j++)\n {\n cin >> A[i][j];\n A[i][j]--;\n }\n }\n for (auto i = 0; i < N; i++)\n {\n for (auto j = 1; j < N - 1; j++)\n {\n point from{make_point(i, A[i][j - 1])};\n point to{make_point(i, A[i][j - 1])};\n V[to].push_back(from);\n }\n }\n for (auto i = 0; i < N; i++)\n {\n for (auto j = i + 1; j < N; j++)\n {\n dfs(point{i, j});\n }\n }\n int ans{0};\n for (auto e : DP)\n {\n maxs(ans, e.second);\n }\n cout << ans << endl;\n}<|endoftext|>"} {"text":"<commit_before>#include \"AudioProcessor.h\"\n\n#include \"AudioDevice.h\"\n\n#include <QAudioOutput>\n\nextern \"C\" {\n#include \"gba-thread.h\"\n}\n\nusing namespace QGBA;\n\nAudioProcessor::AudioProcessor(QObject* parent)\n\t: QObject(parent)\n\t, m_audioOutput(nullptr)\n\t, m_device(nullptr)\n{\n}\n\nvoid AudioProcessor::setInput(GBAThread* input) {\n\tm_context = input;\n\tif (m_device) {\n\t\tm_device->setInput(input);\n\t\tif (m_audioOutput) {\n\t\t\tm_device->setFormat(m_audioOutput->format());\n\t\t}\n\t}\n}\n\nvoid AudioProcessor::start() {\n\tif (!m_device) {\n\t\tm_device = new AudioDevice(this);\n\t}\n\n\tif (!m_audioOutput) {\n\t\tQAudioFormat format;\n\t\tformat.setSampleRate(44100);\n\t\tformat.setChannelCount(2);\n\t\tformat.setSampleSize(16);\n\t\tformat.setCodec(\"audio\/pcm\");\n\t\tformat.setByteOrder(QAudioFormat::LittleEndian);\n\t\tformat.setSampleType(QAudioFormat::SignedInt);\n\n\t\tm_audioOutput = new QAudioOutput(format, this);\n\t}\n\n\tm_device->setInput(m_context);\n\tm_device->setFormat(m_audioOutput->format());\n\tm_audioOutput->setBufferSize(m_context->audioBuffers * 4);\n\n\tm_audioOutput->start(m_device);\n}\n\nvoid AudioProcessor::pause() {\n\tm_audioOutput->stop();\n}\n\nvoid AudioProcessor::setBufferSamples(int samples) {\n\tQAudioFormat format = m_audioOutput->format();\n\tm_audioOutput->setBufferSize(samples * format.channelCount() * format.sampleSize() \/ 8);\n}\n<commit_msg>Only try to stop audio output if there is an audio output device<commit_after>#include \"AudioProcessor.h\"\n\n#include \"AudioDevice.h\"\n\n#include <QAudioOutput>\n\nextern \"C\" {\n#include \"gba-thread.h\"\n}\n\nusing namespace QGBA;\n\nAudioProcessor::AudioProcessor(QObject* parent)\n\t: QObject(parent)\n\t, m_audioOutput(nullptr)\n\t, m_device(nullptr)\n{\n}\n\nvoid AudioProcessor::setInput(GBAThread* input) {\n\tm_context = input;\n\tif (m_device) {\n\t\tm_device->setInput(input);\n\t\tif (m_audioOutput) {\n\t\t\tm_device->setFormat(m_audioOutput->format());\n\t\t}\n\t}\n}\n\nvoid AudioProcessor::start() {\n\tif (!m_device) {\n\t\tm_device = new AudioDevice(this);\n\t}\n\n\tif (!m_audioOutput) {\n\t\tQAudioFormat format;\n\t\tformat.setSampleRate(44100);\n\t\tformat.setChannelCount(2);\n\t\tformat.setSampleSize(16);\n\t\tformat.setCodec(\"audio\/pcm\");\n\t\tformat.setByteOrder(QAudioFormat::LittleEndian);\n\t\tformat.setSampleType(QAudioFormat::SignedInt);\n\n\t\tm_audioOutput = new QAudioOutput(format, this);\n\t}\n\n\tm_device->setInput(m_context);\n\tm_device->setFormat(m_audioOutput->format());\n\tm_audioOutput->setBufferSize(m_context->audioBuffers * 4);\n\n\tm_audioOutput->start(m_device);\n}\n\nvoid AudioProcessor::pause() {\n\tif (m_audioOutput) {\n\t\tm_audioOutput->stop();\n\t}\n}\n\nvoid AudioProcessor::setBufferSamples(int samples) {\n\tQAudioFormat format = m_audioOutput->format();\n\tm_audioOutput->setBufferSize(samples * format.channelCount() * format.sampleSize() \/ 8);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n#include <cstring>\n#include <limits>\n#include <memory>\n\n#include <android\/log.h>\n\n#include <boost\/format.hpp>\n#include <boost\/utility.hpp>\n\n#include <tbb\/blocked_range2d.h>\n#include <tbb\/parallel_for.h>\n#include <tbb\/task_scheduler_init.h>\n\n#include \"body_parts_recognizer.h\"\n#include \"rgbd_image.h\"\n#include \"sources.h\"\n#include \"stopwatch.h\"\n\nconst Depth BACKGROUND_DEPTH = std::numeric_limits<Depth>::max();\n\nstruct DepthImage\n{\nprivate:\n\n unsigned width, height;\n std::vector<Depth> depths;\n\npublic:\n\n DepthImage(const RGBDImage & image)\n : width(image.width), height(image.height), depths(width * height)\n {\n for (std::size_t i = 0; i < depths.size(); ++i)\n depths[i] = image.pixels[i].d == 0 ? BACKGROUND_DEPTH : image.pixels[i].d; \/\/ we consider 0 to be invalid depth\n }\n\n void\n applyThreshold(int threshold)\n {\n Depth min_depth = *std::min_element(depths.begin (), depths.end ());\n\n for (std::size_t i = 0; i < depths.size (); ++i)\n depths[i] = depths[i] <= min_depth + threshold ? depths[i] : BACKGROUND_DEPTH;\n }\n\n Depth\n getDepth(int x, int y) const\n {\n if (x < 0 || x >= int (width) || y < 0 || y >= int (height))\n return BACKGROUND_DEPTH;\n\n return depths[x + width * y];\n }\n\n unsigned getWidth() const { return width; }\n unsigned getHeight() const { return height; }\n};\n\nstruct DecisionTreeCPU\n{\n tbb::task_scheduler_init tbb_init;\n\n struct Offsets\n {\n boost::int16_t du1, dv1, du2, dv2;\n };\n\n struct Node\n {\n Offsets offsets;\n boost::int16_t threshold;\n };\n\n boost::uint16_t depth;\n std::vector<Node> nodes;\n std::vector<Label> leaves;\n\n DecisionTreeCPU(const char * data)\n {\n std::memcpy (&depth, data, sizeof depth);\n data += sizeof depth;\n\n nodes.resize ((1 << depth) - 1);\n std::memcpy (&nodes.front (), data, nodes.size () * sizeof (Node));\n data += nodes.size () * sizeof (Node);\n\n leaves.resize (1 << depth);\n std::memcpy (&leaves.front (), data, leaves.size () * sizeof (Label));\n data += leaves.size () * sizeof (Label);\n }\n\n Label\n walk(const DepthImage & image, int x, int y) const\n {\n unsigned nid = 0;\n Depth d0 = image.getDepth(x, y);\n float scale = 1000.0f \/ d0;\n\n for(int node_depth = 0; node_depth < depth; ++node_depth)\n {\n const Node & node = nodes[nid];\n\n Depth d1 = image.getDepth (x + node.offsets.du1 * scale, y + node.offsets.dv1 * scale);\n Depth d2 = image.getDepth (x + node.offsets.du2 * scale, y + node.offsets.dv2 * scale);\n\n int feature = int (d1) - int (d2);\n\n if (feature > node.threshold)\n nid = nid * 2 + 2;\n else\n nid = nid * 2 + 1;\n }\n\n return leaves[nid - nodes.size()];\n }\n\n struct WalkHelper\n {\n private:\n const DecisionTreeCPU & tree;\n const DepthImage & image;\n std::vector<Label> & labels;\n\n public:\n WalkHelper(const DecisionTreeCPU & tree, const DepthImage & image, std::vector<Label> & labels)\n : tree(tree), image(image), labels(labels)\n {\n }\n\n void\n operator () (const tbb::blocked_range2d<unsigned> & range) const\n {\n for (unsigned y = range.rows().begin(); y < range.rows().end(); ++y)\n for (unsigned x = range.cols().begin(); x < range.cols().end(); ++x)\n labels[x + y * image.getWidth()] = image.getDepth(x, y) == BACKGROUND_DEPTH ?\n Labels::Background : tree.walk(image, x, y);\n }\n };\n\n void\n eval(const DepthImage & image, std::vector<Label> & labels) const\n {\n tbb::parallel_for(\n tbb::blocked_range2d<unsigned>(0, image.getHeight(), 0, image.getWidth()),\n WalkHelper(*this, image, labels)\n );\n }\n};\n\nint maxElementNoTie(int num, unsigned * elements)\n{\n int max_element = 0;\n unsigned max = elements[max_element];\n\n for (int i = 1; i < num; ++i)\n {\n unsigned val = elements[i];\n if (max < val) { max_element = i; max = val; }\n else if (max == val) { max_element = -1; }\n }\n\n return max_element;\n}\n\nstruct ConsensusHelper\n{\nprivate:\n const std::vector<std::vector<Label> > & multi_labels;\n std::vector<Label> & labels;\n const DepthImage & depth_image;\n\npublic:\n ConsensusHelper(\n const std::vector<std::vector<Label> > & multi_labels,\n std::vector<Label> & labels,\n const DepthImage & depth_image\n )\n : multi_labels(multi_labels), labels(labels), depth_image(depth_image)\n {\n }\n\n void operator ()(const tbb::blocked_range2d<unsigned> & range) const\n {\n for (unsigned y = range.rows().begin(); y < range.rows().end(); ++y)\n for (unsigned x = range.cols().begin(); x < range.cols().end(); ++x)\n {\n std::size_t i = x + y * depth_image.getWidth();\n\n bool background = true;\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n if (multi_labels[ti][i] != Labels::Background) background = false;\n\n if (background)\n {\n labels[i] = Labels::Background;\n continue;\n }\n\n unsigned bins[Labels::NUM_LABELS] = { 0 };\n\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n ++bins[multi_labels[ti][i]];\n\n int consensus = maxElementNoTie(Labels::NUM_LABELS, bins);\n\n if (consensus == -1)\n {\n std::fill (bins, bins + Labels::NUM_LABELS, 0);\n Depth d = depth_image.getDepth (x, y);\n\n for (int off_x = -1; off_x <= 1; ++off_x)\n for (int off_y = -1; off_y <= 1; ++off_y)\n {\n Depth off_d = depth_image.getDepth (x + off_x, y + off_y);\n\n if (std::abs (d - off_d) < 50)\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n ++bins[multi_labels[ti][i]];\n }\n\n labels[i] = std::max_element (bins, bins + Labels::NUM_LABELS) - bins;\n }\n else\n {\n labels[i] = consensus;\n }\n }\n }\n};\n\nBodyPartsRecognizer::BodyPartsRecognizer(std::size_t num_trees, const char * trees[])\n{\n this->trees.resize(num_trees);\n\n for (std::size_t i = 0; i < num_trees; ++i)\n this->trees[i].reset(new Tree(trees[i]));\n\n#if GPU_CONSENSUS\n this->consensus_finder.reset(new ConsensusFinderGPU(num_trees));\n#endif\n}\n\nvoid\nBodyPartsRecognizer::recognize(const RGBDImage & image, std::vector<Label> & labels)\n{\n labels.clear ();\n labels.resize (image.width * image.height);\n\n DepthImage depth_image (image);\n\n Stopwatch watch_threshold;\n\n depth_image.applyThreshold (500);\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Thresholding: %d ms\", watch_threshold.elapsedMs());\n\n std::vector<std::vector<Label> > multi_labels (trees.size ());\n\n for (std::size_t ti = 0; ti < trees.size (); ++ti)\n {\n Stopwatch watch_evaluation;\n\n multi_labels[ti].resize (labels.size ());\n trees[ti]->eval (depth_image, multi_labels[ti]);\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Evaluating tree %d: %d ms\", ti, watch_evaluation.elapsedMs());\n }\n\n Stopwatch watch_consensus;\n\n tbb::parallel_for(\n tbb::blocked_range2d<unsigned>(0, depth_image.getHeight(), 0, depth_image.getWidth()),\n ConsensusHelper(multi_labels, labels, depth_image)\n );\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Finding consensus: %d ms\", watch_consensus.elapsedMs());\n}\n<commit_msg>Implemented a simple mode-based filter for labels.<commit_after>#include <algorithm>\n#include <cstring>\n#include <limits>\n#include <memory>\n\n#include <android\/log.h>\n\n#include <boost\/format.hpp>\n#include <boost\/utility.hpp>\n\n#include <tbb\/blocked_range2d.h>\n#include <tbb\/parallel_for.h>\n#include <tbb\/task_scheduler_init.h>\n\n#include \"body_parts_recognizer.h\"\n#include \"rgbd_image.h\"\n#include \"sources.h\"\n#include \"stopwatch.h\"\n\nconst Depth BACKGROUND_DEPTH = std::numeric_limits<Depth>::max();\n\nstruct DepthImage\n{\nprivate:\n\n unsigned width, height;\n std::vector<Depth> depths;\n\npublic:\n\n DepthImage(const RGBDImage & image)\n : width(image.width), height(image.height), depths(width * height)\n {\n for (std::size_t i = 0; i < depths.size(); ++i)\n depths[i] = image.pixels[i].d == 0 ? BACKGROUND_DEPTH : image.pixels[i].d; \/\/ we consider 0 to be invalid depth\n }\n\n void\n applyThreshold(int threshold)\n {\n Depth min_depth = *std::min_element(depths.begin (), depths.end ());\n\n for (std::size_t i = 0; i < depths.size (); ++i)\n depths[i] = depths[i] <= min_depth + threshold ? depths[i] : BACKGROUND_DEPTH;\n }\n\n Depth\n getDepth(int x, int y) const\n {\n if (x < 0 || x >= int (width) || y < 0 || y >= int (height))\n return BACKGROUND_DEPTH;\n\n return depths[x + width * y];\n }\n\n unsigned getWidth() const { return width; }\n unsigned getHeight() const { return height; }\n};\n\nstruct DecisionTreeCPU\n{\n tbb::task_scheduler_init tbb_init;\n\n struct Offsets\n {\n boost::int16_t du1, dv1, du2, dv2;\n };\n\n struct Node\n {\n Offsets offsets;\n boost::int16_t threshold;\n };\n\n boost::uint16_t depth;\n std::vector<Node> nodes;\n std::vector<Label> leaves;\n\n DecisionTreeCPU(const char * data)\n {\n std::memcpy (&depth, data, sizeof depth);\n data += sizeof depth;\n\n nodes.resize ((1 << depth) - 1);\n std::memcpy (&nodes.front (), data, nodes.size () * sizeof (Node));\n data += nodes.size () * sizeof (Node);\n\n leaves.resize (1 << depth);\n std::memcpy (&leaves.front (), data, leaves.size () * sizeof (Label));\n data += leaves.size () * sizeof (Label);\n }\n\n Label\n walk(const DepthImage & image, int x, int y) const\n {\n unsigned nid = 0;\n Depth d0 = image.getDepth(x, y);\n float scale = 1000.0f \/ d0;\n\n for(int node_depth = 0; node_depth < depth; ++node_depth)\n {\n const Node & node = nodes[nid];\n\n Depth d1 = image.getDepth (x + node.offsets.du1 * scale, y + node.offsets.dv1 * scale);\n Depth d2 = image.getDepth (x + node.offsets.du2 * scale, y + node.offsets.dv2 * scale);\n\n int feature = int (d1) - int (d2);\n\n if (feature > node.threshold)\n nid = nid * 2 + 2;\n else\n nid = nid * 2 + 1;\n }\n\n return leaves[nid - nodes.size()];\n }\n\n struct WalkHelper\n {\n private:\n const DecisionTreeCPU & tree;\n const DepthImage & image;\n std::vector<Label> & labels;\n\n public:\n WalkHelper(const DecisionTreeCPU & tree, const DepthImage & image, std::vector<Label> & labels)\n : tree(tree), image(image), labels(labels)\n {\n }\n\n void\n operator () (const tbb::blocked_range2d<unsigned> & range) const\n {\n for (unsigned y = range.rows().begin(); y < range.rows().end(); ++y)\n for (unsigned x = range.cols().begin(); x < range.cols().end(); ++x)\n labels[x + y * image.getWidth()] = image.getDepth(x, y) == BACKGROUND_DEPTH ?\n Labels::Background : tree.walk(image, x, y);\n }\n };\n\n void\n eval(const DepthImage & image, std::vector<Label> & labels) const\n {\n tbb::parallel_for(\n tbb::blocked_range2d<unsigned>(0, image.getHeight(), 0, image.getWidth()),\n WalkHelper(*this, image, labels)\n );\n }\n};\n\nint maxElementNoTie(int num, unsigned * elements)\n{\n int max_element = 0;\n unsigned max = elements[max_element];\n\n for (int i = 1; i < num; ++i)\n {\n unsigned val = elements[i];\n if (max < val) { max_element = i; max = val; }\n else if (max == val) { max_element = -1; }\n }\n\n return max_element;\n}\n\nvoid filterLabels(unsigned width, unsigned height, const std::vector<Label> & noisyLabels, std::vector<Label> & labels, int radius)\n{\n for (unsigned j = 0; j < width; ++j)\n for (unsigned i = 0; i < height; ++i)\n {\n unsigned idx = i * width + j;\n\n if (i < radius || i >= height - radius || j < radius || j >= width - radius || noisyLabels[idx] == Labels::Background)\n {\n labels[idx] = Labels::Background;\n continue;\n }\n\n int bins[Labels::NUM_LABELS] = { 0 };\n Label mode = -1;\n Label mode_count = 0;\n\n for (int dx = -radius; dx <= radius; ++dx)\n for (int dy = -radius; dy <= radius; ++dy)\n {\n Label current = noisyLabels[idx + dx + dy * width];\n ++bins[current];\n if (bins[current] > mode_count) {\n mode_count = bins[current];\n mode = current;\n }\n }\n\n labels[idx] = mode;\n }\n}\n\nstruct ConsensusHelper\n{\nprivate:\n const std::vector<std::vector<Label> > & multi_labels;\n std::vector<Label> & labels;\n const DepthImage & depth_image;\n\npublic:\n ConsensusHelper(\n const std::vector<std::vector<Label> > & multi_labels,\n std::vector<Label> & labels,\n const DepthImage & depth_image\n )\n : multi_labels(multi_labels), labels(labels), depth_image(depth_image)\n {\n }\n\n void operator ()(const tbb::blocked_range2d<unsigned> & range) const\n {\n for (unsigned y = range.rows().begin(); y < range.rows().end(); ++y)\n for (unsigned x = range.cols().begin(); x < range.cols().end(); ++x)\n {\n std::size_t i = x + y * depth_image.getWidth();\n\n bool background = true;\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n if (multi_labels[ti][i] != Labels::Background) background = false;\n\n if (background)\n {\n labels[i] = Labels::Background;\n continue;\n }\n\n unsigned bins[Labels::NUM_LABELS] = { 0 };\n\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n ++bins[multi_labels[ti][i]];\n\n int consensus = maxElementNoTie(Labels::NUM_LABELS, bins);\n\n if (consensus == -1)\n {\n std::fill (bins, bins + Labels::NUM_LABELS, 0);\n Depth d = depth_image.getDepth (x, y);\n\n for (int off_x = -1; off_x <= 1; ++off_x)\n for (int off_y = -1; off_y <= 1; ++off_y)\n {\n Depth off_d = depth_image.getDepth (x + off_x, y + off_y);\n\n if (std::abs (d - off_d) < 50)\n for (std::size_t ti = 0; ti < multi_labels.size (); ++ti)\n ++bins[multi_labels[ti][i]];\n }\n\n labels[i] = std::max_element (bins, bins + Labels::NUM_LABELS) - bins;\n }\n else\n {\n labels[i] = consensus;\n }\n }\n }\n};\n\nBodyPartsRecognizer::BodyPartsRecognizer(std::size_t num_trees, const char * trees[])\n{\n this->trees.resize(num_trees);\n\n for (std::size_t i = 0; i < num_trees; ++i)\n this->trees[i].reset(new Tree(trees[i]));\n\n#if GPU_CONSENSUS\n this->consensus_finder.reset(new ConsensusFinderGPU(num_trees));\n#endif\n}\n\nvoid\nBodyPartsRecognizer::recognize(const RGBDImage & image, std::vector<Label> & labels)\n{\n labels.clear ();\n labels.resize (image.width * image.height);\n\n DepthImage depth_image (image);\n\n Stopwatch watch_threshold;\n\n depth_image.applyThreshold (500);\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Thresholding: %d ms\", watch_threshold.elapsedMs());\n\n std::vector<std::vector<Label> > multi_labels (trees.size ());\n\n for (std::size_t ti = 0; ti < trees.size (); ++ti)\n {\n Stopwatch watch_evaluation;\n\n multi_labels[ti].resize (labels.size ());\n trees[ti]->eval (depth_image, multi_labels[ti]);\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Evaluating tree %d: %d ms\", ti, watch_evaluation.elapsedMs());\n }\n\n Stopwatch watch_consensus;\n\n std::vector<Label> noisy_labels (labels.size ());\n\n tbb::parallel_for(\n tbb::blocked_range2d<unsigned>(0, depth_image.getHeight(), 0, depth_image.getWidth()),\n ConsensusHelper(multi_labels, noisy_labels, depth_image)\n );\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Finding consensus: %d ms\", watch_consensus.elapsedMs());\n\n Stopwatch watch_filtering;\n\n filterLabels(depth_image.getWidth(), depth_image.getHeight(), noisy_labels, labels, 2);\n\n __android_log_print(ANDROID_LOG_INFO, \"BPR\", \"Filtering labels: %d ms\", watch_consensus.elapsedMs());\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2009 Soeren Sonnenburg\n * Copyright (C) 2009 Fraunhofer Institute FIRST and Max-Planck-Society\n *\/\n\n#include \"features\/ImplicitWeightedSpecFeatures.h\"\n#include \"lib\/io.h\"\n\nCImplicitWeightedSpecFeatures::CImplicitWeightedSpecFeatures(CStringFeatures<uint16_t>* str, bool normalize) : CDotFeatures()\n{\n\tASSERT(str);\n\tSG_REF(strings)\n\tstrings=str;\n\tnormalization_factors=NULL;\n\tspec_weights=NULL;\n\tnum_strings = str->get_num_vectors();\n\talphabet_size = str->get_original_num_symbols();\n\tdegree=str->get_order();\n\tset_wd_weights();\n\n\tSG_DEBUG(\"WEIGHTED SPEC alphasz=%d, size=%d, num_str=%d\\n\", alphabet_size,\n\t\t\tspec_size, num_strings);\n\n\tif (normalize)\n\t\tcompute_normalization_const();\n}\n\nvoid CImplicitWeightedSpecFeatures::compute_normalization_const()\n{\n\tfloat64_t* factors=new float64_t[num_strings];\n\n\tfor (int32_t i=0; i<num_strings; i++)\n\t\tfactors[i]=1.0\/CMath::sqrt(dot(i,i));\n\n\tnormalization_factors=factors;\n\t\/\/CMath::display_vector(normalization_factors, num_strings, \"n\");\n}\n\nbool CImplicitWeightedSpecFeatures::set_wd_weights()\n{\n\tdelete[] spec_weights;\n\tspec_weights=new float64_t[degree];\n\n\tint32_t i;\n\tfloat64_t sum=0;\n\tspec_size=0;\n\n\tfor (i=0; i<degree; i++)\n\t{\n\t\tspec_size+=CMath::pow(alphabet_size, i+1);\n\t\tspec_weights[i]=degree-i;\n\t\tsum+=spec_weights[i];\n\t}\n\tfor (i=0; i<degree; i++)\n\t\tspec_weights[i]=CMath::sqrt(spec_weights[i]\/sum);\n\n\treturn spec_weights!=NULL;\n}\n\nbool CImplicitWeightedSpecFeatures::set_weights(float64_t* w, int32_t d)\n{\n\tASSERT(d==degree);\n\n\tdelete[] spec_weights;\n\tspec_weights=new float64_t[degree];\n\tfor (int32_t i=0; i<degree; i++)\n\t\tspec_weights[i]=CMath::sqrt(w[i]);\n\treturn true;\n}\n\nCImplicitWeightedSpecFeatures::CImplicitWeightedSpecFeatures(const CImplicitWeightedSpecFeatures& orig) : CDotFeatures(orig), \n\tnum_strings(orig.num_strings), \n\talphabet_size(orig.alphabet_size), spec_size(orig.spec_size)\n{\n\tSG_NOTIMPLEMENTED;\n\tSG_REF(strings);\n}\n\nCImplicitWeightedSpecFeatures::~CImplicitWeightedSpecFeatures()\n{\n\tSG_UNREF(strings);\n\tdelete[] spec_weights;\n\tdelete[] normalization_factors;\n}\n\nfloat64_t CImplicitWeightedSpecFeatures::dot(int32_t vec_idx1, int32_t vec_idx2)\n{\n\tASSERT(vec_idx1 < num_strings);\n\tASSERT(vec_idx2 < num_strings);\n\n\tint32_t len1=-1;\n\tint32_t len2=-1;\n\tuint16_t* vec1=strings->get_feature_vector(vec_idx1, len1);\n\tuint16_t* vec2=strings->get_feature_vector(vec_idx2, len2);\n\n\tfloat64_t result=0;\n\tuint8_t mask=0;\n\n\tfor (int32_t d=0; d<degree; d++)\n\t{\n\t\tmask = mask | (1 << (degree-d-1));\n\t\tuint16_t masked=strings->get_masked_symbols(0xffff, mask);\n\n\t\tint32_t left_idx=0;\n\t\tint32_t right_idx=0;\n\t\tfloat64_t weight=spec_weights[d]*spec_weights[d];\n\n\t\twhile (left_idx < len1 && right_idx < len2)\n\t\t{\n\t\t\tuint16_t lsym=vec1[left_idx] & masked;\n\t\t\tuint16_t rsym=vec2[right_idx] & masked;\n\n\t\t\tif (lsym == rsym)\n\t\t\t{\n\t\t\t\tint32_t old_left_idx=left_idx;\n\t\t\t\tint32_t old_right_idx=right_idx;\n\n\t\t\t\twhile (left_idx<len1 && (vec1[left_idx] & masked) ==lsym)\n\t\t\t\t\tleft_idx++;\n\n\t\t\t\twhile (right_idx<len2 && (vec2[right_idx] & masked) ==lsym)\n\t\t\t\t\tright_idx++;\n\n\t\t\t\tresult+=weight*(left_idx-old_left_idx)*(right_idx-old_right_idx);\n\t\t\t}\n\t\t\telse if (lsym<rsym)\n\t\t\t\tleft_idx++;\n\t\t\telse\n\t\t\t\tright_idx++;\n\t\t}\n\t}\n\n\tif (normalization_factors)\n\t\treturn result*normalization_factors[vec_idx1]*normalization_factors[vec_idx2];\n\telse\n\t\treturn result;\n}\n\nfloat64_t CImplicitWeightedSpecFeatures::dense_dot(int32_t vec_idx1, const float64_t* vec2, int32_t vec2_len)\n{\n\tASSERT(vec2_len == spec_size);\n\tASSERT(vec_idx1 < num_strings);\n\n\tfloat64_t result=0;\n\tint32_t len1=-1;\n\tuint16_t* vec1=strings->get_feature_vector(vec_idx1, len1);\n\n\tif (vec1 && len1>0)\n\t{\n\t\tfor (int32_t j=0; j<len1; j++)\n\t\t{\n\t\t\tuint8_t mask=0;\n\t\t\tint32_t offs=0;\n\t\t\tuint16_t v=*vec1++;\n\n\t\t\tfor (int32_t d=0; d<degree; d++)\n\t\t\t{\n\t\t\t\tmask = mask | (1 << (degree-d-1));\n\t\t\t\tint32_t idx=strings->get_masked_symbols(v, mask);\n\t\t\t\tidx=strings->shift_symbol(idx, degree-d-1);\n\t\t\t\tresult += vec2[offs + idx]*spec_weights[d];\n\t\t\t\toffs+=strings->shift_offset(1,d+1);\n\t\t\t}\n\t\t}\n\n\t\tif (normalization_factors)\n\t\t\tresult*=normalization_factors[vec_idx1];\n\t}\n\telse\n\t\tSG_ERROR(\"huh?\\n\");\n\n\treturn result;\n}\n\nvoid CImplicitWeightedSpecFeatures::add_to_dense_vec(float64_t alpha, int32_t vec_idx1, float64_t* vec2, int32_t vec2_len, bool abs_val)\n{\n\tint32_t len1=-1;\n\tuint16_t* vec=strings->get_feature_vector(vec_idx1, len1);\n\n\tif (normalization_factors)\n\t\talpha*=normalization_factors[vec_idx1];\n\n\tif (vec && len1>0)\n\t{\n\t\tfor (int32_t j=0; j<len1; j++)\n\t\t{\n\t\t\tuint8_t mask=0;\n\t\t\tint32_t offs=0;\n\t\t\tfor (int32_t d=0; d<degree; d++)\n\t\t\t{\n\t\t\t\tmask = mask | (1 << (degree-d-1));\n\t\t\t\tint32_t idx=strings->get_masked_symbols(vec[j], mask);\n\t\t\t\tidx=strings->shift_symbol(idx, degree-d-1);\n\t\t\t\tif (abs_val)\n\t\t\t\t\tvec2[offs + idx] += CMath::abs(alpha*spec_weights[d]);\n\t\t\t\telse\n\t\t\t\t\tvec2[offs + idx] += alpha*spec_weights[d];\n\t\t\t\toffs+=strings->shift_offset(1,d+1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nCFeatures* CImplicitWeightedSpecFeatures::duplicate() const\n{\n\treturn new CImplicitWeightedSpecFeatures(*this);\n}\n<commit_msg>fix same bug also in implicit wd spec features<commit_after>\/*\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 3 of the License, or\n * (at your option) any later version.\n *\n * Written (W) 2009 Soeren Sonnenburg\n * Copyright (C) 2009 Fraunhofer Institute FIRST and Max-Planck-Society\n *\/\n\n#include \"features\/ImplicitWeightedSpecFeatures.h\"\n#include \"lib\/io.h\"\n\nCImplicitWeightedSpecFeatures::CImplicitWeightedSpecFeatures(CStringFeatures<uint16_t>* str, bool normalize) : CDotFeatures()\n{\n\tASSERT(str);\n\tstrings=str;\n\tSG_REF(strings)\n\tnormalization_factors=NULL;\n\tspec_weights=NULL;\n\tnum_strings = str->get_num_vectors();\n\talphabet_size = str->get_original_num_symbols();\n\tdegree=str->get_order();\n\tset_wd_weights();\n\n\tSG_DEBUG(\"WEIGHTED SPEC alphasz=%d, size=%d, num_str=%d\\n\", alphabet_size,\n\t\t\tspec_size, num_strings);\n\n\tif (normalize)\n\t\tcompute_normalization_const();\n}\n\nvoid CImplicitWeightedSpecFeatures::compute_normalization_const()\n{\n\tfloat64_t* factors=new float64_t[num_strings];\n\n\tfor (int32_t i=0; i<num_strings; i++)\n\t\tfactors[i]=1.0\/CMath::sqrt(dot(i,i));\n\n\tnormalization_factors=factors;\n\t\/\/CMath::display_vector(normalization_factors, num_strings, \"n\");\n}\n\nbool CImplicitWeightedSpecFeatures::set_wd_weights()\n{\n\tdelete[] spec_weights;\n\tspec_weights=new float64_t[degree];\n\n\tint32_t i;\n\tfloat64_t sum=0;\n\tspec_size=0;\n\n\tfor (i=0; i<degree; i++)\n\t{\n\t\tspec_size+=CMath::pow(alphabet_size, i+1);\n\t\tspec_weights[i]=degree-i;\n\t\tsum+=spec_weights[i];\n\t}\n\tfor (i=0; i<degree; i++)\n\t\tspec_weights[i]=CMath::sqrt(spec_weights[i]\/sum);\n\n\treturn spec_weights!=NULL;\n}\n\nbool CImplicitWeightedSpecFeatures::set_weights(float64_t* w, int32_t d)\n{\n\tASSERT(d==degree);\n\n\tdelete[] spec_weights;\n\tspec_weights=new float64_t[degree];\n\tfor (int32_t i=0; i<degree; i++)\n\t\tspec_weights[i]=CMath::sqrt(w[i]);\n\treturn true;\n}\n\nCImplicitWeightedSpecFeatures::CImplicitWeightedSpecFeatures(const CImplicitWeightedSpecFeatures& orig) : CDotFeatures(orig), \n\tnum_strings(orig.num_strings), \n\talphabet_size(orig.alphabet_size), spec_size(orig.spec_size)\n{\n\tSG_NOTIMPLEMENTED;\n\tSG_REF(strings);\n}\n\nCImplicitWeightedSpecFeatures::~CImplicitWeightedSpecFeatures()\n{\n\tSG_UNREF(strings);\n\tdelete[] spec_weights;\n\tdelete[] normalization_factors;\n}\n\nfloat64_t CImplicitWeightedSpecFeatures::dot(int32_t vec_idx1, int32_t vec_idx2)\n{\n\tASSERT(vec_idx1 < num_strings);\n\tASSERT(vec_idx2 < num_strings);\n\n\tint32_t len1=-1;\n\tint32_t len2=-1;\n\tuint16_t* vec1=strings->get_feature_vector(vec_idx1, len1);\n\tuint16_t* vec2=strings->get_feature_vector(vec_idx2, len2);\n\n\tfloat64_t result=0;\n\tuint8_t mask=0;\n\n\tfor (int32_t d=0; d<degree; d++)\n\t{\n\t\tmask = mask | (1 << (degree-d-1));\n\t\tuint16_t masked=strings->get_masked_symbols(0xffff, mask);\n\n\t\tint32_t left_idx=0;\n\t\tint32_t right_idx=0;\n\t\tfloat64_t weight=spec_weights[d]*spec_weights[d];\n\n\t\twhile (left_idx < len1 && right_idx < len2)\n\t\t{\n\t\t\tuint16_t lsym=vec1[left_idx] & masked;\n\t\t\tuint16_t rsym=vec2[right_idx] & masked;\n\n\t\t\tif (lsym == rsym)\n\t\t\t{\n\t\t\t\tint32_t old_left_idx=left_idx;\n\t\t\t\tint32_t old_right_idx=right_idx;\n\n\t\t\t\twhile (left_idx<len1 && (vec1[left_idx] & masked) ==lsym)\n\t\t\t\t\tleft_idx++;\n\n\t\t\t\twhile (right_idx<len2 && (vec2[right_idx] & masked) ==lsym)\n\t\t\t\t\tright_idx++;\n\n\t\t\t\tresult+=weight*(left_idx-old_left_idx)*(right_idx-old_right_idx);\n\t\t\t}\n\t\t\telse if (lsym<rsym)\n\t\t\t\tleft_idx++;\n\t\t\telse\n\t\t\t\tright_idx++;\n\t\t}\n\t}\n\n\tif (normalization_factors)\n\t\treturn result*normalization_factors[vec_idx1]*normalization_factors[vec_idx2];\n\telse\n\t\treturn result;\n}\n\nfloat64_t CImplicitWeightedSpecFeatures::dense_dot(int32_t vec_idx1, const float64_t* vec2, int32_t vec2_len)\n{\n\tASSERT(vec2_len == spec_size);\n\tASSERT(vec_idx1 < num_strings);\n\n\tfloat64_t result=0;\n\tint32_t len1=-1;\n\tuint16_t* vec1=strings->get_feature_vector(vec_idx1, len1);\n\n\tif (vec1 && len1>0)\n\t{\n\t\tfor (int32_t j=0; j<len1; j++)\n\t\t{\n\t\t\tuint8_t mask=0;\n\t\t\tint32_t offs=0;\n\t\t\tuint16_t v=*vec1++;\n\n\t\t\tfor (int32_t d=0; d<degree; d++)\n\t\t\t{\n\t\t\t\tmask = mask | (1 << (degree-d-1));\n\t\t\t\tint32_t idx=strings->get_masked_symbols(v, mask);\n\t\t\t\tidx=strings->shift_symbol(idx, degree-d-1);\n\t\t\t\tresult += vec2[offs + idx]*spec_weights[d];\n\t\t\t\toffs+=strings->shift_offset(1,d+1);\n\t\t\t}\n\t\t}\n\n\t\tif (normalization_factors)\n\t\t\tresult*=normalization_factors[vec_idx1];\n\t}\n\telse\n\t\tSG_ERROR(\"huh?\\n\");\n\n\treturn result;\n}\n\nvoid CImplicitWeightedSpecFeatures::add_to_dense_vec(float64_t alpha, int32_t vec_idx1, float64_t* vec2, int32_t vec2_len, bool abs_val)\n{\n\tint32_t len1=-1;\n\tuint16_t* vec=strings->get_feature_vector(vec_idx1, len1);\n\n\tif (normalization_factors)\n\t\talpha*=normalization_factors[vec_idx1];\n\n\tif (vec && len1>0)\n\t{\n\t\tfor (int32_t j=0; j<len1; j++)\n\t\t{\n\t\t\tuint8_t mask=0;\n\t\t\tint32_t offs=0;\n\t\t\tfor (int32_t d=0; d<degree; d++)\n\t\t\t{\n\t\t\t\tmask = mask | (1 << (degree-d-1));\n\t\t\t\tint32_t idx=strings->get_masked_symbols(vec[j], mask);\n\t\t\t\tidx=strings->shift_symbol(idx, degree-d-1);\n\t\t\t\tif (abs_val)\n\t\t\t\t\tvec2[offs + idx] += CMath::abs(alpha*spec_weights[d]);\n\t\t\t\telse\n\t\t\t\t\tvec2[offs + idx] += alpha*spec_weights[d];\n\t\t\t\toffs+=strings->shift_offset(1,d+1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nCFeatures* CImplicitWeightedSpecFeatures::duplicate() const\n{\n\treturn new CImplicitWeightedSpecFeatures(*this);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/trace_processor\/importers\/json\/json_trace_parser.h\"\n\n#include <inttypes.h>\n\n#include <limits>\n#include <string>\n\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/ext\/base\/string_view.h\"\n#include \"perfetto\/ext\/base\/utils.h\"\n#include \"src\/trace_processor\/importers\/json\/json_tracker.h\"\n#include \"src\/trace_processor\/importers\/json\/json_utils.h\"\n#include \"src\/trace_processor\/process_tracker.h\"\n#include \"src\/trace_processor\/slice_tracker.h\"\n#include \"src\/trace_processor\/trace_processor_context.h\"\n#include \"src\/trace_processor\/track_tracker.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nJsonTraceParser::JsonTraceParser(TraceProcessorContext* context)\n : context_(context), systrace_line_parser_(context) {}\n\nJsonTraceParser::~JsonTraceParser() = default;\n\nvoid JsonTraceParser::ParseFtracePacket(uint32_t,\n int64_t,\n TimestampedTracePiece) {\n PERFETTO_FATAL(\"Json Trace Parser cannot handle ftrace packets.\");\n}\n\nvoid JsonTraceParser::ParseTracePacket(int64_t timestamp,\n TimestampedTracePiece ttp) {\n PERFETTO_DCHECK(json::IsJsonSupported());\n\n#if PERFETTO_BUILDFLAG(PERFETTO_TP_JSON)\n PERFETTO_DCHECK(ttp.type == TimestampedTracePiece::Type::kJsonValue ||\n ttp.type == TimestampedTracePiece::Type::kSystraceLine);\n if (ttp.type == TimestampedTracePiece::Type::kSystraceLine) {\n systrace_line_parser_.ParseLine(*ttp.systrace_line);\n return;\n }\n\n const Json::Value& value = *(ttp.json_value);\n\n ProcessTracker* procs = context_->process_tracker.get();\n TraceStorage* storage = context_->storage.get();\n SliceTracker* slice_tracker = context_->slice_tracker.get();\n\n auto& ph = value[\"ph\"];\n if (!ph.isString())\n return;\n char phase = *ph.asCString();\n\n base::Optional<uint32_t> opt_pid;\n base::Optional<uint32_t> opt_tid;\n\n if (value.isMember(\"pid\"))\n opt_pid = json::CoerceToUint32(value[\"pid\"]);\n if (value.isMember(\"tid\"))\n opt_tid = json::CoerceToUint32(value[\"tid\"]);\n\n uint32_t pid = opt_pid.value_or(0);\n uint32_t tid = opt_tid.value_or(pid);\n\n base::StringView cat = value.isMember(\"cat\")\n ? base::StringView(value[\"cat\"].asCString())\n : base::StringView();\n base::StringView name = value.isMember(\"name\")\n ? base::StringView(value[\"name\"].asCString())\n : base::StringView();\n\n StringId cat_id = storage->InternString(cat);\n StringId name_id = storage->InternString(name);\n UniqueTid utid = procs->UpdateThread(tid, pid);\n\n switch (phase) {\n case 'B': { \/\/ TRACE_EVENT_BEGIN.\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->Begin(timestamp, track_id, cat_id, name_id);\n break;\n }\n case 'E': { \/\/ TRACE_EVENT_END.\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->End(timestamp, track_id, cat_id, name_id);\n break;\n }\n case 'X': { \/\/ TRACE_EVENT (scoped event).\n base::Optional<int64_t> opt_dur =\n JsonTracker::GetOrCreate(context_)->CoerceToTs(value[\"dur\"]);\n if (!opt_dur.has_value())\n return;\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->Scoped(timestamp, track_id, cat_id, name_id,\n opt_dur.value());\n break;\n }\n case 'M': { \/\/ Metadata events (process and thread names).\n if (strcmp(value[\"name\"].asCString(), \"thread_name\") == 0 &&\n !value[\"args\"][\"name\"].empty()) {\n const char* thread_name = value[\"args\"][\"name\"].asCString();\n auto thread_name_id = context_->storage->InternString(thread_name);\n procs->UpdateThreadName(tid, thread_name_id);\n break;\n }\n if (strcmp(value[\"name\"].asCString(), \"process_name\") == 0 &&\n !value[\"args\"][\"name\"].empty()) {\n const char* proc_name = value[\"args\"][\"name\"].asCString();\n procs->SetProcessMetadata(pid, base::nullopt, proc_name);\n break;\n }\n }\n }\n#else\n perfetto::base::ignore_result(timestamp);\n perfetto::base::ignore_result(ttp);\n perfetto::base::ignore_result(context_);\n PERFETTO_ELOG(\"Cannot parse JSON trace due to missing JSON support\");\n#endif \/\/ PERFETTO_BUILDFLAG(PERFETTO_TP_JSON)\n}\n\n} \/\/ namespace trace_processor\n} \/\/ namespace perfetto\n\n<commit_msg>tp: ingest args from json events<commit_after>\/*\n * Copyright (C) 2018 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"src\/trace_processor\/importers\/json\/json_trace_parser.h\"\n\n#include <inttypes.h>\n\n#include <limits>\n#include <string>\n\n#include \"perfetto\/base\/logging.h\"\n#include \"perfetto\/ext\/base\/string_view.h\"\n#include \"perfetto\/ext\/base\/utils.h\"\n#include \"src\/trace_processor\/importers\/json\/json_tracker.h\"\n#include \"src\/trace_processor\/importers\/json\/json_utils.h\"\n#include \"src\/trace_processor\/process_tracker.h\"\n#include \"src\/trace_processor\/slice_tracker.h\"\n#include \"src\/trace_processor\/trace_processor_context.h\"\n#include \"src\/trace_processor\/track_tracker.h\"\n\nnamespace perfetto {\nnamespace trace_processor {\n\nJsonTraceParser::JsonTraceParser(TraceProcessorContext* context)\n : context_(context), systrace_line_parser_(context) {}\n\nJsonTraceParser::~JsonTraceParser() = default;\n\nvoid JsonTraceParser::ParseFtracePacket(uint32_t,\n int64_t,\n TimestampedTracePiece) {\n PERFETTO_FATAL(\"Json Trace Parser cannot handle ftrace packets.\");\n}\n\nvoid JsonTraceParser::ParseTracePacket(int64_t timestamp,\n TimestampedTracePiece ttp) {\n PERFETTO_DCHECK(json::IsJsonSupported());\n\n#if PERFETTO_BUILDFLAG(PERFETTO_TP_JSON)\n PERFETTO_DCHECK(ttp.type == TimestampedTracePiece::Type::kJsonValue ||\n ttp.type == TimestampedTracePiece::Type::kSystraceLine);\n if (ttp.type == TimestampedTracePiece::Type::kSystraceLine) {\n systrace_line_parser_.ParseLine(*ttp.systrace_line);\n return;\n }\n\n const Json::Value& value = *(ttp.json_value);\n\n ProcessTracker* procs = context_->process_tracker.get();\n TraceStorage* storage = context_->storage.get();\n SliceTracker* slice_tracker = context_->slice_tracker.get();\n\n auto& ph = value[\"ph\"];\n if (!ph.isString())\n return;\n char phase = *ph.asCString();\n\n base::Optional<uint32_t> opt_pid;\n base::Optional<uint32_t> opt_tid;\n\n if (value.isMember(\"pid\"))\n opt_pid = json::CoerceToUint32(value[\"pid\"]);\n if (value.isMember(\"tid\"))\n opt_tid = json::CoerceToUint32(value[\"tid\"]);\n\n uint32_t pid = opt_pid.value_or(0);\n uint32_t tid = opt_tid.value_or(pid);\n\n base::StringView cat = value.isMember(\"cat\")\n ? base::StringView(value[\"cat\"].asCString())\n : base::StringView();\n base::StringView name = value.isMember(\"name\")\n ? base::StringView(value[\"name\"].asCString())\n : base::StringView();\n\n StringId cat_id = storage->InternString(cat);\n StringId name_id = storage->InternString(name);\n UniqueTid utid = procs->UpdateThread(tid, pid);\n\n auto args_inserter = [this, &value](ArgsTracker::BoundInserter* inserter) {\n if (value.isMember(\"args\")) {\n json::AddJsonValueToArgs(value[\"args\"], \/* flat_key = *\/ \"args\",\n \/* key = *\/ \"args\", context_->storage.get(),\n inserter);\n }\n };\n switch (phase) {\n case 'B': { \/\/ TRACE_EVENT_BEGIN.\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->Begin(timestamp, track_id, cat_id, name_id, args_inserter);\n break;\n }\n case 'E': { \/\/ TRACE_EVENT_END.\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->End(timestamp, track_id, cat_id, name_id, args_inserter);\n break;\n }\n case 'X': { \/\/ TRACE_EVENT (scoped event).\n base::Optional<int64_t> opt_dur =\n JsonTracker::GetOrCreate(context_)->CoerceToTs(value[\"dur\"]);\n if (!opt_dur.has_value())\n return;\n TrackId track_id = context_->track_tracker->InternThreadTrack(utid);\n slice_tracker->Scoped(timestamp, track_id, cat_id, name_id,\n opt_dur.value(), args_inserter);\n break;\n }\n case 'M': { \/\/ Metadata events (process and thread names).\n if (strcmp(value[\"name\"].asCString(), \"thread_name\") == 0 &&\n !value[\"args\"][\"name\"].empty()) {\n const char* thread_name = value[\"args\"][\"name\"].asCString();\n auto thread_name_id = context_->storage->InternString(thread_name);\n procs->UpdateThreadName(tid, thread_name_id);\n break;\n }\n if (strcmp(value[\"name\"].asCString(), \"process_name\") == 0 &&\n !value[\"args\"][\"name\"].empty()) {\n const char* proc_name = value[\"args\"][\"name\"].asCString();\n procs->SetProcessMetadata(pid, base::nullopt, proc_name);\n break;\n }\n }\n }\n#else\n perfetto::base::ignore_result(timestamp);\n perfetto::base::ignore_result(ttp);\n perfetto::base::ignore_result(context_);\n PERFETTO_ELOG(\"Cannot parse JSON trace due to missing JSON support\");\n#endif \/\/ PERFETTO_BUILDFLAG(PERFETTO_TP_JSON)\n}\n\n} \/\/ namespace trace_processor\n} \/\/ namespace perfetto\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Radu Serban, Justin Madsen, Daniel Melanz\n\/\/ =============================================================================\n\/\/\n\/\/ Base class for a double-A arm suspension modeled with bodies and constraints.\n\/\/\n\/\/ The suspension subsystem is modeled with respect to a right-handed frame,\n\/\/ with X pointing towards the rear, Y to the right, and Z up. By default, a\n\/\/ right suspension is constructed. This can be mirrored to obtain a left\n\/\/ suspension. Note that this is done by reflecting the y coordinates of the\n\/\/ hardpoints. As such, the orientation of the suspension reference frame must\n\/\/ be as specified above. However, its location relative to the chassis is\n\/\/ arbitrary (and left up to a derived class).\n\/\/\n\/\/ If marked as 'driven', the suspension subsystem also creates the ChShaft axle\n\/\/ element and its connection to the spindle body (which provides the interface\n\/\/ to the powertrain subsystem).\n\/\/\n\/\/ =============================================================================\n\n#include \"assets\/ChCylinderShape.h\"\n#include \"assets\/ChColorAsset.h\"\n\n#include \"subsys\/suspension\/ChDoubleWishbone.h\"\n\n\nnamespace chrono {\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChDoubleWishbone::ChDoubleWishbone(const std::string& name,\n ChSuspension::Side side,\n bool driven)\n: ChSuspension(name, side, driven)\n{\n \/\/ Create the upright and spindle bodies\n m_spindle = ChSharedBodyPtr(new ChBody);\n m_spindle->SetNameString(name + \"_spindle\");\n\n m_upright = ChSharedBodyPtr(new ChBody);\n m_upright->SetNameString(name + \"_upright\");\n\n \/\/ Revolute joint between spindle and upright\n m_revolute = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revolute->SetNameString(name + \"_revolute\");\n\n \/\/ Bodies and constraints to model upper control arm\n m_UCA = ChSharedBodyPtr(new ChBody);\n m_UCA->SetNameString(name + \"_UCA\");\n m_revoluteUCA = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revoluteUCA->SetNameString(name + \"_revoluteUCA\");\n m_sphericalUCA = ChSharedPtr<ChLinkLockSpherical>(new ChLinkLockSpherical);\n m_sphericalUCA->SetNameString(name + \"_sphericalUCA\");\n\n \/\/ Bodies and constraints to model lower control arm\n m_LCA = ChSharedBodyPtr(new ChBody);\n m_LCA->SetNameString(name + \"_LCA\");\n m_revoluteLCA = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revoluteLCA->SetNameString(name + \"_revoluteLCA\");\n m_sphericalLCA = ChSharedPtr<ChLinkLockSpherical>(new ChLinkLockSpherical);\n m_sphericalLCA->SetNameString(name + \"_sphericalLCA\");\n\n \/\/ Distance constraint to model the tierod\n m_distTierod = ChSharedPtr<ChLinkDistance>(new ChLinkDistance);\n m_distTierod->SetNameString(name + \"_distTierod\");\n\n \/\/ Spring-damper\n m_shock = ChSharedPtr<ChLinkSpring>(new ChLinkSpring);\n m_shock->SetNameString(name + \"_shock\");\n\n \/\/ If driven, create the axle shaft and its connection to the spindle.\n if (m_driven) {\n m_axle = ChSharedPtr<ChShaft>(new ChShaft);\n m_axle->SetNameString(name + \"_axle\");\n\n m_axle_to_spindle = ChSharedPtr<ChShaftsBody>(new ChShaftsBody);\n m_axle_to_spindle->SetNameString(name + \"_axle_to_spindle\");\n }\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ TODO: does it make sense to ask for a complete Coordsys (i.e. allow for a \n\/\/ non-identity rotation) when attaching a suspension subsystem to the chassis?\n\/\/ -----------------------------------------------------------------------------\nvoid\nChDoubleWishbone::Initialize(ChSharedBodyPtr chassis,\n const ChVector<>& location)\n{\n \/\/ Transform all points to absolute frame\n for (int i = 0; i < NUM_POINTS; i++) {\n ChVector<> rel_pos = getLocation(static_cast<PointId>(i));\n if (m_side == LEFT)\n rel_pos.y = -rel_pos.y;\n m_points[i] = chassis->GetCoord().TransformLocalToParent(location + rel_pos);\n }\n\n \/\/ Set body positions and rotations, mass properties, etc.\n m_spindle->SetPos(m_points[SPINDLE]);\n m_spindle->SetRot(chassis->GetCoord().rot);\n m_spindle->SetMass(getSpindleMass());\n m_spindle->SetInertiaXX(getSpindleInertia());\n OnInitializeSpindle();\n chassis->GetSystem()->AddBody(m_spindle);\n\n m_UCA->SetPos(m_points[UCA_CM]);\n \/\/ Determine the rotation matrix of the UCA based on the plane of the hard points\n ChVector<> wRot;\n wRot.Cross(m_points[UCA_F]-m_points[UCA_U], m_points[UCA_B]-m_points[UCA_U]);\n wRot.Normalize();\n ChVector<> uRot = m_points[UCA_B]-m_points[UCA_F];\n uRot.Normalize();\n ChVector<> vRot;\n vRot.Cross(wRot,uRot);\n ChMatrix33<> rotationMatrix;\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_UCA->SetRot(rotationMatrix); \/\/ Set the rotation of the UCA\n m_UCA->SetMass(getUCAMass());\n m_UCA->SetInertiaXX(getUCAInertia());\n AddVisualizationUCA();\n OnInitializeUCA();\n chassis->GetSystem()->AddBody(m_UCA);\n\n m_LCA->SetPos(m_points[LCA_CM]);\n \/\/ Determine the rotation matrix of the LCA based on the plane of the hard points\n wRot.Cross(m_points[LCA_F]-m_points[LCA_U], m_points[LCA_B]-m_points[LCA_U]);\n wRot.Normalize();\n uRot = m_points[LCA_B]-m_points[LCA_F];\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_LCA->SetRot(rotationMatrix); \/\/ Set the rotation of the LCA\n m_LCA->SetMass(getLCAMass());\n m_LCA->SetInertiaXX(getLCAInertia());\n AddVisualizationLCA();\n OnInitializeLCA();\n chassis->GetSystem()->AddBody(m_LCA);\n\n m_upright->SetPos(m_points[UPRIGHT]);\n m_upright->SetRot(chassis->GetCoord().rot);\n m_upright->SetMass(getUprightMass());\n m_upright->SetInertiaXX(getUprightInertia());\n AddVisualizationUpright();\n OnInitializeUpright();\n chassis->GetSystem()->AddBody(m_upright);\n\n \/\/ Initialize joints\n ChCoordsys<> rev_csys(m_points[UPRIGHT], Q_from_AngAxis(CH_C_PI \/ 2.0, VECT_X));\n m_revolute->Initialize(m_spindle, m_upright, rev_csys);\n chassis->GetSystem()->AddLink(m_revolute);\n\n \/\/ Determine the rotation matrix of the UCA based on the plane of the hard points\n wRot = m_points[UCA_B]-m_points[UCA_F];\n wRot.Normalize();\n uRot = ChVector<>(0,0,1);\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_revoluteUCA->Initialize(chassis, m_UCA, ChCoordsys<>((m_points[UCA_F]+m_points[UCA_B])\/2, rotationMatrix.Get_A_quaternion()));\n chassis->GetSystem()->AddLink(m_revoluteUCA);\n m_sphericalUCA->Initialize(m_UCA, m_upright, ChCoordsys<>(m_points[UCA_U], QUNIT));\n chassis->GetSystem()->AddLink(m_sphericalUCA);\n\n \/\/ Determine the rotation matrix of the LCA based on the plane of the hard points\n wRot = m_points[LCA_B]-m_points[LCA_F];\n wRot.Normalize();\n uRot = ChVector<>(0,0,1);\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_revoluteLCA->Initialize(chassis, m_LCA, ChCoordsys<>((m_points[LCA_F]+m_points[LCA_B])\/2, rotationMatrix.Get_A_quaternion()));\n chassis->GetSystem()->AddLink(m_revoluteLCA);\n m_sphericalLCA->Initialize(m_LCA, m_upright, ChCoordsys<>(m_points[LCA_U], QUNIT));\n chassis->GetSystem()->AddLink(m_sphericalLCA);\n\n m_distTierod->Initialize(chassis, m_upright, false, m_points[TIEROD_C], m_points[TIEROD_U]);\n chassis->GetSystem()->AddLink(m_distTierod);\n\n \/\/ Initialize the spring\/damper\n m_shock->Initialize(chassis, m_upright, false, m_points[SHOCK_C], m_points[SHOCK_U]);\n m_shock->Set_SpringK(getSpringCoefficient());\n m_shock->Set_SpringR(getDampingCoefficient());\n m_shock->Set_SpringRestLength(getSpringRestLength());\n chassis->GetSystem()->AddLink(m_shock);\n\n \/\/ Save initial relative position of marker 1 of the tierod distance link,\n \/\/ to be used in steering.\n m_tierod_marker = m_distTierod->GetEndPoint1Rel();\n\n \/\/ Initialize the axle shaft and its connection to the spindle. Note that the\n \/\/ spindle rotates about the Y axis.\n if (m_driven) {\n m_axle->SetInertia(getAxleInertia());\n chassis->GetSystem()->Add(m_axle);\n m_axle_to_spindle->Initialize(m_axle, m_spindle, ChVector<>(0, 1, 0));\n chassis->GetSystem()->Add(m_axle_to_spindle);\n }\n\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChDoubleWishbone::AddVisualizationLCA()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_F = m_LCA->TransformPointParentToLocal(m_points[LCA_F]);\n ChVector<> p_B = m_LCA->TransformPointParentToLocal(m_points[LCA_B]);\n ChVector<> p_U = m_LCA->TransformPointParentToLocal(m_points[LCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl_F(new ChCylinderShape);\n cyl_F->GetCylinderGeometry().p1 = p_F;\n cyl_F->GetCylinderGeometry().p2 = p_U;\n cyl_F->GetCylinderGeometry().rad = getLCARadius();\n m_LCA->AddAsset(cyl_F);\n\n ChSharedPtr<ChCylinderShape> cyl_B(new ChCylinderShape);\n cyl_B->GetCylinderGeometry().p1 = p_B;\n cyl_B->GetCylinderGeometry().p2 = p_U;\n cyl_B->GetCylinderGeometry().rad = getLCARadius();\n m_LCA->AddAsset(cyl_B);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.4f, 0.4f)); break;\n case LEFT: col->SetColor(ChColor(0.4f, 0.4f, 0.6f)); break;\n }\n m_LCA->AddAsset(col);\n}\n\nvoid ChDoubleWishbone::AddVisualizationUCA()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_F = m_UCA->TransformPointParentToLocal(m_points[UCA_F]);\n ChVector<> p_B = m_UCA->TransformPointParentToLocal(m_points[UCA_B]);\n ChVector<> p_U = m_UCA->TransformPointParentToLocal(m_points[UCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl_F(new ChCylinderShape);\n cyl_F->GetCylinderGeometry().p1 = p_F;\n cyl_F->GetCylinderGeometry().p2 = p_U;\n cyl_F->GetCylinderGeometry().rad = getUCARadius();\n m_UCA->AddAsset(cyl_F);\n\n ChSharedPtr<ChCylinderShape> cyl_B(new ChCylinderShape);\n cyl_B->GetCylinderGeometry().p1 = p_B;\n cyl_B->GetCylinderGeometry().p2 = p_U;\n cyl_B->GetCylinderGeometry().rad = getUCARadius();\n m_UCA->AddAsset(cyl_B);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.4f, 0.4f)); break;\n case LEFT: col->SetColor(ChColor(0.4f, 0.4f, 0.6f)); break;\n }\n m_UCA->AddAsset(col);\n}\n\nvoid ChDoubleWishbone::AddVisualizationUpright()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_U = m_upright->TransformPointParentToLocal(m_points[UCA_U]);\n ChVector<> p_L = m_upright->TransformPointParentToLocal(m_points[LCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl(new ChCylinderShape);\n cyl->GetCylinderGeometry().p1 = p_U;\n cyl->GetCylinderGeometry().p2 = p_L;\n cyl->GetCylinderGeometry().rad = getUprightRadius();\n m_upright->AddAsset(cyl);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.1f, 0.1f)); break;\n case LEFT: col->SetColor(ChColor(0.1f, 0.1f, 0.6f)); break;\n }\n m_upright->AddAsset(col);\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid ChDoubleWishbone::ApplySteering(double displ)\n{\n ChVector<> r_bar = m_tierod_marker;\n r_bar.y += displ;\n m_distTierod->SetEndPoint1Rel(r_bar);\n}\n\n\n} \/\/ end namespace chrono\n<commit_msg>Changed the connection of the shock spring\/damper from the upright to the LCA.<commit_after>\/\/ =============================================================================\n\/\/ PROJECT CHRONO - http:\/\/projectchrono.org\n\/\/\n\/\/ Copyright (c) 2014 projectchrono.org\n\/\/ All right reserved.\n\/\/\n\/\/ Use of this source code is governed by a BSD-style license that can be found\n\/\/ in the LICENSE file at the top level of the distribution and at\n\/\/ http:\/\/projectchrono.org\/license-chrono.txt.\n\/\/\n\/\/ =============================================================================\n\/\/ Authors: Radu Serban, Justin Madsen, Daniel Melanz\n\/\/ =============================================================================\n\/\/\n\/\/ Base class for a double-A arm suspension modeled with bodies and constraints.\n\/\/\n\/\/ The suspension subsystem is modeled with respect to a right-handed frame,\n\/\/ with X pointing towards the rear, Y to the right, and Z up. By default, a\n\/\/ right suspension is constructed. This can be mirrored to obtain a left\n\/\/ suspension. Note that this is done by reflecting the y coordinates of the\n\/\/ hardpoints. As such, the orientation of the suspension reference frame must\n\/\/ be as specified above. However, its location relative to the chassis is\n\/\/ arbitrary (and left up to a derived class).\n\/\/\n\/\/ If marked as 'driven', the suspension subsystem also creates the ChShaft axle\n\/\/ element and its connection to the spindle body (which provides the interface\n\/\/ to the powertrain subsystem).\n\/\/\n\/\/ =============================================================================\n\n#include \"assets\/ChCylinderShape.h\"\n#include \"assets\/ChColorAsset.h\"\n\n#include \"subsys\/suspension\/ChDoubleWishbone.h\"\n\n\nnamespace chrono {\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nChDoubleWishbone::ChDoubleWishbone(const std::string& name,\n ChSuspension::Side side,\n bool driven)\n: ChSuspension(name, side, driven)\n{\n \/\/ Create the upright and spindle bodies\n m_spindle = ChSharedBodyPtr(new ChBody);\n m_spindle->SetNameString(name + \"_spindle\");\n\n m_upright = ChSharedBodyPtr(new ChBody);\n m_upright->SetNameString(name + \"_upright\");\n\n \/\/ Revolute joint between spindle and upright\n m_revolute = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revolute->SetNameString(name + \"_revolute\");\n\n \/\/ Bodies and constraints to model upper control arm\n m_UCA = ChSharedBodyPtr(new ChBody);\n m_UCA->SetNameString(name + \"_UCA\");\n m_revoluteUCA = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revoluteUCA->SetNameString(name + \"_revoluteUCA\");\n m_sphericalUCA = ChSharedPtr<ChLinkLockSpherical>(new ChLinkLockSpherical);\n m_sphericalUCA->SetNameString(name + \"_sphericalUCA\");\n\n \/\/ Bodies and constraints to model lower control arm\n m_LCA = ChSharedBodyPtr(new ChBody);\n m_LCA->SetNameString(name + \"_LCA\");\n m_revoluteLCA = ChSharedPtr<ChLinkLockRevolute>(new ChLinkLockRevolute);\n m_revoluteLCA->SetNameString(name + \"_revoluteLCA\");\n m_sphericalLCA = ChSharedPtr<ChLinkLockSpherical>(new ChLinkLockSpherical);\n m_sphericalLCA->SetNameString(name + \"_sphericalLCA\");\n\n \/\/ Distance constraint to model the tierod\n m_distTierod = ChSharedPtr<ChLinkDistance>(new ChLinkDistance);\n m_distTierod->SetNameString(name + \"_distTierod\");\n\n \/\/ Spring-damper\n m_shock = ChSharedPtr<ChLinkSpring>(new ChLinkSpring);\n m_shock->SetNameString(name + \"_shock\");\n\n \/\/ If driven, create the axle shaft and its connection to the spindle.\n if (m_driven) {\n m_axle = ChSharedPtr<ChShaft>(new ChShaft);\n m_axle->SetNameString(name + \"_axle\");\n\n m_axle_to_spindle = ChSharedPtr<ChShaftsBody>(new ChShaftsBody);\n m_axle_to_spindle->SetNameString(name + \"_axle_to_spindle\");\n }\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ TODO: does it make sense to ask for a complete Coordsys (i.e. allow for a \n\/\/ non-identity rotation) when attaching a suspension subsystem to the chassis?\n\/\/ -----------------------------------------------------------------------------\nvoid\nChDoubleWishbone::Initialize(ChSharedBodyPtr chassis,\n const ChVector<>& location)\n{\n \/\/ Transform all points to absolute frame\n for (int i = 0; i < NUM_POINTS; i++) {\n ChVector<> rel_pos = getLocation(static_cast<PointId>(i));\n if (m_side == LEFT)\n rel_pos.y = -rel_pos.y;\n m_points[i] = chassis->GetCoord().TransformLocalToParent(location + rel_pos);\n }\n\n \/\/ Set body positions and rotations, mass properties, etc.\n m_spindle->SetPos(m_points[SPINDLE]);\n m_spindle->SetRot(chassis->GetCoord().rot);\n m_spindle->SetMass(getSpindleMass());\n m_spindle->SetInertiaXX(getSpindleInertia());\n OnInitializeSpindle();\n chassis->GetSystem()->AddBody(m_spindle);\n\n m_UCA->SetPos(m_points[UCA_CM]);\n \/\/ Determine the rotation matrix of the UCA based on the plane of the hard points\n ChVector<> wRot;\n wRot.Cross(m_points[UCA_F]-m_points[UCA_U], m_points[UCA_B]-m_points[UCA_U]);\n wRot.Normalize();\n ChVector<> uRot = m_points[UCA_B]-m_points[UCA_F];\n uRot.Normalize();\n ChVector<> vRot;\n vRot.Cross(wRot,uRot);\n ChMatrix33<> rotationMatrix;\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_UCA->SetRot(rotationMatrix); \/\/ Set the rotation of the UCA\n m_UCA->SetMass(getUCAMass());\n m_UCA->SetInertiaXX(getUCAInertia());\n AddVisualizationUCA();\n OnInitializeUCA();\n chassis->GetSystem()->AddBody(m_UCA);\n\n m_LCA->SetPos(m_points[LCA_CM]);\n \/\/ Determine the rotation matrix of the LCA based on the plane of the hard points\n wRot.Cross(m_points[LCA_F]-m_points[LCA_U], m_points[LCA_B]-m_points[LCA_U]);\n wRot.Normalize();\n uRot = m_points[LCA_B]-m_points[LCA_F];\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_LCA->SetRot(rotationMatrix); \/\/ Set the rotation of the LCA\n m_LCA->SetMass(getLCAMass());\n m_LCA->SetInertiaXX(getLCAInertia());\n AddVisualizationLCA();\n OnInitializeLCA();\n chassis->GetSystem()->AddBody(m_LCA);\n\n m_upright->SetPos(m_points[UPRIGHT]);\n m_upright->SetRot(chassis->GetCoord().rot);\n m_upright->SetMass(getUprightMass());\n m_upright->SetInertiaXX(getUprightInertia());\n AddVisualizationUpright();\n OnInitializeUpright();\n chassis->GetSystem()->AddBody(m_upright);\n\n \/\/ Initialize joints\n ChCoordsys<> rev_csys(m_points[UPRIGHT], Q_from_AngAxis(CH_C_PI \/ 2.0, VECT_X));\n m_revolute->Initialize(m_spindle, m_upright, rev_csys);\n chassis->GetSystem()->AddLink(m_revolute);\n\n \/\/ Determine the rotation matrix of the UCA based on the plane of the hard points\n wRot = m_points[UCA_B]-m_points[UCA_F];\n wRot.Normalize();\n uRot = ChVector<>(0,0,1);\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_revoluteUCA->Initialize(chassis, m_UCA, ChCoordsys<>((m_points[UCA_F]+m_points[UCA_B])\/2, rotationMatrix.Get_A_quaternion()));\n chassis->GetSystem()->AddLink(m_revoluteUCA);\n m_sphericalUCA->Initialize(m_UCA, m_upright, ChCoordsys<>(m_points[UCA_U], QUNIT));\n chassis->GetSystem()->AddLink(m_sphericalUCA);\n\n \/\/ Determine the rotation matrix of the LCA based on the plane of the hard points\n wRot = m_points[LCA_B]-m_points[LCA_F];\n wRot.Normalize();\n uRot = ChVector<>(0,0,1);\n uRot.Normalize();\n vRot.Cross(wRot,uRot);\n rotationMatrix.Set_A_axis(uRot,vRot,wRot);\n m_revoluteLCA->Initialize(chassis, m_LCA, ChCoordsys<>((m_points[LCA_F]+m_points[LCA_B])\/2, rotationMatrix.Get_A_quaternion()));\n chassis->GetSystem()->AddLink(m_revoluteLCA);\n m_sphericalLCA->Initialize(m_LCA, m_upright, ChCoordsys<>(m_points[LCA_U], QUNIT));\n chassis->GetSystem()->AddLink(m_sphericalLCA);\n\n m_distTierod->Initialize(chassis, m_upright, false, m_points[TIEROD_C], m_points[TIEROD_U]);\n chassis->GetSystem()->AddLink(m_distTierod);\n\n \/\/ Initialize the spring\/damper\n m_shock->Initialize(chassis, m_LCA, false, m_points[SHOCK_C], m_points[SHOCK_U]);\n m_shock->Set_SpringK(getSpringCoefficient());\n m_shock->Set_SpringR(getDampingCoefficient());\n m_shock->Set_SpringRestLength(getSpringRestLength());\n chassis->GetSystem()->AddLink(m_shock);\n\n \/\/ Save initial relative position of marker 1 of the tierod distance link,\n \/\/ to be used in steering.\n m_tierod_marker = m_distTierod->GetEndPoint1Rel();\n\n \/\/ Initialize the axle shaft and its connection to the spindle. Note that the\n \/\/ spindle rotates about the Y axis.\n if (m_driven) {\n m_axle->SetInertia(getAxleInertia());\n chassis->GetSystem()->Add(m_axle);\n m_axle_to_spindle->Initialize(m_axle, m_spindle, ChVector<>(0, 1, 0));\n chassis->GetSystem()->Add(m_axle_to_spindle);\n }\n\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/ -----------------------------------------------------------------------------\nvoid ChDoubleWishbone::AddVisualizationLCA()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_F = m_LCA->TransformPointParentToLocal(m_points[LCA_F]);\n ChVector<> p_B = m_LCA->TransformPointParentToLocal(m_points[LCA_B]);\n ChVector<> p_U = m_LCA->TransformPointParentToLocal(m_points[LCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl_F(new ChCylinderShape);\n cyl_F->GetCylinderGeometry().p1 = p_F;\n cyl_F->GetCylinderGeometry().p2 = p_U;\n cyl_F->GetCylinderGeometry().rad = getLCARadius();\n m_LCA->AddAsset(cyl_F);\n\n ChSharedPtr<ChCylinderShape> cyl_B(new ChCylinderShape);\n cyl_B->GetCylinderGeometry().p1 = p_B;\n cyl_B->GetCylinderGeometry().p2 = p_U;\n cyl_B->GetCylinderGeometry().rad = getLCARadius();\n m_LCA->AddAsset(cyl_B);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.4f, 0.4f)); break;\n case LEFT: col->SetColor(ChColor(0.4f, 0.4f, 0.6f)); break;\n }\n m_LCA->AddAsset(col);\n}\n\nvoid ChDoubleWishbone::AddVisualizationUCA()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_F = m_UCA->TransformPointParentToLocal(m_points[UCA_F]);\n ChVector<> p_B = m_UCA->TransformPointParentToLocal(m_points[UCA_B]);\n ChVector<> p_U = m_UCA->TransformPointParentToLocal(m_points[UCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl_F(new ChCylinderShape);\n cyl_F->GetCylinderGeometry().p1 = p_F;\n cyl_F->GetCylinderGeometry().p2 = p_U;\n cyl_F->GetCylinderGeometry().rad = getUCARadius();\n m_UCA->AddAsset(cyl_F);\n\n ChSharedPtr<ChCylinderShape> cyl_B(new ChCylinderShape);\n cyl_B->GetCylinderGeometry().p1 = p_B;\n cyl_B->GetCylinderGeometry().p2 = p_U;\n cyl_B->GetCylinderGeometry().rad = getUCARadius();\n m_UCA->AddAsset(cyl_B);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.4f, 0.4f)); break;\n case LEFT: col->SetColor(ChColor(0.4f, 0.4f, 0.6f)); break;\n }\n m_UCA->AddAsset(col);\n}\n\nvoid ChDoubleWishbone::AddVisualizationUpright()\n{\n \/\/ Express hardpoint locations in body frame.\n ChVector<> p_U = m_upright->TransformPointParentToLocal(m_points[UCA_U]);\n ChVector<> p_L = m_upright->TransformPointParentToLocal(m_points[LCA_U]);\n\n ChSharedPtr<ChCylinderShape> cyl(new ChCylinderShape);\n cyl->GetCylinderGeometry().p1 = p_U;\n cyl->GetCylinderGeometry().p2 = p_L;\n cyl->GetCylinderGeometry().rad = getUprightRadius();\n m_upright->AddAsset(cyl);\n\n ChSharedPtr<ChColorAsset> col(new ChColorAsset);\n switch (m_side) {\n case RIGHT: col->SetColor(ChColor(0.6f, 0.1f, 0.1f)); break;\n case LEFT: col->SetColor(ChColor(0.1f, 0.1f, 0.6f)); break;\n }\n m_upright->AddAsset(col);\n}\n\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid ChDoubleWishbone::ApplySteering(double displ)\n{\n ChVector<> r_bar = m_tierod_marker;\n r_bar.y += displ;\n m_distTierod->SetEndPoint1Rel(r_bar);\n}\n\n\n} \/\/ end namespace chrono\n<|endoftext|>"} {"text":"<commit_before>\/* \n * File: AlarmClockSpeedTest.cpp\n * Author: Amanda Carbonari\n * Created: January 6, 2015 9:00am\n *\n * WARNING: This only measures CPU time\n *\/\n\n#include <ctime>\n#include <iostream>\n#include <AlarmClock.h>\nusing namespace std;\ntypedef std::chrono::microseconds microseconds;\ntypedef std::chrono::milliseconds milliseconds;\ntypedef std::chrono::seconds seconds;\n\n\ntemplate<typename T> void WaitForAlarmClockToExpire(AlarmClock<T>& alerter) {\n\twhile(!alerter.Expired());\n}\n\nint main(int, const char**) {\n \tclock_t start;\n \tunsigned int us = 389;\n\n \tcout << \"Creating Alarm Clock\" << endl;\n \tboost::thread(AlarmClock<microseconds> alerter(us)).join();\n\n \tcout << \"Starting clock and resetting\" << endl;\n \tstart = clock();\n \talerter.Reset();\n \tclock_t reset_time = (clock() - start) \/ (double) (CLOCKS_PER_SEC\/1000);\n\n \tcout << \"Waiting for the clock to expire\" << endl;\n \tWaitForAlarmClockToExpire(alerter);\n\n \tcout << \"Time: \" << reset_time << \" ms\" << endl;\n}<commit_msg>Debugging performance test<commit_after>\/* \n * File: AlarmClockSpeedTest.cpp\n * Author: Amanda Carbonari\n * Created: January 6, 2015 9:00am\n *\n * WARNING: This only measures CPU time\n *\/\n\n#include <ctime>\n#include <iostream>\n#include <AlarmClock.h>\nusing namespace std;\ntypedef std::chrono::microseconds microseconds;\ntypedef std::chrono::milliseconds milliseconds;\ntypedef std::chrono::seconds seconds;\n\n\ntemplate<typename T> void WaitForAlarmClockToExpire(AlarmClock<T>& alerter) {\n\twhile(!alerter.Expired());\n}\n\nint main(int, const char**) {\n \tclock_t start;\n \tunsigned int us = 389;\n\n \tcout << \"Creating Alarm Clock\" << endl;\n \tAlarmClock<microseconds> alerter(us);\n \tboost::this_thread::sleep_for(boost::chrono::microseconds(20));\n \tcout << \"Starting clock and resetting\" << endl;\n \tstart = clock();\n \talerter.Reset();\n \tclock_t reset_time = (clock() - start) \/ (double) (CLOCKS_PER_SEC\/1000);\n\n \tcout << \"Waiting for the clock to expire\" << endl;\n \tWaitForAlarmClockToExpire(alerter);\n\n \tcout << \"Time: \" << reset_time << \" ms\" << endl;\n}<|endoftext|>"} {"text":"<commit_before><commit_msg>cppcheck: variableScope<commit_after><|endoftext|>"} {"text":"<commit_before>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n#ifndef KVSTORE_HH\n#define KVSTORE_HH 1\n\n#include <map>\n#include <string>\n#include <utility>\n\n#include <cstring>\n\n#include \"stats.hh\"\n#include \"item.hh\"\n#include \"queueditem.hh\"\n\n\/**\n * Result of database mutation operations.\n *\n * This is a pair where .first is the number of rows affected, and\n * .second is the ID that was generated (if any). .second will be 0\n * on updates (not generating an ID).\n *\n * .first will be -1 if there was an error performing the update.\n *\n * .first will be 0 if the update did not error, but did not occur.\n * This would generally be considered a fatal condition (in practice,\n * it requires you to be firing an update at a missing rowid).\n *\/\ntypedef std::pair<int, int64_t> mutation_result;\n\nstruct vbucket_state {\n vbucket_state_t state;\n uint64_t checkpointId;\n};\n\n\/**\n * Type of vbucket map.\n *\n * key.first is the vbucket identifier.\n * key.second is the vbucket version\n * value is a pair of string representation of the vbucket state and\n * its latest checkpoint Id persisted.\n *\/\ntypedef std::map<std::pair<uint16_t, uint16_t>, vbucket_state> vbucket_map_t;\n\n\/**\n * Properites of the storage layer.\n *\n * If concurrent filesystem access is possible, maxConcurrency() will\n * be greater than one. One will need to determine whether more than\n * one writer is possible as well as whether more than one reader is\n * possible.\n *\/\nclass StorageProperties {\npublic:\n\n StorageProperties(size_t c, size_t r, size_t w, bool evb, bool evd)\n : maxc(c), maxr(r), maxw(w), efficientVBDump(evb),\n efficientVBDeletion(evd) {}\n\n \/\/! The maximum number of active queries.\n size_t maxConcurrency() const { return maxc; }\n \/\/! Maximum number of active read-only connections.\n size_t maxReaders() const { return maxr; }\n \/\/! Maximum number of active connections for read and write.\n size_t maxWriters() const { return maxw; }\n \/\/! True if we can efficiently dump a single vbucket.\n bool hasEfficientVBDump() const { return efficientVBDump; }\n \/\/! True if we can efficiently delete a vbucket all at once.\n bool hasEfficientVBDeletion() const { return efficientVBDeletion; }\n\nprivate:\n size_t maxc;\n size_t maxr;\n size_t maxw;\n bool efficientVBDump;\n bool efficientVBDeletion;\n};\n\n\/**\n * Database strategy\n *\/\nenum db_type {\n single_db, \/\/!< single database strategy\n multi_db, \/\/!< multi-database strategy\n single_mt_db, \/\/!< single database, multi-table strategy\n multi_mt_db, \/\/!< multi-database, multi-table strategy\n multi_mt_vb_db \/\/!< multi-db, multi-table strategy sharded by vbucket\n};\n\n\/**\n * Base class representing kvstore operations.\n *\/\nclass KVStore {\npublic:\n virtual ~KVStore() {}\n\n \/**\n * Allow the kvstore to add extra statistics information\n * back to the client\n * @param prefix prefix to use for the stats\n * @param add_stat the callback function to add statistics\n * @param c the cookie to pass to the callback function\n *\/\n virtual void addStats(const std::string &prefix, ADD_STAT add_stat, const void *c) {\n (void)prefix;\n (void)add_stat;\n (void)c;\n }\n\n \/**\n * Show kvstore specific timing stats.\n *\n * @param prefix prefix to use for the stats\n * @param add_stat the callback function to add statistics\n * @param c the cookie to pass to the callback function\n *\/\n virtual void addTimingStats(const std::string &, ADD_STAT, const void *) {\n }\n\n \/**\n * Reset the store to a clean state.\n *\/\n virtual void reset() = 0;\n\n \/**\n * Begin a transaction (if not already in one).\n *\n * @return false if we cannot begin a transaction\n *\/\n virtual bool begin() = 0;\n\n \/**\n * Commit a transaction (unless not currently in one).\n *\n * @return false if the commit fails\n *\/\n virtual bool commit() = 0;\n\n \/**\n * Rollback the current transaction.\n *\/\n virtual void rollback() = 0;\n\n \/**\n * Get the properties of the underlying storage.\n *\/\n virtual StorageProperties getStorageProperties() = 0;\n\n \/**\n * Set an item into the kv store.\n *\/\n virtual void set(const Item &item, uint16_t vb_version,\n Callback<mutation_result> &cb) = 0;\n\n \/**\n * Get an item from the kv store.\n *\/\n virtual void get(const std::string &key, uint64_t rowid,\n uint16_t vb, uint16_t vbver,\n Callback<GetValue> &cb) = 0;\n\n \/**\n * Delete an item from the kv store.\n *\/\n virtual void del(const Item &itm, uint64_t rowid,\n uint16_t vbver, Callback<int> &cb) = 0;\n\n \/**\n * Bulk delete some versioned records from a vbucket.\n *\/\n virtual bool delVBucket(uint16_t vbucket, uint16_t vb_version) = 0;\n\n \/**\n * Bulk delete some versioned records from a vbucket.\n *\/\n virtual bool delVBucket(uint16_t vbucket, uint16_t vb_version,\n std::pair<int64_t, int64_t> row_range) = 0;\n\n \/**\n * Invoked whenever vbucket states change.\n *\n * @param vbucket the vbucket that was updated\n * @param newState the new state of this vbucket\n *\/\n virtual void vbStateChanged(uint16_t vbucket, vbucket_state_t newState) {\n (void)vbucket; (void)newState;\n }\n\n \/**\n * Get a list of all persisted vbuckets (with their versions and states).\n *\/\n virtual vbucket_map_t listPersistedVbuckets(void) = 0;\n\n \/**\n * Persist a snapshot of a collection of stats.\n *\/\n virtual bool snapshotStats(const std::map<std::string, std::string> &m) = 0;\n\n \/**\n * Snapshot vbucket states.\n *\/\n virtual bool snapshotVBuckets(const vbucket_map_t &m) = 0;\n\n \/**\n * Pass all stored data through the given callback.\n *\/\n virtual void dump(shared_ptr<Callback<GetValue> > cb) = 0;\n\n \/**\n * Pass all stored data for the given vbucket through the given\n * callback.\n *\/\n virtual void dump(uint16_t vbid, shared_ptr<Callback<GetValue> > cb) = 0;\n\n \/**\n * Check if the kv-store supports a dumping all of the keys\n * @return true you may call dumpKeys() to do a prefetch\n * of the keys\n *\/\n virtual bool isKeyDumpSupported() {\n return false;\n }\n\n \/**\n * Dump the keys from a given set of vbuckets\n * @param vbids the vbuckets to dump\n * @param cb the callback to fire for each document\n *\/\n virtual void dumpKeys(const std::vector<uint16_t> &vbids, shared_ptr<Callback<GetValue> > cb) {\n (void)vbids; (void)cb;\n throw std::runtime_error(\"Unsupported operation\");\n }\n\n \/**\n * Get the number of data shards in this kvstore.\n *\/\n virtual size_t getNumShards() {\n return 1;\n }\n\n \/**\n * get the shard ID for the given queued item.\n *\/\n virtual size_t getShardId(const QueuedItem &i) {\n (void)i;\n return 0;\n }\n\n \/**\n * This method is called before persisting a batch of data if you'd like to\n * do stuff to them that might improve performance at the IO layer.\n *\/\n virtual void optimizeWrites(std::vector<queued_item> &items) {\n (void)items;\n \/\/ EMPTY\n }\n\n virtual void processTxnSizeChange(size_t txn_size) {\n (void)txn_size;\n }\n\n virtual void setVBBatchCount(size_t batch_count) {\n (void)batch_count;\n }\n\n \/**\n * Remove invalid vbuckets from the underlying storage engine.\n * @param destroyOnlyOne True if this run should remove only one invalid vbucket.\n * This can be set to true if we want to delete all invalid vbuckets over the time.\n *\/\n virtual void destroyInvalidVBuckets(bool destroyOnlyOne = false) = 0;\n\n};\n\n\/**\n * The KVStoreFactory creates the correct KVStore instance(s) when\n * needed by EPStore.\n *\/\nclass KVStoreFactory {\npublic:\n\n \/**\n * Create a KVStore with the given properties.\n *\n * @param type the type of DB to set up\n * @param stats the server stats\n * @param conf type-specific parameters\n *\/\n static KVStore *create(EventuallyPersistentEngine &theEngine);\n};\n\n#endif \/\/ KVSTORE_HH\n<commit_msg>Improve error message in exception<commit_after>\/* -*- Mode: C++; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- *\/\n#ifndef KVSTORE_HH\n#define KVSTORE_HH 1\n\n#include <map>\n#include <string>\n#include <utility>\n\n#include <cstring>\n\n#include \"stats.hh\"\n#include \"item.hh\"\n#include \"queueditem.hh\"\n\n\/**\n * Result of database mutation operations.\n *\n * This is a pair where .first is the number of rows affected, and\n * .second is the ID that was generated (if any). .second will be 0\n * on updates (not generating an ID).\n *\n * .first will be -1 if there was an error performing the update.\n *\n * .first will be 0 if the update did not error, but did not occur.\n * This would generally be considered a fatal condition (in practice,\n * it requires you to be firing an update at a missing rowid).\n *\/\ntypedef std::pair<int, int64_t> mutation_result;\n\nstruct vbucket_state {\n vbucket_state_t state;\n uint64_t checkpointId;\n};\n\n\/**\n * Type of vbucket map.\n *\n * key.first is the vbucket identifier.\n * key.second is the vbucket version\n * value is a pair of string representation of the vbucket state and\n * its latest checkpoint Id persisted.\n *\/\ntypedef std::map<std::pair<uint16_t, uint16_t>, vbucket_state> vbucket_map_t;\n\n\/**\n * Properites of the storage layer.\n *\n * If concurrent filesystem access is possible, maxConcurrency() will\n * be greater than one. One will need to determine whether more than\n * one writer is possible as well as whether more than one reader is\n * possible.\n *\/\nclass StorageProperties {\npublic:\n\n StorageProperties(size_t c, size_t r, size_t w, bool evb, bool evd)\n : maxc(c), maxr(r), maxw(w), efficientVBDump(evb),\n efficientVBDeletion(evd) {}\n\n \/\/! The maximum number of active queries.\n size_t maxConcurrency() const { return maxc; }\n \/\/! Maximum number of active read-only connections.\n size_t maxReaders() const { return maxr; }\n \/\/! Maximum number of active connections for read and write.\n size_t maxWriters() const { return maxw; }\n \/\/! True if we can efficiently dump a single vbucket.\n bool hasEfficientVBDump() const { return efficientVBDump; }\n \/\/! True if we can efficiently delete a vbucket all at once.\n bool hasEfficientVBDeletion() const { return efficientVBDeletion; }\n\nprivate:\n size_t maxc;\n size_t maxr;\n size_t maxw;\n bool efficientVBDump;\n bool efficientVBDeletion;\n};\n\n\/**\n * Database strategy\n *\/\nenum db_type {\n single_db, \/\/!< single database strategy\n multi_db, \/\/!< multi-database strategy\n single_mt_db, \/\/!< single database, multi-table strategy\n multi_mt_db, \/\/!< multi-database, multi-table strategy\n multi_mt_vb_db \/\/!< multi-db, multi-table strategy sharded by vbucket\n};\n\n\/**\n * Base class representing kvstore operations.\n *\/\nclass KVStore {\npublic:\n virtual ~KVStore() {}\n\n \/**\n * Allow the kvstore to add extra statistics information\n * back to the client\n * @param prefix prefix to use for the stats\n * @param add_stat the callback function to add statistics\n * @param c the cookie to pass to the callback function\n *\/\n virtual void addStats(const std::string &prefix, ADD_STAT add_stat, const void *c) {\n (void)prefix;\n (void)add_stat;\n (void)c;\n }\n\n \/**\n * Show kvstore specific timing stats.\n *\n * @param prefix prefix to use for the stats\n * @param add_stat the callback function to add statistics\n * @param c the cookie to pass to the callback function\n *\/\n virtual void addTimingStats(const std::string &, ADD_STAT, const void *) {\n }\n\n \/**\n * Reset the store to a clean state.\n *\/\n virtual void reset() = 0;\n\n \/**\n * Begin a transaction (if not already in one).\n *\n * @return false if we cannot begin a transaction\n *\/\n virtual bool begin() = 0;\n\n \/**\n * Commit a transaction (unless not currently in one).\n *\n * @return false if the commit fails\n *\/\n virtual bool commit() = 0;\n\n \/**\n * Rollback the current transaction.\n *\/\n virtual void rollback() = 0;\n\n \/**\n * Get the properties of the underlying storage.\n *\/\n virtual StorageProperties getStorageProperties() = 0;\n\n \/**\n * Set an item into the kv store.\n *\/\n virtual void set(const Item &item, uint16_t vb_version,\n Callback<mutation_result> &cb) = 0;\n\n \/**\n * Get an item from the kv store.\n *\/\n virtual void get(const std::string &key, uint64_t rowid,\n uint16_t vb, uint16_t vbver,\n Callback<GetValue> &cb) = 0;\n\n \/**\n * Delete an item from the kv store.\n *\/\n virtual void del(const Item &itm, uint64_t rowid,\n uint16_t vbver, Callback<int> &cb) = 0;\n\n \/**\n * Bulk delete some versioned records from a vbucket.\n *\/\n virtual bool delVBucket(uint16_t vbucket, uint16_t vb_version) = 0;\n\n \/**\n * Bulk delete some versioned records from a vbucket.\n *\/\n virtual bool delVBucket(uint16_t vbucket, uint16_t vb_version,\n std::pair<int64_t, int64_t> row_range) = 0;\n\n \/**\n * Invoked whenever vbucket states change.\n *\n * @param vbucket the vbucket that was updated\n * @param newState the new state of this vbucket\n *\/\n virtual void vbStateChanged(uint16_t vbucket, vbucket_state_t newState) {\n (void)vbucket; (void)newState;\n }\n\n \/**\n * Get a list of all persisted vbuckets (with their versions and states).\n *\/\n virtual vbucket_map_t listPersistedVbuckets(void) = 0;\n\n \/**\n * Persist a snapshot of a collection of stats.\n *\/\n virtual bool snapshotStats(const std::map<std::string, std::string> &m) = 0;\n\n \/**\n * Snapshot vbucket states.\n *\/\n virtual bool snapshotVBuckets(const vbucket_map_t &m) = 0;\n\n \/**\n * Pass all stored data through the given callback.\n *\/\n virtual void dump(shared_ptr<Callback<GetValue> > cb) = 0;\n\n \/**\n * Pass all stored data for the given vbucket through the given\n * callback.\n *\/\n virtual void dump(uint16_t vbid, shared_ptr<Callback<GetValue> > cb) = 0;\n\n \/**\n * Check if the kv-store supports a dumping all of the keys\n * @return true you may call dumpKeys() to do a prefetch\n * of the keys\n *\/\n virtual bool isKeyDumpSupported() {\n return false;\n }\n\n \/**\n * Dump the keys from a given set of vbuckets\n * @param vbids the vbuckets to dump\n * @param cb the callback to fire for each document\n *\/\n virtual void dumpKeys(const std::vector<uint16_t> &vbids, shared_ptr<Callback<GetValue> > cb) {\n (void)vbids; (void)cb;\n throw std::runtime_error(\"Backed does not support dumpKeys()\");\n }\n\n \/**\n * Get the number of data shards in this kvstore.\n *\/\n virtual size_t getNumShards() {\n return 1;\n }\n\n \/**\n * get the shard ID for the given queued item.\n *\/\n virtual size_t getShardId(const QueuedItem &i) {\n (void)i;\n return 0;\n }\n\n \/**\n * This method is called before persisting a batch of data if you'd like to\n * do stuff to them that might improve performance at the IO layer.\n *\/\n virtual void optimizeWrites(std::vector<queued_item> &items) {\n (void)items;\n \/\/ EMPTY\n }\n\n virtual void processTxnSizeChange(size_t txn_size) {\n (void)txn_size;\n }\n\n virtual void setVBBatchCount(size_t batch_count) {\n (void)batch_count;\n }\n\n \/**\n * Remove invalid vbuckets from the underlying storage engine.\n * @param destroyOnlyOne True if this run should remove only one invalid vbucket.\n * This can be set to true if we want to delete all invalid vbuckets over the time.\n *\/\n virtual void destroyInvalidVBuckets(bool destroyOnlyOne = false) = 0;\n\n};\n\n\/**\n * The KVStoreFactory creates the correct KVStore instance(s) when\n * needed by EPStore.\n *\/\nclass KVStoreFactory {\npublic:\n\n \/**\n * Create a KVStore with the given properties.\n *\n * @param type the type of DB to set up\n * @param stats the server stats\n * @param conf type-specific parameters\n *\/\n static KVStore *create(EventuallyPersistentEngine &theEngine);\n};\n\n#endif \/\/ KVSTORE_HH\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2003-2007 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use. Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n * Director of Intellectual Property Licensing\n * Office of Strategy and Technology\n * Hewlett-Packard Company\n * 1501 Page Mill Road\n * Palo Alto, California 94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer. Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution. Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission. No right of\n * sublicense is granted herewith. Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses. Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#include \"arch\/x86\/faults.hh\"\n#include \"base\/trace.hh\"\n#include \"config\/full_system.hh\"\n#include \"cpu\/thread_context.hh\"\n#if !FULL_SYSTEM\n#include \"arch\/x86\/isa_traits.hh\"\n#include \"mem\/page_table.hh\"\n#include \"sim\/process.hh\"\n#endif\n\nnamespace X86ISA\n{\n#if FULL_SYSTEM\n void X86Trap::invoke(TheeadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n\n void X86Abort::invoke(TheeadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n\n void X86Interrupt::invoke(TheeadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n#else \/\/ !FULL_SYSTEM\n void FakeITLBFault::invoke(ThreadContext * tc)\n {\n DPRINTF(TLB, \"Invoking an ITLB fault for address %#x at pc %#x.\\n\",\n vaddr, tc->readPC());\n Process *p = tc->getProcessPtr();\n Addr paddr;\n bool success = p->pTable->translate(vaddr, paddr);\n if(!success) {\n panic(\"Tried to execute unmapped address %#x.\\n\", vaddr);\n } else {\n TlbEntry entry;\n entry.pageStart = p->pTable->pageAlign(paddr);\n entry.writeable = false;\n entry.user = true;\n entry.uncacheable = false;\n entry.global = false;\n entry.patBit = 0;\n entry.noExec = false;\n entry.size = PageBytes;\n Addr alignedVaddr = p->pTable->pageAlign(vaddr);\n DPRINTF(TLB, \"Mapping %#x to %#x\\n\", alignedVaddr, entry.pageStart);\n tc->getITBPtr()->insert(alignedVaddr, entry);\n }\n }\n\n void FakeDTLBFault::invoke(ThreadContext * tc)\n {\n DPRINTF(TLB, \"Invoking an DTLB fault for address %#x at pc %#x.\\n\",\n vaddr, tc->readPC());\n Process *p = tc->getProcessPtr();\n Addr paddr;\n bool success = p->pTable->translate(vaddr, paddr);\n if(!success) {\n p->checkAndAllocNextPage(vaddr);\n success = p->pTable->translate(vaddr, paddr);\n }\n if(!success) {\n panic(\"Tried to access unmapped address %#x.\\n\", vaddr);\n } else {\n TlbEntry entry;\n entry.pageStart = p->pTable->pageAlign(paddr);\n entry.writeable = true;\n entry.user = true;\n entry.uncacheable = false;\n entry.global = false;\n entry.patBit = 0;\n entry.noExec = true;\n entry.size = PageBytes;\n Addr alignedVaddr = p->pTable->pageAlign(vaddr);\n DPRINTF(TLB, \"Mapping %#x to %#x\\n\", alignedVaddr, entry.pageStart);\n tc->getDTBPtr()->insert(alignedVaddr, entry);\n }\n }\n#endif\n} \/\/ namespace X86ISA\n\n<commit_msg>X86: X86 FS compile fix.<commit_after>\/*\n * Copyright (c) 2003-2007 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n\/*\n * Copyright (c) 2007 The Hewlett-Packard Development Company\n * All rights reserved.\n *\n * Redistribution and use of this software in source and binary forms,\n * with or without modification, are permitted provided that the\n * following conditions are met:\n *\n * The software must be used only for Non-Commercial Use which means any\n * use which is NOT directed to receiving any direct monetary\n * compensation for, or commercial advantage from such use. Illustrative\n * examples of non-commercial use are academic research, personal study,\n * teaching, education and corporate research & development.\n * Illustrative examples of commercial use are distributing products for\n * commercial advantage and providing services using the software for\n * commercial advantage.\n *\n * If you wish to use this software or functionality therein that may be\n * covered by patents for commercial use, please contact:\n * Director of Intellectual Property Licensing\n * Office of Strategy and Technology\n * Hewlett-Packard Company\n * 1501 Page Mill Road\n * Palo Alto, California 94304\n *\n * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer. Redistributions\n * in binary form must reproduce the above copyright notice, this list of\n * conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution. Neither the name of\n * the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission. No right of\n * sublicense is granted herewith. Derivatives of the software and\n * output created using the software may be prepared, but only for\n * Non-Commercial Uses. Derivatives of the software may be shared with\n * others provided: (i) the others agree to abide by the list of\n * conditions herein which includes the Non-Commercial Use restrictions;\n * and (ii) such Derivatives of the software include the above copyright\n * notice to acknowledge the contribution from this software where\n * applicable, this list of conditions and the disclaimer below.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * Authors: Gabe Black\n *\/\n\n#include \"arch\/x86\/faults.hh\"\n#include \"base\/trace.hh\"\n#include \"config\/full_system.hh\"\n#include \"cpu\/thread_context.hh\"\n#if !FULL_SYSTEM\n#include \"arch\/x86\/isa_traits.hh\"\n#include \"mem\/page_table.hh\"\n#include \"sim\/process.hh\"\n#endif\n\nnamespace X86ISA\n{\n#if FULL_SYSTEM\n void X86Trap::invoke(ThreadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n\n void X86Abort::invoke(ThreadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n\n void X86Interrupt::invoke(ThreadContext * tc)\n {\n panic(\"X86 faults are not implemented!\");\n }\n#else \/\/ !FULL_SYSTEM\n void FakeITLBFault::invoke(ThreadContext * tc)\n {\n DPRINTF(TLB, \"Invoking an ITLB fault for address %#x at pc %#x.\\n\",\n vaddr, tc->readPC());\n Process *p = tc->getProcessPtr();\n Addr paddr;\n bool success = p->pTable->translate(vaddr, paddr);\n if(!success) {\n panic(\"Tried to execute unmapped address %#x.\\n\", vaddr);\n } else {\n TlbEntry entry;\n entry.pageStart = p->pTable->pageAlign(paddr);\n entry.writeable = false;\n entry.user = true;\n entry.uncacheable = false;\n entry.global = false;\n entry.patBit = 0;\n entry.noExec = false;\n entry.size = PageBytes;\n Addr alignedVaddr = p->pTable->pageAlign(vaddr);\n DPRINTF(TLB, \"Mapping %#x to %#x\\n\", alignedVaddr, entry.pageStart);\n tc->getITBPtr()->insert(alignedVaddr, entry);\n }\n }\n\n void FakeDTLBFault::invoke(ThreadContext * tc)\n {\n DPRINTF(TLB, \"Invoking an DTLB fault for address %#x at pc %#x.\\n\",\n vaddr, tc->readPC());\n Process *p = tc->getProcessPtr();\n Addr paddr;\n bool success = p->pTable->translate(vaddr, paddr);\n if(!success) {\n p->checkAndAllocNextPage(vaddr);\n success = p->pTable->translate(vaddr, paddr);\n }\n if(!success) {\n panic(\"Tried to access unmapped address %#x.\\n\", vaddr);\n } else {\n TlbEntry entry;\n entry.pageStart = p->pTable->pageAlign(paddr);\n entry.writeable = true;\n entry.user = true;\n entry.uncacheable = false;\n entry.global = false;\n entry.patBit = 0;\n entry.noExec = true;\n entry.size = PageBytes;\n Addr alignedVaddr = p->pTable->pageAlign(vaddr);\n DPRINTF(TLB, \"Mapping %#x to %#x\\n\", alignedVaddr, entry.pageStart);\n tc->getDTBPtr()->insert(alignedVaddr, entry);\n }\n }\n#endif\n} \/\/ namespace X86ISA\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2013-2014 Jose Fonseca\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\n#include \"tap.h\"\n\n#include <stdlib.h>\n\n#include <windows.h>\n#include <dbghelp.h>\n\n\nstatic bool\ncomparePath(const char *s1, const char *s2)\n{\n while (true) {\n char c1 = *s1++;\n char c2 = *s2++;\n if (c1 == '\/') {\n c1 = '\\\\';\n }\n if (c2 == '\/') {\n c2 = '\\\\';\n }\n if (c2 != c1) {\n return false;\n }\n if (c1 == 0) {\n return true;\n }\n }\n}\n\n\nstatic void\ncheckSym(HANDLE hProcess,\n PVOID pvSymbol,\n const char *szSymbolName)\n{\n bool ok;\n\n DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;\n\n \/\/ Test SymFromAddr\n DWORD64 Displacement = 0;\n struct {\n SYMBOL_INFO Symbol;\n CHAR Name[256];\n } s;\n memset(&s, 0, sizeof s);\n s.Symbol.SizeOfStruct = sizeof s.Symbol;\n s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;\n ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);\n test_line(ok, \"SymFromAddr(&%s)\", szSymbolName);\n if (!ok) {\n test_diagnostic_last_error();\n } else {\n ok = strcmp(s.Symbol.Name, szSymbolName) == 0;\n test_line(ok, \"SymFromAddr(&%s).Name\", szSymbolName);\n if (!ok) {\n test_diagnostic(\"Name = \\\"%s\\\" != \\\"%s\\\"\",\n s.Symbol.Name, szSymbolName);\n }\n }\n}\n\n\nstatic void\ncheckSymLine(HANDLE hProcess,\n PVOID pvSymbol,\n const char *szSymbolName,\n const char *szFileName,\n DWORD dwLineNumber)\n{\n bool ok;\n\n DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;\n\n checkSym(hProcess, pvSymbol, szSymbolName);\n\n \/\/ Test SymGetLineFromAddr64\n DWORD dwDisplacement;\n IMAGEHLP_LINE64 Line;\n ZeroMemory(&Line, sizeof Line);\n Line.SizeOfStruct = sizeof Line;\n ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);\n test_line(ok, \"SymGetLineFromAddr64(&%s)\", szSymbolName);\n if (!ok) {\n test_diagnostic_last_error();\n } else {\n ok = comparePath(Line.FileName, szFileName);\n test_line(ok, \"SymGetLineFromAddr64(&%s).FileName\", szSymbolName);\n if (!ok) {\n test_diagnostic(\"FileName = \\\"%s\\\" != \\\"%s\\\"\",\n Line.FileName, szFileName);\n }\n ok = Line.LineNumber == dwLineNumber;\n test_line(ok, \"SymGetLineFromAddr64(&%s).LineNumber\", szSymbolName);\n if (Line.LineNumber != dwLineNumber) {\n test_diagnostic(\"LineNumber = %lu != %lu\",\n Line.LineNumber, dwLineNumber);\n }\n }\n}\n\n\nstatic void\n __attribute__ ((noinline))\ncheckCaller(HANDLE hProcess,\n const char *szSymbolName,\n const char *szFileName,\n DWORD dwLineNumber)\n{\n void *addr = __builtin_return_address(0);\n checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber);\n}\n\n\nstatic void\ncheckExport(HANDLE hProcess,\n const char *szModuleName,\n const char *szSymbolName)\n{\n HMODULE hModule = GetModuleHandleA(szModuleName);\n const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);\n checkSym(hProcess, pvSymbol, szSymbolName);\n}\n\n\n\nstatic const DWORD foo_line = __LINE__; static int foo(int a, int b) {\n return a * b;\n}\n\n\n#define LINE_BARRIER rand();\n\n\nint\nmain()\n{\n HANDLE hProcess = GetCurrentProcess();\n bool ok;\n\n ok = SymInitialize(hProcess, \"\", TRUE);\n test_line(ok, \"SymInitialize()\");\n if (!ok) {\n test_diagnostic_last_error();\n } {\n checkSymLine(hProcess, (PVOID)&foo, \"foo\", __FILE__, foo_line);\n\n checkCaller(hProcess, \"main\", __FILE__, __LINE__); LINE_BARRIER\n\n \/\/ Test DbgHelp fallback\n checkExport(hProcess, \"kernel32\", \"Sleep\");\n\n ok = SymCleanup(hProcess);\n test_line(ok, \"SymCleanup()\");\n if (!ok) {\n test_diagnostic_last_error();\n }\n }\n\n test_exit();\n}\n<commit_msg>tests: Check MgwHelp.dll exports.<commit_after>\/*\n * Copyright 2013-2014 Jose Fonseca\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\n#include \"tap.h\"\n\n#include <assert.h>\n#include <stdlib.h>\n\n#include <windows.h>\n#include <dbghelp.h>\n\n\nstatic bool\ncomparePath(const char *s1, const char *s2)\n{\n while (true) {\n char c1 = *s1++;\n char c2 = *s2++;\n if (c1 == '\/') {\n c1 = '\\\\';\n }\n if (c2 == '\/') {\n c2 = '\\\\';\n }\n if (c2 != c1) {\n return false;\n }\n if (c1 == 0) {\n return true;\n }\n }\n}\n\n\nstatic void\ncheckSym(HANDLE hProcess,\n PVOID pvSymbol,\n const char *szSymbolName)\n{\n bool ok;\n\n DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;\n\n \/\/ Test SymFromAddr\n DWORD64 Displacement = 0;\n struct {\n SYMBOL_INFO Symbol;\n CHAR Name[256];\n } s;\n memset(&s, 0, sizeof s);\n s.Symbol.SizeOfStruct = sizeof s.Symbol;\n s.Symbol.MaxNameLen = sizeof s.Symbol.Name + sizeof s.Name;\n ok = SymFromAddr(hProcess, dwAddr, &Displacement, &s.Symbol);\n test_line(ok, \"SymFromAddr(&%s)\", szSymbolName);\n if (!ok) {\n test_diagnostic_last_error();\n } else {\n ok = strcmp(s.Symbol.Name, szSymbolName) == 0;\n test_line(ok, \"SymFromAddr(&%s).Name\", szSymbolName);\n if (!ok) {\n test_diagnostic(\"Name = \\\"%s\\\" != \\\"%s\\\"\",\n s.Symbol.Name, szSymbolName);\n }\n }\n}\n\n\nstatic void\ncheckSymLine(HANDLE hProcess,\n PVOID pvSymbol,\n const char *szSymbolName,\n const char *szFileName,\n DWORD dwLineNumber)\n{\n bool ok;\n\n DWORD64 dwAddr = (DWORD64)(UINT_PTR)pvSymbol;\n\n checkSym(hProcess, pvSymbol, szSymbolName);\n\n \/\/ Test SymGetLineFromAddr64\n DWORD dwDisplacement;\n IMAGEHLP_LINE64 Line;\n ZeroMemory(&Line, sizeof Line);\n Line.SizeOfStruct = sizeof Line;\n ok = SymGetLineFromAddr64(hProcess, dwAddr, &dwDisplacement, &Line);\n test_line(ok, \"SymGetLineFromAddr64(&%s)\", szSymbolName);\n if (!ok) {\n test_diagnostic_last_error();\n } else {\n ok = comparePath(Line.FileName, szFileName);\n test_line(ok, \"SymGetLineFromAddr64(&%s).FileName\", szSymbolName);\n if (!ok) {\n test_diagnostic(\"FileName = \\\"%s\\\" != \\\"%s\\\"\",\n Line.FileName, szFileName);\n }\n ok = Line.LineNumber == dwLineNumber;\n test_line(ok, \"SymGetLineFromAddr64(&%s).LineNumber\", szSymbolName);\n if (Line.LineNumber != dwLineNumber) {\n test_diagnostic(\"LineNumber = %lu != %lu\",\n Line.LineNumber, dwLineNumber);\n }\n }\n}\n\n\nstatic void\n __attribute__ ((noinline))\ncheckCaller(HANDLE hProcess,\n const char *szSymbolName,\n const char *szFileName,\n DWORD dwLineNumber)\n{\n void *addr = __builtin_return_address(0);\n checkSymLine(hProcess, addr, szSymbolName, szFileName, dwLineNumber);\n}\n\n\nstatic void\ncheckExport(HANDLE hProcess,\n const char *szModuleName,\n const char *szSymbolName)\n{\n HMODULE hModule = GetModuleHandleA(szModuleName);\n const PVOID pvSymbol = (PVOID)GetProcAddress(hModule, szSymbolName);\n checkSym(hProcess, pvSymbol, szSymbolName);\n}\n\n\n\nstatic const DWORD foo_line = __LINE__; static int foo(int a, int b) {\n return a * b;\n}\n\n\n#define LINE_BARRIER rand();\n\n\nint\nmain()\n{\n HANDLE hProcess = GetCurrentProcess();\n bool ok;\n\n HMODULE hMgwHelpDll = GetModuleHandleA(\"mgwhelp.dll\");\n if (!hMgwHelpDll) {\n test_line(false, \"GetModuleHandleA(\\\"mgwhelp.dll\\\")\");\n } else {\n test_line(GetProcAddress(hMgwHelpDll, \"SymGetOptions\") != NULL, \"GetProcAddress(\\\"SymGetOptions\\\")\");\n test_line(GetProcAddress(hMgwHelpDll, \"SymGetOptions@0\") == NULL, \"!GetProcAddress(\\\"SymGetOptions\\\")\");\n }\n\n ok = SymInitialize(hProcess, \"\", TRUE);\n test_line(ok, \"SymInitialize()\");\n if (!ok) {\n test_diagnostic_last_error();\n } {\n checkSymLine(hProcess, (PVOID)&foo, \"foo\", __FILE__, foo_line);\n\n checkCaller(hProcess, \"main\", __FILE__, __LINE__); LINE_BARRIER\n\n \/\/ Test DbgHelp fallback\n checkExport(hProcess, \"kernel32\", \"Sleep\");\n\n ok = SymCleanup(hProcess);\n test_line(ok, \"SymCleanup()\");\n if (!ok) {\n test_diagnostic_last_error();\n }\n }\n\n test_exit();\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef MCMC_BAS_UTIL\n#define MCMC_BAS_UTIL\n#define OPT_HEADER\n#include \"mcmc_traits.hpp\"\n#include <algorithm>\n#include <limits>\n#include \"distribution.hpp\"\nnamespace mcmc_utilities\n{\n template <typename T_p,typename T_var>\n struct dist_adapter\n {\n T_var xl,xr;\n const probability_density_1d<T_p,T_var>* ppd;\n\n T_p operator()(const T_var& x)const\n {\n\tif(x<=xl||x>=xr)\n\t {\n\t return std::numeric_limits<T_p>::max();\n\t }\n\treturn -(ppd->eval_log(x));\n }\n };\n \n template <typename T>\n T sqr(T x)\n {\n return x*x;\n }\n \n \n template <typename T>\n void shft3(T&a,T& b,T& c,T d)\n {\n mcmc_assign(a,b);\n mcmc_assign(b,c);\n mcmc_assign(c,d);\n }\n\n template <typename T>\n void shft(T& a,T& b,T& c,T d)\n {\n mcmc_assign(a,b);\n mcmc_assign(b,c);\n mcmc_assign(c,d);\n }\n \/\/ template <typename T> \n \/\/ void swap(T& ax,T& bx)\n \/\/{\n \/\/ swap(ax,bx);\n \/\/ T temp;\n \/\/mcmc_assign(temp,ax);\n \/\/mcmc_assign(ax,bx);\n \/\/mcmc_assign(bx,temp);\n \/\/}\n \n template <typename T>\n T sign(const T& a,const T& b)\n {\n return b>=0?T(a>=0?T(a):T(-a)):T(a>=0?T(-a):T(a));\n }\n\n\n template <typename T>\n void mov3(T& a,T& b,T& c, T& d,T& e,T& f)\n {\n mcmc_assign(a,d);mcmc_assign(b,e);mcmc_assign(c,f);\n }\n}\n\n#endif\n<commit_msg>\t修改： core\/bas_util.hpp<commit_after>#ifndef MCMC_BAS_UTIL\n#define MCMC_BAS_UTIL\n#define OPT_HEADER\n#include \"mcmc_traits.hpp\"\n#include <algorithm>\n#include <limits>\n#include \"distribution.hpp\"\nnamespace mcmc_utilities\n{\n template <typename T_p,typename T_var>\n struct dist_adapter\n {\n T_var xl,xr;\n const probability_density_1d<T_p,T_var>* ppd;\n\n T_p operator()(const T_var& x)const\n {\n\tif(x<=xl||x>=xr)\n\t {\n\t return std::numeric_limits<T_p>::max();\n\t }\n\treturn -(ppd->eval_log(x));\n }\n };\n \n template <typename T>\n T sqr(T x)\n {\n return x*x;\n }\n \n \n template <typename T>\n void shft3(T&a,T& b,T& c,T d)\n {\n mcmc_assign(a,b);\n mcmc_assign(b,c);\n mcmc_assign(c,d);\n }\n\n template <typename T>\n void shft(T& a,T& b,T& c,T d)\n {\n mcmc_assign(a,b);\n mcmc_assign(b,c);\n mcmc_assign(c,d);\n }\n\n template <typename T>\n T sign(const T& a,const T& b)\n {\n return b>=0?T(a>=0?T(a):T(-a)):T(a>=0?T(-a):T(a));\n }\n\n\n template <typename T>\n void mov3(T& a,T& b,T& c, T& d,T& e,T& f)\n {\n mcmc_assign(a,d);mcmc_assign(b,e);mcmc_assign(c,f);\n }\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"httpfake.h\"\n#include \"logging\/logging.h\"\n#include \"primary\/reportqueue.h\"\n#include \"primary\/sotauptaneclient.h\"\n#include \"storage\/invstorage.h\"\n#include \"test_utils.h\"\n#include \"uptane\/tuf.h\"\n#include \"uptane\/uptanerepository.h\"\n#include \"uptane_test_common.h\"\n#include \"utilities\/utils.h\"\n\nnamespace bpo = boost::program_options;\n\nboost::filesystem::path build_dir;\n\n\/**\n * Check that aktualizr generates random ecu_serial for primary and all\n * secondaries.\n *\/\nTEST(Uptane, RandomSerial) {\n RecordProperty(\"zephyr_key\", \"OTA-989,TST-155\");\n \/\/ Make two configs, neither of which specify a primary serial.\n TemporaryDirectory temp_dir1, temp_dir2;\n Config conf_1(\"tests\/config\/basic.toml\");\n conf_1.storage.path = temp_dir1.Path();\n Config conf_2(\"tests\/config\/basic.toml\");\n conf_2.storage.path = temp_dir2.Path();\n\n conf_1.provision.primary_ecu_serial = \"\";\n conf_2.provision.primary_ecu_serial = \"\";\n\n UptaneTestCommon::addDefaultSecondary(conf_1, temp_dir1, \"\", \"secondary_hardware\", false);\n UptaneTestCommon::addDefaultSecondary(conf_2, temp_dir2, \"\", \"secondary_hardware\", false);\n\n \/\/ Initialize.\n auto storage_1 = INvStorage::newStorage(conf_1.storage);\n auto storage_2 = INvStorage::newStorage(conf_2.storage);\n auto http1 = std::make_shared<HttpFake>(temp_dir1.Path());\n auto http2 = std::make_shared<HttpFake>(temp_dir2.Path());\n\n auto uptane_client1 = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf_1, storage_1, http1);\n EXPECT_NO_THROW(uptane_client1->initialize());\n\n auto uptane_client2 = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf_2, storage_2, http2);\n EXPECT_NO_THROW(uptane_client2->initialize());\n\n \/\/ Verify that none of the serials match.\n EcuSerials ecu_serials_1;\n EcuSerials ecu_serials_2;\n EXPECT_TRUE(storage_1->loadEcuSerials(&ecu_serials_1));\n EXPECT_TRUE(storage_2->loadEcuSerials(&ecu_serials_2));\n EXPECT_EQ(ecu_serials_1.size(), 2);\n EXPECT_EQ(ecu_serials_2.size(), 2);\n EXPECT_FALSE(ecu_serials_1[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_1[1].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[1].first.ToString().empty());\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_2[0].first);\n EXPECT_NE(ecu_serials_1[1].first, ecu_serials_2[1].first);\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_1[1].first);\n EXPECT_NE(ecu_serials_2[0].first, ecu_serials_2[1].first);\n}\n\n\/**\n * Check that aktualizr saves random ecu_serial for primary and all secondaries.\n *\n * Test with a virtual secondary.\n *\/\nTEST(Uptane, ReloadSerial) {\n RecordProperty(\"zephyr_key\", \"OTA-989,TST-156\");\n TemporaryDirectory temp_dir;\n EcuSerials ecu_serials_1;\n EcuSerials ecu_serials_2;\n\n \/\/ Initialize. Should store new serials.\n {\n Config conf(\"tests\/config\/basic.toml\");\n conf.storage.path = temp_dir.Path();\n conf.provision.primary_ecu_serial = \"\";\n\n auto storage = INvStorage::newStorage(conf.storage);\n auto http = std::make_shared<HttpFake>(temp_dir.Path());\n\n UptaneTestCommon::addDefaultSecondary(conf, temp_dir, \"\", \"secondary_hardware\", false);\n auto uptane_client = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf, storage, http);\n\n EXPECT_NO_THROW(uptane_client->initialize());\n EXPECT_TRUE(storage->loadEcuSerials(&ecu_serials_1));\n EXPECT_EQ(ecu_serials_1.size(), 2);\n EXPECT_FALSE(ecu_serials_1[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_1[1].first.ToString().empty());\n }\n\n \/\/ Keep storage directory, but initialize new objects. Should load existing\n \/\/ serials.\n {\n Config conf(\"tests\/config\/basic.toml\");\n conf.storage.path = temp_dir.Path();\n conf.provision.primary_ecu_serial = \"\";\n\n auto storage = INvStorage::newStorage(conf.storage);\n auto http = std::make_shared<HttpFake>(temp_dir.Path());\n UptaneTestCommon::addDefaultSecondary(conf, temp_dir, \"\", \"secondary_hardware\", false);\n auto uptane_client = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf, storage, http);\n\n EXPECT_NO_THROW(uptane_client->initialize());\n EXPECT_TRUE(storage->loadEcuSerials(&ecu_serials_2));\n EXPECT_EQ(ecu_serials_2.size(), 2);\n EXPECT_FALSE(ecu_serials_2[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[1].first.ToString().empty());\n }\n\n \/\/ Verify that serials match across initializations.\n EXPECT_EQ(ecu_serials_1[0].first, ecu_serials_2[0].first);\n EXPECT_EQ(ecu_serials_1[1].first, ecu_serials_2[1].first);\n \/\/ Sanity check that primary and secondary serials do not match.\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_1[1].first);\n EXPECT_NE(ecu_serials_2[0].first, ecu_serials_2[1].first);\n}\n\n#ifndef __NO_MAIN__\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n logger_set_threshold(boost::log::trivial::trace);\n\n if (argc != 2) {\n std::cerr << \"Error: \" << argv[0] << \" requires the path to the build directory as an input argument.\\n\";\n return EXIT_FAILURE;\n }\n build_dir = argv[1];\n return RUN_ALL_TESTS();\n}\n#endif\n<commit_msg>Tests: change some EXPECT_* to ASSERT_*<commit_after>#include <gtest\/gtest.h>\n\n#include <memory>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <boost\/filesystem.hpp>\n#include <boost\/program_options.hpp>\n\n#include \"httpfake.h\"\n#include \"logging\/logging.h\"\n#include \"primary\/reportqueue.h\"\n#include \"primary\/sotauptaneclient.h\"\n#include \"storage\/invstorage.h\"\n#include \"test_utils.h\"\n#include \"uptane\/tuf.h\"\n#include \"uptane\/uptanerepository.h\"\n#include \"uptane_test_common.h\"\n#include \"utilities\/utils.h\"\n\nnamespace bpo = boost::program_options;\n\nboost::filesystem::path build_dir;\n\n\/**\n * Check that aktualizr generates random ecu_serial for primary and all\n * secondaries.\n *\/\nTEST(Uptane, RandomSerial) {\n RecordProperty(\"zephyr_key\", \"OTA-989,TST-155\");\n \/\/ Make two configs, neither of which specify a primary serial.\n TemporaryDirectory temp_dir1, temp_dir2;\n Config conf_1(\"tests\/config\/basic.toml\");\n conf_1.storage.path = temp_dir1.Path();\n Config conf_2(\"tests\/config\/basic.toml\");\n conf_2.storage.path = temp_dir2.Path();\n\n conf_1.provision.primary_ecu_serial = \"\";\n conf_2.provision.primary_ecu_serial = \"\";\n\n UptaneTestCommon::addDefaultSecondary(conf_1, temp_dir1, \"\", \"secondary_hardware\", false);\n UptaneTestCommon::addDefaultSecondary(conf_2, temp_dir2, \"\", \"secondary_hardware\", false);\n\n \/\/ Initialize.\n auto storage_1 = INvStorage::newStorage(conf_1.storage);\n auto storage_2 = INvStorage::newStorage(conf_2.storage);\n auto http1 = std::make_shared<HttpFake>(temp_dir1.Path());\n auto http2 = std::make_shared<HttpFake>(temp_dir2.Path());\n\n auto uptane_client1 = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf_1, storage_1, http1);\n ASSERT_NO_THROW(uptane_client1->initialize());\n\n auto uptane_client2 = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf_2, storage_2, http2);\n ASSERT_NO_THROW(uptane_client2->initialize());\n\n \/\/ Verify that none of the serials match.\n EcuSerials ecu_serials_1;\n EcuSerials ecu_serials_2;\n ASSERT_TRUE(storage_1->loadEcuSerials(&ecu_serials_1));\n ASSERT_TRUE(storage_2->loadEcuSerials(&ecu_serials_2));\n ASSERT_EQ(ecu_serials_1.size(), 2);\n ASSERT_EQ(ecu_serials_2.size(), 2);\n EXPECT_FALSE(ecu_serials_1[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_1[1].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[1].first.ToString().empty());\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_2[0].first);\n EXPECT_NE(ecu_serials_1[1].first, ecu_serials_2[1].first);\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_1[1].first);\n EXPECT_NE(ecu_serials_2[0].first, ecu_serials_2[1].first);\n}\n\n\/**\n * Check that aktualizr saves random ecu_serial for primary and all secondaries.\n *\n * Test with a virtual secondary.\n *\/\nTEST(Uptane, ReloadSerial) {\n RecordProperty(\"zephyr_key\", \"OTA-989,TST-156\");\n TemporaryDirectory temp_dir;\n EcuSerials ecu_serials_1;\n EcuSerials ecu_serials_2;\n\n \/\/ Initialize. Should store new serials.\n {\n Config conf(\"tests\/config\/basic.toml\");\n conf.storage.path = temp_dir.Path();\n conf.provision.primary_ecu_serial = \"\";\n\n auto storage = INvStorage::newStorage(conf.storage);\n auto http = std::make_shared<HttpFake>(temp_dir.Path());\n\n UptaneTestCommon::addDefaultSecondary(conf, temp_dir, \"\", \"secondary_hardware\", false);\n auto uptane_client = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf, storage, http);\n\n ASSERT_NO_THROW(uptane_client->initialize());\n ASSERT_TRUE(storage->loadEcuSerials(&ecu_serials_1));\n ASSERT_EQ(ecu_serials_1.size(), 2);\n EXPECT_FALSE(ecu_serials_1[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_1[1].first.ToString().empty());\n }\n\n \/\/ Keep storage directory, but initialize new objects. Should load existing\n \/\/ serials.\n {\n Config conf(\"tests\/config\/basic.toml\");\n conf.storage.path = temp_dir.Path();\n conf.provision.primary_ecu_serial = \"\";\n\n auto storage = INvStorage::newStorage(conf.storage);\n auto http = std::make_shared<HttpFake>(temp_dir.Path());\n UptaneTestCommon::addDefaultSecondary(conf, temp_dir, \"\", \"secondary_hardware\", false);\n auto uptane_client = std_::make_unique<UptaneTestCommon::TestUptaneClient>(conf, storage, http);\n\n ASSERT_NO_THROW(uptane_client->initialize());\n ASSERT_TRUE(storage->loadEcuSerials(&ecu_serials_2));\n ASSERT_EQ(ecu_serials_2.size(), 2);\n EXPECT_FALSE(ecu_serials_2[0].first.ToString().empty());\n EXPECT_FALSE(ecu_serials_2[1].first.ToString().empty());\n }\n\n \/\/ Verify that serials match across initializations.\n EXPECT_EQ(ecu_serials_1[0].first, ecu_serials_2[0].first);\n EXPECT_EQ(ecu_serials_1[1].first, ecu_serials_2[1].first);\n \/\/ Sanity check that primary and secondary serials do not match.\n EXPECT_NE(ecu_serials_1[0].first, ecu_serials_1[1].first);\n EXPECT_NE(ecu_serials_2[0].first, ecu_serials_2[1].first);\n}\n\n#ifndef __NO_MAIN__\nint main(int argc, char** argv) {\n ::testing::InitGoogleTest(&argc, argv);\n logger_set_threshold(boost::log::trivial::trace);\n\n if (argc != 2) {\n std::cerr << \"Error: \" << argv[0] << \" requires the path to the build directory as an input argument.\\n\";\n return EXIT_FAILURE;\n }\n build_dir = argv[1];\n return RUN_ALL_TESTS();\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"configcontroller.h\"\n#include \"..\/network\/networkmanager.h\"\n#include \"..\/settings.h\"\n#include \"..\/log\/logger.h\"\n\n#include \"..\/webrequester.h\"\n#include \"..\/network\/requests\/getconfigrequest.h\"\n#include \"..\/timing\/periodictiming.h\"\n#include \"..\/client.h\"\n#include \"..\/timing\/timer.h\"\n\n#include <QPointer>\n\nLOGGER(ConfigController);\n\nclass ConfigController::Private : public QObject\n{\n Q_OBJECT\n\npublic:\n Private(ConfigController *q)\n : q(q)\n {\n connect(&timer, SIGNAL(timeout()), q, SLOT(update()));\n connect(&timer, SIGNAL(timingChanged()), this, SLOT(onTimingChanged()));\n connect(&requester, SIGNAL(statusChanged(WebRequester::Status)), q, SIGNAL(statusChanged()));\n connect(&requester, SIGNAL(finished()), this, SLOT(onFinished()));\n connect(&requester, SIGNAL(error()), this, SLOT(onError()));\n\n request.setPath(\"\/supervisor\/api\/v1\/configuration\/1\/\");\n requester.setRequest(&request);\n }\n\n ConfigController *q;\n\n \/\/ Properties\n QPointer<NetworkManager> networkManager;\n QPointer<Settings> settings;\n\n WebRequester requester;\n GetConfigRequest request;\n GetConfigResponse *response;\n\n Timer timer;\n\n \/\/ Functions\npublic slots:\n void updateTimer();\n void onFinished();\n void onError();\n void onTimingChanged();\n};\n\nvoid ConfigController::Private::updateTimer()\n{\n \/\/ Set the new url\n QString newUrl = QString(\"https:\/\/%1\").arg(settings->config()->configAddress());\n\n if (requester.url() != newUrl)\n {\n LOG_DEBUG(QString(\"Config url set to %1\").arg(newUrl));\n requester.setUrl(newUrl);\n }\n\n TimingPtr timing = settings->config()->configTiming();\n\n if (timing.isNull())\n {\n timing = TimingPtr(new PeriodicTiming(10*60*1000, QDateTime(), QDateTime(), 30*1000));\n }\n\n timer.setTiming(timing);\n timer.start();\n}\n\nvoid ConfigController::Private::onFinished()\n{\n emit q->finished();\n}\n\nvoid ConfigController::Private::onError()\n{\n LOG_ERROR(QString(\"Could not get config from server, trying again later\"));\n}\n\nvoid ConfigController::Private::onTimingChanged()\n{\n LOG_DEBUG(QString(\"Config schedule changed, type: %1, nextRun in %2 seconds.\")\n .arg(timer.timing()->type())\n .arg(timer.timing()->timeLeft() \/ 1000));\n}\n\nConfigController::ConfigController(QObject *parent)\n: Controller(parent)\n, d(new Private(this))\n{\n}\n\nConfigController::~ConfigController()\n{\n delete d;\n}\n\nvoid ConfigController::update()\n{\n d->requester.start();\n}\n\nbool ConfigController::init(NetworkManager *networkManager, Settings *settings)\n{\n d->networkManager = networkManager;\n d->settings = settings;\n\n \/\/ TODO: This is an evil hack\n d->response = settings->config();\n d->requester.setResponse(d->response);\n connect(d->response, SIGNAL(responseChanged()), d, SLOT(updateTimer()));\n\n \/\/ sets the url into the requester and starts the timer\n d->updateTimer();\n\n \/\/ get new config now\n update();\n\n return true;\n}\n\nController::Status ConfigController::status() const\n{\n return (Status)d->requester.status();\n}\n\nQString ConfigController::errorString() const\n{\n return d->requester.errorString();\n}\n\n#include \"configcontroller.moc\"\n<commit_msg>Fixed ConfigController: A timing with invalid nextRun is also invalid.<commit_after>#include \"configcontroller.h\"\n#include \"..\/network\/networkmanager.h\"\n#include \"..\/settings.h\"\n#include \"..\/log\/logger.h\"\n\n#include \"..\/webrequester.h\"\n#include \"..\/network\/requests\/getconfigrequest.h\"\n#include \"..\/timing\/periodictiming.h\"\n#include \"..\/client.h\"\n#include \"..\/timing\/timer.h\"\n\n#include <QPointer>\n\nLOGGER(ConfigController);\n\nclass ConfigController::Private : public QObject\n{\n Q_OBJECT\n\npublic:\n Private(ConfigController *q)\n : q(q)\n {\n connect(&timer, SIGNAL(timeout()), q, SLOT(update()));\n connect(&timer, SIGNAL(timingChanged()), this, SLOT(onTimingChanged()));\n connect(&requester, SIGNAL(statusChanged(WebRequester::Status)), q, SIGNAL(statusChanged()));\n connect(&requester, SIGNAL(finished()), this, SLOT(onFinished()));\n connect(&requester, SIGNAL(error()), this, SLOT(onError()));\n\n request.setPath(\"\/supervisor\/api\/v1\/configuration\/1\/\");\n requester.setRequest(&request);\n }\n\n ConfigController *q;\n\n \/\/ Properties\n QPointer<NetworkManager> networkManager;\n QPointer<Settings> settings;\n\n WebRequester requester;\n GetConfigRequest request;\n GetConfigResponse *response;\n\n Timer timer;\n\n \/\/ Functions\npublic slots:\n void updateTimer();\n void onFinished();\n void onError();\n void onTimingChanged();\n};\n\nvoid ConfigController::Private::updateTimer()\n{\n \/\/ Set the new url\n QString newUrl = QString(\"https:\/\/%1\").arg(settings->config()->configAddress());\n\n if (requester.url() != newUrl)\n {\n LOG_DEBUG(QString(\"Config url set to %1\").arg(newUrl));\n requester.setUrl(newUrl);\n }\n\n TimingPtr timing = settings->config()->configTiming();\n\n if (timing.isNull() || !timing->nextRun().isValid())\n {\n timing = TimingPtr(new PeriodicTiming(10*60*1000, QDateTime(), QDateTime(), 30*1000));\n }\n\n timer.setTiming(timing);\n timer.start();\n}\n\nvoid ConfigController::Private::onFinished()\n{\n emit q->finished();\n}\n\nvoid ConfigController::Private::onError()\n{\n LOG_ERROR(QString(\"Could not get config from server, trying again later\"));\n}\n\nvoid ConfigController::Private::onTimingChanged()\n{\n LOG_DEBUG(QString(\"Config schedule changed, type: %1, nextRun in %2 seconds.\")\n .arg(timer.timing()->type())\n .arg(timer.timing()->timeLeft() \/ 1000));\n}\n\nConfigController::ConfigController(QObject *parent)\n: Controller(parent)\n, d(new Private(this))\n{\n}\n\nConfigController::~ConfigController()\n{\n delete d;\n}\n\nvoid ConfigController::update()\n{\n d->requester.start();\n}\n\nbool ConfigController::init(NetworkManager *networkManager, Settings *settings)\n{\n d->networkManager = networkManager;\n d->settings = settings;\n\n \/\/ TODO: This is an evil hack\n d->response = settings->config();\n d->requester.setResponse(d->response);\n connect(d->response, SIGNAL(responseChanged()), d, SLOT(updateTimer()));\n\n \/\/ sets the url into the requester and starts the timer\n d->updateTimer();\n\n \/\/ get new config now\n update();\n\n return true;\n}\n\nController::Status ConfigController::status() const\n{\n return (Status)d->requester.status();\n}\n\nQString ConfigController::errorString() const\n{\n return d->requester.errorString();\n}\n\n#include \"configcontroller.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*************************************\n** Tsunagari Tile Engine **\n** window.cpp **\n** Copyright 2016-2017 Paul Merrill **\n*************************************\/\n\n\/\/ **********\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/ **********\n\n#include \"av\/sdl2\/window.h\"\n\n#include <chrono>\n#include <thread>\n\n#include \"av\/sdl2\/error.h\"\n#include \"core\/client-conf.h\"\n#include \"core\/log.h\"\n#include \"core\/measure.h\"\n#include \"core\/world.h\"\n#include \"util\/optional.h\"\n\n#define CHECK(x) if (!(x)) { return false; }\n\nstatic SDL2GameWindow globalWindow;\n\nGameWindow* GameWindow::create() {\n return globalWindow.init() ? &globalWindow\n : nullptr;\n}\n\nGameWindow& GameWindow::instance() {\n return globalWindow;\n}\n\nSDL2GameWindow& SDL2GameWindow::instance() {\n return globalWindow;\n}\n\ntime_t GameWindow::time() {\n std::chrono::time_point<std::chrono::steady_clock> start = globalWindow.start;\n std::chrono::time_point<std::chrono::steady_clock> end = std::chrono::steady_clock::now();\n return std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();\n}\n\nSDL_Renderer* SDL2GetRenderer() {\n return globalWindow.renderer;\n}\n\n\nSDL2GameWindow::SDL2GameWindow()\n : renderer(nullptr),\n translation(0.0, 0.0),\n scaling(0.0, 0.0),\n window(nullptr),\n transform(Transform::identity()) {}\n\nbool SDL2GameWindow::init() {\n {\n \/\/TimeMeasure m(\"Initializing SDL2\");\n if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_NOPARACHUTE) < 0) {\n sdlDie(\"SDL2GameWindow\", \"SDL_Init\");\n return false;\n }\n }\n\n {\n \/\/TimeMeasure m(\"Created SDL2 window\");\n\n int width = conf.windowSize.x;\n int height = conf.windowSize.y;\n\n Uint32 flags = SDL_WINDOW_HIDDEN;\n if (conf.fullscreen) {\n flags |= SDL_WINDOW_FULLSCREEN;\n }\n\n window = SDL_CreateWindow(\"Tsunagari\",\n SDL_WINDOWPOS_UNDEFINED,\n SDL_WINDOWPOS_UNDEFINED,\n width, height, flags);\n\n if (window == nullptr) {\n sdlDie(\"SDL2GameWindow\", \"SDL_CreateWindow\");\n return false;\n }\n }\n\n {\n \/\/TimeMeasure m(\"Created SDL2 renderer\");\n\n Uint32 flags = SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC;\n\n renderer = SDL_CreateRenderer(window, -1, flags);\n\n if (renderer == nullptr) {\n sdlDie(\"SDL2GameWindow\", \"SDL_CreateRenderer\");\n return false;\n }\n }\n\n SDL_SetRenderDrawColor(renderer, 0x00, 0x00, 0x00, 0xFF);\n\n return true;\n}\n\nunsigned SDL2GameWindow::width() const {\n int w, h;\n SDL_GetWindowSize(window, &w, &h);\n return static_cast<unsigned>(w);\n}\n\nunsigned SDL2GameWindow::height() const {\n int w, h;\n SDL_GetWindowSize(window, &w, &h);\n return static_cast<unsigned>(h);\n}\n\nvoid SDL2GameWindow::setCaption(const std::string& caption) {\n SDL_SetWindowTitle(window, caption.c_str());\n}\n\nvoid SDL2GameWindow::mainLoop() {\n SDL_ShowWindow(window);\n while (window != nullptr) {\n handleEvents();\n World::instance().update(time());\n SDL_SetRenderDrawColor(renderer, 0, 0, 0, 0xFF);\n SDL_RenderClear(renderer);\n World::instance().draw();\n SDL_RenderPresent(renderer);\n }\n}\n\nvoid SDL2GameWindow::handleEvents() {\n SDL_Event event;\n\n while (SDL_PollEvent(&event)) {\n handleEvent(event);\n }\n}\n\nvoid SDL2GameWindow::handleEvent(const SDL_Event& event) {\n KeyboardKey key;\n\n switch (event.type) {\n case SDL_KEYUP:\n case SDL_KEYDOWN:\n switch (event.key.keysym.sym) {\n case SDLK_ESCAPE: key = KBEscape; break;\n case SDLK_LCTRL: key = KBLeftControl; break;\n case SDLK_RCTRL: key = KBRightControl; break;\n case SDLK_LSHIFT: key = KBLeftShift; break;\n case SDLK_RSHIFT: key = KBRightShift; break;\n case SDLK_SPACE: key = KBSpace; break;\n case SDLK_LEFT: key = KBLeftArrow; break;\n case SDLK_RIGHT: key = KBRightArrow; break;\n case SDLK_UP: key = KBUpArrow; break;\n case SDLK_DOWN: key = KBDownArrow; break;\n default: return;\n }\n if (event.type == SDL_KEYUP) {\n emitKeyUp(key);\n }\n else if (event.type == SDL_KEYDOWN) {\n emitKeyDown(key);\n }\n break;\n\n case SDL_QUIT:\n SDL_DestroyWindow(window);\n exit(0);\n return;\n\n default:\n return;\n }\n}\n\nvoid SDL2GameWindow::drawRect(double x1, double x2, double y1, double y2,\n uint32_t argb) {\n auto a = static_cast<Uint8>((argb >> 24) & 0xFF);\n auto r = static_cast<Uint8>((argb >> 16) & 0xFF);\n auto g = static_cast<Uint8>((argb >> 8) & 0xFF);\n auto b = static_cast<Uint8>((argb >> 0) & 0xFF);\n\n SDL_Rect rect{static_cast<int>(x1),\n static_cast<int>(y1),\n static_cast<int>(x2 - x1),\n static_cast<int>(y2 - y1)};\n\n SDL_SetRenderDrawColor(renderer, r, g, b, a);\n SDL_SetRenderDrawBlendMode(renderer, SDL_BLENDMODE_BLEND);\n SDL_RenderFillRect(renderer, &rect);\n}\n\nvoid SDL2GameWindow::scale(double x, double y, std::function<void()> op) {\n assert_(x == y);\n\n Transform prev = transform;\n\n auto factor = static_cast<float>(x);\n\n transform = Transform::scale(factor) * transform;\n updateTransform();\n\n op();\n\n transform = prev;\n updateTransform();\n}\n\nvoid SDL2GameWindow::translate(double x, double y, std::function<void()> op) {\n Transform prev = transform;\n\n transform = Transform::translate(static_cast<float>(x),\n static_cast<float>(y)) * transform;\n updateTransform();\n\n op();\n\n transform = prev;\n updateTransform();\n}\n\nvoid SDL2GameWindow::clip(double x, double y, double width, double height,\n std::function<void()> op) {\n op();\n}\n\nvoid SDL2GameWindow::close() {\n SDL_DestroyWindow(window);\n window = nullptr;\n}\n\nvoid SDL2GameWindow::updateTransform() {\n int w, h;\n\n SDL_GetWindowSize(window, &w, &h);\n\n double xScale = transform[0];\n double yScale = transform[5];\n double x = transform[12];\n double y = transform[13];\n\n translation = {x \/ xScale, y \/ yScale};\n scaling = {xScale, yScale};\n}\n<commit_msg>av\/sdl2: Skip redraws if no redraw needed<commit_after>\/*************************************\n** Tsunagari Tile Engine **\n** window.cpp **\n** Copyright 2016-2017 Paul Merrill **\n*************************************\/\n\n\/\/ **********\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to\n\/\/ deal in the Software without restriction, including without limitation the\n\/\/ rights to use, copy, modify, merge, publish, distribute, sublicense, and\/or\n\/\/ sell copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in\n\/\/ all copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n\/\/ IN THE SOFTWARE.\n\/\/ **********\n\n#include \"av\/sdl2\/window.h\"\n\n#include <chrono>\n#include <thread>\n\n#include \"av\/sdl2\/error.h\"\n#include \"core\/client-conf.h\"\n#include \"core\/log.h\"\n#include \"core\/measure.h\"\n#include \"core\/world.h\"\n#include \"util\/optional.h\"\n\n#define CHECK(x) if (!(x)) { return false; }\n\nstatic SDL2GameWindow globalWindow;\n\nGameWindow* GameWindow::create() {\n return globalWindow.init() ? &globalWindow\n : nullptr;\n}\n\nGameWindow& GameWindow::instance() {\n return globalWindow;\n}\n\nSDL2GameWindow& SDL2GameWindow::instance() {\n return globalWindow;\n}\n\ntime_t GameWindow::time() {\n std::chrono::time_point<std::chrono::steady_clock> start = globalWindow.start;\n std::chrono::time_point<std::chrono::steady_clock> end = std::chrono::steady_clock::now();\n return std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();\n}\n\nSDL_Renderer* SDL2GetRenderer() {\n return globalWindow.renderer;\n}\n\n\nSDL2GameWindow::SDL2GameWindow()\n : renderer(nullptr),\n translation(0.0, 0.0),\n scaling(0.0, 0.0),\n window(nullptr),\n transform(Transform::identity()) {}\n\nbool SDL2GameWindow::init() {\n {\n \/\/TimeMeasure m(\"Initializing SDL2\");\n if (SDL_Init(SDL_INIT_VIDEO | SDL_INIT_NOPARACHUTE) < 0) {\n sdlDie(\"SDL2GameWindow\", \"SDL_Init\");\n return false;\n }\n }\n\n {\n \/\/TimeMeasure m(\"Created SDL2 window\");\n\n int width = conf.windowSize.x;\n int height = conf.windowSize.y;\n\n Uint32 flags = SDL_WINDOW_HIDDEN;\n if (conf.fullscreen) {\n flags |= SDL_WINDOW_FULLSCREEN;\n }\n\n window = SDL_CreateWindow(\"Tsunagari\",\n SDL_WINDOWPOS_UNDEFINED,\n SDL_WINDOWPOS_UNDEFINED,\n width, height, flags);\n\n if (window == nullptr) {\n sdlDie(\"SDL2GameWindow\", \"SDL_CreateWindow\");\n return false;\n }\n }\n\n {\n \/\/TimeMeasure m(\"Created SDL2 renderer\");\n\n Uint32 flags = SDL_RENDERER_ACCELERATED | SDL_RENDERER_PRESENTVSYNC;\n\n renderer = SDL_CreateRenderer(window, -1, flags);\n\n if (renderer == nullptr) {\n sdlDie(\"SDL2GameWindow\", \"SDL_CreateRenderer\");\n return false;\n }\n }\n\n SDL_SetRenderDrawColor(renderer, 0x00, 0x00, 0x00, 0xFF);\n\n return true;\n}\n\nunsigned SDL2GameWindow::width() const {\n int w, h;\n SDL_GetWindowSize(window, &w, &h);\n return static_cast<unsigned>(w);\n}\n\nunsigned SDL2GameWindow::height() const {\n int w, h;\n SDL_GetWindowSize(window, &w, &h);\n return static_cast<unsigned>(h);\n}\n\nvoid SDL2GameWindow::setCaption(const std::string& caption) {\n SDL_SetWindowTitle(window, caption.c_str());\n}\n\nstatic int getRefreshRate(SDL_Window* window) {\n \/\/ SDL_GetWindowDisplayIndex computes which display the window is on each\n \/\/ time.\n int display = SDL_GetWindowDisplayIndex(window);\n SDL_DisplayMode mode;\n SDL_GetCurrentDisplayMode(display, &mode);\n return mode.refresh_rate;\n}\n\nvoid SDL2GameWindow::mainLoop() {\n SDL_ShowWindow(window);\n while (window != nullptr) {\n handleEvents();\n World::instance().update(time());\n if (World::instance().needsRedraw()) {\n SDL_SetRenderDrawColor(renderer, 0, 0, 0, 0xFF);\n SDL_RenderClear(renderer);\n World::instance().draw();\n SDL_RenderPresent(renderer);\n } else {\n \/\/ TODO: Question: How do we handle freesync and gsync?\n std::chrono::duration<float> frameLength(1.0 \/ getRefreshRate(window));\n std::this_thread::sleep_for(frameLength);\n }\n }\n}\n\nvoid SDL2GameWindow::handleEvents() {\n SDL_Event event;\n\n while (SDL_PollEvent(&event)) {\n handleEvent(event);\n }\n}\n\nvoid SDL2GameWindow::handleEvent(const SDL_Event& event) {\n KeyboardKey key;\n\n switch (event.type) {\n case SDL_KEYUP:\n case SDL_KEYDOWN:\n switch (event.key.keysym.sym) {\n case SDLK_ESCAPE: key = KBEscape; break;\n case SDLK_LCTRL: key = KBLeftControl; break;\n case SDLK_RCTRL: key = KBRightControl; break;\n case SDLK_LSHIFT: key = KBLeftShift; break;\n case SDLK_RSHIFT: key = KBRightShift; break;\n case SDLK_SPACE: key = KBSpace; break;\n case SDLK_LEFT: key = KBLeftArrow; break;\n case SDLK_RIGHT: key = KBRightArrow; break;\n case SDLK_UP: key = KBUpArrow; break;\n case SDLK_DOWN: key = KBDownArrow; break;\n default: return;\n }\n if (event.type == SDL_KEYUP) {\n emitKeyUp(key);\n }\n else if (event.type == SDL_KEYDOWN) {\n emitKeyDown(key);\n }\n break;\n\n case SDL_QUIT:\n SDL_DestroyWindow(window);\n exit(0);\n return;\n\n default:\n return;\n }\n}\n\nvoid SDL2GameWindow::drawRect(double x1, double x2, double y1, double y2,\n uint32_t argb) {\n auto a = static_cast<Uint8>((argb >> 24) & 0xFF);\n auto r = static_cast<Uint8>((argb >> 16) & 0xFF);\n auto g = static_cast<Uint8>((argb >> 8) & 0xFF);\n auto b = static_cast<Uint8>((argb >> 0) & 0xFF);\n\n SDL_Rect rect{static_cast<int>(x1),\n static_cast<int>(y1),\n static_cast<int>(x2 - x1),\n static_cast<int>(y2 - y1)};\n\n SDL_SetRenderDrawColor(renderer, r, g, b, a);\n SDL_SetRenderDrawBlendMode(renderer, SDL_BLENDMODE_BLEND);\n SDL_RenderFillRect(renderer, &rect);\n}\n\nvoid SDL2GameWindow::scale(double x, double y, std::function<void()> op) {\n assert_(x == y);\n\n Transform prev = transform;\n\n auto factor = static_cast<float>(x);\n\n transform = Transform::scale(factor) * transform;\n updateTransform();\n\n op();\n\n transform = prev;\n updateTransform();\n}\n\nvoid SDL2GameWindow::translate(double x, double y, std::function<void()> op) {\n Transform prev = transform;\n\n transform = Transform::translate(static_cast<float>(x),\n static_cast<float>(y)) * transform;\n updateTransform();\n\n op();\n\n transform = prev;\n updateTransform();\n}\n\nvoid SDL2GameWindow::clip(double x, double y, double width, double height,\n std::function<void()> op) {\n op();\n}\n\nvoid SDL2GameWindow::close() {\n SDL_DestroyWindow(window);\n window = nullptr;\n}\n\nvoid SDL2GameWindow::updateTransform() {\n int w, h;\n\n SDL_GetWindowSize(window, &w, &h);\n\n double xScale = transform[0];\n double yScale = transform[5];\n double x = transform[12];\n double y = transform[13];\n\n translation = {x \/ xScale, y \/ yScale};\n scaling = {xScale, yScale};\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n This source file is part of the OpenQube project.\n\n Copyright 2008-2010 Marcus D. Hanwell\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"basissetloader.h\"\n\n#include \"gaussianset.h\"\n#include \"slaterset.h\"\n#include \"gamessukout.h\"\n#include \"gaussianfchk.h\"\n#include \"mopacaux.h\"\n#include \"molden.h\"\n#include \"gamessus.h\"\n#include \"cube.h\"\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QStringList>\n\nnamespace OpenQube {\n\nQString BasisSetLoader::MatchBasisSet(const QString& filename)\n{\n QString matchedFile;\n if (filename.isEmpty())\n return matchedFile;\n\n QFileInfo parentInfo(filename);\n \/\/ Look for files with the same basename, but different extensions\n QDir parentDir = parentInfo.dir();\n QStringList nameFilters;\n nameFilters << parentInfo.baseName() + \".*\";\n\n QStringList matchingFiles = parentDir.entryList(nameFilters,\n QDir::Readable | QDir::Files);\n matchingFiles.prepend(parentInfo.fileName());\n\n \/\/ Iterate through the matches and see if we find a suitable file\n foreach(const QString &fileName, matchingFiles) {\n QString fullFileName = parentInfo.path() + '\/' + fileName;\n QFileInfo info(fullFileName);\n QString completeSuffix = info.completeSuffix();\n\n if (completeSuffix.contains(\"fchk\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fch\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fck\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"gukout\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"aux\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"molden\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"mold\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"molf\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"gamess\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n }\n return matchedFile;\n}\n\nBasisSet * BasisSetLoader::LoadBasisSet(const QString& filename)\n{\n \/\/ Here we assume that the file name is correct, and attempt to load it.\n QFileInfo info(filename);\n QString completeSuffix = info.completeSuffix();\n if (completeSuffix.contains(\"fchk\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fch\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fck\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GaussianFchk fchk(filename, gaussian);\n\n return gaussian;\n }\n else if (completeSuffix.contains(\"gukout\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GamessukOut gukout(filename, gaussian);\n return gaussian;\n }\n else if (completeSuffix.contains(\"aux\", Qt::CaseInsensitive)) {\n SlaterSet *slater = new SlaterSet;\n MopacAux aux(filename, slater);\n return slater;\n }\n else if (completeSuffix.contains(\"molden\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"mold\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"molf\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n MoldenFile mold(filename, gaussian);\n return gaussian;\n }\n else if (completeSuffix.contains(\"gamess\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GAMESSUSOutput(filename, gaussian);\n return gaussian;\n }\n\n return 0;\n}\n\n} \/\/ End namespace\n<commit_msg>Accept gamess or gamout as a file extension.<commit_after>\/******************************************************************************\n\n This source file is part of the OpenQube project.\n\n Copyright 2008-2010 Marcus D. Hanwell\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"basissetloader.h\"\n\n#include \"gaussianset.h\"\n#include \"slaterset.h\"\n#include \"gamessukout.h\"\n#include \"gaussianfchk.h\"\n#include \"mopacaux.h\"\n#include \"molden.h\"\n#include \"gamessus.h\"\n#include \"cube.h\"\n\n#include <QtCore\/QDir>\n#include <QtCore\/QFileInfo>\n#include <QtCore\/QStringList>\n\nnamespace OpenQube {\n\nQString BasisSetLoader::MatchBasisSet(const QString& filename)\n{\n QString matchedFile;\n if (filename.isEmpty())\n return matchedFile;\n\n QFileInfo parentInfo(filename);\n \/\/ Look for files with the same basename, but different extensions\n QDir parentDir = parentInfo.dir();\n QStringList nameFilters;\n nameFilters << parentInfo.baseName() + \".*\";\n\n QStringList matchingFiles = parentDir.entryList(nameFilters,\n QDir::Readable | QDir::Files);\n matchingFiles.prepend(parentInfo.fileName());\n\n \/\/ Iterate through the matches and see if we find a suitable file\n foreach(const QString &fileName, matchingFiles) {\n QString fullFileName = parentInfo.path() + '\/' + fileName;\n QFileInfo info(fullFileName);\n QString completeSuffix = info.completeSuffix();\n\n if (completeSuffix.contains(\"fchk\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fch\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fck\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"gamout\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"gamess\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"gukout\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"aux\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n else if (completeSuffix.contains(\"molden\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"mold\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"molf\", Qt::CaseInsensitive)) {\n return fullFileName;\n }\n }\n return matchedFile;\n}\n\nBasisSet * BasisSetLoader::LoadBasisSet(const QString& filename)\n{\n \/\/ Here we assume that the file name is correct, and attempt to load it.\n QFileInfo info(filename);\n QString completeSuffix = info.completeSuffix();\n if (completeSuffix.contains(\"fchk\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fch\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"fck\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GaussianFchk fchk(filename, gaussian);\n\n return gaussian;\n }\n else if (completeSuffix.contains(\"gamout\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"gamess\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GAMESSUSOutput gamout(filename, gaussian);\n return gaussian;\n }\n else if (completeSuffix.contains(\"gukout\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n GamessukOut gukout(filename, gaussian);\n return gaussian;\n }\n else if (completeSuffix.contains(\"aux\", Qt::CaseInsensitive)) {\n SlaterSet *slater = new SlaterSet;\n MopacAux aux(filename, slater);\n return slater;\n }\n else if (completeSuffix.contains(\"molden\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"mold\", Qt::CaseInsensitive)\n || completeSuffix.contains(\"molf\", Qt::CaseInsensitive)) {\n GaussianSet *gaussian = new GaussianSet;\n MoldenFile mold(filename, gaussian);\n return gaussian;\n }\n\n return 0;\n}\n\n} \/\/ End namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include <algorithm>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gtest\/gtest.h>\n\n#include \"recommender_base.hpp\"\n\nusing std::make_pair;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\nnamespace jubatus {\nnamespace core {\nnamespace recommender {\n\nclass recommender_impl : public recommender_base {\n public:\n recommender_impl()\n : recommender_base() {\n \/\/ make mock\n orig_.set(\"r1\", \"a1\", 1.0);\n orig_.set(\"r1\", \"a2\", 1.0);\n\n orig_.set(\"r2\", \"b1\", 1.0);\n orig_.set(\"r2\", \"b2\", 1.0);\n\n orig_.set(\"r3\", \"a1\", 1.0);\n orig_.set(\"r3\", \"b1\", 1.0);\n }\n\n void similar_row(\n const common::sfv_t& query,\n vector<pair<string, float> >& ids,\n size_t ret_num) const {\n ids.clear();\n ids.push_back(make_pair(\"r1\", 2.0));\n ids.push_back(make_pair(\"r3\", 1.0));\n }\n\n void neighbor_row(\n const common::sfv_t& query,\n vector<pair<string, float> >& ids,\n size_t ret_num) const {\n ids.clear();\n ids.push_back(make_pair(\"r1\", 1.0));\n ids.push_back(make_pair(\"r3\", 2.0));\n }\n\n void clear() {\n }\n\n void clear_row(const string& id) {\n }\n\n void update_row(const string& id, const sfv_diff_t& diff) {\n }\n\n void get_all_row_ids(vector<string>& ids) const {\n ids.clear();\n ids.push_back(\"r1\");\n ids.push_back(\"r2\");\n ids.push_back(\"r3\");\n }\n\n string type() const {\n return string(\"recommender_impl\");\n }\n\n framework::mixable* get_mixable() const {}\n\n void pack(framework::packer&) const {\n }\n void unpack(msgpack::object) {\n }\n};\n\nTEST(recommender_base, complete_row) {\n recommender_impl r;\n common::sfv_t q;\n common::sfv_t ret;\n r.complete_row(q, ret);\n ASSERT_EQ(3u, ret.size());\n EXPECT_EQ(\"a1\", ret[0].first);\n EXPECT_EQ(\"a2\", ret[1].first);\n EXPECT_EQ(\"b1\", ret[2].first);\n}\n\nTEST(recommender_base, get_all_row_ids) {\n vector<string> ids;\n recommender_impl r;\n r.get_all_row_ids(ids);\n ASSERT_EQ(3u, ids.size());\n sort(ids.begin(), ids.end());\n EXPECT_EQ(\"r1\", ids[0]);\n EXPECT_EQ(\"r2\", ids[1]);\n EXPECT_EQ(\"r3\", ids[2]);\n}\n\nTEST(recommender_base, decode_row) {\n recommender_impl r;\n common::sfv_t v;\n r.decode_row(\"r1\", v);\n ASSERT_EQ(2u, v.size());\n EXPECT_EQ(\"a1\", v[0].first);\n EXPECT_EQ(1.0, v[0].second);\n EXPECT_EQ(\"a2\", v[1].first);\n EXPECT_EQ(1.0, v[1].second);\n\n r.decode_row(\"r\", v);\n ASSERT_TRUE(v.empty());\n}\n\nTEST(recommender_base, calc_l2norm) {\n recommender_impl r;\n common::sfv_t q;\n q.push_back(make_pair(\"a1\", 1.0));\n q.push_back(make_pair(\"a2\", 2.0));\n q.push_back(make_pair(\"a3\", 3.0));\n\n EXPECT_FLOAT_EQ(std::sqrt(1.0 + 4.0 + 9.0), r.calc_l2norm(q));\n}\n\nTEST(recommender_base, calc_similality) {\n recommender_impl r;\n common::sfv_t q1;\n common::sfv_t q2;\n\n q1.push_back(make_pair(\"c1\", 1.0));\n q1.push_back(make_pair(\"c2\", 2.0));\n q1.push_back(make_pair(\"c3\", 3.0));\n\n q2.push_back(make_pair(\"c4\", 2.0));\n q2.push_back(make_pair(\"c3\", 3.0));\n q2.push_back(make_pair(\"c2\", 3.0));\n\n EXPECT_FLOAT_EQ(\n (2.0 * 3.0 + 3.0 * 3.0) \/ r.calc_l2norm(q1) \/ r.calc_l2norm(q2),\n r.calc_similality(q1, q2));\n}\n\n} \/\/ namespace recommender\n} \/\/ namespace core\n} \/\/ namespace jubatus\n<commit_msg>fix compiler warning<commit_after>\/\/ Jubatus: Online machine learning framework for distributed environment\n\/\/ Copyright (C) 2012 Preferred Infrastructure and Nippon Telegraph and Telephone Corporation.\n\/\/\n\/\/ This library is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License version 2.1 as published by the Free Software Foundation.\n\/\/\n\/\/ This library is distributed in the hope that it will be useful,\n\/\/ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\/\/ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n\/\/ Lesser General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License along with this library; if not, write to the Free Software\n\/\/ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n\n#include <algorithm>\n#include <string>\n#include <utility>\n#include <vector>\n\n#include <gtest\/gtest.h>\n\n#include \"recommender_base.hpp\"\n\nusing std::make_pair;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\nnamespace jubatus {\nnamespace core {\nnamespace recommender {\n\nclass recommender_impl : public recommender_base {\n public:\n recommender_impl()\n : recommender_base() {\n \/\/ make mock\n orig_.set(\"r1\", \"a1\", 1.0);\n orig_.set(\"r1\", \"a2\", 1.0);\n\n orig_.set(\"r2\", \"b1\", 1.0);\n orig_.set(\"r2\", \"b2\", 1.0);\n\n orig_.set(\"r3\", \"a1\", 1.0);\n orig_.set(\"r3\", \"b1\", 1.0);\n }\n\n void similar_row(\n const common::sfv_t& query,\n vector<pair<string, float> >& ids,\n size_t ret_num) const {\n ids.clear();\n ids.push_back(make_pair(\"r1\", 2.0));\n ids.push_back(make_pair(\"r3\", 1.0));\n }\n\n void neighbor_row(\n const common::sfv_t& query,\n vector<pair<string, float> >& ids,\n size_t ret_num) const {\n ids.clear();\n ids.push_back(make_pair(\"r1\", 1.0));\n ids.push_back(make_pair(\"r3\", 2.0));\n }\n\n void clear() {\n }\n\n void clear_row(const string& id) {\n }\n\n void update_row(const string& id, const sfv_diff_t& diff) {\n }\n\n void get_all_row_ids(vector<string>& ids) const {\n ids.clear();\n ids.push_back(\"r1\");\n ids.push_back(\"r2\");\n ids.push_back(\"r3\");\n }\n\n string type() const {\n return string(\"recommender_impl\");\n }\n\n framework::mixable* get_mixable() const {\n return NULL;\n }\n\n void pack(framework::packer&) const {\n }\n void unpack(msgpack::object) {\n }\n};\n\nTEST(recommender_base, complete_row) {\n recommender_impl r;\n common::sfv_t q;\n common::sfv_t ret;\n r.complete_row(q, ret);\n ASSERT_EQ(3u, ret.size());\n EXPECT_EQ(\"a1\", ret[0].first);\n EXPECT_EQ(\"a2\", ret[1].first);\n EXPECT_EQ(\"b1\", ret[2].first);\n}\n\nTEST(recommender_base, get_all_row_ids) {\n vector<string> ids;\n recommender_impl r;\n r.get_all_row_ids(ids);\n ASSERT_EQ(3u, ids.size());\n sort(ids.begin(), ids.end());\n EXPECT_EQ(\"r1\", ids[0]);\n EXPECT_EQ(\"r2\", ids[1]);\n EXPECT_EQ(\"r3\", ids[2]);\n}\n\nTEST(recommender_base, decode_row) {\n recommender_impl r;\n common::sfv_t v;\n r.decode_row(\"r1\", v);\n ASSERT_EQ(2u, v.size());\n EXPECT_EQ(\"a1\", v[0].first);\n EXPECT_EQ(1.0, v[0].second);\n EXPECT_EQ(\"a2\", v[1].first);\n EXPECT_EQ(1.0, v[1].second);\n\n r.decode_row(\"r\", v);\n ASSERT_TRUE(v.empty());\n}\n\nTEST(recommender_base, calc_l2norm) {\n recommender_impl r;\n common::sfv_t q;\n q.push_back(make_pair(\"a1\", 1.0));\n q.push_back(make_pair(\"a2\", 2.0));\n q.push_back(make_pair(\"a3\", 3.0));\n\n EXPECT_FLOAT_EQ(std::sqrt(1.0 + 4.0 + 9.0), r.calc_l2norm(q));\n}\n\nTEST(recommender_base, calc_similality) {\n recommender_impl r;\n common::sfv_t q1;\n common::sfv_t q2;\n\n q1.push_back(make_pair(\"c1\", 1.0));\n q1.push_back(make_pair(\"c2\", 2.0));\n q1.push_back(make_pair(\"c3\", 3.0));\n\n q2.push_back(make_pair(\"c4\", 2.0));\n q2.push_back(make_pair(\"c3\", 3.0));\n q2.push_back(make_pair(\"c2\", 3.0));\n\n EXPECT_FLOAT_EQ(\n (2.0 * 3.0 + 3.0 * 3.0) \/ r.calc_l2norm(q1) \/ r.calc_l2norm(q2),\n r.calc_similality(q1, q2));\n}\n\n} \/\/ namespace recommender\n} \/\/ namespace core\n} \/\/ namespace jubatus\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"blockencodings.h\"\n#include \"consensus\/consensus.h\"\n#include \"consensus\/validation.h\"\n#include \"chainparams.h\"\n#include \"hash.h\"\n#include \"random.h\"\n#include \"streams.h\"\n#include \"txmempool.h\"\n#include \"main.h\"\n#include \"util.h\"\n\n#include <unordered_map>\n\n#define MIN_TRANSACTION_SIZE (::GetSerializeSize(CTransaction(), SER_NETWORK, PROTOCOL_VERSION))\n\nCBlockHeaderAndShortTxIDs::CBlockHeaderAndShortTxIDs(const CBlock& block) :\n nonce(GetRand(std::numeric_limits<uint64_t>::max())),\n shorttxids(block.vtx.size() - 1), prefilledtxn(1), header(block) {\n FillShortTxIDSelector();\n \/\/TODO: Use our mempool prior to block acceptance to predictively fill more than just the coinbase\n prefilledtxn[0] = {0, block.vtx[0]};\n for (size_t i = 1; i < block.vtx.size(); i++) {\n const CTransaction& tx = block.vtx[i];\n shorttxids[i - 1] = GetShortID(tx.GetHash());\n }\n}\n\nvoid CBlockHeaderAndShortTxIDs::FillShortTxIDSelector() const {\n CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);\n stream << header << nonce;\n CSHA256 hasher;\n hasher.Write((unsigned char*)&(*stream.begin()), stream.end() - stream.begin());\n uint256 shorttxidhash;\n hasher.Finalize(shorttxidhash.begin());\n shorttxidk0 = shorttxidhash.GetUint64(0);\n shorttxidk1 = shorttxidhash.GetUint64(1);\n}\n\nuint64_t CBlockHeaderAndShortTxIDs::GetShortID(const uint256& txhash) const {\n static_assert(SHORTTXIDS_LENGTH == 6, \"shorttxids calculation assumes 6-byte shorttxids\");\n return SipHashUint256(shorttxidk0, shorttxidk1, txhash) & 0xffffffffffffL;\n}\n\n\n\nReadStatus PartiallyDownloadedBlock::InitData(const CBlockHeaderAndShortTxIDs& cmpctblock) {\n if (cmpctblock.header.IsNull() || (cmpctblock.shorttxids.empty() && cmpctblock.prefilledtxn.empty()))\n return READ_STATUS_INVALID;\n if (cmpctblock.shorttxids.size() + cmpctblock.prefilledtxn.size() > MAX_BLOCK_SIZE \/ MIN_TRANSACTION_SIZE)\n return READ_STATUS_INVALID;\n\n assert(header.IsNull() && txn_available.empty());\n header = cmpctblock.header;\n txn_available.resize(cmpctblock.BlockTxCount());\n\n int32_t lastprefilledindex = -1;\n for (size_t i = 0; i < cmpctblock.prefilledtxn.size(); i++) {\n if (cmpctblock.prefilledtxn[i].tx.IsNull())\n return READ_STATUS_INVALID;\n\n lastprefilledindex += cmpctblock.prefilledtxn[i].index + 1; \/\/index is a uint16_t, so cant overflow here\n if (lastprefilledindex > std::numeric_limits<uint16_t>::max())\n return READ_STATUS_INVALID;\n if ((uint32_t)lastprefilledindex > cmpctblock.shorttxids.size() + i) {\n \/\/ If we are inserting a tx at an index greater than our full list of shorttxids\n \/\/ plus the number of prefilled txn we've inserted, then we have txn for which we\n \/\/ have neither a prefilled txn or a shorttxid!\n return READ_STATUS_INVALID;\n }\n txn_available[lastprefilledindex] = std::make_shared<CTransaction>(cmpctblock.prefilledtxn[i].tx);\n }\n prefilled_count = cmpctblock.prefilledtxn.size();\n\n \/\/ Calculate map of txids -> positions and check mempool to see what we have (or dont)\n \/\/ Because well-formed cmpctblock messages will have a (relatively) uniform distribution\n \/\/ of short IDs, any highly-uneven distribution of elements can be safely treated as a\n \/\/ READ_STATUS_FAILED.\n std::unordered_map<uint64_t, uint16_t> shorttxids(cmpctblock.shorttxids.size());\n uint16_t index_offset = 0;\n for (size_t i = 0; i < cmpctblock.shorttxids.size(); i++) {\n while (txn_available[i + index_offset])\n index_offset++;\n shorttxids[cmpctblock.shorttxids[i]] = i + index_offset;\n \/\/ Bucket selection is a simple Binomial distribution. If we assume blocks of\n \/\/ 10,000 transactions, allowing up to 12 elements per bucket should only fail\n \/\/ once every ~1.3 million blocks and once every 74,000 blocks in a worst-case\n \/\/ 16,000-transaction block.\n if (shorttxids.bucket_size(shorttxids.bucket(cmpctblock.shorttxids[i])) > 12)\n return READ_STATUS_FAILED;\n }\n \/\/ TODO: in the shortid-collision case, we should instead request both transactions\n \/\/ which collided. Falling back to full-block-request here is overkill.\n if (shorttxids.size() != cmpctblock.shorttxids.size())\n return READ_STATUS_FAILED; \/\/ Short ID collision\n\n std::vector<bool> have_txn(txn_available.size());\n LOCK(pool->cs);\n for (CTxMemPool::txiter it = pool->mapTx.begin(); it != pool->mapTx.end(); it++) {\n std::unordered_map<uint64_t, uint16_t>::iterator idit = shorttxids.find(cmpctblock.GetShortID(it->GetTx().GetHash()));\n if (idit != shorttxids.end()) {\n if (!have_txn[idit->second]) {\n txn_available[idit->second] = it->GetSharedTx();\n have_txn[idit->second] = true;\n mempool_count++;\n } else {\n \/\/ If we find two mempool txn that match the short id, just request it.\n \/\/ This should be rare enough that the extra bandwidth doesn't matter,\n \/\/ but eating a round-trip due to FillBlock failure would be annoying\n if (txn_available[idit->second]) {\n txn_available[idit->second].reset();\n mempool_count--;\n }\n }\n }\n \/\/ Though ideally we'd continue scanning for the two-txn-match-shortid case,\n \/\/ the performance win of an early exit here is too good to pass up and worth\n \/\/ the extra risk.\n if (mempool_count == shorttxids.size())\n break;\n }\n\n LogPrint(\"cmpctblock\", \"Initialized PartiallyDownloadedBlock for block %s using a cmpctblock of size %lu\\n\", cmpctblock.header.GetHash().ToString(), cmpctblock.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION));\n\n return READ_STATUS_OK;\n}\n\nbool PartiallyDownloadedBlock::IsTxAvailable(size_t index) const {\n assert(!header.IsNull());\n assert(index < txn_available.size());\n return txn_available[index] ? true : false;\n}\n\nReadStatus PartiallyDownloadedBlock::FillBlock(CBlock& block, const std::vector<CTransaction>& vtx_missing) const {\n assert(!header.IsNull());\n block = header;\n block.vtx.resize(txn_available.size());\n\n size_t tx_missing_offset = 0;\n for (size_t i = 0; i < txn_available.size(); i++) {\n if (!txn_available[i]) {\n if (vtx_missing.size() <= tx_missing_offset)\n return READ_STATUS_INVALID;\n block.vtx[i] = vtx_missing[tx_missing_offset++];\n } else\n block.vtx[i] = *txn_available[i];\n }\n if (vtx_missing.size() != tx_missing_offset)\n return READ_STATUS_INVALID;\n\n CValidationState state;\n if (!CheckBlock(block, state, Params().GetConsensus())) {\n \/\/ TODO: We really want to just check merkle tree manually here,\n \/\/ but that is expensive, and CheckBlock caches a block's\n \/\/ \"checked-status\" (in the CBlock?). CBlock should be able to\n \/\/ check its own merkle root and cache that check.\n if (state.CorruptionPossible())\n return READ_STATUS_FAILED; \/\/ Possible Short ID collision\n return READ_STATUS_INVALID;\n }\n\n LogPrint(\"cmpctblock\", \"Successfully reconstructed block %s with %lu txn prefilled, %lu txn from mempool and %lu txn requested\\n\", header.GetHash().ToString(), prefilled_count, mempool_count, vtx_missing.size());\n if (vtx_missing.size() < 5) {\n for(const CTransaction& tx : vtx_missing)\n LogPrint(\"cmpctblock\", \"Reconstructed block %s required tx %s\\n\", header.GetHash().ToString(), tx.GetHash().ToString());\n }\n\n return READ_STATUS_OK;\n}\n<commit_msg>Use vTxHashes to optimize InitData significantly<commit_after>\/\/ Copyright (c) 2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"blockencodings.h\"\n#include \"consensus\/consensus.h\"\n#include \"consensus\/validation.h\"\n#include \"chainparams.h\"\n#include \"hash.h\"\n#include \"random.h\"\n#include \"streams.h\"\n#include \"txmempool.h\"\n#include \"main.h\"\n#include \"util.h\"\n\n#include <unordered_map>\n\n#define MIN_TRANSACTION_SIZE (::GetSerializeSize(CTransaction(), SER_NETWORK, PROTOCOL_VERSION))\n\nCBlockHeaderAndShortTxIDs::CBlockHeaderAndShortTxIDs(const CBlock& block) :\n nonce(GetRand(std::numeric_limits<uint64_t>::max())),\n shorttxids(block.vtx.size() - 1), prefilledtxn(1), header(block) {\n FillShortTxIDSelector();\n \/\/TODO: Use our mempool prior to block acceptance to predictively fill more than just the coinbase\n prefilledtxn[0] = {0, block.vtx[0]};\n for (size_t i = 1; i < block.vtx.size(); i++) {\n const CTransaction& tx = block.vtx[i];\n shorttxids[i - 1] = GetShortID(tx.GetHash());\n }\n}\n\nvoid CBlockHeaderAndShortTxIDs::FillShortTxIDSelector() const {\n CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);\n stream << header << nonce;\n CSHA256 hasher;\n hasher.Write((unsigned char*)&(*stream.begin()), stream.end() - stream.begin());\n uint256 shorttxidhash;\n hasher.Finalize(shorttxidhash.begin());\n shorttxidk0 = shorttxidhash.GetUint64(0);\n shorttxidk1 = shorttxidhash.GetUint64(1);\n}\n\nuint64_t CBlockHeaderAndShortTxIDs::GetShortID(const uint256& txhash) const {\n static_assert(SHORTTXIDS_LENGTH == 6, \"shorttxids calculation assumes 6-byte shorttxids\");\n return SipHashUint256(shorttxidk0, shorttxidk1, txhash) & 0xffffffffffffL;\n}\n\n\n\nReadStatus PartiallyDownloadedBlock::InitData(const CBlockHeaderAndShortTxIDs& cmpctblock) {\n if (cmpctblock.header.IsNull() || (cmpctblock.shorttxids.empty() && cmpctblock.prefilledtxn.empty()))\n return READ_STATUS_INVALID;\n if (cmpctblock.shorttxids.size() + cmpctblock.prefilledtxn.size() > MAX_BLOCK_SIZE \/ MIN_TRANSACTION_SIZE)\n return READ_STATUS_INVALID;\n\n assert(header.IsNull() && txn_available.empty());\n header = cmpctblock.header;\n txn_available.resize(cmpctblock.BlockTxCount());\n\n int32_t lastprefilledindex = -1;\n for (size_t i = 0; i < cmpctblock.prefilledtxn.size(); i++) {\n if (cmpctblock.prefilledtxn[i].tx.IsNull())\n return READ_STATUS_INVALID;\n\n lastprefilledindex += cmpctblock.prefilledtxn[i].index + 1; \/\/index is a uint16_t, so cant overflow here\n if (lastprefilledindex > std::numeric_limits<uint16_t>::max())\n return READ_STATUS_INVALID;\n if ((uint32_t)lastprefilledindex > cmpctblock.shorttxids.size() + i) {\n \/\/ If we are inserting a tx at an index greater than our full list of shorttxids\n \/\/ plus the number of prefilled txn we've inserted, then we have txn for which we\n \/\/ have neither a prefilled txn or a shorttxid!\n return READ_STATUS_INVALID;\n }\n txn_available[lastprefilledindex] = std::make_shared<CTransaction>(cmpctblock.prefilledtxn[i].tx);\n }\n prefilled_count = cmpctblock.prefilledtxn.size();\n\n \/\/ Calculate map of txids -> positions and check mempool to see what we have (or dont)\n \/\/ Because well-formed cmpctblock messages will have a (relatively) uniform distribution\n \/\/ of short IDs, any highly-uneven distribution of elements can be safely treated as a\n \/\/ READ_STATUS_FAILED.\n std::unordered_map<uint64_t, uint16_t> shorttxids(cmpctblock.shorttxids.size());\n uint16_t index_offset = 0;\n for (size_t i = 0; i < cmpctblock.shorttxids.size(); i++) {\n while (txn_available[i + index_offset])\n index_offset++;\n shorttxids[cmpctblock.shorttxids[i]] = i + index_offset;\n \/\/ Bucket selection is a simple Binomial distribution. If we assume blocks of\n \/\/ 10,000 transactions, allowing up to 12 elements per bucket should only fail\n \/\/ once every ~1.3 million blocks and once every 74,000 blocks in a worst-case\n \/\/ 16,000-transaction block.\n if (shorttxids.bucket_size(shorttxids.bucket(cmpctblock.shorttxids[i])) > 12)\n return READ_STATUS_FAILED;\n }\n \/\/ TODO: in the shortid-collision case, we should instead request both transactions\n \/\/ which collided. Falling back to full-block-request here is overkill.\n if (shorttxids.size() != cmpctblock.shorttxids.size())\n return READ_STATUS_FAILED; \/\/ Short ID collision\n\n std::vector<bool> have_txn(txn_available.size());\n LOCK(pool->cs);\n const std::vector<std::pair<uint256, CTxMemPool::txiter> >& vTxHashes = pool->vTxHashes;\n for (size_t i = 0; i < vTxHashes.size(); i++) {\n uint64_t shortid = cmpctblock.GetShortID(vTxHashes[i].first);\n std::unordered_map<uint64_t, uint16_t>::iterator idit = shorttxids.find(shortid);\n if (idit != shorttxids.end()) {\n if (!have_txn[idit->second]) {\n txn_available[idit->second] = vTxHashes[i].second->GetSharedTx();\n have_txn[idit->second] = true;\n mempool_count++;\n } else {\n \/\/ If we find two mempool txn that match the short id, just request it.\n \/\/ This should be rare enough that the extra bandwidth doesn't matter,\n \/\/ but eating a round-trip due to FillBlock failure would be annoying\n if (txn_available[idit->second]) {\n txn_available[idit->second].reset();\n mempool_count--;\n }\n }\n }\n \/\/ Though ideally we'd continue scanning for the two-txn-match-shortid case,\n \/\/ the performance win of an early exit here is too good to pass up and worth\n \/\/ the extra risk.\n if (mempool_count == shorttxids.size())\n break;\n }\n\n LogPrint(\"cmpctblock\", \"Initialized PartiallyDownloadedBlock for block %s using a cmpctblock of size %lu\\n\", cmpctblock.header.GetHash().ToString(), cmpctblock.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION));\n\n return READ_STATUS_OK;\n}\n\nbool PartiallyDownloadedBlock::IsTxAvailable(size_t index) const {\n assert(!header.IsNull());\n assert(index < txn_available.size());\n return txn_available[index] ? true : false;\n}\n\nReadStatus PartiallyDownloadedBlock::FillBlock(CBlock& block, const std::vector<CTransaction>& vtx_missing) const {\n assert(!header.IsNull());\n block = header;\n block.vtx.resize(txn_available.size());\n\n size_t tx_missing_offset = 0;\n for (size_t i = 0; i < txn_available.size(); i++) {\n if (!txn_available[i]) {\n if (vtx_missing.size() <= tx_missing_offset)\n return READ_STATUS_INVALID;\n block.vtx[i] = vtx_missing[tx_missing_offset++];\n } else\n block.vtx[i] = *txn_available[i];\n }\n if (vtx_missing.size() != tx_missing_offset)\n return READ_STATUS_INVALID;\n\n CValidationState state;\n if (!CheckBlock(block, state, Params().GetConsensus())) {\n \/\/ TODO: We really want to just check merkle tree manually here,\n \/\/ but that is expensive, and CheckBlock caches a block's\n \/\/ \"checked-status\" (in the CBlock?). CBlock should be able to\n \/\/ check its own merkle root and cache that check.\n if (state.CorruptionPossible())\n return READ_STATUS_FAILED; \/\/ Possible Short ID collision\n return READ_STATUS_INVALID;\n }\n\n LogPrint(\"cmpctblock\", \"Successfully reconstructed block %s with %lu txn prefilled, %lu txn from mempool and %lu txn requested\\n\", header.GetHash().ToString(), prefilled_count, mempool_count, vtx_missing.size());\n if (vtx_missing.size() < 5) {\n for(const CTransaction& tx : vtx_missing)\n LogPrint(\"cmpctblock\", \"Reconstructed block %s required tx %s\\n\", header.GetHash().ToString(), tx.GetHash().ToString());\n }\n\n return READ_STATUS_OK;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************************\n * *\n * OpenSpace *\n * *\n * Copyright (c) 2014 *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this *\n * software and associated documentation files (the \"Software\"), to deal in the Software *\n * without restriction, including without limitation the rights to use, copy, modify, *\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to the following *\n * conditions: *\n * *\n * The above copyright notice and this permission notice shall be included in all copies *\n * or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A *\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF *\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE *\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n ****************************************************************************************\/\n\n\/\/ open space includes\n#include <openspace\/rendering\/renderablevolume.h>\n\n#include <ghoul\/opengl\/texturereader.h>\n#include <ghoul\/filesystem\/filesystem.h>\n\n#include <openspace\/engine\/openspaceengine.h>\n#include <sgct.h>\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <algorithm>\n#include <iterator>\n#include <type_traits>\n\nnamespace {\n std::string _loggerCat = \"RenderableVolume\";\n \n bool hasEnding (std::string const &fullString, std::string const &ending)\n {\n if (fullString.length() >= ending.length()) {\n return (0 == fullString.compare (fullString.length() - ending.length(), ending.length(), ending));\n } else {\n return false;\n }\n }\n \n template<typename T>\n T stringToNumber(const std::string& number, std::function<T(T)> f = nullptr) {\n static_assert(std::is_integral<T>::value || std::is_floating_point<T>::value,\n \"Must be integral or floating point\");\n std::stringstream ss;\n T templateNumber = {0};\n ss << number;\n ss >> templateNumber;\n if( ! f)\n return templateNumber;\n \n return f(templateNumber);\n \n }\n\n}\n\nnamespace openspace {\n\nRenderableVolume::RenderableVolume(const ghoul::Dictionary& dictionary) {\n \n \/\/ get path if available\n _relativePath = \"\";\n if(dictionary.hasKey(\"Path\")) {\n dictionary.getValue(\"Path\", _relativePath);\n _relativePath += \"\/\";\n }\n}\n\nRenderableVolume::~RenderableVolume() {\n}\n\nstd::string RenderableVolume::findPath(const std::string& path) {\n std::string tmp = absPath(path);\n if(FileSys.fileExists(tmp))\n return tmp;\n \n tmp = absPath(_relativePath + path);\n if(FileSys.fileExists(tmp))\n return tmp;\n \n LERROR(\"Could not find file '\" << path << \"'\");\n \n return \"\";\n}\n\nghoul::RawVolumeReader::ReadHints RenderableVolume::readHints(const ghoul::Dictionary& dictionary) {\n ghoul::RawVolumeReader::ReadHints hints;\n hints._dimensions = glm::ivec3(1, 1, 1);\n hints._format = ghoul::opengl::Texture::Format::Red;\n hints._internalFormat = GL_R8;\n \n \/\/ parse hints\n double tempValue;\n if (dictionary.hasKey(\"Dimensions.1\") && dictionary.getValue(\"Dimensions.1\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[0] = intVal;\n }\n if (dictionary.hasKey(\"Dimensions.2\") && dictionary.getValue(\"Dimensions.2\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[1] = intVal;\n }\n if (dictionary.hasKey(\"Dimensions.3\") && dictionary.getValue(\"Dimensions.3\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[2] = intVal;\n }\n \n std::string format;\n if (dictionary.hasKey(\"Format\") && dictionary.getValue(\"Format\", format)) {\n if(format == \"RED\") {\n hints._format = ghoul::opengl::Texture::Format::Red;\n } else if(format == \"RG\") {\n hints._format = ghoul::opengl::Texture::Format::RG;\n } else if(format == \"RGB\") {\n hints._format = ghoul::opengl::Texture::Format::RGB;\n } else if(format == \"RGBA\") {\n hints._format = ghoul::opengl::Texture::Format::RGBA;\n }\n }\n \n format = \"\";\n if (dictionary.hasKey(\"InternalFormat\") && dictionary.getValue(\"InternalFormat\", format)) {\n if(format == \"R8\") {\n hints._internalFormat = GL_R8;\n } else if(format == \"RG8\") {\n hints._internalFormat = GL_RG8;\n } else if(format == \"RGB8\") {\n hints._internalFormat = GL_RGB8;\n } else if(format == \"RGBA8\") {\n hints._internalFormat = GL_RGB8;\n } else if(format == \"R32F\") {\n hints._internalFormat = GL_R32F;\n } else if(format == \"RG32F\") {\n hints._internalFormat = GL_RG32F;\n } else if(format == \"RGB32F\") {\n hints._internalFormat = GL_RGB32F;\n } else if(format == \"RGBA32F\") {\n hints._internalFormat = GL_RGB32F;\n }\n }\n return hints;\n}\n \nghoul::opengl::Texture* RenderableVolume::loadTransferFunction(const std::string& filepath) {\n\n std::string f = absPath(filepath);\n\n if ( ! FileSys.fileExists(f)) {\n return nullptr;\n }\n \n \/\/ check if not a txt based texture\n if ( ! hasEnding(filepath, \".txt\")) {\n return ghoul::opengl::loadTexture(f);\n }\n \n \/\/ it is a txt based texture\n std::ifstream in;\n in.open(filepath.c_str());\n if (!in.is_open()) {\n LERROR(\"Could not open file \" << f);\n return nullptr;\n }\n \n int width = 512;\n float lower = 0.0f;\n float upper = 1.0f;\n \n struct mappingKey {\n float position{0.0f};\n glm::vec4 color{0.0f,0.0f,0.0f,0.0f};\n \n mappingKey(float p, const glm::vec4& c): position(p), color(c){};\n mappingKey(float p): position(p), color(glm::vec4(0.0f)){};\n bool operator<(const mappingKey& rhs) {return position < rhs.position;};\n };\n \n std::vector<mappingKey> mappingKeys;\n \n auto widthValidator = [](size_t in) { if(in > 0) return in; return static_cast<size_t>(1); };\n auto upperLowerValidator = [](float in) { return glm::clamp(in, 0.0f, 1.0f); };\n auto intensityValidator = [](float in) { if(in > 0.0f) return in; return 1.0f; };\n \n std::string line;\n while (std::getline(in, line)) {\n \n float intensity = 1.0f;\n glm::vec4 rgba = glm::vec4(0.0f);\n \/\/ tokenize the line\n std::istringstream iss(line);\n std::vector<std::string> tokens{std::istream_iterator<std::string>{iss},std::istream_iterator<std::string>{}};\n \n size_t tokenSize =tokens.size();\n if (tokenSize > 0) {\n std::string key = tokens.at(0);\n if(key == \"width\" && tokenSize == 2) {\n width = stringToNumber<int>(tokens.at(1),widthValidator);\n } else if(key == \"lower\" && tokenSize == 2) {\n lower = stringToNumber<float>(tokens.at(1),upperLowerValidator);\n } else if(key == \"upper\" && tokenSize == 2) {\n upper = stringToNumber<float>(tokens.at(1),upperLowerValidator);\n } else if(key == \"mappingkey\" && tokenSize == 6) {\n intensity = stringToNumber<float>(tokens.at(1), intensityValidator);\n for(int i = 0; i < 4; ++i)\n rgba[i] = stringToNumber<float>(tokens.at(i+2));\n\n mappingKeys.push_back({intensity, rgba});\n }\n }\n }\n in.close();\n \n\n if (mappingKeys.size() < 1) {\n return nullptr;\n }\n \n mappingKeys.insert(mappingKeys.begin(), {lower});\n mappingKeys.push_back({upper});\n \n \n for(auto key: mappingKeys) {\n glm::vec4 rgba = key.color;\n LDEBUG(\"i: \" << key.position << \", rgba: (\" << rgba[0] << \", \" << rgba[1] << \", \" << rgba[2] << \", \" << rgba[3] << \")\");\n }\n \n \/\/ allocate new float array with zeros\n float* transferFunction = new float[width*4]();\n for (int i = 0; i < 4*width; ++i) {\n transferFunction[i] = 0.0f;\n }\n \n size_t lowerIndex = static_cast<size_t>(floorf(lower*static_cast<float>(width)));\n size_t upperIndex = static_cast<size_t>(floorf(upper*static_cast<float>(width)));\n \n\/\/ LDEBUG(\"width: \" << width);\n\/\/ LDEBUG(\"lower: \" << lower);\n\/\/ LDEBUG(\"upper: \" << upper);\n\/\/ LDEBUG(\"lowerIndex: \" << lowerIndex);\n\/\/ LDEBUG(\"upperIndex: \" << upperIndex);\n \n \n auto prevKey = mappingKeys.begin();\n auto currentKey = prevKey + 1;\n auto lastKey = mappingKeys.end() -1;\n \n for (size_t i=lowerIndex; i<upperIndex; i++) {\n \n float fpos = static_cast<float>(i)\/static_cast<float>(width);\n \n if (fpos > (*currentKey).position) {\n prevKey = currentKey;\n currentKey++;\n if (currentKey == mappingKeys.end()) {\n currentKey = lastKey;\n }\n }\n \n float dist = fpos-(*prevKey).position;\n float weight = dist\/((*currentKey).position-(*prevKey).position);\n \n \/\/LDEBUG(\"fpos: \" << fpos);\n \/\/LDEBUG(\"(*prevKey).position: \" << (*prevKey).position);\n \/\/LDEBUG(\"(*currentKey).position: \" << (*currentKey).position);\n \/\/LDEBUG(\"weight: \" << weight);\n \n for (size_t channel=0; channel<4; ++channel) {\n size_t position = 4*i + channel;\n \/\/ Interpolate linearly between prev and next mapping key\n \n \/\/LDEBUG(\"i: \" << i);\n \/\/LDEBUG(\"position: \" << position);\n \/\/LDEBUG(\"(*prevKey).first \" << (*prevKey).first);\n \/\/LDEBUG(\"(*currentKey).first \" << (*currentKey).first);\n \/\/LDEBUG(\"dist: \" << dist);\n \/\/LDEBUG(\"weight: \" << weight);\n float value =\n ((*prevKey).color[channel]*(1.f-weight) + (*currentKey).color[channel]*weight)\/255.f;\n transferFunction[position] = value;\n \n \/\/LDEBUG(\"[\"<< position <<\"] \" << value);\n \n }\n LDEBUG(weight << \", (\" <<\n transferFunction[4*i+0] << \", \" <<\n transferFunction[4*i+1] << \", \" <<\n transferFunction[4*i+2] << \", \" <<\n transferFunction[4*i+3] << \")\");\n }\n \n \n return new ghoul::opengl::Texture(transferFunction, glm::size3_t(width,1,1),ghoul::opengl::Texture::Format::RGBA, GL_RGBA, GL_FLOAT);\n}\n\n} \/\/ namespace openspace<commit_msg>OpenCL fix in ghoul<commit_after>\/*****************************************************************************************\n * *\n * OpenSpace *\n * *\n * Copyright (c) 2014 *\n * *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this *\n * software and associated documentation files (the \"Software\"), to deal in the Software *\n * without restriction, including without limitation the rights to use, copy, modify, *\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to *\n * permit persons to whom the Software is furnished to do so, subject to the following *\n * conditions: *\n * *\n * The above copyright notice and this permission notice shall be included in all copies *\n * or substantial portions of the Software. *\n * *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, *\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A *\n * PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT *\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF *\n * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE *\n * OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\n ****************************************************************************************\/\n\n\/\/ open space includes\n#include <openspace\/rendering\/renderablevolume.h>\n\n#include <ghoul\/opengl\/texturereader.h>\n#include <ghoul\/filesystem\/filesystem.h>\n\n#include <openspace\/engine\/openspaceengine.h>\n#include <sgct.h>\n\n#include <iostream>\n#include <fstream>\n#include <sstream>\n#include <algorithm>\n#include <iterator>\n#include <type_traits>\n\nnamespace {\n std::string _loggerCat = \"RenderableVolume\";\n \n bool hasEnding (std::string const &fullString, std::string const &ending)\n {\n if (fullString.length() >= ending.length()) {\n return (0 == fullString.compare (fullString.length() - ending.length(), ending.length(), ending));\n } else {\n return false;\n }\n }\n \n template<typename T>\n T stringToNumber(const std::string& number, std::function<T(T)> f = nullptr) {\n static_assert(std::is_integral<T>::value || std::is_floating_point<T>::value,\n \"Must be integral or floating point\");\n std::stringstream ss;\n T templateNumber = {0};\n ss << number;\n ss >> templateNumber;\n if( ! f)\n return templateNumber;\n \n return f(templateNumber);\n \n }\n\n}\n\nnamespace openspace {\n\nRenderableVolume::RenderableVolume(const ghoul::Dictionary& dictionary) {\n \n \/\/ get path if available\n _relativePath = \"\";\n if(dictionary.hasKey(\"Path\")) {\n dictionary.getValue(\"Path\", _relativePath);\n _relativePath += \"\/\";\n }\n}\n\nRenderableVolume::~RenderableVolume() {\n}\n\nstd::string RenderableVolume::findPath(const std::string& path) {\n std::string tmp = absPath(path);\n if(FileSys.fileExists(tmp))\n return tmp;\n \n tmp = absPath(_relativePath + path);\n if(FileSys.fileExists(tmp))\n return tmp;\n \n LERROR(\"Could not find file '\" << path << \"'\");\n \n return \"\";\n}\n\nghoul::RawVolumeReader::ReadHints RenderableVolume::readHints(const ghoul::Dictionary& dictionary) {\n ghoul::RawVolumeReader::ReadHints hints;\n hints._dimensions = glm::ivec3(1, 1, 1);\n hints._format = ghoul::opengl::Texture::Format::Red;\n hints._internalFormat = GL_R8;\n \n \/\/ parse hints\n double tempValue;\n if (dictionary.hasKey(\"Dimensions.1\") && dictionary.getValue(\"Dimensions.1\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[0] = intVal;\n }\n if (dictionary.hasKey(\"Dimensions.2\") && dictionary.getValue(\"Dimensions.2\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[1] = intVal;\n }\n if (dictionary.hasKey(\"Dimensions.3\") && dictionary.getValue(\"Dimensions.3\", tempValue)) {\n int intVal = static_cast<int>(tempValue);\n if(intVal > 0)\n hints._dimensions[2] = intVal;\n }\n \n std::string format;\n if (dictionary.hasKey(\"Format\") && dictionary.getValue(\"Format\", format)) {\n if(format == \"RED\") {\n hints._format = ghoul::opengl::Texture::Format::Red;\n } else if(format == \"RG\") {\n hints._format = ghoul::opengl::Texture::Format::RG;\n } else if(format == \"RGB\") {\n hints._format = ghoul::opengl::Texture::Format::RGB;\n } else if(format == \"RGBA\") {\n hints._format = ghoul::opengl::Texture::Format::RGBA;\n }\n }\n \n format = \"\";\n if (dictionary.hasKey(\"InternalFormat\") && dictionary.getValue(\"InternalFormat\", format)) {\n if(format == \"R8\") {\n hints._internalFormat = GL_R8;\n } else if(format == \"RG8\") {\n hints._internalFormat = GL_RG8;\n } else if(format == \"RGB8\") {\n hints._internalFormat = GL_RGB8;\n } else if(format == \"RGBA8\") {\n hints._internalFormat = GL_RGB8;\n } else if(format == \"R32F\") {\n hints._internalFormat = GL_R32F;\n } else if(format == \"RG32F\") {\n hints._internalFormat = GL_RG32F;\n } else if(format == \"RGB32F\") {\n hints._internalFormat = GL_RGB32F;\n } else if(format == \"RGBA32F\") {\n hints._internalFormat = GL_RGB32F;\n }\n }\n return hints;\n}\n \nghoul::opengl::Texture* RenderableVolume::loadTransferFunction(const std::string& filepath) {\n\n std::string f = absPath(filepath);\n\n if ( ! FileSys.fileExists(f)) {\n return nullptr;\n }\n \n \/\/ check if not a txt based texture\n if ( ! hasEnding(filepath, \".txt\")) {\n return ghoul::opengl::loadTexture(f);;\n }\n \n \/\/ it is a txt based texture\n std::ifstream in;\n in.open(filepath.c_str());\n if (!in.is_open()) {\n LERROR(\"Could not open file \" << f);\n return nullptr;\n }\n \n int width = 512;\n float lower = 0.0f;\n float upper = 1.0f;\n \n struct mappingKey {\n float position{0.0f};\n glm::vec4 color{0.0f,0.0f,0.0f,0.0f};\n \n mappingKey(float p, const glm::vec4& c): position(p), color(c){};\n mappingKey(float p): position(p), color(glm::vec4(0.0f)){};\n bool operator<(const mappingKey& rhs) {return position < rhs.position;};\n };\n \n std::vector<mappingKey> mappingKeys;\n \n auto widthValidator = [](size_t in) { if(in > 0) return in; return static_cast<size_t>(1); };\n auto upperLowerValidator = [](float in) { return glm::clamp(in, 0.0f, 1.0f); };\n auto intensityValidator = [](float in) { if(in > 0.0f) return in; return 1.0f; };\n \n std::string line;\n while (std::getline(in, line)) {\n \n float intensity = 1.0f;\n glm::vec4 rgba = glm::vec4(0.0f);\n \/\/ tokenize the line\n std::istringstream iss(line);\n std::vector<std::string> tokens{std::istream_iterator<std::string>{iss},std::istream_iterator<std::string>{}};\n \n size_t tokenSize =tokens.size();\n if (tokenSize > 0) {\n std::string key = tokens.at(0);\n if(key == \"width\" && tokenSize == 2) {\n width = stringToNumber<int>(tokens.at(1),widthValidator);\n } else if(key == \"lower\" && tokenSize == 2) {\n lower = stringToNumber<float>(tokens.at(1),upperLowerValidator);\n } else if(key == \"upper\" && tokenSize == 2) {\n upper = stringToNumber<float>(tokens.at(1),upperLowerValidator);\n } else if(key == \"mappingkey\" && tokenSize == 6) {\n intensity = stringToNumber<float>(tokens.at(1), intensityValidator);\n for(int i = 0; i < 4; ++i)\n rgba[i] = stringToNumber<float>(tokens.at(i+2));\n\n mappingKeys.push_back({intensity, rgba});\n }\n }\n }\n in.close();\n \n\n if (mappingKeys.size() < 1) {\n return nullptr;\n }\n \n mappingKeys.insert(mappingKeys.begin(), {lower});\n mappingKeys.push_back({upper});\n \n \n for(auto key: mappingKeys) {\n glm::vec4 rgba = key.color;\n\/\/ LDEBUG(\"i: \" << key.position << \", rgba: (\" << rgba[0] << \", \" << rgba[1] << \", \" << rgba[2] << \", \" << rgba[3] << \")\");\n }\n \n \/\/ allocate new float array with zeros\n float* transferFunction = new float[width*4]();\n for (int i = 0; i < 4*width; ++i) {\n transferFunction[i] = 0.0f;\n }\n \n size_t lowerIndex = static_cast<size_t>(floorf(lower*static_cast<float>(width)));\n size_t upperIndex = static_cast<size_t>(floorf(upper*static_cast<float>(width)));\n \n\/\/ LDEBUG(\"width: \" << width);\n\/\/ LDEBUG(\"lower: \" << lower);\n\/\/ LDEBUG(\"upper: \" << upper);\n\/\/ LDEBUG(\"lowerIndex: \" << lowerIndex);\n\/\/ LDEBUG(\"upperIndex: \" << upperIndex);\n \n \n auto prevKey = mappingKeys.begin();\n auto currentKey = prevKey + 1;\n auto lastKey = mappingKeys.end() -1;\n \n for (size_t i=lowerIndex; i<upperIndex; i++) {\n \n float fpos = static_cast<float>(i)\/static_cast<float>(width);\n \n if (fpos > (*currentKey).position) {\n prevKey = currentKey;\n currentKey++;\n if (currentKey == mappingKeys.end()) {\n currentKey = lastKey;\n }\n }\n \n float dist = fpos-(*prevKey).position;\n float weight = dist\/((*currentKey).position-(*prevKey).position);\n \n \/\/LDEBUG(\"fpos: \" << fpos);\n \/\/LDEBUG(\"(*prevKey).position: \" << (*prevKey).position);\n \/\/LDEBUG(\"(*currentKey).position: \" << (*currentKey).position);\n \/\/LDEBUG(\"weight: \" << weight);\n \n for (size_t channel=0; channel<4; ++channel) {\n size_t position = 4*i + channel;\n \/\/ Interpolate linearly between prev and next mapping key\n \n \/\/LDEBUG(\"i: \" << i);\n \/\/LDEBUG(\"position: \" << position);\n \/\/LDEBUG(\"(*prevKey).first \" << (*prevKey).first);\n \/\/LDEBUG(\"(*currentKey).first \" << (*currentKey).first);\n \/\/LDEBUG(\"dist: \" << dist);\n \/\/LDEBUG(\"weight: \" << weight);\n float value =\n ((*prevKey).color[channel]*(1.f-weight) + (*currentKey).color[channel]*weight)\/255.f;\n transferFunction[position] = value;\n \n \/\/LDEBUG(\"[\"<< position <<\"] \" << value);\n \n }\n\/\/ LDEBUG(weight << \", (\" <<\n\/\/ transferFunction[4*i+0] << \", \" <<\n\/\/ transferFunction[4*i+1] << \", \" <<\n\/\/ transferFunction[4*i+2] << \", \" <<\n\/\/ transferFunction[4*i+3] << \")\");\n }\n\n return new ghoul::opengl::Texture(transferFunction,\n \t\tglm::size3_t(width,1,1),ghoul::opengl::Texture::Format::RGBA,\n \t\tGL_RGBA, GL_FLOAT);;\n}\n\n} \/\/ namespace openspace\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2017 SUSE LLC\n *\n * All Rights Reserved.\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of version 2 of the GNU General Public License as published\n * by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, contact Novell, Inc.\n *\n * To contact Novell about this file by physical or electronic mail, you may\n * find current contact information at www.novell.com.\n *\/\n\n\n#include <iostream>\n\n#include \"storage\/Devices\/DmRaidImpl.h\"\n#include \"storage\/Devicegraph.h\"\n#include \"storage\/Storage.h\"\n#include \"storage\/Prober.h\"\n#include \"storage\/SystemInfo\/SystemInfo.h\"\n#include \"storage\/Utils\/Exception.h\"\n#include \"storage\/Utils\/StorageTmpl.h\"\n#include \"storage\/Utils\/StorageTypes.h\"\n#include \"storage\/Utils\/StorageDefines.h\"\n#include \"storage\/Utils\/XmlFile.h\"\n#include \"storage\/Utils\/SystemCmd.h\"\n#include \"storage\/UsedFeatures.h\"\n#include \"storage\/Holders\/User.h\"\n#include \"storage\/Utils\/StorageTypes.h\"\n\n\nnamespace storage\n{\n\n using namespace std;\n\n\n const char* DeviceTraits<DmRaid>::classname = \"DmRaid\";\n\n\n DmRaid::Impl::Impl(const string& name)\n\t: Partitionable::Impl(name), rotational(false)\n {\n\tif (!is_valid_name(name))\n\t ST_THROW(Exception(\"invalid DmRaid name\"));\n\n\tset_range(Partitionable::Impl::default_range);\n\n\tset_dm_table_name(name.substr(strlen(DEVMAPPERDIR \"\/\")));\n }\n\n\n DmRaid::Impl::Impl(const string& name, const Region& region)\n\t: Partitionable::Impl(name, region, Partitionable::Impl::default_range),\n\t rotational(false)\n {\n\tif (!is_valid_name(name))\n\t ST_THROW(Exception(\"invalid DmRaid name\"));\n\n\tset_dm_table_name(name.substr(strlen(DEVMAPPERDIR \"\/\")));\n }\n\n\n DmRaid::Impl::Impl(const xmlNode* node)\n\t: Partitionable::Impl(node), rotational(false)\n {\n\tgetChildValue(node, \"rotational\", rotational);\n }\n\n\n void\n DmRaid::Impl::check() const\n {\n\tPartitionable::Impl::check();\n\n\tif (get_region().get_start() != 0)\n\t cerr << \"dm raid region start not zero\" << endl;\n\n\tif (!is_valid_name(get_name()))\n\t ST_THROW(Exception(\"invalid name\"));\n }\n\n\n bool\n DmRaid::Impl::is_valid_name(const string& name)\n {\n\treturn boost::starts_with(name, DEVMAPPERDIR \"\/\");\n }\n\n\n bool\n DmRaid::Impl::activate_dm_raids(const ActivateCallbacks* activate_callbacks)\n {\n\ty2mil(\"activate_dm_raids\");\n\n\tstring cmd_line = DMRAIDBIN \" --activate yes --no_partitions\";\n\tcout << cmd_line << endl;\n\n\tSystemCmd cmd(cmd_line);\n\tif (cmd.retcode() != 0)\n\t ST_THROW(Exception(\"activate dmraid failed\"));\n\n\tSystemCmd(UDEVADMBIN_SETTLE);\n\n\treturn true;\n }\n\n\n void\n DmRaid::Impl::probe_dm_raids(Prober& prober)\n {\n\tconst CmdDmraid& cmd_dm_raid = prober.get_system_info().getCmdDmraid();\n\n\tfor (const string& dm_name : cmd_dm_raid.get_entries())\n\t{\n\t DmRaid* dm_raid = DmRaid::create(prober.get_probed(), DEVMAPPERDIR \"\/\" + dm_name);\n\t dm_raid->get_impl().probe_pass_1a(prober);\n\t}\n }\n\n\n void\n DmRaid::Impl::probe_pass_1a(Prober& prober)\n {\n\tPartitionable::Impl::probe_pass_1a(prober);\n\n\tconst File rotational_file = prober.get_system_info().getFile(SYSFSDIR + get_sysfs_path() +\n\t\t\t\t\t\t\t\t \"\/queue\/rotational\");\n\trotational = rotational_file.get_int() != 0;\n }\n\n\n void\n DmRaid::Impl::probe_pass_1b(Prober& prober)\n {\n\tconst CmdDmraid& cmd_dmraid = prober.get_system_info().getCmdDmraid();\n\n\tconst CmdDmraid::Entry& entry = cmd_dmraid.get_entry(get_dm_table_name());\n\n\tfor (const string& device : entry.devices)\n\t{\n\t BlkDevice* blk_device = BlkDevice::Impl::find_by_name(prober.get_probed(), device,\n\t\t\t\t\t\t\t\t prober.get_system_info());\n\t User::create(prober.get_probed(), blk_device, get_non_impl());\n\t}\n }\n\n\n uint64_t\n DmRaid::Impl::used_features() const\n {\n\treturn UF_DMRAID | Partitionable::Impl::used_features();\n }\n\n\n void\n DmRaid::Impl::save(xmlNode* node) const\n {\n\tPartitionable::Impl::save(node);\n\n\tsetChildValueIf(node, \"rotational\", rotational, rotational);\n }\n\n\n void\n DmRaid::Impl::add_create_actions(Actiongraph::Impl& actiongraph) const\n {\n\tST_THROW(Exception(\"cannot create dm raid\"));\n }\n\n\n void\n DmRaid::Impl::add_delete_actions(Actiongraph::Impl& actiongraph) const\n {\n\tST_THROW(Exception(\"cannot delete dm raid\"));\n }\n\n\n bool\n DmRaid::Impl::equal(const Device::Impl& rhs_base) const\n {\n\tconst Impl& rhs = dynamic_cast<const Impl&>(rhs_base);\n\n\tif (!Partitionable::Impl::equal(rhs))\n\t return false;\n\n\treturn rotational == rhs.rotational;\n }\n\n\n void\n DmRaid::Impl::log_diff(std::ostream& log, const Device::Impl& rhs_base) const\n {\n\tconst Impl& rhs = dynamic_cast<const Impl&>(rhs_base);\n\n\tPartitionable::Impl::log_diff(log, rhs);\n\n\tstorage::log_diff(log, \"rotational\", rotational, rhs.rotational);\n }\n\n\n void\n DmRaid::Impl::print(std::ostream& out) const\n {\n\tPartitionable::Impl::print(out);\n\n\tif (rotational)\n\t out << \" rotational\";\n }\n\n\n void\n DmRaid::Impl::process_udev_ids(vector<string>& udev_ids) const\n {\n\terase_if(udev_ids, [](const string& udev_id) {\n\t return !boost::starts_with(udev_id, \"raid-\");\n\t});\n }\n\n\n bool\n compare_by_name(const DmRaid* lhs, const DmRaid* rhs)\n {\n\treturn lhs->get_name() < rhs->get_name();\n }\n\n}\n<commit_msg>- fixed DM RAID activation<commit_after>\/*\n * Copyright (c) 2017 SUSE LLC\n *\n * All Rights Reserved.\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of version 2 of the GNU General Public License as published\n * by the Free Software Foundation.\n *\n * This program is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for\n * more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, contact Novell, Inc.\n *\n * To contact Novell about this file by physical or electronic mail, you may\n * find current contact information at www.novell.com.\n *\/\n\n\n#include <iostream>\n\n#include \"storage\/Devices\/DmRaidImpl.h\"\n#include \"storage\/Devicegraph.h\"\n#include \"storage\/Storage.h\"\n#include \"storage\/Prober.h\"\n#include \"storage\/SystemInfo\/SystemInfo.h\"\n#include \"storage\/Utils\/Exception.h\"\n#include \"storage\/Utils\/StorageTmpl.h\"\n#include \"storage\/Utils\/StorageTypes.h\"\n#include \"storage\/Utils\/StorageDefines.h\"\n#include \"storage\/Utils\/XmlFile.h\"\n#include \"storage\/Utils\/SystemCmd.h\"\n#include \"storage\/UsedFeatures.h\"\n#include \"storage\/Holders\/User.h\"\n#include \"storage\/Utils\/StorageTypes.h\"\n\n\nnamespace storage\n{\n\n using namespace std;\n\n\n const char* DeviceTraits<DmRaid>::classname = \"DmRaid\";\n\n\n DmRaid::Impl::Impl(const string& name)\n\t: Partitionable::Impl(name), rotational(false)\n {\n\tif (!is_valid_name(name))\n\t ST_THROW(Exception(\"invalid DmRaid name\"));\n\n\tset_range(Partitionable::Impl::default_range);\n\n\tset_dm_table_name(name.substr(strlen(DEVMAPPERDIR \"\/\")));\n }\n\n\n DmRaid::Impl::Impl(const string& name, const Region& region)\n\t: Partitionable::Impl(name, region, Partitionable::Impl::default_range),\n\t rotational(false)\n {\n\tif (!is_valid_name(name))\n\t ST_THROW(Exception(\"invalid DmRaid name\"));\n\n\tset_dm_table_name(name.substr(strlen(DEVMAPPERDIR \"\/\")));\n }\n\n\n DmRaid::Impl::Impl(const xmlNode* node)\n\t: Partitionable::Impl(node), rotational(false)\n {\n\tgetChildValue(node, \"rotational\", rotational);\n }\n\n\n void\n DmRaid::Impl::check() const\n {\n\tPartitionable::Impl::check();\n\n\tif (get_region().get_start() != 0)\n\t cerr << \"dm raid region start not zero\" << endl;\n\n\tif (!is_valid_name(get_name()))\n\t ST_THROW(Exception(\"invalid name\"));\n }\n\n\n bool\n DmRaid::Impl::is_valid_name(const string& name)\n {\n\treturn boost::starts_with(name, DEVMAPPERDIR \"\/\");\n }\n\n\n bool\n DmRaid::Impl::activate_dm_raids(const ActivateCallbacks* activate_callbacks)\n {\n\ty2mil(\"activate_dm_raids\");\n\n\tstring cmd_line = DMRAIDBIN \" --activate yes --no_partitions\";\n\tcout << cmd_line << endl;\n\n\tSystemCmd cmd(cmd_line);\n\n\tif (cmd.retcode() == 0)\n\t SystemCmd(UDEVADMBIN_SETTLE);\n\n\treturn cmd.retcode() == 0;\n }\n\n\n void\n DmRaid::Impl::probe_dm_raids(Prober& prober)\n {\n\tconst CmdDmraid& cmd_dm_raid = prober.get_system_info().getCmdDmraid();\n\n\tfor (const string& dm_name : cmd_dm_raid.get_entries())\n\t{\n\t DmRaid* dm_raid = DmRaid::create(prober.get_probed(), DEVMAPPERDIR \"\/\" + dm_name);\n\t dm_raid->get_impl().probe_pass_1a(prober);\n\t}\n }\n\n\n void\n DmRaid::Impl::probe_pass_1a(Prober& prober)\n {\n\tPartitionable::Impl::probe_pass_1a(prober);\n\n\tconst File rotational_file = prober.get_system_info().getFile(SYSFSDIR + get_sysfs_path() +\n\t\t\t\t\t\t\t\t \"\/queue\/rotational\");\n\trotational = rotational_file.get_int() != 0;\n }\n\n\n void\n DmRaid::Impl::probe_pass_1b(Prober& prober)\n {\n\tconst CmdDmraid& cmd_dmraid = prober.get_system_info().getCmdDmraid();\n\n\tconst CmdDmraid::Entry& entry = cmd_dmraid.get_entry(get_dm_table_name());\n\n\tfor (const string& device : entry.devices)\n\t{\n\t BlkDevice* blk_device = BlkDevice::Impl::find_by_name(prober.get_probed(), device,\n\t\t\t\t\t\t\t\t prober.get_system_info());\n\t User::create(prober.get_probed(), blk_device, get_non_impl());\n\t}\n }\n\n\n uint64_t\n DmRaid::Impl::used_features() const\n {\n\treturn UF_DMRAID | Partitionable::Impl::used_features();\n }\n\n\n void\n DmRaid::Impl::save(xmlNode* node) const\n {\n\tPartitionable::Impl::save(node);\n\n\tsetChildValueIf(node, \"rotational\", rotational, rotational);\n }\n\n\n void\n DmRaid::Impl::add_create_actions(Actiongraph::Impl& actiongraph) const\n {\n\tST_THROW(Exception(\"cannot create dm raid\"));\n }\n\n\n void\n DmRaid::Impl::add_delete_actions(Actiongraph::Impl& actiongraph) const\n {\n\tST_THROW(Exception(\"cannot delete dm raid\"));\n }\n\n\n bool\n DmRaid::Impl::equal(const Device::Impl& rhs_base) const\n {\n\tconst Impl& rhs = dynamic_cast<const Impl&>(rhs_base);\n\n\tif (!Partitionable::Impl::equal(rhs))\n\t return false;\n\n\treturn rotational == rhs.rotational;\n }\n\n\n void\n DmRaid::Impl::log_diff(std::ostream& log, const Device::Impl& rhs_base) const\n {\n\tconst Impl& rhs = dynamic_cast<const Impl&>(rhs_base);\n\n\tPartitionable::Impl::log_diff(log, rhs);\n\n\tstorage::log_diff(log, \"rotational\", rotational, rhs.rotational);\n }\n\n\n void\n DmRaid::Impl::print(std::ostream& out) const\n {\n\tPartitionable::Impl::print(out);\n\n\tif (rotational)\n\t out << \" rotational\";\n }\n\n\n void\n DmRaid::Impl::process_udev_ids(vector<string>& udev_ids) const\n {\n\terase_if(udev_ids, [](const string& udev_id) {\n\t return !boost::starts_with(udev_id, \"raid-\");\n\t});\n }\n\n\n bool\n compare_by_name(const DmRaid* lhs, const DmRaid* rhs)\n {\n\treturn lhs->get_name() < rhs->get_name();\n }\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: propertybaghelper.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: kz $ $Date: 2007-05-10 09:59:04 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef FORMS_PROPERTYBAGHELPER_HXX\n#define FORMS_PROPERTYBAGHELPER_HXX\n\n\/** === begin UNO includes === **\/\n#ifndef _COM_SUN_STAR_BEANS_PROPERTYVALUE_HPP_\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#endif\n\/** === end UNO includes === **\/\n\n#include <comphelper\/propertybag.hxx>\n#include <comphelper\/propagg.hxx>\n\n#include <boost\/noncopyable.hpp>\n\n\/\/........................................................................\nnamespace frm\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= class IPropertyBagHelperContext\n \/\/====================================================================\n class SAL_NO_VTABLE IPropertyBagHelperContext\n {\n public:\n virtual ::osl::Mutex& getMutex() = 0;\n\n virtual void describeFixedAndAggregateProperties(\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property >& _out_rFixedProperties,\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property >& _out_rAggregateProperties\n ) const = 0;\n\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XMultiPropertySet >\n getPropertiesInterface() = 0;\n };\n\n \/\/====================================================================\n \/\/= class PropertyBagHelper\n \/\/====================================================================\n class PropertyBagHelper : public ::boost::noncopyable\n {\n private:\n IPropertyBagHelperContext& m_rContext;\n ::comphelper::OPropertyArrayAggregationHelper* m_pPropertyArrayHelper;\n ::comphelper::PropertyBag m_aDynamicProperties;\n bool m_bDisposed;\n\n public:\n PropertyBagHelper( IPropertyBagHelperContext& _rContext );\n ~PropertyBagHelper();\n\n \/\/ XComponent equivalent\n void dispose();\n\n \/\/ OPropertySetHelper equivalent\n inline ::comphelper::OPropertyArrayAggregationHelper& getInfoHelper() const;\n\n \/\/ XPropertyContainer equivalent\n void addProperty( const ::rtl::OUString& _rName, ::sal_Int16 _nAttributes, const ::com::sun::star::uno::Any& _rInitialValue );\n void removeProperty( const ::rtl::OUString& _rName );\n\n \/\/ XPropertyAccess equivalent\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > SAL_CALL getPropertyValues();\n void setPropertyValues( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rProps );\n\n \/\/ forwards to m_aDynamicProperties\n inline void getDynamicFastPropertyValue( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const;\n inline bool convertDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rNewValue, ::com::sun::star::uno::Any& _out_rConvertedValue, ::com::sun::star::uno::Any& _out_rCurrentValue ) const;\n inline void setDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rValue );\n inline void getDynamicPropertyDefaultByHandle( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const;\n inline bool hasDynamicPropertyByName( const ::rtl::OUString& _rName ) const;\n inline bool hasDynamicPropertyByHandle( sal_Int32 _nHandle ) const;\n\n private:\n void impl_nts_checkDisposed_throw() const;\n\n \/** invalidates our property set info, so subsequent calls to impl_ts_getArrayHelper and thus\n getInfoHelper will return a newly created instance\n *\/\n void impl_nts_invalidatePropertySetInfo();\n\n \/** returns the IPropertyArrayHelper instance used by |this|\n *\/\n ::comphelper::OPropertyArrayAggregationHelper& impl_ts_getArrayHelper() const;\n\n \/** finds a free property handle\n @param _rPropertyName\n the name of the property to find a handle for. If possible, the handle as determined by\n our ConcreteInfoService instance will be used\n *\/\n sal_Int32 impl_findFreeHandle( const ::rtl::OUString& _rPropertyName );\n };\n\n \/\/--------------------------------------------------------------------\n inline ::comphelper::OPropertyArrayAggregationHelper& PropertyBagHelper::getInfoHelper() const\n {\n return impl_ts_getArrayHelper();\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::getDynamicFastPropertyValue( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const\n {\n m_aDynamicProperties.getFastPropertyValue( _nHandle, _out_rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::convertDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rNewValue, ::com::sun::star::uno::Any& _out_rConvertedValue, ::com::sun::star::uno::Any& _out_rCurrentValue ) const\n {\n return m_aDynamicProperties.convertFastPropertyValue( _nHandle, _rNewValue, _out_rConvertedValue, _out_rCurrentValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::setDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rValue )\n {\n m_aDynamicProperties.setFastPropertyValue( _nHandle, _rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::getDynamicPropertyDefaultByHandle( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const\n {\n m_aDynamicProperties.getPropertyDefaultByHandle( _nHandle, _out_rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::hasDynamicPropertyByName( const ::rtl::OUString& _rName ) const\n {\n return m_aDynamicProperties.hasPropertyByName( _rName );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::hasDynamicPropertyByHandle( sal_Int32 _nHandle ) const\n {\n return m_aDynamicProperties.hasPropertyByHandle( _nHandle );\n }\n\n\/\/........................................................................\n} \/\/ namespace frm\n\/\/........................................................................\n\n#endif \/\/ FORMS_PROPERTYBAGHELPER_HXX\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.78); FILE MERGED 2008\/04\/01 12:30:28 thb 1.2.78.2: #i85898# Stripping all external header guards 2008\/03\/31 13:11:39 rt 1.2.78.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: propertybaghelper.hxx,v $\n * $Revision: 1.3 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef FORMS_PROPERTYBAGHELPER_HXX\n#define FORMS_PROPERTYBAGHELPER_HXX\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n\/** === end UNO includes === **\/\n\n#include <comphelper\/propertybag.hxx>\n#include <comphelper\/propagg.hxx>\n\n#include <boost\/noncopyable.hpp>\n\n\/\/........................................................................\nnamespace frm\n{\n\/\/........................................................................\n\n \/\/====================================================================\n \/\/= class IPropertyBagHelperContext\n \/\/====================================================================\n class SAL_NO_VTABLE IPropertyBagHelperContext\n {\n public:\n virtual ::osl::Mutex& getMutex() = 0;\n\n virtual void describeFixedAndAggregateProperties(\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property >& _out_rFixedProperties,\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::Property >& _out_rAggregateProperties\n ) const = 0;\n\n virtual ::com::sun::star::uno::Reference< ::com::sun::star::beans::XMultiPropertySet >\n getPropertiesInterface() = 0;\n };\n\n \/\/====================================================================\n \/\/= class PropertyBagHelper\n \/\/====================================================================\n class PropertyBagHelper : public ::boost::noncopyable\n {\n private:\n IPropertyBagHelperContext& m_rContext;\n ::comphelper::OPropertyArrayAggregationHelper* m_pPropertyArrayHelper;\n ::comphelper::PropertyBag m_aDynamicProperties;\n bool m_bDisposed;\n\n public:\n PropertyBagHelper( IPropertyBagHelperContext& _rContext );\n ~PropertyBagHelper();\n\n \/\/ XComponent equivalent\n void dispose();\n\n \/\/ OPropertySetHelper equivalent\n inline ::comphelper::OPropertyArrayAggregationHelper& getInfoHelper() const;\n\n \/\/ XPropertyContainer equivalent\n void addProperty( const ::rtl::OUString& _rName, ::sal_Int16 _nAttributes, const ::com::sun::star::uno::Any& _rInitialValue );\n void removeProperty( const ::rtl::OUString& _rName );\n\n \/\/ XPropertyAccess equivalent\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > SAL_CALL getPropertyValues();\n void setPropertyValues( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rProps );\n\n \/\/ forwards to m_aDynamicProperties\n inline void getDynamicFastPropertyValue( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const;\n inline bool convertDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rNewValue, ::com::sun::star::uno::Any& _out_rConvertedValue, ::com::sun::star::uno::Any& _out_rCurrentValue ) const;\n inline void setDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rValue );\n inline void getDynamicPropertyDefaultByHandle( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const;\n inline bool hasDynamicPropertyByName( const ::rtl::OUString& _rName ) const;\n inline bool hasDynamicPropertyByHandle( sal_Int32 _nHandle ) const;\n\n private:\n void impl_nts_checkDisposed_throw() const;\n\n \/** invalidates our property set info, so subsequent calls to impl_ts_getArrayHelper and thus\n getInfoHelper will return a newly created instance\n *\/\n void impl_nts_invalidatePropertySetInfo();\n\n \/** returns the IPropertyArrayHelper instance used by |this|\n *\/\n ::comphelper::OPropertyArrayAggregationHelper& impl_ts_getArrayHelper() const;\n\n \/** finds a free property handle\n @param _rPropertyName\n the name of the property to find a handle for. If possible, the handle as determined by\n our ConcreteInfoService instance will be used\n *\/\n sal_Int32 impl_findFreeHandle( const ::rtl::OUString& _rPropertyName );\n };\n\n \/\/--------------------------------------------------------------------\n inline ::comphelper::OPropertyArrayAggregationHelper& PropertyBagHelper::getInfoHelper() const\n {\n return impl_ts_getArrayHelper();\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::getDynamicFastPropertyValue( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const\n {\n m_aDynamicProperties.getFastPropertyValue( _nHandle, _out_rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::convertDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rNewValue, ::com::sun::star::uno::Any& _out_rConvertedValue, ::com::sun::star::uno::Any& _out_rCurrentValue ) const\n {\n return m_aDynamicProperties.convertFastPropertyValue( _nHandle, _rNewValue, _out_rConvertedValue, _out_rCurrentValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::setDynamicFastPropertyValue( sal_Int32 _nHandle, const ::com::sun::star::uno::Any& _rValue )\n {\n m_aDynamicProperties.setFastPropertyValue( _nHandle, _rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline void PropertyBagHelper::getDynamicPropertyDefaultByHandle( sal_Int32 _nHandle, ::com::sun::star::uno::Any& _out_rValue ) const\n {\n m_aDynamicProperties.getPropertyDefaultByHandle( _nHandle, _out_rValue );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::hasDynamicPropertyByName( const ::rtl::OUString& _rName ) const\n {\n return m_aDynamicProperties.hasPropertyByName( _rName );\n }\n\n \/\/--------------------------------------------------------------------\n inline bool PropertyBagHelper::hasDynamicPropertyByHandle( sal_Int32 _nHandle ) const\n {\n return m_aDynamicProperties.hasPropertyByHandle( _nHandle );\n }\n\n\/\/........................................................................\n} \/\/ namespace frm\n\/\/........................................................................\n\n#endif \/\/ FORMS_PROPERTYBAGHELPER_HXX\n\n<|endoftext|>"} {"text":"<commit_before>#include <algorithm>\n\n#include <UnitTest++\/UnitTest++.h>\n\n#include \"Article.h\"\n#include \"WalkerException.h\"\n#include \"WikimediaJsonToArticleConverter.h\"\n\nSUITE(WikimediaJsonToArticleConverterTests)\n{\n using namespace WikiWalker;\n using namespace WikiWalker::CollectionUtils;\n\n TEST(JsonDataWithOneLinkedArticle)\n {\n std::string testdata =\n R\"({\"batchcomplete\":\"\",\"servedby\":\"mw1197\",\"query\":{\"pages\":[{\"pageid\":36669940,\"ns\":0,\"title\":\"3PTT\",\"links\":[{\"ns\":0,\"title\":\"Switch\"}]}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto cont = conv.convert(testdata, ac);\n CHECK(WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionCompleted == cont);\n CHECK_EQUAL(\"\", conv.continuationData()[\"plcontinue\"]);\n auto getArticle = CollectionUtils::get(ac, \"3PTT\");\n CHECK(getArticle != nullptr);\n CHECK_EQUAL(1, getArticle->countLinks());\n CHECK_EQUAL(2, ac.size());\n }\n\n TEST(JsonDataWithInvalidArticle_Throws)\n {\n std::string testdata =\n R\"({\"batchcomplete\":\"\",\"servedby\":\"mw1208\",\"query\":{\"pages\":[{\"ns\":0,\"title\":\"FoObAr\",\"missing\":\"\"}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto ret = conv.convert(testdata, ac);\n CHECK(ret == WikiWalker::WikimediaJsonToArticleConverter::\n ContinuationStatus::ConversionCompleted);\n auto art = CollectionUtils::get(ac, \"FoObAr\");\n CHECK(art != nullptr);\n CHECK(art->marked());\n }\n\n TEST(JsonData_MoreLinks_HasContinueData)\n {\n std::string testdata =\n R\"({\"continue\":{\"plcontinue\":\"34419161|0|Jharkhand\",\"continue\":\"||\"},\"servedby\":\"mw1283\",\"query\":{\"pages\":[{\"pageid\":34419161,\"ns\":0,\"title\":\"Satar, Deoghar\",\"links\":[{\"ns\":0,\"title\":\"Deoghar district\"}]}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto cont = conv.convert(testdata, ac);\n CHECK(cont == WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionNeedsMoreData);\n CHECK_EQUAL(\"34419161|0|Jharkhand\", conv.continuationData()[\"plcontinue\"]);\n auto getArticle = CollectionUtils::get(ac, \"Satar, Deoghar\");\n CHECK(getArticle != nullptr);\n CHECK_EQUAL(1, getArticle->countLinks());\n CHECK_EQUAL(2, ac.size());\n }\n\n TEST(JsonData_ContainsMultipleArticles)\n {\n std::string testdata =\n R\"#({\"batchcomplete\": true,\"query\": {\"normalized\": [{\"fromencoded\": false,\"from\": \"Zanfina_Ismajli\",\"to\": \"Zanfina Ismajli\"},{\"fromencoded\": false,\"from\": \"Kleite_(Tochter_des_Danaos)\",\"to\": \"Kleite (Tochter des Danaos)\"}],\"pages\": [{\"pageid\": 2834303,\"ns\": 0,\"title\": \"Zanfina Ismajli\",\"links\": [{\"ns\": 0,\"title\": \"10. Mai\"},{\"ns\": 0,\"title\": \"1985\"}]},{\"pageid\": 8086803,\"ns\": 0,\"title\": \"Kleite (Tochter des Danaos)\",\"links\": [{\"ns\": 0,\"title\": \"Aigyptos\"},{\"ns\": 0,\"title\": \"Altgriechische Sprache\"}]}]},\"limits\": {\"links\": 500}})#\";\n WikimediaJsonToArticleConverter conv;\n ArticleCollection ac;\n auto cont = conv.convert(testdata, ac);\n CHECK(WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionCompleted == cont);\n\n CHECK_EQUAL(2, CollectionUtils::countAnalyzedArticles(ac));\n auto ptr = CollectionUtils::get(ac, \"Zanfina Ismajli\");\n CHECK(ptr != nullptr);\n ptr = CollectionUtils::get(ac, \"Kleite (Tochter des Danaos)\");\n CHECK(ptr != nullptr);\n CHECK_EQUAL(6, ac.size());\n }\n}\n<commit_msg>add tests for backwards links \/ linkshere<commit_after>#include <algorithm>\n\n#include <UnitTest++\/UnitTest++.h>\n\n#include \"Article.h\"\n#include \"WalkerException.h\"\n#include \"WikimediaJsonToArticleConverter.h\"\n\nSUITE(WikimediaJsonToArticleConverterTests)\n{\n using namespace WikiWalker;\n using namespace WikiWalker::CollectionUtils;\n\n TEST(JsonDataWithOneLinkedArticle)\n {\n std::string testdata =\n R\"({\"batchcomplete\":\"\",\"servedby\":\"mw1197\",\"query\":{\"pages\":[{\"pageid\":36669940,\"ns\":0,\"title\":\"3PTT\",\"links\":[{\"ns\":0,\"title\":\"Switch\"}]}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto cont = conv.convert(testdata, ac);\n CHECK(WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionCompleted == cont);\n CHECK_EQUAL(\"\", conv.continuationData()[\"plcontinue\"]);\n auto getArticle = CollectionUtils::get(ac, \"3PTT\");\n CHECK(getArticle != nullptr);\n CHECK_EQUAL(1, getArticle->countLinks());\n CHECK_EQUAL(2, ac.size());\n }\n\n TEST(JsonDataWithInvalidArticle_Throws)\n {\n std::string testdata =\n R\"({\"batchcomplete\":\"\",\"servedby\":\"mw1208\",\"query\":{\"pages\":[{\"ns\":0,\"title\":\"FoObAr\",\"missing\":\"\"}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto ret = conv.convert(testdata, ac);\n CHECK(ret == WikiWalker::WikimediaJsonToArticleConverter::\n ContinuationStatus::ConversionCompleted);\n auto art = CollectionUtils::get(ac, \"FoObAr\");\n CHECK(art != nullptr);\n CHECK(art->marked());\n }\n\n TEST(JsonData_MoreLinks_HasContinueData)\n {\n std::string testdata =\n R\"({\"continue\":{\"plcontinue\":\"34419161|0|Jharkhand\",\"continue\":\"||\"},\"servedby\":\"mw1283\",\"query\":{\"pages\":[{\"pageid\":34419161,\"ns\":0,\"title\":\"Satar, Deoghar\",\"links\":[{\"ns\":0,\"title\":\"Deoghar district\"}]}]}})\";\n\n ArticleCollection ac;\n WikimediaJsonToArticleConverter conv;\n auto cont = conv.convert(testdata, ac);\n CHECK(cont == WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionNeedsMoreData);\n CHECK_EQUAL(\"34419161|0|Jharkhand\", conv.continuationData()[\"plcontinue\"]);\n auto getArticle = CollectionUtils::get(ac, \"Satar, Deoghar\");\n CHECK(getArticle != nullptr);\n CHECK_EQUAL(1, getArticle->countLinks());\n CHECK_EQUAL(2, ac.size());\n }\n\n TEST(JsonData_ContainsMultipleArticles)\n {\n std::string testdata =\n R\"#({\"batchcomplete\": true,\"query\": {\"normalized\": [{\"fromencoded\": false,\"from\": \"Zanfina_Ismajli\",\"to\": \"Zanfina Ismajli\"},{\"fromencoded\": false,\"from\": \"Kleite_(Tochter_des_Danaos)\",\"to\": \"Kleite (Tochter des Danaos)\"}],\"pages\": [{\"pageid\": 2834303,\"ns\": 0,\"title\": \"Zanfina Ismajli\",\"links\": [{\"ns\": 0,\"title\": \"10. Mai\"},{\"ns\": 0,\"title\": \"1985\"}]},{\"pageid\": 8086803,\"ns\": 0,\"title\": \"Kleite (Tochter des Danaos)\",\"links\": [{\"ns\": 0,\"title\": \"Aigyptos\"},{\"ns\": 0,\"title\": \"Altgriechische Sprache\"}]}]},\"limits\": {\"links\": 500}})#\";\n WikimediaJsonToArticleConverter conv;\n ArticleCollection ac;\n auto cont = conv.convert(testdata, ac);\n CHECK(WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionCompleted == cont);\n\n CHECK_EQUAL(2, CollectionUtils::countAnalyzedArticles(ac));\n auto ptr = CollectionUtils::get(ac, \"Zanfina Ismajli\");\n CHECK(ptr != nullptr);\n ptr = CollectionUtils::get(ac, \"Kleite (Tochter des Danaos)\");\n CHECK(ptr != nullptr);\n CHECK_EQUAL(6, ac.size());\n }\n\n TEST(JsonData_ConvertLinkshere)\n {\n std::string testdata =\n R\"#({\"batchcomplete\":true,\"query\":{\"pages\":[{\"pageid\":2,\"ns\":0,\"title\":\"Eins\",\"linkshere\":[{\"ns\":0,\"title\":\"Zw\\u00f6lf\"},{\"ns\":0,\"title\":\"Dreizehn\"},{\"ns\":0,\"title\":\"Ens\"}]}]},\"limits\":{\"linkshere\":500}})#\";\n WikimediaJsonToArticleConverter conv;\n ArticleCollection ac;\n auto cont = conv.convert(testdata, ac);\n\n \/\/ exp: zwölf, dreizehn, ens --> eins\n CHECK(WikimediaJsonToArticleConverter::ContinuationStatus::\n ConversionCompleted == cont);\n CHECK_EQUAL(3, CollectionUtils::countAnalyzedArticles(ac));\n CHECK_EQUAL(4, ac.size());\n\n auto ptr = CollectionUtils::get(ac, \"Ens\");\n REQUIRE CHECK(ptr != nullptr);\n CHECK(ptr->analyzed());\n ptr = CollectionUtils::get(ac, \"Dreizehn\");\n REQUIRE CHECK(ptr != nullptr);\n CHECK(ptr->analyzed());\n \/\/ better be save than sorry\n ptr = CollectionUtils::get(ac, \"Zw\\u00f6lf\");\n REQUIRE CHECK(ptr != nullptr);\n CHECK(ptr->analyzed());\n ptr = CollectionUtils::get(ac, \"Eins\");\n REQUIRE CHECK(ptr != nullptr);\n CHECK(!ptr->analyzed());\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *\n* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *\n* *\n* This library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Framework *\n* *\n* Authors: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*\n* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza, *\n* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include \"OptionsGroup.h\"\n\n\nnamespace sofa\n{\n\nnamespace helper\n{\n\nclass OptionsGroup;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup() : textItems()\n{\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup(int nbofRadioButton,...)\n{\n textItems.resize(nbofRadioButton);\n va_list vl;\n va_start(vl,nbofRadioButton);\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n const char * tempochar=va_arg(vl,char *);\n std::string tempostring(tempochar);\n textItems[i]=tempostring;\n }\n va_end(vl);\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup(const OptionsGroup & m_radiotrick) : textItems(m_radiotrick.textItems)\n{\n selectedItem=m_radiotrick.getSelectedId();\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup & OptionsGroup::operator=(const OptionsGroup & m_radiotrick)\n{\n textItems.resize(m_radiotrick.textItems.size());\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n textItems[i]=m_radiotrick.textItems[i];\n }\n selectedItem=m_radiotrick.selectedItem;\n return *this;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setNames(int nbofRadioButton,...)\n{\n textItems.resize(nbofRadioButton);\n va_list vl;\n va_start(vl,nbofRadioButton);\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n const char * tempochar=va_arg(vl,char *);\n std::string tempostring(tempochar);\n textItems[i]=tempostring;\n }\n va_end(vl);\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint OptionsGroup::isInButtonList(const std::string & tempostring) const\n{\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n if (textItems[i]==tempostring) return i;\n }\n return -1;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setSelectedItem(unsigned int id_item)\n{\n if (id_item<textItems.size())\n selectedItem=id_item;\n \/\/std::cout<<\"OptionsGroup:: ==============================setted :\"<< this->selectedItem << std::endl;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setSelectedItem(const std::string & m_string)\n{\n int id_stringinButtonList = isInButtonList(m_string);\n if (id_stringinButtonList == -1)\n {\n std::cout<<\"WARNING(OptionsGroup) : \\\"\"<< m_string <<\"\\\" is not a parameter in button list :\\\" \"<<(*this)<<\"\\\"\"<< std::endl;\n }\n else\n {\n setSelectedItem(id_stringinButtonList);\n }\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nunsigned int OptionsGroup::getSelectedId() const\n{\n return selectedItem;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string OptionsGroup::getSelectedItem() const\n{\n std::string checkedString;\n checkedString = textItems.operator[](selectedItem);\n return checkedString;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::readFromStream(std::istream & stream)\n{\n std::string tempostring;\n stream >> tempostring;\n int id_stringinButtonList = isInButtonList(tempostring);\n if (id_stringinButtonList == -1)\n {\n std::cout<<\"WARNING(OptionsGroup) : \\\"\"<< tempostring <<\"\\\" is not a parameter in button list :\\\" \"<<(*this)<<\"\\\"\"<< std::endl;\n }\n else\n {\n setSelectedItem(id_stringinButtonList);\n }\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::writeToStream(std::ostream & stream) const\n{\n\n for(unsigned int i=0; i<textItems.size()-1; i++)\n {\n std::string tempostring= textItems.operator[](i);\n stream<< tempostring << \" \";\n }\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::TestOptionsGroup() const\n{\n sofa::helper::OptionsGroup m_radiotrick; m_radiotrick.setNames(3,\"hello1\",\"hello2\",\"hello3\");\n std::cout<<\"Radio button :\"<<m_radiotrick<<\" selectedId :\"<<m_radiotrick.getSelectedId()<<\" getSelectedItem() :\"<<m_radiotrick.getSelectedItem()<<std::endl;\n std::cin>>m_radiotrick;\n std::cout<<\"Radio button :\"<<m_radiotrick<<\" selectedId :\"<<m_radiotrick.getSelectedId()<<\" getSelectedItem() :\"<<m_radiotrick.getSelectedItem()<<std::endl;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace helper\n\n} \/\/ namespace sofa\n<commit_msg>r7394\/sofa-dev : FIX: bug with OptionGroup: writeToStream method was not correct<commit_after>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *\n* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *\n* *\n* This library is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU Lesser General Public License as published by *\n* the Free Software Foundation; either version 2.1 of the License, or (at *\n* your option) any later version. *\n* *\n* This library is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License *\n* for more details. *\n* *\n* You should have received a copy of the GNU Lesser General Public License *\n* along with this library; if not, write to the Free Software Foundation, *\n* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. *\n*******************************************************************************\n* SOFA :: Framework *\n* *\n* Authors: M. Adam, J. Allard, B. Andre, P-J. Bensoussan, S. Cotin, C. Duriez,*\n* H. Delingette, F. Falipou, F. Faure, S. Fonteneau, L. Heigeas, C. Mendoza, *\n* M. Nesme, P. Neumann, J-P. de la Plata Alcade, F. Poyer and F. Roy *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include \"OptionsGroup.h\"\n\n\nnamespace sofa\n{\n\nnamespace helper\n{\n\nclass OptionsGroup;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup() : textItems()\n{\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup(int nbofRadioButton,...)\n{\n textItems.resize(nbofRadioButton);\n va_list vl;\n va_start(vl,nbofRadioButton);\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n const char * tempochar=va_arg(vl,char *);\n std::string tempostring(tempochar);\n textItems[i]=tempostring;\n }\n va_end(vl);\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup::OptionsGroup(const OptionsGroup & m_radiotrick) : textItems(m_radiotrick.textItems)\n{\n selectedItem=m_radiotrick.getSelectedId();\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nOptionsGroup & OptionsGroup::operator=(const OptionsGroup & m_radiotrick)\n{\n textItems.resize(m_radiotrick.textItems.size());\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n textItems[i]=m_radiotrick.textItems[i];\n }\n selectedItem=m_radiotrick.selectedItem;\n return *this;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setNames(int nbofRadioButton,...)\n{\n textItems.resize(nbofRadioButton);\n va_list vl;\n va_start(vl,nbofRadioButton);\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n const char * tempochar=va_arg(vl,char *);\n std::string tempostring(tempochar);\n textItems[i]=tempostring;\n }\n va_end(vl);\n selectedItem=0;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint OptionsGroup::isInButtonList(const std::string & tempostring) const\n{\n for(unsigned int i=0; i<textItems.size(); i++)\n {\n if (textItems[i]==tempostring) return i;\n }\n return -1;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setSelectedItem(unsigned int id_item)\n{\n if (id_item<textItems.size())\n selectedItem=id_item;\n \/\/std::cout<<\"OptionsGroup:: ==============================setted :\"<< this->selectedItem << std::endl;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::setSelectedItem(const std::string & m_string)\n{\n int id_stringinButtonList = isInButtonList(m_string);\n if (id_stringinButtonList == -1)\n {\n std::cout<<\"WARNING(OptionsGroup) : \\\"\"<< m_string <<\"\\\" is not a parameter in button list :\\\" \"<<(*this)<<\"\\\"\"<< std::endl;\n }\n else\n {\n setSelectedItem(id_stringinButtonList);\n }\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nunsigned int OptionsGroup::getSelectedId() const\n{\n return selectedItem;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nstd::string OptionsGroup::getSelectedItem() const\n{\n std::string checkedString;\n checkedString = textItems.operator[](selectedItem);\n return checkedString;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::readFromStream(std::istream & stream)\n{\n std::string tempostring;\n stream >> tempostring;\n int id_stringinButtonList = isInButtonList(tempostring);\n if (id_stringinButtonList == -1)\n {\n std::cout<<\"WARNING(OptionsGroup) : \\\"\"<< tempostring <<\"\\\" is not a parameter in button list :\\\" \"<<(*this)<<\"\\\"\"<< std::endl;\n }\n else\n {\n setSelectedItem(id_stringinButtonList);\n }\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::writeToStream(std::ostream & stream) const\n{\n stream << getSelectedItem();\n\/\/\tfor(unsigned int i=0;i<textItems.size()-1;i++)\n\/\/\t{\n\/\/\t\tstd::string tempostring= textItems.operator[](i);\n\/\/\t\tstream<< tempostring << \" \";\n\/\/\t}\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nvoid OptionsGroup::TestOptionsGroup() const\n{\n sofa::helper::OptionsGroup m_radiotrick; m_radiotrick.setNames(3,\"hello1\",\"hello2\",\"hello3\");\n std::cout<<\"Radio button :\"<<m_radiotrick<<\" selectedId :\"<<m_radiotrick.getSelectedId()<<\" getSelectedItem() :\"<<m_radiotrick.getSelectedItem()<<std::endl;\n std::cin>>m_radiotrick;\n std::cout<<\"Radio button :\"<<m_radiotrick<<\" selectedId :\"<<m_radiotrick.getSelectedId()<<\" getSelectedItem() :\"<<m_radiotrick.getSelectedItem()<<std::endl;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n} \/\/ namespace helper\n\n} \/\/ namespace sofa\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: login.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: as $ $Date: 2001-03-29 13:17:12 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_SERVICES_LOGINDIALOG_HXX_\n#include <services\/logindialog.hxx>\n#endif\n\n#ifndef __FRAMEWORK_CLASSES_SERVICEMANAGER_HXX_\n#include <classes\/servicemanager.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_DEBUG_HXX_\n#include <macros\/debug.hxx>\n#endif\n\n#ifndef __FRAMEWORK_SERVICES_H_\n#include <services.h>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_AWT_XDIALOG_HPP_\n#include <com\/sun\/star\/awt\/XDialog.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n\n#ifndef _VOS_PROCESS_HXX_\n#include <vos\/process.hxx>\n#endif\n\n#ifndef _RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _SV_EVENT_HXX\n#include <vcl\/event.hxx>\n#endif\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n#ifndef _SV_WRKWIN_HXX\n#include <vcl\/wrkwin.hxx>\n#endif\n\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n#include <stdio.h>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ const\n\/\/_________________________________________________________________________________________________________________\n\n#define TEMPFILE_ENCODING RTL_TEXTENCODING_UTF8 \/\/ encoding of written temp. ascii file\n#define ARGUMENTFOUND 0 \/\/ OUString::compareTo returns 0 if searched string match given one\n#define SEPERATOR (sal_Unicode)';' \/\/ seperator for temp. file values\n#define ENCODESIGN (sal_Unicode)'\\\\' \/\/ special character to encode SEPERATOR. These sign must be encoded too!!!\n\n#define ARGUMENT_TEMPFILE DECLARE_ASCII(\"-f=\") \/\/ we support \"-f=c:\\temp\\test.txt\" as argument\n#define ARGUMENTLENGTH_TEMPFILE 3 \/\/ length of ARGUMENT_TEMPFILE to find it in argumentlist\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nusing namespace ::rtl ;\nusing namespace ::vos ;\nusing namespace ::comphelper ;\nusing namespace ::framework ;\nusing namespace ::com::sun::star::uno ;\nusing namespace ::com::sun::star::lang ;\nusing namespace ::com::sun::star::awt ;\nusing namespace ::com::sun::star::beans ;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ defines\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ declarations\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n @short implement command application to show login dialog and save his information in temp. file!\n @descr We need this temp. file to share informations between our dialog and different processes, which\n can't use vcl directly. Caller of this executable give us the file name as an argument - we save\n all informations in it - caller can read it and MUST delete temp. file.\n This is neccessary for example; to hide the password!\n\n @implements -\n\n @base Application\n*\/\/*-*************************************************************************************************************\/\nclass LoginApplication : public Application\n{\n \/\/*************************************************************************************************************\n \/\/ public methods\n \/\/*************************************************************************************************************\n public:\n void Main();\n\n \/\/*************************************************************************************************************\n \/\/ private methods\n \/\/*************************************************************************************************************\n private:\n void impl_parseCommandline ( ); \/\/ search supported arguments on command line\n OUString impl_encodeString ( const OUString& sValue ); \/\/ encode SEPERATOR and \"\\\" with an additional \"\\\"! zB \"\\\" => \"\\\\\"\n\n \/\/*************************************************************************************************************\n \/\/ private variables\n \/\/*************************************************************************************************************\n private:\n OString m_sTempFile ; \/\/ name of temp. file in system notation\n\n}; \/\/ class LoginApplication\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ global variables\n\/\/_________________________________________________________________________________________________________________\n\nLoginApplication gLoginApplication;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ main\n\/\/_________________________________________________________________________________________________________________\n\nvoid LoginApplication::Main()\n{\n \/\/ Init global uno servicemanager.\n ServiceManager aManager;\n Reference< XMultiServiceFactory > xServiceManager = aManager.getSharedUNOServiceManager( DECLARE_ASCII(\"login.rdb\") );\n LOG_ASSERT( !(xServiceManager.is()==sal_False), \"LoginApplication::Main()\\nCould not create uno service manager!\\n\" )\n\n \/\/ Parse command line and set found arguments on application member.\n impl_parseCommandline();\n LOG_ASSERT( !(m_sTempFile.getLength()<1), \"LoginApplication::Main()\\nWrong or missing argument for temp. file detected!\\n\" )\n\n \/\/ Try to get neccessary dialog service.\n \/\/ By the way - cast it to interface XPropertySet too - we need it later.\n \/\/ (define SERVICENAME... comes from defines.hxx!)\n Reference< XDialog > xLoginDialog( xServiceManager->createInstance( SERVICENAME_LOGINDIALOG ), UNO_QUERY );\n Reference< XPropertySet > xPropertySet( xLoginDialog , UNO_QUERY );\n\n \/\/ Work with valid ressources only!\n \/\/ Otherwise do nothing ...\n if (\n ( xLoginDialog.is() == sal_True ) &&\n ( xPropertySet.is() == sal_True ) &&\n ( m_sTempFile.getLength() > 0 )\n )\n {\n \/\/ User can't set used connection type in dialog directly!\n \/\/ And if our setup has written wrong value for it ...\n \/\/ we must set right type before to get right value after showing dialog!!!\n Any aConnectionType;\n aConnectionType <<= PROPERTYNAME_COMPRESSEDSECURE;\n xPropertySet->setPropertyValue( PROPERTYNAME_CONNECTIONTYPE, aConnectionType );\n\n \/\/ Show login dialog and get decision of user.\n sal_Bool bDecision = (sal_Bool)(xLoginDialog->execute());\n\n OUString sUserName ;\n OUString sPassword ;\n OUString sServer ;\n OUString sConnectionType ;\n sal_Int32 nPort=0 ; \/\/ We need this default if follow \"if\"-statement \"failed\"!\n \/\/ Strings before has \"\" as default.\n\n \/\/ If user say \"OK\" ... get values from dialog.\n \/\/ If user say \"NO\" ... leave it. Then we save empty informations later ...\n if( bDecision == sal_True )\n {\n \/\/ defines PROPERTYNAME... comes from logindialog.hxx!\n xPropertySet->getPropertyValue( PROPERTYNAME_USERNAME ) >>= sUserName ;\n xPropertySet->getPropertyValue( PROPERTYNAME_PASSWORD ) >>= sPassword ;\n xPropertySet->getPropertyValue( PROPERTYNAME_SERVER ) >>= sServer ;\n xPropertySet->getPropertyValue( PROPERTYNAME_CONNECTIONTYPE ) >>= sConnectionType ;\n if( sConnectionType.getLength() > 0 )\n {\n xPropertySet->getPropertyValue( sConnectionType ) >>= nPort;\n }\n }\n\n \/\/ Build string for output.\n \/\/ At this point it doesnt matter if information exist or not!\n \/\/ Format of output: \"<decision[0|1]>;<username[string]>;<password[string]>;<servername[string]>;<port[int]>\"\n OUStringBuffer sBuffer( 1000 );\n\n if( bDecision == sal_True )\n {\n sBuffer.appendAscii( \"1\" );\n }\n else\n {\n sBuffer.appendAscii( \"0\" );\n }\n sBuffer.append ( SEPERATOR );\n sBuffer.append ( impl_encodeString(sUserName) );\n sBuffer.append ( SEPERATOR );\n sBuffer.append ( impl_encodeString(sPassword) );\n sBuffer.append ( SEPERATOR );\n sBuffer.append ( impl_encodeString(sServer) );\n sBuffer.append ( SEPERATOR );\n sBuffer.append ( impl_encodeString(sConnectionType));\n sBuffer.append ( SEPERATOR );\n sBuffer.append ( nPort );\n sBuffer.append ( SEPERATOR );\n sBuffer.appendAscii ( \"\\n\" );\n\n \/\/ Write informations in temp. file.\n \/\/ If given file name isnt valid ... caller will have a problem!!!\n \/\/ If fil already exist (That's out of specification!!!) we overwrite it everytime.\n FILE* pFile = fopen( m_sTempFile.getStr(), \"w\" );\n LOG_ASSERT( !(pFile==NULL), \"LoginApplication::Main()\\nCould not open file!\\n\" );\n if( pFile != NULL )\n {\n OString sEncodedOut = U2B_ENC( sBuffer.makeStringAndClear(), TEMPFILE_ENCODING );\n fprintf( pFile, sEncodedOut.getStr() );\n fclose ( pFile );\n }\n }\n}\n\n\/\/*****************************************************************************************************************\n\/\/ private method\n\/\/*****************************************************************************************************************\nvoid LoginApplication::impl_parseCommandline()\n{\n \/\/ Use vos::OStartupInfo for access to command line.\n \/\/ Step over all arguments, search for supported ones and try to get his values.\n \/\/ Set it on our member. Caller of this method must control setted values.\n OStartupInfo aInfo;\n\n sal_uInt32 nCount = aInfo.getCommandArgCount() ;\n sal_uInt32 nArgument = 0 ;\n OUString sArgument ;\n\n \/\/ Warn programmer if argument count isnt ok!\n LOG_ASSERT( !(nCount!=1), \"LoginApplication::impl_parseCommandline()\\nWrong argument count detected!\\n\" )\n\n \/\/ Step over all arguments ...\n for( nArgument=0; nArgument<nCount; ++nArgument )\n {\n \/\/ .. but work with valid ones only!\n \/\/ Don't check values here. Caller of this method must decide between wrong and allowed values!\n aInfo.getCommandArg( nArgument, sArgument );\n\n \/\/_____________________________________________________________________________________________________\n \/\/ Look for \"-f<temp. file name>\n if( sArgument.compareTo( ARGUMENT_TEMPFILE, ARGUMENTLENGTH_TEMPFILE ) == ARGUMENTFOUND )\n {\n m_sTempFile = U2B(sArgument.copy( ARGUMENTLENGTH_TEMPFILE ));\n }\n }\n}\n\n\/\/*****************************************************************************************************************\n\/\/ private method\n\/\/*****************************************************************************************************************\nOUString LoginApplication::impl_encodeString( const OUString& sValue )\n{\n \/\/ Read all signs from source buffer into destination buffer\n \/\/ and change all \";\" and \"\\\" to \"\\;\" and \"\\\\\"!\n\n sal_Int32 nCount = sValue.getLength();\n OUStringBuffer sSource ( sValue ) ;\n OUStringBuffer sDestination( nCount*2 ) ; \/\/ Reserve destination buffer with enough free space for changes! Sometimes we must add signs ...\n sal_Unicode cLetter ;\n\n for( sal_Int32 nLetter=0; nLetter<nCount; ++nLetter )\n {\n cLetter = sSource.charAt(nLetter);\n \/\/ If sign a special one ...\n \/\/ add escape letter before ...\n \/\/ and special one then!\n \/\/ Otherwise letter will copied normaly.\n if (\n ( cLetter == SEPERATOR ) ||\n ( cLetter == ENCODESIGN )\n )\n {\n sDestination.append( ENCODESIGN );\n }\n sDestination.append( cLetter );\n }\n\n return sDestination.makeStringAndClear();\n}\n<commit_msg>fixx #75520# top level<commit_after>\/*************************************************************************\n *\n * $RCSfile: login.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: as $ $Date: 2001-05-10 10:32:40 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ my own includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef __FRAMEWORK_LOGINDIALOG_LOGINDIALOG_HXX_\n#include <logindialog.hxx>\n#endif\n\n#ifndef __FRAMEWORK_CLASSES_SERVICEMANAGER_HXX_\n#include <classes\/servicemanager.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_GENERIC_HXX_\n#include <macros\/generic.hxx>\n#endif\n\n#ifndef __FRAMEWORK_MACROS_DEBUG_HXX_\n#include <macros\/debug.hxx>\n#endif\n\n#ifndef __FRAMEWORK_DEFINES_HXX_\n#include <defines.hxx>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ interface includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COM_SUN_STAR_LANG_XMULTISERVICEFACTORY_HPP_\n#include <com\/sun\/star\/lang\/XMultiServiceFactory.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_AWT_XDIALOG_HPP_\n#include <com\/sun\/star\/awt\/XDialog.hpp>\n#endif\n\n#ifndef _COM_SUN_STAR_BEANS_XPROPERTYSET_HPP_\n#include <com\/sun\/star\/beans\/XPropertySet.hpp>\n#endif\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ other includes\n\/\/_________________________________________________________________________________________________________________\n\n#ifndef _COMPHELPER_PROCESSFACTORY_HXX_\n#include <comphelper\/processfactory.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_UNO_REFERENCE_H_\n#include <com\/sun\/star\/uno\/Reference.h>\n#endif\n\n#ifndef _VOS_PROCESS_HXX_\n#include <vos\/process.hxx>\n#endif\n\n#ifndef _RTL_USTRING_\n#include <rtl\/ustring>\n#endif\n\n#ifndef _RTL_USTRBUF_HXX_\n#include <rtl\/ustrbuf.hxx>\n#endif\n\n#ifndef _SV_EVENT_HXX\n#include <vcl\/event.hxx>\n#endif\n\n#ifndef _SV_SVAPP_HXX\n#include <vcl\/svapp.hxx>\n#endif\n\n#ifndef _SV_WRKWIN_HXX\n#include <vcl\/wrkwin.hxx>\n#endif\n\n#ifndef _SV_MSGBOX_HXX\n#include <vcl\/msgbox.hxx>\n#endif\n\n#include <stdio.h>\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ const\n\/\/_________________________________________________________________________________________________________________\n\n#define TEMPFILE_ENCODING RTL_TEXTENCODING_UTF8 \/\/ encoding of written temp. ascii file\n#define LOGIN_RDB DECLARE_ASCII(\"login.rdb\") \/\/ name of our own registry file - neccessary to create own servicemanager\n#define SEPERATOR \"\\n\" \/\/ used to seperate parts in temp. file\n\n#define MINARGUMENTCOUNT 1 \/\/ count of min. required arguments\n#define ARGUMENTFOUND 0 \/\/ OUString::compareTo returns 0 if searched string match given one\n#define ARGUMENTLENGTH 3 \/\/ length of fixed part of any argument to detect it easier!\n\n#define ARGUMENT_TEMPFILE DECLARE_ASCII(\"-f=\") \/\/ we support \"-f=c:\\temp\\test.txt\" to write dialog data in temp. file\n#define ARGUMENT_DIALOGPARENT DECLARE_ASCII(\"-p=\") \/\/ we support \"-p=36748322\" as window handle of parent for vcl dialog\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ namespace\n\/\/_________________________________________________________________________________________________________________\n\nusing namespace ::rtl ;\nusing namespace ::vos ;\nusing namespace ::comphelper ;\nusing namespace ::framework ;\nusing namespace ::com::sun::star::uno ;\nusing namespace ::com::sun::star::lang ;\nusing namespace ::com::sun::star::awt ;\nusing namespace ::com::sun::star::beans ;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ defines\n\/\/_________________________________________________________________________________________________________________\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ declarations\n\/\/_________________________________________________________________________________________________________________\n\n\/*-************************************************************************************************************\/\/**\n @short implement command application to show login dialog and save his information in temp. file!\n @descr We need this temp. file to share informations between our dialog and different processes, which\n can't use vcl directly. Caller of this executable give us the file name as an argument - we save\n all informations in it - caller can read it and MUST delete temp. file.\n This is neccessary for example; to hide the password!\n\n @implements -\n\n @base Application\n*\/\/*-*************************************************************************************************************\/\nclass LoginApplication : public Application\n{\n \/\/*************************************************************************************************************\n \/\/ public methods\n \/\/*************************************************************************************************************\n public:\n void Main();\n\n \/\/*************************************************************************************************************\n \/\/ private methods\n \/\/*************************************************************************************************************\n private:\n void impl_parseCommandline(); \/\/ search supported arguments on command line\n\n \/\/*************************************************************************************************************\n \/\/ private variables\n \/\/*************************************************************************************************************\n private:\n OString m_sTempFile ; \/\/ name of temp. file in system notation\n sal_Int32 m_nParentHandle ; \/\/ a parent window handle for used vcl dialog\n\n}; \/\/ class LoginApplication\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ global variables\n\/\/_________________________________________________________________________________________________________________\n\nLoginApplication gLoginApplication;\n\n\/\/_________________________________________________________________________________________________________________\n\/\/ main\n\/\/_________________________________________________________________________________________________________________\n\nvoid LoginApplication::Main()\n{\n \/\/ Init global uno servicemanager.\n ServiceManager aManager;\n Reference< XMultiServiceFactory > xServiceManager = aManager.getManager( LOGIN_RDB );\n LOG_ASSERT( !(xServiceManager.is()==sal_False), \"LoginApplication::Main()\\nCould not create uno service manager!\\n\" )\n\n \/\/ Parse command line and set found arguments on application member.\n impl_parseCommandline();\n LOG_ASSERT( !(m_sTempFile.getLength()<1), \"LoginApplication::Main()\\nWrong or missing argument for temp. file detected!\\n\" )\n\n \/\/ Try to get neccessary dialog service.\n \/\/ By the way - cast it to interface XPropertySet too - we need it later.\n \/\/ (define SERVICENAME... comes from defines.hxx!)\n Reference< XDialog > xLoginDialog( xServiceManager->createInstance( SERVICENAME_LOGINDIALOG ), UNO_QUERY );\n Reference< XPropertySet > xPropertySet( xLoginDialog , UNO_QUERY );\n\n \/\/ Work with valid ressources only!\n \/\/ Otherwise do nothing ...\n if (\n ( xLoginDialog.is() == sal_True ) &&\n ( xPropertySet.is() == sal_True ) &&\n ( m_sTempFile.getLength() > 0 )\n )\n {\n \/\/ Exist a parent window? YES => set right property.\n if( m_nParentHandle != 0 )\n {\n Any aParentWindow;\n aParentWindow <<= m_nParentHandle;\n xPropertySet->setPropertyValue( PROPERTYNAME_PARENTWINDOW, aParentWindow );\n }\n\n Any aConnectionType;\n aConnectionType <<= PROPERTYNAME_COMPRESSEDSECURE;\n xPropertySet->setPropertyValue( PROPERTYNAME_CONNECTIONTYPE, aConnectionType );\n\n \/\/ Show login dialog and get decision of user.\n sal_Bool bDecision = (sal_Bool)(xLoginDialog->execute());\n\n OUString sUserName ;\n OUString sPassword ;\n OUString sServer ;\n OUString sConnectionType ;\n sal_Int32 nPort=0 ; \/\/ We need this default if follow \"if\"-statement \"failed\"!\n\n \/\/ If user say \"OK\" ... get values from dialog.\n \/\/ If user say \"NO\" ... leave it. Then we save empty informations later ...\n if( bDecision == sal_True )\n {\n \/\/ defines PROPERTYNAME... comes from logindialog.hxx!\n xPropertySet->getPropertyValue( PROPERTYNAME_USERNAME ) >>= sUserName ;\n xPropertySet->getPropertyValue( PROPERTYNAME_PASSWORD ) >>= sPassword ;\n xPropertySet->getPropertyValue( PROPERTYNAME_SERVER ) >>= sServer ;\n xPropertySet->getPropertyValue( PROPERTYNAME_CONNECTIONTYPE ) >>= sConnectionType ;\n if( sConnectionType.getLength() > 0 )\n {\n xPropertySet->getPropertyValue( sConnectionType ) >>= nPort;\n }\n }\n\n \/\/ Build string for output.\n \/\/ At this point it doesnt matter if information exist or not!\n \/\/ Format of output: \"<decision> [0|1] SEPERATOR\n \/\/ <username> [string] SEPERATOR\n \/\/ <password> [string] SEPERATOR\n \/\/ <servername> [string] SEPERATOR\n \/\/ <port> [int] SEPERATOR\"\n OUStringBuffer sBuffer( 1000 );\n\n if( bDecision == sal_True )\n {\n sBuffer.appendAscii( \"1\" );\n }\n else\n {\n sBuffer.appendAscii( \"0\" );\n }\n sBuffer.appendAscii ( SEPERATOR );\n sBuffer.append ( sUserName );\n sBuffer.appendAscii ( SEPERATOR );\n sBuffer.append ( sPassword );\n sBuffer.appendAscii ( SEPERATOR );\n sBuffer.append ( sServer );\n sBuffer.appendAscii ( SEPERATOR );\n sBuffer.append ( sConnectionType );\n sBuffer.appendAscii ( SEPERATOR );\n sBuffer.append ( nPort );\n sBuffer.appendAscii ( SEPERATOR );\n\n \/\/ Write informations in temp. file.\n \/\/ If given file name isnt valid ... caller will have a problem!!!\n \/\/ If fil already exist (That's out of specification!!!) we overwrite it everytime.\n FILE* pFile = fopen( m_sTempFile.getStr(), \"w\" );\n LOG_ASSERT( !(pFile==NULL), \"LoginApplication::Main()\\nCould not open file!\\n\" );\n if( pFile != NULL )\n {\n OString sEncodedOut = U2B_ENC( sBuffer.makeStringAndClear(), TEMPFILE_ENCODING );\n fprintf( pFile, sEncodedOut.getStr() );\n fclose ( pFile );\n }\n }\n}\n\n\/\/*****************************************************************************************************************\n\/\/ private method\n\/\/*****************************************************************************************************************\nvoid LoginApplication::impl_parseCommandline()\n{\n \/\/ Use vos::OStartupInfo for access to command line.\n \/\/ Step over all arguments, search for supported ones and try to get his values.\n \/\/ Set it on our member. Caller of this method must control setted values.\n OStartupInfo aInfo;\n\n sal_uInt32 nCount = aInfo.getCommandArgCount() ;\n sal_uInt32 nArgument = 0 ;\n OUString sArgument ;\n OUString sValue ;\n\n \/\/ Warn programmer if argument count isnt ok!\n LOG_ASSERT( !(nCount!=MINARGUMENTCOUNT), \"LoginApplication::impl_parseCommandline()\\nWrong argument count detected!\\n\" )\n\n \/\/ Reset all possible argument variables to defaults if someone is missing.\n m_sTempFile = OString();\n m_nParentHandle = 0 ;\n\n \/\/ Step over all arguments ...\n for( nArgument=0; nArgument<nCount; ++nArgument )\n {\n \/\/ .. but work with valid ones only!\n \/\/ Don't check values here. Caller of this method must decide between wrong and allowed values!\n aInfo.getCommandArg( nArgument, sArgument );\n\n \/\/_____________________________________________________________________________________________________\n \/\/ Look for \"-f=<temp. file name>\"\n if( sArgument.compareTo( ARGUMENT_TEMPFILE, ARGUMENTLENGTH ) == ARGUMENTFOUND )\n {\n sValue = sArgument.copy( ARGUMENTLENGTH );\n m_sTempFile = U2B(sValue);\n }\n else\n \/\/_____________________________________________________________________________________________________\n \/\/ Look for \"-p=<parent window handle>\"\n if( sArgument.compareTo( ARGUMENT_DIALOGPARENT, ARGUMENTLENGTH ) == ARGUMENTFOUND )\n {\n sValue = sArgument.copy( ARGUMENTLENGTH );\n m_nParentHandle = sValue.toInt32();\n }\n }\n\n \/\/ Parent window handle is an optional argument ... but should be used mostly!\n \/\/ Warn programmer.\n LOG_ASSERT( !(m_nParentHandle==0), \"Login.exe\\nYou should give me a parent window handle!\\n\" )\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of UDPipe <http:\/\/github.com\/ufal\/udpipe\/>.\n\/\/\n\/\/ Copyright 2016 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include <sstream>\n\n#include \"udpipe_service.h\"\n\nnamespace ufal {\nnamespace udpipe {\n\n\/\/ Init the UDPipe service -- load the models\nbool udpipe_service::init(const vector<model_description>& model_descriptions) {\n if (model_descriptions.empty()) return false;\n\n \/\/ Load models\n models.clear();\n rest_models_map.clear();\n for (auto& model_description : model_descriptions) {\n Model* model = Model::load(model_description.file.c_str());\n if (!model) return false;\n\n \/\/ Store the model\n models.emplace_back(model_description.rest_id, model_description.acknowledgements, model);\n }\n\n \/\/ Fill rest_models_map with model name and aliases\n for (auto& model : models) {\n \/\/ Fail if this model id is aready in use.\n if (!rest_models_map.emplace(model.rest_id, &model).second) return false;\n\n \/\/ Create (but not overwrite) id without version.\n for (unsigned i = 0; i+1+6 < model.rest_id.size(); i++)\n if (model.rest_id[i] == '-') {\n bool is_version = true;\n for (unsigned j = i+1; j < i+1+6; j++)\n is_version = is_version && model.rest_id[j] >= '0' && model.rest_id[j] <= '9';\n if (is_version)\n rest_models_map.emplace(model.rest_id.substr(0, i) + model.rest_id.substr(i+1+6), &model);\n }\n\n \/\/ Create (but not overwrite) hyphen-separated prefixes.\n for (unsigned i = 0; i < model.rest_id.size(); i++)\n if (model.rest_id[i] == '-')\n rest_models_map.emplace(model.rest_id.substr(0, i), &model);\n }\n \/\/ Default model\n rest_models_map.emplace(string(), &models.front());\n\n \/\/ Init REST service\n json_models.clear().object().indent().key(\"models\").indent().object();\n for (auto& model : models) {\n json_models.indent().key(model.rest_id).indent().array();\n if (model.can_tokenize) json_models.value(\"tokenizer\");\n if (model.can_tag) json_models.value(\"tagger\");\n if (model.can_parse) json_models.value(\"parser\");\n json_models.close();\n }\n json_models.indent().close().indent().key(\"default_model\").indent().value(model_descriptions.front().rest_id).finish(true);\n\n return true;\n}\n\n\/\/ Handlers with their URLs\nunordered_map<string, bool (udpipe_service::*)(microrestd::rest_request&)> udpipe_service::handlers = {\n \/\/ REST service\n {\"\/models\", &udpipe_service::handle_rest_models},\n {\"\/process\", &udpipe_service::handle_rest_process},\n};\n\n\/\/ Handle a request using the specified URL\/handler map\nbool udpipe_service::handle(microrestd::rest_request& req) {\n auto handler_it = handlers.find(req.url);\n return handler_it == handlers.end() ? req.respond_not_found() : (this->*handler_it->second)(req);\n}\n\n\/\/ Load selected model\nconst udpipe_service::model_info* udpipe_service::load_rest_model(const string& rest_id, string& error) {\n auto model_it = rest_models_map.find(rest_id);\n if (model_it == rest_models_map.end())\n return error.assign(\"Requested model '\").append(rest_id).append(\"' does not exist.\\n\"), nullptr;\n\n return model_it->second;\n}\n\n\/\/ REST service\ninline microrestd::string_piece sp(string_piece str) { return microrestd::string_piece(str.str, str.len); }\ninline microrestd::string_piece sp(const char* str, size_t len) { return microrestd::string_piece(str, len); }\n\nudpipe_service::rest_response_generator::rest_response_generator(const model_info* model) : model(model) {\n json.object();\n json.indent().key(\"model\").indent().value(model->rest_id);\n json.indent().key(\"acknowledgements\").indent().array();\n json.indent().value(\"http:\/\/ufal.mff.cuni.cz\/udpipe#udpipe_acknowledgements\");\n if (!model->acknowledgements.empty()) json.indent().value(model->acknowledgements);\n json.indent().close().indent().key(\"result\").indent().value(\"\");\n}\n\n\/\/ REST service handlers\n\nbool udpipe_service::handle_rest_models(microrestd::rest_request& req) {\n return req.respond(rest_response_generator::mime, json_models);\n}\n\nbool udpipe_service::handle_rest_process(microrestd::rest_request& req) {\n string error;\n auto rest_id = get_rest_model_id(req);\n auto model = load_rest_model(rest_id, error);\n if (!model) return req.respond_error(error);\n\n auto& data = get_data(req, error); if (!error.empty()) return req.respond_error(error);\n bool tokenizer = false;\n unique_ptr<input_format> input(get_input_format(req, model, tokenizer, error)); if (!input) return req.respond_error(error);\n auto& tagger = get_tagger(req, model, error); if (!error.empty()) return req.respond_error(error);\n auto& parser = get_parser(req, model, error); if (!error.empty()) return req.respond_error(error);\n unique_ptr<output_format> output(get_output_format(req, error)); if (!output) return req.respond_error(error);\n\n \/\/ Try loading the input if tokenizer is not used\n if (!tokenizer) {\n input->set_text(data);\n sentence s;\n while (input->next_sentence(s, error)) {}\n if (!error.empty())\n return req.respond_error(error.insert(0, \"Cannot read input data: \").append(\"\\n\"));\n }\n\n input->set_text(data);\n class generator : public rest_response_generator {\n public:\n generator(const model_info* model, input_format* input, const string& tagger, const string& parser, output_format* output)\n : rest_response_generator(model), input(input), tagger(tagger), parser(parser), output(output) {}\n\n bool generate() {\n if (!input->next_sentence(s, error)) {\n output->finish_document(os);\n json.value(os.str(), true);\n os.str(string());\n\n json.finish(true);\n\n return false;\n }\n\n if (tagger != \"none\")\n model->model->tag(s, tagger, error);\n if (parser != \"none\")\n model->model->parse(s, parser, error);\n\n output->write_sentence(s, os);\n json.value(os.str(), true);\n os.str(string());\n\n return true;\n }\n\n private:\n sentence s;\n string error;\n ostringstream os;\n unique_ptr<input_format> input;\n const string& tagger;\n const string& parser;\n unique_ptr<output_format> output;\n };\n return req.respond(generator::mime, new generator(model, input.release(), tagger, parser, output.release()));\n}\n\n\/\/ REST service helpers\n\nconst string& udpipe_service::get_rest_model_id(microrestd::rest_request& req) {\n static string empty;\n\n auto model_it = req.params.find(\"model\");\n return model_it == req.params.end() ? empty : model_it->second;\n}\n\nconst string& udpipe_service::get_data(microrestd::rest_request& req, string& error) {\n auto data_it = req.params.find(\"data\");\n if (data_it == req.params.end()) return error.assign(\"Required argument 'data' is missing.\\n\"), empty;\n\n return data_it->second;\n}\n\ninput_format* udpipe_service::get_input_format(microrestd::rest_request& req, const model_info* model, bool& is_tokenizer, string& error) {\n auto tokenizer_it = req.params.find(\"tokenizer\");\n if (tokenizer_it != req.params.end()) {\n if (!model->can_tokenize) return error.assign(\"The required model does not contain a tokenizer!\"), nullptr;\n input_format* tokenizer = model->model->new_tokenizer(Model::DEFAULT);\n if (!tokenizer) return error.assign(\"Cannot construct a tokenizer instance!\"), nullptr;\n return is_tokenizer = true, tokenizer;\n }\n\n auto& input = req.params.emplace(\"input\", \"conllu\").first->second;\n auto input_format = input_format::new_input_format(input);\n if (!input_format) return error.assign(\"Unknown input format '\").append(input).append(\"'.\\n\"), nullptr;\n return is_tokenizer = false, input_format;\n}\n\nconst string& udpipe_service::get_tagger(microrestd::rest_request& req, const model_info* model, string& error) {\n auto& tagger = req.params.emplace(\"tagger\", \"none\").first->second;\n if (tagger != \"none\" && !model->can_tag) return error.assign(\"The required model does not contain a tagger!\"), empty;\n return tagger;\n}\n\nconst string& udpipe_service::get_parser(microrestd::rest_request& req, const model_info* model, string& error) {\n auto& parser = req.params.emplace(\"parser\", \"none\").first->second;\n if (parser != \"none\" && !model->can_parse) return error.assign(\"The required model does not contain a parser!\"), empty;\n return parser;\n}\n\noutput_format* udpipe_service::get_output_format(microrestd::rest_request& req, string& error) {\n auto& output = req.params.emplace(\"output\", \"conllu\").first->second;\n auto output_format = output_format::new_output_format(output);\n if (!output_format) return error.assign(\"Unknown output format '\").append(output).append(\"'.\\n\"), nullptr;\n return output_format;\n}\n\nconst string udpipe_service::empty;\n\n} \/\/ namespace udpipe\n} \/\/ namespace ufal\n<commit_msg>Pass tokenizer options to tokenizer in the REST server.<commit_after>\/\/ This file is part of UDPipe <http:\/\/github.com\/ufal\/udpipe\/>.\n\/\/\n\/\/ Copyright 2016 Institute of Formal and Applied Linguistics, Faculty of\n\/\/ Mathematics and Physics, Charles University in Prague, Czech Republic.\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#include <sstream>\n\n#include \"udpipe_service.h\"\n\nnamespace ufal {\nnamespace udpipe {\n\n\/\/ Init the UDPipe service -- load the models\nbool udpipe_service::init(const vector<model_description>& model_descriptions) {\n if (model_descriptions.empty()) return false;\n\n \/\/ Load models\n models.clear();\n rest_models_map.clear();\n for (auto& model_description : model_descriptions) {\n Model* model = Model::load(model_description.file.c_str());\n if (!model) return false;\n\n \/\/ Store the model\n models.emplace_back(model_description.rest_id, model_description.acknowledgements, model);\n }\n\n \/\/ Fill rest_models_map with model name and aliases\n for (auto& model : models) {\n \/\/ Fail if this model id is aready in use.\n if (!rest_models_map.emplace(model.rest_id, &model).second) return false;\n\n \/\/ Create (but not overwrite) id without version.\n for (unsigned i = 0; i+1+6 < model.rest_id.size(); i++)\n if (model.rest_id[i] == '-') {\n bool is_version = true;\n for (unsigned j = i+1; j < i+1+6; j++)\n is_version = is_version && model.rest_id[j] >= '0' && model.rest_id[j] <= '9';\n if (is_version)\n rest_models_map.emplace(model.rest_id.substr(0, i) + model.rest_id.substr(i+1+6), &model);\n }\n\n \/\/ Create (but not overwrite) hyphen-separated prefixes.\n for (unsigned i = 0; i < model.rest_id.size(); i++)\n if (model.rest_id[i] == '-')\n rest_models_map.emplace(model.rest_id.substr(0, i), &model);\n }\n \/\/ Default model\n rest_models_map.emplace(string(), &models.front());\n\n \/\/ Init REST service\n json_models.clear().object().indent().key(\"models\").indent().object();\n for (auto& model : models) {\n json_models.indent().key(model.rest_id).indent().array();\n if (model.can_tokenize) json_models.value(\"tokenizer\");\n if (model.can_tag) json_models.value(\"tagger\");\n if (model.can_parse) json_models.value(\"parser\");\n json_models.close();\n }\n json_models.indent().close().indent().key(\"default_model\").indent().value(model_descriptions.front().rest_id).finish(true);\n\n return true;\n}\n\n\/\/ Handlers with their URLs\nunordered_map<string, bool (udpipe_service::*)(microrestd::rest_request&)> udpipe_service::handlers = {\n \/\/ REST service\n {\"\/models\", &udpipe_service::handle_rest_models},\n {\"\/process\", &udpipe_service::handle_rest_process},\n};\n\n\/\/ Handle a request using the specified URL\/handler map\nbool udpipe_service::handle(microrestd::rest_request& req) {\n auto handler_it = handlers.find(req.url);\n return handler_it == handlers.end() ? req.respond_not_found() : (this->*handler_it->second)(req);\n}\n\n\/\/ Load selected model\nconst udpipe_service::model_info* udpipe_service::load_rest_model(const string& rest_id, string& error) {\n auto model_it = rest_models_map.find(rest_id);\n if (model_it == rest_models_map.end())\n return error.assign(\"Requested model '\").append(rest_id).append(\"' does not exist.\\n\"), nullptr;\n\n return model_it->second;\n}\n\n\/\/ REST service\ninline microrestd::string_piece sp(string_piece str) { return microrestd::string_piece(str.str, str.len); }\ninline microrestd::string_piece sp(const char* str, size_t len) { return microrestd::string_piece(str, len); }\n\nudpipe_service::rest_response_generator::rest_response_generator(const model_info* model) : model(model) {\n json.object();\n json.indent().key(\"model\").indent().value(model->rest_id);\n json.indent().key(\"acknowledgements\").indent().array();\n json.indent().value(\"http:\/\/ufal.mff.cuni.cz\/udpipe#udpipe_acknowledgements\");\n if (!model->acknowledgements.empty()) json.indent().value(model->acknowledgements);\n json.indent().close().indent().key(\"result\").indent().value(\"\");\n}\n\n\/\/ REST service handlers\n\nbool udpipe_service::handle_rest_models(microrestd::rest_request& req) {\n return req.respond(rest_response_generator::mime, json_models);\n}\n\nbool udpipe_service::handle_rest_process(microrestd::rest_request& req) {\n string error;\n auto rest_id = get_rest_model_id(req);\n auto model = load_rest_model(rest_id, error);\n if (!model) return req.respond_error(error);\n\n auto& data = get_data(req, error); if (!error.empty()) return req.respond_error(error);\n bool tokenizer = false;\n unique_ptr<input_format> input(get_input_format(req, model, tokenizer, error)); if (!input) return req.respond_error(error);\n auto& tagger = get_tagger(req, model, error); if (!error.empty()) return req.respond_error(error);\n auto& parser = get_parser(req, model, error); if (!error.empty()) return req.respond_error(error);\n unique_ptr<output_format> output(get_output_format(req, error)); if (!output) return req.respond_error(error);\n\n \/\/ Try loading the input if tokenizer is not used\n if (!tokenizer) {\n input->set_text(data);\n sentence s;\n while (input->next_sentence(s, error)) {}\n if (!error.empty())\n return req.respond_error(error.insert(0, \"Cannot read input data: \").append(\"\\n\"));\n }\n\n input->set_text(data);\n class generator : public rest_response_generator {\n public:\n generator(const model_info* model, input_format* input, const string& tagger, const string& parser, output_format* output)\n : rest_response_generator(model), input(input), tagger(tagger), parser(parser), output(output) {}\n\n bool generate() {\n if (!input->next_sentence(s, error)) {\n output->finish_document(os);\n json.value(os.str(), true);\n os.str(string());\n\n json.finish(true);\n\n return false;\n }\n\n if (tagger != \"none\")\n model->model->tag(s, tagger, error);\n if (parser != \"none\")\n model->model->parse(s, parser, error);\n\n output->write_sentence(s, os);\n json.value(os.str(), true);\n os.str(string());\n\n return true;\n }\n\n private:\n sentence s;\n string error;\n ostringstream os;\n unique_ptr<input_format> input;\n const string& tagger;\n const string& parser;\n unique_ptr<output_format> output;\n };\n return req.respond(generator::mime, new generator(model, input.release(), tagger, parser, output.release()));\n}\n\n\/\/ REST service helpers\n\nconst string& udpipe_service::get_rest_model_id(microrestd::rest_request& req) {\n static string empty;\n\n auto model_it = req.params.find(\"model\");\n return model_it == req.params.end() ? empty : model_it->second;\n}\n\nconst string& udpipe_service::get_data(microrestd::rest_request& req, string& error) {\n auto data_it = req.params.find(\"data\");\n if (data_it == req.params.end()) return error.assign(\"Required argument 'data' is missing.\\n\"), empty;\n\n return data_it->second;\n}\n\ninput_format* udpipe_service::get_input_format(microrestd::rest_request& req, const model_info* model, bool& is_tokenizer, string& error) {\n auto tokenizer_it = req.params.find(\"tokenizer\");\n if (tokenizer_it != req.params.end()) {\n if (!model->can_tokenize) return error.assign(\"The required model does not contain a tokenizer!\"), nullptr;\n input_format* tokenizer = model->model->new_tokenizer(tokenizer_it->second);\n if (!tokenizer) return error.assign(\"Cannot construct a tokenizer instance!\"), nullptr;\n return is_tokenizer = true, tokenizer;\n }\n\n auto& input = req.params.emplace(\"input\", \"conllu\").first->second;\n auto input_format = input_format::new_input_format(input);\n if (!input_format) return error.assign(\"Unknown input format '\").append(input).append(\"'.\\n\"), nullptr;\n return is_tokenizer = false, input_format;\n}\n\nconst string& udpipe_service::get_tagger(microrestd::rest_request& req, const model_info* model, string& error) {\n auto& tagger = req.params.emplace(\"tagger\", \"none\").first->second;\n if (tagger != \"none\" && !model->can_tag) return error.assign(\"The required model does not contain a tagger!\"), empty;\n return tagger;\n}\n\nconst string& udpipe_service::get_parser(microrestd::rest_request& req, const model_info* model, string& error) {\n auto& parser = req.params.emplace(\"parser\", \"none\").first->second;\n if (parser != \"none\" && !model->can_parse) return error.assign(\"The required model does not contain a parser!\"), empty;\n return parser;\n}\n\noutput_format* udpipe_service::get_output_format(microrestd::rest_request& req, string& error) {\n auto& output = req.params.emplace(\"output\", \"conllu\").first->second;\n auto output_format = output_format::new_output_format(output);\n if (!output_format) return error.assign(\"Unknown output format '\").append(output).append(\"'.\\n\"), nullptr;\n return output_format;\n}\n\nconst string udpipe_service::empty;\n\n} \/\/ namespace udpipe\n} \/\/ namespace ufal\n<|endoftext|>"} {"text":"<commit_before>#include <tesseract\/baseapi.h>\n#include <leptonica\/allheaders.h>\n#include <string>\n#include <libgen.h>\n\nint main(int argc, char *argv[]) {\n if(argc != 3) { printf(\"USAGE: %s imagefile outputdir\", argv[0]); }\n\n std::string input_filename = std::string(argv[1]);\n std::string input_basename = std::string(basename(argv[1]));\n\n std::string output_dir = std::string(argv[2]);\n\n Pix *image = pixRead(input_filename.c_str());\n tesseract::TessBaseAPI *api = new tesseract::TessBaseAPI();\n api->Init(NULL, \"eng\");\n api->SetImage(image);\n Boxa* boxes = api->GetComponentImages(tesseract::RIL_TEXTLINE, true, NULL, NULL);\n printf(\"Found %d textline image components.\\n\", boxes->n);\n\n int lastindex = input_basename.find_last_of(\".\");\n std::string basename = input_basename.substr(0, lastindex).c_str();\n std::string extension = input_basename.substr(lastindex + 1).c_str();\n std::string outdir = output_dir.c_str();\n int linedirLen = outdir.length()+1+basename.length()+strlen(\"-line_extract_\")+extension.length()+1;\n char* linedir = (char*)malloc(linedirLen*sizeof(char));\n sprintf(linedir, \"%s\/%s-line_extract_%s\", output_dir.c_str(), basename.c_str(), extension.c_str());\n printf(\"Writing to directory [%s]. If this fails, try:\\n mkdir -p %s\\n\\n\\n\", linedir, linedir);\n\n for (int i = 0; i < boxes->n; i++) {\n BOX* box = boxaGetBox(boxes, i, L_CLONE);\n PIX* pixd= pixClipRectangle(image, box, NULL);\n\n char* linefilename = (char*)malloc((linedirLen+strlen(\"\/line00.\")+extension.length()+1)*sizeof(char));\n sprintf(linefilename, \"%s\/line%02d.%s\", linedir, i, extension.c_str());\n printf(\" Writing %s\\n\", linefilename);\n pixWrite(linefilename, pixd, IFF_DEFAULT);\n pixDestroy(&pixd);\n boxDestroy(&box);\n free(linefilename);\n }\n return 0;\n}\n<commit_msg>binarize output<commit_after>\/\/#include <tesseract\/baseapi.h>\n\/\/#include <leptonica\/allheaders.h>\n#include \"baseapi.h\"\n#include \"allheaders.h\"\n#include <string>\n#include <libgen.h>\n\nint main(int argc, char *argv[]) {\n if(argc != 3) { printf(\"USAGE: %s imagefile outputdir\", argv[0]); }\n\n std::string input_filename = std::string(argv[1]);\n std::string input_basename = std::string(basename(argv[1]));\n\n std::string output_dir = std::string(argv[2]);\n\n tesseract::TessBaseAPI *api = new tesseract::TessBaseAPI();\n api->Init(NULL, \"eng\");\n Pix *image0 = pixRead(input_filename.c_str());\n api->SetImage(image0);\n Pix* image = api->GetThresholdedImage();\n api->SetImage(image);\n Boxa* boxes = api->GetComponentImages(tesseract::RIL_TEXTLINE, true, false, 0, NULL, NULL, NULL);\n printf(\"204c\\n\");\n\n\n printf(\"Found %d textline image components.\\n\", boxes->n);\n\n int lastindex = input_basename.find_last_of(\".\");\n std::string basename = input_basename.substr(0, lastindex).c_str();\n std::string extension = input_basename.substr(lastindex + 1).c_str();\n\n std::string outdir = output_dir.c_str();\n int linedirLen = outdir.length()+1+basename.length()+strlen(\"-line_extract_\")+extension.length();\n char* linedir = (char*)malloc((linedirLen+1)*sizeof(char));\n sprintf(linedir, \"%s\/%s-line_extract_%s\", output_dir.c_str(), basename.c_str(), extension.c_str());\n printf(\"Writing to directory [%s]. If this fails, try:\\n mkdir -p %s\\n\\n\\n\", linedir, linedir);\n\n for (int i = 0; i < boxes->n; i++) {\n BOX* box = boxaGetBox(boxes, i, L_CLONE);\n PIX* pixd= pixClipRectangle(image, box, NULL);\n\n char* linefilename = (char*)malloc((linedirLen+strlen(\"\/line00.\")+extension.length()+1)*sizeof(char));\n sprintf(linefilename, \"%s\/line%02d.%s\", linedir, i, extension.c_str());\n printf(\" Writing %s\\n\", linefilename);\n pixWrite(linefilename, pixd, IFF_DEFAULT);\n pixDestroy(&pixd);\n boxDestroy(&box);\n free(linefilename);\n }\n\n free(linedir);\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"UnrealEnginePythonPrivatePCH.h\"\n\n#if WITH_EDITOR\n#include \"LevelEditor.h\"\n#include \"Editor\/LevelEditor\/Public\/ILevelViewport.h\"\n#include \"Editor\/UnrealEd\/Public\/LevelEditorViewport.h\"\n#endif\n\nPyObject *py_unreal_engine_get_game_viewport_client(PyObject * self, PyObject * args) {\n\n\tUGameViewportClient *viewport_client = GEngine->GameViewport;\n\tif (!viewport_client) {\n\t\treturn PyErr_Format(PyExc_Exception, \"no engine GameViewport found\");\n\t}\n\tue_PyUObject *ret = ue_get_python_wrapper(GEngine->GameViewport);\n\tif (!ret)\n\t\treturn PyErr_Format(PyExc_Exception, \"uobject is in invalid state\");\n\tPy_INCREF(ret);\n\treturn (PyObject *)ret;\n}\n\n#if WITH_EDITOR\nPyObject *py_unreal_engine_get_editor_pie_game_viewport_client(PyObject * self, PyObject * args) {\n\n\tUGameViewportClient *viewport_client = GEditor->GameViewport;\n\tif (!viewport_client) {\n\t\treturn PyErr_Format(PyExc_Exception, \"no editor GameViewport found\");\n\t}\n\tue_PyUObject *ret = ue_get_python_wrapper(viewport_client);\n\tif (!ret)\n\t\treturn PyErr_Format(PyExc_Exception, \"uobject is in invalid state\");\n\tPy_INCREF(ret);\n\treturn (PyObject *)ret;\n}\n\nPyObject *py_unreal_engine_editor_set_view_mode(PyObject * self, PyObject * args) {\n\n\tint mode;\n\n\tif (!PyArg_ParseTuple(args, \"i:editor_set_view_mode\", &mode)) {\n\t\treturn NULL;\n\t}\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewMode((EViewModeIndex)mode);\n\t\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_camera_speed(PyObject * self, PyObject * args) {\n\n\tint speed;\n\n\tif (!PyArg_ParseTuple(args, \"f:editor_set_camera_speed\", &speed)) {\n\t\treturn NULL;\n\t}\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetCameraSpeedSetting(speed);\n\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_view_location(PyObject * self, PyObject * args) {\n\n\tPyObject *py_vector;\n\n\tif (!PyArg_ParseTuple(args, \"O:editor_set_view_location\", &py_vector)) {\n\t\treturn NULL;\n\t}\n\n\tue_PyFVector *vector = py_ue_is_fvector(py_vector);\n\tif (!vector)\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a FVector\");\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewLocation(vector->vec);\n\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_view_rotation(PyObject * self, PyObject * args) {\n\n\tPyObject *py_rotator;\n\n\tif (!PyArg_ParseTuple(args, \"O:editor_set_view_rotation\", &py_rotator)) {\n\t\treturn NULL;\n\t}\n\n\tue_PyFRotator *rotator = py_ue_is_frotator(py_rotator);\n\tif (!rotator)\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a FRotator\");\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewRotation(rotator->rot);\n\n\tPy_RETURN_NONE;\n}\n\n#endif\n\nPyObject *py_ue_add_viewport_widget_content(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tPyObject *py_widget;\n\tint z_order = 0;\n\n\tif (!PyArg_ParseTuple(args, \"O|i:add_viewport_widget_content\", &py_widget, &z_order)) {\n\t\treturn NULL;\n\t}\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport)\n\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient\");\n\n\tue_PySWidget *py_swidget = py_ue_is_swidget(py_widget);\n\tif (!py_swidget) {\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a SWidget\");\n\t}\n\t\/\/ TODO: decrement reference when destroying parent\n\tPy_INCREF(py_swidget);\n\n\tviewport->AddViewportWidgetContent(py_swidget->s_widget, z_order);\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nPyObject *py_ue_remove_viewport_widget_content(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tPyObject *py_widget;\n\n\tif (!PyArg_ParseTuple(args, \"O:remove_viewport_widget_content\", &py_widget)) {\n\t\treturn NULL;\n\t}\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport)\n\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient\");\n\n\tue_PySWidget *py_swidget = py_ue_is_swidget(py_widget);\n\tif (!py_swidget) {\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a SWidget\");\n\t}\n\tPy_DECREF(py_swidget);\n\n\tviewport->RemoveViewportWidgetContent(py_swidget->s_widget);\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nPyObject *py_ue_remove_all_viewport_widgets(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport)\n\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient\");\n\n\t\n\tviewport->RemoveAllViewportWidgets();\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\n<commit_msg>allows attaching slate widgets to running worlds<commit_after>#include \"UnrealEnginePythonPrivatePCH.h\"\n\n#if WITH_EDITOR\n#include \"LevelEditor.h\"\n#include \"Editor\/LevelEditor\/Public\/ILevelViewport.h\"\n#include \"Editor\/UnrealEd\/Public\/LevelEditorViewport.h\"\n#endif\n\nPyObject *py_unreal_engine_get_game_viewport_client(PyObject * self, PyObject * args) {\n\n\tUGameViewportClient *viewport_client = GEngine->GameViewport;\n\tif (!viewport_client) {\n\t\treturn PyErr_Format(PyExc_Exception, \"no engine GameViewport found\");\n\t}\n\tue_PyUObject *ret = ue_get_python_wrapper(GEngine->GameViewport);\n\tif (!ret)\n\t\treturn PyErr_Format(PyExc_Exception, \"uobject is in invalid state\");\n\tPy_INCREF(ret);\n\treturn (PyObject *)ret;\n}\n\n#if WITH_EDITOR\nPyObject *py_unreal_engine_get_editor_pie_game_viewport_client(PyObject * self, PyObject * args) {\n\n\tUGameViewportClient *viewport_client = GEditor->GameViewport;\n\tif (!viewport_client) {\n\t\treturn PyErr_Format(PyExc_Exception, \"no editor GameViewport found\");\n\t}\n\tue_PyUObject *ret = ue_get_python_wrapper(viewport_client);\n\tif (!ret)\n\t\treturn PyErr_Format(PyExc_Exception, \"uobject is in invalid state\");\n\tPy_INCREF(ret);\n\treturn (PyObject *)ret;\n}\n\nPyObject *py_unreal_engine_editor_set_view_mode(PyObject * self, PyObject * args) {\n\n\tint mode;\n\n\tif (!PyArg_ParseTuple(args, \"i:editor_set_view_mode\", &mode)) {\n\t\treturn NULL;\n\t}\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewMode((EViewModeIndex)mode);\n\t\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_camera_speed(PyObject * self, PyObject * args) {\n\n\tint speed;\n\n\tif (!PyArg_ParseTuple(args, \"f:editor_set_camera_speed\", &speed)) {\n\t\treturn NULL;\n\t}\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetCameraSpeedSetting(speed);\n\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_view_location(PyObject * self, PyObject * args) {\n\n\tPyObject *py_vector;\n\n\tif (!PyArg_ParseTuple(args, \"O:editor_set_view_location\", &py_vector)) {\n\t\treturn NULL;\n\t}\n\n\tue_PyFVector *vector = py_ue_is_fvector(py_vector);\n\tif (!vector)\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a FVector\");\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewLocation(vector->vec);\n\n\tPy_RETURN_NONE;\n}\n\nPyObject *py_unreal_engine_editor_set_view_rotation(PyObject * self, PyObject * args) {\n\n\tPyObject *py_rotator;\n\n\tif (!PyArg_ParseTuple(args, \"O:editor_set_view_rotation\", &py_rotator)) {\n\t\treturn NULL;\n\t}\n\n\tue_PyFRotator *rotator = py_ue_is_frotator(py_rotator);\n\tif (!rotator)\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a FRotator\");\n\n\tFLevelEditorModule &EditorModule = FModuleManager::LoadModuleChecked<FLevelEditorModule>(\"LevelEditor\");\n\n\tif (!EditorModule.GetFirstActiveViewport().IsValid())\n\t\treturn PyErr_Format(PyExc_Exception, \"no active LevelEditor Viewport\");\n\n\tFLevelEditorViewportClient &viewport_client = EditorModule.GetFirstActiveViewport()->GetLevelViewportClient();\n\n\tviewport_client.SetViewRotation(rotator->rot);\n\n\tPy_RETURN_NONE;\n}\n\n#endif\n\nPyObject *py_ue_add_viewport_widget_content(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tPyObject *py_widget;\n\tint z_order = 0;\n\n\tif (!PyArg_ParseTuple(args, \"O|i:add_viewport_widget_content\", &py_widget, &z_order)) {\n\t\treturn NULL;\n\t}\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport) {\n\t\tUWorld *world = ue_py_check_type<UWorld>(self);\n\t\tif (!world)\n\t\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient or a UWorld\");\n\t\tviewport = world->GetGameViewport();\n\t\tif (!viewport)\n\t\t\treturn PyErr_Format(PyExc_Exception, \"cannot retrieve GameViewportClient from UWorld\");\n\t}\n\n\tue_PySWidget *py_swidget = py_ue_is_swidget(py_widget);\n\tif (!py_swidget) {\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a SWidget\");\n\t}\n\t\/\/ Do not increment reference count as it is assumed this function is used in a PyComponent\/PyActor\/ that can holds reference to\n\t\/\/ it in various ways\n\t\/\/ Py_INCREF(py_swidget);\n\n\tviewport->AddViewportWidgetContent(py_swidget->s_widget, z_order);\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nPyObject *py_ue_remove_viewport_widget_content(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tPyObject *py_widget;\n\n\tif (!PyArg_ParseTuple(args, \"O:remove_viewport_widget_content\", &py_widget)) {\n\t\treturn NULL;\n\t}\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport)\n\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient\");\n\n\tue_PySWidget *py_swidget = py_ue_is_swidget(py_widget);\n\tif (!py_swidget) {\n\t\treturn PyErr_Format(PyExc_Exception, \"argument is not a SWidget\");\n\t}\n\tPy_DECREF(py_swidget);\n\n\tviewport->RemoveViewportWidgetContent(py_swidget->s_widget);\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\nPyObject *py_ue_remove_all_viewport_widgets(ue_PyUObject *self, PyObject * args) {\n\n\tue_py_check(self);\n\n\tUGameViewportClient *viewport = ue_py_check_type<UGameViewportClient>(self);\n\tif (!viewport)\n\t\treturn PyErr_Format(PyExc_Exception, \"object is not a GameViewportClient\");\n\n\t\n\tviewport->RemoveAllViewportWidgets();\n\n\tPy_INCREF(Py_None);\n\treturn Py_None;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2010 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"bindings\/core\/v8\/ScriptCallStackFactory.h\"\n\n#include \"bindings\/core\/v8\/ScriptValue.h\"\n#include \"bindings\/core\/v8\/V8Binding.h\"\n#include \"core\/inspector\/InspectorInstrumentation.h\"\n#include \"core\/inspector\/ScriptArguments.h\"\n#include \"core\/inspector\/ScriptCallFrame.h\"\n#include \"core\/inspector\/ScriptCallStack.h\"\n#include \"platform\/JSONValues.h\"\n#include \"wtf\/text\/StringBuilder.h\"\n\n#include <v8-debug.h>\n\nnamespace blink {\n\nclass ExecutionContext;\n\nstatic ScriptCallFrame toScriptCallFrame(v8::Handle<v8::StackFrame> frame)\n{\n StringBuilder stringBuilder;\n stringBuilder.appendNumber(frame->GetScriptId());\n String scriptId = stringBuilder.toString();\n String sourceName;\n v8::Local<v8::String> sourceNameValue(frame->GetScriptNameOrSourceURL());\n if (!sourceNameValue.IsEmpty())\n sourceName = toCoreString(sourceNameValue);\n\n String functionName;\n v8::Local<v8::String> functionNameValue(frame->GetFunctionName());\n if (!functionNameValue.IsEmpty())\n functionName = toCoreString(functionNameValue);\n\n int sourceLineNumber = frame->GetLineNumber();\n int sourceColumn = frame->GetColumn();\n return ScriptCallFrame(functionName, scriptId, sourceName, sourceLineNumber, sourceColumn);\n}\n\nstatic void toScriptCallFramesVector(v8::Handle<v8::StackTrace> stackTrace, Vector<ScriptCallFrame>& scriptCallFrames, size_t maxStackSize, bool emptyStackIsAllowed, v8::Isolate* isolate)\n{\n ASSERT(isolate->InContext());\n int frameCount = stackTrace->GetFrameCount();\n if (frameCount > static_cast<int>(maxStackSize))\n frameCount = maxStackSize;\n for (int i = 0; i < frameCount; i++) {\n v8::Local<v8::StackFrame> stackFrame = stackTrace->GetFrame(i);\n scriptCallFrames.append(toScriptCallFrame(stackFrame));\n }\n if (!frameCount && !emptyStackIsAllowed) {\n \/\/ Successfully grabbed stack trace, but there are no frames. It may happen in case\n \/\/ when a bound function is called from native code for example.\n \/\/ Fallback to setting lineNumber to 0, and source and function name to \"undefined\".\n scriptCallFrames.append(ScriptCallFrame(\"undefined\", \"\", \"undefined\", 0));\n }\n}\n\nstatic PassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(v8::Handle<v8::StackTrace> stackTrace, size_t maxStackSize, bool emptyStackIsAllowed, v8::Isolate* isolate)\n{\n ASSERT(isolate->InContext());\n v8::HandleScope scope(isolate);\n Vector<ScriptCallFrame> scriptCallFrames;\n toScriptCallFramesVector(stackTrace, scriptCallFrames, maxStackSize, emptyStackIsAllowed, isolate);\n RefPtrWillBeRawPtr<ScriptCallStack> callStack = ScriptCallStack::create(scriptCallFrames);\n if (InspectorInstrumentation::hasFrontends())\n InspectorInstrumentation::appendAsyncCallStack(currentExecutionContext(isolate), callStack.get());\n return callStack.release();\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(v8::Handle<v8::StackTrace> stackTrace, size_t maxStackSize, v8::Isolate* isolate)\n{\n return createScriptCallStack(stackTrace, maxStackSize, true, isolate);\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(size_t maxStackSize, bool emptyStackIsAllowed)\n{\n v8::Isolate* isolate = v8::Isolate::GetCurrent();\n if (!isolate->InContext())\n return nullptr;\n v8::HandleScope handleScope(isolate);\n v8::Handle<v8::StackTrace> stackTrace(v8::StackTrace::CurrentStackTrace(isolate, maxStackSize, stackTraceOptions));\n return createScriptCallStack(stackTrace, maxStackSize, emptyStackIsAllowed, isolate);\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStackForConsole(ScriptState* scriptState, size_t maxStackSize)\n{\n size_t stackSize = 1;\n if (InspectorInstrumentation::hasFrontends()) {\n if (InspectorInstrumentation::consoleAgentEnabled(scriptState->executionContext()))\n stackSize = maxStackSize;\n }\n return createScriptCallStack(stackSize);\n}\n\nPassRefPtrWillBeRawPtr<ScriptArguments> createScriptArguments(ScriptState* scriptState, const v8::FunctionCallbackInfo<v8::Value>& v8arguments, unsigned skipArgumentCount)\n{\n Vector<ScriptValue> arguments;\n for (int i = skipArgumentCount; i < v8arguments.Length(); ++i)\n arguments.append(ScriptValue(scriptState, v8arguments[i]));\n\n return ScriptArguments::create(scriptState, arguments);\n}\n\n} \/\/ namespace blink\n<commit_msg>DevTools: Don't append async call stack to console stack when looking only for a top call frame.<commit_after>\/*\n * Copyright (c) 2010 Google Inc. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following disclaimer\n * in the documentation and\/or other materials provided with the\n * distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \"config.h\"\n#include \"bindings\/core\/v8\/ScriptCallStackFactory.h\"\n\n#include \"bindings\/core\/v8\/ScriptValue.h\"\n#include \"bindings\/core\/v8\/V8Binding.h\"\n#include \"core\/inspector\/InspectorInstrumentation.h\"\n#include \"core\/inspector\/ScriptArguments.h\"\n#include \"core\/inspector\/ScriptCallFrame.h\"\n#include \"core\/inspector\/ScriptCallStack.h\"\n#include \"platform\/JSONValues.h\"\n#include \"wtf\/text\/StringBuilder.h\"\n\n#include <v8-debug.h>\n\nnamespace blink {\n\nclass ExecutionContext;\n\nstatic ScriptCallFrame toScriptCallFrame(v8::Handle<v8::StackFrame> frame)\n{\n StringBuilder stringBuilder;\n stringBuilder.appendNumber(frame->GetScriptId());\n String scriptId = stringBuilder.toString();\n String sourceName;\n v8::Local<v8::String> sourceNameValue(frame->GetScriptNameOrSourceURL());\n if (!sourceNameValue.IsEmpty())\n sourceName = toCoreString(sourceNameValue);\n\n String functionName;\n v8::Local<v8::String> functionNameValue(frame->GetFunctionName());\n if (!functionNameValue.IsEmpty())\n functionName = toCoreString(functionNameValue);\n\n int sourceLineNumber = frame->GetLineNumber();\n int sourceColumn = frame->GetColumn();\n return ScriptCallFrame(functionName, scriptId, sourceName, sourceLineNumber, sourceColumn);\n}\n\nstatic void toScriptCallFramesVector(v8::Handle<v8::StackTrace> stackTrace, Vector<ScriptCallFrame>& scriptCallFrames, size_t maxStackSize, bool emptyStackIsAllowed, v8::Isolate* isolate)\n{\n ASSERT(isolate->InContext());\n int frameCount = stackTrace->GetFrameCount();\n if (frameCount > static_cast<int>(maxStackSize))\n frameCount = maxStackSize;\n for (int i = 0; i < frameCount; i++) {\n v8::Local<v8::StackFrame> stackFrame = stackTrace->GetFrame(i);\n scriptCallFrames.append(toScriptCallFrame(stackFrame));\n }\n if (!frameCount && !emptyStackIsAllowed) {\n \/\/ Successfully grabbed stack trace, but there are no frames. It may happen in case\n \/\/ when a bound function is called from native code for example.\n \/\/ Fallback to setting lineNumber to 0, and source and function name to \"undefined\".\n scriptCallFrames.append(ScriptCallFrame(\"undefined\", \"\", \"undefined\", 0));\n }\n}\n\nstatic PassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(v8::Handle<v8::StackTrace> stackTrace, size_t maxStackSize, bool emptyStackIsAllowed, v8::Isolate* isolate)\n{\n ASSERT(isolate->InContext());\n v8::HandleScope scope(isolate);\n Vector<ScriptCallFrame> scriptCallFrames;\n toScriptCallFramesVector(stackTrace, scriptCallFrames, maxStackSize, emptyStackIsAllowed, isolate);\n RefPtrWillBeRawPtr<ScriptCallStack> callStack = ScriptCallStack::create(scriptCallFrames);\n if (InspectorInstrumentation::hasFrontends() && maxStackSize > 1)\n InspectorInstrumentation::appendAsyncCallStack(currentExecutionContext(isolate), callStack.get());\n return callStack.release();\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(v8::Handle<v8::StackTrace> stackTrace, size_t maxStackSize, v8::Isolate* isolate)\n{\n return createScriptCallStack(stackTrace, maxStackSize, true, isolate);\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStack(size_t maxStackSize, bool emptyStackIsAllowed)\n{\n v8::Isolate* isolate = v8::Isolate::GetCurrent();\n if (!isolate->InContext())\n return nullptr;\n v8::HandleScope handleScope(isolate);\n v8::Handle<v8::StackTrace> stackTrace(v8::StackTrace::CurrentStackTrace(isolate, maxStackSize, stackTraceOptions));\n return createScriptCallStack(stackTrace, maxStackSize, emptyStackIsAllowed, isolate);\n}\n\nPassRefPtrWillBeRawPtr<ScriptCallStack> createScriptCallStackForConsole(ScriptState* scriptState, size_t maxStackSize)\n{\n size_t stackSize = 1;\n if (InspectorInstrumentation::hasFrontends()) {\n if (InspectorInstrumentation::consoleAgentEnabled(scriptState->executionContext()))\n stackSize = maxStackSize;\n }\n return createScriptCallStack(stackSize);\n}\n\nPassRefPtrWillBeRawPtr<ScriptArguments> createScriptArguments(ScriptState* scriptState, const v8::FunctionCallbackInfo<v8::Value>& v8arguments, unsigned skipArgumentCount)\n{\n Vector<ScriptValue> arguments;\n for (int i = skipArgumentCount; i < v8arguments.Length(); ++i)\n arguments.append(ScriptValue(scriptState, v8arguments[i]));\n\n return ScriptArguments::create(scriptState, arguments);\n}\n\n} \/\/ namespace blink\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <ctime>\n#include <cstdlib>\n#include <RandomNumberGenerator.h>\n#include \"Sampler.h\"\n#include \"Models\/SimpleExample.h\"\n\nusing namespace std;\nusing namespace DNest3;\n\nint main()\n{\n\tchar choice;\n\tdo\n\t{\n\t\tcout<<\"# [O]verwrite or [A]ppend output files? \";\n\t\tcin>>choice;\n\t\tchoice = tolower(choice);\n\t}while(choice != 'o' && choice != 'a');\n\tif(choice == 'o')\n\t{\n\t\tint result = system(\"rm logw_thinned.txt logw.txt sample.txt scalars_thinned.txt scalars.txt\");\n\t\tif(result == 0)\n\t\t\tcout<<\"# Files removed.\"<<endl;\n\t\telse\n\t\t\tcout<<\"# Files didn't exist.\"<<endl;\n\t}\n\n\t\/\/ Initialise RNG and seed with time\n\tRandomNumberGenerator::initialise_instance();\n\tRandomNumberGenerator::get_instance().set_seed(time(0));\n\n\tfor(int k=0; k<100; k++)\n\t{\n\t\tSampler<SimpleExample> s(100, 200, 5000);\n\t\ts.initialise();\n\n\t\tfor(int i=0; i<50000; i++)\n\t\t\ts.update();\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>Do 1000 reps<commit_after>#include <iostream>\n#include <ctime>\n#include <cstdlib>\n#include <RandomNumberGenerator.h>\n#include \"Sampler.h\"\n#include \"Models\/SimpleExample.h\"\n\nusing namespace std;\nusing namespace DNest3;\n\nint main()\n{\n\tchar choice;\n\tdo\n\t{\n\t\tcout<<\"# [O]verwrite or [A]ppend output files? \";\n\t\tcin>>choice;\n\t\tchoice = tolower(choice);\n\t}while(choice != 'o' && choice != 'a');\n\tif(choice == 'o')\n\t{\n\t\tint result = system(\"rm logw_thinned.txt logw.txt sample.txt scalars_thinned.txt scalars.txt\");\n\t\tif(result == 0)\n\t\t\tcout<<\"# Files removed.\"<<endl;\n\t\telse\n\t\t\tcout<<\"# Files didn't exist.\"<<endl;\n\t}\n\n\t\/\/ Initialise RNG and seed with time\n\tRandomNumberGenerator::initialise_instance();\n\tRandomNumberGenerator::get_instance().set_seed(time(0));\n\n\tfor(int k=0; k<1000; k++)\n\t{\n\t\tSampler<SimpleExample> s(100, 200, 5000);\n\t\ts.initialise();\n\n\t\tfor(int i=0; i<50000; i++)\n\t\t\ts.update();\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: apitools.cxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: vg $ $Date: 2001-10-30 11:50:53 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace cppu;\nusing namespace osl;\nusing namespace dbaccess;\n\n\/\/==================================================================================\n\/\/= various helper functions\n\/\/==================================================================================\n\/\/============================================================\n\/\/= OSubComponent\n\/\/============================================================\n\/\/--------------------------------------------------------------------------\nOSubComponent::OSubComponent(Mutex& _rMutex, const Reference< XInterface > & xParent)\n :OComponentHelper(_rMutex)\n ,m_xParent(xParent)\n{\n}\n\n\/\/ com::sun::star::lang::XTypeProvider\n\/\/--------------------------------------------------------------------------\nSequence< Type > OSubComponent::getTypes() throw (RuntimeException)\n{\n OTypeCollection aTypes(::getCppuType( (const Reference< XComponent > *)0 ),\n ::getCppuType( (const Reference< XTypeProvider > *)0 ),\n ::getCppuType( (const Reference< XWeak > *)0 ));\n\n return aTypes.getTypes();\n}\n\n\/\/ XInterface\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::acquire() throw ( )\n{\n OComponentHelper::acquire();\n}\n\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::release() throw ( )\n{\n Reference< XInterface > x( xDelegator );\n if (! x.is())\n {\n if (osl_decrementInterlockedCount( &m_refCount ) == 0)\n {\n if (! rBHelper.bDisposed)\n {\n Reference< XInterface > xHoldAlive( *this );\n\n \/\/ remember the parent\n Reference< XInterface > xParent;\n {\n MutexGuard aGuard( rBHelper.rMutex );\n xParent = m_xParent;\n m_xParent = NULL;\n }\n\n \/\/ First dispose\n dispose();\n\n \/\/ only the alive ref holds the object\n OSL_ENSURE( m_refCount == 1, \"OSubComponent::release: invalid ref count!\" );\n\n \/\/ release the parent in the ~\n if (xParent.is())\n {\n MutexGuard aGuard( rBHelper.rMutex );\n m_xParent = xParent;\n }\n\n \/\/ destroy the object if xHoldAlive decrement the refcount to 0\n return;\n }\n }\n \/\/ restore the reference count\n osl_incrementInterlockedCount( &m_refCount );\n }\n\n \/\/ as we cover the job of the componenthelper we use the ...\n OWeakAggObject::release();\n}\n\n\/\/--------------------------------------------------------------------------\nAny OSubComponent::queryInterface( const Type & rType ) throw(RuntimeException)\n{\n Any aReturn;\n if (!rType.equals(::getCppuType(static_cast< Reference< XAggregation >* >(NULL))))\n aReturn = OComponentHelper::queryInterface(rType);\n\n return aReturn;\n}\n\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::disposing()\n{\n MutexGuard aGuard( rBHelper.rMutex );\n m_xParent = NULL;\n}\n\n<commit_msg>INTEGRATION: CWS insight01 (1.5.124); FILE MERGED 2004\/02\/12 16:22:24 oj 1.5.124.1: #111075# fix refcount problem<commit_after>\/*************************************************************************\n *\n * $RCSfile: apitools.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2004-08-02 15:26:10 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef _DBASHARED_APITOOLS_HXX_\n#include \"apitools.hxx\"\n#endif\n#ifndef DBACCESS_SHARED_DBASTRINGS_HRC\n#include \"dbastrings.hrc\"\n#endif\n#ifndef _CPPUHELPER_TYPEPROVIDER_HXX_\n#include <cppuhelper\/typeprovider.hxx>\n#endif\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\nusing namespace ::com::sun::star::uno;\nusing namespace ::com::sun::star::lang;\nusing namespace cppu;\nusing namespace osl;\nusing namespace dbaccess;\n\n\/\/==================================================================================\n\/\/= various helper functions\n\/\/==================================================================================\n\/\/============================================================\n\/\/= OSubComponent\n\/\/============================================================\n\/\/--------------------------------------------------------------------------\nOSubComponent::OSubComponent(Mutex& _rMutex, const Reference< XInterface > & xParent)\n :OComponentHelper(_rMutex)\n ,m_xParent(xParent)\n{\n}\n\n\/\/ com::sun::star::lang::XTypeProvider\n\/\/--------------------------------------------------------------------------\nSequence< Type > OSubComponent::getTypes() throw (RuntimeException)\n{\n OTypeCollection aTypes(::getCppuType( (const Reference< XComponent > *)0 ),\n ::getCppuType( (const Reference< XTypeProvider > *)0 ),\n ::getCppuType( (const Reference< XWeak > *)0 ));\n\n return aTypes.getTypes();\n}\n\n\/\/ XInterface\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::acquire() throw ( )\n{\n OComponentHelper::acquire();\n}\n\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::release() throw ( )\n{\n Reference< XInterface > x( xDelegator );\n if (! x.is())\n {\n if (osl_decrementInterlockedCount( &m_refCount ) == 0)\n {\n if (! rBHelper.bDisposed)\n {\n Reference< XInterface > xHoldAlive( *this );\n\n \/\/ remember the parent\n Reference< XInterface > xParent;\n {\n MutexGuard aGuard( rBHelper.rMutex );\n xParent = m_xParent;\n m_xParent = NULL;\n }\n\n \/\/ First dispose\n dispose();\n\n \/\/ only the alive ref holds the object\n OSL_ENSURE( m_refCount == 1, \"OSubComponent::release: invalid ref count!\" );\n\n \/\/ release the parent in the ~\n if (xParent.is())\n {\n MutexGuard aGuard( rBHelper.rMutex );\n m_xParent = xParent;\n }\n\n \/\/ destroy the object if xHoldAlive decrement the refcount to 0\n return;\n }\n }\n \/\/ restore the reference count\n osl_incrementInterlockedCount( &m_refCount );\n }\n\n \/\/ as we cover the job of the componenthelper we use the ...\n OWeakAggObject::release();\n}\n\n\/\/--------------------------------------------------------------------------\nAny OSubComponent::queryInterface( const Type & rType ) throw(RuntimeException)\n{\n Any aReturn;\n if (!rType.equals(::getCppuType(static_cast< Reference< XAggregation >* >(NULL))))\n aReturn = OComponentHelper::queryInterface(rType);\n\n return aReturn;\n}\n\n\/\/--------------------------------------------------------------------------\nvoid OSubComponent::disposing()\n{\n OComponentHelper::disposing();\n MutexGuard aGuard( rBHelper.rMutex );\n m_xParent = NULL;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#include <vector>\n#include <array>\n#include <string>\n#include <functional>\n\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n#include <fc\/variant.hpp>\n#include <fc\/crypto\/base64.hpp>\n#include <fc\/crypto\/hex.hpp>\n#include <fc\/crypto\/elliptic.hpp>\n#include <fc\/crypto\/sha256.hpp>\n#include <fc\/io\/datastream.hpp>\n#include <fc\/time.hpp>\n#include <fc\/fixed_string.hpp>\n\n#include <fc\/reflect\/reflect.hpp>\n\n#define N(X) eos::types::string_to_name(#X)\n\nnamespace eos { namespace types {\n using namespace boost::multiprecision;\n\n template<typename... T>\n using Vector = std::vector<T...>;\n\n template<typename... T>\n using Array = std::array<T...>;\n\n using String = std::string;\n using Time = fc::time_point_sec;\n using Signature = fc::ecc::compact_signature;\n using Checksum = fc::sha256;\n using FieldName = fc::fixed_string<>;\n using FixedString32 = fc::fixed_string<fc::array<uint64_t,4>>;\/\/ std::tuple<uint64_t,uint64_t,uint64_t,uint64_t>>; \n using FixedString16 = fc::fixed_string<>; \n using TypeName = FixedString32;;\n using Bytes = Vector<char>;\n\n template<size_t Size>\n using UInt = number<cpp_int_backend<Size, Size, unsigned_magnitude, unchecked, void> >;\n template<size_t Size>\n using Int = number<cpp_int_backend<Size, Size, signed_magnitude, unchecked, void> >;\n\n using UInt8 = UInt<8>; \n using UInt16 = UInt<16>; \n using UInt32 = UInt<32>;\n using UInt64 = UInt<64>;\n using UInt128 = boost::multiprecision::uint128_t;\n using UInt256 = boost::multiprecision::uint256_t;\n using Int8 = int8_t;\/\/Int<8>; these types are different sizes than native...\n using Int16 = int16_t; \/\/Int<16>;\n using Int32 = int32_t; \/\/Int<32>;\n using Int64 = int64_t; \/\/Int<64>; \n using Int128 = boost::multiprecision::int128_t;\n using Int256 = boost::multiprecision::int256_t;\n using uint128_t = unsigned __int128; \/\/\/ native clang\/gcc 128 intrinisic\n \n static constexpr char char_to_symbol( char c ) {\n if( c >= 'a' && c <= 'z' )\n return (c - 'a') + 1;\n if( c >= '1' && c <= '5' )\n return (c - '1') + 27;\n return 0;\n }\n\n static constexpr uint64_t string_to_name( const char* str ) {\n\n uint32_t len = 0;\n while( str[len] ) ++len;\n\n uint64_t value = 0;\n\n for( uint32_t i = 0; i <= 12; ++i ) {\n uint64_t c = 0;\n if( i < len && i <= 12 ) c = char_to_symbol( str[i] );\n\n if( i < 12 ) {\n c &= 0x1f;\n c <<= 64-5*(i+1);\n }\n else {\n c &= 0x0f;\n }\n\n value |= c;\n }\n\n return value;\n }\n \n struct Name {\n uint64_t value = 0;\n bool valid()const { return true; }\n bool empty()const { return 0 == value; }\n bool good()const { return !empty() && valid(); }\n\n Name( const char* str ) { set(str); } \n Name( const String& str ) { set( str.c_str() ); }\n\n void set( const char* str ) {\n try {\n const auto len = strnlen(str,14);\n FC_ASSERT( len <= 13 );\n value = string_to_name(str);\n }FC_CAPTURE_AND_RETHROW( (str) ) }\n\n Name( uint64_t v = 0 ):value(v){\n \/\/ FC_ASSERT( !(v>>(5*12)), \"invalid name id\" );\n }\n\n explicit operator String()const {\n static const char* charmap = \".abcdefghijklmnopqrstuvwxyz12345\";\n\n String str(13,'.');\n\n uint64_t tmp = value;\n for( uint32_t i = 0; i <= 12; ++i ) {\n char c = charmap[tmp & (i == 0 ? 0x0f : 0x1f)];\n str[12-i] = c;\n tmp >>= (i == 0 ? 4 : 5);\n }\n\n boost::algorithm::trim_right_if( str, []( char c ){ return c == '.'; } );\n return str;\n }\n String toString() const { return String(*this); }\n\n Name& operator=( uint64_t v ) {\n value = v;\n return *this;\n }\n\n Name& operator=( const String& n ) {\n value = Name(n).value;\n return *this;\n }\n Name& operator=( const char* n ) {\n value = Name(n).value;\n return *this;\n }\n\n template<typename Stream>\n friend Stream& operator << ( Stream& out, const Name& n ) {\n return out << String(n);\n }\n\n friend bool operator < ( const Name& a, const Name& b ) { return a.value < b.value; }\n friend bool operator <= ( const Name& a, const Name& b ) { return a.value <= b.value; }\n friend bool operator > ( const Name& a, const Name& b ) { return a.value > b.value; }\n friend bool operator >=( const Name& a, const Name& b ) { return a.value >= b.value; }\n friend bool operator == ( const Name& a, const Name& b ) { return a.value == b.value; }\n friend bool operator != ( const Name& a, const Name& b ) { return a.value != b.value; }\n\n operator bool()const { return value; }\n operator uint64_t()const { return value; }\n };\n\n\n struct Field {\n FieldName name;\n TypeName type;\n\n bool operator==(const Field& other) const;\n };\n\n struct Struct {\n TypeName name;\n TypeName base;\n Vector<Field> fields;\n\n bool operator==(const Struct& other) const;\n };\n\n using Fields = Vector<Field>;\n\n template<typename T>\n struct GetStruct{};\n\n template<> struct GetStruct<Field> { \n static const Struct& type() { \n static Struct result = { \"Field \", \"\", {\n {\"name\", \"FieldName\"},\n {\"type\", \"TypeName\"}\n }\n };\n return result;\n }\n };\n template<> struct GetStruct<Struct> { \n static const Struct& type() { \n static Struct result = { \"Struct \", \"\", {\n {\"name\", \"TypeName\"},\n {\"base\", \"TypeName\"},\n {\"fields\", \"Field[]\"}\n }\n };\n return result;\n }\n };\n\n\n \/\/\/ TODO: make sure this works with FC raw\n template<typename Stream, typename Number>\n void fromBinary(Stream& st, boost::multiprecision::number<Number>& value) {\n unsigned char data[(std::numeric_limits<decltype(value)>::digits+1)\/8];\n st.read((char*)data, sizeof(data));\n boost::multiprecision::import_bits(value, data, data + sizeof(data), 1);\n }\n template<typename Stream, typename Number>\n void toBinary(Stream& st, const boost::multiprecision::number<Number>& value) {\n unsigned char data[(std::numeric_limits<decltype(value)>::digits+1)\/8];\n boost::multiprecision::export_bits(value, data, 1);\n st.write((const char*)data, sizeof(data));\n }\n \n}} \/\/ namespace eos::types\n\nnamespace fc {\n void to_variant(const eos::types::Name& c, fc::variant& v);\n void from_variant(const fc::variant& v, eos::types::Name& check);\n void to_variant(const std::vector<eos::types::Field>& c, fc::variant& v);\n void from_variant(const fc::variant& v, std::vector<eos::types::Field>& check);\n void to_variant(const std::map<std::string,eos::types::Struct>& c, fc::variant& v);\n void from_variant(const fc::variant& v, std::map<std::string,eos::types::Struct>& check);\n}\n\nFC_REFLECT(eos::types::Name, (value))\nFC_REFLECT(eos::types::Field, (name)(type))\nFC_REFLECT(eos::types::Struct, (name)(base)(fields))\n<commit_msg>throw error on name overflow #149<commit_after>#pragma once\n#include <vector>\n#include <array>\n#include <string>\n#include <functional>\n\n#include <boost\/multiprecision\/cpp_int.hpp>\n#include <boost\/algorithm\/string\/trim.hpp>\n\n#include <fc\/variant.hpp>\n#include <fc\/crypto\/base64.hpp>\n#include <fc\/crypto\/hex.hpp>\n#include <fc\/crypto\/elliptic.hpp>\n#include <fc\/crypto\/sha256.hpp>\n#include <fc\/io\/datastream.hpp>\n#include <fc\/time.hpp>\n#include <fc\/fixed_string.hpp>\n\n#include <fc\/reflect\/reflect.hpp>\n\n#define N(X) eos::types::string_to_name(#X)\n\nnamespace eos { namespace types {\n using namespace boost::multiprecision;\n\n template<typename... T>\n using Vector = std::vector<T...>;\n\n template<typename... T>\n using Array = std::array<T...>;\n\n using String = std::string;\n using Time = fc::time_point_sec;\n using Signature = fc::ecc::compact_signature;\n using Checksum = fc::sha256;\n using FieldName = fc::fixed_string<>;\n using FixedString32 = fc::fixed_string<fc::array<uint64_t,4>>;\/\/ std::tuple<uint64_t,uint64_t,uint64_t,uint64_t>>; \n using FixedString16 = fc::fixed_string<>; \n using TypeName = FixedString32;;\n using Bytes = Vector<char>;\n\n template<size_t Size>\n using UInt = number<cpp_int_backend<Size, Size, unsigned_magnitude, unchecked, void> >;\n template<size_t Size>\n using Int = number<cpp_int_backend<Size, Size, signed_magnitude, unchecked, void> >;\n\n using UInt8 = UInt<8>; \n using UInt16 = UInt<16>; \n using UInt32 = UInt<32>;\n using UInt64 = UInt<64>;\n using UInt128 = boost::multiprecision::uint128_t;\n using UInt256 = boost::multiprecision::uint256_t;\n using Int8 = int8_t;\/\/Int<8>; these types are different sizes than native...\n using Int16 = int16_t; \/\/Int<16>;\n using Int32 = int32_t; \/\/Int<32>;\n using Int64 = int64_t; \/\/Int<64>; \n using Int128 = boost::multiprecision::int128_t;\n using Int256 = boost::multiprecision::int256_t;\n using uint128_t = unsigned __int128; \/\/\/ native clang\/gcc 128 intrinisic\n \n static constexpr char char_to_symbol( char c ) {\n if( c >= 'a' && c <= 'z' )\n return (c - 'a') + 1;\n if( c >= '1' && c <= '5' )\n return (c - '1') + 27;\n return 0;\n }\n\n static constexpr uint64_t string_to_name( const char* str ) {\n\n uint32_t len = 0;\n while( str[len] ) ++len;\n\n uint64_t value = 0;\n\n for( uint32_t i = 0; i <= 12; ++i ) {\n uint64_t c = 0;\n if( i < len && i <= 12 ) c = char_to_symbol( str[i] );\n\n if( i < 12 ) {\n c &= 0x1f;\n c <<= 64-5*(i+1);\n }\n else {\n c &= 0x0f;\n }\n\n value |= c;\n }\n\n return value;\n }\n \n struct Name {\n uint64_t value = 0;\n bool valid()const { return true; }\n bool empty()const { return 0 == value; }\n bool good()const { return !empty() && valid(); }\n\n Name( const char* str ) { set(str); } \n Name( const String& str ) { set( str.c_str() ); }\n\n void set( const char* str ) {\n try {\n const auto len = strnlen(str,14);\n FC_ASSERT( len <= 13 );\n value = string_to_name(str);\n FC_ASSERT( toString() == String(str), \"name not properly normalized\", (\"name\",String(str))(\"normalized\",toString()) );\n }FC_CAPTURE_AND_RETHROW( (str) ) }\n\n Name( uint64_t v = 0 ):value(v){}\n\n explicit operator String()const {\n static const char* charmap = \".abcdefghijklmnopqrstuvwxyz12345\";\n\n String str(13,'.');\n\n uint64_t tmp = value;\n for( uint32_t i = 0; i <= 12; ++i ) {\n char c = charmap[tmp & (i == 0 ? 0x0f : 0x1f)];\n str[12-i] = c;\n tmp >>= (i == 0 ? 4 : 5);\n }\n\n boost::algorithm::trim_right_if( str, []( char c ){ return c == '.'; } );\n return str;\n }\n String toString() const { return String(*this); }\n\n Name& operator=( uint64_t v ) {\n value = v;\n return *this;\n }\n\n Name& operator=( const String& n ) {\n value = Name(n).value;\n return *this;\n }\n Name& operator=( const char* n ) {\n value = Name(n).value;\n return *this;\n }\n\n template<typename Stream>\n friend Stream& operator << ( Stream& out, const Name& n ) {\n return out << String(n);\n }\n\n friend bool operator < ( const Name& a, const Name& b ) { return a.value < b.value; }\n friend bool operator <= ( const Name& a, const Name& b ) { return a.value <= b.value; }\n friend bool operator > ( const Name& a, const Name& b ) { return a.value > b.value; }\n friend bool operator >=( const Name& a, const Name& b ) { return a.value >= b.value; }\n friend bool operator == ( const Name& a, const Name& b ) { return a.value == b.value; }\n friend bool operator != ( const Name& a, const Name& b ) { return a.value != b.value; }\n\n operator bool()const { return value; }\n operator uint64_t()const { return value; }\n };\n\n\n struct Field {\n FieldName name;\n TypeName type;\n\n bool operator==(const Field& other) const;\n };\n\n struct Struct {\n TypeName name;\n TypeName base;\n Vector<Field> fields;\n\n bool operator==(const Struct& other) const;\n };\n\n using Fields = Vector<Field>;\n\n template<typename T>\n struct GetStruct{};\n\n template<> struct GetStruct<Field> { \n static const Struct& type() { \n static Struct result = { \"Field \", \"\", {\n {\"name\", \"FieldName\"},\n {\"type\", \"TypeName\"}\n }\n };\n return result;\n }\n };\n template<> struct GetStruct<Struct> { \n static const Struct& type() { \n static Struct result = { \"Struct \", \"\", {\n {\"name\", \"TypeName\"},\n {\"base\", \"TypeName\"},\n {\"fields\", \"Field[]\"}\n }\n };\n return result;\n }\n };\n\n\n \/\/\/ TODO: make sure this works with FC raw\n template<typename Stream, typename Number>\n void fromBinary(Stream& st, boost::multiprecision::number<Number>& value) {\n unsigned char data[(std::numeric_limits<decltype(value)>::digits+1)\/8];\n st.read((char*)data, sizeof(data));\n boost::multiprecision::import_bits(value, data, data + sizeof(data), 1);\n }\n template<typename Stream, typename Number>\n void toBinary(Stream& st, const boost::multiprecision::number<Number>& value) {\n unsigned char data[(std::numeric_limits<decltype(value)>::digits+1)\/8];\n boost::multiprecision::export_bits(value, data, 1);\n st.write((const char*)data, sizeof(data));\n }\n \n}} \/\/ namespace eos::types\n\nnamespace fc {\n void to_variant(const eos::types::Name& c, fc::variant& v);\n void from_variant(const fc::variant& v, eos::types::Name& check);\n void to_variant(const std::vector<eos::types::Field>& c, fc::variant& v);\n void from_variant(const fc::variant& v, std::vector<eos::types::Field>& check);\n void to_variant(const std::map<std::string,eos::types::Struct>& c, fc::variant& v);\n void from_variant(const fc::variant& v, std::map<std::string,eos::types::Struct>& check);\n}\n\nFC_REFLECT(eos::types::Name, (value))\nFC_REFLECT(eos::types::Field, (name)(type))\nFC_REFLECT(eos::types::Struct, (name)(base)(fields))\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2014-2015 Islog\n\n This file is part of Leosac.\n\n Leosac is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Leosac is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <zmqpp\/message.hpp>\n#include <tools\/log.hpp>\n#include <core\/auth\/Auth.hpp>\n#include <tools\/Colorize.hpp>\n#include \"NotifierInstance.hpp\"\n#include \"core\/auth\/WiegandCard.hpp\"\n\nusing namespace Leosac;\nusing namespace Leosac::Module;\nusing namespace Leosac::Module::TCPNotifier;\n\nNotifierInstance::NotifierInstance(zmqpp::context &ctx, zmqpp::reactor &reactor,\n std::vector<std::string> auth_sources,\n std::vector<std::string> connect_to,\n std::vector<std::string> bind_to,\n ProtocolHandlerUPtr protocol_handler)\n : bus_sub_(ctx, zmqpp::socket_type::sub)\n , tcp_(ctx, zmqpp::socket_type::stream)\n , protocol_(std::move(protocol_handler))\n{\n ASSERT_LOG(connect_to.empty() || bind_to.empty(),\n \"Cannot bind and connect at the same time.\");\n ASSERT_LOG(!connect_to.empty() || !bind_to.empty(), \"Cannot do nothing\");\n ASSERT_LOG(protocol_, \"No protocol handler\");\n\n act_as_server_ = !bind_to.empty();\n\n bus_sub_.connect(\"inproc:\/\/zmq-bus-pub\");\n reactor.add(bus_sub_, std::bind(&NotifierInstance::handle_msg_bus, this));\n reactor.add(tcp_, std::bind(&NotifierInstance::handle_tcp_msg, this));\n\n for (const auto &src : auth_sources)\n {\n bus_sub_.subscribe(\"S_\" + src);\n }\n\n if (act_as_server_)\n {\n for (auto &endpoint : bind_to)\n {\n INFO(\"TCP-Notifier binding to: tcp:\/\/\" << endpoint);\n tcp_.bind(\"tcp:\/\/\" + endpoint);\n }\n }\n else\n {\n for (auto &endpoint : connect_to)\n {\n TargetInfo target;\n target.url_ = \"tcp:\/\/\" + endpoint;\n target.status_ = false;\n tcp_.connect(target.url_);\n INFO(\"TCP-Notifier remote target: \" << Colorize::green(target.url_));\n tcp_.get(zmqpp::socket_option::identity, target.zmq_identity_);\n targets_.push_back(std::move(target));\n }\n }\n}\n\nvoid NotifierInstance::handle_credential(Leosac::Auth::WiegandCard &card)\n{\n for (const auto &target : targets_)\n {\n \/\/ Skip disconnected client.\n if (!target.status_)\n continue;\n zmqpp::message msg;\n\n msg << target.zmq_identity_;\n auto data = protocol_->build_cred_msg(card);\n msg.add_raw(&data[0], data.size());\n\n auto ret = tcp_.send(msg, true);\n if (ret == false) \/\/ would block. woops\n {\n ERROR(\"Sending to client would block.\");\n }\n }\n}\n\nvoid NotifierInstance::handle_tcp_msg()\n{\n zmqpp::message msg;\n\n tcp_.receive(msg);\n std::string routing_id;\n std::string data;\n\n assert(msg.parts() == 2);\n msg >> routing_id >> data;\n\n INFO(\"Received TCP data from client \" << routing_id << \", data {\" << data\n << \"}\");\n if (data.size() == 0)\n {\n auto target = find_target(routing_id);\n if (!target && act_as_server_)\n {\n TargetInfo ti;\n ti.status_ = true;\n ti.zmq_identity_ = routing_id;\n\n targets_.push_back(std::move(ti));\n INFO(\"New client connected to us.\");\n return;\n }\n else\n ASSERT_LOG(target, \"Why did we lose a target?\");\n\n if (target->status_)\n INFO(\"Lost connection with client\");\n else\n INFO(\"Successfully connected to client.\");\n\n target->status_ = !target->status_;\n }\n}\n\nNotifierInstance::TargetInfo *\nNotifierInstance::find_target(const std::string &routing_id)\n{\n auto itr = std::find_if(targets_.begin(), targets_.end(),\n [&](const TargetInfo &target)\n {\n return target.zmq_identity_ == routing_id;\n });\n if (itr != targets_.end())\n return &(*itr);\n return nullptr;\n}\n\nvoid NotifierInstance::handle_msg_bus()\n{\n zmqpp::message msg;\n std::string src;\n Leosac::Auth::SourceType type;\n std::string card;\n int bits;\n\n bus_sub_.receive(msg);\n if (msg.parts() < 4)\n {\n WARN(\"Unexpected message content.\");\n return;\n }\n msg >> src >> type >> card >> bits;\n if (type != Leosac::Auth::SourceType::SIMPLE_WIEGAND)\n {\n INFO(\"TCP-Notifier cannot handle this type of credential yet.\");\n return;\n }\n auto wiegand_card = Auth::WiegandCard(card, bits);\n\n handle_credential(wiegand_card);\n}\n<commit_msg>Fix memory leak in TCP-Notifier<commit_after>\/*\n Copyright (C) 2014-2015 Islog\n\n This file is part of Leosac.\n\n Leosac is free software: you can redistribute it and\/or modify\n it under the terms of the GNU Affero General Public License as published by\n the Free Software Foundation, either version 3 of the License, or\n (at your option) any later version.\n\n Leosac is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU Affero General Public License for more details.\n\n You should have received a copy of the GNU Affero General Public License\n along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <zmqpp\/message.hpp>\n#include <tools\/log.hpp>\n#include <core\/auth\/Auth.hpp>\n#include <tools\/Colorize.hpp>\n#include \"NotifierInstance.hpp\"\n#include \"core\/auth\/WiegandCard.hpp\"\n\nusing namespace Leosac;\nusing namespace Leosac::Module;\nusing namespace Leosac::Module::TCPNotifier;\n\nNotifierInstance::NotifierInstance(zmqpp::context &ctx, zmqpp::reactor &reactor,\n std::vector<std::string> auth_sources,\n std::vector<std::string> connect_to,\n std::vector<std::string> bind_to,\n ProtocolHandlerUPtr protocol_handler)\n : bus_sub_(ctx, zmqpp::socket_type::sub)\n , tcp_(ctx, zmqpp::socket_type::stream)\n , protocol_(std::move(protocol_handler))\n{\n ASSERT_LOG(connect_to.empty() || bind_to.empty(),\n \"Cannot bind and connect at the same time.\");\n ASSERT_LOG(!connect_to.empty() || !bind_to.empty(), \"Cannot do nothing\");\n ASSERT_LOG(protocol_, \"No protocol handler\");\n\n act_as_server_ = !bind_to.empty();\n\n bus_sub_.connect(\"inproc:\/\/zmq-bus-pub\");\n reactor.add(bus_sub_, std::bind(&NotifierInstance::handle_msg_bus, this));\n reactor.add(tcp_, std::bind(&NotifierInstance::handle_tcp_msg, this));\n\n for (const auto &src : auth_sources)\n {\n bus_sub_.subscribe(\"S_\" + src);\n }\n\n if (act_as_server_)\n {\n for (auto &endpoint : bind_to)\n {\n INFO(\"TCP-Notifier binding to: tcp:\/\/\" << endpoint);\n tcp_.bind(\"tcp:\/\/\" + endpoint);\n }\n }\n else\n {\n for (auto &endpoint : connect_to)\n {\n TargetInfo target;\n target.url_ = \"tcp:\/\/\" + endpoint;\n target.status_ = false;\n tcp_.connect(target.url_);\n INFO(\"TCP-Notifier remote target: \" << Colorize::green(target.url_));\n tcp_.get(zmqpp::socket_option::identity, target.zmq_identity_);\n targets_.push_back(std::move(target));\n }\n }\n}\n\nvoid NotifierInstance::handle_credential(Leosac::Auth::WiegandCard &card)\n{\n for (const auto &target : targets_)\n {\n \/\/ Skip disconnected client.\n if (!target.status_)\n continue;\n zmqpp::message msg;\n\n msg << target.zmq_identity_;\n auto data = protocol_->build_cred_msg(card);\n msg.add_raw(&data[0], data.size());\n\n auto ret = tcp_.send(msg, true);\n if (ret == false) \/\/ would block. woops\n {\n ERROR(\"Sending to client would block.\");\n }\n }\n}\n\nvoid NotifierInstance::handle_tcp_msg()\n{\n zmqpp::message msg;\n\n tcp_.receive(msg);\n std::string routing_id;\n std::string data;\n\n assert(msg.parts() == 2);\n msg >> routing_id >> data;\n\n INFO(\"Received TCP data from client \" << routing_id << \", data {\" << data\n << \"}\");\n if (data.size() == 0)\n {\n auto target = find_target(routing_id);\n if (act_as_server_)\n {\n \/\/ As a server we drop disconnected peer, or create TargetInfo\n \/\/ for newly connected peer.\n if (!target)\n {\n TargetInfo ti;\n ti.status_ = true;\n ti.zmq_identity_ = routing_id;\n\n targets_.push_back(std::move(ti));\n INFO(\"New client connected to us.\");\n }\n else\n {\n targets_.erase(std::remove_if(targets_.begin(), targets_.end(),\n [&](const TargetInfo &info)\n {\n return info.zmq_identity_ == routing_id;\n }),\n targets_.end());\n }\n return;\n }\n ASSERT_LOG(target, \"Why did we lose a target?\");\n\n if (target->status_)\n INFO(\"Lost connection with client\");\n else\n INFO(\"Successfully connected to client.\");\n\n target->status_ = !target->status_;\n }\n}\n\nNotifierInstance::TargetInfo *\nNotifierInstance::find_target(const std::string &routing_id)\n{\n auto itr = std::find_if(targets_.begin(), targets_.end(),\n [&](const TargetInfo &target)\n {\n return target.zmq_identity_ == routing_id;\n });\n if (itr != targets_.end())\n return &(*itr);\n return nullptr;\n}\n\nvoid NotifierInstance::handle_msg_bus()\n{\n zmqpp::message msg;\n std::string src;\n Leosac::Auth::SourceType type;\n std::string card;\n int bits;\n\n bus_sub_.receive(msg);\n if (msg.parts() < 4)\n {\n WARN(\"Unexpected message content.\");\n return;\n }\n msg >> src >> type >> card >> bits;\n if (type != Leosac::Auth::SourceType::SIMPLE_WIEGAND)\n {\n INFO(\"TCP-Notifier cannot handle this type of credential yet.\");\n return;\n }\n auto wiegand_card = Auth::WiegandCard(card, bits);\n\n handle_credential(wiegand_card);\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2012 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QtCore\/qpointer.h>\n#include <QtCore\/qdatetime.h>\n#include <QtCore\/qbasictimer.h>\n#include <QtCore\/qcoreevent.h>\n#include <QtCore\/qdebug.h>\n#include <QtGui\/qgraphicsscene.h>\n#include <QtGui\/qgraphicsview.h>\n#include <QtGui\/qscrollbar.h>\n#include <QtGui\/qx11info_x11.h>\n\n#include \"qgraphicsvideoitem.h\"\n\n#ifdef Q_OS_SYMBIAN\n#define QGRAPHICSVIDEOITEM_ROTATION_SUPPORT\n#endif\n\n#include <qmediaobject.h>\n#include <qmediaservice.h>\n#include <qvideowindowcontrol.h>\n\n\nQT_BEGIN_NAMESPACE\n\n#define DEBUG_GFX_VIDEO_ITEM\n\nclass QGraphicsVideoItemPrivate : public QObject\n{\npublic:\n QGraphicsVideoItemPrivate()\n : q_ptr(0)\n , mediaObject(0)\n , service(0)\n , windowControl(0)\n , savedViewportUpdateMode(QGraphicsView::FullViewportUpdate)\n , aspectRatioMode(Qt::KeepAspectRatio)\n , rect(0.0, 0.0, 320, 240)\n , videoWidget(0)\n {\n }\n\n QGraphicsVideoItem *q_ptr;\n\n QMediaObject *mediaObject;\n QMediaService *service;\n QVideoWindowControl *windowControl;\n QPointer<QGraphicsView> currentView;\n QList<QPointer<QObject> > eventFilterTargets;\n QGraphicsView::ViewportUpdateMode savedViewportUpdateMode;\n\n Qt::AspectRatioMode aspectRatioMode;\n QRectF rect;\n QRectF boundingRect;\n QRectF displayRect;\n QSizeF nativeSize;\n\n QWidget *videoWidget;\n\n bool eventFilter(QObject *object, QEvent *event);\n void updateEventFilters();\n\n void setWidget(QWidget *widget);\n void clearService();\n void updateRects();\n void updateLastFrame();\n\n void _q_present();\n void _q_updateNativeSize();\n void _q_serviceDestroyed();\n void _q_mediaObjectDestroyed();\n};\n\nvoid QGraphicsVideoItemPrivate::_q_present()\n{\n\n}\n\nbool QGraphicsVideoItemPrivate::eventFilter(QObject *object, QEvent *event)\n{\n if (windowControl && object == videoWidget && QEvent::WinIdChange == event->type()) {\n windowControl->setWinId(videoWidget->effectiveWinId());\n } else {\n bool updateEventFiltersRequired = false;\n bool refreshDisplayRequired = false;\n foreach (QPointer<QObject> target, eventFilterTargets) {\n if (object == target.data()) {\n switch (event->type()) {\n case QEvent::ParentChange:\n updateEventFiltersRequired = true;\n refreshDisplayRequired = true;\n break;\n case QEvent::Move:\n case QEvent::Resize:\n refreshDisplayRequired = true;\n break;\n }\n }\n }\n if (updateEventFiltersRequired)\n updateEventFilters();\n#ifdef Q_OS_SYMBIAN\n if (refreshDisplayRequired && windowControl)\n QMetaObject::invokeMethod(windowControl, \"refreshDisplay\");\n#endif\n }\n return false;\n}\n\nvoid QGraphicsVideoItemPrivate::setWidget(QWidget *widget)\n{\n if (videoWidget != widget) {\n videoWidget = widget;\n if (widget) {\n windowControl->setWinId(widget->winId());\n widget->installEventFilter(this);\n }\n }\n}\n\nvoid QGraphicsVideoItemPrivate::clearService()\n{\n if (windowControl) {\n QObject::disconnect(windowControl, SIGNAL(nativeSizeChanged()), q_ptr, SLOT(_q_updateNativeSize()));\n service->releaseControl(windowControl);\n windowControl = 0;\n }\n\n if (service) {\n QObject::disconnect(service, SIGNAL(destroyed()), q_ptr, SLOT(_q_serviceDestroyed()));\n service = 0;\n }\n}\n\nvoid QGraphicsVideoItemPrivate::updateRects()\n{\n q_ptr->prepareGeometryChange();\n QSizeF videoSize;\n if (nativeSize.isEmpty()) {\n videoSize = rect.size();\n } else if (aspectRatioMode == Qt::IgnoreAspectRatio) {\n videoSize = rect.size();\n } else {\n \/\/ KeepAspectRatio or KeepAspectRatioByExpanding\n videoSize = nativeSize;\n videoSize.scale(rect.size(), aspectRatioMode);\n }\n displayRect = QRectF(QPointF(0, 0), videoSize);\n displayRect.moveCenter(rect.center());\n boundingRect = displayRect.intersected(rect);\n}\n\nvoid QGraphicsVideoItemPrivate::updateLastFrame()\n{\n}\n\nvoid QGraphicsVideoItemPrivate::updateEventFilters()\n{\n \/\/ In order to determine when the absolute screen position of the item\n \/\/ changes, we need to receive move events sent to m_currentView\n \/\/ or any of its ancestors.\n foreach (QPointer<QObject> target, eventFilterTargets)\n if (target)\n target->removeEventFilter(this);\n eventFilterTargets.clear();\n QObject *target = currentView;\n while (target) {\n target->installEventFilter(this);\n eventFilterTargets.append(target);\n target = target->parent();\n }\n}\n\nvoid QGraphicsVideoItemPrivate::_q_updateNativeSize()\n{\n const QSize size = windowControl->nativeSize();\n if (nativeSize != size) {\n nativeSize = size;\n\n updateRects();\n emit q_ptr->nativeSizeChanged(nativeSize);\n }\n}\n\nvoid QGraphicsVideoItemPrivate::_q_serviceDestroyed()\n{\n windowControl = 0;\n service = 0;\n}\n\nvoid QGraphicsVideoItemPrivate::_q_mediaObjectDestroyed()\n{\n mediaObject = 0;\n\n clearService();\n}\n\nQGraphicsVideoItem::QGraphicsVideoItem(QGraphicsItem *parent)\n : QGraphicsObject(parent)\n , d_ptr(new QGraphicsVideoItemPrivate)\n{\n d_ptr->q_ptr = this;\n\n setCacheMode(NoCache);\n setFlag(QGraphicsItem::ItemIgnoresParentOpacity);\n setFlag(QGraphicsItem::ItemSendsGeometryChanges);\n setFlag(QGraphicsItem::ItemSendsScenePositionChanges);\n}\n\nQGraphicsVideoItem::~QGraphicsVideoItem()\n{\n if (d_ptr->windowControl) {\n d_ptr->service->releaseControl(d_ptr->windowControl);\n }\n\n if (d_ptr->currentView)\n d_ptr->currentView->setViewportUpdateMode(d_ptr->savedViewportUpdateMode);\n\n delete d_ptr;\n}\n\nQMediaObject *QGraphicsVideoItem::mediaObject() const\n{\n return d_func()->mediaObject;\n}\n\nbool QGraphicsVideoItem::setMediaObject(QMediaObject *object)\n{\n Q_D(QGraphicsVideoItem);\n\n if (object == d->mediaObject)\n return true;\n\n d->clearService();\n\n d->mediaObject = object;\n\n if (d->mediaObject) {\n d->service = d->mediaObject->service();\n\n if (d->service) {\n d->windowControl = qobject_cast<QVideoWindowControl *>(\n d->service->requestControl(QVideoWindowControl_iid));\n\n if (d->windowControl != 0) {\n connect(d->service, SIGNAL(destroyed()), SLOT(_q_serviceDestroyed()));\n connect(d->windowControl, SIGNAL(nativeSizeChanged()), SLOT(_q_updateNativeSize()));\n d->windowControl->setAspectRatioMode(Qt::IgnoreAspectRatio);\n \/\/d->windowControl->setProperty(\"colorKey\", QVariant(QColor(16,7,2)));\n d->windowControl->setProperty(\"autopaintColorKey\", QVariant(false));\n\n d->updateRects();\n return true;\n } else {\n qWarning() << \"Service doesn't support QVideoWindowControl, overlay item failed\";\n }\n }\n }\n\n d->mediaObject = 0;\n return false;\n}\n\nQt::AspectRatioMode QGraphicsVideoItem::aspectRatioMode() const\n{\n return d_func()->aspectRatioMode;\n}\n\nvoid QGraphicsVideoItem::setAspectRatioMode(Qt::AspectRatioMode mode)\n{\n Q_D(QGraphicsVideoItem);\n\n d->aspectRatioMode = mode;\n d->updateRects();\n}\n\nQPointF QGraphicsVideoItem::offset() const\n{\n return d_func()->rect.topLeft();\n}\n\nvoid QGraphicsVideoItem::setOffset(const QPointF &offset)\n{\n Q_D(QGraphicsVideoItem);\n\n d->rect.moveTo(offset);\n d->updateRects();\n}\n\nQSizeF QGraphicsVideoItem::size() const\n{\n return d_func()->rect.size();\n}\n\nvoid QGraphicsVideoItem::setSize(const QSizeF &size)\n{\n Q_D(QGraphicsVideoItem);\n\n d->rect.setSize(size.isValid() ? size : QSizeF(0, 0));\n d->updateRects();\n}\n\nQSizeF QGraphicsVideoItem::nativeSize() const\n{\n return d_func()->nativeSize;\n}\n\nQRectF QGraphicsVideoItem::boundingRect() const\n{\n return d_func()->boundingRect;\n}\n\nvoid QGraphicsVideoItem::paint(\n QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n#ifdef DEBUG_GFX_VIDEO_ITEM\n qDebug() << \"QGraphicsVideoItem::paint\";\n#endif\n\n Q_UNUSED(option);\n Q_D(QGraphicsVideoItem);\n\n QGraphicsView *view = 0;\n if (scene() && !scene()->views().isEmpty())\n view = scene()->views().first();\n\n \/\/it's necessary to switch vieport update mode to FullViewportUpdate\n \/\/otherwise the video item area can be just scrolled without notifying overlay\n \/\/about geometry changes\n if (view != d->currentView) {\n if (d->currentView) {\n d->currentView->setViewportUpdateMode(d->savedViewportUpdateMode);\n }\n\n d->currentView = view;\n if (view) {\n d->savedViewportUpdateMode = view->viewportUpdateMode();\n view->setViewportUpdateMode(QGraphicsView::FullViewportUpdate);\n }\n d->updateEventFilters();\n }\n\n QColor colorKey = Qt::black;\n\n if (d->windowControl != 0 && widget != 0) {\n d->setWidget(widget);\n\n QTransform transform = painter->combinedTransform();\n QRect overlayRect = transform.mapRect(d->displayRect).toRect();\n QRect currentSurfaceRect = d->windowControl->displayRect();\n\n if (currentSurfaceRect != overlayRect) { \n#ifdef DEBUG_GFX_VIDEO_ITEM\n qDebug() << \"set video display rect:\" << overlayRect;\n#endif\n d->windowControl->setDisplayRect(overlayRect);\n }\n\n colorKey = d->windowControl->property(\"colorKey\").value<QColor>();\n#ifdef QGRAPHICSVIDEOITEM_ROTATION_SUPPORT\n const qreal angle = transform.map(QLineF(0, 0, 1, 0)).angle();\n d->windowControl->setProperty(\"rotation\", QVariant::fromValue<qreal>(angle));\n#endif\n }\n\n if (colorKey.alpha() != 255)\n painter->setCompositionMode(QPainter::CompositionMode_Source);\n painter->fillRect(d->boundingRect, colorKey);\n}\n\nQVariant QGraphicsVideoItem::itemChange(GraphicsItemChange change, const QVariant &value)\n{\n Q_D(QGraphicsVideoItem);\n\n switch (change) {\n case ItemScenePositionHasChanged:\n update(boundingRect());\n break;\n case ItemVisibleChange:\n \/\/move overlay out of the screen if video item becomes invisible\n if (d->windowControl != 0 && !value.toBool())\n d->windowControl->setDisplayRect(QRect(-1,-1,1,1));\n break;\n default:\n break;\n }\n\n return QGraphicsItem::itemChange(change, value);\n}\n\nvoid QGraphicsVideoItem::timerEvent(QTimerEvent *event)\n{\n QGraphicsObject::timerEvent(event);\n}\n\n#include \"moc_qgraphicsvideoitem.cpp\"\nQT_END_NAMESPACE\n<commit_msg>QtMultimedia: silence compiler warning about unhandled enum values<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2012 Digia Plc and\/or its subsidiary(-ies).\n** Contact: http:\/\/www.qt-project.org\/legal\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** Commercial License Usage\n** Licensees holding valid commercial Qt licenses may use this file in\n** accordance with the commercial license agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Digia. For licensing terms and\n** conditions see http:\/\/qt.digia.com\/licensing. For further information\n** use the contact form at http:\/\/qt.digia.com\/contact-us.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Digia gives you certain additional\n** rights. These rights are described in the Digia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** GNU General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU\n** General Public License version 3.0 as published by the Free Software\n** Foundation and appearing in the file LICENSE.GPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU General Public License version 3.0 requirements will be\n** met: http:\/\/www.gnu.org\/copyleft\/gpl.html.\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include <QtCore\/qpointer.h>\n#include <QtCore\/qdatetime.h>\n#include <QtCore\/qbasictimer.h>\n#include <QtCore\/qcoreevent.h>\n#include <QtCore\/qdebug.h>\n#include <QtGui\/qgraphicsscene.h>\n#include <QtGui\/qgraphicsview.h>\n#include <QtGui\/qscrollbar.h>\n#include <QtGui\/qx11info_x11.h>\n\n#include \"qgraphicsvideoitem.h\"\n\n#ifdef Q_OS_SYMBIAN\n#define QGRAPHICSVIDEOITEM_ROTATION_SUPPORT\n#endif\n\n#include <qmediaobject.h>\n#include <qmediaservice.h>\n#include <qvideowindowcontrol.h>\n\n\nQT_BEGIN_NAMESPACE\n\n#define DEBUG_GFX_VIDEO_ITEM\n\nclass QGraphicsVideoItemPrivate : public QObject\n{\npublic:\n QGraphicsVideoItemPrivate()\n : q_ptr(0)\n , mediaObject(0)\n , service(0)\n , windowControl(0)\n , savedViewportUpdateMode(QGraphicsView::FullViewportUpdate)\n , aspectRatioMode(Qt::KeepAspectRatio)\n , rect(0.0, 0.0, 320, 240)\n , videoWidget(0)\n {\n }\n\n QGraphicsVideoItem *q_ptr;\n\n QMediaObject *mediaObject;\n QMediaService *service;\n QVideoWindowControl *windowControl;\n QPointer<QGraphicsView> currentView;\n QList<QPointer<QObject> > eventFilterTargets;\n QGraphicsView::ViewportUpdateMode savedViewportUpdateMode;\n\n Qt::AspectRatioMode aspectRatioMode;\n QRectF rect;\n QRectF boundingRect;\n QRectF displayRect;\n QSizeF nativeSize;\n\n QWidget *videoWidget;\n\n bool eventFilter(QObject *object, QEvent *event);\n void updateEventFilters();\n\n void setWidget(QWidget *widget);\n void clearService();\n void updateRects();\n void updateLastFrame();\n\n void _q_present();\n void _q_updateNativeSize();\n void _q_serviceDestroyed();\n void _q_mediaObjectDestroyed();\n};\n\nvoid QGraphicsVideoItemPrivate::_q_present()\n{\n\n}\n\nbool QGraphicsVideoItemPrivate::eventFilter(QObject *object, QEvent *event)\n{\n if (windowControl && object == videoWidget && QEvent::WinIdChange == event->type()) {\n windowControl->setWinId(videoWidget->effectiveWinId());\n } else {\n bool updateEventFiltersRequired = false;\n bool refreshDisplayRequired = false;\n foreach (QPointer<QObject> target, eventFilterTargets) {\n if (object == target.data()) {\n switch (event->type()) {\n case QEvent::ParentChange:\n updateEventFiltersRequired = true;\n refreshDisplayRequired = true;\n break;\n case QEvent::Move:\n case QEvent::Resize:\n refreshDisplayRequired = true;\n break;\n default: ;\n }\n }\n }\n if (updateEventFiltersRequired)\n updateEventFilters();\n#ifdef Q_OS_SYMBIAN\n if (refreshDisplayRequired && windowControl)\n QMetaObject::invokeMethod(windowControl, \"refreshDisplay\");\n#endif\n }\n return false;\n}\n\nvoid QGraphicsVideoItemPrivate::setWidget(QWidget *widget)\n{\n if (videoWidget != widget) {\n videoWidget = widget;\n if (widget) {\n windowControl->setWinId(widget->winId());\n widget->installEventFilter(this);\n }\n }\n}\n\nvoid QGraphicsVideoItemPrivate::clearService()\n{\n if (windowControl) {\n QObject::disconnect(windowControl, SIGNAL(nativeSizeChanged()), q_ptr, SLOT(_q_updateNativeSize()));\n service->releaseControl(windowControl);\n windowControl = 0;\n }\n\n if (service) {\n QObject::disconnect(service, SIGNAL(destroyed()), q_ptr, SLOT(_q_serviceDestroyed()));\n service = 0;\n }\n}\n\nvoid QGraphicsVideoItemPrivate::updateRects()\n{\n q_ptr->prepareGeometryChange();\n QSizeF videoSize;\n if (nativeSize.isEmpty()) {\n videoSize = rect.size();\n } else if (aspectRatioMode == Qt::IgnoreAspectRatio) {\n videoSize = rect.size();\n } else {\n \/\/ KeepAspectRatio or KeepAspectRatioByExpanding\n videoSize = nativeSize;\n videoSize.scale(rect.size(), aspectRatioMode);\n }\n displayRect = QRectF(QPointF(0, 0), videoSize);\n displayRect.moveCenter(rect.center());\n boundingRect = displayRect.intersected(rect);\n}\n\nvoid QGraphicsVideoItemPrivate::updateLastFrame()\n{\n}\n\nvoid QGraphicsVideoItemPrivate::updateEventFilters()\n{\n \/\/ In order to determine when the absolute screen position of the item\n \/\/ changes, we need to receive move events sent to m_currentView\n \/\/ or any of its ancestors.\n foreach (QPointer<QObject> target, eventFilterTargets)\n if (target)\n target->removeEventFilter(this);\n eventFilterTargets.clear();\n QObject *target = currentView;\n while (target) {\n target->installEventFilter(this);\n eventFilterTargets.append(target);\n target = target->parent();\n }\n}\n\nvoid QGraphicsVideoItemPrivate::_q_updateNativeSize()\n{\n const QSize size = windowControl->nativeSize();\n if (nativeSize != size) {\n nativeSize = size;\n\n updateRects();\n emit q_ptr->nativeSizeChanged(nativeSize);\n }\n}\n\nvoid QGraphicsVideoItemPrivate::_q_serviceDestroyed()\n{\n windowControl = 0;\n service = 0;\n}\n\nvoid QGraphicsVideoItemPrivate::_q_mediaObjectDestroyed()\n{\n mediaObject = 0;\n\n clearService();\n}\n\nQGraphicsVideoItem::QGraphicsVideoItem(QGraphicsItem *parent)\n : QGraphicsObject(parent)\n , d_ptr(new QGraphicsVideoItemPrivate)\n{\n d_ptr->q_ptr = this;\n\n setCacheMode(NoCache);\n setFlag(QGraphicsItem::ItemIgnoresParentOpacity);\n setFlag(QGraphicsItem::ItemSendsGeometryChanges);\n setFlag(QGraphicsItem::ItemSendsScenePositionChanges);\n}\n\nQGraphicsVideoItem::~QGraphicsVideoItem()\n{\n if (d_ptr->windowControl) {\n d_ptr->service->releaseControl(d_ptr->windowControl);\n }\n\n if (d_ptr->currentView)\n d_ptr->currentView->setViewportUpdateMode(d_ptr->savedViewportUpdateMode);\n\n delete d_ptr;\n}\n\nQMediaObject *QGraphicsVideoItem::mediaObject() const\n{\n return d_func()->mediaObject;\n}\n\nbool QGraphicsVideoItem::setMediaObject(QMediaObject *object)\n{\n Q_D(QGraphicsVideoItem);\n\n if (object == d->mediaObject)\n return true;\n\n d->clearService();\n\n d->mediaObject = object;\n\n if (d->mediaObject) {\n d->service = d->mediaObject->service();\n\n if (d->service) {\n d->windowControl = qobject_cast<QVideoWindowControl *>(\n d->service->requestControl(QVideoWindowControl_iid));\n\n if (d->windowControl != 0) {\n connect(d->service, SIGNAL(destroyed()), SLOT(_q_serviceDestroyed()));\n connect(d->windowControl, SIGNAL(nativeSizeChanged()), SLOT(_q_updateNativeSize()));\n d->windowControl->setAspectRatioMode(Qt::IgnoreAspectRatio);\n \/\/d->windowControl->setProperty(\"colorKey\", QVariant(QColor(16,7,2)));\n d->windowControl->setProperty(\"autopaintColorKey\", QVariant(false));\n\n d->updateRects();\n return true;\n } else {\n qWarning() << \"Service doesn't support QVideoWindowControl, overlay item failed\";\n }\n }\n }\n\n d->mediaObject = 0;\n return false;\n}\n\nQt::AspectRatioMode QGraphicsVideoItem::aspectRatioMode() const\n{\n return d_func()->aspectRatioMode;\n}\n\nvoid QGraphicsVideoItem::setAspectRatioMode(Qt::AspectRatioMode mode)\n{\n Q_D(QGraphicsVideoItem);\n\n d->aspectRatioMode = mode;\n d->updateRects();\n}\n\nQPointF QGraphicsVideoItem::offset() const\n{\n return d_func()->rect.topLeft();\n}\n\nvoid QGraphicsVideoItem::setOffset(const QPointF &offset)\n{\n Q_D(QGraphicsVideoItem);\n\n d->rect.moveTo(offset);\n d->updateRects();\n}\n\nQSizeF QGraphicsVideoItem::size() const\n{\n return d_func()->rect.size();\n}\n\nvoid QGraphicsVideoItem::setSize(const QSizeF &size)\n{\n Q_D(QGraphicsVideoItem);\n\n d->rect.setSize(size.isValid() ? size : QSizeF(0, 0));\n d->updateRects();\n}\n\nQSizeF QGraphicsVideoItem::nativeSize() const\n{\n return d_func()->nativeSize;\n}\n\nQRectF QGraphicsVideoItem::boundingRect() const\n{\n return d_func()->boundingRect;\n}\n\nvoid QGraphicsVideoItem::paint(\n QPainter *painter, const QStyleOptionGraphicsItem *option, QWidget *widget)\n{\n#ifdef DEBUG_GFX_VIDEO_ITEM\n qDebug() << \"QGraphicsVideoItem::paint\";\n#endif\n\n Q_UNUSED(option);\n Q_D(QGraphicsVideoItem);\n\n QGraphicsView *view = 0;\n if (scene() && !scene()->views().isEmpty())\n view = scene()->views().first();\n\n \/\/it's necessary to switch vieport update mode to FullViewportUpdate\n \/\/otherwise the video item area can be just scrolled without notifying overlay\n \/\/about geometry changes\n if (view != d->currentView) {\n if (d->currentView) {\n d->currentView->setViewportUpdateMode(d->savedViewportUpdateMode);\n }\n\n d->currentView = view;\n if (view) {\n d->savedViewportUpdateMode = view->viewportUpdateMode();\n view->setViewportUpdateMode(QGraphicsView::FullViewportUpdate);\n }\n d->updateEventFilters();\n }\n\n QColor colorKey = Qt::black;\n\n if (d->windowControl != 0 && widget != 0) {\n d->setWidget(widget);\n\n QTransform transform = painter->combinedTransform();\n QRect overlayRect = transform.mapRect(d->displayRect).toRect();\n QRect currentSurfaceRect = d->windowControl->displayRect();\n\n if (currentSurfaceRect != overlayRect) { \n#ifdef DEBUG_GFX_VIDEO_ITEM\n qDebug() << \"set video display rect:\" << overlayRect;\n#endif\n d->windowControl->setDisplayRect(overlayRect);\n }\n\n colorKey = d->windowControl->property(\"colorKey\").value<QColor>();\n#ifdef QGRAPHICSVIDEOITEM_ROTATION_SUPPORT\n const qreal angle = transform.map(QLineF(0, 0, 1, 0)).angle();\n d->windowControl->setProperty(\"rotation\", QVariant::fromValue<qreal>(angle));\n#endif\n }\n\n if (colorKey.alpha() != 255)\n painter->setCompositionMode(QPainter::CompositionMode_Source);\n painter->fillRect(d->boundingRect, colorKey);\n}\n\nQVariant QGraphicsVideoItem::itemChange(GraphicsItemChange change, const QVariant &value)\n{\n Q_D(QGraphicsVideoItem);\n\n switch (change) {\n case ItemScenePositionHasChanged:\n update(boundingRect());\n break;\n case ItemVisibleChange:\n \/\/move overlay out of the screen if video item becomes invisible\n if (d->windowControl != 0 && !value.toBool())\n d->windowControl->setDisplayRect(QRect(-1,-1,1,1));\n break;\n default:\n break;\n }\n\n return QGraphicsItem::itemChange(change, value);\n}\n\nvoid QGraphicsVideoItem::timerEvent(QTimerEvent *event)\n{\n QGraphicsObject::timerEvent(event);\n}\n\n#include \"moc_qgraphicsvideoitem.cpp\"\nQT_END_NAMESPACE\n<|endoftext|>"} {"text":"<commit_before>#include <beast\/core\/streambuf.hpp>\n#include <beast\/http\/read.hpp>\n#include <beast\/http\/string_body.hpp>\n#include <beast\/http\/write.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include <silicium\/sink\/file_sink.hpp>\n#include <silicium\/sink\/throwing_sink.hpp>\n#include <ventura\/file_operations.hpp>\n#include <ventura\/read_file.hpp>\n#include <html_generator\/tools\/all.hpp>\n\nnamespace\n{\n\n\tboost::system::error_code\n\tgenerate_all_html(ventura::absolute_path snippets_source_code,\n\t ventura::absolute_path const &existing_output_root,\n\t boost::string_ref const file_name)\n\t{\n\t\tventura::absolute_path const index_path =\n\t\t existing_output_root \/\n\t\t ventura::relative_path(file_name.begin(), file_name.end());\n\t\tSi::error_or<Si::file_handle> const index = ventura::overwrite_file(\n\t\t ventura::safe_c_str(to_os_string(index_path)));\n\t\tif (index.is_error())\n\t\t{\n\t\t\tstd::cerr << \"Could not overwrite file \" << index_path << '\\n';\n\t\t\treturn index.error();\n\t\t}\n\n\t\tSi::file_sink index_sink(index.get().handle);\n\t\tusing namespace Si::html;\n\n\t\tstatic const std::string site_title = \"TyRoXx' blog\";\n\n\t\tauto page_content = dynamic([\n\t\t\t&file_name,\n\t\t\tsnippets_source_code = std::move(snippets_source_code)\n\t\t](code_sink & sink)\n\t\t {\n\t\t\t auto drafts =\n#include \"pages\/how-to-choose-an-integer-type.hpp\"\n\t\t\t ;\n\t\t\t drafts.generate(sink);\n\t\t\t });\n\n\t\tauto head_content = tags::head(\n\t\t tag(\"meta\", attribute(\"charset\", \"utf-8\"), empty) +\n\t\t tag(\"meta\",\n\t\t attribute(\"name\", \"viewport\") +\n\t\t attribute(\"content\", \"width=device-width, initial-scale=1\"),\n\t\t empty) +\n\t\t tags::title(site_title) +\n\t\t tag(\"link\",\n\t\t tags::href(\"stylesheets.css\") + attribute(\"rel\", \"stylesheet\"),\n\t\t empty));\n\t\tauto body_content =\n\t\t tags::body(tags::h1(text(site_title)) + std::move(page_content) +\n#include \"pages\/footer.hpp\"\n\t\t );\n\t\tauto const document =\n\t\t raw(\"<!DOCTYPE html>\") +\n\t\t tags::html(std::move(head_content) + std::move(body_content));\n\t\tauto erased_sink = Si::Sink<char, Si::success>::erase(\n\t\t Si::make_throwing_sink(index_sink));\n\t\ttry\n\t\t{\n\t\t\tdocument.generate(erased_sink);\n\t\t\treturn {};\n\t\t}\n\t\tcatch (boost::system::system_error const &ex)\n\t\t{\n\t\t\t\/\/ TODO: do this without an exception\n\t\t\treturn ex.code();\n\t\t}\n\t}\n\n\tstruct file_client\n\t{\n\t\tboost::asio::ip::tcp::socket socket;\n\t\tbeast::streambuf receive_buffer;\n\t\tbeast::http::response<beast::http::string_body> response;\n\n\t\texplicit file_client(boost::asio::ip::tcp::socket socket,\n\t\t beast::streambuf receive_buffer)\n\t\t : socket(std::move(socket))\n\t\t , receive_buffer(std::move(receive_buffer))\n\t\t{\n\t\t}\n\t};\n\n\tstruct http_client\n\t{\n\t\tboost::asio::ip::tcp::socket socket;\n\t\tbeast::streambuf receive_buffer;\n\t\tbeast::http::request<beast::http::string_body> request;\n\n\t\texplicit http_client(boost::asio::ip::tcp::socket socket,\n\t\t beast::streambuf receive_buffer)\n\t\t : socket(std::move(socket))\n\t\t , receive_buffer(std::move(receive_buffer))\n\t\t{\n\t\t}\n\t};\n\n\tvoid begin_serve(std::shared_ptr<http_client> client,\n\t ventura::absolute_path const &document_root);\n\n\tvoid serve_prepared_response(\n\t std::shared_ptr<file_client> client, bool const is_keep_alive,\n\t ventura::absolute_path const &document_root,\n\t boost::optional<boost::string_ref> const content_type)\n\t{\n\t\tclient->response.version = 11;\n\t\tclient->response.fields.insert(\n\t\t \"Content-Length\",\n\t\t boost::lexical_cast<std::string>(client->response.body.size()));\n\t\tif (content_type)\n\t\t{\n\t\t\tclient->response.fields.insert(\"Content-Type\", *content_type);\n\t\t}\n\t\tbeast::http::async_write(\n\t\t client->socket, client->response,\n\t\t [client, is_keep_alive,\n\t\t document_root](boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t if (is_keep_alive)\n\t\t\t {\n\t\t\t\t auto http_client_again = std::make_shared<http_client>(\n\t\t\t\t std::move(client->socket),\n\t\t\t\t std::move(client->receive_buffer));\n\t\t\t\t begin_serve(http_client_again, document_root);\n\t\t\t }\n\t\t\t else\n\t\t\t {\n\t\t\t\t client->socket.shutdown(\n\t\t\t\t boost::asio::ip::tcp::socket::shutdown_both);\n\t\t\t }\n\t\t\t});\n\t}\n\n\tvoid serve_static_file(std::shared_ptr<file_client> client,\n\t bool const is_keep_alive,\n\t ventura::absolute_path const &document_root,\n\t ventura::absolute_path const &served_document)\n\t{\n\t\tSi::visit<void>(\n\t\t ventura::read_file(\n\t\t ventura::safe_c_str(ventura::to_os_string(served_document))),\n\t\t [&](std::vector<char> content)\n\t\t {\n\t\t\t \/\/ TODO: avoid the copy of the content\n\t\t\t client->response.body.assign(content.begin(), content.end());\n\t\t\t client->response.reason = \"OK\";\n\t\t\t client->response.status = 200;\n\t\t\t},\n\t\t [&](boost::system::error_code const ec)\n\t\t {\n\t\t\t std::cerr << \"Could not read file \" << served_document << \": \"\n\t\t\t << ec << '\\n';\n\t\t\t client->response.reason = \"Internal Server Error\";\n\t\t\t client->response.status = 500;\n\t\t\t client->response.body = client->response.reason;\n\t\t\t},\n\t\t [&](ventura::read_file_problem const problem)\n\t\t {\n\t\t\t std::cerr << \"Could not read file \" << served_document\n\t\t\t << \" due to problem \" << static_cast<int>(problem)\n\t\t\t << '\\n';\n\t\t\t client->response.reason = \"Internal Server Error\";\n\t\t\t client->response.status = 500;\n\t\t\t client->response.body = client->response.reason;\n\t\t\t});\n\t\tserve_prepared_response(client, is_keep_alive, document_root,\n\t\t boost::none);\n\t}\n\n\tvoid begin_serve(std::shared_ptr<http_client> client,\n\t ventura::absolute_path const &document_root)\n\t{\n\t\tbeast::http::async_read(\n\t\t client->socket, client->receive_buffer, client->request,\n\t\t [client, document_root](boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t std::shared_ptr<file_client> const new_client =\n\t\t\t std::make_shared<file_client>(\n\t\t\t std::move(client->socket),\n\t\t\t std::move(client->receive_buffer));\n\t\t\t if (!client->request.url.empty() &&\n\t\t\t (client->request.url.front() == '\/'))\n\t\t\t {\n\t\t\t\t boost::filesystem::path requested_file(\n\t\t\t\t client->request.url.begin() + 1,\n\t\t\t\t client->request.url.end());\n\t\t\t\t if (requested_file.empty())\n\t\t\t\t {\n\t\t\t\t\t requested_file = \"index.html\";\n\t\t\t\t }\n\t\t\t\t if (requested_file.is_relative())\n\t\t\t\t {\n\t\t\t\t\t serve_static_file(\n\t\t\t\t\t new_client,\n\t\t\t\t\t beast::http::is_keep_alive(client->request),\n\t\t\t\t\t document_root,\n\t\t\t\t\t document_root \/ ventura::relative_path(\n\t\t\t\t\t std::move(requested_file)));\n\t\t\t\t\t return;\n\t\t\t\t }\n\t\t\t }\n\t\t\t new_client->response.reason = \"Bad Request\";\n\t\t\t new_client->response.status = 400;\n\t\t\t new_client->response.body = new_client->response.reason;\n\t\t\t serve_prepared_response(\n\t\t\t new_client, beast::http::is_keep_alive(client->request),\n\t\t\t document_root, boost::string_ref(\"text\/html\"));\n\t\t\t});\n\t}\n\n\tvoid begin_accept(boost::asio::ip::tcp::acceptor &acceptor,\n\t ventura::absolute_path const &document_root)\n\t{\n\t\tauto client = std::make_shared<http_client>(\n\t\t boost::asio::ip::tcp::socket(acceptor.get_io_service()),\n\t\t beast::streambuf());\n\t\tacceptor.async_accept(client->socket,\n\t\t [&acceptor, client, document_root](\n\t\t boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t begin_accept(acceptor, document_root);\n\t\t\t begin_serve(client, document_root);\n\t\t\t });\n\t}\n}\n\nint main(int argc, const char **argv)\n{\n\tstd::string output_option;\n\tboost::uint16_t web_server_port = 0;\n\n\tboost::program_options::options_description desc(\"Allowed options\");\n\tdesc.add_options()(\"help\", \"produce help message\")(\n\t \"output\", boost::program_options::value(&output_option),\n\t \"a directory to put the HTML files into\")(\n\t \"serve\", boost::program_options::value(&web_server_port),\n\t \"serve the output directory on this port\");\n\n\tboost::program_options::positional_options_description positional;\n\tpositional.add(\"output\", 1);\n\tboost::program_options::variables_map vm;\n\ttry\n\t{\n\t\tboost::program_options::store(\n\t\t boost::program_options::command_line_parser(argc, argv)\n\t\t .options(desc)\n\t\t .positional(positional)\n\t\t .run(),\n\t\t vm);\n\t}\n\tcatch (boost::program_options::error const &ex)\n\t{\n\t\tstd::cerr << ex.what() << '\\n' << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tboost::program_options::notify(vm);\n\n\tif (vm.count(\"help\"))\n\t{\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tif (output_option.empty())\n\t{\n\t\tstd::cerr << \"Please provide an absolute path to generate to.\\n\";\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tSi::optional<ventura::absolute_path> const output_root =\n\t ventura::absolute_path::create(output_option);\n\tif (!output_root)\n\t{\n\t\tstd::cerr\n\t\t << \"The output directory must be given as an absolute path.\\n\";\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\t{\n\t\tboost::system::error_code const ec =\n\t\t ventura::create_directories(*output_root, Si::return_);\n\t\tif (!!ec)\n\t\t{\n\t\t\tstd::cerr << ec << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tventura::absolute_path repo = *ventura::parent(\n\t *ventura::parent(*ventura::absolute_path::create(__FILE__)));\n\tventura::copy(\n\t repo \/ ventura::relative_path(\"html_generator\/pages\/stylesheet.css\"),\n\t *output_root \/ ventura::relative_path(\"stylesheets.css\"), Si::return_);\n\tstatic const boost::string_ref files_to_generate[] = {\"index.html\"};\n\tfor (boost::string_ref const file : files_to_generate)\n\t{\n\t\tboost::system::error_code const ec = generate_all_html(\n\t\t repo \/ ventura::relative_path(\"snippets\"), *output_root, file);\n\t\tif (!!ec)\n\t\t{\n\t\t\tstd::cerr << ec << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (vm.count(\"serve\"))\n\t{\n\t\ttry\n\t\t{\n\t\t\tusing namespace boost::asio;\n\n\t\t\tio_service io;\n\n\t\t\tip::tcp::acceptor acceptor_v6(\n\t\t\t io, ip::tcp::endpoint(ip::tcp::v6(), web_server_port), true);\n\t\t\tacceptor_v6.listen();\n\t\t\tbegin_accept(acceptor_v6, *output_root);\n\n\t\t\tip::tcp::acceptor acceptor_v4(\n\t\t\t io, ip::tcp::endpoint(ip::tcp::v4(), web_server_port), true);\n\t\t\tacceptor_v4.listen();\n\t\t\tbegin_accept(acceptor_v4, *output_root);\n\n\t\t\twhile (!io.stopped())\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tio.run();\n\t\t\t\t}\n\t\t\t\tcatch (boost::system::system_error const &ex)\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"boost::system::system_error: \" << ex.code()\n\t\t\t\t\t << '\\n';\n\t\t\t\t\tio.reset();\n\t\t\t\t}\n\t\t\t\tcatch (std::exception const &ex)\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"std::exception: \" << ex.what() << '\\n';\n\t\t\t\t\tio.reset();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (boost::system::system_error const &ex)\n\t\t{\n\t\t\tstd::cerr << \"boost::system::system_error: \" << ex.code() << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t\tcatch (std::exception const &ex)\n\t\t{\n\t\t\tstd::cerr << \"std::exception: \" << ex.what() << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n}\n<commit_msg>remove IPv6 for now because my Linux does not let me bind the port<commit_after>#include <beast\/core\/streambuf.hpp>\n#include <beast\/http\/read.hpp>\n#include <beast\/http\/string_body.hpp>\n#include <beast\/http\/write.hpp>\n#include <boost\/asio\/ip\/tcp.hpp>\n#include <boost\/program_options.hpp>\n#include <iostream>\n#include <silicium\/sink\/file_sink.hpp>\n#include <silicium\/sink\/throwing_sink.hpp>\n#include <ventura\/file_operations.hpp>\n#include <ventura\/read_file.hpp>\n#include <html_generator\/tools\/all.hpp>\n\nnamespace\n{\n\n\tboost::system::error_code\n\tgenerate_all_html(ventura::absolute_path snippets_source_code,\n\t ventura::absolute_path const &existing_output_root,\n\t boost::string_ref const file_name)\n\t{\n\t\tventura::absolute_path const index_path =\n\t\t existing_output_root \/\n\t\t ventura::relative_path(file_name.begin(), file_name.end());\n\t\tSi::error_or<Si::file_handle> const index = ventura::overwrite_file(\n\t\t ventura::safe_c_str(to_os_string(index_path)));\n\t\tif (index.is_error())\n\t\t{\n\t\t\tstd::cerr << \"Could not overwrite file \" << index_path << '\\n';\n\t\t\treturn index.error();\n\t\t}\n\n\t\tSi::file_sink index_sink(index.get().handle);\n\t\tusing namespace Si::html;\n\n\t\tstatic const std::string site_title = \"TyRoXx' blog\";\n\n\t\tauto page_content = dynamic([\n\t\t\t&file_name,\n\t\t\tsnippets_source_code = std::move(snippets_source_code)\n\t\t](code_sink & sink)\n\t\t {\n\t\t\t auto drafts =\n#include \"pages\/how-to-choose-an-integer-type.hpp\"\n\t\t\t ;\n\t\t\t drafts.generate(sink);\n\t\t\t });\n\n\t\tauto head_content = tags::head(\n\t\t tag(\"meta\", attribute(\"charset\", \"utf-8\"), empty) +\n\t\t tag(\"meta\",\n\t\t attribute(\"name\", \"viewport\") +\n\t\t attribute(\"content\", \"width=device-width, initial-scale=1\"),\n\t\t empty) +\n\t\t tags::title(site_title) +\n\t\t tag(\"link\",\n\t\t tags::href(\"stylesheets.css\") + attribute(\"rel\", \"stylesheet\"),\n\t\t empty));\n\t\tauto body_content =\n\t\t tags::body(tags::h1(text(site_title)) + std::move(page_content) +\n#include \"pages\/footer.hpp\"\n\t\t );\n\t\tauto const document =\n\t\t raw(\"<!DOCTYPE html>\") +\n\t\t tags::html(std::move(head_content) + std::move(body_content));\n\t\tauto erased_sink = Si::Sink<char, Si::success>::erase(\n\t\t Si::make_throwing_sink(index_sink));\n\t\ttry\n\t\t{\n\t\t\tdocument.generate(erased_sink);\n\t\t\treturn {};\n\t\t}\n\t\tcatch (boost::system::system_error const &ex)\n\t\t{\n\t\t\t\/\/ TODO: do this without an exception\n\t\t\treturn ex.code();\n\t\t}\n\t}\n\n\tstruct file_client\n\t{\n\t\tboost::asio::ip::tcp::socket socket;\n\t\tbeast::streambuf receive_buffer;\n\t\tbeast::http::response<beast::http::string_body> response;\n\n\t\texplicit file_client(boost::asio::ip::tcp::socket socket,\n\t\t beast::streambuf receive_buffer)\n\t\t : socket(std::move(socket))\n\t\t , receive_buffer(std::move(receive_buffer))\n\t\t{\n\t\t}\n\t};\n\n\tstruct http_client\n\t{\n\t\tboost::asio::ip::tcp::socket socket;\n\t\tbeast::streambuf receive_buffer;\n\t\tbeast::http::request<beast::http::string_body> request;\n\n\t\texplicit http_client(boost::asio::ip::tcp::socket socket,\n\t\t beast::streambuf receive_buffer)\n\t\t : socket(std::move(socket))\n\t\t , receive_buffer(std::move(receive_buffer))\n\t\t{\n\t\t}\n\t};\n\n\tvoid begin_serve(std::shared_ptr<http_client> client,\n\t ventura::absolute_path const &document_root);\n\n\tvoid serve_prepared_response(\n\t std::shared_ptr<file_client> client, bool const is_keep_alive,\n\t ventura::absolute_path const &document_root,\n\t boost::optional<boost::string_ref> const content_type)\n\t{\n\t\tclient->response.version = 11;\n\t\tclient->response.fields.insert(\n\t\t \"Content-Length\",\n\t\t boost::lexical_cast<std::string>(client->response.body.size()));\n\t\tif (content_type)\n\t\t{\n\t\t\tclient->response.fields.insert(\"Content-Type\", *content_type);\n\t\t}\n\t\tbeast::http::async_write(\n\t\t client->socket, client->response,\n\t\t [client, is_keep_alive,\n\t\t document_root](boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t if (is_keep_alive)\n\t\t\t {\n\t\t\t\t auto http_client_again = std::make_shared<http_client>(\n\t\t\t\t std::move(client->socket),\n\t\t\t\t std::move(client->receive_buffer));\n\t\t\t\t begin_serve(http_client_again, document_root);\n\t\t\t }\n\t\t\t else\n\t\t\t {\n\t\t\t\t client->socket.shutdown(\n\t\t\t\t boost::asio::ip::tcp::socket::shutdown_both);\n\t\t\t }\n\t\t\t});\n\t}\n\n\tvoid serve_static_file(std::shared_ptr<file_client> client,\n\t bool const is_keep_alive,\n\t ventura::absolute_path const &document_root,\n\t ventura::absolute_path const &served_document)\n\t{\n\t\tSi::visit<void>(\n\t\t ventura::read_file(\n\t\t ventura::safe_c_str(ventura::to_os_string(served_document))),\n\t\t [&](std::vector<char> content)\n\t\t {\n\t\t\t \/\/ TODO: avoid the copy of the content\n\t\t\t client->response.body.assign(content.begin(), content.end());\n\t\t\t client->response.reason = \"OK\";\n\t\t\t client->response.status = 200;\n\t\t\t},\n\t\t [&](boost::system::error_code const ec)\n\t\t {\n\t\t\t std::cerr << \"Could not read file \" << served_document << \": \"\n\t\t\t << ec << '\\n';\n\t\t\t client->response.reason = \"Internal Server Error\";\n\t\t\t client->response.status = 500;\n\t\t\t client->response.body = client->response.reason;\n\t\t\t},\n\t\t [&](ventura::read_file_problem const problem)\n\t\t {\n\t\t\t std::cerr << \"Could not read file \" << served_document\n\t\t\t << \" due to problem \" << static_cast<int>(problem)\n\t\t\t << '\\n';\n\t\t\t client->response.reason = \"Internal Server Error\";\n\t\t\t client->response.status = 500;\n\t\t\t client->response.body = client->response.reason;\n\t\t\t});\n\t\tserve_prepared_response(client, is_keep_alive, document_root,\n\t\t boost::none);\n\t}\n\n\tvoid begin_serve(std::shared_ptr<http_client> client,\n\t ventura::absolute_path const &document_root)\n\t{\n\t\tbeast::http::async_read(\n\t\t client->socket, client->receive_buffer, client->request,\n\t\t [client, document_root](boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t std::shared_ptr<file_client> const new_client =\n\t\t\t std::make_shared<file_client>(\n\t\t\t std::move(client->socket),\n\t\t\t std::move(client->receive_buffer));\n\t\t\t if (!client->request.url.empty() &&\n\t\t\t (client->request.url.front() == '\/'))\n\t\t\t {\n\t\t\t\t boost::filesystem::path requested_file(\n\t\t\t\t client->request.url.begin() + 1,\n\t\t\t\t client->request.url.end());\n\t\t\t\t if (requested_file.empty())\n\t\t\t\t {\n\t\t\t\t\t requested_file = \"index.html\";\n\t\t\t\t }\n\t\t\t\t if (requested_file.is_relative())\n\t\t\t\t {\n\t\t\t\t\t serve_static_file(\n\t\t\t\t\t new_client,\n\t\t\t\t\t beast::http::is_keep_alive(client->request),\n\t\t\t\t\t document_root,\n\t\t\t\t\t document_root \/ ventura::relative_path(\n\t\t\t\t\t std::move(requested_file)));\n\t\t\t\t\t return;\n\t\t\t\t }\n\t\t\t }\n\t\t\t new_client->response.reason = \"Bad Request\";\n\t\t\t new_client->response.status = 400;\n\t\t\t new_client->response.body = new_client->response.reason;\n\t\t\t serve_prepared_response(\n\t\t\t new_client, beast::http::is_keep_alive(client->request),\n\t\t\t document_root, boost::string_ref(\"text\/html\"));\n\t\t\t});\n\t}\n\n\tvoid begin_accept(boost::asio::ip::tcp::acceptor &acceptor,\n\t ventura::absolute_path const &document_root)\n\t{\n\t\tauto client = std::make_shared<http_client>(\n\t\t boost::asio::ip::tcp::socket(acceptor.get_io_service()),\n\t\t beast::streambuf());\n\t\tacceptor.async_accept(client->socket,\n\t\t [&acceptor, client, document_root](\n\t\t boost::system::error_code const ec)\n\t\t {\n\t\t\t Si::throw_if_error(ec);\n\t\t\t begin_accept(acceptor, document_root);\n\t\t\t begin_serve(client, document_root);\n\t\t\t });\n\t}\n}\n\nint main(int argc, const char **argv)\n{\n\tstd::string output_option;\n\tboost::uint16_t web_server_port = 0;\n\n\tboost::program_options::options_description desc(\"Allowed options\");\n\tdesc.add_options()(\"help\", \"produce help message\")(\n\t \"output\", boost::program_options::value(&output_option),\n\t \"a directory to put the HTML files into\")(\n\t \"serve\", boost::program_options::value(&web_server_port),\n\t \"serve the output directory on this port\");\n\n\tboost::program_options::positional_options_description positional;\n\tpositional.add(\"output\", 1);\n\tboost::program_options::variables_map vm;\n\ttry\n\t{\n\t\tboost::program_options::store(\n\t\t boost::program_options::command_line_parser(argc, argv)\n\t\t .options(desc)\n\t\t .positional(positional)\n\t\t .run(),\n\t\t vm);\n\t}\n\tcatch (boost::program_options::error const &ex)\n\t{\n\t\tstd::cerr << ex.what() << '\\n' << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tboost::program_options::notify(vm);\n\n\tif (vm.count(\"help\"))\n\t{\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tif (output_option.empty())\n\t{\n\t\tstd::cerr << \"Please provide an absolute path to generate to.\\n\";\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\tSi::optional<ventura::absolute_path> const output_root =\n\t ventura::absolute_path::create(output_option);\n\tif (!output_root)\n\t{\n\t\tstd::cerr\n\t\t << \"The output directory must be given as an absolute path.\\n\";\n\t\tstd::cerr << desc << \"\\n\";\n\t\treturn 1;\n\t}\n\n\t{\n\t\tboost::system::error_code const ec =\n\t\t ventura::create_directories(*output_root, Si::return_);\n\t\tif (!!ec)\n\t\t{\n\t\t\tstd::cerr << ec << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tventura::absolute_path repo = *ventura::parent(\n\t *ventura::parent(*ventura::absolute_path::create(__FILE__)));\n\tventura::copy(\n\t repo \/ ventura::relative_path(\"html_generator\/pages\/stylesheet.css\"),\n\t *output_root \/ ventura::relative_path(\"stylesheets.css\"), Si::return_);\n\tstatic const boost::string_ref files_to_generate[] = {\"index.html\"};\n\tfor (boost::string_ref const file : files_to_generate)\n\t{\n\t\tboost::system::error_code const ec = generate_all_html(\n\t\t repo \/ ventura::relative_path(\"snippets\"), *output_root, file);\n\t\tif (!!ec)\n\t\t{\n\t\t\tstd::cerr << ec << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (vm.count(\"serve\"))\n\t{\n\t\ttry\n\t\t{\n\t\t\tusing namespace boost::asio;\n\n\t\t\tio_service io;\n\n\t\t\tip::tcp::acceptor acceptor_v4(\n\t\t\t io, ip::tcp::endpoint(ip::tcp::v4(), web_server_port), true);\n\t\t\tacceptor_v4.listen();\n\t\t\tbegin_accept(acceptor_v4, *output_root);\n\n\t\t\twhile (!io.stopped())\n\t\t\t{\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tio.run();\n\t\t\t\t}\n\t\t\t\tcatch (boost::system::system_error const &ex)\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"boost::system::system_error: \" << ex.code()\n\t\t\t\t\t << '\\n';\n\t\t\t\t\tio.reset();\n\t\t\t\t}\n\t\t\t\tcatch (std::exception const &ex)\n\t\t\t\t{\n\t\t\t\t\tstd::cerr << \"std::exception: \" << ex.what() << '\\n';\n\t\t\t\t\tio.reset();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcatch (boost::system::system_error const &ex)\n\t\t{\n\t\t\tstd::cerr << \"boost::system::system_error: \" << ex.code() << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t\tcatch (std::exception const &ex)\n\t\t{\n\t\t\tstd::cerr << \"std::exception: \" << ex.what() << '\\n';\n\t\t\treturn 1;\n\t\t}\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Devices\/LabJack\/linux\/LabJackChecksums.h\"\n\nnamespace SurgSim\n{\nnamespace Device\n{\nnamespace LabJackChecksums\n{\n\nunsigned char normalChecksum8(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes, int count)\n{\n\tuint16_t accumulator = 0;\n\n\t\/\/Sums bytes 1 to n-1 unsigned to a 2 byte value. Sums quotient and\n\t\/\/remainder of 256 division. Again, sums quotient and remainder of\n\t\/\/256 division.\n\tfor (int i = 1; i < count; ++i)\n\t{\n\t\taccumulator += static_cast<uint16_t>(bytes.at(i));\n\t}\n\n\tuint16_t quotient = accumulator \/ 256;\n\taccumulator = (accumulator - 256 * quotient) + quotient;\n\tquotient = accumulator \/ 256;\n\n\treturn static_cast<unsigned char>((accumulator - 256 * quotient) + quotient);\n}\n\nuint16_t extendedChecksum16(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes, int count)\n{\n\tint accumulator = 0;\n\n\t\/\/Sums bytes 6 to n-1 to an unsigned 2 byte value\n\tfor (int i = 6; i < count; ++i)\n\t{\n\t\taccumulator += static_cast<uint16_t>(bytes.at(i));\n\t}\n\n\treturn accumulator;\n}\n\nunsigned char extendedChecksum8(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes)\n{\n\treturn normalChecksum8(bytes, 6);\n}\n\nvoid normalChecksum(std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>* bytes, int count)\n{\n\t(*bytes)[0] = normalChecksum8(*bytes, count);\n}\n\nvoid extendedChecksum(std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>* bytes, int count)\n{\n\tuint16_t accumulator = extendedChecksum16(*bytes, count);\n\t(*bytes)[4] = static_cast<unsigned char>(accumulator & 0xff);\n\t(*bytes)[5] = static_cast<unsigned char>((accumulator \/ 256) & 0xff);\n\t(*bytes)[0] = extendedChecksum8(*bytes);\n}\n\n}; \/\/ namespace LabJackChecksums\n}; \/\/ namespace Device\n}; \/\/ namespace SurgSim<commit_msg>Fix variable type in LabJackChecksums.<commit_after>\/\/ This file is a part of the OpenSurgSim project.\n\/\/ Copyright 2013, SimQuest Solutions Inc.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"SurgSim\/Devices\/LabJack\/linux\/LabJackChecksums.h\"\n\nnamespace SurgSim\n{\nnamespace Device\n{\nnamespace LabJackChecksums\n{\n\nunsigned char normalChecksum8(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes, int count)\n{\n\tuint16_t accumulator = 0;\n\n\t\/\/Sums bytes 1 to n-1 unsigned to a 2 byte value. Sums quotient and\n\t\/\/remainder of 256 division. Again, sums quotient and remainder of\n\t\/\/256 division.\n\tfor (int i = 1; i < count; ++i)\n\t{\n\t\taccumulator += static_cast<uint16_t>(bytes.at(i));\n\t}\n\n\tuint16_t quotient = accumulator \/ 256;\n\taccumulator = (accumulator - 256 * quotient) + quotient;\n\tquotient = accumulator \/ 256;\n\n\treturn static_cast<unsigned char>((accumulator - 256 * quotient) + quotient);\n}\n\nuint16_t extendedChecksum16(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes, int count)\n{\n\tuint16_t accumulator = 0;\n\n\t\/\/Sums bytes 6 to n-1 to an unsigned 2 byte value\n\tfor (int i = 6; i < count; ++i)\n\t{\n\t\taccumulator += static_cast<uint16_t>(bytes.at(i));\n\t}\n\n\treturn accumulator;\n}\n\nunsigned char extendedChecksum8(const std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>& bytes)\n{\n\treturn normalChecksum8(bytes, 6);\n}\n\nvoid normalChecksum(std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>* bytes, int count)\n{\n\t(*bytes)[0] = normalChecksum8(*bytes, count);\n}\n\nvoid extendedChecksum(std::array<unsigned char, LABJACK_MAXIMUM_BUFFER>* bytes, int count)\n{\n\tuint16_t accumulator = extendedChecksum16(*bytes, count);\n\t(*bytes)[4] = static_cast<unsigned char>(accumulator & 0xff);\n\t(*bytes)[5] = static_cast<unsigned char>((accumulator \/ 256) & 0xff);\n\t(*bytes)[0] = extendedChecksum8(*bytes);\n}\n\n}; \/\/ namespace LabJackChecksums\n}; \/\/ namespace Device\n}; \/\/ namespace SurgSim<|endoftext|>"} {"text":"<commit_before>#ifndef CONNECTOR_CPP\n#define CONNECTOR_CPP\n\n#include \"Command.h\"\n#include \"Connector.h\"\n\nusing namespace std;\n#include <iostream>\n#include <vector>\n#include <list>\n\n\/\/ VectorContainer(Sort* function):Container(function){};\n\n\nclass andConnector: public Connector\n{\n private:\n \n public:\n\n andConnector(bool l, string s) : Connector(l,s)\n {\n \/\/ left = l;\n \/\/ right = s;\n self = false;\n if(l)\n {\n Command input(s);\n input.launch();\n self = (l && input.isValid() );\n }\n\n \/\/input.getValidity()\n \n };\n \n bool getValidity()\n {\n return self;\n }\n};\n\n\nclass orConnector: public Connector\n{\n private:\n \n public:\n\n orConnector(bool l, string s) : Connector(l,s)\n {\n \/\/ left = l;\n \/\/ right = s;\n self = l;\n if(!l)\n {\n Command input(s);\n input.launch();\n self = (l || input.isValid() );\n }\n \/\/input.getValidity()\n \n };\n \n bool getValidity()\n {\n return self;\n }\n};\n\n\n\n\n\n\n\n\n\n\n#endif <commit_msg>Delete Connector.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>\n\/\/ Copyright (c) 2015 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#pragma once\n\n#include \"reconstructed_regions.hpp\"\n#include \"LocalizationResult.hpp\"\n\n#include <openMVG\/features\/image_describer.hpp>\n#include <openMVG\/sfm\/sfm_data.hpp>\n#include <openMVG\/sfm\/pipelines\/localization\/SfM_Localizer.hpp>\n#include <openMVG\/stl\/stlMap.hpp>\n#include <openMVG\/voctree\/vocabulary_tree.hpp>\n#include <openMVG\/voctree\/database.hpp>\n#include <openMVG\/matching\/matcher_kdtree_flann.hpp>\n#include <openMVG\/matching\/regions_matcher.hpp>\n#include <flann\/algorithms\/dist.h>\n\n\nnamespace openMVG {\nnamespace localization {\n\n\/\/@fixme find a better place or maje the class template?\ntypedef openMVG::features::Descriptor<float, 128> DescriptorFloat;\ntypedef Reconstructed_Regions<features::SIOPointFeature, float, 128> Reconstructed_RegionsT;\n\nclass VoctreeLocalizer\n{\n\npublic:\n enum Algorithm : int { FirstBest=0, BestResult=1, AllResults=2, Cluster=3};\n static Algorithm initFromString(const std::string &value);\n \npublic:\n struct Parameters \n {\n\n Parameters() :\n _useGuidedMatching(false),\n _refineIntrinsics(false),\n _algorithm(Algorithm::FirstBest),\n _numResults(4),\n _maxResults(10),\n _numCommonViews(3),\n _fDistRatio(0.6),\n _featurePreset(features::EDESCRIBER_PRESET::ULTRA_PRESET),\n _errorMax(std::numeric_limits<double>::max()) { }\n \n bool _useGuidedMatching; \/\/< Enable\/disable guided matching when matching images\n bool _refineIntrinsics; \/\/< whether or not the Intrinsics of the query camera has to be refined\n Algorithm _algorithm; \/\/< algorithm to use for localization\n size_t _numResults; \/\/< number of best matching images to retrieve from the database\n size_t _maxResults; \n size_t _numCommonViews; \/\/< number minimum common images in which a point must be seen to be used in cluster tracking\n float _fDistRatio; \/\/< the ratio distance to use when matching feature with the ratio test\n features::EDESCRIBER_PRESET _featurePreset; \/\/< the preset to use for feature extraction of the query image\n double _errorMax; \n };\n \npublic:\n#ifdef HAVE_CCTAG\n VoctreeLocalizer(bool useSIFT_CCTAG = false);\n#else\n VoctreeLocalizer();\n#endif\n \n bool init(const std::string &sfmFilePath,\n const std::string &descriptorsFolder,\n const std::string &vocTreeFilepath,\n const std::string &weightsFilepath);\n \n \/\/ loadSfmData(const std::string & sfmDataPath)\n\n \/**\n * @brief Load all the Descriptors who have contributed to the reconstruction.\n *\/\n bool loadReconstructionDescriptors(\n const sfm::SfM_Data & sfm_data,\n const std::string & feat_directory);\n \n \/**\n * @brief Just a wrapper around the different localization algorithm, the algorith\n * used to localized is chosen using \\p param._algorithm\n * \n * @param[in] imageGray The input greyscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localize(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n\n \/**\n * @brief Try to localize an image in the database: it queries the database to \n * retrieve \\p numResults matching images and it tries to localize the query image\n * wrt the retrieve images in order of their score taking the first best result.\n *\n * @param[in] imageGray The input greayscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @param[out] associationIDs the ids of the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localizeFirstBestResult(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n\n \/**\n * @brief Try to localize an image in the database: it queries the database to \n * retrieve \\p numResults matching images and it tries to localize the query image\n * wrt the retrieve images in order of their score, collecting all the 2d-3d correspondences\n * and performing the resection with all these correspondences\n *\n * @param[in] imageGray The input greyscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @param[out] associationIDs the ids of the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localizeAllResults(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n \n const sfm::SfM_Data& getSfMData() const {return _sfm_data; }\n \npublic:\n static bool refineSequence(cameras::Pinhole_Intrinsic_Radial_K3 *intrinsics,\n std::vector<geometry::Pose3> & poses,\n std::vector<sfm::Image_Localizer_Match_Data> & associations,\n std::vector<std::vector<pair<IndexT, IndexT> > > &associationIDs);\n\nprivate:\n \/**\n * @brief Load the vocabulary tree.\n *\/\n bool initDatabase(const std::string & vocTreeFilepath,\n const std::string & weightsFilepath,\n const std::string & feat_directory);\n\n typedef flann::L2<float> MetricT;\n typedef matching::ArrayMatcher_Kdtree_Flann<float, MetricT> MatcherT;\n bool robustMatching(matching::RegionsMatcherT<MatcherT> & matcher, \n const cameras::IntrinsicBase * queryIntrinsics,\/\/ the intrinsics of the image we are using as reference\n const Reconstructed_RegionsT & regionsToMatch,\n const cameras::IntrinsicBase * matchedIntrinsics,\n const float fDistRatio,\n const bool b_guided_matching,\n const std::pair<size_t,size_t> & imageSizeI, \/\/ size of the first image \n const std::pair<size_t,size_t> & imageSizeJ, \/\/ size of the first image\n std::vector<matching::IndMatch> & vec_featureMatches) const;\n \npublic:\n \n \/\/ for each view index, it contains the features and descriptors that have an\n \/\/ associated 3D point\n Hash_Map<IndexT, Reconstructed_RegionsT > _regions_per_view;\n \n \/\/ contains the 3D reconstruction data\n sfm::SfM_Data _sfm_data;\n \n \/\/ the feature extractor\n \/\/ @fixme do we want a generic image describer?\n\/\/ features::SIFT_float_describer _image_describer;\n features::Image_describer* _image_describer;\n \n \/\/ the vocabulary tree used to generate the database and the visual images for\n \/\/ the query images\n voctree::VocabularyTree<DescriptorFloat> _voctree;\n \n \/\/ the database that stores the visual word representation of each image of\n \/\/ the original dataset\n voctree::Database _database;\n \n};\n\n\/**\n * @brief Print the name of the algorithm\n *\/\nstd::ostream& operator<<(std::ostream& os, VoctreeLocalizer::Algorithm a);\n\n\/**\n * @brief Get the type of algorithm from an integer\n *\/\nstd::istream& operator>>(std::istream &in, VoctreeLocalizer::Algorithm &a);\n\n\n} \/\/ localization\n} \/\/ openMVG\n<commit_msg>[localization] removed unused methods<commit_after>\n\/\/ Copyright (c) 2015 Pierre MOULON.\n\n\/\/ This Source Code Form is subject to the terms of the Mozilla Public\n\/\/ License, v. 2.0. If a copy of the MPL was not distributed with this\n\/\/ file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#pragma once\n\n#include \"reconstructed_regions.hpp\"\n#include \"LocalizationResult.hpp\"\n\n#include <openMVG\/features\/image_describer.hpp>\n#include <openMVG\/sfm\/sfm_data.hpp>\n#include <openMVG\/sfm\/pipelines\/localization\/SfM_Localizer.hpp>\n#include <openMVG\/stl\/stlMap.hpp>\n#include <openMVG\/voctree\/vocabulary_tree.hpp>\n#include <openMVG\/voctree\/database.hpp>\n#include <openMVG\/matching\/matcher_kdtree_flann.hpp>\n#include <openMVG\/matching\/regions_matcher.hpp>\n#include <flann\/algorithms\/dist.h>\n\n\nnamespace openMVG {\nnamespace localization {\n\n\/\/@fixme find a better place or maje the class template?\ntypedef openMVG::features::Descriptor<float, 128> DescriptorFloat;\ntypedef Reconstructed_Regions<features::SIOPointFeature, float, 128> Reconstructed_RegionsT;\n\nclass VoctreeLocalizer\n{\n\npublic:\n enum Algorithm : int { FirstBest=0, BestResult=1, AllResults=2, Cluster=3};\n static Algorithm initFromString(const std::string &value);\n \npublic:\n struct Parameters \n {\n\n Parameters() :\n _useGuidedMatching(false),\n _refineIntrinsics(false),\n _algorithm(Algorithm::FirstBest),\n _numResults(4),\n _maxResults(10),\n _numCommonViews(3),\n _fDistRatio(0.6),\n _featurePreset(features::EDESCRIBER_PRESET::ULTRA_PRESET),\n _errorMax(std::numeric_limits<double>::max()) { }\n \n bool _useGuidedMatching; \/\/< Enable\/disable guided matching when matching images\n bool _refineIntrinsics; \/\/< whether or not the Intrinsics of the query camera has to be refined\n Algorithm _algorithm; \/\/< algorithm to use for localization\n size_t _numResults; \/\/< number of best matching images to retrieve from the database\n size_t _maxResults; \n size_t _numCommonViews; \/\/< number minimum common images in which a point must be seen to be used in cluster tracking\n float _fDistRatio; \/\/< the ratio distance to use when matching feature with the ratio test\n features::EDESCRIBER_PRESET _featurePreset; \/\/< the preset to use for feature extraction of the query image\n double _errorMax; \n };\n \npublic:\n#ifdef HAVE_CCTAG\n VoctreeLocalizer(bool useSIFT_CCTAG = false);\n#else\n VoctreeLocalizer();\n#endif\n \n bool init(const std::string &sfmFilePath,\n const std::string &descriptorsFolder,\n const std::string &vocTreeFilepath,\n const std::string &weightsFilepath);\n \n \/**\n * @brief Load all the Descriptors who have contributed to the reconstruction.\n *\/\n bool loadReconstructionDescriptors(\n const sfm::SfM_Data & sfm_data,\n const std::string & feat_directory);\n \n \/**\n * @brief Just a wrapper around the different localization algorithm, the algorith\n * used to localized is chosen using \\p param._algorithm\n * \n * @param[in] imageGray The input greyscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localize(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n\n \/**\n * @brief Try to localize an image in the database: it queries the database to \n * retrieve \\p numResults matching images and it tries to localize the query image\n * wrt the retrieve images in order of their score taking the first best result.\n *\n * @param[in] imageGray The input greayscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @param[out] associationIDs the ids of the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localizeFirstBestResult(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n\n \/**\n * @brief Try to localize an image in the database: it queries the database to \n * retrieve \\p numResults matching images and it tries to localize the query image\n * wrt the retrieve images in order of their score, collecting all the 2d-3d correspondences\n * and performing the resection with all these correspondences\n *\n * @param[in] imageGray The input greyscale image\n * @param[in] param The parameters for the localization\n * @param[in] useInputIntrinsics Uses the \\p queryIntrinsics as known calibration\n * @param[in,out] queryIntrinsics Intrinsic parameters of the camera, they are used if the\n * flag useInputIntrinsics is set to true, otherwise they are estimated from the correspondences.\n * @param[out] pose The camera pose\n * @param[out] resection_data the 2D-3D correspondences used to compute the pose\n * @param[out] associationIDs the ids of the 2D-3D correspondences used to compute the pose\n * @return true if the localization is successful\n *\/\n bool localizeAllResults(const image::Image<unsigned char> & imageGrey,\n const Parameters ¶m,\n bool useInputIntrinsics,\n cameras::Pinhole_Intrinsic_Radial_K3 &queryIntrinsics,\n LocalizationResult &localizationResult);\n \n const sfm::SfM_Data& getSfMData() const {return _sfm_data; }\n \nprivate:\n \/**\n * @brief Load the vocabulary tree.\n *\/\n bool initDatabase(const std::string & vocTreeFilepath,\n const std::string & weightsFilepath,\n const std::string & feat_directory);\n\n typedef flann::L2<float> MetricT;\n typedef matching::ArrayMatcher_Kdtree_Flann<float, MetricT> MatcherT;\n bool robustMatching(matching::RegionsMatcherT<MatcherT> & matcher, \n const cameras::IntrinsicBase * queryIntrinsics,\/\/ the intrinsics of the image we are using as reference\n const Reconstructed_RegionsT & regionsToMatch,\n const cameras::IntrinsicBase * matchedIntrinsics,\n const float fDistRatio,\n const bool b_guided_matching,\n const std::pair<size_t,size_t> & imageSizeI, \/\/ size of the first image \n const std::pair<size_t,size_t> & imageSizeJ, \/\/ size of the first image\n std::vector<matching::IndMatch> & vec_featureMatches) const;\n \npublic:\n \n \/\/ for each view index, it contains the features and descriptors that have an\n \/\/ associated 3D point\n Hash_Map<IndexT, Reconstructed_RegionsT > _regions_per_view;\n \n \/\/ contains the 3D reconstruction data\n sfm::SfM_Data _sfm_data;\n \n \/\/ the feature extractor\n \/\/ @fixme do we want a generic image describer?\n\/\/ features::SIFT_float_describer _image_describer;\n features::Image_describer* _image_describer;\n \n \/\/ the vocabulary tree used to generate the database and the visual images for\n \/\/ the query images\n voctree::VocabularyTree<DescriptorFloat> _voctree;\n \n \/\/ the database that stores the visual word representation of each image of\n \/\/ the original dataset\n voctree::Database _database;\n \n};\n\n\/**\n * @brief Print the name of the algorithm\n *\/\nstd::ostream& operator<<(std::ostream& os, VoctreeLocalizer::Algorithm a);\n\n\/**\n * @brief Get the type of algorithm from an integer\n *\/\nstd::istream& operator>>(std::istream &in, VoctreeLocalizer::Algorithm &a);\n\n\n} \/\/ localization\n} \/\/ openMVG\n<|endoftext|>"} {"text":"<commit_before>#ifndef ANIMATION_AUDIO_H_\n#define ANIMATION_AUDIO_H_\n\n#include \"..\/..\/lib\/Animation.hpp\"\n#include \"..\/..\/conf\/globals.h\"\n#include \"..\/..\/dev\/MSGEQ7.hpp\"\n#include \"..\/..\/util\/led.c\"\n#include \"..\/..\/util\/ledmath.c\"\n\nclass Animation_Advanced : public Animation {\nprotected:\n Animation_Advanced() {}\n ~Animation_Advanced() {}\n\n void init();\n};\n\nclass Animation_Advanced_Audio : public Animation_Advanced {\nprotected:\n Animation_Advanced_Audio() {}\n ~Animation_Advanced_Audio() {}\n\n void init();\n};\n\nclass Animation_Advanced_Audio_BeatPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BeatPulseWindow() {}\n ~Animation_Advanced_Audio_BeatPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\n\tvoid clean();\nprivate:\n\tMSGEQ7* left_eq;\n};\n\nclass Animation_Advanced_Audio_BassPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BassPulseWindow() {}\n ~Animation_Advanced_Audio_BassPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\nprivate:\n\tMSGEQ7* left_eq;\n};\n\nclass Animation_Advanced_Audio_BassMidPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BassMidPulseWindow() {}\n ~Animation_Advanced_Audio_BassMidPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\nprivate:\n\tMSGEQ7* left_eq;\n};\n\nclass Animation_Advanced_Audio_EqualizerWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_EqualizerWindow() {}\n ~Animation_Advanced_Audio_EqualizerWindow() {}\n\n\tvoid init();\n\tvoid step();\nprivate:\n\tMSGEQ7* left_eq;\n};\n\nclass Animation_Advanced_Audio_MaxEqualizerWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_MaxEqualizerWindow() {}\n ~Animation_Advanced_Audio_MaxEqualizerWindow() {}\n\n\tvoid init();\n\tvoid step();\n\tvoid clean();\nprivate:\n\tMSGEQ7* left_eq;\n};\n\n#endif\n<commit_msg>put shared things in Animation_Advanced_Audio class<commit_after>#ifndef ANIMATION_AUDIO_H_\n#define ANIMATION_AUDIO_H_\n\n#include \"..\/..\/lib\/Animation.hpp\"\n#include \"..\/..\/conf\/globals.h\"\n#include \"..\/..\/dev\/MSGEQ7.hpp\"\n#include \"..\/..\/util\/led.c\"\n#include \"..\/..\/util\/ledmath.c\"\n\nclass Animation_Advanced : public Animation {\nprotected:\n Animation_Advanced() {}\n ~Animation_Advanced() {}\n\n void init();\n};\n\nclass Animation_Advanced_Audio : public Animation_Advanced {\nprotected:\n Animation_Advanced_Audio() {}\n ~Animation_Advanced_Audio() {}\n\n void init();\n\t\n\tMSGEQ7* left_eq;\n\tMSGEQ7* right_eq;\n};\n\nclass Animation_Advanced_Audio_BeatPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BeatPulseWindow() {}\n ~Animation_Advanced_Audio_BeatPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\n\tvoid clean();\n};\n\nclass Animation_Advanced_Audio_BassPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BassPulseWindow() {}\n ~Animation_Advanced_Audio_BassPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\n};\n\nclass Animation_Advanced_Audio_BassMidPulseWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_BassMidPulseWindow() {}\n ~Animation_Advanced_Audio_BassMidPulseWindow() {}\n\n\tvoid init();\n\tvoid step();\n};\n\nclass Animation_Advanced_Audio_EqualizerWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_EqualizerWindow() {}\n ~Animation_Advanced_Audio_EqualizerWindow() {}\n\n\tvoid init();\n\tvoid step();\n};\n\nclass Animation_Advanced_Audio_MaxEqualizerWindow : public Animation_Advanced_Audio {\npublic:\n Animation_Advanced_Audio_MaxEqualizerWindow() {}\n ~Animation_Advanced_Audio_MaxEqualizerWindow() {}\n\n\tvoid init();\n\tvoid step();\n\tvoid clean();\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\n\/\/ (c) COPYRIGHT URI\/MIT 1997-1999\n\/\/ Please read the full copyright statement in the file COPYRIGHT.\n\/\/\n\/\/ Authors:\n\/\/ jhrg,jimg James Gallagher (jgallagher@gso.uri.edu)\n\n\/\/ Implementation of the DODSFilter class. This class is used to build dods\n\/\/ filter programs which, along with a CGI program, comprise DODS servers.\n\/\/ jhrg 8\/26\/97\n\n\/\/ $Log: DODSFilter.cc,v $\n\/\/ Revision 1.11 1999\/05\/19 23:56:57 jimg\n\/\/ Changed the support address from @dods to @unidata\n\/\/\n\/\/ Revision 1.10 1999\/05\/05 00:36:36 jimg\n\/\/ Added the -V option. -v now is used to pass the version information from the\n\/\/ CGI to the C++ software; -V triggers output of the version message. This\n\/\/ allows the DODSFilter class to pass information about the server's version to\n\/\/ the core software.\n\/\/ All set_mime_*() functions are now passes the CGI version information so that\n\/\/ all MIME headers contain information about the server's version.\n\/\/ Added the get_cgi_version() member function so that clients of DODSFilter can\n\/\/ find out the version number.\n\/\/\n\/\/ Revision 1.9 1999\/05\/04 19:47:21 jimg\n\/\/ Fixed copyright statements. Removed more of the GNU classes.\n\/\/\n\/\/ Revision 1.8 1999\/04\/29 02:29:28 jimg\n\/\/ Merge of no-gnu branch\n\/\/\n\/\/ Revision 1.7 1999\/02\/22 22:59:07 jimg\n\/\/ Added the get_accept_types() accessor.\n\/\/ Changed the ctor so that the -t option is recognized.\n\/\/\n\/\/ Revision 1.6 1998\/12\/16 19:10:53 jimg\n\/\/ Added support for XDODS-Server MIME header. This fixes a problem where our\n\/\/ use of Server clashed with Java.\n\/\/\n\/\/ Revision 1.5 1998\/11\/10 01:04:42 jimg\n\/\/ Added `ends' to strings made with ostrstream (fixes a bug found with\n\/\/ purify).\n\/\/ Added catch for throws from within the CE evaluation functions.\n\/\/\n\/\/ Revision 1.4.2.2 1999\/02\/05 09:32:34 jimg\n\/\/ Fixed __unused__ so that it not longer clashes with Red Hat 5.2 inlined\n\/\/ math code. \n\/\/\n\/\/ Revision 1.4.2.1 1999\/02\/02 21:56:57 jimg\n\/\/ String to string version\n\/\/\n\/\/ Revision 1.4 1998\/08\/06 16:12:30 jimg\n\/\/ Added cache dir methods and stuff to ctor (from jeh)\n\/\/\n\/\/ Revision 1.3 1998\/03\/19 23:34:21 jimg\n\/\/ Fixed calls to set_mime_*().\n\/\/ Removed the compression code (it is now in DDS::send().\n\/\/ Removed old code (that was surrounded by #if 0 ... #endif).\n\/\/\n\/\/ Revision 1.2 1998\/02\/11 22:00:46 jimg\n\/\/ Added call to util.cc:deflate_exists() to send_data(). This means that\n\/\/ send_data() will only try to start the compressor if an executable copy of\n\/\/ deflate can be found. If, for any reason a copy of deflate cannot be found\n\/\/ data is sent without trying to compress it.\n\/\/\n\/\/ Revision 1.1 1997\/08\/28 20:39:02 jimg\n\/\/ Created\n\/\/\n\n#ifdef __GNUG__\n#pragma \"implemenation\"\n#endif\n\n#include \"config_dap.h\"\n\nstatic char rcsid[] not_used = {\"$Id: DODSFilter.cc,v 1.11 1999\/05\/19 23:56:57 jimg Exp $\"};\n\n#include <iostream>\n#ifdef __GNUG__\n#include <strstream>\n#else\n#include <sstream>\n#endif\n#include <string>\n#include <GetOpt.h>\n\n#include \"DAS.h\"\n#include \"DDS.h\"\n#include \"debug.h\"\n#include \"cgi_util.h\"\n#include \"DODSFilter.h\"\n\nDODSFilter::DODSFilter(int argc, char *argv[]) : comp(false), ver(false), \n bad_options(false), dataset(\"\"), ce(\"\"), cgi_ver(\"\"),\n anc_dir(\"\"), anc_file(\"\"), cache_dir(\"\"), accept_types(\"All\")\n{\n program_name = argv[0];\n\n int option_char;\n GetOpt getopt (argc, argv, \"ce:v:Vd:f:r:t:\");\n\n while ((option_char = getopt()) != EOF)\n\tswitch (option_char) {\n\t case 'c': comp = true; break;\n\t case 'e': ce = getopt.optarg; break;\n\t case 'v': cgi_ver = getopt.optarg; break;\n\t case 'V': ver = true; break;\n\t case 'd': anc_dir = getopt.optarg; break;\n\t case 'f': anc_file = getopt.optarg; break;\n\t case 'r': cache_dir = getopt.optarg; break;\n\t case 't': accept_types = getopt.optarg; break;\n\t default: bad_options = true; break;\n\t}\n\n int next_arg = getopt.optind;\n if(next_arg < argc)\n\tdataset = argv[next_arg];\n else\n\tbad_options = true;\n}\n\nDODSFilter::~DODSFilter()\n{\n}\n\nbool\nDODSFilter::OK()\n{\n\n return !bad_options;\n}\n\nbool\nDODSFilter::version()\n{\n return ver;\n}\n\nstring\nDODSFilter::get_cgi_version()\n{\n return cgi_ver;\n}\n\nstring\nDODSFilter::get_ce()\n{\n return ce;\n}\n\nstring\nDODSFilter::get_dataset_name()\n{\n return dataset;\n}\n\nstring\nDODSFilter::get_dataset_version()\n{\n return \"\";\n}\n\nstring\nDODSFilter::get_cache_dir()\n{\n return cache_dir;\n}\n\nstring\nDODSFilter::get_accept_types()\n{\n return accept_types;\n}\n\nbool\nDODSFilter::read_ancillary_das(DAS &das)\n{\n string name = find_ancillary_file(dataset, \"das\", anc_dir, anc_file);\n FILE *in = fopen(name.c_str(), \"r\");\n \n if (in) {\n\tint status = das.parse(in);\n\tfclose(in);\n \n\tif(!status) {\n\t string msg = \"Parse error in external file \" + dataset + \".das\";\n\n\t \/\/ server error message\n\t ErrMsgT(msg);\n\n\t \/\/ client error message\n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(malformed_expr, msg);\n\t e.print(cout);\n\n\t return false;\n\t}\n }\n\n return true;\n}\n\nbool\nDODSFilter::read_ancillary_dds(DDS &dds)\n{\n string name = find_ancillary_file(dataset, \"dds\", anc_dir, anc_file);\n FILE *in = fopen(name.c_str(), \"r\");\n \n if (in) {\n\tint status = dds.parse(in);\n\tfclose(in);\n \n\tif(!status) {\n\t string msg = \"Parse error in external file \" + dataset + \".dds\";\n\n\t \/\/ server error message\n\t ErrMsgT(msg);\n\n\t \/\/ client error message\n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(malformed_expr, msg);\n\t e.print(cout);\n\n\t return false;\n\t}\n }\n\n return true;\n}\n\nstatic const char *emessage = \\\n\"DODS internal server error. Please report this to the dataset maintainer, \\\nor to support@unidata.ucar.edu.\";\n\nvoid \nDODSFilter::print_usage()\n{\n \/\/ Write a message to the WWW server error log file.\n ostrstream oss;\n oss << \"Usage: \" << program_name\n\t<< \" [-c] [-v <cgi version>] [-e <ce>]\"\n\t<< \" [-d <ancillary file directory>] [-f <ancillary file name>]\"\n\t<< \" <dataset>\" << ends;\n ErrMsgT(oss.str());\n oss.rdbuf()->freeze(0);\n\n \/\/ Build an error object to return to the user.\n Error e(unknown_error, emessage);\n set_mime_text(cout, dods_error, cgi_ver);\n e.print(cout);\n}\n\nvoid \nDODSFilter::send_version_info()\n{\n cout << \"HTTP\/1.0 200 OK\" << endl\n\t << \"XDODS-Server: \" << cgi_ver << endl\n\t << \"Content-Type: text\/plain\" << endl\n\t << endl;\n \n cout << \"Core version: \" << DVR << endl;\n\n if (cgi_ver != \"\")\n\tcout << \"Server vision: \" << cgi_ver << endl;\n\n string v = get_dataset_version();\n if (v != \"\")\n\tcout << \"Dataset version: \" << v << endl;\n}\n\nbool\nDODSFilter::send_das(DAS &das)\n{\n set_mime_text(cout, dods_das, cgi_ver);\n das.print(cout);\n\n return true;\n}\n\nbool\nDODSFilter::send_dds(DDS &dds, bool constrained)\n{\n if (constrained) {\n\tif (!dds.parse_constraint(ce, cout, true)) {\n\t string m = program_name + \": parse error in constraint: \" \n\t\t+ ce;\n\t ErrMsgT(m);\n\t \n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(unknown_error, m);\n\t e.print(cout);\n\n\t return false;\n\t}\n\tset_mime_text(cout, dods_dds, cgi_ver);\n\tdds.print_constrained(cout); \/\/ send constrained DDS \n }\n else {\n\tset_mime_text(cout, dods_dds, cgi_ver);\n\tdds.print(cout);\n }\n\n return true;\n}\n\nbool\nDODSFilter::send_data(DDS &dds, FILE *data_stream)\n{\n bool compress = comp && deflate_exists();\n\n \/\/ This catch is a quick & dirty hack for exceptions thrown by the new\n \/\/ (11\/6\/98) projection functions in CEs. I might add exceptions to other\n \/\/ parts of the CE parser and evaluator. Eventually, the C++ classes\n \/\/ should switch to exceptions. 11\/6\/98 jhrg\n try {\n\tif (!dds.send(dataset, ce, data_stream, compress, cgi_ver)) {\n\t ErrMsgT((compress) ? \"Could not send compressed data\" : \n\t\t \"Could not send data\");\n\t return false;\n\t}\n }\n catch (Error &e) {\n\tset_mime_text(cout, dods_error, cgi_ver);\n\te.print(cout);\n\n\treturn false;\n }\n\t\n return true;\n}\n\n<commit_msg>Added instrumentation to the ctor. This simplifies debugging the interaction between the filter programs and the perl script.<commit_after>\n\/\/ (c) COPYRIGHT URI\/MIT 1997-1999\n\/\/ Please read the full copyright statement in the file COPYRIGHT.\n\/\/\n\/\/ Authors:\n\/\/ jhrg,jimg James Gallagher (jgallagher@gso.uri.edu)\n\n\/\/ Implementation of the DODSFilter class. This class is used to build dods\n\/\/ filter programs which, along with a CGI program, comprise DODS servers.\n\/\/ jhrg 8\/26\/97\n\n\/\/ $Log: DODSFilter.cc,v $\n\/\/ Revision 1.12 1999\/05\/21 17:15:46 jimg\n\/\/ Added instrumentation to the ctor. This simplifies debugging the interaction\n\/\/ between the filter programs and the perl script.\n\/\/\n\/\/ Revision 1.11 1999\/05\/19 23:56:57 jimg\n\/\/ Changed the support address from @dods to @unidata\n\/\/\n\/\/ Revision 1.10 1999\/05\/05 00:36:36 jimg\n\/\/ Added the -V option. -v now is used to pass the version information from the\n\/\/ CGI to the C++ software; -V triggers output of the version message. This\n\/\/ allows the DODSFilter class to pass information about the server's version to\n\/\/ the core software.\n\/\/ All set_mime_*() functions are now passes the CGI version information so that\n\/\/ all MIME headers contain information about the server's version.\n\/\/ Added the get_cgi_version() member function so that clients of DODSFilter can\n\/\/ find out the version number.\n\/\/\n\/\/ Revision 1.9 1999\/05\/04 19:47:21 jimg\n\/\/ Fixed copyright statements. Removed more of the GNU classes.\n\/\/\n\/\/ Revision 1.8 1999\/04\/29 02:29:28 jimg\n\/\/ Merge of no-gnu branch\n\/\/\n\/\/ Revision 1.7 1999\/02\/22 22:59:07 jimg\n\/\/ Added the get_accept_types() accessor.\n\/\/ Changed the ctor so that the -t option is recognized.\n\/\/\n\/\/ Revision 1.6 1998\/12\/16 19:10:53 jimg\n\/\/ Added support for XDODS-Server MIME header. This fixes a problem where our\n\/\/ use of Server clashed with Java.\n\/\/\n\/\/ Revision 1.5 1998\/11\/10 01:04:42 jimg\n\/\/ Added `ends' to strings made with ostrstream (fixes a bug found with\n\/\/ purify).\n\/\/ Added catch for throws from within the CE evaluation functions.\n\/\/\n\/\/ Revision 1.4.2.2 1999\/02\/05 09:32:34 jimg\n\/\/ Fixed __unused__ so that it not longer clashes with Red Hat 5.2 inlined\n\/\/ math code. \n\/\/\n\/\/ Revision 1.4.2.1 1999\/02\/02 21:56:57 jimg\n\/\/ String to string version\n\/\/\n\/\/ Revision 1.4 1998\/08\/06 16:12:30 jimg\n\/\/ Added cache dir methods and stuff to ctor (from jeh)\n\/\/\n\/\/ Revision 1.3 1998\/03\/19 23:34:21 jimg\n\/\/ Fixed calls to set_mime_*().\n\/\/ Removed the compression code (it is now in DDS::send().\n\/\/ Removed old code (that was surrounded by #if 0 ... #endif).\n\/\/\n\/\/ Revision 1.2 1998\/02\/11 22:00:46 jimg\n\/\/ Added call to util.cc:deflate_exists() to send_data(). This means that\n\/\/ send_data() will only try to start the compressor if an executable copy of\n\/\/ deflate can be found. If, for any reason a copy of deflate cannot be found\n\/\/ data is sent without trying to compress it.\n\/\/\n\/\/ Revision 1.1 1997\/08\/28 20:39:02 jimg\n\/\/ Created\n\/\/\n\n#ifdef __GNUG__\n#pragma \"implemenation\"\n#endif\n\n#include \"config_dap.h\"\n\nstatic char rcsid[] not_used = {\"$Id: DODSFilter.cc,v 1.12 1999\/05\/21 17:15:46 jimg Exp $\"};\n\n#include <iostream>\n#ifdef __GNUG__\n#include <strstream>\n#else\n#include <sstream>\n#endif\n#include <string>\n#include <GetOpt.h>\n\n#include \"DAS.h\"\n#include \"DDS.h\"\n#include \"debug.h\"\n#include \"cgi_util.h\"\n#include \"DODSFilter.h\"\n\nDODSFilter::DODSFilter(int argc, char *argv[]) : comp(false), ver(false), \n bad_options(false), dataset(\"\"), ce(\"\"), cgi_ver(\"\"),\n anc_dir(\"\"), anc_file(\"\"), cache_dir(\"\"), accept_types(\"All\")\n{\n program_name = argv[0];\n\n int option_char;\n GetOpt getopt (argc, argv, \"ce:v:Vd:f:r:t:\");\n\n while ((option_char = getopt()) != EOF)\n\tswitch (option_char) {\n\t case 'c': comp = true; break;\n\t case 'e': ce = getopt.optarg; break;\n\t case 'v': cgi_ver = getopt.optarg; break;\n\t case 'V': ver = true; break;\n\t case 'd': anc_dir = getopt.optarg; break;\n\t case 'f': anc_file = getopt.optarg; break;\n\t case 'r': cache_dir = getopt.optarg; break;\n\t case 't': accept_types = getopt.optarg; break;\n\t default: bad_options = true; break;\n\t}\n\n int next_arg = getopt.optind;\n if(next_arg < argc)\n\tdataset = argv[next_arg];\n else\n\tbad_options = true;\n\n DBG(cerr << \"comp: \" << comp << endl);\n DBG(cerr << \"ce: \" << ce << endl);\n DBG(cerr << \"cgi_ver: \" << cgi_ver << endl);\n DBG(cerr << \"ver: \" << ver << endl);\n DBG(cerr << \"anc_dir: \" << anc_dir << endl);\n DBG(cerr << \"anc_file: \" << anc_file << endl);\n DBG(cerr << \"cache_dir: \" << cache_dir << endl);\n DBG(cerr << \"accept_types: \" << accept_types << endl);\n}\n\nDODSFilter::~DODSFilter()\n{\n}\n\nbool\nDODSFilter::OK()\n{\n\n return !bad_options;\n}\n\nbool\nDODSFilter::version()\n{\n return ver;\n}\n\nstring\nDODSFilter::get_cgi_version()\n{\n return cgi_ver;\n}\n\nstring\nDODSFilter::get_ce()\n{\n return ce;\n}\n\nstring\nDODSFilter::get_dataset_name()\n{\n return dataset;\n}\n\nstring\nDODSFilter::get_dataset_version()\n{\n return \"\";\n}\n\nstring\nDODSFilter::get_cache_dir()\n{\n return cache_dir;\n}\n\nstring\nDODSFilter::get_accept_types()\n{\n return accept_types;\n}\n\nbool\nDODSFilter::read_ancillary_das(DAS &das)\n{\n string name = find_ancillary_file(dataset, \"das\", anc_dir, anc_file);\n FILE *in = fopen(name.c_str(), \"r\");\n \n if (in) {\n\tint status = das.parse(in);\n\tfclose(in);\n \n\tif(!status) {\n\t string msg = \"Parse error in external file \" + dataset + \".das\";\n\n\t \/\/ server error message\n\t ErrMsgT(msg);\n\n\t \/\/ client error message\n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(malformed_expr, msg);\n\t e.print(cout);\n\n\t return false;\n\t}\n }\n\n return true;\n}\n\nbool\nDODSFilter::read_ancillary_dds(DDS &dds)\n{\n string name = find_ancillary_file(dataset, \"dds\", anc_dir, anc_file);\n FILE *in = fopen(name.c_str(), \"r\");\n \n if (in) {\n\tint status = dds.parse(in);\n\tfclose(in);\n \n\tif(!status) {\n\t string msg = \"Parse error in external file \" + dataset + \".dds\";\n\n\t \/\/ server error message\n\t ErrMsgT(msg);\n\n\t \/\/ client error message\n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(malformed_expr, msg);\n\t e.print(cout);\n\n\t return false;\n\t}\n }\n\n return true;\n}\n\nstatic const char *emessage = \\\n\"DODS internal server error. Please report this to the dataset maintainer, \\\nor to support@unidata.ucar.edu.\";\n\nvoid \nDODSFilter::print_usage()\n{\n \/\/ Write a message to the WWW server error log file.\n ostrstream oss;\n oss << \"Usage: \" << program_name\n\t<< \" [-c] [-v <cgi version>] [-e <ce>]\"\n\t<< \" [-d <ancillary file directory>] [-f <ancillary file name>]\"\n\t<< \" <dataset>\" << ends;\n ErrMsgT(oss.str());\n oss.rdbuf()->freeze(0);\n\n \/\/ Build an error object to return to the user.\n Error e(unknown_error, emessage);\n set_mime_text(cout, dods_error, cgi_ver);\n e.print(cout);\n}\n\nvoid \nDODSFilter::send_version_info()\n{\n cout << \"HTTP\/1.0 200 OK\" << endl\n\t << \"XDODS-Server: \" << cgi_ver << endl\n\t << \"Content-Type: text\/plain\" << endl\n\t << endl;\n \n cout << \"Core version: \" << DVR << endl;\n\n if (cgi_ver != \"\")\n\tcout << \"Server vision: \" << cgi_ver << endl;\n\n string v = get_dataset_version();\n if (v != \"\")\n\tcout << \"Dataset version: \" << v << endl;\n}\n\nbool\nDODSFilter::send_das(DAS &das)\n{\n set_mime_text(cout, dods_das, cgi_ver);\n das.print(cout);\n\n return true;\n}\n\nbool\nDODSFilter::send_dds(DDS &dds, bool constrained)\n{\n if (constrained) {\n\tif (!dds.parse_constraint(ce, cout, true)) {\n\t string m = program_name + \": parse error in constraint: \" \n\t\t+ ce;\n\t ErrMsgT(m);\n\t \n\t set_mime_text(cout, dods_error, cgi_ver);\n\t Error e(unknown_error, m);\n\t e.print(cout);\n\n\t return false;\n\t}\n\tset_mime_text(cout, dods_dds, cgi_ver);\n\tdds.print_constrained(cout); \/\/ send constrained DDS \n }\n else {\n\tset_mime_text(cout, dods_dds, cgi_ver);\n\tdds.print(cout);\n }\n\n return true;\n}\n\nbool\nDODSFilter::send_data(DDS &dds, FILE *data_stream)\n{\n bool compress = comp && deflate_exists();\n\n \/\/ This catch is a quick & dirty hack for exceptions thrown by the new\n \/\/ (11\/6\/98) projection functions in CEs. I might add exceptions to other\n \/\/ parts of the CE parser and evaluator. Eventually, the C++ classes\n \/\/ should switch to exceptions. 11\/6\/98 jhrg\n try {\n\tif (!dds.send(dataset, ce, data_stream, compress, cgi_ver)) {\n\t ErrMsgT((compress) ? \"Could not send compressed data\" : \n\t\t \"Could not send data\");\n\t return false;\n\t}\n }\n catch (Error &e) {\n\tset_mime_text(cout, dods_error, cgi_ver);\n\te.print(cout);\n\n\treturn false;\n }\n\t\n return true;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"catch.hpp\"\n\n#include <mapnik\/parse_transform.hpp>\n#include <mapnik\/transform_expression.hpp>\n\nnamespace {\n\n\nbool test_transform_expressions(std::string const& in, std::string const& out)\n{\n auto tr_list = mapnik::parse_transform(in);\n return mapnik::to_expression_string(*tr_list) == out;\n}\n\n}\n\nTEST_CASE(\"transform-expressions\")\n{\n \/\/ matrix\n CHECK(test_transform_expressions(\"matrix( 1,2,3,4,5, 6)\", \"matrix(1, 2, 3, 4, 5, 6)\"));\n CHECK(test_transform_expressions(\"matrix(1 2 3 4 5 6)\", \"matrix(1, 2, 3, 4, 5, 6)\"));\n CHECK(test_transform_expressions(\"matrix(1,2,3,4,5,4*2-1)\", \"matrix(1, 2, 3, 4, 5, (4*2-1))\"));\n\n \/\/ translate\n CHECK(test_transform_expressions(\"translate(100)\", \"translate(100)\"));\n CHECK(test_transform_expressions(\"translate([tx])\", \"translate([tx])\"));\n CHECK(test_transform_expressions(\"translate(100 200)\", \"translate(100, 200)\"));\n CHECK(test_transform_expressions(\"translate([tx],[ty])\", \"translate([tx], [ty])\"));\n CHECK(test_transform_expressions(\"translate([tx],200)\", \"translate([tx], 200)\"));\n CHECK(test_transform_expressions(\"translate(100,[ty])\", \"translate(100, [ty])\"));\n\n \/\/ scale\n CHECK(test_transform_expressions(\"scale(1.5)\", \"scale(1.5)\"));\n CHECK(test_transform_expressions(\"scale([sx])\", \"scale([sx])\"));\n CHECK(test_transform_expressions(\"scale([sx],1.5)\", \"scale([sx], 1.5)\"));\n CHECK(test_transform_expressions(\"scale(1.5,[sy])\", \"scale(1.5, [sy])\"));\n CHECK(test_transform_expressions(\"scale([sx],[sy]\/2)\", \"scale([sx], [sy]\/2)\"));\n\n \/\/ rotate\n CHECK(test_transform_expressions(\"rotate([a] -2)\", \"rotate(([a]-2))\"));\n CHECK(test_transform_expressions(\"rotate([a] -2 -3)\", \"rotate((([a]-2)-3))\"));\n CHECK(test_transform_expressions(\"rotate([a],-2,-3)\", \"rotate([a], -2, -3)\"));\n CHECK(test_transform_expressions(\"rotate([a] -2 -3 -4)\", \"rotate(((([a]-2)-3)-4))\"));\n CHECK(test_transform_expressions(\"rotate([a] -2, 3, 4)\", \"rotate(([a]-2), 3, 4)\"));\n\n \/\/ skewX\n CHECK(test_transform_expressions(\"skewX(2)\", \"skewX(2)\"));\n CHECK(test_transform_expressions(\"skewX(2*[x]+[y])\", \"skewX((2*[x]+[y]))\"));\n\n \/\/ skewY\n CHECK(test_transform_expressions(\"skewY(2)\", \"skewY(2)\"));\n CHECK(test_transform_expressions(\"skewY(2*[x]+[y])\", \"skewY((2*[x]+[y]))\"));\n\n \/\/ compound\n CHECK(test_transform_expressions(\"translate([tx]) rotate([a])\", \"translate([tx]) rotate([a])\"));\n CHECK(test_transform_expressions(\"rotate(30+[a]) scale(2*[sx],[sy])\", \"rotate((30+[a])) scale(2*[sx], [sy])\"));\n}\n<commit_msg>transform_expressions_test - add global attribute tests ( e.g @value ) ref #3569<commit_after>#include \"catch.hpp\"\n\n#include <mapnik\/parse_transform.hpp>\n#include <mapnik\/transform_expression.hpp>\n\nnamespace {\n\n\nbool test_transform_expressions(std::string const& in, std::string const& out)\n{\n auto tr_list = mapnik::parse_transform(in);\n return mapnik::to_expression_string(*tr_list) == out;\n}\n\n}\n\nTEST_CASE(\"transform-expressions\")\n{\n \/\/ matrix\n CHECK(test_transform_expressions(\"matrix( 1,2,3,4,5, 6)\", \"matrix(1, 2, 3, 4, 5, 6)\"));\n CHECK(test_transform_expressions(\"matrix(1 2 3 4 5 6)\", \"matrix(1, 2, 3, 4, 5, 6)\"));\n CHECK(test_transform_expressions(\"matrix(1,2,3,4,5,4*2-1)\", \"matrix(1, 2, 3, 4, 5, (4*2-1))\"));\n CHECK(test_transform_expressions(\"matrix(1,2,3,4,5,[value])\", \"matrix(1, 2, 3, 4, 5, [value])\"));\n CHECK(test_transform_expressions(\"matrix(1,2,@value,4,5,6)\", \"matrix(1, 2, @value, 4, 5, 6)\"));\n CHECK(test_transform_expressions(\"matrix(1,2,3,4,5,@value)\", \"matrix(1, 2, 3, 4, 5, @value)\"));\n\n \/\/ translate\n CHECK(test_transform_expressions(\"translate(100)\", \"translate(100)\"));\n CHECK(test_transform_expressions(\"translate([tx])\", \"translate([tx])\"));\n CHECK(test_transform_expressions(\"translate(100 200)\", \"translate(100, 200)\"));\n CHECK(test_transform_expressions(\"translate([tx],[ty])\", \"translate([tx], [ty])\"));\n CHECK(test_transform_expressions(\"translate([tx],200)\", \"translate([tx], 200)\"));\n CHECK(test_transform_expressions(\"translate(100,[ty])\", \"translate(100, [ty])\"));\n\n \/\/ scale\n CHECK(test_transform_expressions(\"scale(1.5)\", \"scale(1.5)\"));\n CHECK(test_transform_expressions(\"scale([sx])\", \"scale([sx])\"));\n CHECK(test_transform_expressions(\"scale([sx],1.5)\", \"scale([sx], 1.5)\"));\n CHECK(test_transform_expressions(\"scale(1.5,[sy])\", \"scale(1.5, [sy])\"));\n CHECK(test_transform_expressions(\"scale([sx],[sy]\/2)\", \"scale([sx], [sy]\/2)\"));\n\n \/\/ rotate\n CHECK(test_transform_expressions(\"rotate([a] -2)\", \"rotate(([a]-2))\"));\n CHECK(test_transform_expressions(\"rotate([a] -2 -3)\", \"rotate((([a]-2)-3))\"));\n CHECK(test_transform_expressions(\"rotate([a],-2,-3)\", \"rotate([a], -2, -3)\"));\n CHECK(test_transform_expressions(\"rotate([a] -2 -3 -4)\", \"rotate(((([a]-2)-3)-4))\"));\n CHECK(test_transform_expressions(\"rotate([a] -2, 3, 4)\", \"rotate(([a]-2), 3, 4)\"));\n\n \/\/ skewX\n CHECK(test_transform_expressions(\"skewX(2)\", \"skewX(2)\"));\n CHECK(test_transform_expressions(\"skewX(2*[x]+[y])\", \"skewX((2*[x]+[y]))\"));\n\n \/\/ skewY\n CHECK(test_transform_expressions(\"skewY(2)\", \"skewY(2)\"));\n CHECK(test_transform_expressions(\"skewY(2*[x]+[y])\", \"skewY((2*[x]+[y]))\"));\n\n \/\/ compound\n CHECK(test_transform_expressions(\"translate([tx]) rotate([a])\", \"translate([tx]) rotate([a])\"));\n CHECK(test_transform_expressions(\"rotate(30+@value) scale(2*[sx],[sy])\", \"rotate((30+@value)) scale(2*[sx], [sy])\"));\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ OpenFlight loader for OpenSceneGraph\n\/\/\n\/\/ Copyright (C) 2005-2006 Brede Johansen\n\/\/\n\n#include <stdexcept>\n#include <osg\/Notify>\n#include <osg\/ProxyNode>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/FileUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n#include <osgDB\/ReentrantMutex>\n#include <osgUtil\/Optimizer>\n\n#include \"Registry.h\"\n#include \"Document.h\"\n#include \"RecordInputStream.h\"\n\n#define SERIALIZER() OpenThreads::ScopedLock<osgDB::ReentrantMutex> lock(_serializerMutex) \n\nusing namespace flt;\nusing namespace osg;\nusing namespace osgDB;\n\n\nclass ReadExternalsVisitor : public osg::NodeVisitor\n{\n osg::ref_ptr<ReaderWriter::Options> _options;\n\npublic:\n\n ReadExternalsVisitor(ReaderWriter::Options* options) :\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n _options(options)\n {\n }\n \n virtual ~ReadExternalsVisitor() {}\n\n virtual void apply(ProxyNode& node)\n {\n \/\/ Transfer ownership of pools.\n _options->setUserData( node.getUserData() );\n node.setUserData(NULL);\n\n for (unsigned int pos=0; pos<node.getNumFileNames(); pos++)\n {\n std::string filename = node.getFileName(pos);\n\n \/\/ read external\n osg::Node* external = osgDB::readNodeFile(filename,_options.get());\n if (external)\n node.addChild(external);\n }\n }\n};\n\n\nclass FLTReaderWriter : public ReaderWriter\n{\n public:\n virtual const char* className() const { return \"FLT Reader\/Writer\"; }\n\n virtual bool acceptsExtension(const std::string& extension) const\n {\n return equalCaseInsensitive(extension,\"flt\");\n }\n\n virtual ReadResult readObject(const std::string& file, const Options* options) const\n {\n return readNode(file, options);\n }\n \n virtual ReadResult readNode(const std::string& file, const Options* options) const\n {\n SERIALIZER();\n\n std::string ext = osgDB::getLowerCaseFileExtension(file);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName = osgDB::findDataFile(file, options);\n if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n \/\/ in local cache?\n {\n osg::Node* node = flt::Registry::instance()->getFromLocalCache(fileName);\n if (node)\n return ReadResult(node, ReaderWriter::ReadResult::FILE_LOADED_FROM_CACHE);\n }\n\n \/\/ setting up the database path so that internally referenced file are searched for on relative paths. \n osg::ref_ptr<Options> local_opt = options ? static_cast<Options*>(options->clone(osg::CopyOp::SHALLOW_COPY)) : new Options;\n local_opt->setDatabasePath(osgDB::getFilePath(fileName));\n\n ReadResult rr;\n\n \/\/ read file\n {\n std::ifstream istream;\n istream.imbue(std::locale::classic());\n istream.open(fileName.c_str(), std::ios::in | std::ios::binary);\n\n if (istream)\n {\n rr = readNode(istream,local_opt.get());\n }\n }\n\n static int nestedExternalsLevel = 0;\n if (rr.success())\n {\n \/\/ add to local cache.\n flt::Registry::instance()->addToLocalCache(fileName,rr.getNode());\n \n bool keepExternalReferences = false;\n if (options)\n keepExternalReferences = (options->getOptionString().find(\"keepExternalReferences\")!=std::string::npos);\n\n\n if ( !keepExternalReferences )\n {\n osg::notify(osg::DEBUG_INFO) << \"keepExternalReferences not found, so externals will be re-readed\"<<std::endl;\n \/\/ read externals.\n if (rr.getNode())\n {\n nestedExternalsLevel++;\n ReadExternalsVisitor visitor(local_opt.get());\n rr.getNode()->accept(visitor);\n nestedExternalsLevel--;\n }\n }\n else\n {\n osg::notify(osg::DEBUG_INFO) << \"keepExternalReferences found, so externals will be left as ProxyNodes\"<<std::endl; \n }\n }\n\n \/\/ clear local cache.\n if (nestedExternalsLevel==0)\n flt::Registry::instance()->clearLocalCache();\n\n return rr;\n }\n \n virtual ReadResult readObject(std::istream& fin, const Options* options) const\n {\n return readNode(fin, options);\n }\n \n virtual ReadResult readNode(std::istream& fin, const Options* options) const\n {\n Document document;\n document.setOptions(options);\n\n \/\/ option string and parent pools\n if (options)\n {\n const char readerMsg[] = \"flt reader option: \";\n \n document.setReplaceClampWithClampToEdge((options->getOptionString().find(\"clampToEdge\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"clampToEdge=\" << document.getReplaceClampWithClampToEdge() << std::endl;\n\n document.setKeepExternalReferences((options->getOptionString().find(\"keepExternalReferences\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"keepExternalReferences=\" << document.getKeepExternalReferences() << std::endl;\n\n document.setPreserveFace((options->getOptionString().find(\"preserveFace\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"preserveFace=\" << document.getPreserveFace() << std::endl;\n\n document.setPreserveObject((options->getOptionString().find(\"preserveObject\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"preserveObject=\" << document.getPreserveObject() << std::endl;\n\n document.setDefaultDOFAnimationState((options->getOptionString().find(\"dofAnimation\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"dofAnimation=\" << document.getDefaultDOFAnimationState() << std::endl;\n\n document.setUseBillboardCenter((options->getOptionString().find(\"billboardCenter\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"billboardCenter=\" << document.getUseBillboardCenter() << std::endl;\n\n document.setUseTextureAlphaForTransparancyBinning(options->getOptionString().find(\"noTextureAlphaForTransparancyBinning\")==std::string::npos);\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"noTextureAlphaForTransparancyBinning=\" << !document.getUseTextureAlphaForTransparancyBinning() << std::endl;\n\n document.setDoUnitsConversion((options->getOptionString().find(\"noUnitsConversion\")==std::string::npos)); \/\/ default to true, unless noUnitsConversion is specified.\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"noUnitsConversion=\" << !document.getDoUnitsConversion() << std::endl;\n\n if (document.getDoUnitsConversion())\n {\n if (options->getOptionString().find(\"convertToFeet\")!=std::string::npos)\n document.setDesiredUnits(FEET);\n else if (options->getOptionString().find(\"convertToInches\")!=std::string::npos)\n document.setDesiredUnits(INCHES);\n else if (options->getOptionString().find(\"convertToMeters\")!=std::string::npos)\n document.setDesiredUnits(METERS);\n else if (options->getOptionString().find(\"convertToKilometers\")!=std::string::npos)\n document.setDesiredUnits(KILOMETERS);\n else if (options->getOptionString().find(\"convertToNauticalMiles\")!=std::string::npos)\n document.setDesiredUnits(NAUTICAL_MILES);\n }\n\n const ParentPools* pools = dynamic_cast<const ParentPools*>( options->getUserData() );\n if (pools)\n {\n \/\/ This file is an external reference. The individual pools will\n \/\/ be non-NULL if the parent is overriding the ext ref model's pools.\n if (pools->getColorPool())\n document.setColorPool( pools->getColorPool(), true );\n if (pools->getTexturePool())\n document.setTexturePool( pools->getTexturePool(), true );\n if (pools->getMaterialPool())\n document.setMaterialPool( pools->getMaterialPool(), true );\n if (pools->getLPAppearancePool())\n document.setLightPointAppearancePool( pools->getLPAppearancePool(), true );\n if (pools->getShaderPool())\n document.setShaderPool( pools->getShaderPool(), true );\n }\n }\n\n {\n \/\/ read records\n flt::RecordInputStream recordStream(fin.rdbuf());\n while (recordStream.good() && !document.done())\n {\n recordStream.readRecord(document);\n }\n }\n\n if (!document.getHeaderNode())\n return ReadResult::ERROR_IN_READING_FILE;\n\n if (!document.getPreserveFace())\n {\n osgUtil::Optimizer optimizer;\n optimizer.optimize(document.getHeaderNode(), osgUtil::Optimizer::SHARE_DUPLICATE_STATE | osgUtil::Optimizer::MERGE_GEOMETRY | osgUtil::Optimizer::MERGE_GEODES | osgUtil::Optimizer::TESSELATE_GEOMETRY );\n }\n\n return document.getHeaderNode();\n }\n\n virtual WriteResult writeObject(const Object& object,const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n {\n const Node* node = dynamic_cast<const Node*>(&object);\n if (node) return writeNode( *node, fileName, options );\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n virtual WriteResult writeNode(const Node& \/*node*\/,const std::string& \/*fileName*\/, const osgDB::ReaderWriter::Options* \/*options*\/) const\n {\n return WriteResult::FILE_NOT_HANDLED;\n }\n \n virtual WriteResult writeObject(const Object& object,std::ostream& fout, const osgDB::ReaderWriter::Options* options) const\n {\n const Node* node = dynamic_cast<const Node*>(&object);\n if (node) return writeNode( *node, fout, options );\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n virtual WriteResult writeNode(const Node& \/*node*\/,std::ostream& \/*fout*\/, const osgDB::ReaderWriter::Options* \/*options*\/) const\n {\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n protected:\n\n mutable osgDB::ReentrantMutex _serializerMutex;\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nRegisterReaderWriterProxy<FLTReaderWriter> g_FLTReaderWriterProxy;\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<commit_msg>From Brede Johansen, \"New option \"cloneExternalReferences\" for OpenFlight plugin\"<commit_after>\/\/\n\/\/ OpenFlight loader for OpenSceneGraph\n\/\/\n\/\/ Copyright (C) 2005-2006 Brede Johansen\n\/\/\n\n#include <stdexcept>\n#include <osg\/Notify>\n#include <osg\/ProxyNode>\n#include <osgDB\/FileNameUtils>\n#include <osgDB\/FileUtils>\n#include <osgDB\/Registry>\n#include <osgDB\/ReadFile>\n#include <osgDB\/ReentrantMutex>\n#include <osgUtil\/Optimizer>\n\n#include \"Registry.h\"\n#include \"Document.h\"\n#include \"RecordInputStream.h\"\n\n#define SERIALIZER() OpenThreads::ScopedLock<osgDB::ReentrantMutex> lock(_serializerMutex) \n\nusing namespace flt;\nusing namespace osg;\nusing namespace osgDB;\n\n\nclass ReadExternalsVisitor : public osg::NodeVisitor\n{\n bool _cloneExternalReferences;\n osg::ref_ptr<ReaderWriter::Options> _options;\n\npublic:\n\n ReadExternalsVisitor(ReaderWriter::Options* options) :\n osg::NodeVisitor(osg::NodeVisitor::TRAVERSE_ALL_CHILDREN),\n _options(options),\n _cloneExternalReferences(false)\n {\n if (options)\n _cloneExternalReferences = (options->getOptionString().find(\"cloneExternalReferences\")!=std::string::npos);\n }\n\n virtual ~ReadExternalsVisitor() {}\n\n virtual void apply(ProxyNode& node)\n {\n \/\/ Transfer ownership of pools.\n _options->setUserData( node.getUserData() );\n node.setUserData(NULL);\n\n for (unsigned int pos=0; pos<node.getNumFileNames(); pos++)\n {\n std::string filename = node.getFileName(pos);\n\n \/\/ read external\n osg::ref_ptr<osg::Node> external = osgDB::readNodeFile(filename,_options.get());\n if (external.valid())\n {\n if (_cloneExternalReferences)\n external = dynamic_cast<osg::Node*>(external->clone(osg::CopyOp(osg::CopyOp::DEEP_COPY_NODES)));\n\n node.addChild(external.get());\n }\n }\n }\n};\n\n\n\nclass FLTReaderWriter : public ReaderWriter\n{\n public:\n virtual const char* className() const { return \"FLT Reader\/Writer\"; }\n\n virtual bool acceptsExtension(const std::string& extension) const\n {\n return equalCaseInsensitive(extension,\"flt\");\n }\n\n virtual ReadResult readObject(const std::string& file, const Options* options) const\n {\n return readNode(file, options);\n }\n \n virtual ReadResult readNode(const std::string& file, const Options* options) const\n {\n SERIALIZER();\n\n std::string ext = osgDB::getLowerCaseFileExtension(file);\n if (!acceptsExtension(ext)) return ReadResult::FILE_NOT_HANDLED;\n\n std::string fileName = osgDB::findDataFile(file, options);\n if (fileName.empty()) return ReadResult::FILE_NOT_FOUND;\n\n \/\/ in local cache?\n {\n osg::Node* node = flt::Registry::instance()->getFromLocalCache(fileName);\n if (node)\n return ReadResult(node, ReaderWriter::ReadResult::FILE_LOADED_FROM_CACHE);\n }\n\n \/\/ setting up the database path so that internally referenced file are searched for on relative paths. \n osg::ref_ptr<Options> local_opt = options ? static_cast<Options*>(options->clone(osg::CopyOp::SHALLOW_COPY)) : new Options;\n local_opt->setDatabasePath(osgDB::getFilePath(fileName));\n\n ReadResult rr;\n\n \/\/ read file\n {\n std::ifstream istream;\n istream.imbue(std::locale::classic());\n istream.open(fileName.c_str(), std::ios::in | std::ios::binary);\n\n if (istream)\n {\n rr = readNode(istream,local_opt.get());\n }\n }\n\n static int nestedExternalsLevel = 0;\n if (rr.success())\n {\n \/\/ add to local cache.\n flt::Registry::instance()->addToLocalCache(fileName,rr.getNode());\n \n bool keepExternalReferences = false;\n if (options)\n keepExternalReferences = (options->getOptionString().find(\"keepExternalReferences\")!=std::string::npos);\n\n\n if ( !keepExternalReferences )\n {\n osg::notify(osg::DEBUG_INFO) << \"keepExternalReferences not found, so externals will be re-readed\"<<std::endl;\n \/\/ read externals.\n if (rr.getNode())\n {\n nestedExternalsLevel++;\n ReadExternalsVisitor visitor(local_opt.get());\n rr.getNode()->accept(visitor);\n nestedExternalsLevel--;\n }\n }\n else\n {\n osg::notify(osg::DEBUG_INFO) << \"keepExternalReferences found, so externals will be left as ProxyNodes\"<<std::endl; \n }\n }\n\n \/\/ clear local cache.\n if (nestedExternalsLevel==0)\n flt::Registry::instance()->clearLocalCache();\n\n return rr;\n }\n \n virtual ReadResult readObject(std::istream& fin, const Options* options) const\n {\n return readNode(fin, options);\n }\n \n virtual ReadResult readNode(std::istream& fin, const Options* options) const\n {\n Document document;\n document.setOptions(options);\n\n \/\/ option string and parent pools\n if (options)\n {\n const char readerMsg[] = \"flt reader option: \";\n \n document.setReplaceClampWithClampToEdge((options->getOptionString().find(\"clampToEdge\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"clampToEdge=\" << document.getReplaceClampWithClampToEdge() << std::endl;\n\n document.setKeepExternalReferences((options->getOptionString().find(\"keepExternalReferences\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"keepExternalReferences=\" << document.getKeepExternalReferences() << std::endl;\n\n document.setPreserveFace((options->getOptionString().find(\"preserveFace\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"preserveFace=\" << document.getPreserveFace() << std::endl;\n\n document.setPreserveObject((options->getOptionString().find(\"preserveObject\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"preserveObject=\" << document.getPreserveObject() << std::endl;\n\n document.setDefaultDOFAnimationState((options->getOptionString().find(\"dofAnimation\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"dofAnimation=\" << document.getDefaultDOFAnimationState() << std::endl;\n\n document.setUseBillboardCenter((options->getOptionString().find(\"billboardCenter\")!=std::string::npos));\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"billboardCenter=\" << document.getUseBillboardCenter() << std::endl;\n\n document.setUseTextureAlphaForTransparancyBinning(options->getOptionString().find(\"noTextureAlphaForTransparancyBinning\")==std::string::npos);\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"noTextureAlphaForTransparancyBinning=\" << !document.getUseTextureAlphaForTransparancyBinning() << std::endl;\n\n document.setDoUnitsConversion((options->getOptionString().find(\"noUnitsConversion\")==std::string::npos)); \/\/ default to true, unless noUnitsConversion is specified.\n osg::notify(osg::DEBUG_INFO) << readerMsg << \"noUnitsConversion=\" << !document.getDoUnitsConversion() << std::endl;\n\n if (document.getDoUnitsConversion())\n {\n if (options->getOptionString().find(\"convertToFeet\")!=std::string::npos)\n document.setDesiredUnits(FEET);\n else if (options->getOptionString().find(\"convertToInches\")!=std::string::npos)\n document.setDesiredUnits(INCHES);\n else if (options->getOptionString().find(\"convertToMeters\")!=std::string::npos)\n document.setDesiredUnits(METERS);\n else if (options->getOptionString().find(\"convertToKilometers\")!=std::string::npos)\n document.setDesiredUnits(KILOMETERS);\n else if (options->getOptionString().find(\"convertToNauticalMiles\")!=std::string::npos)\n document.setDesiredUnits(NAUTICAL_MILES);\n }\n\n const ParentPools* pools = dynamic_cast<const ParentPools*>( options->getUserData() );\n if (pools)\n {\n \/\/ This file is an external reference. The individual pools will\n \/\/ be non-NULL if the parent is overriding the ext ref model's pools.\n if (pools->getColorPool())\n document.setColorPool( pools->getColorPool(), true );\n if (pools->getTexturePool())\n document.setTexturePool( pools->getTexturePool(), true );\n if (pools->getMaterialPool())\n document.setMaterialPool( pools->getMaterialPool(), true );\n if (pools->getLPAppearancePool())\n document.setLightPointAppearancePool( pools->getLPAppearancePool(), true );\n if (pools->getShaderPool())\n document.setShaderPool( pools->getShaderPool(), true );\n }\n }\n\n {\n \/\/ read records\n flt::RecordInputStream recordStream(fin.rdbuf());\n while (recordStream.good() && !document.done())\n {\n recordStream.readRecord(document);\n }\n }\n\n if (!document.getHeaderNode())\n return ReadResult::ERROR_IN_READING_FILE;\n\n if (!document.getPreserveFace())\n {\n osgUtil::Optimizer optimizer;\n optimizer.optimize(document.getHeaderNode(), osgUtil::Optimizer::SHARE_DUPLICATE_STATE | osgUtil::Optimizer::MERGE_GEOMETRY | osgUtil::Optimizer::MERGE_GEODES | osgUtil::Optimizer::TESSELATE_GEOMETRY );\n }\n\n return document.getHeaderNode();\n }\n\n virtual WriteResult writeObject(const Object& object,const std::string& fileName, const osgDB::ReaderWriter::Options* options) const\n {\n const Node* node = dynamic_cast<const Node*>(&object);\n if (node) return writeNode( *node, fileName, options );\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n virtual WriteResult writeNode(const Node& \/*node*\/,const std::string& \/*fileName*\/, const osgDB::ReaderWriter::Options* \/*options*\/) const\n {\n return WriteResult::FILE_NOT_HANDLED;\n }\n \n virtual WriteResult writeObject(const Object& object,std::ostream& fout, const osgDB::ReaderWriter::Options* options) const\n {\n const Node* node = dynamic_cast<const Node*>(&object);\n if (node) return writeNode( *node, fout, options );\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n virtual WriteResult writeNode(const Node& \/*node*\/,std::ostream& \/*fout*\/, const osgDB::ReaderWriter::Options* \/*options*\/) const\n {\n return WriteResult::FILE_NOT_HANDLED;\n }\n\n protected:\n\n mutable osgDB::ReentrantMutex _serializerMutex;\n};\n\n\/\/ now register with Registry to instantiate the above\n\/\/ reader\/writer.\nRegisterReaderWriterProxy<FLTReaderWriter> g_FLTReaderWriterProxy;\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE libraries\n Copyright (C) 2004 Antonio Larrosa <larrosa@kde.org\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n*\/\n\n#include \"kpixmapregionselectorwidget.h\"\n#include <qpainter.h>\n#include <qcolor.h>\n#include <qimage.h>\n#include <qlayout.h>\n#include <kimageeffect.h>\n#include <kdebug.h>\n#include <stdlib.h>\n\nusing namespace KPIM;\n\nKPixmapRegionSelectorWidget::KPixmapRegionSelectorWidget( QWidget *parent, \n const char *name) : QWidget( parent, name)\n{\n QHBoxLayout * hboxLayout=new QHBoxLayout( this );\n \n hboxLayout->addStretch();\n QVBoxLayout * vboxLayout=new QVBoxLayout( this );\n\n vboxLayout->addStretch();\n m_label = new QLabel(this, \"pixmapHolder\");\n m_label->setBackgroundMode( Qt::NoBackground );\n m_label->installEventFilter( this );\n\n vboxLayout->addWidget(m_label);\n vboxLayout->addStretch();\n\n hboxLayout->addLayout(vboxLayout);\n hboxLayout->addStretch();\n\n m_forcedAspectRatio=0;\n\n m_zoomFactor=1.0;\n}\n\nKPixmapRegionSelectorWidget::~KPixmapRegionSelectorWidget()\n{\n}\n\nvoid KPixmapRegionSelectorWidget::setPixmap( const QPixmap &pixmap )\n{\n m_originalPixmap = pixmap;\n m_unzoomedPixmap = pixmap;\n m_label->setPixmap( pixmap );\n resetSelection();\n}\n\nvoid KPixmapRegionSelectorWidget::resetSelection()\n{\n m_selectedRegion = m_originalPixmap.rect();\n updatePixmap();\n}\n\nQRect KPixmapRegionSelectorWidget::selectedRegion() const\n{\n return m_selectedRegion;\n}\n\nvoid KPixmapRegionSelectorWidget::setSelectedRegion(const QRect &rect)\n{\n if (!rect.isValid()) resetSelection();\n else \n {\n m_selectedRegion=rect;\n updatePixmap();\n\n QRect r=unzoomedSelectedRegion();\n }\n}\n\nvoid KPixmapRegionSelectorWidget::updatePixmap()\n{\n if (m_selectedRegion.width()>m_originalPixmap.width()) m_selectedRegion.setWidth( m_originalPixmap.width() );\n if (m_selectedRegion.height()>m_originalPixmap.height()) m_selectedRegion.setHeight( m_originalPixmap.height() );\n\n QPainter painter;\n if (m_linedPixmap.isNull())\n {\n m_linedPixmap = m_originalPixmap;\n\n painter.begin(&m_linedPixmap);\n painter.setRasterOp( Qt::XorROP );\n painter.fillRect(0,0,m_linedPixmap.width(), m_linedPixmap.height(), \n QBrush( QColor(255,255,255), Qt::BDiagPattern) );\n painter.end();\n\n QImage image=m_linedPixmap.convertToImage();\n image=KImageEffect::fade(image, 0.4, QColor(0,0,0));\n m_linedPixmap.convertFromImage(image);\n } \n\n QPixmap pixmap = m_linedPixmap;\n\n painter.begin(&pixmap);\n painter.drawPixmap( m_selectedRegion.topLeft(), \n m_originalPixmap, m_selectedRegion );\n\n painter.setPen( QColor(255,255,255) );\n painter.setRasterOp( Qt::XorROP );\n\n painter.drawRect( m_selectedRegion );\n\n painter.end();\n\n m_label->setPixmap(pixmap);\n}\n\nbool KPixmapRegionSelectorWidget::eventFilter(QObject *obj, QEvent *ev)\n{\n if ( ev->type() == QEvent::MouseButtonPress )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n \/\/kdDebug() << QString(\"click at %1,%2\").arg( mev->x() ).arg( mev->y() ) << endl;\n\n if ( m_selectedRegion.contains( mev->pos() ) \n && m_selectedRegion!=m_originalPixmap.rect() )\n m_state=Moving;\n else\n m_state=Resizing;\n\n m_tempFirstClick=mev->pos();\n\n return TRUE;\n }\n\n if ( ev->type() == QEvent::MouseMove )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n\n \/\/kdDebug() << QString(\"move to %1,%2\").arg( mev->x() ).arg( mev->y() ) << endl;\n \n if ( m_state == Resizing )\n {\n setSelectedRegion ( \n calcSelectionRectangle( m_tempFirstClick, mev->pos() ) );\n }\n else if (m_state == Moving )\n {\n int mevx = mev->x();\n int mevy = mev->y();\n bool mouseOutside=false;\n if ( mevx < 0 ) \n {\n m_selectedRegion.moveBy(-m_selectedRegion.x(),0);\n mouseOutside=true;\n }\n else if ( mevx > m_originalPixmap.width() )\n {\n m_selectedRegion.moveBy(m_originalPixmap.width()-m_selectedRegion.width()-m_selectedRegion.x(),0);\n mouseOutside=true;\n }\n if ( mevy < 0 ) \n {\n m_selectedRegion.moveBy(0,-m_selectedRegion.y());\n mouseOutside=true;\n }\n else if ( mevy > m_originalPixmap.height() )\n {\n m_selectedRegion.moveBy(0,m_originalPixmap.height()-m_selectedRegion.height()-m_selectedRegion.y());\n mouseOutside=true;\n }\n if (mouseOutside) { updatePixmap(); return TRUE; };\n\n m_selectedRegion.moveBy( mev->x()-m_tempFirstClick.x(),\n mev->y()-m_tempFirstClick.y() );\n\n \/\/ Check that the region has not fallen outside the image\n if (m_selectedRegion.x() < 0)\n m_selectedRegion.moveBy(-m_selectedRegion.x(),0);\n else if (m_selectedRegion.right() > m_originalPixmap.width())\n m_selectedRegion.moveBy(-(m_selectedRegion.right()-m_originalPixmap.width()),0); \n\n if (m_selectedRegion.y() < 0) \n m_selectedRegion.moveBy(0,-m_selectedRegion.y());\n else if (m_selectedRegion.bottom() > m_originalPixmap.height()) \n m_selectedRegion.moveBy(0,-(m_selectedRegion.bottom()-m_originalPixmap.height()));\n\n m_tempFirstClick=mev->pos();\n updatePixmap();\n } \n return TRUE;\n }\n\n if ( ev->type() == QEvent::MouseButtonRelease )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n\n if ( m_state == Resizing && mev->pos() == m_tempFirstClick)\n resetSelection();\n\n m_state=None;\n\n return TRUE;\n }\n\n QWidget::eventFilter(obj, ev);\n return FALSE;\n}\n\nQRect KPixmapRegionSelectorWidget::calcSelectionRectangle( const QPoint & startPoint, const QPoint & _endPoint )\n{\n QPoint endPoint = _endPoint;\n if ( endPoint.x() < 0 ) endPoint.setX(0);\n else if ( endPoint.x() > m_originalPixmap.width() ) endPoint.setX(m_originalPixmap.width());\n if ( endPoint.y() < 0 ) endPoint.setY(0);\n else if ( endPoint.y() > m_originalPixmap.height() ) endPoint.setY(m_originalPixmap.height());\n int w=abs(startPoint.x()-endPoint.x());\n int h=abs(startPoint.y()-endPoint.y());\n\n if (m_forcedAspectRatio>0)\n {\n double aspectRatio=w\/double(h);\n\n if (aspectRatio>m_forcedAspectRatio) \n h=(int)(w\/m_forcedAspectRatio);\n else\n w=(int)(h*m_forcedAspectRatio);\n }\n\n int x,y;\n if ( startPoint.x() < endPoint.x() )\n x=startPoint.x();\n else\n x=startPoint.x()-w;\n if ( startPoint.y() < endPoint.y() )\n y=startPoint.y();\n else\n y=startPoint.y()-h;\n\n if (x<0)\n {\n w+=x;\n x=0;\n h=(int)(w\/m_forcedAspectRatio);\n\n if ( startPoint.y() > endPoint.y() )\n y=startPoint.y()-h;\n }\n else if (x+w>m_originalPixmap.width())\n {\n w=m_originalPixmap.width()-x;\n h=(int)(w\/m_forcedAspectRatio);\n\n if ( startPoint.y() > endPoint.y() )\n y=startPoint.y()-h;\n }\n if (y<0)\n {\n h+=y;\n y=0;\n w=(int)(h*m_forcedAspectRatio);\n\n if ( startPoint.x() > endPoint.x() )\n x=startPoint.x()-w;\n }\n else if (y+h>m_originalPixmap.height())\n {\n h=m_originalPixmap.height()-y;\n w=(int)(h*m_forcedAspectRatio);\n\n if ( startPoint.x() > endPoint.x() )\n x=startPoint.x()-w;\n }\n\n return QRect(x,y,w,h);\n}\n\nQRect KPixmapRegionSelectorWidget::unzoomedSelectedRegion() const\n{\n return QRect((int)(m_selectedRegion.x()\/m_zoomFactor),\n (int)(m_selectedRegion.y()\/m_zoomFactor),\n (int)(m_selectedRegion.width()\/m_zoomFactor),\n (int)(m_selectedRegion.height()\/m_zoomFactor));\n}\n\nQImage KPixmapRegionSelectorWidget::selectedImage() const\n{\n QImage origImage=m_unzoomedPixmap.convertToImage();\n return origImage.copy(unzoomedSelectedRegion());\n}\n\nvoid KPixmapRegionSelectorWidget::setSelectionAspectRatio(int width, int height)\n{\n m_forcedAspectRatio=width\/double(height);\n}\n\nvoid KPixmapRegionSelectorWidget::setFreeSelectionAspectRatio()\n{\n m_forcedAspectRatio=0;\n}\n\nvoid KPixmapRegionSelectorWidget::setMaximumWidgetSize(int width, int height)\n{\n m_maxWidth=width;\n m_maxHeight=height;\n\n m_originalPixmap=m_unzoomedPixmap;\n if (m_selectedRegion == m_originalPixmap.rect()) m_selectedRegion=QRect();\n\n\/\/ kdDebug() << QString(\" original Pixmap :\") << m_originalPixmap.rect() << endl;\n\/\/ kdDebug() << QString(\" unzoomed Pixmap : %1 x %2 \").arg(m_unzoomedPixmap.width()).arg(m_unzoomedPixmap.height()) << endl;\n\n if ( !m_originalPixmap.isNull() &&\n ( m_originalPixmap.width() > m_maxWidth || \n m_originalPixmap.height() > m_maxHeight ) )\n {\n \/* We have to resize the pixmap to get it complete on the screen *\/\n QImage image=m_originalPixmap.convertToImage();\n m_originalPixmap.convertFromImage( image.smoothScale( width, height, QImage::ScaleMin ) );\n \/\/m_originalPixmap.convertFromImage( KImageEffect::sample( image, width, height ) );\n double oldZoomFactor = m_zoomFactor;\n m_zoomFactor=m_originalPixmap.width()\/(double)m_unzoomedPixmap.width();\n\n if (m_selectedRegion.isValid())\n {\n m_selectedRegion=\n QRect((int)(m_selectedRegion.x()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.y()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.width()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.height()*m_zoomFactor\/oldZoomFactor) );\n }\n }\n \n if (!m_selectedRegion.isValid()) m_selectedRegion = m_originalPixmap.rect();\n\n m_linedPixmap=QPixmap();\n updatePixmap();\n resize(m_label->width(), m_label->height());\n}\n\n<commit_msg>fix the layout<commit_after>\/* This file is part of the KDE libraries\n Copyright (C) 2004 Antonio Larrosa <larrosa@kde.org\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n*\/\n\n#include \"kpixmapregionselectorwidget.h\"\n#include <qpainter.h>\n#include <qcolor.h>\n#include <qimage.h>\n#include <qlayout.h>\n#include <kimageeffect.h>\n#include <kdebug.h>\n#include <stdlib.h>\n\nusing namespace KPIM;\n\nKPixmapRegionSelectorWidget::KPixmapRegionSelectorWidget( QWidget *parent, \n const char *name) : QWidget( parent, name)\n{\n QHBoxLayout * hboxLayout=new QHBoxLayout( this );\n \n hboxLayout->addStretch();\n QVBoxLayout * vboxLayout=new QVBoxLayout( hboxLayout );\n\n vboxLayout->addStretch();\n m_label = new QLabel(this, \"pixmapHolder\");\n m_label->setBackgroundMode( Qt::NoBackground );\n m_label->installEventFilter( this );\n\n vboxLayout->addWidget(m_label);\n vboxLayout->addStretch();\n\n hboxLayout->addStretch();\n\n m_forcedAspectRatio=0;\n\n m_zoomFactor=1.0;\n}\n\nKPixmapRegionSelectorWidget::~KPixmapRegionSelectorWidget()\n{\n}\n\nvoid KPixmapRegionSelectorWidget::setPixmap( const QPixmap &pixmap )\n{\n m_originalPixmap = pixmap;\n m_unzoomedPixmap = pixmap;\n m_label->setPixmap( pixmap );\n resetSelection();\n}\n\nvoid KPixmapRegionSelectorWidget::resetSelection()\n{\n m_selectedRegion = m_originalPixmap.rect();\n updatePixmap();\n}\n\nQRect KPixmapRegionSelectorWidget::selectedRegion() const\n{\n return m_selectedRegion;\n}\n\nvoid KPixmapRegionSelectorWidget::setSelectedRegion(const QRect &rect)\n{\n if (!rect.isValid()) resetSelection();\n else \n {\n m_selectedRegion=rect;\n updatePixmap();\n\n QRect r=unzoomedSelectedRegion();\n }\n}\n\nvoid KPixmapRegionSelectorWidget::updatePixmap()\n{\n if (m_selectedRegion.width()>m_originalPixmap.width()) m_selectedRegion.setWidth( m_originalPixmap.width() );\n if (m_selectedRegion.height()>m_originalPixmap.height()) m_selectedRegion.setHeight( m_originalPixmap.height() );\n\n QPainter painter;\n if (m_linedPixmap.isNull())\n {\n m_linedPixmap = m_originalPixmap;\n\n painter.begin(&m_linedPixmap);\n painter.setRasterOp( Qt::XorROP );\n painter.fillRect(0,0,m_linedPixmap.width(), m_linedPixmap.height(), \n QBrush( QColor(255,255,255), Qt::BDiagPattern) );\n painter.end();\n\n QImage image=m_linedPixmap.convertToImage();\n image=KImageEffect::fade(image, 0.4, QColor(0,0,0));\n m_linedPixmap.convertFromImage(image);\n } \n\n QPixmap pixmap = m_linedPixmap;\n\n painter.begin(&pixmap);\n painter.drawPixmap( m_selectedRegion.topLeft(), \n m_originalPixmap, m_selectedRegion );\n\n painter.setPen( QColor(255,255,255) );\n painter.setRasterOp( Qt::XorROP );\n\n painter.drawRect( m_selectedRegion );\n\n painter.end();\n\n m_label->setPixmap(pixmap);\n}\n\nbool KPixmapRegionSelectorWidget::eventFilter(QObject *obj, QEvent *ev)\n{\n if ( ev->type() == QEvent::MouseButtonPress )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n \/\/kdDebug() << QString(\"click at %1,%2\").arg( mev->x() ).arg( mev->y() ) << endl;\n\n if ( m_selectedRegion.contains( mev->pos() ) \n && m_selectedRegion!=m_originalPixmap.rect() )\n m_state=Moving;\n else\n m_state=Resizing;\n\n m_tempFirstClick=mev->pos();\n\n return TRUE;\n }\n\n if ( ev->type() == QEvent::MouseMove )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n\n \/\/kdDebug() << QString(\"move to %1,%2\").arg( mev->x() ).arg( mev->y() ) << endl;\n \n if ( m_state == Resizing )\n {\n setSelectedRegion ( \n calcSelectionRectangle( m_tempFirstClick, mev->pos() ) );\n }\n else if (m_state == Moving )\n {\n int mevx = mev->x();\n int mevy = mev->y();\n bool mouseOutside=false;\n if ( mevx < 0 ) \n {\n m_selectedRegion.moveBy(-m_selectedRegion.x(),0);\n mouseOutside=true;\n }\n else if ( mevx > m_originalPixmap.width() )\n {\n m_selectedRegion.moveBy(m_originalPixmap.width()-m_selectedRegion.width()-m_selectedRegion.x(),0);\n mouseOutside=true;\n }\n if ( mevy < 0 ) \n {\n m_selectedRegion.moveBy(0,-m_selectedRegion.y());\n mouseOutside=true;\n }\n else if ( mevy > m_originalPixmap.height() )\n {\n m_selectedRegion.moveBy(0,m_originalPixmap.height()-m_selectedRegion.height()-m_selectedRegion.y());\n mouseOutside=true;\n }\n if (mouseOutside) { updatePixmap(); return TRUE; };\n\n m_selectedRegion.moveBy( mev->x()-m_tempFirstClick.x(),\n mev->y()-m_tempFirstClick.y() );\n\n \/\/ Check that the region has not fallen outside the image\n if (m_selectedRegion.x() < 0)\n m_selectedRegion.moveBy(-m_selectedRegion.x(),0);\n else if (m_selectedRegion.right() > m_originalPixmap.width())\n m_selectedRegion.moveBy(-(m_selectedRegion.right()-m_originalPixmap.width()),0); \n\n if (m_selectedRegion.y() < 0) \n m_selectedRegion.moveBy(0,-m_selectedRegion.y());\n else if (m_selectedRegion.bottom() > m_originalPixmap.height()) \n m_selectedRegion.moveBy(0,-(m_selectedRegion.bottom()-m_originalPixmap.height()));\n\n m_tempFirstClick=mev->pos();\n updatePixmap();\n } \n return TRUE;\n }\n\n if ( ev->type() == QEvent::MouseButtonRelease )\n {\n QMouseEvent *mev= (QMouseEvent *)(ev);\n\n if ( m_state == Resizing && mev->pos() == m_tempFirstClick)\n resetSelection();\n\n m_state=None;\n\n return TRUE;\n }\n\n QWidget::eventFilter(obj, ev);\n return FALSE;\n}\n\nQRect KPixmapRegionSelectorWidget::calcSelectionRectangle( const QPoint & startPoint, const QPoint & _endPoint )\n{\n QPoint endPoint = _endPoint;\n if ( endPoint.x() < 0 ) endPoint.setX(0);\n else if ( endPoint.x() > m_originalPixmap.width() ) endPoint.setX(m_originalPixmap.width());\n if ( endPoint.y() < 0 ) endPoint.setY(0);\n else if ( endPoint.y() > m_originalPixmap.height() ) endPoint.setY(m_originalPixmap.height());\n int w=abs(startPoint.x()-endPoint.x());\n int h=abs(startPoint.y()-endPoint.y());\n\n if (m_forcedAspectRatio>0)\n {\n double aspectRatio=w\/double(h);\n\n if (aspectRatio>m_forcedAspectRatio) \n h=(int)(w\/m_forcedAspectRatio);\n else\n w=(int)(h*m_forcedAspectRatio);\n }\n\n int x,y;\n if ( startPoint.x() < endPoint.x() )\n x=startPoint.x();\n else\n x=startPoint.x()-w;\n if ( startPoint.y() < endPoint.y() )\n y=startPoint.y();\n else\n y=startPoint.y()-h;\n\n if (x<0)\n {\n w+=x;\n x=0;\n h=(int)(w\/m_forcedAspectRatio);\n\n if ( startPoint.y() > endPoint.y() )\n y=startPoint.y()-h;\n }\n else if (x+w>m_originalPixmap.width())\n {\n w=m_originalPixmap.width()-x;\n h=(int)(w\/m_forcedAspectRatio);\n\n if ( startPoint.y() > endPoint.y() )\n y=startPoint.y()-h;\n }\n if (y<0)\n {\n h+=y;\n y=0;\n w=(int)(h*m_forcedAspectRatio);\n\n if ( startPoint.x() > endPoint.x() )\n x=startPoint.x()-w;\n }\n else if (y+h>m_originalPixmap.height())\n {\n h=m_originalPixmap.height()-y;\n w=(int)(h*m_forcedAspectRatio);\n\n if ( startPoint.x() > endPoint.x() )\n x=startPoint.x()-w;\n }\n\n return QRect(x,y,w,h);\n}\n\nQRect KPixmapRegionSelectorWidget::unzoomedSelectedRegion() const\n{\n return QRect((int)(m_selectedRegion.x()\/m_zoomFactor),\n (int)(m_selectedRegion.y()\/m_zoomFactor),\n (int)(m_selectedRegion.width()\/m_zoomFactor),\n (int)(m_selectedRegion.height()\/m_zoomFactor));\n}\n\nQImage KPixmapRegionSelectorWidget::selectedImage() const\n{\n QImage origImage=m_unzoomedPixmap.convertToImage();\n return origImage.copy(unzoomedSelectedRegion());\n}\n\nvoid KPixmapRegionSelectorWidget::setSelectionAspectRatio(int width, int height)\n{\n m_forcedAspectRatio=width\/double(height);\n}\n\nvoid KPixmapRegionSelectorWidget::setFreeSelectionAspectRatio()\n{\n m_forcedAspectRatio=0;\n}\n\nvoid KPixmapRegionSelectorWidget::setMaximumWidgetSize(int width, int height)\n{\n m_maxWidth=width;\n m_maxHeight=height;\n\n m_originalPixmap=m_unzoomedPixmap;\n if (m_selectedRegion == m_originalPixmap.rect()) m_selectedRegion=QRect();\n\n\/\/ kdDebug() << QString(\" original Pixmap :\") << m_originalPixmap.rect() << endl;\n\/\/ kdDebug() << QString(\" unzoomed Pixmap : %1 x %2 \").arg(m_unzoomedPixmap.width()).arg(m_unzoomedPixmap.height()) << endl;\n\n if ( !m_originalPixmap.isNull() &&\n ( m_originalPixmap.width() > m_maxWidth || \n m_originalPixmap.height() > m_maxHeight ) )\n {\n \/* We have to resize the pixmap to get it complete on the screen *\/\n QImage image=m_originalPixmap.convertToImage();\n m_originalPixmap.convertFromImage( image.smoothScale( width, height, QImage::ScaleMin ) );\n \/\/m_originalPixmap.convertFromImage( KImageEffect::sample( image, width, height ) );\n double oldZoomFactor = m_zoomFactor;\n m_zoomFactor=m_originalPixmap.width()\/(double)m_unzoomedPixmap.width();\n\n if (m_selectedRegion.isValid())\n {\n m_selectedRegion=\n QRect((int)(m_selectedRegion.x()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.y()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.width()*m_zoomFactor\/oldZoomFactor),\n (int)(m_selectedRegion.height()*m_zoomFactor\/oldZoomFactor) );\n }\n }\n \n if (!m_selectedRegion.isValid()) m_selectedRegion = m_originalPixmap.rect();\n\n m_linedPixmap=QPixmap();\n updatePixmap();\n resize(m_label->width(), m_label->height());\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* interface header *\/\n#include \"WorldInfo.h\"\n\n\/* common implementation headers *\/\n#include \"global.h\"\n#include \"Pack.h\"\n#include \"Protocol.h\"\n\n\nWorldInfo::WorldInfo() :\n maxHeight(0),\n database(NULL)\n{\n size[0] = 400.0f;\n size[1] = 400.0f;\n gravity = -9.81f;\n}\n\nWorldInfo::~WorldInfo()\n{\n delete[] database;\n}\n\nvoid WorldInfo::addWall(float x, float y, float z, float r, float w, float h)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = walls.size();\n walls.resize(i+1);\n walls[i].pos[0] = x;\n walls[i].pos[1] = y;\n walls[i].pos[2] = z;\n walls[i].rotation = r;\n walls[i].size[0] = w;\n \/\/ no depth to walls\n walls[i].size[1] = 0.0f;\n walls[i].size[2] = h;\n}\n\nvoid WorldInfo::addBox(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = boxes.size();\n boxes.resize(i+1);\n boxes[i].pos[0] = x;\n boxes[i].pos[1] = y;\n boxes[i].pos[2] = z;\n boxes[i].rotation = r;\n boxes[i].size[0] = w;\n boxes[i].size[1] = d;\n boxes[i].size[2] = h;\n boxes[i].driveThrough = drive;\n boxes[i].shootThrough = shoot;\n}\n\nvoid WorldInfo::addPyramid(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot, bool flipZ)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = pyramids.size();\n pyramids.resize(i+1);\n pyramids[i].pos[0] = x;\n pyramids[i].pos[1] = y;\n pyramids[i].pos[2] = z;\n pyramids[i].rotation = r;\n pyramids[i].size[0] = w;\n pyramids[i].size[1] = d;\n pyramids[i].size[2] = h;\n pyramids[i].driveThrough = drive;\n pyramids[i].shootThrough = shoot;\n pyramids[i].flipZ = flipZ;\n}\n\nvoid WorldInfo::addTeleporter(float x, float y, float z, float r, float w, float d, float h, float b, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = teleporters.size();\n teleporters.resize(i+1);\n teleporters[i].pos[0] = x;\n teleporters[i].pos[1] = y;\n teleporters[i].pos[2] = z;\n teleporters[i].rotation = r;\n teleporters[i].size[0] = w;\n teleporters[i].size[1] = d;\n teleporters[i].size[2] = h;\n teleporters[i].driveThrough = drive;\n teleporters[i].shootThrough = shoot;\n teleporters[i].border = b;\n \/\/ default link through\n teleporters[i].to[0] = i * 2 + 1;\n teleporters[i].to[1] = i * 2;\n}\n\nvoid WorldInfo::addBase(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = bases.size();\n bases.resize(i+1);\n bases[i].pos[0] = x;\n bases[i].pos[1] = y;\n bases[i].pos[2] = z;\n bases[i].rotation = r;\n bases[i].size[0] = w;\n bases[i].size[1] = d;\n bases[i].size[2] = h;\n bases[i].driveThrough = drive;\n bases[i].shootThrough = shoot;\n}\n\nvoid WorldInfo::addLink(int from, int to)\n{\n \/\/ silently discard links from teleporters that don't exist\n if (unsigned(from) <= teleporters.size() * 2 + 1) {\n teleporters[from \/ 2].to[from % 2] = to;\n }\n}\n\nvoid WorldInfo::addZone(const CustomZone *zone)\n{\n entryZones.addZone( zone );\n}\n\nfloat WorldInfo::getMaxWorldHeight()\n{\n return maxHeight;\n}\n\nbool WorldInfo::rectHitCirc(float dx, float dy, const float *p, float r) const\n{\n \/\/ Algorithm from Graphics Gems, pp51-53.\n const float rr = r * r, rx = -p[0], ry = -p[1];\n if (rx + dx < 0.0f) \/\/ west of rect\n if (ry + dy < 0.0f) \/\/ sw corner\n return (rx + dx) * (rx + dx) + (ry + dy) * (ry + dy) < rr;\n else if (ry - dy > 0.0f) \/\/ nw corner\n return (rx + dx) * (rx + dx) + (ry - dy) * (ry - dy) < rr;\n else \/\/ due west\n return rx + dx > -r;\n\n else if (rx - dx > 0.0f) \/\/ east of rect\n if (ry + dy < 0.0f) \/\/ se corner\n return (rx - dx) * (rx - dx) + (ry + dy) * (ry + dy) < rr;\n else if (ry - dy > 0.0f) \/\/ ne corner\n return (rx - dx) * (rx - dx) + (ry - dy) * (ry - dy) < rr;\n else \/\/ due east\n return rx - dx < r;\n\n else if (ry + dy < 0.0f) \/\/ due south\n return ry + dy > -r;\n\n else if (ry - dy > 0.0f) \/\/ due north\n return ry - dy < r;\n\n \/\/ circle origin in rect\n return true;\n}\n\nbool WorldInfo::inRect(const float *p1, float angle, const float *size, float x, float y, float r) const\n{\n \/\/ translate origin\n float pa[2];\n pa[0] = x - p1[0];\n pa[1] = y - p1[1];\n\n \/\/ rotate\n float pb[2];\n const float c = cosf(-angle), s = sinf(-angle);\n pb[0] = c * pa[0] - s * pa[1];\n pb[1] = c * pa[1] + s * pa[0];\n\n \/\/ do test\n return rectHitCirc(size[0], size[1], pb, r);\n}\n\nInBuildingType WorldInfo::inBuilding(ObstacleLocation **location,\n\t\t\t\t float x, float y, float z, float r,\n\t\t\t\t float height)\n{\n ObstacleLocationList::iterator it;\n PyramidList::iterator pyrit;\n TeleporterList::iterator telit;\n\n for (it = bases.begin(); it != bases.end(); ++it) {\n ObstacleLocation &base = *it;\n if ((base.pos[2] < (z + height))\n\t&& ((base.pos[2] + base.size[2]) > z)\n\t&& (inRect(base.pos, base.rotation, base.size, x, y, r))) {\n if (location != NULL)\n\t*location = &base;\n return IN_BASE;\n }\n }\n for (it = boxes.begin(); it != boxes.end(); ++it) {\n ObstacleLocation &box = *it;\n if ((box.pos[2] < (z + height))\n\t&& ((box.pos[2] + box.size[2]) > z)\n\t&& (inRect(box.pos, box.rotation, box.size, x, y, r))) {\n if (location != NULL)\n\t*location = &box;\n if (box.driveThrough) return IN_BOX_DRIVETHROUGH;\n else return IN_BOX_NOTDRIVETHROUGH;\n }\n }\n for (pyrit = pyramids.begin(); pyrit != pyramids.end(); ++pyrit) {\n ObstacleLocation &pyr = *pyrit;\n if ((pyr.pos[2] < (z + height))\n\t&& ((pyr.pos[2] + pyr.size[2]) > z)\n\t&& (inRect(pyr.pos, pyr.rotation, pyr.size,x,y,r))) {\n if (location != NULL)\n\t*location = &pyr;\n return IN_PYRAMID;\n }\n }\n for (telit = teleporters.begin(); telit != teleporters.end(); ++telit) {\n Teleporter &tele = *telit;\n if ((tele.pos[2] < (z + height))\n\t&& ((tele.pos[2] + tele.size[2]) > z)\n\t&& (inRect(tele.pos, tele.rotation, tele.size, x, y, r))) {\n static ObstacleLocation __teleporter;\n __teleporter = tele;\n if (location != NULL)\n\t*location = &__teleporter;\n return IN_TELEPORTER;\n }\n }\n\n if (location != NULL)\n *location = (ObstacleLocation *)NULL;\n return NOT_IN_BUILDING;\n}\n\nbool WorldInfo::getZonePoint(const std::string &qualifier, float *pt)\n{\n return entryZones.getZonePoint(qualifier, pt);\n}\n\nvoid WorldInfo::finishWorld()\n{\n entryZones.calculateQualifierLists();\n}\n\nint WorldInfo::packDatabase()\n{\n databaseSize =\n (2 + 2 + WorldCodeWallSize) * walls.size() +\n (2 + 2 + WorldCodeBoxSize) * boxes.size() +\n (2 + 2 + WorldCodePyramidSize) * pyramids.size() +\n (2 + 2 + WorldCodeTeleporterSize) * teleporters.size() +\n (2 + 2 + WorldCodeLinkSize) * 2 * teleporters.size();\n database = new char[databaseSize];\n void *databasePtr = database;\n\n \/\/ define i out here so we avoid the loop variable scope debates\n ObstacleLocationList::iterator it;\n unsigned char\tbitMask;\n\n \/\/ add walls \n for (it = walls.begin(); it != walls.end(); ++it) {\n ObstacleLocation &wall = *it;\n databasePtr = nboPackUShort(databasePtr, WorldCodeWallSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeWall);\n databasePtr = nboPackVector(databasePtr, wall.pos);\n databasePtr = nboPackFloat(databasePtr, wall.rotation);\n databasePtr = nboPackFloat(databasePtr, wall.size[0]);\n \/\/ walls have no depth\n databasePtr = nboPackFloat(databasePtr, wall.size[2]);\n }\n\n \/\/ add boxes\n for (it = boxes.begin(); it != boxes.end(); ++it) {\n ObstacleLocation &box = *it;\n databasePtr = nboPackUShort(databasePtr, WorldCodeBoxSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeBox);\n databasePtr = nboPackVector(databasePtr, box.pos);\n databasePtr = nboPackFloat(databasePtr, box.rotation);\n databasePtr = nboPackVector(databasePtr, box.size);\n bitMask = 0;\n if (box.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (box.shootThrough)\n bitMask |= _SHOOT_THRU;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n }\n\n \/\/ add pyramids\n for (PyramidList::iterator pyr_it = pyramids.begin(); pyr_it != pyramids.end(); ++pyr_it) {\n Pyramid &pyr = *pyr_it;\n databasePtr = nboPackUShort(databasePtr, WorldCodePyramidSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodePyramid);\n databasePtr = nboPackVector(databasePtr, pyr.pos);\n databasePtr = nboPackFloat(databasePtr, pyr.rotation);\n databasePtr = nboPackVector(databasePtr, pyr.size);\n bitMask = 0;\n if (pyr.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (pyr.shootThrough)\n bitMask |= _SHOOT_THRU;\n if (pyr.flipZ)\n bitMask |= _FLIP_Z;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n }\n\n \/\/ add teleporters\n int i = 0;\n for (TeleporterList::iterator telit = teleporters.begin(); telit != teleporters.end(); ++telit, i++) {\n Teleporter &tele = *telit;\n databasePtr = nboPackUShort(databasePtr, WorldCodeTeleporterSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeTeleporter);\n databasePtr = nboPackVector(databasePtr, tele.pos);\n databasePtr = nboPackFloat(databasePtr, tele.rotation);\n databasePtr = nboPackVector(databasePtr, tele.size);\n databasePtr = nboPackFloat(databasePtr, tele.border);\n bitMask = 0;\n if (tele.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (tele.shootThrough)\n bitMask |= _SHOOT_THRU;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n \/\/ and each link\n databasePtr = nboPackUShort(databasePtr, WorldCodeLinkSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeLink);\n databasePtr = nboPackUShort(databasePtr, uint16_t(i * 2));\n databasePtr = nboPackUShort(databasePtr, uint16_t(tele.to[0]));\n databasePtr = nboPackUShort(databasePtr, WorldCodeLinkSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeLink);\n databasePtr = nboPackUShort(databasePtr, uint16_t(i * 2 + 1));\n databasePtr = nboPackUShort(databasePtr, uint16_t(tele.to[1]));\n }\n\n return 1;\n}\n\nvoid *WorldInfo::getDatabase() const\n{\n return database;\n}\n\nint WorldInfo::getDatabaseSize() const\n{\n return databaseSize;\n}\n\n\/\/ Local Variables: ***\n\/\/ mode: C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<commit_msg>doc open bug<commit_after>\/* bzflag\n * Copyright (c) 1993 - 2004 Tim Riker\n *\n * This package is free software; you can redistribute it and\/or\n * modify it under the terms of the license found in the file\n * named COPYING that should have accompanied this file.\n *\n * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR\n * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED\n * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n *\/\n\n\/* interface header *\/\n#include \"WorldInfo.h\"\n\n\/* common implementation headers *\/\n#include \"global.h\"\n#include \"Pack.h\"\n#include \"Protocol.h\"\n\n\nWorldInfo::WorldInfo() :\n maxHeight(0),\n database(NULL)\n{\n size[0] = 400.0f;\n size[1] = 400.0f;\n gravity = -9.81f;\n}\n\nWorldInfo::~WorldInfo()\n{\n delete[] database;\n}\n\nvoid WorldInfo::addWall(float x, float y, float z, float r, float w, float h)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = walls.size();\n walls.resize(i+1);\n walls[i].pos[0] = x;\n walls[i].pos[1] = y;\n walls[i].pos[2] = z;\n walls[i].rotation = r;\n walls[i].size[0] = w;\n \/\/ no depth to walls\n walls[i].size[1] = 0.0f;\n walls[i].size[2] = h;\n}\n\nvoid WorldInfo::addBox(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = boxes.size();\n boxes.resize(i+1);\n boxes[i].pos[0] = x;\n boxes[i].pos[1] = y;\n boxes[i].pos[2] = z;\n boxes[i].rotation = r;\n boxes[i].size[0] = w;\n boxes[i].size[1] = d;\n boxes[i].size[2] = h;\n boxes[i].driveThrough = drive;\n boxes[i].shootThrough = shoot;\n}\n\nvoid WorldInfo::addPyramid(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot, bool flipZ)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = pyramids.size();\n pyramids.resize(i+1);\n pyramids[i].pos[0] = x;\n pyramids[i].pos[1] = y;\n pyramids[i].pos[2] = z;\n pyramids[i].rotation = r;\n pyramids[i].size[0] = w;\n pyramids[i].size[1] = d;\n pyramids[i].size[2] = h;\n pyramids[i].driveThrough = drive;\n pyramids[i].shootThrough = shoot;\n pyramids[i].flipZ = flipZ;\n}\n\nvoid WorldInfo::addTeleporter(float x, float y, float z, float r, float w, float d, float h, float b, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = teleporters.size();\n teleporters.resize(i+1);\n teleporters[i].pos[0] = x;\n teleporters[i].pos[1] = y;\n teleporters[i].pos[2] = z;\n teleporters[i].rotation = r;\n teleporters[i].size[0] = w;\n teleporters[i].size[1] = d;\n teleporters[i].size[2] = h;\n teleporters[i].driveThrough = drive;\n teleporters[i].shootThrough = shoot;\n teleporters[i].border = b;\n \/\/ default link through\n teleporters[i].to[0] = i * 2 + 1;\n teleporters[i].to[1] = i * 2;\n}\n\nvoid WorldInfo::addBase(float x, float y, float z, float r, float w, float d, float h, bool drive, bool shoot)\n{\n if ((z + h) > maxHeight)\n maxHeight = z+h;\n\n int i = bases.size();\n bases.resize(i+1);\n bases[i].pos[0] = x;\n bases[i].pos[1] = y;\n bases[i].pos[2] = z;\n bases[i].rotation = r;\n bases[i].size[0] = w;\n bases[i].size[1] = d;\n bases[i].size[2] = h;\n bases[i].driveThrough = drive;\n bases[i].shootThrough = shoot;\n}\n\nvoid WorldInfo::addLink(int from, int to)\n{\n \/\/ silently discard links from teleporters that don't exist\n if (unsigned(from) <= teleporters.size() * 2 + 1) {\n teleporters[from \/ 2].to[from % 2] = to;\n }\n}\n\nvoid WorldInfo::addZone(const CustomZone *zone)\n{\n entryZones.addZone( zone );\n}\n\nfloat WorldInfo::getMaxWorldHeight()\n{\n return maxHeight;\n}\n\nbool WorldInfo::rectHitCirc(float dx, float dy, const float *p, float r) const\n{\n \/\/ Algorithm from Graphics Gems, pp51-53.\n const float rr = r * r, rx = -p[0], ry = -p[1];\n if (rx + dx < 0.0f) \/\/ west of rect\n if (ry + dy < 0.0f) \/\/ sw corner\n return (rx + dx) * (rx + dx) + (ry + dy) * (ry + dy) < rr;\n else if (ry - dy > 0.0f) \/\/ nw corner\n return (rx + dx) * (rx + dx) + (ry - dy) * (ry - dy) < rr;\n else \/\/ due west\n return rx + dx > -r;\n\n else if (rx - dx > 0.0f) \/\/ east of rect\n if (ry + dy < 0.0f) \/\/ se corner\n return (rx - dx) * (rx - dx) + (ry + dy) * (ry + dy) < rr;\n else if (ry - dy > 0.0f) \/\/ ne corner\n return (rx - dx) * (rx - dx) + (ry - dy) * (ry - dy) < rr;\n else \/\/ due east\n return rx - dx < r;\n\n else if (ry + dy < 0.0f) \/\/ due south\n return ry + dy > -r;\n\n else if (ry - dy > 0.0f) \/\/ due north\n return ry - dy < r;\n\n \/\/ circle origin in rect\n return true;\n}\n\nbool WorldInfo::inRect(const float *p1, float angle, const float *size, float x, float y, float r) const\n{\n \/\/ translate origin\n float pa[2];\n pa[0] = x - p1[0];\n pa[1] = y - p1[1];\n\n \/\/ rotate\n float pb[2];\n const float c = cosf(-angle), s = sinf(-angle);\n pb[0] = c * pa[0] - s * pa[1];\n pb[1] = c * pa[1] + s * pa[0];\n\n \/\/ do test\n return rectHitCirc(size[0], size[1], pb, r);\n}\n\nInBuildingType WorldInfo::inBuilding(ObstacleLocation **location,\n\t\t\t\t float x, float y, float z, float r,\n\t\t\t\t float height)\n{\n ObstacleLocationList::iterator it;\n PyramidList::iterator pyrit;\n TeleporterList::iterator telit;\n\n for (it = bases.begin(); it != bases.end(); ++it) {\n ObstacleLocation &base = *it;\n if ((base.pos[2] < (z + height))\n\t&& ((base.pos[2] + base.size[2]) > z)\n\t&& (inRect(base.pos, base.rotation, base.size, x, y, r))) {\n if (location != NULL)\n\t*location = &base;\n return IN_BASE;\n }\n }\n for (it = boxes.begin(); it != boxes.end(); ++it) {\n ObstacleLocation &box = *it;\n if ((box.pos[2] < (z + height))\n\t&& ((box.pos[2] + box.size[2]) > z)\n\t&& (inRect(box.pos, box.rotation, box.size, x, y, r))) {\n if (location != NULL)\n\t*location = &box;\n if (box.driveThrough) return IN_BOX_DRIVETHROUGH;\n else return IN_BOX_NOTDRIVETHROUGH;\n }\n }\n for (pyrit = pyramids.begin(); pyrit != pyramids.end(); ++pyrit) {\n ObstacleLocation &pyr = *pyrit;\n if ((pyr.pos[2] < (z + height))\n\t&& ((pyr.pos[2] + pyr.size[2]) > z)\n\t&& (inRect(pyr.pos, pyr.rotation, pyr.size,x,y,r))) {\n if (location != NULL)\n\t*location = &pyr;\n return IN_PYRAMID;\n }\n }\n for (telit = teleporters.begin(); telit != teleporters.end(); ++telit) {\n Teleporter &tele = *telit;\n if ((tele.pos[2] < (z + height))\n\t&& ((tele.pos[2] + tele.size[2]) > z)\n\t&& (inRect(tele.pos, tele.rotation, tele.size, x, y, r))) {\n static ObstacleLocation __teleporter;\n __teleporter = tele;\n if (location != NULL)\n\t*location = &__teleporter;\n return IN_TELEPORTER;\n }\n }\n\n if (location != NULL)\n *location = (ObstacleLocation *)NULL;\n return NOT_IN_BUILDING;\n}\n\nbool WorldInfo::getZonePoint(const std::string &qualifier, float *pt)\n{\n if (entryZones.getZonePoint(qualifier, pt))\n {\n \/\/BUG: modify pt so that it is on a building\n return true;\n }\n\n return false;\n}\n\nvoid WorldInfo::finishWorld()\n{\n entryZones.calculateQualifierLists();\n}\n\nint WorldInfo::packDatabase()\n{\n databaseSize =\n (2 + 2 + WorldCodeWallSize) * walls.size() +\n (2 + 2 + WorldCodeBoxSize) * boxes.size() +\n (2 + 2 + WorldCodePyramidSize) * pyramids.size() +\n (2 + 2 + WorldCodeTeleporterSize) * teleporters.size() +\n (2 + 2 + WorldCodeLinkSize) * 2 * teleporters.size();\n database = new char[databaseSize];\n void *databasePtr = database;\n\n \/\/ define i out here so we avoid the loop variable scope debates\n ObstacleLocationList::iterator it;\n unsigned char\tbitMask;\n\n \/\/ add walls \n for (it = walls.begin(); it != walls.end(); ++it) {\n ObstacleLocation &wall = *it;\n databasePtr = nboPackUShort(databasePtr, WorldCodeWallSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeWall);\n databasePtr = nboPackVector(databasePtr, wall.pos);\n databasePtr = nboPackFloat(databasePtr, wall.rotation);\n databasePtr = nboPackFloat(databasePtr, wall.size[0]);\n \/\/ walls have no depth\n databasePtr = nboPackFloat(databasePtr, wall.size[2]);\n }\n\n \/\/ add boxes\n for (it = boxes.begin(); it != boxes.end(); ++it) {\n ObstacleLocation &box = *it;\n databasePtr = nboPackUShort(databasePtr, WorldCodeBoxSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeBox);\n databasePtr = nboPackVector(databasePtr, box.pos);\n databasePtr = nboPackFloat(databasePtr, box.rotation);\n databasePtr = nboPackVector(databasePtr, box.size);\n bitMask = 0;\n if (box.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (box.shootThrough)\n bitMask |= _SHOOT_THRU;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n }\n\n \/\/ add pyramids\n for (PyramidList::iterator pyr_it = pyramids.begin(); pyr_it != pyramids.end(); ++pyr_it) {\n Pyramid &pyr = *pyr_it;\n databasePtr = nboPackUShort(databasePtr, WorldCodePyramidSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodePyramid);\n databasePtr = nboPackVector(databasePtr, pyr.pos);\n databasePtr = nboPackFloat(databasePtr, pyr.rotation);\n databasePtr = nboPackVector(databasePtr, pyr.size);\n bitMask = 0;\n if (pyr.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (pyr.shootThrough)\n bitMask |= _SHOOT_THRU;\n if (pyr.flipZ)\n bitMask |= _FLIP_Z;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n }\n\n \/\/ add teleporters\n int i = 0;\n for (TeleporterList::iterator telit = teleporters.begin(); telit != teleporters.end(); ++telit, i++) {\n Teleporter &tele = *telit;\n databasePtr = nboPackUShort(databasePtr, WorldCodeTeleporterSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeTeleporter);\n databasePtr = nboPackVector(databasePtr, tele.pos);\n databasePtr = nboPackFloat(databasePtr, tele.rotation);\n databasePtr = nboPackVector(databasePtr, tele.size);\n databasePtr = nboPackFloat(databasePtr, tele.border);\n bitMask = 0;\n if (tele.driveThrough)\n bitMask |= _DRIVE_THRU;\n if (tele.shootThrough)\n bitMask |= _SHOOT_THRU;\n databasePtr = nboPackUByte(databasePtr, bitMask);\n \/\/ and each link\n databasePtr = nboPackUShort(databasePtr, WorldCodeLinkSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeLink);\n databasePtr = nboPackUShort(databasePtr, uint16_t(i * 2));\n databasePtr = nboPackUShort(databasePtr, uint16_t(tele.to[0]));\n databasePtr = nboPackUShort(databasePtr, WorldCodeLinkSize);\n databasePtr = nboPackUShort(databasePtr, WorldCodeLink);\n databasePtr = nboPackUShort(databasePtr, uint16_t(i * 2 + 1));\n databasePtr = nboPackUShort(databasePtr, uint16_t(tele.to[1]));\n }\n\n return 1;\n}\n\nvoid *WorldInfo::getDatabase() const\n{\n return database;\n}\n\nint WorldInfo::getDatabaseSize() const\n{\n return databaseSize;\n}\n\n\/\/ Local Variables: ***\n\/\/ mode: C++ ***\n\/\/ tab-width: 8 ***\n\/\/ c-basic-offset: 2 ***\n\/\/ indent-tabs-mode: t ***\n\/\/ End: ***\n\/\/ ex: shiftwidth=2 tabstop=8\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- C++ -*-\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\/\/ Brad T. Aagaard, U.S. Geological Survey\n\/\/\n\/\/ This code was developed as part of the Computational Infrastructure\n\/\/ for Geodynamics (http:\/\/geodynamics.org).\n\/\/\n\/\/ Copyright (c) 2010-2016 University of California, Davis\n\/\/\n\/\/ See COPYING for license information.\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\n#include <portinfo>\n\n#include \"CSGeoProj.hh\" \/\/ implementation of class methods\n\n#include \"Projector.hh\" \/\/ USES Projector\n#include \"Converter.hh\" \/\/ USES Converter\n\n#include \"spatialdata\/utils\/LineParser.hh\" \/\/ USES LineParser\n\n#include <math.h> \/\/ USES M_PI, sin(), cos()\n#include <iostream> \/\/ USES std::istream, std::ostream\n\n#include <stdexcept> \/\/ USES std::runtime_error, std::exception\n#include <sstream> \/\/ USES std::ostringsgream\n#include <strings.h> \/\/ USES strcasecmp()\n#include <assert.h> \/\/ USES assert()\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Default constructor\nspatialdata::geocoords::CSGeoProj::CSGeoProj(void) :\n _originLon(0.0),\n _originLat(0.0),\n _originX(0.0),\n _originY(0.0),\n _rotAngle(0.0),\n _pProjector(0)\n{ \/\/ constructor\n} \/\/ constructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Default destructor\nspatialdata::geocoords::CSGeoProj::~CSGeoProj(void)\n{ \/\/ destructor\n delete _pProjector; _pProjector = 0;\n} \/\/ destructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Copy constructor\nspatialdata::geocoords::CSGeoProj::CSGeoProj(const CSGeoProj& cs) :\n CSGeo(cs),\n _originLon(cs._originLon),\n _originLat(cs._originLat),\n _originX(cs._originX),\n _originY(cs._originY),\n _rotAngle(cs._rotAngle),\n _pProjector(0)\n{ \/\/ copy constructor\n if (0 != cs._pProjector)\n _pProjector = new Projector(*cs._pProjector);\n} \/\/ copy constructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set projector.\nvoid\nspatialdata::geocoords::CSGeoProj::projector(const Projector& projector)\n{ \/\/ projector\n _pProjector = new Projector(projector);\n} \/\/ projector\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set origin of local projected coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::origin(const double lon,\n\t\t\t\t\t const double lat)\n{ \/\/ origin\n if (lon < -360.0 || lon > 360.0 || lat < -360.0 || lat > 360.0) {\n std::ostringstream msg;\n msg << \"Longitude (\" << lon << \") and latitude (\" << lat \n\t<< \") must be between in the range [-360.0, 360.0].\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n _originLon = lon;\n _originLat = lat;\n _originX = 0.0;\n _originY = 0.0;\n} \/\/ origin\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Get origin of local projected coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::origin(double* pLon,\n\t\t\t\t\t double* pLat)\n{ \/\/ origin\n assert(pLon);\n assert(pLat);\n \n *pLon = _originLon;\n *pLat = _originLat;\n} \/\/ origin\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set rotation angle (CCW from east) of local x axis.\nvoid\nspatialdata::geocoords::CSGeoProj::rotationAngle(const double angle)\n{ \/\/ rotationAngle\n if (angle < -360.0 || angle > 360.0) {\n std::ostringstream msg;\n msg << \"Rotation angle (\" << angle \n\t<< \") must be between in the range [-360.0, 360.0].\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n _rotAngle = angle;\n} \/\/ rotationAngle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Get rotation angle (CCW from east) of local x axis.\ndouble\nspatialdata::geocoords::CSGeoProj::rotationAngle(void) const\n{ \/\/ rotationAngle\n return _rotAngle;\n} \/\/ rotationAngle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Initialize the coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::initialize(void)\n{ \/\/ initialize\n CSGeo::initialize();\n \n assert(0 != _pProjector);\n _pProjector->initialize(*this);\n\n \/\/ Convert origin in lon\/lat to projected coordinate system.\n _originX = 0.0;\n _originY = 0.0;\n if (_originLon != 0.0 || _originLat != 0.0) {\n CSGeo csSrc;\n csSrc.ellipsoid(\"WGS84\");\n csSrc.datumHoriz(\"WGS84\");\n csSrc.datumVert(this->datumVert());\n csSrc.toMeters(this->toMeters());\n csSrc.setSpaceDim(2);\n csSrc.initialize();\n\n CSGeoProj csDest;\n csDest.ellipsoid(this->ellipsoid());\n csDest.datumHoriz(this->datumHoriz());\n csDest.datumVert(this->datumVert());\n csDest.toMeters(this->toMeters());\n csDest.setSpaceDim(2);\n assert(_pProjector);\n csDest.projector(*_pProjector);\n csDest.initialize();\n\n double originCoords[2] = { _originLon, _originLat };\n Converter::convert(originCoords, 1, 2, &csDest, &csSrc);\n _originX = originCoords[0];\n _originY = originCoords[1];\n } \/\/ if\n} \/\/ initialize\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Convert coordinates to PROJ4 useable form.\nvoid\nspatialdata::geocoords::CSGeoProj::toProjForm(double* coords,\n\t\t\t\t\t const int numLocs,\n\t\t\t\t\t const int numDims) const\n{ \/\/ toProjForm\n assert( (0 < numLocs && 0 != coords) ||\n\t (0 == numLocs && 0 == coords));\n assert(0 != _pProjector);\n if (numDims != spaceDim()) {\n std::ostringstream msg;\n msg\n << \"Number of spatial dimensions of coordinates (\"\n << numDims << \") does not match number of spatial dimensions (\"\n << spaceDim() << \") of coordinate system.\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n const double angleRad = M_PI * _rotAngle \/ 180.0;\n for (int i=0; i < numLocs; ++i) {\n const double xOld = coords[i*numDims ];\n const double yOld = coords[i*numDims+1];\n\n coords[i*numDims ] = _originX + cos(angleRad)*xOld - sin(angleRad)*yOld;\n coords[i*numDims+1] = _originY + sin(angleRad)*xOld + cos(angleRad)*yOld;\n } \/\/ for\n\n _pProjector->invproject(coords, numLocs, numDims);\n CSGeo::toProjForm(coords, numLocs, numDims);\n} \/\/ toProjForm\n \n\/\/ ----------------------------------------------------------------------\n\/\/ Convert coordinates from PROJ4 form to form associated w\/coordsys.\nvoid\nspatialdata::geocoords::CSGeoProj::fromProjForm(double* coords,\n\t\t\t\t\t\tconst int numLocs,\n\t\t\t\t\t\tconst int numDims) const\n{ \/\/ fromProjForm\n assert( (0 < numLocs && 0 != coords) ||\n\t (0 == numLocs && 0 == coords));\n assert(0 != _pProjector);\n if (numDims != spaceDim()) {\n std::ostringstream msg;\n msg\n << \"Number of spatial dimensions of coordinates (\"\n << numDims << \") does not match number of spatial dimensions (\"\n << spaceDim() << \") of coordinate system.\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n CSGeo::fromProjForm(coords, numLocs, numDims);\n _pProjector->project(coords, numLocs, numDims);\n\n const double angleRad = M_PI * _rotAngle \/ 180.0;\n for (int i=0; i < numLocs; ++i) {\n const double xRel = coords[i*numDims ] - _originX;\n const double yRel = coords[i*numDims+1] - _originY;\n\n coords[i*numDims ] = cos(angleRad)*xRel + sin(angleRad)*yRel;\n coords[i*numDims+1] = -sin(angleRad)*xRel + cos(angleRad)*yRel;\n } \/\/ for\n} \/\/ fromProjForm\n \n\/\/ ----------------------------------------------------------------------\n\/\/ Pickle coordinate system to ascii stream.\nvoid\nspatialdata::geocoords::CSGeoProj::pickle(std::ostream& s) const\n{ \/\/ pickle\n s << \"geo-projected {\\n\"\n << \" to-meters = \" << toMeters() << \"\\n\"\n << \" ellipsoid = \" << ellipsoid() << \"\\n\"\n << \" datum-horiz = \" << datumHoriz() << \"\\n\"\n << \" datum-vert = \" << datumVert() << \"\\n\"\n << \" origin-lon = \" << _originLon << \"\\n\"\n << \" origin-lat = \" << _originLat << \"\\n\"\n << \" rotation-angle = \" << rotationAngle() << \"\\n\"\n << \" projector = \";\n _pProjector->pickle(s);\n s << \"}\\n\";\n} \/\/ pickle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Unpickle coordinate system from ascii stream.\nvoid \nspatialdata::geocoords::CSGeoProj::unpickle(std::istream& s)\n{ \/\/ unpickle\n utils::LineParser parser(s, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::string token;\n std::istringstream buffer;\n const int maxIgnore = 256;\n char cbuffer[maxIgnore];\n double val;\n std::string name;\n\n parser.ignore('{');\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n while (buffer.good() && token != \"}\") {\n buffer.ignore(maxIgnore, '=');\n if (0 == strcasecmp(token.c_str(), \"to-meters\")) {\n buffer >> val;\n toMeters(val);\n } else if (0 == strcasecmp(token.c_str(), \"ellipsoid\")) {\n buffer >> name;\n ellipsoid(name.c_str());\n } else if (0 == strcasecmp(token.c_str(), \"datum-horiz\")) {\n buffer >> std::ws;\n buffer.get(cbuffer, maxIgnore, '\\n');\n datumHoriz(cbuffer);\n } else if (0 == strcasecmp(token.c_str(), \"datum-vert\")) {\n buffer >> std::ws;\n buffer.get(cbuffer, maxIgnore, '\\n');\n datumVert(cbuffer);\n } else if (0 == strcasecmp(token.c_str(), \"origin-lon\")) {\n buffer >> _originLon;\n } else if (0 == strcasecmp(token.c_str(), \"origin-lat\")) {\n buffer >> _originLat;\n } else if (0 == strcasecmp(token.c_str(), \"rotation-angle\")) {\n buffer >> _rotAngle;\n } else if (0 == strcasecmp(token.c_str(), \"projector\")) {\n std::string rbuffer(buffer.str());\n int start = token.length();\n int end = rbuffer.length();\n for (int i=start; i < end; ++i)\n\tif ('=' == rbuffer[i])\n\t start = i+1;\n for (int i=end-1; i >= start; --i) {\n\ts.putback(rbuffer[i]);\n } \/\/ for\n s.clear();\n if (0 == _pProjector)\n\t_pProjector = new Projector;\n _pProjector->unpickle(s);\n } else {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into a CSGeoProj token.\\n\"\n\t << \"Known CSGeoProj token:\\n\"\n\t << \" to-meters, ellipsoid, datum-horiz, datum-vert, projector\\n\";\n throw std::runtime_error(msg.str().c_str());\n } \/\/ else\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n } \/\/ while\n if (token != \"}\")\n throw std::runtime_error(\"I\/O error while parsing CSGeoProj \"\n\t\t\t \"settings.\");\n} \/\/ unpickle\n\n\n\/\/ End of file \n<commit_msg>Fixed bug in parsing projected coordinate system.<commit_after>\/\/ -*- C++ -*-\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\/\/ Brad T. Aagaard, U.S. Geological Survey\n\/\/\n\/\/ This code was developed as part of the Computational Infrastructure\n\/\/ for Geodynamics (http:\/\/geodynamics.org).\n\/\/\n\/\/ Copyright (c) 2010-2016 University of California, Davis\n\/\/\n\/\/ See COPYING for license information.\n\/\/\n\/\/ ----------------------------------------------------------------------\n\/\/\n\n#include <portinfo>\n\n#include \"CSGeoProj.hh\" \/\/ implementation of class methods\n\n#include \"Projector.hh\" \/\/ USES Projector\n#include \"Converter.hh\" \/\/ USES Converter\n\n#include \"spatialdata\/utils\/LineParser.hh\" \/\/ USES LineParser\n\n#include <math.h> \/\/ USES M_PI, sin(), cos()\n#include <iostream> \/\/ USES std::istream, std::ostream\n\n#include <stdexcept> \/\/ USES std::runtime_error, std::exception\n#include <sstream> \/\/ USES std::ostringsgream\n#include <strings.h> \/\/ USES strcasecmp()\n#include <assert.h> \/\/ USES assert()\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Default constructor\nspatialdata::geocoords::CSGeoProj::CSGeoProj(void) :\n _originLon(0.0),\n _originLat(0.0),\n _originX(0.0),\n _originY(0.0),\n _rotAngle(0.0),\n _pProjector(0)\n{ \/\/ constructor\n} \/\/ constructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Default destructor\nspatialdata::geocoords::CSGeoProj::~CSGeoProj(void)\n{ \/\/ destructor\n delete _pProjector; _pProjector = 0;\n} \/\/ destructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Copy constructor\nspatialdata::geocoords::CSGeoProj::CSGeoProj(const CSGeoProj& cs) :\n CSGeo(cs),\n _originLon(cs._originLon),\n _originLat(cs._originLat),\n _originX(cs._originX),\n _originY(cs._originY),\n _rotAngle(cs._rotAngle),\n _pProjector(0)\n{ \/\/ copy constructor\n if (0 != cs._pProjector)\n _pProjector = new Projector(*cs._pProjector);\n} \/\/ copy constructor\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set projector.\nvoid\nspatialdata::geocoords::CSGeoProj::projector(const Projector& projector)\n{ \/\/ projector\n _pProjector = new Projector(projector);\n} \/\/ projector\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set origin of local projected coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::origin(const double lon,\n\t\t\t\t\t const double lat)\n{ \/\/ origin\n if (lon < -360.0 || lon > 360.0 || lat < -360.0 || lat > 360.0) {\n std::ostringstream msg;\n msg << \"Longitude (\" << lon << \") and latitude (\" << lat \n\t<< \") must be between in the range [-360.0, 360.0].\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n _originLon = lon;\n _originLat = lat;\n _originX = 0.0;\n _originY = 0.0;\n} \/\/ origin\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Get origin of local projected coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::origin(double* pLon,\n\t\t\t\t\t double* pLat)\n{ \/\/ origin\n assert(pLon);\n assert(pLat);\n \n *pLon = _originLon;\n *pLat = _originLat;\n} \/\/ origin\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Set rotation angle (CCW from east) of local x axis.\nvoid\nspatialdata::geocoords::CSGeoProj::rotationAngle(const double angle)\n{ \/\/ rotationAngle\n if (angle < -360.0 || angle > 360.0) {\n std::ostringstream msg;\n msg << \"Rotation angle (\" << angle \n\t<< \") must be between in the range [-360.0, 360.0].\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n _rotAngle = angle;\n} \/\/ rotationAngle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Get rotation angle (CCW from east) of local x axis.\ndouble\nspatialdata::geocoords::CSGeoProj::rotationAngle(void) const\n{ \/\/ rotationAngle\n return _rotAngle;\n} \/\/ rotationAngle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Initialize the coordinate system.\nvoid\nspatialdata::geocoords::CSGeoProj::initialize(void)\n{ \/\/ initialize\n CSGeo::initialize();\n \n assert(0 != _pProjector);\n _pProjector->initialize(*this);\n\n \/\/ Convert origin in lon\/lat to projected coordinate system.\n _originX = 0.0;\n _originY = 0.0;\n if (_originLon != 0.0 || _originLat != 0.0) {\n CSGeo csSrc;\n csSrc.ellipsoid(\"WGS84\");\n csSrc.datumHoriz(\"WGS84\");\n csSrc.datumVert(this->datumVert());\n csSrc.toMeters(this->toMeters());\n csSrc.setSpaceDim(2);\n csSrc.initialize();\n\n CSGeoProj csDest;\n csDest.ellipsoid(this->ellipsoid());\n csDest.datumHoriz(this->datumHoriz());\n csDest.datumVert(this->datumVert());\n csDest.toMeters(this->toMeters());\n csDest.setSpaceDim(2);\n assert(_pProjector);\n csDest.projector(*_pProjector);\n csDest.initialize();\n\n double originCoords[2] = { _originLon, _originLat };\n Converter::convert(originCoords, 1, 2, &csDest, &csSrc);\n _originX = originCoords[0];\n _originY = originCoords[1];\n } \/\/ if\n} \/\/ initialize\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Convert coordinates to PROJ4 useable form.\nvoid\nspatialdata::geocoords::CSGeoProj::toProjForm(double* coords,\n\t\t\t\t\t const int numLocs,\n\t\t\t\t\t const int numDims) const\n{ \/\/ toProjForm\n assert( (0 < numLocs && 0 != coords) ||\n\t (0 == numLocs && 0 == coords));\n assert(0 != _pProjector);\n if (numDims != spaceDim()) {\n std::ostringstream msg;\n msg\n << \"Number of spatial dimensions of coordinates (\"\n << numDims << \") does not match number of spatial dimensions (\"\n << spaceDim() << \") of coordinate system.\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n const double angleRad = M_PI * _rotAngle \/ 180.0;\n for (int i=0; i < numLocs; ++i) {\n const double xOld = coords[i*numDims ];\n const double yOld = coords[i*numDims+1];\n\n coords[i*numDims ] = _originX + cos(angleRad)*xOld - sin(angleRad)*yOld;\n coords[i*numDims+1] = _originY + sin(angleRad)*xOld + cos(angleRad)*yOld;\n } \/\/ for\n\n _pProjector->invproject(coords, numLocs, numDims);\n CSGeo::toProjForm(coords, numLocs, numDims);\n} \/\/ toProjForm\n \n\/\/ ----------------------------------------------------------------------\n\/\/ Convert coordinates from PROJ4 form to form associated w\/coordsys.\nvoid\nspatialdata::geocoords::CSGeoProj::fromProjForm(double* coords,\n\t\t\t\t\t\tconst int numLocs,\n\t\t\t\t\t\tconst int numDims) const\n{ \/\/ fromProjForm\n assert( (0 < numLocs && 0 != coords) ||\n\t (0 == numLocs && 0 == coords));\n assert(0 != _pProjector);\n if (numDims != spaceDim()) {\n std::ostringstream msg;\n msg\n << \"Number of spatial dimensions of coordinates (\"\n << numDims << \") does not match number of spatial dimensions (\"\n << spaceDim() << \") of coordinate system.\";\n throw std::runtime_error(msg.str());\n } \/\/ if\n\n CSGeo::fromProjForm(coords, numLocs, numDims);\n _pProjector->project(coords, numLocs, numDims);\n\n const double angleRad = M_PI * _rotAngle \/ 180.0;\n for (int i=0; i < numLocs; ++i) {\n const double xRel = coords[i*numDims ] - _originX;\n const double yRel = coords[i*numDims+1] - _originY;\n\n coords[i*numDims ] = cos(angleRad)*xRel + sin(angleRad)*yRel;\n coords[i*numDims+1] = -sin(angleRad)*xRel + cos(angleRad)*yRel;\n } \/\/ for\n} \/\/ fromProjForm\n \n\/\/ ----------------------------------------------------------------------\n\/\/ Pickle coordinate system to ascii stream.\nvoid\nspatialdata::geocoords::CSGeoProj::pickle(std::ostream& s) const\n{ \/\/ pickle\n s << \"geo-projected {\\n\"\n << \" to-meters = \" << toMeters() << \"\\n\"\n << \" ellipsoid = \" << ellipsoid() << \"\\n\"\n << \" datum-horiz = \" << datumHoriz() << \"\\n\"\n << \" datum-vert = \" << datumVert() << \"\\n\"\n << \" origin-lon = \" << _originLon << \"\\n\"\n << \" origin-lat = \" << _originLat << \"\\n\"\n << \" rotation-angle = \" << rotationAngle() << \"\\n\"\n << \" projector = \";\n _pProjector->pickle(s);\n s << \"}\\n\";\n} \/\/ pickle\n\n\/\/ ----------------------------------------------------------------------\n\/\/ Unpickle coordinate system from ascii stream.\nvoid \nspatialdata::geocoords::CSGeoProj::unpickle(std::istream& s)\n{ \/\/ unpickle\n utils::LineParser parser(s, \"\/\/\");\n parser.eatwhitespace(true);\n\n std::string token;\n std::istringstream buffer;\n const int maxIgnore = 256;\n char cbuffer[maxIgnore];\n double val;\n std::string name;\n\n parser.ignore('{');\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n while (buffer.good() && token != \"}\") {\n buffer.ignore(maxIgnore, '=');\n if (0 == strcasecmp(token.c_str(), \"to-meters\")) {\n buffer >> val;\n toMeters(val);\n } else if (0 == strcasecmp(token.c_str(), \"ellipsoid\")) {\n buffer >> name;\n ellipsoid(name.c_str());\n } else if (0 == strcasecmp(token.c_str(), \"datum-horiz\")) {\n buffer >> std::ws;\n buffer.get(cbuffer, maxIgnore, '\\n');\n datumHoriz(cbuffer);\n } else if (0 == strcasecmp(token.c_str(), \"datum-vert\")) {\n buffer >> std::ws;\n buffer.get(cbuffer, maxIgnore, '\\n');\n datumVert(cbuffer);\n } else if (0 == strcasecmp(token.c_str(), \"origin-lon\")) {\n buffer >> _originLon;\n } else if (0 == strcasecmp(token.c_str(), \"origin-lat\")) {\n buffer >> _originLat;\n } else if (0 == strcasecmp(token.c_str(), \"rotation-angle\")) {\n buffer >> _rotAngle;\n } else if (0 == strcasecmp(token.c_str(), \"projector\")) {\n std::string rbuffer(buffer.str());\n s.putback('\\n');\n s.clear();\n int i = rbuffer.length()-1;\n while (i >= 0) {\n\ts.putback(rbuffer[i]);\n\tif ('=' == rbuffer[i--])\n\t break;\n } \/\/ while\n s.clear();\n if (0 == _pProjector)\n\t_pProjector = new Projector;\n _pProjector->unpickle(s);\n } else {\n std::ostringstream msg;\n msg << \"Could not parse '\" << token << \"' into a CSGeoProj token.\\n\"\n\t << \"Known CSGeoProj token:\\n\"\n\t << \" to-meters, ellipsoid, datum-horiz, datum-vert, projector\\n\";\n throw std::runtime_error(msg.str().c_str());\n } \/\/ else\n buffer.str(parser.next());\n buffer.clear();\n buffer >> token;\n } \/\/ while\n if (token != \"}\")\n throw std::runtime_error(\"I\/O error while parsing CSGeoProj \"\n\t\t\t \"settings.\");\n} \/\/ unpickle\n\n\n\/\/ End of file \n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the demonstration applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include \"qdeclarativeengine.h\"\n#include \"qdeclarativecontext.h\"\n#include \"qdeclarative.h\"\n#include <qdeclarativeitem.h>\n#include <qdeclarativeview.h>\n\n#include <QWidget>\n#include <QApplication>\n#include <QFile>\n#include <QTime>\n#include <QTimer>\n#include <QVBoxLayout>\n#include <QFileInfo>\n\nQString fileName = \"minehunt.qml\";\n\nclass Tile : public QObject\n{\n Q_OBJECT\npublic:\n Tile() : _hasFlag(false), _hasMine(false), _hint(-1), _flipped(false) {}\n\n Q_PROPERTY(bool hasFlag READ hasFlag WRITE setHasFlag NOTIFY hasFlagChanged);\n bool hasFlag() const { return _hasFlag; }\n\n Q_PROPERTY(bool hasMine READ hasMine NOTIFY hasMineChanged);\n bool hasMine() const { return _hasMine; }\n\n Q_PROPERTY(int hint READ hint NOTIFY hintChanged);\n int hint() const { return _hint; }\n\n Q_PROPERTY(bool flipped READ flipped NOTIFY flippedChanged());\n bool flipped() const { return _flipped; }\n\n void setHasFlag(bool flag) {if(flag==_hasFlag) return; _hasFlag = flag; emit hasFlagChanged();}\n void setHasMine(bool mine) {if(mine==_hasMine) return; _hasMine = mine; emit hasMineChanged();}\n void setHint(int hint) { if(hint == _hint) return; _hint = hint; emit hintChanged(); }\n void flip() { if (_flipped) return; _flipped = true; emit flippedChanged(); }\n void unflip() { if(!_flipped) return; _flipped = false; emit flippedChanged(); }\n\nsignals:\n void flippedChanged();\n void hasFlagChanged();\n void hintChanged();\n void hasMineChanged();\n\nprivate:\n bool _hasFlag;\n bool _hasMine;\n int _hint;\n bool _flipped;\n};\n\nQML_DECLARE_TYPE(Tile);\n\nclass MyWidget : public QWidget\n{\nQ_OBJECT\npublic:\n MyWidget(int = 370, int = 480, QWidget *parent=0, Qt::WindowFlags flags=0);\n ~MyWidget();\n\n Q_PROPERTY(QList<Tile *> *tiles READ tiles CONSTANT);\n QList<Tile *> *tiles() { return &_tiles; }\n\n Q_PROPERTY(bool isPlaying READ isPlaying NOTIFY isPlayingChanged);\n bool isPlaying() {return playing;}\n\n Q_PROPERTY(bool hasWon READ hasWon NOTIFY hasWonChanged);\n bool hasWon() {return won;}\n\n Q_PROPERTY(int numMines READ numMines NOTIFY numMinesChanged);\n int numMines() const{return nMines;}\n\n Q_PROPERTY(int numFlags READ numFlags NOTIFY numFlagsChanged);\n int numFlags() const{return nFlags;}\n\npublic slots:\n Q_INVOKABLE void flip(int row, int col);\n Q_INVOKABLE void flag(int row, int col);\n void setBoard();\n void reset();\n\nsignals:\n void isPlayingChanged();\n void hasWonChanged();\n void numMinesChanged();\n void numFlagsChanged();\n\nprivate:\n bool onBoard( int r, int c ) const { return r >= 0 && r < numRows && c >= 0 && c < numCols; }\n Tile *tile( int row, int col ) { return onBoard(row, col) ? _tiles[col+numRows*row] : 0; }\n int getHint(int row, int col);\n void setPlaying(bool b){if(b==playing) return; playing=b; emit isPlayingChanged();}\n\n QDeclarativeView *canvas;\n\n QList<Tile *> _tiles;\n int numCols;\n int numRows;\n bool playing;\n bool won;\n int remaining;\n int nMines;\n int nFlags;\n};\n\nMyWidget::MyWidget(int width, int height, QWidget *parent, Qt::WindowFlags flags)\n: QWidget(parent, flags), canvas(0), numCols(9), numRows(9), playing(true), won(false)\n{\n setObjectName(\"mainWidget\");\n srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n \/\/initialize array\n for(int ii = 0; ii < numRows * numCols; ++ii) {\n _tiles << new Tile;\n }\n\n reset();\n\n QVBoxLayout *vbox = new QVBoxLayout;\n vbox->setMargin(0);\n setLayout(vbox);\n\n canvas = new QDeclarativeView(this);\n canvas->setFixedSize(width, height);\n vbox->addWidget(canvas);\n\n QDeclarativeContext *ctxt = canvas->rootContext();\n ctxt->addDefaultObject(this);\n ctxt->setContextProperty(\"tiles\", QVariant::fromValue<QList<Tile*>*>(&_tiles));\/\/QTBUG-5675\n\n canvas->setSource(QUrl::fromLocalFile(fileName));\n}\n\nMyWidget::~MyWidget()\n{\n}\n\nvoid MyWidget::setBoard()\n{\n foreach(Tile* t, _tiles){\n t->setHasMine(false);\n t->setHint(-1);\n }\n \/\/place mines\n int mines = nMines;\n remaining = numRows*numCols-mines;\n while ( mines ) {\n int col = int((double(rand()) \/ double(RAND_MAX)) * numCols);\n int row = int((double(rand()) \/ double(RAND_MAX)) * numRows);\n\n Tile* t = tile( row, col );\n\n if (t && !t->hasMine()) {\n t->setHasMine( true );\n mines--;\n }\n }\n\n \/\/set hints\n for (int r = 0; r < numRows; r++)\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && !t->hasMine()) {\n int hint = getHint(r,c);\n t->setHint(hint);\n }\n }\n\n setPlaying(true);\n}\n\nvoid MyWidget::reset()\n{\n foreach(Tile* t, _tiles){\n t->unflip();\n t->setHasFlag(false);\n }\n nMines = 12;\n nFlags = 0;\n setPlaying(false);\n QTimer::singleShot(600,this, SLOT(setBoard()));\n}\n\nint MyWidget::getHint(int row, int col)\n{\n int hint = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine())\n hint++;\n }\n return hint;\n}\n\nvoid MyWidget::flip(int row, int col)\n{\n if(!playing)\n return;\n\n Tile *t = tile(row, col);\n if (!t || t->hasFlag())\n return;\n\n if(t->flipped()){\n int flags = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if(!nearT || nearT == t)\n continue;\n if(nearT->hasFlag())\n flags++;\n }\n if(!t->hint() || t->hint() != flags)\n return;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if (nearT && !nearT->flipped() && !nearT->hasFlag()) {\n flip( r, c );\n }\n }\n return;\n }\n\n t->flip();\n\n if (t->hint() == 0) {\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && !t->flipped()) {\n flip( r, c );\n }\n }\n }\n\n if(t->hasMine()){\n for (int r = 0; r < numRows; r++)\/\/Flip all other mines\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine()) {\n flip(r, c);\n }\n }\n won = false;\n hasWonChanged();\n setPlaying(false);\n }\n\n remaining--;\n if(!remaining){\n won = true;\n hasWonChanged();\n setPlaying(false);\n }\n}\n\nvoid MyWidget::flag(int row, int col)\n{\n Tile *t = tile(row, col);\n if(!t)\n return;\n\n t->setHasFlag(!t->hasFlag());\n nFlags += (t->hasFlag()?1:-1);\n emit numFlagsChanged();\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char ** argv)\n{\n QApplication app(argc, argv);\n\n bool frameless = false;\n\n int width = 370;\n int height = 480;\n\n QML_REGISTER_TYPE(0,0,0,Tile,Tile);\n\n for (int i = 1; i < argc; ++i) {\n QString arg = argv[i];\n if (arg == \"-frameless\") {\n frameless = true;\n } else if(arg == \"-width\" && i < (argc - 1)) {\n ++i;\n width = ::atoi(argv[i]);\n } else if(arg == \"-height\" && i < (argc - 1)) {\n ++i;\n height = ::atoi(argv[i]);\n } else if (arg[0] != '-') {\n fileName = arg;\n }\n }\n\n MyWidget wid(width, height, 0, frameless ? Qt::FramelessWindowHint : Qt::Widget);\n wid.show();\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<commit_msg>Make Minehunt demo compile.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the demonstration applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include \"qdeclarativeengine.h\"\n#include \"qdeclarativecontext.h\"\n#include \"qdeclarative.h\"\n#include <qdeclarativeitem.h>\n#include <qdeclarativeview.h>\n\n#include <QWidget>\n#include <QApplication>\n#include <QFile>\n#include <QTime>\n#include <QTimer>\n#include <QVBoxLayout>\n#include <QFileInfo>\n\nQString fileName = \"minehunt.qml\";\n\nclass Tile : public QObject\n{\n Q_OBJECT\npublic:\n Tile() : _hasFlag(false), _hasMine(false), _hint(-1), _flipped(false) {}\n\n Q_PROPERTY(bool hasFlag READ hasFlag WRITE setHasFlag NOTIFY hasFlagChanged);\n bool hasFlag() const { return _hasFlag; }\n\n Q_PROPERTY(bool hasMine READ hasMine NOTIFY hasMineChanged);\n bool hasMine() const { return _hasMine; }\n\n Q_PROPERTY(int hint READ hint NOTIFY hintChanged);\n int hint() const { return _hint; }\n\n Q_PROPERTY(bool flipped READ flipped NOTIFY flippedChanged());\n bool flipped() const { return _flipped; }\n\n void setHasFlag(bool flag) {if(flag==_hasFlag) return; _hasFlag = flag; emit hasFlagChanged();}\n void setHasMine(bool mine) {if(mine==_hasMine) return; _hasMine = mine; emit hasMineChanged();}\n void setHint(int hint) { if(hint == _hint) return; _hint = hint; emit hintChanged(); }\n void flip() { if (_flipped) return; _flipped = true; emit flippedChanged(); }\n void unflip() { if(!_flipped) return; _flipped = false; emit flippedChanged(); }\n\nsignals:\n void flippedChanged();\n void hasFlagChanged();\n void hintChanged();\n void hasMineChanged();\n\nprivate:\n bool _hasFlag;\n bool _hasMine;\n int _hint;\n bool _flipped;\n};\n\nQML_DECLARE_TYPE(Tile);\n\nclass MyWidget : public QWidget\n{\nQ_OBJECT\npublic:\n MyWidget(int = 370, int = 480, QWidget *parent=0, Qt::WindowFlags flags=0);\n ~MyWidget();\n\n Q_PROPERTY(QDeclarativeListProperty<Tile> tiles READ tiles CONSTANT);\n QDeclarativeListProperty<Tile> tiles() { return _tilesProperty; }\n\n Q_PROPERTY(bool isPlaying READ isPlaying NOTIFY isPlayingChanged);\n bool isPlaying() {return playing;}\n\n Q_PROPERTY(bool hasWon READ hasWon NOTIFY hasWonChanged);\n bool hasWon() {return won;}\n\n Q_PROPERTY(int numMines READ numMines NOTIFY numMinesChanged);\n int numMines() const{return nMines;}\n\n Q_PROPERTY(int numFlags READ numFlags NOTIFY numFlagsChanged);\n int numFlags() const{return nFlags;}\n\npublic slots:\n Q_INVOKABLE bool flip(int row, int col);\n Q_INVOKABLE bool flag(int row, int col);\n void setBoard();\n void reset();\n\nsignals:\n void isPlayingChanged();\n void hasWonChanged();\n void numMinesChanged();\n void numFlagsChanged();\n\nprivate:\n bool onBoard( int r, int c ) const { return r >= 0 && r < numRows && c >= 0 && c < numCols; }\n Tile *tile( int row, int col ) { return onBoard(row, col) ? _tiles[col+numRows*row] : 0; }\n int getHint(int row, int col);\n void setPlaying(bool b){if(b==playing) return; playing=b; emit isPlayingChanged();}\n\n QDeclarativeView *canvas;\n\n QList<Tile *> _tiles;\n QDeclarativeListProperty<Tile> _tilesProperty;\n int numCols;\n int numRows;\n bool playing;\n bool won;\n int remaining;\n int nMines;\n int nFlags;\n};\n\nQ_DECLARE_METATYPE(QList<Tile*>)\nMyWidget::MyWidget(int width, int height, QWidget *parent, Qt::WindowFlags flags)\n: QWidget(parent, flags), canvas(0), numCols(9), numRows(9), playing(true), won(false)\n{\n setObjectName(\"mainWidget\");\n srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n \/\/initialize array\n for(int ii = 0; ii < numRows * numCols; ++ii) {\n _tiles << new Tile;\n }\n reset();\n\n QVBoxLayout *vbox = new QVBoxLayout;\n vbox->setMargin(0);\n setLayout(vbox);\n\n canvas = new QDeclarativeView(this);\n canvas->setFixedSize(width, height);\n vbox->addWidget(canvas);\n\n _tilesProperty = QDeclarativeListProperty<Tile>(this, _tiles);\n\n QDeclarativeContext *ctxt = canvas->rootContext();\n ctxt->addDefaultObject(this);\n\n canvas->setSource(QUrl::fromLocalFile(fileName));\n}\n\nMyWidget::~MyWidget()\n{\n}\n\nvoid MyWidget::setBoard()\n{\n foreach(Tile* t, _tiles){\n t->setHasMine(false);\n t->setHint(-1);\n }\n \/\/place mines\n int mines = nMines;\n remaining = numRows*numCols-mines;\n while ( mines ) {\n int col = int((double(rand()) \/ double(RAND_MAX)) * numCols);\n int row = int((double(rand()) \/ double(RAND_MAX)) * numRows);\n\n Tile* t = tile( row, col );\n\n if (t && !t->hasMine()) {\n t->setHasMine( true );\n mines--;\n }\n }\n\n \/\/set hints\n for (int r = 0; r < numRows; r++)\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && !t->hasMine()) {\n int hint = getHint(r,c);\n t->setHint(hint);\n }\n }\n\n setPlaying(true);\n}\n\nvoid MyWidget::reset()\n{\n foreach(Tile* t, _tiles){\n t->unflip();\n t->setHasFlag(false);\n }\n nMines = 12;\n nFlags = 0;\n setPlaying(false);\n QTimer::singleShot(600,this, SLOT(setBoard()));\n}\n\nint MyWidget::getHint(int row, int col)\n{\n int hint = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine())\n hint++;\n }\n return hint;\n}\n\nbool MyWidget::flip(int row, int col)\n{\n if(!playing)\n return false;\n\n Tile *t = tile(row, col);\n if (!t || t->hasFlag())\n return false;\n\n if(t->flipped()){\n int flags = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if(!nearT || nearT == t)\n continue;\n if(nearT->hasFlag())\n flags++;\n }\n if(!t->hint() || t->hint() != flags)\n return false;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if (nearT && !nearT->flipped() && !nearT->hasFlag()) {\n flip( r, c );\n }\n }\n return true;\n }\n\n t->flip();\n\n if (t->hint() == 0) {\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && !t->flipped()) {\n flip( r, c );\n }\n }\n }\n\n if(t->hasMine()){\n for (int r = 0; r < numRows; r++)\/\/Flip all other mines\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine()) {\n flip(r, c);\n }\n }\n won = false;\n hasWonChanged();\n setPlaying(false);\n }\n\n remaining--;\n if(!remaining){\n won = true;\n hasWonChanged();\n setPlaying(false);\n }\n return true;\n}\n\nbool MyWidget::flag(int row, int col)\n{\n Tile *t = tile(row, col);\n if(!t)\n return false;\n\n t->setHasFlag(!t->hasFlag());\n nFlags += (t->hasFlag()?1:-1);\n emit numFlagsChanged();\n return true;\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char ** argv)\n{\n QApplication app(argc, argv);\n\n bool frameless = false;\n\n int width = 370;\n int height = 480;\n\n QML_REGISTER_TYPE(0,0,0,Tile,Tile);\n\n for (int i = 1; i < argc; ++i) {\n QString arg = argv[i];\n if (arg == \"-frameless\") {\n frameless = true;\n } else if(arg == \"-width\" && i < (argc - 1)) {\n ++i;\n width = ::atoi(argv[i]);\n } else if(arg == \"-height\" && i < (argc - 1)) {\n ++i;\n height = ::atoi(argv[i]);\n } else if (arg[0] != '-') {\n fileName = arg;\n }\n }\n\n MyWidget wid(width, height, 0, frameless ? Qt::FramelessWindowHint : Qt::Widget);\n wid.show();\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the demonstration applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include \"qmlengine.h\"\n#include \"qmlcontext.h\"\n#include \"qml.h\"\n#include <qmlgraphicsitem.h>\n#include <qmlview.h>\n\n#include <QWidget>\n#include <QApplication>\n#include <QFile>\n#include <QTime>\n#include <QTimer>\n#include <QVBoxLayout>\n#include <QFileInfo>\n\nQString fileName = \"minehunt.qml\";\n\nclass Tile : public QObject\n{\n Q_OBJECT\npublic:\n Tile() : _hasFlag(false), _hasMine(false), _hint(-1), _flipped(false) {}\n\n Q_PROPERTY(bool hasFlag READ hasFlag WRITE setHasFlag NOTIFY hasFlagChanged);\n bool hasFlag() const { return _hasFlag; }\n\n Q_PROPERTY(bool hasMine READ hasMine NOTIFY hasMineChanged);\n bool hasMine() const { return _hasMine; }\n\n Q_PROPERTY(int hint READ hint NOTIFY hintChanged);\n int hint() const { return _hint; }\n\n Q_PROPERTY(bool flipped READ flipped NOTIFY flippedChanged());\n bool flipped() const { return _flipped; }\n\n void setHasFlag(bool flag) {if(flag==_hasFlag) return; _hasFlag = flag; emit hasFlagChanged();}\n void setHasMine(bool mine) {if(mine==_hasMine) return; _hasMine = mine; emit hasMineChanged();}\n void setHint(int hint) { if(hint == _hint) return; _hint = hint; emit hintChanged(); }\n void flip() { if (_flipped) return; _flipped = true; emit flippedChanged(); }\n void unflip() { if(!_flipped) return; _flipped = false; emit flippedChanged(); }\n\nsignals:\n void flippedChanged();\n void hasFlagChanged();\n void hintChanged();\n void hasMineChanged();\n\nprivate:\n bool _hasFlag;\n bool _hasMine;\n int _hint;\n bool _flipped;\n};\n\nQML_DECLARE_TYPE(Tile);\nQML_DEFINE_TYPE(0,0,0,Tile,Tile);\n\nclass MyWidget : public QWidget\n{\nQ_OBJECT\npublic:\n MyWidget(int = 370, int = 480, QWidget *parent=0, Qt::WindowFlags flags=0);\n ~MyWidget();\n\n Q_PROPERTY(QList<Tile *> *tiles READ tiles CONSTANT);\n QList<Tile *> *tiles() { return &_tiles; }\n\n Q_PROPERTY(bool isPlaying READ isPlaying NOTIFY isPlayingChanged);\n bool isPlaying() {return playing;}\n\n Q_PROPERTY(bool hasWon READ hasWon NOTIFY hasWonChanged);\n bool hasWon() {return won;}\n\n Q_PROPERTY(int numMines READ numMines NOTIFY numMinesChanged);\n int numMines() const{return nMines;}\n\n Q_PROPERTY(int numFlags READ numFlags NOTIFY numFlagsChanged);\n int numFlags() const{return nFlags;}\n\npublic slots:\n Q_INVOKABLE void flip(int row, int col);\n Q_INVOKABLE void flag(int row, int col);\n void setBoard();\n void reset();\n\nsignals:\n void isPlayingChanged();\n void hasWonChanged();\n void numMinesChanged();\n void numFlagsChanged();\n\nprivate:\n bool onBoard( int r, int c ) const { return r >= 0 && r < numRows && c >= 0 && c < numCols; }\n Tile *tile( int row, int col ) { return onBoard(row, col) ? _tiles[col+numRows*row] : 0; }\n int getHint(int row, int col);\n void setPlaying(bool b){if(b==playing) return; playing=b; emit isPlayingChanged();}\n\n QmlView *canvas;\n\n QList<Tile *> _tiles;\n int numCols;\n int numRows;\n bool playing;\n bool won;\n int remaining;\n int nMines;\n int nFlags;\n};\n\nMyWidget::MyWidget(int width, int height, QWidget *parent, Qt::WindowFlags flags)\n: QWidget(parent, flags), canvas(0), numCols(9), numRows(9), playing(true), won(false)\n{\n setObjectName(\"mainWidget\");\n srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n \/\/initialize array\n for(int ii = 0; ii < numRows * numCols; ++ii) {\n _tiles << new Tile;\n }\n\n reset();\n\n QVBoxLayout *vbox = new QVBoxLayout;\n vbox->setMargin(0);\n setLayout(vbox);\n\n canvas = new QmlView(this);\n canvas->setFixedSize(width, height);\n vbox->addWidget(canvas);\n\n QFile file(fileName);\n file.open(QFile::ReadOnly);\n QString qml = file.readAll();\n canvas->setQml(qml, fileName);\n\n QmlContext *ctxt = canvas->rootContext();\n ctxt->addDefaultObject(this);\n ctxt->setContextProperty(\"tiles\", QVariant::fromValue<QList<Tile*>*>(&_tiles));\/\/QTBUG-5675\n\n canvas->execute();\n}\n\nMyWidget::~MyWidget()\n{\n}\n\nvoid MyWidget::setBoard()\n{\n foreach(Tile* t, _tiles){\n t->setHasMine(false);\n t->setHint(-1);\n }\n \/\/place mines\n int mines = nMines;\n remaining = numRows*numCols-mines;\n while ( mines ) {\n int col = int((double(rand()) \/ double(RAND_MAX)) * numCols);\n int row = int((double(rand()) \/ double(RAND_MAX)) * numRows);\n\n Tile* t = tile( row, col );\n\n if (t && !t->hasMine()) {\n t->setHasMine( true );\n mines--;\n }\n }\n\n \/\/set hints\n for (int r = 0; r < numRows; r++)\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && !t->hasMine()) {\n int hint = getHint(r,c);\n t->setHint(hint);\n }\n }\n\n setPlaying(true);\n}\n\nvoid MyWidget::reset()\n{\n foreach(Tile* t, _tiles){\n t->unflip();\n t->setHasFlag(false);\n }\n nMines = 12;\n nFlags = 0;\n setPlaying(false);\n QTimer::singleShot(900,this, SLOT(setBoard()));\n}\n\nint MyWidget::getHint(int row, int col)\n{\n int hint = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine())\n hint++;\n }\n return hint;\n}\n\nvoid MyWidget::flip(int row, int col)\n{\n if(!playing)\n return;\n\n Tile *t = tile(row, col);\n if (!t || t->hasFlag())\n return;\n\n if(t->flipped()){\n int flags = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if(!nearT || nearT == t)\n continue;\n if(nearT->hasFlag())\n flags++;\n }\n if(!t->hint() || t->hint() != flags)\n return;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if (nearT && !nearT->flipped() && !nearT->hasFlag()) {\n flip( r, c );\n }\n }\n return;\n }\n\n t->flip();\n\n if (t->hint() == 0) {\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && !t->flipped()) {\n flip( r, c );\n }\n }\n }\n\n if(t->hasMine()){\n for (int r = 0; r < numRows; r++)\/\/Flip all other mines\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine()) {\n flip(r, c);\n }\n }\n won = false;\n hasWonChanged();\n setPlaying(false);\n }\n\n remaining--;\n if(!remaining){\n won = true;\n hasWonChanged();\n setPlaying(false);\n }\n}\n\nvoid MyWidget::flag(int row, int col)\n{\n Tile *t = tile(row, col);\n if(!t)\n return;\n\n t->setHasFlag(!t->hasFlag());\n nFlags += (t->hasFlag()?1:-1);\n emit numFlagsChanged();\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char ** argv)\n{\n QApplication app(argc, argv);\n\n bool frameless = false;\n\n int width = 370;\n int height = 480;\n\n for (int i = 1; i < argc; ++i) {\n QString arg = argv[i];\n if (arg == \"-frameless\") {\n frameless = true;\n } else if(arg == \"-width\" && i < (argc - 1)) {\n ++i;\n width = ::atoi(argv[i]);\n } else if(arg == \"-height\" && i < (argc - 1)) {\n ++i;\n height = ::atoi(argv[i]);\n } else if (arg[0] != '-') {\n fileName = arg;\n }\n }\n\n MyWidget wid(width, height, 0, frameless ? Qt::FramelessWindowHint : Qt::Widget);\n wid.show();\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<commit_msg>Make minehunt more responsive<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the demonstration applications of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include \"qmlengine.h\"\n#include \"qmlcontext.h\"\n#include \"qml.h\"\n#include <qmlgraphicsitem.h>\n#include <qmlview.h>\n\n#include <QWidget>\n#include <QApplication>\n#include <QFile>\n#include <QTime>\n#include <QTimer>\n#include <QVBoxLayout>\n#include <QFileInfo>\n\nQString fileName = \"minehunt.qml\";\n\nclass Tile : public QObject\n{\n Q_OBJECT\npublic:\n Tile() : _hasFlag(false), _hasMine(false), _hint(-1), _flipped(false) {}\n\n Q_PROPERTY(bool hasFlag READ hasFlag WRITE setHasFlag NOTIFY hasFlagChanged);\n bool hasFlag() const { return _hasFlag; }\n\n Q_PROPERTY(bool hasMine READ hasMine NOTIFY hasMineChanged);\n bool hasMine() const { return _hasMine; }\n\n Q_PROPERTY(int hint READ hint NOTIFY hintChanged);\n int hint() const { return _hint; }\n\n Q_PROPERTY(bool flipped READ flipped NOTIFY flippedChanged());\n bool flipped() const { return _flipped; }\n\n void setHasFlag(bool flag) {if(flag==_hasFlag) return; _hasFlag = flag; emit hasFlagChanged();}\n void setHasMine(bool mine) {if(mine==_hasMine) return; _hasMine = mine; emit hasMineChanged();}\n void setHint(int hint) { if(hint == _hint) return; _hint = hint; emit hintChanged(); }\n void flip() { if (_flipped) return; _flipped = true; emit flippedChanged(); }\n void unflip() { if(!_flipped) return; _flipped = false; emit flippedChanged(); }\n\nsignals:\n void flippedChanged();\n void hasFlagChanged();\n void hintChanged();\n void hasMineChanged();\n\nprivate:\n bool _hasFlag;\n bool _hasMine;\n int _hint;\n bool _flipped;\n};\n\nQML_DECLARE_TYPE(Tile);\nQML_DEFINE_TYPE(0,0,0,Tile,Tile);\n\nclass MyWidget : public QWidget\n{\nQ_OBJECT\npublic:\n MyWidget(int = 370, int = 480, QWidget *parent=0, Qt::WindowFlags flags=0);\n ~MyWidget();\n\n Q_PROPERTY(QList<Tile *> *tiles READ tiles CONSTANT);\n QList<Tile *> *tiles() { return &_tiles; }\n\n Q_PROPERTY(bool isPlaying READ isPlaying NOTIFY isPlayingChanged);\n bool isPlaying() {return playing;}\n\n Q_PROPERTY(bool hasWon READ hasWon NOTIFY hasWonChanged);\n bool hasWon() {return won;}\n\n Q_PROPERTY(int numMines READ numMines NOTIFY numMinesChanged);\n int numMines() const{return nMines;}\n\n Q_PROPERTY(int numFlags READ numFlags NOTIFY numFlagsChanged);\n int numFlags() const{return nFlags;}\n\npublic slots:\n Q_INVOKABLE void flip(int row, int col);\n Q_INVOKABLE void flag(int row, int col);\n void setBoard();\n void reset();\n\nsignals:\n void isPlayingChanged();\n void hasWonChanged();\n void numMinesChanged();\n void numFlagsChanged();\n\nprivate:\n bool onBoard( int r, int c ) const { return r >= 0 && r < numRows && c >= 0 && c < numCols; }\n Tile *tile( int row, int col ) { return onBoard(row, col) ? _tiles[col+numRows*row] : 0; }\n int getHint(int row, int col);\n void setPlaying(bool b){if(b==playing) return; playing=b; emit isPlayingChanged();}\n\n QmlView *canvas;\n\n QList<Tile *> _tiles;\n int numCols;\n int numRows;\n bool playing;\n bool won;\n int remaining;\n int nMines;\n int nFlags;\n};\n\nMyWidget::MyWidget(int width, int height, QWidget *parent, Qt::WindowFlags flags)\n: QWidget(parent, flags), canvas(0), numCols(9), numRows(9), playing(true), won(false)\n{\n setObjectName(\"mainWidget\");\n srand(QTime(0,0,0).secsTo(QTime::currentTime()));\n\n \/\/initialize array\n for(int ii = 0; ii < numRows * numCols; ++ii) {\n _tiles << new Tile;\n }\n\n reset();\n\n QVBoxLayout *vbox = new QVBoxLayout;\n vbox->setMargin(0);\n setLayout(vbox);\n\n canvas = new QmlView(this);\n canvas->setFixedSize(width, height);\n vbox->addWidget(canvas);\n\n QFile file(fileName);\n file.open(QFile::ReadOnly);\n QString qml = file.readAll();\n canvas->setQml(qml, fileName);\n\n QmlContext *ctxt = canvas->rootContext();\n ctxt->addDefaultObject(this);\n ctxt->setContextProperty(\"tiles\", QVariant::fromValue<QList<Tile*>*>(&_tiles));\/\/QTBUG-5675\n\n canvas->execute();\n}\n\nMyWidget::~MyWidget()\n{\n}\n\nvoid MyWidget::setBoard()\n{\n foreach(Tile* t, _tiles){\n t->setHasMine(false);\n t->setHint(-1);\n }\n \/\/place mines\n int mines = nMines;\n remaining = numRows*numCols-mines;\n while ( mines ) {\n int col = int((double(rand()) \/ double(RAND_MAX)) * numCols);\n int row = int((double(rand()) \/ double(RAND_MAX)) * numRows);\n\n Tile* t = tile( row, col );\n\n if (t && !t->hasMine()) {\n t->setHasMine( true );\n mines--;\n }\n }\n\n \/\/set hints\n for (int r = 0; r < numRows; r++)\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && !t->hasMine()) {\n int hint = getHint(r,c);\n t->setHint(hint);\n }\n }\n\n setPlaying(true);\n}\n\nvoid MyWidget::reset()\n{\n foreach(Tile* t, _tiles){\n t->unflip();\n t->setHasFlag(false);\n }\n nMines = 12;\n nFlags = 0;\n setPlaying(false);\n QTimer::singleShot(600,this, SLOT(setBoard()));\n}\n\nint MyWidget::getHint(int row, int col)\n{\n int hint = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine())\n hint++;\n }\n return hint;\n}\n\nvoid MyWidget::flip(int row, int col)\n{\n if(!playing)\n return;\n\n Tile *t = tile(row, col);\n if (!t || t->hasFlag())\n return;\n\n if(t->flipped()){\n int flags = 0;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if(!nearT || nearT == t)\n continue;\n if(nearT->hasFlag())\n flags++;\n }\n if(!t->hint() || t->hint() != flags)\n return;\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile *nearT = tile(r, c);\n if (nearT && !nearT->flipped() && !nearT->hasFlag()) {\n flip( r, c );\n }\n }\n return;\n }\n\n t->flip();\n\n if (t->hint() == 0) {\n for (int c = col-1; c <= col+1; c++)\n for (int r = row-1; r <= row+1; r++) {\n Tile* t = tile(r, c);\n if (t && !t->flipped()) {\n flip( r, c );\n }\n }\n }\n\n if(t->hasMine()){\n for (int r = 0; r < numRows; r++)\/\/Flip all other mines\n for (int c = 0; c < numCols; c++) {\n Tile* t = tile(r, c);\n if (t && t->hasMine()) {\n flip(r, c);\n }\n }\n won = false;\n hasWonChanged();\n setPlaying(false);\n }\n\n remaining--;\n if(!remaining){\n won = true;\n hasWonChanged();\n setPlaying(false);\n }\n}\n\nvoid MyWidget::flag(int row, int col)\n{\n Tile *t = tile(row, col);\n if(!t)\n return;\n\n t->setHasFlag(!t->hasFlag());\n nFlags += (t->hasFlag()?1:-1);\n emit numFlagsChanged();\n}\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint main(int argc, char ** argv)\n{\n QApplication app(argc, argv);\n\n bool frameless = false;\n\n int width = 370;\n int height = 480;\n\n for (int i = 1; i < argc; ++i) {\n QString arg = argv[i];\n if (arg == \"-frameless\") {\n frameless = true;\n } else if(arg == \"-width\" && i < (argc - 1)) {\n ++i;\n width = ::atoi(argv[i]);\n } else if(arg == \"-height\" && i < (argc - 1)) {\n ++i;\n height = ::atoi(argv[i]);\n } else if (arg[0] != '-') {\n fileName = arg;\n }\n }\n\n MyWidget wid(width, height, 0, frameless ? Qt::FramelessWindowHint : Qt::Widget);\n wid.show();\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of KDevelop\n * Copyright 2017 René J.V. Bertin <rjvbertin@gmail.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include <QDialog>\n#include <QUrl>\n#include <QFileInfo>\n#include <QVariantList>\n#include <QStandardPaths>\n#include <QJsonArray>\n#include <QMessageBox>\n\n#include <KLocalizedString>\n#include <KPluginFactory>\n#include <QJsonDocument>\n\n#include \"phabricatorjobs.h\"\n#include \"debug.h\"\n\n#include \"purpose\/job.h\"\n#include \"purpose\/pluginbase.h\"\n\n\/\/ FIXME: For some reason PLUGIN_PHABRICATOR isn't exported from the PhabricatorHelpers lib\n#undef qCDebug\n#define qCDebug(dum) qDebug()\n#undef qCWarning\n#define qCWarning(dum) qWarning()\n#undef qCCritical\n#define qCCritical(dum) qCritical()\n\nclass PhabricatorJob : public Purpose::Job\n{\n Q_OBJECT\n public:\n PhabricatorJob(QObject* object = Q_NULLPTR)\n : Purpose::Job(object)\n {}\n\n void start() override\n {\n const QString baseDir(data().value(QStringLiteral(\"baseDir\")).toString());\n const QUrl sourceFile(data().value(QStringLiteral(\"urls\")).toArray().first().toString());\n const QString updateDR = data().value(QStringLiteral(\"updateDR\")).toString();\n const bool doBrowse = data().value(QStringLiteral(\"doBrowse\")).toBool();\n\n if (QFileInfo(sourceFile.toLocalFile()).size() <= 0) {\n setError(KJob::UserDefinedError+1);\n setErrorText(i18n(\"Phabricator refuses empty patchfiles\"));\n qCCritical(PLUGIN_PHABRICATOR) << errorString();\n emitResult();\n return;\n }\n\n m_drTitle = data().value(QStringLiteral(\"drTitle\")).toString();\n\n KJob* job;\n if (!updateDR.isEmpty()) {\n const QString updateComment = data().value(QStringLiteral(\"updateComment\")).toString();\n job=new Phabricator::UpdateDiffRev(sourceFile, baseDir, updateDR, updateComment, doBrowse, this);\n connect(job, &KJob::finished, this, &PhabricatorJob::diffUpdated);\n } else {\n job=new Phabricator::NewDiffRev(sourceFile, baseDir, doBrowse, this);\n connect(job, &KJob::finished, this, &PhabricatorJob::diffCreated);\n if (!doBrowse) {\n QMessageBox::warning(nullptr,\n i18n(\"Please note\"),\n i18n(\"Remember to complete the differential revision online!\"));\n }\n }\n job->start();\n emit PhabricatorJob::infoMessage(this, QStringLiteral(\"upload job started\"), QString());\n }\n\n void diffCreatedOrUpdated(KJob* j, bool created)\n {\n if(j->error()!=0) {\n setError(j->error());\n setErrorText(j->errorString());\n emit PhabricatorJob::warning(this, j->errorString(), QString());\n qCCritical(PLUGIN_PHABRICATOR) << \"Could not upload the patch\" << j->errorString();\n emitResult();\n return;\n }\n\n if (created) {\n Phabricator::NewDiffRev const * job = qobject_cast<Phabricator::NewDiffRev*>(j);\n qCDebug(PLUGIN_PHABRICATOR) <<\"new diff:\" << job->diffURI();\n setOutput({{ QStringLiteral(\"url\"), job->diffURI() }});\n } else {\n Phabricator::UpdateDiffRev const * job = qobject_cast<Phabricator::UpdateDiffRev*>(j);\n qCDebug(PLUGIN_PHABRICATOR) << \"updated diff\" << job->requestId() << \":\" << job->diffURI();\n setOutput({{ QStringLiteral(\"url\"), job->diffURI() }});\n emit PhabricatorJob::infoMessage(this,\n QStringLiteral(\"updated diff %1: %2\").arg(job->requestId()).arg(job->diffURI()), QString());\n }\n emitResult();\n }\n\n void diffCreated(KJob* j)\n {\n diffCreatedOrUpdated(j, true);\n }\n\n void diffUpdated(KJob* j)\n {\n diffCreatedOrUpdated(j, false);\n }\n\n QString m_drTitle;\n};\n\nclass Q_DECL_EXPORT PhabricatorPlugin : public Purpose::PluginBase\n{\n Q_OBJECT\n public:\n PhabricatorPlugin(QObject* parent, const QList<QVariant>& \/*args*\/) : PluginBase(parent) {}\n virtual ~PhabricatorPlugin() override {}\n\n virtual Purpose::Job* createJob() const override\n {\n return new PhabricatorJob;\n }\n};\n\nK_PLUGIN_FACTORY_WITH_JSON(PhabricatorPluginFactory, \"phabricatorplugin.json\", registerPlugin<PhabricatorPlugin>();)\n\n#include \"phabricatorplugin.moc\"\n<commit_msg>revert to qCWarning() for the results for now<commit_after>\/*\n * This file is part of KDevelop\n * Copyright 2017 René J.V. Bertin <rjvbertin@gmail.com>\n *\n * This program is free software; you can redistribute it and\/or modify\n * it under the terms of the GNU Library General Public License as\n * published by the Free Software Foundation; either version 2 of the\n * License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public\n * License along with this program; if not, write to the\n * Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\/\n\n#include <QDialog>\n#include <QUrl>\n#include <QFileInfo>\n#include <QVariantList>\n#include <QStandardPaths>\n#include <QJsonArray>\n#include <QMessageBox>\n\n#include <KLocalizedString>\n#include <KPluginFactory>\n#include <QJsonDocument>\n\n#include \"phabricatorjobs.h\"\n#include \"debug.h\"\n\n#include \"purpose\/job.h\"\n#include \"purpose\/pluginbase.h\"\n\n\/\/ FIXME: For some reason PLUGIN_PHABRICATOR isn't exported from the PhabricatorHelpers lib\n#undef qCDebug\n#define qCDebug(dum) qDebug()\n#undef qCWarning\n#define qCWarning(dum) qWarning()\n#undef qCCritical\n#define qCCritical(dum) qCritical()\n\nclass PhabricatorJob : public Purpose::Job\n{\n Q_OBJECT\n public:\n PhabricatorJob(QObject* object = Q_NULLPTR)\n : Purpose::Job(object)\n {}\n\n void start() override\n {\n const QString baseDir(data().value(QStringLiteral(\"baseDir\")).toString());\n const QUrl sourceFile(data().value(QStringLiteral(\"urls\")).toArray().first().toString());\n const QString updateDR = data().value(QStringLiteral(\"updateDR\")).toString();\n const bool doBrowse = data().value(QStringLiteral(\"doBrowse\")).toBool();\n\n if (QFileInfo(sourceFile.toLocalFile()).size() <= 0) {\n setError(KJob::UserDefinedError+1);\n setErrorText(i18n(\"Phabricator refuses empty patchfiles\"));\n qCCritical(PLUGIN_PHABRICATOR) << errorString();\n emitResult();\n return;\n }\n\n m_drTitle = data().value(QStringLiteral(\"drTitle\")).toString();\n\n KJob* job;\n if (!updateDR.isEmpty()) {\n const QString updateComment = data().value(QStringLiteral(\"updateComment\")).toString();\n job=new Phabricator::UpdateDiffRev(sourceFile, baseDir, updateDR, updateComment, doBrowse, this);\n connect(job, &KJob::finished, this, &PhabricatorJob::diffUpdated);\n } else {\n job=new Phabricator::NewDiffRev(sourceFile, baseDir, doBrowse, this);\n connect(job, &KJob::finished, this, &PhabricatorJob::diffCreated);\n if (!doBrowse) {\n QMessageBox::warning(nullptr,\n i18n(\"Please note\"),\n i18n(\"Remember to complete the differential revision online!\"));\n }\n }\n job->start();\n emit PhabricatorJob::infoMessage(this, QStringLiteral(\"upload job started\"), QString());\n }\n\n void diffCreatedOrUpdated(KJob* j, bool created)\n {\n if(j->error()!=0) {\n setError(j->error());\n setErrorText(j->errorString());\n emit PhabricatorJob::warning(this, j->errorString(), QString());\n qCCritical(PLUGIN_PHABRICATOR) << \"Could not upload the patch\" << j->errorString();\n emitResult();\n return;\n }\n\n if (created) {\n Phabricator::NewDiffRev const * job = qobject_cast<Phabricator::NewDiffRev*>(j);\n qCWarning(PLUGIN_PHABRICATOR) <<\"new diff:\" << job->diffURI();\n setOutput({{ QStringLiteral(\"url\"), job->diffURI() }});\n } else {\n Phabricator::UpdateDiffRev const * job = qobject_cast<Phabricator::UpdateDiffRev*>(j);\n qCWarning(PLUGIN_PHABRICATOR) << \"updated diff\" << job->requestId() << \":\" << job->diffURI();\n setOutput({{ QStringLiteral(\"url\"), job->diffURI() }});\n emit PhabricatorJob::infoMessage(this,\n QStringLiteral(\"updated diff %1: %2\").arg(job->requestId()).arg(job->diffURI()), QString());\n }\n emitResult();\n }\n\n void diffCreated(KJob* j)\n {\n diffCreatedOrUpdated(j, true);\n }\n\n void diffUpdated(KJob* j)\n {\n diffCreatedOrUpdated(j, false);\n }\n\n QString m_drTitle;\n};\n\nclass Q_DECL_EXPORT PhabricatorPlugin : public Purpose::PluginBase\n{\n Q_OBJECT\n public:\n PhabricatorPlugin(QObject* parent, const QList<QVariant>& \/*args*\/) : PluginBase(parent) {}\n virtual ~PhabricatorPlugin() override {}\n\n virtual Purpose::Job* createJob() const override\n {\n return new PhabricatorJob;\n }\n};\n\nK_PLUGIN_FACTORY_WITH_JSON(PhabricatorPluginFactory, \"phabricatorplugin.json\", registerPlugin<PhabricatorPlugin>();)\n\n#include \"phabricatorplugin.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"sessiondialog.h\"\n#include \"session.h\"\n\n#include <QtGui\/QInputDialog>\n#include <QtGui\/QValidator>\n\nusing namespace ProjectExplorer;\nusing namespace ProjectExplorer::Internal;\n\nnamespace ProjectExplorer {\nnamespace Internal {\n\nclass SessionValidator : public QValidator\n{\npublic:\n SessionValidator(QObject *parent, QStringList sessions);\n void fixup(QString & input) const;\n QValidator::State validate(QString & input, int & pos) const;\nprivate:\n QStringList m_sessions;\n};\n\nSessionValidator::SessionValidator(QObject *parent, QStringList sessions)\n : QValidator(parent), m_sessions(sessions)\n{\n}\n\nQValidator::State SessionValidator::validate(QString &input, int &pos) const\n{\n Q_UNUSED(pos)\n if (m_sessions.contains(input))\n return QValidator::Intermediate;\n else\n return QValidator::Acceptable;\n}\n\nvoid SessionValidator::fixup(QString &input) const\n{\n int i = 2;\n QString copy;\n do {\n copy = input + QString(\" (%1)\").arg(i);\n ++i;\n } while (m_sessions.contains(copy));\n input = copy;\n}\n\n\nclass SessionNameInputDialog : public QDialog\n{\n Q_OBJECT\npublic:\n SessionNameInputDialog(const QStringList &sessions, QWidget *parent = 0);\n\n void setValue(const QString &value);\n QString value() const;\n\nprivate:\n QLineEdit *m_newSessionLineEdit;\n};\n\nSessionNameInputDialog::SessionNameInputDialog(const QStringList &sessions, QWidget *parent)\n : QDialog(parent)\n{\n QVBoxLayout *hlayout = new QVBoxLayout(this);\n QLabel *label = new QLabel(tr(\"Enter the name of the session:\"), this);\n hlayout->addWidget(label);\n m_newSessionLineEdit = new QLineEdit(this);\n m_newSessionLineEdit->setValidator(new SessionValidator(this, sessions));\n hlayout->addWidget(m_newSessionLineEdit);\n QDialogButtonBox *buttons = new QDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel, Qt::Horizontal, this);\n connect(buttons, SIGNAL(accepted()), this, SLOT(accept()));\n connect(buttons, SIGNAL(rejected()), this, SLOT(reject()));\n hlayout->addWidget(buttons);\n setLayout(hlayout);\n}\n\nvoid SessionNameInputDialog::setValue(const QString &value)\n{\n m_newSessionLineEdit->setText(value);\n}\n\nQString SessionNameInputDialog::value() const\n{\n return m_newSessionLineEdit->text();\n}\n\n\nSessionDialog::SessionDialog(SessionManager *sessionManager)\n : m_sessionManager(sessionManager)\n{\n m_ui.setupUi(this);\n\n connect(m_ui.btCreateNew, SIGNAL(clicked()),\n this, SLOT(createNew()));\n connect(m_ui.btClone, SIGNAL(clicked()),\n this, SLOT(clone()));\n connect(m_ui.btDelete, SIGNAL(clicked()),\n this, SLOT(remove()));\n\n connect(m_ui.btSwitch, SIGNAL(clicked()), this, SLOT(switchToSession()));\n connect(m_ui.btRename, SIGNAL(clicked()), this, SLOT(rename()));\n\n connect(m_ui.sessionList, SIGNAL(itemDoubleClicked (QListWidgetItem *)),\n this, SLOT(switchToSession()));\n\n connect(m_ui.sessionList, SIGNAL(currentItemChanged(QListWidgetItem *, QListWidgetItem *)),\n this, SLOT(updateActions()));\n\n m_ui.whatsASessionLabel->setOpenExternalLinks(true);\n addItems(true);\n markItems();\n}\n\nvoid SessionDialog::addItems(bool setDefaultSession)\n{\n QStringList sessions = m_sessionManager->sessions();\n foreach (const QString &session, sessions) {\n m_ui.sessionList->addItem(session);\n if (setDefaultSession && session == m_sessionManager->activeSession())\n m_ui.sessionList->setCurrentRow(m_ui.sessionList->count() - 1);\n }\n}\nvoid SessionDialog::markItems()\n{\n for(int i = 0; i < m_ui.sessionList->count(); ++i) {\n QListWidgetItem *item = m_ui.sessionList->item(i);\n QFont f = item->font();\n QString session = item->data(Qt::DisplayRole).toString();\n if (m_sessionManager->isDefaultSession(session))\n f.setItalic(true);\n else\n f.setItalic(false);\n if (m_sessionManager->activeSession() == session && !m_sessionManager->isDefaultVirgin())\n f.setBold(true);\n else\n f.setBold(false);\n item->setFont(f);\n }\n}\n\nvoid SessionDialog::updateActions()\n{\n bool isDefault = false;\n bool isActive = false;\n\n if (m_ui.sessionList->currentItem()) {\n isDefault = (m_ui.sessionList->currentItem()->text() == QLatin1String(\"default\"));\n isActive = (m_ui.sessionList->currentItem()->text() == m_sessionManager->activeSession());\n }\n\n m_ui.btDelete->setDisabled(isActive || isDefault);\n m_ui.btRename->setDisabled(isDefault);\n}\n\nvoid SessionDialog::createNew()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setWindowTitle(tr(\"New session name\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n QString newSession = newSessionInputDialog.value();\n if (newSession.isEmpty() || m_sessionManager->sessions().contains(newSession))\n return;\n\n m_sessionManager->createSession(newSession);\n m_ui.sessionList->clear();\n QStringList sessions = m_sessionManager->sessions();\n m_ui.sessionList->addItems(sessions);\n m_ui.sessionList->setCurrentRow(sessions.indexOf(newSession));\n }\n}\n\nvoid SessionDialog::clone()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setValue(m_ui.sessionList->currentItem()->text());\n newSessionInputDialog.setWindowTitle(tr(\"New session name\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n QString newSession = newSessionInputDialog.value();\n if (m_sessionManager->cloneSession(m_ui.sessionList->currentItem()->text(), newSession)) {\n m_ui.sessionList->clear();\n QStringList sessions = m_sessionManager->sessions();\n m_ui.sessionList->addItems(sessions);\n m_ui.sessionList->setCurrentRow(sessions.indexOf(newSession));\n }\n }\n}\n\nvoid SessionDialog::remove()\n{\n m_sessionManager->deleteSession(m_ui.sessionList->currentItem()->text());\n m_ui.sessionList->clear();\n addItems(false);\n markItems();\n}\n\nvoid SessionDialog::rename()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setValue(m_ui.sessionList->currentItem()->text());\n newSessionInputDialog.setWindowTitle(tr(\"Rename session\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n m_sessionManager->renameSession(m_ui.sessionList->currentItem()->text(), newSessionInputDialog.value());\n m_ui.sessionList->clear();\n addItems(false);\n markItems();\n }\n}\n\nvoid SessionDialog::switchToSession()\n{\n if (m_ui.sessionList->currentItem()) {\n QString session = m_ui.sessionList->currentItem()->text();\n m_sessionManager->loadSession(session);\n markItems();\n }\n updateActions();\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace ProjectExplorer\n\n#include \"sessiondialog.moc\"\n<commit_msg>Session Dialog: Fixes italic\/bold after adding new\/cloning sessions<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"sessiondialog.h\"\n#include \"session.h\"\n\n#include <QtGui\/QInputDialog>\n#include <QtGui\/QValidator>\n\nusing namespace ProjectExplorer;\nusing namespace ProjectExplorer::Internal;\n\nnamespace ProjectExplorer {\nnamespace Internal {\n\nclass SessionValidator : public QValidator\n{\npublic:\n SessionValidator(QObject *parent, QStringList sessions);\n void fixup(QString & input) const;\n QValidator::State validate(QString & input, int & pos) const;\nprivate:\n QStringList m_sessions;\n};\n\nSessionValidator::SessionValidator(QObject *parent, QStringList sessions)\n : QValidator(parent), m_sessions(sessions)\n{\n}\n\nQValidator::State SessionValidator::validate(QString &input, int &pos) const\n{\n Q_UNUSED(pos)\n if (m_sessions.contains(input))\n return QValidator::Intermediate;\n else\n return QValidator::Acceptable;\n}\n\nvoid SessionValidator::fixup(QString &input) const\n{\n int i = 2;\n QString copy;\n do {\n copy = input + QString(\" (%1)\").arg(i);\n ++i;\n } while (m_sessions.contains(copy));\n input = copy;\n}\n\n\nclass SessionNameInputDialog : public QDialog\n{\n Q_OBJECT\npublic:\n SessionNameInputDialog(const QStringList &sessions, QWidget *parent = 0);\n\n void setValue(const QString &value);\n QString value() const;\n\nprivate:\n QLineEdit *m_newSessionLineEdit;\n};\n\nSessionNameInputDialog::SessionNameInputDialog(const QStringList &sessions, QWidget *parent)\n : QDialog(parent)\n{\n QVBoxLayout *hlayout = new QVBoxLayout(this);\n QLabel *label = new QLabel(tr(\"Enter the name of the session:\"), this);\n hlayout->addWidget(label);\n m_newSessionLineEdit = new QLineEdit(this);\n m_newSessionLineEdit->setValidator(new SessionValidator(this, sessions));\n hlayout->addWidget(m_newSessionLineEdit);\n QDialogButtonBox *buttons = new QDialogButtonBox(QDialogButtonBox::Ok | QDialogButtonBox::Cancel, Qt::Horizontal, this);\n connect(buttons, SIGNAL(accepted()), this, SLOT(accept()));\n connect(buttons, SIGNAL(rejected()), this, SLOT(reject()));\n hlayout->addWidget(buttons);\n setLayout(hlayout);\n}\n\nvoid SessionNameInputDialog::setValue(const QString &value)\n{\n m_newSessionLineEdit->setText(value);\n}\n\nQString SessionNameInputDialog::value() const\n{\n return m_newSessionLineEdit->text();\n}\n\n\nSessionDialog::SessionDialog(SessionManager *sessionManager)\n : m_sessionManager(sessionManager)\n{\n m_ui.setupUi(this);\n\n connect(m_ui.btCreateNew, SIGNAL(clicked()),\n this, SLOT(createNew()));\n connect(m_ui.btClone, SIGNAL(clicked()),\n this, SLOT(clone()));\n connect(m_ui.btDelete, SIGNAL(clicked()),\n this, SLOT(remove()));\n\n connect(m_ui.btSwitch, SIGNAL(clicked()), this, SLOT(switchToSession()));\n connect(m_ui.btRename, SIGNAL(clicked()), this, SLOT(rename()));\n\n connect(m_ui.sessionList, SIGNAL(itemDoubleClicked (QListWidgetItem *)),\n this, SLOT(switchToSession()));\n\n connect(m_ui.sessionList, SIGNAL(currentItemChanged(QListWidgetItem *, QListWidgetItem *)),\n this, SLOT(updateActions()));\n\n m_ui.whatsASessionLabel->setOpenExternalLinks(true);\n addItems(true);\n markItems();\n}\n\nvoid SessionDialog::addItems(bool setDefaultSession)\n{\n QStringList sessions = m_sessionManager->sessions();\n foreach (const QString &session, sessions) {\n m_ui.sessionList->addItem(session);\n if (setDefaultSession && session == m_sessionManager->activeSession())\n m_ui.sessionList->setCurrentRow(m_ui.sessionList->count() - 1);\n }\n}\nvoid SessionDialog::markItems()\n{\n for(int i = 0; i < m_ui.sessionList->count(); ++i) {\n QListWidgetItem *item = m_ui.sessionList->item(i);\n QFont f = item->font();\n QString session = item->data(Qt::DisplayRole).toString();\n if (m_sessionManager->isDefaultSession(session))\n f.setItalic(true);\n else\n f.setItalic(false);\n if (m_sessionManager->activeSession() == session && !m_sessionManager->isDefaultVirgin())\n f.setBold(true);\n else\n f.setBold(false);\n item->setFont(f);\n }\n}\n\nvoid SessionDialog::updateActions()\n{\n bool isDefault = false;\n bool isActive = false;\n\n if (m_ui.sessionList->currentItem()) {\n isDefault = (m_ui.sessionList->currentItem()->text() == QLatin1String(\"default\"));\n isActive = (m_ui.sessionList->currentItem()->text() == m_sessionManager->activeSession());\n }\n\n m_ui.btDelete->setDisabled(isActive || isDefault);\n m_ui.btRename->setDisabled(isDefault);\n}\n\nvoid SessionDialog::createNew()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setWindowTitle(tr(\"New session name\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n QString newSession = newSessionInputDialog.value();\n if (newSession.isEmpty() || m_sessionManager->sessions().contains(newSession))\n return;\n\n m_sessionManager->createSession(newSession);\n m_ui.sessionList->clear();\n QStringList sessions = m_sessionManager->sessions();\n m_ui.sessionList->addItems(sessions);\n m_ui.sessionList->setCurrentRow(sessions.indexOf(newSession));\n markItems();\n }\n}\n\nvoid SessionDialog::clone()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setValue(m_ui.sessionList->currentItem()->text());\n newSessionInputDialog.setWindowTitle(tr(\"New session name\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n QString newSession = newSessionInputDialog.value();\n if (m_sessionManager->cloneSession(m_ui.sessionList->currentItem()->text(), newSession)) {\n m_ui.sessionList->clear();\n QStringList sessions = m_sessionManager->sessions();\n m_ui.sessionList->addItems(sessions);\n m_ui.sessionList->setCurrentRow(sessions.indexOf(newSession));\n markItems();\n }\n }\n}\n\nvoid SessionDialog::remove()\n{\n m_sessionManager->deleteSession(m_ui.sessionList->currentItem()->text());\n m_ui.sessionList->clear();\n addItems(false);\n markItems();\n}\n\nvoid SessionDialog::rename()\n{\n SessionNameInputDialog newSessionInputDialog(m_sessionManager->sessions(), this);\n newSessionInputDialog.setValue(m_ui.sessionList->currentItem()->text());\n newSessionInputDialog.setWindowTitle(tr(\"Rename session\"));\n\n if (newSessionInputDialog.exec() == QDialog::Accepted) {\n m_sessionManager->renameSession(m_ui.sessionList->currentItem()->text(), newSessionInputDialog.value());\n m_ui.sessionList->clear();\n addItems(false);\n markItems();\n }\n}\n\nvoid SessionDialog::switchToSession()\n{\n if (m_ui.sessionList->currentItem()) {\n QString session = m_ui.sessionList->currentItem()->text();\n m_sessionManager->loadSession(session);\n markItems();\n }\n updateActions();\n}\n\n} \/\/ namespace Internal\n} \/\/ namespace ProjectExplorer\n\n#include \"sessiondialog.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"qmljseditorplugin.h\"\n#include \"qmljshighlighter.h\"\n#include \"qmljseditor.h\"\n#include \"qmljseditorconstants.h\"\n#include \"qmljseditorfactory.h\"\n#include \"qmljscodecompletion.h\"\n#include \"qmljshoverhandler.h\"\n#include \"qmljsmodelmanager.h\"\n#include \"qmlfilewizard.h\"\n#include \"qmljspreviewrunner.h\"\n\n#include <qmldesigner\/qmldesignerconstants.h>\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/mimedatabase.h>\n#include <coreplugin\/uniqueidmanager.h>\n#include <coreplugin\/fileiconprovider.h>\n#include <coreplugin\/actionmanager\/actionmanager.h>\n#include <coreplugin\/actionmanager\/actioncontainer.h>\n#include <coreplugin\/actionmanager\/command.h>\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <texteditor\/fontsettings.h>\n#include <texteditor\/storagesettings.h>\n#include <texteditor\/texteditorconstants.h>\n#include <texteditor\/texteditorsettings.h>\n#include <texteditor\/textfilewizard.h>\n#include <texteditor\/texteditoractionhandler.h>\n#include <texteditor\/completionsupport.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QDebug>\n#include <QtCore\/QSettings>\n#include <QtCore\/QDir>\n#include <QtCore\/QCoreApplication>\n#include <QtGui\/QMenu>\n#include <QtGui\/QAction>\n\nusing namespace QmlJSEditor;\nusing namespace QmlJSEditor::Internal;\nusing namespace QmlJSEditor::Constants;\n\nQmlJSEditorPlugin *QmlJSEditorPlugin::m_instance = 0;\n\nQmlJSEditorPlugin::QmlJSEditorPlugin() :\n m_modelManager(0),\n m_wizard(0),\n m_editor(0),\n m_actionHandler(0)\n{\n m_instance = this;\n}\n\nQmlJSEditorPlugin::~QmlJSEditorPlugin()\n{\n removeObject(m_editor);\n delete m_actionHandler;\n m_instance = 0;\n}\n\nbool QmlJSEditorPlugin::initialize(const QStringList & \/*arguments*\/, QString *error_message)\n{\n Core::ICore *core = Core::ICore::instance();\n if (!core->mimeDatabase()->addMimeTypes(QLatin1String(\":\/qmljseditor\/QmlJSEditor.mimetypes.xml\"), error_message))\n return false;\n\n m_modelManager = new ModelManager(this);\n addAutoReleasedObject(m_modelManager);\n\n QList<int> context;\n context << core->uniqueIDManager()->uniqueIdentifier(QmlJSEditor::Constants::C_QMLJSEDITOR_ID)\n << core->uniqueIDManager()->uniqueIdentifier(QmlDesigner::Constants::C_QT_QUICK_TOOLS_MENU);\n\n m_editor = new QmlJSEditorFactory(this);\n addObject(m_editor);\n\n Core::BaseFileWizardParameters wizardParameters(Core::IWizard::FileWizard);\n wizardParameters.setCategory(QLatin1String(Core::Constants::WIZARD_CATEGORY_QT));\n wizardParameters.setDisplayCategory(QCoreApplication::translate(\"Core\", Core::Constants::WIZARD_TR_CATEGORY_QT));\n wizardParameters.setDescription(tr(\"Creates a Qt QML file.\"));\n wizardParameters.setDisplayName(tr(\"Qt QML File\"));\n wizardParameters.setId(QLatin1String(\"Q.Qml\"));\n addAutoReleasedObject(new QmlFileWizard(wizardParameters, core));\n\n m_actionHandler = new TextEditor::TextEditorActionHandler(QmlJSEditor::Constants::C_QMLJSEDITOR_ID,\n TextEditor::TextEditorActionHandler::Format\n | TextEditor::TextEditorActionHandler::UnCommentSelection\n | TextEditor::TextEditorActionHandler::UnCollapseAll);\n m_actionHandler->initializeActions();\n\n Core::ActionManager *am = core->actionManager();\n Core::ActionContainer *contextMenu = am->createMenu(QmlJSEditor::Constants::M_CONTEXT);\n\n Core::ActionContainer *mtools = am->actionContainer(Core::Constants::M_TOOLS);\n Core::ActionContainer *menuQtQuick = am->createMenu(Constants::M_QTQUICK);\n menuQtQuick->menu()->setTitle(tr(\"Qt Quick\"));\n mtools->addMenu(menuQtQuick);\n m_actionPreview = new QAction(\"&Preview\", this);\n\n QList<int> toolsMenuContext = QList<int>()\n << core->uniqueIDManager()->uniqueIdentifier(QmlDesigner::Constants::C_QT_QUICK_TOOLS_MENU);\n Core::Command *cmd = addToolAction(m_actionPreview, am, toolsMenuContext,\n QLatin1String(\"QtQuick.Preview\"), menuQtQuick, tr(\"Ctrl+Alt+R\"));\n connect(cmd->action(), SIGNAL(triggered()), SLOT(openPreview()));\n\n m_previewRunner = new QmlJSPreviewRunner(this);\n m_actionPreview->setEnabled(m_previewRunner->isReady());\n\n QAction *followSymbolUnderCursorAction = new QAction(tr(\"Follow Symbol Under Cursor\"), this);\n cmd = am->registerAction(followSymbolUnderCursorAction, Constants::FOLLOW_SYMBOL_UNDER_CURSOR, context);\n cmd->setDefaultKeySequence(QKeySequence(Qt::Key_F2));\n connect(followSymbolUnderCursorAction, SIGNAL(triggered()), this, SLOT(followSymbolUnderCursor()));\n contextMenu->addAction(cmd);\n\n cmd = am->command(TextEditor::Constants::AUTO_INDENT_SELECTION);\n contextMenu->addAction(cmd);\n\n cmd = am->command(TextEditor::Constants::UN_COMMENT_SELECTION);\n contextMenu->addAction(cmd);\n\n CodeCompletion *completion = new CodeCompletion(m_modelManager);\n addAutoReleasedObject(completion);\n\n addAutoReleasedObject(new HoverHandler);\n\n \/\/ Set completion settings and keep them up to date\n TextEditor::TextEditorSettings *textEditorSettings = TextEditor::TextEditorSettings::instance();\n completion->setCompletionSettings(textEditorSettings->completionSettings());\n connect(textEditorSettings, SIGNAL(completionSettingsChanged(TextEditor::CompletionSettings)),\n completion, SLOT(setCompletionSettings(TextEditor::CompletionSettings)));\n\n error_message->clear();\n\n Core::FileIconProvider *iconProvider = Core::FileIconProvider::instance();\n iconProvider->registerIconOverlayForSuffix(QIcon(\":\/qmljseditor\/images\/qmlfile.png\"), \"qml\");\n\n return true;\n}\n\nvoid QmlJSEditorPlugin::extensionsInitialized()\n{\n}\n\nvoid QmlJSEditorPlugin::openPreview()\n{\n Core::EditorManager *em = Core::EditorManager::instance();\n\n if (em->currentEditor() && em->currentEditor()->id() == Constants::C_QMLJSEDITOR_ID)\n m_previewRunner->run(em->currentEditor()->file()->fileName());\n\n}\n\nvoid QmlJSEditorPlugin::initializeEditor(QmlJSEditor::Internal::QmlJSTextEditor *editor)\n{\n QTC_ASSERT(m_instance, \/**\/);\n\n m_actionHandler->setupActions(editor);\n\n TextEditor::TextEditorSettings::instance()->initializeEditor(editor);\n\n \/\/ auto completion\n connect(editor, SIGNAL(requestAutoCompletion(TextEditor::ITextEditable*, bool)),\n TextEditor::Internal::CompletionSupport::instance(), SLOT(autoComplete(TextEditor::ITextEditable*, bool)));\n}\n\nvoid QmlJSEditorPlugin::followSymbolUnderCursor()\n{\n Core::EditorManager *em = Core::EditorManager::instance();\n\n if (QmlJSTextEditor *editor = qobject_cast<QmlJSTextEditor*>(em->currentEditor()->widget()))\n editor->followSymbolUnderCursor();\n}\n\nCore::Command *QmlJSEditorPlugin::addToolAction(QAction *a, Core::ActionManager *am,\n const QList<int> &context, const QString &name,\n Core::ActionContainer *c1, const QString &keySequence)\n{\n Core::Command *command = am->registerAction(a, name, context);\n if (!keySequence.isEmpty())\n command->setDefaultKeySequence(QKeySequence(keySequence));\n c1->addAction(command);\n return command;\n}\n\n\nQ_EXPORT_PLUGIN(QmlJSEditorPlugin)\n<commit_msg>Fixed untranslated string<commit_after>\/**************************************************************************\n**\n** This file is part of Qt Creator\n**\n** Copyright (c) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n**\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** Commercial Usage\n**\n** Licensees holding valid Qt Commercial licenses may use this file in\n** accordance with the Qt Commercial License Agreement provided with the\n** Software or, alternatively, in accordance with the terms contained in\n** a written agreement between you and Nokia.\n**\n** GNU Lesser General Public License Usage\n**\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** If you are unsure which license is appropriate for your use, please\n** contact the sales department at http:\/\/qt.nokia.com\/contact.\n**\n**************************************************************************\/\n\n#include \"qmljseditorplugin.h\"\n#include \"qmljshighlighter.h\"\n#include \"qmljseditor.h\"\n#include \"qmljseditorconstants.h\"\n#include \"qmljseditorfactory.h\"\n#include \"qmljscodecompletion.h\"\n#include \"qmljshoverhandler.h\"\n#include \"qmljsmodelmanager.h\"\n#include \"qmlfilewizard.h\"\n#include \"qmljspreviewrunner.h\"\n\n#include <qmldesigner\/qmldesignerconstants.h>\n\n#include <coreplugin\/icore.h>\n#include <coreplugin\/coreconstants.h>\n#include <coreplugin\/mimedatabase.h>\n#include <coreplugin\/uniqueidmanager.h>\n#include <coreplugin\/fileiconprovider.h>\n#include <coreplugin\/actionmanager\/actionmanager.h>\n#include <coreplugin\/actionmanager\/actioncontainer.h>\n#include <coreplugin\/actionmanager\/command.h>\n#include <coreplugin\/editormanager\/editormanager.h>\n#include <extensionsystem\/pluginmanager.h>\n#include <texteditor\/fontsettings.h>\n#include <texteditor\/storagesettings.h>\n#include <texteditor\/texteditorconstants.h>\n#include <texteditor\/texteditorsettings.h>\n#include <texteditor\/textfilewizard.h>\n#include <texteditor\/texteditoractionhandler.h>\n#include <texteditor\/completionsupport.h>\n#include <utils\/qtcassert.h>\n\n#include <QtCore\/QtPlugin>\n#include <QtCore\/QDebug>\n#include <QtCore\/QSettings>\n#include <QtCore\/QDir>\n#include <QtCore\/QCoreApplication>\n#include <QtGui\/QMenu>\n#include <QtGui\/QAction>\n\nusing namespace QmlJSEditor;\nusing namespace QmlJSEditor::Internal;\nusing namespace QmlJSEditor::Constants;\n\nQmlJSEditorPlugin *QmlJSEditorPlugin::m_instance = 0;\n\nQmlJSEditorPlugin::QmlJSEditorPlugin() :\n m_modelManager(0),\n m_wizard(0),\n m_editor(0),\n m_actionHandler(0)\n{\n m_instance = this;\n}\n\nQmlJSEditorPlugin::~QmlJSEditorPlugin()\n{\n removeObject(m_editor);\n delete m_actionHandler;\n m_instance = 0;\n}\n\nbool QmlJSEditorPlugin::initialize(const QStringList & \/*arguments*\/, QString *error_message)\n{\n Core::ICore *core = Core::ICore::instance();\n if (!core->mimeDatabase()->addMimeTypes(QLatin1String(\":\/qmljseditor\/QmlJSEditor.mimetypes.xml\"), error_message))\n return false;\n\n m_modelManager = new ModelManager(this);\n addAutoReleasedObject(m_modelManager);\n\n QList<int> context;\n context << core->uniqueIDManager()->uniqueIdentifier(QmlJSEditor::Constants::C_QMLJSEDITOR_ID)\n << core->uniqueIDManager()->uniqueIdentifier(QmlDesigner::Constants::C_QT_QUICK_TOOLS_MENU);\n\n m_editor = new QmlJSEditorFactory(this);\n addObject(m_editor);\n\n Core::BaseFileWizardParameters wizardParameters(Core::IWizard::FileWizard);\n wizardParameters.setCategory(QLatin1String(Core::Constants::WIZARD_CATEGORY_QT));\n wizardParameters.setDisplayCategory(QCoreApplication::translate(\"Core\", Core::Constants::WIZARD_TR_CATEGORY_QT));\n wizardParameters.setDescription(tr(\"Creates a Qt QML file.\"));\n wizardParameters.setDisplayName(tr(\"Qt QML File\"));\n wizardParameters.setId(QLatin1String(\"Q.Qml\"));\n addAutoReleasedObject(new QmlFileWizard(wizardParameters, core));\n\n m_actionHandler = new TextEditor::TextEditorActionHandler(QmlJSEditor::Constants::C_QMLJSEDITOR_ID,\n TextEditor::TextEditorActionHandler::Format\n | TextEditor::TextEditorActionHandler::UnCommentSelection\n | TextEditor::TextEditorActionHandler::UnCollapseAll);\n m_actionHandler->initializeActions();\n\n Core::ActionManager *am = core->actionManager();\n Core::ActionContainer *contextMenu = am->createMenu(QmlJSEditor::Constants::M_CONTEXT);\n\n Core::ActionContainer *mtools = am->actionContainer(Core::Constants::M_TOOLS);\n Core::ActionContainer *menuQtQuick = am->createMenu(Constants::M_QTQUICK);\n menuQtQuick->menu()->setTitle(tr(\"Qt Quick\"));\n mtools->addMenu(menuQtQuick);\n m_actionPreview = new QAction(tr(\"&Preview\"), this);\n\n QList<int> toolsMenuContext = QList<int>()\n << core->uniqueIDManager()->uniqueIdentifier(QmlDesigner::Constants::C_QT_QUICK_TOOLS_MENU);\n Core::Command *cmd = addToolAction(m_actionPreview, am, toolsMenuContext,\n QLatin1String(\"QtQuick.Preview\"), menuQtQuick, tr(\"Ctrl+Alt+R\"));\n connect(cmd->action(), SIGNAL(triggered()), SLOT(openPreview()));\n\n m_previewRunner = new QmlJSPreviewRunner(this);\n m_actionPreview->setEnabled(m_previewRunner->isReady());\n\n QAction *followSymbolUnderCursorAction = new QAction(tr(\"Follow Symbol Under Cursor\"), this);\n cmd = am->registerAction(followSymbolUnderCursorAction, Constants::FOLLOW_SYMBOL_UNDER_CURSOR, context);\n cmd->setDefaultKeySequence(QKeySequence(Qt::Key_F2));\n connect(followSymbolUnderCursorAction, SIGNAL(triggered()), this, SLOT(followSymbolUnderCursor()));\n contextMenu->addAction(cmd);\n\n cmd = am->command(TextEditor::Constants::AUTO_INDENT_SELECTION);\n contextMenu->addAction(cmd);\n\n cmd = am->command(TextEditor::Constants::UN_COMMENT_SELECTION);\n contextMenu->addAction(cmd);\n\n CodeCompletion *completion = new CodeCompletion(m_modelManager);\n addAutoReleasedObject(completion);\n\n addAutoReleasedObject(new HoverHandler);\n\n \/\/ Set completion settings and keep them up to date\n TextEditor::TextEditorSettings *textEditorSettings = TextEditor::TextEditorSettings::instance();\n completion->setCompletionSettings(textEditorSettings->completionSettings());\n connect(textEditorSettings, SIGNAL(completionSettingsChanged(TextEditor::CompletionSettings)),\n completion, SLOT(setCompletionSettings(TextEditor::CompletionSettings)));\n\n error_message->clear();\n\n Core::FileIconProvider *iconProvider = Core::FileIconProvider::instance();\n iconProvider->registerIconOverlayForSuffix(QIcon(\":\/qmljseditor\/images\/qmlfile.png\"), \"qml\");\n\n return true;\n}\n\nvoid QmlJSEditorPlugin::extensionsInitialized()\n{\n}\n\nvoid QmlJSEditorPlugin::openPreview()\n{\n Core::EditorManager *em = Core::EditorManager::instance();\n\n if (em->currentEditor() && em->currentEditor()->id() == Constants::C_QMLJSEDITOR_ID)\n m_previewRunner->run(em->currentEditor()->file()->fileName());\n\n}\n\nvoid QmlJSEditorPlugin::initializeEditor(QmlJSEditor::Internal::QmlJSTextEditor *editor)\n{\n QTC_ASSERT(m_instance, \/**\/);\n\n m_actionHandler->setupActions(editor);\n\n TextEditor::TextEditorSettings::instance()->initializeEditor(editor);\n\n \/\/ auto completion\n connect(editor, SIGNAL(requestAutoCompletion(TextEditor::ITextEditable*, bool)),\n TextEditor::Internal::CompletionSupport::instance(), SLOT(autoComplete(TextEditor::ITextEditable*, bool)));\n}\n\nvoid QmlJSEditorPlugin::followSymbolUnderCursor()\n{\n Core::EditorManager *em = Core::EditorManager::instance();\n\n if (QmlJSTextEditor *editor = qobject_cast<QmlJSTextEditor*>(em->currentEditor()->widget()))\n editor->followSymbolUnderCursor();\n}\n\nCore::Command *QmlJSEditorPlugin::addToolAction(QAction *a, Core::ActionManager *am,\n const QList<int> &context, const QString &name,\n Core::ActionContainer *c1, const QString &keySequence)\n{\n Core::Command *command = am->registerAction(a, name, context);\n if (!keySequence.isEmpty())\n command->setDefaultKeySequence(QKeySequence(keySequence));\n c1->addAction(command);\n return command;\n}\n\n\nQ_EXPORT_PLUGIN(QmlJSEditorPlugin)\n<|endoftext|>"} {"text":"<commit_before>#include <possumwood_sdk\/node_implementation.h>\n#include <possumwood_sdk\/app.h>\n\n#include <GL\/glew.h>\n#include <GL\/glu.h>\n\n#include \"datatypes\/uniforms.inl\"\n\nnamespace {\n\ndependency_graph::InAttr<std::string> a_name;\ndependency_graph::InAttr<std::shared_ptr<const QPixmap>> a_value;\ndependency_graph::InAttr<std::shared_ptr<const possumwood::Uniforms>> a_inUniforms;\ndependency_graph::OutAttr<std::shared_ptr<const possumwood::Uniforms>> a_outUniforms;\n\ndependency_graph::State compute(dependency_graph::Values& data) {\n\tdependency_graph::State result;\n\n\tstd::unique_ptr<possumwood::Uniforms> uniforms;\n\n\tstd::shared_ptr<const possumwood::Uniforms> inUniforms = data.get(a_inUniforms);\n\tif(inUniforms != nullptr)\n\t\tuniforms = std::unique_ptr<possumwood::Uniforms>(new possumwood::Uniforms(*inUniforms));\n\telse\n\t\tuniforms = std::unique_ptr<possumwood::Uniforms>(new possumwood::Uniforms());\n\n\tstd::shared_ptr<const QPixmap> value = data.get(a_value);\n\n\tif(value) {\n\t\tuniforms->addTexture(\n\t\t\tdata.get(a_name),\n\t\t\t*value\n\t\t);\n\t}\n\n\tdata.set(a_outUniforms, std::shared_ptr<const possumwood::Uniforms>(uniforms.release()));\n\n\treturn result;\n}\n\nvoid init(possumwood::Metadata& meta) {\n\tmeta.addAttribute(a_name, \"name\", std::string(\"texture\"));\n\tmeta.addAttribute(a_value, \"value\");\n\tmeta.addAttribute(a_inUniforms, \"in_uniforms\");\n\tmeta.addAttribute(a_outUniforms, \"out_uniforms\");\n\n\tmeta.addInfluence(a_name, a_outUniforms);\n\tmeta.addInfluence(a_value, a_outUniforms);\n\tmeta.addInfluence(a_inUniforms, a_outUniforms);\n\n\tmeta.setCompute(&compute);\n}\n\npossumwood::NodeImplementation s_impl(\"render\/uniforms\/texture\", init);\n\n}\n<commit_msg>Changed the default name of texture uniform to \"image\", not to conflict with GLSL texture keyword<commit_after>#include <possumwood_sdk\/node_implementation.h>\n#include <possumwood_sdk\/app.h>\n\n#include <GL\/glew.h>\n#include <GL\/glu.h>\n\n#include \"datatypes\/uniforms.inl\"\n\nnamespace {\n\ndependency_graph::InAttr<std::string> a_name;\ndependency_graph::InAttr<std::shared_ptr<const QPixmap>> a_value;\ndependency_graph::InAttr<std::shared_ptr<const possumwood::Uniforms>> a_inUniforms;\ndependency_graph::OutAttr<std::shared_ptr<const possumwood::Uniforms>> a_outUniforms;\n\ndependency_graph::State compute(dependency_graph::Values& data) {\n\tdependency_graph::State result;\n\n\tstd::unique_ptr<possumwood::Uniforms> uniforms;\n\n\tstd::shared_ptr<const possumwood::Uniforms> inUniforms = data.get(a_inUniforms);\n\tif(inUniforms != nullptr)\n\t\tuniforms = std::unique_ptr<possumwood::Uniforms>(new possumwood::Uniforms(*inUniforms));\n\telse\n\t\tuniforms = std::unique_ptr<possumwood::Uniforms>(new possumwood::Uniforms());\n\n\tstd::shared_ptr<const QPixmap> value = data.get(a_value);\n\n\tif(value) {\n\t\tuniforms->addTexture(\n\t\t\tdata.get(a_name),\n\t\t\t*value\n\t\t);\n\t}\n\n\tdata.set(a_outUniforms, std::shared_ptr<const possumwood::Uniforms>(uniforms.release()));\n\n\treturn result;\n}\n\nvoid init(possumwood::Metadata& meta) {\n\tmeta.addAttribute(a_name, \"name\", std::string(\"image\"));\n\tmeta.addAttribute(a_value, \"value\");\n\tmeta.addAttribute(a_inUniforms, \"in_uniforms\");\n\tmeta.addAttribute(a_outUniforms, \"out_uniforms\");\n\n\tmeta.addInfluence(a_name, a_outUniforms);\n\tmeta.addInfluence(a_value, a_outUniforms);\n\tmeta.addInfluence(a_inUniforms, a_outUniforms);\n\n\tmeta.setCompute(&compute);\n}\n\npossumwood::NodeImplementation s_impl(\"render\/uniforms\/texture\", init);\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"board.hpp\"\n\n#include <cstring>\n\n#include <boost\/lexical_cast.hpp>\n\n#include \"exception.hpp\"\n#include \"walk_move.hpp\"\n\n\nnamespace Quoridor {\n\nBoard::Board(int row_num, int col_num)\n : sides_(), pawn_sides_(), walls_(), occ_nodes_(), pawn_nodes_(), bg_()\n{\n set_size(row_num, col_num);\n\n sides_.push_back(std::pair<int, int>(0, 0));\n sides_.push_back(std::pair<int, int>(2, 0));\n sides_.push_back(std::pair<int, int>(1, 0));\n sides_.push_back(std::pair<int, int>(3, 0));\n}\n\nBoard::~Board()\n{\n}\n\nvoid Board::set_size(int row_num, int col_num)\n{\n if (row_num <= 0) {\n throw Exception(\"illegal row number: \"\n + boost::lexical_cast<std::string>(row_num));\n }\n if (col_num <= 0) {\n throw Exception(\"illegal column number: \"\n + boost::lexical_cast<std::string>(col_num));\n }\n if (row_num % 2 == 0) {\n throw Exception(\"row number must be odd: \"\n + boost::lexical_cast<std::string>(row_num));\n }\n if (col_num % 2 == 0) {\n throw Exception(\"column number must be odd: \"\n + boost::lexical_cast<std::string>(col_num));\n }\n\n row_num_ = row_num;\n col_num_ = col_num;\n\n bg_.set_size(row_num_, col_num_);\n}\n\nint Board::next_side() const\n{\n for (auto &side : sides_) {\n if (side.second == 0) {\n side.second = 1;\n return side.first;\n }\n }\n return -1;\n}\n\nint Board::add_pawn(std::shared_ptr<Pawn> pawn)\n{\n pawn_sides_[pawn] = next_side();\n int n;\n\n switch (pawn_sides_[pawn]) {\n case 0:\n n = col_num_ \/ 2;\n break;\n case 1:\n n = (row_num_ \/ 2) * col_num_;\n break;\n case 2:\n n = (row_num_ - 1) * col_num_ + col_num_ \/ 2;\n break;\n case 3:\n n = (row_num_ \/ 2) * col_num_ + col_num_ - 1;\n break;\n default:\n throw Exception(\"invalid pawn side: \"\n + boost::lexical_cast<std::string>(pawn_sides_[pawn]));\n }\n\n occ_nodes_[n] = pawn;\n pawn_nodes_[pawn] = n;\n\n return 0;\n}\n\nbool Board::is_occupied(int node) const\n{\n return occ_nodes_.find(node) != occ_nodes_.end();\n}\n\npos_t Board::pawn_pos(std::shared_ptr<Pawn> pawn) const\n{\n int node = pawn_nodes_.at(pawn);\n pos_t pos;\n pos.row = row(node);\n pos.col = col(node);\n return pos;\n}\n\nbool Board::is_at_opposite_side(std::shared_ptr<Pawn> pawn) const\n{\n int n = pawn_nodes_.at(pawn);\n switch (pawn_sides_.at(pawn)) {\n case 0:\n return row(n) == row_num_ - 1;\n case 1:\n return col(n) == col_num_ - 1;\n case 2:\n return row(n) == 0;\n case 3:\n return col(n) == 0;\n default:\n throw Exception(\"invalid board side: \"\n + boost::lexical_cast<std::string>(pawn_sides_.at(pawn)));\n }\n}\n\nint Board::make_walking_move(std::shared_ptr<Pawn> pawn, int goal_node)\n{\n int cur_node = pawn_nodes_[pawn];\n\n if (!is_possible_move(cur_node, goal_node)) {\n return -1;\n }\n\n \/\/ update pawn's position\n occ_nodes_.erase(pawn_nodes_[pawn]);\n bg_.unblock_neighbours(pawn_nodes_[pawn]);\n pawn_nodes_[pawn] = goal_node;\n occ_nodes_[goal_node] = pawn;\n bg_.block_neighbours(goal_node);\n\n return 0;\n}\n\nint Board::add_wall(const Wall &wall)\n{\n if (try_add_wall(wall) < 0) {\n return -1;\n }\n\n walls_[wall.orientation()][wall.line()].insert(std::map<int, Wall>::value_type(wall.start_pos(), Wall(wall)));\n\n int node1;\n int node2;\n for (int i = 0; i < wall.cnt(); ++i) {\n if (wall.orientation() == 0) {\n node1 = wall.line() * col_num_ + wall.start_pos() + i;\n node2 = (wall.line() + 1) * col_num_ + wall.start_pos() + i;\n }\n else {\n node1 = (wall.start_pos() + i) * row_num_ + wall.line();\n node2 = (wall.start_pos() + i) * row_num_ + wall.line() + 1;\n }\n bg_.remove_edges(node1, node2);\n }\n\n return 0;\n}\n\nint Board::try_add_wall(const Wall &wall)\n{\n int line_lim = (wall.orientation() ? col_num() : row_num()) - 1;\n int start_pos_lim = (wall.orientation() ? row_num() : col_num()) - 1;\n if ((wall.line() >= line_lim)\n || (wall.end_pos() > start_pos_lim)) {\n return -1;\n }\n\n if (wall_intersects(wall)) {\n return -1;\n }\n\n bg_.reset_filters();\n\n int node1;\n int node2;\n for (int i = 0; i < wall.cnt(); ++i) {\n if (wall.orientation() == 0) {\n node1 = wall.line() * col_num_ + wall.start_pos() + i;\n node2 = (wall.line() + 1) * col_num_ + wall.start_pos() + i;\n }\n else {\n node1 = (wall.start_pos() + i) * row_num_ + wall.line();\n node2 = (wall.start_pos() + i) * row_num_ + wall.line() + 1;\n }\n\n bg_.filter_edges(node1, node2);\n }\n\n bool path_blocked = false;\n\n for (auto pawn_node : pawn_nodes_) {\n std::vector<int> nodes;\n int side = (pawn_sides_[pawn_node.first] + 2) % 4;\n path_blocked = true;\n\n side_nodes(side, &nodes);\n for (auto node : nodes) {\n if (bg_.is_path_exists(pawn_node.second, node)) {\n path_blocked = false;\n break;\n }\n }\n\n \/* wall blocks all pathes to the opposite side for one of pawns *\/\n if (path_blocked) {\n break;\n }\n }\n\n if (path_blocked) {\n return -1;\n }\n\n return 0;\n}\n\nbool Board::is_possible_move(int cur_node, int goal_node) const\n{\n return bg_.is_neighbours(cur_node, goal_node);\n}\n\nbool Board::wall_intersects(const Wall &wall) const\n{\n \/\/ check intersections\n if (walls_.count(1 - wall.orientation()) > 0) {\n for (int i = 0; i < wall.cnt() - 1; ++i) {\n \/\/ there are walls on the intersected line\n if (walls_.at(1 - wall.orientation()).count(wall.start_pos()) != 0) {\n auto line_walls = walls_.at(1 - wall.orientation()).at(wall.start_pos() + i);\n auto it = line_walls.upper_bound(wall.line());\n\n \/\/ all walls on the line are settled before new wall\n if (it == line_walls.end()) {\n auto rit = line_walls.rbegin();\n if (rit->second.end_pos() >= wall.line()) {\n return true;\n }\n }\n else if (it != line_walls.begin()) {\n --it;\n if (it->second.end_pos() >= wall.line()) {\n return true;\n }\n }\n }\n }\n }\n\n \/\/ check overlaps\n if (walls_.count(wall.orientation()) > 0) {\n if (walls_.at(wall.orientation()).count(wall.line()) != 0) {\n auto line_walls = walls_.at(wall.orientation()).at(wall.line());\n auto it = line_walls.upper_bound(wall.start_pos());\n\n \/\/ all walls on the line are settled before new wall\n if (it == line_walls.end()) {\n auto rit = line_walls.rbegin();\n if (rit->second.end_pos() >= wall.start_pos()) {\n return true;\n }\n }\n else {\n \/\/ check if new wall overlaps over next wall on the line\n if (wall.end_pos() >= it->second.start_pos()) {\n return true;\n }\n\n if (it != line_walls.begin()) {\n --it;\n if (it->second.end_pos() >= wall.start_pos()) {\n return true;\n }\n }\n }\n }\n }\n\n return false;\n}\n\nvoid Board::side_nodes(int side, std::vector<int> *nodes) const\n{\n switch (side) {\n case 0:\n for (int i = 0; i < col_num_; ++i) {\n nodes->push_back(i);\n }\n break;\n case 1:\n for (int i = 0; i < row_num_; ++i) {\n nodes->push_back(i * col_num_);\n }\n break;\n case 2:\n for (int i = 0; i < col_num_; ++i) {\n nodes->push_back((row_num_ - 1 ) * col_num_ + i);\n }\n break;\n case 3:\n for (int i = 0; i < row_num_; ++i) {\n nodes->push_back(i * col_num_ + col_num_ - 1);\n }\n break;\n default:\n break;\n }\n}\n\n} \/* namespace Quoridor *\/\n<commit_msg>Block neighbours of pawn init nodes.<commit_after>#include \"board.hpp\"\n\n#include <cstring>\n\n#include <boost\/lexical_cast.hpp>\n\n#include \"exception.hpp\"\n#include \"walk_move.hpp\"\n\n\nnamespace Quoridor {\n\nBoard::Board(int row_num, int col_num)\n : sides_(), pawn_sides_(), walls_(), occ_nodes_(), pawn_nodes_(), bg_()\n{\n set_size(row_num, col_num);\n\n sides_.push_back(std::pair<int, int>(0, 0));\n sides_.push_back(std::pair<int, int>(2, 0));\n sides_.push_back(std::pair<int, int>(1, 0));\n sides_.push_back(std::pair<int, int>(3, 0));\n}\n\nBoard::~Board()\n{\n}\n\nvoid Board::set_size(int row_num, int col_num)\n{\n if (row_num <= 0) {\n throw Exception(\"illegal row number: \"\n + boost::lexical_cast<std::string>(row_num));\n }\n if (col_num <= 0) {\n throw Exception(\"illegal column number: \"\n + boost::lexical_cast<std::string>(col_num));\n }\n if (row_num % 2 == 0) {\n throw Exception(\"row number must be odd: \"\n + boost::lexical_cast<std::string>(row_num));\n }\n if (col_num % 2 == 0) {\n throw Exception(\"column number must be odd: \"\n + boost::lexical_cast<std::string>(col_num));\n }\n\n row_num_ = row_num;\n col_num_ = col_num;\n\n bg_.set_size(row_num_, col_num_);\n}\n\nint Board::next_side() const\n{\n for (auto &side : sides_) {\n if (side.second == 0) {\n side.second = 1;\n return side.first;\n }\n }\n return -1;\n}\n\nint Board::add_pawn(std::shared_ptr<Pawn> pawn)\n{\n pawn_sides_[pawn] = next_side();\n int n;\n\n switch (pawn_sides_[pawn]) {\n case 0:\n n = col_num_ \/ 2;\n break;\n case 1:\n n = (row_num_ \/ 2) * col_num_;\n break;\n case 2:\n n = (row_num_ - 1) * col_num_ + col_num_ \/ 2;\n break;\n case 3:\n n = (row_num_ \/ 2) * col_num_ + col_num_ - 1;\n break;\n default:\n throw Exception(\"invalid pawn side: \"\n + boost::lexical_cast<std::string>(pawn_sides_[pawn]));\n }\n\n occ_nodes_[n] = pawn;\n pawn_nodes_[pawn] = n;\n\n bg_.block_neighbours(n);\n\n return 0;\n}\n\nbool Board::is_occupied(int node) const\n{\n return occ_nodes_.find(node) != occ_nodes_.end();\n}\n\npos_t Board::pawn_pos(std::shared_ptr<Pawn> pawn) const\n{\n int node = pawn_nodes_.at(pawn);\n pos_t pos;\n pos.row = row(node);\n pos.col = col(node);\n return pos;\n}\n\nbool Board::is_at_opposite_side(std::shared_ptr<Pawn> pawn) const\n{\n int n = pawn_nodes_.at(pawn);\n switch (pawn_sides_.at(pawn)) {\n case 0:\n return row(n) == row_num_ - 1;\n case 1:\n return col(n) == col_num_ - 1;\n case 2:\n return row(n) == 0;\n case 3:\n return col(n) == 0;\n default:\n throw Exception(\"invalid board side: \"\n + boost::lexical_cast<std::string>(pawn_sides_.at(pawn)));\n }\n}\n\nint Board::make_walking_move(std::shared_ptr<Pawn> pawn, int goal_node)\n{\n int cur_node = pawn_nodes_[pawn];\n\n if (!is_possible_move(cur_node, goal_node)) {\n return -1;\n }\n\n \/\/ update pawn's position\n occ_nodes_.erase(pawn_nodes_[pawn]);\n bg_.unblock_neighbours(pawn_nodes_[pawn]);\n pawn_nodes_[pawn] = goal_node;\n occ_nodes_[goal_node] = pawn;\n bg_.block_neighbours(goal_node);\n\n return 0;\n}\n\nint Board::add_wall(const Wall &wall)\n{\n if (try_add_wall(wall) < 0) {\n return -1;\n }\n\n walls_[wall.orientation()][wall.line()].insert(std::map<int, Wall>::value_type(wall.start_pos(), Wall(wall)));\n\n int node1;\n int node2;\n for (int i = 0; i < wall.cnt(); ++i) {\n if (wall.orientation() == 0) {\n node1 = wall.line() * col_num_ + wall.start_pos() + i;\n node2 = (wall.line() + 1) * col_num_ + wall.start_pos() + i;\n }\n else {\n node1 = (wall.start_pos() + i) * row_num_ + wall.line();\n node2 = (wall.start_pos() + i) * row_num_ + wall.line() + 1;\n }\n bg_.remove_edges(node1, node2);\n }\n\n return 0;\n}\n\nint Board::try_add_wall(const Wall &wall)\n{\n int line_lim = (wall.orientation() ? col_num() : row_num()) - 1;\n int start_pos_lim = (wall.orientation() ? row_num() : col_num()) - 1;\n if ((wall.line() >= line_lim)\n || (wall.end_pos() > start_pos_lim)) {\n return -1;\n }\n\n if (wall_intersects(wall)) {\n return -1;\n }\n\n bg_.reset_filters();\n\n int node1;\n int node2;\n for (int i = 0; i < wall.cnt(); ++i) {\n if (wall.orientation() == 0) {\n node1 = wall.line() * col_num_ + wall.start_pos() + i;\n node2 = (wall.line() + 1) * col_num_ + wall.start_pos() + i;\n }\n else {\n node1 = (wall.start_pos() + i) * row_num_ + wall.line();\n node2 = (wall.start_pos() + i) * row_num_ + wall.line() + 1;\n }\n\n bg_.filter_edges(node1, node2);\n }\n\n bool path_blocked = false;\n\n for (auto pawn_node : pawn_nodes_) {\n std::vector<int> nodes;\n int side = (pawn_sides_[pawn_node.first] + 2) % 4;\n path_blocked = true;\n\n side_nodes(side, &nodes);\n for (auto node : nodes) {\n if (bg_.is_path_exists(pawn_node.second, node)) {\n path_blocked = false;\n break;\n }\n }\n\n \/* wall blocks all pathes to the opposite side for one of pawns *\/\n if (path_blocked) {\n break;\n }\n }\n\n if (path_blocked) {\n return -1;\n }\n\n return 0;\n}\n\nbool Board::is_possible_move(int cur_node, int goal_node) const\n{\n return bg_.is_neighbours(cur_node, goal_node);\n}\n\nbool Board::wall_intersects(const Wall &wall) const\n{\n \/\/ check intersections\n if (walls_.count(1 - wall.orientation()) > 0) {\n for (int i = 0; i < wall.cnt() - 1; ++i) {\n \/\/ there are walls on the intersected line\n if (walls_.at(1 - wall.orientation()).count(wall.start_pos()) != 0) {\n auto line_walls = walls_.at(1 - wall.orientation()).at(wall.start_pos() + i);\n auto it = line_walls.upper_bound(wall.line());\n\n \/\/ all walls on the line are settled before new wall\n if (it == line_walls.end()) {\n auto rit = line_walls.rbegin();\n if (rit->second.end_pos() >= wall.line()) {\n return true;\n }\n }\n else if (it != line_walls.begin()) {\n --it;\n if (it->second.end_pos() >= wall.line()) {\n return true;\n }\n }\n }\n }\n }\n\n \/\/ check overlaps\n if (walls_.count(wall.orientation()) > 0) {\n if (walls_.at(wall.orientation()).count(wall.line()) != 0) {\n auto line_walls = walls_.at(wall.orientation()).at(wall.line());\n auto it = line_walls.upper_bound(wall.start_pos());\n\n \/\/ all walls on the line are settled before new wall\n if (it == line_walls.end()) {\n auto rit = line_walls.rbegin();\n if (rit->second.end_pos() >= wall.start_pos()) {\n return true;\n }\n }\n else {\n \/\/ check if new wall overlaps over next wall on the line\n if (wall.end_pos() >= it->second.start_pos()) {\n return true;\n }\n\n if (it != line_walls.begin()) {\n --it;\n if (it->second.end_pos() >= wall.start_pos()) {\n return true;\n }\n }\n }\n }\n }\n\n return false;\n}\n\nvoid Board::side_nodes(int side, std::vector<int> *nodes) const\n{\n switch (side) {\n case 0:\n for (int i = 0; i < col_num_; ++i) {\n nodes->push_back(i);\n }\n break;\n case 1:\n for (int i = 0; i < row_num_; ++i) {\n nodes->push_back(i * col_num_);\n }\n break;\n case 2:\n for (int i = 0; i < col_num_; ++i) {\n nodes->push_back((row_num_ - 1 ) * col_num_ + i);\n }\n break;\n case 3:\n for (int i = 0; i < row_num_; ++i) {\n nodes->push_back(i * col_num_ + col_num_ - 1);\n }\n break;\n default:\n break;\n }\n}\n\n} \/* namespace Quoridor *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"party.h\"\n#include \"user.h\"\n#include \"ccharserver.h\"\n#include \"logconsole.h\"\n\n#include \"srv_party_req.h\"\n#include \"srv_party_reply.h\"\n\nstd::shared_ptr<Party> cache_fetch_party(uint32_t charId) {\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n Core::PartyMembersTable partyMembersTable{};\n \n auto res = conn(sqlpp::select(sqlpp::all_of(partyTable)).from(\n partyMembersTable.join(partyTable).on(partyMembersTable.id == partyTable.id))\n .where(partyMembersTable.memberId == charId));\n \n if (res.empty()) {\n return {};\n }\n auto& result = res.front();\n \n Party party;\n party.id = result.id;\n party.name = result.name;\n party.leader = result.leaderId;\n party.options = result.options;\n party.level = result.level;\n party.last_got_item_index = result.lastGotItemIndex;\n party.last_got_zuly_index = result.lastGotZulyIndex;\n party.last_got_etc_index = result.lastGotEtcIndex;\n \n \/\/ now we fetch all party members\n auto res2 = conn(sqlpp::select(partyMembersTable.memberId).from(partyMembersTable)\n .where(partyMembersTable.id == party.id).order_by(partyMembersTable.rank.desc()));\n \n if (res2.empty()) {\n return {};\n }\n \n for (const auto& r : res2) {\n party.members.push_back(r.memberId);\n }\n\n return std::make_shared<Party>(party);\n}\n\nvoid cache_create_party(std::shared_ptr<Party> party) {\n if (!party) return;\n \n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::insert_into(partyTable)\n .set(partyTable.name = party->name,\n partyTable.leaderId = party->leader,\n partyTable.options = party->options,\n partyTable.level = party->level,\n partyTable.lastGotItemIndex = party->last_got_item_index,\n partyTable.lastGotEtcIndex = party->last_got_etc_index,\n partyTable.lastGotZulyIndex = party->last_got_zuly_index));\n\n auto res = conn(sqlpp::select(partyTable.id).from(partyTable)\n .where(partyTable.leaderId == party->leader));\n\n if (res.empty()) {\n return;\n }\n\n party->id = res.front().id;\n}\n\nvoid cache_write_party(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::update(partyTable)\n .set(partyTable.name = party->name,\n partyTable.leaderId = party->leader,\n partyTable.options = party->options,\n partyTable.level = party->level,\n partyTable.lastGotItemIndex = party->last_got_item_index,\n partyTable.lastGotEtcIndex = party->last_got_etc_index,\n partyTable.lastGotZulyIndex = party->last_got_zuly_index)\n .where(partyTable.id == party->id));\n}\n\nvoid cache_write_party_members(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyMembersTable partyMembersTable{};\n\n conn(sqlpp::remove_from(partyMembersTable).where(partyMembersTable.id == party->id));\n auto insert = sqlpp::insert_into(partyMembersTable).columns(partyMembersTable.id, partyMembersTable.memberId);\n for (auto m : party-> members) {\n insert.values.add(partyMembersTable.id = party->id, partyMembersTable.memberId = m);\n }\n conn(insert);\n}\n\nvoid cache_remove_party(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::remove_from(partyTable).where(partyTable.id == party->id));\n}\n\nstd::shared_ptr<Party> PartyManager::get_party(uint32_t charId) {\n if (partys.count(charId) != 0) {\n return partys.at(charId);\n }\n auto party = cache_fetch_party(charId);\n if (!party) { \/\/ no party!\n return {};\n }\n partys.insert({charId, party});\n\n for (auto m : party->members) {\n partys.insert({m, party});\n }\n return party;\n}\n\nstd::shared_ptr<Party> PartyManager::create_party(uint32_t charId) {\n auto party = std::make_shared<Party>();\n party->members.push_back(charId);\n party->leader = charId;\n cache_create_party(party);\n cache_write_party_members(party);\n party->members.push_back(charId);\n partys[charId] = party;\n return party;\n}\n\nvoid PartyManager::add_member_to_party(std::shared_ptr<Party> party, uint32_t member) {\n party->members.push_back(member);\n partys.insert({member, party});\n \n cache_write_party_members(party);\n}\n\nvoid PartyManager::remove_member_from_party(std::shared_ptr<Party> party, uint32_t member) {\n party->members.erase(std::remove(party->members.begin(), party->members.end(), member), party->members.end());\n partys.erase(member);\n \n if (party->members.empty()) {\n cache_remove_party(party);\n } else {\n cache_write_party_members(party);\n }\n}\n\nvoid PartyManager::remove_party(std::shared_ptr<Party> party) {\n for (auto member : party->members) {\n partys.erase(member);\n }\n cache_remove_party(party);\n}\n\nPartyManager::~PartyManager() {\n for (const auto& [_, party] : partys) {\n remove_party(party);\n }\n}\n\nvoid party_request(const RoseCommon::Packet::CliPartyReq& packet, CCharServer& server, User& user) {\n auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n logger->trace(\"party_request({})\", user.get_name());\n \n using namespace RoseCommon::Packet;\n switch (packet.get_type()) {\n case CliPartyReq::CREATE: \/\/ idXorTag == id\n {\n auto other = server.get_user(packet.get_target(), user.get_mapId());\n if (!other) {\n logger->warn(\"User ({}, {}) doesn't exist\", packet.get_target(), user.get_mapId());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to make a party with {}\", user.get_name(), other.value()->get_name());\n if (user.get_party()) {\n logger->error(\"{} wants to make a party but is already in a party\", user.get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, user.get_entityId()));\n return;\n }\n if (user.get_requested_party()) {\n logger->warn(\"user {} got another pending party request\", user.get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::BUSY, user.get_entityId()));\n return;\n }\n if (other.value()->get_requested_party()) {\n logger->warn(\"user {} got another pending party request\", other.value()->get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::BUSY, other.value()->get_entityId()));\n return;\n }\n if (other.value()->get_party()) {\n logger->debug(\"{} wants to make a party with {} which is already in a party\", user.get_name(), other.value()->get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, other.value()->get_entityId())); \n return;\n }\n \/\/ TODO: check for level difference\n other.value()->set_requested_party(server.create_party(user));\n server.send_char(*other.value(), SrvPartyReq::create(SrvPartyReq::CREATE, user.get_entityId()));\n break;\n }\n case CliPartyReq::JOIN: \/\/ idXorTag == id\n {\n auto other = server.get_user(packet.get_target(), user.get_mapId());\n if (!other) {\n logger->warn(\"User ({}, {}) doesn't exist\", packet.get_target(), user.get_mapId());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to join {}'s party\", user.get_name(), other.value()->get_name());\n break;\n }\n case CliPartyReq::LEAVE: \/\/ idXorTag == tag\n {\n logger->debug(\"{} left the party\", user.get_name());\n break;\n }\n case CliPartyReq::CHANGE_OWNER: \/\/ idXorTag == tag\n {\n auto other = server.get_user(packet.get_target());\n if (!other) {\n logger->warn(\"User {} doesn't exist\", packet.get_target());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to make {} the owner\", user.get_name(), other.value()->get_name());\n break;\n }\n case CliPartyReq::BAN: \/\/ idXorTag == tag\n {\n auto other = server.get_user(packet.get_target());\n if (!other) {\n logger->warn(\"User {} doesn't exist\", packet.get_target());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to kick {}\", user.get_name(), other.value()->get_name());\n break;\n }\n default:\n logger->warn(\"Client {} sent a non valid request code {}\", user.get_name(), packet.get_target());\n }\n}\n\nvoid party_reply(const RoseCommon::Packet::CliPartyReply& packet, CCharServer& server, User& user) {\n auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n logger->trace(\"party_reply({})\", user.get_name());\n \n auto tmp = server.get_user(packet.get_target(), user.get_mapId());\n if (!tmp) {\n logger->warn(\"Client {} replied to a party request of the non existing char {}\", user.get_name(), packet.get_target());\n server.send_char(user, RoseCommon::Packet::SrvPartyReply::create(RoseCommon::Packet::SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n User*const other = tmp.value();\n if (!other->get_party()) {\n logger->warn(\"no party found for character {}\", other->get_name());\n return;\n }\n \n using namespace RoseCommon::Packet;\n switch (packet.get_type()) {\n case CliPartyReply::BUSY:\n logger->debug(\"{} is too busy to accept {}'s party\", user.get_name(), other->get_name());\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::BUSY, user.get_entityId()));\n break;\n case CliPartyReply::REJECT_JOIN:\n logger->debug(\"{} refused {}'s party\", user.get_name(), other->get_name());\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, user.get_entityId()));\n break;\n case CliPartyReply::ACCEPT_CREATE:\n case CliPartyReply::ACCEPT_JOIN:\n logger->debug(\"{} accepted {}'s party\", user.get_name(), other->get_name());\n if (user.get_requested_party() != other->get_party()) {\n logger->warn(\"{} tried to answer to a different party request from {}\", user.get_name(), other->get_name());\n user.set_requested_party({}); \/\/ we reset the party request\n return;\n }\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::ACCEPT_JOIN, user.get_entityId()));\n server.add_user_to_party(user, other->get_party());\n break;\n default:\n logger->debug(\"{} replied {} to {}\", user.get_name(), packet.get_type(), other->get_name());\n break;\n }\n}\n<commit_msg>Fix small segfault<commit_after>#include \"party.h\"\n#include \"user.h\"\n#include \"ccharserver.h\"\n#include \"logconsole.h\"\n\n#include \"srv_party_req.h\"\n#include \"srv_party_reply.h\"\n\n#include <unordered_set>\n\nstd::shared_ptr<Party> cache_fetch_party(uint32_t charId) {\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n Core::PartyMembersTable partyMembersTable{};\n \n auto res = conn(sqlpp::select(sqlpp::all_of(partyTable)).from(\n partyMembersTable.join(partyTable).on(partyMembersTable.id == partyTable.id))\n .where(partyMembersTable.memberId == charId));\n \n if (res.empty()) {\n return {};\n }\n auto& result = res.front();\n \n Party party;\n party.id = result.id;\n party.name = result.name;\n party.leader = result.leaderId;\n party.options = result.options;\n party.level = result.level;\n party.last_got_item_index = result.lastGotItemIndex;\n party.last_got_zuly_index = result.lastGotZulyIndex;\n party.last_got_etc_index = result.lastGotEtcIndex;\n \n \/\/ now we fetch all party members\n auto res2 = conn(sqlpp::select(partyMembersTable.memberId).from(partyMembersTable)\n .where(partyMembersTable.id == party.id).order_by(partyMembersTable.rank.desc()));\n \n if (res2.empty()) {\n return {};\n }\n \n for (const auto& r : res2) {\n party.members.push_back(r.memberId);\n }\n\n return std::make_shared<Party>(party);\n}\n\nvoid cache_create_party(std::shared_ptr<Party> party) {\n if (!party) return;\n \n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::insert_into(partyTable)\n .set(partyTable.name = party->name,\n partyTable.leaderId = party->leader,\n partyTable.options = party->options,\n partyTable.level = party->level,\n partyTable.lastGotItemIndex = party->last_got_item_index,\n partyTable.lastGotEtcIndex = party->last_got_etc_index,\n partyTable.lastGotZulyIndex = party->last_got_zuly_index));\n\n auto res = conn(sqlpp::select(partyTable.id).from(partyTable)\n .where(partyTable.leaderId == party->leader));\n\n if (res.empty()) {\n return;\n }\n\n party->id = res.front().id;\n}\n\nvoid cache_write_party(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::update(partyTable)\n .set(partyTable.name = party->name,\n partyTable.leaderId = party->leader,\n partyTable.options = party->options,\n partyTable.level = party->level,\n partyTable.lastGotItemIndex = party->last_got_item_index,\n partyTable.lastGotEtcIndex = party->last_got_etc_index,\n partyTable.lastGotZulyIndex = party->last_got_zuly_index)\n .where(partyTable.id == party->id));\n}\n\nvoid cache_write_party_members(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyMembersTable partyMembersTable{};\n\n conn(sqlpp::remove_from(partyMembersTable).where(partyMembersTable.id == party->id));\n auto insert = sqlpp::insert_into(partyMembersTable).columns(partyMembersTable.id, partyMembersTable.memberId);\n for (auto m : party-> members) {\n insert.values.add(partyMembersTable.id = party->id, partyMembersTable.memberId = m);\n }\n conn(insert);\n}\n\nvoid cache_remove_party(std::shared_ptr<Party> party) {\n if (!party) return;\n auto conn = Core::connectionPool.getConnection<Core::Osirose>();\n Core::PartyTable partyTable{};\n \n conn(sqlpp::remove_from(partyTable).where(partyTable.id == party->id));\n}\n\nstd::shared_ptr<Party> PartyManager::get_party(uint32_t charId) {\n if (partys.count(charId) != 0) {\n return partys.at(charId);\n }\n auto party = cache_fetch_party(charId);\n if (!party) { \/\/ no party!\n return {};\n }\n partys.insert({charId, party});\n\n for (auto m : party->members) {\n partys.insert({m, party});\n }\n return party;\n}\n\nstd::shared_ptr<Party> PartyManager::create_party(uint32_t charId) {\n auto party = std::make_shared<Party>();\n party->members.push_back(charId);\n party->leader = charId;\n cache_create_party(party);\n cache_write_party_members(party);\n party->members.push_back(charId);\n partys[charId] = party;\n return party;\n}\n\nvoid PartyManager::add_member_to_party(std::shared_ptr<Party> party, uint32_t member) {\n party->members.push_back(member);\n partys.insert({member, party});\n \n cache_write_party_members(party);\n}\n\nvoid PartyManager::remove_member_from_party(std::shared_ptr<Party> party, uint32_t member) {\n party->members.erase(std::remove(party->members.begin(), party->members.end(), member), party->members.end());\n partys.erase(member);\n \n if (party->members.empty()) {\n cache_remove_party(party);\n } else {\n cache_write_party_members(party);\n }\n}\n\nvoid PartyManager::remove_party(std::shared_ptr<Party> party) {\n for (auto member : party->members) {\n partys.erase(member);\n }\n cache_remove_party(party);\n}\n\nPartyManager::~PartyManager() {\n std::unordered_set<std::shared_ptr<Party>> tmp;\n for (const auto& [_, party] : partys) {\n tmp.insert(party);\n }\n for (const auto& party : tmp) {\n cache_remove_party(party);\n }\n}\n\nvoid party_request(const RoseCommon::Packet::CliPartyReq& packet, CCharServer& server, User& user) {\n auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n logger->trace(\"party_request({})\", user.get_name());\n \n using namespace RoseCommon::Packet;\n switch (packet.get_type()) {\n case CliPartyReq::CREATE: \/\/ idXorTag == id\n {\n auto other = server.get_user(packet.get_target(), user.get_mapId());\n if (!other) {\n logger->warn(\"User ({}, {}) doesn't exist\", packet.get_target(), user.get_mapId());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to make a party with {}\", user.get_name(), other.value()->get_name());\n if (user.get_party()) {\n logger->error(\"{} wants to make a party but is already in a party\", user.get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, user.get_entityId()));\n return;\n }\n if (user.get_requested_party()) {\n logger->warn(\"user {} got another pending party request\", user.get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::BUSY, user.get_entityId()));\n return;\n }\n if (other.value()->get_requested_party()) {\n logger->warn(\"user {} got another pending party request\", other.value()->get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::BUSY, other.value()->get_entityId()));\n return;\n }\n if (other.value()->get_party()) {\n logger->debug(\"{} wants to make a party with {} which is already in a party\", user.get_name(), other.value()->get_name());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, other.value()->get_entityId())); \n return;\n }\n \/\/ TODO: check for level difference\n other.value()->set_requested_party(server.create_party(user));\n server.send_char(*other.value(), SrvPartyReq::create(SrvPartyReq::CREATE, user.get_entityId()));\n break;\n }\n case CliPartyReq::JOIN: \/\/ idXorTag == id\n {\n auto other = server.get_user(packet.get_target(), user.get_mapId());\n if (!other) {\n logger->warn(\"User ({}, {}) doesn't exist\", packet.get_target(), user.get_mapId());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to join {}'s party\", user.get_name(), other.value()->get_name());\n break;\n }\n case CliPartyReq::LEAVE: \/\/ idXorTag == tag\n {\n logger->debug(\"{} left the party\", user.get_name());\n break;\n }\n case CliPartyReq::CHANGE_OWNER: \/\/ idXorTag == tag\n {\n auto other = server.get_user(packet.get_target());\n if (!other) {\n logger->warn(\"User {} doesn't exist\", packet.get_target());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to make {} the owner\", user.get_name(), other.value()->get_name());\n break;\n }\n case CliPartyReq::BAN: \/\/ idXorTag == tag\n {\n auto other = server.get_user(packet.get_target());\n if (!other) {\n logger->warn(\"User {} doesn't exist\", packet.get_target());\n server.send_char(user, SrvPartyReply::create(SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n logger->debug(\"{} wants to kick {}\", user.get_name(), other.value()->get_name());\n break;\n }\n default:\n logger->warn(\"Client {} sent a non valid request code {}\", user.get_name(), packet.get_target());\n }\n}\n\nvoid party_reply(const RoseCommon::Packet::CliPartyReply& packet, CCharServer& server, User& user) {\n auto logger = Core::CLog::GetLogger(Core::log_type::GENERAL).lock();\n logger->trace(\"party_reply({})\", user.get_name());\n \n auto tmp = server.get_user(packet.get_target(), user.get_mapId());\n if (!tmp) {\n logger->warn(\"Client {} replied to a party request of the non existing char {}\", user.get_name(), packet.get_target());\n server.send_char(user, RoseCommon::Packet::SrvPartyReply::create(RoseCommon::Packet::SrvPartyReply::NOT_FOUND, packet.get_target()));\n return;\n }\n User*const other = tmp.value();\n if (!other->get_party()) {\n logger->warn(\"no party found for character {}\", other->get_name());\n return;\n }\n \n using namespace RoseCommon::Packet;\n switch (packet.get_type()) {\n case CliPartyReply::BUSY:\n logger->debug(\"{} is too busy to accept {}'s party\", user.get_name(), other->get_name());\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::BUSY, user.get_entityId()));\n break;\n case CliPartyReply::REJECT_JOIN:\n logger->debug(\"{} refused {}'s party\", user.get_name(), other->get_name());\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::REJECT_JOIN, user.get_entityId()));\n break;\n case CliPartyReply::ACCEPT_CREATE:\n case CliPartyReply::ACCEPT_JOIN:\n logger->debug(\"{} accepted {}'s party\", user.get_name(), other->get_name());\n if (user.get_requested_party() != other->get_party()) {\n logger->warn(\"{} tried to answer to a different party request from {}\", user.get_name(), other->get_name());\n user.set_requested_party({}); \/\/ we reset the party request\n return;\n }\n server.send_char(*other, SrvPartyReply::create(SrvPartyReply::ACCEPT_JOIN, user.get_entityId()));\n server.add_user_to_party(user, other->get_party());\n break;\n default:\n logger->debug(\"{} replied {} to {}\", user.get_name(), packet.get_type(), other->get_name());\n break;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * \\file\n * \\brief chip::lowLevelInitialization() implementation for STM32F4\n *\n * \\author Copyright (C) 2015-2016 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"distortos\/chip\/lowLevelInitialization.hpp\"\n\n#include \"distortos\/chip\/STM32F4-FLASH.hpp\"\n#include \"distortos\/chip\/STM32F4-PWR.hpp\"\n#include \"distortos\/chip\/STM32F4-RCC.hpp\"\n#include \"distortos\/chip\/STM32F4-RCC-bits.h\"\n\n#include \"distortos\/architecture\/ARMv6-M-ARMv7-M-configureSysTick.hpp\"\n\n#include \"distortos\/chip\/CMSIS-proxy.h\"\n\nnamespace distortos\n{\n\nnamespace chip\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid lowLevelInitialization()\n{\n#ifdef CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\tstatic_assert(CONFIG_CHIP_STM32F4_VDD_MV >= 2100,\n\t\t\t\"Instruction prefetch must not be enabled when supply voltage is below 2.1V!\");\n\tconfigureInstructionPrefetch(true);\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\tconfigureInstructionPrefetch(false);\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\tenableDataCache();\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\tdisableDataCache();\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\tenableInstructionCache();\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\tdisableInstructionCache();\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tRCC_APB1ENR_PWREN_bb = 1;\n\n\tconfigureVoltageScaling(CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE);\n\n#if (defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) || \\\n\t\tdefined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) && \\\n\t\tdefined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n\tstatic_assert(CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE == 1, \"Over-drive mode requires voltage scale 1 mode!\");\n\tstatic_assert(CONFIG_CHIP_STM32F4_VDD_MV >= 2100,\n\t\t\t\"Over-drive mode must not be enabled when supply voltage is below 2.1V!\");\n\tenableOverDriveMode();\n\tconstexpr uint8_t voltageScaleIndex {0};\n\n#else\t\/\/ !(defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) ||\n\t\t\/\/ defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) ||\n\t\t\/\/ !defined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n\tconstexpr uint8_t voltageScaleIndex {CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE};\n\n#endif\t\/\/ !(defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) ||\n\t\t\/\/ defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) ||\n\t\t\/\/ !defined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_HSE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tconstexpr bool hseClockBypass {true};\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tconstexpr bool hseClockBypass {};\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tenableHse(hseClockBypass);\n\n#endif\t\/\/ def CONFIG_CHIP_STM32F4_RCC_HSE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_PLL_ENABLE\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_PLLSRC_HSI)\n\tconstexpr bool pllClockSourceHse {};\n\tconstexpr uint32_t pllInFrequency {hsiFrequency};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_PLLSRC_HSE)\n\tconstexpr bool pllClockSourceHse {true};\n\tconstexpr uint32_t pllInFrequency {CONFIG_CHIP_STM32F4_RCC_HSE_FREQUENCY};\n#endif\n\tconfigurePllClockSource(pllClockSourceHse);\n\n\tconstexpr uint32_t vcoInFrequency {pllInFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLM};\n\tstatic_assert(minVcoInFrequency <= vcoInFrequency && vcoInFrequency <= maxVcoInFrequency,\n\t\t\t\"Invalid VCO input frequency!\");\n\tconfigurePllInputClockDivider(CONFIG_CHIP_STM32F4_RCC_PLLM);\n\n\tconstexpr uint32_t vcoOutFrequency {vcoInFrequency * CONFIG_CHIP_STM32F4_RCC_PLLN};\n\tstatic_assert(minVcoOutFrequency <= vcoOutFrequency && vcoOutFrequency <= maxVcoOutFrequency,\n\t\t\t\"Invalid VCO output frequency!\");\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_PLLP_DIV2)\n\tconstexpr uint8_t pllp {pllpDiv2};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_PLLP_DIV4)\n\tconstexpr uint8_t pllp {pllpDiv4};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_PLLP_DIV6)\n\tconstexpr uint8_t pllp {pllpDiv6};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_PLLP_DIV8)\n\tconstexpr uint8_t pllp {pllpDiv8};\n#endif\n\n\tconstexpr uint32_t pllOutFrequency {vcoOutFrequency \/ pllp};\n\tstatic_assert(pllOutFrequency <= maxPllOutFrequency[voltageScaleIndex], \"Invalid PLL output frequency!\");\n\n\tconstexpr uint32_t pllqOutFrequency {vcoOutFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLQ};\n\tstatic_assert(pllqOutFrequency <= maxPllqOutFrequency, \"Invalid PLL \\\"\/Q\\\" output frequency!\");\n\n#if defined(CONFIG_CHIP_STM32F446) || defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)\n\n\tconstexpr uint32_t pllrOutFrequency {vcoOutFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLR};\n\n\tenablePll(CONFIG_CHIP_STM32F4_RCC_PLLN, pllp, CONFIG_CHIP_STM32F4_RCC_PLLQ, CONFIG_CHIP_STM32F4_RCC_PLLR);\n\n#else \/\/ !defined(CONFIG_CHIP_STM32F446) && !defined(CONFIG_CHIP_STM32F469) && !defined(CONFIG_CHIP_STM32F479)\n\n\tenablePll(CONFIG_CHIP_STM32F4_RCC_PLLN, pllp, CONFIG_CHIP_STM32F4_RCC_PLLQ);\n\n#endif \/\/ !defined(CONFIG_CHIP_STM32F446) && !defined(CONFIG_CHIP_STM32F469) && !defined(CONFIG_CHIP_STM32F479)\n\n#endif\t\/\/ def CONFIG_CHIP_STM32F4_RCC_PLL_ENABLE\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_HSI)\n\tconstexpr uint32_t sysclkFrequency {hsiFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::hsi};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_HSE)\n\tconstexpr uint32_t sysclkFrequency {CONFIG_CHIP_STM32F4_RCC_HSE_FREQUENCY};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::hse};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLL)\n\tconstexpr uint32_t sysclkFrequency {pllOutFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::pll};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLLR)\n\tconstexpr uint32_t sysclkFrequency {pllrOutFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::pllr};\n#endif\t\/\/ defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLLR)\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV1)\n\tconstexpr auto hpre = hpreDiv1;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV2)\n\tconstexpr auto hpre = hpreDiv2;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV4)\n\tconstexpr auto hpre = hpreDiv4;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV8)\n\tconstexpr auto hpre = hpreDiv8;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV16)\n\tconstexpr auto hpre = hpreDiv16;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV64)\n\tconstexpr auto hpre = hpreDiv64;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV128)\n\tconstexpr auto hpre = hpreDiv128;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV256)\n\tconstexpr auto hpre = hpreDiv256;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV512)\n\tconstexpr auto hpre = hpreDiv512;\n#endif\t\/\/ defined(CONFIG_CHIP_STM32F4_RCC_AHB_DIV512)\n\n\tconstexpr uint32_t ahbFrequency {sysclkFrequency \/ hpre};\n\tconfigureAhbClockDivider(hpre);\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV1)\n\tconstexpr auto ppre1 = ppreDiv1;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV2)\n\tconstexpr auto ppre1 = ppreDiv2;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV4)\n\tconstexpr auto ppre1 = ppreDiv4;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV8)\n\tconstexpr auto ppre1 = ppreDiv8;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV16)\n\tconstexpr auto ppre1 = ppreDiv16;\n#endif\t\/\/ defined(CONFIG_CHIP_STM32F4_RCC_APB1_DIV16)\n\n\tconstexpr uint32_t apb1Frequency {ahbFrequency \/ ppre1};\n\tstatic_assert(apb1Frequency <= maxApb1Frequency, \"Invalid APB1 (low speed) frequency!\");\n\tconfigureApbClockDivider(false, ppre1);\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV1)\n\tconstexpr auto ppre2 = ppreDiv1;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV2)\n\tconstexpr auto ppre2 = ppreDiv2;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV4)\n\tconstexpr auto ppre2 = ppreDiv4;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV8)\n\tconstexpr auto ppre2 = ppreDiv8;\n#elif defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV16)\n\tconstexpr auto ppre2 = ppreDiv16;\n#endif\t\/\/ defined(CONFIG_CHIP_STM32F4_RCC_APB2_DIV16)\n\n\tconstexpr uint32_t apb2Frequency {ahbFrequency \/ ppre2};\n\tstatic_assert(apb2Frequency <= maxApb2Frequency, \"Invalid APB2 (high speed) frequency!\");\n\tconfigureApbClockDivider(true, ppre2);\n\n#if CONFIG_CHIP_STM32F4_VDD_MV < 2100\n#\tif defined(CONFIG_CHIP_STM32F401) || defined(CONFIG_CHIP_STM32F410) || defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {16000000};\n#\telse\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {20000000};\n#\tendif\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n#elif CONFIG_CHIP_STM32F4_VDD_MV < 2400\n#\tif defined(CONFIG_CHIP_STM32F401) || defined(CONFIG_CHIP_STM32F410) || defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {18000000};\n#\telse\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {22000000};\n#\tendif\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n#elif CONFIG_CHIP_STM32F4_VDD_MV < 2700\n\tconstexpr uint32_t frequencyThreshold {24000000};\n#else\n\tconstexpr uint32_t frequencyThreshold {30000000};\n#endif\n\n\tconstexpr uint8_t flashLatency {(ahbFrequency - 1) \/ frequencyThreshold};\n\tstatic_assert(flashLatency <= maxFlashLatency, \"Invalid flash latency!\");\n\tconfigureFlashLatency(flashLatency);\n\n\tswitchSystemClock(systemClockSource);\n\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tconstexpr uint32_t ahbFrequency {CONFIG_CHIP_STM32F4_RCC_AHB_FREQUENCY};\n\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tconstexpr uint32_t period {ahbFrequency \/ CONFIG_TICK_FREQUENCY};\n\tconstexpr uint32_t periodDividedBy8 {period \/ 8};\n\tconstexpr bool divideBy8 {period > architecture::maxSysTickPeriod};\n\t\/\/ at least one of the periods must be valid\n\tstatic_assert(period <= architecture::maxSysTickPeriod || periodDividedBy8 <= architecture::maxSysTickPeriod,\n\t\t\t\"Invalid SysTick configuration!\");\n\tarchitecture::configureSysTick(divideBy8 == false ? period : periodDividedBy8, divideBy8);\n}\n\n}\t\/\/ namespace chip\n\n}\t\/\/ namespace distortos\n<commit_msg>Use new numeric values in low-level initialization of STM32F4<commit_after>\/**\n * \\file\n * \\brief chip::lowLevelInitialization() implementation for STM32F4\n *\n * \\author Copyright (C) 2015-2016 Kamil Szczygiel http:\/\/www.distortec.com http:\/\/www.freddiechopin.info\n *\n * \\par License\n * This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not\n * distributed with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n *\/\n\n#include \"distortos\/chip\/lowLevelInitialization.hpp\"\n\n#include \"distortos\/chip\/STM32F4-FLASH.hpp\"\n#include \"distortos\/chip\/STM32F4-PWR.hpp\"\n#include \"distortos\/chip\/STM32F4-RCC.hpp\"\n#include \"distortos\/chip\/STM32F4-RCC-bits.h\"\n\n#include \"distortos\/architecture\/ARMv6-M-ARMv7-M-configureSysTick.hpp\"\n\n#include \"distortos\/chip\/CMSIS-proxy.h\"\n\nnamespace distortos\n{\n\nnamespace chip\n{\n\n\/*---------------------------------------------------------------------------------------------------------------------+\n| global functions\n+---------------------------------------------------------------------------------------------------------------------*\/\n\nvoid lowLevelInitialization()\n{\n#ifdef CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\tstatic_assert(CONFIG_CHIP_STM32F4_VDD_MV >= 2100,\n\t\t\t\"Instruction prefetch must not be enabled when supply voltage is below 2.1V!\");\n\tconfigureInstructionPrefetch(true);\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\tconfigureInstructionPrefetch(false);\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_PREFETCH_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\tenableDataCache();\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\tdisableDataCache();\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_DATA_CACHE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\tenableInstructionCache();\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\tdisableInstructionCache();\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_FLASH_INSTRUCTION_CACHE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tRCC_APB1ENR_PWREN_bb = 1;\n\n\tconfigureVoltageScaling(CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE);\n\n#if (defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) || \\\n\t\tdefined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) && \\\n\t\tdefined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n\tstatic_assert(CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE == 1, \"Over-drive mode requires voltage scale 1 mode!\");\n\tstatic_assert(CONFIG_CHIP_STM32F4_VDD_MV >= 2100,\n\t\t\t\"Over-drive mode must not be enabled when supply voltage is below 2.1V!\");\n\tenableOverDriveMode();\n\tconstexpr uint8_t voltageScaleIndex {0};\n\n#else\t\/\/ !(defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) ||\n\t\t\/\/ defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) ||\n\t\t\/\/ !defined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n\tconstexpr uint8_t voltageScaleIndex {CONFIG_CHIP_STM32F4_PWR_VOLTAGE_SCALE_MODE};\n\n#endif\t\/\/ !(defined(CONFIG_CHIP_STM32F42) || defined(CONFIG_CHIP_STM32F43) || defined(CONFIG_CHIP_STM32F446) ||\n\t\t\/\/ defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)) ||\n\t\t\/\/ !defined(CONFIG_CHIP_STM32F4_PWR_OVER_DRIVE_ENABLE)\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_HSE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tconstexpr bool hseClockBypass {true};\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tconstexpr bool hseClockBypass {};\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_RCC_HSE_CLOCK_BYPASS\n\tenableHse(hseClockBypass);\n\n#endif\t\/\/ def CONFIG_CHIP_STM32F4_RCC_HSE_ENABLE\n\n#ifdef CONFIG_CHIP_STM32F4_RCC_PLL_ENABLE\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_PLLSRC_HSI)\n\tconstexpr bool pllClockSourceHse {};\n\tconstexpr uint32_t pllInFrequency {hsiFrequency};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_PLLSRC_HSE)\n\tconstexpr bool pllClockSourceHse {true};\n\tconstexpr uint32_t pllInFrequency {CONFIG_CHIP_STM32F4_RCC_HSE_FREQUENCY};\n#endif\n\tconfigurePllClockSource(pllClockSourceHse);\n\n\tconstexpr uint32_t vcoInFrequency {pllInFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLM};\n\tstatic_assert(minVcoInFrequency <= vcoInFrequency && vcoInFrequency <= maxVcoInFrequency,\n\t\t\t\"Invalid VCO input frequency!\");\n\tconfigurePllInputClockDivider(CONFIG_CHIP_STM32F4_RCC_PLLM);\n\n\tconstexpr uint32_t vcoOutFrequency {vcoInFrequency * CONFIG_CHIP_STM32F4_RCC_PLLN};\n\tstatic_assert(minVcoOutFrequency <= vcoOutFrequency && vcoOutFrequency <= maxVcoOutFrequency,\n\t\t\t\"Invalid VCO output frequency!\");\n\n\tconstexpr uint32_t pllOutFrequency {vcoOutFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLP};\n\tstatic_assert(pllOutFrequency <= maxPllOutFrequency[voltageScaleIndex], \"Invalid PLL output frequency!\");\n\n\tconstexpr uint32_t pllqOutFrequency {vcoOutFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLQ};\n\tstatic_assert(pllqOutFrequency <= maxPllqOutFrequency, \"Invalid PLL \\\"\/Q\\\" output frequency!\");\n\n#if defined(CONFIG_CHIP_STM32F446) || defined(CONFIG_CHIP_STM32F469) || defined(CONFIG_CHIP_STM32F479)\n\n\tconstexpr uint32_t pllrOutFrequency {vcoOutFrequency \/ CONFIG_CHIP_STM32F4_RCC_PLLR};\n\n\tenablePll(CONFIG_CHIP_STM32F4_RCC_PLLN, CONFIG_CHIP_STM32F4_RCC_PLLP, CONFIG_CHIP_STM32F4_RCC_PLLQ,\n\t\t\tCONFIG_CHIP_STM32F4_RCC_PLLR);\n\n#else \/\/ !defined(CONFIG_CHIP_STM32F446) && !defined(CONFIG_CHIP_STM32F469) && !defined(CONFIG_CHIP_STM32F479)\n\n\tenablePll(CONFIG_CHIP_STM32F4_RCC_PLLN, CONFIG_CHIP_STM32F4_RCC_PLLP, CONFIG_CHIP_STM32F4_RCC_PLLQ);\n\n#endif \/\/ !defined(CONFIG_CHIP_STM32F446) && !defined(CONFIG_CHIP_STM32F469) && !defined(CONFIG_CHIP_STM32F479)\n\n#endif\t\/\/ def CONFIG_CHIP_STM32F4_RCC_PLL_ENABLE\n\n#if defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_HSI)\n\tconstexpr uint32_t sysclkFrequency {hsiFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::hsi};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_HSE)\n\tconstexpr uint32_t sysclkFrequency {CONFIG_CHIP_STM32F4_RCC_HSE_FREQUENCY};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::hse};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLL)\n\tconstexpr uint32_t sysclkFrequency {pllOutFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::pll};\n#elif defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLLR)\n\tconstexpr uint32_t sysclkFrequency {pllrOutFrequency};\n\tconstexpr SystemClockSource systemClockSource {SystemClockSource::pllr};\n#endif\t\/\/ defined(CONFIG_CHIP_STM32F4_RCC_SYSCLK_PLLR)\n\n\tconstexpr uint32_t ahbFrequency {sysclkFrequency \/ CONFIG_CHIP_STM32F4_RCC_HPRE};\n\tconfigureAhbClockDivider(CONFIG_CHIP_STM32F4_RCC_HPRE);\n\n\tconstexpr uint32_t apb1Frequency {ahbFrequency \/ CONFIG_CHIP_STM32F4_RCC_PPRE1};\n\tstatic_assert(apb1Frequency <= maxApb1Frequency, \"Invalid APB1 (low speed) frequency!\");\n\tconfigureApbClockDivider(false, CONFIG_CHIP_STM32F4_RCC_PPRE1);\n\n\tconstexpr uint32_t apb2Frequency {ahbFrequency \/ CONFIG_CHIP_STM32F4_RCC_PPRE2};\n\tstatic_assert(apb2Frequency <= maxApb2Frequency, \"Invalid APB2 (high speed) frequency!\");\n\tconfigureApbClockDivider(true, CONFIG_CHIP_STM32F4_RCC_PPRE2);\n\n#if CONFIG_CHIP_STM32F4_VDD_MV < 2100\n#\tif defined(CONFIG_CHIP_STM32F401) || defined(CONFIG_CHIP_STM32F410) || defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {16000000};\n#\telse\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {20000000};\n#\tendif\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n#elif CONFIG_CHIP_STM32F4_VDD_MV < 2400\n#\tif defined(CONFIG_CHIP_STM32F401) || defined(CONFIG_CHIP_STM32F410) || defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {18000000};\n#\telse\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n\tconstexpr uint32_t frequencyThreshold {22000000};\n#\tendif\t\/\/ !defined(CONFIG_CHIP_STM32F401) && !defined(CONFIG_CHIP_STM32F410) && !defined(CONFIG_CHIP_STM32F411)\n#elif CONFIG_CHIP_STM32F4_VDD_MV < 2700\n\tconstexpr uint32_t frequencyThreshold {24000000};\n#else\n\tconstexpr uint32_t frequencyThreshold {30000000};\n#endif\n\n\tconstexpr uint8_t flashLatency {(ahbFrequency - 1) \/ frequencyThreshold};\n\tstatic_assert(flashLatency <= maxFlashLatency, \"Invalid flash latency!\");\n\tconfigureFlashLatency(flashLatency);\n\n\tswitchSystemClock(systemClockSource);\n\n#else\t\/\/ !def CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tconstexpr uint32_t ahbFrequency {CONFIG_CHIP_STM32F4_RCC_AHB_FREQUENCY};\n\n#endif\t\/\/ !def CONFIG_CHIP_STM32F4_STANDARD_CLOCK_CONFIGURATION_ENABLE\n\n\tconstexpr uint32_t period {ahbFrequency \/ CONFIG_TICK_FREQUENCY};\n\tconstexpr uint32_t periodDividedBy8 {period \/ 8};\n\tconstexpr bool divideBy8 {period > architecture::maxSysTickPeriod};\n\t\/\/ at least one of the periods must be valid\n\tstatic_assert(period <= architecture::maxSysTickPeriod || periodDividedBy8 <= architecture::maxSysTickPeriod,\n\t\t\t\"Invalid SysTick configuration!\");\n\tarchitecture::configureSysTick(divideBy8 == false ? period : periodDividedBy8, divideBy8);\n}\n\n}\t\/\/ namespace chip\n\n}\t\/\/ namespace distortos\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the Pangolin Project.\n * http:\/\/github.com\/stevenlovegrove\/Pangolin\n *\n * Copyright (c) Andrey Mnatsakanov\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"opengl_render_state.hpp\"\n#include <pangolin\/display\/opengl_render_state.h>\n#include <pybind11\/operators.h>\n#include <pybind11\/numpy.h>\n\nnamespace py_pangolin {\n\n void bind_opengl_render_state(pybind11::module &m){\n pybind11::enum_<pangolin::AxisDirection>(m, \"AxisDirection\")\n .value(\"AxisNone\", pangolin::AxisDirection::AxisNone)\n .value(\"AxisNegX\", pangolin::AxisDirection::AxisNegX)\n .value(\"AxisNegY\", pangolin::AxisDirection::AxisNegY)\n .value(\"AxisNegZ\", pangolin::AxisDirection::AxisNegZ)\n .value(\"AxisX\", pangolin::AxisDirection::AxisX)\n .value(\"AxisY\", pangolin::AxisDirection::AxisY)\n .value(\"AxisZ\", pangolin::AxisDirection::AxisZ)\n .export_values();\n\n pybind11::enum_<pangolin::OpenGlStack>(m, \"OpenGlStack\")\n .value(\"GlModelViewStack\", pangolin::OpenGlStack::GlModelViewStack)\n .value(\"GlProjectionStack\", pangolin::OpenGlStack::GlProjectionStack)\n .value(\"GlTextureStack\", pangolin::OpenGlStack::GlTextureStack)\n .export_values();\n\n pybind11::class_<pangolin::OpenGlMatrix>(m, \"OpenGlMatrix\")\n .def(\"Translate\", &pangolin::OpenGlMatrix::Translate)\n .def(\"Scale\", &pangolin::OpenGlMatrix::Scale)\n .def(\"RotateX\", &pangolin::OpenGlMatrix::RotateX)\n .def(\"RotateY\", &pangolin::OpenGlMatrix::RotateY)\n .def(\"RotateZ\", &pangolin::OpenGlMatrix::RotateX)\n .def(pybind11::init<>())\n .def(\"Load\", &pangolin::OpenGlMatrix::Load)\n .def(\"Multiply\", &pangolin::OpenGlMatrix::Multiply)\n .def(\"SetIdentity\", &pangolin::OpenGlMatrix::SetIdentity)\n .def(\"Transpose\", &pangolin::OpenGlMatrix::Transpose)\n .def(\"Inverse\", &pangolin::OpenGlMatrix::Inverse)\n .def(\"Matrix\", [](pangolin::OpenGlMatrix& mat){\n using T = pangolin::GLprecision;\n return pybind11::array_t<T>( {4, 4 }, {1*sizeof(T), 4*sizeof(T)}, mat.m );\n })\n .def(pybind11::self * pybind11::self);\n\n pybind11::class_<pangolin::OpenGlMatrixSpec, pangolin::OpenGlMatrix>(m, \"OpenGlMatrixSpec\")\n .def(pybind11::init<>());\n\n m.def(\"ProjectionMatrixRUB_BottomLeft\", &pangolin::ProjectionMatrixRUB_BottomLeft);\n m.def(\"ProjectionMatrixRUB_TopLeft\", &pangolin::ProjectionMatrixRUB_TopLeft);\n m.def(\"ProjectionMatrixRDF_BottomLeft\", &pangolin::ProjectionMatrixRDF_BottomLeft);\n m.def(\"ProjectionMatrixRDF_TopLeft\", &pangolin::ProjectionMatrixRDF_TopLeft);\n m.def(\"ProjectionMatrix\", &pangolin::ProjectionMatrix);\n m.def(\"ProjectionMatrixOrthographic\", &pangolin::ProjectionMatrixOrthographic);\n m.def(\"ModelViewLookAtRUB\", &pangolin::ModelViewLookAtRUB);\n m.def(\"ModelViewLookAtRDF\", &pangolin::ModelViewLookAtRDF);\n m.def(\"ModelViewLookAt\", (pangolin::OpenGlMatrix (*)(pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::AxisDirection))&pangolin::ModelViewLookAt);\n m.def(\"ModelViewLookAt\", (pangolin::OpenGlMatrix (*)(pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision))&pangolin::ModelViewLookAt);\n m.def(\"IdentityMatrix\", (pangolin::OpenGlMatrix (*)())&pangolin::IdentityMatrix);\n m.def(\"IdentityMatrix\", (pangolin::OpenGlMatrixSpec (*)(pangolin::OpenGlStack))&pangolin::IdentityMatrix);\n m.def(\"negIdentityMatrix\", &pangolin::negIdentityMatrix);\n\n pybind11::class_<pangolin::OpenGlRenderState>(m, \"OpenGlRenderState\")\n .def(pybind11::init<const pangolin::OpenGlMatrix&>())\n .def(pybind11::init<const pangolin::OpenGlMatrix&, const pangolin::OpenGlMatrix&>())\n .def(pybind11::init<>())\n .def(\"ApplyIdentity\", &pangolin::OpenGlRenderState::ApplyIdentity)\n .def(\"Apply\", &pangolin::OpenGlRenderState::Apply)\n .def(\"SetProjectionMatrix\", &pangolin::OpenGlRenderState::SetProjectionMatrix)\n .def(\"SetModelViewMatrix\", &pangolin::OpenGlRenderState::SetModelViewMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)())&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)() const)&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)())&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)() const)&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"GetProjectionModelViewMatrix\", &pangolin::OpenGlRenderState::GetProjectionModelViewMatrix)\n .def(\"GetProjectiveTextureMatrix\", &pangolin::OpenGlRenderState::GetProjectiveTextureMatrix)\n .def(\"EnableProjectiveTexturing\", &pangolin::OpenGlRenderState::EnableProjectiveTexturing)\n .def(\"DisableProjectiveTexturing\", &pangolin::OpenGlRenderState::DisableProjectiveTexturing)\n .def(\"Follow\", &pangolin::OpenGlRenderState::Follow, pybind11::arg(\"T_wc\"), pybind11::arg(\"follow\")=true)\n .def(\"Unfollow\", &pangolin::OpenGlRenderState::Unfollow)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)(unsigned int))&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(unsigned int) const)&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetViewOffset\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)(unsigned int))&pangolin::OpenGlRenderState::GetViewOffset)\n .def(\"GetViewOffset\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(unsigned int) const)&pangolin::OpenGlRenderState::GetViewOffset)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(int) const)&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"ApplyNView\", &pangolin::OpenGlRenderState::ApplyNView);\n }\n\n} \/\/ py_pangolin\n<commit_msg>Fixing typo in pybind module<commit_after>\/* This file is part of the Pangolin Project.\n * http:\/\/github.com\/stevenlovegrove\/Pangolin\n *\n * Copyright (c) Andrey Mnatsakanov\n *\n * Permission is hereby granted, free of charge, to any person\n * obtaining a copy of this software and associated documentation\n * files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use,\n * copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following\n * conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n * OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"opengl_render_state.hpp\"\n#include <pangolin\/display\/opengl_render_state.h>\n#include <pybind11\/operators.h>\n#include <pybind11\/numpy.h>\n\nnamespace py_pangolin {\n\n void bind_opengl_render_state(pybind11::module &m){\n pybind11::enum_<pangolin::AxisDirection>(m, \"AxisDirection\")\n .value(\"AxisNone\", pangolin::AxisDirection::AxisNone)\n .value(\"AxisNegX\", pangolin::AxisDirection::AxisNegX)\n .value(\"AxisNegY\", pangolin::AxisDirection::AxisNegY)\n .value(\"AxisNegZ\", pangolin::AxisDirection::AxisNegZ)\n .value(\"AxisX\", pangolin::AxisDirection::AxisX)\n .value(\"AxisY\", pangolin::AxisDirection::AxisY)\n .value(\"AxisZ\", pangolin::AxisDirection::AxisZ)\n .export_values();\n\n pybind11::enum_<pangolin::OpenGlStack>(m, \"OpenGlStack\")\n .value(\"GlModelViewStack\", pangolin::OpenGlStack::GlModelViewStack)\n .value(\"GlProjectionStack\", pangolin::OpenGlStack::GlProjectionStack)\n .value(\"GlTextureStack\", pangolin::OpenGlStack::GlTextureStack)\n .export_values();\n\n pybind11::class_<pangolin::OpenGlMatrix>(m, \"OpenGlMatrix\")\n .def(\"Translate\", &pangolin::OpenGlMatrix::Translate)\n .def(\"Scale\", &pangolin::OpenGlMatrix::Scale)\n .def(\"RotateX\", &pangolin::OpenGlMatrix::RotateX)\n .def(\"RotateY\", &pangolin::OpenGlMatrix::RotateY)\n .def(\"RotateZ\", &pangolin::OpenGlMatrix::RotateZ)\n .def(pybind11::init<>())\n .def(\"Load\", &pangolin::OpenGlMatrix::Load)\n .def(\"Multiply\", &pangolin::OpenGlMatrix::Multiply)\n .def(\"SetIdentity\", &pangolin::OpenGlMatrix::SetIdentity)\n .def(\"Transpose\", &pangolin::OpenGlMatrix::Transpose)\n .def(\"Inverse\", &pangolin::OpenGlMatrix::Inverse)\n .def(\"Matrix\", [](pangolin::OpenGlMatrix& mat){\n using T = pangolin::GLprecision;\n return pybind11::array_t<T>( {4, 4 }, {1*sizeof(T), 4*sizeof(T)}, mat.m );\n })\n .def(pybind11::self * pybind11::self);\n\n pybind11::class_<pangolin::OpenGlMatrixSpec, pangolin::OpenGlMatrix>(m, \"OpenGlMatrixSpec\")\n .def(pybind11::init<>());\n\n m.def(\"ProjectionMatrixRUB_BottomLeft\", &pangolin::ProjectionMatrixRUB_BottomLeft);\n m.def(\"ProjectionMatrixRUB_TopLeft\", &pangolin::ProjectionMatrixRUB_TopLeft);\n m.def(\"ProjectionMatrixRDF_BottomLeft\", &pangolin::ProjectionMatrixRDF_BottomLeft);\n m.def(\"ProjectionMatrixRDF_TopLeft\", &pangolin::ProjectionMatrixRDF_TopLeft);\n m.def(\"ProjectionMatrix\", &pangolin::ProjectionMatrix);\n m.def(\"ProjectionMatrixOrthographic\", &pangolin::ProjectionMatrixOrthographic);\n m.def(\"ModelViewLookAtRUB\", &pangolin::ModelViewLookAtRUB);\n m.def(\"ModelViewLookAtRDF\", &pangolin::ModelViewLookAtRDF);\n m.def(\"ModelViewLookAt\", (pangolin::OpenGlMatrix (*)(pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::AxisDirection))&pangolin::ModelViewLookAt);\n m.def(\"ModelViewLookAt\", (pangolin::OpenGlMatrix (*)(pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision, pangolin::GLprecision))&pangolin::ModelViewLookAt);\n m.def(\"IdentityMatrix\", (pangolin::OpenGlMatrix (*)())&pangolin::IdentityMatrix);\n m.def(\"IdentityMatrix\", (pangolin::OpenGlMatrixSpec (*)(pangolin::OpenGlStack))&pangolin::IdentityMatrix);\n m.def(\"negIdentityMatrix\", &pangolin::negIdentityMatrix);\n\n pybind11::class_<pangolin::OpenGlRenderState>(m, \"OpenGlRenderState\")\n .def(pybind11::init<const pangolin::OpenGlMatrix&>())\n .def(pybind11::init<const pangolin::OpenGlMatrix&, const pangolin::OpenGlMatrix&>())\n .def(pybind11::init<>())\n .def(\"ApplyIdentity\", &pangolin::OpenGlRenderState::ApplyIdentity)\n .def(\"Apply\", &pangolin::OpenGlRenderState::Apply)\n .def(\"SetProjectionMatrix\", &pangolin::OpenGlRenderState::SetProjectionMatrix)\n .def(\"SetModelViewMatrix\", &pangolin::OpenGlRenderState::SetModelViewMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)())&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)() const)&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)())&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)() const)&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"GetProjectionModelViewMatrix\", &pangolin::OpenGlRenderState::GetProjectionModelViewMatrix)\n .def(\"GetProjectiveTextureMatrix\", &pangolin::OpenGlRenderState::GetProjectiveTextureMatrix)\n .def(\"EnableProjectiveTexturing\", &pangolin::OpenGlRenderState::EnableProjectiveTexturing)\n .def(\"DisableProjectiveTexturing\", &pangolin::OpenGlRenderState::DisableProjectiveTexturing)\n .def(\"Follow\", &pangolin::OpenGlRenderState::Follow, pybind11::arg(\"T_wc\"), pybind11::arg(\"follow\")=true)\n .def(\"Unfollow\", &pangolin::OpenGlRenderState::Unfollow)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)(unsigned int))&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetProjectionMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(unsigned int) const)&pangolin::OpenGlRenderState::GetProjectionMatrix)\n .def(\"GetViewOffset\", (pangolin::OpenGlMatrix& (pangolin::OpenGlRenderState::*)(unsigned int))&pangolin::OpenGlRenderState::GetViewOffset)\n .def(\"GetViewOffset\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(unsigned int) const)&pangolin::OpenGlRenderState::GetViewOffset)\n .def(\"GetModelViewMatrix\", (pangolin::OpenGlMatrix (pangolin::OpenGlRenderState::*)(int) const)&pangolin::OpenGlRenderState::GetModelViewMatrix)\n .def(\"ApplyNView\", &pangolin::OpenGlRenderState::ApplyNView);\n }\n\n} \/\/ py_pangolin\n<|endoftext|>"} {"text":"<commit_before>#include \"buffer.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"window.hh\"\n#include \"assert.hh\"\n#include \"utils.hh\"\n#include \"hook_manager.hh\"\n#include \"context.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\ntemplate<typename T>\nT clamp(T min, T max, T val)\n{\n if (val < min)\n return min;\n if (val > max)\n return max;\n return val;\n}\n\nBuffer::Buffer(const String& name, Type type,\n const String& initial_content)\n : m_name(name), m_type(type),\n m_history(1), m_history_cursor(m_history.begin()),\n m_last_save_undo_index(0),\n m_option_manager(GlobalOptionManager::instance())\n{\n BufferManager::instance().register_buffer(this);\n if (not initial_content.empty())\n apply_modification(Modification::make_insert(begin(), initial_content));\n\n if (type == Type::NewFile)\n GlobalHookManager::instance().run_hook(\"BufCreate\", name, Context(*this));\n else if (type == Type::File)\n GlobalHookManager::instance().run_hook(\"BufOpen\", name, Context(*this));\n}\n\nBuffer::~Buffer()\n{\n m_windows.clear();\n BufferManager::instance().unregister_buffer(this);\n assert(m_iterators_to_update.empty());\n}\n\nBufferIterator Buffer::iterator_at(const BufferCoord& line_and_column) const\n{\n return BufferIterator(*this, clamp(line_and_column));\n}\n\nBufferCoord Buffer::line_and_column_at(const BufferIterator& iterator) const\n{\n return iterator.m_coord;\n}\n\nBufferPos Buffer::line_at(const BufferIterator& iterator) const\n{\n return iterator.line();\n}\n\nBufferSize Buffer::line_length(BufferPos line) const\n{\n assert(line < line_count());\n BufferPos end = (line < m_lines.size() - 1) ?\n m_lines[line + 1].start : length();\n return end - m_lines[line].start;\n}\n\nBufferCoord Buffer::clamp(const BufferCoord& line_and_column) const\n{\n if (m_lines.empty())\n return BufferCoord();\n\n BufferCoord result(line_and_column.line, line_and_column.column);\n result.line = Kakoune::clamp<int>(0, m_lines.size() - 1, result.line);\n int max_col = std::max(0, line_length(result.line) - 2);\n result.column = Kakoune::clamp<int>(0, max_col, result.column);\n return result;\n}\n\nBufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const\n{\n return BufferIterator(*this, { iterator.line(), 0 });\n}\n\nBufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const\n{\n BufferPos line = iterator.line();\n return ++BufferIterator(*this, { line, std::max(line_length(line) - 1, 0) });\n}\n\nBufferIterator Buffer::begin() const\n{\n return BufferIterator(*this, { 0, 0 });\n}\n\nBufferIterator Buffer::end() const\n{\n if (m_lines.empty())\n return BufferIterator(*this, { 0, 0 });\n return BufferIterator(*this, { (int)line_count()-1, (int)m_lines.back().length() });\n}\n\nBufferSize Buffer::length() const\n{\n if (m_lines.empty())\n return 0;\n return m_lines.back().start + m_lines.back().length();\n}\n\nBufferSize Buffer::line_count() const\n{\n return m_lines.size();\n}\n\nString Buffer::string(const BufferIterator& begin, const BufferIterator& end) const\n{\n String res;\n for (BufferPos line = begin.line(); line <= end.line(); ++line)\n {\n size_t start = 0;\n if (line == begin.line())\n start = begin.column();\n size_t count = -1;\n if (line == end.line())\n count = end.column() - start;\n res += m_lines[line].content.substr(start, count);\n }\n return res;\n}\n\nvoid Buffer::begin_undo_group()\n{\n assert(m_current_undo_group.empty());\n m_history.erase(m_history_cursor, m_history.end());\n\n if (m_history.size() < m_last_save_undo_index)\n m_last_save_undo_index = -1;\n\n m_history_cursor = m_history.end();\n}\n\nvoid Buffer::end_undo_group()\n{\n m_history.push_back(m_current_undo_group);\n m_history_cursor = m_history.end();\n\n m_current_undo_group.clear();\n}\n\nModification Modification::inverse() const\n{\n Type inverse_type;\n switch (type)\n {\n case Insert: inverse_type = Erase; break;\n case Erase: inverse_type = Insert; break;\n default: assert(false);\n }\n return Modification(inverse_type, position, content);\n}\n\nbool Buffer::undo()\n{\n if (m_history_cursor == m_history.begin())\n return false;\n\n --m_history_cursor;\n\n for (const Modification& modification : reversed(*m_history_cursor))\n apply_modification(modification.inverse());\n}\n\nbool Buffer::redo()\n{\n if (m_history_cursor == m_history.end())\n return false;\n\n for (const Modification& modification : *m_history_cursor)\n apply_modification(modification);\n\n ++m_history_cursor;\n}\n\nvoid Buffer::check_invariant() const\n{\n BufferSize start = 0;\n for (auto& line : m_lines)\n {\n assert(line.start == start);\n assert(line.length() > 0);\n start += line.length();\n }\n}\n\nvoid Buffer::insert(const BufferIterator& pos, const String& content)\n{\n BufferSize offset = pos.offset();\n\n \/\/ all following lines advanced by length\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start += content.length();\n\n BufferCoord end_pos;\n \/\/ if we inserted at the end of the buffer, we may have created a new\n \/\/ line without inserting a '\\n'\n if (pos == end() and (pos == begin() or *(pos-1) == '\\n'))\n {\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n m_lines.push_back({ offset + start, content.substr(start, i + 1 - start) });\n start = i + 1;\n }\n }\n if (start != content.length())\n m_lines.push_back({ offset + start, content.substr(start) });\n\n end_pos = end().m_coord;\n }\n else\n {\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[pos.line()].content.substr(pos.column());\n\n auto line_it = m_lines.begin() + pos.line();\n line_it = m_lines.erase(line_it);\n\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n String line_content = content.substr(start, i + 1 - start);\n if (start == 0)\n {\n line_content = prefix + line_content;\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(),\n std::move(line_content) });\n }\n else\n line_it = m_lines.insert(line_it, { offset + start,\n std::move(line_content) });\n\n ++line_it;\n start = i + 1;\n }\n }\n if (start == 0)\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(), prefix + content + suffix });\n else\n line_it = m_lines.insert(line_it, { offset + start, content.substr(start) + suffix });\n\n end_pos = { int(line_it - m_lines.begin()), int(line_it->length() - suffix.length()) };\n }\n\n check_invariant();\n\n for (auto iterator : m_iterators_to_update)\n iterator->on_insert(pos.m_coord, end_pos);\n}\n\nvoid Buffer::erase(const BufferIterator& pos, BufferSize length)\n{\n BufferIterator end = pos + length;\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[end.line()].content.substr(end.column());\n Line new_line = { m_lines[pos.line()].start, prefix + suffix };\n\n m_lines.erase(m_lines.begin() + pos.line(), m_lines.begin() + end.line() + 1);\n if (new_line.length())\n m_lines.insert(m_lines.begin() + pos.line(), std::move(new_line));\n\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start -= length;\n\n check_invariant();\n\n for (auto iterator : m_iterators_to_update)\n iterator->on_erase(pos.m_coord, end.m_coord);\n}\n\nvoid Buffer::apply_modification(const Modification& modification)\n{\n const String& content = modification.content;\n const BufferIterator& pos = modification.position;\n\n switch (modification.type)\n {\n case Modification::Insert:\n {\n BufferIterator pos = modification.position < end() ?\n modification.position : end();\n insert(pos, modification.content);\n break;\n }\n case Modification::Erase:\n {\n size_t count = modification.content.length();\n assert(string(modification.position, modification.position + count)\n == modification.content);\n erase(modification.position, count);\n break;\n }\n default:\n assert(false);\n }\n}\n\nvoid Buffer::modify(Modification&& modification)\n{\n if (modification.content.empty())\n return;\n\n apply_modification(modification);\n m_current_undo_group.push_back(std::move(modification));\n}\n\nWindow* Buffer::get_or_create_window()\n{\n if (m_windows.empty())\n m_windows.push_front(std::unique_ptr<Window>(new Window(*this)));\n\n return m_windows.front().get();\n}\n\nvoid Buffer::delete_window(Window* window)\n{\n assert(&window->buffer() == this);\n auto window_it = std::find(m_windows.begin(), m_windows.end(), window);\n assert(window_it != m_windows.end());\n m_windows.erase(window_it);\n}\n\nbool Buffer::is_modified() const\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n return m_last_save_undo_index != history_cursor_index\n or not m_current_undo_group.empty();\n}\n\nvoid Buffer::notify_saved()\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n m_last_save_undo_index = history_cursor_index;\n}\n\nvoid Buffer::add_iterator_to_update(BufferIterator& iterator)\n{\n assert(not contains(m_iterators_to_update, &iterator));\n m_iterators_to_update.push_back(&iterator);\n}\n\nvoid Buffer::remove_iterator_from_update(BufferIterator& iterator)\n{\n auto it = std::find(m_iterators_to_update.begin(),\n m_iterators_to_update.end(),\n &iterator);\n assert(it != m_iterators_to_update.end());\n m_iterators_to_update.erase(it);\n}\n\n}\n<commit_msg>check if no modification were made in Buffer::end_undo_group<commit_after>#include \"buffer.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"window.hh\"\n#include \"assert.hh\"\n#include \"utils.hh\"\n#include \"hook_manager.hh\"\n#include \"context.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\ntemplate<typename T>\nT clamp(T min, T max, T val)\n{\n if (val < min)\n return min;\n if (val > max)\n return max;\n return val;\n}\n\nBuffer::Buffer(const String& name, Type type,\n const String& initial_content)\n : m_name(name), m_type(type),\n m_history(1), m_history_cursor(m_history.begin()),\n m_last_save_undo_index(0),\n m_option_manager(GlobalOptionManager::instance())\n{\n BufferManager::instance().register_buffer(this);\n if (not initial_content.empty())\n apply_modification(Modification::make_insert(begin(), initial_content));\n\n if (type == Type::NewFile)\n GlobalHookManager::instance().run_hook(\"BufCreate\", name, Context(*this));\n else if (type == Type::File)\n GlobalHookManager::instance().run_hook(\"BufOpen\", name, Context(*this));\n}\n\nBuffer::~Buffer()\n{\n m_windows.clear();\n BufferManager::instance().unregister_buffer(this);\n assert(m_iterators_to_update.empty());\n}\n\nBufferIterator Buffer::iterator_at(const BufferCoord& line_and_column) const\n{\n return BufferIterator(*this, clamp(line_and_column));\n}\n\nBufferCoord Buffer::line_and_column_at(const BufferIterator& iterator) const\n{\n return iterator.m_coord;\n}\n\nBufferPos Buffer::line_at(const BufferIterator& iterator) const\n{\n return iterator.line();\n}\n\nBufferSize Buffer::line_length(BufferPos line) const\n{\n assert(line < line_count());\n BufferPos end = (line < m_lines.size() - 1) ?\n m_lines[line + 1].start : length();\n return end - m_lines[line].start;\n}\n\nBufferCoord Buffer::clamp(const BufferCoord& line_and_column) const\n{\n if (m_lines.empty())\n return BufferCoord();\n\n BufferCoord result(line_and_column.line, line_and_column.column);\n result.line = Kakoune::clamp<int>(0, m_lines.size() - 1, result.line);\n int max_col = std::max(0, line_length(result.line) - 2);\n result.column = Kakoune::clamp<int>(0, max_col, result.column);\n return result;\n}\n\nBufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const\n{\n return BufferIterator(*this, { iterator.line(), 0 });\n}\n\nBufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const\n{\n BufferPos line = iterator.line();\n return ++BufferIterator(*this, { line, std::max(line_length(line) - 1, 0) });\n}\n\nBufferIterator Buffer::begin() const\n{\n return BufferIterator(*this, { 0, 0 });\n}\n\nBufferIterator Buffer::end() const\n{\n if (m_lines.empty())\n return BufferIterator(*this, { 0, 0 });\n return BufferIterator(*this, { (int)line_count()-1, (int)m_lines.back().length() });\n}\n\nBufferSize Buffer::length() const\n{\n if (m_lines.empty())\n return 0;\n return m_lines.back().start + m_lines.back().length();\n}\n\nBufferSize Buffer::line_count() const\n{\n return m_lines.size();\n}\n\nString Buffer::string(const BufferIterator& begin, const BufferIterator& end) const\n{\n String res;\n for (BufferPos line = begin.line(); line <= end.line(); ++line)\n {\n size_t start = 0;\n if (line == begin.line())\n start = begin.column();\n size_t count = -1;\n if (line == end.line())\n count = end.column() - start;\n res += m_lines[line].content.substr(start, count);\n }\n return res;\n}\n\nvoid Buffer::begin_undo_group()\n{\n assert(m_current_undo_group.empty());\n m_history.erase(m_history_cursor, m_history.end());\n\n if (m_history.size() < m_last_save_undo_index)\n m_last_save_undo_index = -1;\n\n m_history_cursor = m_history.end();\n}\n\nvoid Buffer::end_undo_group()\n{\n if (m_current_undo_group.empty())\n return;\n\n m_history.push_back(m_current_undo_group);\n m_history_cursor = m_history.end();\n\n m_current_undo_group.clear();\n}\n\nModification Modification::inverse() const\n{\n Type inverse_type;\n switch (type)\n {\n case Insert: inverse_type = Erase; break;\n case Erase: inverse_type = Insert; break;\n default: assert(false);\n }\n return Modification(inverse_type, position, content);\n}\n\nbool Buffer::undo()\n{\n if (m_history_cursor == m_history.begin())\n return false;\n\n --m_history_cursor;\n\n for (const Modification& modification : reversed(*m_history_cursor))\n apply_modification(modification.inverse());\n}\n\nbool Buffer::redo()\n{\n if (m_history_cursor == m_history.end())\n return false;\n\n for (const Modification& modification : *m_history_cursor)\n apply_modification(modification);\n\n ++m_history_cursor;\n}\n\nvoid Buffer::check_invariant() const\n{\n BufferSize start = 0;\n for (auto& line : m_lines)\n {\n assert(line.start == start);\n assert(line.length() > 0);\n start += line.length();\n }\n}\n\nvoid Buffer::insert(const BufferIterator& pos, const String& content)\n{\n BufferSize offset = pos.offset();\n\n \/\/ all following lines advanced by length\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start += content.length();\n\n BufferCoord end_pos;\n \/\/ if we inserted at the end of the buffer, we may have created a new\n \/\/ line without inserting a '\\n'\n if (pos == end() and (pos == begin() or *(pos-1) == '\\n'))\n {\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n m_lines.push_back({ offset + start, content.substr(start, i + 1 - start) });\n start = i + 1;\n }\n }\n if (start != content.length())\n m_lines.push_back({ offset + start, content.substr(start) });\n\n end_pos = end().m_coord;\n }\n else\n {\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[pos.line()].content.substr(pos.column());\n\n auto line_it = m_lines.begin() + pos.line();\n line_it = m_lines.erase(line_it);\n\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n String line_content = content.substr(start, i + 1 - start);\n if (start == 0)\n {\n line_content = prefix + line_content;\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(),\n std::move(line_content) });\n }\n else\n line_it = m_lines.insert(line_it, { offset + start,\n std::move(line_content) });\n\n ++line_it;\n start = i + 1;\n }\n }\n if (start == 0)\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(), prefix + content + suffix });\n else\n line_it = m_lines.insert(line_it, { offset + start, content.substr(start) + suffix });\n\n end_pos = { int(line_it - m_lines.begin()), int(line_it->length() - suffix.length()) };\n }\n\n check_invariant();\n\n for (auto iterator : m_iterators_to_update)\n iterator->on_insert(pos.m_coord, end_pos);\n}\n\nvoid Buffer::erase(const BufferIterator& pos, BufferSize length)\n{\n BufferIterator end = pos + length;\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[end.line()].content.substr(end.column());\n Line new_line = { m_lines[pos.line()].start, prefix + suffix };\n\n m_lines.erase(m_lines.begin() + pos.line(), m_lines.begin() + end.line() + 1);\n if (new_line.length())\n m_lines.insert(m_lines.begin() + pos.line(), std::move(new_line));\n\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start -= length;\n\n check_invariant();\n\n for (auto iterator : m_iterators_to_update)\n iterator->on_erase(pos.m_coord, end.m_coord);\n}\n\nvoid Buffer::apply_modification(const Modification& modification)\n{\n const String& content = modification.content;\n const BufferIterator& pos = modification.position;\n\n switch (modification.type)\n {\n case Modification::Insert:\n {\n BufferIterator pos = modification.position < end() ?\n modification.position : end();\n insert(pos, modification.content);\n break;\n }\n case Modification::Erase:\n {\n size_t count = modification.content.length();\n assert(string(modification.position, modification.position + count)\n == modification.content);\n erase(modification.position, count);\n break;\n }\n default:\n assert(false);\n }\n}\n\nvoid Buffer::modify(Modification&& modification)\n{\n if (modification.content.empty())\n return;\n\n apply_modification(modification);\n m_current_undo_group.push_back(std::move(modification));\n}\n\nWindow* Buffer::get_or_create_window()\n{\n if (m_windows.empty())\n m_windows.push_front(std::unique_ptr<Window>(new Window(*this)));\n\n return m_windows.front().get();\n}\n\nvoid Buffer::delete_window(Window* window)\n{\n assert(&window->buffer() == this);\n auto window_it = std::find(m_windows.begin(), m_windows.end(), window);\n assert(window_it != m_windows.end());\n m_windows.erase(window_it);\n}\n\nbool Buffer::is_modified() const\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n return m_last_save_undo_index != history_cursor_index\n or not m_current_undo_group.empty();\n}\n\nvoid Buffer::notify_saved()\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n m_last_save_undo_index = history_cursor_index;\n}\n\nvoid Buffer::add_iterator_to_update(BufferIterator& iterator)\n{\n assert(not contains(m_iterators_to_update, &iterator));\n m_iterators_to_update.push_back(&iterator);\n}\n\nvoid Buffer::remove_iterator_from_update(BufferIterator& iterator)\n{\n auto it = std::find(m_iterators_to_update.begin(),\n m_iterators_to_update.end(),\n &iterator);\n assert(it != m_iterators_to_update.end());\n m_iterators_to_update.erase(it);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <boost\/algorithm\/string.hpp>\n#include <iostream>\nusing namespace std;\n\nconst string alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nstring encrypt(const string& plaintext, const string& keyword)\n{\n \/* Returns the ciphertext produced by encrypting the plaintext using the\n * given keyword and the Vigenere Cipher\n * (http:\/\/en.wikipedia.org\/wiki\/Vigen%C3%A8re_cipher).\n *\/\n\n string ciphertext = \"\";\n\n string caps_keyword = boost::algorithm::to_upper_copy<string>(keyword);\n string caps_plaintext = boost::algorithm::to_upper_copy<string>(plaintext);\n\n string keyphrase = \"\";\n for (int i = 0; i < plaintext.length() \/ keyword.length() + 1; i++)\n {\n keyphrase += caps_keyword;\n }\n keyphrase.resize(plaintext.length());\n\n for (int i = 0; i < plaintext.length(); i++)\n {\n int start_index = alphabet.find(caps_plaintext[i]);\n int advance_by = alphabet.find(keyphrase[i]);\n int new_index = (start_index + advance_by) % alphabet.length();\n\n ciphertext += alphabet[new_index];\n }\n\n return ciphertext;\n}\n\nstring decrypt(const string& ciphertext, const string& keyword)\n{\n \/* Returns the plaintext produced by decrypting the ciphertext using the\n * given keyword and the Vigenere Cipher\n * (http:\/\/en.wikipedia.org\/wiki\/Vigen%C3%A8re_cipher).\n *\/\n string plaintext = \"\";\n\n \/\/ XXXX: Finish me!\n\n return plaintext;\n}\n<commit_msg>get_keyphrase method.<commit_after>#include <boost\/algorithm\/string.hpp>\n#include <iostream>\nusing namespace std;\n\nconst string alphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\nstring get_keyphrase(const string& keyword, const string& text)\n{\n \/* Returns the Vigenere keyword of appropriate length (in all caps) for a\n * given keyword and text (either plaintext or ciphertext).\n *\/\n\n return \"TODO\";\n}\n\n\nstring encrypt(const string& plaintext, const string& keyword)\n{\n \/* Returns the ciphertext produced by encrypting the plaintext using the\n * given keyword and the Vigenere Cipher\n * (http:\/\/en.wikipedia.org\/wiki\/Vigen%C3%A8re_cipher).\n *\/\n\n string ciphertext = \"\";\n\n string caps_keyword = boost::algorithm::to_upper_copy<string>(keyword);\n string caps_plaintext = boost::algorithm::to_upper_copy<string>(plaintext);\n\n string keyphrase = \"\";\n for (int i = 0; i < plaintext.length() \/ keyword.length() + 1; i++)\n {\n keyphrase += caps_keyword;\n }\n keyphrase.resize(plaintext.length());\n\n for (int i = 0; i < plaintext.length(); i++)\n {\n int start_index = alphabet.find(caps_plaintext[i]);\n int advance_by = alphabet.find(keyphrase[i]);\n int new_index = (start_index + advance_by) % alphabet.length();\n\n ciphertext += alphabet[new_index];\n }\n\n return ciphertext;\n}\n\nstring decrypt(const string& ciphertext, const string& keyword)\n{\n \/* Returns the plaintext produced by decrypting the ciphertext using the\n * given keyword and the Vigenere Cipher\n * (http:\/\/en.wikipedia.org\/wiki\/Vigen%C3%A8re_cipher).\n *\/\n string plaintext = \"\";\n\n \/\/ XXXX: Finish me!\n\n return plaintext;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008 Gael Guennebaud <g.gael@free.fr>\n\/\/\n\/\/ Eigen is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ Alternatively, you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License as\n\/\/ published by the Free Software Foundation; either version 2 of\n\/\/ the License, or (at your option) any later version.\n\/\/\n\/\/ Eigen is distributed in the hope that it will be useful, but WITHOUT ANY\n\/\/ WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n\/\/ FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License and a copy of the GNU General Public License along with\n\/\/ Eigen. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef EIGEN_NO_ASSERTION_CHECKING\n#define EIGEN_NO_ASSERTION_CHECKING\n#endif\n\nstatic int nb_temporaries;\n\n#define EIGEN_DEBUG_MATRIX_CTOR { if(size!=0) nb_temporaries++; }\n\n#include \"main.h\"\n#include <Eigen\/Cholesky>\n#include <Eigen\/QR>\n\n#define VERIFY_EVALUATION_COUNT(XPR,N) {\\\n nb_temporaries = 0; \\\n XPR; \\\n if(nb_temporaries!=N) std::cerr << \"nb_temporaries == \" << nb_temporaries << \"\\n\"; \\\n VERIFY( (#XPR) && nb_temporaries==N ); \\\n }\n\n#ifdef HAS_GSL\n#include \"gsl_helper.h\"\n#endif\n\ntemplate<typename MatrixType> void cholesky(const MatrixType& m)\n{\n \/* this test covers the following files:\n LLT.h LDLT.h\n *\/\n int rows = m.rows();\n int cols = m.cols();\n\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\n\n MatrixType a0 = MatrixType::Random(rows,cols);\n VectorType vecB = VectorType::Random(rows), vecX(rows);\n MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);\n SquareMatrixType symm = a0 * a0.adjoint();\n \/\/ let's make sure the matrix is not singular or near singular\n for (int k=0; k<3; ++k)\n {\n MatrixType a1 = MatrixType::Random(rows,cols);\n symm += a1 * a1.adjoint();\n }\n\n SquareMatrixType symmUp = symm.template triangularView<Upper>();\n SquareMatrixType symmLo = symm.template triangularView<Lower>();\n\n \/\/ to test if really Cholesky only uses the upper triangular part, uncomment the following\n \/\/ FIXME: currently that fails !!\n \/\/symm.template part<StrictlyLower>().setZero();\n\n #ifdef HAS_GSL\n\/\/ if (ei_is_same_type<RealScalar,double>::ret)\n\/\/ {\n\/\/ typedef GslTraits<Scalar> Gsl;\n\/\/ typename Gsl::Matrix gMatA=0, gSymm=0;\n\/\/ typename Gsl::Vector gVecB=0, gVecX=0;\n\/\/ convert<MatrixType>(symm, gSymm);\n\/\/ convert<MatrixType>(symm, gMatA);\n\/\/ convert<VectorType>(vecB, gVecB);\n\/\/ convert<VectorType>(vecB, gVecX);\n\/\/ Gsl::cholesky(gMatA);\n\/\/ Gsl::cholesky_solve(gMatA, gVecB, gVecX);\n\/\/ VectorType vecX(rows), _vecX, _vecB;\n\/\/ convert(gVecX, _vecX);\n\/\/ symm.llt().solve(vecB, &vecX);\n\/\/ Gsl::prod(gSymm, gVecX, gVecB);\n\/\/ convert(gVecB, _vecB);\n\/\/ \/\/ test gsl itself !\n\/\/ VERIFY_IS_APPROX(vecB, _vecB);\n\/\/ VERIFY_IS_APPROX(vecX, _vecX);\n\/\/\n\/\/ Gsl::free(gMatA);\n\/\/ Gsl::free(gSymm);\n\/\/ Gsl::free(gVecB);\n\/\/ Gsl::free(gVecX);\n\/\/ }\n #endif\n\n {\n LLT<SquareMatrixType,Lower> chollo(symmLo);\n VERIFY_IS_APPROX(symm, chollo.reconstructedMatrix());\n vecX = chollo.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = chollo.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n \/\/ test the upper mode\n LLT<SquareMatrixType,Upper> cholup(symmUp);\n VERIFY_IS_APPROX(symm, cholup.reconstructedMatrix());\n vecX = cholup.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = cholup.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n }\n\n int sign = ei_random<int>()%2 ? 1 : -1;\n\n if(sign == -1)\n {\n symm = -symm; \/\/ test a negative matrix\n }\n\n {\n LDLT<SquareMatrixType,Lower> ldltlo(symm);\n VERIFY_IS_APPROX(symm, ldltlo.reconstructedMatrix());\n vecX = ldltlo.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = ldltlo.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n LDLT<SquareMatrixType,Upper> ldltup(symm);\n VERIFY_IS_APPROX(symm, ldltup.reconstructedMatrix());\n vecX = ldltup.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = ldltup.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n if(MatrixType::RowsAtCompileTime==Dynamic)\n {\n \/\/ note : each inplace permutation requires a small temporary vector (mask)\n\n \/\/ check inplace solve\n matX = matB;\n VERIFY_EVALUATION_COUNT(matX = ldltlo.solve(matX), 0);\n VERIFY_IS_APPROX(matX, ldltlo.solve(matB).eval());\n\n\n matX = matB;\n VERIFY_EVALUATION_COUNT(matX = ldltup.solve(matX), 0);\n VERIFY_IS_APPROX(matX, ldltup.solve(matB).eval());\n }\n }\n\n}\n\ntemplate<typename MatrixType> void cholesky_verify_assert()\n{\n MatrixType tmp;\n\n LLT<MatrixType> llt;\n VERIFY_RAISES_ASSERT(llt.matrixL())\n VERIFY_RAISES_ASSERT(llt.matrixU())\n VERIFY_RAISES_ASSERT(llt.solve(tmp))\n VERIFY_RAISES_ASSERT(llt.solveInPlace(&tmp))\n\n LDLT<MatrixType> ldlt;\n VERIFY_RAISES_ASSERT(ldlt.matrixL())\n VERIFY_RAISES_ASSERT(ldlt.permutationP())\n VERIFY_RAISES_ASSERT(ldlt.vectorD())\n VERIFY_RAISES_ASSERT(ldlt.isPositive())\n VERIFY_RAISES_ASSERT(ldlt.isNegative())\n VERIFY_RAISES_ASSERT(ldlt.solve(tmp))\n VERIFY_RAISES_ASSERT(ldlt.solveInPlace(&tmp))\n}\n\nvoid test_cholesky()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( cholesky(Matrix<double,1,1>()) );\n CALL_SUBTEST_2( cholesky(MatrixXd(1,1)) );\n CALL_SUBTEST_3( cholesky(Matrix2d()) );\n CALL_SUBTEST_4( cholesky(Matrix3f()) );\n CALL_SUBTEST_5( cholesky(Matrix4d()) );\n CALL_SUBTEST_2( cholesky(MatrixXd(200,200)) );\n CALL_SUBTEST_6( cholesky(MatrixXcd(100,100)) );\n }\n\n CALL_SUBTEST_4( cholesky_verify_assert<Matrix3f>() );\n CALL_SUBTEST_7( cholesky_verify_assert<Matrix3d>() );\n CALL_SUBTEST_8( cholesky_verify_assert<MatrixXf>() );\n CALL_SUBTEST_2( cholesky_verify_assert<MatrixXd>() );\n\n \/\/ Test problem size constructors\n CALL_SUBTEST_9( LLT<MatrixXf>(10) );\n CALL_SUBTEST_9( LDLT<MatrixXf>(10) );\n}\n<commit_msg>fix ldlt unit test<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2008 Gael Guennebaud <g.gael@free.fr>\n\/\/\n\/\/ Eigen is free software; you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU Lesser General Public\n\/\/ License as published by the Free Software Foundation; either\n\/\/ version 3 of the License, or (at your option) any later version.\n\/\/\n\/\/ Alternatively, you can redistribute it and\/or\n\/\/ modify it under the terms of the GNU General Public License as\n\/\/ published by the Free Software Foundation; either version 2 of\n\/\/ the License, or (at your option) any later version.\n\/\/\n\/\/ Eigen is distributed in the hope that it will be useful, but WITHOUT ANY\n\/\/ WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n\/\/ FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the\n\/\/ GNU General Public License for more details.\n\/\/\n\/\/ You should have received a copy of the GNU Lesser General Public\n\/\/ License and a copy of the GNU General Public License along with\n\/\/ Eigen. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n\n#ifndef EIGEN_NO_ASSERTION_CHECKING\n#define EIGEN_NO_ASSERTION_CHECKING\n#endif\n\nstatic int nb_temporaries;\n\n#define EIGEN_DEBUG_MATRIX_CTOR { if(size!=0) nb_temporaries++; }\n\n#include \"main.h\"\n#include <Eigen\/Cholesky>\n#include <Eigen\/QR>\n\n#define VERIFY_EVALUATION_COUNT(XPR,N) {\\\n nb_temporaries = 0; \\\n XPR; \\\n if(nb_temporaries!=N) std::cerr << \"nb_temporaries == \" << nb_temporaries << \"\\n\"; \\\n VERIFY( (#XPR) && nb_temporaries==N ); \\\n }\n\n#ifdef HAS_GSL\n#include \"gsl_helper.h\"\n#endif\n\ntemplate<typename MatrixType> void cholesky(const MatrixType& m)\n{\n \/* this test covers the following files:\n LLT.h LDLT.h\n *\/\n int rows = m.rows();\n int cols = m.cols();\n\n typedef typename MatrixType::Scalar Scalar;\n typedef typename NumTraits<Scalar>::Real RealScalar;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> SquareMatrixType;\n typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, 1> VectorType;\n\n MatrixType a0 = MatrixType::Random(rows,cols);\n VectorType vecB = VectorType::Random(rows), vecX(rows);\n MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);\n SquareMatrixType symm = a0 * a0.adjoint();\n \/\/ let's make sure the matrix is not singular or near singular\n for (int k=0; k<3; ++k)\n {\n MatrixType a1 = MatrixType::Random(rows,cols);\n symm += a1 * a1.adjoint();\n }\n\n SquareMatrixType symmUp = symm.template triangularView<Upper>();\n SquareMatrixType symmLo = symm.template triangularView<Lower>();\n\n \/\/ to test if really Cholesky only uses the upper triangular part, uncomment the following\n \/\/ FIXME: currently that fails !!\n \/\/symm.template part<StrictlyLower>().setZero();\n\n #ifdef HAS_GSL\n\/\/ if (ei_is_same_type<RealScalar,double>::ret)\n\/\/ {\n\/\/ typedef GslTraits<Scalar> Gsl;\n\/\/ typename Gsl::Matrix gMatA=0, gSymm=0;\n\/\/ typename Gsl::Vector gVecB=0, gVecX=0;\n\/\/ convert<MatrixType>(symm, gSymm);\n\/\/ convert<MatrixType>(symm, gMatA);\n\/\/ convert<VectorType>(vecB, gVecB);\n\/\/ convert<VectorType>(vecB, gVecX);\n\/\/ Gsl::cholesky(gMatA);\n\/\/ Gsl::cholesky_solve(gMatA, gVecB, gVecX);\n\/\/ VectorType vecX(rows), _vecX, _vecB;\n\/\/ convert(gVecX, _vecX);\n\/\/ symm.llt().solve(vecB, &vecX);\n\/\/ Gsl::prod(gSymm, gVecX, gVecB);\n\/\/ convert(gVecB, _vecB);\n\/\/ \/\/ test gsl itself !\n\/\/ VERIFY_IS_APPROX(vecB, _vecB);\n\/\/ VERIFY_IS_APPROX(vecX, _vecX);\n\/\/\n\/\/ Gsl::free(gMatA);\n\/\/ Gsl::free(gSymm);\n\/\/ Gsl::free(gVecB);\n\/\/ Gsl::free(gVecX);\n\/\/ }\n #endif\n\n {\n LLT<SquareMatrixType,Lower> chollo(symmLo);\n VERIFY_IS_APPROX(symm, chollo.reconstructedMatrix());\n vecX = chollo.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = chollo.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n \/\/ test the upper mode\n LLT<SquareMatrixType,Upper> cholup(symmUp);\n VERIFY_IS_APPROX(symm, cholup.reconstructedMatrix());\n vecX = cholup.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = cholup.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n }\n\n int sign = ei_random<int>()%2 ? 1 : -1;\n\n if(sign == -1)\n {\n symm = -symm; \/\/ test a negative matrix\n }\n\n {\n LDLT<SquareMatrixType,Lower> ldltlo(symmLo);\n VERIFY_IS_APPROX(symm, ldltlo.reconstructedMatrix());\n vecX = ldltlo.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = ldltlo.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n LDLT<SquareMatrixType,Upper> ldltup(symmUp);\n VERIFY_IS_APPROX(symm, ldltup.reconstructedMatrix());\n vecX = ldltup.solve(vecB);\n VERIFY_IS_APPROX(symm * vecX, vecB);\n matX = ldltup.solve(matB);\n VERIFY_IS_APPROX(symm * matX, matB);\n\n\/\/ if(MatrixType::RowsAtCompileTime==Dynamic)\n\/\/ {\n\/\/ \/\/ note : each inplace permutation requires a small temporary vector (mask)\n\/\/\n\/\/ \/\/ check inplace solve\n\/\/ matX = matB;\n\/\/ VERIFY_EVALUATION_COUNT(matX = ldltlo.solve(matX), 0);\n\/\/ VERIFY_IS_APPROX(matX, ldltlo.solve(matB).eval());\n\/\/\n\/\/\n\/\/ matX = matB;\n\/\/ VERIFY_EVALUATION_COUNT(matX = ldltup.solve(matX), 0);\n\/\/ VERIFY_IS_APPROX(matX, ldltup.solve(matB).eval());\n\/\/ }\n }\n\n}\n\ntemplate<typename MatrixType> void cholesky_verify_assert()\n{\n MatrixType tmp;\n\n LLT<MatrixType> llt;\n VERIFY_RAISES_ASSERT(llt.matrixL())\n VERIFY_RAISES_ASSERT(llt.matrixU())\n VERIFY_RAISES_ASSERT(llt.solve(tmp))\n VERIFY_RAISES_ASSERT(llt.solveInPlace(&tmp))\n\n LDLT<MatrixType> ldlt;\n VERIFY_RAISES_ASSERT(ldlt.matrixL())\n VERIFY_RAISES_ASSERT(ldlt.permutationP())\n VERIFY_RAISES_ASSERT(ldlt.vectorD())\n VERIFY_RAISES_ASSERT(ldlt.isPositive())\n VERIFY_RAISES_ASSERT(ldlt.isNegative())\n VERIFY_RAISES_ASSERT(ldlt.solve(tmp))\n VERIFY_RAISES_ASSERT(ldlt.solveInPlace(&tmp))\n}\n\nvoid test_cholesky()\n{\n for(int i = 0; i < g_repeat; i++) {\n CALL_SUBTEST_1( cholesky(Matrix<double,1,1>()) );\n CALL_SUBTEST_2( cholesky(MatrixXd(1,1)) );\n CALL_SUBTEST_3( cholesky(Matrix2d()) );\n CALL_SUBTEST_4( cholesky(Matrix3f()) );\n CALL_SUBTEST_5( cholesky(Matrix4d()) );\n CALL_SUBTEST_2( cholesky(MatrixXd(200,200)) );\n CALL_SUBTEST_6( cholesky(MatrixXcd(100,100)) );\n }\n\n CALL_SUBTEST_4( cholesky_verify_assert<Matrix3f>() );\n CALL_SUBTEST_7( cholesky_verify_assert<Matrix3d>() );\n CALL_SUBTEST_8( cholesky_verify_assert<MatrixXf>() );\n CALL_SUBTEST_2( cholesky_verify_assert<MatrixXd>() );\n\n \/\/ Test problem size constructors\n CALL_SUBTEST_9( LLT<MatrixXf>(10) );\n CALL_SUBTEST_9( LDLT<MatrixXf>(10) );\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"buffer.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"window.hh\"\n#include \"assert.hh\"\n#include \"utils.hh\"\n#include \"hook_manager.hh\"\n#include \"context.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\ntemplate<typename T>\nT clamp(T min, T max, T val)\n{\n if (val < min)\n return min;\n if (val > max)\n return max;\n return val;\n}\n\nBuffer::Buffer(const std::string& name, Type type,\n const String& initial_content)\n : m_name(name), m_type(type),\n m_history(1), m_history_cursor(m_history.begin()),\n m_last_save_undo_index(0),\n m_option_manager(GlobalOptionManager::instance())\n{\n BufferManager::instance().register_buffer(this);\n if (not initial_content.empty())\n apply_modification(Modification::make_insert(begin(), initial_content));\n\n if (type == Type::NewFile)\n GlobalHookManager::instance().run_hook(\"BufCreate\", name, Context(*this));\n else if (type == Type::File)\n GlobalHookManager::instance().run_hook(\"BufOpen\", name, Context(*this));\n}\n\nBuffer::~Buffer()\n{\n m_windows.clear();\n BufferManager::instance().unregister_buffer(this);\n assert(m_modification_listeners.empty());\n}\n\nBufferIterator Buffer::iterator_at(const BufferCoord& line_and_column) const\n{\n return BufferIterator(*this, clamp(line_and_column));\n}\n\nBufferCoord Buffer::line_and_column_at(const BufferIterator& iterator) const\n{\n return iterator.m_coord;\n}\n\nBufferPos Buffer::line_at(const BufferIterator& iterator) const\n{\n return iterator.line();\n}\n\nBufferSize Buffer::line_length(BufferPos line) const\n{\n assert(line < line_count());\n BufferPos end = (line < m_lines.size() - 1) ?\n m_lines[line + 1].start : length();\n return end - m_lines[line].start;\n}\n\nBufferCoord Buffer::clamp(const BufferCoord& line_and_column) const\n{\n if (m_lines.empty())\n return BufferCoord();\n\n BufferCoord result(line_and_column.line, line_and_column.column);\n result.line = Kakoune::clamp<int>(0, m_lines.size() - 1, result.line);\n int max_col = std::max(0, line_length(result.line) - 2);\n result.column = Kakoune::clamp<int>(0, max_col, result.column);\n return result;\n}\n\nBufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const\n{\n return BufferIterator(*this, { iterator.line(), 0 });\n}\n\nBufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const\n{\n BufferPos line = iterator.line();\n return ++BufferIterator(*this, { line, std::max(line_length(line) - 1, 0) });\n}\n\nBufferIterator Buffer::begin() const\n{\n return BufferIterator(*this, { 0, 0 });\n}\n\nBufferIterator Buffer::end() const\n{\n if (m_lines.empty())\n return BufferIterator(*this, { 0, 0 });\n return BufferIterator(*this, { (int)line_count()-1, (int)m_lines.back().length() });\n}\n\nBufferSize Buffer::length() const\n{\n if (m_lines.empty())\n return 0;\n return m_lines.back().start + m_lines.back().length();\n}\n\nBufferSize Buffer::line_count() const\n{\n return m_lines.size();\n}\n\nString Buffer::string(const BufferIterator& begin, const BufferIterator& end) const\n{\n String res;\n for (BufferPos line = begin.line(); line <= end.line(); ++line)\n {\n size_t start = 0;\n if (line == begin.line())\n start = begin.column();\n size_t count = -1;\n if (line == end.line())\n count = end.column() - start;\n res += m_lines[line].content.substr(start, count);\n }\n return res;\n}\n\nvoid Buffer::begin_undo_group()\n{\n assert(m_current_undo_group.empty());\n m_history.erase(m_history_cursor, m_history.end());\n\n if (m_history.size() < m_last_save_undo_index)\n m_last_save_undo_index = -1;\n\n m_history_cursor = m_history.end();\n}\n\nvoid Buffer::end_undo_group()\n{\n m_history.push_back(m_current_undo_group);\n m_history_cursor = m_history.end();\n\n m_current_undo_group.clear();\n}\n\nModification Modification::inverse() const\n{\n Type inverse_type;\n switch (type)\n {\n case Insert: inverse_type = Erase; break;\n case Erase: inverse_type = Insert; break;\n default: assert(false);\n }\n return Modification(inverse_type, position, content);\n}\n\nbool Buffer::undo()\n{\n if (m_history_cursor == m_history.begin())\n return false;\n\n --m_history_cursor;\n\n for (const Modification& modification : reversed(*m_history_cursor))\n apply_modification(modification.inverse());\n}\n\nbool Buffer::redo()\n{\n if (m_history_cursor == m_history.end())\n return false;\n\n for (const Modification& modification : *m_history_cursor)\n apply_modification(modification);\n\n ++m_history_cursor;\n}\n\nvoid Buffer::check_invariant() const\n{\n BufferSize start = 0;\n for (auto& line : m_lines)\n {\n assert(line.start == start);\n start += line.length();\n }\n}\n\nvoid Buffer::insert(const BufferIterator& pos, const String& content)\n{\n BufferSize offset = pos.offset();\n\n \/\/ all following lines advanced by length\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start += content.length();\n\n \/\/ if we inserted at the end of the buffer, we may have created a new\n \/\/ line without inserting a '\\n'\n if (pos == end() and (pos == begin() or *(pos-1) == '\\n'))\n {\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n m_lines.push_back({ offset + start, content.substr(start, i + 1 - start) });\n start = i + 1;\n }\n }\n if (start != content.length())\n m_lines.push_back({ offset + start, content.substr(start) });\n }\n else\n {\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[pos.line()].content.substr(pos.column());\n\n auto line_it = m_lines.begin() + pos.line();\n line_it = m_lines.erase(line_it);\n\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n String line_content = content.substr(start, i + 1 - start);\n if (start == 0)\n {\n line_content = prefix + line_content;\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(),\n std::move(line_content) });\n }\n else\n line_it = m_lines.insert(line_it, { offset + start,\n std::move(line_content) });\n\n ++line_it;\n start = i + 1;\n }\n }\n if (start == 0)\n m_lines.insert(line_it, { offset + start - (int)prefix.length(), prefix + content + suffix });\n else\n m_lines.insert(line_it, { offset + start, content.substr(start) + suffix });\n }\n\n check_invariant();\n}\n\nvoid Buffer::erase(const BufferIterator& pos, BufferSize length)\n{\n BufferIterator end = pos + length;\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[end.line()].content.substr(end.column());\n Line new_line = { m_lines[pos.line()].start, prefix + suffix };\n\n m_lines.erase(m_lines.begin() + pos.line(), m_lines.begin() + end.line() + 1);\n m_lines.insert(m_lines.begin() + pos.line(), new_line);\n\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start -= length;\n\n check_invariant();\n}\n\nvoid Buffer::apply_modification(const Modification& modification)\n{\n const String& content = modification.content;\n const BufferIterator& pos = modification.position;\n\n switch (modification.type)\n {\n case Modification::Insert:\n insert(modification.position, modification.content);\n break;\n case Modification::Erase:\n {\n size_t size = modification.content.size();\n assert(string(modification.position, modification.position + size)\n == modification.content);\n erase(modification.position, size);\n break;\n }\n default:\n assert(false);\n }\n\n for (auto listener : m_modification_listeners)\n listener->on_modification(modification);\n}\n\nvoid Buffer::modify(Modification&& modification)\n{\n if (modification.content.empty())\n return;\n\n apply_modification(modification);\n m_current_undo_group.push_back(std::move(modification));\n}\n\nWindow* Buffer::get_or_create_window()\n{\n if (m_windows.empty())\n m_windows.push_front(std::unique_ptr<Window>(new Window(*this)));\n\n return m_windows.front().get();\n}\n\nvoid Buffer::delete_window(Window* window)\n{\n assert(&window->buffer() == this);\n auto window_it = std::find(m_windows.begin(), m_windows.end(), window);\n assert(window_it != m_windows.end());\n m_windows.erase(window_it);\n}\n\nbool Buffer::is_modified() const\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n return m_last_save_undo_index != history_cursor_index\n or not m_current_undo_group.empty();\n}\n\nvoid Buffer::notify_saved()\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n m_last_save_undo_index = history_cursor_index;\n}\n\nvoid Buffer::register_modification_listener(ModificationListener* listener)\n{\n assert(listener);\n assert(not contains(m_modification_listeners, listener));\n m_modification_listeners.push_back(listener);\n}\n\nvoid Buffer::unregister_modification_listener(ModificationListener* listener)\n{\n assert(listener);\n auto it = std::find(m_modification_listeners.begin(),\n m_modification_listeners.end(),\n listener);\n assert(it != m_modification_listeners.end());\n m_modification_listeners.erase(it);\n}\n\n}\n<commit_msg>fix some corner cases in Buffer modification<commit_after>#include \"buffer.hh\"\n\n#include \"buffer_manager.hh\"\n#include \"window.hh\"\n#include \"assert.hh\"\n#include \"utils.hh\"\n#include \"hook_manager.hh\"\n#include \"context.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\ntemplate<typename T>\nT clamp(T min, T max, T val)\n{\n if (val < min)\n return min;\n if (val > max)\n return max;\n return val;\n}\n\nBuffer::Buffer(const std::string& name, Type type,\n const String& initial_content)\n : m_name(name), m_type(type),\n m_history(1), m_history_cursor(m_history.begin()),\n m_last_save_undo_index(0),\n m_option_manager(GlobalOptionManager::instance())\n{\n BufferManager::instance().register_buffer(this);\n if (not initial_content.empty())\n apply_modification(Modification::make_insert(begin(), initial_content));\n\n if (type == Type::NewFile)\n GlobalHookManager::instance().run_hook(\"BufCreate\", name, Context(*this));\n else if (type == Type::File)\n GlobalHookManager::instance().run_hook(\"BufOpen\", name, Context(*this));\n}\n\nBuffer::~Buffer()\n{\n m_windows.clear();\n BufferManager::instance().unregister_buffer(this);\n assert(m_modification_listeners.empty());\n}\n\nBufferIterator Buffer::iterator_at(const BufferCoord& line_and_column) const\n{\n return BufferIterator(*this, clamp(line_and_column));\n}\n\nBufferCoord Buffer::line_and_column_at(const BufferIterator& iterator) const\n{\n return iterator.m_coord;\n}\n\nBufferPos Buffer::line_at(const BufferIterator& iterator) const\n{\n return iterator.line();\n}\n\nBufferSize Buffer::line_length(BufferPos line) const\n{\n assert(line < line_count());\n BufferPos end = (line < m_lines.size() - 1) ?\n m_lines[line + 1].start : length();\n return end - m_lines[line].start;\n}\n\nBufferCoord Buffer::clamp(const BufferCoord& line_and_column) const\n{\n if (m_lines.empty())\n return BufferCoord();\n\n BufferCoord result(line_and_column.line, line_and_column.column);\n result.line = Kakoune::clamp<int>(0, m_lines.size() - 1, result.line);\n int max_col = std::max(0, line_length(result.line) - 2);\n result.column = Kakoune::clamp<int>(0, max_col, result.column);\n return result;\n}\n\nBufferIterator Buffer::iterator_at_line_begin(const BufferIterator& iterator) const\n{\n return BufferIterator(*this, { iterator.line(), 0 });\n}\n\nBufferIterator Buffer::iterator_at_line_end(const BufferIterator& iterator) const\n{\n BufferPos line = iterator.line();\n return ++BufferIterator(*this, { line, std::max(line_length(line) - 1, 0) });\n}\n\nBufferIterator Buffer::begin() const\n{\n return BufferIterator(*this, { 0, 0 });\n}\n\nBufferIterator Buffer::end() const\n{\n if (m_lines.empty())\n return BufferIterator(*this, { 0, 0 });\n return BufferIterator(*this, { (int)line_count()-1, (int)m_lines.back().length() });\n}\n\nBufferSize Buffer::length() const\n{\n if (m_lines.empty())\n return 0;\n return m_lines.back().start + m_lines.back().length();\n}\n\nBufferSize Buffer::line_count() const\n{\n return m_lines.size();\n}\n\nString Buffer::string(const BufferIterator& begin, const BufferIterator& end) const\n{\n String res;\n for (BufferPos line = begin.line(); line <= end.line(); ++line)\n {\n size_t start = 0;\n if (line == begin.line())\n start = begin.column();\n size_t count = -1;\n if (line == end.line())\n count = end.column() - start;\n res += m_lines[line].content.substr(start, count);\n }\n return res;\n}\n\nvoid Buffer::begin_undo_group()\n{\n assert(m_current_undo_group.empty());\n m_history.erase(m_history_cursor, m_history.end());\n\n if (m_history.size() < m_last_save_undo_index)\n m_last_save_undo_index = -1;\n\n m_history_cursor = m_history.end();\n}\n\nvoid Buffer::end_undo_group()\n{\n m_history.push_back(m_current_undo_group);\n m_history_cursor = m_history.end();\n\n m_current_undo_group.clear();\n}\n\nModification Modification::inverse() const\n{\n Type inverse_type;\n switch (type)\n {\n case Insert: inverse_type = Erase; break;\n case Erase: inverse_type = Insert; break;\n default: assert(false);\n }\n return Modification(inverse_type, position, content);\n}\n\nbool Buffer::undo()\n{\n if (m_history_cursor == m_history.begin())\n return false;\n\n --m_history_cursor;\n\n for (const Modification& modification : reversed(*m_history_cursor))\n apply_modification(modification.inverse());\n}\n\nbool Buffer::redo()\n{\n if (m_history_cursor == m_history.end())\n return false;\n\n for (const Modification& modification : *m_history_cursor)\n apply_modification(modification);\n\n ++m_history_cursor;\n}\n\nvoid Buffer::check_invariant() const\n{\n BufferSize start = 0;\n for (auto& line : m_lines)\n {\n assert(line.start == start);\n assert(line.length() > 0);\n start += line.length();\n }\n}\n\nvoid Buffer::insert(const BufferIterator& pos, const String& content)\n{\n BufferSize offset = pos.offset();\n\n \/\/ all following lines advanced by length\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start += content.length();\n\n \/\/ if we inserted at the end of the buffer, we may have created a new\n \/\/ line without inserting a '\\n'\n if (pos == end() and (pos == begin() or *(pos-1) == '\\n'))\n {\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n m_lines.push_back({ offset + start, content.substr(start, i + 1 - start) });\n start = i + 1;\n }\n }\n if (start != content.length())\n m_lines.push_back({ offset + start, content.substr(start) });\n }\n else\n {\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[pos.line()].content.substr(pos.column());\n\n auto line_it = m_lines.begin() + pos.line();\n line_it = m_lines.erase(line_it);\n\n int start = 0;\n for (int i = 0; i < content.length(); ++i)\n {\n if (content[i] == '\\n')\n {\n String line_content = content.substr(start, i + 1 - start);\n if (start == 0)\n {\n line_content = prefix + line_content;\n line_it = m_lines.insert(line_it, { offset + start - (int)prefix.length(),\n std::move(line_content) });\n }\n else\n line_it = m_lines.insert(line_it, { offset + start,\n std::move(line_content) });\n\n ++line_it;\n start = i + 1;\n }\n }\n if (start == 0)\n m_lines.insert(line_it, { offset + start - (int)prefix.length(), prefix + content + suffix });\n else\n m_lines.insert(line_it, { offset + start, content.substr(start) + suffix });\n }\n\n check_invariant();\n}\n\nvoid Buffer::erase(const BufferIterator& pos, BufferSize length)\n{\n BufferIterator end = pos + length;\n String prefix = m_lines[pos.line()].content.substr(0, pos.column());\n String suffix = m_lines[end.line()].content.substr(end.column());\n Line new_line = { m_lines[pos.line()].start, prefix + suffix };\n\n m_lines.erase(m_lines.begin() + pos.line(), m_lines.begin() + end.line() + 1);\n if (new_line.length())\n m_lines.insert(m_lines.begin() + pos.line(), std::move(new_line));\n\n for (size_t i = pos.line()+1; i < line_count(); ++i)\n m_lines[i].start -= length;\n\n check_invariant();\n}\n\nvoid Buffer::apply_modification(const Modification& modification)\n{\n const String& content = modification.content;\n const BufferIterator& pos = modification.position;\n\n switch (modification.type)\n {\n case Modification::Insert:\n {\n BufferIterator pos = modification.position < end() ?\n modification.position : end();\n insert(pos, modification.content);\n break;\n }\n case Modification::Erase:\n {\n size_t size = modification.content.size();\n assert(string(modification.position, modification.position + size)\n == modification.content);\n erase(modification.position, size);\n break;\n }\n default:\n assert(false);\n }\n\n for (auto listener : m_modification_listeners)\n listener->on_modification(modification);\n}\n\nvoid Buffer::modify(Modification&& modification)\n{\n if (modification.content.empty())\n return;\n\n apply_modification(modification);\n m_current_undo_group.push_back(std::move(modification));\n}\n\nWindow* Buffer::get_or_create_window()\n{\n if (m_windows.empty())\n m_windows.push_front(std::unique_ptr<Window>(new Window(*this)));\n\n return m_windows.front().get();\n}\n\nvoid Buffer::delete_window(Window* window)\n{\n assert(&window->buffer() == this);\n auto window_it = std::find(m_windows.begin(), m_windows.end(), window);\n assert(window_it != m_windows.end());\n m_windows.erase(window_it);\n}\n\nbool Buffer::is_modified() const\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n return m_last_save_undo_index != history_cursor_index\n or not m_current_undo_group.empty();\n}\n\nvoid Buffer::notify_saved()\n{\n size_t history_cursor_index = m_history_cursor - m_history.begin();\n m_last_save_undo_index = history_cursor_index;\n}\n\nvoid Buffer::register_modification_listener(ModificationListener* listener)\n{\n assert(listener);\n assert(not contains(m_modification_listeners, listener));\n m_modification_listeners.push_back(listener);\n}\n\nvoid Buffer::unregister_modification_listener(ModificationListener* listener)\n{\n assert(listener);\n auto it = std::find(m_modification_listeners.begin(),\n m_modification_listeners.end(),\n listener);\n assert(it != m_modification_listeners.end());\n m_modification_listeners.erase(it);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author: Elisavet Sakellari <elisavet.sakellari@cern.ch>\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n#include \"ExternalInterpreterSource.h\"\n#include \"cling\/Interpreter\/Interpreter.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTImporter.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Sema\/Sema.h\"\n\nusing namespace clang;\n\nnamespace {\n class ClingASTImporter : public ASTImporter {\n private:\n cling::ExternalInterpreterSource &m_Source;\n\n public:\n ClingASTImporter(ASTContext &ToContext, FileManager &ToFileManager,\n ASTContext &FromContext, FileManager &FromFileManager,\n bool MinimalImport, cling::ExternalInterpreterSource& source):\n ASTImporter(ToContext, ToFileManager, FromContext, FromFileManager,\n MinimalImport), m_Source(source) {}\n virtual ~ClingASTImporter() = default;\n\n Decl *Imported(Decl *From, Decl *To) override {\n ASTImporter::Imported(From, To);\n\n if (clang::TagDecl* toTagDecl = dyn_cast<TagDecl>(To)) {\n toTagDecl->setHasExternalLexicalStorage();\n toTagDecl->setMustBuildLookupTable();\n toTagDecl->setHasExternalVisibleStorage();\n }\n if (NamespaceDecl *toNamespaceDecl = dyn_cast<NamespaceDecl>(To)) {\n toNamespaceDecl->setHasExternalVisibleStorage();\n }\n if (ObjCContainerDecl *toContainerDecl = dyn_cast<ObjCContainerDecl>(To)) {\n toContainerDecl->setHasExternalLexicalStorage();\n toContainerDecl->setHasExternalVisibleStorage();\n }\n \/\/ Put the name of the Decl imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n if (NamedDecl *toNamedDecl = llvm::dyn_cast<NamedDecl>(To)) {\n m_Source.addToImportedDecls(toNamedDecl->getDeclName(),\n fromNamedDecl->getDeclName());\n }\n if (DeclContext *toDeclContext = llvm::dyn_cast<DeclContext>(To)) {\n m_Source.addToImportedDeclContexts(toDeclContext, fromDeclContext);\n }\n return To;\n }\n };\n}\n\nnamespace cling {\n\n ExternalInterpreterSource::ExternalInterpreterSource(\n const cling::Interpreter *parent, cling::Interpreter *child) :\n m_ParentInterpreter(parent), m_ChildInterpreter(child) {\n\n clang::DeclContext *parentTUDeclContext =\n m_ParentInterpreter->getCI()->getASTContext().getTranslationUnitDecl();\n\n clang::DeclContext *childTUDeclContext =\n m_ChildInterpreter->getCI()->getASTContext().getTranslationUnitDecl();\n\n \/\/ Also keep in the map of Decl Contexts the Translation Unit Decl Context\n m_ImportedDeclContexts[childTUDeclContext] = parentTUDeclContext;\n }\n\n ExternalInterpreterSource::~ExternalInterpreterSource() {}\n\n ClingASTImporter CreateClingASTImporter(ASTContext &toContext,\n ASTContext &fromContext,\n const Interpreter* child,\n const Interpreter* parent,\n ExternalInterpreterSource& source) {\n\n FileManager &childFM = child->getCI()->getFileManager();\n FileManager &parentFM = parent->getCI()->getFileManager();\n\n return ClingASTImporter(toContext, childFM, fromContext, parentFM,\n \/*MinimalImport : ON*\/ true, source);\n }\n\n void ExternalInterpreterSource::ImportDecl(Decl *declToImport,\n ASTImporter &importer,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName,\n const DeclContext *childCurrentDeclContext) {\n\n \/\/ Don't do the import if we have a Function Template.\n \/\/ Not supported by clang.\n \/\/ FIXME: This is also a temporary check. Will be de-activated\n \/\/ once clang supports the import of function templates.\n if (declToImport->isFunctionOrFunctionTemplate() \n && declToImport->isTemplateDecl())\n return;\n\n if (Decl *importedDecl = importer.Import(declToImport)) {\n if (NamedDecl *importedNamedDecl = llvm::dyn_cast<NamedDecl>(importedDecl)) {\n SetExternalVisibleDeclsForName(childCurrentDeclContext,\n importedNamedDecl->getDeclName(),\n importedNamedDecl);\n }\n \/\/ Put the name of the Decl imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n m_ImportedDecls[childDeclName] = parentDeclName;\n }\n }\n\n void ExternalInterpreterSource::ImportDeclContext(\n DeclContext *declContextToImport,\n ASTImporter &importer,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName,\n const DeclContext *childCurrentDeclContext) {\n\n if (DeclContext *importedDeclContext =\n importer.ImportContext(declContextToImport)) {\n\n importedDeclContext->setHasExternalVisibleStorage(true);\n if (NamedDecl *importedNamedDecl = \n llvm::dyn_cast<NamedDecl>(importedDeclContext)) {\n SetExternalVisibleDeclsForName(childCurrentDeclContext,\n importedNamedDecl->getDeclName(),\n importedNamedDecl);\n }\n\n \/\/ Put the name of the DeclContext imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n m_ImportedDecls[childDeclName] = parentDeclName;\n\n \/\/ And also put the declaration context I found from the parent Interpreter\n \/\/ in the map of the child Interpreter to have it for the future.\n m_ImportedDeclContexts[importedDeclContext] = declContextToImport;\n }\n }\n\n bool ExternalInterpreterSource::Import(DeclContext::lookup_result lookup_result,\n ASTContext &fromASTContext,\n ASTContext &toASTContext,\n const DeclContext *childCurrentDeclContext,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName) {\n\n \/\/ Cling's ASTImporter\n ClingASTImporter importer = CreateClingASTImporter(toASTContext,\n fromASTContext,\n m_ChildInterpreter,\n m_ParentInterpreter,\n *this);\n\n for (DeclContext::lookup_iterator I = lookup_result.begin(),\n E = lookup_result.end(); I != E; ++I) {\n \/\/ Check if this Name we are looking for is\n \/\/ a DeclContext (for example a Namespace, function etc.).\n if (DeclContext *declContextToImport = llvm::dyn_cast<DeclContext>(*I)) {\n\n ImportDeclContext(declContextToImport, importer, childDeclName,\n parentDeclName, childCurrentDeclContext);\n\n }\n ImportDecl(*I, importer, childDeclName, parentDeclName,\n childCurrentDeclContext);\n }\n return true;\n }\n\n \/\/\/\\brief This is the one of the most important function of the class\n \/\/\/ since from here initiates the lookup and import part of the missing\n \/\/\/ Decl(s) (Contexts).\n \/\/\/\n bool ExternalInterpreterSource::FindExternalVisibleDeclsByName(\n const DeclContext *childCurrentDeclContext, DeclarationName childDeclName) {\n\n assert(childDeclName && \"Child Decl name is empty\");\n\n assert(childCurrentDeclContext->hasExternalVisibleStorage() &&\n \"DeclContext has no visible decls in storage\");\n\n \/\/Check if we have already found this declaration Name before\n DeclarationName parentDeclName;\n std::map<clang::DeclarationName,\n clang::DeclarationName>::iterator IDecl =\n m_ImportedDecls.find(childDeclName);\n if (IDecl != m_ImportedDecls.end()) {\n parentDeclName = IDecl->second;\n } else {\n \/\/ Get the identifier info from the parent interpreter\n \/\/ for this Name.\n std::string name = childDeclName.getAsString();\n IdentifierTable &parentIdentifierTable =\n m_ParentInterpreter->getCI()->getASTContext().Idents;\n IdentifierInfo &parentIdentifierInfo =\n parentIdentifierTable.get(name);\n parentDeclName = DeclarationName(&parentIdentifierInfo);\n }\n\n \/\/ Search in the map of the stored Decl Contexts for this\n \/\/ Decl Context.\n std::map<const clang::DeclContext *, clang::DeclContext *>::iterator\n IDeclContext = m_ImportedDeclContexts.find(childCurrentDeclContext);\n \/\/ If childCurrentDeclContext was found before and is already in the map,\n \/\/ then do the lookup using the stored pointer.\n if (IDeclContext == m_ImportedDeclContexts.end()) return false;\n\n DeclContext *parentDeclContext = IDeclContext->second;\n\n DeclContext::lookup_result lookup_result =\n parentDeclContext->lookup(parentDeclName);\n\n \/\/ Check if we found this Name in the parent interpreter\n if (!lookup_result.empty()) {\n ASTContext &fromASTContext =\n Decl::castFromDeclContext(parentDeclContext)->getASTContext();\n ASTContext &toASTContext =\n Decl::castFromDeclContext(childCurrentDeclContext)->getASTContext();\n if (Import(lookup_result, fromASTContext, toASTContext,\n childCurrentDeclContext, childDeclName, parentDeclName))\n return true;\n }\n\n return false;\n }\n\n \/\/\/\\brief Make available to child all decls in parent's decl context\n \/\/\/ that corresponds to child decl context.\n void ExternalInterpreterSource::completeVisibleDeclsMap(\n const clang::DeclContext *childDeclContext) {\n assert (childDeclContext && \"No child decl context!\");\n\n if (!childDeclContext->hasExternalVisibleStorage())\n return;\n\n \/\/ Search in the map of the stored Decl Contexts for this\n \/\/ Decl Context.\n std::map<const clang::DeclContext *, clang::DeclContext *>::iterator\n IDeclContext = m_ImportedDeclContexts.find(childDeclContext);\n \/\/ If childCurrentDeclContext was found before and is already in the map,\n \/\/ then do the lookup using the stored pointer.\n if (IDeclContext == m_ImportedDeclContexts.end()) return ;\n\n DeclContext *parentDeclContext = IDeclContext->second;\n\n ASTContext &fromASTContext =\n Decl::castFromDeclContext(parentDeclContext)->getASTContext();\n ASTContext &toASTContext =\n Decl::castFromDeclContext(childDeclContext)->getASTContext();\n\n \/\/ Cling's ASTImporter\n ClingASTImporter importer = CreateClingASTImporter(toASTContext,\n fromASTContext,\n m_ChildInterpreter,\n m_ParentInterpreter,\n *this);\n\n \/\/ Filter the decls from the external source using the stem information\n \/\/ stored in Sema.\n StringRef filter =\n m_ChildInterpreter->getCI()->getPreprocessor().getCodeCompletionFilter();\n for (DeclContext::decl_iterator IDeclContext =\n parentDeclContext->decls_begin(),\n EDeclContext =\n parentDeclContext->decls_end();\n IDeclContext != EDeclContext; ++IDeclContext) {\n if (NamedDecl* parentDecl = llvm::dyn_cast<NamedDecl>(*IDeclContext)) {\n DeclarationName childDeclName = parentDecl->getDeclName();\n if (auto II = childDeclName.getAsIdentifierInfo()) {\n StringRef name = II->getName();\n if (!name.empty() && name.startswith(filter))\n ImportDecl(parentDecl, importer, childDeclName, childDeclName,\n childDeclContext);\n }\n }\n }\n\n const_cast<DeclContext *>(childDeclContext)->\n setHasExternalVisibleStorage(false);\n }\n} \/\/ end namespace cling\n<commit_msg>Fix compilation failure. From Cristina.<commit_after>\/\/--------------------------------------------------------------------*- C++ -*-\n\/\/ CLING - the C++ LLVM-based InterpreterG :)\n\/\/ author: Elisavet Sakellari <elisavet.sakellari@cern.ch>\n\/\/\n\/\/ This file is dual-licensed: you can choose to license it under the University\n\/\/ of Illinois Open Source License or the GNU Lesser General Public License. See\n\/\/ LICENSE.TXT for details.\n\/\/------------------------------------------------------------------------------\n\n#include \"ExternalInterpreterSource.h\"\n#include \"cling\/Interpreter\/Interpreter.h\"\n\n#include \"clang\/AST\/ASTContext.h\"\n#include \"clang\/AST\/ASTImporter.h\"\n#include \"clang\/Frontend\/CompilerInstance.h\"\n#include \"clang\/Lex\/Preprocessor.h\"\n#include \"clang\/Sema\/Sema.h\"\n\nusing namespace clang;\n\nnamespace {\n class ClingASTImporter : public ASTImporter {\n private:\n cling::ExternalInterpreterSource &m_Source;\n\n public:\n ClingASTImporter(ASTContext &ToContext, FileManager &ToFileManager,\n ASTContext &FromContext, FileManager &FromFileManager,\n bool MinimalImport, cling::ExternalInterpreterSource& source):\n ASTImporter(ToContext, ToFileManager, FromContext, FromFileManager,\n MinimalImport), m_Source(source) {}\n virtual ~ClingASTImporter() = default;\n\n Decl *Imported(Decl *From, Decl *To) override {\n ASTImporter::Imported(From, To);\n\n if (clang::TagDecl* toTagDecl = dyn_cast<TagDecl>(To)) {\n toTagDecl->setHasExternalLexicalStorage();\n toTagDecl->setMustBuildLookupTable();\n toTagDecl->setHasExternalVisibleStorage();\n }\n if (NamespaceDecl *toNamespaceDecl = dyn_cast<NamespaceDecl>(To)) {\n toNamespaceDecl->setHasExternalVisibleStorage();\n }\n if (ObjCContainerDecl *toContainerDecl = dyn_cast<ObjCContainerDecl>(To)) {\n toContainerDecl->setHasExternalLexicalStorage();\n toContainerDecl->setHasExternalVisibleStorage();\n }\n \/\/ Put the name of the Decl imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n if (NamedDecl *toNamedDecl = llvm::dyn_cast<NamedDecl>(To)) {\n NamedDecl *fromNamedDecl = llvm::dyn_cast<NamedDecl>(From);\n m_Source.addToImportedDecls(toNamedDecl->getDeclName(),\n fromNamedDecl->getDeclName());\n }\n if (DeclContext *toDeclContext = llvm::dyn_cast<DeclContext>(To)) {\n DeclContext *fromDeclContext = llvm::dyn_cast<DeclContext>(From);\n m_Source.addToImportedDeclContexts(toDeclContext, fromDeclContext);\n }\n return To;\n }\n };\n}\n\nnamespace cling {\n\n ExternalInterpreterSource::ExternalInterpreterSource(\n const cling::Interpreter *parent, cling::Interpreter *child) :\n m_ParentInterpreter(parent), m_ChildInterpreter(child) {\n\n clang::DeclContext *parentTUDeclContext =\n m_ParentInterpreter->getCI()->getASTContext().getTranslationUnitDecl();\n\n clang::DeclContext *childTUDeclContext =\n m_ChildInterpreter->getCI()->getASTContext().getTranslationUnitDecl();\n\n \/\/ Also keep in the map of Decl Contexts the Translation Unit Decl Context\n m_ImportedDeclContexts[childTUDeclContext] = parentTUDeclContext;\n }\n\n ExternalInterpreterSource::~ExternalInterpreterSource() {}\n\n ClingASTImporter CreateClingASTImporter(ASTContext &toContext,\n ASTContext &fromContext,\n const Interpreter* child,\n const Interpreter* parent,\n ExternalInterpreterSource& source) {\n\n FileManager &childFM = child->getCI()->getFileManager();\n FileManager &parentFM = parent->getCI()->getFileManager();\n\n return ClingASTImporter(toContext, childFM, fromContext, parentFM,\n \/*MinimalImport : ON*\/ true, source);\n }\n\n void ExternalInterpreterSource::ImportDecl(Decl *declToImport,\n ASTImporter &importer,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName,\n const DeclContext *childCurrentDeclContext) {\n\n \/\/ Don't do the import if we have a Function Template.\n \/\/ Not supported by clang.\n \/\/ FIXME: This is also a temporary check. Will be de-activated\n \/\/ once clang supports the import of function templates.\n if (declToImport->isFunctionOrFunctionTemplate() \n && declToImport->isTemplateDecl())\n return;\n\n if (Decl *importedDecl = importer.Import(declToImport)) {\n if (NamedDecl *importedNamedDecl = llvm::dyn_cast<NamedDecl>(importedDecl)) {\n SetExternalVisibleDeclsForName(childCurrentDeclContext,\n importedNamedDecl->getDeclName(),\n importedNamedDecl);\n }\n \/\/ Put the name of the Decl imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n m_ImportedDecls[childDeclName] = parentDeclName;\n }\n }\n\n void ExternalInterpreterSource::ImportDeclContext(\n DeclContext *declContextToImport,\n ASTImporter &importer,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName,\n const DeclContext *childCurrentDeclContext) {\n\n if (DeclContext *importedDeclContext =\n importer.ImportContext(declContextToImport)) {\n\n importedDeclContext->setHasExternalVisibleStorage(true);\n if (NamedDecl *importedNamedDecl = \n llvm::dyn_cast<NamedDecl>(importedDeclContext)) {\n SetExternalVisibleDeclsForName(childCurrentDeclContext,\n importedNamedDecl->getDeclName(),\n importedNamedDecl);\n }\n\n \/\/ Put the name of the DeclContext imported with the\n \/\/ DeclarationName coming from the parent, in my map.\n m_ImportedDecls[childDeclName] = parentDeclName;\n\n \/\/ And also put the declaration context I found from the parent Interpreter\n \/\/ in the map of the child Interpreter to have it for the future.\n m_ImportedDeclContexts[importedDeclContext] = declContextToImport;\n }\n }\n\n bool ExternalInterpreterSource::Import(DeclContext::lookup_result lookup_result,\n ASTContext &fromASTContext,\n ASTContext &toASTContext,\n const DeclContext *childCurrentDeclContext,\n DeclarationName &childDeclName,\n DeclarationName &parentDeclName) {\n\n \/\/ Cling's ASTImporter\n ClingASTImporter importer = CreateClingASTImporter(toASTContext,\n fromASTContext,\n m_ChildInterpreter,\n m_ParentInterpreter,\n *this);\n\n for (DeclContext::lookup_iterator I = lookup_result.begin(),\n E = lookup_result.end(); I != E; ++I) {\n \/\/ Check if this Name we are looking for is\n \/\/ a DeclContext (for example a Namespace, function etc.).\n if (DeclContext *declContextToImport = llvm::dyn_cast<DeclContext>(*I)) {\n\n ImportDeclContext(declContextToImport, importer, childDeclName,\n parentDeclName, childCurrentDeclContext);\n\n }\n ImportDecl(*I, importer, childDeclName, parentDeclName,\n childCurrentDeclContext);\n }\n return true;\n }\n\n \/\/\/\\brief This is the one of the most important function of the class\n \/\/\/ since from here initiates the lookup and import part of the missing\n \/\/\/ Decl(s) (Contexts).\n \/\/\/\n bool ExternalInterpreterSource::FindExternalVisibleDeclsByName(\n const DeclContext *childCurrentDeclContext, DeclarationName childDeclName) {\n\n assert(childDeclName && \"Child Decl name is empty\");\n\n assert(childCurrentDeclContext->hasExternalVisibleStorage() &&\n \"DeclContext has no visible decls in storage\");\n\n \/\/Check if we have already found this declaration Name before\n DeclarationName parentDeclName;\n std::map<clang::DeclarationName,\n clang::DeclarationName>::iterator IDecl =\n m_ImportedDecls.find(childDeclName);\n if (IDecl != m_ImportedDecls.end()) {\n parentDeclName = IDecl->second;\n } else {\n \/\/ Get the identifier info from the parent interpreter\n \/\/ for this Name.\n std::string name = childDeclName.getAsString();\n IdentifierTable &parentIdentifierTable =\n m_ParentInterpreter->getCI()->getASTContext().Idents;\n IdentifierInfo &parentIdentifierInfo =\n parentIdentifierTable.get(name);\n parentDeclName = DeclarationName(&parentIdentifierInfo);\n }\n\n \/\/ Search in the map of the stored Decl Contexts for this\n \/\/ Decl Context.\n std::map<const clang::DeclContext *, clang::DeclContext *>::iterator\n IDeclContext = m_ImportedDeclContexts.find(childCurrentDeclContext);\n \/\/ If childCurrentDeclContext was found before and is already in the map,\n \/\/ then do the lookup using the stored pointer.\n if (IDeclContext == m_ImportedDeclContexts.end()) return false;\n\n DeclContext *parentDeclContext = IDeclContext->second;\n\n DeclContext::lookup_result lookup_result =\n parentDeclContext->lookup(parentDeclName);\n\n \/\/ Check if we found this Name in the parent interpreter\n if (!lookup_result.empty()) {\n ASTContext &fromASTContext =\n Decl::castFromDeclContext(parentDeclContext)->getASTContext();\n ASTContext &toASTContext =\n Decl::castFromDeclContext(childCurrentDeclContext)->getASTContext();\n if (Import(lookup_result, fromASTContext, toASTContext,\n childCurrentDeclContext, childDeclName, parentDeclName))\n return true;\n }\n\n return false;\n }\n\n \/\/\/\\brief Make available to child all decls in parent's decl context\n \/\/\/ that corresponds to child decl context.\n void ExternalInterpreterSource::completeVisibleDeclsMap(\n const clang::DeclContext *childDeclContext) {\n assert (childDeclContext && \"No child decl context!\");\n\n if (!childDeclContext->hasExternalVisibleStorage())\n return;\n\n \/\/ Search in the map of the stored Decl Contexts for this\n \/\/ Decl Context.\n std::map<const clang::DeclContext *, clang::DeclContext *>::iterator\n IDeclContext = m_ImportedDeclContexts.find(childDeclContext);\n \/\/ If childCurrentDeclContext was found before and is already in the map,\n \/\/ then do the lookup using the stored pointer.\n if (IDeclContext == m_ImportedDeclContexts.end()) return ;\n\n DeclContext *parentDeclContext = IDeclContext->second;\n\n ASTContext &fromASTContext =\n Decl::castFromDeclContext(parentDeclContext)->getASTContext();\n ASTContext &toASTContext =\n Decl::castFromDeclContext(childDeclContext)->getASTContext();\n\n \/\/ Cling's ASTImporter\n ClingASTImporter importer = CreateClingASTImporter(toASTContext,\n fromASTContext,\n m_ChildInterpreter,\n m_ParentInterpreter,\n *this);\n\n \/\/ Filter the decls from the external source using the stem information\n \/\/ stored in Sema.\n StringRef filter =\n m_ChildInterpreter->getCI()->getPreprocessor().getCodeCompletionFilter();\n for (DeclContext::decl_iterator IDeclContext =\n parentDeclContext->decls_begin(),\n EDeclContext =\n parentDeclContext->decls_end();\n IDeclContext != EDeclContext; ++IDeclContext) {\n if (NamedDecl* parentDecl = llvm::dyn_cast<NamedDecl>(*IDeclContext)) {\n DeclarationName childDeclName = parentDecl->getDeclName();\n if (auto II = childDeclName.getAsIdentifierInfo()) {\n StringRef name = II->getName();\n if (!name.empty() && name.startswith(filter))\n ImportDecl(parentDecl, importer, childDeclName, childDeclName,\n childDeclContext);\n }\n }\n }\n\n const_cast<DeclContext *>(childDeclContext)->\n setHasExternalVisibleStorage(false);\n }\n} \/\/ end namespace cling\n<|endoftext|>"} {"text":"<commit_before>#include \"options.hpp\"\n\n#include <riemannpp\/riemannpp.hpp>\n\n#include <boost\/program_options\/options_description.hpp>\n#include <boost\/program_options\/parsers.hpp>\n#include <boost\/program_options\/variables_map.hpp>\n\nnamespace bpo = boost::program_options;\nnamespace rpp = riemannpp;\n\nusing namespace client;\nusing namespace std;\n\nbpo::options_description \nsend_options()\n{\n\tbpo::options_description options(\"Send Command Options\");\n\toptions.add_options()\n\t\t( \"state,s\", bpo::value<string>(), \"Set the state of the event.\" )\n\t\t( \"service,S\", bpo::value<string>(), \"Set the service sending the event.\" )\n\t\t( \"host,h\", bpo::value<string>(), \"Set the origin host of the event.\" )\n\t\t( \"description,D\", bpo::value<string>(), \"Set the description of the event.\" )\n\t\t( \"attribute,a\", bpo::value<string>(), \"Add a new attribute to the event.\" )\n\t\t( \"tag,t\", bpo::value<string>(), \"Add a tag to the event.\" )\n\t\t( \"metric-sint64,i\", bpo::value<int64_t>(), \"Set the 64-bit integer metric of the event.\" )\n\t\t( \"metric-d,d\", bpo::value<double>(), \"Set the double metric of the event.\" )\n\t\t( \"metric-f,f\", bpo::value<float>(), \"Set the float metric of the event.\" )\n\t\t( \"ttl,L\", bpo::value<int>(), \"Set the TTL of the event.\" )\n\t\t( \"tcp,T\", bpo::value<bool>()->default_value(true), \"Send the message over TCP (default).\" )\n\t\t( \"udp,U\", bpo::value<bool>(), \"Send the message over UDP.\" )\n\t\t;\n\treturn options;\n}\n\nbpo::options_description\nquery_options() {\n\tbpo::options_description options(\"Query Command Options\");\n\toptions.add_options()\n\t\t( \"query,q\", bpo::value<string>(), \"Query to send to Riemann.\" )\n\t\t( \"json,j\", \"Output the results as a JSON array.\" )\n\t\t;\n\treturn options;\n}\n\nbpo::options_description\nmiscellaneous_options() {\n\tbpo::options_description options(\"Miscellaneous Options\");\n\toptions.add_options()\n\t\t( \"version,V\", \"Display version.\" )\n\t\t( \"help,?\", \"Show this help page.\" )\n\t\t;\n\treturn options;\n}\n\nvoid\nprocess_command_send(const bpo::variables_map& vm) {\n\trpp::client_type type = rpp::client_type::tcp;\n\tif (vm.count(\"tcp\")) {\n\t\ttype = (vm[\"tcp\"].as<bool>()) ? rpp::client_type::tcp : rpp::client_type::udp;\n\t} else if (vm.count(\"udp\")) {\n\t\ttype = (vm[\"udp\"].as<bool>()) ? rpp::client_type::udp : rpp::client_type::tcp;\n\t}\n\n\trpp::client client;\n\tclient.connect(type, vm[\"rhost\"].as<string>(), vm[\"rport\"].as<int>());\n\n\trpp::event event;\n\tif (vm.count(\"state\")) {\n\t\trpp::field f(rpp::event_field::state, vm[\"state\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"service\")) {\n\t\trpp::field f(rpp::event_field::service, vm[\"service\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"host\")) {\n\t\trpp::field f(rpp::event_field::host, vm[\"host\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"description\")) {\n\t\trpp::field f(rpp::event_field::description, vm[\"description\"].as<string>());\n\t\tevent << f;\n\t}\n\/\/\tif (vm.count(\"attribute\")) {\n\/\/\t\trpp::attribute attribute;\n\/\/\t\tvm[\"attribute\"].as<string>();\n\/\/\t}\n\tif (vm.count(\"tag\")) {\n\t\tstring s(vm[\"tag\"].as<string>());\n\t\tevent << s;\n\t}\n\tif (vm.count(\"metric-sint64\")) {\n\t\trpp::field f(rpp::event_field::metrics64, vm[\"metric-sint64\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"metric-dbl\")) {\n\t\trpp::field f(rpp::event_field::metricd, vm[\"metric-dbl\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"metric-flt\")) {\n\t\trpp::field f(rpp::event_field::metricf, vm[\"metric-flt\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"ttl\")) {\n\t\trpp::field f(rpp::event_field::ttl, vm[\"ttl\"].as<string>());\n\t\tevent << f;\n\t}\n\n\trpp::message message;\n\tmessage << event;\n\n\tclient << message;\n}\n\nvoid\nprocess_command_query(const bpo::variables_map& vm) {\n\trpp::client client;\n\tclient.connect(rpp::client_type::tcp, vm[\"rhost\"].as<string>(), vm[\"rport\"].as<int>());\n\n\trpp::query query;\n\tif (vm.count(\"query\")) {\n\t\tquery.set_string(vm[\"query\"].as<string>());\n\t}\n\n\trpp::message message;\n\tmessage.set_query(query);\n\n\tclient.send_message_oneshot(message);\n\n\t\/\/ ops.result_json = (vm.count(\"json\") > 0);\n\t\/\/ client.recv();\n}\n\noptions \nprocess_command_line(int argc, char const* argv[]) {\n\tbpo::positional_options_description arguments;\n\targuments.add(\"command\", 1);\n\targuments.add(\"rhost\", 1);\n\targuments.add(\"rport\", 1);\n\n\tbpo::options_description all;\n\tall.add(miscellaneous_options());\n\tall.add_options()\n\t\t( \"command\", bpo::value<string>(), \"Either query or send\" )\n\t\t;\n\tall.add(send_options());\n\tall.add(query_options());\n\tall.add_options()\n\t\t( \"rhost\", bpo::value<string>()->default_value(\"localhost\"), \"The address of the Riemann server (default: localhost)\" )\n\t\t( \"rport\", bpo::value<int>()->default_value(5555), \"The port of the Riemann server (default: 5555)\" )\n\t\t;\n\n\tbpo::variables_map vm;\n\toptions ops;\n\n\ttry {\n\t\tbpo::store(bpo::command_line_parser(argc, argv).options(all).positional(arguments).run(), vm);\n\t} catch(bpo::too_many_positional_options_error& e) {\n\t\tcerr << \"Too many arguments provided.\" << endl;\n\t\tops.show_usage = true;\n\t} catch(bpo::unknown_option& e) {\n\t\tcerr << \"Unknown option '\" << e.get_option_name() << \"'.\" << endl;\n\t\tops.show_usage = true;\n\t} catch(bpo::error& e) {\n\t\tcerr << \"command line parse error: \" << e.what() << \"'.\" << endl;\n\t\tops.show_usage = true;\n\t}\n\n\tif ((0 == vm.count(\"command\")) || vm.count(\"help\")) {\n\t\tops.show_usage = true;\n\t} if (vm.count(\"command\") && (vm[\"command\"].as<string>() == string(\"query\")) && (0 == vm.count(\"query\"))) {\n\t\tops.show_usage = true;\n\t}\n\n\tops.show_version = (vm.count(\"version\") > 0);\n\tops.show_help = (vm.count(\"help\") > 0);\n\n\ttry {\n\t\tif (vm.count(\"command\")) {\n\t\t\tif (vm[\"command\"].as<string>() == \"send\") {\n\t\t\t\tprocess_command_send(vm);\n\t\t\t} else if (vm[\"command\"].as<string>() == \"query\") {\n\t\t\t\tprocess_command_query(vm);\n\t\t\t}\n\t\t}\n\t} catch (rpp::internal_exception &e) {\n\t\tcerr << \"Error: \" << e.error() << \" - \" << e.reason() << \".\" << endl;\n\t\tops.show_usage = true;\n\t}\n\treturn ops;\n}\n\nostream& \nshow_usage(ostream& stream) {\n\tstream << \"Usage: riemannpp COMMAND [options...] [HOST] [PORT]\" << endl;\n\tstream << endl;\n\tstream << \"The HOST and PORT arguments are optional, and they default to\" << endl;\n\tstream << \"\\\"localhost\\\" and 5555, respectively.\" << endl;\n\tstream << endl;\n\tstream << \"Command can be either `send` or `query`.\" << endl;\n\treturn stream;\n}\n\nostream& \nshow_help(ostream& stream) {\n\tstream << \"Available commands: send and query.\" << endl;\n\tstream << send_options() << endl;\n\tstream << endl;\n\tstream << query_options() << endl;\n\tstream << endl;\n\tstream << miscellaneous_options() << endl;\n\treturn stream;\n}\n<commit_msg>Fixed attribute on client options<commit_after>#include \"options.hpp\"\n\n#include <riemannpp\/riemannpp.hpp>\n\n#include <boost\/program_options\/options_description.hpp>\n#include <boost\/program_options\/parsers.hpp>\n#include <boost\/program_options\/variables_map.hpp>\n\nnamespace bpo = boost::program_options;\nnamespace rpp = riemannpp;\n\nusing namespace client;\nusing namespace std;\n\nbpo::options_description \nsend_options()\n{\n\tbpo::options_description options(\"Send Command Options\");\n\toptions.add_options()\n\t\t( \"state,s\", bpo::value<string>(), \"Set the state of the event.\" )\n\t\t( \"service,S\", bpo::value<string>(), \"Set the service sending the event.\" )\n\t\t( \"host,h\", bpo::value<string>(), \"Set the origin host of the event.\" )\n\t\t( \"description,D\", bpo::value<string>(), \"Set the description of the event.\" )\n\t\t( \"attribute,a\", bpo::value<string>(), \"Add a new attribute to the event.\" )\n\t\t( \"tag,t\", bpo::value<string>(), \"Add a tag to the event.\" )\n\t\t( \"metric-sint64,i\", bpo::value<int64_t>(), \"Set the 64-bit integer metric of the event.\" )\n\t\t( \"metric-d,d\", bpo::value<double>(), \"Set the double metric of the event.\" )\n\t\t( \"metric-f,f\", bpo::value<float>(), \"Set the float metric of the event.\" )\n\t\t( \"ttl,L\", bpo::value<int>(), \"Set the TTL of the event.\" )\n\t\t( \"tcp,T\", bpo::value<bool>()->default_value(true), \"Send the message over TCP (default).\" )\n\t\t( \"udp,U\", bpo::value<bool>(), \"Send the message over UDP.\" )\n\t\t;\n\treturn options;\n}\n\nbpo::options_description\nquery_options() {\n\tbpo::options_description options(\"Query Command Options\");\n\toptions.add_options()\n\t\t( \"query,q\", bpo::value<string>(), \"Query to send to Riemann.\" )\n\t\t( \"json,j\", \"Output the results as a JSON array.\" )\n\t\t;\n\treturn options;\n}\n\nbpo::options_description\nmiscellaneous_options() {\n\tbpo::options_description options(\"Miscellaneous Options\");\n\toptions.add_options()\n\t\t( \"version,V\", \"Display version.\" )\n\t\t( \"help,?\", \"Show this help page.\" )\n\t\t;\n\treturn options;\n}\n\nvoid\nprocess_command_send(const bpo::variables_map& vm) {\n\trpp::client_type type = rpp::client_type::tcp;\n\tif (vm.count(\"tcp\")) {\n\t\ttype = (vm[\"tcp\"].as<bool>()) ? rpp::client_type::tcp : rpp::client_type::udp;\n\t} else if (vm.count(\"udp\")) {\n\t\ttype = (vm[\"udp\"].as<bool>()) ? rpp::client_type::udp : rpp::client_type::tcp;\n\t}\n\n\trpp::client client;\n\tclient.connect(type, vm[\"rhost\"].as<string>(), vm[\"rport\"].as<int>());\n\n\trpp::event event;\n\tif (vm.count(\"state\")) {\n\t\trpp::field f(rpp::event_field::state, vm[\"state\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"service\")) {\n\t\trpp::field f(rpp::event_field::service, vm[\"service\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"host\")) {\n\t\trpp::field f(rpp::event_field::host, vm[\"host\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"description\")) {\n\t\trpp::field f(rpp::event_field::description, vm[\"description\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"attribute\")) {\n\t\trpp::attribute attribute;\n\t\tstring tmp = vm[\"attribute\"].as<string>();\n\t\tif (size_t it = tmp.find(':') != string::npos) {\n\t\t\tattribute.set(tmp.substr(0, (it+2)), tmp.substr(it+3));\n\t\t} else {\n\t\t\tattribute.set_key(tmp);\n\t\t}\n\t}\n\tif (vm.count(\"tag\")) {\n\t\tstring s(vm[\"tag\"].as<string>());\n\t\tevent << s;\n\t}\n\tif (vm.count(\"metric-sint64\")) {\n\t\trpp::field f(rpp::event_field::metrics64, vm[\"metric-sint64\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"metric-dbl\")) {\n\t\trpp::field f(rpp::event_field::metricd, vm[\"metric-dbl\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"metric-flt\")) {\n\t\trpp::field f(rpp::event_field::metricf, vm[\"metric-flt\"].as<string>());\n\t\tevent << f;\n\t}\n\tif (vm.count(\"ttl\")) {\n\t\trpp::field f(rpp::event_field::ttl, vm[\"ttl\"].as<string>());\n\t\tevent << f;\n\t}\n\n\trpp::message message;\n\tmessage << event;\n\n\tclient << message;\n}\n\nvoid\nprocess_command_query(const bpo::variables_map& vm) {\n\trpp::client client;\n\tclient.connect(rpp::client_type::tcp, vm[\"rhost\"].as<string>(), vm[\"rport\"].as<int>());\n\n\trpp::query query;\n\tif (vm.count(\"query\")) {\n\t\tquery.set_string(vm[\"query\"].as<string>());\n\t}\n\n\trpp::message message;\n\tmessage.set_query(query);\n\n\tclient.send_message_oneshot(message);\n\n\t\/\/ ops.result_json = (vm.count(\"json\") > 0);\n\t\/\/ client.recv();\n}\n\noptions \nprocess_command_line(int argc, char const* argv[]) {\n\tbpo::positional_options_description arguments;\n\targuments.add(\"command\", 1);\n\targuments.add(\"rhost\", 1);\n\targuments.add(\"rport\", 1);\n\n\tbpo::options_description all;\n\tall.add(miscellaneous_options());\n\tall.add_options()\n\t\t( \"command\", bpo::value<string>(), \"Either query or send\" )\n\t\t;\n\tall.add(send_options());\n\tall.add(query_options());\n\tall.add_options()\n\t\t( \"rhost\", bpo::value<string>()->default_value(\"localhost\"), \"The address of the Riemann server (default: localhost)\" )\n\t\t( \"rport\", bpo::value<int>()->default_value(5555), \"The port of the Riemann server (default: 5555)\" )\n\t\t;\n\n\tbpo::variables_map vm;\n\toptions ops;\n\n\ttry {\n\t\tbpo::store(bpo::command_line_parser(argc, argv).options(all).positional(arguments).run(), vm);\n\t} catch(bpo::too_many_positional_options_error& e) {\n\t\tcerr << \"Too many arguments provided.\" << endl;\n\t\tops.show_usage = true;\n\t} catch(bpo::unknown_option& e) {\n\t\tcerr << \"Unknown option '\" << e.get_option_name() << \"'.\" << endl;\n\t\tops.show_usage = true;\n\t} catch(bpo::error& e) {\n\t\tcerr << \"command line parse error: \" << e.what() << \"'.\" << endl;\n\t\tops.show_usage = true;\n\t}\n\n\tif ((0 == vm.count(\"command\")) || vm.count(\"help\")) {\n\t\tops.show_usage = true;\n\t} if (vm.count(\"command\") && (vm[\"command\"].as<string>() == string(\"query\")) && (0 == vm.count(\"query\"))) {\n\t\tops.show_usage = true;\n\t}\n\n\tops.show_version = (vm.count(\"version\") > 0);\n\tops.show_help = (vm.count(\"help\") > 0);\n\n\ttry {\n\t\tif (vm.count(\"command\")) {\n\t\t\tif (vm[\"command\"].as<string>() == \"send\") {\n\t\t\t\tprocess_command_send(vm);\n\t\t\t} else if (vm[\"command\"].as<string>() == \"query\") {\n\t\t\t\tprocess_command_query(vm);\n\t\t\t}\n\t\t}\n\t} catch (rpp::internal_exception &e) {\n\t\tcerr << \"Error: \" << e.error() << \" - \" << e.reason() << \".\" << endl;\n\t\tops.show_usage = true;\n\t}\n\treturn ops;\n}\n\nostream& \nshow_usage(ostream& stream) {\n\tstream << \"Usage: riemannpp COMMAND [options...] [HOST] [PORT]\" << endl;\n\tstream << endl;\n\tstream << \"The HOST and PORT arguments are optional, and they default to\" << endl;\n\tstream << \"\\\"localhost\\\" and 5555, respectively.\" << endl;\n\tstream << endl;\n\tstream << \"Command can be either `send` or `query`.\" << endl;\n\treturn stream;\n}\n\nostream& \nshow_help(ostream& stream) {\n\tstream << \"Available commands: send and query.\" << endl;\n\tstream << send_options() << endl;\n\tstream << endl;\n\tstream << query_options() << endl;\n\tstream << endl;\n\tstream << miscellaneous_options() << endl;\n\treturn stream;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--- InstructionDeleter.cpp - InstructionDeleter utility --------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2021 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SILOptimizer\/Utils\/ConstExpr.h\"\n#include \"swift\/SILOptimizer\/Utils\/DebugOptUtils.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstructionDeleter.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstOptUtils.h\"\n\nusing namespace swift;\n\nstatic bool hasOnlyIncidentalUses(SILInstruction *inst,\n bool preserveDebugInfo = false) {\n for (SILValue result : inst->getResults()) {\n for (Operand *use : result->getUses()) {\n SILInstruction *user = use->getUser();\n if (!isIncidentalUse(user))\n return false;\n if (preserveDebugInfo && user->isDebugInstruction())\n return false;\n }\n }\n return true;\n}\n\n\/\/\/ A scope-affecting instruction is an instruction which may end the scope of\n\/\/\/ its operand or may produce scoped results that require cleaning up. E.g.\n\/\/\/ begin_borrow, begin_access, copy_value, a call that produces a owned value\n\/\/\/ are scoped instructions. The scope of the results of the first two\n\/\/\/ instructions end with an end_borrow\/acess instruction, while those of the\n\/\/\/ latter two end with a consuming operation like destroy_value instruction.\n\/\/\/ These instruction may also end the scope of its operand e.g. a call could\n\/\/\/ consume owned arguments thereby ending its scope. Dead-code eliminating a\n\/\/\/ scope-affecting instruction requires fixing the lifetime of the non-trivial\n\/\/\/ operands of the instruction and requires cleaning up the end-of-scope uses\n\/\/\/ of non-trivial results.\n\/\/\/\n\/\/\/ \\param inst instruction that checked for liveness.\n\/\/\/\n\/\/\/ TODO: Handle partial_apply [stack] which has a dealloc_stack user.\nstatic bool isScopeAffectingInstructionDead(SILInstruction *inst,\n bool fixLifetime) {\n SILFunction *fun = inst->getFunction();\n assert(fun && \"Instruction has no function.\");\n \/\/ Only support ownership SIL for scoped instructions.\n if (!fun->hasOwnership()) {\n return false;\n }\n \/\/ If the instruction has any use other than end of scope use or destroy_value\n \/\/ use, bail out.\n if (!hasOnlyEndOfScopeOrEndOfLifetimeUses(inst)) {\n return false;\n }\n \/\/ If inst is a copy or beginning of scope, inst is dead, since we know that\n \/\/ it is used only in a destroy_value or end-of-scope instruction.\n if (getSingleValueCopyOrCast(inst))\n return true;\n\n switch (inst->getKind()) {\n case SILInstructionKind::LoadBorrowInst: {\n \/\/ A load_borrow only used in an end_borrow is dead.\n return true;\n }\n case SILInstructionKind::LoadInst: {\n LoadOwnershipQualifier loadOwnershipQual =\n cast<LoadInst>(inst)->getOwnershipQualifier();\n \/\/ If the load creates a copy, it is dead, since we know that if at all it\n \/\/ is used, it is only in a destroy_value instruction.\n return (loadOwnershipQual == LoadOwnershipQualifier::Copy ||\n loadOwnershipQual == LoadOwnershipQualifier::Trivial);\n \/\/ TODO: we can handle load [take] but we would have to know that the\n \/\/ operand has been consumed. Note that OperandOwnershipKind map does not\n \/\/ say this for load.\n }\n case SILInstructionKind::PartialApplyInst: {\n bool onlyTrivialArgs = true;\n for (auto &arg : cast<PartialApplyInst>(inst)->getArgumentOperands()) {\n auto argTy = arg.get()->getType();\n \/\/ Non-stack partial apply captures that are passed by address are always\n \/\/ captured at +1 by the closure contrext, regardless of the calling\n \/\/ convention.\n \/\/\n \/\/ TODO: When on-stack partial applies are also handled, then their +0\n \/\/ address arguments can be ignored.\n \/\/\n \/\/ FIXME: Even with fixLifetimes enabled, InstructionDeleter does not know\n \/\/ how to cleanup arguments captured by address. This should be as simple\n \/\/ as inserting a destroy_addr. But the analagous code in\n \/\/ tryDeleteDeadClosure() and keepArgsOfPartialApplyAlive() mysteriously\n \/\/ creates new alloc_stack's and invalidates stack nesting. So we\n \/\/ conservatively bail-out until we understand why that hack exists.\n if (argTy.isAddress())\n return false;\n\n onlyTrivialArgs &= argTy.isTrivial(*fun);\n }\n \/\/ Partial applies that are only used in destroys cannot have any effect on\n \/\/ the program state, provided the values they capture are explicitly\n \/\/ destroyed, which only happens when fixLifetime is true.\n return onlyTrivialArgs || fixLifetime;\n }\n case SILInstructionKind::StructInst:\n case SILInstructionKind::EnumInst:\n case SILInstructionKind::TupleInst:\n case SILInstructionKind::ConvertFunctionInst:\n case SILInstructionKind::DestructureStructInst:\n case SILInstructionKind::DestructureTupleInst: {\n \/\/ All these ownership forwarding instructions that are only used in\n \/\/ destroys are dead provided the values they consume are destroyed\n \/\/ explicitly.\n return true;\n }\n case SILInstructionKind::ApplyInst: {\n \/\/ The following property holds for constant-evaluable functions that do\n \/\/ not take arguments of generic type:\n \/\/ 1. they do not create objects having deinitializers with global\n \/\/ side effects, as they can only create objects consisting of trivial\n \/\/ values, (non-generic) arrays and strings.\n \/\/ 2. they do not use global variables or call arbitrary functions with\n \/\/ side effects.\n \/\/ The above two properties imply that a value returned by a constant\n \/\/ evaluable function does not have a deinitializer with global side\n \/\/ effects. Therefore, the deinitializer can be sinked.\n \/\/\n \/\/ A generic, read-only constant evaluable call only reads and\/or\n \/\/ destroys its (non-generic) parameters. It therefore cannot have any\n \/\/ side effects (note that parameters being non-generic have value\n \/\/ semantics). Therefore, the constant evaluable call can be removed\n \/\/ provided the parameter lifetimes are handled correctly, which is taken\n \/\/ care of by the function: \\c deleteInstruction.\n FullApplySite applySite(cast<ApplyInst>(inst));\n return isReadOnlyConstantEvaluableCall(applySite);\n }\n default: {\n return false;\n }\n }\n}\n\nbool InstructionDeleter::trackIfDead(SILInstruction *inst) {\n bool fixLifetime = inst->getFunction()->hasOwnership();\n if (isInstructionTriviallyDead(inst)\n || isScopeAffectingInstructionDead(inst, fixLifetime)) {\n assert(!isIncidentalUse(inst) && !isa<DestroyValueInst>(inst) &&\n \"Incidental uses cannot be removed in isolation. \"\n \"They would be removed iff the operand is dead\");\n getCallbacks().notifyWillBeDeleted(inst);\n deadInstructions.insert(inst);\n return true;\n }\n return false;\n}\n\nvoid InstructionDeleter::forceTrackAsDead(SILInstruction *inst) {\n bool preserveDebugInfo = inst->getFunction()->getEffectiveOptimizationMode()\n <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n getCallbacks().notifyWillBeDeleted(inst);\n deadInstructions.insert(inst);\n}\n\n\/\/\/ Force-delete \\p inst and all its uses.\n\/\/\/\n\/\/\/ \\p fixLifetimes causes new destroys to be inserted after dropping\n\/\/\/ operands.\n\/\/\/\n\/\/\/ \\p forceDeleteUsers allows deleting an instruction with non-incidental,\n\/\/\/ non-destoy uses, such as a store.\n\/\/\/\n\/\/\/ Does not call callbacks.notifyWillBeDeleted for \\p inst. But does\n\/\/\/ for any other instructions that become dead as a result.\n\/\/\/\n\/\/\/ Carefully orchestrated steps for deleting an instruction with its uses:\n\/\/\/\n\/\/\/ Recursively gather the instruction's uses into the toDeleteInsts set and\n\/\/\/ dropping the operand for each use traversed.\n\/\/\/\n\/\/\/ For the remaining operands, insert destroys for consuming operands and track\n\/\/\/ newly dead operand definitions.\n\/\/\/\n\/\/\/ Finally, erase the instruction.\nvoid InstructionDeleter::deleteWithUses(SILInstruction *inst, bool fixLifetimes,\n bool forceDeleteUsers) {\n \/\/ Cannot fix operand lifetimes in non-ownership SIL.\n assert(!fixLifetimes || inst->getFunction()->hasOwnership());\n\n \/\/ Recursively visit all uses while growing toDeleteInsts in def-use order and\n \/\/ dropping dead operands.\n SmallVector<SILInstruction *, 4> toDeleteInsts;\n\n toDeleteInsts.push_back(inst);\n swift::salvageDebugInfo(inst);\n for (unsigned idx = 0; idx < toDeleteInsts.size(); ++idx) {\n for (SILValue result : toDeleteInsts[idx]->getResults()) {\n \/\/ Temporary use vector to avoid iterator invalidation.\n auto uses = llvm::to_vector<4>(result->getUses());\n for (Operand *use : uses) {\n SILInstruction *user = use->getUser();\n assert(forceDeleteUsers || isIncidentalUse(user) ||\n isa<DestroyValueInst>(user));\n assert(!isa<BranchInst>(user) && \"can't delete phis\");\n\n toDeleteInsts.push_back(user);\n swift::salvageDebugInfo(user);\n use->drop();\n }\n }\n }\n \/\/ Process the remaining operands. Insert destroys for consuming\n \/\/ operands. Track newly dead operand values.\n for (auto *inst : toDeleteInsts) {\n for (Operand &operand : inst->getAllOperands()) {\n SILValue operandValue = operand.get();\n \/\/ Check for dead operands, which are dropped above.\n if (!operandValue)\n continue;\n\n if (fixLifetimes && operand.isConsuming()) {\n SILBuilderWithScope builder(inst);\n auto *dvi = builder.createDestroyValue(inst->getLoc(), operandValue);\n getCallbacks().createdNewInst(dvi);\n }\n auto *operDef = operandValue->getDefiningInstruction();\n operand.drop();\n if (operDef) {\n trackIfDead(operDef);\n }\n }\n inst->dropNonOperandReferences();\n deadInstructions.remove(inst);\n getCallbacks().deleteInst(inst, false \/*notify when deleting*\/);\n }\n}\n\nvoid InstructionDeleter::cleanupDeadInstructions() {\n while (!deadInstructions.empty()) {\n SmallVector<SILInstruction *, 8> currentDeadInsts(deadInstructions.begin(),\n deadInstructions.end());\n \/\/ Though deadInstructions is cleared here, calls to deleteInstruction may\n \/\/ append to deadInstructions. So we need to iterate until this it is empty.\n deadInstructions.clear();\n for (SILInstruction *deadInst : currentDeadInsts) {\n \/\/ deadInst will not have been deleted in the previous iterations,\n \/\/ because, by definition, deleteInstruction will only delete an earlier\n \/\/ instruction and its incidental\/destroy uses. The former cannot be\n \/\/ deadInst as deadInstructions is a set vector, and the latter cannot be\n \/\/ in deadInstructions as they are incidental uses which are never added\n \/\/ to deadInstructions.\n deleteWithUses(deadInst,\n \/*fixLifetimes*\/ deadInst->getFunction()->hasOwnership());\n }\n }\n}\n\nbool InstructionDeleter::deleteIfDead(SILInstruction *inst) {\n bool fixLifetime = inst->getFunction()->hasOwnership();\n if (isInstructionTriviallyDead(inst)\n || isScopeAffectingInstructionDead(inst, fixLifetime)) {\n getCallbacks().notifyWillBeDeleted(inst);\n deleteWithUses(inst, fixLifetime);\n return true;\n }\n return false;\n}\n\nvoid InstructionDeleter::forceDeleteAndFixLifetimes(SILInstruction *inst) {\n SILFunction *fun = inst->getFunction();\n bool preserveDebugInfo =\n fun->getEffectiveOptimizationMode() <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n deleteWithUses(inst, \/*fixLifetimes*\/ fun->hasOwnership());\n}\n\nvoid InstructionDeleter::forceDelete(SILInstruction *inst) {\n bool preserveDebugInfo = inst->getFunction()->getEffectiveOptimizationMode()\n <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n deleteWithUses(inst, \/*fixLifetimes*\/ false);\n}\n\nvoid InstructionDeleter::recursivelyDeleteUsersIfDead(SILInstruction *inst) {\n SmallVector<SILInstruction *, 8> users;\n for (SILValue result : inst->getResults())\n for (Operand *use : result->getUses())\n users.push_back(use->getUser());\n\n for (SILInstruction *user : users)\n recursivelyDeleteUsersIfDead(user);\n deleteIfDead(inst);\n}\n\nvoid InstructionDeleter::recursivelyForceDeleteUsersAndFixLifetimes(\n SILInstruction *inst) {\n for (SILValue result : inst->getResults()) {\n while (!result->use_empty()) {\n SILInstruction *user = result->use_begin()->getUser();\n recursivelyForceDeleteUsersAndFixLifetimes(user);\n }\n }\n if (isIncidentalUse(inst) || isa<DestroyValueInst>(inst)) {\n forceDelete(inst);\n return;\n }\n forceDeleteAndFixLifetimes(inst);\n}\n\nvoid swift::eliminateDeadInstruction(SILInstruction *inst,\n InstModCallbacks callbacks) {\n InstructionDeleter deleter(std::move(callbacks));\n deleter.trackIfDead(inst);\n deleter.cleanupDeadInstructions();\n}\n\nvoid swift::recursivelyDeleteTriviallyDeadInstructions(\n ArrayRef<SILInstruction *> ia, bool force, InstModCallbacks callbacks) {\n \/\/ Delete these instruction and others that become dead after it's deleted.\n llvm::SmallPtrSet<SILInstruction *, 8> deadInsts;\n for (auto *inst : ia) {\n \/\/ If the instruction is not dead and force is false, do nothing.\n if (force || isInstructionTriviallyDead(inst))\n deadInsts.insert(inst);\n }\n llvm::SmallPtrSet<SILInstruction *, 8> nextInsts;\n while (!deadInsts.empty()) {\n for (auto inst : deadInsts) {\n \/\/ Call the callback before we mutate the to be deleted instruction in any\n \/\/ way.\n callbacks.notifyWillBeDeleted(inst);\n\n \/\/ Check if any of the operands will become dead as well.\n MutableArrayRef<Operand> operands = inst->getAllOperands();\n for (Operand &operand : operands) {\n SILValue operandVal = operand.get();\n if (!operandVal)\n continue;\n\n \/\/ Remove the reference from the instruction being deleted to this\n \/\/ operand.\n operand.drop();\n\n \/\/ If the operand is an instruction that is only used by the instruction\n \/\/ being deleted, delete it.\n if (auto *operandValInst = operandVal->getDefiningInstruction())\n if (!deadInsts.count(operandValInst) &&\n isInstructionTriviallyDead(operandValInst))\n nextInsts.insert(operandValInst);\n }\n\n \/\/ If we have a function ref inst, we need to especially drop its function\n \/\/ argument so that it gets a proper ref decrement.\n if (auto *fri = dyn_cast<FunctionRefBaseInst>(inst))\n fri->dropReferencedFunction();\n }\n\n for (auto inst : deadInsts) {\n \/\/ This will remove this instruction and all its uses.\n eraseFromParentWithDebugInsts(inst, callbacks);\n }\n\n nextInsts.swap(deadInsts);\n nextInsts.clear();\n }\n}\n\n<commit_msg>InstructionDeleter - ignore already-deleted instructions<commit_after>\/\/===--- InstructionDeleter.cpp - InstructionDeleter utility --------------===\/\/\n\/\/\n\/\/ This source file is part of the Swift.org open source project\n\/\/\n\/\/ Copyright (c) 2014 - 2021 Apple Inc. and the Swift project authors\n\/\/ Licensed under Apache License v2.0 with Runtime Library Exception\n\/\/\n\/\/ See https:\/\/swift.org\/LICENSE.txt for license information\n\/\/ See https:\/\/swift.org\/CONTRIBUTORS.txt for the list of Swift project authors\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n#include \"swift\/SIL\/SILFunction.h\"\n#include \"swift\/SILOptimizer\/Utils\/ConstExpr.h\"\n#include \"swift\/SILOptimizer\/Utils\/DebugOptUtils.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstructionDeleter.h\"\n#include \"swift\/SILOptimizer\/Utils\/InstOptUtils.h\"\n\nusing namespace swift;\n\nstatic bool hasOnlyIncidentalUses(SILInstruction *inst,\n bool preserveDebugInfo = false) {\n for (SILValue result : inst->getResults()) {\n for (Operand *use : result->getUses()) {\n SILInstruction *user = use->getUser();\n if (!isIncidentalUse(user))\n return false;\n if (preserveDebugInfo && user->isDebugInstruction())\n return false;\n }\n }\n return true;\n}\n\n\/\/\/ A scope-affecting instruction is an instruction which may end the scope of\n\/\/\/ its operand or may produce scoped results that require cleaning up. E.g.\n\/\/\/ begin_borrow, begin_access, copy_value, a call that produces a owned value\n\/\/\/ are scoped instructions. The scope of the results of the first two\n\/\/\/ instructions end with an end_borrow\/acess instruction, while those of the\n\/\/\/ latter two end with a consuming operation like destroy_value instruction.\n\/\/\/ These instruction may also end the scope of its operand e.g. a call could\n\/\/\/ consume owned arguments thereby ending its scope. Dead-code eliminating a\n\/\/\/ scope-affecting instruction requires fixing the lifetime of the non-trivial\n\/\/\/ operands of the instruction and requires cleaning up the end-of-scope uses\n\/\/\/ of non-trivial results.\n\/\/\/\n\/\/\/ \\param inst instruction that checked for liveness.\n\/\/\/\n\/\/\/ TODO: Handle partial_apply [stack] which has a dealloc_stack user.\nstatic bool isScopeAffectingInstructionDead(SILInstruction *inst,\n bool fixLifetime) {\n SILFunction *fun = inst->getFunction();\n assert(fun && \"Instruction has no function.\");\n \/\/ Only support ownership SIL for scoped instructions.\n if (!fun->hasOwnership()) {\n return false;\n }\n \/\/ If the instruction has any use other than end of scope use or destroy_value\n \/\/ use, bail out.\n if (!hasOnlyEndOfScopeOrEndOfLifetimeUses(inst)) {\n return false;\n }\n \/\/ If inst is a copy or beginning of scope, inst is dead, since we know that\n \/\/ it is used only in a destroy_value or end-of-scope instruction.\n if (getSingleValueCopyOrCast(inst))\n return true;\n\n switch (inst->getKind()) {\n case SILInstructionKind::LoadBorrowInst: {\n \/\/ A load_borrow only used in an end_borrow is dead.\n return true;\n }\n case SILInstructionKind::LoadInst: {\n LoadOwnershipQualifier loadOwnershipQual =\n cast<LoadInst>(inst)->getOwnershipQualifier();\n \/\/ If the load creates a copy, it is dead, since we know that if at all it\n \/\/ is used, it is only in a destroy_value instruction.\n return (loadOwnershipQual == LoadOwnershipQualifier::Copy ||\n loadOwnershipQual == LoadOwnershipQualifier::Trivial);\n \/\/ TODO: we can handle load [take] but we would have to know that the\n \/\/ operand has been consumed. Note that OperandOwnershipKind map does not\n \/\/ say this for load.\n }\n case SILInstructionKind::PartialApplyInst: {\n bool onlyTrivialArgs = true;\n for (auto &arg : cast<PartialApplyInst>(inst)->getArgumentOperands()) {\n auto argTy = arg.get()->getType();\n \/\/ Non-stack partial apply captures that are passed by address are always\n \/\/ captured at +1 by the closure contrext, regardless of the calling\n \/\/ convention.\n \/\/\n \/\/ TODO: When on-stack partial applies are also handled, then their +0\n \/\/ address arguments can be ignored.\n \/\/\n \/\/ FIXME: Even with fixLifetimes enabled, InstructionDeleter does not know\n \/\/ how to cleanup arguments captured by address. This should be as simple\n \/\/ as inserting a destroy_addr. But the analagous code in\n \/\/ tryDeleteDeadClosure() and keepArgsOfPartialApplyAlive() mysteriously\n \/\/ creates new alloc_stack's and invalidates stack nesting. So we\n \/\/ conservatively bail-out until we understand why that hack exists.\n if (argTy.isAddress())\n return false;\n\n onlyTrivialArgs &= argTy.isTrivial(*fun);\n }\n \/\/ Partial applies that are only used in destroys cannot have any effect on\n \/\/ the program state, provided the values they capture are explicitly\n \/\/ destroyed, which only happens when fixLifetime is true.\n return onlyTrivialArgs || fixLifetime;\n }\n case SILInstructionKind::StructInst:\n case SILInstructionKind::EnumInst:\n case SILInstructionKind::TupleInst:\n case SILInstructionKind::ConvertFunctionInst:\n case SILInstructionKind::DestructureStructInst:\n case SILInstructionKind::DestructureTupleInst: {\n \/\/ All these ownership forwarding instructions that are only used in\n \/\/ destroys are dead provided the values they consume are destroyed\n \/\/ explicitly.\n return true;\n }\n case SILInstructionKind::ApplyInst: {\n \/\/ The following property holds for constant-evaluable functions that do\n \/\/ not take arguments of generic type:\n \/\/ 1. they do not create objects having deinitializers with global\n \/\/ side effects, as they can only create objects consisting of trivial\n \/\/ values, (non-generic) arrays and strings.\n \/\/ 2. they do not use global variables or call arbitrary functions with\n \/\/ side effects.\n \/\/ The above two properties imply that a value returned by a constant\n \/\/ evaluable function does not have a deinitializer with global side\n \/\/ effects. Therefore, the deinitializer can be sinked.\n \/\/\n \/\/ A generic, read-only constant evaluable call only reads and\/or\n \/\/ destroys its (non-generic) parameters. It therefore cannot have any\n \/\/ side effects (note that parameters being non-generic have value\n \/\/ semantics). Therefore, the constant evaluable call can be removed\n \/\/ provided the parameter lifetimes are handled correctly, which is taken\n \/\/ care of by the function: \\c deleteInstruction.\n FullApplySite applySite(cast<ApplyInst>(inst));\n return isReadOnlyConstantEvaluableCall(applySite);\n }\n default: {\n return false;\n }\n }\n}\n\nbool InstructionDeleter::trackIfDead(SILInstruction *inst) {\n bool fixLifetime = inst->getFunction()->hasOwnership();\n if (isInstructionTriviallyDead(inst)\n || isScopeAffectingInstructionDead(inst, fixLifetime)) {\n assert(!isIncidentalUse(inst) && !isa<DestroyValueInst>(inst) &&\n \"Incidental uses cannot be removed in isolation. \"\n \"They would be removed iff the operand is dead\");\n getCallbacks().notifyWillBeDeleted(inst);\n deadInstructions.insert(inst);\n return true;\n }\n return false;\n}\n\nvoid InstructionDeleter::forceTrackAsDead(SILInstruction *inst) {\n bool preserveDebugInfo = inst->getFunction()->getEffectiveOptimizationMode()\n <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n getCallbacks().notifyWillBeDeleted(inst);\n deadInstructions.insert(inst);\n}\n\n\/\/\/ Force-delete \\p inst and all its uses.\n\/\/\/\n\/\/\/ \\p fixLifetimes causes new destroys to be inserted after dropping\n\/\/\/ operands.\n\/\/\/\n\/\/\/ \\p forceDeleteUsers allows deleting an instruction with non-incidental,\n\/\/\/ non-destoy uses, such as a store.\n\/\/\/\n\/\/\/ Does not call callbacks.notifyWillBeDeleted for \\p inst. But does\n\/\/\/ for any other instructions that become dead as a result.\n\/\/\/\n\/\/\/ Carefully orchestrated steps for deleting an instruction with its uses:\n\/\/\/\n\/\/\/ Recursively gather the instruction's uses into the toDeleteInsts set and\n\/\/\/ dropping the operand for each use traversed.\n\/\/\/\n\/\/\/ For the remaining operands, insert destroys for consuming operands and track\n\/\/\/ newly dead operand definitions.\n\/\/\/\n\/\/\/ Finally, erase the instruction.\nvoid InstructionDeleter::deleteWithUses(SILInstruction *inst, bool fixLifetimes,\n bool forceDeleteUsers) {\n \/\/ Cannot fix operand lifetimes in non-ownership SIL.\n assert(!fixLifetimes || inst->getFunction()->hasOwnership());\n\n \/\/ Recursively visit all uses while growing toDeleteInsts in def-use order and\n \/\/ dropping dead operands.\n SmallVector<SILInstruction *, 4> toDeleteInsts;\n\n toDeleteInsts.push_back(inst);\n swift::salvageDebugInfo(inst);\n for (unsigned idx = 0; idx < toDeleteInsts.size(); ++idx) {\n for (SILValue result : toDeleteInsts[idx]->getResults()) {\n \/\/ Temporary use vector to avoid iterator invalidation.\n auto uses = llvm::to_vector<4>(result->getUses());\n for (Operand *use : uses) {\n SILInstruction *user = use->getUser();\n assert(forceDeleteUsers || isIncidentalUse(user) ||\n isa<DestroyValueInst>(user));\n assert(!isa<BranchInst>(user) && \"can't delete phis\");\n\n toDeleteInsts.push_back(user);\n swift::salvageDebugInfo(user);\n use->drop();\n }\n }\n }\n \/\/ Process the remaining operands. Insert destroys for consuming\n \/\/ operands. Track newly dead operand values. Instructions with multiple dead\n \/\/ operands may occur in toDeleteInsts multiple times.\n for (auto *inst : toDeleteInsts) {\n if (inst->isDeleted())\n continue;\n\n for (Operand &operand : inst->getAllOperands()) {\n SILValue operandValue = operand.get();\n \/\/ Check for dead operands, which are dropped above.\n if (!operandValue)\n continue;\n\n if (fixLifetimes && operand.isConsuming()) {\n SILBuilderWithScope builder(inst);\n auto *dvi = builder.createDestroyValue(inst->getLoc(), operandValue);\n getCallbacks().createdNewInst(dvi);\n }\n auto *operDef = operandValue->getDefiningInstruction();\n operand.drop();\n if (operDef) {\n trackIfDead(operDef);\n }\n }\n inst->dropNonOperandReferences();\n deadInstructions.remove(inst);\n getCallbacks().deleteInst(inst, false \/*notify when deleting*\/);\n }\n}\n\nvoid InstructionDeleter::cleanupDeadInstructions() {\n while (!deadInstructions.empty()) {\n SmallVector<SILInstruction *, 8> currentDeadInsts(deadInstructions.begin(),\n deadInstructions.end());\n \/\/ Though deadInstructions is cleared here, calls to deleteInstruction may\n \/\/ append to deadInstructions. So we need to iterate until this it is empty.\n deadInstructions.clear();\n for (SILInstruction *deadInst : currentDeadInsts) {\n if (deadInst->isDeleted())\n continue;\n\n \/\/ deadInst will not have been deleted in the previous iterations,\n \/\/ because, by definition, deleteInstruction will only delete an earlier\n \/\/ instruction and its incidental\/destroy uses. The former cannot be\n \/\/ deadInst as deadInstructions is a set vector, and the latter cannot be\n \/\/ in deadInstructions as they are incidental uses which are never added\n \/\/ to deadInstructions.\n deleteWithUses(deadInst,\n \/*fixLifetimes*\/ deadInst->getFunction()->hasOwnership());\n }\n }\n}\n\nbool InstructionDeleter::deleteIfDead(SILInstruction *inst) {\n bool fixLifetime = inst->getFunction()->hasOwnership();\n if (isInstructionTriviallyDead(inst)\n || isScopeAffectingInstructionDead(inst, fixLifetime)) {\n getCallbacks().notifyWillBeDeleted(inst);\n deleteWithUses(inst, fixLifetime);\n return true;\n }\n return false;\n}\n\nvoid InstructionDeleter::forceDeleteAndFixLifetimes(SILInstruction *inst) {\n SILFunction *fun = inst->getFunction();\n bool preserveDebugInfo =\n fun->getEffectiveOptimizationMode() <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n deleteWithUses(inst, \/*fixLifetimes*\/ fun->hasOwnership());\n}\n\nvoid InstructionDeleter::forceDelete(SILInstruction *inst) {\n bool preserveDebugInfo = inst->getFunction()->getEffectiveOptimizationMode()\n <= OptimizationMode::NoOptimization;\n assert(hasOnlyIncidentalUses(inst, preserveDebugInfo));\n deleteWithUses(inst, \/*fixLifetimes*\/ false);\n}\n\nvoid InstructionDeleter::recursivelyDeleteUsersIfDead(SILInstruction *inst) {\n SmallVector<SILInstruction *, 8> users;\n for (SILValue result : inst->getResults())\n for (Operand *use : result->getUses())\n users.push_back(use->getUser());\n\n for (SILInstruction *user : users)\n recursivelyDeleteUsersIfDead(user);\n deleteIfDead(inst);\n}\n\nvoid InstructionDeleter::recursivelyForceDeleteUsersAndFixLifetimes(\n SILInstruction *inst) {\n for (SILValue result : inst->getResults()) {\n while (!result->use_empty()) {\n SILInstruction *user = result->use_begin()->getUser();\n recursivelyForceDeleteUsersAndFixLifetimes(user);\n }\n }\n if (isIncidentalUse(inst) || isa<DestroyValueInst>(inst)) {\n forceDelete(inst);\n return;\n }\n forceDeleteAndFixLifetimes(inst);\n}\n\nvoid swift::eliminateDeadInstruction(SILInstruction *inst,\n InstModCallbacks callbacks) {\n InstructionDeleter deleter(std::move(callbacks));\n deleter.trackIfDead(inst);\n deleter.cleanupDeadInstructions();\n}\n\nvoid swift::recursivelyDeleteTriviallyDeadInstructions(\n ArrayRef<SILInstruction *> ia, bool force, InstModCallbacks callbacks) {\n \/\/ Delete these instruction and others that become dead after it's deleted.\n llvm::SmallPtrSet<SILInstruction *, 8> deadInsts;\n for (auto *inst : ia) {\n \/\/ If the instruction is not dead and force is false, do nothing.\n if (force || isInstructionTriviallyDead(inst))\n deadInsts.insert(inst);\n }\n llvm::SmallPtrSet<SILInstruction *, 8> nextInsts;\n while (!deadInsts.empty()) {\n for (auto inst : deadInsts) {\n \/\/ Call the callback before we mutate the to be deleted instruction in any\n \/\/ way.\n callbacks.notifyWillBeDeleted(inst);\n\n \/\/ Check if any of the operands will become dead as well.\n MutableArrayRef<Operand> operands = inst->getAllOperands();\n for (Operand &operand : operands) {\n SILValue operandVal = operand.get();\n if (!operandVal)\n continue;\n\n \/\/ Remove the reference from the instruction being deleted to this\n \/\/ operand.\n operand.drop();\n\n \/\/ If the operand is an instruction that is only used by the instruction\n \/\/ being deleted, delete it.\n if (auto *operandValInst = operandVal->getDefiningInstruction())\n if (!deadInsts.count(operandValInst) &&\n isInstructionTriviallyDead(operandValInst))\n nextInsts.insert(operandValInst);\n }\n\n \/\/ If we have a function ref inst, we need to especially drop its function\n \/\/ argument so that it gets a proper ref decrement.\n if (auto *fri = dyn_cast<FunctionRefBaseInst>(inst))\n fri->dropReferencedFunction();\n }\n\n for (auto inst : deadInsts) {\n \/\/ This will remove this instruction and all its uses.\n eraseFromParentWithDebugInsts(inst, callbacks);\n }\n\n nextInsts.swap(deadInsts);\n nextInsts.clear();\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"http_port\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8000\",\n \"Start the public http server on this port\",\n \"<port>\");\n\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"<level>\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n \/* start event loop *\/\n fnord::thread::EventLoop ev;\n\n WhitelistVFS vfs;\n vfs.registerFile(\"test.sstable\", \"\/tmp\/fu2\");\n\n sstable::SSTableServlet sstable_servlet(\"\/sstable\", &vfs);\n\n \/* start http server *\/\n fnord::http::HTTPRouter http_router;\n http_router.addRouteByPrefixMatch(\"\/sstable\", &sstable_servlet);\n fnord::http::HTTPServer http_server(&http_router, &ev);\n http_server.listen(flags.getInt(\"http_port\"));\n\n ev.run();\n\n return 0;\n}\n\n<commit_msg>serve directory from reportserver<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <stdlib.h>\n#include <unistd.h>\n#include <signal.h>\n#include \"fnord-base\/io\/filerepository.h\"\n#include \"fnord-base\/io\/fileutil.h\"\n#include \"fnord-base\/application.h\"\n#include \"fnord-base\/logging.h\"\n#include \"fnord-base\/random.h\"\n#include \"fnord-base\/thread\/eventloop.h\"\n#include \"fnord-base\/thread\/threadpool.h\"\n#include \"fnord-base\/wallclock.h\"\n#include \"fnord-base\/VFS.h\"\n#include \"fnord-rpc\/ServerGroup.h\"\n#include \"fnord-rpc\/RPC.h\"\n#include \"fnord-rpc\/RPCClient.h\"\n#include \"fnord-base\/cli\/flagparser.h\"\n#include \"fnord-json\/json.h\"\n#include \"fnord-json\/jsonrpc.h\"\n#include \"fnord-http\/httprouter.h\"\n#include \"fnord-http\/httpserver.h\"\n#include \"fnord-feeds\/FeedService.h\"\n#include \"fnord-feeds\/RemoteFeedFactory.h\"\n#include \"fnord-feeds\/RemoteFeedReader.h\"\n#include \"fnord-base\/stats\/statsdagent.h\"\n#include \"fnord-sstable\/SSTableServlet.h\"\n#include \"fnord-mdb\/MDB.h\"\n#include \"fnord-mdb\/MDBUtil.h\"\n#include \"common.h\"\n#include \"CustomerNamespace.h\"\n#include \"FeatureSchema.h\"\n#include \"JoinedQuery.h\"\n\nusing namespace fnord;\n\nint main(int argc, const char** argv) {\n fnord::Application::init();\n fnord::Application::logToStderr();\n\n fnord::cli::FlagParser flags;\n\n flags.defineFlag(\n \"http_port\",\n fnord::cli::FlagParser::T_INTEGER,\n false,\n NULL,\n \"8000\",\n \"Start the public http server on this port\",\n \"<port>\");\n\n flags.defineFlag(\n \"report_path\",\n cli::FlagParser::T_STRING,\n true,\n NULL,\n NULL,\n \"report path\",\n \"<path>\");\n\n flags.defineFlag(\n \"loglevel\",\n fnord::cli::FlagParser::T_STRING,\n false,\n NULL,\n \"INFO\",\n \"loglevel\",\n \"<level>\");\n\n flags.parseArgv(argc, argv);\n\n Logger::get()->setMinimumLogLevel(\n strToLogLevel(flags.getString(\"loglevel\")));\n\n WhitelistVFS vfs;\n\n \/* start http server *\/\n fnord::thread::EventLoop ev;\n fnord::http::HTTPRouter http_router;\n fnord::http::HTTPServer http_server(&http_router, &ev);\n http_server.listen(flags.getInt(\"http_port\"));\n\n \/* sstable servlet *\/\n sstable::SSTableServlet sstable_servlet(\"\/sstable\", &vfs);\n http_router.addRouteByPrefixMatch(\"\/sstable\", &sstable_servlet);\n\n \/* add all files to whitelist vfs *\/\n auto report_path = flags.getString(\"report_path\");\n FileUtil::ls(report_path, [&vfs, &report_path] (const String& file) -> bool {\n vfs.registerFile(file, FileUtil::joinPaths(report_path, file));\n fnord::logInfo(\"cm.reportserver\", \"[VFS] Adding file: $0\", file);\n return true;\n });\n\n ev.run();\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"wsdlmessage.h\"\n\nWSDLMessage::WSDLMessage(xmlNodePtr node)\n{\n\tLoad(node);\n}\n\nWSDLMessage::~WSDLMessage()\n{\n\tfor(map<string, WSDLMessagePart *>::iterator i = mParts.begin(); i != mParts.end(); i++) {\n\t\tdelete i->second;\n\t}\n}\n\nstring WSDLMessage::get_Name() const\n{\n\treturn mName;\n}\n\nvector<string> WSDLMessage::get_PartNames()\n{\n\tvector<string> retval;\n\n\tfor(map<string, WSDLMessagePart *>::iterator i = mParts.begin(); i != mParts.end(); i++) {\n\t\tretval.push_back(i->first);\n\t}\n\n\treturn retval;\n}\n\nWSDLMessagePart &WSDLMessage::get_Part(string name) const\n{\n\treturn *(const_cast<WSDLMessage *>(this)->mParts[name]);\n}\n\nvoid WSDLMessage::Load(xmlNodePtr node)\n{\n\txmlChar *name = xmlGetProp(node, (const xmlChar *)\"name\");\n\tif(name != nullptr) {\n\t\tmName = (char *)name;\n\t\txmlFree(name);\n\t\tLoadParts(node);\n\t}\n}\n\nvoid WSDLMessage::LoadParts(xmlNodePtr node)\n{\n\tfor(xmlNode *cur_node = node->children; cur_node != nullptr; cur_node = cur_node->next) {\n\t\tif(cur_node->type == XML_ELEMENT_NODE && !xmlStrcmp(cur_node->name, (const xmlChar *)\"part\")) {\n\t\t\tWSDLMessagePart *part = new WSDLMessagePart(cur_node);\n\t\t\tif(part != nullptr) {\n\t\t\t\tif(part->get_Name().length() > 0) {\n\t\t\t\t\tmParts[part->get_Name()] = part;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdelete part;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n<commit_msg>Fixed several lint errors<commit_after>#include \"lib\/wsdl\/wsdlmessage.h\"\n\n#include <map>\n#include <string>\n#include <vector>\n\nWSDLMessage::WSDLMessage(xmlNodePtr node) {\n Load(node);\n}\n\nWSDLMessage::~WSDLMessage() {\n for (::std::map<::std::string, WSDLMessagePart *>::iterator\n i = mParts.begin(); i != mParts.end(); i++) {\n delete i->second;\n }\n}\n\n::std::string WSDLMessage::get_Name() const {\n return mName;\n}\n\n::std::vector<::std::string> WSDLMessage::get_PartNames() {\n ::std::vector<::std::string> retval;\n\n for (::std::map<::std::string, WSDLMessagePart *>::iterator\n i = mParts.begin(); i != mParts.end(); i++) {\n retval.push_back(i->first);\n }\n\n return retval;\n}\n\nWSDLMessagePart &WSDLMessage::get_Part(::std::string name) const {\n return *(const_cast<WSDLMessage *>(this)->mParts[name]);\n}\n\nvoid WSDLMessage::Load(xmlNodePtr node) {\n xmlChar *name = xmlGetProp(node, (const xmlChar *)\"name\");\n if (name != nullptr) {\n mName = reinterpret_cast<char *>(name);\n xmlFree(name);\n LoadParts(node);\n }\n}\n\nvoid WSDLMessage::LoadParts(xmlNodePtr node) {\n for (xmlNode *cur_node = node->children; cur_node != nullptr;\n cur_node = cur_node->next) {\n if (cur_node->type == XML_ELEMENT_NODE &&\n !xmlStrcmp(cur_node->name, (const xmlChar *)\"part\")) {\n WSDLMessagePart *part = new WSDLMessagePart(cur_node);\n if (part != nullptr) {\n if (part->get_Name().length() > 0) {\n mParts[part->get_Name()] = part;\n } else {\n delete part;\n }\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>MUONdisplay (Int_t nevent=0) {\n\/\/ Dynamically link some shared libs\n if (gClassTable->GetID(\"AliRun\") < 0) {\n gROOT->LoadMacro(\"loadlibs.C\");\n loadlibs();\n \/*\n } else {\n delete gAlice;\n gAlice = 0;\n *\/\n }\n\n\/\/ Connect the Root Galice file containing Geometry, Kine and Hits\n TFile *file = (TFile*)gROOT->GetListOfFiles()->FindObject(\"galice.root\");\n if (!file) file = new TFile(\"galice.root\");\n\n\/\/ Get AliRun object from file or create it if not on file\n if (!gAlice) {\n gAlice = (AliRun*)file->Get(\"gAlice\");\n if (gAlice) printf(\"AliRun object found on file\\n\");\n if (!gAlice) gAlice = new AliRun(\"gAlice\",\"Alice test program\");\n }\n \n\/\/ Create Event Display object\n AliMUONDisplay *muondisplay = new AliMUONDisplay(750);\n\n\/\/ Display first event\n gAlice->GetEvent(nevent);\n muondisplay->ShowNextEvent(0);\n}\n<commit_msg>Add input file name as a parameter, default is galice.root<commit_after>MUONdisplay (Int_t nevent=0, TString fileName=\"galice.root\") {\n\/\/ Dynamically link some shared libs\n if (gClassTable->GetID(\"AliRun\") < 0) {\n gROOT->LoadMacro(\"loadlibs.C\");\n loadlibs();\n \/*\n } else {\n delete gAlice;\n gAlice = 0;\n *\/\n }\n\n\/\/ Connect the Root Galice file containing Geometry, Kine and Hits\n TFile *file = (TFile*)gROOT->GetListOfFiles()->FindObject(fileName);\n if (!file) file = new TFile(fileName);\n\n\/\/ Get AliRun object from file or create it if not on file\n if (!gAlice) {\n gAlice = (AliRun*)file->Get(\"gAlice\");\n if (gAlice) printf(\"AliRun object found on file\\n\");\n if (!gAlice) gAlice = new AliRun(\"gAlice\",\"Alice test program\");\n }\n \n\/\/ Create Event Display object\n AliMUONDisplay *muondisplay = new AliMUONDisplay(750);\n\n\/\/ Display first event\n gAlice->GetEvent(nevent);\n muondisplay->ShowNextEvent(0);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"media\/mojo\/services\/mojo_renderer_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/callback_helpers.h\"\n#include \"base\/location.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"media\/base\/bind_to_current_loop.h\"\n#include \"media\/base\/demuxer_stream_provider.h\"\n#include \"media\/mojo\/services\/mojo_demuxer_stream_impl.h\"\n#include \"mojo\/public\/cpp\/application\/connect.h\"\n#include \"mojo\/public\/cpp\/bindings\/interface_impl.h\"\n#include \"mojo\/public\/interfaces\/application\/service_provider.mojom.h\"\n\nnamespace media {\n\nMojoRendererImpl::MojoRendererImpl(\n const scoped_refptr<base::SingleThreadTaskRunner>& task_runner,\n mojo::MediaRendererPtr remote_media_renderer)\n : task_runner_(task_runner),\n remote_media_renderer_(remote_media_renderer.Pass()),\n weak_factory_(this) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(remote_media_renderer_);\n remote_media_renderer_.set_client(this);\n}\n\nMojoRendererImpl::~MojoRendererImpl() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n \/\/ Connection to |remote_media_renderer_| will error-out here.\n}\n\n\/\/ TODO(xhwang): Support |paint_cb| if needed.\nvoid MojoRendererImpl::Initialize(\n DemuxerStreamProvider* demuxer_stream_provider,\n const base::Closure& init_cb,\n const StatisticsCB& statistics_cb,\n const BufferingStateCB& buffering_state_cb,\n const PaintCB& \/* paint_cb *\/,\n const base::Closure& ended_cb,\n const PipelineStatusCB& error_cb) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(demuxer_stream_provider);\n\n demuxer_stream_provider_ = demuxer_stream_provider;\n \/\/ |init_cb| can be called on other thread.\n init_cb_ = init_cb;\n ended_cb_ = ended_cb;\n error_cb_ = error_cb;\n buffering_state_cb_ = buffering_state_cb;\n\n \/\/ Create audio and video mojo::DemuxerStream and bind its lifetime to the\n \/\/ pipe.\n DemuxerStream* const audio =\n demuxer_stream_provider_->GetStream(DemuxerStream::AUDIO);\n DemuxerStream* const video =\n demuxer_stream_provider_->GetStream(DemuxerStream::VIDEO);\n\n mojo::DemuxerStreamPtr audio_stream;\n if (audio) {\n mojo::BindToProxy(new MojoDemuxerStreamImpl(audio), &audio_stream)\n ->DidConnect();\n }\n\n mojo::DemuxerStreamPtr video_stream;\n if (video) {\n mojo::BindToProxy(new MojoDemuxerStreamImpl(video), &video_stream)\n ->DidConnect();\n }\n\n remote_media_renderer_->Initialize(\n audio_stream.Pass(),\n video_stream.Pass(),\n BindToCurrentLoop(base::Bind(&MojoRendererImpl::OnInitialized,\n weak_factory_.GetWeakPtr())));\n}\n\nvoid MojoRendererImpl::SetCdm(CdmContext* cdm_context,\n const CdmAttachedCB& cdm_attached_cb) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n NOTIMPLEMENTED();\n cdm_attached_cb.Run(false);\n}\n\nvoid MojoRendererImpl::Flush(const base::Closure& flush_cb) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->Flush(flush_cb);\n}\n\nvoid MojoRendererImpl::StartPlayingFrom(base::TimeDelta time) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n\n {\n base::AutoLock auto_lock(lock_);\n time_ = time;\n }\n\n remote_media_renderer_->StartPlayingFrom(time.InMicroseconds());\n}\n\nvoid MojoRendererImpl::SetPlaybackRate(float playback_rate) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->SetPlaybackRate(playback_rate);\n}\n\nvoid MojoRendererImpl::SetVolume(float volume) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->SetVolume(volume);\n}\n\nbase::TimeDelta MojoRendererImpl::GetMediaTime() {\n base::AutoLock auto_lock(lock_);\n DVLOG(3) << __FUNCTION__ << \": \" << time_.InMilliseconds() << \" ms\";\n return time_;\n}\n\nbool MojoRendererImpl::HasAudio() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(remote_media_renderer_.get()); \/\/ We always bind the renderer.\n return !!demuxer_stream_provider_->GetStream(DemuxerStream::AUDIO);\n}\n\nbool MojoRendererImpl::HasVideo() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n return !!demuxer_stream_provider_->GetStream(DemuxerStream::VIDEO);\n}\n\nvoid MojoRendererImpl::OnTimeUpdate(int64_t time_usec, int64_t max_time_usec) {\n DVLOG(3) << __FUNCTION__ << \": \" << time_usec << \", \" << max_time_usec;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(FROM_HERE,\n base::Bind(&MojoRendererImpl::OnTimeUpdate,\n weak_factory_.GetWeakPtr(),\n time_usec,\n max_time_usec));\n return;\n }\n\n base::AutoLock auto_lock(lock_);\n time_ = base::TimeDelta::FromMicroseconds(time_usec);\n max_time_ = base::TimeDelta::FromMicroseconds(max_time_usec);\n}\n\nvoid MojoRendererImpl::OnBufferingStateChange(mojo::BufferingState state) {\n DVLOG(2) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(FROM_HERE,\n base::Bind(&MojoRendererImpl::OnBufferingStateChange,\n weak_factory_.GetWeakPtr(),\n state));\n return;\n }\n\n buffering_state_cb_.Run(static_cast<media::BufferingState>(state));\n}\n\nvoid MojoRendererImpl::OnEnded() {\n DVLOG(1) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(\n FROM_HERE,\n base::Bind(&MojoRendererImpl::OnEnded, weak_factory_.GetWeakPtr()));\n return;\n }\n\n base::ResetAndReturn(&ended_cb_).Run();\n}\n\nvoid MojoRendererImpl::OnError() {\n DVLOG(1) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(\n FROM_HERE,\n base::Bind(&MojoRendererImpl::OnError, weak_factory_.GetWeakPtr()));\n return;\n }\n\n \/\/ TODO(tim): Should we plumb error code from remote renderer?\n \/\/ http:\/\/crbug.com\/410451.\n if (init_cb_.is_null()) \/\/ We have initialized already.\n error_cb_.Run(PIPELINE_ERROR_DECODE);\n else\n error_cb_.Run(PIPELINE_ERROR_COULD_NOT_RENDER);\n}\n\nvoid MojoRendererImpl::OnInitialized() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(!init_cb_.is_null());\n\n base::ResetAndReturn(&init_cb_).Run();\n}\n\n} \/\/ namespace media\n<commit_msg>Don't reset ended_cb_ after ending in the MojoRendererImpl.<commit_after>\/\/ Copyright 2014 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"media\/mojo\/services\/mojo_renderer_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/callback_helpers.h\"\n#include \"base\/location.h\"\n#include \"base\/single_thread_task_runner.h\"\n#include \"media\/base\/bind_to_current_loop.h\"\n#include \"media\/base\/demuxer_stream_provider.h\"\n#include \"media\/mojo\/services\/mojo_demuxer_stream_impl.h\"\n#include \"mojo\/public\/cpp\/application\/connect.h\"\n#include \"mojo\/public\/cpp\/bindings\/interface_impl.h\"\n#include \"mojo\/public\/interfaces\/application\/service_provider.mojom.h\"\n\nnamespace media {\n\nMojoRendererImpl::MojoRendererImpl(\n const scoped_refptr<base::SingleThreadTaskRunner>& task_runner,\n mojo::MediaRendererPtr remote_media_renderer)\n : task_runner_(task_runner),\n remote_media_renderer_(remote_media_renderer.Pass()),\n weak_factory_(this) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(remote_media_renderer_);\n remote_media_renderer_.set_client(this);\n}\n\nMojoRendererImpl::~MojoRendererImpl() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n \/\/ Connection to |remote_media_renderer_| will error-out here.\n}\n\n\/\/ TODO(xhwang): Support |paint_cb| if needed.\nvoid MojoRendererImpl::Initialize(\n DemuxerStreamProvider* demuxer_stream_provider,\n const base::Closure& init_cb,\n const StatisticsCB& statistics_cb,\n const BufferingStateCB& buffering_state_cb,\n const PaintCB& \/* paint_cb *\/,\n const base::Closure& ended_cb,\n const PipelineStatusCB& error_cb) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(demuxer_stream_provider);\n\n demuxer_stream_provider_ = demuxer_stream_provider;\n \/\/ |init_cb| can be called on other thread.\n init_cb_ = init_cb;\n ended_cb_ = ended_cb;\n error_cb_ = error_cb;\n buffering_state_cb_ = buffering_state_cb;\n\n \/\/ Create audio and video mojo::DemuxerStream and bind its lifetime to the\n \/\/ pipe.\n DemuxerStream* const audio =\n demuxer_stream_provider_->GetStream(DemuxerStream::AUDIO);\n DemuxerStream* const video =\n demuxer_stream_provider_->GetStream(DemuxerStream::VIDEO);\n\n mojo::DemuxerStreamPtr audio_stream;\n if (audio) {\n mojo::BindToProxy(new MojoDemuxerStreamImpl(audio), &audio_stream)\n ->DidConnect();\n }\n\n mojo::DemuxerStreamPtr video_stream;\n if (video) {\n mojo::BindToProxy(new MojoDemuxerStreamImpl(video), &video_stream)\n ->DidConnect();\n }\n\n remote_media_renderer_->Initialize(\n audio_stream.Pass(),\n video_stream.Pass(),\n BindToCurrentLoop(base::Bind(&MojoRendererImpl::OnInitialized,\n weak_factory_.GetWeakPtr())));\n}\n\nvoid MojoRendererImpl::SetCdm(CdmContext* cdm_context,\n const CdmAttachedCB& cdm_attached_cb) {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n NOTIMPLEMENTED();\n cdm_attached_cb.Run(false);\n}\n\nvoid MojoRendererImpl::Flush(const base::Closure& flush_cb) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->Flush(flush_cb);\n}\n\nvoid MojoRendererImpl::StartPlayingFrom(base::TimeDelta time) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n\n {\n base::AutoLock auto_lock(lock_);\n time_ = time;\n }\n\n remote_media_renderer_->StartPlayingFrom(time.InMicroseconds());\n}\n\nvoid MojoRendererImpl::SetPlaybackRate(float playback_rate) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->SetPlaybackRate(playback_rate);\n}\n\nvoid MojoRendererImpl::SetVolume(float volume) {\n DVLOG(2) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n remote_media_renderer_->SetVolume(volume);\n}\n\nbase::TimeDelta MojoRendererImpl::GetMediaTime() {\n base::AutoLock auto_lock(lock_);\n DVLOG(3) << __FUNCTION__ << \": \" << time_.InMilliseconds() << \" ms\";\n return time_;\n}\n\nbool MojoRendererImpl::HasAudio() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(remote_media_renderer_.get()); \/\/ We always bind the renderer.\n return !!demuxer_stream_provider_->GetStream(DemuxerStream::AUDIO);\n}\n\nbool MojoRendererImpl::HasVideo() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n return !!demuxer_stream_provider_->GetStream(DemuxerStream::VIDEO);\n}\n\nvoid MojoRendererImpl::OnTimeUpdate(int64_t time_usec, int64_t max_time_usec) {\n DVLOG(3) << __FUNCTION__ << \": \" << time_usec << \", \" << max_time_usec;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(FROM_HERE,\n base::Bind(&MojoRendererImpl::OnTimeUpdate,\n weak_factory_.GetWeakPtr(),\n time_usec,\n max_time_usec));\n return;\n }\n\n base::AutoLock auto_lock(lock_);\n time_ = base::TimeDelta::FromMicroseconds(time_usec);\n max_time_ = base::TimeDelta::FromMicroseconds(max_time_usec);\n}\n\nvoid MojoRendererImpl::OnBufferingStateChange(mojo::BufferingState state) {\n DVLOG(2) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(FROM_HERE,\n base::Bind(&MojoRendererImpl::OnBufferingStateChange,\n weak_factory_.GetWeakPtr(),\n state));\n return;\n }\n\n buffering_state_cb_.Run(static_cast<media::BufferingState>(state));\n}\n\nvoid MojoRendererImpl::OnEnded() {\n DVLOG(1) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(\n FROM_HERE,\n base::Bind(&MojoRendererImpl::OnEnded, weak_factory_.GetWeakPtr()));\n return;\n }\n\n ended_cb_.Run();\n}\n\nvoid MojoRendererImpl::OnError() {\n DVLOG(1) << __FUNCTION__;\n\n if (!task_runner_->BelongsToCurrentThread()) {\n task_runner_->PostTask(\n FROM_HERE,\n base::Bind(&MojoRendererImpl::OnError, weak_factory_.GetWeakPtr()));\n return;\n }\n\n \/\/ TODO(tim): Should we plumb error code from remote renderer?\n \/\/ http:\/\/crbug.com\/410451.\n if (init_cb_.is_null()) \/\/ We have initialized already.\n error_cb_.Run(PIPELINE_ERROR_DECODE);\n else\n error_cb_.Run(PIPELINE_ERROR_COULD_NOT_RENDER);\n}\n\nvoid MojoRendererImpl::OnInitialized() {\n DVLOG(1) << __FUNCTION__;\n DCHECK(task_runner_->BelongsToCurrentThread());\n DCHECK(!init_cb_.is_null());\n\n base::ResetAndReturn(&init_cb_).Run();\n}\n\n} \/\/ namespace media\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (c) 2007 Cyrus Daboo. All rights reserved.\n \n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n \n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"CTimezonePopup.h\"\n\n#include \"CPreferences.h\"\n#include \"CTextListChoice.h\"\n\n#include \"MyCFString.h\"\n\n#include \"CICalendar.h\"\n#include \"CICalendarManager.h\"\n\n\/\/ ---------------------------------------------------------------------------\n\/\/\tCTimezonePopup\t\t\t\t\t\t\t\t\t\t\t\t\t\t [public]\n\/**\n\tDefault constructor *\/\n\nCTimezonePopup::CTimezonePopup(LStream* inStream) :\n\tLPopupButton(inStream)\n{\n\tmNoFloating = false;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/\t~CTimezonePopup\t\t\t\t\t\t\t\t\t\t\t\t\t\t [public]\n\/**\n\tDestructor *\/\n\nCTimezonePopup::~CTimezonePopup()\n{\n}\n\n#pragma mark -\n\nvoid CTimezonePopup::FinishCreateSelf()\n{\n\t\/\/ Init the popup menu\n\n\t\/\/ Always start with the current user default\n\tSetTimezone(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezone());\n}\n\nvoid CTimezonePopup::Reset(const iCal::CICalendarTimezone& tz)\n{\n\t\/\/ Get the set of favorite timezones and always include the default\n\tcdstrvect tzids;\n\tcdstrset menutzids(CPreferences::sPrefs->mFavouriteTimezones.GetValue());\n\tmenutzids.insert(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezoneID());\n\tmenutzids.insert(tz.GetTimezoneID());\n\tfor(cdstrset::const_iterator iter = menutzids.begin(); iter != menutzids.end(); iter++)\n\t\ttzids.push_back(*iter);\n\t\n\t\/\/ Sort list of favorite timezones\n\tiCal::CICalendar::getSICalendar().SortTimezones(tzids);\n\t\n\t\/\/ Clear existing menu\n\tSInt32 adjusted_separator = eSeparator - (mNoFloating ? 1 : 0);\n\tSInt32 adjusted_first = eFirstTimezone - (mNoFloating ? 1 : 0);\n\tMenuRef menu = GetMacMenuH();\n\tif (::CountMenuItems(menu) > adjusted_separator)\n\t\t::DeleteMenuItems(menu, adjusted_first, ::CountMenuItems(menu) - adjusted_separator);\n\t\n\t\/\/ Add to menu\n\tfor(cdstrvect::const_iterator iter = tzids.begin(); iter != tzids.end(); iter++)\n\t{\n\t\t\/\/ Make a CFString from UTF8 data\n\t\tMyCFString menu_title((*iter).c_str(), kCFStringEncodingUTF8);\n\t\t::AppendMenuItemTextWithCFString(menu, menu_title, 0, 0, NULL);\n\t}\n\t\n\t\/\/ Readjust max\n\tSetMaxValue(::CountMenuItems(menu));\n}\n\nvoid CTimezonePopup::NoFloating()\n{\n\t\/\/ Remove first menu item\n\tMenuRef menu = GetMacMenuH();\n\t::DeleteMenuItems(menu, eNoTimezone, 1);\n\tmNoFloating = true;\n\t\n\t\/\/ Always start with the current user default\n\tSetTimezone(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezone());\n}\n\nvoid CTimezonePopup::SetTimezone(const iCal::CICalendarTimezone& tz)\n{\n\tReset(tz);\n\n\t\/\/ Extract zone from dt and apply to menu\n\tSInt32 new_value;\n\tif (tz.GetUTC())\n\t{\n\t\tnew_value = eUTC - (mNoFloating ? 1 : 0);\n\t}\n\telse\n\t{\n\t\t\/\/ Always set no timezone (or UTC when floating) so that if named timezone is not found we have a default\n\t\tnew_value = eNoTimezone;\n\n\t\tcdstring tzid(tz.GetTimezoneID());\n\t\tif (!tzid.empty())\n\t\t{\n\t\t\t\/\/ Start with no timezone in \n\t\t\t\/\/ Scan menu looking for match\n\t\t\tMenuRef menu = GetMacMenuH();\n\t\t\tMyCFString comp(tzid.c_str(), kCFStringEncodingUTF8);\n\t\t\tfor(UInt32 i = eFirstTimezone - (mNoFloating ? 1 : 0); i <= ::CountMenuItems(menu); i++)\n\t\t\t{\n\t\t\t\t\/\/ Get name of menu title\n\t\t\t\tCFStringRef txt;\n\t\t\t\t::CopyMenuItemTextAsCFString(menu, i, &txt);\n\t\t\t\tMyCFString temp(txt, false);\n\t\t\t\t\n\t\t\t\t\/\/ Compare with tzid\n\t\t\t\tif (comp.CompareTo(temp, kCFCompareCaseInsensitive) == kCFCompareEqualTo)\n\t\t\t\t{\n\t\t\t\t\tnew_value = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ Set value only if different\n\tif (new_value != GetValue())\n\t{\n\t\tSetValue(new_value);\n\t\tmOldValue = new_value;\n\t}\n}\n\nvoid CTimezonePopup::GetTimezone(iCal::CICalendarTimezone& tz) const\n{\n\tSInt32 value = GetValue();\n\tSInt32 adjusted_value = value + (mNoFloating ? 1 : 0);\n\ttz.SetUTC(adjusted_value == eUTC);\n\tif ((adjusted_value == eNoTimezone) || (adjusted_value == eUTC))\n\t{\n\t\tcdstring empty;\n\t\ttz.SetTimezoneID(empty);\n\t}\n\telse if (adjusted_value == eOther)\n\t{\n\t\tcdstrvect tzids;\n\t\tiCal::CICalendar::sICalendar.GetTimezones(tzids);\n\t\tstd::sort(tzids.begin(), tzids.end());\n\t\t\n\t\tulvector selected;\n\t\tif (CTextListChoice::PoseDialog(\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Title\",\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Description\",\n\t\t\tNULL, false, true, false, true, tzids, cdstring::null_str, selected,\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Button\"))\n\t\t{\n\t\t\t\/\/ Get selection from list\n\t\t\tcdstring tzid = tzids.at(selected.front());\n\t\t\ttz.SetTimezoneID(tzid);\n\t\t\tCPreferences::sPrefs->mFavouriteTimezones.Value().insert(tzid);\n\t\t\tconst_cast<CTimezonePopup*>(this)->Reset(iCal::CICalendar::getSICalendar().GetTimezone(tzid));\n\t\t\tconst_cast<CTimezonePopup*>(this)->SetTimezone(iCal::CICalendar::getSICalendar().GetTimezone(tzid));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst_cast<CTimezonePopup*>(this)->SetValue(mOldValue);\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ Get name of menu title\n\t\tCFStringRef txt;\n\t\t::CopyMenuItemTextAsCFString(GetMacMenuH(), value, &txt);\n\t\tMyCFString temp(txt, false);\n\n\t\tcdstring tzid = temp.GetString();\n\n\t\ttz.SetTimezoneID(tzid);\n\t\tmOldValue = value;\n\t}\n}\n<commit_msg>Replaced static CICalendar::sICalendar variable by a static method (part 2, forgotten file).<commit_after>\/*\n Copyright (c) 2007 Cyrus Daboo. All rights reserved.\n \n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n \n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n \n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n*\/\n\n#include \"CTimezonePopup.h\"\n\n#include \"CPreferences.h\"\n#include \"CTextListChoice.h\"\n\n#include \"MyCFString.h\"\n\n#include \"CICalendar.h\"\n#include \"CICalendarManager.h\"\n\n\/\/ ---------------------------------------------------------------------------\n\/\/\tCTimezonePopup\t\t\t\t\t\t\t\t\t\t\t\t\t\t [public]\n\/**\n\tDefault constructor *\/\n\nCTimezonePopup::CTimezonePopup(LStream* inStream) :\n\tLPopupButton(inStream)\n{\n\tmNoFloating = false;\n}\n\n\n\/\/ ---------------------------------------------------------------------------\n\/\/\t~CTimezonePopup\t\t\t\t\t\t\t\t\t\t\t\t\t\t [public]\n\/**\n\tDestructor *\/\n\nCTimezonePopup::~CTimezonePopup()\n{\n}\n\n#pragma mark -\n\nvoid CTimezonePopup::FinishCreateSelf()\n{\n\t\/\/ Init the popup menu\n\n\t\/\/ Always start with the current user default\n\tSetTimezone(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezone());\n}\n\nvoid CTimezonePopup::Reset(const iCal::CICalendarTimezone& tz)\n{\n\t\/\/ Get the set of favorite timezones and always include the default\n\tcdstrvect tzids;\n\tcdstrset menutzids(CPreferences::sPrefs->mFavouriteTimezones.GetValue());\n\tmenutzids.insert(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezoneID());\n\tmenutzids.insert(tz.GetTimezoneID());\n\tfor(cdstrset::const_iterator iter = menutzids.begin(); iter != menutzids.end(); iter++)\n\t\ttzids.push_back(*iter);\n\t\n\t\/\/ Sort list of favorite timezones\n\tiCal::CICalendar::getSICalendar().SortTimezones(tzids);\n\t\n\t\/\/ Clear existing menu\n\tSInt32 adjusted_separator = eSeparator - (mNoFloating ? 1 : 0);\n\tSInt32 adjusted_first = eFirstTimezone - (mNoFloating ? 1 : 0);\n\tMenuRef menu = GetMacMenuH();\n\tif (::CountMenuItems(menu) > adjusted_separator)\n\t\t::DeleteMenuItems(menu, adjusted_first, ::CountMenuItems(menu) - adjusted_separator);\n\t\n\t\/\/ Add to menu\n\tfor(cdstrvect::const_iterator iter = tzids.begin(); iter != tzids.end(); iter++)\n\t{\n\t\t\/\/ Make a CFString from UTF8 data\n\t\tMyCFString menu_title((*iter).c_str(), kCFStringEncodingUTF8);\n\t\t::AppendMenuItemTextWithCFString(menu, menu_title, 0, 0, NULL);\n\t}\n\t\n\t\/\/ Readjust max\n\tSetMaxValue(::CountMenuItems(menu));\n}\n\nvoid CTimezonePopup::NoFloating()\n{\n\t\/\/ Remove first menu item\n\tMenuRef menu = GetMacMenuH();\n\t::DeleteMenuItems(menu, eNoTimezone, 1);\n\tmNoFloating = true;\n\t\n\t\/\/ Always start with the current user default\n\tSetTimezone(iCal::CICalendarManager::sICalendarManager->GetDefaultTimezone());\n}\n\nvoid CTimezonePopup::SetTimezone(const iCal::CICalendarTimezone& tz)\n{\n\tReset(tz);\n\n\t\/\/ Extract zone from dt and apply to menu\n\tSInt32 new_value;\n\tif (tz.GetUTC())\n\t{\n\t\tnew_value = eUTC - (mNoFloating ? 1 : 0);\n\t}\n\telse\n\t{\n\t\t\/\/ Always set no timezone (or UTC when floating) so that if named timezone is not found we have a default\n\t\tnew_value = eNoTimezone;\n\n\t\tcdstring tzid(tz.GetTimezoneID());\n\t\tif (!tzid.empty())\n\t\t{\n\t\t\t\/\/ Start with no timezone in \n\t\t\t\/\/ Scan menu looking for match\n\t\t\tMenuRef menu = GetMacMenuH();\n\t\t\tMyCFString comp(tzid.c_str(), kCFStringEncodingUTF8);\n\t\t\tfor(UInt32 i = eFirstTimezone - (mNoFloating ? 1 : 0); i <= ::CountMenuItems(menu); i++)\n\t\t\t{\n\t\t\t\t\/\/ Get name of menu title\n\t\t\t\tCFStringRef txt;\n\t\t\t\t::CopyMenuItemTextAsCFString(menu, i, &txt);\n\t\t\t\tMyCFString temp(txt, false);\n\t\t\t\t\n\t\t\t\t\/\/ Compare with tzid\n\t\t\t\tif (comp.CompareTo(temp, kCFCompareCaseInsensitive) == kCFCompareEqualTo)\n\t\t\t\t{\n\t\t\t\t\tnew_value = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ Set value only if different\n\tif (new_value != GetValue())\n\t{\n\t\tSetValue(new_value);\n\t\tmOldValue = new_value;\n\t}\n}\n\nvoid CTimezonePopup::GetTimezone(iCal::CICalendarTimezone& tz) const\n{\n\tSInt32 value = GetValue();\n\tSInt32 adjusted_value = value + (mNoFloating ? 1 : 0);\n\ttz.SetUTC(adjusted_value == eUTC);\n\tif ((adjusted_value == eNoTimezone) || (adjusted_value == eUTC))\n\t{\n\t\tcdstring empty;\n\t\ttz.SetTimezoneID(empty);\n\t}\n\telse if (adjusted_value == eOther)\n\t{\n\t\tcdstrvect tzids;\n\t\tiCal::CICalendar::getSICalendar().GetTimezones(tzids);\n\t\tstd::sort(tzids.begin(), tzids.end());\n\t\t\n\t\tulvector selected;\n\t\tif (CTextListChoice::PoseDialog(\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Title\",\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Description\",\n\t\t\tNULL, false, true, false, true, tzids, cdstring::null_str, selected,\n\t\t\t\"Alerts::Calendar::TimezoneChoice::Button\"))\n\t\t{\n\t\t\t\/\/ Get selection from list\n\t\t\tcdstring tzid = tzids.at(selected.front());\n\t\t\ttz.SetTimezoneID(tzid);\n\t\t\tCPreferences::sPrefs->mFavouriteTimezones.Value().insert(tzid);\n\t\t\tconst_cast<CTimezonePopup*>(this)->Reset(iCal::CICalendar::getSICalendar().GetTimezone(tzid));\n\t\t\tconst_cast<CTimezonePopup*>(this)->SetTimezone(iCal::CICalendar::getSICalendar().GetTimezone(tzid));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tconst_cast<CTimezonePopup*>(this)->SetValue(mOldValue);\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/\/ Get name of menu title\n\t\tCFStringRef txt;\n\t\t::CopyMenuItemTextAsCFString(GetMacMenuH(), value, &txt);\n\t\tMyCFString temp(txt, false);\n\n\t\tcdstring tzid = temp.GetString();\n\n\t\ttz.SetTimezoneID(tzid);\n\t\tmOldValue = value;\n\t}\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright 2014 Open Connectome Project (http:\/\/openconnecto.me)\n * Written by Da Zheng (zhengda1936@gmail.com)\n *\n * This file is part of libcommon.\n * This library is used by SAFS and FlashGraph, and potentially by other\n * systems.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#include \"config_map.h\"\n\nstatic bool read_config_file(const std::string &conf_file,\n\t\tstd::map<std::string, std::string> &configs)\n{\n\tFILE *f = fopen(conf_file.c_str(), \"r\");\n\tif (f == NULL) {\n\t\tperror(\"fopen\");\n\t\treturn false;\n\t}\n\n\tchar *line = NULL;\n\tsize_t len = 0;\n\tssize_t read;\n\twhile ((read = getline(&line, &len, f)) > 0) {\n\t\tstd::string str = line;\n\t\tif (str.length() == 1)\n\t\t\tcontinue;\n\t\tif (line[0] == '#')\n\t\t\tcontinue;\n\n\t\tsize_t found = str.find(\"=\");\n\t\t\/* if there isn't `=', I assume it's a file name*\/\n\t\tif (found == std::string::npos) {\n\t\t\tfprintf(stderr, \"wrong format: %s\\n\", line);\n\t\t\tassert(0);\n\t\t}\n\n\t\tstd::string value = str.substr(found + 1);\n\t\tvalue.erase(std::remove_if(value.begin(), value.end(), isspace),\n\t\t\t\tvalue.end());\n\t\tstd::string key = str.substr(0, found);\n\t\tkey.erase(std::remove_if(key.begin(), key.end(), isspace),\n\t\t\t\tkey.end());\n\t\tbool res = configs.insert(std::pair<std::string, std::string>(key,\n\t\t\t\t\tvalue)).second;\n\t\tif (!res)\n\t\t\tconfigs[key] = value;\n\t}\n\tfclose(f);\n\treturn true;\n}\n\nconfig_map::ptr config_map::create(const std::string &conf_file)\n{\n\tconfig_map::ptr map = config_map::create();\n\t\/\/ If we can't read the config file, return an empty pointer.\n\tif (!read_config_file(conf_file, map->configs))\n\t\treturn config_map::ptr(NULL);\n\telse\n\t\treturn map;\n}\n\n\/**\n * All options should have the following format:\n *\t\tkey=value.\n * All options that don't have the format are ignored.\n *\/\nvoid config_map::add_options(const char *argv[], int argc)\n{\n\tfor (int i = 0; i < argc; i++) {\n\t\tstd::string str = argv[i];\n\n\t\tsize_t found = str.find(\"=\");\n\t\tif (found == std::string::npos) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tstd::string value = str.substr(found + 1);\n\t\tvalue.erase(std::remove_if(value.begin(), value.end(), isspace),\n\t\t\t\tvalue.end());\n\t\tstd::string key = str.substr(0, found);\n\t\tkey.erase(std::remove_if(key.begin(), key.end(), isspace),\n\t\t\t\tkey.end());\n\t\tbool res = configs.insert(std::pair<std::string, std::string>(key,\n\t\t\t\t\tvalue)).second;\n\t\tif (!res)\n\t\t\tconfigs[key] = value;\n\t}\n}\n\nsize_t split_string(const std::string &str, const std::string &delimiter,\n\t\tstd::vector<std::string> &splits)\n{\n\tstd::stringstream ss(str);\n\tsize_t num = 0;\n\twhile (ss.good()) {\n\t\tstd::string s;\n\t\tss >> s;\n\t\tsplits.push_back(s);\n\t\tnum++;\n\t}\n\treturn num;\n}\n\nvoid config_map::add_options(const std::string &opts)\n{\n\tstd::vector<std::string> parts;\n\tsplit_string(opts, \" \", parts);\n\tstd::vector<const char *> part_chars;\n\tfor (size_t i = 0; i < parts.size(); i++) {\n\t\tpart_chars.push_back(parts[i].c_str());\n\t}\n\tconfig_map::add_options(part_chars.data(), part_chars.size());\n}\n<commit_msg>[Common]: replace assert(0) with ABORT_MSG.<commit_after>\/**\n * Copyright 2014 Open Connectome Project (http:\/\/openconnecto.me)\n * Written by Da Zheng (zhengda1936@gmail.com)\n *\n * This file is part of libcommon.\n * This library is used by SAFS and FlashGraph, and potentially by other\n * systems.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include <algorithm>\n#include <iostream>\n#include <sstream>\n\n#include \"common.h\"\n#include \"config_map.h\"\n\nstatic bool read_config_file(const std::string &conf_file,\n\t\tstd::map<std::string, std::string> &configs)\n{\n\tFILE *f = fopen(conf_file.c_str(), \"r\");\n\tif (f == NULL) {\n\t\tperror(\"fopen\");\n\t\treturn false;\n\t}\n\n\tchar *line = NULL;\n\tsize_t len = 0;\n\tssize_t read;\n\twhile ((read = getline(&line, &len, f)) > 0) {\n\t\tstd::string str = line;\n\t\tif (str.length() == 1)\n\t\t\tcontinue;\n\t\tif (line[0] == '#')\n\t\t\tcontinue;\n\n\t\tsize_t found = str.find(\"=\");\n\t\t\/* if there isn't `=', I assume it's a file name*\/\n\t\tif (found == std::string::npos) {\n\t\t\tABORT_MSG(std::string(\"wrong format: \") + line);\n\t\t}\n\n\t\tstd::string value = str.substr(found + 1);\n\t\tvalue.erase(std::remove_if(value.begin(), value.end(), isspace),\n\t\t\t\tvalue.end());\n\t\tstd::string key = str.substr(0, found);\n\t\tkey.erase(std::remove_if(key.begin(), key.end(), isspace),\n\t\t\t\tkey.end());\n\t\tbool res = configs.insert(std::pair<std::string, std::string>(key,\n\t\t\t\t\tvalue)).second;\n\t\tif (!res)\n\t\t\tconfigs[key] = value;\n\t}\n\tfclose(f);\n\treturn true;\n}\n\nconfig_map::ptr config_map::create(const std::string &conf_file)\n{\n\tconfig_map::ptr map = config_map::create();\n\t\/\/ If we can't read the config file, return an empty pointer.\n\tif (!read_config_file(conf_file, map->configs))\n\t\treturn config_map::ptr(NULL);\n\telse\n\t\treturn map;\n}\n\n\/**\n * All options should have the following format:\n *\t\tkey=value.\n * All options that don't have the format are ignored.\n *\/\nvoid config_map::add_options(const char *argv[], int argc)\n{\n\tfor (int i = 0; i < argc; i++) {\n\t\tstd::string str = argv[i];\n\n\t\tsize_t found = str.find(\"=\");\n\t\tif (found == std::string::npos) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tstd::string value = str.substr(found + 1);\n\t\tvalue.erase(std::remove_if(value.begin(), value.end(), isspace),\n\t\t\t\tvalue.end());\n\t\tstd::string key = str.substr(0, found);\n\t\tkey.erase(std::remove_if(key.begin(), key.end(), isspace),\n\t\t\t\tkey.end());\n\t\tbool res = configs.insert(std::pair<std::string, std::string>(key,\n\t\t\t\t\tvalue)).second;\n\t\tif (!res)\n\t\t\tconfigs[key] = value;\n\t}\n}\n\nsize_t split_string(const std::string &str, const std::string &delimiter,\n\t\tstd::vector<std::string> &splits)\n{\n\tstd::stringstream ss(str);\n\tsize_t num = 0;\n\twhile (ss.good()) {\n\t\tstd::string s;\n\t\tss >> s;\n\t\tsplits.push_back(s);\n\t\tnum++;\n\t}\n\treturn num;\n}\n\nvoid config_map::add_options(const std::string &opts)\n{\n\tstd::vector<std::string> parts;\n\tsplit_string(opts, \" \", parts);\n\tstd::vector<const char *> part_chars;\n\tfor (size_t i = 0; i < parts.size(); i++) {\n\t\tpart_chars.push_back(parts[i].c_str());\n\t}\n\tconfig_map::add_options(part_chars.data(), part_chars.size());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*===================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center,\nDivision of Medical and Biological Informatics.\nAll rights reserved.\n\nThis software is distributed WITHOUT ANY WARRANTY; without\neven the implied warranty of MERCHANTABILITY or FITNESS FOR\nA PARTICULAR PURPOSE.\n\nSee LICENSE.txt or http:\/\/www.mitk.org for details.\n\n===================================================================*\/\n\n#include \"mitkNavigationDataToPointSetFilter.h\"\n#include \"mitkNavigationDataSequentialPlayer.h\"\n#include \"mitkNavigationDataReaderXML.h\"\n#include <mitkIGTConfig.h>\n#include <mitkTestingMacros.h>\n\n#include <iostream>\n\n\/**\n* Simple example for a test for the (non-existent) class \"NavigationDataToPointSetFilter\".\n*\n* argc and argv are the command line parameters which were passed to\n* the ADD_TEST command in the CMakeLists.txt file. For the automatic\n* tests, argv is either empty for the simple tests or contains the filename\n* of a test image for the image tests (see CMakeLists.txt).\n*\/\n\nmitk::NavigationDataToPointSetFilter::Pointer m_NavigationDataToPointSetFilter;\n\nstatic void Setup()\n{\n m_NavigationDataToPointSetFilter = mitk::NavigationDataToPointSetFilter::New();\n}\n\nstatic void TestMode3D()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode3D);\n\n \/\/Build up test data\n mitk::NavigationData::Pointer nd0 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd1 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd3 = mitk::NavigationData::New();\n\n mitk::NavigationData::PositionType point0;\n point0[0] = 1.0;\n point0[1] = 2.0;\n point0[2] = 3.0;\n nd0->SetPosition(point0);\n nd0->SetDataValid(true);\n\n mitk::NavigationData::PositionType point1;\n point1[0] = 4.0;\n point1[1] = 5.0;\n point1[2] = 6.0;\n nd1->SetPosition(point1);\n nd1->SetDataValid(true);\n\n mitk::NavigationData::PositionType point2;\n point2[0] = 7.0;\n point2[1] = 8.0;\n point2[2] = 9.0;\n nd2->SetPosition(point2);\n nd2->SetDataValid(true);\n\n mitk::NavigationData::PositionType point3;\n point3[0] = 10.0;\n point3[1] = 11.0;\n point3[2] = 12.0;\n nd3->SetPosition(point3);\n nd3->SetDataValid(true);\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd0);\n m_NavigationDataToPointSetFilter->SetInput(1, nd1);\n m_NavigationDataToPointSetFilter->SetInput(2, nd2);\n m_NavigationDataToPointSetFilter->SetInput(3, nd3);\n\n \/\/Process\n mitk::PointSet::Pointer pointSet0 = m_NavigationDataToPointSetFilter->GetOutput();\n mitk::PointSet::Pointer pointSet1 = m_NavigationDataToPointSetFilter->GetOutput(1);\n mitk::PointSet::Pointer pointSet2 = m_NavigationDataToPointSetFilter->GetOutput(2);\n mitk::PointSet::Pointer pointSet3 = m_NavigationDataToPointSetFilter->GetOutput(3);\n\n pointSet0->Update();\n\n MITK_TEST_OUTPUT(<< \"Testing the conversion of navigation data object to PointSets in Mode 3D:\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet0->GetPoint(0), point0), \"Pointset 0 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet1->GetPoint(0), point1), \"Pointset 1 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet2->GetPoint(0), point2), \"Pointset 2 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet3->GetPoint(0), point3), \"Pointset 3 correct?\");\n}\n\nstatic void TestMode4D()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode4D);\n m_NavigationDataToPointSetFilter->SetRingBufferSize(2);\n\n \/\/Build up test data\n mitk::NavigationData::Pointer nd = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd3 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd4 = mitk::NavigationData::New();\n\n mitk::NavigationData::PositionType point;\n\n point[0] = 1.0;\n point[1] = 2.0;\n point[2] = 3.0;\n nd->SetPosition(point);\n\n point[0] = 4.0;\n point[1] = 5.0;\n point[2] = 6.0;\n nd2->SetPosition(point);\n\n point[0] = 7.0;\n point[1] = 8.0;\n point[2] = 9.0;\n nd3->SetPosition(point);\n\n point[0] = 10.0;\n point[1] = 11.0;\n point[2] = 12.0;\n nd4->SetPosition(point);\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd);\n m_NavigationDataToPointSetFilter->SetInput(1, nd2);\n\n mitk::PointSet::Pointer pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n pointSet->Update();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 1.0 && pointSet->GetPoint(0,0)[1] == 2.0 && pointSet->GetPoint(0,0)[2] == 3.0 &&\n pointSet->GetPoint(1,0)[0] == 4.0 && pointSet->GetPoint(1,0)[1] == 5.0 && pointSet->GetPoint(1,0)[2] == 6.0\n , \"Testing the conversion of navigation data object to one point set in Mode 4D in first timestep\" );\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd3);\n m_NavigationDataToPointSetFilter->SetInput(1, nd4);\n m_NavigationDataToPointSetFilter->Update();\n pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 1.0 && pointSet->GetPoint(0,0)[1] == 2.0 && pointSet->GetPoint(0,0)[2] == 3.0 &&\n pointSet->GetPoint(1,0)[0] == 4.0 && pointSet->GetPoint(1,0)[1] == 5.0 && pointSet->GetPoint(1,0)[2] == 6.0 &&\n pointSet->GetPoint(0,1)[0] == 7.0 && pointSet->GetPoint(0,1)[1] == 8.0 && pointSet->GetPoint(0,1)[2] == 9.0 &&\n pointSet->GetPoint(1,1)[0] == 10.0 && pointSet->GetPoint(1,1)[1] == 11.0 && pointSet->GetPoint(1,1)[2] == 12.0\n , \"Testing the conversion of navigation data object to one point set in Mode 4D in second timestep\" );\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd3);\n m_NavigationDataToPointSetFilter->SetInput(1, nd4);\n pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n pointSet->Update();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 7.0 && pointSet->GetPoint(0,0)[1] == 8.0 && pointSet->GetPoint(0,0)[2] == 9.0 &&\n pointSet->GetPoint(1,0)[0] == 10.0 && pointSet->GetPoint(1,0)[1] == 11.0 && pointSet->GetPoint(1,0)[2] == 12.0 &&\n pointSet->GetPoint(0,1)[0] == 7.0 && pointSet->GetPoint(0,1)[1] == 8.0 && pointSet->GetPoint(0,1)[2] == 9.0 &&\n pointSet->GetPoint(1,1)[0] == 10.0 && pointSet->GetPoint(1,1)[1] == 11.0 && pointSet->GetPoint(1,1)[2] == 12.0\n , \"Testing the correct ring buffer behavior\" );\n}\n\nstatic void TestMode3DMean()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode3DMean);\n int numberForMean = 5;\n m_NavigationDataToPointSetFilter->SetNumberForMean(numberForMean);\n\n MITK_TEST_CONDITION(mitk::Equal(m_NavigationDataToPointSetFilter->GetNumberForMean(), numberForMean), \"Testing get\/set for numberForMean\");\n\n mitk::NavigationDataSequentialPlayer::Pointer player = mitk::NavigationDataSequentialPlayer::New();\n\n std::string file(MITK_IGT_DATA_DIR);\n file.append(\"\/NavigationDataTestData_2Tools.xml\");\n\n mitk::NavigationDataReaderXML::Pointer reader = mitk::NavigationDataReaderXML::New();\n\n player->SetNavigationDataSet( reader->Read(file) );\n\n for (unsigned int i = 0; i< player->GetNumberOfOutputs(); i++)\n {\n m_NavigationDataToPointSetFilter->SetInput(i, player->GetOutput(i));\n }\n\n mitk::PointSet::Pointer pointSet0 = m_NavigationDataToPointSetFilter->GetOutput();\n mitk::PointSet::Pointer pointSet1 = m_NavigationDataToPointSetFilter->GetOutput(1);\n\n m_NavigationDataToPointSetFilter->Update();\n\n MITK_TEST_CONDITION(pointSet0->GetPoint(0)[0]==3.0 && pointSet0->GetPoint(0)[1]==2.0 && pointSet0->GetPoint(0)[2]==5.0,\n \"Testing the average of first input\");\n\n MITK_TEST_CONDITION(pointSet1->GetPoint(0)[0]==30.0 && pointSet1->GetPoint(0)[1]==20.0 && pointSet1->GetPoint(0)[2]==50.0,\n \"Testing the average of second input\");\n}\n\nstatic void NavigationDataToPointSetFilterContructor_DefaultCall_IsNotEmpty()\n{\n Setup();\n MITK_TEST_CONDITION_REQUIRED(m_NavigationDataToPointSetFilter.IsNotNull(),\"Testing instantiation\");\n \/\/I think this test is meaningless, because it will never ever fail. I keep it for know just to be save.\n}\n\nstatic void NavigationDataToPointSetFilterSetInput_SimplePoint_EqualsGroundTruth()\n{\n Setup();\n\n mitk::NavigationData::Pointer nd_in = mitk::NavigationData::New();\n const mitk::NavigationData* nd_out = mitk::NavigationData::New();\n mitk::NavigationData::PositionType point;\n\n point[0] = 1.0;\n point[1] = 2.0;\n point[2] = 3.0;\n nd_in->SetPosition(point);\n\n m_NavigationDataToPointSetFilter->SetInput(nd_in);\n nd_out = m_NavigationDataToPointSetFilter->GetInput();\n\n MITK_TEST_CONDITION( nd_out->GetPosition() == nd_in->GetPosition(),\n \"Testing get\/set input\" );\n}\n\nint mitkNavigationDataToPointSetFilterTest(int \/* argc *\/, char* \/*argv*\/[])\n{\n MITK_TEST_BEGIN(\"NavigationDataToPointSetFilter\");\n\n NavigationDataToPointSetFilterContructor_DefaultCall_IsNotEmpty();\n NavigationDataToPointSetFilterSetInput_SimplePoint_EqualsGroundTruth();\n TestMode3D();\n TestMode4D();\n TestMode3DMean();\n\n MITK_TEST_END();\n}\n<commit_msg>TestMode3DMean doesn't work in debug mode. See bug 17763.<commit_after>\/*===================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center,\nDivision of Medical and Biological Informatics.\nAll rights reserved.\n\nThis software is distributed WITHOUT ANY WARRANTY; without\neven the implied warranty of MERCHANTABILITY or FITNESS FOR\nA PARTICULAR PURPOSE.\n\nSee LICENSE.txt or http:\/\/www.mitk.org for details.\n\n===================================================================*\/\n\n#include \"mitkNavigationDataToPointSetFilter.h\"\n#include \"mitkNavigationDataSequentialPlayer.h\"\n#include \"mitkNavigationDataReaderXML.h\"\n#include <mitkIGTConfig.h>\n#include <mitkTestingMacros.h>\n\n#include <iostream>\n\n\/**\n* Simple example for a test for the (non-existent) class \"NavigationDataToPointSetFilter\".\n*\n* argc and argv are the command line parameters which were passed to\n* the ADD_TEST command in the CMakeLists.txt file. For the automatic\n* tests, argv is either empty for the simple tests or contains the filename\n* of a test image for the image tests (see CMakeLists.txt).\n*\/\n\nmitk::NavigationDataToPointSetFilter::Pointer m_NavigationDataToPointSetFilter;\n\nstatic void Setup()\n{\n m_NavigationDataToPointSetFilter = mitk::NavigationDataToPointSetFilter::New();\n}\n\nstatic void TestMode3D()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode3D);\n\n \/\/Build up test data\n mitk::NavigationData::Pointer nd0 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd1 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd3 = mitk::NavigationData::New();\n\n mitk::NavigationData::PositionType point0;\n point0[0] = 1.0;\n point0[1] = 2.0;\n point0[2] = 3.0;\n nd0->SetPosition(point0);\n nd0->SetDataValid(true);\n\n mitk::NavigationData::PositionType point1;\n point1[0] = 4.0;\n point1[1] = 5.0;\n point1[2] = 6.0;\n nd1->SetPosition(point1);\n nd1->SetDataValid(true);\n\n mitk::NavigationData::PositionType point2;\n point2[0] = 7.0;\n point2[1] = 8.0;\n point2[2] = 9.0;\n nd2->SetPosition(point2);\n nd2->SetDataValid(true);\n\n mitk::NavigationData::PositionType point3;\n point3[0] = 10.0;\n point3[1] = 11.0;\n point3[2] = 12.0;\n nd3->SetPosition(point3);\n nd3->SetDataValid(true);\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd0);\n m_NavigationDataToPointSetFilter->SetInput(1, nd1);\n m_NavigationDataToPointSetFilter->SetInput(2, nd2);\n m_NavigationDataToPointSetFilter->SetInput(3, nd3);\n\n \/\/Process\n mitk::PointSet::Pointer pointSet0 = m_NavigationDataToPointSetFilter->GetOutput();\n mitk::PointSet::Pointer pointSet1 = m_NavigationDataToPointSetFilter->GetOutput(1);\n mitk::PointSet::Pointer pointSet2 = m_NavigationDataToPointSetFilter->GetOutput(2);\n mitk::PointSet::Pointer pointSet3 = m_NavigationDataToPointSetFilter->GetOutput(3);\n\n pointSet0->Update();\n\n MITK_TEST_OUTPUT(<< \"Testing the conversion of navigation data object to PointSets in Mode 3D:\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet0->GetPoint(0), point0), \"Pointset 0 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet1->GetPoint(0), point1), \"Pointset 1 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet2->GetPoint(0), point2), \"Pointset 2 correct?\");\n MITK_TEST_CONDITION(mitk::Equal(pointSet3->GetPoint(0), point3), \"Pointset 3 correct?\");\n}\n\nstatic void TestMode4D()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode4D);\n m_NavigationDataToPointSetFilter->SetRingBufferSize(2);\n\n \/\/Build up test data\n mitk::NavigationData::Pointer nd = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd2 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd3 = mitk::NavigationData::New();\n mitk::NavigationData::Pointer nd4 = mitk::NavigationData::New();\n\n mitk::NavigationData::PositionType point;\n\n point[0] = 1.0;\n point[1] = 2.0;\n point[2] = 3.0;\n nd->SetPosition(point);\n\n point[0] = 4.0;\n point[1] = 5.0;\n point[2] = 6.0;\n nd2->SetPosition(point);\n\n point[0] = 7.0;\n point[1] = 8.0;\n point[2] = 9.0;\n nd3->SetPosition(point);\n\n point[0] = 10.0;\n point[1] = 11.0;\n point[2] = 12.0;\n nd4->SetPosition(point);\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd);\n m_NavigationDataToPointSetFilter->SetInput(1, nd2);\n\n mitk::PointSet::Pointer pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n pointSet->Update();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 1.0 && pointSet->GetPoint(0,0)[1] == 2.0 && pointSet->GetPoint(0,0)[2] == 3.0 &&\n pointSet->GetPoint(1,0)[0] == 4.0 && pointSet->GetPoint(1,0)[1] == 5.0 && pointSet->GetPoint(1,0)[2] == 6.0\n , \"Testing the conversion of navigation data object to one point set in Mode 4D in first timestep\" );\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd3);\n m_NavigationDataToPointSetFilter->SetInput(1, nd4);\n m_NavigationDataToPointSetFilter->Update();\n pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 1.0 && pointSet->GetPoint(0,0)[1] == 2.0 && pointSet->GetPoint(0,0)[2] == 3.0 &&\n pointSet->GetPoint(1,0)[0] == 4.0 && pointSet->GetPoint(1,0)[1] == 5.0 && pointSet->GetPoint(1,0)[2] == 6.0 &&\n pointSet->GetPoint(0,1)[0] == 7.0 && pointSet->GetPoint(0,1)[1] == 8.0 && pointSet->GetPoint(0,1)[2] == 9.0 &&\n pointSet->GetPoint(1,1)[0] == 10.0 && pointSet->GetPoint(1,1)[1] == 11.0 && pointSet->GetPoint(1,1)[2] == 12.0\n , \"Testing the conversion of navigation data object to one point set in Mode 4D in second timestep\" );\n\n m_NavigationDataToPointSetFilter->SetInput(0, nd3);\n m_NavigationDataToPointSetFilter->SetInput(1, nd4);\n pointSet = m_NavigationDataToPointSetFilter->GetOutput();\n pointSet->Update();\n\n MITK_TEST_CONDITION( pointSet->GetPoint(0,0)[0] == 7.0 && pointSet->GetPoint(0,0)[1] == 8.0 && pointSet->GetPoint(0,0)[2] == 9.0 &&\n pointSet->GetPoint(1,0)[0] == 10.0 && pointSet->GetPoint(1,0)[1] == 11.0 && pointSet->GetPoint(1,0)[2] == 12.0 &&\n pointSet->GetPoint(0,1)[0] == 7.0 && pointSet->GetPoint(0,1)[1] == 8.0 && pointSet->GetPoint(0,1)[2] == 9.0 &&\n pointSet->GetPoint(1,1)[0] == 10.0 && pointSet->GetPoint(1,1)[1] == 11.0 && pointSet->GetPoint(1,1)[2] == 12.0\n , \"Testing the correct ring buffer behavior\" );\n}\n\nstatic void TestMode3DMean()\n{\n Setup();\n m_NavigationDataToPointSetFilter->SetOperationMode(mitk::NavigationDataToPointSetFilter::Mode3DMean);\n int numberForMean = 5;\n m_NavigationDataToPointSetFilter->SetNumberForMean(numberForMean);\n\n MITK_TEST_CONDITION(mitk::Equal(m_NavigationDataToPointSetFilter->GetNumberForMean(), numberForMean), \"Testing get\/set for numberForMean\");\n\n mitk::NavigationDataSequentialPlayer::Pointer player = mitk::NavigationDataSequentialPlayer::New();\n\n std::string file(MITK_IGT_DATA_DIR);\n file.append(\"\/NavigationDataTestData_2Tools.xml\");\n\n mitk::NavigationDataReaderXML::Pointer reader = mitk::NavigationDataReaderXML::New();\n\n player->SetNavigationDataSet( reader->Read(file) );\n\n for (unsigned int i = 0; i< player->GetNumberOfOutputs(); i++)\n {\n m_NavigationDataToPointSetFilter->SetInput(i, player->GetOutput(i));\n }\n\n mitk::PointSet::Pointer pointSet0 = m_NavigationDataToPointSetFilter->GetOutput();\n mitk::PointSet::Pointer pointSet1 = m_NavigationDataToPointSetFilter->GetOutput(1);\n\n m_NavigationDataToPointSetFilter->Update();\n\n MITK_TEST_CONDITION(pointSet0->GetPoint(0)[0]==3.0 && pointSet0->GetPoint(0)[1]==2.0 && pointSet0->GetPoint(0)[2]==5.0,\n \"Testing the average of first input\");\n\n MITK_TEST_CONDITION(pointSet1->GetPoint(0)[0]==30.0 && pointSet1->GetPoint(0)[1]==20.0 && pointSet1->GetPoint(0)[2]==50.0,\n \"Testing the average of second input\");\n}\n\nstatic void NavigationDataToPointSetFilterContructor_DefaultCall_IsNotEmpty()\n{\n Setup();\n MITK_TEST_CONDITION_REQUIRED(m_NavigationDataToPointSetFilter.IsNotNull(),\"Testing instantiation\");\n \/\/I think this test is meaningless, because it will never ever fail. I keep it for know just to be save.\n}\n\nstatic void NavigationDataToPointSetFilterSetInput_SimplePoint_EqualsGroundTruth()\n{\n Setup();\n\n mitk::NavigationData::Pointer nd_in = mitk::NavigationData::New();\n const mitk::NavigationData* nd_out = mitk::NavigationData::New();\n mitk::NavigationData::PositionType point;\n\n point[0] = 1.0;\n point[1] = 2.0;\n point[2] = 3.0;\n nd_in->SetPosition(point);\n\n m_NavigationDataToPointSetFilter->SetInput(nd_in);\n nd_out = m_NavigationDataToPointSetFilter->GetInput();\n\n MITK_TEST_CONDITION( nd_out->GetPosition() == nd_in->GetPosition(),\n \"Testing get\/set input\" );\n}\n\nint mitkNavigationDataToPointSetFilterTest(int \/* argc *\/, char* \/*argv*\/[])\n{\n MITK_TEST_BEGIN(\"NavigationDataToPointSetFilter\");\n\n NavigationDataToPointSetFilterContructor_DefaultCall_IsNotEmpty();\n NavigationDataToPointSetFilterSetInput_SimplePoint_EqualsGroundTruth();\n TestMode3D();\n TestMode4D();\n\/\/ TestMode3DMean(); \/\/infinite loop in debug mode, see bug 17763\n\n MITK_TEST_END();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"bim.hpp\"\n\nnamespace bim {\n\n\tChunk::Chunk() :\n\t\tm_address(0),\n\t\tm_properties(Property::DONT_CARE),\n\t\tm_numTrianglesPerLeaf(0),\n\t\tm_numTreeLevels(0)\n\t{\n\t}\n\n\tvoid Chunk::addVertex(const FullVertex& _properties)\n\t{\n\t\tif(m_positions.empty())\n\t\t\tm_boundingBox.min = m_boundingBox.max = _properties.position;\n\t\telse {\n\t\t\tm_boundingBox.min = min(_properties.position, m_boundingBox.min);\n\t\t\tm_boundingBox.max = max(_properties.position, m_boundingBox.max);\n\t\t}\n\t\tm_positions.push_back(_properties.position);\n\t\tif(m_properties & Property::NORMAL)\n\t\t\tm_normals.push_back(_properties.normal);\n\t\tif(m_properties & Property::TANGENT)\n\t\t\tm_tangents.push_back(_properties.tangent);\n\t\tif(m_properties & Property::BITANGENT)\n\t\t\tm_bitangents.push_back(_properties.bitangent);\n\t\tif(m_properties & Property::QORMAL)\n\t\t\tm_qormals.push_back(_properties.qormal);\n\t\tif(m_properties & Property::TEXCOORD0)\n\t\t\tm_texCoords0.push_back(_properties.texCoord0);\n\t\tif(m_properties & Property::TEXCOORD1)\n\t\t\tm_texCoords1.push_back(_properties.texCoord1);\n\t\tif(m_properties & Property::TEXCOORD2)\n\t\t\tm_texCoords2.push_back(_properties.texCoord2);\n\t\tif(m_properties & Property::TEXCOORD3)\n\t\t\tm_texCoords3.push_back(_properties.texCoord3);\n\t\tif(m_properties & Property::COLOR)\n\t\t\tm_colors.push_back(_properties.color);\n\t}\n\t\t\n\tvoid Chunk::addTriangle(const ei::UVec3& _indices, uint32 _material)\n\t{\n\t\tm_triangles.push_back(_indices);\n\t\tif(m_properties & Property::TRIANGLE_MAT)\n\t\t\tm_triangleMaterials.push_back(_material);\n\t}\n\n\tstatic ei::Vec3 denoise(const ei::Vec3& _x)\n\t{\n\t\t return *reinterpret_cast<const ei::Vec3*>(&(*reinterpret_cast<const ei::UVec3*>(&_x) & 0xfffffff0));\n\t}\n\tstatic ei::Vec2 denoise(const ei::Vec2& _x)\n\t{\n\t\treturn *reinterpret_cast<const ei::Vec2*>(&(*reinterpret_cast<const ei::UVec2*>(&_x) & 0xfffffff0));\n\t}\n\n\tvoid Chunk::removeRedundantVertices()\n\t{\n\t\tinvalidateHierarchy();\n\n\t\tstd::unordered_map<FullVertex, uint> vertexToIndex;\n\t\tuint index = 0;\n\t\tsize_t numVertices = m_positions.size();\n\t\t\/\/ Initialize the index mapping to index->self\n\t\tstd::vector<uint> indexToIndex(numVertices);\n\t\tfor(size_t i = 0; i < numVertices; ++i)\n\t\t\tindexToIndex[i] = (uint)i;\n\t\t\/\/ For each vertex\n\t\tfor(size_t i = 0; i < numVertices; ++i)\n\t\t{\n\t\t\t\/\/ Create a key\n\t\t\tFullVertex key;\n\t\t\t\/\/ Round properties (denoise) in vertices (otherwise hashing will miss many)\n\t\t\tkey.position = denoise(m_positions[i]);\n\t\t\tif(!m_normals.empty()) key.normal = normalize(denoise(m_normals[i]));\n\t\t\tif(!m_tangents.empty()) key.tangent = normalize(denoise(m_tangents[i]));\n\t\t\tif(!m_bitangents.empty()) key.bitangent = normalize(denoise(m_bitangents[i]));\n\t\t\tif(!m_qormals.empty()) key.qormal = m_qormals[i]; \/\/ TODO denoise\n\t\t\tif(!m_texCoords0.empty()) key.texCoord0 = denoise(m_texCoords0[i]);\n\t\t\tif(!m_texCoords1.empty()) key.texCoord1 = denoise(m_texCoords1[i]);\n\t\t\tif(!m_texCoords2.empty()) key.texCoord2 = denoise(m_texCoords2[i]);\n\t\t\tif(!m_texCoords3.empty()) key.texCoord3 = denoise(m_texCoords3[i]);\n\t\t\tif(!m_colors.empty()) key.color = m_colors[i];\n\t\t\t\/\/ Get the index\n\t\t\tauto it = vertexToIndex.find(key);\n\t\t\tif(it == vertexToIndex.end())\n\t\t\t{\n\t\t\t\t\/\/ This is a new vertex -> keep (but move to index)\n\t\t\t\tvertexToIndex[key] = index;\n\t\t\t\tindexToIndex[i] = index;\n\t\t\t\t\/\/ Move data from i -> index\n\t\t\t\tm_positions[index] = m_positions[i];\n\t\t\t\tif(!m_normals.empty()) m_normals[index] = m_normals[i];\n\t\t\t\tif(!m_tangents.empty()) m_tangents[index] = m_tangents[i];\n\t\t\t\tif(!m_bitangents.empty()) m_bitangents[index] = m_bitangents[i];\n\t\t\t\tif(!m_qormals.empty()) m_qormals[index] = m_qormals[i];\n\t\t\t\tif(!m_texCoords0.empty()) m_texCoords0[index] = m_texCoords0[i];\n\t\t\t\tif(!m_texCoords1.empty()) m_texCoords1[index] = m_texCoords1[i];\n\t\t\t\tif(!m_texCoords2.empty()) m_texCoords2[index] = m_texCoords2[i];\n\t\t\t\tif(!m_texCoords3.empty()) m_texCoords3[index] = m_texCoords3[i];\n\t\t\t\tif(!m_colors.empty()) m_colors[index] = m_colors[i];\n\t\t\t\t++index;\n\t\t\t} else {\n\t\t\t\tindexToIndex[i] = it->second;\n\t\t\t}\n\t\t}\n\t\t\/\/ All vertices we kept are moved to a block of size 'index'. The remaining\n\t\t\/\/ part can be removed.\n\t\tm_positions.resize(index);\n\t\tif(!m_normals.empty()) m_normals.resize(index);\n\t\tif(!m_tangents.empty()) m_tangents.resize(index);\n\t\tif(!m_bitangents.empty()) m_bitangents.resize(index);\n\t\tif(!m_qormals.empty()) m_qormals.resize(index);\n\t\tif(!m_texCoords0.empty()) m_texCoords0.resize(index);\n\t\tif(!m_texCoords1.empty()) m_texCoords1.resize(index);\n\t\tif(!m_texCoords2.empty()) m_texCoords2.resize(index);\n\t\tif(!m_texCoords3.empty()) m_texCoords3.resize(index);\n\t\tif(!m_colors.empty()) m_colors.resize(index);\n\n\t\t\/\/ Rebuild index buffer\n\t\tfor(size_t i = 0; i < m_triangles.size(); ++i)\n\t\t{\n\t\t\tm_triangles[i].x = indexToIndex[m_triangles[i].x];\n\t\t\tm_triangles[i].y = indexToIndex[m_triangles[i].y];\n\t\t\tm_triangles[i].z = indexToIndex[m_triangles[i].z];\n\t\t}\n\t}\n\n\tvoid Chunk::rebuildHierarchy(BuildMethod _method, uint _numTrianglesPerLeaf)\n\t{\n\t\tm_numTrianglesPerLeaf = _numTrianglesPerLeaf;\n\t\tswitch(_method)\n\t\t{\n\t\tcase BuildMethod::KD_TREE:\n\t\t\tbuildBVH_kdtree();\n\t\t\tbreak;\n\t\tcase BuildMethod::SAH:\n\t\t\tbuildBVH_SAHsplit();\n\t\t\tbreak;\n\t\t}\n\n\t\tm_numTreeLevels = remapNodePointers(0, 0, 0);\n\t\tm_properties = Property::Val(m_properties | Property::HIERARCHY);\n\t}\n\n\tvoid Chunk::addProperty(Property::Val _property)\n\t{\n\t\tif(!(m_properties & _property))\n\t\t{\n\t\t\tswitch(_property)\n\t\t\t{\n\t\t\tcase Property::NORMAL: swap(m_normals, std::vector<ei::Vec3>(m_positions.size(), FullVertex().position)); break;\n\t\t\tcase Property::TANGENT: swap(m_tangents, std::vector<ei::Vec3>(m_positions.size(), FullVertex().tangent)); break;\n\t\t\tcase Property::BITANGENT: swap(m_bitangents, std::vector<ei::Vec3>(m_positions.size(), FullVertex().bitangent)); break;\n\t\t\tcase Property::QORMAL: swap(m_qormals, std::vector<ei::Quaternion>(m_positions.size(), FullVertex().qormal)); break;\n\t\t\tcase Property::TEXCOORD0: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord0)); break;\n\t\t\tcase Property::TEXCOORD1: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord1)); break;\n\t\t\tcase Property::TEXCOORD2: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord2)); break;\n\t\t\tcase Property::TEXCOORD3: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord3)); break;\n\t\t\tcase Property::COLOR: swap(m_colors, std::vector<uint32>(m_positions.size(), FullVertex().color)); break;\n\t\t\tcase Property::TRIANGLE_MAT: swap(m_triangleMaterials, std::vector<uint32>(m_triangles.size(), 0)); break;\n\t\t\tcase Property::AABOX_BVH: swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::OBOX_BVH: \/\/swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::SPHERE_BVH: \/\/swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::NDF_SGGX: swap(m_nodeNDFs, std::vector<SGGX>(m_hierarchy.size())); break;\n\t\t\tdefault: return;\n\t\t\t}\n\t\t\tm_properties = Property::Val(m_properties | _property);\n\t\t}\n\t}\n\n\tvoid Chunk::invalidateHierarchy()\n\t{\n\t\t\/\/ Remove all data, it needs to be recomputed anyway\n\t\tm_hierarchy.clear();\n\t\tm_hierarchyLeaves.clear();\n\t\tm_aaBoxes.clear();\n\t\tm_nodeNDFs.clear();\n\t\tm_properties = Property::Val(m_properties\n\t\t\t& ~(Property::HIERARCHY | Property::AABOX_BVH \n\t\t\t | Property::OBOX_BVH | Property::SPHERE_BVH | Property::NDF_SGGX));\n\t\tm_numTreeLevels = 0;\n\t}\n\n\t\/\/ ********************************************************************* \/\/\n\tChunk::FullVertex::FullVertex() :\n\t\tposition(0.0f),\n\t\tnormal(0.0f, 1.0f, 0.0),\n\t\ttangent(1.0f, 0.0f, 0.0f),\n\t\tbitangent(0.0f, 0.0f, 1.0f),\n\t\tqormal(ei::qidentity()),\n\t\ttexCoord0(0.0f),\n\t\ttexCoord1(0.0f),\n\t\ttexCoord2(0.0f),\n\t\ttexCoord3(0.0f),\n\t\tcolor(0)\n\t{\n\t}\n\n\tbool Chunk::FullVertex::operator == (const FullVertex& _rhs) const\n\t{\n\t\tif(any(position != _rhs.position)) return false;\n\t\tif(any(normal != _rhs.normal)) return false;\n\t\tif(any(tangent != _rhs.tangent)) return false;\n\t\tif(any(bitangent != _rhs.bitangent)) return false;\n\t\tif(qormal != _rhs.qormal) return false;\n\t\tif(any(texCoord0 != _rhs.texCoord0)) return false;\n\t\tif(any(texCoord1 != _rhs.texCoord1)) return false;\n\t\tif(any(texCoord2 != _rhs.texCoord2)) return false;\n\t\tif(any(texCoord3 != _rhs.texCoord3)) return false;\n\t\tif(color != _rhs.color) return false;\n\t\treturn true;\n\t}\n\n} \/\/ namespace bim<commit_msg>removeRedundantVertices also removes degenerated triangles<commit_after>#include \"bim.hpp\"\n\nnamespace bim {\n\n\tChunk::Chunk() :\n\t\tm_address(0),\n\t\tm_properties(Property::DONT_CARE),\n\t\tm_numTrianglesPerLeaf(0),\n\t\tm_numTreeLevels(0)\n\t{\n\t}\n\n\tvoid Chunk::addVertex(const FullVertex& _properties)\n\t{\n\t\tif(m_positions.empty())\n\t\t\tm_boundingBox.min = m_boundingBox.max = _properties.position;\n\t\telse {\n\t\t\tm_boundingBox.min = min(_properties.position, m_boundingBox.min);\n\t\t\tm_boundingBox.max = max(_properties.position, m_boundingBox.max);\n\t\t}\n\t\tm_positions.push_back(_properties.position);\n\t\tif(m_properties & Property::NORMAL)\n\t\t\tm_normals.push_back(_properties.normal);\n\t\tif(m_properties & Property::TANGENT)\n\t\t\tm_tangents.push_back(_properties.tangent);\n\t\tif(m_properties & Property::BITANGENT)\n\t\t\tm_bitangents.push_back(_properties.bitangent);\n\t\tif(m_properties & Property::QORMAL)\n\t\t\tm_qormals.push_back(_properties.qormal);\n\t\tif(m_properties & Property::TEXCOORD0)\n\t\t\tm_texCoords0.push_back(_properties.texCoord0);\n\t\tif(m_properties & Property::TEXCOORD1)\n\t\t\tm_texCoords1.push_back(_properties.texCoord1);\n\t\tif(m_properties & Property::TEXCOORD2)\n\t\t\tm_texCoords2.push_back(_properties.texCoord2);\n\t\tif(m_properties & Property::TEXCOORD3)\n\t\t\tm_texCoords3.push_back(_properties.texCoord3);\n\t\tif(m_properties & Property::COLOR)\n\t\t\tm_colors.push_back(_properties.color);\n\t}\n\t\t\n\tvoid Chunk::addTriangle(const ei::UVec3& _indices, uint32 _material)\n\t{\n\t\tm_triangles.push_back(_indices);\n\t\tif(m_properties & Property::TRIANGLE_MAT)\n\t\t\tm_triangleMaterials.push_back(_material);\n\t}\n\n\tstatic ei::Vec3 denoise(const ei::Vec3& _x)\n\t{\n\t\t return *reinterpret_cast<const ei::Vec3*>(&(*reinterpret_cast<const ei::UVec3*>(&_x) & 0xfffffff0));\n\t}\n\tstatic ei::Vec2 denoise(const ei::Vec2& _x)\n\t{\n\t\treturn *reinterpret_cast<const ei::Vec2*>(&(*reinterpret_cast<const ei::UVec2*>(&_x) & 0xfffffff0));\n\t}\n\n\tvoid Chunk::removeRedundantVertices()\n\t{\n\t\tinvalidateHierarchy();\n\n\t\tstd::unordered_map<FullVertex, uint> vertexToIndex;\n\t\tuint index = 0;\n\t\tsize_t numVertices = m_positions.size();\n\t\t\/\/ Initialize the index mapping to index->self\n\t\tstd::vector<uint> indexToIndex(numVertices);\n\t\tfor(size_t i = 0; i < numVertices; ++i)\n\t\t\tindexToIndex[i] = (uint)i;\n\t\t\/\/ For each vertex\n\t\tfor(size_t i = 0; i < numVertices; ++i)\n\t\t{\n\t\t\t\/\/ Create a key\n\t\t\tFullVertex key;\n\t\t\t\/\/ Round properties (denoise) in vertices (otherwise hashing will miss many)\n\t\t\tkey.position = denoise(m_positions[i]);\n\t\t\tif(!m_normals.empty()) key.normal = normalize(denoise(m_normals[i]));\n\t\t\tif(!m_tangents.empty()) key.tangent = normalize(denoise(m_tangents[i]));\n\t\t\tif(!m_bitangents.empty()) key.bitangent = normalize(denoise(m_bitangents[i]));\n\t\t\tif(!m_qormals.empty()) key.qormal = m_qormals[i]; \/\/ TODO denoise\n\t\t\tif(!m_texCoords0.empty()) key.texCoord0 = denoise(m_texCoords0[i]);\n\t\t\tif(!m_texCoords1.empty()) key.texCoord1 = denoise(m_texCoords1[i]);\n\t\t\tif(!m_texCoords2.empty()) key.texCoord2 = denoise(m_texCoords2[i]);\n\t\t\tif(!m_texCoords3.empty()) key.texCoord3 = denoise(m_texCoords3[i]);\n\t\t\tif(!m_colors.empty()) key.color = m_colors[i];\n\t\t\t\/\/ Get the index\n\t\t\tauto it = vertexToIndex.find(key);\n\t\t\tif(it == vertexToIndex.end())\n\t\t\t{\n\t\t\t\t\/\/ This is a new vertex -> keep (but move to index)\n\t\t\t\tvertexToIndex[key] = index;\n\t\t\t\tindexToIndex[i] = index;\n\t\t\t\t\/\/ Move data from i -> index\n\t\t\t\tm_positions[index] = m_positions[i];\n\t\t\t\tif(!m_normals.empty()) m_normals[index] = m_normals[i];\n\t\t\t\tif(!m_tangents.empty()) m_tangents[index] = m_tangents[i];\n\t\t\t\tif(!m_bitangents.empty()) m_bitangents[index] = m_bitangents[i];\n\t\t\t\tif(!m_qormals.empty()) m_qormals[index] = m_qormals[i];\n\t\t\t\tif(!m_texCoords0.empty()) m_texCoords0[index] = m_texCoords0[i];\n\t\t\t\tif(!m_texCoords1.empty()) m_texCoords1[index] = m_texCoords1[i];\n\t\t\t\tif(!m_texCoords2.empty()) m_texCoords2[index] = m_texCoords2[i];\n\t\t\t\tif(!m_texCoords3.empty()) m_texCoords3[index] = m_texCoords3[i];\n\t\t\t\tif(!m_colors.empty()) m_colors[index] = m_colors[i];\n\t\t\t\t++index;\n\t\t\t} else {\n\t\t\t\tindexToIndex[i] = it->second;\n\t\t\t}\n\t\t}\n\t\t\/\/ All vertices we kept are moved to a block of size 'index'. The remaining\n\t\t\/\/ part can be removed.\n\t\tm_positions.resize(index);\n\t\tif(!m_normals.empty()) m_normals.resize(index);\n\t\tif(!m_tangents.empty()) m_tangents.resize(index);\n\t\tif(!m_bitangents.empty()) m_bitangents.resize(index);\n\t\tif(!m_qormals.empty()) m_qormals.resize(index);\n\t\tif(!m_texCoords0.empty()) m_texCoords0.resize(index);\n\t\tif(!m_texCoords1.empty()) m_texCoords1.resize(index);\n\t\tif(!m_texCoords2.empty()) m_texCoords2.resize(index);\n\t\tif(!m_texCoords3.empty()) m_texCoords3.resize(index);\n\t\tif(!m_colors.empty()) m_colors.resize(index);\n\n\t\t\/\/ Rebuild index buffer\n\t\tsize_t numInvalidTriangles = 0;\n\t\tfor(size_t i = 0; i < m_triangles.size(); ++i)\n\t\t{\n\t\t\tif(m_triangles[i].x == m_triangles[i].y\n\t\t\t\t|| m_triangles[i].x == m_triangles[i].z\n\t\t\t\t|| m_triangles[i].y == m_triangles[i].z)\n\t\t\t\t++numInvalidTriangles;\n\t\t\telse {\n\t\t\t\tm_triangles[i-numInvalidTriangles].x = indexToIndex[m_triangles[i].x];\n\t\t\t\tm_triangles[i-numInvalidTriangles].y = indexToIndex[m_triangles[i].y];\n\t\t\t\tm_triangles[i-numInvalidTriangles].z = indexToIndex[m_triangles[i].z];\n\t\t\t}\n\t\t}\n\t\tm_triangles.resize(m_triangles.size() - numInvalidTriangles);\n\t}\n\n\tvoid Chunk::rebuildHierarchy(BuildMethod _method, uint _numTrianglesPerLeaf)\n\t{\n\t\tm_numTrianglesPerLeaf = _numTrianglesPerLeaf;\n\t\tswitch(_method)\n\t\t{\n\t\tcase BuildMethod::KD_TREE:\n\t\t\tbuildBVH_kdtree();\n\t\t\tbreak;\n\t\tcase BuildMethod::SAH:\n\t\t\tbuildBVH_SAHsplit();\n\t\t\tbreak;\n\t\t}\n\n\t\tm_numTreeLevels = remapNodePointers(0, 0, 0);\n\t\tm_properties = Property::Val(m_properties | Property::HIERARCHY);\n\t}\n\n\tvoid Chunk::addProperty(Property::Val _property)\n\t{\n\t\tif(!(m_properties & _property))\n\t\t{\n\t\t\tswitch(_property)\n\t\t\t{\n\t\t\tcase Property::NORMAL: swap(m_normals, std::vector<ei::Vec3>(m_positions.size(), FullVertex().position)); break;\n\t\t\tcase Property::TANGENT: swap(m_tangents, std::vector<ei::Vec3>(m_positions.size(), FullVertex().tangent)); break;\n\t\t\tcase Property::BITANGENT: swap(m_bitangents, std::vector<ei::Vec3>(m_positions.size(), FullVertex().bitangent)); break;\n\t\t\tcase Property::QORMAL: swap(m_qormals, std::vector<ei::Quaternion>(m_positions.size(), FullVertex().qormal)); break;\n\t\t\tcase Property::TEXCOORD0: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord0)); break;\n\t\t\tcase Property::TEXCOORD1: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord1)); break;\n\t\t\tcase Property::TEXCOORD2: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord2)); break;\n\t\t\tcase Property::TEXCOORD3: swap(m_texCoords0, std::vector<ei::Vec2>(m_positions.size(), FullVertex().texCoord3)); break;\n\t\t\tcase Property::COLOR: swap(m_colors, std::vector<uint32>(m_positions.size(), FullVertex().color)); break;\n\t\t\tcase Property::TRIANGLE_MAT: swap(m_triangleMaterials, std::vector<uint32>(m_triangles.size(), 0)); break;\n\t\t\tcase Property::AABOX_BVH: swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::OBOX_BVH: \/\/swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::SPHERE_BVH: \/\/swap(m_aaBoxes, std::vector<ei::Box>(m_hierarchy.size())); break;\n\t\t\tcase Property::NDF_SGGX: swap(m_nodeNDFs, std::vector<SGGX>(m_hierarchy.size())); break;\n\t\t\tdefault: return;\n\t\t\t}\n\t\t\tm_properties = Property::Val(m_properties | _property);\n\t\t}\n\t}\n\n\tvoid Chunk::invalidateHierarchy()\n\t{\n\t\t\/\/ Remove all data, it needs to be recomputed anyway\n\t\tm_hierarchy.clear();\n\t\tm_hierarchyLeaves.clear();\n\t\tm_aaBoxes.clear();\n\t\tm_nodeNDFs.clear();\n\t\tm_properties = Property::Val(m_properties\n\t\t\t& ~(Property::HIERARCHY | Property::AABOX_BVH \n\t\t\t | Property::OBOX_BVH | Property::SPHERE_BVH | Property::NDF_SGGX));\n\t\tm_numTreeLevels = 0;\n\t}\n\n\t\/\/ ********************************************************************* \/\/\n\tChunk::FullVertex::FullVertex() :\n\t\tposition(0.0f),\n\t\tnormal(0.0f, 1.0f, 0.0),\n\t\ttangent(1.0f, 0.0f, 0.0f),\n\t\tbitangent(0.0f, 0.0f, 1.0f),\n\t\tqormal(ei::qidentity()),\n\t\ttexCoord0(0.0f),\n\t\ttexCoord1(0.0f),\n\t\ttexCoord2(0.0f),\n\t\ttexCoord3(0.0f),\n\t\tcolor(0)\n\t{\n\t}\n\n\tbool Chunk::FullVertex::operator == (const FullVertex& _rhs) const\n\t{\n\t\tif(any(position != _rhs.position)) return false;\n\t\tif(any(normal != _rhs.normal)) return false;\n\t\tif(any(tangent != _rhs.tangent)) return false;\n\t\tif(any(bitangent != _rhs.bitangent)) return false;\n\t\tif(qormal != _rhs.qormal) return false;\n\t\tif(any(texCoord0 != _rhs.texCoord0)) return false;\n\t\tif(any(texCoord1 != _rhs.texCoord1)) return false;\n\t\tif(any(texCoord2 != _rhs.texCoord2)) return false;\n\t\tif(any(texCoord3 != _rhs.texCoord3)) return false;\n\t\tif(color != _rhs.color) return false;\n\t\treturn true;\n\t}\n\n} \/\/ namespace bim<|endoftext|>"} {"text":"<commit_before>\/*\n kopeteaway.cpp - Kopete Away\n\n Copyright (c) 2002 by Hendrik vom Lehn <hvl@linux-4-ever.de>\n Copyright (c) 2003 Olivier Goffart <ogoffart@tiscalinet.be>\n\n Kopete (c) 2002-2003 by the Kopete developers <kopete-devel@kde.org>\n\n *************************************************************************\n * *\n * This library is free software; you can redistribute it and\/or *\n * modify it under the terms of the GNU Lesser General Public *\n * License as published by the Free Software Foundation; either *\n * version 2 of the License, or (at your option) any later version. *\n * *\n *************************************************************************\n*\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"kopeteaway.h\"\n\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n\n#include <kconfig.h>\n#include <qtimer.h>\n#include <kapplication.h>\n\n#include <klocale.h>\n#include <kglobal.h>\n#include <kdebug.h>\n#include <ksettings\/dispatcher.h>\n\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/Xresource.h>\n\/\/ The following include is to make --enable-final work\n#include <X11\/Xutil.h>\n\n#ifdef HAVE_XSCREENSAVER\n#define HasScreenSaver\n#include <X11\/extensions\/scrnsaver.h>\n#endif\n\n\/\/ As this is an untested X extension we better leave it off\n#undef HAVE_XIDLE\n#undef HasXidle\n\n\nstruct KopeteAwayPrivate\n{\n\tQString awayMessage;\n\tbool globalAway;\n\tQValueList<KopeteAwayMessage> awayMessageList;\n\tQTime idleTime;\n\tQTimer *timer;\n\tbool autoaway;\n\tbool goAvailable;\n\tint awayTimeout;\n\tbool useAutoAway;\n\tQPtrList<KopeteAccount> autoAwayAccounts;\n\n\tint mouse_x;\n\tint mouse_y;\n\tunsigned int mouse_mask;\n\tWindow root; \/* root window the pointer is on *\/\n\tScreen* screen; \/* screen the pointer is on *\/\n\n\tTime xIdleTime;\n\tbool useXidle;\n\tbool useMit;\n};\n\nKopeteAway *KopeteAway::instance = 0L;\n\nKopeteAway::KopeteAway() : QObject( kapp , \"KopeteAway\")\n{\n\tint dummy = 0;\n\tdummy = dummy; \/\/ shut up\n\n\td = new KopeteAwayPrivate;\n\n\t\/\/ Set up the away messages\n\td->awayMessage = \"\";\n\td->globalAway = false;\n\td->autoaway = false;\n\td->useAutoAway = true;\n\n\t\/\/ Empty the list\n\td->awayMessageList.clear();\n\n\t\/\/ set the XAutoLock info\n\tDisplay *dsp = qt_xdisplay();\n\td->mouse_x = d->mouse_y=0;\n\td->mouse_mask = 0;\n\td->root = DefaultRootWindow (dsp);\n\td->screen = ScreenOfDisplay (dsp, DefaultScreen (dsp));\n\n\td->useXidle = false;\n\td->useMit = false;\n#ifdef HasXidle\n\td->useXidle = XidleQueryExtension(qt_xdisplay(), &dummy, &dummy);\n#endif\n#ifdef HasScreenSaver\n\tif(!d->useXidle)\n\t\td->useMit = XScreenSaverQueryExtension(qt_xdisplay(), &dummy, &dummy);\n#endif\n\td->xIdleTime = 0;\n\n\tif (d->useXidle)\n\t\tkdDebug(14010) << \"using X11 Xidle extension\" << endl;\n\tif(d->useMit)\n\t\tkdDebug(14010) << \"using X11 MIT Screensaver extension\" << endl;\n\n\n\tload();\n\tKSettings::Dispatcher::self()->registerInstance( KGlobal::instance(), this, SLOT( load() ) );\n\t\/\/ Set up the config object\n\tKConfig *config = KGlobal::config();\n\t\/* Load the saved away messages *\/\n\tconfig->setGroup(\"Away Messages\");\n\n\t\/* If Kopete has been run before, this will be true.\n\t* It's only false the first time Kopete is run\n\t*\/\n\tif(config->hasKey(\"Titles\"))\n\t{\n\t\tQStringList titles = config->readListEntry(\"Titles\"); \/\/ Get the titles\n\t\tKopeteAwayMessage temp; \/\/ Temporary away message....\n\t\tfor(QStringList::iterator i = titles.begin(); i != titles.end(); i++)\n\t\t{\n\t\t\ttemp.title = (*i); \/\/ Grab the title from the list of messages\n\t\t\ttemp.message = config->readEntry(temp.title); \/\/ And the message (from disk)\n\t\t\td->awayMessageList.append(temp); \/\/ And add it to the list\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/* There are no away messages, so we'll create a default one *\/\n\t\t\/* Create an away message *\/\n\t\tKopeteAwayMessage temp;\n\t\ttemp.title = i18n(\"Busy\");\n\t\ttemp.message = i18n(\"Sorry, I'm busy right now\");\n\n\t\t\/* Add it to the vector *\/\n\t\td->awayMessageList.append(temp);\n\n\t\ttemp.title = i18n(\"Gone\");\n\t\ttemp.message = i18n(\"I'm gone right now, but I'll be back later\");\n\t\td->awayMessageList.append(temp);\n\n\t\t\/* Save this list to disk *\/\n\t\tsave();\n\t}\n\n\t\/\/ init the timer\n\td->timer = new QTimer(this, \"AwayTimer\");\n\tconnect(d->timer, SIGNAL(timeout()), this, SLOT(slotTimerTimeout()));\n\td->timer->start(2000);\n\n\t\/\/init the time and other\n\tsetActivity();\n}\n\nKopeteAway::~KopeteAway()\n{\n\tdelete d;\n}\n\nQString KopeteAway::message()\n{\n\treturn getInstance()->d->awayMessage;\n}\n\nvoid KopeteAway::setGlobalAwayMessage(const QString &message)\n{\n\tif( !message.isEmpty() )\n\t{\n\t\tkdDebug(14010) << k_funcinfo <<\n\t\t\t\"Setting global away message: \" << message << endl;\n\t\td->awayMessage = message;\n\t}\n}\n\nKopeteAway *KopeteAway::getInstance()\n{\n\tif (!instance)\n\t\tinstance = new KopeteAway;\n\treturn instance;\n}\n\nbool KopeteAway::globalAway()\n{\n\treturn getInstance()->d->globalAway;\n}\n\nvoid KopeteAway::setGlobalAway(bool status)\n{\n\tgetInstance()->d->globalAway = status;\n}\n\nvoid KopeteAway::save()\n{\n\tKConfig *config = KGlobal::config();\n\t\/* Set the away message settings in the Away Messages config group *\/\n\tconfig->setGroup(\"Away Messages\");\n\tQStringList titles;\n\t\/* For each message, keep track of the title, and write out the message *\/\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\ttitles.append((*i).title); \/\/ Append the title to list of titles\n\t\tconfig->writeEntry((*i).title, (*i).message); \/\/ Append Title->message pair to the config\n\t}\n\n\t\/* Write out the titles *\/\n\tconfig->writeEntry(\"Titles\", titles);\n\tconfig->sync();\n}\n\nvoid KopeteAway::load()\n{\n\tKConfig *config = KGlobal::config();\n\tconfig->setGroup(\"AutoAway\");\n\td->awayTimeout=config->readNumEntry(\"Timeout\", 600);\n\td->goAvailable=config->readBoolEntry(\"GoAvailable\", true);\n\td->useAutoAway=config->readBoolEntry(\"UseAutoAway\", true);\n\n}\n\nQStringList KopeteAway::getTitles()\n{\n\tQStringList titles;\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t\ttitles.append((*i).title);\n\n\treturn titles;\n}\n\nQString KopeteAway::getMessage(const QString &title)\n{\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\tif((*i).title == title)\n\t\t\treturn (*i).message;\n\t}\n\n\t\/* Return an empty string if none was found *\/\n\treturn QString::null;\n}\n\nbool KopeteAway::addMessage(const QString &title, const QString &message)\n{\n\tbool found = false;\n\t\/* Check to see if it exists already *\/\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\tif((*i).title == title)\n\t\t{\n\t\t\tfound = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/* If not, add it *\/\n\tif(!found)\n\t{\n\t\tKopeteAwayMessage temp;\n\t\ttemp.title = title;\n\t\ttemp.message = message;\n\t\td->awayMessageList.append(temp);\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KopeteAway::deleteMessage(const QString &title)\n{\n\t\/* Search for the message *\/\n\tQValueList<KopeteAwayMessage>::iterator itemToDelete = d->awayMessageList.begin();\n\twhile( (itemToDelete != d->awayMessageList.end()) && ((*itemToDelete).title != title) )\n\t\titemToDelete++;\n\n\t\/* If it was found, delete it *\/\n\tif(itemToDelete != d->awayMessageList.end())\n\t{\n\t\t\/* Remove it from the config entry, if it's there *\/\n\t\tif(KGlobal::config()->hasKey((*itemToDelete).title))\n\t\t\tKGlobal::config()->deleteEntry((*itemToDelete).title);\n\n\t\t\/* Remove it from the list *\/\n\t\td->awayMessageList.remove(itemToDelete);\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KopeteAway::updateMessage(const QString &title, const QString &message)\n{\n\t\/* Search for the message *\/\n\tQValueList<KopeteAwayMessage>::iterator itemToUpdate = d->awayMessageList.begin();\n\twhile( (itemToUpdate != d->awayMessageList.end()) && ((*itemToUpdate).title != title) )\n\t\titemToUpdate++;\n\n\t\/* If it was found, update it *\/\n\tif(itemToUpdate != d->awayMessageList.end())\n\t{\n\t\t(*itemToUpdate).message = message;\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nlong int KopeteAway::idleTime()\n{\n\t\/\/FIXME: the time is reset to zero if more than 24 hours are elapsed\n\t\/\/ we can imagine someone who leave his PC for several weeks\n\treturn (d->idleTime.elapsed() \/ 1000);\n}\n\nvoid KopeteAway::slotTimerTimeout()\n{\n\t\/\/ Copyright (c) 1999 Martin R. Jones <mjones@kde.org>\n\t\/\/\n\t\/\/ KDE screensaver engine\n\t\/\/\n\t\/\/ This module is a heavily modified xautolock.\n\t\/\/ In fact as of KDE 2.0 this code is practically unrecognisable as xautolock.\n\n\tDisplay *dsp = qt_xdisplay();\n\tWindow dummy_w;\n\tint dummy_c;\n\tunsigned int mask; \/* modifier mask *\/\n\tint root_x;\n\tint root_y;\n\n\t\/*\n\t* Find out whether the pointer has moved. Using XQueryPointer for this\n\t* is gross, but it also is the only way never to mess up propagation\n\t* of pointer events.\n\t*\n\t* Remark : Unlike XNextEvent(), XPending () doesn't notice if the\n\t* connection to the server is lost. For this reason, earlier\n\t* versions of xautolock periodically called XNoOp (). But\n\t* why not let XQueryPointer () do the job for us, since\n\t* we now call that periodically anyway?\n\t*\/\n\tif (!XQueryPointer (dsp, d->root, &(d->root), &dummy_w, &root_x, &root_y,\n\t\t\t&dummy_c, &dummy_c, &mask))\n\t{\n\t\t\/*\n\t\t* Pointer has moved to another screen, so let's find out which one.\n\t\t*\/\n\t\tfor (int i = 0; i < ScreenCount(dsp); i++)\n\t\t{\n\t\t\tif (d->root == RootWindow(dsp, i))\n\t\t\t{\n\t\t\t\td->screen = ScreenOfDisplay (dsp, i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ =================================================================================\n\n\tTime xIdleTime = 0; \/\/ millisecs since last input event\n\n\t#ifdef HasXidle\n\tif (d->useXidle)\n\t{\n\t\tXGetIdleTime(dsp, &xIdleTime);\n\t}\n\telse\n\t#endif \/* HasXIdle *\/\n\n\t{\n\t#ifdef HasScreenSaver\n\t\tif(d->useMit)\n\t\t{\n\t\t\tstatic XScreenSaverInfo* mitInfo = 0;\n\t\t\tif (!mitInfo) mitInfo = XScreenSaverAllocInfo();\n\t\t\tXScreenSaverQueryInfo (dsp, d->root, mitInfo);\n\t\t\txIdleTime = mitInfo->idle;\n\t\t}\n\t#endif \/* HasScreenSaver *\/\n\t}\n\n\t\/\/ =================================================================================\n\n\tif (root_x != d->mouse_x || root_y != d->mouse_y || mask != d->mouse_mask || xIdleTime < d->xIdleTime+2000)\n\t{\n\t\td->mouse_x = root_x;\n\t\td->mouse_y = root_y;\n\t\td->mouse_mask = mask;\n\t\td->xIdleTime = xIdleTime;\n\t\tsetActivity();\n\t}\n\n\t\/\/ =================================================================================\n\n\tif(!d->autoaway && d->useAutoAway && idleTime() > d->awayTimeout)\n\t{\n\t\tsetAutoAway();\n\t}\n}\n\nvoid KopeteAway::setActivity()\n{\n\/\/\tkdDebug(14010) << k_funcinfo << \"Found activity on desktop, resetting away timer\" << endl;\n\td->idleTime.start();\n\n\tif(d->autoaway)\n\t{\n\t\td->autoaway = false;\n\t\temit activity();\n\t\tif (d->goAvailable)\n\t\t{\n\t\t\td->autoAwayAccounts.setAutoDelete(false);\n\t\t\tfor(KopeteAccount *i=d->autoAwayAccounts.first() ; i; i=d->autoAwayAccounts.current() )\n\t\t\t{\n\t\t\t\tif(i->isConnected() && i->isAway()) {\n\t\t\t\t\ti->setAway(false);\n\t\t\t\t}\n\n\t\t\t\t\/\/ remove() makes the next entry in the list the current one,\n\t\t\t\t\/\/ that's why we use current() above\n\t\t\t\td->autoAwayAccounts.remove();\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid KopeteAway::setAutoAway()\n{\n\/\/\tkdDebug(14010) << k_funcinfo << \"Going AutoAway!\" << endl;\n\td->autoaway = true;\n\n\t\/\/ Set all accounts that are not away already to away.\n\t\/\/ We remember them so later we only set the accounts to\n\t\/\/ available that we set to away (and not the user).\n\tQPtrList<KopeteAccount> accounts = KopeteAccountManager::manager()->accounts();\n\tfor(KopeteAccount *i=accounts.first() ; i; i=accounts.next() )\n\t{\n\t\tif(i->isConnected() && !i->isAway())\n\t\t{\n\t\t\td->autoAwayAccounts.append(i);\n\t\t\ti->setAway( true, getInstance()->d->awayMessage);\n\t\t}\n\t}\n}\n\n#include \"kopeteaway.moc\"\n\/\/ vim: set et ts=4 sts=4 sw=4:\n<commit_msg>Do not go availiable immediatly if we just gone autoaway<commit_after>\/*\n kopeteaway.cpp - Kopete Away\n\n Copyright (c) 2002 by Hendrik vom Lehn <hvl@linux-4-ever.de>\n Copyright (c) 2003 Olivier Goffart <ogoffart@tiscalinet.be>\n\n Kopete (c) 2002-2003 by the Kopete developers <kopete-devel@kde.org>\n\n *************************************************************************\n * *\n * This library is free software; you can redistribute it and\/or *\n * modify it under the terms of the GNU Lesser General Public *\n * License as published by the Free Software Foundation; either *\n * version 2 of the License, or (at your option) any later version. *\n * *\n *************************************************************************\n*\/\n\n#ifdef HAVE_CONFIG_H\n#include <config.h>\n#endif\n\n#include \"kopeteaway.h\"\n\n#include \"kopeteaccountmanager.h\"\n#include \"kopeteaccount.h\"\n\n#include <kconfig.h>\n#include <qtimer.h>\n#include <kapplication.h>\n\n#include <klocale.h>\n#include <kglobal.h>\n#include <kdebug.h>\n#include <ksettings\/dispatcher.h>\n\n#include <X11\/Xlib.h>\n#include <X11\/Xatom.h>\n#include <X11\/Xresource.h>\n\/\/ The following include is to make --enable-final work\n#include <X11\/Xutil.h>\n\n#ifdef HAVE_XSCREENSAVER\n#define HasScreenSaver\n#include <X11\/extensions\/scrnsaver.h>\n#endif\n\n\/\/ As this is an untested X extension we better leave it off\n#undef HAVE_XIDLE\n#undef HasXidle\n\n\nstruct KopeteAwayPrivate\n{\n\tQString awayMessage;\n\tbool globalAway;\n\tQValueList<KopeteAwayMessage> awayMessageList;\n\tQTime idleTime;\n\tQTimer *timer;\n\tbool autoaway;\n\tbool goAvailable;\n\tint awayTimeout;\n\tbool useAutoAway;\n\tQPtrList<KopeteAccount> autoAwayAccounts;\n\n\tint mouse_x;\n\tint mouse_y;\n\tunsigned int mouse_mask;\n\tWindow root; \/* root window the pointer is on *\/\n\tScreen* screen; \/* screen the pointer is on *\/\n\n\tTime xIdleTime;\n\tbool useXidle;\n\tbool useMit;\n};\n\nKopeteAway *KopeteAway::instance = 0L;\n\nKopeteAway::KopeteAway() : QObject( kapp , \"KopeteAway\")\n{\n\tint dummy = 0;\n\tdummy = dummy; \/\/ shut up\n\n\td = new KopeteAwayPrivate;\n\n\t\/\/ Set up the away messages\n\td->awayMessage = \"\";\n\td->globalAway = false;\n\td->autoaway = false;\n\td->useAutoAway = true;\n\n\t\/\/ Empty the list\n\td->awayMessageList.clear();\n\n\t\/\/ set the XAutoLock info\n\tDisplay *dsp = qt_xdisplay();\n\td->mouse_x = d->mouse_y=0;\n\td->mouse_mask = 0;\n\td->root = DefaultRootWindow (dsp);\n\td->screen = ScreenOfDisplay (dsp, DefaultScreen (dsp));\n\n\td->useXidle = false;\n\td->useMit = false;\n#ifdef HasXidle\n\td->useXidle = XidleQueryExtension(qt_xdisplay(), &dummy, &dummy);\n#endif\n#ifdef HasScreenSaver\n\tif(!d->useXidle)\n\t\td->useMit = XScreenSaverQueryExtension(qt_xdisplay(), &dummy, &dummy);\n#endif\n\td->xIdleTime = 0;\n\n\tif (d->useXidle)\n\t\tkdDebug(14010) << \"using X11 Xidle extension\" << endl;\n\tif(d->useMit)\n\t\tkdDebug(14010) << \"using X11 MIT Screensaver extension\" << endl;\n\n\n\tload();\n\tKSettings::Dispatcher::self()->registerInstance( KGlobal::instance(), this, SLOT( load() ) );\n\t\/\/ Set up the config object\n\tKConfig *config = KGlobal::config();\n\t\/* Load the saved away messages *\/\n\tconfig->setGroup(\"Away Messages\");\n\n\t\/* If Kopete has been run before, this will be true.\n\t* It's only false the first time Kopete is run\n\t*\/\n\tif(config->hasKey(\"Titles\"))\n\t{\n\t\tQStringList titles = config->readListEntry(\"Titles\"); \/\/ Get the titles\n\t\tKopeteAwayMessage temp; \/\/ Temporary away message....\n\t\tfor(QStringList::iterator i = titles.begin(); i != titles.end(); i++)\n\t\t{\n\t\t\ttemp.title = (*i); \/\/ Grab the title from the list of messages\n\t\t\ttemp.message = config->readEntry(temp.title); \/\/ And the message (from disk)\n\t\t\td->awayMessageList.append(temp); \/\/ And add it to the list\n\t\t}\n\t}\n\telse\n\t{\n\t\t\/* There are no away messages, so we'll create a default one *\/\n\t\t\/* Create an away message *\/\n\t\tKopeteAwayMessage temp;\n\t\ttemp.title = i18n(\"Busy\");\n\t\ttemp.message = i18n(\"Sorry, I'm busy right now\");\n\n\t\t\/* Add it to the vector *\/\n\t\td->awayMessageList.append(temp);\n\n\t\ttemp.title = i18n(\"Gone\");\n\t\ttemp.message = i18n(\"I'm gone right now, but I'll be back later\");\n\t\td->awayMessageList.append(temp);\n\n\t\t\/* Save this list to disk *\/\n\t\tsave();\n\t}\n\n\t\/\/ init the timer\n\td->timer = new QTimer(this, \"AwayTimer\");\n\tconnect(d->timer, SIGNAL(timeout()), this, SLOT(slotTimerTimeout()));\n\td->timer->start(4000);\n\n\t\/\/init the time and other\n\tsetActivity();\n}\n\nKopeteAway::~KopeteAway()\n{\n\tdelete d;\n}\n\nQString KopeteAway::message()\n{\n\treturn getInstance()->d->awayMessage;\n}\n\nvoid KopeteAway::setGlobalAwayMessage(const QString &message)\n{\n\tif( !message.isEmpty() )\n\t{\n\t\tkdDebug(14010) << k_funcinfo <<\n\t\t\t\"Setting global away message: \" << message << endl;\n\t\td->awayMessage = message;\n\t}\n}\n\nKopeteAway *KopeteAway::getInstance()\n{\n\tif (!instance)\n\t\tinstance = new KopeteAway;\n\treturn instance;\n}\n\nbool KopeteAway::globalAway()\n{\n\treturn getInstance()->d->globalAway;\n}\n\nvoid KopeteAway::setGlobalAway(bool status)\n{\n\tgetInstance()->d->globalAway = status;\n}\n\nvoid KopeteAway::save()\n{\n\tKConfig *config = KGlobal::config();\n\t\/* Set the away message settings in the Away Messages config group *\/\n\tconfig->setGroup(\"Away Messages\");\n\tQStringList titles;\n\t\/* For each message, keep track of the title, and write out the message *\/\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\ttitles.append((*i).title); \/\/ Append the title to list of titles\n\t\tconfig->writeEntry((*i).title, (*i).message); \/\/ Append Title->message pair to the config\n\t}\n\n\t\/* Write out the titles *\/\n\tconfig->writeEntry(\"Titles\", titles);\n\tconfig->sync();\n}\n\nvoid KopeteAway::load()\n{\n\tKConfig *config = KGlobal::config();\n\tconfig->setGroup(\"AutoAway\");\n\td->awayTimeout=config->readNumEntry(\"Timeout\", 600);\n\td->goAvailable=config->readBoolEntry(\"GoAvailable\", true);\n\td->useAutoAway=config->readBoolEntry(\"UseAutoAway\", true);\n\n}\n\nQStringList KopeteAway::getTitles()\n{\n\tQStringList titles;\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t\ttitles.append((*i).title);\n\n\treturn titles;\n}\n\nQString KopeteAway::getMessage(const QString &title)\n{\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\tif((*i).title == title)\n\t\t\treturn (*i).message;\n\t}\n\n\t\/* Return an empty string if none was found *\/\n\treturn QString::null;\n}\n\nbool KopeteAway::addMessage(const QString &title, const QString &message)\n{\n\tbool found = false;\n\t\/* Check to see if it exists already *\/\n\tfor(QValueList<KopeteAwayMessage>::iterator i = d->awayMessageList.begin(); i != d->awayMessageList.end(); i++)\n\t{\n\t\tif((*i).title == title)\n\t\t{\n\t\t\tfound = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/* If not, add it *\/\n\tif(!found)\n\t{\n\t\tKopeteAwayMessage temp;\n\t\ttemp.title = title;\n\t\ttemp.message = message;\n\t\td->awayMessageList.append(temp);\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KopeteAway::deleteMessage(const QString &title)\n{\n\t\/* Search for the message *\/\n\tQValueList<KopeteAwayMessage>::iterator itemToDelete = d->awayMessageList.begin();\n\twhile( (itemToDelete != d->awayMessageList.end()) && ((*itemToDelete).title != title) )\n\t\titemToDelete++;\n\n\t\/* If it was found, delete it *\/\n\tif(itemToDelete != d->awayMessageList.end())\n\t{\n\t\t\/* Remove it from the config entry, if it's there *\/\n\t\tif(KGlobal::config()->hasKey((*itemToDelete).title))\n\t\t\tKGlobal::config()->deleteEntry((*itemToDelete).title);\n\n\t\t\/* Remove it from the list *\/\n\t\td->awayMessageList.remove(itemToDelete);\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nbool KopeteAway::updateMessage(const QString &title, const QString &message)\n{\n\t\/* Search for the message *\/\n\tQValueList<KopeteAwayMessage>::iterator itemToUpdate = d->awayMessageList.begin();\n\twhile( (itemToUpdate != d->awayMessageList.end()) && ((*itemToUpdate).title != title) )\n\t\titemToUpdate++;\n\n\t\/* If it was found, update it *\/\n\tif(itemToUpdate != d->awayMessageList.end())\n\t{\n\t\t(*itemToUpdate).message = message;\n\t\tsave();\n\t\treturn true;\n\t}\n\telse\n\t{\n\t\treturn false;\n\t}\n}\n\nlong int KopeteAway::idleTime()\n{\n\t\/\/FIXME: the time is reset to zero if more than 24 hours are elapsed\n\t\/\/ we can imagine someone who leave his PC for several weeks\n\treturn (d->idleTime.elapsed() \/ 1000);\n}\n\nvoid KopeteAway::slotTimerTimeout()\n{\n\t\/\/ Copyright (c) 1999 Martin R. Jones <mjones@kde.org>\n\t\/\/\n\t\/\/ KDE screensaver engine\n\t\/\/\n\t\/\/ This module is a heavily modified xautolock.\n\t\/\/ In fact as of KDE 2.0 this code is practically unrecognisable as xautolock.\n\n\tDisplay *dsp = qt_xdisplay();\n\tWindow dummy_w;\n\tint dummy_c;\n\tunsigned int mask; \/* modifier mask *\/\n\tint root_x;\n\tint root_y;\n\n\t\/*\n\t* Find out whether the pointer has moved. Using XQueryPointer for this\n\t* is gross, but it also is the only way never to mess up propagation\n\t* of pointer events.\n\t*\n\t* Remark : Unlike XNextEvent(), XPending () doesn't notice if the\n\t* connection to the server is lost. For this reason, earlier\n\t* versions of xautolock periodically called XNoOp (). But\n\t* why not let XQueryPointer () do the job for us, since\n\t* we now call that periodically anyway?\n\t*\/\n\tif (!XQueryPointer (dsp, d->root, &(d->root), &dummy_w, &root_x, &root_y,\n\t\t\t&dummy_c, &dummy_c, &mask))\n\t{\n\t\t\/*\n\t\t* Pointer has moved to another screen, so let's find out which one.\n\t\t*\/\n\t\tfor (int i = 0; i < ScreenCount(dsp); i++)\n\t\t{\n\t\t\tif (d->root == RootWindow(dsp, i))\n\t\t\t{\n\t\t\t\td->screen = ScreenOfDisplay (dsp, i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/ =================================================================================\n\n\tTime xIdleTime = 0; \/\/ millisecs since last input event\n\n\t#ifdef HasXidle\n\tif (d->useXidle)\n\t{\n\t\tXGetIdleTime(dsp, &xIdleTime);\n\t}\n\telse\n\t#endif \/* HasXIdle *\/\n\n\t{\n\t#ifdef HasScreenSaver\n\t\tif(d->useMit)\n\t\t{\n\t\t\tstatic XScreenSaverInfo* mitInfo = 0;\n\t\t\tif (!mitInfo) mitInfo = XScreenSaverAllocInfo();\n\t\t\tXScreenSaverQueryInfo (dsp, d->root, mitInfo);\n\t\t\txIdleTime = mitInfo->idle;\n\t\t}\n\t#endif \/* HasScreenSaver *\/\n\t}\n\n\t\/\/ =================================================================================\n\n\tif (root_x != d->mouse_x || root_y != d->mouse_y || mask != d->mouse_mask || xIdleTime < d->xIdleTime+2000)\n\t{\n\t\tif(d->mouse_x!=-1) \/\/we just gone autoaway, not activity this time\n\t\t\tsetActivity();\n\t\td->mouse_x = root_x;\n\t\td->mouse_y = root_y;\n\t\td->mouse_mask = mask;\n\t\td->xIdleTime = xIdleTime;\n\t}\n\n\t\/\/ =================================================================================\n\n\tif(!d->autoaway && d->useAutoAway && idleTime() > d->awayTimeout)\n\t{\n\t\tsetAutoAway();\n\t}\n}\n\nvoid KopeteAway::setActivity()\n{\n\/\/\tkdDebug(14010) << k_funcinfo << \"Found activity on desktop, resetting away timer\" << endl;\n\td->idleTime.start();\n\n\tif(d->autoaway)\n\t{\n\t\td->autoaway = false;\n\t\temit activity();\n\t\tif (d->goAvailable)\n\t\t{\n\t\t\td->autoAwayAccounts.setAutoDelete(false);\n\t\t\tfor(KopeteAccount *i=d->autoAwayAccounts.first() ; i; i=d->autoAwayAccounts.current() )\n\t\t\t{\n\t\t\t\tif(i->isConnected() && i->isAway()) {\n\t\t\t\t\ti->setAway(false);\n\t\t\t\t}\n\n\t\t\t\t\/\/ remove() makes the next entry in the list the current one,\n\t\t\t\t\/\/ that's why we use current() above\n\t\t\t\td->autoAwayAccounts.remove();\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid KopeteAway::setAutoAway()\n{\n\td->mouse_x=-1; \/\/do not go availiable automaticaly after\n\n\/\/\tkdDebug(14010) << k_funcinfo << \"Going AutoAway!\" << endl;\n\td->autoaway = true;\n\n\t\/\/ Set all accounts that are not away already to away.\n\t\/\/ We remember them so later we only set the accounts to\n\t\/\/ available that we set to away (and not the user).\n\tQPtrList<KopeteAccount> accounts = KopeteAccountManager::manager()->accounts();\n\tfor(KopeteAccount *i=accounts.first() ; i; i=accounts.next() )\n\t{\n\t\tif(i->isConnected() && !i->isAway())\n\t\t{\n\t\t\td->autoAwayAccounts.append(i);\n\t\t\ti->setAway( true, getInstance()->d->awayMessage);\n\t\t}\n\t}\n}\n\n#include \"kopeteaway.moc\"\n\/\/ vim: set et ts=4 sts=4 sw=4:\n<|endoftext|>"} {"text":"<commit_before>#ifndef MJOLNIR_INPUT_READ_EXTERNAL_POTENTIAL_HPP\n#define MJOLNIR_INPUT_READ_EXTERNAL_POTENTIAL_HPP\n#include <extlib\/toml\/toml.hpp>\n#include <mjolnir\/potential\/external\/ImplicitMembranePotential.hpp>\n#include <mjolnir\/potential\/external\/LennardJonesWallPotential.hpp>\n#include <mjolnir\/potential\/external\/ExcludedVolumeWallPotential.hpp>\n#include <mjolnir\/core\/Topology.hpp>\n#include <mjolnir\/util\/string.hpp>\n#include <mjolnir\/util\/make_unique.hpp>\n#include <mjolnir\/util\/logger.hpp>\n\nnamespace mjolnir\n{\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Potential for External Force Fields\n\/\/ ---------------------------------------------------------------------------\n\ntemplate<typename realT>\nImplicitMembranePotential<realT>\nread_implicit_membrane_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto thickness = toml::find<real_type>(external, \"thickness\");\n const auto magnitude = toml::find<real_type>(external, \"interaction_magnitude\");\n const auto bend = toml::find<real_type>(external, \"bend\");\n\n MJOLNIR_LOG_INFO(\"thickness = \", thickness);\n MJOLNIR_LOG_INFO(\"magnitude = \", magnitude);\n MJOLNIR_LOG_INFO(\"bend = \", bend );\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(ps.size(), \" parameters are found\");\n\n std::vector<real_type> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto h = toml::find<real_type >(param, \"hydrophobicity\");\n if(params.size() <= idx) {params.resize(idx+1, real_type(0.0));}\n params.at(idx) = h;\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", hydrophobicity = \", h);\n }\n return ImplicitMembranePotential<realT>(\n thickness, magnitude, bend, std::move(params));\n}\n\ntemplate<typename realT>\nLennardJonesWallPotential<realT>\nread_lennard_jones_wall_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(ps.size(), \" parameters are found\");\n\n std::vector<std::pair<real_type, real_type>> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto s = toml::expect<real_type>(param, u8\"σ\").or_other(\n toml::expect<real_type>(param, \"sigma\")).unwrap();\n const auto e = toml::expect<real_type>(param, u8\"ε\").or_other(\n toml::expect<real_type>(param, \"epsilon\")).unwrap();\n if(params.size() <= idx)\n {\n params.resize(idx+1, std::make_pair(real_type(0), real_type(0)));\n }\n params.at(idx) = std::make_pair(s, e);\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", sigma = \", s, \", epsilon = \", e);\n }\n return LennardJonesWallPotential<realT>(std::move(params));\n}\n\ntemplate<typename realT>\nExcludedVolumeWallPotential<realT>\nread_excluded_volume_wall_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto eps = toml::expect<real_type>(external, u8\"ε\").or_other(\n toml::expect<real_type>(external, \"epsilon\")).unwrap();\n MJOLNIR_LOG_INFO(\"epsilon = \", eps);\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(\"number of parameters = \", ps.size());\n\n std::vector<real_type> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto rad = toml::find<real_type>(param, \"radius\");\n if(params.size() <= idx) {params.resize(idx+1, real_type(0));}\n params.at(idx) = rad;\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", radius = \", rad);\n }\n return ExcludedVolumeWallPotential<real_type>(eps, std::move(params));\n}\n\n} \/\/ mjolnir\n#endif \/\/ MJOLNIR_READ_EXTERNAL_POTENTIAL_HPP\n<commit_msg>feat: enable to read HarmonicRestraintPotential<commit_after>#ifndef MJOLNIR_INPUT_READ_EXTERNAL_POTENTIAL_HPP\n#define MJOLNIR_INPUT_READ_EXTERNAL_POTENTIAL_HPP\n#include <extlib\/toml\/toml.hpp>\n#include <mjolnir\/potential\/external\/HarmonicRestraintPotential.hpp>\n#include <mjolnir\/potential\/external\/ImplicitMembranePotential.hpp>\n#include <mjolnir\/potential\/external\/LennardJonesWallPotential.hpp>\n#include <mjolnir\/potential\/external\/ExcludedVolumeWallPotential.hpp>\n#include <mjolnir\/core\/Topology.hpp>\n#include <mjolnir\/util\/string.hpp>\n#include <mjolnir\/util\/make_unique.hpp>\n#include <mjolnir\/util\/logger.hpp>\n\nnamespace mjolnir\n{\n\n\/\/ ---------------------------------------------------------------------------\n\/\/ Potential for External Force Fields\n\/\/ ---------------------------------------------------------------------------\n\ntemplate<typename realT>\nImplicitMembranePotential<realT>\nread_implicit_membrane_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto thickness = toml::find<real_type>(external, \"thickness\");\n const auto magnitude = toml::find<real_type>(external, \"interaction_magnitude\");\n const auto bend = toml::find<real_type>(external, \"bend\");\n\n MJOLNIR_LOG_INFO(\"thickness = \", thickness);\n MJOLNIR_LOG_INFO(\"magnitude = \", magnitude);\n MJOLNIR_LOG_INFO(\"bend = \", bend );\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(ps.size(), \" parameters are found\");\n\n std::vector<real_type> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto h = toml::find<real_type >(param, \"hydrophobicity\");\n if(params.size() <= idx) {params.resize(idx+1, real_type(0.0));}\n params.at(idx) = h;\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", hydrophobicity = \", h);\n }\n return ImplicitMembranePotential<realT>(\n thickness, magnitude, bend, std::move(params));\n}\n\ntemplate<typename realT>\nLennardJonesWallPotential<realT>\nread_lennard_jones_wall_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(ps.size(), \" parameters are found\");\n\n std::vector<std::pair<real_type, real_type>> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto s = toml::expect<real_type>(param, u8\"σ\").or_other(\n toml::expect<real_type>(param, \"sigma\")).unwrap();\n const auto e = toml::expect<real_type>(param, u8\"ε\").or_other(\n toml::expect<real_type>(param, \"epsilon\")).unwrap();\n if(params.size() <= idx)\n {\n params.resize(idx+1, std::make_pair(real_type(0), real_type(0)));\n }\n params.at(idx) = std::make_pair(s, e);\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", sigma = \", s, \", epsilon = \", e);\n }\n return LennardJonesWallPotential<realT>(std::move(params));\n}\n\ntemplate<typename realT>\nExcludedVolumeWallPotential<realT>\nread_excluded_volume_wall_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n\n const auto eps = toml::expect<real_type>(external, u8\"ε\").or_other(\n toml::expect<real_type>(external, \"epsilon\")).unwrap();\n MJOLNIR_LOG_INFO(\"epsilon = \", eps);\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(\"number of parameters = \", ps.size());\n\n std::vector<real_type> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto rad = toml::find<real_type>(param, \"radius\");\n if(params.size() <= idx) {params.resize(idx+1, real_type(0));}\n params.at(idx) = rad;\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", radius = \", rad);\n }\n return ExcludedVolumeWallPotential<real_type>(eps, std::move(params));\n}\n\ntemplate<typename realT>\nHarmonicRestraintPotential<realT>\nread_harmonic_restraint_potential(const toml::value& external)\n{\n MJOLNIR_GET_DEFAULT_LOGGER();\n MJOLNIR_LOG_FUNCTION();\n using real_type = realT;\n using potential_type = HarmonicRestraintPotential<real_type>;\n using parameter_type = typename potential_type::parameter_type;\n\n const auto& ps = toml::find<toml::array>(external, \"parameters\");\n MJOLNIR_LOG_INFO(\"number of parameters = \", ps.size());\n\n std::vector<parameter_type> params;\n params.reserve(ps.size());\n for(const auto& param : ps)\n {\n const auto idx = toml::find<std::size_t>(param, \"index\");\n const auto k = toml::find<real_type >(param, \"k\");\n const auto v0 = toml::find<real_type >(param, \"v0\");\n if(params.size() <= idx)\n {\n params.resize(idx+1, parameter_type(0, 0));\n }\n params.at(idx) = parameter_type(k, v0);\n\n MJOLNIR_LOG_INFO(\"idx = \", idx, \", k = \", k, \", v0 = \", v0);\n }\n return HarmonicRestraintPotential<real_type>(std::move(params));\n}\n\n} \/\/ mjolnir\n#endif \/\/ MJOLNIR_READ_EXTERNAL_POTENTIAL_HPP\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2017 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2017 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# include <Siv3D\/Platform.hpp>\n# if defined(SIV3D_TARGET_MACOS) || defined(SIV3D_TARGET_LINUX)\n\n# include <GL\/glew.h>\n# include \"..\/..\/..\/..\/ThirdParty\/GLFW\/include\/GLFW\/glfw3.h\"\n# include \"GLSamplerState.hpp\"\n\nnamespace s3d\n{\n\tnamespace detail\n\t{\n\t\tstatic constexpr GLint minmipTable[4] =\n\t\t{\n\t\t\tGL_NEAREST_MIPMAP_NEAREST,\n\t\t\tGL_NEAREST_MIPMAP_LINEAR,\n\t\t\tGL_LINEAR_MIPMAP_NEAREST,\n\t\t\tGL_LINEAR_MIPMAP_LINEAR\n\t\t};\n\t}\n\t\n\tGLSamplerState::GLSamplerState()\n\t{\n\t\tm_currentStates.fill(NullSamplerState);\n\t}\n\t\n\tvoid GLSamplerState::set(const uint32 slot, const SamplerState& state)\n\t{\n\t\tassert(slot < SamplerState::MaxSamplerCount);\n\t\t\n\t\tif (state == m_currentStates[slot])\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tauto it = m_states.find(state);\n\t\t\n\t\tif (it == m_states.end())\n\t\t{\n\t\t\tit = create(state);\n\t\t\t\n\t\t\tif (it == m_states.end())\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t\n\t\t::glBindSampler(slot, it->second->m_sampler);\n\t\t\n\t\tm_currentStates[slot] = state;\n\t}\n\t\n\tGLSamplerState::SamplerStateList::iterator GLSamplerState::create(const SamplerState& state)\n\t{\n\t\tstd::unique_ptr<SamplerState_GL> samplerState = std::make_unique<SamplerState_GL>();\n\n\t\tconst GLuint sampler = samplerState->m_sampler;\n\t\tstatic const GLfloat border[] = { state.borderColor.x, state.borderColor.y, state.borderColor.z, state.borderColor.w };\n\t\tstatic const GLuint wraps[] = { GL_REPEAT, GL_MIRRORED_REPEAT, GL_CLAMP_TO_EDGE, GL_CLAMP_TO_BORDER };\n\t\t\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_MIN_FILTER,\n\t\t\t\t\t\t\t detail::minmipTable[(static_cast<int32>(state.min) << 1) | (static_cast<int32>(state.mip))]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_MAG_FILTER, static_cast<bool>(state.mag) ? GL_LINEAR : GL_NEAREST);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_S, wraps[static_cast<int32>(state.addressU)]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_T, wraps[static_cast<int32>(state.addressV)]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_R, wraps[static_cast<int32>(state.addressW)]);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_LOD_BIAS, state.lodBias);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_COMPARE_MODE, GL_NONE);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MAX_ANISOTROPY_EXT, state.maxAnisotropy);\n\t\t::glSamplerParameterfv(sampler, GL_TEXTURE_BORDER_COLOR, border);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MIN_LOD, -1000.0f);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MAX_LOD, 1000.0f);\n\t\t\n\t\tif (m_states.size() >= 1024)\n\t\t{\n\t\t\tm_states.clear();\n\t\t}\n\n\t\treturn m_states.emplace(state, std::move(samplerState)).first;\n\t}\n}\n\n# endif\n<commit_msg>GLSamplerState.cppでコンパイルが通らない問題修正<commit_after>\/\/-----------------------------------------------\n\/\/\n\/\/\tThis file is part of the Siv3D Engine.\n\/\/\n\/\/\tCopyright (c) 2008-2017 Ryo Suzuki\n\/\/\tCopyright (c) 2016-2017 OpenSiv3D Project\n\/\/\n\/\/\tLicensed under the MIT License.\n\/\/\n\/\/-----------------------------------------------\n\n# include <Siv3D\/Platform.hpp>\n# if defined(SIV3D_TARGET_MACOS) || defined(SIV3D_TARGET_LINUX)\n\n# include <GL\/glew.h>\n# include \"..\/..\/..\/..\/ThirdParty\/GLFW\/include\/GLFW\/glfw3.h\"\n# include \"GLSamplerState.hpp\"\n\nnamespace s3d\n{\n\tnamespace detail\n\t{\n\t\tstatic constexpr GLint minmipTable[4] =\n\t\t{\n\t\t\tGL_NEAREST_MIPMAP_NEAREST,\n\t\t\tGL_NEAREST_MIPMAP_LINEAR,\n\t\t\tGL_LINEAR_MIPMAP_NEAREST,\n\t\t\tGL_LINEAR_MIPMAP_LINEAR\n\t\t};\n\t}\n\t\n\tGLSamplerState::GLSamplerState()\n\t{\n\t\tm_currentStates.fill(NullSamplerState);\n\t}\n\t\n\tvoid GLSamplerState::set(const uint32 slot, const SamplerState& state)\n\t{\n\t\tassert(slot < SamplerState::MaxSamplerCount);\n\t\t\n\t\tif (state == m_currentStates[slot])\n\t\t{\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tauto it = m_states.find(state);\n\t\t\n\t\tif (it == m_states.end())\n\t\t{\n\t\t\tit = create(state);\n\t\t\t\n\t\t\tif (it == m_states.end())\n\t\t\t{\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\t\n\t\t::glBindSampler(slot, it->second->m_sampler);\n\t\t\n\t\tm_currentStates[slot] = state;\n\t}\n\t\n\tGLSamplerState::SamplerStateList::iterator GLSamplerState::create(const SamplerState& state)\n\t{\n\t\tstd::unique_ptr<SamplerState_GL> samplerState = std::make_unique<SamplerState_GL>();\n\n\t\tconst GLuint sampler = samplerState->m_sampler;\n\t\tstatic const GLfloat border[] = { state.borderColor[0], state.borderColor[1], state.borderColor[2], state.borderColor[3] };\n\t\tstatic const GLuint wraps[] = { GL_REPEAT, GL_MIRRORED_REPEAT, GL_CLAMP_TO_EDGE, GL_CLAMP_TO_BORDER };\n\t\t\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_MIN_FILTER,\n\t\t\t\t\t\t\t detail::minmipTable[(static_cast<int32>(state.min) << 1) | (static_cast<int32>(state.mip))]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_MAG_FILTER, static_cast<bool>(state.mag) ? GL_LINEAR : GL_NEAREST);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_S, wraps[static_cast<int32>(state.addressU)]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_T, wraps[static_cast<int32>(state.addressV)]);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_WRAP_R, wraps[static_cast<int32>(state.addressW)]);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_LOD_BIAS, state.lodBias);\n\t\t::glSamplerParameteri(sampler, GL_TEXTURE_COMPARE_MODE, GL_NONE);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MAX_ANISOTROPY_EXT, state.maxAnisotropy);\n\t\t::glSamplerParameterfv(sampler, GL_TEXTURE_BORDER_COLOR, border);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MIN_LOD, -1000.0f);\n\t\t::glSamplerParameterf(sampler, GL_TEXTURE_MAX_LOD, 1000.0f);\n\t\t\n\t\tif (m_states.size() >= 1024)\n\t\t{\n\t\t\tm_states.clear();\n\t\t}\n\n\t\treturn m_states.emplace(state, std::move(samplerState)).first;\n\t}\n}\n\n# endif\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\/\n\/**\n * @file CellByCellUniformSampling.cpp\n * @author Naohisa Sakamoto\n *\/\n\/*----------------------------------------------------------------------------\n *\n * Copyright (c) Visualization Laboratory, Kyoto University.\n * All rights reserved.\n * See http:\/\/www.viz.media.kyoto-u.ac.jp\/kvs\/copyright\/ for details.\n *\n * $Id: CellByCellUniformSampling.cpp 1792 2014-07-31 04:50:42Z naohisa.sakamoto@gmail.com $\n *\/\n\/****************************************************************************\/\n#include \"CellByCellUniformSampling.h\"\n#include <vector>\n#include <kvs\/OpenMP>\n#include <kvs\/DebugNew>\n#include <kvs\/Camera>\n#include <kvs\/TrilinearInterpolator>\n#include <kvs\/Value>\n#include <kvs\/CellBase>\n#include \"CellByCellSampling.h\"\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling():\n kvs::MapperBase(),\n kvs::PointObject(),\n m_camera( 0 )\n{\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n * @param volume [in] pointer to the volume object\n * @param repetition_level [in] repetition level\n * @param sampling_step [in] sapling step\n * @param transfer_function [in] transfer function\n * @param object_depth [in] depth value of the input volume at the CoG\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling(\n const kvs::VolumeObjectBase* volume,\n const size_t repetition_level,\n const float sampling_step,\n const kvs::TransferFunction& transfer_function,\n const float object_depth ):\n kvs::MapperBase( transfer_function ),\n kvs::PointObject(),\n m_camera( 0 )\n{\n this->setRepetitionLevel( repetition_level );\n this->setSamplingStep( sampling_step );\n this->setObjectDepth( object_depth );\n this->exec( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n * @param camera [in] pointer to the camera\n * @param volume [in] pointer to the volume object\n * @param repetition_level [in] repetition level\n * @param sampling_step [in] sapling step\n * @param transfer_function [in] transfer function\n * @param object_depth [in] depth value of the input volume at the CoG\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling(\n const kvs::Camera* camera,\n const kvs::VolumeObjectBase* volume,\n const size_t repetition_level,\n const float sampling_step,\n const kvs::TransferFunction& transfer_function,\n const float object_depth ):\n kvs::MapperBase( transfer_function ),\n kvs::PointObject()\n{\n this->attachCamera( camera ),\n this->setRepetitionLevel( repetition_level );\n this->setSamplingStep( sampling_step );\n this->setObjectDepth( object_depth );\n this->exec( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Executes the mapper process.\n * @param object [in] pointer to the volume object\n * @return pointer to the point object\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::SuperClass* CellByCellUniformSampling::exec( const kvs::ObjectBase* object )\n{\n if ( !object )\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Input object is NULL.\");\n return NULL;\n }\n\n const kvs::VolumeObjectBase* volume = kvs::VolumeObjectBase::DownCast( object );\n if ( !volume )\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Input object is not volume dat.\");\n return NULL;\n }\n\n bool delete_camera = false;\n if ( !m_camera )\n {\n m_camera = new kvs::Camera();\n delete_camera = true;\n }\n\n const kvs::VolumeObjectBase::VolumeType volume_type = volume->volumeType();\n if ( volume_type == kvs::VolumeObjectBase::Structured )\n {\n this->mapping( kvs::StructuredVolumeObject::DownCast( object ) );\n }\n else \/\/ volume_type == kvs::VolumeObjectBase::Unstructured\n {\n this->mapping( kvs::UnstructuredVolumeObject::DownCast( object ) );\n }\n\n if ( delete_camera )\n {\n delete m_camera;\n m_camera = 0;\n }\n\n return this;\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Mapping for the structured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::mapping( const kvs::StructuredVolumeObject* volume )\n{\n \/\/ Attach the pointer to the volume object and set the min\/max coordinates.\n BaseClass::attachVolume( volume );\n BaseClass::setRange( volume );\n BaseClass::setMinMaxCoords( volume, this );\n\n \/\/ Generate the particles.\n const std::type_info& type = volume->values().typeInfo()->type();\n if ( type == typeid( kvs::Int8 ) ) this->generate_particles<kvs::Int8>( volume );\n else if ( type == typeid( kvs::Int16 ) ) this->generate_particles<kvs::Int16>( volume );\n else if ( type == typeid( kvs::Int32 ) ) this->generate_particles<kvs::Int32>( volume );\n else if ( type == typeid( kvs::UInt8 ) ) this->generate_particles<kvs::UInt8>( volume );\n else if ( type == typeid( kvs::UInt16 ) ) this->generate_particles<kvs::UInt16>( volume );\n else if ( type == typeid( kvs::UInt32 ) ) this->generate_particles<kvs::UInt32>( volume );\n else if ( type == typeid( kvs::Real32 ) ) this->generate_particles<kvs::Real32>( volume );\n else if ( type == typeid( kvs::Real64 ) ) this->generate_particles<kvs::Real64>( volume );\n else\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Unsupported data type '%s'.\", volume->values().typeInfo()->typeName() );\n }\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Mapping for the unstructured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::mapping( const kvs::UnstructuredVolumeObject* volume )\n{\n \/\/ Attach the pointer to the volume object and set the min\/max coordinates.\n BaseClass::attachVolume( volume );\n BaseClass::setRange( volume );\n BaseClass::setMinMaxCoords( volume, this );\n\n \/\/ Generate the particles.\n this->generate_particles( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Generates particles for the structured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\ntemplate <typename T>\nvoid CellByCellUniformSampling::generate_particles( const kvs::StructuredVolumeObject* volume )\n{\n CellByCellSampling::ParticleDensityMap density_map;\n density_map.setSamplingStep( m_sampling_step );\n density_map.attachCamera( m_camera );\n density_map.attachObject( volume );\n density_map.create( BaseClass::transferFunction().opacityMap() );\n\n const kvs::Vec3ui ncells( volume->resolution() - kvs::Vector3ui::All(1) );\n const kvs::ColorMap color_map( BaseClass::transferFunction().colorMap() );\n\n \/\/ Calculate number of particles.\n size_t N = 0;\n kvs::ValueArray<kvs::UInt32> nparticles( ncells.x() * ncells.y() * ncells.z() );\n KVS_OMP_PARALLEL()\n {\n kvs::TrilinearInterpolator interpolator( volume );\n CellByCellSampling::GridSampler<T> sampler( &interpolator, &density_map );\n\n KVS_OMP_FOR( reduction(+:N) )\n for ( kvs::UInt32 z = 0; z < ncells.z(); ++z )\n {\n size_t cell_index_counter = z * ncells.x() * ncells.y();\n for ( kvs::UInt32 y = 0; y < ncells.y(); ++y )\n {\n for ( kvs::UInt32 x = 0; x < ncells.x(); ++x )\n {\n sampler.bind( kvs::Vec3ui( x, y, z ) );\n const size_t n = sampler.numberOfParticles();\n const kvs::UInt32 index = cell_index_counter++;\n nparticles[index] = n;\n N += n;\n }\n }\n }\n }\n\n \/\/ Genrate a set of particles.\n const kvs::UInt32 repetitions = m_repetition_level;\n kvs::ValueArray<kvs::Real32> coords( 3 * N * repetitions );\n kvs::ValueArray<kvs::Real32> normals( 3 * N * repetitions );\n kvs::ValueArray<kvs::UInt8> colors( 3 * N * repetitions );\n KVS_OMP_PARALLEL()\n {\n kvs::TrilinearInterpolator interpolator( volume );\n CellByCellSampling::GridSampler<T> sampler( &interpolator, &density_map );\n\n KVS_OMP_FOR( schedule(dynamic) )\n for ( kvs::UInt32 r = 0; r < repetitions; ++r )\n {\n size_t cell_index_counter = 0;\n size_t particle_index_counter = N * r;\n for ( kvs::UInt32 z = 0; z < ncells.z(); ++z )\n {\n for ( kvs::UInt32 y = 0; y < ncells.y(); ++y )\n {\n for ( kvs::UInt32 x = 0; x < ncells.x(); ++x )\n {\n const kvs::UInt32 index = cell_index_counter++;\n const size_t n = nparticles[index];\n if ( n == 0 ) continue;\n\n sampler.bind( kvs::Vec3ui( x, y, z ) );\n for ( size_t i = 0; i < n; ++i )\n {\n sampler.sample();\n const CellByCellSampling::Particle& p = sampler.accept();\n const kvs::RGBColor color = color_map.at( p.scalar );\n const size_t index3 = ( particle_index_counter++ ) * 3;\n coords[ index3 + 0 ] = p.coord.x();\n coords[ index3 + 1 ] = p.coord.y();\n coords[ index3 + 2 ] = p.coord.z();\n normals[ index3 + 0 ] = p.normal.x();\n normals[ index3 + 1 ] = p.normal.y();\n normals[ index3 + 2 ] = p.normal.z();\n colors[ index3 + 0 ] = color.r();\n colors[ index3 + 1 ] = color.g();\n colors[ index3 + 2 ] = color.b();\n }\n }\n }\n }\n }\n }\n\n SuperClass::setCoords( coords );\n SuperClass::setColors( colors );\n SuperClass::setNormals( normals );\n SuperClass::setSize( 1.0f );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Generates particles for the unstructured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::generate_particles( const kvs::UnstructuredVolumeObject* volume )\n{\n CellByCellSampling::ParticleDensityMap density_map;\n density_map.setSamplingStep( m_sampling_step );\n density_map.attachCamera( m_camera );\n density_map.attachObject( volume );\n density_map.create( BaseClass::transferFunction().opacityMap() );\n\n const size_t ncells = volume->numberOfCells();\n const kvs::ColorMap color_map( BaseClass::transferFunction().colorMap() );\n\n \/\/ Calculate number of particles\n size_t N = 0;\n kvs::ValueArray<kvs::UInt32> nparticles( ncells );\n KVS_OMP_PARALLEL()\n {\n kvs::CellBase* cell = CellByCellSampling::Cell( volume );\n CellByCellSampling::CellSampler sampler( cell, &density_map );\n\n KVS_OMP_FOR( reduction(+:N) )\n for ( size_t index = 0; index < ncells; ++index )\n {\n sampler.bind( index );\n const size_t n = sampler.numberOfParticles();\n nparticles[index] = n;\n\n N += n;\n }\n\n delete cell;\n }\n\n \/\/ Generate particles\n const kvs::UInt32 repetitions = m_repetition_level;\n kvs::ValueArray<kvs::Real32> coords( 3 * N * repetitions );\n kvs::ValueArray<kvs::Real32> normals( 3 * N * repetitions );\n kvs::ValueArray<kvs::UInt8> colors( 3 * N * repetitions );\n KVS_OMP_PARALLEL()\n {\n kvs::CellBase* cell = CellByCellSampling::Cell( volume );\n CellByCellSampling::CellSampler sampler( cell, &density_map );\n\n KVS_OMP_FOR( schedule(dynamic) )\n for ( kvs::UInt32 r = 0; r < repetitions; ++r )\n {\n size_t particle_index_counter = N * r;\n for ( size_t index = 0; index < ncells; ++index )\n {\n const size_t n = nparticles[index];\n if ( n == 0 ) continue;\n\n sampler.bind( index );\n for ( size_t i = 0; i < n; ++i )\n {\n sampler.sample();\n const CellByCellSampling::Particle& p = sampler.accept();\n const kvs::RGBColor color = color_map.at( p.scalar );\n const size_t index3 = ( particle_index_counter++ ) * 3;\n coords[ index3 + 0 ] = p.coord.x();\n coords[ index3 + 1 ] = p.coord.y();\n coords[ index3 + 2 ] = p.coord.z();\n normals[ index3 + 0 ] = p.normal.x();\n normals[ index3 + 1 ] = p.normal.y();\n normals[ index3 + 2 ] = p.normal.z();\n colors[ index3 + 0 ] = color.r();\n colors[ index3 + 1 ] = color.g();\n colors[ index3 + 2 ] = color.b();\n }\n }\n }\n\n delete cell;\n }\n\n SuperClass::setCoords( coords );\n SuperClass::setColors( colors );\n SuperClass::setNormals( normals );\n SuperClass::setSize( 1.0f );\n}\n\n} \/\/ end of namespace kvs\n<commit_msg>Modified.<commit_after>\/****************************************************************************\/\n\/**\n * @file CellByCellUniformSampling.cpp\n * @author Naohisa Sakamoto\n *\/\n\/*----------------------------------------------------------------------------\n *\n * Copyright (c) Visualization Laboratory, Kyoto University.\n * All rights reserved.\n * See http:\/\/www.viz.media.kyoto-u.ac.jp\/kvs\/copyright\/ for details.\n *\n * $Id: CellByCellUniformSampling.cpp 1792 2014-07-31 04:50:42Z naohisa.sakamoto@gmail.com $\n *\/\n\/****************************************************************************\/\n#include \"CellByCellUniformSampling.h\"\n#include <vector>\n#include <kvs\/OpenMP>\n#include <kvs\/DebugNew>\n#include <kvs\/Camera>\n#include <kvs\/TrilinearInterpolator>\n#include <kvs\/Value>\n#include <kvs\/CellBase>\n#include \"CellByCellSampling.h\"\n\n\nnamespace kvs\n{\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling():\n kvs::MapperBase(),\n kvs::PointObject(),\n m_camera( 0 )\n{\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n * @param volume [in] pointer to the volume object\n * @param repetition_level [in] repetition level\n * @param sampling_step [in] sapling step\n * @param transfer_function [in] transfer function\n * @param object_depth [in] depth value of the input volume at the CoG\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling(\n const kvs::VolumeObjectBase* volume,\n const size_t repetition_level,\n const float sampling_step,\n const kvs::TransferFunction& transfer_function,\n const float object_depth ):\n kvs::MapperBase( transfer_function ),\n kvs::PointObject(),\n m_camera( 0 )\n{\n this->setRepetitionLevel( repetition_level );\n this->setSamplingStep( sampling_step );\n this->setObjectDepth( object_depth );\n this->exec( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Constructs a new CellByCellUniformSampling class.\n * @param camera [in] pointer to the camera\n * @param volume [in] pointer to the volume object\n * @param repetition_level [in] repetition level\n * @param sampling_step [in] sapling step\n * @param transfer_function [in] transfer function\n * @param object_depth [in] depth value of the input volume at the CoG\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::CellByCellUniformSampling(\n const kvs::Camera* camera,\n const kvs::VolumeObjectBase* volume,\n const size_t repetition_level,\n const float sampling_step,\n const kvs::TransferFunction& transfer_function,\n const float object_depth ):\n kvs::MapperBase( transfer_function ),\n kvs::PointObject()\n{\n this->attachCamera( camera ),\n this->setRepetitionLevel( repetition_level );\n this->setSamplingStep( sampling_step );\n this->setObjectDepth( object_depth );\n this->exec( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Executes the mapper process.\n * @param object [in] pointer to the volume object\n * @return pointer to the point object\n *\/\n\/*===========================================================================*\/\nCellByCellUniformSampling::SuperClass* CellByCellUniformSampling::exec( const kvs::ObjectBase* object )\n{\n if ( !object )\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Input object is NULL.\");\n return NULL;\n }\n\n const kvs::VolumeObjectBase* volume = kvs::VolumeObjectBase::DownCast( object );\n if ( !volume )\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Input object is not volume dat.\");\n return NULL;\n }\n\n bool delete_camera = false;\n if ( !m_camera )\n {\n m_camera = new kvs::Camera();\n delete_camera = true;\n }\n\n const kvs::VolumeObjectBase::VolumeType volume_type = volume->volumeType();\n if ( volume_type == kvs::VolumeObjectBase::Structured )\n {\n this->mapping( kvs::StructuredVolumeObject::DownCast( object ) );\n }\n else \/\/ volume_type == kvs::VolumeObjectBase::Unstructured\n {\n this->mapping( kvs::UnstructuredVolumeObject::DownCast( object ) );\n }\n\n if ( delete_camera )\n {\n delete m_camera;\n m_camera = 0;\n }\n\n return this;\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Mapping for the structured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::mapping( const kvs::StructuredVolumeObject* volume )\n{\n \/\/ Attach the pointer to the volume object and set the min\/max coordinates.\n BaseClass::attachVolume( volume );\n BaseClass::setRange( volume );\n BaseClass::setMinMaxCoords( volume, this );\n\n \/\/ Generate the particles.\n const std::type_info& type = volume->values().typeInfo()->type();\n if ( type == typeid( kvs::Int8 ) ) this->generate_particles<kvs::Int8>( volume );\n else if ( type == typeid( kvs::Int16 ) ) this->generate_particles<kvs::Int16>( volume );\n else if ( type == typeid( kvs::Int32 ) ) this->generate_particles<kvs::Int32>( volume );\n else if ( type == typeid( kvs::UInt8 ) ) this->generate_particles<kvs::UInt8>( volume );\n else if ( type == typeid( kvs::UInt16 ) ) this->generate_particles<kvs::UInt16>( volume );\n else if ( type == typeid( kvs::UInt32 ) ) this->generate_particles<kvs::UInt32>( volume );\n else if ( type == typeid( kvs::Real32 ) ) this->generate_particles<kvs::Real32>( volume );\n else if ( type == typeid( kvs::Real64 ) ) this->generate_particles<kvs::Real64>( volume );\n else\n {\n BaseClass::setSuccess( false );\n kvsMessageError(\"Unsupported data type '%s'.\", volume->values().typeInfo()->typeName() );\n }\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Mapping for the unstructured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::mapping( const kvs::UnstructuredVolumeObject* volume )\n{\n \/\/ Attach the pointer to the volume object and set the min\/max coordinates.\n BaseClass::attachVolume( volume );\n BaseClass::setRange( volume );\n BaseClass::setMinMaxCoords( volume, this );\n\n \/\/ Generate the particles.\n this->generate_particles( volume );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Generates particles for the structured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\ntemplate <typename T>\nvoid CellByCellUniformSampling::generate_particles( const kvs::StructuredVolumeObject* volume )\n{\n CellByCellSampling::ParticleDensityMap density_map;\n density_map.setSamplingStep( m_sampling_step );\n density_map.attachCamera( m_camera );\n density_map.attachObject( volume );\n density_map.create( BaseClass::transferFunction().opacityMap() );\n\n const kvs::Vec3ui ncells( volume->resolution() - kvs::Vector3ui::All(1) );\n const kvs::ColorMap color_map( BaseClass::transferFunction().colorMap() );\n\n kvs::TrilinearInterpolator interpolator( volume );\n CellByCellSampling::GridSampler<T> sampler( &interpolator, &density_map );\n\n \/\/ Calculate number of particles.\n size_t N = 0;\n kvs::ValueArray<kvs::UInt32> nparticles( ncells.x() * ncells.y() * ncells.z() );\n KVS_OMP_PARALLEL()\n {\n\/\/ kvs::TrilinearInterpolator interpolator( volume );\n\/\/ CellByCellSampling::GridSampler<T> sampler( &interpolator, &density_map );\n\n KVS_OMP_FOR( reduction(+:N) )\n for ( kvs::UInt32 z = 0; z < ncells.z(); ++z )\n {\n size_t cell_index_counter = z * ncells.x() * ncells.y();\n for ( kvs::UInt32 y = 0; y < ncells.y(); ++y )\n {\n for ( kvs::UInt32 x = 0; x < ncells.x(); ++x )\n {\n sampler.bind( kvs::Vec3ui( x, y, z ) );\n const size_t n = sampler.numberOfParticles();\n const kvs::UInt32 index = cell_index_counter++;\n nparticles[index] = n;\n N += n;\n }\n }\n }\n }\n\n \/\/ Genrate a set of particles.\n const kvs::UInt32 repetitions = m_repetition_level;\n kvs::ValueArray<kvs::Real32> coords( 3 * N * repetitions );\n kvs::ValueArray<kvs::Real32> normals( 3 * N * repetitions );\n kvs::ValueArray<kvs::UInt8> colors( 3 * N * repetitions );\n KVS_OMP_PARALLEL()\n {\n\/\/ kvs::TrilinearInterpolator interpolator( volume );\n\/\/ CellByCellSampling::GridSampler<T> sampler( &interpolator, &density_map );\n\n KVS_OMP_FOR( schedule(dynamic) )\n for ( kvs::UInt32 r = 0; r < repetitions; ++r )\n {\n size_t cell_index_counter = 0;\n size_t particle_index_counter = N * r;\n for ( kvs::UInt32 z = 0; z < ncells.z(); ++z )\n {\n for ( kvs::UInt32 y = 0; y < ncells.y(); ++y )\n {\n for ( kvs::UInt32 x = 0; x < ncells.x(); ++x )\n {\n const kvs::UInt32 index = cell_index_counter++;\n const size_t n = nparticles[index];\n if ( n == 0 ) continue;\n\n sampler.bind( kvs::Vec3ui( x, y, z ) );\n for ( size_t i = 0; i < n; ++i )\n {\n sampler.sample();\n const CellByCellSampling::Particle& p = sampler.accept();\n const kvs::RGBColor color = color_map.at( p.scalar );\n const size_t index3 = ( particle_index_counter++ ) * 3;\n coords[ index3 + 0 ] = p.coord.x();\n coords[ index3 + 1 ] = p.coord.y();\n coords[ index3 + 2 ] = p.coord.z();\n normals[ index3 + 0 ] = p.normal.x();\n normals[ index3 + 1 ] = p.normal.y();\n normals[ index3 + 2 ] = p.normal.z();\n colors[ index3 + 0 ] = color.r();\n colors[ index3 + 1 ] = color.g();\n colors[ index3 + 2 ] = color.b();\n }\n }\n }\n }\n }\n }\n\n SuperClass::setCoords( coords );\n SuperClass::setColors( colors );\n SuperClass::setNormals( normals );\n SuperClass::setSize( 1.0f );\n}\n\n\/*===========================================================================*\/\n\/**\n * @brief Generates particles for the unstructured volume object.\n * @param volume [in] pointer to the input volume object\n *\/\n\/*===========================================================================*\/\nvoid CellByCellUniformSampling::generate_particles( const kvs::UnstructuredVolumeObject* volume )\n{\n CellByCellSampling::ParticleDensityMap density_map;\n density_map.setSamplingStep( m_sampling_step );\n density_map.attachCamera( m_camera );\n density_map.attachObject( volume );\n density_map.create( BaseClass::transferFunction().opacityMap() );\n\n const size_t ncells = volume->numberOfCells();\n const kvs::ColorMap color_map( BaseClass::transferFunction().colorMap() );\n\n kvs::CellBase* cell = CellByCellSampling::Cell( volume );\n CellByCellSampling::CellSampler sampler( cell, &density_map );\n\n \/\/ Calculate number of particles\n size_t N = 0;\n kvs::ValueArray<kvs::UInt32> nparticles( ncells );\n KVS_OMP_PARALLEL()\n {\n\/\/ kvs::CellBase* cell = CellByCellSampling::Cell( volume );\n\/\/ CellByCellSampling::CellSampler sampler( cell, &density_map );\n\n KVS_OMP_FOR( reduction(+:N) )\n for ( size_t index = 0; index < ncells; ++index )\n {\n sampler.bind( index );\n const size_t n = sampler.numberOfParticles();\n nparticles[index] = n;\n\n N += n;\n }\n\n\/\/ delete cell;\n }\n\n \/\/ Generate particles\n const kvs::UInt32 repetitions = m_repetition_level;\n kvs::ValueArray<kvs::Real32> coords( 3 * N * repetitions );\n kvs::ValueArray<kvs::Real32> normals( 3 * N * repetitions );\n kvs::ValueArray<kvs::UInt8> colors( 3 * N * repetitions );\n KVS_OMP_PARALLEL()\n {\n\/\/ kvs::CellBase* cell = CellByCellSampling::Cell( volume );\n\/\/ CellByCellSampling::CellSampler sampler( cell, &density_map );\n\n KVS_OMP_FOR( schedule(dynamic) )\n for ( kvs::UInt32 r = 0; r < repetitions; ++r )\n {\n size_t particle_index_counter = N * r;\n for ( size_t index = 0; index < ncells; ++index )\n {\n const size_t n = nparticles[index];\n if ( n == 0 ) continue;\n\n sampler.bind( index );\n for ( size_t i = 0; i < n; ++i )\n {\n sampler.sample();\n const CellByCellSampling::Particle& p = sampler.accept();\n const kvs::RGBColor color = color_map.at( p.scalar );\n const size_t index3 = ( particle_index_counter++ ) * 3;\n coords[ index3 + 0 ] = p.coord.x();\n coords[ index3 + 1 ] = p.coord.y();\n coords[ index3 + 2 ] = p.coord.z();\n normals[ index3 + 0 ] = p.normal.x();\n normals[ index3 + 1 ] = p.normal.y();\n normals[ index3 + 2 ] = p.normal.z();\n colors[ index3 + 0 ] = color.r();\n colors[ index3 + 1 ] = color.g();\n colors[ index3 + 2 ] = color.b();\n }\n }\n }\n\n\/\/ delete cell;\n }\n\n delete cell;\n\n SuperClass::setCoords( coords );\n SuperClass::setColors( colors );\n SuperClass::setNormals( normals );\n SuperClass::setSize( 1.0f );\n}\n\n} \/\/ end of namespace kvs\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n#include <cstdint>\n#include <memory>\n#include <Utility\/Utilities\/Include\/Memory\/Circlebuffer\/StaticData.hpp>\n#include <Utility\/Utilities\/Include\/PointerArithmetic\/PointerArithmetic.hpp>\n#include <mutex>\n#include <Utility\/Utilities\/Include\/IO\/Mutex\/Mutex.hpp>\n#include <Utility\/Utilities\/Include\/Memory\/Circlebuffer\/CircleBufferHeader.hpp>\n#include <string>\n\nnamespace Doremi\n{\n namespace Utilities\n {\n namespace Memory\n {\n template <typename T> class CircleBuffer\n {\n public:\n \/**\n TODO docs\n *\/\n CircleBuffer()\n : m_data(nullptr),\n m_rawBufferPointerStart(nullptr),\n m_rawBufferPointerEnd(nullptr),\n m_adjustedBufferPointerStart(nullptr),\n m_adjustedBufferPointerEnd(nullptr),\n m_rawBufferSize(0),\n m_adjustedBufferSize(0),\n m_internalMemoryManagement(true),\n m_alreadyInitialized(false),\n m_maxContainedObjects(0),\n m_mutex(nullptr),\n m_sizeOfOneObject(0)\n {\n }\n\n \/**\n TODO docs\n *\/\n virtual ~CircleBuffer()\n {\n if(m_internalMemoryManagement)\n {\n free(m_rawBufferPointerStart);\n }\n }\n\n \/**\n The useable size of the buffer will be p_bufferSize - sizeof(StaticData).\n Each object will allocate sizeof(T) + sizeof(CircleBufferHeader) each\n *\/\n void Initialize(const size_t& p_bufferSize, IO::Mutex* p_mutex = nullptr)\n {\n AssertInitialize(p_bufferSize);\n m_rawBufferSize = p_bufferSize;\n m_mutex = p_mutex;\n m_rawBufferPointerStart = malloc(m_rawBufferSize);\n SetupVariables();\n }\n \/**\n The useable size of the buffer will be p_bufferSize - sizeof(StaticData)\n Each object will allocate sizeof(T) + sizeof(CircleBufferHeader) each\n *\/\n void Initialize(void* const p_preAllocatedBuffer, const size_t& p_bufferSize, IO::Mutex* p_mutex = nullptr)\n {\n AssertInitialize(p_bufferSize);\n m_rawBufferSize = p_bufferSize;\n m_rawBufferPointerStart = p_preAllocatedBuffer;\n m_mutex = p_mutex;\n m_internalMemoryManagement = false;\n SetupVariables();\n }\n\n \/**\n Threadsafe, internal loackage\n *\/\n bool Produce(const CircleBufferHeader& p_Header, const T* const p_data) \/\/ TODORT, does this not trigger\n {\n \/\/\/\/ Internal lockage\n \/\/ std::lock_guard<std::mutex> lock(m_produceLock);\n\n \/\/\/\/ Find if it is possible to produce more\n \/\/\/\/ Does not require to lock metadata under the assumption that when circlebuffers communicate via IPC one side is only producer\n \/\/\/\/ and the other side is only comsumer.\n \/\/\/\/ And as this part is already locked with internal lockage above\n \/\/ if(m_data->currentObjectCount < m_maxContainedObjects)\n \/\/{\n \/\/ \/\/ Local head\n \/\/ void* head = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_data->currentHeadOffset);\n\n \/\/ \/\/ Check if current pointer is outside our scope.\n \/\/ if(PointerArithmetic::AssertAdresstInside(head, m_adjustedBufferPointerStart, m_adjustedBufferPointerEnd) == false)\n \/\/ {\n \/\/ head = m_adjustedBufferPointerStart; \/\/ If so, reset to first part.\n \/\/ }\n\n \/\/ \/\/\/\/ Produce is ok\n \/\/ \/\/ Copy metaheader to current_head\n \/\/ memcpy(head, &p_Header, sizeof(CircleBufferHeader));\n\n \/\/ \/\/ Move head to after metaheader\n \/\/ head = PointerArithmetic::Addition(head, sizeof(CircleBufferHeader));\n\n \/\/ \/\/ Copy data to head\n \/\/ memcpy(head, p_data, p_Header.packageSize);\n\n \/\/ \/\/ Move head to after data\n \/\/ head = PointerArithmetic::Addition(head, p_Header.packageSize);\n\n \/\/ \/\/ Update global head\n \/\/ m_data->currentHeadOffset = PointerArithmetic::Difference(m_adjustedBufferPointerStart, head);\n\n \/\/ \/\/ Filemap lock\n \/\/ LockMetaData();\n\n \/\/ \/\/ Update object count\n \/\/ m_data->currentObjectCount++;\n\n \/\/ \/\/ Unlock filemap\n \/\/ UnLockMetaData();\n\n \/\/ \/\/ Complete\n \/\/ return true;\n \/\/}\n \/\/ else\n \/\/{\n \/\/ \/\/ Failed\n \/\/ return false;\n \/\/}\n return true;\n }\n\n \/**\n Not threadsafe\n *\/\n bool Consume(CircleBufferHeader*& out_header, T*& out_data)\n {\n \/\/\/\/ Internal lockage\n \/\/ std::lock_guard<std::mutex> lock(m_consumeLock);\n\n \/\/\/\/ Find if it is possible to consume anything\n \/\/\/\/ Does not require to lock metadata under the assumption that when circlebuffers communicate via IPC one side is only producer\n \/\/\/\/ and the other side is only comsumer.\n \/\/\/\/ And as this part is already locked with internal lockage above\n \/\/ if(m_data->currentObjectCount > 0)\n \/\/{\n \/\/ \/\/ Local tail\n \/\/ void* tail = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_data->currentTailOffset);\n\n \/\/ \/\/ Check if current pointer is outside our scope.\n \/\/ if(PointerArithmetic::AssertAdresstInside(tail, m_adjustedBufferPointerStart, m_adjustedBufferPointerEnd) == false)\n \/\/ {\n \/\/ tail = m_adjustedBufferPointerStart; \/\/ If so, reset to first part.\n \/\/ }\n\n \/\/ \/\/\/\/ Produce is ok\n \/\/ \/\/ Copy metaheader to current_head\n \/\/ memcpy(out_header, tail, sizeof(CircleBufferHeader));\n\n \/\/ \/\/ Move header to after metaheader\n \/\/ tail = PointerArithmetic::Addition(tail, sizeof(CircleBufferHeader));\n\n \/\/ \/\/ Copy data to current:_head\n \/\/ memcpy(out_data, tail, out_header->packageSize);\n\n \/\/ \/\/ Move header to after data\n \/\/ tail = PointerArithmetic::Addition(tail, out_header->packageSize);\n\n \/\/ \/\/ Update global tail\n \/\/ m_data->currentTailOffset = PointerArithmetic::Difference(m_adjustedBufferPointerStart, tail);\n\n \/\/ \/\/ Filemap lock\n \/\/ LockMetaData();\n\n \/\/ \/\/ Update object count\n \/\/ m_data->currentObjectCount--;\n\n \/\/ \/\/ Unlock filemap\n \/\/ UnLockMetaData();\n\n \/\/ return true;\n \/\/}\n \/\/ else\n \/\/{\n \/\/ \/\/ Nothing to do\n \/\/ return false;\n \/\/}\n return true;\n }\n\n protected:\n void CircleBuffer::AssertInitialize(const size_t& p_bufferSize)\n {\n m_sizeOfOneObject = sizeof(T) + sizeof(CircleBufferHeader);\n if(m_sizeOfOneObject > (p_bufferSize - sizeof(StaticData)))\n {\n const std::string errorMessage =\n std::string(\"Not enough space. Each object will take up sizeof(T) + sizeof(CircleBufferHeader) which is \" +\n std::to_string(sizeof(T)) + \"+\" + std::to_string(sizeof(CircleBufferHeader)) + \"=\" +\n std::to_string(m_sizeOfOneObject) + \". This buffer only has access to \" + std::to_string(p_bufferSize) + \"-\" +\n std::to_string(sizeof(StaticData)) + \"=\" + std::to_string(p_bufferSize - sizeof(StaticData)));\n throw std::runtime_error(errorMessage);\n }\n if(m_alreadyInitialized)\n {\n throw std::runtime_error(\"Already initialized.\");\n }\n }\n\n void CircleBuffer::LockMetaData()\n {\n if(m_mutex != nullptr)\n {\n m_mutex->AttemptLock();\n }\n }\n\n void CircleBuffer::UnLockMetaData()\n {\n if(m_mutex != nullptr)\n {\n m_mutex->Unlock();\n }\n }\n\n void CircleBuffer::ComputeAdjustments()\n {\n m_adjustedBufferSize = m_rawBufferSize - sizeof(StaticData);\n m_adjustedBufferSize = (m_adjustedBufferSize \/ m_sizeOfOneObject) * m_sizeOfOneObject;\n\n m_adjustedBufferPointerStart = PointerArithmetic::Addition(m_rawBufferPointerStart, sizeof(StaticData));\n m_adjustedBufferPointerEnd = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_adjustedBufferSize);\n }\n\n void CircleBuffer::ComputeMaxObjects() { m_maxContainedObjects = m_adjustedBufferSize \/ m_sizeOfOneObject; }\n\n void CircleBuffer::SetupVariables()\n {\n m_alreadyInitialized = true;\n m_rawBufferPointerEnd = PointerArithmetic::Addition(m_rawBufferPointerStart, m_rawBufferSize);\n ComputeAdjustments();\n ComputeMaxObjects();\n m_data = static_cast<StaticData*>(m_rawBufferPointerStart);\n\n \/\/ TODORT\n \/\/ LockMetaData In a very specific state both processes may come here at about the same time.\n \/\/ However, that should not be a problem. If they're almost here at the same no data should be lost.\n if(m_data->started != STARTED)\n {\n *m_data = StaticData();\n m_data->currentTailOffset = 0;\n m_data->currentHeadOffset = 0;\n }\n \/\/ TODORT\n \/\/ UnLockMetaData\n }\n\n StaticData* m_data;\n void* m_rawBufferPointerStart;\n void* m_rawBufferPointerEnd;\n void* m_adjustedBufferPointerStart;\n void* m_adjustedBufferPointerEnd;\n size_t m_rawBufferSize;\n size_t m_adjustedBufferSize;\n bool m_internalMemoryManagement;\n std::mutex m_produceLock;\n std::mutex m_consumeLock;\n bool m_alreadyInitialized;\n size_t m_maxContainedObjects;\n IO::Mutex* m_mutex;\n size_t m_sizeOfOneObject;\n };\n }\n }\n}<commit_msg>Readded circlebuffer code ;_;<commit_after>#pragma once\n#include <cstdint>\n#include <memory>\n#include <Utility\/Utilities\/Include\/Memory\/Circlebuffer\/StaticData.hpp>\n#include <Utility\/Utilities\/Include\/PointerArithmetic\/PointerArithmetic.hpp>\n#include <mutex>\n#include <Utility\/Utilities\/Include\/IO\/Mutex\/Mutex.hpp>\n#include <Utility\/Utilities\/Include\/Memory\/Circlebuffer\/CircleBufferHeader.hpp>\n#include <string>\n\nnamespace Doremi\n{\n namespace Utilities\n {\n namespace Memory\n {\n template <typename T> class CircleBuffer\n {\n public:\n \/**\n TODO docs\n *\/\n CircleBuffer()\n : m_data(nullptr),\n m_rawBufferPointerStart(nullptr),\n m_rawBufferPointerEnd(nullptr),\n m_adjustedBufferPointerStart(nullptr),\n m_adjustedBufferPointerEnd(nullptr),\n m_rawBufferSize(0),\n m_adjustedBufferSize(0),\n m_internalMemoryManagement(true),\n m_alreadyInitialized(false),\n m_maxContainedObjects(0),\n m_mutex(nullptr),\n m_sizeOfOneObject(0)\n {\n }\n\n \/**\n TODO docs\n *\/\n virtual ~CircleBuffer()\n {\n if(m_internalMemoryManagement)\n {\n free(m_rawBufferPointerStart);\n }\n }\n\n \/**\n The useable size of the buffer will be p_bufferSize - sizeof(StaticData).\n Each object will allocate sizeof(T) + sizeof(CircleBufferHeader) each\n *\/\n void Initialize(const size_t& p_bufferSize, IO::Mutex* p_mutex = nullptr)\n {\n AssertInitialize(p_bufferSize);\n m_rawBufferSize = p_bufferSize;\n m_mutex = p_mutex;\n m_rawBufferPointerStart = malloc(m_rawBufferSize);\n SetupVariables();\n }\n \/**\n The useable size of the buffer will be p_bufferSize - sizeof(StaticData)\n Each object will allocate sizeof(T) + sizeof(CircleBufferHeader) each\n *\/\n void Initialize(void* const p_preAllocatedBuffer, const size_t& p_bufferSize, IO::Mutex* p_mutex = nullptr)\n {\n AssertInitialize(p_bufferSize);\n m_rawBufferSize = p_bufferSize;\n m_rawBufferPointerStart = p_preAllocatedBuffer;\n m_mutex = p_mutex;\n m_internalMemoryManagement = false;\n SetupVariables();\n }\n\n \/**\n Threadsafe, internal loackage\n *\/\n bool Produce(const CircleBufferHeader& p_Header, const T* const p_data) \/\/ TODORT, does this not trigger\n {\n \/\/ Internal lockage\n std::lock_guard<std::mutex> lock(m_produceLock);\n\n \/\/ Find if it is possible to produce more\n \/\/ Does not require to lock metadata under the assumption that when circlebuffers communicate via IPC one side is only producer\n \/\/ and the other side is only comsumer.\n \/\/ And as this part is already locked with internal lockage above\n if(m_data->currentObjectCount < m_maxContainedObjects)\n {\n \/\/ Local head\n void* head = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_data->currentHeadOffset);\n\n \/\/ Check if current pointer is outside our scope.\n if(PointerArithmetic::AssertAdresstInside(head, m_adjustedBufferPointerStart, m_adjustedBufferPointerEnd) == false)\n {\n head = m_adjustedBufferPointerStart; \/\/ If so, reset to first part.\n }\n\n \/\/\/\/ Produce is ok\n \/\/ Copy metaheader to current_head\n memcpy(head, &p_Header, sizeof(CircleBufferHeader));\n\n \/\/ Move head to after metaheader\n head = PointerArithmetic::Addition(head, sizeof(CircleBufferHeader));\n\n \/\/ Copy data to head\n memcpy(head, p_data, p_Header.packageSize);\n\n \/\/ Move head to after data\n head = PointerArithmetic::Addition(head, p_Header.packageSize);\n\n \/\/ Update global head\n m_data->currentHeadOffset = PointerArithmetic::Difference(m_adjustedBufferPointerStart, head);\n\n \/\/ Filemap lock\n LockMetaData();\n\n \/\/ Update object count\n m_data->currentObjectCount++;\n\n \/\/ Unlock filemap\n UnLockMetaData();\n\n \/\/ Complete\n return true;\n }\n else\n {\n \/\/ Failed\n return false;\n }\n return true;\n }\n\n \/**\n Not threadsafe\n *\/\n bool Consume(CircleBufferHeader*& out_header, T*& out_data)\n {\n \/\/ Internal lockage\n std::lock_guard<std::mutex> lock(m_consumeLock);\n\n \/\/ Find if it is possible to consume anything\n \/\/ Does not require to lock metadata under the assumption that when circlebuffers communicate via IPC one side is only producer\n \/\/ and the other side is only comsumer.\n \/\/ And as this part is already locked with internal lockage above\n if(m_data->currentObjectCount > 0)\n {\n \/\/ Local tail\n void* tail = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_data->currentTailOffset);\n\n \/\/ Check if current pointer is outside our scope.\n if(PointerArithmetic::AssertAdresstInside(tail, m_adjustedBufferPointerStart, m_adjustedBufferPointerEnd) == false)\n {\n tail = m_adjustedBufferPointerStart; \/\/ If so, reset to first part.\n }\n\n \/\/\/\/ Produce is ok\n \/\/ Copy metaheader to current_head\n memcpy(out_header, tail, sizeof(CircleBufferHeader));\n\n \/\/ Move header to after metaheader\n tail = PointerArithmetic::Addition(tail, sizeof(CircleBufferHeader));\n\n \/\/ Copy data to current:_head\n memcpy(out_data, tail, out_header->packageSize);\n\n \/\/ Move header to after data\n tail = PointerArithmetic::Addition(tail, out_header->packageSize);\n\n \/\/ Update global tail\n m_data->currentTailOffset = PointerArithmetic::Difference(m_adjustedBufferPointerStart, tail);\n\n \/\/ Filemap lock\n LockMetaData();\n\n \/\/ Update object count\n m_data->currentObjectCount--;\n\n \/\/ Unlock filemap\n UnLockMetaData();\n\n return true;\n }\n else\n {\n \/\/ Nothing to do\n return false;\n }\n return true;\n }\n\n protected:\n void CircleBuffer::AssertInitialize(const size_t& p_bufferSize)\n {\n m_sizeOfOneObject = sizeof(T) + sizeof(CircleBufferHeader);\n if(m_sizeOfOneObject > (p_bufferSize - sizeof(StaticData)))\n {\n const std::string errorMessage =\n std::string(\"Not enough space. Each object will take up sizeof(T) + sizeof(CircleBufferHeader) which is \" +\n std::to_string(sizeof(T)) + \"+\" + std::to_string(sizeof(CircleBufferHeader)) + \"=\" +\n std::to_string(m_sizeOfOneObject) + \". This buffer only has access to \" + std::to_string(p_bufferSize) + \"-\" +\n std::to_string(sizeof(StaticData)) + \"=\" + std::to_string(p_bufferSize - sizeof(StaticData)));\n throw std::runtime_error(errorMessage);\n }\n if(m_alreadyInitialized)\n {\n throw std::runtime_error(\"Already initialized.\");\n }\n }\n\n void CircleBuffer::LockMetaData()\n {\n if(m_mutex != nullptr)\n {\n m_mutex->AttemptLock();\n }\n }\n\n void CircleBuffer::UnLockMetaData()\n {\n if(m_mutex != nullptr)\n {\n m_mutex->Unlock();\n }\n }\n\n void CircleBuffer::ComputeAdjustments()\n {\n m_adjustedBufferSize = m_rawBufferSize - sizeof(StaticData);\n m_adjustedBufferSize = (m_adjustedBufferSize \/ m_sizeOfOneObject) * m_sizeOfOneObject;\n\n m_adjustedBufferPointerStart = PointerArithmetic::Addition(m_rawBufferPointerStart, sizeof(StaticData));\n m_adjustedBufferPointerEnd = PointerArithmetic::Addition(m_adjustedBufferPointerStart, m_adjustedBufferSize);\n }\n\n void CircleBuffer::ComputeMaxObjects() { m_maxContainedObjects = m_adjustedBufferSize \/ m_sizeOfOneObject; }\n\n void CircleBuffer::SetupVariables()\n {\n m_alreadyInitialized = true;\n m_rawBufferPointerEnd = PointerArithmetic::Addition(m_rawBufferPointerStart, m_rawBufferSize);\n ComputeAdjustments();\n ComputeMaxObjects();\n m_data = static_cast<StaticData*>(m_rawBufferPointerStart);\n\n \/\/ TODORT\n \/\/ LockMetaData In a very specific state both processes may come here at about the same time.\n \/\/ However, that should not be a problem. If they're almost here at the same no data should be lost.\n if(m_data->started != STARTED)\n {\n *m_data = StaticData();\n m_data->currentTailOffset = 0;\n m_data->currentHeadOffset = 0;\n }\n \/\/ TODORT\n \/\/ UnLockMetaData\n }\n\n StaticData* m_data;\n void* m_rawBufferPointerStart;\n void* m_rawBufferPointerEnd;\n void* m_adjustedBufferPointerStart;\n void* m_adjustedBufferPointerEnd;\n size_t m_rawBufferSize;\n size_t m_adjustedBufferSize;\n bool m_internalMemoryManagement;\n std::mutex m_produceLock;\n std::mutex m_consumeLock;\n bool m_alreadyInitialized;\n size_t m_maxContainedObjects;\n IO::Mutex* m_mutex;\n size_t m_sizeOfOneObject;\n };\n }\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2015, Youssef Kashef\n\/\/ Copyright (c) 2015, ELM Library Project\n\/\/ 3-clause BSD License\n\/\/\n\/\/M*\/\n#include \"elm\/layers\/mlp.h\"\n\n#include <memory>\n\n#include \"elm\/core\/debug_utils.h\"\n\n#include \"elm\/core\/boost\/translators\/transl_str_cvtermcriteria.h\"\n#include \"elm\/core\/boost\/translators\/transl_str_veci.h\"\n#include \"elm\/core\/cv\/mat_utils_inl.h\"\n#include \"elm\/core\/exception.h\"\n#include \"elm\/core\/layerconfig.h\"\n#include \"elm\/core\/percentile.h\"\n#include \"elm\/core\/signal.h\"\n#include \"elm\/ts\/layer_assertions.h\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace elm;\n\nnamespace {\n\nELM_INSTANTIATE_LAYER_TYPED_TEST_CASE_P(MLP);\n\nconst string NAME_IN = \"in\";\nconst string NAME_OUT_PREDICTION = \"out\";\n\nclass MLPInitTest : public ::testing::Test\n{\nprotected:\n virtual void SetUp()\n {\n config_ = LayerConfig();\n\n \/\/ params\n {\n PTree params;\n\n VecI arch = {2, 2, 1};\n\n params.add(MLP::PARAM_ARCH, arch);\n params.add(MLP::PARAM_BP_DW_SCALE, 0.05f);\n params.add(MLP::PARAM_BP_MOMENT_SCALE, 0.05f);\n\n CvTermCriteria criteria;\n criteria.max_iter = 1000;\n criteria.epsilon = 0.00001f;\n criteria.type = CV_TERMCRIT_ITER | CV_TERMCRIT_EPS;\n\n params.add(MLP::PARAM_TERM_CRITERIA, criteria);\n\n config_.Params(params);\n }\n\n io_ = LayerIONames();\n io_.Input(MLP::KEY_INPUT_STIMULUS, NAME_IN);\n io_.Output(MLP::KEY_OUTPUT_RESPONSE, NAME_OUT_PREDICTION);\n\n to_.reset(new MLP(config_));\n to_->IONames(io_);\n }\n\n shared_ptr<base_Layer> to_; \/\/\/< test object\n LayerConfig config_; \/\/\/< default config for tests\n LayerIONames io_;\n};\n\nTEST_F(MLPInitTest, Reset_EmptyConfig)\n{\n EXPECT_THROW(to_->Reset(LayerConfig()), boost::property_tree::ptree_bad_path);\n}\n\nTEST_F(MLPInitTest, Param_invalid_layers_too_few)\n{\n PTree params = config_.Params();\n {\n VecI arch = {2};\n params.put(MLP::PARAM_ARCH, arch);\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n {\n VecI arch = {200};\n params.put(MLP::PARAM_ARCH, arch);\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n}\n\nTEST_F(MLPInitTest, Param_invalid_layers_none)\n{\n PTree params = config_.Params();\n {\n params.put(MLP::PARAM_ARCH, VecI());\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n}\n\nclass MLPTrainTest : public MLPInitTest\n{\npublic:\n void GenerateSeparableBinary(int n, int feat_dims, cv::Mat1f &feat, cv::Mat1f &labels)\n {\n const float NEG_CLASS = -1.f;\n const float POS_CLASS = 1.f;\n\n feat = Mat1f(n, feat_dims);\n labels = Mat1f(n, 1);\n\n Mat1f feat_neg(n\/2, feat_dims);\n cv::randn(feat_neg, -1.f, 1.f);\n Mat1f labels_neg(feat_neg.rows, 1, NEG_CLASS);\n\n Mat1f feat_pos(n\/2, feat_dims);\n cv::randn(feat_pos, 1.f, 1.f);\n Mat1f labels_pos(feat_pos.rows, 1, POS_CLASS);\n\n Mat1f feat_concat, labels_concat;\n\n vconcat(feat_neg, feat_pos, feat_concat);\n vconcat(labels_neg, labels_pos, labels_concat);\n\n Mat1i idx = ARange_<int>(0, feat_concat.rows, 1);\n cv::randShuffle(idx);\n\n for (int src_idx=0; src_idx<n; src_idx++) {\n\n int dst_idx = idx(src_idx);\n feat_concat.row(src_idx).copyTo(feat.row(dst_idx));\n labels_concat.row(src_idx).copyTo(labels.row(dst_idx));\n }\n }\n\nprotected:\n virtual void SetUp()\n {\n MLPInitTest::SetUp();\n\n \/\/ params\n {\n PTree params = config_.Params();\n\n VecI arch = {2, 2, 1};\n params.put(MLP::PARAM_ARCH, arch);\n\n config_.Params(params);\n }\n\n to_.reset(new MLP(config_));\n to_->IONames(io_);\n }\n};\n\nTEST_F(MLPTrainTest, Train_separable_binary)\n{\n const int NB_TRAIN=100;\n const int FEAT_DIMS=2;\n\n Mat1f train_feat, train_labels;\n GenerateSeparableBinary(NB_TRAIN, FEAT_DIMS,\n train_feat, train_labels);\n\n ELM_DYN_CAST(base_LearningLayer, to_)->Learn(train_feat, train_labels);\n\n const int NB_TEST=100;\n Mat1f test_feat, test_labels;\n GenerateSeparableBinary(NB_TEST, FEAT_DIMS,\n test_feat, test_labels);\n\n Mat1i confusion = Mat1i::zeros(2, 2);\n const int TP = 0;\n const int FN = 1;\n const int FP = 2;\n const int TN = 3;\n\n Mat1f result(NB_TEST, 2);\n\n for (int i=0; i<NB_TEST; i++) {\n\n Mat1f test_feat_sample = test_feat.row(i);\n\n float target_label = test_labels.row(i)(0);\n\n Signal sig;\n sig.Append(NAME_IN, test_feat_sample);\n\n EXPECT_FALSE(sig.Exists(NAME_OUT_PREDICTION));\n\n to_->Activate(sig);\n to_->Response(sig);\n\n EXPECT_TRUE(sig.Exists(NAME_OUT_PREDICTION));\n\n Mat1f response = sig.MostRecentMat1f(NAME_OUT_PREDICTION);\n\n EXPECT_MAT_DIMS_EQ(response, Size2i(1, 1));\n\n float predicted = response(0);\n\n result(i, 0) = target_label;\n result(i, 1) = predicted;\n\n if(target_label >= 0.f && predicted >= 0.f) {\n\n confusion(TP)++;\n }\n else if(target_label < 0.f && predicted < 0.f) {\n\n confusion(TN)++;\n }\n else {\n\n confusion(target_label < 0.f? FP : FN)++;\n }\n }\n\n \/\/ELM_COUT_VAR(confusion);\n\n ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(0))[0]);\n ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(1))[0]);\n\n EXPECT_GT(confusion(TP), confusion(FP));\n EXPECT_GT(confusion(TN), confusion(FN));\n}\n\n} \/\/ annonymous namespace for test fixtures and test cases\n<commit_msg>start testing for multi-class classification<commit_after>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Copyright (c) 2015, Youssef Kashef\n\/\/ Copyright (c) 2015, ELM Library Project\n\/\/ 3-clause BSD License\n\/\/\n\/\/M*\/\n#include \"elm\/layers\/mlp.h\"\n\n#include <memory>\n\n#include \"elm\/core\/debug_utils.h\"\n\n#include \"elm\/core\/boost\/translators\/transl_str_cvtermcriteria.h\"\n#include \"elm\/core\/boost\/translators\/transl_str_veci.h\"\n#include \"elm\/core\/cv\/mat_utils_inl.h\"\n#include \"elm\/core\/exception.h\"\n#include \"elm\/core\/layerconfig.h\"\n#include \"elm\/core\/percentile.h\"\n#include \"elm\/core\/signal.h\"\n#include \"elm\/ts\/layer_assertions.h\"\n\nusing namespace std;\nusing namespace cv;\nusing namespace elm;\n\nnamespace {\n\nELM_INSTANTIATE_LAYER_TYPED_TEST_CASE_P(MLP);\n\nconst string NAME_IN = \"in\";\nconst string NAME_OUT_PREDICTION = \"out\";\n\nclass MLPInitTest : public ::testing::Test\n{\nprotected:\n virtual void SetUp()\n {\n config_ = LayerConfig();\n\n \/\/ params\n {\n PTree params;\n\n VecI arch = {2, 2, 1};\n\n params.add(MLP::PARAM_ARCH, arch);\n params.add(MLP::PARAM_BP_DW_SCALE, 0.05f);\n params.add(MLP::PARAM_BP_MOMENT_SCALE, 0.05f);\n\n CvTermCriteria criteria;\n criteria.max_iter = 1000;\n criteria.epsilon = 0.00001f;\n criteria.type = CV_TERMCRIT_ITER | CV_TERMCRIT_EPS;\n\n params.add(MLP::PARAM_TERM_CRITERIA, criteria);\n\n config_.Params(params);\n }\n\n io_ = LayerIONames();\n io_.Input(MLP::KEY_INPUT_STIMULUS, NAME_IN);\n io_.Output(MLP::KEY_OUTPUT_RESPONSE, NAME_OUT_PREDICTION);\n\n to_.reset(new MLP(config_));\n to_->IONames(io_);\n }\n\n shared_ptr<base_Layer> to_; \/\/\/< test object\n LayerConfig config_; \/\/\/< default config for tests\n LayerIONames io_;\n};\n\nTEST_F(MLPInitTest, Reset_EmptyConfig)\n{\n EXPECT_THROW(to_->Reset(LayerConfig()), boost::property_tree::ptree_bad_path);\n}\n\nTEST_F(MLPInitTest, Param_invalid_layers_too_few)\n{\n PTree params = config_.Params();\n {\n VecI arch = {2};\n params.put(MLP::PARAM_ARCH, arch);\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n {\n VecI arch = {200};\n params.put(MLP::PARAM_ARCH, arch);\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n}\n\nTEST_F(MLPInitTest, Param_invalid_layers_none)\n{\n PTree params = config_.Params();\n {\n params.put(MLP::PARAM_ARCH, VecI());\n config_.Params(params);\n EXPECT_THROW(to_.reset(new MLP(config_)), ExceptionBadDims);\n }\n}\n\nclass MLPTrainTest : public MLPInitTest\n{\npublic:\n void GenerateSeparableBinary(int n, int feat_dims, cv::Mat1f &feat, cv::Mat1f &labels)\n {\n const float NEG_CLASS = -1.f;\n const float POS_CLASS = 1.f;\n\n feat = Mat1f(n, feat_dims);\n labels = Mat1f(n, 1);\n\n Mat1f feat_neg(n\/2, feat_dims);\n cv::randn(feat_neg, -1.f, 1.f);\n Mat1f labels_neg(feat_neg.rows, 1, NEG_CLASS);\n\n Mat1f feat_pos(n\/2, feat_dims);\n cv::randn(feat_pos, 1.f, 1.f);\n Mat1f labels_pos(feat_pos.rows, 1, POS_CLASS);\n\n Mat1f feat_concat, labels_concat;\n\n vconcat(feat_neg, feat_pos, feat_concat);\n vconcat(labels_neg, labels_pos, labels_concat);\n\n Mat1i idx = ARange_<int>(0, feat_concat.rows, 1);\n cv::randShuffle(idx);\n\n for (int src_idx=0; src_idx<n; src_idx++) {\n\n int dst_idx = idx(src_idx);\n feat_concat.row(src_idx).copyTo(feat.row(dst_idx));\n labels_concat.row(src_idx).copyTo(labels.row(dst_idx));\n }\n }\n\n void GenerateSeparableMultiClass(int nb_classes, int n, int feat_dims, cv::Mat1f &feat, cv::Mat1f &labels)\n {\n const float NEG_CLASS = -1.f;\n const float POS_CLASS = 1.f;\n\n feat = Mat1f(n, feat_dims);\n labels = Mat1f(n, 1);\n\n float mu_start = -2.f;\n float mu_incr = 1.f;\n\n Mat1f feat_concat, labels_concat;\n\n for (int i=0; i<; i++) {\n\n Mat1f feati(n\/, feat_dims);\n cv::randn(feati, -2.f, 1.f);\n Mat1f labelsi(feati.rows, 1, 0.f);\n labelsi.col(0).setTo(1.f);\n\n if(i > 0) {\n\n vconcat(feat_concat, feati, feat_concat);\n vconcat(labels_concat, labelsi, labels_concat);\n }\n else {\n\n feat_concat = feati;\n labels_concat = labelsi;\n }\n }\n\n Mat1i idx = ARange_<int>(0, feat_concat.rows, 1);\n cv::randShuffle(idx);\n\n for (int src_idx=0; src_idx<n; src_idx++) {\n\n int dst_idx = idx(src_idx);\n feat_concat.row(src_idx).copyTo(feat.row(dst_idx));\n labels_concat.row(src_idx).copyTo(labels.row(dst_idx));\n }\n }\n\nprotected:\n virtual void SetUp()\n {\n MLPInitTest::SetUp();\n\n \/\/ params\n {\n PTree params = config_.Params();\n\n VecI arch = {2, 2, 1};\n params.put(MLP::PARAM_ARCH, arch);\n\n config_.Params(params);\n }\n\n to_.reset(new MLP(config_));\n to_->IONames(io_);\n }\n};\n\nTEST_F(MLPTrainTest, Train_separable_binary)\n{\n const int NB_TRAIN=100;\n const int FEAT_DIMS=2;\n\n Mat1f train_feat, train_labels;\n GenerateSeparableBinary(NB_TRAIN, FEAT_DIMS,\n train_feat, train_labels);\n\n ELM_DYN_CAST(base_LearningLayer, to_)->Learn(train_feat, train_labels);\n\n const int NB_TEST=100;\n Mat1f test_feat, test_labels;\n GenerateSeparableBinary(NB_TEST, FEAT_DIMS,\n test_feat, test_labels);\n\n Mat1i confusion = Mat1i::zeros(2, 2);\n const int TP = 0;\n const int FN = 1;\n const int FP = 2;\n const int TN = 3;\n\n Mat1f result(NB_TEST, 2);\n\n for (int i=0; i<NB_TEST; i++) {\n\n Mat1f test_feat_sample = test_feat.row(i);\n\n float target_label = test_labels.row(i)(0);\n\n Signal sig;\n sig.Append(NAME_IN, test_feat_sample);\n\n EXPECT_FALSE(sig.Exists(NAME_OUT_PREDICTION));\n\n to_->Activate(sig);\n to_->Response(sig);\n\n EXPECT_TRUE(sig.Exists(NAME_OUT_PREDICTION));\n\n Mat1f response = sig.MostRecentMat1f(NAME_OUT_PREDICTION);\n\n EXPECT_MAT_DIMS_EQ(response, Size2i(1, 1));\n\n float predicted = response(0);\n\n result(i, 0) = target_label;\n result(i, 1) = predicted;\n\n if(target_label >= 0.f && predicted >= 0.f) {\n\n confusion(TP)++;\n }\n else if(target_label < 0.f && predicted < 0.f) {\n\n confusion(TN)++;\n }\n else {\n\n confusion(target_label < 0.f? FP : FN)++;\n }\n }\n\n \/\/ELM_COUT_VAR(confusion);\n\n ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(0))[0]);\n ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(1))[0]);\n\n EXPECT_GT(confusion(TP), confusion(FP));\n EXPECT_GT(confusion(TN), confusion(FN));\n}\n\nTEST_F(MLPTrainTest, Train_separable_multiclass)\n{\n const int NB_CLASSES=4;\n const int NB_TRAIN=120;\n const int FEAT_DIMS=2;\n\n Mat1f train_feat, train_labels;\n GenerateSeparableMultiClass(NB_CLASSES, NB_TRAIN, FEAT_DIMS,\n train_feat, train_labels);\n\n ELM_DYN_CAST(base_LearningLayer, to_)->Learn(train_feat, train_labels);\n\n const int NB_TEST=120;\n Mat1f test_feat, test_labels;\n GenerateSeparableBinary(NB_CLASSES, NB_TEST, FEAT_DIMS,\n test_feat, test_labels);\n\n\/\/ for(int c=0; c<NB_CLASSES; c++) {\n\n\/\/ Mat1i confusion = Mat1i::zeros(2, 2);\n\/\/ const int TP = 0;\n\/\/ const int FN = 1;\n\/\/ const int FP = 2;\n\/\/ const int TN = 3;\n\n\/\/ Mat1f result(NB_TEST, 2);\n\n\/\/ for (int i=0; i<NB_TEST; i++) {\n\n\/\/ Mat1f test_feat_sample = test_feat.row(i);\n\n\/\/ float target_label = test_labels.row(i)(0);\n\n\/\/ Signal sig;\n\/\/ sig.Append(NAME_IN, test_feat_sample);\n\n\/\/ EXPECT_FALSE(sig.Exists(NAME_OUT_PREDICTION));\n\n\/\/ to_->Activate(sig);\n\/\/ to_->Response(sig);\n\n\/\/ EXPECT_TRUE(sig.Exists(NAME_OUT_PREDICTION));\n\n\/\/ Mat1f response = sig.MostRecentMat1f(NAME_OUT_PREDICTION);\n\n\/\/ EXPECT_MAT_DIMS_EQ(response, Size2i(1, 1));\n\n\/\/ float predicted = response(0);\n\n\/\/ result(i, 0) = target_label;\n\/\/ result(i, 1) = predicted;\n\n\/\/ if(target_label >= 0.f && predicted >= 0.f) {\n\n\/\/ confusion(TP)++;\n\/\/ }\n\/\/ else if(target_label < 0.f && predicted < 0.f) {\n\n\/\/ confusion(TN)++;\n\/\/ }\n\/\/ else {\n\n\/\/ confusion(target_label < 0.f? FP : FN)++;\n\/\/ }\n\/\/ }\n\n\/\/ \/\/ELM_COUT_VAR(confusion);\n\n\/\/ ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(0))[0]);\n\/\/ ASSERT_EQ(NB_TEST\/2, cv::sum(confusion.row(1))[0]);\n\n\/\/ EXPECT_GT(confusion(TP), confusion(FP));\n\/\/ EXPECT_GT(confusion(TN), confusion(FN));\n\/\/ }\n}\n\n} \/\/ annonymous namespace for test fixtures and test cases\n<|endoftext|>"} {"text":"<commit_before>\/*\ncontact: Boris.Polishchuk@cern.ch\nlink: see comments in the $ALICE_ROOT\/PHOS\/AliPHOSRcuDA1.cxx\nreference run: \/castor\/cern.ch\/alice\/phos\/2007\/10\/04\/18\/07000008249001.1000.root\nrun type: STANDALONE\nDA type: MON \nnumber of events needed: 1000\ninput files: RCU0.data RCU1.data RCU2.data RCU3.data\nOutput files: PHOS_Module2_LED.root\nTrigger types used: CALIBRATION_EVENT\n*\/\n\n\n#include \"event.h\"\n#include \"monitor.h\"\nextern \"C\" {\n#include \"daqDA.h\"\n}\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <TSystem.h>\n#include <TROOT.h>\n#include <TPluginManager.h>\n\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliPHOSRcuDA1.h\"\n#include \"AliPHOSRawDecoder.h\"\n#include \"AliCaloAltroMapping.h\"\n\n\n\/* Main routine\n Arguments: \n 1- monitoring data source\n*\/\nint main(int argc, char **argv) {\n\n gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n\t\t\t\t\t\"*\",\n\t\t\t\t\t\"TStreamerInfo\",\n\t\t\t\t\t\"RIO\",\n\t\t\t\t\t\"TStreamerInfo()\");\n\n int status;\n \n if (argc!=2) {\n printf(\"Wrong number of arguments\\n\");\n return -1;\n }\n\n \/* Retrieve mapping files from DAQ DB *\/ \n const char* mapFiles[4] = {\"RCU0.data\",\"RCU1.data\",\"RCU2.data\",\"RCU3.data\"};\n\n for(Int_t iFile=0; iFile<4; iFile++) {\n int failed = daqDA_DB_getFile(mapFiles[iFile], mapFiles[iFile]);\n if(failed) { \n printf(\"Cannot retrieve file %s from DAQ DB. Exit.\\n\",mapFiles[iFile]);\n return -1;\n }\n }\n \n \/* Open mapping files *\/\n AliAltroMapping *mapping[4];\n TString path = \".\/\";\n path += \"RCU\";\n TString path2;\n for(Int_t i = 0; i < 4; i++) {\n path2 = path;\n path2 += i;\n path2 += \".data\";\n mapping[i] = new AliCaloAltroMapping(path2.Data());\n }\n \n\n \/* define data source : this is argument 1 *\/ \n status=monitorSetDataSource( argv[1] );\n if (status!=0) {\n printf(\"monitorSetDataSource() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n\n \/* declare monitoring program *\/\n status=monitorDeclareMp( __FILE__ );\n if (status!=0) {\n printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n\n \/* define wait event timeout - 1s max *\/\n monitorSetNowait();\n monitorSetNoWaitNetworkTimeout(1000);\n \n \/* init some counters *\/\n int nevents_physics=0;\n int nevents_total=0;\n\n Int_t fMod = 2; \/\/ module 2!\n AliRawReader *rawReader = NULL;\n\n AliPHOSRcuDA1 da1(fMod,-1,0); \/\/ DA1 for module2, no input\/output file\n \n Float_t e[64][56][2];\n Float_t t[64][56][2];\n\n Int_t gain = -1;\n Int_t X = -1;\n Int_t Z = -1;\n\n \/* main loop (infinite) *\/\n for(;;) {\n struct eventHeaderStruct *event;\n eventTypeType eventT;\n \n \/* check shutdown condition *\/\n if (daqDA_checkShutdown()) {break;}\n \n \/* get next event (blocking call until timeout) *\/\n status=monitorGetEventDynamic((void **)&event);\n if (status==MON_ERR_EOF) {\n printf (\"End of File detected\\n\");\n break; \/* end of monitoring file has been reached *\/\n }\n \n if (status!=0) {\n printf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n break;\n }\n\n \/* retry if got no event *\/\n if (event==NULL) {\n continue;\n }\n\n\n \/* use event - here, just write event id to result file *\/\n eventT=event->eventType;\n \n if (eventT==PHYSICS_EVENT) {\n \n for(Int_t iX=0; iX<64; iX++) {\n\tfor(Int_t iZ=0; iZ<56; iZ++) {\n\t for(Int_t iGain=0; iGain<2; iGain++) {\n\t e[iX][iZ][iGain] = 0.;\n\t t[iX][iZ][iGain] = 0.;\n\t }\n\t}\n }\n\n rawReader = new AliRawReaderDate((void*)event);\n\/\/ AliPHOSRawDecoderv1 dc(rawReader,mapping);\n AliPHOSRawDecoder dc(rawReader,mapping);\n dc.SubtractPedestals(kTRUE);\n \n while(dc.NextDigit()) {\n\n\tX = dc.GetRow() - 1;\n\tZ = dc.GetColumn() - 1;\n\n\tif(dc.IsLowGain()) gain = 0;\n\telse\n\t gain = 1;\n\t\n\te[X][Z][gain] = dc.GetEnergy();\n\tt[X][Z][gain] = dc.GetTime();\n\t\n }\n \n da1.FillHistograms(e,t);\n \n delete rawReader; \n nevents_physics++;\n }\n \n nevents_total++;\n \n \/* free resources *\/\n free(event);\n \n \/* exit when last event received, no need to wait for TERM signal *\/\n if (eventT==END_OF_RUN) {\n printf(\"EOR event detected\\n\");\n break;\n }\n }\n \n for(Int_t i = 0; i < 4; i++) delete mapping[i]; \n \n \/* Be sure that all histograms are saved *\/\n\n char localfile[128];\n sprintf(localfile,\"PHOS_Module%d_LED.root\",fMod);\n TFile* f = new TFile(localfile,\"recreate\");\n \n const TH2F* h2=0;\n const TH1F* h1=0;\n\n Int_t nGood=0; \/\/ >10 entries in peak\n Int_t nMax=-111; \/\/ max. number of entries in peak\n Int_t iXmax=-1;\n Int_t iZmax=-1;\n\n for(Int_t iX=0; iX<64; iX++) {\n for(Int_t iZ=0; iZ<56; iZ++) {\n \n h1 = da1.GetHgLgRatioHistogram(iX,iZ); \/\/ High Gain\/Low Gain ratio\n if(h1) {\n\tif(h1->GetMaximum()>10.) nGood++;\n\tif(h1->GetMaximum()>nMax) {nMax = (Int_t)h1->GetMaximum(); iXmax=iX; iZmax=iZ;}\n\th1->Write(); \n }\n \n for(Int_t iGain=0; iGain<2; iGain++) {\n\th2 = da1.GetTimeEnergyHistogram(iX,iZ,iGain); \/\/ Time vs Energy\n\tif(h2) h2->Write();\n }\n \n }\n }\n \n f->Close();\n \n \/* Store output files to the File Exchange Server *\/\n char fesfileid[128];\n \n for(Int_t iMod=0; iMod<5; iMod++) {\n sprintf(localfile,\"PHOS_Module%d_LED.root\",iMod);\n sprintf(fesfileid,\"PHOS_Module%d_LED\",iMod);\n daqDA_FES_storeFile(localfile,fesfileid);\n }\n \n printf(\"%d physics events of %d total processed.\\n\",nevents_physics,nevents_total);\n printf(\"%d histograms has >10 entries in maximum, max. is %d entries \",nGood,nMax);\n printf(\"(module,iX,iZ)=(%d,%d,%d)\",fMod,iXmax,iZmax);\n printf(\"\\n\");\n\n return status;\n}\n<commit_msg>File Exchange Server file Id (fesfileid) corrected.<commit_after>\/*\ncontact: Boris.Polishchuk@cern.ch\nlink: see comments in the $ALICE_ROOT\/PHOS\/AliPHOSRcuDA1.cxx\nreference run: \/castor\/cern.ch\/alice\/phos\/2007\/10\/04\/18\/07000008249001.1000.root\nrun type: STANDALONE\nDA type: MON \nnumber of events needed: 1000\ninput files: RCU0.data RCU1.data RCU2.data RCU3.data\nOutput files: PHOS_Module2_LED.root\nTrigger types used: CALIBRATION_EVENT\n*\/\n\n\n#include \"event.h\"\n#include \"monitor.h\"\nextern \"C\" {\n#include \"daqDA.h\"\n}\n\n#include <stdio.h>\n#include <stdlib.h>\n\n#include <TSystem.h>\n#include <TROOT.h>\n#include <TPluginManager.h>\n\n#include \"AliRawReader.h\"\n#include \"AliRawReaderDate.h\"\n#include \"AliPHOSRcuDA1.h\"\n#include \"AliPHOSRawDecoder.h\"\n#include \"AliCaloAltroMapping.h\"\n\n\n\/* Main routine\n Arguments: \n 1- monitoring data source\n*\/\nint main(int argc, char **argv) {\n\n gROOT->GetPluginManager()->AddHandler(\"TVirtualStreamerInfo\",\n\t\t\t\t\t\"*\",\n\t\t\t\t\t\"TStreamerInfo\",\n\t\t\t\t\t\"RIO\",\n\t\t\t\t\t\"TStreamerInfo()\");\n\n int status;\n \n if (argc!=2) {\n printf(\"Wrong number of arguments\\n\");\n return -1;\n }\n\n \/* Retrieve mapping files from DAQ DB *\/ \n const char* mapFiles[4] = {\"RCU0.data\",\"RCU1.data\",\"RCU2.data\",\"RCU3.data\"};\n\n for(Int_t iFile=0; iFile<4; iFile++) {\n int failed = daqDA_DB_getFile(mapFiles[iFile], mapFiles[iFile]);\n if(failed) { \n printf(\"Cannot retrieve file %s from DAQ DB. Exit.\\n\",mapFiles[iFile]);\n return -1;\n }\n }\n \n \/* Open mapping files *\/\n AliAltroMapping *mapping[4];\n TString path = \".\/\";\n path += \"RCU\";\n TString path2;\n for(Int_t i = 0; i < 4; i++) {\n path2 = path;\n path2 += i;\n path2 += \".data\";\n mapping[i] = new AliCaloAltroMapping(path2.Data());\n }\n \n\n \/* define data source : this is argument 1 *\/ \n status=monitorSetDataSource( argv[1] );\n if (status!=0) {\n printf(\"monitorSetDataSource() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n\n \/* declare monitoring program *\/\n status=monitorDeclareMp( __FILE__ );\n if (status!=0) {\n printf(\"monitorDeclareMp() failed : %s\\n\",monitorDecodeError(status));\n return -1;\n }\n\n\n \/* define wait event timeout - 1s max *\/\n monitorSetNowait();\n monitorSetNoWaitNetworkTimeout(1000);\n \n \/* init some counters *\/\n int nevents_physics=0;\n int nevents_total=0;\n\n Int_t fMod = 2; \/\/ module 2!\n AliRawReader *rawReader = NULL;\n\n AliPHOSRcuDA1 da1(fMod,-1,0); \/\/ DA1 for module2, no input\/output file\n \n Float_t e[64][56][2];\n Float_t t[64][56][2];\n\n Int_t gain = -1;\n Int_t X = -1;\n Int_t Z = -1;\n\n \/* main loop (infinite) *\/\n for(;;) {\n struct eventHeaderStruct *event;\n eventTypeType eventT;\n \n \/* check shutdown condition *\/\n if (daqDA_checkShutdown()) {break;}\n \n \/* get next event (blocking call until timeout) *\/\n status=monitorGetEventDynamic((void **)&event);\n if (status==MON_ERR_EOF) {\n printf (\"End of File detected\\n\");\n break; \/* end of monitoring file has been reached *\/\n }\n \n if (status!=0) {\n printf(\"monitorGetEventDynamic() failed : %s\\n\",monitorDecodeError(status));\n break;\n }\n\n \/* retry if got no event *\/\n if (event==NULL) {\n continue;\n }\n\n\n \/* use event - here, just write event id to result file *\/\n eventT=event->eventType;\n \n if (eventT==PHYSICS_EVENT) {\n \n for(Int_t iX=0; iX<64; iX++) {\n\tfor(Int_t iZ=0; iZ<56; iZ++) {\n\t for(Int_t iGain=0; iGain<2; iGain++) {\n\t e[iX][iZ][iGain] = 0.;\n\t t[iX][iZ][iGain] = 0.;\n\t }\n\t}\n }\n\n rawReader = new AliRawReaderDate((void*)event);\n\/\/ AliPHOSRawDecoderv1 dc(rawReader,mapping);\n AliPHOSRawDecoder dc(rawReader,mapping);\n dc.SubtractPedestals(kTRUE);\n \n while(dc.NextDigit()) {\n\n\tX = dc.GetRow() - 1;\n\tZ = dc.GetColumn() - 1;\n\n\tif(dc.IsLowGain()) gain = 0;\n\telse\n\t gain = 1;\n\t\n\te[X][Z][gain] = dc.GetEnergy();\n\tt[X][Z][gain] = dc.GetTime();\n\t\n }\n \n da1.FillHistograms(e,t);\n \n delete rawReader; \n nevents_physics++;\n }\n \n nevents_total++;\n \n \/* free resources *\/\n free(event);\n \n \/* exit when last event received, no need to wait for TERM signal *\/\n if (eventT==END_OF_RUN) {\n printf(\"EOR event detected\\n\");\n break;\n }\n }\n \n for(Int_t i = 0; i < 4; i++) delete mapping[i]; \n \n \/* Be sure that all histograms are saved *\/\n\n char localfile[128];\n sprintf(localfile,\"PHOS_Module%d_LED.root\",fMod);\n TFile* f = new TFile(localfile,\"recreate\");\n \n const TH2F* h2=0;\n const TH1F* h1=0;\n\n Int_t nGood=0; \/\/ >10 entries in peak\n Int_t nMax=-111; \/\/ max. number of entries in peak\n Int_t iXmax=-1;\n Int_t iZmax=-1;\n\n for(Int_t iX=0; iX<64; iX++) {\n for(Int_t iZ=0; iZ<56; iZ++) {\n \n h1 = da1.GetHgLgRatioHistogram(iX,iZ); \/\/ High Gain\/Low Gain ratio\n if(h1) {\n\tif(h1->GetMaximum()>10.) nGood++;\n\tif(h1->GetMaximum()>nMax) {nMax = (Int_t)h1->GetMaximum(); iXmax=iX; iZmax=iZ;}\n\th1->Write(); \n }\n \n for(Int_t iGain=0; iGain<2; iGain++) {\n\th2 = da1.GetTimeEnergyHistogram(iX,iZ,iGain); \/\/ Time vs Energy\n\tif(h2) h2->Write();\n }\n \n }\n }\n \n f->Close();\n \n \/* Store output files to the File Exchange Server *\/\n \n for(Int_t iMod=0; iMod<5; iMod++) {\n sprintf(localfile,\"PHOS_Module%d_LED.root\",iMod);\n daqDA_FES_storeFile(localfile,\"LED\");\n }\n \n printf(\"%d physics events of %d total processed.\\n\",nevents_physics,nevents_total);\n printf(\"%d histograms has >10 entries in maximum, max. is %d entries \",nGood,nMax);\n printf(\"(module,iX,iZ)=(%d,%d,%d)\",fMod,iXmax,iZmax);\n printf(\"\\n\");\n\n return status;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkIOCommon.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 2002 Insight Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"itkIOCommon.h\"\n#include <sys\/stat.h>\n\nnamespace itk\n{\n \/\/ CODE STOLEN STRAIGHT FROM CMAKE\n#if defined(_WIN32) && (defined(_MSC_VER) || defined(__BORLANDC__))\n#include <string.h>\n#include <windows.h>\n#include <direct.h>\n#define _unlink unlink\ninline int Mkdir(const char* dir)\n{\n return _mkdir(dir);\n}\ninline const char* Getcwd(char* buf, unsigned int len)\n{\n return _getcwd(buf, len);\n}\ninline int Chdir(const char* dir)\n{\n #if defined(__BORLANDC__)\n return chdir(dir);\n #else\n return _chdir(dir);\n #endif\n}\n#else\n#include <sys\/types.h>\n#include <fcntl.h>\n#include <unistd.h>\ninline int Mkdir(const char* dir)\n{\n return mkdir(dir, 00777);\n}\ninline const char* Getcwd(char* buf, unsigned int len)\n{\n return getcwd(buf, len);\n}\ninline int Chdir(const char* dir)\n{\n return chdir(dir);\n}\n#endif\n\nstd::string IOCommon\n::AtomicPixelTypeToString(const AtomicPixelType pixelType)\n{\n switch(pixelType)\n {\n case ITK_UCHAR:\n return \"unsigned char\";\n break;\n case ITK_CHAR:\n return \"char\";\n break;\n case ITK_USHORT:\n return \"unsigned short\";\n break;\n case ITK_SHORT:\n return \"short\";\n break;\n case ITK_UINT:\n return \"unsigned int\";\n break;\n case ITK_INT:\n return \"int\";\n break;\n case ITK_ULONG:\n return \"unsigned long\";\n break;\n case ITK_LONG:\n return \"long\";\n break;\n case ITK_FLOAT:\n return \"float\";\n break;\n case ITK_DOUBLE:\n return \"double\";\n break;\n default:\n return \"unknown\";\n break;\n }\n}\n\nunsigned int IOCommon\n::ComputeSizeOfAtomicPixelType(const AtomicPixelType pixelType)\n{\n switch (pixelType)\n {\n case ITK_CHAR:\n return sizeof(char);\n break;\n case ITK_UCHAR:\n return sizeof(unsigned char);\n break;\n case ITK_SHORT:\n return sizeof(short);\n break;\n case ITK_USHORT:\n return sizeof(unsigned short);\n break;\n case ITK_INT:\n return sizeof(int);\n break;\n case ITK_UINT:\n return sizeof(unsigned int);\n break;\n case ITK_LONG:\n return sizeof(long);\n break;\n case ITK_ULONG:\n return sizeof(unsigned long);\n break;\n case ITK_FLOAT:\n return sizeof(float);\n break;\n case ITK_DOUBLE:\n return sizeof(double);\n break;\n default:\n return sizeof(char);\n break;\n }\n}\n\nint IOCommon\n::Strucmp(const char *s1, const char *s2)\n{\n char* s1_up = new char[strlen(s1)+1];\n char* s2_up = new char[strlen(s2)+1];\n int i;\n\n strcpy(s1_up, s1);\n strcpy(s2_up, s2);\n\n for (i = 0; s1_up[i]; i++)\n {\n s1_up[i] = islower(s1_up[i]) ? toupper(s1_up[i]) : s1_up[i];\n }\n for (i = 0; s2_up[i]; i++)\n {\n s2_up[i] = islower(s2_up[i]) ? toupper(s2_up[i]) : s2_up[i];\n }\n int rc = strcmp(s1_up, s2_up);\n delete [] s1_up;\n delete [] s2_up;\n return rc;\n}\n\nchar* IOCommon\n::ExtractFileName (const char* fileName)\n{\n const char* dot;\n const char* slash;\n char* fName = NULL;\n\n if (fileName != NULL)\n {\n slash = strrchr(fileName, '\/');\n if (slash == NULL)\n {\n slash = strrchr(fileName, '\\\\');\n }\n if (slash == NULL)\n {\n slash = (const char*) fileName;\n }\n else\n {\n slash++;\n }\n dot = strrchr(fileName, '.');\n if (dot == NULL)\n {\n dot = (const char*) fileName + strlen(fileName);\n }\n fName = new char[strlen(slash) - strlen(dot) + 1];\n strncpy(fName, slash, strlen(slash) - strlen(dot));\n fName[strlen(slash) - strlen(dot)] = '\\0';\n }\n\n return fName;\n}\n\nchar* IOCommon\n::ExtractFileExtension (const char* fileName)\n{\n const char* dot;\n char* fExtension = NULL;\n\n dot = strrchr(fileName, '.');\n if (dot != NULL)\n {\n dot++;\n fExtension = new char[strlen(dot)+1];\n strcpy(fExtension, dot);\n fExtension[strlen(dot)] = '\\0';\n }\n\n return fExtension;\n}\n\nchar* IOCommon\n::ExtractFilePath (const char* fileName)\n{\n const char* slash;\n char* fPath = NULL;\n\n if (fileName != NULL)\n {\n slash = strrchr(fileName, '\/');\n if (slash == NULL)\n {\n slash = strrchr(fileName, '\\\\');\n }\n if (slash == NULL)\n {\n fPath = NULL;\n }\n else\n {\n slash++;\n fPath = new char[strlen(fileName) - strlen(slash) + 1];\n strncpy(fPath, fileName, strlen(fileName) - strlen(slash));\n fPath[strlen(fileName) - strlen(slash)] = '\\0';\n }\n }\n\n return fPath;\n}\n\n\/\/ return true if the file exists\nbool IOCommon\n::FileExists(const char* filename)\n{\n struct stat fs;\n if (stat(filename, &fs) != 0) \n {\n return false;\n }\n else\n {\n return true;\n }\n}\n\/\/ return size of file; also returns zero if no file exists\nunsigned long IOCommon\n::FileLength(const char* filename)\n{\n struct stat fs;\n if (stat(filename, &fs) != 0) \n {\n return 0;\n }\n else\n {\n return fs.st_size;\n }\n}\n\nchar *IOCommon\n::RealPath(const char *path, char *resolved_path)\n{\n#if defined(_WIN32)\n char pathpart[MAXPATHLEN];\n std::strcpy(pathpart,path);\n char fnamepart[MAXPATHLEN];\n char *slash;\n\n if((slash = std::strrchr(pathpart,'\/')) == NULL)\n {\n slash = std::strrchr(pathpart,'\\\\');\n }\n\n if(slash == NULL) \/\/ no path part, so just use current dir.\n {\n Getcwd(pathpart,sizeof(pathpart));\n std::strcpy(fnamepart,path);\n } \n else \/\/ change directory to path part, getcwd to find OS resolved path\n {\n *slash = '\\0';\n strcpy(fnamepart,slash+1);\n\n char savedir[MAXPATHLEN];\n Getcwd(savedir,sizeof(savedir));\n Chdir(pathpart);\n Getcwd(pathpart,sizeof(pathpart));\n Chdir(savedir);\n }\n std::strcpy(resolved_path,pathpart);\n std::strcat(resolved_path,\"\/\");\n std::strcat(resolved_path,fnamepart);\n return resolved_path;\n#else\n return realpath(path,resolved_path);\n#endif\n}\n\n} \/\/ namespace itk\n<commit_msg>ERR: strcat,strcpy are not in std::.<commit_after>\/*=========================================================================\n\n Program: Insight Segmentation & Registration Toolkit\n Module: itkIOCommon.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 2002 Insight Consortium. All rights reserved.\n See ITKCopyright.txt or http:\/\/www.itk.org\/HTML\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notices for more information.\n\n=========================================================================*\/\n#include \"itkIOCommon.h\"\n#include <sys\/stat.h>\n\nnamespace itk\n{\n \/\/ CODE STOLEN STRAIGHT FROM CMAKE\n#if defined(_WIN32) && (defined(_MSC_VER) || defined(__BORLANDC__))\n#include <string.h>\n#include <windows.h>\n#include <direct.h>\n#define _unlink unlink\ninline int Mkdir(const char* dir)\n{\n return _mkdir(dir);\n}\ninline const char* Getcwd(char* buf, unsigned int len)\n{\n return _getcwd(buf, len);\n}\ninline int Chdir(const char* dir)\n{\n #if defined(__BORLANDC__)\n return chdir(dir);\n #else\n return _chdir(dir);\n #endif\n}\n#else\n#include <sys\/types.h>\n#include <fcntl.h>\n#include <unistd.h>\ninline int Mkdir(const char* dir)\n{\n return mkdir(dir, 00777);\n}\ninline const char* Getcwd(char* buf, unsigned int len)\n{\n return getcwd(buf, len);\n}\ninline int Chdir(const char* dir)\n{\n return chdir(dir);\n}\n#endif\n\n::std::string IOCommon\n::AtomicPixelTypeToString(const AtomicPixelType pixelType)\n{\n switch(pixelType)\n {\n case ITK_UCHAR:\n return \"unsigned char\";\n break;\n case ITK_CHAR:\n return \"char\";\n break;\n case ITK_USHORT:\n return \"unsigned short\";\n break;\n case ITK_SHORT:\n return \"short\";\n break;\n case ITK_UINT:\n return \"unsigned int\";\n break;\n case ITK_INT:\n return \"int\";\n break;\n case ITK_ULONG:\n return \"unsigned long\";\n break;\n case ITK_LONG:\n return \"long\";\n break;\n case ITK_FLOAT:\n return \"float\";\n break;\n case ITK_DOUBLE:\n return \"double\";\n break;\n default:\n return \"unknown\";\n break;\n }\n}\n\nunsigned int IOCommon\n::ComputeSizeOfAtomicPixelType(const AtomicPixelType pixelType)\n{\n switch (pixelType)\n {\n case ITK_CHAR:\n return sizeof(char);\n break;\n case ITK_UCHAR:\n return sizeof(unsigned char);\n break;\n case ITK_SHORT:\n return sizeof(short);\n break;\n case ITK_USHORT:\n return sizeof(unsigned short);\n break;\n case ITK_INT:\n return sizeof(int);\n break;\n case ITK_UINT:\n return sizeof(unsigned int);\n break;\n case ITK_LONG:\n return sizeof(long);\n break;\n case ITK_ULONG:\n return sizeof(unsigned long);\n break;\n case ITK_FLOAT:\n return sizeof(float);\n break;\n case ITK_DOUBLE:\n return sizeof(double);\n break;\n default:\n return sizeof(char);\n break;\n }\n}\n\nint IOCommon\n::Strucmp(const char *s1, const char *s2)\n{\n char* s1_up = new char[strlen(s1)+1];\n char* s2_up = new char[strlen(s2)+1];\n int i;\n\n strcpy(s1_up, s1);\n strcpy(s2_up, s2);\n\n for (i = 0; s1_up[i]; i++)\n {\n s1_up[i] = islower(s1_up[i]) ? toupper(s1_up[i]) : s1_up[i];\n }\n for (i = 0; s2_up[i]; i++)\n {\n s2_up[i] = islower(s2_up[i]) ? toupper(s2_up[i]) : s2_up[i];\n }\n int rc = strcmp(s1_up, s2_up);\n delete [] s1_up;\n delete [] s2_up;\n return rc;\n}\n\nchar* IOCommon\n::ExtractFileName (const char* fileName)\n{\n const char* dot;\n const char* slash;\n char* fName = NULL;\n\n if (fileName != NULL)\n {\n slash = strrchr(fileName, '\/');\n if (slash == NULL)\n {\n slash = strrchr(fileName, '\\\\');\n }\n if (slash == NULL)\n {\n slash = (const char*) fileName;\n }\n else\n {\n slash++;\n }\n dot = strrchr(fileName, '.');\n if (dot == NULL)\n {\n dot = (const char*) fileName + strlen(fileName);\n }\n fName = new char[strlen(slash) - strlen(dot) + 1];\n strncpy(fName, slash, strlen(slash) - strlen(dot));\n fName[strlen(slash) - strlen(dot)] = '\\0';\n }\n\n return fName;\n}\n\nchar* IOCommon\n::ExtractFileExtension (const char* fileName)\n{\n const char* dot;\n char* fExtension = NULL;\n\n dot = strrchr(fileName, '.');\n if (dot != NULL)\n {\n dot++;\n fExtension = new char[strlen(dot)+1];\n strcpy(fExtension, dot);\n fExtension[strlen(dot)] = '\\0';\n }\n\n return fExtension;\n}\n\nchar* IOCommon\n::ExtractFilePath (const char* fileName)\n{\n const char* slash;\n char* fPath = NULL;\n\n if (fileName != NULL)\n {\n slash = strrchr(fileName, '\/');\n if (slash == NULL)\n {\n slash = strrchr(fileName, '\\\\');\n }\n if (slash == NULL)\n {\n fPath = NULL;\n }\n else\n {\n slash++;\n fPath = new char[strlen(fileName) - strlen(slash) + 1];\n strncpy(fPath, fileName, strlen(fileName) - strlen(slash));\n fPath[strlen(fileName) - strlen(slash)] = '\\0';\n }\n }\n\n return fPath;\n}\n\n\/\/ return true if the file exists\nbool IOCommon\n::FileExists(const char* filename)\n{\n struct stat fs;\n if (stat(filename, &fs) != 0) \n {\n return false;\n }\n else\n {\n return true;\n }\n}\n\/\/ return size of file; also returns zero if no file exists\nunsigned long IOCommon\n::FileLength(const char* filename)\n{\n struct stat fs;\n if (stat(filename, &fs) != 0) \n {\n return 0;\n }\n else\n {\n return fs.st_size;\n }\n}\n\nchar *IOCommon\n::RealPath(const char *path, char *resolved_path)\n{\n#if defined(_WIN32)\n char pathpart[MAXPATHLEN];\n strcpy(pathpart,path);\n char fnamepart[MAXPATHLEN];\n char *slash;\n\n if((slash = strrchr(pathpart,'\/')) == NULL)\n {\n slash = strrchr(pathpart,'\\\\');\n }\n\n if(slash == NULL) \/\/ no path part, so just use current dir.\n {\n Getcwd(pathpart,sizeof(pathpart));\n strcpy(fnamepart,path);\n } \n else \/\/ change directory to path part, getcwd to find OS resolved path\n {\n *slash = '\\0';\n strcpy(fnamepart,slash+1);\n\n char savedir[MAXPATHLEN];\n Getcwd(savedir,sizeof(savedir));\n Chdir(pathpart);\n Getcwd(pathpart,sizeof(pathpart));\n Chdir(savedir);\n }\n strcpy(resolved_path,pathpart);\n strcat(resolved_path,\"\/\");\n strcat(resolved_path,fnamepart);\n return resolved_path;\n#else\n return realpath(path,resolved_path);\n#endif\n}\n\n} \/\/ namespace itk\n<|endoftext|>"} {"text":"<commit_before>\/*=============================================================================\n Copyright (c) 2012-2014 Richard Otis\n\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n =============================================================================*\/\n\n\/\/ Deep copy\/rename (DCR) implementation for EnergyModel\n\n#include \"libgibbs\/include\/libgibbs_pch.hpp\"\n#include \"libgibbs\/include\/utils\/ast_container_rename.hpp\"\n#include \"libgibbs\/include\/utils\/ast_variable_rename.hpp\"\n#include \"libgibbs\/include\/models.hpp\"\n#include \"libtdb\/include\/logging.hpp\"\n#include <memory>\n\nstd::unique_ptr<EnergyModel> EnergyModel::clone_with_renamed_phase (\n const std::string &old_phase_name,\n const std::string &new_phase_name\n) const\n{\n BOOST_LOG_NAMED_SCOPE ( \"EnergyModel::clone_with_renamed_phase\" );\n logger opto_log ( journal::keywords::channel = \"optimizer\" );\n BOOST_LOG_SEV( opto_log, debug ) << \"entered\";\n auto copymodel = std::unique_ptr<EnergyModel> ( new EnergyModel ( *this ) );\n BOOST_LOG_SEV( opto_log, debug ) << \"created EnergyModel copy tethered to unique_ptr\";\n \/\/ Deep copy and rename the ast_symbol_table\n ASTSymbolMap new_map ( ast_copy_with_renamed_phase ( ast_symbol_table, old_phase_name, new_phase_name ) );\n BOOST_LOG_SEV( opto_log, debug ) << \"DCR ASTSymbolMap\";\n \/\/ Perform a deep rename on model_ast\n ast_variable_rename ( copymodel->model_ast, old_phase_name, new_phase_name );\n BOOST_LOG_SEV( opto_log, debug ) << \"DCR model_ast\";\n copymodel->ast_symbol_table = std::move ( new_map );\n BOOST_LOG_SEV( opto_log, debug ) << \"returning\";\n return std::move ( copymodel );\n}\n<commit_msg>More verbose logging for EnergyModel::clone_with_renamed_phase().<commit_after>\/*=============================================================================\n Copyright (c) 2012-2014 Richard Otis\n\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n =============================================================================*\/\n\n\/\/ Deep copy\/rename (DCR) implementation for EnergyModel\n\n#include \"libgibbs\/include\/libgibbs_pch.hpp\"\n#include \"libgibbs\/include\/utils\/ast_container_rename.hpp\"\n#include \"libgibbs\/include\/utils\/ast_variable_rename.hpp\"\n#include \"libgibbs\/include\/models.hpp\"\n#include \"libtdb\/include\/logging.hpp\"\n#include <memory>\n\nstd::unique_ptr<EnergyModel> EnergyModel::clone_with_renamed_phase (\n const std::string &old_phase_name,\n const std::string &new_phase_name\n) const\n{\n BOOST_LOG_NAMED_SCOPE ( \"EnergyModel::clone_with_renamed_phase\" );\n logger opto_log ( journal::keywords::channel = \"optimizer\" );\n BOOST_LOG_SEV( opto_log, debug ) << \"entered\";\n auto copymodel = std::unique_ptr<EnergyModel> ( new EnergyModel ( *this ) );\n BOOST_LOG_SEV( opto_log, debug ) << \"created EnergyModel copy tethered to unique_ptr\";\n \/\/ Deep copy and rename the ast_symbol_table\n ASTSymbolMap new_map ( ast_copy_with_renamed_phase ( ast_symbol_table, old_phase_name, new_phase_name ) );\n BOOST_LOG_SEV( opto_log, debug ) << \"DCR ASTSymbolMap\";\n \/\/ Perform a deep rename on model_ast\n ast_variable_rename ( copymodel->model_ast, old_phase_name, new_phase_name );\n BOOST_LOG_SEV( opto_log, debug ) << \"DCR model_ast(\" \n << old_phase_name << \" -> \" << new_phase_name << \") = \" << copymodel->model_ast;\n copymodel->ast_symbol_table = std::move ( new_map );\n BOOST_LOG_SEV( opto_log, debug ) << \"returning\";\n return std::move ( copymodel );\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkCellArray.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkCellArray.h\"\n#include \"vtkObjectFactory.h\"\n\nvtkCxxRevisionMacro(vtkCellArray, \"1.39\");\nvtkStandardNewMacro(vtkCellArray);\n\nvtkCellArray::vtkCellArray()\n{\n this->Ia = vtkIdTypeArray::New();\n this->NumberOfCells = 0;\n this->InsertLocation = 0;\n this->TraversalLocation = 0;\n}\n\nvoid vtkCellArray::DeepCopy (vtkCellArray *ca)\n{\n \/\/ Do nothing on a NULL input.\n if (ca == NULL)\n {\n return;\n }\n\n this->Ia->DeepCopy(ca->Ia);\n this->NumberOfCells = ca->NumberOfCells;\n this->InsertLocation = 0;\n this->TraversalLocation = 0;\n}\n\nvtkCellArray::~vtkCellArray()\n{\n this->Ia->Delete();\n}\n\n\n\/\/ Returns the size of the largest cell. The size is the number of points\n\/\/ defining the cell.\nint vtkCellArray::GetMaxCellSize()\n{\n int i, npts=0, maxSize=0;\n\n for (i=0; i<this->Ia->GetMaxId(); i+=(npts+1))\n {\n if ( (npts=this->Ia->GetValue(i)) > maxSize )\n {\n maxSize = npts;\n }\n }\n return maxSize;\n}\n\n\/\/ Specify a group of cells.\nvoid vtkCellArray::SetCells(vtkIdType ncells, vtkIdTypeArray *cells)\n{\n if ( cells != this->Ia )\n {\n this->Modified();\n this->Ia->Delete();\n this->Ia = cells;\n this->Ia->Register(this);\n\n this->NumberOfCells = ncells;\n this->InsertLocation = cells->GetMaxId() + 1;\n this->TraversalLocation = 0;\n }\n}\n\nunsigned long vtkCellArray::GetActualMemorySize()\n{\n return this->Ia->GetActualMemorySize();\n}\n<commit_msg>Bug in DeepCopy<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkCellArray.cxx\n Language: C++\n Date: $Date$\n Version: $Revision$\n\n Copyright (c) 1993-2002 Ken Martin, Will Schroeder, Bill Lorensen \n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even \n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR \n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkCellArray.h\"\n#include \"vtkObjectFactory.h\"\n\nvtkCxxRevisionMacro(vtkCellArray, \"1.40\");\nvtkStandardNewMacro(vtkCellArray);\n\nvtkCellArray::vtkCellArray()\n{\n this->Ia = vtkIdTypeArray::New();\n this->NumberOfCells = 0;\n this->InsertLocation = 0;\n this->TraversalLocation = 0;\n}\n\nvoid vtkCellArray::DeepCopy (vtkCellArray *ca)\n{\n \/\/ Do nothing on a NULL input.\n if (ca == NULL)\n {\n return;\n }\n\n this->Ia->DeepCopy(ca->Ia);\n this->NumberOfCells = ca->NumberOfCells;\n this->InsertLocation = ca->InsertLocation;\n this->TraversalLocation = ca->TraversalLocation;\n}\n\nvtkCellArray::~vtkCellArray()\n{\n this->Ia->Delete();\n}\n\n\n\/\/ Returns the size of the largest cell. The size is the number of points\n\/\/ defining the cell.\nint vtkCellArray::GetMaxCellSize()\n{\n int i, npts=0, maxSize=0;\n\n for (i=0; i<this->Ia->GetMaxId(); i+=(npts+1))\n {\n if ( (npts=this->Ia->GetValue(i)) > maxSize )\n {\n maxSize = npts;\n }\n }\n return maxSize;\n}\n\n\/\/ Specify a group of cells.\nvoid vtkCellArray::SetCells(vtkIdType ncells, vtkIdTypeArray *cells)\n{\n if ( cells != this->Ia )\n {\n this->Modified();\n this->Ia->Delete();\n this->Ia = cells;\n this->Ia->Register(this);\n\n this->NumberOfCells = ncells;\n this->InsertLocation = cells->GetMaxId() + 1;\n this->TraversalLocation = 0;\n }\n}\n\nunsigned long vtkCellArray::GetActualMemorySize()\n{\n return this->Ia->GetActualMemorySize();\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/debugging level 0 = nothing\n\/\/debugging level 1 = critical errors\n\/\/debugging level 2 = errors\n\/\/debugging level 3 = status information\n\/\/debugging level 4 = extremely verbose status information\n#define DEBUG 3\n\n#include <iostream>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/epoll.h>\n#include <getopt.h>\n\nenum {HANDLER_PROGRESSIVE, HANDLER_FLASH, HANDLER_APPLE, HANDLER_MICRO};\n\n#define DEFAULT_PORT 80\n#include \"..\/util\/server_setup.cpp\"\n#include \"..\/util\/http_parser.cpp\"\n\nint mainHandler(int CONN_fd){\n int handler = HANDLER_PROGRESSIVE;\n bool ready4data = false;\/\/set to true when streaming starts\n bool inited = false;\n bool progressive_has_sent_header = false;\n int ss;\n std::string streamname;\n FLV_Pack * tag = 0;\n HTTPReader HTTP_R, HTTP_S;\/\/HTTP Receiver en HTTP Sender.\n\n int retval;\n int poller = epoll_create(1);\n int sspoller = epoll_create(1);\n struct epoll_event ev;\n ev.events = EPOLLIN;\n ev.data.fd = CONN_fd;\n epoll_ctl(poller, EPOLL_CTL_ADD, CONN_fd, &ev);\n struct epoll_event events[1];\n\n std::string Movie = \"\";\n std::string Quality = \"\";\n int Segment = -1;\n int Fragment = -1;\n int temp;\n\n while (!socketError && !All_Hell_Broke_Loose){\n \/\/only parse input if available or not yet init'ed\n retval = epoll_wait(poller, events, 1, 1);\n if ((retval > 0) || !ready4data){\n if (HTTP_R.ReadSocket(CONN_fd)){\n Movie = HTTP_R.url.substr(1);\n Movie = Movie.substr(0,Movie.find(\"\/\"));\n Quality = HTTP_R.url.substr( HTTP_R.url.find(\"\/\",1)+1 );\n Quality = Quality.substr(0, Quality.find(\"Seg\"));\n temp = HTTP_R.url.find(\"Seg\") + 3;\n Segment = atoi( HTTP_R.url.substr(temp,HTTP_R.url.find(\"-\",temp)-temp).c_str());\n temp = HTTP_R.url.find(\"Frag\") + 4;\n Fragment = atoi( HTTP_R.url.substr(temp).c_str() );\n \/\/ERIK: we hebben nu een hele HTTP request geparsed - verwerken mag hier, door aanroepen naar\n \/\/ERIK: bijvoorbeeld HTTP_R.GetHeader(\"headernaam\") (voor headers) of HTTP_R.GetVar(\"varnaam\") (voor GET\/POST vars)\n \/\/ERIK: of HTTP_R.method of HTTP_R.url of HTTP_R.protocol....\n \/\/ERIK: zie ook ..\/util\/http_parser.cpp - de class definitie bovenaan zou genoeg moeten zijn voor je\n \/\/ERIK: Ik heb een handler variabele gemaakt die moet setten naar bijv HANDLER_FLASH in jouw geval.\n \/\/ERIK: Als de handler niet is geset, is hij by default PROGRESSIVE, en daarvoor heb ik de verwerking al gecode.\n \/\/ERIK: Je eigen handler instellen voorkomt dus dat mijn code hem handled alsof hij progressive is.\n if (handler == HANDLER_PROGRESSIVE){\n \/\/in het geval progressive nemen we aan dat de URL de streamname is, met .flv erachter\n streamname = HTTP_R.url.substr(0, HTTP_R.url.size()-4);\/\/strip de .flv\n for (std::string::iterator i=streamname.end()-1; i>=streamname.begin(); --i){\n if (!isalpha(*i) && !isdigit(*i)){streamname.erase(i);}else{*i=tolower(*i);}\/\/strip nonalphanumeric\n }\n streamname = \"\/tmp\/shared_socket_\" + streamname;\/\/dit is dan onze shared_socket\n \/\/normaal zouden we ook een position uitlezen uit de URL, maar bij LIVE streams is dat zinloos\n ready4data = true;\n }\/\/PROGRESSIVE handler\n printf( \"URL: %s\\n\", HTTP_R.url.c_str());\n printf( \"Movie Identifier: %s\\n\", Movie.c_str() );\n printf( \"Quality Modifier: %s\\n\", Quality.c_str() );\n printf( \"Segment: %d\\n\", Segment );\n printf( \"Fragment: %d\\n\", Fragment );\n HTTP_R.Clean(); \/\/maak schoon na verwerken voor eventuele volgende requests...\n }\n }\n if (ready4data){\n if (!inited){\n \/\/we are ready, connect the socket!\n ss = DDV_OpenUnix(streamname);\n if (ss <= 0){\n #if DEBUG >= 1\n fprintf(stderr, \"Could not connect to server!\\n\");\n #endif\n socketError = 1;\n break;\n }\n ev.events = EPOLLIN;\n ev.data.fd = ss;\n epoll_ctl(sspoller, EPOLL_CTL_ADD, ss, &ev);\n #if DEBUG >= 3\n fprintf(stderr, \"Everything connected, starting to send video data...\\n\");\n #endif\n inited = true;\n }\n \n retval = epoll_wait(sspoller, events, 1, 1);\n switch (DDV_ready(ss)){\n case 0:\n socketError = true;\n #if DEBUG >= 1\n fprintf(stderr, \"Source socket is disconnected.\\n\");\n #endif\n break;\n case -1: break;\/\/not ready yet\n default:\n if (FLV_GetPacket(tag, ss)){\/\/able to read a full packet?\n \/\/ERIK: \"tag\" bevat nu een FLV tag (video, audio, of metadata), de header hebben we al weggelezen, np.\n \/\/ERIK: Dit is het punt waarop je eventueel data mag\/kan gaan sturen en\/of parsen. Leef je uit.\n \/\/ERIK: je kan een HTTP_S gebruiken om je HTTP request op te bouwen (via SetBody, SetHeader, etc)\n \/\/ERIK: en dan met de .BuildResponse(\"200\", \"OK\"); call een std::string met de hele response maken, klaar voor versturen\n \/\/ERIK: Note: hergebruik echter NIET de HTTP_R die ik al heb gemaakt hierboven, want er kunnen meerdere requests binnenkomen!\n if (handler == HANDLER_PROGRESSIVE){\n if (!progressive_has_sent_header){\n HTTP_S.Clean();\/\/troep opruimen die misschien aanwezig is...\n HTTP_S.SetHeader(\"Content-Type\", \"video\/x-flv\");\/\/FLV files hebben altijd dit content-type.\n std::string tmpresp = HTTP_S.BuildResponse(\"200\", \"OK\");\/\/geen SetBody = unknown length! Dat willen we hier.\n DDV_write(tmpresp.c_str(), tmpresp.size(), CONN_fd);\/\/schrijf de HTTP response header\n DDV_write(FLVHeader, 13, CONN_fd);\/\/schrijf de FLV header, altijd 13 chars lang\n progressive_has_sent_header = true;\n }\n DDV_write(tag->data, tag->len, CONN_fd);\/\/schrijf deze FLV tag onbewerkt weg\n }\/\/PROGRESSIVE handler\n }\n break;\n }\n }\n }\n close(CONN_fd);\n if (inited) close(ss);\n #if DEBUG >= 1\n if (All_Hell_Broke_Loose){fprintf(stderr, \"All Hell Broke Loose\\n\");}\n fprintf(stderr, \"User %i disconnected.\\n\", CONN_fd);\n if (inited){\n fprintf(stderr, \"Status was: inited\\n\");\n }else{\n if (ready4data){\n fprintf(stderr, \"Status was: ready4data\\n\");\n }else{\n fprintf(stderr, \"Status was: connected\\n\");\n }\n }\n #endif\n return 0;\n}\n\n<commit_msg>HTTP connector setting voor FLASH handler toegevoegd<commit_after>\/\/debugging level 0 = nothing\n\/\/debugging level 1 = critical errors\n\/\/debugging level 2 = errors\n\/\/debugging level 3 = status information\n\/\/debugging level 4 = extremely verbose status information\n#define DEBUG 3\n\n#include <iostream>\n#include <cstdlib>\n#include <cstdio>\n#include <cmath>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\n#include <sys\/epoll.h>\n#include <getopt.h>\n\nenum {HANDLER_PROGRESSIVE, HANDLER_FLASH, HANDLER_APPLE, HANDLER_MICRO};\n\n#define DEFAULT_PORT 80\n#include \"..\/util\/server_setup.cpp\"\n#include \"..\/util\/http_parser.cpp\"\n\nint mainHandler(int CONN_fd){\n int handler = HANDLER_PROGRESSIVE;\n bool ready4data = false;\/\/set to true when streaming starts\n bool inited = false;\n bool progressive_has_sent_header = false;\n int ss;\n std::string streamname;\n FLV_Pack * tag = 0;\n HTTPReader HTTP_R, HTTP_S;\/\/HTTP Receiver en HTTP Sender.\n\n int retval;\n int poller = epoll_create(1);\n int sspoller = epoll_create(1);\n struct epoll_event ev;\n ev.events = EPOLLIN;\n ev.data.fd = CONN_fd;\n epoll_ctl(poller, EPOLL_CTL_ADD, CONN_fd, &ev);\n struct epoll_event events[1];\n\n std::string Movie = \"\";\n std::string Quality = \"\";\n int Segment = -1;\n int Fragment = -1;\n int temp;\n\n while (!socketError && !All_Hell_Broke_Loose){\n \/\/only parse input if available or not yet init'ed\n retval = epoll_wait(poller, events, 1, 1);\n if ((retval > 0) || !ready4data){\n if (HTTP_R.ReadSocket(CONN_fd)){\n if( (HTTP_R.url.find(\"Seg\") != std::string::npos) &&\n (HTTP_R.url.find(\"Frag\") != std::string::npos) ) {\n handler = HANDLER_FLASH;\n }\n if(handler == HANDLER_FLASH) {\n Movie = HTTP_R.url.substr(1);\n Movie = Movie.substr(0,Movie.find(\"\/\"));\n Quality = HTTP_R.url.substr( HTTP_R.url.find(\"\/\",1)+1 );\n Quality = Quality.substr(0, Quality.find(\"Seg\"));\n temp = HTTP_R.url.find(\"Seg\") + 3;\n Segment = atoi( HTTP_R.url.substr(temp,HTTP_R.url.find(\"-\",temp)-temp).c_str());\n temp = HTTP_R.url.find(\"Frag\") + 4;\n Fragment = atoi( HTTP_R.url.substr(temp).c_str() );\n\n printf( \"URL: %s\\n\", HTTP_R.url.c_str());\n printf( \"Movie Identifier: %s\\n\", Movie.c_str() );\n printf( \"Quality Modifier: %s\\n\", Quality.c_str() );\n printf( \"Segment: %d\\n\", Segment );\n printf( \"Fragment: %d\\n\", Fragment );\n streamname = \"\/tmp\/shared_socket_\";\n streamname += Movie.c_str();\n\n ready4data = true;\n }\/\/FLASH handler\n \/\/ERIK: we hebben nu een hele HTTP request geparsed - verwerken mag hier, door aanroepen naar\n \/\/ERIK: bijvoorbeeld HTTP_R.GetHeader(\"headernaam\") (voor headers) of HTTP_R.GetVar(\"varnaam\") (voor GET\/POST vars)\n \/\/ERIK: of HTTP_R.method of HTTP_R.url of HTTP_R.protocol....\n \/\/ERIK: zie ook ..\/util\/http_parser.cpp - de class definitie bovenaan zou genoeg moeten zijn voor je\n\n \/\/ERIK: Ik heb een handler variabele gemaakt die moet setten naar bijv HANDLER_FLASH in jouw geval.\n \/\/ERIK: Als de handler niet is geset, is hij by default PROGRESSIVE, en daarvoor heb ik de verwerking al gecode.\n \/\/ERIK: Je eigen handler instellen voorkomt dus dat mijn code hem handled alsof hij progressive is.\n if (handler == HANDLER_PROGRESSIVE){\n \/\/in het geval progressive nemen we aan dat de URL de streamname is, met .flv erachter\n streamname = HTTP_R.url.substr(0, HTTP_R.url.size()-4);\/\/strip de .flv\n for (std::string::iterator i=streamname.end()-1; i>=streamname.begin(); --i){\n if (!isalpha(*i) && !isdigit(*i)){streamname.erase(i);}else{*i=tolower(*i);}\/\/strip nonalphanumeric\n }\n streamname = \"\/tmp\/shared_socket_\" + streamname;\/\/dit is dan onze shared_socket\n \/\/normaal zouden we ook een position uitlezen uit de URL, maar bij LIVE streams is dat zinloos\n ready4data = true;\n }\/\/PROGRESSIVE handler\n HTTP_R.Clean(); \/\/maak schoon na verwerken voor eventuele volgende requests...\n }\n }\n if (ready4data){\n if (!inited){\n \/\/we are ready, connect the socket!\n ss = DDV_OpenUnix(streamname);\n if (ss <= 0){\n #if DEBUG >= 1\n fprintf(stderr, \"Could not connect to server!\\n\");\n #endif\n socketError = 1;\n break;\n }\n ev.events = EPOLLIN;\n ev.data.fd = ss;\n epoll_ctl(sspoller, EPOLL_CTL_ADD, ss, &ev);\n #if DEBUG >= 3\n fprintf(stderr, \"Everything connected, starting to send video data...\\n\");\n #endif\n inited = true;\n }\n \n retval = epoll_wait(sspoller, events, 1, 1);\n switch (DDV_ready(ss)){\n case 0:\n socketError = true;\n #if DEBUG >= 1\n fprintf(stderr, \"Source socket is disconnected.\\n\");\n #endif\n break;\n case -1: break;\/\/not ready yet\n default:\n if (FLV_GetPacket(tag, ss)){\/\/able to read a full packet?\n \/\/ERIK: \"tag\" bevat nu een FLV tag (video, audio, of metadata), de header hebben we al weggelezen, np.\n \/\/ERIK: Dit is het punt waarop je eventueel data mag\/kan gaan sturen en\/of parsen. Leef je uit.\n \/\/ERIK: je kan een HTTP_S gebruiken om je HTTP request op te bouwen (via SetBody, SetHeader, etc)\n \/\/ERIK: en dan met de .BuildResponse(\"200\", \"OK\"); call een std::string met de hele response maken, klaar voor versturen\n \/\/ERIK: Note: hergebruik echter NIET de HTTP_R die ik al heb gemaakt hierboven, want er kunnen meerdere requests binnenkomen!\n if (handler == HANDLER_PROGRESSIVE){\n if (!progressive_has_sent_header){\n HTTP_S.Clean();\/\/troep opruimen die misschien aanwezig is...\n HTTP_S.SetHeader(\"Content-Type\", \"video\/x-flv\");\/\/FLV files hebben altijd dit content-type.\n std::string tmpresp = HTTP_S.BuildResponse(\"200\", \"OK\");\/\/geen SetBody = unknown length! Dat willen we hier.\n DDV_write(tmpresp.c_str(), tmpresp.size(), CONN_fd);\/\/schrijf de HTTP response header\n DDV_write(FLVHeader, 13, CONN_fd);\/\/schrijf de FLV header, altijd 13 chars lang\n progressive_has_sent_header = true;\n }\n DDV_write(tag->data, tag->len, CONN_fd);\/\/schrijf deze FLV tag onbewerkt weg\n }\/\/PROGRESSIVE handler\n }\n break;\n }\n }\n }\n close(CONN_fd);\n if (inited) close(ss);\n #if DEBUG >= 1\n if (All_Hell_Broke_Loose){fprintf(stderr, \"All Hell Broke Loose\\n\");}\n fprintf(stderr, \"User %i disconnected.\\n\", CONN_fd);\n if (inited){\n fprintf(stderr, \"Status was: inited\\n\");\n }else{\n if (ready4data){\n fprintf(stderr, \"Status was: ready4data\\n\");\n }else{\n fprintf(stderr, \"Status was: connected\\n\");\n }\n }\n #endif\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1 *\n* (c) 2006-2011 INRIA, USTL, UJF, CNRS, MGH *\n* *\n* This program is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU General Public License as published by the Free *\n* Software Foundation; either version 2 of the License, or (at your option) *\n* any later version. *\n* *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n* more details. *\n* *\n* You should have received a copy of the GNU General Public License along *\n* with this program; if not, write to the Free Software Foundation, Inc., 51 *\n* Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *\n*******************************************************************************\n* SOFA :: Applications *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include \"BaseViewer.h\"\n#include \"PickHandler.h\"\n\n#include <sofa\/helper\/Factory.inl>\n#include <sofa\/component\/visualmodel\/VisualStyle.h>\n#include <sofa\/core\/visual\/DisplayFlags.h>\n\nnamespace sofa\n{\nnamespace gui\n{\n\nBaseViewer::BaseViewer()\n : groot(NULL)\n , currentCamera(NULL)\n , _video(false)\n , _axis(false)\n , backgroundColour(Vector3())\n , texLogo(NULL)\n , backgroundImageFile(\"textures\/SOFA_logo.bmp\")\n , ambientColour(Vector3())\n , _stereoEnabled(false)\n , _stereoMode(STEREO_AUTO)\n , _stereoShift(1.0)\n ,pick(NULL)\n{\n pick = new PickHandler();\n}\n\nBaseViewer::~BaseViewer()\n{\n if(texLogo)\n {\n delete texLogo;\n texLogo = NULL;\n }\n}\n\nsofa::simulation::Node* BaseViewer::getScene()\n{\n return groot.get();\n}\nconst std::string& BaseViewer::getSceneFileName()\n{\n return sceneFileName;\n}\nvoid BaseViewer::setSceneFileName(const std::string &f)\n{\n sceneFileName = f;\n}\n\nvoid BaseViewer::setScene(sofa::simulation::Node::SPtr scene, const char* filename \/* = NULL *\/, bool \/* = false *\/)\n{\n std::string file =\n filename ? sofa::helper::system::SetDirectory::GetFileNameWithoutExtension(\n filename) : std::string();\n std::string screenshotPrefix =\n sofa::helper::system::SetDirectory::GetParentDir(\n sofa::helper::system::DataRepository.getFirstPath().c_str())\n + std::string(\"\/share\/screenshots\/\") + file\n + std::string(\"_\");\n capture.setPrefix(screenshotPrefix);\n#ifdef SOFA_HAVE_FFMPEG\n videoRecorder.setPrefix(screenshotPrefix);\n#endif \/\/SOFA_HAVE_FFMPEG\n sceneFileName = filename ? filename : std::string(\"default.scn\");\n groot = scene;\n initTexturesDone = false;\n\n\n\n\n \/\/Camera initialization\n if (groot)\n {\n groot->get(currentCamera);\n if (!currentCamera)\n {\n currentCamera = sofa::core::objectmodel::New<component::visualmodel::InteractiveCamera>();\n currentCamera->setName(core::objectmodel::Base::shortName(currentCamera.get()));\n groot->addObject(currentCamera);\n currentCamera->p_position.forceSet();\n currentCamera->p_orientation.forceSet();\n currentCamera->bwdInit();\n\n }\n component::visualmodel::VisualStyle::SPtr visualStyle = NULL;\n groot->get(visualStyle);\n if (!visualStyle)\n {\n visualStyle = sofa::core::objectmodel::New<component::visualmodel::VisualStyle>();\n visualStyle->setName(core::objectmodel::Base::shortName(visualStyle.get()));\n\n core::visual::DisplayFlags* displayFlags = visualStyle->displayFlags.beginEdit();\n displayFlags->setShowVisualModels(sofa::core::visual::tristate::true_value);\n visualStyle->displayFlags.endEdit();\n\n groot->addObject(visualStyle);\n visualStyle->init();\n }\n\n currentCamera->setBoundingBox(groot->f_bbox.getValue().minBBox(), groot->f_bbox.getValue().maxBBox());\n\n \/\/ init pickHandler\n pick->init(groot.get());\n }\n\n}\n\nvoid BaseViewer::setCameraMode(core::visual::VisualParams::CameraType mode)\n{\n currentCamera->setCameraType(mode);\n}\n\nbool BaseViewer::ready()\n{\n return true;\n}\n\nvoid BaseViewer::wait()\n{\n}\n\nvoid BaseViewer::configure(sofa::component::configurationsetting::ViewerSetting* viewerConf)\n{\n using namespace core::visual;\n if (viewerConf->cameraMode.getValue().getSelectedId() == VisualParams::ORTHOGRAPHIC_TYPE)\n setCameraMode(VisualParams::ORTHOGRAPHIC_TYPE);\n else\n setCameraMode(VisualParams::PERSPECTIVE_TYPE);\n if ( viewerConf->objectPickingMethod.getValue().getSelectedId() == gui::PickHandler::RAY_CASTING)\n pick->setPickingMethod( gui::PickHandler::RAY_CASTING );\n else\n pick->setPickingMethod( gui::PickHandler::SELECTION_BUFFER);\n}\n\n\/\/Fonctions needed to take a screenshot\nconst std::string BaseViewer::screenshotName()\n{\n return capture.findFilename().c_str();\n}\n\nvoid BaseViewer::setPrefix(const std::string filename)\n{\n capture.setPrefix(filename);\n}\n\nvoid BaseViewer::screenshot(const std::string filename, int compression_level)\n{\n capture.saveScreen(filename, compression_level);\n}\n\nvoid BaseViewer::getView(Vec3d& pos, Quat& ori) const\n{\n if (!currentCamera)\n return;\n\n const Vec3d& camPosition = currentCamera->getPosition();\n const Quat& camOrientation = currentCamera->getOrientation();\n\n pos[0] = camPosition[0];\n pos[1] = camPosition[1];\n pos[2] = camPosition[2];\n\n ori[0] = camOrientation[0];\n ori[1] = camOrientation[1];\n ori[2] = camOrientation[2];\n ori[3] = camOrientation[3];\n}\n\nvoid BaseViewer::setView(const Vec3d& pos, const Quat &ori)\n{\n Vec3d position;\n Quat orientation;\n for (unsigned int i=0 ; i<3 ; i++)\n {\n position[i] = pos[i];\n orientation[i] = ori[i];\n }\n orientation[3] = ori[3];\n\n if (currentCamera)\n currentCamera->setView(position, orientation);\n\n redraw();\n}\n\nvoid BaseViewer::moveView(const Vec3d& pos, const Quat &ori)\n{\n if (!currentCamera)\n return;\n\n currentCamera->moveCamera(pos, ori);\n\n redraw();\n}\n\nvoid BaseViewer::newView()\n{\n if (!currentCamera || !groot)\n return;\n\n currentCamera->setDefaultView(groot->getGravity());\n}\n\nvoid BaseViewer::resetView()\n{\n redraw();\n}\n\nvoid BaseViewer::setBackgroundColour(float r, float g, float b)\n{\n _background = 2;\n backgroundColour[0] = r;\n backgroundColour[1] = g;\n backgroundColour[2] = b;\n}\n\nvoid BaseViewer::setBackgroundImage(std::string imageFileName)\n{\n _background = 0;\n\n if( sofa::helper::system::DataRepository.findFile(imageFileName) )\n {\n backgroundImageFile = sofa::helper::system::DataRepository.getFile(imageFileName);\n std::string extension = sofa::helper::system::SetDirectory::GetExtension(imageFileName.c_str());\n std::transform(extension.begin(),extension.end(),extension.begin(),::tolower );\n if(texLogo)\n {\n delete texLogo;\n texLogo = NULL;\n }\n helper::io::Image* image = helper::io::Image::FactoryImage::getInstance()->createObject(extension,backgroundImageFile);\n if( !image )\n {\n helper::vector<std::string> validExtensions;\n helper::io::Image::FactoryImage::getInstance()->uniqueKeys(std::back_inserter(validExtensions));\n std::cerr << \"Could not create: \" << imageFileName << std::endl;\n std::cerr << \"Valid extensions: \" << validExtensions << std::endl;\n }\n else\n {\n texLogo = new helper::gl::Texture( image );\n texLogo->init();\n\n }\n\n }\n}\n\nstd::string BaseViewer::getBackgroundImage()\n{\n return backgroundImageFile;\n}\n\nPickHandler* BaseViewer::getPickHandler()\n{\n return pick;\n}\n\nbool BaseViewer::unload(void)\n{\n getPickHandler()->reset();\n getPickHandler()->unload();\n return true;\n}\n\nvoid BaseViewer::fitNodeBBox(sofa::core::objectmodel::BaseNode * node )\n{\n if(!currentCamera) return;\n if( node->f_bbox.getValue().isValid() && !node->f_bbox.getValue().isFlat() )\n currentCamera->fitBoundingBox(\n node->f_bbox.getValue().minBBox(),\n node->f_bbox.getValue().maxBBox()\n );\n\n redraw();\n}\n\nvoid BaseViewer::fitObjectBBox(sofa::core::objectmodel::BaseObject * object)\n{\n if(!currentCamera) return;\n\n if( object->f_bbox.getValue().isValid() && !object->f_bbox.getValue().isFlat() )\n currentCamera->fitBoundingBox(object->f_bbox.getValue().minBBox(),\n object->f_bbox.getValue().maxBBox());\n else\n {\n if(object->getContext()->f_bbox.getValue().isValid() && !object->getContext()->f_bbox.getValue().isFlat() )\n {\n currentCamera->fitBoundingBox(\n object->getContext()->f_bbox.getValue().minBBox(),\n object->getContext()->f_bbox.getValue().maxBBox());\n }\n }\n redraw();\n}\n\n\n\n\n\n}\n}\n\n<commit_msg>r12787\/sofa-dev : remove a warning about BaseViewer initialisation list.<commit_after>\/******************************************************************************\n* SOFA, Simulation Open-Framework Architecture, version 1.0 RC 1 *\n* (c) 2006-2011 INRIA, USTL, UJF, CNRS, MGH *\n* *\n* This program is free software; you can redistribute it and\/or modify it *\n* under the terms of the GNU General Public License as published by the Free *\n* Software Foundation; either version 2 of the License, or (at your option) *\n* any later version. *\n* *\n* This program is distributed in the hope that it will be useful, but WITHOUT *\n* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or *\n* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for *\n* more details. *\n* *\n* You should have received a copy of the GNU General Public License along *\n* with this program; if not, write to the Free Software Foundation, Inc., 51 *\n* Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *\n*******************************************************************************\n* SOFA :: Applications *\n* *\n* Authors: The SOFA Team and external contributors (see Authors.txt) *\n* *\n* Contact information: contact@sofa-framework.org *\n******************************************************************************\/\n#include \"BaseViewer.h\"\n#include \"PickHandler.h\"\n\n#include <sofa\/helper\/Factory.inl>\n#include <sofa\/component\/visualmodel\/VisualStyle.h>\n#include <sofa\/core\/visual\/DisplayFlags.h>\n\nnamespace sofa\n{\nnamespace gui\n{\n\nBaseViewer::BaseViewer()\n : groot(NULL)\n , currentCamera(NULL)\n , _video(false)\n , _axis(false)\n , backgroundColour(Vector3())\n , texLogo(NULL)\n , backgroundImageFile(\"textures\/SOFA_logo.bmp\")\n , ambientColour(Vector3())\n , pick(NULL)\n , _stereoEnabled(false)\n , _stereoMode(STEREO_AUTO)\n , _stereoShift(1.0)\n{\n pick = new PickHandler();\n}\n\nBaseViewer::~BaseViewer()\n{\n if(texLogo)\n {\n delete texLogo;\n texLogo = NULL;\n }\n}\n\nsofa::simulation::Node* BaseViewer::getScene()\n{\n return groot.get();\n}\nconst std::string& BaseViewer::getSceneFileName()\n{\n return sceneFileName;\n}\nvoid BaseViewer::setSceneFileName(const std::string &f)\n{\n sceneFileName = f;\n}\n\nvoid BaseViewer::setScene(sofa::simulation::Node::SPtr scene, const char* filename \/* = NULL *\/, bool \/* = false *\/)\n{\n std::string file =\n filename ? sofa::helper::system::SetDirectory::GetFileNameWithoutExtension(\n filename) : std::string();\n std::string screenshotPrefix =\n sofa::helper::system::SetDirectory::GetParentDir(\n sofa::helper::system::DataRepository.getFirstPath().c_str())\n + std::string(\"\/share\/screenshots\/\") + file\n + std::string(\"_\");\n capture.setPrefix(screenshotPrefix);\n#ifdef SOFA_HAVE_FFMPEG\n videoRecorder.setPrefix(screenshotPrefix);\n#endif \/\/SOFA_HAVE_FFMPEG\n sceneFileName = filename ? filename : std::string(\"default.scn\");\n groot = scene;\n initTexturesDone = false;\n\n\n\n\n \/\/Camera initialization\n if (groot)\n {\n groot->get(currentCamera);\n if (!currentCamera)\n {\n currentCamera = sofa::core::objectmodel::New<component::visualmodel::InteractiveCamera>();\n currentCamera->setName(core::objectmodel::Base::shortName(currentCamera.get()));\n groot->addObject(currentCamera);\n currentCamera->p_position.forceSet();\n currentCamera->p_orientation.forceSet();\n currentCamera->bwdInit();\n\n }\n component::visualmodel::VisualStyle::SPtr visualStyle = NULL;\n groot->get(visualStyle);\n if (!visualStyle)\n {\n visualStyle = sofa::core::objectmodel::New<component::visualmodel::VisualStyle>();\n visualStyle->setName(core::objectmodel::Base::shortName(visualStyle.get()));\n\n core::visual::DisplayFlags* displayFlags = visualStyle->displayFlags.beginEdit();\n displayFlags->setShowVisualModels(sofa::core::visual::tristate::true_value);\n visualStyle->displayFlags.endEdit();\n\n groot->addObject(visualStyle);\n visualStyle->init();\n }\n\n currentCamera->setBoundingBox(groot->f_bbox.getValue().minBBox(), groot->f_bbox.getValue().maxBBox());\n\n \/\/ init pickHandler\n pick->init(groot.get());\n }\n\n}\n\nvoid BaseViewer::setCameraMode(core::visual::VisualParams::CameraType mode)\n{\n currentCamera->setCameraType(mode);\n}\n\nbool BaseViewer::ready()\n{\n return true;\n}\n\nvoid BaseViewer::wait()\n{\n}\n\nvoid BaseViewer::configure(sofa::component::configurationsetting::ViewerSetting* viewerConf)\n{\n using namespace core::visual;\n if (viewerConf->cameraMode.getValue().getSelectedId() == VisualParams::ORTHOGRAPHIC_TYPE)\n setCameraMode(VisualParams::ORTHOGRAPHIC_TYPE);\n else\n setCameraMode(VisualParams::PERSPECTIVE_TYPE);\n if ( viewerConf->objectPickingMethod.getValue().getSelectedId() == gui::PickHandler::RAY_CASTING)\n pick->setPickingMethod( gui::PickHandler::RAY_CASTING );\n else\n pick->setPickingMethod( gui::PickHandler::SELECTION_BUFFER);\n}\n\n\/\/Fonctions needed to take a screenshot\nconst std::string BaseViewer::screenshotName()\n{\n return capture.findFilename().c_str();\n}\n\nvoid BaseViewer::setPrefix(const std::string filename)\n{\n capture.setPrefix(filename);\n}\n\nvoid BaseViewer::screenshot(const std::string filename, int compression_level)\n{\n capture.saveScreen(filename, compression_level);\n}\n\nvoid BaseViewer::getView(Vec3d& pos, Quat& ori) const\n{\n if (!currentCamera)\n return;\n\n const Vec3d& camPosition = currentCamera->getPosition();\n const Quat& camOrientation = currentCamera->getOrientation();\n\n pos[0] = camPosition[0];\n pos[1] = camPosition[1];\n pos[2] = camPosition[2];\n\n ori[0] = camOrientation[0];\n ori[1] = camOrientation[1];\n ori[2] = camOrientation[2];\n ori[3] = camOrientation[3];\n}\n\nvoid BaseViewer::setView(const Vec3d& pos, const Quat &ori)\n{\n Vec3d position;\n Quat orientation;\n for (unsigned int i=0 ; i<3 ; i++)\n {\n position[i] = pos[i];\n orientation[i] = ori[i];\n }\n orientation[3] = ori[3];\n\n if (currentCamera)\n currentCamera->setView(position, orientation);\n\n redraw();\n}\n\nvoid BaseViewer::moveView(const Vec3d& pos, const Quat &ori)\n{\n if (!currentCamera)\n return;\n\n currentCamera->moveCamera(pos, ori);\n\n redraw();\n}\n\nvoid BaseViewer::newView()\n{\n if (!currentCamera || !groot)\n return;\n\n currentCamera->setDefaultView(groot->getGravity());\n}\n\nvoid BaseViewer::resetView()\n{\n redraw();\n}\n\nvoid BaseViewer::setBackgroundColour(float r, float g, float b)\n{\n _background = 2;\n backgroundColour[0] = r;\n backgroundColour[1] = g;\n backgroundColour[2] = b;\n}\n\nvoid BaseViewer::setBackgroundImage(std::string imageFileName)\n{\n _background = 0;\n\n if( sofa::helper::system::DataRepository.findFile(imageFileName) )\n {\n backgroundImageFile = sofa::helper::system::DataRepository.getFile(imageFileName);\n std::string extension = sofa::helper::system::SetDirectory::GetExtension(imageFileName.c_str());\n std::transform(extension.begin(),extension.end(),extension.begin(),::tolower );\n if(texLogo)\n {\n delete texLogo;\n texLogo = NULL;\n }\n helper::io::Image* image = helper::io::Image::FactoryImage::getInstance()->createObject(extension,backgroundImageFile);\n if( !image )\n {\n helper::vector<std::string> validExtensions;\n helper::io::Image::FactoryImage::getInstance()->uniqueKeys(std::back_inserter(validExtensions));\n std::cerr << \"Could not create: \" << imageFileName << std::endl;\n std::cerr << \"Valid extensions: \" << validExtensions << std::endl;\n }\n else\n {\n texLogo = new helper::gl::Texture( image );\n texLogo->init();\n\n }\n\n }\n}\n\nstd::string BaseViewer::getBackgroundImage()\n{\n return backgroundImageFile;\n}\n\nPickHandler* BaseViewer::getPickHandler()\n{\n return pick;\n}\n\nbool BaseViewer::unload(void)\n{\n getPickHandler()->reset();\n getPickHandler()->unload();\n return true;\n}\n\nvoid BaseViewer::fitNodeBBox(sofa::core::objectmodel::BaseNode * node )\n{\n if(!currentCamera) return;\n if( node->f_bbox.getValue().isValid() && !node->f_bbox.getValue().isFlat() )\n currentCamera->fitBoundingBox(\n node->f_bbox.getValue().minBBox(),\n node->f_bbox.getValue().maxBBox()\n );\n\n redraw();\n}\n\nvoid BaseViewer::fitObjectBBox(sofa::core::objectmodel::BaseObject * object)\n{\n if(!currentCamera) return;\n\n if( object->f_bbox.getValue().isValid() && !object->f_bbox.getValue().isFlat() )\n currentCamera->fitBoundingBox(object->f_bbox.getValue().minBBox(),\n object->f_bbox.getValue().maxBBox());\n else\n {\n if(object->getContext()->f_bbox.getValue().isValid() && !object->getContext()->f_bbox.getValue().isFlat() )\n {\n currentCamera->fitBoundingBox(\n object->getContext()->f_bbox.getValue().minBBox(),\n object->getContext()->f_bbox.getValue().maxBBox());\n }\n }\n redraw();\n}\n\n\n\n\n\n}\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Implementation of color.h.\n *\/\n\n#include \"color.h\"\n\nColor::Color(int id, string name, string pathToFMIndex) {\n this->id = id;\n \/\/\/ @todo initialize the FMIndex\n}\n\nColor::~Color() {\n \/\/\/ @todo destruct the FMIndex\n}\n\nbool Color::isVertex(string& s) const {\n return DBGQuery::isVertex(fmIndex, s);\n}\n\nbool Color::isPrefixNeighbor(string& s, char b) const {\n return DBGQuery::isPrefixNeighbor(fmIndex, s, b);\n}\n\nbool Color::isSuffixNeighbor(string& s, char b) const {\n return DBGQuery::isSuffixNeighbor(fmIndex, s, b);\n}\n\nvector<string> Color::getSuffixNeighbors(string& s) const {\n vector<string> neighbors;\n string neighborBases = DBGQuery::getSuffixNeighbors(fmIndex, s);\n string suffix = s.substr(1, s.length() - 1);\n\n for(unsigned int i = 0; i < neighborBases.length(); i++) {\n string neighbor = suffix + neighborBases[i];\n neighbors.push_back(neighbor);\n }\n\n return neighbors;\n}\n\nvector<string> Color::getPrefixNeighbors(string& s) const {\n vector<string> neighbors;\n string neighborBases = DBGQuery::getPrefixNeighbors(fmIndex, s);\n string prefix = s.substr(0, s.length() - 1);\n\n for(unsigned int i = 0; i < neighborBases.length(); i++) {\n string neighbor = neighborBases[i] + prefix;\n neighbors.push_back(neighbor);\n }\n\n return neighbors;\n}\n\npair<string, size_t> Color::extractSubstringAndIndex(size_t idx, size_t len) const {\n return DBGQuery::extractSubstringAndIndex(fmIndex, idx, len);\n}\n\nstring Color::extractSubstring(size_t idx, size_t len) const {\n return DBGQuery::extractSubstring(fmIndex, idx, len);\n}\n\nstring Color::getName() const {\n return name;\n}\n\nint Color::getID() const {\n return id;\n}\n\nFMIndex* Color::getFMIndex() const {\n return fmIndex;\n}\n<commit_msg>Implemented loading the FMIndex into color and setting the name.<commit_after>\/*\n * Implementation of color.h.\n *\/\n\n#include \"color.h\"\n\nColor::Color(int id, string name, string pathToFMIndex) {\n this->id = id;\n this->name = name;\n fmIndex = new FMIndex(pathToFMIndex, 256);\n}\n\nColor::~Color() {\n delete fmIndex;\n}\n\nbool Color::isVertex(string& s) const {\n return DBGQuery::isVertex(fmIndex, s);\n}\n\nbool Color::isPrefixNeighbor(string& s, char b) const {\n return DBGQuery::isPrefixNeighbor(fmIndex, s, b);\n}\n\nbool Color::isSuffixNeighbor(string& s, char b) const {\n return DBGQuery::isSuffixNeighbor(fmIndex, s, b);\n}\n\nvector<string> Color::getSuffixNeighbors(string& s) const {\n vector<string> neighbors;\n string neighborBases = DBGQuery::getSuffixNeighbors(fmIndex, s);\n string suffix = s.substr(1, s.length() - 1);\n\n for(unsigned int i = 0; i < neighborBases.length(); i++) {\n string neighbor = suffix + neighborBases[i];\n neighbors.push_back(neighbor);\n }\n\n return neighbors;\n}\n\nvector<string> Color::getPrefixNeighbors(string& s) const {\n vector<string> neighbors;\n string neighborBases = DBGQuery::getPrefixNeighbors(fmIndex, s);\n string prefix = s.substr(0, s.length() - 1);\n\n for(unsigned int i = 0; i < neighborBases.length(); i++) {\n string neighbor = neighborBases[i] + prefix;\n neighbors.push_back(neighbor);\n }\n\n return neighbors;\n}\n\npair<string, size_t> Color::extractSubstringAndIndex(size_t idx, size_t len) const {\n return DBGQuery::extractSubstringAndIndex(fmIndex, idx, len);\n}\n\nstring Color::extractSubstring(size_t idx, size_t len) const {\n return DBGQuery::extractSubstring(fmIndex, idx, len);\n}\n\nstring Color::getName() const {\n return name;\n}\n\nint Color::getID() const {\n return id;\n}\n\nFMIndex* Color::getFMIndex() const {\n return fmIndex;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- Mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*-\n\/\/ Copyright (c) 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ \n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ ---\n\/\/ Author: Sanjay Ghemawat <opensource@google.com>\n\n#include <stdlib.h> \/\/ for getenv and strtol\n#include \"config.h\"\n#include \"common.h\"\n#include \"system-alloc.h\"\n#include \"base\/spinlock.h\"\n\nnamespace tcmalloc {\n\n\/\/ Define the maximum number of object per classe type to transfer between\n\/\/ thread and central caches.\nstatic int32 FLAGS_tcmalloc_transfer_num_objects;\n\nstatic const int32 kDefaultTransferNumObjecs = 32768;\n\n\/\/ The init function is provided to explicit initialize the variable value\n\/\/ from the env. var to avoid C++ global construction that might defer its\n\/\/ initialization after a malloc\/new call.\nstatic inline void InitTCMallocTransferNumObjects()\n{\n if (UNLIKELY(FLAGS_tcmalloc_transfer_num_objects == 0)) {\n const char *envval = getenv(\"TCMALLOC_TRANSFER_NUM_OBJ\");\n FLAGS_tcmalloc_transfer_num_objects = !envval ? kDefaultTransferNumObjecs :\n strtol(envval, NULL, 10);\n }\n}\n\n\/\/ Note: the following only works for \"n\"s that fit in 32-bits, but\n\/\/ that is fine since we only use it for small sizes.\nstatic inline int LgFloor(size_t n) {\n int log = 0;\n for (int i = 4; i >= 0; --i) {\n int shift = (1 << i);\n size_t x = n >> shift;\n if (x != 0) {\n n = x;\n log += shift;\n }\n }\n ASSERT(n == 1);\n return log;\n}\n\nint AlignmentForSize(size_t size) {\n int alignment = kAlignment;\n if (size > kMaxSize) {\n \/\/ Cap alignment at kPageSize for large sizes.\n alignment = kPageSize;\n } else if (size >= 128) {\n \/\/ Space wasted due to alignment is at most 1\/8, i.e., 12.5%.\n alignment = (1 << LgFloor(size)) \/ 8;\n } else if (size >= kMinAlign) {\n \/\/ We need an alignment of at least 16 bytes to satisfy\n \/\/ requirements for some SSE types.\n alignment = kMinAlign;\n }\n \/\/ Maximum alignment allowed is page size alignment.\n if (alignment > kPageSize) {\n alignment = kPageSize;\n }\n CHECK_CONDITION(size < kMinAlign || alignment >= kMinAlign);\n CHECK_CONDITION((alignment & (alignment - 1)) == 0);\n return alignment;\n}\n\nint SizeMap::NumMoveSize(size_t size) {\n if (size == 0) return 0;\n \/\/ Use approx 64k transfers between thread and central caches.\n int num = static_cast<int>(64.0 * 1024.0 \/ size);\n if (num < 2) num = 2;\n\n \/\/ Avoid bringing too many objects into small object free lists.\n \/\/ If this value is too large:\n \/\/ - We waste memory with extra objects sitting in the thread caches.\n \/\/ - The central freelist holds its lock for too long while\n \/\/ building a linked list of objects, slowing down the allocations\n \/\/ of other threads.\n \/\/ If this value is too small:\n \/\/ - We go to the central freelist too often and we have to acquire\n \/\/ its lock each time.\n \/\/ This value strikes a balance between the constraints above.\n if (num > FLAGS_tcmalloc_transfer_num_objects)\n num = FLAGS_tcmalloc_transfer_num_objects;\n\n return num;\n}\n\n\/\/ Initialize the mapping arrays\nvoid SizeMap::Init() {\n InitTCMallocTransferNumObjects();\n\n \/\/ Do some sanity checking on add_amount[]\/shift_amount[]\/class_array[]\n if (ClassIndex(0) < 0) {\n Log(kCrash, __FILE__, __LINE__,\n \"Invalid class index for size 0\", ClassIndex(0));\n }\n if (ClassIndex(kMaxSize) >= sizeof(class_array_)) {\n Log(kCrash, __FILE__, __LINE__,\n \"Invalid class index for kMaxSize\", ClassIndex(kMaxSize));\n }\n\n \/\/ Compute the size classes we want to use\n int sc = 1; \/\/ Next size class to assign\n int alignment = kAlignment;\n CHECK_CONDITION(kAlignment <= kMinAlign);\n for (size_t size = kAlignment; size <= kMaxSize; size += alignment) {\n alignment = AlignmentForSize(size);\n CHECK_CONDITION((size % alignment) == 0);\n\n int blocks_to_move = NumMoveSize(size) \/ 4;\n size_t psize = 0;\n do {\n psize += kPageSize;\n \/\/ Allocate enough pages so leftover is less than 1\/8 of total.\n \/\/ This bounds wasted space to at most 12.5%.\n while ((psize % size) > (psize >> 3)) {\n psize += kPageSize;\n }\n \/\/ Continue to add pages until there are at least as many objects in\n \/\/ the span as are needed when moving objects from the central\n \/\/ freelists and spans to the thread caches.\n } while ((psize \/ size) < (blocks_to_move));\n const size_t my_pages = psize >> kPageShift;\n\n if (sc > 1 && my_pages == class_to_pages_[sc-1]) {\n \/\/ See if we can merge this into the previous class without\n \/\/ increasing the fragmentation of the previous class.\n const size_t my_objects = (my_pages << kPageShift) \/ size;\n const size_t prev_objects = (class_to_pages_[sc-1] << kPageShift)\n \/ class_to_size_[sc-1];\n if (my_objects == prev_objects) {\n \/\/ Adjust last class to include this size\n class_to_size_[sc-1] = size;\n continue;\n }\n }\n\n \/\/ Add new class\n class_to_pages_[sc] = my_pages;\n class_to_size_[sc] = size;\n sc++;\n }\n if (sc != kNumClasses) {\n Log(kCrash, __FILE__, __LINE__,\n \"wrong number of size classes: (found vs. expected )\", sc, kNumClasses);\n }\n\n \/\/ Initialize the mapping arrays\n int next_size = 0;\n for (int c = 1; c < kNumClasses; c++) {\n const int max_size_in_class = class_to_size_[c];\n for (int s = next_size; s <= max_size_in_class; s += kAlignment) {\n class_array_[ClassIndex(s)] = c;\n }\n next_size = max_size_in_class + kAlignment;\n }\n\n \/\/ Double-check sizes just to be safe\n for (size_t size = 0; size <= kMaxSize; size++) {\n const int sc = SizeClass(size);\n if (sc <= 0 || sc >= kNumClasses) {\n Log(kCrash, __FILE__, __LINE__,\n \"Bad size class (class, size)\", sc, size);\n }\n if (sc > 1 && size <= class_to_size_[sc-1]) {\n Log(kCrash, __FILE__, __LINE__,\n \"Allocating unnecessarily large class (class, size)\", sc, size);\n }\n const size_t s = class_to_size_[sc];\n if (size > s || s == 0) {\n Log(kCrash, __FILE__, __LINE__,\n \"Bad (class, size, requested)\", sc, s, size);\n }\n }\n\n \/\/ Initialize the num_objects_to_move array.\n for (size_t cl = 1; cl < kNumClasses; ++cl) {\n num_objects_to_move_[cl] = NumMoveSize(ByteSizeForClass(cl));\n }\n}\n\n\/\/ Metadata allocator -- keeps stats about how many bytes allocated.\nstatic uint64_t metadata_system_bytes_ = 0;\nstatic const size_t kMetadataAllocChunkSize = 8*1024*1024;\nstatic const size_t kMetadataBigAllocThreshold = kMetadataAllocChunkSize \/ 8;\n\/\/ usually malloc uses larger alignments, but because metadata cannot\n\/\/ have and fancy simd types, aligning on pointer size seems fine\nstatic const size_t kMetadataAllignment = sizeof(void *);\n\nstatic char *metadata_chunk_alloc_;\nstatic size_t metadata_chunk_avail_;\n\nstatic SpinLock metadata_alloc_lock(SpinLock::LINKER_INITIALIZED);\n\nvoid* MetaDataAlloc(size_t bytes) {\n if (bytes >= kMetadataAllocChunkSize) {\n void *rv = TCMalloc_SystemAlloc(bytes,\n NULL, kMetadataAllignment);\n if (rv != NULL) {\n metadata_system_bytes_ += bytes;\n }\n return rv;\n }\n\n SpinLockHolder h(&metadata_alloc_lock);\n\n \/\/ the following works by essentially turning address to integer of\n \/\/ log_2 kMetadataAllignment size and negating it. I.e. negated\n \/\/ value + original value gets 0 and that's what we want modulo\n \/\/ kMetadataAllignment. Note, we negate before masking higher bits\n \/\/ off, otherwise we'd have to mask them off after negation anyways.\n intptr_t alignment = -reinterpret_cast<intptr_t>(metadata_chunk_alloc_) & (kMetadataAllignment-1);\n\n if (metadata_chunk_avail_ < bytes + alignment) {\n size_t real_size;\n void *ptr = TCMalloc_SystemAlloc(kMetadataAllocChunkSize,\n &real_size, kMetadataAllignment);\n if (ptr == NULL) {\n return NULL;\n }\n\n metadata_chunk_alloc_ = static_cast<char *>(ptr);\n metadata_chunk_avail_ = real_size;\n\n alignment = 0;\n }\n\n void *rv = static_cast<void *>(metadata_chunk_alloc_ + alignment);\n bytes += alignment;\n metadata_chunk_alloc_ += bytes;\n metadata_chunk_avail_ -= bytes;\n metadata_system_bytes_ += bytes;\n return rv;\n}\n\nuint64_t metadata_system_bytes() { return metadata_system_bytes_; }\n\n} \/\/ namespace tcmalloc\n<commit_msg>skip unnecessary check during double-check SizeClass intergrity<commit_after>\/\/ -*- Mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*-\n\/\/ Copyright (c) 2008, Google Inc.\n\/\/ All rights reserved.\n\/\/ \n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are\n\/\/ met:\n\/\/ \n\/\/ * Redistributions of source code must retain the above copyright\n\/\/ notice, this list of conditions and the following disclaimer.\n\/\/ * Redistributions in binary form must reproduce the above\n\/\/ copyright notice, this list of conditions and the following disclaimer\n\/\/ in the documentation and\/or other materials provided with the\n\/\/ distribution.\n\/\/ * Neither the name of Google Inc. nor the names of its\n\/\/ contributors may be used to endorse or promote products derived from\n\/\/ this software without specific prior written permission.\n\/\/ \n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\/\/ \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n\/\/ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n\/\/ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n\/\/ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n\/\/ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n\/\/ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n\/\/ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n\/\/ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n\/\/ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n\/\/ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\n\/\/ ---\n\/\/ Author: Sanjay Ghemawat <opensource@google.com>\n\n#include <stdlib.h> \/\/ for getenv and strtol\n#include \"config.h\"\n#include \"common.h\"\n#include \"system-alloc.h\"\n#include \"base\/spinlock.h\"\n\nnamespace tcmalloc {\n\n\/\/ Define the maximum number of object per classe type to transfer between\n\/\/ thread and central caches.\nstatic int32 FLAGS_tcmalloc_transfer_num_objects;\n\nstatic const int32 kDefaultTransferNumObjecs = 32768;\n\n\/\/ The init function is provided to explicit initialize the variable value\n\/\/ from the env. var to avoid C++ global construction that might defer its\n\/\/ initialization after a malloc\/new call.\nstatic inline void InitTCMallocTransferNumObjects()\n{\n if (UNLIKELY(FLAGS_tcmalloc_transfer_num_objects == 0)) {\n const char *envval = getenv(\"TCMALLOC_TRANSFER_NUM_OBJ\");\n FLAGS_tcmalloc_transfer_num_objects = !envval ? kDefaultTransferNumObjecs :\n strtol(envval, NULL, 10);\n }\n}\n\n\/\/ Note: the following only works for \"n\"s that fit in 32-bits, but\n\/\/ that is fine since we only use it for small sizes.\nstatic inline int LgFloor(size_t n) {\n int log = 0;\n for (int i = 4; i >= 0; --i) {\n int shift = (1 << i);\n size_t x = n >> shift;\n if (x != 0) {\n n = x;\n log += shift;\n }\n }\n ASSERT(n == 1);\n return log;\n}\n\nint AlignmentForSize(size_t size) {\n int alignment = kAlignment;\n if (size > kMaxSize) {\n \/\/ Cap alignment at kPageSize for large sizes.\n alignment = kPageSize;\n } else if (size >= 128) {\n \/\/ Space wasted due to alignment is at most 1\/8, i.e., 12.5%.\n alignment = (1 << LgFloor(size)) \/ 8;\n } else if (size >= kMinAlign) {\n \/\/ We need an alignment of at least 16 bytes to satisfy\n \/\/ requirements for some SSE types.\n alignment = kMinAlign;\n }\n \/\/ Maximum alignment allowed is page size alignment.\n if (alignment > kPageSize) {\n alignment = kPageSize;\n }\n CHECK_CONDITION(size < kMinAlign || alignment >= kMinAlign);\n CHECK_CONDITION((alignment & (alignment - 1)) == 0);\n return alignment;\n}\n\nint SizeMap::NumMoveSize(size_t size) {\n if (size == 0) return 0;\n \/\/ Use approx 64k transfers between thread and central caches.\n int num = static_cast<int>(64.0 * 1024.0 \/ size);\n if (num < 2) num = 2;\n\n \/\/ Avoid bringing too many objects into small object free lists.\n \/\/ If this value is too large:\n \/\/ - We waste memory with extra objects sitting in the thread caches.\n \/\/ - The central freelist holds its lock for too long while\n \/\/ building a linked list of objects, slowing down the allocations\n \/\/ of other threads.\n \/\/ If this value is too small:\n \/\/ - We go to the central freelist too often and we have to acquire\n \/\/ its lock each time.\n \/\/ This value strikes a balance between the constraints above.\n if (num > FLAGS_tcmalloc_transfer_num_objects)\n num = FLAGS_tcmalloc_transfer_num_objects;\n\n return num;\n}\n\n\/\/ Initialize the mapping arrays\nvoid SizeMap::Init() {\n InitTCMallocTransferNumObjects();\n\n \/\/ Do some sanity checking on add_amount[]\/shift_amount[]\/class_array[]\n if (ClassIndex(0) < 0) {\n Log(kCrash, __FILE__, __LINE__,\n \"Invalid class index for size 0\", ClassIndex(0));\n }\n if (ClassIndex(kMaxSize) >= sizeof(class_array_)) {\n Log(kCrash, __FILE__, __LINE__,\n \"Invalid class index for kMaxSize\", ClassIndex(kMaxSize));\n }\n\n \/\/ Compute the size classes we want to use\n int sc = 1; \/\/ Next size class to assign\n int alignment = kAlignment;\n CHECK_CONDITION(kAlignment <= kMinAlign);\n for (size_t size = kAlignment; size <= kMaxSize; size += alignment) {\n alignment = AlignmentForSize(size);\n CHECK_CONDITION((size % alignment) == 0);\n\n int blocks_to_move = NumMoveSize(size) \/ 4;\n size_t psize = 0;\n do {\n psize += kPageSize;\n \/\/ Allocate enough pages so leftover is less than 1\/8 of total.\n \/\/ This bounds wasted space to at most 12.5%.\n while ((psize % size) > (psize >> 3)) {\n psize += kPageSize;\n }\n \/\/ Continue to add pages until there are at least as many objects in\n \/\/ the span as are needed when moving objects from the central\n \/\/ freelists and spans to the thread caches.\n } while ((psize \/ size) < (blocks_to_move));\n const size_t my_pages = psize >> kPageShift;\n\n if (sc > 1 && my_pages == class_to_pages_[sc-1]) {\n \/\/ See if we can merge this into the previous class without\n \/\/ increasing the fragmentation of the previous class.\n const size_t my_objects = (my_pages << kPageShift) \/ size;\n const size_t prev_objects = (class_to_pages_[sc-1] << kPageShift)\n \/ class_to_size_[sc-1];\n if (my_objects == prev_objects) {\n \/\/ Adjust last class to include this size\n class_to_size_[sc-1] = size;\n continue;\n }\n }\n\n \/\/ Add new class\n class_to_pages_[sc] = my_pages;\n class_to_size_[sc] = size;\n sc++;\n }\n if (sc != kNumClasses) {\n Log(kCrash, __FILE__, __LINE__,\n \"wrong number of size classes: (found vs. expected )\", sc, kNumClasses);\n }\n\n \/\/ Initialize the mapping arrays\n int next_size = 0;\n for (int c = 1; c < kNumClasses; c++) {\n const int max_size_in_class = class_to_size_[c];\n for (int s = next_size; s <= max_size_in_class; s += kAlignment) {\n class_array_[ClassIndex(s)] = c;\n }\n next_size = max_size_in_class + kAlignment;\n }\n\n \/\/ Double-check sizes just to be safe\n for (size_t size = 0; size <= kMaxSize;) {\n const int sc = SizeClass(size);\n if (sc <= 0 || sc >= kNumClasses) {\n Log(kCrash, __FILE__, __LINE__,\n \"Bad size class (class, size)\", sc, size);\n }\n if (sc > 1 && size <= class_to_size_[sc-1]) {\n Log(kCrash, __FILE__, __LINE__,\n \"Allocating unnecessarily large class (class, size)\", sc, size);\n }\n const size_t s = class_to_size_[sc];\n if (size > s || s == 0) {\n Log(kCrash, __FILE__, __LINE__,\n \"Bad (class, size, requested)\", sc, s, size);\n }\n if (size <= kMaxSmallSize) {\n size += 8;\n } else {\n size += 128;\n }\n }\n\n \/\/ Initialize the num_objects_to_move array.\n for (size_t cl = 1; cl < kNumClasses; ++cl) {\n num_objects_to_move_[cl] = NumMoveSize(ByteSizeForClass(cl));\n }\n}\n\n\/\/ Metadata allocator -- keeps stats about how many bytes allocated.\nstatic uint64_t metadata_system_bytes_ = 0;\nstatic const size_t kMetadataAllocChunkSize = 8*1024*1024;\nstatic const size_t kMetadataBigAllocThreshold = kMetadataAllocChunkSize \/ 8;\n\/\/ usually malloc uses larger alignments, but because metadata cannot\n\/\/ have and fancy simd types, aligning on pointer size seems fine\nstatic const size_t kMetadataAllignment = sizeof(void *);\n\nstatic char *metadata_chunk_alloc_;\nstatic size_t metadata_chunk_avail_;\n\nstatic SpinLock metadata_alloc_lock(SpinLock::LINKER_INITIALIZED);\n\nvoid* MetaDataAlloc(size_t bytes) {\n if (bytes >= kMetadataAllocChunkSize) {\n void *rv = TCMalloc_SystemAlloc(bytes,\n NULL, kMetadataAllignment);\n if (rv != NULL) {\n metadata_system_bytes_ += bytes;\n }\n return rv;\n }\n\n SpinLockHolder h(&metadata_alloc_lock);\n\n \/\/ the following works by essentially turning address to integer of\n \/\/ log_2 kMetadataAllignment size and negating it. I.e. negated\n \/\/ value + original value gets 0 and that's what we want modulo\n \/\/ kMetadataAllignment. Note, we negate before masking higher bits\n \/\/ off, otherwise we'd have to mask them off after negation anyways.\n intptr_t alignment = -reinterpret_cast<intptr_t>(metadata_chunk_alloc_) & (kMetadataAllignment-1);\n\n if (metadata_chunk_avail_ < bytes + alignment) {\n size_t real_size;\n void *ptr = TCMalloc_SystemAlloc(kMetadataAllocChunkSize,\n &real_size, kMetadataAllignment);\n if (ptr == NULL) {\n return NULL;\n }\n\n metadata_chunk_alloc_ = static_cast<char *>(ptr);\n metadata_chunk_avail_ = real_size;\n\n alignment = 0;\n }\n\n void *rv = static_cast<void *>(metadata_chunk_alloc_ + alignment);\n bytes += alignment;\n metadata_chunk_alloc_ += bytes;\n metadata_chunk_avail_ -= bytes;\n metadata_system_bytes_ += bytes;\n return rv;\n}\n\nuint64_t metadata_system_bytes() { return metadata_system_bytes_; }\n\n} \/\/ namespace tcmalloc\n<|endoftext|>"} {"text":"<commit_before>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <algorithm>\n#include <unistd.h>\n#include <fnord-base\/UTF8.h>\n#include \"common.h\"\n\nnamespace cm {\n\n\/**\n * mandatory params:\n * v -- pixel ver. -- value: 1\n * c -- clickid -- format \"<uid>~<eventid>\", e.g. \"f97650cb~b28c61d5c\"\n * e -- eventtype -- format \"{q,v}\" (query, visit)\n *\n * params for eventtype=q (query):\n * is -- item ids -- format \"<setid>~<itemid>~<pos>,...\"\n *\n * params for eventtype=v (visit):\n * i -- itemid -- format \"<setid>~<itemid>\"\n *\n *\/\nbool isReservedPixelParam(const std::string p) {\n return p == \"c\" || p == \"e\" || p == \"i\" || p == \"is\" || p == \"v\";\n}\n\nstd::string cmHostname() {\n char hostname[128];\n gethostname(hostname, sizeof(hostname));\n hostname[127] = 0;\n return std::string(hostname);\n}\n\nOption<String> extractAttr(const Vector<String>& attrs, const String& attr) {\n auto prefix = attr + \":\";\n\n for (const auto& a : attrs) {\n if (StringUtil::beginsWith(a, prefix)) {\n return Some(a.substr(prefix.length()));\n }\n }\n\n return None<String>();\n}\n\nString joinBagOfWords(const Set<String>& words) {\n Vector<String> v;\n\n for (const auto& w : words) {\n if (w.length() == 0) {\n continue;\n }\n\n v.emplace_back(w);\n }\n\n std::sort(v.begin(), v.end());\n\n return StringUtil::join(v, \" \");\n}\n\nbool isQueryEligible(\n ItemEligibility eligibility,\n const cm::JoinedQuery& query) {\n switch (eligibility) {\n\n case ItemEligibility::DAWANDA_ALL_NOBOTS: {\n auto pgs = extractAttr(query.attrs, \"pg\");\n if (pgs.isEmpty()) {\n return false;\n }\n\n auto pg = std::stoul(pgs.get());\n return pg <= 3;\n }\n\n case ItemEligibility::ALL:\n return true;\n\n }\n}\n\nbool isItemEligible(\n ItemEligibility eligibility,\n const cm::JoinedQuery& query,\n const cm::JoinedQueryItem& item) {\n switch (eligibility) {\n\n case ItemEligibility::DAWANDA_ALL_NOBOTS:\n return item.position <= 40 && item.position > 0;\n\n case ItemEligibility::ALL:\n return true;\n\n }\n}\n\n}\n<commit_msg>make legacy pixel lines eligible<commit_after>\/**\n * Copyright (c) 2015 - The CM Authors <legal@clickmatcher.com>\n * All Rights Reserved.\n *\n * This file is CONFIDENTIAL -- Distribution or duplication of this material or\n * the information contained herein is strictly forbidden unless prior written\n * permission is obtained.\n *\/\n#include <algorithm>\n#include <unistd.h>\n#include <fnord-base\/UTF8.h>\n#include \"common.h\"\n\nnamespace cm {\n\n\/**\n * mandatory params:\n * v -- pixel ver. -- value: 1\n * c -- clickid -- format \"<uid>~<eventid>\", e.g. \"f97650cb~b28c61d5c\"\n * e -- eventtype -- format \"{q,v}\" (query, visit)\n *\n * params for eventtype=q (query):\n * is -- item ids -- format \"<setid>~<itemid>~<pos>,...\"\n *\n * params for eventtype=v (visit):\n * i -- itemid -- format \"<setid>~<itemid>\"\n *\n *\/\nbool isReservedPixelParam(const std::string p) {\n return p == \"c\" || p == \"e\" || p == \"i\" || p == \"is\" || p == \"v\";\n}\n\nstd::string cmHostname() {\n char hostname[128];\n gethostname(hostname, sizeof(hostname));\n hostname[127] = 0;\n return std::string(hostname);\n}\n\nOption<String> extractAttr(const Vector<String>& attrs, const String& attr) {\n auto prefix = attr + \":\";\n\n for (const auto& a : attrs) {\n if (StringUtil::beginsWith(a, prefix)) {\n return Some(a.substr(prefix.length()));\n }\n }\n\n return None<String>();\n}\n\nString joinBagOfWords(const Set<String>& words) {\n Vector<String> v;\n\n for (const auto& w : words) {\n if (w.length() == 0) {\n continue;\n }\n\n v.emplace_back(w);\n }\n\n std::sort(v.begin(), v.end());\n\n return StringUtil::join(v, \" \");\n}\n\nbool isQueryEligible(\n ItemEligibility eligibility,\n const cm::JoinedQuery& query) {\n switch (eligibility) {\n\n case ItemEligibility::DAWANDA_ALL_NOBOTS: {\n auto pgs = extractAttr(query.attrs, \"pg\");\n if (pgs.isEmpty()) {\n return return;\n } else {\n auto pg = std::stoul(pgs.get());\n return pg <= 3;\n }\n }\n\n case ItemEligibility::ALL:\n return true;\n\n }\n}\n\nbool isItemEligible(\n ItemEligibility eligibility,\n const cm::JoinedQuery& query,\n const cm::JoinedQueryItem& item) {\n switch (eligibility) {\n\n case ItemEligibility::DAWANDA_ALL_NOBOTS:\n return item.position <= 40 && item.position > 0;\n\n case ItemEligibility::ALL:\n return true;\n\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <allegro.h>\n#ifdef ALLEGRO_WINDOWS\n#include <winalleg.h>\n#endif\n\n#ifndef ALLEGRO_WINDOWS\n#include <signal.h>\n#include <string.h>\n#endif\n\n#warning you are ugly\n\n#include \"globals.h\"\n#include \"init.h\"\n#include <pthread.h>\n#include \"network\/network.h\"\n\n#include <ostream>\n#include \"dumb\/include\/dumb.h\"\n#include \"dumb\/include\/aldumb.h\"\n#include \"loadpng\/loadpng.h\"\n#include \"util\/bitmap.h\"\n#include \"configuration.h\"\n#include \"script\/script.h\"\n\nusing namespace std;\n\nvolatile int Global::speed_counter = 0;\nvolatile int Global::second_counter = 0;\n\n\/* the original engine was running at 90 ticks per second, but we dont\n * need to render that fast, so TICS_PER_SECOND is really fps and\n * LOGIC_MULTIPLIER will be used to adjust the speed counter to its\n * original value.\n *\/\nstatic const int TICS_PER_SECOND = 40;\nconst double Global::LOGIC_MULTIPLIER = (double) 90 \/ (double) TICS_PER_SECOND;\nconst char * Global::shutdown_message = \"Shutting down..\";\n \npthread_mutex_t Global::loading_screen_mutex;\nbool Global::done_loading = false;\n\nconst int Global::WINDOWED = GFX_AUTODETECT_WINDOWED;\nconst int Global::FULLSCREEN = GFX_AUTODETECT_FULLSCREEN;\n\nvoid inc_speed_counter() {\n\tGlobal::speed_counter += 1;\n}\nEND_OF_FUNCTION( inc_speed_counter );\n\nvoid inc_second_counter() {\n\tGlobal::second_counter += 1;\n}\nEND_OF_FUNCTION( inc_second_counter );\n\n#ifndef ALLEGRO_WINDOWS\nstatic void handleSigSegV(int i, siginfo_t * sig, void * data){\n Global::shutdown_message = \"Bug! Caught a memory violation. Shutting down..\";\n Bitmap::setGfxModeText();\n allegro_exit();\n \/* write to a log file or something because sigsegv shouldn't\n * normally happen.\n *\/\n exit(0);\n}\n#else\n#endif\n\n\/* catch a socket being closed prematurely on unix *\/\n#ifndef ALLEGRO_WINDOWS\nstatic void handleSigPipe( int i, siginfo_t * sig, void * data ){\n}\n\n\/*\nstatic void handleSigUsr1( int i, siginfo_t * sig, void * data ){\n\tpthread_exit( NULL );\n}\n*\/\n#endif\n\nstatic void registerSignals(){\n#ifndef ALLEGRO_WINDOWS\n\tstruct sigaction action;\n\tmemset( &action, 0, sizeof(struct sigaction) );\n\taction.sa_sigaction = handleSigPipe;\n\tsigaction( SIGPIPE, &action, NULL );\n\n\tmemset( &action, 0, sizeof(struct sigaction) );\n\taction.sa_sigaction = handleSigSegV;\n\tsigaction( SIGSEGV, &action, NULL );\n\n\t\/*\n\taction.sa_sigaction = handleSigUsr1;\n\tsigaction( SIGUSR1, &action, NULL );\n\t*\/\n#endif\n}\n\nstatic void say_shutdown(){\n Global::debug(0) << Global::shutdown_message << endl;\n}\n\nstatic void close_paintown(){\n Bitmap::setGfxModeText();\n allegro_exit();\n exit(0);\n}\nEND_OF_FUNCTION(close_paintown)\n\nbool Global::init( int gfx ){\n\n\tostream & out = Global::debug( 0 );\n\tout << \"-- BEGIN init --\" << endl;\n out << \"Paintown version \" << Global::getVersionString() << endl;\n\tout << \"Allegro version: \" << ALLEGRO_VERSION_STR << endl;\n\tout <<\"Allegro init: \"<<allegro_init()<<endl;\n\tout <<\"Install timer: \"<<install_timer()<<endl;\n\t\n\tset_volume_per_voice( 0 );\n\tout<<\"Install sound: \"<<install_sound( DIGI_AUTODETECT, MIDI_NONE, \"\" )<<endl;\n\t\n \/* png *\/\n\tloadpng_init();\n \n Bitmap::SCALE_X = GFX_X;\n Bitmap::SCALE_Y = GFX_Y;\n\t\n Configuration::loadConfigurations();\n\n const int sx = Configuration::getScreenWidth();\n const int sy = Configuration::getScreenHeight();\n\n\tout<<\"Install keyboard: \"<<install_keyboard()<<endl;\n\tout<<\"Install mouse: \"<<install_mouse()<<endl;\n \/* 16 bit color depth *\/\n\tset_color_depth( 16 );\n\n \/* set up the screen *\/\n\tout<<\"Set gfx mode: \" << Bitmap::setGraphicsMode( gfx, sx, sy ) <<endl;\n\n\tLOCK_VARIABLE( speed_counter );\n\tLOCK_VARIABLE( second_counter );\n\tLOCK_FUNCTION( (void *)inc_speed_counter );\n\tLOCK_FUNCTION( (void *)inc_second_counter );\n \/* set up the timers *\/\n\tout<<\"Install game timer: \"<<install_int_ex( inc_speed_counter, BPS_TO_TIMER( TICS_PER_SECOND ) )<<endl;\n\tout<<\"Install second timer: \"<<install_int_ex( inc_second_counter, BPS_TO_TIMER( 1 ) )<<endl;\n\tout << \"Initialize random number generator\" << endl;\n \/* initialize random number generator *\/\n\tsrand( time( NULL ) );\n\n \/* keep running in the background *\/\n\tset_display_switch_mode(SWITCH_BACKGROUND);\n\n \/* close window when the X is pressed *\/\n LOCK_FUNCTION(close_paintown);\n set_close_button_callback(close_paintown);\n\t\n \/* music *\/\n atexit(say_shutdown);\n\tatexit( &dumb_exit );\n\tatexit( Network::closeAll );\n\tdumb_register_packfiles();\n\n\tregisterSignals();\n\n\tout << \"Initialize network\" << endl;\n\tNetwork::init();\n\n \/* this mutex is used to show the loading screen while the game loads *\/\n\tpthread_mutex_init( &Global::loading_screen_mutex, NULL );\n\t\n\tout<<\"-- END init --\"<<endl;\n\n\treturn true;\n}\n<commit_msg>use write directly<commit_after>#include <allegro.h>\n#ifdef ALLEGRO_WINDOWS\n#include <winalleg.h>\n#endif\n\n#ifndef ALLEGRO_WINDOWS\n#include <signal.h>\n#include <string.h>\n#endif\n\n#warning you are ugly\n\n#include \"globals.h\"\n#include \"init.h\"\n#include <pthread.h>\n#include \"network\/network.h\"\n\n#include <ostream>\n#include \"dumb\/include\/dumb.h\"\n#include \"dumb\/include\/aldumb.h\"\n#include \"loadpng\/loadpng.h\"\n#include \"util\/bitmap.h\"\n#include \"configuration.h\"\n#include \"script\/script.h\"\n\nusing namespace std;\n\nvolatile int Global::speed_counter = 0;\nvolatile int Global::second_counter = 0;\n\n\/* the original engine was running at 90 ticks per second, but we dont\n * need to render that fast, so TICS_PER_SECOND is really fps and\n * LOGIC_MULTIPLIER will be used to adjust the speed counter to its\n * original value.\n *\/\nstatic const int TICS_PER_SECOND = 40;\nconst double Global::LOGIC_MULTIPLIER = (double) 90 \/ (double) TICS_PER_SECOND;\nconst char * Global::shutdown_message = \"Shutting down..\";\n \npthread_mutex_t Global::loading_screen_mutex;\nbool Global::done_loading = false;\n\nconst int Global::WINDOWED = GFX_AUTODETECT_WINDOWED;\nconst int Global::FULLSCREEN = GFX_AUTODETECT_FULLSCREEN;\n\nvoid inc_speed_counter() {\n\tGlobal::speed_counter += 1;\n}\nEND_OF_FUNCTION( inc_speed_counter );\n\nvoid inc_second_counter() {\n\tGlobal::second_counter += 1;\n}\nEND_OF_FUNCTION( inc_second_counter );\n\n#ifndef ALLEGRO_WINDOWS\nstatic void handleSigSegV(int i, siginfo_t * sig, void * data){\n const char * message = \"Bug! Caught a memory violation. Shutting down..\\n\";\n write(1, message, 48);\n \/\/ Global::shutdown_message = \"Bug! Caught a memory violation. Shutting down..\";\n Bitmap::setGfxModeText();\n allegro_exit();\n \/* write to a log file or something because sigsegv shouldn't\n * normally happen.\n *\/\n exit(0);\n}\n#else\n#endif\n\n\/* catch a socket being closed prematurely on unix *\/\n#ifndef ALLEGRO_WINDOWS\nstatic void handleSigPipe( int i, siginfo_t * sig, void * data ){\n}\n\n\/*\nstatic void handleSigUsr1( int i, siginfo_t * sig, void * data ){\n\tpthread_exit( NULL );\n}\n*\/\n#endif\n\nstatic void registerSignals(){\n#ifndef ALLEGRO_WINDOWS\n\tstruct sigaction action;\n\tmemset( &action, 0, sizeof(struct sigaction) );\n\taction.sa_sigaction = handleSigPipe;\n\tsigaction( SIGPIPE, &action, NULL );\n\n\tmemset( &action, 0, sizeof(struct sigaction) );\n\taction.sa_sigaction = handleSigSegV;\n\tsigaction( SIGSEGV, &action, NULL );\n\n\t\/*\n\taction.sa_sigaction = handleSigUsr1;\n\tsigaction( SIGUSR1, &action, NULL );\n\t*\/\n#endif\n}\n\nstatic void say_shutdown(){\n Global::debug(0) << Global::shutdown_message << endl;\n}\n\nstatic void close_paintown(){\n Bitmap::setGfxModeText();\n allegro_exit();\n exit(0);\n}\nEND_OF_FUNCTION(close_paintown)\n\nbool Global::init( int gfx ){\n\n\tostream & out = Global::debug( 0 );\n\tout << \"-- BEGIN init --\" << endl;\n out << \"Paintown version \" << Global::getVersionString() << endl;\n\tout << \"Allegro version: \" << ALLEGRO_VERSION_STR << endl;\n\tout <<\"Allegro init: \"<<allegro_init()<<endl;\n\tout <<\"Install timer: \"<<install_timer()<<endl;\n\t\n\tset_volume_per_voice( 0 );\n\tout<<\"Install sound: \"<<install_sound( DIGI_AUTODETECT, MIDI_NONE, \"\" )<<endl;\n\t\n \/* png *\/\n\tloadpng_init();\n \n Bitmap::SCALE_X = GFX_X;\n Bitmap::SCALE_Y = GFX_Y;\n\t\n Configuration::loadConfigurations();\n\n const int sx = Configuration::getScreenWidth();\n const int sy = Configuration::getScreenHeight();\n\n\tout<<\"Install keyboard: \"<<install_keyboard()<<endl;\n\tout<<\"Install mouse: \"<<install_mouse()<<endl;\n \/* 16 bit color depth *\/\n\tset_color_depth( 16 );\n\n \/* set up the screen *\/\n\tout<<\"Set gfx mode: \" << Bitmap::setGraphicsMode( gfx, sx, sy ) <<endl;\n\n\tLOCK_VARIABLE( speed_counter );\n\tLOCK_VARIABLE( second_counter );\n\tLOCK_FUNCTION( (void *)inc_speed_counter );\n\tLOCK_FUNCTION( (void *)inc_second_counter );\n \/* set up the timers *\/\n\tout<<\"Install game timer: \"<<install_int_ex( inc_speed_counter, BPS_TO_TIMER( TICS_PER_SECOND ) )<<endl;\n\tout<<\"Install second timer: \"<<install_int_ex( inc_second_counter, BPS_TO_TIMER( 1 ) )<<endl;\n\tout << \"Initialize random number generator\" << endl;\n \/* initialize random number generator *\/\n\tsrand( time( NULL ) );\n\n \/* keep running in the background *\/\n\tset_display_switch_mode(SWITCH_BACKGROUND);\n\n \/* close window when the X is pressed *\/\n LOCK_FUNCTION(close_paintown);\n set_close_button_callback(close_paintown);\n\t\n \/* music *\/\n\tatexit( &dumb_exit );\n\tatexit( Network::closeAll );\n\tdumb_register_packfiles();\n\n\tregisterSignals();\n\n\tout << \"Initialize network\" << endl;\n\tNetwork::init();\n\n \/* this mutex is used to show the loading screen while the game loads *\/\n\tpthread_mutex_init( &Global::loading_screen_mutex, NULL );\n\t\n\tout<<\"-- END init --\"<<endl;\n\n\treturn true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/_________________________________________________________________________\n\/\/ Implementation version v1 of the EMCAL particle identifier \n\n\/\/*-- Author: Yves Schutz (SUBATECH) \n\/\/\n\/\/ --- ROOT system ---\n\/\/#include \"TROOT.h\"\n#include \"TTree.h\"\n#include \"TBenchmark.h\"\n#include \"TSystem.h\"\n \n \/\/ --- Standard library ---\n \n \/\/ --- AliRoot header files ---\n#include \"AliGenerator.h\"\n#include \"AliEMCALPIDv1.h\"\n#include \"AliEMCALRecParticle.h\"\n#include \"AliEMCALGetter.h\"\n \n ClassImp( AliEMCALPIDv1) \n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1():AliEMCALPID()\n{ \n \/\/ default ctor\n \n InitParameters() ; \n fDefaultInit = kTRUE ; \n \n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1(const AliEMCALPIDv1 & pid ):AliEMCALPID(pid)\n{ \n \/\/ ctor\n InitParameters() ; \n Init() ;\n \n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1(const TString alirunFileName, const TString eventFolderName):AliEMCALPID(alirunFileName, eventFolderName)\n{ \n \/\/ctor with the indication on where to look for the track segments\n \n InitParameters() ; \n Init() ;\n fDefaultInit = kFALSE ; \n\n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::~AliEMCALPIDv1()\n{ \n \/\/ dtor\n}\n\n\/\/____________________________________________________________________________\nconst TString AliEMCALPIDv1::BranchName() const \n{ \n\n return GetName() ;\n}\n \n\/\/____________________________________________________________________________\nFloat_t AliEMCALPIDv1::GetCalibratedEnergy(Float_t e) const\n{\n\/\/ It calibrates Energy depending on the recpoint energy.\n\/\/ The energy of the reconstructed cluster is corrected with \n\/\/ the formula A + B* E + C* E^2, whose parameters where obtained \n\/\/ through the study of the reconstructed energy distribution of \n\/\/ monoenergetic photons.\n \n \/\/Float_t p[]={0.,0.,0.};\n \/\/for (Int_t i=0; i<3; i++) p[i] = GetParameterCalibration(i);\n Float_t enerec = e ; \/\/ p[0] + p[1]*e + p[2]*e*e;\n return enerec ;\n\n}\n\/\/____________________________________________________________________________\nTVector3 AliEMCALPIDv1::GetMomentumDirection(AliEMCALRecPoint * emc)const \n{ \n \/\/ Calculates the momentum direction:\n \/\/ direction is given by IP and this RecPoint\n \n\n TVector3 dir(0,0,0) ; \n TVector3 emcglobalpos ;\n \/\/ TMatrix dummy ;\n \n emc->GetGlobalPosition(emcglobalpos) ;\n \n\n dir = emcglobalpos ; \n dir.SetZ( -dir.Z() ) ; \/\/ why ? \n \/\/ dir.SetMag(1.) ; Removed to avoid warings !!!!!!!!!!!!!! TO BE REVISED\n\n \/\/account correction to the position of IP\n Float_t xo,yo,zo ; \/\/Coordinates of the origin\n gAlice->Generator()->GetOrigin(xo,yo,zo) ;\n TVector3 origin(xo,yo,zo);\n dir = dir - origin ;\n\n return dir ; \n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Init()\n{\n \/\/ Make all memory allocations that are not possible in default constructor\n \/\/ Add the PID task to the list of EMCAL tasks\n\n\n AliEMCALGetter * gime = AliEMCALGetter::Instance(GetTitle(), fEventFolderName.Data()) ; \n\n if ( !gime->PID() ) \n gime->PostPID(this) ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::InitParameters()\n{\n \/\/ Initialize the parameters\n fRecParticlesInRun = 0 ; \n fNEvent = 0 ; \n fRecParticlesInRun = 0 ;\n}\n\n\/\/____________________________________________________________________________\n\nvoid AliEMCALPIDv1::Exec(Option_t * option) \n{\n \/\/Steering method\n\n if(strstr(option,\"tim\"))\n gBenchmark->Start(\"EMCALPID\");\n \n if(strstr(option,\"print\")) {\n Print(\"\") ; \n return ; \n }\n AliEMCALGetter * gime = AliEMCALGetter::Instance(GetTitle()) ; \n\n if (fLastEvent == -1) \n fLastEvent = gime->MaxEvent() - 1 ;\n else \n fLastEvent = TMath::Min(fLastEvent,gime->MaxEvent());\n Int_t nEvents = fLastEvent - fFirstEvent + 1;\n\n Int_t ievent ;\n\n\n for (ievent = fFirstEvent; ievent <= fLastEvent; ievent++) {\n gime->Event(ievent,\"R\") ;\n MakeRecParticles() ;\n WriteRecParticles();\n if(strstr(option,\"deb\"))\n PrintRecParticles(option) ;\n \/\/increment the total number of rec particles per run \n fRecParticlesInRun += gime->RecParticles()->GetEntriesFast() ; \n \n }\n if(strstr(option,\"tim\")){\n gBenchmark->Stop(\"EMCALPID\");\n printf(\"Exec: took %f seconds for PID %f seconds per event\", \n\t gBenchmark->GetCpuTime(\"EMCALPID\"), \n\t gBenchmark->GetCpuTime(\"EMCALPID\")\/nEvents) ;\n } \n\n Unload();\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::MakeRecParticles(){\n\n \/\/ Makes a RecParticle out of a TrackSegment\n \n AliEMCALGetter * gime = AliEMCALGetter::Instance() ; \n TObjArray * aECARecPoints = gime->ECARecPoints() ; \n if ( !aECARecPoints ) {\n Fatal(\"MakeRecParticles\", \"RecPoints or TrackSegments not found !\") ; \n }\n TClonesArray * recParticles = gime->RecParticles() ; \n recParticles->Clear();\n\n TIter next(aECARecPoints) ; \n AliEMCALRecPoint * eca ; \n Int_t index = 0 ; \n AliEMCALRecParticle * rp ; \n while ( (eca = (AliEMCALRecPoint *)next()) ) {\n \n new( (*recParticles)[index] ) AliEMCALRecParticle() ;\n rp = (AliEMCALRecParticle *)recParticles->At(index) ; \n rp->SetRecPoint(index) ;\n rp->SetIndexInList(index) ;\n \t\n \/\/ Now set type (reconstructed) of the particle\n\n \/\/ Choose the cluster energy range\n \n Float_t lambda[2] ;\n eca->GetElipsAxis(lambda) ;\n \n if((lambda[0]>0.01) && (lambda[1]>0.01)){\n \/\/ Looking PCA. Define and calculate the data (X),\n \/\/ introduce in the function X2P that gives the components (P). \n\n Float_t spher = 0. ;\n Float_t emaxdtotal = 0. ; \n \n if((lambda[0]+lambda[1])!=0) \n\tspher=fabs(lambda[0]-lambda[1])\/(lambda[0]+lambda[1]); \n \n emaxdtotal=eca->GetMaximalEnergy()\/eca->GetEnergy(); \n }\n \n \/\/ Float_t time = eca->GetTime() ;\n \n \/\/Set momentum, energy and other parameters \n Float_t encal = GetCalibratedEnergy(eca->GetEnergy());\n TVector3 dir = GetMomentumDirection(eca) ; \n \/\/ dir.SetMag(encal) ;Removed to avoid warings !!!!!!!!!!!!!! TO BE REVISED\n rp->SetMomentum(dir.X(),dir.Y(),dir.Z(),encal) ;\n rp->SetCalcMass(0);\n rp->Name(); \/\/If photon sets the particle pdg name to gamma\n rp->SetProductionVertex(0,0,0,0);\n rp->SetFirstMother(-1);\n rp->SetLastMother(-1);\n rp->SetFirstDaughter(-1);\n rp->SetLastDaughter(-1);\n rp->SetPolarisation(0,0,0);\n \/\/Set the position in global coordinate system from the RecPoint\n \/\/AliEMCALGeometry * geom = gime->EMCALGeometry() ; \n \/\/AliEMCALTowerRecPoint * erp = gime->ECARecPoint(rp->GetEMCALRPIndex()) ; \n TVector3 pos ; \n \/\/geom->GetGlobal(erp, pos) ; !!!!!!!!!! to check \n rp->SetPos(pos);\n\n\n index++ ; \n }\n \n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1:: Print(Option_t * \/*option*\/) const\n{\n \/\/ Print the parameters used for the particle type identification\n\n printf(\"Print: =============== AliEMCALPID1 ================\") ;\n printf(\"Making PID\\n\");\n printf(\" Pricipal analysis file from 0.5 to 100 %s\\n\", fFileName.Data() ) ; \n printf(\" Name of parameters file %s\\n\", fFileNamePar.Data() ) ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Print() const\n{\n \/\/ Print the parameters used for the particle type identification\n\n Info(\"Print\", \"=============== AliEMCALPIDv1 ================\") ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::PrintRecParticles(Option_t * option)\n{\n \/\/ Print table of reconstructed particles\n\n AliEMCALGetter *gime = AliEMCALGetter::Instance() ; \n\n TClonesArray * recParticles = gime->RecParticles() ; \n\n printf(\"\\nevent %i\", gAlice->GetEvNumber()); \n printf(\" found %i\", recParticles->GetEntriesFast()); \n printf(\" RecParticles\\n\"); \n\n if(strstr(option,\"all\")) { \/\/ printing found TS\n printf(\"\\n PARTICLE Index \\n\"); \n \n Int_t index ;\n for (index = 0 ; index < recParticles->GetEntries() ; index++) {\n AliEMCALRecParticle * rp = (AliEMCALRecParticle * ) recParticles->At(index) ; \n printf(\"\\n\");\n printf(rp->Name().Data()); \n printf(\" %i\", rp->GetIndexInList()); \n printf(\" %i\", rp->GetType());\n }\n }\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Unload() \n{\n \/\/ Unloads RecPoints, TrackSegments and RecParticles from the folder \n AliEMCALGetter * gime = AliEMCALGetter::Instance() ; \n gime->EmcalLoader()->UnloadRecPoints() ;\n gime->EmcalLoader()->UnloadTracks() ;\n gime->EmcalLoader()->UnloadRecParticles() ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::WriteRecParticles()\n{\n \/\/ Write RecParticles array to file\n AliEMCALGetter *gime = AliEMCALGetter::Instance() ; \n\n TClonesArray * recParticles = gime->RecParticles() ; \n recParticles->Expand(recParticles->GetEntriesFast() ) ;\n TTree * treeP = gime->TreeP() ;\n\n \n \n \/\/First rp\n Int_t bufferSize = 32000 ; \n TBranch * rpBranch = treeP->Branch(\"EMCALRP\",&recParticles,bufferSize);\n rpBranch->SetTitle(BranchName());\n\n rpBranch->Fill() ;\n \n gime->WriteRecParticles(\"OVERWRITE\");\n gime->WritePID(\"OVERWRITE\");\n\n}\n\n<commit_msg>The direction of z was reversed in GetMomentumDirection ... nobody remembers why.<commit_after>\/**************************************************************************\n * Copyright(c) 1998-1999, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\n\/* $Id$ *\/\n\n\/\/_________________________________________________________________________\n\/\/ Implementation version v1 of the EMCAL particle identifier \n\n\/\/*-- Author: Yves Schutz (SUBATECH) \n\/\/\n\/\/ --- ROOT system ---\n\/\/#include \"TROOT.h\"\n#include \"TTree.h\"\n#include \"TBenchmark.h\"\n#include \"TSystem.h\"\n \n \/\/ --- Standard library ---\n \n \/\/ --- AliRoot header files ---\n#include \"AliGenerator.h\"\n#include \"AliEMCALPIDv1.h\"\n#include \"AliEMCALRecParticle.h\"\n#include \"AliEMCALGetter.h\"\n \n ClassImp( AliEMCALPIDv1) \n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1():AliEMCALPID()\n{ \n \/\/ default ctor\n \n InitParameters() ; \n fDefaultInit = kTRUE ; \n \n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1(const AliEMCALPIDv1 & pid ):AliEMCALPID(pid)\n{ \n \/\/ ctor\n InitParameters() ; \n Init() ;\n \n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::AliEMCALPIDv1(const TString alirunFileName, const TString eventFolderName):AliEMCALPID(alirunFileName, eventFolderName)\n{ \n \/\/ctor with the indication on where to look for the track segments\n \n InitParameters() ; \n Init() ;\n fDefaultInit = kFALSE ; \n\n}\n\n\/\/____________________________________________________________________________\nAliEMCALPIDv1::~AliEMCALPIDv1()\n{ \n \/\/ dtor\n}\n\n\/\/____________________________________________________________________________\nconst TString AliEMCALPIDv1::BranchName() const \n{ \n\n return GetName() ;\n}\n \n\/\/____________________________________________________________________________\nFloat_t AliEMCALPIDv1::GetCalibratedEnergy(Float_t e) const\n{\n\/\/ It calibrates Energy depending on the recpoint energy.\n\/\/ The energy of the reconstructed cluster is corrected with \n\/\/ the formula A + B* E + C* E^2, whose parameters where obtained \n\/\/ through the study of the reconstructed energy distribution of \n\/\/ monoenergetic photons.\n \n \/\/Float_t p[]={0.,0.,0.};\n \/\/for (Int_t i=0; i<3; i++) p[i] = GetParameterCalibration(i);\n Float_t enerec = e ; \/\/ p[0] + p[1]*e + p[2]*e*e;\n return enerec ;\n\n}\n\/\/____________________________________________________________________________\nTVector3 AliEMCALPIDv1::GetMomentumDirection(AliEMCALRecPoint * emc)const \n{ \n \/\/ Calculates the momentum direction:\n \/\/ direction is given by IP and this RecPoint\n \n\n TVector3 dir(0,0,0) ; \n TVector3 emcglobalpos ;\n \/\/ TMatrix dummy ;\n \n emc->GetGlobalPosition(emcglobalpos) ;\n \n\n dir = emcglobalpos ; \n \/\/ dir.SetMag(1.) ; Removed to avoid warings !!!!!!!!!!!!!! TO BE REVISED\n\n \/\/account correction to the position of IP\n Float_t xo,yo,zo ; \/\/Coordinates of the origin\n gAlice->Generator()->GetOrigin(xo,yo,zo) ;\n TVector3 origin(xo,yo,zo);\n dir = dir - origin ;\n\n return dir ; \n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Init()\n{\n \/\/ Make all memory allocations that are not possible in default constructor\n \/\/ Add the PID task to the list of EMCAL tasks\n\n\n AliEMCALGetter * gime = AliEMCALGetter::Instance(GetTitle(), fEventFolderName.Data()) ; \n\n if ( !gime->PID() ) \n gime->PostPID(this) ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::InitParameters()\n{\n \/\/ Initialize the parameters\n fRecParticlesInRun = 0 ; \n fNEvent = 0 ; \n fRecParticlesInRun = 0 ;\n}\n\n\/\/____________________________________________________________________________\n\nvoid AliEMCALPIDv1::Exec(Option_t * option) \n{\n \/\/Steering method\n\n if(strstr(option,\"tim\"))\n gBenchmark->Start(\"EMCALPID\");\n \n if(strstr(option,\"print\")) {\n Print(\"\") ; \n return ; \n }\n AliEMCALGetter * gime = AliEMCALGetter::Instance(GetTitle()) ; \n\n if (fLastEvent == -1) \n fLastEvent = gime->MaxEvent() - 1 ;\n else \n fLastEvent = TMath::Min(fLastEvent,gime->MaxEvent());\n Int_t nEvents = fLastEvent - fFirstEvent + 1;\n\n Int_t ievent ;\n\n\n for (ievent = fFirstEvent; ievent <= fLastEvent; ievent++) {\n gime->Event(ievent,\"R\") ;\n MakeRecParticles() ;\n WriteRecParticles();\n if(strstr(option,\"deb\"))\n PrintRecParticles(option) ;\n \/\/increment the total number of rec particles per run \n fRecParticlesInRun += gime->RecParticles()->GetEntriesFast() ; \n \n }\n if(strstr(option,\"tim\")){\n gBenchmark->Stop(\"EMCALPID\");\n printf(\"Exec: took %f seconds for PID %f seconds per event\", \n\t gBenchmark->GetCpuTime(\"EMCALPID\"), \n\t gBenchmark->GetCpuTime(\"EMCALPID\")\/nEvents) ;\n } \n\n Unload();\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::MakeRecParticles(){\n\n \/\/ Makes a RecParticle out of a TrackSegment\n \n AliEMCALGetter * gime = AliEMCALGetter::Instance() ; \n TObjArray * aECARecPoints = gime->ECARecPoints() ; \n if ( !aECARecPoints ) {\n Fatal(\"MakeRecParticles\", \"RecPoints or TrackSegments not found !\") ; \n }\n TClonesArray * recParticles = gime->RecParticles() ; \n recParticles->Clear();\n\n TIter next(aECARecPoints) ; \n AliEMCALRecPoint * eca ; \n Int_t index = 0 ; \n AliEMCALRecParticle * rp ; \n while ( (eca = (AliEMCALRecPoint *)next()) ) {\n \n new( (*recParticles)[index] ) AliEMCALRecParticle() ;\n rp = (AliEMCALRecParticle *)recParticles->At(index) ; \n rp->SetRecPoint(index) ;\n rp->SetIndexInList(index) ;\n \t\n \/\/ Now set type (reconstructed) of the particle\n\n \/\/ Choose the cluster energy range\n \n Float_t lambda[2] ;\n eca->GetElipsAxis(lambda) ;\n \n if((lambda[0]>0.01) && (lambda[1]>0.01)){\n \/\/ Looking PCA. Define and calculate the data (X),\n \/\/ introduce in the function X2P that gives the components (P). \n\n Float_t spher = 0. ;\n Float_t emaxdtotal = 0. ; \n \n if((lambda[0]+lambda[1])!=0) \n\tspher=fabs(lambda[0]-lambda[1])\/(lambda[0]+lambda[1]); \n \n emaxdtotal=eca->GetMaximalEnergy()\/eca->GetEnergy(); \n }\n \n \/\/ Float_t time = eca->GetTime() ;\n \n \/\/Set momentum, energy and other parameters \n Float_t encal = GetCalibratedEnergy(eca->GetEnergy());\n TVector3 dir = GetMomentumDirection(eca) ; \n \/\/ dir.SetMag(encal) ;Removed to avoid warings !!!!!!!!!!!!!! TO BE REVISED\n rp->SetMomentum(dir.X(),dir.Y(),dir.Z(),encal) ;\n rp->SetCalcMass(0);\n rp->Name(); \/\/If photon sets the particle pdg name to gamma\n rp->SetProductionVertex(0,0,0,0);\n rp->SetFirstMother(-1);\n rp->SetLastMother(-1);\n rp->SetFirstDaughter(-1);\n rp->SetLastDaughter(-1);\n rp->SetPolarisation(0,0,0);\n \/\/Set the position in global coordinate system from the RecPoint\n \/\/AliEMCALGeometry * geom = gime->EMCALGeometry() ; \n \/\/AliEMCALTowerRecPoint * erp = gime->ECARecPoint(rp->GetEMCALRPIndex()) ; \n TVector3 pos ; \n \/\/geom->GetGlobal(erp, pos) ; !!!!!!!!!! to check \n rp->SetPos(pos);\n\n\n index++ ; \n }\n \n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1:: Print(Option_t * \/*option*\/) const\n{\n \/\/ Print the parameters used for the particle type identification\n\n printf(\"Print: =============== AliEMCALPID1 ================\") ;\n printf(\"Making PID\\n\");\n printf(\" Pricipal analysis file from 0.5 to 100 %s\\n\", fFileName.Data() ) ; \n printf(\" Name of parameters file %s\\n\", fFileNamePar.Data() ) ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Print() const\n{\n \/\/ Print the parameters used for the particle type identification\n\n Info(\"Print\", \"=============== AliEMCALPIDv1 ================\") ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::PrintRecParticles(Option_t * option)\n{\n \/\/ Print table of reconstructed particles\n\n AliEMCALGetter *gime = AliEMCALGetter::Instance() ; \n\n TClonesArray * recParticles = gime->RecParticles() ; \n\n printf(\"\\nevent %i\", gAlice->GetEvNumber()); \n printf(\" found %i\", recParticles->GetEntriesFast()); \n printf(\" RecParticles\\n\"); \n\n if(strstr(option,\"all\")) { \/\/ printing found TS\n printf(\"\\n PARTICLE Index \\n\"); \n \n Int_t index ;\n for (index = 0 ; index < recParticles->GetEntries() ; index++) {\n AliEMCALRecParticle * rp = (AliEMCALRecParticle * ) recParticles->At(index) ; \n printf(\"\\n\");\n printf(rp->Name().Data()); \n printf(\" %i\", rp->GetIndexInList()); \n printf(\" %i\", rp->GetType());\n }\n }\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::Unload() \n{\n \/\/ Unloads RecPoints, TrackSegments and RecParticles from the folder \n AliEMCALGetter * gime = AliEMCALGetter::Instance() ; \n gime->EmcalLoader()->UnloadRecPoints() ;\n gime->EmcalLoader()->UnloadTracks() ;\n gime->EmcalLoader()->UnloadRecParticles() ;\n}\n\n\/\/____________________________________________________________________________\nvoid AliEMCALPIDv1::WriteRecParticles()\n{\n \/\/ Write RecParticles array to file\n AliEMCALGetter *gime = AliEMCALGetter::Instance() ; \n\n TClonesArray * recParticles = gime->RecParticles() ; \n recParticles->Expand(recParticles->GetEntriesFast() ) ;\n TTree * treeP = gime->TreeP() ;\n\n \n \n \/\/First rp\n Int_t bufferSize = 32000 ; \n TBranch * rpBranch = treeP->Branch(\"EMCALRP\",&recParticles,bufferSize);\n rpBranch->SetTitle(BranchName());\n\n rpBranch->Fill() ;\n \n gime->WriteRecParticles(\"OVERWRITE\");\n gime->WritePID(\"OVERWRITE\");\n\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n c2ffi\n Copyright (C) 2013 Ryan Pavlik\n\n This file is part of c2ffi.\n\n c2ffi is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 2 of the License, or\n (at your option) any later version.\n\n c2ffi is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with c2ffi. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n\n#include <llvm\/Support\/Host.h>\n#include <llvm\/ADT\/IntrusiveRefCntPtr.h>\n\n#include <clang\/Basic\/DiagnosticOptions.h>\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/FrontendTool\/Utils.h>\n#include <clang\/Basic\/TargetOptions.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/SourceManager.h>\n#include <clang\/Lex\/HeaderSearch.h>\n#include <clang\/Lex\/Preprocessor.h>\n#include <clang\/Basic\/Diagnostic.h>\n#include <clang\/AST\/ASTContext.h>\n#include <clang\/AST\/ASTConsumer.h>\n#include <clang\/Parse\/Parser.h>\n#include <clang\/Parse\/ParseAST.h>\n\n#include <sys\/stat.h>\n\n#include \"c2ffi\/init.h\"\n\nusing namespace c2ffi;\n\nvoid c2ffi::add_include(clang::CompilerInstance &ci, const char *path, bool is_angled,\n bool show_error) {\n struct stat buf;\n if(stat(path, &buf) < 0 || !S_ISDIR(buf.st_mode)) {\n if(show_error) {\n std::cerr << \"Error: Not a directory: \";\n if(is_angled)\n std::cerr << \"-i \";\n else\n std::cerr << \"-I \";\n\n std::cerr << path << std::endl;\n exit(1);\n }\n\n return;\n }\n\n const clang::DirectoryEntry *dirent = ci.getFileManager().getDirectory(path);\n clang::DirectoryLookup lookup(dirent, clang::SrcMgr::C_System, false);\n\n ci.getPreprocessor().getHeaderSearchInfo()\n .AddSearchPath(lookup, is_angled);\n}\n\nvoid c2ffi::add_includes(clang::CompilerInstance &ci,\n c2ffi::IncludeVector &v, bool is_angled,\n bool show_error) {\n for(c2ffi::IncludeVector::iterator i = v.begin(); i != v.end(); i++)\n add_include(ci, (*i).c_str(), is_angled, show_error);\n}\n\nvoid c2ffi::init_ci(config &c, clang::CompilerInstance &ci) {\n using clang::DiagnosticOptions;\n using clang::TextDiagnosticPrinter;\n using clang::TargetOptions;\n using clang::TargetInfo;\n\n ci.getInvocation().setLangDefaults(ci.getLangOpts(), c.kind,\n clang::LangStandard::lang_unspecified);\n\n DiagnosticOptions *dopt = new DiagnosticOptions;\n TextDiagnosticPrinter *tpd =\n new TextDiagnosticPrinter(llvm::errs(), dopt, true);\n ci.createDiagnostics(tpd);\n\n llvm::IntrusiveRefCntPtr<TargetOptions> *pto =\n new llvm::IntrusiveRefCntPtr<TargetOptions>(new TargetOptions());\n (*pto)->Triple = llvm::sys::getDefaultTargetTriple();\n TargetInfo *pti = TargetInfo::CreateTargetInfo(ci.getDiagnostics(), pto->getPtr());\n ci.setTarget(pti);\n\n ci.createFileManager();\n ci.createSourceManager(ci.getFileManager());\n ci.createPreprocessor();\n ci.getPreprocessorOpts().UsePredefines = false;\n}\n\n<commit_msg>Prevent double-free (fixed vs clang@181334)<commit_after>\/*\n c2ffi\n Copyright (C) 2013 Ryan Pavlik\n\n This file is part of c2ffi.\n\n c2ffi is free software: you can redistribute it and\/or modify\n it under the terms of the GNU General Public License as published by\n the Free Software Foundation, either version 2 of the License, or\n (at your option) any later version.\n\n c2ffi is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n GNU General Public License for more details.\n\n You should have received a copy of the GNU General Public License\n along with c2ffi. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n*\/\n\n#include <iostream>\n\n#include <llvm\/Support\/Host.h>\n#include <llvm\/ADT\/IntrusiveRefCntPtr.h>\n\n#include <clang\/Basic\/DiagnosticOptions.h>\n#include <clang\/Frontend\/TextDiagnosticPrinter.h>\n#include <clang\/Frontend\/CompilerInstance.h>\n#include <clang\/FrontendTool\/Utils.h>\n#include <clang\/Basic\/TargetOptions.h>\n#include <clang\/Basic\/TargetInfo.h>\n#include <clang\/Basic\/FileManager.h>\n#include <clang\/Basic\/SourceManager.h>\n#include <clang\/Lex\/HeaderSearch.h>\n#include <clang\/Lex\/Preprocessor.h>\n#include <clang\/Basic\/Diagnostic.h>\n#include <clang\/AST\/ASTContext.h>\n#include <clang\/AST\/ASTConsumer.h>\n#include <clang\/Parse\/Parser.h>\n#include <clang\/Parse\/ParseAST.h>\n\n#include <sys\/stat.h>\n\n#include \"c2ffi\/init.h\"\n\nusing namespace c2ffi;\n\nvoid c2ffi::add_include(clang::CompilerInstance &ci, const char *path, bool is_angled,\n bool show_error) {\n struct stat buf;\n if(stat(path, &buf) < 0 || !S_ISDIR(buf.st_mode)) {\n if(show_error) {\n std::cerr << \"Error: Not a directory: \";\n if(is_angled)\n std::cerr << \"-i \";\n else\n std::cerr << \"-I \";\n\n std::cerr << path << std::endl;\n exit(1);\n }\n\n return;\n }\n\n const clang::DirectoryEntry *dirent = ci.getFileManager().getDirectory(path);\n clang::DirectoryLookup lookup(dirent, clang::SrcMgr::C_System, false);\n\n ci.getPreprocessor().getHeaderSearchInfo()\n .AddSearchPath(lookup, is_angled);\n}\n\nvoid c2ffi::add_includes(clang::CompilerInstance &ci,\n c2ffi::IncludeVector &v, bool is_angled,\n bool show_error) {\n for(c2ffi::IncludeVector::iterator i = v.begin(); i != v.end(); i++)\n add_include(ci, (*i).c_str(), is_angled, show_error);\n}\n\nvoid c2ffi::init_ci(config &c, clang::CompilerInstance &ci) {\n using clang::DiagnosticOptions;\n using clang::TextDiagnosticPrinter;\n using clang::TargetOptions;\n using clang::TargetInfo;\n\n ci.getInvocation().setLangDefaults(ci.getLangOpts(), c.kind,\n clang::LangStandard::lang_unspecified);\n\n DiagnosticOptions *dopt = new DiagnosticOptions;\n TextDiagnosticPrinter *tpd =\n new TextDiagnosticPrinter(llvm::errs(), dopt, false);\n ci.createDiagnostics(tpd);\n\n llvm::IntrusiveRefCntPtr<TargetOptions> *pto =\n new llvm::IntrusiveRefCntPtr<TargetOptions>(new TargetOptions());\n (*pto)->Triple = llvm::sys::getDefaultTargetTriple();\n TargetInfo *pti = TargetInfo::CreateTargetInfo(ci.getDiagnostics(), pto->getPtr());\n ci.setTarget(pti);\n\n ci.createFileManager();\n ci.createSourceManager(ci.getFileManager());\n ci.createPreprocessor();\n ci.getPreprocessorOpts().UsePredefines = false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*Se considera fisierul BAC.TXT ce contine un sir crescator cu cel mult un milion \nde numere naturale de cel mult noua cifre fiecare, separate prin câte un spatiu. \nSa se scrie un program C\/C++ care, folosind un algoritm eficient din punct de vedere \nal memoriei utilizate si al timpului de executare, citeste din fisier toti termenii \nsirului si afiseaza pe ecran, pe o singura linie, fiecare termen distinct al sirului \nurmat de numarul de aparitii ale acestuia în sir. Valorile afisate sunt separate prin \ncâte un spatiu. Exemplu: daca fisierul BAC.TXT are urmatorul continut: \n1 1 1 5 5 5 5 9 9 11 20 20 20 programul va afisa: 1 3 5 4 9 2 11 1 20 3 \ndeoarece 1 apare de 3 ori, 5 apare de 4 ori,etc\n*\/\n\n\n#include <fstream>\n\nusing namespace std;\n\nint main()\n{\n ifstream f(\"BAC.TXT\");\n \n long x, y, n;\n f >> x;\n n = 1;\n \n while(f >> y)\n { \n if(x == y) \n {\n n++;\n }\n else \n { \n cout << x << \" \" << n << \" \";\n\t n = 1;\n\t }\n x = y;\n }\n \n cout << x << \" \" << n;\n return 0;\n}\n<commit_msg>Update Problema1.cpp<commit_after>\/*Se considera fisierul BAC.TXT ce contine un sir crescator cu cel mult un milion \nde numere naturale de cel mult noua cifre fiecare, separate prin câte un spatiu. \nSa se scrie un program C\/C++ care, folosind un algoritm eficient din punct de vedere \nal memoriei utilizate si al timpului de executare, citeste din fisier toti termenii \nsirului si afiseaza pe ecran, pe o singura linie, fiecare termen distinct al sirului \nurmat de numarul de aparitii ale acestuia în sir. Valorile afisate sunt separate prin \ncâte un spatiu. Exemplu: daca fisierul BAC.TXT are urmatorul continut: \n1 1 1 5 5 5 5 9 9 11 20 20 20 programul va afisa: 1 3 5 4 9 2 11 1 20 3 \ndeoarece 1 apare de 3 ori, 5 apare de 4 ori,etc\n*\/\n\n\n#include <fstream>\n\nusing namespace std;\n\nint main()\n{\n ifstream f(\"input.in\");\n \n long x, y, n;\n f >> x;\n n = 1;\n \n while(f >> y)\n { \n if(x == y) \n {\n n++;\n }\n else \n { \n cout << x << \" \" << n << \" \";\n\t n = 1;\n\t }\n x = y;\n }\n \n cout << x << \" \" << n;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"ExceptionFilterTest.h\"\n#include \"EventReceiver.h\"\n#include \"ExceptionFilter.h\"\n#include <stdexcept>\n#include <sstream>\n#include <iostream>\n\nusing namespace std;\n\nstring FormatMessage(int value) {\n std::stringstream sstr;\n sstr << \"custom_exception: \" << value;\n return sstr.str();\n}\n\nclass custom_exception:\n public std::exception\n{\npublic:\n custom_exception(int value):\n m_value(value)\n {\n }\n\n int m_value;\n};\n\n\/\/\/ <summary>\n\/\/\/ Exception type which can track its own destruction\n\/\/\/ <\/summary>\nclass tracking_exception:\n public std::exception\n{\npublic:\n tracking_exception(int) {\n s_count++;\n }\n tracking_exception(const tracking_exception& rhs) {\n s_count++;\n }\n ~tracking_exception(void) throw() {\n s_count--;\n }\n\n static size_t s_count;\n};\n\nsize_t tracking_exception::s_count = 0;\n\nclass ThrowingListener:\n public virtual EventReceiver\n{\npublic:\n ThrowingListener(void) {}\n virtual void DoThrow(void) = 0;\n};\n\ntemplate<class Ex>\nclass ThrowsWhenRun:\n public CoreThread\n{\npublic:\n \/\/ This convoluted syntax is required to evade warnings on Mac\n decltype(throw_rethrowable Ex(100)) MakeException() {\n return throw_rethrowable Ex(100);\n }\n\n void Run(void) override {\n MakeException();\n }\n};\n\ntemplate<int i = 200>\nclass ThrowsWhenFired:\n public ThrowingListener\n{\npublic:\n ThrowsWhenFired(void):\n hit(false)\n {}\n\n bool hit;\n\n void DoThrow(void) override {\n hit = true;\n throw_rethrowable custom_exception(i);\n }\n};\n\nclass GenericFilter:\n public ExceptionFilter\n{\npublic:\n GenericFilter(void):\n m_hit(false),\n m_specific(false),\n m_generic(false),\n m_fireSpecific(false)\n {\n }\n\n bool m_hit;\n bool m_specific;\n bool m_generic;\n bool m_fireSpecific;\n\n virtual void Filter(const std::function<void()>& rethrower) override {\n m_hit = true;\n try {\n rethrower();\n } catch(tracking_exception&) {\n } catch(custom_exception& custom) {\n EXPECT_EQ(100, custom.m_value) << \"A filtered custom exception did not have the expected member field value\";\n m_specific = true;\n } catch(...) {\n m_generic = true;\n }\n }\n\n virtual void Filter(const std::function<void()>& rethrower, const JunctionBoxBase* pJunctionBox, EventReceiver* pRecipient) override {\n m_hit = true;\n try {\n rethrower();\n } catch(custom_exception& custom) {\n EXPECT_EQ(200, custom.m_value) << \"A fired exception did not have the expected value, probable copy malfunction\";\n m_fireSpecific = true;\n } catch(...) {\n m_generic = true;\n }\n }\n};\n\nTEST_F(ExceptionFilterTest, ExceptionDestruction) {\n \/\/ Add the exception filter type to the context first\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now add something that will throw when it's run:\n AutoRequired<ThrowsWhenRun<tracking_exception>> thrower;\n\n \/\/ Run:\n m_create->InitiateCoreThreads();\n thrower->Wait();\n\n \/\/ Verify that the exception was destroyed the correct number of times:\n EXPECT_EQ(0UL, tracking_exception::s_count) << \"Exception was not destroyed the correct number of times\";\n}\n\nTEST_F(ExceptionFilterTest, CheckThrowThrow) {\n class example {\n public:\n example() {\n throw std::exception();\n }\n };\n\n EXPECT_THROW(throw example(), std::exception) << \"An exception type which throws from its ctor did not throw the expected type\";\n}\n\nTEST_F(ExceptionFilterTest, ThreadThrowsCheck) {\n \/\/ Add the exception filter type to the context first\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now add something that will throw when it's run:\n AutoRequired<ThrowsWhenRun<custom_exception>> thrower;\n\n \/\/ Wait for the thrower to terminate, should be pretty fast:\n m_create->InitiateCoreThreads();\n thrower->Wait();\n\n \/\/ Hopefully the filter got hit in the right spot:\n EXPECT_TRUE(filter->m_hit) << \"Filter was not invoked for a thrown exception\";\n EXPECT_TRUE(filter->m_specific) << \"Filter did not correctly detect the exception type\";\n EXPECT_FALSE(filter->m_generic) << \"Filter did not correctly filter out a specific exception\";\n}\n\nTEST_F(ExceptionFilterTest, SimpleFilterCheck) {\n \/\/ Firing will occur at the parent context scope:\n AutoFired<ThrowingListener> broadcaster;\n\n \/\/ Add the generic filter:\n AutoRequired<GenericFilter> filter;\n\n \/\/ Add a context member which will throw when its event is fired, and a firing class:\n AutoRequired<ThrowsWhenFired<>> fireThrower;\n\n \/\/ Add something to fire the exception:\n EXPECT_NO_THROW(broadcaster(&ThrowingListener::DoThrow)());\n\n \/\/ Verify that the exception was filtered properly by the generic filter:\n EXPECT_TRUE(filter->m_fireSpecific) << \"Filter was not invoked on a Fired exception\";\n}\n\nTEST_F(ExceptionFilterTest, DISABLED_FireContainmentCheck) {\n \/\/ Firing will occur at the parent context scope:\n AutoFired<ThrowingListener> broadcaster;\n\n \/\/ Create a subcontext and add the fire thrower to it:\n AutoCreateContext ctxt;\n ctxt->Add<ThrowsWhenFired<>>();\n\n \/\/ Now cause the exception to occur:\n EXPECT_NO_THROW(broadcaster(&ThrowingListener::DoThrow)());\n\n \/\/ Verify that the context containing the fire thrower was torn down:\n EXPECT_TRUE(ctxt->IsShutdown()) << \"An unhandled exception from a fire call in a context should have signalled it to stop\";\n\n \/\/ Verify that the parent context was protected:\n EXPECT_FALSE(m_create->IsShutdown()) << \"An unhandled exception incorrectly terminated a parent context\";\n}\n\nTEST_F(ExceptionFilterTest, EnclosedThrowCheck) {\n \/\/ Create our listener:\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now the subcontext:\n AutoCreateContext subCtxt;\n CurrentContextPusher pshr(subCtxt);\n\n \/\/ Create and start:\n AutoRequired<ThrowsWhenRun<custom_exception>> runThrower;\n subCtxt->InitiateCoreThreads();\n\n \/\/ Wait for the exception to get thrown:\n subCtxt->Wait();\n\n \/\/ Verify that the filter caught the exception:\n EXPECT_TRUE(filter->m_hit) << \"Filter operating in a superior context did not catch an exception thrown from a child context\";\n}\n\nTEST_F(ExceptionFilterTest, VerifyThrowingRecipients) {\n \/\/ Create a pair of classes which throw exceptions:\n AutoRequired<ThrowsWhenFired<200>> v200;\n AutoRequired<ThrowsWhenFired<201>> v201;\n\n \/\/ Now try to throw:\n AutoFired<ThrowingListener> tl;\n tl(&ThrowingListener::DoThrow)();\n\n \/\/ Verify that BOTH are hit:\n EXPECT_TRUE(v200->hit && v201->hit) << \"Expected all receivers of a fired event will be processed, even if some throw exceptions\";\n}<commit_msg>Adding a unit test to ensure proper exception isolation<commit_after>\/\/ Copyright (c) 2010 - 2013 Leap Motion. All rights reserved. Proprietary and confidential.\n#include \"stdafx.h\"\n#include \"ExceptionFilterTest.h\"\n#include \"EventReceiver.h\"\n#include \"ExceptionFilter.h\"\n#include <stdexcept>\n#include <sstream>\n#include <iostream>\n\nusing namespace std;\n\nstring FormatMessage(int value) {\n std::stringstream sstr;\n sstr << \"custom_exception: \" << value;\n return sstr.str();\n}\n\nclass custom_exception:\n public std::exception\n{\npublic:\n custom_exception(int value):\n m_value(value)\n {\n }\n\n int m_value;\n};\n\n\/\/\/ <summary>\n\/\/\/ Exception type which can track its own destruction\n\/\/\/ <\/summary>\nclass tracking_exception:\n public std::exception\n{\npublic:\n tracking_exception(int) {\n s_count++;\n }\n tracking_exception(const tracking_exception& rhs) {\n s_count++;\n }\n ~tracking_exception(void) throw() {\n s_count--;\n }\n\n static size_t s_count;\n};\n\nsize_t tracking_exception::s_count = 0;\n\nclass ThrowingListener:\n public virtual EventReceiver\n{\npublic:\n ThrowingListener(void) {}\n virtual void DoThrow(void) = 0;\n};\n\ntemplate<class Ex>\nclass ThrowsWhenRun:\n public CoreThread\n{\npublic:\n \/\/ This convoluted syntax is required to evade warnings on Mac\n decltype(throw_rethrowable Ex(100)) MakeException() {\n return throw_rethrowable Ex(100);\n }\n\n void Run(void) override {\n MakeException();\n }\n};\n\ntemplate<int i = 200>\nclass ThrowsWhenFired:\n public ThrowingListener\n{\npublic:\n ThrowsWhenFired(void):\n hit(false)\n {}\n\n bool hit;\n\n void DoThrow(void) override {\n hit = true;\n throw_rethrowable custom_exception(i);\n }\n};\n\nclass GenericFilter:\n public ExceptionFilter\n{\npublic:\n GenericFilter(void):\n m_hit(false),\n m_specific(false),\n m_generic(false),\n m_fireSpecific(false)\n {\n }\n\n bool m_hit;\n bool m_specific;\n bool m_generic;\n bool m_fireSpecific;\n\n virtual void Filter(const std::function<void()>& rethrower) override {\n m_hit = true;\n try {\n rethrower();\n } catch(tracking_exception&) {\n } catch(custom_exception& custom) {\n EXPECT_EQ(100, custom.m_value) << \"A filtered custom exception did not have the expected member field value\";\n m_specific = true;\n } catch(...) {\n m_generic = true;\n }\n }\n\n virtual void Filter(const std::function<void()>& rethrower, const JunctionBoxBase* pJunctionBox, EventReceiver* pRecipient) override {\n m_hit = true;\n try {\n rethrower();\n } catch(custom_exception& custom) {\n EXPECT_EQ(200, custom.m_value) << \"A fired exception did not have the expected value, probable copy malfunction\";\n m_fireSpecific = true;\n } catch(...) {\n m_generic = true;\n }\n }\n};\n\nTEST_F(ExceptionFilterTest, ExceptionDestruction) {\n \/\/ Add the exception filter type to the context first\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now add something that will throw when it's run:\n AutoRequired<ThrowsWhenRun<tracking_exception>> thrower;\n\n \/\/ Run:\n m_create->InitiateCoreThreads();\n thrower->Wait();\n\n \/\/ Verify that the exception was destroyed the correct number of times:\n EXPECT_EQ(0UL, tracking_exception::s_count) << \"Exception was not destroyed the correct number of times\";\n}\n\nTEST_F(ExceptionFilterTest, CheckThrowThrow) {\n class example {\n public:\n example() {\n throw std::exception();\n }\n };\n\n EXPECT_THROW(throw example(), std::exception) << \"An exception type which throws from its ctor did not throw the expected type\";\n}\n\nTEST_F(ExceptionFilterTest, ThreadThrowsCheck) {\n \/\/ Add the exception filter type to the context first\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now add something that will throw when it's run:\n AutoRequired<ThrowsWhenRun<custom_exception>> thrower;\n\n \/\/ Wait for the thrower to terminate, should be pretty fast:\n m_create->InitiateCoreThreads();\n thrower->Wait();\n\n \/\/ Hopefully the filter got hit in the right spot:\n EXPECT_TRUE(filter->m_hit) << \"Filter was not invoked for a thrown exception\";\n EXPECT_TRUE(filter->m_specific) << \"Filter did not correctly detect the exception type\";\n EXPECT_FALSE(filter->m_generic) << \"Filter did not correctly filter out a specific exception\";\n}\n\nTEST_F(ExceptionFilterTest, SimpleFilterCheck) {\n \/\/ Firing will occur at the parent context scope:\n AutoFired<ThrowingListener> broadcaster;\n\n \/\/ Add the generic filter:\n AutoRequired<GenericFilter> filter;\n\n \/\/ Add a context member which will throw when its event is fired, and a firing class:\n AutoRequired<ThrowsWhenFired<>> fireThrower;\n\n \/\/ Add something to fire the exception:\n EXPECT_NO_THROW(broadcaster(&ThrowingListener::DoThrow)());\n\n \/\/ Verify that the exception was filtered properly by the generic filter:\n EXPECT_TRUE(filter->m_fireSpecific) << \"Filter was not invoked on a Fired exception\";\n}\n\nTEST_F(ExceptionFilterTest, DISABLED_FireContainmentCheck) {\n \/\/ Firing will occur at the parent context scope:\n AutoFired<ThrowingListener> broadcaster;\n\n \/\/ Create a subcontext and add the fire thrower to it:\n AutoCreateContext ctxt;\n ctxt->Add<ThrowsWhenFired<>>();\n\n \/\/ Now cause the exception to occur:\n EXPECT_NO_THROW(broadcaster(&ThrowingListener::DoThrow)());\n\n \/\/ Verify that the context containing the fire thrower was torn down:\n EXPECT_TRUE(ctxt->IsShutdown()) << \"An unhandled exception from a fire call in a context should have signalled it to stop\";\n\n \/\/ Verify that the parent context was protected:\n EXPECT_FALSE(m_create->IsShutdown()) << \"An unhandled exception incorrectly terminated a parent context\";\n}\n\nTEST_F(ExceptionFilterTest, EnclosedThrowCheck) {\n \/\/ Create our listener:\n AutoRequired<GenericFilter> filter;\n\n \/\/ Now the subcontext:\n AutoCreateContext subCtxt;\n CurrentContextPusher pshr(subCtxt);\n\n \/\/ Create and start:\n AutoRequired<ThrowsWhenRun<custom_exception>> runThrower;\n subCtxt->InitiateCoreThreads();\n\n \/\/ Wait for the exception to get thrown:\n subCtxt->Wait();\n\n \/\/ Verify that the filter caught the exception:\n EXPECT_TRUE(filter->m_hit) << \"Filter operating in a superior context did not catch an exception thrown from a child context\";\n}\n\nTEST_F(ExceptionFilterTest, VerifyThrowingRecipients) {\n \/\/ Create a pair of classes which throw exceptions:\n AutoRequired<ThrowsWhenFired<200>> v200;\n AutoRequired<ThrowsWhenFired<201>> v201;\n\n \/\/ Now try to throw:\n AutoFired<ThrowingListener> tl;\n tl(&ThrowingListener::DoThrow)();\n\n \/\/ Verify that BOTH are hit:\n EXPECT_TRUE(v200->hit && v201->hit) << \"Expected all receivers of a fired event will be processed, even if some throw exceptions\";\n}\n\nTEST_F(ExceptionFilterTest, VerifySimpleConfinement) {\n m_create->InitiateCoreThreads();\n\n \/\/ Create a subcontext where the errant recipients will live:\n AutoCreateContext child;\n child->Inject<ThrowsWhenFired<200>>();\n\n \/\/ Cause the child context to throw an exception:\n AutoFired<ThrowingListener> tl;\n tl(&ThrowingListener::DoThrow)();\n\n \/\/ Verify that the parent scope wasn't incorrectly terminated:\n EXPECT_FALSE(m_create->IsShutdown()) << \"Parent scope was terminated incorrectly due to an exception sourced by a child context\";\n\n \/\/ Verify that the child scope was terminated as expected:\n EXPECT_TRUE(child->IsShutdown()) << \"An event recipient in a child scope threw an exception and the child context was not correctly terminated\";\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2016 The Cartographer Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"cartographer\/common\/configuration_file_resolver.h\"\n\n#include <fstream>\n#include <iostream>\n#include <streambuf>\n\n#include \"cartographer\/common\/config.h\"\n#include \"glog\/logging.h\"\n\nnamespace cartographer {\nnamespace common {\n\nConfigurationFileResolver::ConfigurationFileResolver(\n const std::vector<string>& configuration_files_directories)\n : configuration_files_directories_(configuration_files_directories) {\n configuration_files_directories_.push_back(kConfigurationFilesDirectory);\n}\n\nstring ConfigurationFileResolver::GetFullPathOrDie(const string& basename) {\n for (const auto& path : configuration_files_directories_) {\n const string filename = path + \"\/\" + basename;\n std::ifstream stream(filename.c_str());\n if (stream.good()) {\n return filename;\n }\n }\n LOG(FATAL) << \"File \" << basename << \" was not found.\";\n}\n\nstring ConfigurationFileResolver::GetFileContentOrDie(const string& basename) {\n const string filename = GetFullPathOrDie(basename);\n std::ifstream stream(filename.c_str());\n return string((std::istreambuf_iterator<char>(stream)),\n std::istreambuf_iterator<char>());\n}\n\n} \/\/ namespace common\n} \/\/ namespace cartographer\n<commit_msg>Improved logging for loading Lua configurations. (#4)<commit_after>\/*\n * Copyright 2016 The Cartographer Authors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"cartographer\/common\/configuration_file_resolver.h\"\n\n#include <fstream>\n#include <iostream>\n#include <streambuf>\n\n#include \"cartographer\/common\/config.h\"\n#include \"glog\/logging.h\"\n\nnamespace cartographer {\nnamespace common {\n\nConfigurationFileResolver::ConfigurationFileResolver(\n const std::vector<string>& configuration_files_directories)\n : configuration_files_directories_(configuration_files_directories) {\n configuration_files_directories_.push_back(kConfigurationFilesDirectory);\n}\n\nstring ConfigurationFileResolver::GetFullPathOrDie(const string& basename) {\n for (const auto& path : configuration_files_directories_) {\n const string filename = path + \"\/\" + basename;\n std::ifstream stream(filename.c_str());\n if (stream.good()) {\n LOG(INFO) << \"Found '\" << filename << \"' for '\" << basename << \"'.\";\n return filename;\n }\n }\n LOG(FATAL) << \"File '\" << basename << \"' was not found.\";\n}\n\nstring ConfigurationFileResolver::GetFileContentOrDie(const string& basename) {\n const string filename = GetFullPathOrDie(basename);\n std::ifstream stream(filename.c_str());\n return string((std::istreambuf_iterator<char>(stream)),\n std::istreambuf_iterator<char>());\n}\n\n} \/\/ namespace common\n} \/\/ namespace cartographer\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <stdlib.h>\n#include <GLUT\/GLUT.h>\n\n#include \"StopWatch.h\"\n\nStopWatch stopWatch;\nbool started = false;\n\nvoid Draw(int i) {\n\tdouble d;\n\tglPushMatrix();\n\tglRotatef(i*6, 0,0,1);\n\tif(i%5==0) d=2.0;\n\telse d = 1.0;\n\tglBegin(GL_TRIANGLES);\n\tglVertex3f(-0.01*d, 1.0, 0.0);\n\tglVertex3f( 0.01*d, 1.0, 0.0);\n\tglVertex3f( 0.0 , 1.0-0.1*d, 0.0);\n\tglEnd();\n\tglPopMatrix();\n}\nvoid changeSize(int w, int h) {\n\tif(h == 0) h = 1;\n\tfloat ratio = 1.0* w \/ h;\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tglViewport(0, 0, w, h);\n\tgluPerspective(45,ratio,1,1000);\n\tglMatrixMode(GL_MODELVIEW);\n}\nvoid renderScene(void) {\n\tif(!started) {\n\t\tstopWatch.start();\n\t\tstarted = true;\n\t}\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n\tgluLookAt(0.0,0.0,5.0, 0.0,0.0,-1.0, 0.0f,1.0f,0.0f);\n\tfor(int i=0; i<60; i++) { Draw(i); }\n\tglColor3f(0,0,0);\n\t\n\tstatic float angle;\n\tstopWatch.stop();\n\tfloat dt = stopWatch.getElapsedTime();\n\tstopWatch.start();\n\tangle += dt*6.0\/1000000.0;\n\t\n\tglPushMatrix();\n\tglRotatef(-angle, 0.0, 0.0, 1.0);\n\tglBegin(GL_LINES);\n\tglVertex3f(0.0,0.0,0.0);\n\tglVertex3f(0.0,1.0,0.0);\n\tglEnd();\n\tglPopMatrix();\n\t\n\tglutSwapBuffers();\n}\nvoid processNormalKeys(unsigned char key, int x, int y) {\n\tif (key == 27) exit(0);\n}\nint main(int argc, char **argv) {\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA);\n\tglutInitWindowPosition(100,100);\n\tglutInitWindowSize(320,320);\n\tglutCreateWindow(\"Dr.Kang's Animation Lecture - 00\");\n\tglutDisplayFunc(renderScene);\n\tglutIdleFunc(renderScene);\n\tglutReshapeFunc(changeSize);\n\tglutKeyboardFunc(processNormalKeys);\n\tglEnable(GL_DEPTH_TEST);\n\tglClearColor(0.8,0.8,1.0,1.0);\n\tglutMainLoop();\n\treturn 0;\n}<commit_msg>add a trivial comment<commit_after>#include <stdio.h>\n#include <stdlib.h>\n#include <GLUT\/GLUT.h>\n\n#include \"StopWatch.h\"\n\nStopWatch stopWatch;\nbool started = false;\n\nvoid Draw(int i) {\n\t\/\/ drawing clock\n\tdouble d;\n\tglPushMatrix();\n\tglRotatef(i*6, 0,0,1);\n\tif(i%5==0) d=2.0;\n\telse d = 1.0;\n\tglBegin(GL_TRIANGLES);\n\tglVertex3f(-0.01*d, 1.0, 0.0);\n\tglVertex3f( 0.01*d, 1.0, 0.0);\n\tglVertex3f( 0.0 , 1.0-0.1*d, 0.0);\n\tglEnd();\n\tglPopMatrix();\n}\nvoid changeSize(int w, int h) {\n\tif(h == 0) h = 1;\n\tfloat ratio = 1.0* w \/ h;\n\tglMatrixMode(GL_PROJECTION);\n\tglLoadIdentity();\n\tglViewport(0, 0, w, h);\n\tgluPerspective(45,ratio,1,1000);\n\tglMatrixMode(GL_MODELVIEW);\n}\nvoid renderScene(void) {\n\tif(!started) {\n\t\tstopWatch.start();\n\t\tstarted = true;\n\t}\n\tglClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n\tglLoadIdentity();\n\tgluLookAt(0.0,0.0,5.0, 0.0,0.0,-1.0, 0.0f,1.0f,0.0f);\n\tfor(int i=0; i<60; i++) { Draw(i); }\n\tglColor3f(0,0,0);\n\t\n\tstatic float angle;\n\tstopWatch.stop();\n\tfloat dt = stopWatch.getElapsedTime();\n\tstopWatch.start();\n\tangle += dt*6.0\/1000000.0;\n\t\n\tglPushMatrix();\n\tglRotatef(-angle, 0.0, 0.0, 1.0);\n\tglBegin(GL_LINES);\n\tglVertex3f(0.0,0.0,0.0);\n\tglVertex3f(0.0,1.0,0.0);\n\tglEnd();\n\tglPopMatrix();\n\t\n\tglutSwapBuffers();\n}\nvoid processNormalKeys(unsigned char key, int x, int y) {\n\tif (key == 27) exit(0);\n}\nint main(int argc, char **argv) {\n\tglutInit(&argc, argv);\n\tglutInitDisplayMode(GLUT_DEPTH | GLUT_DOUBLE | GLUT_RGBA);\n\tglutInitWindowPosition(100,100);\n\tglutInitWindowSize(320,320);\n\tglutCreateWindow(\"Dr.Kang's Animation Lecture - 00\");\n\tglutDisplayFunc(renderScene);\n\tglutIdleFunc(renderScene);\n\tglutReshapeFunc(changeSize);\n\tglutKeyboardFunc(processNormalKeys);\n\tglEnable(GL_DEPTH_TEST);\n\tglClearColor(0.8,0.8,1.0,1.0);\n\tglutMainLoop();\n\treturn 0;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/ownership_service.h\"\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/notification_type.h\"\n\nnamespace chromeos {\n\n\/\/ static\nOwnershipService* OwnershipService::GetSharedInstance() {\n return Singleton<OwnershipService>::get();\n}\n\nOwnershipService::OwnershipService()\n : manager_(new OwnerManager),\n utils_(OwnerKeyUtils::Create()) {\n}\n\nOwnershipService::~OwnershipService() {}\n\n\nbool OwnershipService::IsAlreadyOwned() {\n return file_util::PathExists(utils_->GetOwnerKeyFilePath());\n}\n\nbool OwnershipService::StartLoadOwnerKeyAttempt() {\n if (!IsAlreadyOwned()) {\n LOG(WARNING) << \"Device not yet owned\";\n return false;\n }\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(), &OwnerManager::LoadOwnerKey));\n return true;\n}\n\nbool OwnershipService::StartTakeOwnershipAttempt() {\n if (IsAlreadyOwned()) {\n LOG(ERROR) << \"Device is already owned\";\n return false;\n }\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::GenerateKeysAndExportPublic));\n return true;\n}\n\nvoid OwnershipService::StartSigningAttempt(const std::string& data,\n OwnerManager::Delegate* d) {\n if (!IsAlreadyOwned()) {\n LOG(ERROR) << \"Device not yet owned\";\n d->OnKeyOpComplete(OwnerManager::KEY_UNAVAILABLE, std::vector<uint8>());\n return;\n }\n ChromeThread::ID thread_id;\n if (!ChromeThread::GetCurrentThreadIdentifier(&thread_id))\n thread_id = ChromeThread::UI;\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::Sign,\n thread_id,\n data, d));\n return;\n}\n\nvoid OwnershipService::StartVerifyAttempt(const std::string& data,\n const std::vector<uint8>& signature,\n OwnerManager::Delegate* d) {\n if (!IsAlreadyOwned()) {\n LOG(ERROR) << \"Device not yet owned\";\n d->OnKeyOpComplete(OwnerManager::KEY_UNAVAILABLE, std::vector<uint8>());\n return;\n }\n ChromeThread::ID thread_id;\n if (!ChromeThread::GetCurrentThreadIdentifier(&thread_id))\n thread_id = ChromeThread::UI;\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::Verify,\n thread_id,\n data,\n signature,\n d));\n return;\n}\n\nbool OwnershipService::CurrentUserIsOwner() {\n \/\/ If this user has the private key associated with the owner's\n \/\/ public key, this user is the owner.\n return manager_->EnsurePrivateKey();\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Fix chromeos browser_tests crash by skipping EnsurePrivateKey if device is not owned.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/login\/ownership_service.h\"\n\n#include \"base\/file_path.h\"\n#include \"base\/file_util.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/notification_type.h\"\n\nnamespace chromeos {\n\n\/\/ static\nOwnershipService* OwnershipService::GetSharedInstance() {\n return Singleton<OwnershipService>::get();\n}\n\nOwnershipService::OwnershipService()\n : manager_(new OwnerManager),\n utils_(OwnerKeyUtils::Create()) {\n}\n\nOwnershipService::~OwnershipService() {}\n\n\nbool OwnershipService::IsAlreadyOwned() {\n return file_util::PathExists(utils_->GetOwnerKeyFilePath());\n}\n\nbool OwnershipService::StartLoadOwnerKeyAttempt() {\n if (!IsAlreadyOwned()) {\n LOG(WARNING) << \"Device not yet owned\";\n return false;\n }\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(), &OwnerManager::LoadOwnerKey));\n return true;\n}\n\nbool OwnershipService::StartTakeOwnershipAttempt() {\n if (IsAlreadyOwned()) {\n LOG(ERROR) << \"Device is already owned\";\n return false;\n }\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::GenerateKeysAndExportPublic));\n return true;\n}\n\nvoid OwnershipService::StartSigningAttempt(const std::string& data,\n OwnerManager::Delegate* d) {\n if (!IsAlreadyOwned()) {\n LOG(ERROR) << \"Device not yet owned\";\n d->OnKeyOpComplete(OwnerManager::KEY_UNAVAILABLE, std::vector<uint8>());\n return;\n }\n ChromeThread::ID thread_id;\n if (!ChromeThread::GetCurrentThreadIdentifier(&thread_id))\n thread_id = ChromeThread::UI;\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::Sign,\n thread_id,\n data, d));\n return;\n}\n\nvoid OwnershipService::StartVerifyAttempt(const std::string& data,\n const std::vector<uint8>& signature,\n OwnerManager::Delegate* d) {\n if (!IsAlreadyOwned()) {\n LOG(ERROR) << \"Device not yet owned\";\n d->OnKeyOpComplete(OwnerManager::KEY_UNAVAILABLE, std::vector<uint8>());\n return;\n }\n ChromeThread::ID thread_id;\n if (!ChromeThread::GetCurrentThreadIdentifier(&thread_id))\n thread_id = ChromeThread::UI;\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(manager_.get(),\n &OwnerManager::Verify,\n thread_id,\n data,\n signature,\n d));\n return;\n}\n\nbool OwnershipService::CurrentUserIsOwner() {\n \/\/ If this user has the private key associated with the owner's\n \/\/ public key, this user is the owner.\n return IsAlreadyOwned() && manager_->EnsurePrivateKey();\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/ui\/setting_level_bubble.h\"\n\n#include <algorithm>\n\n#include \"ash\/shell.h\"\n#include \"chrome\/browser\/chromeos\/login\/base_login_display_host.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_display_host.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_utils.h\"\n#include \"chrome\/browser\/chromeos\/login\/webui_login_display.h\"\n#include \"chrome\/browser\/chromeos\/ui\/setting_level_bubble_view.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/window.h\"\n#include \"ui\/gfx\/screen.h\"\n#include \"ui\/views\/bubble\/bubble_delegate.h\"\n#include \"ui\/views\/layout\/fill_layout.h\"\n#include \"ui\/views\/widget\/root_view.h\"\n\nusing base::TimeDelta;\nusing base::TimeTicks;\nusing std::max;\nusing std::min;\n\nnamespace {\n\n\/\/ How long should the bubble be shown onscreen whenever the setting changes?\nconst int kBubbleShowTimeoutMs = 1000;\n\n\/\/ How long should the level initially take to move up or down when it changes?\n\/\/ (The rate adapts to handle keyboard autorepeat.)\nconst int64 kInitialAnimationDurationMs = 200;\n\n\/\/ Horizontal position of the center of the bubble on the screen: 0 is left\n\/\/ edge, 0.5 is center, 1 is right edge.\nconst double kBubbleXRatio = 0.5;\n\n\/\/ Vertical gap from the bottom of the screen in pixels.\nconst int kBubbleBottomGap = 30;\n\n\/\/ Duration between animation frames.\n\/\/ Chosen to match ui::SlideAnimation's kDefaultFramerateHz.\nconst int kAnimationIntervalMs = 1000 \/ 50;\n\ndouble LimitPercent(double percent) {\n return min(max(percent, 0.0), 100.0);\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ SettingLevelBubbleDelegateView ----------------------------------------------\nclass SettingLevelBubbleDelegateView : public views::BubbleDelegateView {\n public:\n \/\/ BubbleDelegate overrides:\n virtual gfx::Rect GetAnchorRect() OVERRIDE;\n\n \/\/ Create the bubble delegate view.\n SettingLevelBubbleDelegateView();\n virtual ~SettingLevelBubbleDelegateView();\n\n SettingLevelBubbleView* view() { return view_; }\n\n protected:\n \/\/ BubbleDelegate overrides:\n virtual void Init() OVERRIDE;\n\n private:\n SettingLevelBubbleView* view_;\n\n DISALLOW_COPY_AND_ASSIGN(SettingLevelBubbleDelegateView);\n};\n\ngfx::Rect SettingLevelBubbleDelegateView::GetAnchorRect() {\n gfx::Size view_size = GetPreferredSize();\n \/\/ Calculate the position in screen coordinates that the bubble should\n \/\/ \"point\" at (since we use BubbleBorder::FLOAT, this position actually\n \/\/ specifies the center of the bubble).\n gfx::Rect monitor_area = gfx::Screen::GetMonitorAreaNearestWindow(NULL);\n return (gfx::Rect(\n monitor_area.x() + kBubbleXRatio * monitor_area.width(),\n monitor_area.bottom() - view_size.height() \/ 2 - kBubbleBottomGap, 0, 0));\n}\n\nSettingLevelBubbleDelegateView::SettingLevelBubbleDelegateView()\n : BubbleDelegateView(NULL, views::BubbleBorder::FLOAT),\n view_(NULL) {\n set_close_on_esc(false);\n set_use_focusless(true);\n}\n\nSettingLevelBubbleDelegateView::~SettingLevelBubbleDelegateView() {\n view_ = NULL;\n}\n\nvoid SettingLevelBubbleDelegateView::Init() {\n SetLayoutManager(new views::FillLayout());\n view_ = new SettingLevelBubbleView();\n AddChildView(view_);\n}\n\n\/\/ SettingLevelBubble ----------------------------------------------------------\nvoid SettingLevelBubble::ShowBubble(double percent, bool enabled) {\n if (ash::Shell::GetInstance()->tray())\n return;\n hide_timer_.Stop();\n\n \/\/ Set up target percent and icon.\n const double old_target_percent = target_percent_;\n UpdateTargetPercent(percent);\n SkBitmap* current_icon = increase_icon_;\n if (!enabled || target_percent_ == 0)\n current_icon = disabled_icon_;\n else if (old_target_percent >= 0 && target_percent_ < old_target_percent)\n current_icon = decrease_icon_;\n\n if (!view_) {\n view_ = CreateView();\n view_->Init(current_icon, percent, enabled);\n } else {\n \/\/ Reset fade sequence, if the bubble is already fading.\n SettingLevelBubbleDelegateView* delegate =\n static_cast<SettingLevelBubbleDelegateView*>\n (view_->GetWidget()->widget_delegate());\n delegate->ResetFade();\n view_->SetIcon(current_icon);\n view_->SetEnabled(enabled);\n }\n view_->GetWidget()->Show();\n \/\/ When the timer runs out, start the fade sequence.\n hide_timer_.Start(FROM_HERE,\n base::TimeDelta::FromMilliseconds(kBubbleShowTimeoutMs),\n this, &SettingLevelBubble::OnHideTimeout);\n}\n\nvoid SettingLevelBubble::HideBubble() {\n if (ash::Shell::GetInstance()->tray())\n return;\n hide_timer_.Stop();\n if (view_) {\n view_->GetWidget()->Close();\n view_ = NULL;\n }\n}\n\nvoid SettingLevelBubble::UpdateWithoutShowingBubble(double percent,\n bool enabled) {\n UpdateTargetPercent(percent);\n if (view_)\n view_->SetEnabled(enabled);\n}\n\nSettingLevelBubble::SettingLevelBubble(SkBitmap* increase_icon,\n SkBitmap* decrease_icon,\n SkBitmap* disabled_icon)\n : current_percent_(-1.0),\n target_percent_(-1.0),\n increase_icon_(increase_icon),\n decrease_icon_(decrease_icon),\n disabled_icon_(disabled_icon),\n view_(NULL),\n is_animating_(false) {\n}\n\nSettingLevelBubble::~SettingLevelBubble() {\n view_ = NULL;\n}\n\nvoid SettingLevelBubble::OnWidgetClosing(views::Widget* widget) {\n if (view_ && view_->GetWidget() == widget) {\n view_->GetWidget()->RemoveObserver(this);\n view_ = NULL;\n }\n \/\/ Update states.\n current_percent_ = target_percent_;\n target_time_ = TimeTicks();\n last_animation_update_time_ = TimeTicks();\n last_target_update_time_ = TimeTicks();\n hide_timer_.Stop();\n StopAnimation();\n}\n\nSettingLevelBubbleView* SettingLevelBubble::CreateView() {\n SettingLevelBubbleDelegateView* delegate = new SettingLevelBubbleDelegateView;\n views::Widget* widget = browser::CreateViewsBubbleAboveLockScreen(delegate);\n widget->AddObserver(this);\n \/\/ Hold on to the content view.\n return delegate->view();\n}\n\nvoid SettingLevelBubble::OnHideTimeout() {\n \/\/ Start fading away.\n if (view_) {\n SettingLevelBubbleDelegateView* delegate =\n static_cast<SettingLevelBubbleDelegateView*>\n (view_->GetWidget()->widget_delegate());\n delegate->StartFade(false);\n }\n}\n\nvoid SettingLevelBubble::OnAnimationTimeout() {\n const TimeTicks now = TimeTicks::Now();\n const int64 remaining_ms = (target_time_ - now).InMilliseconds();\n\n if (remaining_ms <= 0) {\n current_percent_ = target_percent_;\n StopAnimation();\n } else {\n \/\/ Figure out what fraction of the total time until we want to reach the\n \/\/ target has elapsed since the last update.\n const double remaining_percent = target_percent_ - current_percent_;\n const int64 elapsed_ms =\n (now - last_animation_update_time_).InMilliseconds();\n current_percent_ +=\n remaining_percent *\n (static_cast<double>(elapsed_ms) \/ (elapsed_ms + remaining_ms));\n }\n last_animation_update_time_ = now;\n\n if (view_)\n view_->SetLevel(current_percent_);\n}\n\nvoid SettingLevelBubble::UpdateTargetPercent(double percent) {\n target_percent_ = LimitPercent(percent);\n const TimeTicks now = TimeTicks::Now();\n\n if (current_percent_ < 0.0) {\n \/\/ If we're setting the level for the first time, no need to animate.\n current_percent_ = target_percent_;\n if (view_)\n view_->SetLevel(current_percent_);\n } else {\n \/\/ Use the time since the last request as a hint for the duration of the\n \/\/ animation. This makes us automatically adapt to the repeat rate if a key\n \/\/ is being held down to change a setting (which prevents us from lagging\n \/\/ behind when the key is finally released).\n int64 duration_ms = kInitialAnimationDurationMs;\n if (!last_target_update_time_.is_null())\n duration_ms = min(kInitialAnimationDurationMs,\n (now - last_target_update_time_).InMilliseconds());\n target_time_ = now + TimeDelta::FromMilliseconds(duration_ms);\n\n if (!is_animating_) {\n animation_timer_.Start(FROM_HERE,\n TimeDelta::FromMilliseconds(kAnimationIntervalMs),\n this,\n &SettingLevelBubble::OnAnimationTimeout);\n is_animating_ = true;\n last_animation_update_time_ = now;\n }\n }\n\n last_target_update_time_ = now;\n}\n\nvoid SettingLevelBubble::StopAnimation() {\n animation_timer_.Stop();\n is_animating_ = false;\n}\n\n} \/\/ namespace chromeos\n<commit_msg>Revert 127487 because it broke some browser-tests. --- chromeos: Do not show the old setting bubbles when volume\/brightness changes if the uber-tray is active.<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/chromeos\/ui\/setting_level_bubble.h\"\n\n#include <algorithm>\n\n#include \"chrome\/browser\/chromeos\/login\/base_login_display_host.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_display_host.h\"\n#include \"chrome\/browser\/chromeos\/login\/login_utils.h\"\n#include \"chrome\/browser\/chromeos\/login\/webui_login_display.h\"\n#include \"chrome\/browser\/chromeos\/ui\/setting_level_bubble_view.h\"\n#include \"chrome\/browser\/profiles\/profile_manager.h\"\n#include \"chrome\/browser\/ui\/browser.h\"\n#include \"chrome\/browser\/ui\/browser_list.h\"\n#include \"chrome\/browser\/ui\/browser_window.h\"\n#include \"chrome\/browser\/ui\/views\/window.h\"\n#include \"ui\/gfx\/screen.h\"\n#include \"ui\/views\/bubble\/bubble_delegate.h\"\n#include \"ui\/views\/layout\/fill_layout.h\"\n#include \"ui\/views\/widget\/root_view.h\"\n\nusing base::TimeDelta;\nusing base::TimeTicks;\nusing std::max;\nusing std::min;\n\nnamespace {\n\n\/\/ How long should the bubble be shown onscreen whenever the setting changes?\nconst int kBubbleShowTimeoutMs = 1000;\n\n\/\/ How long should the level initially take to move up or down when it changes?\n\/\/ (The rate adapts to handle keyboard autorepeat.)\nconst int64 kInitialAnimationDurationMs = 200;\n\n\/\/ Horizontal position of the center of the bubble on the screen: 0 is left\n\/\/ edge, 0.5 is center, 1 is right edge.\nconst double kBubbleXRatio = 0.5;\n\n\/\/ Vertical gap from the bottom of the screen in pixels.\nconst int kBubbleBottomGap = 30;\n\n\/\/ Duration between animation frames.\n\/\/ Chosen to match ui::SlideAnimation's kDefaultFramerateHz.\nconst int kAnimationIntervalMs = 1000 \/ 50;\n\ndouble LimitPercent(double percent) {\n return min(max(percent, 0.0), 100.0);\n}\n\n} \/\/ namespace\n\nnamespace chromeos {\n\n\/\/ SettingLevelBubbleDelegateView ----------------------------------------------\nclass SettingLevelBubbleDelegateView : public views::BubbleDelegateView {\n public:\n \/\/ BubbleDelegate overrides:\n virtual gfx::Rect GetAnchorRect() OVERRIDE;\n\n \/\/ Create the bubble delegate view.\n SettingLevelBubbleDelegateView();\n virtual ~SettingLevelBubbleDelegateView();\n\n SettingLevelBubbleView* view() { return view_; }\n\n protected:\n \/\/ BubbleDelegate overrides:\n virtual void Init() OVERRIDE;\n\n private:\n SettingLevelBubbleView* view_;\n\n DISALLOW_COPY_AND_ASSIGN(SettingLevelBubbleDelegateView);\n};\n\ngfx::Rect SettingLevelBubbleDelegateView::GetAnchorRect() {\n gfx::Size view_size = GetPreferredSize();\n \/\/ Calculate the position in screen coordinates that the bubble should\n \/\/ \"point\" at (since we use BubbleBorder::FLOAT, this position actually\n \/\/ specifies the center of the bubble).\n gfx::Rect monitor_area = gfx::Screen::GetMonitorAreaNearestWindow(NULL);\n return (gfx::Rect(\n monitor_area.x() + kBubbleXRatio * monitor_area.width(),\n monitor_area.bottom() - view_size.height() \/ 2 - kBubbleBottomGap, 0, 0));\n}\n\nSettingLevelBubbleDelegateView::SettingLevelBubbleDelegateView()\n : BubbleDelegateView(NULL, views::BubbleBorder::FLOAT),\n view_(NULL) {\n set_close_on_esc(false);\n set_use_focusless(true);\n}\n\nSettingLevelBubbleDelegateView::~SettingLevelBubbleDelegateView() {\n view_ = NULL;\n}\n\nvoid SettingLevelBubbleDelegateView::Init() {\n SetLayoutManager(new views::FillLayout());\n view_ = new SettingLevelBubbleView();\n AddChildView(view_);\n}\n\n\/\/ SettingLevelBubble ----------------------------------------------------------\nvoid SettingLevelBubble::ShowBubble(double percent, bool enabled) {\n hide_timer_.Stop();\n\n \/\/ Set up target percent and icon.\n const double old_target_percent = target_percent_;\n UpdateTargetPercent(percent);\n SkBitmap* current_icon = increase_icon_;\n if (!enabled || target_percent_ == 0)\n current_icon = disabled_icon_;\n else if (old_target_percent >= 0 && target_percent_ < old_target_percent)\n current_icon = decrease_icon_;\n\n if (!view_) {\n view_ = CreateView();\n view_->Init(current_icon, percent, enabled);\n } else {\n \/\/ Reset fade sequence, if the bubble is already fading.\n SettingLevelBubbleDelegateView* delegate =\n static_cast<SettingLevelBubbleDelegateView*>\n (view_->GetWidget()->widget_delegate());\n delegate->ResetFade();\n view_->SetIcon(current_icon);\n view_->SetEnabled(enabled);\n }\n view_->GetWidget()->Show();\n \/\/ When the timer runs out, start the fade sequence.\n hide_timer_.Start(FROM_HERE,\n base::TimeDelta::FromMilliseconds(kBubbleShowTimeoutMs),\n this, &SettingLevelBubble::OnHideTimeout);\n}\n\nvoid SettingLevelBubble::HideBubble() {\n hide_timer_.Stop();\n if (view_) {\n view_->GetWidget()->Close();\n view_ = NULL;\n }\n}\n\nvoid SettingLevelBubble::UpdateWithoutShowingBubble(double percent,\n bool enabled) {\n UpdateTargetPercent(percent);\n if (view_)\n view_->SetEnabled(enabled);\n}\n\nSettingLevelBubble::SettingLevelBubble(SkBitmap* increase_icon,\n SkBitmap* decrease_icon,\n SkBitmap* disabled_icon)\n : current_percent_(-1.0),\n target_percent_(-1.0),\n increase_icon_(increase_icon),\n decrease_icon_(decrease_icon),\n disabled_icon_(disabled_icon),\n view_(NULL),\n is_animating_(false) {\n}\n\nSettingLevelBubble::~SettingLevelBubble() {\n view_ = NULL;\n}\n\nvoid SettingLevelBubble::OnWidgetClosing(views::Widget* widget) {\n if (view_ && view_->GetWidget() == widget) {\n view_->GetWidget()->RemoveObserver(this);\n view_ = NULL;\n }\n \/\/ Update states.\n current_percent_ = target_percent_;\n target_time_ = TimeTicks();\n last_animation_update_time_ = TimeTicks();\n last_target_update_time_ = TimeTicks();\n hide_timer_.Stop();\n StopAnimation();\n}\n\nSettingLevelBubbleView* SettingLevelBubble::CreateView() {\n SettingLevelBubbleDelegateView* delegate = new SettingLevelBubbleDelegateView;\n views::Widget* widget = browser::CreateViewsBubbleAboveLockScreen(delegate);\n widget->AddObserver(this);\n \/\/ Hold on to the content view.\n return delegate->view();\n}\n\nvoid SettingLevelBubble::OnHideTimeout() {\n \/\/ Start fading away.\n if (view_) {\n SettingLevelBubbleDelegateView* delegate =\n static_cast<SettingLevelBubbleDelegateView*>\n (view_->GetWidget()->widget_delegate());\n delegate->StartFade(false);\n }\n}\n\nvoid SettingLevelBubble::OnAnimationTimeout() {\n const TimeTicks now = TimeTicks::Now();\n const int64 remaining_ms = (target_time_ - now).InMilliseconds();\n\n if (remaining_ms <= 0) {\n current_percent_ = target_percent_;\n StopAnimation();\n } else {\n \/\/ Figure out what fraction of the total time until we want to reach the\n \/\/ target has elapsed since the last update.\n const double remaining_percent = target_percent_ - current_percent_;\n const int64 elapsed_ms =\n (now - last_animation_update_time_).InMilliseconds();\n current_percent_ +=\n remaining_percent *\n (static_cast<double>(elapsed_ms) \/ (elapsed_ms + remaining_ms));\n }\n last_animation_update_time_ = now;\n\n if (view_)\n view_->SetLevel(current_percent_);\n}\n\nvoid SettingLevelBubble::UpdateTargetPercent(double percent) {\n target_percent_ = LimitPercent(percent);\n const TimeTicks now = TimeTicks::Now();\n\n if (current_percent_ < 0.0) {\n \/\/ If we're setting the level for the first time, no need to animate.\n current_percent_ = target_percent_;\n if (view_)\n view_->SetLevel(current_percent_);\n } else {\n \/\/ Use the time since the last request as a hint for the duration of the\n \/\/ animation. This makes us automatically adapt to the repeat rate if a key\n \/\/ is being held down to change a setting (which prevents us from lagging\n \/\/ behind when the key is finally released).\n int64 duration_ms = kInitialAnimationDurationMs;\n if (!last_target_update_time_.is_null())\n duration_ms = min(kInitialAnimationDurationMs,\n (now - last_target_update_time_).InMilliseconds());\n target_time_ = now + TimeDelta::FromMilliseconds(duration_ms);\n\n if (!is_animating_) {\n animation_timer_.Start(FROM_HERE,\n TimeDelta::FromMilliseconds(kAnimationIntervalMs),\n this,\n &SettingLevelBubble::OnAnimationTimeout);\n is_animating_ = true;\n last_animation_update_time_ = now;\n }\n }\n\n last_target_update_time_ = now;\n}\n\nvoid SettingLevelBubble::StopAnimation() {\n animation_timer_.Stop();\n is_animating_ = false;\n}\n\n} \/\/ namespace chromeos\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/image_loading_tracker.h\"\n\n#include \"base\/file_util.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"skia\/ext\/image_operations.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"webkit\/glue\/image_decoder.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ImageLoadingTracker::ImageLoader\n\n\/\/ A RefCounted class for loading images on the File thread and reporting back\n\/\/ on the UI thread.\nclass ImageLoadingTracker::ImageLoader\n : public base::RefCountedThreadSafe<ImageLoader> {\n public:\n explicit ImageLoader(ImageLoadingTracker* tracker)\n : tracker_(tracker) {\n CHECK(ChromeThread::GetCurrentThreadIdentifier(&callback_thread_id_));\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n }\n\n \/\/ Lets this class know that the tracker is no longer interested in the\n \/\/ results.\n void StopTracking() {\n tracker_ = NULL;\n }\n\n \/\/ Instructs the loader to load a task on the File thread.\n void LoadImage(const ExtensionResource& resource,\n const gfx::Size& max_size,\n int id) {\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(this, &ImageLoader::LoadOnFileThread, resource,\n max_size, id));\n }\n\n void LoadOnFileThread(ExtensionResource resource,\n const gfx::Size& max_size,\n int id) {\n DCHECK(ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n \/\/ Read the file from disk.\n std::string file_contents;\n FilePath path = resource.GetFilePath();\n if (path.empty() || !file_util::ReadFileToString(path, &file_contents)) {\n ReportBack(NULL, resource, id);\n return;\n }\n\n \/\/ Decode the image using WebKit's image decoder.\n const unsigned char* data =\n reinterpret_cast<const unsigned char*>(file_contents.data());\n webkit_glue::ImageDecoder decoder;\n scoped_ptr<SkBitmap> decoded(new SkBitmap());\n *decoded = decoder.Decode(data, file_contents.length());\n if (decoded->empty()) {\n ReportBack(NULL, resource, id);\n return; \/\/ Unable to decode.\n }\n\n if (decoded->width() > max_size.width() ||\n decoded->height() > max_size.height()) {\n \/\/ The bitmap is too big, re-sample.\n *decoded = skia::ImageOperations::Resize(\n *decoded, skia::ImageOperations::RESIZE_LANCZOS3,\n max_size.width(), max_size.height());\n }\n\n ReportBack(decoded.release(), resource, id);\n }\n\n void ReportBack(SkBitmap* image, const ExtensionResource& resource,\n int id) {\n DCHECK(ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n ChromeThread::PostTask(\n callback_thread_id_, FROM_HERE,\n NewRunnableMethod(this, &ImageLoader::ReportOnUIThread,\n image, resource, id));\n }\n\n void ReportOnUIThread(SkBitmap* image, ExtensionResource resource,\n int id) {\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n if (tracker_)\n tracker_->OnImageLoaded(image, resource, id);\n\n delete image;\n }\n\n private:\n \/\/ The tracker we are loading the image for. If NULL, it means the tracker is\n \/\/ no longer interested in the reply.\n ImageLoadingTracker* tracker_;\n\n \/\/ The thread that we need to call back on to report that we are done.\n ChromeThread::ID callback_thread_id_;\n\n DISALLOW_COPY_AND_ASSIGN(ImageLoader);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ImageLoadingTracker\n\nImageLoadingTracker::ImageLoadingTracker(Observer* observer)\n : observer_(observer),\n next_id_(0) {\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED,\n NotificationService::AllSources());\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED_DISABLED,\n NotificationService::AllSources());\n}\n\nImageLoadingTracker::~ImageLoadingTracker() {\n \/\/ The loader is created lazily and is NULL if the tracker is destroyed before\n \/\/ any valid image load tasks have been posted.\n if (loader_)\n loader_->StopTracking();\n}\n\nvoid ImageLoadingTracker::LoadImage(Extension* extension,\n const ExtensionResource& resource,\n const gfx::Size& max_size,\n CacheParam cache) {\n DCHECK(extension->path() == resource.extension_root());\n\n \/\/ If we don't have a path we don't need to do any further work, just respond\n \/\/ back.\n int id = next_id_++;\n if (resource.relative_path().empty()) {\n OnImageLoaded(NULL, resource, id);\n return;\n }\n\n \/\/ See if the extension has the image already.\n if (extension->HasCachedImage(resource)) {\n SkBitmap image = extension->GetCachedImage(resource);\n OnImageLoaded(&image, resource, id);\n return;\n }\n\n if (cache == CACHE) {\n load_map_[id] = extension;\n }\n\n \/\/ Instruct the ImageLoader to load this on the File thread. LoadImage does\n \/\/ not block.\n if (!loader_)\n loader_ = new ImageLoader(this);\n loader_->LoadImage(resource, max_size, id);\n}\n\nvoid ImageLoadingTracker::OnImageLoaded(\n SkBitmap* image,\n const ExtensionResource& resource,\n int id) {\n LoadMap::iterator i = load_map_.find(id);\n if (i != load_map_.end()) {\n i->second->SetCachedImage(resource, image ? *image : SkBitmap());\n load_map_.erase(i);\n }\n\n observer_->OnImageLoaded(image, resource, id);\n}\n\nvoid ImageLoadingTracker::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n DCHECK(type == NotificationType::EXTENSION_UNLOADED ||\n type == NotificationType::EXTENSION_UNLOADED_DISABLED);\n\n Extension* extension = Details<Extension>(details).ptr();\n\n \/\/ Remove all entries in the load_map_ referencing the extension. This ensures\n \/\/ we don't attempt to cache the image when the load completes.\n for (LoadMap::iterator i = load_map_.begin(); i != load_map_.end();) {\n if (i->second == extension) {\n load_map_.erase(i++);\n } else {\n ++i;\n }\n }\n}\n<commit_msg>Fixes bug in ImageLoadintTracker where it would incorrectly hit a DCHECK if the extension doesn't have an image for a particular resource.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/extensions\/image_loading_tracker.h\"\n\n#include \"base\/file_util.h\"\n#include \"chrome\/browser\/chrome_thread.h\"\n#include \"chrome\/common\/extensions\/extension_resource.h\"\n#include \"chrome\/common\/notification_service.h\"\n#include \"chrome\/common\/notification_type.h\"\n#include \"skia\/ext\/image_operations.h\"\n#include \"third_party\/skia\/include\/core\/SkBitmap.h\"\n#include \"webkit\/glue\/image_decoder.h\"\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ImageLoadingTracker::ImageLoader\n\n\/\/ A RefCounted class for loading images on the File thread and reporting back\n\/\/ on the UI thread.\nclass ImageLoadingTracker::ImageLoader\n : public base::RefCountedThreadSafe<ImageLoader> {\n public:\n explicit ImageLoader(ImageLoadingTracker* tracker)\n : tracker_(tracker) {\n CHECK(ChromeThread::GetCurrentThreadIdentifier(&callback_thread_id_));\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n }\n\n \/\/ Lets this class know that the tracker is no longer interested in the\n \/\/ results.\n void StopTracking() {\n tracker_ = NULL;\n }\n\n \/\/ Instructs the loader to load a task on the File thread.\n void LoadImage(const ExtensionResource& resource,\n const gfx::Size& max_size,\n int id) {\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n ChromeThread::PostTask(\n ChromeThread::FILE, FROM_HERE,\n NewRunnableMethod(this, &ImageLoader::LoadOnFileThread, resource,\n max_size, id));\n }\n\n void LoadOnFileThread(ExtensionResource resource,\n const gfx::Size& max_size,\n int id) {\n DCHECK(ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n \/\/ Read the file from disk.\n std::string file_contents;\n FilePath path = resource.GetFilePath();\n if (path.empty() || !file_util::ReadFileToString(path, &file_contents)) {\n ReportBack(NULL, resource, id);\n return;\n }\n\n \/\/ Decode the image using WebKit's image decoder.\n const unsigned char* data =\n reinterpret_cast<const unsigned char*>(file_contents.data());\n webkit_glue::ImageDecoder decoder;\n scoped_ptr<SkBitmap> decoded(new SkBitmap());\n *decoded = decoder.Decode(data, file_contents.length());\n if (decoded->empty()) {\n ReportBack(NULL, resource, id);\n return; \/\/ Unable to decode.\n }\n\n if (decoded->width() > max_size.width() ||\n decoded->height() > max_size.height()) {\n \/\/ The bitmap is too big, re-sample.\n *decoded = skia::ImageOperations::Resize(\n *decoded, skia::ImageOperations::RESIZE_LANCZOS3,\n max_size.width(), max_size.height());\n }\n\n ReportBack(decoded.release(), resource, id);\n }\n\n void ReportBack(SkBitmap* image, const ExtensionResource& resource,\n int id) {\n DCHECK(ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n ChromeThread::PostTask(\n callback_thread_id_, FROM_HERE,\n NewRunnableMethod(this, &ImageLoader::ReportOnUIThread,\n image, resource, id));\n }\n\n void ReportOnUIThread(SkBitmap* image, ExtensionResource resource,\n int id) {\n DCHECK(!ChromeThread::CurrentlyOn(ChromeThread::FILE));\n\n if (tracker_)\n tracker_->OnImageLoaded(image, resource, id);\n\n delete image;\n }\n\n private:\n \/\/ The tracker we are loading the image for. If NULL, it means the tracker is\n \/\/ no longer interested in the reply.\n ImageLoadingTracker* tracker_;\n\n \/\/ The thread that we need to call back on to report that we are done.\n ChromeThread::ID callback_thread_id_;\n\n DISALLOW_COPY_AND_ASSIGN(ImageLoader);\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ ImageLoadingTracker\n\nImageLoadingTracker::ImageLoadingTracker(Observer* observer)\n : observer_(observer),\n next_id_(0) {\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED,\n NotificationService::AllSources());\n registrar_.Add(this, NotificationType::EXTENSION_UNLOADED_DISABLED,\n NotificationService::AllSources());\n}\n\nImageLoadingTracker::~ImageLoadingTracker() {\n \/\/ The loader is created lazily and is NULL if the tracker is destroyed before\n \/\/ any valid image load tasks have been posted.\n if (loader_)\n loader_->StopTracking();\n}\n\nvoid ImageLoadingTracker::LoadImage(Extension* extension,\n const ExtensionResource& resource,\n const gfx::Size& max_size,\n CacheParam cache) {\n \/\/ If we don't have a path we don't need to do any further work, just respond\n \/\/ back.\n int id = next_id_++;\n if (resource.relative_path().empty()) {\n OnImageLoaded(NULL, resource, id);\n return;\n }\n\n DCHECK(extension->path() == resource.extension_root());\n\n \/\/ See if the extension has the image already.\n if (extension->HasCachedImage(resource)) {\n SkBitmap image = extension->GetCachedImage(resource);\n OnImageLoaded(&image, resource, id);\n return;\n }\n\n if (cache == CACHE) {\n load_map_[id] = extension;\n }\n\n \/\/ Instruct the ImageLoader to load this on the File thread. LoadImage does\n \/\/ not block.\n if (!loader_)\n loader_ = new ImageLoader(this);\n loader_->LoadImage(resource, max_size, id);\n}\n\nvoid ImageLoadingTracker::OnImageLoaded(\n SkBitmap* image,\n const ExtensionResource& resource,\n int id) {\n LoadMap::iterator i = load_map_.find(id);\n if (i != load_map_.end()) {\n i->second->SetCachedImage(resource, image ? *image : SkBitmap());\n load_map_.erase(i);\n }\n\n observer_->OnImageLoaded(image, resource, id);\n}\n\nvoid ImageLoadingTracker::Observe(NotificationType type,\n const NotificationSource& source,\n const NotificationDetails& details) {\n DCHECK(type == NotificationType::EXTENSION_UNLOADED ||\n type == NotificationType::EXTENSION_UNLOADED_DISABLED);\n\n Extension* extension = Details<Extension>(details).ptr();\n\n \/\/ Remove all entries in the load_map_ referencing the extension. This ensures\n \/\/ we don't attempt to cache the image when the load completes.\n for (LoadMap::iterator i = load_map_.begin(); i != load_map_.end();) {\n if (i->second == extension) {\n load_map_.erase(i++);\n } else {\n ++i;\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <gtk\/gtk.h>\n\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/gtk\/bookmark_editor_gtk.h\"\n#include \"chrome\/browser\/gtk\/bookmark_tree_model.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing bookmark_utils::GetTitleFromTreeIter;\n\n\/\/ Base class for bookmark editor tests. This class is a copy from\n\/\/ bookmark_editor_view_unittest.cc, and all the tests in this file are\n\/\/ GTK-ifications of the corresponding views tests. Testing here is really\n\/\/ important because on Linux, we make round trip copies from chrome's\n\/\/ BookmarkModel class to GTK's native GtkTreeStore.\nclass BookmarkEditorGtkTest : public testing::Test {\n public:\n BookmarkEditorGtkTest() : model_(NULL) {\n }\n\n virtual void SetUp() {\n profile_.reset(new TestingProfile());\n profile_->set_has_history_service(true);\n profile_->CreateBookmarkModel(true);\n\n model_ = profile_->GetBookmarkModel();\n\n AddTestData();\n }\n\n virtual void TearDown() {\n }\n\n protected:\n MessageLoopForUI message_loop_;\n BookmarkModel* model_;\n scoped_ptr<TestingProfile> profile_;\n\n std::string base_path() const { return \"file:\/\/\/c:\/tmp\/\"; }\n\n BookmarkNode* GetNode(const std::string& name) {\n return model_->GetMostRecentlyAddedNodeForURL(GURL(base_path() + name));\n }\n\n private:\n \/\/ Creates the following structure:\n \/\/ bookmark bar node\n \/\/ a\n \/\/ F1\n \/\/ f1a\n \/\/ F11\n \/\/ f11a\n \/\/ F2\n \/\/ other node\n \/\/ oa\n \/\/ OF1\n \/\/ of1a\n void AddTestData() {\n std::string test_base = base_path();\n\n model_->AddURL(model_->GetBookmarkBarNode(), 0, L\"a\",\n GURL(test_base + \"a\"));\n BookmarkNode* f1 = model_->AddGroup(model_->GetBookmarkBarNode(), 1, L\"F1\");\n model_->AddURL(f1, 0, L\"f1a\", GURL(test_base + \"f1a\"));\n BookmarkNode* f11 = model_->AddGroup(f1, 1, L\"F11\");\n model_->AddURL(f11, 0, L\"f11a\", GURL(test_base + \"f11a\"));\n model_->AddGroup(model_->GetBookmarkBarNode(), 2, L\"F2\");\n\n \/\/ Children of the other node.\n model_->AddURL(model_->other_node(), 0, L\"oa\",\n GURL(test_base + \"oa\"));\n BookmarkNode* of1 = model_->AddGroup(model_->other_node(), 1, L\"OF1\");\n model_->AddURL(of1, 0, L\"of1a\", GURL(test_base + \"of1a\"));\n }\n};\n\n\/\/ Makes sure the tree model matches that of the bookmark bar model.\n\/\/ Disabled: See crbug.com\/15436\nTEST_F(BookmarkEditorGtkTest, DISABLED_ModelsMatch) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, NULL,\n BookmarkEditor::SHOW_TREE, NULL);\n\n \/\/ The root should have two children, one for the bookmark bar node,\n \/\/ the other for the 'other bookmarks' folder.\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter toplevel;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &toplevel));\n GtkTreeIter bookmark_bar_node = toplevel;\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &toplevel));\n GtkTreeIter other_node = toplevel;\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &toplevel));\n\n \/\/ The bookmark bar should have 2 nodes: folder F1 and F2.\n GtkTreeIter f1_iter;\n GtkTreeIter child;\n ASSERT_EQ(2, gtk_tree_model_iter_n_children(store, &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &bookmark_bar_node));\n f1_iter = child;\n ASSERT_EQ(L\"F1\", GetTitleFromTreeIter(store, &child));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &child));\n ASSERT_EQ(L\"F2\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n\n \/\/ F1 should have one child, F11\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &f1_iter));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &f1_iter));\n ASSERT_EQ(L\"F11\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n\n \/\/ Other node should have one child (OF1).\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &other_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &other_node));\n ASSERT_EQ(L\"OF1\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n}\n\n\/\/ Changes the title and makes sure parent\/visual order doesn't change.\nTEST_F(BookmarkEditorGtkTest, EditTitleKeepsPosition) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(L\"new_a\", bb_node->GetChild(0)->GetTitle());\n \/\/ The URL shouldn't have changed.\n ASSERT_TRUE(GURL(base_path() + \"a\") == bb_node->GetChild(0)->GetURL());\n}\n\n\/\/ Changes the url and makes sure parent\/visual order doesn't change.\nTEST_F(BookmarkEditorGtkTest, EditURLKeepsPosition) {\n Time node_time = Time::Now() + TimeDelta::FromDays(2);\n GetNode(\"a\")->date_added_ = node_time;\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"new_a\").spec().c_str());\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(L\"a\", bb_node->GetChild(0)->GetTitle());\n \/\/ The URL should have changed.\n ASSERT_TRUE(GURL(base_path() + \"new_a\") == bb_node->GetChild(0)->GetURL());\n ASSERT_TRUE(node_time == bb_node->GetChild(0)->date_added());\n}\n\n\/\/ Moves 'a' to be a child of the other node.\nTEST_F(BookmarkEditorGtkTest, ChangeParent) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter gtk_other_node;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, >k_other_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, >k_other_node));\n editor.ApplyEdits(>k_other_node);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(L\"a\", other_node->GetChild(2)->GetTitle());\n ASSERT_TRUE(GURL(base_path() + \"a\") == other_node->GetChild(2)->GetURL());\n}\n\n\/\/ Moves 'a' to be a child of the other node.\n\/\/ Moves 'a' to be a child of the other node and changes its url to new_a.\nTEST_F(BookmarkEditorGtkTest, ChangeParentAndURL) {\n Time node_time = Time::Now() + TimeDelta::FromDays(2);\n GetNode(\"a\")->date_added_ = node_time;\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"new_a\").spec().c_str());\n\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter gtk_other_node;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, >k_other_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, >k_other_node));\n editor.ApplyEdits(>k_other_node);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(L\"a\", other_node->GetChild(2)->GetTitle());\n ASSERT_TRUE(GURL(base_path() + \"new_a\") == other_node->GetChild(2)->GetURL());\n ASSERT_TRUE(node_time == other_node->GetChild(2)->date_added());\n}\n\n\/\/ Creates a new folder and moves a node to it.\nTEST_F(BookmarkEditorGtkTest, MoveToNewParent) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n\n \/\/ The bookmark bar should have 2 nodes: folder F1 and F2.\n GtkTreeIter f2_iter;\n ASSERT_EQ(2, gtk_tree_model_iter_n_children(store, &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &f2_iter,\n &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &f2_iter));\n\n \/\/ Create two nodes: \"F21\" as a child of \"F2\" and \"F211\" as a child of \"F21\".\n GtkTreeIter f21_iter;\n editor.AddNewGroup(&f2_iter, &f21_iter);\n gtk_tree_store_set(editor.tree_store_, &f21_iter,\n bookmark_utils::FOLDER_NAME, \"F21\", -1);\n GtkTreeIter f211_iter;\n editor.AddNewGroup(&f21_iter, &f211_iter);\n gtk_tree_store_set(editor.tree_store_, &f211_iter,\n bookmark_utils::FOLDER_NAME, \"F211\", -1);\n\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &f2_iter));\n\n editor.ApplyEdits(&f2_iter);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n BookmarkNode* mf2 = bb_node->GetChild(1);\n\n \/\/ F2 in the model should have two children now: F21 and the node edited.\n ASSERT_EQ(2, mf2->GetChildCount());\n \/\/ F21 should be first.\n ASSERT_EQ(L\"F21\", mf2->GetChild(0)->GetTitle());\n \/\/ Then a.\n ASSERT_EQ(L\"a\", mf2->GetChild(1)->GetTitle());\n\n \/\/ F21 should have one child, F211.\n BookmarkNode* mf21 = mf2->GetChild(0);\n ASSERT_EQ(1, mf21->GetChildCount());\n ASSERT_EQ(L\"F211\", mf21->GetChild(0)->GetTitle());\n}\n\n\/\/ Brings up the editor, creating a new URL on the bookmark bar.\nTEST_F(BookmarkEditorGtkTest, NewURL) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, NULL,\n BookmarkEditor::SHOW_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"a\").spec().c_str());\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(4, bb_node->GetChildCount());\n\n BookmarkNode* new_node = bb_node->GetChild(3);\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n EXPECT_TRUE(GURL(base_path() + \"a\") == new_node->GetURL());\n}\n\n\/\/ Brings up the editor with no tree and modifies the url.\nTEST_F(BookmarkEditorGtkTest, ChangeURLNoTree) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL,\n model_->other_node()->GetChild(0),\n BookmarkEditor::NO_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"a\").spec().c_str());\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n editor.ApplyEdits(NULL);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(2, other_node->GetChildCount());\n\n BookmarkNode* new_node = other_node->GetChild(0);\n\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n EXPECT_TRUE(GURL(base_path() + \"a\") == new_node->GetURL());\n}\n\n\/\/ Brings up the editor with no tree and modifies only the title.\nTEST_F(BookmarkEditorGtkTest, ChangeTitleNoTree) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL,\n model_->other_node()->GetChild(0),\n BookmarkEditor::NO_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n editor.ApplyEdits();\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(2, other_node->GetChildCount());\n\n BookmarkNode* new_node = other_node->GetChild(0);\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n}\n<commit_msg>Fix breakage<commit_after>\/\/ Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <gtk\/gtk.h>\n\n#include \"base\/string_util.h\"\n#include \"chrome\/browser\/bookmarks\/bookmark_model.h\"\n#include \"chrome\/browser\/profile.h\"\n#include \"chrome\/browser\/gtk\/bookmark_editor_gtk.h\"\n#include \"chrome\/browser\/gtk\/bookmark_tree_model.h\"\n#include \"chrome\/common\/pref_names.h\"\n#include \"chrome\/common\/pref_service.h\"\n#include \"chrome\/test\/testing_profile.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing base::Time;\nusing base::TimeDelta;\nusing bookmark_utils::GetTitleFromTreeIter;\n\n\/\/ Base class for bookmark editor tests. This class is a copy from\n\/\/ bookmark_editor_view_unittest.cc, and all the tests in this file are\n\/\/ GTK-ifications of the corresponding views tests. Testing here is really\n\/\/ important because on Linux, we make round trip copies from chrome's\n\/\/ BookmarkModel class to GTK's native GtkTreeStore.\nclass BookmarkEditorGtkTest : public testing::Test {\n public:\n BookmarkEditorGtkTest() : model_(NULL) {\n }\n\n virtual void SetUp() {\n profile_.reset(new TestingProfile());\n profile_->set_has_history_service(true);\n profile_->CreateBookmarkModel(true);\n\n model_ = profile_->GetBookmarkModel();\n\n AddTestData();\n }\n\n virtual void TearDown() {\n }\n\n protected:\n MessageLoopForUI message_loop_;\n BookmarkModel* model_;\n scoped_ptr<TestingProfile> profile_;\n\n std::string base_path() const { return \"file:\/\/\/c:\/tmp\/\"; }\n\n BookmarkNode* GetNode(const std::string& name) {\n return model_->GetMostRecentlyAddedNodeForURL(GURL(base_path() + name));\n }\n\n private:\n \/\/ Creates the following structure:\n \/\/ bookmark bar node\n \/\/ a\n \/\/ F1\n \/\/ f1a\n \/\/ F11\n \/\/ f11a\n \/\/ F2\n \/\/ other node\n \/\/ oa\n \/\/ OF1\n \/\/ of1a\n void AddTestData() {\n std::string test_base = base_path();\n\n model_->AddURL(model_->GetBookmarkBarNode(), 0, L\"a\",\n GURL(test_base + \"a\"));\n BookmarkNode* f1 = model_->AddGroup(model_->GetBookmarkBarNode(), 1, L\"F1\");\n model_->AddURL(f1, 0, L\"f1a\", GURL(test_base + \"f1a\"));\n BookmarkNode* f11 = model_->AddGroup(f1, 1, L\"F11\");\n model_->AddURL(f11, 0, L\"f11a\", GURL(test_base + \"f11a\"));\n model_->AddGroup(model_->GetBookmarkBarNode(), 2, L\"F2\");\n\n \/\/ Children of the other node.\n model_->AddURL(model_->other_node(), 0, L\"oa\",\n GURL(test_base + \"oa\"));\n BookmarkNode* of1 = model_->AddGroup(model_->other_node(), 1, L\"OF1\");\n model_->AddURL(of1, 0, L\"of1a\", GURL(test_base + \"of1a\"));\n }\n};\n\n\/\/ Makes sure the tree model matches that of the bookmark bar model.\n\/\/ Disabled: See crbug.com\/15436\n#if 0\nTEST_F(BookmarkEditorGtkTest, ModelsMatch) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, NULL,\n BookmarkEditor::SHOW_TREE, NULL);\n\n \/\/ The root should have two children, one for the bookmark bar node,\n \/\/ the other for the 'other bookmarks' folder.\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter toplevel;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &toplevel));\n GtkTreeIter bookmark_bar_node = toplevel;\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &toplevel));\n GtkTreeIter other_node = toplevel;\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &toplevel));\n\n \/\/ The bookmark bar should have 2 nodes: folder F1 and F2.\n GtkTreeIter f1_iter;\n GtkTreeIter child;\n ASSERT_EQ(2, gtk_tree_model_iter_n_children(store, &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &bookmark_bar_node));\n f1_iter = child;\n ASSERT_EQ(L\"F1\", GetTitleFromTreeIter(store, &child));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &child));\n ASSERT_EQ(L\"F2\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n\n \/\/ F1 should have one child, F11\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &f1_iter));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &f1_iter));\n ASSERT_EQ(L\"F11\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n\n \/\/ Other node should have one child (OF1).\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &other_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &child, &other_node));\n ASSERT_EQ(L\"OF1\", GetTitleFromTreeIter(store, &child));\n ASSERT_FALSE(gtk_tree_model_iter_next(store, &child));\n}\n#endif\n\n\/\/ Changes the title and makes sure parent\/visual order doesn't change.\nTEST_F(BookmarkEditorGtkTest, EditTitleKeepsPosition) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(L\"new_a\", bb_node->GetChild(0)->GetTitle());\n \/\/ The URL shouldn't have changed.\n ASSERT_TRUE(GURL(base_path() + \"a\") == bb_node->GetChild(0)->GetURL());\n}\n\n\/\/ Changes the url and makes sure parent\/visual order doesn't change.\nTEST_F(BookmarkEditorGtkTest, EditURLKeepsPosition) {\n Time node_time = Time::Now() + TimeDelta::FromDays(2);\n GetNode(\"a\")->date_added_ = node_time;\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"new_a\").spec().c_str());\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(L\"a\", bb_node->GetChild(0)->GetTitle());\n \/\/ The URL should have changed.\n ASSERT_TRUE(GURL(base_path() + \"new_a\") == bb_node->GetChild(0)->GetURL());\n ASSERT_TRUE(node_time == bb_node->GetChild(0)->date_added());\n}\n\n\/\/ Moves 'a' to be a child of the other node.\nTEST_F(BookmarkEditorGtkTest, ChangeParent) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter gtk_other_node;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, >k_other_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, >k_other_node));\n editor.ApplyEdits(>k_other_node);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(L\"a\", other_node->GetChild(2)->GetTitle());\n ASSERT_TRUE(GURL(base_path() + \"a\") == other_node->GetChild(2)->GetURL());\n}\n\n\/\/ Moves 'a' to be a child of the other node.\n\/\/ Moves 'a' to be a child of the other node and changes its url to new_a.\nTEST_F(BookmarkEditorGtkTest, ChangeParentAndURL) {\n Time node_time = Time::Now() + TimeDelta::FromDays(2);\n GetNode(\"a\")->date_added_ = node_time;\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"new_a\").spec().c_str());\n\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n GtkTreeIter gtk_other_node;\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, >k_other_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, >k_other_node));\n editor.ApplyEdits(>k_other_node);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(L\"a\", other_node->GetChild(2)->GetTitle());\n ASSERT_TRUE(GURL(base_path() + \"new_a\") == other_node->GetChild(2)->GetURL());\n ASSERT_TRUE(node_time == other_node->GetChild(2)->date_added());\n}\n\n\/\/ Creates a new folder and moves a node to it.\nTEST_F(BookmarkEditorGtkTest, MoveToNewParent) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, GetNode(\"a\"),\n BookmarkEditor::SHOW_TREE, NULL);\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n\n \/\/ The bookmark bar should have 2 nodes: folder F1 and F2.\n GtkTreeIter f2_iter;\n ASSERT_EQ(2, gtk_tree_model_iter_n_children(store, &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_children(store, &f2_iter,\n &bookmark_bar_node));\n ASSERT_TRUE(gtk_tree_model_iter_next(store, &f2_iter));\n\n \/\/ Create two nodes: \"F21\" as a child of \"F2\" and \"F211\" as a child of \"F21\".\n GtkTreeIter f21_iter;\n editor.AddNewGroup(&f2_iter, &f21_iter);\n gtk_tree_store_set(editor.tree_store_, &f21_iter,\n bookmark_utils::FOLDER_NAME, \"F21\", -1);\n GtkTreeIter f211_iter;\n editor.AddNewGroup(&f21_iter, &f211_iter);\n gtk_tree_store_set(editor.tree_store_, &f211_iter,\n bookmark_utils::FOLDER_NAME, \"F211\", -1);\n\n ASSERT_EQ(1, gtk_tree_model_iter_n_children(store, &f2_iter));\n\n editor.ApplyEdits(&f2_iter);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n BookmarkNode* mf2 = bb_node->GetChild(1);\n\n \/\/ F2 in the model should have two children now: F21 and the node edited.\n ASSERT_EQ(2, mf2->GetChildCount());\n \/\/ F21 should be first.\n ASSERT_EQ(L\"F21\", mf2->GetChild(0)->GetTitle());\n \/\/ Then a.\n ASSERT_EQ(L\"a\", mf2->GetChild(1)->GetTitle());\n\n \/\/ F21 should have one child, F211.\n BookmarkNode* mf21 = mf2->GetChild(0);\n ASSERT_EQ(1, mf21->GetChildCount());\n ASSERT_EQ(L\"F211\", mf21->GetChild(0)->GetTitle());\n}\n\n\/\/ Brings up the editor, creating a new URL on the bookmark bar.\nTEST_F(BookmarkEditorGtkTest, NewURL) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL, NULL,\n BookmarkEditor::SHOW_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"a\").spec().c_str());\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n GtkTreeIter bookmark_bar_node;\n GtkTreeModel* store = GTK_TREE_MODEL(editor.tree_store_);\n ASSERT_TRUE(gtk_tree_model_get_iter_first(store, &bookmark_bar_node));\n editor.ApplyEdits(&bookmark_bar_node);\n\n BookmarkNode* bb_node = profile_->GetBookmarkModel()->GetBookmarkBarNode();\n ASSERT_EQ(4, bb_node->GetChildCount());\n\n BookmarkNode* new_node = bb_node->GetChild(3);\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n EXPECT_TRUE(GURL(base_path() + \"a\") == new_node->GetURL());\n}\n\n\/\/ Brings up the editor with no tree and modifies the url.\nTEST_F(BookmarkEditorGtkTest, ChangeURLNoTree) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL,\n model_->other_node()->GetChild(0),\n BookmarkEditor::NO_TREE, NULL);\n\n gtk_entry_set_text(GTK_ENTRY(editor.url_entry_),\n GURL(base_path() + \"a\").spec().c_str());\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n editor.ApplyEdits(NULL);\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(2, other_node->GetChildCount());\n\n BookmarkNode* new_node = other_node->GetChild(0);\n\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n EXPECT_TRUE(GURL(base_path() + \"a\") == new_node->GetURL());\n}\n\n\/\/ Brings up the editor with no tree and modifies only the title.\nTEST_F(BookmarkEditorGtkTest, ChangeTitleNoTree) {\n BookmarkEditorGtk editor(NULL, profile_.get(), NULL,\n model_->other_node()->GetChild(0),\n BookmarkEditor::NO_TREE, NULL);\n gtk_entry_set_text(GTK_ENTRY(editor.name_entry_), \"new_a\");\n\n editor.ApplyEdits();\n\n BookmarkNode* other_node = profile_->GetBookmarkModel()->other_node();\n ASSERT_EQ(2, other_node->GetChildCount());\n\n BookmarkNode* new_node = other_node->GetChild(0);\n EXPECT_EQ(L\"new_a\", new_node->GetTitle());\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Enable back the test disabled in r19348,r19345 since dank disabled them from valgrind itself.<commit_after><|endoftext|>"} {"text":"<commit_before>#define PROBLEM \"http:\/\/judge.u-aizu.ac.jp\/onlinejudge\/description.jsp?id=GRL_1_C&lang=jp\"\n#include <iostream>\n#include <limits>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\n\/\/ ----- WarshallFloyd -----\n\ntemplate <typename T>\nvoid WarshallFloyd(vector<vector<T>> &V, T infinity = numeric_limits<T>::max())\n{\n \/\/ It is valid to apply this method for\n \/\/ - a directed\/undirected graph,\n \/\/ - a graph whose edge may be negative.\n \/\/ - Negative cycle can be detected by V[i][i] < 0 if we initialize V[i][i] = 0.\n auto N{static_cast<int>(V.size())};\n for (auto k{0}; k < N; ++k)\n {\n for (auto i{0}; i < N; ++i)\n {\n for (auto j{0}; j < N; ++j)\n {\n if (V[i][k] == infinity || V[k][j] == infinity)\n {\n continue;\n }\n ch_min(V[i][j], V[i][k] + V[k][j]);\n }\n }\n }\n}\n\n\/\/ ----- main -----\n\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\n\nint main()\n{\n int N, M;\n cin >> N >> M;\n vector<vector<ll>> D(N, vector<ll>(N, Infty<ll>()));\n for (auto i{0}; i < M; ++i)\n {\n int A, B;\n ll C;\n cin >> A >> B >> C;\n D[A][B] = C;\n }\n for (auto i{0}; i < N; ++i)\n {\n D[i][i] = 0;\n }\n WarshallFloyd(D);\n for (auto i{0}; i < N; ++i)\n {\n if (D[i][i] < 0)\n {\n cout << \"NEGATIVE CYCLE\" << endl;\n return 0;\n }\n }\n for (auto i{0}; i < N; ++i)\n {\n for (auto j{0}; j < N; ++j)\n {\n cout << (D[i][j] == Infty<ll>() ? \"INF\" : to_string(D[i][j]));\n if (j < N - 1)\n {\n cout << \" \";\n }\n else\n {\n cout << endl;\n }\n }\n }\n}\n<commit_msg>WarshallFloyd<commit_after>#define PROBLEM \"https:\/\/onlinejudge.u-aizu.ac.jp\/courses\/library\/5\/GRL\/1\/GRL_1_C\"\n#include <iostream>\n#include <limits>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n\ntemplate <typename T>\nvoid ch_min(T &left, T right)\n{\n if (left > right)\n {\n left = right;\n }\n}\n\n\/\/ ----- WarshallFloyd -----\n\ntemplate <typename T>\nvoid WarshallFloyd(vector<vector<T>> &V, T infinity = numeric_limits<T>::max())\n{\n \/\/ It is valid to apply this method for\n \/\/ - a directed\/undirected graph,\n \/\/ - a graph whose edge may be negative.\n \/\/ - Negative cycle can be detected by V[i][i] < 0 if we initialize V[i][i] = 0.\n auto N{static_cast<int>(V.size())};\n for (auto k{0}; k < N; ++k)\n {\n for (auto i{0}; i < N; ++i)\n {\n for (auto j{0}; j < N; ++j)\n {\n if (V[i][k] == infinity || V[k][j] == infinity)\n {\n continue;\n }\n ch_min(V[i][j], V[i][k] + V[k][j]);\n }\n }\n }\n}\n\n\/\/ ----- main -----\n\ntemplate <typename T>\nconstexpr T Infty() { return numeric_limits<T>::max(); }\n\nint main()\n{\n int N, M;\n cin >> N >> M;\n vector<vector<ll>> D(N, vector<ll>(N, Infty<ll>()));\n for (auto i{0}; i < M; ++i)\n {\n int A, B;\n ll C;\n cin >> A >> B >> C;\n D[A][B] = C;\n }\n for (auto i{0}; i < N; ++i)\n {\n D[i][i] = 0;\n }\n WarshallFloyd(D);\n for (auto i{0}; i < N; ++i)\n {\n if (D[i][i] < 0)\n {\n cout << \"NEGATIVE CYCLE\" << endl;\n return 0;\n }\n }\n for (auto i{0}; i < N; ++i)\n {\n for (auto j{0}; j < N; ++j)\n {\n cout << (D[i][j] == Infty<ll>() ? \"INF\" : to_string(D[i][j]));\n if (j < N - 1)\n {\n cout << \" \";\n }\n else\n {\n cout << endl;\n }\n }\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/search_engines\/search_terms_data.h\"\n\n#include \"base\/logging.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/browser\/google\/google_url_tracker.h\"\n#include \"googleurl\/src\/gurl.h\"\n\n#if defined(OS_WIN) && defined(GOOGLE_CHROME_BUILD)\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#endif\n\nSearchTermsData::SearchTermsData() {\n}\n\nSearchTermsData::~SearchTermsData() {\n}\n\nstd::string SearchTermsData::GoogleBaseSuggestURLValue() const {\n \/\/ The suggest base URL we want at the end is something like\n \/\/ \"http:\/\/clients1.google.TLD\/complete\/\". The key bit we want from the\n \/\/ original Google base URL is the TLD.\n\n \/\/ Start with the Google base URL.\n const GURL base_url(GoogleBaseURLValue());\n DCHECK(base_url.is_valid());\n\n \/\/ Change \"www.\" to \"clients1.\" in the hostname. If no \"www.\" was found, just\n \/\/ prepend \"clients1.\".\n const std::string base_host(base_url.host());\n GURL::Replacements repl;\n const std::string suggest_host(\"clients1.\" +\n (base_host.compare(0, 4, \"www.\") ? base_host : base_host.substr(4)));\n repl.SetHostStr(suggest_host);\n\n \/\/ Replace any existing path with \"\/complete\/\".\n static const std::string suggest_path(\"\/complete\/\");\n repl.SetPathStr(suggest_path);\n\n \/\/ Clear the query and ref.\n repl.ClearQuery();\n repl.ClearRef();\n return base_url.ReplaceComponents(repl).spec();\n}\n\n\/\/ static\nstd::string* UIThreadSearchTermsData::google_base_url_ = NULL;\n\nUIThreadSearchTermsData::UIThreadSearchTermsData() {\n \/\/ GoogleURLTracker::GoogleURL() DCHECKs this also, but adding it here helps\n \/\/ us catch bad behavior at a more common place in this code.\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n}\n\nstd::string UIThreadSearchTermsData::GoogleBaseURLValue() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n return google_base_url_ ?\n (*google_base_url_) : GoogleURLTracker::GoogleURL().spec();\n}\n\nstd::string UIThreadSearchTermsData::GetApplicationLocale() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n return g_browser_process->GetApplicationLocale();\n}\n\n#if defined(OS_WIN) && defined(GOOGLE_CHROME_BUILD)\nstd::wstring UIThreadSearchTermsData::GetRlzParameterValue() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n std::wstring rlz_string;\n \/\/ For organic brandcodes do not use rlz at all. Empty brandcode usually\n \/\/ means a chromium install. This is ok.\n std::wstring brand;\n if (GoogleUpdateSettings::GetBrand(&brand) && !brand.empty() &&\n !GoogleUpdateSettings::IsOrganic(brand))\n RLZTracker::GetAccessPointRlz(rlz_lib::CHROME_OMNIBOX, &rlz_string);\n return rlz_string;\n}\n#endif\n\n\/\/ static\nvoid UIThreadSearchTermsData::SetGoogleBaseURL(std::string* google_base_url) {\n delete google_base_url_;\n google_base_url_ = google_base_url;\n}\n<commit_msg>Adding ScopedAllowIO to GetRlzParameterValue() while we evaluate wether the access to IO is ok here.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"chrome\/browser\/search_engines\/search_terms_data.h\"\n\n#include \"base\/logging.h\"\n#include \"base\/thread_restrictions.h\"\n#include \"chrome\/browser\/browser_process.h\"\n#include \"chrome\/browser\/browser_thread.h\"\n#include \"chrome\/browser\/google\/google_url_tracker.h\"\n#include \"googleurl\/src\/gurl.h\"\n\n#if defined(OS_WIN) && defined(GOOGLE_CHROME_BUILD)\n#include \"chrome\/browser\/rlz\/rlz.h\"\n#include \"chrome\/installer\/util\/google_update_settings.h\"\n#endif\n\nSearchTermsData::SearchTermsData() {\n}\n\nSearchTermsData::~SearchTermsData() {\n}\n\nstd::string SearchTermsData::GoogleBaseSuggestURLValue() const {\n \/\/ The suggest base URL we want at the end is something like\n \/\/ \"http:\/\/clients1.google.TLD\/complete\/\". The key bit we want from the\n \/\/ original Google base URL is the TLD.\n\n \/\/ Start with the Google base URL.\n const GURL base_url(GoogleBaseURLValue());\n DCHECK(base_url.is_valid());\n\n \/\/ Change \"www.\" to \"clients1.\" in the hostname. If no \"www.\" was found, just\n \/\/ prepend \"clients1.\".\n const std::string base_host(base_url.host());\n GURL::Replacements repl;\n const std::string suggest_host(\"clients1.\" +\n (base_host.compare(0, 4, \"www.\") ? base_host : base_host.substr(4)));\n repl.SetHostStr(suggest_host);\n\n \/\/ Replace any existing path with \"\/complete\/\".\n static const std::string suggest_path(\"\/complete\/\");\n repl.SetPathStr(suggest_path);\n\n \/\/ Clear the query and ref.\n repl.ClearQuery();\n repl.ClearRef();\n return base_url.ReplaceComponents(repl).spec();\n}\n\n\/\/ static\nstd::string* UIThreadSearchTermsData::google_base_url_ = NULL;\n\nUIThreadSearchTermsData::UIThreadSearchTermsData() {\n \/\/ GoogleURLTracker::GoogleURL() DCHECKs this also, but adding it here helps\n \/\/ us catch bad behavior at a more common place in this code.\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n}\n\nstd::string UIThreadSearchTermsData::GoogleBaseURLValue() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n return google_base_url_ ?\n (*google_base_url_) : GoogleURLTracker::GoogleURL().spec();\n}\n\nstd::string UIThreadSearchTermsData::GetApplicationLocale() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n return g_browser_process->GetApplicationLocale();\n}\n\n#if defined(OS_WIN) && defined(GOOGLE_CHROME_BUILD)\nstd::wstring UIThreadSearchTermsData::GetRlzParameterValue() const {\n DCHECK(!BrowserThread::IsWellKnownThread(BrowserThread::UI) ||\n BrowserThread::CurrentlyOn(BrowserThread::UI));\n std::wstring rlz_string;\n \/\/ For organic brandcodes do not use rlz at all. Empty brandcode usually\n \/\/ means a chromium install. This is ok.\n std::wstring brand;\n \/\/ See http:\/\/crbug.com\/62337.\n base::ThreadRestrictions::ScopedAllowIO allow_io;\n if (GoogleUpdateSettings::GetBrand(&brand) && !brand.empty() &&\n !GoogleUpdateSettings::IsOrganic(brand))\n RLZTracker::GetAccessPointRlz(rlz_lib::CHROME_OMNIBOX, &rlz_string);\n return rlz_string;\n}\n#endif\n\n\/\/ static\nvoid UIThreadSearchTermsData::SetGoogleBaseURL(std::string* google_base_url) {\n delete google_base_url_;\n google_base_url_ = google_base_url;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <limits>\n#include <string>\n\n#include \"base\/file_util.h\"\n#include \"base\/memory\/scoped_temp_dir.h\"\n#include \"chrome\/browser\/password_manager\/encryptor.h\"\n#include \"chrome\/browser\/sync\/syncable\/directory_manager.h\"\n#include \"chrome\/browser\/sync\/util\/user_settings.h\"\n#include \"chrome\/common\/sqlite_utils.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing browser_sync::APEncode;\nusing browser_sync::APDecode;\nusing browser_sync::ExecOrDie;\nusing browser_sync::UserSettings;\n\nusing std::numeric_limits;\n\nstatic const FilePath::CharType kV10UserSettingsDB[] =\n FILE_PATH_LITERAL(\"Version10Settings.sqlite3\");\nstatic const FilePath::CharType kV11UserSettingsDB[] =\n FILE_PATH_LITERAL(\"Version11Settings.sqlite3\");\nstatic const FilePath::CharType kOldStyleSyncDataDB[] =\n FILE_PATH_LITERAL(\"OldStyleSyncData.sqlite3\");\n\nclass UserSettingsTest : public testing::Test {\n public:\n UserSettingsTest() : sync_data_(\"Some sync data\") { }\n\n virtual void SetUp() {\n#if defined(OS_MACOSX)\n \/\/ Need to mock the Keychain for unit tests on Mac to avoid possible\n \/\/ blocking UI. |SetAuthTokenForService| uses Encryptor.\n Encryptor::UseMockKeychain(true);\n#endif\n }\n\n \/\/ Creates and populates the V10 database files within\n \/\/ |destination_directory|.\n void SetUpVersion10Databases(const FilePath& destination_directory) {\n sqlite3* primer_handle = NULL;\n v10_user_setting_db_path_ =\n destination_directory.Append(FilePath(kV10UserSettingsDB));\n ASSERT_EQ(SQLITE_OK, sqlite_utils::OpenSqliteDb(v10_user_setting_db_path_,\n &primer_handle));\n sqlite_utils::scoped_sqlite_db_ptr db(primer_handle);\n\n old_style_sync_data_path_ =\n destination_directory.Append(FilePath(kOldStyleSyncDataDB));\n\n ASSERT_EQ(sync_data_.length(),\n static_cast<size_t>(file_util::WriteFile(\n old_style_sync_data_path_, sync_data_.data(),\n sync_data_.length())));\n\n \/\/ Create settings table.\n ExecOrDie(primer_handle, \"CREATE TABLE settings\"\n \" (email, key, value, \"\n \" PRIMARY KEY(email, key) ON CONFLICT REPLACE)\");\n \/\/ Add a blank signin table.\n ExecOrDie(primer_handle, \"CREATE TABLE signin_types\"\n \" (signin, signin_type)\");\n \/\/ Create and populate version table.\n ExecOrDie(primer_handle, \"CREATE TABLE db_version ( version )\");\n {\n SQLStatement statement;\n const char query[] = \"INSERT INTO db_version values ( ? )\";\n statement.prepare(primer_handle, query);\n statement.bind_int(0, 10);\n if (SQLITE_DONE != statement.step()) {\n LOG(FATAL) << query << \"\\n\" << sqlite3_errmsg(primer_handle);\n }\n }\n \/\/ Create shares table.\n ExecOrDie(primer_handle, \"CREATE TABLE shares\"\n \" (email, share_name, file_name,\"\n \" PRIMARY KEY(email, share_name) ON CONFLICT REPLACE)\");\n \/\/ Populate a share.\n {\n SQLStatement statement;\n const char query[] = \"INSERT INTO shares values ( ?, ?, ? )\";\n statement.prepare(primer_handle, query);\n statement.bind_string(0, \"foo@foo.com\");\n statement.bind_string(1, \"foo@foo.com\");\n#if defined(OS_WIN)\n statement.bind_string(2, WideToUTF8(old_style_sync_data_path_.value()));\n#elif defined(OS_POSIX)\n statement.bind_string(2, old_style_sync_data_path_.value());\n#endif\n if (SQLITE_DONE != statement.step()) {\n LOG(FATAL) << query << \"\\n\" << sqlite3_errmsg(primer_handle);\n }\n }\n }\n\n \/\/ Creates and populates the V11 database file within\n \/\/ |destination_directory|.\n void SetUpVersion11Database(const FilePath& destination_directory) {\n sqlite3* primer_handle = NULL;\n v11_user_setting_db_path_ =\n destination_directory.Append(FilePath(kV11UserSettingsDB));\n ASSERT_EQ(SQLITE_OK, sqlite_utils::OpenSqliteDb(v11_user_setting_db_path_,\n &primer_handle));\n sqlite_utils::scoped_sqlite_db_ptr db(primer_handle);\n\n \/\/ Create settings table.\n ExecOrDie(primer_handle, \"CREATE TABLE settings\"\n \" (email, key, value, \"\n \" PRIMARY KEY(email, key) ON CONFLICT REPLACE)\");\n\n \/\/ Create and populate version table.\n ExecOrDie(primer_handle, \"CREATE TABLE db_version ( version )\");\n {\n SQLStatement statement;\n const char query[] = \"INSERT INTO db_version values ( ? )\";\n statement.prepare(primer_handle, query);\n statement.bind_int(0, 11);\n if (SQLITE_DONE != statement.step()) {\n LOG(FATAL) << query << \"\\n\" << sqlite3_errmsg(primer_handle);\n }\n }\n\n ExecOrDie(primer_handle, \"CREATE TABLE signin_types\"\n \" (signin, signin_type)\");\n\n {\n SQLStatement statement;\n const char query[] = \"INSERT INTO signin_types values ( ?, ? )\";\n statement.prepare(primer_handle, query);\n statement.bind_string(0, \"test\");\n statement.bind_string(1, \"test\");\n if (SQLITE_DONE != statement.step()) {\n LOG(FATAL) << query << \"\\n\" << sqlite3_errmsg(primer_handle);\n }\n }\n }\n\n const std::string& sync_data() const { return sync_data_; }\n const FilePath& v10_user_setting_db_path() const {\n return v10_user_setting_db_path_;\n }\n const FilePath& v11_user_setting_db_path() const {\n return v11_user_setting_db_path_;\n }\n const FilePath& old_style_sync_data_path() const {\n return old_style_sync_data_path_;\n }\n\n private:\n FilePath v10_user_setting_db_path_;\n FilePath old_style_sync_data_path_;\n\n FilePath v11_user_setting_db_path_;\n\n std::string sync_data_;\n};\n\nTEST_F(UserSettingsTest, MigrateFromV10ToV11) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n SetUpVersion10Databases(temp_dir.path());\n {\n \/\/ Create a UserSettings, which should trigger migration code. We do this\n \/\/ inside a scoped block so it closes itself and we can poke around to see\n \/\/ what happened later.\n UserSettings settings;\n settings.Init(v10_user_setting_db_path());\n }\n\n \/\/ Now poke around using sqlite to see if UserSettings migrated properly.\n sqlite3* handle = NULL;\n ASSERT_EQ(SQLITE_OK, sqlite_utils::OpenSqliteDb(v10_user_setting_db_path(),\n &handle));\n sqlite_utils::scoped_sqlite_db_ptr db(handle);\n\n \/\/ Note that we don't use ScopedStatement to avoid closing the sqlite handle\n \/\/ before finalizing the statement.\n {\n SQLStatement version_query;\n version_query.prepare(handle, \"SELECT version FROM db_version\");\n ASSERT_EQ(SQLITE_ROW, version_query.step());\n const int version = version_query.column_int(0);\n EXPECT_GE(version, 11);\n }\n\n EXPECT_FALSE(file_util::PathExists(old_style_sync_data_path()));\n\n FilePath new_style_path = temp_dir.path().Append(\n syncable::DirectoryManager::GetSyncDataDatabaseFilename());\n\n std::string contents;\n ASSERT_TRUE(file_util::ReadFileToString(new_style_path, &contents));\n EXPECT_TRUE(sync_data() == contents);\n}\n\nTEST_F(UserSettingsTest, MigrateFromV11ToV12) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n SetUpVersion11Database(temp_dir.path());\n {\n UserSettings settings;\n settings.Init(v11_user_setting_db_path());\n }\n sqlite3* handle = NULL;\n ASSERT_EQ(SQLITE_OK, sqlite_utils::OpenSqliteDb(v11_user_setting_db_path(),\n &handle));\n sqlite_utils::scoped_sqlite_db_ptr db(handle);\n\n {\n SQLStatement version_query;\n version_query.prepare(handle, \"SELECT version FROM db_version\");\n ASSERT_EQ(SQLITE_ROW, version_query.step());\n const int version = version_query.column_int(0);\n EXPECT_GE(version, 12);\n\n SQLStatement table_query;\n table_query.prepare(handle, \"SELECT name FROM sqlite_master \"\n \"WHERE type='table' AND name='signin_types'\");\n ASSERT_NE(SQLITE_ROW, table_query.step());\n }\n}\n\nTEST_F(UserSettingsTest, APEncode) {\n std::string test;\n char i;\n for (i = numeric_limits<char>::min(); i < numeric_limits<char>::max(); ++i)\n test.push_back(i);\n test.push_back(i);\n const std::string encoded = APEncode(test);\n const std::string decoded = APDecode(encoded);\n ASSERT_EQ(test, decoded);\n}\n\nTEST_F(UserSettingsTest, PersistEmptyToken) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n UserSettings settings;\n settings.Init(temp_dir.path().AppendASCII(\"UserSettings.sqlite3\"));\n settings.SetAuthTokenForService(\"username\", \"service\", \"\");\n std::string username;\n std::string token;\n ASSERT_TRUE(settings.GetLastUserAndServiceToken(\"service\", &username,\n &token));\n EXPECT_EQ(\"\", token);\n EXPECT_EQ(\"username\", username);\n}\n\nTEST_F(UserSettingsTest, PersistNonEmptyToken) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n UserSettings settings;\n settings.Init(temp_dir.path().AppendASCII(\"UserSettings.sqlite3\"));\n settings.SetAuthTokenForService(\"username\", \"service\",\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\");\n std::string username;\n std::string token;\n ASSERT_TRUE(settings.GetLastUserAndServiceToken(\"service\", &username,\n &token));\n EXPECT_EQ(\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\",\n token);\n EXPECT_EQ(\"username\", username);\n}\n<commit_msg>Cleanup: Remove sqlite_utils.h from user_settings_unittest.cc<commit_after>\/\/ Copyright (c) 2011 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include <limits>\n#include <string>\n\n#include \"app\/sql\/statement.h\"\n#include \"base\/file_util.h\"\n#include \"base\/memory\/scoped_temp_dir.h\"\n#include \"base\/utf_string_conversions.h\"\n#include \"build\/build_config.h\"\n#include \"chrome\/browser\/password_manager\/encryptor.h\"\n#include \"chrome\/browser\/sync\/syncable\/directory_manager.h\"\n#include \"chrome\/browser\/sync\/util\/user_settings.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nusing std::numeric_limits;\n\nnamespace {\n\nconst FilePath::CharType kV10UserSettingsDB[] =\n FILE_PATH_LITERAL(\"Version10Settings.sqlite3\");\nconst FilePath::CharType kV11UserSettingsDB[] =\n FILE_PATH_LITERAL(\"Version11Settings.sqlite3\");\nconst FilePath::CharType kOldStyleSyncDataDB[] =\n FILE_PATH_LITERAL(\"OldStyleSyncData.sqlite3\");\n\n} \/\/ namespace\n\nclass UserSettingsTest : public testing::Test {\n public:\n UserSettingsTest() : sync_data_(\"Some sync data\") {}\n\n virtual void SetUp() {\n#if defined(OS_MACOSX)\n \/\/ Need to mock the Keychain for unit tests on Mac to avoid possible\n \/\/ blocking UI. |SetAuthTokenForService| uses Encryptor.\n Encryptor::UseMockKeychain(true);\n#endif\n }\n\n \/\/ Creates and populates the V10 database files within\n \/\/ |destination_directory|.\n void SetUpVersion10Databases(const FilePath& destination_directory) {\n v10_user_setting_db_path_ =\n destination_directory.Append(FilePath(kV10UserSettingsDB));\n\n sql::Connection db;\n ASSERT_TRUE(db.Open(v10_user_setting_db_path_));\n\n old_style_sync_data_path_ =\n destination_directory.Append(FilePath(kOldStyleSyncDataDB));\n\n ASSERT_EQ(sync_data_.length(),\n static_cast<size_t>(file_util::WriteFile(\n old_style_sync_data_path_, sync_data_.data(),\n sync_data_.length())));\n\n \/\/ Create settings table.\n ASSERT_TRUE(db.Execute(\n \"CREATE TABLE settings (email, key, value, PRIMARY KEY(email, key)\"\n \" ON CONFLICT REPLACE)\"));\n\n \/\/ Add a blank signin table.\n ASSERT_TRUE(db.Execute(\n \"CREATE TABLE signin_types (signin, signin_type)\"));\n\n \/\/ Create and populate version table.\n ASSERT_TRUE(db.Execute(\"CREATE TABLE db_version (version)\"));\n {\n const char* query = \"INSERT INTO db_version VALUES(?)\";\n sql::Statement s(db.GetUniqueStatement(query));\n if (!s)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n s.BindInt(0, 10);\n if (!s.Run())\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n }\n\n \/\/ Create shares table.\n ASSERT_TRUE(db.Execute(\n \"CREATE TABLE shares (email, share_name, file_name,\"\n \" PRIMARY KEY(email, share_name) ON CONFLICT REPLACE)\"));\n \/\/ Populate a share.\n {\n const char* query = \"INSERT INTO shares VALUES(?, ?, ?)\";\n sql::Statement s(db.GetUniqueStatement(query));\n if (!s)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n s.BindString(0, \"foo@foo.com\");\n s.BindString(1, \"foo@foo.com\");\n#if defined(OS_WIN)\n s.BindString(2, WideToUTF8(old_style_sync_data_path_.value()));\n#elif defined(OS_POSIX)\n s.BindString(2, old_style_sync_data_path_.value());\n#endif\n if (!s.Run())\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n }\n }\n\n \/\/ Creates and populates the V11 database file within\n \/\/ |destination_directory|.\n void SetUpVersion11Database(const FilePath& destination_directory) {\n v11_user_setting_db_path_ =\n destination_directory.Append(FilePath(kV11UserSettingsDB));\n\n sql::Connection db;\n ASSERT_TRUE(db.Open(v11_user_setting_db_path_));\n\n \/\/ Create settings table.\n ASSERT_TRUE(db.Execute(\n \"CREATE TABLE settings (email, key, value, PRIMARY KEY(email, key)\"\n \" ON CONFLICT REPLACE)\"));\n\n \/\/ Create and populate version table.\n ASSERT_TRUE(db.Execute(\"CREATE TABLE db_version (version)\"));\n {\n const char* query = \"INSERT INTO db_version VALUES(?)\";\n sql::Statement s(db.GetUniqueStatement(query));\n if (!s)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n s.BindInt(0, 11);\n if (!s.Run())\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n }\n\n ASSERT_TRUE(db.Execute(\n \"CREATE TABLE signin_types (signin, signin_type)\"));\n {\n const char* query = \"INSERT INTO signin_types VALUES(?, ?)\";\n sql::Statement s(db.GetUniqueStatement(query));\n if (!s)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n s.BindString(0, \"test\");\n s.BindString(1, \"test\");\n if (!s.Run())\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n }\n }\n\n const std::string& sync_data() const { return sync_data_; }\n const FilePath& v10_user_setting_db_path() const {\n return v10_user_setting_db_path_;\n }\n const FilePath& v11_user_setting_db_path() const {\n return v11_user_setting_db_path_;\n }\n const FilePath& old_style_sync_data_path() const {\n return old_style_sync_data_path_;\n }\n\n private:\n FilePath v10_user_setting_db_path_;\n FilePath old_style_sync_data_path_;\n\n FilePath v11_user_setting_db_path_;\n\n std::string sync_data_;\n};\n\nTEST_F(UserSettingsTest, MigrateFromV10ToV11) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n SetUpVersion10Databases(temp_dir.path());\n {\n \/\/ Create a UserSettings, which should trigger migration code. We do this\n \/\/ inside a scoped block so it closes itself and we can poke around to see\n \/\/ what happened later.\n browser_sync::UserSettings settings;\n settings.Init(v10_user_setting_db_path());\n }\n\n \/\/ Now poke around using sqlite to see if UserSettings migrated properly.\n sql::Connection db;\n ASSERT_TRUE(db.Open(v10_user_setting_db_path()));\n\n \/\/ Note that we don't use ScopedStatement to avoid closing the sqlite handle\n \/\/ before finalizing the statement.\n {\n const char* query = \"SELECT version FROM db_version\";\n sql::Statement version_query(db.GetUniqueStatement(query));\n if (!version_query)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n ASSERT_TRUE(version_query.Step());\n const int version = version_query.ColumnInt(0);\n EXPECT_GE(version, 11);\n }\n\n EXPECT_FALSE(file_util::PathExists(old_style_sync_data_path()));\n\n FilePath new_style_path = temp_dir.path().Append(\n syncable::DirectoryManager::GetSyncDataDatabaseFilename());\n\n std::string contents;\n ASSERT_TRUE(file_util::ReadFileToString(new_style_path, &contents));\n EXPECT_TRUE(sync_data() == contents);\n}\n\nTEST_F(UserSettingsTest, MigrateFromV11ToV12) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n SetUpVersion11Database(temp_dir.path());\n {\n browser_sync::UserSettings settings;\n settings.Init(v11_user_setting_db_path());\n }\n sql::Connection db;\n ASSERT_TRUE(db.Open(v11_user_setting_db_path()));\n\n {\n const char* query = \"SELECT version FROM db_version\";\n sql::Statement version_query(db.GetUniqueStatement(query));\n if (!version_query)\n LOG(FATAL) << query << \"\\n\" << db.GetErrorMessage();\n\n ASSERT_TRUE(version_query.Step());\n const int version = version_query.ColumnInt(0);\n EXPECT_GE(version, 12);\n\n const char* query2 = \"SELECT name FROM sqlite_master \"\n \"WHERE type='table' AND name='signin_types'\";\n sql::Statement table_query(db.GetUniqueStatement(query2));\n if (!table_query)\n LOG(FATAL) << query2 << \"\\n\" << db.GetErrorMessage();\n\n ASSERT_FALSE(table_query.Step());\n }\n}\n\nTEST_F(UserSettingsTest, APEncode) {\n std::string test;\n char i;\n for (i = numeric_limits<char>::min(); i < numeric_limits<char>::max(); ++i)\n test.push_back(i);\n test.push_back(i);\n const std::string encoded = browser_sync::APEncode(test);\n const std::string decoded = browser_sync::APDecode(encoded);\n ASSERT_EQ(test, decoded);\n}\n\nTEST_F(UserSettingsTest, PersistEmptyToken) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n browser_sync::UserSettings settings;\n settings.Init(temp_dir.path().AppendASCII(\"UserSettings.sqlite3\"));\n settings.SetAuthTokenForService(\"username\", \"service\", \"\");\n std::string username;\n std::string token;\n ASSERT_TRUE(settings.GetLastUserAndServiceToken(\"service\", &username,\n &token));\n EXPECT_EQ(\"\", token);\n EXPECT_EQ(\"username\", username);\n}\n\nTEST_F(UserSettingsTest, PersistNonEmptyToken) {\n ScopedTempDir temp_dir;\n ASSERT_TRUE(temp_dir.CreateUniqueTempDir());\n browser_sync::UserSettings settings;\n settings.Init(temp_dir.path().AppendASCII(\"UserSettings.sqlite3\"));\n settings.SetAuthTokenForService(\"username\", \"service\",\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\");\n std::string username;\n std::string token;\n ASSERT_TRUE(settings.GetLastUserAndServiceToken(\"service\", &username,\n &token));\n EXPECT_EQ(\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\"\n \"oonetuhasonteuhasonetuhasonetuhasonetuhasouhasonetuhasonetuhasonetuhah\",\n token);\n EXPECT_EQ(\"username\", username);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"abstractsimulatorbehavior.h\"\n\n#include <QThread>\n\nAbstractSimulatorBehavior::AbstractSimulatorBehavior(QWidget *parent)\n{\n mTimer = new QTimer(this);\n mDotMatrix = new QDotMatrix(parent, 20, 10, Qt::black);\n\n connect(mTimer, SIGNAL(timeout()), this, SLOT(loop()));\n\n FastLED.dotMatrix = mDotMatrix;\n}\n\nAbstractSimulatorBehavior::~AbstractSimulatorBehavior()\n{\n delete mDotMatrix;\n}\n\nvoid AbstractSimulatorBehavior::startLoop()\n{\n \/\/ TODO: Check Arduino main loop ~10ms?\n mTimer->start(10);\n}\n\nQDotMatrix* AbstractSimulatorBehavior::getDotMatrix()\n{\n return this->mDotMatrix;\n}\n\nint AbstractSimulatorBehavior::random(int high)\n{\n int low = 0;\n return qrand() % (high - low) + low;\n}\n\nvoid AbstractSimulatorBehavior::randomSeed(int seed)\n{\n \/\/TODO: use the seed!\n}\n\nvoid AbstractSimulatorBehavior::delay(int milliseconds)\n{\n QThread::msleep(milliseconds);\n}\n\nvoid AbstractSimulatorBehavior::readInputs()\n{\n delay(5 * 10);\n}\n\nvoid AbstractSimulatorBehavior::setCorrectColor(int x, int y, CRGB currentColor)\n{\n \/\/(*leds)[(*ledMatrix)[x][y]] = correctColor(x, color);\n mDotMatrix->setColor(x, y, currentColor);\n}\n\nvoid AbstractSimulatorBehavior::paintAll(CRGB color, boolean forceRefresh)\n{\n\n for(int i=0; i < X_MAX; i++){\n for(int j=0; j < Y_MAX; j++){\n\n \/\/(*leds)[(*ledMatrix)[i][j]] = correctColor(i, color);\n setCorrectColor(i, j, color);\n }\n }\n\n if (forceRefresh){\n FastLED.show();\n }\n}\n\nvoid AbstractSimulatorBehavior::setBrightness(int intensity)\n{\n mDotMatrix->setIntensity(intensity);\n}\n<commit_msg>Fix Qt4 compilation<commit_after>#include \"abstractsimulatorbehavior.h\"\n\n#include <QThread>\n\n\/\/ QThread::msleep is only public on Qt5...\n\/\/ Ugly tricks to process a sleep on Qt4\nclass SleepThread : public QThread {\npublic:\n static inline void msleep(unsigned long msecs) {\n QThread::msleep(msecs);\n }\n};\n\nAbstractSimulatorBehavior::AbstractSimulatorBehavior(QWidget *parent)\n{\n mTimer = new QTimer(this);\n mDotMatrix = new QDotMatrix(parent, 20, 10, Qt::black);\n\n connect(mTimer, SIGNAL(timeout()), this, SLOT(loop()));\n\n FastLED.dotMatrix = mDotMatrix;\n}\n\nAbstractSimulatorBehavior::~AbstractSimulatorBehavior()\n{\n delete mDotMatrix;\n}\n\nvoid AbstractSimulatorBehavior::startLoop()\n{\n \/\/ TODO: Check Arduino main loop ~10ms?\n mTimer->start(10);\n}\n\nQDotMatrix* AbstractSimulatorBehavior::getDotMatrix()\n{\n return this->mDotMatrix;\n}\n\nint AbstractSimulatorBehavior::random(int high)\n{\n int low = 0;\n return qrand() % (high - low) + low;\n}\n\nvoid AbstractSimulatorBehavior::randomSeed(int seed)\n{\n \/\/TODO: use the seed!\n}\n\nvoid AbstractSimulatorBehavior::delay(int milliseconds)\n{\n SleepThread::msleep(milliseconds);\n}\n\nvoid AbstractSimulatorBehavior::readInputs()\n{\n delay(5 * 10);\n}\n\nvoid AbstractSimulatorBehavior::setCorrectColor(int x, int y, CRGB currentColor)\n{\n \/\/(*leds)[(*ledMatrix)[x][y]] = correctColor(x, color);\n mDotMatrix->setColor(x, y, currentColor);\n}\n\nvoid AbstractSimulatorBehavior::paintAll(CRGB color, boolean forceRefresh)\n{\n\n for(int i=0; i < X_MAX; i++){\n for(int j=0; j < Y_MAX; j++){\n\n \/\/(*leds)[(*ledMatrix)[i][j]] = correctColor(i, color);\n setCorrectColor(i, j, color);\n }\n }\n\n if (forceRefresh){\n FastLED.show();\n }\n}\n\nvoid AbstractSimulatorBehavior::setBrightness(int intensity)\n{\n mDotMatrix->setIntensity(intensity);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkArrayMap.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkArrayMap.h\"\n\n#include \"vtkAbstractArray.h\"\n#include \"vtkCellData.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkDataSet.h\"\n#include \"vtkDataSetAttributes.h\"\n#include \"vtkGraph.h\"\n#include \"vtkIdList.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkVariant.h\"\n#include <ctype.h>\n\n#include <vtkstd\/map>\n#include <vtkstd\/utility>\n\nvtkCxxRevisionMacro(vtkArrayMap, \"1.5\");\nvtkStandardNewMacro(vtkArrayMap);\n\ntypedef vtkstd::map< vtkVariant, vtkVariant, vtkVariantLessThan > MapBase;\nclass vtkMapType : public MapBase {};\n\nvtkArrayMap::vtkArrayMap()\n{\n this->InputArrayName = 0;\n this->OutputArrayName = 0;\n this->SetOutputArrayName(\"ArrayMap\");\n this->FieldType = vtkArrayMap::POINT_DATA;\n this->OutputArrayType = VTK_INT;\n this->PassArray = 0;\n this->FillValue = -1;\n\n this->Map = new vtkMapType;\n}\n\nvtkArrayMap::~vtkArrayMap()\n{\n delete this->Map;\n}\n\nvoid vtkArrayMap::AddToMap(char *from, int to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(int from, int to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(int from, char *to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(char *from, char *to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(vtkVariant from, vtkVariant to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::ClearMap()\n{\n this->Map->clear();\n\n this->Modified();\n}\n\nint vtkArrayMap::GetMapSize()\n{\n return static_cast<int>(this->Map->size());\n}\n\nint vtkArrayMap::RequestData(\n vtkInformation *vtkNotUsed(request),\n vtkInformationVector **inputVector,\n vtkInformationVector *outputVector)\n{\n \/\/ get the info objects\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n\n \/\/ get the input and ouptut\n vtkDataObject *input = inInfo->Get(vtkDataObject::DATA_OBJECT());\n vtkDataObject *output = outInfo->Get(vtkDataObject::DATA_OBJECT());\n \n if(!this->InputArrayName)\n {\n vtkErrorMacro(<<\"Input array not specified.\");\n return 0;\n }\n\n vtkDataSetAttributes* ods=0;\n if (vtkDataSet::SafeDownCast(input))\n {\n vtkDataSet *dsInput = vtkDataSet::SafeDownCast(input);\n vtkDataSet *dsOutput = vtkDataSet::SafeDownCast(output);\n \/\/ This has to be here because it initialized all field datas.\n dsOutput->CopyStructure( dsInput );\n\n if ( dsOutput->GetFieldData() && dsInput->GetFieldData() )\n {\n dsOutput->GetFieldData()->PassData( dsInput->GetFieldData() );\n }\n dsOutput->GetPointData()->PassData( dsInput->GetPointData() );\n dsOutput->GetCellData()->PassData( dsInput->GetCellData() );\n switch (this->FieldType)\n {\n case vtkArrayMap::POINT_DATA:\n ods = dsOutput->GetPointData();\n break;\n case vtkArrayMap::CELL_DATA:\n ods = dsOutput->GetCellData();\n break;\n default:\n vtkErrorMacro(<<\"Data must be point or cell for vtkDataSet\");\n return 0;\n }\n }\n else\n {\n vtkGraph *graphInput = vtkGraph::SafeDownCast(input);\n vtkGraph *graphOutput = vtkGraph::SafeDownCast(output);\n graphOutput->ShallowCopy( graphInput );\n switch (this->FieldType)\n {\n case vtkArrayMap::VERTEX_DATA:\n ods = graphOutput->GetVertexData();\n break;\n case vtkArrayMap::EDGE_DATA:\n ods = graphOutput->GetEdgeData();\n break;\n default:\n vtkErrorMacro(<<\"Data must be vertex or edge for vtkGraph\");\n return 0;\n }\n }\n\n vtkAbstractArray *inputArray = ods->GetAbstractArray(this->InputArrayName);\n vtkAbstractArray *outputArray = \n vtkAbstractArray::CreateArray(this->OutputArrayType);\n vtkDataArray *outputDataArray = vtkDataArray::SafeDownCast(outputArray);\n vtkStringArray *outputStringArray = \n vtkStringArray::SafeDownCast(outputArray);\n outputArray->SetName(this->OutputArrayName);\n\n \/\/ Are we copying the input array values to the output array before \n \/\/ the mapping?\n if(this->PassArray)\n {\n \/\/ Make sure the DeepCopy will succeed\n if((inputArray->IsA(\"vtkDataArray\") && outputArray->IsA(\"vtkDataArray\") ||\n (inputArray->IsA(\"vtkStringArray\") && outputArray->IsA(\"vtkStringArray\"))))\n {\n outputArray->DeepCopy(inputArray);\n }\n else\n {\n vtkErrorMacro(<<\"When PassArray is turned on, input and output array \"\n <<\"types must be compatible.\");\n return 0;\n }\n }\n else\n {\n outputArray->SetNumberOfTuples(inputArray->GetNumberOfTuples());\n outputArray->SetNumberOfComponents(inputArray->GetNumberOfComponents());\n\n \/\/ Fill the output array with a default value\n if(outputDataArray)\n {\n outputDataArray->FillComponent(0, this->FillValue);\n }\n }\n\n \/\/ Use the internal map to set the mapped values in the output array\n vtkIdList* results = vtkIdList::New();\n for(MapBase::iterator i = this->Map->begin(); i != this->Map->end(); ++i)\n {\n inputArray->LookupValue(i->first, results);\n for(vtkIdType j=0; j<results->GetNumberOfIds(); ++j)\n {\n if(outputDataArray)\n {\n outputDataArray->SetComponent(results->GetId(j), 0, i->second.ToDouble());\n }\n else if(outputStringArray)\n {\n outputStringArray->SetValue(results->GetId(j), i->second.ToString());\n }\n }\n }\n\n \/\/ Finally, add the array to the appropriate vtkDataSetAttributes\n ods->AddArray(outputArray);\n\n results->Delete();\n outputArray->Delete();\n\n return 1;\n}\n\nint vtkArrayMap::FillInputPortInformation(int vtkNotUsed(port), vtkInformation* info)\n{\n \/\/ This algorithm may accept a vtkPointSet or vtkGraph.\n info->Remove(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE());\n info->Append(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkDataSet\");\n info->Append(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkGraph\");\n return 1; \n}\n\nvoid vtkArrayMap::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"Input array name: \";\n if (this->InputArrayName)\n {\n os << this->InputArrayName << endl;\n }\n else\n {\n os << \"(none)\" << endl;\n }\n\n os << indent << \"Output array name: \";\n if (this->OutputArrayName)\n {\n os << this->OutputArrayName << endl;\n }\n else\n {\n os << \"(none)\" << endl;\n }\n os << indent << \"Field type: \" << this->FieldType << endl;\n os << indent << \"Output array type: \" << this->OutputArrayType << endl;\n os << indent << \"PassArray: \" << this->PassArray << endl;\n os << indent << \"FillValue: \" << this->FillValue << endl;\n}\n<commit_msg>ENH: Merge changes from main tree into VTK-5-2 branch. (cvs -q up -j1.6 -j1.7 Infovis\/vtkArrayMap.cxx)<commit_after>\/*=========================================================================\n\n Program: Visualization Toolkit\n Module: vtkArrayMap.cxx\n\n Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen\n All rights reserved.\n See Copyright.txt or http:\/\/www.kitware.com\/Copyright.htm for details.\n\n This software is distributed WITHOUT ANY WARRANTY; without even\n the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR\n PURPOSE. See the above copyright notice for more information.\n\n=========================================================================*\/\n#include \"vtkArrayMap.h\"\n\n#include \"vtkAbstractArray.h\"\n#include \"vtkCellData.h\"\n#include \"vtkDataArray.h\"\n#include \"vtkDataSet.h\"\n#include \"vtkDataSetAttributes.h\"\n#include \"vtkGraph.h\"\n#include \"vtkIdList.h\"\n#include \"vtkInformation.h\"\n#include \"vtkInformationVector.h\"\n#include \"vtkIntArray.h\"\n#include \"vtkObjectFactory.h\"\n#include \"vtkPointData.h\"\n#include \"vtkStringArray.h\"\n#include \"vtkVariant.h\"\n#include <ctype.h>\n\n#include <vtkstd\/map>\n#include <vtkstd\/utility>\n\nvtkCxxRevisionMacro(vtkArrayMap, \"1.5.2.1\");\nvtkStandardNewMacro(vtkArrayMap);\n\ntypedef vtkstd::map< vtkVariant, vtkVariant, vtkVariantLessThan > MapBase;\nclass vtkMapType : public MapBase {};\n\nvtkArrayMap::vtkArrayMap()\n{\n this->InputArrayName = 0;\n this->OutputArrayName = 0;\n this->SetOutputArrayName(\"ArrayMap\");\n this->FieldType = vtkArrayMap::POINT_DATA;\n this->OutputArrayType = VTK_INT;\n this->PassArray = 0;\n this->FillValue = -1;\n\n this->Map = new vtkMapType;\n}\n\nvtkArrayMap::~vtkArrayMap()\n{\n this->SetInputArrayName(0);\n this->SetOutputArrayName(0);\n delete this->Map;\n}\n\nvoid vtkArrayMap::AddToMap(char *from, int to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(int from, int to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(int from, char *to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(char *from, char *to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::AddToMap(vtkVariant from, vtkVariant to)\n{\n this->Map->insert(vtkstd::make_pair< vtkVariant, vtkVariant >(from, to));\n\n this->Modified();\n}\n\nvoid vtkArrayMap::ClearMap()\n{\n this->Map->clear();\n\n this->Modified();\n}\n\nint vtkArrayMap::GetMapSize()\n{\n return static_cast<int>(this->Map->size());\n}\n\nint vtkArrayMap::RequestData(\n vtkInformation *vtkNotUsed(request),\n vtkInformationVector **inputVector,\n vtkInformationVector *outputVector)\n{\n \/\/ get the info objects\n vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);\n vtkInformation *outInfo = outputVector->GetInformationObject(0);\n\n \/\/ get the input and ouptut\n vtkDataObject *input = inInfo->Get(vtkDataObject::DATA_OBJECT());\n vtkDataObject *output = outInfo->Get(vtkDataObject::DATA_OBJECT());\n \n if(!this->InputArrayName)\n {\n vtkErrorMacro(<<\"Input array not specified.\");\n return 0;\n }\n\n vtkDataSetAttributes* ods=0;\n if (vtkDataSet::SafeDownCast(input))\n {\n vtkDataSet *dsInput = vtkDataSet::SafeDownCast(input);\n vtkDataSet *dsOutput = vtkDataSet::SafeDownCast(output);\n \/\/ This has to be here because it initialized all field datas.\n dsOutput->CopyStructure( dsInput );\n\n if ( dsOutput->GetFieldData() && dsInput->GetFieldData() )\n {\n dsOutput->GetFieldData()->PassData( dsInput->GetFieldData() );\n }\n dsOutput->GetPointData()->PassData( dsInput->GetPointData() );\n dsOutput->GetCellData()->PassData( dsInput->GetCellData() );\n switch (this->FieldType)\n {\n case vtkArrayMap::POINT_DATA:\n ods = dsOutput->GetPointData();\n break;\n case vtkArrayMap::CELL_DATA:\n ods = dsOutput->GetCellData();\n break;\n default:\n vtkErrorMacro(<<\"Data must be point or cell for vtkDataSet\");\n return 0;\n }\n }\n else\n {\n vtkGraph *graphInput = vtkGraph::SafeDownCast(input);\n vtkGraph *graphOutput = vtkGraph::SafeDownCast(output);\n graphOutput->ShallowCopy( graphInput );\n switch (this->FieldType)\n {\n case vtkArrayMap::VERTEX_DATA:\n ods = graphOutput->GetVertexData();\n break;\n case vtkArrayMap::EDGE_DATA:\n ods = graphOutput->GetEdgeData();\n break;\n default:\n vtkErrorMacro(<<\"Data must be vertex or edge for vtkGraph\");\n return 0;\n }\n }\n\n vtkAbstractArray *inputArray = ods->GetAbstractArray(this->InputArrayName);\n vtkAbstractArray *outputArray = \n vtkAbstractArray::CreateArray(this->OutputArrayType);\n vtkDataArray *outputDataArray = vtkDataArray::SafeDownCast(outputArray);\n vtkStringArray *outputStringArray = \n vtkStringArray::SafeDownCast(outputArray);\n outputArray->SetName(this->OutputArrayName);\n\n \/\/ Are we copying the input array values to the output array before \n \/\/ the mapping?\n if(this->PassArray)\n {\n \/\/ Make sure the DeepCopy will succeed\n if((inputArray->IsA(\"vtkDataArray\") && outputArray->IsA(\"vtkDataArray\"))\n || (inputArray->IsA(\"vtkStringArray\")\n && outputArray->IsA(\"vtkStringArray\")))\n {\n outputArray->DeepCopy(inputArray);\n }\n else\n {\n vtkErrorMacro(<<\"When PassArray is turned on, input and output array \"\n <<\"types must be compatible.\");\n return 0;\n }\n }\n else\n {\n outputArray->SetNumberOfTuples(inputArray->GetNumberOfTuples());\n outputArray->SetNumberOfComponents(inputArray->GetNumberOfComponents());\n\n \/\/ Fill the output array with a default value\n if(outputDataArray)\n {\n outputDataArray->FillComponent(0, this->FillValue);\n }\n }\n\n \/\/ Use the internal map to set the mapped values in the output array\n vtkIdList* results = vtkIdList::New();\n for(MapBase::iterator i = this->Map->begin(); i != this->Map->end(); ++i)\n {\n inputArray->LookupValue(i->first, results);\n for(vtkIdType j=0; j<results->GetNumberOfIds(); ++j)\n {\n if(outputDataArray)\n {\n outputDataArray->SetComponent(results->GetId(j), 0, i->second.ToDouble());\n }\n else if(outputStringArray)\n {\n outputStringArray->SetValue(results->GetId(j), i->second.ToString());\n }\n }\n }\n\n \/\/ Finally, add the array to the appropriate vtkDataSetAttributes\n ods->AddArray(outputArray);\n\n results->Delete();\n outputArray->Delete();\n\n return 1;\n}\n\nint vtkArrayMap::FillInputPortInformation(int vtkNotUsed(port), vtkInformation* info)\n{\n \/\/ This algorithm may accept a vtkPointSet or vtkGraph.\n info->Remove(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE());\n info->Append(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkDataSet\");\n info->Append(vtkAlgorithm::INPUT_REQUIRED_DATA_TYPE(), \"vtkGraph\");\n return 1; \n}\n\nvoid vtkArrayMap::PrintSelf(ostream& os, vtkIndent indent)\n{\n this->Superclass::PrintSelf(os,indent);\n os << indent << \"Input array name: \";\n if (this->InputArrayName)\n {\n os << this->InputArrayName << endl;\n }\n else\n {\n os << \"(none)\" << endl;\n }\n\n os << indent << \"Output array name: \";\n if (this->OutputArrayName)\n {\n os << this->OutputArrayName << endl;\n }\n else\n {\n os << \"(none)\" << endl;\n }\n os << indent << \"Field type: \" << this->FieldType << endl;\n os << indent << \"Output array type: \" << this->OutputArrayType << endl;\n os << indent << \"PassArray: \" << this->PassArray << endl;\n os << indent << \"FillValue: \" << this->FillValue << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * DryRunFlagTest.cpp\n *\n *\/\n\n#include \"AlwaysFailsLayer.hpp\"\n#include <columns\/buildandrun.hpp>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <utils\/PVAssert.hpp>\n\nint deleteOutputDirectory(PV::Communicator *comm);\nvoid compareParamsFiles(char const *paramsFile1, char const *paramsFile2, PV::Communicator *comm);\nvoid compareParameterGroups(PV::ParameterGroup *group1, PV::ParameterGroup *group2);\nvoid compareParameterNumericStacks(\n char const *groupName,\n PV::ParameterStack *stack1,\n PV::ParameterStack *stack2);\nvoid compareParameterNumeric(\n char const *groupName,\n PV::Parameter *parameter1,\n PV::Parameter *parameter2);\nvoid compareParameterArrayStacks(\n char const *groupName,\n PV::ParameterArrayStack *stack1,\n PV::ParameterArrayStack *stack2);\nvoid compareParameterArray(\n char const *groupName,\n PV::ParameterArray *array1,\n PV::ParameterArray *array2);\nvoid compareParameterStringStacks(\n char const *groupName,\n PV::ParameterStringStack *stack1,\n PV::ParameterStringStack *stack2);\nvoid compareParameterString(\n char const *groupName,\n PV::ParameterString *string1,\n PV::ParameterString *string2);\n\nint main(int argc, char *argv[]) {\n\n int status = PV_SUCCESS;\n\n PV::PV_Init pv_obj(&argc, &argv, false \/*allowUnrecognizedArguments*\/);\n pv_obj.registerKeyword(\"AlwaysFailsLayer\", Factory::create<AlwaysFailsLayer>);\n\n pv_obj.setDryRunFlag(true);\n\n if (pv_obj.isExtraProc()) {\n return EXIT_SUCCESS;\n }\n\n pvErrorIf(\n pv_obj.getParamsFile() != nullptr,\n \"%s should be called without the -p argument; the necessary params file is hard-coded.\\n\");\n pv_obj.setParams(\"input\/DryRunFlagTest.params\");\n\n int rank = pv_obj.getCommunicator()->globalCommRank();\n\n status = deleteOutputDirectory(pv_obj.getCommunicator());\n if (status != PV_SUCCESS) {\n pvError().printf(\"%s: error cleaning generated files from any previous run.\\n\", argv[0]);\n }\n\n status = buildandrun(&pv_obj);\n\n if (status != PV_SUCCESS) {\n pvError().printf(\"%s: running with dry-run flag set failed on process %d.\\n\", argv[0], rank);\n }\n\n compareParamsFiles(\"output\/pv.params\", \"input\/correct.params\", pv_obj.getCommunicator());\n}\n\nint deleteOutputDirectory(PV::Communicator *comm) {\n int status = PV_SUCCESS;\n if (comm->globalCommRank() == 0) {\n if (system(\"rm -rf output\") != PV_SUCCESS) {\n status = PV_FAILURE;\n }\n }\n MPI_Bcast(&status, 1, MPI_INT, 0, comm->communicator());\n return status;\n}\n\nvoid compareParamsFiles(char const *paramsFile1, char const *paramsFile2, PV::Communicator *comm) {\n PV::PVParams params1{paramsFile1, INITIAL_LAYER_ARRAY_SIZE, comm};\n PV::PVParams params2{paramsFile2, INITIAL_LAYER_ARRAY_SIZE, comm};\n\n \/\/ create a map between groups in paramsFile1 and those in paramsFile2.\n std::map<PV::ParameterGroup *, PV::ParameterGroup *> parameterGroupMap;\n char const *groupName = nullptr;\n for (int idx = 0; groupName = params1.groupNameFromIndex(idx); idx++) {\n PV::ParameterGroup *g1 = params1.group(groupName);\n PV::ParameterGroup *g2 = params2.group(groupName);\n pvErrorIf(\n g2 == nullptr,\n \"Group name \\\"%s\\\" is in \\\"%s\\\" but not in \\\"%s\\\".\\n\",\n groupName,\n paramsFile1,\n paramsFile2);\n parameterGroupMap.emplace(std::make_pair(g1, g2));\n }\n for (int idx = 0; groupName = params2.groupNameFromIndex(idx); idx++) {\n pvErrorIf(\n params1.group(groupName) == nullptr,\n \"Group name \\\"%s\\\" is in \\\"%s\\\" but not in \\\"%s\\\".\\n\",\n groupName,\n paramsFile2,\n paramsFile1);\n }\n\n for (auto &p : parameterGroupMap) {\n compareParameterGroups(p.first, p.second);\n }\n return;\n}\n\nvoid compareParameterGroups(PV::ParameterGroup *group1, PV::ParameterGroup *group2) {\n pvAssert(!strcmp(group1->name(), group2->name()));\n pvErrorIf(\n strcmp(group1->getGroupKeyword(), group2->getGroupKeyword()),\n \"Keywords for group \\\"%s\\\" do not match (\\\"%s\\\" versus \\\"%s\\\").\\n\",\n group1->name(),\n group1->getGroupKeyword(),\n group2->getGroupKeyword());\n PV::ParameterStack *numericStack1 = group1->copyStack();\n PV::ParameterStack *numericStack2 = group2->copyStack();\n compareParameterNumericStacks(group1->name(), numericStack1, numericStack2);\n\n PV::ParameterArrayStack *arrayStack1 = group1->copyArrayStack();\n PV::ParameterArrayStack *arrayStack2 = group2->copyArrayStack();\n compareParameterArrayStacks(group1->name(), arrayStack1, arrayStack2);\n\n PV::ParameterStringStack *stringStack1 = group1->copyStringStack();\n PV::ParameterStringStack *stringStack2 = group2->copyStringStack();\n compareParameterStringStacks(group1->name(), stringStack1, stringStack2);\n}\n\nvoid compareParameterNumericStacks(\n char const *groupName,\n PV::ParameterStack *stack1,\n PV::ParameterStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::Parameter *, PV::Parameter *> parameterMap;\n for (int i = 0; i < size; i++) {\n PV::Parameter *param1 = stack1->peek(i);\n char const *paramName1 = param1->name();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::Parameter *param2 = stack2->peek(j);\n char const *paramName2 = param2->name();\n if (!strcmp(paramName1, paramName2)) {\n parameterMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterMap.size() == size);\n\n for (auto &p : parameterMap) {\n compareParameterNumeric(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterNumeric(\n char const *groupName,\n PV::Parameter *parameter1,\n PV::Parameter *parameter2) {\n pvAssert(!strcmp(parameter1->name(), parameter2->name()));\n pvErrorIf(\n parameter1->value() != parameter2->value(),\n \"Numeric parameter \\\"%s\\\" in group \\\"%s\\\" differs (%f versus %f).\\n\",\n parameter1->name(),\n groupName,\n parameter1->value(),\n parameter2->value());\n}\n\nvoid compareParameterArrayStacks(\n char const *groupName,\n PV::ParameterArrayStack *stack1,\n PV::ParameterArrayStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::ParameterArray *, PV::ParameterArray *> parameterArrayMap;\n for (int i = 0; i < size; i++) {\n PV::ParameterArray *param1 = stack1->peek(i);\n char const *paramName1 = param1->name();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::ParameterArray *param2 = stack2->peek(j);\n char const *paramName2 = param2->name();\n if (!strcmp(paramName1, paramName2)) {\n parameterArrayMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterArrayMap.size() == size);\n\n for (auto &p : parameterArrayMap) {\n compareParameterArray(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterArray(\n char const *groupName,\n PV::ParameterArray *array1,\n PV::ParameterArray *array2) {\n pvAssert(!strcmp(array1->name(), array2->name()));\n pvErrorIf(\n array1->getArraySize() != array2->getArraySize(),\n \"Array \\\"%s\\\" in group \\\"%s\\\" differs in size (%d versus %d).\\n\",\n array1->name(),\n groupName,\n array1->getArraySize(),\n array2->getArraySize());\n int size = array1->getArraySize();\n double const *values1 = array1->getValuesDbl(&size);\n double const *values2 = array2->getValuesDbl(&size);\n int badIndex = 0;\n for (int i = 0; i < size; i++) {\n if (values1[i] != values2[i]) {\n badIndex = i + 1;\n pvErrorNoExit() << \"Group \" << groupName << \", array \" << array1->name() << \", index \"\n << badIndex << \" differs (\" << values1[i] << \" versus \" << values2[i]\n << \").\\n\";\n }\n }\n if (badIndex > 0) {\n exit(EXIT_FAILURE);\n }\n}\n\nvoid compareParameterStringStacks(\n char const *groupName,\n PV::ParameterStringStack *stack1,\n PV::ParameterStringStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::ParameterString *, PV::ParameterString *> parameterStringMap;\n for (int i = 0; i < size; i++) {\n PV::ParameterString *param1 = stack1->peek(i);\n char const *paramName1 = param1->getName();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::ParameterString *param2 = stack2->peek(j);\n char const *paramName2 = param2->getName();\n if (!strcmp(paramName1, paramName2)) {\n parameterStringMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterStringMap.size() == size);\n\n for (auto &p : parameterStringMap) {\n compareParameterString(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterString(\n char const *groupName,\n PV::ParameterString *string1,\n PV::ParameterString *string2) {\n pvAssert(!strcmp(string1->getName(), string2->getName()));\n char const *nullString = \"(null)\";\n char const *value1 = string1->getValue();\n if (value1 == nullptr) {\n value1 = nullString;\n }\n char const *value2 = string2->getValue();\n if (value2 == nullptr) {\n value2 = nullString;\n }\n pvErrorIf(\n strcmp(value1, value2),\n \"String parameter \\\"%s\\\" in group \\\"%s\\\" differs (\\\"%s\\\" versus \\\"%s\\\").\\n\",\n string1->getName(),\n groupName,\n value1,\n value2);\n}\n<commit_msg>Addresses clang warnings in DryRunFlagTest<commit_after>\/*\n * DryRunFlagTest.cpp\n *\n *\/\n\n#include \"AlwaysFailsLayer.hpp\"\n#include <columns\/buildandrun.hpp>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <utils\/PVAssert.hpp>\n\nint deleteOutputDirectory(PV::Communicator *comm);\nvoid compareParamsFiles(char const *paramsFile1, char const *paramsFile2, PV::Communicator *comm);\nvoid compareParameterGroups(PV::ParameterGroup *group1, PV::ParameterGroup *group2);\nvoid compareParameterNumericStacks(\n char const *groupName,\n PV::ParameterStack *stack1,\n PV::ParameterStack *stack2);\nvoid compareParameterNumeric(\n char const *groupName,\n PV::Parameter *parameter1,\n PV::Parameter *parameter2);\nvoid compareParameterArrayStacks(\n char const *groupName,\n PV::ParameterArrayStack *stack1,\n PV::ParameterArrayStack *stack2);\nvoid compareParameterArray(\n char const *groupName,\n PV::ParameterArray *array1,\n PV::ParameterArray *array2);\nvoid compareParameterStringStacks(\n char const *groupName,\n PV::ParameterStringStack *stack1,\n PV::ParameterStringStack *stack2);\nvoid compareParameterString(\n char const *groupName,\n PV::ParameterString *string1,\n PV::ParameterString *string2);\n\nint main(int argc, char *argv[]) {\n\n int status = PV_SUCCESS;\n\n PV::PV_Init pv_obj(&argc, &argv, false \/*allowUnrecognizedArguments*\/);\n pv_obj.registerKeyword(\"AlwaysFailsLayer\", Factory::create<AlwaysFailsLayer>);\n\n pv_obj.setDryRunFlag(true);\n\n if (pv_obj.isExtraProc()) {\n return EXIT_SUCCESS;\n }\n\n pvErrorIf(\n pv_obj.getParamsFile() != nullptr,\n \"%s should be called without the -p argument; the necessary params file is hard-coded.\\n\");\n pv_obj.setParams(\"input\/DryRunFlagTest.params\");\n\n int rank = pv_obj.getCommunicator()->globalCommRank();\n\n status = deleteOutputDirectory(pv_obj.getCommunicator());\n if (status != PV_SUCCESS) {\n pvError().printf(\"%s: error cleaning generated files from any previous run.\\n\", argv[0]);\n }\n\n status = buildandrun(&pv_obj);\n\n if (status != PV_SUCCESS) {\n pvError().printf(\"%s: running with dry-run flag set failed on process %d.\\n\", argv[0], rank);\n }\n\n compareParamsFiles(\"output\/pv.params\", \"input\/correct.params\", pv_obj.getCommunicator());\n}\n\nint deleteOutputDirectory(PV::Communicator *comm) {\n int status = PV_SUCCESS;\n if (comm->globalCommRank() == 0) {\n if (system(\"rm -rf output\") != PV_SUCCESS) {\n status = PV_FAILURE;\n }\n }\n MPI_Bcast(&status, 1, MPI_INT, 0, comm->communicator());\n return status;\n}\n\nvoid compareParamsFiles(char const *paramsFile1, char const *paramsFile2, PV::Communicator *comm) {\n PV::PVParams params1{paramsFile1, INITIAL_LAYER_ARRAY_SIZE, comm};\n PV::PVParams params2{paramsFile2, INITIAL_LAYER_ARRAY_SIZE, comm};\n\n \/\/ create a map between groups in paramsFile1 and those in paramsFile2.\n std::map<PV::ParameterGroup *, PV::ParameterGroup *> parameterGroupMap;\n char const *groupName = nullptr;\n for (int idx = 0; (groupName = params1.groupNameFromIndex(idx))!=nullptr; idx++) {\n PV::ParameterGroup *g1 = params1.group(groupName);\n PV::ParameterGroup *g2 = params2.group(groupName);\n pvErrorIf(\n g2 == nullptr,\n \"Group name \\\"%s\\\" is in \\\"%s\\\" but not in \\\"%s\\\".\\n\",\n groupName,\n paramsFile1,\n paramsFile2);\n parameterGroupMap.emplace(std::make_pair(g1, g2));\n }\n for (int idx = 0; (groupName = params2.groupNameFromIndex(idx))!=nullptr; idx++) {\n pvErrorIf(\n params1.group(groupName) == nullptr,\n \"Group name \\\"%s\\\" is in \\\"%s\\\" but not in \\\"%s\\\".\\n\",\n groupName,\n paramsFile2,\n paramsFile1);\n }\n\n for (auto &p : parameterGroupMap) {\n compareParameterGroups(p.first, p.second);\n }\n return;\n}\n\nvoid compareParameterGroups(PV::ParameterGroup *group1, PV::ParameterGroup *group2) {\n pvAssert(!strcmp(group1->name(), group2->name()));\n pvErrorIf(\n strcmp(group1->getGroupKeyword(), group2->getGroupKeyword()),\n \"Keywords for group \\\"%s\\\" do not match (\\\"%s\\\" versus \\\"%s\\\").\\n\",\n group1->name(),\n group1->getGroupKeyword(),\n group2->getGroupKeyword());\n PV::ParameterStack *numericStack1 = group1->copyStack();\n PV::ParameterStack *numericStack2 = group2->copyStack();\n compareParameterNumericStacks(group1->name(), numericStack1, numericStack2);\n\n PV::ParameterArrayStack *arrayStack1 = group1->copyArrayStack();\n PV::ParameterArrayStack *arrayStack2 = group2->copyArrayStack();\n compareParameterArrayStacks(group1->name(), arrayStack1, arrayStack2);\n\n PV::ParameterStringStack *stringStack1 = group1->copyStringStack();\n PV::ParameterStringStack *stringStack2 = group2->copyStringStack();\n compareParameterStringStacks(group1->name(), stringStack1, stringStack2);\n}\n\nvoid compareParameterNumericStacks(\n char const *groupName,\n PV::ParameterStack *stack1,\n PV::ParameterStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::Parameter *, PV::Parameter *> parameterMap;\n for (int i = 0; i < size; i++) {\n PV::Parameter *param1 = stack1->peek(i);\n char const *paramName1 = param1->name();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::Parameter *param2 = stack2->peek(j);\n char const *paramName2 = param2->name();\n if (!strcmp(paramName1, paramName2)) {\n parameterMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterMap.size() == size);\n\n for (auto &p : parameterMap) {\n compareParameterNumeric(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterNumeric(\n char const *groupName,\n PV::Parameter *parameter1,\n PV::Parameter *parameter2) {\n pvAssert(!strcmp(parameter1->name(), parameter2->name()));\n pvErrorIf(\n parameter1->value() != parameter2->value(),\n \"Numeric parameter \\\"%s\\\" in group \\\"%s\\\" differs (%f versus %f).\\n\",\n parameter1->name(),\n groupName,\n parameter1->value(),\n parameter2->value());\n}\n\nvoid compareParameterArrayStacks(\n char const *groupName,\n PV::ParameterArrayStack *stack1,\n PV::ParameterArrayStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::ParameterArray *, PV::ParameterArray *> parameterArrayMap;\n for (int i = 0; i < size; i++) {\n PV::ParameterArray *param1 = stack1->peek(i);\n char const *paramName1 = param1->name();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::ParameterArray *param2 = stack2->peek(j);\n char const *paramName2 = param2->name();\n if (!strcmp(paramName1, paramName2)) {\n parameterArrayMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterArrayMap.size() == size);\n\n for (auto &p : parameterArrayMap) {\n compareParameterArray(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterArray(\n char const *groupName,\n PV::ParameterArray *array1,\n PV::ParameterArray *array2) {\n pvAssert(!strcmp(array1->name(), array2->name()));\n pvErrorIf(\n array1->getArraySize() != array2->getArraySize(),\n \"Array \\\"%s\\\" in group \\\"%s\\\" differs in size (%d versus %d).\\n\",\n array1->name(),\n groupName,\n array1->getArraySize(),\n array2->getArraySize());\n int size = array1->getArraySize();\n double const *values1 = array1->getValuesDbl(&size);\n double const *values2 = array2->getValuesDbl(&size);\n int badIndex = 0;\n for (int i = 0; i < size; i++) {\n if (values1[i] != values2[i]) {\n badIndex = i + 1;\n pvErrorNoExit() << \"Group \" << groupName << \", array \" << array1->name() << \", index \"\n << badIndex << \" differs (\" << values1[i] << \" versus \" << values2[i]\n << \").\\n\";\n }\n }\n if (badIndex > 0) {\n exit(EXIT_FAILURE);\n }\n}\n\nvoid compareParameterStringStacks(\n char const *groupName,\n PV::ParameterStringStack *stack1,\n PV::ParameterStringStack *stack2) {\n pvErrorIf(\n stack1->size() != stack2->size(),\n \"Numeric stacks for \\\"%s\\\" have different sizes: %d versus %d.\\n\",\n groupName,\n stack1->size(),\n stack2->size());\n \/\/ create a map between stack1 and stack2\n int const size = stack1->size();\n std::map<PV::ParameterString *, PV::ParameterString *> parameterStringMap;\n for (int i = 0; i < size; i++) {\n PV::ParameterString *param1 = stack1->peek(i);\n char const *paramName1 = param1->getName();\n bool found = false;\n for (int j = 0; j < size; j++) {\n PV::ParameterString *param2 = stack2->peek(j);\n char const *paramName2 = param2->getName();\n if (!strcmp(paramName1, paramName2)) {\n parameterStringMap.emplace(std::make_pair(param1, param2));\n found = true;\n break;\n }\n }\n if (!found) {\n pvError() << \"Parameter \\\"\" << paramName1 << \"\\\" was found in group \\\"\" << groupName\n << \"\\\" of one stack but not the other.\\n\";\n }\n }\n pvAssert(parameterStringMap.size() == size);\n\n for (auto &p : parameterStringMap) {\n compareParameterString(groupName, p.first, p.second);\n }\n}\n\nvoid compareParameterString(\n char const *groupName,\n PV::ParameterString *string1,\n PV::ParameterString *string2) {\n pvAssert(!strcmp(string1->getName(), string2->getName()));\n char const *nullString = \"(null)\";\n char const *value1 = string1->getValue();\n if (value1 == nullptr) {\n value1 = nullString;\n }\n char const *value2 = string2->getValue();\n if (value2 == nullptr) {\n value2 = nullString;\n }\n pvErrorIf(\n strcmp(value1, value2),\n \"String parameter \\\"%s\\\" in group \\\"%s\\\" differs (\\\"%s\\\" versus \\\"%s\\\").\\n\",\n string1->getName(),\n groupName,\n value1,\n value2);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ ========================================================================== \/\/\n\/\/ The MIT License (MIT) \/\/\n\/\/ \/\/\n\/\/ Copyright (c) 2016 Jefferson Amstutz \/\/\n\/\/ \/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a \/\/\n\/\/ copy of this software and associated documentation files (the \"Software\"), \/\/\n\/\/ to deal in the Software without restriction, including without limitation \/\/\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, \/\/\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the \/\/\n\/\/ Software is furnished to do so, subject to the following conditions: \/\/\n\/\/ \/\/\n\/\/ The above copyright notice and this permission notice shall be included in \/\/\n\/\/ in all copies or substantial portions of the Software. \/\/\n\/\/ \/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \/\/\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \/\/\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL \/\/\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \/\/\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \/\/\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \/\/\n\/\/ DEALINGS IN THE SOFTWARE. \/\/\n\/\/ ========================================================================== \/\/\n\n#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN\n#include <tests\/doctest.h>\n#include <CPW\/parallel_for.h>\n\n#include <algorithm>\n#include <vector>\n\nTEST_CASE(\"parallel_for\")\n{\n const size_t N_ELEMENTS = 1000000;\n\n const int bad_value = 0;\n const int good_value = 1;\n\n std::vector<int> v(N_ELEMENTS);\n std::fill(v.begin(), v.end(), bad_value);\n\n CPW::parallel_for(N_ELEMENTS,[&](decltype(N_ELEMENTS) taskIndex) {\n v[taskIndex] = good_value;\n });\n\n auto found = std::find(v.begin(), v.end(), bad_value);\n\n REQUIRE(found == v.end());\n}\n<commit_msg>increase the amount of work in the parallel_for test<commit_after>\/\/ ========================================================================== \/\/\n\/\/ The MIT License (MIT) \/\/\n\/\/ \/\/\n\/\/ Copyright (c) 2016 Jefferson Amstutz \/\/\n\/\/ \/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a \/\/\n\/\/ copy of this software and associated documentation files (the \"Software\"), \/\/\n\/\/ to deal in the Software without restriction, including without limitation \/\/\n\/\/ the rights to use, copy, modify, merge, publish, distribute, sublicense, \/\/\n\/\/ and\/or sell copies of the Software, and to permit persons to whom the \/\/\n\/\/ Software is furnished to do so, subject to the following conditions: \/\/\n\/\/ \/\/\n\/\/ The above copyright notice and this permission notice shall be included in \/\/\n\/\/ in all copies or substantial portions of the Software. \/\/\n\/\/ \/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \/\/\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \/\/\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL \/\/\n\/\/ THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \/\/\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \/\/\n\/\/ FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \/\/\n\/\/ DEALINGS IN THE SOFTWARE. \/\/\n\/\/ ========================================================================== \/\/\n\n#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN\n#include <tests\/doctest.h>\n#include <CPW\/parallel_for.h>\n\n#include <algorithm>\n#include <vector>\n\nTEST_CASE(\"parallel_for\")\n{\n const size_t N_ELEMENTS = 1e8;\n\n const int bad_value = 0;\n const int good_value = 1;\n\n std::vector<int> v(N_ELEMENTS);\n std::fill(v.begin(), v.end(), bad_value);\n\n CPW::parallel_for(N_ELEMENTS,[&](decltype(N_ELEMENTS) taskIndex) {\n v[taskIndex] = good_value;\n });\n\n auto found = std::find(v.begin(), v.end(), bad_value);\n\n REQUIRE(found == v.end());\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include <QSignalSpy>\n#include <QEventLoop>\n#include <QTimer>\n\n#include <private\/qmldebugclient_p.h>\n#include <private\/qmldebugservice_p.h>\n\n#include \"debugutil_p.h\"\n\nbool QmlDebugTest::waitForSignal(QObject *receiver, const char *member, int timeout) {\n QEventLoop loop;\n QTimer timer;\n QObject::connect(&timer, SIGNAL(timeout()), &loop, SLOT(quit()));\n QObject::connect(receiver, member, &loop, SLOT(quit()));\n timer.start(timeout);\n loop.exec();\n return timer.isActive();\n}\n\n\nQmlDebugTestData::QmlDebugTestData(QEventLoop *el)\n : exitCode(-1), loop(el)\n{\n}\n\nQmlDebugTestData::~QmlDebugTestData()\n{\n qDeleteAll(items);\n}\n\nvoid QmlDebugTestData::testsFinished(int code)\n{\n exitCode = code;\n loop->quit();\n}\n\n\n\nQmlDebugTestService::QmlDebugTestService(const QString &s, QObject *parent)\n : QmlDebugService(s, parent), enabled(false)\n{\n}\n\nvoid QmlDebugTestService::messageReceived(const QByteArray &ba)\n{\n sendMessage(ba);\n}\n\nvoid QmlDebugTestService::enabledChanged(bool e)\n{\n enabled = e;\n emit enabledStateChanged();\n}\n\n\nQmlDebugTestClient::QmlDebugTestClient(const QString &s, QmlDebugConnection *c)\n : QmlDebugClient(s, c)\n{\n}\n\nQByteArray QmlDebugTestClient::waitForResponse()\n{\n lastMsg.clear();\n QmlDebugTest::waitForSignal(this, SIGNAL(serverMessage(QByteArray)));\n if (lastMsg.isEmpty()) {\n qWarning() << \"tst_QmlDebugClient: no response from server!\";\n return QByteArray();\n }\n return lastMsg;\n}\n\nvoid QmlDebugTestClient::messageReceived(const QByteArray &ba)\n{\n lastMsg = ba;\n emit serverMessage(ba);\n}\n\n\ntst_QmlDebug_Thread::tst_QmlDebug_Thread(QmlDebugTestData *data, QmlTestFactory *factory)\n : m_ready(false), m_data(data), m_factory(factory)\n{\n}\n\nvoid tst_QmlDebug_Thread::run()\n{\n QTest::qWait(1000);\n\n QmlDebugConnection conn;\n conn.connectToHost(\"127.0.0.1\", 3768);\n bool ok = conn.waitForConnected(5000);\n Q_ASSERT(ok);\n\n while (!m_ready)\n QTest::qWait(100);\n\n m_data->conn = &conn;\n\n Q_ASSERT(m_factory);\n QObject *test = m_factory->createTest(m_data);\n Q_ASSERT(test);\n int code = QTest::qExec(test); \n emit testsFinished(code);\n}\n\n\nint QmlDebugTest::runTests(QmlTestFactory *factory, const QList<QByteArray> &qml)\n{\n qputenv(\"QML_DEBUG_SERVER_PORT\", \"3768\");\n\n QEventLoop loop;\n QmlDebugTestData data(&loop);\n\n tst_QmlDebug_Thread thread(&data, factory);\n QObject::connect(&thread, SIGNAL(testsFinished(int)), &data, SLOT(testsFinished(int)));\n thread.start();\n\n QmlEngine engine; \/\/ blocks until client connects\n\n foreach (const QByteArray &code, qml) {\n QmlComponent c(&engine);\n c.setData(code, QUrl::fromLocalFile(\"\"));\n Q_ASSERT(c.isReady()); \/\/ fails if bad syntax\n data.items << qobject_cast<QmlGraphicsItem*>(c.create());\n }\n\n \/\/ start the test\n data.engine = &engine;\n thread.m_ready = true;\n\n loop.exec();\n\n return data.exitCode;\n}\n\n\n<commit_msg>Must pass app arguments onto qExec() or else test system cannot get test results with -xml mode.<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2009 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the test suite of the Qt Toolkit.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n#include <QSignalSpy>\n#include <QEventLoop>\n#include <QTimer>\n\n#include <private\/qmldebugclient_p.h>\n#include <private\/qmldebugservice_p.h>\n\n#include \"debugutil_p.h\"\n\nbool QmlDebugTest::waitForSignal(QObject *receiver, const char *member, int timeout) {\n QEventLoop loop;\n QTimer timer;\n QObject::connect(&timer, SIGNAL(timeout()), &loop, SLOT(quit()));\n QObject::connect(receiver, member, &loop, SLOT(quit()));\n timer.start(timeout);\n loop.exec();\n return timer.isActive();\n}\n\n\nQmlDebugTestData::QmlDebugTestData(QEventLoop *el)\n : exitCode(-1), loop(el)\n{\n}\n\nQmlDebugTestData::~QmlDebugTestData()\n{\n qDeleteAll(items);\n}\n\nvoid QmlDebugTestData::testsFinished(int code)\n{\n exitCode = code;\n loop->quit();\n}\n\n\n\nQmlDebugTestService::QmlDebugTestService(const QString &s, QObject *parent)\n : QmlDebugService(s, parent), enabled(false)\n{\n}\n\nvoid QmlDebugTestService::messageReceived(const QByteArray &ba)\n{\n sendMessage(ba);\n}\n\nvoid QmlDebugTestService::enabledChanged(bool e)\n{\n enabled = e;\n emit enabledStateChanged();\n}\n\n\nQmlDebugTestClient::QmlDebugTestClient(const QString &s, QmlDebugConnection *c)\n : QmlDebugClient(s, c)\n{\n}\n\nQByteArray QmlDebugTestClient::waitForResponse()\n{\n lastMsg.clear();\n QmlDebugTest::waitForSignal(this, SIGNAL(serverMessage(QByteArray)));\n if (lastMsg.isEmpty()) {\n qWarning() << \"tst_QmlDebugClient: no response from server!\";\n return QByteArray();\n }\n return lastMsg;\n}\n\nvoid QmlDebugTestClient::messageReceived(const QByteArray &ba)\n{\n lastMsg = ba;\n emit serverMessage(ba);\n}\n\n\ntst_QmlDebug_Thread::tst_QmlDebug_Thread(QmlDebugTestData *data, QmlTestFactory *factory)\n : m_ready(false), m_data(data), m_factory(factory)\n{\n}\n\nvoid tst_QmlDebug_Thread::run()\n{\n QTest::qWait(1000);\n\n QmlDebugConnection conn;\n conn.connectToHost(\"127.0.0.1\", 3768);\n bool ok = conn.waitForConnected(5000);\n Q_ASSERT(ok);\n\n while (!m_ready)\n QTest::qWait(100);\n\n m_data->conn = &conn;\n\n Q_ASSERT(m_factory);\n QObject *test = m_factory->createTest(m_data);\n Q_ASSERT(test);\n int code = QTest::qExec(test, QCoreApplication::arguments()); \n emit testsFinished(code);\n}\n\n\nint QmlDebugTest::runTests(QmlTestFactory *factory, const QList<QByteArray> &qml)\n{\n qputenv(\"QML_DEBUG_SERVER_PORT\", \"3768\");\n\n QEventLoop loop;\n QmlDebugTestData data(&loop);\n\n tst_QmlDebug_Thread thread(&data, factory);\n QObject::connect(&thread, SIGNAL(testsFinished(int)), &data, SLOT(testsFinished(int)));\n thread.start();\n\n QmlEngine engine; \/\/ blocks until client connects\n\n foreach (const QByteArray &code, qml) {\n QmlComponent c(&engine);\n c.setData(code, QUrl::fromLocalFile(\"\"));\n Q_ASSERT(c.isReady()); \/\/ fails if bad syntax\n data.items << qobject_cast<QmlGraphicsItem*>(c.create());\n }\n\n \/\/ start the test\n data.engine = &engine;\n thread.m_ready = true;\n\n loop.exec();\n\n return data.exitCode;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>#include <UnitTest++.h>\n\n#include \"stdio_fixture.h\"\n\nSUITE(PrintF)\n{\n TEST_FIXTURE(StdIOFixture, BasicPrintFTest)\n {\n int r = fslc_fprintf(&stream, \"Hello, World!\\n\");\n \n CHECK_EQUAL(\"Hello, World!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFStringTest)\n {\n int r = fslc_fprintf(&stream, \"Hello from %s!\\n\", \"PrintF\");\n \n CHECK_EQUAL(\"Hello from PrintF!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintF2StringsTest)\n {\n int r = fslc_fprintf(&stream, \"%s from %s!\\n\", \"Hello\", \"PrintF\");\n \n CHECK_EQUAL(\"Hello from PrintF!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFCharTest)\n {\n int r = fslc_fprintf(&stream, \"Hello, %corld!\\n\", 'W');\n \n CHECK_EQUAL(\"Hello, World!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPercentTest)\n {\n int r = fslc_fprintf(&stream, \"Special offer: 50%% off!\");\n \n CHECK_EQUAL(\"Special offer: 50% off!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPrePostMultiTest)\n {\n stream.pre_output = fixture_preop;\n stream.post_output = fixture_postop;\n \n int r = fslc_fprintf(&stream, \"Testing %s%% of all possibilities%c\", \"a few \", '!');\n \n const char *expected_str = \"Testing a few % of all possibilities!\";\n \n std::vector<FuncCallItem> expected_calls;\n expected_calls.push_back({ CalledFunc::PreOp, 0 });\n for (const char *c = expected_str; *c; ++c)\n expected_calls.push_back({ CalledFunc::PutC, *c });\n expected_calls.push_back({ CalledFunc::PostOp, 0 });\n\n CHECK(r >= 0);\n CHECK_EQUAL(expected_calls.size(), FuncCallLog.size());\n CHECK_ARRAY_EQUAL(expected_calls, FuncCallLog, FuncCallLog.size());\n \n CHECK_EQUAL(expected_str, ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPrePostMultiEofTest)\n {\n stream.pre_output = fixture_preop;\n stream.post_output = fixture_postop;\n \n eof_counter = 20;\n \n int r = fslc_fprintf(&stream, \"Testing %s%% of all possibilities%c\", \"a few \", '!');\n \n const char *expected_str = \"Testing a few % of a\";\n \/\/ 12345678901234567890\n \n std::vector<FuncCallItem> expected_calls;\n expected_calls.push_back({ CalledFunc::PreOp, 0 });\n for (const char *c = expected_str; *c; ++c)\n expected_calls.push_back({ CalledFunc::PutC, *c });\n expected_calls.push_back({ CalledFunc::PutC, 'l' }); \/\/ EOF\n expected_calls.push_back({ CalledFunc::PostOp, 0 });\n\n CHECK(r < 0);\n CHECK_EQUAL(expected_calls.size(), FuncCallLog.size());\n CHECK_ARRAY_EQUAL(expected_calls, FuncCallLog, FuncCallLog.size());\n \n CHECK_EQUAL(expected_str, ostring.str());\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicIntTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %d!\", 42);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 42!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFZeroIntTest)\n {\n int r = fslc_fprintf(&stream, \"Zero is %d!\", 0);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Zero is 0!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFNegativeTest)\n {\n int r = fslc_fprintf(&stream, \"Less than zero: %d!\", -54);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Less than zero: -54!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUIntMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max uint is %u\\n\", -1);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Max uint is 4294967295\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicHexTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %x!\", 0x74df);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 74df!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicUpperHexTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %X!\", 0x74df);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 74DF!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFZeroHexTest)\n {\n int r = fslc_fprintf(&stream, \"Zero is %x!\", 0);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Zero is 0!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUHExMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max hex is %x\\n\", -1);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Max hex is ffffffff\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n}\n<commit_msg>Unit tests for Long and Very Long ints<commit_after>#include <UnitTest++.h>\n\n#include \"stdio_fixture.h\"\n\nSUITE(PrintF)\n{\n TEST_FIXTURE(StdIOFixture, BasicPrintFTest)\n {\n int r = fslc_fprintf(&stream, \"Hello, World!\\n\");\n \n CHECK_EQUAL(\"Hello, World!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFStringTest)\n {\n int r = fslc_fprintf(&stream, \"Hello from %s!\\n\", \"PrintF\");\n \n CHECK_EQUAL(\"Hello from PrintF!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintF2StringsTest)\n {\n int r = fslc_fprintf(&stream, \"%s from %s!\\n\", \"Hello\", \"PrintF\");\n \n CHECK_EQUAL(\"Hello from PrintF!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFCharTest)\n {\n int r = fslc_fprintf(&stream, \"Hello, %corld!\\n\", 'W');\n \n CHECK_EQUAL(\"Hello, World!\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPercentTest)\n {\n int r = fslc_fprintf(&stream, \"Special offer: 50%% off!\");\n \n CHECK_EQUAL(\"Special offer: 50% off!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPrePostMultiTest)\n {\n stream.pre_output = fixture_preop;\n stream.post_output = fixture_postop;\n \n int r = fslc_fprintf(&stream, \"Testing %s%% of all possibilities%c\", \"a few \", '!');\n \n const char *expected_str = \"Testing a few % of all possibilities!\";\n \n std::vector<FuncCallItem> expected_calls;\n expected_calls.push_back({ CalledFunc::PreOp, 0 });\n for (const char *c = expected_str; *c; ++c)\n expected_calls.push_back({ CalledFunc::PutC, *c });\n expected_calls.push_back({ CalledFunc::PostOp, 0 });\n\n CHECK(r >= 0);\n CHECK_EQUAL(expected_calls.size(), FuncCallLog.size());\n CHECK_ARRAY_EQUAL(expected_calls, FuncCallLog, FuncCallLog.size());\n \n CHECK_EQUAL(expected_str, ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFPrePostMultiEofTest)\n {\n stream.pre_output = fixture_preop;\n stream.post_output = fixture_postop;\n \n eof_counter = 20;\n \n int r = fslc_fprintf(&stream, \"Testing %s%% of all possibilities%c\", \"a few \", '!');\n \n const char *expected_str = \"Testing a few % of a\";\n \/\/ 12345678901234567890\n \n std::vector<FuncCallItem> expected_calls;\n expected_calls.push_back({ CalledFunc::PreOp, 0 });\n for (const char *c = expected_str; *c; ++c)\n expected_calls.push_back({ CalledFunc::PutC, *c });\n expected_calls.push_back({ CalledFunc::PutC, 'l' }); \/\/ EOF\n expected_calls.push_back({ CalledFunc::PostOp, 0 });\n\n CHECK(r < 0);\n CHECK_EQUAL(expected_calls.size(), FuncCallLog.size());\n CHECK_ARRAY_EQUAL(expected_calls, FuncCallLog, FuncCallLog.size());\n \n CHECK_EQUAL(expected_str, ostring.str());\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicIntTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %d!\", 42);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 42!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFZeroIntTest)\n {\n int r = fslc_fprintf(&stream, \"Zero is %d!\", 0);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Zero is 0!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFNegativeTest)\n {\n int r = fslc_fprintf(&stream, \"Less than zero: %d!\", -54);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Less than zero: -54!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUIntMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max uint is %u\\n\", -1);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Max uint is 4294967295\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicHexTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %x!\", 0x74df);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 74df!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFBasicUpperHexTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %X!\", 0x74df);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"The answer is 74DF!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFZeroHexTest)\n {\n int r = fslc_fprintf(&stream, \"Zero is %x!\", 0);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Zero is 0!\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUHExMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max hex is %x\\n\", -1);\n \n CHECK(r >= 0);\n CHECK_EQUAL(\"Max hex is ffffffff\\n\", ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFLongIntTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %ld!\", 435434432L);\n \n int e = eprintf(\"The answer is %ld!\", 435434432L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFLongNegativeTest)\n {\n int r = fslc_fprintf(&stream, \"Less than zero: %ld!\", -57299223L);\n \n int e = eprintf(\"Less than zero: %ld!\", -57299223L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFULongMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max ulong is %lu\\n\", -1L);\n \n int e = eprintf(\"Max ulong is %lu\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFULongHexMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max long hex is %lx\\n\", -1L);\n \n int e = eprintf(\"Max long hex is %lx\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFULongHexUpperMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max long hex is %lX\\n\", -1L);\n \n int e = eprintf(\"Max long hex is %lX\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFVeryLongIntTest)\n {\n int r = fslc_fprintf(&stream, \"The answer is %lld!\", 435432343442444432LL);\n \n int e = eprintf(\"The answer is %lld!\", 435432343442444432LL);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFVeryLongNegativeTest)\n {\n int r = fslc_fprintf(&stream, \"Less than zero: %lld!\", -5729932434424223L);\n \n int e = eprintf(\"Less than zero: %lld!\", -5729932434424223L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUVeryLongMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max ulonglong is %llu\\n\", -1L);\n \n int e = eprintf(\"Max ulonglong is %llu\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUVeryLongHexMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max long long hex is %llx\\n\", -1L);\n \n int e = eprintf(\"Max long long hex is %llx\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n \n TEST_FIXTURE(StdIOFixture, PrintFUVeryLongUpperHexMaxTest)\n {\n int r = fslc_fprintf(&stream, \"Max long long hex is %llX\\n\", -1L);\n \n int e = eprintf(\"Max long long hex is %llX\\n\", -1L);\n \n CHECK_EQUAL(e, r);\n CHECK_EQUAL(expected_fstring.get(), ostring.str());\n CHECK_EQUAL(ostring.str().size(), r);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n#include <bse\/bse.hh>\n\n#include <websocketpp\/config\/asio_no_tls.hpp>\n#include <websocketpp\/server.hpp>\ntypedef websocketpp::server<websocketpp::config::asio> server;\n\n\nstatic void\nprint_usage (bool help)\n{\n if (!help)\n {\n Bse::printout (\"beast-sound-engine version %s\\n\", Bse::version());\n return;\n }\n Bse::printout (\"Usage: beast-sound-engine [OPTIONS]\\n\");\n Bse::printout (\" --help Print command line help\\n\");\n Bse::printout (\" --version Print program version\\n\");\n}\n\nstatic Bse::ServerH bse_server;\n\n\/\/ Configure websocket server\nstruct CustomServerConfig : public websocketpp::config::asio {\n static const size_t connection_read_buffer_size = 16384;\n};\nusing ServerEndpoint = websocketpp::server<CustomServerConfig>;\nstatic ServerEndpoint websocket_server;\n\nstatic void\nws_message (websocketpp::connection_hdl con, server::message_ptr msg)\n{\n const std::string &message = msg->get_payload();\n \/\/ send message to BSE thread and block until its been handled\n Aida::ScopedSemaphore sem;\n auto handle_wsmsg = [&message, &con, &sem] () {\n const std::string reply = \"ECHO: \" + message;\n if (!reply.empty())\n websocket_server.send (con, reply, websocketpp::frame::opcode::text);\n sem.post();\n };\n bse_server.__iface_ptr__()->__execution_context_mt__().enqueue_mt (handle_wsmsg);\n sem.wait();\n}\n\nint\nmain (int argc, char *argv[])\n{\n Bse::init_async (&argc, argv, argv[0]); \/\/ Bse::cstrings_to_vector (NULL)\n bse_server = Bse::init_server_instance();\n\n \/\/ parse arguments\n bool seen_dashdash = false;\n std::vector<std::string> words;\n for (size_t i = 0; i < argc; i++)\n if (!argv[i])\n continue;\n else if (argv[i][0] == '-' && argv[i][1] == '-' && argv[i][2] == 0)\n seen_dashdash = true;\n else if (!seen_dashdash && argv[i][0] == '-')\n {\n const char *arg = argv[i] + 1 + (argv[i][1] == '-');\n const char *eq = strchr (arg, '=');\n const std::string arg_name = !eq ? arg : std::string (arg, eq - arg);\n if (arg_name == \"version\")\n {\n print_usage (false);\n return 0;\n }\n else if (arg_name == \"h\" || arg_name == \"help\")\n {\n print_usage (true);\n return 0;\n }\n else\n {\n Bse::printerr (\"%s: invalid argument: %s\\n\", argv[0], argv[i]);\n print_usage (true);\n return 1;\n }\n }\n else\n words.push_back (argv[i]);\n\n const int BEAST_AUDIO_ENGINE_PORT = 27239; \/\/ 0x3ea67 % 32768\n\n \/\/ setup websocket and run asio loop\n websocket_server.set_message_handler (&ws_message);\n websocket_server.init_asio();\n websocket_server.clear_access_channels (websocketpp::log::alevel::all);\n websocket_server.set_reuse_addr (true);\n namespace IP = boost::asio::ip;\n IP::tcp::endpoint endpoint_local = IP::tcp::endpoint (IP::address::from_string (\"127.0.0.1\"), BEAST_AUDIO_ENGINE_PORT);\n websocket_server.listen (endpoint_local);\n websocket_server.start_accept();\n\n Bse::printout (\"LISTEN: ws:\/\/localhost:%d\/\\n\", BEAST_AUDIO_ENGINE_PORT);\n\n websocket_server.run();\n\n return 0;\n}\n<commit_msg>BSE: beast-sound-engine: add tiny bit of color<commit_after>\/\/ This Source Code Form is licensed MPL-2.0: http:\/\/mozilla.org\/MPL\/2.0\n#include <bse\/bse.hh>\n#include <bse\/platform.hh>\n\n#include <websocketpp\/config\/asio_no_tls.hpp>\n#include <websocketpp\/server.hpp>\ntypedef websocketpp::server<websocketpp::config::asio> server;\n\n\nstatic void\nprint_usage (bool help)\n{\n if (!help)\n {\n Bse::printout (\"beast-sound-engine version %s\\n\", Bse::version());\n return;\n }\n Bse::printout (\"Usage: beast-sound-engine [OPTIONS]\\n\");\n Bse::printout (\" --help Print command line help\\n\");\n Bse::printout (\" --version Print program version\\n\");\n}\n\nstatic Bse::ServerH bse_server;\n\n\/\/ Configure websocket server\nstruct CustomServerConfig : public websocketpp::config::asio {\n static const size_t connection_read_buffer_size = 16384;\n};\nusing ServerEndpoint = websocketpp::server<CustomServerConfig>;\nstatic ServerEndpoint websocket_server;\n\nstatic void\nws_message (websocketpp::connection_hdl con, server::message_ptr msg)\n{\n const std::string &message = msg->get_payload();\n \/\/ send message to BSE thread and block until its been handled\n Aida::ScopedSemaphore sem;\n auto handle_wsmsg = [&message, &con, &sem] () {\n const std::string reply = \"ECHO: \" + message;\n if (!reply.empty())\n websocket_server.send (con, reply, websocketpp::frame::opcode::text);\n sem.post();\n };\n bse_server.__iface_ptr__()->__execution_context_mt__().enqueue_mt (handle_wsmsg);\n sem.wait();\n}\n\nint\nmain (int argc, char *argv[])\n{\n Bse::init_async (&argc, argv, argv[0]); \/\/ Bse::cstrings_to_vector (NULL)\n bse_server = Bse::init_server_instance();\n\n \/\/ parse arguments\n bool seen_dashdash = false;\n std::vector<std::string> words;\n for (size_t i = 0; i < argc; i++)\n if (!argv[i])\n continue;\n else if (argv[i][0] == '-' && argv[i][1] == '-' && argv[i][2] == 0)\n seen_dashdash = true;\n else if (!seen_dashdash && argv[i][0] == '-')\n {\n const char *arg = argv[i] + 1 + (argv[i][1] == '-');\n const char *eq = strchr (arg, '=');\n const std::string arg_name = !eq ? arg : std::string (arg, eq - arg);\n if (arg_name == \"version\")\n {\n print_usage (false);\n return 0;\n }\n else if (arg_name == \"h\" || arg_name == \"help\")\n {\n print_usage (true);\n return 0;\n }\n else\n {\n Bse::printerr (\"%s: invalid argument: %s\\n\", argv[0], argv[i]);\n print_usage (true);\n return 1;\n }\n }\n else\n words.push_back (argv[i]);\n\n const int BEAST_AUDIO_ENGINE_PORT = 27239; \/\/ 0x3ea67 % 32768\n\n \/\/ setup websocket and run asio loop\n websocket_server.set_message_handler (&ws_message);\n websocket_server.init_asio();\n websocket_server.clear_access_channels (websocketpp::log::alevel::all);\n websocket_server.set_reuse_addr (true);\n namespace IP = boost::asio::ip;\n IP::tcp::endpoint endpoint_local = IP::tcp::endpoint (IP::address::from_string (\"127.0.0.1\"), BEAST_AUDIO_ENGINE_PORT);\n websocket_server.listen (endpoint_local);\n websocket_server.start_accept();\n\n#undef B0 \/\/ pollution from termios.h\n using namespace Bse::AnsiColors;\n auto B1 = color (BOLD);\n auto B0 = color (BOLD_OFF);\n Bse::printout (\"%sLISTEN:%s ws:\/\/localhost:%d\/\\n\", B1, B0, BEAST_AUDIO_ENGINE_PORT);\n\n websocket_server.run();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\/\n\/* input.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* http:\/\/www.godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2015 Juan Linietsky, Ariel Manzur. *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n#include \"input.h\"\n#include \"input_map.h\"\n#include \"os\/os.h\"\n#include \"globals.h\"\nInput *Input::singleton=NULL;\n\nInput *Input::get_singleton() {\n\n\treturn singleton;\n}\n\nvoid Input::set_mouse_mode(MouseMode p_mode) {\n\tERR_FAIL_INDEX(p_mode,3);\n\tOS::get_singleton()->set_mouse_mode((OS::MouseMode)p_mode);\n}\n\nInput::MouseMode Input::get_mouse_mode() const {\n\n\treturn (MouseMode)OS::get_singleton()->get_mouse_mode();\n}\n\nvoid Input::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"is_key_pressed\",\"scancode\"),&Input::is_key_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_mouse_button_pressed\",\"button\"),&Input::is_mouse_button_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_joy_button_pressed\",\"device\",\"button\"),&Input::is_joy_button_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_action_pressed\",\"action\"),&Input::is_action_pressed);\n\tObjectTypeDB::bind_method(_MD(\"get_joy_axis\",\"device\",\"axis\"),&Input::get_joy_axis);\n\tObjectTypeDB::bind_method(_MD(\"get_joy_name\",\"device\"),&Input::get_joy_name);\n\tObjectTypeDB::bind_method(_MD(\"get_accelerometer\"),&Input::get_accelerometer);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_pos\"),&Input::get_mouse_pos);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_speed\"),&Input::get_mouse_speed);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_button_mask\"),&Input::get_mouse_button_mask);\n\tObjectTypeDB::bind_method(_MD(\"set_mouse_mode\",\"mode\"),&Input::set_mouse_mode);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_mode\"),&Input::get_mouse_mode);\n\tObjectTypeDB::bind_method(_MD(\"warp_mouse_pos\",\"to\"),&Input::warp_mouse_pos);\n\tObjectTypeDB::bind_method(_MD(\"action_press\"),&Input::action_press);\n\tObjectTypeDB::bind_method(_MD(\"action_release\"),&Input::action_release);\n\n\tBIND_CONSTANT( MOUSE_MODE_VISIBLE );\n\tBIND_CONSTANT( MOUSE_MODE_HIDDEN );\n\tBIND_CONSTANT( MOUSE_MODE_CAPTURED );\n\n\tADD_SIGNAL( MethodInfo(\"joy_connection_changed\", PropertyInfo(Variant::INT, \"index\"), PropertyInfo(Variant::BOOL, \"connected\")) );\n}\n\nvoid Input::get_argument_options(const StringName& p_function,int p_idx,List<String>*r_options) const {\n#ifdef TOOLS_ENABLED\n\n\tString pf=p_function;\n\tif (p_idx==0 && (pf==\"is_action_pressed\" || pf==\"action_press\" || pf==\"action_release\")) {\n\n\t\tList<PropertyInfo> pinfo;\n\t\tGlobals::get_singleton()->get_property_list(&pinfo);\n\n\t\tfor(List<PropertyInfo>::Element *E=pinfo.front();E;E=E->next()) {\n\t\t\tconst PropertyInfo &pi=E->get();\n\n\t\t\tif (!pi.name.begins_with(\"input\/\"))\n\t\t\t\tcontinue;\n\n\t\t\tString name = pi.name.substr(pi.name.find(\"\/\")+1,pi.name.length());\n\t\t\tr_options->push_back(\"\\\"\"+name+\"\\\"\");\n\n\t\t}\n\t}\n#endif\n\n}\n\nInput::Input() {\n\n\tsingleton=this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid InputDefault::SpeedTrack::update(const Vector2& p_delta_p) {\n\n\tuint64_t tick = OS::get_singleton()->get_ticks_usec();\n\tuint32_t tdiff = tick-last_tick;\n\tfloat delta_t = tdiff \/ 1000000.0;\n\tlast_tick=tick;\n\n\n\taccum+=p_delta_p;\n\taccum_t+=delta_t;\n\n\tif (accum_t>max_ref_frame*10)\n\t\taccum_t=max_ref_frame*10;\n\n\twhile( accum_t>=min_ref_frame ) {\n\n\t\tfloat slice_t = min_ref_frame \/ accum_t;\n\t\tVector2 slice = accum*slice_t;\n\t\taccum=accum-slice;\n\t\taccum_t-=min_ref_frame;\n\n\t\tspeed=(slice\/min_ref_frame).linear_interpolate(speed,min_ref_frame\/max_ref_frame);\n\t}\n\n\n\n}\n\nvoid InputDefault::SpeedTrack::reset() {\n\tlast_tick = OS::get_singleton()->get_ticks_usec();\n\tspeed=Vector2();\n\taccum_t=0;\n}\n\nInputDefault::SpeedTrack::SpeedTrack() {\n\n\t min_ref_frame=0.1;\n\t max_ref_frame=0.3;\n\t reset();\n}\n\nbool InputDefault::is_key_pressed(int p_scancode) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn keys_pressed.has(p_scancode);\n}\n\nbool InputDefault::is_mouse_button_pressed(int p_button) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn (mouse_button_mask&(1<<p_button))!=0;\n}\n\n\nstatic int _combine_device(int p_value,int p_device) {\n\n\treturn p_value|(p_device<<20);\n}\n\nbool InputDefault::is_joy_button_pressed(int p_device, int p_button) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn joy_buttons_pressed.has(_combine_device(p_button,p_device));\n}\n\nbool InputDefault::is_action_pressed(const StringName& p_action) {\n\n\tif (custom_action_press.has(p_action))\n\t\treturn true; \/\/simpler\n\n\tconst List<InputEvent> *alist = InputMap::get_singleton()->get_action_list(p_action);\n\tif (!alist)\n\t\treturn NULL;\n\n\n\tfor (const List<InputEvent>::Element *E=alist->front();E;E=E->next()) {\n\n\n\t\tint device=E->get().device;\n\n\t\tswitch(E->get().type) {\n\n\t\t\tcase InputEvent::KEY: {\n\n\t\t\t\tconst InputEventKey &iek=E->get().key;\n\t\t\t\tif ((keys_pressed.has(iek.scancode)))\n\t\t\t\t\treturn true;\n\t\t\t} break;\n\t\t\tcase InputEvent::MOUSE_BUTTON: {\n\n\t\t\t\tconst InputEventMouseButton &iemb=E->get().mouse_button;\n\t\t\t\t if(mouse_button_mask&(1<<iemb.button_index))\n\t\t\t\t\t return true;\n\t\t\t} break;\n\t\t\tcase InputEvent::JOYSTICK_BUTTON: {\n\n\t\t\t\tconst InputEventJoystickButton &iejb=E->get().joy_button;\n\t\t\t\tint c = _combine_device(iejb.button_index,device);\n\t\t\t\tif (joy_buttons_pressed.has(c))\n\t\t\t\t\treturn true;\n\t\t\t} break;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nfloat InputDefault::get_joy_axis(int p_device,int p_axis) {\n\n\t_THREAD_SAFE_METHOD_\n\tint c = _combine_device(p_axis,p_device);\n\tif (joy_axis.has(c)) {\n\t\treturn joy_axis[c];\n\t} else {\n\t\treturn 0;\n\t}\n}\n\nString InputDefault::get_joy_name(int p_idx) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn joy_names[p_idx];\n};\n\nvoid InputDefault::joy_connection_changed(int p_idx, bool p_connected, String p_name) {\n\n\t_THREAD_SAFE_METHOD_\n\tjoy_names[p_idx] = p_connected ? p_name : \"\";\n\n\temit_signal(\"joy_connection_changed\", p_idx, p_connected);\n};\n\nVector3 InputDefault::get_accelerometer() {\n\n\t_THREAD_SAFE_METHOD_\n\treturn accelerometer;\n}\n\nvoid InputDefault::parse_input_event(const InputEvent& p_event) {\n\n\t_THREAD_SAFE_METHOD_\n\tswitch(p_event.type) {\n\n\t\tcase InputEvent::KEY: {\n\n\t\t\tif (p_event.key.echo)\n\t\t\t\tbreak;\n\t\t\tif (p_event.key.scancode==0)\n\t\t\t\tbreak;\n\n\t\t\/\/\tprint_line(p_event);\n\n\t\t\tif (p_event.key.pressed)\n\t\t\t\tkeys_pressed.insert(p_event.key.scancode);\n\t\t\telse\n\t\t\t\tkeys_pressed.erase(p_event.key.scancode);\n\t\t} break;\n\t\tcase InputEvent::MOUSE_BUTTON: {\n\n\t\t\tif (p_event.mouse_button.doubleclick)\n\t\t\t\tbreak;\n\n\t\t\tif (p_event.mouse_button.pressed)\n\t\t\t\tmouse_button_mask|=(1<<p_event.mouse_button.button_index);\n\t\t\telse\n\t\t\t\tmouse_button_mask&=~(1<<p_event.mouse_button.button_index);\n\t\t} break;\n\t\tcase InputEvent::JOYSTICK_BUTTON: {\n\n\t\t\tint c = _combine_device(p_event.joy_button.button_index,p_event.device);\n\n\t\t\tif (p_event.joy_button.pressed)\n\t\t\t\tjoy_buttons_pressed.insert(c);\n\t\t\telse\n\t\t\t\tjoy_buttons_pressed.erase(c);\n\t\t} break;\n\t\tcase InputEvent::JOYSTICK_MOTION: {\n\t\t\tset_joy_axis(p_event.device, p_event.joy_motion.axis, p_event.joy_motion.axis_value);\n\t\t} break;\n\n\t}\n\n\tif (main_loop)\n\t\tmain_loop->input_event(p_event);\n\n}\n\nvoid InputDefault::set_joy_axis(int p_device,int p_axis,float p_value) {\n\n\t_THREAD_SAFE_METHOD_\n\tint c = _combine_device(p_axis,p_device);\n\tjoy_axis[c]=p_value;\n}\n\nvoid InputDefault::set_accelerometer(const Vector3& p_accel) {\n\n\t_THREAD_SAFE_METHOD_\n\n\taccelerometer=p_accel;\n\n}\n\nvoid InputDefault::set_main_loop(MainLoop *p_main_loop) {\n\tmain_loop=p_main_loop;\n\n}\n\nvoid InputDefault::set_mouse_pos(const Point2& p_posf) {\n\n\tmouse_speed_track.update(p_posf-mouse_pos);\n\tmouse_pos=p_posf;\n}\n\nPoint2 InputDefault::get_mouse_pos() const {\n\n\treturn mouse_pos;\n}\nPoint2 InputDefault::get_mouse_speed() const {\n\n\treturn mouse_speed_track.speed;\n}\n\nint InputDefault::get_mouse_button_mask() const {\n\n\treturn OS::get_singleton()->get_mouse_button_state();\n}\n\nvoid InputDefault::warp_mouse_pos(const Vector2& p_to) {\n\n\tOS::get_singleton()->warp_mouse_pos(p_to);\n}\n\n\nvoid InputDefault::iteration(float p_step) {\n\n\n}\n\nvoid InputDefault::action_press(const StringName& p_action) {\n\n\tif (custom_action_press.has(p_action)) {\n\n\t\tcustom_action_press[p_action]++;\n\t} else {\n\t\tcustom_action_press[p_action]=1;\n\t}\n}\n\nvoid InputDefault::action_release(const StringName& p_action){\n\n\tERR_FAIL_COND(!custom_action_press.has(p_action));\n\tcustom_action_press[p_action]--;\n\tif (custom_action_press[p_action]==0) {\n\t\tcustom_action_press.erase(p_action);\n\t}\n}\n\nInputDefault::InputDefault() {\n\n\tmouse_button_mask=0;\n\tmain_loop=NULL;\n}\n<commit_msg>-removed get_mouse_pos from Input, as it only caused problems<commit_after>\/*************************************************************************\/\n\/* input.cpp *\/\n\/*************************************************************************\/\n\/* This file is part of: *\/\n\/* GODOT ENGINE *\/\n\/* http:\/\/www.godotengine.org *\/\n\/*************************************************************************\/\n\/* Copyright (c) 2007-2015 Juan Linietsky, Ariel Manzur. *\/\n\/* *\/\n\/* Permission is hereby granted, free of charge, to any person obtaining *\/\n\/* a copy of this software and associated documentation files (the *\/\n\/* \"Software\"), to deal in the Software without restriction, including *\/\n\/* without limitation the rights to use, copy, modify, merge, publish, *\/\n\/* distribute, sublicense, and\/or sell copies of the Software, and to *\/\n\/* permit persons to whom the Software is furnished to do so, subject to *\/\n\/* the following conditions: *\/\n\/* *\/\n\/* The above copyright notice and this permission notice shall be *\/\n\/* included in all copies or substantial portions of the Software. *\/\n\/* *\/\n\/* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, *\/\n\/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *\/\n\/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*\/\n\/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY *\/\n\/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, *\/\n\/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE *\/\n\/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. *\/\n\/*************************************************************************\/\n#include \"input.h\"\n#include \"input_map.h\"\n#include \"os\/os.h\"\n#include \"globals.h\"\nInput *Input::singleton=NULL;\n\nInput *Input::get_singleton() {\n\n\treturn singleton;\n}\n\nvoid Input::set_mouse_mode(MouseMode p_mode) {\n\tERR_FAIL_INDEX(p_mode,3);\n\tOS::get_singleton()->set_mouse_mode((OS::MouseMode)p_mode);\n}\n\nInput::MouseMode Input::get_mouse_mode() const {\n\n\treturn (MouseMode)OS::get_singleton()->get_mouse_mode();\n}\n\nvoid Input::_bind_methods() {\n\n\tObjectTypeDB::bind_method(_MD(\"is_key_pressed\",\"scancode\"),&Input::is_key_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_mouse_button_pressed\",\"button\"),&Input::is_mouse_button_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_joy_button_pressed\",\"device\",\"button\"),&Input::is_joy_button_pressed);\n\tObjectTypeDB::bind_method(_MD(\"is_action_pressed\",\"action\"),&Input::is_action_pressed);\n\tObjectTypeDB::bind_method(_MD(\"get_joy_axis\",\"device\",\"axis\"),&Input::get_joy_axis);\n\tObjectTypeDB::bind_method(_MD(\"get_joy_name\",\"device\"),&Input::get_joy_name);\n\tObjectTypeDB::bind_method(_MD(\"get_accelerometer\"),&Input::get_accelerometer);\n\t\/\/ObjectTypeDB::bind_method(_MD(\"get_mouse_pos\"),&Input::get_mouse_pos);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_speed\"),&Input::get_mouse_speed);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_button_mask\"),&Input::get_mouse_button_mask);\n\tObjectTypeDB::bind_method(_MD(\"set_mouse_mode\",\"mode\"),&Input::set_mouse_mode);\n\tObjectTypeDB::bind_method(_MD(\"get_mouse_mode\"),&Input::get_mouse_mode);\n\tObjectTypeDB::bind_method(_MD(\"warp_mouse_pos\",\"to\"),&Input::warp_mouse_pos);\n\tObjectTypeDB::bind_method(_MD(\"action_press\"),&Input::action_press);\n\tObjectTypeDB::bind_method(_MD(\"action_release\"),&Input::action_release);\n\n\tBIND_CONSTANT( MOUSE_MODE_VISIBLE );\n\tBIND_CONSTANT( MOUSE_MODE_HIDDEN );\n\tBIND_CONSTANT( MOUSE_MODE_CAPTURED );\n\n\tADD_SIGNAL( MethodInfo(\"joy_connection_changed\", PropertyInfo(Variant::INT, \"index\"), PropertyInfo(Variant::BOOL, \"connected\")) );\n}\n\nvoid Input::get_argument_options(const StringName& p_function,int p_idx,List<String>*r_options) const {\n#ifdef TOOLS_ENABLED\n\n\tString pf=p_function;\n\tif (p_idx==0 && (pf==\"is_action_pressed\" || pf==\"action_press\" || pf==\"action_release\")) {\n\n\t\tList<PropertyInfo> pinfo;\n\t\tGlobals::get_singleton()->get_property_list(&pinfo);\n\n\t\tfor(List<PropertyInfo>::Element *E=pinfo.front();E;E=E->next()) {\n\t\t\tconst PropertyInfo &pi=E->get();\n\n\t\t\tif (!pi.name.begins_with(\"input\/\"))\n\t\t\t\tcontinue;\n\n\t\t\tString name = pi.name.substr(pi.name.find(\"\/\")+1,pi.name.length());\n\t\t\tr_options->push_back(\"\\\"\"+name+\"\\\"\");\n\n\t\t}\n\t}\n#endif\n\n}\n\nInput::Input() {\n\n\tsingleton=this;\n}\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\nvoid InputDefault::SpeedTrack::update(const Vector2& p_delta_p) {\n\n\tuint64_t tick = OS::get_singleton()->get_ticks_usec();\n\tuint32_t tdiff = tick-last_tick;\n\tfloat delta_t = tdiff \/ 1000000.0;\n\tlast_tick=tick;\n\n\n\taccum+=p_delta_p;\n\taccum_t+=delta_t;\n\n\tif (accum_t>max_ref_frame*10)\n\t\taccum_t=max_ref_frame*10;\n\n\twhile( accum_t>=min_ref_frame ) {\n\n\t\tfloat slice_t = min_ref_frame \/ accum_t;\n\t\tVector2 slice = accum*slice_t;\n\t\taccum=accum-slice;\n\t\taccum_t-=min_ref_frame;\n\n\t\tspeed=(slice\/min_ref_frame).linear_interpolate(speed,min_ref_frame\/max_ref_frame);\n\t}\n\n\n\n}\n\nvoid InputDefault::SpeedTrack::reset() {\n\tlast_tick = OS::get_singleton()->get_ticks_usec();\n\tspeed=Vector2();\n\taccum_t=0;\n}\n\nInputDefault::SpeedTrack::SpeedTrack() {\n\n\t min_ref_frame=0.1;\n\t max_ref_frame=0.3;\n\t reset();\n}\n\nbool InputDefault::is_key_pressed(int p_scancode) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn keys_pressed.has(p_scancode);\n}\n\nbool InputDefault::is_mouse_button_pressed(int p_button) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn (mouse_button_mask&(1<<p_button))!=0;\n}\n\n\nstatic int _combine_device(int p_value,int p_device) {\n\n\treturn p_value|(p_device<<20);\n}\n\nbool InputDefault::is_joy_button_pressed(int p_device, int p_button) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn joy_buttons_pressed.has(_combine_device(p_button,p_device));\n}\n\nbool InputDefault::is_action_pressed(const StringName& p_action) {\n\n\tif (custom_action_press.has(p_action))\n\t\treturn true; \/\/simpler\n\n\tconst List<InputEvent> *alist = InputMap::get_singleton()->get_action_list(p_action);\n\tif (!alist)\n\t\treturn NULL;\n\n\n\tfor (const List<InputEvent>::Element *E=alist->front();E;E=E->next()) {\n\n\n\t\tint device=E->get().device;\n\n\t\tswitch(E->get().type) {\n\n\t\t\tcase InputEvent::KEY: {\n\n\t\t\t\tconst InputEventKey &iek=E->get().key;\n\t\t\t\tif ((keys_pressed.has(iek.scancode)))\n\t\t\t\t\treturn true;\n\t\t\t} break;\n\t\t\tcase InputEvent::MOUSE_BUTTON: {\n\n\t\t\t\tconst InputEventMouseButton &iemb=E->get().mouse_button;\n\t\t\t\t if(mouse_button_mask&(1<<iemb.button_index))\n\t\t\t\t\t return true;\n\t\t\t} break;\n\t\t\tcase InputEvent::JOYSTICK_BUTTON: {\n\n\t\t\t\tconst InputEventJoystickButton &iejb=E->get().joy_button;\n\t\t\t\tint c = _combine_device(iejb.button_index,device);\n\t\t\t\tif (joy_buttons_pressed.has(c))\n\t\t\t\t\treturn true;\n\t\t\t} break;\n\t\t}\n\t}\n\n\treturn false;\n}\n\nfloat InputDefault::get_joy_axis(int p_device,int p_axis) {\n\n\t_THREAD_SAFE_METHOD_\n\tint c = _combine_device(p_axis,p_device);\n\tif (joy_axis.has(c)) {\n\t\treturn joy_axis[c];\n\t} else {\n\t\treturn 0;\n\t}\n}\n\nString InputDefault::get_joy_name(int p_idx) {\n\n\t_THREAD_SAFE_METHOD_\n\treturn joy_names[p_idx];\n};\n\nvoid InputDefault::joy_connection_changed(int p_idx, bool p_connected, String p_name) {\n\n\t_THREAD_SAFE_METHOD_\n\tjoy_names[p_idx] = p_connected ? p_name : \"\";\n\n\temit_signal(\"joy_connection_changed\", p_idx, p_connected);\n};\n\nVector3 InputDefault::get_accelerometer() {\n\n\t_THREAD_SAFE_METHOD_\n\treturn accelerometer;\n}\n\nvoid InputDefault::parse_input_event(const InputEvent& p_event) {\n\n\t_THREAD_SAFE_METHOD_\n\tswitch(p_event.type) {\n\n\t\tcase InputEvent::KEY: {\n\n\t\t\tif (p_event.key.echo)\n\t\t\t\tbreak;\n\t\t\tif (p_event.key.scancode==0)\n\t\t\t\tbreak;\n\n\t\t\/\/\tprint_line(p_event);\n\n\t\t\tif (p_event.key.pressed)\n\t\t\t\tkeys_pressed.insert(p_event.key.scancode);\n\t\t\telse\n\t\t\t\tkeys_pressed.erase(p_event.key.scancode);\n\t\t} break;\n\t\tcase InputEvent::MOUSE_BUTTON: {\n\n\t\t\tif (p_event.mouse_button.doubleclick)\n\t\t\t\tbreak;\n\n\t\t\tif (p_event.mouse_button.pressed)\n\t\t\t\tmouse_button_mask|=(1<<p_event.mouse_button.button_index);\n\t\t\telse\n\t\t\t\tmouse_button_mask&=~(1<<p_event.mouse_button.button_index);\n\t\t} break;\n\t\tcase InputEvent::JOYSTICK_BUTTON: {\n\n\t\t\tint c = _combine_device(p_event.joy_button.button_index,p_event.device);\n\n\t\t\tif (p_event.joy_button.pressed)\n\t\t\t\tjoy_buttons_pressed.insert(c);\n\t\t\telse\n\t\t\t\tjoy_buttons_pressed.erase(c);\n\t\t} break;\n\t\tcase InputEvent::JOYSTICK_MOTION: {\n\t\t\tset_joy_axis(p_event.device, p_event.joy_motion.axis, p_event.joy_motion.axis_value);\n\t\t} break;\n\n\t}\n\n\tif (main_loop)\n\t\tmain_loop->input_event(p_event);\n\n}\n\nvoid InputDefault::set_joy_axis(int p_device,int p_axis,float p_value) {\n\n\t_THREAD_SAFE_METHOD_\n\tint c = _combine_device(p_axis,p_device);\n\tjoy_axis[c]=p_value;\n}\n\nvoid InputDefault::set_accelerometer(const Vector3& p_accel) {\n\n\t_THREAD_SAFE_METHOD_\n\n\taccelerometer=p_accel;\n\n}\n\nvoid InputDefault::set_main_loop(MainLoop *p_main_loop) {\n\tmain_loop=p_main_loop;\n\n}\n\nvoid InputDefault::set_mouse_pos(const Point2& p_posf) {\n\n\tmouse_speed_track.update(p_posf-mouse_pos);\n\tmouse_pos=p_posf;\n}\n\nPoint2 InputDefault::get_mouse_pos() const {\n\n\treturn mouse_pos;\n}\nPoint2 InputDefault::get_mouse_speed() const {\n\n\treturn mouse_speed_track.speed;\n}\n\nint InputDefault::get_mouse_button_mask() const {\n\n\treturn OS::get_singleton()->get_mouse_button_state();\n}\n\nvoid InputDefault::warp_mouse_pos(const Vector2& p_to) {\n\n\tOS::get_singleton()->warp_mouse_pos(p_to);\n}\n\n\nvoid InputDefault::iteration(float p_step) {\n\n\n}\n\nvoid InputDefault::action_press(const StringName& p_action) {\n\n\tif (custom_action_press.has(p_action)) {\n\n\t\tcustom_action_press[p_action]++;\n\t} else {\n\t\tcustom_action_press[p_action]=1;\n\t}\n}\n\nvoid InputDefault::action_release(const StringName& p_action){\n\n\tERR_FAIL_COND(!custom_action_press.has(p_action));\n\tcustom_action_press[p_action]--;\n\tif (custom_action_press[p_action]==0) {\n\t\tcustom_action_press.erase(p_action);\n\t}\n}\n\nInputDefault::InputDefault() {\n\n\tmouse_button_mask=0;\n\tmain_loop=NULL;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include <blackhole\/record.hpp>\n#include <blackhole\/sink\/console.hpp>\n\nnamespace blackhole {\nnamespace testing {\nnamespace sink {\n\nusing ::testing::StrictMock;\nusing ::testing::internal::CaptureStdout;\nusing ::testing::internal::GetCapturedStdout;\n\nusing ::blackhole::sink::console_t;\n\nTEST(console_t, ByDefaultUseStandardOutput) {\n console_t sink;\n\n const string_view message(\"\");\n const attribute_pack pack;\n record_t record(42, message, pack);\n\n CaptureStdout();\n sink.execute(record, \"expected\");\n\n const std::string actual = GetCapturedStdout();\n EXPECT_EQ(\"expected\\n\", actual);\n}\n\nTEST(console_t, AcceptsAll) {\n const string_view message(\"\");\n const attribute_pack pack;\n record_t record(42, message, pack);\n\n console_t sink;\n\n EXPECT_TRUE(sink.filter(record));\n}\n\nTEST(console_t, Type) {\n EXPECT_EQ(\"console\", std::string(factory<sink::console_t>::type()));\n}\n\n} \/\/ namespace sink\n} \/\/ namespace testing\n} \/\/ namespace blackhole\n<commit_msg>chore(tests): make tiny renaming<commit_after>#include <gmock\/gmock.h>\n#include <gtest\/gtest.h>\n\n#include <blackhole\/record.hpp>\n#include <blackhole\/sink\/console.hpp>\n\nnamespace blackhole {\nnamespace testing {\nnamespace sink {\n\nusing ::testing::StrictMock;\nusing ::testing::internal::CaptureStdout;\nusing ::testing::internal::GetCapturedStdout;\n\nusing ::blackhole::sink::console_t;\n\nTEST(console_t, ByDefaultUseStandardOutput) {\n console_t sink;\n\n const string_view message(\"\");\n const attribute_pack pack;\n record_t record(42, message, pack);\n\n CaptureStdout();\n sink.execute(record, \"expected\");\n\n const std::string actual = GetCapturedStdout();\n EXPECT_EQ(\"expected\\n\", actual);\n}\n\nTEST(console_t, FilterAcceptsAll) {\n const string_view message(\"\");\n const attribute_pack pack;\n record_t record(42, message, pack);\n\n console_t sink;\n\n EXPECT_TRUE(sink.filter(record));\n}\n\nTEST(console_t, Type) {\n EXPECT_EQ(\"console\", std::string(factory<sink::console_t>::type()));\n}\n\n} \/\/ namespace sink\n} \/\/ namespace testing\n} \/\/ namespace blackhole\n<|endoftext|>"} {"text":"<commit_before>\/*{{{\n Copyright (C) 2012 Matthias Kretz <kretz@kde.org>\n\n Permission to use, copy, modify, and distribute this software\n and its documentation for any purpose and without fee is hereby\n granted, provided that the above copyright notice appear in all\n copies and that both that the copyright notice and this\n permission notice and warranty disclaimer appear in supporting\n documentation, and that the name of the author not be used in\n advertising or publicity pertaining to distribution of the\n software without specific, written prior permission.\n\n The author disclaim all warranties with regard to this\n software, including all implied warranties of merchantability\n and fitness. In no event shall the author be liable for any\n special, indirect or consequential damages or any damages\n whatsoever resulting from loss of use, data or profits, whether\n in an action of contract, negligence or other tortious action,\n arising out of or in connection with the use or performance of\n this software.\n\n}}}*\/\n\n#include \"unittest-old.h\"\n#include <Vc\/Allocator>\n#include <vector>\n#include <array>\n#include <forward_list>\n#include <list>\n#include <deque>\n\n#include \"common\/macros.h\"\n\ntemplate<typename Vec> size_t alignmentMask()\n{\n if (Vec::Size == 1) {\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n return std::min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1;\n }\n \/\/ AVX::VectorAlignment is too large\n return std::min<size_t>(sizeof(Vec), Vc::VectorAlignment) - 1;\n}\n\ntemplate<typename T> struct SomeStruct { char a; T x; };\n\ntemplate<typename V> void stdVectorAlignment()\n{\n const size_t mask = alignmentMask<V>();\n const char *const null = 0;\n\n std::vector<V> v(11);\n for (int i = 0; i < 11; ++i) {\n COMPARE((reinterpret_cast<char *>(&v[i]) - null) & mask, 0u) << \"&v[i] = \" << &v[i] << \", mask = \" << mask << \", i = \" << i;\n }\n\n std::vector<SomeStruct<V>, Vc::Allocator<SomeStruct<V> > > v2(11);\n for (int i = 0; i < 11; ++i) {\n COMPARE((reinterpret_cast<char *>(&v2[i]) - null) & mask, 0u) << \"&v2[i] = \" << &v2[i] << \", mask = \" << mask << \", i = \" << i;\n }\n\n std::vector<V> v3(v);\n std::vector<SomeStruct<V>, Vc::Allocator<SomeStruct<V> > > v4(v2);\n\n typedef typename V::EntryType T;\n for (int i = 1; i < 100; ++i) {\n std::vector<T, Vc::Allocator<T>> v5(i);\n const size_t expectedAlignment = alignof(V);\n COMPARE((&v5[0] - static_cast<const T *>(0)) * sizeof(T) & (expectedAlignment - 1), 0u);\n }\n}\n\ntemplate<typename V, typename Container> void listInitialization()\n{\n typedef typename V::EntryType T;\n const auto data = Vc::makeContainer<Container>({ T(1), T(2), T(3), T(4), T(5), T(6), T(7), T(8), T(9) });\n V reference = V::IndexesFromZero() + 1;\n for (const auto &v : data) {\n reference.setZero(reference > 9);\n COMPARE(v, reference);\n reference += V::Size;\n }\n}\ntemplate<typename V> void listInitialization()\n{\n listInitialization<V, std::vector<V>>();\n listInitialization<V, std::array<V, 9>>();\n listInitialization<V, std::deque<V>>();\n\n \/\/ The following two crash (at least with AVX). Probably unaligned memory access.\n \/\/listInitialization<V, std::forward_list<V>>();\n \/\/listInitialization<V, std::list<V>>();\n}\n\nvoid testmain()\n{\n using namespace Vc;\n testAllTypes(stdVectorAlignment);\n testAllTypes(listInitialization);\n}\n<commit_msg>stlcontainer: convert to new unittest interface<commit_after>\/*{{{\n Copyright (C) 2012 Matthias Kretz <kretz@kde.org>\n\n Permission to use, copy, modify, and distribute this software\n and its documentation for any purpose and without fee is hereby\n granted, provided that the above copyright notice appear in all\n copies and that both that the copyright notice and this\n permission notice and warranty disclaimer appear in supporting\n documentation, and that the name of the author not be used in\n advertising or publicity pertaining to distribution of the\n software without specific, written prior permission.\n\n The author disclaim all warranties with regard to this\n software, including all implied warranties of merchantability\n and fitness. In no event shall the author be liable for any\n special, indirect or consequential damages or any damages\n whatsoever resulting from loss of use, data or profits, whether\n in an action of contract, negligence or other tortious action,\n arising out of or in connection with the use or performance of\n this software.\n\n}}}*\/\n\n#include \"unittest.h\"\n#include <Vc\/Allocator>\n#include <vector>\n#include <array>\n#include <forward_list>\n#include <list>\n#include <deque>\n\n#include \"common\/macros.h\"\n\ntemplate<typename Vec> size_t alignmentMask()\n{\n if (Vec::Size == 1) {\n \/\/ on 32bit the maximal alignment is 4 Bytes, even for 8-Byte doubles.\n return std::min(sizeof(void*), sizeof(typename Vec::EntryType)) - 1;\n }\n \/\/ AVX::VectorAlignment is too large\n return std::min<size_t>(sizeof(Vec), Vc::VectorAlignment) - 1;\n}\n\ntemplate<typename T> struct SomeStruct { char a; T x; };\n\nTEST_TYPES(V, stdVectorAlignment, (ALL_VECTORS))\n{\n const size_t mask = alignmentMask<V>();\n const char *const null = 0;\n\n std::vector<V> v(11);\n for (int i = 0; i < 11; ++i) {\n COMPARE((reinterpret_cast<char *>(&v[i]) - null) & mask, 0u) << \"&v[i] = \" << &v[i] << \", mask = \" << mask << \", i = \" << i;\n }\n\n std::vector<SomeStruct<V>, Vc::Allocator<SomeStruct<V> > > v2(11);\n for (int i = 0; i < 11; ++i) {\n COMPARE((reinterpret_cast<char *>(&v2[i]) - null) & mask, 0u) << \"&v2[i] = \" << &v2[i] << \", mask = \" << mask << \", i = \" << i;\n }\n\n std::vector<V> v3(v);\n std::vector<SomeStruct<V>, Vc::Allocator<SomeStruct<V> > > v4(v2);\n\n typedef typename V::EntryType T;\n for (int i = 1; i < 100; ++i) {\n std::vector<T, Vc::Allocator<T>> v5(i);\n const size_t expectedAlignment = alignof(V);\n COMPARE((&v5[0] - static_cast<const T *>(0)) * sizeof(T) & (expectedAlignment - 1), 0u);\n }\n}\n\ntemplate<typename V, typename Container> void listInitializationImpl()\n{\n typedef typename V::EntryType T;\n const auto data = Vc::makeContainer<Container>({ T(1), T(2), T(3), T(4), T(5), T(6), T(7), T(8), T(9) });\n V reference = V::IndexesFromZero() + 1;\n for (const auto &v : data) {\n reference.setZero(reference > 9);\n COMPARE(v, reference);\n reference += V::Size;\n }\n}\nTEST_TYPES(V, listInitialization, (ALL_VECTORS))\n{\n listInitializationImpl<V, std::vector<V>>();\n listInitializationImpl<V, std::array<V, 9>>();\n listInitializationImpl<V, std::deque<V>>();\n\n \/\/ The following two crash (at least with AVX). Probably unaligned memory access.\n \/\/listInitialization<V, std::forward_list<V>>();\n \/\/listInitialization<V, std::list<V>>();\n}\n<|endoftext|>"} {"text":"<commit_before>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"simulatorvideorenderercontrol.h\"\n#include <QFile>\n#include <QAbstractVideoSurface>\n#include <QVideoFrame>\n#include <QVideoSurfaceFormat>\n#include <QColor>\n#include <QPainter>\n\nQSimulatorVideoRendererControl::QSimulatorVideoRendererControl(QObject *parent) :\n QVideoRendererControl(parent)\n , mSurface(0)\n , mRunning(false)\n{\n}\n\nQSimulatorVideoRendererControl::~QSimulatorVideoRendererControl()\n{\n}\n\nQAbstractVideoSurface *QSimulatorVideoRendererControl::surface() const\n{\n return mSurface;\n}\n\nvoid QSimulatorVideoRendererControl::setSurface(QAbstractVideoSurface *surface)\n{\n mSurface = surface;\n}\n\nvoid QSimulatorVideoRendererControl::setImagePath(const QString &imagePath)\n{\n if (QFile::exists(imagePath)) {\n mImage = QImage(imagePath);\n } else {\n mImage = QImage(800, 600, QImage::Format_RGB32);\n mImage.fill(qRgb(200, 50, 50));\n QPainter painter(&mImage);\n painter.drawText(0, 0, 800, 600, Qt::AlignCenter, imagePath);\n }\n if (mRunning)\n start();\n}\n\nvoid QSimulatorVideoRendererControl::start()\n{\n if (!mSurface)\n return;\n stop();\n QVideoSurfaceFormat format(mImage.size(), QVideoFrame::Format_RGB32);\n mSurface->start(format);\n mSurface->present(mImage);\n mRunning = true;\n}\n\nvoid QSimulatorVideoRendererControl::stop()\n{\n if (!mSurface)\n return;\n\n if (mSurface->isActive())\n mSurface->stop();\n mRunning = false;\n}\n\nconst QImage * QSimulatorVideoRendererControl::image() const\n{\n return &mImage;\n}\n<commit_msg>Don't use camelcase header includes for multimedia plugins<commit_after>\/****************************************************************************\n**\n** Copyright (C) 2010 Nokia Corporation and\/or its subsidiary(-ies).\n** All rights reserved.\n** Contact: Nokia Corporation (qt-info@nokia.com)\n**\n** This file is part of the Qt Mobility Components.\n**\n** $QT_BEGIN_LICENSE:LGPL$\n** No Commercial Usage\n** This file contains pre-release code and may not be distributed.\n** You may use this file in accordance with the terms and conditions\n** contained in the Technology Preview License Agreement accompanying\n** this package.\n**\n** GNU Lesser General Public License Usage\n** Alternatively, this file may be used under the terms of the GNU Lesser\n** General Public License version 2.1 as published by the Free Software\n** Foundation and appearing in the file LICENSE.LGPL included in the\n** packaging of this file. Please review the following information to\n** ensure the GNU Lesser General Public License version 2.1 requirements\n** will be met: http:\/\/www.gnu.org\/licenses\/old-licenses\/lgpl-2.1.html.\n**\n** In addition, as a special exception, Nokia gives you certain additional\n** rights. These rights are described in the Nokia Qt LGPL Exception\n** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.\n**\n** If you have questions regarding the use of this file, please contact\n** Nokia at qt-info@nokia.com.\n**\n**\n**\n**\n**\n**\n**\n**\n** $QT_END_LICENSE$\n**\n****************************************************************************\/\n\n#include \"simulatorvideorenderercontrol.h\"\n#include <qabstractvideosurface.h>\n#include <qvideoframe.h>\n#include <qvideosurfaceformat.h>\n#include <QFile>\n#include <QColor>\n#include <QPainter>\n\nQSimulatorVideoRendererControl::QSimulatorVideoRendererControl(QObject *parent) :\n QVideoRendererControl(parent)\n , mSurface(0)\n , mRunning(false)\n{\n}\n\nQSimulatorVideoRendererControl::~QSimulatorVideoRendererControl()\n{\n}\n\nQAbstractVideoSurface *QSimulatorVideoRendererControl::surface() const\n{\n return mSurface;\n}\n\nvoid QSimulatorVideoRendererControl::setSurface(QAbstractVideoSurface *surface)\n{\n mSurface = surface;\n}\n\nvoid QSimulatorVideoRendererControl::setImagePath(const QString &imagePath)\n{\n if (QFile::exists(imagePath)) {\n mImage = QImage(imagePath);\n } else {\n mImage = QImage(800, 600, QImage::Format_RGB32);\n mImage.fill(qRgb(200, 50, 50));\n QPainter painter(&mImage);\n painter.drawText(0, 0, 800, 600, Qt::AlignCenter, imagePath);\n }\n if (mRunning)\n start();\n}\n\nvoid QSimulatorVideoRendererControl::start()\n{\n if (!mSurface)\n return;\n stop();\n QVideoSurfaceFormat format(mImage.size(), QVideoFrame::Format_RGB32);\n mSurface->start(format);\n mSurface->present(mImage);\n mRunning = true;\n}\n\nvoid QSimulatorVideoRendererControl::stop()\n{\n if (!mSurface)\n return;\n\n if (mSurface->isActive())\n mSurface->stop();\n mRunning = false;\n}\n\nconst QImage * QSimulatorVideoRendererControl::image() const\n{\n return &mImage;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdio.h>\n#include <iostream>\n#include \"log4cpp\/Category.hh\"\n#include \"log4cpp\/Appender.hh\"\n#include \"log4cpp\/OstreamAppender.hh\"\n#include \"log4cpp\/Layout.hh\"\n#include \"log4cpp\/BasicLayout.hh\"\n#include \"log4cpp\/Priority.hh\"\n#include \"log4cpp\/NDC.hh\"\n\nint main(int argc, char** argv) { \n log4cpp::Appender* appender = \n new log4cpp::OstreamAppender(\"default\", &std::cout);\n\n log4cpp::Layout* layout = new log4cpp::BasicLayout();\n appender->setLayout(layout);\n\n log4cpp::Category& root = log4cpp::Category::getRoot();\n root.setAppender(appender);\n root.setPriority(log4cpp::Priority::ERROR);\n \n log4cpp::Category& sub1 = \n log4cpp::Category::getInstance(std::string(\"sub1\"));\n\n log4cpp::Category& sub2 = \n log4cpp::Category::getInstance(std::string(\"sub1.sub2\"));\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n \n sub1.setPriority(log4cpp::Priority::INFO);\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n std::cout << \"priority info\" << std::endl;\n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n\n sub2.warnStream() << \"streamed warn\";\n\n sub2 << log4cpp::Priority::WARN << \"warn2..\" << \"..warn3..value=\" << 0 << \n log4cpp::CategoryStream::ENDLINE << \"..warn4\";\n\n log4cpp::Category::shutdown();\n}\n<commit_msg>Added test line for printf style logging: ie. info(\"%s%d\", \"bla\", 123)<commit_after>#include <stdio.h>\n#include <iostream>\n#include \"log4cpp\/Category.hh\"\n#include \"log4cpp\/Appender.hh\"\n#include \"log4cpp\/OstreamAppender.hh\"\n#include \"log4cpp\/Layout.hh\"\n#include \"log4cpp\/BasicLayout.hh\"\n#include \"log4cpp\/Priority.hh\"\n#include \"log4cpp\/NDC.hh\"\n\nint main(int argc, char** argv) { \n log4cpp::Appender* appender = \n new log4cpp::OstreamAppender(\"default\", &std::cout);\n\n log4cpp::Layout* layout = new log4cpp::BasicLayout();\n appender->setLayout(layout);\n\n log4cpp::Category& root = log4cpp::Category::getRoot();\n root.setAppender(appender);\n root.setPriority(log4cpp::Priority::ERROR);\n \n log4cpp::Category& sub1 = \n log4cpp::Category::getInstance(std::string(\"sub1\"));\n\n log4cpp::Category& sub2 = \n log4cpp::Category::getInstance(std::string(\"sub1.sub2\"));\n\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n \n sub1.setPriority(log4cpp::Priority::INFO);\n std::cout << \" root priority = \" << root.getPriority() << std::endl;\n std::cout << \" sub1 priority = \" << sub1.getPriority() << std::endl;\n std::cout << \" sub2 priority = \" << sub2.getPriority() << std::endl;\n \n std::cout << \"priority info\" << std::endl;\n root.error(\"root error\");\n root.warn(\"root warn\");\n sub1.error(\"sub1 error\");\n sub1.warn(\"sub1 warn\");\n sub2.error(\"sub2 error\");\n sub2.warn(\"sub2 warn\");\n sub2.error(\"%s %s %d\", \"test\", \"vform\", 123);\n sub2.warnStream() << \"streamed warn\";\n\n sub2 << log4cpp::Priority::WARN << \"warn2..\" << \"..warn3..value=\" << 0 << \n log4cpp::CategoryStream::ENDLINE << \"..warn4\";\n\n log4cpp::Category::shutdown();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <smartref\/smartref.h>\n\n#include <type_traits>\n\nREFLECTABLE(member);\n\nnamespace tests {\n\nusing smartref::using_;\n\n\/\/! These tests check for existence of the member() member-function.\nnamespace test_existence {\n\ntemplate<typename T>\nconstexpr auto has_member(int) -> decltype(std::declval<T &>().member(), bool{}) {return true;}\ntemplate<typename T>\nconstexpr auto has_member(...) {return false;}\n\nstruct EmptyClass {};\n\nstruct NonConstMemberClass\n{\n void member() {}\n};\n\nstruct ConstMemberClass\n{\n void member() const {}\n};\n\nstruct MixedMemberClass\n{\n void member() {}\n void member() const {}\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ non-const member functions \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic_assert(!has_member<using_<EmptyClass>>(0),\n \"TEST FAILED: using_<EmptyClass> seems to have a member-function!\");\n\nstatic_assert(has_member<using_<NonConstMemberClass>>(0),\n \"TEST FAILED: using_<NonConstMemberClass> doesn't seem to have a member-function!\");\n\nstatic_assert(has_member<using_<ConstMemberClass>>(0),\n \"TEST FAILED: using_<ConstMemberClass> doesn't seem to have a member-function!\");\n\nstatic_assert(has_member<using_<MixedMemberClass>>(0),\n \"TEST FAILED: using_<MixedMemberClass> doesn't seem to have a member-function!\");\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ const member functions \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic_assert(!has_member<const using_<EmptyClass>>(0),\n \"TEST FAILED: const using_<EmptyClass> seems to have a const member-function!\");\n\nstatic_assert(!has_member<const using_<NonConstMemberClass>>(0),\n \"TEST FAILED: const using_<NonConstMemberClass> seem to have a const member-function!\");\n\nstatic_assert(has_member<const using_<ConstMemberClass>>(0),\n \"TEST FAILED: const using_<ConstMemberClass> doesn't seem to have a const member-function!\");\n\nstatic_assert(has_member<const using_<MixedMemberClass>>(0),\n \"TEST FAILED: const using_<MixedMemberClass> doesn't seem to have a const member-function!\");\n\n} \/\/ namespace test_existence\n} \/\/ namespace tests\n<commit_msg>Temporary work around for the __LINE__ conflict.<commit_after>#include <smartref\/smartref.h>\n\n#include <type_traits>\n\n\n\n\/\/ TODO: Fix the issue that causes conflicts when using REFLECTABLE from within two separate files on the same line.\nREFLECTABLE(member);\n\nnamespace tests {\n\nusing smartref::using_;\n\n\/\/! These tests check for existence of the member() member-function.\nnamespace test_existence {\n\ntemplate<typename T>\nconstexpr auto has_member(int) -> decltype(std::declval<T &>().member(), bool{}) {return true;}\ntemplate<typename T>\nconstexpr auto has_member(...) {return false;}\n\nstruct EmptyClass {};\n\nstruct NonConstMemberClass\n{\n void member() {}\n};\n\nstruct ConstMemberClass\n{\n void member() const {}\n};\n\nstruct MixedMemberClass\n{\n void member() {}\n void member() const {}\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ non-const member functions \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic_assert(!has_member<using_<EmptyClass>>(0),\n \"TEST FAILED: using_<EmptyClass> seems to have a member-function!\");\n\nstatic_assert(has_member<using_<NonConstMemberClass>>(0),\n \"TEST FAILED: using_<NonConstMemberClass> doesn't seem to have a member-function!\");\n\nstatic_assert(has_member<using_<ConstMemberClass>>(0),\n \"TEST FAILED: using_<ConstMemberClass> doesn't seem to have a member-function!\");\n\nstatic_assert(has_member<using_<MixedMemberClass>>(0),\n \"TEST FAILED: using_<MixedMemberClass> doesn't seem to have a member-function!\");\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ const member functions \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic_assert(!has_member<const using_<EmptyClass>>(0),\n \"TEST FAILED: const using_<EmptyClass> seems to have a const member-function!\");\n\nstatic_assert(!has_member<const using_<NonConstMemberClass>>(0),\n \"TEST FAILED: const using_<NonConstMemberClass> seem to have a const member-function!\");\n\nstatic_assert(has_member<const using_<ConstMemberClass>>(0),\n \"TEST FAILED: const using_<ConstMemberClass> doesn't seem to have a const member-function!\");\n\nstatic_assert(has_member<const using_<MixedMemberClass>>(0),\n \"TEST FAILED: const using_<MixedMemberClass> doesn't seem to have a const member-function!\");\n\n} \/\/ namespace test_existence\n} \/\/ namespace tests\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @author : xiaozhuai\n * @date : 17\/3\/19\n *\/\n\n#include \"EventLoop.h\"\n\nClientInfo* EventLoop::client_list[MAX_ALLOWED_CLIENT];\nstruct ev_loop* EventLoop::main_loop;\nev_io EventLoop::ev_io_accept;\nint EventLoop::serv_sock;\nhttp_parser_settings EventLoop::settings;\nstring EventLoop::listen_addr;\nint EventLoop::port;\n\nint EventLoop::on_url(http_parser *parser, const char *at, size_t length) {\n int fd = ((ClientInfo*)parser->data)->fd;\n string url(at, length);\n ClientInfo* client = client_list[fd];\n\n\n client->url = url;\n\n client->urlEndWithSlash = (url[url.length()-1] == '\/');\n\n client->parser = parser;\n\n string filePath = SERV_ENV.getAbsoluteWebRoot()+url;\n client->file = new FileHandler(filePath);\n LOGI(\"GET %s [%d]\", url, fd);\n return 0;\n}\n\nint EventLoop::on_message_complete(http_parser *parser) {\n int fd = ((ClientInfo*)parser->data)->fd;\n ClientInfo* client = client_list[fd];\n client->read_complete = true;\n LOGD(\"on_message_complete [%d]\", fd);\n\n return 0;\n}\n\nvoid EventLoop::close_client(int fd) {\n ClientInfo *client = client_list[fd];\n if(client != NULL){\n if(client->io!=NULL){\n ev_io_stop(main_loop, client->io);\n }\n delete(client);\n client_list[fd] = NULL;\n }\n}\n\nvoid EventLoop::accept_handler(struct ev_loop *loop, ev_io *ev_io_accept, int e) {\n struct sockaddr_in client_addr;\n socklen_t client_len = sizeof(client_addr);\n int client_sock;\n ev_io *ev_io_client = (struct ev_io*) malloc(sizeof(struct ev_io));\n if(ev_io_client == NULL) {\n LOGW(\"malloc error in accept_cb\");\n return ;\n }\n if(EV_ERROR & e) {\n LOGW(\"error event in accept\");\n return ;\n }\n client_sock = accept(ev_io_accept->fd, (struct sockaddr*)&client_addr, &client_len);\n if(client_sock < 0){\n LOGW(\"accept error\");\n return;\n }\n if(client_sock > MAX_ALLOWED_CLIENT) {\n LOGW(\"fd out of range [%d]\", client_sock);\n close(client_sock);\n return;\n }\n if(client_list[client_sock] != NULL) {\n printf(\"client_sock not NULL, fd is [%d]\\n\", client_sock);\n return;\n }\n LOGD(\"client connected [%d]\", client_sock);\n client_list[client_sock] = new ClientInfo(client_sock, ev_io_client);\n\n ev_io_init(ev_io_client, client_io_handler, client_sock, EV_READ | EV_WRITE);\n ev_io_start(main_loop, ev_io_client);\n}\n\nvoid EventLoop::client_io_handler(struct ev_loop *loop, struct ev_io *ev_io_client, int e) {\n\n int fd = ev_io_client->fd;\n ClientInfo* client = client_list[fd];\n\n if(EV_ERROR & e){\n LOGW(\"error client io event [%d]\", fd);\n close_client(fd);\n return;\n }\n\n if(EV_READ & e){\n LOGD(\"client io read event [%d]\", fd);\n char buffer[READ_SOCKET_BUFFER_MAX_SIZE+1]; \/\/ last byte '\\0'\n int n;\n if(ioctl(fd, FIONREAD, &n)){\n LOGW(\"ioctl socket FIONREAD err [%d]\", fd);\n close_client(fd);\n return;\n }\n\n size_t readSize = (size_t)(n<READ_SOCKET_BUFFER_MAX_SIZE ? n : READ_SOCKET_BUFFER_MAX_SIZE);\n\n size_t recved = (size_t)recv(fd, buffer, readSize, 0);\n if(recved < 0) {\n LOGW(\"read client err [%d]\", fd);\n return;\n }\n if(recved == 0) {\n LOGD(\"client disconnected [%d]\", fd);\n close_client(fd);\n return;\n } else {\n buffer[recved] = '\\0';\n \/\/LOGI(\"receive client message [%d]: %s\\n\", fd, buffer);\n http_parser *parser = client->parser;\n if(parser==NULL){\n parser = (http_parser *)malloc(sizeof(http_parser));\n http_parser_init(parser, HTTP_REQUEST);\n parser->data = client;\n }\n size_t nparsed = http_parser_execute(parser, &settings, buffer, recved);\n if (parser->upgrade) {\n LOGW(\"do not support protocol upgrade [%d]\", fd);\n close_client(fd);\n } else if (nparsed != recved) {\n LOGW(\"parse http error, msg: %s [%d]\", http_errno_description(parser->http_errno), fd);\n close_client(fd);\n }\n }\n return;\n }\n\n if((EV_WRITE & e) && client->read_complete){\n LOGD(\"client io write event [%d]\", fd);\n\n if(!ACCESS_RULE.permissible(client->url)){ \/\/ check permission in .efserv_access\n Response::respondErr(fd, 403);\n goto end_write;\n }\n\n if(!client->file->exist()){ \/\/ 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n\n if(outOfWebRoot(client)){\n Response::respondErr(fd, 403);\n goto end_write;\n }\n\n if(client->file->isFile()){ \/\/ is file\n\n if(client->urlEndWithSlash){ \/\/ if end with '\/', it's considered to be a directory, but it's a file, so 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n\n FILE* file_fp = client->file_fp;\n if(file_fp == NULL){\n file_fp = fopen(client->file->getAbsolutePath().c_str(), \"rb\");\n if(file_fp==NULL){ \/\/ 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n client->file_fp = file_fp;\n off_t content_length = client->file->size();\n Response::respondHeader(fd, client->file->getMimeType(), content_length);\n }\n\n\n if(feof(file_fp)) goto end_write;\n\n int file_fd = fileno(file_fp);\n int n;\n if(ioctl(file_fd, FIONREAD, &n)){\n LOGW(\"ioctl file FIONREAD err [%d]\", fd);\n close_client(fd);\n return;\n }\n\n char buffer[READ_FILE_BUFFER_MAX_SIZE];\n size_t readSize = (size_t)(n<READ_FILE_BUFFER_MAX_SIZE ? n : READ_FILE_BUFFER_MAX_SIZE);\n\n if(readSize==0) readSize ++; \/\/ attempt to reach eof\n\n size_t len = fread(buffer, 1, readSize, file_fp);\n\n if(len==0) goto wait_next_write;\n\n Response::respondContent(fd, buffer, len);\n goto wait_next_write;\n }else if(client->file->isDir()){ \/\/ is dir\n\n if(!client->urlEndWithSlash){ \/\/ if not end with '\/', it's considered to be a file, but it's a dir, redirect to add a '\/'\n Response::respondRedirection(fd, 301, client->url+\"\/\");\n goto end_write;\n }\n\n if(stoi(SERV_ENV.getConfig(KEY_DIR_INDEXS, DEFAULT_DIR_INDEXS))) { \/\/ dir indexs enable\n vector<FileHandler> files = client->file->listDir();\n Response::respondIndexs(fd, files, client->url);\n goto end_write;\n }else{ \/\/ of course 403\n Response::respondErr(fd, 403);\n goto end_write;\n }\n }else{ \/\/ 500\n Response::respondErr(fd, 500);\n goto end_write;\n }\n\n end_write:\n close_client(fd);\n\n wait_next_write:\n\n return;\n }\n\n\n\n\n}\n\n\n\nvoid EventLoop::init() {\n main_loop = ev_default_loop(0);\n\n settings.on_url = on_url;\n settings.on_message_complete = on_message_complete;\n\n Response::loadTpl();\n}\n\nvoid EventLoop::start() {\n serv_sock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n struct sockaddr_in serv_addr;\n memset(&serv_addr, 0, sizeof(serv_addr));\n serv_addr.sin_family = AF_INET;\n\n listen_addr = SERV_ENV.getConfig(KEY_LISTEN, DEFAULT_LISTEN);\n int port = stoi(SERV_ENV.getConfig(KEY_PORT, DEFAULT_PORT));\n\n serv_addr.sin_addr.s_addr = inet_addr(listen_addr.c_str());\n serv_addr.sin_port = htons(port);\n\n\n if( ::bind(serv_sock, (struct sockaddr*)&serv_addr, sizeof(serv_addr)) != 0 ){\n LOGE(\"addr bind error\");\n exit(1);\n }\n\n if( listen(serv_sock, SOMAXCONN) < 0 ) {\n LOGE(\"listen error\");\n exit(1);\n }\n\n int bReuseaddr=1;\n if(setsockopt(serv_sock, SOL_SOCKET, SO_REUSEADDR, (const char*)&bReuseaddr, sizeof(bReuseaddr)) != 0) {\n printf(\"set sock option error in reuse addr[%d]\", serv_sock);\n exit(1);\n }\n\n LOGI(\"Listen %s%s:%d%s ......\",\n ANSI_COLOR_BLUE,\n SERV_ENV.getConfig(KEY_LISTEN, DEFAULT_LISTEN),\n stoi(SERV_ENV.getConfig(KEY_PORT, DEFAULT_PORT)),\n ANSI_COLOR_NORMAL\n );\n\n ev_io_init(&ev_io_accept, accept_handler, serv_sock, EV_READ);\n ev_io_start(main_loop, &ev_io_accept);\n ev_run(main_loop, 0);\n\n}<commit_msg>type conversion<commit_after>\/**\n * @author : xiaozhuai\n * @date : 17\/3\/19\n *\/\n\n#include \"EventLoop.h\"\n\nClientInfo* EventLoop::client_list[MAX_ALLOWED_CLIENT];\nstruct ev_loop* EventLoop::main_loop;\nev_io EventLoop::ev_io_accept;\nint EventLoop::serv_sock;\nhttp_parser_settings EventLoop::settings;\nstring EventLoop::listen_addr;\nint EventLoop::port;\n\nint EventLoop::on_url(http_parser *parser, const char *at, size_t length) {\n int fd = ((ClientInfo*)parser->data)->fd;\n string url(at, length);\n ClientInfo* client = client_list[fd];\n\n\n client->url = url;\n\n client->urlEndWithSlash = (url[url.length()-1] == '\/');\n\n client->parser = parser;\n\n string filePath = SERV_ENV.getAbsoluteWebRoot()+url;\n client->file = new FileHandler(filePath);\n LOGI(\"GET %s [%d]\", url, fd);\n return 0;\n}\n\nint EventLoop::on_message_complete(http_parser *parser) {\n int fd = ((ClientInfo*)parser->data)->fd;\n ClientInfo* client = client_list[fd];\n client->read_complete = true;\n LOGD(\"on_message_complete [%d]\", fd);\n\n return 0;\n}\n\nvoid EventLoop::close_client(int fd) {\n ClientInfo *client = client_list[fd];\n if(client != NULL){\n if(client->io!=NULL){\n ev_io_stop(main_loop, client->io);\n }\n delete(client);\n client_list[fd] = NULL;\n }\n}\n\nvoid EventLoop::accept_handler(struct ev_loop *loop, ev_io *ev_io_accept, int e) {\n struct sockaddr_in client_addr;\n socklen_t client_len = sizeof(client_addr);\n int client_sock;\n ev_io *ev_io_client = (struct ev_io*) malloc(sizeof(struct ev_io));\n if(ev_io_client == NULL) {\n LOGW(\"malloc error in accept_cb\");\n return ;\n }\n if(EV_ERROR & e) {\n LOGW(\"error event in accept\");\n return ;\n }\n client_sock = accept(ev_io_accept->fd, (struct sockaddr*)&client_addr, &client_len);\n if(client_sock < 0){\n LOGW(\"accept error\");\n return;\n }\n if(client_sock > MAX_ALLOWED_CLIENT) {\n LOGW(\"fd out of range [%d]\", client_sock);\n close(client_sock);\n return;\n }\n if(client_list[client_sock] != NULL) {\n printf(\"client_sock not NULL, fd is [%d]\\n\", client_sock);\n return;\n }\n LOGD(\"client connected [%d]\", client_sock);\n client_list[client_sock] = new ClientInfo(client_sock, ev_io_client);\n\n ev_io_init(ev_io_client, client_io_handler, client_sock, EV_READ | EV_WRITE);\n ev_io_start(main_loop, ev_io_client);\n}\n\nvoid EventLoop::client_io_handler(struct ev_loop *loop, struct ev_io *ev_io_client, int e) {\n\n int fd = ev_io_client->fd;\n ClientInfo* client = client_list[fd];\n\n if(EV_ERROR & e){\n LOGW(\"error client io event [%d]\", fd);\n close_client(fd);\n return;\n }\n\n if(EV_READ & e){\n LOGD(\"client io read event [%d]\", fd);\n char buffer[READ_SOCKET_BUFFER_MAX_SIZE+1]; \/\/ last byte '\\0'\n int n;\n if(ioctl(fd, FIONREAD, &n)){\n LOGW(\"ioctl socket FIONREAD err [%d]\", fd);\n close_client(fd);\n return;\n }\n\n size_t readSize = (size_t)(n<READ_SOCKET_BUFFER_MAX_SIZE ? n : READ_SOCKET_BUFFER_MAX_SIZE);\n\n ssize_t recved = (size_t)recv(fd, buffer, readSize, 0);\n if(recved < 0) {\n LOGW(\"read client err [%d]\", fd);\n return;\n }\n if(recved == 0) {\n LOGD(\"client disconnected [%d]\", fd);\n close_client(fd);\n return;\n } else {\n buffer[recved] = '\\0';\n \/\/LOGI(\"receive client message [%d]: %s\\n\", fd, buffer);\n http_parser *parser = client->parser;\n if(parser==NULL){\n parser = (http_parser *)malloc(sizeof(http_parser));\n http_parser_init(parser, HTTP_REQUEST);\n parser->data = client;\n }\n size_t nparsed = http_parser_execute(parser, &settings, buffer, (size_t)recved);\n if (parser->upgrade) {\n LOGW(\"do not support protocol upgrade [%d]\", fd);\n close_client(fd);\n } else if (nparsed != (size_t)recved) {\n LOGW(\"parse http error, msg: %s [%d]\", http_errno_description(parser->http_errno), fd);\n close_client(fd);\n }\n }\n return;\n }\n\n if((EV_WRITE & e) && client->read_complete){\n LOGD(\"client io write event [%d]\", fd);\n\n if(!ACCESS_RULE.permissible(client->url)){ \/\/ check permission in .efserv_access\n Response::respondErr(fd, 403);\n goto end_write;\n }\n\n if(!client->file->exist()){ \/\/ 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n\n if(outOfWebRoot(client)){\n Response::respondErr(fd, 403);\n goto end_write;\n }\n\n if(client->file->isFile()){ \/\/ is file\n\n if(client->urlEndWithSlash){ \/\/ if end with '\/', it's considered to be a directory, but it's a file, so 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n\n FILE* file_fp = client->file_fp;\n if(file_fp == NULL){\n file_fp = fopen(client->file->getAbsolutePath().c_str(), \"rb\");\n if(file_fp==NULL){ \/\/ 404\n Response::respondErr(fd, 404);\n goto end_write;\n }\n client->file_fp = file_fp;\n off_t content_length = client->file->size();\n Response::respondHeader(fd, client->file->getMimeType(), content_length);\n }\n\n\n if(feof(file_fp)) goto end_write;\n\n int file_fd = fileno(file_fp);\n int n;\n if(ioctl(file_fd, FIONREAD, &n)){\n LOGW(\"ioctl file FIONREAD err [%d]\", fd);\n close_client(fd);\n return;\n }\n\n char buffer[READ_FILE_BUFFER_MAX_SIZE];\n size_t readSize = (size_t)(n<READ_FILE_BUFFER_MAX_SIZE ? n : READ_FILE_BUFFER_MAX_SIZE);\n\n if(readSize==0) readSize ++; \/\/ attempt to reach eof\n\n size_t len = fread(buffer, 1, readSize, file_fp);\n\n if(len==0) goto wait_next_write;\n\n Response::respondContent(fd, buffer, len);\n goto wait_next_write;\n }else if(client->file->isDir()){ \/\/ is dir\n\n if(!client->urlEndWithSlash){ \/\/ if not end with '\/', it's considered to be a file, but it's a dir, redirect to add a '\/'\n Response::respondRedirection(fd, 301, client->url+\"\/\");\n goto end_write;\n }\n\n if(stoi(SERV_ENV.getConfig(KEY_DIR_INDEXS, DEFAULT_DIR_INDEXS))) { \/\/ dir indexs enable\n vector<FileHandler> files = client->file->listDir();\n Response::respondIndexs(fd, files, client->url);\n goto end_write;\n }else{ \/\/ of course 403\n Response::respondErr(fd, 403);\n goto end_write;\n }\n }else{ \/\/ 500\n Response::respondErr(fd, 500);\n goto end_write;\n }\n\n end_write:\n close_client(fd);\n\n wait_next_write:\n\n return;\n }\n\n\n\n\n}\n\n\n\nvoid EventLoop::init() {\n main_loop = ev_default_loop(0);\n\n settings.on_url = on_url;\n settings.on_message_complete = on_message_complete;\n\n Response::loadTpl();\n}\n\nvoid EventLoop::start() {\n serv_sock = socket(AF_INET, SOCK_STREAM, IPPROTO_TCP);\n struct sockaddr_in serv_addr;\n memset(&serv_addr, 0, sizeof(serv_addr));\n serv_addr.sin_family = AF_INET;\n\n listen_addr = SERV_ENV.getConfig(KEY_LISTEN, DEFAULT_LISTEN);\n int port = stoi(SERV_ENV.getConfig(KEY_PORT, DEFAULT_PORT));\n\n serv_addr.sin_addr.s_addr = inet_addr(listen_addr.c_str());\n serv_addr.sin_port = htons(port);\n\n\n if( ::bind(serv_sock, (struct sockaddr*)&serv_addr, sizeof(serv_addr)) != 0 ){\n LOGE(\"addr bind error\");\n exit(1);\n }\n\n if( listen(serv_sock, SOMAXCONN) < 0 ) {\n LOGE(\"listen error\");\n exit(1);\n }\n\n int bReuseaddr=1;\n if(setsockopt(serv_sock, SOL_SOCKET, SO_REUSEADDR, (const char*)&bReuseaddr, sizeof(bReuseaddr)) != 0) {\n printf(\"set sock option error in reuse addr[%d]\", serv_sock);\n exit(1);\n }\n\n LOGI(\"Listen %s%s:%d%s ......\",\n ANSI_COLOR_BLUE,\n SERV_ENV.getConfig(KEY_LISTEN, DEFAULT_LISTEN),\n stoi(SERV_ENV.getConfig(KEY_PORT, DEFAULT_PORT)),\n ANSI_COLOR_NORMAL\n );\n\n ev_io_init(&ev_io_accept, accept_handler, serv_sock, EV_READ);\n ev_io_start(main_loop, &ev_io_accept);\n ev_run(main_loop, 0);\n\n}<|endoftext|>"} {"text":"<commit_before>#include <gtest\/gtest.h>\n#include \"stan\/prob\/distributions_uniform.hpp\"\n#include \"stan\/agrad\/agrad.hpp\"\n\nusing stan::agrad::var;\n\ntemplate<typename T_y, typename T_lb, typename T_ub, bool propto=true>\nvar getResult(T_y y1, T_y y2, T_lb lb, T_ub ub) {\n return stan::prob::uniform_log<propto,T_y,T_lb,T_ub>(y1,lb,ub) \n - stan::prob::uniform_log<propto,T_y,T_lb,T_ub>(y2,lb,ub);\n}\n\nclass AgradDistributionsPropto : public testing::Test {\n protected:\n virtual void SetUp() {\n y1 = 0.3;\n y2 = 5.0;\n lb = 0.5;\n ub = 11.0;\n \n expected = getResult<var,var,var,false>(y1,y2,lb,ub);\n }\n double y1;\n double y2;\n double lb;\n double ub;\n var expected;\n var result;\n};\nTEST_F(AgradDistributionsPropto,Uniform) {\n result = getResult<var,var,var>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformY) {\n result = getResult<double,var,var>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformYLb) {\n result = getResult<double,double,var>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformYUb) {\n result = getResult<double,var,double>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformLb) {\n result = getResult<var,double,var>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformLbUb) {\n result = getResult<var,double,double>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\nTEST_F(AgradDistributionsPropto,UniformUb) {\n result = getResult<var,var,double>(y1,y2,lb,ub);\n EXPECT_FLOAT_EQ(expected.val(),result.val());\n}\n<commit_msg>refactoring distributions: uniform<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"MEMCARD.H\"\n\n#include \"SPECIFIC.H\"\n\n#include <LIBMCRD.H>\n\nunsigned char mcInit;\nunsigned char mcStatus;\nunsigned long mcNumFiles;\nunsigned char mcBlocksFree;\nchar mcFileNames[7][20];\nint mcFileLengths[7];\nstatic unsigned char mcActualStatus;\n\nint dword_A1AA0 = 0x2A;\/\/init me 0x2a? looks like name string\n\nvoid mcDir()\/\/61EE8\n{\n\tint i; \/\/ $s3\n\tint j; \/\/ $s4\n\tint k; \/\/ $s1\n\tstruct DIRENTRY* dir;\/\/ $s2\n\n#if 0\n\tint a0 = 0;\n\tint a1 = dword_A1AA0;\n\t\t\t\t \n\t\t\t\t\n\t\/\/lui\t$v0, 0x001F0000\n\t\/\/sw\t$s2, 0x30 + var_10($sp)\n\tstruct TSV* a2 = &tsv_buffer[0];\n\t\n\t\/\/sw\t$s0, 0x30 + var_18($sp)\n\tint s0 = 0xF;\n\ta3 = &mcNumFiles;\n\t\/\/sw\t$ra, 0x30 + var_4($sp)\n\t\/\/sw\t$s4, 0x30 + var_8($sp)\n\t\/\/sw\t$s3, 0x30 + var_C($sp)\n\t\/\/sw\t$s1, 0x30 + var_14($sp)\n\t\/\/sw\t$zero, 0x30 + var_20($sp)\n\t\t\t\t\n\tMemCardGetDirentry(0, dword_A1AA0, &tsv_buffer[0], &mcNumFiles, 0, 0);\/\/\tjal\tsub_6B08C\n\t\/\/sw\t$s0, 0x30 + var_1C($sp)\n\tint s4 = 0;\/\/j\n\tint s3 = 0;\/\/i\n\t\n\tlw\t$v0, 0x41E0($gp)\n\tsb\t$s0, 0x41DC($gp)\n\tbeqz\t$v0, loc_62028\n\tmove\t$s1, $zero\n\tmove\t$s0, $s2\n\taddiu\t$s2, $gp, 0x41E4\n\n\t\t\t\t loc_61F50:\n\t\t\t lw\t$v0, 0x18($s0)\n\t\t\t\t nop\n\t\t\t\t addiu\t$v1, $v0, 0x1FFF\n\t\t\t\t bgez\t$v1, loc_61F68\n\t\t\t\t move\t$a1, $s0\n\t\t\t\t addiu\t$v1, $v0, 0x3FFE\n\n\t\t\t\t loc_61F68:\n\t\t\t sra\t$v1, 13\n\t\t\t\t lbu\t$v0, 0x41DC($gp)\n\t\t\t\t lw\t$a0, dword_800A202C\n\t\t\t\t subu\t$v0, $v1\n\t\t\t\t sb\t$v0, 0x41DC($gp)\n\t\t\t\t lhu\t$v1, 0x194($a0)\n\t\t\t\t lw\t$a0, dword_800A203C\n\t\t\t\t li\t$a2, 0xC\n\t\t\t\t jal\tsub_68A84\n\t\t\t\t addu\t$a0, $v1\n\t\t\t\t bnez\t$v0, loc_62014\n\t\t\t\t nop\n\t\t\t\t lwl\t$v0, 3($s0)\n\t\t\t\t lwr\t$v0, 0($s0)\n\t\t\t\t lwl\t$v1, 7($s0)\n\t\t\t\t lwr\t$v1, 4($s0)\n\t\t\t\t lwl\t$a0, 0xB($s0)\n\t\t\t\t lwr\t$a0, 8($s0)\n\t\t\t\t lwl\t$a1, 0xF($s0)\n\t\t\t\t lwr\t$a1, 0xC($s0)\n\t\t\t\t swl\t$v0, 3($s2)\n\t\t\t\t swr\t$v0, 0($s2)\n\t\t\t\t swl\t$v1, 7($s2)\n\t\t\t\t swr\t$v1, 4($s2)\n\t\t\t\t swl\t$a0, 0xB($s2)\n\t\t\t\t swr\t$a0, 8($s2)\n\t\t\t\t swl\t$a1, 0xF($s2)\n\t\t\t\t swr\t$a1, 0xC($s2)\n\t\t\t\t lwl\t$v0, 0x13($s0)\n\t\t\t\t lwr\t$v0, 0x10($s0)\n\t\t\t\t nop\n\t\t\t\t swl\t$v0, 0x13($s2)\n\t\t\t\t swr\t$v0, 0x10($s2)\n\t\t\t\t addiu\t$s2, 0x14\n\t\t\t\t sll\t$v0, $s4, 2\n\t\t\t\t addiu\t$s4, 1\n\t\t\t\t addiu\t$s1, 1\n\t\t\t\t addiu\t$v1, $gp, 0x4274\n\t\t\t\t lw\t$a0, 0x18($s0)\n\t\t\t\t addu\t$v0, $v1\n\t\t\t\t sw\t$a0, 0($v0)\n\n\t\t\t\t loc_62014:\n\t\t\t lw\t$v0, 0x41E0($gp)\n\t\t\t\t addiu\t$s3, 1\n\t\t\t\t sltu\t$v0, $s3, $v0\n\t\t\t\t bnez\t$v0, loc_61F50\n\t\t\t\t addiu\t$s0, 0x28\n\n\t\t\t\t loc_62028 :\n\t\t\t\t lw\t$ra, 0x30 + var_4($sp)\n\t\t\t\t lw\t$s4, 0x30 + var_8($sp)\n\t\t\t\t lw\t$s3, 0x30 + var_C($sp)\n\t\t\t\t lw\t$s2, 0x30 + var_10($sp)\n\t\t\t\t sw\t$s1, 0x41E0($gp)\n\t\t\t\t lw\t$s1, 0x30 + var_14($sp)\n\t\t\t\t lw\t$s0, 0x30 + var_18($sp)\n\t\t\t\t jr\t$ra\n\t\t\t\t addiu\t$sp, 0x30\n\t\t\t\t # End of function sub_61EE8\n#endif\n\n}\n\nvoid mcOpen(int sync)\/\/6204C(<), 62730(<) (F)\n{\n\tint i;\n\n\tmcInit = 1;\n\tmcNumFiles = 0;\n\tmcBlocksFree = 0;\n\tmcStatus = 4;\n\tmcActualStatus = 0;\n\n\tMemCardStart();\n\n\tif (sync != 0)\n\t{\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\t\/\/loc_62084\n\t\t\tmcGetStatus();\n\t\t\tVSync(0);\n\t\t}\n\t}\n\n\t\/\/loc_6209C\n\treturn;\n}\n\nvoid mcClose()\/\/620AC\n{\n\tMemCardStop();\n\tmcInit = 0;\n\t\n\treturn;\n}\n\nunsigned char mcGetStatus()\/\/620CC, \n{\n\tlong stat; \/\/ $a0\n\tunsigned long cmd; \/\/ stack offset -16\n\tunsigned long res; \/\/ stack offset -12\n#if 0\n\n\n\tint a0 = 1;\n\n\t\/\/addiu\t$a1, $sp, 0x20 + var_10\n\t\/\/addiu\t$a2, $sp, 0x20 + var_C\n\t\/\/sw\t$ra, 0x20 + var_4($sp)\n\n\tint v0 = 3;\n\tstat = MemCardSync(a0, &cmd, &res);\n\tif (stat != 0)\n\t{\n\t\tif (stat < 0)\n\t\t{\n\t\t\tif (stat == -1)\n\t\t\t{\n\t\t\t\t\/\/loc_62120\n\t\t\t\tMemCardExist(0);\n\t\t\t}\/\/ j\tloc_622C4 else on outer most brace\n\t\t}\n\t\t\n\t\t\/\/loc_62110\n\t\tv0 = 2;\n\t\tif (stat == 1)\n\t\t{\n\t\t\t\/\/loc_62178\n\n\t\t}\/\/j\tloc_622C4\n\n\t}\/\/loc_62130\n\n\t\/\/sw\t$s0, 0x20 + var_8($sp)\n\n\t\t\t\t\n\t\t\t\t\n\n\n\t\t\t\t loc_62130 :\n\t\t\t lw\t$v1, 0x20 + var_10($sp)\n\t\t\t\t nop\n\t\t\t\t bne\t$v1, $v0, loc_62150\n\t\t\t\t li\t$v0, 6\n\t\t\t\t li\t$v0, 5\n\t\t\t\t sb\t$v0, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62150 :\n\t\t\t bne\t$v1, $v0, loc_62164\n\t\t\t\t li\t$v0, 2\n\t\t\t\t sb\t$v1, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62164 :\n\t\t\t bne\t$v1, $v0, loc_622C4\n\t\t\t\t li\t$v0, 4\n\t\t\t\t sb\t$v0, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62178 :\n\t\t\t lw\t$v1, 0x20 + var_10($sp)\n\t\t\t\t nop\n\t\t\t\t beq\t$v1, $v0, loc_62210\n\t\t\t\t sltiu\t$v0, $v1, 3\n\t\t\t\t beqz\t$v0, loc_621A0\n\t\t\t\t li\t$s0, 3\n\t\t\t\t beq\t$v1, $a0, loc_621B8\n\t\t\t\t nop\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_621A0 :\n\t\t\t beq\t$v1, $s0, loc_6227C\n\t\t\t\t li\t$v0, 6\n\t\t\t\t beq\t$v1, $v0, loc_62298\n\t\t\t\t nop\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_621B8 :\n\t\t\t lw\t$v1, 0x20 + var_C($sp)\n\t\t\t\t nop\n\t\t\t\t beqz\t$v1, loc_621D8\n\t\t\t\t li\t$v0, 3\n\t\t\t\t beq\t$v1, $v0, loc_621EC\n\t\t\t\t li\t$v0, 1\n\t\t\t\t j\tloc_62204\n\t\t\t\t nop\n\n\t\t\t\t loc_621D8 :\n\t\t\t lbu\t$v0, 0x41D8($gp)\n\t\t\t\t nop\n\t\t\t\t sb\t$v0, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_621EC :\n\t\t\t jal\tsub_6A6E4\n\t\t\t\t move\t$a0, $zero\n\t\t\t\t li\t$v1, 4\n\t\t\t\t sb\t$v1, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62204 :\n\t\t\t sb\t$v0, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62210 :\n\t\t\t lw\t$a0, 0x20 + var_C($sp)\n\t\t\t\t li\t$v0, 3\n\t\t\t\t beq\t$a0, $v0, loc_62248\n\t\t\t\t sltiu\t$v0, $a0, 4\n\t\t\t\t beqz\t$v0, loc_62238\n\t\t\t\t li\t$v0, 4\n\t\t\t\t beqz\t$a0, loc_6228C\n\t\t\t\t li\t$v0, 3\n\t\t\t\t j\tloc_6226C\n\t\t\t\t nop\n\n\t\t\t\t loc_62238 :\n\t\t\t beq\t$a0, $v0, loc_6225C\n\t\t\t\t li\t$v0, 3\n\t\t\t\t j\tloc_6226C\n\t\t\t\t nop\n\n\t\t\t\t loc_62248 :\n\t\t\t jal\tsub_61EE8\n\t\t\t\t nop\n\t\t\t\t sb\t$zero, 0x41D8($gp)\n\t\t\t\t j\tloc_6228C\n\t\t\t\t nop\n\n\t\t\t\t loc_6225C :\n\t\t\t sb\t$v1, 0x4270($gp)\n\t\t\t\t sb\t$v1, 0x41D8($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_6226C :\n\t\t\t sb\t$v0, 0x4270($gp)\n\t\t\t\t sb\t$v0, 0x41D8($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_6227C :\n\t\t\t lw\t$v0, 0x20 + var_C($sp)\n\t\t\t\t nop\n\t\t\t\t bnez\t$v0, loc_622B8\n\t\t\t\t nop\n\n\t\t\t\t loc_6228C :\n\t\t\t sb\t$zero, 0x4270($gp)\n\t\t\t\t j\tloc_622C4\n\t\t\t\t nop\n\n\t\t\t\t loc_62298 :\n\t\t\t lw\t$v0, 0x20 + var_C($sp)\n\t\t\t\t nop\n\t\t\t\t bnez\t$v0, loc_622B8\n\t\t\t\t nop\n\t\t\t\t jal\tsub_61EE8\n\t\t\t\t nop\n\t\t\t\t j\tloc_6228C\n\t\t\t\t nop\n\n\t\t\t\t loc_622B8 :\n\t\t\t jal\tsub_6A6E4\n\t\t\t\t move\t$a0, $zero\n\t\t\t\t sb\t$s0, 0x4270($gp)\n\n\t\t\t\t loc_622C4 :\n\t\t\t\t lbu\t$v0, 0x4270($gp)\n\t\t\t\t lw\t$ra, 0x20 + var_4($sp)\n\t\t\t\t lw\t$s0, 0x20 + var_8($sp)\n\t\t\t\t jr\t$ra\n\t\t\t\t addiu\t$sp, 0x20\n\t\t\t\t # End of function sub_620CC\n#endif\n\n\t\t\t\t return -1;\n}\n\nlong mcFormat()\/\/622D8(<), 629BC(<) (F)\n{\n\tunsigned long cmd;\n\tunsigned long res;\n\n\tMemCardSync(0, &cmd, &res);\n\n\tres = MemCardFormat(0);\n\tif (res == 0)\n\t{\n\t\tmcActualStatus = 0;\n\t\tmcDir();\n\t}\n\n\t\/\/loc_6230C\n\treturn res;\n}<commit_msg>Add mcGetStatus<commit_after>#include \"MEMCARD.H\"\n\n#include \"SPECIFIC.H\"\n\n#include <LIBMCRD.H>\n\nunsigned char mcInit;\nunsigned char mcStatus;\nunsigned long mcNumFiles;\nunsigned char mcBlocksFree;\nchar mcFileNames[7][20];\nint mcFileLengths[7];\nstatic unsigned char mcActualStatus;\n\nint dword_A1AA0 = 0x2A;\/\/init me 0x2a? looks like name string\n\nvoid mcDir()\/\/61EE8\n{\n\tint i; \/\/ $s3\n\tint j; \/\/ $s4\n\tint k; \/\/ $s1\n\tstruct DIRENTRY* dir;\/\/ $s2\n\n#if 0\n\tint a0 = 0;\n\tint a1 = dword_A1AA0;\n\t\t\t\t \n\t\t\t\t\n\t\/\/lui\t$v0, 0x001F0000\n\t\/\/sw\t$s2, 0x30 + var_10($sp)\n\tstruct TSV* a2 = &tsv_buffer[0];\n\t\n\t\/\/sw\t$s0, 0x30 + var_18($sp)\n\tint s0 = 0xF;\n\ta3 = &mcNumFiles;\n\t\/\/sw\t$ra, 0x30 + var_4($sp)\n\t\/\/sw\t$s4, 0x30 + var_8($sp)\n\t\/\/sw\t$s3, 0x30 + var_C($sp)\n\t\/\/sw\t$s1, 0x30 + var_14($sp)\n\t\/\/sw\t$zero, 0x30 + var_20($sp)\n\t\t\t\t\n\tMemCardGetDirentry(0, dword_A1AA0, &tsv_buffer[0], &mcNumFiles, 0, 0);\/\/\tjal\tsub_6B08C\n\t\/\/sw\t$s0, 0x30 + var_1C($sp)\n\tint s4 = 0;\/\/j\n\tint s3 = 0;\/\/i\n\t\n\tlw\t$v0, 0x41E0($gp)\n\tsb\t$s0, 0x41DC($gp)\n\tbeqz\t$v0, loc_62028\n\tmove\t$s1, $zero\n\tmove\t$s0, $s2\n\taddiu\t$s2, $gp, 0x41E4\n\n\t\t\t\t loc_61F50:\n\t\t\t lw\t$v0, 0x18($s0)\n\t\t\t\t nop\n\t\t\t\t addiu\t$v1, $v0, 0x1FFF\n\t\t\t\t bgez\t$v1, loc_61F68\n\t\t\t\t move\t$a1, $s0\n\t\t\t\t addiu\t$v1, $v0, 0x3FFE\n\n\t\t\t\t loc_61F68:\n\t\t\t sra\t$v1, 13\n\t\t\t\t lbu\t$v0, 0x41DC($gp)\n\t\t\t\t lw\t$a0, dword_800A202C\n\t\t\t\t subu\t$v0, $v1\n\t\t\t\t sb\t$v0, 0x41DC($gp)\n\t\t\t\t lhu\t$v1, 0x194($a0)\n\t\t\t\t lw\t$a0, dword_800A203C\n\t\t\t\t li\t$a2, 0xC\n\t\t\t\t jal\tsub_68A84\n\t\t\t\t addu\t$a0, $v1\n\t\t\t\t bnez\t$v0, loc_62014\n\t\t\t\t nop\n\t\t\t\t lwl\t$v0, 3($s0)\n\t\t\t\t lwr\t$v0, 0($s0)\n\t\t\t\t lwl\t$v1, 7($s0)\n\t\t\t\t lwr\t$v1, 4($s0)\n\t\t\t\t lwl\t$a0, 0xB($s0)\n\t\t\t\t lwr\t$a0, 8($s0)\n\t\t\t\t lwl\t$a1, 0xF($s0)\n\t\t\t\t lwr\t$a1, 0xC($s0)\n\t\t\t\t swl\t$v0, 3($s2)\n\t\t\t\t swr\t$v0, 0($s2)\n\t\t\t\t swl\t$v1, 7($s2)\n\t\t\t\t swr\t$v1, 4($s2)\n\t\t\t\t swl\t$a0, 0xB($s2)\n\t\t\t\t swr\t$a0, 8($s2)\n\t\t\t\t swl\t$a1, 0xF($s2)\n\t\t\t\t swr\t$a1, 0xC($s2)\n\t\t\t\t lwl\t$v0, 0x13($s0)\n\t\t\t\t lwr\t$v0, 0x10($s0)\n\t\t\t\t nop\n\t\t\t\t swl\t$v0, 0x13($s2)\n\t\t\t\t swr\t$v0, 0x10($s2)\n\t\t\t\t addiu\t$s2, 0x14\n\t\t\t\t sll\t$v0, $s4, 2\n\t\t\t\t addiu\t$s4, 1\n\t\t\t\t addiu\t$s1, 1\n\t\t\t\t addiu\t$v1, $gp, 0x4274\n\t\t\t\t lw\t$a0, 0x18($s0)\n\t\t\t\t addu\t$v0, $v1\n\t\t\t\t sw\t$a0, 0($v0)\n\n\t\t\t\t loc_62014:\n\t\t\t lw\t$v0, 0x41E0($gp)\n\t\t\t\t addiu\t$s3, 1\n\t\t\t\t sltu\t$v0, $s3, $v0\n\t\t\t\t bnez\t$v0, loc_61F50\n\t\t\t\t addiu\t$s0, 0x28\n\n\t\t\t\t loc_62028 :\n\t\t\t\t lw\t$ra, 0x30 + var_4($sp)\n\t\t\t\t lw\t$s4, 0x30 + var_8($sp)\n\t\t\t\t lw\t$s3, 0x30 + var_C($sp)\n\t\t\t\t lw\t$s2, 0x30 + var_10($sp)\n\t\t\t\t sw\t$s1, 0x41E0($gp)\n\t\t\t\t lw\t$s1, 0x30 + var_14($sp)\n\t\t\t\t lw\t$s0, 0x30 + var_18($sp)\n\t\t\t\t jr\t$ra\n\t\t\t\t addiu\t$sp, 0x30\n\t\t\t\t # End of function sub_61EE8\n#endif\n\n}\n\nvoid mcOpen(int sync)\/\/6204C(<), 62730(<) (F)\n{\n\tint i;\n\n\tmcInit = 1;\n\tmcNumFiles = 0;\n\tmcBlocksFree = 0;\n\tmcStatus = 4;\n\tmcActualStatus = 0;\n\n\tMemCardStart();\n\n\tif (sync != 0)\n\t{\n\t\tfor (i = 0; i < 4; i++)\n\t\t{\n\t\t\t\/\/loc_62084\n\t\t\tmcGetStatus();\n\t\t\tVSync(0);\n\t\t}\n\t}\n\n\t\/\/loc_6209C\n\treturn;\n}\n\nvoid mcClose()\/\/620AC\n{\n\tMemCardStop();\n\tmcInit = 0;\n\t\n\treturn;\n}\n\nunsigned char mcGetStatus()\/\/620CC(<), ? (F)\n{\n\tlong stat;\n\tunsigned long cmd;\n\tunsigned long res;\n\n\tstat = MemCardSync(1, &cmd, &res);\n\t\n\t\/\/Locked, Asynchronous memory card function is running.\n\tif (stat == 0)\n\t{\n\t\t\/\/loc_62130\n\t\tif(cmd == McFuncReadFile)\n\t\t{\n\t\t\treturn mcStatus = 5;\n\t\t}\n\t\telse if(cmd == McFuncWriteData)\n\t\t{\n\t\t\t\/\/loc_62150\n\t\t\treturn mcStatus = 6;\n\t\t}\n\t\telse if(cmd == McFuncAccept)\n\t\t{\n\t\t\t\/\/loc_62164\n\t\t\treturn mcStatus = 4;\n\t\t}\n\t}\n\telse if(stat > 0)\n\t{\n\t\t\/\/loc_62110\n\t\tif(stat == 1)\n\t\t{\n\t\t\t\/\/loc_62178\n\t\t\tif(cmd == McFuncAccept)\n\t\t\t{\n\t\t\t\t\/\/loc_62210\n\t\t\t\tif(res == 3)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_62248\n\t\t\t\t\tmcDir();\n\t\t\t\t\tmcActualStatus = 0;\n\t\t\t\t\tmcStatus = 0;\n\t\t\t\t}\n\t\t\t\telse if(res > 3)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_62238\n\t\t\t\t\tif(res == 4)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/loc_6225C\n\t\t\t\t\t\tmcActualStatus = mcStatus = cmd;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tmcActualStatus = mcStatus = 3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if(res == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_6228C\n\t\t\t\t\tmcStatus = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tmcActualStatus = mcStatus = 3;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\treturn 3;\n\t\t\t}\n\t\t\telse if(cmd > McFuncAccept)\n\t\t\t{\n\t\t\t\t\/\/loc_621A0\n\t\t\t\tif(cmd == McFuncReadFile)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_6227C\n\t\t\t\t\tif(res != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/loc_622B8\n\t\t\t\t\t\tMemCardAccept(0);\n\t\t\t\t\t\tmcStatus = 3;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/loc_6228C\n\t\t\t\t\t\tmcStatus = 0;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\treturn res;\n\t\t\t\t}\n\t\t\t\telse if(cmd == McFuncWriteData)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_62298\n\t\t\t\t\tif(res != 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tMemCardAccept(0);\n\t\t\t\t\t\tmcStatus = 3;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tmcStatus = 0;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\treturn res;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\treturn 6;\n\t\t\t}\n\t\t\telse if(cmd == stat)\n\t\t\t{\n\t\t\t\t\/\/loc_621B8\n\t\t\t\tif(res == 0)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_621D8\n\t\t\t\t\treturn mcStatus = mcActualStatus;\n\t\t\t\t}\n\t\t\t\telse if(res == 3)\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_621EC\n\t\t\t\t\tMemCardAccept(0);\n\t\t\t\t\tmcStatus = 4;\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/loc_62204\n\t\t\t\t\tmcStatus = 1;\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn 2;\n\t}\n\telse if(stat == -1)\n\t{\n\t\t\/\/loc_62120\n\t\tMemCardExist(0);\n\t}\n\t\n\treturn -1;\n}\n\nlong mcFormat()\/\/622D8(<), 629BC(<) (F)\n{\n\tunsigned long cmd;\n\tunsigned long res;\n\n\tMemCardSync(0, &cmd, &res);\n\n\tres = MemCardFormat(0);\n\tif (res == 0)\n\t{\n\t\tmcActualStatus = 0;\n\t\tmcDir();\n\t}\n\n\t\/\/loc_6230C\n\treturn res;\n}<|endoftext|>"} {"text":"<commit_before>\/*\t____________________________________________________________________________\n\n\t Scanner Component for the Micro A Compiler\n\n\t mscan.h\n\n\t Version 2007 - 2016\n \n\t James L. Richards\n\t Last Update: August 28, 2007\n\t \t Nelson A Castillo\n\t Last Update: January 31, 2016\n\n\tThe routines in this unit are based on those provided in the book \n\t\"Crafting A Compiler\" by Charles N. Fischer and Richard J. LeBlanc, Jr., \n\tBenjamin Cummings Publishing Co. (1991).\n\n\tSee Section 2.2, pp. 25-29.\n\t____________________________________________________________________________\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\nusing namespace std;\n\nextern ifstream sourceFile;\nextern ofstream outFile, listFile;\n\n#include \"mscan.h\"\n\n\/\/ *******************\n\/\/ ** Constructor **\n\/\/ *******************\n\nScanner::Scanner()\n{\n\ttokenBuffer = \"\";\n\tlineBuffer = \"\";\n\tlineNumber = 0;\n}\n\n\/\/ ********************************\n\/\/ ** Private Member Functions **\n\/\/ ********************************\n\nvoid Scanner::BufferChar(char c)\n{\n\tif (tokenBuffer.length() < ID_STRING_LEN){\n\t\ttokenBuffer += c;\n\t}\n\t\/\/cerr << tokenBuffer << endl;\n}\nvoid Scanner::BufferString(char c)\n{\n\tstringBuffer += c;\n\t\/\/cerr << tokenBuffer << endl;\n}\n\nToken Scanner::CheckReserved()\n{\n\tif (tolower(tokenBuffer) == \"bool\") return BOOL_SYM;\n\tif (tolower(tokenBuffer) == \"break\") return BREAK_SYM;\n\tif (tolower(tokenBuffer) == \"case\") return CASE_SYM;\n\tif (tolower(tokenBuffer) == \"cheese\") return CHEESE_SYM;\n\tif (tolower(tokenBuffer) == \"decs\") return DECS_SYM;\n\tif (tolower(tokenBuffer) == \"do\") return DO_SYM;\n\tif (tolower(tokenBuffer) == \"else\") return ELSE_SYM;\n\tif (tolower(tokenBuffer) == \"end\") return END_SYM;\n\tif (tolower(tokenBuffer) == \"false\") return FALSE_SYM;\n\tif (tolower(tokenBuffer) == \"float\") return FLOAT_SYM;\n\tif (tolower(tokenBuffer) == \"for\") return FOR_SYM;\n\tif (tolower(tokenBuffer) == \"hiphip\") return HIPHIP_SYM;\n\tif (tolower(tokenBuffer) == \"if\") return IF_SYM;\n\tif (tolower(tokenBuffer) == \"int\") return INT_SYM;\n\tif (tolower(tokenBuffer) == \"listen\") return LISTEN_SYM;\n\tif (tolower(tokenBuffer) == \"otherwise\") return OTHERWISE_SYM;\n\tif (tolower(tokenBuffer) == \"select\") return SELECT_SYM;\n\tif (tolower(tokenBuffer) == \"shout\") return SHOUT_SYM;\n\tif (tolower(tokenBuffer) == \"then\") return THEN_SYM;\n\tif (tolower(tokenBuffer) == \"true\") return TRUE_SYM;\n\tif (tolower(tokenBuffer) == \"while\") return WHILE_SYM;\n\n\treturn ID;\n}\n\nvoid Scanner::ClearBuffer()\n{\n\ttokenBuffer = \"\";\n\tstringBuffer = \"\";\n}\n\nvoid Scanner::LexicalError(char& c, string& errorExp=\"\")\n{\t\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber+1 << '.' << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber+1 << '.' << endl;\n\tif(errorExp!=\"\"){\n\t\t\/\/TODO :: I was starting with the comment but \n\t\t\/\/I need to ampliate the code \n\t}\n\tc = NextChar();\n}\n\nchar Scanner::NextChar()\n{\n\tchar c;\n\n\tsourceFile.get(c);\n\tif (c == '\\n')\n\t{\n\t\tlistFile.width(6);\n\t\tlistFile << ++lineNumber << \" \" << lineBuffer << endl;\n\t\tlineBuffer = \"\";\n\t} else{\n\t\tlineBuffer += c;\n\t}\n\treturn c;\n}\n\n\/\/ *******************************\n\/\/ ** Public Member Functions **\n\/\/ *******************************\n\nToken Scanner::GetNextToken()\n{\n\tchar currentChar, c;\n\n\tClearBuffer();\n\tcurrentChar = NextChar();\n\twhile (!sourceFile.eof())\n\t{\n\t\tif (isspace(currentChar)){\n\t\t\tcurrentChar = NextChar(); \/\/ do nothing\n\t\t} else if (isalpha(currentChar))\n\t\t{ \/\/ identifier\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isalnum(c) || c == '_')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\treturn CheckReserved();\n\t\t} else if (isdigit(currentChar)){ \/\/ integer or float literals\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isdigit(c))\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\t\/* Check if it is a float *\/\n\t\t\tif (c == '.')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tc = sourceFile.peek();\n\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\twhile (isdigit(c))\n\t\t\t\t{\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t}\n\t\t\t\tif (c == 'e' || c == 'E')\n\t\t\t\t{\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif(c != '+' && c!= '-'){\n\t\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\t\t}\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\twhile (isdigit(c))\n\t\t\t\t\t{\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn FLOAT_LIT;\n\t\t\t}\n\t\t\treturn INT_LIT;\n\t\t} else if (currentChar == '\"'){\n\t\t\t\/\/ string literal\n\t\t\t\/\/ BufferString(currentChar);\n\t\t\tdo\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\/\/ cout << currentChar <<endl;\n\t\t\t\tif(currentChar == '\"' & sourceFile.peek()!='\"'){\n\t\t\t\t\t\/\/ BufferString(currentChar);\n\t\t\t\t\t\/\/ cout << \"________________________\" <<endl;\n\t\t\t\t\t\/\/ cout << stringBuffer <<endl;\n\t\t\t\t\t\/\/ cout << \"________________________\" <<endl;\n\t\t\t\t\treturn CHEESE_LIT;\n\t\t\t\t}else if(currentChar == '\"' & sourceFile.peek()=='\"'){\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t}\n\t\t\t\tBufferString(currentChar);\n\t\t\t} while (sourceFile.peek()!='\\n');\n\t\t\treturn CHEESE_LIT;\n\t\t} else if (currentChar == '('){\n\t\t\treturn LBANANA;\n\t\t} else if (currentChar == ')'){\n\t\t\treturn RBANANA;\n\t\t} else if (currentChar == '['){\n\t\t\treturn LSTAPLE;\n\t\t} else if (currentChar == ']'){\n\t\t\treturn RSTAPLE;\n\t\t} else if (currentChar == '{'){\n\t\t\treturn LMUSTACHE;\n\t\t} else if (currentChar == '}'){\n\t\t\treturn RMUSTACHE;\n\t\t} else if (currentChar == ';'){\n\t\t\treturn SEMICOLON;\n\t\t} else if (currentChar == ':'){\n\t\t\treturn COLON;\n\t\t} else if (currentChar == ','){\n\t\t\treturn COMMA;\n\t\t} else if (currentChar == '+'){\n\t\t\tBufferChar(currentChar);\n\t\t\treturn PLUS_OP;\n\t\t} else if (currentChar == '*'){\n\t\t\tBufferChar(currentChar);\n\t\t\treturn MULT_OP;\n\t\t} else if (currentChar == '\/'){\n\t\t\tif (sourceFile.peek() == ':') {\/\/ comment\n\t\t\t\tdo{ \/\/ skip comment\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tif(currentChar == ':'){\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tif(currentChar == '\/'){\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} while (!sourceFile.eof());\n\t\t\t}\n\t\t\tBufferChar(currentChar);\n\t\t\treturn DIV_OP;\n\t\t} else if (currentChar == '=') {\n\t\t\tif (sourceFile.peek() == '=')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn EQ_OP1;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn ASSIGN_OP;\n\t\t} else if (currentChar == '!') {\n\t\t\tif (sourceFile.peek() == '!')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn EQ_OP2;\n\t\t\t}\n\t\t\telse if(sourceFile.peek() == '='){\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn NE_OP;\n\t\t\t}\n\t\t} else if (currentChar == '<') {\n\t\t\tif (sourceFile.peek() == '=')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn LE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn LT_OP;\n\t\t} else if (currentChar == '>') {\n\t\t\tif (sourceFile.peek() == '=')\n\t\t\t{\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn GE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn GT_OP;\n\t\t} else if (currentChar == '-'){\n\t\t\tif (sourceFile.peek() == '-') {\/\/ comment\n\t\t\t\tdo{ \/\/ skip comment\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t} while (currentChar != '\\n');\n\t\t\t} else{\n\t\t\t\tBufferChar(currentChar); \/\/ minus operator\n\t\t\t\treturn MINUS_OP;\n\t\t\t}\n\t\t} else{\n\t\t\tLexicalError(currentChar);\n\t\t}\n\t} \/\/ end while\n\n\treturn EOF_SYM;\n}\n<commit_msg>Fix code style.<commit_after>\/*\t____________________________________________________________________________\n\n\t Scanner Component for the Micro A Compiler\n\n\t mscan.h\n\n\t Version 2007 - 2016\n \n\t James L. Richards\n\t Last Update: August 28, 2007\n\t \t Nelson A Castillo\n\t Last Update: January 31, 2016\n\n\tThe routines in this unit are based on those provided in the book \n\t\"Crafting A Compiler\" by Charles N. Fischer and Richard J. LeBlanc, Jr., \n\tBenjamin Cummings Publishing Co. (1991).\n\n\tSee Section 2.2, pp. 25-29.\n\t____________________________________________________________________________\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <string>\nusing namespace std;\n\nextern ifstream sourceFile;\nextern ofstream outFile, listFile;\n\n#include \"mscan.h\"\n\n\/\/ *******************\n\/\/ ** Constructor **\n\/\/ *******************\n\nScanner::Scanner()\n{\n\ttokenBuffer = \"\";\n\tlineBuffer = \"\";\n\tlineNumber = 0;\n}\n\n\/\/ ********************************\n\/\/ ** Private Member Functions **\n\/\/ ********************************\n\nvoid Scanner::BufferChar(char c)\n{\n\tif (tokenBuffer.length() < ID_STRING_LEN){\n\t\ttokenBuffer += c;\n\t}\n\t\/\/cerr << tokenBuffer << endl;\n}\nvoid Scanner::BufferString(char c)\n{\n\tstringBuffer += c;\n\t\/\/cerr << tokenBuffer << endl;\n}\n\nToken Scanner::CheckReserved()\n{\n\tif (tolower(tokenBuffer) == \"bool\") return BOOL_SYM;\n\tif (tolower(tokenBuffer) == \"break\") return BREAK_SYM;\n\tif (tolower(tokenBuffer) == \"case\") return CASE_SYM;\n\tif (tolower(tokenBuffer) == \"cheese\") return CHEESE_SYM;\n\tif (tolower(tokenBuffer) == \"decs\") return DECS_SYM;\n\tif (tolower(tokenBuffer) == \"do\") return DO_SYM;\n\tif (tolower(tokenBuffer) == \"else\") return ELSE_SYM;\n\tif (tolower(tokenBuffer) == \"end\") return END_SYM;\n\tif (tolower(tokenBuffer) == \"false\") return FALSE_SYM;\n\tif (tolower(tokenBuffer) == \"float\") return FLOAT_SYM;\n\tif (tolower(tokenBuffer) == \"for\") return FOR_SYM;\n\tif (tolower(tokenBuffer) == \"hiphip\") return HIPHIP_SYM;\n\tif (tolower(tokenBuffer) == \"if\") return IF_SYM;\n\tif (tolower(tokenBuffer) == \"int\") return INT_SYM;\n\tif (tolower(tokenBuffer) == \"listen\") return LISTEN_SYM;\n\tif (tolower(tokenBuffer) == \"otherwise\") return OTHERWISE_SYM;\n\tif (tolower(tokenBuffer) == \"select\") return SELECT_SYM;\n\tif (tolower(tokenBuffer) == \"shout\") return SHOUT_SYM;\n\tif (tolower(tokenBuffer) == \"then\") return THEN_SYM;\n\tif (tolower(tokenBuffer) == \"true\") return TRUE_SYM;\n\tif (tolower(tokenBuffer) == \"while\") return WHILE_SYM;\n\n\treturn ID;\n}\n\nvoid Scanner::ClearBuffer()\n{\n\ttokenBuffer = \"\";\n\tstringBuffer = \"\";\n}\n\nvoid Scanner::LexicalError(char& c, string& errorExp=\"\")\n{\t\n\tcout << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\tlistFile << \" *** Lexical Error: '\" << c\n\t\t<< \"' ignored at position \" << int(lineBuffer.size())\n\t\t<< \" on line #\" << lineNumber + 1 << '.' << endl;\n\tif (errorExp != \"\") {\n\t\t\/*TODO: I was starting with the comment but\n\t\t * I need to ampliate the code\n\t\t *\/\n\t}\n\tc = NextChar();\n}\n\nchar Scanner::NextChar()\n{\n\tchar c;\n\n\tsourceFile.get(c);\n\tif (c == '\\n')\n\t{\n\t\tlistFile.width(6);\n\t\tlistFile << ++lineNumber << \" \" << lineBuffer << endl;\n\t\tlineBuffer = \"\";\n\t} else{\n\t\tlineBuffer += c;\n\t}\n\treturn c;\n}\n\n\/\/ *******************************\n\/\/ ** Public Member Functions **\n\/\/ *******************************\n\nToken Scanner::GetNextToken()\n{\n\tchar currentChar, c;\n\n\tClearBuffer();\n\tcurrentChar = NextChar();\n\twhile (!sourceFile.eof())\n\t{\n\t\tif (isspace(currentChar)) {\n\t\t\t\/* do nothing *\/\n\t\t\tcurrentChar = NextChar();\n\t\t} else if (isalpha(currentChar)) {\n\t\t\t\/* identifier *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isalnum(c) || c == '_') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\treturn CheckReserved();\n\t\t} else if (isdigit(currentChar)) {\n\t\t\t\/* integer or float literals *\/\n\t\t\tBufferChar(currentChar);\n\t\t\tc = sourceFile.peek();\n\t\t\twhile (isdigit(c)) {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\tc = sourceFile.peek();\n\t\t\t}\n\t\t\t\/* check if it is a float *\/\n\t\t\tif (c == '.') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\/* check for a digit after the '.' *\/\n\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t}\n\t\t\t\t\/* check for power of 10 multipliers *\/\n\t\t\t\tif (c == 'e' || c == 'E') {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (c != '+' && c!= '-') {\n\t\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\t\t}\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\tif (!isdigit(c)) \n\t\t\t\t\t\tLexicalError(currentChar);\n\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\twhile (isdigit(c)) {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tBufferChar(currentChar);\n\t\t\t\t\t\tc = sourceFile.peek();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn FLOAT_LIT;\n\t\t\t}\n\t\t\treturn INT_LIT;\n\t\t} else if (currentChar == '\"') {\n\t\t\t\/\/ string literal\n\t\t\t\/\/ BufferString(currentChar);\n\t\t\tdo {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\/\/ cout << currentChar <<endl;\n\t\t\t\tif (currentChar == '\"' \\\n\t\t\t\t\t\t& sourceFile.peek() != '\"') {\n\t\t\t\t\t\/\/ BufferString(currentChar);\n\t\t\t\t\t\/\/ cout << \"________________________\" <<endl;\n\t\t\t\t\t\/\/ cout << stringBuffer <<endl;\n\t\t\t\t\t\/\/ cout << \"________________________\" <<endl;\n\t\t\t\t\treturn CHEESE_LIT;\n\t\t\t\t} else if (currentChar == '\"' \\\n\t\t\t\t\t\t& sourceFile.peek() == '\"') {\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t}\n\t\t\t\tBufferString(currentChar);\n\t\t\t} while (sourceFile.peek()!='\\n');\n\t\t\treturn CHEESE_LIT;\n\t\t} else if (currentChar == '(') {\n\t\t\treturn LBANANA;\n\t\t} else if (currentChar == ')') {\n\t\t\treturn RBANANA;\n\t\t} else if (currentChar == '[') {\n\t\t\treturn LSTAPLE;\n\t\t} else if (currentChar == ']') {\n\t\t\treturn RSTAPLE;\n\t\t} else if (currentChar == '{') {\n\t\t\treturn LMUSTACHE;\n\t\t} else if (currentChar == '}') {\n\t\t\treturn RMUSTACHE;\n\t\t} else if (currentChar == ';') {\n\t\t\treturn SEMICOLON;\n\t\t} else if (currentChar == ':') {\n\t\t\treturn COLON;\n\t\t} else if (currentChar == ',') {\n\t\t\treturn COMMA;\n\t\t} else if (currentChar == '+') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn PLUS_OP;\n\t\t} else if (currentChar == '*') {\n\t\t\tBufferChar(currentChar);\n\t\t\treturn MULT_OP;\n\t\t} else if (currentChar == '\/') {\n\t\t\t\/* check if it is a multiline comment *\/\n\t\t\tif (sourceFile.peek() == ':') {\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\tif (currentChar == ':') {\n\t\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t\t\tif (currentChar == '\/') {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} while (!sourceFile.eof());\n\t\t\t}\n\t\t\tBufferChar(currentChar);\n\t\t\treturn DIV_OP;\n\t\t} else if (currentChar == '=') {\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn EQ_OP1;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn ASSIGN_OP;\n\t\t} else if (currentChar == '!') {\n\t\t\tif (sourceFile.peek() == '!') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn EQ_OP2;\n\t\t\t} else if (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn NE_OP;\n\t\t\t}\n\t\t} else if (currentChar == '<') {\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn LE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn LT_OP;\n\t\t} else if (currentChar == '>') {\n\t\t\tif (sourceFile.peek() == '=') {\n\t\t\t\tcurrentChar = NextChar();\n\t\t\t\treturn GE_OP;\n\t\t\t}\n\t\t\tcurrentChar = NextChar();\n\t\t\treturn GT_OP;\n\t\t} else if (currentChar == '-') {\n\t\t\t\/* check if it is a comment or a minus symbol *\/\n\t\t\tif (sourceFile.peek() == '-') { \/* comment *\/\n\t\t\t\tdo { \/* skip comment *\/\n\t\t\t\t\tcurrentChar = NextChar();\n\t\t\t\t} while (currentChar != '\\n');\n\t\t\t} else { \/* minus operator *\/\n\t\t\t\tBufferChar(currentChar);\n\t\t\t\treturn MINUS_OP;\n\t\t\t}\n\t\t} else {\n\t\t\t\/* Unrecognized character *\/\n\t\t\tLexicalError(currentChar);\n\t\t}\n\t} \/* end while *\/\n\n\treturn EOF_SYM;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef __STAN__COMMON__PRINT_PROGRESS_HPP__\n#define __STAN__COMMON__PRINT_PROGRESS_HPP__\n\n#include <cmath>\n#include <iomanip>\n#include <stan\/common\/do_print.hpp>\n\n\/\/ FIXME: this calls std::cout directly.\n#include <iostream>\n\nnamespace stan {\n namespace common {\n \n void print_progress(const int m, \n const int start, \n const int finish, \n const int refresh, \n const bool warmup,\n std::ostream& o) {\n int it_print_width = std::ceil(std::log10(finish));\n if (do_print(m, (start + m + 1 == finish), refresh)) {\n o << \"Iteration: \";\n o << std::setw(it_print_width) << m + 1 + start\n << \" \/ \" << finish;\n o << \" [\" << std::setw(3) \n << static_cast<int>( (100.0 * (start + m + 1)) \/ finish )\n << \"%] \";\n o << (warmup ? \" (Warmup)\" : \" (Sampling)\");\n o << std::endl;\n }\n }\n\n void print_progress(const int m, \n const int start, \n const int finish, \n const int refresh, \n const bool warmup) {\n print_progress(m, start, finish, refresh, warmup,\n std::cout);\n }\n\n\n } \/\/ namespace common\n\n} \/\/ namespace stan\n\n#endif\n<commit_msg>refactor: abstracted prefix and suffix out of print_progress<commit_after>#ifndef __STAN__COMMON__PRINT_PROGRESS_HPP__\n#define __STAN__COMMON__PRINT_PROGRESS_HPP__\n\n#include <cmath>\n#include <iomanip>\n#include <stan\/common\/do_print.hpp>\n\n\/\/ FIXME: this calls std::cout directly.\n#include <iostream>\n\nnamespace stan {\n namespace common {\n \n void print_progress(const int m, \n const int start, \n const int finish, \n const int refresh, \n const bool warmup,\n const std::string prefix,\n const std::string suffix,\n std::ostream& o) {\n int it_print_width = std::ceil(std::log10(finish));\n if (do_print(m, (start + m + 1 == finish), refresh)) {\n o << prefix;\n o << \"Iteration: \";\n o << std::setw(it_print_width) << m + 1 + start\n << \" \/ \" << finish;\n o << \" [\" << std::setw(3) \n << static_cast<int>( (100.0 * (start + m + 1)) \/ finish )\n << \"%] \";\n o << (warmup ? \" (Warmup)\" : \" (Sampling)\");\n o << suffix;\n o << std::endl;\n }\n }\n\n void print_progress(const int m, \n const int start, \n const int finish, \n const int refresh, \n const bool warmup) {\n print_progress(m, start, finish, refresh, warmup,\n \"\", \"\\n\",\n std::cout);\n }\n\n\n } \/\/ namespace common\n\n} \/\/ namespace stan\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"ImfCFile.h\"\n\n#include <stdlib.h>\n#include <assert.h>\n\n#define XRES 1024\n#define YRES 512\n\nint main()\n{\n\tconst char *software = \"microexr\";\n\tconst char *comment = \"a simple test case for the microexr library\";\n\n\tImfHeader *header = ImfNewHeader();\n\n\tImfHeaderSetCompression(header, IMF_ZIP_COMPRESSION );\n\tImfHeaderSetStringAttribute( header, \"software\", software );\n\tImfHeaderSetStringAttribute( header, \"comment\", comment );\n\tImfHeaderSetDataWindow( header, 0, 0, XRES-1, YRES-1 );\n\tImfHeaderSetDisplayWindow( header, 0, 0, XRES-1, YRES-1 );\n\tImfHeaderSetPixelAspectRatio( header, 1.0f );\n\tImfHeaderSetScreenWindowCenter(header, 0.0, 0.0);\n\tImfHeaderSetScreenWindowWidth(header, 1.0);\n\t\n\tImfHeaderSetLineOrder( header, IMF_INCREASING_Y );\n\t\n\tImfHeaderInsertChannel(header, \"R\", IMF_PIXEL_HALF);\n\tImfHeaderInsertChannel(header, \"G\", IMF_PIXEL_HALF);\n\tImfHeaderInsertChannel(header, \"B\", IMF_PIXEL_HALF);\n\tImfHeaderInsertChannel(header, \"A\", IMF_PIXEL_HALF);\n\n\tImfOutputFile *exr = ImfOpenOutputFile( \"gradient.exr\", header );\n\n\tif( !exr )\n\t{\n\t\tperror( \"gradient: unable to open 'gradient.exr' for writing\" );\n\t\texit( 1 );\n\t}\n\n\t\/* Write a simple gradient in the framebuffer. *\/\n\tImfHalf *fb = new ImfHalf[XRES*4];\n\n\tfor( unsigned j=0; j<YRES; j++ )\n\t{\n\t\tfloat g = float(j) \/ float(YRES-1);\n\t\tassert( g<=1.0f );\n\n\t\tImfHalf *current_pixel = fb;\n\n\t\tfor( unsigned i=0; i<XRES; i++ )\n\t\t{\n\t\t\tfloat r = float(i) \/ float(XRES-1);\n\t\n\t\t\tassert( r<=1.0f );\n\n\t\t\tImfFloatToHalf( r, current_pixel + 0 );\n\t\t\tImfFloatToHalf( g, current_pixel + 1 );\n\t\t\tImfFloatToHalf( 0.5f, current_pixel + 2 );\n\t\t\tImfFloatToHalf( 1.0f, current_pixel + 3 );\n\n\t\t\tcurrent_pixel += 4;\n\t\t}\n\n\t\tImfOutputSetFrameBuffer( exr, (const char *)fb, 4*sizeof(ImfHalf), 0 );\n\t\tImfOutputWritePixels( exr, 1 );\n\t}\n\n\tImfCloseOutputFile( exr );\n\tImfDeleteHeader( header );\n\n\tdelete [] fb;\n\n\texit( 0 );\n}\n<commit_msg>Use the standard open nomencalture for compatibility.<commit_after>#include \"ImfCFile.h\"\n\n#include <stdlib.h>\n#include <assert.h>\n\n#define XRES 1024\n#define YRES 512\n\nint main()\n{\n\tconst char *software = \"microexr\";\n\tconst char *comment = \"a simple test case for the microexr library\";\n\n\tImfHeader *header = ImfNewHeader();\n\n\tImfHeaderSetCompression(header, IMF_ZIP_COMPRESSION );\n\tImfHeaderSetStringAttribute( header, \"software\", software );\n\tImfHeaderSetStringAttribute( header, \"comment\", comment );\n\tImfHeaderSetDataWindow( header, 0, 0, XRES-1, YRES-1 );\n\tImfHeaderSetDisplayWindow( header, 0, 0, XRES-1, YRES-1 );\n\tImfHeaderSetPixelAspectRatio( header, 1.0f );\n\tImfHeaderSetScreenWindowCenter(header, 0.0, 0.0);\n\tImfHeaderSetScreenWindowWidth(header, 1.0);\n\t\n\tImfHeaderSetLineOrder( header, IMF_INCREASING_Y );\n\t\n\tImfOutputFile *exr = ImfOpenOutputFile( \"gradient.exr\", header, IMF_WRITE_RGBA );\n\n\tif( !exr )\n\t{\n\t\tperror( \"gradient: unable to open 'gradient.exr' for writing\" );\n\t\texit( 1 );\n\t}\n\n\t\/* Write a simple gradient in the framebuffer. *\/\n\tImfHalf *fb = new ImfHalf[XRES*4];\n\n\tfor( unsigned j=0; j<YRES; j++ )\n\t{\n\t\tfloat g = float(j) \/ float(YRES-1);\n\t\tassert( g<=1.0f );\n\n\t\tImfHalf *current_pixel = fb;\n\n\t\tfor( unsigned i=0; i<XRES; i++ )\n\t\t{\n\t\t\tfloat r = float(i) \/ float(XRES-1);\n\t\n\t\t\tassert( r<=1.0f );\n\n\t\t\tImfFloatToHalf( r, current_pixel + 0 );\n\t\t\tImfFloatToHalf( g, current_pixel + 1 );\n\t\t\tImfFloatToHalf( 0.5f, current_pixel + 2 );\n\t\t\tImfFloatToHalf( 1.0f, current_pixel + 3 );\n\n\t\t\tcurrent_pixel += 4;\n\t\t}\n\n\t\tImfOutputSetFrameBuffer( exr, (const char *)fb, 4*sizeof(ImfHalf), 0 );\n\t\tImfOutputWritePixels( exr, 1 );\n\t}\n\n\tImfCloseOutputFile( exr );\n\tImfDeleteHeader( header );\n\n\tdelete [] fb;\n\n\texit( 0 );\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Patrick Huck\n#include \"src\/cmdline\/cmdline.h\"\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/tee.hpp>\n#include \"src\/clean\/clean.h\"\n#include \"src\/aux\/utils.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ostream;\nnamespace io = boost::iostreams;\nnamespace fs = boost::filesystem;\n\ntypedef io::tee_device<ostream, fs::ofstream> Tee;\ntypedef io::stream<Tee> TeeStream;\n\ncmdline::cmdline()\n: ckon_cmd(\"\"), nCpu(\"1\"), ckon_config_file(\"ckon.cfg\"), ckon_src_dir(\"StRoot\"),\n ckon_obsolete_dir(\"Obsolete\"), ckon_exclSuffix(\"Gnuplot Options\"),\n ckon_DontScan(\"dat-files database\"), ckon_NoRootCint(\"YamlCpp\"),\n ckon_prog_subdir(\"programs\"), ckon_macro_subdir(\"macros\"),\n ckon_build_dir(\"build\"), ckon_install_dir(\"build\")\n{ }\n\nvoid cmdline::purge() {\n clean clcont(ckon_src_dir);\n printf(\"%d files removed.\\n\", clcont.purge());\n}\n\nvoid cmdline::runSetup() {\n if ( fs::exists(ckon_config_file) || fs::exists(\"configure.ac\") ) {\n cout << ckon_config_file << \" or configure.ac already exist(s)!\" << endl;\n if ( utils::askYesOrNo(\"remove and start over\") == 'n' ) return;\n fs::remove(ckon_config_file);\n fs::remove(\"configure.ac\");\n fs::remove(\".autom4te.cfg\");\n }\n\n cout << \"write cfgfile\" << endl;\n\n fs::ofstream cfgfile(ckon_config_file);\n Tee tee(cout, cfgfile);\n TeeStream both(tee);\n both << \"pythia=\" << bPythia << endl;\n both << \"roofit=\" << bRooFit << endl;\n both << \"boost=\" << bBoost << endl;\n both << \"suffix=\" << bSuffix << endl;\n both << \"[ckon]\" << endl;\n both << \"src_dir=\" << ckon_src_dir << endl;\n both << \"obsolete_dir=\" << ckon_obsolete_dir << endl;\n both << \"prog_subdir=\" << ckon_prog_subdir << endl;\n both << \"macro_subdir=\" << ckon_macro_subdir << endl;\n both << \"build_dir=\" << ckon_build_dir << endl;\n both << \"install_dir=\" << ckon_install_dir << endl;\n both << \"exclSuffix=\\\"\" << ckon_exclSuffix << \"\\\"\" << endl;\n both << \"DontScan=\\\"\" << ckon_DontScan << \"\\\"\" << endl;\n both << \"NoRootCint=\" << ckon_NoRootCint << endl;\n both.close();\n\n writeConfigureAc();\n writeAutom4teCfg();\n\n cout << endl << \"setup done. check \" << ckon_config_file << endl;\n}\n\nbool cmdline::parse(int argc, char *argv[]) {\n po::options_description generic(\"Generic Options\");\n generic.add_options()\n (\"help,h\", po::bool_switch(&bHelp), \"show this help\")\n (\"verbose,v\", po::bool_switch(&bVerbose), \"verbose output\")\n (\",j\", po::value<string>(&nCpu), \"call make with option -j <#cores>\")\n (\"ckon_cmd\", po::value<string>(&ckon_cmd), \"setup | clean | install\");\n\n po::options_description config(\"Configuration\");\n config.add_options()\n (\"pythia,p\", po::value<bool>(&bPythia), \"link with pythia library (bool)\")\n (\"roofit,r\", po::value<bool>(&bRooFit), \"link with roofit library (bool)\")\n (\"suffix,s\", po::value<bool>(&bSuffix), \"Add suffix + in LinkDef file (bool)\")\n (\"boost,b\", po::value<bool>(&bBoost), \"include BOOST_INC and BOOST_LIB (bool)\")\n (\"ckon.config_file\", po::value<string>(&ckon_config_file), \"config file\")\n (\"ckon.src_dir\", po::value<string>(&ckon_src_dir), \"source dir\")\n (\"ckon.obsolete_dir\", po::value<string>(&ckon_obsolete_dir), \"obsolete dir\")\n (\"ckon.exclSuffix\", po::value<string>(&ckon_exclSuffix), \"no + suffix\")\n (\"ckon.DontScan\", po::value<string>(&ckon_DontScan), \"no source scan\")\n (\"ckon.NoRootCint\", po::value<string>(&ckon_NoRootCint), \"no dictionary\")\n (\"ckon.prog_subdir\", po::value<string>(&ckon_prog_subdir), \"progs subdir\")\n (\"ckon.macro_subdir\", po::value<string>(&ckon_macro_subdir), \"macro subdir\")\n (\"ckon.build_dir\", po::value<string>(&ckon_build_dir), \"build dir\")\n (\"ckon.install_dir\", po::value<string>(&ckon_install_dir), \"install dir\");\n\n po::options_description allopts;\n allopts.add(generic).add(config);\n\n po::positional_options_description posOpts;\n posOpts.add(\"ckon_cmd\", 1);\n\n po::variables_map vm;\n\n try {\n po::store(\n po::command_line_parser(argc, argv)\n .options(allopts).positional(posOpts).run(), vm);\n if ( fs::exists(ckon_config_file) ) {\n po::store(\n po::parse_config_file<char>(ckon_config_file.c_str(), config), vm);\n }\n\n po::notify(vm); \/\/ throws on error\n\n if ( bHelp ) { \/\/ --help option\n cout << \"ckon -- automatic ROOT analyses compiler & linker\" << endl;\n cout << allopts << endl;\n return false;\n }\n\n bSetup = !ckon_cmd.compare(\"setup\");\n bClean = !ckon_cmd.compare(\"clean\");\n bInstall = !ckon_cmd.compare(\"install\");\n\n if ( bSetup ) { cout << \"run setup\" << endl; runSetup(); return false; }\n if ( bClean ) { purge(); return false; }\n\n return true;\n }\n catch(const po::error& e) {\n std::cerr << \"ERROR: \" << e.what() << endl << endl << generic << endl;\n return false;\n }\n}\n\nvoid cmdline::writeConfigureAc() {\n string cfg_ac_str = \"AC_INIT([ana], [0.0])\\n\";\n cfg_ac_str += \"m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])\\n\";\n cfg_ac_str += \"AC_CONFIG_AUX_DIR(config)\\n\";\n cfg_ac_str += \"m4_pattern_allow([AM_PROG_AR])\\n\";\n cfg_ac_str += \"m4_ifdef([AM_PROG_AR], [AM_PROG_AR])\\n\";\n cfg_ac_str += \"AM_INIT_AUTOMAKE([-Wall no-define])\\n\";\n cfg_ac_str += \"AC_PROG_CXX\\n\";\n cfg_ac_str += \"AM_PROG_LIBTOOL\\n\";\n cfg_ac_str += \"ROOTLIBS=`$ROOTSYS\/bin\/root-config --libs`\\n\";\n cfg_ac_str += \"ROOTINCLUDES=`$ROOTSYS\/bin\/root-config --incdir`\\n\";\n cfg_ac_str += \"ROOTLIBDIR=`$ROOTSYS\/bin\/root-config --libdir`\\n\";\n cfg_ac_str += \"ROOTGLIBS=`$ROOTSYS\/bin\/root-config --glibs`\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTLIBS)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTINCLUDES)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTGLIBS)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTLIBDIR)\\n\";\n cfg_ac_str += \"AC_CONFIG_FILES([Makefile])\\n\";\n cfg_ac_str += \"AC_OUTPUT\\n\";\n fs::ofstream cfg_ac;\n cfg_ac.open(\"configure.ac\");\n cfg_ac << cfg_ac_str;\n cfg_ac.close();\n}\n\nvoid cmdline::writeAutom4teCfg() {\n string atmte_str = \"begin-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n atmte_str += \"args: --no-cache\\n\";\n atmte_str += \"end-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n fs::ofstream atmte;\n atmte.open(\".autom4te.cfg\");\n atmte << atmte_str;\n atmte.close();\n}\n\n<commit_msg>remove ckon.config_file as option<commit_after>\/\/ Copyright (c) 2013 Patrick Huck\n#include \"src\/cmdline\/cmdline.h\"\n#include <boost\/filesystem\/fstream.hpp>\n#include <boost\/iostreams\/stream.hpp>\n#include <boost\/iostreams\/tee.hpp>\n#include \"src\/clean\/clean.h\"\n#include \"src\/aux\/utils.h\"\n\nusing std::cout;\nusing std::endl;\nusing std::ostream;\nnamespace io = boost::iostreams;\nnamespace fs = boost::filesystem;\n\ntypedef io::tee_device<ostream, fs::ofstream> Tee;\ntypedef io::stream<Tee> TeeStream;\n\ncmdline::cmdline()\n: ckon_cmd(\"\"), nCpu(\"1\"), ckon_config_file(\"ckon.cfg\"), ckon_src_dir(\"StRoot\"),\n ckon_obsolete_dir(\"Obsolete\"), ckon_exclSuffix(\"Gnuplot Options\"),\n ckon_DontScan(\"dat-files database\"), ckon_NoRootCint(\"YamlCpp\"),\n ckon_prog_subdir(\"programs\"), ckon_macro_subdir(\"macros\"),\n ckon_build_dir(\"build\"), ckon_install_dir(\"build\")\n{ }\n\nvoid cmdline::purge() {\n clean clcont(ckon_src_dir);\n printf(\"%d files removed.\\n\", clcont.purge());\n}\n\nvoid cmdline::runSetup() {\n if ( fs::exists(ckon_config_file) || fs::exists(\"configure.ac\") ) {\n cout << ckon_config_file << \" or configure.ac already exist(s)!\" << endl;\n if ( utils::askYesOrNo(\"remove and start over\") == 'n' ) return;\n fs::remove(ckon_config_file);\n fs::remove(\"configure.ac\");\n fs::remove(\".autom4te.cfg\");\n }\n\n cout << \"write cfgfile\" << endl;\n\n fs::ofstream cfgfile(ckon_config_file);\n Tee tee(cout, cfgfile);\n TeeStream both(tee);\n both << \"pythia=\" << bPythia << endl;\n both << \"roofit=\" << bRooFit << endl;\n both << \"boost=\" << bBoost << endl;\n both << \"suffix=\" << bSuffix << endl;\n both << \"[ckon]\" << endl;\n both << \"src_dir=\" << ckon_src_dir << endl;\n both << \"obsolete_dir=\" << ckon_obsolete_dir << endl;\n both << \"prog_subdir=\" << ckon_prog_subdir << endl;\n both << \"macro_subdir=\" << ckon_macro_subdir << endl;\n both << \"build_dir=\" << ckon_build_dir << endl;\n both << \"install_dir=\" << ckon_install_dir << endl;\n both << \"exclSuffix=\\\"\" << ckon_exclSuffix << \"\\\"\" << endl;\n both << \"DontScan=\\\"\" << ckon_DontScan << \"\\\"\" << endl;\n both << \"NoRootCint=\" << ckon_NoRootCint << endl;\n both.close();\n\n writeConfigureAc();\n writeAutom4teCfg();\n\n cout << endl << \"setup done. check \" << ckon_config_file << endl;\n}\n\nbool cmdline::parse(int argc, char *argv[]) {\n po::options_description generic(\"Generic Options\");\n generic.add_options()\n (\"help,h\", po::bool_switch(&bHelp), \"show this help\")\n (\"verbose,v\", po::bool_switch(&bVerbose), \"verbose output\")\n (\",j\", po::value<string>(&nCpu), \"call make with option -j <#cores>\")\n (\"ckon_cmd\", po::value<string>(&ckon_cmd), \"setup | clean | install\");\n\n po::options_description config(\"Configuration\");\n config.add_options()\n (\"pythia,p\", po::value<bool>(&bPythia), \"link with pythia library (bool)\")\n (\"roofit,r\", po::value<bool>(&bRooFit), \"link with roofit library (bool)\")\n (\"suffix,s\", po::value<bool>(&bSuffix), \"Add suffix + in LinkDef file (bool)\")\n (\"boost,b\", po::value<bool>(&bBoost), \"include BOOST_INC and BOOST_LIB (bool)\")\n (\"ckon.src_dir\", po::value<string>(&ckon_src_dir), \"source dir\")\n (\"ckon.obsolete_dir\", po::value<string>(&ckon_obsolete_dir), \"obsolete dir\")\n (\"ckon.exclSuffix\", po::value<string>(&ckon_exclSuffix), \"no + suffix\")\n (\"ckon.DontScan\", po::value<string>(&ckon_DontScan), \"no source scan\")\n (\"ckon.NoRootCint\", po::value<string>(&ckon_NoRootCint), \"no dictionary\")\n (\"ckon.prog_subdir\", po::value<string>(&ckon_prog_subdir), \"progs subdir\")\n (\"ckon.macro_subdir\", po::value<string>(&ckon_macro_subdir), \"macro subdir\")\n (\"ckon.build_dir\", po::value<string>(&ckon_build_dir), \"build dir\")\n (\"ckon.install_dir\", po::value<string>(&ckon_install_dir), \"install dir\");\n\n po::options_description allopts;\n allopts.add(generic).add(config);\n\n po::positional_options_description posOpts;\n posOpts.add(\"ckon_cmd\", 1);\n\n po::variables_map vm;\n\n try {\n po::store(\n po::command_line_parser(argc, argv)\n .options(allopts).positional(posOpts).run(), vm);\n if ( fs::exists(ckon_config_file) ) {\n po::store(\n po::parse_config_file<char>(ckon_config_file.c_str(), config), vm);\n }\n\n po::notify(vm); \/\/ throws on error\n\n if ( bHelp ) { \/\/ --help option\n cout << \"ckon -- automatic ROOT analyses compiler & linker\" << endl;\n cout << allopts << endl;\n return false;\n }\n\n bSetup = !ckon_cmd.compare(\"setup\");\n bClean = !ckon_cmd.compare(\"clean\");\n bInstall = !ckon_cmd.compare(\"install\");\n\n if ( bSetup ) { cout << \"run setup\" << endl; runSetup(); return false; }\n if ( bClean ) { purge(); return false; }\n\n return true;\n }\n catch(const po::error& e) {\n std::cerr << \"ERROR: \" << e.what() << endl << endl << generic << endl;\n return false;\n }\n}\n\nvoid cmdline::writeConfigureAc() {\n string cfg_ac_str = \"AC_INIT([ana], [0.0])\\n\";\n cfg_ac_str += \"m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])\\n\";\n cfg_ac_str += \"AC_CONFIG_AUX_DIR(config)\\n\";\n cfg_ac_str += \"m4_pattern_allow([AM_PROG_AR])\\n\";\n cfg_ac_str += \"m4_ifdef([AM_PROG_AR], [AM_PROG_AR])\\n\";\n cfg_ac_str += \"AM_INIT_AUTOMAKE([-Wall no-define])\\n\";\n cfg_ac_str += \"AC_PROG_CXX\\n\";\n cfg_ac_str += \"AM_PROG_LIBTOOL\\n\";\n cfg_ac_str += \"ROOTLIBS=`$ROOTSYS\/bin\/root-config --libs`\\n\";\n cfg_ac_str += \"ROOTINCLUDES=`$ROOTSYS\/bin\/root-config --incdir`\\n\";\n cfg_ac_str += \"ROOTLIBDIR=`$ROOTSYS\/bin\/root-config --libdir`\\n\";\n cfg_ac_str += \"ROOTGLIBS=`$ROOTSYS\/bin\/root-config --glibs`\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTLIBS)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTINCLUDES)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTGLIBS)\\n\";\n cfg_ac_str += \"AC_SUBST(ROOTLIBDIR)\\n\";\n cfg_ac_str += \"AC_CONFIG_FILES([Makefile])\\n\";\n cfg_ac_str += \"AC_OUTPUT\\n\";\n fs::ofstream cfg_ac;\n cfg_ac.open(\"configure.ac\");\n cfg_ac << cfg_ac_str;\n cfg_ac.close();\n}\n\nvoid cmdline::writeAutom4teCfg() {\n string atmte_str = \"begin-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n atmte_str += \"args: --no-cache\\n\";\n atmte_str += \"end-language: \\\"Autoconf-without-aclocal-m4\\\"\\n\";\n fs::ofstream atmte;\n atmte.open(\".autom4te.cfg\");\n atmte << atmte_str;\n atmte.close();\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n Tile.cpp\n\n tileable image generation\n\n Li-Yi Wei\n April 25, 2018\n\n*\/\n\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"Texture.hpp\"\n#include \"VectorRange.hpp\"\n\n#include \"SequentialCounter.hpp\"\n#include \"FrameBuffer.hpp\"\n#include \"Random.hpp\"\n#include \"Utility.hpp\"\n#include \"Exception.hpp\"\n\nstring Convert(const vector<int> & output_size, Array<Position> & coord_array)\n{\n coord_array = Array<Position>(output_size);\n\n SequentialCounter counter(output_size.size(), vector<int>(output_size.size(), 0), Utility::Minus1(output_size));\n \n vector<int> index;\n counter.Reset();\n \n do\n {\n counter.Get(index);\n\n if(! coord_array.Put(index, index))\n {\n return \"cannot put position\";\n }\n }\n while(counter.Next());\n\n \/\/ done\n return \"\";\n}\n\nstring Convert(const Array<FrameBuffer::P3> & coord_image, Array<Position> & coord_array)\n{\n const vector<int> output_size = coord_image.Size();\n coord_array = Array<Position>(output_size);\n\n SequentialCounter counter(output_size.size(), vector<int>(output_size.size(), 0), Utility::Minus1(output_size));\n \n FrameBuffer::P3 pixel;\n Position position(2);\n vector<int> index;\n counter.Reset();\n \n do\n {\n counter.Get(index);\n \n if(! coord_image.Get(index, pixel))\n {\n return \"cannot get pixel\";\n }\n\n position[0] = pixel.r;\n position[1] = pixel.g;\n\n if(! coord_array.Put(index, position))\n {\n return \"cannot put position\";\n }\n }\n while(counter.Next());\n\n \/\/ done\n return \"\";\n}\n\nint Main(int argc, char **argv)\n{\n \/\/ input arguments\n if(argc < 8)\n {\n cerr << \"Usage: \" << argv[0] << \" input_image_file_path init_coord_spec input_boundary (toroidal or none) synthesizer_spec sequencer_spec neighborhood_spec (e.g. square1) output_image_file_path\" << endl;\n return 1;\n }\n \n int arg_ctr = 0;\n \n const string input_image_file_path(argv[++arg_ctr]);\n const string init_coord_spec(argv[++arg_ctr]);\n const string input_boundary(argv[++arg_ctr]);\n const string output_boundary(\"toroidal\");\n const string synthesis_spec(argv[++arg_ctr]);\n const string sequence_spec(argv[++arg_ctr]);\n const string neighborhood_spec(argv[++arg_ctr]);\n const string output_image_file_path(argv[++arg_ctr]);\n\n \/\/ input image\n Array<FrameBuffer::P3> input_image;\n int max_pixel_value = -1;\n if(! FrameBuffer::ReadPPM(input_image_file_path, input_image, max_pixel_value))\n {\n cerr << \"cannot read from \" << input_image_file_path << endl;\n return 1;\n }\n\n const Texture input_texture(input_image);\n \n const int dimension = input_texture.Dimension();\n\n \/\/ init coord\n Array<Position> init_coord;\n {\n Array<FrameBuffer::P3> init_coord_image;\n int max_coord_value = -1;\n\n string message;\n if(FrameBuffer::ReadPPM(init_coord_spec, init_coord_image, max_coord_value))\n {\n message = Convert(init_coord_image, init_coord);\n }\n else\n {\n message = Convert(input_image.Size(), init_coord);\n }\n \n if(message != \"\")\n {\n cerr << \"error in converting coord image: \" << message << endl;\n return 1;\n }\n }\n\n \/\/ domain and neighborhood\n const shared_ptr<Domain> p_input_domain = Utility::BuildDomain(input_boundary);\n const shared_ptr<Domain> p_output_domain = Utility::BuildDomain(output_boundary);\n\n if(!p_input_domain || !p_output_domain)\n {\n cerr << \"null domain\" << endl;\n return 1;\n }\n\n const Domain & input_domain = *p_input_domain;\n const Domain & output_domain = *p_output_domain;\n\n const shared_ptr<Templar> p_templar = Utility::BuildTemplar(neighborhood_spec, dimension);\n if(!p_templar)\n {\n cerr << \"null templar\" << endl;\n return 1;\n }\n\n const shared_ptr<Neighborhood> p_output_neighborhood = Utility::BuildNeighborhood(*p_templar, output_domain);\n\n const Neighborhood & output_neighborhood = *p_output_neighborhood;\n\n \/\/ range\n const int range_dimension = 3; \/\/ RGB\n\n const RangePtr penalty_range(new VectorRange<int>(vector<int>(range_dimension, max_pixel_value)));\n const RangePtr zero_range(new VectorRange<int>(vector<int>(range_dimension, 0)));\n\n \/\/ initialization\n Random::InitRandomNumberGenerator();\n\n \/\/ output texture\n Texture output_texture(input_texture, init_coord);\n\n \/\/ synthesis\n const string message = Utility::Synthesize(input_boundary, output_boundary, synthesis_spec, sequence_spec, neighborhood_spec, input_texture, output_texture, penalty_range, zero_range);\n\n if(message != \"\")\n {\n cerr << \"error in synthesis: \" << message << endl;\n return 1;\n }\n\n \/\/ output\n Array<FrameBuffer::P3> output_image;\n if(!output_texture.Convert(output_image))\n {\n cerr << \"cannot convert output\" << endl;\n return 1;\n }\n\n if(! FrameBuffer::WritePPM(output_image, max_pixel_value, output_image_file_path))\n {\n cerr << \"cannot write to \" << output_image_file_path << endl;\n return 1;\n }\n\n \/\/ done\n return 0;\n}\n\nint main(int argc, char **argv)\n{\n try\n {\n return Main(argc, argv);\n } \n catch(Exception e)\n { \n cout << e.Message() << endl;\n return 1;\n }\n}\n\n<commit_msg>r and g channels are x and y<commit_after>\/*\n Tile.cpp\n\n tileable image generation\n\n Li-Yi Wei\n April 25, 2018\n\n*\/\n\n#include <iostream>\n#include <string>\nusing namespace std;\n\n#include \"Texture.hpp\"\n#include \"VectorRange.hpp\"\n\n#include \"SequentialCounter.hpp\"\n#include \"FrameBuffer.hpp\"\n#include \"Random.hpp\"\n#include \"Utility.hpp\"\n#include \"Exception.hpp\"\n\nstring Convert(const vector<int> & output_size, Array<Position> & coord_array)\n{\n coord_array = Array<Position>(output_size);\n\n SequentialCounter counter(output_size.size(), vector<int>(output_size.size(), 0), Utility::Minus1(output_size));\n \n vector<int> index;\n counter.Reset();\n \n do\n {\n counter.Get(index);\n\n if(! coord_array.Put(index, index))\n {\n return \"cannot put position\";\n }\n }\n while(counter.Next());\n\n \/\/ done\n return \"\";\n}\n\nstring Convert(const Array<FrameBuffer::P3> & coord_image, Array<Position> & coord_array)\n{\n const vector<int> output_size = coord_image.Size();\n coord_array = Array<Position>(output_size);\n\n SequentialCounter counter(output_size.size(), vector<int>(output_size.size(), 0), Utility::Minus1(output_size));\n \n FrameBuffer::P3 pixel;\n Position position(2);\n vector<int> index;\n counter.Reset();\n \n do\n {\n counter.Get(index);\n \n if(! coord_image.Get(index, pixel))\n {\n return \"cannot get pixel\";\n }\n\n position[0] = pixel.g;\n position[1] = pixel.r;\n\n if(! coord_array.Put(index, position))\n {\n return \"cannot put position\";\n }\n }\n while(counter.Next());\n\n \/\/ done\n return \"\";\n}\n\nint Main(int argc, char **argv)\n{\n \/\/ input arguments\n if(argc < 8)\n {\n cerr << \"Usage: \" << argv[0] << \" input_image_file_path init_coord_spec input_boundary (toroidal or none) synthesizer_spec sequencer_spec neighborhood_spec (e.g. square1) output_image_file_path\" << endl;\n return 1;\n }\n \n int arg_ctr = 0;\n \n const string input_image_file_path(argv[++arg_ctr]);\n const string init_coord_spec(argv[++arg_ctr]);\n const string input_boundary(argv[++arg_ctr]);\n const string output_boundary(\"toroidal\");\n const string synthesis_spec(argv[++arg_ctr]);\n const string sequence_spec(argv[++arg_ctr]);\n const string neighborhood_spec(argv[++arg_ctr]);\n const string output_image_file_path(argv[++arg_ctr]);\n\n \/\/ input image\n Array<FrameBuffer::P3> input_image;\n int max_pixel_value = -1;\n if(! FrameBuffer::ReadPPM(input_image_file_path, input_image, max_pixel_value))\n {\n cerr << \"cannot read from \" << input_image_file_path << endl;\n return 1;\n }\n\n const Texture input_texture(input_image);\n \n const int dimension = input_texture.Dimension();\n\n \/\/ init coord\n Array<Position> init_coord;\n {\n Array<FrameBuffer::P3> init_coord_image;\n int max_coord_value = -1;\n\n string message;\n if(FrameBuffer::ReadPPM(init_coord_spec, init_coord_image, max_coord_value))\n {\n message = Convert(init_coord_image, init_coord);\n }\n else\n {\n message = Convert(input_image.Size(), init_coord);\n }\n \n if(message != \"\")\n {\n cerr << \"error in converting coord image: \" << message << endl;\n return 1;\n }\n }\n\n \/\/ domain and neighborhood\n const shared_ptr<Domain> p_input_domain = Utility::BuildDomain(input_boundary);\n const shared_ptr<Domain> p_output_domain = Utility::BuildDomain(output_boundary);\n\n if(!p_input_domain || !p_output_domain)\n {\n cerr << \"null domain\" << endl;\n return 1;\n }\n\n const Domain & input_domain = *p_input_domain;\n const Domain & output_domain = *p_output_domain;\n\n const shared_ptr<Templar> p_templar = Utility::BuildTemplar(neighborhood_spec, dimension);\n if(!p_templar)\n {\n cerr << \"null templar\" << endl;\n return 1;\n }\n\n const shared_ptr<Neighborhood> p_output_neighborhood = Utility::BuildNeighborhood(*p_templar, output_domain);\n\n const Neighborhood & output_neighborhood = *p_output_neighborhood;\n\n \/\/ range\n const int range_dimension = 3; \/\/ RGB\n\n const RangePtr penalty_range(new VectorRange<int>(vector<int>(range_dimension, max_pixel_value)));\n const RangePtr zero_range(new VectorRange<int>(vector<int>(range_dimension, 0)));\n\n \/\/ initialization\n Random::InitRandomNumberGenerator();\n\n \/\/ output texture\n Texture output_texture(input_texture, init_coord);\n\n \/\/ synthesis\n const string message = Utility::Synthesize(input_boundary, output_boundary, synthesis_spec, sequence_spec, neighborhood_spec, input_texture, output_texture, penalty_range, zero_range);\n\n if(message != \"\")\n {\n cerr << \"error in synthesis: \" << message << endl;\n return 1;\n }\n\n \/\/ output\n Array<FrameBuffer::P3> output_image;\n if(!output_texture.Convert(output_image))\n {\n cerr << \"cannot convert output\" << endl;\n return 1;\n }\n\n if(! FrameBuffer::WritePPM(output_image, max_pixel_value, output_image_file_path))\n {\n cerr << \"cannot write to \" << output_image_file_path << endl;\n return 1;\n }\n\n \/\/ done\n return 0;\n}\n\nint main(int argc, char **argv)\n{\n try\n {\n return Main(argc, argv);\n } \n catch(Exception e)\n { \n cout << e.Message() << endl;\n return 1;\n }\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"command_manager.hh\"\n\n#include \"utils.hh\"\n#include \"assert.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\nvoid CommandManager::register_command(const std::string& command_name, Command command,\n const CommandCompleter& completer)\n{\n m_commands[command_name] = CommandAndCompleter { command, completer };\n}\n\nvoid CommandManager::register_command(const std::vector<std::string>& command_names, Command command,\n const CommandCompleter& completer)\n{\n for (auto command_name : command_names)\n register_command(command_name, command, completer);\n}\n\ntypedef std::vector<std::pair<size_t, size_t>> TokenList;\nstatic TokenList split(const std::string& line)\n{\n TokenList result;\n\n size_t pos = 0;\n while (pos != line.length())\n {\n while(line[pos] == ' ' and pos != line.length())\n ++pos;\n\n size_t token_start = pos;\n\n while((line[pos] != ' ' or line[pos-1] == '\\\\') and pos != line.length())\n ++pos;\n\n result.push_back(std::make_pair(token_start, pos));\n }\n return result;\n}\n\nstruct command_not_found : runtime_error\n{\n command_not_found(const std::string& command)\n : runtime_error(command + \" : no such command\") {}\n};\n\nvoid CommandManager::execute(const std::string& command_line)\n{\n TokenList tokens = split(command_line);\n if (tokens.empty())\n return;\n\n std::string command_name =\n command_line.substr(tokens[0].first,\n tokens[0].second - tokens[0].first);\n\n auto command_it = m_commands.find(command_name);\n if (command_it == m_commands.end())\n throw command_not_found(command_name);\n\n CommandParameters params;\n for (auto it = tokens.begin() + 1; it != tokens.end(); ++it)\n {\n params.push_back(command_line.substr(it->first,\n it->second - it->first));\n }\n\n command_it->second.command(params);\n}\n\nCompletions CommandManager::complete(const std::string& command_line, size_t cursor_pos)\n{\n TokenList tokens = split(command_line);\n\n size_t token_to_complete = -1;\n for (size_t i = 0; i < tokens.size(); ++i)\n {\n if (tokens[i].first < cursor_pos and tokens[i].second >= cursor_pos)\n {\n token_to_complete = i;\n break;\n }\n }\n\n if (token_to_complete == 0) \/\/ command name completion\n {\n Completions result(tokens[0].first, cursor_pos);\n std::string prefix = command_line.substr(tokens[0].first,\n cursor_pos - tokens[0].first);\n\n for (auto& command : m_commands)\n {\n if (command.first.substr(0, prefix.length()) == prefix)\n result.candidates.push_back(command.first);\n }\n\n return result;\n }\n\n assert(not tokens.empty());\n std::string command_name =\n command_line.substr(tokens[0].first,\n tokens[0].second - tokens[0].first);\n\n auto command_it = m_commands.find(command_name);\n if (command_it == m_commands.end() or not command_it->second.completer)\n return Completions();\n\n CommandParameters params;\n for (auto it = tokens.begin() + 1; it != tokens.end(); ++it)\n {\n params.push_back(command_line.substr(it->first,\n it->second - it->first));\n }\n Completions result(tokens[token_to_complete].first, cursor_pos);\n size_t cursor_pos_in_token = cursor_pos - tokens[token_to_complete].first;\n\n result.candidates = command_it->second.completer(params,\n token_to_complete - 1,\n cursor_pos_in_token);\n return result;\n}\n\nCandidateList PerArgumentCommandCompleter::operator()(const CommandParameters& params,\n size_t token_to_complete,\n size_t pos_in_token) const\n{\n if (token_to_complete >= m_completers.size())\n return CandidateList();\n\n \/\/ it is possible to try to complete a new argument\n assert(token_to_complete <= params.size());\n\n const std::string& argument = token_to_complete < params.size() ?\n params[token_to_complete] : std::string();\n return m_completers[token_to_complete](argument, pos_in_token);\n}\n\n}\n<commit_msg>CommandManager: fix completion of empty tokens<commit_after>#include \"command_manager.hh\"\n\n#include \"utils.hh\"\n#include \"assert.hh\"\n\n#include <algorithm>\n\nnamespace Kakoune\n{\n\nvoid CommandManager::register_command(const std::string& command_name, Command command,\n const CommandCompleter& completer)\n{\n m_commands[command_name] = CommandAndCompleter { command, completer };\n}\n\nvoid CommandManager::register_command(const std::vector<std::string>& command_names, Command command,\n const CommandCompleter& completer)\n{\n for (auto command_name : command_names)\n register_command(command_name, command, completer);\n}\n\ntypedef std::vector<std::pair<size_t, size_t>> TokenList;\nstatic TokenList split(const std::string& line)\n{\n TokenList result;\n\n size_t pos = 0;\n while (pos != line.length())\n {\n while(line[pos] == ' ' and pos != line.length())\n ++pos;\n\n size_t token_start = pos;\n\n while((line[pos] != ' ' or line[pos-1] == '\\\\') and pos != line.length())\n ++pos;\n\n result.push_back(std::make_pair(token_start, pos));\n }\n return result;\n}\n\nstruct command_not_found : runtime_error\n{\n command_not_found(const std::string& command)\n : runtime_error(command + \" : no such command\") {}\n};\n\nvoid CommandManager::execute(const std::string& command_line)\n{\n TokenList tokens = split(command_line);\n if (tokens.empty())\n return;\n\n std::string command_name =\n command_line.substr(tokens[0].first,\n tokens[0].second - tokens[0].first);\n\n auto command_it = m_commands.find(command_name);\n if (command_it == m_commands.end())\n throw command_not_found(command_name);\n\n CommandParameters params;\n for (auto it = tokens.begin() + 1; it != tokens.end(); ++it)\n {\n params.push_back(command_line.substr(it->first,\n it->second - it->first));\n }\n\n command_it->second.command(params);\n}\n\nCompletions CommandManager::complete(const std::string& command_line, size_t cursor_pos)\n{\n TokenList tokens = split(command_line);\n\n size_t token_to_complete = -1;\n for (size_t i = 0; i < tokens.size(); ++i)\n {\n if (tokens[i].first <= cursor_pos and tokens[i].second >= cursor_pos)\n {\n token_to_complete = i;\n break;\n }\n }\n\n if (token_to_complete == 0 or tokens.empty()) \/\/ command name completion\n {\n size_t cmd_start = tokens.empty() ? 0 : tokens[0].first;\n Completions result(cmd_start, cursor_pos);\n std::string prefix = command_line.substr(cmd_start,\n cursor_pos - cmd_start);\n\n for (auto& command : m_commands)\n {\n if (command.first.substr(0, prefix.length()) == prefix)\n result.candidates.push_back(command.first);\n }\n\n return result;\n }\n\n assert(not tokens.empty());\n std::string command_name =\n command_line.substr(tokens[0].first,\n tokens[0].second - tokens[0].first);\n\n auto command_it = m_commands.find(command_name);\n if (command_it == m_commands.end() or not command_it->second.completer)\n return Completions();\n\n CommandParameters params;\n for (auto it = tokens.begin() + 1; it != tokens.end(); ++it)\n {\n params.push_back(command_line.substr(it->first,\n it->second - it->first));\n }\n Completions result(tokens[token_to_complete].first, cursor_pos);\n size_t cursor_pos_in_token = cursor_pos - tokens[token_to_complete].first;\n\n result.candidates = command_it->second.completer(params,\n token_to_complete - 1,\n cursor_pos_in_token);\n return result;\n}\n\nCandidateList PerArgumentCommandCompleter::operator()(const CommandParameters& params,\n size_t token_to_complete,\n size_t pos_in_token) const\n{\n if (token_to_complete >= m_completers.size())\n return CandidateList();\n\n \/\/ it is possible to try to complete a new argument\n assert(token_to_complete <= params.size());\n\n const std::string& argument = token_to_complete < params.size() ?\n params[token_to_complete] : std::string();\n return m_completers[token_to_complete](argument, pos_in_token);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file AuxiliarySimulationFunctions.cc\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date 2010-06-30\n\/\/!\n\/\/! @brief Contains a second order integrator utility with provision for some damping\n\/\/!\n\/\/$Id$\n\n#include \"ComponentUtilities\/AuxiliarySimulationFunctions.h\"\n#include <cmath>\n#include <limits>\n\nusing namespace hopsan;\n\n\/\/! @defgroup ComponentUtilities ComponentUtilities\n\/\/! @defgroup AuxiliarySimulationFunctions AuxiliarySimulationFunctions\n\/\/! @ingroup ComponentUtilities\n\/\/! @defgroup ComponentUtilityClasses ComponentUtilityClasses\n\/\/! @ingroup ComponentUtilities\n\n\n\/\/! @brief Limits a value so it is between min and max\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param &rValue Reference pointer to the value\n\/\/! @param min Lower limit of the value\n\/\/! @param max Upper limit of the value\nvoid hopsan::limitValue(double &rValue, double min, double max)\n{\n if(min>max)\n {\n double temp;\n temp = max;\n max = min;\n min = temp;\n }\n if(rValue > max)\n {\n rValue = max;\n }\n else if(rValue < min)\n {\n rValue = min;\n }\n}\n\n\n\/\/! @brief checks if two double variables are equal with a tolerance\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param [in] x First value\n\/\/! @param [in] y Second value\n\/\/! @param [in] epsilon Allowed relative error\n\/\/! @note Based on http:\/\/floating-point-gui.de\/errors\/comparison (20130429)\nbool hopsan::fuzzyEqual(const double x, const double y, const double epsilon)\n{\n const double absX = fabs(x);\n const double absY = fabs(y);\n const double diff = fabs(x-y);\n\n \/\/ shortcut, handles infinities\n if (x == y)\n {\n return true;\n }\n \/\/ a or b is zero or both are extremely close to it\n \/\/ relative error is less meaningful here\n else if (x == 0 || y == 0 || diff < epsilon * std::numeric_limits<double>::epsilon() ) \/\/! @todo Added multiplication with epsilon here, otherwise it may return false without ever reaching the second comparison\n {\n return diff < (epsilon * std::numeric_limits<double>::epsilon() );\n }\n \/\/ use relative error\n else\n {\n return diff \/ (absX + absY) < epsilon;\n }\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::signedSquareL(const double x, const double x0)\n{\n\/\/ return (-sqrt(x0) + sqrt(x0 + fabs(x))) * sign(x);\n return fabs(x)*pow(1\/(pow(x0,2) + pow(fabs(x),2)),0.25)*sign(x);\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxSignedSquareL(const double x, const double x0)\n{\n\/\/ return (1.0 \/ (sqrt(x0 + fabs(x)) * 2.0));\n return (pow(1\/(pow(x0,2) + pow(fabs(x),2)),1.25)*(2*pow(x0,2) + pow(fabs(x),2))*\n dxAbs(x)*sign(x))\/2.;\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::squareAbsL(const double x, const double x0)\n{\n return (-sqrt(x0) + sqrt(x0 + fabs(x)));\n}\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxSquareAbsL(const double x, const double x0)\n{\n return 1.0 \/ (sqrt(x0 + fabs(x)) * 2.0) * sign(x);\n}\n\n\/\/! @brief Safe variant of atan2\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::Atan2L(const double y, const double x)\n{\n if (x!=0 || y!=0)\n {\n return atan2(y,x);\n }\n else\n {\n return 0;\n }\n}\n\n\/\/! @brief Returns 1.0 if input variables have same sign, else returns 0.0\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::equalSigns(const double x, const double y)\n{\n\/\/ \/\/! @warning This will NOT work (double != double)\n\/\/ if (hopsan::sign(x) != hopsan::sign(y)) {\n\/\/ return 0.0;\n\/\/ }\n\/\/ return 1.0;\n\n if ( ((x < 0.0) && ( y < 0.0)) || ((x >= 0.0) && (y >= 0.0)) )\n {\n return 1.0;\n }\n else\n {\n return 0.0;\n }\n}\n\n\/\/! @brief Safe variant of asin\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::ArcSinL(const double x)\n{\n return asin(limit(x,-0.9999999999,0.9999999999));\n}\n\n\/\/! @brief derivative of AsinL\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxArcSinL(const double x)\n{\n return 1.0\/sqrt(1 - pow(limit(x,-0.9999999999,0.9999999999),2));\n}\n\n\/\/! @brief difference between two angles, fi1-fi2\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::diffAngle(const double fi1, const double fi2)\n{ double output;\n double output0 = fi1-fi2;\n double output1 = fi1-fi2 + 2.0*pi;\n double output2 = fi1-fi2 - 2.0*pi;\n output = output0;\n if (fabs(output0)>= fabs(output1)){output = output1;}\n if (fabs(output0)>= fabs(output2)){output = output2;}\n\n return output;\n}\n\n\/\/! @brief Lift coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CLift(const double alpha, const double CLalpha, const double ap, const double an, const double awp, const double awn)\n{\n return (1 - 1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) - 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*alpha*\n CLalpha + 0.707107*(1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) +\n 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*sin(2*alpha);\n}\n\n\/\/! @brief Induced drag coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CDragInd(const double alpha, const double AR, const double e, const double CLalpha, const double ap, const double an, const double awp, const double awn)\n{\n return (0.31831*(1 - 1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) - 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*\n pow(alpha,2)*pow(CLalpha,2))\/(AR*e) +\n (1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) + 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*\n pow(sin(alpha),2);\n}\n\n\/\/! @brief Moment coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CMoment(const double alpha, const double Cm0, const double Cmfs, const double \/*ap*\/, const double \/*an*\/, const double \/*awp*\/, const double \/*awn*\/)\n{\n return (1 - 1\/(1 + pow(2.71828,-20.*(-0.5 - alpha))) - 1\/(1 + pow(2.71828,-20.*(-0.5 + alpha))))*Cm0 +\n (1\/(1 + pow(2.71828,-20.*(-0.5 - alpha))) + 1\/(1 + pow(2.71828,-20.*(-0.5 + alpha))))*Cmfs*sign(alpha);\n}\n\n\/\/! @brief Overloads void hopsan::limitValue() with a return value.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @see void hopsan::limitValue(&value, min, max)\n\/\/! @param x Value to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\ndouble hopsan::limit(const double x, const double xmin, const double xmax)\n{\n double output = x;\n limitValue(output, xmin, xmax);\n return output;\n}\n\n\n\/\/! @brief Limits a value to a lower limit\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param x Value to be limited\n\/\/! @param xmin Minimum value of x\ndouble hopsan::lowLimit(const double x, const double xmin)\n{\n if(x < xmin)\n {\n return xmin;\n }\n else\n {\n return x;\n }\n}\n\n\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLimit(const double x, const double xmin, const double xmax)\n{\n if (x >= xmax) { return 0.000000001; }\n if (x <= xmin) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLowLimit(const double x,const double xmin)\n{\n if (x <= xmin) { return 0.000000001; }\n return 1.0;\n}\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLowLimit2(const double x, const double sx, const double xmin)\n{\n if (x <= xmin && sx <= 0.0) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Limits the derivative of x when x is outside of its limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! Returns 1.0 if x is within borders, or if x is outside borders but derivative has opposite sign (so that x can only move back to the limited range).\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLimit2(const double x, const double sx, const double xmin, const double xmax)\n{\n if (x >= xmax && sx >= 0.0) { return 0.000000001; }\n if (x <= xmin && sx <= 0.0) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Returns the algebraic quotient x\/y with any fractional parts discarded\n\/\/! @ingroup AuxiliarySimlationFunctions\n\/\/! @ingroup ModelicaWrapperFunctions\n\/\/! @param x Numerator\n\/\/! @param y Denominator\n\/\/! @returns Algebraic quotient with any fractional parts discarded\ndouble hopsan::div(const double x, const double y)\n{\n if(x\/y > 0)\n {\n return floor(x\/y);\n }\n else\n {\n return ceil(x\/y);\n }\n}\n<commit_msg>segare added<commit_after>\/*-----------------------------------------------------------------------------\n This source file is part of Hopsan NG\n\n Copyright (c) 2011 \n Mikael Axin, Robert Braun, Alessandro Dell'Amico, Björn Eriksson,\n Peter Nordin, Karl Pettersson, Petter Krus, Ingo Staack\n\n This file is provided \"as is\", with no guarantee or warranty for the\n functionality or reliability of the contents. All contents in this file is\n the original work of the copyright holders at the Division of Fluid and\n Mechatronic Systems (Flumes) at Linköping University. Modifying, using or\n redistributing any part of this file is prohibited without explicit\n permission from the copyright holders.\n-----------------------------------------------------------------------------*\/\n\n\/\/!\n\/\/! @file AuxiliarySimulationFunctions.cc\n\/\/! @author Robert Braun <robert.braun@liu.se>\n\/\/! @date 2010-06-30\n\/\/!\n\/\/! @brief Contains a second order integrator utility with provision for some damping\n\/\/!\n\/\/$Id$\n\n#include \"ComponentUtilities\/AuxiliarySimulationFunctions.h\"\n#include <cmath>\n#include <limits>\n\nusing namespace hopsan;\n\n\/\/! @defgroup ComponentUtilities ComponentUtilities\n\/\/! @defgroup AuxiliarySimulationFunctions AuxiliarySimulationFunctions\n\/\/! @ingroup ComponentUtilities\n\/\/! @defgroup ComponentUtilityClasses ComponentUtilityClasses\n\/\/! @ingroup ComponentUtilities\n\n\n\/\/! @brief Limits a value so it is between min and max\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param &rValue Reference pointer to the value\n\/\/! @param min Lower limit of the value\n\/\/! @param max Upper limit of the value\nvoid hopsan::limitValue(double &rValue, double min, double max)\n{\n if(min>max)\n {\n double temp;\n temp = max;\n max = min;\n min = temp;\n }\n if(rValue > max)\n {\n rValue = max;\n }\n else if(rValue < min)\n {\n rValue = min;\n }\n}\n\n\n\/\/! @brief checks if two double variables are equal with a tolerance\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param [in] x First value\n\/\/! @param [in] y Second value\n\/\/! @param [in] epsilon Allowed relative error\n\/\/! @note Based on http:\/\/floating-point-gui.de\/errors\/comparison (20130429)\nbool hopsan::fuzzyEqual(const double x, const double y, const double epsilon)\n{\n const double absX = fabs(x);\n const double absY = fabs(y);\n const double diff = fabs(x-y);\n\n \/\/ shortcut, handles infinities\n if (x == y)\n {\n return true;\n }\n \/\/ a or b is zero or both are extremely close to it\n \/\/ relative error is less meaningful here\n else if (x == 0 || y == 0 || diff < epsilon * std::numeric_limits<double>::epsilon() ) \/\/! @todo Added multiplication with epsilon here, otherwise it may return false without ever reaching the second comparison\n {\n return diff < (epsilon * std::numeric_limits<double>::epsilon() );\n }\n \/\/ use relative error\n else\n {\n return diff \/ (absX + absY) < epsilon;\n }\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::signedSquareL(const double x, const double x0)\n{\n\/\/ return (-sqrt(x0) + sqrt(x0 + fabs(x))) * sign(x);\n return fabs(x)*pow(1\/(pow(x0,2) + pow(fabs(x),2)),0.25)*sign(x);\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxSignedSquareL(const double x, const double x0)\n{\n\/\/ return (1.0 \/ (sqrt(x0 + fabs(x)) * 2.0));\n return (pow(1\/(pow(x0,2) + pow(fabs(x),2)),1.25)*(2*pow(x0,2) + pow(fabs(x),2))*\n dxAbs(x)*sign(x))\/2.;\n}\n\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::squareAbsL(const double x, const double x0)\n{\n return (-sqrt(x0) + sqrt(x0 + fabs(x)));\n}\n\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxSquareAbsL(const double x, const double x0)\n{\n return 1.0 \/ (sqrt(x0 + fabs(x)) * 2.0) * sign(x);\n}\n\n\/\/! @brief Safe variant of atan2\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::Atan2L(const double y, const double x)\n{\n if (x!=0 || y!=0)\n {\n return atan2(y,x);\n }\n else\n {\n return 0;\n }\n}\n\n\/\/! @brief Returns 1.0 if input variables have same sign, else returns 0.0\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::equalSigns(const double x, const double y)\n{\n\/\/ \/\/! @warning This will NOT work (double != double)\n\/\/ if (hopsan::sign(x) != hopsan::sign(y)) {\n\/\/ return 0.0;\n\/\/ }\n\/\/ return 1.0;\n\n if ( ((x < 0.0) && ( y < 0.0)) || ((x >= 0.0) && (y >= 0.0)) )\n {\n return 1.0;\n }\n else\n {\n return 0.0;\n }\n}\n\n\/\/! @brief Safe variant of asin\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::ArcSinL(const double x)\n{\n return asin(limit(x,-0.9999999999,0.9999999999));\n}\n\n\/\/! @brief derivative of AsinL\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxArcSinL(const double x)\n{\n return 1.0\/sqrt(1 - pow(limit(x,-0.9999999999,0.9999999999),2));\n}\n\n\/\/! @brief difference between two angles, fi1-fi2\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::diffAngle(const double fi1, const double fi2)\n{ double output;\n double output0 = fi1-fi2;\n double output1 = fi1-fi2 + 2.0*pi;\n double output2 = fi1-fi2 - 2.0*pi;\n output = output0;\n if (fabs(output0)>= fabs(output1)){output = output1;}\n if (fabs(output0)>= fabs(output2)){output = output2;}\n\n return output;\n}\n\n\/\/! @brief Lift coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CLift(const double alpha, const double CLalpha, const double ap, const double an, const double awp, const double awn)\n{\n return (1 - 1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) - 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*alpha*\n CLalpha + 0.707107*(1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) +\n 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*sin(2*alpha);\n}\n\n\/\/! @brief Induced drag coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CDragInd(const double alpha, const double AR, const double e, const double CLalpha, const double ap, const double an, const double awp, const double awn)\n{\n return (0.31831*(1 - 1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) - 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*\n pow(alpha,2)*pow(CLalpha,2))\/(AR*e) +\n (1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) + 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*\n pow(sin(alpha),2);\n}\n\n\/\/! @brief Moment coefficient for aircraft model\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::CMoment(const double alpha, const double Cm0, const double Cmfs, const double ap, const double an, const double awp, const double awn)\n{\n return (1 - 1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) - 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*Cm0 +\n (1\/(1 + pow(2.71828,(-2*(-alpha - an))\/awn)) + 1\/(1 + pow(2.71828,(-2*(alpha - ap))\/awp)))*Cmfs*sign(alpha);\n}\n\n\/\/! @brief Segment area, used to calculate valve openings with circular holes\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::segare(const double x, const double d)\n{\n double x1;\n x1=x;\n if(x < 0)\n {\n x1=0;\n }\n else\n {\n if(x > d)\n {\n x1=d;\n }\n else\n {\n x1=x;\n }\n }\n return -(d*(2*(d - 2*x1)*sqrt(((d - x1)*x1)\/pow(d,2)) - d*acos(1 - (2*x1)\/d)))\/4.;\n}\n\/\/! @brief Segment area, used to calculate valve openings with circular holes\n\/\/! @ingroup AuxiliarySimulationFunctions\ndouble hopsan::dxSegare(const double x, const double d)\n{\n double x1;\n x1=x;\n if(x < 0)\n {\n x1=0;\n }\n else\n {\n if(x > d)\n {\n x1=d;\n }\n else\n {\n x1=x;\n }\n }\n return 2*sqrt((d - x)*x);\n}\n\n\/\/! @brief Overloads void hopsan::limitValue() with a return value.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @see void hopsan::limitValue(&value, min, max)\n\/\/! @param x Value to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\ndouble hopsan::limit(const double x, const double xmin, const double xmax)\n{\n double output = x;\n limitValue(output, xmin, xmax);\n return output;\n}\n\n\n\/\/! @brief Limits a value to a lower limit\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @param x Value to be limited\n\/\/! @param xmin Minimum value of x\ndouble hopsan::lowLimit(const double x, const double xmin)\n{\n if(x < xmin)\n {\n return xmin;\n }\n else\n {\n return x;\n }\n}\n\n\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLimit(const double x, const double xmin, const double xmax)\n{\n if (x >= xmax) { return 0.000000001; }\n if (x <= xmin) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLowLimit(const double x,const double xmin)\n{\n if (x <= xmin) { return 0.000000001; }\n return 1.0;\n}\n\/\/! @brief Sets the derivative of x to zero if x is outside of limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! @details Returns 1.0 if x is within limits, else 0.0. Used to make the derivative of x zero if limit is reached.\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLowLimit2(const double x, const double sx, const double xmin)\n{\n if (x <= xmin && sx <= 0.0) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Limits the derivative of x when x is outside of its limits.\n\/\/! @ingroup AuxiliarySimulationFunctions\n\/\/! Returns 1.0 if x is within borders, or if x is outside borders but derivative has opposite sign (so that x can only move back to the limited range).\n\/\/! @param x Value whose derivative is to be limited\n\/\/! @param xmin Minimum value of x\n\/\/! @param xmax Maximum value of x\n\/\/! @returns Limited derivative of x\ndouble hopsan::dxLimit2(const double x, const double sx, const double xmin, const double xmax)\n{\n if (x >= xmax && sx >= 0.0) { return 0.000000001; }\n if (x <= xmin && sx <= 0.0) { return 0.000000001; }\n return 1.0;\n}\n\n\/\/! @brief Returns the algebraic quotient x\/y with any fractional parts discarded\n\/\/! @ingroup AuxiliarySimlationFunctions\n\/\/! @ingroup ModelicaWrapperFunctions\n\/\/! @param x Numerator\n\/\/! @param y Denominator\n\/\/! @returns Algebraic quotient with any fractional parts discarded\ndouble hopsan::div(const double x, const double y)\n{\n if(x\/y > 0)\n {\n return floor(x\/y);\n }\n else\n {\n return ceil(x\/y);\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n OpenLieroX\n \n version parsing\n \n file created 29-02-2008 by albert\n code under LGPL\n *\/\n\n#include \"Version.h\"\n#include \"LieroX.h\"\n#include \"Debug.h\"\n#include \"AuxLib.h\"\n#include \"CodeAttributes.h\"\n\n\n#include \"Version_generated.h\"\n\n#ifndef\t\tLX_VERSION\n#\tdefine\t\tLX_VERSION\t\"0.59_beta10\"\n#endif\n\n#define\t\tGAMENAME\t\t\t\"OpenLieroX\"\n\n\n#ifndef ONLY_MACRODEF \/\/ The above defines are used in resurce.rc\n\nconst char* const fullGameName = GAMENAME \"\/\" LX_VERSION;\n\nconst char* GetGameName() {\n\treturn GAMENAME;\n}\n\nINLINE void setByString__optionalPostCheck(const Version* version, const std::string& versionStr) {\n#ifdef DEBUG\n\tif(version->asString() != versionStr) {\n\t\tnotes << \"WARNING: Version::setByString: '\" << versionStr << \"' get parsed as '\" << version->asString() << \"'\" << endl;\n\t}\n#endif\n}\n\nvoid Version::setByString(const std::string& versionStr) {\n\tif(versionStr == \"\") { reset(); setByString__optionalPostCheck(this,versionStr); return; }\n\n\tstd::string tmp = versionStr;\n\n\tsize_t p = tmp.find_first_of(\" \/\\\\\");\n\tif(p == std::string::npos)\n\t\tgamename = \"OpenLieroX\"; \/\/ old OLX sends sometimes not its name\n\telse {\n\t\tgamename = tmp.substr(0, p);\n\t\ttmp.erase(0, p + 1);\n\t}\n\n\t\/\/ reset some values\n\tnum = subnum = subsubnum = revnum = 0;\n\treleasetype = RT_NORMAL;\n\tstringlwr(tmp); \/\/ to have beta instead of Beta\n\n\t\/\/ num\n\tp = tmp.find(\".\");\n\tbool fail = false;\n\tnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { num = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ subnum\n\tp = tmp.find_first_of(\"._-\");\n\tsubnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { subnum = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ releasetype\n\tif(tmp == \"\") { setByString__optionalPostCheck(this,versionStr); return; }\n\tsize_t nextNumP = tmp.find_first_of(\"0123456789\");\n\tif(nextNumP == 0)\n\t\treleasetype = RT_NORMAL;\n\telse if(tmp.find(\"alpha\") == 0)\n\t\treleasetype = RT_ALPHA;\n\telse if(tmp.find(\"beta\") == 0)\n\t\treleasetype = RT_BETA;\n\telse if(tmp.find(\"rc\") == 0)\n\t\treleasetype = RT_RC;\n\telse\n\t\treleasetype = RT_UNKNOWN;\n\ttmp.erase(0, nextNumP);\n\n\t\/\/ subsubnum\n\tif(tmp == \"\") { setByString__optionalPostCheck(this,versionStr); return; }\n\tif(tmp.find_first_of(\".\") == 0) tmp.erase(0, 1);\n\tp = tmp.find_first_of(\"._-\");\n\tsubsubnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { subsubnum = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ revnum\n\tnextNumP = tmp.find_first_of(\"0123456789\");\n\tif(nextNumP == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, nextNumP);\n\trevnum = from_string<int>(tmp, fail);\n\tif(fail) revnum = 0;\n\n\tsetByString__optionalPostCheck(this,versionStr); return;\n}\n\n\nstd::string Version::asString() const {\n\tstd::string ret = gamename;\n\tret += \"\/\";\n\tret += itoa(num);\n\tret += \".\";\n\tret += itoa(subnum);\n\n\tif(subsubnum > 0) {\n\t\tswitch(releasetype) {\n\t\tcase RT_NORMAL: ret += \".\"; break;\n\t\tcase RT_ALPHA: ret += \"_alpha\"; break;\n\t\tcase RT_BETA: ret += \"_beta\"; break;\n\t\tcase RT_RC: ret += \"_rc\"; break;\n\t\tcase RT_UNKNOWN: ret += \"_\"; break;\n\t\t}\n\t\tret += itoa(subsubnum);\n\t}\n\n\tif(revnum > 0) {\n\t\tret += \"_r\";\n\t\tret += itoa(revnum);\n\t}\n\n\treturn ret;\n}\n\nstd::string Version::asHumanString() const\n{\n\tstd::string ret = gamename;\n\tret += \" \";\n\tret += itoa(num);\n\tret += \".\";\n\tret += itoa(subnum);\n\n\tif(subsubnum > 0) {\n\t\tswitch(releasetype) {\n\t\tcase RT_NORMAL: ret += \".\"; break;\n\t\tcase RT_ALPHA: ret += \" alpha \"; break;\n\t\tcase RT_BETA: ret += \" beta \"; break;\n\t\tcase RT_RC: ret += \" rc \"; break;\n\t\tcase RT_UNKNOWN: ret += \" \"; break;\n\t\t}\n\t\tret += itoa(subsubnum);\n\t}\n\n\treturn ret;\n}\n\nstd::string Version::releaseType() const\n{\n\tswitch(releasetype) {\n\tcase RT_NORMAL: return \"final\";\n\tcase RT_ALPHA: return \"alpha\";\n\tcase RT_BETA: return \"beta\";\n\tcase RT_RC: return \"rc\";\n\tcase RT_UNKNOWN: return \"unknown\";\n\t}\n\n\treturn \"error\"; \/\/ should not happen\n}\n\n\nstatic Version gameVersion(GetFullGameName());\n\nconst Version& GetGameVersion() {\n\treturn gameVersion;\n}\n\n\nbool Version::isBanned() const {\n\treturn\n\t*this == OLXBetaVersion(9) || \/\/ too much different games with this branding around\n\t*this == OLXBetaVersion(0,58,1) || \/\/ TODO: ehm, what was it again?\n\t(*this >= OLXBetaVersion(0,59,1) && *this <= OLXBetaVersion(0,59,4)); \/\/ Gusanos protocol has changed\n}\n\n\n#endif \/\/ ONLY_MACRODEF\n<commit_msg>banned versions: any other alpha\/beta expect the current<commit_after>\/*\n OpenLieroX\n \n version parsing\n \n file created 29-02-2008 by albert\n code under LGPL\n *\/\n\n#include \"Version.h\"\n#include \"LieroX.h\"\n#include \"Debug.h\"\n#include \"AuxLib.h\"\n#include \"CodeAttributes.h\"\n\n\n#include \"Version_generated.h\"\n\n#ifndef\t\tLX_VERSION\n#\tdefine\t\tLX_VERSION\t\"0.59_beta10\"\n#endif\n\n#define\t\tGAMENAME\t\t\t\"OpenLieroX\"\n\n\n#ifndef ONLY_MACRODEF \/\/ The above defines are used in resurce.rc\n\nconst char* const fullGameName = GAMENAME \"\/\" LX_VERSION;\n\nconst char* GetGameName() {\n\treturn GAMENAME;\n}\n\nINLINE void setByString__optionalPostCheck(const Version* version, const std::string& versionStr) {\n#ifdef DEBUG\n\tif(version->asString() != versionStr) {\n\t\tnotes << \"WARNING: Version::setByString: '\" << versionStr << \"' get parsed as '\" << version->asString() << \"'\" << endl;\n\t}\n#endif\n}\n\nvoid Version::setByString(const std::string& versionStr) {\n\tif(versionStr == \"\") { reset(); setByString__optionalPostCheck(this,versionStr); return; }\n\n\tstd::string tmp = versionStr;\n\n\tsize_t p = tmp.find_first_of(\" \/\\\\\");\n\tif(p == std::string::npos)\n\t\tgamename = \"OpenLieroX\"; \/\/ old OLX sends sometimes not its name\n\telse {\n\t\tgamename = tmp.substr(0, p);\n\t\ttmp.erase(0, p + 1);\n\t}\n\n\t\/\/ reset some values\n\tnum = subnum = subsubnum = revnum = 0;\n\treleasetype = RT_NORMAL;\n\tstringlwr(tmp); \/\/ to have beta instead of Beta\n\n\t\/\/ num\n\tp = tmp.find(\".\");\n\tbool fail = false;\n\tnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { num = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ subnum\n\tp = tmp.find_first_of(\"._-\");\n\tsubnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { subnum = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ releasetype\n\tif(tmp == \"\") { setByString__optionalPostCheck(this,versionStr); return; }\n\tsize_t nextNumP = tmp.find_first_of(\"0123456789\");\n\tif(nextNumP == 0)\n\t\treleasetype = RT_NORMAL;\n\telse if(tmp.find(\"alpha\") == 0)\n\t\treleasetype = RT_ALPHA;\n\telse if(tmp.find(\"beta\") == 0)\n\t\treleasetype = RT_BETA;\n\telse if(tmp.find(\"rc\") == 0)\n\t\treleasetype = RT_RC;\n\telse\n\t\treleasetype = RT_UNKNOWN;\n\ttmp.erase(0, nextNumP);\n\n\t\/\/ subsubnum\n\tif(tmp == \"\") { setByString__optionalPostCheck(this,versionStr); return; }\n\tif(tmp.find_first_of(\".\") == 0) tmp.erase(0, 1);\n\tp = tmp.find_first_of(\"._-\");\n\tsubsubnum = from_string<int>(tmp.substr(0, p), fail);\n\tif(fail) { subsubnum = 0; setByString__optionalPostCheck(this,versionStr); return; }\n\tif(p == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, p + 1);\n\n\t\/\/ revnum\n\tnextNumP = tmp.find_first_of(\"0123456789\");\n\tif(nextNumP == std::string::npos) { setByString__optionalPostCheck(this,versionStr); return; }\n\ttmp.erase(0, nextNumP);\n\trevnum = from_string<int>(tmp, fail);\n\tif(fail) revnum = 0;\n\n\tsetByString__optionalPostCheck(this,versionStr); return;\n}\n\n\nstd::string Version::asString() const {\n\tstd::string ret = gamename;\n\tret += \"\/\";\n\tret += itoa(num);\n\tret += \".\";\n\tret += itoa(subnum);\n\n\tif(subsubnum > 0) {\n\t\tswitch(releasetype) {\n\t\tcase RT_NORMAL: ret += \".\"; break;\n\t\tcase RT_ALPHA: ret += \"_alpha\"; break;\n\t\tcase RT_BETA: ret += \"_beta\"; break;\n\t\tcase RT_RC: ret += \"_rc\"; break;\n\t\tcase RT_UNKNOWN: ret += \"_\"; break;\n\t\t}\n\t\tret += itoa(subsubnum);\n\t}\n\n\tif(revnum > 0) {\n\t\tret += \"_r\";\n\t\tret += itoa(revnum);\n\t}\n\n\treturn ret;\n}\n\nstd::string Version::asHumanString() const\n{\n\tstd::string ret = gamename;\n\tret += \" \";\n\tret += itoa(num);\n\tret += \".\";\n\tret += itoa(subnum);\n\n\tif(subsubnum > 0) {\n\t\tswitch(releasetype) {\n\t\tcase RT_NORMAL: ret += \".\"; break;\n\t\tcase RT_ALPHA: ret += \" alpha \"; break;\n\t\tcase RT_BETA: ret += \" beta \"; break;\n\t\tcase RT_RC: ret += \" rc \"; break;\n\t\tcase RT_UNKNOWN: ret += \" \"; break;\n\t\t}\n\t\tret += itoa(subsubnum);\n\t}\n\n\treturn ret;\n}\n\nstd::string Version::releaseType() const\n{\n\tswitch(releasetype) {\n\tcase RT_NORMAL: return \"final\";\n\tcase RT_ALPHA: return \"alpha\";\n\tcase RT_BETA: return \"beta\";\n\tcase RT_RC: return \"rc\";\n\tcase RT_UNKNOWN: return \"unknown\";\n\t}\n\n\treturn \"error\"; \/\/ should not happen\n}\n\n\nstatic Version gameVersion(GetFullGameName());\n\nconst Version& GetGameVersion() {\n\treturn gameVersion;\n}\n\n\nbool Version::isBanned() const {\n\tif(*this == OLXBetaVersion(9)) return true; \/\/ too much different games with this branding around\n\tif(*this == OLXBetaVersion(0,58,1)) return true; \/\/ TODO: ehm, what was it again?\n\tif(releasetype == RT_ALPHA || releasetype == RT_BETA)\n\t\tif(*this < GetGameVersion()) return true; \/\/ another earlier beta - dont trust it\n\treturn false;\n}\n\n\n#endif \/\/ ONLY_MACRODEF\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: i_comrela.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2004-07-12 15:14:06 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#include <precomp.h>\n#include <ary\/idl\/i_comrela.hxx>\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/ary.hxx>\n#include <ary\/idl\/i_gate.hxx>\n#include <ary\/idl\/ip_ce.hxx>\n#include <ary\/idl\/ip_type.hxx>\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\/\/ KORR_FUTURE Currently unneeded file. May become useful later.\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n<commit_msg>INTEGRATION: CWS ooo19126 (1.2.24); FILE MERGED 2005\/09\/05 13:09:55 rt 1.2.24.1: #i54170# Change license header: remove SISSL<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: i_comrela.cxx,v $\n *\n * $Revision: 1.3 $\n *\n * last change: $Author: rt $ $Date: 2005-09-07 16:40:47 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#include <precomp.h>\n#include <ary\/idl\/i_comrela.hxx>\n\n\n\/\/ NOT FULLY DEFINED SERVICES\n#include <ary\/ary.hxx>\n#include <ary\/idl\/i_gate.hxx>\n#include <ary\/idl\/ip_ce.hxx>\n#include <ary\/idl\/ip_type.hxx>\n\n\nnamespace ary\n{\nnamespace idl\n{\n\n\/\/ KORR_FUTURE Currently unneeded file. May become useful later.\n\n} \/\/ namespace idl\n} \/\/ namespace ary\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: namedvaluecollection.hxx,v $\n * $Revision: 1.9 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef COMPHELPER_NAMEDVALUECOLLECTION_HXX\n#define COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n#include <comphelper\/comphelperdllapi.h>\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\/** === end UNO includes === **\/\n\n#include <memory>\n\n\/\/........................................................................\nnamespace comphelper\n{\n\/\/........................................................................\n\n \/\/ ====================================================================\n \/\/ = NamedValueCollection\n \/\/ ====================================================================\n struct NamedValueCollection_Impl;\n \/** a collection of named values, packed in various formats.\n *\/\n class COMPHELPER_DLLPUBLIC NamedValueCollection\n {\n private:\n ::std::auto_ptr< NamedValueCollection_Impl > m_pImpl;\n\n public:\n NamedValueCollection();\n\n \/** constructs a collection\n @param _rElements\n the wrapped elements of the collection. The <code>Any<\/code> might contain a sequence of\n property values, a sequence of named values, or directly a property value or named value.\n All other cases are worth an assertion in non-product builds.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Any& _rElements );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of Any's containing either PropertyValue's or NamedValue's.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of PropertyValues's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of NamedValue's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n ~NamedValueCollection();\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n \/\/\/ returns the number of elements in the collection\n size_t size() const;\n\n \/\/\/ determines whether the collection is empty\n bool empty() const;\n\n \/** retrieves a value with a given name from the collection, if it is present\n\n @param _pAsciiValueName\n the ASCII name of the value to retrieve\n\n @param _out_rValue\n is the output parameter taking the desired value upon successful return. If\n a value with the given name is not present in the collection, or if a wrong-typed\n value is present, then this parameter will not be touched.\n\n @return\n <TRUE\/> if there is a value with the given name, which could successfully\n be extraced. In this case, <arg>_out_rValue<\/arg> will contain the requested\n value.<br\/>\n <FALSE\/>, if there is no value with the given name.\n @throws IllegalArgumentException\n in case there is a value with the given name, but it cannot legally assigned to\n _out_rValue.\n *\/\n template < typename VALUE_TYPE >\n bool get_ensureType( const sal_Char* _pAsciiValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( ::rtl::OUString::createFromAscii( _pAsciiValueName ), &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n template < typename VALUE_TYPE >\n bool get_ensureType( const ::rtl::OUString& _rValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( _rValueName, &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n \/** retrieves a value with a given name, or defaults it to a given value, if its not present\n in the colllection\n *\/\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rDefault ) const\n {\n return getOrDefault( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rDefault );\n }\n\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rDefault ) const\n {\n VALUE_TYPE retVal( _rDefault );\n get_ensureType( _rValueName, retVal );\n return retVal;\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const sal_Char* _pAsciiValueName ) const\n {\n return get( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const ::rtl::OUString& _rValueName ) const\n {\n return impl_get( _rValueName );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const sal_Char* _pAsciiValueName ) const\n {\n return impl_has( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const ::rtl::OUString& _rValueName ) const\n {\n return impl_has( _rValueName );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( _rValueName, ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n inline bool put( const sal_Char* _pAsciiValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rValue );\n }\n\n inline bool put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( _rValueName, _rValue );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const sal_Char* _pAsciiValueName )\n {\n return impl_remove( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const ::rtl::OUString& _rValueName )\n {\n return impl_remove( _rValueName );\n }\n\n \/** transforms the collection to a sequence of PropertyValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _out_rValues ) const;\n\n \/** transforms the collection to a sequence of NamedValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _out_rValues ) const;\n\n \/** transforms the collection into a sequence of PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n getPropertyValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n \/** transforms the collection into a sequence of NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >\n getNamedValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n private:\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n bool get_ensureType(\n const ::rtl::OUString& _rValueName,\n void* _pValueLocation,\n const ::com::sun::star::uno::Type& _rExpectedValueType\n ) const;\n\n const ::com::sun::star::uno::Any&\n impl_get( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_has( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue );\n\n bool impl_remove( const ::rtl::OUString& _rValueName );\n };\n\n\/\/........................................................................\n} \/\/ namespace comphelper\n\/\/........................................................................\n\n#endif \/\/ COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n<commit_msg>INTEGRATION: CWS dba30b (1.8.8); FILE MERGED 2008\/04\/15 22:19:45 fs 1.8.8.2: RESYNC: (1.8-1.9); FILE MERGED 2008\/03\/16 14:00:35 fs 1.8.8.1: #i86996# added: copy ctor \/ 'merge'<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: namedvaluecollection.hxx,v $\n * $Revision: 1.10 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef COMPHELPER_NAMEDVALUECOLLECTION_HXX\n#define COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n#include <comphelper\/comphelperdllapi.h>\n\n\/** === begin UNO includes === **\/\n#include <com\/sun\/star\/uno\/Sequence.hxx>\n#include <com\/sun\/star\/uno\/Any.hxx>\n#include <com\/sun\/star\/beans\/PropertyValue.hpp>\n#include <com\/sun\/star\/beans\/NamedValue.hpp>\n\/** === end UNO includes === **\/\n\n#include <memory>\n\n\/\/........................................................................\nnamespace comphelper\n{\n\/\/........................................................................\n\n \/\/ ====================================================================\n \/\/ = NamedValueCollection\n \/\/ ====================================================================\n struct NamedValueCollection_Impl;\n \/** a collection of named values, packed in various formats.\n *\/\n class COMPHELPER_DLLPUBLIC NamedValueCollection\n {\n private:\n ::std::auto_ptr< NamedValueCollection_Impl > m_pImpl;\n\n public:\n NamedValueCollection();\n\n NamedValueCollection( const NamedValueCollection& _rCopySource );\n\n \/** constructs a collection\n @param _rElements\n the wrapped elements of the collection. The <code>Any<\/code> might contain a sequence of\n property values, a sequence of named values, or directly a property value or named value.\n All other cases are worth an assertion in non-product builds.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Any& _rElements );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of Any's containing either PropertyValue's or NamedValue's.\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of PropertyValues's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n\n \/** constructs a collection\n @param _rArguments\n a sequence of NamedValue's\n *\/\n NamedValueCollection( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n ~NamedValueCollection();\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n inline void assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments )\n {\n impl_assign( _rArguments );\n }\n\n \/\/\/ returns the number of elements in the collection\n size_t size() const;\n\n \/\/\/ determines whether the collection is empty\n bool empty() const;\n\n \/** merges the content of another collection into |this|\n @param _rAdditionalValues\n the collection whose values are to be merged\n @param _bOverwriteExisting\n defines whether or not elements which are already present in |this|\n should be overwritten (<TRUE\/>) or preserved (<FALSE\/>).\n @return |*this|\n *\/\n NamedValueCollection&\n merge(\n const NamedValueCollection& _rAdditionalValues,\n bool _bOverwriteExisting\n );\n\n \/** retrieves a value with a given name from the collection, if it is present\n\n @param _pAsciiValueName\n the ASCII name of the value to retrieve\n\n @param _out_rValue\n is the output parameter taking the desired value upon successful return. If\n a value with the given name is not present in the collection, or if a wrong-typed\n value is present, then this parameter will not be touched.\n\n @return\n <TRUE\/> if there is a value with the given name, which could successfully\n be extraced. In this case, <arg>_out_rValue<\/arg> will contain the requested\n value.<br\/>\n <FALSE\/>, if there is no value with the given name.\n @throws IllegalArgumentException\n in case there is a value with the given name, but it cannot legally assigned to\n _out_rValue.\n *\/\n template < typename VALUE_TYPE >\n bool get_ensureType( const sal_Char* _pAsciiValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( ::rtl::OUString::createFromAscii( _pAsciiValueName ), &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n template < typename VALUE_TYPE >\n bool get_ensureType( const ::rtl::OUString& _rValueName, VALUE_TYPE& _out_rValue ) const\n {\n return get_ensureType( _rValueName, &_out_rValue, ::cppu::UnoType< VALUE_TYPE >::get() );\n }\n\n \/** retrieves a value with a given name, or defaults it to a given value, if its not present\n in the colllection\n *\/\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rDefault ) const\n {\n return getOrDefault( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rDefault );\n }\n\n template < typename VALUE_TYPE >\n VALUE_TYPE getOrDefault( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rDefault ) const\n {\n VALUE_TYPE retVal( _rDefault );\n get_ensureType( _rValueName, retVal );\n return retVal;\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const sal_Char* _pAsciiValueName ) const\n {\n return get( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** retrieves a (untyped) value with a given name\n\n If the collection does not contain a value with the given name, an empty\n Any is returned.\n *\/\n const ::com::sun::star::uno::Any& get( const ::rtl::OUString& _rValueName ) const\n {\n return impl_get( _rValueName );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const sal_Char* _pAsciiValueName ) const\n {\n return impl_has( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/\/\/ determines whether a value with a given name is present in the collection\n inline bool has( const ::rtl::OUString& _rValueName ) const\n {\n return impl_has( _rValueName );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const sal_Char* _pAsciiValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n \/** puts a value into the collection\n\n @return <TRUE\/> if and only if a value was already present previously, in\n which case it has been overwritten.\n *\/\n template < typename VALUE_TYPE >\n inline bool put( const ::rtl::OUString& _rValueName, const VALUE_TYPE& _rValue )\n {\n return impl_put( _rValueName, ::com::sun::star::uno::makeAny( _rValue ) );\n }\n\n inline bool put( const sal_Char* _pAsciiValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( ::rtl::OUString::createFromAscii( _pAsciiValueName ), _rValue );\n }\n\n inline bool put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue )\n {\n return impl_put( _rValueName, _rValue );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const sal_Char* _pAsciiValueName )\n {\n return impl_remove( ::rtl::OUString::createFromAscii( _pAsciiValueName ) );\n }\n\n \/** removes the value with the given name from the collection\n\n @return <TRUE\/> if and only if a value with the given name existed in the collection.\n *\/\n inline bool remove( const ::rtl::OUString& _rValueName )\n {\n return impl_remove( _rValueName );\n }\n\n \/** transforms the collection to a sequence of PropertyValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _out_rValues ) const;\n\n \/** transforms the collection to a sequence of NamedValues\n\n @return\n the number of elements in the sequence\n *\/\n sal_Int32 operator >>= ( ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _out_rValues ) const;\n\n \/** transforms the collection into a sequence of PropertyValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >\n getPropertyValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n \/** transforms the collection into a sequence of NamedValues\n *\/\n inline ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >\n getNamedValues() const\n {\n ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue > aValues;\n *this >>= aValues;\n return aValues;\n }\n\n private:\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::PropertyValue >& _rArguments );\n void impl_assign( const ::com::sun::star::uno::Sequence< ::com::sun::star::beans::NamedValue >& _rArguments );\n\n bool get_ensureType(\n const ::rtl::OUString& _rValueName,\n void* _pValueLocation,\n const ::com::sun::star::uno::Type& _rExpectedValueType\n ) const;\n\n const ::com::sun::star::uno::Any&\n impl_get( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_has( const ::rtl::OUString& _rValueName ) const;\n\n bool impl_put( const ::rtl::OUString& _rValueName, const ::com::sun::star::uno::Any& _rValue );\n\n bool impl_remove( const ::rtl::OUString& _rValueName );\n };\n\n\/\/........................................................................\n} \/\/ namespace comphelper\n\/\/........................................................................\n\n#endif \/\/ COMPHELPER_NAMEDVALUECOLLECTION_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ RUN: %clangxx -frtti -fsanitize=undefined -g %s -O3 -o %t\n\/\/ RUN: %run %t 2>&1 | FileCheck %s\n\n\/\/ REQUIRES: cxxabi\n\nclass Base {\npublic:\n int i;\n virtual void print() {}\n};\n\nclass Derived : public Base {\npublic:\n void print() {}\n};\n\nint main() {\n Derived *list = (Derived *)new char[sizeof(Derived)];\n\n\/\/ CHECK: PR33221.cpp:[[@LINE+2]]:19: runtime error: member access within address {{.*}} which does not point to an object of type 'Base'\n\/\/ CHECK-NEXT: object has invalid vptr\n int foo = list->i;\n return 0;\n}\n<commit_msg>Tighten up test to address bot failure. NFC.<commit_after>\/\/ RUN: %clangxx -frtti -fsanitize=vptr -g %s -O3 -o %t\n\/\/ RUN: %run %t 2>&1 | FileCheck %s\n\n\/\/ REQUIRES: cxxabi\n\n#include <string.h>\n\nclass Base {\npublic:\n int i;\n virtual void print() {}\n};\n\nclass Derived : public Base {\npublic:\n void print() {}\n};\n\nint main() {\n char *c = new char[sizeof(Derived)];\n memset((void *)c, 0, sizeof(Derived));\n Derived *list = (Derived *)c;\n\n\/\/ CHECK: PR33221.cpp:[[@LINE+2]]:19: runtime error: member access within address {{.*}} which does not point to an object of type 'Base'\n\/\/ CHECK-NEXT: invalid vptr\n int foo = list->i;\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/===--------------------------------------------------------------------------------*- C++ -*-===\/\/\n\/\/ _ _\n\/\/ | | | |\n\/\/ __ _| |_ ___| | __ _ _ __ __ _\n\/\/ \/ _` | __\/ __| |\/ _` | '_ \\ \/ _` |\n\/\/ | (_| | || (__| | (_| | | | | (_| |\n\/\/ \\__, |\\__\\___|_|\\__,_|_| |_|\\__, | - GridTools Clang DSL\n\/\/ __\/ | __\/ |\n\/\/ |___\/ |___\/\n\/\/\n\/\/\n\/\/ This file is distributed under the MIT License (MIT).\n\/\/ See LICENSE.txt for details.\n\/\/\n\/\/===------------------------------------------------------------------------------------------===\/\/\n#define GRIDTOOLS_CLANG_GENERATED 1\n#include <gtest\/gtest.h>\n#include \"test\/integration-test\/CodeGen\/Options.hpp\"\n#include \"gridtools\/clang\/verify.hpp\"\n#include \"test\/integration-test\/CodeGen\/generated\/coriolis_stencil_gridtools.cpp\"\n#include \"test\/integration-test\/CodeGen\/generated\/coriolis_stencil_c++-naive.cpp\"\n\nusing namespace dawn;\nTEST(coriolis_stencil, test) {\n domain dom(Options::getInstance().m_size[0], Options::getInstance().m_size[1], Options::getInstance().m_size[2]);\n dom.set_halos(halo::value, halo::value, halo::value, halo::value, 0, 0);\n verifier verif(dom);\n\n meta_data_t meta_data(dom.isize(), dom.jsize(), dom.ksize());\n storage_t u_tens_gt(meta_data, \"u_tens_gt\"), u_tens_cxxnaive(meta_data, \"u_tens_cxxnaive\");\n storage_t v_tens_gt(meta_data, \"v_tens_gt\"), v_tens_cxxnaive(meta_data, \"v_tens_cxxnaive\");\n storage_t u_nnow(meta_data, \"u_nnow\"), v_nnow(meta_data, \"v_nnow\"), fc(meta_data, \"fc\");\n\n verif.fill(-1.0, u_tens_gt, v_tens_gt, fc, u_tens_cxxnaive, v_tens_cxxnaive);\n verif.fillMath(8.0, 2.0, 1.5, 1.5, 2.0, 4.0, u_nnow);\n verif.fillMath(5.0, 1.2, 1.3, 1.7, 2.2, 3.5, v_nnow);\n\n gridtools::coriolis_stencil coriolis_gt(dom, u_tens_gt, u_nnow, v_tens_gt, v_nnow, fc);\n cxxnaive::coriolis_stencil coriolis_cxxnaive(dom, u_tens_cxxnaive, u_nnow, v_tens_cxxnaive, v_nnow, fc);\n\n coriolis_gt.run();\n coriolis_cxxnaive.run();\n\n ASSERT_TRUE(verif.verify(u_tens_gt, u_tens_cxxnaive));\n ASSERT_TRUE(verif.verify(v_tens_gt, v_tens_cxxnaive));\n}\n<commit_msg>add missing halo define<commit_after>\/\/===--------------------------------------------------------------------------------*- C++ -*-===\/\/\n\/\/ _ _\n\/\/ | | | |\n\/\/ __ _| |_ ___| | __ _ _ __ __ _\n\/\/ \/ _` | __\/ __| |\/ _` | '_ \\ \/ _` |\n\/\/ | (_| | || (__| | (_| | | | | (_| |\n\/\/ \\__, |\\__\\___|_|\\__,_|_| |_|\\__, | - GridTools Clang DSL\n\/\/ __\/ | __\/ |\n\/\/ |___\/ |___\/\n\/\/\n\/\/\n\/\/ This file is distributed under the MIT License (MIT).\n\/\/ See LICENSE.txt for details.\n\/\/\n\/\/===------------------------------------------------------------------------------------------===\/\/\n#define GRIDTOOLS_CLANG_GENERATED 1\n#define GRIDTOOLS_CLANG_HALO_EXTEND 3\n\n#include <gtest\/gtest.h>\n#include \"test\/integration-test\/CodeGen\/Options.hpp\"\n#include \"gridtools\/clang\/verify.hpp\"\n#include \"test\/integration-test\/CodeGen\/generated\/coriolis_stencil_gridtools.cpp\"\n#include \"test\/integration-test\/CodeGen\/generated\/coriolis_stencil_c++-naive.cpp\"\n\nusing namespace dawn;\nTEST(coriolis_stencil, test) {\n domain dom(Options::getInstance().m_size[0], Options::getInstance().m_size[1], Options::getInstance().m_size[2]);\n dom.set_halos(halo::value, halo::value, halo::value, halo::value, 0, 0);\n verifier verif(dom);\n\n meta_data_t meta_data(dom.isize(), dom.jsize(), dom.ksize());\n storage_t u_tens_gt(meta_data, \"u_tens_gt\"), u_tens_cxxnaive(meta_data, \"u_tens_cxxnaive\");\n storage_t v_tens_gt(meta_data, \"v_tens_gt\"), v_tens_cxxnaive(meta_data, \"v_tens_cxxnaive\");\n storage_t u_nnow(meta_data, \"u_nnow\"), v_nnow(meta_data, \"v_nnow\"), fc(meta_data, \"fc\");\n\n verif.fill(-1.0, u_tens_gt, v_tens_gt, fc, u_tens_cxxnaive, v_tens_cxxnaive);\n verif.fillMath(8.0, 2.0, 1.5, 1.5, 2.0, 4.0, u_nnow);\n verif.fillMath(5.0, 1.2, 1.3, 1.7, 2.2, 3.5, v_nnow);\n\n gridtools::coriolis_stencil coriolis_gt(dom, u_tens_gt, u_nnow, v_tens_gt, v_nnow, fc);\n cxxnaive::coriolis_stencil coriolis_cxxnaive(dom, u_tens_cxxnaive, u_nnow, v_tens_cxxnaive, v_nnow, fc);\n\n coriolis_gt.run();\n coriolis_cxxnaive.run();\n\n ASSERT_TRUE(verif.verify(u_tens_gt, u_tens_cxxnaive));\n ASSERT_TRUE(verif.verify(v_tens_gt, v_tens_cxxnaive));\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <map>\n#include <memory>\n#include <string>\n#include <time.h>\n#include <vector>\n#include <string.h>\n#include <chrono>\n\n#include \"derecho\/derecho.h\"\n#include <mutils-serialization\/SerializationSupport.hpp>\n#include <persistent\/Persistent.hpp>\n#include \"conf\/conf.hpp\"\n#include <optional>\n\nusing std::cout;\nusing std::endl;\nusing namespace persistent;\nusing namespace std::chrono_literals;\n\n\/\/ The binary large object for serialized objects.\nclass Blob : public mutils::ByteRepresentable {\npublic:\n char * bytes;\n std::size_t size;\n\n \/\/ constructor - we always copy to 'own' the data\n Blob(const char * const b, const decltype(size) s) : bytes(nullptr),size(s) {\n if ( s > 0 ) {\n bytes = new char[s];\n memcpy(bytes, b, s);\n }\n }\n\n \/\/ copy constructor - we always copy to 'own' the data\n Blob(const Blob & other): bytes(nullptr),size(other.size) {\n bytes = nullptr;\n if ( size > 0 ) {\n bytes = new char[size];\n memcpy(bytes, other.bytes, other.size);\n }\n }\n\n \/\/ default constructor - no data at all\n Blob () : bytes(nullptr), size(0) { }\n\n \/\/ destructor\n virtual ~Blob() {\n if (bytes) delete bytes;\n }\n\n \/\/ move evaluator:\n Blob & operator = (Blob &&other) {\n char *swp_bytes = other.bytes;\n std::size_t swp_size = other.size;\n other.bytes = bytes;\n other.size = size;\n bytes = swp_bytes;\n size = swp_size;\n return *this;\n }\n\n \/\/ copy evaluator:\n Blob & operator = (const Blob &other) {\n if(bytes != nullptr) {\n delete bytes;\n }\n size = other.size;\n if(size > 0) {\n bytes = new char[size];\n memcpy(bytes, other.bytes, size);\n } else {\n bytes = nullptr;\n }\n return *this;\n }\n\n std::size_t to_bytes(char *v) const {\n ((std::size_t *)(v))[0] = size; \n if(size > 0) {\n memcpy(v + sizeof(size), bytes, size);\n } \n return size + sizeof(size);\n } \n \n std::size_t bytes_size() const {\n return size + sizeof(size);\n } \n \n void post_object(const std::function<void(char const *const, std::size_t)> &f) const {\n f((char *)&size, sizeof(size));\n f(bytes, size);\n } \n \n void ensure_registered(mutils::DeserializationManager &) {}\n \n static std::unique_ptr<Blob> from_bytes(mutils::DeserializationManager *, const char *const v) {\n return std::make_unique<Blob>(v + sizeof(std::size_t), ((std::size_t *)(v))[0]); \n } \n\n \/\/ we disabled from_bytes_noalloc calls for now. \n};\n\nclass OSObject : public mutils::ByteRepresentable {\npublic:\n#define INVALID_OID\t(0xffffffffffffffffLLU)\n const uint64_t oid; \/\/ object_id\n Blob blob; \/\/ the object\n\n bool operator == (const OSObject & other) {\n return this->oid == other.oid;\n }\n bool is_valid () const {\n return (oid == INVALID_OID);\n }\n\n \/\/ constructor 0 : normal\n OSObject(uint64_t & _oid, Blob & _blob):\n oid(_oid),\n blob(_blob) {}\n \/\/ constructor 1 : raw\n OSObject(const uint64_t _oid, const char * const _b, const std::size_t _s):\n oid(_oid),\n blob(_b,_s) {}\n \/\/ constructor 2 : move\n OSObject(OSObject && other):\n oid(other.oid) {\n blob = other.blob;\n }\n \/\/ constructor 3 : copy\n OSObject(const OSObject & other):\n oid(other.oid),\n blob(other.blob.bytes,other.blob.size) {}\n \/\/ constructor 4 : invalid\n OSObject() : oid(INVALID_OID) {}\n\n DEFAULT_SERIALIZATION_SUPPORT(OSObject, oid, blob);\n};\n\nclass ObjStore : public mutils::ByteRepresentable, public derecho::PersistsFields {\npublic:\n Persistent<std::vector<OSObject>> objects;\n const OSObject inv_obj;\n\n void put(const OSObject & obj) {\n for (OSObject & o : *objects) {\n if ( o == obj ) {\n Blob tmp(obj.blob); \/\/ create\n o.blob = std::move(tmp); \/\/ swap.\n return;\n }\n }\n \/\/ we didn't find it. insert...\n objects->emplace_back(obj);\n }\n\n \/\/ This get is SUPER inefficient\n \/\/ Passing an output buffer??\n const OSObject get(const uint64_t oid) {\n for(OSObject & o : *objects) {\n if ( o.oid == oid ) {\n return o;\n }\n }\n return this->inv_obj;\n }\n\n enum Functions { PUT_OBJ, GET_OBJ };\n\n static auto register_functions() {\n return std::make_tuple(\n derecho::rpc::tag<PUT_OBJ>(&ObjStore::put),\n derecho::rpc::tag<GET_OBJ>(&ObjStore::get)\n );\n }\n\n DEFAULT_SERIALIZATION_SUPPORT(ObjStore, objects);\n\n \/\/ Only for test: persistent registry is null and we make a copy constructor move.\n ObjStore(Persistent<std::vector<OSObject>> & _objects) : objects(std::move(_objects)) {}\n\n \/\/ Working with derecho.\n ObjStore(PersistentRegistry* pr) : objects(nullptr, pr) {}\n};\n\ntypedef OSObject * POSObject;\nOSObject **g_objs = nullptr;\nvoid initialize_objects(uint32_t num_of_objs) {\n uint64_t max_msg_size = derecho::getConfUInt64(CONF_DERECHO_MAX_PAYLOAD_SIZE);\n uint32_t node_id = derecho::getConfUInt32(CONF_DERECHO_LOCAL_ID);\n \/\/ We just reserved 128 bytes for the message header and serialization.\n#define VALUE_SIZE(x) ((x) - 128)\n char default_value[VALUE_SIZE(max_msg_size)];\n if (g_objs == nullptr) {\n g_objs = new POSObject[num_of_objs];\n uint32_t i;\n for (i = 0; i < num_of_objs; i++) {\n g_objs[i] = new OSObject{\n\t(((uint64_t)node_id)<<32) + i,\n\tdefault_value,VALUE_SIZE(max_msg_size)};\n }\n }\n}\n\nint main(int argc, char* argv[]) {\n if(argc < 3) {\n std::cout << \"usage:\" << argv[0] << \" <num_of_nodes> <num_of_objs>\" << std::endl;\n return -1;\n }\n derecho::Conf::initialize(argc,argv);\n int num_of_nodes = std::stoi(argv[1]);\n int num_of_objs = std::stoi(argv[2]);\n\n \/\/ create the key-value array\n initialize_objects(num_of_objs);\n\n uint64_t max_msg_size = derecho::getConfUInt64(CONF_DERECHO_MAX_PAYLOAD_SIZE);\n uint64_t total_num_messages = num_of_nodes * num_of_objs;\n struct timespec t_start,t_end;\n std::atomic<bool> bReady = false;\n uint32_t msg_counter = 0;\n persistent::version_t latest_version = INVALID_VERSION;\n\n derecho::CallbackSet callback_set{\n [&](derecho::subgroup_id_t subgroup, uint32_t nid, int32_t mid, std::optional<std::pair<char*, long long int>> data, persistent::version_t ver){\n msg_counter ++;\n latest_version = ver;\n if (msg_counter == (total_num_messages + num_of_nodes)) {\n bReady = true;\n }\n }, \/\/ using stability callback to match the version.\n nullptr, \/\/ local persistent frontier\n [&](derecho::subgroup_id_t subgroup, persistent::version_t ver) {\n \/\/ std::cout << \"in global persistent callback: ver = \" << ver << std::endl;\n if( bReady && (latest_version <= ver) ) {\n clock_gettime(CLOCK_REALTIME, &t_end);\n int64_t nsec = ((int64_t)t_end.tv_sec - t_start.tv_sec) * 1000000000 + t_end.tv_nsec - t_start.tv_nsec;\n double msec = (double)nsec \/ 1000000;\n double thp_gbps = ((double)num_of_objs * max_msg_size * 8) \/ nsec;\n double thp_ops = ((double)num_of_objs * 1000000000) \/ nsec;\n std::cout << \"(pers)timespan:\" << msec << \" millisecond.\" << std::endl;\n std::cout << \"(pers)throughput:\" << thp_gbps << \"Gbit\/s.\" << std::endl;\n std::cout << \"(pers)throughput:\" << thp_ops << \"ops.\" << std::endl;\n std::cout << std::flush;\n }\n }}; \/\/ global persistent frontier \n\n derecho::SubgroupInfo subgroup_info{\n {{std::type_index(typeid(ObjStore)), [num_of_nodes](const derecho::View& curr_view, int& next_unassigned_rank) {\n if(curr_view.num_members < num_of_nodes) {\n std::cout << \"not enough members yet:\" << curr_view.num_members << \" < \" << num_of_nodes << std::endl;\n throw derecho::subgroup_provisioning_exception();\n }\n derecho::subgroup_shard_layout_t subgroup_vector(1);\n\n std::vector<uint32_t> members(num_of_nodes);\n std::vector<int> senders(num_of_nodes, 1);\n for(int i = 0; i < num_of_nodes; i++)\n members[i] = i;\n\n subgroup_vector[0].emplace_back(curr_view.make_subview(members, derecho::Mode::ORDERED, senders));\n next_unassigned_rank = std::max(next_unassigned_rank, num_of_nodes);\n return subgroup_vector;\n }}},\n {std::type_index(typeid(ObjStore))}};\n\n auto store_factory = [](PersistentRegistry* pr) { return std::make_unique<ObjStore>(pr); };\n\n derecho::Group<ObjStore> group{\n callback_set, subgroup_info,\n std::vector<derecho::view_upcall_t>{},\n store_factory};\n\n std::cout << \"Finished constructing\/joining Group\" << std::endl;\n\n uint32_t node_rank = group.get_my_rank();\n\n std::cout << \"my rank is:\" << node_rank << \", and I'm sending.\" << std::endl;\n\n \/* send operation *\/\n derecho::Replicated<ObjStore> & handle = group.get_subgroup<ObjStore>();\n {\n clock_gettime(CLOCK_REALTIME, &t_start);\n \/\/ send\n try {\n for (uint32_t i=0;i<(uint32_t)num_of_objs;i++)\n handle.ordered_send<ObjStore::PUT_OBJ>(*g_objs[i]);\n } catch (uint64_t exp) {\n std::cout << \"Exception caught:0x\" << std::hex << exp << std::endl;\n }\n }\n\n \/* query operation *\/\n {\n OSObject obj1;\n uint64_t key = num_of_nodes - node_rank - 1;\n auto results = handle.ordered_send<ObjStore::GET_OBJ>(key);\n decltype(results)::ReplyMap& replies = results.get();\n std::cout<<\"Got a reply map!\"<<std::endl;\n for (auto& ritr:replies) {\n auto obj = ritr.second.get();\n std::cout << \"Reply from node \" << ritr.first << \" was [\" << obj.oid << \":\"\n << obj.blob.size << std::endl;\n }\n }\n\n std::cout << \"Reached end of main(), entering infinite loop so program doesn't exit\" << std::endl;\n while(true) {\n }\n}\n<commit_msg>bugfix:objstore message counter. Many thanks to Xinzhe(xy267@cornell.edu)<commit_after>#include <iostream>\n#include <map>\n#include <memory>\n#include <string>\n#include <time.h>\n#include <vector>\n#include <string.h>\n#include <chrono>\n\n#include \"derecho\/derecho.h\"\n#include <mutils-serialization\/SerializationSupport.hpp>\n#include <persistent\/Persistent.hpp>\n#include \"conf\/conf.hpp\"\n#include <optional>\n\nusing std::cout;\nusing std::endl;\nusing namespace persistent;\nusing namespace std::chrono_literals;\n\n\/\/ The binary large object for serialized objects.\nclass Blob : public mutils::ByteRepresentable {\npublic:\n char * bytes;\n std::size_t size;\n\n \/\/ constructor - we always copy to 'own' the data\n Blob(const char * const b, const decltype(size) s) : bytes(nullptr),size(s) {\n if ( s > 0 ) {\n bytes = new char[s];\n memcpy(bytes, b, s);\n }\n }\n\n \/\/ copy constructor - we always copy to 'own' the data\n Blob(const Blob & other): bytes(nullptr),size(other.size) {\n bytes = nullptr;\n if ( size > 0 ) {\n bytes = new char[size];\n memcpy(bytes, other.bytes, other.size);\n }\n }\n\n \/\/ default constructor - no data at all\n Blob () : bytes(nullptr), size(0) { }\n\n \/\/ destructor\n virtual ~Blob() {\n if (bytes) delete bytes;\n }\n\n \/\/ move evaluator:\n Blob & operator = (Blob &&other) {\n char *swp_bytes = other.bytes;\n std::size_t swp_size = other.size;\n other.bytes = bytes;\n other.size = size;\n bytes = swp_bytes;\n size = swp_size;\n return *this;\n }\n\n \/\/ copy evaluator:\n Blob & operator = (const Blob &other) {\n if(bytes != nullptr) {\n delete bytes;\n }\n size = other.size;\n if(size > 0) {\n bytes = new char[size];\n memcpy(bytes, other.bytes, size);\n } else {\n bytes = nullptr;\n }\n return *this;\n }\n\n std::size_t to_bytes(char *v) const {\n ((std::size_t *)(v))[0] = size; \n if(size > 0) {\n memcpy(v + sizeof(size), bytes, size);\n } \n return size + sizeof(size);\n } \n \n std::size_t bytes_size() const {\n return size + sizeof(size);\n } \n \n void post_object(const std::function<void(char const *const, std::size_t)> &f) const {\n f((char *)&size, sizeof(size));\n f(bytes, size);\n } \n \n void ensure_registered(mutils::DeserializationManager &) {}\n \n static std::unique_ptr<Blob> from_bytes(mutils::DeserializationManager *, const char *const v) {\n return std::make_unique<Blob>(v + sizeof(std::size_t), ((std::size_t *)(v))[0]); \n } \n\n \/\/ we disabled from_bytes_noalloc calls for now. \n};\n\nclass OSObject : public mutils::ByteRepresentable {\npublic:\n#define INVALID_OID\t(0xffffffffffffffffLLU)\n const uint64_t oid; \/\/ object_id\n Blob blob; \/\/ the object\n\n bool operator == (const OSObject & other) {\n return this->oid == other.oid;\n }\n bool is_valid () const {\n return (oid == INVALID_OID);\n }\n\n \/\/ constructor 0 : normal\n OSObject(uint64_t & _oid, Blob & _blob):\n oid(_oid),\n blob(_blob) {}\n \/\/ constructor 1 : raw\n OSObject(const uint64_t _oid, const char * const _b, const std::size_t _s):\n oid(_oid),\n blob(_b,_s) {}\n \/\/ constructor 2 : move\n OSObject(OSObject && other):\n oid(other.oid) {\n blob = other.blob;\n }\n \/\/ constructor 3 : copy\n OSObject(const OSObject & other):\n oid(other.oid),\n blob(other.blob.bytes,other.blob.size) {}\n \/\/ constructor 4 : invalid\n OSObject() : oid(INVALID_OID) {}\n\n DEFAULT_SERIALIZATION_SUPPORT(OSObject, oid, blob);\n};\n\nclass ObjStore : public mutils::ByteRepresentable, public derecho::PersistsFields {\npublic:\n Persistent<std::vector<OSObject>> objects;\n const OSObject inv_obj;\n\n void put(const OSObject & obj) {\n for (OSObject & o : *objects) {\n if ( o == obj ) {\n Blob tmp(obj.blob); \/\/ create\n o.blob = std::move(tmp); \/\/ swap.\n return;\n }\n }\n \/\/ we didn't find it. insert...\n objects->emplace_back(obj);\n }\n\n \/\/ This get is SUPER inefficient\n \/\/ Passing an output buffer??\n const OSObject get(const uint64_t oid) {\n for(OSObject & o : *objects) {\n if ( o.oid == oid ) {\n return o;\n }\n }\n return this->inv_obj;\n }\n\n enum Functions { PUT_OBJ, GET_OBJ };\n\n static auto register_functions() {\n return std::make_tuple(\n derecho::rpc::tag<PUT_OBJ>(&ObjStore::put),\n derecho::rpc::tag<GET_OBJ>(&ObjStore::get)\n );\n }\n\n DEFAULT_SERIALIZATION_SUPPORT(ObjStore, objects);\n\n \/\/ Only for test: persistent registry is null and we make a copy constructor move.\n ObjStore(Persistent<std::vector<OSObject>> & _objects) : objects(std::move(_objects)) {}\n\n \/\/ Working with derecho.\n ObjStore(PersistentRegistry* pr) : objects(nullptr, pr) {}\n};\n\ntypedef OSObject * POSObject;\nOSObject **g_objs = nullptr;\nvoid initialize_objects(uint32_t num_of_objs) {\n uint64_t max_msg_size = derecho::getConfUInt64(CONF_DERECHO_MAX_PAYLOAD_SIZE);\n uint32_t node_id = derecho::getConfUInt32(CONF_DERECHO_LOCAL_ID);\n \/\/ We just reserved 128 bytes for the message header and serialization.\n#define VALUE_SIZE(x) ((x) - 128)\n char default_value[VALUE_SIZE(max_msg_size)];\n if (g_objs == nullptr) {\n g_objs = new POSObject[num_of_objs];\n uint32_t i;\n for (i = 0; i < num_of_objs; i++) {\n g_objs[i] = new OSObject{\n\t(((uint64_t)node_id)<<32) + i,\n\tdefault_value,VALUE_SIZE(max_msg_size)};\n }\n }\n}\n\nint main(int argc, char* argv[]) {\n if(argc < 3) {\n std::cout << \"usage:\" << argv[0] << \" <num_of_nodes> <num_of_objs>\" << std::endl;\n return -1;\n }\n derecho::Conf::initialize(argc,argv);\n int num_of_nodes = std::stoi(argv[1]);\n int num_of_objs = std::stoi(argv[2]);\n\n \/\/ create the key-value array\n initialize_objects(num_of_objs);\n\n uint64_t max_msg_size = derecho::getConfUInt64(CONF_DERECHO_MAX_PAYLOAD_SIZE);\n uint64_t total_num_messages = num_of_nodes * num_of_objs;\n struct timespec t_start,t_end;\n std::atomic<bool> bReady = false;\n uint32_t msg_counter = 0;\n persistent::version_t latest_version = INVALID_VERSION;\n\n derecho::CallbackSet callback_set{\n [&](derecho::subgroup_id_t subgroup, uint32_t nid, int32_t mid, std::optional<std::pair<char*, long long int>> data, persistent::version_t ver){\n msg_counter ++;\n latest_version = ver;\n if (msg_counter == (total_num_messages * num_of_nodes)) {\n bReady = true;\n }\n }, \/\/ using stability callback to match the version.\n nullptr, \/\/ local persistent frontier\n [&](derecho::subgroup_id_t subgroup, persistent::version_t ver) {\n \/\/ std::cout << \"in global persistent callback: ver = \" << ver << std::endl;\n if( bReady && (latest_version <= ver) ) {\n clock_gettime(CLOCK_REALTIME, &t_end);\n int64_t nsec = ((int64_t)t_end.tv_sec - t_start.tv_sec) * 1000000000 + t_end.tv_nsec - t_start.tv_nsec;\n double msec = (double)nsec \/ 1000000;\n double thp_gbps = ((double)num_of_objs * max_msg_size * 8) \/ nsec;\n double thp_ops = ((double)num_of_objs * 1000000000) \/ nsec;\n std::cout << \"(pers)timespan:\" << msec << \" millisecond.\" << std::endl;\n std::cout << \"(pers)throughput:\" << thp_gbps << \"Gbit\/s.\" << std::endl;\n std::cout << \"(pers)throughput:\" << thp_ops << \"ops.\" << std::endl;\n std::cout << std::flush;\n }\n }}; \/\/ global persistent frontier \n\n derecho::SubgroupInfo subgroup_info{\n {{std::type_index(typeid(ObjStore)), [num_of_nodes](const derecho::View& curr_view, int& next_unassigned_rank) {\n if(curr_view.num_members < num_of_nodes) {\n std::cout << \"not enough members yet:\" << curr_view.num_members << \" < \" << num_of_nodes << std::endl;\n throw derecho::subgroup_provisioning_exception();\n }\n derecho::subgroup_shard_layout_t subgroup_vector(1);\n\n std::vector<uint32_t> members(num_of_nodes);\n std::vector<int> senders(num_of_nodes, 1);\n for(int i = 0; i < num_of_nodes; i++)\n members[i] = i;\n\n subgroup_vector[0].emplace_back(curr_view.make_subview(members, derecho::Mode::ORDERED, senders));\n next_unassigned_rank = std::max(next_unassigned_rank, num_of_nodes);\n return subgroup_vector;\n }}},\n {std::type_index(typeid(ObjStore))}};\n\n auto store_factory = [](PersistentRegistry* pr) { return std::make_unique<ObjStore>(pr); };\n\n derecho::Group<ObjStore> group{\n callback_set, subgroup_info,\n std::vector<derecho::view_upcall_t>{},\n store_factory};\n\n std::cout << \"Finished constructing\/joining Group\" << std::endl;\n\n uint32_t node_rank = group.get_my_rank();\n\n std::cout << \"my rank is:\" << node_rank << \", and I'm sending.\" << std::endl;\n\n \/* send operation *\/\n derecho::Replicated<ObjStore> & handle = group.get_subgroup<ObjStore>();\n {\n clock_gettime(CLOCK_REALTIME, &t_start);\n \/\/ send\n try {\n for (uint32_t i=0;i<(uint32_t)num_of_objs;i++)\n handle.ordered_send<ObjStore::PUT_OBJ>(*g_objs[i]);\n } catch (uint64_t exp) {\n std::cout << \"Exception caught:0x\" << std::hex << exp << std::endl;\n }\n }\n\n \/* query operation *\/\n {\n OSObject obj1;\n uint64_t key = num_of_nodes - node_rank - 1;\n auto results = handle.ordered_send<ObjStore::GET_OBJ>(key);\n decltype(results)::ReplyMap& replies = results.get();\n std::cout<<\"Got a reply map!\"<<std::endl;\n for (auto& ritr:replies) {\n auto obj = ritr.second.get();\n std::cout << \"Reply from node \" << ritr.first << \" was [\" << obj.oid << \":\"\n << obj.blob.size << std::endl;\n }\n }\n\n std::cout << \"Reached end of main(), entering infinite loop so program doesn't exit\" << std::endl;\n while(true) {\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * $RCSfile: accessibleeventnotifier.cxx,v $\n *\n * $Revision: 1.1 $\n *\n * last change: $Author: fs $ $Date: 2002-12-06 12:56:46 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef COMPHELPER_ACCESSIBLE_EVENT_NOTIFIER\n#include <comphelper\/accessibleeventnotifier.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _COMPHELPER_GUARDING_HXX_\n#include <comphelper\/guarding.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::drafts::com::sun::star::accessibility;\n using namespace ::comphelper;\n\n \/\/=====================================================================\n \/\/= AccessibleEventNotifier\n \/\/=====================================================================\n \/\/---------------------------------------------------------------------\n ::osl::Mutex AccessibleEventNotifier::s_aMutex;\n AccessibleEventNotifier* AccessibleEventNotifier::s_pNotifier = NULL;\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::AccessibleEventNotifier( )\n :m_bTerminateRequested( sal_False )\n {\n \/\/ no events so far\n m_aEventGuard.reset();\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::~AccessibleEventNotifier( )\n {\n OSL_ENSURE( m_aClients.empty() && m_aDisposedClients.empty(),\n \"AccessibleEventNotifier::~AccessibleEventNotifier: not correctly terminated - resource leak!\" );\n }\n\n \/\/---------------------------------------------------------------------\n namespace\n {\n static void lcl_copyInterfaceContainer( const ::cppu::OInterfaceContainerHelper& _rSource, ::cppu::OInterfaceContainerHelper& _rDest )\n {\n _rDest.clear();\n Sequence< Reference< XInterface > > aInterfaces( _rSource.getElements() );\n\n const Reference< XInterface >* pInterfaces = aInterfaces.getConstArray();\n const Reference< XInterface >* pInterfacesEnd = pInterfaces + aInterfaces.getLength();\n for ( ; pInterfaces != pInterfacesEnd; ++pInterfaces )\n _rDest.addInterface( *pInterfaces );\n }\n }\n \/\/---------------------------------------------------------------------\n void SAL_CALL AccessibleEventNotifier::run()\n {\n sal_Bool bTerminate = sal_False;\n\n do\n {\n \/\/ notify the events we have in the queue\n \/\/ --- <mutex_lock> -------------------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n \/\/ continue with all events we have so far\n while ( !m_aEvents.empty() )\n {\n \/\/ the first event in the queue\n ClientEvent aEvent = m_aEvents.front();\n m_aEvents.pop_front();\n\n \/\/ special handling for \"disposing\"\n if ( aEvent.second.EventId < 0 )\n {\n \/\/ look up in the map for \"disposed clients\"\n ClientMap::iterator aPos = m_aDisposedClients.find( aEvent.first );\n OSL_ENSURE( m_aDisposedClients.end() != aPos,\n \"AccessibleEventNotifier::run: could not find this client!\" );\n\n if ( m_aDisposedClients.end() != aPos )\n {\n EventObject aDisposalEvent;\n aDisposalEvent.Source = aEvent.second.Source;\n\n \/\/ want to call the listeners with a released mutex\n \/\/ thus we have to copy the container, so that we can savely use the copy while\n \/\/ our mutex is released\n\n ::cppu::OInterfaceContainerHelper aCopy( s_aMutex );\n lcl_copyInterfaceContainer( *aPos->second, aCopy );\n\n \/\/ we do not need the entry in the \"disposed clients\" map anymore\n \/\/ because the \"disposed\" event is the _last_ one to be fired for a client\n delete aPos->second;\n m_aDisposedClients.erase( aPos );\n\n \/\/ now do the notification, and do it with the _copy_ after releasing the mutex\n \/\/ --- <mutex_release> ------------------------\n {\n MutexRelease aReleaseOnce( s_aMutex );\n aCopy.disposeAndClear( aDisposalEvent );\n\n \/\/ clear the aDisposalEvent while our mutex is _not_ acquired\n \/\/ this ensures that we do not - by accident - release the last reference\n \/\/ of the foreign component while our mutex is locked\n aDisposalEvent.Source.clear();\n }\n \/\/ --- <\/mutex_release> -----------------------\n\n \/\/ cleanup the thread if we do not have clients anymore\n implCleanupNotifier( );\n }\n }\n else\n {\n \/\/ look up the client for this event\n ClientMap::iterator aClientPos;\n if ( implLookupClient( aEvent.first, aClientPos ) )\n {\n \/\/ copy the listener sequence. We do _not_ want to call into the listeners\n \/\/ with our mutex locked\n Sequence< Reference< XInterface > > aListeners( aClientPos->second->getElements() );\n \/\/ default handling: loop through all listeners, and notify them\n\n const Reference< XInterface >* pListeners = aListeners.getConstArray();\n const Reference< XInterface >* pListenersEnd = pListeners + aListeners.getLength();\n\n \/\/ --- <mutex_release> ------------------------\n {\n \/\/ release the mutex within this block\n MutexRelease aReleaseOnce( s_aMutex );\n\n while ( pListeners != pListenersEnd )\n {\n try\n {\n static_cast< XAccessibleEventListener* >( pListeners->get() )->notifyEvent( aEvent.second );\n }\n catch( const Exception& e )\n {\n e;\n \/\/ silent this\n \/\/ no assertion, because a broken access remote bridge or something like this\n \/\/ can cause this exception\n }\n ++pListeners;\n }\n }\n \/\/ --- <\/mutex_release> -----------------------\n }\n else\n OSL_ENSURE( sal_False, \"AccessibleEventNotifier::run: invalid client id found for accessible event!\" );\n }\n\n \/\/ --- <mutex_release> --------------------------------\n {\n MutexRelease aReleaseOnce( s_aMutex );\n \/\/ clear the event\n \/\/ do this with our own mutex released, as clearing the event includes releasing the reference\n \/\/ to the css.lang.EventObject.Source - in case this release is non-trivial (i.e. the last\n \/\/ reference to the object), we certainly do _not_ want to do this while our\n \/\/ mutex is locked\n aEvent = ClientEvent();\n }\n \/\/ --- <\/mutex_release> -------------------------------\n }\n\n \/\/ reset the condition - will be set as soon as a new event arrives\n m_aEventGuard.reset();\n }\n \/\/ --- <\/mutex_lock> ------------------------------------------\n\n \/\/ wait (sleep) 'til a new event arrives\n m_aEventGuard.wait();\n\n \/\/ --- <mutex_lock> -------------------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n bTerminate = m_bTerminateRequested;\n }\n \/\/ --- <\/mutex_lock> ------------------------------------------\n }\n while ( !bTerminate );\n }\n\n \/\/---------------------------------------------------------------------\n void SAL_CALL AccessibleEventNotifier::terminate()\n {\n AccessibleEventNotifier_BASE::terminate();\n \/\/ base class does not call onTerminated - just in case we want to do any cleanup there ...\n onTerminated();\n }\n\n \/\/---------------------------------------------------------------------\n void SAL_CALL AccessibleEventNotifier::onTerminated()\n {\n delete this;\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::generateId()\n {\n TClientId nBiggestUsedId = 0;\n TClientId nFreeId = 0;\n\n \/\/ look through all registered clients until we find a \"gap\" in the ids\n\n \/\/ Note that the following relies on the fact the elements in the map are traveled with\n \/\/ ascending keys (aka client ids)\n\n for ( ClientMap::const_iterator aLookup = m_aClients.begin();\n aLookup != m_aClients.end();\n ++aLookup\n )\n {\n TClientId nCurrent = aLookup->first;\n OSL_ENSURE( nCurrent > nBiggestUsedId, \"AccessibleEventNotifier::generateId: map is expected to be sorted ascending!\" );\n\n if ( nCurrent - nBiggestUsedId > 1 )\n { \/\/ found a \"gap\"\n TClientId nCandidate = nBiggestUsedId + 1;\n\n \/\/ ensure that the id is really free - it's possible that the id is still in the \"disposed clients\"\n \/\/ map\n if ( m_aDisposedClients.end() == m_aDisposedClients.find( nCandidate ) )\n { \/\/ yep, it's really available\n nFreeId = nCandidate;\n break;\n }\n }\n\n nBiggestUsedId = nCurrent;\n }\n\n if ( !nFreeId )\n nFreeId = nBiggestUsedId + 1;\n\n OSL_ENSURE( m_aClients.end() == m_aClients.find( nFreeId ),\n \"AccessibleEventNotifier::generateId: algorithm broken!\" );\n\n return nFreeId;\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::registerClient( )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n if ( !s_pNotifier )\n { \/\/ the first client -> create the thread\n\n \/\/ create the thread object\n s_pNotifier = new AccessibleEventNotifier;\n\n \/\/ run the thread\n s_pNotifier->create();\n \/\/ note that the thread will start running, and the first thing it will do is stopping\n \/\/ in run, waiting for the mutex\n }\n\n \/\/ generate a new client id\n TClientId nNewClientId = s_pNotifier->generateId( );\n\n \/\/ the event listeners for the new client\n EventListeners* pNewListeners = new EventListeners( s_aMutex );\n \/\/ note that we're using our own mutex here, so the listener containers for all\n \/\/ our clients share this same mutex.\n \/\/ Shouldn't be any problem: the only situation where this is used is when the\n \/\/ thread is firing events, and there the mutex is locked, anyway.\n\n \/\/ add the client\n s_pNotifier->m_aClients.insert( ClientMap::value_type( nNewClientId, pNewListeners ) );\n\n \/\/ outta here\n return nNewClientId;\n }\n\n \/\/---------------------------------------------------------------------\n sal_Bool AccessibleEventNotifier::implLookupClient( const TClientId _nClient, ClientMap::iterator& _rPos )\n {\n OSL_ENSURE( s_pNotifier, \"AccessibleEventNotifier::implLookupClient: illegal call: thread not running!\" );\n if ( !s_pNotifier )\n return sal_False;\n\n \/\/ look up this client\n _rPos = s_pNotifier->m_aClients.find( _nClient );\n OSL_ENSURE( s_pNotifier->m_aClients.end() != _rPos, \"AccessibleEventNotifier::implLookupClient: invalid client id (did you register your client?)!\" );\n\n return ( s_pNotifier->m_aClients.end() != _rPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::implRemoveEventsForClient( const TClientId _nClient,\n ::std::vector< Reference< XInterface > >& _rEnsureAlive )\n {\n OSL_ENSURE( s_pNotifier, \"AccessibleEventNotifier::implRemoveEventsForClient: invalid call, save your documents before it crashes!\" );\n\n EventQueue::iterator aEventLoop = s_pNotifier->m_aEvents.begin();\n while ( aEventLoop != s_pNotifier->m_aEvents.end() )\n {\n if ( _nClient == aEventLoop->first )\n {\n \/\/ this is an event queued for the same client\n \/\/ -> remove it from the queue\n EventQueue::iterator aErasePos( aEventLoop );\n ++aEventLoop;\n\n \/\/ keep the object alive until we can free our own mutex\n _rEnsureAlive.push_back( aErasePos->second.Source );\n\n \/\/ erase the event\n s_pNotifier->m_aEvents.erase( aErasePos );\n }\n else\n ++aEventLoop;\n }\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::implCleanupNotifier( )\n {\n OSL_PRECOND( s_pNotifier, \"AccessibleEventNotifier::implCleanupNotifier: invalid call!\" );\n\n if ( s_pNotifier->m_aClients.empty() && s_pNotifier->m_aDisposedClients.empty() )\n {\n \/\/ killing me softly ....\n\n \/\/ tell the instance it should terminate\n s_pNotifier->m_bTerminateRequested = sal_True;\n\n \/\/ awake it\n \/\/ (it is sleeping currently - if it were not, it would be in the section\n \/\/ guarded by s_aMutex (see <method>run<\/method>), which is impossible as\n \/\/ our thread here has this mutex currently ...\n s_pNotifier->m_aEventGuard.set();\n\n \/\/ reset the notifier holder - thus, the thread may continue to run the few microseconds\n \/\/ it will need to finally terminate, but if in the meantime new clients\n \/\/ are registered, we will not burden this (terminating) notifier with it,\n \/\/ but create a new one.\n \/\/ Note that the instance will delete itself in onTerminated\n s_pNotifier = NULL;\n }\n\n OSL_POSTCOND( !s_pNotifier || !s_pNotifier->m_aClients.empty() || !s_pNotifier->m_aDisposedClients.empty(),\n \"AccessibleEventNotifier::implCleanupNotifier: post condition violated!\" );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClient( const TClientId _nClient )\n {\n \/\/ below, we will destroy some AccessibleEventObject instances\n \/\/ their Source member refers a foreign component (the broadcaster), which we\n \/\/ will release with this destruction. In case that is the _last_ release, it\n \/\/ would be potentially deadly if we call it while our own mutex is locked.\n \/\/ So we ensure that all these objects are alive _until_ our mutex is released.\n\n ::std::vector< Reference< XInterface > > aEnsureAlive;\n\n \/\/ ----- <mutex_lock> ---------------------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ remove it from the clients map\n delete aClientPos->second;\n s_pNotifier->m_aClients.erase( aClientPos );\n\n \/\/ remove any other events which are pending for this client\n implRemoveEventsForClient( _nClient, aEnsureAlive );\n\n \/\/ cleanup the thread if we do not have clients anymore\n implCleanupNotifier( );\n }\n \/\/ ----- <\/mutex_lock> ---------------------------------------------\n\n \/\/ here, aEnsureAlive is cleared, and here it doesn't matter anymore if it's the last\n \/\/ reference to the contained components, as our mutex is not locked here ....\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClientNotifyDisposing( const TClientId _nClient,\n const Reference< XInterface >& _rxEventSource ) SAL_THROW( ( ) )\n {\n ::std::vector< Reference< XInterface > > aEnsureAlive;\n\n \/\/ ----- <mutex_lock> ---------------------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ move the client from the \"regular clients\" to the \"disposed clients\" map\n \/\/ from then on, no events for this client will be accepted anymore\n #ifdef _DEBUG\n ::std::pair< ClientMap::iterator, bool > aInsertResult =\n #endif\n s_pNotifier->m_aDisposedClients.insert( ClientMap::value_type( _nClient, aClientPos->second ) );\n OSL_ENSURE( aInsertResult.second, \"AccessibleEventNotifier::revokeClientNotifyDisposing: client was already disposed!\" );\n \/\/ is this asserts, then there already was an entry for _nClient in m_aDisposedClients, which means\n \/\/ somebody already called notifyDisposing with this id\n s_pNotifier->m_aClients.erase( aClientPos );\n\n \/\/ before we add the \"disposing\" event to the queue, we remove all other events for this client\n implRemoveEventsForClient( _nClient, aEnsureAlive );\n\n \/\/ push back a \"disposing\" event for this client\n AccessibleEventObject aDisposalEvent;\n aDisposalEvent.Source = _rxEventSource;\n aDisposalEvent.EventId = -1; \/\/ this indicates \"disposal\"\n\n \/\/ add the event to the queue\n implPushBackEvent( _nClient, aDisposalEvent );\n }\n \/\/ ----- <\/mutex_lock> --------------------------------------------\n\n \/\/ here, aEnsureAlive is cleared, and here it doesn't matter anymore if it's the last\n \/\/ reference to the contained components, as our mutex is not locked here ....\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::addEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->addInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::removeEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->removeInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n Sequence< Reference< XInterface > > AccessibleEventNotifier::getEventListeners( const TClientId _nClient ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( implLookupClient( _nClient, aClientPos ) )\n aListeners = aClientPos->second->getElements();\n\n return aListeners;\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::addEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ add the event to the queue\n implPushBackEvent( _nClient, _rEvent );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::implPushBackEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent )\n {\n OSL_PRECOND( s_pNotifier, \"AccessibleEventNotifier::implPushBackEvent: invalid call!\" );\n\n \/\/ add the event to the queue\n s_pNotifier->m_aEvents.push_back( ClientEvent( _nClient, _rEvent ) );\n\n \/\/ wake up the thread\n s_pNotifier->m_aEventGuard.set();\n }\n\n\/\/.........................................................................\n} \/\/ namespace comphelper\n\/\/.........................................................................\n\n\n\/*************************************************************************\n * history:\n * $Log: not supported by cvs2svn $\n *\n * Revision 1.0 05.12.2002 11:05:26 fs\n ************************************************************************\/\n\n<commit_msg>#106337#; make notification synchron<commit_after>\/*************************************************************************\n *\n * $RCSfile: accessibleeventnotifier.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: sab $ $Date: 2003-01-22 15:18:07 $\n *\n * The Contents of this file are made available subject to the terms of\n * either of the following licenses\n *\n * - GNU Lesser General Public License Version 2.1\n * - Sun Industry Standards Source License Version 1.1\n *\n * Sun Microsystems Inc., October, 2000\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2000 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n *\n * Sun Industry Standards Source License Version 1.1\n * =================================================\n * The contents of this file are subject to the Sun Industry Standards\n * Source License Version 1.1 (the \"License\"); You may not use this file\n * except in compliance with the License. You may obtain a copy of the\n * License at http:\/\/www.openoffice.org\/license.html.\n *\n * Software provided under this License is provided on an \"AS IS\" basis,\n * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,\n * WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,\n * MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.\n * See the License for the specific provisions governing your rights and\n * obligations concerning the Software.\n *\n * The Initial Developer of the Original Code is: Sun Microsystems, Inc.\n *\n * Copyright: 2000 by Sun Microsystems, Inc.\n *\n * All Rights Reserved.\n *\n * Contributor(s): _______________________________________\n *\n *\n ************************************************************************\/\n\n#ifndef COMPHELPER_ACCESSIBLE_EVENT_NOTIFIER\n#include <comphelper\/accessibleeventnotifier.hxx>\n#endif\n\n#ifndef _OSL_DIAGNOSE_H_\n#include <osl\/diagnose.h>\n#endif\n\n#ifndef _COMPHELPER_GUARDING_HXX_\n#include <comphelper\/guarding.hxx>\n#endif\n\n\/\/.........................................................................\nnamespace comphelper\n{\n\/\/.........................................................................\n\n using namespace ::com::sun::star::uno;\n using namespace ::com::sun::star::lang;\n using namespace ::drafts::com::sun::star::accessibility;\n using namespace ::comphelper;\n\n \/\/=====================================================================\n \/\/= AccessibleEventNotifier\n \/\/=====================================================================\n \/\/---------------------------------------------------------------------\n ::osl::Mutex AccessibleEventNotifier::s_aMutex;\n AccessibleEventNotifier::ClientMap AccessibleEventNotifier::s_aClients;\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::generateId()\n {\n TClientId nBiggestUsedId = 0;\n TClientId nFreeId = 0;\n\n \/\/ look through all registered clients until we find a \"gap\" in the ids\n\n \/\/ Note that the following relies on the fact the elements in the map are traveled with\n \/\/ ascending keys (aka client ids)\n\n for ( ClientMap::const_iterator aLookup = s_aClients.begin();\n aLookup != s_aClients.end();\n ++aLookup\n )\n {\n TClientId nCurrent = aLookup->first;\n OSL_ENSURE( nCurrent > nBiggestUsedId, \"AccessibleEventNotifier::generateId: map is expected to be sorted ascending!\" );\n\n if ( nCurrent - nBiggestUsedId > 1 )\n { \/\/ found a \"gap\"\n nFreeId = nBiggestUsedId + 1;\n break;\n }\n\n nBiggestUsedId = nCurrent;\n }\n\n if ( !nFreeId )\n nFreeId = nBiggestUsedId + 1;\n\n OSL_ENSURE( s_aClients.end() == s_aClients.find( nFreeId ),\n \"AccessibleEventNotifier::generateId: algorithm broken!\" );\n\n return nFreeId;\n }\n\n \/\/---------------------------------------------------------------------\n AccessibleEventNotifier::TClientId AccessibleEventNotifier::registerClient( )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n \/\/ generate a new client id\n TClientId nNewClientId = generateId( );\n\n \/\/ the event listeners for the new client\n EventListeners* pNewListeners = new EventListeners( s_aMutex );\n \/\/ note that we're using our own mutex here, so the listener containers for all\n \/\/ our clients share this same mutex.\n \/\/ this is a reminiscense to the days where the notifier was asynchronous. Today this is\n \/\/ completely nonsense, and potentially slowing down the Office me thinks ...\n\n \/\/ add the client\n s_aClients.insert( ClientMap::value_type( nNewClientId, pNewListeners ) );\n\n \/\/ outta here\n return nNewClientId;\n }\n\n \/\/---------------------------------------------------------------------\n sal_Bool AccessibleEventNotifier::implLookupClient( const TClientId _nClient, ClientMap::iterator& _rPos )\n {\n \/\/ look up this client\n _rPos = s_aClients.find( _nClient );\n OSL_ENSURE( s_aClients.end() != _rPos, \"AccessibleEventNotifier::implLookupClient: invalid client id (did you register your client?)!\" );\n\n return ( s_aClients.end() != _rPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClient( const TClientId _nClient )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ remove it from the clients map\n delete aClientPos->second;\n s_aClients.erase( aClientPos );\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::revokeClientNotifyDisposing( const TClientId _nClient,\n const Reference< XInterface >& _rxEventSource ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ notify the \"disposing\" event for this client\n EventObject aDisposalEvent;\n aDisposalEvent.Source = _rxEventSource;\n\n \/\/ now do the notification\n aClientPos->second->disposeAndClear( aDisposalEvent );\n\n \/\/ we do not need the entry in the clients map anymore\n delete aClientPos->second;\n s_aClients.erase( aClientPos );\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::addEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->addInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n sal_Int32 AccessibleEventNotifier::removeEventListener(\n const TClientId _nClient, const Reference< XAccessibleEventListener >& _rxListener ) SAL_THROW( ( ) )\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return 0;\n\n if ( _rxListener.is() )\n aClientPos->second->removeInterface( _rxListener );\n\n return aClientPos->second->getLength();\n }\n\n \/\/---------------------------------------------------------------------\n Sequence< Reference< XInterface > > AccessibleEventNotifier::getEventListeners( const TClientId _nClient ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( implLookupClient( _nClient, aClientPos ) )\n aListeners = aClientPos->second->getElements();\n\n return aListeners;\n }\n\n \/\/---------------------------------------------------------------------\n void AccessibleEventNotifier::addEvent( const TClientId _nClient, const AccessibleEventObject& _rEvent ) SAL_THROW( ( ) )\n {\n Sequence< Reference< XInterface > > aListeners;\n\n \/\/ --- <mutex lock> -------------------------------\n {\n ::osl::MutexGuard aGuard( s_aMutex );\n\n ClientMap::iterator aClientPos;\n if ( !implLookupClient( _nClient, aClientPos ) )\n \/\/ already asserted in implLookupClient\n return;\n\n \/\/ since we're synchronous, again, we want to notify immediately\n aListeners = aClientPos->second->getElements();\n }\n \/\/ --- <\/mutex lock> ------------------------------\n\n \/\/ default handling: loop through all listeners, and notify them\n const Reference< XInterface >* pListeners = aListeners.getConstArray();\n const Reference< XInterface >* pListenersEnd = pListeners + aListeners.getLength();\n while ( pListeners != pListenersEnd )\n {\n try\n {\n static_cast< XAccessibleEventListener* >( pListeners->get() )->notifyEvent( _rEvent );\n }\n catch( const Exception& e )\n {\n e;\n \/\/ silent this\n \/\/ no assertion, because a broken access remote bridge or something like this\n \/\/ can cause this exception\n }\n ++pListeners;\n }\n }\n\n\/\/.........................................................................\n} \/\/ namespace comphelper\n\/\/.........................................................................\n<|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\n * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\/*\n * Implementation of track selection in case the analysis runs on AODs\n * For the moment it uses the AliESDtrackCuts and converts AOD tracks to\n * ESD tracks, which might change in the future when an AOD track selection\n * framework becomes available.\n *\n * Author:\n * Markus Fasel\n *\/\n#include <TClonesArray.h>\n#include <TObjArray.h>\n\n#include <AliAODEvent.h>\n#include <AliAODTrack.h>\n#include <AliESDtrack.h>\n#include <AliEMCalPtTaskTrackSelectionAOD.h>\n\nnamespace EMCalTriggerPtAnalysis {\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD() :\n\t\tAliEMCalPtTaskVTrackSelection(),\n\t\tfTrackCuts(NULL),\n\t\tfFilterBits(0)\n\t{\n\t\t\/*\n\t\t * Main constructor\n\t\t *\/\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD(AliESDtrackCuts* cuts, UInt_t filterbits):\n\t\tAliEMCalPtTaskVTrackSelection(),\n\t\tfTrackCuts(cuts),\n\t\tfFilterBits(filterbits)\n\t{\n\t\t\/*\n\t\t * Main Constructor, initalising also track cuts\n\t\t *\n\t\t * @param cuts: Inital track cut object\n\t\t *\/\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD(const AliEMCalPtTaskTrackSelectionAOD& ref) :\n\t\tAliEMCalPtTaskVTrackSelection(ref),\n\t\tfTrackCuts(NULL),\n\t\tfFilterBits(ref.fFilterBits)\n\t{\n\t\t\/*\n\t\t * copy constructor\n\t\t *\n\t\t * @param ref: AOD track selection as basis for the copy\n\t\t *\/\n\t\tif(ref.fTrackCuts) fTrackCuts = new AliESDtrackCuts(*(ref.fTrackCuts));\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD& AliEMCalPtTaskTrackSelectionAOD::operator=(const AliEMCalPtTaskTrackSelectionAOD& ref) {\n\t\t\/*\n\t\t * Assignment operator\n\t\t *\n\t\t * @param ref: AOD track selection as basis for the copy\n\t\t * @return: reference to this cut object\n\t\t *\/\n\t\tAliEMCalPtTaskVTrackSelection::operator=(ref);\n\t\tif(this != &ref){\n\t\t\tif(fTrackCuts) {\n\t\t\t\tdelete fTrackCuts;\n\t\t\t\tfTrackCuts = NULL;\n\t\t\t}\n\t\t\tif(ref.fTrackCuts) fTrackCuts = new AliESDtrackCuts(*(ref.fTrackCuts));\n\t\t}\n\t\treturn *this;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::~AliEMCalPtTaskTrackSelectionAOD() {\n\t\t\/*\n\t\t * Destructor, removes the track cuts\n\t\t *\/\n\t\tif(fTrackCuts) delete fTrackCuts;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tTObjArray* AliEMCalPtTaskTrackSelectionAOD::GetAcceptedTracks(const TClonesArray* const tracks) {\n\t\t\/*\n\t\t * Select tracks from a list (TClonesArray) of tracks. Internally, the tracks are converted\n\t\t * to ESD tracks and processed by the underlying AliESDtrackCut object\n\t\t *\n\t\t * @param tracks: TClonesArray of input tracks, under which we select the appropriate ones\n\t\t * @return: TObjArray of selected tracks\n\t\t *\/\n\t\tif(!fListOfTracks) fListOfTracks = new TObjArray;\n\t\telse fListOfTracks->Clear();\n\t\tTIter trackIter(tracks);\n\t\tAliAODTrack *track(NULL);\n\t\twhile((track = dynamic_cast<AliAODTrack *>(trackIter()))){\n\t\t\t\/\/ First check filter bits\n\t\t\tif(fFilterBits && !track->TestFilterBit(fFilterBits)) continue;\n\t\t\tif(fTrackCuts){\n\t\t\t\tAliESDtrack copyTrack(track);\n\t\t\t\tif(fTrackCuts->AcceptTrack(©Track)) fListOfTracks->AddLast(track);\n\t\t\t}\n\t\t}\n\t\treturn fListOfTracks;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tTObjArray* AliEMCalPtTaskTrackSelectionAOD::GetAcceptedTracks(const AliVEvent* const event) {\n\t\t\/*\n\t\t * Select tracks from a list (TClonesArray) of tracks. Internally, the tracks are converted\n\t\t * to ESD tracks and processed by the underlying AliESDtrackCut object\n\t\t *\n\t\t * @param tracks: TClonesArray of input tracks, under which we select the appropriate ones\n\t\t * @return: TObjArray of selected tracks\n\t\t *\/\n\t\tif(!fListOfTracks) fListOfTracks = new TObjArray;\n\t\telse fListOfTracks->Clear();\n\t\tconst AliAODEvent *aod = dynamic_cast<const AliAODEvent *>(event);\n\t\tif(!aod){\n\t\t\tAliError(\"Event not of type AliAODEvent\");\n\t\t\treturn fListOfTracks;\n\t\t}\n\t\tAliAODTrack *track(NULL);\n\t\tfor(int itrk = 0; itrk < event->GetNumberOfTracks(); itrk++){\n\t\t\ttrack = static_cast<AliAODTrack *>(event->GetTrack(itrk));\n\t\t\t\/\/ First check filter bits\n\t\t\tif(fFilterBits && !track->TestFilterBit(fFilterBits)) continue;\n\t\t\tif(fTrackCuts){\n\t\t\t\tAliESDtrack copyTrack(track);\n\t\t\t\tif(fTrackCuts->AcceptTrack(©Track)) fListOfTracks->AddLast(track);\n\t\t\t}\n\t\t}\n\t\treturn fListOfTracks;\n\t}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n\n<commit_msg>Add classimp<commit_after>\/**************************************************************************\n * Copyright(c) 1998-2007, ALICE Experiment at CERN, All rights reserved. *\n * *\n * Author: The ALICE Off-line Project. *\n * Contributors are mentioned in the code where appropriate. *\n * *\n * Permission to use, copy, modify and distribute this software and its *\n * documentation strictly for non-commercial purposes is hereby granted *\n * without fee, provided that the above copyright notice appears in all *\n * copies and that both the copyright notice and this permission notice *\n * appear in the supporting documentation. The authors make no claims *\n * about the suitability of this software for any purpose. It is *\n * provided \"as is\" without express or implied warranty. *\n **************************************************************************\/\n\/*\n * Implementation of track selection in case the analysis runs on AODs\n * For the moment it uses the AliESDtrackCuts and converts AOD tracks to\n * ESD tracks, which might change in the future when an AOD track selection\n * framework becomes available.\n *\n * Author:\n * Markus Fasel\n *\/\n#include <TClonesArray.h>\n#include <TObjArray.h>\n\n#include <AliAODEvent.h>\n#include <AliAODTrack.h>\n#include <AliESDtrack.h>\n#include <AliEMCalPtTaskTrackSelectionAOD.h>\n\nClassImp(EMCalTriggerPtAnalysis::AliEMCalPtTaskTrackSelectionAOD)\n\nnamespace EMCalTriggerPtAnalysis {\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD() :\n\t\tAliEMCalPtTaskVTrackSelection(),\n\t\tfTrackCuts(NULL),\n\t\tfFilterBits(0)\n\t{\n\t\t\/*\n\t\t * Main constructor\n\t\t *\/\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD(AliESDtrackCuts* cuts, UInt_t filterbits):\n\t\tAliEMCalPtTaskVTrackSelection(),\n\t\tfTrackCuts(cuts),\n\t\tfFilterBits(filterbits)\n\t{\n\t\t\/*\n\t\t * Main Constructor, initalising also track cuts\n\t\t *\n\t\t * @param cuts: Inital track cut object\n\t\t *\/\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::AliEMCalPtTaskTrackSelectionAOD(const AliEMCalPtTaskTrackSelectionAOD& ref) :\n\t\tAliEMCalPtTaskVTrackSelection(ref),\n\t\tfTrackCuts(NULL),\n\t\tfFilterBits(ref.fFilterBits)\n\t{\n\t\t\/*\n\t\t * copy constructor\n\t\t *\n\t\t * @param ref: AOD track selection as basis for the copy\n\t\t *\/\n\t\tif(ref.fTrackCuts) fTrackCuts = new AliESDtrackCuts(*(ref.fTrackCuts));\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD& AliEMCalPtTaskTrackSelectionAOD::operator=(const AliEMCalPtTaskTrackSelectionAOD& ref) {\n\t\t\/*\n\t\t * Assignment operator\n\t\t *\n\t\t * @param ref: AOD track selection as basis for the copy\n\t\t * @return: reference to this cut object\n\t\t *\/\n\t\tAliEMCalPtTaskVTrackSelection::operator=(ref);\n\t\tif(this != &ref){\n\t\t\tif(fTrackCuts) {\n\t\t\t\tdelete fTrackCuts;\n\t\t\t\tfTrackCuts = NULL;\n\t\t\t}\n\t\t\tif(ref.fTrackCuts) fTrackCuts = new AliESDtrackCuts(*(ref.fTrackCuts));\n\t\t}\n\t\treturn *this;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tAliEMCalPtTaskTrackSelectionAOD::~AliEMCalPtTaskTrackSelectionAOD() {\n\t\t\/*\n\t\t * Destructor, removes the track cuts\n\t\t *\/\n\t\tif(fTrackCuts) delete fTrackCuts;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tTObjArray* AliEMCalPtTaskTrackSelectionAOD::GetAcceptedTracks(const TClonesArray* const tracks) {\n\t\t\/*\n\t\t * Select tracks from a list (TClonesArray) of tracks. Internally, the tracks are converted\n\t\t * to ESD tracks and processed by the underlying AliESDtrackCut object\n\t\t *\n\t\t * @param tracks: TClonesArray of input tracks, under which we select the appropriate ones\n\t\t * @return: TObjArray of selected tracks\n\t\t *\/\n\t\tif(!fListOfTracks) fListOfTracks = new TObjArray;\n\t\telse fListOfTracks->Clear();\n\t\tTIter trackIter(tracks);\n\t\tAliAODTrack *track(NULL);\n\t\twhile((track = dynamic_cast<AliAODTrack *>(trackIter()))){\n\t\t\t\/\/ First check filter bits\n\t\t\tif(fFilterBits && !track->TestFilterBit(fFilterBits)) continue;\n\t\t\tif(fTrackCuts){\n\t\t\t\tAliESDtrack copyTrack(track);\n\t\t\t\tif(fTrackCuts->AcceptTrack(©Track)) fListOfTracks->AddLast(track);\n\t\t\t}\n\t\t}\n\t\treturn fListOfTracks;\n\t}\n\n\t\/\/______________________________________________________________________________\n\tTObjArray* AliEMCalPtTaskTrackSelectionAOD::GetAcceptedTracks(const AliVEvent* const event) {\n\t\t\/*\n\t\t * Select tracks from a list (TClonesArray) of tracks. Internally, the tracks are converted\n\t\t * to ESD tracks and processed by the underlying AliESDtrackCut object\n\t\t *\n\t\t * @param tracks: TClonesArray of input tracks, under which we select the appropriate ones\n\t\t * @return: TObjArray of selected tracks\n\t\t *\/\n\t\tif(!fListOfTracks) fListOfTracks = new TObjArray;\n\t\telse fListOfTracks->Clear();\n\t\tconst AliAODEvent *aod = dynamic_cast<const AliAODEvent *>(event);\n\t\tif(!aod){\n\t\t\tAliError(\"Event not of type AliAODEvent\");\n\t\t\treturn fListOfTracks;\n\t\t}\n\t\tAliAODTrack *track(NULL);\n\t\tfor(int itrk = 0; itrk < event->GetNumberOfTracks(); itrk++){\n\t\t\ttrack = static_cast<AliAODTrack *>(event->GetTrack(itrk));\n\t\t\t\/\/ First check filter bits\n\t\t\tif(fFilterBits && !track->TestFilterBit(fFilterBits)) continue;\n\t\t\tif(fTrackCuts){\n\t\t\t\tAliESDtrack copyTrack(track);\n\t\t\t\tif(fTrackCuts->AcceptTrack(©Track)) fListOfTracks->AddLast(track);\n\t\t\t}\n\t\t}\n\t\treturn fListOfTracks;\n\t}\n\n} \/* namespace EMCalTriggerPtAnalysis *\/\n\n<|endoftext|>"} {"text":"<commit_before>#include \"IRPrinter.h\"\n#include \"IROperator.h\"\n#include \"IR.h\"\n\n#include <iostream>\n#include <sstream>\n\nnamespace Halide {\n\nusing std::ostream;\nusing std::endl;\n\nostream &operator<<(ostream &out, Type type) {\n switch (type.t) {\n case Type::Int:\n out << 'i';\n break;\n case Type::UInt:\n out << 'u';\n break;\n case Type::Float:\n out << 'f';\n break;\n default:\n assert(false && \"Malformed type\");\n }\n out << type.bits;\n if (type.width > 1) out << 'x' << type.width;\n return out;\n}\n\nostream &operator<<(ostream &out, For::ForType type) {\n switch (type) {\n case For::Serial:\n out << \"for\";\n break;\n case For::Parallel:\n out << \"parallel\";\n break;\n case For::Unrolled:\n out << \"unrolled\";\n break;\n case For::Vectorized:\n out << \"vectorized\";\n break;\n default:\n assert(false && \"Malformed for type\");\n }\n return out;\n}\n\nostream &operator<<(ostream &stream, Expr ir) {\n if (!ir.defined()) {\n stream << \"(undefined)\";\n } else {\n Internal::IRPrinter p(stream);\n p.print(ir);\n }\n return stream;\n}\n\nostream &operator<<(ostream &stream, Stmt ir) {\n if (!ir.defined()) {\n stream << \"(undefined)\" << std::endl;\n } else {\n Internal::IRPrinter p(stream);\n p.print(ir);\n }\n return stream;\n}\n\n\nnamespace Internal {\n\nvoid IRPrinter::test() {\n Type i32 = Int(32);\n Type f32 = Float(32);\n Expr x = new Variable(i32, \"x\");\n Expr y = new Variable(i32, \"y\");\n std::ostringstream expr_source;\n expr_source << (x + 3) * (y \/ 2 + 17);\n assert(expr_source.str() == \"((x + 3)*((y\/2) + 17))\");\n\n Stmt store = new Store(\"buf\", (x * 17) \/ (x - 3), y - 1);\n Stmt for_loop = new For(\"x\", -2, y + 2, For::Parallel, store);\n vector<Expr> args(1); args[0] = x % 3;\n Expr call = new Call(i32, \"buf\", args, Call::Extern, NULL);\n Stmt store2 = new Store(\"out\", call + 1, x);\n Stmt for_loop2 = new For(\"x\", 0, y, For::Vectorized , store2);\n Stmt pipeline = new Pipeline(\"buf\", for_loop, Stmt(), for_loop2);\n Stmt assertion = new AssertStmt(y > 3, \"y is greater than 3\");\n Stmt block = new Block(assertion, pipeline);\n Stmt let_stmt = new LetStmt(\"y\", 17, block);\n Stmt allocate = new Allocate(\"buf\", f32, 1023, let_stmt);\n\n std::ostringstream source;\n source << allocate;\n std::string correct_source = \\\n \"allocate buf[f32 * 1023]\\n\"\n \"let y = 17\\n\"\n \"assert((y > 3), \\\"y is greater than 3\\\")\\n\"\n \"produce buf {\\n\"\n \" parallel (x, -2, (y + 2)) {\\n\"\n \" buf[(y - 1)] = ((x*17)\/(x - 3))\\n\"\n \" }\\n\"\n \"} consume {\\n\"\n \" vectorized (x, 0, y) {\\n\"\n \" out[x] = (buf((x % 3)) + 1)\\n\"\n \" }\\n\"\n \"}\\n\"\n \"free buf\\n\";\n\n if (source.str() != correct_source) {\n std::cout << \"Correct output:\" << std::endl << correct_source;\n std::cout << \"Actual output:\" << std::endl << source.str();\n assert(false);\n } \n std::cout << \"IRPrinter test passed\" << std::endl;\n}\n\nIRPrinter::IRPrinter(ostream &s) : stream(s), indent(0) {}\n\nvoid IRPrinter::print(Expr ir) {\n ir.accept(this);\n}\n\nvoid IRPrinter::print(Stmt ir) {\n ir.accept(this);\n}\n\n\nvoid IRPrinter::do_indent() {\n for (int i = 0; i < indent; i++) stream << ' ';\n}\n \nvoid IRPrinter::visit(const IntImm *op) {\n stream << op->value;\n}\n \nvoid IRPrinter::visit(const FloatImm *op) {\n stream << op->value;\n}\n \nvoid IRPrinter::visit(const Cast *op) { \n stream << op->type << '(';\n print(op->value);\n stream << ')';\n}\n \nvoid IRPrinter::visit(const Variable *op) {\n \/\/ omit the type\n stream << op->name;\n}\n \nvoid IRPrinter::visit(const Add *op) {\n stream << '(';\n print(op->a);\n stream << \" + \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Sub *op) {\n stream << '(';\n print(op->a);\n stream << \" - \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Mul *op) {\n stream << '(';\n print(op->a);\n stream << \"*\";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Div *op) {\n stream << '(';\n print(op->a);\n stream << \"\/\";\n print(op->b);\n stream << ')';\n}\n \nvoid IRPrinter::visit(const Mod *op) {\n stream << '(';\n print(op->a);\n stream << \" % \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Min *op) {\n stream << \"min(\";\n print(op->a);\n stream << \", \";\n print(op->b);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Max *op) {\n stream << \"max(\";\n print(op->a);\n stream << \", \";\n print(op->b);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const EQ *op) {\n stream << '(';\n print(op->a);\n stream << \" == \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const NE *op) {\n stream << '(';\n print(op->a);\n stream << \" != \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const LT *op) {\n stream << '(';\n print(op->a);\n stream << \" < \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const LE *op) {\n stream << '(';\n print(op->a);\n stream << \" <= \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const GT *op) {\n stream << '(';\n print(op->a);\n stream << \" > \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const GE *op) {\n stream << '(';\n print(op->a);\n stream << \" >= \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const And *op) {\n stream << '(';\n print(op->a);\n stream << \" && \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Or *op) {\n stream << '(';\n print(op->a);\n stream << \" || \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Not *op) {\n stream << '!';\n print(op->a);\n}\n\nvoid IRPrinter::visit(const Select *op) {\n stream << \"select(\";\n print(op->condition);\n stream << \", \";\n print(op->true_value);\n stream << \", \";\n print(op->false_value);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Load *op) {\n stream << op->buffer << \"[\";\n print(op->index);\n stream << \"]\";\n}\n\nvoid IRPrinter::visit(const Ramp *op) {\n stream << \"ramp(\";\n print(op->base);\n stream << \", \";\n print(op->stride);\n stream << \", \" << op->width << \")\";\n}\n\nvoid IRPrinter::visit(const Broadcast *op) {\n stream << \"broadcast(\";\n print(op->value);\n stream << \", \" << op->width << \")\";\n}\n\nvoid IRPrinter::visit(const Call *op) {\n stream << op->name << \"(\";\n for (size_t i = 0; i < op->args.size(); i++) {\n print(op->args[i]);\n if (i < op->args.size() - 1) {\n stream << \", \";\n }\n }\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Let *op) {\n stream << \"(let \" << op->name << \" = \";\n print(op->value);\n stream << \" in \";\n print(op->body);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const LetStmt *op) {\n do_indent();\n stream << \"let \" << op->name << \" = \";\n print(op->value);\n stream << endl;\n\n do_indent();\n print(op->body);\n}\n\nvoid IRPrinter::visit(const PrintStmt *op) {\n do_indent();\n stream << \"print(\" << op->prefix;\n for (size_t i = 0; i < op->args.size(); i++) {\n stream << \", \";\n print(op->args[i]);\n }\n stream << \")\" << endl;\n}\n\nvoid IRPrinter::visit(const AssertStmt *op) {\n do_indent();\n stream << \"assert(\";\n print(op->condition);\n stream << \", \\\"\" << op->message << \"\\\")\" << endl;\n}\n\nvoid IRPrinter::visit(const Pipeline *op) {\n\n\n do_indent();\n stream << \"produce \" << op->buffer << \" {\" << endl;\n indent += 2;\n print(op->produce);\n indent -= 2;\n\n if (op->update.defined()) {\n do_indent();\n stream << \"} update {\" << endl;\n indent += 2;\n print(op->update);\n indent -= 2;\n }\n \n do_indent();\n stream << \"} consume {\" << endl;\n indent += 2;\n print(op->consume);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const For *op) {\n\n do_indent();\n stream << op->for_type << \" (\" << op->name << \", \";\n print(op->min);\n stream << \", \";\n print(op->extent);\n stream << \") {\" << endl;\n \n indent += 2;\n print(op->body);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const Store *op) {\n do_indent();\n stream << op->buffer << \"[\";\n print(op->index);\n stream << \"] = \";\n print(op->value);\n stream << endl;\n}\n\nvoid IRPrinter::visit(const Provide *op) {\n do_indent();\n stream << op->buffer << \"(\";\n for (size_t i = 0; i < op->args.size(); i++) {\n print(op->args[i]);\n if (i < op->args.size() - 1) stream << \", \";\n }\n stream << \") = \";\n print(op->value);\n stream << endl;\n}\n\nvoid IRPrinter::visit(const Allocate *op) {\n do_indent();\n stream << \"allocate \" << op->buffer << \"[\" << op->type << \" * \";\n print(op->size);\n stream << \"]\" << endl;\n print(op->body);\n\n do_indent();\n stream << \"free \" << op->buffer << endl;\n}\n\nvoid IRPrinter::visit(const Realize *op) {\n do_indent();\n stream << \"realize \" << op->buffer << \"(\";\n for (size_t i = 0; i < op->bounds.size(); i++) {\n stream << \"[\";\n print(op->bounds[i].first);\n stream << \", \";\n print(op->bounds[i].second);\n stream << \"]\";\n if (i < op->bounds.size() - 1) stream << \", \";\n }\n stream << \") {\" << endl;\n\n indent += 2;\n print(op->body);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const Block *op) {\n print(op->first);\n if (op->rest.defined()) print(op->rest);\n}\n\n \n}}\n<commit_msg>Fixed bug in IRPrinter<commit_after>#include \"IRPrinter.h\"\n#include \"IROperator.h\"\n#include \"IR.h\"\n\n#include <iostream>\n#include <sstream>\n\nnamespace Halide {\n\nusing std::ostream;\nusing std::endl;\n\nostream &operator<<(ostream &out, Type type) {\n switch (type.t) {\n case Type::Int:\n out << 'i';\n break;\n case Type::UInt:\n out << 'u';\n break;\n case Type::Float:\n out << 'f';\n break;\n default:\n assert(false && \"Malformed type\");\n }\n out << type.bits;\n if (type.width > 1) out << 'x' << type.width;\n return out;\n}\n\nostream &operator<<(ostream &out, For::ForType type) {\n switch (type) {\n case For::Serial:\n out << \"for\";\n break;\n case For::Parallel:\n out << \"parallel\";\n break;\n case For::Unrolled:\n out << \"unrolled\";\n break;\n case For::Vectorized:\n out << \"vectorized\";\n break;\n default:\n assert(false && \"Malformed for type\");\n }\n return out;\n}\n\nostream &operator<<(ostream &stream, Expr ir) {\n if (!ir.defined()) {\n stream << \"(undefined)\";\n } else {\n Internal::IRPrinter p(stream);\n p.print(ir);\n }\n return stream;\n}\n\nostream &operator<<(ostream &stream, Stmt ir) {\n if (!ir.defined()) {\n stream << \"(undefined)\" << std::endl;\n } else {\n Internal::IRPrinter p(stream);\n p.print(ir);\n }\n return stream;\n}\n\n\nnamespace Internal {\n\nvoid IRPrinter::test() {\n Type i32 = Int(32);\n Type f32 = Float(32);\n Expr x = new Variable(i32, \"x\");\n Expr y = new Variable(i32, \"y\");\n std::ostringstream expr_source;\n expr_source << (x + 3) * (y \/ 2 + 17);\n assert(expr_source.str() == \"((x + 3)*((y\/2) + 17))\");\n\n Stmt store = new Store(\"buf\", (x * 17) \/ (x - 3), y - 1);\n Stmt for_loop = new For(\"x\", -2, y + 2, For::Parallel, store);\n vector<Expr> args(1); args[0] = x % 3;\n Expr call = new Call(i32, \"buf\", args, Call::Extern, NULL);\n Stmt store2 = new Store(\"out\", call + 1, x);\n Stmt for_loop2 = new For(\"x\", 0, y, For::Vectorized , store2);\n Stmt pipeline = new Pipeline(\"buf\", for_loop, Stmt(), for_loop2);\n Stmt assertion = new AssertStmt(y > 3, \"y is greater than 3\");\n Stmt block = new Block(assertion, pipeline);\n Stmt let_stmt = new LetStmt(\"y\", 17, block);\n Stmt allocate = new Allocate(\"buf\", f32, 1023, let_stmt);\n\n std::ostringstream source;\n source << allocate;\n std::string correct_source = \\\n \"allocate buf[f32 * 1023]\\n\"\n \"let y = 17\\n\"\n \"assert((y > 3), \\\"y is greater than 3\\\")\\n\"\n \"produce buf {\\n\"\n \" parallel (x, -2, (y + 2)) {\\n\"\n \" buf[(y - 1)] = ((x*17)\/(x - 3))\\n\"\n \" }\\n\"\n \"} consume {\\n\"\n \" vectorized (x, 0, y) {\\n\"\n \" out[x] = (buf((x % 3)) + 1)\\n\"\n \" }\\n\"\n \"}\\n\"\n \"free buf\\n\";\n\n if (source.str() != correct_source) {\n std::cout << \"Correct output:\" << std::endl << correct_source;\n std::cout << \"Actual output:\" << std::endl << source.str();\n assert(false);\n } \n std::cout << \"IRPrinter test passed\" << std::endl;\n}\n\nIRPrinter::IRPrinter(ostream &s) : stream(s), indent(0) {}\n\nvoid IRPrinter::print(Expr ir) {\n ir.accept(this);\n}\n\nvoid IRPrinter::print(Stmt ir) {\n ir.accept(this);\n}\n\n\nvoid IRPrinter::do_indent() {\n for (int i = 0; i < indent; i++) stream << ' ';\n}\n \nvoid IRPrinter::visit(const IntImm *op) {\n stream << op->value;\n}\n \nvoid IRPrinter::visit(const FloatImm *op) {\n stream << op->value;\n}\n \nvoid IRPrinter::visit(const Cast *op) { \n stream << op->type << '(';\n print(op->value);\n stream << ')';\n}\n \nvoid IRPrinter::visit(const Variable *op) {\n \/\/ omit the type\n stream << op->name;\n}\n \nvoid IRPrinter::visit(const Add *op) {\n stream << '(';\n print(op->a);\n stream << \" + \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Sub *op) {\n stream << '(';\n print(op->a);\n stream << \" - \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Mul *op) {\n stream << '(';\n print(op->a);\n stream << \"*\";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Div *op) {\n stream << '(';\n print(op->a);\n stream << \"\/\";\n print(op->b);\n stream << ')';\n}\n \nvoid IRPrinter::visit(const Mod *op) {\n stream << '(';\n print(op->a);\n stream << \" % \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Min *op) {\n stream << \"min(\";\n print(op->a);\n stream << \", \";\n print(op->b);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Max *op) {\n stream << \"max(\";\n print(op->a);\n stream << \", \";\n print(op->b);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const EQ *op) {\n stream << '(';\n print(op->a);\n stream << \" == \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const NE *op) {\n stream << '(';\n print(op->a);\n stream << \" != \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const LT *op) {\n stream << '(';\n print(op->a);\n stream << \" < \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const LE *op) {\n stream << '(';\n print(op->a);\n stream << \" <= \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const GT *op) {\n stream << '(';\n print(op->a);\n stream << \" > \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const GE *op) {\n stream << '(';\n print(op->a);\n stream << \" >= \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const And *op) {\n stream << '(';\n print(op->a);\n stream << \" && \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Or *op) {\n stream << '(';\n print(op->a);\n stream << \" || \";\n print(op->b);\n stream << ')';\n}\n\nvoid IRPrinter::visit(const Not *op) {\n stream << '!';\n print(op->a);\n}\n\nvoid IRPrinter::visit(const Select *op) {\n stream << \"select(\";\n print(op->condition);\n stream << \", \";\n print(op->true_value);\n stream << \", \";\n print(op->false_value);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Load *op) {\n stream << op->buffer << \"[\";\n print(op->index);\n stream << \"]\";\n}\n\nvoid IRPrinter::visit(const Ramp *op) {\n stream << \"ramp(\";\n print(op->base);\n stream << \", \";\n print(op->stride);\n stream << \", \" << op->width << \")\";\n}\n\nvoid IRPrinter::visit(const Broadcast *op) {\n stream << \"broadcast(\";\n print(op->value);\n stream << \", \" << op->width << \")\";\n}\n\nvoid IRPrinter::visit(const Call *op) {\n stream << op->name << \"(\";\n for (size_t i = 0; i < op->args.size(); i++) {\n print(op->args[i]);\n if (i < op->args.size() - 1) {\n stream << \", \";\n }\n }\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const Let *op) {\n stream << \"(let \" << op->name << \" = \";\n print(op->value);\n stream << \" in \";\n print(op->body);\n stream << \")\";\n}\n\nvoid IRPrinter::visit(const LetStmt *op) {\n do_indent();\n stream << \"let \" << op->name << \" = \";\n print(op->value);\n stream << endl;\n\n print(op->body);\n}\n\nvoid IRPrinter::visit(const PrintStmt *op) {\n do_indent();\n stream << \"print(\" << op->prefix;\n for (size_t i = 0; i < op->args.size(); i++) {\n stream << \", \";\n print(op->args[i]);\n }\n stream << \")\" << endl;\n}\n\nvoid IRPrinter::visit(const AssertStmt *op) {\n do_indent();\n stream << \"assert(\";\n print(op->condition);\n stream << \", \\\"\" << op->message << \"\\\")\" << endl;\n}\n\nvoid IRPrinter::visit(const Pipeline *op) {\n\n\n do_indent();\n stream << \"produce \" << op->buffer << \" {\" << endl;\n indent += 2;\n print(op->produce);\n indent -= 2;\n\n if (op->update.defined()) {\n do_indent();\n stream << \"} update {\" << endl;\n indent += 2;\n print(op->update);\n indent -= 2;\n }\n \n do_indent();\n stream << \"} consume {\" << endl;\n indent += 2;\n print(op->consume);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const For *op) {\n\n do_indent();\n stream << op->for_type << \" (\" << op->name << \", \";\n print(op->min);\n stream << \", \";\n print(op->extent);\n stream << \") {\" << endl;\n \n indent += 2;\n print(op->body);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const Store *op) {\n do_indent();\n stream << op->buffer << \"[\";\n print(op->index);\n stream << \"] = \";\n print(op->value);\n stream << endl;\n}\n\nvoid IRPrinter::visit(const Provide *op) {\n do_indent();\n stream << op->buffer << \"(\";\n for (size_t i = 0; i < op->args.size(); i++) {\n print(op->args[i]);\n if (i < op->args.size() - 1) stream << \", \";\n }\n stream << \") = \";\n print(op->value);\n stream << endl;\n}\n\nvoid IRPrinter::visit(const Allocate *op) {\n do_indent();\n stream << \"allocate \" << op->buffer << \"[\" << op->type << \" * \";\n print(op->size);\n stream << \"]\" << endl;\n print(op->body);\n\n do_indent();\n stream << \"free \" << op->buffer << endl;\n}\n\nvoid IRPrinter::visit(const Realize *op) {\n do_indent();\n stream << \"realize \" << op->buffer << \"(\";\n for (size_t i = 0; i < op->bounds.size(); i++) {\n stream << \"[\";\n print(op->bounds[i].first);\n stream << \", \";\n print(op->bounds[i].second);\n stream << \"]\";\n if (i < op->bounds.size() - 1) stream << \", \";\n }\n stream << \") {\" << endl;\n\n indent += 2;\n print(op->body);\n indent -= 2;\n\n do_indent();\n stream << \"}\" << endl;\n}\n\nvoid IRPrinter::visit(const Block *op) {\n print(op->first);\n if (op->rest.defined()) print(op->rest);\n}\n\n \n}}\n<|endoftext|>"} {"text":"<commit_before>AliAnalysisTaskExtractCascadePbPbRun2 *AddTaskExtractCascade( const TString lMasterJobSessionFlag = \"\")\n{\n\/\/ Creates, configures and attaches to the train a cascades check task.\n \/\/ Get the pointer to the existing analysis manager via the static access method.\n \/\/==============================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskExtractCascade\", \"No analysis manager to connect to.\");\n return NULL;\n } \n\n \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n \/\/==============================================================================\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskExtractCascade\", \"This task requires an input event handler\");\n return NULL;\n } \n TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n\n \/\/ Create and configure the task\n\t AliAnalysisTaskExtractCascadePbPbRun2 *taskextract = new AliAnalysisTaskExtractCascadePbPbRun2(\"taskextract\");\n\n mgr->AddTask(taskextract);\n\n TString outputFileName = AliAnalysisManager::GetCommonFileName();\n \n outputFileName += \":PWGLFExtractCascade\";\n \/\/if (lSwitchIsNuclear) outputFileName += \"_AA\";\n outputFileName += \"_PP\";\n if (mgr->GetMCtruthEventHandler()) outputFileName += \"_MC\";\n \/\/if(lMasterJobSessionFlag.Length()) outputFileName += lMasterJobSessionFlag.Data();\n \n Printf(\"Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n\n AliAnalysisDataContainer *coutputList = mgr->CreateContainer(\"clist\",\n\t\t\t\t\t\t\t TList::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t outputFileName );\n AliAnalysisDataContainer *coutputTreeCascade = mgr->CreateContainer(\"cTreeCascade\",\n\t\t\t\t\t\t\t TTree::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t outputFileName );\n \n \/\/This one you should merge in file-resident ways...\n coutputTreeCascade->SetSpecialOutput();\n\n \/\/Recommendation: Tree as a single output slot\n mgr->ConnectInput( taskextract, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput(taskextract, 1, coutputList);\n mgr->ConnectOutput(taskextract, 2, coutputTreeCascade);\n \n return taskextract;\n} \n<commit_msg>Bug fix in AddTask Macro<commit_after>AliAnalysisTaskExtractCascadePbPbRun2 *AddTaskExtractCascadePbPbRun2( const TString lMasterJobSessionFlag = \"\")\n{\n\/\/ Creates, configures and attaches to the train a cascades check task.\n \/\/ Get the pointer to the existing analysis manager via the static access method.\n \/\/==============================================================================\n AliAnalysisManager *mgr = AliAnalysisManager::GetAnalysisManager();\n if (!mgr) {\n ::Error(\"AddTaskExtractCascade\", \"No analysis manager to connect to.\");\n return NULL;\n } \n\n \/\/ Check the analysis type using the event handlers connected to the analysis manager.\n \/\/==============================================================================\n if (!mgr->GetInputEventHandler()) {\n ::Error(\"AddTaskExtractCascade\", \"This task requires an input event handler\");\n return NULL;\n } \n TString type = mgr->GetInputEventHandler()->GetDataType(); \/\/ can be \"ESD\" or \"AOD\"\n\n \/\/ Create and configure the task\n\t AliAnalysisTaskExtractCascadePbPbRun2 *taskextract = new AliAnalysisTaskExtractCascadePbPbRun2(\"taskextract\");\n\n mgr->AddTask(taskextract);\n\n TString outputFileName = AliAnalysisManager::GetCommonFileName();\n \n outputFileName += \":PWGLFExtractCascade\";\n \/\/if (lSwitchIsNuclear) outputFileName += \"_AA\";\n outputFileName += \"_PP\";\n if (mgr->GetMCtruthEventHandler()) outputFileName += \"_MC\";\n \/\/if(lMasterJobSessionFlag.Length()) outputFileName += lMasterJobSessionFlag.Data();\n \n Printf(\"Set OutputFileName : \\n %s\\n\", outputFileName.Data() );\n\n AliAnalysisDataContainer *coutputList = mgr->CreateContainer(\"clist\",\n\t\t\t\t\t\t\t TList::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t outputFileName );\n AliAnalysisDataContainer *coutputTreeCascade = mgr->CreateContainer(\"cTreeCascade\",\n\t\t\t\t\t\t\t TTree::Class(),\n\t\t\t\t\t\t\t AliAnalysisManager::kOutputContainer,\n\t\t\t\t\t\t\t outputFileName );\n \n \/\/This one you should merge in file-resident ways...\n coutputTreeCascade->SetSpecialOutput();\n\n \/\/Recommendation: Tree as a single output slot\n mgr->ConnectInput( taskextract, 0, mgr->GetCommonInputContainer());\n mgr->ConnectOutput(taskextract, 1, coutputList);\n mgr->ConnectOutput(taskextract, 2, coutputTreeCascade);\n \n return taskextract;\n} \n<|endoftext|>"} {"text":"<commit_before>#include \"bayesian\/graph.hpp\"\n#include \"bayesian\/bp.hpp\"\n#include \"cpt.hpp\" \/\/ unordered_mapのネストの解決\n\nnamespace bn {\n\n\/\/ 辺のlikelihoodを保持し，簡易に前の状態をコピーすることが可能にするため\nclass likelihood_list {\npublic:\n class value_type {\n public:\n value_type(vertex_type const& from, vertex_type const& to, edge_type const& edge)\n : from_(from), to_(to), edge_(edge), likelihood_(from->selectable_num, to->selectable_num)\n {\n }\n virtual ~value_type() = default;\n\n vertex_type const from() const { return from_; }\n vertex_type const to() const { return to_; }\n edge_type const edge() const { return edge_; }\n\n matrix_type& likelihood()\n {\n return likelihood_;\n }\n matrix_type const& likelihood() const\n {\n return likelihood_;\n }\n\n private:\n vertex_type from_;\n vertex_type to_;\n edge_type edge_;\n matrix_type likelihood_;\n };\n\n matrix_type& add_manage(vertex_type const& from, vertex_type const& to, edge_type const& edge)\n {\n data_.emplace_back(from, to, edge);\n return data_.back().likelihood();\n }\n\n void del_manage(edge_type const& edge)\n {\n auto it = find(edge);\n if(it != data_.end()) data_.erase(it);\n }\n\n void del_manage(vertex_type const& from, vertex_type const& to)\n {\n auto it = find(from, to);\n if(it != data_.end()) data_.erase(it);\n }\n\n matrix_type& operator() (edge_type const& edge)\n {\n auto it = find(edge);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (edge_type)\");\n return it->likelihood();\n }\n\n matrix_type const& operator() (edge_type const& edge) const\n {\n auto it = find(edge);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (edge_type) const\");\n return it->likelihood();\n }\n\n matrix_type& operator() (vertex_type const& from, vertex_type const& to)\n {\n auto it = find(from, to);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (vertex_type,vertex_type)\");\n return it->likelihood();\n }\n\n matrix_type const& operator() (vertex_type const& from, vertex_type const& to) const\n {\n auto it = find(from, to);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (vertex_type,vertex_type) const\");\n return it->likelihood();\n }\n\nprivate:\n std::vector<value_type>::iterator find(edge_type const& edge)\n {\n auto it = data_.begin();\n while(it != data_.end())\n {\n if(it->edge() == edge) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::iterator find(vertex_type const& from, vertex_type const& to)\n {\n auto it = data_.begin();\n while(it != data_.end())\n {\n if(std::tie(it->from(), it->to()) == std::tie(from, to)) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::const_iterator find(edge_type const& edge) const\n {\n auto it = data_.cbegin();\n while(it != data_.cend())\n {\n if(it->edge() == edge) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::const_iterator find(vertex_type const& from, vertex_type const& to) const\n {\n auto it = data_.cbegin();\n while(it != data_.cend())\n {\n if(std::tie(it->from(), it->to()) == std::tie(from, to)) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type> data_;\n};\n\n\/\/ all_combination\nvoid all_combination_pattern(\n std::unordered_map<vertex_type, int>& combination,\n std::unordered_map<vertex_type, int>::iterator it,\n std::function<void(std::unordered_map<vertex_type, int> const& combination)> const& func\n )\n{\n if(it == conbination.end())\n {\n func(combination);\n }\n else\n {\n for(int i = 0; i < it->first->selectable_num; ++i)\n {\n it->second = i;\n all_combination_pattern(combination, it + 1, func);\n }\n }\n}\n\n\/\/ combinationから必要なノードの選択状態だけ取り出して，条件を更新する\nstd::unordered_map<vertex_type, int> update_select_condition(\n std::unordered_map<vertex_type, int> const& whole_condition,\n std::unordered_map<vertex_type, int> const& base_condition\n )\n{\n std::unordered_map<vertex_type, int> particle_condition = base_condition;\n for(auto it = particle_condition.begin(); it != particle_condition.end(); ++it)\n {\n it->second = whole_condition[it->first];\n }\n return particle_condition;\n}\n\n\/\/ 周辺化\nstd::unordered_map<std::unordered_map<vertex_type, int>, double> marginalize(\n std::unordered_map<std::unordered_map<vertex_type, int>, double> const& base,\n vertex_type const& target\n )\n{\n std::unordered_map<std::unordered_map<vertex_type, int>, double> result;\n all_combination_pattern(\n base, base.begin(),\n [&result, &base, &target](std::unordered_map<std::unordered_map<vertex_type, int>, double> const& condition)\n {\n auto new_condition = condition;\n new_condtion.erase(target);\n\n if(result.count(new_condition))\n {\n result[new_condition] += base[condition];\n }\n else\n {\n result[new_condition] = base[condition];\n }\n });\n\n return result;\n}\n\nlikelihood_list lilelihood_list_;\n\n\/\/ 条件化(条件を添加する)\nvoid conditioning(\n std::unordered_map<std::unordered_map<vertex_type, int>, double> const& probabilities,\n vertex_type const& target_node,\n vertex_type const& condition_node\n )\n{\n auto pair_probabilities = probabilities;\n for(auto it = probabilities.begin()->first.begin(); it != probabilities.begin()->first.end(); ++it)\n {\n if(it->first != target_node && it->first != condition_node)\n {\n pair_probabilities = marginalize(pair_probabilities, it->first);\n }\n }\n\n for(int i = 0; i < condition_node.selectable_num; ++i)\n {\n double denominator = 0;\n for(int j = 0; j < target_node.selectable; ++j)\n {\n auto const target_prob = pair_probabilities[{{condition_node,i},{target_node,j}}];\n denominator += target_prob;\n lilelihood_list_(condition_node, target_node)[i][j] = target_prob;\n }\n\n for(int j = 0; j < target_node.selectable; ++j)\n {\n lilelihood_list_(condition_node, target_node)[i][j] \/= denominator;\n }\n }\n}\n\n\/\/ 指定ノードから上流に拡散，上流が確定した後に自身を算出することで解を得る\nstd::unordered_map<std::unordered_map<vertex_type, int>, double> calculate_likelihood_from_backward(\n graph_t const& graph,\n vertex_type const& node\n )\n{\n std::vector<vertex_type> direct_parents; \/\/ 直接の親\n std::vector<vertex_type> indirect_parents; \/\/ 間接の親\n\n std::vector<std::unordered_map<std::unordered_map<vertex_type, int>, double>> upward_probabilities;\n\n \/\/ 上流ノードの列挙(boost::transformを使うと簡潔)\n for(auto const& upward_edge : graph.in_edges(node))\n {\n auto const upward_node = graph.source(upward_edge);\n direct_parents.push_back(upward_node);\n\n likelihood_list_.ad_manage(upward_node, node, upward_edge);\n }\n\n \/\/ 上流ノードがあるならば，上流を先に確定させる\n \/\/ なんでこんなの書いてるんだろうかとイライラしてきた\n for(auto const& upward_node : direct_parents)\n {\n auto const result = calculate_likelihood_from_backward(graph, upward_node);\n if(result.size() == 0) throw std::runtime_error(\"calculate_likelihood_from_backward: size = 0\");\n for(auto const& probability : result.begin()->first)\n {\n \/\/ 間接の親かどうか\n auto const& parent_node = probability->first;\n if(std::find(direct_parents.cbegin(), direct_parents.cend(), parent_node) == direct_parents.cend() &&\n std::find(indirect_parents.cbegin(), indirect_parents.cend(), parent_node) == indirect_parents.cend())\n {\n indirect_parents.push_back(parent_node);\n }\n }\n\n upward_probabilities.push_back(std::move(result));\n }\n\n \/\/ 上流ノード全ての組み合わせを作製して回す\n std::unordered_map<vertex_type, int> combination = {{node, 0}};\n for(auto const& key : direct_parents) combination[key] = 0;\n for(auto const& key : indirect_parents) combination[key] = 0;\n\n \/\/ returnにも使われる同時確率を計算\n std::unordered_map<std::unordered_map<vertex_type, int>, double> target_node_probability;\n all_combination_pattern(\n combination, combination.begin(),\n [&target_node_probability, &upward_probabilities](std::unordered_map<vertex_type, int> const& combination)\n {\n \/\/ foldl使うと，どうせVC落ちるからやめた\n double probability = node->cpt[update_select_condition(combination, node->cpt.begin()->first)]\n [combination[node]];\n\n for(auto const& upward : upward_probabilities)\n {\n probability *= upward[update_select_condition(combination, upward.begin()->first)];\n }\n target_node_probability[combination] = probability;\n });\n\n \/\/ 自身と直接の親以外の要素について，周辺化\n auto marginalized_probability = target_node_probability;\n for(auto it = indirect_parents.begin(); it != indirect_parents.end(); ++it)\n {\n marginalized_probability = marginalize(marginalized_probability, *it);\n }\n\n for(auto it = direct_parents.begin(); it != direct_parents.end(); ++it)\n {\n conditioning(marginalized_probability, node, *it);\n }\n\n return target_node_probability;\n}\n\n\/\/ cptを元に全てのエッジのlikelihoodを算出する\nvoid calculate_likelihood(graph_t const& graph)\n{\n auto node_list = graph.vertex_list();\n for(auto const& node : node_list)\n {\n auto edges = graph.out_edges(node);\n if(edges.size() == 0)\n {\n \/\/ 末端から走査したほうが都合がいいので，末端のノードを全網羅(==全エッジ走査)\n calculate_likelihood_from_backward \/\/ TODO:\n }\n }\n}\n\nmatrix_type bp::operator()(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n \/\/ 前後の要素に伝播させる\n auto const e_minus = propagate_forward(graph, node, condition);\n auto const e_plus = propagate_backward(graph, node, condition);\n\n \/\/ 掛け算\n auto const elem_num = node->selectable_num;\n double sum = 0.0;\n matrix_type mat(elem_num, 1);\n for(std::size_t i = 0; i < e_minus.height(); ++i)\n {\n double const product = e_minus[i][0] * e_plus[0][i];\n sum += product;\n mat[i][0] = product;\n }\n\n \/\/ 正規化\n for(std::size_t i = 0; i < e_minus.height(); ++i)\n {\n mat[i][0] \/= sum;\n }\n\n return mat;\n}\n\nstd::pair<bool, int> find_condition(\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n for(auto const& c : condition)\n {\n if(c.first == node)\n {\n return std::make_pair(true, c.second);\n }\n }\n\n return std::make_pair(false, 0);\n}\n\n\/\/ 下流要素の確率推論\nmatrix_type bp::propagate_forward(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n auto const elem_num = node->selectable_num;\n matrix_type mat(elem_num, 1, 1);\n\n \/\/ node ∈ condition\n auto is_condition = find_condition(node, condition);\n if(is_condition.first)\n {\n for(int i = 0; i < elem_num; ++i)\n {\n mat[i][0] = (i == is_condition.second) ? 1 : 0;\n }\n return mat;\n }\n\n \/\/ conditionに含まれないから伝播 (e-要素)\n auto const out_edges = graph.out_edges(node);\n if(!out_edges.empty())\n {\n for(auto const& edge : out_edges)\n {\n if(!edge->likelihood.first) throw std::runtime_error(\"no set edge of likelihood\");\n mat = mat % (edge->likelihood.second * propagate_forward(graph, graph.target(edge), condition));\n }\n\n return mat;\n }\n\n \/\/ 末端は全ての確率が等しいとする\n for(int i = 0; i < elem_num; ++i)\n {\n mat[i][0] = 1.0;\n }\n return mat;\n}\n\n\/\/ 上流要素の確率推論\nmatrix_type bp::propagate_backward(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n auto const elem_num = node->selectable_num;\n matrix_type mat(1, elem_num, 1);\n\n \/\/ node ∈ condition\n auto is_condition = find_condition(node, condition);\n if(is_condition.first)\n {\n for(int i = 0; i < elem_num; ++i)\n {\n mat[0][i] = (i == is_condition.second) ? 1 : 0;\n }\n return mat;\n }\n\n \/\/ conditionに含まれないから伝播 (e+要素)\n auto const in_edges = graph.in_edges(node);\n if(!in_edges.empty())\n {\n for(auto const& edge : in_edges)\n {\n if(!edge->likelihood.first) throw std::runtime_error(\"no set edge of likelihood\");\n mat = mat % (propagate_backward(graph, graph.source(edge), condition) * edge->likelihood.second);\n }\n\n return mat;\n }\n\n \/\/ 最上位ノードは事前確率を割り当てる\n auto& e = node->evidence;\n if(e.first)\n {\n return e.second;\n }\n else\n {\n throw std::runtime_error(\"highest node doesn't have prior probability.\");\n }\n}\n\n} \/\/ namespace bn\n\n<commit_msg>update: to be able to compile<commit_after>#include <functional>\n#include \"bayesian\/graph.hpp\"\n#include \"bayesian\/bp.hpp\"\n#include \"bayesian\/cpt.hpp\" \/\/ unordered_mapのネストの解決\n\nnamespace bn {\n\n\/\/ 辺のlikelihoodを保持し，簡易に前の状態をコピーすることが可能にするため\nclass likelihood_list {\npublic:\n class value_type {\n public:\n value_type(vertex_type const& from, vertex_type const& to, edge_type const& edge)\n : from_(from), to_(to), edge_(edge), likelihood_(from->selectable_num, to->selectable_num)\n {\n }\n virtual ~value_type() = default;\n\n vertex_type const from() const { return from_; }\n vertex_type const to() const { return to_; }\n edge_type const edge() const { return edge_; }\n\n matrix_type& likelihood()\n {\n return likelihood_;\n }\n matrix_type const& likelihood() const\n {\n return likelihood_;\n }\n\n private:\n vertex_type from_;\n vertex_type to_;\n edge_type edge_;\n matrix_type likelihood_;\n };\n\n matrix_type& add_manage(vertex_type const& from, vertex_type const& to, edge_type const& edge)\n {\n data_.emplace_back(from, to, edge);\n return data_.back().likelihood();\n }\n\n void del_manage(edge_type const& edge)\n {\n auto it = find(edge);\n if(it != data_.end()) data_.erase(it);\n }\n\n void del_manage(vertex_type const& from, vertex_type const& to)\n {\n auto it = find(from, to);\n if(it != data_.end()) data_.erase(it);\n }\n\n matrix_type& operator() (edge_type const& edge)\n {\n auto it = find(edge);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (edge_type)\");\n return it->likelihood();\n }\n\n matrix_type const& operator() (edge_type const& edge) const\n {\n auto it = find(edge);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (edge_type) const\");\n return it->likelihood();\n }\n\n matrix_type& operator() (vertex_type const& from, vertex_type const& to)\n {\n auto it = find(from, to);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (vertex_type,vertex_type)\");\n return it->likelihood();\n }\n\n matrix_type const& operator() (vertex_type const& from, vertex_type const& to) const\n {\n auto it = find(from, to);\n if(it == data_.end()) throw std::runtime_error(\"likelihood_list: operator() (vertex_type,vertex_type) const\");\n return it->likelihood();\n }\n\nprivate:\n std::vector<value_type>::iterator find(edge_type const& edge)\n {\n auto it = data_.begin();\n while(it != data_.end())\n {\n if(it->edge() == edge) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::iterator find(vertex_type const& from, vertex_type const& to)\n {\n auto it = data_.begin();\n while(it != data_.end())\n {\n if(std::tie(it->from(), it->to()) == std::tie(from, to)) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::const_iterator find(edge_type const& edge) const\n {\n auto it = data_.cbegin();\n while(it != data_.cend())\n {\n if(it->edge() == edge) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type>::const_iterator find(vertex_type const& from, vertex_type const& to) const\n {\n auto it = data_.cbegin();\n while(it != data_.cend())\n {\n if(std::tie(it->from(), it->to()) == std::tie(from, to)) break;\n else ++it;\n }\n return it;\n }\n\n std::vector<value_type> data_;\n};\n\n\/\/ all_combination\nvoid all_combination_pattern(\n std::unordered_map<vertex_type, int>& combination,\n std::unordered_map<vertex_type, int>::iterator it,\n std::function<void(std::unordered_map<vertex_type, int> const&)> const& func\n )\n{\n if(it == combination.end())\n {\n func(combination);\n }\n else\n {\n for(int i = 0; i < it->first->selectable_num; ++i)\n {\n it->second = i;\n\n \/\/ 前方だけだったのね…(処置は後で考える)\n auto next = it;\n ++next;\n all_combination_pattern(combination, next, func);\n }\n }\n}\n\n\/\/ combinationから必要なノードの選択状態だけ取り出して，条件を更新する\nstd::unordered_map<vertex_type, int> update_select_condition(\n std::unordered_map<vertex_type, int> const& whole_condition,\n std::unordered_map<vertex_type, int> particle_condition\n )\n{\n for(auto it = particle_condition.begin(); it != particle_condition.end(); ++it)\n {\n it->second = whole_condition.at(it->first);\n }\n return particle_condition;\n}\n\n\/\/ 実際こっちであるべき\nstd::unordered_map<vertex_type, int> update_select_condition(\n std::unordered_map<vertex_type, int> const& whole_condition,\n std::vector<vertex_type> const& particle\n )\n{\n std::unordered_map<vertex_type, int> particle_condition;\n for(auto const& v : particle) particle_condition[v] = 0;\n\n return update_select_condition(whole_condition, particle_condition);\n\n}\n\n\/\/ 周辺化\nstd::unordered_map<std::unordered_map<vertex_type, int>, double> marginalize(\n std::unordered_map<std::unordered_map<vertex_type, int>, double> base,\n vertex_type const& target\n )\n{\n std::unordered_map<std::unordered_map<vertex_type, int>, double> result;\n auto condition = base.begin()->first;\n all_combination_pattern(\n condition, condition.begin(),\n [&result, &base, &target](std::unordered_map<vertex_type, int> const& condition)\n {\n auto new_condition = condition;\n new_condition.erase(target);\n\n if(result.count(new_condition))\n {\n result[new_condition] += base[condition];\n }\n else\n {\n result[new_condition] = base[condition];\n }\n });\n\n return result;\n}\n\nlikelihood_list likelihood_list_;\n\n\/\/ 条件化(条件を添加する)\nvoid conditioning(\n std::unordered_map<std::unordered_map<vertex_type, int>, double> const& probabilities,\n vertex_type const& target_node,\n vertex_type const& condition_node\n )\n{\n auto pair_probabilities = probabilities;\n for(auto it = probabilities.begin()->first.begin(); it != probabilities.begin()->first.end(); ++it)\n {\n if(it->first != target_node && it->first != condition_node)\n {\n pair_probabilities = marginalize(pair_probabilities, it->first);\n }\n }\n\n for(int i = 0; i < condition_node->selectable_num; ++i)\n {\n double denominator = 0;\n for(int j = 0; j < target_node->selectable_num; ++j)\n {\n auto const target_prob = pair_probabilities[{{condition_node,i},{target_node,j}}];\n denominator += target_prob;\n likelihood_list_(condition_node, target_node)[i][j] = target_prob;\n }\n\n for(int j = 0; j < target_node->selectable_num; ++j)\n {\n likelihood_list_(condition_node, target_node)[i][j] \/= denominator;\n }\n }\n}\n\n\/\/ 指定ノードから上流に拡散，上流が確定した後に自身を算出することで解を得る\nstd::unordered_map<std::unordered_map<vertex_type, int>, double> calculate_likelihood_from_backward(\n graph_t const& graph,\n vertex_type const& node\n )\n{\n std::vector<vertex_type> direct_parents; \/\/ 直接の親\n std::vector<vertex_type> indirect_parents; \/\/ 間接の親\n\n std::vector<std::unordered_map<std::unordered_map<vertex_type, int>, double>> upward_probabilities;\n\n \/\/ 上流ノードの列挙(boost::transformを使うと簡潔)\n for(auto const& upward_edge : graph.in_edges(node))\n {\n auto const upward_node = graph.source(upward_edge);\n direct_parents.push_back(upward_node);\n\n likelihood_list_.add_manage(upward_node, node, upward_edge);\n }\n\n \/\/ 上流ノードがあるならば，上流を先に確定させる\n \/\/ なんでこんなの書いてるんだろうかとイライラしてきた\n for(auto const& upward_node : direct_parents)\n {\n auto const result = calculate_likelihood_from_backward(graph, upward_node);\n if(result.size() == 0) throw std::runtime_error(\"calculate_likelihood_from_backward: size = 0\");\n for(auto const& probability : result.begin()->first)\n {\n \/\/ 間接の親かどうか\n auto const& parent_node = probability.first;\n if(std::find(direct_parents.cbegin(), direct_parents.cend(), parent_node) == direct_parents.cend() &&\n std::find(indirect_parents.cbegin(), indirect_parents.cend(), parent_node) == indirect_parents.cend())\n {\n indirect_parents.push_back(parent_node);\n }\n }\n\n upward_probabilities.push_back(std::move(result));\n }\n\n \/\/ 上流ノード全ての組み合わせを作製して回す\n std::unordered_map<vertex_type, int> combination = {{node, 0}};\n for(auto const& key : direct_parents) combination[key] = 0;\n for(auto const& key : indirect_parents) combination[key] = 0;\n\n \/\/ returnにも使われる同時確率を計算\n std::unordered_map<std::unordered_map<vertex_type, int>, double> target_node_probability;\n all_combination_pattern(\n combination, combination.begin(),\n [&node, &target_node_probability, &upward_probabilities](std::unordered_map<vertex_type, int> const& combination)\n {\n \/\/ foldl使うと，どうせVC落ちるからやめた\n double probability = node->cpt[update_select_condition(combination, node->cpt.condition_node())]\n .second[combination.at(node)];\n\n for(auto const& upward : upward_probabilities)\n {\n probability *= upward.at(update_select_condition(combination, upward.begin()->first));\n }\n target_node_probability[combination] = probability;\n });\n\n \/\/ 自身と直接の親以外の要素について，周辺化\n auto marginalized_probability = target_node_probability;\n for(auto it = indirect_parents.begin(); it != indirect_parents.end(); ++it)\n {\n marginalized_probability = marginalize(marginalized_probability, *it);\n }\n\n for(auto it = direct_parents.begin(); it != direct_parents.end(); ++it)\n {\n conditioning(marginalized_probability, node, *it);\n }\n\n return target_node_probability;\n}\n\n\/\/ cptを元に全てのエッジのlikelihoodを算出する\nvoid calculate_likelihood(graph_t const& graph)\n{\n auto node_list = graph.vertex_list();\n for(auto const& node : node_list)\n {\n auto edges = graph.out_edges(node);\n if(edges.size() == 0)\n {\n \/\/ 末端から走査したほうが都合がいいので，末端のノードを全網羅(==全エッジ走査)\n calculate_likelihood_from_backward(graph, node);\n }\n }\n}\n\nmatrix_type bp::operator()(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n \/\/ 前後の要素に伝播させる\n auto const e_minus = propagate_forward(graph, node, condition);\n auto const e_plus = propagate_backward(graph, node, condition);\n\n \/\/ 掛け算\n auto const elem_num = node->selectable_num;\n double sum = 0.0;\n matrix_type mat(elem_num, 1);\n for(std::size_t i = 0; i < e_minus.height(); ++i)\n {\n double const product = e_minus[i][0] * e_plus[0][i];\n sum += product;\n mat[i][0] = product;\n }\n\n \/\/ 正規化\n for(std::size_t i = 0; i < e_minus.height(); ++i)\n {\n mat[i][0] \/= sum;\n }\n\n return mat;\n}\n\nstd::pair<bool, int> find_condition(\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n for(auto const& c : condition)\n {\n if(c.first == node)\n {\n return std::make_pair(true, c.second);\n }\n }\n\n return std::make_pair(false, 0);\n}\n\n\/\/ 下流要素の確率推論\nmatrix_type bp::propagate_forward(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n auto const elem_num = node->selectable_num;\n matrix_type mat(elem_num, 1, 1);\n\n \/\/ node ∈ condition\n auto is_condition = find_condition(node, condition);\n if(is_condition.first)\n {\n for(int i = 0; i < elem_num; ++i)\n {\n mat[i][0] = (i == is_condition.second) ? 1 : 0;\n }\n return mat;\n }\n\n \/\/ conditionに含まれないから伝播 (e-要素)\n auto const out_edges = graph.out_edges(node);\n if(!out_edges.empty())\n {\n for(auto const& edge : out_edges)\n {\n if(!edge->likelihood.first) throw std::runtime_error(\"no set edge of likelihood\");\n mat = mat % (edge->likelihood.second * propagate_forward(graph, graph.target(edge), condition));\n }\n\n return mat;\n }\n\n \/\/ 末端は全ての確率が等しいとする\n for(int i = 0; i < elem_num; ++i)\n {\n mat[i][0] = 1.0;\n }\n return mat;\n}\n\n\/\/ 上流要素の確率推論\nmatrix_type bp::propagate_backward(\n graph_t const& graph,\n vertex_type const& node,\n std::vector<std::pair<vertex_type, int>> const& condition\n )\n{\n auto const elem_num = node->selectable_num;\n matrix_type mat(1, elem_num, 1);\n\n \/\/ node ∈ condition\n auto is_condition = find_condition(node, condition);\n if(is_condition.first)\n {\n for(int i = 0; i < elem_num; ++i)\n {\n mat[0][i] = (i == is_condition.second) ? 1 : 0;\n }\n return mat;\n }\n\n \/\/ conditionに含まれないから伝播 (e+要素)\n auto const in_edges = graph.in_edges(node);\n if(!in_edges.empty())\n {\n for(auto const& edge : in_edges)\n {\n if(!edge->likelihood.first) throw std::runtime_error(\"no set edge of likelihood\");\n mat = mat % (propagate_backward(graph, graph.source(edge), condition) * edge->likelihood.second);\n }\n\n return mat;\n }\n\n \/\/ 最上位ノードは事前確率を割り当てる\n auto& e = node->evidence;\n if(e.first)\n {\n return e.second;\n }\n else\n {\n throw std::runtime_error(\"highest node doesn't have prior probability.\");\n }\n}\n\n} \/\/ namespace bn\n\n<|endoftext|>"} {"text":"<commit_before>#include \"common\/RhoPort.h\"\nextern \"C\" void Init_System();\nextern \"C\" void Init_Network();\nextern \"C\" void Init_SQLite3();\nextern \"C\" void Init_Log();\nextern \"C\" void Init_WebView();\nextern \"C\" void Init_WebView_extension();\nextern \"C\" void Init_Application();\nextern \"C\" void Init_NativeToolbar();\nextern \"C\" void Init_NativeToolbar_extension();\nextern \"C\" void Init_NativeTabbar();\nextern \"C\" void Init_NativeTabbar_extension();\nextern \"C\" void Init_Navbar();\nextern \"C\" void Init_Notification();\nextern \"C\" void Init_RhoFile();\nextern \"C\" void Init_NativeMenuBar();\nextern \"C\" void Init_Led();\nextern \"C\" void Init_Push();\n\nextern \"C\" void Init_CoreAPI_Extension()\n{\n Init_System();\n Init_Application();\n\n\tInit_Network();\n Init_SQLite3();\n Init_Log();\n#if defined(OS_MACOSX) || defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(OS_ANDROID)\n Init_WebView();\n#elif defined(OS_WP8)\n Init_WebView_extension();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || (defined(OS_MACOSX) && defined(RHODES_EMULATOR)) || defined(OS_ANDROID) || defined(OS_MACOSX)\n Init_NativeToolbar();\n Init_NativeTabbar();\n#elif defined(OS_WP8)\n Init_NativeToolbar_extension();\n Init_NativeTabbar_extension();\n#endif\n\n#if defined(OS_MACOSX) || defined(RHODES_EMULATOR)\n Init_Navbar();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(RHODES_EMULATOR) || defined(OS_WINCE) || defined(OS_MACOSX) || defined(OS_ANDROID)\n Init_Notification();\n#endif\n\n#if defined(OS_MACOSX) || defined(OS_ANDROID) || defined(WINDOWS_PLATFORM)\n Init_RhoFile();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(RHODES_EMULATOR)\n Init_NativeMenuBar();\n#endif\n\n\n#if defined(OS_WINCE) || defined(OS_ANDROID)\n\t\/\/Init_Led();\n#endif\n\n#if defined(OS_ANDROID) || defined(OS_WINCE) || defined(OS_MACOSX)\n\tInit_Push();\n#endif\n}\n<commit_msg>added rhoconnect-push for win32<commit_after>#include \"common\/RhoPort.h\"\nextern \"C\" void Init_System();\nextern \"C\" void Init_Network();\nextern \"C\" void Init_SQLite3();\nextern \"C\" void Init_Log();\nextern \"C\" void Init_WebView();\nextern \"C\" void Init_WebView_extension();\nextern \"C\" void Init_Application();\nextern \"C\" void Init_NativeToolbar();\nextern \"C\" void Init_NativeToolbar_extension();\nextern \"C\" void Init_NativeTabbar();\nextern \"C\" void Init_NativeTabbar_extension();\nextern \"C\" void Init_Navbar();\nextern \"C\" void Init_Notification();\nextern \"C\" void Init_RhoFile();\nextern \"C\" void Init_NativeMenuBar();\nextern \"C\" void Init_Led();\nextern \"C\" void Init_Push();\n\nextern \"C\" void Init_CoreAPI_Extension()\n{\n Init_System();\n Init_Application();\n\n\tInit_Network();\n Init_SQLite3();\n Init_Log();\n#if defined(OS_MACOSX) || defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(OS_ANDROID)\n Init_WebView();\n#elif defined(OS_WP8)\n Init_WebView_extension();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || (defined(OS_MACOSX) && defined(RHODES_EMULATOR)) || defined(OS_ANDROID) || defined(OS_MACOSX)\n Init_NativeToolbar();\n Init_NativeTabbar();\n#elif defined(OS_WP8)\n Init_NativeToolbar_extension();\n Init_NativeTabbar_extension();\n#endif\n\n#if defined(OS_MACOSX) || defined(RHODES_EMULATOR)\n Init_Navbar();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(RHODES_EMULATOR) || defined(OS_WINCE) || defined(OS_MACOSX) || defined(OS_ANDROID)\n Init_Notification();\n#endif\n\n#if defined(OS_MACOSX) || defined(OS_ANDROID) || defined(WINDOWS_PLATFORM)\n Init_RhoFile();\n#endif\n\n#if defined(OS_WINDOWS_DESKTOP) || defined(OS_WINCE) || defined(RHODES_EMULATOR)\n Init_NativeMenuBar();\n#endif\n\n\n#if defined(OS_WINCE) || defined(OS_ANDROID)\n\t\/\/Init_Led();\n#endif\n\n#if defined(OS_ANDROID) || defined(OS_WINCE) || defined(OS_MACOSX) || defined(OS_WINDOWS_DESKTOP)\n\tInit_Push();\n#endif\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * ARC++\n *\n * Copyright (c) 2007-2008 Steven Noonan.\n *\n * Licensed under the New BSD License.\n *\n *\/\n\n#include \"universal_include.h\"\n\n#include \"App\/app.h\"\n#include \"Graphics\/graphics.h\"\n#include \"Interface\/interface.h\"\n#include \"Interface\/window.h\"\n\nWindow::Window()\n : Widget(), m_dragging(false)\n{\n SetWidgetClass ( \"Window\" );\n}\n\nWindow::Window ( Sint16 x, Sint16 y, Uint16 w, Uint16 h )\n : Widget(x,y,w,h), m_dragging(false)\n{\n SetWidgetClass ( \"Window\" );\n}\n\nWindow::~Window()\n{\n}\n\nint Window::SendEnterKey ()\n{\n if ( HasEnterKeyDefault() )\n {\n return m_enterKeyDefault->SendEnterKey ();\n } else {\n return 0;\n }\n}\n\nint Window::MouseDown ( bool _mouseDown, Sint32 x, Sint32 y )\n{\n if ( !m_dragging )\n {\n SDL_Rect actualPosition;\n for ( int i = m_widgets.size() - 1; i >= 0; i-- )\n {\n Widget *widget = m_widgets[i];\n \/\/ Window widget positions are relative to the window's position.\n actualPosition.x = widget->m_position.x + m_position.x;\n actualPosition.y = widget->m_position.y + m_position.y;\n actualPosition.w = widget->m_position.w;\n actualPosition.h = widget->m_position.h;\n if ( x < actualPosition.x || y < actualPosition.y )\n continue;\n if ( x > ( actualPosition.x + actualPosition.w ) ||\n y > ( actualPosition.y + actualPosition.h ) )\n continue;\n if ( !(widget->MouseDown ( _mouseDown, x, y )) )\n break;\n return -1;\n break;\n }\n }\n if ( !m_dragging && _mouseDown )\n {\n g_interface->SetDragWindow ( this );\n m_dragging = true;\n m_mouseXOffset = x - m_position.x;\n m_mouseYOffset = y - m_position.y;\n } else if ( m_dragging && _mouseDown ) {\n SetPosition ( x - m_mouseXOffset, y - m_mouseYOffset );\n } else if ( m_dragging && !_mouseDown ) {\n g_interface->SetDragWindow ( NULL );\n m_dragging = false;\n }\n return 1;\n}\n\nvoid Window::DrawBox ()\n{\n SDL_Rect rBox; short x; short y; short xt; short yt;\n short xTo; short yTo; SDL_Rect rTo;\n\n \/\/ TODO: Windows are restricted at heights\/widths that are evenly divisible by 16. That's annoying. Fix it.\n\n m_position.w = (m_position.w - (m_position.w % 8));\n m_position.h = (m_position.h - (m_position.h % 8));\n\n xTo = m_position.w \/ 8 - 1;\n yTo = m_position.h \/ 8 - 1;\n\n m_cachedSurfaceID = g_graphics->CreateSurface ( m_position.w, m_position.h, true );\n\n for ( x = 0; x < xTo; x++ )\n {\n for ( y = 0; y < yTo; y++ )\n {\n rBox.y = 0; rBox.h = 0; rBox.x = 0; rBox.w = 0;\n xt = x * 8;\n yt = y * 8;\n if ( y == 1 || x == 1 ) continue;\n if (x > 0 && x != xTo - 1 ) { rBox.x = 16; }\n else if ( x == xTo - 1 ) { rBox.x = 32; }\n if ( y == 0 ) rBox.y = 0;\n if ( y > 0 ) rBox.y = 16; \/\/ Middle\n if ( y == yTo - 1 ) rBox.y = 32;\n rBox.h = 16; rBox.w = 16;\n rBox.x += 251;\n rBox.y += 12;\n rTo.x = xt;\n rTo.y = yt;\n g_graphics->Blit ( g_interface->GetSidebarSurfaceID(), &rBox, m_cachedSurfaceID, &rTo );\n }\n }\n}\n\nvoid Window::Update()\n{\n Widget::Update();\n if ( (int)m_cachedSurfaceID == -1 )\n DrawBox();\n}\n<commit_msg>window.cpp: clarify comment<commit_after>\/*\n * ARC++\n *\n * Copyright (c) 2007-2008 Steven Noonan.\n *\n * Licensed under the New BSD License.\n *\n *\/\n\n#include \"universal_include.h\"\n\n#include \"App\/app.h\"\n#include \"Graphics\/graphics.h\"\n#include \"Interface\/interface.h\"\n#include \"Interface\/window.h\"\n\nWindow::Window()\n : Widget(), m_dragging(false)\n{\n SetWidgetClass ( \"Window\" );\n}\n\nWindow::Window ( Sint16 x, Sint16 y, Uint16 w, Uint16 h )\n : Widget(x,y,w,h), m_dragging(false)\n{\n SetWidgetClass ( \"Window\" );\n}\n\nWindow::~Window()\n{\n}\n\nint Window::SendEnterKey ()\n{\n if ( HasEnterKeyDefault() )\n {\n return m_enterKeyDefault->SendEnterKey ();\n } else {\n return 0;\n }\n}\n\nint Window::MouseDown ( bool _mouseDown, Sint32 x, Sint32 y )\n{\n if ( !m_dragging )\n {\n SDL_Rect actualPosition;\n for ( int i = m_widgets.size() - 1; i >= 0; i-- )\n {\n Widget *widget = m_widgets[i];\n \/\/ Window widget positions are relative to the window's position.\n actualPosition.x = widget->m_position.x + m_position.x;\n actualPosition.y = widget->m_position.y + m_position.y;\n actualPosition.w = widget->m_position.w;\n actualPosition.h = widget->m_position.h;\n if ( x < actualPosition.x || y < actualPosition.y )\n continue;\n if ( x > ( actualPosition.x + actualPosition.w ) ||\n y > ( actualPosition.y + actualPosition.h ) )\n continue;\n if ( !(widget->MouseDown ( _mouseDown, x, y )) )\n break;\n return -1;\n break;\n }\n }\n if ( !m_dragging && _mouseDown )\n {\n g_interface->SetDragWindow ( this );\n m_dragging = true;\n m_mouseXOffset = x - m_position.x;\n m_mouseYOffset = y - m_position.y;\n } else if ( m_dragging && _mouseDown ) {\n SetPosition ( x - m_mouseXOffset, y - m_mouseYOffset );\n } else if ( m_dragging && !_mouseDown ) {\n g_interface->SetDragWindow ( NULL );\n m_dragging = false;\n }\n return 1;\n}\n\nvoid Window::DrawBox ()\n{\n SDL_Rect rBox; short x; short y; short xt; short yt;\n short xTo; short yTo; SDL_Rect rTo;\n\n \/\/ TODO: Window widgets are restricted at heights\/widths that are evenly divisible by 16. That's annoying. Fix it.\n\n m_position.w = (m_position.w - (m_position.w % 8));\n m_position.h = (m_position.h - (m_position.h % 8));\n\n xTo = m_position.w \/ 8 - 1;\n yTo = m_position.h \/ 8 - 1;\n\n m_cachedSurfaceID = g_graphics->CreateSurface ( m_position.w, m_position.h, true );\n\n for ( x = 0; x < xTo; x++ )\n {\n for ( y = 0; y < yTo; y++ )\n {\n rBox.y = 0; rBox.h = 0; rBox.x = 0; rBox.w = 0;\n xt = x * 8;\n yt = y * 8;\n if ( y == 1 || x == 1 ) continue;\n if (x > 0 && x != xTo - 1 ) { rBox.x = 16; }\n else if ( x == xTo - 1 ) { rBox.x = 32; }\n if ( y == 0 ) rBox.y = 0;\n if ( y > 0 ) rBox.y = 16; \/\/ Middle\n if ( y == yTo - 1 ) rBox.y = 32;\n rBox.h = 16; rBox.w = 16;\n rBox.x += 251;\n rBox.y += 12;\n rTo.x = xt;\n rTo.y = yt;\n g_graphics->Blit ( g_interface->GetSidebarSurfaceID(), &rBox, m_cachedSurfaceID, &rTo );\n }\n }\n}\n\nvoid Window::Update()\n{\n Widget::Update();\n if ( (int)m_cachedSurfaceID == -1 )\n DrawBox();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * File: Text.hpp\n * Author: iMer\n *\n * Created on 7. Dezember 2014, 00:48\n *\/\n\n#ifndef ENGINE_TEXT_HPP\n#define\tENGINE_TEXT_HPP\n#include \"Node.hpp\"\n#include <SFML\/Graphics.hpp>\nnamespace engine {\n\tenum TextAlign {\n\t\tALIGN_LEFT,\n\t\tALIGN_CENTER,\n\t\tALIGN_RIGHT,\n\t};\n class Text : public Node {\n protected:\n sf::Font m_font;\n sf::Text m_text;\n\t\tuint8_t m_align;\n public:\n Text(Scene* scene);\n virtual ~Text();\n\n void SetText(std::string text);\n\n std::string GetText() const {\n m_text.getString();\n }\n\n sf::Text& GetSFText() {\n return m_text;\n }\n\n void SetFont(sf::Font font) {\n m_font = font;\n }\n\n sf::Font GetFont() const {\n return m_font;\n }\n virtual bool initialize(Json::Value& root);\n\n virtual uint8_t GetType() const {\n return NT_TEXT;\n }\n\n void SetAlign(uint8_t align) {\n \tm_align = align;\n }\n\n uint8_t GetAlign() const {\n \treturn m_align;\n }\n\n protected:\n virtual void OnDraw(sf::RenderTarget& target, sf::RenderStates states, float delta);\n\n };\n}\n\n#endif\t\/* TEXT_HPP *\/\n\n<commit_msg>Added Text color getter\/setter<commit_after>\/*\n * File: Text.hpp\n * Author: iMer\n *\n * Created on 7. Dezember 2014, 00:48\n *\/\n\n#ifndef ENGINE_TEXT_HPP\n#define\tENGINE_TEXT_HPP\n#include \"Node.hpp\"\n#include <SFML\/Graphics.hpp>\nnamespace engine {\n\tenum TextAlign {\n\t\tALIGN_LEFT,\n\t\tALIGN_CENTER,\n\t\tALIGN_RIGHT,\n\t};\n class Text : public Node {\n protected:\n sf::Font m_font;\n sf::Text m_text;\n\t\tuint8_t m_align;\n public:\n Text(Scene* scene);\n virtual ~Text();\n\n void SetText(std::string text);\n\n std::string GetText() const {\n m_text.getString();\n }\n\n sf::Text& GetSFText() {\n return m_text;\n }\n\n void SetFont(sf::Font font) {\n m_font = font;\n }\n\n sf::Font GetFont() const {\n return m_font;\n }\n virtual bool initialize(Json::Value& root);\n\n virtual uint8_t GetType() const {\n return NT_TEXT;\n }\n\n void SetAlign(uint8_t align) {\n \tm_align = align;\n }\n\n uint8_t GetAlign() const {\n \treturn m_align;\n }\n\t\tconst sf::Color& GetColor() {\n\t\t\tm_text.getColor();\n\t\t}\n\t\t\n\t\tvoid SetColor(const sf::Color& color) {\n\t\t\tm_text.setColor(color);\n\t\t}\n\n protected:\n virtual void OnDraw(sf::RenderTarget& target, sf::RenderStates states, float delta);\n\n };\n}\n\n#endif\t\/* TEXT_HPP *\/\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\tsocket.io-arduino-client: a Socket.IO client for the Arduino\n\n\tBased on the Kevin Rohling WebSocketClient\n\n\tCopyright 2013 Bill Roy\n\n\tPermission is hereby granted, free of charge, to any person\n\tobtaining a copy of this software and associated documentation\n\tfiles (the \"Software\"), to deal in the Software without\n\trestriction, including without limitation the rights to use,\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\n\tcopies of the Software, and to permit persons to whom the\n\tSoftware is furnished to do so, subject to the following\n\tconditions:\n\t\n\tThe above copyright notice and this permission notice shall be\n\tincluded in all copies or substantial portions of the Software.\n\t\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n\tOTHER DEALINGS IN THE SOFTWARE.\n*\/\n#include <SocketIOClient.h>\n\nbool SocketIOClient::connect(char thehostname[], int theport) {\n\tif (!client.connect(thehostname, theport)) return false;\n\thostname = thehostname;\n\tport = theport;\n\tsendHandshake(hostname);\n\treturn readHandshake();\n}\n\nbool SocketIOClient::connected() {\n\treturn client.connected();\n}\n\nvoid SocketIOClient::disconnect() {\n\tclient.stop();\n}\n\n\/\/ find the nth colon starting from dataptr\nvoid SocketIOClient::findColon(char which) {\t\n\twhile (*dataptr) {\n\t\tif (*dataptr == ':') {\n\t\t\tif (--which <= 0) return;\n\t\t}\n\t\t++dataptr;\n\t}\n}\n\n\/\/ terminate command at dataptr at closing double quote\nvoid SocketIOClient::terminateCommand(void) {\n\tdataptr[strlen(dataptr)-3] = 0;\n}\n\nvoid SocketIOClient::monitor() {\n\n\t*databuffer = 0;\n\tif (!client.available()) return;\n\n\tchar which;\n\twhile (client.available()) {\n\t\treadLine();\n\t\tdataptr = databuffer;\n\t\tswitch (databuffer[0]) {\t\n\n\t\tcase '1':\t\t\/\/ connect: []\n\t\t\twhich = 6;\n\t\t\tbreak;\n\n\t\tcase '2':\t\t\/\/ heartbeat: [2::]\n\t\t\tclient.print((char)0);\n\t\t\tclient.print(\"2::\");\n\t\t\tclient.print((char)255);\n\t\t\tcontinue;\n\n\t\tcase '5':\t\t\/\/ event: [5:::{\"name\":\"ls\"}]\n\t\t\twhich = 4;\n\t\t\tbreak;\n\n\t\tdefault: \n\t\t\tSerial.print(\"Drop \");\n\t\t\tSerial.println(dataptr);\n\t\t\tcontinue;\n\t\t}\n\n\t\tfindColon(which);\n\t\tdataptr += 2;\n\n\t\t\/\/ handle backslash-delimited escapes\n\t\tchar *optr = databuffer;\n\t\twhile (*dataptr && (*dataptr != '\"')) {\n\t\t\tif (*dataptr == '\\\\') {\n\t\t\t\t++dataptr;\t\t\/\/ todo: this just handles \"; handle \\r, \\n, \\t, \\xdd\n\t\t\t}\n\t\t\t*optr++ = *dataptr++;\n\t\t}\n\t\t*optr = 0;\n\n\t\tSerial.print(\"[\");\n\t\tSerial.print(databuffer);\n\t\tSerial.print(\"]\");\n\n\t\tif (dataArrivedDelegate != NULL) {\n\t\t\tdataArrivedDelegate(*this, databuffer);\n\t\t}\n\t}\n}\n\nvoid SocketIOClient::setDataArrivedDelegate(DataArrivedDelegate newdataArrivedDelegate) {\n\t dataArrivedDelegate = newdataArrivedDelegate;\n}\n\nvoid SocketIOClient::sendHandshake(char hostname[]) {\n\tclient.println(F(\"GET \/socket.io\/1\/ HTTP\/1.1\"));\n\tclient.print(F(\"Host: \"));\n\tclient.println(hostname);\n\tclient.println(F(\"Origin: Arduino\\r\\n\"));\n}\n\nbool SocketIOClient::waitForInput(void) {\nunsigned long now = millis();\n\twhile (!client.available() && ((millis() - now) < 30000UL)) {;}\n\treturn client.available();\n}\n\nvoid SocketIOClient::eatHeader(void) {\n\twhile (client.available()) {\t\/\/ consume the header\n\t\treadLine();\n\t\tif (strlen(databuffer) == 0) break;\n\t}\n}\n\nbool SocketIOClient::readHandshake() {\n\n\tif (!waitForInput()) return false;\n\n\t\/\/ check for happy \"HTTP\/1.1 200\" response\n\treadLine();\n\tif (atoi(&databuffer[9]) != 200) {\n\t\twhile (client.available()) readLine();\n\t\tclient.stop();\n\t\treturn false;\n\t}\n\teatHeader();\n\treadLine();\t\/\/ read first line of response\n\treadLine();\t\/\/ read sid : transport : timeout\n\n\tchar *iptr = databuffer;\n\tchar *optr = sid;\n\twhile (*iptr && (*iptr != ':') && (optr < &sid[SID_LEN-2])) *optr++ = *iptr++;\n\t*optr = 0;\n\n\tSerial.print(F(\"Connected. SID=\"));\n\tSerial.println(sid);\t\/\/ sid:transport:timeout \n\n\twhile (client.available()) readLine();\n\tclient.stop();\n\tdelay(1000);\n\n\t\/\/ reconnect on websocket connection\n\tSerial.print(F(\"WS Connect...\"));\n\tif (!client.connect(hostname, port)) {\n\t\tSerial.print(F(\"Reconnect failed.\"));\n\t\treturn false;\n\t}\n\tSerial.println(F(\"Reconnected.\"));\n\n\tclient.print(F(\"GET \/socket.io\/1\/websocket\/\"));\n\tclient.print(sid);\n\tclient.println(F(\" HTTP\/1.1\"));\n\tclient.print(F(\"Host: \"));\n\tclient.println(hostname);\n\tclient.println(F(\"Origin: ArduinoSocketIOClient\"));\n\tclient.println(F(\"Upgrade: WebSocket\"));\t\/\/ must be camelcase ?!\n\tclient.println(F(\"Connection: Upgrade\\r\\n\"));\n\n\tif (!waitForInput()) return false;\n\n\treadLine();\n\tif (atoi(&databuffer[9]) != 101) {\n\t\twhile (client.available()) readLine();\n\t\tclient.stop();\n\t\treturn false;\n\t}\n\teatHeader();\n\tmonitor();\t\t\/\/ treat the response as input\n\treturn true;\n}\n\nvoid SocketIOClient::readLine() {\n\tdataptr = databuffer;\n\twhile (client.available() && (dataptr < &databuffer[DATA_BUFFER_LEN-2])) {\n\t\tchar c = client.read();\n\t\t\/\/Serial.print(c);\n\t\tif (c == 0) Serial.print(F(\"NULL\"));\n\t\telse if (c == 255) Serial.print(F(\"0x255\"));\n\t\telse if (c == '\\r') {;}\n\t\telse if (c == '\\n') break;\n\t\telse *dataptr++ = c;\n\t}\n\t*dataptr = 0;\n}\n\nvoid SocketIOClient::send(char *data) {\n\tclient.print((char)0);\n\tclient.print(\"3:::\");\n\tclient.print(data);\n\tclient.print((char)255);\n}\n<commit_msg>automatically reconnect if needed in monitor()<commit_after>\/*\n\tsocket.io-arduino-client: a Socket.IO client for the Arduino\n\n\tBased on the Kevin Rohling WebSocketClient\n\n\tCopyright 2013 Bill Roy\n\n\tPermission is hereby granted, free of charge, to any person\n\tobtaining a copy of this software and associated documentation\n\tfiles (the \"Software\"), to deal in the Software without\n\trestriction, including without limitation the rights to use,\n\tcopy, modify, merge, publish, distribute, sublicense, and\/or sell\n\tcopies of the Software, and to permit persons to whom the\n\tSoftware is furnished to do so, subject to the following\n\tconditions:\n\t\n\tThe above copyright notice and this permission notice shall be\n\tincluded in all copies or substantial portions of the Software.\n\t\n\tTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\tEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n\tOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\tNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\n\tHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\n\tWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n\tFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\n\tOTHER DEALINGS IN THE SOFTWARE.\n*\/\n#include <SocketIOClient.h>\n\nbool SocketIOClient::connect(char thehostname[], int theport) {\n\tif (!client.connect(thehostname, theport)) return false;\n\thostname = thehostname;\n\tport = theport;\n\tsendHandshake(hostname);\n\treturn readHandshake();\n}\n\nbool SocketIOClient::connected() {\n\treturn client.connected();\n}\n\nvoid SocketIOClient::disconnect() {\n\tclient.stop();\n}\n\n\/\/ find the nth colon starting from dataptr\nvoid SocketIOClient::findColon(char which) {\t\n\twhile (*dataptr) {\n\t\tif (*dataptr == ':') {\n\t\t\tif (--which <= 0) return;\n\t\t}\n\t\t++dataptr;\n\t}\n}\n\n\/\/ terminate command at dataptr at closing double quote\nvoid SocketIOClient::terminateCommand(void) {\n\tdataptr[strlen(dataptr)-3] = 0;\n}\n\nvoid SocketIOClient::monitor() {\n\n\t*databuffer = 0;\n\n\tif (!client.connected()) {\n\t\tif (!client.connect(hostname, port)) return;\n\t}\n\n\tif (!client.available()) return;\n\n\tchar which;\n\twhile (client.available()) {\n\t\treadLine();\n\t\tdataptr = databuffer;\n\t\tswitch (databuffer[0]) {\t\n\n\t\tcase '1':\t\t\/\/ connect: []\n\t\t\twhich = 6;\n\t\t\tbreak;\n\n\t\tcase '2':\t\t\/\/ heartbeat: [2::]\n\t\t\tclient.print((char)0);\n\t\t\tclient.print(\"2::\");\n\t\t\tclient.print((char)255);\n\t\t\tcontinue;\n\n\t\tcase '5':\t\t\/\/ event: [5:::{\"name\":\"ls\"}]\n\t\t\twhich = 4;\n\t\t\tbreak;\n\n\t\tdefault: \n\t\t\tSerial.print(\"Drop \");\n\t\t\tSerial.println(dataptr);\n\t\t\tcontinue;\n\t\t}\n\n\t\tfindColon(which);\n\t\tdataptr += 2;\n\n\t\t\/\/ handle backslash-delimited escapes\n\t\tchar *optr = databuffer;\n\t\twhile (*dataptr && (*dataptr != '\"')) {\n\t\t\tif (*dataptr == '\\\\') {\n\t\t\t\t++dataptr;\t\t\/\/ todo: this just handles \"; handle \\r, \\n, \\t, \\xdd\n\t\t\t}\n\t\t\t*optr++ = *dataptr++;\n\t\t}\n\t\t*optr = 0;\n\n\t\tSerial.print(\"[\");\n\t\tSerial.print(databuffer);\n\t\tSerial.print(\"]\");\n\n\t\tif (dataArrivedDelegate != NULL) {\n\t\t\tdataArrivedDelegate(*this, databuffer);\n\t\t}\n\t}\n}\n\nvoid SocketIOClient::setDataArrivedDelegate(DataArrivedDelegate newdataArrivedDelegate) {\n\t dataArrivedDelegate = newdataArrivedDelegate;\n}\n\nvoid SocketIOClient::sendHandshake(char hostname[]) {\n\tclient.println(F(\"GET \/socket.io\/1\/ HTTP\/1.1\"));\n\tclient.print(F(\"Host: \"));\n\tclient.println(hostname);\n\tclient.println(F(\"Origin: Arduino\\r\\n\"));\n}\n\nbool SocketIOClient::waitForInput(void) {\nunsigned long now = millis();\n\twhile (!client.available() && ((millis() - now) < 30000UL)) {;}\n\treturn client.available();\n}\n\nvoid SocketIOClient::eatHeader(void) {\n\twhile (client.available()) {\t\/\/ consume the header\n\t\treadLine();\n\t\tif (strlen(databuffer) == 0) break;\n\t}\n}\n\nbool SocketIOClient::readHandshake() {\n\n\tif (!waitForInput()) return false;\n\n\t\/\/ check for happy \"HTTP\/1.1 200\" response\n\treadLine();\n\tif (atoi(&databuffer[9]) != 200) {\n\t\twhile (client.available()) readLine();\n\t\tclient.stop();\n\t\treturn false;\n\t}\n\teatHeader();\n\treadLine();\t\/\/ read first line of response\n\treadLine();\t\/\/ read sid : transport : timeout\n\n\tchar *iptr = databuffer;\n\tchar *optr = sid;\n\twhile (*iptr && (*iptr != ':') && (optr < &sid[SID_LEN-2])) *optr++ = *iptr++;\n\t*optr = 0;\n\n\tSerial.print(F(\"Connected. SID=\"));\n\tSerial.println(sid);\t\/\/ sid:transport:timeout \n\n\twhile (client.available()) readLine();\n\tclient.stop();\n\tdelay(1000);\n\n\t\/\/ reconnect on websocket connection\n\tSerial.print(F(\"WS Connect...\"));\n\tif (!client.connect(hostname, port)) {\n\t\tSerial.print(F(\"Reconnect failed.\"));\n\t\treturn false;\n\t}\n\tSerial.println(F(\"Reconnected.\"));\n\n\tclient.print(F(\"GET \/socket.io\/1\/websocket\/\"));\n\tclient.print(sid);\n\tclient.println(F(\" HTTP\/1.1\"));\n\tclient.print(F(\"Host: \"));\n\tclient.println(hostname);\n\tclient.println(F(\"Origin: ArduinoSocketIOClient\"));\n\tclient.println(F(\"Upgrade: WebSocket\"));\t\/\/ must be camelcase ?!\n\tclient.println(F(\"Connection: Upgrade\\r\\n\"));\n\n\tif (!waitForInput()) return false;\n\n\treadLine();\n\tif (atoi(&databuffer[9]) != 101) {\n\t\twhile (client.available()) readLine();\n\t\tclient.stop();\n\t\treturn false;\n\t}\n\teatHeader();\n\tmonitor();\t\t\/\/ treat the response as input\n\treturn true;\n}\n\nvoid SocketIOClient::readLine() {\n\tdataptr = databuffer;\n\twhile (client.available() && (dataptr < &databuffer[DATA_BUFFER_LEN-2])) {\n\t\tchar c = client.read();\n\t\t\/\/Serial.print(c);\n\t\tif (c == 0) Serial.print(F(\"NULL\"));\n\t\telse if (c == 255) Serial.print(F(\"0x255\"));\n\t\telse if (c == '\\r') {;}\n\t\telse if (c == '\\n') break;\n\t\telse *dataptr++ = c;\n\t}\n\t*dataptr = 0;\n}\n\nvoid SocketIOClient::send(char *data) {\n\tclient.print((char)0);\n\tclient.print(\"3:::\");\n\tclient.print(data);\n\tclient.print((char)255);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* GPS Coordinate Parser for Arduino\n * Developed for the Space Systems Laboratory at the University of Maryland\n * Part of the BPPCell library\n * See GitHub.com\/UMDBPP\/BPPCell or the accompanying readme for further details.\n *\n * Copyright (c) 2015 Luke Renegar\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n\n#include \"Arduino.h\"\n#include \"BPPCell.h\"\n\nGPSCoords::GPSCoords(String time, long lat, long lon, float alt) {\n\t_time = time;\n\t_lat = lat;\n\t_lon = lon;\n\t_alt = alt;\n}\n\nvoid GPSCoords::setTime(String time) {\n\t_time = time;\n}\n\nvoid GPSCoords::setLat(long lat) {\n\t_lat = lat;\n}\n\nvoid GPSCoords::setLon(long lon) {\n\t_lon = lon;\n}\n\nvoid GPSCoords::setAlt(float alt) {\n\t_alt = alt;\n}\n\nString GPSCoords::getTime() {\n\treturn _time;\n}\n\nlong GPSCoords::getLat() {\n\treturn _lat;\n}\n\nlong GPSCoords::getLon() {\n\treturn _lon;\n}\n\nfloat GPSCoords::getAlt() {\n\treturn _alt;\n}\n\nString GPSCoords::formatCoordsForText(int format) {\n\tString returnString = \"\";\n\tswitch (format) {\n\t\tcase FORMAT_DMS: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC\\n\");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isNorth) \n\t\t\t\treturnString += \"N\";\n\t\t\telse\n\t\t\t\treturnString += \"S\";\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.lonMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isEast) \n\t\t\t\treturnString += \"E\";\n\t\t\telse\n\t\t\t\treturnString += \"W\";\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += (String(\"Alt: \") + getAlt() + \"m MSL\\n\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FORMAT_DMS_ONELINE: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC\");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isNorth) \n\t\t\t\treturnString += \"N\";\n\t\t\telse\n\t\t\t\treturnString += \"S\";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.lonMins; \n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isEast) \n\t\t\t\treturnString += \"E\";\n\t\t\telse\n\t\t\t\treturnString += \"W\";\n\t\t\treturnString += (String(\"Alt: \") + getAlt() + \"m MSL\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FORMAT_DEC_DEGS: {\n\t\t\tDecDegsCoords coords = getLatLonInDecDegs();\n\t\t\tString decLatString = \"\";\n\t\t\tString decLonString = \"\";\n\t\t\tconst int lengthOfDecLatString = 9;\n\t\t\tconst int lengthOfDecLonString = 10;\n\t\t\tchar decLatStrArray[lengthOfDecLatString];\n\t\t\tchar decLonStrArray[lengthOfDecLonString];\n\t\t\tdtostrf(coords.lat,lengthOfDecLatString,6, decLatStrArray);\n\t\t\tdtostrf(coords.lon,lengthOfDecLonString,6, decLonStrArray);\n\t\t\tdecLatString += decLatStrArray;\n\t\t\tdecLonString += decLonStrArray;\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC \\n\");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += decLatString;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += decLonString;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Alt: \";\n\t\t\treturnString += getAlt();\n\t\t\treturnString += \"m MSL\\n\";\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcase FORMAT_DEC_DEGS_CSV: {\n\t\t\tDecDegsCoords coords = getLatLonInDecDegs();\n\t\t\tString decLatString = \"\";\n\t\t\tString decLonString = \"\";\n\t\t\tconst int lengthOfDecLatString = 9;\n\t\t\tconst int lengthOfDecLonString = 10;\n\t\t\tchar decLatStrArray[lengthOfDecLatString];\n\t\t\tchar decLonStrArray[lengthOfDecLonString];\n\t\t\tdtostrf(coords.lat,lengthOfDecLatString,6, decLatStrArray);\n\t\t\tdtostrf(coords.lon,lengthOfDecLonString,6, decLonStrArray);\n\t\t\tdecLatString += decLatStrArray;\n\t\t\tdecLonString += decLonStrArray;\n\t\t\treturnString += (getFormattedTimeString() + \",\");\n\t\t\treturnString += decLatString;\n\t\t\treturnString += \",\";\n\t\t\treturnString += decLonString;\n\t\t\treturnString += \",\";\n\t\t\treturnString += getAlt();\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcase FORMAT_DMS_CSV: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\tif(!coords.isNorth) \n\t\t\t\treturnString += \"-\";\n\t\t\treturnString += getFormattedTimeString();\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \",\";\n\n\t\t\tif(!coords.isEast) \n\t\t\t\treturnString += \"-\";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.lonMins;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \",\";\n\n\t\t\treturnString += (getAlt());\n\t\t\tbreak;\n\t\t}\n\t}\n\t\/\/ Uncomment the line below to enable debug output\n\t\/\/Serial3.println(returnString);\n\treturn returnString;\n}\n\n\n\/* Updates the DMSArray to the current coordinate values in degrees, minutes, and seconds\n * DMSArray has six fields. In order: lat degs, lat mins, lat secs, lon degs, lon mins, lon secs\n *\/\nDMSCoords GPSCoords::getLatLonInDMS(void) {\n\tDMSCoords coords;\n\tlong localLat = abs(_lat);\n\tlong localLon = abs(_lon);\n\t\n\tint latDegs = (int) (localLat\/(MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE));\n\tlocalLat = localLat % (MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latDegs = latDegs;\n\tint lonDegs = (int) (localLon\/(MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE));\n\tlocalLon = localLon % (MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonDegs = lonDegs;\n\t\n\tint latMins = (int) (localLat\/TEN_THOUSANDTHS_PER_MINUTE);\n\tlocalLat = localLat % (TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latMins = latMins;\n\tint lonMins = (int) (localLon\/TEN_THOUSANDTHS_PER_MINUTE);\n\tlocalLon = localLon % (TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonMins = lonMins;\n\t\n\tfloat latSecs = ((float) (localLat*SECONDS_PER_MINUTE)\/TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latSecs = latSecs;\n\tfloat lonSecs = ((float) (localLon*SECONDS_PER_MINUTE)\/TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonSecs = lonSecs;\n\tif(_lat >= 0)\n\t\tcoords.isNorth = true;\n\telse\n\t\tcoords.isNorth = false;\n\t\n\tif(_lon >= 0)\n\t\tcoords.isEast = true;\n\telse\n\t\tcoords.isEast = false;\n\t\n\t\n\t\n\treturn coords;\n}\n\n\/* Gets the latitude and longitude in decimal degrees.\n * WARNING: The Arduino is limited to 8-bit precision when working with floating point numbers. This may result in a loss of precision in the coordinates.\n * Input is an array of floating point numbers containing at least two elements. The method will not function properly if the input array does not have at least two elements.\n * Method populates the first and second elements of the input array with the latitude and longitude, respectively, of the coordinates.\n *\/\nDecDegsCoords GPSCoords::getLatLonInDecDegs(void) {\n\tDecDegsCoords coords;\n\tfloat decLat = _lat\/((float) MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tfloat decLon = _lon\/((float) MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lat = decLat;\n\tcoords.lon = decLon;\n\treturn coords;\n}\n\nString GPSCoords::getFormattedTimeString() {\n\tString returnString = \"\";\n\treturnString += (_time.substring(0, 2) + \":\" + _time.substring(2,4) + \":\" + _time.substring(4));\n\treturn returnString;\t\n}\n<commit_msg>Fixed Spacing on GPS Display Text<commit_after>\/* GPS Coordinate Parser for Arduino\n * Developed for the Space Systems Laboratory at the University of Maryland\n * Part of the BPPCell library\n * See GitHub.com\/UMDBPP\/BPPCell or the accompanying readme for further details.\n *\n * Copyright (c) 2015 Luke Renegar\n * \n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n\n#include \"Arduino.h\"\n#include \"BPPCell.h\"\n\nGPSCoords::GPSCoords(String time, long lat, long lon, float alt) {\n\t_time = time;\n\t_lat = lat;\n\t_lon = lon;\n\t_alt = alt;\n}\n\nvoid GPSCoords::setTime(String time) {\n\t_time = time;\n}\n\nvoid GPSCoords::setLat(long lat) {\n\t_lat = lat;\n}\n\nvoid GPSCoords::setLon(long lon) {\n\t_lon = lon;\n}\n\nvoid GPSCoords::setAlt(float alt) {\n\t_alt = alt;\n}\n\nString GPSCoords::getTime() {\n\treturn _time;\n}\n\nlong GPSCoords::getLat() {\n\treturn _lat;\n}\n\nlong GPSCoords::getLon() {\n\treturn _lon;\n}\n\nfloat GPSCoords::getAlt() {\n\treturn _alt;\n}\n\nString GPSCoords::formatCoordsForText(int format) {\n\tString returnString = \"\";\n\tswitch (format) {\n\t\tcase FORMAT_DMS: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC\\n\");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isNorth) \n\t\t\t\treturnString += \"N \";\n\t\t\telse\n\t\t\t\treturnString += \"S \";\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.lonMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isEast) \n\t\t\t\treturnString += \"E \";\n\t\t\telse\n\t\t\t\treturnString += \"W \";\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += (String(\"Alt: \") + getAlt() + \"m MSL\\n\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FORMAT_DMS_ONELINE: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC \");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isNorth) \n\t\t\t\treturnString += \"N \";\n\t\t\telse\n\t\t\t\treturnString += \"S \";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \" \";\n\t\t\treturnString += coords.lonMins; \n\t\t\treturnString += \"' \";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \"\\\" \";\n\t\t\tif(coords.isEast) \n\t\t\t\treturnString += \"E \";\n\t\t\telse\n\t\t\t\treturnString += \"W \";\n\t\t\treturnString += (String(\"Alt: \") + getAlt() + \"m MSL\");\n\t\t\tbreak;\n\t\t}\n\t\tcase FORMAT_DEC_DEGS: {\n\t\t\tDecDegsCoords coords = getLatLonInDecDegs();\n\t\t\tString decLatString = \"\";\n\t\t\tString decLonString = \"\";\n\t\t\tconst int lengthOfDecLatString = 9;\n\t\t\tconst int lengthOfDecLonString = 10;\n\t\t\tchar decLatStrArray[lengthOfDecLatString];\n\t\t\tchar decLonStrArray[lengthOfDecLonString];\n\t\t\tdtostrf(coords.lat,lengthOfDecLatString,6, decLatStrArray);\n\t\t\tdtostrf(coords.lon,lengthOfDecLonString,6, decLonStrArray);\n\t\t\tdecLatString += decLatStrArray;\n\t\t\tdecLonString += decLonStrArray;\n\t\t\treturnString += (\"Time: \" + getFormattedTimeString() + \" UTC \\n\");\n\t\t\treturnString += \"Lat: \";\n\t\t\treturnString += decLatString;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Lon: \";\n\t\t\treturnString += decLonString;\n\t\t\treturnString += char(0xB0);\n\t\t\treturnString += \"\\n\";\n\t\t\treturnString += \"Alt: \";\n\t\t\treturnString += getAlt();\n\t\t\treturnString += \"m MSL\\n\";\n\t\t\tDEBUG_SERIAL.println(returnString);\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcase FORMAT_DEC_DEGS_CSV: {\n\t\t\tDecDegsCoords coords = getLatLonInDecDegs();\n\t\t\tString decLatString = \"\";\n\t\t\tString decLonString = \"\";\n\t\t\tconst int lengthOfDecLatString = 9;\n\t\t\tconst int lengthOfDecLonString = 10;\n\t\t\tchar decLatStrArray[lengthOfDecLatString];\n\t\t\tchar decLonStrArray[lengthOfDecLonString];\n\t\t\tdtostrf(coords.lat,lengthOfDecLatString,6, decLatStrArray);\n\t\t\tdtostrf(coords.lon,lengthOfDecLonString,6, decLonStrArray);\n\t\t\tdecLatString += decLatStrArray;\n\t\t\tdecLonString += decLonStrArray;\n\t\t\treturnString += (getFormattedTimeString() + \",\");\n\t\t\treturnString += decLatString;\n\t\t\treturnString += \",\";\n\t\t\treturnString += decLonString;\n\t\t\treturnString += \",\";\n\t\t\treturnString += getAlt();\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tcase FORMAT_DMS_CSV: {\n\t\t\tDMSCoords coords = getLatLonInDMS();\n\t\t\tif(!coords.isNorth) \n\t\t\t\treturnString += \"-\";\n\t\t\treturnString += getFormattedTimeString();\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latDegs;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latMins;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.latSecs;\n\t\t\treturnString += \",\";\n\n\t\t\tif(!coords.isEast) \n\t\t\t\treturnString += \"-\";\n\t\t\treturnString += coords.lonDegs;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.lonMins;\n\t\t\treturnString += \",\";\n\t\t\treturnString += coords.lonSecs;\n\t\t\treturnString += \",\";\n\n\t\t\treturnString += (getAlt());\n\t\t\tbreak;\n\t\t}\n\t}\n\t\/\/ Uncomment the line below to enable debug output\n\t\/\/Serial3.println(returnString);\n\treturn returnString;\n}\n\n\n\/* Updates the DMSArray to the current coordinate values in degrees, minutes, and seconds\n * DMSArray has six fields. In order: lat degs, lat mins, lat secs, lon degs, lon mins, lon secs\n *\/\nDMSCoords GPSCoords::getLatLonInDMS(void) {\n\tDMSCoords coords;\n\tlong localLat = abs(_lat);\n\tlong localLon = abs(_lon);\n\t\n\tint latDegs = (int) (localLat\/(MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE));\n\tlocalLat = localLat % (MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latDegs = latDegs;\n\tint lonDegs = (int) (localLon\/(MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE));\n\tlocalLon = localLon % (MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonDegs = lonDegs;\n\t\n\tint latMins = (int) (localLat\/TEN_THOUSANDTHS_PER_MINUTE);\n\tlocalLat = localLat % (TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latMins = latMins;\n\tint lonMins = (int) (localLon\/TEN_THOUSANDTHS_PER_MINUTE);\n\tlocalLon = localLon % (TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonMins = lonMins;\n\t\n\tfloat latSecs = ((float) (localLat*SECONDS_PER_MINUTE)\/TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.latSecs = latSecs;\n\tfloat lonSecs = ((float) (localLon*SECONDS_PER_MINUTE)\/TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lonSecs = lonSecs;\n\tif(_lat >= 0)\n\t\tcoords.isNorth = true;\n\telse\n\t\tcoords.isNorth = false;\n\t\n\tif(_lon >= 0)\n\t\tcoords.isEast = true;\n\telse\n\t\tcoords.isEast = false;\n\t\n\t\n\t\n\treturn coords;\n}\n\n\/* Gets the latitude and longitude in decimal degrees.\n * WARNING: The Arduino is limited to 8-bit precision when working with floating point numbers. This may result in a loss of precision in the coordinates.\n * Input is an array of floating point numbers containing at least two elements. The method will not function properly if the input array does not have at least two elements.\n * Method populates the first and second elements of the input array with the latitude and longitude, respectively, of the coordinates.\n *\/\nDecDegsCoords GPSCoords::getLatLonInDecDegs(void) {\n\tDecDegsCoords coords;\n\tfloat decLat = _lat\/((float) MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tfloat decLon = _lon\/((float) MINUTES_PER_DEGREE*TEN_THOUSANDTHS_PER_MINUTE);\n\tcoords.lat = decLat;\n\tcoords.lon = decLon;\n\treturn coords;\n}\n\nString GPSCoords::getFormattedTimeString() {\n\tString returnString = \"\";\n\treturnString += (_time.substring(0, 2) + \":\" + _time.substring(2,4) + \":\" + _time.substring(4));\n\treturn returnString;\t\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * VapourSynth D2V Plugin\n *\n * Copyright (c) 2012 Derek Buitenhuis\n *\n * This file is part of d2vsource.\n *\n * d2vsource is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * d2vsource is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with d2vsource; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n\nextern \"C\" {\n#include <libavformat\/avformat.h>\n#include <libavcodec\/avcodec.h>\n#include <stdio.h>\n}\n\n#include \"compat.hpp\"\n#include \"d2v.hpp\"\n#include \"decode.hpp\"\n#include \"gop.hpp\"\n\nusing namespace std;\n\n\/*\n * AVIO seek function to handle GOP offsets and multi-file support\n * in libavformat without it knowing about it.\n *\/\nstatic int64_t file_seek(void *opaque, int64_t offset, int whence)\n{\n decodecontext *ctx = (decodecontext *) opaque;\n\n switch(whence) {\n case SEEK_SET: {\n \/*\n * This mutli-file seek is likely very broken, but I don't\n * really care much, since it is only used in avformat_find_stream_info,\n * which does its job fine as-is.\n *\/\n int64_t real_offset = offset + ctx->orig_file_offset;\n unsigned int i;\n\n for(i = ctx->orig_file; i < ctx->cur_file; i++)\n real_offset -= ctx->file_sizes[i];\n\n while(real_offset > ctx->file_sizes[ctx->cur_file] && ctx->cur_file != ctx->files.size() - 1) {\n real_offset -= ctx->file_sizes[ctx->cur_file];\n ctx->cur_file++;\n }\n\n while(real_offset < 0 && ctx->cur_file) {\n ctx->cur_file--;\n real_offset += ctx->file_sizes[ctx->cur_file];\n }\n\n fseeko(ctx->files[ctx->cur_file], real_offset, SEEK_SET);\n\n return offset;\n }\n case AVSEEK_SIZE: {\n \/*\n * Return the total filesize of all files combined,\n * adjusted for GOP offset.\n *\/\n int64_t size = -(ctx->orig_file_offset);\n unsigned int i;\n\n for(i = ctx->orig_file; i < ctx->file_sizes.size(); i++)\n size += ctx->file_sizes[i];\n\n return size;\n }\n default:\n \/* Shouldn't need to support anything else for our use case. *\/\n cout << \"Unsupported seek!\" << endl;\n return -1;\n }\n}\n\n\/*\n * AVIO packet reading function to handle GOP offsets and multi-file support\n * in libavformat without it knowing about it.\n *\/\nstatic int read_packet(void *opaque, uint8_t *buf, int size)\n{\n decodecontext *ctx = (decodecontext *) opaque;\n int ret;\n\n \/*\n * If we read in less than we got asked for, and we're\n * not on the last file, then start reading seamlessly\n * on the next file.\n *\/\n ret = fread(buf, 1, size, ctx->files[ctx->cur_file]);\n if (ret < size && ctx->cur_file != ctx->files.size() - 1) {\n ctx->cur_file++;\n fseeko(ctx->files[ctx->cur_file], 0, SEEK_SET);\n fread(buf + ret, 1, size - ret, ctx->files[ctx->cur_file]);\n } else {\n return ret;\n }\n\n return size;\n}\n\n\/* Conditionally free all memebers of decodecontext. *\/\nvoid decodefreep(decodecontext **ctx)\n{\n decodecontext *lctx = *ctx;\n unsigned int i;\n\n if (!lctx)\n return;\n\n av_freep(&lctx->in);\n av_free_packet(&lctx->inpkt);\n\n if (lctx->fctx) {\n if (lctx->fctx->pb)\n av_freep(&lctx->fctx->pb);\n\n avformat_close_input(&lctx->fctx);\n }\n\n for(i = 0; i < lctx->files.size(); i++)\n fclose(lctx->files[i]);\n\n lctx->files.clear();\n lctx->file_sizes.clear();\n\n if (lctx->avctx) {\n avcodec_close(lctx->avctx);\n av_freep(&lctx->avctx);\n }\n\n delete lctx->fakename;\n delete lctx;\n\n *ctx = NULL;\n}\n\n\/* Initialize everything we can with regards to decoding *\/\ndecodecontext *decodeinit(d2vcontext *dctx, string& err)\n{\n decodecontext *ret;\n int i, av_ret;\n\n ret = new decodecontext;\n\n \/* Zero the context to aid in conditional freeing later. *\/\n memset(ret, 0, sizeof(*ret));\n\n \/* Holds our \"filename\" we pass to libavformat. *\/\n ret->fakename = new string;\n\n \/* Set our stream index to -1 (uninitialized). *\/\n ret->stream_index = -1;\n\n \/* Open each file and stash its size. *\/\n for(i = 0; i < dctx->num_files; i++) {\n FILE *in;\n int64_t size;\n\n in = fopen(dctx->files[i].c_str(), \"rb\");\n if (!in) {\n err = \"Cannot open file: \";\n err += dctx->files[i];\n goto fail;\n }\n\n fseeko(in, 0, SEEK_END);\n size = ftello(in);\n fseeko(in, 0, SEEK_SET);\n\n ret->file_sizes.push_back(size);\n ret->files.push_back(in);\n }\n\n \/*\n * Register all of our demuxers, parsers, and decoders.\n * Ideally, to create a smaller binary, we only enable the\n * following:\n *\n * Demuxers: mpegvideo, mpegps, mpegts.\n * Parsers: mpegvideo, mpegaudio.\n * Decoders: mpeg1video, mpeg2video.\n *\/\n avcodec_register_all();\n av_register_all();\n\n \/* Set the correct decoder. *\/\n if (dctx->mpeg_type == 1) {\n ret->incodec = avcodec_find_decoder(AV_CODEC_ID_MPEG1VIDEO);\n } else if (dctx->mpeg_type == 2) {\n ret->incodec = avcodec_find_decoder(AV_CODEC_ID_MPEG2VIDEO);\n } else {\n err = \"Invalid MPEG Type.\";\n goto fail;\n }\n\n \/* Allocate the codec's context. *\/\n ret->avctx = avcodec_alloc_context3(ret->incodec);\n if (!ret->avctx) {\n err = \"Cannot allocate AVCodecContext.\";\n goto fail;\n }\n\n \/* Set the IDCT algorithm. *\/\n ret->avctx->idct_algo = dctx->idct_algo;\n\n \/*\n * Enable EMU_EDGE so that we can use buffers that are\n * not padded by 32 pixels.\n *\/\n ret->avctx->flags |= CODEC_FLAG_EMU_EDGE;\n\n \/* Open it. *\/\n av_ret = avcodec_open2(ret->avctx, ret->incodec, NULL);\n if (av_ret < 0) {\n err = \"Cannot open decoder.\";\n goto fail;\n }\n\n \/* Allocate the scratch buffer for our custom AVIO context. *\/\n ret->in = (uint8_t *) av_malloc(32 * 1024);\n if (!ret->in) {\n err = \"Cannot alloc inbuf.\";\n goto fail;\n }\n\n \/* We don't want to hear all the info it has. *\/\n av_log_set_level(AV_LOG_PANIC);\n\n return ret;\n\nfail:\n decodefreep(&ret);\n return NULL;\n}\n\nint decodeframe(int frame_num, d2vcontext *ctx, decodecontext *dctx, AVFrame *out, string& err)\n{\n frame f;\n gop g;\n unsigned int i;\n int o, j, av_ret, offset;\n bool next;\n\n \/* Get our frame and the GOP its in. *\/\n f = ctx->frames[frame_num];\n g = ctx->gops[f.gop];\n\n \/*\n * The offset is how many frames we have to decode from our\n * current position in order to get to the frame we want.\n * The initial offset is obtaiend during the parsing of the\n * D2V file, but it may be more in an open GOP situation,\n * which we handle below.\n *\/\n offset = f.offset;\n\n \/*\n * If we're in a open GOP situation, then start decoding\n * from the previous GOP (one at most is needed), and adjust\n * out offset accordingly.\n *\/\n if (!(g.info & GOP_FLAG_CLOSED) && (f.gop - 1 > 0)) {\n int n = frame_num;\n frame t = ctx->frames[n];\n\n g = ctx->gops[f.gop - 1];\n\n \/*\n * Find the offset of the last frame in the\n * previous GOP and add it to our offset.\n *\/\n while(t.offset)\n t = ctx->frames[--n];\n\n t = ctx->frames[--n];\n\n \/*\n * Subtract one from the offset to compensate for\n * libavcodec delay, I think.\n *\/\n offset += t.offset - 1;\n }\n\n \/*\n * Check if we're decoding linearly, and if the GOP\n * of the current frame and previous frame are either\n * the same, or also linear. If so, we can decode\n * linearly.\n *\/\n next = (dctx->last_gop == f.gop || dctx->last_gop == f.gop - 1) && dctx->last_frame == frame_num - 1;\n\n \/* Skip GOP initialization if we're decoding linearly. *\/\n if (!next) {\n \/* Free out format and AVIO contexts from the previous seek. *\/\n if (dctx->fctx) {\n if (dctx->fctx->pb)\n av_freep(&dctx->fctx->pb);\n\n avformat_close_input(&dctx->fctx);\n }\n\n \/* Seek to our GOP offset and stash the info. *\/\n fseeko(dctx->files[g.file], g.pos, SEEK_SET);\n dctx->orig_file_offset = g.pos;\n dctx->orig_file = g.file;\n dctx->cur_file = g.file;\n\n \/* Allocate format context. *\/\n dctx->fctx = avformat_alloc_context();\n if (!dctx->fctx) {\n err = \"Cannot allocate AVFormatContext.\";\n goto dfail;\n }\n\n \/*\n * Find the demuxer for our input type, and also set\n * the \"filename\" that we pass to libavformat when\n * we open the demuxer with our custom AVIO context.\n *\/\n if (ctx->stream_type == ELEMENTARY) {\n dctx->fctx->iformat = av_find_input_format(\"mpegvideo\");\n *dctx->fakename = \"fakevideo.m2v\";\n } else if (ctx->stream_type == PROGRAM) {\n dctx->fctx->iformat = av_find_input_format(\"mpeg\");\n *dctx->fakename = \"fakevideo.vob\";\n } else if (ctx->stream_type == TRANSPORT) {\n dctx->fctx->iformat = av_find_input_format(\"mpegts\");\n *dctx->fakename = \"fakevideo.ts\";\n } else {\n err = \"Unsupported format.\";\n goto dfail;\n }\n\n \/*\n * Initialize out custom AVIO context that libavformat\n * will use instead of a file. It uses our custom packet\n * reading and seeking functions that transparently work\n * with our indexed GOP offsets and multiple files.\n *\/\n dctx->fctx->pb = avio_alloc_context(dctx->in, 32 * 1024, 0, dctx, read_packet, NULL, file_seek);\n\n \/* Open the demuxer. *\/\n av_ret = avformat_open_input(&dctx->fctx, (*dctx->fakename).c_str(), NULL, NULL);\n if (av_ret < 0) {\n err = \"Cannot open buffer in libavformat.\";\n goto dfail;\n }\n\n \/*\n * Flush the buffers of our codec's context so we\n * don't need to re-initialize it.\n *\/\n avcodec_flush_buffers(dctx->avctx);\n\n \/*\n * Call the abomination function to find out\n * how many streams we have.\n *\/\n avformat_find_stream_info(dctx->fctx, NULL);\n\n \/* Free and re-initialize any existing packet. *\/\n av_free_packet(&dctx->inpkt);\n av_init_packet(&dctx->inpkt);\n }\n\n \/*\n * Set our stream index if we need to.\n * Set it to the stream that matches our MPEG-TS PID if applicable.\n *\/\n if (dctx->stream_index == -1) {\n if (ctx->ts_pid) {\n for(i = 0; i < dctx->fctx->nb_streams; i++)\n if (dctx->fctx->streams[i]->id == ctx->ts_pid)\n break;\n } else {\n for(i = 0; i < dctx->fctx->nb_streams; i++)\n if (dctx->fctx->streams[i]->codec->codec_type == AVMEDIA_TYPE_VIDEO)\n break;\n }\n\n if (i >= dctx->fctx->nb_streams) {\n if (ctx->ts_pid)\n err = \"PID does not exist in source file.\";\n else\n err = \"No video stream found.\";\n\n goto dfail;\n }\n\n dctx->stream_index = (int) i;\n }\n\n \/*\n * We don't need to read a new packet in if we are decoding\n * linearly, since it's still there from the previous iteration.\n *\/\n if (!next)\n av_read_frame(dctx->fctx, &dctx->inpkt);\n\n \/* If we're decoding linearly, there is obviously no offset. *\/\n o = next ? 0 : offset;\n for(j = 0; j <= o; j++) {\n while(dctx->inpkt.stream_index != dctx->stream_index) {\n av_free_packet(&dctx->inpkt);\n av_read_frame(dctx->fctx, &dctx->inpkt);\n }\n\n \/*\n * Loop until we have a whole frame, since there can be\n * multi-packet frames.\n *\/\n av_ret = 0;\n while(!av_ret) {\n AVPacket orig = dctx->inpkt;\n\n \/*\n * Decoding might not consume out whole packet, so\n * stash the original packet info, loop until it\n * is all consumed, and then restore it, it so\n * we can free it properly.\n *\/\n while(dctx->inpkt.size > 0) {\n int r = avcodec_decode_video2(dctx->avctx, out, &av_ret, &dctx->inpkt);\n\n dctx->inpkt.size -= r;\n dctx->inpkt.data += r;\n }\n\n dctx->inpkt = orig;\n\n do {\n av_free_packet(&dctx->inpkt);\n av_read_frame(dctx->fctx, &dctx->inpkt);\n } while(dctx->inpkt.stream_index != dctx->stream_index);\n }\n }\n\n \/*\n * Stash the frame number we just decoded, and the GOP it\n * is a part of so we can check if we're decoding linearly\n * later on.\n *\/\n dctx->last_gop = f.gop;\n dctx->last_frame = frame_num;\n\n return 0;\n\ndfail:\n avformat_close_input(&dctx->fctx);\n return -1;\n}\n<commit_msg>Fix unused return value warning<commit_after>\/*\n * VapourSynth D2V Plugin\n *\n * Copyright (c) 2012 Derek Buitenhuis\n *\n * This file is part of d2vsource.\n *\n * d2vsource is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * d2vsource is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with d2vsource; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include <iostream>\n#include <string>\n#include <vector>\n\nextern \"C\" {\n#include <libavformat\/avformat.h>\n#include <libavcodec\/avcodec.h>\n#include <stdio.h>\n}\n\n#include \"compat.hpp\"\n#include \"d2v.hpp\"\n#include \"decode.hpp\"\n#include \"gop.hpp\"\n\nusing namespace std;\n\n\/*\n * AVIO seek function to handle GOP offsets and multi-file support\n * in libavformat without it knowing about it.\n *\/\nstatic int64_t file_seek(void *opaque, int64_t offset, int whence)\n{\n decodecontext *ctx = (decodecontext *) opaque;\n\n switch(whence) {\n case SEEK_SET: {\n \/*\n * This mutli-file seek is likely very broken, but I don't\n * really care much, since it is only used in avformat_find_stream_info,\n * which does its job fine as-is.\n *\/\n int64_t real_offset = offset + ctx->orig_file_offset;\n unsigned int i;\n\n for(i = ctx->orig_file; i < ctx->cur_file; i++)\n real_offset -= ctx->file_sizes[i];\n\n while(real_offset > ctx->file_sizes[ctx->cur_file] && ctx->cur_file != ctx->files.size() - 1) {\n real_offset -= ctx->file_sizes[ctx->cur_file];\n ctx->cur_file++;\n }\n\n while(real_offset < 0 && ctx->cur_file) {\n ctx->cur_file--;\n real_offset += ctx->file_sizes[ctx->cur_file];\n }\n\n fseeko(ctx->files[ctx->cur_file], real_offset, SEEK_SET);\n\n return offset;\n }\n case AVSEEK_SIZE: {\n \/*\n * Return the total filesize of all files combined,\n * adjusted for GOP offset.\n *\/\n int64_t size = -(ctx->orig_file_offset);\n unsigned int i;\n\n for(i = ctx->orig_file; i < ctx->file_sizes.size(); i++)\n size += ctx->file_sizes[i];\n\n return size;\n }\n default:\n \/* Shouldn't need to support anything else for our use case. *\/\n cout << \"Unsupported seek!\" << endl;\n return -1;\n }\n}\n\n\/*\n * AVIO packet reading function to handle GOP offsets and multi-file support\n * in libavformat without it knowing about it.\n *\/\nstatic int read_packet(void *opaque, uint8_t *buf, int size)\n{\n decodecontext *ctx = (decodecontext *) opaque;\n int ret;\n\n \/*\n * If we read in less than we got asked for, and we're\n * not on the last file, then start reading seamlessly\n * on the next file.\n *\/\n ret = fread(buf, 1, size, ctx->files[ctx->cur_file]);\n if (ret < size && ctx->cur_file != ctx->files.size() - 1) {\n ctx->cur_file++;\n fseeko(ctx->files[ctx->cur_file], 0, SEEK_SET);\n ret += fread(buf + ret, 1, size - ret, ctx->files[ctx->cur_file]);\n }\n\n return ret;\n}\n\n\/* Conditionally free all memebers of decodecontext. *\/\nvoid decodefreep(decodecontext **ctx)\n{\n decodecontext *lctx = *ctx;\n unsigned int i;\n\n if (!lctx)\n return;\n\n av_freep(&lctx->in);\n av_free_packet(&lctx->inpkt);\n\n if (lctx->fctx) {\n if (lctx->fctx->pb)\n av_freep(&lctx->fctx->pb);\n\n avformat_close_input(&lctx->fctx);\n }\n\n for(i = 0; i < lctx->files.size(); i++)\n fclose(lctx->files[i]);\n\n lctx->files.clear();\n lctx->file_sizes.clear();\n\n if (lctx->avctx) {\n avcodec_close(lctx->avctx);\n av_freep(&lctx->avctx);\n }\n\n delete lctx->fakename;\n delete lctx;\n\n *ctx = NULL;\n}\n\n\/* Initialize everything we can with regards to decoding *\/\ndecodecontext *decodeinit(d2vcontext *dctx, string& err)\n{\n decodecontext *ret;\n int i, av_ret;\n\n ret = new decodecontext;\n\n \/* Zero the context to aid in conditional freeing later. *\/\n memset(ret, 0, sizeof(*ret));\n\n \/* Holds our \"filename\" we pass to libavformat. *\/\n ret->fakename = new string;\n\n \/* Set our stream index to -1 (uninitialized). *\/\n ret->stream_index = -1;\n\n \/* Open each file and stash its size. *\/\n for(i = 0; i < dctx->num_files; i++) {\n FILE *in;\n int64_t size;\n\n in = fopen(dctx->files[i].c_str(), \"rb\");\n if (!in) {\n err = \"Cannot open file: \";\n err += dctx->files[i];\n goto fail;\n }\n\n fseeko(in, 0, SEEK_END);\n size = ftello(in);\n fseeko(in, 0, SEEK_SET);\n\n ret->file_sizes.push_back(size);\n ret->files.push_back(in);\n }\n\n \/*\n * Register all of our demuxers, parsers, and decoders.\n * Ideally, to create a smaller binary, we only enable the\n * following:\n *\n * Demuxers: mpegvideo, mpegps, mpegts.\n * Parsers: mpegvideo, mpegaudio.\n * Decoders: mpeg1video, mpeg2video.\n *\/\n avcodec_register_all();\n av_register_all();\n\n \/* Set the correct decoder. *\/\n if (dctx->mpeg_type == 1) {\n ret->incodec = avcodec_find_decoder(AV_CODEC_ID_MPEG1VIDEO);\n } else if (dctx->mpeg_type == 2) {\n ret->incodec = avcodec_find_decoder(AV_CODEC_ID_MPEG2VIDEO);\n } else {\n err = \"Invalid MPEG Type.\";\n goto fail;\n }\n\n \/* Allocate the codec's context. *\/\n ret->avctx = avcodec_alloc_context3(ret->incodec);\n if (!ret->avctx) {\n err = \"Cannot allocate AVCodecContext.\";\n goto fail;\n }\n\n \/* Set the IDCT algorithm. *\/\n ret->avctx->idct_algo = dctx->idct_algo;\n\n \/*\n * Enable EMU_EDGE so that we can use buffers that are\n * not padded by 32 pixels.\n *\/\n ret->avctx->flags |= CODEC_FLAG_EMU_EDGE;\n\n \/* Open it. *\/\n av_ret = avcodec_open2(ret->avctx, ret->incodec, NULL);\n if (av_ret < 0) {\n err = \"Cannot open decoder.\";\n goto fail;\n }\n\n \/* Allocate the scratch buffer for our custom AVIO context. *\/\n ret->in = (uint8_t *) av_malloc(32 * 1024);\n if (!ret->in) {\n err = \"Cannot alloc inbuf.\";\n goto fail;\n }\n\n \/* We don't want to hear all the info it has. *\/\n av_log_set_level(AV_LOG_PANIC);\n\n return ret;\n\nfail:\n decodefreep(&ret);\n return NULL;\n}\n\nint decodeframe(int frame_num, d2vcontext *ctx, decodecontext *dctx, AVFrame *out, string& err)\n{\n frame f;\n gop g;\n unsigned int i;\n int o, j, av_ret, offset;\n bool next;\n\n \/* Get our frame and the GOP its in. *\/\n f = ctx->frames[frame_num];\n g = ctx->gops[f.gop];\n\n \/*\n * The offset is how many frames we have to decode from our\n * current position in order to get to the frame we want.\n * The initial offset is obtaiend during the parsing of the\n * D2V file, but it may be more in an open GOP situation,\n * which we handle below.\n *\/\n offset = f.offset;\n\n \/*\n * If we're in a open GOP situation, then start decoding\n * from the previous GOP (one at most is needed), and adjust\n * out offset accordingly.\n *\/\n if (!(g.info & GOP_FLAG_CLOSED) && (f.gop - 1 > 0)) {\n int n = frame_num;\n frame t = ctx->frames[n];\n\n g = ctx->gops[f.gop - 1];\n\n \/*\n * Find the offset of the last frame in the\n * previous GOP and add it to our offset.\n *\/\n while(t.offset)\n t = ctx->frames[--n];\n\n t = ctx->frames[--n];\n\n \/*\n * Subtract one from the offset to compensate for\n * libavcodec delay, I think.\n *\/\n offset += t.offset - 1;\n }\n\n \/*\n * Check if we're decoding linearly, and if the GOP\n * of the current frame and previous frame are either\n * the same, or also linear. If so, we can decode\n * linearly.\n *\/\n next = (dctx->last_gop == f.gop || dctx->last_gop == f.gop - 1) && dctx->last_frame == frame_num - 1;\n\n \/* Skip GOP initialization if we're decoding linearly. *\/\n if (!next) {\n \/* Free out format and AVIO contexts from the previous seek. *\/\n if (dctx->fctx) {\n if (dctx->fctx->pb)\n av_freep(&dctx->fctx->pb);\n\n avformat_close_input(&dctx->fctx);\n }\n\n \/* Seek to our GOP offset and stash the info. *\/\n fseeko(dctx->files[g.file], g.pos, SEEK_SET);\n dctx->orig_file_offset = g.pos;\n dctx->orig_file = g.file;\n dctx->cur_file = g.file;\n\n \/* Allocate format context. *\/\n dctx->fctx = avformat_alloc_context();\n if (!dctx->fctx) {\n err = \"Cannot allocate AVFormatContext.\";\n goto dfail;\n }\n\n \/*\n * Find the demuxer for our input type, and also set\n * the \"filename\" that we pass to libavformat when\n * we open the demuxer with our custom AVIO context.\n *\/\n if (ctx->stream_type == ELEMENTARY) {\n dctx->fctx->iformat = av_find_input_format(\"mpegvideo\");\n *dctx->fakename = \"fakevideo.m2v\";\n } else if (ctx->stream_type == PROGRAM) {\n dctx->fctx->iformat = av_find_input_format(\"mpeg\");\n *dctx->fakename = \"fakevideo.vob\";\n } else if (ctx->stream_type == TRANSPORT) {\n dctx->fctx->iformat = av_find_input_format(\"mpegts\");\n *dctx->fakename = \"fakevideo.ts\";\n } else {\n err = \"Unsupported format.\";\n goto dfail;\n }\n\n \/*\n * Initialize out custom AVIO context that libavformat\n * will use instead of a file. It uses our custom packet\n * reading and seeking functions that transparently work\n * with our indexed GOP offsets and multiple files.\n *\/\n dctx->fctx->pb = avio_alloc_context(dctx->in, 32 * 1024, 0, dctx, read_packet, NULL, file_seek);\n\n \/* Open the demuxer. *\/\n av_ret = avformat_open_input(&dctx->fctx, (*dctx->fakename).c_str(), NULL, NULL);\n if (av_ret < 0) {\n err = \"Cannot open buffer in libavformat.\";\n goto dfail;\n }\n\n \/*\n * Flush the buffers of our codec's context so we\n * don't need to re-initialize it.\n *\/\n avcodec_flush_buffers(dctx->avctx);\n\n \/*\n * Call the abomination function to find out\n * how many streams we have.\n *\/\n avformat_find_stream_info(dctx->fctx, NULL);\n\n \/* Free and re-initialize any existing packet. *\/\n av_free_packet(&dctx->inpkt);\n av_init_packet(&dctx->inpkt);\n }\n\n \/*\n * Set our stream index if we need to.\n * Set it to the stream that matches our MPEG-TS PID if applicable.\n *\/\n if (dctx->stream_index == -1) {\n if (ctx->ts_pid) {\n for(i = 0; i < dctx->fctx->nb_streams; i++)\n if (dctx->fctx->streams[i]->id == ctx->ts_pid)\n break;\n } else {\n for(i = 0; i < dctx->fctx->nb_streams; i++)\n if (dctx->fctx->streams[i]->codec->codec_type == AVMEDIA_TYPE_VIDEO)\n break;\n }\n\n if (i >= dctx->fctx->nb_streams) {\n if (ctx->ts_pid)\n err = \"PID does not exist in source file.\";\n else\n err = \"No video stream found.\";\n\n goto dfail;\n }\n\n dctx->stream_index = (int) i;\n }\n\n \/*\n * We don't need to read a new packet in if we are decoding\n * linearly, since it's still there from the previous iteration.\n *\/\n if (!next)\n av_read_frame(dctx->fctx, &dctx->inpkt);\n\n \/* If we're decoding linearly, there is obviously no offset. *\/\n o = next ? 0 : offset;\n for(j = 0; j <= o; j++) {\n while(dctx->inpkt.stream_index != dctx->stream_index) {\n av_free_packet(&dctx->inpkt);\n av_read_frame(dctx->fctx, &dctx->inpkt);\n }\n\n \/*\n * Loop until we have a whole frame, since there can be\n * multi-packet frames.\n *\/\n av_ret = 0;\n while(!av_ret) {\n AVPacket orig = dctx->inpkt;\n\n \/*\n * Decoding might not consume out whole packet, so\n * stash the original packet info, loop until it\n * is all consumed, and then restore it, it so\n * we can free it properly.\n *\/\n while(dctx->inpkt.size > 0) {\n int r = avcodec_decode_video2(dctx->avctx, out, &av_ret, &dctx->inpkt);\n\n dctx->inpkt.size -= r;\n dctx->inpkt.data += r;\n }\n\n dctx->inpkt = orig;\n\n do {\n av_free_packet(&dctx->inpkt);\n av_read_frame(dctx->fctx, &dctx->inpkt);\n } while(dctx->inpkt.stream_index != dctx->stream_index);\n }\n }\n\n \/*\n * Stash the frame number we just decoded, and the GOP it\n * is a part of so we can check if we're decoding linearly\n * later on.\n *\/\n dctx->last_gop = f.gop;\n dctx->last_frame = frame_num;\n\n return 0;\n\ndfail:\n avformat_close_input(&dctx->fctx);\n return -1;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <boost\/foreach.hpp>\n#include \"search.hpp\"\n\nint main(int argc, char **argv)\n{\n\tgraph_t graph;\n\/*\n\tnodes_t edge0, edge1, edge2, edge3;\n\tedge0.push_back(1);\n\tedge1.push_back(0);\n\tedge1.push_back(2);\n\tedge2.push_back(1);\n\tedge2.push_back(3);\n\tedge3.push_back(2);\n\tgraph[0] = edge0;\n\tgraph[1] = edge1;\n\tgraph[2] = edge2;\n\tgraph[3] = edge3;\n*\/\n\tnodes_t edge0, edge1, edge2, edge3, edge4, edge5, edge6, edge7;\n\tedge1.push_back(2);\n\tedge1.push_back(3);\n\tedge2.push_back(1);\n\tedge2.push_back(4);\n\tedge3.push_back(1);\n\tedge3.push_back(6);\n\tedge4.push_back(2);\n\tedge4.push_back(5);\n\tedge4.push_back(6);\n\tedge5.push_back(4);\n\tedge6.push_back(3);\n\tedge6.push_back(4);\n\tedge6.push_back(7);\n\tedge7.push_back(6);\n\tgraph[0] = edge0;\n\tgraph[1] = edge1;\n\tgraph[2] = edge2;\n\tgraph[3] = edge3;\n\tgraph[4] = edge4;\n\tgraph[5] = edge5;\n\tgraph[6] = edge6;\n\tgraph[7] = edge7;\n\n\t\/\/ Den Weg von 1 nach 7 berechnen\n\tint start = 1;\n\tint goal = 5;\n\tint depth = 5;\n\tsearch *s = new search(graph);\n\tpath_t *path = s->shortest_path(start, goal, depth);\n\tif (!path) {\n\t\tstd::cout << \"Could not find shortest path.\" << std::endl;\n\t} else {\n\t\tstd::cout << \"The shortest path is: \";\n\t\tBOOST_FOREACH (int node, *path) {\n\t\t\tstd::cout << node;\n\t\t\tif (node != path->back()) {\n\t\t\t\tstd::cout << \" -> \";\n\t\t\t}\n\t\t}\n\t\tstd::cout << std::endl;\n\t}\n\n\treturn 0;\n}\n<commit_msg>Fixed memory leaks<commit_after>#include <iostream>\n#include <boost\/foreach.hpp>\n#include \"search.hpp\"\n\nint main(int argc, char **argv)\n{\n\tgraph_t graph;\n\/*\n\tnodes_t edge0, edge1, edge2, edge3;\n\tedge0.push_back(1);\n\tedge1.push_back(0);\n\tedge1.push_back(2);\n\tedge2.push_back(1);\n\tedge2.push_back(3);\n\tedge3.push_back(2);\n\tgraph[0] = edge0;\n\tgraph[1] = edge1;\n\tgraph[2] = edge2;\n\tgraph[3] = edge3;\n*\/\n\tnodes_t edge0, edge1, edge2, edge3, edge4, edge5, edge6, edge7;\n\tedge1.push_back(2);\n\tedge1.push_back(3);\n\tedge2.push_back(1);\n\tedge2.push_back(4);\n\tedge3.push_back(1);\n\tedge3.push_back(6);\n\tedge4.push_back(2);\n\tedge4.push_back(5);\n\tedge4.push_back(6);\n\tedge5.push_back(4);\n\tedge6.push_back(3);\n\tedge6.push_back(4);\n\tedge6.push_back(7);\n\tedge7.push_back(6);\n\tgraph[0] = edge0;\n\tgraph[1] = edge1;\n\tgraph[2] = edge2;\n\tgraph[3] = edge3;\n\tgraph[4] = edge4;\n\tgraph[5] = edge5;\n\tgraph[6] = edge6;\n\tgraph[7] = edge7;\n\n\t\/\/ Den Weg von 1 nach 7 berechnen\n\tint start = 1;\n\tint goal = 5;\n\tint depth = 5;\n\n\tsearch *s = new search(graph);\n\tpath_t *path = s->shortest_path(start, goal, depth);\n\tif (!path) {\n\t\tstd::cout << \"Could not find shortest path.\" << std::endl;\n\t} else {\n\t\tstd::cout << \"The shortest path is: \";\n\t\tBOOST_FOREACH (int node, *path) {\n\t\t\tstd::cout << node;\n\t\t\tif (node != path->back()) {\n\t\t\t\tstd::cout << \" -> \";\n\t\t\t}\n\t\t}\n\t\tstd::cout << std::endl;\n\t}\n\n\tdelete s;\n\tdelete path;\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/**\n@file Cmd\/Defs.hpp\n@brief Command definitions.\n\n@author Timothy Howard\n@copyright 2013-2014 Timothy Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef HORD_CMD_DEFS_HPP_\n#define HORD_CMD_DEFS_HPP_\n\n#include <Hord\/config.hpp>\n\n#include <duct\/cc_unique_ptr.hpp>\n#include <duct\/StateStore.hpp>\n\nnamespace Hord {\nnamespace Cmd {\n\n\/\/ Forward declarations\nstruct IDFields;\nstruct type_info;\nstruct type_info_table;\nclass Stage; \/\/ external\nenum class Type : uint32_t;\nenum class Flags : uint32_t;\nenum class StageType : uint8_t;\nenum class Status : unsigned;\n\n\/**\n\t@addtogroup cmd\n\t@{\n*\/\n\n\/**\n\t%ID.\n\n\t@note Value only takes up bits @c 0x3FFFFFFF.\n\tSee @c Cmd::IDFields.\n*\/\nusing ID = uint32_t;\n\n\/**\n\t%ID constants.\n*\/\nenum : Cmd::ID {\n\t\/**\n\t\tNull %ID.\n\t*\/\n\tNULL_ID = Cmd::ID{0u},\n\t\/**\n\t\tMaximum %ID value.\n\t*\/\n\tMAX_ID = Cmd::ID{0x3FFFFFFFu}\n};\n\n\/**\n\t%ID fields.\n\n\t@note @c flag_host is included in the canonical value for %ID\n\tspace separation.\n*\/\nstruct IDFields final {\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tBase %ID value.\n\t*\/\n\tCmd::ID base : 30;\n\n\t\/**\n\t\tWhether the command is being executed by the host.\n\t*\/\n\tbool flag_host : 1;\n\n\t\/**\n\t\tWhether the stage is an initiator for the command.\n\n\t\t@note This is enabled for the first result stage of a\n\t\tlocal command. It ensures there are no stray command\n\t\tinitiations, and assists when resolving %ID collisions.\n\t*\/\n\tbool flag_initiator : 1;\n\n\t\/**\n\t\tAssign fields.\n\n\t\t@param base @c base.\n\t\t@param flag_host @c flag_host.\n\t\t@param flag_initiator @c flag_initiator.\n\t*\/\n\tvoid\n\tassign(\n\t\tCmd::ID base,\n\t\tbool const flag_host,\n\t\tbool const flag_initiator\n\t) noexcept {\n\t\tthis->base = base;\n\t\tthis->flag_host = flag_host;\n\t\tthis->flag_initiator = flag_initiator;\n\t}\n\n\t\/**\n\t\tAssign.\n\n\t\t@param other Fields.\n\t*\/\n\tvoid\n\tassign(\n\t\tIDFields const& other\n\t) noexcept {\n\t\tthis->base = other.base;\n\t\tthis->flag_host = other.flag_host;\n\t\tthis->flag_initiator = other.flag_initiator;\n\t}\n\/\/\/ @}\n};\n\n\/**\n\tCommand type info.\n*\/\nstruct type_info final {\n\/** @name Types *\/ \/\/\/ @{\n\t\/** Flag store type. *\/\n\tusing flag_store_type = duct::StateStore<Cmd::Flags, unsigned>;\n\/\/\/ @}\n\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tCommand type.\n\t*\/\n\tCmd::Type const type;\n\n\t\/**\n\t\tCommand flags.\n\t*\/\n\tflag_store_type const flags;\n\/\/\/ @}\n\n\/** @name Operations *\/ \/\/\/ @{\n\t\/**\n\t\tConstruct stage by type.\n\n\t\t@throws Error{ErrorCode::cmd_construct_stage_type_invalid}\n\t\tIf @a type is not supplied by the command.\n\n\t\t@throws std::bad_alloc\n\t\tIf allocation fails.\n\n\t\t@returns Pointer to stage.\n\t\t@param type %Stage type.\n\t*\/\n\tCmd::Stage*\n\t(&construct_stage)(\n\t\tCmd::StageType const type\n\t);\n\/\/\/ @}\n};\n\n\/**\n\tCommand type info table.\n\n\tThe type range is <code>[begin, end)<\/code> such that @c end-begin\n\tis the number of types in the table in\n\t<strong>sequential order<\/strong>.\n\n\t@warning Terrors of abyss await you if the table is not\n\tsequential and\/or the range difference is negative.\n*\/\nstruct type_info_table final {\n\/** @name Properties *\/ \/\/\/ @{\n\t\/\/ NB: Goddammit, C++. Just let me assign an unbound array\n\t\/\/ reference to an array of any arity.\n\t\/** Type info array. *\/\n\tCmd::type_info const* const* const array;\n\n\t\/** First type in the array. *\/\n\tCmd::Type const range_begin;\n\n\t\/** One past the last type in the array. *\/\n\tCmd::Type const range_end;\n\n\t\/**\n\t\tGet size.\n\n\t\t@warning The result will overflow if the range is degenerate.\n\t*\/\n\tconstexpr std::size_t\n\tsize() const noexcept {\n\t\treturn\n\t\t\tstatic_cast<std::size_t>(range_end) -\n\t\t\tstatic_cast<std::size_t>(range_begin)\n\t\t;\n\t}\n\/\/\/ @}\n\n\/** @name Queries *\/ \/\/\/ @{\n\t\/**\n\t\tCheck if the table contains a type.\n\n\t\t@param type Command type.\n\t*\/\n\tconstexpr bool\n\tcontains(\n\t\tCmd::Type const type\n\t) const noexcept {\n\t\treturn\n\t\t\ttype >= range_begin &&\n\t\t\ttype < range_end\n\t\t;\n\t}\n\n\t\/**\n\t\tCheck if the type range intersects with another table.\n\n\t\t@param other Table to test against.\n\t*\/\n\tconstexpr bool\n\tintersects(\n\t\tCmd::type_info_table const& other\n\t) const noexcept {\n\t\treturn\n\t\t\/\/ end within other\n\t\t ((other.range_end > this->range_begin &&\n\t\t\t other.range_end <= this->range_end) ||\n\t\t\t(this->range_end > other.range_begin &&\n\t\t\t this->range_end <= other.range_end))\n\t\t\/\/ begin within other\n\t\t|| ((other.range_begin >= this->range_begin &&\n\t\t\t other.range_begin < this->range_end) ||\n\t\t\t(this->range_begin >= other.range_begin &&\n\t\t\t this->range_begin < other.range_end))\n\t\t;\n\t}\n\/\/\/ @}\n};\n\n\/**\n\tOwning pointer to command stage.\n*\/\nusing StageUPtr = duct::cc_unique_ptr<Cmd::Stage>;\n\n\/**\n\tCommand type.\n\n\t@remarks The range <code>[0x00, 0xFF]<\/code> is reserved for stage\n\ttypes. The range <code>[0x0100, 0xFFFF]<\/code> is reserved for \n\tstandard types. Userspace is permitted the range\n\t<code>[0x00010000, 0xFFFFFFFF]<\/code>.\n\n\t@sa Cmd::StageType\n*\/\nenum class Type : uint32_t {\n\/** @name Standard range *\/ \/\/\/ @{\n\t\/** Base standard type. *\/\n\tSTANDARD_BASE = 0x100,\n\t\/** Maximum standard type. *\/\n\tSTANDARD_LIMIT = 0xFFFF,\n\t\/** Number of standard types. *\/\n\tSTANDARD_COUNT = STANDARD_LIMIT - STANDARD_BASE,\n\/\/\/ @}\n\n\/** @name Userspace range *\/ \/\/\/ @{\n\t\/** Base userspace type. *\/\n\tUSERSPACE_BASE = 0x00010000,\n\t\/** Maximum userspace type. *\/\n\tUSERSPACE_LIMIT = 0xFFFFFFFF,\n\/\/\/ @}\n\n\/**\n\t@ref cmd_generic.\n\t@{\n*\/\n\tGenericTerminate = STANDARD_BASE,\n\/** @} *\/\n\n\/**\n\t@ref cmd_node.\n\t@{\n*\/\n\tNodeCreate,\n\t\/\/NodeDestroy,\n\/** @} *\/\n\n\/**\n\t@ref cmd_record.\n\t@{\n*\/\n\t\/\/RecordInsert,\n\t\/\/RecordDestroy,\n\/** @} *\/\n\n\/** @cond INTERNAL *\/\n\t\/\/ One-past-end\n\tSTANDARD_END,\n\tSTANDARD_COUNT_DEFINED = STANDARD_END - STANDARD_BASE\n\/** @endcond *\/\n};\n\n\/**\n\tCommand flags.\n*\/\nenum class Flags : uint32_t {\n\t\/**\n\t\tNo flags.\n\t*\/\n\tnone = 0,\n\n\t\/**\n\t\tCommand requires remote result to continue execution.\n\t*\/\n\tremote = 1 << 1,\n\n\t\/**\n\t\tCommand is revertible.\n\n\t\t@note A revision point will only be stored if the command\n\t\thas this flag.\n\t*\/\n\trevertible = 1 << 2\n};\n\n\/**\n\t%Stage type.\n\n\t@note The range of valid stage types is\n\t<code>[0x00, 0xFF]<\/code>, with <code>[0x00, 0x0F]<\/code> being\n\treserved for standard stage types.\n\n\t@remarks Most commands use only a subset of the standard stages.\n*\/\nenum class StageType : uint8_t {\n\/** @name Standard range *\/ \/\/\/ @{\n\t\/** Base standard type. *\/\n\tSTANDARD_BASE = 0x00,\n\t\/** Maximum standard type. *\/\n\tSTANDARD_LIMIT = 0x0F,\n\/\/\/ @}\n\n\/** @name Userspace range *\/ \/\/\/ @{\n\t\/** Base userspace type. *\/\n\tUSERSPACE_BASE = 0x10,\n\t\/** Maximum userspace type. *\/\n\tUSERSPACE_LIMIT = 0xFF,\n\/\/\/ @}\n\n\/** @name Standard types *\/ \/\/\/ @{\n\t\/**\n\t\tStatement stage.\n\n\t\t@remarks If a command uses this stage, it is typically the\n\t\tonly stage apart from the return stage.\n\t*\/\n\tStatement = STANDARD_BASE,\n\n\t\/**\n\t\tError stage.\n\t*\/\n\tError,\n\n\t\/**\n\t\tRequest stage.\n\t*\/\n\tRequest,\n\n\t\/**\n\t\tResponse stage.\n\t*\/\n\tResponse,\n\/\/\/ @}\n\n\/** @cond INTERNAL *\/\n\t\/\/ One-past-end\n\tSTANDARD_END,\n\tSTANDARD_COUNT_DEFINED = STANDARD_END - STANDARD_BASE\n\/** @endcond *\/\n};\n\n\/**\n\tCommand status.\n*\/\nenum class Status : unsigned {\n\t\/**\n\t\tCommand is waiting for a stage to return.\n\t*\/\n\twaiting = 1,\n\n\t\/**\n\t\tCommand has completed without explicit error.\n\n\t\t@note This will be the command status even if an Error stage\n\t\tis emitted.\n\t*\/\n\tcomplete,\n\n\t\/**\n\t\tCommand has terminated with an error.\n\n\t\t@note Commands which terminate with an error are immediately\n\t\tremoved from the active group and a @c GenericTerminate\n\t\tpseudo-stage is emitted to the remote endpoint.\n\n\t\t@par\n\t\t@note This is implicit if stage execution throws an exception.\n\t*\/\n\terror,\n\n\t\/**\n\t\tCommand has terminated because of a remote error.\n\t*\/\n\terror_remote\n};\n\n\/** @} *\/ \/\/ end of doc-group cmd\n\n} \/\/ namespace Cmd\n} \/\/ namespace Hord\n\n#endif \/\/ HORD_CMD_DEFS_HPP_\n<commit_msg>Cmd\/Defs: added static assertions to ensure standard type limit conformity.<commit_after>\/**\n@file Cmd\/Defs.hpp\n@brief Command definitions.\n\n@author Timothy Howard\n@copyright 2013-2014 Timothy Howard under the MIT license;\nsee @ref index or the accompanying LICENSE file for full text.\n*\/\n\n#ifndef HORD_CMD_DEFS_HPP_\n#define HORD_CMD_DEFS_HPP_\n\n#include <Hord\/config.hpp>\n#include <Hord\/utility.hpp>\n\n#include <duct\/cc_unique_ptr.hpp>\n#include <duct\/StateStore.hpp>\n\nnamespace Hord {\nnamespace Cmd {\n\n\/\/ Forward declarations\nstruct IDFields;\nstruct type_info;\nstruct type_info_table;\nclass Stage; \/\/ external\nenum class Type : uint32_t;\nenum class Flags : uint32_t;\nenum class StageType : uint8_t;\nenum class Status : unsigned;\n\n\/**\n\t@addtogroup cmd\n\t@{\n*\/\n\n\/**\n\t%ID.\n\n\t@note Value only takes up bits @c 0x3FFFFFFF.\n\tSee @c Cmd::IDFields.\n*\/\nusing ID = uint32_t;\n\n\/**\n\t%ID constants.\n*\/\nenum : Cmd::ID {\n\t\/**\n\t\tNull %ID.\n\t*\/\n\tNULL_ID = Cmd::ID{0u},\n\t\/**\n\t\tMaximum %ID value.\n\t*\/\n\tMAX_ID = Cmd::ID{0x3FFFFFFFu}\n};\n\n\/**\n\t%ID fields.\n\n\t@note @c flag_host is included in the canonical value for %ID\n\tspace separation.\n*\/\nstruct IDFields final {\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tBase %ID value.\n\t*\/\n\tCmd::ID base : 30;\n\n\t\/**\n\t\tWhether the command is being executed by the host.\n\t*\/\n\tbool flag_host : 1;\n\n\t\/**\n\t\tWhether the stage is an initiator for the command.\n\n\t\t@note This is enabled for the first result stage of a\n\t\tlocal command. It ensures there are no stray command\n\t\tinitiations, and assists when resolving %ID collisions.\n\t*\/\n\tbool flag_initiator : 1;\n\n\t\/**\n\t\tAssign fields.\n\n\t\t@param base @c base.\n\t\t@param flag_host @c flag_host.\n\t\t@param flag_initiator @c flag_initiator.\n\t*\/\n\tvoid\n\tassign(\n\t\tCmd::ID base,\n\t\tbool const flag_host,\n\t\tbool const flag_initiator\n\t) noexcept {\n\t\tthis->base = base;\n\t\tthis->flag_host = flag_host;\n\t\tthis->flag_initiator = flag_initiator;\n\t}\n\n\t\/**\n\t\tAssign.\n\n\t\t@param other Fields.\n\t*\/\n\tvoid\n\tassign(\n\t\tIDFields const& other\n\t) noexcept {\n\t\tthis->base = other.base;\n\t\tthis->flag_host = other.flag_host;\n\t\tthis->flag_initiator = other.flag_initiator;\n\t}\n\/\/\/ @}\n};\n\n\/**\n\tCommand type info.\n*\/\nstruct type_info final {\n\/** @name Types *\/ \/\/\/ @{\n\t\/** Flag store type. *\/\n\tusing flag_store_type = duct::StateStore<Cmd::Flags, unsigned>;\n\/\/\/ @}\n\n\/** @name Properties *\/ \/\/\/ @{\n\t\/**\n\t\tCommand type.\n\t*\/\n\tCmd::Type const type;\n\n\t\/**\n\t\tCommand flags.\n\t*\/\n\tflag_store_type const flags;\n\/\/\/ @}\n\n\/** @name Operations *\/ \/\/\/ @{\n\t\/**\n\t\tConstruct stage by type.\n\n\t\t@throws Error{ErrorCode::cmd_construct_stage_type_invalid}\n\t\tIf @a type is not supplied by the command.\n\n\t\t@throws std::bad_alloc\n\t\tIf allocation fails.\n\n\t\t@returns Pointer to stage.\n\t\t@param type %Stage type.\n\t*\/\n\tCmd::Stage*\n\t(&construct_stage)(\n\t\tCmd::StageType const type\n\t);\n\/\/\/ @}\n};\n\n\/**\n\tCommand type info table.\n\n\tThe type range is <code>[begin, end)<\/code> such that @c end-begin\n\tis the number of types in the table in\n\t<strong>sequential order<\/strong>.\n\n\t@warning Terrors of abyss await you if the table is not\n\tsequential and\/or the range difference is negative.\n*\/\nstruct type_info_table final {\n\/** @name Properties *\/ \/\/\/ @{\n\t\/\/ NB: Goddammit, C++. Just let me assign an unbound array\n\t\/\/ reference to an array of any arity.\n\t\/** Type info array. *\/\n\tCmd::type_info const* const* const array;\n\n\t\/** First type in the array. *\/\n\tCmd::Type const range_begin;\n\n\t\/** One past the last type in the array. *\/\n\tCmd::Type const range_end;\n\n\t\/**\n\t\tGet size.\n\n\t\t@warning The result will overflow if the range is degenerate.\n\t*\/\n\tconstexpr std::size_t\n\tsize() const noexcept {\n\t\treturn\n\t\t\tstatic_cast<std::size_t>(range_end) -\n\t\t\tstatic_cast<std::size_t>(range_begin)\n\t\t;\n\t}\n\/\/\/ @}\n\n\/** @name Queries *\/ \/\/\/ @{\n\t\/**\n\t\tCheck if the table contains a type.\n\n\t\t@param type Command type.\n\t*\/\n\tconstexpr bool\n\tcontains(\n\t\tCmd::Type const type\n\t) const noexcept {\n\t\treturn\n\t\t\ttype >= range_begin &&\n\t\t\ttype < range_end\n\t\t;\n\t}\n\n\t\/**\n\t\tCheck if the type range intersects with another table.\n\n\t\t@param other Table to test against.\n\t*\/\n\tconstexpr bool\n\tintersects(\n\t\tCmd::type_info_table const& other\n\t) const noexcept {\n\t\treturn\n\t\t\/\/ end within other\n\t\t ((other.range_end > this->range_begin &&\n\t\t\t other.range_end <= this->range_end) ||\n\t\t\t(this->range_end > other.range_begin &&\n\t\t\t this->range_end <= other.range_end))\n\t\t\/\/ begin within other\n\t\t|| ((other.range_begin >= this->range_begin &&\n\t\t\t other.range_begin < this->range_end) ||\n\t\t\t(this->range_begin >= other.range_begin &&\n\t\t\t this->range_begin < other.range_end))\n\t\t;\n\t}\n\/\/\/ @}\n};\n\n\/**\n\tOwning pointer to command stage.\n*\/\nusing StageUPtr = duct::cc_unique_ptr<Cmd::Stage>;\n\n\/**\n\tCommand type.\n\n\t@remarks The range <code>[0x00, 0xFF]<\/code> is reserved for stage\n\ttypes. The range <code>[0x0100, 0xFFFF]<\/code> is reserved for \n\tstandard types. Userspace is permitted the range\n\t<code>[0x00010000, 0xFFFFFFFF]<\/code>.\n\n\t@sa Cmd::StageType\n*\/\nenum class Type : uint32_t {\n\/** @name Standard range *\/ \/\/\/ @{\n\t\/** Base standard type. *\/\n\tSTANDARD_BASE = 0x100,\n\t\/** Maximum standard type. *\/\n\tSTANDARD_LIMIT = 0xFFFF,\n\t\/** Number of standard types. *\/\n\tSTANDARD_COUNT = STANDARD_LIMIT - STANDARD_BASE,\n\/\/\/ @}\n\n\/** @name Userspace range *\/ \/\/\/ @{\n\t\/** Base userspace type. *\/\n\tUSERSPACE_BASE = 0x00010000,\n\t\/** Maximum userspace type. *\/\n\tUSERSPACE_LIMIT = 0xFFFFFFFF,\n\/\/\/ @}\n\n\/**\n\t@ref cmd_generic.\n\t@{\n*\/\n\tGenericTerminate = STANDARD_BASE,\n\/** @} *\/\n\n\/**\n\t@ref cmd_node.\n\t@{\n*\/\n\tNodeCreate,\n\t\/\/NodeDestroy,\n\/** @} *\/\n\n\/**\n\t@ref cmd_record.\n\t@{\n*\/\n\t\/\/RecordInsert,\n\t\/\/RecordDestroy,\n\/** @} *\/\n\n\/** @cond INTERNAL *\/\n\t\/\/ One-past-end\n\tSTANDARD_END,\n\tSTANDARD_COUNT_DEFINED = STANDARD_END - STANDARD_BASE\n\/** @endcond *\/\n};\n\n\/** @cond INTERNAL *\/\nstatic_assert(\n\tenum_cast(Cmd::Type::STANDARD_LIMIT) >=\n\tenum_cast(Cmd::Type::STANDARD_END) - 1,\n\t\"standard command types exceed the limit for standard types\"\n);\n\/** @endcond *\/\n\n\/**\n\tCommand flags.\n*\/\nenum class Flags : uint32_t {\n\t\/**\n\t\tNo flags.\n\t*\/\n\tnone = 0,\n\n\t\/**\n\t\tCommand requires remote result to continue execution.\n\t*\/\n\tremote = 1 << 1,\n\n\t\/**\n\t\tCommand is revertible.\n\n\t\t@note A revision point will only be stored if the command\n\t\thas this flag.\n\t*\/\n\trevertible = 1 << 2\n};\n\n\/**\n\t%Stage type.\n\n\t@note The range of valid stage types is\n\t<code>[0x00, 0xFF]<\/code>, with <code>[0x00, 0x0F]<\/code> being\n\treserved for standard stage types.\n\n\t@remarks Most commands use only a subset of the standard stages.\n*\/\nenum class StageType : uint8_t {\n\/** @name Standard range *\/ \/\/\/ @{\n\t\/** Base standard type. *\/\n\tSTANDARD_BASE = 0x00,\n\t\/** Maximum standard type. *\/\n\tSTANDARD_LIMIT = 0x0F,\n\/\/\/ @}\n\n\/** @name Userspace range *\/ \/\/\/ @{\n\t\/** Base userspace type. *\/\n\tUSERSPACE_BASE = 0x10,\n\t\/** Maximum userspace type. *\/\n\tUSERSPACE_LIMIT = 0xFF,\n\/\/\/ @}\n\n\/** @name Standard types *\/ \/\/\/ @{\n\t\/**\n\t\tStatement stage.\n\n\t\t@remarks If a command uses this stage, it is typically the\n\t\tonly stage apart from the return stage.\n\t*\/\n\tStatement = STANDARD_BASE,\n\n\t\/**\n\t\tError stage.\n\t*\/\n\tError,\n\n\t\/**\n\t\tRequest stage.\n\t*\/\n\tRequest,\n\n\t\/**\n\t\tResponse stage.\n\t*\/\n\tResponse,\n\/\/\/ @}\n\n\/** @cond INTERNAL *\/\n\t\/\/ One-past-end\n\tSTANDARD_END,\n\tSTANDARD_COUNT_DEFINED = STANDARD_END - STANDARD_BASE\n\/** @endcond *\/\n};\n\n\/** @cond INTERNAL *\/\nstatic_assert(\n\tenum_cast(Cmd::StageType::STANDARD_LIMIT) >=\n\tenum_cast(Cmd::StageType::STANDARD_END) - 1,\n\t\"standard stage types exceed the limit for standard types\"\n);\n\/** @endcond *\/\n\n\/**\n\tCommand status.\n*\/\nenum class Status : unsigned {\n\t\/**\n\t\tCommand is waiting for a stage to return.\n\t*\/\n\twaiting = 1,\n\n\t\/**\n\t\tCommand has completed without explicit error.\n\n\t\t@note This will be the command status even if an Error stage\n\t\tis emitted.\n\t*\/\n\tcomplete,\n\n\t\/**\n\t\tCommand has terminated with an error.\n\n\t\t@note Commands which terminate with an error are immediately\n\t\tremoved from the active group and a @c GenericTerminate\n\t\tpseudo-stage is emitted to the remote endpoint.\n\n\t\t@par\n\t\t@note This is implicit if stage execution throws an exception.\n\t*\/\n\terror,\n\n\t\/**\n\t\tCommand has terminated because of a remote error.\n\t*\/\n\terror_remote\n};\n\n\/** @} *\/ \/\/ end of doc-group cmd\n\n} \/\/ namespace Cmd\n} \/\/ namespace Hord\n\n#endif \/\/ HORD_CMD_DEFS_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"..\/client\/gles2_lib.h\"\n#include \"..\/common\/thread_local.h\"\n\nnamespace gles2 {\nnamespace {\ngpu::ThreadLocalKey g_gl_context_key;\n} \/\/ namespace anonymous\n\nvoid Initialize() {\n g_gl_context_key = gpu::ThreadLocalAlloc();\n}\n\nvoid Terminate() {\n gpu::ThreadLocalFree(g_gl_context_key);\n g_gl_context_key = 0;\n}\n\ngpu::gles2::GLES2Implementation* GetGLContext() {\n return static_cast<gpu::gles2::GLES2Implementation*>(\n gpu::ThreadLocalGetValue(g_gl_context_key));\n}\n\nvoid SetGLContext(gpu::gles2::GLES2Implementation* context) {\n gpu::ThreadLocalSetValue(g_gl_context_key, context);\n}\n} \/\/ namespace gles2\n\n\n\n\n<commit_msg>Work around bug in gcc's name mangling causing linker to crash on Mac OS X.<commit_after>\/\/ Copyright (c) 2009 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"..\/client\/gles2_lib.h\"\n#include \"..\/common\/thread_local.h\"\n\nnamespace gles2 {\n\/\/ TODO(kbr): the use of this anonymous namespace core dumps the\n\/\/ linker on Mac OS X 10.6 when the symbol ordering file is used\n\/\/ namespace {\nstatic gpu::ThreadLocalKey g_gl_context_key;\n\/\/ } \/\/ namespace anonymous\n\nvoid Initialize() {\n g_gl_context_key = gpu::ThreadLocalAlloc();\n}\n\nvoid Terminate() {\n gpu::ThreadLocalFree(g_gl_context_key);\n g_gl_context_key = 0;\n}\n\ngpu::gles2::GLES2Implementation* GetGLContext() {\n return static_cast<gpu::gles2::GLES2Implementation*>(\n gpu::ThreadLocalGetValue(g_gl_context_key));\n}\n\nvoid SetGLContext(gpu::gles2::GLES2Implementation* context) {\n gpu::ThreadLocalSetValue(g_gl_context_key, context);\n}\n} \/\/ namespace gles2\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/micro\/kernels\/fully_connected.h\"\n\n#include \"tensorflow\/lite\/c\/builtin_op_data.h\"\n#include \"tensorflow\/lite\/c\/common.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/common.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/quantization_util.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/fully_connected.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/integer_ops\/fully_connected.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/tensor_ctypes.h\"\n#include \"tensorflow\/lite\/kernels\/kernel_util.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/kernel_util.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/xtensa\/fixedpoint_utils.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/xtensa\/xtensa.h\"\n\nnamespace tflite {\nnamespace {\n\n#if defined(HIFIMINI)\nvoid FullyConnected(const FullyConnectedParams& params,\n const RuntimeShape& input_shape, const int8_t* input_data,\n const RuntimeShape& filter_shape, const int8_t* filter_data,\n const RuntimeShape& bias_shape, const int32_t* bias_data,\n const RuntimeShape& output_shape, int8_t* output_data) {\n \/\/ TODO(b\/154032858): Investigate removing extra copies.\n const int32_t input_offset = params.input_offset;\n const int32_t filter_offset = params.weights_offset;\n const int32_t output_offset = params.output_offset;\n const int32_t output_multiplier = params.output_multiplier;\n const int output_shift = params.output_shift;\n const int32_t output_activation_min = params.quantized_activation_min;\n const int32_t output_activation_max = params.quantized_activation_max;\n\n const int filter_dim_count = filter_shape.DimensionsCount();\n const int batches = output_shape.Dims(0);\n const int output_depth = output_shape.Dims(1);\n const int accum_depth = filter_shape.Dims(filter_dim_count - 1);\n const int accum_depth_iters = accum_depth \/ 2;\n\n ae_p24x2s offsets_input_24x2 = AE_MOVPA24(input_offset);\n ae_p24x2s offsets_filter_24x2 = AE_MOVPA24(filter_offset);\n ae_q56s output_offset_56 = AE_CVTQ48A32S(output_offset);\n ae_q56s output_activation_max_56 = AE_CVTQ48A32S(output_activation_max);\n ae_q56s output_activation_min_56 = AE_CVTQ48A32S(output_activation_min);\n\n for (int b = 0; b < batches; ++b) {\n for (int out_c = 0; out_c < output_depth; ++out_c) {\n \/\/ Load intrinsics advance pointer before loading so backoff data pointers\n \/\/ by two before loading:\n const int8_t* input_ptr = (input_data + b * accum_depth) - 2;\n const int8_t* filter_ptr = (filter_data + out_c * accum_depth) - 2;\n\n \/\/ Main accumulator register entry for loop:\n ae_q56s sum_56 = AE_ZEROQ56();\n\n for (int d = 0; d < accum_depth_iters; d++) {\n \/\/ Load the signed 8bit values into the PR register:\n ae_p24x2s input_24x2;\n ae_p24x2s filter_24x2;\n AE_LP8X2F_IU(input_24x2, input_ptr, 2);\n AE_LP8X2F_IU(filter_24x2, filter_ptr, 2);\n\n \/\/ Right shift the signed 8bit values to expand to signed 24bit values:\n input_24x2 = AE_P24X2S_SRAI(input_24x2, 16);\n filter_24x2 = AE_P24X2S_SRAI(filter_24x2, 16);\n\n \/\/ Add offsets to data values (24 bit aligned):\n input_24x2 = AE_P24S_ADDS_P24X2S(offsets_input_24x2, input_24x2);\n filter_24x2 = AE_P24S_ADDS_P24X2S(offsets_filter_24x2, filter_24x2);\n\n \/\/ 24x2 signed integer dual MAC w\/ addition into 56bit accumulator (48\n \/\/ bit aligned):\n AE_MULAAP24S_HH_LL(sum_56, input_24x2, filter_24x2);\n }\n\n \/\/ Left shift to get back into 32bit space (right padded to 48bit):\n sum_56 = AE_Q56S_SLAI(sum_56, 16);\n\n \/\/ Add bias data if needed:\n if (bias_data) {\n ae_q56s bias_56 = AE_CVTQ48A32S(bias_data[out_c]);\n sum_56 = AE_ADDQ56(sum_56, bias_56);\n }\n\n \/\/ Shift left into 24bit space and place back on PR register:\n sum_56 = AE_Q56S_SLAI(sum_56, 8);\n ae_p24x2s sum_24x2 = AE_TRUNCP24Q48(sum_56);\n\n \/\/ MultiplyByQuantizedMultiplier returns a 48bit aligned value\n sum_56 = MultiplyByQuantizedMultiplier(sum_24x2, output_multiplier,\n output_shift);\n\n \/\/ Add output_offset and cap min\/max values:\n sum_56 = AE_ADDQ56(sum_56, output_offset_56);\n sum_56 = AE_MINQ56S(sum_56, output_activation_max_56);\n sum_56 = AE_MAXQ56S(sum_56, output_activation_min_56);\n\n output_data[out_c + output_depth * b] =\n static_cast<int8_t>(AE_TRUNCA32Q48(sum_56));\n }\n }\n}\n#endif\n\nTfLiteStatus CalculateOpData(TfLiteContext* context,\n TfLiteFusedActivation activation,\n TfLiteType data_type, const TfLiteTensor* input,\n const TfLiteTensor* filter,\n const TfLiteTensor* bias, TfLiteTensor* output,\n OpDataFullyConnected* data) {\n double real_multiplier = 0.0;\n TF_LITE_ENSURE_STATUS(GetQuantizedConvolutionMultipler(\n context, input, filter, bias, output, &real_multiplier));\n#if defined(HIFIMINI)\n QuantizeMultiplierForInt24(real_multiplier, &data->output_multiplier,\n &data->output_shift);\n#else\n QuantizeMultiplier(real_multiplier, &data->output_multiplier,\n &data->output_shift);\n#endif\n data->input_zero_point = input->params.zero_point;\n data->filter_zero_point = filter->params.zero_point;\n data->output_zero_point = output->params.zero_point;\n\n return CalculateActivationRangeQuantized(context, activation, output,\n &data->output_activation_min,\n &data->output_activation_max);\n}\n\nvoid* Init(TfLiteContext* context, const char* buffer, size_t length) {\n TFLITE_DCHECK(context->AllocatePersistentBuffer != nullptr);\n return context->AllocatePersistentBuffer(context,\n sizeof(OpDataFullyConnected));\n}\n\nTfLiteStatus Prepare(TfLiteContext* context, TfLiteNode* node) {\n TFLITE_DCHECK(node->user_data != nullptr);\n TFLITE_DCHECK(node->builtin_data != nullptr);\n\n auto* data = static_cast<OpDataFullyConnected*>(node->user_data);\n const auto* params =\n reinterpret_cast<TfLiteFullyConnectedParams*>(node->builtin_data);\n\n const TfLiteTensor* input =\n GetInput(context, node, kFullyConnectedInputTensor);\n const TfLiteTensor* filter =\n GetInput(context, node, kFullyConnectedWeightsTensor);\n const TfLiteTensor* bias =\n GetOptionalInputTensor(context, node, kFullyConnectedBiasTensor);\n TfLiteTensor* output = GetOutput(context, node, kFullyConnectedOutputTensor);\n\n if (input->type != kTfLiteInt8) {\n TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\n TfLiteTypeGetName(input->type), input->type);\n return kTfLiteError;\n }\n\n return CalculateOpData(context, params->activation, input->type, input,\n filter, bias, output, data);\n}\n\nTfLiteStatus EvalQuantizedInt8(TfLiteContext* context, TfLiteNode* node,\n const OpDataFullyConnected& data,\n const TfLiteEvalTensor* input,\n const TfLiteEvalTensor* filter,\n const TfLiteEvalTensor* bias,\n TfLiteEvalTensor* output) {\n \/\/ TODO(b\/154032858): Investigate removing extra copies (i.e.\n \/\/ data.ToQuantizedParams), and also passing by value.\n \/\/\n \/\/ TODO(b\/155656675): Consider passing OpDataFullyConnected by value\n \/\/ once it is also passed to the FullyConnected function. Until it is copied\n \/\/ to a local op_param variable, we do not get any latency improvements from\n \/\/ passing by value.\n#if defined(HIFIMINI)\n FullyConnected(FullyConnectedParamsQuantized(data),\n tflite::micro::GetTensorShape(input),\n tflite::micro::GetTensorData<int8_t>(input),\n tflite::micro::GetTensorShape(filter),\n tflite::micro::GetTensorData<int8_t>(filter),\n tflite::micro::GetTensorShape(bias),\n tflite::micro::GetTensorData<int32_t>(bias),\n tflite::micro::GetTensorShape(output),\n tflite::micro::GetTensorData<int8_t>(output));\n#elif defined(FUSION_F1)\n FullyConnectedParams op_params = FullyConnectedParamsQuantized(data);\n \/\/ Weights will always be symmetric quantized since we only support int\n \/\/ quantization.\n TFLITE_DCHECK(op_params.weights_offset == 0);\n\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\n const int num_batches = output_shape.Dims(0);\n const int output_depth = output_shape.Dims(1);\n\n const RuntimeShape& filter_shape = tflite::micro::GetTensorShape(filter);\n const int filter_dim_count = filter_shape.DimensionsCount();\n const int accum_depth = filter_shape.Dims(filter_dim_count - 1);\n\n for (int b = 0; b < num_batches; ++b) {\n TF_LITE_ENSURE_EQ(\n context,\n xa_nn_fully_connected_sym8sxasym8s_asym8s(\n (tflite::micro::GetTensorData<int8_t>(output) + b * output_depth),\n tflite::micro::GetTensorData<int8_t>(filter),\n (tflite::micro::GetTensorData<int8_t>(input) + b * accum_depth),\n tflite::micro::GetTensorData<int32_t>(bias), accum_depth,\n output_depth, op_params.input_offset, op_params.output_multiplier,\n op_params.output_shift, op_params.output_offset),\n 0);\n }\n\n int8_t* output_arr = tflite::micro::GetTensorData<int8_t>(output);\n TF_LITE_ENSURE_EQ(context,\n xa_nn_vec_activation_min_max_8_8(\n output_arr, output_arr, data.output_activation_min,\n data.output_activation_max, num_batches * output_depth),\n 0);\n return kTfLiteOk;\n#else\n reference_integer_ops::FullyConnected(\n FullyConnectedParamsQuantized(data), tflite::micro::GetTensorShape(input),\n tflite::micro::GetTensorData<int8_t>(input),\n tflite::micro::GetTensorShape(filter),\n tflite::micro::GetTensorData<int8_t>(filter),\n tflite::micro::GetTensorShape(bias),\n tflite::micro::GetTensorData<int32_t>(bias),\n tflite::micro::GetTensorShape(output),\n tflite::micro::GetTensorData<int8_t>(output));\n#endif\n\n return kTfLiteOk;\n}\n\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\n TFLITE_DCHECK(node->user_data != nullptr);\n const auto& data =\n *(static_cast<const OpDataFullyConnected*>(node->user_data));\n\n const TfLiteEvalTensor* input =\n tflite::micro::GetEvalInput(context, node, kFullyConnectedInputTensor);\n const TfLiteEvalTensor* filter =\n tflite::micro::GetEvalInput(context, node, kFullyConnectedWeightsTensor);\n const TfLiteEvalTensor* bias =\n (NumInputs(node) == 3) ? tflite::micro::GetEvalInput(\n context, node, kFullyConnectedBiasTensor)\n : nullptr;\n\n TfLiteEvalTensor* output =\n tflite::micro::GetEvalOutput(context, node, kFullyConnectedOutputTensor);\n\n return EvalQuantizedInt8(context, node, data, input, filter, bias, output);\n}\n\n} \/\/ namespace\n\nTfLiteRegistration Register_FULLY_CONNECTED() {\n return {\/*init=*\/Init,\n \/*free=*\/nullptr,\n \/*prepare=*\/Prepare,\n \/*invoke=*\/Eval,\n \/*profiling_string=*\/nullptr,\n \/*builtin_code=*\/0,\n \/*custom_name=*\/nullptr,\n \/*version=*\/0};\n}\n\n} \/\/ namespace tflite\n<commit_msg>address review comments.<commit_after>\/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/lite\/micro\/kernels\/fully_connected.h\"\n\n#include \"tensorflow\/lite\/c\/builtin_op_data.h\"\n#include \"tensorflow\/lite\/c\/common.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/common.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/quantization_util.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/fully_connected.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/integer_ops\/fully_connected.h\"\n#include \"tensorflow\/lite\/kernels\/internal\/tensor_ctypes.h\"\n#include \"tensorflow\/lite\/kernels\/kernel_util.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/kernel_util.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/xtensa\/fixedpoint_utils.h\"\n#include \"tensorflow\/lite\/micro\/kernels\/xtensa\/xtensa.h\"\n\nnamespace tflite {\nnamespace {\n\n#if defined(HIFIMINI)\nvoid FullyConnected(const FullyConnectedParams& params,\n const RuntimeShape& input_shape, const int8_t* input_data,\n const RuntimeShape& filter_shape, const int8_t* filter_data,\n const RuntimeShape& bias_shape, const int32_t* bias_data,\n const RuntimeShape& output_shape, int8_t* output_data) {\n \/\/ TODO(b\/154032858): Investigate removing extra copies.\n const int32_t input_offset = params.input_offset;\n const int32_t filter_offset = params.weights_offset;\n const int32_t output_offset = params.output_offset;\n const int32_t output_multiplier = params.output_multiplier;\n const int output_shift = params.output_shift;\n const int32_t output_activation_min = params.quantized_activation_min;\n const int32_t output_activation_max = params.quantized_activation_max;\n\n const int filter_dim_count = filter_shape.DimensionsCount();\n const int batches = output_shape.Dims(0);\n const int output_depth = output_shape.Dims(1);\n const int accum_depth = filter_shape.Dims(filter_dim_count - 1);\n const int accum_depth_iters = accum_depth \/ 2;\n\n ae_p24x2s offsets_input_24x2 = AE_MOVPA24(input_offset);\n ae_p24x2s offsets_filter_24x2 = AE_MOVPA24(filter_offset);\n ae_q56s output_offset_56 = AE_CVTQ48A32S(output_offset);\n ae_q56s output_activation_max_56 = AE_CVTQ48A32S(output_activation_max);\n ae_q56s output_activation_min_56 = AE_CVTQ48A32S(output_activation_min);\n\n for (int b = 0; b < batches; ++b) {\n for (int out_c = 0; out_c < output_depth; ++out_c) {\n \/\/ Load intrinsics advance pointer before loading so backoff data pointers\n \/\/ by two before loading:\n const int8_t* input_ptr = (input_data + b * accum_depth) - 2;\n const int8_t* filter_ptr = (filter_data + out_c * accum_depth) - 2;\n\n \/\/ Main accumulator register entry for loop:\n ae_q56s sum_56 = AE_ZEROQ56();\n\n for (int d = 0; d < accum_depth_iters; d++) {\n \/\/ Load the signed 8bit values into the PR register:\n ae_p24x2s input_24x2;\n ae_p24x2s filter_24x2;\n AE_LP8X2F_IU(input_24x2, input_ptr, 2);\n AE_LP8X2F_IU(filter_24x2, filter_ptr, 2);\n\n \/\/ Right shift the signed 8bit values to expand to signed 24bit values:\n input_24x2 = AE_P24X2S_SRAI(input_24x2, 16);\n filter_24x2 = AE_P24X2S_SRAI(filter_24x2, 16);\n\n \/\/ Add offsets to data values (24 bit aligned):\n input_24x2 = AE_P24S_ADDS_P24X2S(offsets_input_24x2, input_24x2);\n filter_24x2 = AE_P24S_ADDS_P24X2S(offsets_filter_24x2, filter_24x2);\n\n \/\/ 24x2 signed integer dual MAC w\/ addition into 56bit accumulator (48\n \/\/ bit aligned):\n AE_MULAAP24S_HH_LL(sum_56, input_24x2, filter_24x2);\n }\n\n \/\/ Left shift to get back into 32bit space (right padded to 48bit):\n sum_56 = AE_Q56S_SLAI(sum_56, 16);\n\n \/\/ Add bias data if needed:\n if (bias_data) {\n ae_q56s bias_56 = AE_CVTQ48A32S(bias_data[out_c]);\n sum_56 = AE_ADDQ56(sum_56, bias_56);\n }\n\n \/\/ Shift left into 24bit space and place back on PR register:\n sum_56 = AE_Q56S_SLAI(sum_56, 8);\n ae_p24x2s sum_24x2 = AE_TRUNCP24Q48(sum_56);\n\n \/\/ MultiplyByQuantizedMultiplier returns a 48bit aligned value\n sum_56 = MultiplyByQuantizedMultiplier(sum_24x2, output_multiplier,\n output_shift);\n\n \/\/ Add output_offset and cap min\/max values:\n sum_56 = AE_ADDQ56(sum_56, output_offset_56);\n sum_56 = AE_MINQ56S(sum_56, output_activation_max_56);\n sum_56 = AE_MAXQ56S(sum_56, output_activation_min_56);\n\n output_data[out_c + output_depth * b] =\n static_cast<int8_t>(AE_TRUNCA32Q48(sum_56));\n }\n }\n}\n#endif\n\nTfLiteStatus CalculateOpData(TfLiteContext* context,\n TfLiteFusedActivation activation,\n TfLiteType data_type, const TfLiteTensor* input,\n const TfLiteTensor* filter,\n const TfLiteTensor* bias, TfLiteTensor* output,\n OpDataFullyConnected* data) {\n double real_multiplier = 0.0;\n TF_LITE_ENSURE_STATUS(GetQuantizedConvolutionMultipler(\n context, input, filter, bias, output, &real_multiplier));\n#if defined(HIFIMINI)\n QuantizeMultiplierForInt24(real_multiplier, &data->output_multiplier,\n &data->output_shift);\n#else\n QuantizeMultiplier(real_multiplier, &data->output_multiplier,\n &data->output_shift);\n#endif\n data->input_zero_point = input->params.zero_point;\n data->filter_zero_point = filter->params.zero_point;\n data->output_zero_point = output->params.zero_point;\n\n return CalculateActivationRangeQuantized(context, activation, output,\n &data->output_activation_min,\n &data->output_activation_max);\n}\n\nvoid* Init(TfLiteContext* context, const char* buffer, size_t length) {\n TFLITE_DCHECK(context->AllocatePersistentBuffer != nullptr);\n return context->AllocatePersistentBuffer(context,\n sizeof(OpDataFullyConnected));\n}\n\nTfLiteStatus Prepare(TfLiteContext* context, TfLiteNode* node) {\n TFLITE_DCHECK(node->user_data != nullptr);\n TFLITE_DCHECK(node->builtin_data != nullptr);\n\n auto* data = static_cast<OpDataFullyConnected*>(node->user_data);\n const auto* params =\n reinterpret_cast<TfLiteFullyConnectedParams*>(node->builtin_data);\n\n const TfLiteTensor* input =\n GetInput(context, node, kFullyConnectedInputTensor);\n const TfLiteTensor* filter =\n GetInput(context, node, kFullyConnectedWeightsTensor);\n const TfLiteTensor* bias =\n GetOptionalInputTensor(context, node, kFullyConnectedBiasTensor);\n TfLiteTensor* output = GetOutput(context, node, kFullyConnectedOutputTensor);\n\n if (input->type != kTfLiteInt8) {\n TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\n TfLiteTypeGetName(input->type), input->type);\n return kTfLiteError;\n }\n\n \/\/ Filter weights will always be symmetric quantized since we only support\n \/\/ int8 quantization.\n TFLITE_DCHECK(filter->params.zero_point == 0);\n\n TFLITE_DCHECK(GetTensorShape(output).DimensionsCount() == 2);\n\n return CalculateOpData(context, params->activation, input->type, input,\n filter, bias, output, data);\n}\n\nTfLiteStatus EvalQuantizedInt8(TfLiteContext* context, TfLiteNode* node,\n const OpDataFullyConnected& data,\n const TfLiteEvalTensor* input,\n const TfLiteEvalTensor* filter,\n const TfLiteEvalTensor* bias,\n TfLiteEvalTensor* output) {\n \/\/ TODO(b\/154032858): Investigate removing extra copies (i.e.\n \/\/ data.ToQuantizedParams), and also passing by value.\n \/\/\n \/\/ TODO(b\/155656675): Consider passing OpDataFullyConnected by value\n \/\/ once it is also passed to the FullyConnected function. Until it is copied\n \/\/ to a local op_param variable, we do not get any latency improvements from\n \/\/ passing by value.\n#if defined(HIFIMINI)\n FullyConnected(FullyConnectedParamsQuantized(data),\n tflite::micro::GetTensorShape(input),\n tflite::micro::GetTensorData<int8_t>(input),\n tflite::micro::GetTensorShape(filter),\n tflite::micro::GetTensorData<int8_t>(filter),\n tflite::micro::GetTensorShape(bias),\n tflite::micro::GetTensorData<int32_t>(bias),\n tflite::micro::GetTensorShape(output),\n tflite::micro::GetTensorData<int8_t>(output));\n#elif defined(FUSION_F1)\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\n const int num_batches = output_shape.Dims(0);\n const int output_depth = output_shape.Dims(1);\n\n const RuntimeShape& filter_shape = tflite::micro::GetTensorShape(filter);\n const int filter_dim_count = filter_shape.DimensionsCount();\n const int accum_depth = filter_shape.Dims(filter_dim_count - 1);\n\n FullyConnectedParams op_params = FullyConnectedParamsQuantized(data);\n for (int b = 0; b < num_batches; ++b) {\n TF_LITE_ENSURE_EQ(\n context,\n xa_nn_fully_connected_sym8sxasym8s_asym8s(\n (tflite::micro::GetTensorData<int8_t>(output) + b * output_depth),\n tflite::micro::GetTensorData<int8_t>(filter),\n (tflite::micro::GetTensorData<int8_t>(input) + b * accum_depth),\n tflite::micro::GetTensorData<int32_t>(bias), accum_depth,\n output_depth, op_params.input_offset, op_params.output_multiplier,\n op_params.output_shift, op_params.output_offset),\n 0);\n }\n\n int8_t* output_arr = tflite::micro::GetTensorData<int8_t>(output);\n TF_LITE_ENSURE_EQ(context,\n xa_nn_vec_activation_min_max_8_8(\n output_arr, output_arr, data.output_activation_min,\n data.output_activation_max, num_batches * output_depth),\n 0);\n return kTfLiteOk;\n#else\n reference_integer_ops::FullyConnected(\n FullyConnectedParamsQuantized(data), tflite::micro::GetTensorShape(input),\n tflite::micro::GetTensorData<int8_t>(input),\n tflite::micro::GetTensorShape(filter),\n tflite::micro::GetTensorData<int8_t>(filter),\n tflite::micro::GetTensorShape(bias),\n tflite::micro::GetTensorData<int32_t>(bias),\n tflite::micro::GetTensorShape(output),\n tflite::micro::GetTensorData<int8_t>(output));\n#endif\n\n return kTfLiteOk;\n}\n\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\n TFLITE_DCHECK(node->user_data != nullptr);\n const auto& data =\n *(static_cast<const OpDataFullyConnected*>(node->user_data));\n\n const TfLiteEvalTensor* input =\n tflite::micro::GetEvalInput(context, node, kFullyConnectedInputTensor);\n const TfLiteEvalTensor* filter =\n tflite::micro::GetEvalInput(context, node, kFullyConnectedWeightsTensor);\n const TfLiteEvalTensor* bias =\n (NumInputs(node) == 3) ? tflite::micro::GetEvalInput(\n context, node, kFullyConnectedBiasTensor)\n : nullptr;\n\n TfLiteEvalTensor* output =\n tflite::micro::GetEvalOutput(context, node, kFullyConnectedOutputTensor);\n\n return EvalQuantizedInt8(context, node, data, input, filter, bias, output);\n}\n\n} \/\/ namespace\n\nTfLiteRegistration Register_FULLY_CONNECTED() {\n return {\/*init=*\/Init,\n \/*free=*\/nullptr,\n \/*prepare=*\/Prepare,\n \/*invoke=*\/Eval,\n \/*profiling_string=*\/nullptr,\n \/*builtin_code=*\/0,\n \/*custom_name=*\/nullptr,\n \/*version=*\/0};\n}\n\n} \/\/ namespace tflite\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright 2015 Cloudius Systems\n *\n * Modified by Cloudius Systems\n *\/\n\n#ifndef CQL3_CONSTANTS_HH\n#define CQL3_CONSTANTS_HH\n\n#include \"cql3\/abstract_marker.hh\"\n#include \"cql3\/update_parameters.hh\"\n#include \"cql3\/operation.hh\"\n#include \"cql3\/term.hh\"\n#include \"core\/shared_ptr.hh\"\n\nnamespace cql3 {\n\n#if 0\npackage org.apache.cassandra.cql3;\n\nimport java.nio.ByteBuffer;\n\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\nimport org.apache.cassandra.config.ColumnDefinition;\nimport org.apache.cassandra.db.*;\nimport org.apache.cassandra.db.composites.CellName;\nimport org.apache.cassandra.db.composites.Composite;\nimport org.apache.cassandra.db.marshal.AbstractType;\nimport org.apache.cassandra.db.marshal.BytesType;\nimport org.apache.cassandra.db.marshal.CounterColumnType;\nimport org.apache.cassandra.db.marshal.LongType;\nimport org.apache.cassandra.db.marshal.ReversedType;\nimport org.apache.cassandra.exceptions.InvalidRequestException;\nimport org.apache.cassandra.serializers.MarshalException;\nimport org.apache.cassandra.utils.ByteBufferUtil;\n#endif\n\n\/**\n * Static helper methods and classes for constants.\n *\/\nclass constants {\npublic:\n#if 0\n private static final Logger logger = LoggerFactory.getLogger(Constants.class);\n#endif\npublic:\n enum class type {\n STRING, INTEGER, UUID, FLOAT, BOOLEAN, HEX\n };\n\n \/**\n * A constant value, i.e. a ByteBuffer.\n *\/\n class value : public terminal {\n public:\n bytes_opt _bytes;\n value(bytes_opt bytes_) : _bytes(std::move(bytes_)) {}\n virtual bytes_opt get(const query_options& options) override { return _bytes; }\n virtual bytes_opt bind_and_get(const query_options& options) override { return _bytes; }\n virtual sstring to_string() const override { return to_hex(*_bytes); }\n };\n\n class null_literal final : public term::raw {\n private:\n class null_value final : public value {\n public:\n null_value() : value({}) {}\n virtual ::shared_ptr<terminal> bind(const query_options& options) override { return {}; }\n virtual sstring to_string() const override { return \"null\"; }\n };\n static const ::shared_ptr<terminal> NULL_VALUE;\n public:\n virtual ::shared_ptr<term> prepare(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver) override {\n if (!is_assignable(test_assignment(db, keyspace, receiver))) {\n throw exceptions::invalid_request_exception(\"Invalid null value for counter increment\/decrement\");\n }\n return NULL_VALUE;\n }\n\n virtual assignment_testable::test_result test_assignment(database& db,\n const sstring& keyspace,\n ::shared_ptr<column_specification> receiver) override {\n return receiver->type->is_counter()\n ? assignment_testable::test_result::NOT_ASSIGNABLE\n : assignment_testable::test_result::WEAKLY_ASSIGNABLE;\n }\n\n virtual sstring to_string() const override {\n return \"null\";\n }\n };\n\n static const ::shared_ptr<term::raw> NULL_LITERAL;\n\n class literal : public term::raw {\n private:\n const type _type;\n const sstring _text;\n public:\n literal(type type_, sstring text)\n : _type{type_}\n , _text{text}\n { }\n\n static ::shared_ptr<literal> string(sstring text) {\n return ::make_shared<literal>(type::STRING, text);\n }\n\n static ::shared_ptr<literal> integer(sstring text) {\n return ::make_shared<literal>(type::INTEGER, text);\n }\n\n static ::shared_ptr<literal> floating_point(sstring text) {\n return ::make_shared<literal>(type::FLOAT, text);\n }\n\n static ::shared_ptr<literal> uuid(sstring text) {\n return ::make_shared<literal>(type::UUID, text);\n }\n\n static ::shared_ptr<literal> bool_(sstring text) {\n return ::make_shared<literal>(type::BOOLEAN, text);\n }\n\n static ::shared_ptr<literal> hex(sstring text) {\n return ::make_shared<literal>(type::HEX, text);\n }\n\n virtual ::shared_ptr<term> prepare(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver);\n private:\n bytes parsed_value(::shared_ptr<abstract_type> validator);\n public:\n const sstring& get_raw_text() {\n return _text;\n }\n\n virtual assignment_testable::test_result test_assignment(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver);\n\n virtual sstring to_string() const override {\n return _type == type::STRING ? sstring(sprint(\"'%s'\", _text)) : _text;\n }\n };\n\n class marker : public abstract_marker {\n public:\n marker(int32_t bind_index, ::shared_ptr<column_specification> receiver)\n : abstract_marker{bind_index, std::move(receiver)}\n {\n assert(!_receiver->type->is_collection());\n }\n\n virtual bytes_opt bind_and_get(const query_options& options) override {\n try {\n auto value = options.get_values().at(_bind_index);\n if (value) {\n _receiver->type->validate(value.value());\n }\n return value;\n } catch (const exceptions::marshal_exception& e) {\n throw exceptions::invalid_request_exception(e.what());\n }\n }\n\n virtual ::shared_ptr<terminal> bind(const query_options& options) override {\n auto bytes = bind_and_get(options);\n if (!bytes) {\n return ::shared_ptr<terminal>{};\n }\n return ::make_shared<constants::value>(std::move(bytes));\n }\n };\n\n class setter : public operation {\n public:\n using operation::operation;\n\n virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override {\n bytes_opt value = _t->bind_and_get(params._options);\n auto cell = value ? params.make_cell(*value) : params.make_dead_cell();\n m.set_cell(prefix, column, std::move(cell));\n }\n };\n\n#if 0\n public static class Adder extends Operation\n {\n public Adder(ColumnDefinition column, Term t)\n {\n super(column, t);\n }\n\n public void execute(ByteBuffer rowKey, ColumnFamily cf, Composite prefix, UpdateParameters params) throws InvalidRequestException\n {\n ByteBuffer bytes = t.bindAndGet(params.options);\n if (bytes == null)\n throw new InvalidRequestException(\"Invalid null value for counter increment\");\n long increment = ByteBufferUtil.toLong(bytes);\n CellName cname = cf.getComparator().create(prefix, column);\n cf.addColumn(params.makeCounter(cname, increment));\n }\n }\n\n public static class Substracter extends Operation\n {\n public Substracter(ColumnDefinition column, Term t)\n {\n super(column, t);\n }\n\n public void execute(ByteBuffer rowKey, ColumnFamily cf, Composite prefix, UpdateParameters params) throws InvalidRequestException\n {\n ByteBuffer bytes = t.bindAndGet(params.options);\n if (bytes == null)\n throw new InvalidRequestException(\"Invalid null value for counter increment\");\n\n long increment = ByteBufferUtil.toLong(bytes);\n if (increment == Long.MIN_VALUE)\n throw new InvalidRequestException(\"The negation of \" + increment + \" overflows supported counter precision (signed 8 bytes integer)\");\n\n CellName cname = cf.getComparator().create(prefix, column);\n cf.addColumn(params.makeCounter(cname, -increment));\n }\n }\n#endif\n\n class deleter : public operation {\n public:\n deleter(const column_definition& column)\n : operation(column, {})\n { }\n\n virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n };\n};\n\nstd::ostream& operator<<(std::ostream&out, constants::type t);\n\n}\n\n#endif\n<commit_msg>cql3: remove gunk from constants.hh<commit_after>\/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n\/*\n * Copyright 2015 Cloudius Systems\n *\n * Modified by Cloudius Systems\n *\/\n\n#ifndef CQL3_CONSTANTS_HH\n#define CQL3_CONSTANTS_HH\n\n#include \"cql3\/abstract_marker.hh\"\n#include \"cql3\/update_parameters.hh\"\n#include \"cql3\/operation.hh\"\n#include \"cql3\/term.hh\"\n#include \"core\/shared_ptr.hh\"\n\nnamespace cql3 {\n\n\/**\n * Static helper methods and classes for constants.\n *\/\nclass constants {\npublic:\n#if 0\n private static final Logger logger = LoggerFactory.getLogger(Constants.class);\n#endif\npublic:\n enum class type {\n STRING, INTEGER, UUID, FLOAT, BOOLEAN, HEX\n };\n\n \/**\n * A constant value, i.e. a ByteBuffer.\n *\/\n class value : public terminal {\n public:\n bytes_opt _bytes;\n value(bytes_opt bytes_) : _bytes(std::move(bytes_)) {}\n virtual bytes_opt get(const query_options& options) override { return _bytes; }\n virtual bytes_opt bind_and_get(const query_options& options) override { return _bytes; }\n virtual sstring to_string() const override { return to_hex(*_bytes); }\n };\n\n class null_literal final : public term::raw {\n private:\n class null_value final : public value {\n public:\n null_value() : value({}) {}\n virtual ::shared_ptr<terminal> bind(const query_options& options) override { return {}; }\n virtual sstring to_string() const override { return \"null\"; }\n };\n static const ::shared_ptr<terminal> NULL_VALUE;\n public:\n virtual ::shared_ptr<term> prepare(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver) override {\n if (!is_assignable(test_assignment(db, keyspace, receiver))) {\n throw exceptions::invalid_request_exception(\"Invalid null value for counter increment\/decrement\");\n }\n return NULL_VALUE;\n }\n\n virtual assignment_testable::test_result test_assignment(database& db,\n const sstring& keyspace,\n ::shared_ptr<column_specification> receiver) override {\n return receiver->type->is_counter()\n ? assignment_testable::test_result::NOT_ASSIGNABLE\n : assignment_testable::test_result::WEAKLY_ASSIGNABLE;\n }\n\n virtual sstring to_string() const override {\n return \"null\";\n }\n };\n\n static const ::shared_ptr<term::raw> NULL_LITERAL;\n\n class literal : public term::raw {\n private:\n const type _type;\n const sstring _text;\n public:\n literal(type type_, sstring text)\n : _type{type_}\n , _text{text}\n { }\n\n static ::shared_ptr<literal> string(sstring text) {\n return ::make_shared<literal>(type::STRING, text);\n }\n\n static ::shared_ptr<literal> integer(sstring text) {\n return ::make_shared<literal>(type::INTEGER, text);\n }\n\n static ::shared_ptr<literal> floating_point(sstring text) {\n return ::make_shared<literal>(type::FLOAT, text);\n }\n\n static ::shared_ptr<literal> uuid(sstring text) {\n return ::make_shared<literal>(type::UUID, text);\n }\n\n static ::shared_ptr<literal> bool_(sstring text) {\n return ::make_shared<literal>(type::BOOLEAN, text);\n }\n\n static ::shared_ptr<literal> hex(sstring text) {\n return ::make_shared<literal>(type::HEX, text);\n }\n\n virtual ::shared_ptr<term> prepare(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver);\n private:\n bytes parsed_value(::shared_ptr<abstract_type> validator);\n public:\n const sstring& get_raw_text() {\n return _text;\n }\n\n virtual assignment_testable::test_result test_assignment(database& db, const sstring& keyspace, ::shared_ptr<column_specification> receiver);\n\n virtual sstring to_string() const override {\n return _type == type::STRING ? sstring(sprint(\"'%s'\", _text)) : _text;\n }\n };\n\n class marker : public abstract_marker {\n public:\n marker(int32_t bind_index, ::shared_ptr<column_specification> receiver)\n : abstract_marker{bind_index, std::move(receiver)}\n {\n assert(!_receiver->type->is_collection());\n }\n\n virtual bytes_opt bind_and_get(const query_options& options) override {\n try {\n auto value = options.get_values().at(_bind_index);\n if (value) {\n _receiver->type->validate(value.value());\n }\n return value;\n } catch (const exceptions::marshal_exception& e) {\n throw exceptions::invalid_request_exception(e.what());\n }\n }\n\n virtual ::shared_ptr<terminal> bind(const query_options& options) override {\n auto bytes = bind_and_get(options);\n if (!bytes) {\n return ::shared_ptr<terminal>{};\n }\n return ::make_shared<constants::value>(std::move(bytes));\n }\n };\n\n class setter : public operation {\n public:\n using operation::operation;\n\n virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override {\n bytes_opt value = _t->bind_and_get(params._options);\n auto cell = value ? params.make_cell(*value) : params.make_dead_cell();\n m.set_cell(prefix, column, std::move(cell));\n }\n };\n\n#if 0\n public static class Adder extends Operation\n {\n public Adder(ColumnDefinition column, Term t)\n {\n super(column, t);\n }\n\n public void execute(ByteBuffer rowKey, ColumnFamily cf, Composite prefix, UpdateParameters params) throws InvalidRequestException\n {\n ByteBuffer bytes = t.bindAndGet(params.options);\n if (bytes == null)\n throw new InvalidRequestException(\"Invalid null value for counter increment\");\n long increment = ByteBufferUtil.toLong(bytes);\n CellName cname = cf.getComparator().create(prefix, column);\n cf.addColumn(params.makeCounter(cname, increment));\n }\n }\n\n public static class Substracter extends Operation\n {\n public Substracter(ColumnDefinition column, Term t)\n {\n super(column, t);\n }\n\n public void execute(ByteBuffer rowKey, ColumnFamily cf, Composite prefix, UpdateParameters params) throws InvalidRequestException\n {\n ByteBuffer bytes = t.bindAndGet(params.options);\n if (bytes == null)\n throw new InvalidRequestException(\"Invalid null value for counter increment\");\n\n long increment = ByteBufferUtil.toLong(bytes);\n if (increment == Long.MIN_VALUE)\n throw new InvalidRequestException(\"The negation of \" + increment + \" overflows supported counter precision (signed 8 bytes integer)\");\n\n CellName cname = cf.getComparator().create(prefix, column);\n cf.addColumn(params.makeCounter(cname, -increment));\n }\n }\n#endif\n\n class deleter : public operation {\n public:\n deleter(const column_definition& column)\n : operation(column, {})\n { }\n\n virtual void execute(mutation& m, const exploded_clustering_prefix& prefix, const update_parameters& params) override;\n };\n};\n\nstd::ostream& operator<<(std::ostream&out, constants::type t);\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 Samsung Electronics Co., Ltd All Rights Reserved\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\/**\n * @file\n * @author Mateusz Malicki (m.malicki2@samsung.com)\n * @brief Container interface\n *\/\n\n#ifndef LXCPP_CONTAINER_HPP\n#define LXCPP_CONTAINER_HPP\n\n#include \"lxcpp\/network-config.hpp\"\n#include \"lxcpp\/provision-config.hpp\"\n#include \"lxcpp\/cgroups\/cgroup-config.hpp\"\n#include \"lxcpp\/logger-config.hpp\"\n\n#include <sys\/types.h>\n\n#include <string>\n#include <functional>\n#include <vector>\n\nnamespace lxcpp {\n\nstruct NetworkInterfaceInfo {\n const std::string ifname;\n const NetStatus status;\n const std::string macaddr;\n const int mtu;\n const int flags;\n const std::vector<InetAddr> addrs;\n};\n\nclass Container {\npublic:\n typedef std::function<void(void)> Callback;\n\n enum class State: int {\n STOPPED, \/\/< Init isn't running\n STOPPING, \/\/< Init's stop is triggered\n STARTING, \/\/< Container is being set up\n RUNNING, \/\/< Init in container is running\n CONNECTING \/\/< Synchronizing with existing Guard\n };\n\n virtual ~Container() {};\n\n \/**\n * Configuration\n *\/\n virtual const std::string& getName() const = 0;\n virtual const std::string& getRootPath() const = 0;\n virtual void setHostName(const std::string& hostname) = 0;\n\n virtual pid_t getGuardPid() const = 0;\n virtual pid_t getInitPid() const = 0;\n\n virtual const std::vector<std::string>& getInit() = 0;\n virtual void setInit(const std::vector<std::string> &init) = 0;\n\n virtual void setLogger(const logger::LogType type,\n const logger::LogLevel level,\n const std::string &arg = \"\") = 0;\n\n virtual void setTerminalCount(const unsigned int count) = 0;\n\n virtual void addUIDMap(unsigned min, unsigned max, unsigned num) = 0;\n virtual void addGIDMap(unsigned min, unsigned max, unsigned num) = 0;\n\n \/**\n * Execution actions\n *\/\n virtual void start() = 0;\n virtual void stop() = 0;\n virtual void freeze() = 0;\n virtual void unfreeze() = 0;\n virtual void reboot() = 0;\n virtual bool connect() = 0;\n\n \/**\n * States\n *\/\n virtual State getState() = 0;\n virtual void setStartedCallback(const Callback& callback) = 0;\n virtual void setStoppedCallback(const Callback& callback) = 0;\n\n \/**\n * Other\n *\/\n virtual int attach(const std::vector<std::string>& argv,\n const uid_t uid,\n const gid_t gid,\n const std::string& ttyPath,\n const std::vector<gid_t>& supplementaryGids,\n const int capsToKeep,\n const std::string& workDirInContainer,\n const std::vector<std::string>& envToKeep,\n const std::vector<std::pair<std::string, std::string>>& envToSet) = 0;\n virtual void console() = 0;\n\n \/\/ Network interfaces setup\/config\n virtual void addInterfaceConfig(InterfaceConfigType type,\n const std::string& hostif,\n const std::string& zoneif = \"\",\n const std::vector<InetAddr>& addrs = std::vector<InetAddr>(),\n MacVLanMode mode = MacVLanMode::PRIVATE) = 0;\n virtual void addInetConfig(const std::string& ifname, const InetAddr& addr) = 0;\n\n \/**\n * Network interfaces (runtime)\n *\/\n virtual std::vector<std::string> getInterfaces() const = 0;\n virtual NetworkInterfaceInfo getInterfaceInfo(const std::string& ifname) const = 0;\n virtual void createInterface(const std::string& hostif,\n const std::string& zoneif,\n InterfaceType type,\n MacVLanMode mode) = 0;\n virtual void destroyInterface(const std::string& ifname) = 0;\n virtual void moveInterface(const std::string& ifname) = 0;\n virtual void setUpInterface(const std::string& ifname) = 0;\n virtual void setDownInterface(const std::string& ifname) = 0;\n virtual void addInetAddr(const std::string& ifname, const InetAddr& addr) = 0;\n virtual void delInetAddr(const std::string& ifname, const InetAddr& addr) = 0;\n\n \/**\n * Provisioning\n *\/\n virtual void declareFile(const provision::File::Type type,\n const std::string& path,\n const int32_t flags,\n const int32_t mode) = 0;\n virtual const FileVector& getFiles() const = 0;\n virtual void removeFile(const provision::File& item) = 0;\n\n virtual void declareMount(const std::string& source,\n const std::string& target,\n const std::string& type,\n const int64_t flags,\n const std::string& data) = 0;\n virtual const MountVector& getMounts() const = 0;\n virtual void removeMount(const provision::Mount& item) = 0;\n\n virtual void declareLink(const std::string& source,\n const std::string& target) = 0;\n virtual const LinkVector& getLinks() const = 0;\n virtual void removeLink(const provision::Link& item) = 0;\n\n \/**\n * CGroups\n *\/\n virtual void addSubsystem(const std::string& name, const std::string& path) = 0;\n virtual void addCGroup(const std::string& subsys,\n const std::string& grpname,\n const std::vector<CGroupParam>& comm,\n const std::vector<CGroupParam>& params) = 0;\n\n \/**\n * Environment variables\n *\/\n virtual void setEnv(const std::vector<std::pair<std::string, std::string>>& variables) = 0;\n\n \/**\n * Linux capabilities\n *\/\n virtual void setCaps(const int caps) = 0;\n\n \/**\n * System Property (sysctl)\n *\/\n virtual void setSystemProperty(const std::string& name, const std::string& value) = 0;\n\n \/**\n * Rlimit\n *\/\n virtual void setRlimit(const std::string& type, const uint64_t hard, const uint64_t soft) = 0;\n\n \/**\n * Namespaces\n * TODO Needed to implement application container.\n *\/\n virtual void setNamespaces(const int namespaces) = 0;\n\n \/**\n * UID\/GIDS\n * TODO Needed to implement application container.\n *\/\n virtual void setUser(const int uid, const int gid, const std::vector<int> additionalGids) = 0;\n\n \/**\n * Device\n *\/\n virtual void addDevice(const std::string& path,\n const char type,\n const int64_t major,\n const int64_t minor,\n const std::string& permissions,\n const uint32_t fileMode,\n const uint32_t uid,\n const uint32_t gid) = 0;\n\n \/**\n * Hooks\n *\/\n virtual void addHook(const std::string& type,\n const std::vector<std::string>& hook,\n const std::vector<std::pair<std::string, std::string>>& env) = 0;\n\n};\n\n} \/\/ namespace lxcpp\n\n#endif \/\/ LXCPP_CONTAINER_HPP\n<commit_msg>lxcpp: Fixed comments<commit_after>\/*\n * Copyright (C) 2015 Samsung Electronics Co., Ltd All Rights Reserved\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1 as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n\/**\n * @file\n * @author Mateusz Malicki (m.malicki2@samsung.com)\n * @brief Container interface\n *\/\n\n#ifndef LXCPP_CONTAINER_HPP\n#define LXCPP_CONTAINER_HPP\n\n#include \"lxcpp\/network-config.hpp\"\n#include \"lxcpp\/provision-config.hpp\"\n#include \"lxcpp\/cgroups\/cgroup-config.hpp\"\n#include \"lxcpp\/logger-config.hpp\"\n\n#include <sys\/types.h>\n\n#include <string>\n#include <functional>\n#include <vector>\n\nnamespace lxcpp {\n\nstruct NetworkInterfaceInfo {\n const std::string ifname;\n const NetStatus status;\n const std::string macaddr;\n const int mtu;\n const int flags;\n const std::vector<InetAddr> addrs;\n};\n\nclass Container {\npublic:\n typedef std::function<void(void)> Callback;\n\n enum class State: int {\n STOPPED, \/\/\/< Init isn't running\n STOPPING, \/\/\/< Init's stop is triggered\n STARTING, \/\/\/< Container is being set up\n RUNNING, \/\/\/< Init in container is running\n CONNECTING \/\/\/< Synchronizing with existing Guard\n };\n\n virtual ~Container() {};\n\n \/**\n * Configuration\n *\/\n virtual const std::string& getName() const = 0;\n virtual const std::string& getRootPath() const = 0;\n virtual void setHostName(const std::string& hostname) = 0;\n\n virtual pid_t getGuardPid() const = 0;\n virtual pid_t getInitPid() const = 0;\n\n virtual const std::vector<std::string>& getInit() = 0;\n virtual void setInit(const std::vector<std::string> &init) = 0;\n\n virtual void setLogger(const logger::LogType type,\n const logger::LogLevel level,\n const std::string &arg = \"\") = 0;\n\n virtual void setTerminalCount(const unsigned int count) = 0;\n\n virtual void addUIDMap(unsigned min, unsigned max, unsigned num) = 0;\n virtual void addGIDMap(unsigned min, unsigned max, unsigned num) = 0;\n\n \/**\n * Execution actions\n *\/\n virtual void start() = 0;\n virtual void stop() = 0;\n virtual void freeze() = 0;\n virtual void unfreeze() = 0;\n virtual void reboot() = 0;\n virtual bool connect() = 0;\n\n \/**\n * States\n *\/\n virtual State getState() = 0;\n virtual void setStartedCallback(const Callback& callback) = 0;\n virtual void setStoppedCallback(const Callback& callback) = 0;\n\n \/**\n * Other\n *\/\n virtual int attach(const std::vector<std::string>& argv,\n const uid_t uid,\n const gid_t gid,\n const std::string& ttyPath,\n const std::vector<gid_t>& supplementaryGids,\n const int capsToKeep,\n const std::string& workDirInContainer,\n const std::vector<std::string>& envToKeep,\n const std::vector<std::pair<std::string, std::string>>& envToSet) = 0;\n virtual void console() = 0;\n\n \/\/ Network interfaces setup\/config\n virtual void addInterfaceConfig(InterfaceConfigType type,\n const std::string& hostif,\n const std::string& zoneif = \"\",\n const std::vector<InetAddr>& addrs = std::vector<InetAddr>(),\n MacVLanMode mode = MacVLanMode::PRIVATE) = 0;\n virtual void addInetConfig(const std::string& ifname, const InetAddr& addr) = 0;\n\n \/**\n * Network interfaces (runtime)\n *\/\n virtual std::vector<std::string> getInterfaces() const = 0;\n virtual NetworkInterfaceInfo getInterfaceInfo(const std::string& ifname) const = 0;\n virtual void createInterface(const std::string& hostif,\n const std::string& zoneif,\n InterfaceType type,\n MacVLanMode mode) = 0;\n virtual void destroyInterface(const std::string& ifname) = 0;\n virtual void moveInterface(const std::string& ifname) = 0;\n virtual void setUpInterface(const std::string& ifname) = 0;\n virtual void setDownInterface(const std::string& ifname) = 0;\n virtual void addInetAddr(const std::string& ifname, const InetAddr& addr) = 0;\n virtual void delInetAddr(const std::string& ifname, const InetAddr& addr) = 0;\n\n \/**\n * Provisioning\n *\/\n virtual void declareFile(const provision::File::Type type,\n const std::string& path,\n const int32_t flags,\n const int32_t mode) = 0;\n virtual const FileVector& getFiles() const = 0;\n virtual void removeFile(const provision::File& item) = 0;\n\n virtual void declareMount(const std::string& source,\n const std::string& target,\n const std::string& type,\n const int64_t flags,\n const std::string& data) = 0;\n virtual const MountVector& getMounts() const = 0;\n virtual void removeMount(const provision::Mount& item) = 0;\n\n virtual void declareLink(const std::string& source,\n const std::string& target) = 0;\n virtual const LinkVector& getLinks() const = 0;\n virtual void removeLink(const provision::Link& item) = 0;\n\n \/**\n * CGroups\n *\/\n virtual void addSubsystem(const std::string& name, const std::string& path) = 0;\n virtual void addCGroup(const std::string& subsys,\n const std::string& grpname,\n const std::vector<CGroupParam>& comm,\n const std::vector<CGroupParam>& params) = 0;\n\n \/**\n * Environment variables\n *\/\n virtual void setEnv(const std::vector<std::pair<std::string, std::string>>& variables) = 0;\n\n \/**\n * Linux capabilities\n *\/\n virtual void setCaps(const int caps) = 0;\n\n \/**\n * System Property (sysctl)\n *\/\n virtual void setSystemProperty(const std::string& name, const std::string& value) = 0;\n\n \/**\n * Rlimit\n *\/\n virtual void setRlimit(const std::string& type, const uint64_t hard, const uint64_t soft) = 0;\n\n \/**\n * Namespaces\n * TODO Needed to implement application container.\n *\/\n virtual void setNamespaces(const int namespaces) = 0;\n\n \/**\n * UID\/GIDS\n * TODO Needed to implement application container.\n *\/\n virtual void setUser(const int uid, const int gid, const std::vector<int> additionalGids) = 0;\n\n \/**\n * Device\n *\/\n virtual void addDevice(const std::string& path,\n const char type,\n const int64_t major,\n const int64_t minor,\n const std::string& permissions,\n const uint32_t fileMode,\n const uint32_t uid,\n const uint32_t gid) = 0;\n\n \/**\n * Hooks\n *\/\n virtual void addHook(const std::string& type,\n const std::vector<std::string>& hook,\n const std::vector<std::pair<std::string, std::string>>& env) = 0;\n\n};\n\n} \/\/ namespace lxcpp\n\n#endif \/\/ LXCPP_CONTAINER_HPP\n<|endoftext|>"} {"text":"<commit_before>#ifndef LIBBITCOIN_TYPES_H\n#define LIBBITCOIN_TYPES_H\n\n#include <boost\/detail\/endian.hpp>\n#include <boost\/asio.hpp>\n#include <array>\n#include <memory>\n#include <sstream>\n#include <iomanip>\n#include <vector>\n\n#include <bitcoin\/network\/types.hpp>\n\nnamespace libbitcoin {\n\nusing std::shared_ptr;\nusing boost::asio::io_service;\nusing boost::asio::ip::tcp;\nusing boost::asio::deadline_timer;\n\nclass dialect;\nclass blockchain;\nclass kernel;\nclass network;\nclass clock;\n\ntypedef shared_ptr<dialect> dialect_ptr;\ntypedef shared_ptr<blockchain> blockchain_ptr;\ntypedef shared_ptr<kernel> kernel_ptr;\ntypedef shared_ptr<network> network_ptr;\ntypedef shared_ptr<clock> clock_ptr;\n\ntypedef shared_ptr<io_service> service_ptr;\ntypedef shared_ptr<io_service::work> work_ptr;\ntypedef shared_ptr<io_service::strand> strand_ptr;\ntypedef shared_ptr<deadline_timer> deadline_timer_ptr;\n\ntypedef std::array<uint8_t, 32> hash_digest;\ntypedef std::array<uint8_t, 20> short_hash;\n\ntypedef unsigned char byte;\ntypedef std::vector<byte> data_chunk;\n\ntemplate<typename D, typename T>\nvoid extend_data(D& chunk, const T& other)\n{\n chunk.insert(end(chunk), begin(other), end(other));\n}\n\ntemplate<typename T>\nT cast_chunk(data_chunk chunk, bool reverse=false)\n{\n #ifdef BOOST_LITTLE_ENDIAN\n reverse = !reverse;\n #elif BOOST_BIG_ENDIAN\n \/\/ do nothing\n #else\n #error \"Endian isn't defined!\"\n #endif\n\n if (reverse)\n std::reverse(begin(chunk), end(chunk));\n\n T val = 0;\n for (size_t i = 0; i < sizeof(T) && i < chunk.size(); ++i)\n val += static_cast<T>(chunk[i]) << (i*8);\n return val;\n}\n\ntemplate<typename T>\ndata_chunk uncast_type(T val, bool reverse=false)\n{\n data_chunk chunk;\n for (size_t i = 0; i < sizeof(T); ++i)\n chunk.push_back(reinterpret_cast<byte*>(&val)[i]);\n if (reverse)\n std::reverse(begin(chunk), end(chunk));\n return chunk;\n}\n\ntemplate<typename T>\nstd::string pretty_hex(T data)\n{\n std::stringstream ss;\n ss << std::hex;\n for (int val: data)\n ss << std::setw(2) << std::setfill('0') << val << ' ';\n \/\/ Remove end ' '\n std::string ret = ss.str();\n if (ret.size() == 0)\n return \"\";\n ret.resize(ret.size() - 1);\n return ret;\n}\n\ndata_chunk bytes_from_pretty(std::string byte_stream);\nhash_digest hash_from_pretty(std::string byte_stream);\n\n} \/\/ libbitcoin\n\n#endif\n\n<commit_msg>hash_digest \/ short_hash std::hash implementations for std::*map variants.<commit_after>#ifndef LIBBITCOIN_TYPES_H\n#define LIBBITCOIN_TYPES_H\n\n#include <boost\/detail\/endian.hpp>\n#include <boost\/asio.hpp>\n#include <array>\n#include <memory>\n#include <sstream>\n#include <iomanip>\n#include <vector>\n\n#include <bitcoin\/network\/types.hpp>\n\nnamespace libbitcoin {\n\nusing std::shared_ptr;\nusing boost::asio::io_service;\nusing boost::asio::ip::tcp;\nusing boost::asio::deadline_timer;\n\nclass dialect;\nclass blockchain;\nclass kernel;\nclass network;\nclass clock;\n\ntypedef shared_ptr<dialect> dialect_ptr;\ntypedef shared_ptr<blockchain> blockchain_ptr;\ntypedef shared_ptr<kernel> kernel_ptr;\ntypedef shared_ptr<network> network_ptr;\ntypedef shared_ptr<clock> clock_ptr;\n\ntypedef shared_ptr<io_service> service_ptr;\ntypedef shared_ptr<io_service::work> work_ptr;\ntypedef shared_ptr<io_service::strand> strand_ptr;\ntypedef shared_ptr<deadline_timer> deadline_timer_ptr;\n\ntypedef std::array<uint8_t, 32> hash_digest;\ntypedef std::array<uint8_t, 20> short_hash;\n\ntypedef unsigned char byte;\ntypedef std::vector<byte> data_chunk;\n\ntemplate<typename D, typename T>\nvoid extend_data(D& chunk, const T& other)\n{\n chunk.insert(end(chunk), begin(other), end(other));\n}\n\ntemplate<typename T>\nT cast_chunk(data_chunk chunk, bool reverse=false)\n{\n #ifdef BOOST_LITTLE_ENDIAN\n reverse = !reverse;\n #elif BOOST_BIG_ENDIAN\n \/\/ do nothing\n #else\n #error \"Endian isn't defined!\"\n #endif\n\n if (reverse)\n std::reverse(begin(chunk), end(chunk));\n\n T val = 0;\n for (size_t i = 0; i < sizeof(T) && i < chunk.size(); ++i)\n val += static_cast<T>(chunk[i]) << (i*8);\n return val;\n}\n\ntemplate<typename T>\ndata_chunk uncast_type(T val, bool reverse=false)\n{\n data_chunk chunk;\n for (size_t i = 0; i < sizeof(T); ++i)\n chunk.push_back(reinterpret_cast<byte*>(&val)[i]);\n if (reverse)\n std::reverse(begin(chunk), end(chunk));\n return chunk;\n}\n\ntemplate<typename T>\nstd::string pretty_hex(T data)\n{\n std::stringstream ss;\n ss << std::hex;\n for (int val: data)\n ss << std::setw(2) << std::setfill('0') << val << ' ';\n \/\/ Remove end ' '\n std::string ret = ss.str();\n if (ret.size() == 0)\n return \"\";\n ret.resize(ret.size() - 1);\n return ret;\n}\n\ndata_chunk bytes_from_pretty(std::string byte_stream);\nhash_digest hash_from_pretty(std::string byte_stream);\n\n\/\/ Make hash_digest and short_hash hashable for std::*map variants\ntemplate <typename HashType>\nstruct std_hash_wrapper\n{\n size_t operator()(const HashType& h) const\n {\n std::hash<std::string> functor;\n return functor(std::string(std::begin(h), std::end(h)));\n }\n};\n\n} \/\/ libbitcoin\n\n\/\/ Extend std namespace with our hash wrappers\nnamespace std\n{\n using libbitcoin::std_hash_wrapper;\n using libbitcoin::hash_digest;\n using libbitcoin::short_hash;\n\n template <>\n struct hash<hash_digest> : public std_hash_wrapper<hash_digest>\n {\n };\n\n template <>\n struct hash<short_hash> : public std_hash_wrapper<short_hash>\n {\n };\n}\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * callbacks.hpp - Framework support of callback functions\n *\n * Copyright 2010-2011 Jesús Torres <jmtorres@ull.es>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef CALLBACKS_HPP_\n#define CALLBACKS_HPP_\n\n#include <string>\n#include <vector>\n\n#include <boost\/function.hpp>\n#include <boost\/mpl\/assert.hpp>\n#include <boost\/preprocessor\/seq\/for_each.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n#include <boost\/type_traits.hpp>\n\n#include <cli\/exceptions.hpp>\n\n\/\/\n\/\/ Macro CLI_DECLARE_CALLBACKS & CLI_DECLARE_CALLBACKS_TPL\n\/\/\n\/\/ Helps to add the support for callbacks to a class declaration.\n\/\/\n\n#define CLI_DECLARE_CALLBACKS_FILLER_0(X, Y) \\\n ((X, Y)) CLI_DECLARE_CALLBACKS_FILLER_1\n#define CLI_DECLARE_CALLBACKS_FILLER_1(X, Y) \\\n ((X, Y)) CLI_DECLARE_CALLBACKS_FILLER_0\n#define CLI_DECLARE_CALLBACKS_FILLER_0_END\n#define CLI_DECLARE_CALLBACKS_FILLER_1_END\n\n#define CLI_DECLARE_CALLBACK_MEMBER(r, TYPE, DECLARATION_TUPLE) \\\n typedef cli::callback:: \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)<TYPE>::Type \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE); \\\n boost::function<BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)> \\\n BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE);\n\n#define CLI_DECLARE_CALLBACK_MEMBER_TPL(r, TYPE, DECLARATION_TUPLE) \\\n typedef typename cli::callback:: \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)<TYPE>::Type \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE); \\\n boost::function<BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)> \\\n BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE);\n\n#define CLI_DECLARE_CALLBACKS(TYPE, DECLARATIONS_SEQ) \\\n BOOST_PP_SEQ_FOR_EACH( \\\n CLI_DECLARE_CALLBACK_MEMBER, \\\n TYPE, \\\n BOOST_PP_CAT( \\\n CLI_DECLARE_CALLBACKS_FILLER_0 DECLARATIONS_SEQ, _END)) \\\n template <template <typename> class Callback> \\\n friend class cli::callback::SetCallbackImpl;\n\n#define CLI_DECLARE_CALLBACKS_TPL(TYPE, DECLARATIONS_SEQ) \\\n BOOST_PP_SEQ_FOR_EACH( \\\n CLI_DECLARE_CALLBACK_MEMBER_TPL, \\\n TYPE, \\\n BOOST_PP_CAT( \\\n CLI_DECLARE_CALLBACKS_FILLER_0 DECLARATIONS_SEQ, _END)) \\\n template <template <typename> class Callback> \\\n friend class cli::callback::SetCallbackImpl;\n\n\/\/\n\/\/ Macro CLI_CALLBACK_SIGNATURE_ASSERT & CLI_CALLBACK_SIGNATURE_ASSERT_TPL\n\/\/\n\/\/ Tests if the function signature of FUNCTOR match the expected by CALLBACK.\n\/\/\n\n#define CLI_CALLBACK_SIGNATURE_ASSERT(CALLBACK, FUNCTOR) \\\n BOOST_MPL_ASSERT((boost::is_convertible<FUNCTOR, \\\n boost::function<CALLBACK<Type>::Type> >))\n\n#define CLI_CALLBACK_SIGNATURE_ASSERT_TPL(CALLBACK, FUNCTOR) \\\n BOOST_MPL_ASSERT((boost::is_convertible<FUNCTOR, \\\n boost::function<typename CALLBACK<Type>::Type> >))\n\nnamespace cli { namespace callback\n{\n \/\/\n \/\/ Base template for callback function setter implementation\n \/\/\n\n template <template <typename> class Callback>\n struct SetCallbackImpl\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n {\n throw cli::exception::UnknownCallbackException(\n Callback<T>::name());\n }\n };\n\n \/\/\n \/\/ DoCommandCallback\n \/\/\n\n template <typename T>\n struct DoCommandCallback\n {\n typedef bool (Type)(const std::string&,\n typename T::CommandArgumentsType const&);\n static const char* name() { return \"DoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<DoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.defaultDoCommandCallback_ = function; }\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function,\n const std::string& command)\n { interpreter.doCommandCallbacks_[command] = function; }\n };\n\n \/\/\n \/\/ EmptyLineCallback\n \/\/\n\n template <typename T>\n struct EmptyLineCallback\n {\n typedef bool (Type)();\n static const char* name() { return \"EmptyLineCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<EmptyLineCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.emptyLineCallback_ = function; }\n };\n\n \/\/\n \/\/ PreDoCommandCallback\n \/\/\n\n template <typename T>\n struct PreDoCommandCallback\n {\n typedef void (Type)(std::string&);\n static const char* name() { return \"PreDoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PreDoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.preDoCommandCallback_ = function; }\n };\n\n \/\/\n \/\/ PostDoCommandCallback\n \/\/\n\n template <typename T>\n struct PostDoCommandCallback\n {\n typedef bool (Type)(bool, const std::string&);\n static const char* name() { return \"PostDoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PostDoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.postDoCommandCallback_ = function; }\n };\n\n \/\/\n \/\/ ParserErrorCallback\n \/\/\n\n template <typename T>\n struct ParserErrorCallback\n {\n typedef bool (Type)(typename T::ParserErrorType const&,\n const std::string&);\n static const char* name() { return \"ParserErrorCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<ParserErrorCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.parserErrorCallback_ = function; }\n };\n\n \/\/\n \/\/ PreLoopCallback\n \/\/\n\n template <typename T>\n struct PreLoopCallback\n {\n typedef void (Type)();\n static const char* name() { return \"PreLoopCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PreLoopCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.preLoopCallback_ = function; }\n };\n\n \/\/\n \/\/ PostLoopCallback\n \/\/\n\n template <typename T>\n struct PostLoopCallback\n {\n typedef void (Type)();\n static const char* name() { return \"PostLoopCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PostLoopCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.postLoopCallback_ = function; }\n };\n\n \/\/\n \/\/ VariableLookupCallback\n \/\/\n\n template <typename T>\n struct VariableLookupCallback\n {\n typedef std::string (Type)(const std::string&);\n static const char* name() { return \"VariableLookupCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<VariableLookupCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.lineParser_->variableLookupCallback_ = function; }\n };\n\n \/\/\n \/\/ PathnameExpansionCallback\n \/\/\n\n template <typename T>\n struct PathnameExpansionCallback\n {\n typedef std::vector<std::string> (Type)(const std::string&);\n static const char* name() { return \"PathnameExpansionCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PathnameExpansionCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.lineParser_->PathnameExpansionCallback_ = function; }\n };\n}}\n\n#endif \/* CALLBACKS_HPP_ *\/\n<commit_msg>fix error in setCallback for PathnameExpansion callback<commit_after>\/*\n * callbacks.hpp - Framework support of callback functions\n *\n * Copyright 2010-2011 Jesús Torres <jmtorres@ull.es>\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef CALLBACKS_HPP_\n#define CALLBACKS_HPP_\n\n#include <string>\n#include <vector>\n\n#include <boost\/function.hpp>\n#include <boost\/mpl\/assert.hpp>\n#include <boost\/preprocessor\/seq\/for_each.hpp>\n#include <boost\/preprocessor\/tuple\/elem.hpp>\n#include <boost\/type_traits.hpp>\n\n#include <cli\/exceptions.hpp>\n\n\/\/\n\/\/ Macro CLI_DECLARE_CALLBACKS & CLI_DECLARE_CALLBACKS_TPL\n\/\/\n\/\/ Helps to add the support for callbacks to a class declaration.\n\/\/\n\n#define CLI_DECLARE_CALLBACKS_FILLER_0(X, Y) \\\n ((X, Y)) CLI_DECLARE_CALLBACKS_FILLER_1\n#define CLI_DECLARE_CALLBACKS_FILLER_1(X, Y) \\\n ((X, Y)) CLI_DECLARE_CALLBACKS_FILLER_0\n#define CLI_DECLARE_CALLBACKS_FILLER_0_END\n#define CLI_DECLARE_CALLBACKS_FILLER_1_END\n\n#define CLI_DECLARE_CALLBACK_MEMBER(r, TYPE, DECLARATION_TUPLE) \\\n typedef cli::callback:: \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)<TYPE>::Type \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE); \\\n boost::function<BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)> \\\n BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE);\n\n#define CLI_DECLARE_CALLBACK_MEMBER_TPL(r, TYPE, DECLARATION_TUPLE) \\\n typedef typename cli::callback:: \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)<TYPE>::Type \\\n BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE); \\\n boost::function<BOOST_PP_TUPLE_ELEM(2, 0, DECLARATION_TUPLE)> \\\n BOOST_PP_TUPLE_ELEM(2, 1, DECLARATION_TUPLE);\n\n#define CLI_DECLARE_CALLBACKS(TYPE, DECLARATIONS_SEQ) \\\n BOOST_PP_SEQ_FOR_EACH( \\\n CLI_DECLARE_CALLBACK_MEMBER, \\\n TYPE, \\\n BOOST_PP_CAT( \\\n CLI_DECLARE_CALLBACKS_FILLER_0 DECLARATIONS_SEQ, _END)) \\\n template <template <typename> class Callback> \\\n friend class cli::callback::SetCallbackImpl;\n\n#define CLI_DECLARE_CALLBACKS_TPL(TYPE, DECLARATIONS_SEQ) \\\n BOOST_PP_SEQ_FOR_EACH( \\\n CLI_DECLARE_CALLBACK_MEMBER_TPL, \\\n TYPE, \\\n BOOST_PP_CAT( \\\n CLI_DECLARE_CALLBACKS_FILLER_0 DECLARATIONS_SEQ, _END)) \\\n template <template <typename> class Callback> \\\n friend class cli::callback::SetCallbackImpl;\n\n\/\/\n\/\/ Macro CLI_CALLBACK_SIGNATURE_ASSERT & CLI_CALLBACK_SIGNATURE_ASSERT_TPL\n\/\/\n\/\/ Tests if the function signature of FUNCTOR match the expected by CALLBACK.\n\/\/\n\n#define CLI_CALLBACK_SIGNATURE_ASSERT(CALLBACK, FUNCTOR) \\\n BOOST_MPL_ASSERT((boost::is_convertible<FUNCTOR, \\\n boost::function<CALLBACK<Type>::Type> >))\n\n#define CLI_CALLBACK_SIGNATURE_ASSERT_TPL(CALLBACK, FUNCTOR) \\\n BOOST_MPL_ASSERT((boost::is_convertible<FUNCTOR, \\\n boost::function<typename CALLBACK<Type>::Type> >))\n\nnamespace cli { namespace callback\n{\n \/\/\n \/\/ Base template for callback function setter implementation\n \/\/\n\n template <template <typename> class Callback>\n struct SetCallbackImpl\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n {\n throw cli::exception::UnknownCallbackException(\n Callback<T>::name());\n }\n };\n\n \/\/\n \/\/ DoCommandCallback\n \/\/\n\n template <typename T>\n struct DoCommandCallback\n {\n typedef bool (Type)(const std::string&,\n typename T::CommandArgumentsType const&);\n static const char* name() { return \"DoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<DoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.defaultDoCommandCallback_ = function; }\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function,\n const std::string& command)\n { interpreter.doCommandCallbacks_[command] = function; }\n };\n\n \/\/\n \/\/ EmptyLineCallback\n \/\/\n\n template <typename T>\n struct EmptyLineCallback\n {\n typedef bool (Type)();\n static const char* name() { return \"EmptyLineCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<EmptyLineCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.emptyLineCallback_ = function; }\n };\n\n \/\/\n \/\/ PreDoCommandCallback\n \/\/\n\n template <typename T>\n struct PreDoCommandCallback\n {\n typedef void (Type)(std::string&);\n static const char* name() { return \"PreDoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PreDoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.preDoCommandCallback_ = function; }\n };\n\n \/\/\n \/\/ PostDoCommandCallback\n \/\/\n\n template <typename T>\n struct PostDoCommandCallback\n {\n typedef bool (Type)(bool, const std::string&);\n static const char* name() { return \"PostDoCommandCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PostDoCommandCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.postDoCommandCallback_ = function; }\n };\n\n \/\/\n \/\/ ParserErrorCallback\n \/\/\n\n template <typename T>\n struct ParserErrorCallback\n {\n typedef bool (Type)(typename T::ParserErrorType const&,\n const std::string&);\n static const char* name() { return \"ParserErrorCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<ParserErrorCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.parserErrorCallback_ = function; }\n };\n\n \/\/\n \/\/ PreLoopCallback\n \/\/\n\n template <typename T>\n struct PreLoopCallback\n {\n typedef void (Type)();\n static const char* name() { return \"PreLoopCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PreLoopCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.preLoopCallback_ = function; }\n };\n\n \/\/\n \/\/ PostLoopCallback\n \/\/\n\n template <typename T>\n struct PostLoopCallback\n {\n typedef void (Type)();\n static const char* name() { return \"PostLoopCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PostLoopCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.postLoopCallback_ = function; }\n };\n\n \/\/\n \/\/ VariableLookupCallback\n \/\/\n\n template <typename T>\n struct VariableLookupCallback\n {\n typedef std::string (Type)(const std::string&);\n static const char* name() { return \"VariableLookupCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<VariableLookupCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.lineParser_->variableLookupCallback_ = function; }\n };\n\n \/\/\n \/\/ PathnameExpansionCallback\n \/\/\n\n template <typename T>\n struct PathnameExpansionCallback\n {\n typedef std::vector<std::string> (Type)(const std::string&);\n static const char* name() { return \"PathnameExpansionCallback\"; }\n };\n\n template <>\n struct SetCallbackImpl<PathnameExpansionCallback>\n {\n template <typename T, typename Functor>\n static void setCallback(T& interpreter, Functor function)\n { interpreter.lineParser_->pathnameExpansionCallback_ = function; }\n };\n}}\n\n#endif \/* CALLBACKS_HPP_ *\/\n<|endoftext|>"} {"text":"<commit_before>#include <stdlib.h>\n#include <stdint.h>\n\n#include <Arduino.h>\n#include <SPI.h>\n#include <Wire.h>\n#include <U8g2lib.h>\n#include <avr\/pgmspace.h>\n\n#include \"tetrominoes.h\"\n#include \"tune.h\"\n\nU8G2_ST7920_128X64_F_HW_SPI scr(\n U8G2_R1\/*Rotate the screen 90 degree clockwise*\/,\n A5\/*CS, pin 41*\/,\n A4\/*RESET, pin 40*\/\n);\n\nconstexpr int16_t kSpeakerPin = 9;\n\nconstexpr int16_t kFieldCols = 10;\nconstexpr int16_t kFieldRows = 22;\nconstexpr int16_t kFieldOffsetX = 5;\nconstexpr int16_t kFieldOffsetY = 1;\nconstexpr int16_t kBoxSize = 5;\nconstexpr int16_t kStartRow = -2;\nconstexpr int16_t kStartCol = 3;\n\nconstexpr uint32_t kDebounceMs = 50;\nconstexpr uint32_t kGameStepMs = 1000;\nuint32_t nextStepMs = 0;\n\nint16_t tetrRot = 0;\nint16_t tetrRow = 0;\nint16_t tetrCol = kStartCol;\nint16_t tetrType = 0;\n\nint16_t score = 0;\nconst int16_t kMaxScore = 999;\n\nint16_t level = 0;\nconst int16_t kMaxLevel = 9;\nconst uint32_t kStepMs[kMaxLevel+1] = {1000, 800, 650, 500, 400, 300, 200, 100, 50, 10};\nconst int16_t kLinesPerLevel = 10;\n\nbool field[kFieldRows][kFieldCols] = {0};\n\nenum {\n BUTTON_LEFT,\n BUTTON_RIGHT,\n BUTTON_ROT,\n BUTTON_DROP,\n BUTTON_COUNT = BUTTON_DROP + 1,\n};\n\nenum {\n STATE_RUNNING,\n STATE_GAMEOVER,\n STATE_PAUSE,\n};\n\nint16_t state = STATE_RUNNING;\n\nbool buttons[BUTTON_COUNT] = {false};\nbool buttonsBefore[BUTTON_COUNT] = {false};\nuint32_t lastPressedMs[BUTTON_COUNT] = {0};\nconst int16_t kButtonPins[BUTTON_COUNT] = {4, 5, 6, 7};\n\nint16_t nextToneIndex = -1;\nint16_t nextTone = 0;\nuint16_t nextToneDurationMs = 0;\nuint32_t nextToneTimeMs = 0;\n\nbool currentTetromino[kTetrominoRows][kTetrominoCols] = {0};\n\nvoid loadTetramino() {\n int16_t data = pgm_read_word_near(&kTetrominoes[tetrType][tetrRot]);\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n currentTetromino[row][col] = (data & 1) == 1;\n data >>= 1;\n }\n }\n}\n\ninline bool wasPressed(int16_t btn) {\n return buttons[btn] && !buttonsBefore[btn];\n}\n\ninline void drawBox(int16_t row, int16_t col) {\n scr.drawBox(kFieldOffsetX + 2 + col * kBoxSize,\n kFieldOffsetY + 2 + row * kBoxSize,\n kBoxSize - 1,\n kBoxSize - 1);\n}\n\nvoid drawField() {\n scr.clearBuffer();\n scr.drawFrame(kFieldOffsetX,\n kFieldOffsetY,\n kFieldCols * kBoxSize + 3,\n kFieldRows * kBoxSize + 3);\n for (int16_t row = 0; row < kFieldRows; ++row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n if (field[row][col]) {\n drawBox(row, col);\n }\n }\n }\n\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n drawBox(tetrRow + row, tetrCol + col);\n }\n }\n }\n\n scr.setCursor(3, 125);\n scr.print(\"S\");\n scr.print(score);\n scr.setCursor(32, 125);\n scr.print(\"L\");\n scr.print(level + 1);\n\n scr.sendBuffer();\n}\n\nvoid drawFinalScreen() {\n scr.setDrawColor(0);\n scr.drawBox(0, 47, 64, 18);\n scr.setDrawColor(1);\n scr.setCursor(5, 60);\n scr.print(F(\"GAME OVER\"));\n scr.sendBuffer();\n}\n\nbool collides(int16_t trow, int16_t tcol) {\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n if (trow + row >= kFieldRows || tcol + col < 0 || tcol + col >= kFieldCols) {\n return true;\n }\n if (field[trow + row][tcol + col]) {\n return true;\n }\n }\n }\n }\n return false;\n}\n\nbool isCompleteRow(int16_t row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n if (!field[row][col]) {\n return false;\n }\n }\n return true;\n}\n\nvoid deleteRow(int16_t row) {\n for (int16_t i = row; i > 0; --i) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[i][col] = field[i-1][col];\n }\n }\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[0][col] = false;\n }\n score++;\n if (score > kMaxScore) {\n score = kMaxScore;\n }\n level = score \/ kLinesPerLevel;\n if (level > kMaxLevel) {\n level = kMaxLevel;\n }\n}\n\nvoid placeTetromino() {\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n field[tetrRow + row][tetrCol + col] = true;\n }\n }\n }\n\n bool deleted;\n do {\n deleted = false;\n for (int16_t row = kFieldRows-1; row >= 0; --row) {\n if (isCompleteRow(row)) {\n deleteRow(row);\n deleted = true;\n break;\n }\n }\n } while (deleted);\n}\n\nvoid step() {\n if (collides(tetrRow + 1, tetrCol)) {\n placeTetromino();\n\n tetrRow = 0;\n tetrCol = kStartCol;\n tetrRot = 0;\n tetrType = random(kTetrominoCount);\n loadTetramino();\n\n if (collides(tetrRow, tetrCol)) {\n state = STATE_GAMEOVER;\n }\n } else {\n tetrRow++;\n }\n}\n\n\/\/ Returns whether there were changes.\nbool updateGameState(uint32_t now) {\n bool changesMade = false;\n \/\/ Test rotation.\n if (wasPressed(BUTTON_ROT)) {\n \/\/ FIXME: load all rotations into RAM, pass rotation to collides().\n tetrRot = (tetrRot + 1) % kRotationCount;\n loadTetramino();\n changesMade = true;\n if (collides(tetrRow, tetrCol)) {\n \/\/ Undo.\n tetrRot = (tetrRot - 1) % kRotationCount;\n loadTetramino();\n }\n }\n\n if (wasPressed(BUTTON_LEFT)) {\n if (!collides(tetrRow, tetrCol - 1)) {\n --tetrCol;\n }\n }\n\n if (wasPressed(BUTTON_RIGHT)) {\n if (!collides(tetrRow, tetrCol + 1)) {\n ++tetrCol;\n }\n }\n\n if (now >= nextStepMs) {\n step();\n nextStepMs = now + kStepMs[level];\n changesMade = true;\n }\n\n return changesMade;\n}\n\nvoid initGame() {\n tetrType = random(kTetrominoCount);\n tetrRot = 0;\n tetrRow = 0;\n tetrCol = kStartCol;\n score = 0;\n for (int16_t row = 0; row < kFieldRows; ++row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[row][col] = false;\n }\n }\n loadTetramino();\n}\n\nvoid setup() {\n randomSeed(analogRead(0));\n pinMode(kSpeakerPin, OUTPUT);\n for (uint16_t pin : kButtonPins) {\n pinMode(pin, INPUT_PULLUP);\n }\n scr.begin();\n scr.setFont(u8g2_font_profont12_tr);\n initGame();\n}\n\nvoid loop() {\n uint32_t now = millis();\n if (now >= nextToneTimeMs) {\n if (nextTone != 0) {\n tone(kSpeakerPin, nextTone, (uint32_t)nextToneDurationMs);\n }\n nextToneTimeMs = now + nextToneDurationMs;\n nextToneIndex = (nextToneIndex + 1) % kToneCount;\n nextTone = pgm_read_word_near(&kTones[nextToneIndex]);\n nextToneDurationMs = pgm_read_word_near(&kToneDurations[nextToneIndex]);\n }\n for (uint16_t i = 0; i < BUTTON_COUNT; ++i) {\n buttonsBefore[i] = buttons[i];\n if (now - lastPressedMs[i] > kDebounceMs) {\n if (digitalRead(kButtonPins[i]) == LOW) {\n buttons[i] = true;\n lastPressedMs[i] = now;\n } else {\n buttons[i] = false;\n }\n }\n }\n if (state == STATE_RUNNING) {\n if (updateGameState(now)) {\n drawField();\n }\n } else if (state == STATE_GAMEOVER) {\n drawFinalScreen();\n }\n}\n<commit_msg>adjust tetris speed<commit_after>#include <stdlib.h>\n#include <stdint.h>\n\n#include <Arduino.h>\n#include <SPI.h>\n#include <Wire.h>\n#include <U8g2lib.h>\n#include <avr\/pgmspace.h>\n\n#include \"tetrominoes.h\"\n#include \"tune.h\"\n\nU8G2_ST7920_128X64_F_HW_SPI scr(\n U8G2_R1\/*Rotate the screen 90 degree clockwise*\/,\n A5\/*CS, pin 41*\/,\n A4\/*RESET, pin 40*\/\n);\n\nconstexpr int16_t kSpeakerPin = 9;\n\nconstexpr int16_t kFieldCols = 10;\nconstexpr int16_t kFieldRows = 22;\nconstexpr int16_t kFieldOffsetX = 5;\nconstexpr int16_t kFieldOffsetY = 1;\nconstexpr int16_t kBoxSize = 5;\nconstexpr int16_t kStartRow = -2;\nconstexpr int16_t kStartCol = 3;\n\nconstexpr uint32_t kDebounceMs = 50;\nconstexpr uint32_t kGameStepMs = 1000;\nuint32_t nextStepMs = 0;\n\nint16_t tetrRot = 0;\nint16_t tetrRow = 0;\nint16_t tetrCol = kStartCol;\nint16_t tetrType = 0;\n\nint16_t score = 0;\nconst int16_t kMaxScore = 999;\n\nint16_t level = 0;\nconst int16_t kMaxLevel = 9;\nconst uint32_t kStepMs[kMaxLevel+1] = {800, 700, 600, 500, 400, 300, 200, 100, 50, 10};\nconst int16_t kLinesPerLevel = 10;\n\nbool field[kFieldRows][kFieldCols] = {0};\n\nenum {\n BUTTON_LEFT,\n BUTTON_RIGHT,\n BUTTON_ROT,\n BUTTON_DROP,\n BUTTON_COUNT = BUTTON_DROP + 1,\n};\n\nenum {\n STATE_RUNNING,\n STATE_GAMEOVER,\n STATE_PAUSE,\n};\n\nint16_t state = STATE_RUNNING;\n\nbool buttons[BUTTON_COUNT] = {false};\nbool buttonsBefore[BUTTON_COUNT] = {false};\nuint32_t lastPressedMs[BUTTON_COUNT] = {0};\nconst int16_t kButtonPins[BUTTON_COUNT] = {4, 5, 6, 7};\n\nint16_t nextToneIndex = -1;\nint16_t nextTone = 0;\nuint16_t nextToneDurationMs = 0;\nuint32_t nextToneTimeMs = 0;\n\nbool currentTetromino[kTetrominoRows][kTetrominoCols] = {0};\n\nvoid loadTetramino() {\n int16_t data = pgm_read_word_near(&kTetrominoes[tetrType][tetrRot]);\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n currentTetromino[row][col] = (data & 1) == 1;\n data >>= 1;\n }\n }\n}\n\ninline bool wasPressed(int16_t btn) {\n return buttons[btn] && !buttonsBefore[btn];\n}\n\ninline void drawBox(int16_t row, int16_t col) {\n scr.drawBox(kFieldOffsetX + 2 + col * kBoxSize,\n kFieldOffsetY + 2 + row * kBoxSize,\n kBoxSize - 1,\n kBoxSize - 1);\n}\n\nvoid drawField() {\n scr.clearBuffer();\n scr.drawFrame(kFieldOffsetX,\n kFieldOffsetY,\n kFieldCols * kBoxSize + 3,\n kFieldRows * kBoxSize + 3);\n for (int16_t row = 0; row < kFieldRows; ++row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n if (field[row][col]) {\n drawBox(row, col);\n }\n }\n }\n\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n drawBox(tetrRow + row, tetrCol + col);\n }\n }\n }\n\n scr.setCursor(3, 125);\n scr.print(\"S\");\n scr.print(score);\n scr.setCursor(32, 125);\n scr.print(\"L\");\n scr.print(level + 1);\n\n scr.sendBuffer();\n}\n\nvoid drawFinalScreen() {\n scr.setDrawColor(0);\n scr.drawBox(0, 47, 64, 18);\n scr.setDrawColor(1);\n scr.setCursor(5, 60);\n scr.print(F(\"GAME OVER\"));\n scr.sendBuffer();\n}\n\nbool collides(int16_t trow, int16_t tcol) {\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n if (trow + row >= kFieldRows || tcol + col < 0 || tcol + col >= kFieldCols) {\n return true;\n }\n if (field[trow + row][tcol + col]) {\n return true;\n }\n }\n }\n }\n return false;\n}\n\nbool isCompleteRow(int16_t row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n if (!field[row][col]) {\n return false;\n }\n }\n return true;\n}\n\nvoid deleteRow(int16_t row) {\n for (int16_t i = row; i > 0; --i) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[i][col] = field[i-1][col];\n }\n }\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[0][col] = false;\n }\n score++;\n if (score > kMaxScore) {\n score = kMaxScore;\n }\n level = score \/ kLinesPerLevel;\n if (level > kMaxLevel) {\n level = kMaxLevel;\n }\n}\n\nvoid placeTetromino() {\n for (int16_t row = 0; row < kTetrominoRows; ++row) {\n for (int16_t col = 0; col < kTetrominoCols; ++col) {\n if (currentTetromino[row][col]) {\n field[tetrRow + row][tetrCol + col] = true;\n }\n }\n }\n\n bool deleted;\n do {\n deleted = false;\n for (int16_t row = kFieldRows-1; row >= 0; --row) {\n if (isCompleteRow(row)) {\n deleteRow(row);\n deleted = true;\n break;\n }\n }\n } while (deleted);\n}\n\nvoid step() {\n if (collides(tetrRow + 1, tetrCol)) {\n placeTetromino();\n\n tetrRow = 0;\n tetrCol = kStartCol;\n tetrRot = 0;\n tetrType = random(kTetrominoCount);\n loadTetramino();\n\n if (collides(tetrRow, tetrCol)) {\n state = STATE_GAMEOVER;\n }\n } else {\n tetrRow++;\n }\n}\n\n\/\/ Returns whether there were changes.\nbool updateGameState(uint32_t now) {\n bool changesMade = false;\n \/\/ Test rotation.\n if (wasPressed(BUTTON_ROT)) {\n \/\/ FIXME: load all rotations into RAM, pass rotation to collides().\n tetrRot = (tetrRot + 1) % kRotationCount;\n loadTetramino();\n changesMade = true;\n if (collides(tetrRow, tetrCol)) {\n \/\/ Undo.\n tetrRot = (tetrRot - 1) % kRotationCount;\n loadTetramino();\n }\n }\n\n if (wasPressed(BUTTON_LEFT)) {\n if (!collides(tetrRow, tetrCol - 1)) {\n --tetrCol;\n }\n }\n\n if (wasPressed(BUTTON_RIGHT)) {\n if (!collides(tetrRow, tetrCol + 1)) {\n ++tetrCol;\n }\n }\n\n if (now >= nextStepMs) {\n step();\n nextStepMs = now + kStepMs[level];\n changesMade = true;\n }\n\n return changesMade;\n}\n\nvoid initGame() {\n tetrType = random(kTetrominoCount);\n tetrRot = 0;\n tetrRow = 0;\n tetrCol = kStartCol;\n score = 0;\n for (int16_t row = 0; row < kFieldRows; ++row) {\n for (int16_t col = 0; col < kFieldCols; ++col) {\n field[row][col] = false;\n }\n }\n loadTetramino();\n}\n\nvoid setup() {\n randomSeed(analogRead(0));\n pinMode(kSpeakerPin, OUTPUT);\n for (uint16_t pin : kButtonPins) {\n pinMode(pin, INPUT_PULLUP);\n }\n scr.begin();\n scr.setFont(u8g2_font_profont12_tr);\n initGame();\n}\n\nvoid loop() {\n uint32_t now = millis();\n if (now >= nextToneTimeMs) {\n if (nextTone != 0) {\n tone(kSpeakerPin, nextTone, (uint32_t)nextToneDurationMs);\n }\n nextToneTimeMs = now + nextToneDurationMs;\n nextToneIndex = (nextToneIndex + 1) % kToneCount;\n nextTone = pgm_read_word_near(&kTones[nextToneIndex]);\n nextToneDurationMs = pgm_read_word_near(&kToneDurations[nextToneIndex]);\n }\n for (uint16_t i = 0; i < BUTTON_COUNT; ++i) {\n buttonsBefore[i] = buttons[i];\n if (now - lastPressedMs[i] > kDebounceMs) {\n if (digitalRead(kButtonPins[i]) == LOW) {\n buttons[i] = true;\n lastPressedMs[i] = now;\n } else {\n buttons[i] = false;\n }\n }\n }\n if (state == STATE_RUNNING) {\n if (updateGameState(now)) {\n drawField();\n }\n } else if (state == STATE_GAMEOVER) {\n drawFinalScreen();\n }\n}\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************\/\n\/* XDMF *\/\n\/* eXtensible Data Model and Format *\/\n\/* *\/\n\/* Id : Id *\/\n\/* Date : $Date$ *\/\n\/* Version : $Revision$ *\/\n\/* *\/\n\/* Author: *\/\n\/* Jerry A. Clarke *\/\n\/* clarke@arl.army.mil *\/\n\/* US Army Research Laboratory *\/\n\/* Aberdeen Proving Ground, MD *\/\n\/* *\/\n\/* Copyright @ 2002 US Army Research Laboratory *\/\n\/* All Rights Reserved *\/\n\/* See Copyright.txt or http:\/\/www.arl.hpc.mil\/ice for details *\/\n\/* *\/\n\/* This software is distributed WITHOUT ANY WARRANTY; without *\/\n\/* even the implied warranty of MERCHANTABILITY or FITNESS *\/\n\/* FOR A PARTICULAR PURPOSE. See the above copyright notice *\/\n\/* for more information. *\/\n\/* *\/\n\/*******************************************************************\/\n#include \"XdmfObject.h\"\n#include \"XdmfValuesHDF.h\"\n#include \"XdmfHDF.h\"\n#include \"XdmfDOM.h\"\n#include \"XdmfDataStructure.h\"\n#include \"XdmfArray.h\"\n\nXdmfValuesHDF::XdmfValuesHDF() {\n this->SetFormat(XDMF_FORMAT_HDF);\n}\n\nXdmfValuesHDF::~XdmfValuesHDF() {\n}\n\nXdmfArray *\nXdmfValuesHDF::Read(XdmfArray *anArray){\n XdmfArray *RetArray = anArray;\n XdmfString DataSetName = 0;\n XdmfHDF H5;\n\n if(!this->DataDesc){\n XdmfErrorMessage(\"DataDesc has not been set\");\n return(NULL);\n }\n H5.SetWorkingDirectory(this->DOM->GetWorkingDirectory());\n XDMF_STRING_DUPLICATE(DataSetName, this->Get(\"CDATA\"));\n if(!DataSetName || strlen(DataSetName) < 1){\n XdmfErrorMessage(\"Invalid HDF5 Dataset Name\");\n return(NULL);\n }\n XDMF_WORD_TRIM(DataSetName);\n \/\/! Possible Read from DSM. Make sure we're connected.\n if(!this->DsmBuffer) this->SetDsmBuffer(anArray->GetDsmBuffer());\n XdmfDebug(\"Opening HDF5 Data for Reading : \" << DataSetName);\n \/\/ Allocate Array if Necessary\n if(!RetArray){\n RetArray = new XdmfArray();\n if(!RetArray){\n XdmfErrorMessage(\"Error Allocating New Array\");\n return(NULL);\n }\n RetArray->CopyType(this->DataDesc);\n RetArray->CopyShape(this->DataDesc);\n RetArray->CopySelection(this->DataDesc);\n RetArray->Allocate();\n }\n H5.SetDsmBuffer(this->DsmBuffer);\n if( H5.Open( DataSetName, \"r\" ) == XDMF_FAIL ) {\n XdmfErrorMessage(\"Can't Open Dataset \" << DataSetName);\n if(!anArray) delete RetArray;\n RetArray = NULL;\n }else{\n if(this->DataDesc->GetSelectionSize() != H5.GetNumberOfElements() ){\n \/\/ We're not reading the entire dataset\n if( this->DataDesc->GetSelectionType() == XDMF_HYPERSLAB ){\n XdmfInt32 Rank;\n XdmfInt64 Start[ XDMF_MAX_DIMENSION ];\n XdmfInt64 Stride[ XDMF_MAX_DIMENSION ];\n XdmfInt64 Count[ XDMF_MAX_DIMENSION ];\n \n \/\/ Select the HyperSlab from HDF5\n Rank = this->DataDesc->GetHyperSlab( Start, Stride, Count );\n H5.SelectHyperSlab( Start, Stride, Count );\n if(RetArray->GetSelectionSize() < H5.GetSelectionSize()){\n XdmfErrorMessage(\"Return Array No Large Enough to Hold Selected Data\");\n RetArray->SetShapeFromSelection(&H5);\n }\n \/\/ RetArray->SetShape(Rank, Count);\n \/\/ RetArray->SelectAll();\n } else {\n XdmfInt64 NumberOfCoordinates;\n XdmfInt64 *Coordinates;\n\n\n \/\/ Select Parametric Coordinates from HDF5\n NumberOfCoordinates = this->DataDesc->GetSelectionSize();\n Coordinates = this->DataDesc->GetCoordinates();\n RetArray->SetNumberOfElements(NumberOfCoordinates);\n H5.SelectCoordinates(NumberOfCoordinates, Coordinates);\n delete Coordinates;\n }\n }\n XdmfDebug(\"Reading \" << H5.GetSelectionSize() << \" into Array of \" << RetArray->GetSelectionSize() );\n if( H5.Read(RetArray) == NULL ){\n XdmfErrorMessage(\"Can't Read Dataset \" << DataSetName);\n if(!anArray) delete RetArray;\n RetArray = NULL;\n }else{\n this->SetHeavyDataSetName(DataSetName);\n }\n H5.Close();\n }\n delete [] DataSetName;\n return(RetArray);\n}\n\nXdmfInt32\nXdmfValuesHDF::Write(XdmfArray *anArray, XdmfConstString aHeavyDataSetName){\n char* hds;\n XdmfHDF H5;\n\n H5.SetWorkingDirectory(this->DOM->GetWorkingDirectory());\n if(!aHeavyDataSetName) aHeavyDataSetName = this->GetHeavyDataSetName();\n if(!aHeavyDataSetName){\n if(anArray->GetHeavyDataSetName()){\n aHeavyDataSetName = (XdmfConstString)anArray->GetHeavyDataSetName();\n }else{\n aHeavyDataSetName = this->GetUniqueName(\"Xdmf.h5:\/Data\");\n }\n }\n \/\/ Possible Write to DSM. Make sure we're connected\n if(!this->DsmBuffer) this->SetDsmBuffer(anArray->GetDsmBuffer());\n XdmfDebug(\"Writing Values to \" << aHeavyDataSetName);\n if(!this->DataDesc ){\n XdmfErrorMessage(\"DataDesc has not been set\");\n return(XDMF_FAIL);\n }\n if(!anArray){\n XdmfErrorMessage(\"Array to Write is NULL\");\n return(XDMF_FAIL);\n }\n XDMF_STRING_DUPLICATE(hds, aHeavyDataSetName);\n XDMF_WORD_TRIM( hds );\n this->Set(\"CDATA\", hds);\n H5.SetCompression(anArray->GetCompression());\n H5.CopyType(this->DataDesc);\n H5.CopyShape(this->DataDesc);\n H5.CopySelection(this->DataDesc);\n H5.SetDsmBuffer(this->DsmBuffer);\n if(H5.Open(hds, \"rw\") == XDMF_FAIL){\n XdmfErrorMessage(\"Error Opening \" << hds << \" for Writing\");\n delete [] hds ;\n return(XDMF_FAIL);\n }\n if(H5.Write(anArray) == XDMF_FAIL){\n XdmfErrorMessage(\"Error Writing \" << hds );\n H5.Close();\n delete [] hds;\n return(XDMF_FAIL);\n }\n H5.Close();\n delete [] hds;\n return(XDMF_SUCCESS);\n}\n\nXdmfString XdmfValuesHDF::DataItemFromHDF(XdmfConstString H5DataSet){\n XdmfHDF H5;\n ostrstream StringOutput;\n char *Ptr;\n static XdmfString ReturnString = NULL;\n\n if(H5.Open(H5DataSet, \"r\") == XDMF_FAIL){\n XdmfErrorMessage(\"Can't open H5 Dataset \" << H5DataSet << \" for reading\");\n return(NULL);\n }\n StringOutput << \"<DataItem NumberType=\\\"\";\n StringOutput << XdmfTypeToClassString(H5.GetNumberType());\n StringOutput << \"\\\" Precision=\\\"\";\n StringOutput << H5.GetElementSize();\n StringOutput << \"\\\" Dimensions=\\\"\";\n StringOutput << H5.GetShapeAsString();\n StringOutput << \"\\\">\" << H5DataSet << \"<\/DataItem>\";\n StringOutput << ends;\n H5.Close();\n\n if ( ReturnString != NULL ) delete [] ReturnString;\n Ptr = StringOutput.str();\n ReturnString = new char[strlen(Ptr) + 2 ];\n strcpy( ReturnString, Ptr );\n return(ReturnString);\n}\n<commit_msg>ENH: Make xdmf h5 heavy data file foo.h5 when creating foo.xmf.<commit_after>\/*******************************************************************\/\n\/* XDMF *\/\n\/* eXtensible Data Model and Format *\/\n\/* *\/\n\/* Id : Id *\/\n\/* Date : $Date$ *\/\n\/* Version : $Revision$ *\/\n\/* *\/\n\/* Author: *\/\n\/* Jerry A. Clarke *\/\n\/* clarke@arl.army.mil *\/\n\/* US Army Research Laboratory *\/\n\/* Aberdeen Proving Ground, MD *\/\n\/* *\/\n\/* Copyright @ 2002 US Army Research Laboratory *\/\n\/* All Rights Reserved *\/\n\/* See Copyright.txt or http:\/\/www.arl.hpc.mil\/ice for details *\/\n\/* *\/\n\/* This software is distributed WITHOUT ANY WARRANTY; without *\/\n\/* even the implied warranty of MERCHANTABILITY or FITNESS *\/\n\/* FOR A PARTICULAR PURPOSE. See the above copyright notice *\/\n\/* for more information. *\/\n\/* *\/\n\/*******************************************************************\/\n#include \"XdmfObject.h\"\n#include \"XdmfValuesHDF.h\"\n#include \"XdmfHDF.h\"\n#include \"XdmfDOM.h\"\n#include \"XdmfDataStructure.h\"\n#include \"XdmfArray.h\"\n\nXdmfValuesHDF::XdmfValuesHDF() {\n this->SetFormat(XDMF_FORMAT_HDF);\n}\n\nXdmfValuesHDF::~XdmfValuesHDF() {\n}\n\nXdmfArray *\nXdmfValuesHDF::Read(XdmfArray *anArray){\n XdmfArray *RetArray = anArray;\n XdmfString DataSetName = 0;\n XdmfHDF H5;\n\n if(!this->DataDesc){\n XdmfErrorMessage(\"DataDesc has not been set\");\n return(NULL);\n }\n H5.SetWorkingDirectory(this->DOM->GetWorkingDirectory());\n XDMF_STRING_DUPLICATE(DataSetName, this->Get(\"CDATA\"));\n if(!DataSetName || strlen(DataSetName) < 1){\n XdmfErrorMessage(\"Invalid HDF5 Dataset Name\");\n return(NULL);\n }\n XDMF_WORD_TRIM(DataSetName);\n \/\/! Possible Read from DSM. Make sure we're connected.\n if(!this->DsmBuffer) this->SetDsmBuffer(anArray->GetDsmBuffer());\n XdmfDebug(\"Opening HDF5 Data for Reading : \" << DataSetName);\n \/\/ Allocate Array if Necessary\n if(!RetArray){\n RetArray = new XdmfArray();\n if(!RetArray){\n XdmfErrorMessage(\"Error Allocating New Array\");\n return(NULL);\n }\n RetArray->CopyType(this->DataDesc);\n RetArray->CopyShape(this->DataDesc);\n RetArray->CopySelection(this->DataDesc);\n RetArray->Allocate();\n }\n H5.SetDsmBuffer(this->DsmBuffer);\n if( H5.Open( DataSetName, \"r\" ) == XDMF_FAIL ) {\n XdmfErrorMessage(\"Can't Open Dataset \" << DataSetName);\n if(!anArray) delete RetArray;\n RetArray = NULL;\n }else{\n if(this->DataDesc->GetSelectionSize() != H5.GetNumberOfElements() ){\n \/\/ We're not reading the entire dataset\n if( this->DataDesc->GetSelectionType() == XDMF_HYPERSLAB ){\n XdmfInt32 Rank;\n XdmfInt64 Start[ XDMF_MAX_DIMENSION ];\n XdmfInt64 Stride[ XDMF_MAX_DIMENSION ];\n XdmfInt64 Count[ XDMF_MAX_DIMENSION ];\n \n \/\/ Select the HyperSlab from HDF5\n Rank = this->DataDesc->GetHyperSlab( Start, Stride, Count );\n H5.SelectHyperSlab( Start, Stride, Count );\n if(RetArray->GetSelectionSize() < H5.GetSelectionSize()){\n XdmfErrorMessage(\"Return Array No Large Enough to Hold Selected Data\");\n RetArray->SetShapeFromSelection(&H5);\n }\n \/\/ RetArray->SetShape(Rank, Count);\n \/\/ RetArray->SelectAll();\n } else {\n XdmfInt64 NumberOfCoordinates;\n XdmfInt64 *Coordinates;\n\n\n \/\/ Select Parametric Coordinates from HDF5\n NumberOfCoordinates = this->DataDesc->GetSelectionSize();\n Coordinates = this->DataDesc->GetCoordinates();\n RetArray->SetNumberOfElements(NumberOfCoordinates);\n H5.SelectCoordinates(NumberOfCoordinates, Coordinates);\n delete Coordinates;\n }\n }\n XdmfDebug(\"Reading \" << H5.GetSelectionSize() << \" into Array of \" << RetArray->GetSelectionSize() );\n if( H5.Read(RetArray) == NULL ){\n XdmfErrorMessage(\"Can't Read Dataset \" << DataSetName);\n if(!anArray) delete RetArray;\n RetArray = NULL;\n }else{\n this->SetHeavyDataSetName(DataSetName);\n }\n H5.Close();\n }\n delete [] DataSetName;\n return(RetArray);\n}\n\nXdmfInt32\nXdmfValuesHDF::Write(XdmfArray *anArray, XdmfConstString aHeavyDataSetName){\n char* hds;\n XdmfHDF H5;\n\n H5.SetWorkingDirectory(this->DOM->GetWorkingDirectory());\n if(!aHeavyDataSetName) aHeavyDataSetName = this->GetHeavyDataSetName();\n if(!aHeavyDataSetName){\n if(anArray->GetHeavyDataSetName())\n {\n aHeavyDataSetName = (XdmfConstString)anArray->GetHeavyDataSetName();\n }\n else\n {\n static char FName[256];\n sprintf(FName, \"%s\", this->DOM->GetOutputFileName());\n char *ext = strstr(FName, \".xmf\");\n const char *NewExt = \".h5:\/Data\";\n if (ext && ext < FName+(256-strlen(NewExt)))\n {\n sprintf(ext, NewExt);\n aHeavyDataSetName = this->GetUniqueName(FName);\n }\n else\n {\n aHeavyDataSetName = this->GetUniqueName(\"Xdmf.h5:\/Data\");\n }\n }\n }\n \/\/ Possible Write to DSM. Make sure we're connected\n if(!this->DsmBuffer) this->SetDsmBuffer(anArray->GetDsmBuffer());\n XdmfDebug(\"Writing Values to \" << aHeavyDataSetName);\n if(!this->DataDesc ){\n XdmfErrorMessage(\"DataDesc has not been set\");\n return(XDMF_FAIL);\n }\n if(!anArray){\n XdmfErrorMessage(\"Array to Write is NULL\");\n return(XDMF_FAIL);\n }\n XDMF_STRING_DUPLICATE(hds, aHeavyDataSetName);\n XDMF_WORD_TRIM( hds );\n this->Set(\"CDATA\", hds);\n H5.SetCompression(anArray->GetCompression());\n H5.CopyType(this->DataDesc);\n H5.CopyShape(this->DataDesc);\n H5.CopySelection(this->DataDesc);\n H5.SetDsmBuffer(this->DsmBuffer);\n if(H5.Open(hds, \"rw\") == XDMF_FAIL){\n XdmfErrorMessage(\"Error Opening \" << hds << \" for Writing\");\n delete [] hds ;\n return(XDMF_FAIL);\n }\n if(H5.Write(anArray) == XDMF_FAIL){\n XdmfErrorMessage(\"Error Writing \" << hds );\n H5.Close();\n delete [] hds;\n return(XDMF_FAIL);\n }\n H5.Close();\n delete [] hds;\n return(XDMF_SUCCESS);\n}\n\nXdmfString XdmfValuesHDF::DataItemFromHDF(XdmfConstString H5DataSet){\n XdmfHDF H5;\n ostrstream StringOutput;\n char *Ptr;\n static XdmfString ReturnString = NULL;\n\n if(H5.Open(H5DataSet, \"r\") == XDMF_FAIL){\n XdmfErrorMessage(\"Can't open H5 Dataset \" << H5DataSet << \" for reading\");\n return(NULL);\n }\n StringOutput << \"<DataItem NumberType=\\\"\";\n StringOutput << XdmfTypeToClassString(H5.GetNumberType());\n StringOutput << \"\\\" Precision=\\\"\";\n StringOutput << H5.GetElementSize();\n StringOutput << \"\\\" Dimensions=\\\"\";\n StringOutput << H5.GetShapeAsString();\n StringOutput << \"\\\">\" << H5DataSet << \"<\/DataItem>\";\n StringOutput << ends;\n H5.Close();\n\n if ( ReturnString != NULL ) delete [] ReturnString;\n Ptr = StringOutput.str();\n ReturnString = new char[strlen(Ptr) + 2 ];\n strcpy( ReturnString, Ptr );\n return(ReturnString);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by malachi on 12\/27\/17.\n\/\/\n\n#include <catch.hpp>\n\n#include \"..\/coap-dispatcher.h\"\n#include \"test-data.h\"\n\nusing namespace moducom::coap;\nusing namespace moducom::coap::experimental;\nusing namespace moducom::pipeline;\n\n\/\/ Specialized prefix checker which does not expect s to be\n\/\/ null terminated, but does expect prefix to be null terminated\ntemplate <typename TChar>\nbool starts_with(const TChar* s, int slen, const char* prefix)\n{\n while(*prefix && slen--)\n {\n if(*prefix++ != *s++) return false;\n }\n\n return true;\n}\n\n\nbool starts_with(MemoryChunk::readonly_t chunk, const char* prefix)\n{\n return starts_with(chunk.data(), chunk.length(), prefix);\n}\n\nclass UriPathDispatcherHandler : public DispatcherHandlerBase\n{\n const char* prefix;\n IMessageObserver& observer;\n\npublic:\n UriPathDispatcherHandler(const char* prefix, IMessageObserver& observer)\n : prefix(prefix),\n observer(observer)\n {\n\n }\n\n void on_header(Header header) OVERRIDE\n {\n if(!header.is_request()) interested(Never);\n }\n\n\n void on_option(number_t number, uint16_t length) OVERRIDE\n {\n if(is_always_interested())\n {\n observer.on_option(number, length);\n return;\n }\n }\n\n void on_option(number_t number,\n const MemoryChunk::readonly_t& option_value_part,\n bool last_chunk) OVERRIDE\n {\n \/\/ If we're always interested, then we've gone into pass thru mode\n if(is_always_interested())\n {\n observer.on_option(number, option_value_part, last_chunk);\n return;\n }\n\n switch(number)\n {\n case Option::UriPath:\n \/\/ FIX: I think we don't need this, because path is already\n \/\/ chunked out so 99% of the time we'll want to compare the\n \/\/ whole string not just the prefix - but I suppose comparing\n \/\/ the as a prefix doesn't hurt us\n if(starts_with(option_value_part, prefix))\n interested(Always);\n else\n \/\/ If we don't get what we want right away, then we are\n \/\/ no longer interested (more prefix style behavior)\n interested(Never);\n\n \/\/ TODO: We'll want to not only indicate interest but also\n \/\/ have a subordinate dispatcher to act on further observations\n break;\n }\n }\n\n void on_payload(const MemoryChunk::readonly_t& payload_part, bool last_chunk) OVERRIDE\n {\n ASSERT_WARN(true, is_always_interested(), \"Should only arrive here if interested\");\n\n observer.on_payload(payload_part, last_chunk);\n }\n};\n\nclass TestDispatcherHandler : public DispatcherHandlerBase\n{\n int option_test_number;\n\npublic:\n TestDispatcherHandler(InterestedEnum i = Always) :\n DispatcherHandlerBase(i),\n option_test_number(0) {}\n\n virtual void on_header(Header header) OVERRIDE\n {\n REQUIRE(header.is_request());\n }\n\n virtual void on_token(const MemoryChunk::readonly_t& token_part, bool last_chunk) OVERRIDE\n {\n FAIL(\"Should not reach here\");\n }\n\n virtual void on_option(number_t number, uint16_t length) OVERRIDE\n {\n switch(option_test_number)\n {\n case 0:\n REQUIRE(number == 270);\n REQUIRE(length == 1);\n break;\n\n case 1:\n REQUIRE(number == 271);\n REQUIRE(length == 2);\n break;\n }\n }\n\n virtual void on_option(number_t number, const MemoryChunk::readonly_t& option_value_part, bool last_chunk) OVERRIDE\n {\n switch(option_test_number++)\n {\n case 0:\n REQUIRE(option_value_part[0] == 3);\n REQUIRE(option_value_part.length() == 1);\n break;\n\n case 1:\n REQUIRE(option_value_part[0] == 4);\n REQUIRE(option_value_part[1] == 5);\n REQUIRE(option_value_part.length() == 2);\n break;\n }\n }\n\n virtual void on_payload(const MemoryChunk::readonly_t& payload_part, bool last_chunk) OVERRIDE\n {\n REQUIRE(payload_part[0] == buffer_16bit_delta[12]);\n REQUIRE(payload_part[payload_part.length()] == buffer_16bit_delta[12 + payload_part.length()]);\n }\n};\n\nextern dispatcher_handler_factory_fn test_sub_factories[];\n\nIDispatcherHandler* test_factory1(MemoryChunk chunk)\n{\n return new (chunk.data()) TestDispatcherHandler(IDispatcherHandler::Never);\n}\n\n\nIDispatcherHandler* test_factory2(MemoryChunk chunk)\n{\n MemoryChunk& uri_handler_chunk = chunk;\n MemoryChunk v1_handler_chunk = chunk.remainder(sizeof(UriPathDispatcherHandler));\n MemoryChunk v1_handler_inner_chunk = v1_handler_chunk.remainder(sizeof(FactoryDispatcherHandler));\n\n FactoryDispatcherHandler* fdh = new (v1_handler_chunk.data()) FactoryDispatcherHandler(\n v1_handler_inner_chunk,\n test_sub_factories, 1);\n\n \/\/ TODO: will need some way to invoke fdh destructor\n \/\/return new (uri_handler_chunk.data()) UriPathDispatcherHandler(\"v1\", *fdh);\n \/\/ TEST instead of v1 to work with our existing test data\n return new (uri_handler_chunk.data()) UriPathDispatcherHandler(\"TEST\", *fdh);\n}\n\ndispatcher_handler_factory_fn test_factories[] =\n{\n test_factory1,\n test_factory2\n};\n\n\nclass TestDispatcherHandler2 : public DispatcherHandlerBase\n{\npublic:\n void on_payload(const MemoryChunk::readonly_t& payload_part,\n bool last_chunk) OVERRIDE\n {\n REQUIRE(payload_part[0] == 0x10);\n REQUIRE(payload_part[1] == 0x11);\n REQUIRE(payload_part[2] == 0x12);\n REQUIRE(payload_part.length() == 7);\n }\n};\n\nIDispatcherHandler* test_sub_factory1(MemoryChunk chunk)\n{\n static TestDispatcherHandler2 handler;\n\n \/\/ To be v1\/path1\n \/\/return new (chunk.data()) UriPathDispatcherHandler(\"path1\", handler);\n \/\/ TEST\/POS to work with our existing test data\n return new (chunk.data()) UriPathDispatcherHandler(\"POS\", handler);\n}\n\ndispatcher_handler_factory_fn test_sub_factories[] =\n{\n test_sub_factory1\n};\n\nTEST_CASE(\"CoAP dispatcher tests\", \"[coap-dispatcher]\")\n{\n SECTION(\"Test 1\")\n {\n MemoryChunk chunk(buffer_16bit_delta, sizeof(buffer_16bit_delta));\n\n TestDispatcherHandler dispatcherHandler;\n Dispatcher dispatcher;\n \/\/layer3::MemoryChunk<128> chunk;\n\n dispatcher.head(&dispatcherHandler);\n dispatcher.dispatch(chunk);\n\n\n }\n SECTION(\"Factory\")\n {\n MemoryChunk chunk(buffer_plausible, sizeof(buffer_plausible));\n\n \/\/ in-place new holder\n layer3::MemoryChunk<128> dispatcherBuffer;\n\n FactoryDispatcherHandler fdh(dispatcherBuffer, test_factories, 2);\n Dispatcher dispatcher;\n\n \/\/ doesn't fully test new UriPath handler because TestDispatcherHandler\n \/\/ is not stateless (and shouldn't be expected to be) but because of that\n \/\/ setting it to \"Currently\" makes it unable to test its own options properly\n dispatcher.head(&fdh);\n dispatcher.dispatch(chunk);\n }\n}<commit_msg>Making helper template for uri+handler combos<commit_after>\/\/\n\/\/ Created by malachi on 12\/27\/17.\n\/\/\n\n#include <catch.hpp>\n\n#include \"..\/coap-dispatcher.h\"\n#include \"test-data.h\"\n\nusing namespace moducom::coap;\nusing namespace moducom::coap::experimental;\nusing namespace moducom::pipeline;\n\n\/\/ Specialized prefix checker which does not expect s to be\n\/\/ null terminated, but does expect prefix to be null terminated\ntemplate <typename TChar>\nbool starts_with(const TChar* s, int slen, const char* prefix)\n{\n while(*prefix && slen--)\n {\n if(*prefix++ != *s++) return false;\n }\n\n return true;\n}\n\n\nbool starts_with(MemoryChunk::readonly_t chunk, const char* prefix)\n{\n return starts_with(chunk.data(), chunk.length(), prefix);\n}\n\nclass UriPathDispatcherHandler : public DispatcherHandlerBase\n{\n const char* prefix;\n IMessageObserver& observer;\n\npublic:\n UriPathDispatcherHandler(const char* prefix, IMessageObserver& observer)\n : prefix(prefix),\n observer(observer)\n {\n\n }\n\n void on_header(Header header) OVERRIDE\n {\n if(!header.is_request()) interested(Never);\n }\n\n\n void on_option(number_t number, uint16_t length) OVERRIDE\n {\n if(is_always_interested())\n {\n observer.on_option(number, length);\n return;\n }\n }\n\n void on_option(number_t number,\n const MemoryChunk::readonly_t& option_value_part,\n bool last_chunk) OVERRIDE\n {\n \/\/ If we're always interested, then we've gone into pass thru mode\n if(is_always_interested())\n {\n observer.on_option(number, option_value_part, last_chunk);\n return;\n }\n\n switch(number)\n {\n case Option::UriPath:\n \/\/ FIX: I think we don't need this, because path is already\n \/\/ chunked out so 99% of the time we'll want to compare the\n \/\/ whole string not just the prefix - but I suppose comparing\n \/\/ the as a prefix doesn't hurt us\n if(starts_with(option_value_part, prefix))\n interested(Always);\n else\n \/\/ If we don't get what we want right away, then we are\n \/\/ no longer interested (more prefix style behavior)\n interested(Never);\n\n \/\/ TODO: We'll want to not only indicate interest but also\n \/\/ have a subordinate dispatcher to act on further observations\n break;\n }\n }\n\n void on_payload(const MemoryChunk::readonly_t& payload_part, bool last_chunk) OVERRIDE\n {\n ASSERT_WARN(true, is_always_interested(), \"Should only arrive here if interested\");\n\n observer.on_payload(payload_part, last_chunk);\n }\n};\n\nclass TestDispatcherHandler : public DispatcherHandlerBase\n{\n int option_test_number;\n\npublic:\n TestDispatcherHandler(InterestedEnum i = Always) :\n DispatcherHandlerBase(i),\n option_test_number(0) {}\n\n virtual void on_header(Header header) OVERRIDE\n {\n REQUIRE(header.is_request());\n }\n\n virtual void on_token(const MemoryChunk::readonly_t& token_part, bool last_chunk) OVERRIDE\n {\n FAIL(\"Should not reach here\");\n }\n\n virtual void on_option(number_t number, uint16_t length) OVERRIDE\n {\n switch(option_test_number)\n {\n case 0:\n REQUIRE(number == 270);\n REQUIRE(length == 1);\n break;\n\n case 1:\n REQUIRE(number == 271);\n REQUIRE(length == 2);\n break;\n }\n }\n\n virtual void on_option(number_t number, const MemoryChunk::readonly_t& option_value_part, bool last_chunk) OVERRIDE\n {\n switch(option_test_number++)\n {\n case 0:\n REQUIRE(option_value_part[0] == 3);\n REQUIRE(option_value_part.length() == 1);\n break;\n\n case 1:\n REQUIRE(option_value_part[0] == 4);\n REQUIRE(option_value_part[1] == 5);\n REQUIRE(option_value_part.length() == 2);\n break;\n }\n }\n\n virtual void on_payload(const MemoryChunk::readonly_t& payload_part, bool last_chunk) OVERRIDE\n {\n REQUIRE(payload_part[0] == buffer_16bit_delta[12]);\n REQUIRE(payload_part[payload_part.length()] == buffer_16bit_delta[12 + payload_part.length()]);\n }\n};\n\nextern dispatcher_handler_factory_fn test_sub_factories[];\n\nIDispatcherHandler* test_factory1(MemoryChunk chunk)\n{\n return new (chunk.data()) TestDispatcherHandler(IDispatcherHandler::Never);\n}\n\n\ntemplate <dispatcher_handler_factory_fn* factories, int count, const char* uri_path>\nIDispatcherHandler* uri_helper(MemoryChunk chunk)\n{\n MemoryChunk& uri_handler_chunk = chunk;\n MemoryChunk sub_handler_chunk = chunk.remainder(sizeof(UriPathDispatcherHandler));\n MemoryChunk sub_handler_inner_chunk = sub_handler_chunk.remainder(sizeof(FactoryDispatcherHandler));\n\n FactoryDispatcherHandler* fdh = new (sub_handler_chunk.data()) FactoryDispatcherHandler(\n sub_handler_inner_chunk,\n factories, count);\n\n return new (uri_handler_chunk.data()) UriPathDispatcherHandler(uri_path, *fdh);\n}\n\nIDispatcherHandler* test_factory2(MemoryChunk chunk)\n{\n MemoryChunk& uri_handler_chunk = chunk;\n MemoryChunk v1_handler_chunk = chunk.remainder(sizeof(UriPathDispatcherHandler));\n MemoryChunk v1_handler_inner_chunk = v1_handler_chunk.remainder(sizeof(FactoryDispatcherHandler));\n\n FactoryDispatcherHandler* fdh = new (v1_handler_chunk.data()) FactoryDispatcherHandler(\n v1_handler_inner_chunk,\n test_sub_factories, 1);\n\n \/\/ TODO: will need some way to invoke fdh destructor\n \/\/return new (uri_handler_chunk.data()) UriPathDispatcherHandler(\"v1\", *fdh);\n \/\/ TEST instead of v1 to work with our existing test data\n return new (uri_handler_chunk.data()) UriPathDispatcherHandler(\"OLD_TEST\", *fdh);\n}\n\nextern CONSTEXPR char TEST_FACTORY4_NAME[] = \"TEST\";\n\ndispatcher_handler_factory_fn test_factories[] =\n{\n test_factory1,\n test_factory2,\n uri_helper<test_sub_factories, 1, TEST_FACTORY4_NAME>\n};\n\n\nclass TestDispatcherHandler2 : public DispatcherHandlerBase\n{\npublic:\n void on_payload(const MemoryChunk::readonly_t& payload_part,\n bool last_chunk) OVERRIDE\n {\n REQUIRE(payload_part[0] == 0x10);\n REQUIRE(payload_part[1] == 0x11);\n REQUIRE(payload_part[2] == 0x12);\n REQUIRE(payload_part.length() == 7);\n }\n};\n\nIDispatcherHandler* test_sub_factory1(MemoryChunk chunk)\n{\n static TestDispatcherHandler2 handler;\n\n \/\/ To be v1\/path1\n \/\/return new (chunk.data()) UriPathDispatcherHandler(\"path1\", handler);\n \/\/ TEST\/POS to work with our existing test data\n return new (chunk.data()) UriPathDispatcherHandler(\"POS\", handler);\n}\n\ndispatcher_handler_factory_fn test_sub_factories[] =\n{\n test_sub_factory1\n};\n\nTEST_CASE(\"CoAP dispatcher tests\", \"[coap-dispatcher]\")\n{\n SECTION(\"Test 1\")\n {\n MemoryChunk chunk(buffer_16bit_delta, sizeof(buffer_16bit_delta));\n\n TestDispatcherHandler dispatcherHandler;\n Dispatcher dispatcher;\n \/\/layer3::MemoryChunk<128> chunk;\n\n dispatcher.head(&dispatcherHandler);\n dispatcher.dispatch(chunk);\n\n\n }\n SECTION(\"Factory\")\n {\n MemoryChunk chunk(buffer_plausible, sizeof(buffer_plausible));\n\n \/\/ in-place new holder\n layer3::MemoryChunk<128> dispatcherBuffer;\n\n FactoryDispatcherHandler fdh(dispatcherBuffer, test_factories, 3);\n Dispatcher dispatcher;\n\n \/\/ doesn't fully test new UriPath handler because TestDispatcherHandler\n \/\/ is not stateless (and shouldn't be expected to be) but because of that\n \/\/ setting it to \"Currently\" makes it unable to test its own options properly\n dispatcher.head(&fdh);\n dispatcher.dispatch(chunk);\n }\n}<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2017> <Thomas Ballenthin>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE linux auth test\n\n#include <boost\/test\/unit_test.hpp>\n#include <crypt.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <stdio.h>\n#include <string>\n\n#include \"authenticate.h\"\n#include \"json\/cJSON.h\"\n\nstatic std::string create_temp_copy_of_file(std::string source_filename, std::string filename_apendix)\n{\n\tstd::string destination_filename(source_filename);\n\tdestination_filename.append(filename_apendix);\n\n\tstd::ifstream source(source_filename.c_str(), std::ios::binary);\n\tstd::ofstream dest(destination_filename.c_str(), std::ios::binary);\n\n\tBOOST_REQUIRE_MESSAGE(source != NULL, \"Can't open source file: \" << source_filename);\n\tBOOST_REQUIRE_MESSAGE(dest != NULL, \"Can't open destination file: \" << destination_filename);\n\tdest << source.rdbuf();\n\n\tsource.close();\n\tdest.close();\n\n\treturn destination_filename;\n}\n\nstruct F {\n\tF()\n\t{\n\t\tint response = load_passwd_data(\"input_data\/passwd_std.json\");\n\t\tBOOST_REQUIRE_MESSAGE(response == 0, \"Loading password file failed.\");\n\t}\n\n\t~F()\n\t{\n\t\tfree_passwd_data();\n\t}\n};\n\nBOOST_AUTO_TEST_CASE(check_load_passwd_data_error_paths)\n{\n\tint response = load_passwd_data(NULL);\n\tBOOST_CHECK_MESSAGE(response == 0, \"Expected 0 as return value when calling load_passwd_data(NULL).\");\n\n\tresponse = load_passwd_data(\"*\/___\/\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when calling realpath with '*\/___\/'.\");\n\n\tresponse = load_passwd_data(\"some_non_existing_file_641587976.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non-existing file.\");\n\n\tresponse = load_passwd_data(\"input_data\/no_json.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non JSON file.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_user_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without user data.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_fetch_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as fetch group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_set_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as set group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_call_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as callgroup.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_json_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without any JSON.\");\n}\n\nBOOST_FIXTURE_TEST_CASE(check_credentials, F)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\tchar passwd_to_null[] = \"doe\";\n\tchar user_no_passwd[] = \"john-no_passwd\";\n\tchar user_passwd_no_string[] = \"john-pw_no_string\";\n\tchar unknown_user[] = \"mister_x\";\n\n\tconst cJSON *response1 = credentials_ok(NULL, NULL);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user_name nor passwd is provided.\");\n\n\tconst cJSON *response2 = credentials_ok(username, NULL);\n\tBOOST_CHECK_MESSAGE(response2 == NULL, \"Response should be NULL when no passwd is provided.\");\n\n\tconst cJSON *response3 = credentials_ok(NULL, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response3 == NULL, \"Response should be NULL when no user_name is provided.\");\n\tBOOST_CHECK_MESSAGE(std::strcmp(passwd_to_null, \"\\0\\0\\0\"), \"The password has not been zeroed. Instead it was:\\\"\" << passwd << \"\\\".\");\n\n\tconst cJSON *response4 = credentials_ok(user_no_passwd, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response4 == NULL, \"Response should be NULL when no password is given in the user database.\");\n\n\tconst cJSON *response5 = credentials_ok(user_passwd_no_string, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response5 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response6 = credentials_ok(unknown_user, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response6 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response7 = credentials_ok(username, passwd);\n\tBOOST_REQUIRE_MESSAGE(response7 != NULL, \"User authentication failed even with correct credentials.\");\n}\n\nBOOST_AUTO_TEST_CASE(check_credentials_no_user_data_loaded)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tconst cJSON *response1 = credentials_ok(username, passwd);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user data is loaded in before.\");\n}\n\nBOOST_AUTO_TEST_CASE(test_copying)\n{\n\tstd::string temporarily_file = create_temp_copy_of_file(\"input_data\/passwd_std.json\", \"_temp\");\n}\n<commit_msg>linux_auth_file_test: add random stub methods<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) <2017> <Thomas Ballenthin>\n *\n * Permission is hereby granted, free of charge, to any person obtaining\n * a copy of this software and associated documentation files (the\n * \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to\n * the following conditions:\n *\n * The above copyright notice and this permission notice shall be\n * included in all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\/\n\n#define BOOST_TEST_DYN_LINK\n#define BOOST_TEST_MAIN\n#define BOOST_TEST_MODULE linux auth test\n\n#include <boost\/test\/unit_test.hpp>\n#include <crypt.h>\n#include <fstream>\n#include <iostream>\n#include <sstream>\n#include <stdio.h>\n#include <string>\n\n#include \"authenticate.h\"\n#include \"json\/cJSON.h\"\n\nextern \"C\" {\n\tint cjet_timer_init(struct cjet_timer *timer, struct eventloop *loop){\n\t\t(void) timer;\n\t\t(void) loop;\n\t\treturn 0;\n\t}\n\n\tvoid cjet_timer_destroy(struct cjet_timer *timer){\n\t\t(void) timer;\n\t}\n\n\tvoid cjet_get_random_bytes(void *bytes, size_t num_bytes)\n\t{\n\t\tBOOST_REQUIRE_MESSAGE(false,\"the cjet_get_random_bytes function needs to be implemented, when it is actually used.\");\n\t\t(void) bytes;\n\t\t(void) num_bytes;\n\t}\n}\n\nstatic std::string create_temp_copy_of_file(std::string source_filename, std::string filename_apendix)\n{\n\tstd::string destination_filename(source_filename);\n\tdestination_filename.append(filename_apendix);\n\n\tstd::ifstream source(source_filename.c_str(), std::ios::binary);\n\tstd::ofstream dest(destination_filename.c_str(), std::ios::binary);\n\n\tBOOST_REQUIRE_MESSAGE(source != NULL, \"Can't open source file: \" << source_filename);\n\tBOOST_REQUIRE_MESSAGE(dest != NULL, \"Can't open destination file: \" << destination_filename);\n\tdest << source.rdbuf();\n\n\tsource.close();\n\tdest.close();\n\n\treturn destination_filename;\n}\n\nstruct F {\n\tF()\n\t{\n\t\tint response = load_passwd_data(\"input_data\/passwd_std.json\");\n\t\tBOOST_REQUIRE_MESSAGE(response == 0, \"Loading password file failed.\");\n\t}\n\n\t~F()\n\t{\n\t\tfree_passwd_data();\n\t}\n};\n\nBOOST_AUTO_TEST_CASE(check_load_passwd_data_error_paths)\n{\n\tint response = load_passwd_data(NULL);\n\tBOOST_CHECK_MESSAGE(response == 0, \"Expected 0 as return value when calling load_passwd_data(NULL).\");\n\n\tresponse = load_passwd_data(\"* \/___\/\"); \/\/TODO - leerzeichen\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when calling realpath with '* \/___\/'.\");\n\n\tresponse = load_passwd_data(\"some_non_existing_file_641587976.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non-existing file.\");\n\n\tresponse = load_passwd_data(\"input_data\/no_json.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening non JSON file.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_user_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without user data.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_fetch_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as fetch group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_set_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as set group.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_call_group_no_array.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without array as callgroup.\");\n\n\tresponse = load_passwd_data(\"input_data\/passwd_no_json_data.json\");\n\tBOOST_CHECK_MESSAGE(response == -1, \"Error expected when opening passwd file without any JSON.\");\n}\n\nBOOST_FIXTURE_TEST_CASE(check_credentials, F)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tchar unknown_user[] = \"mister_x\";\n\tchar passwd_to_null[] = \"doe\";\n\n\tchar user_no_passwd[] = \"john-no_passwd\";\n\tchar user_passwd_no_string[] = \"john-pw_no_string\";\n\n\n\tconst cJSON *response1 = credentials_ok(NULL, NULL);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user_name nor passwd is provided.\");\n\n\tconst cJSON *response2 = credentials_ok(username, NULL);\n\tBOOST_CHECK_MESSAGE(response2 == NULL, \"Response should be NULL when no passwd is provided.\");\n\n\tconst cJSON *response3 = credentials_ok(NULL, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response3 == NULL, \"Response should be NULL when no user_name is provided.\");\n\tBOOST_CHECK_MESSAGE(std::strcmp(passwd_to_null, \"\\0\\0\\0\"), \"The password has not been zeroed. Instead it was:\\\"\" << passwd << \"\\\".\");\n\n\tconst cJSON *response4 = credentials_ok(user_no_passwd, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response4 == NULL, \"Response should be NULL when no password is given in the user database.\");\n\n\tconst cJSON *response5 = credentials_ok(user_passwd_no_string, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response5 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response6 = credentials_ok(unknown_user, passwd_to_null);\n\tBOOST_CHECK_MESSAGE(response6 == NULL, \"Response should be NULL when password in database is not a string.\");\n\n\tconst cJSON *response7 = credentials_ok(username, passwd);\n\tBOOST_REQUIRE_MESSAGE(response7 != NULL, \"User authentication failed even with correct credentials.\");\n}\n\nBOOST_AUTO_TEST_CASE(check_credentials_no_user_data_loaded)\n{\n\tchar username[] = \"john\";\n\tchar passwd[] = \"doe\";\n\n\tconst cJSON *response1 = credentials_ok(username, passwd);\n\tBOOST_CHECK_MESSAGE(response1 == NULL, \"Response should be NULL when no user data is loaded in before.\");\n}\n\nBOOST_AUTO_TEST_CASE(test_copying)\n{\n\tstd::string temporarily_file = create_temp_copy_of_file(\"input_data\/passwd_std.json\", \"_temp\");\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <QtGui\/QGuiApplication>\n#include <QQmlContext>\n#include <QStateMachine>\n#include <QDebug>\n#include <memory>\n#include \".\/window.h\"\n#include \".\/scene.h\"\n#include \".\/nodes.h\"\n#include \".\/label_node.h\"\n#include \".\/input\/invoke_manager.h\"\n#include \".\/input\/signal_manager.h\"\n#include \".\/input\/scxml_importer.h\"\n#include \".\/mouse_shape_controller.h\"\n#include \".\/labeller_model.h\"\n#include \".\/labels_model.h\"\n#include \".\/labelling\/labels.h\"\n#include \".\/picking_controller.h\"\n#include \".\/forces_visualizer_node.h\"\n#include \".\/test_scene_creator.h\"\n\nvoid onLabelChangedUpdateLabelNodes(std::shared_ptr<Nodes> nodes,\n Labels::Action action, const Label &label)\n{\n auto labelNodes = nodes->getLabelNodes();\n auto labelNode = std::find_if(labelNodes.begin(), labelNodes.end(),\n [label](std::shared_ptr<LabelNode> labelNode)\n {\n return labelNode->label.id == label.id;\n });\n\n if (labelNode == labelNodes.end())\n {\n nodes->addNode(std::make_shared<LabelNode>(label));\n }\n else if (action == Labels::Action::Delete)\n {\n nodes->removeNode(*labelNode);\n }\n else\n {\n (*labelNode)->label = label;\n }\n};\n\nint main(int argc, char **argv)\n{\n qputenv(\"QT_MESSAGE_PATTERN\",\n QString(\"%{time [yyyy'-'MM'-'dd' 'hh':'mm':'ss]} - %{threadid} \"\n \"%{if-category}%{category}: %{endif}%{message}\").toUtf8());\n if (qgetenv(\"QT_LOGGING_CONF\").size() == 0)\n qputenv(\"QT_LOGGING_CONF\", \"..\/config\/logging.ini\");\n\n QGuiApplication application(argc, argv);\n\n auto invokeManager = std::shared_ptr<InvokeManager>(new InvokeManager());\n auto nodes = std::make_shared<Nodes>();\n auto labels = std::make_shared<Labels>();\n auto labeller = std::make_shared<Forces::Labeller>(labels);\n auto forcesVisualizerNode = std::make_shared<ForcesVisualizerNode>(labeller);\n nodes->addNode(forcesVisualizerNode);\n\n TestSceneCreator sceneCreator(nodes, labels);\n sceneCreator.create();\n auto scene = std::make_shared<Scene>(invokeManager, nodes, labels, labeller);\n\n auto unsubscribeLabelChanges = labels->subscribe(\n std::bind(&onLabelChangedUpdateLabelNodes, nodes, std::placeholders::_1,\n std::placeholders::_2));\n\n Window window(scene);\n window.setResizeMode(QQuickView::SizeRootObjectToView);\n window.rootContext()->setContextProperty(\"window\", &window);\n window.rootContext()->setContextProperty(\"nodes\", nodes.get());\n\n MouseShapeController mouseShapeController;\n PickingController pickingController(scene);\n\n LabellerModel labellerModel(labeller);\n labellerModel.connect(&labellerModel, &LabellerModel::isVisibleChanged,\n [&labellerModel, &nodes, &forcesVisualizerNode]()\n {\n if (labellerModel.getIsVisible())\n nodes->addNode(forcesVisualizerNode);\n else\n nodes->removeNode(forcesVisualizerNode);\n });\n window.rootContext()->setContextProperty(\"labeller\", &labellerModel);\n\n LabelsModel labelsModel(labels, pickingController);\n window.rootContext()->setContextProperty(\"labels\", &labelsModel);\n window.setSource(QUrl(\"qrc:ui.qml\"));\n\n auto signalManager = std::shared_ptr<SignalManager>(new SignalManager());\n ScxmlImporter importer(QUrl::fromLocalFile(\"config\/states.xml\"),\n invokeManager, signalManager);\n\n invokeManager->addHandler(&window);\n invokeManager->addHandler(\"mouseShape\", &mouseShapeController);\n invokeManager->addHandler(\"picking\", &pickingController);\n signalManager->addSender(\"KeyboardEventSender\", &window);\n signalManager->addSender(\"labels\", &labelsModel);\n\n auto stateMachine = importer.import();\n\n \/\/ just for printCurrentState slot for debugging\n window.stateMachine = stateMachine;\n\n stateMachine->start();\n\n window.show();\n\n auto resultCode = application.exec();\n\n unsubscribeLabelChanges();\n\n return resultCode;\n}\n<commit_msg>Log application start.<commit_after>#include <QtGui\/QGuiApplication>\n#include <QQmlContext>\n#include <QStateMachine>\n#include <QDebug>\n#include <memory>\n#include \".\/window.h\"\n#include \".\/scene.h\"\n#include \".\/nodes.h\"\n#include \".\/label_node.h\"\n#include \".\/input\/invoke_manager.h\"\n#include \".\/input\/signal_manager.h\"\n#include \".\/input\/scxml_importer.h\"\n#include \".\/mouse_shape_controller.h\"\n#include \".\/labeller_model.h\"\n#include \".\/labels_model.h\"\n#include \".\/labelling\/labels.h\"\n#include \".\/picking_controller.h\"\n#include \".\/forces_visualizer_node.h\"\n#include \".\/test_scene_creator.h\"\n\nvoid onLabelChangedUpdateLabelNodes(std::shared_ptr<Nodes> nodes,\n Labels::Action action, const Label &label)\n{\n auto labelNodes = nodes->getLabelNodes();\n auto labelNode = std::find_if(labelNodes.begin(), labelNodes.end(),\n [label](std::shared_ptr<LabelNode> labelNode)\n {\n return labelNode->label.id == label.id;\n });\n\n if (labelNode == labelNodes.end())\n {\n nodes->addNode(std::make_shared<LabelNode>(label));\n }\n else if (action == Labels::Action::Delete)\n {\n nodes->removeNode(*labelNode);\n }\n else\n {\n (*labelNode)->label = label;\n }\n};\n\nint main(int argc, char **argv)\n{\n qputenv(\"QT_MESSAGE_PATTERN\",\n QString(\"%{time [yyyy'-'MM'-'dd' 'hh':'mm':'ss]} - %{threadid} \"\n \"%{if-category}%{category}: %{endif}%{message}\").toUtf8());\n if (qgetenv(\"QT_LOGGING_CONF\").size() == 0)\n qputenv(\"QT_LOGGING_CONF\", \"..\/config\/logging.ini\");\n\n QGuiApplication application(argc, argv);\n\n qDebug() << \"Application start\";\n\n auto invokeManager = std::shared_ptr<InvokeManager>(new InvokeManager());\n auto nodes = std::make_shared<Nodes>();\n auto labels = std::make_shared<Labels>();\n auto labeller = std::make_shared<Forces::Labeller>(labels);\n auto forcesVisualizerNode = std::make_shared<ForcesVisualizerNode>(labeller);\n nodes->addNode(forcesVisualizerNode);\n\n TestSceneCreator sceneCreator(nodes, labels);\n sceneCreator.create();\n auto scene = std::make_shared<Scene>(invokeManager, nodes, labels, labeller);\n\n auto unsubscribeLabelChanges = labels->subscribe(\n std::bind(&onLabelChangedUpdateLabelNodes, nodes, std::placeholders::_1,\n std::placeholders::_2));\n\n Window window(scene);\n window.setResizeMode(QQuickView::SizeRootObjectToView);\n window.rootContext()->setContextProperty(\"window\", &window);\n window.rootContext()->setContextProperty(\"nodes\", nodes.get());\n\n MouseShapeController mouseShapeController;\n PickingController pickingController(scene);\n\n LabellerModel labellerModel(labeller);\n labellerModel.connect(&labellerModel, &LabellerModel::isVisibleChanged,\n [&labellerModel, &nodes, &forcesVisualizerNode]()\n {\n if (labellerModel.getIsVisible())\n nodes->addNode(forcesVisualizerNode);\n else\n nodes->removeNode(forcesVisualizerNode);\n });\n window.rootContext()->setContextProperty(\"labeller\", &labellerModel);\n\n LabelsModel labelsModel(labels, pickingController);\n window.rootContext()->setContextProperty(\"labels\", &labelsModel);\n window.setSource(QUrl(\"qrc:ui.qml\"));\n\n auto signalManager = std::shared_ptr<SignalManager>(new SignalManager());\n ScxmlImporter importer(QUrl::fromLocalFile(\"config\/states.xml\"),\n invokeManager, signalManager);\n\n invokeManager->addHandler(&window);\n invokeManager->addHandler(\"mouseShape\", &mouseShapeController);\n invokeManager->addHandler(\"picking\", &pickingController);\n signalManager->addSender(\"KeyboardEventSender\", &window);\n signalManager->addSender(\"labels\", &labelsModel);\n\n auto stateMachine = importer.import();\n\n \/\/ just for printCurrentState slot for debugging\n window.stateMachine = stateMachine;\n\n stateMachine->start();\n\n window.show();\n\n auto resultCode = application.exec();\n\n unsubscribeLabelChanges();\n\n return resultCode;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include \"traits_lite.hpp\" \/\/forward declaration of the traits\n\nnamespace etl {\n\ntemplate<typename Expr, std::size_t A>\nstruct aligned_allocator {\n template<typename T>\n static T* allocate(std::size_t size){\n auto required_bytes = sizeof(T) * size;\n auto offset = (A - 1) + sizeof(uintptr_t);\n auto orig = malloc(required_bytes + offset);\n\n if(!orig){\n return nullptr;\n }\n\n auto aligned = reinterpret_cast<void**>((reinterpret_cast<size_t>(orig) + offset) & ~(A - 1));\n aligned[-1] = orig;\n return reinterpret_cast<T*>(aligned);\n }\n\n template<typename T>\n static void release(T* ptr){\n free((reinterpret_cast<void**>(ptr))[-1]);\n }\n};\n\ntemplate<typename T>\nauto allocate(std::size_t size){\n return std::make_unique<T[]>(size);\n}\n\ntemplate<typename T>\nT* aligned_allocate(std::size_t size){\n return aligned_allocator<void, 32>::allocate<T>(size);\n}\n\ntemplate<typename T>\nvoid aligned_release(T* ptr){\n return aligned_allocator<void, 32>::release<T>(ptr);\n}\n\n} \/\/end of namespace etl\n<commit_msg>Fix includes<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2015 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n#pragma once\n\n#include <memory>\n\n#include \"traits_lite.hpp\" \/\/forward declaration of the traits\n\nnamespace etl {\n\ntemplate<typename Expr, std::size_t A>\nstruct aligned_allocator {\n template<typename T>\n static T* allocate(std::size_t size){\n auto required_bytes = sizeof(T) * size;\n auto offset = (A - 1) + sizeof(uintptr_t);\n auto orig = malloc(required_bytes + offset);\n\n if(!orig){\n return nullptr;\n }\n\n auto aligned = reinterpret_cast<void**>((reinterpret_cast<size_t>(orig) + offset) & ~(A - 1));\n aligned[-1] = orig;\n return reinterpret_cast<T*>(aligned);\n }\n\n template<typename T>\n static void release(T* ptr){\n free((reinterpret_cast<void**>(ptr))[-1]);\n }\n};\n\ntemplate<typename T>\nauto allocate(std::size_t size){\n return std::make_unique<T[]>(size);\n}\n\ntemplate<typename T>\nT* aligned_allocate(std::size_t size){\n return aligned_allocator<void, 32>::allocate<T>(size);\n}\n\ntemplate<typename T>\nvoid aligned_release(T* ptr){\n return aligned_allocator<void, 32>::release<T>(ptr);\n}\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/ mapnik\n#include <mapnik\/text\/font_feature_settings.hpp>\n#include <mapnik\/config_error.hpp>\n\n\/\/ boost\n#include <boost\/spirit\/include\/qi.hpp>\n#include <boost\/bind.hpp>\n\n\/\/ stl\n#include <algorithm>\n#include <cctype>\n#include <sstream>\n\nnamespace mapnik\n{\n\nfont_feature_settings::font_feature_settings(std::string const& features)\n : features_()\n{\n from_string(features);\n}\n\nfont_feature_settings::font_feature_settings()\n : features_() {}\n\nvoid font_feature_settings::from_string(std::string const& features)\n{\n features_.clear();\n\n if (std::all_of(features.begin(), features.end(), isspace)) return;\n\n namespace qi = boost::spirit::qi;\n qi::char_type char_;\n qi::as_string_type as_string;\n\n \/\/ Call correct overload.\n void (font_feature_settings::*append)(std::string const&) = &font_feature_settings::append;\n\n if (!qi::parse(features.begin(), features.end(), as_string[+(char_ - ',')][boost::bind(append, this, ::_1)] % ','))\n {\n throw config_error(\"failed to parse font-feature-settings: '\" + features + \"'\");\n }\n}\n\nstd::string font_feature_settings::to_string() const\n{\n std::ostringstream output;\n constexpr size_t buffsize = 128;\n char buff[buffsize];\n bool first = true;\n\n for (auto feature : features_)\n {\n if (!first)\n {\n output << \", \";\n first = false;\n }\n hb_feature_to_string(&feature, buff, buffsize);\n output << buff;\n }\n\n return output.str();\n}\n\nvoid font_feature_settings::append(std::string const& feature)\n{\n features_.emplace_back();\n feature_iterator current_feature = features_.end() - 1;\n\n if (!hb_feature_from_string(feature.c_str(), feature.length(), &*current_feature))\n {\n features_.erase(current_feature);\n throw config_error(\"failed to parse font-feature-settings: '\" + feature + \"'\");\n }\n}\n\n}\n\n<commit_msg>use c++11 features over boost when available<commit_after>\/*****************************************************************************\n *\n * This file is part of Mapnik (c++ mapping toolkit)\n *\n * Copyright (C) 2014 Artem Pavlenko\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n *\n *****************************************************************************\/\n\n\/\/ mapnik\n#include <mapnik\/text\/font_feature_settings.hpp>\n#include <mapnik\/config_error.hpp>\n\n\/\/ boost\n#include <boost\/spirit\/include\/qi.hpp>\n\n\/\/ stl\n#include <algorithm>\n#include <cctype>\n#include <sstream>\n#include <functional>\n\nnamespace mapnik\n{\n\nfont_feature_settings::font_feature_settings(std::string const& features)\n : features_()\n{\n from_string(features);\n}\n\nfont_feature_settings::font_feature_settings()\n : features_() {}\n\nvoid font_feature_settings::from_string(std::string const& features)\n{\n features_.clear();\n\n if (std::all_of(features.begin(), features.end(), isspace)) return;\n\n namespace qi = boost::spirit::qi;\n qi::char_type char_;\n qi::as_string_type as_string;\n\n \/\/ Call correct overload.\n using std::placeholders::_1;\n void (font_feature_settings::*append)(std::string const&) = &font_feature_settings::append;\n\n if (!qi::parse(features.begin(), features.end(), as_string[+(char_ - ',')][std::bind(append, this, _1)] % ','))\n {\n throw config_error(\"failed to parse font-feature-settings: '\" + features + \"'\");\n }\n}\n\nstd::string font_feature_settings::to_string() const\n{\n std::ostringstream output;\n constexpr size_t buffsize = 128;\n char buff[buffsize];\n bool first = true;\n\n for (auto feature : features_)\n {\n if (!first)\n {\n output << \", \";\n first = false;\n }\n hb_feature_to_string(&feature, buff, buffsize);\n output << buff;\n }\n\n return output.str();\n}\n\nvoid font_feature_settings::append(std::string const& feature)\n{\n features_.emplace_back();\n feature_iterator current_feature = features_.end() - 1;\n\n if (!hb_feature_from_string(feature.c_str(), feature.length(), &*current_feature))\n {\n features_.erase(current_feature);\n throw config_error(\"failed to parse font-feature-settings: '\" + feature + \"'\");\n }\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/**\n\t@file\n\t@brief unit test class\n\n\tCopyright (C) 2008 Cybozu Labs, Inc., all rights reserved.\n*\/\n\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <list>\n#include <iostream>\n#include <utility>\n#if defined(_MSC_VER) && (MSC_VER <= 1500)\n\t#include <cybozu\/inttype.hpp>\n#else\n\t#include <stdint.h>\n#endif\n\nnamespace cybozu { namespace test {\n\nclass AutoRun {\n\ttypedef void (*Func)();\n\ttypedef std::list<std::pair<const char*, Func> > UnitTestList;\npublic:\n\tAutoRun()\n\t\t: init_(0)\n\t\t, term_(0)\n\t\t, okCount_(0)\n\t\t, ngCount_(0)\n\t\t, exceptionCount_(0)\n\t{\n\t}\n\tvoid setup(Func init, Func term)\n\t{\n\t\tinit_ = init;\n\t\tterm_ = term;\n\t}\n\tvoid append(const char *name, Func func)\n\t{\n\t\tlist_.push_back(std::make_pair(name, func));\n\t}\n\tvoid set(bool isOK)\n\t{\n\t\tif (isOK) {\n\t\t\tokCount_++;\n\t\t} else {\n\t\t\tngCount_++;\n\t\t}\n\t}\n\tstd::string getBaseName(const std::string& name) const\n\t{\n#ifdef _WIN32\n\t\tconst char sep = '\\\\';\n#else\n\t\tconst char sep = '\/';\n#endif\n\t\tsize_t pos = name.find_last_of(sep);\n\t\tstd::string ret = name.substr(pos + 1);\n\t\tpos = ret.find('.');\n\t\treturn ret.substr(0, pos);\n\t}\n\tint run(int, char *argv[])\n\t{\n\t\tstd::string msg;\n\t\ttry {\n\t\t\tif (init_) init_();\n\t\t\tfor (UnitTestList::const_iterator i = list_.begin(), ie = list_.end(); i != ie; ++i) {\n\t\t\t\tstd::cout << \"ctest:module=\" << i->first << std::endl;\n\t\t\t\ttry {\n\t\t\t\t\t(i->second)();\n\t\t\t\t} catch (std::exception& e) {\n\t\t\t\t\texceptionCount_++;\n\t\t\t\t\tstd::cout << \"ctest: \" << i->first << \" is stopped by exception \" << e.what() << std::endl;\n\t\t\t\t} catch (...) {\n\t\t\t\t\texceptionCount_++;\n\t\t\t\t\tstd::cout << \"ctest: \" << i->first << \" is stopped by unknown exception\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (term_) term_();\n\t\t} catch (std::exception& e) {\n\t\t\tmsg = std::string(\"ctest:err:\") + e.what();\n\t\t} catch (...) {\n\t\t\tmsg = \"ctest:err: catch unknown exception\";\n\t\t}\n\t\tfflush(stdout);\n\t\tif (msg.empty()) {\n\t\t\tstd::cout << \"ctest:name=\" << getBaseName(*argv)\n\t\t\t\t\t << \", module=\" << list_.size()\n\t\t\t\t\t << \", total=\" << (okCount_ + ngCount_ + exceptionCount_)\n\t\t\t\t\t << \", ok=\" << okCount_\n\t\t\t\t\t << \", ng=\" << ngCount_\n\t\t\t\t\t << \", exception=\" << exceptionCount_ << std::endl;\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tstd::cout << msg << std::endl;\n\t\t\treturn 1;\n\t\t}\n\t}\n\tstatic inline AutoRun& getInstance()\n\t{\n\t\tstatic AutoRun instance;\n\t\treturn instance;\n\t}\nprivate:\n\tFunc init_;\n\tFunc term_;\n\tint okCount_;\n\tint ngCount_;\n\tint exceptionCount_;\n\tUnitTestList list_;\n};\n\nstatic AutoRun& autoRun = AutoRun::getInstance();\n\ninline void test(bool ret, const std::string& msg, const std::string& param, const char *file, int line)\n{\n\tautoRun.set(ret);\n\tif (!ret) {\n\t\tprintf(\"%s(%d):ctest:%s(%s);\\n\", file, line, msg.c_str(), param.c_str());\n\t}\n}\n\ntemplate<typename T, typename U>\nbool isEqual(const T& lhs, const U& rhs)\n{\n\treturn lhs == rhs;\n}\n\n\/\/ avoid warning of comparision of integers of different signs\ninline bool isEqual(size_t lhs, int rhs)\n{\n\treturn lhs == size_t(rhs);\n}\ninline bool isEqual(int lhs, size_t rhs)\n{\n\treturn size_t(lhs) == rhs;\n}\ninline bool isEqual(const char *lhs, const char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(char *lhs, const char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(const char *lhs, char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(char *lhs, char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\n\/\/ avoid to compare float directly\ninline bool isEqual(float lhs, float rhs)\n{\n\tunion fi {\n\t\tfloat f;\n\t\tuint32_t i;\n\t} lfi, rfi;\n\tlfi.f = lhs;\n\trfi.f = rhs;\n\treturn lfi.i == rfi.i;\n}\n\/\/ avoid to compare double directly\ninline bool isEqual(double lhs, double rhs)\n{\n\tunion di {\n\t\tdouble d;\n\t\tuint64_t i;\n\t} ldi, rdi;\n\tldi.d = lhs;\n\trdi.d = rhs;\n\treturn ldi.i == rdi.i;\n}\n\n} } \/\/ cybozu::test\n\n#ifndef CYBOZU_TEST_DISABLE_AUTO_RUN\nint main(int argc, char *argv[])\n{\n\treturn cybozu::test::autoRun.run(argc, argv);\n}\n#endif\n\n\/**\n\talert if !x\n\t@param x [in]\n*\/\n#define CYBOZU_TEST_ASSERT(x) cybozu::test::test(!!(x), \"CYBOZU_TEST_ASSERT\", #x, __FILE__, __LINE__)\n\n\/**\n\talert if x != y\n\t@param x [in]\n\t@param y [in]\n*\/\n#define CYBOZU_TEST_EQUAL(x, y) { \\\n\tbool eq = cybozu::test::isEqual(x, y); \\\n\tcybozu::test::test(eq, \"CYBOZU_TEST_EQUAL\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!eq) { \\\n\t\tstd::cout << \"ctest: lhs=\" << (x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << (y) << std::endl; \\\n\t} \\\n}\n\/**\n\talert if fabs(x, y) >= eps\n\t@param x [in]\n\t@param y [in]\n*\/\n#define CYBOZU_TEST_NEAR(x, y, eps) { \\\n\tbool isNear = fabs((x) - (y)) < eps; \\\n\tcybozu::test::test(isNear, \"CYBOZU_TEST_NEAR\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!isNear) { \\\n\t\tstd::cout << \"ctest: lhs=\" << (x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << (y) << std::endl; \\\n\t} \\\n}\n\n#define CYBOZU_TEST_EQUAL_POINTER(x, y) { \\\n\tbool eq = x == y; \\\n\tcybozu::test::test(eq, \"CYBOZU_TEST_EQUAL_POINTER\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!eq) { \\\n\t\tstd::cout << \"ctest: lhs=\" << static_cast<const void*>(x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << static_cast<const void*>(y) << std::endl; \\\n\t} \\\n}\n\/**\n\talert if x[] != y[]\n\t@param x [in]\n\t@param y [in]\n\t@param n [in]\n*\/\n#define CYBOZU_TEST_EQUAL_ARRAY(x, y, n) { \\\n\tfor (size_t i = 0, ie = (size_t)(n); i < ie; i++) { \\\n\t\tbool eq = cybozu::test::isEqual((x)[i], (y)[i]); \\\n\t\tcybozu::test::test(eq, \"CYBOZU_TEST_EQUAL_ARRAY\", #x \", \" #y \", \" #n, __FILE__, __LINE__); \\\n\t\tif (!eq) { \\\n\t\t\tstd::cout << \"ctest: i=\" << i << std::endl; \\\n\t\t\tstd::cout << \"ctest: lhs=\" << (x)[i] << std::endl; \\\n\t\t\tstd::cout << \"ctest: rhs=\" << (y)[i] << std::endl; \\\n\t\t} \\\n\t} \\\n}\n\n\/**\n\talways alert\n\t@param msg [in]\n*\/\n#define CYBOZU_TEST_FAIL(msg) cybozu::test::test(false, \"CYBOZU_TEST_FAIL\", msg, __FILE__, __LINE__)\n\n\/**\n\tverify message in exception\n*\/\n#define CYBOZU_TEST_EXCEPTION_MESSAGE(statement, Exception, msg) \\\n{ \\\n\tint ret = 0; \\\n\tstd::string errMsg; \\\n\ttry { \\\n\t\tstatement; \\\n\t\tret = 1; \\\n\t} catch (const Exception& e) { \\\n\t\terrMsg = e.what(); \\\n\t\tif (errMsg.find(msg) == std::string::npos) { \\\n\t\t\tret = 2; \\\n\t\t} \\\n\t} catch (...) { \\\n\t\tret = 3; \\\n\t} \\\n\tif (ret) { \\\n\t\tcybozu::test::test(false, \"CYBOZU_TEST_EXCEPTION_MESSAGE\", #statement \", \" #Exception \", \" #msg, __FILE__, __LINE__); \\\n\t\tif (ret == 1) { \\\n\t\t\tstd::cout << \"ctest: no exception\" << std::endl; \\\n\t\t} else if (ret == 2) { \\\n\t\t\tstd::cout << \"ctest: bad exception msg:\" << errMsg << std::endl; \\\n\t\t} else { \\\n\t\t\tstd::cout << \"ctest: unexpected exception\" << std::endl; \\\n\t\t} \\\n\t} else { \\\n\t\tcybozu::test::autoRun.set(true); \\\n\t} \\\n}\n\n#define CYBOZU_TEST_EXCEPTION(statement, Exception) \\\n{ \\\n\tint ret = 0; \\\n\ttry { \\\n\t\tstatement; \\\n\t\tret = 1; \\\n\t} catch (const Exception&) { \\\n\t} catch (...) { \\\n\t\tret = 2; \\\n\t} \\\n\tif (ret) { \\\n\t\tcybozu::test::test(false, \"CYBOZU_TEST_EXCEPTION\", #statement \", \" #Exception, __FILE__, __LINE__); \\\n\t\tif (ret == 1) { \\\n\t\t\tstd::cout << \"ctest: no exception\" << std::endl; \\\n\t\t} else { \\\n\t\t\tstd::cout << \"ctest: unexpected exception\" << std::endl; \\\n\t\t} \\\n\t} else { \\\n\t\tcybozu::test::autoRun.set(true); \\\n\t} \\\n}\n\n\/**\n\tverify statement does not throw\n*\/\n#define CYBOZU_TEST_NO_EXCEPTION(statement) \\\ntry { \\\n\tstatement; \\\n\tcybozu::test::autoRun.set(true); \\\n} catch (...) { \\\n\tcybozu::test::test(false, \"CYBOZU_TEST_NO_EXCEPTION\", #statement, __FILE__, __LINE__); \\\n}\n\n\/**\n\tappend auto unit test\n\t@param name [in] module name\n*\/\n#define CYBOZU_TEST_AUTO(name) \\\nvoid cybozu_test_ ## name(); \\\nstruct cybozu_test_local_ ## name { \\\n\tcybozu_test_local_ ## name() \\\n\t{ \\\n\t\tcybozu::test::autoRun.append(#name, cybozu_test_ ## name); \\\n\t} \\\n} cybozu_test_local_instance_ ## name; \\\nvoid cybozu_test_ ## name()\n\n\/**\n\tappend auto unit test with fixture\n\t@param name [in] module name\n*\/\n#define CYBOZU_TEST_AUTO_WITH_FIXTURE(name, Fixture) \\\nvoid cybozu_test_ ## name(); \\\nvoid cybozu_test_real_ ## name() \\\n{ \\\n\tFixture f; \\\n\tcybozu_test_ ## name(); \\\n} \\\nstruct cybozu_test_local_ ## name { \\\n\tcybozu_test_local_ ## name() \\\n\t{ \\\n\t\tcybozu::test::autoRun.append(#name, cybozu_test_real_ ## name); \\\n\t} \\\n} cybozu_test_local_instance_ ## name; \\\nvoid cybozu_test_ ## name()\n\n\/**\n\tsetup fixture\n\t@param Fixture [in] class name of fixture\n\t@note cstr of Fixture is called before test and dstr of Fixture is called after test\n*\/\n#define CYBOZU_TEST_SETUP_FIXTURE(Fixture) \\\nFixture *cybozu_test_local_fixture; \\\nvoid cybozu_test_local_init() \\\n{ \\\n\tcybozu_test_local_fixture = new Fixture(); \\\n} \\\nvoid cybozu_test_local_term() \\\n{ \\\n\tdelete cybozu_test_local_fixture; \\\n} \\\nstruct cybozu_test_local_fixture_setup_ { \\\n\tcybozu_test_local_fixture_setup_() \\\n\t{ \\\n\t\tcybozu::test::autoRun.setup(cybozu_test_local_init, cybozu_test_local_term); \\\n\t} \\\n} cybozu_test_local_fixture_setup_instance_;\n<commit_msg>avoid conflict of var<commit_after>#pragma once\n\/**\n\t@file\n\t@brief unit test class\n\n\tCopyright (C) 2008 Cybozu Labs, Inc., all rights reserved.\n*\/\n\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <list>\n#include <iostream>\n#include <utility>\n#if defined(_MSC_VER) && (MSC_VER <= 1500)\n\t#include <cybozu\/inttype.hpp>\n#else\n\t#include <stdint.h>\n#endif\n\nnamespace cybozu { namespace test {\n\nclass AutoRun {\n\ttypedef void (*Func)();\n\ttypedef std::list<std::pair<const char*, Func> > UnitTestList;\npublic:\n\tAutoRun()\n\t\t: init_(0)\n\t\t, term_(0)\n\t\t, okCount_(0)\n\t\t, ngCount_(0)\n\t\t, exceptionCount_(0)\n\t{\n\t}\n\tvoid setup(Func init, Func term)\n\t{\n\t\tinit_ = init;\n\t\tterm_ = term;\n\t}\n\tvoid append(const char *name, Func func)\n\t{\n\t\tlist_.push_back(std::make_pair(name, func));\n\t}\n\tvoid set(bool isOK)\n\t{\n\t\tif (isOK) {\n\t\t\tokCount_++;\n\t\t} else {\n\t\t\tngCount_++;\n\t\t}\n\t}\n\tstd::string getBaseName(const std::string& name) const\n\t{\n#ifdef _WIN32\n\t\tconst char sep = '\\\\';\n#else\n\t\tconst char sep = '\/';\n#endif\n\t\tsize_t pos = name.find_last_of(sep);\n\t\tstd::string ret = name.substr(pos + 1);\n\t\tpos = ret.find('.');\n\t\treturn ret.substr(0, pos);\n\t}\n\tint run(int, char *argv[])\n\t{\n\t\tstd::string msg;\n\t\ttry {\n\t\t\tif (init_) init_();\n\t\t\tfor (UnitTestList::const_iterator i = list_.begin(), ie = list_.end(); i != ie; ++i) {\n\t\t\t\tstd::cout << \"ctest:module=\" << i->first << std::endl;\n\t\t\t\ttry {\n\t\t\t\t\t(i->second)();\n\t\t\t\t} catch (std::exception& e) {\n\t\t\t\t\texceptionCount_++;\n\t\t\t\t\tstd::cout << \"ctest: \" << i->first << \" is stopped by exception \" << e.what() << std::endl;\n\t\t\t\t} catch (...) {\n\t\t\t\t\texceptionCount_++;\n\t\t\t\t\tstd::cout << \"ctest: \" << i->first << \" is stopped by unknown exception\" << std::endl;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (term_) term_();\n\t\t} catch (std::exception& e) {\n\t\t\tmsg = std::string(\"ctest:err:\") + e.what();\n\t\t} catch (...) {\n\t\t\tmsg = \"ctest:err: catch unknown exception\";\n\t\t}\n\t\tfflush(stdout);\n\t\tif (msg.empty()) {\n\t\t\tstd::cout << \"ctest:name=\" << getBaseName(*argv)\n\t\t\t\t\t << \", module=\" << list_.size()\n\t\t\t\t\t << \", total=\" << (okCount_ + ngCount_ + exceptionCount_)\n\t\t\t\t\t << \", ok=\" << okCount_\n\t\t\t\t\t << \", ng=\" << ngCount_\n\t\t\t\t\t << \", exception=\" << exceptionCount_ << std::endl;\n\t\t\treturn 0;\n\t\t} else {\n\t\t\tstd::cout << msg << std::endl;\n\t\t\treturn 1;\n\t\t}\n\t}\n\tstatic inline AutoRun& getInstance()\n\t{\n\t\tstatic AutoRun instance;\n\t\treturn instance;\n\t}\nprivate:\n\tFunc init_;\n\tFunc term_;\n\tint okCount_;\n\tint ngCount_;\n\tint exceptionCount_;\n\tUnitTestList list_;\n};\n\nstatic AutoRun& autoRun = AutoRun::getInstance();\n\ninline void test(bool ret, const std::string& msg, const std::string& param, const char *file, int line)\n{\n\tautoRun.set(ret);\n\tif (!ret) {\n\t\tprintf(\"%s(%d):ctest:%s(%s);\\n\", file, line, msg.c_str(), param.c_str());\n\t}\n}\n\ntemplate<typename T, typename U>\nbool isEqual(const T& lhs, const U& rhs)\n{\n\treturn lhs == rhs;\n}\n\n\/\/ avoid warning of comparision of integers of different signs\ninline bool isEqual(size_t lhs, int rhs)\n{\n\treturn lhs == size_t(rhs);\n}\ninline bool isEqual(int lhs, size_t rhs)\n{\n\treturn size_t(lhs) == rhs;\n}\ninline bool isEqual(const char *lhs, const char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(char *lhs, const char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(const char *lhs, char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\ninline bool isEqual(char *lhs, char *rhs)\n{\n\treturn strcmp(lhs, rhs) == 0;\n}\n\/\/ avoid to compare float directly\ninline bool isEqual(float lhs, float rhs)\n{\n\tunion fi {\n\t\tfloat f;\n\t\tuint32_t i;\n\t} lfi, rfi;\n\tlfi.f = lhs;\n\trfi.f = rhs;\n\treturn lfi.i == rfi.i;\n}\n\/\/ avoid to compare double directly\ninline bool isEqual(double lhs, double rhs)\n{\n\tunion di {\n\t\tdouble d;\n\t\tuint64_t i;\n\t} ldi, rdi;\n\tldi.d = lhs;\n\trdi.d = rhs;\n\treturn ldi.i == rdi.i;\n}\n\n} } \/\/ cybozu::test\n\n#ifndef CYBOZU_TEST_DISABLE_AUTO_RUN\nint main(int argc, char *argv[])\n{\n\treturn cybozu::test::autoRun.run(argc, argv);\n}\n#endif\n\n\/**\n\talert if !x\n\t@param x [in]\n*\/\n#define CYBOZU_TEST_ASSERT(x) cybozu::test::test(!!(x), \"CYBOZU_TEST_ASSERT\", #x, __FILE__, __LINE__)\n\n\/**\n\talert if x != y\n\t@param x [in]\n\t@param y [in]\n*\/\n#define CYBOZU_TEST_EQUAL(x, y) { \\\n\tbool _cybozu_eq = cybozu::test::isEqual(x, y); \\\n\tcybozu::test::test(_cybozu_eq, \"CYBOZU_TEST_EQUAL\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!_cybozu_eq) { \\\n\t\tstd::cout << \"ctest: lhs=\" << (x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << (y) << std::endl; \\\n\t} \\\n}\n\/**\n\talert if fabs(x, y) >= eps\n\t@param x [in]\n\t@param y [in]\n*\/\n#define CYBOZU_TEST_NEAR(x, y, eps) { \\\n\tbool _cybozu_isNear = fabs((x) - (y)) < eps; \\\n\tcybozu::test::test(_cybozu_isNear, \"CYBOZU_TEST_NEAR\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!_cybozu_isNear) { \\\n\t\tstd::cout << \"ctest: lhs=\" << (x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << (y) << std::endl; \\\n\t} \\\n}\n\n#define CYBOZU_TEST_EQUAL_POINTER(x, y) { \\\n\tbool _cybozu_eq = x == y; \\\n\tcybozu::test::test(_cybozu_eq, \"CYBOZU_TEST_EQUAL_POINTER\", #x \", \" #y, __FILE__, __LINE__); \\\n\tif (!_cybozu_eq) { \\\n\t\tstd::cout << \"ctest: lhs=\" << static_cast<const void*>(x) << std::endl; \\\n\t\tstd::cout << \"ctest: rhs=\" << static_cast<const void*>(y) << std::endl; \\\n\t} \\\n}\n\/**\n\talert if x[] != y[]\n\t@param x [in]\n\t@param y [in]\n\t@param n [in]\n*\/\n#define CYBOZU_TEST_EQUAL_ARRAY(x, y, n) { \\\n\tfor (size_t _cybozu_test_i = 0, _cybozu_ie = (size_t)(n); _cybozu_test_i < _cybozu_ie; _cybozu_test_i++) { \\\n\t\tbool _cybozu_eq = cybozu::test::isEqual((x)[_cybozu_test_i], (y)[_cybozu_test_i]); \\\n\t\tcybozu::test::test(_cybozu_eq, \"CYBOZU_TEST_EQUAL_ARRAY\", #x \", \" #y \", \" #n, __FILE__, __LINE__); \\\n\t\tif (!_cybozu_eq) { \\\n\t\t\tstd::cout << \"ctest: i=\" << _cybozu_test_i << std::endl; \\\n\t\t\tstd::cout << \"ctest: lhs=\" << (x)[_cybozu_test_i] << std::endl; \\\n\t\t\tstd::cout << \"ctest: rhs=\" << (y)[_cybozu_test_i] << std::endl; \\\n\t\t} \\\n\t} \\\n}\n\n\/**\n\talways alert\n\t@param msg [in]\n*\/\n#define CYBOZU_TEST_FAIL(msg) cybozu::test::test(false, \"CYBOZU_TEST_FAIL\", msg, __FILE__, __LINE__)\n\n\/**\n\tverify message in exception\n*\/\n#define CYBOZU_TEST_EXCEPTION_MESSAGE(statement, Exception, msg) \\\n{ \\\n\tint _cybozu_ret = 0; \\\n\tstd::string _cybozu_errMsg; \\\n\ttry { \\\n\t\tstatement; \\\n\t\t_cybozu_ret = 1; \\\n\t} catch (const Exception& _cybozu_e) { \\\n\t\t_cybozu_errMsg = _cybozu_e.what(); \\\n\t\tif (_cybozu_errMsg.find(msg) == std::string::npos) { \\\n\t\t\t_cybozu_ret = 2; \\\n\t\t} \\\n\t} catch (...) { \\\n\t\t_cybozu_ret = 3; \\\n\t} \\\n\tif (_cybozu_ret) { \\\n\t\tcybozu::test::test(false, \"CYBOZU_TEST_EXCEPTION_MESSAGE\", #statement \", \" #Exception \", \" #msg, __FILE__, __LINE__); \\\n\t\tif (_cybozu_ret == 1) { \\\n\t\t\tstd::cout << \"ctest: no exception\" << std::endl; \\\n\t\t} else if (_cybozu_ret == 2) { \\\n\t\t\tstd::cout << \"ctest: bad exception msg:\" << _cybozu_errMsg << std::endl; \\\n\t\t} else { \\\n\t\t\tstd::cout << \"ctest: unexpected exception\" << std::endl; \\\n\t\t} \\\n\t} else { \\\n\t\tcybozu::test::autoRun.set(true); \\\n\t} \\\n}\n\n#define CYBOZU_TEST_EXCEPTION(statement, Exception) \\\n{ \\\n\tint _cybozu_ret = 0; \\\n\ttry { \\\n\t\tstatement; \\\n\t\t_cybozu_ret = 1; \\\n\t} catch (const Exception&) { \\\n\t} catch (...) { \\\n\t\t_cybozu_ret = 2; \\\n\t} \\\n\tif (_cybozu_ret) { \\\n\t\tcybozu::test::test(false, \"CYBOZU_TEST_EXCEPTION\", #statement \", \" #Exception, __FILE__, __LINE__); \\\n\t\tif (_cybozu_ret == 1) { \\\n\t\t\tstd::cout << \"ctest: no exception\" << std::endl; \\\n\t\t} else { \\\n\t\t\tstd::cout << \"ctest: unexpected exception\" << std::endl; \\\n\t\t} \\\n\t} else { \\\n\t\tcybozu::test::autoRun.set(true); \\\n\t} \\\n}\n\n\/**\n\tverify statement does not throw\n*\/\n#define CYBOZU_TEST_NO_EXCEPTION(statement) \\\ntry { \\\n\tstatement; \\\n\tcybozu::test::autoRun.set(true); \\\n} catch (...) { \\\n\tcybozu::test::test(false, \"CYBOZU_TEST_NO_EXCEPTION\", #statement, __FILE__, __LINE__); \\\n}\n\n\/**\n\tappend auto unit test\n\t@param name [in] module name\n*\/\n#define CYBOZU_TEST_AUTO(name) \\\nvoid cybozu_test_ ## name(); \\\nstruct cybozu_test_local_ ## name { \\\n\tcybozu_test_local_ ## name() \\\n\t{ \\\n\t\tcybozu::test::autoRun.append(#name, cybozu_test_ ## name); \\\n\t} \\\n} cybozu_test_local_instance_ ## name; \\\nvoid cybozu_test_ ## name()\n\n\/**\n\tappend auto unit test with fixture\n\t@param name [in] module name\n*\/\n#define CYBOZU_TEST_AUTO_WITH_FIXTURE(name, Fixture) \\\nvoid cybozu_test_ ## name(); \\\nvoid cybozu_test_real_ ## name() \\\n{ \\\n\tFixture f; \\\n\tcybozu_test_ ## name(); \\\n} \\\nstruct cybozu_test_local_ ## name { \\\n\tcybozu_test_local_ ## name() \\\n\t{ \\\n\t\tcybozu::test::autoRun.append(#name, cybozu_test_real_ ## name); \\\n\t} \\\n} cybozu_test_local_instance_ ## name; \\\nvoid cybozu_test_ ## name()\n\n\/**\n\tsetup fixture\n\t@param Fixture [in] class name of fixture\n\t@note cstr of Fixture is called before test and dstr of Fixture is called after test\n*\/\n#define CYBOZU_TEST_SETUP_FIXTURE(Fixture) \\\nFixture *cybozu_test_local_fixture; \\\nvoid cybozu_test_local_init() \\\n{ \\\n\tcybozu_test_local_fixture = new Fixture(); \\\n} \\\nvoid cybozu_test_local_term() \\\n{ \\\n\tdelete cybozu_test_local_fixture; \\\n} \\\nstruct cybozu_test_local_fixture_setup_ { \\\n\tcybozu_test_local_fixture_setup_() \\\n\t{ \\\n\t\tcybozu::test::autoRun.setup(cybozu_test_local_init, cybozu_test_local_term); \\\n\t} \\\n} cybozu_test_local_fixture_setup_instance_;\n<|endoftext|>"} {"text":"<commit_before>#include <fstream>\r\n#include <iostream>\r\n#include <omp.h>\r\n#include <stdio.h>\r\n#include <time.h>\r\n\r\n#include \"..\/Neural_Networks.h\"\r\n\r\nvoid Read_MNIST(string training_set_images, string training_set_labels, string test_set_images, string test_set_labels, int number_training, int number_test, float **input, float **target_output) {\r\n\tifstream file(training_set_images, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 4; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = 0; h < number_training; h++) {\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor (int j = 0; j < 28 * 28; j++) {\r\n\t\t\t\tfile.read((char*)(&pixel), 1);\r\n\t\t\t\tinput[h][j] = pixel \/ 255.0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + training_set_images + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(training_set_labels, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 2; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = 0; h < number_training; h++) {\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfile.read((char*)(&label), 1);\r\n\r\n\t\t\tfor (int j = 0; j < 10; j++) {\r\n\t\t\t\ttarget_output[h][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + training_set_labels + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(test_set_images, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 4; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = number_training; h < number_training + number_test; h++) {\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor (int j = 0; j < 28 * 28; j++) {\r\n\t\t\t\tfile.read((char*)(&pixel), 1);\r\n\t\t\t\tinput[h][j] = pixel \/ 255.0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + test_set_images + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(test_set_labels, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 2; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = number_training; h < number_training + number_test; h++) {\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfile.read((char*)(&label), 1);\r\n\r\n\t\t\tfor (int j = 0; j < 10; j++) {\r\n\t\t\t\ttarget_output[h][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + test_set_labels + \" not found\" << endl;\r\n\t}\r\n}\r\n\r\nint main() {\r\n\tint batch_size\t\t= 60;\r\n\tint number_iterations = 50;\r\n\tint number_threads;\r\n\tint number_training\t= 60000;\r\n\tint number_test\t\t= 10000;\r\n\r\n\tfloat **input = new float*[number_training + number_test];\r\n\tfloat **target_output = new float*[number_training + number_test];\r\n\r\n\tdouble epsilon\t\t = 0.001;\r\n\tdouble learning_rate = 0.005;\r\n\tdouble decay_rate\t = 0.977;\r\n\r\n\tstring path;\r\n\r\n\tvector<int> number_nodes = { 784, 10 };\r\n\r\n\tvector<Layer*> layer;\r\n\r\n\t\/\/ train from scratch *****************\r\n\tNeural_Networks NN = Neural_Networks();\r\n\r\n\tlayer.push_back(NN.Add(new Layer(\"MNIST\",\t1, 28, 28)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 24, 24, 24)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"\",\t\t24, 12, 12)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 24, 8, 8)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 48, 8, 8)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"\",\t\t48, 4, 4)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 192)));\t\t\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"CE,softmax\", 10)));\t\t\/\/ cross-entropy loss, softmax activation\r\n\r\n\tlayer[1]->Connect(layer[0], \"W\");\t\t\/\/ 5x5 convolution\r\n\tlayer[2]->Connect(layer[1], \"P,max\");\t\/\/ 2x2 max pooling\r\n\tlayer[3]->Connect(layer[2], \"W,DS\");\t\/\/ 5x5 depthwise separable convolution\r\n\tlayer[4]->Connect(layer[3], \"W\");\t\t\/\/ 1x1 convolution\r\n\tlayer[5]->Connect(layer[4], \"P,max\");\t\/\/ 2x2 max pooling\r\n\tlayer[6]->Connect(layer[5], \"W\");\t\t\/\/ fully connected\r\n\tlayer[7]->Connect(layer[6], \"W\");\t\t\/\/ fully connected\r\n\r\n\tsrand(0); NN.Initialize(0.01);\r\n\t\/\/ ************************************\r\n\r\n\t\/\/ or load pretrained model\r\n\t\/\/ Neural_Networks NN = Neural_Networks(\"MNIST_CNN.txt\");\r\n\r\n\tcout << \"The number of threads : \";\r\n\tcin >> number_threads;\r\n\tcin.ignore();\r\n\r\n\tcout << \"path where MNIST handwritten digits dataset is : \";\r\n\tgetline(cin, path);\r\n\r\n\tfor (int h = 0; h < number_training + number_test; h++) {\r\n\t\tinput[h] = new float[number_nodes.front()];\r\n\t\ttarget_output[h] = new float[number_nodes.back()];\r\n\t}\r\n\tRead_MNIST(path + \"train-images.idx3-ubyte\", path + \"train-labels.idx1-ubyte\", path + \"t10k-images.idx3-ubyte\", path + \"t10k-labels.idx1-ubyte\", number_training, number_test, input, target_output);\r\n\r\n\tomp_set_num_threads(number_threads);\r\n\r\n\tfor (int g = 0, time = clock(); g < number_iterations; g++) {\r\n\t\tint score[2] = { 0, };\r\n\r\n\t\tfloat **output = new float*[batch_size];\r\n\r\n\t\tdouble loss = NN.Train(batch_size, number_training, input, target_output, learning_rate, epsilon);\r\n\r\n\t\tfor (int h = 0; h < batch_size; h++) {\r\n\t\t\toutput[h] = new float[number_nodes.back()];\r\n\t\t}\r\n\t\tfor (int i = 0, h = 0; i < number_training + number_test; i++) {\r\n\t\t\tif (++h == batch_size || i == number_training + number_test - 1) {\r\n\t\t\t\tNN.Test(h, &input[i - h + 1], output);\r\n\r\n\t\t\t\tfor (int g = 0, argmax; g < h; g++) {\r\n\t\t\t\t\tdouble max = 0;\r\n\r\n\t\t\t\t\tfor (int j = 0; j < number_nodes.back(); j++) {\r\n\t\t\t\t\t\tif (max < output[g][j]) {\r\n\t\t\t\t\t\t\tmax = output[g][argmax = j];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tscore[(i - h + g + 1 < number_training) ? (0) : (1)] += (int)target_output[i - h + g + 1][argmax];\r\n\t\t\t\t}\r\n\t\t\t\th = 0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\".\"); NN.Save(\"NN.txt\");\r\n\r\n\t\tprintf(\"score: %d \/ %d, %d \/ %d loss: %lf step %d %.2lf sec\\n\", score[0], number_training, score[1], number_test, loss, g + 1, (double)(clock() - time) \/ CLOCKS_PER_SEC);\r\n\t\tlearning_rate *= decay_rate;\r\n\r\n\t\tfor (int h = 0; h < batch_size; h++) {\r\n\t\t\tdelete[] output[h];\r\n\t\t}\r\n\t\tdelete[] output;\r\n\t}\r\n\r\n\tfor (int h = 0; h < number_training + number_test; h++) {\r\n\t\tdelete[] input[h];\r\n\t\tdelete[] target_output[h];\r\n\t}\r\n\tdelete[] input;\r\n\tdelete[] target_output;\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>Update MNIST_CNN.cpp<commit_after>#include <fstream>\r\n#include <iostream>\r\n#include <omp.h>\r\n#include <stdio.h>\r\n#include <time.h>\r\n\r\n#include \"..\/Neural_Networks.h\"\r\n\r\nvoid Read_MNIST(string training_set_images, string training_set_labels, string test_set_images, string test_set_labels, int number_training, int number_test, float **input, float **target_output) {\r\n\tifstream file(training_set_images, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 4; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = 0; h < number_training; h++) {\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor (int j = 0; j < 28 * 28; j++) {\r\n\t\t\t\tfile.read((char*)(&pixel), 1);\r\n\t\t\t\tinput[h][j] = pixel \/ 255.0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + training_set_images + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(training_set_labels, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 2; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = 0; h < number_training; h++) {\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfile.read((char*)(&label), 1);\r\n\r\n\t\t\tfor (int j = 0; j < 10; j++) {\r\n\t\t\t\ttarget_output[h][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + training_set_labels + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(test_set_images, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 4; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = number_training; h < number_training + number_test; h++) {\r\n\t\t\tunsigned char pixel;\r\n\r\n\t\t\tfor (int j = 0; j < 28 * 28; j++) {\r\n\t\t\t\tfile.read((char*)(&pixel), 1);\r\n\t\t\t\tinput[h][j] = pixel \/ 255.0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + test_set_images + \" not found\" << endl;\r\n\t}\r\n\r\n\tfile.open(test_set_labels, ifstream::binary);\r\n\r\n\tif (file.is_open()) {\r\n\t\tfor (int h = 0, value; h < 2; h++) {\r\n\t\t\tfile.read((char*)(&value), sizeof(int));\r\n\t\t}\r\n\t\tfor (int h = number_training; h < number_training + number_test; h++) {\r\n\t\t\tunsigned char label;\r\n\r\n\t\t\tfile.read((char*)(&label), 1);\r\n\r\n\t\t\tfor (int j = 0; j < 10; j++) {\r\n\t\t\t\ttarget_output[h][j] = (j == label);\r\n\t\t\t}\r\n\t\t}\r\n\t\tfile.close();\r\n\t}\r\n\telse {\r\n\t\tcerr << \"[Read_MNIST], \" + test_set_labels + \" not found\" << endl;\r\n\t}\r\n}\r\n\r\nint main() {\r\n\tint batch_size\t\t= 60;\r\n\tint number_iterations = 50;\r\n\tint number_threads;\r\n\tint number_training\t= 60000;\r\n\tint number_test\t\t= 10000;\r\n\r\n\tfloat **input = new float*[number_training + number_test];\r\n\tfloat **target_output = new float*[number_training + number_test];\r\n\r\n\tdouble epsilon\t\t = 0.001;\r\n\tdouble learning_rate = 0.005;\r\n\tdouble decay_rate\t = 0.977;\r\n\r\n\tstring path;\r\n\r\n\tvector<int> number_nodes = { 784, 10 };\r\n\r\n\tvector<Layer*> layer;\r\n\r\n\t\/\/ train from scratch *****************\r\n\tNeural_Networks NN = Neural_Networks();\r\n\r\n\tlayer.push_back(NN.Add(new Layer(\"MNIST\",\t1, 28, 28)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 24, 24, 24)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"\",\t\t24, 12, 12)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 24, 8, 8)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 48, 8, 8)));\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"\",\t\t48, 4, 4)));\r\n\tlayer.push_back(NN.Add(new Layer(\"BN,ReLU\", 192)));\t\t\t\/\/ batch normalization, ReLU activation\r\n\tlayer.push_back(NN.Add(new Layer(\"CE,softmax\", 10)));\t\t\/\/ cross-entropy loss, softmax activation\r\n\r\n\tlayer[1]->Connect(layer[0], \"W\");\t\t\/\/ 5x5 convolution\r\n\tlayer[2]->Connect(layer[1], \"P,max\");\t\/\/ 2x2 max pooling\r\n\tlayer[3]->Connect(layer[2], \"W,DS\");\t\/\/ 5x5 depthwise separable convolution\r\n\tlayer[4]->Connect(layer[3], \"W\");\t\t\/\/ 1x1 convolution\r\n\tlayer[5]->Connect(layer[4], \"P,max\");\t\/\/ 2x2 max pooling\r\n\tlayer[6]->Connect(layer[5], \"W\");\t\t\/\/ fully connected\r\n\tlayer[7]->Connect(layer[6], \"W\");\t\t\/\/ fully connected\r\n\r\n\tsrand(0); NN.Initialize(0.01);\r\n\t\/\/ ************************************\r\n\r\n\t\/\/ or load pretrained model\r\n\t\/\/ Neural_Networks NN = Neural_Networks(\"MNIST_CNN.txt\");\r\n\r\n\tcout << \"The number of threads : \";\r\n\tcin >> number_threads;\r\n\tcin.ignore();\r\n\t\r\n\tomp_set_num_threads(number_threads);\r\n\r\n\tcout << \"path where MNIST handwritten digits dataset is : \";\r\n\tgetline(cin, path);\r\n\r\n\tfor (int h = 0; h < number_training + number_test; h++) {\r\n\t\tinput[h] = new float[number_nodes.front()];\r\n\t\ttarget_output[h] = new float[number_nodes.back()];\r\n\t}\r\n\tRead_MNIST(path + \"train-images.idx3-ubyte\", path + \"train-labels.idx1-ubyte\", path + \"t10k-images.idx3-ubyte\", path + \"t10k-labels.idx1-ubyte\", number_training, number_test, input, target_output);\r\n\r\n\tfor (int g = 0, time = clock(); g < number_iterations; g++) {\r\n\t\tint score[2] = { 0, };\r\n\r\n\t\tfloat **output = new float*[batch_size];\r\n\r\n\t\tdouble loss = NN.Train(batch_size, number_training, input, target_output, learning_rate, epsilon);\r\n\r\n\t\tfor (int h = 0; h < batch_size; h++) {\r\n\t\t\toutput[h] = new float[number_nodes.back()];\r\n\t\t}\r\n\t\tfor (int i = 0, h = 0; i < number_training + number_test; i++) {\r\n\t\t\tif (++h == batch_size || i == number_training + number_test - 1) {\r\n\t\t\t\tNN.Test(h, &input[i - h + 1], output);\r\n\r\n\t\t\t\tfor (int g = 0, argmax; g < h; g++) {\r\n\t\t\t\t\tdouble max = 0;\r\n\r\n\t\t\t\t\tfor (int j = 0; j < number_nodes.back(); j++) {\r\n\t\t\t\t\t\tif (max < output[g][j]) {\r\n\t\t\t\t\t\t\tmax = output[g][argmax = j];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tscore[(i - h + g + 1 < number_training) ? (0) : (1)] += (int)target_output[i - h + g + 1][argmax];\r\n\t\t\t\t}\r\n\t\t\t\th = 0;\r\n\t\t\t}\r\n\t\t}\r\n\t\tprintf(\".\"); NN.Save(\"NN.txt\");\r\n\r\n\t\tprintf(\"score: %d \/ %d, %d \/ %d loss: %lf step %d %.2lf sec\\n\", score[0], number_training, score[1], number_test, loss, g + 1, (double)(clock() - time) \/ CLOCKS_PER_SEC);\r\n\t\tlearning_rate *= decay_rate;\r\n\r\n\t\tfor (int h = 0; h < batch_size; h++) {\r\n\t\t\tdelete[] output[h];\r\n\t\t}\r\n\t\tdelete[] output;\r\n\t}\r\n\r\n\tfor (int h = 0; h < number_training + number_test; h++) {\r\n\t\tdelete[] input[h];\r\n\t\tdelete[] target_output[h];\r\n\t}\r\n\tdelete[] input;\r\n\tdelete[] target_output;\r\n\r\n\treturn 0;\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#include \"fstream.hh\"\n#include \"align.hh\"\n#include \"circular_buffer.hh\"\n#include \"semaphore.hh\"\n#include \"reactor.hh\"\n#include <malloc.h>\n#include <string.h>\n\nclass file_data_source_impl : public data_source_impl {\n file _file;\n file_input_stream_options _options;\n uint64_t _pos;\n circular_buffer<future<temporary_buffer<char>>> _read_buffers;\n unsigned _reads_in_progress = 0;\n std::experimental::optional<promise<>> _done;\npublic:\n file_data_source_impl(file f, file_input_stream_options options)\n : _file(std::move(f)), _options(options), _pos(_options.offset) {}\n virtual future<temporary_buffer<char>> get() override {\n if (_read_buffers.empty()) {\n issue_read_aheads(1);\n }\n auto ret = std::move(_read_buffers.front());\n _read_buffers.pop_front();\n return ret;\n }\n virtual future<> close() {\n _done.emplace();\n if (!_reads_in_progress) {\n _done->set_value();\n }\n return _done->get_future().then([this] {\n for (auto&& c : _read_buffers) {\n c.ignore_ready_future();\n }\n });\n }\nprivate:\n void issue_read_aheads(unsigned min_ra = 0) {\n if (_done) {\n return;\n }\n auto ra = std::max(min_ra, _options.read_ahead);\n while (_read_buffers.size() < ra) {\n ++_reads_in_progress;\n \/\/ if _pos is not dma-aligned, we'll get a short read. Account for that.\n auto now = _options.buffer_size - _pos % _file.disk_dma_alignment();\n _read_buffers.push_back(_file.dma_read_bulk<char>(_pos, now).then_wrapped(\n [this] (future<temporary_buffer<char>> ret) {\n issue_read_aheads();\n --_reads_in_progress;\n if (_done && !_reads_in_progress) {\n _done->set_value();\n }\n return ret;\n }));\n _pos += now;\n };\n }\n};\n\nclass file_data_source : public data_source {\npublic:\n file_data_source(file f, file_input_stream_options options)\n : data_source(std::make_unique<file_data_source_impl>(\n std::move(f), options)) {}\n};\n\ninput_stream<char> make_file_input_stream(\n file f, file_input_stream_options options) {\n return input_stream<char>(file_data_source(std::move(f), options));\n}\n\ninput_stream<char> make_file_input_stream(\n file f, uint64_t offset, size_t buffer_size) {\n file_input_stream_options options;\n options.offset = offset;\n options.buffer_size = buffer_size;\n return make_file_input_stream(std::move(f), options);\n}\n\nclass file_data_sink_impl : public data_sink_impl {\n file _file;\n file_output_stream_options _options;\n uint64_t _pos = 0;\n \/\/ At offsets < _preallocating_at, preallocation was completed.\n \/\/ At offsets >= _preallocating_at, we may be preallocating\n \/\/ disk space, so all writes must wait until _preallocation_done[i]\n \/\/ becomes ready (in _options.preallocation_size units)\n \/\/ At offsets >= _preallocating_at + _options.preallocation_size *\n \/\/ _preallocation_done.size(), we have not yet started.\n uint64_t _preallocating_at = 0;\n \/\/ Each promise vector lists writes that are waiting for a single preallocation\n circular_buffer<std::vector<promise<>>> _preallocation_done;\n semaphore _write_behind_sem = { _options.write_behind };\n future<> _background_writes_done = make_ready_future<>();\n bool _failed = false;\npublic:\n file_data_sink_impl(file f, file_output_stream_options options)\n : _file(std::move(f)), _options(options) {}\n future<> put(net::packet data) { abort(); }\n virtual temporary_buffer<char> allocate_buffer(size_t size) override {\n return temporary_buffer<char>::aligned(_file.memory_dma_alignment(), size);\n }\n virtual future<> put(temporary_buffer<char> buf) override {\n uint64_t pos = _pos;\n _pos += buf.size();\n if (!_options.write_behind) {\n return do_put(pos, std::move(buf));\n }\n \/\/ Write behind strategy:\n \/\/\n \/\/ 1. Issue N writes in parallel, using a semphore to limit to N\n \/\/ 2. Collect results in _background_writes_done, merging exception futures\n \/\/ 3. If we've already seen a failure, don't issue more writes.\n return _write_behind_sem.wait().then([this, pos, buf = std::move(buf)] () mutable {\n if (_failed) {\n _write_behind_sem.signal();\n auto ret = std::move(_background_writes_done);\n _background_writes_done = make_ready_future<>();\n return ret;\n }\n auto this_write_done = do_put(pos, std::move(buf)).finally([this] {\n _write_behind_sem.signal();\n });\n _background_writes_done = when_all(std::move(_background_writes_done), std::move(this_write_done))\n .then([this] (std::tuple<future<>, future<>> possible_errors) {\n \/\/ merge the two errors, preferring the first\n auto& e1 = std::get<0>(possible_errors);\n auto& e2 = std::get<1>(possible_errors);\n if (e1.failed()) {\n e2.ignore_ready_future();\n return std::move(e1);\n } else {\n if (e2.failed()) {\n _failed = true;\n }\n return std::move(e2);\n }\n });\n return make_ready_future<>();\n });\n }\nprivate:\n virtual future<> do_put(uint64_t pos, temporary_buffer<char> buf) {\n \/\/ put() must usually be of chunks multiple of file::dma_alignment.\n \/\/ Only the last part can have an unaligned length. If put() was\n \/\/ called again with an unaligned pos, we have a bug in the caller.\n assert(!(pos & (_file.disk_dma_alignment() - 1)));\n bool truncate = false;\n auto p = static_cast<const char*>(buf.get());\n size_t buf_size = buf.size();\n\n if ((buf.size() & (_file.disk_dma_alignment() - 1)) != 0) {\n \/\/ If buf size isn't aligned, copy its content into a new aligned buf.\n \/\/ This should only happen when the user calls output_stream::flush().\n auto tmp = allocate_buffer(align_up(buf.size(), _file.disk_dma_alignment()));\n ::memcpy(tmp.get_write(), buf.get(), buf.size());\n buf = std::move(tmp);\n p = buf.get();\n buf_size = buf.size();\n truncate = true;\n }\n auto prealloc = preallocate(pos, buf.size());\n return prealloc.then([this, pos, p, buf_size, truncate, buf = std::move(buf)] () mutable {\n return _file.dma_write(pos, p, buf_size).then(\n [this, buf = std::move(buf), truncate] (size_t size) {\n if (truncate) {\n return _file.truncate(_pos);\n }\n return make_ready_future<>();\n });\n });\n }\n future<> preallocate(uint64_t pos, uint64_t size) {\n auto ret = make_ready_future<>();\n restart:\n if (pos + size <= _preallocating_at) {\n return ret;\n }\n auto skip = std::max(_preallocating_at, pos) - pos;\n pos += skip;\n size -= skip;\n size_t idx = (pos - _preallocating_at) \/ _options.preallocation_size;\n while (size) {\n if (idx == _preallocation_done.size()) {\n start_new_preallocation();\n \/\/ May have caused _preallocating_at to change, so redo the loop\n goto restart;\n }\n _preallocation_done[idx].emplace_back();\n auto this_prealloc_done = _preallocation_done[idx].back().get_future();\n ret = when_all(std::move(ret), std::move(this_prealloc_done)).discard_result();\n skip = std::min<uint64_t>(size, _options.preallocation_size);\n pos += skip;\n size -= skip;\n ++idx;\n }\n return ret;\n }\n void start_new_preallocation() {\n auto pos = _preallocating_at + _preallocation_done.size() * _options.preallocation_size;\n _preallocation_done.emplace_back();\n _file.allocate(pos, _options.preallocation_size).then_wrapped([this, pos] (future<> ret) {\n complete_preallocation(pos, std::move(ret));\n });\n }\n void complete_preallocation(uint64_t pos, future<> result) {\n \/\/ Preallocation may have failed. But it's just preallocation,\n \/\/ so we can ignore the result.\n result.ignore_ready_future();\n size_t idx = (pos - _preallocating_at) \/ _options.preallocation_size;\n for (auto&& pr : _preallocation_done[idx]) {\n pr.set_value();\n }\n _preallocation_done[idx].clear();\n while (!_preallocation_done.empty() && _preallocation_done.front().empty()) {\n _preallocation_done.pop_front();\n _preallocating_at += _options.preallocation_size;\n }\n }\n future<> wait() {\n return _write_behind_sem.wait(_options.write_behind).then([this] {\n return _background_writes_done.then([this] {\n \/\/ restore to pristine state; for flush() + close() sequence\n \/\/ (we allow either flush, or close, or both)\n _write_behind_sem.signal(_options.write_behind);\n _background_writes_done = make_ready_future<>();\n });\n });\n }\npublic:\n virtual future<> flush() override {\n return wait().then([this] {\n return _file.flush();\n });\n }\n virtual future<> close() {\n return wait().then([this] {\n return _file.close();\n });\n }\n};\n\nclass file_data_sink : public data_sink {\npublic:\n file_data_sink(file f, file_output_stream_options options)\n : data_sink(std::make_unique<file_data_sink_impl>(\n std::move(f), options)) {}\n};\n\noutput_stream<char> make_file_output_stream(file f, size_t buffer_size) {\n file_output_stream_options options;\n options.buffer_size = buffer_size;\n return make_file_output_stream(std::move(f), options);\n}\n\noutput_stream<char> make_file_output_stream(file f, file_output_stream_options options) {\n return output_stream<char>(file_data_sink(std::move(f), options), options.buffer_size, true);\n}\n\n<commit_msg>fstream: remove stream-based preallocation<commit_after>\/*\n * This file is open source software, licensed to you under the terms\n * of the Apache License, Version 2.0 (the \"License\"). See the NOTICE file\n * distributed with this work for additional information regarding copyright\n * ownership. You may not use this file except in compliance with the License.\n *\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n *\/\n\/*\n * Copyright (C) 2015 Cloudius Systems, Ltd.\n *\/\n\n#include \"fstream.hh\"\n#include \"align.hh\"\n#include \"circular_buffer.hh\"\n#include \"semaphore.hh\"\n#include \"reactor.hh\"\n#include <malloc.h>\n#include <string.h>\n\nclass file_data_source_impl : public data_source_impl {\n file _file;\n file_input_stream_options _options;\n uint64_t _pos;\n circular_buffer<future<temporary_buffer<char>>> _read_buffers;\n unsigned _reads_in_progress = 0;\n std::experimental::optional<promise<>> _done;\npublic:\n file_data_source_impl(file f, file_input_stream_options options)\n : _file(std::move(f)), _options(options), _pos(_options.offset) {}\n virtual future<temporary_buffer<char>> get() override {\n if (_read_buffers.empty()) {\n issue_read_aheads(1);\n }\n auto ret = std::move(_read_buffers.front());\n _read_buffers.pop_front();\n return ret;\n }\n virtual future<> close() {\n _done.emplace();\n if (!_reads_in_progress) {\n _done->set_value();\n }\n return _done->get_future().then([this] {\n for (auto&& c : _read_buffers) {\n c.ignore_ready_future();\n }\n });\n }\nprivate:\n void issue_read_aheads(unsigned min_ra = 0) {\n if (_done) {\n return;\n }\n auto ra = std::max(min_ra, _options.read_ahead);\n while (_read_buffers.size() < ra) {\n ++_reads_in_progress;\n \/\/ if _pos is not dma-aligned, we'll get a short read. Account for that.\n auto now = _options.buffer_size - _pos % _file.disk_dma_alignment();\n _read_buffers.push_back(_file.dma_read_bulk<char>(_pos, now).then_wrapped(\n [this] (future<temporary_buffer<char>> ret) {\n issue_read_aheads();\n --_reads_in_progress;\n if (_done && !_reads_in_progress) {\n _done->set_value();\n }\n return ret;\n }));\n _pos += now;\n };\n }\n};\n\nclass file_data_source : public data_source {\npublic:\n file_data_source(file f, file_input_stream_options options)\n : data_source(std::make_unique<file_data_source_impl>(\n std::move(f), options)) {}\n};\n\ninput_stream<char> make_file_input_stream(\n file f, file_input_stream_options options) {\n return input_stream<char>(file_data_source(std::move(f), options));\n}\n\ninput_stream<char> make_file_input_stream(\n file f, uint64_t offset, size_t buffer_size) {\n file_input_stream_options options;\n options.offset = offset;\n options.buffer_size = buffer_size;\n return make_file_input_stream(std::move(f), options);\n}\n\nclass file_data_sink_impl : public data_sink_impl {\n file _file;\n file_output_stream_options _options;\n uint64_t _pos = 0;\n semaphore _write_behind_sem = { _options.write_behind };\n future<> _background_writes_done = make_ready_future<>();\n bool _failed = false;\npublic:\n file_data_sink_impl(file f, file_output_stream_options options)\n : _file(std::move(f)), _options(options) {}\n future<> put(net::packet data) { abort(); }\n virtual temporary_buffer<char> allocate_buffer(size_t size) override {\n return temporary_buffer<char>::aligned(_file.memory_dma_alignment(), size);\n }\n virtual future<> put(temporary_buffer<char> buf) override {\n uint64_t pos = _pos;\n _pos += buf.size();\n if (!_options.write_behind) {\n return do_put(pos, std::move(buf));\n }\n \/\/ Write behind strategy:\n \/\/\n \/\/ 1. Issue N writes in parallel, using a semphore to limit to N\n \/\/ 2. Collect results in _background_writes_done, merging exception futures\n \/\/ 3. If we've already seen a failure, don't issue more writes.\n return _write_behind_sem.wait().then([this, pos, buf = std::move(buf)] () mutable {\n if (_failed) {\n _write_behind_sem.signal();\n auto ret = std::move(_background_writes_done);\n _background_writes_done = make_ready_future<>();\n return ret;\n }\n auto this_write_done = do_put(pos, std::move(buf)).finally([this] {\n _write_behind_sem.signal();\n });\n _background_writes_done = when_all(std::move(_background_writes_done), std::move(this_write_done))\n .then([this] (std::tuple<future<>, future<>> possible_errors) {\n \/\/ merge the two errors, preferring the first\n auto& e1 = std::get<0>(possible_errors);\n auto& e2 = std::get<1>(possible_errors);\n if (e1.failed()) {\n e2.ignore_ready_future();\n return std::move(e1);\n } else {\n if (e2.failed()) {\n _failed = true;\n }\n return std::move(e2);\n }\n });\n return make_ready_future<>();\n });\n }\nprivate:\n virtual future<> do_put(uint64_t pos, temporary_buffer<char> buf) {\n \/\/ put() must usually be of chunks multiple of file::dma_alignment.\n \/\/ Only the last part can have an unaligned length. If put() was\n \/\/ called again with an unaligned pos, we have a bug in the caller.\n assert(!(pos & (_file.disk_dma_alignment() - 1)));\n bool truncate = false;\n auto p = static_cast<const char*>(buf.get());\n size_t buf_size = buf.size();\n\n if ((buf.size() & (_file.disk_dma_alignment() - 1)) != 0) {\n \/\/ If buf size isn't aligned, copy its content into a new aligned buf.\n \/\/ This should only happen when the user calls output_stream::flush().\n auto tmp = allocate_buffer(align_up(buf.size(), _file.disk_dma_alignment()));\n ::memcpy(tmp.get_write(), buf.get(), buf.size());\n buf = std::move(tmp);\n p = buf.get();\n buf_size = buf.size();\n truncate = true;\n }\n\n {\n return _file.dma_write(pos, p, buf_size).then(\n [this, buf = std::move(buf), truncate] (size_t size) {\n if (truncate) {\n return _file.truncate(_pos);\n }\n return make_ready_future<>();\n });\n }\n }\n future<> wait() {\n return _write_behind_sem.wait(_options.write_behind).then([this] {\n return _background_writes_done.then([this] {\n \/\/ restore to pristine state; for flush() + close() sequence\n \/\/ (we allow either flush, or close, or both)\n _write_behind_sem.signal(_options.write_behind);\n _background_writes_done = make_ready_future<>();\n });\n });\n }\npublic:\n virtual future<> flush() override {\n return wait().then([this] {\n return _file.flush();\n });\n }\n virtual future<> close() {\n return wait().then([this] {\n return _file.close();\n });\n }\n};\n\nclass file_data_sink : public data_sink {\npublic:\n file_data_sink(file f, file_output_stream_options options)\n : data_sink(std::make_unique<file_data_sink_impl>(\n std::move(f), options)) {}\n};\n\noutput_stream<char> make_file_output_stream(file f, size_t buffer_size) {\n file_output_stream_options options;\n options.buffer_size = buffer_size;\n return make_file_output_stream(std::move(f), options);\n}\n\noutput_stream<char> make_file_output_stream(file f, file_output_stream_options options) {\n return output_stream<char>(file_data_sink(std::move(f), options), options.buffer_size, true);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n** Copyright (C) - Triton\n**\n** This program is under the terms of the LGPLv3 License.\n*\/\n\n#include <csignal>\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <stdexcept>\n#include <vector>\n\n#include <pin.H>\n\n#include <AnalysisProcessor.h>\n#include <IRBuilder.h>\n#include <IRBuilderFactory.h>\n#include <Inst.h>\n#include <PINContextHandler.h>\n#include <ProcessingPyConf.h>\n#include <Trigger.h>\n#include <boost\/filesystem.hpp>\n\nusing boost::filesystem::absolute;\nusing boost::filesystem::path;\n\n\/* Pin options: -script *\/\nKNOB<std::string> KnobPythonModule(KNOB_MODE_WRITEONCE, \"pintool\", \"script\", \"\", \"Python script\");\n\nAnalysisProcessor ap;\nTrigger analysisTrigger = Trigger();\nProcessingPyConf processingPyConf(&ap, &analysisTrigger);\n\n\n\nstatic void callbackBefore(IRBuilder *irb, CONTEXT *ctx, BOOL hasEA, ADDRINT ea, BOOL isBranchTaken, ADDRINT branchTargetAddress, THREADID threadId) {\n \/* Some configurations must be applied before processing *\/\n processingPyConf.applyConfBeforeProcessing(irb);\n\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n if (hasEA)\n irb->setup(ea);\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Setup Information into Irb *\/\n irb->setThreadID(ap.getThreadID());\n irb->setBranchTaken(isBranchTaken);\n irb->setBranchTargetAddress(branchTargetAddress);\n\n \/* Python callback before IR processing *\/\n processingPyConf.callbackBeforeIRProc(irb, &ap);\n\n Inst *inst = irb->process(ap);\n ap.addInstructionToTrace(inst);\n\n \/* Export some information from Irb to Inst *\/\n inst->setNextAddress(irb->getNextAddress());\n inst->setOpcode(irb->getOpcode());\n inst->setOpcodeCategory(irb->getOpcodeCategory());\n inst->setOperands(irb->getOperands());\n inst->setBranchTaken(irb->isBranchTaken());\n inst->setBranchTargetAddress(irb->getBranchTargetAddress());\n\n \/* Python callback before instruction processing *\/\n processingPyConf.callbackBefore(inst, &ap);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\nstatic void callbackAfter(CONTEXT *ctx, THREADID threadId) {\n Inst *inst;\n\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Get the last instruction *\/\n inst = ap.getLastInstruction();\n\n \/* Update statistics *\/\n #ifndef LIGHT_VERSION\n ap.incNumberOfBranchesTaken(inst->isBranch());\n #endif\n\n \/* Python callback after instruction processing *\/\n processingPyConf.callbackAfter(inst, &ap);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n#ifndef LIGHT_VERSION\nstatic void callbackSnapshot(uint64 mem, uint32 writeSize) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* If the snapshot is not enable we don't save the memory *\/\n if (ap.isSnapshotLocked())\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n uint32 i = 0;\n for (; i < writeSize ; i++)\n ap.addSnapshotModification(mem+i, *(reinterpret_cast<uint8*>(mem+i)));\n\n \/* Mutex *\/\n ap.unlock();\n}\n#endif \/* LIGHT_VERSION *\/\n\n\nstatic void TRACE_Instrumentation(TRACE trace, VOID *programName) {\n boost::filesystem::path pname(reinterpret_cast<char*>(programName));\n\n for (BBL bbl = TRACE_BblHead(trace); BBL_Valid(bbl); bbl = BBL_Next(bbl)) {\n for (INS ins = BBL_InsHead(bbl); INS_Valid(ins); ins = INS_Next(ins)) {\n\n \/* ---- Speed up process ---- *\/\n IMG currentImgName = IMG_FindByAddress(INS_Address(ins));\n if (!IMG_Valid(currentImgName))\n continue;\n\n boost::filesystem::path pcurrent(IMG_Name(currentImgName));\n if (!analysisTrigger.getState() && strcmp(pname.leaf().c_str(), pcurrent.leaf().c_str()))\n continue;\n \/* ---- End of speed up process ---- *\/\n\n IRBuilder *irb = createIRBuilder(ins);\n\n \/* Callback before *\/\n if (INS_MemoryOperandCount(ins) > 0)\n INS_InsertCall(ins, IPOINT_BEFORE, (AFUNPTR) callbackBefore,\n IARG_PTR, irb,\n IARG_CONTEXT,\n IARG_BOOL, true,\n IARG_MEMORYOP_EA, 0,\n IARG_BRANCH_TAKEN,\n IARG_BRANCH_TARGET_ADDR,\n IARG_THREAD_ID,\n IARG_END);\n else\n INS_InsertCall(ins, IPOINT_BEFORE, (AFUNPTR) callbackBefore,\n IARG_PTR, irb,\n IARG_CONTEXT,\n IARG_BOOL, false,\n IARG_ADDRINT, 0,\n IARG_BRANCH_TAKEN,\n IARG_BRANCH_TARGET_ADDR,\n IARG_THREAD_ID,\n IARG_END);\n\n \/* Callback after *\/\n \/* Syscall after context must be catcher with IDREF.CALLBACK.SYSCALL_EXIT *\/\n if (INS_IsSyscall(ins) == false) {\n IPOINT where = IPOINT_AFTER;\n if (INS_HasFallThrough(ins) == false)\n where = IPOINT_TAKEN_BRANCH;\n INS_InsertCall(ins, where, (AFUNPTR)callbackAfter, IARG_CONTEXT, IARG_THREAD_ID, IARG_END);\n }\n\n #ifndef LIGHT_VERSION\n \/* I\/O memory monitoring for snapshot *\/\n if (INS_OperandCount(ins) > 1 && INS_MemoryOperandIsWritten(ins, 0)) {\n INS_InsertCall(\n ins, IPOINT_BEFORE, (AFUNPTR)callbackSnapshot,\n IARG_MEMORYOP_EA, 0,\n IARG_UINT32, INS_MemoryWriteSize(ins),\n IARG_END);\n }\n #endif \/* LIGHT_VERSION *\/\n\n }\n }\n}\n\n\nstatic void toggleWrapper(bool flag) {\n ap.lock();\n analysisTrigger.update(flag);\n ap.unlock();\n}\n\n\nstatic void callbackRoutineEntry(CONTEXT *ctx, THREADID threadId, PyObject *callback) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex lock *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n processingPyConf.callbackRoutine(threadId, callback);\n\n \/* Mutex unlock *\/\n ap.unlock();\n}\n\n\nstatic void callbackRoutineExit(CONTEXT *ctx, THREADID threadId, PyObject *callback) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex lock *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n processingPyConf.callbackRoutine(threadId, callback);\n\n \/* Mutex unlock *\/\n ap.unlock();\n}\n\n\nstatic void IMG_Instrumentation(IMG img, VOID *) {\n \/* Lock \/ Unlock the Analysis *\/\n if (PyTritonOptions::startAnalysisFromSymbol != nullptr){\n\n RTN targetRTN = RTN_FindByName(img, PyTritonOptions::startAnalysisFromSymbol);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n\n RTN_InsertCall(targetRTN,\n IPOINT_BEFORE,\n (AFUNPTR) toggleWrapper,\n IARG_BOOL, true,\n IARG_END);\n\n RTN_InsertCall(targetRTN,\n IPOINT_AFTER,\n (AFUNPTR) toggleWrapper,\n IARG_BOOL, false,\n IARG_END);\n\n RTN_Close(targetRTN);\n }\n }\n\n \/* Callback on routine entry *\/\n std::map<const char *, PyObject *>::iterator it;\n for (it = PyTritonOptions::callbackRoutineEntry.begin(); it != PyTritonOptions::callbackRoutineEntry.end(); it++){\n RTN targetRTN = RTN_FindByName(img, it->first);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n RTN_InsertCall(targetRTN, IPOINT_BEFORE, (AFUNPTR)callbackRoutineEntry, IARG_CONTEXT, IARG_THREAD_ID, IARG_PTR, it->second, IARG_END);\n RTN_Close(targetRTN);\n }\n }\n\n \/* Callback on routine exit *\/\n for (it = PyTritonOptions::callbackRoutineExit.begin(); it != PyTritonOptions::callbackRoutineExit.end(); it++){\n RTN targetRTN = RTN_FindByName(img, it->first);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n RTN_InsertCall(targetRTN, IPOINT_AFTER, (AFUNPTR)callbackRoutineExit, IARG_CONTEXT, IARG_THREAD_ID, IARG_PTR, it->second, IARG_END);\n RTN_Close(targetRTN);\n }\n }\n}\n\n\n\/* Callback at the end of the execution *\/\nstatic void Fini(INT32, VOID *) {\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackFini();\n\n \/* End of Python *\/\n Py_Finalize();\n}\n\n\n\/* Callback at the syscall entry *\/\nstatic void callbackSyscallEntry(THREADID threadId, CONTEXT *ctx, SYSCALL_STANDARD std, VOID *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSyscallEntry(threadId, std);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/* Callback at the syscall exit *\/\nstatic void callbackSyscallExit(THREADID threadId, CONTEXT *ctx, SYSCALL_STANDARD std, VOID *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSyscallExit(threadId, std);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\/* Callback when an image is loaded *\/\nstatic void callbackImageLoad(IMG img, VOID *v) {\n \/* Mutex *\/\n ap.lock();\n\n if (!IMG_Valid(img))\n \/* Invalid image *\/\n return;\n\n \/* Collect image's informations *\/\n string imagePath = IMG_Name(img);\n uint64 imageBase = IMG_LowAddress(img);\n uint64 imageSize = (IMG_HighAddress(img) + 1) - imageBase;\n\n \/* Python callback for image loading *\/\n processingPyConf.callbackImageLoad(imagePath, imageBase, imageSize);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\/* Callback when a signals occurs *\/\nstatic bool callbackSignals(THREADID threadId, sint32 sig, CONTEXT *ctx, bool hasHandler, const EXCEPTION_INFO *pExceptInfo, void *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return false;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSignals(threadId, sig);\n\n \/* Mutex *\/\n ap.unlock();\n\n \/*\n * We must exit. If you don't want to exit,\n * you must use the restoreSnapshot() function.\n *\/\n exit(0);\n\n return true;\n}\n\n\n\/* Callback when a thread is created *\/\nstatic void callbackThreadEntry(THREADID threadId, CONTEXT *ctx, sint32 flags, void *v) {\n \/* Mutex *\/\n ap.lock();\n\n \/\/ TODO #30: Create a map entry of (thread -> {taintEngine, symEngine}).\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/* Callback when a thread is destroyed *\/\nstatic void callbackThreadExit(THREADID threadId, const CONTEXT *ctx, sint32 flags, void *v) {\n \/* Mutex *\/\n ap.lock();\n\n \/\/ TODO #30: Destroy the map entry corresponding to the threadId.\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/*\n * Usage function if Pin fail to start.\n * Display the help message.\n *\/\nstatic sint32 Usage() {\n std::cerr << KNOB_BASE::StringKnobSummary() << std::endl;\n return -1;\n}\n\n\n\/* Get the name of the target binary *\/\nstatic char *getProgramName(char *argv[]) {\n uint64 offset;\n for (offset = 0; argv[offset]; offset++){\n if (!strcmp(argv[offset], \"--\") && argv[offset+1])\n return argv[offset+1];\n }\n return nullptr;\n}\n\n\nint main(int argc, char *argv[]) {\n PIN_InitSymbols();\n PIN_SetSyntaxIntel();\n if(PIN_Init(argc, argv))\n return Usage();\n\n \/* Init Python Bindings *\/\n initBindings();\n\n \/* Image callback *\/\n IMG_AddInstrumentFunction(IMG_Instrumentation, nullptr);\n\n \/* Instruction callback *\/\n TRACE_AddInstrumentFunction(TRACE_Instrumentation, getProgramName(argv));\n\n \/* End instrumentation callback *\/\n PIN_AddFiniFunction(Fini, nullptr);\n\n \/* Syscall entry callback *\/\n PIN_AddSyscallEntryFunction(callbackSyscallEntry, nullptr);\n\n \/* Syscall exit callback *\/\n PIN_AddSyscallExitFunction(callbackSyscallExit, nullptr);\n\n \/* Image load callback *\/\n IMG_AddInstrumentFunction(callbackImageLoad, nullptr);\n\n \/* Signals callback *\/\n PIN_InterceptSignal(SIGFPE, callbackSignals, nullptr); \/* Floating point exception *\/\n PIN_InterceptSignal(SIGILL, callbackSignals, nullptr); \/* Illegal Instruction *\/\n PIN_InterceptSignal(SIGKILL, callbackSignals, nullptr); \/* Kill signal *\/\n PIN_InterceptSignal(SIGPIPE, callbackSignals, nullptr); \/* Broken pipe: write to pipe with no readers *\/\n PIN_InterceptSignal(SIGSEGV, callbackSignals, nullptr); \/* Invalid memory reference *\/\n\n \/* Threads callbacks *\/\n PIN_AddThreadStartFunction(callbackThreadEntry, nullptr);\n PIN_AddThreadFiniFunction(callbackThreadExit, nullptr);\n\n \/* Exec the python bindings file *\/\n if (!execBindings(KnobPythonModule.Value().c_str())) {\n std::cerr << \"Error: Script file can't be found!\" << std::endl;\n exit(1);\n }\n\n return 0;\n}\n\n<commit_msg>Fix mutex<commit_after>\/*\n** Copyright (C) - Triton\n**\n** This program is under the terms of the LGPLv3 License.\n*\/\n\n#include <csignal>\n#include <iostream>\n#include <memory>\n#include <sstream>\n#include <stdexcept>\n#include <vector>\n\n#include <pin.H>\n\n#include <AnalysisProcessor.h>\n#include <IRBuilder.h>\n#include <IRBuilderFactory.h>\n#include <Inst.h>\n#include <PINContextHandler.h>\n#include <ProcessingPyConf.h>\n#include <Trigger.h>\n#include <boost\/filesystem.hpp>\n\nusing boost::filesystem::absolute;\nusing boost::filesystem::path;\n\n\/* Pin options: -script *\/\nKNOB<std::string> KnobPythonModule(KNOB_MODE_WRITEONCE, \"pintool\", \"script\", \"\", \"Python script\");\n\nAnalysisProcessor ap;\nTrigger analysisTrigger = Trigger();\nProcessingPyConf processingPyConf(&ap, &analysisTrigger);\n\n\n\nstatic void callbackBefore(IRBuilder *irb, CONTEXT *ctx, BOOL hasEA, ADDRINT ea, BOOL isBranchTaken, ADDRINT branchTargetAddress, THREADID threadId) {\n \/* Some configurations must be applied before processing *\/\n processingPyConf.applyConfBeforeProcessing(irb);\n\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n if (hasEA)\n irb->setup(ea);\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Setup Information into Irb *\/\n irb->setThreadID(ap.getThreadID());\n irb->setBranchTaken(isBranchTaken);\n irb->setBranchTargetAddress(branchTargetAddress);\n\n \/* Python callback before IR processing *\/\n processingPyConf.callbackBeforeIRProc(irb, &ap);\n\n Inst *inst = irb->process(ap);\n ap.addInstructionToTrace(inst);\n\n \/* Export some information from Irb to Inst *\/\n inst->setNextAddress(irb->getNextAddress());\n inst->setOpcode(irb->getOpcode());\n inst->setOpcodeCategory(irb->getOpcodeCategory());\n inst->setOperands(irb->getOperands());\n inst->setBranchTaken(irb->isBranchTaken());\n inst->setBranchTargetAddress(irb->getBranchTargetAddress());\n\n \/* Python callback before instruction processing *\/\n processingPyConf.callbackBefore(inst, &ap);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\nstatic void callbackAfter(CONTEXT *ctx, THREADID threadId) {\n Inst *inst;\n\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Get the last instruction *\/\n inst = ap.getLastInstruction();\n\n \/* Update statistics *\/\n #ifndef LIGHT_VERSION\n ap.incNumberOfBranchesTaken(inst->isBranch());\n #endif\n\n \/* Python callback after instruction processing *\/\n processingPyConf.callbackAfter(inst, &ap);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n#ifndef LIGHT_VERSION\nstatic void callbackSnapshot(uint64 mem, uint32 writeSize) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* If the snapshot is not enable we don't save the memory *\/\n if (ap.isSnapshotLocked())\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n uint32 i = 0;\n for (; i < writeSize ; i++)\n ap.addSnapshotModification(mem+i, *(reinterpret_cast<uint8*>(mem+i)));\n\n \/* Mutex *\/\n ap.unlock();\n}\n#endif \/* LIGHT_VERSION *\/\n\n\nstatic void TRACE_Instrumentation(TRACE trace, VOID *programName) {\n boost::filesystem::path pname(reinterpret_cast<char*>(programName));\n\n for (BBL bbl = TRACE_BblHead(trace); BBL_Valid(bbl); bbl = BBL_Next(bbl)) {\n for (INS ins = BBL_InsHead(bbl); INS_Valid(ins); ins = INS_Next(ins)) {\n\n \/* ---- Speed up process ---- *\/\n IMG currentImgName = IMG_FindByAddress(INS_Address(ins));\n if (!IMG_Valid(currentImgName))\n continue;\n\n boost::filesystem::path pcurrent(IMG_Name(currentImgName));\n if (!analysisTrigger.getState() && strcmp(pname.leaf().c_str(), pcurrent.leaf().c_str()))\n continue;\n \/* ---- End of speed up process ---- *\/\n\n IRBuilder *irb = createIRBuilder(ins);\n\n \/* Callback before *\/\n if (INS_MemoryOperandCount(ins) > 0)\n INS_InsertCall(ins, IPOINT_BEFORE, (AFUNPTR) callbackBefore,\n IARG_PTR, irb,\n IARG_CONTEXT,\n IARG_BOOL, true,\n IARG_MEMORYOP_EA, 0,\n IARG_BRANCH_TAKEN,\n IARG_BRANCH_TARGET_ADDR,\n IARG_THREAD_ID,\n IARG_END);\n else\n INS_InsertCall(ins, IPOINT_BEFORE, (AFUNPTR) callbackBefore,\n IARG_PTR, irb,\n IARG_CONTEXT,\n IARG_BOOL, false,\n IARG_ADDRINT, 0,\n IARG_BRANCH_TAKEN,\n IARG_BRANCH_TARGET_ADDR,\n IARG_THREAD_ID,\n IARG_END);\n\n \/* Callback after *\/\n \/* Syscall after context must be catcher with IDREF.CALLBACK.SYSCALL_EXIT *\/\n if (INS_IsSyscall(ins) == false) {\n IPOINT where = IPOINT_AFTER;\n if (INS_HasFallThrough(ins) == false)\n where = IPOINT_TAKEN_BRANCH;\n INS_InsertCall(ins, where, (AFUNPTR)callbackAfter, IARG_CONTEXT, IARG_THREAD_ID, IARG_END);\n }\n\n #ifndef LIGHT_VERSION\n \/* I\/O memory monitoring for snapshot *\/\n if (INS_OperandCount(ins) > 1 && INS_MemoryOperandIsWritten(ins, 0)) {\n INS_InsertCall(\n ins, IPOINT_BEFORE, (AFUNPTR)callbackSnapshot,\n IARG_MEMORYOP_EA, 0,\n IARG_UINT32, INS_MemoryWriteSize(ins),\n IARG_END);\n }\n #endif \/* LIGHT_VERSION *\/\n\n }\n }\n}\n\n\nstatic void toggleWrapper(bool flag) {\n ap.lock();\n analysisTrigger.update(flag);\n ap.unlock();\n}\n\n\nstatic void callbackRoutineEntry(CONTEXT *ctx, THREADID threadId, PyObject *callback) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex lock *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n processingPyConf.callbackRoutine(threadId, callback);\n\n \/* Mutex unlock *\/\n ap.unlock();\n}\n\n\nstatic void callbackRoutineExit(CONTEXT *ctx, THREADID threadId, PyObject *callback) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex lock *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n processingPyConf.callbackRoutine(threadId, callback);\n\n \/* Mutex unlock *\/\n ap.unlock();\n}\n\n\nstatic void IMG_Instrumentation(IMG img, VOID *) {\n \/* Lock \/ Unlock the Analysis *\/\n if (PyTritonOptions::startAnalysisFromSymbol != nullptr){\n\n RTN targetRTN = RTN_FindByName(img, PyTritonOptions::startAnalysisFromSymbol);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n\n RTN_InsertCall(targetRTN,\n IPOINT_BEFORE,\n (AFUNPTR) toggleWrapper,\n IARG_BOOL, true,\n IARG_END);\n\n RTN_InsertCall(targetRTN,\n IPOINT_AFTER,\n (AFUNPTR) toggleWrapper,\n IARG_BOOL, false,\n IARG_END);\n\n RTN_Close(targetRTN);\n }\n }\n\n \/* Callback on routine entry *\/\n std::map<const char *, PyObject *>::iterator it;\n for (it = PyTritonOptions::callbackRoutineEntry.begin(); it != PyTritonOptions::callbackRoutineEntry.end(); it++){\n RTN targetRTN = RTN_FindByName(img, it->first);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n RTN_InsertCall(targetRTN, IPOINT_BEFORE, (AFUNPTR)callbackRoutineEntry, IARG_CONTEXT, IARG_THREAD_ID, IARG_PTR, it->second, IARG_END);\n RTN_Close(targetRTN);\n }\n }\n\n \/* Callback on routine exit *\/\n for (it = PyTritonOptions::callbackRoutineExit.begin(); it != PyTritonOptions::callbackRoutineExit.end(); it++){\n RTN targetRTN = RTN_FindByName(img, it->first);\n if (RTN_Valid(targetRTN)){\n RTN_Open(targetRTN);\n RTN_InsertCall(targetRTN, IPOINT_AFTER, (AFUNPTR)callbackRoutineExit, IARG_CONTEXT, IARG_THREAD_ID, IARG_PTR, it->second, IARG_END);\n RTN_Close(targetRTN);\n }\n }\n}\n\n\n\/* Callback at the end of the execution *\/\nstatic void Fini(INT32, VOID *) {\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackFini();\n\n \/* End of Python *\/\n Py_Finalize();\n}\n\n\n\/* Callback at the syscall entry *\/\nstatic void callbackSyscallEntry(THREADID threadId, CONTEXT *ctx, SYSCALL_STANDARD std, VOID *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSyscallEntry(threadId, std);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/* Callback at the syscall exit *\/\nstatic void callbackSyscallExit(THREADID threadId, CONTEXT *ctx, SYSCALL_STANDARD std, VOID *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSyscallExit(threadId, std);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\/* Callback when an image is loaded *\/\nstatic void callbackImageLoad(IMG img, VOID *v) {\n if (!IMG_Valid(img))\n \/* Invalid image *\/\n return;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Collect image's informations *\/\n string imagePath = IMG_Name(img);\n uint64 imageBase = IMG_LowAddress(img);\n uint64 imageSize = (IMG_HighAddress(img) + 1) - imageBase;\n\n \/* Python callback for image loading *\/\n processingPyConf.callbackImageLoad(imagePath, imageBase, imageSize);\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\/* Callback when a signals occurs *\/\nstatic bool callbackSignals(THREADID threadId, sint32 sig, CONTEXT *ctx, bool hasHandler, const EXCEPTION_INFO *pExceptInfo, void *v) {\n if (!analysisTrigger.getState())\n \/* Analysis locked *\/\n return false;\n\n \/* Mutex *\/\n ap.lock();\n\n \/* Update the current context handler *\/\n ap.updateCurrentCtxH(new PINContextHandler(ctx, threadId));\n\n \/* Python callback at the end of execution *\/\n processingPyConf.callbackSignals(threadId, sig);\n\n \/* Mutex *\/\n ap.unlock();\n\n \/*\n * We must exit. If you don't want to exit,\n * you must use the restoreSnapshot() function.\n *\/\n exit(0);\n\n return true;\n}\n\n\n\/* Callback when a thread is created *\/\nstatic void callbackThreadEntry(THREADID threadId, CONTEXT *ctx, sint32 flags, void *v) {\n \/* Mutex *\/\n ap.lock();\n\n \/\/ TODO #30: Create a map entry of (thread -> {taintEngine, symEngine}).\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/* Callback when a thread is destroyed *\/\nstatic void callbackThreadExit(THREADID threadId, const CONTEXT *ctx, sint32 flags, void *v) {\n \/* Mutex *\/\n ap.lock();\n\n \/\/ TODO #30: Destroy the map entry corresponding to the threadId.\n\n \/* Mutex *\/\n ap.unlock();\n}\n\n\n\/*\n * Usage function if Pin fail to start.\n * Display the help message.\n *\/\nstatic sint32 Usage() {\n std::cerr << KNOB_BASE::StringKnobSummary() << std::endl;\n return -1;\n}\n\n\n\/* Get the name of the target binary *\/\nstatic char *getProgramName(char *argv[]) {\n uint64 offset;\n for (offset = 0; argv[offset]; offset++){\n if (!strcmp(argv[offset], \"--\") && argv[offset+1])\n return argv[offset+1];\n }\n return nullptr;\n}\n\n\nint main(int argc, char *argv[]) {\n PIN_InitSymbols();\n PIN_SetSyntaxIntel();\n if(PIN_Init(argc, argv))\n return Usage();\n\n \/* Init Python Bindings *\/\n initBindings();\n\n \/* Image callback *\/\n IMG_AddInstrumentFunction(IMG_Instrumentation, nullptr);\n\n \/* Instruction callback *\/\n TRACE_AddInstrumentFunction(TRACE_Instrumentation, getProgramName(argv));\n\n \/* End instrumentation callback *\/\n PIN_AddFiniFunction(Fini, nullptr);\n\n \/* Syscall entry callback *\/\n PIN_AddSyscallEntryFunction(callbackSyscallEntry, nullptr);\n\n \/* Syscall exit callback *\/\n PIN_AddSyscallExitFunction(callbackSyscallExit, nullptr);\n\n \/* Image load callback *\/\n IMG_AddInstrumentFunction(callbackImageLoad, nullptr);\n\n \/* Signals callback *\/\n PIN_InterceptSignal(SIGFPE, callbackSignals, nullptr); \/* Floating point exception *\/\n PIN_InterceptSignal(SIGILL, callbackSignals, nullptr); \/* Illegal Instruction *\/\n PIN_InterceptSignal(SIGKILL, callbackSignals, nullptr); \/* Kill signal *\/\n PIN_InterceptSignal(SIGPIPE, callbackSignals, nullptr); \/* Broken pipe: write to pipe with no readers *\/\n PIN_InterceptSignal(SIGSEGV, callbackSignals, nullptr); \/* Invalid memory reference *\/\n\n \/* Threads callbacks *\/\n PIN_AddThreadStartFunction(callbackThreadEntry, nullptr);\n PIN_AddThreadFiniFunction(callbackThreadExit, nullptr);\n\n \/* Exec the python bindings file *\/\n if (!execBindings(KnobPythonModule.Value().c_str())) {\n std::cerr << \"Error: Script file can't be found!\" << std::endl;\n exit(1);\n }\n\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains thresholds to select implementations based\n * on the expression size\n *\/\n\n#pragma once\n\nnamespace etl {\n\n#ifdef ETL_DEBUG_THRESHOLDS\n\nconstexpr size_t gemm_std_max = 75 * 75; \/\/\/< The maximum number of elements to be handled by std algorithm\nconstexpr size_t gemm_cublas_min = 180 * 180; \/\/\/< The minimum number or elements before considering cublas\n\nconstexpr size_t gemm_rr_small_threshold = 1000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\nconstexpr size_t gemm_cc_small_threshold = 1000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\n\nconstexpr size_t gevm_rm_small_threshold = 1000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\nconstexpr size_t gevm_cm_small_threshold = 1000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\n\nconstexpr size_t gemv_rm_small_threshold = 1000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\nconstexpr size_t gemv_cm_small_threshold = 1000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\n\nconstexpr size_t parallel_threshold = 6 * 1024; \/\/\/< The minimum number of elements before considering parallel implementation\n\nconstexpr size_t sum_parallel_threshold = 1024 * 2; \/\/\/< The minimum number of elements before considering parallel acc implementation\n\nconstexpr size_t conv1_parallel_threshold_conv = 100; \/\/\/< The mimum output size before considering parallel convolution\nconstexpr size_t conv1_parallel_threshold_kernel = 16; \/\/\/< The mimum kernel size before considering parallel convolution\n\nconstexpr size_t fft1_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft1_many_threshold_n = 768; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t fft2_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft2_many_threshold_n = 1024; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t stream_threshold = 1024; \/\/\/< The threshold at which stream is used\n\n#else\n\nconstexpr size_t gemm_std_max = 75 * 75; \/\/\/< The maximum number of elements to be handled by std algorithm\nconstexpr size_t gemm_cublas_min = 180 * 180; \/\/\/< The minimum number or elements before considering cublas\n\nconstexpr size_t gemm_rr_small_threshold = 10000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\nconstexpr size_t gemm_cc_small_threshold = 40000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\n\nconstexpr size_t gevm_rm_small_threshold = 62000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\nconstexpr size_t gevm_cm_small_threshold = 4000000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\n\nconstexpr size_t gemv_rm_small_threshold = 4500000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\nconstexpr size_t gemv_cm_small_threshold = 2400000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\n\nconstexpr size_t parallel_threshold = 128 * 1024; \/\/\/< The minimum number of elements before considering parallel implementation\n\nconstexpr size_t sum_parallel_threshold = 1024 * 32; \/\/\/< The minimum number of elements before considering parallel acc implementation\n\nconstexpr size_t conv1_parallel_threshold_conv = 100; \/\/\/< The mimum output size before considering parallel convolution\nconstexpr size_t conv1_parallel_threshold_kernel = 16; \/\/\/< The mimum kernel size before considering parallel convolution\n\nconstexpr size_t fft1_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft1_many_threshold_n = 768; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t fft2_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft2_many_threshold_n = 1024; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t stream_threshold = cache_size; \/\/\/< The threshold at which stream is used\n\n#endif\n\n} \/\/end of namespace etl\n<commit_msg>Better threshold for gevm<commit_after>\/\/=======================================================================\n\/\/ Copyright (c) 2014-2017 Baptiste Wicht\n\/\/ Distributed under the terms of the MIT License.\n\/\/ (See accompanying file LICENSE or copy at\n\/\/ http:\/\/opensource.org\/licenses\/MIT)\n\/\/=======================================================================\n\n\/*!\n * \\file\n * \\brief Contains thresholds to select implementations based\n * on the expression size\n *\/\n\n#pragma once\n\nnamespace etl {\n\n#ifdef ETL_DEBUG_THRESHOLDS\n\nconstexpr size_t gemm_std_max = 75 * 75; \/\/\/< The maximum number of elements to be handled by std algorithm\nconstexpr size_t gemm_cublas_min = 180 * 180; \/\/\/< The minimum number or elements before considering cublas\n\nconstexpr size_t gemm_rr_small_threshold = 1000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\nconstexpr size_t gemm_cc_small_threshold = 1000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\n\nconstexpr size_t gevm_rm_small_threshold = 1000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\nconstexpr size_t gevm_cm_small_threshold = 1000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\n\nconstexpr size_t gemv_rm_small_threshold = 1000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\nconstexpr size_t gemv_cm_small_threshold = 1000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\n\nconstexpr size_t parallel_threshold = 6 * 1024; \/\/\/< The minimum number of elements before considering parallel implementation\n\nconstexpr size_t sum_parallel_threshold = 1024 * 2; \/\/\/< The minimum number of elements before considering parallel acc implementation\n\nconstexpr size_t conv1_parallel_threshold_conv = 100; \/\/\/< The mimum output size before considering parallel convolution\nconstexpr size_t conv1_parallel_threshold_kernel = 16; \/\/\/< The mimum kernel size before considering parallel convolution\n\nconstexpr size_t fft1_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft1_many_threshold_n = 768; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t fft2_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft2_many_threshold_n = 1024; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t stream_threshold = 1024; \/\/\/< The threshold at which stream is used\n\n#else\n\nconstexpr size_t gemm_std_max = 75 * 75; \/\/\/< The maximum number of elements to be handled by std algorithm\nconstexpr size_t gemm_cublas_min = 180 * 180; \/\/\/< The minimum number or elements before considering cublas\n\nconstexpr size_t gemm_rr_small_threshold = 10000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\nconstexpr size_t gemm_cc_small_threshold = 40000; \/\/\/< The number of elements of B after which we use BLAS-like kernel (for GEMM)\n\nconstexpr size_t gevm_rm_small_threshold = 72000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\nconstexpr size_t gevm_cm_small_threshold = 4000000; \/\/\/< The number of elements of b after which we use BLAS-like kernel\n\nconstexpr size_t gemv_rm_small_threshold = 4500000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\nconstexpr size_t gemv_cm_small_threshold = 2400000; \/\/\/< The number of elements of A after which we use BLAS-like kernel\n\nconstexpr size_t parallel_threshold = 128 * 1024; \/\/\/< The minimum number of elements before considering parallel implementation\n\nconstexpr size_t sum_parallel_threshold = 1024 * 32; \/\/\/< The minimum number of elements before considering parallel acc implementation\n\nconstexpr size_t conv1_parallel_threshold_conv = 100; \/\/\/< The mimum output size before considering parallel convolution\nconstexpr size_t conv1_parallel_threshold_kernel = 16; \/\/\/< The mimum kernel size before considering parallel convolution\n\nconstexpr size_t fft1_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft1_many_threshold_n = 768; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t fft2_many_threshold_transforms = 16; \/\/\/< The mimum number of transforms to parallelize them\nconstexpr size_t fft2_many_threshold_n = 1024; \/\/\/< The mimum size of the transforms to parallelize them\n\nconstexpr size_t stream_threshold = cache_size; \/\/\/< The threshold at which stream is used\n\n#endif\n\n} \/\/end of namespace etl\n<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ CRTMachine.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 31\/05\/2016.\n\/\/ Copyright © 2016 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef CRTMachine_hpp\n#define CRTMachine_hpp\n\n#include \"..\/Outputs\/CRT\/CRT.hpp\"\n#include \"..\/Outputs\/Speaker.hpp\"\n\nnamespace CRTMachine {\n\n\/*!\n\tA CRTMachine::Machine is a mostly-abstract base class for machines that connect to a CRT,\n\tthat optionally provide a speaker, and that nominate a clock rate and can announce to a delegate\n\tshould that clock rate change.\n*\/\nclass Machine {\n\tpublic:\n\t\tMachine() : clock_is_unlimited_(false) {}\n\n\t\tvirtual void setup_output(float aspect_ratio) = 0;\n\t\tvirtual void close_output() = 0;\n\n\t\tvirtual std::shared_ptr<Outputs::CRT::CRT> get_crt() = 0;\n\t\tvirtual std::shared_ptr<Outputs::Speaker> get_speaker() = 0;\n\n\t\tvirtual void run_for_cycles(int number_of_cycles) = 0;\n\n\t\t\/\/ TODO: sever the clock-rate stuff.\n\t\tdouble get_clock_rate() {\n\t\t\treturn clock_rate_;\n\t\t}\n\t\tbool get_clock_is_unlimited() {\n\t\t\treturn clock_is_unlimited_;\n\t\t}\n\t\tclass Delegate {\n\t\t\tpublic:\n\t\t\t\tvirtual void machine_did_change_clock_rate(Machine *machine) = 0;\n\t\t\t\tvirtual void machine_did_change_clock_is_unlimited(Machine *machine) = 0;\n\t\t};\n\t\tvoid set_delegate(Delegate *delegate) { this->delegate_ = delegate; }\n\n\tprotected:\n\t\tvoid set_clock_rate(double clock_rate) {\n\t\t\tif(clock_rate_ != clock_rate) {\n\t\t\t\tclock_rate_ = clock_rate;\n\t\t\t\tif(delegate_) delegate_->machine_did_change_clock_rate(this);\n\t\t\t}\n\t\t}\n\t\tvoid set_clock_is_unlimited(bool clock_is_unlimited) {\n\t\t\tif(clock_is_unlimited != clock_is_unlimited_) {\n\t\t\t\tclock_is_unlimited_ = clock_is_unlimited;\n\t\t\t\tif(delegate_) delegate_->machine_did_change_clock_is_unlimited(this);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tDelegate *delegate_;\n\t\tdouble clock_rate_;\n\t\tbool clock_is_unlimited_;\n};\n\n}\n\n#endif \/* CRTMachine_hpp *\/\n<commit_msg>Added documentation.<commit_after>\/\/\n\/\/ CRTMachine.hpp\n\/\/ Clock Signal\n\/\/\n\/\/ Created by Thomas Harte on 31\/05\/2016.\n\/\/ Copyright © 2016 Thomas Harte. All rights reserved.\n\/\/\n\n#ifndef CRTMachine_hpp\n#define CRTMachine_hpp\n\n#include \"..\/Outputs\/CRT\/CRT.hpp\"\n#include \"..\/Outputs\/Speaker.hpp\"\n\nnamespace CRTMachine {\n\n\/*!\n\tA CRTMachine::Machine is a mostly-abstract base class for machines that connect to a CRT,\n\tthat optionally provide a speaker, and that nominate a clock rate and can announce to a delegate\n\tshould that clock rate change.\n*\/\nclass Machine {\n\tpublic:\n\t\tMachine() : clock_is_unlimited_(false) {}\n\n\t\t\/*!\n\t\t\tCauses the machine to set up its CRT and, if it has one, speaker. The caller guarantees\n\t\t\tthat an OpenGL context is bound.\n\t\t*\/\n\t\tvirtual void setup_output(float aspect_ratio) = 0;\n\n\t\t\/*!\n\t\t\tGives the machine a chance to release all owned resources. The caller guarantees that the\n\t\t\tOpenGL context is bound.\n\t\t*\/\n\t\tvirtual void close_output() = 0;\n\n\t\t\/\/\/ @returns The CRT this machine is drawing to. Should not be @c nullptr.\n\t\tvirtual std::shared_ptr<Outputs::CRT::CRT> get_crt() = 0;\n\n\t\t\/\/\/ @returns The speaker that receives this machine's output, or @c nullptr if this machine is mute.\n\t\tvirtual std::shared_ptr<Outputs::Speaker> get_speaker() = 0;\n\n\t\t\/\/\/ Runs the machine for @c number_of_cycle cycles.\n\t\tvirtual void run_for_cycles(int number_of_cycles) = 0;\n\n\t\t\/\/ TODO: sever the clock-rate stuff.\n\t\tdouble get_clock_rate() {\n\t\t\treturn clock_rate_;\n\t\t}\n\t\tbool get_clock_is_unlimited() {\n\t\t\treturn clock_is_unlimited_;\n\t\t}\n\t\tclass Delegate {\n\t\t\tpublic:\n\t\t\t\tvirtual void machine_did_change_clock_rate(Machine *machine) = 0;\n\t\t\t\tvirtual void machine_did_change_clock_is_unlimited(Machine *machine) = 0;\n\t\t};\n\t\tvoid set_delegate(Delegate *delegate) { this->delegate_ = delegate; }\n\n\tprotected:\n\t\tvoid set_clock_rate(double clock_rate) {\n\t\t\tif(clock_rate_ != clock_rate) {\n\t\t\t\tclock_rate_ = clock_rate;\n\t\t\t\tif(delegate_) delegate_->machine_did_change_clock_rate(this);\n\t\t\t}\n\t\t}\n\t\tvoid set_clock_is_unlimited(bool clock_is_unlimited) {\n\t\t\tif(clock_is_unlimited != clock_is_unlimited_) {\n\t\t\t\tclock_is_unlimited_ = clock_is_unlimited;\n\t\t\t\tif(delegate_) delegate_->machine_did_change_clock_is_unlimited(this);\n\t\t\t}\n\t\t}\n\n\tprivate:\n\t\tDelegate *delegate_;\n\t\tdouble clock_rate_;\n\t\tbool clock_is_unlimited_;\n};\n\n}\n\n#endif \/* CRTMachine_hpp *\/\n<|endoftext|>"} {"text":"<commit_before>#include \"ofMain.h\"\n#include \"ofAppGLFWWindow.h\"\n#include \"pineal.h\"\n\n\nint main(int argc, char ** argv){\n\tauto app = make_shared<Pineal>(argc, argv);\n\tauto out = make_shared<outApp>(app);\n\n\tofGLFWWindowSettings settings;\n\tauto appWindow = ofCreateWindow(settings);\n\n\tsettings.shareContextWith = appWindow;\n\tauto outWindow = ofCreateWindow(settings);\n\n\tofRunApp(appWindow, app);\n\tofRunApp(outWindow, out);\n\tofRunMainLoop();\n}\n<commit_msg>Explicit shared_ptr<commit_after>#include \"ofMain.h\"\n#include \"ofAppGLFWWindow.h\"\n#include \"pineal.h\"\n\n\nint main(int argc, char ** argv){\n\tshared_ptr<Pineal> app = make_shared<Pineal>(argc, argv);\n\tshared_ptr<outApp> out = make_shared<outApp>(app);\n\n\tofGLFWWindowSettings settings;\n\tshared_ptr<ofAppBaseWindow> appWindow = ofCreateWindow(settings);\n\n\tsettings.shareContextWith = appWindow;\n\tshared_ptr<ofAppBaseWindow> outWindow = ofCreateWindow(settings);\n\n\tofRunApp(appWindow, app);\n\tofRunApp(outWindow, out);\n\tofRunMainLoop();\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#pragma once\n\/\/do not include this in ecto lib files, only in client modules\n\n#pragma push_macro(\"_POSIX_C_SOURCE\")\n#pragma push_macro(\"_XOPEN_SOURCE\")\n#undef _POSIX_C_SOURCE\n#undef _XOPEN_SOURCE\n#include <Python.h>\n#include <boost\/python.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <map>\n\/\/#pragma pop_macro(\"_POSIX_C_SOURCE\")\n\/\/#pragma pop_macro(\"_XOPEN_C_SOURCE\")\n\n#include <boost\/noncopyable.hpp>\n\nnamespace ecto {\n namespace py {\n\n struct gilstatus\n {\n const char* file;\n unsigned line;\n const char* what;\n gilstatus(const char* f, unsigned l, const char* w);\n };\n\n \/\/\n \/\/ used in the interpreter thread during blocking operations\n \/\/ RIAA-style Py_BEGIN_ALLOW_THREADS\n \/\/\n class scoped_gil_release : boost::noncopyable\n {\n static std::map<boost::thread::id, PyThreadState*> thread_states;\n bool mine;\n gilstatus mystatus;\n public:\n scoped_gil_release(const char* file, unsigned line);\n ~scoped_gil_release();\n };\n\n \/\/\n \/\/ For non-python created threads\n \/\/\n class scoped_call_back_to_python : boost::noncopyable\n {\n PyGILState_STATE gilstate;\n bool have;\n gilstatus mystatus;\n\n public:\n\n scoped_call_back_to_python(const char* file, unsigned line);\n ~scoped_call_back_to_python();\n };\n }\n}\n\n\/\/#define ECTO_SCOPED_GILRELEASE() ecto::py::scoped_gil_release gilrelease ## __LINE__(__FILE__, __LINE__)\n#define ECTO_SCOPED_GILRELEASE()\n\n\/\/#define ECTO_SCOPED_CALLPYTHON() ecto::py::scoped_call_back_to_python gilcall ## __LINE__(__FILE__, __LINE__)\n#define ECTO_SCOPED_CALLPYTHON()\n<commit_msg>activate gil release\/call macros<commit_after>\/*\n * Copyright (c) 2011, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n#pragma once\n\/\/do not include this in ecto lib files, only in client modules\n\n#pragma push_macro(\"_POSIX_C_SOURCE\")\n#pragma push_macro(\"_XOPEN_SOURCE\")\n#undef _POSIX_C_SOURCE\n#undef _XOPEN_SOURCE\n#include <Python.h>\n#include <boost\/python.hpp>\n#include <boost\/thread\/thread.hpp>\n#include <map>\n\/\/#pragma pop_macro(\"_POSIX_C_SOURCE\")\n\/\/#pragma pop_macro(\"_XOPEN_C_SOURCE\")\n\n#include <boost\/noncopyable.hpp>\n\nnamespace ecto {\n namespace py {\n\n struct gilstatus\n {\n const char* file;\n unsigned line;\n const char* what;\n gilstatus(const char* f, unsigned l, const char* w);\n };\n\n \/\/\n \/\/ used in the interpreter thread during blocking operations\n \/\/ RIAA-style Py_BEGIN_ALLOW_THREADS\n \/\/\n class scoped_gil_release : boost::noncopyable\n {\n static std::map<boost::thread::id, PyThreadState*> thread_states;\n bool mine;\n gilstatus mystatus;\n public:\n scoped_gil_release(const char* file, unsigned line);\n ~scoped_gil_release();\n };\n\n \/\/\n \/\/ For non-python created threads\n \/\/\n class scoped_call_back_to_python : boost::noncopyable\n {\n PyGILState_STATE gilstate;\n bool have;\n gilstatus mystatus;\n\n public:\n\n scoped_call_back_to_python(const char* file, unsigned line);\n ~scoped_call_back_to_python();\n };\n }\n}\n\n#define ECTO_SCOPED_GILRELEASE() ecto::py::scoped_gil_release gilrelease ## __LINE__(__FILE__, __LINE__)\n#define ECTO_SCOPED_CALLPYTHON() ecto::py::scoped_call_back_to_python gilcall ## __LINE__(__FILE__, __LINE__)\n<|endoftext|>"} {"text":"<commit_before>#include <opencv2\/core\/core.hpp>\n#include <iostream>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <ifaddrs.h>\n#include <netinet\/in.h> \n#include <string.h> \n#include <arpa\/inet.h>\n\n#include <ros\/ros.h>\n\n#include \"libfreenect.hpp\"\n#include \"CvKinect.hpp\"\n#include \"CvImageProcessor.hpp\"\n#include \"Communicator.hpp\"\n\nbool startsWith(const char *prefix, const char *str)\n{\n\tsize_t lenPrefix = strlen(prefix),\n\tlenStr = strlen(str);\n\treturn lenStr < lenPrefix ? false : strncmp(prefix, str, lenPrefix) == 0;\n}\n\n\/\/ Gets the ip address of the machine\nchar* getIpAddress()\n{\n\tstruct ifaddrs * ifAddrStruct = NULL;\n\tstruct ifaddrs * ifa = NULL;\n\tvoid * tmpAddrPtr = NULL;\n\tchar* result = 0;\n\t\n\t\n\tgetifaddrs(&ifAddrStruct);\n\t\n\tfor (ifa = ifAddrStruct; ifa != NULL; ifa = ifa->ifa_next) {\n\t\t\/\/ If address type is IPv4\n\t\tif (ifa ->ifa_addr->sa_family==AF_INET) {\n tmpAddrPtr=&((struct sockaddr_in *)ifa->ifa_addr)->sin_addr;\n\t\t\tchar addressBuffer[INET_ADDRSTRLEN];\n\t\t\tinet_ntop(AF_INET, tmpAddrPtr, addressBuffer, INET_ADDRSTRLEN);\n\t\t\t\n\t\t\tif (startsWith(\"eth\", ifa->ifa_name)) {\n\t\t\t\tresult = (char*) malloc(INET_ADDRSTRLEN * sizeof(char));\n\t\t\t\tstrcpy(result, addressBuffer);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ std::cout << ifa->ifa_name << \" IP Address is \" << addressBuffer << std::endl;\n\t\t} else\n\t\t\t\/\/ If address type is IPv6\n\t\t\tif (ifa->ifa_addr->sa_family==AF_INET6) {\n tmpAddrPtr=&((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr;\n\t\t\tchar addressBuffer[INET6_ADDRSTRLEN];\n\t\t\tinet_ntop(AF_INET6, tmpAddrPtr, addressBuffer, INET6_ADDRSTRLEN);\n\t\t\t\/\/ printf(\"%s IP Address %s\\n\", ifa->ifa_name, addressBuffer); \n\t\t} \n\t}\n\t\n\tif (ifAddrStruct!=NULL) {\n\t\tfreeifaddrs(ifAddrStruct);\n\t}\n\t\n\treturn result;\n}\n\nint main(int argc, char** argv)\n{\n\tstd::cout << \"Starting Camera Application\" << std::endl;\n\t\n\tchar* ip = getIpAddress();\n\t\n\tif (ip == 0) {\n\t\tstd::cout << \"No ip address found. Terminating\" << std::endl;\n\t\texit(1);\n\t} else {\n\t\t\/\/ Replace . with _\n\t\tfor (int i = 0; ip[i] != 0; i++) {\n\t\t\tif (ip[i] == '.') {\n\t\t\t\tip[i] = '_';\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ Create node name.\n\tchar nodeName[80];\n\tstrcpy(nodeName, \"Camera_Application_\");\n\tstrcat(nodeName, ip);\n\tfree(ip);\n\t\n\tros::init(argc, argv, nodeName);\n\t\n\tif( ros::console::set_logger_level(ROSCONSOLE_DEFAULT_NAME, ros::console::levels::Debug) ) {\n\t\tros::console::notifyLoggerLevelsChanged();\n\t}\n\t\n\tFreenect::Freenect freenect;\n\tCvKinect& device = freenect.createDevice<CvKinect>(0);\n\t\/\/ CvImageProcessor* analyzer = new CvImageProcessor(&device, 0, true, false);\n\tCvImageProcessor* analyzer = new CvImageProcessor(&device, 0);\n\t\n\t\/\/ Do ROS stuff.\n\tCommunicator comm(&device, analyzer);\n\tanalyzer->setDataReceiver(&comm);\n\tanalyzer->start();\n\t\n\tROS_INFO(\"Initialized Kinect.\");\n\tros::spin();\n\tROS_INFO(\"Shutting down.\");\n\t\n\tanalyzer->stop();\n\t\n\tros::shutdown();\n\tstd::cout << \"ros::shutdown() sent\" << std::endl;\n\t\n\t\/\/ Wait for ros to shutdown.\n\twhile (ros::ok()) {\n\t\tusleep(10000);\n\t}\n\t\n\tstd::cout << \"Camera Application successfully terminated\" << std::endl;\n}\n<commit_msg>Made tracking visual<commit_after>#include <opencv2\/core\/core.hpp>\n#include <iostream>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <ifaddrs.h>\n#include <netinet\/in.h> \n#include <string.h> \n#include <arpa\/inet.h>\n\n#include <ros\/ros.h>\n\n#include \"libfreenect.hpp\"\n#include \"CvKinect.hpp\"\n#include \"CvImageProcessor.hpp\"\n#include \"Communicator.hpp\"\n\nbool startsWith(const char *prefix, const char *str)\n{\n\tsize_t lenPrefix = strlen(prefix),\n\tlenStr = strlen(str);\n\treturn lenStr < lenPrefix ? false : strncmp(prefix, str, lenPrefix) == 0;\n}\n\n\/\/ Gets the ip address of the machine\nchar* getIpAddress()\n{\n\tstruct ifaddrs * ifAddrStruct = NULL;\n\tstruct ifaddrs * ifa = NULL;\n\tvoid * tmpAddrPtr = NULL;\n\tchar* result = 0;\n\t\n\t\n\tgetifaddrs(&ifAddrStruct);\n\t\n\tfor (ifa = ifAddrStruct; ifa != NULL; ifa = ifa->ifa_next) {\n\t\t\/\/ If address type is IPv4\n\t\tif (ifa ->ifa_addr->sa_family==AF_INET) {\n tmpAddrPtr=&((struct sockaddr_in *)ifa->ifa_addr)->sin_addr;\n\t\t\tchar addressBuffer[INET_ADDRSTRLEN];\n\t\t\tinet_ntop(AF_INET, tmpAddrPtr, addressBuffer, INET_ADDRSTRLEN);\n\t\t\t\n\t\t\tif (startsWith(\"eth\", ifa->ifa_name)) {\n\t\t\t\tresult = (char*) malloc(INET_ADDRSTRLEN * sizeof(char));\n\t\t\t\tstrcpy(result, addressBuffer);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t\/\/ std::cout << ifa->ifa_name << \" IP Address is \" << addressBuffer << std::endl;\n\t\t} else\n\t\t\t\/\/ If address type is IPv6\n\t\t\tif (ifa->ifa_addr->sa_family==AF_INET6) {\n tmpAddrPtr=&((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr;\n\t\t\tchar addressBuffer[INET6_ADDRSTRLEN];\n\t\t\tinet_ntop(AF_INET6, tmpAddrPtr, addressBuffer, INET6_ADDRSTRLEN);\n\t\t\t\/\/ printf(\"%s IP Address %s\\n\", ifa->ifa_name, addressBuffer); \n\t\t} \n\t}\n\t\n\tif (ifAddrStruct!=NULL) {\n\t\tfreeifaddrs(ifAddrStruct);\n\t}\n\t\n\treturn result;\n}\n\nint main(int argc, char** argv)\n{\n\tstd::cout << \"Starting Camera Application\" << std::endl;\n\t\n\tchar* ip = getIpAddress();\n\t\n\tif (ip == 0) {\n\t\tstd::cout << \"No ip address found. Terminating\" << std::endl;\n\t\texit(1);\n\t} else {\n\t\t\/\/ Replace . with _\n\t\tfor (int i = 0; ip[i] != 0; i++) {\n\t\t\tif (ip[i] == '.') {\n\t\t\t\tip[i] = '_';\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\/\/ Create node name.\n\tchar nodeName[80];\n\tstrcpy(nodeName, \"Camera_Application_\");\n\tstrcat(nodeName, ip);\n\tfree(ip);\n\t\n\tros::init(argc, argv, nodeName);\n\t\n\tif( ros::console::set_logger_level(ROSCONSOLE_DEFAULT_NAME, ros::console::levels::Debug) ) {\n\t\tros::console::notifyLoggerLevelsChanged();\n\t}\n\t\n\tFreenect::Freenect freenect;\n\tCvKinect& device = freenect.createDevice<CvKinect>(0);\n\tCvImageProcessor* analyzer = new CvImageProcessor(&device, 0, true, false);\n\/\/ \tCvImageProcessor* analyzer = new CvImageProcessor(&device, 0);\n\t\n\t\/\/ Do ROS stuff.\n\tCommunicator comm(&device, analyzer);\n\tanalyzer->setDataReceiver(&comm);\n\tanalyzer->start();\n\t\n\tROS_INFO(\"Initialized Kinect.\");\n\tros::spin();\n\tROS_INFO(\"Shutting down.\");\n\t\n\tanalyzer->stop();\n\t\n\tros::shutdown();\n\tstd::cout << \"ros::shutdown() sent\" << std::endl;\n\t\n\t\/\/ Wait for ros to shutdown.\n\twhile (ros::ok()) {\n\t\tusleep(10000);\n\t}\n\t\n\tstd::cout << \"Camera Application successfully terminated\" << std::endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <proxygen\/lib\/http\/codec\/compress\/HPACKCodec.h>\n\n#include <algorithm>\n#include <folly\/String.h>\n#include <folly\/io\/Cursor.h>\n#include <proxygen\/lib\/http\/codec\/compress\/HPACKHeader.h>\n\nusing folly::IOBuf;\nusing folly::io::Cursor;\nusing proxygen::compress::Header;\nusing proxygen::compress::HeaderPiece;\nusing proxygen::compress::HeaderPieceList;\nusing std::unique_ptr;\nusing std::vector;\n\nnamespace proxygen {\n\nconst std::string kHpackNpn = \"spdy\/3.1-fb-0.5\";\n\nHPACKCodec::HPACKCodec(TransportDirection direction) {\n HPACK::MessageType encoderType;\n HPACK::MessageType decoderType;\n if (direction == TransportDirection::DOWNSTREAM) {\n decoderType = HPACK::MessageType::REQ;\n encoderType = HPACK::MessageType::RESP;\n } else {\n \/\/ UPSTREAM\n decoderType = HPACK::MessageType::RESP;\n encoderType = HPACK::MessageType::REQ;\n }\n encoder_ = folly::make_unique<HPACKEncoder>(encoderType, true);\n decoder_ = folly::make_unique<HPACKDecoder>(decoderType);\n}\n\nunique_ptr<IOBuf> HPACKCodec::encode(vector<Header>& headers) noexcept {\n vector<HPACKHeader> converted;\n \/\/ convert to HPACK API format\n uint32_t uncompressed = 0;\n for (const auto& h : headers) {\n HPACKHeader header(*h.name, *h.value);\n \/\/ This is ugly but since we're not changing the size\n \/\/ of the string I'm assuming this is OK\n char* mutableName = const_cast<char*>(header.name.data());\n folly::toLowerAscii(mutableName, header.name.size());\n converted.push_back(header);\n uncompressed += header.name.size() + header.value.size() + 2;\n }\n auto buf = encoder_->encode(converted, encodeHeadroom_);\n encodedSize_.compressed = 0;\n if (buf) {\n encodedSize_.compressed = buf->computeChainDataLength();\n }\n encodedSize_.uncompressed = uncompressed;\n if (stats_) {\n stats_->recordEncode(Type::HPACK, encodedSize_);\n }\n return std::move(buf);\n}\n\nResult<HeaderDecodeResult, HeaderDecodeError>\nHPACKCodec::decode(Cursor& cursor, uint32_t length) noexcept {\n outHeaders_.clear();\n decodedHeaders_.clear();\n auto consumed = decoder_->decode(cursor, length, decodedHeaders_);\n if (decoder_->hasError()) {\n if (stats_) {\n stats_->recordDecodeError(Type::HPACK);\n }\n if (decoder_->getError() == HPACKDecoder::Error::HEADERS_TOO_LARGE) {\n return HeaderDecodeError::HEADERS_TOO_LARGE;\n }\n return HeaderDecodeError::BAD_ENCODING;\n }\n \/\/ convert to HeaderPieceList\n uint32_t uncompressed = 0;\n \/\/ sort the headers to detect duplicates\/multi-valued headers\n \/\/ * this is really unrelated to HPACK, just a need to mimic GzipHeaderCodec\n sort(decodedHeaders_.begin(), decodedHeaders_.end());\n\n for (uint32_t i = 0; i < decodedHeaders_.size(); i++) {\n const HPACKHeader& h = decodedHeaders_[i];\n bool multiValued =\n (i > 0 && decodedHeaders_[i - 1].name == h.name) ||\n (i < decodedHeaders_.size() - 1 && decodedHeaders_[i + 1].name == h.name);\n \/\/ one entry for the name and one for the value\n outHeaders_.push_back(HeaderPiece((char *)h.name.c_str(), h.name.size(),\n false, multiValued));\n outHeaders_.push_back(HeaderPiece((char *)h.value.c_str(), h.value.size(),\n false, multiValued));\n uncompressed += h.name.size() + h.value.size() + 2;\n }\n decodedSize_.compressed = consumed;\n decodedSize_.uncompressed = uncompressed;\n if (stats_) {\n stats_->recordDecode(Type::HPACK, decodedSize_);\n }\n return HeaderDecodeResult{outHeaders_, consumed};\n}\n\n}\n<commit_msg>Remove extra sort()<commit_after>\/*\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n *\/\n#include <proxygen\/lib\/http\/codec\/compress\/HPACKCodec.h>\n\n#include <algorithm>\n#include <folly\/String.h>\n#include <folly\/io\/Cursor.h>\n#include <proxygen\/lib\/http\/codec\/compress\/HPACKHeader.h>\n\nusing folly::IOBuf;\nusing folly::io::Cursor;\nusing proxygen::compress::Header;\nusing proxygen::compress::HeaderPiece;\nusing proxygen::compress::HeaderPieceList;\nusing std::unique_ptr;\nusing std::vector;\n\nnamespace proxygen {\n\nconst std::string kHpackNpn = \"spdy\/3.1-fb-0.5\";\n\nHPACKCodec::HPACKCodec(TransportDirection direction) {\n HPACK::MessageType encoderType;\n HPACK::MessageType decoderType;\n if (direction == TransportDirection::DOWNSTREAM) {\n decoderType = HPACK::MessageType::REQ;\n encoderType = HPACK::MessageType::RESP;\n } else {\n \/\/ UPSTREAM\n decoderType = HPACK::MessageType::RESP;\n encoderType = HPACK::MessageType::REQ;\n }\n encoder_ = folly::make_unique<HPACKEncoder>(encoderType, true);\n decoder_ = folly::make_unique<HPACKDecoder>(decoderType);\n}\n\nunique_ptr<IOBuf> HPACKCodec::encode(vector<Header>& headers) noexcept {\n vector<HPACKHeader> converted;\n \/\/ convert to HPACK API format\n uint32_t uncompressed = 0;\n for (const auto& h : headers) {\n HPACKHeader header(*h.name, *h.value);\n \/\/ This is ugly but since we're not changing the size\n \/\/ of the string I'm assuming this is OK\n char* mutableName = const_cast<char*>(header.name.data());\n folly::toLowerAscii(mutableName, header.name.size());\n converted.push_back(header);\n uncompressed += header.name.size() + header.value.size() + 2;\n }\n auto buf = encoder_->encode(converted, encodeHeadroom_);\n encodedSize_.compressed = 0;\n if (buf) {\n encodedSize_.compressed = buf->computeChainDataLength();\n }\n encodedSize_.uncompressed = uncompressed;\n if (stats_) {\n stats_->recordEncode(Type::HPACK, encodedSize_);\n }\n return std::move(buf);\n}\n\nResult<HeaderDecodeResult, HeaderDecodeError>\nHPACKCodec::decode(Cursor& cursor, uint32_t length) noexcept {\n outHeaders_.clear();\n decodedHeaders_.clear();\n auto consumed = decoder_->decode(cursor, length, decodedHeaders_);\n if (decoder_->hasError()) {\n if (stats_) {\n stats_->recordDecodeError(Type::HPACK);\n }\n if (decoder_->getError() == HPACKDecoder::Error::HEADERS_TOO_LARGE) {\n return HeaderDecodeError::HEADERS_TOO_LARGE;\n }\n return HeaderDecodeError::BAD_ENCODING;\n }\n \/\/ convert to HeaderPieceList\n uint32_t uncompressed = 0;\n for (uint32_t i = 0; i < decodedHeaders_.size(); i++) {\n const HPACKHeader& h = decodedHeaders_[i];\n \/\/ SPDYCodec uses this 'multi-valued' flag to detect illegal duplicates\n \/\/ Since HPACK does not preclude duplicates, pretend everything is\n \/\/ multi-valued\n bool multiValued = true;\n \/\/ one entry for the name and one for the value\n outHeaders_.emplace_back((char *)h.name.c_str(), h.name.size(),\n false, multiValued);\n outHeaders_.emplace_back((char *)h.value.c_str(), h.value.size(),\n false, multiValued);\n uncompressed += h.name.size() + h.value.size() + 2;\n }\n decodedSize_.compressed = consumed;\n decodedSize_.uncompressed = uncompressed;\n if (stats_) {\n stats_->recordDecode(Type::HPACK, decodedSize_);\n }\n return HeaderDecodeResult{outHeaders_, consumed};\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\nCopyright (c) 2013 Daniele Bartolini, Michele Rossi\nCopyright (c) 2012 Daniele Bartolini, Simone Boscaratto\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <jni.h>\n#include <android\/sensor.h>\n#include <android_native_app_glue.h>\n#include \"Allocator.h\"\n#include \"Device.h\"\n#include \"Log.h\"\n#include \"OsEventQueue.h\"\n#include \"Renderer.h\"\n#include \"Touch.h\"\n#include \"OsWindow.h\"\n\nnamespace crown\n{\n\nANativeWindow* g_android_window;\nAAssetManager* g_android_asset_manager;\n\nclass AndroidDevice : public Device\n{\npublic:\n\n\t\/\/-----------------------------------------------------------------------------\n\tAndroidDevice()\n\t\t: m_game_thread(\"game_thread\")\n\t{\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_fileserver = 1;\n\t\t#endif\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid display_modes(Array<DisplayMode>& \/*modes*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid set_display_mode(uint32_t \/*id*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid set_fullscreen(bool \/*full*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\tvoid run(struct android_app* app)\n\t{\n\t\tapp->userData = this;\n\t\tapp->onAppCmd = crown::AndroidDevice::on_app_cmd;\n\t\tapp->onInputEvent = crown::AndroidDevice::on_input_event;\n\t\tg_android_asset_manager = app->activity->assetManager;\n\n\t\twhile (app->destroyRequested == 0)\n\t\t{\n\t\t\tint32_t num;\n\t\t\tandroid_poll_source* source;\n\t\t\t\/*int32_t id =*\/ ALooper_pollAll(-1, NULL, &num, (void**)&source);\n\n\t\t\tif (NULL != source)\n\t\t\t{\n\t\t\t\tsource->process(app, source);\n\t\t\t}\n\t\t}\n\n\t\tm_game_thread.stop();\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tint32_t run(int, char**)\n\t{\n\t\treturn 0;\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid loop()\n\t{\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_console = CE_NEW(default_allocator(), ConsoleServer)();\n\t\t\tm_console->init(m_console_port, false);\n\t\t#endif\n\n\t\tDevice::init();\n\n\t\t\/\/ Push metrics here since Android does not trigger APP_CMD_WINDOW_RESIZED\n\t\tconst int32_t width = ANativeWindow_getWidth(g_android_window);\n\t\tconst int32_t height = ANativeWindow_getHeight(g_android_window);\n\t\tm_queue.push_metrics_event(0, 0, width, height);\n\n\t\twhile (is_running() && !process_events())\n\t\t{\n\t\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\t\tm_console->update();\n\t\t\t#endif\n\n\t\t\tDevice::frame();\n\t\t\tm_touch->update();\n\t\t\tm_keyboard->update();\n\t\t}\n\n\t\tDevice::shutdown();\n\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_console->shutdown();\n\t\t\tCE_DELETE(default_allocator(), m_console);\n\t\t#endif\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic int32_t main_loop(void* thiz)\n\t{\n\t\treturn ((AndroidDevice*) thiz)->loop();\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tbool process_events()\n\t{\n\t\tOsEvent event;\n\n\t\twhile (m_queue.pop_event(event))\n\t\t{\n\t\t\tif (event.type == OsEvent::NONE) continue;\n\n\t\t\tswitch (event.type)\n\t\t\t{\n\t\t\t\tcase OsEvent::TOUCH:\n\t\t\t\t{\n\t\t\t\t\tconst OsTouchEvent& ev = event.touch;\n\t\t\t\t\tswitch (ev.type)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase OsTouchEvent::POINTER: m_touch->set_pointer_state(ev.x, ev.y, ev.pointer_id, ev.pressed); break;\n\t\t\t\t\t\tcase OsTouchEvent::MOVE: m_touch->set_position(ev.pointer_id, ev.x, ev.y); break;\n\t\t\t\t\t\tdefault: CE_FATAL(\"Oops, unknown touch event type\"); break;\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::KEYBOARD:\n\t\t\t\t{\n\t\t\t\t\tconst OsKeyboardEvent& ev = event.keyboard;\n\t\t\t\t\tm_keyboard->set_button_state(ev.button, ev.pressed);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::METRICS:\n\t\t\t\t{\n\t\t\t\t\tconst OsMetricsEvent& ev = event.metrics;\n\t\t\t\t\tm_window->m_x = ev.x;\n\t\t\t\t\tm_window->m_y = ev.y;\n\t\t\t\t\tm_window->m_width = ev.width;\n\t\t\t\t\tm_window->m_height = ev.height;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::EXIT:\n\t\t\t\t{\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::PAUSE:\n\t\t\t\t{\n\t\t\t\t\tpause();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::RESUME:\n\t\t\t\t{\n\t\t\t\t\tunpause();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t{\n\t\t\t\t\tCE_FATAL(\"Unknown Os Event\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic void on_app_cmd(struct android_app* app, int32_t cmd)\n\t{\n\t\t((AndroidDevice*) app->userData)->process_command(app, cmd);\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid process_command(struct android_app* app, int32_t cmd)\n\t{\n\t\tswitch (cmd)\n\t\t{\n\t\t\tcase APP_CMD_SAVE_STATE:\n\t\t\t{\n\t\t\t\t\/\/ \/\/ The system has asked us to save our current state. Do so.\n\t\t\t\t\/\/ engine->app->savedState = malloc(sizeof(struct saved_state));\n\t\t\t\t\/\/ *((struct saved_state*)engine->app->savedState) = engine->state;\n\t\t\t\t\/\/ engine->app->savedStateSize = sizeof(struct saved_state);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_INIT_WINDOW:\n\t\t\t{\n\t\t\t\tCE_ASSERT(app->window != NULL, \"Android window is NULL\");\n\t\t\t\tg_android_window = app->window;\n\t\t\t\tm_game_thread.start(main_loop, (void*)this);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_TERM_WINDOW:\n\t\t\t{\n\t\t\t\t\/\/ The window is being hidden or closed, clean it up.\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_WINDOW_RESIZED:\n\t\t\t{\n\t\t\t\t\/\/ Not triggered by Android\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_GAINED_FOCUS:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_LOST_FOCUS:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_DESTROY:\n\t\t\t{\n\t\t\t\tm_queue.push_exit_event(0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic int32_t on_input_event(struct android_app* app, AInputEvent* event)\n\t{\n\t\treturn ((AndroidDevice*) app->userData)->process_input(app, event);\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tint32_t process_input(struct android_app* app, AInputEvent* event)\n\t{\n\t\tif (AInputEvent_getType(event) == AINPUT_EVENT_TYPE_MOTION)\n\t\t{\n\t\t\tconst int32_t action = AMotionEvent_getAction(event);\n\t\t\tconst int32_t pointerIndex = (action & AMOTION_EVENT_ACTION_POINTER_INDEX_MASK) >> AMOTION_EVENT_ACTION_POINTER_INDEX_SHIFT;\n\t\t\tconst int32_t pointerCount = AMotionEvent_getPointerCount(event);\n\n\t\t\tconst int32_t pointerId = AMotionEvent_getPointerId(event, pointerIndex);\n\t\t\tconst float x = AMotionEvent_getX(event, pointerIndex);\n\t\t\tconst float y = AMotionEvent_getY(event, pointerIndex);\n\n\t\t\tconst int32_t actionMasked = (action & AMOTION_EVENT_ACTION_MASK);\n\n\t\t\tswitch (actionMasked)\n\t\t\t{\t\n\t\t\t\tcase AMOTION_EVENT_ACTION_DOWN:\n\t\t\t\tcase AMOTION_EVENT_ACTION_POINTER_DOWN:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, true);\n\t\t\t\t\tbreak;\t\t\t\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_UP:\n\t\t\t\tcase AMOTION_EVENT_ACTION_POINTER_UP:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, false);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_OUTSIDE:\n\t\t\t\tcase AMOTION_EVENT_ACTION_CANCEL:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, false);\n\t\t\t\t\tbreak;\t\t\t\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_MOVE:\n\t\t\t\t{\n\t\t\t\t\tfor (int index = 0; index < pointerCount; index++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst float xx = AMotionEvent_getX(event, index);\n\t\t\t\t\t\tconst float yy = AMotionEvent_getY(event, index);\n\t\t\t\t\t\tconst int32_t id = AMotionEvent_getPointerId(event, index);\n\t\t\t\t\t\tm_queue.push_touch_event((uint16_t) xx, (uint16_t) yy, (uint8_t) id);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn 1;\n\t\t}\n\t\telse if (AInputEvent_getType(event) == AINPUT_EVENT_TYPE_KEY)\n\t\t{\n\t\t\tconst int32_t keycode = AKeyEvent_getKeyCode(event);\n\t\t\tconst int32_t keyaction = AKeyEvent_getAction(event);\n\n\t\t\tif (keycode == AKEYCODE_BACK)\n\t\t\t{\n\t\t\t\tm_queue.push_keyboard_event(0, KeyboardButton::ESCAPE, keyaction == AKEY_EVENT_ACTION_DOWN ? true : false);\n\t\t\t}\n\n\t\t\treturn 1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\nprivate:\n\n\tOsEventQueue m_queue;\n\tOsThread m_game_thread;\n};\n\n} \/\/ namespace crown\n\nvoid android_main(struct android_app* app)\n{\n\t\/\/ Make sure glue isn't stripped.\n\tapp_dummy();\n\n\tcrown::memory::init();\n\tcrown::os::init_os();\n\tcrown::AndroidDevice* engine = CE_NEW(crown::default_allocator(), crown::AndroidDevice)();\n\tcrown::set_device(engine);\n\n\tengine->run(app);\n\n\tCE_DELETE(crown::default_allocator(), engine);\n\tcrown::memory::shutdown();\n}\n<commit_msg>Force exit fron android activity<commit_after>\/*\nCopyright (c) 2013 Daniele Bartolini, Michele Rossi\nCopyright (c) 2012 Daniele Bartolini, Simone Boscaratto\n\nPermission is hereby granted, free of charge, to any person\nobtaining a copy of this software and associated documentation\nfiles (the \"Software\"), to deal in the Software without\nrestriction, including without limitation the rights to use,\ncopy, modify, merge, publish, distribute, sublicense, and\/or sell\ncopies of the Software, and to permit persons to whom the\nSoftware is furnished to do so, subject to the following\nconditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES\nOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT\nHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,\nWHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\nFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR\nOTHER DEALINGS IN THE SOFTWARE.\n*\/\n\n#include <jni.h>\n#include <android\/sensor.h>\n#include <android_native_app_glue.h>\n#include \"Allocator.h\"\n#include \"Device.h\"\n#include \"Log.h\"\n#include \"OsEventQueue.h\"\n#include \"Renderer.h\"\n#include \"Touch.h\"\n#include \"OsWindow.h\"\n\nnamespace crown\n{\n\nANativeWindow* g_android_window;\nAAssetManager* g_android_asset_manager;\n\nclass AndroidDevice : public Device\n{\npublic:\n\n\t\/\/-----------------------------------------------------------------------------\n\tAndroidDevice()\n\t\t: m_game_thread(\"game_thread\")\n\t{\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_fileserver = 1;\n\t\t#endif\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid display_modes(Array<DisplayMode>& \/*modes*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid set_display_mode(uint32_t \/*id*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid set_fullscreen(bool \/*full*\/)\n\t{\n\t\t\/\/ Do nothing\n\t}\n\n\tvoid run(struct android_app* app)\n\t{\n\t\tapp->userData = this;\n\t\tapp->onAppCmd = crown::AndroidDevice::on_app_cmd;\n\t\tapp->onInputEvent = crown::AndroidDevice::on_input_event;\n\t\tg_android_asset_manager = app->activity->assetManager;\n\n\t\twhile (app->destroyRequested == 0)\n\t\t{\n\t\t\tint32_t num;\n\t\t\tandroid_poll_source* source;\n\t\t\t\/*int32_t id =*\/ ALooper_pollAll(-1, NULL, &num, (void**)&source);\n\n\t\t\tif (NULL != source)\n\t\t\t{\n\t\t\t\tsource->process(app, source);\n\t\t\t}\n\t\t}\n\n\t\tm_game_thread.stop();\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tint32_t run(int, char**)\n\t{\n\t\treturn 0;\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tint32_t loop()\n\t{\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_console = CE_NEW(default_allocator(), ConsoleServer)();\n\t\t\tm_console->init(m_console_port, false);\n\t\t#endif\n\n\t\tDevice::init();\n\n\t\t\/\/ Push metrics here since Android does not trigger APP_CMD_WINDOW_RESIZED\n\t\tconst int32_t width = ANativeWindow_getWidth(g_android_window);\n\t\tconst int32_t height = ANativeWindow_getHeight(g_android_window);\n\t\tm_queue.push_metrics_event(0, 0, width, height);\n\n\t\twhile (is_running() && !process_events())\n\t\t{\n\t\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\t\tm_console->update();\n\t\t\t#endif\n\n\t\t\tDevice::frame();\n\t\t\tm_touch->update();\n\t\t\tm_keyboard->update();\n\t\t}\n\n\t\tDevice::shutdown();\n\n\t\t#if defined(CROWN_DEBUG) || defined(CROWN_DEVELOPMENT)\n\t\t\tm_console->shutdown();\n\t\t\tCE_DELETE(default_allocator(), m_console);\n\t\t#endif\n\n\t\texit(EXIT_SUCCESS);\n\t\treturn 0;\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic int32_t main_loop(void* thiz)\n\t{\n\t\treturn ((AndroidDevice*) thiz)->loop();\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tbool process_events()\n\t{\n\t\tOsEvent event;\n\n\t\twhile (m_queue.pop_event(event))\n\t\t{\n\t\t\tif (event.type == OsEvent::NONE) continue;\n\n\t\t\tswitch (event.type)\n\t\t\t{\n\t\t\t\tcase OsEvent::TOUCH:\n\t\t\t\t{\n\t\t\t\t\tconst OsTouchEvent& ev = event.touch;\n\t\t\t\t\tswitch (ev.type)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase OsTouchEvent::POINTER: m_touch->set_pointer_state(ev.x, ev.y, ev.pointer_id, ev.pressed); break;\n\t\t\t\t\t\tcase OsTouchEvent::MOVE: m_touch->set_position(ev.pointer_id, ev.x, ev.y); break;\n\t\t\t\t\t\tdefault: CE_FATAL(\"Oops, unknown touch event type\"); break;\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::KEYBOARD:\n\t\t\t\t{\n\t\t\t\t\tconst OsKeyboardEvent& ev = event.keyboard;\n\t\t\t\t\tm_keyboard->set_button_state(ev.button, ev.pressed);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::METRICS:\n\t\t\t\t{\n\t\t\t\t\tconst OsMetricsEvent& ev = event.metrics;\n\t\t\t\t\tm_window->m_x = ev.x;\n\t\t\t\t\tm_window->m_y = ev.y;\n\t\t\t\t\tm_window->m_width = ev.width;\n\t\t\t\t\tm_window->m_height = ev.height;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::EXIT:\n\t\t\t\t{\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::PAUSE:\n\t\t\t\t{\n\t\t\t\t\tpause();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase OsEvent::RESUME:\n\t\t\t\t{\n\t\t\t\t\tunpause();\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t{\n\t\t\t\t\tCE_FATAL(\"Unknown Os Event\");\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic void on_app_cmd(struct android_app* app, int32_t cmd)\n\t{\n\t\t((AndroidDevice*) app->userData)->process_command(app, cmd);\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tvoid process_command(struct android_app* app, int32_t cmd)\n\t{\n\t\tswitch (cmd)\n\t\t{\n\t\t\tcase APP_CMD_SAVE_STATE:\n\t\t\t{\n\t\t\t\t\/\/ \/\/ The system has asked us to save our current state. Do so.\n\t\t\t\t\/\/ engine->app->savedState = malloc(sizeof(struct saved_state));\n\t\t\t\t\/\/ *((struct saved_state*)engine->app->savedState) = engine->state;\n\t\t\t\t\/\/ engine->app->savedStateSize = sizeof(struct saved_state);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_INIT_WINDOW:\n\t\t\t{\n\t\t\t\tCE_ASSERT(app->window != NULL, \"Android window is NULL\");\n\t\t\t\tg_android_window = app->window;\n\t\t\t\tm_game_thread.start(main_loop, (void*)this);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_TERM_WINDOW:\n\t\t\t{\n\t\t\t\t\/\/ The window is being hidden or closed, clean it up.\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_WINDOW_RESIZED:\n\t\t\t{\n\t\t\t\t\/\/ Not triggered by Android\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_GAINED_FOCUS:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_LOST_FOCUS:\n\t\t\t{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase APP_CMD_DESTROY:\n\t\t\t{\n\t\t\t\tm_queue.push_exit_event(0);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tstatic int32_t on_input_event(struct android_app* app, AInputEvent* event)\n\t{\n\t\treturn ((AndroidDevice*) app->userData)->process_input(app, event);\n\t}\n\n\t\/\/-----------------------------------------------------------------------------\n\tint32_t process_input(struct android_app* app, AInputEvent* event)\n\t{\n\t\tif (AInputEvent_getType(event) == AINPUT_EVENT_TYPE_MOTION)\n\t\t{\n\t\t\tconst int32_t action = AMotionEvent_getAction(event);\n\t\t\tconst int32_t pointerIndex = (action & AMOTION_EVENT_ACTION_POINTER_INDEX_MASK) >> AMOTION_EVENT_ACTION_POINTER_INDEX_SHIFT;\n\t\t\tconst int32_t pointerCount = AMotionEvent_getPointerCount(event);\n\n\t\t\tconst int32_t pointerId = AMotionEvent_getPointerId(event, pointerIndex);\n\t\t\tconst float x = AMotionEvent_getX(event, pointerIndex);\n\t\t\tconst float y = AMotionEvent_getY(event, pointerIndex);\n\n\t\t\tconst int32_t actionMasked = (action & AMOTION_EVENT_ACTION_MASK);\n\n\t\t\tswitch (actionMasked)\n\t\t\t{\t\n\t\t\t\tcase AMOTION_EVENT_ACTION_DOWN:\n\t\t\t\tcase AMOTION_EVENT_ACTION_POINTER_DOWN:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, true);\n\t\t\t\t\tbreak;\t\t\t\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_UP:\n\t\t\t\tcase AMOTION_EVENT_ACTION_POINTER_UP:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, false);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_OUTSIDE:\n\t\t\t\tcase AMOTION_EVENT_ACTION_CANCEL:\n\t\t\t\t{\n\t\t\t\t\tm_queue.push_touch_event((uint16_t) x, (uint16_t) y, (uint8_t) pointerId, false);\n\t\t\t\t\tbreak;\t\t\t\n\t\t\t\t}\n\t\t\t\tcase AMOTION_EVENT_ACTION_MOVE:\n\t\t\t\t{\n\t\t\t\t\tfor (int index = 0; index < pointerCount; index++)\n\t\t\t\t\t{\n\t\t\t\t\t\tconst float xx = AMotionEvent_getX(event, index);\n\t\t\t\t\t\tconst float yy = AMotionEvent_getY(event, index);\n\t\t\t\t\t\tconst int32_t id = AMotionEvent_getPointerId(event, index);\n\t\t\t\t\t\tm_queue.push_touch_event((uint16_t) xx, (uint16_t) yy, (uint8_t) id);\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\treturn 1;\n\t\t}\n\t\telse if (AInputEvent_getType(event) == AINPUT_EVENT_TYPE_KEY)\n\t\t{\n\t\t\tconst int32_t keycode = AKeyEvent_getKeyCode(event);\n\t\t\tconst int32_t keyaction = AKeyEvent_getAction(event);\n\n\t\t\tif (keycode == AKEYCODE_BACK)\n\t\t\t{\n\t\t\t\tm_queue.push_keyboard_event(0, KeyboardButton::ESCAPE, keyaction == AKEY_EVENT_ACTION_DOWN ? true : false);\n\t\t\t}\n\n\t\t\treturn 1;\n\t\t}\n\n\t\treturn 0;\n\t}\n\nprivate:\n\n\tOsEventQueue m_queue;\n\tOsThread m_game_thread;\n};\n\n} \/\/ namespace crown\n\nvoid android_main(struct android_app* app)\n{\n\t\/\/ Make sure glue isn't stripped.\n\tapp_dummy();\n\n\tcrown::memory::init();\n\tcrown::os::init_os();\n\tcrown::AndroidDevice* engine = CE_NEW(crown::default_allocator(), crown::AndroidDevice)();\n\tcrown::set_device(engine);\n\n\tengine->run(app);\n\n\tCE_DELETE(crown::default_allocator(), engine);\n\tcrown::memory::shutdown();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <list>\n#include <functional>\n#include <random>\n#include <memory>\n#include \"GL\/gl.h\"\n#include \"GL\/wglext.h\"\n#include \"GL\/glu.h\"\n#include \"GLFW\/glfw3.h\"\n#include \"countof.h\"\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::vector;\nusing std::list;\nusing std::function;\n\n\nvoid ding_r(float x, float y, float r);\nvoid ding(float x, float y, float r=0) {\n\tif (r) {\n\t\tding_r(x, y, r);\n\t\treturn;\n\t}\n\tfloat a = 0.4;\n\tfloat b = 0.4;\n\tfloat p[] = {\n\t\tx+a, y,\n\t\tx, y+b,\n\t\tx-a, y,\n\t\tx, y-b\n\t};\n\tint p_c = COUNTOF(p);\n\tglEnableClientState(GL_VERTEX_ARRAY);\n\tglVertexPointer(2, GL_FLOAT, 0, p);\n\tglDrawArrays(GL_LINE_LOOP, 0, p_c\/2);\n}\n\nvoid ding_r(float x, float y, float r) {\n\tfloat a = 0.4;\n\tfloat b = 0.4;\n\tfloat p[] = {\n\t\ta, 0,\n\t\t0, b,\n\t\t-a, 0,\n\t\t0, -b\n\t};\n\tint p_c = COUNTOF(p);\n\tfor (int i=0; i<p_c; i+=2) {\n\t\tfloat xx = cos(r) * p[i] - sin(r) * p[i+1];\n\t\tfloat yy = sin(r) * p[i] + cos(r) * p[i+1];\n\t\tp[i] = xx + x;;\n\t\tp[i+1] = yy + y;\n\t}\n\tglEnableClientState(GL_VERTEX_ARRAY);\n\tglVertexPointer(2, GL_FLOAT, 0, p);\n\tglDrawArrays(GL_LINE_LOOP, 0, p_c\/2);\n}\n\nstruct vec2 {\n\tfloat x;\n\tfloat y;\n\n\tfloat dist2(vec2 b) {\n\t\tfloat dx = b.x-x, dy = b.y-y, len2=dx*dx+dy*dy;\n\t\treturn len2;\n\t}\n};\n\nstd::mt19937 rng;\n\ntypedef unsigned long long guid;\nguid random_guid() {\n\treturn std::uniform_int_distribution<guid>()(rng);\n}\n\nstruct Object {\n\tObject() {}\n\tObject(vec2 pos, vec2 speed) : pos(pos), speed(speed) {}\n\tlong guid = random_guid();\n\tvec2 pos;\n\tvec2 speed;\n\n\tbool operator==(const Object& other) {\n\t\treturn guid == other.guid;\n\t}\n};\n\n\n\n\ntemplate<typename T, typename... Args>\nstruct OwnedCallback {\n\tObject& o;\n\tfunction<T(Args...)> cb;\n\n\tT operator()(Args... args) {\n\t\treturn cb(args...);\n\t}\n};\n\nstruct Collision {\n\t\/\/ For now, simple quadratic collision\n\tstruct Entry {\n\t\tObject& o;\n\t};\n\tlist<Entry> chaff;\n\tlist<Entry> bullets;\n\n\tvoid check(function<void(Object&, Object&)> fn) {\n\t\tfloat size = 0.1;\n\t\tfor (auto x : chaff) {\n\t\t\tfor (auto y : bullets) {\n\t\t\t\tif (x.o.pos.dist2(y.o.pos) < size*size) fn(x.o, y.o);\n\t\t\t}\n\t\t}\n\t\tfor (auto x : chaff) {\n\t\t\tfor (auto y : chaff) {\n\t\t\t\tif (x.o == y.o) continue;\n\t\t\t\tif (x.o.pos.dist2(y.o.pos) < size*size) fn(x.o, y.o);\n\t\t\t}\n\t\t}\n\t}\n};\n\nstruct World {\n\tlist<Object> objects; \/\/ could be a vector, but reallocs will kill references in callbacks\n\tlist<OwnedCallback<void>> tick_events;\n\tlist<OwnedCallback<void>> queue;\n\tlist<OwnedCallback<void, int, int, int, int>> key_events;\n\tlist<Object*> killQueue;\n\n\tCollision collisions;\n\n\tvoid tick(float dt) {\n\t\tfor (auto& o : objects) {\n\t\t\to.pos.x += o.speed.x * dt;\n\t\t\to.pos.y += o.speed.y * dt;\n\t\t}\n\t\tfor (auto t : tick_events) {\n\t\t\tt();\n\t\t}\n\t\tcollisions.check([](Object& a, Object& b) {\n\t\t\tcout << \"collision: \" << a.guid << \" x \" << b.guid << endl;\n\t\t});\n\t\tfor (auto o : killQueue) {\n\t\t\treal_kill(*o);\n\t\t}\n\t\tkillQueue.erase(killQueue.begin(), killQueue.end());\n\t}\n\n\tObject* find_by_guid(guid g) {\n\t\tfor (auto& o : objects) {\n\t\t\tif (o.guid == g) {\n\t\t\t\treturn &o;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\n\t}\n\n\tObject& add_object() {\n\t\tobjects.push_back(Object());\n\t\treturn objects.back();\n\t}\n\n\tvoid keyfun(int key, int scancode, int action, int mods) {\n\t\t\/*\n\t\t * [in]\twindow\tThe window that received the event.\n\t\t * [in]\tkey\tThe keyboard key that was pressed or released.\n\t\t * [in]\tscancode\tThe system-specific scancode of the key.\n\t\t * [in]\taction\tGLFW_PRESS, GLFW_RELEASE or GLFW_REPEAT.\n\t\t * [in]\tmods\tBit field describing which modifier keys were held down\n\t\t *\/\n\t\tfor (auto x : key_events) {\n\t\t\tx(key, scancode, action, mods);\n\t\t}\n\t}\n\n\tvoid bind_key(int key, Object& o, std::function<void()> callback) {\n\t\tkey_events.push_back(OwnedCallback<void, int, int, int, int>{o, [=](int key2, int scancode, int action, int mods){\n\t\t\tif (key2 == key and action == GLFW_PRESS) {\n\t\t\t\tcallback();\n\t\t\t}\n\t\t}});\n\t}\n\n\tvoid on_tick(Object& o, std::function<void()> callback) {\n\t\ttick_events.push_back(OwnedCallback<void>{o, callback});\n\t}\n\n\tvoid kill(Object& o) {\n\t\tkillQueue.push_back(&o);\n\t}\n\n\tvoid real_kill(Object& o) {\n\t\tcout << \"Killing: \" << o.guid << endl;\n\t\tkey_events.remove_if([&](OwnedCallback<void, int, int, int, int>& oc) { return oc.o == o; });\n\t\ttick_events.remove_if([&](OwnedCallback<void>& oc) { return oc.o == o; });\n\t\tqueue.remove_if([&](OwnedCallback<void>& oc) { return oc.o == o; });\n\t\tcollisions.chaff.remove_if([&](Collision::Entry& e) { return e.o == o; });\n\t\tcollisions.bullets.remove_if([&](Collision::Entry& e) { return e.o == o; });\n\t\tobjects.remove(o);\n\n\t}\n};\n\nGLFWwindow* window;\nWorld* cb_world;\nvoid cb_key(GLFWwindow*, int key, int scancode, int action, int mods) {\n\tcb_world->keyfun(key, scancode, action, mods);\n}\n\n\n\nvoid WrapScreen(World& w, Object& o) {\n\tw.tick_events.push_back(OwnedCallback<void>{o, [&o](){\n\t\tfloat m = 0.1;\n\t\tfloat xa = -16-m, xb = 16+m, ya=-9-m, yb=9+m;\n\t\tfloat xw=xb-xa, yw=yb-ya;\n\t\tif (o.pos.x < xa) {\n\t\t\to.pos.x += xw;\n\t\t}\n\t\tif (o.pos.x > xb) {\n\t\t\to.pos.x -= xw;\n\t\t}\n\t\tif (o.pos.y < ya) {\n\t\t\to.pos.y += yw;\n\t\t}\n\t\tif (o.pos.y > yb) {\n\t\t\to.pos.y -= yw;\n\t\t}\n\t}});\n}\n\nvoid KillWhenExitingScreen(World& w, Object& o) {\n\tw.tick_events.push_back(OwnedCallback<void>{o, [&w, &o]() { \/\/ This can run less often\n\t\tfloat xa=-16, xb=16, ya=-9, yb=9;\n\t\tif (o.pos.x < xa or o.pos.x > xb or o.pos.y < ya or o.pos.y > yb) {\n\t\t\tw.kill(o);\n\t\t}\n\t}});\n}\n\nvoid Asteroid(World& w, Object& o) {\n\to.pos.x = std::uniform_real_distribution<float>(-1, 1)(rng);\n\to.pos.y = std::uniform_real_distribution<float>(-1, 1)(rng);\n\tfloat speed = 0.3;\n\tfloat angle = std::uniform_real_distribution<float>(0, 44.\/7)(rng);\n\to.speed.x = cos(angle)*speed;\n\to.speed.y = sin(angle)*speed;\n\tWrapScreen(w, o);\n\tw.collisions.chaff.push_back(Collision::Entry{o});\n}\n\n\nvoid Bullet(World& w, Object& o) {\n\tKillWhenExitingScreen(w, o);\n\tw.collisions.bullets.push_back(Collision::Entry{o});\n}\n\n\nvoid Player(World& w, Object& o) {\n\tAsteroid(w, o);\n\tstd::shared_ptr<float> angle(new float);\n\n\tw.on_tick(o, [&o, angle](){\n\t\tif (glfwGetKey(window, GLFW_KEY_RIGHT)) {\n\t\t\t*angle -= 0.1;\n\t\t}\n\t\tif (glfwGetKey(window, GLFW_KEY_LEFT)) {\n\t\t\t*angle += 0.1;\n\t\t}\n\t\tif (glfwGetKey(window, GLFW_KEY_UP)) {\n\t\t\tfloat acc = 0.1;\n\t\t\to.speed.x += cos(*angle)*acc;\n\t\t\to.speed.y += sin(*angle)*acc;\n\t\t}\n\t\tding_r(o.pos.x, o.pos.y, *angle);\n\t});\n\tw.bind_key(GLFW_KEY_SPACE, o, [&w, &o, angle](){\n\t\tauto& as = w.add_object();\n\t\tBullet(w, as);\n\t\tas.pos = o.pos;\n\t\tfloat v = 4;\n\t\tas.speed.x = cos(*angle)*v;\n\t\tas.speed.y = sin(*angle)*v;\n\t});\n}\n\n\nint main(void)\n{\n\tif (!glfwInit())\n\t\treturn -1;\n\tglfwWindowHint(GLFW_SAMPLES, 4);\n\n\t\/\/ window = glfwCreateWindow(1366, 768, \"Hello World\", glfwGetPrimaryMonitor(), 0);\n\twindow = glfwCreateWindow(800, 480, \"Hello World\", 0, 0);\n\n\tif (!window)\n\t{\n\t\tcerr << \"Could not create window\" << endl;\n\t\tglfwTerminate();\n\t\texit(-1);\n\t}\n\n\tWorld world;\n\tcb_world = &world;\n\tglfwSetKeyCallback(window, cb_key);\n\n\tfor (int i=0; i<5; ++i) {\n\t\tAsteroid(world, world.add_object());\n\t}\n\tPlayer(world, world.add_object());\n\n\n\t\/* Make the window's context current *\/\n\tglfwMakeContextCurrent(window);\n\tdouble t0 = glfwGetTime();\n\tcout << glGetString(GL_VENDOR) << endl;\n\tcout << glGetString(GL_VERSION) << endl;\n\tcout << glGetString(GL_RENDERER) << endl;\n\n\tPFNWGLSWAPINTERVALEXTPROC wglSwapIntervalEXT = (PFNWGLSWAPINTERVALEXTPROC)glfwGetProcAddress(\"wglSwapIntervalEXT\");\n\tif (wglSwapIntervalEXT) {\n\t\twglSwapIntervalEXT(1);\n\t} else {\n\t\tcerr << \"VSync not available\" << endl;\n\t}\n\n\tglMatrixMode(GL_PROJECTION);\n\tglOrtho(-16, 16, -9, 9, 1, -1);\n\tglMatrixMode(GL_MODELVIEW);\n\n\t\/* Loop until the user closes the window *\/\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\tdouble t1 = glfwGetTime();\n\t\tfloat dt = (t1 - t0);\n\t\tt0 = t1;\n\t\t\/* Render here *\/\n\t\tglClearColor(1,.98, 1 ,0);\n\t\tglClear(GL_COLOR_BUFFER_BIT);\n\n\t\tglColor3f(.5,.2,0);\n\t\tworld.tick(dt);\n\t\tfor (auto o : world.objects) {\n\t\t\tding(o.pos.x, o.pos.y);\n\t\t}\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglfwTerminate();\n\treturn 0;\n}\n<commit_msg>Err, renderer.. with... objects..?<commit_after>#include <iostream>\n#include <array>\n#include <vector>\n#include <list>\n#include <functional>\n#include <random>\n#include <memory>\n#include \"GL\/gl.h\"\n#include \"GL\/wglext.h\"\n#include \"GL\/glu.h\"\n#include \"GLFW\/glfw3.h\"\n#include \"countof.h\"\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\nusing std::vector;\nusing std::array;\nusing std::list;\nusing std::function;\n\n\nstruct vec2 {\n\tfloat x;\n\tfloat y;\n\n\tfloat dist2(vec2 b) {\n\t\tfloat dx = b.x-x, dy = b.y-y, len2=dx*dx+dy*dy;\n\t\treturn len2;\n\t}\n};\n\nstd::mt19937 rng;\n\ntypedef unsigned long long guid;\nguid random_guid() {\n\treturn std::uniform_int_distribution<guid>()(rng);\n}\n\nstruct Object {\n\tObject() {}\n\tObject(vec2 pos, vec2 speed) : pos(pos), speed(speed) {}\n\tlong guid = random_guid();\n\tvec2 pos;\n\tvec2 speed;\n\n\tbool operator==(const Object& other) {\n\t\treturn guid == other.guid;\n\t}\n};\n\n\n\n\ntemplate<typename T, typename... Args>\nstruct OwnedCallback {\n\tObject& o;\n\tfunction<T(Args...)> cb;\n\n\tT operator()(Args... args) {\n\t\treturn cb(args...);\n\t}\n};\n\nstruct Collision {\n\t\/\/ For now, simple quadratic collision\n\tstruct Entry {\n\t\tObject& o;\n\t};\n\tlist<Entry> chaff;\n\tlist<Entry> bullets;\n\n\tvoid check(function<void(Object&, Object&)> fn) {\n\t\tfloat size = 0.1;\n\t\tfor (auto x : chaff) {\n\t\t\tfor (auto y : bullets) {\n\t\t\t\tif (x.o.pos.dist2(y.o.pos) < size*size) fn(x.o, y.o);\n\t\t\t}\n\t\t}\n\t\tfor (auto x : chaff) {\n\t\t\tfor (auto y : chaff) {\n\t\t\t\tif (x.o == y.o) continue;\n\t\t\t\tif (x.o.pos.dist2(y.o.pos) < size*size) fn(x.o, y.o);\n\t\t\t}\n\t\t}\n\t}\n};\n\nconst float AST[] {\n\t0.4, 0,\n\t0, 0.4,\n\t-0.4, 0,\n\t0, -0.4,\n};\nconst float SDX =.4, SYG=.8, SYD=.2, SYDD=.4;\nconst float SHIP[] {\n\t-SDX, -SYDD,\n\t0, SYG,\n\tSDX, -SYDD,\n\t0, -SYD,\n};\nconst float BULLET[] {\n\t-1, 0,\n\t1, 0\n};\n\nconst float* const MODELS[] { AST, SHIP, BULLET };\nstatic constexpr int SIZES[] { 4, 4, 2 };\n\n\nstruct Renderer {\n\n\tstruct Entry {\n\t\tObject& o;\n\t\tunsigned model;\n\t};\n\tlist<Entry> entries;\n\n\tvoid add(Object& o, unsigned model) {\n\t\tentries.push_back(Entry { o, model });\n\t}\n\n\tvoid render() {\n\t\tglEnableClientState(GL_VERTEX_ARRAY);\n\t\tfor (auto& e: entries) {\n\t\t\trender(e);\n\t\t}\n\t}\n\n\tvoid render(Entry& e) {\n\t\tfloat x = e.o.pos.x;\n\t\tfloat y = e.o.pos.y;\n\t\tfloat r = 0;\n\t\tconst float* p = MODELS[e.model];\n\t\tint c = SIZES[e.model];\n\t\tglPushMatrix();\n\t\tglTranslatef(x, y, 0);\n\t\tglVertexPointer(2, GL_FLOAT, 0, p);\n\t\tglDrawArrays(GL_LINE_LOOP, 0, c);\n\t\tglPopMatrix();\n\t}\n};\n\nstruct World {\n\tlist<Object> objects; \/\/ could be a vector, but reallocs will kill references in callbacks\n\tlist<OwnedCallback<void>> tick_events;\n\tlist<OwnedCallback<void>> queue;\n\tlist<OwnedCallback<void, int, int, int, int>> key_events;\n\tlist<Object*> killQueue;\n\n\tCollision collisions;\n\tRenderer renderer;\n\n\tvoid tick(float dt) {\n\t\tfor (auto& o : objects) {\n\t\t\to.pos.x += o.speed.x * dt;\n\t\t\to.pos.y += o.speed.y * dt;\n\t\t}\n\t\tfor (auto t : tick_events) {\n\t\t\tt();\n\t\t}\n\t\tcollisions.check([](Object& a, Object& b) {\n\t\t\tcout << \"collision: \" << a.guid << \" x \" << b.guid << endl;\n\t\t});\n\t\tfor (auto o : killQueue) {\n\t\t\treal_kill(*o);\n\t\t}\n\t\tkillQueue.erase(killQueue.begin(), killQueue.end());\n\t}\n\n\tObject* find_by_guid(guid g) {\n\t\tfor (auto& o : objects) {\n\t\t\tif (o.guid == g) {\n\t\t\t\treturn &o;\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\n\t}\n\n\tObject& add_object() {\n\t\tobjects.push_back(Object());\n\t\treturn objects.back();\n\t}\n\n\tvoid keyfun(int key, int scancode, int action, int mods) {\n\t\t\/*\n\t\t * [in]\twindow\tThe window that received the event.\n\t\t * [in]\tkey\tThe keyboard key that was pressed or released.\n\t\t * [in]\tscancode\tThe system-specific scancode of the key.\n\t\t * [in]\taction\tGLFW_PRESS, GLFW_RELEASE or GLFW_REPEAT.\n\t\t * [in]\tmods\tBit field describing which modifier keys were held down\n\t\t *\/\n\t\tfor (auto x : key_events) {\n\t\t\tx(key, scancode, action, mods);\n\t\t}\n\t}\n\n\tvoid bind_key(int key, Object& o, std::function<void()> callback) {\n\t\tkey_events.push_back(OwnedCallback<void, int, int, int, int>{o, [=](int key2, int scancode, int action, int mods){\n\t\t\tif (key2 == key and action == GLFW_PRESS) {\n\t\t\t\tcallback();\n\t\t\t}\n\t\t}});\n\t}\n\n\tvoid on_tick(Object& o, std::function<void()> callback) {\n\t\ttick_events.push_back(OwnedCallback<void>{o, callback});\n\t}\n\n\tvoid kill(Object& o) {\n\t\tkillQueue.push_back(&o);\n\t}\n\n\tvoid real_kill(Object& o) {\n\t\tcout << \"Killing: \" << o.guid << endl;\n\t\tkey_events.remove_if([&](OwnedCallback<void, int, int, int, int>& oc) { return oc.o == o; });\n\t\ttick_events.remove_if([&](OwnedCallback<void>& oc) { return oc.o == o; });\n\t\tqueue.remove_if([&](OwnedCallback<void>& oc) { return oc.o == o; });\n\t\tcollisions.chaff.remove_if([&](Collision::Entry& e) { return e.o == o; });\n\t\tcollisions.bullets.remove_if([&](Collision::Entry& e) { return e.o == o; });\n\t\trenderer.entries.remove_if([&](Renderer::Entry& e) { return e.o == o; });\n\t\tobjects.remove(o);\n\n\t}\n};\n\nGLFWwindow* window;\nWorld* cb_world;\nvoid cb_key(GLFWwindow*, int key, int scancode, int action, int mods) {\n\tcb_world->keyfun(key, scancode, action, mods);\n}\n\n\n\nvoid WrapScreen(World& w, Object& o) {\n\tw.tick_events.push_back(OwnedCallback<void>{o, [&o](){\n\t\tfloat m = 0.1;\n\t\tfloat xa = -16-m, xb = 16+m, ya=-9-m, yb=9+m;\n\t\tfloat xw=xb-xa, yw=yb-ya;\n\t\tif (o.pos.x < xa) {\n\t\t\to.pos.x += xw;\n\t\t}\n\t\tif (o.pos.x > xb) {\n\t\t\to.pos.x -= xw;\n\t\t}\n\t\tif (o.pos.y < ya) {\n\t\t\to.pos.y += yw;\n\t\t}\n\t\tif (o.pos.y > yb) {\n\t\t\to.pos.y -= yw;\n\t\t}\n\t}});\n}\n\nvoid KillWhenExitingScreen(World& w, Object& o) {\n\tw.tick_events.push_back(OwnedCallback<void>{o, [&w, &o]() { \/\/ This can run less often\n\t\tfloat xa=-16, xb=16, ya=-9, yb=9;\n\t\tif (o.pos.x < xa or o.pos.x > xb or o.pos.y < ya or o.pos.y > yb) {\n\t\t\tw.kill(o);\n\t\t}\n\t}});\n}\n\nvoid Asteroid(World& w, Object& o) {\n\tw.renderer.add(o, 0);\n\to.pos.x = std::uniform_real_distribution<float>(-16, 16)(rng);\n\to.pos.y = std::uniform_real_distribution<float>(-9, 9)(rng);\n\tfloat speed = 0.3;\n\tfloat angle = std::uniform_real_distribution<float>(0, 44.\/7)(rng);\n\to.speed.x = cos(angle)*speed;\n\to.speed.y = sin(angle)*speed;\n\tWrapScreen(w, o);\n\tw.collisions.chaff.push_back(Collision::Entry{o});\n}\n\n\nvoid Bullet(World& w, Object& o) {\n\tKillWhenExitingScreen(w, o);\n\tw.renderer.add(o, 2);\n\tw.collisions.bullets.push_back(Collision::Entry{o});\n}\n\n\nvoid Player(World& w, Object& o) {\n\to.pos.x = o.pos.y = 0;\n\to.speed.x = o.speed.y = 0;\n\tWrapScreen(w, o);\n\tw.collisions.chaff.push_back(Collision::Entry{o});\n\tw.renderer.add(o, 1);\n\tstd::shared_ptr<float> angle(new float);\n\n\tw.on_tick(o, [&o, angle](){\n\t\tif (glfwGetKey(window, GLFW_KEY_RIGHT)) {\n\t\t\t*angle -= 0.1;\n\t\t}\n\t\tif (glfwGetKey(window, GLFW_KEY_LEFT)) {\n\t\t\t*angle += 0.1;\n\t\t}\n\t\tif (glfwGetKey(window, GLFW_KEY_UP)) {\n\t\t\tfloat acc = 0.1;\n\t\t\to.speed.x += cos(*angle)*acc;\n\t\t\to.speed.y += sin(*angle)*acc;\n\t\t}\n\t\t\/\/ding_r(o.pos.x, o.pos.y, *angle);\n\t});\n\tw.bind_key(GLFW_KEY_SPACE, o, [&w, &o, angle](){\n\t\tauto& as = w.add_object();\n\t\tBullet(w, as);\n\t\tas.pos = o.pos;\n\t\tfloat v = 16;\n\t\tas.speed.x = cos(*angle)*v;\n\t\tas.speed.y = sin(*angle)*v;\n\t});\n}\n\n\nint main(void)\n{\n\tif (!glfwInit())\n\t\treturn -1;\n\tglfwWindowHint(GLFW_SAMPLES, 4);\n\n\t\/\/ window = glfwCreateWindow(1366, 768, \"Hello World\", glfwGetPrimaryMonitor(), 0);\n\twindow = glfwCreateWindow(800, 480, \"Hello World\", 0, 0);\n\n\tif (!window)\n\t{\n\t\tcerr << \"Could not create window\" << endl;\n\t\tglfwTerminate();\n\t\texit(-1);\n\t}\n\n\tWorld world;\n\tcb_world = &world;\n\tglfwSetKeyCallback(window, cb_key);\n\n\tfor (int i=0; i<5; ++i) {\n\t\tAsteroid(world, world.add_object());\n\t}\n\tPlayer(world, world.add_object());\n\n\n\t\/* Make the window's context current *\/\n\tglfwMakeContextCurrent(window);\n\tdouble t0 = glfwGetTime();\n\tcout << glGetString(GL_VENDOR) << endl;\n\tcout << glGetString(GL_VERSION) << endl;\n\tcout << glGetString(GL_RENDERER) << endl;\n\n\tPFNWGLSWAPINTERVALEXTPROC wglSwapIntervalEXT = (PFNWGLSWAPINTERVALEXTPROC)glfwGetProcAddress(\"wglSwapIntervalEXT\");\n\tif (wglSwapIntervalEXT) {\n\t\twglSwapIntervalEXT(1);\n\t} else {\n\t\tcerr << \"VSync not available\" << endl;\n\t}\n\n\tglMatrixMode(GL_PROJECTION);\n\tglOrtho(-16, 16, -9, 9, 1, -1);\n\tglMatrixMode(GL_MODELVIEW);\n\n\t\/* Loop until the user closes the window *\/\n\twhile (!glfwWindowShouldClose(window))\n\t{\n\t\tdouble t1 = glfwGetTime();\n\t\tfloat dt = (t1 - t0);\n\t\tt0 = t1;\n\t\t\/* Render here *\/\n\t\tglClearColor(1,.98, 1 ,0);\n\t\tglClear(GL_COLOR_BUFFER_BIT);\n\n\t\tglColor3f(.5,.2,0);\n\t\tworld.tick(dt);\n\t\tworld.renderer.render();\n\n\t\tglfwSwapBuffers(window);\n\t\tglfwPollEvents();\n\t}\n\n\tglfwTerminate();\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tabarea.cxx,v $\n * $Revision: 1.12 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n\/\/ include ---------------------------------------------------------------\n\n#include <tools\/ref.hxx>\n#include <sfx2\/app.hxx>\n#include <sfx2\/objsh.hxx>\n#ifndef _MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#include <svtools\/pathoptions.hxx>\n#include <svx\/svdmark.hxx>\n#include <svx\/svdobj.hxx>\n#include <svx\/svdview.hxx>\n\n#define _SVX_TABAREA_CXX\n\n#include <svx\/dialogs.hrc>\n\n\n\n\n\n\n#include <svx\/xtable.hxx>\n#include \"globl3d.hxx\"\n#include <svx\/svdmodel.hxx>\n#include \"drawitem.hxx\"\n#include \"cuitabarea.hxx\"\n#include \"tabarea.hrc\"\n#include \"dlgname.hxx\"\n#include \"dlgname.hrc\"\n#include <svx\/dialmgr.hxx>\n\n#define DLGWIN this->GetParent()->GetParent()\n\n\/*************************************************************************\n|*\n|* Konstruktor des Tab-Dialogs: Fuegt die Seiten zum Dialog hinzu\n|*\n|************************************************************************\/\n\nSvxAreaTabDialog::SvxAreaTabDialog\n(\n Window* pParent,\n const SfxItemSet* pAttr,\n SdrModel* pModel,\n const SdrView* \/* pSdrView *\/\n) :\n\n SfxTabDialog( pParent, SVX_RES( RID_SVXDLG_AREA ), pAttr ),\n\n mpDrawModel ( pModel ),\n\/\/ mpView ( pSdrView ),\n mpColorTab ( pModel->GetColorTable() ),\n mpNewColorTab ( pModel->GetColorTable() ),\n mpGradientList ( pModel->GetGradientList() ),\n mpNewGradientList ( pModel->GetGradientList() ),\n mpHatchingList ( pModel->GetHatchList() ),\n mpNewHatchingList ( pModel->GetHatchList() ),\n mpBitmapList ( pModel->GetBitmapList() ),\n mpNewBitmapList ( pModel->GetBitmapList() ),\n mrOutAttrs ( *pAttr ),\n mnColorTableState ( CT_NONE ),\n mnBitmapListState ( CT_NONE ),\n mnGradientListState ( CT_NONE ),\n mnHatchingListState ( CT_NONE ),\n mnPageType( PT_AREA ),\n mnDlgType( 0 ),\n mnPos( 0 ),\n mbAreaTP( sal_False ),\n mbDeleteColorTable( TRUE )\n{\n FreeResource();\n\n AddTabPage( RID_SVXPAGE_AREA, SvxAreaTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_SHADOW, SvxShadowTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_TRANSPARENCE, SvxTransparenceTabPage::Create, 0);\n AddTabPage( RID_SVXPAGE_COLOR, SvxColorTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_GRADIENT, SvxGradientTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_HATCH, SvxHatchTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_BITMAP, SvxBitmapTabPage::Create, 0);\n\n SetCurPageId( RID_SVXPAGE_AREA );\n\n CancelButton& rBtnCancel = GetCancelButton();\n rBtnCancel.SetClickHdl( LINK( this, SvxAreaTabDialog, CancelHdlImpl ) );\n\/\/! rBtnCancel.SetText( SVX_RESSTR( RID_SVXSTR_CLOSE ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxAreaTabDialog::~SvxAreaTabDialog()\n{\n}\n\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxAreaTabDialog::SavePalettes()\n{\n if( mpNewColorTab != mpDrawModel->GetColorTable() )\n {\n if(mbDeleteColorTable)\n delete mpDrawModel->GetColorTable();\n mpDrawModel->SetColorTable( mpNewColorTab );\n SfxObjectShell::Current()->PutItem( SvxColorTableItem( mpNewColorTab, SID_COLOR_TABLE ) );\n mpColorTab = mpDrawModel->GetColorTable();\n }\n if( mpNewGradientList != mpDrawModel->GetGradientList() )\n {\n delete mpDrawModel->GetGradientList();\n mpDrawModel->SetGradientList( mpNewGradientList );\n SfxObjectShell::Current()->PutItem( SvxGradientListItem( mpNewGradientList, SID_GRADIENT_LIST ) );\n mpGradientList = mpDrawModel->GetGradientList();\n }\n if( mpNewHatchingList != mpDrawModel->GetHatchList() )\n {\n delete mpDrawModel->GetHatchList();\n mpDrawModel->SetHatchList( mpNewHatchingList );\n SfxObjectShell::Current()->PutItem( SvxHatchListItem( mpNewHatchingList, SID_HATCH_LIST ) );\n mpHatchingList = mpDrawModel->GetHatchList();\n }\n if( mpNewBitmapList != mpDrawModel->GetBitmapList() )\n {\n delete mpDrawModel->GetBitmapList();\n mpDrawModel->SetBitmapList( mpNewBitmapList );\n SfxObjectShell::Current()->PutItem( SvxBitmapListItem( mpNewBitmapList, SID_BITMAP_LIST ) );\n mpBitmapList = mpDrawModel->GetBitmapList();\n }\n\n \/\/ Speichern der Tabellen, wenn sie geaendert wurden.\n\n const String aPath( SvtPathOptions().GetPalettePath() );\n\n if( mnHatchingListState & CT_MODIFIED )\n {\n mpHatchingList->SetPath( aPath );\n mpHatchingList->Save();\n\n \/\/ ToolBoxControls werden benachrichtigt:\n SfxObjectShell::Current()->PutItem( SvxHatchListItem( mpHatchingList, SID_HATCH_LIST ) );\n }\n\n if( mnBitmapListState & CT_MODIFIED )\n {\n mpBitmapList->SetPath( aPath );\n mpBitmapList->Save();\n\n \/\/ ToolBoxControls werden benachrichtigt:\n SfxObjectShell::Current()->PutItem( SvxBitmapListItem( mpBitmapList, SID_BITMAP_LIST ) );\n }\n\n if( mnGradientListState & CT_MODIFIED )\n {\n mpGradientList->SetPath( aPath );\n mpGradientList->Save();\n \/\/ ToolBoxControls werden benachrichtigt:\n SfxObjectShell::Current()->PutItem( SvxGradientListItem( mpGradientList, SID_GRADIENT_LIST ) );\n }\n\n if( mnColorTableState & CT_MODIFIED )\n {\n mpColorTab->SetPath( aPath );\n mpColorTab->Save();\n\n \/\/ ToolBoxControls werden benachrichtigt:\n SfxObjectShell::Current()->PutItem( SvxColorTableItem( mpColorTab, SID_COLOR_TABLE ) );\n }\n}\n\/\/ -----------------------------------------------------------------------\n\nshort SvxAreaTabDialog::Ok()\n{\n SavePalettes();\n\n \/\/ Es wird RET_OK zurueckgeliefert, wenn wenigstens eine\n \/\/ TabPage in FillItemSet() TRUE zurueckliefert. Dieses\n \/\/ geschieht z.Z. standardmaessig.\n return( SfxTabDialog::Ok() );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK_INLINE_START( SvxAreaTabDialog, CancelHdlImpl, void *, EMPTYARG)\n{\n SavePalettes();\n\n EndDialog( RET_CANCEL );\n return 0;\n}\nIMPL_LINK_INLINE_END( SvxAreaTabDialog, CancelHdlImpl, void *, p )\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxAreaTabDialog::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n switch( nId )\n {\n case RID_SVXPAGE_AREA:\n ( (SvxAreaTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxAreaTabPage&) rPage ).SetGradientList( mpGradientList );\n ( (SvxAreaTabPage&) rPage ).SetHatchingList( mpHatchingList );\n ( (SvxAreaTabPage&) rPage ).SetBitmapList( mpBitmapList );\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxAreaTabPage&) rPage ).SetPageType( mnPageType ); \/\/add CHINA001\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxAreaTabPage&) rPage ).SetDlgType( mnDlgType );\/\/add CHINA001\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetPos( &nPos );\n ( (SvxAreaTabPage&) rPage ).SetPos( mnPos );\/\/add CHINA001\n ( (SvxAreaTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxAreaTabPage&) rPage ).SetGrdChgd( &mnGradientListState );\n ( (SvxAreaTabPage&) rPage ).SetHtchChgd( &mnHatchingListState );\n ( (SvxAreaTabPage&) rPage ).SetBmpChgd( &mnBitmapListState );\n ( (SvxAreaTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxAreaTabPage&) rPage ).Construct();\n \/\/ ActivatePage() wird das erste mal nicht gerufen\n ( (SvxAreaTabPage&) rPage ).ActivatePage( mrOutAttrs );\n\n break;\n\n case RID_SVXPAGE_SHADOW:\n {\n ( (SvxShadowTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxShadowTabPage&) rPage ).SetPageType( mnPageType );\/\/CHINA001 ( (SvxShadowTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxShadowTabPage&) rPage ).SetDlgType( mnDlgType );\/\/CHINA001 ( (SvxShadowTabPage&) rPage ).SetDlgType( &mnDlgType );\n \/\/( (SvxShadowTabPage&) rPage ).SetPos( &nPos );\n ( (SvxShadowTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxShadowTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxShadowTabPage&) rPage ).Construct();\n }\n break;\n\n case RID_SVXPAGE_GRADIENT:\n ( (SvxGradientTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxGradientTabPage&) rPage ).SetGradientList( mpGradientList );\n ( (SvxGradientTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxGradientTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxGradientTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxGradientTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxGradientTabPage&) rPage ).SetGrdChgd( &mnGradientListState );\n ( (SvxGradientTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxGradientTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_HATCH:\n ( (SvxHatchTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxHatchTabPage&) rPage ).SetHatchingList( mpHatchingList );\n ( (SvxHatchTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxHatchTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxHatchTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxHatchTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxHatchTabPage&) rPage ).SetHtchChgd( &mnHatchingListState );\n ( (SvxHatchTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxHatchTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_BITMAP:\n ( (SvxBitmapTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxBitmapTabPage&) rPage ).SetBitmapList( mpBitmapList );\n ( (SvxBitmapTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxBitmapTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxBitmapTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxBitmapTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxBitmapTabPage&) rPage ).SetBmpChgd( &mnBitmapListState );\n ( (SvxBitmapTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxBitmapTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_COLOR:\n ( (SvxColorTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxColorTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxColorTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxColorTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxColorTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxColorTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxColorTabPage&) rPage ).SetDeleteColorTable( mbDeleteColorTable );\n ( (SvxColorTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_TRANSPARENCE:\n ( (SvxTransparenceTabPage&) rPage ).SetPageType( mnPageType );\/\/CHINA001 ( (SvxTransparenceTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxTransparenceTabPage&) rPage ).SetDlgType( mnDlgType );\/\/CHINA001 ( (SvxTransparenceTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxTransparenceTabPage&) rPage ).Construct();\n break;\n\n }\n}\n\n\n<commit_msg>INTEGRATION: CWS dba31a (1.12.100); FILE MERGED 2008\/07\/10 07:06:33 oj 1.12.100.1: #i88727# changes need to support none sfx apps<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: tabarea.cxx,v $\n * $Revision: 1.13 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_svx.hxx\"\n\n#ifdef SVX_DLLIMPLEMENTATION\n#undef SVX_DLLIMPLEMENTATION\n#endif\n\n\/\/ include ---------------------------------------------------------------\n\n#include <tools\/ref.hxx>\n#include <sfx2\/app.hxx>\n#include <sfx2\/objsh.hxx>\n#ifndef _MSGBOX_HXX \/\/autogen\n#include <vcl\/msgbox.hxx>\n#endif\n#include <svtools\/pathoptions.hxx>\n#include <svx\/svdmark.hxx>\n#include <svx\/svdobj.hxx>\n#include <svx\/svdview.hxx>\n\n#define _SVX_TABAREA_CXX\n\n#include <svx\/dialogs.hrc>\n\n\n\n\n\n\n#include <svx\/xtable.hxx>\n#include \"globl3d.hxx\"\n#include <svx\/svdmodel.hxx>\n#include \"drawitem.hxx\"\n#include \"cuitabarea.hxx\"\n#include \"tabarea.hrc\"\n#include \"dlgname.hxx\"\n#include \"dlgname.hrc\"\n#include <svx\/dialmgr.hxx>\n\n#define DLGWIN this->GetParent()->GetParent()\n\n\/*************************************************************************\n|*\n|* Konstruktor des Tab-Dialogs: Fuegt die Seiten zum Dialog hinzu\n|*\n|************************************************************************\/\n\nSvxAreaTabDialog::SvxAreaTabDialog\n(\n Window* pParent,\n const SfxItemSet* pAttr,\n SdrModel* pModel,\n const SdrView* \/* pSdrView *\/\n) :\n\n SfxTabDialog( pParent, SVX_RES( RID_SVXDLG_AREA ), pAttr ),\n\n mpDrawModel ( pModel ),\n\/\/ mpView ( pSdrView ),\n mpColorTab ( pModel->GetColorTable() ),\n mpNewColorTab ( pModel->GetColorTable() ),\n mpGradientList ( pModel->GetGradientList() ),\n mpNewGradientList ( pModel->GetGradientList() ),\n mpHatchingList ( pModel->GetHatchList() ),\n mpNewHatchingList ( pModel->GetHatchList() ),\n mpBitmapList ( pModel->GetBitmapList() ),\n mpNewBitmapList ( pModel->GetBitmapList() ),\n mrOutAttrs ( *pAttr ),\n mnColorTableState ( CT_NONE ),\n mnBitmapListState ( CT_NONE ),\n mnGradientListState ( CT_NONE ),\n mnHatchingListState ( CT_NONE ),\n mnPageType( PT_AREA ),\n mnDlgType( 0 ),\n mnPos( 0 ),\n mbAreaTP( sal_False ),\n mbDeleteColorTable( TRUE )\n{\n FreeResource();\n\n AddTabPage( RID_SVXPAGE_AREA, SvxAreaTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_SHADOW, SvxShadowTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_TRANSPARENCE, SvxTransparenceTabPage::Create, 0);\n AddTabPage( RID_SVXPAGE_COLOR, SvxColorTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_GRADIENT, SvxGradientTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_HATCH, SvxHatchTabPage::Create, 0 );\n AddTabPage( RID_SVXPAGE_BITMAP, SvxBitmapTabPage::Create, 0);\n\n SetCurPageId( RID_SVXPAGE_AREA );\n\n CancelButton& rBtnCancel = GetCancelButton();\n rBtnCancel.SetClickHdl( LINK( this, SvxAreaTabDialog, CancelHdlImpl ) );\n\/\/! rBtnCancel.SetText( SVX_RESSTR( RID_SVXSTR_CLOSE ) );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nSvxAreaTabDialog::~SvxAreaTabDialog()\n{\n}\n\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxAreaTabDialog::SavePalettes()\n{\n SfxObjectShell* pShell = SfxObjectShell::Current();\n \/*uno::Reference< frame::XDispatchProvider > xDispatchProvider;\n if ( !pShell )\n {\n uno::Reference< frame::XModel> xModel = mpDrawModel->getUnoModel();\n if ( xModel.is() )\n xDispatchProvider.set(xModel->getCurrentController(),uno::UNO_QUERY);\n }*\/\n if( mpNewColorTab != mpDrawModel->GetColorTable() )\n {\n if(mbDeleteColorTable)\n delete mpDrawModel->GetColorTable();\n mpDrawModel->SetColorTable( mpNewColorTab );\n SvxColorTableItem aColorTableItem( mpNewColorTab, SID_COLOR_TABLE );\n if ( pShell )\n pShell->PutItem( aColorTableItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aColorTableItem,SID_COLOR_TABLE);\n }\n mpColorTab = mpDrawModel->GetColorTable();\n }\n if( mpNewGradientList != mpDrawModel->GetGradientList() )\n {\n delete mpDrawModel->GetGradientList();\n mpDrawModel->SetGradientList( mpNewGradientList );\n SvxGradientListItem aItem( mpNewGradientList, SID_GRADIENT_LIST );\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem,SID_GRADIENT_LIST);\n }\n mpGradientList = mpDrawModel->GetGradientList();\n }\n if( mpNewHatchingList != mpDrawModel->GetHatchList() )\n {\n delete mpDrawModel->GetHatchList();\n mpDrawModel->SetHatchList( mpNewHatchingList );\n SvxHatchListItem aItem( mpNewHatchingList, SID_HATCH_LIST );\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem,SID_HATCH_LIST);\n }\n mpHatchingList = mpDrawModel->GetHatchList();\n }\n if( mpNewBitmapList != mpDrawModel->GetBitmapList() )\n {\n delete mpDrawModel->GetBitmapList();\n mpDrawModel->SetBitmapList( mpNewBitmapList );\n SvxBitmapListItem aItem( mpNewBitmapList, SID_BITMAP_LIST );\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem,SID_BITMAP_LIST);\n }\n mpBitmapList = mpDrawModel->GetBitmapList();\n }\n\n \/\/ Speichern der Tabellen, wenn sie geaendert wurden.\n\n const String aPath( SvtPathOptions().GetPalettePath() );\n\n if( mnHatchingListState & CT_MODIFIED )\n {\n mpHatchingList->SetPath( aPath );\n mpHatchingList->Save();\n\n SvxHatchListItem aItem( mpHatchingList, SID_HATCH_LIST );\n \/\/ ToolBoxControls werden benachrichtigt:\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem);\n }\n }\n\n if( mnBitmapListState & CT_MODIFIED )\n {\n mpBitmapList->SetPath( aPath );\n mpBitmapList->Save();\n\n SvxBitmapListItem aItem( mpBitmapList, SID_BITMAP_LIST );\n \/\/ ToolBoxControls werden benachrichtigt:\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem);\n }\n }\n\n if( mnGradientListState & CT_MODIFIED )\n {\n mpGradientList->SetPath( aPath );\n mpGradientList->Save();\n\n SvxGradientListItem aItem( mpGradientList, SID_GRADIENT_LIST );\n \/\/ ToolBoxControls werden benachrichtigt:\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem);\n }\n }\n\n if( mnColorTableState & CT_MODIFIED )\n {\n mpColorTab->SetPath( aPath );\n mpColorTab->Save();\n\n SvxColorTableItem aItem( mpColorTab, SID_COLOR_TABLE );\n \/\/ ToolBoxControls werden benachrichtigt:\n if ( pShell )\n pShell->PutItem( aItem );\n else\n {\n mpDrawModel->GetItemPool().Put(aItem);\n }\n }\n}\n\/\/ -----------------------------------------------------------------------\n\nshort SvxAreaTabDialog::Ok()\n{\n SavePalettes();\n\n \/\/ Es wird RET_OK zurueckgeliefert, wenn wenigstens eine\n \/\/ TabPage in FillItemSet() TRUE zurueckliefert. Dieses\n \/\/ geschieht z.Z. standardmaessig.\n return( SfxTabDialog::Ok() );\n}\n\n\/\/ -----------------------------------------------------------------------\n\nIMPL_LINK_INLINE_START( SvxAreaTabDialog, CancelHdlImpl, void *, EMPTYARG)\n{\n SavePalettes();\n\n EndDialog( RET_CANCEL );\n return 0;\n}\nIMPL_LINK_INLINE_END( SvxAreaTabDialog, CancelHdlImpl, void *, p )\n\n\/\/ -----------------------------------------------------------------------\n\nvoid SvxAreaTabDialog::PageCreated( USHORT nId, SfxTabPage &rPage )\n{\n switch( nId )\n {\n case RID_SVXPAGE_AREA:\n ( (SvxAreaTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxAreaTabPage&) rPage ).SetGradientList( mpGradientList );\n ( (SvxAreaTabPage&) rPage ).SetHatchingList( mpHatchingList );\n ( (SvxAreaTabPage&) rPage ).SetBitmapList( mpBitmapList );\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxAreaTabPage&) rPage ).SetPageType( mnPageType ); \/\/add CHINA001\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxAreaTabPage&) rPage ).SetDlgType( mnDlgType );\/\/add CHINA001\n \/\/CHINA001 ( (SvxAreaTabPage&) rPage ).SetPos( &nPos );\n ( (SvxAreaTabPage&) rPage ).SetPos( mnPos );\/\/add CHINA001\n ( (SvxAreaTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxAreaTabPage&) rPage ).SetGrdChgd( &mnGradientListState );\n ( (SvxAreaTabPage&) rPage ).SetHtchChgd( &mnHatchingListState );\n ( (SvxAreaTabPage&) rPage ).SetBmpChgd( &mnBitmapListState );\n ( (SvxAreaTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxAreaTabPage&) rPage ).Construct();\n \/\/ ActivatePage() wird das erste mal nicht gerufen\n ( (SvxAreaTabPage&) rPage ).ActivatePage( mrOutAttrs );\n\n break;\n\n case RID_SVXPAGE_SHADOW:\n {\n ( (SvxShadowTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxShadowTabPage&) rPage ).SetPageType( mnPageType );\/\/CHINA001 ( (SvxShadowTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxShadowTabPage&) rPage ).SetDlgType( mnDlgType );\/\/CHINA001 ( (SvxShadowTabPage&) rPage ).SetDlgType( &mnDlgType );\n \/\/( (SvxShadowTabPage&) rPage ).SetPos( &nPos );\n ( (SvxShadowTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxShadowTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxShadowTabPage&) rPage ).Construct();\n }\n break;\n\n case RID_SVXPAGE_GRADIENT:\n ( (SvxGradientTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxGradientTabPage&) rPage ).SetGradientList( mpGradientList );\n ( (SvxGradientTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxGradientTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxGradientTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxGradientTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxGradientTabPage&) rPage ).SetGrdChgd( &mnGradientListState );\n ( (SvxGradientTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxGradientTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_HATCH:\n ( (SvxHatchTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxHatchTabPage&) rPage ).SetHatchingList( mpHatchingList );\n ( (SvxHatchTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxHatchTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxHatchTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxHatchTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxHatchTabPage&) rPage ).SetHtchChgd( &mnHatchingListState );\n ( (SvxHatchTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxHatchTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_BITMAP:\n ( (SvxBitmapTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxBitmapTabPage&) rPage ).SetBitmapList( mpBitmapList );\n ( (SvxBitmapTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxBitmapTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxBitmapTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxBitmapTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxBitmapTabPage&) rPage ).SetBmpChgd( &mnBitmapListState );\n ( (SvxBitmapTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxBitmapTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_COLOR:\n ( (SvxColorTabPage&) rPage ).SetColorTable( mpColorTab );\n ( (SvxColorTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxColorTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxColorTabPage&) rPage ).SetPos( &mnPos );\n ( (SvxColorTabPage&) rPage ).SetAreaTP( &mbAreaTP );\n ( (SvxColorTabPage&) rPage ).SetColorChgd( &mnColorTableState );\n ( (SvxColorTabPage&) rPage ).SetDeleteColorTable( mbDeleteColorTable );\n ( (SvxColorTabPage&) rPage ).Construct();\n break;\n\n case RID_SVXPAGE_TRANSPARENCE:\n ( (SvxTransparenceTabPage&) rPage ).SetPageType( mnPageType );\/\/CHINA001 ( (SvxTransparenceTabPage&) rPage ).SetPageType( &mnPageType );\n ( (SvxTransparenceTabPage&) rPage ).SetDlgType( mnDlgType );\/\/CHINA001 ( (SvxTransparenceTabPage&) rPage ).SetDlgType( &mnDlgType );\n ( (SvxTransparenceTabPage&) rPage ).Construct();\n break;\n\n }\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/fastos\/fastos.h>\n#include \"filedb.h\"\n\n#include <boost\/filesystem.hpp>\n\nnamespace fs = boost::filesystem;\n\nnamespace {\n\nvoid copyDirectory(fs::path original, fs::path destination)\n{\n fs::create_directory(destination);\n for (fs::directory_iterator curr(original), end;\n curr != end;\n ++curr) {\n\n fs::path destPath = destination \/ curr->path().filename();\n if ( fs::is_directory(curr->status()) ) {\n copyDirectory(*curr, destPath);\n } else {\n fs::copy_file(*curr, destPath);\n }\n }\n}\n\n} \/\/anonymous namespace\n\nnamespace filedistribution {\n\nFileDB::FileDB(fs::path dbPath)\n : _dbPath(dbPath) {}\n\n\nvoid\nFileDB::add(fs::path original, const std::string &name) {\n fs::path targetPathTemp = _dbPath \/ (name + \".tmp\");\n fs::path targetPath = _dbPath \/ (name + \".new\");\n if (fs::exists(targetPath)) {\n return;\n }\n\n if (fs::exists(targetPathTemp)) {\n fs::remove_all(targetPathTemp);\n }\n\n fs::create_directory(targetPathTemp);\n if (!fs::is_directory(original)) {\n fs::copy_file(original, targetPathTemp \/ original.filename());\n } else {\n copyDirectory(original, targetPathTemp \/ original.filename());\n }\n\n assert(!fs::exists(targetPath));\n fs::rename(targetPathTemp, targetPath);\n}\n\n}\n<commit_msg>And then it should be safe to only do conditional copy.<commit_after>\/\/ Copyright 2016 Yahoo Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.\n#include <vespa\/fastos\/fastos.h>\n#include \"filedb.h\"\n\n#include <boost\/filesystem.hpp>\n\nnamespace fs = boost::filesystem;\n\nnamespace {\n\nvoid copyDirectory(fs::path original, fs::path destination)\n{\n fs::create_directory(destination);\n for (fs::directory_iterator curr(original), end;\n curr != end;\n ++curr) {\n\n fs::path destPath = destination \/ curr->path().filename();\n if ( fs::is_directory(curr->status()) ) {\n copyDirectory(*curr, destPath);\n } else {\n fs::copy_file(*curr, destPath);\n }\n }\n}\n\n} \/\/anonymous namespace\n\nnamespace filedistribution {\n\nFileDB::FileDB(fs::path dbPath)\n : _dbPath(dbPath) {}\n\n\nvoid\nFileDB::add(fs::path original, const std::string &name) {\n fs::path finalPath = _dbPath \/ name;\n if (fs::exists(finalPath)) {\n return;\n }\n fs::path targetPathTemp = _dbPath \/ (name + \".tmp\");\n fs::path targetPath = _dbPath \/ (name + \".new\");\n if (fs::exists(targetPath)) {\n return;\n }\n\n if (fs::exists(targetPathTemp)) {\n fs::remove_all(targetPathTemp);\n }\n\n fs::create_directory(targetPathTemp);\n if (!fs::is_directory(original)) {\n fs::copy_file(original, targetPathTemp \/ original.filename());\n } else {\n copyDirectory(original, targetPathTemp \/ original.filename());\n }\n\n assert(!fs::exists(targetPath));\n fs::rename(targetPathTemp, targetPath);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Elementary DMRG for Heisenberg S=1\/2 chain, \n\/\/ infinite system algorithm to build chain\n\/\/ ED with Lanczos\n\/\/ finite system sweep\n\/\/\n\/\/Roger Melko May 9 2006\n\n#include <blitz\/array.h>\n#include <fstream>\n\nBZ_USING_NAMESPACE(blitz)\n\n\/\/template function prototypes\ntemplate<typename T> Array<T,2> reduceM2M2(const Array<T,4>&, const int);\nvoid EigenValuesLAN(Array<double,4>&, Array<double,2>&, const int, double *);\nvoid DMlargeEigen(Array<double,2>&, Array<double,2>&, const int, const int);\n\n\/\/block object\nstruct BLOCK {\n int size; \/\/# of sites\n Array<double,2> HAp; \/\/A' block hamiltonian\n Array<double,2> SzL; \/\/Sz(left) operator \n Array<double,2> SmL; \/\/Sm(left) operator\n Array<double,2> SpL; \/\/Sp(left) operator\n};\n\nint main()\n{\n int iter, NumI;\n int i1, i1p, i2, i2p, i3, i4; \n int b1; \n int m, st; \/\/# states\n int sites; \/\/# sites\n double Eval; \/\/Eigenvalue\n BLOCK blk;\n ofstream fout;\n char fname[7];\n \n fname[0] = '0'; fname[1] = '0'; fname[2] = '0'; \n fname[3] = '.';\n fname[4] = 'E'; fname[5] = 'n'; fname[6] = 'v';\n\n cout<<\"# states to keep: \";\n cin>>m;\n\n \/\/Matrices\n Array<double,4> TSR(2,2,2,2); \/\/tensor product for Hab hamiltonian\n\n Array<double,4> Habcd(4,4,4,4); \/\/superblock hamiltonian\n Array<double,2> HAB(4,4); \/\/new SYSTEM Hamiltonian\n Array<double,2> Psi(4,4); \/\/ ground state wavefunction\n Array<double,2> rhoTSR(4,4); \/\/ reduced density matrix\n Array<double,2> OO(m,4); \/\/the TRUNCATION matrix\n Array<double,2> OT(4,m); \/\/ trasposed truncation matrix\n Array<double,2> Hl(4,m); \/\/ the left half of new system H\n\n \/\/create identity matrices\n Array<double,2> I2(2,2), I4(4,4), I2m(2*m,2*m); \n I2=0.0; I4=0.0; I2m=0.0;\n for (b1=0; b1<2; b1++) I2(b1,b1)=1.0;\n for (b1=0; b1<4; b1++) I4(b1,b1)=1.0;\n for (b1=0; b1<(2*m); b1++) I2m(b1,b1)=1.0;\n Array<double,2> I2st(4,4);\n I2st = I4;\n\n \/\/ Create pauli matrices\n Array<double,2> Sz(2,2), Sp(2,2), Sm(2,2);\n Sz = 0.5, 0,\n 0, -0.5;\n Sp = 0, 1.0,\n 0, 0;\n Sm = 0, 0,\n 1.0, 0;\n\n \/\/tensor indices\n firstIndex i; secondIndex j; \n thirdIndex k; fourthIndex l; \n\n cout<<\"Iterations : \";\n cin>>NumI;\n\n \/\/create a tensor product: two-site Hamiltonian\n TSR = Sz(i,k)*Sz(j,l)+ 0.5*Sp(i,k)*Sm(j,l) + 0.5*Sm(i,k)*Sp(j,l) ;\n \/\/write as 2D matrix in combined basis\n Array<double,2> H12 = reduceM2M2(TSR,2);\n \/\/cout<<\"H12 \"<<H12<<endl;\n\n TSR = Sz(i,k)*I2(j,l);\n Array<double,2> SzAB = reduceM2M2(TSR,2);\n\n TSR = Sm(i,k)*I2(j,l);\n Array<double,2> SmAB = reduceM2M2(TSR,2);\n\n TSR = Sp(i,k)*I2(j,l);\n Array<double,2> SpAB = reduceM2M2(TSR,2);\n\n HAB = H12;\n st = 2; \/\/start with a 2^2=4 state system\n sites = 2;\n\n \/******infinite system algorithm loop first iteration**********\/\n \/******build system until number of desired states m **********\/\n\n while(st <= m) {\n\n Habcd = HAB(i,k)*I2st(j,l) + I2st(i,k)*HAB(j,l) +\n SzAB(i,k)*SzAB(j,l)+ 0.5*SpAB(i,k)*SmAB(j,l) + 0.5*SmAB(i,k)*SpAB(j,l);\n \n EigenValuesLAN(Habcd,Psi,(4*st*st),&Eval);\n \n cout<<\"sites: \"<<2.0*sites;\n cout<<\" Energy: \"<<Eval\/(2.0*sites)<<endl;\n \n rhoTSR = 0;\n for (i1=0; i1< 2*st; i1++)\n for (i1p=0; i1p< 2*st; i1p++)\n for (i2=0; i2< 2*st; i2++)\n \t rhoTSR(i1,i1p) += Psi(i1,i2)*Psi(i1p,i2); \n\n OO.resize(2*st,2*st);\n OT.resize(2*st,2*st);\n DMlargeEigen(rhoTSR, OO, 2*st, 2*st); \n for (i1=0; i1<2*st; i1++)\n for (i2=0; i2< 2*st; i2++)\n OT(i1,i2) = OO(i2,i1); \/\/Transpose\n\n blk.HAp.resize(2*st,2*st);\n \/\/transform Operator Matrices to new basis\n Hl.resize(2*st,2*st);\n Hl = sum(HAB(i,k)*OT(k,j),k); \/\/Ha'\n blk.HAp = sum(OO(i,k)*Hl(k,j),k); \/\/(inner product)\n \n blk.SzL.resize(2*st,2*st);\n Hl = sum(SzAB(i,k)*OT(k,j),k); \n blk.SzL = sum(OO(i,k)*Hl(k,j),k);\n \n blk.SpL.resize(2*st,2*st);\n Hl = sum(SpAB(i,k)*OT(k,j),k); \n blk.SpL = sum(OO(i,k)*Hl(k,j),k);\n \n blk.SmL.resize(2*st,2*st);\n Hl = sum(SmAB(i,k)*OT(k,j),k); \n blk.SmL = sum(OO(i,k)*Hl(k,j),k);\n\n \/\/ Add a single spin (m*m*2*2 tensor)\n st *= 2;\n TSR.resize(st,2,st,2);\n \n TSR = blk.HAp(i,k)*I2(j,l) + blk.SzL(i,k)*Sz(j,l)+ \n 0.5*blk.SpL(i,k)*Sm(j,l) + 0.5*blk.SmL(i,k)*Sp(j,l) ;\n HAB.resize(2*st,2*st); \/\/Hamiltonian for next iteration\n HAB = reduceM2M2(TSR,st);\n \/\/ cout<<HAB<<endl;\n\n SzAB.resize(2*st,2*st); \/\/Operators for next iteration\n TSR = I2st(i,k)*Sz(j,l);\n SzAB = reduceM2M2(TSR,st);\n\n SpAB.resize(2*st,2*st);\n TSR = I2st(i,k)*Sp(j,l);\n SpAB = reduceM2M2(TSR,st);\n\n SmAB.resize(2*st,2*st);\n TSR = I2st(i,k)*Sm(j,l);\n SmAB = reduceM2M2(TSR,st); \n\n Habcd.resize(2*st,2*st,2*st,2*st); \/\/re-prepare superblock matrix\n Psi.resize(2*st,2*st); \/\/GS wavefunction\n rhoTSR.resize(2*st,2*st);\n \n\/\/ st *= 2;\n sites += 1;\n\n I2st.resize(4*st,4*st); \/\/redifine identity matrix\n I2st = 0.0;\n for (b1=0; b1<(4*st); b1++) I2st(b1,b1)=1.0;\n\n }\/\/end while\n\n blk.size = sites-1;\n fname[2] = 48 + (blk.size)%10; \/\/some ASCII crap\n fname[1] = 48 + (blk.size-blk.size%10)\/100;\n fname[0] = 48;\n fout.open(fname,ios::out);\n fout << blk.size <<endl;\n fout << blk.HAp ;\n fout << blk.SzL ;\n fout << blk.SpL ;\n fout << blk.SmL ;\n fout.close();\n \n OO.resize(m,(2*st)); \n OT.resize((2*st),m); \n Hl.resize((2*st),m); \n\n \/*******************second+ iteration down here*************\/\n\n for (iter = 1; iter<NumI; iter++){\n \n Habcd = HAB(i,k)*I2st(j,l) + I2st(i,k)*HAB(j,l) +\n SzAB(i,k)*SzAB(j,l)+ 0.5*SpAB(i,k)*SmAB(j,l) + 0.5*SmAB(i,k)*SpAB(j,l);\n\n EigenValuesLAN(Habcd,Psi,(4*st*st),&Eval);\n cout<<2*sites<<\" \"<<Eval\/(2.0*sites)<<endl;\n \n rhoTSR = 0;\n for (i1=0; i1< 2*st; i1++)\n for (i1p=0; i1p< 2*st; i1p++)\n for (i2=0; i2< 2*st; i2++)\n \t rhoTSR(i1,i1p) += Psi(i1,i2)*Psi(i1p,i2); \n\n DMlargeEigen(rhoTSR, OO, 2*st, m); \n for (i1=0; i1<2*st; i1++)\n for (i2=0; i2< m; i2++)\n OT(i1,i2) = OO(i2,i1); \/\/Transpose\n\n st = m;\n\n if (iter == 1) blk.HAp.resize(m,m);\n \/\/transform Operator Matrices to new basis\n Hl = sum(HAB(i,k)*OT(k,j),k); \/\/Ha'\n blk.HAp = sum(OO(i,k)*Hl(k,j),k); \/\/(inner product)\n \n if (iter == 1) blk.SzL.resize(m,m);\n Hl = sum(SzAB(i,k)*OT(k,j),k); \n blk.SzL = sum(OO(i,k)*Hl(k,j),k);\n \n if (iter == 1) blk.SpL.resize(m,m);\n Hl = sum(SpAB(i,k)*OT(k,j),k); \n blk.SpL = sum(OO(i,k)*Hl(k,j),k);\n \n if (iter == 1) blk.SmL.resize(m,m);\n Hl = sum(SmAB(i,k)*OT(k,j),k); \n blk.SmL = sum(OO(i,k)*Hl(k,j),k);\n \n if (iter == 1) TSR.resize(m,2,m,2);\n \/\/ Add a single spin (m*m*2*2 tensor)\n TSR = blk.HAp(i,k)*I2(j,l) + blk.SzL(i,k)*Sz(j,l)+ \n 0.5*blk.SpL(i,k)*Sm(j,l) + 0.5*blk.SmL(i,k)*Sp(j,l) ;\n if (iter == 1) HAB.resize(2*m,2*m);\n HAB = reduceM2M2(TSR,m); \n\n if (iter == 1){\n SzAB.resize(2*m,2*m); \/\/Operators for next iteration\n TSR = I2m(i,k)*Sz(j,l);\n SzAB = reduceM2M2(TSR,m);\n \n SpAB.resize(2*m,2*m);\n TSR = I2m(i,k)*Sp(j,l);\n SpAB = reduceM2M2(TSR,m);\n \n SmAB.resize(2*m,2*m);\n TSR = I2m(i,k)*Sm(j,l);\n SmAB = reduceM2M2(TSR,m);\n }\n\n st = m;\n sites += 1;\n\n if (iter == 1){ \/\/final resize\n I2st.resize(2*m,2*m); \n I2st = I2m;\n\n Habcd.resize(2*m,2*m,2*m,2*m); \/\/re-prepare superblock matrix\n Psi.resize(2*m,2*m); \/\/GS wavefunction\n rhoTSR.resize(2*m,2*m);\n OO.resize(m,(2*m));\n OT.resize((2*m),m);\n Hl.resize((2*m),m);\n\n }\n\n }\/\/iter\n\n return 0;\n}\n\n\/*****************************************************************\/\ntemplate<typename T>\nArray<T,2> reduceM2M2(const Array<T,4>& T2, const int m)\n\/****reduces a m,2,m,2 matrix to a 2m*2m matrix\n over the direct product basis of 2 spins*************\/\n{\n int r,c;\n Array<double,2> M4(2*m,2*m);\n\n r=0;\n for (int a1=0; a1<m; a1++)\n for (int a2=0; a2<2; a2++){\n c=0;\n for (int a3=0; a3<m; a3++)\n\tfor (int a4=0; a4<2; a4++){\n\t M4(r,c) = T2(a1,a2,a3,a4);\n\t c++;\n\t}\n r++; \n }\n \n return M4;\n\n}\n\n<commit_msg> BlockRead and BlockWrite procedures added to write blocks to file<commit_after>\/\/ Elementary DMRG for Heisenberg S=1\/2 chain, \n\/\/ infinite system algorithm to build chain\n\/\/ ED with Lanczos\n\/\/ finite system sweep\n\/\/\n\/\/Roger Melko May 9 2006\n\n#include <blitz\/array.h>\n#include <fstream>\n\nBZ_USING_NAMESPACE(blitz)\n\n\/\/block object\nstruct BLOCK {\n int size; \/\/# of sites\n Array<double,2> HAp; \/\/A' block hamiltonian\n Array<double,2> SzL; \/\/Sz(left) operator \n Array<double,2> SmL; \/\/Sm(left) operator\n Array<double,2> SpL; \/\/Sp(left) operator\n};\n\n\/\/template function prototypes\ntemplate<typename T> Array<T,2> reduceM2M2(const Array<T,4>&, const int);\nvoid EigenValuesLAN(Array<double,4>&, Array<double,2>&, const int, double *);\nvoid DMlargeEigen(Array<double,2>&, Array<double,2>&, const int, const int);\nvoid BlockWrite(BLOCK *, const int, char []);\nvoid BlockRead(BLOCK *, const int, char []);\n\nint main()\n{\n int iter, NumI;\n int i1, i1p, i2, i2p, i3, i4; \n int b1; \n int m, st; \/\/# states\n int sites; \/\/# sites\n double Eval; \/\/Eigenvalue\n BLOCK blk;\n char fname[7];\n\n \/\/initialize filename\n fname[0] = '.'; fname[1] = '0'; fname[2] = '0';\n fname[3] = '.';\n fname[4] = 'e'; fname[5] = 'n'; fname[6] = 'v';\n\n cout<<\"# states to keep: \";\n cin>>m;\n\n \/\/Matrices\n Array<double,4> TSR(2,2,2,2); \/\/tensor product for Hab hamiltonian\n\n Array<double,4> Habcd(4,4,4,4); \/\/superblock hamiltonian\n Array<double,2> HAB(4,4); \/\/new SYSTEM Hamiltonian\n Array<double,2> Psi(4,4); \/\/ ground state wavefunction\n Array<double,2> rhoTSR(4,4); \/\/ reduced density matrix\n Array<double,2> OO(m,4); \/\/the TRUNCATION matrix\n Array<double,2> OT(4,m); \/\/ trasposed truncation matrix\n Array<double,2> Hl(4,m); \/\/ the left half of new system H\n\n \/\/create identity matrices\n Array<double,2> I2(2,2), I4(4,4), I2m(2*m,2*m); \n I2=0.0; I4=0.0; I2m=0.0;\n for (b1=0; b1<2; b1++) I2(b1,b1)=1.0;\n for (b1=0; b1<4; b1++) I4(b1,b1)=1.0;\n for (b1=0; b1<(2*m); b1++) I2m(b1,b1)=1.0;\n Array<double,2> I2st(4,4);\n I2st = I4;\n\n \/\/ Create pauli matrices\n Array<double,2> Sz(2,2), Sp(2,2), Sm(2,2);\n Sz = 0.5, 0,\n 0, -0.5;\n Sp = 0, 1.0,\n 0, 0;\n Sm = 0, 0,\n 1.0, 0;\n\n \/\/tensor indices\n firstIndex i; secondIndex j; \n thirdIndex k; fourthIndex l; \n\n cout<<\"Iterations : \";\n cin>>NumI;\n\n \/\/create a tensor product: two-site Hamiltonian\n TSR = Sz(i,k)*Sz(j,l)+ 0.5*Sp(i,k)*Sm(j,l) + 0.5*Sm(i,k)*Sp(j,l) ;\n \/\/write as 2D matrix in combined basis\n Array<double,2> H12 = reduceM2M2(TSR,2);\n \/\/cout<<\"H12 \"<<H12<<endl;\n\n TSR = Sz(i,k)*I2(j,l);\n Array<double,2> SzAB = reduceM2M2(TSR,2);\n\n TSR = Sm(i,k)*I2(j,l);\n Array<double,2> SmAB = reduceM2M2(TSR,2);\n\n TSR = Sp(i,k)*I2(j,l);\n Array<double,2> SpAB = reduceM2M2(TSR,2);\n\n HAB = H12;\n st = 2; \/\/start with a 2^2=4 state system\n sites = 2;\n\n \/******infinite system algorithm loop first iteration**********\/\n \/******build system until number of desired states m **********\/\n\n while(st <= m) {\n\n Habcd = HAB(i,k)*I2st(j,l) + I2st(i,k)*HAB(j,l) +\n SzAB(i,k)*SzAB(j,l)+ 0.5*SpAB(i,k)*SmAB(j,l) + 0.5*SmAB(i,k)*SpAB(j,l);\n \n EigenValuesLAN(Habcd,Psi,(4*st*st),&Eval);\n \n cout<<\"sites: \"<<2.0*sites;\n cout<<\" Energy: \"<<Eval\/(2.0*sites)<<endl;\n \n rhoTSR = 0;\n for (i1=0; i1< 2*st; i1++)\n for (i1p=0; i1p< 2*st; i1p++)\n for (i2=0; i2< 2*st; i2++)\n \t rhoTSR(i1,i1p) += Psi(i1,i2)*Psi(i1p,i2); \n\n OO.resize(2*st,2*st);\n OT.resize(2*st,2*st);\n DMlargeEigen(rhoTSR, OO, 2*st, 2*st); \n for (i1=0; i1<2*st; i1++)\n for (i2=0; i2< 2*st; i2++)\n OT(i1,i2) = OO(i2,i1); \/\/Transpose\n\n blk.HAp.resize(2*st,2*st);\n \/\/transform Operator Matrices to new basis\n Hl.resize(2*st,2*st);\n Hl = sum(HAB(i,k)*OT(k,j),k); \/\/Ha'\n blk.HAp = sum(OO(i,k)*Hl(k,j),k); \/\/(inner product)\n \n blk.SzL.resize(2*st,2*st);\n Hl = sum(SzAB(i,k)*OT(k,j),k); \n blk.SzL = sum(OO(i,k)*Hl(k,j),k);\n \n blk.SpL.resize(2*st,2*st);\n Hl = sum(SpAB(i,k)*OT(k,j),k); \n blk.SpL = sum(OO(i,k)*Hl(k,j),k);\n \n blk.SmL.resize(2*st,2*st);\n Hl = sum(SmAB(i,k)*OT(k,j),k); \n blk.SmL = sum(OO(i,k)*Hl(k,j),k);\n\n \/\/ Add a single spin (m*m*2*2 tensor)\n st *= 2;\n TSR.resize(st,2,st,2);\n \n TSR = blk.HAp(i,k)*I2(j,l) + blk.SzL(i,k)*Sz(j,l)+ \n 0.5*blk.SpL(i,k)*Sm(j,l) + 0.5*blk.SmL(i,k)*Sp(j,l) ;\n HAB.resize(2*st,2*st); \/\/Hamiltonian for next iteration\n HAB = reduceM2M2(TSR,st);\n \/\/ cout<<HAB<<endl;\n\n SzAB.resize(2*st,2*st); \/\/Operators for next iteration\n TSR = I2st(i,k)*Sz(j,l);\n SzAB = reduceM2M2(TSR,st);\n\n SpAB.resize(2*st,2*st);\n TSR = I2st(i,k)*Sp(j,l);\n SpAB = reduceM2M2(TSR,st);\n\n SmAB.resize(2*st,2*st);\n TSR = I2st(i,k)*Sm(j,l);\n SmAB = reduceM2M2(TSR,st); \n\n Habcd.resize(2*st,2*st,2*st,2*st); \/\/re-prepare superblock matrix\n Psi.resize(2*st,2*st); \/\/GS wavefunction\n rhoTSR.resize(2*st,2*st);\n \n\/\/ st *= 2;\n sites += 1;\n\n I2st.resize(4*st,4*st); \/\/redifine identity matrix\n I2st = 0.0;\n for (b1=0; b1<(4*st); b1++) I2st(b1,b1)=1.0;\n\n }\/\/end while\n\n BlockWrite(&blk,sites-1,fname);\n \n OO.resize(m,(2*st)); \n OT.resize((2*st),m); \n Hl.resize((2*st),m); \n\n \/*******************second+ iteration down here*************\/\n\n for (iter = 1; iter<NumI; iter++){\n \n Habcd = HAB(i,k)*I2st(j,l) + I2st(i,k)*HAB(j,l) +\n SzAB(i,k)*SzAB(j,l)+ 0.5*SpAB(i,k)*SmAB(j,l) + 0.5*SmAB(i,k)*SpAB(j,l);\n\n EigenValuesLAN(Habcd,Psi,(4*st*st),&Eval);\n cout<<2*sites<<\" \"<<Eval\/(2.0*sites)<<endl;\n \n rhoTSR = 0;\n for (i1=0; i1< 2*st; i1++)\n for (i1p=0; i1p< 2*st; i1p++)\n for (i2=0; i2< 2*st; i2++)\n \t rhoTSR(i1,i1p) += Psi(i1,i2)*Psi(i1p,i2); \n\n DMlargeEigen(rhoTSR, OO, 2*st, m); \n for (i1=0; i1<2*st; i1++)\n for (i2=0; i2< m; i2++)\n OT(i1,i2) = OO(i2,i1); \/\/Transpose\n\n st = m;\n\n if (iter == 1) blk.HAp.resize(m,m);\n \/\/transform Operator Matrices to new basis\n Hl = sum(HAB(i,k)*OT(k,j),k); \/\/Ha'\n blk.HAp = sum(OO(i,k)*Hl(k,j),k); \/\/(inner product)\n \n if (iter == 1) blk.SzL.resize(m,m);\n Hl = sum(SzAB(i,k)*OT(k,j),k); \n blk.SzL = sum(OO(i,k)*Hl(k,j),k);\n \n if (iter == 1) blk.SpL.resize(m,m);\n Hl = sum(SpAB(i,k)*OT(k,j),k); \n blk.SpL = sum(OO(i,k)*Hl(k,j),k);\n \n if (iter == 1) blk.SmL.resize(m,m);\n Hl = sum(SmAB(i,k)*OT(k,j),k); \n blk.SmL = sum(OO(i,k)*Hl(k,j),k);\n\n BlockWrite(&blk, sites, fname);\n \n if (iter == 1) TSR.resize(m,2,m,2);\n \/\/ Add a single spin (m*m*2*2 tensor)\n TSR = blk.HAp(i,k)*I2(j,l) + blk.SzL(i,k)*Sz(j,l)+ \n 0.5*blk.SpL(i,k)*Sm(j,l) + 0.5*blk.SmL(i,k)*Sp(j,l) ;\n if (iter == 1) HAB.resize(2*m,2*m);\n HAB = reduceM2M2(TSR,m); \n\n if (iter == 1){\n SzAB.resize(2*m,2*m); \/\/Operators for next iteration\n TSR = I2m(i,k)*Sz(j,l);\n SzAB = reduceM2M2(TSR,m);\n \n SpAB.resize(2*m,2*m);\n TSR = I2m(i,k)*Sp(j,l);\n SpAB = reduceM2M2(TSR,m);\n \n SmAB.resize(2*m,2*m);\n TSR = I2m(i,k)*Sm(j,l);\n SmAB = reduceM2M2(TSR,m);\n }\n\n st = m;\n sites += 1;\n\n if (iter == 1){ \/\/final resize\n I2st.resize(2*m,2*m); \n I2st = I2m;\n\n Habcd.resize(2*m,2*m,2*m,2*m); \/\/re-prepare superblock matrix\n Psi.resize(2*m,2*m); \/\/GS wavefunction\n rhoTSR.resize(2*m,2*m);\n OO.resize(m,(2*m));\n OT.resize((2*m),m);\n Hl.resize((2*m),m);\n\n }\n\n }\/\/iter\n\n BlockRead(&blk,5,fname);\n\n cout<<blk.SzL;\n\n return 0;\n}\n\n\/*****************************************************************\/\ntemplate<typename T>\nArray<T,2> reduceM2M2(const Array<T,4>& T2, const int m)\n\/****reduces a m,2,m,2 matrix to a 2m*2m matrix\n over the direct product basis of 2 spins*************\/\n{\n int r,c;\n Array<double,2> M4(2*m,2*m);\n\n r=0;\n for (int a1=0; a1<m; a1++)\n for (int a2=0; a2<2; a2++){\n c=0;\n for (int a3=0; a3<m; a3++)\n\tfor (int a4=0; a4<2; a4++){\n\t M4(r,c) = T2(a1,a2,a3,a4);\n\t c++;\n\t}\n r++; \n }\n \n return M4;\n\n}\n\n\/*****************************************************************\/\nvoid BlockWrite(BLOCK *blk, const int sites, char fname[])\n{\n ofstream fout; \n \n blk->size = sites;\n fname[2] = 48 + (blk->size)%10; \/\/some ASCII crap\n\/\/ fname[1] = 48 + (blk->size-blk->size%10)\/100;\n\/\/ fname[0] = 48;\n\n fout.open(fname,ios::out);\n fout << blk->size <<endl;\n fout << blk->HAp ;\n fout << blk->SzL ;\n fout << blk->SpL ;\n fout << blk->SmL ;\n fout.close();\n\n} \/\/BlockWrite\n\n\/*****************************************************************\/\nvoid BlockRead(BLOCK *blk, const int sites, char fname[])\n{\n ifstream fin; \n \n blk->size = sites;\n fname[2] = 48 + (blk->size)%10; \/\/some ASCII crap\n\/\/ fname[1] = 48 + (blk->size-blk->size%10)\/100;\n\/\/ fname[0] = 48;\n\n fin.open(fname,ios::in);\n fin >> blk->size; \n fin >> blk->HAp ;\n fin >> blk->SzL ;\n fin >> blk->SpL ;\n fin >> blk->SmL ;\n fin.close();\n\n\/\/ cout<<blk->HAp;\n\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2022 Michael Fisher <mfisher@lvtk.org>\n\/\/ SPDX-License-Identifier: ISC\n\n#pragma once\n\n#include <lvtk\/ui\/widget.hpp>\n\nnamespace lvtk {\n\nclass Main;\n\nclass Embed final : public Widget {\npublic:\n Embed (Main& main);\n ~Embed();\n\n ViewRef host_view() const noexcept;\n\n void paint (Graphics& g) override;\n void resized() override;\n\nprotected:\n void children_changed() override;\n void parent_structure_changed() override;\n\nprivate:\n class Window;\n std::unique_ptr<Window> window;\n};\n\n} \/\/ namespace lvtk\n<commit_msg>embed: add LVTK_API tag<commit_after>\/\/ Copyright 2022 Michael Fisher <mfisher@lvtk.org>\n\/\/ SPDX-License-Identifier: ISC\n\n#pragma once\n\n#include <lvtk\/lvtk.h>\n#include <lvtk\/ui\/widget.hpp>\n\nnamespace lvtk {\n\nclass Main;\n\nclass LVTK_API Embed final : public Widget {\npublic:\n Embed (Main& main);\n ~Embed();\n\n ViewRef host_view() const noexcept;\n\n void paint (Graphics& g) override;\n void resized() override;\n\nprotected:\n void children_changed() override;\n void parent_structure_changed() override;\n\nprivate:\n class Window;\n std::unique_ptr<Window> window;\n LVTK_DISABLE_COPY (Embed);\n};\n\n} \/\/ namespace lvtk\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include <boost\/thread.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <include\/HogCPU.h>\n\n#include \"utils.h\"\n\nclass ResizeCallback: public ghog::lib::ImageCallback\n{\npublic:\n\tResizeCallback(int num_images)\n\t{\n\t\t_finished = 0;\n\t\t_total_images = num_images;\n\t}\n\n\tvoid image_processed(cv::Mat original,\n\t\tcv::Mat processed)\n\t{\n\t\t_finished++;\n\t}\n\n\tbool is_finished()\n\t{\n\t\treturn (_finished == _total_images);\n\t}\n\nprivate:\n\tint _finished;\n\tint _total_images;\n};\n\nint main(int argc,\n\tchar** argv)\n{\n\tstd::vector<std::string> file_list = getImagesList(\"resources\/inputs\");\n\tResizeCallback callback(file_list.size());\n\tghog::lib::IHog* utils = new ghog::lib::HogCPU(\"hog.xml\");\n\tcv::Size new_size(24, 24);\n\n\tfor(int i = 0; i < file_list.size(); ++i)\n\t{\n\t\tcv::Mat input_img = cv::imread(file_list[i], CV_LOAD_IMAGE_GRAYSCALE);\n\t\tutils->resize(input_img, new_size, &callback);\n\t}\n\tstd::cout << \"Processing \" << file_list.size() << \" images...\" << std::endl;\n\twhile(!callback.is_finished())\n\t{\n\t\tstd::cout << \".\";\n\t\tstd::cout.flush();\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\tstd::cout << std::endl;\n\tstd::cout << \"Images processed.\" << std::endl;\n\treturn 0;\n}\n\n<commit_msg>Fix undefined references.<commit_after>#include <iostream>\n\n#include <boost\/thread.hpp>\n\n#include <opencv2\/core\/core.hpp>\n#include <opencv2\/highgui\/highgui.hpp>\n\n#include <include\/HogCPU.h>\n\n#include \"utils.h\"\n\nclass ResizeCallback: public ghog::lib::ImageCallback\n{\npublic:\n\tResizeCallback(int num_images)\n\t{\n\t\t_finished = 0;\n\t\t_total_images = num_images;\n\t}\n\n\tvoid image_processed(cv::Mat original,\n\t\tcv::Mat processed)\n\t{\n\t\t_finished++;\n\t}\n\n\tbool is_finished()\n\t{\n\t\treturn (_finished == _total_images);\n\t}\n\nprivate:\n\tint _finished;\n\tint _total_images;\n};\n\nint main(int argc,\n\tchar** argv)\n{\n\tstd::vector<std::string> file_list = getImagesList(\"resources\/images\");\n\tResizeCallback callback(file_list.size());\n\tghog::lib::IHog* utils = new ghog::lib::HogCPU(\"hog.xml\");\n\tcv::Size new_size(24, 24);\n\n\tfor(int i = 0; i < file_list.size(); ++i)\n\t{\n\t\tcv::Mat input_img = cv::imread(file_list[i], CV_LOAD_IMAGE_GRAYSCALE);\n\t\tutils->resize(input_img, new_size, &callback);\n\t}\n\tstd::cout << \"Processing \" << file_list.size() << \" images...\" << std::endl;\n\twhile(!callback.is_finished())\n\t{\n\t\tstd::cout << \".\";\n\t\tstd::cout.flush();\n\t\tboost::this_thread::sleep(boost::posix_time::milliseconds(1000));\n\t}\n\tstd::cout << std::endl;\n\tstd::cout << \"Images processed.\" << std::endl;\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"readsTools.hpp\"\n\n#include <string>\n#include <vector>\n#include <iostream>\n\nusing namespace std;\n\t\n\/\/Static members\/attributes;\nconst std::map<char,uint8_t> ReadsTools::nuc = {{'A',0},{'T',1},{'G',2},{'C',3},{'X',4}};\n\nconst std::vector< std::vector< int8_t > > ReadsTools::scoreMatrix =\n\tstd::vector< std::vector< int8_t > > (5,\n\t\tstd::vector<int8_t>(5,0)) = {\n\t\t\t\/\/A T G C X(2nd id)\n\t\t\t{1,-1,-1,-1,-1}, \/\/A (first id)\n\t\t\t{-1,1,-1,-1,-1}, \/\/T (first id)\n\t\t\t{-1,-1,1,-1,-1}, \/\/G (first id)\n\t\t\t{-1,-1,-1,1,-1}, \/\/C (first id)\n\t\t\t{-1,-1,-1,-1,-1} \/\/X (first id)\n\t\t};\n\n\t\/\/function to get the best value in a matrix of int8_t (the scoreMatrix)\ninline const int8_t bestValueInMatrix(vector< vector< int8_t> > matrix){\n\tif(!matrix.size() || !matrix[0].size()){\n\t\tcerr << \"Error: matrix empty.\" << endl;\n\t\treturn 0;\n\t}\n\t\n\tint8_t b = matrix[0][0];\n\tfor(vector<vector<int8_t>>::const_iterator vi = matrix.cbegin(); vi != matrix.cend(); vi ++){\n\t\tfor(vector<int8_t>::const_iterator vvi = vi->cbegin(); vvi != vi->cend(); vvi++){\n\t\t\tif(*vvi > b){b=*vvi;}\n\t\t}\n\t}\n\treturn b;\n}\n\nconst int8_t ReadsTools::bestScoreMatrix = bestValueInMatrix(scoreMatrix);\nconst int ReadsTools::gap_score = -1;\n\n\/\/Tool Public functions\n\/\/Function to get the score between 2 sequences (>0: normal couple, <0: seq2 is reversed-complement)\nconst int ReadsTools::scoreCmpReads(const std::string& read1, const string& read2){\n\t\/* normal mapping *\/\n\tint best = scoreMatchingReads(read1,read2);\n\n\t\/* read1 normal, read2 complementary (r2r) *\/\n\tstring r2r = read2;\n\tconst size_t r2size = read2.size();\n\tfor(size_t i=0; i < r2size; i++){\n\t\tsize_t r2id = r2size-1-i;\n\t\tswitch(read2[i]){\n\t\t\tcase 'A':\n\t\t\t\tr2r[r2id]='T';\n\t\t\t\tbreak;\n\t\t\tcase 'T':\n\t\t\t\tr2r[r2id]='A';\n\t\t\t\tbreak;\n\t\t\tcase 'G':\n\t\t\t\tr2r[r2id]='C';\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tr2r[r2id]='G';\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tr2r[r2id]='A';\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint score = scoreMatchingReads(read1, r2r);\n\n\tif(best < score){best=score*(-1);}\n\n\treturn best;\n}\n\n\/\/Function to merge 2 sequences\nconst string ReadsTools::allignSeq(const string& seq1, const string& seq2){\n\t\/\/Reminder: a needlemap has a size of seq1.size()+1 and seq1.size()+1\n\t\/\/because the first line and first column must include an \"empty\" possibility\n\tstruct Node {\n\t\tNode* previous = nullptr;\n\t\tsize_t s1 = 0; \/\/seq1 pos\n\t\tsize_t s2 = 0; \/\/seq2 pos\n\t\tint score=0;\n\t};\n\tvector< vector<Node> > needlemap (seq1.size()+1, vector<Node>(seq2.size()+1, Node()));\n\n\t\/*\n\tcerr << \"Merging following sequences\" << endl;\n\tcerr << \"Seq1:\\n\" << seq1 << endl;\n\tcerr << \"Seq2:\\n\" << seq2 << endl;\n\t*\/\n\n\t\/\/Needlemap completion\n\t\t\/\/first nuc (0,0)\n\t\tneedlemap[0][0].score=scoreMatrix[nuc.at(seq1[0])][nuc.at(seq2[0])];\n\t\t\/\/first line (we can begin anywere on the seq1 (reference) so\n\t\t\/\/initial score is 0)\n\tfor(size_t i=1; i < seq1.size()+1; i++){\n\t\tneedlemap[i][0].score = 0;\n\t\tneedlemap[i][0].previous = &needlemap[i-1][0];\n\t\tneedlemap[i][0].s1=i-1;\n\t}\n\t\t\/\/first column (we must match the beginning of the seq2)\n\tfor(size_t i=1; i < seq2.size()+1; i++){\n\t\tneedlemap[0][i].score = needlemap[0][i-1].score + gap_score;\n\t\tneedlemap[0][i].previous = &needlemap[0][i-1];\n\t\tneedlemap[0][i].s2=i-1;\n\t}\n\n\t\t\/\/Do all other nodes (except last line and column)\n\tfor(size_t i=1; i < seq1.size(); i++){\n\t\tfor(size_t j=1; j < seq2.size(); j++){\n\t\t\t\t\/\/Set position\n\t\t\tneedlemap[i][j].s1=i-1;\n\t\t\tneedlemap[i][j].s2=j-1;\n\t\t\t\t\/\/(mis)match ?\n\t\t\tneedlemap[i][j].score = needlemap[i-1][j-1].score +\n\t\t\t\tscoreMatrix[nuc.at(seq1[i-1])][nuc.at(seq2[j-1])];\n\t\t\tneedlemap[i][j].previous = &needlemap[i-1][j-1];\n\t\t\t\t\/\/seq1 gap ?\n\t\t\tint s = needlemap[i][j-1].score + gap_score;\n\t\t\tif(s > needlemap[i][j].score){\n\t\t\t\tneedlemap[i][j].score = s;\n\t\t\t\tneedlemap[i][j].previous = &needlemap[i][j-1];\n\t\t\t}\n\t\t\t\t\/\/seq2 gap ?\n\t\t\ts = needlemap[i-1][j].score + gap_score;\n\t\t\tif(s > needlemap[i][j].score){\n\t\t\t\tneedlemap[i][j].score = s;\n\t\t\t\tneedlemap[i][j].previous = &needlemap[i-1][j];\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/Last line and last column\n\tsize_t n2 = seq2.size();\n\tfor(size_t n1=1; n1 < seq1.size(); n1++){\n\t\t\/\/Set pos\n\t\tneedlemap[n1][n2].s1=n1-1;\n\t\tneedlemap[n1][n2].s2=n2-1;\n\n\t\t\/\/Match\/mismatch ?\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\n\t\t\/\/seq1 gap ? \n\t\tint s = needlemap[n1][n2-1].score+gap_score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t\t}\n\t\t\/\/seq2 gap ? (There is no gap_score as we can accept \"gap\" at the end )\n\t\ts = needlemap[n1-1][n2].score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t\t}\n\t}\n\tsize_t n1 = seq1.size();\n\tfor(size_t n2=1; n2 < seq2.size(); n2++){\n\t\t\/\/Set pos\n\t\tneedlemap[n1][n2].s1=n1-1;\n\t\tneedlemap[n1][n2].s2=n2-1;\n\n\t\t\/\/Match\/mismatch ?\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\n\t\t\/\/seq1 gap ? (There is no gap_score as we can accept \"gap\" at the end)\n\t\tint s = needlemap[n1][n2-1].score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t\t}\n\t\t\/\/seq2 gap ?\n\t\ts = needlemap[n1-1][n2].score+gap_score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t\t}\n\t}\n\n\t\/\/Do last row\n\t\t\/\/Set pos\n\tneedlemap[n1][n2].s1=n1-1;\n\tneedlemap[n1][n2].s2=n2-1;\n\t\t\n\t\t\/\/match\/mismatch\n\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\t\n\t\/\/Gap (no gap_score as it is the end of reads)\n\tif(needlemap[n1][n2].score < needlemap[n1-1][n2].score){\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2].score;\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t}\n\tif(needlemap[n1][n2].score < needlemap[n1][n2-1].score){\n\t\tneedlemap[n1][n2].score = needlemap[n1][n2-1].score;\n\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t}\n\t\t\n\t\/\/Needlemap lecture (begin by the end : sequence is reversed)\n\tNode* n = &needlemap[n1][n2];\n\tif(n == nullptr || n->previous == nullptr){\n\t\tcerr << \"Error in needlemap reading\" << endl;\n\t\treturn \"error while creating the allignment\";\n\t}\n\tNode* p = n->previous;\n\tstring s = \"\";\n\t\t\n\t\t\/\/Reconstruct all nucleotides\n\twhile(p != nullptr){\n\t\t\/\/Do the last nucleotide\n\t\t\/\/If previous is s1-1 and s2-1 so it's a (mis)match\n\t\t\/\/Else it is a gap\n\t\tif(p->s1 < n->s1 && p->s2 < n->s2){\n\t\t\tif(seq1[n->s1] == seq2[n->s2]){\n\t\t\t\ts += seq1[n->s1];\n\t\t\t}\n\t\t\telse { s += 'X';}\n\t\t}\n\t\t\t\/\/seq1 gap\n\t\telse if (p->s1 == n->s1){\n\t\t\ts += seq2[n->s2];\n\t\t}\n\t\t\t\/\/seq2 gap\n\t\telse {\n\t\t\ts += seq1[n->s1];\n\t\t}\n\n\t\t\/\/Do previous\n\t\tn = p;\n\t\tp = n->previous;\n\t}\n\n\t\/\/Return the consensus seq (reverse the needlemap result)\n\treturn string(s.rbegin(), s.rend());\n\n}\n\n\/\/Tool Private function\n\/\/Function to calculate the score between 2 sequences (no reverse-complement)\n\/\/It's based on needleman&wunsch using only 2 1D array of size of seq1 (and not\n\/\/a 2D array of size seq1*seq2. The 2 1D arrays are the compairason againt the actual\n\/\/seq1 nuc (seq1[n] <-> seq2) and the previous comparaison (seq1[n-1] <-> seq2)\nconst int ReadsTools::scoreMatchingReads(const string& read1, const string& read2){\n\t\/*\n\tCalculing Comparaison score between the 2 read2s using\n\tneedleman&wunsch algorithm without memoring the best path\n\tas we only need the score\n\t*\/\n\n\t\/\/Get the sequences length\n\tsize_t len1 = read1.size();\n\tsize_t len2 = read2.size();\n\n\t\/\/Prepare the scoring arrays\n\tint* previous = new int[len2];\n\tint* current = new int[len2];\n\tint bestIN = 0; \/\/bestIN is the best case of seq2 being completly inside seq1\n\t\n\t\/\/Calculate the first line (seq2 againt seq1[0]\n\t\/\/Note: we can't 'allow' a gap in seq2's \"first nuc\"\n\tprevious[0] = ((read1[0]==read2[0])?1:-1);\n\tfor(size_t j=1; j < len2; j++){ previous[j] = -j; }\n\tbestIN = previous[len2-1];\n\n\t\/\/Complete the needle comparison\n\tfor(size_t i=1; i < len1; i++){\n\t\t\/\/Test the seq2's first nuc, a gap is allowed so it's just a (mis)match\n\t\tcurrent[0] = ((read1[i]==read2[0])?1:-1);\n\t\t\n\t\t\/\/Finish the line\n\t\tfor(size_t j=1; j < len2; j++){\n\t\t\t\/\/current[j] is the best of a match\/mistach and both indels possibilities\n\t\t\t\/\/Match\/mismatch ?\n\t\t\tcurrent[j] = previous[j-1] + ((read1[i]==read2[j])?1:-1);\n\n\t\t\t\/\/indels ?\n\t\t\tcurrent[j] = ((previous[j]-1 > current[j])?previous[j]-1:current[j]);\n\t\t\tcurrent[j] = ((current[j-1]-1 > current[j])?current[j-1]-1:current[j]);\n\t\t}\n\n\t\t\/\/ Best of read2 being inside read1 ?\n\t\tbestIN = ((current[len2-1] > bestIN)?current[len2-1]:bestIN);\n\n\t\t\/\/swap previous and current arrays\n\t\tint* swapbuf = previous;\n\t\tprevious = current;\n\t\tcurrent = swapbuf;\n\t}\n\n\t\/\/get the best score\n\tfor(size_t j=0; j<len2;j++){ bestIN = ((previous[j]>bestIN)?previous[j]:bestIN);}\n\tif(bestIN < 0){bestIN=0;} \/\/security: we want a score >= 0\n\tint theomax = ((len1<len2)?len1:len2);\n\n\t\/\/Clean memory\n\tdelete[] previous;\n\tdelete[] current;\n\n\t\/\/Return best score (percent of bestIn based on theoric max (shorter reads size))\n\treturn 100*bestIN\/theomax;\n}\n<commit_msg>Correcting reads cmp in cpu. Work not over.<commit_after>#include \"readsTools.hpp\"\n\n#include <string>\n#include <vector>\n#include <iostream>\n\nusing namespace std;\n\t\n\/\/Static members\/attributes;\nconst std::map<char,uint8_t> ReadsTools::nuc = {{'A',0},{'T',1},{'G',2},{'C',3},{'X',4}};\n\nconst std::vector< std::vector< int8_t > > ReadsTools::scoreMatrix =\n\tstd::vector< std::vector< int8_t > > (5,\n\t\tstd::vector<int8_t>(5,0)) = {\n\t\t\t\/\/A T G C X(2nd id)\n\t\t\t{1,-1,-1,-1,-1}, \/\/A (first id)\n\t\t\t{-1,1,-1,-1,-1}, \/\/T (first id)\n\t\t\t{-1,-1,1,-1,-1}, \/\/G (first id)\n\t\t\t{-1,-1,-1,1,-1}, \/\/C (first id)\n\t\t\t{-1,-1,-1,-1,-1} \/\/X (first id)\n\t\t};\n\n\t\/\/function to get the best value in a matrix of int8_t (the scoreMatrix)\ninline const int8_t bestValueInMatrix(vector< vector< int8_t> > matrix){\n\tif(!matrix.size() || !matrix[0].size()){\n\t\tcerr << \"Error: matrix empty.\" << endl;\n\t\treturn 0;\n\t}\n\t\n\tint8_t b = matrix[0][0];\n\tfor(vector<vector<int8_t>>::const_iterator vi = matrix.cbegin(); vi != matrix.cend(); vi ++){\n\t\tfor(vector<int8_t>::const_iterator vvi = vi->cbegin(); vvi != vi->cend(); vvi++){\n\t\t\tif(*vvi > b){b=*vvi;}\n\t\t}\n\t}\n\treturn b;\n}\n\nconst int8_t ReadsTools::bestScoreMatrix = bestValueInMatrix(scoreMatrix);\nconst int ReadsTools::gap_score = -1;\n\n\/\/Tool Public functions\n\/\/Function to get the score between 2 sequences (>0: normal couple, <0: seq2 is reversed-complement)\nconst int ReadsTools::scoreCmpReads(const std::string& read1, const string& read2){\n\t\/* normal mapping *\/\n\tint best = scoreMatchingReads(read1,read2);\n\n\t\/* read1 normal, read2 complementary (r2r) *\/\n\tstring r2r = read2;\n\tconst size_t r2size = read2.size();\n\tfor(size_t i=0; i < r2size; i++){\n\t\tsize_t r2id = r2size-1-i;\n\t\tswitch(read2[i]){\n\t\t\tcase 'A':\n\t\t\t\tr2r[r2id]='T';\n\t\t\t\tbreak;\n\t\t\tcase 'T':\n\t\t\t\tr2r[r2id]='A';\n\t\t\t\tbreak;\n\t\t\tcase 'G':\n\t\t\t\tr2r[r2id]='C';\n\t\t\t\tbreak;\n\t\t\tcase 'C':\n\t\t\t\tr2r[r2id]='G';\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tr2r[r2id]='A';\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint score = scoreMatchingReads(read1, r2r);\n\n\tif(best < score){best=score*(-1);}\n\n\treturn best;\n}\n\n\/\/Function to merge 2 sequences\nconst string ReadsTools::allignSeq(const string& seq1, const string& seq2){\n\t\/\/Reminder: a needlemap has a size of seq1.size()+1 and seq1.size()+1\n\t\/\/because the first line and first column must include an \"empty\" possibility\n\tstruct Node {\n\t\tNode* previous = nullptr;\n\t\tsize_t s1 = 0; \/\/seq1 pos\n\t\tsize_t s2 = 0; \/\/seq2 pos\n\t\tint score=0;\n\t};\n\tvector< vector<Node> > needlemap (seq1.size()+1, vector<Node>(seq2.size()+1, Node()));\n\n\t\/*\n\tcerr << \"Merging following sequences\" << endl;\n\tcerr << \"Seq1:\\n\" << seq1 << endl;\n\tcerr << \"Seq2:\\n\" << seq2 << endl;\n\t*\/\n\n\t\/\/Needlemap completion\n\t\t\/\/first nuc (0,0)\n\t\tneedlemap[0][0].score=scoreMatrix[nuc.at(seq1[0])][nuc.at(seq2[0])];\n\t\t\/\/first line (we can begin anywere on the seq1 (reference) so\n\t\t\/\/initial score is 0)\n\tfor(size_t i=1; i < seq1.size()+1; i++){\n\t\tneedlemap[i][0].score = 0;\n\t\tneedlemap[i][0].previous = &needlemap[i-1][0];\n\t\tneedlemap[i][0].s1=i-1;\n\t}\n\t\t\/\/first column (we must match the beginning of the seq2)\n\tfor(size_t i=1; i < seq2.size()+1; i++){\n\t\tneedlemap[0][i].score = needlemap[0][i-1].score + gap_score;\n\t\tneedlemap[0][i].previous = &needlemap[0][i-1];\n\t\tneedlemap[0][i].s2=i-1;\n\t}\n\n\t\t\/\/Do all other nodes (except last line and column)\n\tfor(size_t i=1; i < seq1.size(); i++){\n\t\tfor(size_t j=1; j < seq2.size(); j++){\n\t\t\t\t\/\/Set position\n\t\t\tneedlemap[i][j].s1=i-1;\n\t\t\tneedlemap[i][j].s2=j-1;\n\t\t\t\t\/\/(mis)match ?\n\t\t\tneedlemap[i][j].score = needlemap[i-1][j-1].score +\n\t\t\t\tscoreMatrix[nuc.at(seq1[i-1])][nuc.at(seq2[j-1])];\n\t\t\tneedlemap[i][j].previous = &needlemap[i-1][j-1];\n\t\t\t\t\/\/seq1 gap ?\n\t\t\tint s = needlemap[i][j-1].score + gap_score;\n\t\t\tif(s > needlemap[i][j].score){\n\t\t\t\tneedlemap[i][j].score = s;\n\t\t\t\tneedlemap[i][j].previous = &needlemap[i][j-1];\n\t\t\t}\n\t\t\t\t\/\/seq2 gap ?\n\t\t\ts = needlemap[i-1][j].score + gap_score;\n\t\t\tif(s > needlemap[i][j].score){\n\t\t\t\tneedlemap[i][j].score = s;\n\t\t\t\tneedlemap[i][j].previous = &needlemap[i-1][j];\n\t\t\t}\n\t\t}\n\t}\n\n\t\/\/Last line and last column\n\tsize_t n2 = seq2.size();\n\tfor(size_t n1=1; n1 < seq1.size(); n1++){\n\t\t\/\/Set pos\n\t\tneedlemap[n1][n2].s1=n1-1;\n\t\tneedlemap[n1][n2].s2=n2-1;\n\n\t\t\/\/Match\/mismatch ?\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\n\t\t\/\/seq1 gap ? \n\t\tint s = needlemap[n1][n2-1].score+gap_score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t\t}\n\t\t\/\/seq2 gap ? (There is no gap_score as we can accept \"gap\" at the end )\n\t\ts = needlemap[n1-1][n2].score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t\t}\n\t}\n\tsize_t n1 = seq1.size();\n\tfor(size_t n2=1; n2 < seq2.size(); n2++){\n\t\t\/\/Set pos\n\t\tneedlemap[n1][n2].s1=n1-1;\n\t\tneedlemap[n1][n2].s2=n2-1;\n\n\t\t\/\/Match\/mismatch ?\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\n\t\t\/\/seq1 gap ? (There is no gap_score as we can accept \"gap\" at the end)\n\t\tint s = needlemap[n1][n2-1].score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t\t}\n\t\t\/\/seq2 gap ?\n\t\ts = needlemap[n1-1][n2].score+gap_score;\n\t\tif(s > needlemap[n1][n2].score){\n\t\t\tneedlemap[n1][n2].score = s;\n\t\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t\t}\n\t}\n\n\t\/\/Do last row\n\t\t\/\/Set pos\n\tneedlemap[n1][n2].s1=n1-1;\n\tneedlemap[n1][n2].s2=n2-1;\n\t\t\n\t\t\/\/match\/mismatch\n\tneedlemap[n1][n2].score = needlemap[n1-1][n2-1].score +\n\t\tscoreMatrix[nuc.at(seq1[n1-1])][nuc.at(seq2[n2-1])];\n\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2-1];\n\t\n\t\/\/Gap (no gap_score as it is the end of reads)\n\tif(needlemap[n1][n2].score < needlemap[n1-1][n2].score){\n\t\tneedlemap[n1][n2].score = needlemap[n1-1][n2].score;\n\t\tneedlemap[n1][n2].previous = &needlemap[n1-1][n2];\n\t}\n\tif(needlemap[n1][n2].score < needlemap[n1][n2-1].score){\n\t\tneedlemap[n1][n2].score = needlemap[n1][n2-1].score;\n\t\tneedlemap[n1][n2].previous = &needlemap[n1][n2-1];\n\t}\n\t\t\n\t\/\/Needlemap lecture (begin by the end : sequence is reversed)\n\tNode* n = &needlemap[n1][n2];\n\tif(n == nullptr || n->previous == nullptr){\n\t\tcerr << \"Error in needlemap reading\" << endl;\n\t\treturn \"error while creating the allignment\";\n\t}\n\tNode* p = n->previous;\n\tstring s = \"\";\n\t\t\n\t\t\/\/Reconstruct all nucleotides\n\twhile(p != nullptr){\n\t\t\/\/Do the last nucleotide\n\t\t\/\/If previous is s1-1 and s2-1 so it's a (mis)match\n\t\t\/\/Else it is a gap\n\t\tif(p->s1 < n->s1 && p->s2 < n->s2){\n\t\t\tif(seq1[n->s1] == seq2[n->s2]){\n\t\t\t\ts += seq1[n->s1];\n\t\t\t}\n\t\t\telse { s += 'X';}\n\t\t}\n\t\t\t\/\/seq1 gap\n\t\telse if (p->s1 == n->s1){\n\t\t\ts += seq2[n->s2];\n\t\t}\n\t\t\t\/\/seq2 gap\n\t\telse {\n\t\t\ts += seq1[n->s1];\n\t\t}\n\n\t\t\/\/Do previous\n\t\tn = p;\n\t\tp = n->previous;\n\t}\n\n\t\/\/Return the consensus seq (reverse the needlemap result)\n\treturn string(s.rbegin(), s.rend());\n\n}\n\n\/\/Tool Private function\n\/\/Function to calculate the score between 2 sequences (no reverse-complement)\n\/\/It's based on needleman&wunsch using only 2 1D array of size of seq1 (and not\n\/\/a 2D array of size seq1*seq2. The 2 1D arrays are the compairason againt the actual\n\/\/seq1 nuc (seq1[n] <-> seq2) and the previous comparaison (seq1[n-1] <-> seq2)\nconst int ReadsTools::scoreMatchingReads(const string& read1, const string& read2){\n\t\/*\n\tCalculing Comparaison score between the 2 read2s using\n\tneedleman&wunsch algorithm without memoring the best path\n\tas we only need the score\n\t*\/\n\n\t\/\/Get the sequences length\n\tsize_t len1 = read1.size();\n\tsize_t len2 = read2.size();\n\n\t\/\/Prepare the scoring arrays\n\tint* previous = new int[len1];\n\tint* current = new int[len1];\n\tint bestIN = 0; \/\/bestIN is the best case of seq2 being completly inside seq1\n\t\n\t\/\/Calculate the first line (seq2[0] againt seq1)\n\tprevious[0] = ((read1[0]==read2[0])?1:-1);\n\tfor(size_t i=0; i < len1; i++){ previous[i] = ((read2[0]==read1[i])?1:-1);}\n\tbestIN = previous[len1-1];\n\n\t\/\/Complete the needle comparison\n\tfor(size_t j=1; j < len2; j++){\n\t\t\/\/Test the seq1's first nuc: is an indel as the first need to be seq2[0]\n\t\tcurrent[0] = previous[0]-1;\n\t\t\n\t\t\/\/Do others nucs of seq1\n\t\tfor(size_t i=1; i < len1; i++){\n\t\t\t\/\/current[j] is the best of a match\/mistach and both indels possibilities\n\t\t\t\/\/Match\/mismatch ?\n\t\t\tcurrent[i] = previous[i-1] + ((read1[i]==read2[j])?1:-1);\n\n\t\t\t\/\/indels ?\n\t\t\tcurrent[i] = previous[i]-1;\n\t\t\tcurrent[i] = current[i-1]-1;\n\t\t}\n\n\t\t\/\/ Best of read2 being inside read1 ?\n\t\tbestIN = ((current[len1-1] > bestIN)?current[len1-1]:bestIN);\n\n\t\t\/\/swap previous and current arrays\n\t\tint* swapbuf = previous;\n\t\tprevious = current;\n\t\tcurrent = swapbuf;\n\t}\n\n\t\/\/get the best score\n\tfor(size_t i=0; i<len1; i++){ bestIN = ((previous[i]>bestIN)?previous[i]:bestIN);}\n\tif(bestIN < 0){bestIN=0;} \/\/security: we want a score >= 0\n\tint theomax = ((len1<len2)?len1:len2);\n\n\t\/\/Clean memory\n\tdelete[] previous;\n\tdelete[] current;\n\n\t\/\/Return best score (percent of bestIn based on theoric max (shorter reads size))\n\treturn 100*bestIN\/theomax;\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"diff_solver.h\"\n#include \"diff_system.h\"\n#include \"dof_map.h\"\n#include \"numeric_vector.h\"\n#include \"unsteady_solver.h\"\n\n\n\nUnsteadySolver::UnsteadySolver (sys_type& s)\n : TimeSolver(s),\n reduce_deltat_on_diffsolver_failure(0),\n first_solve (true),\n old_local_nonlinear_solution (NumericVector<Number>::build())\n{\n}\n\n\n\nUnsteadySolver::~UnsteadySolver ()\n{\n}\n\n\n\nvoid UnsteadySolver::init ()\n{\n TimeSolver::init();\n\n _system.add_vector(\"_old_nonlinear_solution\");\n}\n\n\n\nvoid UnsteadySolver::solve ()\n{\n if (first_solve)\n {\n advance_timestep();\n first_solve = false;\n }\n\n old_local_nonlinear_solution->init (_system.n_dofs());\n\n _system.get_vector(\"_old_nonlinear_solution\").localize\n (*old_local_nonlinear_solution,\n _system.get_dof_map().get_send_list());\n\n unsigned int solve_result = _diff_solver->solve();\n\n \/\/ If we requested the UnsteadySolver to attempt reducing dt after a\n \/\/ failed DiffSolver solve, check the results of the solve now.\n if (reduce_deltat_on_diffsolver_failure)\n {\n bool backtracking_failed =\n\tsolve_result & DiffSolver::DIVERGED_BACKTRACKING_FAILURE;\n\n bool max_iterations =\n\tsolve_result & DiffSolver::DIVERGED_MAX_NONLINEAR_ITERATIONS;\n\t\n if (backtracking_failed || max_iterations)\n\t{\n\t \/\/ Cut timestep in half\n\t for (unsigned int nr=0; nr<reduce_deltat_on_diffsolver_failure; ++nr)\n\t {\n\t _system.deltat *= 0.5;\n\t std::cout << \"Newton backtracking failed. Trying with smaller timestep, dt=\"\n\t\t\t<< _system.deltat << std::endl;\n\n\t solve_result = _diff_solver->solve();\n\n\t \/\/ Check solve results with reduced timestep\n\t bool backtracking_failed =\n\t\tsolve_result & DiffSolver::DIVERGED_BACKTRACKING_FAILURE;\n\t \n\t bool max_iterations =\n\t\tsolve_result & DiffSolver::DIVERGED_MAX_NONLINEAR_ITERATIONS;\n\n\t if (!backtracking_failed && !max_iterations)\n\t\t{\n\t\t if (!quiet)\n\t\t std::cout << \"Reduced dt solve succeeded.\" << std::endl;\n\t\t return;\n\t\t}\n\t }\n\n\t \/\/ If we made it here, we still couldn't converge the solve after\n\t \/\/ reducing deltat\n\t std::cout << \"DiffSolver::solve() did not succeed after \"\n\t\t << reduce_deltat_on_diffsolver_failure\n\t\t << \" attempts.\" << std::endl;\n\t error();\n\t \n \t} \/\/ end if (backtracking_failed || max_iterations)\n } \/\/ end if (reduce_deltat_on_diffsolver_failure)\n}\n\n\n\nvoid UnsteadySolver::advance_timestep ()\n{\n NumericVector<Number> &old_nonlinear_solution =\n _system.get_vector(\"_old_nonlinear_solution\");\n NumericVector<Number> &nonlinear_solution =\n *(_system.solution);\n\n old_nonlinear_solution = nonlinear_solution;\n\n if (!first_solve)\n _system.time += _system.deltat;\n}\n\n\n\nNumber UnsteadySolver::old_nonlinear_solution(const unsigned int global_dof_number)\nconst\n{\n assert (global_dof_number < _system.get_dof_map().n_dofs());\n assert (global_dof_number < old_local_nonlinear_solution->size());\n\n return (*old_local_nonlinear_solution)(global_dof_number);\n}\n\n\n\nReal UnsteadySolver::du(const SystemNorm &norm) const\n{\n\n AutoPtr<NumericVector<Number> > solution_copy =\n _system.solution->clone();\n\n solution_copy->add(-1., _system.get_vector(\"_old_nonlinear_solution\"));\n\n solution_copy->close();\n\n return _system.calculate_norm(solution_copy, norm);\n}\n<commit_msg>Minor bugfix<commit_after>\n#include \"diff_solver.h\"\n#include \"diff_system.h\"\n#include \"dof_map.h\"\n#include \"numeric_vector.h\"\n#include \"unsteady_solver.h\"\n\n\n\nUnsteadySolver::UnsteadySolver (sys_type& s)\n : TimeSolver(s),\n reduce_deltat_on_diffsolver_failure(0),\n first_solve (true),\n old_local_nonlinear_solution (NumericVector<Number>::build())\n{\n}\n\n\n\nUnsteadySolver::~UnsteadySolver ()\n{\n}\n\n\n\nvoid UnsteadySolver::init ()\n{\n TimeSolver::init();\n\n _system.add_vector(\"_old_nonlinear_solution\");\n}\n\n\n\nvoid UnsteadySolver::solve ()\n{\n if (first_solve)\n {\n advance_timestep();\n first_solve = false;\n }\n\n old_local_nonlinear_solution->init (_system.n_dofs());\n\n _system.get_vector(\"_old_nonlinear_solution\").localize\n (*old_local_nonlinear_solution,\n _system.get_dof_map().get_send_list());\n\n unsigned int solve_result = _diff_solver->solve();\n\n \/\/ If we requested the UnsteadySolver to attempt reducing dt after a\n \/\/ failed DiffSolver solve, check the results of the solve now.\n if (reduce_deltat_on_diffsolver_failure)\n {\n bool backtracking_failed =\n\tsolve_result & DiffSolver::DIVERGED_BACKTRACKING_FAILURE;\n\n bool max_iterations =\n\tsolve_result & DiffSolver::DIVERGED_MAX_NONLINEAR_ITERATIONS;\n\t\n if (backtracking_failed || max_iterations)\n\t{\n\t \/\/ Cut timestep in half\n\t for (unsigned int nr=0; nr<reduce_deltat_on_diffsolver_failure; ++nr)\n\t {\n\t _system.deltat *= 0.5;\n\t std::cout << \"Newton backtracking failed. Trying with smaller timestep, dt=\"\n\t\t\t<< _system.deltat << std::endl;\n\n\t solve_result = _diff_solver->solve();\n\n\t \/\/ Check solve results with reduced timestep\n\t bool backtracking_failed =\n\t\tsolve_result & DiffSolver::DIVERGED_BACKTRACKING_FAILURE;\n\t \n\t bool max_iterations =\n\t\tsolve_result & DiffSolver::DIVERGED_MAX_NONLINEAR_ITERATIONS;\n\n\t if (!backtracking_failed && !max_iterations)\n\t\t{\n\t\t if (!quiet)\n\t\t std::cout << \"Reduced dt solve succeeded.\" << std::endl;\n\t\t return;\n\t\t}\n\t }\n\n\t \/\/ If we made it here, we still couldn't converge the solve after\n\t \/\/ reducing deltat\n\t std::cout << \"DiffSolver::solve() did not succeed after \"\n\t\t << reduce_deltat_on_diffsolver_failure\n\t\t << \" attempts.\" << std::endl;\n\t error();\n\t \n \t} \/\/ end if (backtracking_failed || max_iterations)\n } \/\/ end if (reduce_deltat_on_diffsolver_failure)\n}\n\n\n\nvoid UnsteadySolver::advance_timestep ()\n{\n NumericVector<Number> &old_nonlinear_solution =\n _system.get_vector(\"_old_nonlinear_solution\");\n NumericVector<Number> &nonlinear_solution =\n *(_system.solution);\n\n old_nonlinear_solution = nonlinear_solution;\n\n if (!first_solve)\n _system.time += _system.deltat;\n}\n\n\n\nNumber UnsteadySolver::old_nonlinear_solution(const unsigned int global_dof_number)\nconst\n{\n assert (global_dof_number < _system.get_dof_map().n_dofs());\n assert (global_dof_number < old_local_nonlinear_solution->size());\n\n return (*old_local_nonlinear_solution)(global_dof_number);\n}\n\n\n\nReal UnsteadySolver::du(const SystemNorm &norm) const\n{\n\n AutoPtr<NumericVector<Number> > solution_copy =\n _system.solution->clone();\n\n solution_copy->add(-1., _system.get_vector(\"_old_nonlinear_solution\"));\n\n solution_copy->close();\n\n return _system.calculate_norm(*solution_copy, norm);\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"transforms\/DevirtFunctions.hh\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include<set>\n#include<algorithm>\n\nusing namespace llvm;\n\nnamespace previrt {\nnamespace transforms {\n \n static bool isIndirectCall(CallSite &CS) {\n Value *v = CS.getCalledValue ();\n if (!v) return false;\n \n v = v->stripPointerCasts ();\n return !isa<Function> (v);\n }\n\n static PointerType * getVoidPtrType(LLVMContext & C) {\n Type * Int8Type = IntegerType::getInt8Ty(C);\n return PointerType::getUnqual(Int8Type);\n }\n\n static Value * castTo(Value * V, Type * Ty, std::string Name, Instruction * InsertPt) {\n \/\/ Don't bother creating a cast if it's already the correct type.\n if (V->getType() == Ty) return V;\n \n \/\/ If it's a constant, just create a constant expression.\n if (Constant * C = dyn_cast<Constant>(V))\n {\n Constant * CE = ConstantExpr::getZExtOrBitCast (C, Ty);\n return CE;\n }\n \n \/\/ Otherwise, insert a cast instruction.\n return CastInst::CreateZExtOrBitCast (V, Ty, Name, InsertPt);\n }\n \n Function* DevirtualizeFunctions::mkBounceFn(CallSite &CS, CallSiteResolver* CSR) {\n assert (isIndirectCall (CS) && \"Not an indirect call\");\n\n AliasSetId id = typeAliasId (CS);\n if (!CSR->useAliasing()) {\n \/\/ -- If we just use types then we can reuse the same bounce\n \/\/ -- function to avoid many duplicates.\n \/\/ \n \/\/ -- If we use Dsa we don't want to use the same bounce for the\n \/\/ -- same callee's type since the targets returned by Dsa can\n \/\/ -- be different from one callsite to another.\n auto it = m_bounceMap.find (id);\n if (it != m_bounceMap.end ()) return it->second;\n }\n \n \/\/ -- no direct calls in this alias set, nothing to construct\n if (!m_typeAliasSets.count(id)) return nullptr;\n \n \/\/ -- the final targets to build the bounce function\n AliasSet Targets;\n \/\/ -- all possible candidate targets whose type signatures matche\n AliasSet& TypesTargets = m_typeAliasSets [id];\n \/\/ -- targets provided by an external pointer analysis (optional)\n\n if (CSR->hasTargets(CS.getInstruction())) {\n \/\/ --- We filter out those targets whose signature do not match.\n AliasSet& AliasTargets = CSR->getTargets(CS.getInstruction());\n std::sort(TypesTargets.begin(), TypesTargets.end());\n std::sort(AliasTargets.begin(), AliasTargets.end());\n std::set_intersection(AliasTargets.begin(), AliasTargets.end(),\n\t\t\t TypesTargets.begin(), TypesTargets.end(),\n\t\t\t std::back_inserter(Targets));\n } else {\n \/\/ -- We did not have aliasing information so we just use types\n Targets = std::move(TypesTargets);\n }\n\n if (Targets.empty()) {\n \/\/ -- it's possible to be here if we had aliasing information\n \/\/ -- but it was not type consistent. If here, we won't able to\n \/\/ -- resolve the indirect call.\n return nullptr;\n }\n\n \/\/ Create a bounce function that has a function signature almost\n \/\/ identical to the function being called. The only difference is\n \/\/ that it will have an additional pointer argument at the\n \/\/ beginning of its argument list that will be the function to\n \/\/ call.\n Value* ptr = CS.getCalledValue();\n SmallVector<Type*, 8> TP;\n TP.push_back (ptr->getType ());\n for (auto i = CS.arg_begin(), e = CS.arg_end (); i != e; ++i) \n TP.push_back ((*i)->getType());\n \n FunctionType* NewTy = FunctionType::get (CS.getType(), TP, false);\n Module * M = CS.getInstruction()->getParent()->getParent()->getParent();\n assert (M);\n Function* F = Function::Create (NewTy,\n GlobalValue::InternalLinkage,\n \"seahorn.bounce\",\n M);\n \n \/\/ Set the names of the arguments. Also, record the arguments in a vector\n \/\/ for subsequence access.\n F->arg_begin()->setName(\"funcPtr\");\n SmallVector<Value*, 8> fargs;\n auto ai = F->arg_begin();\n ++ai;\n for(auto ae = F->arg_end(); ai != ae; ++ai) {\n fargs.push_back(&*ai);\n ai->setName(\"arg\");\n }\n \n \/\/ Create an entry basic block for the function. All it should do is perform\n \/\/ some cast instructions and branch to the first comparison basic block.\n BasicBlock* entryBB = BasicBlock::Create (M->getContext(), \"entry\", F);\n\n \/\/ XXX: we sort Targets based on the name because otherwise the\n \/\/ order of the \"case\" statements in the switch can be different\n \/\/ with different OS or compiler. This has been a problem with\n \/\/ travis.\n std::sort(Targets.begin(), Targets.end(),\n\t [](const Function *F1, const Function *F2) {\n\t\tif (F1->hasName() && F2->hasName()) {\n\t\t return F1->getName() < F2->getName();\n\t\t} else {\n\t\t return F1 < F2;\n\t\t}\n\t });\n \n \/\/ For each function target, create a basic block that will call that\n \/\/ function directly.\n DenseMap<const Function*, BasicBlock*> targets;\n for (const Function *FL : Targets) {\n \/\/ Create the basic block for doing the direct call\n BasicBlock* BL = BasicBlock::Create (M->getContext(), FL->getName(), F);\n targets[FL] = BL;\n \/\/ Create the direct function call\n CallInst* directCall = CallInst::Create (const_cast<Function*>(FL),\n fargs, \"\", BL);\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ auto fl_cg = m_cg->getOrInsertFunction (const_cast<Function*> (FL));\n \/\/ auto cf_cg = m_cg->getOrInsertFunction (directCall->getCalledFunction ());\n \/\/ fl_cg->addCalledFunction (CallSite (directCall), cf_cg);\n \/\/ }\n \n \/\/ Add the return instruction for the basic block\n if (CS.getType()->isVoidTy())\n ReturnInst::Create (M->getContext(), BL);\n else\n ReturnInst::Create (M->getContext(), directCall, BL);\n }\n\n\n\n BasicBlock * defaultBB = nullptr;\n if (m_allowIndirectCalls) {\n \/\/ Create a default basic block having the original indirect call\n defaultBB = BasicBlock::Create (M->getContext(), \"default\", F);\n if (CS.getType()->isVoidTy()) {\n\tReturnInst::Create (M->getContext(), defaultBB);\n } else {\n\tCallInst *defaultRet = CallInst::Create(&*(F->arg_begin()), fargs, \"\", defaultBB);\n\tReturnInst::Create (M->getContext(), defaultRet, defaultBB);\n }\n } else {\n \/\/ Create a failure basic block. This basic block should simply be an\n \/\/ unreachable instruction.\n defaultBB = BasicBlock::Create (M->getContext(), \"fail\", F);\n new UnreachableInst (M->getContext(), defaultBB);\n }\n \n \/\/ Setup the entry basic block. For now, just have it call the default\n \/\/ basic block. We'll change the basic block to which it branches later.\n BranchInst * InsertPt = BranchInst::Create (defaultBB, entryBB);\n \n \/\/ Create basic blocks which will test the value of the incoming function\n \/\/ pointer and branch to the appropriate basic block to call the function.\n Type * VoidPtrType = getVoidPtrType (M->getContext());\n Value * FArg = castTo (&*(F->arg_begin()), VoidPtrType, \"\", InsertPt);\n BasicBlock * tailBB = defaultBB;\n for (const Function *FL : Targets)\n {\n \n \/\/ Cast the function pointer to an integer. This can go in the entry\n \/\/ block.\n Value * TargetInt = castTo (const_cast<Function*>(FL),\n VoidPtrType,\n \"\",\n InsertPt);\n \n \/\/ Create a new basic block that compares the function pointer to the\n \/\/ function target. If the function pointer matches, we'll branch to the\n \/\/ basic block performing the direct call for that function; otherwise,\n \/\/ we'll branch to the next function call target.\n BasicBlock* TB = targets [FL];\n BasicBlock* newB = BasicBlock::Create (M->getContext(),\n \"test.\" + FL->getName(),\n F);\n CmpInst * setcc = CmpInst::Create (Instruction::ICmp,\n CmpInst::ICMP_EQ,\n TargetInt,\n FArg,\n \"sc\",\n newB);\n BranchInst::Create (TB, tailBB, setcc, newB);\n \n \/\/ Make this newly created basic block the next block that will be reached\n \/\/ when the next comparison will need to be done.\n tailBB = newB;\n }\n \n \/\/ Make the entry basic block branch to the first comparison basic block.\n InsertPt->setSuccessor(0, tailBB);\n\n \/\/ -- log the newly created function\n m_bounceMap.insert (std::make_pair (id, F));\n \n \/\/ Return the newly created bounce function.\n return F;\n }\n\n\n void DevirtualizeFunctions::mkDirectCall(CallSite CS, CallSiteResolver* CSR) {\n const Function *bounceFn = mkBounceFn(CS, CSR);\n \/\/ -- something failed\n if (!bounceFn) return;\n \n \/\/ Replace the original call with a call to the bounce function.\n if (CallInst* CI = dyn_cast<CallInst>(CS.getInstruction())) {\n \/\/ The last operand in the op list is the callee\n SmallVector<Value*, 8> Params;\n Params.reserve (std::distance (CI->op_begin(), CI->op_end()));\n Params.push_back (*(CI->op_end () - 1));\n Params.insert (Params.end (), CI->op_begin(), (CI->op_end() - 1));\n std::string name = CI->hasName() ? CI->getName().str() + \".dv\" : \"\";\n CallInst* CN = CallInst::Create (const_cast<Function*>(bounceFn),\n Params,\n name,\n CI);\n\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ m_cg->getOrInsertFunction (const_cast<Function*> (bounceFn));\n \/\/ (*m_cg)[CI->getParent ()->getParent ()]->addCalledFunction\n \/\/ (CallSite (CN), (*m_cg)[CN->getCalledFunction ()]);\n \/\/ }\n\n CN->setDebugLoc (CI->getDebugLoc ());\n CI->replaceAllUsesWith(CN);\n CI->eraseFromParent();\n }\n else if (InvokeInst* CI = dyn_cast<InvokeInst>(CS.getInstruction())) {\n SmallVector<Value*, 8> Params;\n Params.reserve (std::distance (CI->arg_operands().begin (),\n CI->arg_operands().end ()));\n \/\/ insert first the callee \n Params.push_back (CI->getCalledValue ());\n Params.insert (Params.end (), \n CI->arg_operands().begin (), \n CI->arg_operands().end());\n\n std::string name = CI->hasName() ? CI->getName().str() + \".dv\" : \"\";\n InvokeInst* CN = InvokeInst::Create (const_cast<Function*>(bounceFn),\n CI->getNormalDest(),\n CI->getUnwindDest(),\n Params,\n name,\n CI);\n\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ m_cg->getOrInsertFunction (const_cast<Function*> (bounceFn));\n \/\/ (*m_cg)[CI->getParent ()->getParent ()]->addCalledFunction\n \/\/ (CallSite (CN), (*m_cg)[CN->getCalledFunction ()]);\n \/\/ }\n\n CN->setDebugLoc (CI->getDebugLoc ());\n CI->replaceAllUsesWith(CN);\n CI->eraseFromParent();\n }\n return;\n }\n \n void DevirtualizeFunctions::visitCallSite (CallSite &CS) {\n \/\/ -- skip direct calls\n if (!isIndirectCall (CS)) return;\n \n \/\/ This is an indirect call site. Put it in the worklist of call\n \/\/ sites to transforms.\n m_worklist.push_back (CS.getInstruction());\n return;\n }\n\n void DevirtualizeFunctions::visitCallInst(CallInst &CI) {\n \/\/ we cannot take the address of an inline asm\n if (CI.isInlineAsm ()) return;\n \n CallSite CS(&CI);\n visitCallSite(CS);\n }\n \n void DevirtualizeFunctions::visitInvokeInst(InvokeInst &II) {\n CallSite CS(&II);\n visitCallSite(CS);\n }\n\n DevirtualizeFunctions::AliasSetId DevirtualizeFunctions::typeAliasId (CallSite &CS) {\n assert (isIndirectCall (CS) && \"Not an indirect call\");\n PointerType *pTy = dyn_cast<PointerType> (CS.getCalledValue ()->getType ());\n assert (pTy && \"Unexpected call not through a pointer\");\n assert (isa<FunctionType> (pTy->getElementType ())\n\t && \"The type of called value is not a pointer to a function\");\n return pTy;\n }\n \n \/\/\/ returns an id of an alias set to which this function belongs\n DevirtualizeFunctions::AliasSetId DevirtualizeFunctions::typeAliasId(const Function &F) {\n return F.getFunctionType ()->getPointerTo ();\n }\n\n DevirtualizeFunctions::DevirtualizeFunctions(llvm::CallGraph* cg,\n\t\t\t\t\t bool allowIndirectCalls)\n : \/*m_cg(cg), *\/\n m_allowIndirectCalls(allowIndirectCalls)\n {}\n \n void DevirtualizeFunctions::computeTypeAliasSets(Module& M) {\n \/\/ -- Create type-based alias sets\n for (auto const &F: M) {\n \/\/ -- intrinsics are never called indirectly\n if (F.isIntrinsic ()) continue;\n \n \/\/ -- local functions whose address is not taken cannot be\n \/\/ -- resolved by a function pointer\n if (F.hasLocalLinkage () && !F.hasAddressTaken ()) continue;\n \n \/\/ -- skip calls to declarations, these are resolved implicitly\n \/\/ -- by calling through the function pointer argument in the\n \/\/ -- default case of bounce function\n \n \/\/ XXX: In OCCAM, it's common to take the address of an external\n \/\/ function if declared in another library.\n \/\/ \n \/\/if (F.isDeclaration ()) continue;\n \n \/\/ -- skip seahorn and verifier specific intrinsics\n if (F.getName().startswith (\"seahorn.\")) continue;\n if (F.getName().startswith (\"verifier.\")) continue;\n \/\/ -- assume entry point is never called indirectly\n if (F.getName ().equals (\"main\")) continue;\n \n \/\/ -- add F to its corresponding alias set\n m_typeAliasSets[DevirtualizeFunctions::typeAliasId(F)].push_back(&F);\n }\n }\n \n bool DevirtualizeFunctions::resolveCallSites(Module & M, CallSiteResolver* CSR) {\n \/\/ -- Compute type alias sets if not computed already\n if (m_typeAliasSets.empty()) {\n computeTypeAliasSets(M);\n }\n \n \/\/ -- Visit all of the call instructions in this function and\n \/\/ -- record those that are indirect function calls.\n visit(M);\n \n \/\/ -- Now go through and transform all of the indirect calls that\n \/\/ -- we found that need transforming.\n bool Changed = !m_worklist.empty ();\n for (auto I : m_worklist) {\n CallSite CS(I);\n mkDirectCall(CS, CSR);\n }\n \/\/ -- Conservatively assume that we've changed one or more call\n \/\/ -- sites.\n return Changed;\n }\n \n} \/\/ end namespace\n} \/\/ end namespace\n<commit_msg>Fix when the return of a call is optimized away<commit_after>#include \"transforms\/DevirtFunctions.hh\"\n#include \"llvm\/Pass.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n\n#include<set>\n#include<algorithm>\n\nusing namespace llvm;\n\nnamespace previrt {\nnamespace transforms {\n \n static bool isIndirectCall(CallSite &CS) {\n Value *v = CS.getCalledValue ();\n if (!v) return false;\n \n v = v->stripPointerCasts ();\n return !isa<Function> (v);\n }\n\n static PointerType * getVoidPtrType(LLVMContext & C) {\n Type * Int8Type = IntegerType::getInt8Ty(C);\n return PointerType::getUnqual(Int8Type);\n }\n\n static Value * castTo(Value * V, Type * Ty, std::string Name, Instruction * InsertPt) {\n \/\/ Don't bother creating a cast if it's already the correct type.\n if (V->getType() == Ty) return V;\n \n \/\/ If it's a constant, just create a constant expression.\n if (Constant * C = dyn_cast<Constant>(V))\n {\n Constant * CE = ConstantExpr::getZExtOrBitCast (C, Ty);\n return CE;\n }\n \n \/\/ Otherwise, insert a cast instruction.\n return CastInst::CreateZExtOrBitCast (V, Ty, Name, InsertPt);\n }\n \n Function* DevirtualizeFunctions::mkBounceFn(CallSite &CS, CallSiteResolver* CSR) {\n assert (isIndirectCall (CS) && \"Not an indirect call\");\n\n AliasSetId id = typeAliasId (CS);\n if (!CSR->useAliasing()) {\n \/\/ -- If we just use types then we can reuse the same bounce\n \/\/ -- function to avoid many duplicates.\n \/\/ \n \/\/ -- If we use Dsa we don't want to use the same bounce for the\n \/\/ -- same callee's type since the targets returned by Dsa can\n \/\/ -- be different from one callsite to another.\n auto it = m_bounceMap.find (id);\n if (it != m_bounceMap.end ()) return it->second;\n }\n \n \/\/ -- no direct calls in this alias set, nothing to construct\n if (!m_typeAliasSets.count(id)) {\n llvm::errs() << \"Devirt: no function defined in the current module matches type signature of \"\n\t\t << *CS.getInstruction() << \"\\n\";\n return nullptr;\n }\n \n \/\/ -- the final targets to build the bounce function\n AliasSet Targets;\n \/\/ -- all possible candidate targets whose type signatures matche\n AliasSet& TypesTargets = m_typeAliasSets [id];\n \/\/ -- targets provided by an external pointer analysis (optional)\n\n if (CSR->hasTargets(CS.getInstruction())) {\n \/\/ --- We filter out those targets whose signature do not match.\n AliasSet& AliasTargets = CSR->getTargets(CS.getInstruction());\n std::sort(TypesTargets.begin(), TypesTargets.end());\n std::sort(AliasTargets.begin(), AliasTargets.end());\n std::set_intersection(AliasTargets.begin(), AliasTargets.end(),\n\t\t\t TypesTargets.begin(), TypesTargets.end(),\n\t\t\t std::back_inserter(Targets));\n } else {\n \/\/ -- We did not have aliasing information so we just use types\n Targets = std::move(TypesTargets);\n }\n\n if (Targets.empty()) {\n \/\/ -- it's possible to be here if we had aliasing information\n \/\/ -- but it was not type consistent. If here, we won't able to\n \/\/ -- resolve the indirect call.\n llvm::errs() << \"Devirt: no callees after filtering out aliasing candidates with type information \"\n\t\t << *CS.getInstruction() << \"\\n\";\n return nullptr;\n }\n\n \/\/ Create a bounce function that has a function signature almost\n \/\/ identical to the function being called. The only difference is\n \/\/ that it will have an additional pointer argument at the\n \/\/ beginning of its argument list that will be the function to\n \/\/ call.\n Value* ptr = CS.getCalledValue();\n SmallVector<Type*, 8> TP;\n TP.push_back (ptr->getType ());\n for (auto i = CS.arg_begin(), e = CS.arg_end (); i != e; ++i) \n TP.push_back ((*i)->getType());\n \n FunctionType* NewTy = FunctionType::get (CS.getType(), TP, false);\n Module * M = CS.getInstruction()->getParent()->getParent()->getParent();\n assert (M);\n Function* F = Function::Create (NewTy,\n GlobalValue::InternalLinkage,\n \"seahorn.bounce\",\n M);\n \n \/\/ Set the names of the arguments. Also, record the arguments in a vector\n \/\/ for subsequence access.\n F->arg_begin()->setName(\"funcPtr\");\n SmallVector<Value*, 8> fargs;\n auto ai = F->arg_begin();\n ++ai;\n for(auto ae = F->arg_end(); ai != ae; ++ai) {\n fargs.push_back(&*ai);\n ai->setName(\"arg\");\n }\n \n \/\/ Create an entry basic block for the function. All it should do is perform\n \/\/ some cast instructions and branch to the first comparison basic block.\n BasicBlock* entryBB = BasicBlock::Create (M->getContext(), \"entry\", F);\n\n \/\/ XXX: we sort Targets based on the name because otherwise the\n \/\/ order of the \"case\" statements in the switch can be different\n \/\/ with different OS or compiler. This has been a problem with\n \/\/ travis.\n std::sort(Targets.begin(), Targets.end(),\n\t [](const Function *F1, const Function *F2) {\n\t\tif (F1->hasName() && F2->hasName()) {\n\t\t return F1->getName() < F2->getName();\n\t\t} else {\n\t\t return F1 < F2;\n\t\t}\n\t });\n \n \/\/ For each function target, create a basic block that will call that\n \/\/ function directly.\n DenseMap<const Function*, BasicBlock*> targets;\n for (const Function *FL : Targets) {\n \/\/ Create the basic block for doing the direct call\n BasicBlock* BL = BasicBlock::Create (M->getContext(), FL->getName(), F);\n targets[FL] = BL;\n \/\/ Create the direct function call\n CallInst* directCall = CallInst::Create (const_cast<Function*>(FL),\n fargs, \"\", BL);\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ auto fl_cg = m_cg->getOrInsertFunction (const_cast<Function*> (FL));\n \/\/ auto cf_cg = m_cg->getOrInsertFunction (directCall->getCalledFunction ());\n \/\/ fl_cg->addCalledFunction (CallSite (directCall), cf_cg);\n \/\/ }\n \n \/\/ Add the return instruction for the basic block\n if (CS.getType()->isVoidTy())\n ReturnInst::Create (M->getContext(), BL);\n else\n ReturnInst::Create (M->getContext(), directCall, BL);\n }\n\n\n\n BasicBlock * defaultBB = nullptr;\n if (m_allowIndirectCalls) {\n \/\/ Create a default basic block having the original indirect call\n defaultBB = BasicBlock::Create (M->getContext(), \"default\", F);\n if (CS.getType()->isVoidTy()) {\n\tReturnInst::Create (M->getContext(), defaultBB);\n } else {\n\tCallInst *defaultRet = CallInst::Create(&*(F->arg_begin()), fargs, \"\", defaultBB);\n\tReturnInst::Create (M->getContext(), defaultRet, defaultBB);\n }\n } else {\n \/\/ Create a failure basic block. This basic block should simply be an\n \/\/ unreachable instruction.\n defaultBB = BasicBlock::Create (M->getContext(), \"fail\", F);\n new UnreachableInst (M->getContext(), defaultBB);\n }\n \n \/\/ Setup the entry basic block. For now, just have it call the default\n \/\/ basic block. We'll change the basic block to which it branches later.\n BranchInst * InsertPt = BranchInst::Create (defaultBB, entryBB);\n \n \/\/ Create basic blocks which will test the value of the incoming function\n \/\/ pointer and branch to the appropriate basic block to call the function.\n Type * VoidPtrType = getVoidPtrType (M->getContext());\n Value * FArg = castTo (&*(F->arg_begin()), VoidPtrType, \"\", InsertPt);\n BasicBlock * tailBB = defaultBB;\n for (const Function *FL : Targets)\n {\n \n \/\/ Cast the function pointer to an integer. This can go in the entry\n \/\/ block.\n Value * TargetInt = castTo (const_cast<Function*>(FL),\n VoidPtrType,\n \"\",\n InsertPt);\n \n \/\/ Create a new basic block that compares the function pointer to the\n \/\/ function target. If the function pointer matches, we'll branch to the\n \/\/ basic block performing the direct call for that function; otherwise,\n \/\/ we'll branch to the next function call target.\n BasicBlock* TB = targets [FL];\n BasicBlock* newB = BasicBlock::Create (M->getContext(),\n \"test.\" + FL->getName(),\n F);\n CmpInst * setcc = CmpInst::Create (Instruction::ICmp,\n CmpInst::ICMP_EQ,\n TargetInt,\n FArg,\n \"sc\",\n newB);\n BranchInst::Create (TB, tailBB, setcc, newB);\n \n \/\/ Make this newly created basic block the next block that will be reached\n \/\/ when the next comparison will need to be done.\n tailBB = newB;\n }\n \n \/\/ Make the entry basic block branch to the first comparison basic block.\n InsertPt->setSuccessor(0, tailBB);\n\n \/\/ -- log the newly created function\n m_bounceMap.insert (std::make_pair (id, F));\n \n \/\/ Return the newly created bounce function.\n return F;\n }\n\n\n void DevirtualizeFunctions::mkDirectCall(CallSite CS, CallSiteResolver* CSR) {\n const Function *bounceFn = mkBounceFn(CS, CSR);\n \/\/ -- something failed\n if (!bounceFn) return;\n \n \/\/ Replace the original call with a call to the bounce function.\n if (CallInst* CI = dyn_cast<CallInst>(CS.getInstruction())) {\n \/\/ The last operand in the op list is the callee\n SmallVector<Value*, 8> Params;\n Params.reserve (std::distance (CI->op_begin(), CI->op_end()));\n Params.push_back (*(CI->op_end () - 1));\n Params.insert (Params.end (), CI->op_begin(), (CI->op_end() - 1));\n std::string name = CI->hasName() ? CI->getName().str() + \".dv\" : \"\";\n CallInst* CN = CallInst::Create (const_cast<Function*>(bounceFn),\n Params,\n name,\n CI);\n\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ m_cg->getOrInsertFunction (const_cast<Function*> (bounceFn));\n \/\/ (*m_cg)[CI->getParent ()->getParent ()]->addCalledFunction\n \/\/ (CallSite (CN), (*m_cg)[CN->getCalledFunction ()]);\n \/\/ }\n\n CN->setDebugLoc (CI->getDebugLoc ());\n CI->replaceAllUsesWith(CN);\n CI->eraseFromParent();\n }\n else if (InvokeInst* CI = dyn_cast<InvokeInst>(CS.getInstruction())) {\n SmallVector<Value*, 8> Params;\n Params.reserve (std::distance (CI->arg_operands().begin (),\n CI->arg_operands().end ()));\n \/\/ insert first the callee \n Params.push_back (CI->getCalledValue ());\n Params.insert (Params.end (), \n CI->arg_operands().begin (), \n CI->arg_operands().end());\n\n std::string name = CI->hasName() ? CI->getName().str() + \".dv\" : \"\";\n InvokeInst* CN = InvokeInst::Create (const_cast<Function*>(bounceFn),\n CI->getNormalDest(),\n CI->getUnwindDest(),\n Params,\n name,\n CI);\n\n \/\/ update call graph\n \/\/ if (m_cg) {\n \/\/ m_cg->getOrInsertFunction (const_cast<Function*> (bounceFn));\n \/\/ (*m_cg)[CI->getParent ()->getParent ()]->addCalledFunction\n \/\/ (CallSite (CN), (*m_cg)[CN->getCalledFunction ()]);\n \/\/ }\n\n CN->setDebugLoc (CI->getDebugLoc ());\n CI->replaceAllUsesWith(CN);\n CI->eraseFromParent();\n }\n return;\n }\n \n void DevirtualizeFunctions::visitCallSite (CallSite &CS) {\n \/\/ -- skip direct calls\n if (!isIndirectCall (CS)) return;\n \n \/\/ This is an indirect call site. Put it in the worklist of call\n \/\/ sites to transforms.\n m_worklist.push_back (CS.getInstruction());\n return;\n }\n\n void DevirtualizeFunctions::visitCallInst(CallInst &CI) {\n \/\/ we cannot take the address of an inline asm\n if (CI.isInlineAsm ()) return;\n \n CallSite CS(&CI);\n visitCallSite(CS);\n }\n \n void DevirtualizeFunctions::visitInvokeInst(InvokeInst &II) {\n CallSite CS(&II);\n visitCallSite(CS);\n }\n\n DevirtualizeFunctions::AliasSetId DevirtualizeFunctions::typeAliasId (CallSite &CS) {\n assert (isIndirectCall (CS) && \"Not an indirect call\");\n PointerType *pTy = nullptr;\n \n \/*\n %390 = load void (i8*, i32*, i32*, i64, i32)*, \n void (i8*, i32*, i32*, i64, i32)** \n\t\t\tbitcast (i64 (i8*, i32*, i32*, i64, i32)** @listdir to \n void (i8*, i32*, i32*, i64, i32)**)\n call void %390(i8* %385, i32* %1, i32* %2, i64 %139, i32 %26) \n *\/\n if (LoadInst* LI = dyn_cast<LoadInst>(CS.getCalledValue())) {\n if (Constant* C = dyn_cast<Constant>(LI->getPointerOperand())) {\n\tif (ConstantExpr* CE = dyn_cast<ConstantExpr>(C)) {\n\t if (CE->getOpcode() == Instruction::BitCast) {\n\t if (PointerType *ppTy = dyn_cast<PointerType>(CE->getOperand(0)->getType())) {\n\t pTy = dyn_cast<PointerType>(ppTy->getElementType());\n\t if (pTy) {\n\t\tassert (isa<FunctionType>(pTy->getElementType())\n\t\t\t&& \"The type of called value is not a pointer to a function\");\n\t }\n\t }\n\t }\n\t}\n }\n }\n\n if (pTy) {\n return pTy;\n }\n \n pTy = dyn_cast<PointerType> (CS.getCalledValue()->getType ());\n assert (pTy && \"Unexpected call not through a pointer\");\n assert (isa<FunctionType> (pTy->getElementType ())\n\t && \"The type of called value is not a pointer to a function\");\n return pTy;\n }\n \n \/\/\/ returns an id of an alias set to which this function belongs\n DevirtualizeFunctions::AliasSetId DevirtualizeFunctions::typeAliasId(const Function &F) {\n return F.getFunctionType ()->getPointerTo ();\n }\n\n DevirtualizeFunctions::DevirtualizeFunctions(llvm::CallGraph* cg,\n\t\t\t\t\t bool allowIndirectCalls)\n : \/*m_cg(cg), *\/\n m_allowIndirectCalls(allowIndirectCalls)\n {}\n \n void DevirtualizeFunctions::computeTypeAliasSets(Module& M) {\n \/\/ -- Create type-based alias sets\n for (auto const &F: M) {\n \/\/ -- intrinsics are never called indirectly\n if (F.isIntrinsic ()) continue;\n \n \/\/ -- local functions whose address is not taken cannot be\n \/\/ -- resolved by a function pointer\n if (F.hasLocalLinkage () && !F.hasAddressTaken ()) continue;\n \n \/\/ -- skip calls to declarations, these are resolved implicitly\n \/\/ -- by calling through the function pointer argument in the\n \/\/ -- default case of bounce function\n \n \/\/ XXX: In OCCAM, it's common to take the address of an external\n \/\/ function if declared in another library.\n \/\/ \n \/\/if (F.isDeclaration ()) continue;\n \n \/\/ -- skip seahorn and verifier specific intrinsics\n if (F.getName().startswith (\"seahorn.\")) continue;\n if (F.getName().startswith (\"verifier.\")) continue;\n \/\/ -- assume entry point is never called indirectly\n if (F.getName ().equals (\"main\")) continue;\n \n \/\/ -- add F to its corresponding alias set\n m_typeAliasSets[DevirtualizeFunctions::typeAliasId(F)].push_back(&F);\n }\n }\n \n bool DevirtualizeFunctions::resolveCallSites(Module & M, CallSiteResolver* CSR) {\n \/\/ -- Compute type alias sets if not computed already\n if (m_typeAliasSets.empty()) {\n computeTypeAliasSets(M);\n }\n \n \/\/ -- Visit all of the call instructions in this function and\n \/\/ -- record those that are indirect function calls.\n visit(M);\n \n \/\/ -- Now go through and transform all of the indirect calls that\n \/\/ -- we found that need transforming.\n bool Changed = !m_worklist.empty ();\n for (auto I : m_worklist) {\n CallSite CS(I);\n mkDirectCall(CS, CSR);\n }\n \/\/ -- Conservatively assume that we've changed one or more call\n \/\/ -- sites.\n return Changed;\n }\n \n} \/\/ end namespace\n} \/\/ end namespace\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright © 2015, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#ifndef NIX_VARIANT_H\n#define NIX_VARIANT_H\n\n#include <nix\/DataType.hpp>\n#include <nix\/Platform.hpp>\n#include <nix\/None.hpp>\n\n#include <string>\n#include <cstdint>\n#include <stdexcept>\n#include <iostream>\n\nnamespace nix {\n\/**\n * @brief Class that can hold either a bool, double, (u)int(34|64) or a string.\n *\/\nclass NIXAPI Variant {\nprivate:\n DataType dtype;\n\n union {\n bool v_bool;\n double v_double;\n uint32_t v_uint32;\n int32_t v_int32;\n uint64_t v_uint64;\n int64_t v_int64;\n char *v_string;\n };\n\npublic:\n Variant() : dtype(DataType::Nothing), v_bool(false) { }\n\n explicit Variant(char *value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n explicit Variant(const char *value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n template<typename T>\n explicit Variant(const T &value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n template<size_t N>\n explicit Variant(const char (&value)[N]) : dtype(DataType::Nothing) {\n set(value, N);\n }\n\n Variant(const Variant &other) : Variant() {\n assign_variant_from(other);\n }\n\n Variant(Variant &&other) NOEXCEPT : Variant() {\n swap(other);\n }\n\n Variant &operator=(Variant other) {\n swap(other);\n return *this;\n }\n\n virtual ~Variant() {\n maybe_deallocte_string();\n }\n\n void set(none_t);\n void set(bool value);\n void set(int32_t value);\n void set(uint32_t value);\n void set(int64_t value);\n void set(uint64_t value);\n void set(double value);\n void set(const char *value, const size_t len);\n void set(const char *value);\n void set(const std::string &value);\n\n template<typename T>\n T get() const {\n T temp;\n get(temp);\n return temp;\n }\n\n void get(none_t &tag) const;\n void get(bool &out) const;\n void get(int32_t &value) const;\n void get(uint32_t &value) const;\n void get(int64_t &value) const;\n void get(uint64_t &value) const;\n void get(double &value) const;\n void get(std::string &value) const;\n\n DataType type() const {\n return dtype;\n }\n\n void swap(Variant &other);\n\n static bool supports_type(DataType dtype);\n\nprivate:\n\n template<typename T>\n void swap_helper(Variant &other) {\n T temp = get<T>();\n assign_variant_from(other);\n other.set(temp);\n }\n\n void assign_variant_from(const Variant &other);\n\n void maybe_deallocte_string();\n\n inline void check_argument_type(DataType check) const {\n if (dtype != check) {\n throw std::invalid_argument(\"Incompatible DataType\");\n }\n }\n};\n\n\ntemplate<>\ninline const char *Variant::get<const char *>() const {\n check_argument_type(DataType::String);\n return v_string;\n}\n\ntemplate<>\ninline const none_t Variant::get<>() const {\n return nix::none;\n}\n\ntemplate<>\ninline void Variant::swap_helper<none_t>(Variant &other) {\n assign_variant_from(other);\n other.set(nix::none);\n}\n\nNIXAPI std::ostream &operator<<(std::ostream &out, const Variant &value);\nNIXAPI bool operator==(const Variant &a, const Variant &b);\ninline bool operator!=(const Variant &a, const Variant &b) { return !(a == b); }\nNIXAPI void swap(Variant &a, Variant &b);\n\n} \/\/ nix::\n#endif<commit_msg>Variant: move, assignment op: don't use swap<commit_after>\/\/ Copyright © 2015, German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#ifndef NIX_VARIANT_H\n#define NIX_VARIANT_H\n\n#include <nix\/DataType.hpp>\n#include <nix\/Platform.hpp>\n#include <nix\/None.hpp>\n\n#include <string>\n#include <cstdint>\n#include <stdexcept>\n#include <iostream>\n\nnamespace nix {\n\/**\n * @brief Class that can hold either a bool, double, (u)int(34|64) or a string.\n *\/\nclass NIXAPI Variant {\nprivate:\n DataType dtype;\n\n union {\n bool v_bool;\n double v_double;\n uint32_t v_uint32;\n int32_t v_int32;\n uint64_t v_uint64;\n int64_t v_int64;\n char *v_string;\n };\n\npublic:\n Variant() : dtype(DataType::Nothing), v_bool(false) { }\n\n explicit Variant(char *value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n explicit Variant(const char *value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n template<typename T>\n explicit Variant(const T &value) : dtype(DataType::Nothing) {\n set(value);\n }\n\n template<size_t N>\n explicit Variant(const char (&value)[N]) : dtype(DataType::Nothing) {\n set(value, N);\n }\n\n Variant(const Variant &other) : Variant() {\n assign_variant_from(other);\n }\n\n Variant(Variant &&other) NOEXCEPT : Variant() {\n if (other.dtype == DataType::String) {\n v_string = other.v_string;\n dtype = DataType::String;\n other.dtype = DataType::Nothing;\n other.v_string = nullptr;\n } else {\n assign_variant_from(other);\n }\n }\n\n Variant &operator=(Variant other) {\n assign_variant_from(other);\n return *this;\n }\n\n virtual ~Variant() {\n maybe_deallocte_string();\n }\n\n void set(none_t);\n void set(bool value);\n void set(int32_t value);\n void set(uint32_t value);\n void set(int64_t value);\n void set(uint64_t value);\n void set(double value);\n void set(const char *value, const size_t len);\n void set(const char *value);\n void set(const std::string &value);\n\n template<typename T>\n T get() const {\n T temp;\n get(temp);\n return temp;\n }\n\n void get(none_t &tag) const;\n void get(bool &out) const;\n void get(int32_t &value) const;\n void get(uint32_t &value) const;\n void get(int64_t &value) const;\n void get(uint64_t &value) const;\n void get(double &value) const;\n void get(std::string &value) const;\n\n DataType type() const {\n return dtype;\n }\n\n void swap(Variant &other);\n\n static bool supports_type(DataType dtype);\n\nprivate:\n\n template<typename T>\n void swap_helper(Variant &other) {\n T temp = get<T>();\n assign_variant_from(other);\n other.set(temp);\n }\n\n void assign_variant_from(const Variant &other);\n\n void maybe_deallocte_string();\n\n inline void check_argument_type(DataType check) const {\n if (dtype != check) {\n throw std::invalid_argument(\"Incompatible DataType\");\n }\n }\n};\n\n\ntemplate<>\ninline const char *Variant::get<const char *>() const {\n check_argument_type(DataType::String);\n return v_string;\n}\n\ntemplate<>\ninline const none_t Variant::get<>() const {\n return nix::none;\n}\n\ntemplate<>\ninline void Variant::swap_helper<none_t>(Variant &other) {\n assign_variant_from(other);\n other.set(nix::none);\n}\n\nNIXAPI std::ostream &operator<<(std::ostream &out, const Variant &value);\nNIXAPI bool operator==(const Variant &a, const Variant &b);\ninline bool operator!=(const Variant &a, const Variant &b) { return !(a == b); }\nNIXAPI void swap(Variant &a, Variant &b);\n\n} \/\/ nix::\n#endif<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n * $Id$\n *\n * Project: libLAS - http:\/\/liblas.org - A BSD library for LAS format data.\n * Purpose: LAS Schema implementation for C++ libLAS\n * Author: Howard Butler, hobu.inc@gmail.com\n *\n ******************************************************************************\n * Copyright (c) 2010, Howard Butler\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following\n * conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Martin Isenburg or Iowa Department\n * of Natural Resources nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n * OF SUCH DAMAGE.\n ****************************************************************************\/\n\n#ifndef PDAL_SCHEMA_HPP_INCLUDED\n#define PDAL_SCHEMA_HPP_INCLUDED\n\n#include <pdal\/pdal.hpp>\n\n#include <vector>\n#include <map>\n\n#include <pdal\/Dimension.hpp>\n\n\/\/ boost\n#include <boost\/cstdint.hpp>\n#include <boost\/any.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/array.hpp>\n#include <boost\/optional.hpp>\n\n#include <boost\/tuple\/tuple.hpp>\n#include <boost\/tuple\/tuple_comparison.hpp>\n\n\n\nnamespace pdal\n{\n\n\/\/\/ Schema definition\nclass PDAL_DLL Schema\n{\npublic:\n Schema();\n Schema(Schema const& other);\n\n Schema& operator=(Schema const& rhs);\n\n bool operator==(const Schema& other) const;\n bool operator!=(const Schema& other) const;\n\n void appendDimension(Dimension const& dim);\n\n const std::vector<Dimension>& getDimensions() const;\n std::vector<Dimension>& getDimensions();\n\n bool hasDimension(const DimensionId::Id& id) const;\n \/\/bool hasDimension(const Dimension& dim) const;\n\n Dimension& getDimension(const DimensionId::Id& id);\n const Dimension& getDimension(const DimensionId::Id& id) const;\n\n const Dimension& getDimension(std::size_t index) const;\n Dimension& getDimension(std::size_t index);\n \n int getDimensionIndex(const DimensionId::Id& id) const;\n int getDimensionIndex(const Dimension& dim) const;\n\n\n\n \/\/\/ Fetch total byte size -- sum of all dimensions\n inline std::size_t getByteSize() const\n {\n return m_byteSize;\n }\n\n \/\/ returns a ptree reprsenting the Schema\n \/\/\n \/\/ looks like this:\n \/\/ dimension:\n \/\/ [Dimension ptree]\n \/\/ dimension:\n \/\/ [Dimension ptree]\n \/\/ ...\n \/\/\n boost::property_tree::ptree toPTree() const;\n \n void dump() const;\n\n static Schema from_xml(std::string const& xml, std::string const& xsd);\n static Schema from_xml(std::string const& xml);\n static std::string to_xml(Schema const& schema);\n\nprivate:\n void calculateSizes();\n \n std::vector<Dimension> m_dimensions;\n std::size_t m_byteSize;\n\n std::map<DimensionId::Id, std::size_t> m_dimensions_map;\n};\n\n\nPDAL_DLL std::ostream& operator<<(std::ostream& os, pdal::Schema const& d);\n\n} \/\/ namespace liblas\n\n#endif \/\/ PDAL_SCHEMA_HPP_INCLUDED\n<commit_msg>no longer include tuple, not used<commit_after>\/******************************************************************************\n * $Id$\n *\n * Project: libLAS - http:\/\/liblas.org - A BSD library for LAS format data.\n * Purpose: LAS Schema implementation for C++ libLAS\n * Author: Howard Butler, hobu.inc@gmail.com\n *\n ******************************************************************************\n * Copyright (c) 2010, Howard Butler\n *\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following\n * conditions are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of the Martin Isenburg or Iowa Department\n * of Natural Resources nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT\n * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n * OF SUCH DAMAGE.\n ****************************************************************************\/\n\n#ifndef PDAL_SCHEMA_HPP_INCLUDED\n#define PDAL_SCHEMA_HPP_INCLUDED\n\n#include <pdal\/pdal.hpp>\n\n#include <vector>\n#include <map>\n\n#include <pdal\/Dimension.hpp>\n\n\/\/ boost\n#include <boost\/cstdint.hpp>\n#include <boost\/any.hpp>\n#include <boost\/shared_ptr.hpp>\n#include <boost\/foreach.hpp>\n#include <boost\/array.hpp>\n#include <boost\/optional.hpp>\n\nnamespace pdal\n{\n\n\/\/\/ Schema definition\nclass PDAL_DLL Schema\n{\npublic:\n Schema();\n Schema(Schema const& other);\n\n Schema& operator=(Schema const& rhs);\n\n bool operator==(const Schema& other) const;\n bool operator!=(const Schema& other) const;\n\n void appendDimension(Dimension const& dim);\n\n const std::vector<Dimension>& getDimensions() const;\n std::vector<Dimension>& getDimensions();\n\n bool hasDimension(const DimensionId::Id& id) const;\n \/\/bool hasDimension(const Dimension& dim) const;\n\n Dimension& getDimension(const DimensionId::Id& id);\n const Dimension& getDimension(const DimensionId::Id& id) const;\n\n const Dimension& getDimension(std::size_t index) const;\n Dimension& getDimension(std::size_t index);\n \n int getDimensionIndex(const DimensionId::Id& id) const;\n int getDimensionIndex(const Dimension& dim) const;\n\n\n\n \/\/\/ Fetch total byte size -- sum of all dimensions\n inline std::size_t getByteSize() const\n {\n return m_byteSize;\n }\n\n \/\/ returns a ptree reprsenting the Schema\n \/\/\n \/\/ looks like this:\n \/\/ dimension:\n \/\/ [Dimension ptree]\n \/\/ dimension:\n \/\/ [Dimension ptree]\n \/\/ ...\n \/\/\n boost::property_tree::ptree toPTree() const;\n \n void dump() const;\n\n static Schema from_xml(std::string const& xml, std::string const& xsd);\n static Schema from_xml(std::string const& xml);\n static std::string to_xml(Schema const& schema);\n\nprivate:\n void calculateSizes();\n \n std::vector<Dimension> m_dimensions;\n std::size_t m_byteSize;\n\n std::map<DimensionId::Id, std::size_t> m_dimensions_map;\n};\n\n\nPDAL_DLL std::ostream& operator<<(std::ostream& os, pdal::Schema const& d);\n\n} \/\/ namespace liblas\n\n#endif \/\/ PDAL_SCHEMA_HPP_INCLUDED\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright © 2014 German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#ifndef NIX_EXCEPTION_H\n#define NIX_EXCEPTION_H\n\n#include <stdexcept>\n#include <sstream>\n\n#include <nix\/Platform.hpp>\n\nnamespace nix {\n\nclass OutOfBounds : public std::out_of_range {\npublic:\n OutOfBounds(const std::string &what_arg, size_t where) :\n out_of_range(what_arg), index(where) {\n std::stringstream sstream(what_arg);\n\n sstream << \" [at index: \" << where << \"]\";\n msg = sstream.str();\n }\n\n size_t where(void) const {\n return index;\n }\n\n const char *what() const NOEXCEPT {\n return msg.c_str();\n }\n\nprivate:\n size_t index;\n std::string msg;\n};\n\n\nclass UninitializedEntity : public std::exception {\npublic:\n UninitializedEntity() { }\n const char *what() const NOEXCEPT {\n return \"The Entity being accessed is uninitialized.\";\n }\n};\n\n\nclass EmptyString: public std::exception {\npublic:\n EmptyString(const std::string &caller_arg):\n caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"EmptyString: \");\n sstream << \"Empty string given - not a valid value for \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string caller;\n};\n\n\nclass MissingAttr: public std::exception {\npublic:\n MissingAttr(const std::string &attr_arg):\n attr(attr_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"MissingAttribute: \");\n sstream << \"Obligatory attribute \" << attr << \" is not set!\";\n return sstream.str().c_str();\n }\n\nprivate:\n std::string attr;\n};\n\n\nclass UnsortedTicks: public std::exception {\npublic:\n UnsortedTicks(const std::string &caller_arg):\n caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"UnsortedTics: \");\n sstream << \"Ticks are not given in a ascending order: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string caller;\n};\n\n\nclass InvalidUnit: public std::exception {\npublic:\n InvalidUnit(const std::string &what_arg, const std::string &caller_arg):\n what_msg(what_arg), caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"InvalidUnit: \");\n sstream << what_msg << \" evoked at: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string what_msg;\n std::string caller;\n};\n\n\nclass IncompatibleDimensions: public std::exception {\npublic:\n IncompatibleDimensions(const std::string &what_arg, const std::string &caller_arg):\n what_msg(what_arg), caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"IncompatibleDimensions: \");\n sstream << what_msg << \" evoked at: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string what_msg;\n std::string caller;\n};\n\nclass InvalidRankException : public std::runtime_error {\npublic:\n InvalidRankException(const std::string &message)\n : std::runtime_error(message) { }\n};\n\n}\n\n#endif\n<commit_msg>InvalidRankException: derive from out_of_range<commit_after>\/\/ Copyright © 2014 German Neuroinformatics Node (G-Node)\n\/\/\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted under the terms of the BSD License. See\n\/\/ LICENSE file in the root of the Project.\n\/\/\n\/\/ Author: Christian Kellner <kellner@bio.lmu.de>\n\n#ifndef NIX_EXCEPTION_H\n#define NIX_EXCEPTION_H\n\n#include <stdexcept>\n#include <sstream>\n\n#include <nix\/Platform.hpp>\n\nnamespace nix {\n\nclass OutOfBounds : public std::out_of_range {\npublic:\n OutOfBounds(const std::string &what_arg, size_t where) :\n out_of_range(what_arg), index(where) {\n std::stringstream sstream(what_arg);\n\n sstream << \" [at index: \" << where << \"]\";\n msg = sstream.str();\n }\n\n size_t where(void) const {\n return index;\n }\n\n const char *what() const NOEXCEPT {\n return msg.c_str();\n }\n\nprivate:\n size_t index;\n std::string msg;\n};\n\n\nclass UninitializedEntity : public std::exception {\npublic:\n UninitializedEntity() { }\n const char *what() const NOEXCEPT {\n return \"The Entity being accessed is uninitialized.\";\n }\n};\n\n\nclass EmptyString: public std::exception {\npublic:\n EmptyString(const std::string &caller_arg):\n caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"EmptyString: \");\n sstream << \"Empty string given - not a valid value for \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string caller;\n};\n\n\nclass MissingAttr: public std::exception {\npublic:\n MissingAttr(const std::string &attr_arg):\n attr(attr_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"MissingAttribute: \");\n sstream << \"Obligatory attribute \" << attr << \" is not set!\";\n return sstream.str().c_str();\n }\n\nprivate:\n std::string attr;\n};\n\n\nclass UnsortedTicks: public std::exception {\npublic:\n UnsortedTicks(const std::string &caller_arg):\n caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"UnsortedTics: \");\n sstream << \"Ticks are not given in a ascending order: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string caller;\n};\n\n\nclass InvalidUnit: public std::exception {\npublic:\n InvalidUnit(const std::string &what_arg, const std::string &caller_arg):\n what_msg(what_arg), caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"InvalidUnit: \");\n sstream << what_msg << \" evoked at: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string what_msg;\n std::string caller;\n};\n\n\nclass IncompatibleDimensions: public std::exception {\npublic:\n IncompatibleDimensions(const std::string &what_arg, const std::string &caller_arg):\n what_msg(what_arg), caller(caller_arg) { }\n\n const char *what() const NOEXCEPT {\n std::stringstream sstream(\"IncompatibleDimensions: \");\n sstream << what_msg << \" evoked at: \" << caller;\n return sstream.str().c_str();\n }\n\nprivate:\n std::string what_msg;\n std::string caller;\n};\n\nclass InvalidRankException : public std::out_of_range {\npublic:\n InvalidRankException(const std::string &message)\n : std::out_of_range(message) { }\n};\n\n}\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ TODO(zedzull): Make the screen size configurable through Lua\n#define SCREEN_WIDTH 640\n#define SCREEN_HEIGHT 480\n\nint main() {\n glfwInit();\n\n glfwWindowHint(GLFW_RESIZABLE, false);\n\n GLFWwindow *window = glfwCreateWindow(SCREEN_WIDTH, SCREEN_HEIGHT, \"Zull\", NULL, NULL);\n glfwMakeContextCurrent(window);\n glfwSwapInterval(1);\n\n const GLFWvidmode *video_mode = glfwGetVideoMode(glfwGetPrimaryMonitor());\n glfwSetWindowPos(window, (video_mode->width \/ 2) - (SCREEN_WIDTH \/ 2), (video_mode->height \/ 2) - (SCREEN_HEIGHT \/ 2));\n\n glfwSetKeyCallback(window, keyboard_callback);\n\n load_opengl_functions();\n\n graphics_init(SCREEN_WIDTH, SCREEN_HEIGHT);\n\n if (!script_init()) {\n return -1;\n }\n\n f64 delta_time = 1.0 \/ 60.0;\n\n f64 last_time = glfwGetTime();\n f64 unprocessed_time = 0.0;\n\n while (!glfwWindowShouldClose(window)) {\n f64 current_time = glfwGetTime();\n f64 elapsed_time = current_time - last_time;\n last_time = current_time;\n\n unprocessed_time += elapsed_time;\n\n while (unprocessed_time >= delta_time) {\n input_update();\n glfwPollEvents();\n\n if (input_was_key_pressed(KEY_ESCAPE)) {\n glfwSetWindowShouldClose(window, true);\n }\n\n script_update(delta_time);\n unprocessed_time -= delta_time;\n }\n \n graphics_begin_frame();\n \n script_draw();\n \n graphics_end_frame();\n\n glfwSwapBuffers(window);\n }\n\n script_shutdown();\n\n glfwTerminate();\n\n return 0;\n}\n<commit_msg>Updated script_init() function call to fit new signature.<commit_after>\/\/ TODO(zedzull): Make the screen size configurable through Lua\n#define SCREEN_WIDTH 640\n#define SCREEN_HEIGHT 480\n\nint main() {\n glfwInit();\n\n glfwWindowHint(GLFW_RESIZABLE, false);\n\n GLFWwindow *window = glfwCreateWindow(SCREEN_WIDTH, SCREEN_HEIGHT, \"Zull\", NULL, NULL);\n glfwMakeContextCurrent(window);\n glfwSwapInterval(1);\n\n const GLFWvidmode *video_mode = glfwGetVideoMode(glfwGetPrimaryMonitor());\n glfwSetWindowPos(window, (video_mode->width \/ 2) - (SCREEN_WIDTH \/ 2), (video_mode->height \/ 2) - (SCREEN_HEIGHT \/ 2));\n\n glfwSetKeyCallback(window, keyboard_callback);\n\n load_opengl_functions();\n\n graphics_init(SCREEN_WIDTH, SCREEN_HEIGHT);\n\n if (!script_init(\"game\/main.lua\")) {\n return -1;\n }\n\n f64 delta_time = 1.0 \/ 60.0;\n\n f64 last_time = glfwGetTime();\n f64 unprocessed_time = 0.0;\n\n while (!glfwWindowShouldClose(window)) {\n f64 current_time = glfwGetTime();\n f64 elapsed_time = current_time - last_time;\n last_time = current_time;\n\n unprocessed_time += elapsed_time;\n\n while (unprocessed_time >= delta_time) {\n input_update();\n glfwPollEvents();\n\n if (input_was_key_pressed(KEY_ESCAPE)) {\n glfwSetWindowShouldClose(window, true);\n }\n\n script_update(delta_time);\n unprocessed_time -= delta_time;\n }\n \n graphics_begin_frame();\n \n script_draw();\n \n graphics_end_frame();\n\n glfwSwapBuffers(window);\n }\n\n script_shutdown();\n\n glfwTerminate();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: nadavs@google.com <Nadav Samet>\n\n#ifndef RPCZ_BASE_H\n#define RPCZ_BASE_H\n\n#include \"google\/protobuf\/stubs\/common.h\"\n\nnamespace rpcz {\nusing google::protobuf::scoped_ptr; \nusing google::protobuf::uint64;\nusing google::protobuf::int64;\n\n\/\/ A macro to disallow the copy constructor and operator= functions\n\/\/ This should be used in the private: declarations for a class\n#define DISALLOW_COPY_AND_ASSIGN(TypeName) \\\n TypeName(const TypeName&); \\\n void operator=(const TypeName&)\n\n\/\/ Deletes each pointer in the range [begin, end)\ntemplate<typename IteratorType>\nvoid delete_container_pointers(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete *i;\n }\n}\n\n\/\/ For each item in the range [begin, end), delete item->first and item->second.\ntemplate<typename IteratorType>\nvoid delete_container_pair_pointers(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete i->first;\n delete i->second;\n }\n}\n\n\/\/ For each item in the range [begin, end), delete item->second.\ntemplate<typename IteratorType>\nvoid delete_container_second_pointer(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete i->second;\n }\n}\n} \/\/ namespace rpcz\n#endif\n<commit_msg>Also need to #undef NO_ERROR here in order to build successfully on Windows<commit_after>\/\/ Copyright 2011 Google Inc. All Rights Reserved.\n\/\/ \n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/ \n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/ \n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/\n\/\/ Author: nadavs@google.com <Nadav Samet>\n\n#ifndef RPCZ_BASE_H\n#define RPCZ_BASE_H\n\n#include \"google\/protobuf\/stubs\/common.h\"\n\n#ifdef WIN32\n\/\/ winerror.h contains #define NO_ERROR 0 \n#undef NO_ERROR\n#endif\n\nnamespace rpcz {\nusing google::protobuf::scoped_ptr; \nusing google::protobuf::uint64;\nusing google::protobuf::int64;\n\n\/\/ A macro to disallow the copy constructor and operator= functions\n\/\/ This should be used in the private: declarations for a class\n#define DISALLOW_COPY_AND_ASSIGN(TypeName) \\\n TypeName(const TypeName&); \\\n void operator=(const TypeName&)\n\n\/\/ Deletes each pointer in the range [begin, end)\ntemplate<typename IteratorType>\nvoid delete_container_pointers(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete *i;\n }\n}\n\n\/\/ For each item in the range [begin, end), delete item->first and item->second.\ntemplate<typename IteratorType>\nvoid delete_container_pair_pointers(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete i->first;\n delete i->second;\n }\n}\n\n\/\/ For each item in the range [begin, end), delete item->second.\ntemplate<typename IteratorType>\nvoid delete_container_second_pointer(const IteratorType& begin,\n const IteratorType& end) {\n for (IteratorType i = begin; i != end; ++i) {\n delete i->second;\n }\n}\n} \/\/ namespace rpcz\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"PDL.h\"\n#include \"SDL.h\"\n#include \"SDL_image.h\"\n#include \"chipmunk\/chipmunk.h\"\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst float FRAMES_PER_SECOND = 60.0;\n\nconst int SCREEN_WIDTH = 320;\nconst int SCREEN_HEIGHT = 480;\nconst int PADDING = 20;\n\nconst int GRAVITY = 600; \/\/ gravity strength\n\n\/\/ making these global because I'm lazy\nSDL_Surface *screen;\nSDL_Surface *ball;\n\nvoid updateShape(void*, void*);\nvoid defineBorders(cpSpace*);\n\nint main(int argc, char* argv[]) {\n bool in_loop = true;\n float xForce; \n float yForce;\n\n \/\/ create the file path to the ball image\n char* app_dir;\n PDL_GetCallingPath(app_dir, 256);\n string ball_path(app_dir);\n ball_path.append(\"assets\/ball.gif\");\n delete app_dir;\n\n \/\/ SDL setup\n SDL_Init(SDL_INIT_VIDEO | SDL_INIT_JOYSTICK);\n screen = SDL_SetVideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0);\n if (screen == NULL) return -1;\n SDL_Event event;\n SDL_Joystick *joystick = SDL_JoystickOpen(0);\n ball = IMG_Load(ball_path.c_str());\n \n \/\/ chipmunk setup\n cpSpace *space;\n cpBody *body;\n \n cpInitChipmunk();\n space = cpSpaceNew();\n space->iterations = 10;\n space->elasticIterations = 10;\n space->gravity = cpv(0, GRAVITY);\n \n defineBorders(space);\n \n \/\/ gameloop\n while (in_loop) {\n \/\/ get data from the accelerometer\n xForce = (float) SDL_JoystickGetAxis(joystick, 0) \/ 32768.0; \n yForce = (float) SDL_JoystickGetAxis(joystick, 1) \/ 32768.0;\n \n space->gravity = cpv(xForce * GRAVITY, yForce * GRAVITY);\n \n \/\/ capture the events and send the relevent tap events to the game scene\n while (SDL_PollEvent(&event)) {\n if (event.type == SDL_QUIT)\n in_loop = false;\n \n else if (event.type == SDL_MOUSEBUTTONDOWN) {\n if ((event.motion.x > PADDING && event.motion.x < SCREEN_WIDTH - PADDING) &&\n (event.motion.y > PADDING && event.motion.y < SCREEN_HEIGHT - PADDING)) {\n body = cpBodyNew(10.0f, INFINITY);\n body->p = cpv(event.motion.x, event.motion.y);\n cpSpaceAddBody(space, body);\n \n cpShape *shape = cpSpaceAddShape(space, cpCircleShapeNew(body, 20.0, cpvzero));\n shape->e = 0.3f;\n shape->u = 0.1f;\n }\n }\n }\n\n \/\/ clear the screen\n SDL_FillRect(SDL_GetVideoSurface(), NULL, 0);\n\n \/\/ recalculate the physics objects\n cpSpaceStep(space, 1.0f\/FRAMES_PER_SECOND);\n cpSpaceHashEach(space->activeShapes, &updateShape, NULL);\n \n \/\/ update the display\n SDL_Flip(screen);\n }\n \n \/\/ shutdown Chipmunk\n cpSpaceFreeChildren(space);\n cpSpaceFree(space);\n\n \/\/ shutdown SDL\n SDL_FreeSurface(ball);\n PDL_Quit();\n SDL_Quit();\n \n return 0;\n}\n\n\n\/\/ update a shape's visual representation\nvoid updateShape(void *ptr, void* unused) {\n cpShape *shape = (cpShape*)ptr;\n \n \/\/ make sure the shape is constructed correctly\n if(shape == NULL || shape->body == NULL) {\n return;\n }\n \n \/\/ Use a temporary rectangle to pass our x and y to the offsets when blitting\n SDL_Rect offset;\n offset.x = shape->body->p.x;\n offset.y = shape->body->p.y;\n \n SDL_BlitSurface(ball, NULL, screen, &offset);\n}\n\n\n\/\/ create borders around the screen\nvoid defineBorders(cpSpace *space) {\n cpBody *body = cpBodyNew(INFINITY, INFINITY);\n float border_elasticity = 0.3f;\n float border_friction = 1.0f;\n \n \/\/ top border\n cpShape *border_top = cpSegmentShapeNew(body, cpv(-PADDING, -PADDING), cpv(SCREEN_WIDTH - PADDING, -PADDING), 1.0f);\n border_top->e = border_elasticity; border_top->u = border_friction;\n cpSpaceAddStaticShape(space, border_top);\n \n \/\/ right border\n cpShape *border_right = cpSegmentShapeNew(body, cpv(SCREEN_WIDTH - PADDING, -PADDING), cpv(SCREEN_WIDTH - PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_right->e = border_elasticity; border_right->u = border_friction;\n cpSpaceAddStaticShape(space, border_right);\n \n \/\/ bottom border\n cpShape *border_bottom = cpSegmentShapeNew(body, cpv(-PADDING, SCREEN_HEIGHT - PADDING), cpv(SCREEN_WIDTH - PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_bottom->e = border_elasticity; border_bottom->u = border_friction;\n cpSpaceAddStaticShape(space, border_bottom);\n \n \/\/ left border\n cpShape *border_left = cpSegmentShapeNew(body, cpv(-PADDING, -PADDING), cpv(-PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_left->e = border_elasticity; border_left->u = border_friction;\n cpSpaceAddStaticShape(space, border_left);\n}<commit_msg>Modified the asset path<commit_after>#include \"PDL.h\"\n#include \"SDL.h\"\n#include \"SDL_image.h\"\n#include \"chipmunk\/chipmunk.h\"\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nconst float FRAMES_PER_SECOND = 60.0;\n\nconst int SCREEN_WIDTH = 320;\nconst int SCREEN_HEIGHT = 480;\nconst int PADDING = 20;\n\nconst int GRAVITY = 600; \/\/ gravity strength\n\n\/\/ making these global because I'm lazy\nSDL_Surface *screen;\nSDL_Surface *ball;\n\nvoid updateShape(void*, void*);\nvoid defineBorders(cpSpace*);\n\nint main(int argc, char* argv[]) {\n bool in_loop = true;\n float xForce; \n float yForce;\n\n \/\/ create the file path to the ball image\n \/\/ Note: only get the PATH from PDL_GetCallingPath if on the device. When building\n \/\/ from the desktop just hardcode the ball_path variable. PDL_GetCallingPath\n \/\/ only seems to work on the device.\n char app_dir[255];\n int ret = PDL_GetCallingPath(app_dir, 256);\n string ball_path(app_dir);\n ball_path.append(\"assets\/ball.gif\");\n\n \/\/ SDL setup\n SDL_Init(SDL_INIT_VIDEO | SDL_INIT_JOYSTICK);\n screen = SDL_SetVideoMode(SCREEN_WIDTH, SCREEN_HEIGHT, 32, 0);\n if (screen == NULL) return -1;\n SDL_Event event;\n SDL_Joystick *joystick = SDL_JoystickOpen(0);\n ball = IMG_Load(ball_path.c_str());\n \n \/\/ chipmunk setup\n cpSpace *space;\n cpBody *body;\n \n cpInitChipmunk();\n space = cpSpaceNew();\n space->iterations = 10;\n space->elasticIterations = 10;\n space->gravity = cpv(0, GRAVITY);\n \n defineBorders(space);\n \n \/\/ gameloop\n while (in_loop) {\n \/\/ get data from the accelerometer\n xForce = (float) SDL_JoystickGetAxis(joystick, 0) \/ 32768.0; \n yForce = (float) SDL_JoystickGetAxis(joystick, 1) \/ 32768.0;\n \n space->gravity = cpv(xForce * GRAVITY, yForce * GRAVITY);\n \n \/\/ capture the events and send the relevent tap events to the game scene\n while (SDL_PollEvent(&event)) {\n if (event.type == SDL_QUIT)\n in_loop = false;\n \n else if (event.type == SDL_MOUSEBUTTONDOWN) {\n if ((event.motion.x > PADDING && event.motion.x < SCREEN_WIDTH - PADDING) &&\n (event.motion.y > PADDING && event.motion.y < SCREEN_HEIGHT - PADDING)) {\n body = cpBodyNew(10.0f, INFINITY);\n body->p = cpv(event.motion.x, event.motion.y);\n cpSpaceAddBody(space, body);\n \n cpShape *shape = cpSpaceAddShape(space, cpCircleShapeNew(body, 20.0, cpvzero));\n shape->e = 0.3f;\n shape->u = 0.1f;\n }\n }\n }\n\n \/\/ clear the screen\n SDL_FillRect(SDL_GetVideoSurface(), NULL, 0);\n\n \/\/ recalculate the physics objects\n cpSpaceStep(space, 1.0f\/FRAMES_PER_SECOND);\n cpSpaceHashEach(space->activeShapes, &updateShape, NULL);\n \n \/\/ update the display\n SDL_Flip(screen);\n }\n \n \/\/ shutdown Chipmunk\n cpSpaceFreeChildren(space);\n cpSpaceFree(space);\n\n \/\/ shutdown SDL\n SDL_FreeSurface(ball);\n PDL_Quit();\n SDL_Quit();\n \n return 0;\n}\n\n\n\/\/ update a shape's visual representation\nvoid updateShape(void *ptr, void* unused) {\n cpShape *shape = (cpShape*)ptr;\n \n \/\/ make sure the shape is constructed correctly\n if(shape == NULL || shape->body == NULL) {\n return;\n }\n \n \/\/ Use a temporary rectangle to pass our x and y to the offsets when blitting\n SDL_Rect offset;\n offset.x = shape->body->p.x;\n offset.y = shape->body->p.y;\n \n SDL_BlitSurface(ball, NULL, screen, &offset);\n}\n\n\n\/\/ create borders around the screen\nvoid defineBorders(cpSpace *space) {\n cpBody *body = cpBodyNew(INFINITY, INFINITY);\n float border_elasticity = 0.3f;\n float border_friction = 1.0f;\n \n \/\/ top border\n cpShape *border_top = cpSegmentShapeNew(body, cpv(-PADDING, -PADDING), cpv(SCREEN_WIDTH - PADDING, -PADDING), 1.0f);\n border_top->e = border_elasticity; border_top->u = border_friction;\n cpSpaceAddStaticShape(space, border_top);\n \n \/\/ right border\n cpShape *border_right = cpSegmentShapeNew(body, cpv(SCREEN_WIDTH - PADDING, -PADDING), cpv(SCREEN_WIDTH - PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_right->e = border_elasticity; border_right->u = border_friction;\n cpSpaceAddStaticShape(space, border_right);\n \n \/\/ bottom border\n cpShape *border_bottom = cpSegmentShapeNew(body, cpv(-PADDING, SCREEN_HEIGHT - PADDING), cpv(SCREEN_WIDTH - PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_bottom->e = border_elasticity; border_bottom->u = border_friction;\n cpSpaceAddStaticShape(space, border_bottom);\n \n \/\/ left border\n cpShape *border_left = cpSegmentShapeNew(body, cpv(-PADDING, -PADDING), cpv(-PADDING, SCREEN_HEIGHT - PADDING), 1.0f);\n border_left->e = border_elasticity; border_left->u = border_friction;\n cpSpaceAddStaticShape(space, border_left);\n}<|endoftext|>"} {"text":"<commit_before>\/\/\n\/\/ Created by salmon on 17-10-11.\n\/\/\n\n#include \"simpla\/SIMPLA_config.h\"\n\n#include <simpla\/application\/SPInit.h>\n#include <simpla\/geometry\/BoxUtilities.h>\n#include <simpla\/geometry\/Cube.h>\n#include <simpla\/geometry\/csCartesian.h>\n#include <simpla\/mesh\/CoRectMesh.h>\n#include <simpla\/mesh\/EBMesh.h>\n#include <simpla\/mesh\/RectMesh.h>\n#include <simpla\/predefine\/engine\/SimpleTimeIntegrator.h>\n#include <simpla\/predefine\/physics\/Maxwell.h>\n#include <simpla\/predefine\/physics\/PML.h>\n#include <simpla\/scheme\/FVM.h>\n#include <simpla\/utilities\/Logo.h>\n#include <simpla\/utilities\/parse_command_line.h>\nnamespace simpla {\nusing SimpleMaxwell = domain::Maxwell<engine::Domain<geometry::csCartesian, scheme::FVM, mesh::CoRectMesh>>;\nusing SimplePML = domain::PML<engine::Domain<geometry::csCartesian, scheme::FVM, mesh::CoRectMesh>>;\n\n} \/\/ namespace simpla {\n\nusing namespace simpla;\nusing namespace simpla::engine;\n\nint main(int argc, char **argv) {\n size_type num_of_step = 10;\n size_type checkpoint_interval = 1;\n simpla::parse_cmd_line( \/\/\n argc, argv, [&](std::string const &opt, std::string const &value) -> int {\n if (false) {\n } else if (opt == \"n\") {\n num_of_step = static_cast<size_type>(std::atoi(value.c_str()));\n } else if (opt == \"checkpoint\") {\n checkpoint_interval = static_cast<size_type>(std::atoi(value.c_str()));\n }\n return CONTINUE;\n });\n\n simpla::Initialize(argc, argv);\n auto scenario = SimpleTimeIntegrator::New();\n scenario->SetName(\"MultiDomain\");\n\n scenario->GetAtlas()->SetOrigin({0, 0, 0});\n scenario->GetAtlas()->SetGridWidth({1, 1, 1});\n scenario->GetAtlas()->SetPeriodicDimensions({1, 1, 1});\n\n scenario->GetAtlas()->NewChart<simpla::geometry::csCartesian>();\n\n auto center = scenario->NewDomain<SimpleMaxwell>(\"Center\");\n center->SetBoundary(geometry::Cube::New(box_type{{-15, -25, -20}, {15, 25, 20}}));\n center->PostInitialCondition.Connect([=](DomainBase *self, Real time_now) {\n if (auto d = dynamic_cast<SimpleMaxwell *>(self)) {\n d->B = [&](point_type const &x) {\n\n return point_type{std::sin(2 * PI * x[1] \/ 50) * std::sin(2 * PI * x[2] \/ 40),\n std::sin(2 * PI * x[0] \/ 30) * std::sin(2 * PI * x[2] \/ 40),\n std::sin(2 * PI * x[0] \/ 30) * std::sin(2 * PI * x[1] \/ 50)};\n };\n }\n });\n \/\/ scenario->NewDomain<SimpleMaxwell>(\"boundary0\")\n \/\/ ->SetBoundary(geometry::Cube::New(box_type{{-20, -25, -20}, {-15, 25, 20}}));\n \/\/ scenario->NewDomain<SimpleMaxwell>(\"boundary1\")\n \/\/ ->SetBoundary(geometry::Cube::New(box_type{{15, -25, -20}, {20, 25, 20}}));\n auto pml = scenario->NewDomain<SimplePML>(\"PML\");\n pml->SetBoundingBox(box_type{{-20, -25, -20}, {20, 25, 20}});\n pml->SetCenterBox(center->GetBoundingBox());\n\n scenario->SetTimeEnd(1.0e-8);\n scenario->SetMaxStep(num_of_step);\n scenario->SetUp();\n\n if (auto atlas = scenario->GetAtlas()) {\n scenario->GetAtlas()->Decompose({3, 3, 3});\n auto c_box = center->GetBoundingBox();\n auto box_list = geometry::HaloBoxDecompose(\n atlas->GetIndexBox(),\n std::make_tuple(std::get<1>(atlas->GetChart()->invert_local_coordinates(std::get<0>(c_box))),\n std::get<1>(atlas->GetChart()->invert_local_coordinates(std::get<1>(c_box)))));\n for (auto const &b : box_list) { atlas->AddPatch(b); }\n }\n\n scenario->ConfigureAttribute<size_type>(\"E\", \"CheckPoint\", checkpoint_interval);\n scenario->ConfigureAttribute<size_type>(\"B\", \"CheckPoint\", checkpoint_interval);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a0\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a1\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a2\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s0\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s1\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s2\", \"CheckPoint\", 1);\n VERBOSE << \"Scenario: \" << *scenario->Serialize();\n TheStart();\n scenario->Run();\n TheEnd();\n\n scenario->TearDown();\n simpla::Finalize();\n}<commit_msg>MultiDomain success;PML fail<commit_after>\/\/\n\/\/ Created by salmon on 17-10-11.\n\/\/\n\n#include \"simpla\/SIMPLA_config.h\"\n\n#include <simpla\/application\/SPInit.h>\n#include <simpla\/geometry\/BoxUtilities.h>\n#include <simpla\/geometry\/Cube.h>\n#include <simpla\/geometry\/csCartesian.h>\n#include <simpla\/mesh\/CoRectMesh.h>\n#include <simpla\/mesh\/EBMesh.h>\n#include <simpla\/mesh\/RectMesh.h>\n#include <simpla\/predefine\/engine\/SimpleTimeIntegrator.h>\n#include <simpla\/predefine\/physics\/Maxwell.h>\n#include <simpla\/predefine\/physics\/PML.h>\n#include <simpla\/scheme\/FVM.h>\n#include <simpla\/utilities\/Logo.h>\n#include <simpla\/utilities\/parse_command_line.h>\nnamespace simpla {\nusing SimpleMaxwell = domain::Maxwell<engine::Domain<geometry::csCartesian, scheme::FVM, mesh::CoRectMesh>>;\nusing SimplePML = domain::PML<engine::Domain<geometry::csCartesian, scheme::FVM, mesh::CoRectMesh>>;\n\n} \/\/ namespace simpla {\n\nusing namespace simpla;\nusing namespace simpla::engine;\n\nint main(int argc, char **argv) {\n size_type num_of_step = 10;\n size_type checkpoint_interval = 1;\n simpla::parse_cmd_line( \/\/\n argc, argv, [&](std::string const &opt, std::string const &value) -> int {\n if (false) {\n } else if (opt == \"n\") {\n num_of_step = static_cast<size_type>(std::atoi(value.c_str()));\n } else if (opt == \"checkpoint\") {\n checkpoint_interval = static_cast<size_type>(std::atoi(value.c_str()));\n }\n return CONTINUE;\n });\n\n simpla::Initialize(argc, argv);\n auto scenario = SimpleTimeIntegrator::New();\n scenario->SetName(\"MultiDomain\");\n\n scenario->GetAtlas()->SetOrigin({0, 0, 0});\n scenario->GetAtlas()->SetGridWidth({1, 1, 1});\n scenario->GetAtlas()->SetPeriodicDimensions({1, 1, 1});\n\n scenario->GetAtlas()->NewChart<simpla::geometry::csCartesian>();\n\n auto center = scenario->NewDomain<SimpleMaxwell>(\"Center\");\n center->SetBoundary(geometry::Cube::New(box_type{{-15, -25, -20}, {15, 25, 20}}));\n center->PostInitialCondition.Connect([=](DomainBase *self, Real time_now) {\n if (auto d = dynamic_cast<SimpleMaxwell *>(self)) {\n d->B = [&](point_type const &x) {\n\n return point_type{std::sin(2 * PI * x[1] \/ 50) * std::sin(2 * PI * x[2] \/ 40),\n std::sin(2 * PI * x[0] \/ 30) * std::sin(2 * PI * x[2] \/ 40),\n std::sin(2 * PI * x[0] \/ 30) * std::sin(2 * PI * x[1] \/ 50)};\n };\n }\n });\n scenario->NewDomain<SimpleMaxwell>(\"boundary0\")\n ->SetBoundary(geometry::Cube::New(box_type{{-20, -25, -20}, {-15, 25, 20}}));\n scenario->NewDomain<SimpleMaxwell>(\"boundary1\")\n ->SetBoundary(geometry::Cube::New(box_type{{15, -25, -20}, {20, 25, 20}}));\n\/\/ auto pml = scenario->NewDomain<SimplePML>(\"PML\");\n\/\/ pml->SetBoundingBox(box_type{{-20, -25, -20}, {20, 25, 20}});\n\/\/ pml->SetCenterBox(center->GetBoundingBox());\n\n scenario->SetTimeEnd(1.0e-8);\n scenario->SetMaxStep(num_of_step);\n scenario->SetUp();\n\n if (auto atlas = scenario->GetAtlas()) {\n scenario->GetAtlas()->Decompose({3, 3, 3});\n auto c_box = center->GetBoundingBox();\n auto box_list = geometry::HaloBoxDecompose(\n atlas->GetIndexBox(),\n std::make_tuple(std::get<1>(atlas->GetChart()->invert_local_coordinates(std::get<0>(c_box))),\n std::get<1>(atlas->GetChart()->invert_local_coordinates(std::get<1>(c_box)))));\n for (auto const &b : box_list) { atlas->AddPatch(b); }\n }\n\n scenario->ConfigureAttribute<size_type>(\"E\", \"CheckPoint\", checkpoint_interval);\n scenario->ConfigureAttribute<size_type>(\"B\", \"CheckPoint\", checkpoint_interval);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a0\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a1\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"a2\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s0\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s1\", \"CheckPoint\", 1);\n \/\/ scenario->ConfigureAttribute<size_type>(\"s2\", \"CheckPoint\", 1);\n VERBOSE << \"Scenario: \" << *scenario->Serialize();\n TheStart();\n scenario->Run();\n TheEnd();\n\n scenario->TearDown();\n simpla::Finalize();\n}<|endoftext|>"} {"text":"<commit_before>\/\/Author: Julian Yi\r\n\/\/Date Started: 14 July 2017, Friday.\r\n\/\/Purpose: This is a project to create a working chess engine and gui using C++.\r\n\/\/File: This is the main file.\r\n#include <iostream>\r\n#include \"board.h\"\r\n#include \"pawn.h\"\r\n#include \"knight.h\"\r\n#include \"bishop.h\"\r\n#include \"coord.h\"\r\n#include \"ui.h\"\r\n#include \"BearLibTerminal.h\"\r\n\r\nvoid handleInput(board& Chessboard);\r\n\r\nint main()\r\n{\r\n\t\/\/ Initialize board.\r\n\tauto Chessboard = std::make_shared<board>();\r\n\tChessboard->initializeBoard();\r\n\r\n\tfor (int i = 0; i < 8; i++) {\r\n\t\tChessboard->placePiece(PieceType::Pawn, {i, 1}, TeamColor::White);\r\n\t}\r\n\r\n\tChessboard->placePiece(PieceType::Rook, {0, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Rook, {7, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Knight, {1, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Knight, {6, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Bishop, {2, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Bishop, {5, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Queen, {3, 0}, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::King, { 4,0 }, TeamColor::White);\r\n\r\n\tfor (int i = 0; i < 8; i++) {\r\n\t\tChessboard->placePiece(PieceType::Pawn, {i, 6}, TeamColor::Black);\r\n\t}\r\n\tChessboard->placePiece(PieceType::Rook, {0, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Rook, {7, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Knight, {1, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Knight, {6, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Bishop, {2, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Bishop, {5, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::Queen, {3, 7}, TeamColor::Black);\r\n\tChessboard->placePiece(PieceType::King, { 4,7 }, TeamColor::Black);\r\n\r\n\tChessboard->placePiece(PieceType::Pawn, { 2,3 }, TeamColor::Black);\r\n\r\n\r\n\tChessboard->movePiece({ 1,1 }, { 1,2 }); \/\/success\r\n\tChessboard->movePiece({ 1,2 }, { 2,3 }); \/\/success\r\n\tChessboard->movePiece({ 2,3 }, { 3,3 }); \/\/fail\r\n\r\n\tChessboard->placePiece(PieceType::Pawn, { 3,4 }, TeamColor::Black);\r\n\tChessboard->movePiece({ 3,4 }, { 2,3 }); \/\/success\r\n\r\n\tChessboard->placePiece(PieceType::Pawn, { 1,2 }, TeamColor::White);\r\n\tChessboard->movePiece({ 2,3 }, { 1,2 });\r\n\t\/\/Chessboard->movePiece({ 1,2 }, { 0,1 });\r\n\t\/\/Chessboard->movePiece({ 0,1 }, { 1,0 });\r\n\t\/\/Chessboard->movePiece({ 1,1 }, { 1,0 });\r\n\r\n\r\n\t\/*\r\n\tit all works\r\n\t\/\/ Test an attack.\r\n\t\/\/ Expected Output : success, knight is destroyed\r\n\tChessboard->movePiece({3, 4}, {1, 2});\r\n\r\n\t\/\/ Test creating a piece into the occupied coordinate (same color)\r\n\t\/\/ Expected Output : failure\r\n\tChessboard->placePiece(PieceType::Rook, { 3,3 }, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Pawn, { 3,3 }, TeamColor::White);\r\n\r\n\t\/\/ Test creating a piece into the occupied coordinate (different color)\r\n\t\/\/ Expected Output : failure\r\n\tChessboard->deletePiece({ 3,3 });\r\n\tChessboard->placePiece(PieceType::Pawn, { 3,3 }, TeamColor::White);\r\n\tChessboard->placePiece(PieceType::Bishop, { 3,3 }, TeamColor::Black);\r\n\r\n\t\/\/ Test Moving a piece into the occupied coordinate (same color)\r\n\t\/\/ Expected Output : failure\r\n\tChessboard->placePiece(PieceType::Pawn, { 3,2 }, TeamColor::White);\r\n\tChessboard->movePiece({ 3,2 }, { 3,3 });\r\n\t*\/\r\n\r\n\t\/\/ Test Pawn's valid moves\r\n\r\n\r\n\r\n\r\n\r\n\t\/\/ Open the terminal. Since no terminal_set() method is called,\r\n\t\/\/ the terminal will use default settings.\r\n\tterminal_open();\r\n\r\n\t\/\/ Font setup. .\/font\/FSEX300.ttf\r\n\tterminal_set(\"window: title='Chess', size='46x24'; font: .\/font\/FSEX300.ttf, size=32x32\");\r\n\r\n\t\/\/ Palette.\r\n\tterminal_set(\"palette: whitepiece=#C2CCCF, blackpiece=#4D483C, whitetile=#02171F, blacktile=#000000;\");\r\n\r\n\tterminal_set(\r\n\t \"input:\"\r\n\t \"cursor-symbol = 0x1F,\"\r\n\t \"cursor-blink-rate = 500,\"\r\n\t \"precise-mouse = false,\"\r\n\t \"mouse-cursor = true,\"\r\n\t \"filter=[keyboard, mouse];\"\r\n\t);\r\n\r\n\t\/\/ Print intro text.\r\n\tterminal_print(1, 1, \"Chess Engine\");\r\n\tterminal_print(4, 2, \"by Julian Yi, Sean Brock, and Simon Kim\");\r\n\tterminal_print(1, 4, \"Press Enter to start...\");\r\n\tterminal_refresh();\r\n\r\n\t\/\/ Create UI manager\r\n\tui UIManager;\r\n\t\/\/ Register the chessboard in a board element.\r\n\tUIManager.addElement(std::make_shared<boardElement>(Chessboard), { 2, 5 });\r\n\r\n\t\/\/roughdraft until I figure out a better way to do this\r\n\tint mouseClicks = 0;\r\n\tint xCursor = 0;\r\n\tint yCursor = 0;\r\n\tcoord current = {0, 0};\r\n\tcoord next = {0, 0};\r\n\tbool clicked = false;\r\n\r\n\tbool running = true;\r\n\tcoord boardOffset{ 2, 5 };\r\n\r\n\twhile (running) {\r\n \t\t\/\/ Check for input. termnial_read() is blocking, meaning the\r\n\t\t\/\/ program will wait until it reads a key press.\r\n\t\tauto key = terminal_read();\r\n\t\t\/\/ Reset the terminal to blank state.\r\n\t\tterminal_clear();\r\n\r\n\t\t\/\/ Text goes on layer 3.\r\n\t\tterminal_layer(3);\r\n\r\n\t\t\/\/ Print instructions.\r\n\t\t\/\/terminal_print(1, 1, \"Press Enter to start...\");\r\n\r\n\t\t\/\/ Handle key presses.\r\n\t\tswitch (key) {\r\n\t\t\tcase TK_CLOSE:\r\n\t\t\t\trunning = false;\r\n\t\t\t\tbreak;\r\n\t\t\tcase TK_ESCAPE:\r\n\t\t\t\trunning = false;\r\n\t\t\t\tbreak;\r\n\t\t\tcase TK_ENTER:\r\n\t\t\t\tbreak;\r\n\t\t\tcase TK_MOUSE_MOVE:\r\n\t\t\t\txCursor = terminal_state(TK_MOUSE_X);\r\n\t\t \t\tyCursor = terminal_state(TK_MOUSE_Y);\r\n\t\t\t\tbreak;\r\n\t\t\tcase TK_MOUSE_LEFT:\r\n\t\t\t\tmouseClicks++; \/\/amount of time something is clicked\r\n\r\n\t\t\t\t\/\/if the clicked square has something then set the object clicked flag to true and set the current coordinate\r\n\t\t\t\tif (Chessboard->isOccupied({ (xCursor - boardOffset.x), (yCursor - boardOffset.y) }) == true && (mouseClicks == 1))\r\n\t\t\t\t{\r\n\t\t\t\t\tcurrent = { (xCursor - boardOffset.x), (yCursor - boardOffset.y) };\r\n\t\t\t\t\tstd::cout << \"first click\" << current.x << \",\" << current.y << std::endl;\r\n\t\t\t\t\tclicked = true;\r\n\t\t\t\t\tstd::cout << mouseClicks;\r\n\t\t\t\t}\r\n\t\t\t\t\/\/if clicked flag is false and there is nothing on the board don't do anything\r\n\t\t\t\telse if(Chessboard->isOccupied({ (xCursor - boardOffset.x), (yCursor - boardOffset.y) }) == false && clicked == false)\r\n\t\t\t\t{\r\n\t\t\t\t\tcurrent = { -1, -1 };\r\n\t\t\t\t\tstd::cout << \"nothing was clicked\" << std::endl;\r\n\t\t\t\t\tmouseClicks = 0;\r\n\t\t\t\t}\r\n\t\t\t\t\/\/mouseClicks has to be higher than 1 to perform the move function. clicked flag also has to be true\r\n\t\t\t\t\/\/handles move\r\n\t\t\t\tif(clicked == true && mouseClicks > 1)\r\n\t\t\t\t{\r\n\t\t\t\t\t\/\/do something with that piece\r\n\t\t\t\t\tnext = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\r\n\t\t\t\t\tstd::cout << \"second click\" << next.x << \",\" << next.y << std::endl;\r\n\t\t\t\t\tChessboard->movePiece(current, next);\r\n\t\t\t\t\tclicked = false;\r\n\t\t\t\t\tstd::cout << mouseClicks;\r\n\t\t\t\t\tmouseClicks = 0;\r\n\t\t\t\t}\r\n\t\t\t\tbreak;\r\n\t\t\tdefault:\r\n\t\t\t\tterminal_print(1, 2, \"The key pressed has no function.\");\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\t\/\/ Draw board\r\n\t\tUIManager.draw();\r\n\r\n\t\tif((2 <= xCursor && xCursor <=9) && (5 <= yCursor && yCursor <= 12))\r\n\t\t{\r\n\t\t\tint select = 0x02C7;\r\n\t\t\tterminal_layer(2);\r\n\t\t\tterminal_color(color_from_name(\"green\"));\r\n\t\t\tterminal_put(xCursor, yCursor, select);\r\n\t\t}\r\n\r\n\t\t\t \t\/\/TK_MOUSE_CLICK\r\n\t\t\/\/set the flag\r\n\t\t\/\/flag true then call something.\r\n\t\t\/*\r\n\t\tif (key == TK_MOUSE_LEFT)\r\n\t\t{\r\n\t\t\tint mouseClicks = terminal_state(TK_MOUSE_LEFT);\r\n\t\t\tif(mouseClicks == 1)\r\n\t\t\t{\r\n\t\t\t\t\/\/select the piece\r\n\t\t\t\tcurrent = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\r\n\t\t\t\tstd::cout << \"first click\" << current.x << \",\" << current.y << std::endl;\r\n\t\t\t}\r\n\t\t\telse if(mouseClicks == 2)\r\n\t\t\t{\r\n\t\t\t\t\/\/do something with that piece\r\n\t\t\t\tnext = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\r\n\t\t\t\tstd::cout << \"second click\" << next.x << \",\" << next.y << std::endl;\r\n\t\t\t\tChessboard->movePiece(current, next);\r\n\t\t\t}\r\n\t\t}\r\n\t\t*\/\r\n\r\n\r\n\t\t\/\/ Commit the buffer and draw it.\r\n\t\t\/\/ Move to ui manager eventually.\r\n\t\tterminal_refresh();\r\n\r\n\t}\r\n\r\n\t\/\/ We're done here.\r\n\tterminal_close();\r\n\r\n\treturn 0;\r\n}\r\n<commit_msg>CRLF to LF<commit_after>\/\/Author: Julian Yi\n\/\/Date Started: 14 July 2017, Friday.\n\/\/Purpose: This is a project to create a working chess engine and gui using C++.\n\/\/File: This is the main file.\n#include <iostream>\n#include \"board.h\"\n#include \"pawn.h\"\n#include \"knight.h\"\n#include \"bishop.h\"\n#include \"coord.h\"\n#include \"ui.h\"\n#include \"BearLibTerminal.h\"\n\nvoid handleInput(board& Chessboard);\n\nint main()\n{\n\t\/\/ Initialize board.\n\tauto Chessboard = std::make_shared<board>();\n\tChessboard->initializeBoard();\n\n\tfor (int i = 0; i < 8; i++) {\n\t\tChessboard->placePiece(PieceType::Pawn, {i, 1}, TeamColor::White);\n\t}\n\n\tChessboard->placePiece(PieceType::Rook, {0, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Rook, {7, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Knight, {1, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Knight, {6, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Bishop, {2, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Bishop, {5, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::Queen, {3, 0}, TeamColor::White);\n\tChessboard->placePiece(PieceType::King, { 4,0 }, TeamColor::White);\n\n\tfor (int i = 0; i < 8; i++) {\n\t\tChessboard->placePiece(PieceType::Pawn, {i, 6}, TeamColor::Black);\n\t}\n\tChessboard->placePiece(PieceType::Rook, {0, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Rook, {7, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Knight, {1, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Knight, {6, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Bishop, {2, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Bishop, {5, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::Queen, {3, 7}, TeamColor::Black);\n\tChessboard->placePiece(PieceType::King, { 4,7 }, TeamColor::Black);\n\n\tChessboard->placePiece(PieceType::Pawn, { 2,3 }, TeamColor::Black);\n\n\n\tChessboard->movePiece({ 1,1 }, { 1,2 }); \/\/success\n\tChessboard->movePiece({ 1,2 }, { 2,3 }); \/\/success\n\tChessboard->movePiece({ 2,3 }, { 3,3 }); \/\/fail\n\n\tChessboard->placePiece(PieceType::Pawn, { 3,4 }, TeamColor::Black);\n\tChessboard->movePiece({ 3,4 }, { 2,3 }); \/\/success\n\n\tChessboard->placePiece(PieceType::Pawn, { 1,2 }, TeamColor::White);\n\tChessboard->movePiece({ 2,3 }, { 1,2 });\n\t\/\/Chessboard->movePiece({ 1,2 }, { 0,1 });\n\t\/\/Chessboard->movePiece({ 0,1 }, { 1,0 });\n\t\/\/Chessboard->movePiece({ 1,1 }, { 1,0 });\n\n\n\t\/*\n\tit all works\n\t\/\/ Test an attack.\n\t\/\/ Expected Output : success, knight is destroyed\n\tChessboard->movePiece({3, 4}, {1, 2});\n\n\t\/\/ Test creating a piece into the occupied coordinate (same color)\n\t\/\/ Expected Output : failure\n\tChessboard->placePiece(PieceType::Rook, { 3,3 }, TeamColor::White);\n\tChessboard->placePiece(PieceType::Pawn, { 3,3 }, TeamColor::White);\n\n\t\/\/ Test creating a piece into the occupied coordinate (different color)\n\t\/\/ Expected Output : failure\n\tChessboard->deletePiece({ 3,3 });\n\tChessboard->placePiece(PieceType::Pawn, { 3,3 }, TeamColor::White);\n\tChessboard->placePiece(PieceType::Bishop, { 3,3 }, TeamColor::Black);\n\n\t\/\/ Test Moving a piece into the occupied coordinate (same color)\n\t\/\/ Expected Output : failure\n\tChessboard->placePiece(PieceType::Pawn, { 3,2 }, TeamColor::White);\n\tChessboard->movePiece({ 3,2 }, { 3,3 });\n\t*\/\n\n\t\/\/ Test Pawn's valid moves\n\n\n\n\n\n\t\/\/ Open the terminal. Since no terminal_set() method is called,\n\t\/\/ the terminal will use default settings.\n\tterminal_open();\n\n\t\/\/ Font setup. .\/font\/FSEX300.ttf\n\tterminal_set(\"window: title='Chess', size='46x24'; font: .\/font\/FSEX300.ttf, size=32x32\");\n\n\t\/\/ Palette.\n\tterminal_set(\"palette: whitepiece=#C2CCCF, blackpiece=#4D483C, whitetile=#02171F, blacktile=#000000;\");\n\n\tterminal_set(\n\t \"input:\"\n\t \"cursor-symbol = 0x1F,\"\n\t \"cursor-blink-rate = 500,\"\n\t \"precise-mouse = false,\"\n\t \"mouse-cursor = true,\"\n\t \"filter=[keyboard, mouse];\"\n\t);\n\n\t\/\/ Print intro text.\n\tterminal_print(1, 1, \"Chess Engine\");\n\tterminal_print(4, 2, \"by Julian Yi, Sean Brock, and Simon Kim\");\n\tterminal_print(1, 4, \"Press Enter to start...\");\n\tterminal_refresh();\n\n\t\/\/ Create UI manager\n\tui UIManager;\n\t\/\/ Register the chessboard in a board element.\n\tUIManager.addElement(std::make_shared<boardElement>(Chessboard), { 2, 5 });\n\n\t\/\/roughdraft until I figure out a better way to do this\n\tint mouseClicks = 0;\n\tint xCursor = 0;\n\tint yCursor = 0;\n\tcoord current = {0, 0};\n\tcoord next = {0, 0};\n\tbool clicked = false;\n\n\tbool running = true;\n\tcoord boardOffset{ 2, 5 };\n\n\twhile (running) {\n \t\t\/\/ Check for input. termnial_read() is blocking, meaning the\n\t\t\/\/ program will wait until it reads a key press.\n\t\tauto key = terminal_read();\n\t\t\/\/ Reset the terminal to blank state.\n\t\tterminal_clear();\n\n\t\t\/\/ Text goes on layer 3.\n\t\tterminal_layer(3);\n\n\t\t\/\/ Print instructions.\n\t\t\/\/terminal_print(1, 1, \"Press Enter to start...\");\n\n\t\t\/\/ Handle key presses.\n\t\tswitch (key) {\n\t\t\tcase TK_CLOSE:\n\t\t\t\trunning = false;\n\t\t\t\tbreak;\n\t\t\tcase TK_ESCAPE:\n\t\t\t\trunning = false;\n\t\t\t\tbreak;\n\t\t\tcase TK_ENTER:\n\t\t\t\tbreak;\n\t\t\tcase TK_MOUSE_MOVE:\n\t\t\t\txCursor = terminal_state(TK_MOUSE_X);\n\t\t \t\tyCursor = terminal_state(TK_MOUSE_Y);\n\t\t\t\tbreak;\n\t\t\tcase TK_MOUSE_LEFT:\n\t\t\t\tmouseClicks++; \/\/amount of time something is clicked\n\n\t\t\t\t\/\/if the clicked square has something then set the object clicked flag to true and set the current coordinate\n\t\t\t\tif (Chessboard->occupied({ (xCursor - boardOffset.x), (yCursor - boardOffset.y) }) == true && (mouseClicks == 1))\n\t\t\t\t{\n\t\t\t\t\tcurrent = { (xCursor - boardOffset.x), (yCursor - boardOffset.y) };\n\t\t\t\t\tstd::cout << \"first click\" << current.x << \",\" << current.y << std::endl;\n\t\t\t\t\tclicked = true;\n\t\t\t\t\tstd::cout << mouseClicks;\n\t\t\t\t}\n\t\t\t\t\/\/if clicked flag is false and there is nothing on the board don't do anything\n\t\t\t\telse if(Chessboard->occupied({ (xCursor - boardOffset.x), (yCursor - boardOffset.y) }) == false && clicked == false)\n\t\t\t\t{\n\t\t\t\t\tcurrent = { -1, -1 };\n\t\t\t\t\tstd::cout << \"nothing was clicked\" << std::endl;\n\t\t\t\t\tmouseClicks = 0;\n\t\t\t\t}\n\t\t\t\t\/\/mouseClicks has to be higher than 1 to perform the move function. clicked flag also has to be true\n\t\t\t\t\/\/handles move\n\t\t\t\tif(clicked == true && mouseClicks > 1)\n\t\t\t\t{\n\t\t\t\t\t\/\/do something with that piece\n\t\t\t\t\tnext = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\n\t\t\t\t\tstd::cout << \"second click\" << next.x << \",\" << next.y << std::endl;\n\t\t\t\t\tChessboard->movePiece(current, next);\n\t\t\t\t\tclicked = false;\n\t\t\t\t\tstd::cout << mouseClicks;\n\t\t\t\t\tmouseClicks = 0;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tterminal_print(1, 2, \"The key pressed has no function.\");\n\t\t\t\tbreak;\n\t\t}\n\n\t\t\/\/ Draw board\n\t\tUIManager.draw();\n\n\t\tif((2 <= xCursor && xCursor <=9) && (5 <= yCursor && yCursor <= 12))\n\t\t{\n\t\t\tint select = 0x02C7;\n\t\t\tterminal_layer(2);\n\t\t\tterminal_color(color_from_name(\"green\"));\n\t\t\tterminal_put(xCursor, yCursor, select);\n\t\t}\n\n\t\t\t \t\/\/TK_MOUSE_CLICK\n\t\t\/\/set the flag\n\t\t\/\/flag true then call something.\n\t\t\/*\n\t\tif (key == TK_MOUSE_LEFT)\n\t\t{\n\t\t\tint mouseClicks = terminal_state(TK_MOUSE_LEFT);\n\t\t\tif(mouseClicks == 1)\n\t\t\t{\n\t\t\t\t\/\/select the piece\n\t\t\t\tcurrent = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\n\t\t\t\tstd::cout << \"first click\" << current.x << \",\" << current.y << std::endl;\n\t\t\t}\n\t\t\telse if(mouseClicks == 2)\n\t\t\t{\n\t\t\t\t\/\/do something with that piece\n\t\t\t\tnext = {(xCursor - boardOffset.x), (yCursor - boardOffset.y)};\n\t\t\t\tstd::cout << \"second click\" << next.x << \",\" << next.y << std::endl;\n\t\t\t\tChessboard->movePiece(current, next);\n\t\t\t}\n\t\t}\n\t\t*\/\n\n\n\t\t\/\/ Commit the buffer and draw it.\n\t\t\/\/ Move to ui manager eventually.\n\t\tterminal_refresh();\n\n\t}\n\n\t\/\/ We're done here.\n\tterminal_close();\n\n\treturn 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"unittest\/gtest.hpp\"\n\n#include \"clustering\/immediate_consistency\/branch\/broadcaster.hpp\"\n#include \"clustering\/immediate_consistency\/branch\/listener.hpp\"\n#include \"clustering\/immediate_consistency\/branch\/replier.hpp\"\n#include \"memcached\/protocol.hpp\"\n#include \"unittest\/branch_history_manager.hpp\"\n#include \"unittest\/clustering_utils.hpp\"\n#include \"unittest\/unittest_utils.hpp\"\n#include \"unittest\/dummy_metadata_controller.hpp\"\n\nnamespace unittest {\n\nvoid run_with_broadcaster(\n boost::function< void(io_backender_t *,\n simple_mailbox_cluster_t *,\n branch_history_manager_t<memcached_protocol_t> *,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > >,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *,\n order_source_t *)> fun) {\n order_source_t order_source;\n\n \/* Set up a cluster so mailboxes can be created *\/\n simple_mailbox_cluster_t cluster;\n\n \/* Set up branch history manager *\/\n in_memory_branch_history_manager_t<memcached_protocol_t> branch_history_manager;\n\n \/\/ io backender\n io_backender_t io_backender(file_direct_io_mode_t::buffered_desired);\n\n \/* Set up a broadcaster and initial listener *\/\n test_store_t<memcached_protocol_t> initial_store(&io_backender, &order_source, static_cast<memcached_protocol_t::context_t *>(NULL));\n cond_t interruptor;\n\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > broadcaster(\n new broadcaster_t<memcached_protocol_t>(\n cluster.get_mailbox_manager(),\n &branch_history_manager,\n &initial_store.store,\n &get_global_perfmon_collection(),\n &order_source,\n &interruptor));\n\n watchable_variable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > broadcaster_business_card_watchable_variable(boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > >(boost::optional<broadcaster_business_card_t<memcached_protocol_t> >(broadcaster->get_business_card())));\n\n scoped_ptr_t<listener_t<memcached_protocol_t> > initial_listener(\n new listener_t<memcached_protocol_t>(base_path_t(\".\"),\n &io_backender,\n cluster.get_mailbox_manager(),\n broadcaster_business_card_watchable_variable.get_watchable(),\n &branch_history_manager,\n broadcaster.get(),\n &get_global_perfmon_collection(),\n &interruptor,\n &order_source));\n\n fun(&io_backender,\n &cluster,\n &branch_history_manager,\n broadcaster_business_card_watchable_variable.get_watchable(),\n &broadcaster,\n &initial_store,\n &initial_listener,\n &order_source);\n}\n\nvoid run_in_thread_pool_with_broadcaster(\n boost::function< void(io_backender_t *,\n simple_mailbox_cluster_t *,\n branch_history_manager_t<memcached_protocol_t> *,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > >,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *,\n order_source_t *)> fun)\n{\n unittest::run_in_thread_pool(boost::bind(&run_with_broadcaster, fun));\n}\n\n\n\/* `PartialBackfill` backfills only in a specific sub-region. *\/\n\nvoid write_to_broadcaster(broadcaster_t<memcached_protocol_t> *broadcaster, const std::string& key, const std::string& value, order_token_t otok, signal_t *) {\n sarc_mutation_t set;\n set.key = store_key_t(key);\n set.data = data_buffer_t::create(value.size());\n memcpy(set.data->buf(), value.c_str(), value.size());\n set.flags = 123;\n set.exptime = 0;\n set.add_policy = add_policy_yes;\n set.replace_policy = replace_policy_yes;\n unittest::fake_fifo_enforcement_t enforce;\n memcached_protocol_t::write_t write(set, time(NULL), 12345);\n fifo_enforcer_sink_t::exit_write_t exiter(&enforce.sink, enforce.source.enter_write());\n class : public broadcaster_t<memcached_protocol_t>::write_callback_t, public cond_t {\n public:\n void on_response(peer_id_t, const memcached_protocol_t::write_response_t &) {\n \/* ignore *\/\n }\n void on_done() {\n pulse();\n }\n } write_callback;\n cond_t non_interruptor;\n spawn_write_fake_ack_checker_t ack_checker;\n broadcaster->spawn_write(write, &exiter, otok, &write_callback, &non_interruptor, &ack_checker);\n write_callback.wait_lazily_unordered();\n}\n\nvoid run_partial_backfill_test(io_backender_t *io_backender,\n simple_mailbox_cluster_t *cluster,\n branch_history_manager_t<memcached_protocol_t> *branch_history_manager,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > > broadcaster_metadata_view,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *broadcaster,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *initial_listener,\n order_source_t *order_source) {\n \/* Set up a replier so the broadcaster can handle operations *\/\n EXPECT_FALSE((*initial_listener)->get_broadcaster_lost_signal()->is_pulsed());\n replier_t<memcached_protocol_t> replier(initial_listener->get(), cluster->get_mailbox_manager(), branch_history_manager);\n\n watchable_variable_t<boost::optional<boost::optional<replier_business_card_t<memcached_protocol_t> > > >\n replier_business_card_variable(boost::optional<boost::optional<replier_business_card_t<memcached_protocol_t> > >(boost::optional<replier_business_card_t<memcached_protocol_t> >(replier.get_business_card())));\n\n \/* Start sending operations to the broadcaster *\/\n std::map<std::string, std::string> inserter_state;\n test_inserter_t inserter(\n boost::bind(&write_to_broadcaster, broadcaster->get(), _1, _2, _3, _4),\n NULL,\n &mc_key_gen,\n order_source,\n \"memcached_backfill run_partial_backfill_test inserter\",\n &inserter_state);\n nap(10000);\n\n \/* Set up a second mirror *\/\n test_store_t<memcached_protocol_t> store2(io_backender, order_source, static_cast<memcached_protocol_t::context_t *>(NULL));\n cond_t interruptor;\n listener_t<memcached_protocol_t> listener2(\n base_path_t(\".\"),\n io_backender,\n cluster->get_mailbox_manager(),\n broadcaster_metadata_view,\n branch_history_manager,\n &store2.store,\n replier_business_card_variable.get_watchable(),\n generate_uuid(),\n &get_global_perfmon_collection(),\n &interruptor,\n order_source);\n\n EXPECT_FALSE((*initial_listener)->get_broadcaster_lost_signal()->is_pulsed());\n EXPECT_FALSE(listener2.get_broadcaster_lost_signal()->is_pulsed());\n\n nap(10000);\n\n \/* Stop the inserter, then let any lingering writes finish *\/\n inserter.stop();\n \/* Let any lingering writes finish *\/\n \/\/ TODO: 100 seconds?\n nap(100000);\n\n for (std::map<std::string, std::string>::iterator it = inserter_state.begin();\n it != inserter_state.end(); it++) {\n get_query_t get;\n get.key = store_key_t(it->first);\n memcached_protocol_t::read_t read(get, time(NULL));\n unittest::fake_fifo_enforcement_t enforce;\n fifo_enforcer_sink_t::exit_read_t exiter(&enforce.sink, enforce.source.enter_read());\n cond_t non_interruptor;\n memcached_protocol_t::read_response_t response;\n broadcaster->get()->read(read, &response, &exiter, order_source->check_in(\"unittest::(memcached)run_partial_backfill_test\").with_read_mode(), &non_interruptor);\n get_result_t get_result = boost::get<get_result_t>(response.result);\n EXPECT_TRUE(get_result.value.get() != NULL);\n EXPECT_EQ(it->second.size(), static_cast<size_t>(get_result.value->size()));\n if (static_cast<size_t>(get_result.value->size()) == it->second.size()) {\n EXPECT_EQ(it->second, std::string(get_result.value->buf(), get_result.value->size()));\n }\n }\n}\n\nTEST(MemcachedBackfill, Backfill) {\n run_in_thread_pool_with_broadcaster(&run_partial_backfill_test);\n}\n\n} \/* namespace unittest *\/\n\n<commit_msg>Put some debugfs into MemcachedBackfill.Backfill.<commit_after>\/\/ Copyright 2010-2013 RethinkDB, all rights reserved.\n#include \"unittest\/gtest.hpp\"\n\n#include \"clustering\/immediate_consistency\/branch\/broadcaster.hpp\"\n#include \"clustering\/immediate_consistency\/branch\/listener.hpp\"\n#include \"clustering\/immediate_consistency\/branch\/replier.hpp\"\n#include \"memcached\/protocol.hpp\"\n#include \"unittest\/branch_history_manager.hpp\"\n#include \"unittest\/clustering_utils.hpp\"\n#include \"unittest\/unittest_utils.hpp\"\n#include \"unittest\/dummy_metadata_controller.hpp\"\n\nnamespace unittest {\n\nvoid run_with_broadcaster(\n boost::function< void(io_backender_t *,\n simple_mailbox_cluster_t *,\n branch_history_manager_t<memcached_protocol_t> *,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > >,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *,\n order_source_t *)> fun) {\n order_source_t order_source;\n\n \/* Set up a cluster so mailboxes can be created *\/\n simple_mailbox_cluster_t cluster;\n\n \/* Set up branch history manager *\/\n in_memory_branch_history_manager_t<memcached_protocol_t> branch_history_manager;\n\n \/\/ io backender\n io_backender_t io_backender(file_direct_io_mode_t::buffered_desired);\n\n \/* Set up a broadcaster and initial listener *\/\n test_store_t<memcached_protocol_t> initial_store(&io_backender, &order_source, static_cast<memcached_protocol_t::context_t *>(NULL));\n cond_t interruptor;\n\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > broadcaster(\n new broadcaster_t<memcached_protocol_t>(\n cluster.get_mailbox_manager(),\n &branch_history_manager,\n &initial_store.store,\n &get_global_perfmon_collection(),\n &order_source,\n &interruptor));\n\n watchable_variable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > broadcaster_business_card_watchable_variable(boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > >(boost::optional<broadcaster_business_card_t<memcached_protocol_t> >(broadcaster->get_business_card())));\n\n scoped_ptr_t<listener_t<memcached_protocol_t> > initial_listener(\n new listener_t<memcached_protocol_t>(base_path_t(\".\"),\n &io_backender,\n cluster.get_mailbox_manager(),\n broadcaster_business_card_watchable_variable.get_watchable(),\n &branch_history_manager,\n broadcaster.get(),\n &get_global_perfmon_collection(),\n &interruptor,\n &order_source));\n\n fun(&io_backender,\n &cluster,\n &branch_history_manager,\n broadcaster_business_card_watchable_variable.get_watchable(),\n &broadcaster,\n &initial_store,\n &initial_listener,\n &order_source);\n}\n\nvoid run_in_thread_pool_with_broadcaster(\n boost::function< void(io_backender_t *,\n simple_mailbox_cluster_t *,\n branch_history_manager_t<memcached_protocol_t> *,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > >,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *,\n order_source_t *)> fun)\n{\n unittest::run_in_thread_pool(boost::bind(&run_with_broadcaster, fun));\n}\n\n\n\/* `PartialBackfill` backfills only in a specific sub-region. *\/\n\nvoid write_to_broadcaster(broadcaster_t<memcached_protocol_t> *broadcaster, const std::string& key, const std::string& value, order_token_t otok, signal_t *) {\n sarc_mutation_t set;\n set.key = store_key_t(key);\n set.data = data_buffer_t::create(value.size());\n memcpy(set.data->buf(), value.c_str(), value.size());\n set.flags = 123;\n set.exptime = 0;\n set.add_policy = add_policy_yes;\n set.replace_policy = replace_policy_yes;\n unittest::fake_fifo_enforcement_t enforce;\n memcached_protocol_t::write_t write(set, time(NULL), 12345);\n fifo_enforcer_sink_t::exit_write_t exiter(&enforce.sink, enforce.source.enter_write());\n class : public broadcaster_t<memcached_protocol_t>::write_callback_t, public cond_t {\n public:\n void on_response(peer_id_t, const memcached_protocol_t::write_response_t &) {\n \/* ignore *\/\n }\n void on_done() {\n pulse();\n }\n } write_callback;\n cond_t non_interruptor;\n spawn_write_fake_ack_checker_t ack_checker;\n broadcaster->spawn_write(write, &exiter, otok, &write_callback, &non_interruptor, &ack_checker);\n write_callback.wait_lazily_unordered();\n}\n\nvoid run_partial_backfill_test(io_backender_t *io_backender,\n simple_mailbox_cluster_t *cluster,\n branch_history_manager_t<memcached_protocol_t> *branch_history_manager,\n clone_ptr_t<watchable_t<boost::optional<boost::optional<broadcaster_business_card_t<memcached_protocol_t> > > > > broadcaster_metadata_view,\n scoped_ptr_t<broadcaster_t<memcached_protocol_t> > *broadcaster,\n test_store_t<memcached_protocol_t> *,\n scoped_ptr_t<listener_t<memcached_protocol_t> > *initial_listener,\n order_source_t *order_source) {\n \/* Set up a replier so the broadcaster can handle operations *\/\n EXPECT_FALSE((*initial_listener)->get_broadcaster_lost_signal()->is_pulsed());\n replier_t<memcached_protocol_t> replier(initial_listener->get(), cluster->get_mailbox_manager(), branch_history_manager);\n\n watchable_variable_t<boost::optional<boost::optional<replier_business_card_t<memcached_protocol_t> > > >\n replier_business_card_variable(boost::optional<boost::optional<replier_business_card_t<memcached_protocol_t> > >(boost::optional<replier_business_card_t<memcached_protocol_t> >(replier.get_business_card())));\n\n debugf(\"start sending operations to the broadcaster\\n\");\n \/* Start sending operations to the broadcaster *\/\n std::map<std::string, std::string> inserter_state;\n test_inserter_t inserter(\n boost::bind(&write_to_broadcaster, broadcaster->get(), _1, _2, _3, _4),\n NULL,\n &mc_key_gen,\n order_source,\n \"memcached_backfill run_partial_backfill_test inserter\",\n &inserter_state);\n debugf(\"<nap A>\\n\");\n nap(10000);\n\n debugf(\"<\/nap A>, set up a second mirror\\n\");\n \/* Set up a second mirror *\/\n test_store_t<memcached_protocol_t> store2(io_backender, order_source, static_cast<memcached_protocol_t::context_t *>(NULL));\n cond_t interruptor;\n listener_t<memcached_protocol_t> listener2(\n base_path_t(\".\"),\n io_backender,\n cluster->get_mailbox_manager(),\n broadcaster_metadata_view,\n branch_history_manager,\n &store2.store,\n replier_business_card_variable.get_watchable(),\n generate_uuid(),\n &get_global_perfmon_collection(),\n &interruptor,\n order_source);\n\n debugf(\"listener2 constructed\\n\");\n EXPECT_FALSE((*initial_listener)->get_broadcaster_lost_signal()->is_pulsed());\n EXPECT_FALSE(listener2.get_broadcaster_lost_signal()->is_pulsed());\n\n debugf(\"<nap B>\\n\");\n nap(10000);\n\n debugf(\"<\/nap B>, inserter.stop\\n\");\n \/* Stop the inserter, then let any lingering writes finish *\/\n inserter.stop();\n \/* Let any lingering writes finish *\/\n debugf(\"<nap C> (100 seconds)\\n\");\n \/\/ TODO: 100 seconds?\n nap(100000);\n debugf(\"<\/nap C>\\n\");\n\n for (std::map<std::string, std::string>::iterator it = inserter_state.begin();\n it != inserter_state.end(); it++) {\n get_query_t get;\n get.key = store_key_t(it->first);\n memcached_protocol_t::read_t read(get, time(NULL));\n unittest::fake_fifo_enforcement_t enforce;\n fifo_enforcer_sink_t::exit_read_t exiter(&enforce.sink, enforce.source.enter_read());\n cond_t non_interruptor;\n memcached_protocol_t::read_response_t response;\n broadcaster->get()->read(read, &response, &exiter, order_source->check_in(\"unittest::(memcached)run_partial_backfill_test\").with_read_mode(), &non_interruptor);\n get_result_t get_result = boost::get<get_result_t>(response.result);\n EXPECT_TRUE(get_result.value.get() != NULL);\n EXPECT_EQ(it->second.size(), static_cast<size_t>(get_result.value->size()));\n if (static_cast<size_t>(get_result.value->size()) == it->second.size()) {\n EXPECT_EQ(it->second, std::string(get_result.value->buf(), get_result.value->size()));\n }\n }\n debugf(\"done for loop\\n\");\n}\n\nTEST(MemcachedBackfill, Backfill) {\n run_in_thread_pool_with_broadcaster(&run_partial_backfill_test);\n}\n\n} \/* namespace unittest *\/\n\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#1242662 unused member<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"JNIBridge.h\"\n#include <stdlib.h>\n#include <string.h>\n#include <pthread.h>\n\nnamespace jni\n{\n\n\/\/ __thread is not supported on android (dynamic linker) :(\ntemplate <typename T>\nclass TLS\n{\npublic:\n\tTLS() { pthread_key_create(&m_Key, free); }\n\t~TLS() { pthread_key_delete(m_Key); }\n\tinline operator T () const { return static_cast<T>(pthread_getspecific(m_Key)); }\n\tinline T operator = (const T value) { pthread_setspecific(m_Key, value); return value; }\nprivate:\n\tTLS(const TLS& tls);\n\tTLS<T> operator = (const TLS<T>&);\nprivate:\n\tpthread_key_t m_Key;\n};\n\nstatic JavaVM* g_JavaVM;\n\njobject kNull(0);\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Oracle JNI functions (hidden)\n\/\/ http:\/\/docs.oracle.com\/javase\/6\/docs\/technotes\/guides\/jni\/spec\/functions.html#wp9502\n\/\/ --------------------------------------------------------------------------------------\nstatic jint PushLocalFrame(jint capacity)\n{\n\tJNI_CALL_RETURN(jint, true, true, env->PushLocalFrame(capacity));\n}\n\nstatic jobject PopLocalFrame(jobject result)\n{\n\tJNI_CALL_RETURN(jobject, true, false, env->PopLocalFrame(result));\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Initialization and error functions (hidden)\n\/\/ --------------------------------------------------------------------------------------\nstruct Error\n{\n\tErrno _errno;\n\tchar errstr[256];\n};\nstatic TLS<Error*> g_Error;\n\nstatic inline Error& GetErrorInternal()\n{\n\tError* error = g_Error;\n\tif (!error)\n\t{\n\t\terror = static_cast<Error*>(malloc(sizeof(*error)));\n\t\tmemset(error, 0, sizeof(*error));\n\t\tg_Error = error;\n\t}\n\treturn *error;\n}\n\nstatic inline void SetError(Errno _errno, const char* errmsg)\n{\n\tError& error = GetErrorInternal();\n\tif (error._errno)\n\t\treturn;\n\n\terror._errno = _errno;\n\tstrcpy(error.errstr, errmsg);\n}\n\nstatic void ClearErrors()\n{\n\tJNIEnv* env = AttachCurrentThread();\n\tif (env)\n\t{\n\t\tGetErrorInternal()._errno = kJNI_NO_ERROR;\n\t\tenv->ExceptionClear();\n\t}\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Initialization and error functions (public)\n\/\/ --------------------------------------------------------------------------------------\nvoid Initialize(JavaVM& vm)\n{\n\tg_JavaVM = &vm;\n}\n\nErrno PeekError()\n{\n\treturn GetErrorInternal()._errno;\n}\n\nconst char* GetErrorMessage()\n{\n\treturn &GetErrorInternal().errstr[0];\n}\n\nErrno CheckError()\n{\n\tErrno _errno = PeekError();\n\tif (_errno)\n\t\tClearErrors();\n\treturn _errno;\n}\n\njthrowable ExceptionThrown(jclass clazz)\n{\n\tJNIEnv* env = AttachCurrentThread();\n\tif (!env)\n\t\treturn 0;\n\n\tjthrowable t = env->ExceptionOccurred();\n\tif (!t)\n\t\treturn 0;\n\n\tif (clazz)\n\t{\n\t\tenv->ExceptionClear();\n\t\tif (!env->IsInstanceOf(t, clazz))\n\t\t{\n\t\t\tenv->Throw(t); \/\/ re-throw\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tClearErrors();\n\treturn t;\n}\n\nbool CheckForParameterError(bool valid)\n{\n\tif (!valid)\n\t\tSetError(kJNI_INVALID_PARAMETERS, \"java.lang.IllegalArgumentException: Null parameter detected\");\n\treturn !valid;\n}\n\nbool CheckForExceptionError(JNIEnv* env) \/\/ Do we need to make this safer?\n{\n\tif (env->ExceptionCheck())\n\t{\n\t\tError& error = GetErrorInternal();\n\t\tif (!error._errno)\n\t\t{\n\t\t\tSetError(kJNI_EXCEPTION_THROWN, \"java.lang.IllegalThreadStateException: Unable to determine exception message\");\n\n\t\t\tLocalFrame frame;\n\t\t\tjthrowable t = env->ExceptionOccurred();\n\t\t\tenv->ExceptionClear();\n\t\t\t{\n\t\t\t\tjclass jobject_class = env->FindClass(\"java\/lang\/Object\");\n\t\t\t\tjstring jmessage = Op<jstring>::CallMethod(t, env->GetMethodID(jobject_class, \"toString\", \"()Ljava\/lang\/String;\"));\n\n\t\t\t\tconst char* message = env->GetStringUTFChars(jmessage, NULL);\n\t\t\t\tstrncpy(error.errstr, message, sizeof(error.errstr));\n\t\t\t\terror.errstr[sizeof(error.errstr) - 1] = 0;\n\n\t\t\t\tenv->ReleaseStringUTFChars(jmessage, message);\n\t\t\t}\n\t\t\tenv->Throw(t); \/\/ re-throw exception\n\t\t\tif (!env->ExceptionOccurred())\n\t\t\t{\n\t\t\t\tint* p = 0; *p = 4711;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Oracle JNI functions (public)\n\/\/ http:\/\/docs.oracle.com\/javase\/6\/docs\/technotes\/guides\/jni\/spec\/functions.html#wp9502\n\/\/ --------------------------------------------------------------------------------------\n\nJavaVM* GetJavaVM()\n{\n\treturn g_JavaVM;\n}\n\nJNIEnv* GetEnv()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn 0;\n\n\tJNIEnv* env(0);\n\tvm->GetEnv(reinterpret_cast<void**>(&env), JNI_VERSION_1_6);\n\treturn env;\n}\n\nJNIEnv* AttachCurrentThread()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn 0;\n\n\tJNIEnv* env = GetEnv();\n\tif (!env)\n\t{\n\t\tJavaVMAttachArgs args;\n\t\targs.version = JNI_VERSION_1_6;\n\t\targs.name = NULL;\n\t\targs.group = NULL;\n\t#if !ANDROID\n\t\tvm->AttachCurrentThread(reinterpret_cast<void**>(&env), &args);\n\t#else\n\t\tvm->AttachCurrentThread(&env, &args);\n\t#endif\n\t}\n\n\tif (!env)\n\t\tSetError(kJNI_ATTACH_FAILED, \"java.lang.IllegalThreadStateException: Unable to attach to VM\");\n\n\treturn env;\n}\n\nvoid DetachCurrentThread()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn;\n\n\tvm->DetachCurrentThread();\n}\n\njclass FindClass(const char* name)\n{\n\tJNI_CALL_RETURN(jclass, name, true, env->FindClass(name));\n}\n\njint Throw(jthrowable object)\n{\n\tJNI_CALL_RETURN(jint, object, true, env->Throw(object));\n}\n\njint ThrowNew(jclass clazz, const char* message)\n{\n\tJNI_CALL_RETURN(jint, clazz && message, true, env->ThrowNew(clazz, message));\n}\n\nvoid FatalError(const char* str)\n{\n\tJNI_CALL(str, false, env->FatalError(str));\n}\n\njobject NewLocalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewLocalRef(object));\n}\n\nvoid DeleteLocalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteLocalRef(object));\n}\n\njobject NewGlobalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewGlobalRef(object));\n}\n\nvoid DeleteGlobalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteGlobalRef(object));\n}\n\njobject NewWeakGlobalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewWeakGlobalRef(object));\n}\n\nvoid DeleteWeakGlobalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteWeakGlobalRef(object));\n}\n\njclass GetObjectClass(jobject object)\n{\n\tJNI_CALL_RETURN(jclass, object, true, env->GetObjectClass(object));\n}\n\njboolean IsInstanceOf(jobject object, jclass clazz)\n{\n\tJNI_CALL_RETURN(jboolean, object && clazz, true, env->IsInstanceOf(object, clazz));\n}\n\njboolean IsSameObject(jobject object1, jobject object2)\n{\n\tJNI_CALL_RETURN(jboolean, object1 && object2, true, env->IsSameObject(object1, object2));\n}\n\njmethodID GetMethodID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jmethodID, clazz && name && signature, true, env->GetMethodID(clazz, name, signature));\n}\n\njfieldID GetFieldID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jfieldID, clazz && name && signature, true, env->GetFieldID(clazz, name, signature));\n}\n\njmethodID GetStaticMethodID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jmethodID, clazz && name && signature, true, env->GetStaticMethodID(clazz, name, signature));\n}\n\njfieldID GetStaticFieldID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jfieldID, clazz && name && signature, true, env->GetStaticFieldID(clazz, name, signature));\n}\n\njobject ToReflectedMethod(jclass clazz, jmethodID methodID, bool isStatic)\n{\n\tJNI_CALL_RETURN(jobject, clazz && methodID, true, env->ToReflectedMethod(clazz, methodID, isStatic));\n}\n\njobject NewObject(jclass clazz, jmethodID methodID, ...)\n{\n\tva_list args;\n\tva_start(args, methodID);\n\tJNI_CALL_DECLARE(jobject, result, clazz && methodID, true, env->NewObjectV(clazz, methodID, args));\n\tva_end(args);\n\treturn result;\n}\n\njstring NewStringUTF(const char* str)\n{\n\tJNI_CALL_RETURN(jstring, str, true, env->NewStringUTF(str));\n}\n\njsize GetStringUTFLength(jstring string)\n{\n\tJNI_CALL_RETURN(jsize, string, true, env->GetStringUTFLength(string));\n}\n\nconst char* GetStringUTFChars(jstring str, jboolean* isCopy)\n{\n\tJNI_CALL_RETURN(const char*, str, true, env->GetStringUTFChars(str, isCopy));\n}\n\nvoid ReleaseStringUTFChars(jstring str, const char* utfchars)\n{\n\tJNI_CALL(str && utfchars, false, env->ReleaseStringUTFChars(str, utfchars));\n}\n\nsize_t GetArrayLength(jarray obj)\n{\n\tJNI_CALL_RETURN(size_t, obj, true, env->GetArrayLength(obj));\n}\n\njobjectArray NewObjectArray(jsize length, jclass elementClass, jobject initialElement)\n{\n\tJNI_CALL_RETURN(jobjectArray, elementClass, true, env->NewObjectArray(length, elementClass, initialElement));\n}\n\njobject GetObjectArrayElement(jobjectArray obj, size_t index)\n{\n\tJNI_CALL_RETURN(jobject, obj, true, env->GetObjectArrayElement(obj, index));\n}\n\nvoid SetObjectArrayElement(jobjectArray obj, size_t index, jobject val)\n{\n\tJNI_CALL(obj, true, env->SetObjectArrayElement(obj, index, val));\n}\n\nvoid* GetPrimitiveArrayCritical(jarray obj, jboolean *isCopy)\n{\n\tJNI_CALL_RETURN(void*, obj, false, env->GetPrimitiveArrayCritical(obj, isCopy));\n}\n\nvoid ReleasePrimitiveArrayCritical(jarray obj, void *carray, jint mode)\n{\n\tJNI_CALL(obj, false, env->ReleasePrimitiveArrayCritical(obj, carray, mode));\n}\n\njobject NewDirectByteBuffer(void* buffer, jlong size)\n{\n\tJNI_CALL_RETURN(jobject, buffer, true, env->NewDirectByteBuffer(buffer, size));\n}\n\nvoid* GetDirectBufferAddress(jobject byteBuffer)\n{\n\tJNI_CALL_RETURN(void*, byteBuffer, true, env->GetDirectBufferAddress(byteBuffer));\n}\n\njlong GetDirectBufferCapacity(jobject byteBuffer)\n{\n\tJNI_CALL_RETURN(jlong, byteBuffer, true, env->GetDirectBufferCapacity(byteBuffer));\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ ThreadScope\n\/\/ --------------------------------------------------------------------------------------\nThreadScope::ThreadScope()\n{\n\tm_NeedDetach = !jni::GetEnv();\n}\n\nThreadScope::~ThreadScope()\n{\n\tif (m_NeedDetach)\n\t\tjni::DetachCurrentThread();\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ LocalFrame\n\/\/ --------------------------------------------------------------------------------------\nLocalFrame::LocalFrame(jint capacity)\n{\n\tif (PushLocalFrame(capacity) < 0)\n\t\tFatalError(\"Out of memory: Unable to allocate local frame(64)\");\n\tm_FramePushed = (PeekError() == kJNI_NO_ERROR);\n}\nLocalFrame::~LocalFrame()\n{\n\tif (m_FramePushed)\n\t\tPopLocalFrame(NULL);\n}\n\n}\n<commit_msg>Clear errors before pushing new frame<commit_after>#include \"JNIBridge.h\"\n#include <stdlib.h>\n#include <string.h>\n#include <pthread.h>\n\nnamespace jni\n{\n\n\/\/ __thread is not supported on android (dynamic linker) :(\ntemplate <typename T>\nclass TLS\n{\npublic:\n\tTLS() { pthread_key_create(&m_Key, free); }\n\t~TLS() { pthread_key_delete(m_Key); }\n\tinline operator T () const { return static_cast<T>(pthread_getspecific(m_Key)); }\n\tinline T operator = (const T value) { pthread_setspecific(m_Key, value); return value; }\nprivate:\n\tTLS(const TLS& tls);\n\tTLS<T> operator = (const TLS<T>&);\nprivate:\n\tpthread_key_t m_Key;\n};\n\nstatic JavaVM* g_JavaVM;\n\njobject kNull(0);\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Oracle JNI functions (hidden)\n\/\/ http:\/\/docs.oracle.com\/javase\/6\/docs\/technotes\/guides\/jni\/spec\/functions.html#wp9502\n\/\/ --------------------------------------------------------------------------------------\nstatic jint PushLocalFrame(jint capacity)\n{\n\tJNI_CALL_RETURN(jint, true, true, env->PushLocalFrame(capacity));\n}\n\nstatic jobject PopLocalFrame(jobject result)\n{\n\tJNI_CALL_RETURN(jobject, true, false, env->PopLocalFrame(result));\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Initialization and error functions (hidden)\n\/\/ --------------------------------------------------------------------------------------\nstruct Error\n{\n\tErrno _errno;\n\tchar errstr[256];\n};\nstatic TLS<Error*> g_Error;\n\nstatic inline Error& GetErrorInternal()\n{\n\tError* error = g_Error;\n\tif (!error)\n\t{\n\t\terror = static_cast<Error*>(malloc(sizeof(*error)));\n\t\tmemset(error, 0, sizeof(*error));\n\t\tg_Error = error;\n\t}\n\treturn *error;\n}\n\nstatic inline void SetError(Errno _errno, const char* errmsg)\n{\n\tError& error = GetErrorInternal();\n\tif (error._errno)\n\t\treturn;\n\n\terror._errno = _errno;\n\tstrcpy(error.errstr, errmsg);\n}\n\nstatic void ClearErrors()\n{\n\tJNIEnv* env = AttachCurrentThread();\n\tif (env)\n\t{\n\t\tGetErrorInternal()._errno = kJNI_NO_ERROR;\n\t\tenv->ExceptionClear();\n\t}\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Initialization and error functions (public)\n\/\/ --------------------------------------------------------------------------------------\nvoid Initialize(JavaVM& vm)\n{\n\tg_JavaVM = &vm;\n}\n\nErrno PeekError()\n{\n\treturn GetErrorInternal()._errno;\n}\n\nconst char* GetErrorMessage()\n{\n\treturn &GetErrorInternal().errstr[0];\n}\n\nErrno CheckError()\n{\n\tErrno _errno = PeekError();\n\tif (_errno)\n\t\tClearErrors();\n\treturn _errno;\n}\n\njthrowable ExceptionThrown(jclass clazz)\n{\n\tJNIEnv* env = AttachCurrentThread();\n\tif (!env)\n\t\treturn 0;\n\n\tjthrowable t = env->ExceptionOccurred();\n\tif (!t)\n\t\treturn 0;\n\n\tif (clazz)\n\t{\n\t\tenv->ExceptionClear();\n\t\tif (!env->IsInstanceOf(t, clazz))\n\t\t{\n\t\t\tenv->Throw(t); \/\/ re-throw\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tClearErrors();\n\treturn t;\n}\n\nbool CheckForParameterError(bool valid)\n{\n\tif (!valid)\n\t\tSetError(kJNI_INVALID_PARAMETERS, \"java.lang.IllegalArgumentException: Null parameter detected\");\n\treturn !valid;\n}\n\nbool CheckForExceptionError(JNIEnv* env) \/\/ Do we need to make this safer?\n{\n\tif (env->ExceptionCheck())\n\t{\n\t\tError& error = GetErrorInternal();\n\t\tif (!error._errno)\n\t\t{\n\t\t\tSetError(kJNI_EXCEPTION_THROWN, \"java.lang.IllegalThreadStateException: Unable to determine exception message\");\n\n\t\t\tLocalFrame frame;\n\t\t\tjthrowable t = env->ExceptionOccurred();\n\t\t\tenv->ExceptionClear();\n\t\t\t{\n\t\t\t\tjclass jobject_class = env->FindClass(\"java\/lang\/Object\");\n\t\t\t\tjstring jmessage = Op<jstring>::CallMethod(t, env->GetMethodID(jobject_class, \"toString\", \"()Ljava\/lang\/String;\"));\n\n\t\t\t\tconst char* message = env->GetStringUTFChars(jmessage, NULL);\n\t\t\t\tstrncpy(error.errstr, message, sizeof(error.errstr));\n\t\t\t\terror.errstr[sizeof(error.errstr) - 1] = 0;\n\n\t\t\t\tenv->ReleaseStringUTFChars(jmessage, message);\n\t\t\t}\n\t\t\tenv->Throw(t); \/\/ re-throw exception\n\t\t\tif (!env->ExceptionOccurred())\n\t\t\t{\n\t\t\t\tint* p = 0; *p = 4711;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ Oracle JNI functions (public)\n\/\/ http:\/\/docs.oracle.com\/javase\/6\/docs\/technotes\/guides\/jni\/spec\/functions.html#wp9502\n\/\/ --------------------------------------------------------------------------------------\n\nJavaVM* GetJavaVM()\n{\n\treturn g_JavaVM;\n}\n\nJNIEnv* GetEnv()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn 0;\n\n\tJNIEnv* env(0);\n\tvm->GetEnv(reinterpret_cast<void**>(&env), JNI_VERSION_1_6);\n\treturn env;\n}\n\nJNIEnv* AttachCurrentThread()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn 0;\n\n\tJNIEnv* env = GetEnv();\n\tif (!env)\n\t{\n\t\tJavaVMAttachArgs args;\n\t\targs.version = JNI_VERSION_1_6;\n\t\targs.name = NULL;\n\t\targs.group = NULL;\n\t#if !ANDROID\n\t\tvm->AttachCurrentThread(reinterpret_cast<void**>(&env), &args);\n\t#else\n\t\tvm->AttachCurrentThread(&env, &args);\n\t#endif\n\t}\n\n\tif (!env)\n\t\tSetError(kJNI_ATTACH_FAILED, \"java.lang.IllegalThreadStateException: Unable to attach to VM\");\n\n\treturn env;\n}\n\nvoid DetachCurrentThread()\n{\n\tJavaVM* vm = g_JavaVM;\n\tif (!vm)\n\t\treturn;\n\n\tvm->DetachCurrentThread();\n}\n\njclass FindClass(const char* name)\n{\n\tJNI_CALL_RETURN(jclass, name, true, env->FindClass(name));\n}\n\njint Throw(jthrowable object)\n{\n\tJNI_CALL_RETURN(jint, object, true, env->Throw(object));\n}\n\njint ThrowNew(jclass clazz, const char* message)\n{\n\tJNI_CALL_RETURN(jint, clazz && message, true, env->ThrowNew(clazz, message));\n}\n\nvoid FatalError(const char* str)\n{\n\tJNI_CALL(str, false, env->FatalError(str));\n}\n\njobject NewLocalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewLocalRef(object));\n}\n\nvoid DeleteLocalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteLocalRef(object));\n}\n\njobject NewGlobalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewGlobalRef(object));\n}\n\nvoid DeleteGlobalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteGlobalRef(object));\n}\n\njobject NewWeakGlobalRef(jobject object)\n{\n\tJNI_CALL_RETURN(jobject, object, true, env->NewWeakGlobalRef(object));\n}\n\nvoid DeleteWeakGlobalRef(jobject object)\n{\n\tJNI_CALL(object, false, env->DeleteWeakGlobalRef(object));\n}\n\njclass GetObjectClass(jobject object)\n{\n\tJNI_CALL_RETURN(jclass, object, true, env->GetObjectClass(object));\n}\n\njboolean IsInstanceOf(jobject object, jclass clazz)\n{\n\tJNI_CALL_RETURN(jboolean, object && clazz, true, env->IsInstanceOf(object, clazz));\n}\n\njboolean IsSameObject(jobject object1, jobject object2)\n{\n\tJNI_CALL_RETURN(jboolean, object1 && object2, true, env->IsSameObject(object1, object2));\n}\n\njmethodID GetMethodID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jmethodID, clazz && name && signature, true, env->GetMethodID(clazz, name, signature));\n}\n\njfieldID GetFieldID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jfieldID, clazz && name && signature, true, env->GetFieldID(clazz, name, signature));\n}\n\njmethodID GetStaticMethodID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jmethodID, clazz && name && signature, true, env->GetStaticMethodID(clazz, name, signature));\n}\n\njfieldID GetStaticFieldID(jclass clazz, const char* name, const char* signature)\n{\n\tJNI_CALL_RETURN(jfieldID, clazz && name && signature, true, env->GetStaticFieldID(clazz, name, signature));\n}\n\njobject ToReflectedMethod(jclass clazz, jmethodID methodID, bool isStatic)\n{\n\tJNI_CALL_RETURN(jobject, clazz && methodID, true, env->ToReflectedMethod(clazz, methodID, isStatic));\n}\n\njobject NewObject(jclass clazz, jmethodID methodID, ...)\n{\n\tva_list args;\n\tva_start(args, methodID);\n\tJNI_CALL_DECLARE(jobject, result, clazz && methodID, true, env->NewObjectV(clazz, methodID, args));\n\tva_end(args);\n\treturn result;\n}\n\njstring NewStringUTF(const char* str)\n{\n\tJNI_CALL_RETURN(jstring, str, true, env->NewStringUTF(str));\n}\n\njsize GetStringUTFLength(jstring string)\n{\n\tJNI_CALL_RETURN(jsize, string, true, env->GetStringUTFLength(string));\n}\n\nconst char* GetStringUTFChars(jstring str, jboolean* isCopy)\n{\n\tJNI_CALL_RETURN(const char*, str, true, env->GetStringUTFChars(str, isCopy));\n}\n\nvoid ReleaseStringUTFChars(jstring str, const char* utfchars)\n{\n\tJNI_CALL(str && utfchars, false, env->ReleaseStringUTFChars(str, utfchars));\n}\n\nsize_t GetArrayLength(jarray obj)\n{\n\tJNI_CALL_RETURN(size_t, obj, true, env->GetArrayLength(obj));\n}\n\njobjectArray NewObjectArray(jsize length, jclass elementClass, jobject initialElement)\n{\n\tJNI_CALL_RETURN(jobjectArray, elementClass, true, env->NewObjectArray(length, elementClass, initialElement));\n}\n\njobject GetObjectArrayElement(jobjectArray obj, size_t index)\n{\n\tJNI_CALL_RETURN(jobject, obj, true, env->GetObjectArrayElement(obj, index));\n}\n\nvoid SetObjectArrayElement(jobjectArray obj, size_t index, jobject val)\n{\n\tJNI_CALL(obj, true, env->SetObjectArrayElement(obj, index, val));\n}\n\nvoid* GetPrimitiveArrayCritical(jarray obj, jboolean *isCopy)\n{\n\tJNI_CALL_RETURN(void*, obj, false, env->GetPrimitiveArrayCritical(obj, isCopy));\n}\n\nvoid ReleasePrimitiveArrayCritical(jarray obj, void *carray, jint mode)\n{\n\tJNI_CALL(obj, false, env->ReleasePrimitiveArrayCritical(obj, carray, mode));\n}\n\njobject NewDirectByteBuffer(void* buffer, jlong size)\n{\n\tJNI_CALL_RETURN(jobject, buffer, true, env->NewDirectByteBuffer(buffer, size));\n}\n\nvoid* GetDirectBufferAddress(jobject byteBuffer)\n{\n\tJNI_CALL_RETURN(void*, byteBuffer, true, env->GetDirectBufferAddress(byteBuffer));\n}\n\njlong GetDirectBufferCapacity(jobject byteBuffer)\n{\n\tJNI_CALL_RETURN(jlong, byteBuffer, true, env->GetDirectBufferCapacity(byteBuffer));\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ ThreadScope\n\/\/ --------------------------------------------------------------------------------------\nThreadScope::ThreadScope()\n{\n\tm_NeedDetach = !jni::GetEnv();\n}\n\nThreadScope::~ThreadScope()\n{\n\tif (m_NeedDetach)\n\t\tjni::DetachCurrentThread();\n}\n\n\/\/ --------------------------------------------------------------------------------------\n\/\/ LocalFrame\n\/\/ --------------------------------------------------------------------------------------\nLocalFrame::LocalFrame(jint capacity)\n{\n\tClearErrors();\n\tif (PushLocalFrame(capacity) < 0)\n\t\tFatalError(\"Out of memory: Unable to allocate local frame(64)\");\n\tm_FramePushed = (PeekError() == kJNI_NO_ERROR);\n}\nLocalFrame::~LocalFrame()\n{\n\tif (m_FramePushed)\n\t\tPopLocalFrame(NULL);\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>#include <limits>\n#include <iostream>\n#include <fstream>\n#include <vector>\n\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#ifndef EFU_WINERRORSTRING_H\n#include \"win_error_string.h\"\n#endif\n\n#endif\n\n#ifndef EFU_TARGET_H\n#include \"target.h\"\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\n\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n bool arg_errors = false;\n\n#ifdef _WIN32\n std::string nwn_bin(\"nwmain.exe\");\n#else\n std::string nwn_bin(\"nwmain\");\n#endif\n std::string nwn_root_dir(\".\/\");\n\n std::string cmd_line(\" +connect nwn.efupw.com:5121\");\n \n const std::vector<std::string> args(argv + 1, argv + argc);\n\n std::cout << \"Processing command line arguments.\" << std::endl;\n for (size_t i = 0; i < args.size(); ++i)\n {\n auto arg(args.at(i));\n \n if (arg.find(\"-dmpass\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n cmd_line.append(\" -dmc +password \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-dmpass specified but no value given. Use\\n\"\\\n \"-dmpass=mypassword\" <<std::endl;\n arg_errors = true;\n }\n }\n else if (arg.find(\"-nwn\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n nwn_root_dir = cmd.at(1);\n }\n else\n {\n std::cout << \"-nwn specified but no value given. Use\\n\"\\\n \"-nwn=\\\"path\\\\to\\\\NWN\\\\directory\\\\\\\"\" <<std::endl;\n arg_errors = true;\n }\n }\n else\n {\n std::cout << \"Ignoring unrecognized argument: \" << arg\n << std::endl;\n arg_errors = true;\n }\n }\n \n if (arg_errors)\n {\n std::cout << \"Argument errors. Press a key to continue.\" << std::endl;\n std::cin.get();\n }\n\n#ifdef _WIN32\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n \n if (!nwn && nwn_root_dir != \".\/\")\n {\n std::cout << nwn_root_dir << \" not detected as NWN root directory.\"\\\n \"\\nTrying current launcher directory...\\n\";\n nwn_root_dir = \".\/\";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n }\n\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n \n if (nwn)\n {\n std::cout << nwn_root_dir + nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n nwn_root_dir = \".\/\";\n }\n#endif\n\n EfuLauncher l(nwn_root_dir,\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available. Please\"\\\n \" download it at https:\/\/github.com\/commonquail\/efulauncher\/\"\\\n \"releases. Press any key to exit.\" << std::endl;\n std::cin.get();\n return 0;\n \/*\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n *\/\n }\n\n try\n {\n l.stat_targets();\n std::cout << \"Done.\" << std::endl;\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n#ifdef _WIN32\n if (nwn)\n {\n std::cout << \"Launching \" << nwn_root_dir + nwn_bin << \"...\" << std::endl;\n\n STARTUPINFO si;\n PROCESS_INFORMATION pi;\n ::ZeroMemory(&pi, sizeof(pi));\n ::ZeroMemory(&si, sizeof(si));\n si.cb = sizeof(si);\n \n auto nwn_path(nwn_root_dir + nwn_bin);\n cmd_line = nwn_path + cmd_line;\n\n BOOL success = ::CreateProcess(\n const_cast<char *>(nwn_path.c_str()),\n const_cast<char *>(cmd_line.c_str()),\n NULL, \/\/ Process handle not inheritable\n NULL, \/\/ Thread handle not inheritable\n FALSE, \/\/ Set handle inheritance to FALSE\n 0, \/\/ No creation flags\n NULL, \/\/ Use parent's environment block\n const_cast<char *>(nwn_root_dir.c_str()), \/\/ Starting directory \n &si, &pi);\n if (success)\n {\n ::CloseHandle(pi.hProcess);\n ::CloseHandle(pi.hThread);\n }\n else\n {\n WinErrorString we;\n std::cout << we.str() << std::endl;\n }\n }\n#endif\n\n return 0;\n}\n<commit_msg>Apply const qualifier.<commit_after>#include <limits>\n#include <iostream>\n#include <fstream>\n#include <vector>\n\n#ifdef _WIN32\n\n#ifndef EFU_SIMPLEREADHKLMKEY_H\n#include \"simple_read_hklm_key.h\"\n#endif\n\n#ifndef EFU_WINERRORSTRING_H\n#include \"win_error_string.h\"\n#endif\n\n#endif\n\n#ifndef EFU_TARGET_H\n#include \"target.h\"\n#endif\n\n#ifndef EFU_EFULAUNCHER_H\n#include \"efulauncher.h\"\n#endif\n\n#ifndef EFU_CURLEASY_H\n#include \"curleasy.h\"\n#endif\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = static_cast<char>(tolower(c));\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\n\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n bool arg_errors = false;\n\n#ifdef _WIN32\n std::string nwn_bin(\"nwmain.exe\");\n#else\n std::string nwn_bin(\"nwmain\");\n#endif\n std::string nwn_root_dir(\".\/\");\n\n std::string cmd_line(\" +connect nwn.efupw.com:5121\");\n \n const std::vector<std::string> args(argv + 1, argv + argc);\n\n std::cout << \"Processing command line arguments.\" << std::endl;\n for (size_t i = 0; i < args.size(); ++i)\n {\n const auto arg(args.at(i));\n \n if (arg.find(\"-dmpass\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n cmd_line.append(\" -dmc +password \" + cmd.at(1));\n }\n else\n {\n std::cout << \"-dmpass specified but no value given. Use\\n\"\\\n \"-dmpass=mypassword\" <<std::endl;\n arg_errors = true;\n }\n }\n else if (arg.find(\"-nwn\") == 0)\n {\n auto cmd(split(arg, '='));\n if (cmd.size() == 2)\n {\n nwn_root_dir = cmd.at(1);\n }\n else\n {\n std::cout << \"-nwn specified but no value given. Use\\n\"\\\n \"-nwn=\\\"path\\\\to\\\\NWN\\\\directory\\\\\\\"\" <<std::endl;\n arg_errors = true;\n }\n }\n else\n {\n std::cout << \"Ignoring unrecognized argument: \" << arg\n << std::endl;\n arg_errors = true;\n }\n }\n \n if (arg_errors)\n {\n std::cout << \"Argument errors. Press a key to continue.\" << std::endl;\n std::cin.get();\n }\n\n#ifdef _WIN32\n std::ifstream nwn(nwn_root_dir + nwn_bin, std::ios::binary);\n \n if (!nwn && nwn_root_dir != \".\/\")\n {\n std::cout << nwn_root_dir << \" not detected as NWN root directory.\"\\\n \"\\nTrying current launcher directory...\\n\";\n nwn_root_dir = \".\/\";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n }\n\n if (!nwn)\n {\n std::cout << \"Current launcher directory not detected as NWN root\"\\\n \" directory.\";\n nwn_root_dir = \"C:\/NeverwinterNights\/NWN\/\";\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n\n if (!nwn)\n {\n std::cout << \"not found.\\nSearching registry... \";\n SimpleReadHKLMKey reg(\"SOFTWARE\\\\BioWare\\\\NWN\\\\Neverwinter\",\n \"Location\");\n if (reg.good())\n {\n nwn_root_dir = reg.str();\n std::cout << \"key found.\";\n auto path_sep = nwn_root_dir.at(nwn_root_dir.size() - 1);\n if (path_sep != '\/' && path_sep != '\\\\')\n {\n nwn_root_dir.append(\"\/\");\n }\n std::cout << \"\\nTrying \" << nwn_root_dir << \"... \";\n nwn.open(nwn_root_dir + nwn_bin, std::ios::binary);\n if (!nwn)\n {\n std::cout << \"not found.\";\n }\n }\n else\n {\n std::cout << \"no key found.\";\n }\n }\n }\n \n if (nwn)\n {\n std::cout << nwn_root_dir + nwn_bin << \" found.\" << std::endl;\n }\n else\n {\n std::cout << \"\\n\\nNWN root directory not found, known\"\\\n \" options exhausted.\"\\\n \"\\nThe launcher will not be able to download files to the correct\"\\\n \" location or\"\\\n \"\\nlaunch Neverwinter Nights, however, the launcher\"\\\n \" may still download files to\"\\\n \"\\nthe current directory and you can\"\\\n \" move them manually afterwards. To avoid this\"\\\n \"\\nin the future\"\\\n \" either move the launcher to the NWN root directory containing\"\\\n \"\\nnwmain.exe or pass the -nwn=C:\/NeverwinterNights\/NWN flag to\"\\\n \" the launcher\"\\\n \"\\nexecutable, substituting the correct path, quoted\"\\\n \" if it contains spaces:\"\\\n \"\\n\\t-nwn=\\\"X:\/Games\/Neverwinter Nights\/NWN\\\".\"\\\n \"\\n\/ and \\\\ are interchangeable.\"\\\n \"\\nWould you like to download files anyway (y\/n)?\" << std::endl;\n if (!confirm())\n {\n std::cout << \"Exiting EfU Launcher. Goodbye!\" << std::endl;\n return 0;\n }\n nwn_root_dir = \".\/\";\n }\n#endif\n\n EfuLauncher l(nwn_root_dir,\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"master\/versioncheck\");\n\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available. Please\"\\\n \" download it at https:\/\/github.com\/commonquail\/efulauncher\/\"\\\n \"releases. Press any key to exit.\" << std::endl;\n std::cin.get();\n return 0;\n \/*\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n if (l.get_update())\n {\n std::cout << \"Done. Please extract and run the new launcher.\" << std::endl;\n }\n return 0;\n }\n *\/\n }\n\n try\n {\n l.stat_targets();\n std::cout << \"Done.\" << std::endl;\n }\n catch (std::exception &e)\n {\n std::cerr << e.what() << std::endl;\n }\n\n#ifdef _WIN32\n if (nwn)\n {\n std::cout << \"Launching \" << nwn_root_dir + nwn_bin << \"...\" << std::endl;\n\n STARTUPINFO si;\n PROCESS_INFORMATION pi;\n ::ZeroMemory(&pi, sizeof(pi));\n ::ZeroMemory(&si, sizeof(si));\n si.cb = sizeof(si);\n \n auto nwn_path(nwn_root_dir + nwn_bin);\n cmd_line = nwn_path + cmd_line;\n\n BOOL success = ::CreateProcess(\n const_cast<char *>(nwn_path.c_str()),\n const_cast<char *>(cmd_line.c_str()),\n NULL, \/\/ Process handle not inheritable\n NULL, \/\/ Thread handle not inheritable\n FALSE, \/\/ Set handle inheritance to FALSE\n 0, \/\/ No creation flags\n NULL, \/\/ Use parent's environment block\n const_cast<char *>(nwn_root_dir.c_str()), \/\/ Starting directory \n &si, &pi);\n if (success)\n {\n ::CloseHandle(pi.hProcess);\n ::CloseHandle(pi.hThread);\n }\n else\n {\n WinErrorString we;\n std::cout << we.str() << std::endl;\n }\n }\n#endif\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>convert include\/svx\/numvset.hxx from String to OUString<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2017-2020 The Verible Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"verilog\/analysis\/checkers\/macro_string_concatenation_rule.h\"\n\n#include <string>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"common\/analysis\/citation.h\"\n#include \"common\/text\/token_info.h\"\n#include \"common\/util\/value_saver.h\"\n#include \"verilog\/analysis\/descriptions.h\"\n#include \"verilog\/analysis\/lint_rule_registry.h\"\n#include \"verilog\/parser\/verilog_lexer.h\"\n#include \"verilog\/parser\/verilog_token_classifications.h\"\n\nnamespace verilog {\nnamespace analysis {\n\nusing verible::GetStyleGuideCitation;\nusing verible::LintRuleStatus;\nusing verible::LintViolation;\nusing verible::TokenInfo;\n\n\/\/ Register the lint rule\nVERILOG_REGISTER_LINT_RULE(MacroStringConcatenationRule);\n\nabsl::string_view MacroStringConcatenationRule::Name() {\n return \"macro-string-concatenation\";\n}\nconst char MacroStringConcatenationRule::kTopic[] = \"defines\";\nconst char MacroStringConcatenationRule::kMessage[] =\n \"Token concatenation (``) used inside plain string literal.\";\n\nstd::string MacroStringConcatenationRule::GetDescription(\n DescriptionType description_type) {\n return absl::StrCat(\n \"Concatenation will not be evaluated here. Use `\\\"...`\\\" instead. \"\n \"See \", GetStyleGuideCitation(kTopic), \".\");\n}\n\nvoid MacroStringConcatenationRule::HandleToken(const TokenInfo& token) {\n const auto token_enum = static_cast<verilog_tokentype>(token.token_enum());\n const absl::string_view text(token.text());\n\n \/\/ Search only in `define tokens. Ignore state as `defines can be nested.\n if (token_enum == PP_define_body) {\n if (IsUnlexed(verilog_tokentype(token.token_enum()))) {\n verible::ValueSaver<State> state_saver(&state_, State::kInsideDefineBody);\n RecursiveLexText(\n text, [this](const TokenInfo& subtoken) { HandleToken(subtoken); });\n }\n } else if (state_ == State::kInsideDefineBody && token_enum == TK_StringLiteral) {\n size_t pos = 0;\n while((pos = text.find(\"``\", pos)) != absl::string_view::npos) {\n violations_.insert(LintViolation(\n TokenInfo(token_enum, text.substr(pos, 2)), kMessage));\n pos += 2;\n }\n }\n}\n\nLintRuleStatus MacroStringConcatenationRule::Report() const {\n return LintRuleStatus(violations_, Name(), GetStyleGuideCitation(kTopic));\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace verilog\n<commit_msg>Use already casted token_enum<commit_after>\/\/ Copyright 2017-2020 The Verible Authors.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"verilog\/analysis\/checkers\/macro_string_concatenation_rule.h\"\n\n#include <string>\n\n#include \"absl\/strings\/match.h\"\n#include \"absl\/strings\/str_cat.h\"\n#include \"common\/analysis\/citation.h\"\n#include \"common\/text\/token_info.h\"\n#include \"common\/util\/value_saver.h\"\n#include \"verilog\/analysis\/descriptions.h\"\n#include \"verilog\/analysis\/lint_rule_registry.h\"\n#include \"verilog\/parser\/verilog_lexer.h\"\n#include \"verilog\/parser\/verilog_token_classifications.h\"\n\nnamespace verilog {\nnamespace analysis {\n\nusing verible::GetStyleGuideCitation;\nusing verible::LintRuleStatus;\nusing verible::LintViolation;\nusing verible::TokenInfo;\n\n\/\/ Register the lint rule\nVERILOG_REGISTER_LINT_RULE(MacroStringConcatenationRule);\n\nabsl::string_view MacroStringConcatenationRule::Name() {\n return \"macro-string-concatenation\";\n}\nconst char MacroStringConcatenationRule::kTopic[] = \"defines\";\nconst char MacroStringConcatenationRule::kMessage[] =\n \"Token concatenation (``) used inside plain string literal.\";\n\nstd::string MacroStringConcatenationRule::GetDescription(\n DescriptionType description_type) {\n return absl::StrCat(\n \"Concatenation will not be evaluated here. Use `\\\"...`\\\" instead. \"\n \"See \", GetStyleGuideCitation(kTopic), \".\");\n}\n\nvoid MacroStringConcatenationRule::HandleToken(const TokenInfo& token) {\n const auto token_enum = static_cast<verilog_tokentype>(token.token_enum());\n const absl::string_view text(token.text());\n\n \/\/ Search only in `define tokens. Ignore state as `defines can be nested.\n if (token_enum == PP_define_body) {\n if (IsUnlexed(verilog_tokentype(token_enum))) {\n verible::ValueSaver<State> state_saver(&state_, State::kInsideDefineBody);\n RecursiveLexText(\n text, [this](const TokenInfo& subtoken) { HandleToken(subtoken); });\n }\n } else if (state_ == State::kInsideDefineBody && token_enum == TK_StringLiteral) {\n size_t pos = 0;\n while((pos = text.find(\"``\", pos)) != absl::string_view::npos) {\n violations_.insert(LintViolation(\n TokenInfo(token_enum, text.substr(pos, 2)), kMessage));\n pos += 2;\n }\n }\n}\n\nLintRuleStatus MacroStringConcatenationRule::Report() const {\n return LintRuleStatus(violations_, Name(), GetStyleGuideCitation(kTopic));\n}\n\n} \/\/ namespace analysis\n} \/\/ namespace verilog\n<|endoftext|>"} {"text":"<commit_before>\/*\n Copyright (C) 2001 by Jorrit Tyberghein\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public\n License along with this library; if not, write to the Free\n Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"simple2.h\"\n\nCS_IMPLEMENT_APPLICATION\n\n\/\/-----------------------------------------------------------------------------\n\nSimple::Simple ()\n{\n SetApplicationName (\"CrystalSpace.Simple2\");\n}\n\nSimple::~Simple ()\n{\n}\n\nvoid Simple::ProcessFrame ()\n{\n \/\/ First get elapsed time from the virtual clock.\n csTicks elapsed_time = vc->GetElapsedTicks ();\n \/\/ Now rotate the camera according to keyboard state\n float speed = (elapsed_time \/ 1000.0) * (0.06 * 20);\n\n iCamera* c = view->GetCamera();\n\n if (kbd->GetKeyState (CSKEY_SHIFT))\n {\n \/\/ If the user is holding down shift, the arrow keys will cause\n \/\/ the camera to strafe up, down, left or right from it's\n \/\/ current position.\n if (kbd->GetKeyState (CSKEY_RIGHT))\n c->Move (CS_VEC_RIGHT * 4 * speed);\n if (kbd->GetKeyState (CSKEY_LEFT))\n c->Move (CS_VEC_LEFT * 4 * speed);\n if (kbd->GetKeyState (CSKEY_UP))\n c->Move (CS_VEC_UP * 4 * speed);\n if (kbd->GetKeyState (CSKEY_DOWN))\n c->Move (CS_VEC_DOWN * 4 * speed);\n }\n else\n {\n \/\/ left and right cause the camera to rotate on the global Y\n \/\/ axis; page up and page down cause the camera to rotate on the\n \/\/ _camera's_ X axis (more on this in a second) and up and down\n \/\/ arrows cause the camera to go forwards and backwards.\n if (kbd->GetKeyState (CSKEY_RIGHT))\n rotY += speed;\n if (kbd->GetKeyState (CSKEY_LEFT))\n rotY -= speed;\n if (kbd->GetKeyState (CSKEY_PGUP))\n rotX += speed;\n if (kbd->GetKeyState (CSKEY_PGDN))\n rotX -= speed;\n if (kbd->GetKeyState (CSKEY_UP))\n c->Move (CS_VEC_FORWARD * 4 * speed);\n if (kbd->GetKeyState (CSKEY_DOWN))\n c->Move (CS_VEC_BACKWARD * 4 * speed);\n }\n\n \/\/ We now assign a new rotation transformation to the camera. You\n \/\/ can think of the rotation this way: starting from the zero\n \/\/ position, you first rotate \"rotY\" radians on your Y axis to get\n \/\/ the first rotation. From there you rotate \"rotX\" radians on the\n \/\/ your X axis to get the final rotation. We multiply the\n \/\/ individual rotations on each axis together to get a single\n \/\/ rotation matrix. The rotations are applied in right to left\n \/\/ order .\n csMatrix3 rot = csXRotMatrix3 (rotX) * csYRotMatrix3 (rotY);\n csOrthoTransform ot (rot, c->GetTransform().GetOrigin ());\n c->SetTransform (ot);\n\n \/\/ Tell 3D driver we're going to display 3D things.\n if (!g3d->BeginDraw (engine->GetBeginDrawFlags () | CSDRAW_3DGRAPHICS))\n return;\n\n \/\/ Tell the camera to render into the frame buffer.\n view->Draw ();\n}\n\nvoid Simple::FinishFrame ()\n{\n \/\/ Just tell the 3D renderer that everything has been rendered.\n g3d->FinishDraw ();\n g3d->Print (0);\n}\n\nbool Simple::OnKeyboard(iEvent& ev)\n{\n \/\/ We got a keyboard event.\n csKeyEventType eventtype = csKeyEventHelper::GetEventType(&ev);\n if (eventtype == csKeyEventTypeDown)\n {\n \/\/ The user pressed a key (as opposed to releasing it).\n utf32_char code = csKeyEventHelper::GetCookedCode(&ev);\n if (code == CSKEY_ESC)\n {\n \/\/ The user pressed escape to exit the application.\n \/\/ The proper way to quit a Crystal Space application\n \/\/ is by broadcasting a cscmdQuit event. That will cause the\n \/\/ main runloop to stop. To do that we get the event queue from\n \/\/ the object registry and then post the event.\n csRef<iEventQueue> q = \n CS_QUERY_REGISTRY(GetObjectRegistry(), iEventQueue);\n if (q.IsValid()) q->GetEventOutlet()->Broadcast(cscmdQuit);\n }\n }\n return false;\n}\n\nbool Simple::OnInitialize(int argc, char* argv[])\n{\n \/\/ RequestPlugins() will load all plugins we specify. In addition\n \/\/ it will also check if there are plugins that need to be loaded\n \/\/ from the config system (both the application config and CS or\n \/\/ global configs). In addition it also supports specifying plugins\n \/\/ on the commandline.\n if (!csInitializer::RequestPlugins(GetObjectRegistry(),\n CS_REQUEST_VFS,\n CS_REQUEST_OPENGL3D,\n CS_REQUEST_ENGINE,\n CS_REQUEST_FONTSERVER,\n CS_REQUEST_IMAGELOADER,\n CS_REQUEST_LEVELLOADER,\n CS_REQUEST_REPORTER,\n CS_REQUEST_REPORTERLISTENER,\n CS_REQUEST_END))\n return ReportError(\"Failed to initialize plugins!\");\n\n \/\/ Now we need to setup an event handler for our application.\n \/\/ Crystal Space is fully event-driven. Everything (except for this\n \/\/ initialization) happens in an event.\n if (!RegisterQueue(GetObjectRegistry()))\n return ReportError(\"Failed to set up event handler!\");\n\n return true;\n}\n\nvoid Simple::OnExit()\n{\n}\n\nbool Simple::Application()\n{\n \/\/ Open the main system. This will open all the previously loaded plug-ins.\n \/\/ i.e. all windows will be opened.\n if (!OpenApplication(GetObjectRegistry()))\n return ReportError(\"Error opening system!\");\n\n \/\/ Now get the pointer to various modules we need. We fetch them\n \/\/ from the object registry. The RequestPlugins() call we did earlier\n \/\/ registered all loaded plugins with the object registry.\n \/\/ The virtual clock.\n g3d = CS_QUERY_REGISTRY(GetObjectRegistry(), iGraphics3D);\n if (!g3d) return ReportError(\"Failed to locate 3D renderer!\");\n\n engine = CS_QUERY_REGISTRY(GetObjectRegistry(), iEngine);\n if (!engine) return ReportError(\"Failed to locate 3D engine!\");\n\n vc = CS_QUERY_REGISTRY(GetObjectRegistry(), iVirtualClock);\n if (!vc) return ReportError(\"Failed to locate Virtual Clock!\");\n\n kbd = CS_QUERY_REGISTRY(GetObjectRegistry(), iKeyboardDriver);\n if (!kbd) return ReportError(\"Failed to locate Keyboard Driver!\");\n\n loader = CS_QUERY_REGISTRY(GetObjectRegistry(), iLoader);\n if (!loader) return ReportError(\"Failed to locate Loader!\");\n\n \/\/ We need a View to the virtual world.\n view.AttachNew(new csView (engine, g3d));\n iGraphics2D* g2d = g3d->GetDriver2D ();\n \/\/ We use the full window to draw the world.\n view->SetRectangle (0, 0, g2d->GetWidth (), g2d->GetHeight ());\n\n \/\/ First disable the lighting cache. Our app is simple enough\n \/\/ not to need this.\n engine->SetLightingCacheMode (0);\n\n \/\/ Here we create our world.\n CreateRoom();\n\n \/\/ Here we create our world.\n CreateSprites();\n\n \/\/ Let the engine prepare all lightmaps for use and also free all images \n \/\/ that were loaded for the texture manager.\n engine->Prepare ();\n\n \/\/ these are used store the current orientation of the camera\n rotY = rotX = 0;\n\n \/\/ Now we need to position the camera in our world.\n view->GetCamera ()->SetSector (room);\n view->GetCamera ()->GetTransform ().SetOrigin (csVector3 (0, 5, -3));\n\n \/\/ This calls the default runloop. This will basically just keep\n \/\/ broadcasting process events to keep the game going.\n Run();\n\n return true;\n}\n\n\nvoid Simple::CreateRoom ()\n{\n \/\/ Load the texture from the standard library. This is located in\n \/\/ CS\/data\/standard.zip and mounted as \/lib\/std using the Virtual\n \/\/ File System (VFS) plugin.\n if (!loader->LoadTexture (\"stone\", \"\/lib\/std\/stone4.gif\"))\n ReportError(\"Error loading 'stone4' texture!\");\n\n iMaterialWrapper* tm = engine->GetMaterialList ()->FindByName (\"stone\");\n\n \/\/ We create a new sector called \"room\".\n room = engine->CreateSector (\"room\");\n\n \/\/ Creating the walls for our room.\n csRef<iMeshWrapper> walls (engine->CreateSectorWallsMesh (room, \"walls\"));\n csRef<iThingState> ws =\n SCF_QUERY_INTERFACE (walls->GetMeshObject (), iThingState);\n csRef<iThingFactoryState> walls_state = ws->GetFactory ();\n walls_state->AddInsideBox (csVector3 (-5, 0, -5), csVector3 (5, 20, 5));\n walls_state->SetPolygonMaterial (CS_POLYRANGE_LAST, tm);\n walls_state->SetPolygonTextureMapping (CS_POLYRANGE_LAST, 3);\n\n \/\/ Now we need light to see something.\n csRef<iLight> light;\n iLightList* ll = room->GetLights ();\n\n light = engine->CreateLight(0, csVector3(-3, 5, 0), 10, csColor(1, 0, 0));\n ll->Add (light);\n\n light = engine->CreateLight(0, csVector3(3, 5, 0), 10, csColor(0, 0, 1));\n ll->Add (light);\n\n light = engine->CreateLight(0, csVector3(0, 5, -3), 10, csColor(0, 1, 0));\n ll->Add (light);\n}\n\nvoid Simple::CreateSprites ()\n{\n \/\/ Load a texture for our sprite.\n iTextureManager* txtmgr = g3d->GetTextureManager ();\n iTextureWrapper* txt = loader->LoadTexture (\"spark\",\n \"\/lib\/std\/spark.png\", CS_TEXTURE_3D, txtmgr, true);\n if (txt == 0)\n ReportError(\"Error loading texture!\");\n\n \/\/ Load a sprite template from disk.\n csRef<iMeshFactoryWrapper> imeshfact (\n loader->LoadMeshObjectFactory (\"\/lib\/std\/sprite1\"));\n if (imeshfact == 0)\n ReportError(\"Error loading mesh object factory!\");\n\n \/\/ Create the sprite and add it to the engine.\n csRef<iMeshWrapper> sprite (engine->CreateMeshWrapper (\n imeshfact, \"MySprite\", room,\n csVector3 (-3, 5, 3)));\n csMatrix3 m; m.Identity ();\n sprite->GetMovable ()->SetTransform (m);\n sprite->GetMovable ()->UpdateMove ();\n csRef<iSprite3DState> spstate (\n SCF_QUERY_INTERFACE (sprite->GetMeshObject (), iSprite3DState));\n spstate->SetAction (\"default\");\n \/\/spstate->SetMixMode (CS_FX_SETALPHA (.5));\n\n \/\/ The following two calls are not needed since CS_ZBUF_USE and\n \/\/ Object render priority are the default but they show how you\n \/\/ can do this.\n sprite->SetZBufMode (CS_ZBUF_USE);\n sprite->SetRenderPriority (engine->GetObjectRenderPriority ());\n\n csRef<iMeshFactoryWrapper> factwrap = engine->CreateMeshFactory (\n \t\"crystalspace.mesh.object.sprite.2d\", \"label\");\n csRef<iMeshWrapper> wrap = engine->CreateMeshWrapper (factwrap,\n \t\"labelmesh\");\n csRef<iSprite2DState> sp2state = SCF_QUERY_INTERFACE (wrap->GetMeshObject (),\n \tiSprite2DState);\n\n {\n csColoredVertices& vertices = sp2state->GetVertices();\n vertices.SetLength (4);\n vertices[3].pos.Set (-2, -.5);\n vertices[3].u = 0; vertices[0].v = 0;\n vertices[3].color_init.Set (1, 1, 1);\n vertices[2].pos.Set (2, -.5);\n vertices[2].u = 1; vertices[1].v = 0;\n vertices[2].color_init.Set (1, 1, 1);\n vertices[1].pos.Set (2, .5);\n vertices[1].u = 1; vertices[2].v = 1;\n vertices[1].color_init.Set (1, 1, 1);\n vertices[0].pos.Set (-2, .5);\n vertices[0].u = 0; vertices[3].v = 1;\n vertices[0].color_init.Set (1, 1, 1);\n\n iGraphics2D* g2d = g3d->GetDriver2D ();\n csRef<iFont> font = g2d->GetFontServer ()->LoadFont (CSFONT_COURIER);\n csColor transp (51\/255.0F,51\/255.0F,254\/255.0F);\n csRef<iTextureWrapper> txt = engine->CreateBlackTexture (\"xxx\",\n \t128, 32, &transp , CS_TEXTURE_3D);\n txt->Register (txtmgr);\n\n csRef<iMaterialWrapper> mat = engine->CreateMaterial (\"xxx\", txt);\n mat->Register (txtmgr);\n g3d->SetRenderTarget (mat->GetMaterialHandle ()->GetTexture ());\n g3d->BeginDraw (CSDRAW_2DGRAPHICS);\n g2d->Clear (g2d->FindRGB (51, 51, 254));\n g2d->Write (font, 10, 10, g2d->FindRGB (255, 0, 0), -1, \"TestING\",\n \tCS_WRITE_NOANTIALIAS);\n \/\/ Interesting line below: If the drawline is removed the text\n \/\/ does NOT display for me! JORRIT\n g2d->DrawLine (0, 0, 127, 31, g2d->FindRGB (0, 255, 0));\n g3d->FinishDraw ();\n sp2state->SetMaterialWrapper (mat);\n }\n\n\n sprite->GetChildren ()->Add (wrap);\n wrap->GetMovable ()->SetPosition (csVector3 (0, 2, 0));\n wrap->GetMovable ()->UpdateMove ();\n}\n\/*-------------------------------------------------------------------------*\n * Main function\n *-------------------------------------------------------------------------*\/\nint main (int argc, char* argv[])\n{\n return Simple().Main(argc, argv);\n}\n<commit_msg>Whoops!<commit_after>\/*\n Copyright (C) 2001 by Jorrit Tyberghein\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License as published by the Free Software Foundation; either\n version 2 of the License, or (at your option) any later version.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public\n License along with this library; if not, write to the Free\n Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.\n*\/\n\n#include \"simple2.h\"\n\nCS_IMPLEMENT_APPLICATION\n\n\/\/-----------------------------------------------------------------------------\n\nSimple::Simple ()\n{\n SetApplicationName (\"CrystalSpace.Simple2\");\n}\n\nSimple::~Simple ()\n{\n}\n\nvoid Simple::ProcessFrame ()\n{\n \/\/ First get elapsed time from the virtual clock.\n csTicks elapsed_time = vc->GetElapsedTicks ();\n \/\/ Now rotate the camera according to keyboard state\n float speed = (elapsed_time \/ 1000.0) * (0.06 * 20);\n\n iCamera* c = view->GetCamera();\n\n if (kbd->GetKeyState (CSKEY_SHIFT))\n {\n \/\/ If the user is holding down shift, the arrow keys will cause\n \/\/ the camera to strafe up, down, left or right from it's\n \/\/ current position.\n if (kbd->GetKeyState (CSKEY_RIGHT))\n c->Move (CS_VEC_RIGHT * 4 * speed);\n if (kbd->GetKeyState (CSKEY_LEFT))\n c->Move (CS_VEC_LEFT * 4 * speed);\n if (kbd->GetKeyState (CSKEY_UP))\n c->Move (CS_VEC_UP * 4 * speed);\n if (kbd->GetKeyState (CSKEY_DOWN))\n c->Move (CS_VEC_DOWN * 4 * speed);\n }\n else\n {\n \/\/ left and right cause the camera to rotate on the global Y\n \/\/ axis; page up and page down cause the camera to rotate on the\n \/\/ _camera's_ X axis (more on this in a second) and up and down\n \/\/ arrows cause the camera to go forwards and backwards.\n if (kbd->GetKeyState (CSKEY_RIGHT))\n rotY += speed;\n if (kbd->GetKeyState (CSKEY_LEFT))\n rotY -= speed;\n if (kbd->GetKeyState (CSKEY_PGUP))\n rotX += speed;\n if (kbd->GetKeyState (CSKEY_PGDN))\n rotX -= speed;\n if (kbd->GetKeyState (CSKEY_UP))\n c->Move (CS_VEC_FORWARD * 4 * speed);\n if (kbd->GetKeyState (CSKEY_DOWN))\n c->Move (CS_VEC_BACKWARD * 4 * speed);\n }\n\n \/\/ We now assign a new rotation transformation to the camera. You\n \/\/ can think of the rotation this way: starting from the zero\n \/\/ position, you first rotate \"rotY\" radians on your Y axis to get\n \/\/ the first rotation. From there you rotate \"rotX\" radians on the\n \/\/ your X axis to get the final rotation. We multiply the\n \/\/ individual rotations on each axis together to get a single\n \/\/ rotation matrix. The rotations are applied in right to left\n \/\/ order .\n csMatrix3 rot = csXRotMatrix3 (rotX) * csYRotMatrix3 (rotY);\n csOrthoTransform ot (rot, c->GetTransform().GetOrigin ());\n c->SetTransform (ot);\n\n \/\/ Tell 3D driver we're going to display 3D things.\n if (!g3d->BeginDraw (engine->GetBeginDrawFlags () | CSDRAW_3DGRAPHICS))\n return;\n\n \/\/ Tell the camera to render into the frame buffer.\n view->Draw ();\n}\n\nvoid Simple::FinishFrame ()\n{\n \/\/ Just tell the 3D renderer that everything has been rendered.\n g3d->FinishDraw ();\n g3d->Print (0);\n}\n\nbool Simple::OnKeyboard(iEvent& ev)\n{\n \/\/ We got a keyboard event.\n csKeyEventType eventtype = csKeyEventHelper::GetEventType(&ev);\n if (eventtype == csKeyEventTypeDown)\n {\n \/\/ The user pressed a key (as opposed to releasing it).\n utf32_char code = csKeyEventHelper::GetCookedCode(&ev);\n if (code == CSKEY_ESC)\n {\n \/\/ The user pressed escape to exit the application.\n \/\/ The proper way to quit a Crystal Space application\n \/\/ is by broadcasting a cscmdQuit event. That will cause the\n \/\/ main runloop to stop. To do that we get the event queue from\n \/\/ the object registry and then post the event.\n csRef<iEventQueue> q = \n CS_QUERY_REGISTRY(GetObjectRegistry(), iEventQueue);\n if (q.IsValid()) q->GetEventOutlet()->Broadcast(cscmdQuit);\n }\n }\n return false;\n}\n\nbool Simple::OnInitialize(int argc, char* argv[])\n{\n \/\/ RequestPlugins() will load all plugins we specify. In addition\n \/\/ it will also check if there are plugins that need to be loaded\n \/\/ from the config system (both the application config and CS or\n \/\/ global configs). In addition it also supports specifying plugins\n \/\/ on the commandline.\n if (!csInitializer::RequestPlugins(GetObjectRegistry(),\n CS_REQUEST_VFS,\n CS_REQUEST_OPENGL3D,\n CS_REQUEST_ENGINE,\n CS_REQUEST_FONTSERVER,\n CS_REQUEST_IMAGELOADER,\n CS_REQUEST_LEVELLOADER,\n CS_REQUEST_REPORTER,\n CS_REQUEST_REPORTERLISTENER,\n CS_REQUEST_END))\n return ReportError(\"Failed to initialize plugins!\");\n\n \/\/ Now we need to setup an event handler for our application.\n \/\/ Crystal Space is fully event-driven. Everything (except for this\n \/\/ initialization) happens in an event.\n if (!RegisterQueue(GetObjectRegistry()))\n return ReportError(\"Failed to set up event handler!\");\n\n return true;\n}\n\nvoid Simple::OnExit()\n{\n}\n\nbool Simple::Application()\n{\n \/\/ Open the main system. This will open all the previously loaded plug-ins.\n \/\/ i.e. all windows will be opened.\n if (!OpenApplication(GetObjectRegistry()))\n return ReportError(\"Error opening system!\");\n\n \/\/ Now get the pointer to various modules we need. We fetch them\n \/\/ from the object registry. The RequestPlugins() call we did earlier\n \/\/ registered all loaded plugins with the object registry.\n \/\/ The virtual clock.\n g3d = CS_QUERY_REGISTRY(GetObjectRegistry(), iGraphics3D);\n if (!g3d) return ReportError(\"Failed to locate 3D renderer!\");\n\n engine = CS_QUERY_REGISTRY(GetObjectRegistry(), iEngine);\n if (!engine) return ReportError(\"Failed to locate 3D engine!\");\n\n vc = CS_QUERY_REGISTRY(GetObjectRegistry(), iVirtualClock);\n if (!vc) return ReportError(\"Failed to locate Virtual Clock!\");\n\n kbd = CS_QUERY_REGISTRY(GetObjectRegistry(), iKeyboardDriver);\n if (!kbd) return ReportError(\"Failed to locate Keyboard Driver!\");\n\n loader = CS_QUERY_REGISTRY(GetObjectRegistry(), iLoader);\n if (!loader) return ReportError(\"Failed to locate Loader!\");\n\n \/\/ We need a View to the virtual world.\n view.AttachNew(new csView (engine, g3d));\n iGraphics2D* g2d = g3d->GetDriver2D ();\n \/\/ We use the full window to draw the world.\n view->SetRectangle (0, 0, g2d->GetWidth (), g2d->GetHeight ());\n\n \/\/ First disable the lighting cache. Our app is simple enough\n \/\/ not to need this.\n engine->SetLightingCacheMode (0);\n\n \/\/ Here we create our world.\n CreateRoom();\n\n \/\/ Here we create our world.\n CreateSprites();\n\n \/\/ Let the engine prepare all lightmaps for use and also free all images \n \/\/ that were loaded for the texture manager.\n engine->Prepare ();\n\n \/\/ these are used store the current orientation of the camera\n rotY = rotX = 0;\n\n \/\/ Now we need to position the camera in our world.\n view->GetCamera ()->SetSector (room);\n view->GetCamera ()->GetTransform ().SetOrigin (csVector3 (0, 5, -3));\n\n \/\/ This calls the default runloop. This will basically just keep\n \/\/ broadcasting process events to keep the game going.\n Run();\n\n return true;\n}\n\n\nvoid Simple::CreateRoom ()\n{\n \/\/ Load the texture from the standard library. This is located in\n \/\/ CS\/data\/standard.zip and mounted as \/lib\/std using the Virtual\n \/\/ File System (VFS) plugin.\n if (!loader->LoadTexture (\"stone\", \"\/lib\/std\/stone4.gif\"))\n ReportError(\"Error loading 'stone4' texture!\");\n\n iMaterialWrapper* tm = engine->GetMaterialList ()->FindByName (\"stone\");\n\n \/\/ We create a new sector called \"room\".\n room = engine->CreateSector (\"room\");\n\n \/\/ Creating the walls for our room.\n csRef<iMeshWrapper> walls (engine->CreateSectorWallsMesh (room, \"walls\"));\n csRef<iThingState> ws =\n SCF_QUERY_INTERFACE (walls->GetMeshObject (), iThingState);\n csRef<iThingFactoryState> walls_state = ws->GetFactory ();\n walls_state->AddInsideBox (csVector3 (-5, 0, -5), csVector3 (5, 20, 5));\n walls_state->SetPolygonMaterial (CS_POLYRANGE_LAST, tm);\n walls_state->SetPolygonTextureMapping (CS_POLYRANGE_LAST, 3);\n\n \/\/ Now we need light to see something.\n csRef<iLight> light;\n iLightList* ll = room->GetLights ();\n\n light = engine->CreateLight(0, csVector3(-3, 5, 0), 10, csColor(1, 0, 0));\n ll->Add (light);\n\n light = engine->CreateLight(0, csVector3(3, 5, 0), 10, csColor(0, 0, 1));\n ll->Add (light);\n\n light = engine->CreateLight(0, csVector3(0, 5, -3), 10, csColor(0, 1, 0));\n ll->Add (light);\n}\n\nvoid Simple::CreateSprites ()\n{\n \/\/ Load a texture for our sprite.\n iTextureManager* txtmgr = g3d->GetTextureManager ();\n iTextureWrapper* txt = loader->LoadTexture (\"spark\",\n \"\/lib\/std\/spark.png\", CS_TEXTURE_3D, txtmgr, true);\n if (txt == 0)\n ReportError(\"Error loading texture!\");\n\n \/\/ Load a sprite template from disk.\n csRef<iMeshFactoryWrapper> imeshfact (\n loader->LoadMeshObjectFactory (\"\/lib\/std\/sprite1\"));\n if (imeshfact == 0)\n ReportError(\"Error loading mesh object factory!\");\n\n \/\/ Create the sprite and add it to the engine.\n csRef<iMeshWrapper> sprite (engine->CreateMeshWrapper (\n imeshfact, \"MySprite\", room,\n csVector3 (-3, 5, 3)));\n csMatrix3 m; m.Identity ();\n sprite->GetMovable ()->SetTransform (m);\n sprite->GetMovable ()->UpdateMove ();\n csRef<iSprite3DState> spstate (\n SCF_QUERY_INTERFACE (sprite->GetMeshObject (), iSprite3DState));\n spstate->SetAction (\"default\");\n \/\/spstate->SetMixMode (CS_FX_SETALPHA (.5));\n\n \/\/ The following two calls are not needed since CS_ZBUF_USE and\n \/\/ Object render priority are the default but they show how you\n \/\/ can do this.\n sprite->SetZBufMode (CS_ZBUF_USE);\n sprite->SetRenderPriority (engine->GetObjectRenderPriority ());\n}\n\/*-------------------------------------------------------------------------*\n * Main function\n *-------------------------------------------------------------------------*\/\nint main (int argc, char* argv[])\n{\n return Simple().Main(argc, argv);\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ bsls_byteorderutil.cpp -*-C++-*-\n#include <bsls_byteorderutil.h>\n\n#include <bsls_ident.h>\nBSLS_IDENT(\"$Id$ $CSID$\")\n\n#include <bsls_bsltestutil.h> \/\/ for testing only\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2014 Bloomberg Finance L.P.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<commit_msg>bsls_byuteorderutil -- includes for testing<commit_after>\/\/ bsls_byteorderutil.cpp -*-C++-*-\n#include <bsls_byteorderutil.h>\n\n#include <bsls_ident.h>\nBSLS_IDENT(\"$Id$ $CSID$\")\n\n#include <bsls_assert.h> \/\/ for testing only\n#include <bsls_bsltestutil.h> \/\/ for testing only\n#include <bsls_stopwatch.h> \/\/ for testing only\n\n\/\/ ----------------------------------------------------------------------------\n\/\/ Copyright 2014 Bloomberg Finance L.P.\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\/\/ ----------------------------- END-OF-FILE ----------------------------------\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2015 FMAW\n\n#include <sstream>\n#include <cstdlib>\n#include <fat.h>\n#include <nds.h>\n\n#include \".\/FMAW.h\" \/\/ Import our awesome framework!\n\n\/\/------------------------------------------------------------------------------\n\/\/ Graphic references\n\/\/------------------------------------------------------------------------------\n\n#include \".\/warrior.h\"\n\n#include \".\/gfx_brick.h\"\n#include \".\/gfx_gradient.h\"\n\n#include \".\/gfx_black.h\"\n#include \".\/gfx_blank.h\"\n\n#include \".\/gfx_Base.h\"\n#include \".\/gfx_Bridge.h\"\n#include \".\/gfx_Forest.h\"\n#include \".\/gfx_Grass.h\"\n#include \".\/gfx_Mountain.h\"\n#include \".\/gfx_River.h\"\n\n\/\/------------------------------------------------------------------------------\n\/\/ Background tile entries\n\/\/------------------------------------------------------------------------------\n\n#define TILE_EMPTY 0 \/\/ Tile 0 = empty\n#define TILE_BRICK 1 \/\/ Tile 1 = brick\n#define TILE_GRADIENT 2 \/\/ Tile 2 = gradient\n\n\/\/------------------------------------------------------------------------------\n\/\/ Background...\n\/\/------------------------------------------------------------------------------\n\n\/\/----------\/\/------------------------------------------------------------------\n\/\/----------\/\/ Palette entries\n\/\/----------\/\/------------------------------------------------------------------\n\n#define PAL_BRICKS 0 \/\/ Brick palette (entry 0->15).\n#define PAL_GRADIENT 1 \/\/ Gradient palette (entry 16->31).\n\n#define BACKDROP_COLOR RGB8(190, 255, 255)\n\n\/\/------------------------------------------------------------------------------\n\/\/ Game objects\n\/\/------------------------------------------------------------------------------\n\n#include \".\/grid.h\"\n#include \".\/gridmap.h\"\n\nGrid grid;\n\nFMAW::FixedReal g_camera_x;\nFMAW::FixedReal g_camera_y;\n\n\/\/------------------------------------------------------------------------------\n\/\/ Main code section\n\/\/------------------------------------------------------------------------------\n\n\/**\n * Sets up graphics.\n * Calling this method will require to reinitialize all sprites!\n *\/\nvoid setupGraphics(void) {\n FMAW::TileAttributes blank_tile_attributes {\n gfx_blankTiles,\n gfx_blankTilesLen,\n gfx_blankPal,\n gfx_blankPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile blank_tile(blank_tile_attributes);\n\n FMAW::TileAttributes black_tile_attributes {\n gfx_blackTiles,\n gfx_blackTilesLen,\n gfx_blackPal,\n gfx_blackPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile black_tile(black_tile_attributes);\n FMAW::printf(\"El fondo negro tiene ID=%d\", black_tile.ID);\n\n FMAW::TileAttributes brick_tile_attributes {\n gfx_brickTiles,\n gfx_brickTilesLen,\n gfx_brickPal,\n gfx_brickPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile brick_tile(brick_tile_attributes);\n FMAW::printf(\"El fondo de ladrillo tiene ID=%d\", brick_tile.ID);\n\n \/\/------------------------------------------------------------------------\/\/\n\n FMAW::TileAttributes gfx_Base_attributes {\n gfx_BaseTiles,\n gfx_BaseTilesLen,\n gfx_BasePal,\n gfx_BasePalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile base_tile(gfx_Base_attributes);\n FMAW::printf(\"El fondo Base tiene ID=%d\", base_tile.ID);\n\n FMAW::TileAttributes gfx_Bridge_attributes {\n gfx_BridgeTiles,\n gfx_BridgeTilesLen,\n gfx_BridgePal,\n gfx_BridgePalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Bridge_tile(gfx_Bridge_attributes);\n FMAW::printf(\"El fondo Bridge tiene ID=%d\", Bridge_tile.ID);\n\n FMAW::TileAttributes gfx_Forest_attributes {\n gfx_ForestTiles,\n gfx_ForestTilesLen,\n gfx_ForestPal,\n gfx_ForestPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Forest_tile(gfx_Forest_attributes);\n FMAW::printf(\"El fondo Forest tiene ID=%d\", Forest_tile.ID);\n\n FMAW::TileAttributes gfx_Grass_attributes {\n gfx_GrassTiles,\n gfx_GrassTilesLen,\n gfx_GrassPal,\n gfx_GrassPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Grass_tile(gfx_Grass_attributes);\n FMAW::printf(\"El fondo Grass tiene ID=%d\", Grass_tile.ID);\n\n FMAW::TileAttributes gfx_Mountain_attributes {\n gfx_MountainTiles,\n gfx_MountainTilesLen,\n gfx_MountainPal,\n gfx_MountainPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Mountain_tile(gfx_Mountain_attributes);\n FMAW::printf(\"El fondo Mountain tiene ID=%d\", Mountain_tile.ID);\n\n FMAW::TileAttributes gfx_River_attributes {\n gfx_RiverTiles,\n gfx_RiverTilesLen,\n gfx_RiverPal,\n gfx_RiverPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile River_tile(gfx_River_attributes);\n FMAW::printf(\"El fondo River tiene ID=%d\", River_tile.ID);\n\n \/\/------------------------------------------------------------------------\/\/\n\n \/\/ Set backdrop color.\n FMAW::setBackgroundColor(BACKDROP_COLOR);\n\n FMAW::Background bgBricks(0);\n bgBricks.setScreenBaseBlock(2);\n\n FMAW::Background(1).setScreenBaseBlock(3);\n FMAW::Background(2).setScreenBaseBlock(4);\n FMAW::Background(3).setScreenBaseBlock(5);\n\n \/\/ Clear entire bricks' tilemap and gradient's tilemap to zero\n bgBricks.clearAllTiles();\n\n \/\/ Set tilemap entries for 6 first rows of background 0 (bricks).\n for (int y = 0; y < 6; y++) {\n for (int x = 0; x < 32; x++) {\n int tile_id = x + y * 32; \/\/ Product optimized at compile time!\n\n \/\/ Either odd columns of even rows or even columns of odd rows...\n \/\/ if (( x % 2 == 0 && y % 2 == 1 ) || (x % 2 == 1 && y % 2 == 0 ))\n if ((x & 1) ^ (y & 1))\n bgBricks.enableHorizontalFlip(tile_id);\n\n bgBricks.setTile(tile_id, brick_tile);\n }\n }\n \/\/ Did we say 6 first rows? We wanted 6 LAST rows!\n \/\/ bgBricks.setVerticalOffset(112);\n\n\tGridMap::loadDefaultGridMap( grid );\n grid.renderBackground();\n}\n\nvoid update_camera() { }\n\nvoid update_logic() {\n FMAW::Input::check();\n FMAW::Timer::check();\n update_camera();\n}\n\nvoid update_graphics() {\n FMAW::Camera::setHorizontalOffset(g_camera_x);\n grid.renderCharacters();\n}\n\nint main(void) {\n\tfatInitDefault();\n FMAW::init();\n setupGraphics();\n\n auto pulsaFlechaIzquierda = []() {\n FMAW::printf(\"Has pulsado la flecha izquierda\");\n };\n FMAW::Input::onButtonArrowLeftPressed(pulsaFlechaIzquierda);\n\n auto mantenFlechaIzquierda = []() {\n FMAW::printf(\"Mantienes la flecha izquierda pulsada\");\n };\n FMAW::Input::whileButtonArrowLeftPressed(mantenFlechaIzquierda);\n\n auto sueltaFlechaIzquierda = []() {\n FMAW::printf(\"Has soltado la flecha izquierda\");\n };\n FMAW::Input::onButtonArrowLeftReleased(sueltaFlechaIzquierda);\n\n \/\/grid.cellAtIndexPath({3, 6})->setBackgroundType(CellBGMountain);\n\n \/\/grid.cellAtIndexPath({4, 4})->setBackgroundType(CellBGRiver);\n\n Warrior warrior;\n grid.cellAtIndexPath({0, 0})->setCharacter(&warrior);\n\n auto func = [&warrior](int ID) {\n warrior.update();\n };\n\n FMAW::Timer::enqueue_function(func, 200, true);\n\n int prev_col = 0;\n int prev_row = 0;\n\n auto move_warrior = [&prev_col, &prev_row, &warrior](int ID) {\n int new_col = (prev_col < grid.numCols()) ? prev_col + 1 : 0;\n int new_row = (new_col == 0) ? prev_row + 1 : prev_row;\n\n FMAW::printf(\"La guerrera se mueve de %d %d a %d %d!\",\n prev_row, prev_col,\n new_row, new_col);\n grid.moveCharacterFromCellToCell({prev_row, prev_col}, {new_row, new_col}, 100);\n\n prev_col = new_col;\n prev_row = new_row;\n };\n\n FMAW::Timer::enqueue_function(move_warrior, 5000, true);\n\n grid.renderBackground();\n\n while (1) {\n \/\/ Rendering period:\n \/\/ Update game objects.\n update_logic();\n\n \/\/ Wait for the vblank period.\n swiWaitForVBlank();\n\n \/\/ VBlank period: (safe yo modify graphics)\n \/\/ Move the graphics around.\n update_graphics();\n }\n\n return 0;\n}\n<commit_msg>Minor style changes.<commit_after>\/\/ Copyright 2015 FMAW\n\n#include <fat.h>\n#include <nds.h>\n#include <sstream>\n#include <cstdlib>\n\n#include \".\/FMAW.h\" \/\/ Import our awesome framework!\n\n\/\/------------------------------------------------------------------------------\n\/\/ Graphic references\n\/\/------------------------------------------------------------------------------\n\n#include \".\/warrior.h\"\n\n#include \".\/gfx_brick.h\"\n#include \".\/gfx_gradient.h\"\n\n#include \".\/gfx_black.h\"\n#include \".\/gfx_blank.h\"\n\n#include \".\/gfx_Base.h\"\n#include \".\/gfx_Bridge.h\"\n#include \".\/gfx_Forest.h\"\n#include \".\/gfx_Grass.h\"\n#include \".\/gfx_Mountain.h\"\n#include \".\/gfx_River.h\"\n\n\/\/------------------------------------------------------------------------------\n\/\/ Background tile entries\n\/\/------------------------------------------------------------------------------\n\n#define TILE_EMPTY 0 \/\/ Tile 0 = empty\n#define TILE_BRICK 1 \/\/ Tile 1 = brick\n#define TILE_GRADIENT 2 \/\/ Tile 2 = gradient\n\n\/\/------------------------------------------------------------------------------\n\/\/ Background...\n\/\/------------------------------------------------------------------------------\n\n\/\/----------\/\/------------------------------------------------------------------\n\/\/----------\/\/ Palette entries\n\/\/----------\/\/------------------------------------------------------------------\n\n#define PAL_BRICKS 0 \/\/ Brick palette (entry 0->15).\n#define PAL_GRADIENT 1 \/\/ Gradient palette (entry 16->31).\n\n#define BACKDROP_COLOR RGB8(190, 255, 255)\n\n\/\/------------------------------------------------------------------------------\n\/\/ Game objects\n\/\/------------------------------------------------------------------------------\n\n#include \".\/grid.h\"\n#include \".\/gridmap.h\"\n\nGrid grid;\n\nFMAW::FixedReal g_camera_x;\nFMAW::FixedReal g_camera_y;\n\n\/\/------------------------------------------------------------------------------\n\/\/ Main code section\n\/\/------------------------------------------------------------------------------\n\n\/**\n * Sets up graphics.\n * Calling this method will require to reinitialize all sprites!\n *\/\nvoid setupGraphics(void) {\n FMAW::TileAttributes blank_tile_attributes {\n gfx_blankTiles,\n gfx_blankTilesLen,\n gfx_blankPal,\n gfx_blankPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile blank_tile(blank_tile_attributes);\n\n FMAW::TileAttributes black_tile_attributes {\n gfx_blackTiles,\n gfx_blackTilesLen,\n gfx_blackPal,\n gfx_blackPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile black_tile(black_tile_attributes);\n FMAW::printf(\"El fondo negro tiene ID=%d\", black_tile.ID);\n\n FMAW::TileAttributes brick_tile_attributes {\n gfx_brickTiles,\n gfx_brickTilesLen,\n gfx_brickPal,\n gfx_brickPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile brick_tile(brick_tile_attributes);\n FMAW::printf(\"El fondo de ladrillo tiene ID=%d\", brick_tile.ID);\n\n \/\/------------------------------------------------------------------------\/\/\n\n FMAW::TileAttributes gfx_Base_attributes {\n gfx_BaseTiles,\n gfx_BaseTilesLen,\n gfx_BasePal,\n gfx_BasePalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile base_tile(gfx_Base_attributes);\n FMAW::printf(\"El fondo Base tiene ID=%d\", base_tile.ID);\n\n FMAW::TileAttributes gfx_Bridge_attributes {\n gfx_BridgeTiles,\n gfx_BridgeTilesLen,\n gfx_BridgePal,\n gfx_BridgePalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Bridge_tile(gfx_Bridge_attributes);\n FMAW::printf(\"El fondo Bridge tiene ID=%d\", Bridge_tile.ID);\n\n FMAW::TileAttributes gfx_Forest_attributes {\n gfx_ForestTiles,\n gfx_ForestTilesLen,\n gfx_ForestPal,\n gfx_ForestPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Forest_tile(gfx_Forest_attributes);\n FMAW::printf(\"El fondo Forest tiene ID=%d\", Forest_tile.ID);\n\n FMAW::TileAttributes gfx_Grass_attributes {\n gfx_GrassTiles,\n gfx_GrassTilesLen,\n gfx_GrassPal,\n gfx_GrassPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Grass_tile(gfx_Grass_attributes);\n FMAW::printf(\"El fondo Grass tiene ID=%d\", Grass_tile.ID);\n\n FMAW::TileAttributes gfx_Mountain_attributes {\n gfx_MountainTiles,\n gfx_MountainTilesLen,\n gfx_MountainPal,\n gfx_MountainPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile Mountain_tile(gfx_Mountain_attributes);\n FMAW::printf(\"El fondo Mountain tiene ID=%d\", Mountain_tile.ID);\n\n FMAW::TileAttributes gfx_River_attributes {\n gfx_RiverTiles,\n gfx_RiverTilesLen,\n gfx_RiverPal,\n gfx_RiverPalLen,\n FMAW::TypeBackground\n };\n FMAW::Tile River_tile(gfx_River_attributes);\n FMAW::printf(\"El fondo River tiene ID=%d\", River_tile.ID);\n\n \/\/------------------------------------------------------------------------\/\/\n\n \/\/ Set backdrop color.\n FMAW::setBackgroundColor(BACKDROP_COLOR);\n\n FMAW::Background bgBricks(0);\n bgBricks.setScreenBaseBlock(2);\n\n FMAW::Background(1).setScreenBaseBlock(3);\n FMAW::Background(2).setScreenBaseBlock(4);\n FMAW::Background(3).setScreenBaseBlock(5);\n\n \/\/ Clear entire bricks' tilemap and gradient's tilemap to zero\n bgBricks.clearAllTiles();\n\n \/\/ Set tilemap entries for 6 first rows of background 0 (bricks).\n for (int y = 0; y < 6; y++) {\n for (int x = 0; x < 32; x++) {\n int tile_id = x + y * 32; \/\/ Product optimized at compile time!\n\n \/\/ Either odd columns of even rows or even columns of odd rows...\n \/\/ if (( x % 2 == 0 && y % 2 == 1 ) || (x % 2 == 1 && y % 2 == 0 ))\n if ((x & 1) ^ (y & 1))\n bgBricks.enableHorizontalFlip(tile_id);\n\n bgBricks.setTile(tile_id, brick_tile);\n }\n }\n \/\/ Did we say 6 first rows? We wanted 6 LAST rows!\n \/\/ bgBricks.setVerticalOffset(112);\n\n grid.renderBackground();\n}\n\nvoid update_camera() { }\n\nvoid update_logic() {\n FMAW::Input::check();\n FMAW::Timer::check();\n update_camera();\n}\n\nvoid update_graphics() {\n FMAW::Camera::setHorizontalOffset(g_camera_x);\n grid.renderCharacters();\n}\n\nint main(void) {\n fatInitDefault();\n FMAW::init();\n setupGraphics();\n\n auto pulsaFlechaIzquierda = []() {\n FMAW::printf(\"Has pulsado la flecha izquierda\");\n };\n FMAW::Input::onButtonArrowLeftPressed(pulsaFlechaIzquierda);\n\n auto mantenFlechaIzquierda = []() {\n FMAW::printf(\"Mantienes la flecha izquierda pulsada\");\n };\n FMAW::Input::whileButtonArrowLeftPressed(mantenFlechaIzquierda);\n\n auto sueltaFlechaIzquierda = []() {\n FMAW::printf(\"Has soltado la flecha izquierda\");\n };\n FMAW::Input::onButtonArrowLeftReleased(sueltaFlechaIzquierda);\n\n Warrior warrior;\n grid.cellAtIndexPath({0, 0})->setCharacter(&warrior);\n\n auto func = [&warrior](int ID) {\n warrior.update();\n };\n\n FMAW::Timer::enqueue_function(func, 200, true);\n\n int prev_col = 0;\n int prev_row = 0;\n\n auto move_warrior = [&prev_col, &prev_row, &warrior](int ID) {\n int new_col = (prev_col < grid.numCols()) ? prev_col + 1 : 0;\n int new_row = (new_col == 0) ? prev_row + 1 : prev_row;\n\n FMAW::printf(\"La guerrera se mueve de %d %d a %d %d!\",\n prev_row, prev_col,\n new_row, new_col);\n grid.moveCharacterFromCellToCell({prev_row, prev_col}, {new_row, new_col}, 100);\n\n prev_col = new_col;\n prev_row = new_row;\n };\n\n FMAW::Timer::enqueue_function(move_warrior, 5000, true);\n\n GridMap::loadDefaultGridMap(grid);\n grid.renderBackground();\n\n while (1) {\n \/\/ Rendering period:\n \/\/ Update game objects.\n update_logic();\n\n \/\/ Wait for the vblank period.\n swiWaitForVBlank();\n\n \/\/ VBlank period: (safe yo modify graphics)\n \/\/ Move the graphics around.\n update_graphics();\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/ By downloading, copying, installing or using the software you agree to this license.\n\/\/ If you do not agree to this license, do not download, install,\n\/\/ copy or use the software.\n\/\/\n\/\/\n\/\/ Intel License Agreement\n\/\/ For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright( C) 2000, Intel Corporation, all rights reserved.\n\/\/ Third party copyrights are property of their respective owners.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification,\n\/\/ are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistribution's of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistribution's in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * The name of Intel Corporation may not be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ This software is provided by the copyright holders and contributors \"as is\" and\n\/\/ any express or implied warranties, including, but not limited to, the implied\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\n\/\/ indirect, incidental, special, exemplary, or consequential damages\n\/\/(including, but not limited to, procurement of substitute goods or services;\n\/\/ loss of use, data, or profits; or business interruption) however caused\n\/\/ and on any theory of liability, whether in contract, strict liability,\n\/\/ or tort(including negligence or otherwise) arising in any way out of\n\/\/ the use of this software, even if advised of the possibility of such damage.\n\/\/\n\/\/M*\/\n\n\/*\n definition of the current version of OpenCV\n Usefull to test in user programs\n*\/\n\n#ifndef __OPENCV_VERSION_HPP__\n#define __OPENCV_VERSION_HPP__\n\n#define CV_VERSION_EPOCH 2\n#define CV_VERSION_MAJOR 4\n#define CV_VERSION_MINOR 6\n#define CV_VERSION_REVISION 1\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#if CV_VERSION_REVISION\n# define CV_VERSION CVAUX_STR(CV_VERSION_EPOCH) \".\" CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION)\n#else\n# define CV_VERSION CVAUX_STR(CV_VERSION_EPOCH) \".\" CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR)\n#endif\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_EPOCH\n#define CV_MINOR_VERSION CV_VERSION_MAJOR\n#define CV_SUBMINOR_VERSION CV_VERSION_MINOR\n\n#endif\n<commit_msg>OpenCV version++. Current OpenCv version 2.4.6.2<commit_after>\/*M\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.\n\/\/\n\/\/ By downloading, copying, installing or using the software you agree to this license.\n\/\/ If you do not agree to this license, do not download, install,\n\/\/ copy or use the software.\n\/\/\n\/\/\n\/\/ Intel License Agreement\n\/\/ For Open Source Computer Vision Library\n\/\/\n\/\/ Copyright( C) 2000, Intel Corporation, all rights reserved.\n\/\/ Third party copyrights are property of their respective owners.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without modification,\n\/\/ are permitted provided that the following conditions are met:\n\/\/\n\/\/ * Redistribution's of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/\n\/\/ * Redistribution's in binary form must reproduce the above copyright notice,\n\/\/ this list of conditions and the following disclaimer in the documentation\n\/\/ and\/or other materials provided with the distribution.\n\/\/\n\/\/ * The name of Intel Corporation may not be used to endorse or promote products\n\/\/ derived from this software without specific prior written permission.\n\/\/\n\/\/ This software is provided by the copyright holders and contributors \"as is\" and\n\/\/ any express or implied warranties, including, but not limited to, the implied\n\/\/ warranties of merchantability and fitness for a particular purpose are disclaimed.\n\/\/ In no event shall the Intel Corporation or contributors be liable for any direct,\n\/\/ indirect, incidental, special, exemplary, or consequential damages\n\/\/(including, but not limited to, procurement of substitute goods or services;\n\/\/ loss of use, data, or profits; or business interruption) however caused\n\/\/ and on any theory of liability, whether in contract, strict liability,\n\/\/ or tort(including negligence or otherwise) arising in any way out of\n\/\/ the use of this software, even if advised of the possibility of such damage.\n\/\/\n\/\/M*\/\n\n\/*\n definition of the current version of OpenCV\n Usefull to test in user programs\n*\/\n\n#ifndef __OPENCV_VERSION_HPP__\n#define __OPENCV_VERSION_HPP__\n\n#define CV_VERSION_EPOCH 2\n#define CV_VERSION_MAJOR 4\n#define CV_VERSION_MINOR 6\n#define CV_VERSION_REVISION 2\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#if CV_VERSION_REVISION\n# define CV_VERSION CVAUX_STR(CV_VERSION_EPOCH) \".\" CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION)\n#else\n# define CV_VERSION CVAUX_STR(CV_VERSION_EPOCH) \".\" CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR)\n#endif\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_EPOCH\n#define CV_MINOR_VERSION CV_VERSION_MAJOR\n#define CV_SUBMINOR_VERSION CV_VERSION_MINOR\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/widget\/desktop_native_widget_aura.h\"\n\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/aura\/root_window_host.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/base\/hit_test.h\"\n#include \"ui\/compositor\/layer.h\"\n#include \"ui\/views\/widget\/desktop_root_window_host.h\"\n\nnamespace views {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, public:\n\nDesktopNativeWidgetAura::DesktopNativeWidgetAura(\n internal::NativeWidgetDelegate* delegate)\n : ALLOW_THIS_IN_INITIALIZER_LIST(window_(new aura::Window(this))),\n ownership_(Widget::InitParams::WIDGET_OWNS_NATIVE_WIDGET),\n native_widget_delegate_(delegate) {\n}\n\nDesktopNativeWidgetAura::~DesktopNativeWidgetAura() {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, internal::NativeWidgetPrivate implementation:\n\nvoid DesktopNativeWidgetAura::InitNativeWidget(\n const Widget::InitParams& params) {\n window_->Init(params.layer_type);\n window_->Show();\n\n desktop_root_window_host_ =\n DesktopRootWindowHost::Create(native_widget_delegate_, params.bounds);\n desktop_root_window_host_->Init(window_, params);\n}\n\nNonClientFrameView* DesktopNativeWidgetAura::CreateNonClientFrameView() {\n return NULL;\n}\n\nbool DesktopNativeWidgetAura::ShouldUseNativeFrame() const {\n return desktop_root_window_host_->ShouldUseNativeFrame();\n}\n\nvoid DesktopNativeWidgetAura::FrameTypeChanged() {\n}\n\nWidget* DesktopNativeWidgetAura::GetWidget() {\n return native_widget_delegate_->AsWidget();\n}\n\nconst Widget* DesktopNativeWidgetAura::GetWidget() const {\n return native_widget_delegate_->AsWidget();\n}\n\ngfx::NativeView DesktopNativeWidgetAura::GetNativeView() const {\n return window_;\n}\n\ngfx::NativeWindow DesktopNativeWidgetAura::GetNativeWindow() const {\n return window_;\n}\n\nWidget* DesktopNativeWidgetAura::GetTopLevelWidget() {\n return GetWidget();\n}\n\nconst ui::Compositor* DesktopNativeWidgetAura::GetCompositor() const {\n return window_->layer()->GetCompositor();\n}\n\nui::Compositor* DesktopNativeWidgetAura::GetCompositor() {\n return window_->layer()->GetCompositor();\n}\n\nvoid DesktopNativeWidgetAura::CalculateOffsetToAncestorWithLayer(\n gfx::Point* offset,\n ui::Layer** layer_parent) {\n}\n\nvoid DesktopNativeWidgetAura::ViewRemoved(View* view) {\n}\n\nvoid DesktopNativeWidgetAura::SetNativeWindowProperty(const char* name,\n void* value) {\n}\n\nvoid* DesktopNativeWidgetAura::GetNativeWindowProperty(const char* name) const {\n return NULL;\n}\n\nTooltipManager* DesktopNativeWidgetAura::GetTooltipManager() const {\n return NULL;\n}\n\nbool DesktopNativeWidgetAura::IsScreenReaderActive() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::SendNativeAccessibilityEvent(\n View* view,\n ui::AccessibilityTypes::Event event_type) {\n}\n\nvoid DesktopNativeWidgetAura::SetCapture() {\n window_->SetCapture();\n \/\/ aura::Window doesn't implicitly update capture on the RootWindowHost, so\n \/\/ we have to do that manually.\n if (!desktop_root_window_host_->HasCapture())\n window_->GetRootWindow()->SetNativeCapture();\n}\n\nvoid DesktopNativeWidgetAura::ReleaseCapture() {\n window_->ReleaseCapture();\n \/\/ aura::Window doesn't implicitly update capture on the RootWindowHost, so\n \/\/ we have to do that manually.\n if (desktop_root_window_host_->HasCapture())\n window_->GetRootWindow()->ReleaseNativeCapture();\n}\n\nbool DesktopNativeWidgetAura::HasCapture() const {\n return window_->HasCapture() && desktop_root_window_host_->HasCapture();\n}\n\nInputMethod* DesktopNativeWidgetAura::CreateInputMethod() {\n return desktop_root_window_host_->CreateInputMethod();\n}\n\ninternal::InputMethodDelegate*\n DesktopNativeWidgetAura::GetInputMethodDelegate() {\n return desktop_root_window_host_->GetInputMethodDelegate();\n}\n\nvoid DesktopNativeWidgetAura::CenterWindow(const gfx::Size& size) {\n desktop_root_window_host_->CenterWindow(size);\n}\n\nvoid DesktopNativeWidgetAura::GetWindowPlacement(\n gfx::Rect* bounds,\n ui::WindowShowState* maximized) const {\n desktop_root_window_host_->GetWindowPlacement(bounds, maximized);\n}\n\nvoid DesktopNativeWidgetAura::SetWindowTitle(const string16& title) {\n desktop_root_window_host_->SetWindowTitle(title);\n}\n\nvoid DesktopNativeWidgetAura::SetWindowIcons(const gfx::ImageSkia& window_icon,\n const gfx::ImageSkia& app_icon) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleName(const string16& name) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleRole(\n ui::AccessibilityTypes::Role role) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleState(\n ui::AccessibilityTypes::State state) {\n}\n\nvoid DesktopNativeWidgetAura::InitModalType(ui::ModalType modal_type) {\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetWindowBoundsInScreen() const {\n return desktop_root_window_host_->GetWindowBoundsInScreen();\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetClientAreaBoundsInScreen() const {\n return desktop_root_window_host_->GetClientAreaBoundsInScreen();\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetRestoredBounds() const {\n return desktop_root_window_host_->GetRestoredBounds();\n}\n\nvoid DesktopNativeWidgetAura::SetBounds(const gfx::Rect& bounds) {\n desktop_root_window_host_->AsRootWindowHost()->SetBounds(bounds);\n}\n\nvoid DesktopNativeWidgetAura::SetSize(const gfx::Size& size) {\n desktop_root_window_host_->SetSize(size);\n}\n\nvoid DesktopNativeWidgetAura::StackAbove(gfx::NativeView native_view) {\n}\n\nvoid DesktopNativeWidgetAura::StackAtTop() {\n}\n\nvoid DesktopNativeWidgetAura::StackBelow(gfx::NativeView native_view) {\n}\n\nvoid DesktopNativeWidgetAura::SetShape(gfx::NativeRegion shape) {\n desktop_root_window_host_->SetShape(shape);\n}\n\nvoid DesktopNativeWidgetAura::Close() {\n desktop_root_window_host_->Close();\n}\n\nvoid DesktopNativeWidgetAura::CloseNow() {\n desktop_root_window_host_->CloseNow();\n}\n\nvoid DesktopNativeWidgetAura::Show() {\n desktop_root_window_host_->AsRootWindowHost()->Show();\n}\n\nvoid DesktopNativeWidgetAura::Hide() {\n desktop_root_window_host_->AsRootWindowHost()->Hide();\n}\n\nvoid DesktopNativeWidgetAura::ShowMaximizedWithBounds(\n const gfx::Rect& restored_bounds) {\n desktop_root_window_host_->ShowMaximizedWithBounds(restored_bounds);\n}\n\nvoid DesktopNativeWidgetAura::ShowWithWindowState(ui::WindowShowState state) {\n desktop_root_window_host_->ShowWindowWithState(state);\n}\n\nbool DesktopNativeWidgetAura::IsVisible() const {\n return desktop_root_window_host_->IsVisible();\n}\n\nvoid DesktopNativeWidgetAura::Activate() {\n desktop_root_window_host_->Activate();\n}\n\nvoid DesktopNativeWidgetAura::Deactivate() {\n desktop_root_window_host_->Deactivate();\n}\n\nbool DesktopNativeWidgetAura::IsActive() const {\n return desktop_root_window_host_->IsActive();\n}\n\nvoid DesktopNativeWidgetAura::SetAlwaysOnTop(bool always_on_top) {\n desktop_root_window_host_->SetAlwaysOnTop(always_on_top);\n}\n\nvoid DesktopNativeWidgetAura::Maximize() {\n desktop_root_window_host_->Maximize();\n}\n\nvoid DesktopNativeWidgetAura::Minimize() {\n desktop_root_window_host_->Minimize();\n}\n\nbool DesktopNativeWidgetAura::IsMaximized() const {\n return desktop_root_window_host_->IsMaximized();\n}\n\nbool DesktopNativeWidgetAura::IsMinimized() const {\n return desktop_root_window_host_->IsMinimized();\n}\n\nvoid DesktopNativeWidgetAura::Restore() {\n desktop_root_window_host_->Restore();\n}\n\nvoid DesktopNativeWidgetAura::SetFullscreen(bool fullscreen) {\n}\n\nbool DesktopNativeWidgetAura::IsFullscreen() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::SetOpacity(unsigned char opacity) {\n}\n\nvoid DesktopNativeWidgetAura::SetUseDragFrame(bool use_drag_frame) {\n}\n\nvoid DesktopNativeWidgetAura::FlashFrame(bool flash_frame) {\n}\n\nbool DesktopNativeWidgetAura::IsAccessibleWidget() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::RunShellDrag(View* view,\n const ui::OSExchangeData& data,\n const gfx::Point& location,\n int operation) {\n}\n\nvoid DesktopNativeWidgetAura::SchedulePaintInRect(const gfx::Rect& rect) {\n if (window_)\n window_->SchedulePaintInRect(rect);\n}\n\nvoid DesktopNativeWidgetAura::SetCursor(gfx::NativeCursor cursor) {\n desktop_root_window_host_->AsRootWindowHost()->SetCursor(cursor);\n}\n\nvoid DesktopNativeWidgetAura::ClearNativeFocus() {\n}\n\nvoid DesktopNativeWidgetAura::FocusNativeView(gfx::NativeView native_view) {\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetWorkAreaBoundsInScreen() const {\n return gfx::Rect(100, 100);\n}\n\nvoid DesktopNativeWidgetAura::SetInactiveRenderingDisabled(bool value) {\n}\n\nWidget::MoveLoopResult DesktopNativeWidgetAura::RunMoveLoop(\n const gfx::Point& drag_offset) {\n return Widget::MOVE_LOOP_CANCELED;\n}\n\nvoid DesktopNativeWidgetAura::EndMoveLoop() {\n}\n\nvoid DesktopNativeWidgetAura::SetVisibilityChangedAnimationsEnabled(\n bool value) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, aura::WindowDelegate implementation:\n\ngfx::Size DesktopNativeWidgetAura::GetMinimumSize() const {\n return gfx::Size(100, 100);\n}\n\nvoid DesktopNativeWidgetAura::OnBoundsChanged(const gfx::Rect& old_bounds,\n const gfx::Rect& new_bounds) {\n if (old_bounds.origin() != new_bounds.origin())\n native_widget_delegate_->OnNativeWidgetMove();\n if (old_bounds.size() != new_bounds.size())\n native_widget_delegate_->OnNativeWidgetSizeChanged(new_bounds.size());\n}\n\nvoid DesktopNativeWidgetAura::OnFocus(aura::Window* old_focused_window) {\n}\n\nvoid DesktopNativeWidgetAura::OnBlur() {\n}\n\ngfx::NativeCursor DesktopNativeWidgetAura::GetCursor(const gfx::Point& point) {\n return gfx::kNullCursor;\n}\n\nint DesktopNativeWidgetAura::GetNonClientComponent(\n const gfx::Point& point) const {\n return native_widget_delegate_->GetNonClientComponent(point);\n}\n\nbool DesktopNativeWidgetAura::ShouldDescendIntoChildForEventHandling(\n aura::Window* child,\n const gfx::Point& location) {\n return true;\n}\n\nbool DesktopNativeWidgetAura::CanFocus() {\n return true;\n}\n\nvoid DesktopNativeWidgetAura::OnCaptureLost() {\n}\n\nvoid DesktopNativeWidgetAura::OnPaint(gfx::Canvas* canvas) {\n native_widget_delegate_->OnNativeWidgetPaint(canvas);\n}\n\nvoid DesktopNativeWidgetAura::OnDeviceScaleFactorChanged(\n float device_scale_factor) {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowDestroying() {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowDestroyed() {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowTargetVisibilityChanged(bool visible) {\n}\n\nbool DesktopNativeWidgetAura::HasHitTestMask() const {\n return native_widget_delegate_->HasHitTestMask();\n}\n\nvoid DesktopNativeWidgetAura::GetHitTestMask(gfx::Path* mask) const {\n native_widget_delegate_->GetHitTestMask(mask);\n}\n\nscoped_refptr<ui::Texture> DesktopNativeWidgetAura::CopyTexture() {\n \/\/ The layer we create doesn't have an external texture, so this should never\n \/\/ get invoked.\n NOTREACHED();\n return scoped_refptr<ui::Texture>();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, ui::EventHandler implementation:\n\nui::EventResult DesktopNativeWidgetAura::OnKeyEvent(ui::KeyEvent* event) {\n return native_widget_delegate_->OnKeyEvent(*event) ? ui::ER_HANDLED :\n ui::ER_UNHANDLED;\n}\n\nui::EventResult DesktopNativeWidgetAura::OnMouseEvent(ui::MouseEvent* event) {\n DCHECK(window_->IsVisible());\n if (event->type() == ui::ET_MOUSEWHEEL) {\n return native_widget_delegate_->OnMouseEvent(*event) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n }\n\n if (event->type() == ui::ET_SCROLL) {\n if (native_widget_delegate_->OnMouseEvent(*event))\n return ui::ER_HANDLED;\n\n \/\/ Convert unprocessed scroll events into wheel events.\n ui::MouseWheelEvent mwe(*static_cast<ui::ScrollEvent*>(event));\n return native_widget_delegate_->OnMouseEvent(mwe) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n }\n return native_widget_delegate_->OnMouseEvent(*event) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n}\n\nui::TouchStatus DesktopNativeWidgetAura::OnTouchEvent(ui::TouchEvent* event) {\n return ui::TOUCH_STATUS_UNKNOWN;\n}\n\nui::EventResult DesktopNativeWidgetAura::OnGestureEvent(\n ui::GestureEvent* event) {\n return ui::ER_UNHANDLED;\n}\n\n} \/\/ namespace views\n<commit_msg>forward property setting<commit_after>\/\/ Copyright (c) 2012 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"ui\/views\/widget\/desktop_native_widget_aura.h\"\n\n#include \"ui\/aura\/root_window.h\"\n#include \"ui\/aura\/root_window_host.h\"\n#include \"ui\/aura\/window.h\"\n#include \"ui\/base\/hit_test.h\"\n#include \"ui\/compositor\/layer.h\"\n#include \"ui\/views\/widget\/desktop_root_window_host.h\"\n\nnamespace views {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, public:\n\nDesktopNativeWidgetAura::DesktopNativeWidgetAura(\n internal::NativeWidgetDelegate* delegate)\n : ALLOW_THIS_IN_INITIALIZER_LIST(window_(new aura::Window(this))),\n ownership_(Widget::InitParams::WIDGET_OWNS_NATIVE_WIDGET),\n native_widget_delegate_(delegate) {\n}\n\nDesktopNativeWidgetAura::~DesktopNativeWidgetAura() {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, internal::NativeWidgetPrivate implementation:\n\nvoid DesktopNativeWidgetAura::InitNativeWidget(\n const Widget::InitParams& params) {\n window_->Init(params.layer_type);\n window_->Show();\n\n desktop_root_window_host_ =\n DesktopRootWindowHost::Create(native_widget_delegate_, params.bounds);\n desktop_root_window_host_->Init(window_, params);\n}\n\nNonClientFrameView* DesktopNativeWidgetAura::CreateNonClientFrameView() {\n return NULL;\n}\n\nbool DesktopNativeWidgetAura::ShouldUseNativeFrame() const {\n return desktop_root_window_host_->ShouldUseNativeFrame();\n}\n\nvoid DesktopNativeWidgetAura::FrameTypeChanged() {\n}\n\nWidget* DesktopNativeWidgetAura::GetWidget() {\n return native_widget_delegate_->AsWidget();\n}\n\nconst Widget* DesktopNativeWidgetAura::GetWidget() const {\n return native_widget_delegate_->AsWidget();\n}\n\ngfx::NativeView DesktopNativeWidgetAura::GetNativeView() const {\n return window_;\n}\n\ngfx::NativeWindow DesktopNativeWidgetAura::GetNativeWindow() const {\n return window_;\n}\n\nWidget* DesktopNativeWidgetAura::GetTopLevelWidget() {\n return GetWidget();\n}\n\nconst ui::Compositor* DesktopNativeWidgetAura::GetCompositor() const {\n return window_->layer()->GetCompositor();\n}\n\nui::Compositor* DesktopNativeWidgetAura::GetCompositor() {\n return window_->layer()->GetCompositor();\n}\n\nvoid DesktopNativeWidgetAura::CalculateOffsetToAncestorWithLayer(\n gfx::Point* offset,\n ui::Layer** layer_parent) {\n}\n\nvoid DesktopNativeWidgetAura::ViewRemoved(View* view) {\n}\n\nvoid DesktopNativeWidgetAura::SetNativeWindowProperty(const char* name,\n void* value) {\n window_->SetNativeWindowProperty(name, value);\n}\n\nvoid* DesktopNativeWidgetAura::GetNativeWindowProperty(const char* name) const {\n return window_->GetNativeWindowProperty(name);\n}\n\nTooltipManager* DesktopNativeWidgetAura::GetTooltipManager() const {\n return NULL;\n}\n\nbool DesktopNativeWidgetAura::IsScreenReaderActive() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::SendNativeAccessibilityEvent(\n View* view,\n ui::AccessibilityTypes::Event event_type) {\n}\n\nvoid DesktopNativeWidgetAura::SetCapture() {\n window_->SetCapture();\n \/\/ aura::Window doesn't implicitly update capture on the RootWindowHost, so\n \/\/ we have to do that manually.\n if (!desktop_root_window_host_->HasCapture())\n window_->GetRootWindow()->SetNativeCapture();\n}\n\nvoid DesktopNativeWidgetAura::ReleaseCapture() {\n window_->ReleaseCapture();\n \/\/ aura::Window doesn't implicitly update capture on the RootWindowHost, so\n \/\/ we have to do that manually.\n if (desktop_root_window_host_->HasCapture())\n window_->GetRootWindow()->ReleaseNativeCapture();\n}\n\nbool DesktopNativeWidgetAura::HasCapture() const {\n return window_->HasCapture() && desktop_root_window_host_->HasCapture();\n}\n\nInputMethod* DesktopNativeWidgetAura::CreateInputMethod() {\n return desktop_root_window_host_->CreateInputMethod();\n}\n\ninternal::InputMethodDelegate*\n DesktopNativeWidgetAura::GetInputMethodDelegate() {\n return desktop_root_window_host_->GetInputMethodDelegate();\n}\n\nvoid DesktopNativeWidgetAura::CenterWindow(const gfx::Size& size) {\n desktop_root_window_host_->CenterWindow(size);\n}\n\nvoid DesktopNativeWidgetAura::GetWindowPlacement(\n gfx::Rect* bounds,\n ui::WindowShowState* maximized) const {\n desktop_root_window_host_->GetWindowPlacement(bounds, maximized);\n}\n\nvoid DesktopNativeWidgetAura::SetWindowTitle(const string16& title) {\n desktop_root_window_host_->SetWindowTitle(title);\n}\n\nvoid DesktopNativeWidgetAura::SetWindowIcons(const gfx::ImageSkia& window_icon,\n const gfx::ImageSkia& app_icon) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleName(const string16& name) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleRole(\n ui::AccessibilityTypes::Role role) {\n}\n\nvoid DesktopNativeWidgetAura::SetAccessibleState(\n ui::AccessibilityTypes::State state) {\n}\n\nvoid DesktopNativeWidgetAura::InitModalType(ui::ModalType modal_type) {\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetWindowBoundsInScreen() const {\n return desktop_root_window_host_->GetWindowBoundsInScreen();\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetClientAreaBoundsInScreen() const {\n return desktop_root_window_host_->GetClientAreaBoundsInScreen();\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetRestoredBounds() const {\n return desktop_root_window_host_->GetRestoredBounds();\n}\n\nvoid DesktopNativeWidgetAura::SetBounds(const gfx::Rect& bounds) {\n desktop_root_window_host_->AsRootWindowHost()->SetBounds(bounds);\n}\n\nvoid DesktopNativeWidgetAura::SetSize(const gfx::Size& size) {\n desktop_root_window_host_->SetSize(size);\n}\n\nvoid DesktopNativeWidgetAura::StackAbove(gfx::NativeView native_view) {\n}\n\nvoid DesktopNativeWidgetAura::StackAtTop() {\n}\n\nvoid DesktopNativeWidgetAura::StackBelow(gfx::NativeView native_view) {\n}\n\nvoid DesktopNativeWidgetAura::SetShape(gfx::NativeRegion shape) {\n desktop_root_window_host_->SetShape(shape);\n}\n\nvoid DesktopNativeWidgetAura::Close() {\n desktop_root_window_host_->Close();\n}\n\nvoid DesktopNativeWidgetAura::CloseNow() {\n desktop_root_window_host_->CloseNow();\n}\n\nvoid DesktopNativeWidgetAura::Show() {\n desktop_root_window_host_->AsRootWindowHost()->Show();\n}\n\nvoid DesktopNativeWidgetAura::Hide() {\n desktop_root_window_host_->AsRootWindowHost()->Hide();\n}\n\nvoid DesktopNativeWidgetAura::ShowMaximizedWithBounds(\n const gfx::Rect& restored_bounds) {\n desktop_root_window_host_->ShowMaximizedWithBounds(restored_bounds);\n}\n\nvoid DesktopNativeWidgetAura::ShowWithWindowState(ui::WindowShowState state) {\n desktop_root_window_host_->ShowWindowWithState(state);\n}\n\nbool DesktopNativeWidgetAura::IsVisible() const {\n return desktop_root_window_host_->IsVisible();\n}\n\nvoid DesktopNativeWidgetAura::Activate() {\n desktop_root_window_host_->Activate();\n}\n\nvoid DesktopNativeWidgetAura::Deactivate() {\n desktop_root_window_host_->Deactivate();\n}\n\nbool DesktopNativeWidgetAura::IsActive() const {\n return desktop_root_window_host_->IsActive();\n}\n\nvoid DesktopNativeWidgetAura::SetAlwaysOnTop(bool always_on_top) {\n desktop_root_window_host_->SetAlwaysOnTop(always_on_top);\n}\n\nvoid DesktopNativeWidgetAura::Maximize() {\n desktop_root_window_host_->Maximize();\n}\n\nvoid DesktopNativeWidgetAura::Minimize() {\n desktop_root_window_host_->Minimize();\n}\n\nbool DesktopNativeWidgetAura::IsMaximized() const {\n return desktop_root_window_host_->IsMaximized();\n}\n\nbool DesktopNativeWidgetAura::IsMinimized() const {\n return desktop_root_window_host_->IsMinimized();\n}\n\nvoid DesktopNativeWidgetAura::Restore() {\n desktop_root_window_host_->Restore();\n}\n\nvoid DesktopNativeWidgetAura::SetFullscreen(bool fullscreen) {\n}\n\nbool DesktopNativeWidgetAura::IsFullscreen() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::SetOpacity(unsigned char opacity) {\n}\n\nvoid DesktopNativeWidgetAura::SetUseDragFrame(bool use_drag_frame) {\n}\n\nvoid DesktopNativeWidgetAura::FlashFrame(bool flash_frame) {\n}\n\nbool DesktopNativeWidgetAura::IsAccessibleWidget() const {\n return false;\n}\n\nvoid DesktopNativeWidgetAura::RunShellDrag(View* view,\n const ui::OSExchangeData& data,\n const gfx::Point& location,\n int operation) {\n}\n\nvoid DesktopNativeWidgetAura::SchedulePaintInRect(const gfx::Rect& rect) {\n if (window_)\n window_->SchedulePaintInRect(rect);\n}\n\nvoid DesktopNativeWidgetAura::SetCursor(gfx::NativeCursor cursor) {\n desktop_root_window_host_->AsRootWindowHost()->SetCursor(cursor);\n}\n\nvoid DesktopNativeWidgetAura::ClearNativeFocus() {\n}\n\nvoid DesktopNativeWidgetAura::FocusNativeView(gfx::NativeView native_view) {\n}\n\ngfx::Rect DesktopNativeWidgetAura::GetWorkAreaBoundsInScreen() const {\n return gfx::Rect(100, 100);\n}\n\nvoid DesktopNativeWidgetAura::SetInactiveRenderingDisabled(bool value) {\n}\n\nWidget::MoveLoopResult DesktopNativeWidgetAura::RunMoveLoop(\n const gfx::Point& drag_offset) {\n return Widget::MOVE_LOOP_CANCELED;\n}\n\nvoid DesktopNativeWidgetAura::EndMoveLoop() {\n}\n\nvoid DesktopNativeWidgetAura::SetVisibilityChangedAnimationsEnabled(\n bool value) {\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, aura::WindowDelegate implementation:\n\ngfx::Size DesktopNativeWidgetAura::GetMinimumSize() const {\n return gfx::Size(100, 100);\n}\n\nvoid DesktopNativeWidgetAura::OnBoundsChanged(const gfx::Rect& old_bounds,\n const gfx::Rect& new_bounds) {\n if (old_bounds.origin() != new_bounds.origin())\n native_widget_delegate_->OnNativeWidgetMove();\n if (old_bounds.size() != new_bounds.size())\n native_widget_delegate_->OnNativeWidgetSizeChanged(new_bounds.size());\n}\n\nvoid DesktopNativeWidgetAura::OnFocus(aura::Window* old_focused_window) {\n}\n\nvoid DesktopNativeWidgetAura::OnBlur() {\n}\n\ngfx::NativeCursor DesktopNativeWidgetAura::GetCursor(const gfx::Point& point) {\n return gfx::kNullCursor;\n}\n\nint DesktopNativeWidgetAura::GetNonClientComponent(\n const gfx::Point& point) const {\n return native_widget_delegate_->GetNonClientComponent(point);\n}\n\nbool DesktopNativeWidgetAura::ShouldDescendIntoChildForEventHandling(\n aura::Window* child,\n const gfx::Point& location) {\n return true;\n}\n\nbool DesktopNativeWidgetAura::CanFocus() {\n return true;\n}\n\nvoid DesktopNativeWidgetAura::OnCaptureLost() {\n}\n\nvoid DesktopNativeWidgetAura::OnPaint(gfx::Canvas* canvas) {\n native_widget_delegate_->OnNativeWidgetPaint(canvas);\n}\n\nvoid DesktopNativeWidgetAura::OnDeviceScaleFactorChanged(\n float device_scale_factor) {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowDestroying() {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowDestroyed() {\n}\n\nvoid DesktopNativeWidgetAura::OnWindowTargetVisibilityChanged(bool visible) {\n}\n\nbool DesktopNativeWidgetAura::HasHitTestMask() const {\n return native_widget_delegate_->HasHitTestMask();\n}\n\nvoid DesktopNativeWidgetAura::GetHitTestMask(gfx::Path* mask) const {\n native_widget_delegate_->GetHitTestMask(mask);\n}\n\nscoped_refptr<ui::Texture> DesktopNativeWidgetAura::CopyTexture() {\n \/\/ The layer we create doesn't have an external texture, so this should never\n \/\/ get invoked.\n NOTREACHED();\n return scoped_refptr<ui::Texture>();\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ DesktopNativeWidgetAura, ui::EventHandler implementation:\n\nui::EventResult DesktopNativeWidgetAura::OnKeyEvent(ui::KeyEvent* event) {\n return native_widget_delegate_->OnKeyEvent(*event) ? ui::ER_HANDLED :\n ui::ER_UNHANDLED;\n}\n\nui::EventResult DesktopNativeWidgetAura::OnMouseEvent(ui::MouseEvent* event) {\n DCHECK(window_->IsVisible());\n if (event->type() == ui::ET_MOUSEWHEEL) {\n return native_widget_delegate_->OnMouseEvent(*event) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n }\n\n if (event->type() == ui::ET_SCROLL) {\n if (native_widget_delegate_->OnMouseEvent(*event))\n return ui::ER_HANDLED;\n\n \/\/ Convert unprocessed scroll events into wheel events.\n ui::MouseWheelEvent mwe(*static_cast<ui::ScrollEvent*>(event));\n return native_widget_delegate_->OnMouseEvent(mwe) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n }\n return native_widget_delegate_->OnMouseEvent(*event) ?\n ui::ER_HANDLED : ui::ER_UNHANDLED;\n}\n\nui::TouchStatus DesktopNativeWidgetAura::OnTouchEvent(ui::TouchEvent* event) {\n return ui::TOUCH_STATUS_UNKNOWN;\n}\n\nui::EventResult DesktopNativeWidgetAura::OnGestureEvent(\n ui::GestureEvent* event) {\n return ui::ER_UNHANDLED;\n}\n\n} \/\/ namespace views\n<|endoftext|>"} {"text":"<commit_before>\/*******************************************************************************\n * konsolekalendarexports.cpp *\n * *\n * KonsoleKalendar is a command line interface to KDE calendars *\n * Copyright (C) 2002-2004 Tuukka Pasanen <illuusio@mailcity.com> *\n * Copyright (C) 2003-2005 Allen Winter <winter@kde.org> *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *\n * *\n * As a special exception, permission is given to link this program *\n * with any edition of Qt, and distribute the resulting executable, *\n * without including the source code for Qt in the source distribution. *\n * *\n ******************************************************************************\/\n\/**\n * @file konsolekalendarexports.cpp\n * Provides the KonsoleKalendarExports class definition.\n * @author Tuukka Pasanen\n * @author Allen Winter\n *\/\n#include \"konsolekalendarexports.h\"\n\n#include <stdlib.h>\n#include <iostream>\n\n#include <QtCore\/QDateTime>\n\n#include <kdebug.h>\n#include <klocale.h>\n\n#include <kcal\/calendarlocal.h>\n#include <kcal\/calendar.h>\n#include <kcal\/event.h>\n\nusing namespace KCal;\nusing namespace std;\n\nKonsoleKalendarExports::KonsoleKalendarExports( KonsoleKalendarVariables *vars )\n{\n m_variables = vars;\n m_firstEntry = true;\n}\n\nKonsoleKalendarExports::~KonsoleKalendarExports()\n{\n}\n\nbool KonsoleKalendarExports::exportAsTxt( QTextStream *ts,\n Event *event, const QDate &date )\n{\n\n \/\/ Export \"Text\" Format:\n \/\/\n \/\/ Date:\\t<Incidence Date>(dddd yyyy-MM-dd)\n \/\/ [\\t<Incidence Start Time>(hh:mm) - <Incidence End Time>(hh:mm)]\n \/\/ Summary:\n \/\/ \\t<Incidence Summary | \"(no summary available)\">\n \/\/ Location:\n \/\/ \\t<Incidence Location | \"(no location available)\">\n \/\/ Description:\n \/\/ \\t<Incidence Description | \"(no description available)\">\n \/\/ UID:\n \/\/ \\t<Incidence UID>\n \/\/ --------------------------------------------------\n\n \/\/ Print Event Date (in user's preferred format)\n *ts << i18n( \"Date:\" )\n << \"\\t\"\n << KGlobal::locale()->formatDate( date )\n << endl;\n\n \/\/ Print Event Starttime - Endtime, for Non-All-Day Events Only\n if ( !event->allDay() ) {\n *ts << \"\\t\"\n << KGlobal::locale()->formatTime( event->dtStart().time() )\n << \" - \"\n << KGlobal::locale()->formatTime( event->dtEnd().time() );\n }\n *ts << endl;\n\n \/\/ Print Event Summary\n *ts << i18n( \"Summary:\" )\n << endl;\n if ( !event->summary().isEmpty() ) {\n *ts << \"\\t\"\n << event->summary()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no summary available)\" )\n << endl;\n }\n\n \/\/ Print Event Location\n *ts << i18n( \"Location:\" )\n << endl;\n if ( !event->location().isEmpty() ) {\n *ts << \"\\t\"\n << event->location()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no location available)\" )\n << endl;\n }\n\n \/\/ Print Event Description\n *ts << i18n( \"Description:\" )\n << endl;\n if ( !event->description().isEmpty() ) {\n *ts << \"\\t\"\n << event->description()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no description available)\" )\n << endl;\n }\n\n \/\/ Print Event UID\n *ts << i18n( \"UID:\" )\n << endl\n << \"\\t\"\n << event->uid()\n << endl;\n\n \/\/ Print Line Separator\n *ts << \"--------------------------------------------------\"\n << endl;\n\n return true;\n}\n\nbool KonsoleKalendarExports::exportAsTxtShort( QTextStream *ts,\n Event *event, const QDate &date,\n bool sameday )\n{\n\n \/\/ Export \"Text-Short\" Format:\n \/\/\n \/\/ [--------------------------------------------------]\n \/\/ {<Incidence Date>(dddd yyyy-MM-dd)]\n \/\/ [<Incidence Start Time>(hh:mm) - <Incidence End Time>(hh:mm) | \"\\t\"]\n \/\/ \\t<Incidence Summary | \\t>[, <Incidence Location>]\n \/\/ \\t\\t<Incidence Description | \"\\t\">\n\n if ( !sameday ) {\n \/\/ If a new date, then Print the Event Date (in user's preferred format)\n *ts << KGlobal::locale()->formatDate( date ) << \":\"\n << endl;\n }\n\n \/\/ Print Event Starttime - Endtime\n if ( !event->allDay() ) {\n *ts << KGlobal::locale()->formatTime( event->dtStart().time() )\n << \" - \"\n << KGlobal::locale()->formatTime( event->dtEnd().time() );\n } else {\n *ts << i18n( \"[all day]\\t\" );\n }\n *ts << \"\\t\";\n\n \/\/ Print Event Summary\n *ts << event->summary().replace( QChar( '\\n' ), QChar( ' ' ) );\n\n \/\/ Print Event Location\n if ( !event->location().isEmpty() ) {\n if ( !event->summary().isEmpty() ) {\n *ts << \", \";\n }\n *ts << event->location().replace( QChar( '\\n' ), QChar( ' ' ) );\n }\n *ts << endl;\n\n \/\/ Print Event Description\n if ( !event->description().isEmpty() ) {\n *ts << \"\\t\\t\\t\"\n << event->description().replace( QChar( '\\n' ), QChar( ' ' ) )\n << endl;\n }\n\n\/\/ By user request, no longer print UIDs if export-type==short\n\n return true;\n}\n\nQString KonsoleKalendarExports::processField( const QString &field,\n const QString &dquote )\n{\n \/\/ little function that processes a field for CSV compliance:\n \/\/ 1. Replaces double quotes by a pair of consecutive double quotes\n \/\/ 2. Surrounds field with double quotes\n\n QString double_dquote = dquote + dquote;\n QString retField = field;\n retField = dquote + retField.replace( dquote, double_dquote ) + dquote;\n return retField;\n}\n\n\/\/@cond IGNORE\n#define pF( x ) processField( ( x ), dquote )\n\/\/@endcond\n\nbool KonsoleKalendarExports::exportAsCSV( QTextStream *ts,\n Event *event, const QDate &date )\n{\n\n \/\/ Export \"CSV\" Format:\n \/\/\n \/\/ startdate,starttime,enddate,endtime,summary,location,description,UID\n\n QString delim = i18n( \",\" ); \/\/ character to use as CSV field delimiter\n QString dquote = i18n( \"\\\"\" ); \/\/ character to use to quote CSV fields\n\n if ( !event->allDay() ) {\n *ts << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( KGlobal::locale()->formatTime( event->dtStart().time() ) )\n << delim << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( KGlobal::locale()->formatTime( event->dtEnd().time() ) );\n } else {\n *ts << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( \"\" )\n << delim << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( \"\" );\n }\n\n *ts << delim << pF( event->summary().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->location().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->description().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->uid() )\n << endl;\n\n return true;\n}\n<commit_msg>add a blank line between events in short export type BUG: 192322<commit_after>\/*******************************************************************************\n * konsolekalendarexports.cpp *\n * *\n * KonsoleKalendar is a command line interface to KDE calendars *\n * Copyright (C) 2002-2004 Tuukka Pasanen <illuusio@mailcity.com> *\n * Copyright (C) 2003-2005,2009 Allen Winter <winter@kde.org> *\n * *\n * This program is free software; you can redistribute it and\/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) any later version. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program; if not, write to the Free Software *\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *\n * *\n * As a special exception, permission is given to link this program *\n * with any edition of Qt, and distribute the resulting executable, *\n * without including the source code for Qt in the source distribution. *\n * *\n ******************************************************************************\/\n\/**\n * @file konsolekalendarexports.cpp\n * Provides the KonsoleKalendarExports class definition.\n * @author Tuukka Pasanen\n * @author Allen Winter\n *\/\n#include \"konsolekalendarexports.h\"\n\n#include <stdlib.h>\n#include <iostream>\n\n#include <QtCore\/QDateTime>\n\n#include <kdebug.h>\n#include <klocale.h>\n\n#include <kcal\/calendarlocal.h>\n#include <kcal\/calendar.h>\n#include <kcal\/event.h>\n\nusing namespace KCal;\nusing namespace std;\n\nKonsoleKalendarExports::KonsoleKalendarExports( KonsoleKalendarVariables *vars )\n{\n m_variables = vars;\n m_firstEntry = true;\n}\n\nKonsoleKalendarExports::~KonsoleKalendarExports()\n{\n}\n\nbool KonsoleKalendarExports::exportAsTxt( QTextStream *ts,\n Event *event, const QDate &date )\n{\n\n \/\/ Export \"Text\" Format:\n \/\/\n \/\/ Date:\\t<Incidence Date>(dddd yyyy-MM-dd)\n \/\/ [\\t<Incidence Start Time>(hh:mm) - <Incidence End Time>(hh:mm)]\n \/\/ Summary:\n \/\/ \\t<Incidence Summary | \"(no summary available)\">\n \/\/ Location:\n \/\/ \\t<Incidence Location | \"(no location available)\">\n \/\/ Description:\n \/\/ \\t<Incidence Description | \"(no description available)\">\n \/\/ UID:\n \/\/ \\t<Incidence UID>\n \/\/ --------------------------------------------------\n\n \/\/ Print Event Date (in user's preferred format)\n *ts << i18n( \"Date:\" )\n << \"\\t\"\n << KGlobal::locale()->formatDate( date )\n << endl;\n\n \/\/ Print Event Starttime - Endtime, for Non-All-Day Events Only\n if ( !event->allDay() ) {\n *ts << \"\\t\"\n << KGlobal::locale()->formatTime( event->dtStart().time() )\n << \" - \"\n << KGlobal::locale()->formatTime( event->dtEnd().time() );\n }\n *ts << endl;\n\n \/\/ Print Event Summary\n *ts << i18n( \"Summary:\" )\n << endl;\n if ( !event->summary().isEmpty() ) {\n *ts << \"\\t\"\n << event->summary()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no summary available)\" )\n << endl;\n }\n\n \/\/ Print Event Location\n *ts << i18n( \"Location:\" )\n << endl;\n if ( !event->location().isEmpty() ) {\n *ts << \"\\t\"\n << event->location()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no location available)\" )\n << endl;\n }\n\n \/\/ Print Event Description\n *ts << i18n( \"Description:\" )\n << endl;\n if ( !event->description().isEmpty() ) {\n *ts << \"\\t\"\n << event->description()\n << endl;\n } else {\n *ts << \"\\t\"\n << i18n( \"(no description available)\" )\n << endl;\n }\n\n \/\/ Print Event UID\n *ts << i18n( \"UID:\" )\n << endl\n << \"\\t\"\n << event->uid()\n << endl;\n\n \/\/ Print Line Separator\n *ts << \"--------------------------------------------------\"\n << endl;\n\n return true;\n}\n\nbool KonsoleKalendarExports::exportAsTxtShort( QTextStream *ts,\n Event *event, const QDate &date,\n bool sameday )\n{\n\n \/\/ Export \"Text-Short\" Format:\n \/\/\n \/\/ [--------------------------------------------------]\n \/\/ {<Incidence Date>(dddd yyyy-MM-dd)]\n \/\/ [<Incidence Start Time>(hh:mm) - <Incidence End Time>(hh:mm) | \"\\t\"]\n \/\/ \\t<Incidence Summary | \\t>[, <Incidence Location>]\n \/\/ \\t\\t<Incidence Description | \"\\t\">\n\n if ( !sameday ) {\n \/\/ If a new date, then Print the Event Date (in user's preferred format)\n *ts << KGlobal::locale()->formatDate( date ) << \":\"\n << endl;\n }\n\n \/\/ Print Event Starttime - Endtime\n if ( !event->allDay() ) {\n *ts << KGlobal::locale()->formatTime( event->dtStart().time() )\n << \" - \"\n << KGlobal::locale()->formatTime( event->dtEnd().time() );\n } else {\n *ts << i18n( \"[all day]\\t\" );\n }\n *ts << \"\\t\";\n\n \/\/ Print Event Summary\n *ts << event->summary().replace( QChar( '\\n' ), QChar( ' ' ) );\n\n \/\/ Print Event Location\n if ( !event->location().isEmpty() ) {\n if ( !event->summary().isEmpty() ) {\n *ts << \", \";\n }\n *ts << event->location().replace( QChar( '\\n' ), QChar( ' ' ) );\n }\n *ts << endl;\n\n \/\/ Print Event Description\n if ( !event->description().isEmpty() ) {\n *ts << \"\\t\\t\\t\"\n << event->description().replace( QChar( '\\n' ), QChar( ' ' ) )\n << endl;\n }\n\n\/\/ By user request, no longer print UIDs if export-type==short\n\n \/\/ Print Separator\n *ts << endl;\n\n return true;\n}\n\nQString KonsoleKalendarExports::processField( const QString &field,\n const QString &dquote )\n{\n \/\/ little function that processes a field for CSV compliance:\n \/\/ 1. Replaces double quotes by a pair of consecutive double quotes\n \/\/ 2. Surrounds field with double quotes\n\n QString double_dquote = dquote + dquote;\n QString retField = field;\n retField = dquote + retField.replace( dquote, double_dquote ) + dquote;\n return retField;\n}\n\n\/\/@cond IGNORE\n#define pF( x ) processField( ( x ), dquote )\n\/\/@endcond\n\nbool KonsoleKalendarExports::exportAsCSV( QTextStream *ts,\n Event *event, const QDate &date )\n{\n\n \/\/ Export \"CSV\" Format:\n \/\/\n \/\/ startdate,starttime,enddate,endtime,summary,location,description,UID\n\n QString delim = i18n( \",\" ); \/\/ character to use as CSV field delimiter\n QString dquote = i18n( \"\\\"\" ); \/\/ character to use to quote CSV fields\n\n if ( !event->allDay() ) {\n *ts << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( KGlobal::locale()->formatTime( event->dtStart().time() ) )\n << delim << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( KGlobal::locale()->formatTime( event->dtEnd().time() ) );\n } else {\n *ts << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( \"\" )\n << delim << pF( KGlobal::locale()->formatDate( date ) )\n << delim << pF( \"\" );\n }\n\n *ts << delim << pF( event->summary().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->location().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->description().replace( QChar( '\\n' ), QChar( ' ' ) ) )\n << delim << pF( event->uid() )\n << endl;\n\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR 3\n#define CV_VERSION_MINOR 4\n#define CV_VERSION_REVISION 9\n#define CV_VERSION_STATUS \"-pre\"\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A) L ## #__A\n#define CVAUX_STRW(__A) CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_MAJOR\n#define CV_MINOR_VERSION CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<commit_msg>release: OpenCV 3.4.9<commit_after>\/\/ This file is part of OpenCV project.\n\/\/ It is subject to the license terms in the LICENSE file found in the top-level directory\n\/\/ of this distribution and at http:\/\/opencv.org\/license.html.\n\n#ifndef OPENCV_VERSION_HPP\n#define OPENCV_VERSION_HPP\n\n#define CV_VERSION_MAJOR 3\n#define CV_VERSION_MINOR 4\n#define CV_VERSION_REVISION 9\n#define CV_VERSION_STATUS \"\"\n\n#define CVAUX_STR_EXP(__A) #__A\n#define CVAUX_STR(__A) CVAUX_STR_EXP(__A)\n\n#define CVAUX_STRW_EXP(__A) L ## #__A\n#define CVAUX_STRW(__A) CVAUX_STRW_EXP(__A)\n\n#define CV_VERSION CVAUX_STR(CV_VERSION_MAJOR) \".\" CVAUX_STR(CV_VERSION_MINOR) \".\" CVAUX_STR(CV_VERSION_REVISION) CV_VERSION_STATUS\n\n\/* old style version constants*\/\n#define CV_MAJOR_VERSION CV_VERSION_MAJOR\n#define CV_MINOR_VERSION CV_VERSION_MINOR\n#define CV_SUBMINOR_VERSION CV_VERSION_REVISION\n\n#endif \/\/ OPENCV_VERSION_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: mvsave.hxx,v $\n *\n * $Revision: 1.5 $\n *\n * last change: $Author: rt $ $Date: 2005-09-09 03:51:06 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _MVSAVE_HXX\n#define _MVSAVE_HXX\n\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n#ifndef _KEYCOD_HXX \/\/autogen\n#include <vcl\/keycod.hxx>\n#endif\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\nclass SvNumberFormatter;\nclass SvULongs;\nclass SwBookmark;\nclass SwDoc;\nclass SwFmtAnchor;\nclass SwFrmFmt;\nclass SwIndex;\nclass SwNodeIndex;\nclass SwNodeRange;\nclass SwPaM;\nclass SwRedline;\nstruct SwPosition;\n\nenum SaveBookmarkType { BKMK_POS_NONE = 0x00,\n BKMK_POS = 0x01,\n BKMK_POS_OTHER = 0x02\n };\n\nclass SaveBookmark\n{\n String aName, aShortName;\n ULONG nNode1, nNode2;\n xub_StrLen nCntnt1, nCntnt2;\n KeyCode aCode;\n SaveBookmarkType eBkmkType;\n BOOKMARK_TYPE eOrigBkmType;\n\npublic:\n SaveBookmark( int, const SwBookmark&, const SwNodeIndex&,\n const SwIndex* pIdx = 0 );\n void SetInDoc( SwDoc* pDoc, const SwNodeIndex&, const SwIndex* pIdx = 0);\n BOOKMARK_TYPE GetOriginalBkmType() const {return eOrigBkmType;}\n};\n\nSV_DECL_PTRARR_DEL( SaveBookmarks, SaveBookmark*, 0, 10 )\n\nvoid _DelBookmarks( const SwNodeIndex& rStt,\n const SwNodeIndex& rEnd,\n SaveBookmarks* pSaveBkmk = 0,\n const SwIndex* pSttIdx = 0,\n const SwIndex* pEndIdx = 0 );\n\n\n#define SAVEFLY 1\n#define SAVEFLY_SPLIT 2\n\nvoid _SaveCntntIdx( SwDoc* pDoc, ULONG nNode, xub_StrLen nCntnt,\n SvULongs& rSaveArr, BYTE nSaveFly = 0 );\nvoid _RestoreCntntIdx( SwDoc* pDoc, SvULongs& rSaveArr,\n ULONG nNode, xub_StrLen nOffset = 0,\n BOOL bAuto = FALSE );\nvoid _RestoreCntntIdx( SvULongs& rSaveArr, const SwNode& rNd,\n xub_StrLen nLen, xub_StrLen nCorrLen );\n\n\n\/** data structure to temporarily hold fly anchor positions relative to some\n * location. *\/\nstruct _SaveFly\n{\n ULONG nNdDiff; \/\/\/ relative node difference\n SwFrmFmt* pFrmFmt; \/\/\/ the fly's frame format\n sal_Bool bInsertPosition; \/\/\/ if true, anchor _at_ insert position\n\n _SaveFly( ULONG nNodeDiff, SwFrmFmt* pFmt, sal_Bool bInsert )\n : nNdDiff( nNodeDiff ), pFrmFmt( pFmt ), bInsertPosition( bInsert )\n { }\n};\n\nSV_DECL_VARARR( _SaveFlyArr, _SaveFly, 0, 10 )\n\nvoid _RestFlyInRange( _SaveFlyArr& rArr, const SwNodeIndex& rSttIdx,\n const SwNodeIndex* pInsPos );\nvoid _SaveFlyInRange( const SwNodeRange& rRg, _SaveFlyArr& rArr );\nvoid _SaveFlyInRange( const SwPaM& rPam, const SwNodeIndex& rInsPos,\n _SaveFlyArr& rArr, sal_Bool bMoveAllFlys );\n\nvoid DelFlyInRange( const SwNodeIndex& rMkNdIdx,\n const SwNodeIndex& rPtNdIdx );\n\n\nclass SwDataChanged\n{\n const SwPaM* pPam;\n const SwPosition* pPos;\n SwDoc* pDoc;\n ULONG nNode;\n xub_StrLen nCntnt;\n USHORT nType; \/\/ Insert\/Move\/Delete\/... (UndoIds)\n\npublic:\n SwDataChanged( const SwPaM& rPam, USHORT nType );\n SwDataChanged( SwDoc* pDoc, const SwPosition& rPos, USHORT nType );\n ~SwDataChanged();\n\n ULONG GetNode() const { return nNode; }\n xub_StrLen GetCntnt() const { return nCntnt; }\n};\n\n\n\/\/ Funktions-Deklaration damit auch alles unter der CrsrShell mal die\n\/\/ Crsr verschieben kann\n\/\/ die Funktionen rufen nicht die SwDoc::Corr - Methoden!\n\n \/\/ Setzt alle PaMs an OldPos auf NewPos + Offset\nvoid PaMCorrAbs( const SwPosition &rOldPos,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n \/\/ Setzt alle PaMs in OldNode auf NewPos + Offset\nvoid PaMCorrAbs( const SwNodeIndex &rOldNode,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n \/\/ Setzt alle PaMs im Bereich vom Range nach NewPos\nvoid PaMCorrAbs( const SwPaM& rRange,\n const SwPosition& rNewPos );\n\n \/\/ Setzt alle PaMs im Bereich von [StartNode, EndNode] nach NewPos\nvoid PaMCorrAbs( const SwNodeIndex &rStartNode,\n const SwNodeIndex &rEndNode,\n const SwPosition &rNewPos );\n\n \/\/ Setzt alle PaMs in OldNode auf relative Pos\nvoid PaMCorrRel( const SwNodeIndex &rOldNode,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n\n\/\/ Hilfsklasse zum kopieren von absatzgebundenen Flys. Durch die Sortierung\n\/\/ nach der Ordnungsnummer wird versucht die layout seitige Anordnung\n\/\/ bei zu behalten\nclass _ZSortFly\n{\n const SwFrmFmt* pFmt;\n const SwFmtAnchor* pAnchor;\n UINT32 nOrdNum;\n\npublic:\n _ZSortFly( const SwFrmFmt* pFrmFmt, const SwFmtAnchor* pFlyAnchor,\n UINT32 nArrOrdNum );\n _ZSortFly& operator=( const _ZSortFly& rCpy )\n {\n pFmt = rCpy.pFmt, pAnchor = rCpy.pAnchor, nOrdNum = rCpy.nOrdNum;\n return *this;\n }\n\n int operator==( const _ZSortFly& ) const { return FALSE; }\n int operator<( const _ZSortFly& rCmp ) const\n { return nOrdNum < rCmp.nOrdNum; }\n\n const SwFrmFmt* GetFmt() const { return pFmt; }\n const SwFmtAnchor* GetAnchor() const { return pAnchor; }\n};\n\nSV_DECL_VARARR_SORT( _ZSortFlys, _ZSortFly, 0, 10 )\n\n\nclass SwTblNumFmtMerge\n{\n SvNumberFormatter* pNFmt;\npublic:\n SwTblNumFmtMerge( const SwDoc& rSrc, SwDoc& rDest );\n ~SwTblNumFmtMerge();\n};\n\n\nclass _SaveRedlEndPosForRestore\n{\n SvPtrarr* pSavArr;\n SwNodeIndex* pSavIdx;\n\n void _Restore();\npublic:\n _SaveRedlEndPosForRestore( const SwNodeIndex& rInsIdx );\n ~_SaveRedlEndPosForRestore();\n void Restore() { if( pSavArr ) _Restore(); }\n};\n\n\n#endif \/\/ _MVSAVE_HXX\n\n<commit_msg>INTEGRATION: CWS redline01 (1.5.128); FILE MERGED 2006\/03\/22 13:14:20 ama 1.5.128.1: Fix #i59534: Text insertion at the end of a redline<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: mvsave.hxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: hr $ $Date: 2006-04-19 14:20:27 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _MVSAVE_HXX\n#define _MVSAVE_HXX\n\n\n#ifndef _STRING_HXX \/\/autogen\n#include <tools\/string.hxx>\n#endif\n#ifndef _KEYCOD_HXX \/\/autogen\n#include <vcl\/keycod.hxx>\n#endif\n#ifndef _SVARRAY_HXX \/\/autogen\n#include <svtools\/svarray.hxx>\n#endif\n\nclass SvNumberFormatter;\nclass SvULongs;\nclass SwBookmark;\nclass SwDoc;\nclass SwFmtAnchor;\nclass SwFrmFmt;\nclass SwIndex;\nclass SwNodeIndex;\nclass SwNodeRange;\nclass SwPaM;\nclass SwRedline;\nstruct SwPosition;\n\nenum SaveBookmarkType { BKMK_POS_NONE = 0x00,\n BKMK_POS = 0x01,\n BKMK_POS_OTHER = 0x02\n };\n\nclass SaveBookmark\n{\n String aName, aShortName;\n ULONG nNode1, nNode2;\n xub_StrLen nCntnt1, nCntnt2;\n KeyCode aCode;\n SaveBookmarkType eBkmkType;\n BOOKMARK_TYPE eOrigBkmType;\n\npublic:\n SaveBookmark( int, const SwBookmark&, const SwNodeIndex&,\n const SwIndex* pIdx = 0 );\n void SetInDoc( SwDoc* pDoc, const SwNodeIndex&, const SwIndex* pIdx = 0);\n BOOKMARK_TYPE GetOriginalBkmType() const {return eOrigBkmType;}\n};\n\nSV_DECL_PTRARR_DEL( SaveBookmarks, SaveBookmark*, 0, 10 )\n\nvoid _DelBookmarks( const SwNodeIndex& rStt,\n const SwNodeIndex& rEnd,\n SaveBookmarks* pSaveBkmk = 0,\n const SwIndex* pSttIdx = 0,\n const SwIndex* pEndIdx = 0 );\n\n\n#define SAVEFLY 1\n#define SAVEFLY_SPLIT 2\n\nvoid _SaveCntntIdx( SwDoc* pDoc, ULONG nNode, xub_StrLen nCntnt,\n SvULongs& rSaveArr, BYTE nSaveFly = 0 );\nvoid _RestoreCntntIdx( SwDoc* pDoc, SvULongs& rSaveArr,\n ULONG nNode, xub_StrLen nOffset = 0,\n BOOL bAuto = FALSE );\nvoid _RestoreCntntIdx( SvULongs& rSaveArr, const SwNode& rNd,\n xub_StrLen nLen, xub_StrLen nCorrLen );\n\n\n\/** data structure to temporarily hold fly anchor positions relative to some\n * location. *\/\nstruct _SaveFly\n{\n ULONG nNdDiff; \/\/\/ relative node difference\n SwFrmFmt* pFrmFmt; \/\/\/ the fly's frame format\n sal_Bool bInsertPosition; \/\/\/ if true, anchor _at_ insert position\n\n _SaveFly( ULONG nNodeDiff, SwFrmFmt* pFmt, sal_Bool bInsert )\n : nNdDiff( nNodeDiff ), pFrmFmt( pFmt ), bInsertPosition( bInsert )\n { }\n};\n\nSV_DECL_VARARR( _SaveFlyArr, _SaveFly, 0, 10 )\n\nvoid _RestFlyInRange( _SaveFlyArr& rArr, const SwNodeIndex& rSttIdx,\n const SwNodeIndex* pInsPos );\nvoid _SaveFlyInRange( const SwNodeRange& rRg, _SaveFlyArr& rArr );\nvoid _SaveFlyInRange( const SwPaM& rPam, const SwNodeIndex& rInsPos,\n _SaveFlyArr& rArr, sal_Bool bMoveAllFlys );\n\nvoid DelFlyInRange( const SwNodeIndex& rMkNdIdx,\n const SwNodeIndex& rPtNdIdx );\n\n\nclass SwDataChanged\n{\n const SwPaM* pPam;\n const SwPosition* pPos;\n SwDoc* pDoc;\n ULONG nNode;\n xub_StrLen nCntnt;\n USHORT nType; \/\/ Insert\/Move\/Delete\/... (UndoIds)\n\npublic:\n SwDataChanged( const SwPaM& rPam, USHORT nType );\n SwDataChanged( SwDoc* pDoc, const SwPosition& rPos, USHORT nType );\n ~SwDataChanged();\n\n ULONG GetNode() const { return nNode; }\n xub_StrLen GetCntnt() const { return nCntnt; }\n};\n\n\n\/\/ Funktions-Deklaration damit auch alles unter der CrsrShell mal die\n\/\/ Crsr verschieben kann\n\/\/ die Funktionen rufen nicht die SwDoc::Corr - Methoden!\n\n \/\/ Setzt alle PaMs an OldPos auf NewPos + Offset\nvoid PaMCorrAbs( const SwPosition &rOldPos,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n \/\/ Setzt alle PaMs in OldNode auf NewPos + Offset\nvoid PaMCorrAbs( const SwNodeIndex &rOldNode,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n \/\/ Setzt alle PaMs im Bereich vom Range nach NewPos\nvoid PaMCorrAbs( const SwPaM& rRange,\n const SwPosition& rNewPos );\n\n \/\/ Setzt alle PaMs im Bereich von [StartNode, EndNode] nach NewPos\nvoid PaMCorrAbs( const SwNodeIndex &rStartNode,\n const SwNodeIndex &rEndNode,\n const SwPosition &rNewPos );\n\n \/\/ Setzt alle PaMs in OldNode auf relative Pos\nvoid PaMCorrRel( const SwNodeIndex &rOldNode,\n const SwPosition &rNewPos,\n const xub_StrLen nOffset = 0 );\n\n\n\/\/ Hilfsklasse zum kopieren von absatzgebundenen Flys. Durch die Sortierung\n\/\/ nach der Ordnungsnummer wird versucht die layout seitige Anordnung\n\/\/ bei zu behalten\nclass _ZSortFly\n{\n const SwFrmFmt* pFmt;\n const SwFmtAnchor* pAnchor;\n UINT32 nOrdNum;\n\npublic:\n _ZSortFly( const SwFrmFmt* pFrmFmt, const SwFmtAnchor* pFlyAnchor,\n UINT32 nArrOrdNum );\n _ZSortFly& operator=( const _ZSortFly& rCpy )\n {\n pFmt = rCpy.pFmt, pAnchor = rCpy.pAnchor, nOrdNum = rCpy.nOrdNum;\n return *this;\n }\n\n int operator==( const _ZSortFly& ) const { return FALSE; }\n int operator<( const _ZSortFly& rCmp ) const\n { return nOrdNum < rCmp.nOrdNum; }\n\n const SwFrmFmt* GetFmt() const { return pFmt; }\n const SwFmtAnchor* GetAnchor() const { return pAnchor; }\n};\n\nSV_DECL_VARARR_SORT( _ZSortFlys, _ZSortFly, 0, 10 )\n\n\nclass SwTblNumFmtMerge\n{\n SvNumberFormatter* pNFmt;\npublic:\n SwTblNumFmtMerge( const SwDoc& rSrc, SwDoc& rDest );\n ~SwTblNumFmtMerge();\n};\n\n\nclass _SaveRedlEndPosForRestore\n{\n SvPtrarr* pSavArr;\n SwNodeIndex* pSavIdx;\n xub_StrLen nSavCntnt;\n\n void _Restore();\npublic:\n _SaveRedlEndPosForRestore( const SwNodeIndex& rInsIdx, xub_StrLen nCntnt );\n ~_SaveRedlEndPosForRestore();\n void Restore() { if( pSavArr ) _Restore(); }\n};\n\n\n#endif \/\/ _MVSAVE_HXX\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"content\/browser\/tracing\/tracing_controller_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/file_util.h\"\n#include \"base\/json\/string_escape.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"content\/browser\/tracing\/trace_message_filter.h\"\n#include \"content\/common\/child_process_messages.h\"\n#include \"content\/public\/browser\/browser_message_filter.h\"\n#include \"content\/public\/common\/content_switches.h\"\n\nusing base::debug::TraceLog;\n\nnamespace content {\n\nnamespace {\n\nbase::LazyInstance<TracingControllerImpl>::Leaky g_controller =\n LAZY_INSTANCE_INITIALIZER;\n\n} \/\/ namespace\n\nTracingController* TracingController::GetInstance() {\n return TracingControllerImpl::GetInstance();\n}\n\nTracingControllerImpl::TracingControllerImpl() :\n pending_disable_recording_ack_count_(0),\n pending_capture_monitoring_snapshot_ack_count_(0),\n is_recording_(false),\n is_monitoring_(false),\n category_filter_(\n base::debug::CategoryFilter::kDefaultCategoryFilterString),\n result_file_(0),\n result_file_has_at_least_one_result_(false) {\n}\n\nTracingControllerImpl::~TracingControllerImpl() {\n \/\/ This is a Leaky instance.\n NOTREACHED();\n}\n\nTracingControllerImpl* TracingControllerImpl::GetInstance() {\n return g_controller.Pointer();\n}\n\nvoid TracingControllerImpl::GetCategories(\n const GetCategoriesDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n \/\/ Known categories come back from child processes with the EndTracingAck\n \/\/ message. So to get known categories, just begin and end tracing immediately\n \/\/ afterwards. This will ping all the child processes for categories.\n pending_get_categories_done_callback_ = callback;\n EnableRecording(base::debug::CategoryFilter(\"*\"),\n TracingController::Options(),\n EnableRecordingDoneCallback());\n DisableRecording(TracingFileResultCallback());\n}\n\nbool TracingControllerImpl::EnableRecording(\n const base::debug::CategoryFilter& filter,\n TracingController::Options options,\n const EnableRecordingDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_enable_recording())\n return false;\n\n trace_options_ = TraceLog::GetInstance()->trace_options();\n TraceLog::GetInstance()->SetEnabled(filter, trace_options_);\n\n is_recording_ = true;\n category_filter_ = TraceLog::GetInstance()->GetCurrentCategoryFilter();\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendBeginTracing(category_filter_.ToString(), trace_options_);\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nbool TracingControllerImpl::DisableRecording(\n const TracingFileResultCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_recording())\n return false;\n\n pending_disable_recording_done_callback_ = callback;\n\n \/\/ Disable local trace early to avoid traces during end-tracing process from\n \/\/ interfering with the process.\n TraceLog::GetInstance()->SetDisabled();\n\n \/\/ We don't need to create a temporary file when getting categories.\n if (pending_get_categories_done_callback_.is_null()) {\n base::FilePath temporary_file;\n file_util::CreateTemporaryFile(&temporary_file);\n result_file_path_.reset(new base::FilePath(temporary_file));\n result_file_ = file_util::OpenFile(*result_file_path_, \"w\");\n result_file_has_at_least_one_result_ = false;\n const char* preamble = \"{\\\"traceEvents\\\": [\";\n fwrite(preamble, strlen(preamble), 1, result_file_);\n }\n\n \/\/ There could be a case where there are no child processes and filters_\n \/\/ is empty. In that case we can immediately tell the subscriber that tracing\n \/\/ has ended. To avoid recursive calls back to the subscriber, we will just\n \/\/ use the existing asynchronous OnDisableRecordingAcked code.\n \/\/ Count myself (local trace) in pending_disable_recording_ack_count_,\n \/\/ acked below.\n pending_disable_recording_ack_count_ = filters_.size() + 1;\n\n \/\/ Handle special case of zero child processes.\n if (pending_disable_recording_ack_count_ == 1) {\n \/\/ Ack asynchronously now, because we don't have any children to wait for.\n std::vector<std::string> category_groups;\n TraceLog::GetInstance()->GetKnownCategoryGroups(&category_groups);\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnDisableRecordingAcked,\n base::Unretained(this), category_groups));\n }\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendEndTracing();\n }\n return true;\n}\n\nbool TracingControllerImpl::EnableMonitoring(\n const base::debug::CategoryFilter& filter,\n TracingController::Options options,\n const EnableMonitoringDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_enable_monitoring())\n return false;\n is_monitoring_ = true;\n\n int monitoring_tracing_options = 0;\n if (options & ENABLE_SAMPLING)\n monitoring_tracing_options |= base::debug::TraceLog::MONITOR_SAMPLING;\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendEnableMonitoring(filter.ToString(),\n base::debug::TraceLog::Options(monitoring_tracing_options));\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nbool TracingControllerImpl::DisableMonitoring(\n const DisableMonitoringDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_monitoring())\n return false;\n is_monitoring_ = false;\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendDisableMonitoring();\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nvoid TracingControllerImpl::GetMonitoringStatus(\n bool* out_enabled,\n base::debug::CategoryFilter* out_filter,\n TracingController::Options* out_options) {\n NOTIMPLEMENTED();\n}\n\nvoid TracingControllerImpl::CaptureMonitoringSnapshot(\n const TracingFileResultCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_monitoring())\n return;\n\n pending_capture_monitoring_snapshot_done_callback_ = callback;\n\n base::FilePath temporary_file;\n file_util::CreateTemporaryFile(&temporary_file);\n result_file_path_.reset(new base::FilePath(temporary_file));\n result_file_ = file_util::OpenFile(*result_file_path_, \"w\");\n result_file_has_at_least_one_result_ = false;\n const char* preamble = \"{\\\"traceEvents\\\": [\";\n fwrite(preamble, strlen(preamble), 1, result_file_);\n\n \/\/ There could be a case where there are no child processes and filters_\n \/\/ is empty. In that case we can immediately tell the subscriber that tracing\n \/\/ has ended. To avoid recursive calls back to the subscriber, we will just\n \/\/ use the existing asynchronous OnCaptureMonitoringSnapshotAcked code.\n \/\/ Count myself in pending_capture_monitoring_snapshot_ack_count_,\n \/\/ acked below.\n pending_capture_monitoring_snapshot_ack_count_ = filters_.size() + 1;\n\n \/\/ Handle special case of zero child processes.\n if (pending_capture_monitoring_snapshot_ack_count_ == 1) {\n \/\/ Ack asynchronously now, because we don't have any children to wait for.\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnCaptureMonitoringSnapshotAcked,\n base::Unretained(this)));\n }\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendCaptureMonitoringSnapshot();\n }\n}\n\nvoid TracingControllerImpl::AddFilter(TraceMessageFilter* filter) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::AddFilter, base::Unretained(this),\n make_scoped_refptr(filter)));\n return;\n }\n\n filters_.insert(filter);\n if (can_disable_recording()) {\n std::string cf_str = category_filter_.ToString();\n filter->SendBeginTracing(cf_str, trace_options_);\n }\n}\n\nvoid TracingControllerImpl::RemoveFilter(TraceMessageFilter* filter) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::RemoveFilter, base::Unretained(this),\n make_scoped_refptr(filter)));\n return;\n }\n\n filters_.erase(filter);\n}\n\nvoid TracingControllerImpl::OnDisableRecordingAcked(\n const std::vector<std::string>& known_category_groups) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnDisableRecordingAcked,\n base::Unretained(this), known_category_groups));\n return;\n }\n\n \/\/ Merge known_category_groups with known_category_groups_\n known_category_groups_.insert(known_category_groups.begin(),\n known_category_groups.end());\n\n if (pending_disable_recording_ack_count_ == 0)\n return;\n\n if (--pending_disable_recording_ack_count_ == 1) {\n \/\/ All acks from subprocesses have been received. Now flush the local trace.\n \/\/ During or after this call, our OnLocalTraceDataCollected will be\n \/\/ called with the last of the local trace data.\n TraceLog::GetInstance()->Flush(\n base::Bind(&TracingControllerImpl::OnLocalTraceDataCollected,\n base::Unretained(this)));\n }\n\n if (pending_disable_recording_ack_count_ != 0)\n return;\n\n \/\/ All acks (including from the subprocesses and the local trace) have been\n \/\/ received.\n is_recording_ = false;\n\n \/\/ Trigger callback if one is set.\n if (!pending_get_categories_done_callback_.is_null()) {\n pending_get_categories_done_callback_.Run(known_category_groups_);\n pending_get_categories_done_callback_.Reset();\n } else if (!pending_disable_recording_done_callback_.is_null()) {\n const char* trailout = \"]}\";\n fwrite(trailout, strlen(trailout), 1, result_file_);\n file_util::CloseFile(result_file_);\n result_file_ = 0;\n pending_disable_recording_done_callback_.Run(result_file_path_.Pass());\n pending_disable_recording_done_callback_.Reset();\n }\n}\n\nvoid TracingControllerImpl::OnCaptureMonitoringSnapshotAcked() {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnCaptureMonitoringSnapshotAcked,\n base::Unretained(this)));\n return;\n }\n\n if (pending_capture_monitoring_snapshot_ack_count_ == 0)\n return;\n\n if (--pending_capture_monitoring_snapshot_ack_count_ == 1) {\n \/\/ All acks from subprocesses have been received. Now flush the local trace.\n \/\/ During or after this call, our OnLocalMonitoringTraceDataCollected\n \/\/ will be called with the last of the local trace data.\n TraceLog::GetInstance()->FlushButLeaveBufferIntact(\n base::Bind(&TracingControllerImpl::OnLocalMonitoringTraceDataCollected,\n base::Unretained(this)));\n }\n\n if (pending_capture_monitoring_snapshot_ack_count_ != 0)\n return;\n\n if (!pending_capture_monitoring_snapshot_done_callback_.is_null()) {\n const char* trailout = \"]}\";\n fwrite(trailout, strlen(trailout), 1, result_file_);\n file_util::CloseFile(result_file_);\n result_file_ = 0;\n pending_capture_monitoring_snapshot_done_callback_.Run(\n result_file_path_.Pass());\n pending_capture_monitoring_snapshot_done_callback_.Reset();\n }\n}\n\nvoid TracingControllerImpl::OnTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr) {\n \/\/ OnTraceDataCollected may be called from any browser thread, either by the\n \/\/ local event trace system or from child processes via TraceMessageFilter.\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnTraceDataCollected,\n base::Unretained(this), events_str_ptr));\n return;\n }\n\n \/\/ Drop trace events if we are just getting categories.\n if (!pending_get_categories_done_callback_.is_null())\n return;\n\n \/\/ If there is already a result in the file, then put a commma\n \/\/ before the next batch of results.\n if (result_file_has_at_least_one_result_) {\n fwrite(\",\", 1, 1, result_file_);\n } else {\n result_file_has_at_least_one_result_ = true;\n }\n fwrite(events_str_ptr->data().c_str(), events_str_ptr->data().size(), 1,\n result_file_);\n}\n\nvoid TracingControllerImpl::OnLocalTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr,\n bool has_more_events) {\n if (events_str_ptr->data().size())\n OnTraceDataCollected(events_str_ptr);\n\n if (has_more_events)\n return;\n\n \/\/ Simulate an DisableRecordingAcked for the local trace.\n std::vector<std::string> category_groups;\n TraceLog::GetInstance()->GetKnownCategoryGroups(&category_groups);\n OnDisableRecordingAcked(category_groups);\n}\n\nvoid TracingControllerImpl::OnLocalMonitoringTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr,\n bool has_more_events) {\n if (events_str_ptr->data().size())\n OnTraceDataCollected(events_str_ptr);\n\n if (has_more_events)\n return;\n\n \/\/ Simulate an CaptureMonitoringSnapshotAcked for the local trace.\n OnCaptureMonitoringSnapshotAcked();\n}\n\n} \/\/ namespace content\n<commit_msg>Fix failures in chrome os after r227262<commit_after>\/\/ Copyright 2013 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"content\/browser\/tracing\/tracing_controller_impl.h\"\n\n#include \"base\/bind.h\"\n#include \"base\/file_util.h\"\n#include \"base\/json\/string_escape.h\"\n#include \"base\/strings\/string_number_conversions.h\"\n#include \"content\/browser\/tracing\/trace_message_filter.h\"\n#include \"content\/common\/child_process_messages.h\"\n#include \"content\/public\/browser\/browser_message_filter.h\"\n#include \"content\/public\/common\/content_switches.h\"\n\nusing base::debug::TraceLog;\n\nnamespace content {\n\nnamespace {\n\nbase::LazyInstance<TracingControllerImpl>::Leaky g_controller =\n LAZY_INSTANCE_INITIALIZER;\n\n} \/\/ namespace\n\nTracingController* TracingController::GetInstance() {\n return TracingControllerImpl::GetInstance();\n}\n\nTracingControllerImpl::TracingControllerImpl() :\n pending_disable_recording_ack_count_(0),\n pending_capture_monitoring_snapshot_ack_count_(0),\n is_recording_(false),\n is_monitoring_(false),\n category_filter_(\n base::debug::CategoryFilter::kDefaultCategoryFilterString),\n result_file_(0),\n result_file_has_at_least_one_result_(false) {\n}\n\nTracingControllerImpl::~TracingControllerImpl() {\n \/\/ This is a Leaky instance.\n NOTREACHED();\n}\n\nTracingControllerImpl* TracingControllerImpl::GetInstance() {\n return g_controller.Pointer();\n}\n\nvoid TracingControllerImpl::GetCategories(\n const GetCategoriesDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n \/\/ Known categories come back from child processes with the EndTracingAck\n \/\/ message. So to get known categories, just begin and end tracing immediately\n \/\/ afterwards. This will ping all the child processes for categories.\n pending_get_categories_done_callback_ = callback;\n EnableRecording(base::debug::CategoryFilter(\"*\"),\n TracingController::Options(),\n EnableRecordingDoneCallback());\n DisableRecording(TracingFileResultCallback());\n}\n\nbool TracingControllerImpl::EnableRecording(\n const base::debug::CategoryFilter& filter,\n TracingController::Options options,\n const EnableRecordingDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_enable_recording())\n return false;\n\n trace_options_ = TraceLog::GetInstance()->trace_options();\n TraceLog::GetInstance()->SetEnabled(filter, trace_options_);\n\n is_recording_ = true;\n category_filter_ = TraceLog::GetInstance()->GetCurrentCategoryFilter();\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendBeginTracing(category_filter_.ToString(), trace_options_);\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nbool TracingControllerImpl::DisableRecording(\n const TracingFileResultCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_recording())\n return false;\n\n pending_disable_recording_done_callback_ = callback;\n\n \/\/ Disable local trace early to avoid traces during end-tracing process from\n \/\/ interfering with the process.\n TraceLog::GetInstance()->SetDisabled();\n\n \/\/ We don't need to create a temporary file when getting categories.\n if (pending_get_categories_done_callback_.is_null()) {\n base::FilePath temporary_file;\n file_util::CreateTemporaryFile(&temporary_file);\n result_file_path_.reset(new base::FilePath(temporary_file));\n result_file_ = file_util::OpenFile(*result_file_path_, \"w\");\n result_file_has_at_least_one_result_ = false;\n const char* preamble = \"{\\\"traceEvents\\\": [\";\n size_t written_bytes = fwrite(preamble, strlen(preamble), 1, result_file_);\n DCHECK(written_bytes == strlen(preamble));\n }\n\n \/\/ There could be a case where there are no child processes and filters_\n \/\/ is empty. In that case we can immediately tell the subscriber that tracing\n \/\/ has ended. To avoid recursive calls back to the subscriber, we will just\n \/\/ use the existing asynchronous OnDisableRecordingAcked code.\n \/\/ Count myself (local trace) in pending_disable_recording_ack_count_,\n \/\/ acked below.\n pending_disable_recording_ack_count_ = filters_.size() + 1;\n\n \/\/ Handle special case of zero child processes.\n if (pending_disable_recording_ack_count_ == 1) {\n \/\/ Ack asynchronously now, because we don't have any children to wait for.\n std::vector<std::string> category_groups;\n TraceLog::GetInstance()->GetKnownCategoryGroups(&category_groups);\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnDisableRecordingAcked,\n base::Unretained(this), category_groups));\n }\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendEndTracing();\n }\n return true;\n}\n\nbool TracingControllerImpl::EnableMonitoring(\n const base::debug::CategoryFilter& filter,\n TracingController::Options options,\n const EnableMonitoringDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_enable_monitoring())\n return false;\n is_monitoring_ = true;\n\n int monitoring_tracing_options = 0;\n if (options & ENABLE_SAMPLING)\n monitoring_tracing_options |= base::debug::TraceLog::MONITOR_SAMPLING;\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendEnableMonitoring(filter.ToString(),\n base::debug::TraceLog::Options(monitoring_tracing_options));\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nbool TracingControllerImpl::DisableMonitoring(\n const DisableMonitoringDoneCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_monitoring())\n return false;\n is_monitoring_ = false;\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendDisableMonitoring();\n }\n\n if (!callback.is_null())\n callback.Run();\n return true;\n}\n\nvoid TracingControllerImpl::GetMonitoringStatus(\n bool* out_enabled,\n base::debug::CategoryFilter* out_filter,\n TracingController::Options* out_options) {\n NOTIMPLEMENTED();\n}\n\nvoid TracingControllerImpl::CaptureMonitoringSnapshot(\n const TracingFileResultCallback& callback) {\n DCHECK(BrowserThread::CurrentlyOn(BrowserThread::UI));\n\n if (!can_disable_monitoring())\n return;\n\n pending_capture_monitoring_snapshot_done_callback_ = callback;\n\n base::FilePath temporary_file;\n file_util::CreateTemporaryFile(&temporary_file);\n result_file_path_.reset(new base::FilePath(temporary_file));\n result_file_ = file_util::OpenFile(*result_file_path_, \"w\");\n result_file_has_at_least_one_result_ = false;\n const char* preamble = \"{\\\"traceEvents\\\": [\";\n size_t written_bytes = fwrite(preamble, strlen(preamble), 1, result_file_);\n DCHECK(written_bytes == strlen(preamble));\n\n \/\/ There could be a case where there are no child processes and filters_\n \/\/ is empty. In that case we can immediately tell the subscriber that tracing\n \/\/ has ended. To avoid recursive calls back to the subscriber, we will just\n \/\/ use the existing asynchronous OnCaptureMonitoringSnapshotAcked code.\n \/\/ Count myself in pending_capture_monitoring_snapshot_ack_count_,\n \/\/ acked below.\n pending_capture_monitoring_snapshot_ack_count_ = filters_.size() + 1;\n\n \/\/ Handle special case of zero child processes.\n if (pending_capture_monitoring_snapshot_ack_count_ == 1) {\n \/\/ Ack asynchronously now, because we don't have any children to wait for.\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnCaptureMonitoringSnapshotAcked,\n base::Unretained(this)));\n }\n\n \/\/ Notify all child processes.\n for (FilterMap::iterator it = filters_.begin(); it != filters_.end(); ++it) {\n it->get()->SendCaptureMonitoringSnapshot();\n }\n}\n\nvoid TracingControllerImpl::AddFilter(TraceMessageFilter* filter) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::AddFilter, base::Unretained(this),\n make_scoped_refptr(filter)));\n return;\n }\n\n filters_.insert(filter);\n if (can_disable_recording()) {\n std::string cf_str = category_filter_.ToString();\n filter->SendBeginTracing(cf_str, trace_options_);\n }\n}\n\nvoid TracingControllerImpl::RemoveFilter(TraceMessageFilter* filter) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::RemoveFilter, base::Unretained(this),\n make_scoped_refptr(filter)));\n return;\n }\n\n filters_.erase(filter);\n}\n\nvoid TracingControllerImpl::OnDisableRecordingAcked(\n const std::vector<std::string>& known_category_groups) {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnDisableRecordingAcked,\n base::Unretained(this), known_category_groups));\n return;\n }\n\n \/\/ Merge known_category_groups with known_category_groups_\n known_category_groups_.insert(known_category_groups.begin(),\n known_category_groups.end());\n\n if (pending_disable_recording_ack_count_ == 0)\n return;\n\n if (--pending_disable_recording_ack_count_ == 1) {\n \/\/ All acks from subprocesses have been received. Now flush the local trace.\n \/\/ During or after this call, our OnLocalTraceDataCollected will be\n \/\/ called with the last of the local trace data.\n TraceLog::GetInstance()->Flush(\n base::Bind(&TracingControllerImpl::OnLocalTraceDataCollected,\n base::Unretained(this)));\n }\n\n if (pending_disable_recording_ack_count_ != 0)\n return;\n\n \/\/ All acks (including from the subprocesses and the local trace) have been\n \/\/ received.\n is_recording_ = false;\n\n \/\/ Trigger callback if one is set.\n if (!pending_get_categories_done_callback_.is_null()) {\n pending_get_categories_done_callback_.Run(known_category_groups_);\n pending_get_categories_done_callback_.Reset();\n } else if (!pending_disable_recording_done_callback_.is_null()) {\n const char* trailout = \"]}\";\n size_t written_bytes = fwrite(trailout, strlen(trailout), 1, result_file_);\n DCHECK(written_bytes == strlen(trailout));\n file_util::CloseFile(result_file_);\n result_file_ = 0;\n pending_disable_recording_done_callback_.Run(result_file_path_.Pass());\n pending_disable_recording_done_callback_.Reset();\n }\n}\n\nvoid TracingControllerImpl::OnCaptureMonitoringSnapshotAcked() {\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnCaptureMonitoringSnapshotAcked,\n base::Unretained(this)));\n return;\n }\n\n if (pending_capture_monitoring_snapshot_ack_count_ == 0)\n return;\n\n if (--pending_capture_monitoring_snapshot_ack_count_ == 1) {\n \/\/ All acks from subprocesses have been received. Now flush the local trace.\n \/\/ During or after this call, our OnLocalMonitoringTraceDataCollected\n \/\/ will be called with the last of the local trace data.\n TraceLog::GetInstance()->FlushButLeaveBufferIntact(\n base::Bind(&TracingControllerImpl::OnLocalMonitoringTraceDataCollected,\n base::Unretained(this)));\n }\n\n if (pending_capture_monitoring_snapshot_ack_count_ != 0)\n return;\n\n if (!pending_capture_monitoring_snapshot_done_callback_.is_null()) {\n const char* trailout = \"]}\";\n size_t written_bytes = fwrite(trailout, strlen(trailout), 1, result_file_);\n DCHECK(written_bytes == strlen(trailout));\n file_util::CloseFile(result_file_);\n result_file_ = 0;\n pending_capture_monitoring_snapshot_done_callback_.Run(\n result_file_path_.Pass());\n pending_capture_monitoring_snapshot_done_callback_.Reset();\n }\n}\n\nvoid TracingControllerImpl::OnTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr) {\n \/\/ OnTraceDataCollected may be called from any browser thread, either by the\n \/\/ local event trace system or from child processes via TraceMessageFilter.\n if (!BrowserThread::CurrentlyOn(BrowserThread::UI)) {\n BrowserThread::PostTask(BrowserThread::UI, FROM_HERE,\n base::Bind(&TracingControllerImpl::OnTraceDataCollected,\n base::Unretained(this), events_str_ptr));\n return;\n }\n\n \/\/ Drop trace events if we are just getting categories.\n if (!pending_get_categories_done_callback_.is_null())\n return;\n\n \/\/ If there is already a result in the file, then put a commma\n \/\/ before the next batch of results.\n if (result_file_has_at_least_one_result_) {\n size_t written_bytes = fwrite(\",\", 1, 1, result_file_);\n DCHECK(written_bytes == 1);\n } else {\n result_file_has_at_least_one_result_ = true;\n }\n size_t written_bytes = fwrite(events_str_ptr->data().c_str(),\n events_str_ptr->data().size(), 1,\n result_file_);\n DCHECK(written_bytes == events_str_ptr->data().size());\n}\n\nvoid TracingControllerImpl::OnLocalTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr,\n bool has_more_events) {\n if (events_str_ptr->data().size())\n OnTraceDataCollected(events_str_ptr);\n\n if (has_more_events)\n return;\n\n \/\/ Simulate an DisableRecordingAcked for the local trace.\n std::vector<std::string> category_groups;\n TraceLog::GetInstance()->GetKnownCategoryGroups(&category_groups);\n OnDisableRecordingAcked(category_groups);\n}\n\nvoid TracingControllerImpl::OnLocalMonitoringTraceDataCollected(\n const scoped_refptr<base::RefCountedString>& events_str_ptr,\n bool has_more_events) {\n if (events_str_ptr->data().size())\n OnTraceDataCollected(events_str_ptr);\n\n if (has_more_events)\n return;\n\n \/\/ Simulate an CaptureMonitoringSnapshotAcked for the local trace.\n OnCaptureMonitoringSnapshotAcked();\n}\n\n} \/\/ namespace content\n<|endoftext|>"} {"text":"<commit_before>#include \"SyncOutputObject.h\"\n\n#include <maya\/MFloatArray.h>\n#include <maya\/MGlobal.h>\n#include <maya\/MPlug.h>\n\n#include <maya\/MFnDependencyNode.h>\n#include <maya\/MFnDagNode.h>\n#include <maya\/MDagPath.h>\n\n#include \"AssetNode.h\"\n#include \"SyncOutputGeometryPart.h\"\n#include \"SyncOutputInstance.h\"\n\n#if MAYA_API_VERSION >= 201400\n #include <maya\/MFnFloatArrayData.h>\n#endif\n\nSyncOutputObject::SyncOutputObject(\n const MPlug &outputPlug,\n const MObject &assetNodeObj,\n const bool visible,\n const bool syncTemplatedGeos)\n : myOutputPlug(outputPlug),\n myAssetNodeObj(assetNodeObj),\n myVisible(visible),\n mySyncTemplatedGeos(syncTemplatedGeos)\n{}\n\nSyncOutputObject::~SyncOutputObject()\n{\n for(AssetSyncs::const_iterator it = myAssetSyncs.begin();\n it != myAssetSyncs.end();\n it++)\n {\n delete *it;\n }\n myAssetSyncs.clear();\n}\n\nMStatus\nSyncOutputObject::doIt()\n{\n MStatus status;\n \/\/ Create our parts.\n \/\/ An object just contains a number of parts, and no\n \/\/ other information.\n MFnDependencyNode assetNodeFn(myAssetNodeObj, &status);\n\n MObject objectTransform = myDagModifier.createNode(\"transform\", myAssetNodeObj, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ rename objectTransform\n MPlug objectNamePlug = myOutputPlug.child(AssetNode::outputObjectName);\n\n MString objectName = objectNamePlug.asString();\n if(objectName.length())\n {\n objectName = Util::sanitizeStringForNodeName(objectName);\n }\n else\n {\n objectName = \"emptyObject\";\n }\n status = myDagModifier.renameNode(objectTransform, objectName);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n\n MFnDependencyNode objectTransformFn(objectTransform);\n\n \/\/ connect objectTransform attributes\n {\n MPlug transformPlug = myOutputPlug.child(AssetNode::outputObjectTransform);\n\n MPlug srcPlug;\n MPlug dstPlug;\n\n srcPlug = transformPlug.child(AssetNode::outputObjectTranslate);\n dstPlug = objectTransformFn.findPlug(\"translate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = transformPlug.child(AssetNode::outputObjectRotate);\n dstPlug = objectTransformFn.findPlug(\"rotate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = transformPlug.child(AssetNode::outputObjectScale);\n dstPlug = objectTransformFn.findPlug(\"scale\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n }\n\n if(!myVisible)\n {\n status = myDagModifier.newPlugValueBool(\n objectTransformFn.findPlug(\"visibility\"),\n false\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n MPlug geosPlug = myOutputPlug.child(AssetNode::outputGeos);\n int geoCount = geosPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int ii = 0; ii < geoCount; ii++)\n {\n MPlug geoPlug = geosPlug[ii];\n\n MObject geoTransform = MObject::kNullObj;\n MObject partParent = objectTransform;\n\n MPlug isTemplatedPlug = geoPlug.child(AssetNode::outputGeoIsTemplated);\n MPlug isDisplayGeoPlug = geoPlug.child(AssetNode::outputGeoIsDisplayGeo);\n if(mySyncTemplatedGeos || !isTemplatedPlug.asBool() || isDisplayGeoPlug.asBool())\n {\n if(geoCount > 1)\n {\n geoTransform = myDagModifier.createNode(\"transform\", objectTransform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ rename geoTransform\n MPlug geoNamePlug = geoPlug.child(AssetNode::outputGeoName);\n MString geoName = geoNamePlug.asString();\n if(geoName.length())\n {\n geoName = Util::sanitizeStringForNodeName(geoName);\n }\n else\n {\n geoName = \"emptyGeo\";\n }\n status = myDagModifier.renameNode(geoTransform, geoName);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n\n partParent = geoTransform;\n }\n\n MPlug partsPlug = geoPlug.child(AssetNode::outputParts);\n int partCount = partsPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int jj=0; jj<partCount; jj++)\n {\n SubCommand* sync = new SyncOutputGeometryPart(partsPlug[jj], partParent);\n sync->doIt();\n myAssetSyncs.push_back(sync);\n }\n }\n }\n\n#if MAYA_API_VERSION >= 201400\n createFluidShape(objectTransform);\n#endif\n\n return MStatus::kSuccess;\n}\n\n#if MAYA_API_VERSION >= 201400\nMStatus\nSyncOutputObject::createVelocityConverter(MObject& velocityConverter)\n{\n if(!velocityConverter.isNull())\n return MS::kSuccess;\n\n MStatus status;\n velocityConverter = ((MDGModifier&)myDagModifier).createNode(\"houdiniFluidVelocityConvert\", &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n return status;\n}\n\nbool\nSyncOutputObject::resolutionsEqual(MPlug resA, MPlug resB)\n{\n MPlug resAPlug = resA.child(AssetNode::outputPartVolumeRes);\n MObject resAObj;\n resAPlug.getValue(resAObj);\n\n MPlug resBPlug = resB.child(AssetNode::outputPartVolumeRes);\n MObject resBObj;\n resBPlug.getValue(resBObj);\n\n MStatus status;\n MFnFloatArrayData dataA(resAObj, &status);\n MFnFloatArrayData dataB(resBObj, &status);\n\n return dataA[0] == dataB[0] &&\n dataA[1] == dataB[1] &&\n dataA[2] == dataB[2];\n}\n\nMStatus\nSyncOutputObject::createFluidShape(const MObject &objectTransform)\n{\n MStatus status;\n\n MPlug geosPlug = myOutputPlug.child(AssetNode::outputGeos);\n int geoCount = geosPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int ii = 0; ii < geoCount; ii++)\n {\n MPlug geoPlug = geosPlug[ii];\n\n MPlug partsPlug = geoPlug.child(AssetNode::outputParts);\n int partCount = partsPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ Look for specific volume names. Once we've found the first reference\n \/\/ volume, look again through everything for any volumes which share a\n \/\/ transform with the first reference volume, and add them to the\n \/\/ fluidShape.\n bool hasFluid = false;\n MPlug referenceVolume;\n for(int jj=0; jj<partCount; jj++)\n {\n MPlug outputVolume = partsPlug[jj].child(AssetNode::outputPartVolume);\n MPlug outputPartName = partsPlug[jj].child(AssetNode::outputPartName);\n MPlug outputVolumeName = outputVolume.child(AssetNode::outputPartVolumeName);\n\n MString name = outputVolumeName.asString();\n\n if(name == \"density\"\n || name == \"temperature\"\n || name == \"fuel\"\n || name == \"vel.x\"\n || name == \"vel.y\"\n || name == \"vel.z\")\n {\n hasFluid = true;\n referenceVolume = outputVolume;\n break;\n }\n }\n\n if(!hasFluid)\n return MStatus::kSuccess;\n\n MObject transform, fluid;\n {\n transform = myDagModifier.createNode(\"transform\", objectTransform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n \/\/ TODO: name\n status = myDagModifier.renameNode(transform, \"fluid_transform\");\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n fluid = myDagModifier.createNode(\"fluidShape\", transform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n MPlug referenceRes = referenceVolume.child(AssetNode::outputPartVolumeRes);\n\n MFnDagNode partVolumeFn(fluid, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n MFnDagNode partFluidTransformFn(transform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n MObject velConverter;\n\n bool doneDensity = false;\n bool doneTemperature = false;\n bool doneFuel = false;\n bool doneVelX = false;\n bool doneVelY = false;\n bool doneVelZ = false;\n for(int jj=0; jj<partCount; jj++)\n {\n MPlug outputVolume = partsPlug[jj].child(AssetNode::outputPartVolume);\n MPlug outputVolumeName = outputVolume.child(AssetNode::outputPartVolumeName);\n MPlug outputVolumeRes= outputVolume.child(AssetNode::outputPartVolumeRes);\n\n \/\/ If the transform of the volumes are different, we don't want\n \/\/ to group them together.\n if(!resolutionsEqual(outputVolumeRes, referenceRes))\n continue;\n\n MPlug srcPlug = outputVolume.child(AssetNode::outputPartVolumeGrid);\n MString name = outputVolumeName.asString();\n if(name == \"density\" && !doneDensity)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inDensity\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"densityMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneDensity = true;\n }\n else if(name == \"temperature\" && !doneTemperature)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inTemperature\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"temperatureMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneTemperature = true;\n }\n else if(name == \"fuel\" && !doneFuel)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inReaction\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"fuelMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneFuel = true;\n }\n else if(name == \"vel.x\" && !doneVelX)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridX\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelX = true;\n }\n else if(name == \"vel.y\" && !doneVelY)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridY\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelY = true;\n }\n else if(name == \"vel.z\" && !doneVelZ)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridZ\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelZ = true;\n }\n }\n\n \/\/ Connect the transform, resolution, playFromCache; set inOffset and dimensions\n {\n MPlug srcPlug;\n MPlug dstPlug;\n\n MPlug densityTransform = referenceVolume.child(AssetNode::outputPartVolumeTransform);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeTranslate);\n dstPlug = partFluidTransformFn.findPlug(\"translate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = referenceVolume.child(AssetNode::outputPartVolumeRes);\n dstPlug = partVolumeFn.findPlug(\"inResolution\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeRotate);\n dstPlug = partFluidTransformFn.findPlug(\"rotate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeScale);\n dstPlug = partFluidTransformFn.findPlug(\"scale\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ Velocity needs an additional step: since houdini may output\n \/\/ individual grids for each component, we use a dependency node\n \/\/ to append and extrapolate the components\n if(!velConverter.isNull())\n {\n MFnDependencyNode velConverterFn(velConverter, &status);\n\n srcPlug = referenceVolume.child(AssetNode::outputPartVolumeRes);\n dstPlug = velConverterFn.findPlug(\"resolution\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = velConverterFn.findPlug(\"outGrid\");\n dstPlug = partVolumeFn.findPlug(\"inVelocity\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n \/\/ time1.outTime -> fluidShape.currentTime\n {\n MObject srcNode = Util::findNodeByName(\"time1\");\n srcPlug = MFnDependencyNode(srcNode).findPlug(\"outTime\");\n dstPlug = partVolumeFn.findPlug(\"currentTime\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n srcPlug = myOutputPlug.child(AssetNode::outputObjectFluidFromAsset);\n dstPlug = partVolumeFn.findPlug(\"playFromCache\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ inOffset must be initialized or bugs will be had; and the math is\n \/\/ simpler with dimensions all equal to 1.\n MFloatArray offset;\n offset.append(0);\n offset.append(0);\n offset.append(0);\n MFnFloatArrayData offsetCreator;\n MObject data = offsetCreator.create(offset);\n partVolumeFn.findPlug(\"inOffset\").setValue(data);\n partVolumeFn.findPlug(\"dimensionsW\").setValue(1);\n partVolumeFn.findPlug(\"dimensionsH\").setValue(1);\n partVolumeFn.findPlug(\"dimensionsD\").setValue(1);\n }\n\n \/\/ doIt so that we can access the fullPathName\n status = myDagModifier.doIt();\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ assign shader\n status = myDagModifier.commandToExecute(\n \"assignSG \" + partVolumeFn.fullPathName() + \" \" + partVolumeFn.fullPathName()\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n status = myDagModifier.doIt();\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n return MStatus::kSuccess;\n}\n#endif\n\nMStatus\nSyncOutputObject::undoIt()\n{\n for(AssetSyncs::reverse_iterator iter = myAssetSyncs.rbegin();\n iter != myAssetSyncs.rend();\n iter++)\n {\n (*iter)->undoIt();\n }\n myDagModifier.undoIt();\n\n return MStatus::kSuccess;\n}\n\nMStatus\nSyncOutputObject::redoIt()\n{\n myDagModifier.doIt();\n for(AssetSyncs::iterator iter = myAssetSyncs.begin();\n iter != myAssetSyncs.end();\n iter++)\n {\n (*iter)->redoIt();\n }\n\n return MStatus::kSuccess;\n}\n\nbool\nSyncOutputObject::isUndoable() const\n{\n return true;\n}\n<commit_msg>Change the fluid transform's name to \"fluid\"<commit_after>#include \"SyncOutputObject.h\"\n\n#include <maya\/MFloatArray.h>\n#include <maya\/MGlobal.h>\n#include <maya\/MPlug.h>\n\n#include <maya\/MFnDependencyNode.h>\n#include <maya\/MFnDagNode.h>\n#include <maya\/MDagPath.h>\n\n#include \"AssetNode.h\"\n#include \"SyncOutputGeometryPart.h\"\n#include \"SyncOutputInstance.h\"\n\n#if MAYA_API_VERSION >= 201400\n #include <maya\/MFnFloatArrayData.h>\n#endif\n\nSyncOutputObject::SyncOutputObject(\n const MPlug &outputPlug,\n const MObject &assetNodeObj,\n const bool visible,\n const bool syncTemplatedGeos)\n : myOutputPlug(outputPlug),\n myAssetNodeObj(assetNodeObj),\n myVisible(visible),\n mySyncTemplatedGeos(syncTemplatedGeos)\n{}\n\nSyncOutputObject::~SyncOutputObject()\n{\n for(AssetSyncs::const_iterator it = myAssetSyncs.begin();\n it != myAssetSyncs.end();\n it++)\n {\n delete *it;\n }\n myAssetSyncs.clear();\n}\n\nMStatus\nSyncOutputObject::doIt()\n{\n MStatus status;\n \/\/ Create our parts.\n \/\/ An object just contains a number of parts, and no\n \/\/ other information.\n MFnDependencyNode assetNodeFn(myAssetNodeObj, &status);\n\n MObject objectTransform = myDagModifier.createNode(\"transform\", myAssetNodeObj, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ rename objectTransform\n MPlug objectNamePlug = myOutputPlug.child(AssetNode::outputObjectName);\n\n MString objectName = objectNamePlug.asString();\n if(objectName.length())\n {\n objectName = Util::sanitizeStringForNodeName(objectName);\n }\n else\n {\n objectName = \"emptyObject\";\n }\n status = myDagModifier.renameNode(objectTransform, objectName);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n\n MFnDependencyNode objectTransformFn(objectTransform);\n\n \/\/ connect objectTransform attributes\n {\n MPlug transformPlug = myOutputPlug.child(AssetNode::outputObjectTransform);\n\n MPlug srcPlug;\n MPlug dstPlug;\n\n srcPlug = transformPlug.child(AssetNode::outputObjectTranslate);\n dstPlug = objectTransformFn.findPlug(\"translate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = transformPlug.child(AssetNode::outputObjectRotate);\n dstPlug = objectTransformFn.findPlug(\"rotate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = transformPlug.child(AssetNode::outputObjectScale);\n dstPlug = objectTransformFn.findPlug(\"scale\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n }\n\n if(!myVisible)\n {\n status = myDagModifier.newPlugValueBool(\n objectTransformFn.findPlug(\"visibility\"),\n false\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n MPlug geosPlug = myOutputPlug.child(AssetNode::outputGeos);\n int geoCount = geosPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int ii = 0; ii < geoCount; ii++)\n {\n MPlug geoPlug = geosPlug[ii];\n\n MObject geoTransform = MObject::kNullObj;\n MObject partParent = objectTransform;\n\n MPlug isTemplatedPlug = geoPlug.child(AssetNode::outputGeoIsTemplated);\n MPlug isDisplayGeoPlug = geoPlug.child(AssetNode::outputGeoIsDisplayGeo);\n if(mySyncTemplatedGeos || !isTemplatedPlug.asBool() || isDisplayGeoPlug.asBool())\n {\n if(geoCount > 1)\n {\n geoTransform = myDagModifier.createNode(\"transform\", objectTransform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ rename geoTransform\n MPlug geoNamePlug = geoPlug.child(AssetNode::outputGeoName);\n MString geoName = geoNamePlug.asString();\n if(geoName.length())\n {\n geoName = Util::sanitizeStringForNodeName(geoName);\n }\n else\n {\n geoName = \"emptyGeo\";\n }\n status = myDagModifier.renameNode(geoTransform, geoName);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n CHECK_MSTATUS_AND_RETURN_IT(myDagModifier.doIt());\n\n partParent = geoTransform;\n }\n\n MPlug partsPlug = geoPlug.child(AssetNode::outputParts);\n int partCount = partsPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int jj=0; jj<partCount; jj++)\n {\n SubCommand* sync = new SyncOutputGeometryPart(partsPlug[jj], partParent);\n sync->doIt();\n myAssetSyncs.push_back(sync);\n }\n }\n }\n\n#if MAYA_API_VERSION >= 201400\n createFluidShape(objectTransform);\n#endif\n\n return MStatus::kSuccess;\n}\n\n#if MAYA_API_VERSION >= 201400\nMStatus\nSyncOutputObject::createVelocityConverter(MObject& velocityConverter)\n{\n if(!velocityConverter.isNull())\n return MS::kSuccess;\n\n MStatus status;\n velocityConverter = ((MDGModifier&)myDagModifier).createNode(\"houdiniFluidVelocityConvert\", &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n return status;\n}\n\nbool\nSyncOutputObject::resolutionsEqual(MPlug resA, MPlug resB)\n{\n MPlug resAPlug = resA.child(AssetNode::outputPartVolumeRes);\n MObject resAObj;\n resAPlug.getValue(resAObj);\n\n MPlug resBPlug = resB.child(AssetNode::outputPartVolumeRes);\n MObject resBObj;\n resBPlug.getValue(resBObj);\n\n MStatus status;\n MFnFloatArrayData dataA(resAObj, &status);\n MFnFloatArrayData dataB(resBObj, &status);\n\n return dataA[0] == dataB[0] &&\n dataA[1] == dataB[1] &&\n dataA[2] == dataB[2];\n}\n\nMStatus\nSyncOutputObject::createFluidShape(const MObject &objectTransform)\n{\n MStatus status;\n\n MPlug geosPlug = myOutputPlug.child(AssetNode::outputGeos);\n int geoCount = geosPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n for(int ii = 0; ii < geoCount; ii++)\n {\n MPlug geoPlug = geosPlug[ii];\n\n MPlug partsPlug = geoPlug.child(AssetNode::outputParts);\n int partCount = partsPlug.evaluateNumElements(&status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ Look for specific volume names. Once we've found the first reference\n \/\/ volume, look again through everything for any volumes which share a\n \/\/ transform with the first reference volume, and add them to the\n \/\/ fluidShape.\n bool hasFluid = false;\n MPlug referenceVolume;\n for(int jj=0; jj<partCount; jj++)\n {\n MPlug outputVolume = partsPlug[jj].child(AssetNode::outputPartVolume);\n MPlug outputPartName = partsPlug[jj].child(AssetNode::outputPartName);\n MPlug outputVolumeName = outputVolume.child(AssetNode::outputPartVolumeName);\n\n MString name = outputVolumeName.asString();\n\n if(name == \"density\"\n || name == \"temperature\"\n || name == \"fuel\"\n || name == \"vel.x\"\n || name == \"vel.y\"\n || name == \"vel.z\")\n {\n hasFluid = true;\n referenceVolume = outputVolume;\n break;\n }\n }\n\n if(!hasFluid)\n return MStatus::kSuccess;\n\n MObject transform, fluid;\n {\n transform = myDagModifier.createNode(\"transform\", objectTransform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n \/\/ TODO: name\n status = myDagModifier.renameNode(transform, \"fluid\");\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n fluid = myDagModifier.createNode(\"fluidShape\", transform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n MPlug referenceRes = referenceVolume.child(AssetNode::outputPartVolumeRes);\n\n MFnDagNode partVolumeFn(fluid, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n MFnDagNode partFluidTransformFn(transform, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n MObject velConverter;\n\n bool doneDensity = false;\n bool doneTemperature = false;\n bool doneFuel = false;\n bool doneVelX = false;\n bool doneVelY = false;\n bool doneVelZ = false;\n for(int jj=0; jj<partCount; jj++)\n {\n MPlug outputVolume = partsPlug[jj].child(AssetNode::outputPartVolume);\n MPlug outputVolumeName = outputVolume.child(AssetNode::outputPartVolumeName);\n MPlug outputVolumeRes= outputVolume.child(AssetNode::outputPartVolumeRes);\n\n \/\/ If the transform of the volumes are different, we don't want\n \/\/ to group them together.\n if(!resolutionsEqual(outputVolumeRes, referenceRes))\n continue;\n\n MPlug srcPlug = outputVolume.child(AssetNode::outputPartVolumeGrid);\n MString name = outputVolumeName.asString();\n if(name == \"density\" && !doneDensity)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inDensity\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"densityMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneDensity = true;\n }\n else if(name == \"temperature\" && !doneTemperature)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inTemperature\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"temperatureMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneTemperature = true;\n }\n else if(name == \"fuel\" && !doneFuel)\n {\n status = myDagModifier.connect(srcPlug, partVolumeFn.findPlug(\"inReaction\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.newPlugValueInt(\n partVolumeFn.findPlug(\"fuelMethod\"),\n 2\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneFuel = true;\n }\n else if(name == \"vel.x\" && !doneVelX)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridX\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelX = true;\n }\n else if(name == \"vel.y\" && !doneVelY)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridY\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelY = true;\n }\n else if(name == \"vel.z\" && !doneVelZ)\n {\n createVelocityConverter(velConverter);\n MFnDependencyNode velConverterFn(velConverter, &status);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n status = myDagModifier.connect(srcPlug, velConverterFn.findPlug(\"inGridZ\"));\n CHECK_MSTATUS_AND_RETURN_IT(status);\n doneVelZ = true;\n }\n }\n\n \/\/ Connect the transform, resolution, playFromCache; set inOffset and dimensions\n {\n MPlug srcPlug;\n MPlug dstPlug;\n\n MPlug densityTransform = referenceVolume.child(AssetNode::outputPartVolumeTransform);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeTranslate);\n dstPlug = partFluidTransformFn.findPlug(\"translate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = referenceVolume.child(AssetNode::outputPartVolumeRes);\n dstPlug = partVolumeFn.findPlug(\"inResolution\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeRotate);\n dstPlug = partFluidTransformFn.findPlug(\"rotate\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = densityTransform.child(AssetNode::outputPartVolumeScale);\n dstPlug = partFluidTransformFn.findPlug(\"scale\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ Velocity needs an additional step: since houdini may output\n \/\/ individual grids for each component, we use a dependency node\n \/\/ to append and extrapolate the components\n if(!velConverter.isNull())\n {\n MFnDependencyNode velConverterFn(velConverter, &status);\n\n srcPlug = referenceVolume.child(AssetNode::outputPartVolumeRes);\n dstPlug = velConverterFn.findPlug(\"resolution\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n srcPlug = velConverterFn.findPlug(\"outGrid\");\n dstPlug = partVolumeFn.findPlug(\"inVelocity\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n \/\/ time1.outTime -> fluidShape.currentTime\n {\n MObject srcNode = Util::findNodeByName(\"time1\");\n srcPlug = MFnDependencyNode(srcNode).findPlug(\"outTime\");\n dstPlug = partVolumeFn.findPlug(\"currentTime\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n srcPlug = myOutputPlug.child(AssetNode::outputObjectFluidFromAsset);\n dstPlug = partVolumeFn.findPlug(\"playFromCache\");\n status = myDagModifier.connect(srcPlug, dstPlug);\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ inOffset must be initialized or bugs will be had; and the math is\n \/\/ simpler with dimensions all equal to 1.\n MFloatArray offset;\n offset.append(0);\n offset.append(0);\n offset.append(0);\n MFnFloatArrayData offsetCreator;\n MObject data = offsetCreator.create(offset);\n partVolumeFn.findPlug(\"inOffset\").setValue(data);\n partVolumeFn.findPlug(\"dimensionsW\").setValue(1);\n partVolumeFn.findPlug(\"dimensionsH\").setValue(1);\n partVolumeFn.findPlug(\"dimensionsD\").setValue(1);\n }\n\n \/\/ doIt so that we can access the fullPathName\n status = myDagModifier.doIt();\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n \/\/ assign shader\n status = myDagModifier.commandToExecute(\n \"assignSG \" + partVolumeFn.fullPathName() + \" \" + partVolumeFn.fullPathName()\n );\n CHECK_MSTATUS_AND_RETURN_IT(status);\n }\n\n status = myDagModifier.doIt();\n CHECK_MSTATUS_AND_RETURN_IT(status);\n\n return MStatus::kSuccess;\n}\n#endif\n\nMStatus\nSyncOutputObject::undoIt()\n{\n for(AssetSyncs::reverse_iterator iter = myAssetSyncs.rbegin();\n iter != myAssetSyncs.rend();\n iter++)\n {\n (*iter)->undoIt();\n }\n myDagModifier.undoIt();\n\n return MStatus::kSuccess;\n}\n\nMStatus\nSyncOutputObject::redoIt()\n{\n myDagModifier.doIt();\n for(AssetSyncs::iterator iter = myAssetSyncs.begin();\n iter != myAssetSyncs.end();\n iter++)\n {\n (*iter)->redoIt();\n }\n\n return MStatus::kSuccess;\n}\n\nbool\nSyncOutputObject::isUndoable() const\n{\n return true;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Utility Library\n\/\/ Copyright (C) 2012 Chase Warrington (staff@spacechase0.com)\n\/\/\n\/\/ This software is provided 'as-is', without any express or implied warranty.\n\/\/ In no event will the authors be held liable for any damages arising from the use of this software.\n\/\/\n\/\/ Permission is granted to anyone to use this software for any purpose,\n\/\/ including commercial applications, and to alter it and redistribute it freely,\n\/\/ subject to the following restrictions:\n\/\/\n\/\/ 1. The origin of this software must not be misrepresented;\n\/\/ you must not claim that you wrote the original software.\n\/\/ If you use this software in a product, an acknowledgment\n\/\/ in the product documentation would be appreciated but is not required.\n\/\/\n\/\/ 2. Altered source versions must be plainly marked as such,\n\/\/ and must not be misrepresented as being the original software.\n\/\/\n\/\/ 3. This notice may not be removed or altered from any source distribution.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef UTIL_STRING_HPP\n#define UTIL_STRING_HPP\n\n#include <iomanip>\n#include <ios>\n#include <sstream>\n#include <string>\n#include <vector>\n\nnamespace util\n{\n\tnamespace priv\n\t{\n\t\ttemplate< typename... ARGS >\n\t\tvoid applyManips( std::ios& stream, ARGS&&... args );\n\t\t\n\t\ttemplate< typename T, typename... ARGS >\n\t\tvoid applyManips( std::ios& stream, T&& t, ARGS&&... args )\n\t\t{\n\t\t\tstream << std::forward( t );\n\t\t\tapplyManips( stream, std::forward( args )... );\n\t\t}\n\t\t\n\t\tvoid applyManips( std::ios& stream )\n\t\t{\n\t\t}\n\t}\n\t\n\tstd::vector< std::string > tokenize( const std::string& str, const std::string& symbol = \",\" );\n\t\n\ttemplate< typename T, typename... ARGS >\n\tT fromString( const std::string& str, ARGS&&... args )\n\t{\n\t\tT tmp;\n\t\t\n\t\tstd::stringstream ss;\n\t\tpriv::applyManips( ss, std::forward( args )... );\n\t\tss << str;\n\t\tss >> tmp;\n\t\t\n\t\treturn tmp;\n\t}\n\t\n\ttemplate< typename T, typename... ARGS >\n\tstd::string toString( const T& t, ARGS&&... args )\n\t{\n\t\tstd::stringstream ss;\n\t\tpriv::applyManips( ss, std::forward( args )... );\n\t\tss << t;\n\t\treturn ss.str();\n\t}\n\t\n\t\/\/ from\/toStringHex -> from\/toString( ..., std::hex )\n}\n\n#endif \/\/ UTIL_STRING_HPP\n<commit_msg>Oops. Probably should have tested for linking errors before committing. :P<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Utility Library\n\/\/ Copyright (C) 2012 Chase Warrington (staff@spacechase0.com)\n\/\/\n\/\/ This software is provided 'as-is', without any express or implied warranty.\n\/\/ In no event will the authors be held liable for any damages arising from the use of this software.\n\/\/\n\/\/ Permission is granted to anyone to use this software for any purpose,\n\/\/ including commercial applications, and to alter it and redistribute it freely,\n\/\/ subject to the following restrictions:\n\/\/\n\/\/ 1. The origin of this software must not be misrepresented;\n\/\/ you must not claim that you wrote the original software.\n\/\/ If you use this software in a product, an acknowledgment\n\/\/ in the product documentation would be appreciated but is not required.\n\/\/\n\/\/ 2. Altered source versions must be plainly marked as such,\n\/\/ and must not be misrepresented as being the original software.\n\/\/\n\/\/ 3. This notice may not be removed or altered from any source distribution.\n\/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#ifndef UTIL_STRING_HPP\n#define UTIL_STRING_HPP\n\n#include <iomanip>\n#include <ios>\n#include <sstream>\n#include <string>\n#include <vector>\n\nnamespace util\n{\n\tnamespace priv\n\t{\n\t\ttemplate< typename... ARGS >\n\t\tvoid applyManips( std::ios& stream, ARGS&&... args );\n\t\t\n\t\ttemplate< typename T, typename... ARGS >\n\t\tvoid applyManips( std::ios& stream, T&& t, ARGS&&... args )\n\t\t{\n\t\t\tstream << std::forward( t );\n\t\t\tapplyManips( stream, std::forward( args )... );\n\t\t}\n\t\t\n\t\tinline void applyManips( std::ios& stream )\n\t\t{\n\t\t}\n\t}\n\t\n\tstd::vector< std::string > tokenize( const std::string& str, const std::string& symbol = \",\" );\n\t\n\ttemplate< typename T, typename... ARGS >\n\tT fromString( const std::string& str, ARGS&&... args )\n\t{\n\t\tT tmp;\n\t\t\n\t\tstd::stringstream ss;\n\t\tpriv::applyManips( ss, std::forward( args )... );\n\t\tss << str;\n\t\tss >> tmp;\n\t\t\n\t\treturn tmp;\n\t}\n\t\n\ttemplate< typename T, typename... ARGS >\n\tstd::string toString( const T& t, ARGS&&... args )\n\t{\n\t\tstd::stringstream ss;\n\t\tpriv::applyManips( ss, std::forward( args )... );\n\t\tss << t;\n\t\treturn ss.str();\n\t}\n\t\n\t\/\/ from\/toStringHex -> from\/toString( ..., std::hex )\n}\n\n#endif \/\/ UTIL_STRING_HPP\n<|endoftext|>"} {"text":"<commit_before>\/*\n * nextpnr -- Next Generation Place and Route\n *\n * Copyright (C) 2019 gatecat <gatecat@ds0.me>\n * Copyright (C) 2021 Symbiflow Authors\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"xdc.h\"\n\n#include <string>\n\n#include \"context.h\"\n#include \"log.h\"\n\n\/\/ Include tcl.h late because it messed with #define's and lets them leave the\n\/\/ scope of the header.\n#include <tcl.h>\n\nNEXTPNR_NAMESPACE_BEGIN\n\nstatic int obj_set_from_any(Tcl_Interp *interp, Tcl_Obj *objPtr) { return TCL_ERROR; }\n\nstatic void set_tcl_obj_string(Tcl_Obj *objPtr, const std::string &s)\n{\n NPNR_ASSERT(objPtr->bytes == nullptr);\n \/\/ Need to have space for the end null byte.\n objPtr->bytes = Tcl_Alloc(s.size() + 1);\n\n \/\/ Length is length of string, not including the end null byte.\n objPtr->length = s.size();\n\n std::copy(s.begin(), s.end(), objPtr->bytes);\n objPtr->bytes[objPtr->length] = '\\0';\n}\n\nstatic void port_update_string(Tcl_Obj *objPtr)\n{\n const Context *ctx = static_cast<const Context *>(objPtr->internalRep.twoPtrValue.ptr1);\n PortInfo *port_info = static_cast<PortInfo *>(objPtr->internalRep.twoPtrValue.ptr2);\n\n std::string port_name = port_info->name.str(ctx);\n set_tcl_obj_string(objPtr, port_name);\n}\n\nstatic void cell_update_string(Tcl_Obj *objPtr)\n{\n const Context *ctx = static_cast<const Context *>(objPtr->internalRep.twoPtrValue.ptr1);\n CellInfo *cell_info = static_cast<CellInfo *>(objPtr->internalRep.twoPtrValue.ptr2);\n\n std::string cell_name = cell_info->name.str(ctx);\n set_tcl_obj_string(objPtr, cell_name);\n}\n\nstatic void obj_dup(Tcl_Obj *srcPtr, Tcl_Obj *dupPtr)\n{\n dupPtr->internalRep.twoPtrValue = srcPtr->internalRep.twoPtrValue;\n}\n\nstatic void obj_free(Tcl_Obj *objPtr) {}\n\nstatic void Tcl_SetStringResult(Tcl_Interp *interp, const std::string &s)\n{\n char *copy = Tcl_Alloc(s.size() + 1);\n std::copy(s.begin(), s.end(), copy);\n copy[s.size()] = '\\0';\n Tcl_SetResult(interp, copy, TCL_DYNAMIC);\n}\n\nstatic Tcl_ObjType port_object = {\n \"port\", obj_free, obj_dup, port_update_string, obj_set_from_any,\n};\n\nstatic Tcl_ObjType cell_object = {\n \"cell\", obj_free, obj_dup, cell_update_string, obj_set_from_any,\n};\n\nstatic int get_ports(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n const Context *ctx = static_cast<const Context *>(data);\n if (objc == 1) {\n \/\/ Return list of all ports.\n Tcl_SetStringResult(interp, \"Unimplemented\");\n return TCL_ERROR;\n } else if (objc == 2) {\n const char *arg0 = Tcl_GetString(objv[1]);\n IdString port_name = ctx->id(arg0);\n\n auto iter = ctx->ports.find(port_name);\n if (iter == ctx->ports.end()) {\n Tcl_SetStringResult(interp, \"Could not find port \" + port_name.str(ctx));\n return TCL_ERROR;\n }\n\n Tcl_Obj *result = Tcl_NewObj();\n result->typePtr = &port_object;\n result->internalRep.twoPtrValue.ptr1 = (void *)(ctx);\n result->internalRep.twoPtrValue.ptr2 = (void *)(&iter->second);\n\n result->bytes = nullptr;\n port_update_string(result);\n\n Tcl_SetObjResult(interp, result);\n return TCL_OK;\n } else if (objc > 2) {\n log_warning(\"get_ports options not implemented!\\n\");\n return TCL_OK;\n } else {\n return TCL_ERROR;\n }\n}\n\nstatic int get_cells(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n const Context *ctx = static_cast<const Context *>(data);\n if (objc == 1) {\n \/\/ Return list of all ports.\n Tcl_SetStringResult(interp, \"Unimplemented\");\n return TCL_ERROR;\n } else if (objc == 2) {\n const char *arg0 = Tcl_GetString(objv[1]);\n IdString cell_name = ctx->id(arg0);\n\n auto iter = ctx->cells.find(cell_name);\n if (iter == ctx->cells.end()) {\n Tcl_SetStringResult(interp, \"Could not find cell \" + cell_name.str(ctx));\n return TCL_ERROR;\n }\n\n Tcl_Obj *result = Tcl_NewObj();\n result->typePtr = &cell_object;\n result->internalRep.twoPtrValue.ptr1 = (void *)(ctx);\n result->internalRep.twoPtrValue.ptr2 = (void *)(iter->second.get());\n\n result->bytes = nullptr;\n cell_update_string(result);\n\n Tcl_SetObjResult(interp, result);\n return TCL_OK;\n } else if (objc > 2) {\n log_warning(\"get_cells options not implemented!\\n\");\n return TCL_OK;\n } else {\n return TCL_ERROR;\n }\n}\n\nstatic int set_property(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n \/\/ set_property <property> <value> <object>\n if (objc != 4) {\n Tcl_SetStringResult(interp, \"Only simple 'set_property <property> <value> <object>' is supported\");\n return TCL_ERROR;\n }\n\n const char *property = Tcl_GetString(objv[1]);\n const char *value = Tcl_GetString(objv[2]);\n const Tcl_Obj *object = objv[3];\n\n if (object->typePtr == &port_object) {\n const Context *ctx = static_cast<const Context *>(object->internalRep.twoPtrValue.ptr1);\n PortInfo *port_info = static_cast<PortInfo *>(object->internalRep.twoPtrValue.ptr2);\n NPNR_ASSERT(port_info->net != nullptr);\n CellInfo *cell = ctx->port_cells.at(port_info->name);\n\n cell->attrs[ctx->id(property)] = Property(value);\n } else if (object->typePtr == &cell_object) {\n const Context *ctx = static_cast<const Context *>(object->internalRep.twoPtrValue.ptr1);\n CellInfo *cell = static_cast<CellInfo *>(object->internalRep.twoPtrValue.ptr2);\n\n cell->attrs[ctx->id(property)] = Property(value);\n }\n\n return TCL_OK;\n}\n\nstatic int not_implemented(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n \/\/ TCL command that is not yet implemented\n log_warning(\"%s command is not implemented!\\n\", Tcl_GetString(objv[0]));\n return TCL_OK;\n}\n\nTclInterp::TclInterp(Context *ctx)\n{\n interp = Tcl_CreateInterp();\n NPNR_ASSERT(Tcl_Init(interp) == TCL_OK);\n\n Tcl_RegisterObjType(&port_object);\n Tcl_RegisterObjType(&cell_object);\n\n NPNR_ASSERT(Tcl_Eval(interp, \"rename unknown _original_unknown\") == TCL_OK);\n NPNR_ASSERT(Tcl_Eval(interp, \"proc unknown args {\\n\"\n \" set result [scan [lindex $args 0] \\\"%d\\\" value]\\n\"\n \" if { $result == 1 && [llength $args] == 1 } {\\n\"\n \" return \\\\[$value\\\\]\\n\"\n \" } else {\\n\"\n \" uplevel 1 [list _original_unknown {*}$args]\\n\"\n \" }\\n\"\n \"}\") == TCL_OK);\n Tcl_CreateObjCommand(interp, \"get_ports\", get_ports, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_cells\", get_cells, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_property\", set_property, ctx, nullptr);\n\n \/\/ Not implemented TCL commands\n Tcl_CreateObjCommand(interp, \"create_clock\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_iobanks\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_nets\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_pins\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_false_path\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_max_delay\", not_implemented, ctx, nullptr);\n}\n\nTclInterp::~TclInterp() { Tcl_DeleteInterp(interp); }\n\nNEXTPNR_NAMESPACE_END\n<commit_msg>interchange: xdc: add more not_implemented commands<commit_after>\/*\n * nextpnr -- Next Generation Place and Route\n *\n * Copyright (C) 2019 gatecat <gatecat@ds0.me>\n * Copyright (C) 2021 Symbiflow Authors\n *\n * Permission to use, copy, modify, and\/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR\n * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN\n * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF\n * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.\n *\n *\/\n\n#include \"xdc.h\"\n\n#include <string>\n\n#include \"context.h\"\n#include \"log.h\"\n\n\/\/ Include tcl.h late because it messed with #define's and lets them leave the\n\/\/ scope of the header.\n#include <tcl.h>\n\nNEXTPNR_NAMESPACE_BEGIN\n\nstatic int obj_set_from_any(Tcl_Interp *interp, Tcl_Obj *objPtr) { return TCL_ERROR; }\n\nstatic void set_tcl_obj_string(Tcl_Obj *objPtr, const std::string &s)\n{\n NPNR_ASSERT(objPtr->bytes == nullptr);\n \/\/ Need to have space for the end null byte.\n objPtr->bytes = Tcl_Alloc(s.size() + 1);\n\n \/\/ Length is length of string, not including the end null byte.\n objPtr->length = s.size();\n\n std::copy(s.begin(), s.end(), objPtr->bytes);\n objPtr->bytes[objPtr->length] = '\\0';\n}\n\nstatic void port_update_string(Tcl_Obj *objPtr)\n{\n const Context *ctx = static_cast<const Context *>(objPtr->internalRep.twoPtrValue.ptr1);\n PortInfo *port_info = static_cast<PortInfo *>(objPtr->internalRep.twoPtrValue.ptr2);\n\n std::string port_name = port_info->name.str(ctx);\n set_tcl_obj_string(objPtr, port_name);\n}\n\nstatic void cell_update_string(Tcl_Obj *objPtr)\n{\n const Context *ctx = static_cast<const Context *>(objPtr->internalRep.twoPtrValue.ptr1);\n CellInfo *cell_info = static_cast<CellInfo *>(objPtr->internalRep.twoPtrValue.ptr2);\n\n std::string cell_name = cell_info->name.str(ctx);\n set_tcl_obj_string(objPtr, cell_name);\n}\n\nstatic void obj_dup(Tcl_Obj *srcPtr, Tcl_Obj *dupPtr)\n{\n dupPtr->internalRep.twoPtrValue = srcPtr->internalRep.twoPtrValue;\n}\n\nstatic void obj_free(Tcl_Obj *objPtr) {}\n\nstatic void Tcl_SetStringResult(Tcl_Interp *interp, const std::string &s)\n{\n char *copy = Tcl_Alloc(s.size() + 1);\n std::copy(s.begin(), s.end(), copy);\n copy[s.size()] = '\\0';\n Tcl_SetResult(interp, copy, TCL_DYNAMIC);\n}\n\nstatic Tcl_ObjType port_object = {\n \"port\", obj_free, obj_dup, port_update_string, obj_set_from_any,\n};\n\nstatic Tcl_ObjType cell_object = {\n \"cell\", obj_free, obj_dup, cell_update_string, obj_set_from_any,\n};\n\nstatic int get_ports(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n const Context *ctx = static_cast<const Context *>(data);\n if (objc == 1) {\n \/\/ Return list of all ports.\n Tcl_SetStringResult(interp, \"Unimplemented\");\n return TCL_ERROR;\n } else if (objc == 2) {\n const char *arg0 = Tcl_GetString(objv[1]);\n IdString port_name = ctx->id(arg0);\n\n auto iter = ctx->ports.find(port_name);\n if (iter == ctx->ports.end()) {\n Tcl_SetStringResult(interp, \"Could not find port \" + port_name.str(ctx));\n return TCL_ERROR;\n }\n\n Tcl_Obj *result = Tcl_NewObj();\n result->typePtr = &port_object;\n result->internalRep.twoPtrValue.ptr1 = (void *)(ctx);\n result->internalRep.twoPtrValue.ptr2 = (void *)(&iter->second);\n\n result->bytes = nullptr;\n port_update_string(result);\n\n Tcl_SetObjResult(interp, result);\n return TCL_OK;\n } else if (objc > 2) {\n log_warning(\"get_ports options not implemented!\\n\");\n return TCL_OK;\n } else {\n return TCL_ERROR;\n }\n}\n\nstatic int get_cells(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n const Context *ctx = static_cast<const Context *>(data);\n if (objc == 1) {\n \/\/ Return list of all ports.\n Tcl_SetStringResult(interp, \"Unimplemented\");\n return TCL_ERROR;\n } else if (objc == 2) {\n const char *arg0 = Tcl_GetString(objv[1]);\n IdString cell_name = ctx->id(arg0);\n\n auto iter = ctx->cells.find(cell_name);\n if (iter == ctx->cells.end()) {\n Tcl_SetStringResult(interp, \"Could not find cell \" + cell_name.str(ctx));\n return TCL_ERROR;\n }\n\n Tcl_Obj *result = Tcl_NewObj();\n result->typePtr = &cell_object;\n result->internalRep.twoPtrValue.ptr1 = (void *)(ctx);\n result->internalRep.twoPtrValue.ptr2 = (void *)(iter->second.get());\n\n result->bytes = nullptr;\n cell_update_string(result);\n\n Tcl_SetObjResult(interp, result);\n return TCL_OK;\n } else if (objc > 2) {\n log_warning(\"get_cells options not implemented!\\n\");\n return TCL_OK;\n } else {\n return TCL_ERROR;\n }\n}\n\nstatic int set_property(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n \/\/ set_property <property> <value> <object>\n if (objc != 4) {\n Tcl_SetStringResult(interp, \"Only simple 'set_property <property> <value> <object>' is supported\");\n return TCL_ERROR;\n }\n\n const char *property = Tcl_GetString(objv[1]);\n const char *value = Tcl_GetString(objv[2]);\n const Tcl_Obj *object = objv[3];\n\n if (object->typePtr == &port_object) {\n const Context *ctx = static_cast<const Context *>(object->internalRep.twoPtrValue.ptr1);\n PortInfo *port_info = static_cast<PortInfo *>(object->internalRep.twoPtrValue.ptr2);\n NPNR_ASSERT(port_info->net != nullptr);\n CellInfo *cell = ctx->port_cells.at(port_info->name);\n\n cell->attrs[ctx->id(property)] = Property(value);\n } else if (object->typePtr == &cell_object) {\n const Context *ctx = static_cast<const Context *>(object->internalRep.twoPtrValue.ptr1);\n CellInfo *cell = static_cast<CellInfo *>(object->internalRep.twoPtrValue.ptr2);\n\n cell->attrs[ctx->id(property)] = Property(value);\n }\n\n return TCL_OK;\n}\n\nstatic int not_implemented(ClientData data, Tcl_Interp *interp, int objc, Tcl_Obj *CONST objv[])\n{\n \/\/ TCL command that is not yet implemented\n log_warning(\"%s command is not implemented!\\n\", Tcl_GetString(objv[0]));\n return TCL_OK;\n}\n\nTclInterp::TclInterp(Context *ctx)\n{\n interp = Tcl_CreateInterp();\n NPNR_ASSERT(Tcl_Init(interp) == TCL_OK);\n\n Tcl_RegisterObjType(&port_object);\n Tcl_RegisterObjType(&cell_object);\n\n NPNR_ASSERT(Tcl_Eval(interp, \"rename unknown _original_unknown\") == TCL_OK);\n NPNR_ASSERT(Tcl_Eval(interp, \"proc unknown args {\\n\"\n \" set result [scan [lindex $args 0] \\\"%d\\\" value]\\n\"\n \" if { $result == 1 && [llength $args] == 1 } {\\n\"\n \" return \\\\[$value\\\\]\\n\"\n \" } else {\\n\"\n \" uplevel 1 [list _original_unknown {*}$args]\\n\"\n \" }\\n\"\n \"}\") == TCL_OK);\n Tcl_CreateObjCommand(interp, \"get_ports\", get_ports, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_cells\", get_cells, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_property\", set_property, ctx, nullptr);\n\n \/\/ Not implemented TCL commands\n Tcl_CreateObjCommand(interp, \"create_clock\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_clocks\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_iobanks\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_nets\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"get_pins\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_clock_groups\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_false_path\", not_implemented, ctx, nullptr);\n Tcl_CreateObjCommand(interp, \"set_max_delay\", not_implemented, ctx, nullptr);\n}\n\nTclInterp::~TclInterp() { Tcl_DeleteInterp(interp); }\n\nNEXTPNR_NAMESPACE_END\n<|endoftext|>"} {"text":"<commit_before>#include <ctime>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"board.h\"\n#include \"emit.h\"\n#include \"io_functions.h\"\n#include \"load.h\"\n#include \"options.h\"\n\noption::Option *options;\n\nint main(int argc, char *argv[]){\n\t\/\/ process arguments\n\toption::Stats stats(usage, argc - 1, argv + 1);\n\toption::Option _options[stats.options_max], buffer[stats.buffer_max];\n\toption::Parser parse(usage, argc - 1, argv + 1, _options, buffer);\n\n\toptions = _options;\n\n\tif(parse.error())\n\t\treturn -1;\n\t\n\tif(options[OPT_HELP] || argc == 1){\n\t\toption::printUsage(std::cout, usage);\n\t\treturn 0;\n\t}\n\n\tfor(option::Option *opt = options[OPT_UNKNOWN]; opt; opt = opt->next())\n\t\temit_warning(std::string(\"Unknown option: \") + opt->name);\n\n\tif(parse.nonOptionsCount() == 0){\n\t\temit_error(\"No input file\");\n\t\treturn -2;\n\t}\n\n\tstd::string filename = parse.nonOption(0);\n\t\/\/ load\n\tstd::srand(std::time(nullptr));\n\tprepare_io(true);\n\tstd::vector<Board> boards;\n\tstd::map<std::string, unsigned> lookup;\n\tif(!load_mbl_file(filename, boards, lookup)){\n\t\temit_error(\"Could not load file \" + filename);\n\t\treturn -3;\n\t}\n\n\t\/\/ get highest input\n\tint highest_input = 0;\n\tfor(int i = 36; i --> 0;){\n\t\tif(!boards[0].inputs[i].empty()){\n\t\t\thighest_input = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ check arguments\n\tif(parse.nonOptionsCount() != 2 + highest_input){ \/\/ filename + (highest_input + 1)\n\t\temit_error(\"Expected \" + std::to_string(highest_input + 1) + \" inputs, got \" + std::to_string(parse.nonOptionsCount() - 1));\n\t\treturn -4;\t\n\t}\n\tBoardCall bc{&boards[0], 0, 0};\n\tuint8_t inputs[36] = { 0 };\n\tuint16_t outputs[36], output_left, output_right;\n\n\tfor(int i = 0; i <= highest_input; ++i){\n\t\tif(!boards[0].inputs[i].empty()){\n\t\t\tstd::string opt = parse.nonOption(i);\n\t\t\tunsigned value;\n\t\t\tstd::istringstream iss(opt);\n\t\t\tiss >> value;\n\t\t\tif(iss.fail()){\n\t\t\t\temit_error(\"Argument value \" + opt + \" is not an nonnegative integer\");\n\t\t\t\treturn -5;\n\t\t\t}\n\t\t\tif(value > 255){\n\t\t\t\temit_warning(\"Argument value \" + opt + \" is larger than 255; using value mod 256\");\n\t\t\t\tvalue &= 255;\n\t\t\t}\n\t\t\tinputs[i] = value;\n\t\t}\n\t}\n\n\tbc.call(inputs, outputs, output_left, output_right);\n\n\tprepare_io(false);\n\n\treturn (outputs[0] >> 8) ? outputs[0] & 0xFF : 0;\n}\n<commit_msg>Fixed arg number for MB args; number parsing<commit_after>#include <ctime>\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <string>\n#include <sstream>\n#include <vector>\n\n#include \"board.h\"\n#include \"emit.h\"\n#include \"io_functions.h\"\n#include \"load.h\"\n#include \"options.h\"\n\noption::Option *options;\n\nint main(int argc, char *argv[]){\n\t\/\/ process arguments\n\toption::Stats stats(usage, argc - 1, argv + 1);\n\toption::Option _options[stats.options_max], buffer[stats.buffer_max];\n\toption::Parser parse(usage, argc - 1, argv + 1, _options, buffer);\n\n\toptions = _options;\n\n\tif(parse.error())\n\t\treturn -1;\n\t\n\tif(options[OPT_HELP] || argc == 1){\n\t\toption::printUsage(std::cout, usage);\n\t\treturn 0;\n\t}\n\n\tfor(option::Option *opt = options[OPT_UNKNOWN]; opt; opt = opt->next())\n\t\temit_warning(std::string(\"Unknown option: \") + opt->name);\n\n\tif(parse.nonOptionsCount() == 0){\n\t\temit_error(\"No input file\");\n\t\treturn -2;\n\t}\n\n\tstd::string filename = parse.nonOption(0);\n\t\/\/ load\n\tstd::srand(std::time(nullptr));\n\tprepare_io(true);\n\tstd::vector<Board> boards;\n\tstd::map<std::string, unsigned> lookup;\n\tif(!load_mbl_file(filename, boards, lookup)){\n\t\temit_error(\"Could not load file \" + filename);\n\t\treturn -3;\n\t}\n\n\t\/\/ get highest input\n\tint highest_input = 0;\n\tfor(int i = 36; i --> 0;){\n\t\tif(!boards[0].inputs[i].empty()){\n\t\t\thighest_input = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\t\/\/ check arguments\n\tif(parse.nonOptionsCount() != 2 + highest_input){ \/\/ filename + (highest_input + 1)\n\t\temit_error(\"Expected \" + std::to_string(highest_input + 1) + \" inputs, got \" + std::to_string(parse.nonOptionsCount() - 1));\n\t\treturn -4;\t\n\t}\n\tBoardCall bc{&boards[0], 0, 0};\n\tuint8_t inputs[36] = { 0 };\n\tuint16_t outputs[36], output_left, output_right;\n\n\tfor(int i = 0; i <= highest_input; ++i){\n\t\tif(!boards[0].inputs[i].empty()){\n\t\t\tstd::string opt = parse.nonOption(i + 1);\n\t\t\tunsigned value = 0;\n\t\t\tbool too_large = false;\n\t\t\tfor(auto c : opt){\n\t\t\t\tif(std::isdigit(c)){\n\t\t\t\t\tvalue = 10 * value + (c - '0');\n\t\t\t\t\tif(value > 255)\n\t\t\t\t\t\ttoo_large = true;\n\t\t\t\t}else{\n\t\t\t\t\temit_error(\"Argument value \" + opt + \" is not a nonnegative integer\");\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(too_large){\n\t\t\t\temit_warning(\"Argument value \" + opt + \" is larger than 255; using value mod 256\");\n\t\t\t}\n\t\t\tinputs[i] = value & 255;\n\t\t}\n\t}\n\n\tbc.call(inputs, outputs, output_left, output_right);\n\n\tprepare_io(false);\n\n\treturn (outputs[0] >> 8) ? outputs[0] & 0xFF : 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\n\n<commit_msg>Added charge\/discharge\/fire functionality<commit_after>#include <iostream>\n#include <sstream>\n#include <stdexcept>\n#include <string>\n#include <chrono>\n\n#include <unistd.h>\n#include <fcntl.h>\n#include <sys\/types.h>\n#include <sys\/stat.h>\n#include <sys\/ioctl.h>\n#include <linux\/i2c-dev.h>\n\n\nusing namespace ::std;\n\n\nclass I2CBus\n{\n public:\n I2CBus(unsigned _busId)\n :m_busFd(-1),\n m_busPath()\n {\n ostringstream busDevName;\n busDevName << \"\/dev\/i2c-\" << _busId;\n m_busPath = busDevName.str();\n m_busFd = ::open(m_busPath.c_str(), O_RDWR | O_SYNC);\n if (m_busFd == -1)\n {\n ostringstream os;\n os << \"cannot open i2c bus device \" << m_busPath;\n throw runtime_error(os.str());\n }\n }\n\n ~I2CBus()\n {\n if (m_busFd != -1)\n ::close(m_busFd);\n }\n\n int fd() const { return m_busFd; }\n const string& path() const { return m_busPath; }\n\n private:\n int m_busFd;\n string m_busPath;\n};\n\n\nclass I2CDevice\n{\n public:\n I2CDevice(unsigned _busId, unsigned _deviceId)\n :m_i2cBus(_busId)\n {\n if (ioctl(m_i2cBus.fd(), I2C_SLAVE, &_deviceId) != 0)\n {\n ostringstream os;\n os << \"cannot select i2c slave device \" << _deviceId << \", bus \" << m_i2cBus.path();\n throw runtime_error(os.str());\n }\n }\n\n template <typename UInt, size_t _bytes = sizeof(UInt)>\n bool readUInt(UInt& _data)\n {\n uint8_t dataBuf[_bytes];\n if (::read(m_i2cBus.fd(), dataBuf, sizeof(dataBuf)) != sizeof(dataBuf))\n return false;\n\n _data = UInt();\n for (size_t idx = 0; idx < _bytes; ++idx)\n _data |= static_cast<UInt>(dataBuf[idx]) << (idx*8);\n return true;\n }\n\n template <typename UInt, size_t _bytes = sizeof(UInt)>\n bool writeUInt(const UInt& _data)\n {\n uint8_t dataBuf[_bytes];\n for (size_t idx = 0; idx < _bytes; ++idx)\n dataBuf[idx] = static_cast<uint8_t>(_data >> (idx*8));\n\n if (::write(m_i2cBus.fd(), dataBuf, sizeof(dataBuf)) != sizeof(dataBuf))\n return false;\n return true;\n }\n\n private:\n I2CBus m_i2cBus;\n};\n\n\nclass MSPControl\n{\n public:\n MSPControl(unsigned _busId, unsigned _deviceId)\n :m_i2cDevice(_busId, _deviceId)\n {\n }\n\n unsigned readWord(unsigned _addr)\n {\n uint8_t addr = static_cast<uint8_t>(_addr);\n if (!m_i2cDevice.writeUInt(addr))\n {\n ostringstream os;\n os << \"cannot write cmd\";\n throw runtime_error(os.str());\n }\n\n uint16_t result;\n if (!m_i2cDevice.readUInt(result))\n {\n ostringstream os;\n os << \"cannot read result\";\n throw runtime_error(os.str());\n }\n\n return result;\n }\n\n private:\n I2CDevice m_i2cDevice;\n};\n\n\nclass GPIOControl\n{\n public:\n GPIOControl(unsigned _gpio)\n :m_gpioFd(-1),\n m_gpioPath()\n {\n ostringstream gpioCtrlName;\n gpioCtrlName << \"\/sys\/class\/gpio\/gpio\" << _gpio << \"\/value\";\n m_gpioPath = gpioCtrlName.str();\n m_gpioFd = ::open(m_gpioPath.c_str(), O_RDWR | O_SYNC);\n if (m_gpioFd == -1)\n {\n ostringstream os;\n os << \"cannot open gpio control \" << m_gpioPath;\n throw runtime_error(os.str());\n }\n }\n\n ~GPIOControl()\n {\n if (m_gpioFd != -1)\n ::close(m_gpioFd);\n }\n\n void setValue(unsigned _val)\n {\n ostringstream valueStream;\n valueStream << _val << endl;\n const string& value = valueStream.str();\n if (::write(m_gpioFd, value.c_str(), value.length()) != value.length())\n {\n ostringstream os;\n os << \"cannot set gpio value \" << m_gpioPath;\n throw runtime_error(os.str());\n }\n }\n\n const string& path() const { return m_gpioPath; }\n\n private:\n int m_gpioFd;\n string m_gpioPath;\n};\n\n\nclass TrikCoilGun\n{\n public:\n TrikCoilGun(unsigned _mspBusId, unsigned _mspDeviceId,\n unsigned _mspChargeLevelCmd, unsigned _mspDischargeCurrentCmd,\n unsigned _gpioChargeControl, unsigned _gpioDischargeControl)\n :m_mspControl(_mspBusId, _mspDeviceId),\n m_mspCmdChargeLevel(_mspChargeLevelCmd),\n m_mspCmdDischargeCurrent(_mspDischargeCurrentCmd),\n m_gpioChargeControl(_gpioChargeControl),\n m_gpioDischargeControl(_gpioDischargeControl)\n {\n m_gpioChargeControl.setValue(0);\n m_gpioDischargeControl.setValue(0);\n }\n\n ~TrikCoilGun()\n {\n m_gpioChargeControl.setValue(0);\n m_gpioDischargeControl.setValue(0);\n }\n\n void charge(unsigned _durationMs, unsigned _chargeLevel)\n {\n const chrono::steady_clock::time_point& startAt = chrono::steady_clock::now();\n const bool waitCharge = _durationMs == 0;\n const chrono::steady_clock::time_point& elapseAt = startAt + chrono::duration<chrono::steady_clock::rep, chrono::milliseconds::period>(_durationMs);\n\n#if 1\n cerr << \"Preparing for charge\" << endl;\n bool charging = false;\n#endif\n while (true)\n {\n if (!waitCharge && chrono::steady_clock::now() >= elapseAt)\n break;\n\n if (m_mspControl.readWord(m_mspCmdChargeLevel) >= _chargeLevel)\n {\n#if 1\n if (charging)\n cerr << \"Stop charging\" << endl;\n charging = false;\n#endif\n if (waitCharge)\n break;\n m_gpioChargeControl.setValue(0);\n }\n else\n {\n#if 1\n if (!charging)\n cerr << \"Charging\" << endl;\n charging = true;\n#endif\n m_gpioChargeControl.setValue(1);\n }\n usleep(1000);\n }\n#if 1\n cerr << \"Charge done\" << endl;\n#endif\n m_gpioChargeControl.setValue(0);\n }\n\n\n void discharge(unsigned _durationMs, unsigned _zeroChargeLevel)\n {\n const chrono::steady_clock::time_point& startAt = chrono::steady_clock::now();\n const bool waitDischarge = _durationMs == 0;\n const chrono::steady_clock::time_point& elapseAt = startAt + chrono::duration<chrono::steady_clock::rep, chrono::milliseconds::period>(_durationMs);\n\n#if 1\n cerr << \"Preparing for discharge\" << endl;\n#endif\n while (true)\n {\n if (!waitDischarge && chrono::steady_clock::now() >= elapseAt)\n break;\n\n if (m_mspControl.readWord(m_mspCmdChargeLevel) <= _zeroChargeLevel)\n {\n#if 1\n cerr << \"Discharged\" << endl;\n#endif\n break;\n }\n\n m_gpioDischargeControl.setValue(1);\n usleep(1000);\n }\n#if 1\n cerr << \"Discharge done\" << endl;\n#endif\n m_gpioDischargeControl.setValue(0);\n }\n\n\n void fire(unsigned _preDelayMs, unsigned _durationMs, unsigned _postDelayMs)\n {\n m_gpioChargeControl.setValue(0);\n usleep(_preDelayMs * 1000);\n m_gpioDischargeControl.setValue(1);\n usleep(_durationMs * 1000);\n m_gpioChargeControl.setValue(0);\n usleep(_postDelayMs * 1000);\n }\n\n\n private:\n MSPControl m_mspControl;\n unsigned m_mspCmdChargeLevel;\n unsigned m_mspCmdDischargeCurrent;\n GPIOControl m_gpioChargeControl;\n GPIOControl m_gpioDischargeControl;\n};\n\n\n\n\n\n#if 0\n\n\nstatic int s_chargeLevel = 0;\nstatic int s_chargeDurationMs = 0;\nstatic int s_fireDurationMs = 10;\nstatic int s_dischargeDelayMs = 100;\nstatic int s_dischargeDurationMs = 0;\nstatic int s_dischargeLevel = 0;\n\n\n#endif\n\n\nint main()\n{\n TrikCoilGun coilGun(0,0,0,0,0,0);\n\n coilGun.charge(1000, 0);\n coilGun.fire(10, 10, 100);\n coilGun.discharge(1000, 0);\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/************************************************************************\/\n\/* *\/\n\/* Copyright 1998-2002 by Ullrich Koethe *\/\n\/* Cognitive Systems Group, University of Hamburg, Germany *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* You may use, modify, and distribute this software according *\/\n\/* to the terms stated in the LICENSE file included in *\/\n\/* the VIGRA distribution. *\/\n\/* *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/kogs-www.informatik.uni-hamburg.de\/~koethe\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* koethe@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* THIS SOFTWARE IS PROVIDED AS IS AND WITHOUT ANY EXPRESS OR *\/\n\/* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED *\/\n\/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. *\/\n\/* *\/\n\/************************************************************************\/\n \n \n#ifndef VIGRA_ERROR_HXX\n#define VIGRA_ERROR_HXX\n\n#include <stdexcept>\n#include <stdio.h>\n#include <string>\n#include \"vigra\/config.hxx\"\n \n\/*! \\page ErrorReporting Error Reporting\n Exceptions and assertions provided by VIGRA\n\n <b>\\#include<\/b> \"<a href=\"error_8hxx-source.html\">vigra\/error.hxx<\/a>\"\n \n VIGRA defines the following exception classes:\n \n \\code\n namespace vigra {\n class ContractViolation : public std::exception;\n class PreconditionViolation : public ContractViolation;\n class PostconditionViolation : public ContractViolation;\n class InvariantViolation : public ContractViolation;\n }\n \\endcode\n \n The following associated macros throw the corresponding exception if \n their PREDICATE evaluates to '<TT>false<\/TT>':\n \n \\code\n vigra_precondition(PREDICATE, MESSAGE);\n vigra_postcondition(PREDICATE, MESSAGE);\n vigra_invariant(PREDICATE, MESSAGE);\n \\endcode\n \n The MESSAGE is passed to the exception and can be retrieved via\n the overloaded member function '<TT>exception.what()<\/TT>'. If the compiler\n flag '<TT>NDEBUG<\/TT>' is <em>not<\/em> defined, the file name and line number of \n the error are automatically included in the message.\n \n The following macro\n \n \\code\n vigra_fail(MESSAGE);\n \\endcode\n \n unconditionally throws a '<TT>std::runtime_error<\/TT>' constructed from the message \n (along with file name and line number, if NDEBUG is not set).\n \n <b> Usage:<\/b>\n \n Include-File:\n \"<a href=\"error_8hxx-source.html\">vigra\/error.hxx<\/a>\"\n <p>\n Namespace: vigra (except for the macros, of course)\n \n \\code\n int main(int argc, char ** argv)\n {\n try\n {\n const char* input_file_name = argv[1];\n\n \/\/ read input image\n vigra::ImageImportInfo info(input_file_name);\n\n \/\/ fail if input image is not grayscale\n vigra_precondition(info.isGrayscale(), \"Input image must be grayscale\");\n\n ...\/\/ process image\n }\n catch (std::exception & e)\n {\n std::cerr << e.what() << std::endl; \/\/ print message\n return 1;\n }\n\n return 0;\n }\n \\endcode\n**\/\n\nnamespace vigra {\n\nclass ContractViolation : public StdException\n{\n public:\n ContractViolation(char const * prefix, char const * message, \n char const * file, int line)\n {\n sprintf(what_, \"\\n%.30s\\n%.900s\\n(%.100s:%d)\\n\", prefix, message, file, line);\n }\n \n ContractViolation(char const * prefix, char const * message)\n {\n sprintf(what_, \"\\n%.30s\\n%.900s\\n\", prefix, message);\n }\n \n virtual const char * what() const throw()\n {\n return what_;\n }\n \n private:\n enum { bufsize_ = 1100 };\n char what_[bufsize_];\n};\n\nclass PreconditionViolation : public ContractViolation\n{\n public:\n PreconditionViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Precondition violation!\", message, file, line)\n {}\n \n PreconditionViolation(char const * message)\n : ContractViolation(\"Precondition violation!\", message)\n {}\n};\n\nclass PostconditionViolation : public ContractViolation\n{\n public:\n PostconditionViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Postcondition violation!\", message, file, line)\n {}\n \n PostconditionViolation(char const * message)\n : ContractViolation(\"Postcondition violation!\", message)\n {}\n};\n\nclass InvariantViolation : public ContractViolation\n{\n public:\n InvariantViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Invariant violation!\", message, file, line)\n {}\n \n InvariantViolation(char const * message)\n : ContractViolation(\"Invariant violation!\", message)\n {}\n};\n\n#ifndef NDEBUG\n\ninline\nvoid throw_invariant_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message, file, line); \n}\n\ninline\nvoid throw_invariant_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message, file, line); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message, file, line); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_runtime_error(char const * message, char const * file, int line)\n{\n char what_[1100];\n sprintf(what_, \"\\n%.900s\\n(%.100s:%d)\\n\", message, file, line);\n throw std::runtime_error(what_); \n}\n\ninline\nvoid throw_runtime_error(std::string message, char const * file, int line)\n{\n char what_[1100];\n sprintf(what_, \"\\n%.900s\\n(%.100s:%d)\\n\", message.c_str(), file, line);\n throw std::runtime_error(what_); \n}\n\n#define vigra_precondition(PREDICATE, MESSAGE) vigra::throw_precondition_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n\n#define vigra_postcondition(PREDICATE, MESSAGE) vigra::throw_postcondition_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n\n#define vigra_invariant(PREDICATE, MESSAGE) vigra::throw_invariant_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n \n#define vigra_fail(MESSAGE) vigra::throw_runtime_error(MESSAGE, __FILE__, __LINE__)\n\n#else \/\/ NDEBUG\n\ninline\nvoid throw_invariant_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message); \n}\n\ninline\nvoid throw_invariant_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message.c_str()); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message.c_str()); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message.c_str()); \n}\n\n#define vigra_precondition(PREDICATE, MESSAGE) vigra::throw_precondition_error((PREDICATE), MESSAGE)\n\n#define vigra_postcondition(PREDICATE, MESSAGE) vigra::throw_postcondition_error((PREDICATE), MESSAGE)\n\n#define vigra_invariant(PREDICATE, MESSAGE) vigra::throw_invariant_error((PREDICATE), MESSAGE)\n \n#define vigra_fail(MESSAGE) throw std::runtime_error(MESSAGE)\n\n#endif \/\/ NDEBUG\n\n} \/\/ namespace vigra\n\n#endif \/\/ VIGRA_ERROR_HXX\n<commit_msg>added vigra_assert()<commit_after>\/************************************************************************\/\n\/* *\/\n\/* Copyright 1998-2002 by Ullrich Koethe *\/\n\/* Cognitive Systems Group, University of Hamburg, Germany *\/\n\/* *\/\n\/* This file is part of the VIGRA computer vision library. *\/\n\/* You may use, modify, and distribute this software according *\/\n\/* to the terms stated in the LICENSE file included in *\/\n\/* the VIGRA distribution. *\/\n\/* *\/\n\/* The VIGRA Website is *\/\n\/* http:\/\/kogs-www.informatik.uni-hamburg.de\/~koethe\/vigra\/ *\/\n\/* Please direct questions, bug reports, and contributions to *\/\n\/* koethe@informatik.uni-hamburg.de *\/\n\/* *\/\n\/* THIS SOFTWARE IS PROVIDED AS IS AND WITHOUT ANY EXPRESS OR *\/\n\/* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED *\/\n\/* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. *\/\n\/* *\/\n\/************************************************************************\/\n \n \n#ifndef VIGRA_ERROR_HXX\n#define VIGRA_ERROR_HXX\n\n#include <stdexcept>\n#include <stdio.h>\n#include <string>\n#include \"vigra\/config.hxx\"\n \n\/*! \\page ErrorReporting Error Reporting\n Exceptions and assertions provided by VIGRA\n\n <b>\\#include<\/b> \"<a href=\"error_8hxx-source.html\">vigra\/error.hxx<\/a>\"\n \n VIGRA defines the following exception classes:\n \n \\code\n namespace vigra {\n class ContractViolation : public std::exception;\n class PreconditionViolation : public ContractViolation;\n class PostconditionViolation : public ContractViolation;\n class InvariantViolation : public ContractViolation;\n }\n \\endcode\n \n The following associated macros throw the corresponding exception if \n their PREDICATE evaluates to '<TT>false<\/TT>':\n \n \\code\n vigra_precondition(PREDICATE, MESSAGE);\n vigra_postcondition(PREDICATE, MESSAGE);\n vigra_invariant(PREDICATE, MESSAGE);\n \\endcode\n \n The MESSAGE is passed to the exception and can be retrieved via\n the overloaded member function '<TT>exception.what()<\/TT>'. If the compiler\n flag '<TT>NDEBUG<\/TT>' is <em>not<\/em> defined, the file name and line number of \n the error are automatically included in the message. The macro\n \n \\code\n vigra_assert(PREDICATE, MESSAGE);\n \\endcode\n \n is identical to <tt>vigra_precondition()<\/tt> except that it is completely removed\n when '<TT>NDEBUG<\/TT>' is defined. This is useful for test that are only needed during \n debugging, such as array index bound checking. The following macro\n \n \\code\n vigra_fail(MESSAGE);\n \\endcode\n \n unconditionally throws a '<TT>std::runtime_error<\/TT>' constructed from the message \n (along with file name and line number, if NDEBUG is not set).\n \n <b> Usage:<\/b>\n \n Include-File:\n \"<a href=\"error_8hxx-source.html\">vigra\/error.hxx<\/a>\"\n <p>\n Namespace: vigra (except for the macros, of course)\n \n \\code\n int main(int argc, char ** argv)\n {\n try\n {\n const char* input_file_name = argv[1];\n\n \/\/ read input image\n vigra::ImageImportInfo info(input_file_name);\n\n \/\/ fail if input image is not grayscale\n vigra_precondition(info.isGrayscale(), \"Input image must be grayscale\");\n\n ...\/\/ process image\n }\n catch (std::exception & e)\n {\n std::cerr << e.what() << std::endl; \/\/ print message\n return 1;\n }\n\n return 0;\n }\n \\endcode\n**\/\n\nnamespace vigra {\n\nclass ContractViolation : public StdException\n{\n public:\n ContractViolation(char const * prefix, char const * message, \n char const * file, int line)\n {\n sprintf(what_, \"\\n%.30s\\n%.900s\\n(%.100s:%d)\\n\", prefix, message, file, line);\n }\n \n ContractViolation(char const * prefix, char const * message)\n {\n sprintf(what_, \"\\n%.30s\\n%.900s\\n\", prefix, message);\n }\n \n virtual const char * what() const throw()\n {\n return what_;\n }\n \n private:\n enum { bufsize_ = 1100 };\n char what_[bufsize_];\n};\n\nclass PreconditionViolation : public ContractViolation\n{\n public:\n PreconditionViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Precondition violation!\", message, file, line)\n {}\n \n PreconditionViolation(char const * message)\n : ContractViolation(\"Precondition violation!\", message)\n {}\n};\n\nclass PostconditionViolation : public ContractViolation\n{\n public:\n PostconditionViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Postcondition violation!\", message, file, line)\n {}\n \n PostconditionViolation(char const * message)\n : ContractViolation(\"Postcondition violation!\", message)\n {}\n};\n\nclass InvariantViolation : public ContractViolation\n{\n public:\n InvariantViolation(char const * message, const char * file, int line)\n : ContractViolation(\"Invariant violation!\", message, file, line)\n {}\n \n InvariantViolation(char const * message)\n : ContractViolation(\"Invariant violation!\", message)\n {}\n};\n\n#ifndef NDEBUG\n\ninline\nvoid throw_invariant_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message, file, line); \n}\n\ninline\nvoid throw_invariant_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message, file, line); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, char const * message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message, file, line); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, std::string message, char const * file, int line)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message.c_str(), file, line); \n}\n\ninline\nvoid throw_runtime_error(char const * message, char const * file, int line)\n{\n char what_[1100];\n sprintf(what_, \"\\n%.900s\\n(%.100s:%d)\\n\", message, file, line);\n throw std::runtime_error(what_); \n}\n\ninline\nvoid throw_runtime_error(std::string message, char const * file, int line)\n{\n char what_[1100];\n sprintf(what_, \"\\n%.900s\\n(%.100s:%d)\\n\", message.c_str(), file, line);\n throw std::runtime_error(what_); \n}\n\n#define vigra_precondition(PREDICATE, MESSAGE) vigra::throw_precondition_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n\n#define vigra_assert(PREDICATE, MESSAGE) vigra_precondition(PREDICATE, MESSAGE)\n\n#define vigra_postcondition(PREDICATE, MESSAGE) vigra::throw_postcondition_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n\n#define vigra_invariant(PREDICATE, MESSAGE) vigra::throw_invariant_error((PREDICATE), MESSAGE, __FILE__, __LINE__)\n \n#define vigra_fail(MESSAGE) vigra::throw_runtime_error(MESSAGE, __FILE__, __LINE__)\n\n#else \/\/ NDEBUG\n\ninline\nvoid throw_invariant_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, char const * message)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message); \n}\n\ninline\nvoid throw_invariant_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::InvariantViolation(message.c_str()); \n}\n\ninline\nvoid throw_precondition_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::PreconditionViolation(message.c_str()); \n}\n\ninline\nvoid throw_postcondition_error(bool predicate, std::string message)\n{\n if(!predicate)\n\t throw vigra::PostconditionViolation(message.c_str()); \n}\n\n#define vigra_precondition(PREDICATE, MESSAGE) vigra::throw_precondition_error((PREDICATE), MESSAGE)\n\n#define vigra_assert(PREDICATE, MESSAGE)\n\n#define vigra_postcondition(PREDICATE, MESSAGE) vigra::throw_postcondition_error((PREDICATE), MESSAGE)\n\n#define vigra_invariant(PREDICATE, MESSAGE) vigra::throw_invariant_error((PREDICATE), MESSAGE)\n \n#define vigra_fail(MESSAGE) throw std::runtime_error(MESSAGE)\n\n#endif \/\/ NDEBUG\n\n} \/\/ namespace vigra\n\n#endif \/\/ VIGRA_ERROR_HXX\n<|endoftext|>"} {"text":"<commit_before>#include \"Command.h\"\n#include \"Test.h\"\n#include \"Or.h\"\n#include \"And.h\"\n#include \"Semicolon.h\"\n\n\n#include <sys\/stat.h>\n#include <stack>\n#include <queue>\n\n\/\/ split word into tokens and put them in a vector of char*\nvoid parse(string keyword, vector<char*> &wordList)\n{\n char *cs = new char[keyword.length()];\n for (unsigned i = 0; i < keyword.length(); i++)\n {\n cs[i] = keyword[i];\n }\n cs[keyword.length()] = '\\0'; \/\/add the null terminator at the end of\n\n char *tokens = strtok(cs, \" \");\n while (tokens) \n {\n wordList.push_back(tokens);\n tokens = strtok(NULL, \" \");\n }\n}\n\nvoid copy(char** &arr, vector<char*>& v)\n{\n v.push_back(NULL);\n arr = new char*[v.size()];\n for (unsigned i = 0; i < v.size(); i++)\n {\n arr[i] = v.at(i);\n }\n}\n\nint main() \n{\n string input;\n \n while (1) \/\/ shell should run indefinitely unless exited \n { \n \n cout << \"$ \";\n getline(cin, input); \/\/ get whole command line\n \n if(input == \"exit\") \n {\n exit(0);\n break;\n }\n \n \n vector<char*> words;\n parse(input, words);\n \n queue<string> connectors;\n stack<cmdComponent*> commands;\n \n \/\/ for (unsigned a = 0; a < words.size(); a++)\n \/\/ {\n \/\/ cout << words.at(a) << endl; \n \/\/ }\n \n \/\/break up the vector of words into commands\n vector<char*> argv;\n for (unsigned i = 0; i < words.size(); i++)\n {\n char *sc = (char*) memchr (words.at(i), ';', strlen(words.at(i)));\n char *And = (char*) memchr (words.at(i), '&', strlen(words.at(i)));\n char *Or = (char*) memchr (words.at(i), '|', strlen(words.at(i)));\n char *com = (char*) memchr (words.at(i), '#', strlen(words.at(i)));\n \n \n if ( (sc == NULL && Or == NULL && And == NULL) ) \n {\n if ( (com == NULL) && (i == (words.size() - 1)) )\n {\n argv.push_back(words.at(i));\n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n }\n else if (com == NULL)\n {\n argv.push_back(words.at(i));\n }\n else\n {\n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n break;\n } \n }\n else\n {\n string type = \"\";\n if (sc)\n {\n type = \";\";\n connectors.push(type);\n }\n else if (And)\n {\n type = \"&&\";\n connectors.push(type);\n }\n else \n {\n type = \"||\";\n connectors.push(type);\n }\n \n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n }\n }\n \n \/\/cout << \"commands size:\" << commands.size() << endl;\n \/\/set up the command tree\n if (commands.size() > connectors.size())\n {\n \/\/cout << \"command queue size: \" << commands.size() << endl;\n stack<cmdComponent*> stack;\n \n while (!commands.empty())\n {\n stack.push(commands.top());\n commands.pop();\n }\n \n \/\/cout <<\"stack size before tree:\" << stack.size() << endl;\n while ((!connectors.empty()) && !stack.empty())\n {\n cmdComponent* tleft = stack.top();\n stack.pop();\n cmdComponent* tright = stack.top();\n stack.pop();\n \n cmdComponent* tmp;\n \n if (connectors.front() == \";\")\n {\n tmp = new Semicolon(tleft, tright);\n }\n else if (connectors.front() == \"&&\")\n {\n tmp = new And(tleft, tright);\n }\n else\n {\n tmp = new Or(tleft, tright);\n }\n stack.push(tmp);\n connectors.pop();\n }\n \n \/\/ finally execute tree of commands\n if (!stack.empty())\n {\n stack.top()->execute();\n }\n \n }\n else\n {\n if (commands.size() == 0)\n {\n \n }\n else\n {\n cout << \"Error: Invalid input\" << endl;\n }\n }\n \n }\n \n return 0;\n}\n\n<commit_msg>various clarity changes<commit_after>#include \"Command.h\"\n#include \"Test.h\"\n#include \"Or.h\"\n#include \"And.h\"\n#include \"Semicolon.h\"\n\n\n#include <sys\/stat.h>\n#include <stack>\n#include <queue>\n\n\/\/ split word into tokens and put them in a vector of char*\nvoid parse(string keyword, vector<char*> &wordList)\n{\n char *cs = new char[keyword.length()];\n for (unsigned i = 0; i < keyword.length(); i++)\n {\n cs[i] = keyword[i];\n }\n cs[keyword.length()] = '\\0'; \/\/add the null terminator at the end of\n\n char *tokens = strtok(cs, \" \");\n while (tokens) \n {\n wordList.push_back(tokens);\n tokens = strtok(NULL, \" \");\n }\n}\n\n\/\/ copies a vector<char*> to a char* array\nvoid copy(char** &arr, vector<char*>& v)\n{\n v.push_back(NULL);\n arr = new char*[v.size()];\n for (unsigned i = 0; i < v.size(); i++)\n {\n arr[i] = v.at(i);\n }\n}\n\n\nint main() \n{\n string input;\n \n while (1) \/\/ shell should run indefinitely unless exited \n { \n \n cout << \"$ \";\n getline(cin, input); \/\/ get whole command line\n \n if(input == \"exit\")\n {\n exit(0);\n break;\n }\n \n \n queue<string> connectors;\n stack<cmdComponent*> commands;\n vector<char*> words;\n parse(input, words);\n \n \n \/\/break up the vector of words into commands\n vector<char*> argv;\n for (unsigned i = 0; i < words.size(); i++)\n {\n char *sc = (char*) memchr (words.at(i), ';', strlen(words.at(i)));\n char *And = (char*) memchr (words.at(i), '&', strlen(words.at(i)));\n char *Or = (char*) memchr (words.at(i), '|', strlen(words.at(i)));\n char *com = (char*) memchr (words.at(i), '#', strlen(words.at(i)));\n \n if ( (sc == NULL && Or == NULL && And == NULL) ) \n {\n if ( (com == NULL) && (i == (words.size() - 1)) )\n {\n argv.push_back(words.at(i));\n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n }\n else if (com == NULL)\n {\n argv.push_back(words.at(i));\n }\n else\n {\n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n break;\n } \n }\n else\n {\n string type = \"\";\n if (sc)\n {\n type = \";\";\n connectors.push(type);\n }\n else if (And)\n {\n type = \"&&\";\n connectors.push(type);\n }\n else \n {\n type = \"||\";\n connectors.push(type);\n }\n \n char** args;\n copy(args, argv);\n if((string(argv.at(0)) == \"test\") || (string(argv.at(0)) == \"[\"))\n {\n Test* tst = new Test();\n tst->setTest(args);\n commands.push(tst);\n }\n else\n {\n Command* com = new Command();\n com->setCommand(args);\n commands.push(com);\n }\n argv.clear();\n }\n } \/\/done breaking up words into commands\n \n \n \n \/\/set up the command tree\n if (commands.size() > connectors.size())\n {\n \/\/cout << \"command queue size: \" << commands.size() << endl;\n stack<cmdComponent*> stack;\n \n while (!commands.empty())\n {\n stack.push(commands.top());\n commands.pop();\n }\n \n while ((!connectors.empty()) && !stack.empty())\n {\n cmdComponent* tleft = stack.top();\n stack.pop();\n cmdComponent* tright = stack.top();\n stack.pop();\n \n cmdComponent* tmp;\n \n if (connectors.front() == \";\")\n {\n tmp = new Semicolon(tleft, tright);\n }\n else if (connectors.front() == \"&&\")\n {\n tmp = new And(tleft, tright);\n }\n else\n {\n tmp = new Or(tleft, tright);\n }\n stack.push(tmp);\n connectors.pop();\n }\n \n \/\/ finally execute tree of commands\n if (!stack.empty())\n {\n stack.top()->execute();\n }\n \n }\n else\n {\n if (commands.size() == 0)\n {\n \/\/ do nothing\n }\n else\n {\n cout << \"Error: Invalid input\" << endl;\n }\n }\n \n \n } \/\/ end of infinite while loop\n \n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#define SDL_MAIN_HANDLED\n#include <SDL.h>\n#include <ospray.h>\n#include <ospcommon\/vec.h>\n#include \"gl_core_3_3.h\"\n#define TINYOBJLOADER_IMPLEMENTATION\n#include \"tiny_obj_loader.h\"\n\nstatic int WIN_WIDTH = 1280;\nstatic int WIN_HEIGHT = 720;\n\nint main(int argc, const char **argv) {\n\tif (argc < 2) {\n\t\tstd::cerr << \"You must specify a model to render\\n\";\n\t\treturn 1;\n\t}\n\tconst std::string model_file = argv[1];\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tstd::cerr << \"Failed to initialize SDL\\n\";\n\t\treturn 1;\n\t}\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE);\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 0);\n\tSDL_GL_SetAttribute(SDL_GL_RED_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_GREEN_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_BLUE_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 24);\n\tSDL_GL_SetAttribute(SDL_GL_STENCIL_SIZE, 8);\n#ifndef NDEBUG\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_FLAGS, SDL_GL_CONTEXT_DEBUG_FLAG);\n#endif\n\n\tSDL_Window *win = SDL_CreateWindow(\"OSPRay-vive\", SDL_WINDOWPOS_CENTERED,\n\t\t\tSDL_WINDOWPOS_CENTERED, WIN_WIDTH, WIN_HEIGHT, SDL_WINDOW_OPENGL);\n\tif (!win){\n\t\tstd::cout << \"Failed to open SDL window: \" << SDL_GetError() << \"\\n\";\n\t\treturn 1;\n\t}\n\tSDL_GLContext ctx = SDL_GL_CreateContext(win);\n\tif (!ctx){\n\t\tstd::cout << \"Failed to get OpenGL context: \" << SDL_GetError() << \"\\n\";\n\t\treturn 1;\n\t}\n\tif (ogl_LoadFunctions() == ogl_LOAD_FAILED){\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Failed to Load OpenGL Functions\",\n\t\t\t\t\"Could not load OpenGL functions for 3.3, OpenGL 3.3 or higher is required\",\n\t\t\t\tNULL);\n\t\tSDL_GL_DeleteContext(ctx);\n\t\tSDL_DestroyWindow(win);\n\t\tSDL_Quit();\n\t\treturn 1;\n\t}\n\tSDL_GL_SetSwapInterval(1);\n\n\tGLuint fbo, texture;\n\tglGenFramebuffers(1, &fbo);\n\tglGenTextures(1, &texture);\n\tglBindTexture(GL_TEXTURE_2D, texture);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_BORDER);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA8, WIN_WIDTH, WIN_HEIGHT, 0, GL_RGBA,\n\t\t\tGL_UNSIGNED_BYTE, nullptr);\n\n\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, texture, 0);\n\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\n\tospInit(&argc, argv);\n\n\tusing namespace ospcommon;\n\tconst vec2i imageSize(WIN_WIDTH, WIN_HEIGHT);\n\tconst vec3f camPos(0, 2.5, 5);\n\tconst vec3f camDir = -camPos;\n\tconst vec3f camUp(0, 1, 0);\n\n\tOSPCamera camera = ospNewCamera(\"perspective\");\n\tospSetf(camera, \"aspect\", imageSize.x \/ static_cast<float>(imageSize.y));\n\tospSetVec3f(camera, \"pos\", (osp::vec3f&)camPos);\n\tospSetVec3f(camera, \"dir\", (osp::vec3f&)camDir);\n\tospSetVec3f(camera, \"up\", (osp::vec3f&)camUp);\n\tospCommit(camera);\n\n\t\/\/ Load the model w\/ tinyobjloader\n\ttinyobj::attrib_t attrib;\n\tstd::vector<tinyobj::shape_t> shapes;\n\tstd::vector<tinyobj::material_t> materials;\n\tstd::string err;\n\tbool ret = tinyobj::LoadObj(&attrib, &shapes, &materials, &err, model_file.c_str(),\n\t\t\tnullptr, true);\n\tif (!err.empty()) {\n\t\tstd::cerr << \"Error loading model: \" << err << \"\\n\";\n\t}\n\tif (!ret) {\n\t\treturn 1;\n\t}\n\n\tOSPModel world = ospNewModel();\n\n\t\/\/ Load all the objects into ospray\n\tOSPData pos_data = ospNewData(attrib.vertices.size() \/ 3, OSP_FLOAT3,\n\t\t\tattrib.vertices.data(), OSP_DATA_SHARED_BUFFER);\n\tospCommit(pos_data);\n\n\tfor (size_t s = 0; s < shapes.size(); ++s) {\n\t\tstd::cout << \"Loading mesh \" << shapes[s].name\n\t\t\t<< \", has \" << shapes[s].mesh.indices.size() << \" vertices\\n\";\n\t\tconst tinyobj::mesh_t &mesh = shapes[s].mesh;\n\t\tstd::vector<int32_t> indices;\n\t\tindices.reserve(mesh.indices.size());\n\t\tfor (const auto &idx : mesh.indices) {\n\t\t\tindices.push_back(idx.vertex_index);\n\t\t}\n\t\tOSPData idx_data = ospNewData(indices.size() \/ 3, OSP_INT3, indices.data());\n\t\tospCommit(idx_data);\n\t\tOSPGeometry geom = ospNewGeometry(\"triangles\");\n\t\tospSetObject(geom, \"vertex\", pos_data);\n\t\tospSetObject(geom, \"index\", idx_data);\n\t\tospCommit(geom);\n\t\tospAddGeometry(world, geom);\n\t}\n\tospCommit(world);\n\n\tOSPRenderer renderer = ospNewRenderer(\"ao\");\n\tospSetObject(renderer, \"model\", world);\n\tospSetObject(renderer, \"camera\", camera);\n\tospSetVec3f(renderer, \"bgColor\", (osp::vec3f&)vec3f(0.05, 0.05, 0.05));\n\tospCommit(renderer);\n\n\tOSPFrameBuffer framebuffer = ospNewFrameBuffer((osp::vec2i&)imageSize, OSP_FB_SRGBA,\n\t\t\tOSP_FB_COLOR | OSP_FB_ACCUM);\n\tospFrameBufferClear(framebuffer, OSP_FB_COLOR | OSP_FB_ACCUM);\n\n\tbool quit = false;\n\twhile (!quit){\n\t\tSDL_Event e;\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT || (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)){\n\t\t\t\tquit = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tospFrameBufferClear(framebuffer, OSP_FB_COLOR);\n\t\tospRenderFrame(framebuffer, renderer, OSP_FB_COLOR | OSP_FB_ACCUM);\n\t\tconst uint32_t *fb = static_cast<const uint32_t*>(ospMapFrameBuffer(framebuffer, OSP_FB_COLOR));\n\t\tglTexSubImage2D(GL_TEXTURE_2D, 0, 0, 0, WIN_WIDTH, WIN_HEIGHT, GL_RGBA, GL_UNSIGNED_BYTE, fb);\n\t\tospUnmapFrameBuffer(fb, framebuffer);\n\n\t\tglBindFramebuffer(GL_READ_FRAMEBUFFER, fbo);\n\t\tglBindFramebuffer(GL_DRAW_FRAMEBUFFER, 0);\n\t\tglBlitFramebuffer(0, 0, WIN_WIDTH, WIN_HEIGHT, 0, 0, WIN_WIDTH, WIN_HEIGHT,\n\t\t\t\tGL_COLOR_BUFFER_BIT, GL_NEAREST);\n\n\t\tSDL_GL_SwapWindow(win);\n\t}\n\n\tSDL_GL_DeleteContext(ctx);\n\tSDL_DestroyWindow(win);\n\tSDL_Quit();\n\treturn 0;\n}\n\n<commit_msg>now in stereo<commit_after>#include <iostream>\n#include <vector>\n#define SDL_MAIN_HANDLED\n#include <SDL.h>\n#include <ospray.h>\n#include <ospcommon\/vec.h>\n#include \"gl_core_3_3.h\"\n#define TINYOBJLOADER_IMPLEMENTATION\n#include \"tiny_obj_loader.h\"\n\nstatic int WIN_WIDTH = 1280;\nstatic int WIN_HEIGHT = 720;\n\nint main(int argc, const char **argv) {\n\tif (argc < 2) {\n\t\tstd::cerr << \"You must specify a model to render\\n\";\n\t\treturn 1;\n\t}\n\tconst std::string model_file = argv[1];\n\tif (SDL_Init(SDL_INIT_EVERYTHING) != 0){\n\t\tstd::cerr << \"Failed to initialize SDL\\n\";\n\t\treturn 1;\n\t}\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, 3);\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_PROFILE_MASK, SDL_GL_CONTEXT_PROFILE_CORE);\n\tSDL_GL_SetAttribute(SDL_GL_MULTISAMPLESAMPLES, 0);\n\tSDL_GL_SetAttribute(SDL_GL_RED_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_GREEN_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_BLUE_SIZE, 8);\n\tSDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 24);\n\tSDL_GL_SetAttribute(SDL_GL_STENCIL_SIZE, 8);\n#ifndef NDEBUG\n\tSDL_GL_SetAttribute(SDL_GL_CONTEXT_FLAGS, SDL_GL_CONTEXT_DEBUG_FLAG);\n#endif\n\n\tSDL_Window *win = SDL_CreateWindow(\"OSPRay-vive\", SDL_WINDOWPOS_CENTERED,\n\t\t\tSDL_WINDOWPOS_CENTERED, WIN_WIDTH, WIN_HEIGHT, SDL_WINDOW_OPENGL);\n\tif (!win){\n\t\tstd::cout << \"Failed to open SDL window: \" << SDL_GetError() << \"\\n\";\n\t\treturn 1;\n\t}\n\tSDL_GLContext ctx = SDL_GL_CreateContext(win);\n\tif (!ctx){\n\t\tstd::cout << \"Failed to get OpenGL context: \" << SDL_GetError() << \"\\n\";\n\t\treturn 1;\n\t}\n\tif (ogl_LoadFunctions() == ogl_LOAD_FAILED){\n\t\tSDL_ShowSimpleMessageBox(SDL_MESSAGEBOX_ERROR, \"Failed to Load OpenGL Functions\",\n\t\t\t\t\"Could not load OpenGL functions for 3.3, OpenGL 3.3 or higher is required\",\n\t\t\t\tNULL);\n\t\tSDL_GL_DeleteContext(ctx);\n\t\tSDL_DestroyWindow(win);\n\t\tSDL_Quit();\n\t\treturn 1;\n\t}\n\tSDL_GL_SetSwapInterval(1);\n\n\tGLuint fbo, texture;\n\tglGenFramebuffers(1, &fbo);\n\tglGenTextures(1, &texture);\n\tglBindTexture(GL_TEXTURE_2D, texture);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_CLAMP_TO_BORDER);\n\tglTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_CLAMP_TO_BORDER);\n\tglTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA8, WIN_WIDTH, WIN_HEIGHT, 0, GL_RGBA,\n\t\t\tGL_UNSIGNED_BYTE, nullptr);\n\n\tglBindFramebuffer(GL_FRAMEBUFFER, fbo);\n\tglFramebufferTexture2D(GL_FRAMEBUFFER, GL_COLOR_ATTACHMENT0, GL_TEXTURE_2D, texture, 0);\n\tglBindFramebuffer(GL_FRAMEBUFFER, 0);\n\n\tospInit(&argc, argv);\n\n\tusing namespace ospcommon;\n\tconst vec2i imageSize(WIN_WIDTH, WIN_HEIGHT);\n\tconst vec3f camPos(0, 2.5, 5);\n\tconst vec3f camDir = vec3f(0, 1, 0) - camPos;\n\tconst vec3f camUp(0, 1, 0);\n\n\tOSPCamera camera = ospNewCamera(\"perspective\");\n\tospSetf(camera, \"aspect\", imageSize.x \/ static_cast<float>(imageSize.y));\n\tospSet1i(camera, \"stereoMode\", 3);\n\t\/\/ TODO: Get this from OpenVR note that ospray's units are in meters\n\tospSet1f(camera, \"interpupillaryDistance\", 0.0635);\n\tospSetVec3f(camera, \"pos\", (osp::vec3f&)camPos);\n\tospSetVec3f(camera, \"dir\", (osp::vec3f&)camDir);\n\tospSetVec3f(camera, \"up\", (osp::vec3f&)camUp);\n\tospCommit(camera);\n\n\t\/\/ Load the model w\/ tinyobjloader\n\ttinyobj::attrib_t attrib;\n\tstd::vector<tinyobj::shape_t> shapes;\n\tstd::vector<tinyobj::material_t> materials;\n\tstd::string err;\n\tbool ret = tinyobj::LoadObj(&attrib, &shapes, &materials, &err, model_file.c_str(),\n\t\t\tnullptr, true);\n\tif (!err.empty()) {\n\t\tstd::cerr << \"Error loading model: \" << err << \"\\n\";\n\t}\n\tif (!ret) {\n\t\treturn 1;\n\t}\n\n\tOSPModel world = ospNewModel();\n\n\t\/\/ Load all the objects into ospray\n\tOSPData pos_data = ospNewData(attrib.vertices.size() \/ 3, OSP_FLOAT3,\n\t\t\tattrib.vertices.data(), OSP_DATA_SHARED_BUFFER);\n\tospCommit(pos_data);\n\n\tfor (size_t s = 0; s < shapes.size(); ++s) {\n\t\tstd::cout << \"Loading mesh \" << shapes[s].name\n\t\t\t<< \", has \" << shapes[s].mesh.indices.size() << \" vertices\\n\";\n\t\tconst tinyobj::mesh_t &mesh = shapes[s].mesh;\n\t\tstd::vector<int32_t> indices;\n\t\tindices.reserve(mesh.indices.size());\n\t\tfor (const auto &idx : mesh.indices) {\n\t\t\tindices.push_back(idx.vertex_index);\n\t\t}\n\t\tOSPData idx_data = ospNewData(indices.size() \/ 3, OSP_INT3, indices.data());\n\t\tospCommit(idx_data);\n\t\tOSPGeometry geom = ospNewGeometry(\"triangles\");\n\t\tospSetObject(geom, \"vertex\", pos_data);\n\t\tospSetObject(geom, \"index\", idx_data);\n\t\tospCommit(geom);\n\t\tospAddGeometry(world, geom);\n\t}\n\tospCommit(world);\n\n\tOSPRenderer renderer = ospNewRenderer(\"ao\");\n\tospSetObject(renderer, \"model\", world);\n\tospSetObject(renderer, \"camera\", camera);\n\tospSetVec3f(renderer, \"bgColor\", (osp::vec3f&)vec3f(0.05, 0.05, 0.05));\n\tospCommit(renderer);\n\n\tOSPFrameBuffer framebuffer = ospNewFrameBuffer((osp::vec2i&)imageSize, OSP_FB_SRGBA,\n\t\t\tOSP_FB_COLOR | OSP_FB_ACCUM);\n\tospFrameBufferClear(framebuffer, OSP_FB_COLOR | OSP_FB_ACCUM);\n\n\tbool quit = false;\n\twhile (!quit){\n\t\tSDL_Event e;\n\t\twhile (SDL_PollEvent(&e)){\n\t\t\tif (e.type == SDL_QUIT || (e.type == SDL_KEYDOWN && e.key.keysym.sym == SDLK_ESCAPE)){\n\t\t\t\tquit = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tospFrameBufferClear(framebuffer, OSP_FB_COLOR);\n\t\tospRenderFrame(framebuffer, renderer, OSP_FB_COLOR | OSP_FB_ACCUM);\n\t\tconst uint32_t *fb = static_cast<const uint32_t*>(ospMapFrameBuffer(framebuffer, OSP_FB_COLOR));\n\t\tglTexSubImage2D(GL_TEXTURE_2D, 0, 0, 0, WIN_WIDTH, WIN_HEIGHT, GL_RGBA, GL_UNSIGNED_BYTE, fb);\n\t\tospUnmapFrameBuffer(fb, framebuffer);\n\n\t\tglBindFramebuffer(GL_READ_FRAMEBUFFER, fbo);\n\t\tglBindFramebuffer(GL_DRAW_FRAMEBUFFER, 0);\n\t\tglBlitFramebuffer(0, 0, WIN_WIDTH, WIN_HEIGHT, 0, 0, WIN_WIDTH, WIN_HEIGHT,\n\t\t\t\tGL_COLOR_BUFFER_BIT, GL_NEAREST);\n\n\t\tSDL_GL_SwapWindow(win);\n\t}\n\n\tSDL_GL_DeleteContext(ctx);\n\tSDL_DestroyWindow(win);\n\tSDL_Quit();\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.cactus\n *\/\n\n#include \"snpbridge.h\"\n\n#include \"vg\/vg.hpp\"\n#include \"Variant.h\"\n\nusing namespace vcflib;\nusing namespace vg;\nusing namespace std;\n\nSNPBridge::SNPBridge() : _vg(NULL)\n{\n}\n\nSNPBridge::~SNPBridge()\n{\n}\n\nvoid SNPBridge::processGraph(VG* vg, VariantCallFile* vcf, int offset,\n int windowSize)\n{\n _vg = vg;\n _gv1.init(offset);\n _gv2.init(offset);\n \n Variant var1(*vcf);\n Variant var2(*vcf);\n \/\/ skip to first variant after offset\n for (int vcfPos = -1; vcfPos < offset; vcfPos = var1.position)\n {\n if (!vcf->getNextVariant(var1))\n {\n \/\/ empty file\n cerr << \"No variants found in VCF\" << endl;\n return;\n }\n }\n _gv1.loadVariant(vg, var1);\n\n int graphLen = vgRefLength(var1);\n \/\/ used for detecting overlaps (a long deletion for example can\n \/\/ overlap many subsequent variants..)\n int lastRefPos = -1;\n\n for (; vcf->getNextVariant(var2); swap(var1, var2), swap(_gv1, _gv2))\n {\n if (var2.position >= offset + graphLen)\n {\n \/\/ stop after end of vg\n break;\n }\n \n _gv2.loadVariant(vg, var2);\n \n if (var2.position - (var1.position + var1.alleles[0].length() - 1) >\n windowSize)\n {\n \/\/ skip because further than window size\n continue;\n }\n\n#ifdef DEBUG\n cerr << \"\\nv1 \" << _gv1 << endl << \"v2 \" << _gv2 << endl;\n#endif\n\n lastRefPos = max(lastRefPos, (int)(var1.position + var1.alleles[0].size()));\n if (var2.position < lastRefPos)\n {\n cerr << \"Skipping adjacent variants at \" << var1.position << \" and \"\n << var2.position\n << \" because they overlap (each other or previous variant)\" << endl;\n continue;\n }\n\n computeLinkCounts(var1, var2);\n\n for (int a1 = 1; a1 < var1.alleles.size(); ++a1)\n {\n for (int a2 = 1; a2 < var2.alleles.size(); ++a2)\n {\n \/\/ note can probably get what we need by calling once instead\n \/\/ of in loop....\n Phase phase = phaseRelation(var1, a1, var2, a2);\n\n if (phase == GT_AND)\n {\n makeBridge(a1, a2);\n \/\/ we can get away with breaking here (and below) because results\n \/\/ mutually exclusive (see simplifying assumption in\n \/\/ phaseRelation()). So as soon as we see a GT_AND or\n \/\/ GT_XOR, then everything else must be GT_OTHER\n break;\n }\n else if (phase == GT_XOR)\n {\n makeBridge(a1, 0);\n break;\n }\n else\n {\n#ifdef DEBUG\n cerr << a1 << \" OTHER \" << a2 << \" detected at \"\n << _gv1.getVariant().position << \" \";\n for (int i = 0; i < _linkCounts.size(); ++i)\n {\n cerr << \"(\";\n for (int j = 0; j < _linkCounts[i].size(); ++j)\n {\n cerr << _linkCounts[i][j] << \",\";\n }\n cerr << \") \";\n }\n cerr << endl;\n#endif\n }\n }\n }\n }\n}\n\nvoid SNPBridge::makeBridge(int allele1, int allele2)\n{\n#ifdef DEBUG\n cerr << allele1 << \" UNC \" << allele2 << \" detected at \"\n << _gv1.getVariant().position << \" \";\n for (int i = 0; i < _linkCounts.size(); ++i)\n {\n cerr << \"(\";\n for (int j = 0; j < _linkCounts[i].size(); ++j)\n {\n cerr << _linkCounts[i][j] << \",\";\n }\n cerr << \") \";\n }\n cerr << endl;\n#endif\n\n Node* node1 = _gv1.getGraphAllele(allele1).back();\n Node* node2 = _gv2.getGraphAllele(allele2).front();\n\n \/\/ note we don't use references here because they get altered by\n \/\/ calls to create and destroy.\n vector<pair<int64_t, bool> > outEdges1 = _vg->edges_on_end[node1->id()];\n vector<pair<int64_t, bool> > inEdges2 = _vg->edges_on_start[node2->id()];\n\n \/\/ make sure there's no other way out of node1 but the\n \/\/ new bridge that we'll add\n for (auto p : outEdges1)\n {\n#ifdef DEBUG\n cerr << \"destroy1 \" << node1->id() << \" \" << true << \", \" << p.first << \" \" << p.second << endl;\n#endif\n Edge* edge = _vg->get_edge(NodeSide(node1->id(), true),\n NodeSide(p.first, p.second));\n assert(edge != NULL);\n _vg->destroy_edge(edge);\n }\n \n \/\/ if dealting with an alt-alt case, make sure no other\n \/\/ way into second alt than the new bridge we'll add\n \/\/ (for alt-ref case, just delete any edge from prev alt)\n if (allele2 != 0)\n {\n for (auto p : inEdges2)\n {\n#ifdef DEBUG\n cerr << \"destroy2 \" << p.first << \" \" << !p.second << \", \" << node2->id() << \" \" << false << endl;\n#endif\n Edge* edge = _vg->get_edge(NodeSide(p.first, !p.second),\n NodeSide(node2->id(), false));\n if (p.first == node1->id())\n {\n \/\/ should have been deleted above\n assert(edge == NULL);\n }\n else\n {\n assert(edge != NULL);\n _vg->destroy_edge(edge);\n }\n }\n }\n\n \/\/ find the path between the two variant alleles along the\n \/\/ reference. since we only deal with consecutive variants,\n \/\/ it's sufficient to stick this path between\n list<Node*> refPath;\n _gv1.getReferencePathTo(_gv2, refPath);\n\n \/\/ if there's no path, we assume the variants are directly adjacent\n \/\/ and just stick and edge between them\n if (refPath.empty())\n {\n _vg->create_edge(node1, node2, false, false);\n#ifdef DEBUG\n cerr << \"create \" << node1->id() << \", \" << node2->id() << endl;\n#endif\n }\n \/\/ otherwise, make a copy of ref path and stick that in between\n else\n {\n Node* prev = node1;\n for (auto refNode : refPath)\n {\n Node* cpyNode = _vg->create_node(refNode->sequence());\n _vg->create_edge(prev, cpyNode, false, false);\n#ifdef DEBUG\n cerr << \"create \" << cpyNode->id() << endl;\n cerr << \"create \" << prev->id() << \" -> \" << cpyNode->id() << endl;\n#endif\n prev = cpyNode;\n }\n _vg->create_edge(prev, node2, false, false);\n#ifdef DEBUG\n cerr << \"create \" << prev->id() << \", \" << node2->id() << endl;\n#endif\n }\n}\n\nSNPBridge::Phase SNPBridge::phaseRelation(Variant& v1, int allele1,\n Variant& v2, int allele2) const\n{\n \/\/ this is where we could take into account allele\n \/\/ frequencies to, for example, ignore really rare alleles.\n \/\/ But for now, we only do an all or nothing -- ie\n \/\/ the variants are alt-alt only if there isn't a single sample\n \/\/ saying otherwise.\n\n \/\/ total number of haplos with a1 that also have a2\n int toAllele2 = _linkCounts[allele1][allele2];;\n \/\/ total number of haplos with a1 that go to ref\n int toRef = _linkCounts[allele1][0];\n \/\/ total number of implied haplotypes that contain allele1\n int total = 0;\n for (int i = 0; i < v2.alleles.size(); ++i)\n {\n total += _linkCounts[allele1][i];\n }\n\n if (total < 1)\n {\n cerr << \"Alternate allele \" << allele1 << \" never seen in GT for \"\n << \"variant \" << v1 << endl;\n \/\/ the best we can do is cut path to next alternate.\n \/\/ though really we want to remove such variants\n \/\/ entirely\n return GT_XOR;\n }\n \n \/\/ so exclusively to allele 2 will be a GT_AND\n else if (toAllele2 == total)\n {\n return GT_AND;\n }\n \/\/ and exclusive to ref with be a GT_XOR\n \/\/ (Note a simplifiying assumption here in the\n \/\/ presence of multiple alts. Don't consider\n \/\/ cases like never goes to alt2 but can go\n \/\/ to alt1 or reference)\n else if (toRef == total)\n {\n return GT_XOR;\n }\n \n return GT_OTHER;\n}\n\nvoid SNPBridge::computeLinkCounts(Variant& v1, Variant& v2)\n{\n \/\/ make our matrix and set to 0\n initLinkCounts(v1, v2);\n \n assert(!v1.alleles.empty() && !v2.alleles.empty());\n\n for (auto& sample : v1.sampleNames)\n {\n \/\/ treat missing GT information in one variant with respect\n \/\/ to the other as a warning. But count all possible links\n \/\/ once so it will never get phased. \n if (v2.samples.find(sample) == v2.samples.end())\n {\n cerr << \"Warning: Sample \" << sample << \" not found in variant \" << v2\n << \". Assuming unphased\" << endl;\n for (auto& i : _linkCounts)\n {\n for (auto& j : i)\n {\n ++j;\n }\n }\n \n continue;\n } \n\n \/\/ parse out GT info for sample (it'll look like 0|1 etc.)\n string& gt1 = v1.samples[sample][\"GT\"].front();\n string& gt2 = v2.samples[sample][\"GT\"].front();\n vector<string> gtspec1 = split(gt1, \"|\");\n vector<string> gtspec2 = split(gt2, \"|\");\n\n \/\/ don't expect this but check in case\n if (gtspec1.size() != gtspec2.size())\n {\n stringstream ss;\n ss << \"Sample \" << sample << \"has different ploidy in \"\n << v1 << \" and \" << v2 << \". This is not supported\";\n throw runtime_error(ss.str());\n }\n\n \/\/ so if the GT info looks like 0|1 1|0 2|1 etc. we have\n \/\/ two \"chromosomes\", and iterate each. we count a link\n \/\/ looking at the two variants, and recording what we see\n \/\/ at the same chromosome at the same sample. \n for (int chrom = 0; chrom < gtspec1.size(); ++chrom)\n {\n \/\/ treat . as wildcard\n if (gtspec1[chrom] == \".\" && gtspec2[chrom] == \".\")\n {\n \/\/ two .'s mean we see everything\n for (int g1 = 0; g1 < v1.alleles.size(); ++g1)\n {\n for (int g2 = 0; g2 < v2.alleles.size(); ++g2)\n {\n ++_linkCounts[g1][g2];\n }\n }\n }\n else if (gtspec1[chrom] == \".\")\n {\n \/\/ g1 == . means we see all combindations of g1 with\n \/\/ given value of g2\n int g2;\n convert(gtspec2[chrom], g2);\n for (int g1 = 0; g1 < v1.alleles.size(); ++g1)\n {\n ++_linkCounts[g1][g2];\n }\n }\n else if (gtspec2[chrom] == \".\")\n {\n \/\/ g2 == . means we see all combinations of g2 with\n \/\/ given value of g1\n int g1;\n convert(gtspec1[chrom], g1);\n for (int g2 = 0; g2 < v2.alleles.size(); ++g2)\n {\n ++_linkCounts[g1][g2];\n }\n }\n else\n {\n \/\/ normal case. update the link count for the indexes\n \/\/ found on the give allele. Example\n \/\/ Sample NA12878 has GT 0|1 for var1 and 0|0 for var2\n \/\/ then we update _linkCounts[0][1] + 1 (when chrom = 0)\n \/\/ and _linkCounots[0][0] + 1 (when chrom = 1)\n int g1, g2;\n convert(gtspec1[chrom], g1);\n convert(gtspec2[chrom], g2);\n ++_linkCounts[g1][g2];\n }\n }\n }\n}\n\nvoid SNPBridge::initLinkCounts(Variant& v1,\n Variant& v2)\n{\n \/\/ set _linkCounts to 0 and make sure it's at least\n \/\/ big enough to hold our alleles\n for (int i = 0; i < v1.alleles.size(); ++i)\n {\n if (_linkCounts.size() < v1.alleles.size())\n {\n _linkCounts.push_back(vector<int>(v2.alleles.size(), 0));\n }\n else\n {\n if (_linkCounts[i].size() < v2.alleles.size())\n {\n _linkCounts[i].resize(v2.alleles.size());\n }\n _linkCounts[i].assign(v2.alleles.size(), 0);\n }\n } \n}\n\nint SNPBridge::vgRefLength(Variant& var) const\n{\n \/\/ duplicating some code from the built in traversal of graphvariant,\n \/\/ but it's nice to have path length at outset to make scope checking\n \/\/ simpler (to relax assumption that vg contains whole vcf). \n if (_vg->paths.has_path(var.sequenceName) == false)\n {\n stringstream ss;\n ss << \"Unable to find path for \" << var.sequenceName << \" in vg file\";\n throw runtime_error(ss.str());\n }\n int len = 0;\n list<Mapping>& path = _vg->paths.get_path(var.sequenceName);\n for (auto& mapping : path)\n {\n if (mapping.is_reverse() == true)\n {\n throw(runtime_error(\"Reverse Mapping not supported\"));\n }\n if (mapping.edit_size() > 1 || (\n mapping.edit_size() == 1 && mapping.edit(0).from_length() !=\n mapping.edit(0).to_length()))\n {\n stringstream ss;\n ss << pb2json(mapping) << \": Only mappings with a single trvial edit\"\n << \" supported in ref path\";\n throw runtime_error(ss.str());\n }\n len += _vg->get_node(mapping.position().node_id())->sequence().length();\n }\n return len;\n}\n<commit_msg>change overlap logic yet again. need to skip overlaps before loading as they can fail a sanity check<commit_after>\/*\n * Copyright (C) 2015 by Glenn Hickey (hickey@soe.ucsc.edu)\n *\n * Released under the MIT license, see LICENSE.cactus\n *\/\n\n#include \"snpbridge.h\"\n\n#include \"vg\/vg.hpp\"\n#include \"Variant.h\"\n\nusing namespace vcflib;\nusing namespace vg;\nusing namespace std;\n\nSNPBridge::SNPBridge() : _vg(NULL)\n{\n}\n\nSNPBridge::~SNPBridge()\n{\n}\n\nvoid SNPBridge::processGraph(VG* vg, VariantCallFile* vcf, int offset,\n int windowSize)\n{\n _vg = vg;\n _gv1.init(offset);\n _gv2.init(offset);\n \n Variant var1(*vcf);\n Variant var2(*vcf);\n \/\/ skip to first variant after offset\n for (int vcfPos = -1; vcfPos < offset; vcfPos = var1.position)\n {\n if (!vcf->getNextVariant(var1))\n {\n \/\/ empty file\n cerr << \"No variants found in VCF\" << endl;\n return;\n }\n }\n _gv1.loadVariant(vg, var1);\n\n int graphLen = vgRefLength(var1);\n\n\n for (; vcf->getNextVariant(var2); swap(var1, var2), swap(_gv1, _gv2))\n {\n \/\/ skip ahead until we're not overlapping\n bool breakOut = false;\n while (!breakOut && var2.position < var1.position + var1.alleles[0].size())\n {\n cerr << \"Skipping variant at \" << var2.position << \" because it \"\n << \"overlaps previous variant at position \" << var1.position << endl;\n breakOut = !vcf->getNextVariant(var2);\n }\n if (breakOut)\n {\n break;\n }\n\n if (var2.position >= offset + graphLen)\n {\n \/\/ stop after end of vg\n break;\n }\n \n _gv2.loadVariant(vg, var2);\n \n if (var2.position - (var1.position + var1.alleles[0].length() - 1) >\n windowSize)\n {\n \/\/ skip because further than window size\n continue;\n }\n\n#ifdef DEBUG\n cerr << \"\\nv1 \" << _gv1 << endl << \"v2 \" << _gv2 << endl;\n#endif\n\n computeLinkCounts(var1, var2);\n\n for (int a1 = 1; a1 < var1.alleles.size(); ++a1)\n {\n for (int a2 = 1; a2 < var2.alleles.size(); ++a2)\n {\n \/\/ note can probably get what we need by calling once instead\n \/\/ of in loop....\n Phase phase = phaseRelation(var1, a1, var2, a2);\n\n if (phase == GT_AND)\n {\n makeBridge(a1, a2);\n \/\/ we can get away with breaking here (and below) because results\n \/\/ mutually exclusive (see simplifying assumption in\n \/\/ phaseRelation()). So as soon as we see a GT_AND or\n \/\/ GT_XOR, then everything else must be GT_OTHER\n break;\n }\n else if (phase == GT_XOR)\n {\n makeBridge(a1, 0);\n break;\n }\n else\n {\n#ifdef DEBUG\n cerr << a1 << \" OTHER \" << a2 << \" detected at \"\n << _gv1.getVariant().position << \" \";\n for (int i = 0; i < _linkCounts.size(); ++i)\n {\n cerr << \"(\";\n for (int j = 0; j < _linkCounts[i].size(); ++j)\n {\n cerr << _linkCounts[i][j] << \",\";\n }\n cerr << \") \";\n }\n cerr << endl;\n#endif\n }\n }\n }\n }\n}\n\nvoid SNPBridge::makeBridge(int allele1, int allele2)\n{\n#ifdef DEBUG\n cerr << allele1 << \" UNC \" << allele2 << \" detected at \"\n << _gv1.getVariant().position << \" \";\n for (int i = 0; i < _linkCounts.size(); ++i)\n {\n cerr << \"(\";\n for (int j = 0; j < _linkCounts[i].size(); ++j)\n {\n cerr << _linkCounts[i][j] << \",\";\n }\n cerr << \") \";\n }\n cerr << endl;\n#endif\n\n Node* node1 = _gv1.getGraphAllele(allele1).back();\n Node* node2 = _gv2.getGraphAllele(allele2).front();\n\n \/\/ note we don't use references here because they get altered by\n \/\/ calls to create and destroy.\n vector<pair<int64_t, bool> > outEdges1 = _vg->edges_on_end[node1->id()];\n vector<pair<int64_t, bool> > inEdges2 = _vg->edges_on_start[node2->id()];\n\n \/\/ make sure there's no other way out of node1 but the\n \/\/ new bridge that we'll add\n for (auto p : outEdges1)\n {\n#ifdef DEBUG\n cerr << \"destroy1 \" << node1->id() << \" \" << true << \", \" << p.first << \" \" << p.second << endl;\n#endif\n Edge* edge = _vg->get_edge(NodeSide(node1->id(), true),\n NodeSide(p.first, p.second));\n assert(edge != NULL);\n _vg->destroy_edge(edge);\n }\n \n \/\/ if dealting with an alt-alt case, make sure no other\n \/\/ way into second alt than the new bridge we'll add\n \/\/ (for alt-ref case, just delete any edge from prev alt)\n if (allele2 != 0)\n {\n for (auto p : inEdges2)\n {\n#ifdef DEBUG\n cerr << \"destroy2 \" << p.first << \" \" << !p.second << \", \" << node2->id() << \" \" << false << endl;\n#endif\n Edge* edge = _vg->get_edge(NodeSide(p.first, !p.second),\n NodeSide(node2->id(), false));\n if (p.first == node1->id())\n {\n \/\/ should have been deleted above\n assert(edge == NULL);\n }\n else\n {\n assert(edge != NULL);\n _vg->destroy_edge(edge);\n }\n }\n }\n\n \/\/ find the path between the two variant alleles along the\n \/\/ reference. since we only deal with consecutive variants,\n \/\/ it's sufficient to stick this path between\n list<Node*> refPath;\n _gv1.getReferencePathTo(_gv2, refPath);\n\n \/\/ if there's no path, we assume the variants are directly adjacent\n \/\/ and just stick and edge between them\n if (refPath.empty())\n {\n _vg->create_edge(node1, node2, false, false);\n#ifdef DEBUG\n cerr << \"create \" << node1->id() << \", \" << node2->id() << endl;\n#endif\n }\n \/\/ otherwise, make a copy of ref path and stick that in between\n else\n {\n Node* prev = node1;\n for (auto refNode : refPath)\n {\n Node* cpyNode = _vg->create_node(refNode->sequence());\n _vg->create_edge(prev, cpyNode, false, false);\n#ifdef DEBUG\n cerr << \"create \" << cpyNode->id() << endl;\n cerr << \"create \" << prev->id() << \" -> \" << cpyNode->id() << endl;\n#endif\n prev = cpyNode;\n }\n _vg->create_edge(prev, node2, false, false);\n#ifdef DEBUG\n cerr << \"create \" << prev->id() << \", \" << node2->id() << endl;\n#endif\n }\n}\n\nSNPBridge::Phase SNPBridge::phaseRelation(Variant& v1, int allele1,\n Variant& v2, int allele2) const\n{\n \/\/ this is where we could take into account allele\n \/\/ frequencies to, for example, ignore really rare alleles.\n \/\/ But for now, we only do an all or nothing -- ie\n \/\/ the variants are alt-alt only if there isn't a single sample\n \/\/ saying otherwise.\n\n \/\/ total number of haplos with a1 that also have a2\n int toAllele2 = _linkCounts[allele1][allele2];;\n \/\/ total number of haplos with a1 that go to ref\n int toRef = _linkCounts[allele1][0];\n \/\/ total number of implied haplotypes that contain allele1\n int total = 0;\n for (int i = 0; i < v2.alleles.size(); ++i)\n {\n total += _linkCounts[allele1][i];\n }\n\n if (total < 1)\n {\n cerr << \"Alternate allele \" << allele1 << \" never seen in GT for \"\n << \"variant \" << v1 << endl;\n \/\/ the best we can do is cut path to next alternate.\n \/\/ though really we want to remove such variants\n \/\/ entirely\n return GT_XOR;\n }\n \n \/\/ so exclusively to allele 2 will be a GT_AND\n else if (toAllele2 == total)\n {\n return GT_AND;\n }\n \/\/ and exclusive to ref with be a GT_XOR\n \/\/ (Note a simplifiying assumption here in the\n \/\/ presence of multiple alts. Don't consider\n \/\/ cases like never goes to alt2 but can go\n \/\/ to alt1 or reference)\n else if (toRef == total)\n {\n return GT_XOR;\n }\n \n return GT_OTHER;\n}\n\nvoid SNPBridge::computeLinkCounts(Variant& v1, Variant& v2)\n{\n \/\/ make our matrix and set to 0\n initLinkCounts(v1, v2);\n \n assert(!v1.alleles.empty() && !v2.alleles.empty());\n\n for (auto& sample : v1.sampleNames)\n {\n \/\/ treat missing GT information in one variant with respect\n \/\/ to the other as a warning. But count all possible links\n \/\/ once so it will never get phased. \n if (v2.samples.find(sample) == v2.samples.end())\n {\n cerr << \"Warning: Sample \" << sample << \" not found in variant \" << v2\n << \". Assuming unphased\" << endl;\n for (auto& i : _linkCounts)\n {\n for (auto& j : i)\n {\n ++j;\n }\n }\n \n continue;\n } \n\n \/\/ parse out GT info for sample (it'll look like 0|1 etc.)\n string& gt1 = v1.samples[sample][\"GT\"].front();\n string& gt2 = v2.samples[sample][\"GT\"].front();\n vector<string> gtspec1 = split(gt1, \"|\");\n vector<string> gtspec2 = split(gt2, \"|\");\n\n \/\/ don't expect this but check in case\n if (gtspec1.size() != gtspec2.size())\n {\n stringstream ss;\n ss << \"Sample \" << sample << \"has different ploidy in \"\n << v1 << \" and \" << v2 << \". This is not supported\";\n throw runtime_error(ss.str());\n }\n\n \/\/ so if the GT info looks like 0|1 1|0 2|1 etc. we have\n \/\/ two \"chromosomes\", and iterate each. we count a link\n \/\/ looking at the two variants, and recording what we see\n \/\/ at the same chromosome at the same sample. \n for (int chrom = 0; chrom < gtspec1.size(); ++chrom)\n {\n \/\/ treat . as wildcard\n if (gtspec1[chrom] == \".\" && gtspec2[chrom] == \".\")\n {\n \/\/ two .'s mean we see everything\n for (int g1 = 0; g1 < v1.alleles.size(); ++g1)\n {\n for (int g2 = 0; g2 < v2.alleles.size(); ++g2)\n {\n ++_linkCounts[g1][g2];\n }\n }\n }\n else if (gtspec1[chrom] == \".\")\n {\n \/\/ g1 == . means we see all combindations of g1 with\n \/\/ given value of g2\n int g2;\n convert(gtspec2[chrom], g2);\n for (int g1 = 0; g1 < v1.alleles.size(); ++g1)\n {\n ++_linkCounts[g1][g2];\n }\n }\n else if (gtspec2[chrom] == \".\")\n {\n \/\/ g2 == . means we see all combinations of g2 with\n \/\/ given value of g1\n int g1;\n convert(gtspec1[chrom], g1);\n for (int g2 = 0; g2 < v2.alleles.size(); ++g2)\n {\n ++_linkCounts[g1][g2];\n }\n }\n else\n {\n \/\/ normal case. update the link count for the indexes\n \/\/ found on the give allele. Example\n \/\/ Sample NA12878 has GT 0|1 for var1 and 0|0 for var2\n \/\/ then we update _linkCounts[0][1] + 1 (when chrom = 0)\n \/\/ and _linkCounots[0][0] + 1 (when chrom = 1)\n int g1, g2;\n convert(gtspec1[chrom], g1);\n convert(gtspec2[chrom], g2);\n ++_linkCounts[g1][g2];\n }\n }\n }\n}\n\nvoid SNPBridge::initLinkCounts(Variant& v1,\n Variant& v2)\n{\n \/\/ set _linkCounts to 0 and make sure it's at least\n \/\/ big enough to hold our alleles\n for (int i = 0; i < v1.alleles.size(); ++i)\n {\n if (_linkCounts.size() < v1.alleles.size())\n {\n _linkCounts.push_back(vector<int>(v2.alleles.size(), 0));\n }\n else\n {\n if (_linkCounts[i].size() < v2.alleles.size())\n {\n _linkCounts[i].resize(v2.alleles.size());\n }\n _linkCounts[i].assign(v2.alleles.size(), 0);\n }\n } \n}\n\nint SNPBridge::vgRefLength(Variant& var) const\n{\n \/\/ duplicating some code from the built in traversal of graphvariant,\n \/\/ but it's nice to have path length at outset to make scope checking\n \/\/ simpler (to relax assumption that vg contains whole vcf). \n if (_vg->paths.has_path(var.sequenceName) == false)\n {\n stringstream ss;\n ss << \"Unable to find path for \" << var.sequenceName << \" in vg file\";\n throw runtime_error(ss.str());\n }\n int len = 0;\n list<Mapping>& path = _vg->paths.get_path(var.sequenceName);\n for (auto& mapping : path)\n {\n if (mapping.is_reverse() == true)\n {\n throw(runtime_error(\"Reverse Mapping not supported\"));\n }\n if (mapping.edit_size() > 1 || (\n mapping.edit_size() == 1 && mapping.edit(0).from_length() !=\n mapping.edit(0).to_length()))\n {\n stringstream ss;\n ss << pb2json(mapping) << \": Only mappings with a single trvial edit\"\n << \" supported in ref path\";\n throw runtime_error(ss.str());\n }\n len += _vg->get_node(mapping.position().node_id())->sequence().length();\n }\n return len;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: javaedit.hxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: vg $ $Date: 2007-10-22 15:19:40 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n#ifndef _SW_JAVAEDIT_HXX\n#define _SW_JAVAEDIT_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#ifndef _SVX_STDDLG_HXX \/\/autogen\n#include <svx\/stddlg.hxx>\n#endif\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _SV_SVMEDIT_HXX \/\/autogen\n#include <svtools\/svmedit.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _IMAGEBTN_HXX \/\/autogen\n#include <vcl\/imagebtn.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwFldMgr;\nclass SwScriptField;\n\nnamespace sfx2 { class FileDialogHelper; }\n\n\/\/ class SwJavaEditDialog -------------------------------------------------\n\nclass SwJavaEditDialog : public SvxStandardDialog\n{\nprivate:\n FixedText aTypeFT;\n Edit aTypeED;\n RadioButton aUrlRB;\n RadioButton aEditRB;\n PushButton aUrlPB;\n Edit aUrlED;\n MultiLineEdit aEditED;\n FixedLine aPostItFL;\n\n OKButton aOKBtn;\n CancelButton aCancelBtn;\n ImageButton aPrevBtn;\n ImageButton aNextBtn;\n HelpButton aHelpBtn;\n\n String aText;\n String aType;\n\n BOOL bNew;\n BOOL bIsUrl;\n\n SwScriptField* pFld;\n SwFldMgr* pMgr;\n SwWrtShell* pSh;\n sfx2::FileDialogHelper* pFileDlg;\n Window* pOldDefDlgParent;\n\n DECL_LINK( OKHdl, Button* );\n DECL_LINK( PrevHdl, Button* );\n DECL_LINK( NextHdl, Button* );\n DECL_LINK( RadioButtonHdl, RadioButton* pBtn );\n DECL_LINK( InsertFileHdl, PushButton * );\n DECL_LINK( DlgClosedHdl, sfx2::FileDialogHelper * );\n\n virtual void Apply();\n\n void CheckTravel();\n void SetFld();\n\n using Window::GetText;\n using Window::GetType;\n\npublic:\n SwJavaEditDialog(Window* pParent, SwWrtShell* pWrtSh);\n ~SwJavaEditDialog();\n\n String GetText() { return aText; }\n\n String GetType() { return aType; }\n\n BOOL IsUrl() { return bIsUrl; }\n BOOL IsNew() { return bNew; }\n BOOL IsUpdate();\n};\n\n\n#endif\n\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.216); FILE MERGED 2008\/04\/01 15:59:14 thb 1.8.216.2: #i85898# Stripping all external header guards 2008\/03\/31 16:58:33 rt 1.8.216.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: javaedit.hxx,v $\n * $Revision: 1.9 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n#ifndef _SW_JAVAEDIT_HXX\n#define _SW_JAVAEDIT_HXX\n\n\/\/ include ---------------------------------------------------------------\n\n#include <svx\/stddlg.hxx>\n\n#ifndef _FIXED_HXX \/\/autogen\n#include <vcl\/fixed.hxx>\n#endif\n\n#ifndef _SV_SVMEDIT_HXX \/\/autogen\n#include <svtools\/svmedit.hxx>\n#endif\n\n#ifndef _BUTTON_HXX \/\/autogen\n#include <vcl\/button.hxx>\n#endif\n\n#ifndef _IMAGEBTN_HXX \/\/autogen\n#include <vcl\/imagebtn.hxx>\n#endif\n\nclass SwWrtShell;\nclass SwFldMgr;\nclass SwScriptField;\n\nnamespace sfx2 { class FileDialogHelper; }\n\n\/\/ class SwJavaEditDialog -------------------------------------------------\n\nclass SwJavaEditDialog : public SvxStandardDialog\n{\nprivate:\n FixedText aTypeFT;\n Edit aTypeED;\n RadioButton aUrlRB;\n RadioButton aEditRB;\n PushButton aUrlPB;\n Edit aUrlED;\n MultiLineEdit aEditED;\n FixedLine aPostItFL;\n\n OKButton aOKBtn;\n CancelButton aCancelBtn;\n ImageButton aPrevBtn;\n ImageButton aNextBtn;\n HelpButton aHelpBtn;\n\n String aText;\n String aType;\n\n BOOL bNew;\n BOOL bIsUrl;\n\n SwScriptField* pFld;\n SwFldMgr* pMgr;\n SwWrtShell* pSh;\n sfx2::FileDialogHelper* pFileDlg;\n Window* pOldDefDlgParent;\n\n DECL_LINK( OKHdl, Button* );\n DECL_LINK( PrevHdl, Button* );\n DECL_LINK( NextHdl, Button* );\n DECL_LINK( RadioButtonHdl, RadioButton* pBtn );\n DECL_LINK( InsertFileHdl, PushButton * );\n DECL_LINK( DlgClosedHdl, sfx2::FileDialogHelper * );\n\n virtual void Apply();\n\n void CheckTravel();\n void SetFld();\n\n using Window::GetText;\n using Window::GetType;\n\npublic:\n SwJavaEditDialog(Window* pParent, SwWrtShell* pWrtSh);\n ~SwJavaEditDialog();\n\n String GetText() { return aText; }\n\n String GetType() { return aType; }\n\n BOOL IsUrl() { return bIsUrl; }\n BOOL IsNew() { return bNew; }\n BOOL IsUpdate();\n};\n\n\n#endif\n\n<|endoftext|>"} {"text":"<commit_before>\/\/! \\file main.cpp\n\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"Article.h\"\n#include \"ToGraphvizWriter.h\"\n#include \"WikiWalker.h\"\n#include \"version.h\"\n\n#include \"config.h\"\n\nusing CmdOpt = WikiWalker::CommandLineParserBase::CommandLineOptions;\n\n\/\/! limit for printing article links \/ contents\nconst int printLimit = 10;\n\nint main(int argc, char** argv)\n{\n#if defined(WW_USE_BOOST_PO)\n WikiWalker::BoostPoCommandLineParser cmdp;\n#elif defined(WW_USE_GETOPT)\n WikiWalker::GetoptCommandLineParser cmdp;\n#endif\n\n try {\n cmdp.parse(argc, argv);\n } catch(std::exception& e) {\n std::cerr << std::endl << e.what() << std::endl;\n cmdp.printHelp();\n return -1;\n }\n\n if(cmdp.hasSet(CmdOpt::Version)) {\n std::cout << \"WikiWalker, version \" << _WW_VERSION << std::endl;\n return 0;\n }\n\n if(cmdp.hasSet(CmdOpt::Help)) {\n cmdp.printHelp();\n return 0;\n }\n\n bool isUrlSet = cmdp.hasSet(CmdOpt::URL);\n bool isCacheSet = cmdp.hasSet(CmdOpt::JsonCache);\n bool isDotSet = cmdp.hasSet(CmdOpt::DotOut);\n bool isDeepSet = cmdp.hasSet(CmdOpt::FetchDeep);\n bool validRunConfig = isUrlSet || (isDotSet && isCacheSet);\n\n if(!validRunConfig) {\n std::cerr << \"Must either specify at least URL, \"\n << \"or dot and cache file.\" << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n if(isUrlSet && isDeepSet && !isCacheSet) {\n std::cerr << \"Please specify a cache file when using \\\"deep\\\" option\"\n << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n bool read_failed = false;\n WikiWalker::WikiWalker w;\n\n if(isCacheSet) {\n try {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n w.readCache(cachefile);\n } catch(std::exception& e) {\n std::cout << e.what() << std::endl;\n read_failed = true;\n }\n }\n\n if(isUrlSet) {\n try {\n std::string url = cmdp.getValue(CmdOpt::URL);\n w.startWalking(url);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n return -1;\n }\n }\n\n if(isCacheSet) {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n if(read_failed) {\n cachefile.append(\"_\");\n std::cout << \"Reading from cache failed, write to \" << cachefile\n << std::endl;\n }\n try {\n w.writeCache(cachefile);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n }\n }\n\n if(isDotSet) {\n const WikiWalker::ArticleCollection& ac = w.getCollection();\n std::string outfile = cmdp.getValue(CmdOpt::DotOut);\n WikiWalker::ToGraphvizWriter tgw;\n std::ofstream file(outfile, std::ios::trunc | std::ios::out);\n\n if(file.fail()) {\n std::cerr << \"Error opening dot out file for writing\" << std::endl;\n } else {\n tgw.output(ac, file);\n file.flush();\n\n if(file.bad() || file.fail()) {\n std::cerr << \"Error during writing dot out file.\" << std::endl;\n }\n\n file.close();\n }\n }\n\n size_t numArt = w.getCollection().getNumAnalyzedArticles();\n if(numArt > 10) {\n std::cout << \"There are \" << numArt << \" analyzed articles.\"\n << \" Not printing them. (Limit: \" << printLimit << \").\"\n << std::endl;\n } else {\n for(auto& a : w.getCollection()) {\n auto& art = a.second;\n if(art->isAnalyzed()) {\n std::cout << \"Article \" << a.first << \" has \" << art->getNumLinks()\n << \" links\" << std::endl;\n }\n }\n }\n\n return 0;\n}\n<commit_msg>Output when article is missing\/invalid<commit_after>\/\/! \\file main.cpp\n\n#include <fstream>\n#include <iostream>\n#include <string>\n\n#include \"Article.h\"\n#include \"ToGraphvizWriter.h\"\n#include \"WikiWalker.h\"\n#include \"version.h\"\n\n#include \"config.h\"\n\nusing CmdOpt = WikiWalker::CommandLineParserBase::CommandLineOptions;\n\n\/\/! limit for printing article links \/ contents\nconst int printLimit = 10;\n\nint main(int argc, char** argv)\n{\n#if defined(WW_USE_BOOST_PO)\n WikiWalker::BoostPoCommandLineParser cmdp;\n#elif defined(WW_USE_GETOPT)\n WikiWalker::GetoptCommandLineParser cmdp;\n#endif\n\n try {\n cmdp.parse(argc, argv);\n } catch(std::exception& e) {\n std::cerr << std::endl << e.what() << std::endl;\n cmdp.printHelp();\n return -1;\n }\n\n if(cmdp.hasSet(CmdOpt::Version)) {\n std::cout << \"WikiWalker, version \" << _WW_VERSION << std::endl;\n return 0;\n }\n\n if(cmdp.hasSet(CmdOpt::Help)) {\n cmdp.printHelp();\n return 0;\n }\n\n bool isUrlSet = cmdp.hasSet(CmdOpt::URL);\n bool isCacheSet = cmdp.hasSet(CmdOpt::JsonCache);\n bool isDotSet = cmdp.hasSet(CmdOpt::DotOut);\n bool isDeepSet = cmdp.hasSet(CmdOpt::FetchDeep);\n bool validRunConfig = isUrlSet || (isDotSet && isCacheSet);\n\n if(!validRunConfig) {\n std::cerr << \"Must either specify at least URL, \"\n << \"or dot and cache file.\" << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n if(isUrlSet && isDeepSet && !isCacheSet) {\n std::cerr << \"Please specify a cache file when using \\\"deep\\\" option\"\n << std::endl;\n cmdp.printHelp();\n return 1;\n }\n\n bool read_failed = false;\n WikiWalker::WikiWalker w;\n\n if(isCacheSet) {\n try {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n w.readCache(cachefile);\n } catch(std::exception& e) {\n std::cout << e.what() << std::endl;\n read_failed = true;\n }\n }\n\n if(isUrlSet) {\n try {\n std::string url = cmdp.getValue(CmdOpt::URL);\n w.startWalking(url);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n return -1;\n }\n }\n\n if(isCacheSet) {\n std::string cachefile = cmdp.getValue(CmdOpt::JsonCache);\n if(read_failed) {\n cachefile.append(\"_\");\n std::cout << \"Reading from cache failed, write to \" << cachefile\n << std::endl;\n }\n try {\n w.writeCache(cachefile);\n } catch(std::exception& e) {\n std::cout << \"Error: \" << e.what() << std::endl;\n }\n }\n\n if(isDotSet) {\n const WikiWalker::ArticleCollection& ac = w.getCollection();\n std::string outfile = cmdp.getValue(CmdOpt::DotOut);\n WikiWalker::ToGraphvizWriter tgw;\n std::ofstream file(outfile, std::ios::trunc | std::ios::out);\n\n if(file.fail()) {\n std::cerr << \"Error opening dot out file for writing\" << std::endl;\n } else {\n tgw.output(ac, file);\n file.flush();\n\n if(file.bad() || file.fail()) {\n std::cerr << \"Error during writing dot out file.\" << std::endl;\n }\n\n file.close();\n }\n }\n\n size_t numArt = w.getCollection().getNumAnalyzedArticles();\n if(numArt > 10) {\n std::cout << \"There are \" << numArt << \" analyzed articles.\"\n << \" Not printing them. (Limit: \" << printLimit << \").\"\n << std::endl;\n } else {\n for(auto& a : w.getCollection()) {\n auto& art = a.second;\n if(art->isMarked()) {\n std::cout << \"Article \" << a.first << \" is invalid or doesn't exist\"\n << std::endl;\n } else if(art->isAnalyzed()) {\n std::cout << \"Article \" << a.first << \" has \" << art->getNumLinks()\n << \" links\" << std::endl;\n }\n }\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#ifndef CONST_H\r\n#define CONST_H\r\n\r\nusing namespace std;\r\n\r\nconst int WORD_SIZE = 8;\r\nconst int ADDR_SIZE = 4;\r\nconst int RAM_SIZE = 15;\r\n\r\n\/\/ Miliseconds between cycles (if automatic)\r\nconst int FQ = 300;\r\n\r\nconst int NUM_OF_INSTRUCTIONS = 8;\r\n\r\n#endif<commit_msg>a tad slower clock for more natural flow<commit_after>#ifndef CONST_H\r\n#define CONST_H\r\n\r\nusing namespace std;\r\n\r\nconst int WORD_SIZE = 8;\r\nconst int ADDR_SIZE = 4;\r\nconst int RAM_SIZE = 15;\r\n\r\n\/\/ Miliseconds between cycles (if automatic)\r\nconst int FQ = 333;\r\n\r\nconst int NUM_OF_INSTRUCTIONS = 8;\r\n\r\n#endif\r\n<|endoftext|>"} {"text":"<commit_before>#include <stdexcept>\n#include <limits>\n#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nclass CurlEasyException : public std::runtime_error\n{\n public:\n CurlEasyException(const std::string &msg):\n std::runtime_error(msg) {}\n\n CurlEasyException(CURLcode c):\n std::runtime_error(curl_easy_strerror(c)) {}\n};\n\nclass CurlEasy\n{\n public:\n CurlEasy(const std::string &url):\n m_pcurl(std::make_shared<CURL *>(curl_easy_init()))\n {\n if (!*m_pcurl)\n {\n throw CurlEasyException(\"curl handle not properly initialized.\");\n }\n\n if (url.empty())\n {\n throw CurlEasyException(\"Empty URL.\");\n }\n\n CURLcode c = curl_easy_setopt(*m_pcurl, CURLOPT_URL, url.c_str());\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n ~CurlEasy()\n {\n if (*m_pcurl)\n {\n curl_easy_cleanup(*m_pcurl);\n }\n }\n\n void perform()\n {\n CURLcode c = curl_easy_perform(*m_pcurl);\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n void write_to(const std::string &dest)\n {\n CURLcode c = curl_easy_setopt(*m_pcurl,\n CURLOPT_WRITEFUNCTION, &writefunction);\n\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n\n c = curl_easy_setopt(*m_pcurl,\n CURLOPT_WRITEDATA, &dest);\n\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n private:\n std::shared_ptr<CURL *> m_pcurl;\n};\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n }\n }\n if (fs.good())\n {\n fs.close();\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n auto calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::string url(patch_dir + name());\n CurlEasy curl(CurlEasy::Builder(url)\n .with_writeto(s)\n .build());\n \/*\n std::shared_ptr<CURL *> phandle =\n std::make_shared<CURL *>(curl_easy_init());\n curl_easy_setopt(*phandle, CURLOPT_URL, url.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &s);\n \/\/curl_easy_setopt(*phandle, CURLOPT_NOPROGRESS, 0);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n *\/\n std::ofstream ofs(name());\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n std::cout << \"Finished downloading \" << name() << std::endl;\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n\n return calcsum.str();\n}\n\nnamespace Options\n{\n bool checksum(const std::string &val)\n {\n return val == \"checksum\";\n }\n};\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = tolower(c);\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\nclass EfuLauncher\n{\n public:\n explicit EfuLauncher(const std::string path, const std::string update_check):\n m_path(path), m_update_check(update_check), m_has_update(false)\n {}\n\n bool has_update()\n {\n std::string fetch;\n auto phandle(std::make_shared<CURL*>(curl_easy_init()));\n curl_easy_setopt(*phandle, CURLOPT_URL, m_update_check.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto keyvals(split(*beg, '='));\n if (keyvals.size() != 2)\n {\n std::cerr << \"Malformed option: \" + *beg +\n \", aborting launcher update check.\" << std::endl;\n return m_has_update = false;\n }\n if (Options::checksum(keyvals[0]))\n {\n const std::string checksum_test(keyvals[1]);\n m_has_update = checksum_test != file_checksum(path());\n }\n }\n return m_has_update;\n }\n \n private:\n const std::string path() const { return m_path; }\n\n const std::string m_path;\n const std::string m_update_check;\n bool m_has_update;\n};\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"updatecheck\/versioncheck\");\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n std::cout << \"Done.\" << std::endl;\n }\n }\n\n std::string fetch;\n CurlEasy curl(CurlEasy::Builder(listing)\n .with_writeto(fetch)\n .build());\n curl.perform();\n \n \/*\n auto phandle(std::make_shared<CURL *>(curl_easy_init()));\n curl_easy_setopt(*phandle, CURLOPT_URL, listing.c_str());\n curl_easy_setopt(*phandle, CURLOPT_WRITEFUNCTION, &writefunction);\n curl_easy_setopt(*phandle, CURLOPT_WRITEDATA, &fetch);\n curl_easy_perform(*phandle);\n curl_easy_cleanup(*phandle);\n phandle.reset();\n *\/\n\n auto lines(split(fetch, '\\n'));\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n#ifndef DEBUG\n for (auto &t : new_targets)\n {\n t.fetch();\n }\n for (auto &t : old_targets)\n {\n t.fetch();\n }\n#endif\n\n return 0;\n}\n<commit_msg>Use the new curl wrapper.<commit_after>#include <stdexcept>\n#include <limits>\n#include <algorithm>\n#include <array>\n#include <iomanip>\n#include <curl\/curl.h>\n#include <memory>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <fstream>\n#include <vector>\n#include <sys\/stat.h>\n#include <cerrno>\n#include <cstring>\n#include <system_error>\n#include <openssl\/md5.h>\n#include <openssl\/sha.h>\n#include <openssl\/evp.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <sys\/mman.h>\n#include <fcntl.h>\n#include <string.h>\n\nconst std::string listing(\"http:\/\/nwn.efupw.com\/rootdir\/index.dat\");\nconst std::string patch_dir(\"http:\/\/nwn.efupw.com\/rootdir\/patch\/\");\n\nconst std::string file_checksum(const std::string &path);\n\nsize_t writefunction(const char *ptr, size_t size, size_t nmemb, void *userdata)\n{\n std::string *s = static_cast<std::string *>(userdata);\n s->append(ptr, size * nmemb);\n return size * nmemb;\n}\n\nclass CurlEasyException : public std::runtime_error\n{\n public:\n CurlEasyException(const std::string &msg):\n std::runtime_error(msg) {}\n\n CurlEasyException(CURLcode c):\n std::runtime_error(curl_easy_strerror(c)) {}\n};\n\nclass CurlEasy\n{\n public:\n CurlEasy(const std::string &url):\n m_pcurl(std::make_shared<CURL *>(curl_easy_init()))\n {\n if (!*m_pcurl)\n {\n throw CurlEasyException(\"curl handle not properly initialized.\");\n }\n\n if (url.empty())\n {\n throw CurlEasyException(\"Empty URL.\");\n }\n\n CURLcode c = curl_easy_setopt(*m_pcurl, CURLOPT_URL, url.c_str());\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n ~CurlEasy()\n {\n if (*m_pcurl)\n {\n curl_easy_cleanup(*m_pcurl);\n }\n }\n\n void perform()\n {\n CURLcode c = curl_easy_perform(*m_pcurl);\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n void write_to(const std::string &dest)\n {\n CURLcode c = curl_easy_setopt(*m_pcurl,\n CURLOPT_WRITEFUNCTION, &writefunction);\n\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n\n c = curl_easy_setopt(*m_pcurl,\n CURLOPT_WRITEDATA, &dest);\n\n if (c != CURLE_OK)\n {\n throw CurlEasyException(c);\n }\n }\n\n private:\n std::shared_ptr<CURL *> m_pcurl;\n};\n\nstd::vector<std::string> &split(const std::string &s, char delim,\n std::vector<std::string> &elems)\n{\n std::stringstream ss(s);\n std::string item;\n while (std::getline(ss, item, delim))\n {\n elems.push_back(item);\n }\n return elems;\n}\n\nstd::vector<std::string> split(const std::string &s, char delim)\n{\n std::vector<std::string> elems;\n return split(s, delim, elems);\n}\n\nclass Target\n{\n public:\n enum class Status {\n Nonexistent,\n Outdated,\n Current\n };\n explicit Target(const std::string &name, const std::string &checksum):\n m_name(name.find_first_of('\/') == std::string::npos ? name :\n name, name.find_first_of('\/') + 1, name.size() - 1),\n m_checksum(checksum)\n {}\n std::string name() const { return m_name; }\n const std::string checksum() const { return m_checksum; }\n\n void fetch()\n {\n std::cout << \"Statting target \" << name() << \"...\";\n std::string path;\n std::fstream fs(name(), std::ios_base::in);\n if (!fs.good())\n {\n fs.close();\n std::cout << \" doesn't exist, creating new.\" << std::endl;\n auto elems = split(name(), '\/');\n for (size_t i = 0, k = elems.size(); i < k; ++i)\n {\n const std::string &s(elems[i]);\n if (s.size() && s != \".\")\n {\n path.append((i > 0 ? \"\/\" : \"\") + s);\n \/\/ i indicates a directory.\n if (i < k - 1)\n {\n auto status = mkdir(path.c_str(), S_IRWXU);\n if (status == -1)\n {\n std::error_code err(errno, std::generic_category());\n if (err != std::errc::file_exists)\n {\n std::cout << \"error making dir: \"\n << path << \": \"\n << err.message() << std::endl;\n }\n }\n }\n }\n }\n fs.open(path, std::ios_base::out);\n if (!fs.good())\n {\n fs.close();\n std::cout << \"Failed to create file: \" << path << std::endl;\n }\n else\n {\n fs.close();\n do_fetch();\n return;\n }\n }\n if (fs.good())\n {\n fs.close();\n if (status() == Status::Current)\n {\n std::cout << \" already up to date.\" << std::endl;\n }\n else\n {\n std::cout << \" outdated, downloading new.\" << std::endl;\n do_fetch();\n }\n }\n }\n Status status()\n {\n std::ifstream is(name());\n if (!is.good())\n {\n return Status::Nonexistent;\n }\n is.close();\n auto calcsum(file_checksum(name()));\n if (calcsum == checksum())\n {\n return Status::Current;\n }\n else\n {\n return Status::Outdated;\n }\n }\n\n private:\n void do_fetch()\n {\n std::string s;\n std::string url(patch_dir + name());\n CurlEasy curl(url);\n curl.write_to(s);\n curl.perform();\n std::ofstream ofs(name());\n\n if (ofs.good())\n {\n ofs << s;\n ofs.close();\n std::cout << \"Finished downloading \" << name() << std::endl;\n }\n else\n {\n std::cout << \"Couldn't write to \" << name() << std::endl;\n }\n }\n\n std::string m_name;\n std::string m_checksum;\n};\n\nstd::ostream& operator<<(std::ostream &os, const Target &t)\n{\n return os << \"name: \" << t.name() << \", checksum: \" << t.checksum();\n}\n\nclass CurlGlobalInit\n{\n public:\n CurlGlobalInit()\n {\n curl_global_init(CURL_GLOBAL_ALL);\n }\n\n ~CurlGlobalInit()\n {\n curl_global_cleanup();\n }\n};\n\nconst std::string file_checksum(const std::string &path)\n{\n#ifdef md_md5\n auto md = EVP_md5();\n const int md_len = MD5_DIGEST_LENGTH;\n#else\n auto md = EVP_sha1();\n const int md_len = SHA_DIGEST_LENGTH;\n#endif\n std::array<unsigned char, md_len> result;\n EVP_MD_CTX *mdctx = nullptr;\n std::ifstream is(path, std::ifstream::binary);\n if (!is.good())\n {\n std::cout << \"Couldn't open file \" << path\n << \" for checksumming.\" << std::endl;\n return std::string();\n }\n\n const int length = 8192;\n std::array<unsigned char, length> buffer;\n auto buf = reinterpret_cast<char *>(buffer.data());\n mdctx = EVP_MD_CTX_create();\n int status = EVP_DigestInit_ex(mdctx, md, nullptr);\n while (status && is)\n {\n is.read(buf, length);\n status = EVP_DigestUpdate(mdctx, buffer.data(), is.gcount());\n }\n status = EVP_DigestFinal_ex(mdctx, result.data(), nullptr);\n EVP_MD_CTX_destroy(mdctx);\n std::stringstream calcsum;\n calcsum << std::setfill('0');\n \n for (unsigned char c : result)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n }\n \/*\n std::for_each(std::begin(result), std::end(result),\n [&calcsum](unsigned char c)\n {\n calcsum << std::hex << std::setw(2)\n << static_cast<unsigned int>(c);\n });\n *\/\n\n return calcsum.str();\n}\n\nnamespace Options\n{\n bool checksum(const std::string &val)\n {\n return val == \"checksum\";\n }\n};\n\nbool confirm()\n{\n char c;\n do\n {\n std::cin >> c;\n std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\\n');\n c = tolower(c);\n } while (c != 'y' && c != 'n');\n return c == 'y';\n}\n\nclass EfuLauncher\n{\n public:\n explicit EfuLauncher(const std::string path, const std::string update_check):\n m_path(path), m_update_check(update_check), m_has_update(false)\n {}\n\n bool has_update()\n {\n std::string fetch;\n CurlEasy curl(m_update_check.c_str());\n curl.write_to(fetch);\n curl.perform();\n\n std::vector<std::string> lines(split(fetch, '\\n'));\n fetch.clear();\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto keyvals(split(*beg, '='));\n if (keyvals.size() != 2)\n {\n std::cerr << \"Malformed option: \" + *beg +\n \", aborting launcher update check.\" << std::endl;\n return m_has_update = false;\n }\n if (Options::checksum(keyvals[0]))\n {\n const std::string checksum_test(keyvals[1]);\n m_has_update = checksum_test != file_checksum(path());\n }\n }\n return m_has_update;\n }\n \n private:\n const std::string path() const { return m_path; }\n\n const std::string m_path;\n const std::string m_update_check;\n bool m_has_update;\n};\n\nint main(int argc, char *argv[])\n{\n CurlGlobalInit curl_global;\n\n EfuLauncher l(argv[0],\n \"https:\/\/raw.github.com\/commonquail\/efulauncher\/\"\\\n \"updatecheck\/versioncheck\");\n if (l.has_update())\n {\n std::cout << \"A new version of the launcher is available.\"\\\n \" Would you like to download it (y\/n)?\" << std::endl;\n bool download(confirm());\n if (!download)\n {\n std::cout << \"It is strongly recommended to always use\"\\\n \" the latest launcher. Would you like to download it (y\/n)?\"\n << std::endl;\n download = confirm();\n }\n if (download)\n {\n \/\/ Download.\n std::cout << \"Downloading new launcher...\" << std::endl;\n std::cout << \"Done.\" << std::endl;\n }\n }\n\n std::string fetch;\n CurlEasy curl(listing);\n curl.write_to(fetch);\n curl.perform();\n\n auto lines(split(fetch, '\\n'));\n std::vector<Target> new_targets, old_targets;\n for (auto beg = std::begin(lines), end = std::end(lines);\n beg != end; ++beg)\n {\n auto data(split(*beg, '@'));\n Target t(data[0], data[data.size() - 1]);\n auto status = t.status();\n if (status == Target::Status::Nonexistent)\n {\n new_targets.push_back(std::move(t));\n }\n else if (status == Target::Status::Outdated)\n {\n old_targets.push_back(std::move(t));\n }\n }\n if (new_targets.size())\n {\n std::cout << \"New targets: \" << new_targets.size() << std::endl;\n for (auto &t : new_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No new targets.\" << std::endl;\n }\n\n if (old_targets.size())\n {\n std::cout << \"Outdated targets: \" << old_targets.size() << std::endl;\n for (auto &t : old_targets)\n {\n std::cout << \"- \" << t.name() << std::endl;\n }\n }\n else\n {\n std::cout << \"No targets out of date.\" << std::endl;\n }\n\n#ifndef DEBUG\n for (auto &t : new_targets)\n {\n t.fetch();\n }\n for (auto &t : old_targets)\n {\n t.fetch();\n }\n#endif\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Do not use deprecated comphelper::string::getToken<commit_after><|endoftext|>"} {"text":"<commit_before>\/**************************************************************************\r\n** This file is part of LiteIDE\r\n**\r\n** Copyright (c) 2011-2016 LiteIDE Team. All rights reserved.\r\n**\r\n** This library is free software; you can redistribute it and\/or\r\n** modify it under the terms of the GNU Lesser General Public\r\n** License as published by the Free Software Foundation; either\r\n** version 2.1 of the License, or (at your option) any later version.\r\n**\r\n** This library is distributed in the hope that it will be useful,\r\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n** Lesser General Public License for more details.\r\n**\r\n** In addition, as a special exception, that plugins developed for LiteIDE,\r\n** are allowed to remain closed sourced and can be distributed under any license .\r\n** These rights are included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n**************************************************************************\/\r\n\/\/ Module: quickopenwidget.cpp\r\n\/\/ Creator: visualfc <visualfc@gmail.com>\r\n\r\n#include \"quickopenwidget.h\"\r\n#include \"liteapi\/liteids.h\"\r\n#include <QVBoxLayout>\r\n#include <QComboBox>\r\n#include <QTreeView>\r\n#include <QFocusEvent>\r\n#include <QHeaderView>\r\n#include <QDebug>\r\n\r\n\/\/lite_memory_check_begin\r\n#if defined(WIN32) && defined(_MSC_VER) && defined(_DEBUG)\r\n #define _CRTDBG_MAP_ALLOC\r\n #include <stdlib.h>\r\n #include <crtdbg.h>\r\n #define DEBUG_NEW new( _NORMAL_BLOCK, __FILE__, __LINE__ )\r\n #define new DEBUG_NEW\r\n#endif\r\n\/\/lite_memory_check_end\r\n\r\nQuickOpenWidget::QuickOpenWidget(LiteApi::IApplication *app, QWidget *parent) :\r\n QWidget(parent,Qt::Popup),\/\/ Qt::ToolTip | Qt::WindowStaysOnTopHint)\r\n m_liteApp(app)\r\n{\r\n \/\/this->setFocusPolicy(Qt::NoFocus);\r\n m_edit = new Utils::FilterLineEdit(300);\r\n m_view = new QTreeView;\r\n m_view->setHeaderHidden(true);\r\n m_view->setTextElideMode(Qt::ElideLeft);\r\n#if QT_VERSION >= 0x050000\r\n m_view->header()->setSectionResizeMode(QHeaderView::ResizeToContents);\r\n#else\r\n m_view->header()->setResizeMode(QHeaderView::ResizeToContents);\r\n#endif\r\n m_view->setEditTriggers(QAbstractItemView::NoEditTriggers);\r\n\r\n m_wrap = true;\r\n\r\n QVBoxLayout *layout = new QVBoxLayout;\r\n layout->setMargin(0);\r\n layout->setSpacing(0);\r\n layout->addWidget(m_edit);\r\n layout->addWidget(m_view);\r\n\r\n this->setMinimumWidth(600);\r\n\r\n this->setLayout(layout);\r\n\r\n connect(m_edit,SIGNAL(filterChanged(QString)),this,SIGNAL(filterChanged(QString)));\r\n\r\n m_edit->installEventFilter(this);\r\n}\r\n\r\nvoid QuickOpenWidget::setModel(QAbstractItemModel *model)\r\n{\r\n m_view->setModel(model);\r\n}\r\n\r\nQLineEdit *QuickOpenWidget::editor()\r\n{\r\n return m_edit;\r\n}\r\n\r\nQTreeView *QuickOpenWidget::view()\r\n{\r\n return m_view;\r\n}\r\n\r\nvoid QuickOpenWidget::hideEvent(QHideEvent *e)\r\n{\r\n emit hideWidget();\r\n QWidget::hideEvent(e);\r\n}\r\n\r\nvoid QuickOpenWidget::showView(QPoint *pos)\r\n{\r\n if (pos == 0) {\r\n QToolBar *toolBar = m_liteApp->actionManager()->loadToolBar(ID_TOOLBAR_STD);\r\n QRect rc = toolBar->frameGeometry();\r\n QPoint pt = rc.topRight();\r\n pt.rx() += 4;\r\n pt.ry() += 2;\r\n this->move(m_liteApp->mainWindow()->mapToGlobal(pt));\r\n } else {\r\n this->move(pos->x(),pos->y());\r\n }\r\n m_edit->setFocus();\r\n this->show();\r\n}\r\n\r\nbool QuickOpenWidget::eventFilter(QObject *o, QEvent *e)\r\n{\r\n if (e->type() == QEvent::KeyPress) {\r\n QKeyEvent *ke = static_cast<QKeyEvent *>(e);\r\n QAbstractItemModel *model = m_view->model();\r\n\r\n if (!model) {\r\n return false;\r\n }\r\n\r\n int row = m_view->currentIndex().row();\r\n\r\n const int key = ke->key();\r\n switch (key) {\r\n case Qt::Key_Up: {\r\n row--;\r\n if (row < 0) {\r\n if (m_wrap) {\r\n row = model->rowCount()-1;\r\n }\r\n }\r\n QModelIndex index = model->index(row,0);\r\n m_view->setCurrentIndex(index);\r\n emit indexChanage(index);\r\n return true;\r\n }\r\n case Qt::Key_Down: {\r\n row++;\r\n if (row >= model->rowCount()) {\r\n if (m_wrap) {\r\n row = 0;\r\n }\r\n }\r\n QModelIndex index = model->index(row,0);\r\n m_view->setCurrentIndex(index);\r\n emit indexChanage(index);\r\n return true;\r\n }\r\n }\r\n } else if (e->type() == QEvent::FocusOut) {\r\n if (QWidget::focusWidget() == m_view ) {\r\n m_edit->setFocus();\r\n }\r\n return true;\r\n }\r\n return QWidget::eventFilter(o,e);\r\n}\r\n<commit_msg>quickopen: fix pos for editor manager<commit_after>\/**************************************************************************\r\n** This file is part of LiteIDE\r\n**\r\n** Copyright (c) 2011-2016 LiteIDE Team. All rights reserved.\r\n**\r\n** This library is free software; you can redistribute it and\/or\r\n** modify it under the terms of the GNU Lesser General Public\r\n** License as published by the Free Software Foundation; either\r\n** version 2.1 of the License, or (at your option) any later version.\r\n**\r\n** This library is distributed in the hope that it will be useful,\r\n** but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n** MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n** Lesser General Public License for more details.\r\n**\r\n** In addition, as a special exception, that plugins developed for LiteIDE,\r\n** are allowed to remain closed sourced and can be distributed under any license .\r\n** These rights are included in the file LGPL_EXCEPTION.txt in this package.\r\n**\r\n**************************************************************************\/\r\n\/\/ Module: quickopenwidget.cpp\r\n\/\/ Creator: visualfc <visualfc@gmail.com>\r\n\r\n#include \"quickopenwidget.h\"\r\n#include \"liteapi\/liteids.h\"\r\n#include <QVBoxLayout>\r\n#include <QComboBox>\r\n#include <QTreeView>\r\n#include <QFocusEvent>\r\n#include <QHeaderView>\r\n#include <QDebug>\r\n\r\n\/\/lite_memory_check_begin\r\n#if defined(WIN32) && defined(_MSC_VER) && defined(_DEBUG)\r\n #define _CRTDBG_MAP_ALLOC\r\n #include <stdlib.h>\r\n #include <crtdbg.h>\r\n #define DEBUG_NEW new( _NORMAL_BLOCK, __FILE__, __LINE__ )\r\n #define new DEBUG_NEW\r\n#endif\r\n\/\/lite_memory_check_end\r\n\r\nQuickOpenWidget::QuickOpenWidget(LiteApi::IApplication *app, QWidget *parent) :\r\n QWidget(parent,Qt::Popup),\/\/ Qt::ToolTip | Qt::WindowStaysOnTopHint)\r\n m_liteApp(app)\r\n{\r\n \/\/this->setFocusPolicy(Qt::NoFocus);\r\n m_edit = new Utils::FilterLineEdit(300);\r\n m_view = new QTreeView;\r\n m_view->setHeaderHidden(true);\r\n m_view->setTextElideMode(Qt::ElideLeft);\r\n#if QT_VERSION >= 0x050000\r\n m_view->header()->setSectionResizeMode(QHeaderView::ResizeToContents);\r\n#else\r\n m_view->header()->setResizeMode(QHeaderView::ResizeToContents);\r\n#endif\r\n m_view->setEditTriggers(QAbstractItemView::NoEditTriggers);\r\n\r\n m_wrap = true;\r\n\r\n QVBoxLayout *layout = new QVBoxLayout;\r\n layout->setMargin(0);\r\n layout->setSpacing(0);\r\n layout->addWidget(m_edit);\r\n layout->addWidget(m_view);\r\n\r\n this->setMinimumWidth(600);\r\n\r\n this->setLayout(layout);\r\n\r\n connect(m_edit,SIGNAL(filterChanged(QString)),this,SIGNAL(filterChanged(QString)));\r\n\r\n m_edit->installEventFilter(this);\r\n}\r\n\r\nvoid QuickOpenWidget::setModel(QAbstractItemModel *model)\r\n{\r\n m_view->setModel(model);\r\n}\r\n\r\nQLineEdit *QuickOpenWidget::editor()\r\n{\r\n return m_edit;\r\n}\r\n\r\nQTreeView *QuickOpenWidget::view()\r\n{\r\n return m_view;\r\n}\r\n\r\nvoid QuickOpenWidget::hideEvent(QHideEvent *e)\r\n{\r\n emit hideWidget();\r\n QWidget::hideEvent(e);\r\n}\r\n\r\nvoid QuickOpenWidget::showView(QPoint *pos)\r\n{\r\n if (pos == 0) {\r\n QPoint pt(0,0);\r\n this->move(m_liteApp->editorManager()->widget()->mapToGlobal(pt));\r\n } else {\r\n this->move(pos->x(),pos->y());\r\n }\r\n m_edit->setFocus();\r\n this->show();\r\n}\r\n\r\nbool QuickOpenWidget::eventFilter(QObject *o, QEvent *e)\r\n{\r\n if (e->type() == QEvent::KeyPress) {\r\n QKeyEvent *ke = static_cast<QKeyEvent *>(e);\r\n QAbstractItemModel *model = m_view->model();\r\n\r\n if (!model) {\r\n return false;\r\n }\r\n\r\n int row = m_view->currentIndex().row();\r\n\r\n const int key = ke->key();\r\n switch (key) {\r\n case Qt::Key_Up: {\r\n row--;\r\n if (row < 0) {\r\n if (m_wrap) {\r\n row = model->rowCount()-1;\r\n }\r\n }\r\n QModelIndex index = model->index(row,0);\r\n m_view->setCurrentIndex(index);\r\n emit indexChanage(index);\r\n return true;\r\n }\r\n case Qt::Key_Down: {\r\n row++;\r\n if (row >= model->rowCount()) {\r\n if (m_wrap) {\r\n row = 0;\r\n }\r\n }\r\n QModelIndex index = model->index(row,0);\r\n m_view->setCurrentIndex(index);\r\n emit indexChanage(index);\r\n return true;\r\n }\r\n }\r\n } else if (e->type() == QEvent::FocusOut) {\r\n if (QWidget::focusWidget() == m_view ) {\r\n m_edit->setFocus();\r\n }\r\n return true;\r\n }\r\n return QWidget::eventFilter(o,e);\r\n}\r\n<|endoftext|>"} {"text":"<commit_before>#include <oglShaders.h>\n#include <oglDisplay.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <stdint.h>\n#include <assert.h>\n\n#include <memory.h>\n#include <str_utils.h>\n#include <string.h>\n\n#include <OGL\/OGLGpuBuffer.h>\n#include <RenderBackend.h>\n\nstatic GLuint _currentShaderProgram = 0;\n\n#pragma warning(disable:4996)\n\nvoid _print_shader_info_log(GLuint idx) {\n\tint max_length = 2048;\n\tint actual_length = 0;\n\tchar shader_log[2048];\n\tglGetShaderInfoLog(idx, max_length, &actual_length, shader_log);\n\tprintf(\"shader info log for GL index %u:\\n%s\\n\", idx, shader_log);\n}\n\nvoid _print_programme_info_log(GLuint programme) {\n\tint max_length = 2048;\n\tint actual_length = 0;\n\tchar program_log[2048];\n\tglGetProgramInfoLog(programme, max_length, &actual_length, program_log);\n\tprintf(\"program info log for GL index %u:\\n%s\", programme, program_log);\n}\n\nvoid useShaderProgram(GLuint id) {\n\t\/\/WARNING: switching shaders takes a BOATLOAD of time. it is best to switch as little as possible.\n\t\/\/may even want to render all elements with the same shader before moving onto next element...\n\tif (_currentShaderProgram == id) return;\n\t_currentShaderProgram = id;\n\tglUseProgram(id);\n\/\/\tprintf(\"shader %d\\n\", id);\n}\n\nstatic char* read_from_disk(const char* path) {\n\tFILE* f = fopen(path, \"r\");\n\tif (f == NULL) {\n\t\tassert(f);\n\t\treturn NULL;\n\t}\n\n\tfseek(f, 0, SEEK_END);\n\tsize_t size = ftell(f);\n\tfseek(f, 0, SEEK_SET);\n\n\tchar *str = (char*)malloc(size + 1);\n\tsize_t bytes_read = fread(str, 1, size, f);\n\tint error = ferror(f);\n\tfclose(f);\n\n\tif (error != 0) {\n\t\tprintf(\"File error: %d\\n\", error);\n\t\tfree(str);\n\t\tstr = NULL;\n\t\treturn str;\n\t}\n\n\tsize = bytes_read;\n\tchar* realloc_ptr = (char*)realloc(str, size+1);\n\tassert(realloc_ptr != NULL);\n\tstr = realloc_ptr;\n\tstr[size] = 0;\n\n\treturn str;\n}\n\nstatic GLuint compile_shader(const char* str, GLuint shader_type) {\n\tGLuint f_shader = glCreateShader(shader_type);\n\tglShaderSource(f_shader, 1, &str, NULL);\n\tglCompileShader(f_shader);\n\n\t\/\/ check for compile errors\n\tint params = -1;\n\tglGetShaderiv(f_shader, GL_COMPILE_STATUS, ¶ms);\n\tif (GL_TRUE != params) {\n\t\tfprintf(stderr, \"ERROR: GL shader index %i did not compile\\n\", f_shader);\n\t\t_print_shader_info_log(f_shader);\n\t\tglDeleteShader(f_shader);\n\t\treturn 0;\n\t}\n\n\treturn f_shader;\n}\n\nvoid HgOglShader::setup_shader(HgOglShader* shader) {\n\tshader_source* source = shader->m_shaderSource.get();\n\n\tGLuint vert_id = 0;\n\tGLuint frag_id = 0;\n\tGLuint geom_id = 0;\n\n\tif (!source->vert_source.empty()) vert_id = compile_shader(source->vert_source.c_str(), GL_VERTEX_SHADER);\n\tif (!source->frag_source.empty()) frag_id = compile_shader(source->frag_source.c_str(), GL_FRAGMENT_SHADER);\n\tif (!source->geom_source.empty()) geom_id = compile_shader(source->geom_source.c_str(), GL_GEOMETRY_SHADER);\n\n\tsource->vert_source = source->frag_source = source->geom_source = \"\";\n\n\tif ((vert_id == 0) && (frag_id == 0) && (geom_id == 0)) return;\n\n\n\tGLuint shader_program = shader->program_id;\n\tif (shader_program==0) shader_program = glCreateProgram();\n\n\tif (vert_id>0) glAttachShader(shader_program, vert_id);\n\tif (frag_id>0) glAttachShader(shader_program, frag_id);\n\tif (geom_id>0) glAttachShader(shader_program, geom_id);\n\tglLinkProgram(shader_program);\n\n\tif (vert_id > 0) {\n\t\tglDetachShader(shader_program, vert_id);\n\t\tglDeleteShader(vert_id);\n\t}\n\tif (frag_id > 0) {\n\t\tglDetachShader(shader_program, frag_id);\n\t\tglDeleteShader(frag_id);\n\t}\n\tif (geom_id > 0) {\n\t\tglDetachShader(shader_program, geom_id);\n\t\tglDeleteShader(geom_id);\n\t}\n\n\t\/\/ check if link was successful\n\tGLint params = -1;\n\tglGetProgramiv(shader_program, GL_LINK_STATUS, ¶ms);\n\tif (GL_TRUE != params) {\n\t\tfprintf(stderr,\n\t\t\t\"ERROR: could not link shader programme GL index %u\\n\",\n\t\t\tshader_program);\n\t\t_print_programme_info_log(shader_program);\n\t\treturn;\n\t}\n\tshader->program_id = shader_program;\n\tshader->m_loadState = LoadState::READY;\n\n\n\tGLint size; \/\/ size of the variable\n\tGLenum type; \/\/ type of the variable (float, vec3 or mat4, etc)\n\n\tGLchar name[64]; \/\/ variable name in GLSL\n\tGLsizei length; \/\/ name length\n\n\t\/\/create list of uniforms\n\tGLint uniform_count = 0;\n\tglGetProgramiv(shader_program, GL_ACTIVE_UNIFORMS, &uniform_count);\n\n\tmemset(shader->m_uniformLocations, -1, sizeof(*shader->m_uniformLocations)*U_UNIFORM_COUNT);\n\n\tfor (GLuint i = 0; i < uniform_count; i++)\n\t{\n\t\tglGetActiveUniform(shader_program, i, 64, &length, &size, &type, name);\n\t\t\/\/printf(\"Uniform #%d Type: %u Name: %s\\n\", i, type, name);\n\t\tfor (int j = 0; j < U_UNIFORM_COUNT; j++) {\n\t\t\tif (strcmp(name, UniformString[j]) == 0) {\n\t\t\t\tshader->m_uniformLocations[j] = glGetUniformLocation(shader_program, name);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (j == (U_UNIFORM_COUNT - 1)) fprintf(stderr, \"HgShaders: Unknown uniform \\\"%s\\\"\\n\", name);\n\t\t}\n\t}\n}\n\nstd::unique_ptr<HgShader> HgOglShader::Create(const char* vert, const char* frag) {\n\tstd::unique_ptr<HgOglShader> s = std::make_unique<HgOglShader>();\n\n\n\tauto source = std::make_unique<shader_source>();\n\tsource->vert_file_path = str_copy(vert);\n\tsource->frag_file_path = str_copy(frag);\n\ts->setProgramCode(source);\n\n\treturn s;\n}\n\nHgOglShader::HgOglShader()\n\t:program_id(0), m_loadState(LoadState::NOT_LOADED)\n{\n\tmemset(m_uniformLocations, -1, sizeof(m_uniformLocations));\n}\n\nHgOglShader::~HgOglShader() {\n\tdestroy();\n}\n\nvoid HgOglShader::load() {\n\tif (!m_shaderSource->vert_file_path.empty()) m_shaderSource->vert_source = read_from_disk(m_shaderSource->vert_file_path.c_str());\n\tif (!m_shaderSource->frag_file_path.empty()) m_shaderSource->frag_source = read_from_disk(m_shaderSource->frag_file_path.c_str());\n\tif (!m_shaderSource->geom_file_path.empty()) m_shaderSource->geom_source = read_from_disk(m_shaderSource->geom_file_path.c_str());\n\n\tm_loadState = LoadState::SOURCE_LOADED;\n}\n\nvoid HgOglShader::destroy() {\n\tif (program_id > 0) glDeleteProgram(program_id);\n\tprogram_id = 0;\n}\n\nvoid HgOglShader::enable() {\n\tif (m_loadState == LoadState::NOT_LOADED) return;\n\n\tif (program_id == 0 || m_loadState == LoadState::SOURCE_LOADED) setup_shader(this);\n\tif (program_id>0) useShaderProgram(program_id);\n}\n\nvoid HgOglShader::setLocalUniforms(const quaternion* rotation, const point* position, float scale, const point* origin, const RenderData* rd, const HgCamera* camera) {\n\tGLuint old_program = _currentShaderProgram;\n\n\tif (old_program == program_id) {\n\t\tsendLocalUniformsToGPU(rotation, position, scale, origin, rd, camera);\n\t\treturn;\n\t}\n\n\t\/\/Log warning about being slow and change to this program\n\tfprintf(stderr, \"Warning (%s): Temporary shader context change.\\n\", __FUNCTION__);\n\tenable();\n\n\tsendLocalUniformsToGPU(rotation, position, scale, origin, rd, camera);\n\n\tuseShaderProgram(old_program); \/\/change back to previous program\n}\n\nvoid HgOglShader::uploadMatrices(const HgMath::mat4f& modelView, const HgMath::mat4f& projection, const HgMath::mat4f& view) {\n\tusing namespace HgMath;\n\tconstexpr const int matrixCount = 3;\n\n\tfloat mm[16 * matrixCount];\n\n\tif (m_uniformLocations[U_MATRICES] <= -1) return;\n\n\tmodelView.store(mm);\n\tprojection.store(mm + 16);\n\tview.store(mm + 32);\n\tglUniformMatrix4fv(m_uniformLocations[U_MATRICES], matrixCount, GL_FALSE, mm);\n}\n\n\nvoid HgOglShader::sendLocalUniformsToGPU(const quaternion* rotation, const point* position, float scale, const point* origin, const RenderData* rd, const HgCamera* camera) {\n\tOGLRenderData* oglrd = (OGLRenderData*)rd;\n\n\tglActiveTexture(GL_TEXTURE0);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::DIFFUSE]);\n\tif ((m_uniformLocations[U_DIFFUSE_TEXTURE] > -1) && (oglrd->textureID[HgTexture::DIFFUSE] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::DIFFUSE]);\n\t\tglUniform1i(m_uniformLocations[U_DIFFUSE_TEXTURE], 0);\n\t}\n\n\tglActiveTexture(GL_TEXTURE1);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\tif ((m_uniformLocations[U_SPECULAR_TEXTURE] > -1) && (oglrd->textureID[HgTexture::SPECULAR] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\t\tglUniform1i(m_uniformLocations[U_SPECULAR_TEXTURE], 1);\n\t}\n\n\tglActiveTexture(GL_TEXTURE2);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::NORMAL]);\n\tif ((m_uniformLocations[U_NORMAL_TEXTURE] > -1) && (oglrd->textureID[HgTexture::NORMAL] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\t\tglUniform1i(m_uniformLocations[U_NORMAL_TEXTURE], 2);\n\t}\n\n\tglActiveTexture(GL_TEXTURE3);\n\tif ((m_uniformLocations[U_BUFFER_OBJECT1] > -1) && (oglrd->gpuBuffer != nullptr)) {\n\t\tOGLHgGPUBuffer* api = (OGLHgGPUBuffer*)oglrd->gpuBuffer->apiImpl();\n\t\tif (oglrd->gpuBuffer->NeedsUpdate()) {\n\t\t\t\/\/api->OGLHgGPUBuffer::SendToGPU(oglrd->gpuBuffer.get()); \/\/no vtable lookup\n\t\t\tapi->OGLHgGPUBuffer::SendToGPU(oglrd->gpuBuffer); \/\/no vtable lookup\n\t\t}\n\t\tapi->OGLHgGPUBuffer::Bind(); \/\/no vtable lookup\n\t\tglUniform1i(m_uniformLocations[U_BUFFER_OBJECT1], 3);\n\t}\n}<commit_msg>remove if<commit_after>#include <oglShaders.h>\n#include <oglDisplay.h>\n\n#include <stdlib.h>\n#include <stdio.h>\n#include <stdint.h>\n#include <assert.h>\n\n#include <memory.h>\n#include <str_utils.h>\n#include <string.h>\n\n#include <OGL\/OGLGpuBuffer.h>\n#include <RenderBackend.h>\n\nstatic GLuint _currentShaderProgram = 0;\n\n#pragma warning(disable:4996)\n\nvoid _print_shader_info_log(GLuint idx) {\n\tint max_length = 2048;\n\tint actual_length = 0;\n\tchar shader_log[2048];\n\tglGetShaderInfoLog(idx, max_length, &actual_length, shader_log);\n\tprintf(\"shader info log for GL index %u:\\n%s\\n\", idx, shader_log);\n}\n\nvoid _print_programme_info_log(GLuint programme) {\n\tint max_length = 2048;\n\tint actual_length = 0;\n\tchar program_log[2048];\n\tglGetProgramInfoLog(programme, max_length, &actual_length, program_log);\n\tprintf(\"program info log for GL index %u:\\n%s\", programme, program_log);\n}\n\nvoid useShaderProgram(GLuint id) {\n\t\/\/WARNING: switching shaders takes a BOATLOAD of time. it is best to switch as little as possible.\n\t\/\/may even want to render all elements with the same shader before moving onto next element...\n\tif (_currentShaderProgram == id) return;\n\t_currentShaderProgram = id;\n\tglUseProgram(id);\n\/\/\tprintf(\"shader %d\\n\", id);\n}\n\nstatic char* read_from_disk(const char* path) {\n\tFILE* f = fopen(path, \"r\");\n\tif (f == NULL) {\n\t\tassert(f);\n\t\treturn NULL;\n\t}\n\n\tfseek(f, 0, SEEK_END);\n\tsize_t size = ftell(f);\n\tfseek(f, 0, SEEK_SET);\n\n\tchar *str = (char*)malloc(size + 1);\n\tsize_t bytes_read = fread(str, 1, size, f);\n\tint error = ferror(f);\n\tfclose(f);\n\n\tif (error != 0) {\n\t\tprintf(\"File error: %d\\n\", error);\n\t\tfree(str);\n\t\tstr = NULL;\n\t\treturn str;\n\t}\n\n\tsize = bytes_read;\n\tchar* realloc_ptr = (char*)realloc(str, size+1);\n\tassert(realloc_ptr != NULL);\n\tstr = realloc_ptr;\n\tstr[size] = 0;\n\n\treturn str;\n}\n\nstatic GLuint compile_shader(const char* str, GLuint shader_type) {\n\tGLuint f_shader = glCreateShader(shader_type);\n\tglShaderSource(f_shader, 1, &str, NULL);\n\tglCompileShader(f_shader);\n\n\t\/\/ check for compile errors\n\tint params = -1;\n\tglGetShaderiv(f_shader, GL_COMPILE_STATUS, ¶ms);\n\tif (GL_TRUE != params) {\n\t\tfprintf(stderr, \"ERROR: GL shader index %i did not compile\\n\", f_shader);\n\t\t_print_shader_info_log(f_shader);\n\t\tglDeleteShader(f_shader);\n\t\treturn 0;\n\t}\n\n\treturn f_shader;\n}\n\nvoid HgOglShader::setup_shader(HgOglShader* shader) {\n\tshader_source* source = shader->m_shaderSource.get();\n\n\tGLuint vert_id = 0;\n\tGLuint frag_id = 0;\n\tGLuint geom_id = 0;\n\n\tif (!source->vert_source.empty()) vert_id = compile_shader(source->vert_source.c_str(), GL_VERTEX_SHADER);\n\tif (!source->frag_source.empty()) frag_id = compile_shader(source->frag_source.c_str(), GL_FRAGMENT_SHADER);\n\tif (!source->geom_source.empty()) geom_id = compile_shader(source->geom_source.c_str(), GL_GEOMETRY_SHADER);\n\n\tsource->vert_source = source->frag_source = source->geom_source = \"\";\n\n\tif ((vert_id == 0) && (frag_id == 0) && (geom_id == 0)) return;\n\n\n\tGLuint shader_program = shader->program_id;\n\tif (shader_program==0) shader_program = glCreateProgram();\n\n\tif (vert_id>0) glAttachShader(shader_program, vert_id);\n\tif (frag_id>0) glAttachShader(shader_program, frag_id);\n\tif (geom_id>0) glAttachShader(shader_program, geom_id);\n\tglLinkProgram(shader_program);\n\n\tif (vert_id > 0) {\n\t\tglDetachShader(shader_program, vert_id);\n\t\tglDeleteShader(vert_id);\n\t}\n\tif (frag_id > 0) {\n\t\tglDetachShader(shader_program, frag_id);\n\t\tglDeleteShader(frag_id);\n\t}\n\tif (geom_id > 0) {\n\t\tglDetachShader(shader_program, geom_id);\n\t\tglDeleteShader(geom_id);\n\t}\n\n\t\/\/ check if link was successful\n\tGLint params = -1;\n\tglGetProgramiv(shader_program, GL_LINK_STATUS, ¶ms);\n\tif (GL_TRUE != params) {\n\t\tfprintf(stderr,\n\t\t\t\"ERROR: could not link shader programme GL index %u\\n\",\n\t\t\tshader_program);\n\t\t_print_programme_info_log(shader_program);\n\t\treturn;\n\t}\n\tshader->program_id = shader_program;\n\tshader->m_loadState = LoadState::READY;\n\n\n\tGLint size; \/\/ size of the variable\n\tGLenum type; \/\/ type of the variable (float, vec3 or mat4, etc)\n\n\tGLchar name[64]; \/\/ variable name in GLSL\n\tGLsizei length; \/\/ name length\n\n\t\/\/create list of uniforms\n\tGLint uniform_count = 0;\n\tglGetProgramiv(shader_program, GL_ACTIVE_UNIFORMS, &uniform_count);\n\n\tmemset(shader->m_uniformLocations, -1, sizeof(*shader->m_uniformLocations)*U_UNIFORM_COUNT);\n\n\tfor (GLuint i = 0; i < uniform_count; i++)\n\t{\n\t\tglGetActiveUniform(shader_program, i, 64, &length, &size, &type, name);\n\t\t\/\/printf(\"Uniform #%d Type: %u Name: %s\\n\", i, type, name);\n\t\tfor (int j = 0; j < U_UNIFORM_COUNT; j++) {\n\t\t\tif (strcmp(name, UniformString[j]) == 0) {\n\t\t\t\tshader->m_uniformLocations[j] = glGetUniformLocation(shader_program, name);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (j == (U_UNIFORM_COUNT - 1)) fprintf(stderr, \"HgShaders: Unknown uniform \\\"%s\\\"\\n\", name);\n\t\t}\n\t}\n}\n\nstd::unique_ptr<HgShader> HgOglShader::Create(const char* vert, const char* frag) {\n\tstd::unique_ptr<HgOglShader> s = std::make_unique<HgOglShader>();\n\n\n\tauto source = std::make_unique<shader_source>();\n\tsource->vert_file_path = str_copy(vert);\n\tsource->frag_file_path = str_copy(frag);\n\ts->setProgramCode(source);\n\n\treturn s;\n}\n\nHgOglShader::HgOglShader()\n\t:program_id(0), m_loadState(LoadState::NOT_LOADED)\n{\n\tmemset(m_uniformLocations, -1, sizeof(m_uniformLocations));\n}\n\nHgOglShader::~HgOglShader() {\n\tdestroy();\n}\n\nvoid HgOglShader::load() {\n\tif (!m_shaderSource->vert_file_path.empty()) m_shaderSource->vert_source = read_from_disk(m_shaderSource->vert_file_path.c_str());\n\tif (!m_shaderSource->frag_file_path.empty()) m_shaderSource->frag_source = read_from_disk(m_shaderSource->frag_file_path.c_str());\n\tif (!m_shaderSource->geom_file_path.empty()) m_shaderSource->geom_source = read_from_disk(m_shaderSource->geom_file_path.c_str());\n\n\tm_loadState = LoadState::SOURCE_LOADED;\n}\n\nvoid HgOglShader::destroy() {\n\tif (program_id > 0) glDeleteProgram(program_id);\n\tprogram_id = 0;\n}\n\nvoid HgOglShader::enable() {\n\tif (m_loadState == LoadState::NOT_LOADED) return;\n\n\tif (program_id == 0 || m_loadState == LoadState::SOURCE_LOADED) setup_shader(this);\n\tif (program_id>0) useShaderProgram(program_id);\n}\n\nvoid HgOglShader::setLocalUniforms(const quaternion* rotation, const point* position, float scale, const point* origin, const RenderData* rd, const HgCamera* camera) {\n\tGLuint old_program = _currentShaderProgram;\n\n\tif (old_program == program_id) {\n\t\tsendLocalUniformsToGPU(rotation, position, scale, origin, rd, camera);\n\t\treturn;\n\t}\n\n\t\/\/Log warning about being slow and change to this program\n\tfprintf(stderr, \"Warning (%s): Temporary shader context change.\\n\", __FUNCTION__);\n\tenable();\n\n\tsendLocalUniformsToGPU(rotation, position, scale, origin, rd, camera);\n\n\tuseShaderProgram(old_program); \/\/change back to previous program\n}\n\nvoid HgOglShader::uploadMatrices(const HgMath::mat4f& modelView, const HgMath::mat4f& projection, const HgMath::mat4f& view) {\n\tusing namespace HgMath;\n\tconstexpr const int matrixCount = 3;\n\n\tfloat mm[16 * matrixCount];\n\n\t\/\/if (m_uniformLocations[U_MATRICES] <= -1) return; \/\/everything needs matrices. don't bother checking\n\n\tmodelView.store(mm);\n\tprojection.store(mm + 16);\n\tview.store(mm + 32);\n\tglUniformMatrix4fv(m_uniformLocations[U_MATRICES], matrixCount, GL_FALSE, mm);\n}\n\n\nvoid HgOglShader::sendLocalUniformsToGPU(const quaternion* rotation, const point* position, float scale, const point* origin, const RenderData* rd, const HgCamera* camera) {\n\tOGLRenderData* oglrd = (OGLRenderData*)rd;\n\n\tglActiveTexture(GL_TEXTURE0);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::DIFFUSE]);\n\tif ((m_uniformLocations[U_DIFFUSE_TEXTURE] > -1) && (oglrd->textureID[HgTexture::DIFFUSE] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::DIFFUSE]);\n\t\tglUniform1i(m_uniformLocations[U_DIFFUSE_TEXTURE], 0);\n\t}\n\n\tglActiveTexture(GL_TEXTURE1);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\tif ((m_uniformLocations[U_SPECULAR_TEXTURE] > -1) && (oglrd->textureID[HgTexture::SPECULAR] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\t\tglUniform1i(m_uniformLocations[U_SPECULAR_TEXTURE], 1);\n\t}\n\n\tglActiveTexture(GL_TEXTURE2);\n\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::NORMAL]);\n\tif ((m_uniformLocations[U_NORMAL_TEXTURE] > -1) && (oglrd->textureID[HgTexture::NORMAL] > 0)) {\n\t\t\/\/\t\tglBindTexture(GL_TEXTURE_2D, oglrd->textureID[HgTexture::SPECULAR]);\n\t\tglUniform1i(m_uniformLocations[U_NORMAL_TEXTURE], 2);\n\t}\n\n\tglActiveTexture(GL_TEXTURE3);\n\tif ((m_uniformLocations[U_BUFFER_OBJECT1] > -1) && (oglrd->gpuBuffer != nullptr)) {\n\t\tOGLHgGPUBuffer* api = (OGLHgGPUBuffer*)oglrd->gpuBuffer->apiImpl();\n\t\tif (oglrd->gpuBuffer->NeedsUpdate()) {\n\t\t\t\/\/api->OGLHgGPUBuffer::SendToGPU(oglrd->gpuBuffer.get()); \/\/no vtable lookup\n\t\t\tapi->OGLHgGPUBuffer::SendToGPU(oglrd->gpuBuffer); \/\/no vtable lookup\n\t\t}\n\t\tapi->OGLHgGPUBuffer::Bind(); \/\/no vtable lookup\n\t\tglUniform1i(m_uniformLocations[U_BUFFER_OBJECT1], 3);\n\t}\n}<|endoftext|>"} {"text":"<commit_before>\/\/ expect-success\n\/*\n * Copyright 2014 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#define IN_FRUIT_CPP_FILE\n\n#include <fruit\/impl\/data_structures\/semistatic_graph.h>\n#include <fruit\/impl\/data_structures\/semistatic_graph.templates.h>\n\n#include <vector>\n\nusing namespace std;\nusing namespace fruit::impl;\n\nusing Graph = SemistaticGraph<int, const char*>;\nusing node_iterator = Graph::node_iterator;\nusing edge_iterator = Graph::edge_iterator;\n\nvector<size_t> no_neighbors = {};\n\nstruct SimpleNode {\n size_t id;\n const char* value;\n const vector<size_t>* neighbors;\n bool is_terminal;\n \n size_t getId() { return id; }\n const char* getValue() { return value; }\n bool isTerminal() { return is_terminal; }\n vector<size_t>::const_iterator getEdgesBegin() { return neighbors->begin(); }\n vector<size_t>::const_iterator getEdgesEnd() { return neighbors->end(); }\n};\n\n\nvoid test_empty() {\n vector<SimpleNode> values{};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(graph.find(2) == graph.end());\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_1_node_no_edges() {\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_1_node_no_edges_terminal() {\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_1_node_self_edge() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &neighbors, false}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n edge_iterator itr = graph.at(2).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_2_nodes_one_edge() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_3_nodes_two_edges() {\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n ++itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"baz\"));\n assert(itr.getNodeIterator(graph).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_add_node() {\n vector<SimpleNode> old_values{{2, \"foo\", &no_neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph old_graph(old_values.begin(), old_values.end());\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> new_values{{3, \"bar\", &neighbors, false}};\n Graph graph(old_graph, new_values.begin(), new_values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n ++itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"baz\"));\n assert(itr.getNodeIterator(graph).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_set_terminal() {\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n graph.changeNodeToTerminal(3);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_move_constructor() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph1(values.begin(), values.end());\n Graph graph = std::move(graph1);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_move_assignment() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph1(values.begin(), values.end());\n Graph graph;\n graph = std::move(graph1);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nint main() {\n \n test_empty();\n test_1_node_no_edges();\n test_1_node_no_edges_terminal();\n test_1_node_self_edge();\n test_2_nodes_one_edge();\n test_3_nodes_two_edges();\n test_add_node();\n test_set_terminal();\n test_move_constructor();\n test_move_assignment();\n \n return 0;\n}\n<commit_msg>Increase unit test coverage for SemistaticGraph, now also testing const methods and const_node_iterator.<commit_after>\/\/ expect-success\n\/*\n * Copyright 2014 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#define IN_FRUIT_CPP_FILE\n\n#include <fruit\/impl\/data_structures\/semistatic_graph.h>\n#include <fruit\/impl\/data_structures\/semistatic_graph.templates.h>\n\n#include <vector>\n\nusing namespace std;\nusing namespace fruit::impl;\n\nusing Graph = SemistaticGraph<int, const char*>;\nusing node_iterator = Graph::node_iterator;\nusing edge_iterator = Graph::edge_iterator;\n\nvector<size_t> no_neighbors = {};\n\nstruct SimpleNode {\n size_t id;\n const char* value;\n const vector<size_t>* neighbors;\n bool is_terminal;\n \n size_t getId() { return id; }\n const char* getValue() { return value; }\n bool isTerminal() { return is_terminal; }\n vector<size_t>::const_iterator getEdgesBegin() { return neighbors->begin(); }\n vector<size_t>::const_iterator getEdgesEnd() { return neighbors->end(); }\n};\n\n\nvoid test_empty() {\n vector<SimpleNode> values{};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(graph.find(2) == graph.end());\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(cgraph.find(2) == cgraph.end());\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_1_node_no_edges() {\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}};\n\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == false);\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_1_node_no_edges_terminal() {\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph; \n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == true);\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_1_node_self_edge() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &neighbors, false}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n edge_iterator itr = graph.at(2).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == false);\n}\n\nvoid test_2_nodes_one_edge() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == false);\n assert(cgraph.find(3).getNode() == string(\"bar\"));\n assert(cgraph.find(3).isTerminal() == false);\n}\n\nvoid test_3_nodes_two_edges() {\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n ++itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"baz\"));\n assert(itr.getNodeIterator(graph).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == false);\n assert(cgraph.find(3).getNode() == string(\"bar\"));\n assert(cgraph.find(3).isTerminal() == false);\n assert(cgraph.find(4).getNode() == string(\"baz\"));\n assert(cgraph.find(4).isTerminal() == true);\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_add_node() {\n vector<SimpleNode> old_values{{2, \"foo\", &no_neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph old_graph(old_values.begin(), old_values.end());\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> new_values{{3, \"bar\", &neighbors, false}};\n Graph graph(old_graph, new_values.begin(), new_values.end());\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n ++itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"baz\"));\n assert(itr.getNodeIterator(graph).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(2).isTerminal() == false);\n assert(cgraph.find(3).getNode() == string(\"bar\"));\n assert(cgraph.find(3).isTerminal() == false);\n assert(cgraph.find(4).getNode() == string(\"baz\"));\n assert(cgraph.find(4).isTerminal() == true);\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_set_terminal() {\n vector<size_t> neighbors = {2, 4};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}, {4, \"baz\", &no_neighbors, true}};\n Graph graph(values.begin(), values.end());\n graph.changeNodeToTerminal(3);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == true);\n assert(graph.at(4).getNode() == string(\"baz\"));\n assert(graph.at(4).isTerminal() == true);\n assert(graph.find(5) == graph.end());\n const Graph& cgraph = graph;\n assert(cgraph.find(0) == cgraph.end());\n assert(!(cgraph.find(2) == cgraph.end()));\n assert(cgraph.find(2).getNode() == string(\"foo\"));\n assert(cgraph.find(3).getNode() == string(\"bar\"));\n assert(cgraph.find(4).getNode() == string(\"baz\"));\n assert(cgraph.find(5) == cgraph.end());\n}\n\nvoid test_move_constructor() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph1(values.begin(), values.end());\n Graph graph = std::move(graph1);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nvoid test_move_assignment() {\n vector<size_t> neighbors = {2};\n vector<SimpleNode> values{{2, \"foo\", &no_neighbors, false}, {3, \"bar\", &neighbors, false}};\n Graph graph1(values.begin(), values.end());\n Graph graph;\n graph = std::move(graph1);\n assert(graph.find(0) == graph.end());\n assert(!(graph.find(2) == graph.end()));\n assert(graph.at(2).getNode() == string(\"foo\"));\n assert(graph.at(2).isTerminal() == false);\n assert(graph.at(3).getNode() == string(\"bar\"));\n assert(graph.at(3).isTerminal() == false);\n edge_iterator itr = graph.at(3).neighborsBegin();\n (void)itr;\n assert(itr.getNodeIterator(graph).getNode() == string(\"foo\"));\n assert(itr.getNodeIterator(graph).isTerminal() == false);\n assert(graph.find(5) == graph.end());\n}\n\nint main() {\n \n test_empty();\n test_1_node_no_edges();\n test_1_node_no_edges_terminal();\n test_1_node_self_edge();\n test_2_nodes_one_edge();\n test_3_nodes_two_edges();\n test_add_node();\n test_set_terminal();\n test_move_constructor();\n test_move_assignment();\n \n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <Scene\/Member\/cModeSelect.h>\n#include <CameraManager\/cCameraManager.h>\n#include \"Resource\\TextureManager.h\"\n#include\"cinder\\gl\\gl.h\"\n#include <Utility\/cInput.h>\n#include \"cinder\\Easing.h\"\n#include \"Particle\\cParticleManager.h\"\n#include <Sound\/Wav.h>\n#include\"Resource\\cSoundManager.h\"\n#include <Scene\/Member\/Tutorial.h>\n#include <Network.hpp>\n#include <Scene\/Member\/cMatching.h>\n#include <Scene\/Member\/cGameMain.h>\n#include <Scene\/cSceneManager.h>\n#include <Game\/cGameManager.h>\n#include <Scene\/Member\/cTitle.h>\n#include\"Resource\\cImageManager.h\"\n#include <Network.hpp>\n#include <Resource\/cJsonManager.h>\n#include <Network\/cMatchingMemberManager.h>\nusing namespace ci;\nusing namespace ci::app;\n\nusing namespace Node;\n\nusing namespace Node::Action;\n\nusing namespace Network;\nusing namespace Network::Packet::Event;\nusing namespace Network::Packet::Request;\nusing namespace Network::Packet::Response;\nnamespace Scene\n{\nnamespace Member\n{\ncModeSelect::cModeSelect( )\n{\n\n\t\n}\ncModeSelect::~cModeSelect( )\n{\n\t\n\t\n}\nvoid cModeSelect::setup()\n{\n\tauto bgm = Sound::Wav(cinder::app::getAssetDirectories().front().string() + \"\/BGM\/modeselect.wav\");\n\tintroloopBGM.create(bgm.data(), bgm.size(), 22.130F, 78.594F);\n\tintroloopBGM.gain(0.15F);\n\tintroloopBGM.play();\n\tCAMERA->refPosition = ci::vec3(0,0,-0.001);\n\tENV->setMouseControl(false);\n\tCAMERA->setCameraAngle(ci::vec2(M_PI\/18.f, M_PI \/ 18.f));\n\tCAMERA->setup();\n\tcreateTextureNames();\n\n\tfor (float i = 0; i < 4; i++) {\n\t\tmSelectCards.push_back(std::make_shared<ModeSelect::cSelectCard>(i*2.f*M_PI \/ 4.f, iconnames[i], ci::vec3(0, 0.5, 3), ci::vec3(2.5, 0.5, 4.75),i));\n\t}\n\troot = Node::node::create();\n\troot->set_content_size(app::getWindowSize());\n\troot->set_schedule_update();\n\troot->set_scale(vec2(1, -1));\n\troot->set_position(root->get_content_size() * vec2(-0.5F, 0.5F));\n\n\tauto fader = root->add_child(Node::Renderer::rect::create(app::getWindowSize()));\n\tfader->set_color(ColorA(0, 0, 0, 1));\n\tfader->set_anchor_point(vec2(0, 0));\n\tfader->run_action(sequence::create( fade_out::create(1.0F), call_func::create([this]\n\t{\n\t\tthis->isfading = false;\n\t\t\/\/ci::app::console() << \"ӂ\t\" << std::endl;\n\t})));\n\t\/\/this->isfading = false;\n}\nvoid cModeSelect::shutDown()\n{\n\tmSelectCards.clear();\n\ticonnames.clear();\n\tintroloopBGM.stop();\n}\nvoid cModeSelect::update(float t)\n{\n\tfor (auto& it : mSelectCards) {\n\t\tit->update(t);\n\t}\n\tupdateBackGround(t);\n\tupdateButtonAlfa(t);\n\tupdateArrow(t);\n\tintroloopBGM.update(t);\n\tselectIcon();\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_RETURN)|| ENV->isPadPush(ENV->BUTTON_2)) {\n\t\tdesideScene();\n\t}\n\troot->entry_update(t);\n\n\tif (watching == false)\n\t{\n\t\tif (ENV->pushKey(ci::app::KeyEvent::KEY_a))\n\t\t{\n\t\t\twatching = true;\n\t\t\tNetwork::cUDPClientManager::getInstance()->open();\n\t\t\tcUDPClientManager::getInstance()->connect(Resource::JSON[\"server.json\"][\"ip\"].asString());\n\t\t}\n\t}\n\n\telse\n\t{\n\t\tNetwork::cUDPClientManager::getInstance()->update(t);\n\t\tif (cUDPClientManager::getInstance()->isConnected() == false)return;\n\t\t\n\t\tif (fase == WatchFase::NONE)\n\t\t{\n\t\t\tcUDPClientManager::getInstance()->send(new cReqInRoomWatching(100));\n\t\t\tfase = WatchFase::BEIGN;\n\t\t}\n\n\t\telse if (fase == WatchFase::BEIGN)\n\t\t{\n\t\t\tauto m = Network::cUDPClientManager::getInstance()->getUDPManager();\n\n\t\t\twhile (auto resInRoom = m->ResInRoom.get())\n\t\t\t{\n\t\t\t\tif (resInRoom->mFlag = false)\n\t\t\t\t{\n\t\t\t\t\tcUDPClientManager::getInstance()->send(new cReqInRoom(100));\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tcUDPClientManager::getInstance()->send(new cReqWantTeamIn(0));\n\t\t\t\tfase == WatchFase::WAIT;\n\t\t\t}\n\t\t}\n\n\t\telse if (fase == WatchFase::WAIT)\n\t\t{\n\t\t\tauto m = Network::cUDPClientManager::getInstance()->getUDPManager();\n\t\t\twhile (auto resWantTeamIn = m->ResWantTeamIn.get())\n\t\t\t{\n\t\t\t\tif (resWantTeamIn->mFlag == 1)\n\t\t\t\tNetwork::cMatchingMemberManager::getInstance()->mPlayerTeamNum = resWantTeamIn->mTeamNum;;\n\t\t\t}\n\t\t\tint count = 0;\n\t\t\twhile (auto eveTeamMember = m->EveTeamMember.get())\n\t\t\t{\n\t\t\t\tcMatchingMemberManager::getInstance()->addPlayerDatas(\n\t\t\t\t\teveTeamMember->mNameStr, eveTeamMember->mTeamNum, eveTeamMember->mPlayerID, cNetworkHandle(\"\", 0));\n\t\t\t}\n\t\t\twhile (auto resCheckBeginGame = m->ResCheckBeginGame.get())\n\t\t\t{\n\t\t\t\tcMatchingMemberManager::getInstance()->mPlayerID = resCheckBeginGame->mPlayerID;\n\t\t\t\tcSceneManager::getInstance()->shift<Scene::Member::cGameMain>();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\nvoid cModeSelect::draw()\n{\n\tmDrawFunc.drawTextureCube(ci::vec3(0), ci::vec3(16, 9, 20), ci::vec3(M_PI\/12.f, 0, mBackGroundRotateZ), \"modeselect\/selectsky.png\", ci::ColorA(1, 1, 1));\n\n\tfor (auto& it : mSelectCards) {\n\t\tit->draw();\n\t}\n\tdrawButton();\n\n\tmDrawFunc.drawTextureRect3D(ci::vec3(-0.85-aroowtranceY\/2.f, -0.7+aroowtranceY,-0.3), ci::vec3(0.8, 0.16,0),ci::vec3(0,0,M_PI- M_PI \/ 12.f) , \"modeselect\/redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n\tmDrawFunc.drawTextureRect3D(ci::vec3(1.55+aroowtranceY\/2.f, -0.7 + aroowtranceY, -0.3), ci::vec3(-0.8, 0.12, 0), ci::vec3(0, 0, M_PI + M_PI \/ 4.25f), \"modeselect\/redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n\t\/\/mDrawFunc.drawTextureRect3D(ci::vec3(-400, -175 + aroowtranceY), ci::vec3(250, 50), M_PI - M_PI \/ 9.f, \"redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n}\nvoid cModeSelect::draw2D()\n{\n\t\/*mDrawFunc.drawTextureRect2D(ci::vec2(400,-175+aroowtranceY), ci::vec2(-250, 50), M_PI+M_PI\/9.f, \"redright.png\", ci::ColorA(1, 1, 1,arrowAlfa));\n\tmDrawFunc.drawTextureRect2D(ci::vec2(-400, -175+aroowtranceY), ci::vec2(250, 50), M_PI - M_PI \/ 9.f, \"redright.png\", ci::ColorA(1, 1,1, arrowAlfa));*\/\n\tmDrawFunc.drawTextureRect2D(ci::vec2(550,-320), ci::vec2(-590,449)*0.52f, M_PI, \"title\/logo.png\", ci::ColorA(1, 1, 1, 1));\n\troot->entry_render(mat4());\n}\nvoid cModeSelect::resize()\n{\n\n}\n\nvoid cModeSelect::createTextureNames()\n{\n\ticonnames.push_back(\"modeselect\/online.png\");\n\ticonnames.push_back(\"modeselect\/tutorial.png\");\n\ticonnames.push_back(\"modeselect\/gotitle.png\");\n\ticonnames.push_back(\"modeselect\/training.png\");\n\t\n}\n\nvoid cModeSelect::changeScene()\n{\n\t\n\tswitch (MSelectScene)\n\t{\n\tcase 0:\n\t\tshiftOnlineBattle();\n\t\treturn;\n\tcase 1:\n\t\tshiftTutorial();\n\t\treturn;\n\tcase 2:\n\t\tshiftTitle();\n\t\treturn;\n\tcase 3:\n\t\tshiftLocalBattle();\n\t\treturn;\n\tdefault:\n\t\tbreak;\n\t}\n}\n\nvoid cModeSelect::selectIcon()\n{\n\tif (isfading)return;\n\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_LEFT)||ENV->getPadAxisPushMinus(0)) {\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").setGain(0.4f);\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").play();\n\t\tfor (auto& it : mSelectCards) {\n\t\t\tit->setEasing(true);\n\t\t}\n\t\tMSelectScene++;\n\t\tif (MSelectScene == 4)MSelectScene = 0;\n\t\treturn;\n\t}\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_RIGHT) || ENV->getPadAxisPushPlus(0)) {\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").setGain(0.4f);\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").play();\n\t\tfor (auto& it : mSelectCards) {\n\t\t\tit->setEasing(false);\n\t\t}\n\t\tMSelectScene--;\n\t\tif (MSelectScene < 0)MSelectScene = 3;\n\t\treturn;\n\t}\n}\n\nvoid cModeSelect::shiftOnlineBattle()\n{\n\t\/\/introloopBGM.stop();\n\tcSceneManager::getInstance()->shift<Scene::Member::cMatching>();\n}\n\nvoid cModeSelect::shiftTitle()\n{\n\t\/\/introloopBGM.stop();\n\tcSceneManager::getInstance()->shift<Scene::Member::cTitle>();\n}\n\nvoid cModeSelect::shiftLocalBattle()\n{\n\t\/\/introloopBGM.stop();\n\tNetwork::cUDPClientManager::getInstance()->open();\n\tNetwork::cUDPServerManager::getInstance()->open();\n\tNetwork::cUDPClientManager::getInstance()->connectOfflineServer();\n\tGame::cGameManager::getInstance()->setTime(0.0F);\n\tcSceneManager::getInstance()->shift<Scene::Member::cGameMain>();\n}\n\nvoid cModeSelect::shiftTutorial()\n{\n\t\/\/introloopBGM.stop();\n\tNetwork::cUDPClientManager::getInstance()->open();\n\tNetwork::cUDPServerManager::getInstance()->open();\n\tNetwork::cUDPClientManager::getInstance()->connectOfflineServer();\n\tGame::cGameManager::getInstance()->setTime(0.0F);\n\tcSceneManager::getInstance()->shift<Scene::Member::cTutorial>();\n}\n\nvoid cModeSelect::desideScene()\n{\n\tif (isfading)return;\n\tfor (auto& it : mSelectCards) {\n\t\tif (it->getIsEasing())return;\/\/C[WO͖\n\t}\n\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/return.wav\").setGain(0.8f);\n\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/return.wav\").play();\n\tintroloopBGM.fadeout(0.9f,0.0f);\n\tisfading = true;\n\tauto fader = root->add_child(Node::Renderer::rect::create(app::getWindowSize()));\n\tfader->set_color(ColorA(0, 0, 0, 0));\n\tfader->set_anchor_point(vec2(0, 0));\n\tfader->run_action(sequence::create( fade_in::create(1.0F), call_func::create([this]\n\t{\n\t\tthis->changeScene();\n\t})));\n}\n\nvoid cModeSelect::updateBackGround(float t)\n{\n\tmBackGroundRotateZ += 0.02f*t;\n}\n\nvoid cModeSelect::drawButton()\n{\n\tci::vec3 pos = ci::vec3(-0.5, -0.4, -1.78);\n\tmDrawFunc.drawTextureRect3D(pos, ci::vec3(0.2, 0.2, 0), ci::vec3(0, M_PI, 0), \"modeselect\/buttonb.png\", ci::ColorA(1, 1, 1, 1));\n\tmDrawFunc.drawTextureRect3D(pos+ci::vec3(0,0,-0.01), ci::vec3(0.2, 0.2, 0)*buttonscale, ci::vec3(0, M_PI, 0), \"modeselect\/ring.png\", ci::ColorA(1, 1, 0, buttonalfa));\n\t\n}\n\nvoid cModeSelect::updateButtonAlfa(float t)\n{\n\tfloat speed = 2.18f;\n\tbuttonAlfaT += speed*t;\n\tbool isend = false;\n\tif (buttonAlfaT >= 1.0f) {\n\t\tbuttonAlfaT = 1.0f;\n\t\tisend = true;\n\t}\n\tbuttonalfa = EaseCubicIn(buttonAlfaT, 0.4f, 0.8f);\n\tbuttonscale = EaseCubicIn(buttonAlfaT, 0.8f, 1.2f);\n\tif (isend) {\n\t\tbuttonAlfaT = 0.0f;\n\t}\n\n}\n\nvoid cModeSelect::updateArrow(float t)\n{\n\tfloat speed = 1.09f;\n\tarrowT += speed*t;\n\tbool isend = false;\n\tif (arrowT >= 1.0f) {\n\t\tarrowT = 1.0f;\n\t\tisend = true;\n\t}\n\taroowtranceY = EaseReturn(arrowT, 0, 0.05f);\/\/PT\n\tarrowAlfa = EaseReturn(arrowT, 0.5f, 0.5f);\n\tif (isend) {\n\t\tarrowT = 0.0f;\n\t}\n}\n\nfloat cModeSelect::EaseReturn(const float t, const float s, const float e)\n{\n\treturn s + -4.f*e*(t - 0.5f)*(t - 0.5f) + e;\n}\n\n}\n}\n<commit_msg>modeSelectに感染者移行処理追加<commit_after>#include <Scene\/Member\/cModeSelect.h>\n#include <CameraManager\/cCameraManager.h>\n#include \"Resource\\TextureManager.h\"\n#include\"cinder\\gl\\gl.h\"\n#include <Utility\/cInput.h>\n#include \"cinder\\Easing.h\"\n#include \"Particle\\cParticleManager.h\"\n#include <Sound\/Wav.h>\n#include\"Resource\\cSoundManager.h\"\n#include <Scene\/Member\/Tutorial.h>\n#include <Network.hpp>\n#include <Scene\/Member\/cMatching.h>\n#include <Scene\/Member\/cGameMain.h>\n#include <Scene\/cSceneManager.h>\n#include <Game\/cGameManager.h>\n#include <Scene\/Member\/cTitle.h>\n#include\"Resource\\cImageManager.h\"\n#include <Network.hpp>\n#include <Resource\/cJsonManager.h>\n#include <Network\/cMatchingMemberManager.h>\nusing namespace ci;\nusing namespace ci::app;\n\nusing namespace Node;\n\nusing namespace Node::Action;\n\nusing namespace Network;\nusing namespace Network::Packet::Event;\nusing namespace Network::Packet::Request;\nusing namespace Network::Packet::Response;\nnamespace Scene\n{\nnamespace Member\n{\ncModeSelect::cModeSelect( )\n{\n\n\t\n}\ncModeSelect::~cModeSelect( )\n{\n\t\n\t\n}\nvoid cModeSelect::setup()\n{\n\tauto bgm = Sound::Wav(cinder::app::getAssetDirectories().front().string() + \"\/BGM\/modeselect.wav\");\n\tintroloopBGM.create(bgm.data(), bgm.size(), 22.130F, 78.594F);\n\tintroloopBGM.gain(0.15F);\n\tintroloopBGM.play();\n\tCAMERA->refPosition = ci::vec3(0,0,-0.001);\n\tENV->setMouseControl(false);\n\tCAMERA->setCameraAngle(ci::vec2(M_PI\/18.f, M_PI \/ 18.f));\n\tCAMERA->setup();\n\tcreateTextureNames();\n\n\tfor (float i = 0; i < 4; i++) {\n\t\tmSelectCards.push_back(std::make_shared<ModeSelect::cSelectCard>(i*2.f*M_PI \/ 4.f, iconnames[i], ci::vec3(0, 0.5, 3), ci::vec3(2.5, 0.5, 4.75),i));\n\t}\n\troot = Node::node::create();\n\troot->set_content_size(app::getWindowSize());\n\troot->set_schedule_update();\n\troot->set_scale(vec2(1, -1));\n\troot->set_position(root->get_content_size() * vec2(-0.5F, 0.5F));\n\n\tauto fader = root->add_child(Node::Renderer::rect::create(app::getWindowSize()));\n\tfader->set_color(ColorA(0, 0, 0, 1));\n\tfader->set_anchor_point(vec2(0, 0));\n\tfader->run_action(sequence::create( fade_out::create(1.0F), call_func::create([this]\n\t{\n\t\tthis->isfading = false;\n\t\t\/\/ci::app::console() << \"ӂ\t\" << std::endl;\n\t})));\n\t\/\/this->isfading = false;\n}\nvoid cModeSelect::shutDown()\n{\n\tmSelectCards.clear();\n\ticonnames.clear();\n\tintroloopBGM.stop();\n}\nvoid cModeSelect::update(float t)\n{\n\tif (watching == false)\n\t{\n\tfor (auto& it : mSelectCards) {\n\t\tit->update(t);\n\t}\n\tupdateBackGround(t);\n\tupdateButtonAlfa(t);\n\tupdateArrow(t);\n\tintroloopBGM.update(t);\n\tselectIcon();\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_RETURN)|| ENV->isPadPush(ENV->BUTTON_2)) {\n\t\tdesideScene();\n\t}\n\troot->entry_update(t);\n\t\tif (ENV->pushKey(ci::app::KeyEvent::KEY_a))\n\t\t{\n\t\t\twatching = true;\n\t\t\tNetwork::cUDPClientManager::getInstance()->open();\n\t\t\tcUDPClientManager::getInstance()->connect(Resource::JSON[\"server.json\"][\"ip\"].asString());\n\t\t\tfase = WatchFase::NONE;\n\t\t}\n\t}\n\n\telse\n\t{\n\t\tNetwork::cUDPClientManager::getInstance()->update(t);\n\t\tif (cUDPClientManager::getInstance()->isConnected() == false)return;\n\t\t\n\t\tif (fase == WatchFase::NONE)\n\t\t{\n\t\t\tcUDPClientManager::getInstance()->send(new cReqInRoomWatching(100));\n\t\t\tfase = WatchFase::BEIGN;\n\t\t}\n\n\t\telse if (fase == WatchFase::BEIGN)\n\t\t{\n\t\t\tauto m = Network::cUDPClientManager::getInstance()->getUDPManager();\n\n\t\t\twhile (auto resInRoom = m->ResInRoom.get())\n\t\t\t{\n\t\t\t\tif (resInRoom->mFlag = false)\n\t\t\t\t{\n\t\t\t\t\tcUDPClientManager::getInstance()->send(new cReqInRoom(100));\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tcUDPClientManager::getInstance()->send(new cReqWantTeamIn(0));\n\t\t\t\tfase = WatchFase::WAIT;\n\t\t\t}\n\t\t}\n\n\t\telse if (fase == WatchFase::WAIT)\n\t\t{\n\t\t\tauto m = Network::cUDPClientManager::getInstance()->getUDPManager();\n\t\t\twhile (auto resWantTeamIn = m->ResWantTeamIn.get())\n\t\t\t{\n\t\t\t\tif (resWantTeamIn->mFlag == 1)\n\t\t\t\tNetwork::cMatchingMemberManager::getInstance()->mPlayerTeamNum = resWantTeamIn->mTeamNum;;\n\t\t\t}\n\t\t\twhile (auto eveTeamMember = m->EveTeamMember.get())\n\t\t\t{\n\t\t\t\tcMatchingMemberManager::getInstance()->addPlayerDatas(\n\t\t\t\t\teveTeamMember->mNameStr, eveTeamMember->mTeamNum, eveTeamMember->mPlayerID, cNetworkHandle(\"\", 0));\n\t\t\t}\n\t\t\twhile (auto resCheckBeginGame = m->ResCheckBeginGame.get())\n\t\t\t{\n\t\t\t\tcMatchingMemberManager::getInstance()->mPlayerID = resCheckBeginGame->mPlayerID;\n\t\t\t\tcSceneManager::getInstance()->shift<Scene::Member::cGameMain>();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t}\n\n\t}\n\n}\nvoid cModeSelect::draw()\n{\n\tmDrawFunc.drawTextureCube(ci::vec3(0), ci::vec3(16, 9, 20), ci::vec3(M_PI\/12.f, 0, mBackGroundRotateZ), \"modeselect\/selectsky.png\", ci::ColorA(1, 1, 1));\n\n\tfor (auto& it : mSelectCards) {\n\t\tit->draw();\n\t}\n\tdrawButton();\n\n\tmDrawFunc.drawTextureRect3D(ci::vec3(-0.85-aroowtranceY\/2.f, -0.7+aroowtranceY,-0.3), ci::vec3(0.8, 0.16,0),ci::vec3(0,0,M_PI- M_PI \/ 12.f) , \"modeselect\/redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n\tmDrawFunc.drawTextureRect3D(ci::vec3(1.55+aroowtranceY\/2.f, -0.7 + aroowtranceY, -0.3), ci::vec3(-0.8, 0.12, 0), ci::vec3(0, 0, M_PI + M_PI \/ 4.25f), \"modeselect\/redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n\t\/\/mDrawFunc.drawTextureRect3D(ci::vec3(-400, -175 + aroowtranceY), ci::vec3(250, 50), M_PI - M_PI \/ 9.f, \"redright.png\", ci::ColorA(1, 1, 1, arrowAlfa));\n}\nvoid cModeSelect::draw2D()\n{\n\t\/*mDrawFunc.drawTextureRect2D(ci::vec2(400,-175+aroowtranceY), ci::vec2(-250, 50), M_PI+M_PI\/9.f, \"redright.png\", ci::ColorA(1, 1, 1,arrowAlfa));\n\tmDrawFunc.drawTextureRect2D(ci::vec2(-400, -175+aroowtranceY), ci::vec2(250, 50), M_PI - M_PI \/ 9.f, \"redright.png\", ci::ColorA(1, 1,1, arrowAlfa));*\/\n\tmDrawFunc.drawTextureRect2D(ci::vec2(550,-320), ci::vec2(-590,449)*0.52f, M_PI, \"title\/logo.png\", ci::ColorA(1, 1, 1, 1));\n\troot->entry_render(mat4());\n}\nvoid cModeSelect::resize()\n{\n\n}\n\nvoid cModeSelect::createTextureNames()\n{\n\ticonnames.push_back(\"modeselect\/online.png\");\n\ticonnames.push_back(\"modeselect\/tutorial.png\");\n\ticonnames.push_back(\"modeselect\/gotitle.png\");\n\ticonnames.push_back(\"modeselect\/training.png\");\n\t\n}\n\nvoid cModeSelect::changeScene()\n{\n\t\n\tswitch (MSelectScene)\n\t{\n\tcase 0:\n\t\tshiftOnlineBattle();\n\t\treturn;\n\tcase 1:\n\t\tshiftTutorial();\n\t\treturn;\n\tcase 2:\n\t\tshiftTitle();\n\t\treturn;\n\tcase 3:\n\t\tshiftLocalBattle();\n\t\treturn;\n\tdefault:\n\t\tbreak;\n\t}\n}\n\nvoid cModeSelect::selectIcon()\n{\n\tif (isfading)return;\n\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_LEFT)||ENV->getPadAxisPushMinus(0)) {\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").setGain(0.4f);\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").play();\n\t\tfor (auto& it : mSelectCards) {\n\t\t\tit->setEasing(true);\n\t\t}\n\t\tMSelectScene++;\n\t\tif (MSelectScene == 4)MSelectScene = 0;\n\t\treturn;\n\t}\n\tif (ENV->pushKey(ci::app::KeyEvent::KEY_RIGHT) || ENV->getPadAxisPushPlus(0)) {\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").setGain(0.4f);\n\t\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/cursor.wav\").play();\n\t\tfor (auto& it : mSelectCards) {\n\t\t\tit->setEasing(false);\n\t\t}\n\t\tMSelectScene--;\n\t\tif (MSelectScene < 0)MSelectScene = 3;\n\t\treturn;\n\t}\n}\n\nvoid cModeSelect::shiftOnlineBattle()\n{\n\t\/\/introloopBGM.stop();\n\tcSceneManager::getInstance()->shift<Scene::Member::cMatching>();\n}\n\nvoid cModeSelect::shiftTitle()\n{\n\t\/\/introloopBGM.stop();\n\tcSceneManager::getInstance()->shift<Scene::Member::cTitle>();\n}\n\nvoid cModeSelect::shiftLocalBattle()\n{\n\t\/\/introloopBGM.stop();\n\tNetwork::cUDPClientManager::getInstance()->open();\n\tNetwork::cUDPServerManager::getInstance()->open();\n\tNetwork::cUDPClientManager::getInstance()->connectOfflineServer();\n\tGame::cGameManager::getInstance()->setTime(0.0F);\n\tcSceneManager::getInstance()->shift<Scene::Member::cGameMain>();\n}\n\nvoid cModeSelect::shiftTutorial()\n{\n\t\/\/introloopBGM.stop();\n\tNetwork::cUDPClientManager::getInstance()->open();\n\tNetwork::cUDPServerManager::getInstance()->open();\n\tNetwork::cUDPClientManager::getInstance()->connectOfflineServer();\n\tGame::cGameManager::getInstance()->setTime(0.0F);\n\tcSceneManager::getInstance()->shift<Scene::Member::cTutorial>();\n}\n\nvoid cModeSelect::desideScene()\n{\n\tif (isfading)return;\n\tfor (auto& it : mSelectCards) {\n\t\tif (it->getIsEasing())return;\/\/C[WO͖\n\t}\n\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/return.wav\").setGain(0.8f);\n\tResource::cSoundManager::getInstance()->findSe(\"ModeSelect\/return.wav\").play();\n\tintroloopBGM.fadeout(0.9f,0.0f);\n\tisfading = true;\n\tauto fader = root->add_child(Node::Renderer::rect::create(app::getWindowSize()));\n\tfader->set_color(ColorA(0, 0, 0, 0));\n\tfader->set_anchor_point(vec2(0, 0));\n\tfader->run_action(sequence::create( fade_in::create(1.0F), call_func::create([this]\n\t{\n\t\tthis->changeScene();\n\t})));\n}\n\nvoid cModeSelect::updateBackGround(float t)\n{\n\tmBackGroundRotateZ += 0.02f*t;\n}\n\nvoid cModeSelect::drawButton()\n{\n\tci::vec3 pos = ci::vec3(-0.5, -0.4, -1.78);\n\tmDrawFunc.drawTextureRect3D(pos, ci::vec3(0.2, 0.2, 0), ci::vec3(0, M_PI, 0), \"modeselect\/buttonb.png\", ci::ColorA(1, 1, 1, 1));\n\tmDrawFunc.drawTextureRect3D(pos+ci::vec3(0,0,-0.01), ci::vec3(0.2, 0.2, 0)*buttonscale, ci::vec3(0, M_PI, 0), \"modeselect\/ring.png\", ci::ColorA(1, 1, 0, buttonalfa));\n\t\n}\n\nvoid cModeSelect::updateButtonAlfa(float t)\n{\n\tfloat speed = 2.18f;\n\tbuttonAlfaT += speed*t;\n\tbool isend = false;\n\tif (buttonAlfaT >= 1.0f) {\n\t\tbuttonAlfaT = 1.0f;\n\t\tisend = true;\n\t}\n\tbuttonalfa = EaseCubicIn(buttonAlfaT, 0.4f, 0.8f);\n\tbuttonscale = EaseCubicIn(buttonAlfaT, 0.8f, 1.2f);\n\tif (isend) {\n\t\tbuttonAlfaT = 0.0f;\n\t}\n\n}\n\nvoid cModeSelect::updateArrow(float t)\n{\n\tfloat speed = 1.09f;\n\tarrowT += speed*t;\n\tbool isend = false;\n\tif (arrowT >= 1.0f) {\n\t\tarrowT = 1.0f;\n\t\tisend = true;\n\t}\n\taroowtranceY = EaseReturn(arrowT, 0, 0.05f);\/\/PT\n\tarrowAlfa = EaseReturn(arrowT, 0.5f, 0.5f);\n\tif (isend) {\n\t\tarrowT = 0.0f;\n\t}\n}\n\nfloat cModeSelect::EaseReturn(const float t, const float s, const float e)\n{\n\treturn s + -4.f*e*(t - 0.5f)*(t - 0.5f) + e;\n}\n\n}\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ http:\/\/doc.qt.io\/qt-5\/qtwebview-minibrowser-example.html\n#include <getopt.h>\n#include <unistd.h>\n#include <iostream>\n\n#include <QtCore\/QString>\n#include \"QtCore\/QSocketNotifier\"\n#include <QGuiApplication>\n#include <QtQuick\/QQuickView>\n#include <QtWebView\/QtWebView>\n#include <QtQml\/QQmlContext>\n#include <QtDebug>\n\n#include \"moc_Interpreter.cpp\"\n#include \"moc_KioskContext.cpp\"\n\n#define VERSION \"0.0.1\"\n\nint version() {\n std::cout << \"kiosk \" << VERSION;\n#if DEBUG\n std::cout << \" -- debug version\";\n#endif\n std::cout << std::endl;\n std::cout << \"Copyright (C) 2017 Jean-Daniel Michaud.\" << std::endl;\n std::cout << \"License MIT: MIT License <https:\/\/opensource.org\/licenses\/MIT>.\" << std::endl;\n std::cout << \"This is free software: you are free to change and redistribute it.\" << std::endl;\n std::cout << \"There is NO WARRANTY, to the extent permitted by law.\" << std::endl;\n std::cout << std::endl;\n std::cout << \"Written by Jean-Daniel Michaud\" << std::endl;\n return 0;\n}\n\nint help() {\n std::cout << \"Usage: ggrep [OPTION]... [URL]\" << std::endl;\n return 0;\n}\n\nint do_version, do_help, url_specified;\nstruct option longopts[] = {\n { \"version\", no_argument, & do_version, 1 },\n { \"help\", no_argument, & do_help, 1 },\n { 0, 0, 0, 0 }\n};\n\nvoid manage_options(int argc, char **argv, QString &url) {\n \/\/ If no url is provided, the value is \"\"\n int c;\n while ((c = getopt_long(argc, argv, \"vh\", longopts, NULL)) != -1) {\n switch (c) {\n case 0: \/* getopt_long() set a variable, just keep going *\/\n break;\n case 'h':\n help();\n exit(0);\n case 'v':\n version();\n exit(0);\n case 1:\n break;\n case ':': \/* missing option argument *\/\n std::cerr << \"option '\" << argv[optind - 1]\n << \"' requires an argument\" << std::endl;\n break;\n case '?': \/* invalid option *\/\n std::cerr << \"option `\" << argv[optind - 1]\n << \"' is invalid: ignored\" << std::endl;\n break;\n default:\n std::cerr << \"error parsing options\" << std::endl;\n break;\n }\n }\n \/\/ Treat non option argument (url)\n url = argv[optind];\n \/\/ Just ignore all subsequent arguments\n}\n\nint main(int argc, char *argv[])\n{\n \/\/ Retrieve parameters\n QString url = \"\";\n manage_options(argc, argv, url);\n if (url == \"\") {\n url = \"about:blank\";\n }\n\n \/\/ Create context\n KioskContext context;\n context.setUrl(url);\n\n \/\/ Create interpreter\n Interpreter interpreter;\n URLCommand urlCommand(context);\n interpreter.register_(\"url\", &urlCommand);\n\n \/\/ Create Application\n QGuiApplication app(argc, argv);\n QtWebView::initialize();\n QGuiApplication::setApplicationDisplayName(\n QCoreApplication::translate(\"main\", \"Kiosk\"));\n\n \/\/ Create View\n QQuickView view;\n view.rootContext()->setContextProperty(\"context\", &context);\n view.setSource(QUrl(\"qrc:\/main.qml\"));\n view.show();\n\n \/\/ Connect to stdin event\n QSocketNotifier sn(STDIN_FILENO, QSocketNotifier::Read);\n sn.setEnabled(true);\n Interpreter::connect(&sn, SIGNAL(activated(int)), &interpreter, SLOT(readCommand()));\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<commit_msg>Do not read from stdin by default.<commit_after>\/\/ http:\/\/doc.qt.io\/qt-5\/qtwebview-minibrowser-example.html\n#include <unistd.h>\n#include <fcntl.h>\n\n#include <getopt.h>\n#include <unistd.h>\n#include <iostream>\n\n#include <QtCore\/QString>\n#include \"QtCore\/QSocketNotifier\"\n#include <QGuiApplication>\n#include <QtQuick\/QQuickView>\n#include <QtWebView\/QtWebView>\n#include <QtQml\/QQmlContext>\n#include <QtDebug>\n\n#include \"moc_Interpreter.cpp\"\n#include \"moc_KioskContext.cpp\"\n\n#define VERSION \"0.0.1\"\n\nint version() {\n std::cout << \"kiosk \" << VERSION;\n#if DEBUG\n std::cout << \" -- debug version\";\n#endif\n std::cout << std::endl;\n std::cout << \"Copyright (C) 2017 Jean-Daniel Michaud.\" << std::endl;\n std::cout << \"License MIT: MIT License <https:\/\/opensource.org\/licenses\/MIT>.\" << std::endl;\n std::cout << \"This is free software: you are free to change and redistribute it.\" << std::endl;\n std::cout << \"There is NO WARRANTY, to the extent permitted by law.\" << std::endl;\n std::cout << std::endl;\n std::cout << \"Written by Jean-Daniel Michaud\" << std::endl;\n return 0;\n}\n\nint help() {\n std::cout << \"Usage: kiosk [OPTION]... [URL]\" << std::endl;\n std::cout << \" -v return the version\" << std::endl;\n std::cout << \" -h display this help\" << std::endl;\n std::cout << \" -c read commands from the standard input\" << std::endl;\n return 0;\n}\n\nint do_version, do_help, read_stdin;\nstruct option longopts[] = {\n { \"version\", no_argument, & do_version, 1 },\n { \"help\", no_argument, & do_help, 1 },\n { \"cli\", no_argument, & read_stdin, 0 },\n { 0, 0, 0, 0 }\n};\n\nvoid manage_options(int argc, char **argv, QString &url) {\n \/\/ If no url is provided, the value is \"\"\n int c;\n while ((c = getopt_long(argc, argv, \"vhc\", longopts, NULL)) != -1) {\n switch (c) {\n case 0: \/* getopt_long() set a variable, just keep going *\/\n break;\n case 'h':\n help();\n exit(0);\n case 'v':\n version();\n exit(0);\n case 'c':\n read_stdin = 1;\n std::cout << \"read_stdin:\" << read_stdin << std::endl;\n break;\n case 1:\n break;\n case ':': \/* missing option argument *\/\n std::cerr << \"option '\" << argv[optind - 1]\n << \"' requires an argument\" << std::endl;\n break;\n case '?': \/* invalid option *\/\n std::cerr << \"option `\" << argv[optind - 1]\n << \"' is invalid: ignored\" << std::endl;\n break;\n default:\n std::cerr << \"error parsing options\" << std::endl;\n break;\n }\n }\n \/\/ Treat non option argument (url)\n url = argv[optind];\n \/\/ Just ignore all subsequent arguments\n}\n\nint main(int argc, char *argv[])\n{\n \/\/ Retrieve parameters\n QString url = \"\";\n manage_options(argc, argv, url);\n if (url == \"\") {\n url = \"about:blank\";\n }\n\n \/\/ Create context\n KioskContext context;\n context.setUrl(url);\n\n \/\/ Create interpreter\n Interpreter interpreter;\n URLCommand urlCommand(context);\n interpreter.register_(\"url\", &urlCommand);\n\n \/\/ Create Application\n QGuiApplication app(argc, argv);\n QtWebView::initialize();\n QGuiApplication::setApplicationDisplayName(\n QCoreApplication::translate(\"main\", \"Kiosk\"));\n\n \/\/ Create View\n QQuickView view;\n view.rootContext()->setContextProperty(\"context\", &context);\n view.setSource(QUrl(\"qrc:\/main.qml\"));\n view.show();\n\n \/\/ If stdin is open, connect to stdin event\n QSocketNotifier sn(STDIN_FILENO, QSocketNotifier::Read);\n if (read_stdin) {\n std::cout << \"reading standard input\" << std::endl;\n sn.setEnabled(true);\n Interpreter::connect(&sn, SIGNAL(activated(int)), &interpreter, SLOT(readCommand()));\n }\n\n return app.exec();\n}\n\n#include \"main.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/\/ -----------------------------------------------------------------------------\n\/\/ Copyright : (C) 2014 Andre Schollmeyer and Andreas-C. Bernstein\n\/\/ License : MIT (see the file LICENSE)\n\/\/ Maintainer : Andreas-C. Bernstein <andreas.bernstein@uni-weimar.de>\n\/\/ Stability : experimental\n\/\/\n\/\/ PpmWriter\n\/\/ -----------------------------------------------------------------------------\n\n#ifndef BUW_PPMWRITER_HPP\n#define BUW_PPMWRITER_HPP\n\n\/\/ header, system\n#include <string>\n#include <vector>\n\n\/\/ header, project\n#include <pixel.hpp>\n\nclass PpmWriter\n{\npublic:\n\tPpmWriter();\n\tPpmWriter(std::size_t w, std::size_t h, std::string const& file);\n\tPpmWriter(std::size_t w, std::size_t h);\n\npublic:\n\tvoid write(Pixel const& p);\n\tvoid save(std::string const& file);\n\tvoid save();\n\tvoid setResolution(std::tuple<int,int> const& resolution);\n\tvoid setFilename(std::string const& file);\n\nprivate:\n\tstd::string file_;\n\tstd::vector<unsigned int> data_;\n\tsize_t width_;\n\tsize_t height_;\n};\n\n#endif \/\/ BUW_PPMWRITER\n<commit_msg>removed unnessecary public declaration<commit_after>\/\/ -----------------------------------------------------------------------------\n\/\/ Copyright : (C) 2014 Andre Schollmeyer and Andreas-C. Bernstein\n\/\/ License : MIT (see the file LICENSE)\n\/\/ Maintainer : Andreas-C. Bernstein <andreas.bernstein@uni-weimar.de>\n\/\/ Stability : experimental\n\/\/\n\/\/ PpmWriter\n\/\/ -----------------------------------------------------------------------------\n\n#ifndef BUW_PPMWRITER_HPP\n#define BUW_PPMWRITER_HPP\n\n\/\/ header, system\n#include <string>\n#include <vector>\n\n\/\/ header, project\n#include <pixel.hpp>\n\nclass PpmWriter\n{\npublic:\n\tPpmWriter();\n\tPpmWriter(std::size_t w, std::size_t h, std::string const& file);\n\tPpmWriter(std::size_t w, std::size_t h);\n\n\tvoid write(Pixel const& p);\n\tvoid save(std::string const& file);\n\tvoid save();\n\tvoid setResolution(std::tuple<int,int> const& resolution);\n\tvoid setFilename(std::string const& file);\n\nprivate:\n\tstd::string file_;\n\tstd::vector<unsigned int> data_;\n\tsize_t width_;\n\tsize_t height_;\n};\n\n#endif \/\/ BUW_PPMWRITER\n<|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n#include \"main.h\"\n\nbool led0=false;\n\n\/\/ Update these with values suitable for your network.\nconst char* ssid = \"Musquetteer_AP\";\nconst char* password = \"RaspberryPi\";\nconst char* mqtt_server = \"192.168.42.1\";\nconst String host = String(\"ESPutnik-\") + String(ESP.getChipId(), HEX);\n\n\/\/WiFiEventHandler gotIpEventHandler, disconnectedEventHandler;\nAsyncMqttClient mqttClient;\n\nvoid setup() {\n Serial.begin(115200);\n delay(100);\n \/\/ Set hostname.\n WiFi.hostname(host);\n Serial.println(\"\\n\\n\\rHostname: \" + host);\n\n \/\/ Configure IO pins\n setup_io();\n\n \/\/ Set up MQTT server connection\n setup_mqtt();\n\n \/\/ Set up OTA updates\n setup_OTA();\n\n \/\/ Connect to WiFi network\n setup_wifi();\n\n \/\/ Set up mDNS responder:\n \/\/ - first argument is the domain name, in this example\n \/\/ the fully-qualified domain name is \"esp8266.local\"\n \/\/ - second argument is the IP address to advertise\n \/\/ we send our IP address on the WiFi network\n if (!MDNS.begin(host.c_str())) {\n Serial.println(\"Error setting up MDNS responder!\");\n } else {\n Serial.println(\"mDNS responder started\");\n }\n}\n\nvoid loop() {\n ArduinoOTA.handle();\n yield();\n if (!digitalRead(D5)) {\n while (!digitalRead(D5));\n led0=!led0;\n if (led0) {\n mqttClient.publish(\"test\/led0\", 0, false, \"on\");\n } else {\n mqttClient.publish(\"test\/led0\", 0, false, \"off\");\n }\n }\n if (!digitalRead(D6)) {\n while (!digitalRead(D6));\n mqttClient.publish(\"test\/led0\", 0, false, \"off\");\n mqttClient.publish(\"test\/led1\", 0, false, \"off\");\n mqttClient.publish(\"test\/led2\", 0, false, \"off\");\n mqttClient.publish(\"test\/led3\", 0, false, \"off\");\n }\n}\n\nvoid setup_io(){\n pinMode(D0, OUTPUT);\n pinMode(D1, OUTPUT);\n pinMode(D2, OUTPUT);\n pinMode(D3, OUTPUT);\n pinMode(D5, INPUT);\n pinMode(D6, INPUT);\n delay(50);\n}\n\nvoid setup_wifi() {\n \/\/ Configure WiFi modes\n WiFi.persistent(false);\n WiFi.setAutoConnect(true);\n WiFi.setAutoReconnect(true);\n WiFi.mode(WIFI_STA);\n\/\/ WiFi.onEvent(onSTAConnected, WIFI_EVENT_STAMODE_GOT_IP);\n\/\/ WiFi.onEvent(onSTADisconnected, WIFI_EVENT_STAMODE_DISCONNECTED);\n\/\/ WiFi.onEvent(onAPConnected, WIFI_EVENT_SOFTAPMODE_STACONNECTED);\n\/\/ WiFi.onEvent(onAPDisconnected, WIFI_EVENT_SOFTAPMODE_STADISCONNECTED);\n delay(50);\n\n WiFiMode_t radio = WiFi.getMode();\n if ((radio == WIFI_AP) || (radio == WIFI_AP_STA )) {\n \/\/ Start generating own WiFi network\n Serial.println();\n Serial.println(\"Starting WiFi hotspot\");\n\n if(WiFi.softAP(host.c_str())){\n Serial.printf(\"Hotspot deployed [%s]\\n\\r\", host.c_str());\n Serial.printf(\"MAC -> %s\\n\\r\",WiFi.softAPmacAddress().c_str());\n Serial.print(\"IP -> \");\n Serial.println(WiFi.softAPIP());\n }\n }\n\n if ((radio == WIFI_STA) || (radio == WIFI_AP_STA )) {\n \/\/ Start connecting to a WiFi network\n Serial.printf(\"Connecting to WiFi [%s]\\n\\r\", ssid);\n WiFi.begin(ssid, password);\n }\n\n switch (WiFi.waitForConnectResult()) {\n \/\/ case WL_CONNECTED:\n \/\/ Serial.println(\"Connection established\");\n \/\/ break;\n case WL_IDLE_STATUS:\n Serial.println(\"Wi-Fi is in process of changing between statuses\");\n break;\n case WL_NO_SSID_AVAIL:\n Serial.println(\"SSID cannot be reached\");\n break;\n case WL_CONNECT_FAILED:\n Serial.println(\"Incorrect password\");\n break;\n case WL_CONNECTION_LOST:\n Serial.println(\"Connection lost\");\n break;\n case WL_DISCONNECTED:\n Serial.println(\"Module is not configured in station mode\");\n break;\n }\n}\n\nvoid setup_OTA() {\n ArduinoOTA.onStart(onOTAStart);\n ArduinoOTA.onEnd(onOTAEnd);\n ArduinoOTA.onProgress(onOTAProgress);\n ArduinoOTA.onError(onOTAError);\n MDNS.addService(\"OTA\", \"udp\", 54039);\n}\n\nvoid setup_mqtt() {\n mqttClient.onConnect(onMqttConnect);\n mqttClient.onDisconnect(onMqttDisconnect);\n mqttClient.onSubscribe(onMqttSubscribe);\n mqttClient.onUnsubscribe(onMqttUnsubscribe);\n mqttClient.onMessage(onMqttMessage);\n mqttClient.onPublish(onMqttPublish);\n mqttClient.setServer(mqtt_server, 1883);\n mqttClient.setKeepAlive(15).setWill(WILL_TOPIC, WILL_QOS, WILL_RETAIN, WILL_MSG).setClientId(host.c_str());\n}\n\nWiFiEventHandler connectedEventHandler = WiFi.onStationModeGotIP([](const WiFiEventStationModeGotIP& event) {\n Serial.println(\"WiFi connected\");\n Serial.print(\"IP address: \");\n Serial.println(WiFi.localIP());\n Serial.println(\"Starting OTA service...\");\n ArduinoOTA.begin();\n Serial.println(\"Connecting to MQTT...\");\n mqttClient.connect();\n});\n\nWiFiEventHandler disconnectedEventHandler = WiFi.onStationModeDisconnected([](const WiFiEventStationModeDisconnected& event) {\n Serial.println(\"Lost WiFi connection\");\n});\n\nvoid onMqttConnect() {\n Serial.println(\"** Connected to the broker **\");\n \/\/ Once connected, publish status...\n uint16_t packetIdPub2 = mqttClient.publish(WILL_TOPIC, WILL_QOS, WILL_RETAIN, \"ESPutnik online\");\n Serial.print(\"Publishing status at QoS 2, packetId: \");\n Serial.println(packetIdPub2);\n\n \/\/ ... and resubscribe to topics\n mqttClient.subscribe(\"test\/led0\",0);\n mqttClient.subscribe(\"test\/led1\",0);\n mqttClient.subscribe(\"test\/led2\",0);\n mqttClient.subscribe(\"test\/led3\",0);\n mqttClient.subscribe(\"test\/reset\",0);\n}\n\nvoid onMqttDisconnect(AsyncMqttClientDisconnectReason reason) {\n Serial.println(\"** Disconnected from the broker **\");\n Serial.print(\" Error code: \");\n Serial.println((int8_t)reason);\n if (WiFi.waitForConnectResult() == WL_CONNECTED){\n Serial.println(\"Reconnecting to MQTT...\");\n mqttClient.connect();\n }\n}\n\nvoid onMqttSubscribe(uint16_t packetId, uint8_t qos) {\n Serial.println(\"** Subscribe acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n Serial.print(\" qos: \");\n Serial.println(qos);\n}\n\nvoid onMqttUnsubscribe(uint16_t packetId) {\n Serial.println(\"** Unsubscribe acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n}\n\nvoid onMqttMessage(char* topic, char* payload, AsyncMqttClientMessageProperties properties, size_t length, size_t index, size_t total) {\n Serial.println(\"** Publish received **\");\n Serial.print(\" topic: \");\n Serial.println(topic);\n Serial.print(\" payload: \");\n for (int i = 0; i < length; i++) Serial.print(payload[i]);\n\n Serial.println();\n Serial.println(payload);\n\n if (!strcmp(topic,\"test\/reset\")){\n if ((char)payload[0] == '1') {\n mqttClient.publish(\"test\/text\", 0, false, \"Reseting ESPutnik\");\n mqttClient.publish(\"test\/reset\", 0, false, \"0\");\n ESP.reset();\n }\n }else if (!strcmp(topic,\"test\/led0\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D0, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led0 ON\");\n led0=true;\n } else {\n digitalWrite(D0, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led0 OFF\");\n led0=false;\n }\n }else if (!strcmp(topic,\"test\/led1\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D1, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led1 ON\");\n } else {\n digitalWrite(D1, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led1 OFF\");\n }\n }else if (!strcmp(topic,\"test\/led2\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D2, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led2 ON\");\n } else {\n digitalWrite(D2, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led2 OFF\");\n }\n }else if (!strcmp(topic,\"test\/led3\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D3, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led3 ON\");\n } else {\n digitalWrite(D3, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led3 OFF\");\n }\n }\n}\n\nvoid onMqttPublish(uint16_t packetId) {\n Serial.println(\"** Publish acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n}\n\nvoid onOTAStart() {\n \/\/ String type;\n \/\/ if (ArduinoOTA.getCommand() == U_FLASH)\n \/\/ type = \"sketch\";\n \/\/ else \/\/ U_SPIFFS\n \/\/ type = \"filesystem\";\n \/\/\n \/\/ \/\/ NOTE: if updating SPIFFS this would be the place to unmount SPIFFS using SPIFFS.end()\n Serial.println(\"Start updating\");\n}\n\nvoid onOTAEnd() {\n Serial.println(\"\\nEnd\");\n}\n\nvoid onOTAProgress(unsigned int progress, unsigned int total) {\n Serial.printf(\"Progress: %u%%\\r\", (progress \/ (total \/ 100)));\n}\n\nvoid onOTAError(ota_error_t error) {\n Serial.printf(\"Error[%u]: \", error);\n if (error == OTA_AUTH_ERROR) Serial.println(\"Auth Failed\");\n else if (error == OTA_BEGIN_ERROR) Serial.println(\"Begin Failed\");\n else if (error == OTA_CONNECT_ERROR) Serial.println(\"Connect Failed\");\n else if (error == OTA_RECEIVE_ERROR) Serial.println(\"Receive Failed\");\n else if (error == OTA_END_ERROR) Serial.println(\"End Failed\");\n}\n<commit_msg>Enhanced MQTT error handling<commit_after>#include <Arduino.h>\n#include \"main.h\"\n\nbool led0=false;\n\n\/\/ Update these with values suitable for your network.\nconst char* ssid = \"Musquetteer_AP\";\nconst char* password = \"RaspberryPi\";\nconst char* mqtt_server = \"192.168.42.1\";\nconst String host = String(\"ESPutnik-\") + String(ESP.getChipId(), HEX);\n\n\/\/WiFiEventHandler gotIpEventHandler, disconnectedEventHandler;\nAsyncMqttClient mqttClient;\n\nvoid setup() {\n Serial.begin(115200);\n delay(100);\n \/\/ Set hostname.\n WiFi.hostname(host);\n Serial.println(\"\\n\\n\\rHostname: \" + host);\n\n \/\/ Configure IO pins\n setup_io();\n\n \/\/ Set up MQTT server connection\n setup_mqtt();\n\n \/\/ Set up OTA updates\n setup_OTA();\n\n \/\/ Connect to WiFi network\n setup_wifi();\n\n \/\/ Set up mDNS responder:\n \/\/ - first argument is the domain name, in this example\n \/\/ the fully-qualified domain name is \"esp8266.local\"\n \/\/ - second argument is the IP address to advertise\n \/\/ we send our IP address on the WiFi network\n if (!MDNS.begin(host.c_str())) {\n Serial.println(\"Error setting up mDNS responder!\");\n } else {\n Serial.println(\"mDNS responder started\");\n }\n}\n\nvoid loop() {\n ArduinoOTA.handle();\n yield();\n if (!digitalRead(D5)) {\n while (!digitalRead(D5));\n led0=!led0;\n if (led0) {\n mqttClient.publish(\"test\/led0\", 0, false, \"on\");\n } else {\n mqttClient.publish(\"test\/led0\", 0, false, \"off\");\n }\n }\n if (!digitalRead(D6)) {\n while (!digitalRead(D6));\n mqttClient.publish(\"test\/led0\", 0, false, \"off\");\n mqttClient.publish(\"test\/led1\", 0, false, \"off\");\n mqttClient.publish(\"test\/led2\", 0, false, \"off\");\n mqttClient.publish(\"test\/led3\", 0, false, \"off\");\n }\n}\n\nvoid setup_io(){\n pinMode(D0, OUTPUT);\n pinMode(D1, OUTPUT);\n pinMode(D2, OUTPUT);\n pinMode(D3, OUTPUT);\n pinMode(D5, INPUT);\n pinMode(D6, INPUT);\n delay(50);\n}\n\nvoid setup_wifi() {\n \/\/ Configure WiFi modes\n WiFi.persistent(false);\n WiFi.setAutoConnect(true);\n WiFi.setAutoReconnect(true);\n WiFi.mode(WIFI_STA);\n delay(50);\n\n WiFiMode_t radio = WiFi.getMode();\n if ((radio == WIFI_AP) || (radio == WIFI_AP_STA )) {\n \/\/ Start generating own WiFi network\n Serial.println();\n Serial.println(\"Starting WiFi hotspot\");\n\n if(WiFi.softAP(host.c_str())){\n Serial.printf(\"Hotspot deployed [%s]\\n\\r\", host.c_str());\n Serial.printf(\"MAC -> %s\\n\\r\",WiFi.softAPmacAddress().c_str());\n Serial.print(\"IP -> \");\n Serial.println(WiFi.softAPIP());\n }\n }\n\n if ((radio == WIFI_STA) || (radio == WIFI_AP_STA )) {\n \/\/ Start connecting to a WiFi network\n Serial.printf(\"Connecting to WiFi [%s]\\n\\r\", ssid);\n WiFi.begin(ssid, password);\n }\n\n switch (WiFi.waitForConnectResult()) {\n \/\/ case WL_CONNECTED:\n \/\/ Serial.println(\"Connection established\");\n \/\/ break;\n case WL_IDLE_STATUS:\n Serial.println(\"Wi-Fi is in process of changing between statuses\");\n break;\n case WL_NO_SSID_AVAIL:\n Serial.println(\"SSID cannot be reached\");\n break;\n case WL_CONNECT_FAILED:\n Serial.println(\"Incorrect password\");\n break;\n case WL_CONNECTION_LOST:\n Serial.println(\"Connection lost\");\n break;\n case WL_DISCONNECTED:\n Serial.println(\"Module is not configured in station mode\");\n break;\n }\n}\n\nvoid setup_OTA() {\n ArduinoOTA.onStart(onOTAStart);\n ArduinoOTA.onEnd(onOTAEnd);\n ArduinoOTA.onProgress(onOTAProgress);\n ArduinoOTA.onError(onOTAError);\n MDNS.addService(\"OTA\", \"udp\", 54039);\n}\n\nvoid setup_mqtt() {\n mqttClient.onConnect(onMqttConnect);\n mqttClient.onDisconnect(onMqttDisconnect);\n mqttClient.onSubscribe(onMqttSubscribe);\n mqttClient.onUnsubscribe(onMqttUnsubscribe);\n mqttClient.onMessage(onMqttMessage);\n mqttClient.onPublish(onMqttPublish);\n mqttClient.setServer(mqtt_server, 1883);\n mqttClient.setKeepAlive(15).setWill(WILL_TOPIC, WILL_QOS, WILL_RETAIN, WILL_MSG).setClientId(host.c_str());\n}\n\nWiFiEventHandler connectedEventHandler = WiFi.onStationModeGotIP([](const WiFiEventStationModeGotIP& event) {\n Serial.println(\"WiFi connected\");\n Serial.print(\"IP address: \");\n Serial.println(WiFi.localIP());\n Serial.println(\"Starting OTA service...\");\n ArduinoOTA.begin();\n Serial.println(\"Connecting to MQTT...\");\n mqttClient.connect();\n});\n\nWiFiEventHandler disconnectedEventHandler = WiFi.onStationModeDisconnected([](const WiFiEventStationModeDisconnected& event) {\n Serial.println(\"Lost WiFi connection\");\n});\n\nvoid onMqttConnect() {\n Serial.println(\"** Connected to the broker **\");\n \/\/ Once connected, publish status...\n uint16_t packetIdPub2 = mqttClient.publish(WILL_TOPIC, WILL_QOS, WILL_RETAIN, \"ESPutnik online\");\n Serial.print(\"Publishing status at QoS 2, packetId: \");\n Serial.println(packetIdPub2);\n\n \/\/ ... and resubscribe to topics\n mqttClient.subscribe(\"test\/led0\",0);\n mqttClient.subscribe(\"test\/led1\",0);\n mqttClient.subscribe(\"test\/led2\",0);\n mqttClient.subscribe(\"test\/led3\",0);\n mqttClient.subscribe(\"test\/reset\",0);\n}\n\nvoid onMqttDisconnect(AsyncMqttClientDisconnectReason reason) {\n Serial.println(\"** Disconnected from the broker **\");\n Serial.print(\" Error code: \");\n switch ((int8_t)reason) {\n case 0:\n Serial.println(\"TCP disconnected\");\n break;\n case 1:\n Serial.println(\"Connection Refused, unacceptable protocol version\");\n break;\n case 2:\n Serial.println(\"Connection Refused, identifier rejected\");\n break;\n case 3:\n Serial.println(\"Connection Refused, Server unavailable\");\n break;\n case 4:\n Serial.println(\"Connection Refused, bad user name or password\");\n break;\n case 5:\n Serial.println(\"Connection Refused, not authorized\");\n break;\n }\n}\n\nvoid onMqttSubscribe(uint16_t packetId, uint8_t qos) {\n Serial.println(\"** Subscribe acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n Serial.print(\" qos: \");\n Serial.println(qos);\n}\n\nvoid onMqttUnsubscribe(uint16_t packetId) {\n Serial.println(\"** Unsubscribe acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n}\n\nvoid onMqttMessage(char* topic, char* payload, AsyncMqttClientMessageProperties properties, size_t length, size_t index, size_t total) {\n Serial.println(\"** Publish received **\");\n Serial.print(\" topic: \");\n Serial.println(topic);\n Serial.print(\" payload: \");\n for (int i = 0; i < length; i++) Serial.print(payload[i]);\n\n if (!strcmp(topic,\"test\/reset\")){\n if (!strcmp(payload,\"on\")) {\n mqttClient.publish(\"test\/text\", 0, false, \"Reseting ESPutnik\");\n mqttClient.publish(\"test\/reset\", 0, false, \"off\");\n ESP.reset();\n }\n }else if (!strcmp(topic,\"test\/led0\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D0, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led0 ON\");\n led0=true;\n } else {\n digitalWrite(D0, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led0 OFF\");\n led0=false;\n }\n }else if (!strcmp(topic,\"test\/led1\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D1, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led1 ON\");\n } else {\n digitalWrite(D1, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led1 OFF\");\n }\n }else if (!strcmp(topic,\"test\/led2\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D2, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led2 ON\");\n } else {\n digitalWrite(D2, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led2 OFF\");\n }\n }else if (!strcmp(topic,\"test\/led3\")){\n if (!strcmp(payload,\"on\")) {\n digitalWrite(D3, HIGH);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led3 ON\");\n } else {\n digitalWrite(D3, LOW);\n mqttClient.publish(\"test\/text\", 0, false, \"Turning led3 OFF\");\n }\n }\n}\n\nvoid onMqttPublish(uint16_t packetId) {\n Serial.println(\"** Publish acknowledged **\");\n Serial.print(\" packetId: \");\n Serial.println(packetId);\n}\n\nvoid onOTAStart() {\n \/\/ String type;\n \/\/ if (ArduinoOTA.getCommand() == U_FLASH)\n \/\/ type = \"sketch\";\n \/\/ else \/\/ U_SPIFFS\n \/\/ type = \"filesystem\";\n \/\/\n \/\/ \/\/ NOTE: if updating SPIFFS this would be the place to unmount SPIFFS using SPIFFS.end()\n Serial.println(\"Start updating\");\n}\n\nvoid onOTAEnd() {\n Serial.println(\"\\nEnd\");\n}\n\nvoid onOTAProgress(unsigned int progress, unsigned int total) {\n Serial.printf(\"Progress: %u%%\\r\", (progress \/ (total \/ 100)));\n}\n\nvoid onOTAError(ota_error_t error) {\n Serial.printf(\"Error[%u]: \", error);\n if (error == OTA_AUTH_ERROR) Serial.println(\"Auth Failed\");\n else if (error == OTA_BEGIN_ERROR) Serial.println(\"Begin Failed\");\n else if (error == OTA_CONNECT_ERROR) Serial.println(\"Connect Failed\");\n else if (error == OTA_RECEIVE_ERROR) Serial.println(\"Receive Failed\");\n else if (error == OTA_END_ERROR) Serial.println(\"End Failed\");\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"MultipleExpressions.h\"\n\nMultipleExpressions::MultipleExpressions(string s){\n this->type = \"multiple\";\n this->expressions = s;\n this->exp = s;\n this->vectorExpressions = this->parseBySpaces(s);\n if (this->vectorExpressions.size() > 1) {\n if (this->vectorExpressions.at(1) == \"+\" || this->vectorExpressions.at(1) == \"-\") {\n this->meType = \"as\";\n }else if(this->vectorExpressions.at(1) == \"*\" || this->vectorExpressions.at(1) == \"\/\"){\n this->meType = \"md\";\n }else{\n throw runtime_error(\"Error: Multiple Expression does not have a type\");\n }\n }\n}\nMultipleExpressions::~MultipleExpressions(){\n delete this;\n}\nstring MultipleExpressions:: getExpressions()\n{\n\tstring s = this->toString();\n\treturn s;\n}\nExpression* MultipleExpressions::add(Expression* a)\n{\n Solver *s = new Solver();\n size_t aSize = this->vectorExpressions.size();\n bool changed = false;\n Expression *result;\n \n if (a->type == \"multiple\") {\n MultipleExpressions *b = (MultipleExpressions *)a;\n if (b->vectorExpressions.size() == 3 && this->vectorExpressions.size() == 3\n && b->vectorExpressions.at(1) == \"*\" && this->vectorExpressions.at(1) == \"*\") {\n \n Expression *eB0 = s->bindToExpressionType(b->vectorExpressions.at(0));\n Expression *eThis0 = s->bindToExpressionType(this->vectorExpressions.at(0));\n Expression *eB1 = s->bindToExpressionType(b->vectorExpressions.at(2));\n Expression *eThis1 = s->bindToExpressionType(this->vectorExpressions.at(2));\n if (eB0->type == eThis0->type || eB0->canAdd(eThis0)) {\n if (eB0->toString() == eThis0->toString()) {\n s = new Solver(eB0->toString() + \" * \" + eB1->add(eThis1)->toString());\n result = s->bindToExpressionType(s->solve(false));\n vectorExpressions = this->parseBySpaces(result->toString());\n return this;\n }else{\n s = new Solver(eB1->toString() + \" * \" + eB0->add(eThis0)->toString());\n result = s->bindToExpressionType(s->solve(false));\n vectorExpressions = this->parseBySpaces(result->toString());\n return this;\n\n }\n }\n }\n }\n \n \n \n for (int i = 0; i < aSize; i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if ((i == aSize-1 && vectorExpressions.at(i-1) != \"*\" && vectorExpressions.at(i-1) != \"\/\")) {\n changed = true;\n if (vectorExpressions.at(i-1) == \"-\") {\n result = a->subtract(operand1);\n vectorExpressions.at(i-1) = \"+\";\n }else{\n result = operand1->add(a);\n }\n vectorExpressions.at(i) = result->toString();\n }\n else if (operand1->canAdd(a) && vectorExpressions.at(i) != \"*\" && vectorExpressions.at(i) != \"\/\") {\n changed = true;\n Expression *result = operand1->add(a);\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"+\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::subtract(Expression* a)\n{\n Solver *s = new Solver();\n size_t aSize = this->vectorExpressions.size();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if ((i == aSize-1 && vectorExpressions.at(i-1) != \"*\" && vectorExpressions.at(i-1) != \"\/\")) {\n changed = true;\n Expression *result = operand1->subtract(a);\n vectorExpressions.at(i) = result->toString();\n }\n else if (operand1->canSubtract(a) && vectorExpressions.at(i) != \"*\" && vectorExpressions.at(i) != \"\/\") {\n changed = true;\n Expression *result = operand1->subtract(a);\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"-\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::multiply(Expression* a)\n{\n Solver *s = new Solver();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if (operand1->canMultiply(a)) {\n changed = true;\n Expression *result = operand1->multiply(a);\n if (result->type == \"integer\") {\n Integer *t = (Integer *)result;\n if (t->getValue() == 1) {\n vectorExpressions.at(i) = result->toString();\n vectorExpressions.erase(vectorExpressions.begin() + i-1,vectorExpressions.begin() + i+1);\n }\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"*\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::divide(Expression* a)\n{\n Solver *s = new Solver();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if (operand1->canDivide(a)) {\n if (i >1 && vectorExpressions.at(i-1) == \"\/\") {\n Rational *t = new Rational(new Integer(1),a);\n this->multiply(t);\n }\n changed = true;\n Expression *result = operand1->divide(a);\n if (result->type == \"integer\") {\n Integer *t = (Integer *)result;\n if (t->getValue() == 1) {\n vectorExpressions.at(i) = result->toString();\n vectorExpressions.erase(vectorExpressions.begin() + i-1,vectorExpressions.begin() + i+1);\n }\n }else if(result->type == \"rational\"){\n Rational *t = (Rational *)result;\n vectorExpressions.at(i) = t->geteNumerator()->toString();\n Expression *n;\n size_t j = (size_t)i+2;\n if(vectorExpressions.size() >= j){\n s->bindToExpressionType(vectorExpressions.at(i+2));\n }else{\n s->bindToExpressionType(vectorExpressions.at(i-2));\n }\n if (t->geteDenominator()->canMultiply(n)) {\n vectorExpressions.at(i+2) = t->geteDenominator()->multiply(n)->toString();\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"\/\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\nvector<string> MultipleExpressions::parseBySpaces(string expression){\n int count = 0;\n string temp = \"\";\n vector<string> expressions = *new vector<string>();\n for(int i = 0; i < expression.size(); i ++){ \/\/creates an array of expressions and operations\n if (expression.at(i) == 'l' && expression.at(i+1) == 'o' && expression.at(i+2) == 'g') {\n temp = \"\";\n for (int j = i; j < expression.size(); j++) {\n temp.push_back(expression.at(j));\n if (expression.at(j) == ')') {\n i = j+1;\n expressions.push_back(temp);\n count = j + 2;\n break;\n }\n }\n }\n else if(expression.at(i) == ' '){\n temp = \"\";\n for (int j = count; j < i; j++) {\n temp.push_back(expression.at(j));\n }\n expressions.push_back(temp);\n count = i+1;\n \n }else if(i == expression.size()-1){\n temp = \"\";\n for (int j = count; j <= i; j++) {\n temp.push_back(expression.at(j));\n }\n expressions.push_back(temp);\n count = i+1;\n }\n }\n return expressions;\n}\nvector<string> MultipleExpressions::getVectorExpressions(){\n return this->vectorExpressions;\n}\n\nstring MultipleExpressions:: toString(){\n this->expressions = \"\";\n for (int i = 0; i < vectorExpressions.size(); i++) {\n this->expressions += vectorExpressions.at(i);\n if (i != vectorExpressions.size()-1) {\n this->expressions += \" \";\n }\n }\n stringstream s;\n\ts<<this->expressions;\n\treturn s.str();\n}\n\nostream& MultipleExpressions::print(std::ostream& output) const{\n MultipleExpressions *a = (MultipleExpressions *)this;\n output << a->toString();\n return output;\n}\n\nbool MultipleExpressions::canAdd(Expression* b){ \/\/use \"this\" as comparison. Solver will call someExpression.canAdd(&someOtherExpression)\n \n if (this->type == b->type && this->type != \"logarithm\") {\n if (this->type == \"nthRoot\") {\n }\n return true;\n }else if((this->type == \"integer\" && b->type == \"rational\") || (this->type == \"rational\" && b->type == \"integer\")){\n return true;\n }else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }\n else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\nbool MultipleExpressions::canSubtract(Expression* b){\n if (this->type == b->type) {\n return true;\n }else if((this->type == \"integer\" && b->type == \"rational\") || (this->type == \"rational\" && b->type == \"integer\")){\n return true;\n }else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\nbool MultipleExpressions::canMultiply(Expression* b){\n if (this->type == b->type) {\n return true;\n }\n else if(this->type == \"integer\" && b->type == \"rational\") return true;\n else if(this->type == \"rational\" && b->type == \"integer\") return true;\n else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n \n}\nbool MultipleExpressions::canDivide(Expression* b){\n if (this->type == b->type) {\n return true;\n }\n else if(this->type == \"integer\"){\n if( b->type == \"rational\") return true;\n }\n else if(this->type == \"rational\" && b->type == \"integer\") return true;\n else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\n\n<commit_msg>changes<commit_after>#include \"MultipleExpressions.h\"\n\nMultipleExpressions::MultipleExpressions(string s){\n this->type = \"multiple\";\n this->expressions = s;\n this->exp = s;\n this->vectorExpressions = this->parseBySpaces(s);\n if (this->vectorExpressions.size() > 1) {\n if (this->vectorExpressions.at(1) == \"+\" || this->vectorExpressions.at(1) == \"-\") {\n this->meType = \"as\";\n }else if(this->vectorExpressions.at(1) == \"*\" || this->vectorExpressions.at(1) == \"\/\"){\n this->meType = \"md\";\n }else{\n throw runtime_error(\"Error: Multiple Expression does not have a type\");\n }\n }\n}\nMultipleExpressions::~MultipleExpressions(){\n delete this;\n}\nstring MultipleExpressions:: getExpressions()\n{\n\tstring s = this->toString();\n\treturn s;\n}\nExpression* MultipleExpressions::add(Expression* a)\n{\n Solver *s = new Solver();\n size_t aSize = this->vectorExpressions.size();\n bool changed = false;\n Expression *result;\n \n if (a->type == \"multiple\") {\n MultipleExpressions *b = (MultipleExpressions *)a;\n if (b->vectorExpressions.size() == 3 && this->vectorExpressions.size() == 3\n && b->vectorExpressions.at(1) == \"*\" && this->vectorExpressions.at(1) == \"*\") {\n \n Expression *eB0 = s->bindToExpressionType(b->vectorExpressions.at(0));\n Expression *eThis0 = s->bindToExpressionType(this->vectorExpressions.at(0));\n Expression *eB1 = s->bindToExpressionType(b->vectorExpressions.at(2));\n Expression *eThis1 = s->bindToExpressionType(this->vectorExpressions.at(2));\n if (eB0->type == eThis0->type || eB0->canAdd(eThis0)) {\n if (eB0->toString() == eThis0->toString()) {\n s = new Solver(eB0->toString() + \" * \" + eB1->add(eThis1)->toString());\n result = s->bindToExpressionType(s->solve(false));\n vectorExpressions = this->parseBySpaces(result->toString());\n return this;\n }else{\n s = new Solver(eB1->toString() + \" * \" + eB0->add(eThis0)->toString());\n result = s->bindToExpressionType(s->solve(false));\n vectorExpressions = this->parseBySpaces(result->toString());\n return this;\n\n }\n }\n }\n }\n \n \n \n for (int i = 0; i < aSize; i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if ((i == aSize-1 && vectorExpressions.at(i-1) != \"*\" && vectorExpressions.at(i-1) != \"\/\")) {\n changed = true;\n if (vectorExpressions.at(i-1) == \"-\") {\n if (a->canSubtract(operand1)) {\n result = a->subtract(operand1);\n if (result->toString() == \"0\") {\n vectorExpressions.erase(vectorExpressions.begin()+i-1,vectorExpressions.begin()+i+1);\n break;\n }\n vectorExpressions.at(i-1) = \"+\";\n vectorExpressions.at(i) = result->toString();\n break;\n }else{\n if (a->toString() == \"0\") {\n break;\n }\n vectorExpressions.push_back(\"+\");\n vectorExpressions.push_back(a->toString());\n break;\n }\n }else{\n if (operand1->canAdd(a)) {\n result = operand1->add(a);\n if (result->toString() == \"0\") {\n break;\n }\n vectorExpressions.at(i) = result->toString();\n break;\n }\n else{\n if (a->toString() == \"0\") {\n break;\n }\n vectorExpressions.push_back(\"+\");\n vectorExpressions.push_back(a->toString());\n break;\n }\n }\n }\n else if (operand1->canAdd(a) && vectorExpressions.at(i) != \"*\" && vectorExpressions.at(i) != \"\/\") {\n changed = true;\n Expression *result;\n if (vectorExpressions.at(i) == \"-\") {\n result = a->subtract(operand1);\n }else{\n result = operand1->add(a);\n }\n vectorExpressions.at(i) = result->toString();\n break;\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"+\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::subtract(Expression* a)\n{\n Solver *s = new Solver();\n size_t aSize = this->vectorExpressions.size();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if ((i == aSize-1 && vectorExpressions.at(i-1) != \"*\" && vectorExpressions.at(i-1) != \"\/\")) {\n changed = true;\n if(operand1->canSubtract(a)){\n Expression *result = operand1->subtract(a);\n vectorExpressions.at(i) = result->toString();\n break;\n }else{\n vectorExpressions.push_back(\"-\");\n vectorExpressions.push_back(a->toString());\n break;\n }\n }\n else if (operand1->canSubtract(a) && vectorExpressions.at(i) != \"*\" && vectorExpressions.at(i) != \"\/\") {\n changed = true;\n if (operand1->canSubtract(a)) {\n Expression *result = operand1->subtract(a);\n vectorExpressions.at(i) = result->toString();\n break;\n }else{\n vectorExpressions.push_back(\"-\");\n vectorExpressions.push_back(a->toString());\n break;\n }\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"-\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::multiply(Expression* a)\n{\n Solver *s = new Solver();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if (operand1->canMultiply(a)) {\n changed = true;\n Expression *result = operand1->multiply(a);\n if (result->type == \"integer\") {\n Integer *t = (Integer *)result;\n if (t->getValue() == 1) {\n vectorExpressions.at(i) = result->toString();\n vectorExpressions.erase(vectorExpressions.begin() + i-1,vectorExpressions.begin() + i+1);\n }\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"*\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\n\nExpression* MultipleExpressions::divide(Expression* a)\n{\n Solver *s = new Solver();\n bool changed = false;\n for (int i = 0; i < this->vectorExpressions.size(); i++) {\n if ((i % 2 == 0 || i == 0 ) && i != 1) { \/\/odd numbers only\n Expression *operand1 = s->bindToExpressionType(this->vectorExpressions.at(i));\n if (operand1->canDivide(a)) {\n if (i >1 && vectorExpressions.at(i-1) == \"\/\") {\n Rational *t = new Rational(new Integer(1),a);\n this->multiply(t);\n }\n changed = true;\n Expression *result = operand1->divide(a);\n if (result->type == \"integer\") {\n Integer *t = (Integer *)result;\n if (t->getValue() == 1) {\n vectorExpressions.at(i) = result->toString();\n vectorExpressions.erase(vectorExpressions.begin() + i-1,vectorExpressions.begin() + i+1);\n }\n }else if(result->type == \"rational\"){\n Rational *t = (Rational *)result;\n vectorExpressions.at(i) = t->geteNumerator()->toString();\n Expression *n;\n size_t j = (size_t)i+2;\n if(vectorExpressions.size() >= j){\n s->bindToExpressionType(vectorExpressions.at(i+2));\n }else{\n s->bindToExpressionType(vectorExpressions.at(i-2));\n }\n if (t->geteDenominator()->canMultiply(n)) {\n vectorExpressions.at(i+2) = t->geteDenominator()->multiply(n)->toString();\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }else{\n vectorExpressions.at(i) = result->toString();\n }\n }\n }\n }\n if (!changed) {\n this->vectorExpressions.push_back(\"\/\");\n this->vectorExpressions.push_back(a->toString());\n }\n return this;\n}\nvector<string> MultipleExpressions::parseBySpaces(string expression){\n int count = 0;\n string temp = \"\";\n vector<string> expressions = *new vector<string>();\n for(int i = 0; i < expression.size(); i ++){ \/\/creates an array of expressions and operations\n if (expression.at(i) == 'l' && expression.at(i+1) == 'o' && expression.at(i+2) == 'g') {\n temp = \"\";\n for (int j = i; j < expression.size(); j++) {\n temp.push_back(expression.at(j));\n if (expression.at(j) == ')') {\n i = j+1;\n expressions.push_back(temp);\n count = j + 2;\n break;\n }\n }\n }\n else if(expression.at(i) == ' '){\n temp = \"\";\n for (int j = count; j < i; j++) {\n temp.push_back(expression.at(j));\n }\n expressions.push_back(temp);\n count = i+1;\n \n }else if(i == expression.size()-1){\n temp = \"\";\n for (int j = count; j <= i; j++) {\n temp.push_back(expression.at(j));\n }\n expressions.push_back(temp);\n count = i+1;\n }\n }\n return expressions;\n}\nvector<string> MultipleExpressions::getVectorExpressions(){\n return this->vectorExpressions;\n}\n\nstring MultipleExpressions:: toString(){\n this->expressions = \"\";\n for (int i = 0; i < vectorExpressions.size(); i++) {\n this->expressions += vectorExpressions.at(i);\n if (i != vectorExpressions.size()-1) {\n this->expressions += \" \";\n }\n }\n stringstream s;\n\ts<<this->expressions;\n\treturn s.str();\n}\n\nostream& MultipleExpressions::print(std::ostream& output) const{\n MultipleExpressions *a = (MultipleExpressions *)this;\n output << a->toString();\n return output;\n}\n\nbool MultipleExpressions::canAdd(Expression* b){ \/\/use \"this\" as comparison. Solver will call someExpression.canAdd(&someOtherExpression)\n \n if (this->type == b->type && this->type != \"logarithm\") {\n if (this->type == \"nthRoot\") {\n }\n return true;\n }else if((this->type == \"integer\" && b->type == \"rational\") || (this->type == \"rational\" && b->type == \"integer\")){\n return true;\n }else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }\n else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\nbool MultipleExpressions::canSubtract(Expression* b){\n if (this->type == b->type) {\n return true;\n }else if((this->type == \"integer\" && b->type == \"rational\") || (this->type == \"rational\" && b->type == \"integer\")){\n return true;\n }else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\nbool MultipleExpressions::canMultiply(Expression* b){\n if (this->type == b->type) {\n return true;\n }\n else if(this->type == \"integer\" && b->type == \"rational\") return true;\n else if(this->type == \"rational\" && b->type == \"integer\") return true;\n else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n \n}\nbool MultipleExpressions::canDivide(Expression* b){\n if (this->type == b->type) {\n return true;\n }\n else if(this->type == \"integer\"){\n if( b->type == \"rational\") return true;\n }\n else if(this->type == \"rational\" && b->type == \"integer\") return true;\n else if(this->type == \"multiple\" && b->type == \"multiple\"){\n MultipleExpressions *m = (MultipleExpressions *)b;\n if ((this->meType == \"as\" && m->meType == \"as\") || (this->meType == \"md\" && m->meType == \"md\")) {\n return true;\n }\n }else if(this->type == \"multiple\" || b->type == \"multiple\") return true;\n return false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\n\/**\n * @file main.cpp\n * @brief メイン\n *\n * @author y.akira\n * @date 2016.12.14\n *\/\n\n#include \"precompiled.h\"\n\n\nint main() {\n \/\/ jsonから設定を読み込む\n ofxJSON json;\n json.open(\"user.json\");\n \n int w = json[\"Window\"][\"width\"].asInt();\n int h = json[\"Window\"][\"height\"].asInt();\n bool f = json[\"Window\"][\"fullScreen\"].asBool();\n int fps = json[\"Window\"][\"frameLimit\"].asInt();\n\n \/\/ 設定されたボタン番号を読み込む\n string path = json[\"Input\"][\"path\"].asString();\n Input::setup(path);\n\n ofSetupOpenGL(w, h, f ? OF_FULLSCREEN : OF_WINDOW);\n ofSetFrameRate(fps);\n \n ofRunApp(new ofApp());\n}\n<commit_msg>新年あけましておめでとうございます<commit_after>\n\/**\n * @file main.cpp\n * @brief メイン。ω。\n *\n * @author y.akira\n * @date 2016.12.14\n *\/\n\n#include \"precompiled.h\"\n\n\nint main() {\n \/\/ jsonから設定を読み込む\n ofxJSON json;\n json.open(\"user.json\");\n \n int w = json[\"Window\"][\"width\"].asInt();\n int h = json[\"Window\"][\"height\"].asInt();\n bool f = json[\"Window\"][\"fullScreen\"].asBool();\n int fps = json[\"Window\"][\"frameLimit\"].asInt();\n\n \/\/ 設定されたボタン番号を読み込む\n string path = json[\"Input\"][\"path\"].asString();\n Input::setup(path);\n\n ofSetupOpenGL(w, h, f ? OF_FULLSCREEN : OF_WINDOW);\n ofSetFrameRate(fps);\n \n ofRunApp(new ofApp());\n}\n<|endoftext|>"} {"text":"<commit_before>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2013, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/* Author: Acorn Pooley, Ioan Sucan *\/\n\n#include <moveit\/collision_detection\/world.h>\n#include <ros\/console.h>\n\nnamespace collision_detection\n{\nWorld::World()\n{\n}\n\nWorld::World(const World& other)\n{\n objects_ = other.objects_;\n}\n\nWorld::~World()\n{\n while (!observers_.empty())\n removeObserver(observers_.front());\n}\n\ninline void World::addToObjectInternal(const ObjectPtr& obj, const shapes::ShapeConstPtr& shape,\n const Eigen::Affine3d& pose)\n{\n obj->shapes_.push_back(shape);\n obj->shape_poses_.push_back(pose);\n}\n\nvoid World::addToObject(const std::string& id, const std::vector<shapes::ShapeConstPtr>& shapes,\n const EigenSTL::vector_Affine3d& poses)\n{\n if (shapes.size() != poses.size())\n {\n ROS_ERROR_NAMED(\"collision_detection\", \"Number of shapes and number of poses do not match. \"\n \"Not adding this object to collision world.\");\n return;\n }\n\n if (shapes.empty())\n return;\n\n int action = ADD_SHAPE;\n\n ObjectPtr& obj = objects_[id];\n if (!obj)\n {\n obj.reset(new Object(id));\n action |= CREATE;\n }\n\n ensureUnique(obj);\n\n for (std::size_t i = 0; i < shapes.size(); ++i)\n addToObjectInternal(obj, shapes[i], poses[i]);\n\n notify(obj, Action(action));\n}\n\nvoid World::addToObject(const std::string& id, const shapes::ShapeConstPtr& shape, const Eigen::Affine3d& pose)\n{\n int action = ADD_SHAPE;\n\n ObjectPtr& obj = objects_[id];\n if (!obj)\n {\n obj.reset(new Object(id));\n action |= CREATE;\n }\n\n ensureUnique(obj);\n addToObjectInternal(obj, shape, pose);\n\n notify(obj, Action(action));\n}\n\nstd::vector<std::string> World::getObjectIds() const\n{\n std::vector<std::string> id;\n for (const auto& object : objects_)\n id.push_back(object.first);\n return id;\n}\n\nWorld::ObjectConstPtr World::getObject(const std::string& id) const\n{\n auto it = objects_.find(id);\n if (it == objects_.end())\n return ObjectConstPtr();\n else\n return it->second;\n}\n\nvoid World::ensureUnique(ObjectPtr& obj)\n{\n if (obj && !obj.unique())\n obj.reset(new Object(*obj));\n}\n\nbool World::hasObject(const std::string& id) const\n{\n return objects_.find(id) != objects_.end();\n}\n\nbool World::moveShapeInObject(const std::string& id, const shapes::ShapeConstPtr& shape, const Eigen::Affine3d& pose)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n unsigned int n = it->second->shapes_.size();\n for (unsigned int i = 0; i < n; ++i)\n if (it->second->shapes_[i] == shape)\n {\n ensureUnique(it->second);\n it->second->shape_poses_[i] = pose;\n\n notify(it->second, MOVE_SHAPE);\n return true;\n }\n }\n return false;\n}\n\nbool World::moveObject(const std::string& id, const Eigen::Affine3d& transform)\n{\n auto it = objects_.find(id);\n if (it == objects_.end())\n return false;\n ensureUnique(it->second);\n for (size_t i = 0, n = it->second->shapes_.size(); i < n; ++i)\n {\n it->second->shape_poses_[i] = transform * it->second->shape_poses_[i];\n }\n notify(it->second, MOVE_SHAPE);\n return true;\n}\n\nbool World::removeShapeFromObject(const std::string& id, const shapes::ShapeConstPtr& shape)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n unsigned int n = it->second->shapes_.size();\n for (unsigned int i = 0; i < n; ++i)\n if (it->second->shapes_[i] == shape)\n {\n ensureUnique(it->second);\n it->second->shapes_.erase(it->second->shapes_.begin() + i);\n it->second->shape_poses_.erase(it->second->shape_poses_.begin() + i);\n\n if (it->second->shapes_.empty())\n {\n notify(it->second, DESTROY);\n objects_.erase(it);\n }\n else\n {\n notify(it->second, REMOVE_SHAPE);\n }\n return true;\n }\n }\n return false;\n}\n\nbool World::removeObject(const std::string& id)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n notify(it->second, DESTROY);\n objects_.erase(it);\n return true;\n }\n return false;\n}\n\nvoid World::clearObjects()\n{\n notifyAll(DESTROY);\n objects_.clear();\n}\n\nWorld::ObserverHandle World::addObserver(const ObserverCallbackFn& callback)\n{\n auto o = new Observer(callback);\n observers_.push_back(o);\n return ObserverHandle(o);\n}\n\nvoid World::removeObserver(ObserverHandle observer_handle)\n{\n for (auto obs = observers_.begin(); obs != observers_.end(); ++obs)\n {\n if (*obs == observer_handle.observer_)\n {\n delete *obs;\n observers_.erase(obs);\n return;\n }\n }\n}\n\nvoid World::notifyAll(Action action)\n{\n for (std::map<std::string, ObjectPtr>::const_iterator it = objects_.begin(); it != objects_.end(); ++it)\n notify(it->second, action);\n}\n\nvoid World::notify(const ObjectConstPtr& obj, Action action)\n{\n for (std::vector<Observer*>::const_iterator obs = observers_.begin(); obs != observers_.end(); ++obs)\n (*obs)->callback_(obj, action);\n}\n\nvoid World::notifyObserverAllObjects(const ObserverHandle observer_handle, Action action) const\n{\n for (auto observer : observers_)\n {\n if (observer == observer_handle.observer_)\n {\n \/\/ call the callback for each object\n for (const auto& object : objects_)\n observer->callback_(object.second, action);\n break;\n }\n }\n}\n\n} \/\/ end of namespace collision_detection\n<commit_msg>World::moveObject(): only apply changes if there is any non-zero motion (#1108)<commit_after>\/*********************************************************************\n * Software License Agreement (BSD License)\n *\n * Copyright (c) 2013, Willow Garage, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and\/or other materials provided\n * with the distribution.\n * * Neither the name of Willow Garage nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *********************************************************************\/\n\n\/* Author: Acorn Pooley, Ioan Sucan *\/\n\n#include <moveit\/collision_detection\/world.h>\n#include <ros\/console.h>\n\nnamespace collision_detection\n{\nWorld::World()\n{\n}\n\nWorld::World(const World& other)\n{\n objects_ = other.objects_;\n}\n\nWorld::~World()\n{\n while (!observers_.empty())\n removeObserver(observers_.front());\n}\n\ninline void World::addToObjectInternal(const ObjectPtr& obj, const shapes::ShapeConstPtr& shape,\n const Eigen::Affine3d& pose)\n{\n obj->shapes_.push_back(shape);\n obj->shape_poses_.push_back(pose);\n}\n\nvoid World::addToObject(const std::string& id, const std::vector<shapes::ShapeConstPtr>& shapes,\n const EigenSTL::vector_Affine3d& poses)\n{\n if (shapes.size() != poses.size())\n {\n ROS_ERROR_NAMED(\"collision_detection\", \"Number of shapes and number of poses do not match. \"\n \"Not adding this object to collision world.\");\n return;\n }\n\n if (shapes.empty())\n return;\n\n int action = ADD_SHAPE;\n\n ObjectPtr& obj = objects_[id];\n if (!obj)\n {\n obj.reset(new Object(id));\n action |= CREATE;\n }\n\n ensureUnique(obj);\n\n for (std::size_t i = 0; i < shapes.size(); ++i)\n addToObjectInternal(obj, shapes[i], poses[i]);\n\n notify(obj, Action(action));\n}\n\nvoid World::addToObject(const std::string& id, const shapes::ShapeConstPtr& shape, const Eigen::Affine3d& pose)\n{\n int action = ADD_SHAPE;\n\n ObjectPtr& obj = objects_[id];\n if (!obj)\n {\n obj.reset(new Object(id));\n action |= CREATE;\n }\n\n ensureUnique(obj);\n addToObjectInternal(obj, shape, pose);\n\n notify(obj, Action(action));\n}\n\nstd::vector<std::string> World::getObjectIds() const\n{\n std::vector<std::string> id;\n for (const auto& object : objects_)\n id.push_back(object.first);\n return id;\n}\n\nWorld::ObjectConstPtr World::getObject(const std::string& id) const\n{\n auto it = objects_.find(id);\n if (it == objects_.end())\n return ObjectConstPtr();\n else\n return it->second;\n}\n\nvoid World::ensureUnique(ObjectPtr& obj)\n{\n if (obj && !obj.unique())\n obj.reset(new Object(*obj));\n}\n\nbool World::hasObject(const std::string& id) const\n{\n return objects_.find(id) != objects_.end();\n}\n\nbool World::moveShapeInObject(const std::string& id, const shapes::ShapeConstPtr& shape, const Eigen::Affine3d& pose)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n unsigned int n = it->second->shapes_.size();\n for (unsigned int i = 0; i < n; ++i)\n if (it->second->shapes_[i] == shape)\n {\n ensureUnique(it->second);\n it->second->shape_poses_[i] = pose;\n\n notify(it->second, MOVE_SHAPE);\n return true;\n }\n }\n return false;\n}\n\nbool World::moveObject(const std::string& id, const Eigen::Affine3d& transform)\n{\n auto it = objects_.find(id);\n if (it == objects_.end())\n return false;\n if (transform.isApprox(Eigen::Affine3d::Identity()))\n return true; \/\/ object already at correct location\n ensureUnique(it->second);\n for (size_t i = 0, n = it->second->shapes_.size(); i < n; ++i)\n {\n it->second->shape_poses_[i] = transform * it->second->shape_poses_[i];\n }\n notify(it->second, MOVE_SHAPE);\n return true;\n}\n\nbool World::removeShapeFromObject(const std::string& id, const shapes::ShapeConstPtr& shape)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n unsigned int n = it->second->shapes_.size();\n for (unsigned int i = 0; i < n; ++i)\n if (it->second->shapes_[i] == shape)\n {\n ensureUnique(it->second);\n it->second->shapes_.erase(it->second->shapes_.begin() + i);\n it->second->shape_poses_.erase(it->second->shape_poses_.begin() + i);\n\n if (it->second->shapes_.empty())\n {\n notify(it->second, DESTROY);\n objects_.erase(it);\n }\n else\n {\n notify(it->second, REMOVE_SHAPE);\n }\n return true;\n }\n }\n return false;\n}\n\nbool World::removeObject(const std::string& id)\n{\n auto it = objects_.find(id);\n if (it != objects_.end())\n {\n notify(it->second, DESTROY);\n objects_.erase(it);\n return true;\n }\n return false;\n}\n\nvoid World::clearObjects()\n{\n notifyAll(DESTROY);\n objects_.clear();\n}\n\nWorld::ObserverHandle World::addObserver(const ObserverCallbackFn& callback)\n{\n auto o = new Observer(callback);\n observers_.push_back(o);\n return ObserverHandle(o);\n}\n\nvoid World::removeObserver(ObserverHandle observer_handle)\n{\n for (auto obs = observers_.begin(); obs != observers_.end(); ++obs)\n {\n if (*obs == observer_handle.observer_)\n {\n delete *obs;\n observers_.erase(obs);\n return;\n }\n }\n}\n\nvoid World::notifyAll(Action action)\n{\n for (std::map<std::string, ObjectPtr>::const_iterator it = objects_.begin(); it != objects_.end(); ++it)\n notify(it->second, action);\n}\n\nvoid World::notify(const ObjectConstPtr& obj, Action action)\n{\n for (std::vector<Observer*>::const_iterator obs = observers_.begin(); obs != observers_.end(); ++obs)\n (*obs)->callback_(obj, action);\n}\n\nvoid World::notifyObserverAllObjects(const ObserverHandle observer_handle, Action action) const\n{\n for (auto observer : observers_)\n {\n if (observer == observer_handle.observer_)\n {\n \/\/ call the callback for each object\n for (const auto& object : objects_)\n observer->callback_(object.second, action);\n break;\n }\n }\n}\n\n} \/\/ end of namespace collision_detection\n<|endoftext|>"} {"text":"<commit_before>#include <errno.h>\n#include <fcntl.h>\n#include <linux\/ioctl.h>\n#include <linux\/types.h>\n#include <poll.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <assert.h>\n#include <time.h>\n\n#include \"PortalMemory.h\"\n#include \"sock_utils.h\"\n#include \"sock_fd.h\"\n\nvoid PortalMemory::InitSemaphores()\n{\n if (sem_init(&sglistSem, 1, 0)){\n fprintf(stderr, \"failed to init sglistSem errno=%d:%s\\n\", errno, strerror(errno));\n }\n if (sem_init(&mtSem, 0, 0)){\n fprintf(stderr, \"failed to init mtSem errno=%d:%s\\n\", errno, strerror(errno));\n }\n}\n\nvoid PortalMemory::InitFds()\n{\n#ifndef MMAP_HW\n snprintf(p_fd.read.path, sizeof(p_fd.read.path), \"fd_sock_rc\");\n connect_socket(&(p_fd.read));\n snprintf(p_fd.write.path, sizeof(p_fd.write.path), \"fd_sock_wc\");\n connect_socket(&(p_fd.write));\n#endif\n}\nPortalMemory::PortalMemory(const char *devname, unsigned int addrbits)\n : PortalProxy(devname, addrbits)\n , handle(1)\n , callBacksRegistered(false)\n{\n InitFds();\n const char* path = \"\/dev\/portalmem\";\n this->pa_fd = ::open(path, O_RDWR);\n if (this->pa_fd < 0){\n fprintf(stderr, \"Failed to open %s pa_fd=%ld errno=%d\\n\", path, (long)this->pa_fd, errno);\n }\n InitSemaphores();\n}\n\nPortalMemory::PortalMemory(int id)\n : PortalProxy(id),\n handle(1)\n{\n InitFds();\n const char* path = \"\/dev\/portalmem\";\n this->pa_fd = ::open(path, O_RDWR);\n if (this->pa_fd < 0){\n fprintf(stderr, \"Failed to open %s pa_fd=%ld errno=%d\\n\", path, (long)this->pa_fd, errno);\n }\n InitSemaphores();\n}\n\nvoid *PortalMemory::mmap(PortalAlloc *portalAlloc)\n{\n void *virt = ::mmap(0, portalAlloc->header.size, PROT_READ|PROT_WRITE|PROT_EXEC, MAP_SHARED, portalAlloc->header.fd, 0);\n return virt;\n}\n\nint PortalMemory::dCacheFlushInval(PortalAlloc *portalAlloc, void *__p)\n{\n#if defined(__arm__)\n int rc = ioctl(this->pa_fd, PA_DCACHE_FLUSH_INVAL, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal dcache flush failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n#elif defined(__i386__) || defined(__x86_64__)\n \/\/ not sure any of this is necessary (mdk)\n for(int i = 0; i < portalAlloc->header.size; i++){\n char foo = *(((volatile char *)__p)+i);\n asm volatile(\"clflush %0\" :: \"m\" (foo));\n }\n asm volatile(\"mfence\");\n#else\n#error(\"dCAcheFlush not defined for unspecified architecture\")\n#endif\n fprintf(stderr, \"dcache flush\\n\");\n return 0;\n\n}\n\nunsigned long long PortalMemory::show_mem_stats(ChannelType rc)\n{\n mtCnt = 0;\n getMemoryTraffic(rc);\n if (callBacksRegistered) {\n sem_wait(&mtSem);\n } else {\n fprintf(stderr, \"ugly hack\\n\");\n sleep(1);\n }\n return mtCnt;\n}\n\nint PortalMemory::reference(PortalAlloc* pa)\n{\n int id = handle++;\n int ne = pa->header.numEntries;\n int size_accum = 0;\n \/\/ HW interprets zeros as end of sglist\n pa->entries[ne].dma_address = 0;\n pa->entries[ne].length = 0;\n pa->header.numEntries++;\n fprintf(stderr, \"PortalMemory::reference id=%08x, numEntries:=%d len=%08lx)\\n\", id, ne, pa->header.size);\n#ifndef MMAP_HW\n sock_fd_write(p_fd.write.s2, pa->header.fd);\n#endif\n for(int i = 0; i < pa->header.numEntries; i++){\n DmaEntry *e = &(pa->entries[i]);\n#ifdef MMAP_HW\n \/\/fprintf(stderr, \"PortalMemory::sglist(id=%08x, i=%d dma_addr=%08lx, len=%08lx)\\n\", id, i, e->dma_address, e->length);\n sglist(id, e->dma_address, e->length);\n#else\n int addr = (e->length > 0) ? size_accum : 0;\n \/\/fprintf(stderr, \"PortalMemory::sglist(id=%08x, i=%d dma_addr=%08lx, len=%08lx)\\n\", id, i, addr, e->length);\n sglist(id, addr , e->length);\n#endif\n size_accum += e->length;\n if (callBacksRegistered) {\n \/\/fprintf(stderr, \"sem_wait\\n\");\n sem_wait(&sglistSem);\n } else {\n fprintf(stderr, \"ugly hack\\n\");\n sleep(1);\n }\n }\n return id;\n}\n\nvoid PortalMemory::reportMemoryTraffic(unsigned long long words)\n{\n mtCnt = words;\n sem_post(&mtSem);\n}\n\nvoid PortalMemory::configResp(unsigned long channelId)\n{\n sem_post(&sglistSem);\n}\n\nint PortalMemory::alloc(size_t size, PortalAlloc **ppa)\n{\n PortalAlloc *portalAlloc = (PortalAlloc *)malloc(sizeof(PortalAlloc));\n memset(portalAlloc, 0, sizeof(PortalAlloc));\n portalAlloc->header.size = size;\n int rc = ioctl(this->pa_fd, PA_ALLOC, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal alloc failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n fprintf(stderr, \"alloc size=%ld rc=%d fd=%d numEntries=%d\\n\", \n\t (long)portalAlloc->header.size, rc, portalAlloc->header.fd, portalAlloc->header.numEntries);\n portalAlloc = (PortalAlloc *)realloc(portalAlloc, sizeof(PortalAlloc)+((portalAlloc->header.numEntries+1)*sizeof(DmaEntry)));\n rc = ioctl(this->pa_fd, PA_DMA_ADDRESSES, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal alloc failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n *ppa = portalAlloc;\n return 0;\n}\n\n<commit_msg>added copyright and license<commit_after>\n\/\/ Copyright (c) 2013,2014 Quanta Research Cambridge, Inc.\n\n\/\/ Permission is hereby granted, free of charge, to any person\n\/\/ obtaining a copy of this software and associated documentation\n\/\/ files (the \"Software\"), to deal in the Software without\n\/\/ restriction, including without limitation the rights to use, copy,\n\/\/ modify, merge, publish, distribute, sublicense, and\/or sell copies\n\/\/ of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\n\/\/ The above copyright notice and this permission notice shall be\n\/\/ included in all copies or substantial portions of the Software.\n\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\n\/\/ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\/\/ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n\/\/ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS\n\/\/ BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n\/\/ ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n\/\/ CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\n#include <errno.h>\n#include <fcntl.h>\n#include <linux\/ioctl.h>\n#include <linux\/types.h>\n#include <poll.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <sys\/mman.h>\n#include <sys\/stat.h>\n#include <sys\/types.h>\n#include <unistd.h>\n#include <assert.h>\n#include <time.h>\n\n#include \"PortalMemory.h\"\n#include \"sock_utils.h\"\n#include \"sock_fd.h\"\n\nvoid PortalMemory::InitSemaphores()\n{\n if (sem_init(&sglistSem, 1, 0)){\n fprintf(stderr, \"failed to init sglistSem errno=%d:%s\\n\", errno, strerror(errno));\n }\n if (sem_init(&mtSem, 0, 0)){\n fprintf(stderr, \"failed to init mtSem errno=%d:%s\\n\", errno, strerror(errno));\n }\n}\n\nvoid PortalMemory::InitFds()\n{\n#ifndef MMAP_HW\n snprintf(p_fd.read.path, sizeof(p_fd.read.path), \"fd_sock_rc\");\n connect_socket(&(p_fd.read));\n snprintf(p_fd.write.path, sizeof(p_fd.write.path), \"fd_sock_wc\");\n connect_socket(&(p_fd.write));\n#endif\n}\nPortalMemory::PortalMemory(const char *devname, unsigned int addrbits)\n : PortalProxy(devname, addrbits)\n , handle(1)\n , callBacksRegistered(false)\n{\n InitFds();\n const char* path = \"\/dev\/portalmem\";\n this->pa_fd = ::open(path, O_RDWR);\n if (this->pa_fd < 0){\n fprintf(stderr, \"Failed to open %s pa_fd=%ld errno=%d\\n\", path, (long)this->pa_fd, errno);\n }\n InitSemaphores();\n}\n\nPortalMemory::PortalMemory(int id)\n : PortalProxy(id),\n handle(1)\n{\n InitFds();\n const char* path = \"\/dev\/portalmem\";\n this->pa_fd = ::open(path, O_RDWR);\n if (this->pa_fd < 0){\n fprintf(stderr, \"Failed to open %s pa_fd=%ld errno=%d\\n\", path, (long)this->pa_fd, errno);\n }\n InitSemaphores();\n}\n\nvoid *PortalMemory::mmap(PortalAlloc *portalAlloc)\n{\n void *virt = ::mmap(0, portalAlloc->header.size, PROT_READ|PROT_WRITE|PROT_EXEC, MAP_SHARED, portalAlloc->header.fd, 0);\n return virt;\n}\n\nint PortalMemory::dCacheFlushInval(PortalAlloc *portalAlloc, void *__p)\n{\n#if defined(__arm__)\n int rc = ioctl(this->pa_fd, PA_DCACHE_FLUSH_INVAL, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal dcache flush failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n#elif defined(__i386__) || defined(__x86_64__)\n \/\/ not sure any of this is necessary (mdk)\n for(int i = 0; i < portalAlloc->header.size; i++){\n char foo = *(((volatile char *)__p)+i);\n asm volatile(\"clflush %0\" :: \"m\" (foo));\n }\n asm volatile(\"mfence\");\n#else\n#error(\"dCAcheFlush not defined for unspecified architecture\")\n#endif\n fprintf(stderr, \"dcache flush\\n\");\n return 0;\n\n}\n\nunsigned long long PortalMemory::show_mem_stats(ChannelType rc)\n{\n mtCnt = 0;\n getMemoryTraffic(rc);\n if (callBacksRegistered) {\n sem_wait(&mtSem);\n } else {\n fprintf(stderr, \"ugly hack\\n\");\n sleep(1);\n }\n return mtCnt;\n}\n\nint PortalMemory::reference(PortalAlloc* pa)\n{\n int id = handle++;\n int ne = pa->header.numEntries;\n int size_accum = 0;\n \/\/ HW interprets zeros as end of sglist\n pa->entries[ne].dma_address = 0;\n pa->entries[ne].length = 0;\n pa->header.numEntries++;\n fprintf(stderr, \"PortalMemory::reference id=%08x, numEntries:=%d len=%08lx)\\n\", id, ne, pa->header.size);\n#ifndef MMAP_HW\n sock_fd_write(p_fd.write.s2, pa->header.fd);\n#endif\n for(int i = 0; i < pa->header.numEntries; i++){\n DmaEntry *e = &(pa->entries[i]);\n#ifdef MMAP_HW\n \/\/fprintf(stderr, \"PortalMemory::sglist(id=%08x, i=%d dma_addr=%08lx, len=%08lx)\\n\", id, i, e->dma_address, e->length);\n sglist(id, e->dma_address, e->length);\n#else\n int addr = (e->length > 0) ? size_accum : 0;\n \/\/fprintf(stderr, \"PortalMemory::sglist(id=%08x, i=%d dma_addr=%08lx, len=%08lx)\\n\", id, i, addr, e->length);\n sglist(id, addr , e->length);\n#endif\n size_accum += e->length;\n if (callBacksRegistered) {\n \/\/fprintf(stderr, \"sem_wait\\n\");\n sem_wait(&sglistSem);\n } else {\n fprintf(stderr, \"ugly hack\\n\");\n sleep(1);\n }\n }\n return id;\n}\n\nvoid PortalMemory::reportMemoryTraffic(unsigned long long words)\n{\n mtCnt = words;\n sem_post(&mtSem);\n}\n\nvoid PortalMemory::configResp(unsigned long channelId)\n{\n sem_post(&sglistSem);\n}\n\nint PortalMemory::alloc(size_t size, PortalAlloc **ppa)\n{\n PortalAlloc *portalAlloc = (PortalAlloc *)malloc(sizeof(PortalAlloc));\n memset(portalAlloc, 0, sizeof(PortalAlloc));\n portalAlloc->header.size = size;\n int rc = ioctl(this->pa_fd, PA_ALLOC, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal alloc failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n fprintf(stderr, \"alloc size=%ld rc=%d fd=%d numEntries=%d\\n\", \n\t (long)portalAlloc->header.size, rc, portalAlloc->header.fd, portalAlloc->header.numEntries);\n portalAlloc = (PortalAlloc *)realloc(portalAlloc, sizeof(PortalAlloc)+((portalAlloc->header.numEntries+1)*sizeof(DmaEntry)));\n rc = ioctl(this->pa_fd, PA_DMA_ADDRESSES, portalAlloc);\n if (rc){\n fprintf(stderr, \"portal alloc failed rc=%d errno=%d:%s\\n\", rc, errno, strerror(errno));\n return rc;\n }\n *ppa = portalAlloc;\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include \"I2PEndian.h\"\n#include <string.h>\n#include \"Log.h\"\n#include \"NetDb.h\"\n#include \"I2NPProtocol.h\"\n#include \"Transports.h\"\n#include \"RouterContext.h\"\n#include \"TunnelEndpoint.h\"\n\nnamespace i2p\n{\nnamespace tunnel\n{\n\tTunnelEndpoint::~TunnelEndpoint ()\n\t{\n\t\tfor (auto it: m_IncompleteMessages)\n\t\t\ti2p::DeleteI2NPMessage (it.second.data);\n\t\tfor (auto it: m_OutOfSequenceFragments)\n\t\t\ti2p::DeleteI2NPMessage (it.second.data);\n\t}\t\n\t\n\tvoid TunnelEndpoint::HandleDecryptedTunnelDataMsg (I2NPMessage * msg)\n\t{\n\t\tm_NumReceivedBytes += TUNNEL_DATA_MSG_SIZE;\n\t\t\n\t\tuint8_t * decrypted = msg->GetPayload () + 20; \/\/ 4 + 16\n\t\tuint8_t * zero = (uint8_t *)memchr (decrypted + 4, 0, TUNNEL_DATA_ENCRYPTED_SIZE - 4); \/\/ witout 4-byte checksum\n\t\tif (zero)\n\t\t{\t\n\t\t\tLogPrint (\"TunnelMessage: zero found at \", (int)(zero-decrypted));\n\t\t\tuint8_t * fragment = zero + 1;\n\t\t\t\/\/ verify checksum\n\t\t\tmemcpy (msg->GetPayload () + TUNNEL_DATA_MSG_SIZE, msg->GetPayload () + 4, 16); \/\/ copy iv to the end\n\t\t\tuint8_t hash[32];\n\t\t\tCryptoPP::SHA256().CalculateDigest (hash, fragment, TUNNEL_DATA_MSG_SIZE -(fragment - msg->GetPayload ()) + 16); \/\/ payload + iv\n\t\t\tif (memcmp (hash, decrypted, 4))\n\t\t\t{\n\t\t\t\tLogPrint (\"TunnelMessage: checksum verification failed\");\n\t\t\t\ti2p::DeleteI2NPMessage (msg);\n\t\t\t\treturn;\n\t\t\t}\t\n\t\t\t\/\/ process fragments\n\t\t\twhile (fragment < decrypted + TUNNEL_DATA_ENCRYPTED_SIZE)\n\t\t\t{\n\t\t\t\tuint8_t flag = fragment[0];\n\t\t\t\tfragment++;\n\t\t\t\t\n\t\t\t\tbool isFollowOnFragment = flag & 0x80, isLastFragment = true;\t\t\n\t\t\t\tuint32_t msgID = 0;\n\t\t\t\tint fragmentNum = 0;\n\t\t\t\tTunnelMessageBlockEx m;\n\t\t\t\tif (!isFollowOnFragment)\n\t\t\t\t{\t\n\t\t\t\t\t\/\/ first fragment\n\t\t\t\t\t\n\t\t\t\t\tm.deliveryType = (TunnelDeliveryType)((flag >> 5) & 0x03);\n\t\t\t\t\tswitch (m.deliveryType)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase eDeliveryTypeLocal: \/\/ 0\n\t\t\t\t\t\t\tLogPrint (\"Delivery type local\");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t \tcase eDeliveryTypeTunnel: \/\/ 1\n\t\t\t\t\t\t\tLogPrint (\"Delivery type tunnel\");\t\n\t\t\t\t\t\t\tm.tunnelID = be32toh (*(uint32_t *)fragment);\n\t\t\t\t\t\t\tfragment += 4; \/\/ tunnelID\n\t\t\t\t\t\t\tm.hash = i2p::data::IdentHash (fragment);\n\t\t\t\t\t\t\tfragment += 32; \/\/ hash\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase eDeliveryTypeRouter: \/\/ 2\n\t\t\t\t\t\t\tLogPrint (\"Delivery type router\");\t\n\t\t\t\t\t\t\tm.hash = i2p::data::IdentHash (fragment);\t\n\t\t\t\t\t\t\tfragment += 32; \/\/ to hash\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t;\n\t\t\t\t\t}\t\n\n\t\t\t\t\tbool isFragmented = flag & 0x08;\n\t\t\t\t\tif (isFragmented)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Message ID\n\t\t\t\t\t\tmsgID = be32toh (*(uint32_t *)fragment); \t\n\t\t\t\t\t\tfragment += 4;\n\t\t\t\t\t\tLogPrint (\"Fragmented message \", msgID);\n\t\t\t\t\t\tisLastFragment = false;\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ follow on\n\t\t\t\t\tmsgID = be32toh (*(uint32_t *)fragment); \/\/ MessageID\t\t\t\n\t\t\t\t\tfragment += 4; \n\t\t\t\t\tfragmentNum = (flag >> 1) & 0x3F; \/\/ 6 bits\n\t\t\t\t\tisLastFragment = flag & 0x01;\n\t\t\t\t\tLogPrint (\"Follow on fragment \", fragmentNum, \" of message \", msgID, isLastFragment ? \" last\" : \" non-last\");\n\t\t\t\t}\t\n\t\t\t\t\n\t\t\t\tuint16_t size = be16toh (*(uint16_t *)fragment);\n\t\t\t\tfragment += 2;\n\t\t\t\tLogPrint (\"Fragment size=\", (int)size);\n\n\t\t\t\tmsg->offset = fragment - msg->buf;\n\t\t\t\tmsg->len = msg->offset + size;\n\t\t\t\tif (fragment + size < decrypted + TUNNEL_DATA_ENCRYPTED_SIZE)\n\t\t\t\t{\n\t\t\t\t\t\/\/ this is not last message. we have to copy it\n\t\t\t\t\tm.data = NewI2NPMessage ();\n\t\t\t\t\tm.data->offset += sizeof (TunnelGatewayHeader); \/\/ reserve room for TunnelGateway header\n\t\t\t\t\tm.data->len += sizeof (TunnelGatewayHeader);\n\t\t\t\t\t*(m.data) = *msg;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tm.data = msg;\n\t\t\t\t\n\t\t\t\tif (!isFollowOnFragment && isLastFragment)\n\t\t\t\t\tHandleNextMessage (m);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (msgID) \/\/ msgID is presented, assume message is fragmented\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!isFollowOnFragment) \/\/ create new incomlete message\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tm.nextFragmentNum = 1;\n\t\t\t\t\t\t\tm_IncompleteMessages[msgID] = m;\n\t\t\t\t\t\t\tHandleOutOfSequenceFragment (msgID, m);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tm.nextFragmentNum = fragmentNum;\n\t\t\t\t\t\t\tHandleFollowOnFragment (msgID, isLastFragment, m);\n\t\t\t\t\t\t}\t\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tLogPrint (\"Message is fragmented, but msgID is not presented\");\n\t\t\t\t}\t\n\t\t\t\t\t\n\t\t\t\tfragment += size;\n\t\t\t}\t\n\t\t}\t\n\t\telse\n\t\t{\t\n\t\t\tLogPrint (\"TunnelMessage: zero not found\");\n\t\t\ti2p::DeleteI2NPMessage (msg);\t\n\t\t}\t\n\t}\t\n\n\tvoid TunnelEndpoint::HandleFollowOnFragment (uint32_t msgID, bool isLastFragment, const TunnelMessageBlockEx& m)\n\t{\n\t\tauto fragment = m.data->GetBuffer ();\n\t\tauto size = m.data->GetLength ();\n\t\tauto it = m_IncompleteMessages.find (msgID);\n\t\tif (it != m_IncompleteMessages.end())\n\t\t{\n\t\t\tauto& msg = it->second;\n\t\t\tif (m.nextFragmentNum == msg.nextFragmentNum)\n\t\t\t{\n\t\t\t\tif (msg.data->len + size < I2NP_MAX_MESSAGE_SIZE) \/\/ check if messega is not too long\n\t\t\t\t{\t\n\t\t\t\t\tmemcpy (msg.data->buf + msg.data->len, fragment, size); \/\/ concatenate fragment\n\t\t\t\t\tmsg.data->len += size;\n\t\t\t\t\tif (isLastFragment)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ message complete\n\t\t\t\t\t\tHandleNextMessage (msg);\t\n\t\t\t\t\t\tm_IncompleteMessages.erase (it); \n\t\t\t\t\t}\t\n\t\t\t\t\telse\n\t\t\t\t\t{\t\n\t\t\t\t\t\tmsg.nextFragmentNum++;\n\t\t\t\t\t\tHandleOutOfSequenceFragment (msgID, msg);\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tLogPrint (\"Fragment \", m.nextFragmentNum, \" of message \", msgID, \"exceeds max I2NP message size. Message dropped\");\n\t\t\t\t\ti2p::DeleteI2NPMessage (msg.data);\n\t\t\t\t\tm_IncompleteMessages.erase (it);\n\t\t\t\t}\n\t\t\t\ti2p::DeleteI2NPMessage (m.data);\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\tLogPrint (\"Unexpected fragment \", (int)m.nextFragmentNum, \" instead \", (int)msg.nextFragmentNum, \" of message \", msgID, \". Saved\");\n\t\t\t\tAddOutOfSequenceFragment (msgID, m.nextFragmentNum, isLastFragment, m.data);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\t\n\t\t\tLogPrint (\"First fragment of message \", msgID, \" not found. Saved\");\n\t\t\tAddOutOfSequenceFragment (msgID, m.nextFragmentNum, isLastFragment, m.data);\n\t\t}\t\n\t}\t\n\n\tvoid TunnelEndpoint::AddOutOfSequenceFragment (uint32_t msgID, uint8_t fragmentNum, bool isLastFragment, I2NPMessage * data)\n\t{\n\t\tauto it = m_OutOfSequenceFragments.find (msgID);\n\t\tif (it == m_OutOfSequenceFragments.end ())\n\t\t\tm_OutOfSequenceFragments.insert (std::pair<uint32_t, Fragment> (msgID, {fragmentNum, isLastFragment, data}));\t\n\t\telse\n\t\t\ti2p::DeleteI2NPMessage (data);\n\t}\t\n\n\tvoid TunnelEndpoint::HandleOutOfSequenceFragment (uint32_t msgID, TunnelMessageBlockEx& msg)\n\t{\n\t\tauto it = m_OutOfSequenceFragments.find (msgID);\n\t\tif (it != m_OutOfSequenceFragments.end ())\n\t\t{\n\t\t\tif (it->second.fragmentNum == msg.nextFragmentNum)\n\t\t\t{\n\t\t\t\tLogPrint (\"Out-of-sequence fragment \", (int)it->second.fragmentNum, \" of message \", msgID, \" found\");\n\t\t\t\tauto size = it->second.data->GetLength ();\n\t\t\t\tmemcpy (msg.data->buf + msg.data->len, it->second.data->GetBuffer (), size); \/\/ concatenate out-of-sync fragment\n\t\t\t\tmsg.data->len += size;\n\t\t\t\tif (it->second.isLastFragment)\n\t\t\t\t{\n\t\t\t\t\t\/\/ message complete\n\t\t\t\t\tHandleNextMessage (msg);\t\n\t\t\t\t\tm_IncompleteMessages.erase (msgID); \n\t\t\t\t}\t\n\t\t\t\telse\n\t\t\t\t\tmsg.nextFragmentNum++;\n\t\t\t\ti2p::DeleteI2NPMessage (it->second.data);\n\t\t\t\tm_OutOfSequenceFragments.erase (it);\n\t\t\t}\t\n\t\t}\t\n\t}\t\n\t\n\tvoid TunnelEndpoint::HandleNextMessage (const TunnelMessageBlock& msg)\n\t{\n\t\tLogPrint (\"TunnelMessage: handle fragment of \", msg.data->GetLength (),\" bytes. Msg type \", (int)msg.data->GetHeader()->typeID);\n\t\tswitch (msg.deliveryType)\n\t\t{\n\t\t\tcase eDeliveryTypeLocal:\n\t\t\t\ti2p::HandleI2NPMessage (msg.data);\n\t\t\tbreak;\n\t\t\tcase eDeliveryTypeTunnel:\n\t\t\t\ti2p::transports.SendMessage (msg.hash, i2p::CreateTunnelGatewayMsg (msg.tunnelID, msg.data));\n\t\t\tbreak;\n\t\t\tcase eDeliveryTypeRouter:\n\t\t\t\tif (msg.hash == i2p::context.GetRouterInfo ().GetIdentHash ()) \/\/ check if message is sent to us\n\t\t\t\t\ti2p::HandleI2NPMessage (msg.data);\n\t\t\t\telse\n\t\t\t\t{\t\n\t\t\t\t\t\/\/ to somebody else\n\t\t\t\t\tif (!m_IsInbound) \/\/ outbound transit tunnel\n\t\t\t\t\t{\n\t\t\t\t\t\tif (msg.data->GetHeader()->typeID == eI2NPDatabaseStore ||\n\t\t\t\t\t\t msg.data->GetHeader()->typeID == eI2NPDatabaseSearchReply )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ catch RI or reply with new list of routers\n\t\t\t\t\t\t\tauto ds = NewI2NPMessage ();\n\t\t\t\t\t\t\t*ds = *(msg.data);\n\t\t\t\t\t\t\ti2p::data::netdb.PostI2NPMsg (ds);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti2p::transports.SendMessage (msg.hash, msg.data);\n\t\t\t\t\t}\n\t\t\t\t\telse \/\/ we shouldn't send this message. possible leakage \n\t\t\t\t\t{\n\t\t\t\t\t\tLogPrint (\"Message to another router arrived from an inbound tunnel. Dropped\");\n\t\t\t\t\t\ti2p::DeleteI2NPMessage (msg.data);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tLogPrint (\"TunnelMessage: Unknown delivery type \", (int)msg.deliveryType);\n\t\t};\t\n\t}\t\n}\t\t\n}\n<commit_msg>handle out-of-sequence fragment for first fragment<commit_after>#include \"I2PEndian.h\"\n#include <string.h>\n#include \"Log.h\"\n#include \"NetDb.h\"\n#include \"I2NPProtocol.h\"\n#include \"Transports.h\"\n#include \"RouterContext.h\"\n#include \"TunnelEndpoint.h\"\n\nnamespace i2p\n{\nnamespace tunnel\n{\n\tTunnelEndpoint::~TunnelEndpoint ()\n\t{\n\t\tfor (auto it: m_IncompleteMessages)\n\t\t\ti2p::DeleteI2NPMessage (it.second.data);\n\t\tfor (auto it: m_OutOfSequenceFragments)\n\t\t\ti2p::DeleteI2NPMessage (it.second.data);\n\t}\t\n\t\n\tvoid TunnelEndpoint::HandleDecryptedTunnelDataMsg (I2NPMessage * msg)\n\t{\n\t\tm_NumReceivedBytes += TUNNEL_DATA_MSG_SIZE;\n\t\t\n\t\tuint8_t * decrypted = msg->GetPayload () + 20; \/\/ 4 + 16\n\t\tuint8_t * zero = (uint8_t *)memchr (decrypted + 4, 0, TUNNEL_DATA_ENCRYPTED_SIZE - 4); \/\/ witout 4-byte checksum\n\t\tif (zero)\n\t\t{\t\n\t\t\tLogPrint (\"TunnelMessage: zero found at \", (int)(zero-decrypted));\n\t\t\tuint8_t * fragment = zero + 1;\n\t\t\t\/\/ verify checksum\n\t\t\tmemcpy (msg->GetPayload () + TUNNEL_DATA_MSG_SIZE, msg->GetPayload () + 4, 16); \/\/ copy iv to the end\n\t\t\tuint8_t hash[32];\n\t\t\tCryptoPP::SHA256().CalculateDigest (hash, fragment, TUNNEL_DATA_MSG_SIZE -(fragment - msg->GetPayload ()) + 16); \/\/ payload + iv\n\t\t\tif (memcmp (hash, decrypted, 4))\n\t\t\t{\n\t\t\t\tLogPrint (\"TunnelMessage: checksum verification failed\");\n\t\t\t\ti2p::DeleteI2NPMessage (msg);\n\t\t\t\treturn;\n\t\t\t}\t\n\t\t\t\/\/ process fragments\n\t\t\twhile (fragment < decrypted + TUNNEL_DATA_ENCRYPTED_SIZE)\n\t\t\t{\n\t\t\t\tuint8_t flag = fragment[0];\n\t\t\t\tfragment++;\n\t\t\t\t\n\t\t\t\tbool isFollowOnFragment = flag & 0x80, isLastFragment = true;\t\t\n\t\t\t\tuint32_t msgID = 0;\n\t\t\t\tint fragmentNum = 0;\n\t\t\t\tTunnelMessageBlockEx m;\n\t\t\t\tif (!isFollowOnFragment)\n\t\t\t\t{\t\n\t\t\t\t\t\/\/ first fragment\n\t\t\t\t\t\n\t\t\t\t\tm.deliveryType = (TunnelDeliveryType)((flag >> 5) & 0x03);\n\t\t\t\t\tswitch (m.deliveryType)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase eDeliveryTypeLocal: \/\/ 0\n\t\t\t\t\t\t\tLogPrint (\"Delivery type local\");\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t \tcase eDeliveryTypeTunnel: \/\/ 1\n\t\t\t\t\t\t\tLogPrint (\"Delivery type tunnel\");\t\n\t\t\t\t\t\t\tm.tunnelID = be32toh (*(uint32_t *)fragment);\n\t\t\t\t\t\t\tfragment += 4; \/\/ tunnelID\n\t\t\t\t\t\t\tm.hash = i2p::data::IdentHash (fragment);\n\t\t\t\t\t\t\tfragment += 32; \/\/ hash\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase eDeliveryTypeRouter: \/\/ 2\n\t\t\t\t\t\t\tLogPrint (\"Delivery type router\");\t\n\t\t\t\t\t\t\tm.hash = i2p::data::IdentHash (fragment);\t\n\t\t\t\t\t\t\tfragment += 32; \/\/ to hash\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t;\n\t\t\t\t\t}\t\n\n\t\t\t\t\tbool isFragmented = flag & 0x08;\n\t\t\t\t\tif (isFragmented)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ Message ID\n\t\t\t\t\t\tmsgID = be32toh (*(uint32_t *)fragment); \t\n\t\t\t\t\t\tfragment += 4;\n\t\t\t\t\t\tLogPrint (\"Fragmented message \", msgID);\n\t\t\t\t\t\tisLastFragment = false;\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t\/\/ follow on\n\t\t\t\t\tmsgID = be32toh (*(uint32_t *)fragment); \/\/ MessageID\t\t\t\n\t\t\t\t\tfragment += 4; \n\t\t\t\t\tfragmentNum = (flag >> 1) & 0x3F; \/\/ 6 bits\n\t\t\t\t\tisLastFragment = flag & 0x01;\n\t\t\t\t\tLogPrint (\"Follow on fragment \", fragmentNum, \" of message \", msgID, isLastFragment ? \" last\" : \" non-last\");\n\t\t\t\t}\t\n\t\t\t\t\n\t\t\t\tuint16_t size = be16toh (*(uint16_t *)fragment);\n\t\t\t\tfragment += 2;\n\t\t\t\tLogPrint (\"Fragment size=\", (int)size);\n\n\t\t\t\tmsg->offset = fragment - msg->buf;\n\t\t\t\tmsg->len = msg->offset + size;\n\t\t\t\tif (fragment + size < decrypted + TUNNEL_DATA_ENCRYPTED_SIZE)\n\t\t\t\t{\n\t\t\t\t\t\/\/ this is not last message. we have to copy it\n\t\t\t\t\tm.data = NewI2NPMessage ();\n\t\t\t\t\tm.data->offset += sizeof (TunnelGatewayHeader); \/\/ reserve room for TunnelGateway header\n\t\t\t\t\tm.data->len += sizeof (TunnelGatewayHeader);\n\t\t\t\t\t*(m.data) = *msg;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tm.data = msg;\n\t\t\t\t\n\t\t\t\tif (!isFollowOnFragment && isLastFragment)\n\t\t\t\t\tHandleNextMessage (m);\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (msgID) \/\/ msgID is presented, assume message is fragmented\n\t\t\t\t\t{\n\t\t\t\t\t\tif (!isFollowOnFragment) \/\/ create new incomlete message\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tm.nextFragmentNum = 1;\n\t\t\t\t\t\t\tHandleOutOfSequenceFragment (msgID, m);\n\t\t\t\t\t\t\tm_IncompleteMessages[msgID] = m;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tm.nextFragmentNum = fragmentNum;\n\t\t\t\t\t\t\tHandleFollowOnFragment (msgID, isLastFragment, m);\n\t\t\t\t\t\t}\t\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t\tLogPrint (\"Message is fragmented, but msgID is not presented\");\n\t\t\t\t}\t\n\t\t\t\t\t\n\t\t\t\tfragment += size;\n\t\t\t}\t\n\t\t}\t\n\t\telse\n\t\t{\t\n\t\t\tLogPrint (\"TunnelMessage: zero not found\");\n\t\t\ti2p::DeleteI2NPMessage (msg);\t\n\t\t}\t\n\t}\t\n\n\tvoid TunnelEndpoint::HandleFollowOnFragment (uint32_t msgID, bool isLastFragment, const TunnelMessageBlockEx& m)\n\t{\n\t\tauto fragment = m.data->GetBuffer ();\n\t\tauto size = m.data->GetLength ();\n\t\tauto it = m_IncompleteMessages.find (msgID);\n\t\tif (it != m_IncompleteMessages.end())\n\t\t{\n\t\t\tauto& msg = it->second;\n\t\t\tif (m.nextFragmentNum == msg.nextFragmentNum)\n\t\t\t{\n\t\t\t\tif (msg.data->len + size < I2NP_MAX_MESSAGE_SIZE) \/\/ check if messega is not too long\n\t\t\t\t{\t\n\t\t\t\t\tmemcpy (msg.data->buf + msg.data->len, fragment, size); \/\/ concatenate fragment\n\t\t\t\t\tmsg.data->len += size;\n\t\t\t\t\tif (isLastFragment)\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/ message complete\n\t\t\t\t\t\tHandleNextMessage (msg);\t\n\t\t\t\t\t\tm_IncompleteMessages.erase (it); \n\t\t\t\t\t}\t\n\t\t\t\t\telse\n\t\t\t\t\t{\t\n\t\t\t\t\t\tmsg.nextFragmentNum++;\n\t\t\t\t\t\tHandleOutOfSequenceFragment (msgID, msg);\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tLogPrint (\"Fragment \", m.nextFragmentNum, \" of message \", msgID, \"exceeds max I2NP message size. Message dropped\");\n\t\t\t\t\ti2p::DeleteI2NPMessage (msg.data);\n\t\t\t\t\tm_IncompleteMessages.erase (it);\n\t\t\t\t}\n\t\t\t\ti2p::DeleteI2NPMessage (m.data);\n\t\t\t}\n\t\t\telse\n\t\t\t{\t\n\t\t\t\tLogPrint (\"Unexpected fragment \", (int)m.nextFragmentNum, \" instead \", (int)msg.nextFragmentNum, \" of message \", msgID, \". Saved\");\n\t\t\t\tAddOutOfSequenceFragment (msgID, m.nextFragmentNum, isLastFragment, m.data);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\t\n\t\t\tLogPrint (\"First fragment of message \", msgID, \" not found. Saved\");\n\t\t\tAddOutOfSequenceFragment (msgID, m.nextFragmentNum, isLastFragment, m.data);\n\t\t}\t\n\t}\t\n\n\tvoid TunnelEndpoint::AddOutOfSequenceFragment (uint32_t msgID, uint8_t fragmentNum, bool isLastFragment, I2NPMessage * data)\n\t{\n\t\tauto it = m_OutOfSequenceFragments.find (msgID);\n\t\tif (it == m_OutOfSequenceFragments.end ())\n\t\t\tm_OutOfSequenceFragments.insert (std::pair<uint32_t, Fragment> (msgID, {fragmentNum, isLastFragment, data}));\t\n\t\telse\n\t\t\ti2p::DeleteI2NPMessage (data);\n\t}\t\n\n\tvoid TunnelEndpoint::HandleOutOfSequenceFragment (uint32_t msgID, TunnelMessageBlockEx& msg)\n\t{\n\t\tauto it = m_OutOfSequenceFragments.find (msgID);\n\t\tif (it != m_OutOfSequenceFragments.end ())\n\t\t{\n\t\t\tif (it->second.fragmentNum == msg.nextFragmentNum)\n\t\t\t{\n\t\t\t\tLogPrint (\"Out-of-sequence fragment \", (int)it->second.fragmentNum, \" of message \", msgID, \" found\");\n\t\t\t\tauto size = it->second.data->GetLength ();\n\t\t\t\tmemcpy (msg.data->buf + msg.data->len, it->second.data->GetBuffer (), size); \/\/ concatenate out-of-sync fragment\n\t\t\t\tmsg.data->len += size;\n\t\t\t\tif (it->second.isLastFragment)\n\t\t\t\t{\n\t\t\t\t\t\/\/ message complete\n\t\t\t\t\tHandleNextMessage (msg);\t\n\t\t\t\t\tm_IncompleteMessages.erase (msgID); \n\t\t\t\t}\t\n\t\t\t\telse\n\t\t\t\t\tmsg.nextFragmentNum++;\n\t\t\t\ti2p::DeleteI2NPMessage (it->second.data);\n\t\t\t\tm_OutOfSequenceFragments.erase (it);\n\t\t\t}\t\n\t\t}\t\n\t}\t\n\t\n\tvoid TunnelEndpoint::HandleNextMessage (const TunnelMessageBlock& msg)\n\t{\n\t\tLogPrint (\"TunnelMessage: handle fragment of \", msg.data->GetLength (),\" bytes. Msg type \", (int)msg.data->GetHeader()->typeID);\n\t\tswitch (msg.deliveryType)\n\t\t{\n\t\t\tcase eDeliveryTypeLocal:\n\t\t\t\ti2p::HandleI2NPMessage (msg.data);\n\t\t\tbreak;\n\t\t\tcase eDeliveryTypeTunnel:\n\t\t\t\ti2p::transports.SendMessage (msg.hash, i2p::CreateTunnelGatewayMsg (msg.tunnelID, msg.data));\n\t\t\tbreak;\n\t\t\tcase eDeliveryTypeRouter:\n\t\t\t\tif (msg.hash == i2p::context.GetRouterInfo ().GetIdentHash ()) \/\/ check if message is sent to us\n\t\t\t\t\ti2p::HandleI2NPMessage (msg.data);\n\t\t\t\telse\n\t\t\t\t{\t\n\t\t\t\t\t\/\/ to somebody else\n\t\t\t\t\tif (!m_IsInbound) \/\/ outbound transit tunnel\n\t\t\t\t\t{\n\t\t\t\t\t\tif (msg.data->GetHeader()->typeID == eI2NPDatabaseStore ||\n\t\t\t\t\t\t msg.data->GetHeader()->typeID == eI2NPDatabaseSearchReply )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\/\/ catch RI or reply with new list of routers\n\t\t\t\t\t\t\tauto ds = NewI2NPMessage ();\n\t\t\t\t\t\t\t*ds = *(msg.data);\n\t\t\t\t\t\t\ti2p::data::netdb.PostI2NPMsg (ds);\n\t\t\t\t\t\t}\n\t\t\t\t\t\ti2p::transports.SendMessage (msg.hash, msg.data);\n\t\t\t\t\t}\n\t\t\t\t\telse \/\/ we shouldn't send this message. possible leakage \n\t\t\t\t\t{\n\t\t\t\t\t\tLogPrint (\"Message to another router arrived from an inbound tunnel. Dropped\");\n\t\t\t\t\t\ti2p::DeleteI2NPMessage (msg.data);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tLogPrint (\"TunnelMessage: Unknown delivery type \", (int)msg.deliveryType);\n\t\t};\t\n\t}\t\n}\t\t\n}\n<|endoftext|>"} {"text":"<commit_before>\n\/*\n * Copyright (c) 2004 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * Definition of a memory trace CPU object for optimal caches. Uses a memory\n * trace to access a fully associative cache with optimal replacement.\n *\/\n\n#include <algorithm> \/\/ For heap functions.\n\n#include \"cpu\/trace\/opt_cpu.hh\"\n#include \"cpu\/trace\/reader\/mem_trace_reader.hh\"\n\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n\nusing namespace std;\n\nOptCPU::OptCPU(const string &name,\n MemTraceReader *_trace,\n int block_size,\n int cache_size,\n int _assoc)\n : BaseCPU(name,1), tickEvent(this), trace(_trace),\n numBlks(cache_size\/block_size), assoc(_assoc), numSets(numBlks\/assoc),\n setMask(numSets - 1)\n{\n int log_block_size = (int)(log((double) block_size)\/log(2.0));\n MemReqPtr req;\n trace->getNextReq(req);\n refInfo.resize(numSets);\n while (req) {\n RefInfo temp;\n temp.addr = req->paddr >> log_block_size;\n int set = temp.addr & setMask;\n refInfo[set].push_back(temp);\n trace->getNextReq(req);\n }\n\n \/\/ Initialize top level of lookup table.\n lookupTable.resize(16);\n\n \/\/ Annotate references with next ref time.\n for (int k = 0; k < numSets; ++k) {\n for (RefIndex i = refInfo[k].size() - 1; i >= 0; --i) {\n Addr addr = refInfo[k][i].addr;\n initTable(addr, InfiniteRef);\n refInfo[k][i].nextRefTime = lookupValue(addr);\n setValue(addr, i);\n }\n }\n\n \/\/ Reset the lookup table\n for (int j = 0; j < 16; ++j) {\n if (lookupTable[j].size() == (1<<16)) {\n for (int k = 0; k < (1<<16); ++k) {\n if (lookupTable[j][k].size() == (1<<16)) {\n for (int l = 0; l < (1<<16); ++l) {\n lookupTable[j][k][l] = -1;\n }\n }\n }\n }\n }\n\n tickEvent.schedule(0);\n\n hits = 0;\n misses = 0;\n}\n\nvoid\nOptCPU::processSet(int set)\n{\n \/\/ Initialize cache\n int blks_in_cache = 0;\n RefIndex i = 0;\n cacheHeap.clear();\n cacheHeap.resize(assoc);\n\n while (blks_in_cache < assoc) {\n RefIndex cache_index = lookupValue(refInfo[set][i].addr);\n if (cache_index == -1) {\n \/\/ First reference to this block\n misses++;\n cache_index = blks_in_cache++;\n setValue(refInfo[set][i].addr, cache_index);\n } else {\n hits++;\n }\n \/\/ update cache heap to most recent reference\n cacheHeap[cache_index] = i;\n if (++i >= refInfo[set].size()) {\n return;\n }\n }\n for (int start = assoc\/2; start >= 0; --start) {\n heapify(set,start);\n }\n verifyHeap(set,0);\n\n for (; i < refInfo[set].size(); ++i) {\n RefIndex cache_index = lookupValue(refInfo[set][i].addr);\n if (cache_index == -1) {\n \/\/ miss\n misses++;\n \/\/ replace from cacheHeap[0]\n \/\/ mark replaced block as absent\n setValue(refInfo[set][cacheHeap[0]].addr, -1);\n cacheHeap[0] = i;\n heapify(set, 0);\n } else {\n \/\/ hit\n hits++;\n assert(refInfo[set][cacheHeap[cache_index]].addr ==\n refInfo[set][i].addr);\n assert(refInfo[set][cacheHeap[cache_index]].nextRefTime == i);\n assert(heapLeft(cache_index) >= assoc);\n }\n cacheHeap[cache_index] = i;\n processRankIncrease(set, cache_index);\n }\n}\nvoid\nOptCPU::tick()\n{\n \/\/ Do opt simulation\n\n int references = 0;\n for (int set = 0; set < numSets; ++set) {\n if (!refInfo[set].empty()) {\n processSet(set);\n }\n references += refInfo[set].size();\n }\n \/\/ exit;\n fprintf(stderr, \"OPT Misses: %d\\nOPT Hits: %d\\nOPT Accesses: %d\\n\",\n misses, hits, references);\n new SimExitEvent(\"Finshed Memory Trace\");\n}\n\nvoid\nOptCPU::initTable(Addr addr, RefIndex index)\n{\n int l1_index = (addr >> 32) & 0x0f;\n int l2_index = (addr >> 16) & 0xffff;\n assert(l1_index == addr >> 32);\n if (lookupTable[l1_index].size() != (1<<16)) {\n lookupTable[l1_index].resize(1<<16);\n }\n if (lookupTable[l1_index][l2_index].size() != (1<<16)) {\n lookupTable[l1_index][l2_index].resize(1<<16, index);\n }\n}\n\nOptCPU::TickEvent::TickEvent(OptCPU *c)\n : Event(&mainEventQueue, CPU_Tick_Pri), cpu(c)\n{\n}\n\nvoid\nOptCPU::TickEvent::process()\n{\n cpu->tick();\n}\n\nconst char *\nOptCPU::TickEvent::description()\n{\n return \"OptCPU tick event\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(OptCPU)\n\n SimObjectParam<MemTraceReader *> data_trace;\n Param<int> size;\n Param<int> block_size;\nParam<int> assoc;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(OptCPU)\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(OptCPU)\n\n INIT_PARAM_DFLT(data_trace, \"memory trace\", NULL),\n INIT_PARAM(size, \"cache size\"),\n INIT_PARAM(block_size, \"block size\"),\n INIT_PARAM(assoc,\"associativity\")\n\nEND_INIT_SIM_OBJECT_PARAMS(OptCPU)\n\nCREATE_SIM_OBJECT(OptCPU)\n{\n return new OptCPU(getInstanceName(),\n data_trace,\n block_size,\n size,\n assoc);\n}\n\nREGISTER_SIM_OBJECT(\"OptCPU\", OptCPU)\n<commit_msg>Make printouts look more like stats.<commit_after>\n\/*\n * Copyright (c) 2004 The Regents of The University of Michigan\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met: redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer;\n * redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution;\n * neither the name of the copyright holders nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n\/**\n * @file\n * Definition of a memory trace CPU object for optimal caches. Uses a memory\n * trace to access a fully associative cache with optimal replacement.\n *\/\n\n#include <algorithm> \/\/ For heap functions.\n\n#include \"cpu\/trace\/opt_cpu.hh\"\n#include \"cpu\/trace\/reader\/mem_trace_reader.hh\"\n\n#include \"sim\/builder.hh\"\n#include \"sim\/sim_events.hh\"\n\nusing namespace std;\n\nOptCPU::OptCPU(const string &name,\n MemTraceReader *_trace,\n int block_size,\n int cache_size,\n int _assoc)\n : BaseCPU(name,1), tickEvent(this), trace(_trace),\n numBlks(cache_size\/block_size), assoc(_assoc), numSets(numBlks\/assoc),\n setMask(numSets - 1)\n{\n int log_block_size = (int)(log((double) block_size)\/log(2.0));\n MemReqPtr req;\n trace->getNextReq(req);\n refInfo.resize(numSets);\n while (req) {\n RefInfo temp;\n temp.addr = req->paddr >> log_block_size;\n int set = temp.addr & setMask;\n refInfo[set].push_back(temp);\n trace->getNextReq(req);\n }\n\n \/\/ Initialize top level of lookup table.\n lookupTable.resize(16);\n\n \/\/ Annotate references with next ref time.\n for (int k = 0; k < numSets; ++k) {\n for (RefIndex i = refInfo[k].size() - 1; i >= 0; --i) {\n Addr addr = refInfo[k][i].addr;\n initTable(addr, InfiniteRef);\n refInfo[k][i].nextRefTime = lookupValue(addr);\n setValue(addr, i);\n }\n }\n\n \/\/ Reset the lookup table\n for (int j = 0; j < 16; ++j) {\n if (lookupTable[j].size() == (1<<16)) {\n for (int k = 0; k < (1<<16); ++k) {\n if (lookupTable[j][k].size() == (1<<16)) {\n for (int l = 0; l < (1<<16); ++l) {\n lookupTable[j][k][l] = -1;\n }\n }\n }\n }\n }\n\n tickEvent.schedule(0);\n\n hits = 0;\n misses = 0;\n}\n\nvoid\nOptCPU::processSet(int set)\n{\n \/\/ Initialize cache\n int blks_in_cache = 0;\n RefIndex i = 0;\n cacheHeap.clear();\n cacheHeap.resize(assoc);\n\n while (blks_in_cache < assoc) {\n RefIndex cache_index = lookupValue(refInfo[set][i].addr);\n if (cache_index == -1) {\n \/\/ First reference to this block\n misses++;\n cache_index = blks_in_cache++;\n setValue(refInfo[set][i].addr, cache_index);\n } else {\n hits++;\n }\n \/\/ update cache heap to most recent reference\n cacheHeap[cache_index] = i;\n if (++i >= refInfo[set].size()) {\n return;\n }\n }\n for (int start = assoc\/2; start >= 0; --start) {\n heapify(set,start);\n }\n verifyHeap(set,0);\n\n for (; i < refInfo[set].size(); ++i) {\n RefIndex cache_index = lookupValue(refInfo[set][i].addr);\n if (cache_index == -1) {\n \/\/ miss\n misses++;\n \/\/ replace from cacheHeap[0]\n \/\/ mark replaced block as absent\n setValue(refInfo[set][cacheHeap[0]].addr, -1);\n cacheHeap[0] = i;\n heapify(set, 0);\n } else {\n \/\/ hit\n hits++;\n assert(refInfo[set][cacheHeap[cache_index]].addr ==\n refInfo[set][i].addr);\n assert(refInfo[set][cacheHeap[cache_index]].nextRefTime == i);\n assert(heapLeft(cache_index) >= assoc);\n }\n cacheHeap[cache_index] = i;\n processRankIncrease(set, cache_index);\n }\n}\nvoid\nOptCPU::tick()\n{\n \/\/ Do opt simulation\n\n int references = 0;\n for (int set = 0; set < numSets; ++set) {\n if (!refInfo[set].empty()) {\n processSet(set);\n }\n references += refInfo[set].size();\n }\n \/\/ exit;\n fprintf(stderr,\"sys.cpu.misses %d #opt cache misses\\n\",misses);\n fprintf(stderr,\"sys.cpu.hits %d #opt cache hits\\n\", hits);\n fprintf(stderr,\"sys.cpu.accesses %d #opt cache acceses\\n\", references);\n new SimExitEvent(\"Finshed Memory Trace\");\n}\n\nvoid\nOptCPU::initTable(Addr addr, RefIndex index)\n{\n int l1_index = (addr >> 32) & 0x0f;\n int l2_index = (addr >> 16) & 0xffff;\n assert(l1_index == addr >> 32);\n if (lookupTable[l1_index].size() != (1<<16)) {\n lookupTable[l1_index].resize(1<<16);\n }\n if (lookupTable[l1_index][l2_index].size() != (1<<16)) {\n lookupTable[l1_index][l2_index].resize(1<<16, index);\n }\n}\n\nOptCPU::TickEvent::TickEvent(OptCPU *c)\n : Event(&mainEventQueue, CPU_Tick_Pri), cpu(c)\n{\n}\n\nvoid\nOptCPU::TickEvent::process()\n{\n cpu->tick();\n}\n\nconst char *\nOptCPU::TickEvent::description()\n{\n return \"OptCPU tick event\";\n}\n\n\nBEGIN_DECLARE_SIM_OBJECT_PARAMS(OptCPU)\n\n SimObjectParam<MemTraceReader *> data_trace;\n Param<int> size;\n Param<int> block_size;\nParam<int> assoc;\n\nEND_DECLARE_SIM_OBJECT_PARAMS(OptCPU)\n\nBEGIN_INIT_SIM_OBJECT_PARAMS(OptCPU)\n\n INIT_PARAM_DFLT(data_trace, \"memory trace\", NULL),\n INIT_PARAM(size, \"cache size\"),\n INIT_PARAM(block_size, \"block size\"),\n INIT_PARAM(assoc,\"associativity\")\n\nEND_INIT_SIM_OBJECT_PARAMS(OptCPU)\n\nCREATE_SIM_OBJECT(OptCPU)\n{\n return new OptCPU(getInstanceName(),\n data_trace,\n block_size,\n size,\n assoc);\n}\n\nREGISTER_SIM_OBJECT(\"OptCPU\", OptCPU)\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2014 Benoit Steiner <benoit.steiner.goog@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#define EIGEN_USE_THREADS\n\n\n#include \"main.h\"\n#include <iostream>\n#include <Eigen\/CXX11\/Tensor>\n\nusing Eigen::Tensor;\nusing std::isnan;\n\nstatic void test_multithread_elementwise()\n{\n Tensor<float, 3> in1(2,3,7);\n Tensor<float, 3> in2(2,3,7);\n Tensor<float, 3> out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(3, 11));\n out.device(thread_pool_device) = in1 + in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\n\nstatic void test_multithread_compound_assignment()\n{\n Tensor<float, 3> in1(2,3,7);\n Tensor<float, 3> in2(2,3,7);\n Tensor<float, 3> out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(3, 11));\n out.device(thread_pool_device) = in1;\n out.device(thread_pool_device) += in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_multithread_contraction()\n{\n Tensor<float, 4, DataLayout> t_left(30, 50, 37, 31);\n Tensor<float, 5, DataLayout> t_right(37, 31, 70, 2, 10);\n Tensor<float, 5, DataLayout> t_result(30, 50, 70, 2, 10);\n\n t_left.setRandom();\n t_right.setRandom();\n\n \/\/ this contraction should be equivalent to a single matrix multiplication\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 2> dims({{DimPair(2, 0), DimPair(3, 1)}});\n\n typedef Map<Matrix<float, Dynamic, Dynamic, DataLayout>> MapXf;\n MapXf m_left(t_left.data(), 1500, 1147);\n MapXf m_right(t_right.data(), 1147, 1400);\n Matrix<float, Dynamic, Dynamic, DataLayout> m_result(1500, 1400);\n\n Eigen::ThreadPoolDevice thread_pool_device(4);\n\n \/\/ compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n VERIFY(&t_result.data()[i] != &m_result.data()[i]);\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_contraction_corner_cases()\n{\n Tensor<float, 2, DataLayout> t_left(32, 500);\n Tensor<float, 2, DataLayout> t_right(32, 28*28);\n Tensor<float, 2, DataLayout> t_result(500, 28*28);\n\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result = t_result.constant(NAN);\n\n \/\/ this contraction should be equivalent to a single matrix multiplication\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 1> dims{{DimPair(0, 0)}};\n\n typedef Map<Matrix<float, Dynamic, Dynamic, DataLayout>> MapXf;\n MapXf m_left(t_left.data(), 32, 500);\n MapXf m_right(t_right.data(), 32, 28*28);\n Matrix<float, Dynamic, Dynamic, DataLayout> m_result(500, 28*28);\n\n Eigen::ThreadPoolDevice thread_pool_device(12);\n\n \/\/ compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left.transpose() * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected at index \" << i << \" : \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_result.resize (1, 28*28);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 500);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (500, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 500);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (1, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_multithread_contraction_agrees_with_singlethread() {\n int contract_size = internal::random<int>(1, 5000);\n\n Tensor<float, 3, DataLayout> left(internal::random<int>(1, 80),\n contract_size,\n internal::random<int>(1, 100));\n\n Tensor<float, 4, DataLayout> right(internal::random<int>(1, 25),\n internal::random<int>(1, 37),\n contract_size,\n internal::random<int>(1, 51));\n\n left.setRandom();\n right.setRandom();\n\n \/\/ add constants to shift values away from 0 for more precision\n left += left.constant(1.5f);\n right += right.constant(1.5f);\n\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 1> dims({{DimPair(1, 2)}});\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(2, 11));\n\n Tensor<float, 5, DataLayout> st_result;\n st_result = left.contract(right, dims);\n\n Tensor<float, 5, DataLayout> tp_result(st_result.dimensions());\n tp_result.device(thread_pool_device) = left.contract(right, dims);\n\n VERIFY(dimensions_match(st_result.dimensions(), tp_result.dimensions()));\n for (ptrdiff_t i = 0; i < st_result.size(); i++) {\n \/\/ if both of the values are very small, then do nothing (because the test will fail\n \/\/ due to numerical precision issues when values are small)\n if (fabs(st_result.data()[i] - tp_result.data()[i]) >= 1e-4) {\n VERIFY_IS_APPROX(st_result.data()[i], tp_result.data()[i]);\n }\n }\n}\n\n\nstatic void test_memcpy() {\n\n for (int i = 0; i < 5; ++i) {\n const int num_threads = internal::random<int>(3, 11);\n Eigen::ThreadPoolDevice thread_pool_device(num_threads);\n\n const int size = internal::random<int>(13, 7632);\n Tensor<float, 1> t1(size);\n t1.setRandom();\n std::vector<float> result(size);\n thread_pool_device.memcpy(&result[0], t1.data(), size*sizeof(float));\n for (int i = 0; i < size; i++) {\n VERIFY_IS_EQUAL(t1(i), result[i]);\n }\n }\n}\n\n\nstatic void test_multithread_random()\n{\n Eigen::ThreadPoolDevice device(2);\n Tensor<float, 1> t(1 << 20);\n t.device(device) = t.random<Eigen::internal::NormalRandomGenerator<float>>();\n}\n\n\nvoid test_cxx11_tensor_thread_pool()\n{\n CALL_SUBTEST(test_multithread_elementwise());\n CALL_SUBTEST(test_multithread_compound_assignment());\n\n CALL_SUBTEST(test_multithread_contraction<ColMajor>());\n CALL_SUBTEST(test_multithread_contraction<RowMajor>());\n\n CALL_SUBTEST(test_multithread_contraction_agrees_with_singlethread<ColMajor>());\n CALL_SUBTEST(test_multithread_contraction_agrees_with_singlethread<RowMajor>());\n\n \/\/ Exercise various cases that have been problematic in the past.\n CALL_SUBTEST(test_contraction_corner_cases<ColMajor>());\n CALL_SUBTEST(test_contraction_corner_cases<RowMajor>());\n\n CALL_SUBTEST(test_memcpy());\n\n CALL_SUBTEST(test_multithread_random());\n}\n<commit_msg>Fixed compilation error<commit_after>\/\/ This file is part of Eigen, a lightweight C++ template library\n\/\/ for linear algebra.\n\/\/\n\/\/ Copyright (C) 2014 Benoit Steiner <benoit.steiner.goog@gmail.com>\n\/\/\n\/\/ This Source Code Form is subject to the terms of the Mozilla\n\/\/ Public License v. 2.0. If a copy of the MPL was not distributed\n\/\/ with this file, You can obtain one at http:\/\/mozilla.org\/MPL\/2.0\/.\n\n#define EIGEN_USE_THREADS\n\n\n#include \"main.h\"\n#include <iostream>\n#include <Eigen\/CXX11\/Tensor>\n\nusing Eigen::Tensor;\n\n\nstatic void test_multithread_elementwise()\n{\n Tensor<float, 3> in1(2,3,7);\n Tensor<float, 3> in2(2,3,7);\n Tensor<float, 3> out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(3, 11));\n out.device(thread_pool_device) = in1 + in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\n\nstatic void test_multithread_compound_assignment()\n{\n Tensor<float, 3> in1(2,3,7);\n Tensor<float, 3> in2(2,3,7);\n Tensor<float, 3> out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(3, 11));\n out.device(thread_pool_device) = in1;\n out.device(thread_pool_device) += in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_multithread_contraction()\n{\n Tensor<float, 4, DataLayout> t_left(30, 50, 37, 31);\n Tensor<float, 5, DataLayout> t_right(37, 31, 70, 2, 10);\n Tensor<float, 5, DataLayout> t_result(30, 50, 70, 2, 10);\n\n t_left.setRandom();\n t_right.setRandom();\n\n \/\/ this contraction should be equivalent to a single matrix multiplication\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 2> dims({{DimPair(2, 0), DimPair(3, 1)}});\n\n typedef Map<Matrix<float, Dynamic, Dynamic, DataLayout>> MapXf;\n MapXf m_left(t_left.data(), 1500, 1147);\n MapXf m_right(t_right.data(), 1147, 1400);\n Matrix<float, Dynamic, Dynamic, DataLayout> m_result(1500, 1400);\n\n Eigen::ThreadPoolDevice thread_pool_device(4);\n\n \/\/ compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n VERIFY(&t_result.data()[i] != &m_result.data()[i]);\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_contraction_corner_cases()\n{\n Tensor<float, 2, DataLayout> t_left(32, 500);\n Tensor<float, 2, DataLayout> t_right(32, 28*28);\n Tensor<float, 2, DataLayout> t_result(500, 28*28);\n\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result = t_result.constant(NAN);\n\n \/\/ this contraction should be equivalent to a single matrix multiplication\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 1> dims{{DimPair(0, 0)}};\n\n typedef Map<Matrix<float, Dynamic, Dynamic, DataLayout>> MapXf;\n MapXf m_left(t_left.data(), 32, 500);\n MapXf m_right(t_right.data(), 32, 28*28);\n Matrix<float, Dynamic, Dynamic, DataLayout> m_result(500, 28*28);\n\n Eigen::ThreadPoolDevice thread_pool_device(12);\n\n \/\/ compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left.transpose() * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!std::isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected at index \" << i << \" : \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_result.resize (1, 28*28);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!std::isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 500);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (500, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 500);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!std::isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (1, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!std::isnan(t_result.data()[i]));\n if (fabs(t_result.data()[i] - m_result.data()[i]) >= 1e-4) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n}\n\ntemplate<int DataLayout>\nstatic void test_multithread_contraction_agrees_with_singlethread() {\n int contract_size = internal::random<int>(1, 5000);\n\n Tensor<float, 3, DataLayout> left(internal::random<int>(1, 80),\n contract_size,\n internal::random<int>(1, 100));\n\n Tensor<float, 4, DataLayout> right(internal::random<int>(1, 25),\n internal::random<int>(1, 37),\n contract_size,\n internal::random<int>(1, 51));\n\n left.setRandom();\n right.setRandom();\n\n \/\/ add constants to shift values away from 0 for more precision\n left += left.constant(1.5f);\n right += right.constant(1.5f);\n\n typedef Tensor<float, 1>::DimensionPair DimPair;\n Eigen::array<DimPair, 1> dims({{DimPair(1, 2)}});\n\n Eigen::ThreadPoolDevice thread_pool_device(internal::random<int>(2, 11));\n\n Tensor<float, 5, DataLayout> st_result;\n st_result = left.contract(right, dims);\n\n Tensor<float, 5, DataLayout> tp_result(st_result.dimensions());\n tp_result.device(thread_pool_device) = left.contract(right, dims);\n\n VERIFY(dimensions_match(st_result.dimensions(), tp_result.dimensions()));\n for (ptrdiff_t i = 0; i < st_result.size(); i++) {\n \/\/ if both of the values are very small, then do nothing (because the test will fail\n \/\/ due to numerical precision issues when values are small)\n if (fabs(st_result.data()[i] - tp_result.data()[i]) >= 1e-4) {\n VERIFY_IS_APPROX(st_result.data()[i], tp_result.data()[i]);\n }\n }\n}\n\n\nstatic void test_memcpy() {\n\n for (int i = 0; i < 5; ++i) {\n const int num_threads = internal::random<int>(3, 11);\n Eigen::ThreadPoolDevice thread_pool_device(num_threads);\n\n const int size = internal::random<int>(13, 7632);\n Tensor<float, 1> t1(size);\n t1.setRandom();\n std::vector<float> result(size);\n thread_pool_device.memcpy(&result[0], t1.data(), size*sizeof(float));\n for (int i = 0; i < size; i++) {\n VERIFY_IS_EQUAL(t1(i), result[i]);\n }\n }\n}\n\n\nstatic void test_multithread_random()\n{\n Eigen::ThreadPoolDevice device(2);\n Tensor<float, 1> t(1 << 20);\n t.device(device) = t.random<Eigen::internal::NormalRandomGenerator<float>>();\n}\n\n\nvoid test_cxx11_tensor_thread_pool()\n{\n CALL_SUBTEST(test_multithread_elementwise());\n CALL_SUBTEST(test_multithread_compound_assignment());\n\n CALL_SUBTEST(test_multithread_contraction<ColMajor>());\n CALL_SUBTEST(test_multithread_contraction<RowMajor>());\n\n CALL_SUBTEST(test_multithread_contraction_agrees_with_singlethread<ColMajor>());\n CALL_SUBTEST(test_multithread_contraction_agrees_with_singlethread<RowMajor>());\n\n \/\/ Exercise various cases that have been problematic in the past.\n CALL_SUBTEST(test_contraction_corner_cases<ColMajor>());\n CALL_SUBTEST(test_contraction_corner_cases<RowMajor>());\n\n CALL_SUBTEST(test_memcpy());\n\n CALL_SUBTEST(test_multithread_random());\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"core\/reactor.hh\"\n#include \"core\/app-template.hh\"\n#include \"message\/messaging_service.hh\"\n#include \"gms\/failure_detector.hh\"\n#include \"gms\/gossiper.hh\"\n\nnamespace bpo = boost::program_options;\n\nint main(int ac, char ** av) {\n app_template app;\n app.add_options()\n (\"seed\", bpo::value<std::vector<std::string>>(), \"IP address of seed node\");\n return app.run(ac, av, [&] {\n net::get_messaging_service().start().then([&] {\n gms::get_failure_detector().start_single().then([&] {\n gms::get_gossiper().start_single().then([&] {\n auto&& config = app.configuration();\n std::set<gms::inet_address> seeds;\n for (auto s : config[\"seed\"].as<std::vector<std::string>>()) {\n seeds.emplace(std::move(s));\n }\n\n std::cout << \"Start gossiper service ...\\n\";\n auto& gossiper = gms::get_local_gossiper();\n gossiper.set_seeds(std::move(seeds));\n int generation_number = 1;\n gossiper.start(generation_number);\n });\n });\n });\n });\n}\n<commit_msg>tests: Allow gossip to listen on a specific IP address<commit_after>#include \"core\/reactor.hh\"\n#include \"core\/app-template.hh\"\n#include \"message\/messaging_service.hh\"\n#include \"gms\/failure_detector.hh\"\n#include \"gms\/gossiper.hh\"\n\nnamespace bpo = boost::program_options;\n\nint main(int ac, char ** av) {\n app_template app;\n app.add_options()\n (\"seed\", bpo::value<std::vector<std::string>>(), \"IP address of seed node\")\n (\"listen-address\", bpo::value<std::string>()->default_value(\"0.0.0.0\"), \"IP address to listen\");\n return app.run(ac, av, [&] {\n auto&& config = app.configuration();\n auto listen = gms::inet_address(config[\"listen-address\"].as<std::string>());\n net::get_messaging_service().start(std::ref(listen)).then([&] {\n auto& server = net::get_local_messaging_service();\n auto min = server.port_min();\n auto max = server.port_max();\n auto listen = server.listen_address();\n print(\"Messaging server listening on ip %s ports %d to %d ...\\n\", listen, min, max);\n gms::get_failure_detector().start_single().then([&] {\n gms::get_gossiper().start_single().then([&] {\n auto&& config = app.configuration();\n std::set<gms::inet_address> seeds;\n for (auto s : config[\"seed\"].as<std::vector<std::string>>()) {\n seeds.emplace(std::move(s));\n }\n\n std::cout << \"Start gossiper service ...\\n\";\n auto& gossiper = gms::get_local_gossiper();\n gossiper.set_seeds(std::move(seeds));\n int generation_number = 1;\n gossiper.start(generation_number);\n });\n });\n });\n });\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"noise.hpp\"\n\n\/* template<typename result_type> result_type perlin::noise(\n\tresult_type x,\n\tdecltype(x) y,\n\tdecltype(x) z\n) *\/\n\n\/*template<typename result_type>\nresult_type perlin::fade(result_type t)\n\ntemplate<typename result_type> result_type perlin::lerp(\n\tresult_type t,\n\tdecltype(t) a,\n\tdecltype(t) b\n)\n\ntemplate<typename result_type> result_type perlin::grad(\n\tint hash,\n\tresult_type x,\n\tdecltype(x) y,\n\tdecltype(x) z\n)*\/\n<commit_msg>Delete noise.cpp<commit_after><|endoftext|>"} {"text":"<commit_before>#pragma once\n\n#include <vector>\n#include <tudocomp\/def.hpp>\n#include <tudocomp\/ds\/IntVector.hpp>\n#include <tudocomp\/Algorithm.hpp>\n\nnamespace tdc {\nnamespace lcpcomp {\n\n\/**\n * Decodes lcpcomp compressed data as described in the paper.\n * It creates an array of dynamic arrays. Each dynamic array stores in\n * the first element its size. On appending a new element, the dynamic array\n * gets resized by one (instead of doubling). This helps to keep the memory footprint low.\n * It can be faster than \\ref ScanDec if its \"scans\"-value too small.\n *\/\nclass CompactDec : public Algorithm {\npublic:\n inline static Meta meta() {\n Meta m(\"lcpcomp_dec\", \"compact\");\n return m;\n\n }\n inline void decode_lazy() const {\n }\n inline void decode_eagerly() const {\n }\n\nprivate:\n len_compact_t** m_fwd;\n\n len_t m_cursor;\n IF_STATS(len_t m_longest_chain);\n IF_STATS(len_t m_current_chain);\n\n IntVector<uliteral_t> m_buffer;\n\n inline void decode_literal_at(len_t pos, uliteral_t c) {\n\t\tIF_STATS(++m_current_chain);\n IF_STATS(m_longest_chain = std::max(m_longest_chain, m_current_chain));\n\n m_buffer[pos] = c;\n\t\tDCHECK(c != 0 || pos == m_buffer.size()-1); \/\/ we assume that the text to restore does not contain a NULL-byte but at its very end\n\n if(m_fwd[pos] != nullptr) {\n const len_compact_t*const& bucket = m_fwd[pos];\n for(size_t i = 1; i < bucket[0]; ++i) {\n decode_literal_at(bucket[i], c); \/\/ recursion\n }\n delete [] m_fwd[pos];\n m_fwd[pos] = nullptr;\n }\n\n IF_STATS(--m_current_chain);\n }\n\npublic:\n CompactDec(CompactDec&& other):\n Algorithm(std::move(*this)),\n m_fwd(std::move(other.m_fwd)),\n m_cursor(std::move(other.m_cursor)),\n m_buffer(std::move(other.m_buffer))\n {\n IF_STATS(m_longest_chain = std::move(other.m_longest_chain));\n IF_STATS(m_current_chain = std::move(other.m_current_chain));\n\n other.m_fwd = nullptr;\n }\n\n ~CompactDec() {\n if(m_fwd != nullptr) {\n for(size_t i = 0; i < m_buffer.size(); ++i) {\n if(m_fwd[i] == nullptr) continue;\n delete [] m_fwd[i];\n }\n delete [] m_fwd;\n }\n }\n inline CompactDec(Env&& env, len_t size)\n : Algorithm(std::move(env)), m_cursor(0), m_buffer(size,0) {\n\n IF_STATS(m_longest_chain = 0);\n IF_STATS(m_current_chain = 0);\n\n m_fwd = new len_compact_t*[size];\n std::fill(m_fwd,m_fwd+size,nullptr);\n }\n\n inline void decode_literal(uliteral_t c) {\n decode_literal_at(m_cursor++, c);\n }\n\n inline void decode_factor(len_t pos, len_t num) {\n for(len_t i = 0; i < num; i++) {\n len_t src = pos+i;\n if(m_buffer[src]) {\n decode_literal_at(m_cursor, m_buffer[src]);\n } else {\n len_compact_t*& bucket = m_fwd[src];\n if(bucket == nullptr) {\n bucket = new len_compact_t[2];\n DCHECK(m_fwd[src] == bucket);\n bucket[0] = 2;\n\t\t\t\t\tbucket[1] = m_cursor;\n }\n\t\t\t\telse\n { \/\/ this block implements the call of m_fwd[src]->push_back(m_cursor);\n\t\t\t\t\t++bucket[0]; \/\/ increase the size of a bucket only by one!\n\t\t\t\t\tbucket = (len_compact_t*) realloc(bucket, sizeof(len_compact_t)*bucket[0]);\n bucket[bucket[0]-1] = m_cursor;\n }\n }\n\n ++m_cursor;\n }\n }\n\n IF_STATS(\n inline len_t longest_chain() const {\n return m_longest_chain;\n })\n\n inline void write_to(std::ostream& out) const {\n for(auto c : m_buffer) out << c;\n }\n};\n\n}} \/\/ns\n\n<commit_msg>fix undefined behavior in CompactDec.hpp<commit_after>#pragma once\n\n#include <vector>\n#include <tudocomp\/def.hpp>\n#include <tudocomp\/ds\/IntVector.hpp>\n#include <tudocomp\/Algorithm.hpp>\n\nnamespace tdc {\nnamespace lcpcomp {\n\n\/**\n * Decodes lcpcomp compressed data as described in the paper.\n * It creates an array of dynamic arrays. Each dynamic array stores in\n * the first element its size. On appending a new element, the dynamic array\n * gets resized by one (instead of doubling). This helps to keep the memory footprint low.\n * It can be faster than \\ref ScanDec if its \"scans\"-value too small.\n *\/\nclass CompactDec : public Algorithm {\npublic:\n inline static Meta meta() {\n Meta m(\"lcpcomp_dec\", \"compact\");\n return m;\n\n }\n inline void decode_lazy() const {\n }\n inline void decode_eagerly() const {\n }\n\nprivate:\n len_compact_t** m_fwd;\n\n len_t m_cursor;\n IF_STATS(len_t m_longest_chain);\n IF_STATS(len_t m_current_chain);\n\n IntVector<uliteral_t> m_buffer;\n\n inline void decode_literal_at(len_t pos, uliteral_t c) {\n\t\tIF_STATS(++m_current_chain);\n IF_STATS(m_longest_chain = std::max(m_longest_chain, m_current_chain));\n\n m_buffer[pos] = c;\n\t\tDCHECK(c != 0 || pos == m_buffer.size()-1); \/\/ we assume that the text to restore does not contain a NULL-byte but at its very end\n\n if(m_fwd[pos] != nullptr) {\n const len_compact_t*const& bucket = m_fwd[pos];\n for(size_t i = 1; i < bucket[0]; ++i) {\n decode_literal_at(bucket[i], c); \/\/ recursion\n }\n free(m_fwd[pos]);\n m_fwd[pos] = nullptr;\n }\n\n IF_STATS(--m_current_chain);\n }\n\npublic:\n CompactDec(CompactDec&& other):\n Algorithm(std::move(*this)),\n m_fwd(std::move(other.m_fwd)),\n m_cursor(std::move(other.m_cursor)),\n m_buffer(std::move(other.m_buffer))\n {\n IF_STATS(m_longest_chain = std::move(other.m_longest_chain));\n IF_STATS(m_current_chain = std::move(other.m_current_chain));\n\n other.m_fwd = nullptr;\n }\n\n ~CompactDec() {\n if(m_fwd != nullptr) {\n for(size_t i = 0; i < m_buffer.size(); ++i) {\n if(m_fwd[i] == nullptr) continue;\n free(m_fwd[i]);\n }\n delete [] m_fwd;\n }\n }\n inline CompactDec(Env&& env, len_t size)\n : Algorithm(std::move(env)), m_cursor(0), m_buffer(size,0) {\n\n IF_STATS(m_longest_chain = 0);\n IF_STATS(m_current_chain = 0);\n\n m_fwd = new len_compact_t*[size];\n std::fill(m_fwd,m_fwd+size,nullptr);\n }\n\n inline void decode_literal(uliteral_t c) {\n decode_literal_at(m_cursor++, c);\n }\n\n inline void decode_factor(len_t pos, len_t num) {\n for(len_t i = 0; i < num; i++) {\n len_t src = pos+i;\n if(m_buffer[src]) {\n decode_literal_at(m_cursor, m_buffer[src]);\n } else {\n len_compact_t*& bucket = m_fwd[src];\n if(bucket == nullptr) {\n bucket = (len_compact_t*) malloc(sizeof(len_compact_t) * 2);\n DCHECK(m_fwd[src] == bucket);\n bucket[0] = 2;\n\t\t\t\t\tbucket[1] = m_cursor;\n }\n\t\t\t\telse\n { \/\/ this block implements the call of m_fwd[src]->push_back(m_cursor);\n\t\t\t\t\t++bucket[0]; \/\/ increase the size of a bucket only by one!\n\t\t\t\t\tbucket = (len_compact_t*) realloc(bucket, sizeof(len_compact_t)*bucket[0]);\n bucket[bucket[0]-1] = m_cursor;\n }\n }\n\n ++m_cursor;\n }\n }\n\n IF_STATS(\n inline len_t longest_chain() const {\n return m_longest_chain;\n })\n\n inline void write_to(std::ostream& out) const {\n for(auto c : m_buffer) out << c;\n }\n};\n\n}} \/\/ns\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"vtrc-server\/vtrc-application.h\"\n#include \"vtrc-server\/vtrc-channels.h\"\n\n#include \"vtrc-common\/vtrc-pool-pair.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n#include \"vtrc-common\/vtrc-rpc-service-wrapper.h\"\n\n#include \"protocol\/calculator.pb.h\"\n\n#include \"vtrc-listener-tcp.h\"\n#include \"vtrc-listener-unix-local.h\"\n#include \"vtrc-listener-win-pipe.h\"\n\n#include \"vtrc-memory.h\"\n\n#include <math.h>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace vtrc::server;\nusing namespace vtrc::common;\n\nclass calculator_impl: public vtrc_example::calculator {\n\n application &app_;\n connection_iface *client_;\n vtrc::unique_ptr<rpc_channel> client_channel_;\n\n static rpc_channel *client_channel( connection_iface *client )\n {\n return channels\n ::unicast\n ::create_callback_channel(client->shared_from_this( ));\n }\n\npublic:\n\n calculator_impl( application &app, connection_iface *client )\n :app_(app)\n ,client_(client)\n ,client_channel_(client_channel(client_))\n { }\n\nprivate:\n\n typedef std::pair<double, double> number_pair;\n\n double request_client_variable( const std::string &name ) const\n {\n vtrc_example::variable_pool_Stub stub(client_channel_.get( ));\n vtrc_example::number num;\n num.set_name( name );\n stub.get_variable( NULL, &num, &num, NULL );\n return num.value( );\n }\n\n number_pair extract_number( const vtrc_example::number_pair* req ) const\n {\n std::pair<double, double> result;\n\n if( req->first( ).has_value( ) ) result.first = req->first( ).value( );\n else result.first = request_client_variable( req->first( ).name( ) );\n\n if( req->second( ).has_value( )) result.second = req->second( ).value();\n else result.second = request_client_variable( req->second( ).name( ) );\n\n return result;\n }\n\n void sum(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n\n number_pair req = extract_number( request );\n response->set_value( req.first + req.second );\n\n }\n void mul(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n response->set_value( req.first * req.second );\n\n }\n void div(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n\n if( req.second == 0 )\n throw std::logic_error( \"Division by zero. =(\" );\n\n response->set_value( req.first \/ req.second );\n\n }\n\n void pow(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n response->set_value( ::pow(req.first, req.second) );\n }\n};\n\nclass my_rpc_wrapper: public rpc_service_wrapper\n{\npublic:\n my_rpc_wrapper( google::protobuf::Service *my_serv )\n :rpc_service_wrapper(my_serv)\n { }\n};\n\nclass server_application: public application {\npublic:\n server_application( pool_pair &pair )\n :application( pair )\n {}\n vtrc::shared_ptr<rpc_service_wrapper>\n get_service_by_name( connection_iface* connection,\n const std::string &service_name )\n {\n static const std::string calculator_name =\n calculator_impl::descriptor( )->full_name( );\n\n if( calculator_name == service_name )\n return vtrc::make_shared<my_rpc_wrapper>(\n new calculator_impl( *this, connection ) );\n\n return vtrc::shared_ptr<my_rpc_wrapper>();\n }\n};\n\nvoid usage( )\n{\n std::cout\n << \"Usage: \\n\\tcalculator_server <server ip> <server port>\\n\"\n << \"or:\\n\\tcalculator_server <localname>\\n\"\n << \"examples:\\n\"\n << \"\\tfor tcp: calculator_server 0.0.0.0 55555\\n\"\n << \"\\tfor unix: calculator_server \/tmp\/calculator.sock\\n\"\n << \"\\tfor win pipe: calculator_server \\\\\\\\.\\\\pipe\\\\calculator_pipe\\n\";\n}\n\nint main( int argc, char **argv ) try\n{\n if( argc < 2 ) {\n usage( );\n return 1;\n }\n pool_pair pp(1, 1);\n server_application app( pp );\n\n vtrc::shared_ptr<listener> main_listener;\n\n if( argc < 3 ) {\n#ifndef _WIN32\n main_listener = listeners::unix_local::create(app, argv[1]);\n#else\n main_listener = listeners::win_pipe::create(app, argv[1]);\n#endif\n } else {\n main_listener = listeners::tcp::create(app, argv[1],\n boost::lexical_cast<unsigned short>(argv[2]));\n }\n\n std::cout << \"starting '\" << main_listener->name( ) << \"'...\";\n\n main_listener->start( );\n\n std::cout << \"success\\n\";\n\n pp.join_all( );\n\n return 0;\n\n} catch( const std::exception &ex ) {\n std::cout << \"General server error: \" << ex.what( ) << \"\\n\";\n return 2;\n}\n\n<commit_msg>examples\/<commit_after>#include <iostream>\n\n#include \"google\/protobuf\/descriptor.h\"\n\n#include \"vtrc-server\/vtrc-application.h\"\n#include \"vtrc-server\/vtrc-channels.h\"\n\n#include \"vtrc-common\/vtrc-pool-pair.h\"\n#include \"vtrc-common\/vtrc-closure-holder.h\"\n#include \"vtrc-common\/vtrc-rpc-service-wrapper.h\"\n\n#include \"protocol\/calculator.pb.h\"\n\n#include \"vtrc-listener-tcp.h\"\n#include \"vtrc-listener-unix-local.h\"\n#include \"vtrc-listener-win-pipe.h\"\n\n#include \"vtrc-memory.h\"\n\n#include <math.h>\n#include <boost\/lexical_cast.hpp>\n\nusing namespace vtrc::server;\nusing namespace vtrc::common;\n\n\/\/\/ calculator implementation\nclass calculator_impl: public vtrc_example::calculator {\n\n application &app_;\n connection_iface *client_;\n vtrc::unique_ptr<rpc_channel> client_channel_;\n\n static rpc_channel *client_channel( connection_iface *client )\n {\n return channels\n ::unicast\n ::create_callback_channel(client->shared_from_this( ));\n }\n\npublic:\n\n calculator_impl( application &app, connection_iface *client )\n :app_(app)\n ,client_(client)\n ,client_channel_(client_channel(client_))\n { }\n\nprivate:\n\n typedef std::pair<double, double> number_pair;\n\n double request_client_variable( const std::string &name ) const\n {\n vtrc_example::variable_pool_Stub stub(client_channel_.get( ));\n vtrc_example::number num;\n num.set_name( name );\n stub.get_variable( NULL, &num, &num, NULL );\n return num.value( );\n }\n\n number_pair extract_number( const vtrc_example::number_pair* req ) const\n {\n std::pair<double, double> result;\n\n if( req->first( ).has_value( ) ) result.first = req->first( ).value( );\n else result.first = request_client_variable( req->first( ).name( ) );\n\n if( req->second( ).has_value( )) result.second = req->second( ).value();\n else result.second = request_client_variable( req->second( ).name( ) );\n\n return result;\n }\n\n void sum(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n\n number_pair req = extract_number( request );\n response->set_value( req.first + req.second );\n\n }\n void mul(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n response->set_value( req.first * req.second );\n\n }\n void div(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n\n if( req.second == 0 )\n throw std::logic_error( \"Division by zero. =(\" );\n\n response->set_value( req.first \/ req.second );\n\n }\n\n void pow(::google::protobuf::RpcController* \/*controller*\/,\n const ::vtrc_example::number_pair* request,\n ::vtrc_example::number* response,\n ::google::protobuf::Closure* done)\n {\n closure_holder done_holder( done );\n number_pair req = extract_number( request );\n response->set_value( ::pow(req.first, req.second) );\n }\n};\n\n\/\/\/ just in case; rpc_service_wrapper can be used instead\nclass my_rpc_wrapper: public rpc_service_wrapper\n{\npublic:\n my_rpc_wrapper( google::protobuf::Service *my_serv )\n :rpc_service_wrapper(my_serv)\n { }\n};\n\nclass server_application: public application {\npublic:\n server_application( pool_pair &pair )\n :application( pair )\n {}\n vtrc::shared_ptr<rpc_service_wrapper>\n get_service_by_name( connection_iface* connection,\n const std::string &service_name )\n {\n static const std::string calculator_name =\n calculator_impl::descriptor( )->full_name( );\n\n if( calculator_name == service_name )\n return vtrc::make_shared<my_rpc_wrapper>(\n new calculator_impl( *this, connection ) );\n\n return vtrc::shared_ptr<my_rpc_wrapper>();\n }\n};\n\nvoid usage( )\n{\n std::cout\n << \"Usage: \\n\\tcalculator_server <server ip> <server port>\\n\"\n << \"or:\\n\\tcalculator_server <localname>\\n\"\n << \"examples:\\n\"\n << \"\\tfor tcp: calculator_server 0.0.0.0 55555\\n\"\n << \"\\tfor unix: calculator_server \/tmp\/calculator.sock\\n\"\n << \"\\tfor win pipe: calculator_server \\\\\\\\.\\\\pipe\\\\calculator_pipe\\n\";\n}\n\nint main( int argc, char **argv ) try\n{\n if( argc < 2 ) {\n usage( );\n return 1;\n }\n pool_pair pp(1, 1);\n server_application app( pp );\n\n vtrc::shared_ptr<listener> main_listener;\n\n if( argc < 3 ) {\n#ifndef _WIN32\n main_listener = listeners::unix_local::create(app, argv[1]);\n#else\n main_listener = listeners::win_pipe::create(app, argv[1]);\n#endif\n } else {\n main_listener = listeners::tcp::create(app, argv[1],\n boost::lexical_cast<unsigned short>(argv[2]));\n }\n\n std::cout << \"starting '\" << main_listener->name( ) << \"'...\";\n\n main_listener->start( );\n\n std::cout << \"success\\n\";\n\n pp.join_all( );\n\n return 0;\n\n} catch( const std::exception &ex ) {\n std::cout << \"General server error: \" << ex.what( ) << \"\\n\";\n return 2;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/**\n * @file llhints.cpp\n * @brief Hint popups for displaying context sensitive help in a UI overlay\n *\n * $LicenseInfo:firstyear=2000&license=viewerlgpl$\n * Second Life Viewer Source Code\n * Copyright (C) 2010, Linden Research, Inc.\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation;\n * version 2.1 of the License only.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n * \n * Linden Research, Inc., 945 Battery Street, San Francisco, CA 94111 USA\n * $\/LicenseInfo$\n *\/\n\n\n#include \"llviewerprecompiledheaders.h\" \/\/ must be first include\n\n#include \"llhints.h\"\n\n#include \"llbutton.h\"\n#include \"lltextbox.h\"\n#include \"llviewerwindow.h\"\n#include \"llviewercontrol.h\"\n#include \"lliconctrl.h\"\n#include \"llsdparam.h\"\n\nclass LLHintPopup : public LLPanel\n{\npublic:\n\n\ttypedef enum e_popup_direction\n\t{\n\t\tLEFT,\n\t\tTOP,\n\t\tRIGHT,\n\t\tBOTTOM,\n\t\tTOP_RIGHT\n\t} EPopupDirection;\n\n\tstruct PopupDirections : public LLInitParam::TypeValuesHelper<LLHintPopup::EPopupDirection, PopupDirections>\n\t{\n\t\tstatic void declareValues()\n\t\t{\n\t\t\tdeclare(\"left\", LLHintPopup::LEFT);\n\t\t\tdeclare(\"right\", LLHintPopup::RIGHT);\n\t\t\tdeclare(\"top\", LLHintPopup::TOP);\n\t\t\tdeclare(\"bottom\", LLHintPopup::BOTTOM);\n\t\t\tdeclare(\"top_right\", LLHintPopup::TOP_RIGHT);\n\t\t}\n\t};\n\n\tstruct TargetParams : public LLInitParam::Block<TargetParams>\n\t{\n\t\tMandatory<std::string>\ttarget;\n\t\tMandatory<EPopupDirection, PopupDirections> direction;\n\n\t\tTargetParams()\n\t\t:\ttarget(\"target\"),\n\t\t\tdirection(\"direction\")\n\t\t{}\n\t};\n\n\tstruct Params : public LLInitParam::Block<Params, LLPanel::Params>\n\t{\n\t\tMandatory<LLNotificationPtr>\tnotification;\n\t\tOptional<TargetParams>\t\t\ttarget_params;\n\t\tOptional<S32>\t\t\t\t\tdistance;\n\t\tOptional<LLUIImage*>\t\t\tleft_arrow,\n\t\t\t\t\t\t\t\t\t\tup_arrow,\n\t\t\t\t\t\t\t\t\t\tright_arrow,\n\t\t\t\t\t\t\t\t\t\tdown_arrow,\n\t\t\t\t\t\t\t\t\t\tlower_left_arrow,\n\t\t\t\t\t\t\t\t\t\thint_image;\n\t\t\t\t\n\t\tOptional<S32>\t\t\t\t\tleft_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tup_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tright_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tdown_arrow_offset;\n\t\tOptional<F32>\t\t\t\t\tfade_in_time,\n\t\t\t\t\t\t\t\t\t\tfade_out_time;\n\n\t\tParams()\n\t\t:\tdistance(\"distance\"),\n\t\t\tleft_arrow(\"left_arrow\"),\n\t\t\tup_arrow(\"up_arrow\"),\n\t\t\tright_arrow(\"right_arrow\"),\n\t\t\tdown_arrow(\"down_arrow\"),\n\t\t\tlower_left_arrow(\"lower_left_arrow\"),\n\t\t\thint_image(\"hint_image\"),\n\t\t\tleft_arrow_offset(\"left_arrow_offset\"),\n\t\t\tup_arrow_offset(\"up_arrow_offset\"),\n\t\t\tright_arrow_offset(\"right_arrow_offset\"),\n\t\t\tdown_arrow_offset(\"down_arrow_offset\"),\n\t\t\tfade_in_time(\"fade_in_time\"),\n\t\t\tfade_out_time(\"fade_out_time\")\n\t\t{}\n\t};\n\n\tLLHintPopup(const Params&);\n\n\t\/*virtual*\/ BOOL postBuild();\n\n\tvoid onClickClose() { hide(); LLNotifications::instance().cancel(mNotification); }\n\tvoid draw();\n\tvoid hide() { if(!mHidden) {mHidden = true; mFadeTimer.reset();} }\n\nprivate:\n\tLLNotificationPtr\tmNotification;\n\tstd::string\t\t\tmTarget;\n\tEPopupDirection\t\tmDirection;\n\tS32\t\t\t\t\tmDistance;\n\tLLUIImagePtr\t\tmArrowLeft,\n\t\t\t\t\t\tmArrowUp,\n\t\t\t\t\t\tmArrowRight,\n\t\t\t\t\t\tmArrowDown,\n\t\t\t\t\t\tmArrowDownAndLeft;\n\tS32\t\t\t\t\tmArrowLeftOffset,\n\t\t\t\t\t\tmArrowUpOffset,\n\t\t\t\t\t\tmArrowRightOffset,\n\t\t\t\t\t\tmArrowDownOffset;\n\tLLFrameTimer\t\tmFadeTimer;\n\tF32\t\t\t\t\tmFadeInTime,\n\t\t\t\t\t\tmFadeOutTime;\n\tbool\t\t\t\tmHidden;\n};\n\nstatic LLDefaultChildRegistry::Register<LLHintPopup> r(\"hint_popup\");\n\n\nLLHintPopup::LLHintPopup(const LLHintPopup::Params& p)\n:\tmNotification(p.notification),\n\tmDirection(TOP),\n\tmDistance(p.distance),\n\tmArrowLeft(p.left_arrow),\n\tmArrowUp(p.up_arrow),\n\tmArrowRight(p.right_arrow),\n\tmArrowDown(p.down_arrow),\n\tmArrowDownAndLeft(p.lower_left_arrow),\n\tmArrowLeftOffset(p.left_arrow_offset),\n\tmArrowUpOffset(p.up_arrow_offset),\n\tmArrowRightOffset(p.right_arrow_offset),\n\tmArrowDownOffset(p.down_arrow_offset),\n\tmHidden(false),\n\tmFadeInTime(p.fade_in_time),\n\tmFadeOutTime(p.fade_out_time),\n\tLLPanel(p)\n{\n\tif (p.target_params.isProvided())\n\t{\n\t\tmDirection = p.target_params.direction;\n\t\tmTarget = p.target_params.target;\n\t}\n\tif (p.hint_image.isProvided())\n\t{\n\t\tbuildFromFile(\"panel_hint_image.xml\", NULL, p);\n\t\tgetChild<LLIconCtrl>(\"hint_image\")->setImage(p.hint_image());\n\t}\n\telse\n\t{\n\t\tbuildFromFile( \"panel_hint.xml\", NULL, p);\n\t}\n}\n\nBOOL LLHintPopup::postBuild()\n{\n\tLLTextBox& hint_text = getChildRef<LLTextBox>(\"hint_text\");\n\thint_text.setText(mNotification->getMessage());\n\t\n\tgetChild<LLButton>(\"close\")->setClickedCallback(boost::bind(&LLHintPopup::onClickClose, this));\n\tgetChild<LLTextBox>(\"hint_title\")->setText(mNotification->getLabel());\n\n\tLLRect text_bounds = hint_text.getTextBoundingRect();\n\tS32 delta_height = text_bounds.getHeight() - hint_text.getRect().getHeight();\n\treshape(getRect().getWidth(), getRect().getHeight() + delta_height);\n\treturn TRUE;\n}\n\nvoid LLHintPopup::draw()\n{\n\tF32 alpha = 1.f;\n\tif (mHidden)\n\t{\n\t\talpha = clamp_rescale(mFadeTimer.getElapsedTimeF32(), 0.f, mFadeOutTime, 1.f, 0.f);\n\t\tif (alpha == 0.f)\n\t\t{\n\t\t\tdie();\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\talpha = clamp_rescale(mFadeTimer.getElapsedTimeF32(), 0.f, mFadeInTime, 0.f, 1.f);\n\t}\n\t\n\t{\tLLViewDrawContext context(alpha); \n\n\t\tif (mTarget.empty())\n\t\t{\n\t\t\t\/\/ just draw contents, no arrow, in default position\n\t\t\tLLPanel::draw();\n\t\t}\n\t\telse \n\t\t{\n\t\t\tLLView* targetp = LLHints::getHintTarget(mTarget).get();\n\t\t\tif (!targetp)\n\t\t\t{\n\t\t\t\t\/\/ target widget is no longer valid, go away\n\t\t\t\tdie();\n\t\t\t}\n\t\t\telse if (!targetp->isInVisibleChain()) \n\t\t\t{\n\t\t\t\t\/\/ if target is invisible, don't draw, but keep alive in case widget comes back\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tLLRect target_rect;\n\t\t\t\ttargetp->localRectToOtherView(targetp->getLocalRect(), &target_rect, getParent());\n\n\t\t\t\tLLRect my_local_rect = getLocalRect();\n\t\t\t\tLLRect my_rect;\n\t\t\t\tLLRect arrow_rect;\n\t\t\t\tLLUIImagePtr arrow_imagep;\n\n\t\t\t\tswitch(mDirection)\n\t\t\t\t{\n\t\t\t\tcase LEFT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mLeft - (my_local_rect.getWidth() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.getCenterY(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowRight)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mRight + mArrowRight->getWidth() \/ 2 + mArrowRightOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowRight->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowRight->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowRight;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase TOP:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.getCenterX(), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mTop + (my_local_rect.getHeight() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowDown)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.getCenterX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mBottom - mArrowDown->getHeight() \/ 2 + mArrowDownOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDown->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDown->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowDown;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase RIGHT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mRight + (my_local_rect.getWidth() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowLeft)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mLeft - mArrowLeft->getWidth() \/ 2 + mArrowLeftOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowLeft->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowLeft->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowLeft;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase BOTTOM:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.getCenterX(), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mBottom - (my_local_rect.getHeight() \/ 2 + mDistance),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowUp)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.getCenterX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mTop + mArrowUp->getHeight() \/ 2 + mArrowUpOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowUp->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowUp->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowUp;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase TOP_RIGHT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mRight + (my_local_rect.getWidth() \/ 2),\n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mTop + (my_local_rect.getHeight() \/ 2 + mDistance),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowDownAndLeft)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mLeft + mArrowDownAndLeft->getWidth() \/ 2 + mArrowLeftOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mBottom - mArrowDownAndLeft->getHeight() \/ 2 + mArrowDownOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDownAndLeft->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDownAndLeft->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowDownAndLeft;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsetShape(my_rect);\n\t\t\t\tLLPanel::draw();\n\n\t\t\t\tif (arrow_imagep) arrow_imagep->draw(arrow_rect, LLColor4(1.f, 1.f, 1.f, alpha));\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nLLRegistry<std::string, LLHandle<LLView> > LLHints::sTargetRegistry;\nstd::map<LLNotificationPtr, class LLHintPopup*> LLHints::sHints;\n\n\/\/static\nvoid LLHints::show(LLNotificationPtr hint)\n{\n\tLLHintPopup::Params p(LLUICtrlFactory::getDefaultParams<LLHintPopup>());\n\n\tLLParamSDParser parser;\n\tparser.readSD(hint->getPayload(), p, true);\n\tp.notification = hint;\n\n\tif (p.validateBlock())\n\t{\n\t\tLLHintPopup* popup = new LLHintPopup(p);\n\n\t\tsHints[hint] = popup;\n\n\t\tLLView* hint_holder = gViewerWindow->getHintHolder();\n\t\tif (hint_holder)\n\t\t{\n\t\t\thint_holder->addChild(popup);\n\t\t\tpopup->centerWithin(hint_holder->getLocalRect());\n\t\t}\n\t}\n}\n\n\/\/static\nvoid LLHints::hide(LLNotificationPtr hint)\n{\n\thint_map_t::iterator found_it = sHints.find(hint);\n\tif (found_it != sHints.end())\n\t{\n\t\tfound_it->second->hide();\n\t\tsHints.erase(found_it);\n\t}\n}\n\n\/\/static\nvoid LLHints::registerHintTarget(const std::string& name, LLHandle<LLView> target)\n{\n\tsTargetRegistry.defaultRegistrar().replace(name, target);\n}\n\n\/\/static \nLLHandle<LLView> LLHints::getHintTarget(const std::string& name)\n{\n\tLLHandle<LLView>* handlep = sTargetRegistry.getValue(name);\n\tif (handlep) \n\t{\n\t\treturn *handlep;\n\t}\n\telse\n\t{\n\t\treturn LLHandle<LLView>();\n\t}\n}\n\n\/\/static\nvoid LLHints::initClass()\n{\n\tsRegister.reference();\n\n\tLLControlVariablePtr control = gSavedSettings.getControl(\"EnableUIHints\");\n\tcontrol->getSignal()->connect(boost::bind(&showHints, _2));\n\tgViewerWindow->getHintHolder()->setVisible(control->getValue().asBoolean());\n\n}\n\n\/\/staic\nvoid LLHints::showHints(const LLSD& show)\n{\n\tbool visible = show.asBoolean();\n\tgViewerWindow->getHintHolder()->setVisible(visible);\n}\n<commit_msg>EXP-229 FIXED Double clicking x on UI hint crashes Skylight Viewer<commit_after>\/**\n * @file llhints.cpp\n * @brief Hint popups for displaying context sensitive help in a UI overlay\n *\n * $LicenseInfo:firstyear=2000&license=viewerlgpl$\n * Second Life Viewer Source Code\n * Copyright (C) 2010, Linden Research, Inc.\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation;\n * version 2.1 of the License only.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n * \n * Linden Research, Inc., 945 Battery Street, San Francisco, CA 94111 USA\n * $\/LicenseInfo$\n *\/\n\n\n#include \"llviewerprecompiledheaders.h\" \/\/ must be first include\n\n#include \"llhints.h\"\n\n#include \"llbutton.h\"\n#include \"lltextbox.h\"\n#include \"llviewerwindow.h\"\n#include \"llviewercontrol.h\"\n#include \"lliconctrl.h\"\n#include \"llsdparam.h\"\n\nclass LLHintPopup : public LLPanel\n{\npublic:\n\n\ttypedef enum e_popup_direction\n\t{\n\t\tLEFT,\n\t\tTOP,\n\t\tRIGHT,\n\t\tBOTTOM,\n\t\tTOP_RIGHT\n\t} EPopupDirection;\n\n\tstruct PopupDirections : public LLInitParam::TypeValuesHelper<LLHintPopup::EPopupDirection, PopupDirections>\n\t{\n\t\tstatic void declareValues()\n\t\t{\n\t\t\tdeclare(\"left\", LLHintPopup::LEFT);\n\t\t\tdeclare(\"right\", LLHintPopup::RIGHT);\n\t\t\tdeclare(\"top\", LLHintPopup::TOP);\n\t\t\tdeclare(\"bottom\", LLHintPopup::BOTTOM);\n\t\t\tdeclare(\"top_right\", LLHintPopup::TOP_RIGHT);\n\t\t}\n\t};\n\n\tstruct TargetParams : public LLInitParam::Block<TargetParams>\n\t{\n\t\tMandatory<std::string>\ttarget;\n\t\tMandatory<EPopupDirection, PopupDirections> direction;\n\n\t\tTargetParams()\n\t\t:\ttarget(\"target\"),\n\t\t\tdirection(\"direction\")\n\t\t{}\n\t};\n\n\tstruct Params : public LLInitParam::Block<Params, LLPanel::Params>\n\t{\n\t\tMandatory<LLNotificationPtr>\tnotification;\n\t\tOptional<TargetParams>\t\t\ttarget_params;\n\t\tOptional<S32>\t\t\t\t\tdistance;\n\t\tOptional<LLUIImage*>\t\t\tleft_arrow,\n\t\t\t\t\t\t\t\t\t\tup_arrow,\n\t\t\t\t\t\t\t\t\t\tright_arrow,\n\t\t\t\t\t\t\t\t\t\tdown_arrow,\n\t\t\t\t\t\t\t\t\t\tlower_left_arrow,\n\t\t\t\t\t\t\t\t\t\thint_image;\n\t\t\t\t\n\t\tOptional<S32>\t\t\t\t\tleft_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tup_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tright_arrow_offset,\n\t\t\t\t\t\t\t\t\t\tdown_arrow_offset;\n\t\tOptional<F32>\t\t\t\t\tfade_in_time,\n\t\t\t\t\t\t\t\t\t\tfade_out_time;\n\n\t\tParams()\n\t\t:\tdistance(\"distance\"),\n\t\t\tleft_arrow(\"left_arrow\"),\n\t\t\tup_arrow(\"up_arrow\"),\n\t\t\tright_arrow(\"right_arrow\"),\n\t\t\tdown_arrow(\"down_arrow\"),\n\t\t\tlower_left_arrow(\"lower_left_arrow\"),\n\t\t\thint_image(\"hint_image\"),\n\t\t\tleft_arrow_offset(\"left_arrow_offset\"),\n\t\t\tup_arrow_offset(\"up_arrow_offset\"),\n\t\t\tright_arrow_offset(\"right_arrow_offset\"),\n\t\t\tdown_arrow_offset(\"down_arrow_offset\"),\n\t\t\tfade_in_time(\"fade_in_time\"),\n\t\t\tfade_out_time(\"fade_out_time\")\n\t\t{}\n\t};\n\n\tLLHintPopup(const Params&);\n\n\t\/*virtual*\/ BOOL postBuild();\n\n\tvoid onClickClose() \n\t{ \n\t\tif (!mHidden) \n\t\t{\n\t\t\thide(); \n\t\t\tLLNotifications::instance().cancel(mNotification);\n\t\t}\n\t}\n\tvoid draw();\n\tvoid hide() { if(!mHidden) {mHidden = true; mFadeTimer.reset();} }\n\nprivate:\n\tLLNotificationPtr\tmNotification;\n\tstd::string\t\t\tmTarget;\n\tEPopupDirection\t\tmDirection;\n\tS32\t\t\t\t\tmDistance;\n\tLLUIImagePtr\t\tmArrowLeft,\n\t\t\t\t\t\tmArrowUp,\n\t\t\t\t\t\tmArrowRight,\n\t\t\t\t\t\tmArrowDown,\n\t\t\t\t\t\tmArrowDownAndLeft;\n\tS32\t\t\t\t\tmArrowLeftOffset,\n\t\t\t\t\t\tmArrowUpOffset,\n\t\t\t\t\t\tmArrowRightOffset,\n\t\t\t\t\t\tmArrowDownOffset;\n\tLLFrameTimer\t\tmFadeTimer;\n\tF32\t\t\t\t\tmFadeInTime,\n\t\t\t\t\t\tmFadeOutTime;\n\tbool\t\t\t\tmHidden;\n};\n\nstatic LLDefaultChildRegistry::Register<LLHintPopup> r(\"hint_popup\");\n\n\nLLHintPopup::LLHintPopup(const LLHintPopup::Params& p)\n:\tmNotification(p.notification),\n\tmDirection(TOP),\n\tmDistance(p.distance),\n\tmArrowLeft(p.left_arrow),\n\tmArrowUp(p.up_arrow),\n\tmArrowRight(p.right_arrow),\n\tmArrowDown(p.down_arrow),\n\tmArrowDownAndLeft(p.lower_left_arrow),\n\tmArrowLeftOffset(p.left_arrow_offset),\n\tmArrowUpOffset(p.up_arrow_offset),\n\tmArrowRightOffset(p.right_arrow_offset),\n\tmArrowDownOffset(p.down_arrow_offset),\n\tmHidden(false),\n\tmFadeInTime(p.fade_in_time),\n\tmFadeOutTime(p.fade_out_time),\n\tLLPanel(p)\n{\n\tif (p.target_params.isProvided())\n\t{\n\t\tmDirection = p.target_params.direction;\n\t\tmTarget = p.target_params.target;\n\t}\n\tif (p.hint_image.isProvided())\n\t{\n\t\tbuildFromFile(\"panel_hint_image.xml\", NULL, p);\n\t\tgetChild<LLIconCtrl>(\"hint_image\")->setImage(p.hint_image());\n\t}\n\telse\n\t{\n\t\tbuildFromFile( \"panel_hint.xml\", NULL, p);\n\t}\n}\n\nBOOL LLHintPopup::postBuild()\n{\n\tLLTextBox& hint_text = getChildRef<LLTextBox>(\"hint_text\");\n\thint_text.setText(mNotification->getMessage());\n\t\n\tgetChild<LLButton>(\"close\")->setClickedCallback(boost::bind(&LLHintPopup::onClickClose, this));\n\tgetChild<LLTextBox>(\"hint_title\")->setText(mNotification->getLabel());\n\n\tLLRect text_bounds = hint_text.getTextBoundingRect();\n\tS32 delta_height = text_bounds.getHeight() - hint_text.getRect().getHeight();\n\treshape(getRect().getWidth(), getRect().getHeight() + delta_height);\n\treturn TRUE;\n}\n\nvoid LLHintPopup::draw()\n{\n\tF32 alpha = 1.f;\n\tif (mHidden)\n\t{\n\t\talpha = clamp_rescale(mFadeTimer.getElapsedTimeF32(), 0.f, mFadeOutTime, 1.f, 0.f);\n\t\tif (alpha == 0.f)\n\t\t{\n\t\t\tdie();\n\t\t\treturn;\n\t\t}\n\t}\n\telse\n\t{\n\t\talpha = clamp_rescale(mFadeTimer.getElapsedTimeF32(), 0.f, mFadeInTime, 0.f, 1.f);\n\t}\n\t\n\t{\tLLViewDrawContext context(alpha); \n\n\t\tif (mTarget.empty())\n\t\t{\n\t\t\t\/\/ just draw contents, no arrow, in default position\n\t\t\tLLPanel::draw();\n\t\t}\n\t\telse \n\t\t{\n\t\t\tLLView* targetp = LLHints::getHintTarget(mTarget).get();\n\t\t\tif (!targetp)\n\t\t\t{\n\t\t\t\t\/\/ target widget is no longer valid, go away\n\t\t\t\tdie();\n\t\t\t}\n\t\t\telse if (!targetp->isInVisibleChain()) \n\t\t\t{\n\t\t\t\t\/\/ if target is invisible, don't draw, but keep alive in case widget comes back\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tLLRect target_rect;\n\t\t\t\ttargetp->localRectToOtherView(targetp->getLocalRect(), &target_rect, getParent());\n\n\t\t\t\tLLRect my_local_rect = getLocalRect();\n\t\t\t\tLLRect my_rect;\n\t\t\t\tLLRect arrow_rect;\n\t\t\t\tLLUIImagePtr arrow_imagep;\n\n\t\t\t\tswitch(mDirection)\n\t\t\t\t{\n\t\t\t\tcase LEFT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mLeft - (my_local_rect.getWidth() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.getCenterY(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowRight)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mRight + mArrowRight->getWidth() \/ 2 + mArrowRightOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowRight->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowRight->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowRight;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase TOP:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.getCenterX(), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mTop + (my_local_rect.getHeight() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowDown)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.getCenterX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mBottom - mArrowDown->getHeight() \/ 2 + mArrowDownOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDown->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDown->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowDown;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase RIGHT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mRight + (my_local_rect.getWidth() \/ 2 + mDistance), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowLeft)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mLeft - mArrowLeft->getWidth() \/ 2 + mArrowLeftOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getCenterY(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowLeft->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowLeft->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowLeft;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase BOTTOM:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.getCenterX(), \n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mBottom - (my_local_rect.getHeight() \/ 2 + mDistance),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowUp)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.getCenterX(),\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mTop + mArrowUp->getHeight() \/ 2 + mArrowUpOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowUp->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowUp->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowUp;\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\tcase TOP_RIGHT:\n\t\t\t\t\tmy_rect.setCenterAndSize(\ttarget_rect.mRight + (my_local_rect.getWidth() \/ 2),\n\t\t\t\t\t\t\t\t\t\t\t\ttarget_rect.mTop + (my_local_rect.getHeight() \/ 2 + mDistance),\n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.getHeight());\n\t\t\t\t\tif (mArrowDownAndLeft)\n\t\t\t\t\t{\n\t\t\t\t\t\tarrow_rect.setCenterAndSize(my_local_rect.mLeft + mArrowDownAndLeft->getWidth() \/ 2 + mArrowLeftOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmy_local_rect.mBottom - mArrowDownAndLeft->getHeight() \/ 2 + mArrowDownOffset,\n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDownAndLeft->getWidth(), \n\t\t\t\t\t\t\t\t\t\t\t\t\tmArrowDownAndLeft->getHeight());\n\t\t\t\t\t\tarrow_imagep = mArrowDownAndLeft;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tsetShape(my_rect);\n\t\t\t\tLLPanel::draw();\n\n\t\t\t\tif (arrow_imagep) arrow_imagep->draw(arrow_rect, LLColor4(1.f, 1.f, 1.f, alpha));\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nLLRegistry<std::string, LLHandle<LLView> > LLHints::sTargetRegistry;\nstd::map<LLNotificationPtr, class LLHintPopup*> LLHints::sHints;\n\n\/\/static\nvoid LLHints::show(LLNotificationPtr hint)\n{\n\tLLHintPopup::Params p(LLUICtrlFactory::getDefaultParams<LLHintPopup>());\n\n\tLLParamSDParser parser;\n\tparser.readSD(hint->getPayload(), p, true);\n\tp.notification = hint;\n\n\tif (p.validateBlock())\n\t{\n\t\tLLHintPopup* popup = new LLHintPopup(p);\n\n\t\tsHints[hint] = popup;\n\n\t\tLLView* hint_holder = gViewerWindow->getHintHolder();\n\t\tif (hint_holder)\n\t\t{\n\t\t\thint_holder->addChild(popup);\n\t\t\tpopup->centerWithin(hint_holder->getLocalRect());\n\t\t}\n\t}\n}\n\n\/\/static\nvoid LLHints::hide(LLNotificationPtr hint)\n{\n\thint_map_t::iterator found_it = sHints.find(hint);\n\tif (found_it != sHints.end())\n\t{\n\t\tfound_it->second->hide();\n\t\tsHints.erase(found_it);\n\t}\n}\n\n\/\/static\nvoid LLHints::registerHintTarget(const std::string& name, LLHandle<LLView> target)\n{\n\tsTargetRegistry.defaultRegistrar().replace(name, target);\n}\n\n\/\/static \nLLHandle<LLView> LLHints::getHintTarget(const std::string& name)\n{\n\tLLHandle<LLView>* handlep = sTargetRegistry.getValue(name);\n\tif (handlep) \n\t{\n\t\treturn *handlep;\n\t}\n\telse\n\t{\n\t\treturn LLHandle<LLView>();\n\t}\n}\n\n\/\/static\nvoid LLHints::initClass()\n{\n\tsRegister.reference();\n\n\tLLControlVariablePtr control = gSavedSettings.getControl(\"EnableUIHints\");\n\tcontrol->getSignal()->connect(boost::bind(&showHints, _2));\n\tgViewerWindow->getHintHolder()->setVisible(control->getValue().asBoolean());\n\n}\n\n\/\/staic\nvoid LLHints::showHints(const LLSD& show)\n{\n\tbool visible = show.asBoolean();\n\tgViewerWindow->getHintHolder()->setVisible(visible);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\nint main ()\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell && cin.good())\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\t\n\n\t\t\/\/execute the following code ONLY IF STRING IS NOT EMPTY\n\t\tif (!rawinput.empty())\n\t\t{\n\t\t\t\t\n\t\t\t\/\/variables to keep track of whitespaces\n\t\t\tint wspos = 0;\n\t\t\tstring parsedinput = rawinput;\n\n\n\t\t\t\/\/first remove leading whitespaces at the very beginning of the string\n\t\t\twhile (parsedinput.at(wspos) == ' ') wspos++;\n\t\t\tparsedinput = parsedinput.substr(wspos, parsedinput.size());\n\t\t\t\/\/then reinit wsend for removing inner whitespaces\n\t\t\twspos = 0;\n\n\t\t\t\/\/next remove trailing whitespaces at the end of the string\n\t\t\tparsedinput += ' '; \/\/add space at the end to make removal easier.\n\t\t\twspos = parsedinput.size()-1;\n\t\t\tif(parsedinput.at(wspos) == ' ')\n\t\t\t{\n\t\t\t\twhile (parsedinput.at(wspos) == ' ')\n\t\t\t\t{\n\t\t\t\t\t--wspos;\n\t\t\t\t}\n\t\t\t\n\t\t\t\tparsedinput = parsedinput.substr(0, wspos+1);\n\t\t\t}\n\n\t\t\t\/\/add semicolon to the end of the string to make parsing easier\n\t\t\tparsedinput += ';';\n\t\t\t\n\t\t\t\/\/initial scan for syntax errors\n\t\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\t\/\/bool variable to tell when the inner for loop is done\n\t\t\tbool seploopdone = false;\n\n\t\t\t\/\/iterate through string and separate into commands and connectors\n\t\t\twhile (synerror != true && seploopdone == false)\n\t\t\t{\n\t\t\t\tstring parsecmd;\n\t\t\t\tfor (unsigned i=0; i<parsedinput.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\t\/\/checks for & and |\n\t\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/if 3 &&& ||| -- syntax error\n\t\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i) != ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(synerror == true) break;\n\t\t\t\tseploopdone = true;\n\t\t\t}\n\t\t}\n\t\tcmds.push_back(string(\";\"));\n\n\t\tvector<string> newvec;\n\t\tfor (unsigned i = 0; i < cmds.size(); i++)\n\t\t{\n\t\t\t\/\/TODO: sort through vector, stop when &&, ||, or ; is found.\n\t\t\tif (cmds.at(i) == \"&&\" || cmds.at(i) == \"||\" || cmds.at(i) == \";\")\n\t\t\t{\n\t\t\t\tchar** newargv = new char*[newvec.size()+1];\n\t\t\t\tfor (unsigned j = 0; j < newvec.size(); j++)\n\t\t\t\t{\n\t\t\t\t\tnewargv[j] = new char[newvec.at(j).size()+1]; \n\t\t\t\t\tstrcpy(newargv[j], newvec.at(j).c_str());\n\t\t\t\t}\n\t\t\t\tnewargv[newvec.size()] = '\\0';\n\n\t\t\t\tint execret = 0; \/\/keeps track of exec return value. init to 0\n\t\t\t\tint pid = fork(); if (pid == -1) perror(\"fork\");\n\t\t\t\t\/\/if we're in the child\n\t\t\t\tif (pid == 0)\n\t\t\t\t{\t\n\t\t\t\t\texecret = execvp(newargv[0], newargv);\n\t\t\t\t\tif (-1 == execret)\n\t\t\t\t\t{\t\n\t\t\t\t\t\tperror(*newargv);\n\t\t\t\t\t\tfor (unsigned k=0; k < newvec.size(); k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdelete[] newargv[i];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdelete[] newargv;\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\t\/\/conditions for && and ||\n\t\t\t\t\tif (cmds.at(i) == \"||\" && execret == 0) cmds.clear();\n\t\t\t\t\tif (cmds.at(i) == \";\" && i == cmds.size()-1) cmds.clear();\n\t\t\t\t}\n\n\t\t\t\telse \n\t\t\t\t{\n\t\t\t\t\tif (-1 == wait(0)) \n\t\t\t\t\t{\n\t\t\t\t\t\tperror(\"wait\");\n\t\t\t\t\t\texit(1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (newvec.size() > 0)\n\t\t\t\t{\n\t\t\t\t\tnewvec.clear();\n\t\t\t\t\tfor (unsigned k=0; k < newvec.size(); k++)\n\t\t\t\t\t{\n\t\t\t\t\t\t\tdelete[] newargv[i];\n\t\t\t\t\t}\n\t\t\t\t\tdelete[] newargv;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tnewvec.push_back(cmds.at(i));\n\t\t\t}\n\t\t}\n\n\t}\n\n\treturn 0;\n} \n<commit_msg>fixed '&&' and '||' errors. added syntax error msg<commit_after>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n#include <vector>\n#include <stdio.h>\n#include <string.h>\n#include <unistd.h>\n#include <sys\/types.h>\n#include <sys\/wait.h>\nusing namespace std;\n\n\n\/*TODO: refine the commandexec algorithm before proceeding further.\nThis current algorithm was an initial attempt.\nIt does not work, and will be replaced. *\/\n\nint main (int argc, char** argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\n\twhile (!killrshell && cin.good())\n\t{\n\n\t\t\/\/bool will store syntax error\n\t\tbool synerror = false;\n\t\t\/\/string will store raw user input\n\t\tstring rawinput;\n\t\t\/\/vector of strings, will convert to array for execvp\n\t\tvector<string> cmds;\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tgetline(cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\t\/\/removes everything after '#'\n\t\tif (rawinput.find('#') != string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\t\n\n\t\t\/\/execute the following code ONLY IF STRING IS NOT EMPTY\n\t\tif (!rawinput.empty())\n\t\t{\n\t\t\t\t\n\t\t\t\/\/variables to keep track of whitespaces\n\t\t\tint wspos = 0;\n\t\t\tstring parsedinput = rawinput;\n\n\n\t\t\t\/\/first remove leading whitespaces at the very beginning of the string\n\t\t\twhile (parsedinput.at(wspos) == ' ') wspos++;\n\t\t\tparsedinput = parsedinput.substr(wspos, parsedinput.size());\n\t\t\t\/\/then reinit wsend for removing inner whitespaces\n\t\t\twspos = 0;\n\n\t\t\t\/\/next remove trailing whitespaces at the end of the string\n\t\t\tparsedinput += ' '; \/\/add space at the end to make removal easier.\n\t\t\twspos = parsedinput.size()-1;\n\t\t\tif(parsedinput.at(wspos) == ' ')\n\t\t\t{\n\t\t\t\twhile (parsedinput.at(wspos) == ' ')\n\t\t\t\t{\n\t\t\t\t\t--wspos;\n\t\t\t\t}\n\t\t\t\n\t\t\t\tparsedinput = parsedinput.substr(0, wspos+1);\n\t\t\t}\n\n\t\t\t\/\/add semicolon to the end of the string to make parsing easier\n\t\t\tparsedinput += ';';\n\t\t\t\n\t\t\t\/\/initial scan for syntax errors\n\t\t\tif (!isalpha(parsedinput.at(0))) synerror = true;\n\n\t\t\t\/\/bool variable to tell when the inner for loop is done\n\t\t\tbool seploopdone = false;\n\n\t\t\t\/\/iterate through string and separate into commands and connectors\n\t\t\twhile (synerror != true && seploopdone == false)\n\t\t\t{\n\t\t\t\tstring parsecmd;\n\t\t\t\tfor (unsigned i=0; i<parsedinput.size(); i++)\n\t\t\t\t{\n\t\t\t\t\tif (i >= parsedinput.size()-1) break; \/\/accomodates for concatenated ; at the end of the string\n\t\t\t\t\t\/\/checks for & and |\n\t\t\t\t\tif ( (parsedinput.at(i) == '&' || parsedinput.at(i) == '|') && parsedinput.at(i+1) == parsedinput.at(i) )\n\t\t\t\t\t{\n\t\t\t\t\t\t\/\/if 3 &&& ||| -- syntax error\n\t\t\t\t\t\tif (parsedinput.at(i+2) == parsedinput.at(i))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsynerror =true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\/\/if 2+ ;; -- syntax error\n\t\t\t\t\t\tif (parsedinput.at(i) == ';' && (parsedinput.at(i+1) == parsedinput.at(i)))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tsynerror = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\telse\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tstring con1;\n\t\t\t\t\t\t\tcon1 += parsedinput.at(i);\n\t\t\t\t\t\t\tstring con2;\n\t\t\t\t\t\t\tcon2 += parsedinput.at(i+1);\n\t\t\t\t\t\t\tstring constring = con1 + con2;\n\t\t\t\t\t\t\tcmds.push_back(constring);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t\ti++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if (parsedinput.at(i) != ' ')\n\t\t\t\t\t{\n\t\t\t\t\t\tparsecmd += parsedinput.at(i);\n\t\t\t\t\t\tif (!isalpha(parsedinput.at(i+1)))\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcmds.push_back(parsecmd);\n\t\t\t\t\t\t\tparsecmd.clear();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(synerror == true) break;\n\t\t\t\tseploopdone = true;\n\t\t\t}\n\t\t}\n\n\t\tif (synerror != true)\n\t\t{\n\t\t\t\t\n\t\t\tcmds.push_back(string(\";\"));\n\n\t\t\tvector<string> newvec;\n\t\t\tfor (unsigned i = 0; i < cmds.size(); i++)\n\t\t\t\n\t\t\t\tif (cmds.at(i) == \"&&\" || cmds.at(i) == \"||\" || cmds.at(i) == \";\")\n\t\t\t\t{\n\t\t\t\t\tchar** newargv = new char*[newvec.size()+1];\n\t\t\t\t\tfor (unsigned j = 0; j < newvec.size(); j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tnewargv[j] = new char[newvec.at(j).size()+1]; \n\t\t\t\t\t\tstrcpy(newargv[j], newvec.at(j).c_str());\n\t\t\t\t\t}\n\t\t\t\t\tnewargv[newvec.size()] = '\\0';\n\n\t\t\t\t\tint execret = 0; \/\/keeps track of exec return value. init to 0\n\t\t\t\t\tint pid = fork();\n\t\t\t\t\tif (pid == -1) perror(\"fork\");\n\t\t\t\t\t\/\/if we're in the child\n\t\t\t\t\tif (pid == 0)\n\t\t\t\t\t{\t\n\t\t\t\t\t\texecret = execvp(newargv[0], newargv);\n\t\t\t\t\t\tif (-1 == execret)\n\t\t\t\t\t\t{\t\n\t\t\t\t\t\t\tperror(*newargv);\n\t\t\t\t\t\t\tfor (unsigned k=0; k < newvec.size(); k++)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdelete[] newargv[i];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tdelete[] newargv;\n\t\t\t\t\t\t\texit(1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse \n\t\t\t\t\t{\n\t\t\t\t\t\tif (-1 == wait(0)) \n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tperror(\"wait\");\n\t\t\t\t\t\t\texit(1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (newvec.size() > 0)\n\t\t\t\t\t{\n\t\t\t\t\t\tnewvec.clear();\n\t\t\t\t\t\tfor (unsigned k=0; k < newvec.size(); k++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdelete[] newargv[i];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdelete[] newargv;\n\t\t\t\t\t}\n\t\t\t\t\tif (cmds.at(i) == \"||\" && execret == 0) break; \n\t\t\t\t\tif (cmds.at(i) == \";\" && i == cmds.size()-1) break;\n\t\t\t\t}\n\t\t\t\telse if (cmds.at(i) == \"exit\" && (cmds.at(i-1) == \";\" || cmds.at(i-1) == \"&&\"))\n\t\t\t\t{\n\t\t\t\t\tkillrshell = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tnewvec.push_back(cmds.at(i));\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (synerror == true)\n\t\t\t{\n\t\t\t\tprintf(\"Syntax error.\\n\");\n\t\t\t}\n\t\t}\n\t\n\treturn 0;\n} \n<|endoftext|>"} {"text":"<commit_before>#include <iostream> \/\/ std::cout\n#include <stdlib.h> \/\/ rand()\n#include <time.h> \/\/ time()\n\n#include \"gtest\/gtest.h\"\n\n#include \"sorting.h\"\n#include \"printarray.h\"\n#include \"verifyarrays.h\"\n\n#define quiet\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSort)\n{\n const int N = 5;\n\n double *to_sort_data = new double[N];\n double *sorted_data = new double[N];\n\n to_sort_data[0] = 21.3;\n to_sort_data[1] = 68.2;\n to_sort_data[2] = 1.3;\n to_sort_data[3] = 44.3;\n to_sort_data[4] = 10.3;\n\n memcpy(sorted_data, to_sort_data, N*sizeof(double));\n\n sorting::simple::InsertionSort(sorted_data, N);\n\n#ifndef quiet\n std::cout << \"Arrays\" << std::endl;\n std::cout << \"Index Original Sorted \" << std::endl;\n for (int i = 0 ; i < N ; i++)\n {\n std::cout << i+1 << \"\/\" << N << \" \"\n << to_sort_data[i] << \" \"\n << sorted_data[i] << std::endl;\n }\n#endif \/\/ quiet\n\n for (int i = 1 ; i < N ; i++)\n {\n EXPECT_GE(sorted_data[i], sorted_data[i-1]);\n }\n\n for (int i = 0 ; i < N ; i++)\n {\n EXPECT_NE(sorted_data[i], 0);\n }\n ASSERT_TRUE(VerifyIfAllNotNaN(sorted_data, N));\n ASSERT_TRUE(VerifyIfOrdered(sorted_data, N));\n ASSERT_TRUE(VerifySortedUnique(to_sort_data, sorted_data, N));\n\n delete[] to_sort_data;\n delete[] sorted_data;\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortBestCase)\n{\n \/\/ Best case is O(N) when array already sorted\n const int N = 1000;\n\n int *to_sort_data = new int[N];\n int *sorted_data = new int[N];\n\n for (int i = 0 ; i < N ; i++)\n {\n to_sort_data[i] = i;\n }\n\n memcpy(sorted_data, to_sort_data, N*sizeof(int));\n\n sorting::simple::InsertionSort(sorted_data, N);\n\n#ifndef quiet\n std::cout << \"Arrays\" << std::endl;\n std::cout << \"Index Original Sorted \" << std::endl;\n for (int i = 0 ; i < N ; i++)\n {\n std::cout << i+1 << \"\/\" << N << \" \"\n << to_sort_data[i] << \" \"\n << sorted_data[i] << std::endl;\n }\n#endif \/\/ quiet\n\n for (int i = 1 ; i < N ; i++)\n {\n EXPECT_GE(sorted_data[i], sorted_data[i-1]);\n }\n\n ASSERT_TRUE(VerifyIfAllNotNaN(sorted_data, N));\n ASSERT_TRUE(VerifyIfOrdered(sorted_data, N));\n ASSERT_TRUE(VerifySortedUnique(to_sort_data, sorted_data, N));\n\n delete[] to_sort_data;\n delete[] sorted_data;\n\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortWorstCase)\n{\n \/\/ Worst case is O(N^2) when array already sorted, but in reverse order.\n const int N = 1000;\n\n int *to_sort_data = new int[N];\n int *sorted_data = new int[N];\n\n for (int i = 0 ; i < N ; i++)\n {\n to_sort_data[i] = N-i;\n }\n\n memcpy(sorted_data, to_sort_data, N*sizeof(int));\n\n sorting::simple::InsertionSort(sorted_data, N);\n\n#ifndef quiet\n std::cout << \"Arrays\" << std::endl;\n std::cout << \"Index Original Sorted \" << std::endl;\n for (int i = 0 ; i < N ; i++)\n {\n std::cout << i+1 << \"\/\" << N << \" \"\n << to_sort_data[i] << \" \"\n << sorted_data[i] << std::endl;\n }\n#endif \/\/ quiet\n\n for (int i = 1 ; i < N ; i++)\n {\n EXPECT_GE(sorted_data[i], sorted_data[i-1]);\n }\n\n ASSERT_TRUE(VerifyIfAllNotNaN(sorted_data, N));\n ASSERT_TRUE(VerifyIfOrdered(sorted_data, N));\n ASSERT_TRUE(VerifySortedUnique(to_sort_data, sorted_data, N));\n\n delete[] to_sort_data;\n delete[] sorted_data;\n\n}\n\nTEST(SimpleSorts, SelectionSort)\n{\n const int N = 1000;\n\n double *to_sort_data = new double[N];\n double *sorted_data = new double[N];\n\n \/\/ Initialize the array with random values between 1 and 100\n \/\/ NOTE: rand() is a terrible pseudo-random number generator (PRNG).\n \/\/ It is still used here for a simple testing task, but don't use it\n \/\/ for anything serious.\n srand(time(NULL));\n for (int i = 0 ; i < N ; i++)\n {\n to_sort_data[i] = rand() % 100 + 1;\n }\n\n memcpy(sorted_data, to_sort_data, N*sizeof(double));\n\n sorting::simple::SelectionSort(sorted_data, N);\n\n#ifndef quiet\n std::cout << \"Arrays\" << std::endl;\n std::cout << \"Index Original Sorted \" << std::endl;\n for (int i = 0 ; i < N ; i++)\n {\n std::cout << i+1 << \"\/\" << N << \" \"\n << to_sort_data[i] << \" \"\n << sorted_data[i] << std::endl;\n }\n#endif \/\/ quiet\n\n for (int i = 1 ; i < N ; i++)\n {\n EXPECT_GE(sorted_data[i], sorted_data[i-1]);\n }\n\n for (int i = 0 ; i < N ; i++)\n {\n EXPECT_NE(sorted_data[i], 0);\n }\n ASSERT_TRUE(VerifyIfAllNotNaN(sorted_data, N));\n ASSERT_TRUE(VerifyIfOrdered(sorted_data, N));\n ASSERT_TRUE(VerifySortedUnique(to_sort_data, sorted_data, N));\n\n delete[] to_sort_data;\n delete[] sorted_data;\n}\n\n\n<commit_msg>Adapted simple sorts to new testing macros<commit_after>#include <iostream> \/\/ std::cout\n#include <stdlib.h> \/\/ rand()\n#include <time.h> \/\/ time()\n\n#include \"gtest\/gtest.h\"\n\n#include \"sorting.h\"\n#include \"verifysortedarrays.h\"\n\n#define quiet\n\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortMultipleSizesDouble)\n{\n const double to_sorts[] = {6.0, 5.0, 3.0, 1.0, 2.4, 4.0, 10.0, 7.0,\n 3.42, 32.2, 44.2, 56.3, 67.9, 3.2, 44.2, 2.0};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS(16, double, to_sorts, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortMultipleSizesInt)\n{\n const double to_sorts[] = {6, 5, 3, 1, 2, 4, 10, 7,\n 3, 32, 44, 56, 67, 3, 44, 2};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS(16, int, to_sorts, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionortKnownResultDouble)\n{\n const double to_sorts[] = {6.0, 5.0, 3.0, 1.0, 2.4, 4.0, 10.0, 7.0,\n 3.42, 32.2, 44.2, 56.3, 67.9, 3.2, 44.2, 2.0};\n const double known_sorted[] = { 1.0, 2.0, 2.4, 3.0, 3.2, 3.42, 4.0, 5.0,\n 6.0, 7.0, 10.0, 32.2, 44.2, 44.2, 56.3, 67.9};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS_AND_COMPARE(16, double, to_sorts, known_sorted, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortKnownResultInt)\n{\n const double to_sorts[] = {6, 5, 3, 1, 2, 4, 10, 7,\n 3, 32, 44, 56, 67, 3, 44, 2};\n const double known_sorted[] = { 1, 2, 2, 3, 3, 3, 4, 5,\n 6, 7, 10, 32, 44, 44, 56, 67};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS_AND_COMPARE(16, int, to_sorts, known_sorted, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortMultipleSizesRandomDouble)\n{\n VERIFY_SORTING_RANDOM_ARRAYS(100, double, sorting::simple::InsertionSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortMultipleSizesRandomInt)\n{\n VERIFY_SORTING_RANDOM_ARRAYS(100, int, sorting::simple::InsertionSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortSortedDouble)\n{\n VERIFY_SORTING_SORTED_ARRAY(100, double, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortSortedInt)\n{\n VERIFY_SORTING_SORTED_ARRAY(100, int, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortInvSortedDouble)\n{\n VERIFY_SORTING_INV_SORTED_ARRAY(100, double, sorting::simple::InsertionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, InsertionSortInvSortedInt)\n{\n VERIFY_SORTING_INV_SORTED_ARRAY(100, int, sorting::simple::InsertionSort, false);\n}\n\n\/\/ #####################################################################\n\/\/ #####################################################################\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortMultipleSizesDouble)\n{\n const double to_sorts[] = {6.0, 5.0, 3.0, 1.0, 2.4, 4.0, 10.0, 7.0,\n 3.42, 32.2, 44.2, 56.3, 67.9, 3.2, 44.2, 2.0};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS(16, double, to_sorts, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortMultipleSizesInt)\n{\n const double to_sorts[] = {6, 5, 3, 1, 2, 4, 10, 7,\n 3, 32, 44, 56, 67, 3, 44, 2};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS(16, int, to_sorts, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortKnownResultDouble)\n{\n const double to_sorts[] = {6.0, 5.0, 3.0, 1.0, 2.4, 4.0, 10.0, 7.0,\n 3.42, 32.2, 44.2, 56.3, 67.9, 3.2, 44.2, 2.0};\n const double known_sorted[] = { 1.0, 2.0, 2.4, 3.0, 3.2, 3.42, 4.0, 5.0,\n 6.0, 7.0, 10.0, 32.2, 44.2, 44.2, 56.3, 67.9};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS_AND_COMPARE(16, double, to_sorts, known_sorted, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortKnownResultInt)\n{\n const double to_sorts[] = {6, 5, 3, 1, 2, 4, 10, 7,\n 3, 32, 44, 56, 67, 3, 44, 2};\n const double known_sorted[] = { 1, 2, 2, 3, 3, 3, 4, 5,\n 6, 7, 10, 32, 44, 44, 56, 67};\n\n VERIFY_SORTING_FIXED_SIZE_ARRAYS_AND_COMPARE(16, int, to_sorts, known_sorted, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortMultipleSizesRandomDouble)\n{\n VERIFY_SORTING_RANDOM_ARRAYS(100, double, sorting::simple::SelectionSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortMultipleSizesRandomInt)\n{\n VERIFY_SORTING_RANDOM_ARRAYS(100, int, sorting::simple::SelectionSort, false)\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortSortedDouble)\n{\n VERIFY_SORTING_SORTED_ARRAY(100, double, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortSortedInt)\n{\n VERIFY_SORTING_SORTED_ARRAY(100, int, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortInvSortedDouble)\n{\n VERIFY_SORTING_INV_SORTED_ARRAY(100, double, sorting::simple::SelectionSort, false);\n}\n\n\/\/ *********************************************************************\nTEST(SimpleSorts, SelectionSortInvSortedInt)\n{\n VERIFY_SORTING_INV_SORTED_ARRAY(100, int, sorting::simple::SelectionSort, false);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright 2011-2014 Branimir Karadzic. All rights reserved.\n * License: http:\/\/www.opensource.org\/licenses\/BSD-2-Clause\n *\/\n\n#include \"entry_p.h\"\n\n#if ENTRY_CONFIG_USE_NATIVE && (BX_PLATFORM_FREEBSD || BX_PLATFORM_LINUX || BX_PLATFORM_RPI)\n\n#define XK_MISCELLANY\n#define XK_LATIN1\n#include <X11\/keysymdef.h>\n#include <bgfxplatform.h> \/\/ will include X11 which #defines None... Don't mess with order of includes.\n\n#undef None\n#include <bx\/thread.h>\n#include <bx\/os.h>\n#include <string.h> \/\/ memset\n\nnamespace entry\n{\n\tstatic uint8_t s_translateKey[512];\n\n\tstatic void initTranslateKey(uint16_t _xk, Key::Enum _key)\n\t{\n\t\t_xk += 256;\n\t\tBX_CHECK(_xk < BX_COUNTOF(s_translateKey), \"Out of bounds %d.\", _xk);\n\t\ts_translateKey[_xk&0x1ff] = (uint8_t)_key;\n\t}\n\n\tKey::Enum fromXk(uint16_t _xk)\n\t{\n\t\t_xk += 256;\n\t\treturn 512 > _xk ? (Key::Enum)s_translateKey[_xk] : Key::None;\n\t}\n\n\tstruct MainThreadEntry\n\t{\n\t\tint m_argc;\n\t\tchar** m_argv;\n\n\t\tstatic int32_t threadFunc(void* _userData);\n\t};\n\n\tstruct Context\n\t{\n\t\tContext()\n\t\t\t: m_modifiers(Modifier::None)\n\t\t\t, m_exit(false)\n\t\t{\n\t\t\tmemset(s_translateKey, 0, sizeof(s_translateKey) );\n\t\t\tinitTranslateKey(XK_Escape, Key::Esc);\n\t\t\tinitTranslateKey(XK_Return, Key::Return);\n\t\t\tinitTranslateKey(XK_Tab, Key::Tab);\n\t\t\tinitTranslateKey(XK_BackSpace, Key::Backspace);\n\t\t\tinitTranslateKey(XK_space, Key::Space);\n\t\t\tinitTranslateKey(XK_Up, Key::Up);\n\t\t\tinitTranslateKey(XK_Down, Key::Down);\n\t\t\tinitTranslateKey(XK_Left, Key::Left);\n\t\t\tinitTranslateKey(XK_Right, Key::Right);\n\t\t\tinitTranslateKey(XK_Page_Up, Key::PageUp);\n\t\t\tinitTranslateKey(XK_Page_Down, Key::PageUp);\n\t\t\tinitTranslateKey(XK_Home, Key::Home);\n\t\t\tinitTranslateKey(XK_KP_End, Key::End);\n\t\t\tinitTranslateKey(XK_Print, Key::Print);\n\t\t\tinitTranslateKey(XK_equal, Key::Plus);\n\t\t\tinitTranslateKey(XK_minus, Key::Minus);\n\t\t\tinitTranslateKey(XK_F1, Key::F1);\n\t\t\tinitTranslateKey(XK_F2, Key::F2);\n\t\t\tinitTranslateKey(XK_F3, Key::F3);\n\t\t\tinitTranslateKey(XK_F4, Key::F4);\n\t\t\tinitTranslateKey(XK_F5, Key::F5);\n\t\t\tinitTranslateKey(XK_F6, Key::F6);\n\t\t\tinitTranslateKey(XK_F7, Key::F7);\n\t\t\tinitTranslateKey(XK_F8, Key::F8);\n\t\t\tinitTranslateKey(XK_F9, Key::F9);\n\t\t\tinitTranslateKey(XK_F10, Key::F10);\n\t\t\tinitTranslateKey(XK_F11, Key::F11);\n\t\t\tinitTranslateKey(XK_F12, Key::F12);\n\t\t\tinitTranslateKey(XK_KP_Insert, Key::NumPad0);\n\t\t\tinitTranslateKey(XK_KP_End, Key::NumPad1);\n\t\t\tinitTranslateKey(XK_KP_Down, Key::NumPad2);\n\t\t\tinitTranslateKey(XK_KP_Page_Down, Key::NumPad3);\n\t\t\tinitTranslateKey(XK_KP_Left, Key::NumPad4);\n\t\t\tinitTranslateKey(XK_KP_Begin, Key::NumPad5);\n\t\t\tinitTranslateKey(XK_KP_Right, Key::NumPad6);\n\t\t\tinitTranslateKey(XK_KP_Home, Key::NumPad7);\n\t\t\tinitTranslateKey(XK_KP_Up, Key::NumPad8);\n\t\t\tinitTranslateKey(XK_KP_Page_Up, Key::NumPad9);\n\t\t\tinitTranslateKey('0', Key::Key0);\n\t\t\tinitTranslateKey('1', Key::Key1);\n\t\t\tinitTranslateKey('2', Key::Key2);\n\t\t\tinitTranslateKey('3', Key::Key3);\n\t\t\tinitTranslateKey('4', Key::Key4);\n\t\t\tinitTranslateKey('5', Key::Key5);\n\t\t\tinitTranslateKey('6', Key::Key6);\n\t\t\tinitTranslateKey('7', Key::Key7);\n\t\t\tinitTranslateKey('8', Key::Key8);\n\t\t\tinitTranslateKey('9', Key::Key9);\n\t\t\tinitTranslateKey('a', Key::KeyA);\n\t\t\tinitTranslateKey('b', Key::KeyB);\n\t\t\tinitTranslateKey('c', Key::KeyC);\n\t\t\tinitTranslateKey('d', Key::KeyD);\n\t\t\tinitTranslateKey('e', Key::KeyE);\n\t\t\tinitTranslateKey('f', Key::KeyF);\n\t\t\tinitTranslateKey('g', Key::KeyG);\n\t\t\tinitTranslateKey('h', Key::KeyH);\n\t\t\tinitTranslateKey('i', Key::KeyI);\n\t\t\tinitTranslateKey('j', Key::KeyJ);\n\t\t\tinitTranslateKey('k', Key::KeyK);\n\t\t\tinitTranslateKey('l', Key::KeyL);\n\t\t\tinitTranslateKey('m', Key::KeyM);\n\t\t\tinitTranslateKey('n', Key::KeyN);\n\t\t\tinitTranslateKey('o', Key::KeyO);\n\t\t\tinitTranslateKey('p', Key::KeyP);\n\t\t\tinitTranslateKey('q', Key::KeyQ);\n\t\t\tinitTranslateKey('r', Key::KeyR);\n\t\t\tinitTranslateKey('s', Key::KeyS);\n\t\t\tinitTranslateKey('t', Key::KeyT);\n\t\t\tinitTranslateKey('u', Key::KeyU);\n\t\t\tinitTranslateKey('v', Key::KeyV);\n\t\t\tinitTranslateKey('w', Key::KeyW);\n\t\t\tinitTranslateKey('x', Key::KeyX);\n\t\t\tinitTranslateKey('y', Key::KeyY);\n\t\t\tinitTranslateKey('z', Key::KeyZ);\n\t\t}\n\n\t\tint32_t run(int _argc, char** _argv)\n\t\t{\n\t\t\tXInitThreads();\n\t\t\tm_display = XOpenDisplay(0);\n\n\t\t\tint32_t screen = DefaultScreen(m_display);\n\t\t\tint32_t depth = DefaultDepth(m_display, screen);\n\t\t\tVisual* visual = DefaultVisual(m_display, screen);\n\t\t\tWindow root = RootWindow(m_display, screen);\n\n\t\t\tXSetWindowAttributes windowAttrs;\n\t\t\tmemset(&windowAttrs, 0, sizeof(windowAttrs) );\n\t\t\twindowAttrs.background_pixmap = 0;\n\t\t\twindowAttrs.border_pixel = 0;\n\t\t\twindowAttrs.event_mask = 0\n\t\t\t\t\t| ButtonPressMask\n\t\t\t\t\t| ButtonReleaseMask\n\t\t\t\t\t| ExposureMask\n\t\t\t\t\t| KeyPressMask\n\t\t\t\t\t| KeyReleaseMask\n\t\t\t\t\t| PointerMotionMask\n\t\t\t\t\t| ResizeRedirectMask\n\t\t\t\t\t| StructureNotifyMask\n\t\t\t\t\t;\n\n\t\t\tm_window = XCreateWindow(m_display\n\t\t\t\t\t\t\t\t\t, root\n\t\t\t\t\t\t\t\t\t, 0, 0\n\t\t\t\t\t\t\t\t\t, ENTRY_DEFAULT_WIDTH, ENTRY_DEFAULT_HEIGHT, 0, depth\n\t\t\t\t\t\t\t\t\t, InputOutput\n\t\t\t\t\t\t\t\t\t, visual\n\t\t\t\t\t\t\t\t\t, CWBorderPixel|CWEventMask\n\t\t\t\t\t\t\t\t\t, &windowAttrs\n\t\t\t\t\t\t\t\t\t);\n\n\t\t\tconst char *wmDeleteWindowName = \"WM_DELETE_WINDOW\";\n\t\t\tAtom wmDeleteWindow;\n\t\t\tXInternAtoms(m_display, (char **)&wmDeleteWindowName, 1, False, &wmDeleteWindow);\n\t\t\tXSetWMProtocols(m_display, m_window, &wmDeleteWindow, 1);\n\n\t\t\tXMapWindow(m_display, m_window);\n\t\t\tXStoreName(m_display, m_window, \"BGFX\");\n\n\t\t\tbgfx::x11SetDisplayWindow(m_display, m_window);\n\n\t\t\tMainThreadEntry mte;\n\t\t\tmte.m_argc = _argc;\n\t\t\tmte.m_argv = _argv;\n\n\t\t\tbx::Thread thread;\n\t\t\tthread.init(mte.threadFunc, &mte);\n\n\t\t\twhile (!m_exit)\n\t\t\t{\n\t\t\t\tif (XPending(m_display) )\n\t\t\t\t{\n\t\t\t\t\tXEvent event;\n\t\t\t\t\tXNextEvent(m_display, &event);\n\n\t\t\t\t\tswitch (event.type)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase Expose:\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ConfigureNotify:\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ClientMessage:\n\t\t\t\t\t\t\tif((Atom)event.xclient.data.l[0] == wmDeleteWindow)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tm_eventQueue.postExitEvent();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ButtonPress:\n\t\t\t\t\t\tcase ButtonRelease:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XButtonEvent& xbutton = event.xbutton;\n\t\t\t\t\t\t\t\tMouseButton::Enum mb;\n\t\t\t\t\t\t\t\tswitch (xbutton.button)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tcase Button1: mb = MouseButton::Left; break;\n\t\t\t\t\t\t\t\t\tcase Button2: mb = MouseButton::Middle; break;\n\t\t\t\t\t\t\t\t\tcase Button3: mb = MouseButton::Right; break;\n\t\t\t\t\t\t\t\t\tdefault: mb = MouseButton::None; break;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (MouseButton::None != mb)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tm_eventQueue.postMouseEvent(xbutton.x\n\t\t\t\t\t\t\t\t\t\t, xbutton.y\n\t\t\t\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t\t\t\t, mb\n\t\t\t\t\t\t\t\t\t\t, event.type == ButtonPress\n\t\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase MotionNotify:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XMotionEvent& xmotion = event.xmotion;\n\t\t\t\t\t\t\t\tm_eventQueue.postMouseEvent(xmotion.x\n\t\t\t\t\t\t\t\t\t\t, xmotion.y\n\t\t\t\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase KeyPress:\n\t\t\t\t\t\tcase KeyRelease:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tXKeyEvent& xkey = event.xkey;\n\t\t\t\t\t\t\t\tKeySym keysym = XLookupKeysym(&xkey, 0);\n\t\t\t\t\t\t\t\tswitch (keysym)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase XK_Meta_L: setModifier(Modifier::LeftMeta, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Meta_R: setModifier(Modifier::RightMeta, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Control_L: setModifier(Modifier::LeftCtrl, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Control_R: setModifier(Modifier::RightCtrl, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Shift_L: setModifier(Modifier::LeftShift, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Shift_R: setModifier(Modifier::RightShift, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Alt_L: setModifier(Modifier::LeftAlt, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Alt_R: setModifier(Modifier::RightAlt, KeyPress == event.type); break;\n\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tKey::Enum key = fromXk(keysym);\n\t\t\t\t\t\t\t\t\t\tif (Key::None != key)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tm_eventQueue.postKeyEvent(key, m_modifiers, KeyPress == event.type);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ResizeRequest:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XResizeRequestEvent& xresize = event.xresizerequest;\n\t\t\t\t\t\t\t\tXResizeWindow(m_display, m_window, xresize.width, xresize.height);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthread.shutdown();\n\n\t\t\tXUnmapWindow(m_display, m_window);\n\t\t\tXDestroyWindow(m_display, m_window);\n\n\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\n\t\tvoid setModifier(Modifier::Enum _modifier, bool _set)\n\t\t{\n\t\t\tm_modifiers &= ~_modifier;\n\t\t\tm_modifiers |= _set ? _modifier : 0;\n\t\t}\n\n\t\tuint8_t m_modifiers;\n\t\tDisplay* m_display;\n\t\tWindow m_window;\n\t\tbool m_exit;\n\n\t\tEventQueue m_eventQueue;\n\t};\n\n\tstatic Context s_ctx;\n\n\tint32_t MainThreadEntry::threadFunc(void* _userData)\n\t{\n\t\tMainThreadEntry* self = (MainThreadEntry*)_userData;\n\t\tint32_t result = main(self->m_argc, self->m_argv);\n\t\ts_ctx.m_exit = true;\n\t\treturn result;\n\t}\n\n\tconst Event* poll()\n\t{\n\t\treturn s_ctx.m_eventQueue.poll();\n\t}\n\n\tvoid release(const Event* _event)\n\t{\n\t\ts_ctx.m_eventQueue.release(_event);\n\t}\n\n\tvoid setWindowSize(uint32_t _width, uint32_t _height)\n\t{\n\t\tXResizeRequestEvent ev;\n\t\tev.type = ResizeRequest;\n\t\tev.serial = 0;\n\t\tev.send_event = true;\n\t\tev.display = s_ctx.m_display;\n\t\tev.window = s_ctx.m_window;\n\t\tev.width = (int)_width;\n\t\tev.height = (int)_height;\n\t\tXSendEvent(s_ctx.m_display, s_ctx.m_window, false, ResizeRedirectMask, (XEvent*)&ev);\n\t}\n\n\tvoid setWindowTitle(const char* _title)\n\t{\n\t\tBX_UNUSED(_title);\n\t}\n\n\tvoid toggleWindowFrame()\n\t{\n\t}\n\n\tvoid setMouseLock(bool _lock)\n\t{\n\t\tBX_UNUSED(_lock);\n\t}\n\n} \/\/ namespace entry\n\nint main(int _argc, char** _argv)\n{\n\tusing namespace entry;\n\treturn s_ctx.run(_argc, _argv);\n}\n\n#endif \/\/ ENTRY_CONFIG_USE_NATIVE && (BX_PLATFORM_FREEBSD || BX_PLATFORM_LINUX || BX_PLATFORM_RPI)\n<commit_msg>Fixed x11.<commit_after>\/*\n * Copyright 2011-2014 Branimir Karadzic. All rights reserved.\n * License: http:\/\/www.opensource.org\/licenses\/BSD-2-Clause\n *\/\n\n#include \"entry_p.h\"\n\n#if ENTRY_CONFIG_USE_NATIVE && (BX_PLATFORM_FREEBSD || BX_PLATFORM_LINUX || BX_PLATFORM_RPI)\n\n#define XK_MISCELLANY\n#define XK_LATIN1\n#include <X11\/keysymdef.h>\n#include <bgfxplatform.h> \/\/ will include X11 which #defines None... Don't mess with order of includes.\n\n#undef None\n#include <bx\/thread.h>\n#include <bx\/os.h>\n#include <string.h> \/\/ memset\n\nnamespace entry\n{\n\tstatic uint8_t s_translateKey[512];\n\n\tstatic void initTranslateKey(uint16_t _xk, Key::Enum _key)\n\t{\n\t\t_xk += 256;\n\t\tBX_CHECK(_xk < BX_COUNTOF(s_translateKey), \"Out of bounds %d.\", _xk);\n\t\ts_translateKey[_xk&0x1ff] = (uint8_t)_key;\n\t}\n\n\tKey::Enum fromXk(uint16_t _xk)\n\t{\n\t\t_xk += 256;\n\t\treturn 512 > _xk ? (Key::Enum)s_translateKey[_xk] : Key::None;\n\t}\n\n\tstruct MainThreadEntry\n\t{\n\t\tint m_argc;\n\t\tchar** m_argv;\n\n\t\tstatic int32_t threadFunc(void* _userData);\n\t};\n\n\tstruct Context\n\t{\n\t\tContext()\n\t\t\t: m_modifiers(Modifier::None)\n\t\t\t, m_exit(false)\n\t\t{\n\t\t\tmemset(s_translateKey, 0, sizeof(s_translateKey) );\n\t\t\tinitTranslateKey(XK_Escape, Key::Esc);\n\t\t\tinitTranslateKey(XK_Return, Key::Return);\n\t\t\tinitTranslateKey(XK_Tab, Key::Tab);\n\t\t\tinitTranslateKey(XK_BackSpace, Key::Backspace);\n\t\t\tinitTranslateKey(XK_space, Key::Space);\n\t\t\tinitTranslateKey(XK_Up, Key::Up);\n\t\t\tinitTranslateKey(XK_Down, Key::Down);\n\t\t\tinitTranslateKey(XK_Left, Key::Left);\n\t\t\tinitTranslateKey(XK_Right, Key::Right);\n\t\t\tinitTranslateKey(XK_Page_Up, Key::PageUp);\n\t\t\tinitTranslateKey(XK_Page_Down, Key::PageUp);\n\t\t\tinitTranslateKey(XK_Home, Key::Home);\n\t\t\tinitTranslateKey(XK_KP_End, Key::End);\n\t\t\tinitTranslateKey(XK_Print, Key::Print);\n\t\t\tinitTranslateKey(XK_equal, Key::Plus);\n\t\t\tinitTranslateKey(XK_minus, Key::Minus);\n\t\t\tinitTranslateKey(XK_F1, Key::F1);\n\t\t\tinitTranslateKey(XK_F2, Key::F2);\n\t\t\tinitTranslateKey(XK_F3, Key::F3);\n\t\t\tinitTranslateKey(XK_F4, Key::F4);\n\t\t\tinitTranslateKey(XK_F5, Key::F5);\n\t\t\tinitTranslateKey(XK_F6, Key::F6);\n\t\t\tinitTranslateKey(XK_F7, Key::F7);\n\t\t\tinitTranslateKey(XK_F8, Key::F8);\n\t\t\tinitTranslateKey(XK_F9, Key::F9);\n\t\t\tinitTranslateKey(XK_F10, Key::F10);\n\t\t\tinitTranslateKey(XK_F11, Key::F11);\n\t\t\tinitTranslateKey(XK_F12, Key::F12);\n\t\t\tinitTranslateKey(XK_KP_Insert, Key::NumPad0);\n\t\t\tinitTranslateKey(XK_KP_End, Key::NumPad1);\n\t\t\tinitTranslateKey(XK_KP_Down, Key::NumPad2);\n\t\t\tinitTranslateKey(XK_KP_Page_Down, Key::NumPad3);\n\t\t\tinitTranslateKey(XK_KP_Left, Key::NumPad4);\n\t\t\tinitTranslateKey(XK_KP_Begin, Key::NumPad5);\n\t\t\tinitTranslateKey(XK_KP_Right, Key::NumPad6);\n\t\t\tinitTranslateKey(XK_KP_Home, Key::NumPad7);\n\t\t\tinitTranslateKey(XK_KP_Up, Key::NumPad8);\n\t\t\tinitTranslateKey(XK_KP_Page_Up, Key::NumPad9);\n\t\t\tinitTranslateKey('0', Key::Key0);\n\t\t\tinitTranslateKey('1', Key::Key1);\n\t\t\tinitTranslateKey('2', Key::Key2);\n\t\t\tinitTranslateKey('3', Key::Key3);\n\t\t\tinitTranslateKey('4', Key::Key4);\n\t\t\tinitTranslateKey('5', Key::Key5);\n\t\t\tinitTranslateKey('6', Key::Key6);\n\t\t\tinitTranslateKey('7', Key::Key7);\n\t\t\tinitTranslateKey('8', Key::Key8);\n\t\t\tinitTranslateKey('9', Key::Key9);\n\t\t\tinitTranslateKey('a', Key::KeyA);\n\t\t\tinitTranslateKey('b', Key::KeyB);\n\t\t\tinitTranslateKey('c', Key::KeyC);\n\t\t\tinitTranslateKey('d', Key::KeyD);\n\t\t\tinitTranslateKey('e', Key::KeyE);\n\t\t\tinitTranslateKey('f', Key::KeyF);\n\t\t\tinitTranslateKey('g', Key::KeyG);\n\t\t\tinitTranslateKey('h', Key::KeyH);\n\t\t\tinitTranslateKey('i', Key::KeyI);\n\t\t\tinitTranslateKey('j', Key::KeyJ);\n\t\t\tinitTranslateKey('k', Key::KeyK);\n\t\t\tinitTranslateKey('l', Key::KeyL);\n\t\t\tinitTranslateKey('m', Key::KeyM);\n\t\t\tinitTranslateKey('n', Key::KeyN);\n\t\t\tinitTranslateKey('o', Key::KeyO);\n\t\t\tinitTranslateKey('p', Key::KeyP);\n\t\t\tinitTranslateKey('q', Key::KeyQ);\n\t\t\tinitTranslateKey('r', Key::KeyR);\n\t\t\tinitTranslateKey('s', Key::KeyS);\n\t\t\tinitTranslateKey('t', Key::KeyT);\n\t\t\tinitTranslateKey('u', Key::KeyU);\n\t\t\tinitTranslateKey('v', Key::KeyV);\n\t\t\tinitTranslateKey('w', Key::KeyW);\n\t\t\tinitTranslateKey('x', Key::KeyX);\n\t\t\tinitTranslateKey('y', Key::KeyY);\n\t\t\tinitTranslateKey('z', Key::KeyZ);\n\t\t}\n\n\t\tint32_t run(int _argc, char** _argv)\n\t\t{\n\t\t\tXInitThreads();\n\t\t\tm_display = XOpenDisplay(0);\n\n\t\t\tint32_t screen = DefaultScreen(m_display);\n\t\t\tint32_t depth = DefaultDepth(m_display, screen);\n\t\t\tVisual* visual = DefaultVisual(m_display, screen);\n\t\t\tWindow root = RootWindow(m_display, screen);\n\n\t\t\tXSetWindowAttributes windowAttrs;\n\t\t\tmemset(&windowAttrs, 0, sizeof(windowAttrs) );\n\t\t\twindowAttrs.background_pixmap = 0;\n\t\t\twindowAttrs.border_pixel = 0;\n\t\t\twindowAttrs.event_mask = 0\n\t\t\t\t\t| ButtonPressMask\n\t\t\t\t\t| ButtonReleaseMask\n\t\t\t\t\t| ExposureMask\n\t\t\t\t\t| KeyPressMask\n\t\t\t\t\t| KeyReleaseMask\n\t\t\t\t\t| PointerMotionMask\n\t\t\t\t\t| ResizeRedirectMask\n\t\t\t\t\t| StructureNotifyMask\n\t\t\t\t\t;\n\n\t\t\tm_window = XCreateWindow(m_display\n\t\t\t\t\t\t\t\t\t, root\n\t\t\t\t\t\t\t\t\t, 0, 0\n\t\t\t\t\t\t\t\t\t, ENTRY_DEFAULT_WIDTH, ENTRY_DEFAULT_HEIGHT, 0, depth\n\t\t\t\t\t\t\t\t\t, InputOutput\n\t\t\t\t\t\t\t\t\t, visual\n\t\t\t\t\t\t\t\t\t, CWBorderPixel|CWEventMask\n\t\t\t\t\t\t\t\t\t, &windowAttrs\n\t\t\t\t\t\t\t\t\t);\n\n\t\t\tconst char *wmDeleteWindowName = \"WM_DELETE_WINDOW\";\n\t\t\tAtom wmDeleteWindow;\n\t\t\tXInternAtoms(m_display, (char **)&wmDeleteWindowName, 1, False, &wmDeleteWindow);\n\t\t\tXSetWMProtocols(m_display, m_window, &wmDeleteWindow, 1);\n\n\t\t\tXMapWindow(m_display, m_window);\n\t\t\tXStoreName(m_display, m_window, \"BGFX\");\n\n\t\t\tbgfx::x11SetDisplayWindow(m_display, m_window);\n\n\t\t\tMainThreadEntry mte;\n\t\t\tmte.m_argc = _argc;\n\t\t\tmte.m_argv = _argv;\n\n\t\t\tbx::Thread thread;\n\t\t\tthread.init(mte.threadFunc, &mte);\n\n\t\t\tWindowHandle defaultWindow = { 0 };\n\n\t\t\twhile (!m_exit)\n\t\t\t{\n\t\t\t\tif (XPending(m_display) )\n\t\t\t\t{\n\t\t\t\t\tXEvent event;\n\t\t\t\t\tXNextEvent(m_display, &event);\n\n\t\t\t\t\tswitch (event.type)\n\t\t\t\t\t{\n\t\t\t\t\t\tcase Expose:\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ConfigureNotify:\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ClientMessage:\n\t\t\t\t\t\t\tif((Atom)event.xclient.data.l[0] == wmDeleteWindow)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tm_eventQueue.postExitEvent();\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ButtonPress:\n\t\t\t\t\t\tcase ButtonRelease:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XButtonEvent& xbutton = event.xbutton;\n\t\t\t\t\t\t\t\tMouseButton::Enum mb;\n\t\t\t\t\t\t\t\tswitch (xbutton.button)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tcase Button1: mb = MouseButton::Left; break;\n\t\t\t\t\t\t\t\t\tcase Button2: mb = MouseButton::Middle; break;\n\t\t\t\t\t\t\t\t\tcase Button3: mb = MouseButton::Right; break;\n\t\t\t\t\t\t\t\t\tdefault: mb = MouseButton::None; break;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (MouseButton::None != mb)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tm_eventQueue.postMouseEvent(defaultWindow\n\t\t\t\t\t\t\t\t\t\t, xbutton.x\n\t\t\t\t\t\t\t\t\t\t, xbutton.y\n\t\t\t\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t\t\t\t, mb\n\t\t\t\t\t\t\t\t\t\t, event.type == ButtonPress\n\t\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase MotionNotify:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XMotionEvent& xmotion = event.xmotion;\n\t\t\t\t\t\t\t\tm_eventQueue.postMouseEvent(defaultWindow\n\t\t\t\t\t\t\t\t\t\t, xmotion.x\n\t\t\t\t\t\t\t\t\t\t, xmotion.y\n\t\t\t\t\t\t\t\t\t\t, 0\n\t\t\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase KeyPress:\n\t\t\t\t\t\tcase KeyRelease:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tXKeyEvent& xkey = event.xkey;\n\t\t\t\t\t\t\t\tKeySym keysym = XLookupKeysym(&xkey, 0);\n\t\t\t\t\t\t\t\tswitch (keysym)\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tcase XK_Meta_L: setModifier(Modifier::LeftMeta, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Meta_R: setModifier(Modifier::RightMeta, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Control_L: setModifier(Modifier::LeftCtrl, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Control_R: setModifier(Modifier::RightCtrl, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Shift_L: setModifier(Modifier::LeftShift, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Shift_R: setModifier(Modifier::RightShift, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Alt_L: setModifier(Modifier::LeftAlt, KeyPress == event.type); break;\n\t\t\t\t\t\t\t\tcase XK_Alt_R: setModifier(Modifier::RightAlt, KeyPress == event.type); break;\n\n\t\t\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tKey::Enum key = fromXk(keysym);\n\t\t\t\t\t\t\t\t\t\tif (Key::None != key)\n\t\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\t\tm_eventQueue.postKeyEvent(defaultWindow, key, m_modifiers, KeyPress == event.type);\n\t\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase ResizeRequest:\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tconst XResizeRequestEvent& xresize = event.xresizerequest;\n\t\t\t\t\t\t\t\tXResizeWindow(m_display, m_window, xresize.width, xresize.height);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthread.shutdown();\n\n\t\t\tXUnmapWindow(m_display, m_window);\n\t\t\tXDestroyWindow(m_display, m_window);\n\n\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\n\t\tvoid setModifier(Modifier::Enum _modifier, bool _set)\n\t\t{\n\t\t\tm_modifiers &= ~_modifier;\n\t\t\tm_modifiers |= _set ? _modifier : 0;\n\t\t}\n\n\t\tuint8_t m_modifiers;\n\t\tDisplay* m_display;\n\t\tWindow m_window;\n\t\tbool m_exit;\n\n\t\tEventQueue m_eventQueue;\n\t};\n\n\tstatic Context s_ctx;\n\n\tint32_t MainThreadEntry::threadFunc(void* _userData)\n\t{\n\t\tMainThreadEntry* self = (MainThreadEntry*)_userData;\n\t\tint32_t result = main(self->m_argc, self->m_argv);\n\t\ts_ctx.m_exit = true;\n\t\treturn result;\n\t}\n\n\tconst Event* poll()\n\t{\n\t\treturn s_ctx.m_eventQueue.poll();\n\t}\n\n\tvoid release(const Event* _event)\n\t{\n\t\ts_ctx.m_eventQueue.release(_event);\n\t}\n\n\tvoid setWindowSize(WindowHandle _handle, uint32_t _width, uint32_t _height)\n\t{\n\t\tBX_UNUSED(_handle);\n\t\tXResizeRequestEvent ev;\n\t\tev.type = ResizeRequest;\n\t\tev.serial = 0;\n\t\tev.send_event = true;\n\t\tev.display = s_ctx.m_display;\n\t\tev.window = s_ctx.m_window;\n\t\tev.width = (int)_width;\n\t\tev.height = (int)_height;\n\t\tXSendEvent(s_ctx.m_display, s_ctx.m_window, false, ResizeRedirectMask, (XEvent*)&ev);\n\t}\n\n\tvoid setWindowTitle(WindowHandle _handle, const char* _title)\n\t{\n\t\tBX_UNUSED(_handle, _title);\n\t}\n\n\tvoid toggleWindowFrame(WindowHandle _handle)\n\t{\n\t\tBX_UNUSED(_handle);\n\t}\n\n\tvoid setMouseLock(WindowHandle _handle, bool _lock)\n\t{\n\t\tBX_UNUSED(_handle, _lock);\n\t}\n\n} \/\/ namespace entry\n\nint main(int _argc, char** _argv)\n{\n\tusing namespace entry;\n\treturn s_ctx.run(_argc, _argv);\n}\n\n#endif \/\/ ENTRY_CONFIG_USE_NATIVE && (BX_PLATFORM_FREEBSD || BX_PLATFORM_LINUX || BX_PLATFORM_RPI)\n<|endoftext|>"} {"text":"<commit_before>#ifndef APPLICATION_H\n#define APPLICATION_H\n\n#include <glbinding\/Binding.h>\n#include <glbinding\/gl\/gl.h>\n#define GLFW_INCLUDE_NONE\n\n#include \"EditorScene.hpp\"\n#include \"Logger.hpp\"\n#include \"Renderer.hpp\"\n#include \"Scene.hpp\"\n#include \"Window.hpp\"\n#include \"input.hpp\"\n#include <GLFW\/glfw3.h>\n#include <SWI-cpp.h>\n#include <functional>\n#include <iostream>\n#include <physfs.h>\n#include <queue>\n#include <sstream>\n#include <stdexcept>\n#include <unordered_set>\n\nclass Application final {\n\tprivate:\n\tstd::shared_ptr<Window> m_window;\n\tRenderer m_renderer;\n\n\tstruct KeyHash {\n\t\tstd::size_t operator()(const std::pair<int, int>& key) const {\n\t\t\t\/\/ Requires the pair to be ordered as (key, modifiers)\n\t\t\treturn key.first << 4 | key.second;\n\t\t}\n\t};\n\tstatic std::mutex s_keyQueueMutex;\n\tstatic std::unordered_set<std::pair<int, int>, KeyHash> s_keysPressed;\n\tstatic std::queue<KeyEvent> s_keyQueue;\n\n\tstatic std::mutex s_buttonQueueMutex;\n\tstatic std::queue<MouseButtonEvent> s_buttonQueue;\n\n\tstatic std::mutex s_movementQueueMutex;\n\tstatic std::queue<MouseMovementEvent> s_movementQueue;\n\n\tvoid initFilesystem(int argc, char** argv);\n\n\tstatic void\n\tkey_callback(GLFWwindow*, int key, int, int action, int modifiers);\n\tstatic void\n\tmouse_button_callback(GLFWwindow*, int button, int action, int mods);\n\tstatic void\n\tcursor_position_callback(GLFWwindow* window, double xpos, double ypos);\n\n\tvoid processInput();\n\tvoid draw();\n\n\tScene* m_scene; \/\/ TODO: Temporary variable for dev. purposes. Remove.\n\n\tpublic:\n\tApplication(int argc, char** argv);\n\tApplication(const Application&) = delete;\n\tApplication& operator=(const Application&) = delete;\n\t~Application();\n\n\tvoid run();\n};\n\n#endif\n<commit_msg>Hash\/input-type documentation<commit_after>#ifndef APPLICATION_H\n#define APPLICATION_H\n\n#include <glbinding\/Binding.h>\n#include <glbinding\/gl\/gl.h>\n#define GLFW_INCLUDE_NONE\n\n#include \"EditorScene.hpp\"\n#include \"Logger.hpp\"\n#include \"Renderer.hpp\"\n#include \"Scene.hpp\"\n#include \"Window.hpp\"\n#include \"input.hpp\"\n#include <GLFW\/glfw3.h>\n#include <SWI-cpp.h>\n#include <functional>\n#include <iostream>\n#include <physfs.h>\n#include <queue>\n#include <sstream>\n#include <stdexcept>\n#include <unordered_set>\n\nclass Application final {\n\tprivate:\n\tstd::shared_ptr<Window> m_window;\n\tRenderer m_renderer;\n\n\tstruct KeyHash {\n\t\t\/\/ Hash function appends 4-bit modifier to 8-bit ASCII key code\n\t\t\/\/ Requires the pair to be ordered as (key, modifiers)\n\t\tstd::size_t operator()(const std::pair<int, int>& key) const {\n\t\t\treturn key.first << 4 | key.second;\n\t\t}\n\t};\n\tstatic std::mutex s_keyQueueMutex;\n\tstatic std::unordered_set<std::pair<int, int>, KeyHash> s_keysPressed;\n\tstatic std::queue<KeyEvent> s_keyQueue;\n\n\tstatic std::mutex s_buttonQueueMutex;\n\tstatic std::queue<MouseButtonEvent> s_buttonQueue;\n\n\tstatic std::mutex s_movementQueueMutex;\n\tstatic std::queue<MouseMovementEvent> s_movementQueue;\n\n\tvoid initFilesystem(int argc, char** argv);\n\n\tstatic void\n\tkey_callback(GLFWwindow*, int key, int, int action, int modifiers);\n\tstatic void\n\tmouse_button_callback(GLFWwindow*, int button, int action, int mods);\n\tstatic void\n\tcursor_position_callback(GLFWwindow* window, double xpos, double ypos);\n\n\tvoid processInput();\n\tvoid draw();\n\n\tScene* m_scene; \/\/ TODO: Temporary variable for dev. purposes. Remove.\n\n\tpublic:\n\tApplication(int argc, char** argv);\n\tApplication(const Application&) = delete;\n\tApplication& operator=(const Application&) = delete;\n\t~Application();\n\n\tvoid run();\n};\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <vector>\n#include <string>\n#include <cstdlib>\n#include <boost\/foreach.hpp>\n#include <boost\/tokenizer.hpp>\n\nusing namespace std;\nusing namespace boost;\n\n\/\/ vector<string> split(string input) \/\/ split strings because of spaces\n\/\/ { \/\/ and semicolons\n\/\/ \tvector<string> result; \/\/ Other applicable symbols are \n\/\/ \t \/\/ also accounted for.\n\/\/ \tint j = 0;\n\/\/ \tint countSpaces = 0;\n\/\/ \tint countSemicolons = 0;\n\/\/ \tint countComments = 0;\n\t\n\/\/ \tresult.push_back(\"\");\n\t\n\/\/ \tfor (int i = 0; i < input.size(); ++i)\n\/\/ \t{\n\/\/ \t\tif (input.at(i) != ' ' && input.at(i) != ';' && input.at(i) != '#')\n\/\/ \t\t{\n\/\/ \t\t\tcountSpaces = 0;\n\/\/ \t\t\tcountSemicolons = 0;\n\/\/ \t\t\tresult.at(j) = result.at(j) + input.at(i);\n\/\/ \t\t}\n\/\/ \t\telse if (input.at(i) == ' ') \/\/ make sure duplicate spaces do not \n\/\/ \t\t{ \/\/ count\n\/\/ \t\t\t++countSpaces;\n\/\/ \t\t\tif (countSpaces == 1)\n\/\/ \t\t\t{\n\/\/ \t\t\t\t++j;\n\/\/ \t\t\t\tresult.push_back(\"\");\n\/\/ \t\t\t}\n\/\/ \t\t}\n\t\t\n\/\/ \t\telse if (input.at(i) == ';')\n\/\/ \t\t{\n\/\/ \t\t\t++countSemicolons;\n\t\t\t\n\/\/ \t\t\tif (countSemicolons > 1)\n\/\/ \t\t\t{\n\/\/ \t\t\t\tcout << \"Error: Multiple semicolons.\" << endl;\n\/\/ \t\t\t\texit(0);\n\/\/ \t\t\t}\n\/\/ \t\t\telse\n\/\/ \t\t\t{\n\/\/ \t\t\t\t++j;\n\/\/ \t\t\t\tresult.push_back(\";\");\n\/\/ \t\t\t}\n\/\/ \t\t}\n\t\t\n\/\/ \t\telse if (input.at(i) == '#')\n\/\/ \t\t{\n\/\/ \t\t\t++countComments;\n\t\t\t\n\/\/ \t\t\tif (countComments >= 1)\n\/\/ \t\t\t{\n\t\t\t\t\n\/\/ \t\t\t}\n\/\/ \t\t}\n\/\/ \t}\n\t\n\t\n\/\/ \treturn result;\n\/\/ }\n\n\nclass BaseConnector\n{\n\t\n\t\n\tpublic:\n\t\tvirtual ~BaseConnector() = 0;\n\t\t\n\t\t\n};\n\n\n\/\/ Virtual destructor that needs a function body.\nBaseConnector::~BaseConnector() \n{\n\t\n}\n\n\nint main(int argc, char *argv[]) \n{\n\tchar command_prompt = '$';\t\t\/\/ Used to prompt commands\n\tbool loop = true; \/\/ If it should continue running, then true\n\t\n\tstring input; \/\/ used to read the inputs, including spaces\n\tvector<string> result;\n\t\n\tcout << command_prompt << ' ';\n\twhile (loop)\n\t{\n\t\t\n\t\tgetline(cin, input);\n\t\t\n\t\t\/\/ Resize the string if there are any # symbols\n\t\tfor (int i = 0; i < input.size(); ++i)\n\t\t{\n\t\t\tif (input.at(i) == '#')\n\t\t\t{\n\t\t\t\tinput.resize(i);\n\t\t\t}\n\t\t}\n\t\t\n\t\tchar_separator<char> separation(\"; \");\n\t\ttokenizer< char_separator<char> > token_text(input, separation);\n\t\tBOOST_FOREACH (const string &t, token_text)\n\t\t{\n\t\t\tresult.push_back(t);\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < result.size(); ++i) \/\/ for debugging split \n\t\t{ \/\/ vector\n\t\t\tcout << result.at(i) << i << endl;\n\t\t}\n\t\t\n\t\tif (input == \"exit\")\n\t\t{\n\t\t\tloop = false;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t\tif (loop == true)\n\t\t{\n\t\t\tcout << command_prompt << ' ';\n\t\t}\n\t}\n\t\n\treturn 0;\n}\n<commit_msg>Added comments feature<commit_after>\/\/ Franklin Yang\n\/\/ lab 2\n\n\n\/\/ Given specification, design a system\n\/\/ Use vim\n\n\/\/ Submit your code: 1) ilearn \n\/\/ OR\n\/\/ email at darvisha@cs.ucr.edu\n\/\/ Deadline: Friday 5pm\n\/\/ THursday 1:00 pm\n\n\/\/ Compile:\n\/\/ g++ test.c -o test\n\/\/ .\/test\n\n#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n\nclass Vehicle {\n private:\n double speed_per_hour;\n string vehicleName;\n \n public:\n \n void inputSpeed(double speed)\n {\n speed_per_hour = speed;\n }\n \n void inputVehicleName(string vName)\n {\n vehicleName = vName;\n }\n \n double getSpeed()\n {\n return speed_per_hour;\n }\n \n string getVehicleName()\n {\n return vehicleName;\n }\n \n \/\/ Output name of vehicle \n void go(double timeHours)\n {\n cout << vehicleName << \": \" << timeHours * speed_per_hour << endl;\n }\n};\n\nclass Land: public Vehicle {\n private:\n int number_of_wheels;\n int number_of_seats;\n \n public:\n void modify_wheels(int numWheels)\n {\n number_of_wheels = numWheels;\n }\n \n void modify_seats(int numSeats)\n {\n number_of_seats = numSeats;\n }\n \n int check_wheels()\n {\n return number_of_wheels;\n }\n \n int check_seats()\n {\n return number_of_seats;\n }\n};\n\nclass Air: public Vehicle {\n private:\n \n public:\n \n};\n\nclass Water: public Vehicle {\n private:\n int number_of_seats;\n int number_of_doors;\n public:\n void modify_seats(int numSeats)\n {\n number_of_seats = numSeats;\n }\n void modify_doors(int numDoors)\n {\n number_of_doors = numDoors;\n }\n int check_seats()\n {\n return number_of_seats;\n }\n int check_doors()\n {\n return number_of_doors;\n }\n};\n\n\nclass Bus: public Land {\n \n private:\n int number_of_doors;\n double fare;\n \n public:\n \n Bus()\n {\n number_of_doors = 2;\n modify_seats(40);\n modify_wheels(6);\n fare = 1.25;\n inputSpeed(50);\n inputVehicleName(\"Bus\");\n }\n \n};\n\nclass Coup: public Land {\n \n private:\n int number_of_doors;\n \n public:\n Coup()\n {\n number_of_doors = 2;\n modify_seats(4);\n modify_wheels(4);\n inputSpeed(120);\n inputVehicleName(\"Coup\");\n }\n \n};\n\nclass Sedan: public Land {\n private:\n int number_of_doors;\n \n public:\n Sedan()\n {\n number_of_doors = 4;\n modify_seats(4);\n modify_wheels(4);\n inputSpeed(100);\n inputVehicleName(\"Sedan\");\n }\n};\n\nclass Motorcycle: public Land {\n private:\n \n public:\n Motorcycle()\n {\n modify_seats(1);\n modify_wheels(2);\n inputSpeed(80);\n inputVehicleName(\"Motorcycle\");\n }\n};\n\nclass Bicycle: public Land {\n private:\n \n public:\n Bicycle()\n {\n modify_seats(1);\n modify_wheels(2);\n inputSpeed(25.25);\n inputVehicleName(\"Bicycle\");\n }\n};\n\n\/\/ The hover board, implied by its name, should be an air vehicle.\n\/\/ However, it has wheels, so that makes it that the two provided air vehicles\n\/\/ have only speed in common.\nclass Hoverboard: public Air {\n private:\n int number_of_wheels;\n public:\n Hoverboard()\n {\n number_of_wheels = 4;\n inputSpeed(30.00);\n inputVehicleName(\"Hover board\");\n }\n \n};\n\nclass Paddleboat: public Water {\n private:\n string shape_of_boat;\n public:\n Paddleboat()\n {\n modify_seats(2);\n modify_doors(2);\n inputSpeed(10.00);\n shape_of_boat = \"swan\";\n inputVehicleName(\"Paddleboat\");\n }\n};\n\nclass FalconRocket: public Air {\n private:\n int number_of_seats;\n int number_of_doors;\n int tons_of_fuel;\n int tons_of_payload;\n \n public:\n FalconRocket()\n {\n number_of_seats = 6;\n number_of_doors = 1;\n tons_of_fuel = 9000;\n tons_of_payload = 2000;\n inputSpeed(2112662.054);\n inputVehicleName(\"Falcon Rocket\");\n }\n \n};\n\nclass Airplane: public Air {\n private:\n int number_of_seats;\n int number_of_doors;\n int number_of_wheels;\n public:\n Airplane()\n {\n number_of_seats = 500;\n number_of_doors = 6;\n number_of_wheels = 18\n inputSpeed(550);\n inputVehicleName(\"Passenger Plane\");\n }\n};\n\nclass Forklift: public Land {\n private:\n int max_weight_kg;\n public:\n Forklift()\n {\n modify_seats(1);\n modify_wheels(4);\n max_weight_kg = 10000;\n inputSpeed(25);\n inputVehicleName(\"Forklift\");\n }\n};\n\nclass Jet: public Air {\n private:\n int number_of_seats;\n public:\n Jet()\n {\n number_of_seats = 2;\n inputSpeed(7200);\n inputVehicleName(\"Jet\");\n }\n};\n\nint main()\n{\n vector<Vehicle> vehicleVector;\n Bus bus1;\n Coup coup1;\n Sedan sedan1;\n Motorcycle motorcycle1;\n Bicycle bicycle1;\n Hoverboard hoverboard1;\n Paddleboat paddleboat1;\n FalconRocket falconrocket1;\n \n Airplane airplane1;\n Forklift forklift1;\n Jet jet1;\n \n vehicleVector.push_back(bus1);\n vehicleVector.push_back(coup1);\n vehicleVector.push_back(sedan1);\n vehicleVector.push_back(motorcycle1);\n vehicleVector.push_back(bicycle1);\n vehicleVector.push_back(hoverboard1);\n vehicleVector.push_back(paddleboat1);\n vehicleVector.push_back(falconrocket1);\n \n vehicleVector.push_back(airplane1);\n vehicleVector.push_back(forklift1);\n vehicleVector.push_back(jet1);\n \n int inputTime;\n \n cout << \"Please input the time: \";\n cin >> inputTime;\n \n for (int i = 0; i < vehicleVector.size(); ++i)\n {\n vehicleVector.at(i).go(inputTime);\n }\n \n return 0;\n}\n\n\n\/\/ Part A: Why did you design the system like this?\n\n\/\/ SI units?\n\n\n\/\/ Part B: What decisions that you made in part A made it difficult to extend?\n\n\n\n\/\/ Part C: What did you add, and how is that different from A and B?\n\n\n\/\/ http:\/\/www.cplusplus.com\/doc\/tutorial\/inheritance\/<|endoftext|>"} {"text":"<commit_before>\/**\n * (c) 2016 David \"Danilaw\" Soria Parra\n * vim: set ts=2 sts=2 sw=2 expandtab: \n *\/\n#ifdef HAVE_COLLECTD\nextern \"C\" {\n#define HAVE_ENDIAN_H 1\n#include <endian.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <collectd\/liboconfig\/oconfig.h>\n#include <collectd\/core\/daemon\/collectd.h>\n#include <collectd\/core\/daemon\/common.h> \/* auxiliary functions *\/\n#include <collectd\/core\/daemon\/plugin.h> \/* plugin_register_*, plugin_dispatch_values *\/\n}\n#endif\n\n#include <cstdlib>\n#include <memory>\n#include <string>\n\n#include \"collector.h\"\n\n\/\/ static const char * PLUGIN_NAME = \"mumble\";\n#define PLUGIN_NAME \"mumble\"\n\nstatic const char *config_keys[] = {\"IceHost\", \"IcePort\", \"IceSecret\"};\nstatic std::string ice_host = \"\";\nstatic std::string ice_secret = \"\";\nstatic uint32_t ice_port = 6502;\nstatic int config_keys_num = sizeof(config_keys);\n\nMumbleCollector *collector = nullptr;\n\n#ifdef HAVE_COLLECTD\nstatic int my_config(const char *key, const char *value) {\n if (strcmp(key, \"IcePort\") == 0) {\n auto mport = strtol(key, nullptr, 10);\n assert(mport > 0 && mport < 65536);\n ice_port = static_cast<uint32_t>(mport);\n return 0;\n }\n\n if (strcmp(key, \"IceHost\") == 0) {\n ice_host = std::string(value);\n return 0;\n }\n\n if (strcmp(key, \"IceSecret\") == 0) {\n ice_secret = std::string(value);\n return 0;\n }\n return 1;\n}\n\nstatic int my_init(void) {\n collector = new MumbleCollector(ice_host, ice_port, ice_secret);\n return 0;\n}\n\nstatic int my_shutdown(void) {\n if (collector) {\n delete collector;\n }\n return 0;\n}\n\nstatic int my_read(void) {\n value_t values[1];\n value_list_t vl = VALUE_LIST_INIT;\n\n values[0].gauge = collector->getUserCount();\n\n vl.values = values;\n vl.values_len = STATIC_ARRAY_SIZE(values);\n sstrncpy(vl.host, hostname_g, sizeof(vl.host));\n sstrncpy(vl.plugin, PLUGIN_NAME, sizeof(vl.plugin));\n sstrncpy(vl.type, \"count\", sizeof(vl.type));\n plugin_dispatch_values(&vl);\n return 0;\n}\n\n\/**\n * Definition for the datatype to be used by collectd\n *\/\nstatic data_source_t mumble_dsrc[] = {{\"count\", DS_TYPE_GAUGE, 0, NAN}};\nstatic data_set_t mumble_ds = {PLUGIN_NAME, STATIC_ARRAY_SIZE(mumble_dsrc),\n mumble_dsrc};\n\nextern \"C\" {\nvoid module_register() {\n plugin_register_data_set(&mumble_ds);\n plugin_register_config(PLUGIN_NAME, my_config, config_keys, config_keys_num);\n plugin_register_init(PLUGIN_NAME, my_init);\n plugin_register_shutdown(PLUGIN_NAME, my_shutdown);\n plugin_register_read(PLUGIN_NAME, my_read);\n}\n}\n\n#else\n\nint main(int argc, char **argv) {\n MumbleCollector collector;\n std::cout << collector.getUserCount() << std::endl;\n return 0;\n}\n#endif\n<commit_msg>default host is 127.0.0.1<commit_after>\/**\n * (c) 2016 David \"Danilaw\" Soria Parra\n * vim: set ts=2 sts=2 sw=2 expandtab: \n *\/\n#ifdef HAVE_COLLECTD\nextern \"C\" {\n#define HAVE_ENDIAN_H 1\n#include <endian.h>\n#include <stdint.h>\n#include <stdbool.h>\n#include <collectd\/liboconfig\/oconfig.h>\n#include <collectd\/core\/daemon\/collectd.h>\n#include <collectd\/core\/daemon\/common.h> \/* auxiliary functions *\/\n#include <collectd\/core\/daemon\/plugin.h> \/* plugin_register_*, plugin_dispatch_values *\/\n}\n#endif\n\n#include <cstdlib>\n#include <memory>\n#include <string>\n\n#include \"collector.h\"\n\n\/\/ static const char * PLUGIN_NAME = \"mumble\";\n#define PLUGIN_NAME \"mumble\"\n\nstatic const char *config_keys[] = {\"IceHost\", \"IcePort\", \"IceSecret\"};\nstatic std::string ice_host = \"127.0.0.1\";\nstatic std::string ice_secret = \"\";\nstatic uint32_t ice_port = 6502;\nstatic int config_keys_num = sizeof(config_keys);\n\nMumbleCollector *collector = nullptr;\n\n#ifdef HAVE_COLLECTD\nstatic int my_config(const char *key, const char *value) {\n if (strcmp(key, \"IcePort\") == 0) {\n auto mport = strtol(key, nullptr, 10);\n assert(mport > 0 && mport < 65536);\n ice_port = static_cast<uint32_t>(mport);\n return 0;\n }\n\n if (strcmp(key, \"IceHost\") == 0) {\n ice_host = std::string(value);\n return 0;\n }\n\n if (strcmp(key, \"IceSecret\") == 0) {\n ice_secret = std::string(value);\n return 0;\n }\n return 1;\n}\n\nstatic int my_init(void) {\n collector = new MumbleCollector(ice_host, ice_port, ice_secret);\n return 0;\n}\n\nstatic int my_shutdown(void) {\n if (collector) {\n delete collector;\n }\n return 0;\n}\n\nstatic int my_read(void) {\n value_t values[1];\n value_list_t vl = VALUE_LIST_INIT;\n\n values[0].gauge = collector->getUserCount();\n\n vl.values = values;\n vl.values_len = STATIC_ARRAY_SIZE(values);\n sstrncpy(vl.host, hostname_g, sizeof(vl.host));\n sstrncpy(vl.plugin, PLUGIN_NAME, sizeof(vl.plugin));\n sstrncpy(vl.type, \"count\", sizeof(vl.type));\n plugin_dispatch_values(&vl);\n return 0;\n}\n\n\/**\n * Definition for the datatype to be used by collectd\n *\/\nstatic data_source_t mumble_dsrc[] = {{\"count\", DS_TYPE_GAUGE, 0, NAN}};\nstatic data_set_t mumble_ds = {PLUGIN_NAME, STATIC_ARRAY_SIZE(mumble_dsrc),\n mumble_dsrc};\n\nextern \"C\" {\nvoid module_register() {\n plugin_register_data_set(&mumble_ds);\n plugin_register_config(PLUGIN_NAME, my_config, config_keys, config_keys_num);\n plugin_register_init(PLUGIN_NAME, my_init);\n plugin_register_shutdown(PLUGIN_NAME, my_shutdown);\n plugin_register_read(PLUGIN_NAME, my_read);\n}\n}\n\n#else\n\nint main(int argc, char **argv) {\n MumbleCollector collector;\n std::cout << collector.getUserCount() << std::endl;\n return 0;\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Author: doe300\n *\n * See the file \"LICENSE\" for the full license governing this code.\n *\/\n\n#include \".\/optimization\/Optimizer.h\"\n#include \"Compiler.h\"\n#include \"Precompiler.h\"\n#include \"Profiler.h\"\n#include \"concepts.h\"\n#include \"config.h\"\n#include \"git_commit.h\"\n#include \"log.h\"\n#include \"precompilation\/FrontendCompiler.h\"\n#include \"tool_paths.h\"\n#include \"tools.h\"\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iomanip>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n#include <unordered_map>\n\nusing namespace std;\nusing namespace vc4c;\n\nextern void disassemble(const std::string& input, const std::string& output, OutputMode outputMode);\n\nstatic void printHelp()\n{\n vc4c::Configuration defaultConfig;\n std::cout << \"Usage: vc4c [flags] [options] -o <destination> <sources>\" << std::endl;\n std::cout << \"flags:\" << std::endl;\n std::cout << \"\\t-h, --help\\t\\tPrints this help message and exits\" << std::endl;\n std::cout << \"\\t-v, --version\\t\\tPrints version and build info and exists\" << std::endl;\n std::cout << \"\\t--verbose\\t\\tEnables verbose debug logging\" << std::endl;\n std::cout << \"\\t--quiet\\t\\t\\tQuiet verbose debug logging\" << std::endl;\n std::cout << \"\\t-l, --log <file>\\tWrite log output to the given file, defaults to stdout ('-')\" << std::endl;\n std::cout << \"\\t--hex\\t\\t\\tGenerate hex output (e.g. included in source-code)\" << std::endl;\n std::cout << \"\\t--bin\\t\\t\\tGenerate binary output (as used by VC4CL run-time)\" << std::endl;\n std::cout << \"\\t--asm\\t\\t\\tGenerate assembler output (for analysis only)\" << std::endl;\n\n std::cout << \"optimizations:\" << std::endl;\n std::cout << \"\\t-O0,-O1,-O2,-O3\\t\\t\\tSwitches to the specific optimization level, defaults to -O2\" << std::endl;\n std::map<std::string, std::string> sortedPasses;\n for(const auto& pass : vc4c::optimizations::Optimizer::ALL_PASSES)\n sortedPasses.emplace(pass.parameterName, pass.description);\n for(const auto& pass : sortedPasses)\n {\n std::cout << \"\\t--f\" << std::left << std::setw(28) << pass.first << pass.second << std::endl;\n \/\/ TODO print which optimization level includes optimization\n std::cout << \"\\t--fno-\" << std::left << std::setw(25) << pass.first << \"Disables the above optimization\"\n << std::endl;\n }\n\n std::cout << \"optimization parameters:\" << std::endl;\n std::cout << \"\\t--fcombine-load-threshold=\" << defaultConfig.additionalOptions.combineLoadThreshold\n << \"\\tThe maximum distance between two literal loads to combine\" << std::endl;\n std::cout << \"\\t--faccumulator-threshold=\" << defaultConfig.additionalOptions.accumulatorThreshold\n << \"\\tThe maximum live-range of a local still considered to be mapped to an accumulator\" << std::endl;\n std::cout << \"\\t--freplace-nop-threshold=\" << defaultConfig.additionalOptions.replaceNopThreshold\n << \"\\tThe number of instructions to search for a replacement for NOPs\" << std::endl;\n std::cout << \"\\t--foptimization-iterations=\" << defaultConfig.additionalOptions.maxOptimizationIterations\n << \"\\tThe maximum number of iterations to repeat the optimizations in\" << std::endl;\n std::cout << \"\\t--fcommon-subexpression-threshold=\" << defaultConfig.additionalOptions.maxCommonExpressionDinstance\n << \"\\tThe maximum distance for two common subexpressions to be combined\" << std::endl;\n\n std::cout << \"options:\" << std::endl;\n std::cout << \"\\t--kernel-info\\t\\tWrite the kernel-info meta-data (as required by VC4CL run-time, default)\"\n << std::endl;\n std::cout << \"\\t--no-kernel-info\\tDont write the kernel-info meta-data\" << std::endl;\n std::cout << \"\\t--spirv\\t\\t\\tExplicitely use the SPIR-V front-end\" << std::endl;\n std::cout << \"\\t--llvm\\t\\t\\tExplicitely use the LLVM-IR front-end\" << std::endl;\n std::cout << \"\\t--verification-error\\tAbort if instruction verification failed\" << std::endl;\n std::cout << \"\\t--no-verification-error\\tContinue if instruction verification failed\" << std::endl;\n std::cout << \"\\tany other option is passed to the pre-compiler\" << std::endl;\n\n std::cout << \"modes:\" << std::endl;\n std::cout << \"(modes completely change the behavior of the program and therefore only support a limited number of \"\n \"options)\"\n << std::endl;\n std::cout << \"\\t--disassemble\\t\\tDisassembles the binary input to either hex or assembler output. Only supports \"\n \"the input-, output- and logging-flags listed above.\"\n << std::endl;\n std::cout << \"\\t--precompile-stdlib\\tPre-compiles the the VC4CLStdLib.h header file given as input \"\n \"into the folder specified as output. Ignores all other options except for the logging flags\"\n << std::endl;\n}\n\nstatic std::string toVersionString(unsigned version)\n{\n std::stringstream s;\n s << (static_cast<float>(version) \/ 10.0f);\n return s.str();\n}\n\nstatic void printInfo()\n{\n std::cout << \"Running VC4C in version: \" << VC4C_VERSION << \" (\" << GIT_COMMIT << ')' << std::endl;\n std::cout << \"Build configuration: \";\n static const std::vector<std::string> infoString = {\n#ifndef NDEBUG\n \"debug mode\",\n#endif\n#ifdef SPIRV_TOOLS_FRONTEND\n \"SPIR-V Tools front-end\",\n#else\n \"builtin SPIR-V front-end\",\n#endif\n#ifdef USE_LLVM_LIBRARY\n std::string(\"LLVM library front-end with libLLVM \") + toVersionString(LLVM_LIBRARY_VERSION),\n#endif\n#ifdef SPIRV_TOOLS_FRONTEND\n \"SPIR-V linker\",\n#endif\n#ifdef VERIFIER_HEADER\n \"vc4asm verification\",\n#endif\n#ifdef USE_CLANG_LIBRARY\n \"compilation with clang library\"\n#endif\n };\n std::cout << vc4c::to_string<std::string>(infoString, std::string{\"; \"}) << '\\n' << std::endl;\n\n std::cout << \"Standard library location:\" << std::endl;\n try\n {\n auto stdlib = precompilation::findStandardLibraryFiles();\n std::cout << \"\\theader in \" << stdlib.configurationHeader << std::endl;\n std::cout << \"\\tPCH in \" << stdlib.precompiledHeader << std::endl;\n std::cout << \"\\tLLVM module in \" << stdlib.llvmModule << std::endl;\n std::cout << \"\\tSPIR-V module in \" << stdlib.spirvModule << std::endl;\n }\n catch(const std::exception& err)\n {\n std::cout << \"Failed to find standard library files!\" << std::endl;\n std::cout << err.what() << std::endl;\n }\n\n std::cout << \"Tool locations:\" << std::endl;\n for(const auto& tool : std::vector<FrontendTool>{\n CLANG_TOOL, SPIRV_LLVM_SPIRV_TOOL, LLVM_LINK_TOOL, LLVM_DIS_TOOL, LLVM_AS_TOOL, SPIRV_LINK_TOOL})\n {\n if(auto tool_found = precompilation::findToolLocation(tool))\n {\n std::cout << \"\\t\" << tool.name << \" in \" << *tool_found << \" (default\"\n << (tool_found == std::string{tool.defaultPath} ? \")\" :\n (\" '\" + std::string{tool.defaultPath} + \"')\"))\n << std::endl;\n }\n else\n std::cout << \"\\t\" << tool.name << \" not in \"\n << (tool.hasDefaultPath() ? (std::string{tool.defaultPath} + \", neither in \") : \"\") << \"$PATH\"\n << std::endl;\n }\n}\n\nstatic auto availableOptimizations = vc4c::optimizations::Optimizer::getPasses(OptimizationLevel::FULL);\n\n\/*\n *\n *\/\nint main(int argc, char** argv)\n{\n std::unique_ptr<std::wofstream> fileLog;\n std::reference_wrapper<std::wostream> logStream = std::wcout;\n bool colorLog = true;\n#ifndef NDEBUG\n LogLevel minLevel = LogLevel::DEBUG;\n#else\n LogLevel minLevel = LogLevel::WARNING;\n#endif\n\n Configuration config;\n std::vector<std::string> inputFiles;\n std::string outputFile;\n std::string options;\n bool runDisassembler = false;\n bool precompileStdlib = false;\n std::wstringstream dummyLogOutput;\n\n if(argc == 1)\n {\n printHelp();\n return 0;\n }\n\n for(int i = 1; i < argc; ++i)\n {\n \/\/ treat an argument, which first character isnt \"-\", as an input file\n if(strcmp(argv[i - 1], \"-D\") == 0 || strcmp(argv[i - 1], \"-U\") == 0 || strcmp(argv[i - 1], \"-I\") == 0)\n {\n \/\/ ... with exception if they are preceded by an '-D', '-U' or '-I', then forward them to the front-end\n options.append(argv[i]).append(\" \");\n }\n else if(argv[i][0] != '-')\n {\n inputFiles.emplace_back(argv[i]);\n }\n\n \/\/ flags\n else if(strcmp(\"--help\", argv[i]) == 0 || strcmp(\"-h\", argv[i]) == 0)\n {\n printHelp();\n return 0;\n }\n else if(strcmp(\"--version\", argv[i]) == 0 || strcmp(\"-v\", argv[i]) == 0)\n {\n \/\/ disable all logging to not break our version output\n setLogger(dummyLogOutput, false, LogLevel::SEVERE);\n printInfo();\n return 0;\n }\n else if(strcmp(\"--quiet\", argv[i]) == 0)\n minLevel = LogLevel::WARNING;\n else if(strcmp(\"--verbose\", argv[i]) == 0)\n minLevel = LogLevel::DEBUG;\n else if(strcmp(\"--log\", argv[i]) == 0 || strcmp(\"-l\", argv[i]) == 0)\n {\n if(strcmp(\"-\", argv[i + 1]) == 0)\n {\n colorLog = true;\n logStream = std::wcout;\n }\n else\n {\n colorLog = false;\n fileLog = std::make_unique<std::wofstream>(argv[i + 1]);\n logStream = *fileLog;\n }\n ++i;\n }\n else if(strcmp(\"--disassemble\", argv[i]) == 0)\n runDisassembler = true;\n else if(strcmp(\"--precompile-stdlib\", argv[i]) == 0)\n precompileStdlib = true;\n else if(strcmp(\"-o\", argv[i]) == 0)\n {\n if(i + 1 == argc)\n {\n std::cerr << \"No output file specified after -o, aborting!\" << std::endl;\n return 7;\n }\n\n outputFile = argv[i + 1];\n\n \/\/ increment `i` more than usual, because argv[i + 1] is already consumed\n i += 1;\n }\n else if(!vc4c::tools::parseConfigurationParameter(config, argv[i]) || strstr(argv[i], \"-cl\") == argv[i])\n \/\/ pass every not understood option to the pre-compiler, as well as every OpenCL compiler option\n options.append(argv[i]).append(\" \");\n }\n\n if(&logStream.get() == &std::wcout && outputFile == \"-\")\n {\n std::cerr << \"Cannot write both log and data to stdout, aborting\" << std::endl;\n return 6;\n }\n setLogger(logStream, colorLog, minLevel);\n\n if(inputFiles.empty())\n {\n std::cerr << \"No input file(s) specified, aborting!\" << std::endl;\n return 2;\n }\n if(outputFile.empty())\n {\n \/\/ special case: if input files is just one, we specify the implicit output file.\n std::string postfix;\n if(inputFiles.size() == 1)\n {\n switch(config.outputMode)\n {\n case OutputMode::BINARY:\n postfix = \".bin\";\n break;\n case OutputMode::HEX:\n postfix = \".hex\";\n break;\n case OutputMode::ASSEMBLER:\n postfix = \".s\";\n break;\n }\n outputFile = inputFiles[0] + postfix;\n }\n else\n {\n std::cerr << \"No output file specified, aborting!\" << std::endl;\n std::cerr << \"NOTE: If multiple files are inputed, specifying output file is MUST.\" << std::endl;\n return 3;\n }\n }\n\n if(runDisassembler)\n {\n if(inputFiles.size() != 1)\n {\n std::cerr << \"For disassembling, a single input file must be specified, aborting!\" << std::endl;\n return 4;\n }\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Disassembling '\" << inputFiles[0] << \"' into '\" << outputFile << \"'...\" << logging::endl);\n disassemble(inputFiles[0], outputFile, config.outputMode);\n return 0;\n }\n if(precompileStdlib)\n {\n if(inputFiles.size() != 1)\n {\n std::cerr\n << \"For pre-compiling the VC4CL standard library, a single input file must be specified, aborting!\"\n << std::endl;\n return 5;\n }\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Pre-compiling '\" << inputFiles[0] << \"' into '\" << outputFile << \"'...\" << logging::endl);\n precompilation::precompileStandardLibraryFiles(inputFiles[0], outputFile);\n return 0;\n }\n\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Compiling '\" << to_string<std::string>(inputFiles, std::string{\"', '\"}) << \"' into '\" << outputFile\n << \"' with optimization level \" << static_cast<unsigned>(config.optimizationLevel) << \" and options '\"\n << options << \"' ...\" << logging::endl);\n\n CompilationData input{};\n \/\/ link if necessary\n if(inputFiles.size() > 1)\n {\n std::vector<CompilationData> inputs;\n for(const std::string& file : inputFiles)\n {\n inputs.emplace_back(CompilationData{file});\n }\n input = Precompiler::linkSourceCode(inputs);\n if(!isSupportedByFrontend(input.getType(), config.frontend))\n {\n std::cerr << \"Selected front-end does not support the input-format generated by the linker, aborting! \"\n << std::endl;\n return 5;\n }\n }\n else\n {\n input = CompilationData{inputFiles[0]};\n }\n\n PROFILE_START(Compiler);\n std::ignore = Compiler::compile(input, config, options, outputFile == \"-\" ? \"\/dev\/stdout\" : outputFile);\n PROFILE_END(Compiler);\n\n PROFILE_RESULTS();\n return 0;\n}\n<commit_msg>Fix error for tools without default paths<commit_after>\/*\n * Author: doe300\n *\n * See the file \"LICENSE\" for the full license governing this code.\n *\/\n\n#include \".\/optimization\/Optimizer.h\"\n#include \"Compiler.h\"\n#include \"Precompiler.h\"\n#include \"Profiler.h\"\n#include \"concepts.h\"\n#include \"config.h\"\n#include \"git_commit.h\"\n#include \"log.h\"\n#include \"precompilation\/FrontendCompiler.h\"\n#include \"tool_paths.h\"\n#include \"tools.h\"\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iomanip>\n#include <sstream>\n#include <string>\n#include <unistd.h>\n#include <unordered_map>\n\nusing namespace std;\nusing namespace vc4c;\n\nextern void disassemble(const std::string& input, const std::string& output, OutputMode outputMode);\n\nstatic void printHelp()\n{\n vc4c::Configuration defaultConfig;\n std::cout << \"Usage: vc4c [flags] [options] -o <destination> <sources>\" << std::endl;\n std::cout << \"flags:\" << std::endl;\n std::cout << \"\\t-h, --help\\t\\tPrints this help message and exits\" << std::endl;\n std::cout << \"\\t-v, --version\\t\\tPrints version and build info and exists\" << std::endl;\n std::cout << \"\\t--verbose\\t\\tEnables verbose debug logging\" << std::endl;\n std::cout << \"\\t--quiet\\t\\t\\tQuiet verbose debug logging\" << std::endl;\n std::cout << \"\\t-l, --log <file>\\tWrite log output to the given file, defaults to stdout ('-')\" << std::endl;\n std::cout << \"\\t--hex\\t\\t\\tGenerate hex output (e.g. included in source-code)\" << std::endl;\n std::cout << \"\\t--bin\\t\\t\\tGenerate binary output (as used by VC4CL run-time)\" << std::endl;\n std::cout << \"\\t--asm\\t\\t\\tGenerate assembler output (for analysis only)\" << std::endl;\n\n std::cout << \"optimizations:\" << std::endl;\n std::cout << \"\\t-O0,-O1,-O2,-O3\\t\\t\\tSwitches to the specific optimization level, defaults to -O2\" << std::endl;\n std::map<std::string, std::string> sortedPasses;\n for(const auto& pass : vc4c::optimizations::Optimizer::ALL_PASSES)\n sortedPasses.emplace(pass.parameterName, pass.description);\n for(const auto& pass : sortedPasses)\n {\n std::cout << \"\\t--f\" << std::left << std::setw(28) << pass.first << pass.second << std::endl;\n \/\/ TODO print which optimization level includes optimization\n std::cout << \"\\t--fno-\" << std::left << std::setw(25) << pass.first << \"Disables the above optimization\"\n << std::endl;\n }\n\n std::cout << \"optimization parameters:\" << std::endl;\n std::cout << \"\\t--fcombine-load-threshold=\" << defaultConfig.additionalOptions.combineLoadThreshold\n << \"\\tThe maximum distance between two literal loads to combine\" << std::endl;\n std::cout << \"\\t--faccumulator-threshold=\" << defaultConfig.additionalOptions.accumulatorThreshold\n << \"\\tThe maximum live-range of a local still considered to be mapped to an accumulator\" << std::endl;\n std::cout << \"\\t--freplace-nop-threshold=\" << defaultConfig.additionalOptions.replaceNopThreshold\n << \"\\tThe number of instructions to search for a replacement for NOPs\" << std::endl;\n std::cout << \"\\t--foptimization-iterations=\" << defaultConfig.additionalOptions.maxOptimizationIterations\n << \"\\tThe maximum number of iterations to repeat the optimizations in\" << std::endl;\n std::cout << \"\\t--fcommon-subexpression-threshold=\" << defaultConfig.additionalOptions.maxCommonExpressionDinstance\n << \"\\tThe maximum distance for two common subexpressions to be combined\" << std::endl;\n\n std::cout << \"options:\" << std::endl;\n std::cout << \"\\t--kernel-info\\t\\tWrite the kernel-info meta-data (as required by VC4CL run-time, default)\"\n << std::endl;\n std::cout << \"\\t--no-kernel-info\\tDont write the kernel-info meta-data\" << std::endl;\n std::cout << \"\\t--spirv\\t\\t\\tExplicitely use the SPIR-V front-end\" << std::endl;\n std::cout << \"\\t--llvm\\t\\t\\tExplicitely use the LLVM-IR front-end\" << std::endl;\n std::cout << \"\\t--verification-error\\tAbort if instruction verification failed\" << std::endl;\n std::cout << \"\\t--no-verification-error\\tContinue if instruction verification failed\" << std::endl;\n std::cout << \"\\tany other option is passed to the pre-compiler\" << std::endl;\n\n std::cout << \"modes:\" << std::endl;\n std::cout << \"(modes completely change the behavior of the program and therefore only support a limited number of \"\n \"options)\"\n << std::endl;\n std::cout << \"\\t--disassemble\\t\\tDisassembles the binary input to either hex or assembler output. Only supports \"\n \"the input-, output- and logging-flags listed above.\"\n << std::endl;\n std::cout << \"\\t--precompile-stdlib\\tPre-compiles the the VC4CLStdLib.h header file given as input \"\n \"into the folder specified as output. Ignores all other options except for the logging flags\"\n << std::endl;\n}\n\nstatic std::string toVersionString(unsigned version)\n{\n std::stringstream s;\n s << (static_cast<float>(version) \/ 10.0f);\n return s.str();\n}\n\nstatic void printInfo()\n{\n std::cout << \"Running VC4C in version: \" << VC4C_VERSION << \" (\" << GIT_COMMIT << ')' << std::endl;\n std::cout << \"Build configuration: \";\n static const std::vector<std::string> infoString = {\n#ifndef NDEBUG\n \"debug mode\",\n#endif\n#ifdef SPIRV_TOOLS_FRONTEND\n \"SPIR-V Tools front-end\",\n#else\n \"builtin SPIR-V front-end\",\n#endif\n#ifdef USE_LLVM_LIBRARY\n std::string(\"LLVM library front-end with libLLVM \") + toVersionString(LLVM_LIBRARY_VERSION),\n#endif\n#ifdef SPIRV_TOOLS_FRONTEND\n \"SPIR-V linker\",\n#endif\n#ifdef VERIFIER_HEADER\n \"vc4asm verification\",\n#endif\n#ifdef USE_CLANG_LIBRARY\n \"compilation with clang library\"\n#endif\n };\n std::cout << vc4c::to_string<std::string>(infoString, std::string{\"; \"}) << '\\n' << std::endl;\n\n std::cout << \"Standard library location:\" << std::endl;\n try\n {\n auto stdlib = precompilation::findStandardLibraryFiles();\n std::cout << \"\\theader in \" << stdlib.configurationHeader << std::endl;\n std::cout << \"\\tPCH in \" << stdlib.precompiledHeader << std::endl;\n std::cout << \"\\tLLVM module in \" << stdlib.llvmModule << std::endl;\n std::cout << \"\\tSPIR-V module in \" << stdlib.spirvModule << std::endl;\n }\n catch(const std::exception& err)\n {\n std::cout << \"Failed to find standard library files!\" << std::endl;\n std::cout << err.what() << std::endl;\n }\n\n std::cout << \"Tool locations:\" << std::endl;\n for(const auto& tool : std::vector<FrontendTool>{\n CLANG_TOOL, SPIRV_LLVM_SPIRV_TOOL, LLVM_LINK_TOOL, LLVM_DIS_TOOL, LLVM_AS_TOOL, SPIRV_LINK_TOOL})\n {\n if(auto tool_found = precompilation::findToolLocation(tool))\n {\n std::string defaultPath = tool.defaultPath ? tool.defaultPath : \"\";\n std::cout << \"\\t\" << tool.name << \" in \" << *tool_found << \" (default\"\n << (!defaultPath.empty() && tool_found == defaultPath ? \")\" : (\" '\" + defaultPath + \"')\"))\n << std::endl;\n }\n else\n std::cout << \"\\t\" << tool.name << \" not in \"\n << (tool.hasDefaultPath() ? (std::string{tool.defaultPath} + \", neither in \") : \"\") << \"$PATH\"\n << std::endl;\n }\n}\n\nstatic auto availableOptimizations = vc4c::optimizations::Optimizer::getPasses(OptimizationLevel::FULL);\n\n\/*\n *\n *\/\nint main(int argc, char** argv)\n{\n std::unique_ptr<std::wofstream> fileLog;\n std::reference_wrapper<std::wostream> logStream = std::wcout;\n bool colorLog = true;\n#ifndef NDEBUG\n LogLevel minLevel = LogLevel::DEBUG;\n#else\n LogLevel minLevel = LogLevel::WARNING;\n#endif\n\n Configuration config;\n std::vector<std::string> inputFiles;\n std::string outputFile;\n std::string options;\n bool runDisassembler = false;\n bool precompileStdlib = false;\n std::wstringstream dummyLogOutput;\n\n if(argc == 1)\n {\n printHelp();\n return 0;\n }\n\n for(int i = 1; i < argc; ++i)\n {\n \/\/ treat an argument, which first character isnt \"-\", as an input file\n if(strcmp(argv[i - 1], \"-D\") == 0 || strcmp(argv[i - 1], \"-U\") == 0 || strcmp(argv[i - 1], \"-I\") == 0)\n {\n \/\/ ... with exception if they are preceded by an '-D', '-U' or '-I', then forward them to the front-end\n options.append(argv[i]).append(\" \");\n }\n else if(argv[i][0] != '-')\n {\n inputFiles.emplace_back(argv[i]);\n }\n\n \/\/ flags\n else if(strcmp(\"--help\", argv[i]) == 0 || strcmp(\"-h\", argv[i]) == 0)\n {\n printHelp();\n return 0;\n }\n else if(strcmp(\"--version\", argv[i]) == 0 || strcmp(\"-v\", argv[i]) == 0)\n {\n \/\/ disable all logging to not break our version output\n setLogger(dummyLogOutput, false, LogLevel::SEVERE);\n printInfo();\n return 0;\n }\n else if(strcmp(\"--quiet\", argv[i]) == 0)\n minLevel = LogLevel::WARNING;\n else if(strcmp(\"--verbose\", argv[i]) == 0)\n minLevel = LogLevel::DEBUG;\n else if(strcmp(\"--log\", argv[i]) == 0 || strcmp(\"-l\", argv[i]) == 0)\n {\n if(strcmp(\"-\", argv[i + 1]) == 0)\n {\n colorLog = true;\n logStream = std::wcout;\n }\n else\n {\n colorLog = false;\n fileLog = std::make_unique<std::wofstream>(argv[i + 1]);\n logStream = *fileLog;\n }\n ++i;\n }\n else if(strcmp(\"--disassemble\", argv[i]) == 0)\n runDisassembler = true;\n else if(strcmp(\"--precompile-stdlib\", argv[i]) == 0)\n precompileStdlib = true;\n else if(strcmp(\"-o\", argv[i]) == 0)\n {\n if(i + 1 == argc)\n {\n std::cerr << \"No output file specified after -o, aborting!\" << std::endl;\n return 7;\n }\n\n outputFile = argv[i + 1];\n\n \/\/ increment `i` more than usual, because argv[i + 1] is already consumed\n i += 1;\n }\n else if(!vc4c::tools::parseConfigurationParameter(config, argv[i]) || strstr(argv[i], \"-cl\") == argv[i])\n \/\/ pass every not understood option to the pre-compiler, as well as every OpenCL compiler option\n options.append(argv[i]).append(\" \");\n }\n\n if(&logStream.get() == &std::wcout && outputFile == \"-\")\n {\n std::cerr << \"Cannot write both log and data to stdout, aborting\" << std::endl;\n return 6;\n }\n setLogger(logStream, colorLog, minLevel);\n\n if(inputFiles.empty())\n {\n std::cerr << \"No input file(s) specified, aborting!\" << std::endl;\n return 2;\n }\n if(outputFile.empty())\n {\n \/\/ special case: if input files is just one, we specify the implicit output file.\n std::string postfix;\n if(inputFiles.size() == 1)\n {\n switch(config.outputMode)\n {\n case OutputMode::BINARY:\n postfix = \".bin\";\n break;\n case OutputMode::HEX:\n postfix = \".hex\";\n break;\n case OutputMode::ASSEMBLER:\n postfix = \".s\";\n break;\n }\n outputFile = inputFiles[0] + postfix;\n }\n else\n {\n std::cerr << \"No output file specified, aborting!\" << std::endl;\n std::cerr << \"NOTE: If multiple files are inputed, specifying output file is MUST.\" << std::endl;\n return 3;\n }\n }\n\n if(runDisassembler)\n {\n if(inputFiles.size() != 1)\n {\n std::cerr << \"For disassembling, a single input file must be specified, aborting!\" << std::endl;\n return 4;\n }\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Disassembling '\" << inputFiles[0] << \"' into '\" << outputFile << \"'...\" << logging::endl);\n disassemble(inputFiles[0], outputFile, config.outputMode);\n return 0;\n }\n if(precompileStdlib)\n {\n if(inputFiles.size() != 1)\n {\n std::cerr\n << \"For pre-compiling the VC4CL standard library, a single input file must be specified, aborting!\"\n << std::endl;\n return 5;\n }\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Pre-compiling '\" << inputFiles[0] << \"' into '\" << outputFile << \"'...\" << logging::endl);\n precompilation::precompileStandardLibraryFiles(inputFiles[0], outputFile);\n return 0;\n }\n\n CPPLOG_LAZY(logging::Level::DEBUG,\n log << \"Compiling '\" << to_string<std::string>(inputFiles, std::string{\"', '\"}) << \"' into '\" << outputFile\n << \"' with optimization level \" << static_cast<unsigned>(config.optimizationLevel) << \" and options '\"\n << options << \"' ...\" << logging::endl);\n\n CompilationData input{};\n \/\/ link if necessary\n if(inputFiles.size() > 1)\n {\n std::vector<CompilationData> inputs;\n for(const std::string& file : inputFiles)\n {\n inputs.emplace_back(CompilationData{file});\n }\n input = Precompiler::linkSourceCode(inputs);\n if(!isSupportedByFrontend(input.getType(), config.frontend))\n {\n std::cerr << \"Selected front-end does not support the input-format generated by the linker, aborting! \"\n << std::endl;\n return 5;\n }\n }\n else\n {\n input = CompilationData{inputFiles[0]};\n }\n\n PROFILE_START(Compiler);\n std::ignore = Compiler::compile(input, config, options, outputFile == \"-\" ? \"\/dev\/stdout\" : outputFile);\n PROFILE_END(Compiler);\n\n PROFILE_RESULTS();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"block.h\"\n#include \"board.h\"\n#include \"game.h\"\n#include \"parser.h\"\n#include \"directoryLoader.h\"\n#include \"featureFile.h\"\n#include \"rprop.h\"\n\n#include <stdio.h>\n\n#define HIDDEN_LAYER_SIZE 5\n\nconst char usage[] = \"Usage: gobot -train modelOutputFile iterations gameDirectory \"\n \"[featureDirectory]\\n\"\n \" -test modelFile gameDirectory [featureDirectory]\\n\"\n \" -predict modelFile gameFile [featureFile]\\n\"\n \" -generateFeatures gameDirectory featureDirectory\";\n\nint main(int argc, char *argv[])\n{\n if(argc < 4)\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n else if(!strcmp(argv[1], \"-train\"))\n {\n if(argc < 5)\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n\n int iterations = atoi(argv[3]);\n\n DirectoryIterator games(argv[4], iterations);\n\n RProp model(NUMBER_OF_FEATURES, HIDDEN_LAYER_SIZE);\n\n if(argc > 5)\n {\n model.trainWithFeatures(games, argv[5]);\n }\n else\n {\n model.train(games);\n }\n\n model.outputToFile(argv[2]);\n }\n else if(!strcmp(argv[1], \"-test\"))\n {\n DirectoryIterator games(argv[3]);\n\n RProp model;\n\n if(!model.readFromFile(argv[2]))\n {\n printf(\"Couldn't read model from: %s\\n\", argv[2]);\n\n return 1;\n }\n\n if(argc > 4)\n {\n printf(\"Accuracy: %f%%\\n\", model.testWithFeatures(games, argv[4]));\n }\n else\n {\n printf(\"Accuracy: %f%%\\n\", model.test(games));\n }\n }\n else if(!strcmp(argv[1], \"-predict\"))\n {\n Game game;\n\n if(!parseFile(&game, argv[3]))\n {\n printf(\"Couldn't read game file: %s\\n\", argv[3]);\n\n return 1;\n }\n\n RProp model;\n\n if(!model.readFromFile(argv[2]))\n {\n printf(\"Couldn't read model from: %s\\n\", argv[2]);\n\n return 1;\n }\n\n if(argc > 4)\n {\n std::map<BoardLocation, BlockFinalFeatures> featureMap;\n\n if(!readFeaturesFromFile(featureMap, argv[4]))\n {\n printf(\"Couldn't read feature file: %s\\n\", argv[4]);\n\n return 1;\n }\n\n printf(\"Estimate: %f\\n\", model.predictWithFeatures(game, featureMap));\n }\n else\n {\n printf(\"Estimate: %f\\n\", model.predict(game));\n }\n }\n else if(!strcmp(argv[1], \"-generateFeatures\"))\n {\n char buffer[100];\n int i = 0;\n DirectoryIterator games(argv[2]);\n\n for( ; games != games.end(); ++games)\n {\n Game game;\n\n sprintf(buffer, \"%s\/%s\", argv[2], *games);\n\n if(!parseFile(&game, buffer))\n {\n printf(\"Couldn't read game file: %s\\n\", buffer);\n\n return 1;\n }\n\n Board board = game.playGame();\n\n sprintf(buffer, \"%s\/%sf\", argv[3], *games);\n\n if(!writeFeaturesToFile(board, buffer))\n {\n printf(\"Could not write the features to: %s\\n\", buffer);\n\n return 1;\n }\n\n if(i % 100 == 0)\n {\n printf(\".\");\n fflush(stdout);\n }\n\n ++i;\n }\n\n printf(\"\\n\");\n }\n else\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n\n return 0;\n}\n<commit_msg>Update hidden layer size<commit_after>#include \"block.h\"\n#include \"board.h\"\n#include \"game.h\"\n#include \"parser.h\"\n#include \"directoryLoader.h\"\n#include \"featureFile.h\"\n#include \"rprop.h\"\n\n#include <stdio.h>\n\n#define HIDDEN_LAYER_SIZE 20\n\nconst char usage[] = \"Usage: gobot -train modelOutputFile iterations gameDirectory \"\n \"[featureDirectory]\\n\"\n \" -test modelFile gameDirectory [featureDirectory]\\n\"\n \" -predict modelFile gameFile [featureFile]\\n\"\n \" -generateFeatures gameDirectory featureDirectory\";\n\nint main(int argc, char *argv[])\n{\n if(argc < 4)\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n else if(!strcmp(argv[1], \"-train\"))\n {\n if(argc < 5)\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n\n int iterations = atoi(argv[3]);\n\n DirectoryIterator games(argv[4], iterations);\n\n RProp model(NUMBER_OF_FEATURES, HIDDEN_LAYER_SIZE);\n\n if(argc > 5)\n {\n model.trainWithFeatures(games, argv[5]);\n }\n else\n {\n model.train(games);\n }\n\n model.outputToFile(argv[2]);\n }\n else if(!strcmp(argv[1], \"-test\"))\n {\n DirectoryIterator games(argv[3]);\n\n RProp model;\n\n if(!model.readFromFile(argv[2]))\n {\n printf(\"Couldn't read model from: %s\\n\", argv[2]);\n\n return 1;\n }\n\n if(argc > 4)\n {\n printf(\"Accuracy: %f%%\\n\", model.testWithFeatures(games, argv[4]));\n }\n else\n {\n printf(\"Accuracy: %f%%\\n\", model.test(games));\n }\n }\n else if(!strcmp(argv[1], \"-predict\"))\n {\n Game game;\n\n if(!parseFile(&game, argv[3]))\n {\n printf(\"Couldn't read game file: %s\\n\", argv[3]);\n\n return 1;\n }\n\n RProp model;\n\n if(!model.readFromFile(argv[2]))\n {\n printf(\"Couldn't read model from: %s\\n\", argv[2]);\n\n return 1;\n }\n\n if(argc > 4)\n {\n std::map<BoardLocation, BlockFinalFeatures> featureMap;\n\n if(!readFeaturesFromFile(featureMap, argv[4]))\n {\n printf(\"Couldn't read feature file: %s\\n\", argv[4]);\n\n return 1;\n }\n\n printf(\"Estimate: %f\\n\", model.predictWithFeatures(game, featureMap));\n }\n else\n {\n printf(\"Estimate: %f\\n\", model.predict(game));\n }\n }\n else if(!strcmp(argv[1], \"-generateFeatures\"))\n {\n char buffer[100];\n int i = 0;\n DirectoryIterator games(argv[2]);\n\n for( ; games != games.end(); ++games)\n {\n Game game;\n\n sprintf(buffer, \"%s\/%s\", argv[2], *games);\n\n if(!parseFile(&game, buffer))\n {\n printf(\"Couldn't read game file: %s\\n\", buffer);\n\n return 1;\n }\n\n Board board = game.playGame();\n\n sprintf(buffer, \"%s\/%sf\", argv[3], *games);\n\n if(!writeFeaturesToFile(board, buffer))\n {\n printf(\"Could not write the features to: %s\\n\", buffer);\n\n return 1;\n }\n\n if(i % 100 == 0)\n {\n printf(\".\");\n fflush(stdout);\n }\n\n ++i;\n }\n\n printf(\"\\n\");\n }\n else\n {\n printf(\"%s\\n\", usage);\n\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ -*- C++ -*-\n\n#pragma once\n\n#include <cstdint>\n#include <utility>\n\nnamespace OTI\n{\n class lcg_PLE63\n {\n#pragma region Typedefs\/Constants\n public: typedef uint_fast64_t result_type;\n public: typedef result_type seed_type;\n\n public: static constexpr result_type nbits = 63ULL;\n public: static constexpr result_type mod = 1ULL << nbits;\n public: static constexpr result_type mask = mod - 1ULL;\n\n \/\/ those values are from P.L'Ecuyer \"Efficient and Portable Combined RNGs\", Comm.ACM 31(6): 742-749, 774 (1988)\n public: static constexpr result_type mult = 2806196910506780709ULL;\n public: static constexpr result_type add = 1ULL;\n\n public: static constexpr result_type default_seed = 1ULL; \n\n public: static constexpr float norm = float{1.0842021724855044340074528008699e-19};\n#pragma endregion\n\n#pragma region Data\n private: mutable seed_type _seed;\n#pragma endregion\n\n#pragma region Ctor\/Dtor\/op=\n public: lcg_PLE63(result_type seed = default_seed):\n _seed{seed}\n {\n }\n\n public: lcg_PLE63(lcg_PLE63 const& r):\n _seed{r._seed}\n {\n }\n\n public: lcg_PLE63(lcg_PLE63&& r):\n _seed{std::move(r._seed)}\n {\n } \n\n public: lcg_PLE63& operator=(lcg_PLE63 const& r)\n {\n _seed = r._seed;\n return *this;\n }\n\n public: lcg_PLE63& operator=(lcg_PLE63& r)\n {\n _seed = std::move(r._seed);\n return *this;\n }\n\n public: ~lcg_PLE63()\n {\n }\n#pragma endregion\n\n#pragma region Observers\n public: seed_type seed() const\n {\n return _seed;\n }\n#pragma endregion\n\n#pragma region Helpers\n\n \/\/ compute and return positive skip\n public: static int64_t compute_nskip(int64_t ns);\n\n \/\/ could skip forward as well as backward\n public: static result_type skip(int64_t ns, seed_type seed);\n\n public: static result_type sample(seed_type seed)\n {\n return (mult * seed + add) & mask;\n }\n#pragma endregion\n\n#pragma region Mutators\n public: void sample() const\n {\n _seed = sample(_seed);\n }\n\n public: float number() const\n {\n sample();\n return float(_seed) * norm;\n }\n\n public: void skip(int64_t ns) const\n {\n _seed = skip(ns, _seed);\n }\n#pragma endregion\n };\n}\n<commit_msg>Fixed move op=, some type clean-up<commit_after>\/\/ -*- C++ -*-\n\n#pragma once\n\n#include <cstdint>\n#include <utility>\n\nnamespace OTI\n{\n class lcg_PLE63\n {\n#pragma region Typedefs\/Constants\n public: typedef uint_fast64_t result_type;\n public: typedef result_type seed_type;\n\n public: static constexpr result_type nbits = 63ULL;\n public: static constexpr result_type mod = 1ULL << nbits;\n public: static constexpr result_type mask = mod - 1ULL;\n\n \/\/ those values are from P.L'Ecuyer \"Efficient and Portable Combined RNGs\", Comm.ACM 31(6): 742-749, 774 (1988)\n public: static constexpr result_type mult = 2806196910506780709ULL;\n public: static constexpr result_type add = 1ULL;\n\n public: static constexpr seed_type default_seed = 1ULL; \n\n public: static constexpr float norm = float{1.0842021724855044340074528008699e-19};\n#pragma endregion\n\n#pragma region Data\n private: mutable seed_type _seed;\n#pragma endregion\n\n#pragma region Ctor\/Dtor\/op=\n public: lcg_PLE63(seed_type seed = default_seed):\n _seed{seed}\n {\n }\n\n public: lcg_PLE63(lcg_PLE63 const& r):\n _seed{r._seed}\n {\n }\n\n public: lcg_PLE63(lcg_PLE63&& r):\n _seed{std::move(r._seed)}\n {\n } \n\n public: lcg_PLE63& operator=(lcg_PLE63 const& r)\n {\n _seed = r._seed;\n return *this;\n }\n\n public: lcg_PLE63& operator=(lcg_PLE63&& r)\n {\n _seed = std::move(r._seed);\n return *this;\n }\n\n public: ~lcg_PLE63()\n {\n }\n#pragma endregion\n\n#pragma region Observers\n public: seed_type seed() const\n {\n return _seed;\n }\n#pragma endregion\n\n#pragma region Helpers\n\n \/\/ compute and return positive skip\n public: static int64_t compute_nskip(int64_t ns);\n\n \/\/ could skip forward as well as backward\n public: static result_type skip(int64_t ns, seed_type seed);\n\n public: static result_type sample(seed_type seed)\n {\n return (mult * seed + add) & mask;\n }\n#pragma endregion\n\n#pragma region Mutators\n public: void sample() const\n {\n _seed = sample(_seed);\n }\n\n public: float number() const\n {\n sample();\n return float(_seed) * norm;\n }\n\n public: void skip(int64_t ns) const\n {\n _seed = skip(ns, _seed);\n }\n#pragma endregion\n };\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file was developed by Thomas Müller <thomas94@gmx.net>.\n\/\/ It is published under the BSD 3-Clause License within the LICENSE file.\n\n#include <tev\/ImageViewer.h>\n#include <tev\/Ipc.h>\n#include <tev\/SharedQueue.h>\n#include <tev\/ThreadPool.h>\n\n#include <args.hxx>\n#include <ImfThreading.h>\n\n#include <utf8.h>\n\n#include <iostream>\n#include <thread>\n\nusing namespace args;\nusing namespace filesystem;\nusing namespace std;\n\nTEV_NAMESPACE_BEGIN\n\nint mainFunc(const vector<string>& arguments) {\n ArgumentParser parser{\n \"Inspection tool for images with a high dynamic range.\",\n \"tev was developed by Thomas Müller <thomas94@gmx.net>. \"\n \"Its source code is available under the BSD 3-Clause License at https:\/\/tom94.net\",\n };\n\n HelpFlag helpFlag{\n parser,\n \"HELP\",\n \"Display this help menu\",\n {'h', \"help\"},\n };\n\n Flag versionFlag{\n parser,\n \"VERSION\",\n \"Display the version of tev\",\n {'v', \"version\"},\n };\n\n Flag newWindowFlag{\n parser,\n \"NEW WINDOW\",\n \"Open a new window of tev, even if one exists already\",\n {'n', \"new\"},\n };\n\n ValueFlag<float> exposureFlag{\n parser,\n \"EXPOSURE\",\n \"Scales the brightness of an image prior to tonemapping by 2^EXPOSURE. \"\n \"It can be controlled via the GUI, or by pressing E\/Shift+E.\",\n {'e', \"exposure\"},\n };\n\n ValueFlag<string> filterFlag{\n parser,\n \"FILTER\",\n \"Filter visible images and layers according to a supplied string. \"\n \"The string must have the format 'image:layer'. \"\n \"Only images whose name contains 'image' and layers whose name contains 'layer' will be visible.\",\n {'f', \"filter\"},\n };\n\n ValueFlag<bool> maximizeFlag{\n parser,\n \"MAXIMIZE\",\n \"Maximize the window on startup. \"\n \"If no images were supplied via the command line, then the default is FALSE. \"\n \"Otherwise, the default is TRUE.\",\n {\"max\", \"maximize\"},\n };\n\n ValueFlag<string> metricFlag{\n parser,\n \"METRIC\",\n \"The metric to use when comparing two images. \"\n \"The available metrics are:\\n\"\n \"E - Error\\n\"\n \"AE - Absolute Error\\n\"\n \"SE - Squared Error\\n\"\n \"RAE - Relative Absolute Error\\n\"\n \"RSE - Relative Squared Error\\n\"\n \"Default is E.\",\n {'m', \"metric\"},\n };\n\n ValueFlag<float> offsetFlag{\n parser,\n \"OFFSET\",\n \"Add an absolute offset to the image after EXPOSURE has been applied. \"\n \"It can be controlled via the GUI, or by pressing O\/Shift+O.\",\n {'o', \"offset\"},\n };\n\n ValueFlag<string> tonemapFlag{\n parser,\n \"TONEMAP\",\n \"The tonemapping algorithm to use. \"\n \"The available tonemaps are:\\n\"\n \"sRGB - sRGB\\n\"\n \"Gamma - Gamma curve (2.2)\\n\"\n \"FC - False Color\\n\"\n \"PN - Positive=Green, Negative=Red\\n\"\n \"Default is sRGB.\",\n {'t', \"tonemap\"},\n };\n\n PositionalList<string> imageFiles{\n parser,\n \"images\",\n \"The image files to be opened by tev. \"\n \"If an argument starting with a ':' is encountered, \"\n \"then this argument is not treated as an image file \"\n \"but as a comma-separated channel selector. Until the next channel \"\n \"selector is encountered only channels containing \"\n \"elements from the current selector will be loaded. This is \"\n \"especially useful for selectively loading a specific \"\n \"part of a multi-part EXR file.\",\n };\n\n \/\/ Parse command line arguments and react to parsing\n \/\/ errors using exceptions.\n try {\n TEV_ASSERT(arguments.size() > 0, \"Number of arguments must be bigger than 0.\");\n\n parser.Prog(arguments.front());\n parser.ParseArgs(begin(arguments) + 1, end(arguments));\n } catch (Help) {\n std::cout << parser;\n return 0;\n } catch (ParseError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return -1;\n } catch (ValidationError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return -2;\n }\n\n if (versionFlag) {\n cout\n << \"tev — The EXR Viewer\" << endl\n << \"version \" TEV_VERSION << endl;\n return 0;\n }\n\n auto ipc = make_shared<Ipc>();\n\n \/\/ If we're not the primary instance and did not request to open a new window,\n \/\/ simply send the to-be-opened images to the primary instance.\n if (!ipc->isPrimaryInstance() && !newWindowFlag) {\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n try {\n ipc->sendToPrimaryInstance(tfm::format(\"%s:%s\", path{imageFile}.make_absolute(), channelSelector));\n } catch (runtime_error e) {\n cerr << tfm::format(\"Invalid file '%s': %s\", imageFile, e.what()) << endl;\n }\n }\n\n return 0;\n }\n\n Imf::setGlobalThreadCount(thread::hardware_concurrency());\n\n cout << \"Loading window...\" << endl;\n\n \/\/ Load images passed via command line in the background prior to\n \/\/ creating our main application such that they are not stalled\n \/\/ by the potentially slow initialization of opengl \/ glfw.\n shared_ptr<SharedQueue<ImageAddition>> imagesToAdd = make_shared<SharedQueue<ImageAddition>>();\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n ThreadPool::singleWorker().enqueueTask([imageFile, channelSelector, &imagesToAdd] {\n auto image = tryLoadImage(imageFile, channelSelector);\n if (image) {\n imagesToAdd->push({false, image});\n }\n });\n }\n\n \/\/ Init nanogui application\n nanogui::init();\n\n {\n auto app = unique_ptr<ImageViewer>{new ImageViewer{ipc, imagesToAdd, !imageFiles}};\n app->drawAll();\n app->setVisible(true);\n\n \/\/ Do what the maximize flag tells us---if it exists---and\n \/\/ maximize if we have images otherwise.\n if (maximizeFlag ? get(maximizeFlag) : imageFiles) {\n app->maximize();\n }\n\n \/\/ Apply parameter flags\n if (exposureFlag) { app->setExposure(get(exposureFlag)); }\n if (filterFlag) { app->setFilter(get(filterFlag)); }\n if (metricFlag) { app->setMetric(toMetric(get(metricFlag))); }\n if (offsetFlag) { app->setOffset(get(offsetFlag)); }\n if (tonemapFlag) { app->setTonemap(toTonemap(get(tonemapFlag))); }\n\n \/\/ Refresh only every 250ms if there are no user interactions.\n \/\/ This makes an idling tev surprisingly energy-efficient. :)\n nanogui::mainloop(250);\n }\n\n \/\/ On some linux distributions glfwTerminate() (which is called by\n \/\/ nanogui::shutdown()) causes segfaults. Since we are done with our\n \/\/ program here anyways, let's let the OS clean up after us.\n \/\/nanogui::shutdown();\n\n \/\/ Let all threads gracefully terminate.\n ThreadPool::shutdown();\n\n return 0;\n}\n\nTEV_NAMESPACE_END\n\n#ifdef _WIN32\nint wmain(int argc, wchar_t* argv[]) {\n#else\nint main(int argc, char* argv[]) {\n#endif\n try {\n vector<string> arguments;\n for (int i = 0; i < argc; ++i) {\n#ifdef _WIN32\n arguments.emplace_back(tev::utf16to8(argv[i]));\n#else\n string arg = argv[i];\n \/\/ OSX sometimes (seemingly sporadically) passes the\n \/\/ process serial number via a command line parameter.\n \/\/ We would like to ignore this.\n if (arg.find(\"-psn\") != 0) {\n arguments.emplace_back(tev::ensureUtf8(argv[i]));\n }\n#endif\n }\n\n tev::mainFunc(arguments);\n } catch (const exception& e) {\n cerr << tfm::format(\"Uncaught exception: %s\", e.what()) << endl;\n return 1;\n }\n}\n<commit_msg>Sort CLI help alphabetically<commit_after>\/\/ This file was developed by Thomas Müller <thomas94@gmx.net>.\n\/\/ It is published under the BSD 3-Clause License within the LICENSE file.\n\n#include <tev\/ImageViewer.h>\n#include <tev\/Ipc.h>\n#include <tev\/SharedQueue.h>\n#include <tev\/ThreadPool.h>\n\n#include <args.hxx>\n#include <ImfThreading.h>\n\n#include <utf8.h>\n\n#include <iostream>\n#include <thread>\n\nusing namespace args;\nusing namespace filesystem;\nusing namespace std;\n\nTEV_NAMESPACE_BEGIN\n\nint mainFunc(const vector<string>& arguments) {\n ArgumentParser parser{\n \"Inspection tool for images with a high dynamic range.\",\n \"tev was developed by Thomas Müller <thomas94@gmx.net>. \"\n \"Its source code is available under the BSD 3-Clause License at https:\/\/tom94.net\",\n };\n\n ValueFlag<float> exposureFlag{\n parser,\n \"EXPOSURE\",\n \"Scales the brightness of an image prior to tonemapping by 2^EXPOSURE. \"\n \"It can be controlled via the GUI, or by pressing E\/Shift+E.\",\n {'e', \"exposure\"},\n };\n\n ValueFlag<string> filterFlag{\n parser,\n \"FILTER\",\n \"Filter visible images and layers according to a supplied string. \"\n \"The string must have the format 'image:layer'. \"\n \"Only images whose name contains 'image' and layers whose name contains 'layer' will be visible.\",\n {'f', \"filter\"},\n };\n\n HelpFlag helpFlag{\n parser,\n \"HELP\",\n \"Display this help menu\",\n {'h', \"help\"},\n };\n\n ValueFlag<bool> maximizeFlag{\n parser,\n \"MAXIMIZE\",\n \"Maximize the window on startup. \"\n \"If no images were supplied via the command line, then the default is FALSE. \"\n \"Otherwise, the default is TRUE.\",\n {\"max\", \"maximize\"},\n };\n\n ValueFlag<string> metricFlag{\n parser,\n \"METRIC\",\n \"The metric to use when comparing two images. \"\n \"The available metrics are:\\n\"\n \"E - Error\\n\"\n \"AE - Absolute Error\\n\"\n \"SE - Squared Error\\n\"\n \"RAE - Relative Absolute Error\\n\"\n \"RSE - Relative Squared Error\\n\"\n \"Default is E.\",\n {'m', \"metric\"},\n };\n\n Flag newWindowFlag{\n parser,\n \"NEW WINDOW\",\n \"Open a new window of tev, even if one exists already\",\n {'n', \"new\"},\n };\n\n ValueFlag<float> offsetFlag{\n parser,\n \"OFFSET\",\n \"Add an absolute offset to the image after EXPOSURE has been applied. \"\n \"It can be controlled via the GUI, or by pressing O\/Shift+O.\",\n {'o', \"offset\"},\n };\n\n ValueFlag<string> tonemapFlag{\n parser,\n \"TONEMAP\",\n \"The tonemapping algorithm to use. \"\n \"The available tonemaps are:\\n\"\n \"sRGB - sRGB\\n\"\n \"Gamma - Gamma curve (2.2)\\n\"\n \"FC - False Color\\n\"\n \"PN - Positive=Green, Negative=Red\\n\"\n \"Default is sRGB.\",\n {'t', \"tonemap\"},\n };\n\n Flag versionFlag{\n parser,\n \"VERSION\",\n \"Display the version of tev\",\n {'v', \"version\"},\n };\n\n PositionalList<string> imageFiles{\n parser,\n \"images\",\n \"The image files to be opened by tev. \"\n \"If an argument starting with a ':' is encountered, \"\n \"then this argument is not treated as an image file \"\n \"but as a comma-separated channel selector. Until the next channel \"\n \"selector is encountered only channels containing \"\n \"elements from the current selector will be loaded. This is \"\n \"especially useful for selectively loading a specific \"\n \"part of a multi-part EXR file.\",\n };\n\n \/\/ Parse command line arguments and react to parsing\n \/\/ errors using exceptions.\n try {\n TEV_ASSERT(arguments.size() > 0, \"Number of arguments must be bigger than 0.\");\n\n parser.Prog(arguments.front());\n parser.ParseArgs(begin(arguments) + 1, end(arguments));\n } catch (Help) {\n std::cout << parser;\n return 0;\n } catch (ParseError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return -1;\n } catch (ValidationError e) {\n std::cerr << e.what() << std::endl;\n std::cerr << parser;\n return -2;\n }\n\n if (versionFlag) {\n cout\n << \"tev — The EXR Viewer\" << endl\n << \"version \" TEV_VERSION << endl;\n return 0;\n }\n\n auto ipc = make_shared<Ipc>();\n\n \/\/ If we're not the primary instance and did not request to open a new window,\n \/\/ simply send the to-be-opened images to the primary instance.\n if (!ipc->isPrimaryInstance() && !newWindowFlag) {\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n try {\n ipc->sendToPrimaryInstance(tfm::format(\"%s:%s\", path{imageFile}.make_absolute(), channelSelector));\n } catch (runtime_error e) {\n cerr << tfm::format(\"Invalid file '%s': %s\", imageFile, e.what()) << endl;\n }\n }\n\n return 0;\n }\n\n Imf::setGlobalThreadCount(thread::hardware_concurrency());\n\n cout << \"Loading window...\" << endl;\n\n \/\/ Load images passed via command line in the background prior to\n \/\/ creating our main application such that they are not stalled\n \/\/ by the potentially slow initialization of opengl \/ glfw.\n shared_ptr<SharedQueue<ImageAddition>> imagesToAdd = make_shared<SharedQueue<ImageAddition>>();\n string channelSelector;\n for (auto imageFile : get(imageFiles)) {\n if (!imageFile.empty() && imageFile[0] == ':') {\n channelSelector = imageFile.substr(1);\n continue;\n }\n\n ThreadPool::singleWorker().enqueueTask([imageFile, channelSelector, &imagesToAdd] {\n auto image = tryLoadImage(imageFile, channelSelector);\n if (image) {\n imagesToAdd->push({false, image});\n }\n });\n }\n\n \/\/ Init nanogui application\n nanogui::init();\n\n {\n auto app = unique_ptr<ImageViewer>{new ImageViewer{ipc, imagesToAdd, !imageFiles}};\n app->drawAll();\n app->setVisible(true);\n\n \/\/ Do what the maximize flag tells us---if it exists---and\n \/\/ maximize if we have images otherwise.\n if (maximizeFlag ? get(maximizeFlag) : imageFiles) {\n app->maximize();\n }\n\n \/\/ Apply parameter flags\n if (exposureFlag) { app->setExposure(get(exposureFlag)); }\n if (filterFlag) { app->setFilter(get(filterFlag)); }\n if (metricFlag) { app->setMetric(toMetric(get(metricFlag))); }\n if (offsetFlag) { app->setOffset(get(offsetFlag)); }\n if (tonemapFlag) { app->setTonemap(toTonemap(get(tonemapFlag))); }\n\n \/\/ Refresh only every 250ms if there are no user interactions.\n \/\/ This makes an idling tev surprisingly energy-efficient. :)\n nanogui::mainloop(250);\n }\n\n \/\/ On some linux distributions glfwTerminate() (which is called by\n \/\/ nanogui::shutdown()) causes segfaults. Since we are done with our\n \/\/ program here anyways, let's let the OS clean up after us.\n \/\/nanogui::shutdown();\n\n \/\/ Let all threads gracefully terminate.\n ThreadPool::shutdown();\n\n return 0;\n}\n\nTEV_NAMESPACE_END\n\n#ifdef _WIN32\nint wmain(int argc, wchar_t* argv[]) {\n#else\nint main(int argc, char* argv[]) {\n#endif\n try {\n vector<string> arguments;\n for (int i = 0; i < argc; ++i) {\n#ifdef _WIN32\n arguments.emplace_back(tev::utf16to8(argv[i]));\n#else\n string arg = argv[i];\n \/\/ OSX sometimes (seemingly sporadically) passes the\n \/\/ process serial number via a command line parameter.\n \/\/ We would like to ignore this.\n if (arg.find(\"-psn\") != 0) {\n arguments.emplace_back(tev::ensureUtf8(argv[i]));\n }\n#endif\n }\n\n tev::mainFunc(arguments);\n } catch (const exception& e) {\n cerr << tfm::format(\"Uncaught exception: %s\", e.what()) << endl;\n return 1;\n }\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"openmc\/dagmc.h\"\n\n#include \"openmc\/cell.h\"\n#include \"openmc\/constants.h\"\n#include \"openmc\/error.h\"\n#include \"openmc\/file_utils.h\"\n#include \"openmc\/geometry.h\"\n#include \"openmc\/geometry_aux.h\"\n#include \"openmc\/material.h\"\n#include \"openmc\/string_utils.h\"\n#include \"openmc\/settings.h\"\n#include \"openmc\/surface.h\"\n\n#ifdef DAGMC\n#include \"uwuw.hpp\"\n#include \"dagmcmetadata.hpp\"\n#endif\n#include <fmt\/core.h>\n\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <fstream>\n\nnamespace openmc {\n\n#ifdef DAGMC\nconst bool dagmc_enabled = true;\n#else\nconst bool dagmc_enabled = false;\n#endif\n\n}\n\n#ifdef DAGMC\n\nnamespace openmc {\n\nconst std::string DAGMC_FILENAME = \"dagmc.h5m\";\n\nnamespace model {\n\nmoab::DagMC* DAG;\n\n} \/\/ namespace model\n\n\nstd::string dagmc_file() {\n std::string filename = settings::path_input + DAGMC_FILENAME;\n if (!file_exists(filename)) {\n fatal_error(\"Geometry DAGMC file '\" + filename + \"' does not exist!\");\n }\n return filename;\n}\n\nbool get_uwuw_materials_xml(std::string& s) {\n std::string filename = dagmc_file();\n UWUW uwuw(filename.c_str());\n\n std::stringstream ss;\n bool uwuw_mats_present = false;\n if (uwuw.material_library.size() != 0) {\n uwuw_mats_present = true;\n \/\/ write header\n ss << \"<?xml version=\\\"1.0\\\"?>\\n\";\n ss << \"<materials>\\n\";\n const auto& mat_lib = uwuw.material_library;\n \/\/ write materials\n for (auto mat : mat_lib) { ss << mat.second->openmc(\"atom\"); }\n \/\/ write footer\n ss << \"<\/materials>\";\n s = ss.str();\n }\n\n return uwuw_mats_present;\n}\n\nbool read_uwuw_materials(pugi::xml_document& doc) {\n std::string s;\n bool found_uwuw_mats = get_uwuw_materials_xml(s);\n if (found_uwuw_mats) {\n pugi::xml_parse_result result = doc.load_string(s.c_str());\n if (!result) {\n throw std::runtime_error{\"Error reading UWUW materials\"};\n }\n }\n return found_uwuw_mats;\n}\n\nbool write_uwuw_materials_xml() {\n std::string s;\n bool found_uwuw_mats = get_uwuw_materials_xml(s);\n \/\/ if there is a material library in the file\n if (found_uwuw_mats) {\n \/\/ write a material.xml file\n std::ofstream mats_xml(\"materials.xml\");\n mats_xml << s;\n mats_xml.close();\n }\n\n return found_uwuw_mats;\n}\n\nvoid legacy_assign_material(std::string mat_string, DAGCell* c)\n{\n bool mat_found_by_name = false;\n \/\/ attempt to find a material with a matching name\n to_lower(mat_string);\n for (const auto& m : model::materials) {\n std::string m_name = m->name();\n to_lower(m_name);\n if (mat_string == m_name) {\n \/\/ assign the material with that name\n if (!mat_found_by_name) {\n mat_found_by_name = true;\n c->material_.push_back(m->id_);\n \/\/ report error if more than one material is found\n } else {\n fatal_error(fmt::format(\n \"More than one material found with name {}. Please ensure materials \"\n \"have unique names if using this property to assign materials.\",\n mat_string));\n }\n }\n }\n\n \/\/ if no material was set using a name, assign by id\n if (!mat_found_by_name) {\n try {\n auto id = std::stoi(mat_string);\n c->material_.emplace_back(id);\n } catch (const std::invalid_argument&) {\n fatal_error(fmt::format(\n \"No material {} found for volume (cell) {}\", mat_string, c->id_));\n }\n }\n\n if (settings::verbosity >= 10) {\n const auto& m = model::materials[model::material_map.at(c->material_[0])];\n std::stringstream msg;\n msg << \"DAGMC material \" << mat_string << \" was assigned\";\n if (mat_found_by_name) {\n msg << \" using material name: \" << m->name_;\n } else {\n msg << \" using material id: \" << m->id_;\n }\n write_message(msg.str(), 10);\n }\n}\n\nvoid load_dagmc_geometry()\n{\n if (!model::DAG) {\n model::DAG = new moab::DagMC();\n }\n\n \/\/ --- Materials ---\n\n \/\/ create uwuw instance\n auto filename = dagmc_file();\n UWUW uwuw(filename.c_str());\n\n \/\/ check for uwuw material definitions\n bool using_uwuw = !uwuw.material_library.empty();\n\n \/\/ notify user if UWUW materials are going to be used\n if (using_uwuw) {\n write_message(\"Found UWUW Materials in the DAGMC geometry file.\", 6);\n }\n\n int32_t dagmc_univ_id = 0; \/\/ universe is always 0 for DAGMC runs\n\n \/\/ load the DAGMC geometry\n moab::ErrorCode rval = model::DAG->load_file(filename.c_str());\n MB_CHK_ERR_CONT(rval);\n\n \/\/ initialize acceleration data structures\n rval = model::DAG->init_OBBTree();\n MB_CHK_ERR_CONT(rval);\n\n \/\/ parse model metadata\n dagmcMetaData DMD(model::DAG, false, false);\n DMD.load_property_data();\n\n std::vector<std::string> keywords {\"temp\"};\n std::map<std::string, std::string> dum;\n std::string delimiters = \":\/\";\n rval = model::DAG->parse_properties(keywords, dum, delimiters.c_str());\n MB_CHK_ERR_CONT(rval);\n\n \/\/ --- Cells (Volumes) ---\n\n \/\/ initialize cell objects\n int n_cells = model::DAG->num_entities(3);\n moab::EntityHandle graveyard = 0;\n for (int i = 0; i < n_cells; i++) {\n moab::EntityHandle vol_handle = model::DAG->entity_by_index(3, i+1);\n\n \/\/ set cell ids using global IDs\n DAGCell* c = new DAGCell();\n c->dag_index_ = i+1;\n c->id_ = model::DAG->id_by_index(3, c->dag_index_);\n c->dagmc_ptr_ = model::DAG;\n c->universe_ = dagmc_univ_id; \/\/ set to zero for now\n c->fill_ = C_NONE; \/\/ no fill, single universe\n\n model::cells.emplace_back(c);\n model::cell_map[c->id_] = i;\n\n \/\/ Populate the Universe vector and dict\n auto it = model::universe_map.find(dagmc_univ_id);\n if (it == model::universe_map.end()) {\n model::universes.push_back(std::make_unique<Universe>());\n model::universes.back()->id_ = dagmc_univ_id;\n model::universes.back()->cells_.push_back(i);\n model::universe_map[dagmc_univ_id] = model::universes.size() - 1;\n } else {\n model::universes[it->second]->cells_.push_back(i);\n }\n\n \/\/ MATERIALS\n\n \/\/ determine volume material assignment\n std::string mat_str = DMD.get_volume_property(\"material\", vol_handle);\n\n if (mat_str.empty()) {\n fatal_error(fmt::format(\"Volume {} has no material assignment.\", c->id_));\n }\n\n to_lower(mat_str);\n\n if (mat_str == \"graveyard\") {\n graveyard = vol_handle;\n }\n\n \/\/ material void checks\n if (mat_str == \"void\" || mat_str == \"vacuum\" || mat_str == \"graveyard\") {\n c->material_.push_back(MATERIAL_VOID);\n } else {\n if (using_uwuw) {\n \/\/ lookup material in uwuw if present\n std::string uwuw_mat = DMD.volume_material_property_data_eh[vol_handle];\n if (uwuw.material_library.count(uwuw_mat) != 0) {\n \/\/ Note: material numbers are set by UWUW\n int mat_number = uwuw.material_library.get_material(uwuw_mat).metadata[\"mat_number\"].asInt();\n c->material_.push_back(mat_number);\n } else {\n fatal_error(fmt::format(\"Material with value {} not found in the \"\n \"UWUW material library\", mat_str));\n }\n } else {\n legacy_assign_material(mat_str, c);\n }\n }\n\n \/\/ check for temperature assignment\n std::string temp_value;\n\n \/\/ no temperature if void\n if (c->material_[0] == MATERIAL_VOID) continue;\n\n \/\/ assign cell temperature\n const auto& mat = model::materials[model::material_map.at(c->material_[0])];\n if (model::DAG->has_prop(vol_handle, \"temp\")) {\n rval = model::DAG->prop_value(vol_handle, \"temp\", temp_value);\n MB_CHK_ERR_CONT(rval);\n double temp = std::stod(temp_value);\n c->sqrtkT_.push_back(std::sqrt(K_BOLTZMANN * temp));\n } else {\n c->sqrtkT_.push_back(std::sqrt(K_BOLTZMANN * mat->temperature()));\n }\n\n }\n\n \/\/ allocate the cell overlap count if necessary\n if (settings::check_overlaps) {\n model::overlap_check_count.resize(model::cells.size(), 0);\n }\n\n if (!graveyard) {\n warning(\"No graveyard volume found in the DagMC model.\"\n \"This may result in lost particles and rapid simulation failure.\");\n }\n\n \/\/ --- Surfaces ---\n\n \/\/ initialize surface objects\n int n_surfaces = model::DAG->num_entities(2);\n\n for (int i = 0; i < n_surfaces; i++) {\n moab::EntityHandle surf_handle = model::DAG->entity_by_index(2, i+1);\n\n \/\/ set cell ids using global IDs\n DAGSurface* s = new DAGSurface();\n s->dag_index_ = i+1;\n s->id_ = model::DAG->id_by_index(2, s->dag_index_);\n s->dagmc_ptr_ = model::DAG;\n\n \/\/ set BCs\n std::string bc_value = DMD.get_surface_property(\"boundary\", surf_handle);\n to_lower(bc_value);\n if (bc_value.empty() || bc_value == \"transmit\" || bc_value == \"transmission\") {\n \/\/ Leave the bc_ a nullptr\n } else if (bc_value == \"vacuum\") {\n s->bc_ = std::make_shared<VacuumBC>();\n } else if (bc_value == \"reflective\" || bc_value == \"reflect\" || bc_value == \"reflecting\") {\n s->bc_ = std::make_shared<ReflectiveBC>();\n } else if (bc_value == \"white\") {\n fatal_error(\"White boundary condition not supported in DAGMC.\");\n } else if (bc_value == \"periodic\") {\n fatal_error(\"Periodic boundary condition not supported in DAGMC.\");\n } else {\n fatal_error(fmt::format(\"Unknown boundary condition \\\"{}\\\" specified \"\n \"on surface {}\", bc_value, s->id_));\n }\n\n \/\/ graveyard check\n moab::Range parent_vols;\n rval = model::DAG->moab_instance()->get_parent_meshsets(surf_handle, parent_vols);\n MB_CHK_ERR_CONT(rval);\n\n \/\/ if this surface belongs to the graveyard\n if (graveyard && parent_vols.find(graveyard) != parent_vols.end()) {\n \/\/ set graveyard surface BC's to vacuum\n s->bc_ = std::make_shared<VacuumBC>();\n }\n\n \/\/ add to global array and map\n model::surfaces.emplace_back(s);\n model::surface_map[s->id_] = i;\n }\n\n return;\n}\n\nvoid read_geometry_dagmc()\n{\n write_message(\"Reading DAGMC geometry...\", 5);\n load_dagmc_geometry();\n\n model::root_universe = find_root_universe();\n}\n\nvoid free_memory_dagmc()\n{\n delete model::DAG;\n}\n\n\n}\n#endif\n<commit_msg>Add missing surface source flag on DagMC surface<commit_after>#include \"openmc\/dagmc.h\"\n\n#include \"openmc\/cell.h\"\n#include \"openmc\/constants.h\"\n#include \"openmc\/container_util.h\"\n#include \"openmc\/error.h\"\n#include \"openmc\/file_utils.h\"\n#include \"openmc\/geometry.h\"\n#include \"openmc\/geometry_aux.h\"\n#include \"openmc\/material.h\"\n#include \"openmc\/string_utils.h\"\n#include \"openmc\/settings.h\"\n#include \"openmc\/surface.h\"\n\n#ifdef DAGMC\n#include \"uwuw.hpp\"\n#include \"dagmcmetadata.hpp\"\n#endif\n#include <fmt\/core.h>\n\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <fstream>\n\nnamespace openmc {\n\n#ifdef DAGMC\nconst bool dagmc_enabled = true;\n#else\nconst bool dagmc_enabled = false;\n#endif\n\n}\n\n#ifdef DAGMC\n\nnamespace openmc {\n\nconst std::string DAGMC_FILENAME = \"dagmc.h5m\";\n\nnamespace model {\n\nmoab::DagMC* DAG;\n\n} \/\/ namespace model\n\n\nstd::string dagmc_file() {\n std::string filename = settings::path_input + DAGMC_FILENAME;\n if (!file_exists(filename)) {\n fatal_error(\"Geometry DAGMC file '\" + filename + \"' does not exist!\");\n }\n return filename;\n}\n\nbool get_uwuw_materials_xml(std::string& s) {\n std::string filename = dagmc_file();\n UWUW uwuw(filename.c_str());\n\n std::stringstream ss;\n bool uwuw_mats_present = false;\n if (uwuw.material_library.size() != 0) {\n uwuw_mats_present = true;\n \/\/ write header\n ss << \"<?xml version=\\\"1.0\\\"?>\\n\";\n ss << \"<materials>\\n\";\n const auto& mat_lib = uwuw.material_library;\n \/\/ write materials\n for (auto mat : mat_lib) { ss << mat.second->openmc(\"atom\"); }\n \/\/ write footer\n ss << \"<\/materials>\";\n s = ss.str();\n }\n\n return uwuw_mats_present;\n}\n\nbool read_uwuw_materials(pugi::xml_document& doc) {\n std::string s;\n bool found_uwuw_mats = get_uwuw_materials_xml(s);\n if (found_uwuw_mats) {\n pugi::xml_parse_result result = doc.load_string(s.c_str());\n if (!result) {\n throw std::runtime_error{\"Error reading UWUW materials\"};\n }\n }\n return found_uwuw_mats;\n}\n\nbool write_uwuw_materials_xml() {\n std::string s;\n bool found_uwuw_mats = get_uwuw_materials_xml(s);\n \/\/ if there is a material library in the file\n if (found_uwuw_mats) {\n \/\/ write a material.xml file\n std::ofstream mats_xml(\"materials.xml\");\n mats_xml << s;\n mats_xml.close();\n }\n\n return found_uwuw_mats;\n}\n\nvoid legacy_assign_material(std::string mat_string, DAGCell* c)\n{\n bool mat_found_by_name = false;\n \/\/ attempt to find a material with a matching name\n to_lower(mat_string);\n for (const auto& m : model::materials) {\n std::string m_name = m->name();\n to_lower(m_name);\n if (mat_string == m_name) {\n \/\/ assign the material with that name\n if (!mat_found_by_name) {\n mat_found_by_name = true;\n c->material_.push_back(m->id_);\n \/\/ report error if more than one material is found\n } else {\n fatal_error(fmt::format(\n \"More than one material found with name {}. Please ensure materials \"\n \"have unique names if using this property to assign materials.\",\n mat_string));\n }\n }\n }\n\n \/\/ if no material was set using a name, assign by id\n if (!mat_found_by_name) {\n try {\n auto id = std::stoi(mat_string);\n c->material_.emplace_back(id);\n } catch (const std::invalid_argument&) {\n fatal_error(fmt::format(\n \"No material {} found for volume (cell) {}\", mat_string, c->id_));\n }\n }\n\n if (settings::verbosity >= 10) {\n const auto& m = model::materials[model::material_map.at(c->material_[0])];\n std::stringstream msg;\n msg << \"DAGMC material \" << mat_string << \" was assigned\";\n if (mat_found_by_name) {\n msg << \" using material name: \" << m->name_;\n } else {\n msg << \" using material id: \" << m->id_;\n }\n write_message(msg.str(), 10);\n }\n}\n\nvoid load_dagmc_geometry()\n{\n if (!model::DAG) {\n model::DAG = new moab::DagMC();\n }\n\n \/\/ --- Materials ---\n\n \/\/ create uwuw instance\n auto filename = dagmc_file();\n UWUW uwuw(filename.c_str());\n\n \/\/ check for uwuw material definitions\n bool using_uwuw = !uwuw.material_library.empty();\n\n \/\/ notify user if UWUW materials are going to be used\n if (using_uwuw) {\n write_message(\"Found UWUW Materials in the DAGMC geometry file.\", 6);\n }\n\n int32_t dagmc_univ_id = 0; \/\/ universe is always 0 for DAGMC runs\n\n \/\/ load the DAGMC geometry\n moab::ErrorCode rval = model::DAG->load_file(filename.c_str());\n MB_CHK_ERR_CONT(rval);\n\n \/\/ initialize acceleration data structures\n rval = model::DAG->init_OBBTree();\n MB_CHK_ERR_CONT(rval);\n\n \/\/ parse model metadata\n dagmcMetaData DMD(model::DAG, false, false);\n DMD.load_property_data();\n\n std::vector<std::string> keywords {\"temp\"};\n std::map<std::string, std::string> dum;\n std::string delimiters = \":\/\";\n rval = model::DAG->parse_properties(keywords, dum, delimiters.c_str());\n MB_CHK_ERR_CONT(rval);\n\n \/\/ --- Cells (Volumes) ---\n\n \/\/ initialize cell objects\n int n_cells = model::DAG->num_entities(3);\n moab::EntityHandle graveyard = 0;\n for (int i = 0; i < n_cells; i++) {\n moab::EntityHandle vol_handle = model::DAG->entity_by_index(3, i+1);\n\n \/\/ set cell ids using global IDs\n DAGCell* c = new DAGCell();\n c->dag_index_ = i+1;\n c->id_ = model::DAG->id_by_index(3, c->dag_index_);\n c->dagmc_ptr_ = model::DAG;\n c->universe_ = dagmc_univ_id; \/\/ set to zero for now\n c->fill_ = C_NONE; \/\/ no fill, single universe\n\n model::cells.emplace_back(c);\n model::cell_map[c->id_] = i;\n\n \/\/ Populate the Universe vector and dict\n auto it = model::universe_map.find(dagmc_univ_id);\n if (it == model::universe_map.end()) {\n model::universes.push_back(std::make_unique<Universe>());\n model::universes.back()->id_ = dagmc_univ_id;\n model::universes.back()->cells_.push_back(i);\n model::universe_map[dagmc_univ_id] = model::universes.size() - 1;\n } else {\n model::universes[it->second]->cells_.push_back(i);\n }\n\n \/\/ MATERIALS\n\n \/\/ determine volume material assignment\n std::string mat_str = DMD.get_volume_property(\"material\", vol_handle);\n\n if (mat_str.empty()) {\n fatal_error(fmt::format(\"Volume {} has no material assignment.\", c->id_));\n }\n\n to_lower(mat_str);\n\n if (mat_str == \"graveyard\") {\n graveyard = vol_handle;\n }\n\n \/\/ material void checks\n if (mat_str == \"void\" || mat_str == \"vacuum\" || mat_str == \"graveyard\") {\n c->material_.push_back(MATERIAL_VOID);\n } else {\n if (using_uwuw) {\n \/\/ lookup material in uwuw if present\n std::string uwuw_mat = DMD.volume_material_property_data_eh[vol_handle];\n if (uwuw.material_library.count(uwuw_mat) != 0) {\n \/\/ Note: material numbers are set by UWUW\n int mat_number = uwuw.material_library.get_material(uwuw_mat).metadata[\"mat_number\"].asInt();\n c->material_.push_back(mat_number);\n } else {\n fatal_error(fmt::format(\"Material with value {} not found in the \"\n \"UWUW material library\", mat_str));\n }\n } else {\n legacy_assign_material(mat_str, c);\n }\n }\n\n \/\/ check for temperature assignment\n std::string temp_value;\n\n \/\/ no temperature if void\n if (c->material_[0] == MATERIAL_VOID) continue;\n\n \/\/ assign cell temperature\n const auto& mat = model::materials[model::material_map.at(c->material_[0])];\n if (model::DAG->has_prop(vol_handle, \"temp\")) {\n rval = model::DAG->prop_value(vol_handle, \"temp\", temp_value);\n MB_CHK_ERR_CONT(rval);\n double temp = std::stod(temp_value);\n c->sqrtkT_.push_back(std::sqrt(K_BOLTZMANN * temp));\n } else {\n c->sqrtkT_.push_back(std::sqrt(K_BOLTZMANN * mat->temperature()));\n }\n\n }\n\n \/\/ allocate the cell overlap count if necessary\n if (settings::check_overlaps) {\n model::overlap_check_count.resize(model::cells.size(), 0);\n }\n\n if (!graveyard) {\n warning(\"No graveyard volume found in the DagMC model.\"\n \"This may result in lost particles and rapid simulation failure.\");\n }\n\n \/\/ --- Surfaces ---\n\n \/\/ initialize surface objects\n int n_surfaces = model::DAG->num_entities(2);\n\n for (int i = 0; i < n_surfaces; i++) {\n moab::EntityHandle surf_handle = model::DAG->entity_by_index(2, i+1);\n\n \/\/ set cell ids using global IDs\n DAGSurface* s = new DAGSurface();\n s->dag_index_ = i+1;\n s->id_ = model::DAG->id_by_index(2, s->dag_index_);\n s->dagmc_ptr_ = model::DAG;\n\n if (contains(settings::src_write_surf_id, s->id_)) {\n s->surf_src_ = true;\n }\n\n \/\/ set BCs\n std::string bc_value = DMD.get_surface_property(\"boundary\", surf_handle);\n to_lower(bc_value);\n if (bc_value.empty() || bc_value == \"transmit\" || bc_value == \"transmission\") {\n \/\/ Leave the bc_ a nullptr\n } else if (bc_value == \"vacuum\") {\n s->bc_ = std::make_shared<VacuumBC>();\n } else if (bc_value == \"reflective\" || bc_value == \"reflect\" || bc_value == \"reflecting\") {\n s->bc_ = std::make_shared<ReflectiveBC>();\n } else if (bc_value == \"white\") {\n fatal_error(\"White boundary condition not supported in DAGMC.\");\n } else if (bc_value == \"periodic\") {\n fatal_error(\"Periodic boundary condition not supported in DAGMC.\");\n } else {\n fatal_error(fmt::format(\"Unknown boundary condition \\\"{}\\\" specified \"\n \"on surface {}\", bc_value, s->id_));\n }\n\n \/\/ graveyard check\n moab::Range parent_vols;\n rval = model::DAG->moab_instance()->get_parent_meshsets(surf_handle, parent_vols);\n MB_CHK_ERR_CONT(rval);\n\n \/\/ if this surface belongs to the graveyard\n if (graveyard && parent_vols.find(graveyard) != parent_vols.end()) {\n \/\/ set graveyard surface BC's to vacuum\n s->bc_ = std::make_shared<VacuumBC>();\n }\n\n \/\/ add to global array and map\n model::surfaces.emplace_back(s);\n model::surface_map[s->id_] = i;\n }\n\n return;\n}\n\nvoid read_geometry_dagmc()\n{\n write_message(\"Reading DAGMC geometry...\", 5);\n load_dagmc_geometry();\n\n model::root_universe = find_root_universe();\n}\n\nvoid free_memory_dagmc()\n{\n delete model::DAG;\n}\n\n\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#include \"common.h\"\n#include \"parser.h\"\n#include \"wrap.h\"\n#include \"ir.h\"\n#include \"cps.h\"\n#include \"compile.h\"\n#include \"optimize.h\"\n#include <iostream>\n#include \"assets.h\"\n\nusing namespace cirth;\n\nint main(int argc, char** argv) {\n std::string str;\n std::ostringstream os;\n os << assets::PRELUDE_CTH << \"\\n\";\n\n while(getline(std::cin, str)) {\n os << str << '\\n';\n }\n\n try {\n \/\/ force counters\n UPDATE_FIELD; \/\/ gets 0\n LOOKUP_FIELD; \/\/ gets 1\n\n std::vector<PTR<ast::Expression> > ast;\n bool r = parser::parse(os.str(), ast);\n if(!r) throw expectation_failure(\"failed parsing!\");\n\n std::vector<PTR<ir::Expression> > ir;\n wrap::ir_prepend(ir);\n ir::Name lastval(NULL_VALUE);\n ir::convert(ast, ir, lastval);\n lastval = NULL_VALUE;\n ast.clear();\n optimize::ir(ir);\n\n PTR<cps::Expression> cps;\n cps::transform(ir, lastval, cps);\n ir.clear();\n optimize::cps(cps);\n\n compile::compile(cps, std::cout);\n } catch (const std::exception& e) {\n std::cerr << \"failure: \" << e.what() << std::endl;\n return 1;\n }\n\n return 0;\n}\n<commit_msg>first commandline option<commit_after>#include \"common.h\"\n#include \"parser.h\"\n#include \"wrap.h\"\n#include \"ir.h\"\n#include \"cps.h\"\n#include \"compile.h\"\n#include \"optimize.h\"\n#include <iostream>\n#include \"assets.h\"\n\nusing namespace cirth;\n\nint main(int argc, char** argv) {\n\n bool include_prelude = true;\n\n for(int i = 1; i < argc;) {\n if(argv[i] == std::string(\"--skip-prelude\")) {\n include_prelude = false;\n ++i;\n continue;\n }\n if(argv[i] == std::string(\"--help\")) {\n std::cout << \"usage: \" << argv[0] << \" [--skip_prelude]\" << std::endl;\n std::cout << \" source comes in stdin, C comes out stdout\" << std::endl;\n return 0;\n }\n std::cerr << \"unknown argument! try --help\" << std::endl;\n return 1;\n }\n\n std::string str;\n std::ostringstream os;\n if(include_prelude) os << assets::PRELUDE_CTH << \"\\n\";\n\n while(getline(std::cin, str)) {\n os << str << '\\n';\n }\n\n try {\n \/\/ force counters\n UPDATE_FIELD; \/\/ gets 0\n LOOKUP_FIELD; \/\/ gets 1\n\n std::vector<PTR<ast::Expression> > ast;\n bool r = parser::parse(os.str(), ast);\n if(!r) throw expectation_failure(\"failed parsing!\");\n\n std::vector<PTR<ir::Expression> > ir;\n wrap::ir_prepend(ir);\n ir::Name lastval(NULL_VALUE);\n ir::convert(ast, ir, lastval);\n lastval = NULL_VALUE;\n ast.clear();\n optimize::ir(ir);\n\n PTR<cps::Expression> cps;\n cps::transform(ir, lastval, cps);\n ir.clear();\n optimize::cps(cps);\n\n compile::compile(cps, std::cout);\n } catch (const std::exception& e) {\n std::cerr << \"failure: \" << e.what() << std::endl;\n return 1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <stdint.h>\n#include <iostream>\n\n#include \"demo.pb.h\"\n#include \"netmessages.pb.h\"\n\n#include \"bitstream.h\"\n#include \"debug.h\"\n#include \"demo.h\"\n#include \"entity.h\"\n#include \"state.h\"\n#include \"death_recording_visitor.h\"\n\n#define INSTANCE_BASELINE_TABLE \"instancebaseline\"\n#define KEY_HISTORY_SIZE 32\n#define MAX_EDICTS 0x800\n#define MAX_KEY_SIZE 0x400\n#define MAX_VALUE_SIZE 0x4000\n\nenum UpdateFlag {\n UF_LeavePVS = 1,\n UF_Delete = 2,\n UF_EnterPVS = 4,\n};\n\nState *state = 0;\n\nuint32_t read_var_int(const char *data, size_t length, size_t *offset) {\n uint32_t b;\n int count = 0;\n uint32_t result = 0;\n\n do {\n XASSERT(count != 5, \"Corrupt data.\");\n XASSERT(*offset <= length, \"Premature end of stream.\");\n\n b = data[(*offset)++];\n result |= (b & 0x7F) << (7 * count);\n ++count;\n } while (b & 0x80);\n\n return result;\n}\n\nvoid dump_SVC_SendTable(const CSVCMsg_SendTable &table) {\n XASSERT(state, \"SVC_SendTable but no state created.\");\n\n SendTable &converted = state->create_send_table(table.net_table_name(), table.needs_decoder());\n\n size_t prop_count = table.props_size();\n for (size_t i = 0; i < prop_count; ++i) {\n const CSVCMsg_SendTable_sendprop_t &prop = table.props(i);\n\n SendProp c(\n static_cast<SP_Types>(prop.type()),\n prop.var_name(),\n prop.flags(),\n prop.priority(),\n prop.dt_name(),\n prop.num_elements(),\n prop.low_value(),\n prop.high_value(),\n prop.num_bits());\n\n converted.props.add(c);\n }\n}\n\nvoid dump_DEM_SendTables(const CDemoSendTables &tables) {\n const char *data = tables.data().c_str();\n size_t offset = 0;\n size_t length = tables.data().length();\n\n while (offset < length) {\n uint32_t command = read_var_int(data, length, &offset);\n uint32_t size = read_var_int(data, length, &offset);\n XASSERT(offset + size <= length, \"Reading data outside of table.\");\n\n XASSERT(command == svc_SendTable, \"Command %u in DEM_SendTables.\", command);\n\n CSVCMsg_SendTable send_table;\n send_table.ParseFromArray(&(data[offset]), size);\n dump_SVC_SendTable(send_table);\n\n offset += size;\n }\n}\n\nconst StringTableEntry &get_baseline_for(int class_i) {\n XASSERT(state, \"No state created.\");\n\n StringTable &instance_baseline = state->get_string_table(INSTANCE_BASELINE_TABLE);\n\n char buf[32];\n sprintf(buf, \"%d\", class_i);\n\n return instance_baseline.get(buf);\n}\n\nuint32_t read_entity_header(uint32_t *base, Bitstream &stream) {\n uint32_t value = stream.get_bits(6);\n\n if (value & 0x30) {\n uint32_t a = (value >> 4) & 3;\n uint32_t b = (a == 3) ? 16 : 0;\n\n value = stream.get_bits(4 * a + b) << 4 | (value & 0xF);\n }\n\n *base += value + 1;\n\n unsigned int update_flags = 0;\n\n if (!stream.get_bits(1)) {\n if (stream.get_bits(1)) {\n update_flags |= UF_EnterPVS;\n }\n } else {\n update_flags |= UF_LeavePVS;\n if (stream.get_bits(1)) {\n update_flags |= UF_Delete;\n }\n }\n\n return update_flags;\n}\n\nvoid read_entity_enter_pvs(uint32_t entity_id, Bitstream &stream, Visitor& visitor) {\n uint32_t class_i = stream.get_bits(state->class_bits);\n uint32_t serial = stream.get_bits(10);\n\n XASSERT(entity_id < MAX_EDICTS, \"Entity %ld exceeds max edicts.\", entity_id);\n\n const Class &clazz = state->get_class(class_i);\n const FlatSendTable &flat_send_table = state->flat_send_tables[clazz.dt_name];\n\n Entity &entity = state->entities[entity_id];\n\n if (entity.id != -1) {\n visitor.visit_entity_deleted(entity);\n }\n\n entity = Entity(entity_id, clazz, flat_send_table);\n\n const StringTableEntry &baseline = get_baseline_for(class_i);\n Bitstream baseline_stream(baseline.value);\n entity.update(baseline_stream);\n\n entity.update(stream);\n\n visitor.visit_entity_created(entity);\n}\n\nvoid read_entity_update(uint32_t entity_id, Bitstream &stream, Visitor& visitor) {\n XASSERT(entity_id < MAX_ENTITIES, \"Entity id too big\");\n\n Entity &entity = state->entities[entity_id];\n XASSERT(entity.id != -1, \"Entity %d is not set up.\", entity_id);\n\n entity.update(stream);\n\n visitor.visit_entity_updated(entity);\n}\n\nvoid dump_SVC_PacketEntities(const CSVCMsg_PacketEntities &entities, Visitor& visitor) {\n Bitstream stream(entities.entity_data());\n\n uint32_t entity_id = -1;\n size_t found = 0;\n uint32_t update_type;\n\n while (found < entities.updated_entries()) {\n update_type = read_entity_header(&entity_id, stream);\n\n if (update_type & UF_EnterPVS) {\n read_entity_enter_pvs(entity_id, stream, visitor);\n } else if (update_type & UF_LeavePVS) {\n XASSERT(entities.is_delta(), \"Leave PVS on full update\");\n\n if (update_type & UF_Delete) {\n visitor.visit_entity_deleted(state->entities[entity_id]);\n\n state->entities[entity_id].id = -1;\n }\n } else {\n read_entity_update(entity_id, stream, visitor);\n }\n\n ++found;\n }\n\n if (entities.is_delta()) {\n while (stream.get_bits(1)) {\n entity_id = stream.get_bits(11);\n visitor.visit_entity_deleted(state->entities[entity_id]);\n state->entities[entity_id].id = -1;\n }\n }\n}\n\nvoid dump_SVC_ServerInfo(const CSVCMsg_ServerInfo &info) {\n XASSERT(!state, \"Already seen SVC_ServerInfo.\");\n\n state = new State(info.max_classes());\n}\n\nvoid dump_DEM_ClassInfo(const CDemoClassInfo &info) {\n XASSERT(state, \"DEM_ClassInfo but no state.\");\n\n for (size_t i = 0; i < info.classes_size(); ++i) {\n const CDemoClassInfo_class_t &clazz = info.classes(i);\n state->create_class(clazz.class_id(), clazz.table_name(), clazz.network_name());\n }\n\n for (auto iter = state->send_tables.begin(); iter != state->send_tables.end(); ++iter) {\n SendTable &table = *iter;\n\n for (size_t i = 0; i < table.props.size(); ++i) {\n SendProp &prop = table.props[i];\n\n prop.in_table = &table;\n\n if (prop.type == SP_Array) {\n XASSERT(i > 0, \"Array prop %s is at index zero.\", prop.var_name.c_str());\n prop.array_prop = &(table.props[i - 1]);\n }\n }\n }\n\n state->compile_send_tables();\n}\n\nvoid read_string_table_key(uint32_t first_bit, Bitstream &stream, char *buf,\n size_t buf_length, std::vector<std::string> &key_history) {\n if (first_bit && stream.get_bits(1)) {\n XERROR(\"Not sure how to read this key\");\n } else {\n uint32_t is_substring = stream.get_bits(1);\n\n if (is_substring) {\n uint32_t from_index = stream.get_bits(5);\n uint32_t from_length = stream.get_bits(5);\n key_history[from_index].copy(buf, from_length, 0);\n\n stream.read_string(buf + from_length, buf_length - from_length);\n } else {\n stream.read_string(buf, buf_length);\n }\n }\n}\n\nvoid update_string_table(StringTable &table, size_t num_entries, const std::string &data) {\n \/\/ These do something with precaches. This isn't a client so I'm assuming this\n \/\/ is irrelevant.\n if (table.flags & 2) {\n return;\n }\n\n Bitstream stream(data);\n\n uint32_t first_bit = stream.get_bits(1);\n\n std::vector<std::string> key_history;\n\n uint32_t entry_id = -1;\n size_t entries_read = 0;\n while (entries_read < num_entries) {\n if (!stream.get_bits(1)) {\n entry_id = stream.get_bits(table.entry_bits);\n } else {\n entry_id += 1;\n }\n\n XASSERT(entry_id < table.max_entries, \"Entry id too large\");\n\n char key_buffer[MAX_KEY_SIZE];\n char *key = 0;\n if (stream.get_bits(1)) {\n read_string_table_key(first_bit, stream, key_buffer, MAX_KEY_SIZE, key_history);\n\n key = key_buffer;\n\n \/\/ So technically we should only store the first 32 characters but I'm lazy.\n if (key_history.size() == KEY_HISTORY_SIZE) {\n key_history.erase(key_history.begin());\n }\n\n key_history.push_back(key);\n }\n\n char value_buffer[MAX_VALUE_SIZE];\n char *value = 0;\n size_t bit_length = 0;\n size_t length = 0;\n if (stream.get_bits(1)) {\n if (table.flags & ST_FixedLength) {\n length = table.user_data_size;\n bit_length = table.user_data_size_bits;\n } else {\n length = stream.get_bits(14);\n bit_length = 8 * length;\n }\n\n XASSERT(length < MAX_VALUE_SIZE, \"Message too long.\");\n\n stream.read_bits(value_buffer, bit_length);\n }\n\n if (entry_id < table.count()) {\n StringTableEntry &item = table.get(entry_id);\n\n if (key) {\n XASSERT(item.key == key, \"Entry's keys don't match.\");\n }\n\n if (value) {\n \/\/ This is kind of bad because if the server sends us a zero length string we'll consider\n \/\/ it to be uninitialized.\n XASSERT(item.value.size() == 0, \"String table already has this value\");\n item.value = std::string(value, length);\n }\n } else {\n XASSERT(key, \"Creating a new string table entry but no key specified.\");\n\n table.put(key, std::string(value_buffer, length));\n }\n\n ++entries_read;\n }\n}\n\nvoid handle_SVC_CreateStringTable(const CSVCMsg_CreateStringTable &table) {\n XASSERT(state, \"SVC_CreateStringTable but no state.\");\n\n StringTable &converted = state->create_string_table(table.name(),\n (size_t) table.max_entries(), table.flags(), table.user_data_fixed_size(),\n table.user_data_size(), table.user_data_size_bits());\n\n update_string_table(converted, table.num_entries(), table.string_data());\n}\n\nvoid handle_SVC_UpdateStringTable(const CSVCMsg_UpdateStringTable &update) {\n XASSERT(state, \"SVC_UpdateStringTable but no state.\");\n\n StringTable &table = state->get_string_table(update.table_id());\n\n update_string_table(table, update.num_changed_entries(), update.string_data());\n}\n\nvoid clear_entities(Visitor& visitor) {\n for (size_t i = 0; i < MAX_ENTITIES; ++i) {\n Entity &entity = state->entities[i];\n\n if (entity.id != -1) {\n visitor.visit_entity_deleted(entity);\n entity.id = -1;\n }\n }\n}\n\nvoid dump_DEM_Packet(const CDemoPacket &packet, Visitor& visitor) {\n const char *data = packet.data().c_str();\n size_t offset = 0;\n size_t length = packet.data().length();\n\n while (offset < length) {\n uint32_t command = read_var_int(data, length, &offset);\n uint32_t size = read_var_int(data, length, &offset);\n XASSERT(offset + size <= length, \"Reading data outside of packet.\");\n\n if (command == svc_ServerInfo) {\n CSVCMsg_ServerInfo info;\n info.ParseFromArray(&(data[offset]), size);\n\n dump_SVC_ServerInfo(info);\n } else if (command == svc_PacketEntities) {\n CSVCMsg_PacketEntities entities;\n entities.ParseFromArray(&(data[offset]), size);\n\n dump_SVC_PacketEntities(entities, visitor);\n } else if (command == svc_CreateStringTable) {\n CSVCMsg_CreateStringTable table;\n table.ParseFromArray(&(data[offset]), size);\n\n handle_SVC_CreateStringTable(table);\n } else if (command == svc_UpdateStringTable) {\n CSVCMsg_UpdateStringTable table;\n table.ParseFromArray(&(data[offset]), size);\n\n handle_SVC_UpdateStringTable(table);\n }\n\n offset += size;\n }\n}\n\nvoid dump(const char *file, Visitor& visitor) {\n Demo demo(file);\n\n for (int frame = 0; !demo.eof(); ++frame) {\n int tick = 0; \n size_t size;\n bool compressed;\n size_t uncompressed_size;\n\n EDemoCommands command = demo.get_message_type(&tick, &compressed);\n demo.read_message(compressed, &size, &uncompressed_size);\n\n visitor.visit_tick(tick);\n\n if (command == DEM_ClassInfo) {\n CDemoClassInfo info;\n info.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_ClassInfo(info);\n } else if (command == DEM_SendTables) {\n CDemoSendTables tables;\n tables.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_SendTables(tables);\n } else if (command == DEM_Packet || command == DEM_SignonPacket) {\n CDemoPacket packet;\n packet.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_Packet(packet, visitor);\n }\n }\n}\n\nint main(int argc, char **argv) {\n if (argc <= 1) {\n printf(\"Usage: %s something.dem\\n\", argv[0]);\n return 1;\n }\n\n DeathRecordingVisitor v;\n dump(argv[1], v);\n return 0;\n}\n\n<commit_msg>Remove clear_entities, fixes #9<commit_after>#include <stdint.h>\n#include <iostream>\n\n#include \"demo.pb.h\"\n#include \"netmessages.pb.h\"\n\n#include \"bitstream.h\"\n#include \"debug.h\"\n#include \"demo.h\"\n#include \"entity.h\"\n#include \"state.h\"\n#include \"death_recording_visitor.h\"\n\n#define INSTANCE_BASELINE_TABLE \"instancebaseline\"\n#define KEY_HISTORY_SIZE 32\n#define MAX_EDICTS 0x800\n#define MAX_KEY_SIZE 0x400\n#define MAX_VALUE_SIZE 0x4000\n\nenum UpdateFlag {\n UF_LeavePVS = 1,\n UF_Delete = 2,\n UF_EnterPVS = 4,\n};\n\nState *state = 0;\n\nuint32_t read_var_int(const char *data, size_t length, size_t *offset) {\n uint32_t b;\n int count = 0;\n uint32_t result = 0;\n\n do {\n XASSERT(count != 5, \"Corrupt data.\");\n XASSERT(*offset <= length, \"Premature end of stream.\");\n\n b = data[(*offset)++];\n result |= (b & 0x7F) << (7 * count);\n ++count;\n } while (b & 0x80);\n\n return result;\n}\n\nvoid dump_SVC_SendTable(const CSVCMsg_SendTable &table) {\n XASSERT(state, \"SVC_SendTable but no state created.\");\n\n SendTable &converted = state->create_send_table(table.net_table_name(), table.needs_decoder());\n\n size_t prop_count = table.props_size();\n for (size_t i = 0; i < prop_count; ++i) {\n const CSVCMsg_SendTable_sendprop_t &prop = table.props(i);\n\n SendProp c(\n static_cast<SP_Types>(prop.type()),\n prop.var_name(),\n prop.flags(),\n prop.priority(),\n prop.dt_name(),\n prop.num_elements(),\n prop.low_value(),\n prop.high_value(),\n prop.num_bits());\n\n converted.props.add(c);\n }\n}\n\nvoid dump_DEM_SendTables(const CDemoSendTables &tables) {\n const char *data = tables.data().c_str();\n size_t offset = 0;\n size_t length = tables.data().length();\n\n while (offset < length) {\n uint32_t command = read_var_int(data, length, &offset);\n uint32_t size = read_var_int(data, length, &offset);\n XASSERT(offset + size <= length, \"Reading data outside of table.\");\n\n XASSERT(command == svc_SendTable, \"Command %u in DEM_SendTables.\", command);\n\n CSVCMsg_SendTable send_table;\n send_table.ParseFromArray(&(data[offset]), size);\n dump_SVC_SendTable(send_table);\n\n offset += size;\n }\n}\n\nconst StringTableEntry &get_baseline_for(int class_i) {\n XASSERT(state, \"No state created.\");\n\n StringTable &instance_baseline = state->get_string_table(INSTANCE_BASELINE_TABLE);\n\n char buf[32];\n sprintf(buf, \"%d\", class_i);\n\n return instance_baseline.get(buf);\n}\n\nuint32_t read_entity_header(uint32_t *base, Bitstream &stream) {\n uint32_t value = stream.get_bits(6);\n\n if (value & 0x30) {\n uint32_t a = (value >> 4) & 3;\n uint32_t b = (a == 3) ? 16 : 0;\n\n value = stream.get_bits(4 * a + b) << 4 | (value & 0xF);\n }\n\n *base += value + 1;\n\n unsigned int update_flags = 0;\n\n if (!stream.get_bits(1)) {\n if (stream.get_bits(1)) {\n update_flags |= UF_EnterPVS;\n }\n } else {\n update_flags |= UF_LeavePVS;\n if (stream.get_bits(1)) {\n update_flags |= UF_Delete;\n }\n }\n\n return update_flags;\n}\n\nvoid read_entity_enter_pvs(uint32_t entity_id, Bitstream &stream, Visitor& visitor) {\n uint32_t class_i = stream.get_bits(state->class_bits);\n uint32_t serial = stream.get_bits(10);\n\n XASSERT(entity_id < MAX_EDICTS, \"Entity %ld exceeds max edicts.\", entity_id);\n\n const Class &clazz = state->get_class(class_i);\n const FlatSendTable &flat_send_table = state->flat_send_tables[clazz.dt_name];\n\n Entity &entity = state->entities[entity_id];\n\n if (entity.id != -1) {\n visitor.visit_entity_deleted(entity);\n }\n\n entity = Entity(entity_id, clazz, flat_send_table);\n\n const StringTableEntry &baseline = get_baseline_for(class_i);\n Bitstream baseline_stream(baseline.value);\n entity.update(baseline_stream);\n\n entity.update(stream);\n\n visitor.visit_entity_created(entity);\n}\n\nvoid read_entity_update(uint32_t entity_id, Bitstream &stream, Visitor& visitor) {\n XASSERT(entity_id < MAX_ENTITIES, \"Entity id too big\");\n\n Entity &entity = state->entities[entity_id];\n XASSERT(entity.id != -1, \"Entity %d is not set up.\", entity_id);\n\n entity.update(stream);\n\n visitor.visit_entity_updated(entity);\n}\n\nvoid dump_SVC_PacketEntities(const CSVCMsg_PacketEntities &entities, Visitor& visitor) {\n Bitstream stream(entities.entity_data());\n\n uint32_t entity_id = -1;\n size_t found = 0;\n uint32_t update_type;\n\n while (found < entities.updated_entries()) {\n update_type = read_entity_header(&entity_id, stream);\n\n if (update_type & UF_EnterPVS) {\n read_entity_enter_pvs(entity_id, stream, visitor);\n } else if (update_type & UF_LeavePVS) {\n XASSERT(entities.is_delta(), \"Leave PVS on full update\");\n\n if (update_type & UF_Delete) {\n visitor.visit_entity_deleted(state->entities[entity_id]);\n\n state->entities[entity_id].id = -1;\n }\n } else {\n read_entity_update(entity_id, stream, visitor);\n }\n\n ++found;\n }\n\n if (entities.is_delta()) {\n while (stream.get_bits(1)) {\n entity_id = stream.get_bits(11);\n visitor.visit_entity_deleted(state->entities[entity_id]);\n state->entities[entity_id].id = -1;\n }\n }\n}\n\nvoid dump_SVC_ServerInfo(const CSVCMsg_ServerInfo &info) {\n XASSERT(!state, \"Already seen SVC_ServerInfo.\");\n\n state = new State(info.max_classes());\n}\n\nvoid dump_DEM_ClassInfo(const CDemoClassInfo &info) {\n XASSERT(state, \"DEM_ClassInfo but no state.\");\n\n for (size_t i = 0; i < info.classes_size(); ++i) {\n const CDemoClassInfo_class_t &clazz = info.classes(i);\n state->create_class(clazz.class_id(), clazz.table_name(), clazz.network_name());\n }\n\n for (auto iter = state->send_tables.begin(); iter != state->send_tables.end(); ++iter) {\n SendTable &table = *iter;\n\n for (size_t i = 0; i < table.props.size(); ++i) {\n SendProp &prop = table.props[i];\n\n prop.in_table = &table;\n\n if (prop.type == SP_Array) {\n XASSERT(i > 0, \"Array prop %s is at index zero.\", prop.var_name.c_str());\n prop.array_prop = &(table.props[i - 1]);\n }\n }\n }\n\n state->compile_send_tables();\n}\n\nvoid read_string_table_key(uint32_t first_bit, Bitstream &stream, char *buf,\n size_t buf_length, std::vector<std::string> &key_history) {\n if (first_bit && stream.get_bits(1)) {\n XERROR(\"Not sure how to read this key\");\n } else {\n uint32_t is_substring = stream.get_bits(1);\n\n if (is_substring) {\n uint32_t from_index = stream.get_bits(5);\n uint32_t from_length = stream.get_bits(5);\n key_history[from_index].copy(buf, from_length, 0);\n\n stream.read_string(buf + from_length, buf_length - from_length);\n } else {\n stream.read_string(buf, buf_length);\n }\n }\n}\n\nvoid update_string_table(StringTable &table, size_t num_entries, const std::string &data) {\n \/\/ These do something with precaches. This isn't a client so I'm assuming this\n \/\/ is irrelevant.\n if (table.flags & 2) {\n return;\n }\n\n Bitstream stream(data);\n\n uint32_t first_bit = stream.get_bits(1);\n\n std::vector<std::string> key_history;\n\n uint32_t entry_id = -1;\n size_t entries_read = 0;\n while (entries_read < num_entries) {\n if (!stream.get_bits(1)) {\n entry_id = stream.get_bits(table.entry_bits);\n } else {\n entry_id += 1;\n }\n\n XASSERT(entry_id < table.max_entries, \"Entry id too large\");\n\n char key_buffer[MAX_KEY_SIZE];\n char *key = 0;\n if (stream.get_bits(1)) {\n read_string_table_key(first_bit, stream, key_buffer, MAX_KEY_SIZE, key_history);\n\n key = key_buffer;\n\n \/\/ So technically we should only store the first 32 characters but I'm lazy.\n if (key_history.size() == KEY_HISTORY_SIZE) {\n key_history.erase(key_history.begin());\n }\n\n key_history.push_back(key);\n }\n\n char value_buffer[MAX_VALUE_SIZE];\n char *value = 0;\n size_t bit_length = 0;\n size_t length = 0;\n if (stream.get_bits(1)) {\n if (table.flags & ST_FixedLength) {\n length = table.user_data_size;\n bit_length = table.user_data_size_bits;\n } else {\n length = stream.get_bits(14);\n bit_length = 8 * length;\n }\n\n XASSERT(length < MAX_VALUE_SIZE, \"Message too long.\");\n\n stream.read_bits(value_buffer, bit_length);\n }\n\n if (entry_id < table.count()) {\n StringTableEntry &item = table.get(entry_id);\n\n if (key) {\n XASSERT(item.key == key, \"Entry's keys don't match.\");\n }\n\n if (value) {\n \/\/ This is kind of bad because if the server sends us a zero length string we'll consider\n \/\/ it to be uninitialized.\n XASSERT(item.value.size() == 0, \"String table already has this value\");\n item.value = std::string(value, length);\n }\n } else {\n XASSERT(key, \"Creating a new string table entry but no key specified.\");\n\n table.put(key, std::string(value_buffer, length));\n }\n\n ++entries_read;\n }\n}\n\nvoid handle_SVC_CreateStringTable(const CSVCMsg_CreateStringTable &table) {\n XASSERT(state, \"SVC_CreateStringTable but no state.\");\n\n StringTable &converted = state->create_string_table(table.name(),\n (size_t) table.max_entries(), table.flags(), table.user_data_fixed_size(),\n table.user_data_size(), table.user_data_size_bits());\n\n update_string_table(converted, table.num_entries(), table.string_data());\n}\n\nvoid handle_SVC_UpdateStringTable(const CSVCMsg_UpdateStringTable &update) {\n XASSERT(state, \"SVC_UpdateStringTable but no state.\");\n\n StringTable &table = state->get_string_table(update.table_id());\n\n update_string_table(table, update.num_changed_entries(), update.string_data());\n}\n\nvoid dump_DEM_Packet(const CDemoPacket &packet, Visitor& visitor) {\n const char *data = packet.data().c_str();\n size_t offset = 0;\n size_t length = packet.data().length();\n\n while (offset < length) {\n uint32_t command = read_var_int(data, length, &offset);\n uint32_t size = read_var_int(data, length, &offset);\n XASSERT(offset + size <= length, \"Reading data outside of packet.\");\n\n if (command == svc_ServerInfo) {\n CSVCMsg_ServerInfo info;\n info.ParseFromArray(&(data[offset]), size);\n\n dump_SVC_ServerInfo(info);\n } else if (command == svc_PacketEntities) {\n CSVCMsg_PacketEntities entities;\n entities.ParseFromArray(&(data[offset]), size);\n\n dump_SVC_PacketEntities(entities, visitor);\n } else if (command == svc_CreateStringTable) {\n CSVCMsg_CreateStringTable table;\n table.ParseFromArray(&(data[offset]), size);\n\n handle_SVC_CreateStringTable(table);\n } else if (command == svc_UpdateStringTable) {\n CSVCMsg_UpdateStringTable table;\n table.ParseFromArray(&(data[offset]), size);\n\n handle_SVC_UpdateStringTable(table);\n }\n\n offset += size;\n }\n}\n\nvoid dump(const char *file, Visitor& visitor) {\n Demo demo(file);\n\n for (int frame = 0; !demo.eof(); ++frame) {\n int tick = 0; \n size_t size;\n bool compressed;\n size_t uncompressed_size;\n\n EDemoCommands command = demo.get_message_type(&tick, &compressed);\n demo.read_message(compressed, &size, &uncompressed_size);\n\n visitor.visit_tick(tick);\n\n if (command == DEM_ClassInfo) {\n CDemoClassInfo info;\n info.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_ClassInfo(info);\n } else if (command == DEM_SendTables) {\n CDemoSendTables tables;\n tables.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_SendTables(tables);\n } else if (command == DEM_Packet || command == DEM_SignonPacket) {\n CDemoPacket packet;\n packet.ParseFromArray(demo.expose_buffer(), uncompressed_size);\n\n dump_DEM_Packet(packet, visitor);\n }\n }\n}\n\nint main(int argc, char **argv) {\n if (argc <= 1) {\n printf(\"Usage: %s something.dem\\n\", argv[0]);\n return 1;\n }\n\n DeathRecordingVisitor v;\n dump(argv[1], v);\n return 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <thread>\n#include <functional>\n#include <vector>\n#include <cstdint>\n#include <cstdio>\n#include <queue>\n#include <mutex>\n#include <string>\n#include <condition_variable>\n\nclass dispatch_queue\n{\n\ttypedef std::function<void(void)> fp_t;\n\n public:\n\tdispatch_queue(std::string name, size_t thread_cnt = 1);\n\t~dispatch_queue();\n\n\t\/\/ dispatch and copy\n\tvoid dispatch(const fp_t& op);\n\t\/\/ dispatch and move\n\tvoid dispatch(fp_t&& op);\n\n\t\/\/ Deleted operations\n\tdispatch_queue(const dispatch_queue& rhs) = delete;\n\tdispatch_queue& operator=(const dispatch_queue& rhs) = delete;\n\tdispatch_queue(dispatch_queue&& rhs) = delete;\n\tdispatch_queue& operator=(dispatch_queue&& rhs) = delete;\n\n private:\n\tstd::string name_;\n\tstd::mutex lock_;\n\tstd::vector<std::thread> threads_;\n\tstd::queue<fp_t> q_;\n\tstd::condition_variable cv_;\n\tbool quit_ = false;\n\n\tvoid dispatch_thread_handler(void);\n};\n\ndispatch_queue::dispatch_queue(std::string name, size_t thread_cnt) :\n\tname_{std::move(name)}, threads_(thread_cnt)\n{\n\tprintf(\"Creating dispatch queue: %s\\n\", name_.c_str());\n\tprintf(\"Dispatch threads: %zu\\n\", thread_cnt);\n\n\tfor(size_t i = 0; i < threads_.size(); i++)\n\t{\n\t\tthreads_[i] = std::thread(&dispatch_queue::dispatch_thread_handler, this);\n\t}\n}\n\ndispatch_queue::~dispatch_queue()\n{\n\tprintf(\"Destructor: Destroying dispatch threads...\\n\");\n\n\t\/\/ Signal to dispatch threads that it's time to wrap up\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tquit_ = true;\n\tlock.unlock();\n\tcv_.notify_all();\n\n\t\/\/ Wait for threads to finish before we exit\n\tfor(size_t i = 0; i < threads_.size(); i++)\n\t{\n\t\tif(threads_[i].joinable())\n\t\t{\n\t\t\tprintf(\"Destructor: Joining thread %zu until completion\\n\", i);\n\t\t\tthreads_[i].join();\n\t\t}\n\t}\n}\n\nvoid dispatch_queue::dispatch(const fp_t& op)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tq_.push(op);\n\n\t\/\/ Manual unlocking is done before notifying, to avoid waking up\n\t\/\/ the waiting thread only to block again (see notify_one for details)\n\tlock.unlock();\n\tcv_.notify_one();\n}\n\nvoid dispatch_queue::dispatch(fp_t&& op)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tq_.push(std::move(op));\n\n\t\/\/ Manual unlocking is done before notifying, to avoid waking up\n\t\/\/ the waiting thread only to block again (see notify_one for details)\n\tlock.unlock();\n\tcv_.notify_one();\n}\n\nvoid dispatch_queue::dispatch_thread_handler(void)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\n\tdo\n\t{\n\t\t\/\/ Wait until we have data or a quit signal\n\t\tcv_.wait(lock, [this] {\n\t\t\treturn (q_.size() || quit_);\n\t\t});\n\n\t\t\/\/ after wait, we own the lock\n\t\tif(!quit_ && q_.size())\n\t\t{\n\t\t\tauto op = std::move(q_.front());\n\t\t\tq_.pop();\n\n\t\t\t\/\/ unlock now that we're done messing with the queue\n\t\t\tlock.unlock();\n\n\t\t\top();\n\n\t\t\tlock.lock();\n\t\t}\n\t} while(!quit_);\n}\n\nint main(void)\n{\n\tint r = 0;\n\tdispatch_queue q(\"Phillip's Demo Dispatch Queue\", 4);\n\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 1!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 2!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 3!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 4!\\n\");\n\t});\n\n\treturn r;\n}\n<commit_msg>Simplify dispatch example by removing manual unlocks<commit_after>#include <thread>\n#include <functional>\n#include <vector>\n#include <cstdint>\n#include <cstdio>\n#include <queue>\n#include <mutex>\n#include <string>\n#include <condition_variable>\n\nclass dispatch_queue\n{\n\ttypedef std::function<void(void)> fp_t;\n\n public:\n\tdispatch_queue(std::string name, size_t thread_cnt = 1);\n\t~dispatch_queue();\n\n\t\/\/ dispatch and copy\n\tvoid dispatch(const fp_t& op);\n\t\/\/ dispatch and move\n\tvoid dispatch(fp_t&& op);\n\n\t\/\/ Deleted operations\n\tdispatch_queue(const dispatch_queue& rhs) = delete;\n\tdispatch_queue& operator=(const dispatch_queue& rhs) = delete;\n\tdispatch_queue(dispatch_queue&& rhs) = delete;\n\tdispatch_queue& operator=(dispatch_queue&& rhs) = delete;\n\n private:\n\tstd::string name_;\n\tstd::mutex lock_;\n\tstd::vector<std::thread> threads_;\n\tstd::queue<fp_t> q_;\n\tstd::condition_variable cv_;\n\tbool quit_ = false;\n\n\tvoid dispatch_thread_handler(void);\n};\n\ndispatch_queue::dispatch_queue(std::string name, size_t thread_cnt) :\n\tname_{std::move(name)}, threads_(thread_cnt)\n{\n\tprintf(\"Creating dispatch queue: %s\\n\", name_.c_str());\n\tprintf(\"Dispatch threads: %zu\\n\", thread_cnt);\n\n\tfor(size_t i = 0; i < threads_.size(); i++)\n\t{\n\t\tthreads_[i] = std::thread(&dispatch_queue::dispatch_thread_handler, this);\n\t}\n}\n\ndispatch_queue::~dispatch_queue()\n{\n\tprintf(\"Destructor: Destroying dispatch threads...\\n\");\n\n\t\/\/ Signal to dispatch threads that it's time to wrap up\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tquit_ = true;\n\tcv_.notify_all();\n\tlock.unlock();\n\n\t\/\/ Wait for threads to finish before we exit\n\tfor(size_t i = 0; i < threads_.size(); i++)\n\t{\n\t\tif(threads_[i].joinable())\n\t\t{\n\t\t\tprintf(\"Destructor: Joining thread %zu until completion\\n\", i);\n\t\t\tthreads_[i].join();\n\t\t}\n\t}\n}\n\nvoid dispatch_queue::dispatch(const fp_t& op)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tq_.push(op);\n\tcv_.notify_one();\n}\n\nvoid dispatch_queue::dispatch(fp_t&& op)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\tq_.push(std::move(op));\n\tcv_.notify_one();\n}\n\nvoid dispatch_queue::dispatch_thread_handler(void)\n{\n\tstd::unique_lock<std::mutex> lock(lock_);\n\n\tdo\n\t{\n\t\t\/\/ Wait until we have data or a quit signal\n\t\tcv_.wait(lock, [this] {\n\t\t\treturn (q_.size() || quit_);\n\t\t});\n\n\t\t\/\/ after wait, we own the lock\n\t\tif(!quit_ && q_.size())\n\t\t{\n\t\t\tauto op = std::move(q_.front());\n\t\t\tq_.pop();\n\n\t\t\t\/\/ unlock now that we're done messing with the queue\n\t\t\tlock.unlock();\n\n\t\t\top();\n\n\t\t\tlock.lock();\n\t\t}\n\t} while(!quit_);\n}\n\nint main(void)\n{\n\tint r = 0;\n\tdispatch_queue q(\"Phillip's Demo Dispatch Queue\", 4);\n\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 1!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 2!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 3!\\n\");\n\t});\n\tq.dispatch([] {\n\t\tprintf(\"Dispatch 4!\\n\");\n\t});\n\n\treturn r;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"VirtualMachine.h\"\n#include \"Machine.h\"\n#include <unistd.h>\n\nextern \"C\" TVMMainEntry VMLoadModule(const char *module);\nextern \"C\" void VMUnloadModule(void);\nvoid incrementTicks(void*);\n\nvolatile unsigned int ticks;\n\n\nTVMStatus VMStart(int tickms, int machinetickms, int argc, char *argv[])\n{\n ticks = 0;\n TVMMainEntry mainFunc = VMLoadModule(argv[0]);\n MachineInitialize(machinetickms);\n MachineRequestAlarm((tickms*1000), incrementTicks, NULL);\n MachineEnableSignals();\n if (mainFunc)\n {\n mainFunc(argc, argv);\n VMUnloadModule();\n return VM_STATUS_SUCCESS;\n }\n \n return VM_STATUS_FAILURE;\n} \/\/VMStart\n\n\nTVMStatus VMFileWrite(int filedescriptor, void *data, int *length)\n{\n if (!data || !length)\n {\n return VM_STATUS_ERROR_INVALID_PARAMETER;\n }\n\/\/ MachineFileWrite(filedescriptor, data, length, , );\n if(write(filedescriptor, data, *length))\n {\n return VM_STATUS_SUCCESS;\n }\n return VM_STATUS_FAILURE;\n} \/\/ VMFileWrite\n\n\nTVMStatus VMThreadSleep(TVMTick tick)\n{\n ticks = 0;\n if (tick == VM_TIMEOUT_IMMEDIATE)\n {\n \/\/ the current process yields the remainder of its processing quantum to the next ready process of equal priority.\n }\n else if (tick == VM_TIMEOUT_INFINITE)\n {\n return VM_STATUS_ERROR_INVALID_PARAMETER;\n }\n else\n {\n while (ticks < tick);\n \/\/this should not just be a blind wait loop; should probably pass run time to next thread. Update later.\n } \/\/does nothing while the number of ticks that have passed since entering this function is less than the number to sleep on\n\n return VM_STATUS_SUCCESS;\n}\n\n\nvoid incrementTicks(void*)\n{\n ticks += 1;\n}\/\/helper function for sleeping\n\n\n<commit_msg>VMFileOpen() written (incomplete)<commit_after>#include \"VirtualMachine.h\"\n#include \"Machine.h\"\n#include <unistd.h>\n\nextern \"C\" TVMMainEntry VMLoadModule(const char *module);\nextern \"C\" void VMUnloadModule(void);\nvoid incrementTicks(void*);\n\nvolatile unsigned int ticks;\n\n\nTVMStatus VMStart(int tickms, int machinetickms, int argc, char *argv[])\n{\n ticks = 0;\n TVMMainEntry mainFunc = VMLoadModule(argv[0]);\n MachineInitialize(machinetickms);\n MachineRequestAlarm((tickms*1000), incrementTicks, NULL);\n MachineEnableSignals();\n if (mainFunc)\n {\n mainFunc(argc, argv);\n VMUnloadModule();\n return VM_STATUS_SUCCESS;\n }\n \n return VM_STATUS_FAILURE;\n} \/\/VMStart\n\n\nTVMStatus VMFileOpen(const char *filename, int flags, int mode, int *filedescriptor)\n{\n if (filename == NULL || filedescriptor == NULL)\n {\n return VM_STATUS_ERROR_INVALID_PARAMETER;\n }\n \/\/change thread state to VM_THREAD_STATE_WAITING\n MachineFileOpen(filename, flags, mode, filedescriptor, NULL);\n \/\/ void MachineFileOpen(const char *filename, int flags, int mode, TMachineFileCallback callback, void *calldata);\n\n \/\/change thread state to VM_THREAD_STATE_READY\n return VM_STATUS_SUCCESS;\n\/\/ return VM_STATUS_FAILURE;\n} \/\/ VMFileOpen\n\n\nTVMStatus VMFileWrite(int filedescriptor, void *data, int *length)\n{\n if (!data || !length)\n {\n return VM_STATUS_ERROR_INVALID_PARAMETER;\n }\n\/\/ MachineFileWrite(filedescriptor, data, length, , );\n if(write(filedescriptor, data, *length))\n {\n return VM_STATUS_SUCCESS;\n }\n return VM_STATUS_FAILURE;\n} \/\/ VMFileWrite\n\n\nTVMStatus VMThreadSleep(TVMTick tick)\n{\n ticks = 0;\n if (tick == VM_TIMEOUT_IMMEDIATE)\n {\n \/\/ the current process yields the remainder of its processing quantum to the next ready process of equal priority.\n }\n else if (tick == VM_TIMEOUT_INFINITE)\n {\n return VM_STATUS_ERROR_INVALID_PARAMETER;\n }\n else\n {\n while (ticks < tick);\n \/\/this should not just be a blind wait loop; should probably pass run time to next thread. Update later.\n } \/\/does nothing while the number of ticks that have passed since entering this function is less than the number to sleep on\n\n return VM_STATUS_SUCCESS;\n}\n\n\n\n\nvoid incrementTicks(void*)\n{\n ticks += 1;\n}\/\/helper function for sleeping\n\n\n\n<|endoftext|>"} {"text":"<commit_before>#include \"MessagingController.h\"\n#include \"IqrfCdcChannel.h\"\n#include \"IqrfSpiChannel.h\"\n#include \"DpaHandler.h\"\n\n#include \"IClient.h\"\n\/\/TODO temporary here\n#include \"TestClient.h\"\n\n\/\/TODO temporary here\n#include \"IMessaging.h\"\n#include \"UdpMessaging.h\"\n#include \"MqMessaging.h\"\n#include \"MqttMessaging.h\"\n#include \"SchedulerMessaging.h\"\n\n#include \"SimpleSerializer.h\"\n#include \"JsonSerializer.h\"\n\n#include \"IqrfLogging.h\"\n#include \"PlatformDep.h\"\n\nvoid MessagingController::executeDpaTransaction(DpaTransaction& dpaTransaction)\n{\n m_dpaTransactionQueue->pushToQueue(&dpaTransaction);\n \/\/TODO wait here for something\n}\n\n\/\/called from task queue thread passed by lambda in task queue ctor\nvoid MessagingController::executeDpaTransactionFunc(DpaTransaction* dpaTransaction)\n{\n if (m_dpaHandler) {\n try {\n m_dpaHandler->ExecuteDpaTransaction(*dpaTransaction);\n }\n catch (std::exception& e) {\n CATCH_EX(\"Error in ExecuteDpaTransaction: \", std::exception, e);\n dpaTransaction->processFinish(DpaRequest::kCreated);\n }\n }\n else {\n TRC_ERR(\"Dpa interface is not working\");\n dpaTransaction->processFinish(DpaRequest::kCreated);\n }\n}\n\nvoid MessagingController::registerAsyncDpaMessageHandler(std::function<void(const DpaMessage&)> asyncHandler)\n{\n m_asyncHandler = asyncHandler;\n m_dpaHandler->RegisterAsyncMessageHandler([&](const DpaMessage& dpaMessage) {\n m_asyncHandler(dpaMessage);\n });\n}\n\nMessagingController::MessagingController(const std::string& iqrfPortName)\n :m_iqrfInterface(nullptr)\n ,m_dpaHandler(nullptr)\n ,m_dpaTransactionQueue(nullptr)\n ,m_iqrfPortName(iqrfPortName)\n ,m_scheduler(nullptr)\n{\n}\n\nMessagingController::~MessagingController ()\n{\n}\n\nstd::set<IMessaging*>& MessagingController::getSetOfMessaging()\n{\n return m_protocols;\n}\n\nvoid MessagingController::registerMessaging(IMessaging& messaging)\n{\n m_protocols.insert(&messaging);\n}\n\nvoid MessagingController::unregisterMessaging(IMessaging& messaging)\n{\n m_protocols.erase(&messaging);\n}\n\nvoid MessagingController::watchDog()\n{\n TRC_ENTER(\"\");\n m_running = true;\n try {\n start();\n \/\/TODO wait on condition until 3000\n while (m_running)\n {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n \/\/TODO\n \/\/watch worker threads and possibly restart\n }\n }\n catch (std::exception& e) {\n CATCH_EX(\"error\", std::exception, e);\n }\n\n stop();\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::startClients()\n{\n TRC_ENTER(\"\");\n\n \n \/\/\/\/\/\/\/\/\/ Messagings \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load Messagings plugins\n MqttMessaging* mqttMessaging = ant_new MqttMessaging();\n m_messagings.push_back(mqttMessaging);\n\n MqMessaging* mqMessaging = ant_new MqMessaging();\n m_messagings.push_back(mqMessaging);\n\n \/\/\/\/\/\/\/\/\/ Serializers \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load Serializers plugins\n DpaTaskSimpleSerializerFactory* simpleSerializer = ant_new DpaTaskSimpleSerializerFactory();\n m_serializers.push_back(simpleSerializer);\n\n DpaTaskJsonSerializerFactory* jsonSerializer = ant_new DpaTaskJsonSerializerFactory();\n m_serializers.push_back(jsonSerializer);\n\n \/\/\/\/\/\/\/\/ Clients \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load clients plugins\n IClient* client1 = ant_new TestClient(\"TestClient1\");\n client1->setDaemon(this);\n client1->setMessaging(mqttMessaging);\n client1->setSerializer(simpleSerializer);\n m_clients.insert(std::make_pair(client1->getClientName(), client1));\n \n IClient* client2 = ant_new TestClient(\"TestClient2\");\n client2->setDaemon(this);\n client2->setMessaging(mqttMessaging);\n client2->setSerializer(jsonSerializer);\n m_clients.insert(std::make_pair(client2->getClientName(), client2));\n\n IClient* clientIqrfapp = ant_new TestClient(\"TestClientIqrfapp\");\n clientIqrfapp->setDaemon(this);\n clientIqrfapp->setMessaging(mqMessaging);\n clientIqrfapp->setSerializer(simpleSerializer);\n m_clients.insert(std::make_pair(clientIqrfapp->getClientName(), clientIqrfapp));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (auto cli : m_clients) {\n cli.second->start();\n }\n\n for (auto ms : m_messagings) {\n ms->start();\n }\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::stopClients()\n{\n TRC_ENTER(\"\");\n for (auto cli : m_clients) {\n cli.second->stop();\n delete cli.second;\n }\n m_clients.clear();\n\n for (auto ms : m_messagings) {\n ms->stop();\n delete ms;\n }\n m_messagings.clear();\n\n for (auto sr : m_serializers) {\n delete sr;\n }\n m_serializers.clear();\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::start()\n{\n TRC_ENTER(\"\");\n\n try {\n size_t found = m_iqrfPortName.find(\"spi\");\n if (found != std::string::npos)\n m_iqrfInterface = ant_new IqrfSpiChannel(m_iqrfPortName);\n else\n m_iqrfInterface = ant_new IqrfCdcChannel(m_iqrfPortName);\n\n m_dpaHandler = ant_new DpaHandler(m_iqrfInterface);\n\n m_dpaHandler->Timeout(100); \/\/ Default timeout is infinite\n }\n catch (std::exception& ae) {\n TRC_ERR(\"There was an error during DPA handler creation: \" << ae.what());\n }\n\n m_dpaTransactionQueue = ant_new TaskQueue<DpaTransaction*>([&](DpaTransaction* trans) {\n executeDpaTransactionFunc(trans);\n });\n\n m_scheduler = ant_new SchedulerMessaging();\n\n startClients();\n\n m_scheduler->start();\n\n TRC_INF(\"daemon started\");\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::stop()\n{\n TRC_ENTER(\"\");\n TRC_INF(\"daemon stops\");\n \n m_scheduler->stop();\n\n stopClients();\n\n delete m_scheduler;\n\n \/\/TODO unregister call-backs first ?\n delete m_iqrfInterface;\n delete m_dpaTransactionQueue;\n delete m_dpaHandler;\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::exit()\n{\n TRC_INF(\"exiting ...\");\n m_running = false;\n}\n<commit_msg>Reactivated UDP<commit_after>#include \"MessagingController.h\"\n#include \"IqrfCdcChannel.h\"\n#include \"IqrfSpiChannel.h\"\n#include \"DpaHandler.h\"\n\n#include \"IClient.h\"\n\/\/TODO temporary here\n#include \"TestClient.h\"\n\n\/\/TODO temporary here\n#include \"IMessaging.h\"\n#include \"UdpMessaging.h\"\n#include \"MqMessaging.h\"\n#include \"MqttMessaging.h\"\n#include \"SchedulerMessaging.h\"\n\n#include \"SimpleSerializer.h\"\n#include \"JsonSerializer.h\"\n\n#include \"IqrfLogging.h\"\n#include \"PlatformDep.h\"\n\nvoid MessagingController::executeDpaTransaction(DpaTransaction& dpaTransaction)\n{\n m_dpaTransactionQueue->pushToQueue(&dpaTransaction);\n \/\/TODO wait here for something\n}\n\n\/\/called from task queue thread passed by lambda in task queue ctor\nvoid MessagingController::executeDpaTransactionFunc(DpaTransaction* dpaTransaction)\n{\n if (m_dpaHandler) {\n try {\n m_dpaHandler->ExecuteDpaTransaction(*dpaTransaction);\n }\n catch (std::exception& e) {\n CATCH_EX(\"Error in ExecuteDpaTransaction: \", std::exception, e);\n dpaTransaction->processFinish(DpaRequest::kCreated);\n }\n }\n else {\n TRC_ERR(\"Dpa interface is not working\");\n dpaTransaction->processFinish(DpaRequest::kCreated);\n }\n}\n\nvoid MessagingController::registerAsyncDpaMessageHandler(std::function<void(const DpaMessage&)> asyncHandler)\n{\n m_asyncHandler = asyncHandler;\n m_dpaHandler->RegisterAsyncMessageHandler([&](const DpaMessage& dpaMessage) {\n m_asyncHandler(dpaMessage);\n });\n}\n\nMessagingController::MessagingController(const std::string& iqrfPortName)\n :m_iqrfInterface(nullptr)\n ,m_dpaHandler(nullptr)\n ,m_dpaTransactionQueue(nullptr)\n ,m_iqrfPortName(iqrfPortName)\n ,m_scheduler(nullptr)\n{\n}\n\nMessagingController::~MessagingController ()\n{\n}\n\nstd::set<IMessaging*>& MessagingController::getSetOfMessaging()\n{\n return m_protocols;\n}\n\nvoid MessagingController::registerMessaging(IMessaging& messaging)\n{\n m_protocols.insert(&messaging);\n}\n\nvoid MessagingController::unregisterMessaging(IMessaging& messaging)\n{\n m_protocols.erase(&messaging);\n}\n\nvoid MessagingController::watchDog()\n{\n TRC_ENTER(\"\");\n m_running = true;\n try {\n start();\n \/\/TODO wait on condition until 3000\n while (m_running)\n {\n std::this_thread::sleep_for(std::chrono::milliseconds(1000));\n \/\/TODO\n \/\/watch worker threads and possibly restart\n }\n }\n catch (std::exception& e) {\n CATCH_EX(\"error\", std::exception, e);\n }\n\n stop();\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::startClients()\n{\n TRC_ENTER(\"\");\n\n \n \/\/\/\/\/\/\/\/\/ Messagings \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load Messagings plugins\n MqttMessaging* mqttMessaging = ant_new MqttMessaging();\n m_messagings.push_back(mqttMessaging);\n\n MqMessaging* mqMessaging = ant_new MqMessaging();\n m_messagings.push_back(mqMessaging);\n\n UdpMessaging* udpMessaging = ant_new UdpMessaging();\n udpMessaging->setDaemon(this);\n m_messagings.push_back(udpMessaging);\n\n \/\/\/\/\/\/\/\/\/ Serializers \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load Serializers plugins\n DpaTaskSimpleSerializerFactory* simpleSerializer = ant_new DpaTaskSimpleSerializerFactory();\n m_serializers.push_back(simpleSerializer);\n\n DpaTaskJsonSerializerFactory* jsonSerializer = ant_new DpaTaskJsonSerializerFactory();\n m_serializers.push_back(jsonSerializer);\n\n \/\/\/\/\/\/\/\/ Clients \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n \/\/TODO load clients plugins\n IClient* client1 = ant_new TestClient(\"TestClient1\");\n client1->setDaemon(this);\n client1->setMessaging(mqttMessaging);\n client1->setSerializer(simpleSerializer);\n m_clients.insert(std::make_pair(client1->getClientName(), client1));\n \n IClient* client2 = ant_new TestClient(\"TestClient2\");\n client2->setDaemon(this);\n client2->setMessaging(mqttMessaging);\n client2->setSerializer(jsonSerializer);\n m_clients.insert(std::make_pair(client2->getClientName(), client2));\n\n IClient* clientIqrfapp = ant_new TestClient(\"TestClientIqrfapp\");\n clientIqrfapp->setDaemon(this);\n clientIqrfapp->setMessaging(mqMessaging);\n clientIqrfapp->setSerializer(simpleSerializer);\n m_clients.insert(std::make_pair(clientIqrfapp->getClientName(), clientIqrfapp));\n\n \/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n for (auto cli : m_clients) {\n cli.second->start();\n }\n\n for (auto ms : m_messagings) {\n ms->start();\n }\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::stopClients()\n{\n TRC_ENTER(\"\");\n for (auto cli : m_clients) {\n cli.second->stop();\n delete cli.second;\n }\n m_clients.clear();\n\n for (auto ms : m_messagings) {\n ms->stop();\n delete ms;\n }\n m_messagings.clear();\n\n for (auto sr : m_serializers) {\n delete sr;\n }\n m_serializers.clear();\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::start()\n{\n TRC_ENTER(\"\");\n\n try {\n size_t found = m_iqrfPortName.find(\"spi\");\n if (found != std::string::npos)\n m_iqrfInterface = ant_new IqrfSpiChannel(m_iqrfPortName);\n else\n m_iqrfInterface = ant_new IqrfCdcChannel(m_iqrfPortName);\n\n m_dpaHandler = ant_new DpaHandler(m_iqrfInterface);\n\n m_dpaHandler->Timeout(100); \/\/ Default timeout is infinite\n }\n catch (std::exception& ae) {\n TRC_ERR(\"There was an error during DPA handler creation: \" << ae.what());\n }\n\n m_dpaTransactionQueue = ant_new TaskQueue<DpaTransaction*>([&](DpaTransaction* trans) {\n executeDpaTransactionFunc(trans);\n });\n\n m_scheduler = ant_new SchedulerMessaging();\n\n startClients();\n\n m_scheduler->start();\n\n TRC_INF(\"daemon started\");\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::stop()\n{\n TRC_ENTER(\"\");\n TRC_INF(\"daemon stops\");\n \n m_scheduler->stop();\n\n stopClients();\n\n delete m_scheduler;\n\n \/\/TODO unregister call-backs first ?\n delete m_iqrfInterface;\n delete m_dpaTransactionQueue;\n delete m_dpaHandler;\n\n TRC_LEAVE(\"\");\n}\n\nvoid MessagingController::exit()\n{\n TRC_INF(\"exiting ...\");\n m_running = false;\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/TypeBuilder.h\"\n\nusing namespace llvm;\n\nnamespace {\n\tstruct PointerObservation : public FunctionPass {\n\t\tstatic char ID;\n\t\tPointerObservation() : FunctionPass(ID) {}\n\n\t\tbool runOnFunction(Function& f) override {\n\n \/\/ Identify injection points\nDenseSet<Instruction*> pointerInstructions;\nfor(BasicBlock &bb : f) {\n \tfor(Instruction &i : bb) {\n \t\tif (GetElementPtrInst* gep = dyn_cast<GetElementPtrInst>(&i)) {\n pointerInstructions.insert(gep);\n \t\t}\n \t}\n}\n\n \/\/ Inject instructions\n for (Instruction *i : pointerInstructions) {\n errs() << \"Injections print operation\\n\";\n IRBuilder<> builder(i);\n Function *printfFunction = getPrintFPrototype(i->getContext(), i->getModule());\n\n builder.CreateCall(printfFunction, geti8StrVal(*i->getModule(), \"test\\n\", \"name\"));\n }\n\n\t\t\treturn true;\n\t\t}\n\n Function *getPrintFPrototype(LLVMContext &ctx, Module *mod) {\n FunctionType *printf_type = TypeBuilder<int(char*, ...), false>::get(getGlobalContext());\n Function *func = cast<Function>(mod->getOrInsertFunction(\"printf\", printf_type, AttributeSet().addAttribute(mod->getContext(), 1U, Attribute::NoAlias)));\n return func;\n }\n\n Constant* geti8StrVal(Module& M, char const* str, Twine const& name) {\n LLVMContext& ctx = getGlobalContext();\n Constant* strConstant = ConstantDataArray::getString(ctx, str);\n GlobalVariable* GVStr =\n new GlobalVariable(M, strConstant->getType(), true,\n GlobalValue::InternalLinkage, strConstant, name);\n Constant* zero = Constant::getNullValue(IntegerType::getInt32Ty(ctx));\n Constant* indices[] = {zero, zero};\n Constant* strVal = ConstantExpr::getGetElementPtr(Type::getInt8PtrTy(ctx), GVStr, indices, true);\n return strVal;\n }\n\n\t};\n\n}\n\nchar PointerObservation::ID = 0;\nstatic RegisterPass<PointerObservation> X(\"PointerObservation\", \"Injects print calls before pointer operations\", false, false);<commit_msg>Strange formatting error<commit_after>#include \"llvm\/Pass.h\"\n#include \"llvm\/IR\/Instructions.h\"\n#include \"llvm\/IR\/Module.h\"\n#include \"llvm\/IR\/Function.h\"\n#include \"llvm\/Support\/raw_ostream.h\"\n#include \"llvm\/ADT\/DenseSet.h\"\n#include \"llvm\/IR\/IRBuilder.h\"\n#include \"llvm\/IR\/TypeBuilder.h\"\n\nusing namespace llvm;\n\nnamespace {\n\tstruct PointerObservation : public FunctionPass {\n\t\tstatic char ID;\n\t\tPointerObservation() : FunctionPass(ID) {}\n\n\t\tbool runOnFunction(Function& f) override {\n\n \/\/ Identify injection points\n DenseSet<Instruction*> pointerInstructions;\n for(BasicBlock &bb : f) {\n \tfor(Instruction &i : bb) {\n \t\tif (GetElementPtrInst* gep = dyn_cast<GetElementPtrInst>(&i)) {\n pointerInstructions.insert(gep);\n \t\t}\n \t}\n }\n\n \/\/ Inject instructions\n for (Instruction *i : pointerInstructions) {\n errs() << \"Injections print operation\\n\";\n IRBuilder<> builder(i);\n Function *printfFunction = getPrintFPrototype(i->getContext(), i->getModule());\n\n builder.CreateCall(printfFunction, geti8StrVal(*i->getModule(), \"test\\n\", \"name\"));\n }\n\n\t\t\treturn true;\n\t\t}\n\n Function *getPrintFPrototype(LLVMContext &ctx, Module *mod) {\n FunctionType *printf_type = TypeBuilder<int(char*, ...), false>::get(getGlobalContext());\n Function *func = cast<Function>(mod->getOrInsertFunction(\"printf\", printf_type, AttributeSet().addAttribute(mod->getContext(), 1U, Attribute::NoAlias)));\n return func;\n }\n\n Constant* geti8StrVal(Module& M, char const* str, Twine const& name) {\n LLVMContext& ctx = getGlobalContext();\n Constant* strConstant = ConstantDataArray::getString(ctx, str);\n GlobalVariable* GVStr =\n new GlobalVariable(M, strConstant->getType(), true,\n GlobalValue::InternalLinkage, strConstant, name);\n Constant* zero = Constant::getNullValue(IntegerType::getInt32Ty(ctx));\n Constant* indices[] = {zero, zero};\n Constant* strVal = ConstantExpr::getGetElementPtr(Type::getInt8PtrTy(ctx), GVStr, indices, true);\n return strVal;\n }\n\n\t};\n\n}\n\nchar PointerObservation::ID = 0;\nstatic RegisterPass<PointerObservation> X(\"PointerObservation\", \"Injects print calls before pointer operations\", false, false);<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: sharedunocomponent.cxx,v $\n *\n * $Revision: 1.6 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 01:27:51 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_unotools.hxx\"\n\n#ifndef UNOTOOLS_INC_SHAREDUNOCOMPONENT_HXX\n#include <unotools\/sharedunocomponent.hxx>\n#endif\n\n#ifndef _COM_SUN_STAR_LANG_XCOMPONENT_HPP_\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#endif\n#ifndef _COM_SUN_STAR_UTIL_XCLOSEABLE_HPP_\n#include <com\/sun\/star\/util\/XCloseable.hpp>\n#endif\n\n#ifndef _CPPUHELPER_IMPLBASE1_HXX_\n#include <cppuhelper\/implbase1.hxx>\n#endif\n\n#ifndef _TOOLS_DEBUG_HXX\n#include <tools\/debug.hxx>\n#endif\n\n\/\/............................................................................\nnamespace utl\n{\n\/\/............................................................................\n\n using ::com::sun::star::uno::XInterface;\n using ::com::sun::star::uno::Reference;\n using ::com::sun::star::uno::Exception;\n using ::com::sun::star::uno::UNO_QUERY;\n using ::com::sun::star::uno::RuntimeException;\n using ::com::sun::star::lang::XComponent;\n using ::com::sun::star::lang::EventObject;\n using ::com::sun::star::util::XCloseable;\n using ::com::sun::star::util::XCloseListener;\n using ::com::sun::star::util::CloseVetoException;\n\n \/\/========================================================================\n \/\/= DisposableComponent\n \/\/========================================================================\n \/\/------------------------------------------------------------------------\n DisposableComponent::DisposableComponent( const Reference< XInterface >& _rxComponent )\n :m_xComponent( _rxComponent, UNO_QUERY )\n {\n DBG_ASSERT( m_xComponent.is() || !_rxComponent.is(), \"DisposableComponent::DisposableComponent: should be an XComponent!\" );\n }\n\n \/\/------------------------------------------------------------------------\n DisposableComponent::~DisposableComponent()\n {\n if ( m_xComponent.is() )\n {\n try\n {\n m_xComponent->dispose();\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"DisposableComponent::~DisposableComponent: caught an exception!\" );\n }\n m_xComponent.clear();\n }\n }\n\n \/\/========================================================================\n \/\/= CloseableComponentImpl\n \/\/========================================================================\n DBG_NAME( CloseableComponentImpl )\n typedef ::cppu::WeakImplHelper1 < XCloseListener\n > CloseableComponentImpl_Base;\n class CloseableComponentImpl : public CloseableComponentImpl_Base\n {\n private:\n Reference< XCloseable > m_xCloseable;\n\n public:\n CloseableComponentImpl( const Reference< XInterface >& _rxComponent );\n\n \/** closes the component\n\n @nofail\n *\/\n void nf_closeComponent();\n\n protected:\n virtual ~CloseableComponentImpl();\n\n \/\/ XCloseListener overridables\n virtual void SAL_CALL queryClosing( const EventObject& Source, ::sal_Bool GetsOwnership ) throw (CloseVetoException, RuntimeException);\n virtual void SAL_CALL notifyClosing( const EventObject& Source ) throw (RuntimeException);\n\n \/\/ XEventListener overridables\n virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n\n private:\n \/** starts or stops being a CloseListener at the component\n\n Only to be called upon construction of the instance, or when the component\n is to be closed.\n\n @nofail\n *\/\n void impl_nf_switchListening( bool _bListen );\n\n\n private:\n CloseableComponentImpl(); \/\/ never implemented\n CloseableComponentImpl( const CloseableComponentImpl& ); \/\/ never implemented\n CloseableComponentImpl& operator=( const CloseableComponentImpl& ); \/\/ never implemented\n };\n\n \/\/------------------------------------------------------------------------\n CloseableComponentImpl::CloseableComponentImpl( const Reference< XInterface >& _rxComponent )\n :m_xCloseable( _rxComponent, UNO_QUERY )\n {\n DBG_CTOR( CloseableComponentImpl, NULL );\n DBG_ASSERT( m_xCloseable.is() || !_rxComponent.is(), \"CloseableComponentImpl::CloseableComponentImpl: component is not an XCloseable!\" );\n impl_nf_switchListening( true );\n }\n \/\/------------------------------------------------------------------------\n CloseableComponentImpl::~CloseableComponentImpl()\n {\n nf_closeComponent();\n DBG_DTOR( CloseableComponentImpl, NULL );\n }\n\n \/\/------------------------------------------------------------------------\n void CloseableComponentImpl::nf_closeComponent()\n {\n if ( !m_xCloseable.is() )\n \/\/ nothing to do\n return;\n\n \/\/ stop listening\n impl_nf_switchListening( false );\n\n \/\/ close\n try\n {\n m_xCloseable->close( sal_True );\n }\n catch( const CloseVetoException& ) { \/* fine *\/ }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"CloseableComponentImpl::nf_closeComponent: caught an unexpected exception!\" );\n }\n\n \/\/ reset\n m_xCloseable.clear();\n }\n\n \/\/------------------------------------------------------------------------\n void CloseableComponentImpl::impl_nf_switchListening( bool _bListen )\n {\n if ( !m_xCloseable.is() )\n return;\n\n try\n {\n if ( _bListen )\n m_xCloseable->addCloseListener( this );\n else\n m_xCloseable->removeCloseListener( this );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"CloseableComponentImpl::impl_nf_switchListening: caught an exception!\" );\n }\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::queryClosing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n , ::sal_Bool \/*GetsOwnership*\/ ) throw (CloseVetoException, RuntimeException)\n {\n \/\/ as long as we live, somebody wants to keep the object alive. So, veto the\n \/\/ closing\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::queryClosing: where did this come from?\" );\n throw CloseVetoException();\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::notifyClosing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n ) throw (RuntimeException)\n {\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::notifyClosing: where did this come from?\" );\n\n \/\/ this should be unreachable: As long as we're a CloseListener, we veto the closing. If we're going\n \/\/ to close the component ourself, then we revoke ourself as listener *before* the close call. So,\n \/\/ if this here fires, something went definately wrong.\n DBG_ERROR( \"CloseableComponentImpl::notifyClosing: unreachable!\" );\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::disposing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n ) throw (RuntimeException)\n {\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::disposing: where did this come from?\" );\n DBG_ERROR( \"CloseableComponentImpl::disposing: unreachable!\" );\n \/\/ same reasoning for this assertion as in ->notifyClosing\n }\n\n \/\/========================================================================\n \/\/= CloseableComponentImpl\n \/\/========================================================================\n DBG_NAME( CloseableComponent )\n \/\/------------------------------------------------------------------------\n CloseableComponent::CloseableComponent( const Reference< XInterface >& _rxComponent )\n :m_pImpl( new CloseableComponentImpl( _rxComponent ) )\n {\n DBG_CTOR( CloseableComponent, NULL );\n }\n\n \/\/------------------------------------------------------------------------\n CloseableComponent::~CloseableComponent()\n {\n \/\/ close the component, deliver ownership to anybody who wants to veto the close\n m_pImpl->nf_closeComponent();\n DBG_DTOR( CloseableComponent, NULL );\n }\n\n\/\/............................................................................\n} \/\/ namespace utl\n\/\/............................................................................\n<commit_msg>INTEGRATION: CWS changefileheader (1.6.84); FILE MERGED 2008\/04\/01 16:03:33 thb 1.6.84.3: #i85898# Stripping all external header guards 2008\/04\/01 12:59:55 thb 1.6.84.2: #i85898# Stripping all external header guards 2008\/03\/31 13:03:40 rt 1.6.84.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: sharedunocomponent.cxx,v $\n * $Revision: 1.7 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_unotools.hxx\"\n#include <unotools\/sharedunocomponent.hxx>\n#include <com\/sun\/star\/lang\/XComponent.hpp>\n#include <com\/sun\/star\/util\/XCloseable.hpp>\n#include <cppuhelper\/implbase1.hxx>\n#include <tools\/debug.hxx>\n\n\/\/............................................................................\nnamespace utl\n{\n\/\/............................................................................\n\n using ::com::sun::star::uno::XInterface;\n using ::com::sun::star::uno::Reference;\n using ::com::sun::star::uno::Exception;\n using ::com::sun::star::uno::UNO_QUERY;\n using ::com::sun::star::uno::RuntimeException;\n using ::com::sun::star::lang::XComponent;\n using ::com::sun::star::lang::EventObject;\n using ::com::sun::star::util::XCloseable;\n using ::com::sun::star::util::XCloseListener;\n using ::com::sun::star::util::CloseVetoException;\n\n \/\/========================================================================\n \/\/= DisposableComponent\n \/\/========================================================================\n \/\/------------------------------------------------------------------------\n DisposableComponent::DisposableComponent( const Reference< XInterface >& _rxComponent )\n :m_xComponent( _rxComponent, UNO_QUERY )\n {\n DBG_ASSERT( m_xComponent.is() || !_rxComponent.is(), \"DisposableComponent::DisposableComponent: should be an XComponent!\" );\n }\n\n \/\/------------------------------------------------------------------------\n DisposableComponent::~DisposableComponent()\n {\n if ( m_xComponent.is() )\n {\n try\n {\n m_xComponent->dispose();\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"DisposableComponent::~DisposableComponent: caught an exception!\" );\n }\n m_xComponent.clear();\n }\n }\n\n \/\/========================================================================\n \/\/= CloseableComponentImpl\n \/\/========================================================================\n DBG_NAME( CloseableComponentImpl )\n typedef ::cppu::WeakImplHelper1 < XCloseListener\n > CloseableComponentImpl_Base;\n class CloseableComponentImpl : public CloseableComponentImpl_Base\n {\n private:\n Reference< XCloseable > m_xCloseable;\n\n public:\n CloseableComponentImpl( const Reference< XInterface >& _rxComponent );\n\n \/** closes the component\n\n @nofail\n *\/\n void nf_closeComponent();\n\n protected:\n virtual ~CloseableComponentImpl();\n\n \/\/ XCloseListener overridables\n virtual void SAL_CALL queryClosing( const EventObject& Source, ::sal_Bool GetsOwnership ) throw (CloseVetoException, RuntimeException);\n virtual void SAL_CALL notifyClosing( const EventObject& Source ) throw (RuntimeException);\n\n \/\/ XEventListener overridables\n virtual void SAL_CALL disposing( const ::com::sun::star::lang::EventObject& Source ) throw (::com::sun::star::uno::RuntimeException);\n\n private:\n \/** starts or stops being a CloseListener at the component\n\n Only to be called upon construction of the instance, or when the component\n is to be closed.\n\n @nofail\n *\/\n void impl_nf_switchListening( bool _bListen );\n\n\n private:\n CloseableComponentImpl(); \/\/ never implemented\n CloseableComponentImpl( const CloseableComponentImpl& ); \/\/ never implemented\n CloseableComponentImpl& operator=( const CloseableComponentImpl& ); \/\/ never implemented\n };\n\n \/\/------------------------------------------------------------------------\n CloseableComponentImpl::CloseableComponentImpl( const Reference< XInterface >& _rxComponent )\n :m_xCloseable( _rxComponent, UNO_QUERY )\n {\n DBG_CTOR( CloseableComponentImpl, NULL );\n DBG_ASSERT( m_xCloseable.is() || !_rxComponent.is(), \"CloseableComponentImpl::CloseableComponentImpl: component is not an XCloseable!\" );\n impl_nf_switchListening( true );\n }\n \/\/------------------------------------------------------------------------\n CloseableComponentImpl::~CloseableComponentImpl()\n {\n nf_closeComponent();\n DBG_DTOR( CloseableComponentImpl, NULL );\n }\n\n \/\/------------------------------------------------------------------------\n void CloseableComponentImpl::nf_closeComponent()\n {\n if ( !m_xCloseable.is() )\n \/\/ nothing to do\n return;\n\n \/\/ stop listening\n impl_nf_switchListening( false );\n\n \/\/ close\n try\n {\n m_xCloseable->close( sal_True );\n }\n catch( const CloseVetoException& ) { \/* fine *\/ }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"CloseableComponentImpl::nf_closeComponent: caught an unexpected exception!\" );\n }\n\n \/\/ reset\n m_xCloseable.clear();\n }\n\n \/\/------------------------------------------------------------------------\n void CloseableComponentImpl::impl_nf_switchListening( bool _bListen )\n {\n if ( !m_xCloseable.is() )\n return;\n\n try\n {\n if ( _bListen )\n m_xCloseable->addCloseListener( this );\n else\n m_xCloseable->removeCloseListener( this );\n }\n catch( const Exception& )\n {\n OSL_ENSURE( sal_False, \"CloseableComponentImpl::impl_nf_switchListening: caught an exception!\" );\n }\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::queryClosing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n , ::sal_Bool \/*GetsOwnership*\/ ) throw (CloseVetoException, RuntimeException)\n {\n \/\/ as long as we live, somebody wants to keep the object alive. So, veto the\n \/\/ closing\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::queryClosing: where did this come from?\" );\n throw CloseVetoException();\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::notifyClosing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n ) throw (RuntimeException)\n {\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::notifyClosing: where did this come from?\" );\n\n \/\/ this should be unreachable: As long as we're a CloseListener, we veto the closing. If we're going\n \/\/ to close the component ourself, then we revoke ourself as listener *before* the close call. So,\n \/\/ if this here fires, something went definately wrong.\n DBG_ERROR( \"CloseableComponentImpl::notifyClosing: unreachable!\" );\n }\n\n \/\/--------------------------------------------------------------------\n void SAL_CALL CloseableComponentImpl::disposing( const EventObject&\n #ifdef DBG_UTIL\n Source\n #endif\n ) throw (RuntimeException)\n {\n DBG_ASSERT( Source.Source == m_xCloseable, \"CloseableComponentImpl::disposing: where did this come from?\" );\n DBG_ERROR( \"CloseableComponentImpl::disposing: unreachable!\" );\n \/\/ same reasoning for this assertion as in ->notifyClosing\n }\n\n \/\/========================================================================\n \/\/= CloseableComponentImpl\n \/\/========================================================================\n DBG_NAME( CloseableComponent )\n \/\/------------------------------------------------------------------------\n CloseableComponent::CloseableComponent( const Reference< XInterface >& _rxComponent )\n :m_pImpl( new CloseableComponentImpl( _rxComponent ) )\n {\n DBG_CTOR( CloseableComponent, NULL );\n }\n\n \/\/------------------------------------------------------------------------\n CloseableComponent::~CloseableComponent()\n {\n \/\/ close the component, deliver ownership to anybody who wants to veto the close\n m_pImpl->nf_closeComponent();\n DBG_DTOR( CloseableComponent, NULL );\n }\n\n\/\/............................................................................\n} \/\/ namespace utl\n\/\/............................................................................\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ HttpAlternateProtocols is an in-memory data structure used for keeping track\n\/\/ of which HTTP HostPortPairs have an alternate protocol that can be used\n\/\/ instead of HTTP on a different port.\n\n#include \"net\/http\/http_alternate_protocols.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace net {\nnamespace {\n\nTEST(HttpAlternateProtocols, Basic) {\n HttpAlternateProtocols alternate_protocols;\n HostPortPair test_host_port_pair;\n test_host_port_pair.host = \"foo\";\n test_host_port_pair.port = 80;\n EXPECT_FALSE(\n alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n alternate_protocols.SetAlternateProtocolFor(\n test_host_port_pair, 443, HttpAlternateProtocols::NPN_SPDY_1);\n ASSERT_TRUE(alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n const HttpAlternateProtocols::PortProtocolPair alternate =\n alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(443, alternate.port);\n EXPECT_EQ(HttpAlternateProtocols::NPN_SPDY_1, alternate.protocol);\n}\n\nTEST(HttpAlternateProtocols, SetBroken) {\n HttpAlternateProtocols alternate_protocols;\n HostPortPair test_host_port_pair;\n test_host_port_pair.host = \"foo\";\n test_host_port_pair.port = 80;\n alternate_protocols.MarkBrokenAlternateProtocolFor(test_host_port_pair);\n ASSERT_TRUE(alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n HttpAlternateProtocols::PortProtocolPair alternate =\n alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(HttpAlternateProtocols::BROKEN, alternate.protocol);\n\n alternate_protocols.SetAlternateProtocolFor(\n test_host_port_pair,\n 1234,\n HttpAlternateProtocols::NPN_SPDY_1),\n alternate = alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(HttpAlternateProtocols::BROKEN, alternate.protocol)\n << \"Second attempt should be ignored.\";\n}\n\n} \/\/ namespace\n} \/\/ namespace net\n<commit_msg>Fix HttpAlternateProtocols unit test.<commit_after>\/\/ Copyright (c) 2010 The Chromium Authors. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\/\/\n\/\/ HttpAlternateProtocols is an in-memory data structure used for keeping track\n\/\/ of which HTTP HostPortPairs have an alternate protocol that can be used\n\/\/ instead of HTTP on a different port.\n\n#include \"net\/http\/http_alternate_protocols.h\"\n#include \"testing\/gtest\/include\/gtest\/gtest.h\"\n\nnamespace net {\nnamespace {\n\nTEST(HttpAlternateProtocols, Basic) {\n HttpAlternateProtocols alternate_protocols;\n HostPortPair test_host_port_pair;\n test_host_port_pair.host = \"foo\";\n test_host_port_pair.port = 80;\n EXPECT_FALSE(\n alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n alternate_protocols.SetAlternateProtocolFor(\n test_host_port_pair, 443, HttpAlternateProtocols::NPN_SPDY_1);\n ASSERT_TRUE(alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n const HttpAlternateProtocols::PortProtocolPair alternate =\n alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(443, alternate.port);\n EXPECT_EQ(HttpAlternateProtocols::NPN_SPDY_1, alternate.protocol);\n}\n\nTEST(HttpAlternateProtocols, SetBroken) {\n HttpAlternateProtocols alternate_protocols;\n HostPortPair test_host_port_pair;\n test_host_port_pair.host = \"foo\";\n test_host_port_pair.port = 80;\n alternate_protocols.MarkBrokenAlternateProtocolFor(test_host_port_pair);\n ASSERT_TRUE(alternate_protocols.HasAlternateProtocolFor(test_host_port_pair));\n HttpAlternateProtocols::PortProtocolPair alternate =\n alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(HttpAlternateProtocols::BROKEN, alternate.protocol);\n\n alternate_protocols.SetAlternateProtocolFor(\n test_host_port_pair,\n 1234,\n HttpAlternateProtocols::NPN_SPDY_1);\n alternate = alternate_protocols.GetAlternateProtocolFor(test_host_port_pair);\n EXPECT_EQ(HttpAlternateProtocols::BROKEN, alternate.protocol)\n << \"Second attempt should be ignored.\";\n}\n\n} \/\/ namespace\n} \/\/ namespace net\n<|endoftext|>"} {"text":"<commit_before>\/*\n\n nsjail\n -----------------------------------------\n\n Copyright 2014 Google Inc. All Rights Reserved.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n*\/\n\n#include \"nsjail.h\"\n\n#include <signal.h>\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <sys\/time.h>\n#include <termios.h>\n#include <unistd.h>\n\n#include <memory>\n\n#include \"cmdline.h\"\n#include \"logs.h\"\n#include \"macros.h\"\n#include \"net.h\"\n#include \"sandbox.h\"\n#include \"subproc.h\"\n#include \"util.h\"\n\nnamespace nsjail {\n\nstatic __thread int sigFatal = 0;\nstatic __thread bool showProc = false;\n\nstatic void sigHandler(int sig) {\n\tif (sig == SIGALRM) {\n\t\treturn;\n\t}\n\tif (sig == SIGCHLD) {\n\t\treturn;\n\t}\n\tif (sig == SIGUSR1 || sig == SIGQUIT) {\n\t\tshowProc = true;\n\t\treturn;\n\t}\n\tsigFatal = sig;\n}\n\nstatic bool setSigHandler(int sig) {\n\tLOG_D(\"Setting sighandler for signal %s (%d)\", util::sigName(sig).c_str(), sig);\n\n\tsigset_t smask;\n\tsigemptyset(&smask);\n\n\tstruct sigaction sa;\n\tsa.sa_handler = sigHandler;\n\tsa.sa_mask = smask;\n\tsa.sa_flags = 0;\n\tsa.sa_restorer = NULL;\n\n\tif (sig == SIGTTIN || sig == SIGTTOU) {\n\t\tsa.sa_handler = SIG_IGN;\n\t};\n\tif (sigaction(sig, &sa, NULL) == -1) {\n\t\tPLOG_E(\"sigaction(%d)\", sig);\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic bool setSigHandlers(void) {\n\tfor (const auto& i : nssigs) {\n\t\tif (!setSigHandler(i)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic bool setTimer(nsjconf_t* nsjconf) {\n\tif (nsjconf->mode == MODE_STANDALONE_EXECVE) {\n\t\treturn true;\n\t}\n\n\tstruct itimerval it = {\n\t .it_interval =\n\t\t{\n\t\t .tv_sec = 1,\n\t\t .tv_usec = 0,\n\t\t},\n\t .it_value =\n\t\t{\n\t\t .tv_sec = 1,\n\t\t .tv_usec = 0,\n\t\t},\n\t};\n\tif (setitimer(ITIMER_REAL, &it, NULL) == -1) {\n\t\tPLOG_E(\"setitimer(ITIMER_REAL)\");\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic int listenMode(nsjconf_t* nsjconf) {\n\tint listenfd = net::getRecvSocket(nsjconf->bindhost.c_str(), nsjconf->port);\n\tif (listenfd == -1) {\n\t\treturn EXIT_FAILURE;\n\t}\n\tfor (;;) {\n\t\tif (sigFatal > 0) {\n\t\t\tsubproc::killAll(nsjconf);\n\t\t\tlogs::logStop(sigFatal);\n\t\t\tclose(listenfd);\n\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\t\tif (showProc) {\n\t\t\tshowProc = false;\n\t\t\tsubproc::displayProc(nsjconf);\n\t\t}\n\t\tint connfd = net::acceptConn(listenfd);\n\t\tif (connfd >= 0) {\n\t\t\tsubproc::runChild(nsjconf, connfd, connfd, connfd);\n\t\t\tclose(connfd);\n\t\t}\n\t\tsubproc::reapProc(nsjconf);\n\t}\n}\n\nstatic int standaloneMode(nsjconf_t* nsjconf) {\n\tif (!subproc::runChild(nsjconf, STDIN_FILENO, STDOUT_FILENO, STDERR_FILENO)) {\n\t\tLOG_E(\"Couldn't launch the child process\");\n\t\treturn 0xff;\n\t}\n\tfor (;;) {\n\t\tint child_status = subproc::reapProc(nsjconf);\n\n\t\tif (subproc::countProc(nsjconf) == 0) {\n\t\t\tif (nsjconf->mode == MODE_STANDALONE_ONCE) {\n\t\t\t\treturn child_status;\n\t\t\t}\n\t\t\tif (!subproc::runChild(\n\t\t\t\tnsjconf, STDIN_FILENO, STDOUT_FILENO, STDERR_FILENO)) {\n\t\t\t\tLOG_E(\"Couldn't launch the child process\");\n\t\t\t\treturn 0xff;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tif (showProc) {\n\t\t\tshowProc = false;\n\t\t\tsubproc::displayProc(nsjconf);\n\t\t}\n\t\tif (sigFatal > 0) {\n\t\t\tsubproc::killAll(nsjconf);\n\t\t\tlogs::logStop(sigFatal);\n\t\t\treturn (128 + sigFatal);\n\t\t}\n\n\t\tpause();\n\t}\n\t\/\/ not reached\n}\n\nstd::unique_ptr<struct termios> getTC(int fd) {\n\tstd::unique_ptr<struct termios> trm(new struct termios);\n\n\tif (ioctl(fd, TCGETS, trm.get()) == -1) {\n\t\tPLOG_D(\"ioctl(fd=%d, TCGETS) failed\", fd);\n\t\treturn nullptr;\n\t}\n\tLOG_D(\"Saved the current state of the TTY\");\n\treturn trm;\n}\n\nvoid setTC(int fd, const struct termios* trm) {\n\tif (!trm) {\n\t\treturn;\n\t}\n\tif (ioctl(fd, TCSETS, trm) == -1) {\n\t\tPLOG_W(\"ioctl(fd=%d, TCSETS) failed\", fd);\n\t\treturn;\n\t}\n\tLOG_D(\"Restored the previous state of the TTY\");\n}\n\n} \/\/ namespace nsjail\n\nint main(int argc, char* argv[]) {\n\tstd::unique_ptr<nsjconf_t> nsjconf = cmdline::parseArgs(argc, argv);\n\tstd::unique_ptr<struct termios> trm = nsjail::getTC(STDIN_FILENO);\n\n\tif (!nsjconf) {\n\t\tLOG_F(\"Couldn't parse cmdline options\");\n\t}\n\tif (!nsjconf->clone_newuser && geteuid() != 0) {\n\t\tLOG_W(\"--disable_clone_newuser might require root() privs\");\n\t}\n\tif (nsjconf->daemonize && (daemon(0, 0) == -1)) {\n\t\tPLOG_F(\"daemon\");\n\t}\n\tcmdline::logParams(nsjconf.get());\n\tif (!nsjail::setSigHandlers()) {\n\t\tLOG_F(\"nsjail::setSigHandlers() failed\");\n\t}\n\tif (!nsjail::setTimer(nsjconf.get())) {\n\t\tLOG_F(\"nsjail::setTimer() failed\");\n\t}\n\tif (!sandbox::preparePolicy(nsjconf.get())) {\n\t\tLOG_F(\"Couldn't prepare sandboxing policy\");\n\t}\n\n\tint ret = 0;\n\tif (nsjconf->mode == MODE_LISTEN_TCP) {\n\t\tret = nsjail::listenMode(nsjconf.get());\n\t} else {\n\t\tret = nsjail::standaloneMode(nsjconf.get());\n\t}\n\n\tsandbox::closePolicy(nsjconf.get());\n\t\/* Try to restore the underlying console's params in case some program has changed it *\/\n\tnsjail::setTC(STDIN_FILENO, trm.get());\n\n\tLOG_D(\"Returning with %d\", ret);\n\treturn ret;\n}\n<commit_msg>nsjail: clearer new_proc\/reap_proc loop<commit_after>\/*\n\n nsjail\n -----------------------------------------\n\n Copyright 2014 Google Inc. All Rights Reserved.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n*\/\n\n#include \"nsjail.h\"\n\n#include <signal.h>\n#include <stdbool.h>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <sys\/ioctl.h>\n#include <sys\/time.h>\n#include <termios.h>\n#include <unistd.h>\n\n#include <memory>\n\n#include \"cmdline.h\"\n#include \"logs.h\"\n#include \"macros.h\"\n#include \"net.h\"\n#include \"sandbox.h\"\n#include \"subproc.h\"\n#include \"util.h\"\n\nnamespace nsjail {\n\nstatic __thread int sigFatal = 0;\nstatic __thread bool showProc = false;\n\nstatic void sigHandler(int sig) {\n\tif (sig == SIGALRM) {\n\t\treturn;\n\t}\n\tif (sig == SIGCHLD) {\n\t\treturn;\n\t}\n\tif (sig == SIGUSR1 || sig == SIGQUIT) {\n\t\tshowProc = true;\n\t\treturn;\n\t}\n\tsigFatal = sig;\n}\n\nstatic bool setSigHandler(int sig) {\n\tLOG_D(\"Setting sighandler for signal %s (%d)\", util::sigName(sig).c_str(), sig);\n\n\tsigset_t smask;\n\tsigemptyset(&smask);\n\n\tstruct sigaction sa;\n\tsa.sa_handler = sigHandler;\n\tsa.sa_mask = smask;\n\tsa.sa_flags = 0;\n\tsa.sa_restorer = NULL;\n\n\tif (sig == SIGTTIN || sig == SIGTTOU) {\n\t\tsa.sa_handler = SIG_IGN;\n\t};\n\tif (sigaction(sig, &sa, NULL) == -1) {\n\t\tPLOG_E(\"sigaction(%d)\", sig);\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic bool setSigHandlers(void) {\n\tfor (const auto& i : nssigs) {\n\t\tif (!setSigHandler(i)) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nstatic bool setTimer(nsjconf_t* nsjconf) {\n\tif (nsjconf->mode == MODE_STANDALONE_EXECVE) {\n\t\treturn true;\n\t}\n\n\tstruct itimerval it = {\n\t .it_interval =\n\t\t{\n\t\t .tv_sec = 1,\n\t\t .tv_usec = 0,\n\t\t},\n\t .it_value =\n\t\t{\n\t\t .tv_sec = 1,\n\t\t .tv_usec = 0,\n\t\t},\n\t};\n\tif (setitimer(ITIMER_REAL, &it, NULL) == -1) {\n\t\tPLOG_E(\"setitimer(ITIMER_REAL)\");\n\t\treturn false;\n\t}\n\treturn true;\n}\n\nstatic int listenMode(nsjconf_t* nsjconf) {\n\tint listenfd = net::getRecvSocket(nsjconf->bindhost.c_str(), nsjconf->port);\n\tif (listenfd == -1) {\n\t\treturn EXIT_FAILURE;\n\t}\n\tfor (;;) {\n\t\tif (sigFatal > 0) {\n\t\t\tsubproc::killAll(nsjconf);\n\t\t\tlogs::logStop(sigFatal);\n\t\t\tclose(listenfd);\n\t\t\treturn EXIT_SUCCESS;\n\t\t}\n\t\tif (showProc) {\n\t\t\tshowProc = false;\n\t\t\tsubproc::displayProc(nsjconf);\n\t\t}\n\t\tint connfd = net::acceptConn(listenfd);\n\t\tif (connfd >= 0) {\n\t\t\tsubproc::runChild(nsjconf, connfd, connfd, connfd);\n\t\t\tclose(connfd);\n\t\t}\n\t\tsubproc::reapProc(nsjconf);\n\t}\n}\n\nstatic int standaloneMode(nsjconf_t* nsjconf) {\n\tfor (;;) {\n\t\tif (!subproc::runChild(nsjconf, STDIN_FILENO, STDOUT_FILENO, STDERR_FILENO)) {\n\t\t\tLOG_E(\"Couldn't launch the child process\");\n\t\t\treturn 0xff;\n\t\t}\n\t\tfor (;;) {\n\t\t\tint child_status = subproc::reapProc(nsjconf);\n\t\t\tif (subproc::countProc(nsjconf) == 0) {\n\t\t\t\tif (nsjconf->mode == MODE_STANDALONE_ONCE) {\n\t\t\t\t\treturn child_status;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (showProc) {\n\t\t\t\tshowProc = false;\n\t\t\t\tsubproc::displayProc(nsjconf);\n\t\t\t}\n\t\t\tif (sigFatal > 0) {\n\t\t\t\tsubproc::killAll(nsjconf);\n\t\t\t\tlogs::logStop(sigFatal);\n\t\t\t\treturn (128 + sigFatal);\n\t\t\t}\n\t\t\tpause();\n\t\t}\n\t}\n\t\/\/ not reached\n}\n\nstd::unique_ptr<struct termios> getTC(int fd) {\n\tstd::unique_ptr<struct termios> trm(new struct termios);\n\n\tif (ioctl(fd, TCGETS, trm.get()) == -1) {\n\t\tPLOG_D(\"ioctl(fd=%d, TCGETS) failed\", fd);\n\t\treturn nullptr;\n\t}\n\tLOG_D(\"Saved the current state of the TTY\");\n\treturn trm;\n}\n\nvoid setTC(int fd, const struct termios* trm) {\n\tif (!trm) {\n\t\treturn;\n\t}\n\tif (ioctl(fd, TCSETS, trm) == -1) {\n\t\tPLOG_W(\"ioctl(fd=%d, TCSETS) failed\", fd);\n\t\treturn;\n\t}\n\tLOG_D(\"Restored the previous state of the TTY\");\n}\n\n} \/\/ namespace nsjail\n\nint main(int argc, char* argv[]) {\n\tstd::unique_ptr<nsjconf_t> nsjconf = cmdline::parseArgs(argc, argv);\n\tstd::unique_ptr<struct termios> trm = nsjail::getTC(STDIN_FILENO);\n\n\tif (!nsjconf) {\n\t\tLOG_F(\"Couldn't parse cmdline options\");\n\t}\n\tif (!nsjconf->clone_newuser && geteuid() != 0) {\n\t\tLOG_W(\"--disable_clone_newuser might require root() privs\");\n\t}\n\tif (nsjconf->daemonize && (daemon(0, 0) == -1)) {\n\t\tPLOG_F(\"daemon\");\n\t}\n\tcmdline::logParams(nsjconf.get());\n\tif (!nsjail::setSigHandlers()) {\n\t\tLOG_F(\"nsjail::setSigHandlers() failed\");\n\t}\n\tif (!nsjail::setTimer(nsjconf.get())) {\n\t\tLOG_F(\"nsjail::setTimer() failed\");\n\t}\n\tif (!sandbox::preparePolicy(nsjconf.get())) {\n\t\tLOG_F(\"Couldn't prepare sandboxing policy\");\n\t}\n\n\tint ret = 0;\n\tif (nsjconf->mode == MODE_LISTEN_TCP) {\n\t\tret = nsjail::listenMode(nsjconf.get());\n\t} else {\n\t\tret = nsjail::standaloneMode(nsjconf.get());\n\t}\n\n\tsandbox::closePolicy(nsjconf.get());\n\t\/* Try to restore the underlying console's params in case some program has changed it *\/\n\tnsjail::setTC(STDIN_FILENO, trm.get());\n\n\tLOG_D(\"Returning with %d\", ret);\n\treturn ret;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: overlayobjectcell.hxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: rt $ $Date: 2008-03-12 09:34:16 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n#ifndef _SDR_OVERLAY_OVERLAYOBJECTCELL_HXX\n#define _SDR_OVERLAY_OVERLAYOBJECTCELL_HXX\n\n#ifndef _SDR_OVERLAY_OVERLAYOBJECT_HXX\n#include <svx\/sdr\/overlay\/overlayobject.hxx>\n#endif\n\n#include <vector>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ #114409#\nnamespace sdr\n{\n namespace overlay\n {\n enum CellOverlayType { CELL_OVERLAY_INVERT, CELL_OVERLAY_HATCH, CELL_OVERLAY_TRANSPARENT, CELL_OVERLAY_LIGHT_TRANSPARENT };\n\n \/\/ OverlayObjectCell - used for cell cursor, selection and AutoFill handle\n\n class SVX_DLLPUBLIC OverlayObjectCell : public OverlayObject\n {\n public:\n typedef ::std::vector< basegfx::B2DRange > RangeVector;\n\n private:\n CellOverlayType mePaintType;\n RangeVector maRectangles;\n\n virtual void drawGeometry(OutputDevice& rOutputDevice);\n virtual void createBaseRange(OutputDevice& rOutputDevice);\n\n public:\n OverlayObjectCell( CellOverlayType eType, const Color& rColor, const RangeVector& rRects);\n virtual ~OverlayObjectCell();\n\n virtual void transform(const basegfx::B2DHomMatrix& rMatrix);\n };\n\n } \/\/ end of namespace overlay\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_OVERLAY_OVERLAYLINE_HXX\n\n\/\/ eof\n<commit_msg>INTEGRATION: CWS changefileheader (1.2.36); FILE MERGED 2008\/04\/01 12:47:53 thb 1.2.36.2: #i85898# Stripping all external header guards 2008\/03\/31 14:19:02 rt 1.2.36.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: overlayobjectcell.hxx,v $\n * $Revision: 1.3 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n#ifndef _SDR_OVERLAY_OVERLAYOBJECTCELL_HXX\n#define _SDR_OVERLAY_OVERLAYOBJECTCELL_HXX\n\n#include <svx\/sdr\/overlay\/overlayobject.hxx>\n\n#include <vector>\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ #114409#\nnamespace sdr\n{\n namespace overlay\n {\n enum CellOverlayType { CELL_OVERLAY_INVERT, CELL_OVERLAY_HATCH, CELL_OVERLAY_TRANSPARENT, CELL_OVERLAY_LIGHT_TRANSPARENT };\n\n \/\/ OverlayObjectCell - used for cell cursor, selection and AutoFill handle\n\n class SVX_DLLPUBLIC OverlayObjectCell : public OverlayObject\n {\n public:\n typedef ::std::vector< basegfx::B2DRange > RangeVector;\n\n private:\n CellOverlayType mePaintType;\n RangeVector maRectangles;\n\n virtual void drawGeometry(OutputDevice& rOutputDevice);\n virtual void createBaseRange(OutputDevice& rOutputDevice);\n\n public:\n OverlayObjectCell( CellOverlayType eType, const Color& rColor, const RangeVector& rRects);\n virtual ~OverlayObjectCell();\n\n virtual void transform(const basegfx::B2DHomMatrix& rMatrix);\n };\n\n } \/\/ end of namespace overlay\n} \/\/ end of namespace sdr\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#endif \/\/_SDR_OVERLAY_OVERLAYLINE_HXX\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before>\/*****************************************************************************\n * chromecast_demux.cpp: Chromecast demux filter module for vlc\n *****************************************************************************\n * Copyright © 2015-2016 VideoLAN\n *\n * Authors: Steve Lhomme <robux4@videolabs.io>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\/*****************************************************************************\n * Preamble\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n#include <vlc_plugin.h>\n#include <vlc_demux.h>\n\n#include \"chromecast_common.h\"\n\n#include <new>\n\nstruct demux_sys_t\n{\n demux_sys_t(demux_t * const demux, chromecast_common * const renderer)\n :p_demux(demux)\n ,p_renderer(renderer)\n ,i_length(-1)\n ,demuxReady(false)\n ,canSeek(false)\n ,m_seektime( VLC_TS_INVALID )\n {\n demux_t *p_last_demux = demux->p_next;\n while (p_last_demux->p_next)\n p_last_demux = p_last_demux->p_next;\n input_thread_t *p_input = p_last_demux->p_input;\n input_item_t *p_item = input_GetItem( p_input );\n if ( p_item )\n {\n char *psz_title = input_item_GetTitleFbName( p_item );\n p_renderer->pf_set_title( p_renderer->p_opaque, psz_title );\n free( psz_title );\n\n psz_title = input_item_GetArtworkURL( p_item );\n p_renderer->pf_set_artwork( p_renderer->p_opaque, psz_title );\n free( psz_title );\n }\n\n p_renderer->pf_set_input_state( p_renderer->p_opaque,\n (input_state_e) var_GetInteger( p_input, \"state\" ) );\n var_AddCallback( p_input, \"intf-event\", InputEvent, this );\n }\n\n ~demux_sys_t()\n {\n demux_t *p_last_demux = p_demux->p_next;\n while (p_last_demux->p_next)\n p_last_demux = p_last_demux->p_next;\n input_thread_t *p_input = p_last_demux->p_input;\n var_DelCallback( p_input, \"intf-event\", InputEvent, this );\n\n p_renderer->pf_set_title( p_renderer->p_opaque, NULL );\n p_renderer->pf_set_artwork( p_renderer->p_opaque, NULL );\n }\n\n \/**\n * @brief getPlaybackTime\n * @return the current playback time on the device or VLC_TS_INVALID if unknown\n *\/\n mtime_t getPlaybackTime()\n {\n return p_renderer->pf_get_time( p_renderer->p_opaque );\n }\n\n double getPlaybackPosition()\n {\n return p_renderer->pf_get_position( p_renderer->p_opaque );\n }\n\n void setCanSeek( bool canSeek )\n {\n this->canSeek = canSeek;\n }\n\n bool seekTo( double pos )\n {\n if (i_length == -1)\n return false;\n return seekTo( mtime_t( i_length * pos ) );\n }\n\n bool seekTo( mtime_t i_pos )\n {\n if ( !canSeek )\n return false;\n\n \/* seeking will be handled with the Chromecast *\/\n m_seektime = i_pos;\n p_renderer->pf_request_seek( p_renderer->p_opaque, i_pos );\n\n return true;\n }\n\n void setLength( mtime_t length )\n {\n this->i_length = length;\n p_renderer->pf_set_length( p_renderer->p_opaque, length );\n }\n\n int Demux()\n {\n if (!demuxReady)\n {\n msg_Dbg(p_demux, \"wait to demux\");\n p_renderer->pf_wait_app_started( p_renderer->p_opaque );\n demuxReady = true;\n msg_Dbg(p_demux, \"ready to demux\");\n }\n\n \/* hold the data while seeking *\/\n \/* wait until the device is buffering for data after the seek command *\/\n if ( m_seektime != VLC_TS_INVALID )\n {\n p_renderer->pf_wait_seek_done( p_renderer->p_opaque );\n m_seektime = VLC_TS_INVALID;\n }\n\n return demux_Demux( p_demux->p_next );\n }\n\nprotected:\n demux_t * const p_demux;\n chromecast_common * const p_renderer;\n mtime_t i_length;\n bool demuxReady;\n bool canSeek;\n \/* seek time kept while waiting for the chromecast to \"seek\" *\/\n mtime_t m_seektime;\n\n static int InputEvent( vlc_object_t *p_this, char const *psz_var,\n vlc_value_t oldval, vlc_value_t val, void * );\n};\n\nstatic int Demux( demux_t *p_demux_filter )\n{\n demux_sys_t *p_sys = p_demux_filter->p_sys;\n\n return p_sys->Demux();\n}\n\nstatic int Control( demux_t *p_demux_filter, int i_query, va_list args)\n{\n demux_sys_t *p_sys = p_demux_filter->p_sys;\n\n switch (i_query)\n {\n case DEMUX_GET_POSITION:\n *va_arg( args, double * ) = p_sys->getPlaybackPosition();\n return VLC_SUCCESS;\n\n case DEMUX_GET_TIME:\n *va_arg(args, int64_t *) = p_sys->getPlaybackTime();\n return VLC_SUCCESS;\n\n case DEMUX_GET_LENGTH:\n {\n int ret;\n va_list ap;\n\n va_copy( ap, args );\n ret = demux_vaControl( p_demux_filter->p_next, i_query, args );\n if( ret == VLC_SUCCESS )\n p_sys->setLength( *va_arg( ap, int64_t * ) );\n va_end( ap );\n return ret;\n }\n\n case DEMUX_CAN_SEEK:\n {\n int ret;\n va_list ap;\n\n va_copy( ap, args );\n ret = demux_vaControl( p_demux_filter->p_next, i_query, args );\n if( ret == VLC_SUCCESS )\n p_sys->setCanSeek( *va_arg( ap, bool* ) );\n va_end( ap );\n return ret;\n }\n\n case DEMUX_SET_POSITION:\n {\n va_list ap;\n\n va_copy( ap, args );\n double pos = va_arg( ap, double );\n va_end( ap );\n\n if ( p_sys->getPlaybackTime() == VLC_TS_INVALID )\n {\n msg_Dbg( p_demux_filter, \"internal seek to %f when the playback didn't start\", pos );\n break; \/\/ seek before device started, likely on-the-fly restart\n }\n\n if ( !p_sys->seekTo( pos ) )\n {\n msg_Err( p_demux_filter, \"failed to seek to %f\", pos );\n return VLC_EGENERIC;\n }\n break;\n }\n\n case DEMUX_SET_TIME:\n {\n va_list ap;\n\n va_copy( ap, args );\n mtime_t pos = va_arg( ap, mtime_t );\n va_end( ap );\n\n if ( p_sys->getPlaybackTime() == VLC_TS_INVALID )\n {\n msg_Dbg( p_demux_filter, \"internal seek to %\" PRId64 \" when the playback didn't start\", pos );\n break; \/\/ seek before device started, likely on-the-fly restart\n }\n\n if ( !p_sys->seekTo( pos ) )\n {\n msg_Err( p_demux_filter, \"failed to seek to time %\" PRId64, pos );\n return VLC_EGENERIC;\n }\n break;\n }\n }\n\n return demux_vaControl( p_demux_filter->p_next, i_query, args );\n}\n\nint demux_sys_t::InputEvent( vlc_object_t *p_this, char const *psz_var,\n vlc_value_t oldval, vlc_value_t val, void *p_data )\n{\n VLC_UNUSED(psz_var);\n VLC_UNUSED(oldval);\n input_thread_t *p_input = reinterpret_cast<input_thread_t*>( p_this );\n demux_sys_t *p_sys = reinterpret_cast<demux_sys_t*>( p_data );\n\n if( val.i_int == INPUT_EVENT_STATE )\n p_sys->p_renderer->pf_set_input_state( p_sys->p_renderer->p_opaque,\n (input_state_e) var_GetInteger( p_input, \"state\" ) );\n\n return VLC_SUCCESS;\n}\n\nint Open(vlc_object_t *p_this)\n{\n demux_t *p_demux = reinterpret_cast<demux_t*>(p_this);\n chromecast_common *p_renderer = reinterpret_cast<chromecast_common *>(\n var_InheritAddress( p_demux, CC_SHARED_VAR_NAME ) );\n if ( p_renderer == NULL )\n {\n msg_Warn( p_this, \"using Chromecast demuxer with no sout\" );\n return VLC_ENOOBJ;\n }\n\n demux_sys_t *p_sys = new(std::nothrow) demux_sys_t( p_demux, p_renderer );\n if (unlikely(p_sys == NULL))\n return VLC_ENOMEM;\n\n p_demux->p_sys = p_sys;\n p_demux->pf_demux = Demux;\n p_demux->pf_control = Control;\n\n return VLC_SUCCESS;\n}\n\nvoid Close(vlc_object_t *p_this)\n{\n demux_t *p_demux = reinterpret_cast<demux_t*>(p_this);\n demux_sys_t *p_sys = p_demux->p_sys;\n\n delete p_sys;\n}\n\nvlc_module_begin ()\n set_shortname( \"cc_demux\" )\n set_category( CAT_INPUT )\n set_subcategory( SUBCAT_INPUT_DEMUX )\n set_description( N_( \"chromecast demux wrapper\" ) )\n set_capability( \"demux_filter\", 0 )\n add_shortcut( \"cc_demux\" )\n set_callbacks( Open, Close )\nvlc_module_end ()\n<commit_msg>chromecast: demux: use DEMUX_GET_META by default to get the title and artwork URL<commit_after>\/*****************************************************************************\n * chromecast_demux.cpp: Chromecast demux filter module for vlc\n *****************************************************************************\n * Copyright © 2015-2016 VideoLAN\n *\n * Authors: Steve Lhomme <robux4@videolabs.io>\n *\n * This program is free software; you can redistribute it and\/or modify it\n * under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation; either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.\n *****************************************************************************\/\n\n\/*****************************************************************************\n * Preamble\n *****************************************************************************\/\n\n#ifdef HAVE_CONFIG_H\n# include \"config.h\"\n#endif\n\n#include <vlc_common.h>\n#include <vlc_plugin.h>\n#include <vlc_demux.h>\n\n#include \"chromecast_common.h\"\n\n#include <new>\n\nstruct demux_sys_t\n{\n demux_sys_t(demux_t * const demux, chromecast_common * const renderer)\n :p_demux(demux)\n ,p_renderer(renderer)\n ,i_length(-1)\n ,demuxReady(false)\n ,canSeek(false)\n ,m_seektime( VLC_TS_INVALID )\n {\n vlc_meta_t *p_meta = vlc_meta_New();\n if( likely(p_meta != NULL) )\n {\n if (demux_Control( demux->p_next, DEMUX_GET_META, p_meta) == VLC_SUCCESS)\n {\n const char *meta = vlc_meta_Get( p_meta, vlc_meta_Title );\n if ( meta != NULL )\n p_renderer->pf_set_title( p_renderer->p_opaque, meta );\n meta = vlc_meta_Get( p_meta, vlc_meta_ArtworkURL );\n if ( meta != NULL )\n p_renderer->pf_set_artwork( p_renderer->p_opaque, meta );\n }\n vlc_meta_Delete(p_meta);\n }\n p_renderer->pf_set_input_state( p_renderer->p_opaque,\n (input_state_e) var_GetInteger( p_input, \"state\" ) );\n var_AddCallback( p_input, \"intf-event\", InputEvent, this );\n }\n\n ~demux_sys_t()\n {\n demux_t *p_last_demux = p_demux->p_next;\n while (p_last_demux->p_next)\n p_last_demux = p_last_demux->p_next;\n input_thread_t *p_input = p_last_demux->p_input;\n var_DelCallback( p_input, \"intf-event\", InputEvent, this );\n\n p_renderer->pf_set_title( p_renderer->p_opaque, NULL );\n p_renderer->pf_set_artwork( p_renderer->p_opaque, NULL );\n }\n\n \/**\n * @brief getPlaybackTime\n * @return the current playback time on the device or VLC_TS_INVALID if unknown\n *\/\n mtime_t getPlaybackTime()\n {\n return p_renderer->pf_get_time( p_renderer->p_opaque );\n }\n\n double getPlaybackPosition()\n {\n return p_renderer->pf_get_position( p_renderer->p_opaque );\n }\n\n void setCanSeek( bool canSeek )\n {\n this->canSeek = canSeek;\n }\n\n bool seekTo( double pos )\n {\n if (i_length == -1)\n return false;\n return seekTo( mtime_t( i_length * pos ) );\n }\n\n bool seekTo( mtime_t i_pos )\n {\n if ( !canSeek )\n return false;\n\n \/* seeking will be handled with the Chromecast *\/\n m_seektime = i_pos;\n p_renderer->pf_request_seek( p_renderer->p_opaque, i_pos );\n\n return true;\n }\n\n void setLength( mtime_t length )\n {\n this->i_length = length;\n p_renderer->pf_set_length( p_renderer->p_opaque, length );\n }\n\n int Demux()\n {\n if (!demuxReady)\n {\n msg_Dbg(p_demux, \"wait to demux\");\n p_renderer->pf_wait_app_started( p_renderer->p_opaque );\n demuxReady = true;\n msg_Dbg(p_demux, \"ready to demux\");\n }\n\n \/* hold the data while seeking *\/\n \/* wait until the device is buffering for data after the seek command *\/\n if ( m_seektime != VLC_TS_INVALID )\n {\n p_renderer->pf_wait_seek_done( p_renderer->p_opaque );\n m_seektime = VLC_TS_INVALID;\n }\n\n return demux_Demux( p_demux->p_next );\n }\n\nprotected:\n demux_t * const p_demux;\n chromecast_common * const p_renderer;\n mtime_t i_length;\n bool demuxReady;\n bool canSeek;\n \/* seek time kept while waiting for the chromecast to \"seek\" *\/\n mtime_t m_seektime;\n\n static int InputEvent( vlc_object_t *p_this, char const *psz_var,\n vlc_value_t oldval, vlc_value_t val, void * );\n};\n\nstatic int Demux( demux_t *p_demux_filter )\n{\n demux_sys_t *p_sys = p_demux_filter->p_sys;\n\n return p_sys->Demux();\n}\n\nstatic int Control( demux_t *p_demux_filter, int i_query, va_list args)\n{\n demux_sys_t *p_sys = p_demux_filter->p_sys;\n\n switch (i_query)\n {\n case DEMUX_GET_POSITION:\n *va_arg( args, double * ) = p_sys->getPlaybackPosition();\n return VLC_SUCCESS;\n\n case DEMUX_GET_TIME:\n *va_arg(args, int64_t *) = p_sys->getPlaybackTime();\n return VLC_SUCCESS;\n\n case DEMUX_GET_LENGTH:\n {\n int ret;\n va_list ap;\n\n va_copy( ap, args );\n ret = demux_vaControl( p_demux_filter->p_next, i_query, args );\n if( ret == VLC_SUCCESS )\n p_sys->setLength( *va_arg( ap, int64_t * ) );\n va_end( ap );\n return ret;\n }\n\n case DEMUX_CAN_SEEK:\n {\n int ret;\n va_list ap;\n\n va_copy( ap, args );\n ret = demux_vaControl( p_demux_filter->p_next, i_query, args );\n if( ret == VLC_SUCCESS )\n p_sys->setCanSeek( *va_arg( ap, bool* ) );\n va_end( ap );\n return ret;\n }\n\n case DEMUX_SET_POSITION:\n {\n va_list ap;\n\n va_copy( ap, args );\n double pos = va_arg( ap, double );\n va_end( ap );\n\n if ( p_sys->getPlaybackTime() == VLC_TS_INVALID )\n {\n msg_Dbg( p_demux_filter, \"internal seek to %f when the playback didn't start\", pos );\n break; \/\/ seek before device started, likely on-the-fly restart\n }\n\n if ( !p_sys->seekTo( pos ) )\n {\n msg_Err( p_demux_filter, \"failed to seek to %f\", pos );\n return VLC_EGENERIC;\n }\n break;\n }\n\n case DEMUX_SET_TIME:\n {\n va_list ap;\n\n va_copy( ap, args );\n mtime_t pos = va_arg( ap, mtime_t );\n va_end( ap );\n\n if ( p_sys->getPlaybackTime() == VLC_TS_INVALID )\n {\n msg_Dbg( p_demux_filter, \"internal seek to %\" PRId64 \" when the playback didn't start\", pos );\n break; \/\/ seek before device started, likely on-the-fly restart\n }\n\n if ( !p_sys->seekTo( pos ) )\n {\n msg_Err( p_demux_filter, \"failed to seek to time %\" PRId64, pos );\n return VLC_EGENERIC;\n }\n break;\n }\n }\n\n return demux_vaControl( p_demux_filter->p_next, i_query, args );\n}\n\nint demux_sys_t::InputEvent( vlc_object_t *p_this, char const *psz_var,\n vlc_value_t oldval, vlc_value_t val, void *p_data )\n{\n VLC_UNUSED(psz_var);\n VLC_UNUSED(oldval);\n input_thread_t *p_input = reinterpret_cast<input_thread_t*>( p_this );\n demux_sys_t *p_sys = reinterpret_cast<demux_sys_t*>( p_data );\n\n if( val.i_int == INPUT_EVENT_STATE )\n p_sys->p_renderer->pf_set_input_state( p_sys->p_renderer->p_opaque,\n (input_state_e) var_GetInteger( p_input, \"state\" ) );\n\n return VLC_SUCCESS;\n}\n\nint Open(vlc_object_t *p_this)\n{\n demux_t *p_demux = reinterpret_cast<demux_t*>(p_this);\n chromecast_common *p_renderer = reinterpret_cast<chromecast_common *>(\n var_InheritAddress( p_demux, CC_SHARED_VAR_NAME ) );\n if ( p_renderer == NULL )\n {\n msg_Warn( p_this, \"using Chromecast demuxer with no sout\" );\n return VLC_ENOOBJ;\n }\n\n demux_sys_t *p_sys = new(std::nothrow) demux_sys_t( p_demux, p_renderer );\n if (unlikely(p_sys == NULL))\n return VLC_ENOMEM;\n\n p_demux->p_sys = p_sys;\n p_demux->pf_demux = Demux;\n p_demux->pf_control = Control;\n\n return VLC_SUCCESS;\n}\n\nvoid Close(vlc_object_t *p_this)\n{\n demux_t *p_demux = reinterpret_cast<demux_t*>(p_this);\n demux_sys_t *p_sys = p_demux->p_sys;\n\n delete p_sys;\n}\n\nvlc_module_begin ()\n set_shortname( \"cc_demux\" )\n set_category( CAT_INPUT )\n set_subcategory( SUBCAT_INPUT_DEMUX )\n set_description( N_( \"chromecast demux wrapper\" ) )\n set_capability( \"demux_filter\", 0 )\n add_shortcut( \"cc_demux\" )\n set_callbacks( Open, Close )\nvlc_module_end ()\n<|endoftext|>"} {"text":"<commit_before>\/*\n * 5\/3\/17\n * Student author: Anthony Sarkis\n *\/\n\n#include <random>\n#include <algorithm>\n#include <iostream>\n#include <numeric>\n#include <map>\n\n#include \"particle_filter.h\"\n\nusing namespace std;\n\n\nvoid ParticleFilter::init(double x, double y, double theta, double std[]) {\n\t\/\/ Initialize all particles to first position (based on estimates of \n\t\/\/ x, y, theta and their uncertainties from GPS)\n\n\tnum_particles = 100;\n\n\trandom_device rd;\n mt19937 gen(rd());\n\tnormal_distribution<double> dist_x(\t\tx, \t\tstd[0]) ;\n\tnormal_distribution<double> dist_y(\t\ty, \t\tstd[1]) ;\n\tnormal_distribution<double> dist_psi(\ttheta, \tstd[2]);\n\n\tweights.resize(num_particles) ;\n\tparticles.resize(num_particles) ;\n\n\tfor (int i = 0; i < num_particles; ++i) {\n\t\t\n\t\tparticles[i].id \t= i ;\n\t\tparticles[i].x \t\t= dist_x(gen) ; \/\/ Add random Gaussian noise to each particle.\n\t\tparticles[i].y \t\t= dist_y(gen) ;\n\t\tparticles[i].theta \t= dist_psi(gen) ;\n\t\tparticles[i].weight = 1.0 ;\n\t\t\/\/ cout << \"Sample \" << i + 1 << \" \" << sample_x << \" \" << sample_y << \" \" << sample_psi << endl;\n\t}\n\n\tis_initialized = true;\n\tcout << \"Initialization complete\" << endl;\n}\n\n\nvoid ParticleFilter::prediction(double delta_t, double std_pos[], double velocity, double yaw_rate) {\n\n\t\/\/ cout << \"start prediction\" << endl;\n\trandom_device rd;\n mt19937 gen(rd());\n\n\tfor (int i = 0; \ti < num_particles; \t\ti++) {\n\t\t\n\t\tconst double theta = particles[i].theta ;\n\n\t\t\/\/ cout << \"Prediction step:\" << i << endl;\n\n\t\t\/\/ Add measurements\n\n\t\tif ( fabs(yaw_rate) > 0.001) {\t\t\/\/ Turning\n\n\t\t\tconst double velocity_yaw_rate = velocity \/ yaw_rate ;\n\t\t\tconst double yaw_rate_delta_t = yaw_rate * delta_t ;\n\n\t\t\tparticles[i].x += velocity_yaw_rate * (sin(theta + yaw_rate_delta_t) - sin(theta)) ;\n\t\t\tparticles[i].y += velocity_yaw_rate * (cos(theta) - cos(theta + yaw_rate_delta_t)) ;\n\t\t\tparticles[i].theta += yaw_rate * delta_t ;\n\t\t}\n\n\t\telse {\t\t\/\/ Going straight\n\t\t\t\n\t\t\tconst double velocity_delta_t = velocity * delta_t ;\n\n\t\t\tparticles[i].x += velocity_delta_t * cos(theta) ;\n\t\t\tparticles[i].y += velocity_delta_t * sin(theta) ;\n\t\t\t\/\/ theta excluded as no updates\n\t\t}\n\n\t\t\/\/ add random Gaussian noise\n\t\tnormal_distribution<double> dist_x(\t\t0, \tstd_pos[0]) ;\n\t\tnormal_distribution<double> dist_y(\t\t0, \tstd_pos[1]) ;\n\t\tnormal_distribution<double> dist_psi(\t0, \tstd_pos[2]);\n\n\t\tparticles[i].x \t\t+= dist_x(\tgen) ; \/\/ += since normal_distribution centere on 0.\n\t\tparticles[i].y \t\t+= dist_y(\tgen) ;\n\t\tparticles[i].theta \t+= dist_psi(gen) ;\n\t}\n\t\/\/ cout << \"prediction complete\" << endl;\n}\n\n\nvoid ParticleFilter::dataAssociation( std::vector<LandmarkObs> predicted, \n\t\t\t\t\t\t\t\t\t std::vector<LandmarkObs>& observations) {\n \/\/ helper during the updateWeights phase.\n\n\tdouble difference ;\n\tdouble threshold = 9999999.0;\n\n\tfor (unsigned int i = 0;\ti < observations.size();\t i++){\n\n\t\t\/\/ Find the predicted measurement that is closest to each observed measurement\n\t\tdifference = dist( predicted[i].x, predicted[i].y, \n\t\t\t\t\t\t observations[i].x, observations[i].y) ;\n\n\t\tif (difference < threshold) {\n\n\t\t\tthreshold = difference ; \n\t\t\tobservations[i].id = predicted[i].id ; \/\/ assign the measurement to this particular landmark\n\t\t\n\t\t\/\/ cout << \"difference \" << difference << \"\\t observation ids: \" << observations[i].id << endl;\n\t\t}\n\t}\n}\n\nvoid ParticleFilter::updateWeights(double sensor_range, double std_landmark[], \n\t\tstd::vector<LandmarkObs> observations, Map map_landmarks) {\n\n\t\/\/ cout << \"Starting update weights\" << endl;\n\n\tvector<LandmarkObs> transformed_observations ;\n\tconst int observations_size = observations.size() ;\n\ttransformed_observations.resize(observations_size) ;\n\n\t\/\/ 1. Convert particle observations to global frame\n\tfor (int i = 0; \ti < num_particles; \t\ti++) {\n\n\t\t\/\/ cout << \"Update step: \\t\" << i << endl;\n\n\t\tfor (int k = 0; \tk < observations_size;\t\tk++) {\n\n\t\t\t\/\/ Pre-compute terms\n\t\t\tconst double particle_theta = particles[i].theta ;\n\t\t\tconst double cos_theta \t\t= cos(particle_theta) ;\n\t\t\tconst double sin_theta \t\t= sin(particle_theta) ; \n\t\t\t\n\t\t\t\/\/ Create placeholder for transformations\n\t\t\tLandmarkObs single_transformed_observation ;\n\n\t\t\t\/\/ p_x + (obs_x * cos(theta)) - (obs_y * sin(theta))\n\t\t\tsingle_transformed_observation.x = particles[i].x + \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].x * cos_theta) - \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].y * sin_theta) ;\n\n\t\t\t\/\/ p_y + (obs_x * sin(theta)) + (obs_y * cos(theta))\t\t\t\t\t \n\t\t\tsingle_transformed_observation.y = particles[i].y +\n\t\t\t\t\t\t\t\t\t\t\t (observations[k].x * sin_theta) + \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].y * cos_theta) ;\n\n\t\t\ttransformed_observations[k] = single_transformed_observation ;\n\t\t}\n\n\t\t\/\/ cout << \"Transformation complete\" << endl;\n\n\t\t\/\/ 2. Only keep landmarks that are within range\n\t\tvector<LandmarkObs> reasonable_landmarks ;\n\t\treasonable_landmarks.resize(num_particles) ; \/\/ for debugging\n\n\t\tint landmark_limit = map_landmarks.landmark_list.size() ;\n\n\t\tfor (int q = 0;\t\tq < landmark_limit;\t\tq++){\n\n\t\t\tconst double landmark_position_x = map_landmarks.landmark_list[q].x_f ;\n\t\t\tconst double landmark_position_y = map_landmarks.landmark_list[q].y_f ;\n\t\t\t\n\t\t\t\/\/ 2.1 Compare particle distance to landmark distance\n\t\t\tdouble difference = dist( landmark_position_x, landmark_position_y,\n\t\t\t\t\t\t \t particles[i].x, particles[i].y );\n\t\t\t\/\/ cout << difference << \" \" << sensor_range << endl;\n\n\t\t\t\/\/ 2.2 Only look at landmarks within sensor range\n\t\t\tif (difference <= sensor_range) {\n\n\t\t\t\tconst int landmark_id = map_landmarks.landmark_list[q].id_i ;\n\n\t\t\t\treasonable_landmarks.push_back( LandmarkObs { landmark_id, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t landmark_position_x,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t landmark_position_y }) ;\n\t\t\t}\n\t\t\t\/\/ cout << reasonable_landmarks.size() << endl;\n\t\t}\n\n\t\t\/\/ 3. Associate each predicted measurement to it's closest point\n\t\tdataAssociation(reasonable_landmarks, transformed_observations) ;\n\t\t\/\/ cout << \"dataAssociation complete, reasonable landmarks size: \" << reasonable_landmarks.size() << endl;\n\n\t\t\/\/ 4. Weight distribution\n\t\t\/\/ Pre compute\n\t\tconst double standard_x \t\t\t= std_landmark[0] ;\n\t\tconst double standard_y \t\t\t= std_landmark[1] ;\n\t\tconst double standard_x_squared_2\t= (standard_x * standard_x) * 2 ;\n\t\tconst double standard_y_squared_2\t= (standard_y * standard_y) * 2;\n\t\tconst double part_1 \t\t\t\t= 1 \/ (2 * M_PI * standard_x * standard_y) ;\n\t\t\/\/ cout << part_1 << endl;\n\n\n\t\tdouble weight_placeholder = particles[i].weight ;\n\t\t\/\/ if reasonable landmarks have been found\n\t\tif (reasonable_landmarks.size() > 0) {\n\n\t\t\tfor (unsigned int zzz = 0; \tzzz < observations.size();\tzzz++) {\n\n\t\t\t\tconst double x \t\t\t\t= observations[zzz].x ;\n\t\t\t\tconst double u_x \t\t\t= reasonable_landmarks[zzz].x ;\n\t\t\t\tconst double y \t\t\t \t= observations[zzz].y ;\n\t\t\t\tconst double u_y \t\t \t= reasonable_landmarks[zzz].y ;\n\t\t\t\tconst double x_ux_squared \t= (x - u_x) * (x - u_x) ;\n\t\t\t\tconst double y_uy_squared \t= (y - u_y) * (y - u_y) ;\n\t\t\t\tconst double part_2 \t\t= x_ux_squared \/ (standard_x_squared_2) +\n\t\t\t\t\t\t\t\t\t \t\t y_uy_squared \/ (standard_y_squared_2) ;\n\t\t\t\tdouble exp_part_2\t\t\t= exp(-part_2) ;\n\n\t\t\t\t\/\/ cout << weight_placeholder << endl;\n\t\t\t\t\/\/ cout << part_1 << \"\\t\" << part_2 << \"\\t\" << exp_part_2 << endl;\n\n\t\t\t\tif (exp_part_2 < .001) {\n\t\t\t\t\texp_part_2 = .001;\n\t\t\t\t}\n\n\t\t\t\tweight_placeholder *= part_1 * exp_part_2 ;\n\n\t\t\t\t\/\/ cout << weight_placeholder << endl;\n\t\t\t\t\/\/ cout << \"x \" << x << \"\\tu_x \" << u_x << \"\\ty \" << y << \"\\tu_y \" << u_y << endl ;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tweights[i] \t\t\t= 0.0000000001 ;\n\t\t\tparticles[i].weight = 0.0000000001 ;\n\t\t\tcout << \"No reasonable landmarks\" << endl;\n\t\t}\n\n\t\tweights[i] \t\t\t= weight_placeholder ;\n\t\tparticles[i].weight = weight_placeholder ;\n\t\t\/\/ cout << \"Weight update complete\" << endl;\n\t}\n}\n\nvoid ParticleFilter::resample() {\n\t\/\/ Resample particles with replacement with probability proportional to their weight.\n\t\/\/ cout << \"Resample started \" << \" \" << particles.size() << endl;\n\n\t\/\/ from http:\/\/en.cppreference.com\/w\/cpp\/numeric\/random\/discrete_distribution\n random_device rd;\n mt19937 gen(rd());\n\tdiscrete_distribution<> d(weights.begin(), weights.end());\n\n\t\/\/ cout << \"Number of particles \\t\" << num_particles << endl;\n\n\tvector<Particle> resampled_particles ;\n\tresampled_particles.resize(num_particles) ;\n\n for(int n = 0;\tn < num_particles;\tn++) {\n\n\n \t\/\/ cout << \"Resample step: \\t\" << n << endl;\n\n \tint new_index = d(gen);\n \t\/\/ cout << new_index << endl ;\n resampled_particles[n] = particles[new_index];\n }\n \/\/ cout << \"Resample complete\" << endl;\n particles = resampled_particles ;\n}\n\nvoid ParticleFilter::write(std::string filename) {\n\t\/\/ You don't need to modify this file.\n\tstd::ofstream dataFile;\n\tdataFile.open(filename, std::ios::app);\n\tfor (int i = 0; i < num_particles; ++i) {\n\t\tdataFile << particles[i].x << \" \" << particles[i].y << \" \" << particles[i].theta << \"\\n\";\n\t}\n\tdataFile.close();\n}\n<commit_msg>many more fixes... updateWeights() needs to be refacted<commit_after>\/*\n * 5\/3\/17\n * Student author: Anthony Sarkis\n *\/\n\n#include <random>\n#include <algorithm>\n#include <iostream>\n#include <numeric>\n#include <map>\n\n#include \"particle_filter.h\"\n\nusing namespace std;\n\n\nvoid ParticleFilter::init(double x, double y, double theta, double std[]) {\n\t\/\/ Initialize all particles to first position (based on estimates of \n\t\/\/ x, y, theta and their uncertainties from GPS)\n\n\tnum_particles = 100;\n\n\trandom_device rd;\n mt19937 gen(rd());\n\t\/\/ default_random_engine gen;\n\n\tnormal_distribution<double> dist_x(\t\tx, \t\tstd[0]) ;\n\tnormal_distribution<double> dist_y(\t\ty, \t\tstd[1]) ;\n\tnormal_distribution<double> dist_psi(\ttheta, \tstd[2]);\n\n\tweights.resize(num_particles) ;\n\tparticles.resize(num_particles) ;\n\n\tfor (int i = 0; i < num_particles; ++i) {\n\t\t\n\t\tparticles[i].id \t= i ;\n\t\tparticles[i].x \t\t= dist_x(gen) ; \/\/ Add random Gaussian noise to each particle.\n\t\tparticles[i].y \t\t= dist_y(gen) ;\n\t\tparticles[i].theta \t= dist_psi(gen) ;\n\t\tparticles[i].weight = 1.0 ;\n\t\t\/\/ cout << \"Sample \" << i + 1 << \" \" << sample_x << \" \" << sample_y << \" \" << sample_psi << endl;\n\t}\n\n\tis_initialized = true;\n\tcout << \"Initialization complete\" << endl;\n}\n\n\nvoid ParticleFilter::prediction(double delta_t, double std_pos[], double velocity, double yaw_rate) {\n\n\t\/\/ cout << \"start prediction\" << endl;\n\trandom_device rd;\n mt19937 gen(rd());\n\n\tfor (int i = 0; \ti < num_particles; \t\ti++) {\n\t\t\n\t\tconst double theta = particles[i].theta ;\n\n\t\t\/\/ cout << \"Prediction step:\" << i << endl;\n\n\t\t\/\/ Add measurements\n\n\t\tif ( fabs(yaw_rate) > 0.00001) {\t\t\/\/ Turning\n\n\t\t\tconst double velocity_yaw_rate = velocity \/ yaw_rate ;\n\t\t\tconst double yaw_rate_delta_t = yaw_rate * delta_t ;\n\n\t\t\tparticles[i].x \t\t+= velocity_yaw_rate * (sin(theta + yaw_rate_delta_t) - sin(theta)) ;\n\t\t\tparticles[i].y \t\t+= velocity_yaw_rate * (cos(theta) - cos(theta + yaw_rate_delta_t)) ;\n\t\t\tparticles[i].theta \t+= yaw_rate * delta_t ;\n\t\t}\n\n\t\telse {\t\t\/\/ Going straight\n\t\t\t\n\t\t\tconst double velocity_delta_t = velocity * delta_t ;\n\n\t\t\tparticles[i].x += velocity_delta_t * cos(theta) ;\n\t\t\tparticles[i].y += velocity_delta_t * sin(theta) ;\n\t\t\t\/\/ theta excluded as going straight\n\t\t}\n\n\t\t\/\/ add random Gaussian noise\n\t\tnormal_distribution<double> dist_x(\t\tparticles[i].x, \tstd_pos[0]) ;\n\t\tnormal_distribution<double> dist_y(\t\tparticles[i].y, \tstd_pos[1]) ;\n\t\tnormal_distribution<double> dist_psi(\tparticles[i].theta, \tstd_pos[2]);\n\n\t\tparticles[i].x \t\t= dist_x(\tgen) ; \/\/ += since normal_distribution center on 0.\n\t\tparticles[i].y \t\t= dist_y(\tgen) ;\n\t\tparticles[i].theta \t= dist_psi(gen) ;\n\t}\n\t\/\/ cout << \"prediction complete\" << endl;\n}\n\n\n\/\/ IGNORE\nvoid ParticleFilter::dataAssociation( std::vector<LandmarkObs> reasonable_landmarks, \n\t\t\t\t\t\t\t\t\t std::vector<LandmarkObs>& transformed_observations) {\n\n}\n\n\nvoid ParticleFilter::updateWeights(double sensor_range, double std_landmark[], \n\t\tstd::vector<LandmarkObs> observations, Map map_landmarks) {\n\n\t\/\/ cout << \"Starting update weights\" << endl;\n\n\tvector<LandmarkObs> transformed_observations ;\n\tconst int observations_size = observations.size() ;\n\ttransformed_observations.resize(observations_size) ;\n\n\t\/\/ 1. Convert particle observations to global frame\n\tfor (int i = 0; \ti < num_particles; \t\ti++) {\n\n\t\t\/\/ cout << \"Update step: \\t\" << i << endl;\n\n\t\t\/\/ Create placeholder for transformations\n\t\tLandmarkObs single_transformed_observation ;\n\n\t\tfor (int k = 0; \tk < observations_size;\t\tk++) {\n\n\t\t\t\/\/ Pre-compute terms\n\t\t\tconst double particle_theta = particles[i].theta ;\n\t\t\tconst double cos_theta \t\t= cos(particle_theta) ;\n\t\t\tconst double sin_theta \t\t= sin(particle_theta) ; \n\n\t\t\t\/\/ p_x + (obs_x * cos(theta)) - (obs_y * sin(theta))\n\t\t\tsingle_transformed_observation.x = particles[i].x + \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].x * cos_theta) - \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].y * sin_theta) ;\n\n\t\t\t\/\/ p_y + (obs_x * sin(theta)) + (obs_y * cos(theta))\t\t\t\t\t \n\t\t\tsingle_transformed_observation.y = particles[i].y +\n\t\t\t\t\t\t\t\t\t\t\t (observations[k].x * sin_theta) + \n\t\t\t\t\t\t\t\t\t\t\t (observations[k].y * cos_theta) ;\n\n\t\t\ttransformed_observations[k] = single_transformed_observation ;\n\t\t}\n\n\t\t\/\/ cout << transformed_observations.size() << endl;\n\n\t\t\/\/ cout << \"Transformation complete\" << endl;\n\n\t\t\/\/ 2. Only keep landmarks that are within range\n\n\t\t\/\/ reasonable_landmarks \t= landmarks obverserved by particles,\n\t\t\/\/ \t\t\t\t\t\t that are also within sensor range\n\t\t\/\/ transformed_observations = observations transformed \n\t\t\/\/ into global reference frame\n\n\t\tvector<LandmarkObs> reasonable_landmarks ;\n\t\tint landmark_limit = map_landmarks.landmark_list.size() ;\n\t\treasonable_landmarks.resize(transformed_observations.size()) ; \/\/ for debugging\n\n\t\tvector<int> reasonable_particles_landmark_ids ;\n\t\treasonable_particles_landmark_ids.resize(transformed_observations.size()) ;\n\n\n\t\tfor (unsigned int ggg = 0;\tggg < transformed_observations.size();\t ggg++) {\n\t\t\t\n\t\t\tfor (int q = 0;\t\tq < landmark_limit;\t\tq++){\n\n\t\t\t\tconst double landmark_position_x = map_landmarks.landmark_list[q].x_f ;\n\t\t\t\tconst double landmark_position_y = map_landmarks.landmark_list[q].y_f ;\n\t\t\t\t\n\t\t\t\t\/\/ 2.1 Compare particle distance to landmark distance\n\t\t\t\tdouble difference = dist( landmark_position_x, landmark_position_y,\n\t\t\t\t\t\t\t \t transformed_observations[ggg].x, \n\t\t\t\t\t\t\t \t transformed_observations[ggg].y );\n\t\t\t\t\/\/ cout << difference << \" \" << sensor_range << endl; \n\n\t\t\t\t\/\/ 2.2 Only look at landmarks within sensor range\n\t\t\t\tif (difference <= sensor_range) {\n\n\t\t\t\t\tconst int landmark_id = map_landmarks.landmark_list[q].id_i ;\n\t\t\t\t\t\/\/ cout << \"landmark_id\\t\" << landmark_id << endl ;\n\n\t\t\t\t\treasonable_landmarks.push_back( LandmarkObs { landmark_id, \n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t landmark_position_x,\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t landmark_position_y }) ;\n\t\t\t\t}\n\t\t}\n\n\t\t\t\/\/ cout << \"reasonable_landmarks\" << \"\\t\" << reasonable_landmarks[ggg].x \n\t\t\t\/\/ << \",\" << reasonable_landmarks[ggg].y << endl ;\n\t\t}\n\n\t\t\/\/ 3. Associate each predicted measurement to it's closest point\n\t\t\/\/ cout << reasonable_landmarks.size() << \"\\t\" << transformed_observations.size() << endl;\n\t\t\/\/ loop through all observations\n\t\tfor (unsigned int jjj = 0;\tjjj < transformed_observations.size();\t jjj++){\n\n\t\t\tdouble associate_difference ;\n\t\t\tdouble threshold = 9999999.0 ;\n\t\t\tint current_id ;\n\n\t\t\t\/\/ for each observation, compare it to all reasonable landmarks\n\t\t\tfor (unsigned int qqt = 0;\tqqt < reasonable_landmarks.size();\t qqt++){\n\n\t\t\t\/\/ Find the predicted measurement that is closest to each observed measurement\n\t\t\tassociate_difference = dist( reasonable_landmarks[qqt].x, reasonable_landmarks[qqt].y, \n\t\t\t\t\t\t\t transformed_observations[jjj].x, transformed_observations[jjj].y) ;\n\t\t\t\t\n\t\t\t\t\/\/ check if threshold is less than previous\n\t\t\t\tif (associate_difference < threshold) {\n\t\t\t\t\t\n\t\t\t\t\t\/\/ if it is, then we have the current lowest ID\n\t\t\t\t\tcurrent_id = reasonable_landmarks[qqt].id ;\n\n\t\t\t\t\t\/\/ assign the threshold to the current difference\n\t\t\t\t\t\/\/ so that next loop if the difference is higher it won't update the id.\n\t\t\t\t\tthreshold = associate_difference ;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\/\/ assign the id of the correct particle from the observation to a list\t\n\t\t\treasonable_particles_landmark_ids[jjj] = current_id ;\n\t\t\t\/\/ cout << current_id << endl ;\n\t\t\t\/\/ cout << reasonable_particles_landmark_ids[jjj] << endl ;\n\t\t}\n\n\t\t\/\/ cout << \"difference \\t\" << difference << endl ;\n\t\t\/\/ cout << \"reasonable_particles_landmark_ids size: \\t\" << reasonable_particles_landmark_ids.size()\n\t\t\/\/ << \"\\t\" << reasonable_landmarks.size() << endl;\n\t\t\/\/ cout << \"dataAssociation complete, reasonable landmarks size: \" << reasonable_landmarks.size() << endl;\n\n\t\t\/\/ 4. Weight distribution\n\t\t\/\/ Pre compute\n\t\tconst double standard_x \t\t\t= std_landmark[0] ;\n\t\tconst double standard_y \t\t\t= std_landmark[1] ;\n\t\tconst double standard_x_squared_2\t= (standard_x * standard_x) * 2 ;\n\t\tconst double standard_y_squared_2\t= (standard_y * standard_y) * 2;\n\t\tconst double part_1 \t\t\t\t= 1 \/ (2 * M_PI * standard_x * standard_y) ;\n\t\t\/\/ cout << part_1 << endl;\n\t\t\/\/cout << reasonable_landmarks.size() << \"\\t\" << transformed_observations.size() << endl;\n\n\t\tdouble weight_placeholder = 1.0 ;\n\t\t\/\/ if reasonable landmarks have been found\n\t\tif (reasonable_landmarks.size() > 0) {\n\n\t\t\t\/\/ cout << reasonable_particles_landmark_ids.size() << \"\\t\" << transformed_observations.size() << endl;\n\n\t\t\tfor (unsigned int zzz = 0; \tzzz < transformed_observations.size();\tzzz++) {\n\n\t\t\t\tconst int r_p_index\t\t\t= reasonable_particles_landmark_ids[zzz] ;\n\t\t\t\tconst double x \t\t\t\t= transformed_observations[zzz].x ;\n\t\t\t\tconst double u_x \t\t\t= reasonable_landmarks[r_p_index].x ;\n\t\t\t\tconst double y \t\t\t \t= transformed_observations[zzz].y ;\n\t\t\t\tconst double u_y \t\t \t= reasonable_landmarks[r_p_index].y ;\n\t\t\t\tconst double x_ux_squared \t= (x - u_x) * (x - u_x) ;\n\t\t\t\tconst double y_uy_squared \t= (y - u_y) * (y - u_y) ;\n\t\t\t\tconst double part_2 \t\t= x_ux_squared \/ (standard_x_squared_2) +\n\t\t\t\t\t\t\t\t\t \t\t y_uy_squared \/ (standard_y_squared_2) ;\n\t\t\t\tdouble exp_part_2\t\t\t= exp(-part_2) ;\n\n\n\t\t\t\t\/\/ cout << \"transformed_observations\\t\" << x << \",\" << y <<\n\t\t\t\t\/\/ \"\\t reasonable_landmarks\\t\" << u_x << \",\" << u_y << endl ;\n\n\t\t\t\t\/\/ cout << weight_placeholder << endl;\n\t\t\t\t\/\/ cout << part_2 << \"\\t\" << exp_part_2 << endl;\n\n\t\t\t\tif (exp_part_2 < .00001) {\n\t\t\t\t\texp_part_2 = .00001;\n\t\t\t\t}\n\n\t\t\t\tweight_placeholder *= part_1 * exp_part_2 ;\n\n\t\t\t\t\/\/ cout << weight_placeholder << endl;\n\t\t\t\t\/\/ cout << \"x \" << x << \"\\tu_x \" << u_x << \"\\ty \" << y << \"\\tu_y \" << u_y << endl ;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tweights[i] \t\t\t= 0.00001 ;\n\t\t\tparticles[i].weight = 0.00001 ;\n\t\t\tcout << \"No reasonable landmarks\" << endl;\n\t\t}\n\n\t\tweights[i] \t\t\t= weight_placeholder ;\n\t\tparticles[i].weight = weight_placeholder ;\n\t\t\/\/ cout << \"Weight update complete\" << endl;\n\t}\n}\n\nvoid ParticleFilter::resample() {\n\t\/\/ Resample particles with replacement with probability proportional to their weight.\n\t\/\/ cout << \"Resample started \" << \" \" << particles.size() << endl;\n\n\t\/\/ from http:\/\/en.cppreference.com\/w\/cpp\/numeric\/random\/discrete_distribution\n random_device rd;\n mt19937 gen(rd());\n\tdiscrete_distribution<> d(weights.begin(), weights.end());\n\n\t\/\/ cout << \"Number of particles \\t\" << num_particles << endl;\n\n\tvector<Particle> resampled_particles ;\n\tresampled_particles.resize(num_particles) ;\n\n for(int n = 0;\tn < num_particles;\tn++) {\n\n \t\/\/ cout << \"Resample step: \\t\" << n << endl;\n \tint new_index = d(gen);\n \t\/\/ cout << new_index << endl ;\n resampled_particles[n] = particles[new_index];\n }\n \/\/ cout << \"Resample complete\" << endl;\n particles = resampled_particles ;\n}\n\nvoid ParticleFilter::write(std::string filename) {\n\t\/\/ You don't need to modify this file.\n\tstd::ofstream dataFile;\n\tdataFile.open(filename, std::ios::app);\n\tfor (int i = 0; i < num_particles; ++i) {\n\t\tdataFile << particles[i].x << \" \" << particles[i].y << \" \" << particles[i].theta << \"\\n\";\n\t}\n\tdataFile.close();\n}\n<|endoftext|>"} {"text":"<commit_before><commit_msg>Attempt to fix flakey test.<commit_after><|endoftext|>"} {"text":"<commit_before>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2013 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <xenia\/kernel\/xboxkrnl_audio.h>\n\n#include <xenia\/emulator.h>\n#include <xenia\/apu\/apu.h>\n#include <xenia\/kernel\/kernel_state.h>\n#include <xenia\/kernel\/xboxkrnl_private.h>\n#include <xenia\/kernel\/util\/shim_utils.h>\n\n\nusing namespace xe;\nusing namespace xe::apu;\nusing namespace xe::kernel;\nusing namespace xe::kernel::xboxkrnl;\n\n\nnamespace xe {\nnamespace kernel {\n\n\nSHIM_CALL XMACreateContext_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t context_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XMACreateContext(%.8X)\",\n context_ptr);\n\n \/\/ TODO(benvanik): allocate and return -- see if size required or just dummy?\n\n SHIM_SET_RETURN(X_ERROR_ACCESS_DENIED);\n}\n\n\nSHIM_CALL XMAReleaseContext_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t context_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XMAReleaseContext(%.8X)\",\n context_ptr);\n\n \/\/ TODO(benvanik): free\n}\n\n\nSHIM_CALL XAudioGetVoiceCategoryVolume_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t unk_0 = SHIM_GET_ARG_32(0);\n uint32_t out_ptr = SHIM_GET_ARG_32(1);\n\n XELOGD(\n \"XAudioGetVoiceCategoryVolume(%.8X, %.8X)\",\n unk_0, out_ptr);\n\n \/\/ Expects a floating point single. Volume %?\n SHIM_SET_MEM_32(out_ptr, 0);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioGetSpeakerConfig_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t config_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XAudioGetSpeakerConfig(%.8X)\",\n config_ptr);\n\n SHIM_SET_MEM_32(config_ptr, 1);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioRegisterRenderDriverClient_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t callback_ptr = SHIM_GET_ARG_32(0);\n uint32_t driver_ptr = SHIM_GET_ARG_32(1);\n\n uint32_t callback = SHIM_MEM_32(callback_ptr + 0);\n uint32_t callback_arg = SHIM_MEM_32(callback_ptr + 4);\n\n XELOGD(\n \"XAudioRegisterRenderDriverClient(%.8X(%.8X, %.8X), %.8X)\",\n callback_ptr, callback, callback_arg, driver_ptr);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->RegisterClient(callback, callback_arg);\n\n SHIM_SET_MEM_32(driver_ptr, 0xAADD1100);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioUnregisterRenderDriverClient_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XAudioUnregisterRenderDriverClient(%.8X)\",\n driver_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->UnregisterClient();\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioSubmitRenderDriverFrame_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n uint32_t samples_ptr = SHIM_GET_ARG_32(1);\n\n XELOGD(\n \"XAudioSubmitRenderDriverFrame(%.8X, %.8X)\",\n driver_ptr, samples_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->SubmitFrame(samples_ptr);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\n} \/\/ namespace kernel\n} \/\/ namespace xe\n\n\nvoid xe::kernel::xboxkrnl::RegisterAudioExports(\n ExportResolver* export_resolver, KernelState* state) {\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMACreateContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAInitializeContext, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAReleaseContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAEnableContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMADisableContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetOutputBufferWriteOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetOutputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetOutputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetOutputBufferValid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsOutputBufferValid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer0Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsInputBuffer0Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer1Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsInputBuffer1Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer0, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer1, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetPacketMetadata, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMABlockWhileInUse, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetLoopData, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetInputBufferReadOffset, state);\n\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioGetVoiceCategoryVolume, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioGetSpeakerConfig, state);\n\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioRegisterRenderDriverClient, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioUnregisterRenderDriverClient, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioSubmitRenderDriverFrame, state);\n}\n<commit_msg>XAudioGetVoiceCategoryVolumeChangeMask<commit_after>\/**\n ******************************************************************************\n * Xenia : Xbox 360 Emulator Research Project *\n ******************************************************************************\n * Copyright 2013 Ben Vanik. All rights reserved. *\n * Released under the BSD license - see LICENSE in the root for more details. *\n ******************************************************************************\n *\/\n\n#include <xenia\/kernel\/xboxkrnl_audio.h>\n\n#include <xenia\/emulator.h>\n#include <xenia\/apu\/apu.h>\n#include <xenia\/kernel\/kernel_state.h>\n#include <xenia\/kernel\/xboxkrnl_private.h>\n#include <xenia\/kernel\/util\/shim_utils.h>\n\n\nusing namespace xe;\nusing namespace xe::apu;\nusing namespace xe::kernel;\nusing namespace xe::kernel::xboxkrnl;\n\n\nnamespace xe {\nnamespace kernel {\n\n\nSHIM_CALL XMACreateContext_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t context_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XMACreateContext(%.8X)\",\n context_ptr);\n\n \/\/ TODO(benvanik): allocate and return -- see if size required or just dummy?\n\n SHIM_SET_RETURN(X_ERROR_ACCESS_DENIED);\n}\n\n\nSHIM_CALL XMAReleaseContext_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t context_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XMAReleaseContext(%.8X)\",\n context_ptr);\n\n \/\/ TODO(benvanik): free\n}\n\n\nSHIM_CALL XAudioGetSpeakerConfig_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t config_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XAudioGetSpeakerConfig(%.8X)\",\n config_ptr);\n\n SHIM_SET_MEM_32(config_ptr, 1);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioGetVoiceCategoryVolumeChangeMask_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n uint32_t out_ptr = SHIM_GET_ARG_32(1);\n\n XELOGD(\n \"XAudioGetVoiceCategoryVolumeChangeMask(%.8X, %.8X)\",\n driver_ptr, out_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n \/\/ Checking these bits to see if any voice volume changed.\n \/\/ I think.\n SHIM_SET_MEM_32(out_ptr, 0);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioGetVoiceCategoryVolume_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n uint32_t out_ptr = SHIM_GET_ARG_32(1);\n\n XELOGD(\n \"XAudioGetVoiceCategoryVolume(%.8X, %.8X)\",\n driver_ptr, out_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n \/\/ Expects a floating point single. Volume %?\n SHIM_SET_MEM_32(out_ptr, 0);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioRegisterRenderDriverClient_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t callback_ptr = SHIM_GET_ARG_32(0);\n uint32_t driver_ptr = SHIM_GET_ARG_32(1);\n\n uint32_t callback = SHIM_MEM_32(callback_ptr + 0);\n uint32_t callback_arg = SHIM_MEM_32(callback_ptr + 4);\n\n XELOGD(\n \"XAudioRegisterRenderDriverClient(%.8X(%.8X, %.8X), %.8X)\",\n callback_ptr, callback, callback_arg, driver_ptr);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->RegisterClient(callback, callback_arg);\n\n SHIM_SET_MEM_32(driver_ptr, 0xAADD1100);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioUnregisterRenderDriverClient_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n\n XELOGD(\n \"XAudioUnregisterRenderDriverClient(%.8X)\",\n driver_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->UnregisterClient();\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\nSHIM_CALL XAudioSubmitRenderDriverFrame_shim(\n PPCContext* ppc_state, KernelState* state) {\n uint32_t driver_ptr = SHIM_GET_ARG_32(0);\n uint32_t samples_ptr = SHIM_GET_ARG_32(1);\n\n XELOGD(\n \"XAudioSubmitRenderDriverFrame(%.8X, %.8X)\",\n driver_ptr, samples_ptr);\n\n XEASSERT(driver_ptr == 0xAADD1100);\n\n auto audio_system = state->emulator()->audio_system();\n audio_system->SubmitFrame(samples_ptr);\n\n SHIM_SET_RETURN(X_ERROR_SUCCESS);\n}\n\n\n} \/\/ namespace kernel\n} \/\/ namespace xe\n\n\nvoid xe::kernel::xboxkrnl::RegisterAudioExports(\n ExportResolver* export_resolver, KernelState* state) {\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMACreateContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAInitializeContext, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAReleaseContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAEnableContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMADisableContext, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetOutputBufferWriteOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetOutputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetOutputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetOutputBufferValid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsOutputBufferValid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer0Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsInputBuffer0Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer1Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAIsInputBuffer1Valid, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer0, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBuffer1, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetPacketMetadata, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMABlockWhileInUse, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetLoopData, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMASetInputBufferReadOffset, state);\n \/\/ SHIM_SET_MAPPING(\"xboxkrnl.exe\", XMAGetInputBufferReadOffset, state);\n\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioGetSpeakerConfig, state);\n\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioGetVoiceCategoryVolumeChangeMask, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioGetVoiceCategoryVolume, state);\n\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioRegisterRenderDriverClient, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioUnregisterRenderDriverClient, state);\n SHIM_SET_MAPPING(\"xboxkrnl.exe\", XAudioSubmitRenderDriverFrame, state);\n}\n<|endoftext|>"} {"text":"<commit_before>#include <string.h>\r\n#include <windows.h>\r\n#include <shellapi.h>\r\n#include \"..\/Daemon.h\"\r\n#include \"Win32App.h\"\r\n\r\n#define ID_ABOUT 2000\r\n#define ID_EXIT 2001\r\n\r\nvoid ShowPopupMenu (HWND hWnd, POINT *curpos, int wDefaultItem)\r\n{\r\n HMENU hPopup = CreatePopupMenu();\r\n InsertMenu (hPopup, 0, MF_BYPOSITION | MF_STRING, ID_ABOUT, \"About...\");\r\n InsertMenu (hPopup, 1, MF_BYPOSITION | MF_STRING, ID_EXIT , \"Exit\");\r\n SetMenuDefaultItem (hPopup, ID_ABOUT, FALSE);\r\n SetFocus (hWnd);\r\n SendMessage (hWnd, WM_INITMENUPOPUP, (WPARAM)hPopup, 0);\r\n\r\n POINT p;\r\n if (!curpos)\r\n {\r\n GetCursorPos (&p);\r\n curpos = &p;\r\n }\r\n\r\n WORD cmd = TrackPopupMenu (hPopup, TPM_LEFTALIGN | TPM_RIGHTBUTTON | TPM_RETURNCMD | TPM_NONOTIFY, curpos->x, curpos->y, 0, hWnd, NULL);\r\n SendMessage (hWnd, WM_COMMAND, cmd, 0);\r\n\r\n DestroyMenu(hPopup);\r\n}\r\n\r\nvoid AddTrayIcon (HWND hWnd, UINT uID, UINT uCallbackMsg, UINT uIcon)\r\n{\r\n NOTIFYICONDATA nid;\r\n nid.hWnd = hWnd;\r\n nid.uID = uID;\r\n nid.uFlags = NIF_ICON | NIF_MESSAGE | NIF_TIP;\r\n nid.uCallbackMessage = uCallbackMsg;\r\n nid.hIcon = LoadIcon (GetModuleHandle(NULL), IDI_APPLICATION);\r\n strcpy (nid.szTip, \"i2pd\");\r\n Shell_NotifyIcon(NIM_ADD, &nid );\r\n}\r\n\r\nvoid RemoveTrayIcon (HWND hWnd, UINT uID)\r\n{\r\n NOTIFYICONDATA nid;\r\n nid.hWnd = hWnd;\r\n nid.uID = uID;\r\n Shell_NotifyIcon (NIM_DELETE, &nid);\r\n}\r\n\r\nstatic LRESULT CALLBACK WndProc (HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\r\n{\r\n switch (uMsg)\r\n {\r\n case WM_CREATE:\r\n {\r\n AddTrayIcon (hWnd, 1, WM_APP, 0);\r\n return 0;\r\n }\r\n case WM_CLOSE:\r\n {\r\n RemoveTrayIcon (hWnd, 1);\r\n PostQuitMessage (0);\r\n return DefWindowProc (hWnd, uMsg, wParam, lParam);\r\n }\r\n case WM_COMMAND:\r\n {\r\n switch (LOWORD(wParam))\r\n {\r\n case ID_ABOUT:\r\n {\r\n MessageBox( hWnd, TEXT(\"i2pd\"), TEXT(\"About\"), MB_ICONINFORMATION | MB_OK );\r\n return 0;\r\n }\r\n case ID_EXIT:\r\n {\r\n PostMessage (hWnd, WM_CLOSE, 0, 0);\r\n return 0;\r\n }\r\n }\r\n break;\r\n }\r\n case WM_APP:\r\n {\r\n switch (lParam)\r\n {\r\n case WM_RBUTTONUP:\r\n {\r\n SetForegroundWindow (hWnd);\r\n ShowPopupMenu(hWnd, NULL, -1);\r\n PostMessage (hWnd, WM_APP + 1, 0, 0);\r\n return 0;\r\n }\r\n }\r\n break;\r\n }\r\n }\r\n return DefWindowProc( hWnd, uMsg, wParam, lParam);\r\n}\r\n\r\n int WINAPI WinMain (HINSTANCE hInst, HINSTANCE prev, LPSTR cmdline, int show)\r\n {\r\n \/\/ check if tunning already\r\n if (FindWindow (I2PD_WIN32_CLASSNAME, TEXT(\"i2pd\")))\r\n {\r\n MessageBox(NULL, TEXT(\"I2Pd is running already\"), TEXT(\"Warning\"), MB_OK);\r\n return 0;\r\n }\r\n \/\/ register main window\r\n WNDCLASSEX wclx;\r\n memset (&wclx, 0, sizeof(wclx));\r\n wclx.cbSize = sizeof(wclx);\r\n wclx.style = 0;\r\n wclx.lpfnWndProc = &WndProc;\r\n wclx.cbClsExtra = 0;\r\n wclx.cbWndExtra = 0;\r\n wclx.hInstance = hInst;\r\n wclx.hIcon = LoadIcon (hInst, IDI_APPLICATION);\r\n wclx.hIconSm = LoadIcon (hInst, IDI_APPLICATION);\r\n wclx.hCursor = LoadCursor (NULL, IDC_ARROW);\r\n wclx.hbrBackground = (HBRUSH)(COLOR_BTNFACE + 1);\r\n wclx.lpszMenuName = NULL;\r\n wclx.lpszClassName = I2PD_WIN32_CLASSNAME;\r\n RegisterClassEx (&wclx);\r\n \/\/ create new window\r\n if (!CreateWindow(I2PD_WIN32_CLASSNAME, TEXT(\"i2pd\"), WS_OVERLAPPEDWINDOW | WS_VISIBLE, 100, 100, 250, 150, NULL, NULL, hInst, NULL))\r\n {\r\n MessageBox(NULL, \"Failed to create main window\", TEXT(\"Warning!\"), MB_ICONERROR | MB_OK | MB_TOPMOST);\r\n return 1;\r\n }\r\n\r\n \/\/ init\r\n char * argv[] = { (char *)\"i2pd\" };\r\n Daemon.init(sizeof (argv)\/sizeof (argv[0]), argv);\r\n \/\/ start\r\n Daemon.start ();\r\n \/\/ main loop\r\n MSG msg;\r\n while (GetMessage (&msg, NULL, 0, 0 ))\r\n {\r\n TranslateMessage (&msg);\r\n DispatchMessage (&msg);\r\n }\r\n \/\/ atop\r\n Daemon.stop ();\r\n \/\/ terminate\r\n UnregisterClass (I2PD_WIN32_CLASSNAME, hInst);\r\n return msg.wParam;\r\n }\r\n<commit_msg>set correct icons<commit_after>#include <string.h>\r\n#include <windows.h>\r\n#include <shellapi.h>\r\n\/\/#include \"..\/Daemon.h\"\r\n#include \"resource.h\"\r\n#include \"Win32App.h\"\r\n\r\n#define ID_ABOUT 2000\r\n#define ID_EXIT 2001\r\n\r\n#define ID_TRAY_ICON 2050\r\n#define WM_TRAYICON (WM_USER + 1)\r\n\r\nvoid ShowPopupMenu (HWND hWnd, POINT *curpos, int wDefaultItem)\r\n{\r\n HMENU hPopup = CreatePopupMenu();\r\n InsertMenu (hPopup, 0, MF_BYPOSITION | MF_STRING, ID_ABOUT, \"About...\");\r\n InsertMenu (hPopup, 1, MF_BYPOSITION | MF_STRING, ID_EXIT , \"Exit\");\r\n SetMenuDefaultItem (hPopup, ID_ABOUT, FALSE);\r\n SetFocus (hWnd);\r\n SendMessage (hWnd, WM_INITMENUPOPUP, (WPARAM)hPopup, 0);\r\n\r\n POINT p;\r\n if (!curpos)\r\n {\r\n GetCursorPos (&p);\r\n curpos = &p;\r\n }\r\n\r\n WORD cmd = TrackPopupMenu (hPopup, TPM_LEFTALIGN | TPM_RIGHTBUTTON | TPM_RETURNCMD | TPM_NONOTIFY, curpos->x, curpos->y, 0, hWnd, NULL);\r\n SendMessage (hWnd, WM_COMMAND, cmd, 0);\r\n\r\n DestroyMenu(hPopup);\r\n}\r\n\r\nvoid AddTrayIcon (HWND hWnd)\r\n{\r\n NOTIFYICONDATA nid;\r\n memset(&nid, 0, sizeof(nid));\r\n nid.cbSize = sizeof(nid);\r\n nid.hWnd = hWnd;\r\n nid.uID = ID_TRAY_ICON;\r\n nid.uFlags = NIF_ICON | NIF_MESSAGE | NIF_TIP;\r\n nid.uCallbackMessage = WM_TRAYICON;\r\n \/\/ TODO: must set correct icon\r\n \/\/ nid.hIcon = LoadIcon (GetModuleHandle(NULL), MAKEINTRESOURCE (IDI_ICON1));\r\n {\r\n char szIconFile[512];\r\n\r\n GetSystemDirectory( szIconFile, sizeof( szIconFile ) );\r\n if ( szIconFile[ strlen( szIconFile ) - 1 ] != '\\\\' )\r\n strcat( szIconFile, \"\\\\\" );\r\n strcat( szIconFile, \"shell32.dll\" );\r\n \/\/ Icon #23 (0-indexed) in shell32.dll is a \"help\" icon.\r\n ExtractIconEx( szIconFile, 23, NULL, &(nid.hIcon), 1 );\r\n }\r\n strcpy (nid.szTip, \"i2pd\");\r\n Shell_NotifyIcon(NIM_ADD, &nid );\r\n}\r\n\r\nvoid RemoveTrayIcon (HWND hWnd)\r\n{\r\n NOTIFYICONDATA nid;\r\n nid.hWnd = hWnd;\r\n nid.uID = ID_TRAY_ICON;\r\n Shell_NotifyIcon (NIM_DELETE, &nid);\r\n}\r\n\r\nstatic LRESULT CALLBACK WndProc (HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)\r\n{\r\n switch (uMsg)\r\n {\r\n case WM_CREATE:\r\n {\r\n AddTrayIcon (hWnd);\r\n break;\r\n }\r\n case WM_CLOSE:\r\n {\r\n RemoveTrayIcon (hWnd);\r\n PostQuitMessage (0);\r\n break;\r\n }\r\n case WM_COMMAND:\r\n {\r\n switch (LOWORD(wParam))\r\n {\r\n case ID_ABOUT:\r\n {\r\n MessageBox( hWnd, TEXT(\"i2pd\"), TEXT(\"About\"), MB_ICONINFORMATION | MB_OK );\r\n return 0;\r\n }\r\n case ID_EXIT:\r\n {\r\n PostMessage (hWnd, WM_CLOSE, 0, 0);\r\n return 0;\r\n }\r\n }\r\n break;\r\n }\r\n case WM_TRAYICON:\r\n {\r\n SetForegroundWindow (hWnd);\r\n switch (lParam)\r\n {\r\n case WM_RBUTTONUP:\r\n {\r\n SetForegroundWindow (hWnd);\r\n ShowPopupMenu(hWnd, NULL, -1);\r\n PostMessage (hWnd, WM_APP + 1, 0, 0);\r\n break;\r\n }\r\n }\r\n break;\r\n }\r\n }\r\n return DefWindowProc( hWnd, uMsg, wParam, lParam);\r\n}\r\n\r\n int WINAPI WinMain (HINSTANCE hInst, HINSTANCE prev, LPSTR cmdline, int show)\r\n {\r\n \/\/ check if tunning already\r\n if (FindWindow (I2PD_WIN32_CLASSNAME, TEXT(\"i2pd\")))\r\n {\r\n MessageBox(NULL, TEXT(\"I2Pd is running already\"), TEXT(\"Warning\"), MB_OK);\r\n return 0;\r\n }\r\n \/\/ register main window\r\n WNDCLASSEX wclx;\r\n memset (&wclx, 0, sizeof(wclx));\r\n wclx.cbSize = sizeof(wclx);\r\n wclx.style = 0;\r\n wclx.lpfnWndProc = WndProc;\r\n wclx.cbClsExtra = 0;\r\n wclx.cbWndExtra = 0;\r\n wclx.hInstance = hInst;\r\n wclx.hIcon = LoadIcon (hInst, MAKEINTRESOURCE (IDI_ICON1));\r\n wclx.hIconSm = LoadIcon (hInst, MAKEINTRESOURCE (IDI_ICON1));\r\n wclx.hCursor = LoadCursor (NULL, IDC_ARROW);\r\n wclx.hbrBackground = (HBRUSH)(COLOR_BTNFACE + 1);\r\n wclx.lpszMenuName = NULL;\r\n wclx.lpszClassName = I2PD_WIN32_CLASSNAME;\r\n RegisterClassEx (&wclx);\r\n \/\/ create new window\r\n if (!CreateWindow(I2PD_WIN32_CLASSNAME, TEXT(\"i2pd\"), WS_OVERLAPPEDWINDOW | WS_VISIBLE, 100, 100, 250, 150, NULL, NULL, hInst, NULL))\r\n {\r\n MessageBox(NULL, \"Failed to create main window\", TEXT(\"Warning!\"), MB_ICONERROR | MB_OK | MB_TOPMOST);\r\n return 1;\r\n }\r\n\r\n \/* \/\/ init\r\n char * argv[] = { (char *)\"i2pd\" };\r\n Daemon.init(sizeof (argv)\/sizeof (argv[0]), argv);\r\n \/\/ start\r\n Daemon.start ();*\/\r\n \/\/ main loop\r\n MSG msg;\r\n while (GetMessage (&msg, NULL, 0, 0 ))\r\n {\r\n TranslateMessage (&msg);\r\n DispatchMessage (&msg);\r\n }\r\n \/* \/\/ atop\r\n Daemon.stop ();*\/\r\n \/\/ terminate\r\n UnregisterClass (I2PD_WIN32_CLASSNAME, hInst);\r\n return msg.wParam;\r\n }\r\n<|endoftext|>"} {"text":"<commit_before>\/* router_integration_test.cc\n Jeremy Barnes, 21 November 2012\n Copyright (c) 2012 Datacratic. All rights reserved.\n\n Overall integration test for the router stack.\n*\/\n\n#include \"augmentor_ex.h\"\n\n#include \"rtbkit\/core\/router\/router.h\"\n#include \"rtbkit\/core\/post_auction\/post_auction_loop.h\"\n#include \"rtbkit\/core\/agent_configuration\/agent_configuration_service.h\"\n#include \"rtbkit\/core\/banker\/master_banker.h\"\n#include \"rtbkit\/core\/banker\/slave_banker.h\"\n#include \"jml\/utils\/rng.h\"\n#include \"rtbkit\/core\/monitor\/monitor.h\"\n#include \"jml\/utils\/pair_utils.h\"\n#include \"jml\/utils\/environment.h\"\n#include \"jml\/arch\/timers.h\"\n#include \"soa\/service\/testing\/redis_temporary_server.h\"\n#include \"testing\/generic_exchange_connector.h\"\n#include \"testing\/mock_exchange.h\"\n#include \"rtbkit\/testing\/test_agent.h\"\n#include <boost\/thread.hpp>\n#include <netdb.h>\n#include <memory>\n\n\nusing namespace std;\nusing namespace ML;\nusing namespace Redis;\nusing namespace Datacratic;\nusing namespace RTBKIT;\n\n\n\/******************************************************************************\/\n\/* COMPONENTS *\/\n\/******************************************************************************\/\n\n\/** Initializes the various components of the RTBKit stack. *\/\nstruct Components\n{\n\n std::shared_ptr<ServiceProxies> proxies;\n\n \/\/ See init for an inline description of the various components.\n\n RedisTemporaryServer redis;\n Router router1, router2;\n PostAuctionLoop postAuctionLoop;\n MasterBanker masterBanker;\n SlaveBudgetController budgetController;\n AgentConfigurationService agentConfig;\n Monitor monitor;\n MonitorProviderProxy monitorProxy;\n TestAgent agent;\n FrequencyCapAugmentor augmentor;\n\n \/\/ \\todo Add a PAL event subscriber.\n\n vector<unique_ptr<GenericExchangeConnector> > exchangeConnectors;\n vector<int> exchangePorts;\n\n\n Components(std::shared_ptr<ServiceProxies> proxies)\n : proxies(proxies),\n router1(proxies, \"router1\"),\n router2(proxies, \"router2\"),\n postAuctionLoop(proxies, \"pas1\"),\n masterBanker(proxies, \"masterBanker\"),\n agentConfig(proxies, \"agentConfigurationService\"),\n monitor(proxies, \"monitor\"),\n monitorProxy(proxies->zmqContext, monitor),\n agent(proxies, \"agent1\"),\n augmentor(proxies, \"frequency-cap-ex\")\n {\n }\n\n void shutdown()\n {\n router1.shutdown();\n router2.shutdown();\n postAuctionLoop.shutdown();\n\n budgetController.shutdown();\n masterBanker.shutdown();\n\n agent.shutdown();\n augmentor.shutdown();\n agentConfig.shutdown();\n\n monitorProxy.shutdown();\n monitor.shutdown();\n\n cerr << \"done shutdown\" << endl;\n }\n\n void init()\n {\n const string agentUri = \"tcp:\/\/127.0.0.1:1234\";\n\n \/\/ Setup a monitor which ensures that any instability in the system will\n \/\/ throttle the bid request stream. In other words, it ensures you won't\n \/\/ go bankrupt.\n monitor.init();\n monitor.bindTcp();\n monitor.start();\n\n \/\/ Setup and agent configuration service which is used to notify all\n \/\/ interested services of changes to the agent configuration.\n agentConfig.init();\n agentConfig.bindTcp();\n agentConfig.start();\n\n \/\/ Setup a master banker used to keep the canonical budget of the\n \/\/ various bidding agent accounts. The data contained in this service is\n \/\/ periodically persisted to redis.\n masterBanker.init(std::make_shared<RedisBankerPersistence>(redis));\n masterBanker.bindTcp();\n masterBanker.start();\n\n \/\/ Setup a slave banker that we can use to manipulate and peak at the\n \/\/ budgets during the test.\n budgetController.init(proxies->config);\n budgetController.start();\n\n \/\/ Each router contains a slave masterBanker which is periodically\n \/\/ synced with the master banker.\n auto makeSlaveBanker = [=] (const std::string & name)\n {\n auto res = std::make_shared<SlaveBanker>\n (proxies->zmqContext, proxies->config, name);\n res->start();\n return res;\n };\n\n \/\/ Setup a post auction loop (PAL) which handles all exchange events\n \/\/ that don't need to be processed in real-time (wins, loss, etc).\n postAuctionLoop.init();\n postAuctionLoop.setBanker(makeSlaveBanker(\"pas1\"));\n postAuctionLoop.bindTcp();\n postAuctionLoop.start();\n\n \/\/ Setup two routers which will manage the bid request stream coming\n \/\/ from the exchange, the augmentations coming from the augmentors (to\n \/\/ be added to the test) and the bids coming from the agents. Along the\n \/\/ way it also applies various filters based on agent configuration\n \/\/ while ensuring that all the real-time constraints are respected.\n\n router1.init();\n router1.setBanker(makeSlaveBanker(\"router1\"));\n router1.bindTcp();\n router1.start();\n\n router2.init();\n router2.setBanker(makeSlaveBanker(\"router2\"));\n router2.bindTcp();\n router2.start();\n\n\n \/\/ Setup an exchange connector for each router which will act as the\n \/\/ middle men between the exchange and the router.\n\n exchangeConnectors.emplace_back(\n new GenericExchangeConnector(&router1, Json::Value()));\n\n exchangeConnectors.emplace_back(\n new GenericExchangeConnector(&router2, Json::Value()));\n\n for (auto& connector : exchangeConnectors) {\n connector->enableUntil(Date::positiveInfinity());\n\n int port = connector->init(-1, \"localhost\", 2 \/* threads *\/);\n exchangePorts.push_back(port);\n }\n\n \/\/ monitorProxy queries all specified services once per second and\n \/\/ feeds the Monitor with the aggregate result\n monitorProxy.init(proxies->config,\n {\"router1\", \"router2\", \"pas1\", \"masterBanker\"});\n monitorProxy.start();\n\n \/\/ Our bidding agent which listens to the bid request stream from all\n \/\/ available routers and decide who gets to see your awesome pictures of\n \/\/ kittens.\n agent.start(agentUri, \"test-agent\");\n agent.configure();\n\n \/\/ Our augmentor which does frequency capping for our agent.\n augmentor.init();\n augmentor.start();\n }\n};\n\n\n\/******************************************************************************\/\n\/* SETUP *\/\n\/******************************************************************************\/\n\nvoid setupAgent(TestAgent& agent)\n{\n \/\/ Set our frequency cap to 42. This has two effects: 1) it instructs the\n \/\/ router that we want bid requests destined for our agent to first be\n \/\/ augmented with frequency capping information and 2) it instructs our\n \/\/ augmentor to place the pass-frequency-cap-ex tag on our bid request if\n \/\/ our agent has seen a given user less then 42 times.\n agent.config.addAugmentation(\"frequency-cap-ex\", Json::Value(42));\n\n \/\/ Instructs the router to only keep bid requests that have this tag. In\n \/\/ other words keep only the bid requests that haven't reached our frequency\n \/\/ cap limit.\n agent.config.augmentationFilter.include.push_back(\"pass-frequency-cap-ex\");\n\n \/\/ This lambda implements our incredibly sophisticated bidding strategy.\n agent.onBidRequest = [&] (\n double timestamp,\n const Id & id,\n std::shared_ptr<BidRequest> br,\n const Json::Value & spots,\n double timeLeftMs,\n const Json::Value & augmentations)\n {\n Json::Value response;\n response[0][\"creative\"] = spots[0][\"creatives\"][0];\n response[0][\"price\"] = 10000;\n response[0][\"priority\"] = 1;\n\n Json::Value metadata;\n agent.doBid(id, response, metadata);\n\n ML::atomic_inc(agent.numBidRequests);\n };\n}\n\n\n\/** Transfer a given budget to each router for a given account. *\/\nvoid allocateBudget(\n SlaveBudgetController& budgetController,\n const AccountKey& account,\n Amount budget)\n{\n budgetController.addAccountSync(account);\n budgetController.setBudgetSync(account[0], budget);\n budgetController.topupTransferSync(account, USD(10));\n\n cerr << budgetController.getAccountSummarySync(account[0], -1) << endl;\n\n \/\/ Syncing is done periodically so we have to wait a bit before the router\n \/\/ will have a budget available. Necessary because the bid request stream\n \/\/ for this test isn't infinit.\n cerr << \"sleeping so that the slave accounts can sync up\" << endl;\n ML::sleep(2.1);\n\n auto summary = budgetController.getAccountSummarySync(account[0], -1);\n cerr << summary << endl;\n\n ExcAssertEqual(\n summary.subAccounts[\"testStrategy\"].subAccounts[\"router1\"].budget,\n USD(0.10));\n\n ExcAssertEqual(\n summary.subAccounts[\"testStrategy\"].subAccounts[\"router2\"].budget,\n USD(0.10));\n}\n\n\/** Some debugging output for the banker. *\/\nvoid dumpAccounts(\n SlaveBudgetController& budgetController,\n const AccountKey & name, const AccountSummary & a)\n{\n cerr << name << \": \" << endl;\n cerr << budgetController.getAccountSync(name) << endl;\n\n for (auto & sub: a.subAccounts) {\n dumpAccounts(budgetController, name.childKey(sub.first), sub.second);\n }\n};\n\n\n\/******************************************************************************\/\n\/* MAIN *\/\n\/******************************************************************************\/\n\n\/** Small example problem that spins up the various components of the RTBKit\n stack, sends a bunch of bid requests through it then print some stats.\n\n *\/\nint main(int argc, char ** argv)\n{\n \/\/ Controls the length of the test.\n enum {\n nExchangeThreads = 10,\n nBidRequestsPerThread = 200\n };\n\n auto proxies = std::make_shared<ServiceProxies>();\n\n \/\/ If we had a zookeeper instance running, we could use it to do service\n \/\/ discovery. Since we don't, ServiceProxies will just default to using a\n \/\/ local service map.\n if (false) proxies->useZookeeper(\"zookeeper.datacratic.com\", \"stats\");\n\n \/\/ If we had a carbon instance running, we could use it to log events. Since\n \/\/ we don't, ServiceProxies will just default to using a local equivalent.\n if (false) proxies->logToCarbon(\"carbon.datacratic.com\", \"stats\");\n\n\n \/\/ Setups up the various component of the RTBKit stack. See Components::init\n \/\/ for more details.\n Components components(proxies);\n components.init();\n\n \/\/ Some extra customization for our agent to make it extra special. See\n \/\/ setupAgent for more details.\n setupAgent(components.agent);\n\n \/\/ Setup an initial budgeting for the test.\n allocateBudget(\n components.budgetController,\n {\"testCampaign\", \"testStrategy\"},\n USD(1000));\n\n\n boost::thread_group threads;\n\n\n int numDone = 0;\n\n \/\/ Uses MockExchange to simulates a very basic exchange for the test.\n auto doExchangeThread = [&] (int threadId)\n {\n string exchangeName = string(\"exchange-\") + to_string(threadId);\n\n MockExchange exchange(proxies, exchangeName);\n exchange.init(threadId, components.exchangePorts);\n exchange.start(nBidRequestsPerThread);\n\n ML::atomic_inc(numDone);\n };\n\n\n \/\/ Start up the exchange threads which should let bid requests flow through\n \/\/ our stack.\n for (unsigned i = 0; i < nExchangeThreads; ++i)\n threads.create_thread(std::bind(doExchangeThread, i));\n\n\n \/\/ Dump the budget stats while we wait for the test to finish.\n while (numDone < nExchangeThreads) {\n auto summary = components.budgetController.getAccountSummarySync(\n {\"testCampaign\"}, -1);\n cerr << summary << endl;\n\n dumpAccounts(components.budgetController, {\"testCampaign\"}, summary);\n ML::sleep(1.0);\n }\n\n \/\/ Test is done; clean up time.\n\n threads.join_all();\n components.shutdown();\n\n components.proxies->events->dump(cerr);\n}\n\n<commit_msg>adapted to new Monitor api<commit_after>\/* router_integration_test.cc\n Jeremy Barnes, 21 November 2012\n Copyright (c) 2012 Datacratic. All rights reserved.\n\n Overall integration test for the router stack.\n*\/\n\n#include \"augmentor_ex.h\"\n\n#include \"rtbkit\/core\/router\/router.h\"\n#include \"rtbkit\/core\/post_auction\/post_auction_loop.h\"\n#include \"rtbkit\/core\/agent_configuration\/agent_configuration_service.h\"\n#include \"rtbkit\/core\/banker\/master_banker.h\"\n#include \"rtbkit\/core\/banker\/slave_banker.h\"\n#include \"jml\/utils\/rng.h\"\n#include \"rtbkit\/core\/monitor\/monitor_endpoint.h\"\n#include \"jml\/utils\/pair_utils.h\"\n#include \"jml\/utils\/environment.h\"\n#include \"jml\/arch\/timers.h\"\n#include \"soa\/service\/testing\/redis_temporary_server.h\"\n#include \"testing\/generic_exchange_connector.h\"\n#include \"testing\/mock_exchange.h\"\n#include \"rtbkit\/testing\/test_agent.h\"\n#include <boost\/thread.hpp>\n#include <netdb.h>\n#include <memory>\n\n\nusing namespace std;\nusing namespace ML;\nusing namespace Redis;\nusing namespace Datacratic;\nusing namespace RTBKIT;\n\n\n\/******************************************************************************\/\n\/* COMPONENTS *\/\n\/******************************************************************************\/\n\n\/** Initializes the various components of the RTBKit stack. *\/\nstruct Components\n{\n\n std::shared_ptr<ServiceProxies> proxies;\n\n \/\/ See init for an inline description of the various components.\n\n RedisTemporaryServer redis;\n Router router1, router2;\n PostAuctionLoop postAuctionLoop;\n MasterBanker masterBanker;\n SlaveBudgetController budgetController;\n AgentConfigurationService agentConfig;\n MonitorEndpoint monitor;\n TestAgent agent;\n FrequencyCapAugmentor augmentor;\n\n \/\/ \\todo Add a PAL event subscriber.\n\n vector<unique_ptr<GenericExchangeConnector> > exchangeConnectors;\n vector<int> exchangePorts;\n\n\n Components(std::shared_ptr<ServiceProxies> proxies)\n : proxies(proxies),\n router1(proxies, \"router1\"),\n router2(proxies, \"router2\"),\n postAuctionLoop(proxies, \"pas1\"),\n masterBanker(proxies, \"masterBanker\"),\n agentConfig(proxies, \"agentConfigurationService\"),\n monitor(proxies, \"monitor\"),\n agent(proxies, \"agent1\"),\n augmentor(proxies, \"frequency-cap-ex\")\n {\n }\n\n void shutdown()\n {\n router1.shutdown();\n router2.shutdown();\n postAuctionLoop.shutdown();\n\n budgetController.shutdown();\n masterBanker.shutdown();\n\n agent.shutdown();\n augmentor.shutdown();\n agentConfig.shutdown();\n\n monitor.shutdown();\n\n cerr << \"done shutdown\" << endl;\n }\n\n void init()\n {\n const string agentUri = \"tcp:\/\/127.0.0.1:1234\";\n\n \/\/ Setup a monitor which ensures that any instability in the system will\n \/\/ throttle the bid request stream. In other words, it ensures you won't\n \/\/ go bankrupt.\n monitor.init({\"router1\", \"router2\", \"pas1\", \"masterBanker\"});\n monitor.bindTcp();\n monitor.start();\n\n \/\/ Setup and agent configuration service which is used to notify all\n \/\/ interested services of changes to the agent configuration.\n agentConfig.init();\n agentConfig.bindTcp();\n agentConfig.start();\n\n \/\/ Setup a master banker used to keep the canonical budget of the\n \/\/ various bidding agent accounts. The data contained in this service is\n \/\/ periodically persisted to redis.\n masterBanker.init(std::make_shared<RedisBankerPersistence>(redis));\n masterBanker.bindTcp();\n masterBanker.start();\n\n \/\/ Setup a slave banker that we can use to manipulate and peak at the\n \/\/ budgets during the test.\n budgetController.init(proxies->config);\n budgetController.start();\n\n \/\/ Each router contains a slave masterBanker which is periodically\n \/\/ synced with the master banker.\n auto makeSlaveBanker = [=] (const std::string & name)\n {\n auto res = std::make_shared<SlaveBanker>\n (proxies->zmqContext, proxies->config, name);\n res->start();\n return res;\n };\n\n \/\/ Setup a post auction loop (PAL) which handles all exchange events\n \/\/ that don't need to be processed in real-time (wins, loss, etc).\n postAuctionLoop.init();\n postAuctionLoop.setBanker(makeSlaveBanker(\"pas1\"));\n postAuctionLoop.bindTcp();\n postAuctionLoop.start();\n\n \/\/ Setup two routers which will manage the bid request stream coming\n \/\/ from the exchange, the augmentations coming from the augmentors (to\n \/\/ be added to the test) and the bids coming from the agents. Along the\n \/\/ way it also applies various filters based on agent configuration\n \/\/ while ensuring that all the real-time constraints are respected.\n\n router1.init();\n router1.setBanker(makeSlaveBanker(\"router1\"));\n router1.bindTcp();\n router1.start();\n\n router2.init();\n router2.setBanker(makeSlaveBanker(\"router2\"));\n router2.bindTcp();\n router2.start();\n\n\n \/\/ Setup an exchange connector for each router which will act as the\n \/\/ middle men between the exchange and the router.\n\n exchangeConnectors.emplace_back(\n new GenericExchangeConnector(&router1, Json::Value()));\n\n exchangeConnectors.emplace_back(\n new GenericExchangeConnector(&router2, Json::Value()));\n\n for (auto& connector : exchangeConnectors) {\n connector->enableUntil(Date::positiveInfinity());\n\n int port = connector->init(-1, \"localhost\", 2 \/* threads *\/);\n exchangePorts.push_back(port);\n }\n\n \/\/ Our bidding agent which listens to the bid request stream from all\n \/\/ available routers and decide who gets to see your awesome pictures of\n \/\/ kittens.\n agent.start(agentUri, \"test-agent\");\n agent.configure();\n\n \/\/ Our augmentor which does frequency capping for our agent.\n augmentor.init();\n augmentor.start();\n }\n};\n\n\n\/******************************************************************************\/\n\/* SETUP *\/\n\/******************************************************************************\/\n\nvoid setupAgent(TestAgent& agent)\n{\n \/\/ Set our frequency cap to 42. This has two effects: 1) it instructs the\n \/\/ router that we want bid requests destined for our agent to first be\n \/\/ augmented with frequency capping information and 2) it instructs our\n \/\/ augmentor to place the pass-frequency-cap-ex tag on our bid request if\n \/\/ our agent has seen a given user less then 42 times.\n agent.config.addAugmentation(\"frequency-cap-ex\", Json::Value(42));\n\n \/\/ Instructs the router to only keep bid requests that have this tag. In\n \/\/ other words keep only the bid requests that haven't reached our frequency\n \/\/ cap limit.\n agent.config.augmentationFilter.include.push_back(\"pass-frequency-cap-ex\");\n\n \/\/ This lambda implements our incredibly sophisticated bidding strategy.\n agent.onBidRequest = [&] (\n double timestamp,\n const Id & id,\n std::shared_ptr<BidRequest> br,\n const Json::Value & spots,\n double timeLeftMs,\n const Json::Value & augmentations)\n {\n Json::Value response;\n response[0][\"creative\"] = spots[0][\"creatives\"][0];\n response[0][\"price\"] = 10000;\n response[0][\"priority\"] = 1;\n\n Json::Value metadata;\n agent.doBid(id, response, metadata);\n\n ML::atomic_inc(agent.numBidRequests);\n };\n}\n\n\n\/** Transfer a given budget to each router for a given account. *\/\nvoid allocateBudget(\n SlaveBudgetController& budgetController,\n const AccountKey& account,\n Amount budget)\n{\n budgetController.addAccountSync(account);\n budgetController.setBudgetSync(account[0], budget);\n budgetController.topupTransferSync(account, USD(10));\n\n cerr << budgetController.getAccountSummarySync(account[0], -1) << endl;\n\n \/\/ Syncing is done periodically so we have to wait a bit before the router\n \/\/ will have a budget available. Necessary because the bid request stream\n \/\/ for this test isn't infinit.\n cerr << \"sleeping so that the slave accounts can sync up\" << endl;\n ML::sleep(2.1);\n\n auto summary = budgetController.getAccountSummarySync(account[0], -1);\n cerr << summary << endl;\n\n ExcAssertEqual(\n summary.subAccounts[\"testStrategy\"].subAccounts[\"router1\"].budget,\n USD(0.10));\n\n ExcAssertEqual(\n summary.subAccounts[\"testStrategy\"].subAccounts[\"router2\"].budget,\n USD(0.10));\n}\n\n\/** Some debugging output for the banker. *\/\nvoid dumpAccounts(\n SlaveBudgetController& budgetController,\n const AccountKey & name, const AccountSummary & a)\n{\n cerr << name << \": \" << endl;\n cerr << budgetController.getAccountSync(name) << endl;\n\n for (auto & sub: a.subAccounts) {\n dumpAccounts(budgetController, name.childKey(sub.first), sub.second);\n }\n};\n\n\n\/******************************************************************************\/\n\/* MAIN *\/\n\/******************************************************************************\/\n\n\/** Small example problem that spins up the various components of the RTBKit\n stack, sends a bunch of bid requests through it then print some stats.\n\n *\/\nint main(int argc, char ** argv)\n{\n \/\/ Controls the length of the test.\n enum {\n nExchangeThreads = 10,\n nBidRequestsPerThread = 200\n };\n\n auto proxies = std::make_shared<ServiceProxies>();\n\n \/\/ If we had a zookeeper instance running, we could use it to do service\n \/\/ discovery. Since we don't, ServiceProxies will just default to using a\n \/\/ local service map.\n if (false) proxies->useZookeeper(\"zookeeper.datacratic.com\", \"stats\");\n\n \/\/ If we had a carbon instance running, we could use it to log events. Since\n \/\/ we don't, ServiceProxies will just default to using a local equivalent.\n if (false) proxies->logToCarbon(\"carbon.datacratic.com\", \"stats\");\n\n\n \/\/ Setups up the various component of the RTBKit stack. See Components::init\n \/\/ for more details.\n Components components(proxies);\n components.init();\n\n \/\/ Some extra customization for our agent to make it extra special. See\n \/\/ setupAgent for more details.\n setupAgent(components.agent);\n\n \/\/ Setup an initial budgeting for the test.\n allocateBudget(\n components.budgetController,\n {\"testCampaign\", \"testStrategy\"},\n USD(1000));\n\n\n boost::thread_group threads;\n\n\n int numDone = 0;\n\n \/\/ Uses MockExchange to simulates a very basic exchange for the test.\n auto doExchangeThread = [&] (int threadId)\n {\n string exchangeName = string(\"exchange-\") + to_string(threadId);\n\n MockExchange exchange(proxies, exchangeName);\n exchange.init(threadId, components.exchangePorts);\n exchange.start(nBidRequestsPerThread);\n\n ML::atomic_inc(numDone);\n };\n\n\n \/\/ Start up the exchange threads which should let bid requests flow through\n \/\/ our stack.\n for (unsigned i = 0; i < nExchangeThreads; ++i)\n threads.create_thread(std::bind(doExchangeThread, i));\n\n\n \/\/ Dump the budget stats while we wait for the test to finish.\n while (numDone < nExchangeThreads) {\n auto summary = components.budgetController.getAccountSummarySync(\n {\"testCampaign\"}, -1);\n cerr << summary << endl;\n\n dumpAccounts(components.budgetController, {\"testCampaign\"}, summary);\n ML::sleep(1.0);\n }\n\n \/\/ Test is done; clean up time.\n\n threads.join_all();\n components.shutdown();\n\n components.proxies->events->dump(cerr);\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <Arduino.h>\n#include <stdint.h>\n#include <setjmp.h>\n#include \"task.h\"\n\nstatic task_queue delaying;\n\nvoid task_queue::insert(task *p, task *t) {\n\tif (p) {\n\t\tt->next = p->next;\n\t\tp->next = t;\n\t\tif (p == _tail)\n\t\t\t_tail = t;\n\t} else {\n\t\tt->next = _head;\n\t\t_head = t;\n\t}\n}\n\n#define MAX_DELAY 0xf000000\n\nvoid Tasks::delay(unsigned long ms) {\n\tunsigned long now = millis();\n\ttask *p, *q;\n\tfor (p = 0, q = delaying.head(); q; p = q, q = q->next) {\n\t\tunsigned long qms = q->wake - now;\n\t\tif (qms >= MAX_DELAY) {\n\t\t\tTasks::ready(delaying.remove());\n\t\t\tq = delaying.head();\n\t\t\tcontinue;\n\t\t}\n\t\tif (qms > ms)\n\t\t\tbreak;\n\t}\n\ttask *t = Tasks::current();\n\tt->wake = now + ms;\n\tdelaying.insert(p, t);\n\tTasks::reschedule();\n}\n\nvoid timer_sleep() {\n\ttask *t = delaying.remove();\n\tunsigned long ms = t->wake - millis();\n\tif (ms < MAX_DELAY)\n\t\tdelay(ms);\n\tTasks::ready(t);\n}\n<commit_msg>add Atomic<commit_after>#include <Arduino.h>\n#include <stdint.h>\n#include <setjmp.h>\n#include \"atomic.h\"\n#include \"task.h\"\n\nstatic task_queue delaying;\n\nvoid task_queue::insert(task *p, task *t) {\n\tif (p) {\n\t\tt->next = p->next;\n\t\tp->next = t;\n\t\tif (p == _tail)\n\t\t\t_tail = t;\n\t} else {\n\t\tt->next = _head;\n\t\t_head = t;\n\t}\n}\n\n#define MAX_DELAY 0xf000000\n\nvoid Tasks::delay(unsigned long ms) {\n\tAtomic block;\n\tunsigned long now = millis();\n\ttask *p, *q;\n\tfor (p = 0, q = delaying.head(); q; p = q, q = q->next) {\n\t\tunsigned long qms = q->wake - now;\n\t\tif (qms >= MAX_DELAY) {\n\t\t\tTasks::ready(delaying.remove());\n\t\t\tq = delaying.head();\n\t\t\tcontinue;\n\t\t}\n\t\tif (qms > ms)\n\t\t\tbreak;\n\t}\n\ttask *t = Tasks::current();\n\tt->wake = now + ms;\n\tdelaying.insert(p, t);\n\tTasks::reschedule();\n}\n\nvoid timer_sleep() {\n\ttask *t = delaying.remove();\n\tunsigned long ms = t->wake - millis();\n\tif (ms < MAX_DELAY)\n\t\tdelay(ms);\n\tTasks::ready(t);\n}\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/ecc\/mainline_rce_trap.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file mainline_rce_trap.H\n\/\/\/ @brief Subroutines for the MC mainline rce address trap registers (MBRCER*Q)\n\/\/\/\n\/\/ *HWP HWP Owner: Louis Stermole <stermole@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef _MSS_MAINLINE_RCE_TRAP_H_\n#define _MSS_MAINLINE_RCE_TRAP_H_\n\n#include <fapi2.H>\n#include <lib\/mcbist\/address.H>\n#include <generic\/memory\/lib\/utils\/scom.H>\n#include <lib\/utils\/find.H>\n#include <lib\/ecc\/ecc_traits.H>\n\nnamespace mss\n{\n\nnamespace ecc\n{\n\nnamespace mainline_rce_trap\n{\n\n\/\/\/\n\/\/\/ @brief Read MBS Mainline RCE Address Trap (MBRCER*Q) register\n\/\/\/ @tparam T fapi2 Target Type - derived from i_target's type\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_target the fapi2 target of the mc\n\/\/\/ @param[out] o_data the value of the register\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/\ntemplate< fapi2::TargetType T, typename TT = eccTraits<T> >\ninline fapi2::ReturnCode read( const fapi2::Target<T>& i_target, fapi2::buffer<uint64_t>& o_data )\n{\n const auto& l_mcbist_target = mss::find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n const auto& l_port = mss::relative_pos<fapi2::TARGET_TYPE_MCBIST>(i_target);\n\n FAPI_TRY( mss::getScom(l_mcbist_target, (TT::MAINLINE_RCE_REGS[l_port]), o_data) );\n FAPI_INF(\"read: 0x%016lx\", o_data);\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Write MBS Mainline RCE Address Trap (MBRCER*Q) register\n\/\/\/ @tparam T fapi2 Target Type - derived from i_target's type\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_target the fapi2 target of the mc\n\/\/\/ @param[in] i_data the value to write to the register\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/\ntemplate< fapi2::TargetType T, typename TT = eccTraits<T> >\ninline fapi2::ReturnCode write( const fapi2::Target<T>& i_target, const fapi2::buffer<uint64_t>& i_data )\n{\n const auto& l_mcbist_target = mss::find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n const auto& l_port = mss::relative_pos<fapi2::TARGET_TYPE_MCBIST>(i_target);\n\n FAPI_TRY( mss::putScom(l_mcbist_target, (TT::MAINLINE_RCE_REGS[l_port]), i_data) );\n FAPI_INF(\"write: 0x%016lx\", i_data);\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief set_address\n\/\/\/ @tparam T fapi2 Target Type defaults to TARGET_TYPE_MCA\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in, out] io_data the register value\n\/\/\/ @param[in] i_address mcbist::address form of address field\n\/\/\/\ntemplate< fapi2::TargetType T = fapi2::TARGET_TYPE_MCA, typename TT = eccTraits<T> >\ninline void set_address( fapi2::buffer<uint64_t>& io_data, const mcbist::address& i_address)\n{\n io_data.insertFromRight<TT::RCE_ADDR_TRAP, TT::RCE_ADDR_TRAP_LEN>(uint64_t(i_address));\n FAPI_INF(\"set_address: 0x%016lx\", uint64_t(i_address));\n}\n\n\/\/\/\n\/\/\/ @brief get_address\n\/\/\/ @tparam T fapi2 Target Type defaults to TARGET_TYPE_MCA\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_data the register value\n\/\/\/ @param[out] o_address mcbist::address form of address field\n\/\/\/\ntemplate< fapi2::TargetType T = fapi2::TARGET_TYPE_MCA, typename TT = eccTraits<T> >\ninline void get_address( const fapi2::buffer<uint64_t>& i_data, mcbist::address& o_address )\n{\n uint64_t l_addr = 0;\n i_data.extractToRight<TT::RCE_ADDR_TRAP, TT::RCE_ADDR_TRAP_LEN>(l_addr);\n o_address = mcbist::address(l_addr);\n FAPI_INF(\"get_address: 0x%016lx\", uint64_t(l_addr));\n}\n\n} \/\/ close namespace mainline_rce_trap\n\n} \/\/ close namespace ecc\n\n} \/\/ close namespace mss\n\n#endif\n<commit_msg>Move find API to share among memory controllers<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/lib\/ecc\/mainline_rce_trap.H $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2016,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file mainline_rce_trap.H\n\/\/\/ @brief Subroutines for the MC mainline rce address trap registers (MBRCER*Q)\n\/\/\/\n\/\/ *HWP HWP Owner: Louis Stermole <stermole@us.ibm.com>\n\/\/ *HWP HWP Backup: Brian Silver <bsilver@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 2\n\/\/ *HWP Consumed by: FSP:HB\n\n#ifndef _MSS_MAINLINE_RCE_TRAP_H_\n#define _MSS_MAINLINE_RCE_TRAP_H_\n\n#include <fapi2.H>\n#include <lib\/mcbist\/address.H>\n#include <generic\/memory\/lib\/utils\/scom.H>\n#include <generic\/memory\/lib\/utils\/find.H>\n#include <lib\/ecc\/ecc_traits.H>\n\nnamespace mss\n{\n\nnamespace ecc\n{\n\nnamespace mainline_rce_trap\n{\n\n\/\/\/\n\/\/\/ @brief Read MBS Mainline RCE Address Trap (MBRCER*Q) register\n\/\/\/ @tparam T fapi2 Target Type - derived from i_target's type\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_target the fapi2 target of the mc\n\/\/\/ @param[out] o_data the value of the register\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/\ntemplate< fapi2::TargetType T, typename TT = eccTraits<T> >\ninline fapi2::ReturnCode read( const fapi2::Target<T>& i_target, fapi2::buffer<uint64_t>& o_data )\n{\n const auto& l_mcbist_target = mss::find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n const auto& l_port = mss::relative_pos<fapi2::TARGET_TYPE_MCBIST>(i_target);\n\n FAPI_TRY( mss::getScom(l_mcbist_target, (TT::MAINLINE_RCE_REGS[l_port]), o_data) );\n FAPI_INF(\"read: 0x%016lx\", o_data);\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief Write MBS Mainline RCE Address Trap (MBRCER*Q) register\n\/\/\/ @tparam T fapi2 Target Type - derived from i_target's type\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_target the fapi2 target of the mc\n\/\/\/ @param[in] i_data the value to write to the register\n\/\/\/ @return fapi2::ReturnCode FAPI2_RC_SUCCESS if ok\n\/\/\/\ntemplate< fapi2::TargetType T, typename TT = eccTraits<T> >\ninline fapi2::ReturnCode write( const fapi2::Target<T>& i_target, const fapi2::buffer<uint64_t>& i_data )\n{\n const auto& l_mcbist_target = mss::find_target<fapi2::TARGET_TYPE_MCBIST>(i_target);\n const auto& l_port = mss::relative_pos<fapi2::TARGET_TYPE_MCBIST>(i_target);\n\n FAPI_TRY( mss::putScom(l_mcbist_target, (TT::MAINLINE_RCE_REGS[l_port]), i_data) );\n FAPI_INF(\"write: 0x%016lx\", i_data);\nfapi_try_exit:\n return fapi2::current_err;\n}\n\n\/\/\/\n\/\/\/ @brief set_address\n\/\/\/ @tparam T fapi2 Target Type defaults to TARGET_TYPE_MCA\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in, out] io_data the register value\n\/\/\/ @param[in] i_address mcbist::address form of address field\n\/\/\/\ntemplate< fapi2::TargetType T = fapi2::TARGET_TYPE_MCA, typename TT = eccTraits<T> >\ninline void set_address( fapi2::buffer<uint64_t>& io_data, const mcbist::address& i_address)\n{\n io_data.insertFromRight<TT::RCE_ADDR_TRAP, TT::RCE_ADDR_TRAP_LEN>(uint64_t(i_address));\n FAPI_INF(\"set_address: 0x%016lx\", uint64_t(i_address));\n}\n\n\/\/\/\n\/\/\/ @brief get_address\n\/\/\/ @tparam T fapi2 Target Type defaults to TARGET_TYPE_MCA\n\/\/\/ @tparam TT traits type defaults to eccTraits<T>\n\/\/\/ @param[in] i_data the register value\n\/\/\/ @param[out] o_address mcbist::address form of address field\n\/\/\/\ntemplate< fapi2::TargetType T = fapi2::TARGET_TYPE_MCA, typename TT = eccTraits<T> >\ninline void get_address( const fapi2::buffer<uint64_t>& i_data, mcbist::address& o_address )\n{\n uint64_t l_addr = 0;\n i_data.extractToRight<TT::RCE_ADDR_TRAP, TT::RCE_ADDR_TRAP_LEN>(l_addr);\n o_address = mcbist::address(l_addr);\n FAPI_INF(\"get_address: 0x%016lx\", uint64_t(l_addr));\n}\n\n} \/\/ close namespace mainline_rce_trap\n\n} \/\/ close namespace ecc\n\n} \/\/ close namespace mss\n\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ ============================================================================\n\/\/\n\/\/ Compressible Thermal GKS\n\/\/\n\/\/ ============================================================================\n\n\n#include \"GKSMesh.h\"\n#include \"BoundaryCondition.h\"\n#include <iostream>\n#include <sstream>\n#include <chrono>\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n \/\/\/*\n\n \/\/ ========================================================================\n \/\/\n \/\/ Couette-Flow (Periodic)\n \/\/\n \/\/ ========================================================================\n\n Parameters param;\n\n double H = 1.0;\n double W = 0.25;\n\n param.numberOfIterations = 1000000;\n param.outputIntervalVTK = 1000000;\n param.outputInterval = 10000;\n\n param.convergenceCriterium = 1.0e-6;\n\n param.CFL = 0.5;\n\n param.verbose = false;\n\n \/\/ ========================================================================\n\n FluidParameter fluidParam;\n\n fluidParam.K = 1;\n fluidParam.nu = 1e-2;\n fluidParam.R = 200.0;\n fluidParam.Force.x = 1e-4;\n fluidParam.Force.y = 0.0;\n\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 3 |\n \/\/ | 0 2 |\n \/\/ | 1 |\n \/\/ -----------\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.005, 0.0, 0.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMesh(W, H, 2, 2);\n\n \/\/ Initialize Values\n mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n *\/\n\n \/\/\/*\n\n \/\/ ========================================================================\n \/\/\n \/\/ Poiseuille-Flow (Force driven)\n \/\/\n \/\/ ========================================================================\n\n Parameters param;\n\n double H = 1.0;\n double W = 1.0;\n\n param.numberOfIterations = 100;\n param.outputInterval = 1;\n param.CFL = 0.5;\n\n param.verbose = false;\n\n \/\/ ========================================================================\n\n FluidParameter fluidParam;\n\n fluidParam.K = 1;\n fluidParam.nu = 1e-2;\n fluidParam.R = 200.0;\n fluidParam.Force.x = 1e-4;\n fluidParam.Force.y = 0.0;\n\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 1 |\n \/\/ | |\n \/\/ | 0 |\n \/\/ -----------\n mesh->addInterfaceBoundaryCondition(0.0);\n mesh->addInterfaceBoundaryCondition(0.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMeshPeriodicInterfaceBCs(W, H, 1, 64);\n\n \/\/ Initialize Values\n mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n \/\/*\/\n \n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 3 |\n \/\/ | 0 2 |\n \/\/ | 1 |\n \/\/ -----------\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.0, 0.0, 1.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMesh(W, H, 100, 100);\n\n \/\/ Initialize Values\n \/\/ mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n double rho[] = { 1.0, 1.0 + 1.0e-3 };\n\n mesh->initMeshLinearDensity(rho, 0.0, 0.0, lambda);\n\n *\/\n\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n\n \/\/cout << mesh->toString();\n\n \/\/mesh->writeMeshAsText(\"out\/Mesh.txt\");\n\n mesh->iterate();\n\n \/\/mesh->writeTimeSteps(\"out\/timeSteps.dat\");\n\n \/\/mesh->writeVelocityU(\"out\/VelocityU.dat\");\n \/\/mesh->writeVelocityV(\"out\/VelocityV.dat\");\n\n \/\/ostringstream filename;\n \/\/filename << \"out\/PoiseuillePresGradConvergenceStudy\/\" << ny;\n \/\/mesh->writeVelocityProfile( ( filename.str() + \"\/VelocityProfile.dat\" ) , 0.5);\n \/\/mesh->writeConvergenceHistory( ( filename.str() + \"\/ConvergenceHistory.dat\" ) );\n \/\/mesh->writeOverviewFile( ( filename.str() + \"\/OverviewFile.dat\" ) );\n \n ostringstream filename;\n filename << \"out\/DrivenCavity\/Re\" << Re << \"\/\" << nx;\n \/\/mesh->writeVelocityProfile(( filename.str() + \"\/VelocityProfile.dat\" ), 0.5);\n mesh->writeVelocityU( (filename.str() + \"\/VelocityU.dat\" ));\n mesh->writeVelocityV( (filename.str() + \"\/VelocityV.dat\" ));\n mesh->writeConvergenceHistory(( filename.str() + \"\/ConvergenceHistory.dat\" ));\n mesh->writeOverviewFile( ( filename.str() + \"\/OverviewFile.dat\" ));\n\n\n \/\/mesh->writeConvergenceHistory(\"out\/ConvergenceHistory.dat\");\n \/\/mesh->writeOverviewFile(\"out\/OverviewFile.dat\");\n\n \/\/char a; cin >> a;\n}<commit_msg>double method from merge deleted<commit_after>\/\/ ============================================================================\n\/\/\n\/\/ Compressible Thermal GKS\n\/\/\n\/\/ ============================================================================\n\n\n#include \"GKSMesh.h\"\n#include \"BoundaryCondition.h\"\n#include <iostream>\n#include <sstream>\n#include <chrono>\n\nusing namespace std;\n\nint main(int argc, char* argv[])\n{\n \/*\n\n \/\/ ========================================================================\n \/\/\n \/\/ Couette-Flow (Periodic)\n \/\/\n \/\/ ========================================================================\n\n Parameters param;\n\n double H = 1.0;\n double W = 0.25;\n\n param.numberOfIterations = 1000000;\n param.outputIntervalVTK = 1000000;\n param.outputInterval = 10000;\n\n param.convergenceCriterium = 1.0e-6;\n\n param.CFL = 0.5;\n\n param.verbose = false;\n\n \/\/ ========================================================================\n\n FluidParameter fluidParam;\n\n fluidParam.K = 1;\n fluidParam.nu = 1e-2;\n fluidParam.R = 200.0;\n fluidParam.Force.x = 1e-4;\n fluidParam.Force.y = 0.0;\n\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 3 |\n \/\/ | 0 2 |\n \/\/ | 1 |\n \/\/ -----------\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.00, 0.0, 0.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.005, 0.0, 0.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMesh(W, H, 2, 2);\n\n \/\/ Initialize Values\n mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n *\/\n\n \/\/\/*\n\n \/\/ ========================================================================\n \/\/\n \/\/ Poiseuille-Flow (Force driven)\n \/\/\n \/\/ ========================================================================\n\n Parameters param;\n\n double H = 1.0;\n double W = 0.1;\n\n param.numberOfIterations = 100000;\n param.outputInterval = 100;\n param.CFL = 0.5;\n\n param.verbose = false;\n\n \/\/ ========================================================================\n\n FluidParameter fluidParam;\n\n fluidParam.K = 1;\n fluidParam.nu = 1e-2;\n fluidParam.R = 200.0;\n fluidParam.Force.x = 1e-4;\n fluidParam.Force.y = 0.0;\n\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 1 |\n \/\/ | |\n \/\/ | 0 |\n \/\/ -----------\n mesh->addInterfaceBoundaryCondition(0.0);\n mesh->addInterfaceBoundaryCondition(0.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMeshPeriodicInterfaceBCs(W, H, 1, 64);\n\n \/\/ Initialize Values\n mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n \/\/*\/\n \n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n \/\/ ========================================================================\n\n GKSMesh* mesh = new GKSMesh(param, fluidParam);\n\n \/\/ Define Boundary Conditions\n \/\/ -----------\n \/\/ | 3 |\n \/\/ | 0 2 |\n \/\/ | 1 |\n \/\/ -----------\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 1, 1, 1, 0.0, 0.0, 0.0, 1.0);\n mesh->addBoundaryCondition(1, 0, 0, 1, 0.0, 0.0, 0.0, 1.0);\n\n \/\/ Generate Mesh\n mesh->generateRectMesh(W, H, 100, 100);\n\n \/\/ Initialize Values\n \/\/ mesh->initMeshConstant(1.0, 0.0, 0.0, 1.0);\n\n double rho[] = { 1.0, 1.0 + 1.0e-3 };\n\n mesh->initMeshLinearDensity(rho, 0.0, 0.0, lambda);\n\n *\/\n\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n \/\/ ================================================================================================================================================\n\n \/\/cout << mesh->toString();\n\n \/\/mesh->writeMeshAsText(\"out\/Mesh.txt\");\n\n mesh->iterate();\n\n \/\/mesh->writeTimeSteps(\"out\/timeSteps.dat\");\n\n \/\/mesh->writeVelocityU(\"out\/VelocityU.dat\");\n \/\/mesh->writeVelocityV(\"out\/VelocityV.dat\");\n\n \/\/ostringstream filename;\n \/\/filename << \"out\/PoiseuillePresGradConvergenceStudy\/\" << ny;\n \/\/mesh->writeVelocityProfile( ( filename.str() + \"\/VelocityProfile.dat\" ) , 0.5);\n \/\/mesh->writeConvergenceHistory( ( filename.str() + \"\/ConvergenceHistory.dat\" ) );\n \/\/mesh->writeOverviewFile( ( filename.str() + \"\/OverviewFile.dat\" ) );\n \n ostringstream filename;\n filename << \"out\/DrivenCavity\/Re\" << Re << \"\/\" << nx;\n \/\/mesh->writeVelocityProfile(( filename.str() + \"\/VelocityProfile.dat\" ), 0.5);\n mesh->writeVelocityU( (filename.str() + \"\/VelocityU.dat\" ));\n mesh->writeVelocityV( (filename.str() + \"\/VelocityV.dat\" ));\n mesh->writeConvergenceHistory(( filename.str() + \"\/ConvergenceHistory.dat\" ));\n mesh->writeOverviewFile( ( filename.str() + \"\/OverviewFile.dat\" ));\n\n\n \/\/mesh->writeConvergenceHistory(\"out\/ConvergenceHistory.dat\");\n \/\/mesh->writeOverviewFile(\"out\/OverviewFile.dat\");\n\n \/\/char a; cin >> a;\n}<|endoftext|>"} {"text":"<commit_before>\/\/ This file is part of the \"x0\" project, http:\/\/xzero.io\/\n\/\/ (c) 2009-2014 Christian Parpart <trapni@gmail.com>\n\/\/\n\/\/ Licensed under the MIT License (the \"License\"); you may not use this\n\/\/ file except in compliance with the License. You may obtain a copy of\n\/\/ the License at: http:\/\/opensource.org\/licenses\/MIT\n\n#include <xzero\/http\/http1\/Connection.h>\n#include <xzero\/http\/http1\/Channel.h>\n#include <xzero\/http\/HttpBufferedInput.h>\n#include <xzero\/http\/HttpDateGenerator.h>\n#include <xzero\/http\/HttpResponseInfo.h>\n#include <xzero\/http\/HttpResponse.h>\n#include <xzero\/http\/HttpRequest.h>\n#include <xzero\/http\/BadMessage.h>\n#include <xzero\/net\/Connection.h>\n#include <xzero\/net\/EndPoint.h>\n#include <xzero\/net\/EndPointWriter.h>\n#include <xzero\/executor\/Executor.h>\n#include <xzero\/logging.h>\n#include <xzero\/RuntimeError.h>\n#include <xzero\/StringUtil.h>\n#include <xzero\/sysconfig.h>\n#include <cassert>\n#include <cstdlib>\n\nnamespace xzero {\nnamespace http {\nnamespace http1 {\n\n#define ERROR(msg...) logError(\"http.http1.Connection\", msg)\n\n#ifndef NDEBUG\n#define TRACE(msg...) logTrace(\"http.http1.Connection\", msg)\n#else\n#define TRACE(msg...) do {} while (0)\n#endif\n\nConnection::Connection(EndPoint* endpoint,\n Executor* executor,\n const HttpHandler& handler,\n HttpDateGenerator* dateGenerator,\n HttpOutputCompressor* outputCompressor,\n size_t maxRequestUriLength,\n size_t maxRequestBodyLength,\n size_t maxRequestCount,\n Duration maxKeepAlive,\n bool corkStream)\n : ::xzero::Connection(endpoint, executor),\n parser_(Parser::REQUEST),\n inputBuffer_(),\n inputOffset_(0),\n writer_(),\n onComplete_(),\n generator_(&writer_),\n channel_(new Channel(\n this, executor, handler,\n std::unique_ptr<HttpInput>(new HttpBufferedInput()),\n maxRequestUriLength, maxRequestBodyLength,\n dateGenerator, outputCompressor)),\n maxKeepAlive_(maxKeepAlive),\n requestCount_(0),\n requestMax_(maxRequestCount),\n corkStream_(corkStream) {\n\n channel_->request()->setRemoteIP(endpoint->remoteIP());\n\n parser_.setListener(channel_.get());\n TRACE(\"$0 ctor\", this);\n}\n\nConnection::~Connection() {\n TRACE(\"$0 dtor\", this);\n}\n\nvoid Connection::onOpen() {\n TRACE(\"$0 onOpen\", this);\n ::xzero::Connection::onOpen();\n\n \/\/ TODO support TCP_DEFER_ACCEPT here\n#if 0\n if (connector()->deferAccept())\n onFillable();\n else\n wantFill();\n#else\n wantFill();\n#endif\n}\n\nvoid Connection::onClose() {\n TRACE(\"$0 onClose\", this);\n ::xzero::Connection::onClose();\n}\n\nvoid Connection::abort() {\n TRACE(\"$0 abort()\", this);\n channel_->response()->setBytesTransmitted(generator_.bytesTransmitted());\n channel_->responseEnd();\n\n TRACE(\"$0 abort\", this);\n endpoint()->close();\n}\n\nvoid Connection::completed() {\n TRACE(\"$0 completed\", this);\n\n if (onComplete_)\n RAISE(IllegalStateError, \"there is still another completion hook.\");\n\n if (channel_->request()->method() != HttpMethod::HEAD &&\n !generator_.isChunked() &&\n generator_.pendingContentLength() > 0)\n RAISE(IllegalStateError, \"Invalid State. Response not fully written but completed() invoked.\");\n\n onComplete_ = std::bind(&Connection::onResponseComplete, this,\n std::placeholders::_1);\n\n generator_.generateTrailer(channel_->response()->trailers());\n wantFlush();\n}\n\nvoid Connection::onResponseComplete(bool succeed) {\n TRACE(\"$0 onResponseComplete($1)\", this, succeed ? \"succeed\" : \"failure\");\n channel_->response()->setBytesTransmitted(generator_.bytesTransmitted());\n channel_->responseEnd();\n\n if (!succeed) {\n \/\/ writing trailer failed. do not attempt to do anything on the wire.\n return;\n }\n\n if (channel_->isPersistent()) {\n TRACE(\"$0 completed.onComplete\", this);\n\n \/\/ re-use on keep-alive\n channel_->reset();\n\n endpoint()->setCorking(false);\n\n if (inputOffset_ < inputBuffer_.size()) {\n \/\/ have some request pipelined\n TRACE(\"$0 completed.onComplete: pipelined read\", this);\n executor()->execute(std::bind(&Connection::parseFragment, this));\n } else {\n \/\/ wait for next request\n TRACE(\"$0 completed.onComplete: keep-alive read\", this);\n wantFill();\n }\n } else {\n endpoint()->close();\n }\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n const BufferRef& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(BufferRef, status=$1, persistent=$2, chunkSize=$2)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.size());\n\n patchResponseInfo(responseInfo);\n\n if (corkStream_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, chunk);\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n Buffer&& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(Buffer, status=$1, persistent=$2, chunkSize=$3)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.size());\n\n patchResponseInfo(responseInfo);\n\n const bool corking_ = true; \/\/ TODO(TCP_CORK): part of HttpResponseInfo?\n if (corking_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n FileRef&& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(FileRef, status=$1, persistent=$2, fileRef.fd=$3, chunkSize=$4)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.handle(), chunk.size());\n\n patchResponseInfo(responseInfo);\n\n const bool corking_ = true; \/\/ TODO(TCP_CORK): part of HttpResponseInfo?\n if (corking_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::patchResponseInfo(HttpResponseInfo& responseInfo) {\n if (static_cast<int>(responseInfo.status()) >= 200) {\n \/\/ patch in HTTP transport-layer headers\n if (channel_->isPersistent() && requestCount_ < requestMax_) {\n ++requestCount_;\n\n char keepAlive[64];\n snprintf(keepAlive, sizeof(keepAlive), \"timeout=%llu, max=%zu\",\n (unsigned long long) maxKeepAlive_.seconds(),\n requestMax_ - requestCount_);\n\n responseInfo.headers().push_back(\"Connection\", \"Keep-Alive\");\n responseInfo.headers().push_back(\"Keep-Alive\", keepAlive);\n } else {\n channel_->setPersistent(false);\n responseInfo.headers().push_back(\"Connection\", \"closed\");\n }\n }\n}\n\nvoid Connection::send(Buffer&& chunk, CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(Buffer, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(std::move(chunk));\n onComplete_ = std::move(onComplete);\n\n wantFlush();\n}\n\nvoid Connection::send(const BufferRef& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(BufferRef, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(chunk);\n onComplete_ = std::move(onComplete);\n\n wantFlush();\n}\n\nvoid Connection::send(FileRef&& chunk, CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(FileRef, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::setInputBufferSize(size_t size) {\n TRACE(\"$0 setInputBufferSize($1)\", this, size);\n inputBuffer_.reserve(size);\n}\n\nvoid Connection::onFillable() {\n TRACE(\"$0 onFillable\", this);\n\n TRACE(\"$0 onFillable: calling fill()\", this);\n if (endpoint()->fill(&inputBuffer_) == 0) {\n TRACE(\"$0 onFillable: fill() returned 0\", this);\n \/\/ RAISE(\"client EOF\");\n abort();\n return;\n }\n\n parseFragment();\n}\n\nvoid Connection::parseFragment() {\n try {\n TRACE(\"parseFragment: calling parseFragment ($0 into $1)\",\n inputOffset_, inputBuffer_.size());\n size_t n = parser_.parseFragment(inputBuffer_.ref(inputOffset_));\n TRACE(\"parseFragment: called ($0 into $1) => $2 ($3)\",\n inputOffset_, inputBuffer_.size(), n,\n parser_.state());\n inputOffset_ += n;\n } catch (const BadMessage& e) {\n TRACE(\"$0 parseFragment: BadMessage caught (while in state $1). $2\",\n this, to_string(channel_->state()), e.what());\n\n if (channel_->response()->version() == HttpVersion::UNKNOWN)\n channel_->response()->setVersion(HttpVersion::VERSION_0_9);\n\n if (channel_->state() == HttpChannelState::READING)\n channel_->setState(HttpChannelState::HANDLING);\n\n channel_->response()->sendError(e.httpCode(), e.what());\n }\n}\n\nvoid Connection::onFlushable() {\n TRACE(\"$0 onFlushable\", this);\n\n if (channel_->state() != HttpChannelState::SENDING)\n channel_->setState(HttpChannelState::SENDING);\n\n const bool complete = writer_.flush(endpoint());\n\n if (complete) {\n TRACE(\"$0 onFlushable: completed. ($1)\",\n this,\n (onComplete_ ? \"onComplete cb set\" : \"onComplete cb not set\"));\n channel_->setState(HttpChannelState::HANDLING);\n\n if (onComplete_) {\n TRACE(\"$0 onFlushable: invoking completion callback\", this);\n auto callback = std::move(onComplete_);\n onComplete_ = nullptr;\n callback(true);\n }\n } else {\n \/\/ continue flushing as we still have data pending\n wantFlush();\n }\n}\n\nvoid Connection::onInterestFailure(const std::exception& error) {\n TRACE(\"$0 onInterestFailure($1): $2\",\n this, typeid(error).name(), error.what());\n\n \/\/ TODO: improve logging here, as this eats our exception here.\n \/\/ e.g. via (factory or connector)->error(error);\n logError(\"Connection\", error, \"Unhandled exception caught in I\/O loop\");\n\n auto callback = std::move(onComplete_);\n onComplete_ = nullptr;\n\n \/\/ notify the callback that we failed doing something wrt. I\/O.\n if (callback) {\n TRACE(\"$0 onInterestFailure: invoking onComplete(false)\", this);\n callback(false);\n }\n\n abort();\n}\n\n} \/\/ namespace http1\n} \/\/ namespace http\n\n\ntemplate <>\nstd::string StringUtil::toString(http::http1::Connection* c) {\n auto remote = c->endpoint()->remoteAddress();\n if (remote.isEmpty())\n return \"<EOF>\";\n else\n return StringUtil::format(\"$0:$1\", remote->first, remote->second);\n}\n\n} \/\/ namespace xzero\n<commit_msg>http1::Connection: fix on partial reads<commit_after>\/\/ This file is part of the \"x0\" project, http:\/\/xzero.io\/\n\/\/ (c) 2009-2014 Christian Parpart <trapni@gmail.com>\n\/\/\n\/\/ Licensed under the MIT License (the \"License\"); you may not use this\n\/\/ file except in compliance with the License. You may obtain a copy of\n\/\/ the License at: http:\/\/opensource.org\/licenses\/MIT\n\n#include <xzero\/http\/http1\/Connection.h>\n#include <xzero\/http\/http1\/Channel.h>\n#include <xzero\/http\/HttpBufferedInput.h>\n#include <xzero\/http\/HttpDateGenerator.h>\n#include <xzero\/http\/HttpResponseInfo.h>\n#include <xzero\/http\/HttpResponse.h>\n#include <xzero\/http\/HttpRequest.h>\n#include <xzero\/http\/BadMessage.h>\n#include <xzero\/net\/Connection.h>\n#include <xzero\/net\/EndPoint.h>\n#include <xzero\/net\/EndPointWriter.h>\n#include <xzero\/executor\/Executor.h>\n#include <xzero\/logging.h>\n#include <xzero\/RuntimeError.h>\n#include <xzero\/StringUtil.h>\n#include <xzero\/sysconfig.h>\n#include <cassert>\n#include <cstdlib>\n\nnamespace xzero {\nnamespace http {\nnamespace http1 {\n\n#define ERROR(msg...) logError(\"http.http1.Connection\", msg)\n\n#ifndef NDEBUG\n#define TRACE(msg...) logTrace(\"http.http1.Connection\", msg)\n#else\n#define TRACE(msg...) do {} while (0)\n#endif\n\nConnection::Connection(EndPoint* endpoint,\n Executor* executor,\n const HttpHandler& handler,\n HttpDateGenerator* dateGenerator,\n HttpOutputCompressor* outputCompressor,\n size_t maxRequestUriLength,\n size_t maxRequestBodyLength,\n size_t maxRequestCount,\n Duration maxKeepAlive,\n bool corkStream)\n : ::xzero::Connection(endpoint, executor),\n parser_(Parser::REQUEST),\n inputBuffer_(),\n inputOffset_(0),\n writer_(),\n onComplete_(),\n generator_(&writer_),\n channel_(new Channel(\n this, executor, handler,\n std::unique_ptr<HttpInput>(new HttpBufferedInput()),\n maxRequestUriLength, maxRequestBodyLength,\n dateGenerator, outputCompressor)),\n maxKeepAlive_(maxKeepAlive),\n requestCount_(0),\n requestMax_(maxRequestCount),\n corkStream_(corkStream) {\n\n channel_->request()->setRemoteIP(endpoint->remoteIP());\n\n parser_.setListener(channel_.get());\n TRACE(\"$0 ctor\", this);\n}\n\nConnection::~Connection() {\n TRACE(\"$0 dtor\", this);\n}\n\nvoid Connection::onOpen() {\n TRACE(\"$0 onOpen\", this);\n ::xzero::Connection::onOpen();\n\n \/\/ TODO support TCP_DEFER_ACCEPT here\n#if 0\n if (connector()->deferAccept())\n onFillable();\n else\n wantFill();\n#else\n wantFill();\n#endif\n}\n\nvoid Connection::onClose() {\n TRACE(\"$0 onClose\", this);\n ::xzero::Connection::onClose();\n}\n\nvoid Connection::abort() {\n TRACE(\"$0 abort()\", this);\n channel_->response()->setBytesTransmitted(generator_.bytesTransmitted());\n channel_->responseEnd();\n\n TRACE(\"$0 abort\", this);\n endpoint()->close();\n}\n\nvoid Connection::completed() {\n TRACE(\"$0 completed\", this);\n\n if (onComplete_)\n RAISE(IllegalStateError, \"there is still another completion hook.\");\n\n if (channel_->request()->method() != HttpMethod::HEAD &&\n !generator_.isChunked() &&\n generator_.pendingContentLength() > 0)\n RAISE(IllegalStateError, \"Invalid State. Response not fully written but completed() invoked.\");\n\n onComplete_ = std::bind(&Connection::onResponseComplete, this,\n std::placeholders::_1);\n\n generator_.generateTrailer(channel_->response()->trailers());\n wantFlush();\n}\n\nvoid Connection::onResponseComplete(bool succeed) {\n TRACE(\"$0 onResponseComplete($1)\", this, succeed ? \"succeed\" : \"failure\");\n channel_->response()->setBytesTransmitted(generator_.bytesTransmitted());\n channel_->responseEnd();\n\n if (!succeed) {\n \/\/ writing trailer failed. do not attempt to do anything on the wire.\n return;\n }\n\n if (channel_->isPersistent()) {\n TRACE(\"$0 completed.onComplete\", this);\n\n \/\/ re-use on keep-alive\n channel_->reset();\n\n endpoint()->setCorking(false);\n\n if (inputOffset_ < inputBuffer_.size()) {\n \/\/ have some request pipelined\n TRACE(\"$0 completed.onComplete: pipelined read\", this);\n executor()->execute(std::bind(&Connection::parseFragment, this));\n } else {\n \/\/ wait for next request\n TRACE(\"$0 completed.onComplete: keep-alive read\", this);\n wantFill();\n }\n } else {\n endpoint()->close();\n }\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n const BufferRef& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(BufferRef, status=$1, persistent=$2, chunkSize=$2)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.size());\n\n patchResponseInfo(responseInfo);\n\n if (corkStream_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, chunk);\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n Buffer&& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(Buffer, status=$1, persistent=$2, chunkSize=$3)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.size());\n\n patchResponseInfo(responseInfo);\n\n const bool corking_ = true; \/\/ TODO(TCP_CORK): part of HttpResponseInfo?\n if (corking_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::send(HttpResponseInfo&& responseInfo,\n FileRef&& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(FileRef, status=$1, persistent=$2, fileRef.fd=$3, chunkSize=$4)\",\n this, responseInfo.status(), channel_->isPersistent() ? \"yes\" : \"no\",\n chunk.handle(), chunk.size());\n\n patchResponseInfo(responseInfo);\n\n const bool corking_ = true; \/\/ TODO(TCP_CORK): part of HttpResponseInfo?\n if (corking_)\n endpoint()->setCorking(true);\n\n generator_.generateResponse(responseInfo, std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::patchResponseInfo(HttpResponseInfo& responseInfo) {\n if (static_cast<int>(responseInfo.status()) >= 200) {\n \/\/ patch in HTTP transport-layer headers\n if (channel_->isPersistent() && requestCount_ < requestMax_) {\n ++requestCount_;\n\n char keepAlive[64];\n snprintf(keepAlive, sizeof(keepAlive), \"timeout=%llu, max=%zu\",\n (unsigned long long) maxKeepAlive_.seconds(),\n requestMax_ - requestCount_);\n\n responseInfo.headers().push_back(\"Connection\", \"Keep-Alive\");\n responseInfo.headers().push_back(\"Keep-Alive\", keepAlive);\n } else {\n channel_->setPersistent(false);\n responseInfo.headers().push_back(\"Connection\", \"closed\");\n }\n }\n}\n\nvoid Connection::send(Buffer&& chunk, CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(Buffer, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(std::move(chunk));\n onComplete_ = std::move(onComplete);\n\n wantFlush();\n}\n\nvoid Connection::send(const BufferRef& chunk,\n CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(BufferRef, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(chunk);\n onComplete_ = std::move(onComplete);\n\n wantFlush();\n}\n\nvoid Connection::send(FileRef&& chunk, CompletionHandler onComplete) {\n if (onComplete && onComplete_)\n RAISE(IllegalStateError, \"There is still another completion hook.\");\n\n TRACE(\"$0 send(FileRef, chunkSize=$1)\", this, chunk.size());\n\n generator_.generateBody(std::move(chunk));\n onComplete_ = std::move(onComplete);\n wantFlush();\n}\n\nvoid Connection::setInputBufferSize(size_t size) {\n TRACE(\"$0 setInputBufferSize($1)\", this, size);\n inputBuffer_.reserve(size);\n}\n\nvoid Connection::onFillable() {\n TRACE(\"$0 onFillable\", this);\n\n TRACE(\"$0 onFillable: calling fill()\", this);\n if (endpoint()->fill(&inputBuffer_) == 0) {\n TRACE(\"$0 onFillable: fill() returned 0\", this);\n \/\/ RAISE(\"client EOF\");\n abort();\n return;\n }\n\n parseFragment();\n}\n\nvoid Connection::parseFragment() {\n try {\n TRACE(\"parseFragment: calling parseFragment ($0 into $1)\",\n inputOffset_, inputBuffer_.size());\n size_t n = parser_.parseFragment(inputBuffer_.ref(inputOffset_));\n TRACE(\"parseFragment: called ($0 into $1) => $2 ($3)\",\n inputOffset_, inputBuffer_.size(), n,\n parser_.state());\n inputOffset_ += n;\n\n \/\/ on a partial read we must make sure that we wait for more input\n if (parser_.state() != Parser::MESSAGE_BEGIN) {\n wantFill();\n }\n } catch (const BadMessage& e) {\n TRACE(\"$0 parseFragment: BadMessage caught (while in state $1). $2\",\n this, to_string(channel_->state()), e.what());\n\n if (channel_->response()->version() == HttpVersion::UNKNOWN)\n channel_->response()->setVersion(HttpVersion::VERSION_0_9);\n\n if (channel_->state() == HttpChannelState::READING)\n channel_->setState(HttpChannelState::HANDLING);\n\n channel_->response()->sendError(e.httpCode(), e.what());\n }\n}\n\nvoid Connection::onFlushable() {\n TRACE(\"$0 onFlushable\", this);\n\n if (channel_->state() != HttpChannelState::SENDING)\n channel_->setState(HttpChannelState::SENDING);\n\n const bool complete = writer_.flush(endpoint());\n\n if (complete) {\n TRACE(\"$0 onFlushable: completed. ($1)\",\n this,\n (onComplete_ ? \"onComplete cb set\" : \"onComplete cb not set\"));\n channel_->setState(HttpChannelState::HANDLING);\n\n if (onComplete_) {\n TRACE(\"$0 onFlushable: invoking completion callback\", this);\n auto callback = std::move(onComplete_);\n onComplete_ = nullptr;\n callback(true);\n }\n } else {\n \/\/ continue flushing as we still have data pending\n wantFlush();\n }\n}\n\nvoid Connection::onInterestFailure(const std::exception& error) {\n TRACE(\"$0 onInterestFailure($1): $2\",\n this, typeid(error).name(), error.what());\n\n \/\/ TODO: improve logging here, as this eats our exception here.\n \/\/ e.g. via (factory or connector)->error(error);\n logError(\"Connection\", error, \"Unhandled exception caught in I\/O loop\");\n\n auto callback = std::move(onComplete_);\n onComplete_ = nullptr;\n\n \/\/ notify the callback that we failed doing something wrt. I\/O.\n if (callback) {\n TRACE(\"$0 onInterestFailure: invoking onComplete(false)\", this);\n callback(false);\n }\n\n abort();\n}\n\n} \/\/ namespace http1\n} \/\/ namespace http\n\n\ntemplate <>\nstd::string StringUtil::toString(http::http1::Connection* c) {\n auto remote = c->endpoint()->remoteAddress();\n if (remote.isEmpty())\n return \"<EOF>\";\n else\n return StringUtil::format(\"$0:$1\", remote->first, remote->second);\n}\n\n} \/\/ namespace xzero\n<|endoftext|>"} {"text":"<commit_before><commit_msg>startup: move sandbox initialization together<commit_after><|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2017 Franka Emika GmbH\n\/\/ Use of this source code is governed by the Apache-2.0 license, see LICENSE\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <thread>\n\n#include <franka\/exception.h>\n#include <franka\/gripper.h>\n\n\/**\n * @example grasp_object.cpp\n * An example showing how to control FRANKA's gripper.\n *\/\n\nint main(int argc, char** argv) {\n if (argc != 4) {\n std::cerr << \"Usage: .\/grasp_object <gripper-hostname> <homing> <object-width>\" << std::endl;\n return -1;\n }\n\n try {\n franka::Gripper gripper(argv[1]);\n double grasping_width = std::stod(argv[3]);\n\n std::stringstream ss(argv[2]);\n bool homing;\n if (!(ss >> homing)) {\n std::cerr << \"<homing> can be 0 or 1.\" << std::endl;\n return -1;\n }\n\n if (homing) {\n \/\/ Do a homing in order to estimate the maximum grasping width with the current fingers.\n gripper.homing();\n }\n\n \/\/ Check for the maximum grasping width.\n franka::GripperState gripper_state = gripper.readOnce();\n if (gripper_state.max_width < grasping_width) {\n std::cout << \"Object is too large for the current fingers on the gripper.\" << std::endl;\n return -1;\n }\n\n \/\/ Grasp the object.\n if (!gripper.grasp(grasping_width, 0.1, 300)) {\n std::cout << \"Failed to grasp object.\" << std::endl;\n return -1;\n }\n\n \/\/ Wait 3s and check afterwards, if the object is still grasped.\n std::this_thread::sleep_for(std::chrono::duration<double, std::milli>(3000));\n\n gripper_state = gripper.readOnce();\n if (!gripper_state.is_grasped) {\n std::cout << \"Object lost.\" << std::endl;\n return -1;\n }\n\n std::cout << \"Grasped object, will release it now.\" << std::endl;\n gripper.stop();\n } catch (franka::Exception const& e) {\n std::cout << e.what() << std::endl;\n return -1;\n }\n\n return 0;\n}\n<commit_msg>Update gripper example.<commit_after>\/\/ Copyright (c) 2017 Franka Emika GmbH\n\/\/ Use of this source code is governed by the Apache-2.0 license, see LICENSE\n#include <iostream>\n#include <sstream>\n#include <string>\n#include <thread>\n\n#include <franka\/exception.h>\n#include <franka\/gripper.h>\n\n\/**\n * @example grasp_object.cpp\n * An example showing how to control FRANKA's gripper.\n *\/\n\nint main(int argc, char** argv) {\n if (argc != 4) {\n std::cerr << \"Usage: .\/grasp_object <gripper-hostname> <homing> <object-width>\" << std::endl;\n return -1;\n }\n\n try {\n franka::Gripper gripper(argv[1]);\n double grasping_width = std::stod(argv[3]);\n\n std::stringstream ss(argv[2]);\n bool homing;\n if (!(ss >> homing)) {\n std::cerr << \"<homing> can be 0 or 1.\" << std::endl;\n return -1;\n }\n\n if (homing) {\n \/\/ Do a homing in order to estimate the maximum grasping width with the current fingers.\n gripper.homing();\n }\n\n \/\/ Check for the maximum grasping width.\n franka::GripperState gripper_state = gripper.readOnce();\n if (gripper_state.max_width < grasping_width) {\n std::cout << \"Object is too large for the current fingers on the gripper.\" << std::endl;\n return -1;\n }\n\n \/\/ Grasp the object.\n if (!gripper.grasp(grasping_width, 0.1, 60)) {\n std::cout << \"Failed to grasp object.\" << std::endl;\n return -1;\n }\n\n \/\/ Wait 3s and check afterwards, if the object is still grasped.\n std::this_thread::sleep_for(std::chrono::duration<double, std::milli>(3000));\n\n gripper_state = gripper.readOnce();\n if (!gripper_state.is_grasped) {\n std::cout << \"Object lost.\" << std::endl;\n return -1;\n }\n\n std::cout << \"Grasped object, will release it now.\" << std::endl;\n gripper.stop();\n } catch (franka::Exception const& e) {\n std::cout << e.what() << std::endl;\n return -1;\n }\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <functional>\n#include <initializer_list>\n#include <string>\n#include <vector>\n#include <unordered_map>\n#include <algorithm>\n\n\n#include <iostream>\n\n#include <memory>\n\nnamespace parser{\n\n \tclass Sign_{\n std::string name_;\n bool isTerm_;\n public:\n Sign_(std::string n, bool t){\n name_ = n;\n isTerm_ = t;\n }\n\t\tSign_(std::string n){\n\t\t\tname_ = n;\n\t\t isTerm_ = true;\t\n\t\t}\n\t\tSign_(){\n\t\t\tname_ =\"\";\n\t\t\tisTerm_ = true;\n\t\t}\n bool isTerm(){\n return isTerm_;\n }\n std::string name(){\n return name_;\n }\n\t\toperator std::string() const{\n \t\treturn name_;\n\t\t}\n\t};\n\n\t\n\tusing Sign = std::shared_ptr<Sign_>;\n \n\tclass Item{\n\t public:\n Sign left;\n std::vector<Sign> rights;\n int pos;\n Item(Sign l, std::initializer_list<Sign> const & r){\n\t\t\tpos = 0;\n left = l;\n rights.insert(rights.end(),r.begin(), r.end());\n }\n Sign nextSign(){\n \treturn rights[pos];\n }\n void next(){\n\t\t\tif(rights.size() > pos+1)\n \tpos++;\n }\n\t\tbool isLast(){\n\t\t\treturn pos == rights.size()-1;\n\t\t}\n\t\tfriend std::ostream& operator<<(std::ostream &out, const Item &i){\n\t\t\tout << std::string(*i.left) <<\" => \";\n\t\t\tif(i.pos == 0){\n\t\t\t\tout<< \" . \";\n\t\t\t}\n\t\t\tfor(int j=0;j<i.rights.size();j++){\n\t\t\t\tout << std::string(*i.rights[j]);\n\t\t\t\tif(i.pos == j+1){\n\t\t\t\t\tout<< \" . \";\n\t\t\t\t}else{\n\t\t\t\t\tout<<\" \";\n\t\t\t\t}\n\t\t\t}\n\t\t\tout << \"\\n\";\n\t\t\treturn out;\n\t\t}\n\t};\n\t\n\tSign mS(std::string name){\n\t\treturn Sign(new Sign_(name,false));\n\t}\n\tSign mtS(std::string name){\n\t\treturn Sign(new Sign_(name));\n\t}\n\n auto E = mS(\"E\");\n auto Eq = mS(\"Eq\");\n auto T = mS(\"T\");\n auto Tq = mS(\"Tq\");\n auto F = mS(\"F\");\n\n\tauto Eps = mtS(\"Epsilon\");\n\tauto Fin = mtS(\"Fin\");\n\n\tstd::vector<Item> rules;\n\n\tstd::vector<Item> getItems(Sign s){\n\t\t\/\/std::cout << std::string(*s) << std::endl;\n\t\tstd::vector<Item> res;\n\t\tfor(auto& i : rules){\n\t\t\tif(i.left->name() == s->name()){\n\t\t\t\tres.push_back(i);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n std::vector<Sign> first(Sign sign){\n if(sign->isTerm()){\n return {sign};\n }\n std::vector<Sign> res; \n\t\tauto items = getItems( sign );\n\t\tif(items.size() == 0)\n\t\t\treturn res;\n\n for(auto& i : items){\n\t\t\t\/\/std::cout << std::string( *i.left ) << \" \" << i.rights.size() <<std::endl;\n \tauto ext = first(i.rights[0]);\n if(find(ext.begin(), ext.end(), Eps) != ext.end()){\n\t\t\t\t\/\/std::cout <<\"Eps!\\n\";\n \text.erase(remove(ext.begin(), ext.end(), Eps), ext.end());\n \tres.insert(res.end(), ext.begin(), ext.end());\n if(i.rights.size() >= 2){\n auto nxt = first(i.rights[1]);\n res.insert(res.end(), nxt.begin(), nxt.end());\n }else{\n res.push_back( Eps);\n }\n }else{\n \tres.insert(res.end(), ext.begin(), ext.end());\n\t\t\t}\n\t\t}\n return res;\n }\n\/*\n std::vector<Sing> first(initializer_list<Sign>& l){\n if(l.size() == 0)\n return {Sign(\"Epsilon\")};\n\n std::vector<Rule> res;\n \n auto it = l.begin();\n if(*it == Sign(\"Epsilon\")) return {Sign(\"Epsilon\")};\n if((*it)->isTerm()) return {*it};\n\n auto ext = first(*it); \n if(find(ext.begin(), ext.end(), Sign(\"Epsilon\")) != ext.end()){\n ext.erase(remove(ext.begin(), ext.end(), Sign(\"Epsilon\")), ext.end());\n res.insert(res.end(), ext.begin(), ext.end()); \n if(l.size() >= 2 ){\n it++;\n auto next = first(*it);\n res.insert(res.end(), next.begin(), next.end());\n }\n return res;\n }else{\n return ext;\n }\n }\n*\/\n std::vector<Sign> follow(Sign& s){\n\t\tstd::cout<< std::string(*s) << std::endl;\n std::vector<Sign> res;\n \n if(s == E){\n res.push_back(Fin);\n }\n\n for(auto rit = rules.cbegin(); rit != rules.cend(); ++rit){\n auto ls = rit->left; \n if(ls == s) continue;\n\n\t\t\tauto rs = rit->rights;\n for(size_t i = 1; i < rs.size(); i++){\n \tif(rs[i] == s){\n \tif(i + 1 < rs.size()){ \n \tauto ext = first(rs[i+1]);\n if(find(ext.begin(), ext.end(), Eps) != ext.end()){\n \t \tauto left = follow(ls);\n res.insert(res.end(), left.begin(), left.end());\n }\n ext.erase(remove(ext.begin(), ext.end(), Eps), ext.end());\n \tres.insert(res.end(), ext.begin(), ext.end());\n }else{\n auto left = follow(ls);\n res.insert(res.end(), left.begin(), left.end());\n }\n }\n }\n }\n return res;\n }\n\n\tvoid closure(std::vector<Item>& I){\n\t\tint size = I.size();\n\t\tstd::vector<Sign> alreadys;\n\t\tdo{\n\t\t\tsize = I.size();\n\t\t\tstd::cout<<\"LOOP\\n\";\n\t\t\tfor(auto i : I){\n\t\t\t\t\/\/std::cout<< i << std::endl;\n\t\t\t\tauto X = getItems( i.nextSign() );\n\n\t\t\t\tstd::cout<< \"SIZE:\"<<X.size()<<std::endl;\n\t\t\t\t\/\/std::cout<<\"item \\n\";\n\t\t\t\tfor(auto x : X){\n\t\t\t\t\tstd::cout<< \"#######\\n\" << x <<\"\\n\";\n\t\t\t\t\t\/\/if(find(alreadys.begin(), alreadys.end(), x.left) != alreadys.end()){\n\t\t\t\t\t\t\/\/std::cout<<\":CON\\n\";\n\t\t\t\t\t\/\/\t\tcontinue;\n\t\t\t\t\t\/\/}\n\t\t\t\t\t\/\/std::cout<<\"loop\\n\";\n\t\t\t\t\t\/\/x.next();\n\t\t\t\t\t\/\/std::cout<<\"push X\\n\";\n\t\t\t\t\tI.push_back(x);\n\t\t\t\t\t\/\/alreadys.push_back(x.left);\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cout<< size <<\" \"<<I.size() << \"\\n\";\n\t\t}while( size != I.size() );\n\t}\n\n\tstd::vector<Item> Goto(std::vector<Item> I,Sign X){\n\t\tstd::vector<Item> J;\n\t\t\/*\n\t\tstd::cout << \"Goto argv b--------\\n\";\n\t\tfor(auto i : I) std::cout<< i;\n\t\tstd::cout<< std::string(*X)<<std::endl;;\n\t\tstd::cout << \"Goto argv e--------\\n\";\n\t\t\/\/ *\/\n\t\tfor(auto i : I){\n\t\t\tif(i.nextSign() == X && !i.isLast()){\n\t\t\t\t\/\/std::cout<<\"1^^^^\\n\";\n\t\t\t\ti.next();\n\t\t\t\t\/\/std::cout<< i;\n \tJ.push_back(i);\n\t\t\t\t\/\/std::cout<<\"2^^^^\\n\";\n\t\t\t}\n\t\t}\n\t\tclosure(J);\n\t\treturn J;\n\t}\n\n\tvoid DFA(){\n\t\tstd::cout<<\"Start\\n\";\n\t\tstd::vector<std::vector<Item>> T;\n\t\tstd::vector<std::vector<Item>> Tt;\n\t\tstd::vector<Item> f({ Item( mS(\"S\"),{ E, Fin}) });\n\t\tclosure(f);\n\t\tT.push_back(f);\n\t\tint size = T.size();\n\t\tint count = 0;\n\t\tstd::cout<< f[0];\n\t\tstd::cout<<\"++++++++++++++++\\n\";\n\t\tTt = T;\n\t\tstd::vector<Sign> alreadys;\n\t\twhile( count < 5){\n\t\t\tcount++;\n\t\t\tfor(auto t : T){\n\t\t\t\tfor(auto i : t){\n\t\t\t\t\tstd::cout<< \"i loop start\\n\"<< i;\n\t\t\t\t\tif(find(alreadys.begin(), alreadys.end(), i.nextSign()) != alreadys.end())\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\talreadys.push_back(i.nextSign());\n\t\t\t\t\tauto J = Goto( t, i.nextSign());\n\t\t\t\t\tstd::cout << \"***************************\\n\";\n\t\t\t\t\tstd::cout << \"I:\"<< std::string(*i.nextSign()) << std::endl;\n\t\t\t\t\tfor(auto j : J)\n\t\t\t\t\t\tstd::cout << j;\n\t\t\t\t\tstd::cout << \"***************************\\n\";\n\t\t\t\t\tT.push_back(J);\n\t\t\t\t\tstd::cout<<\"i loop end\\n\";\n\t\t\t\t}\n\t\t\t\tstd::cout<<\"t loop end\\n\";\n\t\t\t}\n\t\t\tstd::cout<< size << \" \" << T.size() << std::endl; \n\t\t\tif( size != T.size()){\n\t\t\t\tsize = T.size();\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tstd::cout<<\"####################\\n\";\n\t\tfor(auto t : T){\n\t\t\tstd::cout<<\"~~~~~~~~~~~~~~~\\n\";\n\t\t\tfor(auto i : t){\n\t\t\t\tstd::cout<< i;\n\t\t\t}\n\t\t}\n\t}\n\tvoid setup(){\n\n rules.push_back(Item( E,\n { T, Eq }\n ));\n\n rules.push_back(Item( Eq,\n {mtS(\"+\"), T, Eq }\n ));\n rules.push_back(Item( Eq,\n { Eps }\n ));\n \n\t\trules.push_back(Item( T,\n { F, Tq}\n ));\n \n\t\trules.push_back(Item( Tq,\n { mtS(\"*\"), F, Tq }\n ));\n rules.push_back(Item( Tq,\n { Eps }\n ));\n\n rules.push_back(Item( F,\n { mtS(\"(\"), E, mtS(\")\")}\n ));\n rules.push_back(Item( F,\n { mtS(\"i\")}\n\t\t));\n } \n\n\tusing namespace std;\n \n void test(Sign S){\n std::cout << \"==== \"<<std::string(*S)<< \" ===\\n\"; \n for(auto& s: first(S)){\n std::cout << std::string(*s) << std::endl;\n }\n std::cout<<\"===\\n\";\n for(auto& r: follow(S)){\n std::cout << std::string(*r) << std::endl;\n }\n\t}\n\n\n void parser(){\n setup(); \n \/*\n\t\ttest(E);\n\n test(Eq);\n\n test(T);\n\n test(Tq);\n\n test(F);\n\t\t\n std::cout<<\"===\\n\";\n\t\tstd::vector<Item> items = { Item( mS(\"S\"), { E, Fin}) };\n closure(items);\n\t\tstd::cout<<\"~~~~~~~~~~~~~~~\\n\";\n for(auto i : items)\n\t\t\tstd::cout << i;\n\t\t*\/\n\t\tDFA();\n\t\n \/\/delete items;\n \n \/\/create_dfa();\n \/\/for(auto rit = rule_table.begin(); rit != rule_table.end(); ++rit){\n \/\/ if(rit->second)\n \/\/ rit->second.reset();\n \/\/}\n }\n}\n\n\nint main(){\n parser::parser();\n return 0;\n}\n\/*\n * ==== T ===\n * (\n * i\n * ===\n * FIN\n * )\n * +\n * ==== Tq ===\n * *\n * Epsilon\n * ===\n * FIN\n * )\n * +\n * ==== F ===\n * (\n * i\n * ===\n * FIN\n * )\n * +\n * *\n * ===\n *\/\n\n<commit_msg>[Fix] first(initializer_list).<commit_after>#include <functional>\n#include <initializer_list>\n#include <string>\n#include <vector>\n#include <unordered_map>\n#include <algorithm>\n\n\n#include <iostream>\n\n#include <memory>\n\nnamespace parser{\n\n \tclass Sign_{\n std::string name_;\n bool isTerm_;\n public:\n Sign_(std::string n, bool t){\n name_ = n;\n isTerm_ = t;\n }\n\t\tSign_(std::string n){\n\t\t\tname_ = n;\n\t\t isTerm_ = true;\t\n\t\t}\n\t\tSign_(){\n\t\t\tname_ =\"\";\n\t\t\tisTerm_ = true;\n\t\t}\n bool isTerm(){\n return isTerm_;\n }\n std::string name(){\n return name_;\n }\n\t\toperator std::string() const{\n \t\treturn name_;\n\t\t}\n\t};\n\n\t\n\tusing Sign = std::shared_ptr<Sign_>;\n \n\tclass Item{\n\t public:\n Sign left;\n std::vector<Sign> rights;\n int pos;\n Item(Sign l, std::initializer_list<Sign> const & r){\n\t\t\tpos = 0;\n left = l;\n rights.insert(rights.end(),r.begin(), r.end());\n }\n Sign nextSign(){\n \treturn rights[pos];\n }\n void next(){\n\t\t\tif(rights.size() > pos+1)\n \tpos++;\n }\n\t\tbool isLast(){\n\t\t\treturn pos == rights.size()-1;\n\t\t}\n\t\tfriend std::ostream& operator<<(std::ostream &out, const Item &i){\n\t\t\tout << std::string(*i.left) <<\" => \";\n\t\t\tif(i.pos == 0){\n\t\t\t\tout<< \" . \";\n\t\t\t}\n\t\t\tfor(int j=0;j<i.rights.size();j++){\n\t\t\t\tout << std::string(*i.rights[j]);\n\t\t\t\tif(i.pos == j+1){\n\t\t\t\t\tout<< \" . \";\n\t\t\t\t}else{\n\t\t\t\t\tout<<\" \";\n\t\t\t\t}\n\t\t\t}\n\t\t\tout << \"\\n\";\n\t\t\treturn out;\n\t\t}\n\t};\n\t\n\tSign mS(std::string name){\n\t\treturn Sign(new Sign_(name,false));\n\t}\n\tSign mtS(std::string name){\n\t\treturn Sign(new Sign_(name));\n\t}\n\n auto E = mS(\"E\");\n auto Eq = mS(\"Eq\");\n auto T = mS(\"T\");\n auto Tq = mS(\"Tq\");\n auto F = mS(\"F\");\n\n\tauto Eps = mtS(\"Epsilon\");\n\tauto Fin = mtS(\"Fin\");\n\n\tstd::vector<Item> rules;\n\n\tstd::vector<Item> getItems(Sign s){\n\t\t\/\/std::cout << std::string(*s) << std::endl;\n\t\tstd::vector<Item> res;\n\t\tfor(auto& i : rules){\n\t\t\tif(i.left->name() == s->name()){\n\t\t\t\tres.push_back(i);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\n std::vector<Sign> first(Sign sign){\n if(sign->isTerm()){\n return {sign};\n }\n std::vector<Sign> res; \n\t\tauto items = getItems( sign );\n\t\tif(items.size() == 0)\n\t\t\treturn res;\n\n for(auto& i : items){\n\t\t\t\/\/std::cout << std::string( *i.left ) << \" \" << i.rights.size() <<std::endl;\n \tauto ext = first(i.rights[0]);\n if(find(ext.begin(), ext.end(), Eps) != ext.end()){\n\t\t\t\t\/\/std::cout <<\"Eps!\\n\";\n \text.erase(remove(ext.begin(), ext.end(), Eps), ext.end());\n \tres.insert(res.end(), ext.begin(), ext.end());\n if(i.rights.size() >= 2){\n auto nxt = first(i.rights[1]);\n res.insert(res.end(), nxt.begin(), nxt.end());\n }else{\n res.push_back( Eps);\n }\n }else{\n \tres.insert(res.end(), ext.begin(), ext.end());\n\t\t\t}\n\t\t}\n return res;\n }\n\n std::vector<Sign> first(std::initializer_list<Sign>& l){\n if(l.size() == 0)\n return {Eps};\n\n std::vector<Sign> res;\n \n auto it = l.begin();\n if(*it == Eps) return {Eps};\n if((*it)->isTerm()) return {*it};\n\n auto ext = first(*it); \n if(find(ext.begin(), ext.end(), Eps) != ext.end()){\n ext.erase(remove(ext.begin(), ext.end(), Eps), ext.end());\n res.insert(res.end(), ext.begin(), ext.end()); \n if(l.size() >= 2 ){\n it++;\n auto next = first(*it);\n res.insert(res.end(), next.begin(), next.end());\n }else{\n\t\t\t\tres.push_back(Eps);\n\t\t\t}\n }\n return ext;\n }\n\n std::vector<Sign> follow(Sign& s){\n\t\tstd::cout<< std::string(*s) << std::endl;\n std::vector<Sign> res;\n \n if(s == E){\n res.push_back(Fin);\n }\n\n for(auto rit = rules.cbegin(); rit != rules.cend(); ++rit){\n auto ls = rit->left; \n if(ls == s) continue;\n\n\t\t\tauto rs = rit->rights;\n for(size_t i = 1; i < rs.size(); i++){\n \tif(rs[i] == s){\n \tif(i + 1 < rs.size()){ \n \tauto ext = first(rs[i+1]);\n if(find(ext.begin(), ext.end(), Eps) != ext.end()){\n \t \tauto left = follow(ls);\n res.insert(res.end(), left.begin(), left.end());\n }\n ext.erase(remove(ext.begin(), ext.end(), Eps), ext.end());\n \tres.insert(res.end(), ext.begin(), ext.end());\n }else{\n auto left = follow(ls);\n res.insert(res.end(), left.begin(), left.end());\n }\n }\n }\n }\n return res;\n }\n\n\tvoid closure(std::vector<Item>& I){\n\t\tint size = I.size();\n\t\tstd::vector<Sign> alreadys;\n\t\tdo{\n\t\t\tsize = I.size();\n\t\t\tstd::cout<<\"LOOP\\n\";\n\t\t\tfor(auto i : I){\n\t\t\t\t\/\/std::cout<< i << std::endl;\n\t\t\t\tauto X = getItems( i.nextSign() );\n\n\t\t\t\tstd::cout<< \"SIZE:\"<<X.size()<<std::endl;\n\t\t\t\t\/\/std::cout<<\"item \\n\";\n\t\t\t\tfor(auto x : X){\n\t\t\t\t\tstd::cout<< \"#######\\n\" << x <<\"\\n\";\n\t\t\t\t\t\/\/if(find(alreadys.begin(), alreadys.end(), x.left) != alreadys.end()){\n\t\t\t\t\t\t\/\/std::cout<<\":CON\\n\";\n\t\t\t\t\t\/\/\t\tcontinue;\n\t\t\t\t\t\/\/}\n\t\t\t\t\t\/\/std::cout<<\"loop\\n\";\n\t\t\t\t\t\/\/x.next();\n\t\t\t\t\t\/\/std::cout<<\"push X\\n\";\n\t\t\t\t\tI.push_back(x);\n\t\t\t\t\t\/\/alreadys.push_back(x.left);\n\t\t\t\t}\n\t\t\t}\n\t\t\tstd::cout<< size <<\" \"<<I.size() << \"\\n\";\n\t\t}while( size != I.size() );\n\t}\n\n\tstd::vector<Item> Goto(std::vector<Item> I,Sign X){\n\t\tstd::vector<Item> J;\n\t\t\/*\n\t\tstd::cout << \"Goto argv b--------\\n\";\n\t\tfor(auto i : I) std::cout<< i;\n\t\tstd::cout<< std::string(*X)<<std::endl;;\n\t\tstd::cout << \"Goto argv e--------\\n\";\n\t\t\/\/ *\/\n\t\tfor(auto i : I){\n\t\t\tif(i.nextSign() == X && !i.isLast()){\n\t\t\t\t\/\/std::cout<<\"1^^^^\\n\";\n\t\t\t\ti.next();\n\t\t\t\t\/\/std::cout<< i;\n \tJ.push_back(i);\n\t\t\t\t\/\/std::cout<<\"2^^^^\\n\";\n\t\t\t}\n\t\t}\n\t\tclosure(J);\n\t\treturn J;\n\t}\n\n\tvoid DFA(){\n\t\tstd::cout<<\"Start\\n\";\n\t\tstd::vector<std::vector<Item>> T;\n\t\tstd::vector<std::vector<Item>> Tt;\n\t\tstd::vector<Item> f({ Item( mS(\"S\"),{ E, Fin}) });\n\t\tclosure(f);\n\t\tT.push_back(f);\n\t\tint size = T.size();\n\t\tint count = 0;\n\t\tstd::cout<< f[0];\n\t\tstd::cout<<\"++++++++++++++++\\n\";\n\t\tTt = T;\n\t\tstd::vector<Sign> alreadys;\n\t\twhile( count < 5){\n\t\t\tcount++;\n\t\t\tfor(auto t : T){\n\t\t\t\tfor(auto i : t){\n\t\t\t\t\tstd::cout<< \"i loop start\\n\"<< i;\n\t\t\t\t\tif(find(alreadys.begin(), alreadys.end(), i.nextSign()) != alreadys.end())\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\talreadys.push_back(i.nextSign());\n\t\t\t\t\tauto J = Goto( t, i.nextSign());\n\t\t\t\t\tstd::cout << \"***************************\\n\";\n\t\t\t\t\tstd::cout << \"I:\"<< std::string(*i.nextSign()) << std::endl;\n\t\t\t\t\tfor(auto j : J)\n\t\t\t\t\t\tstd::cout << j;\n\t\t\t\t\tstd::cout << \"***************************\\n\";\n\t\t\t\t\tT.push_back(J);\n\t\t\t\t\tstd::cout<<\"i loop end\\n\";\n\t\t\t\t}\n\t\t\t\tstd::cout<<\"t loop end\\n\";\n\t\t\t}\n\t\t\tstd::cout<< size << \" \" << T.size() << std::endl; \n\t\t\tif( size != T.size()){\n\t\t\t\tsize = T.size();\n\t\t\t}else{\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tstd::cout<<\"####################\\n\";\n\t\tfor(auto t : T){\n\t\t\tstd::cout<<\"~~~~~~~~~~~~~~~\\n\";\n\t\t\tfor(auto i : t){\n\t\t\t\tstd::cout<< i;\n\t\t\t}\n\t\t}\n\t}\n\tvoid setup(){\n\n rules.push_back(Item( E,\n { T, Eq }\n ));\n\n rules.push_back(Item( Eq,\n {mtS(\"+\"), T, Eq }\n ));\n rules.push_back(Item( Eq,\n { Eps }\n ));\n \n\t\trules.push_back(Item( T,\n { F, Tq}\n ));\n \n\t\trules.push_back(Item( Tq,\n { mtS(\"*\"), F, Tq }\n ));\n rules.push_back(Item( Tq,\n { Eps }\n ));\n\n rules.push_back(Item( F,\n { mtS(\"(\"), E, mtS(\")\")}\n ));\n rules.push_back(Item( F,\n { mtS(\"i\")}\n\t\t));\n } \n\n\tusing namespace std;\n \n void test(Sign S){\n std::cout << \"==== \"<<std::string(*S)<< \" ===\\n\"; \n for(auto& s: first(S)){\n std::cout << std::string(*s) << std::endl;\n }\n std::cout<<\"===\\n\";\n for(auto& r: follow(S)){\n std::cout << std::string(*r) << std::endl;\n }\n\t}\n\n\n void parser(){\n setup(); \n \/*\n\t\ttest(E);\n\n test(Eq);\n\n test(T);\n\n test(Tq);\n\n test(F);\n\t\t\n std::cout<<\"===\\n\";\n\t\tstd::vector<Item> items = { Item( mS(\"S\"), { E, Fin}) };\n closure(items);\n\t\tstd::cout<<\"~~~~~~~~~~~~~~~\\n\";\n for(auto i : items)\n\t\t\tstd::cout << i;\n\t\t*\/\n\t\tDFA();\n\t\n \/\/delete items;\n \n \/\/create_dfa();\n \/\/for(auto rit = rule_table.begin(); rit != rule_table.end(); ++rit){\n \/\/ if(rit->second)\n \/\/ rit->second.reset();\n \/\/}\n }\n}\n\n\nint main(){\n parser::parser();\n return 0;\n}\n\/*\n * ==== T ===\n * (\n * i\n * ===\n * FIN\n * )\n * +\n * ==== Tq ===\n * *\n * Epsilon\n * ===\n * FIN\n * )\n * +\n * ==== F ===\n * (\n * i\n * ===\n * FIN\n * )\n * +\n * *\n * ===\n *\/\n\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright 2010 Gregory Szorc\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <zippylog\/envelope.hpp>\n\n#include <gtest\/gtest.h>\n#include <string.h>\n\nusing ::std::invalid_argument;\nusing ::std::string;\nusing ::zippylog::Envelope;\nusing ::zmq::message_t;\n\nnamespace zippylog {\n\nTEST(EnvelopeTest, EmptyConstructor)\n{\n ASSERT_NO_THROW(Envelope e());\n \n Envelope e;\n EXPECT_EQ(0, e.MessageCount());\n string s;\n EXPECT_TRUE(e.Serialize(s));\n}\n\nTEST(EnvelopeTest, InvalidDataConstruct)\n{\n ASSERT_THROW(Envelope e(NULL, 0), invalid_argument);\n ASSERT_THROW(Envelope e(NULL, 10), invalid_argument);\n ASSERT_THROW(Envelope e((void *)324234, 0), invalid_argument);\n ASSERT_THROW(Envelope e((void *)352537, -10), invalid_argument);\n}\n\nTEST(EnvelopeTest, ZMQSerialization)\n{\n Envelope e;\n\n string expected;\n ASSERT_TRUE(e.Serialize(expected));\n message_t m;\n\n ASSERT_TRUE(e.ToZmqMessage(m));\n ASSERT_EQ(expected.length(), m.size());\n EXPECT_TRUE(0 == memcmp(m.data(), expected.data(), m.size()));\n}\n\nTEST(EnvelopeTest, ZMQProtocolSerialization)\n{\n Envelope e;\n\n string expected(1, 0x01);\n ASSERT_TRUE(e.Serialize(expected));\n message_t m;\n ASSERT_TRUE(e.ToProtocolZmqMessage(m));\n ASSERT_EQ(expected.length(), m.size());\n EXPECT_EQ(0x01, *((char *)m.data()));\n EXPECT_TRUE(0 == memcmp(m.data(), expected.data(), m.size()));\n}\n\n} \/\/ namespace\n<commit_msg>add a Serialize() test<commit_after>\/\/ Copyright 2010 Gregory Szorc\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include <zippylog\/envelope.hpp>\n\n#include <gtest\/gtest.h>\n#include <string.h>\n\nusing ::std::invalid_argument;\nusing ::std::string;\nusing ::zippylog::Envelope;\nusing ::zmq::message_t;\n\nnamespace zippylog {\n\nTEST(EnvelopeTest, EmptyConstructor)\n{\n ASSERT_NO_THROW(Envelope e());\n \n Envelope e;\n EXPECT_EQ(0, e.MessageCount());\n string s;\n EXPECT_TRUE(e.Serialize(s));\n}\n\nTEST(EnvelopeTest, InvalidDataConstruct)\n{\n ASSERT_THROW(Envelope e(NULL, 0), invalid_argument);\n ASSERT_THROW(Envelope e(NULL, 10), invalid_argument);\n ASSERT_THROW(Envelope e((void *)324234, 0), invalid_argument);\n ASSERT_THROW(Envelope e((void *)352537, -10), invalid_argument);\n}\n\nTEST(EnvelopeTest, Serialize)\n{\n Envelope e;\n string s;\n ASSERT_TRUE(e.Serialize(s));\n\n string s2 = \"foo\";\n ASSERT_TRUE(e.Serialize(s2));\n ASSERT_EQ(3 + s.length(), s2.length());\n}\n\nTEST(EnvelopeTest, ZMQSerialization)\n{\n Envelope e;\n\n string expected;\n ASSERT_TRUE(e.Serialize(expected));\n message_t m;\n\n ASSERT_TRUE(e.ToZmqMessage(m));\n ASSERT_EQ(expected.length(), m.size());\n EXPECT_TRUE(0 == memcmp(m.data(), expected.data(), m.size()));\n}\n\nTEST(EnvelopeTest, ZMQProtocolSerialization)\n{\n Envelope e;\n\n string expected(1, 0x01);\n ASSERT_TRUE(e.Serialize(expected));\n message_t m;\n ASSERT_TRUE(e.ToProtocolZmqMessage(m));\n ASSERT_EQ(expected.length(), m.size());\n EXPECT_EQ(0x01, *((char *)m.data()));\n EXPECT_TRUE(0 == memcmp(m.data(), expected.data(), m.size()));\n}\n\n} \/\/ namespace\n<|endoftext|>"} {"text":"<commit_before>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_eff_config_thermal.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_eff_config_thermal.C\n\/\/\/ @brief Perform thermal calculations as part of the effective configuration\n\/\/\/\n\/\/ *HWP HWP Owner: Jacob Harvey <jlharvey@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 3\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <vector>\n#include <p9_mss_eff_config_thermal.H>\n#include <p9_mss_bulk_pwr_throttles.H>\n#include <lib\/power_thermal\/throttle.H>\n#include <lib\/power_thermal\/decoder.H>\n#include <lib\/dimm\/kind.H>\n#include <lib\/utils\/count_dimm.H>\n#include <lib\/shared\/mss_const.H>\n#include <mss.H>\nextern \"C\"\n{\n \/\/\/\n \/\/\/ @brief Perform thermal calculations as part of the effective configuration\n \/\/\/ @param[in] i_targets an array of MCS targets all on the same VDDR domain\n \/\/\/ @return FAPI2_RC_SUCCESS iff ok\n \/\/\/ @note sets ATTR_MSS_MEM_WATT_TARGET, ATTR_MSS_RUNTIME_MEM_THROTTLED_N_COMMANDS_PER_PORT and _PER_SLOT, and ATTR_MSS_PORT_MAXPOWER\n fapi2::ReturnCode p9_mss_eff_config_thermal( const std::vector< fapi2::Target<fapi2::TARGET_TYPE_MCS> >& i_targets )\n {\n FAPI_INF(\"Start effective config thermal\");\n fapi2::ReturnCode l_rc;\n\n std::vector< uint64_t > l_slope (mss::power_thermal::SIZE_OF_POWER_CURVES_ATTRS, 0);\n std::vector< uint64_t > l_intercept (mss::power_thermal::SIZE_OF_POWER_CURVES_ATTRS, 0);\n std::vector< uint64_t > l_thermal_power_limit (mss::power_thermal::SIZE_OF_THERMAL_ATTR, 0);\n\n uint16_t l_vddr_slope [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_vddr_int [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_total_slope [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_total_int [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint32_t l_thermal_power [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n\n FAPI_TRY( mss::mrw_pwr_slope (l_slope.data()), \"Error in p9_mss_eff_config_thermal\");\n FAPI_TRY( mss::mrw_pwr_intercept (l_intercept.data()), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_TRY( mss::mrw_thermal_memory_power_limit (l_thermal_power_limit.data()), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_TRY( mss::power_thermal::set_runtime_m_and_watt_limit (i_targets), \"Error in p9_mss_eff_config_thermal\");\n\n FAPI_INF(\"Size of vectors are %d %d %d\", l_slope.size(), l_intercept.size(), l_thermal_power_limit.size());\n\n \/\/Restore runtime_throttles from safemode setting\n \/\/Decode and set power curve attributes at the same time\n for (const auto& l_mcs : i_targets )\n {\n \/\/Not doing any work if there are no dimms installed\n if (mss::count_dimm(l_mcs) == 0)\n {\n FAPI_INF(\"Skipping eff_config thermal because no dimms %s\", mss::c_str(l_mcs));\n continue;\n }\n\n FAPI_TRY( mss::power_thermal::get_power_attrs(l_mcs,\n l_slope,\n l_intercept,\n l_thermal_power_limit,\n l_vddr_slope,\n l_vddr_int,\n l_total_slope,\n l_total_int,\n l_thermal_power));\n\n \/\/Sets throttles to max_databus_util value\n FAPI_INF(\"Restoring throttles\");\n FAPI_TRY( mss::power_thermal::restore_runtime_throttles(l_mcs), \"Error in p9_mss_eff_config_thermal\");\n\n \/\/Set the power attribute (TOTAL_PWR) to just VDDR for the POWER bulk_pwr_throttles, restore to vddr+vpp later for OCC\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_SLOPE,\n l_mcs,\n l_vddr_slope));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_INTERCEPT,\n l_mcs,\n l_vddr_int));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_DIMM_THERMAL_LIMIT,\n l_mcs,\n l_thermal_power));\n }\n\n FAPI_INF(\"Starting bulk_pwr\");\n \/\/get the thermal limits, done per dimm and set to worst case for the slot and port throttles\n \/\/Bulk_pwr sets the general, all purpose ATTR_MSS_MEM_THROTTLED_N_COMMANDS_PER_SLOT, _PER_PORT, and MAXPOWER ATTRs\n FAPI_EXEC_HWP(l_rc, p9_mss_bulk_pwr_throttles, i_targets, mss::throttle_type::POWER);\n FAPI_TRY(l_rc, \"Failed running p9_mss_bulk_pwr_throttles\");\n\n \/\/Set runtime throttles to worst case between ATTR_MSS_MEM_THROTTLED_N_COMMANDS_PER_SLOT\n \/\/and ATTR_MSS_MEM_RUNTIME_THROTTLED_N_COMMANDS_PER_SLOT and the _PORT equivalents also\n FAPI_INF(\"Starting update\");\n FAPI_TRY( mss::power_thermal::update_runtime_throttles (i_targets), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_INF(\"finished update\");\n\n \/\/Set VDDR+VPP power curve values\n for ( const auto& l_mcs : i_targets )\n {\n if (mss::count_dimm(l_mcs) == 0)\n {\n continue;\n }\n\n\n \/\/Zero out the arrays\n memset(l_vddr_slope, 0, sizeof(l_vddr_slope));\n memset(l_vddr_int, 0, sizeof(l_vddr_int));\n memset(l_total_slope, 0, sizeof(l_total_slope));\n memset(l_total_int, 0, sizeof(l_total_int));\n memset(l_thermal_power, 0, sizeof(l_thermal_power));\n\n FAPI_TRY( mss::power_thermal::get_power_attrs(l_mcs,\n l_slope,\n l_intercept,\n l_thermal_power_limit,\n l_vddr_slope,\n l_vddr_int,\n l_total_slope,\n l_total_int,\n l_thermal_power));\n\n FAPI_INF( \"VDDR+VPP power curve slope is %d, int is %d, thermal_power is %d\", l_total_slope[0][0], l_total_int[0][0],\n l_thermal_power[0][0]);\n\n \/\/Set the power curve attributes (TOTAL_PWR) to vpp+vdd power slope and intercept\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_SLOPE,\n l_mcs,\n l_total_slope));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_INTERCEPT,\n l_mcs,\n l_total_int));\n }\n\n \/\/Run thermal throttles with the VDDR+VPP power curves\n FAPI_EXEC_HWP(l_rc, p9_mss_bulk_pwr_throttles, i_targets, mss::throttle_type::THERMAL);\n FAPI_TRY(l_rc, \"Failed running p9_mss_bulk_pwr_throttles with THERMAL throttling in p9_mss_eff_config_thermal\");\n \/\/Update everything to worst case\n FAPI_TRY( mss::power_thermal::update_runtime_throttles (i_targets), \"Error in p9_mss_eff_config_thermal\" );\n\n \/\/Done\n FAPI_INF( \"End effective config thermal\");\n\n fapi_try_exit:\n return fapi2::current_err;\n }\n} \/\/extern C\n<commit_msg>Moves count_dimm to be in the memory generic folder<commit_after>\/* IBM_PROLOG_BEGIN_TAG *\/\n\/* This is an automatically generated prolog. *\/\n\/* *\/\n\/* $Source: src\/import\/chips\/p9\/procedures\/hwp\/memory\/p9_mss_eff_config_thermal.C $ *\/\n\/* *\/\n\/* OpenPOWER HostBoot Project *\/\n\/* *\/\n\/* Contributors Listed Below - COPYRIGHT 2015,2019 *\/\n\/* [+] International Business Machines Corp. *\/\n\/* *\/\n\/* *\/\n\/* Licensed under the Apache License, Version 2.0 (the \"License\"); *\/\n\/* you may not use this file except in compliance with the License. *\/\n\/* You may obtain a copy of the License at *\/\n\/* *\/\n\/* http:\/\/www.apache.org\/licenses\/LICENSE-2.0 *\/\n\/* *\/\n\/* Unless required by applicable law or agreed to in writing, software *\/\n\/* distributed under the License is distributed on an \"AS IS\" BASIS, *\/\n\/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or *\/\n\/* implied. See the License for the specific language governing *\/\n\/* permissions and limitations under the License. *\/\n\/* *\/\n\/* IBM_PROLOG_END_TAG *\/\n\n\/\/\/\n\/\/\/ @file p9_mss_eff_config_thermal.C\n\/\/\/ @brief Perform thermal calculations as part of the effective configuration\n\/\/\/\n\/\/ *HWP HWP Owner: Jacob Harvey <jlharvey@us.ibm.com>\n\/\/ *HWP HWP Backup: Andre Marin <aamarin@us.ibm.com>\n\/\/ *HWP Team: Memory\n\/\/ *HWP Level: 3\n\/\/ *HWP Consumed by: FSP:HB\n\n#include <fapi2.H>\n#include <vector>\n#include <p9_mss_eff_config_thermal.H>\n#include <p9_mss_bulk_pwr_throttles.H>\n#include <lib\/power_thermal\/throttle.H>\n#include <lib\/power_thermal\/decoder.H>\n#include <lib\/dimm\/kind.H>\n#include <generic\/memory\/lib\/utils\/count_dimm.H>\n#include <lib\/shared\/mss_const.H>\n#include <mss.H>\nextern \"C\"\n{\n \/\/\/\n \/\/\/ @brief Perform thermal calculations as part of the effective configuration\n \/\/\/ @param[in] i_targets an array of MCS targets all on the same VDDR domain\n \/\/\/ @return FAPI2_RC_SUCCESS iff ok\n \/\/\/ @note sets ATTR_MSS_MEM_WATT_TARGET, ATTR_MSS_RUNTIME_MEM_THROTTLED_N_COMMANDS_PER_PORT and _PER_SLOT, and ATTR_MSS_PORT_MAXPOWER\n fapi2::ReturnCode p9_mss_eff_config_thermal( const std::vector< fapi2::Target<fapi2::TARGET_TYPE_MCS> >& i_targets )\n {\n FAPI_INF(\"Start effective config thermal\");\n fapi2::ReturnCode l_rc;\n\n std::vector< uint64_t > l_slope (mss::power_thermal::SIZE_OF_POWER_CURVES_ATTRS, 0);\n std::vector< uint64_t > l_intercept (mss::power_thermal::SIZE_OF_POWER_CURVES_ATTRS, 0);\n std::vector< uint64_t > l_thermal_power_limit (mss::power_thermal::SIZE_OF_THERMAL_ATTR, 0);\n\n uint16_t l_vddr_slope [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_vddr_int [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_total_slope [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint16_t l_total_int [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n uint32_t l_thermal_power [mss::PORTS_PER_MCS][mss::MAX_DIMM_PER_PORT] = {};\n\n FAPI_TRY( mss::mrw_pwr_slope (l_slope.data()), \"Error in p9_mss_eff_config_thermal\");\n FAPI_TRY( mss::mrw_pwr_intercept (l_intercept.data()), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_TRY( mss::mrw_thermal_memory_power_limit (l_thermal_power_limit.data()), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_TRY( mss::power_thermal::set_runtime_m_and_watt_limit (i_targets), \"Error in p9_mss_eff_config_thermal\");\n\n FAPI_INF(\"Size of vectors are %d %d %d\", l_slope.size(), l_intercept.size(), l_thermal_power_limit.size());\n\n \/\/Restore runtime_throttles from safemode setting\n \/\/Decode and set power curve attributes at the same time\n for (const auto& l_mcs : i_targets )\n {\n \/\/Not doing any work if there are no dimms installed\n if (mss::count_dimm(l_mcs) == 0)\n {\n FAPI_INF(\"Skipping eff_config thermal because no dimms %s\", mss::c_str(l_mcs));\n continue;\n }\n\n FAPI_TRY( mss::power_thermal::get_power_attrs(l_mcs,\n l_slope,\n l_intercept,\n l_thermal_power_limit,\n l_vddr_slope,\n l_vddr_int,\n l_total_slope,\n l_total_int,\n l_thermal_power));\n\n \/\/Sets throttles to max_databus_util value\n FAPI_INF(\"Restoring throttles\");\n FAPI_TRY( mss::power_thermal::restore_runtime_throttles(l_mcs), \"Error in p9_mss_eff_config_thermal\");\n\n \/\/Set the power attribute (TOTAL_PWR) to just VDDR for the POWER bulk_pwr_throttles, restore to vddr+vpp later for OCC\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_SLOPE,\n l_mcs,\n l_vddr_slope));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_INTERCEPT,\n l_mcs,\n l_vddr_int));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_DIMM_THERMAL_LIMIT,\n l_mcs,\n l_thermal_power));\n }\n\n FAPI_INF(\"Starting bulk_pwr\");\n \/\/get the thermal limits, done per dimm and set to worst case for the slot and port throttles\n \/\/Bulk_pwr sets the general, all purpose ATTR_MSS_MEM_THROTTLED_N_COMMANDS_PER_SLOT, _PER_PORT, and MAXPOWER ATTRs\n FAPI_EXEC_HWP(l_rc, p9_mss_bulk_pwr_throttles, i_targets, mss::throttle_type::POWER);\n FAPI_TRY(l_rc, \"Failed running p9_mss_bulk_pwr_throttles\");\n\n \/\/Set runtime throttles to worst case between ATTR_MSS_MEM_THROTTLED_N_COMMANDS_PER_SLOT\n \/\/and ATTR_MSS_MEM_RUNTIME_THROTTLED_N_COMMANDS_PER_SLOT and the _PORT equivalents also\n FAPI_INF(\"Starting update\");\n FAPI_TRY( mss::power_thermal::update_runtime_throttles (i_targets), \"Error in p9_mss_eff_config_thermal\" );\n FAPI_INF(\"finished update\");\n\n \/\/Set VDDR+VPP power curve values\n for ( const auto& l_mcs : i_targets )\n {\n if (mss::count_dimm(l_mcs) == 0)\n {\n continue;\n }\n\n\n \/\/Zero out the arrays\n memset(l_vddr_slope, 0, sizeof(l_vddr_slope));\n memset(l_vddr_int, 0, sizeof(l_vddr_int));\n memset(l_total_slope, 0, sizeof(l_total_slope));\n memset(l_total_int, 0, sizeof(l_total_int));\n memset(l_thermal_power, 0, sizeof(l_thermal_power));\n\n FAPI_TRY( mss::power_thermal::get_power_attrs(l_mcs,\n l_slope,\n l_intercept,\n l_thermal_power_limit,\n l_vddr_slope,\n l_vddr_int,\n l_total_slope,\n l_total_int,\n l_thermal_power));\n\n FAPI_INF( \"VDDR+VPP power curve slope is %d, int is %d, thermal_power is %d\", l_total_slope[0][0], l_total_int[0][0],\n l_thermal_power[0][0]);\n\n \/\/Set the power curve attributes (TOTAL_PWR) to vpp+vdd power slope and intercept\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_SLOPE,\n l_mcs,\n l_total_slope));\n\n FAPI_TRY( FAPI_ATTR_SET(fapi2::ATTR_MSS_TOTAL_PWR_INTERCEPT,\n l_mcs,\n l_total_int));\n }\n\n \/\/Run thermal throttles with the VDDR+VPP power curves\n FAPI_EXEC_HWP(l_rc, p9_mss_bulk_pwr_throttles, i_targets, mss::throttle_type::THERMAL);\n FAPI_TRY(l_rc, \"Failed running p9_mss_bulk_pwr_throttles with THERMAL throttling in p9_mss_eff_config_thermal\");\n \/\/Update everything to worst case\n FAPI_TRY( mss::power_thermal::update_runtime_throttles (i_targets), \"Error in p9_mss_eff_config_thermal\" );\n\n \/\/Done\n FAPI_INF( \"End effective config thermal\");\n\n fapi_try_exit:\n return fapi2::current_err;\n }\n} \/\/extern C\n<|endoftext|>"} {"text":"<commit_before>\/******************************************************************************\n\n This source file is part of the Avogadro project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"glrenderer.h\"\n\n#include \"avogadrogl.h\"\n\n#include \"shader.h\"\n#include \"shaderprogram.h\"\n#include \"geometrynode.h\"\n#include \"glrendervisitor.h\"\n#include \"textlabel2d.h\"\n#include \"textlabel3d.h\"\n#include \"textrenderstrategy.h\"\n#include \"visitor.h\"\n\n#include <avogadro\/core\/matrix.h>\n\n#include <iostream>\n\nnamespace Avogadro {\nnamespace Rendering {\n\nGLRenderer::GLRenderer()\n : m_valid(false),\n m_textRenderStrategy(NULL),\n m_center(Vector3f::Zero()),\n m_radius(20.0)\n{\n m_overlayCamera.setIdentity();\n}\n\nGLRenderer::~GLRenderer()\n{\n delete m_textRenderStrategy;\n}\n\nvoid GLRenderer::initialize()\n{\n GLenum result = glewInit();\n m_valid = (result == GLEW_OK);\n if (!m_valid) {\n m_error += \"GLEW could not be initialized.\\n\";\n return;\n }\n\n if (!GLEW_VERSION_2_0) {\n m_error += \"GL version 2.0 is not supported by your graphics driver.\\n\";\n m_valid = false;\n return;\n }\n\n resetCamera();\n}\n\nvoid GLRenderer::resize(int width, int height)\n{\n if (!m_valid)\n return;\n\n glViewport(0, 0, static_cast<GLint>(width), static_cast<GLint>(height));\n m_camera.setViewport(width, height);\n m_overlayCamera.setViewport(width, height);\n}\n\nvoid GLRenderer::render()\n{\n if (!m_valid)\n return;\n\n Vector4ub c = m_scene.backgroundColor();\n glClearColor(c[0] \/ 255.0f, c[1] \/ 255.0f, c[2] \/ 255.0f, c[3] \/ 255.0f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n applyProjection();\n\n GLRenderVisitor visitor(m_camera, m_textRenderStrategy);\n \/\/ Setup for opaque geometry\n visitor.setRenderPass(OpaquePass);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_BLEND);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for transparent geometry\n visitor.setRenderPass(TranslucentPass);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for 3d overlay rendering\n visitor.setRenderPass(Overlay3DPass);\n glClear(GL_DEPTH_BUFFER_BIT);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for 2d overlay rendering\n visitor.setRenderPass(Overlay2DPass);\n visitor.setCamera(m_overlayCamera);\n glDisable(GL_DEPTH_TEST);\n m_scene.rootNode().accept(visitor);\n}\n\nvoid GLRenderer::resetCamera()\n{\n resetGeometry();\n m_camera.setIdentity();\n m_camera.translate(-m_center);\n m_camera.preTranslate(-2.22f * m_radius * Vector3f::UnitZ());\n}\n\nvoid GLRenderer::resetGeometry()\n{\n m_center = m_scene.center();\n m_radius = m_scene.radius();\n}\n\nvoid GLRenderer::setTextRenderStrategy(TextRenderStrategy *tren)\n{\n if (tren != m_textRenderStrategy) {\n \/\/ Force all labels to be regenerated on the next render:\n class ResetTextLabelVisitor : public Visitor\n {\n public:\n void visit(Node &) { return; }\n void visit(GroupNode &) { return; }\n void visit(GeometryNode &) { return; }\n void visit(Drawable &) { return; }\n void visit(SphereGeometry &) { return; }\n void visit(AmbientOcclusionSphereGeometry &) { return; }\n void visit(CylinderGeometry &) { return; }\n void visit(MeshGeometry &) { return; }\n void visit(Texture2D &) { return; }\n void visit(TextLabel2D &l) { l.resetTexture(); }\n void visit(TextLabel3D &l) { l.resetTexture(); }\n void visit(LineStripGeometry &) { return; }\n } labelResetter;\n\n m_scene.rootNode().accept(labelResetter);\n\n delete m_textRenderStrategy;\n m_textRenderStrategy = tren;\n }\n}\n\nvoid GLRenderer::applyProjection()\n{\n float distance = m_camera.distance(m_center);\n if (m_camera.projectionType() == Perspective) {\n m_camera.calculatePerspective(40.0f,\n std::max(2.0f, distance - m_radius),\n distance + m_radius);\n }\n else {\n \/\/ Renders the orthographic projection of the molecule\n const double halfHeight = m_radius;\n const double halfWidth = halfHeight * m_camera.width() \/ m_camera.height();\n m_camera.calculateOrthographic(-halfWidth, halfWidth,\n -halfHeight, halfHeight,\n std::max(2.0f, distance - m_radius),\n distance + m_radius);\n }\n m_overlayCamera.calculateOrthographic(\n 0.f, static_cast<float>(m_overlayCamera.width()),\n 0.f, static_cast<float>(m_overlayCamera.height()),\n -1.f, 1.f);\n}\n\nstd::multimap<float, Identifier>\nGLRenderer::hits(const GroupNode *group, const Vector3f &rayOrigin,\n const Vector3f &rayEnd, const Vector3f &rayDirection) const\n{\n std::multimap<float, Identifier> result;\n if (!group)\n return result;\n\n for (std::vector<Node *>::const_iterator it = group->children().begin();\n it != group->children().end(); ++it) {\n std::multimap<float, Identifier> loopHits;\n const Node *itNode = *it;\n const GroupNode *childGroup = dynamic_cast<const GroupNode *>(itNode);\n if (childGroup) {\n loopHits = hits(childGroup, rayOrigin, rayEnd, rayDirection);\n result.insert(loopHits.begin(), loopHits.end());\n continue;\n }\n const GeometryNode *childGeometry = (*it)->cast<GeometryNode>();\n if (childGeometry) {\n loopHits = hits(childGeometry, rayOrigin, rayEnd, rayDirection);\n result.insert(loopHits.begin(), loopHits.end());\n continue;\n }\n }\n return result;\n}\n\nstd::multimap<float, Identifier>\nGLRenderer::hits(const GeometryNode *geometry, const Vector3f &rayOrigin,\n const Vector3f &rayEnd, const Vector3f &rayDirection) const\n{\n if (!geometry)\n return std::multimap<float, Identifier>();\n return geometry->hits(rayOrigin, rayEnd, rayDirection);\n}\n\nstd::multimap<float, Identifier> GLRenderer::hits(int x, int y) const\n{\n \/\/ Our ray:\n const Vector3f origin(m_camera.unProject(Vector3f(static_cast<float>(x),\n static_cast<float>(y),\n 0.f)));\n const Vector3f end(m_camera.unProject(Vector3f(static_cast<float>(x),\n static_cast<float>(y), 1.f)));\n const Vector3f direction((end - origin).normalized());\n\n return hits(&m_scene.rootNode(), origin, end, direction);\n}\n\n} \/\/ End Rendering namespace\n} \/\/ End Avogadro namespace\n<commit_msg>Don't reset the camera on scene initialization<commit_after>\/******************************************************************************\n\n This source file is part of the Avogadro project.\n\n Copyright 2012 Kitware, Inc.\n\n This source code is released under the New BSD License, (the \"License\").\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n******************************************************************************\/\n\n#include \"glrenderer.h\"\n\n#include \"avogadrogl.h\"\n\n#include \"shader.h\"\n#include \"shaderprogram.h\"\n#include \"geometrynode.h\"\n#include \"glrendervisitor.h\"\n#include \"textlabel2d.h\"\n#include \"textlabel3d.h\"\n#include \"textrenderstrategy.h\"\n#include \"visitor.h\"\n\n#include <avogadro\/core\/matrix.h>\n\n#include <iostream>\n\nnamespace Avogadro {\nnamespace Rendering {\n\nGLRenderer::GLRenderer()\n : m_valid(false),\n m_textRenderStrategy(NULL),\n m_center(Vector3f::Zero()),\n m_radius(20.0)\n{\n m_overlayCamera.setIdentity();\n}\n\nGLRenderer::~GLRenderer()\n{\n delete m_textRenderStrategy;\n}\n\nvoid GLRenderer::initialize()\n{\n GLenum result = glewInit();\n m_valid = (result == GLEW_OK);\n if (!m_valid) {\n m_error += \"GLEW could not be initialized.\\n\";\n return;\n }\n\n if (!GLEW_VERSION_2_0) {\n m_error += \"GL version 2.0 is not supported by your graphics driver.\\n\";\n m_valid = false;\n return;\n }\n}\n\nvoid GLRenderer::resize(int width, int height)\n{\n if (!m_valid)\n return;\n\n glViewport(0, 0, static_cast<GLint>(width), static_cast<GLint>(height));\n m_camera.setViewport(width, height);\n m_overlayCamera.setViewport(width, height);\n}\n\nvoid GLRenderer::render()\n{\n if (!m_valid)\n return;\n\n Vector4ub c = m_scene.backgroundColor();\n glClearColor(c[0] \/ 255.0f, c[1] \/ 255.0f, c[2] \/ 255.0f, c[3] \/ 255.0f);\n glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT);\n applyProjection();\n\n GLRenderVisitor visitor(m_camera, m_textRenderStrategy);\n \/\/ Setup for opaque geometry\n visitor.setRenderPass(OpaquePass);\n glEnable(GL_DEPTH_TEST);\n glDisable(GL_BLEND);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for transparent geometry\n visitor.setRenderPass(TranslucentPass);\n glEnable(GL_BLEND);\n glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for 3d overlay rendering\n visitor.setRenderPass(Overlay3DPass);\n glClear(GL_DEPTH_BUFFER_BIT);\n m_scene.rootNode().accept(visitor);\n\n \/\/ Setup for 2d overlay rendering\n visitor.setRenderPass(Overlay2DPass);\n visitor.setCamera(m_overlayCamera);\n glDisable(GL_DEPTH_TEST);\n m_scene.rootNode().accept(visitor);\n}\n\nvoid GLRenderer::resetCamera()\n{\n resetGeometry();\n m_camera.setIdentity();\n m_camera.translate(-m_center);\n m_camera.preTranslate(-2.22f * m_radius * Vector3f::UnitZ());\n}\n\nvoid GLRenderer::resetGeometry()\n{\n m_center = m_scene.center();\n m_radius = m_scene.radius();\n}\n\nvoid GLRenderer::setTextRenderStrategy(TextRenderStrategy *tren)\n{\n if (tren != m_textRenderStrategy) {\n \/\/ Force all labels to be regenerated on the next render:\n class ResetTextLabelVisitor : public Visitor\n {\n public:\n void visit(Node &) { return; }\n void visit(GroupNode &) { return; }\n void visit(GeometryNode &) { return; }\n void visit(Drawable &) { return; }\n void visit(SphereGeometry &) { return; }\n void visit(AmbientOcclusionSphereGeometry &) { return; }\n void visit(CylinderGeometry &) { return; }\n void visit(MeshGeometry &) { return; }\n void visit(Texture2D &) { return; }\n void visit(TextLabel2D &l) { l.resetTexture(); }\n void visit(TextLabel3D &l) { l.resetTexture(); }\n void visit(LineStripGeometry &) { return; }\n } labelResetter;\n\n m_scene.rootNode().accept(labelResetter);\n\n delete m_textRenderStrategy;\n m_textRenderStrategy = tren;\n }\n}\n\nvoid GLRenderer::applyProjection()\n{\n float distance = m_camera.distance(m_center);\n if (m_camera.projectionType() == Perspective) {\n m_camera.calculatePerspective(40.0f,\n std::max(2.0f, distance - m_radius),\n distance + m_radius);\n }\n else {\n \/\/ Renders the orthographic projection of the molecule\n const double halfHeight = m_radius;\n const double halfWidth = halfHeight * m_camera.width() \/ m_camera.height();\n m_camera.calculateOrthographic(-halfWidth, halfWidth,\n -halfHeight, halfHeight,\n std::max(2.0f, distance - m_radius),\n distance + m_radius);\n }\n m_overlayCamera.calculateOrthographic(\n 0.f, static_cast<float>(m_overlayCamera.width()),\n 0.f, static_cast<float>(m_overlayCamera.height()),\n -1.f, 1.f);\n}\n\nstd::multimap<float, Identifier>\nGLRenderer::hits(const GroupNode *group, const Vector3f &rayOrigin,\n const Vector3f &rayEnd, const Vector3f &rayDirection) const\n{\n std::multimap<float, Identifier> result;\n if (!group)\n return result;\n\n for (std::vector<Node *>::const_iterator it = group->children().begin();\n it != group->children().end(); ++it) {\n std::multimap<float, Identifier> loopHits;\n const Node *itNode = *it;\n const GroupNode *childGroup = dynamic_cast<const GroupNode *>(itNode);\n if (childGroup) {\n loopHits = hits(childGroup, rayOrigin, rayEnd, rayDirection);\n result.insert(loopHits.begin(), loopHits.end());\n continue;\n }\n const GeometryNode *childGeometry = (*it)->cast<GeometryNode>();\n if (childGeometry) {\n loopHits = hits(childGeometry, rayOrigin, rayEnd, rayDirection);\n result.insert(loopHits.begin(), loopHits.end());\n continue;\n }\n }\n return result;\n}\n\nstd::multimap<float, Identifier>\nGLRenderer::hits(const GeometryNode *geometry, const Vector3f &rayOrigin,\n const Vector3f &rayEnd, const Vector3f &rayDirection) const\n{\n if (!geometry)\n return std::multimap<float, Identifier>();\n return geometry->hits(rayOrigin, rayEnd, rayDirection);\n}\n\nstd::multimap<float, Identifier> GLRenderer::hits(int x, int y) const\n{\n \/\/ Our ray:\n const Vector3f origin(m_camera.unProject(Vector3f(static_cast<float>(x),\n static_cast<float>(y),\n 0.f)));\n const Vector3f end(m_camera.unProject(Vector3f(static_cast<float>(x),\n static_cast<float>(y), 1.f)));\n const Vector3f direction((end - origin).normalized());\n\n return hits(&m_scene.rootNode(), origin, end, direction);\n}\n\n} \/\/ End Rendering namespace\n} \/\/ End Avogadro namespace\n<|endoftext|>"} {"text":"<commit_before>\/*-------------------------------\nPASA LA CALCULADORA\nAutores: \nJaime Sevilla Molina\nVictor Gonzalez\nFecha\n2014\/11\nVersion: 2.0\n---------------------------------*\/\n\n\/\/BIBLIOTECAS\n#include <iostream>\n#include <cstdlib>\n#include <string>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n\nusing namespace std;\n\n\/\/TIPOS PROPIOS\ntypedef enum tJugador\n{\n\tNadie,\n\tJugador,\n\tAutomata\n};\n\n\/\/FUNCIONES\n\/\/FUNCIONES DE JUEGO\n\nstring saludar ();\n\n\/\/Dependiendo de quien gane, la despedida sera distinta\nvoid despedirse (tJugador ganador, string nombre);\n\n\/\/Muestra un menu que permite al jugador jugar, salir, o ver las reglas del juego\nint menu();\n\n\/\/Muestra las instrucciones del juego, siempre que su archivo no contenga errores\nbool acerca();\n\n\/\/Actualiza las estadisticas\nbool actualizar_stats(tJugador ganador);\n\n\/\/Muestra las estadisticas\nbool stats();\n\n\/\/Anota el numero de partidas ganadas y perdidas del jugador\nbool stats(int ganadas, int perdidas);\n\n\/\/Conduce el desarrollo del juego y devuelve el ganador. \n\/\/Si se abandona, devuelve Nadie.\ntJugador pasaCalculadora();\n\n\/\/Decide aleatoriamente quien empieza.\ntJugador quienEmpieza();\n\n\n\/\/Devuelve true si nuevo esta en la misma fila que ultimo\nbool mismaFila(int ultimo, int nuevo);\n\n\/\/Devuelve true si nuevo esta en la misma columna que ultimo\nbool mismaColumna(int ultimo, int nuevo);\n\n\/\/Devuelve true si nuevo cumple las reglas del juego con respecto a ultimo\n\/\/Si ultimo == 0, este es el primer digito de la partida, y devuelve true\nbool digitoValido(int ultimo, int nuevo);\n\n\/\/FUNCIONES DE IA NIVEL 1\n\/\/Devuelve un digito del 1 al 9\nint digitoAleatorio();\n\n\/\/Devuelve un digito que cumpla las reglas del juego con respecto a ultimo.\nint digitoAutomata(int ultimo);\n\n\/\/FUNCIONES DE JUGADOR\n\/\/Pide un digito al jugador. Solo devolvera un valor valido (entre 0 y 9).\n\/\/Para un valor no valido, mostrara un error.\nint digitoPersona();\n\n\/\/Pide un digito al jugador mostrando el teclado. Solo devolvera un valor \n\/\/que cumpla las reglas del juego o 0. Para un valor no valido, mostrara un error.\nint digitoPersona(int ultimo);\n\n\/\/Determina si el numero de la calculadora se muestra o no, en funcion de si es valido\nchar mNumero(int ultimo, int n);\n\n\/\/Muestra los botones de la calculadora (solo los que se pueden pulsar en cada turno)\nvoid mostrarCalculadora(int ultimo);\n\n\n\/* Las funciones a continuacion se implementaran en un futuro\n\/\/FUNCIONES DE INFORME\n\/\/Actualiza el archivo informePC.txt con los tres argumentos. En caso de no encontrar\n\/\/el archivo, lo crea y devuelve false; en otro caso devuelve true.\nbool actInforme(int jugadas, int ganadas, int abandonos);\n\n\n\/\/FUNCIONES DE DIFICULTAD AVANZADA\nint botDificil(int ultimo);\n\n-----------------------------------------------------------------------------------*\/\n\n\nint main()\n{\n\ttJugador ganador;\n\tint opcion;\n\t\n\tstring nombre = saludar();\t\n\t\/\/Bucle Menu\n\tdo\n\t{\n\t\topcion = menu();\n\t\tif(opcion == 1){\t\n\t\t\tganador = pasaCalculadora();\n\t\t\tdespedirse(ganador, nombre);\n\t\t}\n\t\telse if(opcion == 2) acerca();\n\t\n\t}\n\twhile(opcion != 0);\n\t\n\tcout << \"Hasta la proxima \" << nombre << \"(pulsa enter)\";\n\tcin;\n\n\treturn 0;\n}\n\t\n\/\/Saluda al jugador y le pregunta su nombre\nstring saludar()\n{\n\tstring nombre;\n\tcout << \"Bienvenido a Pasa la calculadora!\" << endl;\n\tcout << \"Como te llamas? \";\n\tcin >> nombre;\n\tcout << \"Hola \" << nombre << endl << endl;\n\treturn nombre;\n}\n\n\/\/Se despide del jugador, la despedida varia segun gane el jugador, el automata o ninguno de ellos (el jugador abandone)\nvoid despedirse(tJugador ganador, string nombre)\n{\n\tint ganadas = 0, perdidas = 0;\n\tif (ganador == Nadie){\n\t\tcout << \"Abandonas, \" << nombre << \"? Ohhh...\" << endl << endl;\n\t}\n\telse if (ganador == Jugador){\n\t\tcout << \"Enhorabuena \" << nombre << \", has ganado!\" << endl << endl;\n\t}\n\telse \/*if (ganador == Automata)*\/{\n\t\tcout << \"Lo siento \" << nombre << \", he ganado\" << endl << endl;\n\t}\n}\n\n\/\/Proporciona al jugador la posibilidad de jugar, ver las instrucciones del juego o salir.\nint menu()\n{\n\tint seleccionar = -1; \/\/Error flag\n\tcout << \"1 - Jugar\" << endl;\n\tcout << \"2 - Acerca de\" << endl;\n\tcout << \"0 - Salir\" << endl;\n\t\n\tdo\n\t{\n\t\tcin.sync(); \/\/Por si quedan datos basura en el buffer\n\t\tcin >> seleccionar;\n\n\t\tif(cin.fail())\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito\" << endl;\n\t\t\tcin.clear();\n\t\t}\n\n\t\telse if (seleccionar < 0 || seleccionar > 2)\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito entre 0 y 2\" << endl;\n\t\t\tseleccionar = -1;\n\t\t}\n\t\t\n\t}\n\twhile (seleccionar == -1);\n\n\treturn seleccionar;\n}\n\n\/\/Muestra el archivo \"acerca.txt\" siempre que este no contenga errores\nbool acerca()\n{\n\tbool ok;\n\tifstream acerca;\n\tchar c;\n\n\tacerca.open(\"acerca.txt\");\n\t\n\tif(acerca.is_open())\n\t{\n\t\tacerca.get(c); \/\/Lee el primer caracter\n\n\t\twhile(!acerca.fail()) \/\/Mientras la lectura no falle\n\t\t{\n\t\t\tcout << c;\n\t\t\tacerca.get(c); \/\/Lee el siguiente caracter\n\t\t}\n\n\t\tok = true;\n\t\tacerca.close();\n\n\t}\n\telse\n\t{\n\t\tok = false;\n\t\tcout << \"Error, el archivo 'acerca.txt' no existe\" << endl;\n\t}\n\n\treturn ok;\n}\n\n\/\/Actualiza las estadisticas\nbool actualizar_stats(tJugador ganador)\n{\n\tbool ok;\n\tint ganadas, perdidas, abandonadas;\n\tifstream stats;\n\tofstream actualizar;\n\t\n\tstats.open(\"stats.txt\");\n\tif(stats.is_open())\n\t{\n\t\tstats >> ganadas;\n\t\tstats >> perdidas;\n\t\tstats >> abandonadas;\n\t\t\n\t\tok = true;\n\t}\n\telse\n\t{\n\t\tganadas = 0;\n\t\tperdidas = 0;\n\t\tabandonadas = 0;\n\t\t\n\t\tok = false;\n\t}\n\t\n\tif(ganador == Jugador) ganadas += 1;\n\telse if(ganador == Automata) perdidas += 1;\n\telse if(ganador == Nadie) abandonadas += 1;\n\t\n\tstats.close();\n\t\n\tactualizar.open(\"stats.txt\")\n\t\n\tactualizar << ganadas;\n\tactualizar << perdidas;\n\tactualizar << abandonadas;\n\t\n\tactualizar.close();\n\treturn ok;\n}\n\n\/\/Muestra las estadisticas\nvoid stats()\n{\n\tactualizar_stats(ganador);\n\tifstream stats;\n\t\n\tstats.open(\"stats.txt\")\n\t\n\tstats << \"Partidas jugadas: \" << (ganadas+perdidas+abandonadas) << endl;\n\tstats << \"\tPartidas ganadas: \" << ganadas << endl;\n\tstats << \"\tPartidas perdidas: \" << perdidas << endl;\n\tstats << \"\tPartidas abandonadas: \" << abandonadas << endl;\n\t\n\tstats.close();\n}\n\n\/\/Conduce el desarrollo del juego y devuelve el ganador. \n\/\/Si se abandona, devuelve Nadie.\ntJugador pasaCalculadora()\n{\n\t\/\/Variables\n\ttJugador turno;\n\tint total = 0, ultimoDigito = 0;\n\tconst int META=31;\n\t\t\/\/Inicializar partida\n\tsrand(time(NULL));\/\/Semilla\n\tturno = quienEmpieza();\n\n\t\/\/Bucle de juego\n\tdo\n\t{\n\t\t\/\/Turno jugador\n\t\tif (turno == Jugador)\n\t\t{\n\t\t\tultimoDigito = digitoPersona(ultimoDigito);\n\t\t\tturno = Automata;\n\t\t}\n\t\t\/\/Turno bot\n\t\telse \/*if (turno == Automata)*\/\n\t\t{\n\t\t\tultimoDigito = digitoAutomata(ultimoDigito);\n\t\t\tturno = Jugador;\n\t\t}\n\t\ttotal += ultimoDigito;\n\t\tcout << \"Total = \" << total << endl;\n\t}\n\twhile ((total < META) && (ultimoDigito != 0));\n\t\n\tif (ultimoDigito == 0) turno = Nadie; \n\t\/\/Si el jugador abandona, no gana nadie\n\n\treturn turno;\n}\n\n\/\/Decide aleatoriamente quien empieza la partida, si el automata o el jugador\ntJugador quienEmpieza()\n{\n\tif (rand() % 2)\n\t{\n\t\tcout << \"Tu empiezas\" << endl;\n\t\treturn Jugador;\n\t}\n\telse\n\t{\n\t\tcout << \"Empiezo yo\" << endl;\n\t\treturn Automata;\n\t}\n}\n\n\/\/Define que numeros se encuentran en la misma fila que el ultimo pulsado\nbool mismaFila(int ultimo, int nuevo)\n{\n\tint filaUltimo, filaNuevo;\n\tfilaUltimo = ((ultimo - 1)\/3);\n\tfilaNuevo = ((nuevo - 1)\/3);\n\treturn (filaUltimo) == (filaNuevo);\n}\n\n\/\/Define que numeros se encuentran en la misma columna que el ultimo\nbool mismaColumna(int ultimo, int nuevo)\n{\n\tint columnaUltimo, columnaNuevo;\n\tcolumnaUltimo = (ultimo % 3);\n\tcolumnaNuevo = (nuevo % 3);\n\treturn columnaUltimo == columnaNuevo;\n}\n\n\/\/Determina que digitos se pueden pulsar en funcion de las reglas del juego\nbool digitoValido(int ultimo, int nuevo) \/\/hay un bug\n{\n\tif (ultimo == 0) return true;\/\/Si es el primer turno, todos los numeros valen\n\n\treturn ((mismaFila(ultimo, nuevo))||(mismaColumna(ultimo, nuevo)))&&(ultimo!=nuevo);\n}\n\n\/\/Genera un digito aleatorio\nint digitoAleatorio()\n{\n\treturn (rand() % 9) + 1;\n}\n\n\/\/Devuelve un digito que cumpla las reglas del juego con respecto a ultimo.\nint digitoAutomata(int ultimo)\n{\n\tint digito;\n\n\tdo\n\t{\n\tdigito = digitoAleatorio();\n\t}\n\twhile (!digitoValido(ultimo, digito));\n\n\tcout << \"Elijo el numero \" << digito << endl;\n\n\treturn digito;\n}\n\n\/\/Pide un digito al jugador. Solo devolvera un valor valido (entre 0 y 9).\n\/\/Para un valor no valido, mostrara un error.\nint digitoPersona()\n{\n\tint digito = -1;\n\n\tdo\n\t{\n\t\tcin.sync(); \/\/Por si quedan datos basura en el buffer\n\t\tcin >> digito;\n\n\t\tif (cin.fail())\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito\" << endl;\n\t\t\tcin.clear();\n\t\t}\n\n\t\telse if (digito < 0 || digito > 9) \n\t\t{\n\t\tcout << \"Error! Introduce un digito entre 0 y 9\" << endl;\n\t\tdigito = -1;\n\t\t}\n\t\t\n\t}\n\twhile (digito == -1);\n\n\treturn digito;\n}\n\n\/\/Pide un digito al jugador mostrando el teclado. Solo devolvera un valor \n\/\/que cumpla las reglas del juego o 0. Para un valor no valido, mostrara un error.\nint digitoPersona(int ultimo)\n{\n\tint digito = -1; \/\/-1 es mi error flag\n\t\n\tmostrarCalculadora(ultimo);\n\n\tdo\n\t{\n\t\tdigito = digitoPersona();\n\t\tif (!digitoValido(ultimo, digito))\n\t\t{\n\t\t\tcout << \"Error! El digito debe estar en la misma fila y columna que el ultimo\" << endl;\n\t\t\tdigito = -1;\n\t\t}\n\t}\n\twhile (digito == -1);\n\n\tcout << \"Has elegido el \" << digito << endl;\n\n\treturn digito;\n}\n\n\/\/Determina si el numero de la calculadora se muestra o no, en funcion de si es valido\nchar mNumero(int ultimo, int n)\n{\n\tif(digitoValido(ultimo, n))\n\t{\n\t\treturn char (n+int('0'));\n\t\t\n\t}\n\telse\n\t{\n\t\treturn ' ';\n\t}\n}\n\n\/\/Muestra los botones de la calculadora (solo los que se pueden pulsar en cada turno)\nvoid mostrarCalculadora(int ultimo)\n{\n\tfor (int i = 7; i<10; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n\tfor (int i = 4; i<7; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n\tfor (int i = 1; i<4; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n}\n<commit_msg>corregida stats(), y llamada actualizar()<commit_after>\/*-------------------------------\nPASA LA CALCULADORA\nAutores: \nJaime Sevilla Molina\nVictor Gonzalez\nFecha\n2014\/11\nVersion: 2.0\n---------------------------------*\/\n\n\/\/BIBLIOTECAS\n#include <iostream>\n#include <cstdlib>\n#include <string>\n#include <ctime>\n#include <fstream>\n#include <iomanip>\n\nusing namespace std;\n\n\/\/TIPOS PROPIOS\ntypedef enum tJugador\n{\n\tNadie,\n\tJugador,\n\tAutomata\n};\n\n\/\/FUNCIONES\n\/\/FUNCIONES DE JUEGO\n\nstring saludar ();\n\n\/\/Dependiendo de quien gane, la despedida sera distinta\nvoid despedirse (tJugador ganador, string nombre);\n\n\/\/Muestra un menu que permite al jugador jugar, salir, o ver las reglas del juego\nint menu();\n\n\/\/Muestra las instrucciones del juego, siempre que su archivo no contenga errores\nbool acerca();\n\n\/\/Actualiza las estadisticas\nbool actualizar_stats(tJugador ganador);\n\n\/\/Muestra las estadisticas\nbool stats();\n\n\/\/Anota el numero de partidas ganadas y perdidas del jugador\nbool stats(int ganadas, int perdidas);\n\n\/\/Conduce el desarrollo del juego y devuelve el ganador. \n\/\/Si se abandona, devuelve Nadie.\ntJugador pasaCalculadora();\n\n\/\/Decide aleatoriamente quien empieza.\ntJugador quienEmpieza();\n\n\n\/\/Devuelve true si nuevo esta en la misma fila que ultimo\nbool mismaFila(int ultimo, int nuevo);\n\n\/\/Devuelve true si nuevo esta en la misma columna que ultimo\nbool mismaColumna(int ultimo, int nuevo);\n\n\/\/Devuelve true si nuevo cumple las reglas del juego con respecto a ultimo\n\/\/Si ultimo == 0, este es el primer digito de la partida, y devuelve true\nbool digitoValido(int ultimo, int nuevo);\n\n\/\/FUNCIONES DE IA NIVEL 1\n\/\/Devuelve un digito del 1 al 9\nint digitoAleatorio();\n\n\/\/Devuelve un digito que cumpla las reglas del juego con respecto a ultimo.\nint digitoAutomata(int ultimo);\n\n\/\/FUNCIONES DE JUGADOR\n\/\/Pide un digito al jugador. Solo devolvera un valor valido (entre 0 y 9).\n\/\/Para un valor no valido, mostrara un error.\nint digitoPersona();\n\n\/\/Pide un digito al jugador mostrando el teclado. Solo devolvera un valor \n\/\/que cumpla las reglas del juego o 0. Para un valor no valido, mostrara un error.\nint digitoPersona(int ultimo);\n\n\/\/Determina si el numero de la calculadora se muestra o no, en funcion de si es valido\nchar mNumero(int ultimo, int n);\n\n\/\/Muestra los botones de la calculadora (solo los que se pueden pulsar en cada turno)\nvoid mostrarCalculadora(int ultimo);\n\n\n\/* Las funciones a continuacion se implementaran en un futuro\n\/\/FUNCIONES DE INFORME\n\/\/Actualiza el archivo informePC.txt con los tres argumentos. En caso de no encontrar\n\/\/el archivo, lo crea y devuelve false; en otro caso devuelve true.\nbool actInforme(int jugadas, int ganadas, int abandonos);\n\n\n\/\/FUNCIONES DE DIFICULTAD AVANZADA\nint botDificil(int ultimo);\n\n-----------------------------------------------------------------------------------*\/\n\n\nint main()\n{\n\ttJugador ganador;\n\tint opcion;\n\t\n\tstring nombre = saludar();\t\n\t\/\/Bucle Menu\n\tdo\n\t{\n\t\topcion = menu();\n\t\tif(opcion == 1){\t\n\t\t\tganador = pasaCalculadora();\n\t\t\tactualizar_stats(ganador);\n\t\t\tdespedirse(ganador, nombre);\n\t\t}\n\t\telse if(opcion == 2) acerca();\n\t\n\t}\n\twhile(opcion != 0);\n\t\n\tcout << \"Hasta la proxima \" << nombre << \"(pulsa enter)\";\n\tcin;\n\n\treturn 0;\n}\n\t\n\/\/Saluda al jugador y le pregunta su nombre\nstring saludar()\n{\n\tstring nombre;\n\tcout << \"Bienvenido a Pasa la calculadora!\" << endl;\n\tcout << \"Como te llamas? \";\n\tcin >> nombre;\n\tcout << \"Hola \" << nombre << endl << endl;\n\treturn nombre;\n}\n\n\/\/Se despide del jugador, la despedida varia segun gane el jugador, el automata o ninguno de ellos (el jugador abandone)\nvoid despedirse(tJugador ganador, string nombre)\n{\n\tint ganadas = 0, perdidas = 0;\n\tif (ganador == Nadie){\n\t\tcout << \"Abandonas, \" << nombre << \"? Ohhh...\" << endl << endl;\n\t}\n\telse if (ganador == Jugador){\n\t\tcout << \"Enhorabuena \" << nombre << \", has ganado!\" << endl << endl;\n\t}\n\telse \/*if (ganador == Automata)*\/{\n\t\tcout << \"Lo siento \" << nombre << \", he ganado\" << endl << endl;\n\t}\n}\n\n\/\/Proporciona al jugador la posibilidad de jugar, ver las instrucciones del juego o salir.\nint menu()\n{\n\tint seleccionar = -1; \/\/Error flag\n\tcout << \"1 - Jugar\" << endl;\n\tcout << \"2 - Acerca de\" << endl;\n\tcout << \"0 - Salir\" << endl;\n\t\n\tdo\n\t{\n\t\tcin.sync(); \/\/Por si quedan datos basura en el buffer\n\t\tcin >> seleccionar;\n\n\t\tif(cin.fail())\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito\" << endl;\n\t\t\tcin.clear();\n\t\t}\n\n\t\telse if (seleccionar < 0 || seleccionar > 2)\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito entre 0 y 2\" << endl;\n\t\t\tseleccionar = -1;\n\t\t}\n\t\t\n\t}\n\twhile (seleccionar == -1);\n\n\treturn seleccionar;\n}\n\n\/\/Muestra el archivo \"acerca.txt\" siempre que este no contenga errores\nbool acerca()\n{\n\tbool ok;\n\tifstream acerca;\n\tchar c;\n\n\tacerca.open(\"acerca.txt\");\n\t\n\tif(acerca.is_open())\n\t{\n\t\tacerca.get(c); \/\/Lee el primer caracter\n\n\t\twhile(!acerca.fail()) \/\/Mientras la lectura no falle\n\t\t{\n\t\t\tcout << c;\n\t\t\tacerca.get(c); \/\/Lee el siguiente caracter\n\t\t}\n\n\t\tok = true;\n\t\tacerca.close();\n\n\t}\n\telse\n\t{\n\t\tok = false;\n\t\tcout << \"Error, el archivo 'acerca.txt' no existe\" << endl;\n\t}\n\n\treturn ok;\n}\n\n\/\/Actualiza las estadisticas\nbool actualizar_stats(tJugador ganador)\n{\n\tbool ok;\n\tint ganadas, perdidas, abandonadas;\n\tifstream stats;\n\tofstream actualizar;\n\t\n\tstats.open(\"stats.txt\");\n\tif(stats.is_open())\n\t{\n\t\tstats >> ganadas;\n\t\tstats >> perdidas;\n\t\tstats >> abandonadas;\n\t\t\n\t\tok = true;\n\t}\n\telse\n\t{\n\t\tganadas = 0;\n\t\tperdidas = 0;\n\t\tabandonadas = 0;\n\t\t\n\t\tok = false;\n\t}\n\t\n\tif(ganador == Jugador) ganadas += 1;\n\telse if(ganador == Automata) perdidas += 1;\n\telse if(ganador == Nadie) abandonadas += 1;\n\t\n\tstats.close();\n\t\n\tactualizar.open(\"stats.txt\")\n\t\n\tactualizar << ganadas;\n\tactualizar << perdidas;\n\tactualizar << abandonadas;\n\t\n\tactualizar.close();\n\treturn ok;\n}\n\n\/\/Muestra las estadisticas\nvoid stats()\n{\n\tifstream stats;\n\t\n\tstats.open(\"stats.txt\")\n\t\n\tcout << \"Partidas jugadas: \" << (ganadas+perdidas+abandonadas) << endl;\n\tcout << \"\tPartidas ganadas: \" << ganadas << endl;\n\tcout << \"\tPartidas perdidas: \" << perdidas << endl;\n\tcout << \"\tPartidas abandonadas: \" << abandonadas << endl;\n\t\n\tstats.close();\n}\n\n\/\/Conduce el desarrollo del juego y devuelve el ganador. \n\/\/Si se abandona, devuelve Nadie.\ntJugador pasaCalculadora()\n{\n\t\/\/Variables\n\ttJugador turno;\n\tint total = 0, ultimoDigito = 0;\n\tconst int META=31;\n\t\t\/\/Inicializar partida\n\tsrand(time(NULL));\/\/Semilla\n\tturno = quienEmpieza();\n\n\t\/\/Bucle de juego\n\tdo\n\t{\n\t\t\/\/Turno jugador\n\t\tif (turno == Jugador)\n\t\t{\n\t\t\tultimoDigito = digitoPersona(ultimoDigito);\n\t\t\tturno = Automata;\n\t\t}\n\t\t\/\/Turno bot\n\t\telse \/*if (turno == Automata)*\/\n\t\t{\n\t\t\tultimoDigito = digitoAutomata(ultimoDigito);\n\t\t\tturno = Jugador;\n\t\t}\n\t\ttotal += ultimoDigito;\n\t\tcout << \"Total = \" << total << endl;\n\t}\n\twhile ((total < META) && (ultimoDigito != 0));\n\t\n\tif (ultimoDigito == 0) turno = Nadie; \n\t\/\/Si el jugador abandona, no gana nadie\n\n\treturn turno;\n}\n\n\/\/Decide aleatoriamente quien empieza la partida, si el automata o el jugador\ntJugador quienEmpieza()\n{\n\tif (rand() % 2)\n\t{\n\t\tcout << \"Tu empiezas\" << endl;\n\t\treturn Jugador;\n\t}\n\telse\n\t{\n\t\tcout << \"Empiezo yo\" << endl;\n\t\treturn Automata;\n\t}\n}\n\n\/\/Define que numeros se encuentran en la misma fila que el ultimo pulsado\nbool mismaFila(int ultimo, int nuevo)\n{\n\tint filaUltimo, filaNuevo;\n\tfilaUltimo = ((ultimo - 1)\/3);\n\tfilaNuevo = ((nuevo - 1)\/3);\n\treturn (filaUltimo) == (filaNuevo);\n}\n\n\/\/Define que numeros se encuentran en la misma columna que el ultimo\nbool mismaColumna(int ultimo, int nuevo)\n{\n\tint columnaUltimo, columnaNuevo;\n\tcolumnaUltimo = (ultimo % 3);\n\tcolumnaNuevo = (nuevo % 3);\n\treturn columnaUltimo == columnaNuevo;\n}\n\n\/\/Determina que digitos se pueden pulsar en funcion de las reglas del juego\nbool digitoValido(int ultimo, int nuevo) \/\/hay un bug\n{\n\tif (ultimo == 0) return true;\/\/Si es el primer turno, todos los numeros valen\n\n\treturn ((mismaFila(ultimo, nuevo))||(mismaColumna(ultimo, nuevo)))&&(ultimo!=nuevo);\n}\n\n\/\/Genera un digito aleatorio\nint digitoAleatorio()\n{\n\treturn (rand() % 9) + 1;\n}\n\n\/\/Devuelve un digito que cumpla las reglas del juego con respecto a ultimo.\nint digitoAutomata(int ultimo)\n{\n\tint digito;\n\n\tdo\n\t{\n\tdigito = digitoAleatorio();\n\t}\n\twhile (!digitoValido(ultimo, digito));\n\n\tcout << \"Elijo el numero \" << digito << endl;\n\n\treturn digito;\n}\n\n\/\/Pide un digito al jugador. Solo devolvera un valor valido (entre 0 y 9).\n\/\/Para un valor no valido, mostrara un error.\nint digitoPersona()\n{\n\tint digito = -1;\n\n\tdo\n\t{\n\t\tcin.sync(); \/\/Por si quedan datos basura en el buffer\n\t\tcin >> digito;\n\n\t\tif (cin.fail())\n\t\t{\n\t\t\tcout << \"Error! Introduce un digito\" << endl;\n\t\t\tcin.clear();\n\t\t}\n\n\t\telse if (digito < 0 || digito > 9) \n\t\t{\n\t\tcout << \"Error! Introduce un digito entre 0 y 9\" << endl;\n\t\tdigito = -1;\n\t\t}\n\t\t\n\t}\n\twhile (digito == -1);\n\n\treturn digito;\n}\n\n\/\/Pide un digito al jugador mostrando el teclado. Solo devolvera un valor \n\/\/que cumpla las reglas del juego o 0. Para un valor no valido, mostrara un error.\nint digitoPersona(int ultimo)\n{\n\tint digito = -1; \/\/-1 es mi error flag\n\t\n\tmostrarCalculadora(ultimo);\n\n\tdo\n\t{\n\t\tdigito = digitoPersona();\n\t\tif (!digitoValido(ultimo, digito))\n\t\t{\n\t\t\tcout << \"Error! El digito debe estar en la misma fila y columna que el ultimo\" << endl;\n\t\t\tdigito = -1;\n\t\t}\n\t}\n\twhile (digito == -1);\n\n\tcout << \"Has elegido el \" << digito << endl;\n\n\treturn digito;\n}\n\n\/\/Determina si el numero de la calculadora se muestra o no, en funcion de si es valido\nchar mNumero(int ultimo, int n)\n{\n\tif(digitoValido(ultimo, n))\n\t{\n\t\treturn char (n+int('0'));\n\t\t\n\t}\n\telse\n\t{\n\t\treturn ' ';\n\t}\n}\n\n\/\/Muestra los botones de la calculadora (solo los que se pueden pulsar en cada turno)\nvoid mostrarCalculadora(int ultimo)\n{\n\tfor (int i = 7; i<10; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n\tfor (int i = 4; i<7; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n\tfor (int i = 1; i<4; i++)\n\t{\n\t\tcout << setw(3) << mNumero(ultimo, i);\n\t}\n\tcout << endl;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2014 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/program.h\"\n#include \"gfx\/gl\/driver.h\"\n\n#include \"gfx\/scene.h\"\n\n#include \"texture.h\"\n#include \"mesh.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\nstruct Command_Options\n{\n bool test = false;\n};\n\nCommand_Options parse_command_line(int argc, char** argv)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n auto option = argv[i];\n if(strcmp(option, \"--test\") == 0)\n {\n opt.test = true;\n }\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace survive;\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Should be run the testing whatchamacallit?\n if(options.test)\n {\n int result = Catch::Session().run(1, argv);\n if(result)\n {\n return EXIT_FAILURE;\n }\n }\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Make an OpenGL driver.\n auto driver = gfx::gl::Driver{};\n\n \/\/ Load a shader program.\n#if 0\n auto shader_program = gfx::Program::from_files(\"shader\/diffuse\/vertex\",\n \"shader\/diffuse\/fragment\");\n#endif\n\n \/\/ Load the scene data for an isometric view\n auto scene_data = gfx::make_isometric_scene();\n\n \/\/ auto scene = load_scene(\"scene\/default.json\");\n \/\/ prepare_scene(driver);\n\n \/\/ Prepare a mesh for rendering.\n auto mesh = driver.prepare_mesh(Mesh::from_file(\"obj\/plane.obj\"));\n auto tex =\n driver.prepare_texture(Texture::from_png_file(\"tex\/cracked_soil.png\"));\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n glClearColor(0.509, .694, .737, 1.0);\n glClearDepth(1);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Use our shader.\n#if 0\n shader_program.use();\n#endif\n\n#if 0\n auto tex_loc = shader_program.get_uniform_location(\"tex\");\n shader_program.set_uniform_int(tex_loc, 0);\n#endif\n tex->bind(0);\n\n#if 0\n auto mvp_loc = shader_program.get_uniform_location(\"mvp\");\n#endif\n\n float deg = -5;\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n\n \/\/ Create our matrix.\n\n \/\/glm::mat4 view = glm::lookAt(glm::vec3(0, 10, 0), glm::vec3(0, 0, 0),\n \/\/glm::vec3(0, 0, 1));\n \/\/glm::mat4 perspective = glm::frustum(-1, 1, -1, 1, -1, 1);\n \/\/glm::mat4 perspective = glm::ortho(-1, 1, -1, 1, -1, 1);\n glm::mat4 view(1.0);\n view = glm::lookAt(glm::vec3(0, 0, 15), glm::vec3(0, 0, 0),\n glm::vec3(0, 1, 0));\n glm::mat4 perspective(1.0);\n perspective = glm::perspective(45., 1., .01, 30.);\n\n auto model = glm::mat4(1.0);\n\n \/\/ rotate 90 degrees ccw\n \/\/model = glm::translate(model, glm::vec3(0, cam_height, 0));\n model = glm::rotate(model, -3.14159f \/ 2.0f, glm::vec3(0, 1, 0));\n model = glm::rotate(model, deg, glm::vec3(0, 1, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 7));\n model = glm::scale(model, glm::vec3(5));\n\n deg += .001;\n\n glm::mat4 mvp = perspective * view * model;\n\n \/\/ Set the matrix in the program.\n \/\/ TODO this seems bad, change this.\n#if 0\n shader_program.set_uniform_mat4(mvp_loc, mvp);\n#endif\n\n \/\/ Clear the screen and render.\n driver.clear();\n mesh->render();\n\n \/\/ Show it on screen.\n glfwSwapBuffers(window);\n glfwPollEvents();\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n\n glfwTerminate();\n return 0;\n}\n\n#if 0\nint main()\n{\n using namespace survive;\n\n auto driver = gfx::gl::Driver{\"OpenGL 4.5\"};\n auto scene_data = gfx::make_isometric_scene(factory, ...);\n\n auto scene_root = load_scene(\"scene\/main.json\");\n prepare_scene(factory, scene_root);\n\n while(window)\n {\n driver.clear();\n\n scene_root.render(scene_data);\n \/\/ Expanded view of ^\n {\n apply_model();\n material->use();\n mesh->render();\n\n for(child : children)\n {\n child.render(scene_data);\n }\n }\n\n gfx::swap_buffers();\n }\n}\n#endif\n<commit_msg>The main function is severly messy but it loads a scene and works!<commit_after>\/*\n * Copyright (C) 2014 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <thread>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/program.h\"\n#include \"gfx\/gl\/driver.h\"\n#include \"gfx\/gl\/diffuse_material.h\"\n#include \"gfx\/gl\/program_cache.h\"\n\n#include \"gfx\/scene.h\"\n#include \"scene_node.h\"\n\n#include \"texture.h\"\n#include \"mesh.h\"\n\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\nstruct Command_Options\n{\n bool test = false;\n};\n\nCommand_Options parse_command_line(int argc, char** argv)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n auto option = argv[i];\n if(strcmp(option, \"--test\") == 0)\n {\n opt.test = true;\n }\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace survive;\n\n set_log_level(Log_Severity::Debug);\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Should be run the testing whatchamacallit?\n if(options.test)\n {\n int result = Catch::Session().run(1, argv);\n if(result)\n {\n return EXIT_FAILURE;\n }\n }\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n \/\/ Make an OpenGL driver.\n auto driver = gfx::gl::Driver{};\n\n \/\/ Load a shader program.\n \/\/auto shader_program = gfx::gl::Program::from_files(\"shader\/diffuse\/vertex\",\n \/\/\"shader\/diffuse\/fragment\");\n\n \/\/auto material = std::make_unique<gfx::gl::Diffuse_Material>();\n \/\/auto shader = gfx::gl::load_program(\"shader\/diffuse\/decl.json\");\n \/\/auto sampler_loc = shader->get_uniform_location(\"tex\");\n \/\/auto model_loc = shader->get_uniform_location(\"model\");\n \/\/auto proj_loc = shader->get_uniform_location(\"proj\");\n \/\/auto view_loc = shader->get_uniform_location(\"view\");\n\n \/\/auto tex =\n \/\/driver.prepare_texture(Texture::from_png_file(\"tex\/cracked_soil.png\"));\n \/\/material->diffuse_color(Color{0xff, 0x00, 0x00});\n \/\/material->texture(std::move(tex));\n \/\/tex->bind(0);\n \/\/glUniform1i(sampler_loc, 0);\n\n \/\/ Load the scene data for an isometric view\n auto scene_data = gfx::make_isometric_scene();\n \/\/scene_data.register_observer(*material);\n\n glm::mat4 view(1.0);\n view = glm::lookAt(glm::vec3(0, 0, 15), glm::vec3(0, 0, 0),\n glm::vec3(0, 1, 0));\n \/\/scene_data.view_matrix(view);\n glm::mat4 perspective(1.0);\n perspective = glm::perspective(45., 1., .01, 30.);\n \/\/scene_data.projection_matrix(perspective);\n\n \/\/material->set_view(view);\n \/\/material->set_projection(perspective);\n\n auto scene = load_scene(\"scene\/default.json\", driver);\n scene_data.register_observer(*scene.obj.material);\n \/\/prepare_scene(driver);\n\n \/\/ Prepare a mesh for rendering.\n \/\/auto mesh = driver.prepare_mesh(Mesh::from_file(\"obj\/plane.obj\"));\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n glClearColor(0.509, .694, .737, 1.0);\n glClearDepth(1);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Swap the back buffer to front buffer, first?\n glfwSwapBuffers(window);\n\n\n \/\/ Use our shader.\n\n\n float deg = -5;\n\n \/\/shader->use();\n\n \/\/material->use(model);\n \/\/glUniformMatrix4fv(proj_loc, 1, GL_FALSE, &perspective[0][0]);\n \/\/glUniformMatrix4fv(view_loc, 1, GL_FALSE, &view[0][0]);\n\n \/\/glUseProgram(0);\n\n bool done = false;\n while(!glfwWindowShouldClose(window) && !done)\n {\n \/\/done = true;\n ++fps;\n\n \/\/shader->use();\n \/\/ Create our matrix.\n\n \/\/glm::mat4 view = glm::lookAt(glm::vec3(0, 10, 0), glm::vec3(0, 0, 0),\n \/\/glm::vec3(0, 0, 1));\n \/\/glm::mat4 perspective = glm::frustum(-1, 1, -1, 1, -1, 1);\n \/\/glm::mat4 perspective = glm::ortho(-1, 1, -1, 1, -1, 1);\n\n \/\/ rotate 90 degrees ccw\n auto model = glm::mat4(1.0);\n \/\/model = glm::translate(model, glm::vec3(0, cam_height, 0));\n model = glm::rotate(model, -3.14159f \/ 2.0f, glm::vec3(0, 1, 0));\n model = glm::rotate(model, deg, glm::vec3(0, 1, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 0));\n \/\/model = glm::translate(model, glm::vec3(0, 0, 7));\n model = glm::scale(model, glm::vec3(5));\n \/\/glUniformMatrix4fv(model_loc, 1, GL_FALSE, &model[0][0]);\n\n deg += .001;\n scene.model = model;\n\n \/\/ Set the matrix in the program.\n \/\/ TODO this seems bad, change this.\n\n \/\/ Clear the screen and render.\n driver.clear();\n scene.render();\n\n \/\/ Show it on screen.\n glfwSwapBuffers(window);\n glfwPollEvents();\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n }\n\n glfwTerminate();\n return 0;\n}\n\n#if 0\nint main()\n{\n using namespace survive;\n\n auto driver = gfx::gl::Driver{\"OpenGL 4.5\"};\n auto scene_data = gfx::make_isometric_scene(factory, ...);\n\n auto scene_root = load_scene(\"scene\/main.json\");\n prepare_scene(factory, scene_root);\n\n while(window)\n {\n driver.clear();\n\n scene_root.render(scene_data);\n \/\/ Expanded view of ^\n {\n apply_model();\n material->use();\n mesh->render();\n\n for(child : children)\n {\n child.render(scene_data);\n }\n }\n\n gfx::swap_buffers();\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>#if defined(_MSC_VER)\n#define _CRTDBG_MAP_ALLOC\n#define _CRT_SECURE_NO_WARNINGS\n#include <crtdbg.h>\n#else\n#include <fenv.h>\n#endif\n\n#include \"CoolPropLib.h\"\n#include \"CoolProp.h\"\n#include \"HumidAirProp.h\"\n#include \"DataStructures.h\"\n#include \"Exceptions.h\"\n#include \"float.h\"\n\n#include <string.h>\n\n\/\/ In Microsoft Excel, they seem to check the FPU exception bits and error out because of it. \n\/\/ By calling the _clearfp(), we can reset these bits, and not get the error\n\/\/ See also http:\/\/stackoverflow.com\/questions\/11685441\/floating-point-error-when-calling-dll-function-from-vba\/27336496#27336496\n\/\/ See also http:\/\/stackoverflow.com\/questions\/16849009\/in-linux-do-there-exist-functions-similar-to-clearfp-and-statusfp for linux and OSX\nvoid reset_fpu()\n{\n #if defined(_MSC_VER)\n _clearfp(); \/\/ For MSVC, clear the floating point error flags\n #else\n feclearexcept(FE_ALL_EXCEPT);\n #endif\n}\ndouble convert_from_kSI_to_SI(long iInput, double value)\n{\n if (get_debug_level() > 8){\n std::cout << format(\"%s:%d: convert_from_kSI_to_SI(i=%d,value=%g)\\n\",__FILE__,__LINE__,iInput,value).c_str();\n }\n\n switch (iInput)\n {\n case CoolProp::iP:\n case CoolProp::iCpmass:\n case CoolProp::iCp0mass:\n case CoolProp::iSmass:\n case CoolProp::iGmass:\n case CoolProp::iCvmass:\n case CoolProp::iHmass:\n case CoolProp::iUmass:\n case CoolProp::iconductivity:\n return value*1000.0;\n case CoolProp::iDmass:\n case CoolProp::ispeed_sound:\n case CoolProp::iQ:\n case CoolProp::iviscosity:\n case CoolProp::iT:\n case CoolProp::iPrandtl:\n case CoolProp::isurface_tension:\n return value;\n default:\n throw CoolProp::ValueError(format(\"index [%d] is invalid in convert_from_kSI_to_SI\",iInput).c_str());\n break;\n }\n return _HUGE;\n}\n\ndouble convert_from_SI_to_kSI(long iInput, double value)\n{\n if (get_debug_level() > 8){\n std::cout << format(\"%s:%d: convert_from_SI_to_kSI(%d,%g)\\n\",__FILE__,__LINE__,iInput,value).c_str();\n }\n\n switch (iInput)\n {\n case CoolProp::iP:\n case CoolProp::iCpmass:\n case CoolProp::iCp0mass:\n case CoolProp::iSmass:\n case CoolProp::iGmass:\n case CoolProp::iCvmass:\n case CoolProp::iHmass:\n case CoolProp::iUmass:\n case CoolProp::iconductivity:\n return value\/1000.0;\n case CoolProp::iDmass:\n case CoolProp::iQ:\n case CoolProp::ispeed_sound:\n case CoolProp::iviscosity:\n case CoolProp::iT:\n case CoolProp::isurface_tension:\n return value;\n default:\n throw CoolProp::ValueError(format(\"index [%d] is invalid in convert_from_SI_to_kSI\", iInput).c_str());\n break;\n }\n return _HUGE;\n}\n\nEXPORT_CODE long CONVENTION redirect_stdout(const char* file){\n freopen(file, \"a+\", stdout);\n reset_fpu();\n return 0;\n}\nEXPORT_CODE int CONVENTION set_reference_stateS(const char *Ref, const char *reference_state)\n{\n std::string _Ref = Ref, _reference_state = reference_state;\n try{\n CoolProp::set_reference_stateS(_Ref, _reference_state);\n reset_fpu();\n return true;\n }\n catch(std::exception &){\n reset_fpu();\n return false;\n }\n}\nEXPORT_CODE int CONVENTION set_reference_stateD(const char *Ref, double T, double rho, double h0, double s0)\n{\n try{\n CoolProp::set_reference_stateD(std::string(Ref), T, rho, h0, s0);\n reset_fpu();\n return true;\n }\n catch(std::exception &){\n reset_fpu();\n return false;\n }\n}\n\n\/\/ All the function interfaces that point to the single-input Props function\nEXPORT_CODE double CONVENTION Props1(const char *FluidName, const char *Output){\n double val = PropsS(Output, \"\", 0, \"\", 0, FluidName);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION PropsS(const char *Output, const char* Name1, double Prop1, const char* Name2, double Prop2, const char * Ref){\n double val = Props(Output,Name1[0],Prop1,Name2[0],Prop2,Ref);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION Props(const char *Output, const char Name1, double Prop1, const char Name2, double Prop2, const char * Ref)\n{\n try\n {\n \/\/ Get parameter indices\n std::string sName1 = std::string(1, Name1), sName2 = std::string(1, Name2);\n long iOutput = get_param_index(Output);\n long iName1 = CoolProp::get_parameter_index(sName1);\n long iName2 = CoolProp::get_parameter_index(sName2);\n\n \/\/ Convert inputs to SI\n Prop1 = convert_from_kSI_to_SI(iName1, Prop1);\n Prop2 = convert_from_kSI_to_SI(iName2, Prop2);\n\n \/\/ Call the SI function\n double val = PropsSI(Output, sName1.c_str(), Prop1, sName2.c_str(), Prop2, Ref);\n\n reset_fpu();\n\n \/\/ Convert back to unit system\n return convert_from_SI_to_kSI(iOutput, val);\n }\n catch(std::exception &e){CoolProp::set_error_string(e.what()); return _HUGE;}\n catch(...){CoolProp::set_error_string(\"Undefined error\"); return _HUGE;}\n}\nEXPORT_CODE double CONVENTION saturation_ancillary(const char *fluid_name, const char *output, int Q, const char *input, double value)\n{\n try\n {\n std::string _output = output, _input = input;\n double val = CoolProp::saturation_ancillary(fluid_name, _output, Q, _input, value);\n reset_fpu();\n return val;\n }\n catch(std::exception &e){CoolProp::set_error_string(e.what()); return _HUGE;}\n catch(...){CoolProp::set_error_string(\"Undefined error\"); return _HUGE;}\n}\nEXPORT_CODE double CONVENTION Props1SI(const char *FluidName, const char *Output)\n{\n std::string _Output = Output, _FluidName = FluidName;\n double val = CoolProp::Props1SI(_FluidName, _Output);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION PropsSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n double val = CoolProp::PropsSI(_Output, _Name1, Prop1, _Name2, Prop2, _FluidName);\n reset_fpu();\n return val;\n}\nEXPORT_CODE long CONVENTION PhaseSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName, char *phase, int n)\n{\n std::string _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n std::string s = CoolProp::PhaseSI(_Name1, Prop1, _Name2, Prop2, _FluidName);\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(phase, s.c_str());\n reset_fpu();\n return 1;\n }\n else{\n reset_fpu();\n return 0;\n }\n}\nEXPORT_CODE double CONVENTION PropsSIZ(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName, const double *z, int n)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n double val = CoolProp::PropsSI(_Output, _Name1, Prop1, _Name2, Prop2, _FluidName, std::vector<double>(z, z+n));\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION propssi_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * FluidName, double *output)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n *output = CoolProp::PropsSI(_Output, _Name1, *Prop1, _Name2, *Prop2, _FluidName);\n reset_fpu();\n}\n\nEXPORT_CODE double CONVENTION K2F(double T){\n return T * 9 \/ 5 - 459.67;\n}\nEXPORT_CODE double CONVENTION F2K(double T_F){\n return (T_F + 459.67) * 5 \/ 9;\n}\nEXPORT_CODE int CONVENTION get_debug_level(){\n return CoolProp::get_debug_level();\n}\nEXPORT_CODE void CONVENTION set_debug_level(int level){\n CoolProp::set_debug_level(level);\n}\nEXPORT_CODE long CONVENTION get_param_index(const char * param){\n return CoolProp::get_parameter_index(param);\n}\nEXPORT_CODE long CONVENTION get_global_param_string(const char *param, char * Output, int n)\n{\n std::string s;\n try{\n s = CoolProp::get_global_param_string(param);\n }\n catch(std::exception &){\n return 0;\n }\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n}\nEXPORT_CODE long CONVENTION get_parameter_information_string(const char *param, char * Output, int n)\n{\n int key = CoolProp::get_parameter_index(param);\n if (key >= 0){\n std::string s = CoolProp::get_parameter_information(key, Output);\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n }\n else{\n strcpy(Output, format(\"parameter is invalid: %s\", param).c_str());\n return 0;\n }\n}\nEXPORT_CODE long CONVENTION get_fluid_param_string(const char *fluid, const char *param, char * Output, int n)\n{\n std::string s;\n try{\n s = CoolProp::get_fluid_param_string(std::string(fluid), std::string(param));\n }\n catch(std::exception &){\n return 0;\n }\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n}\nEXPORT_CODE double CONVENTION HAPropsSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * Name3, double Prop3)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n double val = HumidAir::HAPropsSI(Output, _Name1, Prop1, _Name2, Prop2, _Name3, Prop3);\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION hapropssi_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * Name3, double * Prop3, double *output)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n *output = HumidAir::HAPropsSI(_Output, _Name1, *Prop1, _Name2, *Prop2, _Name3, *Prop3);\n reset_fpu();\n}\nEXPORT_CODE double CONVENTION HAProps(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * Name3, double Prop3)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n double val = HumidAir::HAProps(Output, _Name1, Prop1, _Name2, Prop2, _Name3, Prop3);\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION haprops_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * Name3, double * Prop3, double *output)\n{\n *output = HAProps(Output, Name1, *Prop1, Name2, *Prop2, Name3, *Prop3);\n reset_fpu();\n}\n<commit_msg>Disable the clearing of FPU exceptions on platforms that do not support it<commit_after>#if defined(_MSC_VER)\n#define _CRTDBG_MAP_ALLOC\n#define _CRT_SECURE_NO_WARNINGS\n#include <crtdbg.h>\n#else\n#include <fenv.h>\n#endif\n\n#include \"CoolPropLib.h\"\n#include \"CoolProp.h\"\n#include \"HumidAirProp.h\"\n#include \"DataStructures.h\"\n#include \"Exceptions.h\"\n#include \"float.h\"\n\n#include <string.h>\n\n\/\/ In Microsoft Excel, they seem to check the FPU exception bits and error out because of it. \n\/\/ By calling the _clearfp(), we can reset these bits, and not get the error\n\/\/ See also http:\/\/stackoverflow.com\/questions\/11685441\/floating-point-error-when-calling-dll-function-from-vba\/27336496#27336496\n\/\/ See also http:\/\/stackoverflow.com\/questions\/16849009\/in-linux-do-there-exist-functions-similar-to-clearfp-and-statusfp for linux and OSX\nvoid reset_fpu()\n{\n #if defined(_MSC_VER)\n _clearfp(); \/\/ For MSVC, clear the floating point error flags\n #elif defined(FE_ALL_EXCEPT)\n feclearexcept(FE_ALL_EXCEPT);\n #endif\n}\ndouble convert_from_kSI_to_SI(long iInput, double value)\n{\n if (get_debug_level() > 8){\n std::cout << format(\"%s:%d: convert_from_kSI_to_SI(i=%d,value=%g)\\n\",__FILE__,__LINE__,iInput,value).c_str();\n }\n\n switch (iInput)\n {\n case CoolProp::iP:\n case CoolProp::iCpmass:\n case CoolProp::iCp0mass:\n case CoolProp::iSmass:\n case CoolProp::iGmass:\n case CoolProp::iCvmass:\n case CoolProp::iHmass:\n case CoolProp::iUmass:\n case CoolProp::iconductivity:\n return value*1000.0;\n case CoolProp::iDmass:\n case CoolProp::ispeed_sound:\n case CoolProp::iQ:\n case CoolProp::iviscosity:\n case CoolProp::iT:\n case CoolProp::iPrandtl:\n case CoolProp::isurface_tension:\n return value;\n default:\n throw CoolProp::ValueError(format(\"index [%d] is invalid in convert_from_kSI_to_SI\",iInput).c_str());\n break;\n }\n return _HUGE;\n}\n\ndouble convert_from_SI_to_kSI(long iInput, double value)\n{\n if (get_debug_level() > 8){\n std::cout << format(\"%s:%d: convert_from_SI_to_kSI(%d,%g)\\n\",__FILE__,__LINE__,iInput,value).c_str();\n }\n\n switch (iInput)\n {\n case CoolProp::iP:\n case CoolProp::iCpmass:\n case CoolProp::iCp0mass:\n case CoolProp::iSmass:\n case CoolProp::iGmass:\n case CoolProp::iCvmass:\n case CoolProp::iHmass:\n case CoolProp::iUmass:\n case CoolProp::iconductivity:\n return value\/1000.0;\n case CoolProp::iDmass:\n case CoolProp::iQ:\n case CoolProp::ispeed_sound:\n case CoolProp::iviscosity:\n case CoolProp::iT:\n case CoolProp::isurface_tension:\n return value;\n default:\n throw CoolProp::ValueError(format(\"index [%d] is invalid in convert_from_SI_to_kSI\", iInput).c_str());\n break;\n }\n return _HUGE;\n}\n\nEXPORT_CODE long CONVENTION redirect_stdout(const char* file){\n freopen(file, \"a+\", stdout);\n reset_fpu();\n return 0;\n}\nEXPORT_CODE int CONVENTION set_reference_stateS(const char *Ref, const char *reference_state)\n{\n std::string _Ref = Ref, _reference_state = reference_state;\n try{\n CoolProp::set_reference_stateS(_Ref, _reference_state);\n reset_fpu();\n return true;\n }\n catch(std::exception &){\n reset_fpu();\n return false;\n }\n}\nEXPORT_CODE int CONVENTION set_reference_stateD(const char *Ref, double T, double rho, double h0, double s0)\n{\n try{\n CoolProp::set_reference_stateD(std::string(Ref), T, rho, h0, s0);\n reset_fpu();\n return true;\n }\n catch(std::exception &){\n reset_fpu();\n return false;\n }\n}\n\n\/\/ All the function interfaces that point to the single-input Props function\nEXPORT_CODE double CONVENTION Props1(const char *FluidName, const char *Output){\n double val = PropsS(Output, \"\", 0, \"\", 0, FluidName);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION PropsS(const char *Output, const char* Name1, double Prop1, const char* Name2, double Prop2, const char * Ref){\n double val = Props(Output,Name1[0],Prop1,Name2[0],Prop2,Ref);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION Props(const char *Output, const char Name1, double Prop1, const char Name2, double Prop2, const char * Ref)\n{\n try\n {\n \/\/ Get parameter indices\n std::string sName1 = std::string(1, Name1), sName2 = std::string(1, Name2);\n long iOutput = get_param_index(Output);\n long iName1 = CoolProp::get_parameter_index(sName1);\n long iName2 = CoolProp::get_parameter_index(sName2);\n\n \/\/ Convert inputs to SI\n Prop1 = convert_from_kSI_to_SI(iName1, Prop1);\n Prop2 = convert_from_kSI_to_SI(iName2, Prop2);\n\n \/\/ Call the SI function\n double val = PropsSI(Output, sName1.c_str(), Prop1, sName2.c_str(), Prop2, Ref);\n\n reset_fpu();\n\n \/\/ Convert back to unit system\n return convert_from_SI_to_kSI(iOutput, val);\n }\n catch(std::exception &e){CoolProp::set_error_string(e.what()); return _HUGE;}\n catch(...){CoolProp::set_error_string(\"Undefined error\"); return _HUGE;}\n}\nEXPORT_CODE double CONVENTION saturation_ancillary(const char *fluid_name, const char *output, int Q, const char *input, double value)\n{\n try\n {\n std::string _output = output, _input = input;\n double val = CoolProp::saturation_ancillary(fluid_name, _output, Q, _input, value);\n reset_fpu();\n return val;\n }\n catch(std::exception &e){CoolProp::set_error_string(e.what()); return _HUGE;}\n catch(...){CoolProp::set_error_string(\"Undefined error\"); return _HUGE;}\n}\nEXPORT_CODE double CONVENTION Props1SI(const char *FluidName, const char *Output)\n{\n std::string _Output = Output, _FluidName = FluidName;\n double val = CoolProp::Props1SI(_FluidName, _Output);\n reset_fpu();\n return val;\n}\nEXPORT_CODE double CONVENTION PropsSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n double val = CoolProp::PropsSI(_Output, _Name1, Prop1, _Name2, Prop2, _FluidName);\n reset_fpu();\n return val;\n}\nEXPORT_CODE long CONVENTION PhaseSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName, char *phase, int n)\n{\n std::string _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n std::string s = CoolProp::PhaseSI(_Name1, Prop1, _Name2, Prop2, _FluidName);\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(phase, s.c_str());\n reset_fpu();\n return 1;\n }\n else{\n reset_fpu();\n return 0;\n }\n}\nEXPORT_CODE double CONVENTION PropsSIZ(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * FluidName, const double *z, int n)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n double val = CoolProp::PropsSI(_Output, _Name1, Prop1, _Name2, Prop2, _FluidName, std::vector<double>(z, z+n));\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION propssi_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * FluidName, double *output)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _FluidName = FluidName;\n *output = CoolProp::PropsSI(_Output, _Name1, *Prop1, _Name2, *Prop2, _FluidName);\n reset_fpu();\n}\n\nEXPORT_CODE double CONVENTION K2F(double T){\n return T * 9 \/ 5 - 459.67;\n}\nEXPORT_CODE double CONVENTION F2K(double T_F){\n return (T_F + 459.67) * 5 \/ 9;\n}\nEXPORT_CODE int CONVENTION get_debug_level(){\n return CoolProp::get_debug_level();\n}\nEXPORT_CODE void CONVENTION set_debug_level(int level){\n CoolProp::set_debug_level(level);\n}\nEXPORT_CODE long CONVENTION get_param_index(const char * param){\n return CoolProp::get_parameter_index(param);\n}\nEXPORT_CODE long CONVENTION get_global_param_string(const char *param, char * Output, int n)\n{\n std::string s;\n try{\n s = CoolProp::get_global_param_string(param);\n }\n catch(std::exception &){\n return 0;\n }\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n}\nEXPORT_CODE long CONVENTION get_parameter_information_string(const char *param, char * Output, int n)\n{\n int key = CoolProp::get_parameter_index(param);\n if (key >= 0){\n std::string s = CoolProp::get_parameter_information(key, Output);\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n }\n else{\n strcpy(Output, format(\"parameter is invalid: %s\", param).c_str());\n return 0;\n }\n}\nEXPORT_CODE long CONVENTION get_fluid_param_string(const char *fluid, const char *param, char * Output, int n)\n{\n std::string s;\n try{\n s = CoolProp::get_fluid_param_string(std::string(fluid), std::string(param));\n }\n catch(std::exception &){\n return 0;\n }\n if (s.size() < static_cast<unsigned int>(n)){\n strcpy(Output, s.c_str()); \n return 1;\n }\n else{\n return 0;\n }\n}\nEXPORT_CODE double CONVENTION HAPropsSI(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * Name3, double Prop3)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n double val = HumidAir::HAPropsSI(Output, _Name1, Prop1, _Name2, Prop2, _Name3, Prop3);\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION hapropssi_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * Name3, double * Prop3, double *output)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n *output = HumidAir::HAPropsSI(_Output, _Name1, *Prop1, _Name2, *Prop2, _Name3, *Prop3);\n reset_fpu();\n}\nEXPORT_CODE double CONVENTION HAProps(const char *Output, const char *Name1, double Prop1, const char *Name2, double Prop2, const char * Name3, double Prop3)\n{\n std::string _Output = Output, _Name1 = Name1, _Name2 = Name2, _Name3 = Name3;\n double val = HumidAir::HAProps(Output, _Name1, Prop1, _Name2, Prop2, _Name3, Prop3);\n reset_fpu();\n return val;\n}\nEXPORT_CODE void CONVENTION haprops_(const char *Output, const char *Name1, double *Prop1, const char *Name2, double *Prop2, const char * Name3, double * Prop3, double *output)\n{\n *output = HAProps(Output, Name1, *Prop1, Name2, *Prop2, Name3, *Prop3);\n reset_fpu();\n}\n<|endoftext|>"} {"text":"<commit_before>#include <chrono>\n#include <thread>\n#include <cstring>\n#include <stdio.h>\n\n#include \"AudioSubsystem.h\"\n#include \"AudioSubsystem_OpenAL.h\"\n#include \"Decoders\/iWaveDataProvider.h\"\n#include \"Decoders\/WAV\/WAVDataProvider.h\"\n#include \"Encoders\/iWaveDataEncoder.h\"\n#include \"Utils.h\"\n#include \"Playlist.h\"\n\n#define ENABLE_TEST\t0\n\nconst char* PORTAMP_VERSION = \"1.1.2\";\n\nsConfig g_Config;\nclPlaylist g_Playlist;\n\nsConfig ReadConfigFromCommandLine( int argc, char* argv[] )\n{\n\tsConfig Cfg;\n\n\tint i = 1;\n\n\twhile ( i < argc )\n\t{\n\t\tif ( strstr( argv[i], \"--loop\" ) == argv[i] ) Cfg.m_Loop = true;\n\t\telse if ( strstr( argv[i], \"--wav-modplug\" ) == argv[i] ) Cfg.m_UseModPlugToDecodeWAV = true;\n\t\telse if ( strstr( argv[i], \"--verbose\" ) == argv[i] ) Cfg.m_Verbose = true;\n\t\telse if ( strstr (argv[i], \"--output-file\" ) == argv[i] )\n\t\t{\n\t\t\tif ( i+1 < argc )\n\t\t\t{\n\t\t\t\tCfg.m_OutputFile = argv[++i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf( \"Expected output file name for --output-file\\n\" );\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t\telse g_Playlist.EnqueueTrack( argv[i] );\n\t\ti++;\n\t}\n\n\treturn Cfg;\n}\n\nvoid PrintBanner()\n{\n\tprintf( \"PortAMP version %s (%s)\\n\", PORTAMP_VERSION, __DATE__ \" \" __TIME__ \" via \" __COMPILER_VER__ \" for \" BUILD_OS );\n\tprintf( \"Copyright (C) 2015-2016 Sergey Kosarevsky\\n\" );\n\tprintf( \"portamp@linderdaum.com\\n\" );\n\tprintf( \"https:\/\/github.com\/corporateshark\/PortAMP\\n\" );\n\tprintf( \"\\n\" );\n\tprintf( \"portamp <filename1> [<filename2> ...] [--loop] [--wav-modplug] [--verbose]\\n\" );\n\tprintf( \"\\n\" );\n}\n\nint main( int argc, char* argv[] )\n{\n#if !ENABLE_TEST\n\tif ( argc <= 1 )\n\t{\n\t\tPrintBanner();\n\t\treturn 0;\n\t}\n#endif\n\n\tg_Config = ReadConfigFromCommandLine( argc, argv );\n\n#if ENABLE_TEST\n\tif ( g_Playlist.IsEmpty() ) g_Playlist.EnqueueTrack( \"test.ogg\" );\n\tg_Config.m_Verbose = true;\n#endif\n\n\tauto AudioSubsystem = CreateAudioSubsystem_OpenAL();\n\n\tAudioSubsystem->Start();\n\n\tauto Source = AudioSubsystem->CreateAudioSource();\n\t\/\/ allow seamless looping if there is only one track\n\tif ( g_Playlist.GetNumTracks() == 1 ) Source->SetLooping( g_Config.m_Loop );\n\n\tbool RequestingExit = false;\n\n\twhile ( !g_Playlist.IsEmpty() && !RequestingExit )\n\t{\n\t\tauto FileName = g_Playlist.GetAndPopNextTrack( g_Config.m_Loop );\n\t\tauto DataBlob = ReadFileAsBlob( FileName.c_str() );\n\t\tif (!DataBlob || !DataBlob->GetDataSize()) continue;\n\n\t\tauto Provider = CreateWaveDataProvider( FileName.c_str(), DataBlob );\n\t\tif (!Provider) continue;\n\t\t\n\t\tSource->BindDataProvider( Provider );\n\t\tSource->Play();\n\n\t\twhile ( Source->IsPlaying() && !RequestingExit )\n\t\t{\n\t\t\tstd::this_thread::sleep_for( std::chrono::milliseconds(10) );\n\n\t\t\tif ( IsKeyPressed() ) RequestingExit = true;\n\t\t};\n\n\t\tSource->Stop();\n\t}\n\n\tSource = nullptr;\n\n\tAudioSubsystem->Stop();\n\n\treturn 0;\n};\n<commit_msg>Updated version to 1.1.3<commit_after>#include <chrono>\n#include <thread>\n#include <cstring>\n#include <stdio.h>\n\n#include \"AudioSubsystem.h\"\n#include \"AudioSubsystem_OpenAL.h\"\n#include \"Decoders\/iWaveDataProvider.h\"\n#include \"Decoders\/WAV\/WAVDataProvider.h\"\n#include \"Encoders\/iWaveDataEncoder.h\"\n#include \"Utils.h\"\n#include \"Playlist.h\"\n\n#define ENABLE_TEST\t0\n\nconst char* PORTAMP_VERSION = \"1.1.3\";\n\nsConfig g_Config;\nclPlaylist g_Playlist;\n\nsConfig ReadConfigFromCommandLine( int argc, char* argv[] )\n{\n\tsConfig Cfg;\n\n\tint i = 1;\n\n\twhile ( i < argc )\n\t{\n\t\tif ( strstr( argv[i], \"--loop\" ) == argv[i] ) Cfg.m_Loop = true;\n\t\telse if ( strstr( argv[i], \"--wav-modplug\" ) == argv[i] ) Cfg.m_UseModPlugToDecodeWAV = true;\n\t\telse if ( strstr( argv[i], \"--verbose\" ) == argv[i] ) Cfg.m_Verbose = true;\n\t\telse if ( strstr (argv[i], \"--output-file\" ) == argv[i] )\n\t\t{\n\t\t\tif ( i+1 < argc )\n\t\t\t{\n\t\t\t\tCfg.m_OutputFile = argv[++i];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tprintf( \"Expected output file name for --output-file\\n\" );\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t\telse g_Playlist.EnqueueTrack( argv[i] );\n\t\ti++;\n\t}\n\n\treturn Cfg;\n}\n\nvoid PrintBanner()\n{\n\tprintf( \"PortAMP version %s (%s)\\n\", PORTAMP_VERSION, __DATE__ \" \" __TIME__ \" via \" __COMPILER_VER__ \" for \" BUILD_OS );\n\tprintf( \"Copyright (C) 2015-2016 Sergey Kosarevsky\\n\" );\n\tprintf( \"portamp@linderdaum.com\\n\" );\n\tprintf( \"https:\/\/github.com\/corporateshark\/PortAMP\\n\" );\n\tprintf( \"\\n\" );\n\tprintf( \"portamp <filename1> [<filename2> ...] [--loop] [--wav-modplug] [--verbose]\\n\" );\n\tprintf( \"\\n\" );\n}\n\nint main( int argc, char* argv[] )\n{\n#if !ENABLE_TEST\n\tif ( argc <= 1 )\n\t{\n\t\tPrintBanner();\n\t\treturn 0;\n\t}\n#endif\n\n\tg_Config = ReadConfigFromCommandLine( argc, argv );\n\n#if ENABLE_TEST\n\tif ( g_Playlist.IsEmpty() ) g_Playlist.EnqueueTrack( \"test.ogg\" );\n\tg_Config.m_Verbose = true;\n#endif\n\n\tauto AudioSubsystem = CreateAudioSubsystem_OpenAL();\n\n\tAudioSubsystem->Start();\n\n\tauto Source = AudioSubsystem->CreateAudioSource();\n\t\/\/ allow seamless looping if there is only one track\n\tif ( g_Playlist.GetNumTracks() == 1 ) Source->SetLooping( g_Config.m_Loop );\n\n\tbool RequestingExit = false;\n\n\twhile ( !g_Playlist.IsEmpty() && !RequestingExit )\n\t{\n\t\tauto FileName = g_Playlist.GetAndPopNextTrack( g_Config.m_Loop );\n\t\tauto DataBlob = ReadFileAsBlob( FileName.c_str() );\n\t\tif (!DataBlob || !DataBlob->GetDataSize()) continue;\n\n\t\tauto Provider = CreateWaveDataProvider( FileName.c_str(), DataBlob );\n\t\tif (!Provider) continue;\n\t\t\n\t\tSource->BindDataProvider( Provider );\n\t\tSource->Play();\n\n\t\twhile ( Source->IsPlaying() && !RequestingExit )\n\t\t{\n\t\t\tstd::this_thread::sleep_for( std::chrono::milliseconds(10) );\n\n\t\t\tif ( IsKeyPressed() ) RequestingExit = true;\n\t\t};\n\n\t\tSource->Stop();\n\t}\n\n\tSource = nullptr;\n\n\tAudioSubsystem->Stop();\n\n\treturn 0;\n};\n<|endoftext|>"} {"text":"<commit_before>\/*\topendatacon\n *\n *\tCopyright (c) 2014:\n *\n *\t\tDCrip3fJguWgVCLrZFfA7sIGgvx1Ou3fHfCxnrz4svAi\n *\t\tyxeOtDhDCXf1Z4ApgXvX5ahqQmzRfJ2DoX8S05SqHA==\n *\t\n *\tLicensed under the Apache License, Version 2.0 (the \"License\");\n *\tyou may not use this file except in compliance with the License.\n *\tYou may obtain a copy of the License at\n *\t\n *\t\thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *\tUnless required by applicable law or agreed to in writing, software\n *\tdistributed under the License is distributed on an \"AS IS\" BASIS,\n *\tWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *\tSee the License for the specific language governing permissions and\n *\tlimitations under the License.\n *\/ \n\/*\n * main.cpp\n *\n * Created on: 14\/07\/2014\n * Author: Neil Stephens <dearknarl@gmail.com>\n *\/\n\n\/*TODO:\n * \t-fix logging:\n * \t\t-use log level properly\n * \t\t-cmd to change log level on the fly (part of config cmds: see below)\n * \t-add config change commands\n * \t\t-implement BuildOrRebuild properly for changed configs\n * \t\t-cmd to apply config item from command line\n * \t\t-cmd to load config from file\n * \t\t-save config to file\n * \t-add maintenance commands:\n * \t\t-enable\/disable\/restart ports\/connectors\/connections\n * \t-remove the need for DNP3Manager and two threadpools?\n * \t\t-DataConcentrator class can do it all\n * \t-implement plugin architecture - the following should be plugins:\n * \t\t-DataPort implementations\n * \t\t-Transform implementations\n * \t-add a network interface to the console\n *\t-network logging\n *\t-daemon mode\n *\t-more dataports to implement:\n *\t\t-EventGenPort (random events ala old test_slaves util)\n *\t\t-C37.118\n *\t\t-NMEA 2k \/ CANv2\n *\t\t-NMEA 0183\n *\t\t-XMLoHTML (inc. Gridlab-D)\n *\t\t-JSONoHTML\n *\/\n\n#include \"DataConcentrator.h\"\n\nint main(int argc, char* argv[])\n{\n\ttry\n\t{\n\t\t\/\/default config file\n\t\tstd::string ConfFileName = \"opendatacon.conf\";\n\t\t\/\/override if there's one provided\n\t\tif (argc>1)\n\t\t\tConfFileName = argv[1];\n\n\t\tDataConcentrator TheDataConcentrator(ConfFileName);\n\t\tTheDataConcentrator.BuildOrRebuild();\n\t\tTheDataConcentrator.Run();\n\n\t}\n\tcatch(std::exception& e)\n\t{\n\t\tstd::cout<<\"Caught exception: \"<<e.what()<<std::endl;\n\t\treturn 1;\n\t}\n\n\treturn 0;\n}\n\n\n<commit_msg>updated TODO list<commit_after>\/*\topendatacon\n *\n *\tCopyright (c) 2014:\n *\n *\t\tDCrip3fJguWgVCLrZFfA7sIGgvx1Ou3fHfCxnrz4svAi\n *\t\tyxeOtDhDCXf1Z4ApgXvX5ahqQmzRfJ2DoX8S05SqHA==\n *\t\n *\tLicensed under the Apache License, Version 2.0 (the \"License\");\n *\tyou may not use this file except in compliance with the License.\n *\tYou may obtain a copy of the License at\n *\t\n *\t\thttp:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n *\tUnless required by applicable law or agreed to in writing, software\n *\tdistributed under the License is distributed on an \"AS IS\" BASIS,\n *\tWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *\tSee the License for the specific language governing permissions and\n *\tlimitations under the License.\n *\/ \n\/*\n * main.cpp\n *\n * Created on: 14\/07\/2014\n * Author: Neil Stephens <dearknarl@gmail.com>\n *\/\n\n\/*TODO:\n * \t-fix logging:\n * \t\t-cmd to change log level on the fly (part of config cmds: see below)\n * \t-add config change commands\n * \t\t-implement BuildOrRebuild properly for changed configs\n * \t\t-cmd to apply config item from command line\n * \t\t-cmd to load config from file\n * \t\t-save config to file\n * \t-add maintenance commands:\n * \t\t-enable\/disable\/restart ports\/connectors\/connections\n * \t-remove the need for DNP3Manager and two threadpools?\n * \t\t-DataConcentrator class can do it all\n * \t-implement plugin architecture - the following should be plugins:\n * \t\t-DataPort implementations - DONE\n * \t\t-Transform implementations\n * \t-add a network interface to the console\n *\t-network logging\n *\t-daemon mode\n *\t-more dataports to implement:\n *\t\t-EventGenPort (random events ala old test_slaves util)\n *\t\t-C37.118\n *\t\t-NMEA 2k \/ CANv2\n *\t\t-NMEA 0183\n *\t\t-XMLoHTML (inc. Gridlab-D)\n *\t\t-JSONoHTML\n *\/\n\n#include \"DataConcentrator.h\"\n\nint main(int argc, char* argv[])\n{\n\ttry\n\t{\n\t\t\/\/default config file\n\t\tstd::string ConfFileName = \"opendatacon.conf\";\n\t\t\/\/override if there's one provided\n\t\tif (argc>1)\n\t\t\tConfFileName = argv[1];\n\n\t\tDataConcentrator TheDataConcentrator(ConfFileName);\n\t\tTheDataConcentrator.BuildOrRebuild();\n\t\tTheDataConcentrator.Run();\n\n\t}\n\tcatch(std::exception& e)\n\t{\n\t\tstd::cout<<\"Caught exception: \"<<e.what()<<std::endl;\n\t\treturn 1;\n\t}\n\n\treturn 0;\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/\/-----------------------------------------------------------------------------\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2016 Thomas Steinholz\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/-----------------------------------------------------------------------------\n\n#include <allegro5\/allegro.h>\n#include <allegro5\/allegro_audio.h>\n#include <allegro5\/allegro_acodec.h>\n#include <allegro5\/allegro_image.h>\n#include <allegro5\/allegro_primitives.h>\n#include <allegro5\/allegro_font.h>\n#include <allegro5\/allegro_ttf.h>\n\n#include <cstdio>\n#include <memory>\n\n#define DEBUG\n\nvoid initialize();\nvoid shutdown();\n\nstruct Assets {\npublic:\n Assets() :\n background(load_bitmap(\"res\/imgs\/Backgrounds\/apurple.png\"))\n { }\n\n Assets(const Assets& a) :\n background(a.background) { }\n\n ~Assets() {\n al_destroy_bitmap(background);\n }\n\n Assets& operator = (const Assets& a);\n\n ALLEGRO_BITMAP *background;\n\nprotected:\n\n ALLEGRO_BITMAP *load_bitmap(const char *file) {\n auto tmp = al_load_bitmap(file);\n assert(tmp && printf(\"Bitmap is not valid.\"));\n return tmp;\n }\n};\n\ntypedef enum {\n Menu,\n Game,\n End,\n} Stage;\n\nint main(void) {\n initialize();\n\n Assets* assets = new Assets();\n Stage stage = Menu;\n\n ALLEGRO_DISPLAY *display = al_create_display(1920, 1080);\n ALLEGRO_EVENT_QUEUE *evqueue = al_create_event_queue();\n ALLEGRO_TIMER *fps_timer = al_create_timer(1.0 \/ 60.0);\n bool render = true, executing = true;\n\n al_set_display_flag(display, ALLEGRO_FULLSCREEN_WINDOW, true);\n\n if (!display) {\n printf(\"Failed to create display!\\n\");\n exit(EXIT_FAILURE);\n }\n\n al_register_event_source(evqueue, al_get_keyboard_event_source());\n al_register_event_source(evqueue, al_get_mouse_event_source());\n al_register_event_source(evqueue, al_get_display_event_source(display));\n al_register_event_source(evqueue, al_get_timer_event_source(fps_timer));\n\n al_start_timer(fps_timer);\n\n while (executing) {\n ALLEGRO_EVENT event;\n al_wait_for_event(evqueue, &event);\n switch (event.type) {\n case ALLEGRO_EVENT_TIMER:\n render = true;\n break;\n case ALLEGRO_EVENT_DISPLAY_CLOSE:\n executing = false;\n break;\n case ALLEGRO_EVENT_KEY_DOWN:\n executing = event.keyboard.keycode != ALLEGRO_KEY_ESCAPE;\n break;\n default: break;\n }\n\n if (render && al_is_event_queue_empty(evqueue)) {\n render = false;\n al_clear_to_color(al_map_rgb(0, 0, 0));\n al_set_target_bitmap(al_get_backbuffer(display));\n for (float x = 0; x < 1080; x += al_get_bitmap_width(assets->background)) {\n for (float y = 0; y < 1920; y += al_get_bitmap_height(assets->background)) {\n al_draw_bitmap(assets->background, x, y, 0);\n }\n }\n switch (stage) {\n default: break;\n case Menu:\n\n break;\n case Game:\n\n break;\n case End:\n\n break;\n }\n al_flip_display();\n }\n render = false;\n }\n\n al_unregister_event_source(evqueue, al_get_keyboard_event_source());\n al_unregister_event_source(evqueue, al_get_mouse_event_source());\n al_unregister_event_source(evqueue, al_get_display_event_source(display));\n al_unregister_event_source(evqueue, al_get_timer_event_source(fps_timer));\n\n al_destroy_display(display);\n al_destroy_event_queue(evqueue);\n al_destroy_timer(fps_timer);\n\n delete assets;\n shutdown();\n return EXIT_SUCCESS;\n}\n\nvoid initialize() {\n srand((unsigned int) time(NULL));\n\n#ifdef DEBUG\n printf(\"Allegro v%i.%i.%i\\n\",\n al_get_allegro_version() >> 24,\n (al_get_allegro_version() >> 16) & 255,\n (al_get_allegro_version() >> 8) & 255);\n#endif \/\/DEBUG\n\n if (!al_init()) {\n printf(\"Failed to initialize allegro!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_audio()) {\n fprintf(stderr, \"Failed to initialize audio!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_init_acodec_addon()) {\n fprintf(stderr, \"Failed to initialize audio codecs!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_reserve_samples(1)) {\n fprintf(stderr, \"Failed to reserve samples!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_mouse()) {\n fprintf(stderr, \"Failed to initialize the mouse!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_keyboard()) {\n fprintf(stderr, \"al_install_keyboard Failed!\\n\");\n exit(EXIT_FAILURE);\n }\n\n al_init_primitives_addon();\n al_init_font_addon();\n al_init_ttf_addon();\n al_init_image_addon();\n}\n\nvoid shutdown() {\n al_shutdown_image_addon();\n al_shutdown_ttf_addon();\n al_shutdown_font_addon();\n al_shutdown_primitives_addon();\n al_uninstall_keyboard();\n al_uninstall_mouse();\n al_uninstall_audio();\n al_uninstall_system();\n}\n<commit_msg>stuff<commit_after>\/\/-----------------------------------------------------------------------------\n\/\/ The MIT License (MIT)\n\/\/\n\/\/ Copyright (c) 2016 Thomas Steinholz\n\/\/\n\/\/ Permission is hereby granted, free of charge, to any person obtaining a copy\n\/\/ of this software and associated documentation files (the \"Software\"), to deal\n\/\/ in the Software without restriction, including without limitation the rights\n\/\/ to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n\/\/ copies of the Software, and to permit persons to whom the Software is\n\/\/ furnished to do so, subject to the following conditions:\n\/\/\n\/\/ The above copyright notice and this permission notice shall be included in all\n\/\/ copies or substantial portions of the Software.\n\/\/\n\/\/ THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n\/\/ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n\/\/ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n\/\/ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n\/\/ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n\/\/ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n\/\/ SOFTWARE.\n\/\/-----------------------------------------------------------------------------\n\n#include <allegro5\/allegro.h>\n#include <allegro5\/allegro_audio.h>\n#include <allegro5\/allegro_acodec.h>\n#include <allegro5\/allegro_image.h>\n#include <allegro5\/allegro_primitives.h>\n#include <allegro5\/allegro_font.h>\n#include <allegro5\/allegro_ttf.h>\n\n#include <cstdio>\n#include <memory>\n\n#define DEBUG\n\nvoid initialize();\nvoid shutdown();\n\nstruct Assets {\npublic:\n Assets() :\n background(load_bitmap(\"res\/imgs\/Backgrounds\/purple.png\"))\n { }\n\n Assets(const Assets& a) :\n background(a.background) { }\n\n ~Assets() {\n#ifdef DEBUG\n printf(\"Destroyed Assets\\n\");\n#endif \/\/ DEBUG\n al_destroy_bitmap(background);\n }\n\n Assets& operator = (const Assets& a);\n\n ALLEGRO_BITMAP *background;\n\nprotected:\n\n ALLEGRO_BITMAP *load_bitmap(const char *file) {\n auto tmp = al_load_bitmap(file);\n assert(tmp && printf(\"Loaded %s\\n\", file));\n return tmp;\n }\n};\n\ntypedef enum {\n Menu,\n Game,\n End,\n} Stage;\n\nint main(void) {\n initialize();\n\n Assets* assets = new Assets();\n Stage stage = Menu;\n\n ALLEGRO_DISPLAY *display = al_create_display(1920, 1080);\n ALLEGRO_EVENT_QUEUE *evqueue = al_create_event_queue();\n ALLEGRO_TIMER *fps_timer = al_create_timer(1.0 \/ 60.0);\n bool render = true, executing = true;\n\n al_set_display_flag(display, ALLEGRO_FULLSCREEN_WINDOW, true);\n\n if (!display) {\n printf(\"Failed to create display!\\n\");\n exit(EXIT_FAILURE);\n }\n\n al_register_event_source(evqueue, al_get_keyboard_event_source());\n al_register_event_source(evqueue, al_get_mouse_event_source());\n al_register_event_source(evqueue, al_get_display_event_source(display));\n al_register_event_source(evqueue, al_get_timer_event_source(fps_timer));\n\n al_start_timer(fps_timer);\n\n while (executing) {\n ALLEGRO_EVENT event;\n al_wait_for_event(evqueue, &event);\n switch (event.type) {\n case ALLEGRO_EVENT_TIMER:\n render = true;\n break;\n case ALLEGRO_EVENT_DISPLAY_CLOSE:\n executing = false;\n break;\n case ALLEGRO_EVENT_KEY_DOWN:\n executing = event.keyboard.keycode != ALLEGRO_KEY_ESCAPE;\n break;\n default: break;\n }\n\n if (render && al_is_event_queue_empty(evqueue)) {\n render = false;\n al_clear_to_color(al_map_rgb(0, 0, 0));\n al_set_target_bitmap(al_get_backbuffer(display));\n for (float x = 0; x < 1080; x += al_get_bitmap_width(assets->background)) {\n for (float y = 0; y < 1920; y += al_get_bitmap_height(assets->background)) {\n al_draw_bitmap(assets->background, x, y, 0);\n }\n }\n switch (stage) {\n default: break;\n case Menu:\n\n break;\n case Game:\n\n break;\n case End:\n\n break;\n }\n al_flip_display();\n }\n render = false;\n }\n\n al_unregister_event_source(evqueue, al_get_keyboard_event_source());\n al_unregister_event_source(evqueue, al_get_mouse_event_source());\n al_unregister_event_source(evqueue, al_get_display_event_source(display));\n al_unregister_event_source(evqueue, al_get_timer_event_source(fps_timer));\n\n al_destroy_display(display);\n al_destroy_event_queue(evqueue);\n al_destroy_timer(fps_timer);\n\n delete assets;\n shutdown();\n return EXIT_SUCCESS;\n}\n\nvoid initialize() {\n srand((unsigned int) time(NULL));\n\n#ifdef DEBUG\n printf(\"Allegro v%i.%i.%i\\n\",\n al_get_allegro_version() >> 24,\n (al_get_allegro_version() >> 16) & 255,\n (al_get_allegro_version() >> 8) & 255);\n#endif \/\/DEBUG\n\n if (!al_init()) {\n printf(\"Failed to initialize allegro!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_audio()) {\n fprintf(stderr, \"Failed to initialize audio!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_init_acodec_addon()) {\n fprintf(stderr, \"Failed to initialize audio codecs!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_reserve_samples(1)) {\n fprintf(stderr, \"Failed to reserve samples!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_mouse()) {\n fprintf(stderr, \"Failed to initialize the mouse!\\n\");\n exit(EXIT_FAILURE);\n }\n if (!al_install_keyboard()) {\n fprintf(stderr, \"al_install_keyboard Failed!\\n\");\n exit(EXIT_FAILURE);\n }\n\n al_init_primitives_addon();\n al_init_font_addon();\n al_init_ttf_addon();\n al_init_image_addon();\n}\n\nvoid shutdown() {\n al_shutdown_image_addon();\n al_shutdown_ttf_addon();\n al_shutdown_font_addon();\n al_shutdown_primitives_addon();\n al_uninstall_keyboard();\n al_uninstall_mouse();\n al_uninstall_audio();\n al_uninstall_system();\n}\n<|endoftext|>"} {"text":"<commit_before>#include \"rules.hpp\"\n\n#include <iostream>\n#include <cassert>\n\n#include <QChar>\n#include <QTextStream>\n#include <QString>\n\n#include \"StreamIterator\"\n#include \"TokenRule\"\n#include \"DiscardRule\"\n#include \"SharedRule\"\n#include \"MultipleRule\"\n#include \"OptionalRule\"\n#include \"PredicateRule\"\n#include \"ProxyRule\"\n#include \"AlternativeRule\"\n#include \"ReduceRule\"\n\n#include <QRegExp>\n#include <QHash>\n#include <QElapsedTimer>\n\nusing namespace sprout;\n\nenum class TokenType {\n Unknown,\n Name,\n Equal,\n List,\n StringConstant,\n Assignment\n};\n\nconst char* tokenTypeName(const TokenType type)\n{\n switch (type) {\n case TokenType::Unknown: return \"Unknown\";\n case TokenType::Name: return \"Name\";\n case TokenType::Equal: return \"Equal\";\n case TokenType::List: return \"List\";\n case TokenType::StringConstant: return \"StringConstant\";\n case TokenType::Assignment: return \"Assignment\";\n default:\n std::stringstream str;\n str << \"Unexpected TokenType: \" << static_cast<int>(type);\n throw std::logic_error(str.str());\n }\n}\n\nstruct Token {\n TokenType type;\n QString value;\n\n Token() :\n type(TokenType::Unknown)\n {\n }\n\n Token(const TokenType& type) :\n type(type)\n {\n }\n\n Token(const TokenType& type, const QString& value) :\n type(type),\n value(value)\n {\n }\n};\n\nstruct Node {\n Token token;\n std::vector<Node> children;\n\n Node(const Token& token) :\n token(token)\n {\n }\n\n Node(const Token& token, std::vector<Node> children) :\n token(token),\n children(children)\n {\n }\n\n TokenType type() const\n {\n return token.type;\n }\n\n const char* typeName() const\n {\n return tokenTypeName(type());\n }\n\n QString value() const\n {\n return token.value;\n }\n\n void add(const Node& child)\n {\n children.push_back(child);\n }\n\n Node operator[](const int index) const\n {\n return children[index];\n }\n};\n\nint main(int argc, char* argv[])\n{\n using namespace make;\n\n auto whitespace = rule::whitespace<QString>();\n\n auto name = convert<Node>(\n aggregate<QString>(\n multiple(simplePredicate<QChar>([](const QChar& input) {\n return input.isLetter() || input == '_';\n })),\n [](QString& target, const QChar& c) {\n target += c;\n }\n ),\n [](QString& value) {\n return Node(Token(TokenType::Name, value));\n }\n );\n\n auto definition = proxySequence<QChar, Node>(\n discard(proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"var\"),\n whitespace\n )),\n name\n );\n\n auto stringConstant = convert<Node>(\n rule::quotedString,\n [](QString& value) {\n return Node(Token(TokenType::StringConstant, value));\n }\n );\n\n auto rvalue = shared(proxyAlternative<QChar, Node>(\n convert<Node>(\n rule::floating,\n [](const float& value) {\n return Node(\n Token(TokenType::StringConstant, QString::number(value))\n );\n }\n ),\n convert<Node>(\n rule::integer,\n [](const long value) {\n return Node(\n Token(TokenType::StringConstant, QString::number(value))\n );\n }\n ),\n stringConstant,\n name\n ));\n\n auto ws = discard(optional(whitespace));\n\n auto list = reduce<Node>(\n proxySequence<QChar, Node>(\n discard(OrderedTokenRule<QChar, QString>(\"[\")),\n optional(proxySequence<QChar, Node>(\n ws,\n rvalue,\n ws,\n optional(multiple(proxySequence<QChar, Node>(\n discard(OrderedTokenRule<QChar, QString>(\",\")),\n ws,\n rvalue,\n ws\n ))),\n ws,\n discard(optional(OrderedTokenRule<QChar, QString>(\",\")))\n )),\n ws,\n discard(OrderedTokenRule<QChar, QString>(\"]\"))\n ),\n [](Result<Node>& target, Result<Node>& items) {\n target << Node(\n TokenType::List,\n items.data()\n );\n }\n );\n\n rvalue << list;\n\n auto assignment = reduce<Node>(\n proxySequence<QChar, Node>(\n name,\n discard(proxySequence<QChar, QString>(\n optional(whitespace),\n OrderedTokenRule<QChar, QString>(\"=\"),\n optional(whitespace)\n )),\n rvalue,\n discard(optional(whitespace)),\n discard(optional(OrderedTokenRule<QChar, QString>(\";\")))\n ),\n [](Result<Node>& results, Result<Node>& subresults) {\n results << Node(\n TokenType::Assignment,\n subresults.data()\n );\n }\n );\n\n auto parser = proxySequence<QChar, Node>(\n proxyAlternative<QChar, Node>(\n assignment,\n name\n ),\n make::end<QChar, Node>()\n );\n\n QTextStream stream(stdin);\n stream.setCodec(\"UTF-8\");\n\n QHash<QString, QString> globals;\n\n QString line;\n while (true) {\n std::cout << \"sprout> \";\n line = stream.readLine();\n if (line.isNull()) {\n break;\n }\n\n QTextStream lineStream(&line);\n auto cursor = makeCursor<QChar>(&lineStream);\n\n Result<Node> nodes;\n if (parser(cursor, nodes)) {\n for (auto node : nodes) {\n switch (node.type()) {\n case TokenType::Name:\n {\n auto name = node.value();\n std::cout << globals[name].toUtf8().constData() << std::endl;\n break;\n }\n case TokenType::Assignment:\n {\n auto name = node[0].value();\n auto result = node[1];\n switch (result.type()) {\n case TokenType::Name:\n globals[name] = globals[result.value()];\n break;\n case TokenType::StringConstant:\n globals[name] = result.value();\n break;\n default:\n std::cout << \"Unhandled type: \" << result.typeName() << std::endl;\n break;\n }\n break;\n }\n default:\n std::cout << \"Unhandled type: \" << node.typeName() << std::endl;\n break;\n }\n }\n } else {\n std::cout << \"Failed to parse\\n\";\n }\n }\n\n return 0;\n}\n\n\/\/ vim: set ts=4 sw=4 :\n<commit_msg>Added pretty-printing for created trees<commit_after>#include \"rules.hpp\"\n\n#include <iostream>\n#include <cassert>\n\n#include <QChar>\n#include <QTextStream>\n#include <QString>\n\n#include \"StreamIterator\"\n#include \"TokenRule\"\n#include \"DiscardRule\"\n#include \"SharedRule\"\n#include \"MultipleRule\"\n#include \"OptionalRule\"\n#include \"PredicateRule\"\n#include \"ProxyRule\"\n#include \"AlternativeRule\"\n#include \"ReduceRule\"\n\n#include <QRegExp>\n#include <QHash>\n#include <QElapsedTimer>\n\nusing namespace sprout;\n\nenum class TokenType {\n Unknown,\n Name,\n Equal,\n List,\n StringConstant,\n Assignment\n};\n\nconst char* tokenTypeName(const TokenType type)\n{\n switch (type) {\n case TokenType::Unknown: return \"Unknown\";\n case TokenType::Name: return \"Name\";\n case TokenType::Equal: return \"Equal\";\n case TokenType::List: return \"List\";\n case TokenType::StringConstant: return \"StringConstant\";\n case TokenType::Assignment: return \"Assignment\";\n default:\n std::stringstream str;\n str << \"Unexpected TokenType: \" << static_cast<int>(type);\n throw std::logic_error(str.str());\n }\n}\n\nstruct Token {\n TokenType type;\n QString value;\n\n Token() :\n type(TokenType::Unknown)\n {\n }\n\n Token(const TokenType& type) :\n type(type)\n {\n }\n\n Token(const TokenType& type, const QString& value) :\n type(type),\n value(value)\n {\n }\n};\n\nstruct Node {\n Token token;\n std::vector<Node> children;\n\n Node(const Token& token) :\n token(token)\n {\n }\n\n Node(const Token& token, std::vector<Node> children) :\n token(token),\n children(children)\n {\n }\n\n TokenType type() const\n {\n return token.type;\n }\n\n const char* typeName() const\n {\n return tokenTypeName(type());\n }\n\n QString value() const\n {\n return token.value;\n }\n\n void add(const Node& child)\n {\n children.push_back(child);\n }\n\n Node operator[](const int index) const\n {\n return children[index];\n }\n\n void dump(std::stringstream& str, const std::string& indent) const\n {\n str << typeName();\n if (!value().isNull()) {\n str << \":\" << value().toUtf8().constData();\n }\n if (!children.empty()) {\n auto childIndent = indent + \" \";\n str << \" [\\n\" << childIndent;\n for (int i = 0; i < children.size(); ++i) {\n if (i > 0) {\n str << \",\\n\" << childIndent;\n }\n children[i].dump(str, childIndent);\n }\n str << \"\\n\" << indent << \"]\";\n }\n }\n\n std::string dump() const\n {\n std::stringstream str;\n dump(str, \"\");\n return str.str();\n }\n};\n\nint main(int argc, char* argv[])\n{\n using namespace make;\n\n auto whitespace = rule::whitespace<QString>();\n\n auto name = convert<Node>(\n aggregate<QString>(\n multiple(simplePredicate<QChar>([](const QChar& input) {\n return input.isLetter() || input == '_';\n })),\n [](QString& target, const QChar& c) {\n target += c;\n }\n ),\n [](QString& value) {\n return Node(Token(TokenType::Name, value));\n }\n );\n\n auto definition = proxySequence<QChar, Node>(\n discard(proxySequence<QChar, QString>(\n OrderedTokenRule<QChar, QString>(\"var\"),\n whitespace\n )),\n name\n );\n\n auto stringConstant = convert<Node>(\n rule::quotedString,\n [](QString& value) {\n return Node(Token(TokenType::StringConstant, value));\n }\n );\n\n auto rvalue = shared(proxyAlternative<QChar, Node>(\n convert<Node>(\n rule::floating,\n [](const float& value) {\n return Node(\n Token(TokenType::StringConstant, QString::number(value))\n );\n }\n ),\n convert<Node>(\n rule::integer,\n [](const long value) {\n return Node(\n Token(TokenType::StringConstant, QString::number(value))\n );\n }\n ),\n stringConstant,\n name\n ));\n\n auto ws = discard(optional(whitespace));\n\n auto list = reduce<Node>(\n proxySequence<QChar, Node>(\n discard(OrderedTokenRule<QChar, QString>(\"[\")),\n optional(proxySequence<QChar, Node>(\n ws,\n rvalue,\n ws,\n optional(multiple(proxySequence<QChar, Node>(\n discard(OrderedTokenRule<QChar, QString>(\",\")),\n ws,\n rvalue,\n ws\n ))),\n ws,\n discard(optional(OrderedTokenRule<QChar, QString>(\",\")))\n )),\n ws,\n discard(OrderedTokenRule<QChar, QString>(\"]\"))\n ),\n [](Result<Node>& target, Result<Node>& items) {\n target << Node(\n TokenType::List,\n items.data()\n );\n }\n );\n\n rvalue << list;\n\n auto assignment = reduce<Node>(\n proxySequence<QChar, Node>(\n name,\n discard(proxySequence<QChar, QString>(\n optional(whitespace),\n OrderedTokenRule<QChar, QString>(\"=\"),\n optional(whitespace)\n )),\n rvalue,\n discard(optional(whitespace)),\n discard(optional(OrderedTokenRule<QChar, QString>(\";\")))\n ),\n [](Result<Node>& results, Result<Node>& subresults) {\n results << Node(\n TokenType::Assignment,\n subresults.data()\n );\n }\n );\n\n auto parser = proxySequence<QChar, Node>(\n proxyAlternative<QChar, Node>(\n assignment,\n name\n ),\n make::end<QChar, Node>()\n );\n\n QTextStream stream(stdin);\n stream.setCodec(\"UTF-8\");\n\n QHash<QString, QString> globals;\n\n QString line;\n while (true) {\n std::cout << \"sprout> \";\n line = stream.readLine();\n if (line.isNull()) {\n break;\n }\n\n QTextStream lineStream(&line);\n auto cursor = makeCursor<QChar>(&lineStream);\n\n Result<Node> nodes;\n if (parser(cursor, nodes)) {\n for (auto node : nodes) {\n switch (node.type()) {\n case TokenType::Name:\n {\n auto name = node.value();\n std::cout << globals[name].toUtf8().constData() << std::endl;\n break;\n }\n case TokenType::Assignment:\n {\n auto name = node[0].value();\n auto result = node[1];\n switch (result.type()) {\n case TokenType::Name:\n globals[name] = globals[result.value()];\n break;\n case TokenType::StringConstant:\n globals[name] = result.value();\n break;\n default:\n std::cout << \"Unhandled type: \" << result.typeName() << std::endl;\n break;\n }\n break;\n }\n default:\n std::cout << \"Unhandled type: \" << node.typeName() << std::endl;\n break;\n }\n }\n } else {\n std::cout << \"Failed to parse\\n\";\n }\n }\n\n return 0;\n}\n\n\/\/ vim: set ts=4 sw=4 :\n<|endoftext|>"} {"text":"<commit_before>#define EIGEN2_SUPPORT\r\n\r\n#ifdef DMTruncate\r\n#define DENSITY_MATRIX_TRUNCATION_TOLERANCE 1e-3\r\n#define TERM_MATRIX_ELEMENT_TOLERANCE 1e-3\r\n#define TERM_RESONANCE_TOLERANCE 1e-16\r\n#endif\r\n\r\n#include \"config.h\"\r\n#include \"output.h\"\r\n#include \"LatticeAnalysis.h\"\r\n#include \"Term.h\"\r\n#include \"BitClassification.h\"\r\n#include \"StatesClassification.h\"\r\n#include \"HamiltonianPart.h\"\r\n#include \"Hamiltonian.h\"\r\n#include \"FieldOperatorPart.h\"\r\n#include \"FieldOperator.h\"\r\n#include \"GreensFunction.h\"\r\n#include \"GFContainer.h\"\r\n#include \"TwoParticleGF.h\"\r\n#include \"TwoParticleGFContainer.h\"\r\n#include \"Vertex4.h\"\r\n\r\n#include<fstream>\r\n#include \"iniconfig.h\"\r\n\r\nstring input = \"system.ini\";\r\n\r\nLatticeAnalysis Lattice;\r\nBitClassification IndexInfo(Lattice);\r\nStatesClassification S(IndexInfo); \r\noutput_handle OUT;\r\nHamiltonian H(IndexInfo,S,OUT,input);\r\n\r\nostream &OUTPUT_STREAM=std::cout;\r\n\r\nIniConfig* pIni;\r\n\r\nint main()\r\n{ \r\n \r\n cout << \"=======================\" << endl;\r\n cout << \"Lattice Info\" << endl;\r\n cout << \"=======================\" << endl;\r\n Lattice.readin();\r\n cout << Lattice.printSitesList().str() << flush;\r\n IndexInfo.prepare();\r\n cout << \"=======================\" << endl;\r\n cout << \"System Info\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printBitInfoList();\r\n cout << \"=======================\" << endl;\r\n cout << \"Hopping Matrix\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printHoppingMatrix();\r\n cout << \"=======================\" << endl;\r\n cout << \"Terms check\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printTerms();\r\n \/\/determination of system\r\n \r\n pIni = new IniConfig(input);\r\n \r\n OUT = output_handle((*pIni)[\"output:path\"]);\r\n\r\n\r\n\r\n S.iniStatesClassification();\r\n\r\n \/\/end of determination \r\n \r\n cout << \"=======================\" << endl;\r\n cout << \"System is determined\" << endl;\r\n cout << \"=======================\" << endl;\r\n cout << \"=======================================\" << endl;\r\n cout << \"Process of creation and diagonalization\" << endl;\r\n cout << \"all parts of Hamiltonian has started\" << endl;\r\n cout << endl;\r\n\r\n \/\/begining of creation all part of Hammiltonian\r\n\r\n H.enter();\r\n H.dump();\r\n H.diagonalize();\r\n RealType beta = (*pIni)[\"Green Function:beta\"];\r\n RealType ProbabilityCutoff = RealType((*pIni)[\"system:ProbabilityCutoff\"]);\r\n if (ProbabilityCutoff>0 && ProbabilityCutoff < 1) H.reduce(-log(ProbabilityCutoff)\/beta);\r\n H.dump();\r\n\r\n num_cout << endl << \"The value of ground energy is \" << H.getGroundEnergy() << endl;\r\n\r\n \r\n DensityMatrix rho(S,H,beta);\r\n\/\/ DensityMatrix.reduce();\r\n rho.prepare();\r\n rho.compute();\r\n num_cout << \"<H> = \" << rho.getAverageEnergy() << endl;\r\n\r\n \r\n \/* for (QuantumState i=0; i < S.N_st(); ++i) \r\n cout << std::setw(20) << \"E:\" << H.eigenval(i) << \"\\t E-E0 \" << H.eigenval(i) - rho.getAverageEnergy() << \"\\t weight: \" << rho(i) << \" \" << exp(-beta*(H.eigenval(i) - H.getGroundEnergy()))\/1.000 << endl; \r\n *\/\r\n std::ofstream out;\r\n out.open(\"output\/Stat.En.dat\");\r\n out << iomanip_prefs << rho.getAverageEnergy() << endl;\r\n out.close();\r\n \r\n \r\n\r\n\r\n \/\/finishing of creation\r\n cout << endl;\r\n cout << \"All parts are created!\" << endl;\r\n cout << endl;\r\n\r\n FieldOperatorContainer Operators(S,H,IndexInfo);\r\n GFContainer G(S,H,rho,IndexInfo,Operators);\r\n G.prepare();\r\n G.compute();\r\n cout << std::setprecision(9) << G(0) << endl;\r\n cout << std::setprecision(9) << G(1) << endl;\r\n\r\n if ((*pIni)[\"System:calculate_2PGF\"]){\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Two Particle Green's function calculation\" << endl;\r\n cout << \"==========================================\" << endl;\r\n\r\n\r\n TwoParticleGFContainer::IndexCombination *comb1;\r\n std::vector<TwoParticleGFContainer::IndexCombination*> v1;\r\n\r\n comb1 = new TwoParticleGFContainer::IndexCombination(0,0,0,0);\r\n v1.push_back(comb1);\r\n\/\/\r\n TwoParticleGFContainer Chi4(S,H,rho,IndexInfo,Operators);\r\n Chi4.readNonTrivialIndices(v1);\r\n Chi4.prepare();\r\n Chi4.compute(30);\r\n\r\n for (unsigned short i=0;i<v1.size();i++){\r\n cout << std::setprecision(9) << Chi4(*v1[i],3,2,0) << endl;\r\n cout << Chi4(*v1[i],2,5,2) << endl;\r\n cout << Chi4(*v1[i],5,2,2) << endl;\r\n cout << Chi4(*v1[i],1,7,1) << endl;\r\n cout << Chi4(*v1[i],2,-2,4) << endl;\r\n cout << Chi4(*v1[i],29,-29,29) << endl << endl;\r\n cout << *v1[i] << \" : \" << (bool) Chi4.vanishes(*v1[i]) << endl;\r\n };\r\n \r\n \/\/ comb1 = new TwoParticleGFContainer::IndexCombination(0,2,0,1);\r\n \/\/ cout << Chi4.vanishes(*comb1) << endl;\r\n \/\/DEBUG(Chi4.getNumNonResonantTerms() << \" non-resonant terms\");\r\n \/\/DEBUG(Chi4.getNumResonantTerms() << \" resonant terms\"); \r\n };\r\n\r\n exit(0);\r\n int i = 1; \/\/(*pIni)[\"Green Function:i\"];\r\n int j = 1; \/\/(*pIni)[\"Green Function:j\"];\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Beginning of rotation of matrices C and CX\" << endl;\r\n CreationOperator CX(S,H,i);\r\n CX.prepare();\r\n CX.compute();\r\n \/\/CX.dump();\r\n \r\n AnnihilationOperator C(S,H,j);\r\n C.prepare();\r\n C.compute();\r\n \/\/C.dump();\r\n\r\n \/\/ DEBUG\r\n \/*std::list<BlockMapping> ind = CX.getNonTrivialIndices();\r\n\r\n std::list<std::pair<BlockNumber,BlockNumber> >::iterator it;\r\n for (it=ind.begin();it!=ind.end();it++)\r\n { cout << (*it).first << \",\" << (*it).second << \" = \" << CX.getLeftIndex((*it).second) << \",\" << CX.getRightIndex((*it).first) << endl;\r\n }\r\n*\/\r\n\r\n\/* cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Calculating G_{\" << i << j << \"}\" << endl;\r\n cout << \"==========================================\" << endl;\r\n GreensFunction G(S,H,C,CX,rho);\r\n G.prepare();\r\n cout << G.vanishes() << endl;\r\n G.compute();\r\n \r\n \/\/std::list<GreensFunctionPart::GreensTerm> terms = G.getTerms();\r\n \/\/for(std::list<GreensFunctionPart::GreensTerm>::iterator term = terms.begin(); term != terms.end(); term++)\r\n \/\/ DEBUG(*term)\r\n \r\n G.dumpMatsubara((int)(*pIni)[\"Green Function:points\"]);\r\n cout << endl << \"All done.\" << endl;\r\n\r\n cout << i << j << \": G.vanishes() = \" << G.vanishes() << endl;\r\n\r\n *\/\r\nreturn 0;\r\n};\r\n\/*\r\n \/\/begining of creation matrixes C and CX\r\n \r\n \/\/ parameters of Green Function\r\n \r\n \r\n if ((*pIni)[\"System:calculate_2PGF\"]){\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Two Particle Green's function calculation\" << endl;\r\n cout << \"==========================================\" << endl;\r\n\r\n AnnihilationOperator C1(S,H,OUT,i);\r\n C1.prepare();\r\n C1.compute();\r\n AnnihilationOperator C2(S,H,OUT,j);\r\n C2.prepare();\r\n C2.compute();\r\n CreationOperator CX3(S,H,OUT,i);\r\n CX3.prepare();\r\n CX3.compute();\r\n CreationOperator CX4(S,H,OUT,j);\r\n CX4.prepare();\r\n CX4.compute();\r\n\r\n TwoParticleGF CurrentChi4(S,H,C1,C2,CX3,CX4,rho);\r\n CurrentChi4.prepare();\r\n CurrentChi4.compute(30);\r\n \/\/Chi4.dump();\r\n\r\n cout << CurrentChi4(3,2,0) << endl;\r\n cout << CurrentChi4(2,5,2) << endl;\r\n cout << CurrentChi4(5,2,2) << endl;\r\n cout << CurrentChi4(1,7,1) << endl;\r\n cout << CurrentChi4(2,-2,4) << endl;\r\n cout << CurrentChi4(29,-29,29) << endl;\r\n \r\n \r\n\r\n \/\/Vertex4 Gamma4(Chi4,G,G,G,G);\r\n \/\/cout << Gamma4(0,2,0) << endl;\r\n }\r\n return 0;\r\n}\r\n*\/\r\n<commit_msg>Test line<commit_after>#define EIGEN2_SUPPORT\r\n\r\n#ifdef DMTruncate\r\n#define DENSITY_MATRIX_TRUNCATION_TOLERANCE 1e-3\r\n#define TERM_MATRIX_ELEMENT_TOLERANCE 1e-3\r\n#define TERM_RESONANCE_TOLERANCE 1e-16\r\n#endif\r\n\r\n#include \"config.h\"\r\n#include \"output.h\"\r\n#include \"LatticeAnalysis.h\"\r\n#include \"Term.h\"\r\n#include \"BitClassification.h\"\r\n#include \"StatesClassification.h\"\r\n#include \"HamiltonianPart.h\"\r\n#include \"Hamiltonian.h\"\r\n#include \"FieldOperatorPart.h\"\r\n#include \"FieldOperator.h\"\r\n#include \"GreensFunction.h\"\r\n#include \"GFContainer.h\"\r\n#include \"TwoParticleGF.h\"\r\n#include \"TwoParticleGFContainer.h\"\r\n#include \"Vertex4.h\"\r\n\r\n#include<fstream>\r\n#include \"iniconfig.h\"\r\n\r\nstring input = \"system.ini\";\r\n\r\nLatticeAnalysis Lattice;\r\nBitClassification IndexInfo(Lattice);\r\nStatesClassification S(IndexInfo); \r\noutput_handle OUT;\r\nHamiltonian H(IndexInfo,S,OUT,input);\r\n\r\nostream &OUTPUT_STREAM=std::cout;\r\n\r\nIniConfig* pIni;\r\n\r\nint main()\r\n{ \r\n \r\n cout << \"=======================\" << endl;\r\n cout << \"Lattice Info\" << endl;\r\n cout << \"=======================\" << endl;\r\n Lattice.readin();\r\n cout << Lattice.printSitesList().str() << flush;\r\n IndexInfo.prepare();\r\n cout << \"=======================\" << endl;\r\n cout << \"System Info\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printBitInfoList();\r\n cout << \"=======================\" << endl;\r\n cout << \"Hopping Matrix\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printHoppingMatrix();\r\n cout << \"=======================\" << endl;\r\n cout << \"Terms check\" << endl;\r\n cout << \"=======================\" << endl;\r\n IndexInfo.printTerms();\r\n \/\/determination of system\r\n \r\n pIni = new IniConfig(input);\r\n \r\n OUT = output_handle((*pIni)[\"output:path\"]);\r\n\r\n\r\n\r\n S.iniStatesClassification();\r\n\r\n \/\/end of determination \r\n \r\n cout << \"=======================\" << endl;\r\n cout << \"System is determined\" << endl;\r\n cout << \"=======================\" << endl;\r\n cout << \"=======================================\" << endl;\r\n cout << \"Process of creation and diagonalization\" << endl;\r\n cout << \"all parts of Hamiltonian has started\" << endl;\r\n cout << endl;\r\n\r\n \/\/begining of creation all part of Hammiltonian\r\n\r\n H.enter();\r\n H.dump();\r\n H.diagonalize();\r\n RealType beta = (*pIni)[\"Green Function:beta\"];\r\n RealType ProbabilityCutoff = RealType((*pIni)[\"system:ProbabilityCutoff\"]);\r\n if (ProbabilityCutoff>0 && ProbabilityCutoff < 1) H.reduce(-log(ProbabilityCutoff)\/beta);\r\n H.dump();\r\n\r\n num_cout << endl << \"The value of ground energy is \" << H.getGroundEnergy() << endl;\r\n\r\n \r\n DensityMatrix rho(S,H,beta);\r\n\/\/ DensityMatrix.reduce();\r\n rho.prepare();\r\n rho.compute();\r\n num_cout << \"<H> = \" << rho.getAverageEnergy() << endl;\r\n\r\n \r\n \/* for (QuantumState i=0; i < S.N_st(); ++i) \r\n cout << std::setw(20) << \"E:\" << H.eigenval(i) << \"\\t E-E0 \" << H.eigenval(i) - rho.getAverageEnergy() << \"\\t weight: \" << rho(i) << \" \" << exp(-beta*(H.eigenval(i) - H.getGroundEnergy()))\/1.000 << endl; \r\n *\/\r\n std::ofstream out;\r\n out.open(\"output\/Stat.En.dat\");\r\n out << iomanip_prefs << rho.getAverageEnergy() << endl;\r\n out.close();\r\n \r\n \r\n\r\n\r\n \/\/finishing of creation\r\n cout << endl;\r\n cout << \"All parts are created!\" << endl;\r\n cout << endl;\r\n\r\n FieldOperatorContainer Operators(S,H,IndexInfo);\r\n GFContainer G(S,H,rho,IndexInfo,Operators);\r\n G.prepare();\r\n G.compute();\r\n cout << std::setprecision(9) << G(0) << endl;\r\n cout << std::setprecision(9) << G(1) << endl;\r\n\r\n if ((*pIni)[\"System:calculate_2PGF\"]){\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Two Particle Green's function calculation\" << endl;\r\n cout << \"==========================================\" << endl;\r\n\r\n\r\n TwoParticleGFContainer::IndexCombination *comb1;\r\n std::vector<TwoParticleGFContainer::IndexCombination*> v1;\r\n\r\n comb1 = new TwoParticleGFContainer::IndexCombination(0,0,0,0);\r\n v1.push_back(comb1);\r\n comb1 = new TwoParticleGFContainer::IndexCombination(0,1,0,1);\r\n v1.push_back(comb1);\r\n\/\/\r\n TwoParticleGFContainer Chi4(S,H,rho,IndexInfo,Operators);\r\n Chi4.readNonTrivialIndices(v1);\r\n Chi4.prepare();\r\n Chi4.compute(30);\r\n\r\n for (unsigned short i=0;i<v1.size();i++){\r\n cout << std::setprecision(9) << Chi4(*v1[i],3,2,0) << endl;\r\n cout << Chi4(*v1[i],2,5,2) << endl;\r\n cout << Chi4(*v1[i],5,2,2) << endl;\r\n cout << Chi4(*v1[i],1,7,1) << endl;\r\n cout << Chi4(*v1[i],2,-2,4) << endl;\r\n cout << Chi4(*v1[i],29,-29,29) << endl << endl;\r\n cout << *v1[i] << \" : \" << (bool) Chi4.vanishes(*v1[i]) << endl;\r\n };\r\n \r\n \/\/ comb1 = new TwoParticleGFContainer::IndexCombination(0,2,0,1);\r\n \/\/ cout << Chi4.vanishes(*comb1) << endl;\r\n \/\/DEBUG(Chi4.getNumNonResonantTerms() << \" non-resonant terms\");\r\n \/\/DEBUG(Chi4.getNumResonantTerms() << \" resonant terms\"); \r\n };\r\n\r\n exit(0);\r\n int i = 1; \/\/(*pIni)[\"Green Function:i\"];\r\n int j = 1; \/\/(*pIni)[\"Green Function:j\"];\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Beginning of rotation of matrices C and CX\" << endl;\r\n CreationOperator CX(S,H,i);\r\n CX.prepare();\r\n CX.compute();\r\n \/\/CX.dump();\r\n \r\n AnnihilationOperator C(S,H,j);\r\n C.prepare();\r\n C.compute();\r\n \/\/C.dump();\r\n\r\n \/\/ DEBUG\r\n \/*std::list<BlockMapping> ind = CX.getNonTrivialIndices();\r\n\r\n std::list<std::pair<BlockNumber,BlockNumber> >::iterator it;\r\n for (it=ind.begin();it!=ind.end();it++)\r\n { cout << (*it).first << \",\" << (*it).second << \" = \" << CX.getLeftIndex((*it).second) << \",\" << CX.getRightIndex((*it).first) << endl;\r\n }\r\n*\/\r\n\r\n\/* cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Calculating G_{\" << i << j << \"}\" << endl;\r\n cout << \"==========================================\" << endl;\r\n GreensFunction G(S,H,C,CX,rho);\r\n G.prepare();\r\n cout << G.vanishes() << endl;\r\n G.compute();\r\n \r\n \/\/std::list<GreensFunctionPart::GreensTerm> terms = G.getTerms();\r\n \/\/for(std::list<GreensFunctionPart::GreensTerm>::iterator term = terms.begin(); term != terms.end(); term++)\r\n \/\/ DEBUG(*term)\r\n \r\n G.dumpMatsubara((int)(*pIni)[\"Green Function:points\"]);\r\n cout << endl << \"All done.\" << endl;\r\n\r\n cout << i << j << \": G.vanishes() = \" << G.vanishes() << endl;\r\n\r\n *\/\r\nreturn 0;\r\n};\r\n\/*\r\n \/\/begining of creation matrixes C and CX\r\n \r\n \/\/ parameters of Green Function\r\n \r\n \r\n if ((*pIni)[\"System:calculate_2PGF\"]){\r\n cout << endl;\r\n cout << \"==========================================\" << endl;\r\n cout << \"Two Particle Green's function calculation\" << endl;\r\n cout << \"==========================================\" << endl;\r\n\r\n AnnihilationOperator C1(S,H,OUT,i);\r\n C1.prepare();\r\n C1.compute();\r\n AnnihilationOperator C2(S,H,OUT,j);\r\n C2.prepare();\r\n C2.compute();\r\n CreationOperator CX3(S,H,OUT,i);\r\n CX3.prepare();\r\n CX3.compute();\r\n CreationOperator CX4(S,H,OUT,j);\r\n CX4.prepare();\r\n CX4.compute();\r\n\r\n TwoParticleGF CurrentChi4(S,H,C1,C2,CX3,CX4,rho);\r\n CurrentChi4.prepare();\r\n CurrentChi4.compute(30);\r\n \/\/Chi4.dump();\r\n\r\n cout << CurrentChi4(3,2,0) << endl;\r\n cout << CurrentChi4(2,5,2) << endl;\r\n cout << CurrentChi4(5,2,2) << endl;\r\n cout << CurrentChi4(1,7,1) << endl;\r\n cout << CurrentChi4(2,-2,4) << endl;\r\n cout << CurrentChi4(29,-29,29) << endl;\r\n \r\n \r\n\r\n \/\/Vertex4 Gamma4(Chi4,G,G,G,G);\r\n \/\/cout << Gamma4(0,2,0) << endl;\r\n }\r\n return 0;\r\n}\r\n*\/\r\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n\/\/using namespace std;\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\t\n\n\twhile (!killrshell)\n\t{\n\n\t\t\/\/string will store raw user input\n\t\tstd::string rawinput;\n\t\t\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tstd::getline(std::cin, rawinput);\n\n\t\t\n\t\t\/\/TODO: Parse raw input string for commands and connectors\n\n\t\t\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\t\/\/temporary input handling -- if exit was not entered, output the input.\n\t\tprintf(\"\\\"%s\\\" was entered.\\n\", rawinput.c_str());\n\t\t\n\n\t}\n\n\treturn 0;\n} \n<commit_msg>added removal of comments from raw input<commit_after>#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <string>\n\/\/using namespace std;\n\nint main (int argc, char **argv)\n{\n\n\t\/\/bool value use to determine when to kill rshell loop\n\tbool killrshell = false; \n\t\n\n\twhile (!killrshell)\n\t{\n\n\t\t\/\/string will store raw user input\n\t\tstd::string rawinput;\n\t\t\n\t\n\t\t\/\/simple command prompt print\n\t\tprintf(\"%s\", \"$ \");\n\n\t\t\/\/obtain user input commands\n\t\tstd::getline(std::cin, rawinput);\n\n\t\t\/\/temporary break loop condition: user inputs 'exit' \n\t\tif (rawinput.substr(0,4) == \"exit\") \n\t\t{\n\t\t\tkillrshell = true;\n\t\t\tbreak;\n\t\t}\n\n\t\t\/\/parse through raw input and remove comments if entered\n\t\tif (rawinput.find('#') != std::string::npos) rawinput = rawinput.substr(0, rawinput.find('#'));\n\t\n\t\t\n\t\t\/\/TODO: Parse raw input string for commands and connectors\n\n\t\t\n\t\n\t\t\/\/temporary input handling -- if exit was not entered, output the input.\n\t\tprintf(\"\\\"%s\\\" was entered.\\n\", rawinput.c_str());\n\t\t\n\n\t}\n\n\treturn 0;\n} \n<|endoftext|>"} {"text":"<commit_before>#include \"common.h\"\n\nint main(int argc, const char *argv[])\n{\n \/\/ read EOS table\n \/\/ read abundances\n \/\/ browse EOS table and compute rates\n\n int entries = 0;\n\n \/\/ Read nuclear data (masses)\n entries = read_nuclear_data(\"data\/mass.mas12\");\n std::cout << \"Read \" << entries << \" nuclear data entries\\n\";\n\n \/\/ Read abundance data\n entries = read_abundance_data(\"data\/EOS.compo\", \"data\/EOS.t\", \"data\/EOS.nb\", \"data\/EOS.yq\");\n std::cout << \"Read \" << entries << \" nuclear abundance data entries\\n\";\n\n \/\/ Read EOS data\n EOS_table table;\n int error;\n read_EOS_table(\"data\/elec_capt_rate_ls220.h5\", table, &error);\n write_EOS_table(\"output\/table.h5\", table, &error);\n\n entries = table.size();\n std::cout << \"Read \" << entries << \" EOS entries\\n\";\n table.dump();\n\n \/\/ Perform calculations\n\n int processed = 0;\n \/\/ poor man's multithreading\n #pragma omp parallel for\n for(int m = 0; m < table.m_ln_rho; ++m)\n for(int n = 0; n < table.n_ln_t; ++n)\n for(int o = 0; o < table.o_y_e; ++o)\n for(int p = 0; p < table.p_mu; ++p)\n {\n int i = m*(table.n_ln_t*table.o_y_e*table.p_mu) + n*(table.o_y_e*table.p_mu) + o*table.p_mu + p;\n const double nb = exp(table.ln_rho_eos[m]), T = exp(table.ln_t_eos[n]), Y_e = table.y_e_eos[o], mu_nu = table.mu_nu_eos[p], ec_tab = table.elec_rate_tab_eos[i];\n \/\/if(nb >= 0.1) continue;\n double conditions[3] = {T, nb, Y_e};\n\n double mu_e = electron_potential(nb, Y_e), eps_mu = average_neutrino_energy(T, mu_nu);\n\n\n double rate = 0;\n double total_abundance = 0;\n table.scattering_xs_eos[i] = 0;\n std::vector<element> elements;\n get_abundances(conditions, elements);\n table.elec_rate_tab_eos[i] = table.scattering_xs_eos[i] = 0;\n\n for(int j = 0; j < elements.size(); ++j)\n\t{\n int A = elements[j].A, Z = elements[j].Z;\n\t double abundance = elements[j].abundance;\n total_abundance += abundance;\n if(A < 2 || Z < 2) continue;\n \n\t if(abundance > 1e-30)\n {\n printf(\"%e (%e %e %e %e)\\n\", abundance, elements[j].v[0], elements[j].v[1], elements[j].v[2], elements[j].v[3]);\n table.elec_rate_tab_eos[i] += abundance * electron_capture_fit(A, Z, T, mu_e);\n table.scattering_xs_eos[i] += abundance * nucleus_scattering_cross_section(A, Z, eps_mu, abundance*nb);\n }\n\t}\n\n if(elements.size()) \/\/printf(\"total=%f %d\\n\", total_abundance, elements.size());\n if(total_abundance > 1e-15 && nb > 1e-4 && nb < 1e-2) printf(\"%d %d %e %e %e %e %e %e %e %e\\n\", i, elements.size(), T, nb, Y_e, mu_nu, ec_tab, table.elec_rate_tab_eos[i], table.scattering_xs_eos[i]*1e36, total_abundance);\n ++processed;\n \/\/if(processed % 1000 == 0) std::cout << \"Processed \" << processed << \" states out of \" << table.size() << std::endl;\n \n }\n\n write_EOS_table(\"output\/table.h5\", table, &error);\n\n return 0;\n}\n<commit_msg>cleanups<commit_after>#include \"common.h\"\n\nint main(int argc, const char *argv[])\n{\n \/\/ read EOS table\n \/\/ read abundances\n \/\/ browse EOS table and compute rates\n\n int entries = 0;\n\n \/\/ Read nuclear data (masses)\n entries = read_nuclear_data(\"data\/mass.mas12\");\n std::cout << \"Read \" << entries << \" nuclear data entries\\n\";\n\n \/\/ Read abundance data\n entries = read_abundance_data(\"data\/EOS.compo\", \"data\/EOS.t\", \"data\/EOS.nb\", \"data\/EOS.yq\");\n std::cout << \"Read \" << entries << \" nuclear abundance data entries\\n\";\n\n \/\/ Read EOS data\n EOS_table table;\n int error;\n read_EOS_table(\"data\/elec_capt_rate_ls220.h5\", table, &error);\n write_EOS_table(\"output\/table.h5\", table, &error);\n\n entries = table.size();\n std::cout << \"Read \" << entries << \" EOS entries\\n\";\n table.dump();\n\n \/\/ Perform calculations\n\n int processed = 0;\n \/\/ poor man's multithreading\n #pragma omp parallel for\n for(int m = 0; m < table.m_ln_rho; ++m)\n for(int n = 0; n < table.n_ln_t; ++n)\n for(int o = 0; o < table.o_y_e; ++o)\n for(int p = 0; p < table.p_mu; ++p)\n {\n int i = m*(table.n_ln_t*table.o_y_e*table.p_mu) + n*(table.o_y_e*table.p_mu) + o*table.p_mu + p;\n const double nb = exp(table.ln_rho_eos[m]), T = exp(table.ln_t_eos[n]), Y_e = table.y_e_eos[o], mu_nu = table.mu_nu_eos[p], ec_tab = table.elec_rate_tab_eos[i];\n \/\/if(nb >= 0.1) continue;\n double conditions[3] = {T, nb, Y_e};\n\n double mu_e = electron_potential(nb, Y_e), eps_mu = average_neutrino_energy(T, mu_nu);\n\n\n double rate = 0;\n double total_abundance = 0;\n table.scattering_xs_eos[i] = 0;\n std::vector<element> elements;\n get_abundances(conditions, elements);\n table.elec_rate_tab_eos[i] = table.scattering_xs_eos[i] = 0;\n\n for(int j = 0; j < elements.size(); ++j)\n\t{\n int A = elements[j].A, Z = elements[j].Z;\n\t double abundance = elements[j].abundance;\n total_abundance += abundance;\n if(A < 2 || Z < 2) continue;\n \n\t if(abundance > 1e-30)\n {\n \/\/printf(\"%e (%e %e %e %e)\\n\", abundance, elements[j].v[0], elements[j].v[1], elements[j].v[2], elements[j].v[3]);\n table.elec_rate_tab_eos[i] += abundance * electron_capture_fit(A, Z, T, mu_e);\n table.scattering_xs_eos[i] += abundance * nucleus_scattering_cross_section(A, Z, eps_mu, abundance*nb);\n }\n\t}\n\n \/\/if(total_abundance > 1e-15 && nb > 1e-4 && nb < 1e-2) printf(\"%d %d %e %e %e %e %e %e %e %e\\n\", i, elements.size(), T, nb, Y_e, mu_nu, ec_tab, table.elec_rate_tab_eos[i], table.scattering_xs_eos[i]*1e36, total_abundance);\n ++processed;\n if(processed % 10000 == 0) std::cout << \"Processed \" << processed << \" states out of \" << table.size() << std::endl;\n \n }\n\n write_EOS_table(\"output\/table.h5\", table, &error);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <thread>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/driver.h\"\n#include \"gfx\/camera.h\"\n#include \"gfx\/object.h\"\n#include \"gfx\/scene_node.h\"\n#include \"gfx\/idriver_ui_adapter.h\"\n\n#include \"common\/software_texture.h\"\n#include \"common\/texture_load.h\"\n#include \"common\/software_mesh.h\"\n#include \"common\/mesh_load.h\"\n\n#include \"ui\/load.h\"\n#include \"ui\/freetype_renderer.h\"\n#include \"ui\/mouse_logic.h\"\n#include \"ui\/simple_controller.h\"\n\n#include \"map\/map.h\"\n#include \"map\/json_structure.h\"\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#define GLM_FORCE_RADIANS\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\ngame::ui::Mouse_State gen_mouse_state(GLFWwindow* w)\n{\n game::ui::Mouse_State ret;\n\n ret.button_down =glfwGetMouseButton(w, GLFW_MOUSE_BUTTON_LEFT) == GLFW_PRESS;\n\n game::Vec<double> pos;\n glfwGetCursorPos(w, &pos.x, &pos.y);\n ret.position = game::vec_cast<int>(pos);\n\n return ret;\n}\n\nvoid log_gl_limits(game::Log_Severity s) noexcept\n{\n GLint i = 0;\n glGetIntegerv(GL_MAX_ELEMENTS_VERTICES, &i);\n log(s, \"GL_MAX_ELEMENTS_VERTICES: %\", i);\n}\n\nstruct Command_Options\n{\n};\n\nCommand_Options parse_command_line(int argc, char**)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n \/\/auto option = argv[i];\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace game;\n\n set_log_level(Log_Severity::Debug);\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n {\n \/\/ Make an OpenGL driver.\n gfx::gl::Driver driver{Vec<int>{1000, 1000}};\n\n \/\/ Make an isometric camera.\n auto cam = gfx::make_isometric_camera();\n use_camera(driver, cam);\n\n \/\/ Build our main mesh using our flat terrain.\n auto terrain_obj = gfx::Object{};\n make_terrain_mesh(*terrain_obj.mesh, make_flat_terrain(0, 25, 25), .01, 1);\n\n terrain_obj.material->diffuse_color = colors::white;\n\n load_png(\"tex\/grass.png\", *terrain_obj.material->texture);\n\n terrain_obj.model_matrix = glm::translate(glm::mat4(1.0),\n glm::vec3(-12.5, 0.0, -12.5));\n\n prepare_object(driver, terrain_obj);\n\n \/\/ Load our house structure\n auto house_struct = Json_Structure{\"structure\/house.json\"};\n\n \/\/ This is code smell, right here. The fact that before, we were preparing\n \/\/ a temporary but it still worked because of the implementation of\n \/\/ Json_Structure and the object sharing mechanism.\n auto house_obj = house_struct.make_obj();\n prepare_object(driver, house_obj);\n\n std::vector<Structure_Instance> house_instances;\n Structure_Instance moveable_instance{house_struct, Orient::N};\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n driver.clear_color_value(Color{0x55, 0x66, 0x77});\n driver.clear_depth_value(1.0);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Our quick hack to avoid splitting into multiple functions and dealing\n \/\/ either with global variables or like a bound struct or something.\n bool has_clicked_down = false;\n\n \/\/ Load our ui\n gfx::IDriver_UI_Adapter ui_adapter{driver};\n ui::Freetype_Renderer freetype_font;\n\n auto ui_load_params = ui::Load_Params{freetype_font, ui_adapter};\n auto hud = ui::load(\"ui\/hud.json\", ui_load_params);\n\n auto controller = ui::Simple_Controller{};\n\n hud->find_child_r(\"build_button\")->add_click_listener([](auto const& pt)\n {\n log_i(\"BUILD!\");\n });\n\n hud->layout(driver.window_extents());\n\n controller.add_click_listener([&](auto const&)\n {\n \/\/ Commit the current position of our moveable instance.\n house_instances.push_back(moveable_instance);\n });\n controller.add_hover_listener([&](auto const& pt)\n {\n if(pt.x < 0 || pt.x > 1000.0 || pt.y < 0 || pt.y > 1000.0)\n {\n moveable_instance.obj.model_matrix = glm::mat4(1.0);\n }\n else\n {\n \/\/ Find our depth.\n GLfloat z;\n glReadPixels((float) pt.x, (float) 1000.0 - pt.y, 1, 1,\n GL_DEPTH_COMPONENT, GL_FLOAT, &z);\n\n \/\/ Unproject our depth.\n auto val = glm::unProject(glm::vec3(pt.x, 1000.0 - pt.y, z),\n camera_view_matrix(cam),\n camera_proj_matrix(cam),\n glm::vec4(0.0, 0.0, 1000.0, 1000.0));\n\n \/\/ We have our position, render a single house there.\n moveable_instance.obj.model_matrix = glm::translate(glm::mat4(1.0), val);\n }\n \/\/ Move the house by however much the structure *type* requires.\n moveable_instance.obj.model_matrix = moveable_instance.obj.model_matrix *\n house_struct.make_obj().model_matrix;\n });\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n glfwPollEvents();\n\n \/\/ Clear the screen and render the terrain.\n driver.clear();\n render_object(driver, terrain_obj);\n\n \/\/ Render the terrain before we calculate the depth of the mouse position.\n auto mouse_state = gen_mouse_state(window);\n controller.step(hud, mouse_state);\n\n \/\/ Render our movable instance of a house.\n render_object(driver, moveable_instance.obj);\n\n \/\/ Render all of our other house instances.\n for(auto const& instance : house_instances)\n {\n render_object(driver, instance.obj);\n }\n\n {\n ui::Draw_Scoped_Lock scoped_draw_lock{ui_adapter};\n hud->render(ui_adapter);\n }\n glfwSwapBuffers(window);\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n\n flush_log();\n }\n }\n glfwTerminate();\n return 0;\n}\n<commit_msg>Load our terrain!<commit_after>\/*\n * Copyright (C) 2015 Luke San Antonio\n * All rights reserved.\n *\/\n#include <fstream>\n#include <sstream>\n#include <cstdlib>\n#include <vector>\n#include <thread>\n\n#include \"common\/log.h\"\n\n#include \"gfx\/gl\/driver.h\"\n#include \"gfx\/camera.h\"\n#include \"gfx\/object.h\"\n#include \"gfx\/scene_node.h\"\n#include \"gfx\/idriver_ui_adapter.h\"\n\n#include \"common\/software_texture.h\"\n#include \"common\/texture_load.h\"\n#include \"common\/software_mesh.h\"\n#include \"common\/mesh_load.h\"\n\n#include \"ui\/load.h\"\n#include \"ui\/freetype_renderer.h\"\n#include \"ui\/mouse_logic.h\"\n#include \"ui\/simple_controller.h\"\n\n#include \"map\/map.h\"\n#include \"map\/json_structure.h\"\n#include \"glad\/glad.h\"\n#include \"glfw3.h\"\n\n#define GLM_FORCE_RADIANS\n#include \"glm\/glm.hpp\"\n#include \"glm\/gtc\/matrix_transform.hpp\"\n\n#include \"uv.h\"\n\n#define CATCH_CONFIG_RUNNER\n#include \"catch\/catch.hpp\"\n\ngame::ui::Mouse_State gen_mouse_state(GLFWwindow* w)\n{\n game::ui::Mouse_State ret;\n\n ret.button_down =glfwGetMouseButton(w, GLFW_MOUSE_BUTTON_LEFT) == GLFW_PRESS;\n\n game::Vec<double> pos;\n glfwGetCursorPos(w, &pos.x, &pos.y);\n ret.position = game::vec_cast<int>(pos);\n\n return ret;\n}\n\nvoid log_gl_limits(game::Log_Severity s) noexcept\n{\n GLint i = 0;\n glGetIntegerv(GL_MAX_ELEMENTS_VERTICES, &i);\n log(s, \"GL_MAX_ELEMENTS_VERTICES: %\", i);\n}\n\nstruct Command_Options\n{\n};\n\nCommand_Options parse_command_line(int argc, char**)\n{\n Command_Options opt;\n for(int i = 0; i < argc; ++i)\n {\n \/\/auto option = argv[i];\n }\n return opt;\n}\n\nint main(int argc, char** argv)\n{\n using namespace game;\n\n set_log_level(Log_Severity::Debug);\n\n uv_chdir(\"assets\/\");\n\n \/\/ Initialize logger.\n Scoped_Log_Init log_init_raii_lock{};\n\n \/\/ Parse command line arguments.\n auto options = parse_command_line(argc - 1, argv+1);\n\n \/\/ Init glfw.\n if(!glfwInit())\n return EXIT_FAILURE;\n\n auto window = glfwCreateWindow(1000, 1000, \"Hello World\", NULL, NULL);\n if(!window)\n {\n glfwTerminate();\n return EXIT_FAILURE;\n }\n\n \/\/ Init context + load gl functions.\n glfwMakeContextCurrent(window);\n gladLoadGLLoader((GLADloadproc) glfwGetProcAddress);\n\n \/\/ Log glfw version.\n log_i(\"Initialized GLFW %\", glfwGetVersionString());\n\n int maj = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MAJOR);\n int min = glfwGetWindowAttrib(window, GLFW_CONTEXT_VERSION_MINOR);\n int rev = glfwGetWindowAttrib(window, GLFW_CONTEXT_REVISION);\n\n \/\/ Log GL profile.\n log_i(\"OpenGL core profile %.%.%\", maj, min, rev);\n\n {\n \/\/ Make an OpenGL driver.\n gfx::gl::Driver driver{Vec<int>{1000, 1000}};\n\n \/\/ Make an isometric camera.\n auto cam = gfx::make_isometric_camera();\n use_camera(driver, cam);\n\n \/\/ Build our main mesh using our flat terrain.\n auto terrain_obj = gfx::load_object(\"obj\/terrain.obj\", \"mat\/terrain.json\");\n\n terrain_obj.model_matrix = glm::scale(glm::mat4(1.0f),\n glm::vec3(4.0f, 2.0f, 4.0f));\n\n prepare_object(driver, terrain_obj);\n\n \/\/ Load our house structure\n auto house_struct = Json_Structure{\"structure\/house.json\"};\n\n \/\/ This is code smell, right here. The fact that before, we were preparing\n \/\/ a temporary but it still worked because of the implementation of\n \/\/ Json_Structure and the object sharing mechanism.\n auto house_obj = house_struct.make_obj();\n prepare_object(driver, house_obj);\n\n std::vector<Structure_Instance> house_instances;\n Structure_Instance moveable_instance{house_struct, Orient::N};\n\n int fps = 0;\n int time = glfwGetTime();\n\n \/\/ Set up some pre-rendering state.\n driver.clear_color_value(Color{0x55, 0x66, 0x77});\n driver.clear_depth_value(1.0);\n\n glEnable(GL_DEPTH_TEST);\n glDepthFunc(GL_LEQUAL);\n\n \/\/ Our quick hack to avoid splitting into multiple functions and dealing\n \/\/ either with global variables or like a bound struct or something.\n bool has_clicked_down = false;\n\n \/\/ Load our ui\n gfx::IDriver_UI_Adapter ui_adapter{driver};\n ui::Freetype_Renderer freetype_font;\n\n auto ui_load_params = ui::Load_Params{freetype_font, ui_adapter};\n auto hud = ui::load(\"ui\/hud.json\", ui_load_params);\n\n auto controller = ui::Simple_Controller{};\n\n hud->find_child_r(\"build_button\")->add_click_listener([](auto const& pt)\n {\n log_i(\"BUILD!\");\n });\n\n hud->layout(driver.window_extents());\n\n controller.add_click_listener([&](auto const&)\n {\n \/\/ Commit the current position of our moveable instance.\n house_instances.push_back(moveable_instance);\n });\n controller.add_hover_listener([&](auto const& pt)\n {\n if(pt.x < 0 || pt.x > 1000.0 || pt.y < 0 || pt.y > 1000.0)\n {\n moveable_instance.obj.model_matrix = glm::mat4(1.0);\n }\n else\n {\n \/\/ Find our depth.\n GLfloat z;\n glReadPixels((float) pt.x, (float) 1000.0 - pt.y, 1, 1,\n GL_DEPTH_COMPONENT, GL_FLOAT, &z);\n\n \/\/ Unproject our depth.\n auto val = glm::unProject(glm::vec3(pt.x, 1000.0 - pt.y, z),\n camera_view_matrix(cam),\n camera_proj_matrix(cam),\n glm::vec4(0.0, 0.0, 1000.0, 1000.0));\n\n \/\/ We have our position, render a single house there.\n moveable_instance.obj.model_matrix = glm::translate(glm::mat4(1.0), val);\n }\n \/\/ Move the house by however much the structure *type* requires.\n moveable_instance.obj.model_matrix = moveable_instance.obj.model_matrix *\n house_struct.make_obj().model_matrix;\n });\n while(!glfwWindowShouldClose(window))\n {\n ++fps;\n glfwPollEvents();\n\n \/\/ Clear the screen and render the terrain.\n driver.clear();\n render_object(driver, terrain_obj);\n\n \/\/ Render the terrain before we calculate the depth of the mouse position.\n auto mouse_state = gen_mouse_state(window);\n controller.step(hud, mouse_state);\n\n \/\/ Render our movable instance of a house.\n render_object(driver, moveable_instance.obj);\n\n \/\/ Render all of our other house instances.\n for(auto const& instance : house_instances)\n {\n render_object(driver, instance.obj);\n }\n\n {\n ui::Draw_Scoped_Lock scoped_draw_lock{ui_adapter};\n hud->render(ui_adapter);\n }\n glfwSwapBuffers(window);\n\n if(int(glfwGetTime()) != time)\n {\n time = glfwGetTime();\n log_d(\"fps: %\", fps);\n fps = 0;\n }\n\n flush_log();\n }\n }\n glfwTerminate();\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <iterator>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/indexing_suite.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n#include \"sdd\/sdd.hh\"\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nnamespace sdd { namespace python {\n\nusing namespace boost::python;\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct py_values\n{\n object py;\n\n py_values()\n : py() \/\/ default to None\n {}\n\n py_values(object p)\n\t\t: py(p)\n {}\n\n py_values(const py_values& v)\n\t\t: py(v.py)\n {}\n\n py_values&\n operator=(const py_values& v)\n {\n py = v.py;\n return *this;\n }\n\n object\n content()\n const noexcept\n {\n return py;\n }\n\n bool\n operator==(const py_values& rhs)\n const\n {\n return call_method<bool>(py.ptr(), \"__eq__\", rhs.py);\n }\n\n bool\n operator<(const py_values& rhs)\n const\n {\n if (rhs.empty())\n {\n return false;\n }\n else if (this->empty())\n {\n return true;\n }\n else\n {\n return call_method<bool>(py.ptr(), \"__lt__\", rhs.py);\n }\n }\n\n std::size_t\n hash()\n const\n {\n return empty()\n ? std::hash<int>()(0)\n : static_cast<std::size_t>(call_method<long>(py.ptr() , \"__hash__\" ));\n }\n\n std::string\n name()\n const\n {\n return call_method<std::string>(py.ptr(), \"__str__\" );\n }\n\n bool\n empty()\n const\n {\n return size() == 0;\n }\n\n std::size_t\n size()\n const\n {\n return py.is_none() ? 0 : call_method<std::size_t>(py.ptr(), \"__len__\" );\n }\n};\n\nstd::ostream&\noperator<<(std::ostream& os, const py_values& v)\n{\n return os << v.name();\n}\n\npy_values\nsum(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__or__\", rhs.py));\n }\n else\n {\n return lhs;\n }\n }\n else\n {\n return rhs;\n }\n}\n\npy_values\ndifference(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__sub__\", rhs.py));\n }\n else\n {\n return lhs;\n }\n }\n else\n {\n return lhs;\n }\n}\n\npy_values\nintersection(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__and__\", rhs.py));\n }\n else\n {\n return rhs;\n }\n }\n else\n {\n return lhs;\n }\n}\n\n} \/\/ namespace python\n\nnamespace values {\n\n template <>\n struct values_traits<python::py_values>\n {\n static constexpr bool stateful = false;\n static constexpr bool fast_iterable = false;\n static constexpr bool has_value_type = false;\n };\n\n} \/\/ namespace values\n\nnamespace python {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct pyconf\n : public sdd::conf1\n{\n using Variable = int;\n using Identifier = std::string;\n using Values = py_values;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ndouble\ncount_combinations(SDD<pyconf> s)\n{\n return sdd::count_combinations(s).template convert_to<double>();\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct _manager\n{\n std::shared_ptr<manager<pyconf>> ptr;\n\n _manager()\n : ptr(new manager<pyconf>(manager<pyconf>::init()))\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ninline\nobject\npass_through(object const& o)\n{\n return o;\n}\n\nstruct paths\n{\n path_generator<pyconf> gen;\n\n paths(const SDD<pyconf>& s)\n noexcept\n : gen(s.paths())\n {\n std::cout << \"paths::paths()\" << std::endl;\n }\n\n static\n path<pyconf>\n next(paths& p)\n {\n if (p.gen)\n {\n const path<pyconf> res = p.gen.get();\n p.gen(); \/\/ compute next path\n return res;\n }\n else\n {\n PyErr_SetString(PyExc_StopIteration, \"No more paths.\");\n boost::python::throw_error_already_set();\n const path<pyconf>* dummy = nullptr;\n return *dummy;\n }\n }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct py_visitor\n{\n using result_type = object;\n\n object py;\n\n py_visitor(object p)\n : py(p)\n {}\n\n object\n operator()(const hierarchical_node<pyconf>& node)\n const\n {\n return py.attr(\"hierarchical\")(boost::cref(node));\n }\n\n object\n operator()(const flat_node<pyconf>& node)\n const\n {\n return py.attr(\"flat\")(boost::cref(node));\n }\n\n object\n operator()(const one_terminal<pyconf>&)\n const\n {\n return py.attr(\"one\")();\n }\n\n object\n operator()(const zero_terminal<pyconf>&)\n const\n {\n return py.attr(\"zero\")();\n }\n};\n\nobject\npy_visit(object visitor, const SDD<pyconf>& s)\n{\n return visit(py_visitor {visitor}, s);\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\n\nBOOST_PYTHON_MODULE(_sdd)\n{\n using sdd_type = SDD<pyconf>;\n using hierarchical = hierarchical_node<pyconf>;\n using flat = flat_node<pyconf>;\n\n class_<_manager, boost::noncopyable>(\"_manager\");\n\n class_<arc<pyconf, sdd_type>, boost::noncopyable>(\"HierarchicalArc\", no_init)\n .def(\"valuation\", &arc<pyconf, sdd_type>::valuation, return_internal_reference<>())\n .def(\"successor\", &arc<pyconf, sdd_type>::successor)\n ;\n\n class_<hierarchical, boost::noncopyable>(\"HierarchicalNode\", no_init)\n .def(\"variable\", &hierarchical::variable)\n .def(\"__iter__\", range<return_internal_reference<>>(&hierarchical::begin, &hierarchical::end))\n ;\n\n class_<arc<pyconf, py_values>, boost::noncopyable>(\"FlatArc\", no_init)\n .def(\"valuation\", &arc<pyconf, py_values>::valuation, return_internal_reference<>())\n .def(\"successor\", &arc<pyconf, py_values>::successor)\n ;\n\n class_<flat, boost::noncopyable>(\"FlatNode\", no_init)\n .def(\"variable\", &flat::variable)\n .def(\"__iter__\", range<return_internal_reference<>>(&flat::begin, &flat::end))\n ;\n\n class_<sdd_type>(\"SDD\", init<int, object, sdd_type>())\n .def(init<int, sdd_type, sdd_type>())\n .def(self_ns::str(self))\n .def(self + self)\n .def(self - self)\n .def(self & self)\n .def(self == self)\n .def(self < self)\n .def(\"__hash__\", &sdd_type::hash)\n ;\n\n def(\"zero\", &zero<pyconf>);\n def(\"one\", &one<pyconf>);\n\n def(\"count_combinations\", &count_combinations);\n\n def(\"visit\", &py_visit);\n\n class_<path<pyconf>>(\"Path\", no_init)\n .def(vector_indexing_suite<path<pyconf>>())\n ;\n\n class_<paths, boost::noncopyable>(\"Paths\", init<SDD<pyconf>>())\n .def(\"__iter__\", &pass_through)\n .def(\"next\", &paths::next)\n ;\n\n class_<py_values>(\"PyValues\", no_init)\n .def(\"content\", &py_values::content)\n ;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::python\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate <>\nstruct hash<sdd::python::py_values>\n{\n std::size_t\n operator()(const sdd::python::py_values& val)\n const\n {\n return val.hash();\n }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n<commit_msg>Remove debug output...<commit_after>#include <iostream>\n#include <iterator>\n#include <memory>\n#include <sstream>\n#include <string>\n\n#include <boost\/python.hpp>\n#include <boost\/python\/suite\/indexing\/indexing_suite.hpp>\n#include <boost\/python\/suite\/indexing\/vector_indexing_suite.hpp>\n\n#include \"sdd\/sdd.hh\"\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nnamespace sdd { namespace python {\n\nusing namespace boost::python;\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct py_values\n{\n object py;\n\n py_values()\n : py() \/\/ default to None\n {}\n\n py_values(object p)\n\t\t: py(p)\n {}\n\n py_values(const py_values& v)\n\t\t: py(v.py)\n {}\n\n py_values&\n operator=(const py_values& v)\n {\n py = v.py;\n return *this;\n }\n\n object\n content()\n const noexcept\n {\n return py;\n }\n\n bool\n operator==(const py_values& rhs)\n const\n {\n return call_method<bool>(py.ptr(), \"__eq__\", rhs.py);\n }\n\n bool\n operator<(const py_values& rhs)\n const\n {\n if (rhs.empty())\n {\n return false;\n }\n else if (this->empty())\n {\n return true;\n }\n else\n {\n return call_method<bool>(py.ptr(), \"__lt__\", rhs.py);\n }\n }\n\n std::size_t\n hash()\n const\n {\n return empty()\n ? std::hash<int>()(0)\n : static_cast<std::size_t>(call_method<long>(py.ptr() , \"__hash__\" ));\n }\n\n std::string\n name()\n const\n {\n return call_method<std::string>(py.ptr(), \"__str__\" );\n }\n\n bool\n empty()\n const\n {\n return size() == 0;\n }\n\n std::size_t\n size()\n const\n {\n return py.is_none() ? 0 : call_method<std::size_t>(py.ptr(), \"__len__\" );\n }\n};\n\nstd::ostream&\noperator<<(std::ostream& os, const py_values& v)\n{\n return os << v.name();\n}\n\npy_values\nsum(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__or__\", rhs.py));\n }\n else\n {\n return lhs;\n }\n }\n else\n {\n return rhs;\n }\n}\n\npy_values\ndifference(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__sub__\", rhs.py));\n }\n else\n {\n return lhs;\n }\n }\n else\n {\n return lhs;\n }\n}\n\npy_values\nintersection(const py_values& lhs, const py_values& rhs)\n{\n if (not lhs.empty())\n {\n if (not rhs.empty())\n {\n return py_values(call_method<object>(lhs.py.ptr(), \"__and__\", rhs.py));\n }\n else\n {\n return rhs;\n }\n }\n else\n {\n return lhs;\n }\n}\n\n} \/\/ namespace python\n\nnamespace values {\n\n template <>\n struct values_traits<python::py_values>\n {\n static constexpr bool stateful = false;\n static constexpr bool fast_iterable = false;\n static constexpr bool has_value_type = false;\n };\n\n} \/\/ namespace values\n\nnamespace python {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct pyconf\n : public sdd::conf1\n{\n using Variable = int;\n using Identifier = std::string;\n using Values = py_values;\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ndouble\ncount_combinations(SDD<pyconf> s)\n{\n return sdd::count_combinations(s).template convert_to<double>();\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct _manager\n{\n std::shared_ptr<manager<pyconf>> ptr;\n\n _manager()\n : ptr(new manager<pyconf>(manager<pyconf>::init()))\n {}\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ninline\nobject\npass_through(object const& o)\n{\n return o;\n}\n\nstruct paths\n{\n path_generator<pyconf> gen;\n\n paths(const SDD<pyconf>& s)\n noexcept\n : gen(s.paths())\n {}\n\n static\n path<pyconf>\n next(paths& p)\n {\n if (p.gen)\n {\n const path<pyconf> res = p.gen.get();\n p.gen(); \/\/ compute next path\n return res;\n }\n else\n {\n PyErr_SetString(PyExc_StopIteration, \"No more paths.\");\n boost::python::throw_error_already_set();\n const path<pyconf>* dummy = nullptr;\n return *dummy;\n }\n }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\nstruct py_visitor\n{\n using result_type = object;\n\n object py;\n\n py_visitor(object p)\n : py(p)\n {}\n\n object\n operator()(const hierarchical_node<pyconf>& node)\n const\n {\n return py.attr(\"hierarchical\")(boost::cref(node));\n }\n\n object\n operator()(const flat_node<pyconf>& node)\n const\n {\n return py.attr(\"flat\")(boost::cref(node));\n }\n\n object\n operator()(const one_terminal<pyconf>&)\n const\n {\n return py.attr(\"one\")();\n }\n\n object\n operator()(const zero_terminal<pyconf>&)\n const\n {\n return py.attr(\"zero\")();\n }\n};\n\nobject\npy_visit(object visitor, const SDD<pyconf>& s)\n{\n return visit(py_visitor {visitor}, s);\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n\n\nBOOST_PYTHON_MODULE(_sdd)\n{\n using sdd_type = SDD<pyconf>;\n using hierarchical = hierarchical_node<pyconf>;\n using flat = flat_node<pyconf>;\n\n class_<_manager, boost::noncopyable>(\"_manager\");\n\n class_<arc<pyconf, sdd_type>, boost::noncopyable>(\"HierarchicalArc\", no_init)\n .def(\"valuation\", &arc<pyconf, sdd_type>::valuation, return_internal_reference<>())\n .def(\"successor\", &arc<pyconf, sdd_type>::successor)\n ;\n\n class_<hierarchical, boost::noncopyable>(\"HierarchicalNode\", no_init)\n .def(\"variable\", &hierarchical::variable)\n .def(\"__iter__\", range<return_internal_reference<>>(&hierarchical::begin, &hierarchical::end))\n ;\n\n class_<arc<pyconf, py_values>, boost::noncopyable>(\"FlatArc\", no_init)\n .def(\"valuation\", &arc<pyconf, py_values>::valuation, return_internal_reference<>())\n .def(\"successor\", &arc<pyconf, py_values>::successor)\n ;\n\n class_<flat, boost::noncopyable>(\"FlatNode\", no_init)\n .def(\"variable\", &flat::variable)\n .def(\"__iter__\", range<return_internal_reference<>>(&flat::begin, &flat::end))\n ;\n\n class_<sdd_type>(\"SDD\", init<int, object, sdd_type>())\n .def(init<int, sdd_type, sdd_type>())\n .def(self_ns::str(self))\n .def(self + self)\n .def(self - self)\n .def(self & self)\n .def(self == self)\n .def(self < self)\n .def(\"__hash__\", &sdd_type::hash)\n ;\n\n def(\"zero\", &zero<pyconf>);\n def(\"one\", &one<pyconf>);\n\n def(\"count_combinations\", &count_combinations);\n\n def(\"visit\", &py_visit);\n\n class_<path<pyconf>>(\"Path\", no_init)\n .def(vector_indexing_suite<path<pyconf>>())\n ;\n\n class_<paths, boost::noncopyable>(\"Paths\", init<SDD<pyconf>>())\n .def(\"__iter__\", &pass_through)\n .def(\"next\", &paths::next)\n ;\n\n class_<py_values>(\"PyValues\", no_init)\n .def(\"content\", &py_values::content)\n ;\n}\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n}} \/\/ namespace sdd::python\n\nnamespace std {\n\n\/*------------------------------------------------------------------------------------------------*\/\n\ntemplate <>\nstruct hash<sdd::python::py_values>\n{\n std::size_t\n operator()(const sdd::python::py_values& val)\n const\n {\n return val.hash();\n }\n};\n\n\/*------------------------------------------------------------------------------------------------*\/\n\n} \/\/ namespace std\n<|endoftext|>"} {"text":"<commit_before>#ifndef STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n#define STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stdexcept>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_fx Gradient of function at argument\n *\/\ntemplate <typename F>\nvoid gradient(const F& f, const Eigen::Matrix<double, Eigen::Dynamic, 1>& x,\n double& fx, Eigen::Matrix<double, Eigen::Dynamic, 1>& grad_fx) {\n start_nested();\n try {\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x);\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad_fx.resize(x.size());\n grad(fx_var.vi_);\n grad_fx = x_var.adj();\n } catch (const std::exception& \/*e*\/) {\n recover_memory_nested();\n throw;\n }\n recover_memory_nested();\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<commit_msg>avoid putting un-needed vars on chain stack and place them on nochain stack to reduce chain calls<commit_after>#ifndef STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n#define STAN_MATH_REV_FUNCTOR_GRADIENT_HPP\n\n#include <stan\/math\/rev\/meta.hpp>\n#include <stan\/math\/rev\/core.hpp>\n#include <stan\/math\/prim\/fun\/Eigen.hpp>\n#include <stdexcept>\n\nnamespace stan {\nnamespace math {\n\n\/**\n * Calculate the value and the gradient of the specified function\n * at the specified argument.\n *\n * <p>The functor must implement\n *\n * <code>\n * var\n * operator()(const\n * Eigen::Matrix<var, Eigen::Dynamic, 1>&)\n * <\/code>\n *\n * using only operations that are defined for\n * <code>var<\/code>. This latter constraint usually\n * requires the functions to be defined in terms of the libraries\n * defined in Stan or in terms of functions with appropriately\n * general namespace imports that eventually depend on functions\n * defined in Stan.\n *\n * <p>Time and memory usage is on the order of the size of the\n * fully unfolded expression for the function applied to the\n * argument, independently of dimension.\n *\n * @tparam F Type of function\n * @param[in] f Function\n * @param[in] x Argument to function\n * @param[out] fx Function applied to argument\n * @param[out] grad_fx Gradient of function at argument\n *\/\ntemplate <typename F>\nvoid gradient(const F& f, const Eigen::Matrix<double, Eigen::Dynamic, 1>& x,\n double& fx, Eigen::Matrix<double, Eigen::Dynamic, 1>& grad_fx) {\n start_nested();\n try {\n Eigen::Matrix<var, Eigen::Dynamic, 1> x_var(x.size());\n for (int i = 0; i < x.size(); ++i)\n x_var(i) = var(new vari(x(i), false));\n var fx_var = f(x_var);\n fx = fx_var.val();\n grad_fx.resize(x.size());\n grad(fx_var.vi_);\n grad_fx = x_var.adj();\n } catch (const std::exception& \/*e*\/) {\n recover_memory_nested();\n throw;\n }\n recover_memory_nested();\n}\n\n} \/\/ namespace math\n} \/\/ namespace stan\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_content_browser_client.h\"\n\n#include <vector>\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"base\/platform_file.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension_switches.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts.h\"\n#include \"xwalk\/runtime\/browser\/geolocation\/xwalk_access_token_store.h\"\n#include \"xwalk\/runtime\/browser\/media\/media_capture_devices_dispatcher.h\"\n#include \"xwalk\/runtime\/browser\/runtime_context.h\"\n#include \"xwalk\/runtime\/browser\/runtime_quota_permission_context.h\"\n#include \"content\/public\/browser\/browser_main_parts.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/common\/main_function_params.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n\n#if defined(OS_ANDROID)\n#include \"base\/android\/path_utils.h\"\n#include \"base\/base_paths_android.h\"\n#include \"xwalk\/runtime\/browser\/runtime_resource_dispatcher_host_delegate.h\"\n#include \"xwalk\/runtime\/common\/android\/xwalk_globals_android.h\"\n#endif\n\nnamespace xwalk {\n\nnamespace {\n\n\/\/ The application-wide singleton of ContentBrowserClient impl.\nXWalkContentBrowserClient* g_browser_client = NULL;\n\n#if defined(OS_ANDROID)\n\/\/ Android creates and holds its browser context by browser client.\nRuntimeContext* g_runtime_context;\n#endif\n\n} \/\/ namespace\n\n\/\/ static\nXWalkContentBrowserClient* XWalkContentBrowserClient::Get() {\n return g_browser_client;\n}\n\n#if defined(OS_ANDROID)\n\/\/ static\nRuntimeContext* XWalkContentBrowserClient::GetRuntimeContext() {\n return g_runtime_context;\n}\n#endif\n\nXWalkContentBrowserClient::XWalkContentBrowserClient()\n : main_parts_(NULL) {\n DCHECK(!g_browser_client);\n g_browser_client = this;\n#if defined(OS_ANDROID)\n g_runtime_context = new RuntimeContext();\n#endif\n}\n\nXWalkContentBrowserClient::~XWalkContentBrowserClient() {\n DCHECK(g_browser_client);\n g_browser_client = NULL;\n#if defined(OS_ANDROID)\n g_runtime_context = NULL;\n#endif\n}\n\ncontent::BrowserMainParts* XWalkContentBrowserClient::CreateBrowserMainParts(\n const content::MainFunctionParams& parameters) {\n main_parts_ = new XWalkBrowserMainParts(parameters);\n\n#if defined(OS_ANDROID)\n main_parts_->SetRuntimeContext(g_runtime_context);\n#endif\n return main_parts_;\n}\n\nnet::URLRequestContextGetter* XWalkContentBrowserClient::CreateRequestContext(\n content::BrowserContext* browser_context,\n content::ProtocolHandlerMap* protocol_handlers) {\n url_request_context_getter_ = static_cast<RuntimeContext*>(browser_context)->\n CreateRequestContext(protocol_handlers);\n return url_request_context_getter_;\n}\n\nnet::URLRequestContextGetter*\nXWalkContentBrowserClient::CreateRequestContextForStoragePartition(\n content::BrowserContext* browser_context,\n const base::FilePath& partition_path,\n bool in_memory,\n content::ProtocolHandlerMap* protocol_handlers) {\n return static_cast<RuntimeContext*>(browser_context)->\n CreateRequestContextForStoragePartition(\n partition_path, in_memory, protocol_handlers);\n}\n\nvoid XWalkContentBrowserClient::AppendExtraCommandLineSwitches(\n CommandLine* command_line, int child_process_id) {\n CommandLine* browser_process_cmd_line = CommandLine::ForCurrentProcess();\n if (browser_process_cmd_line->HasSwitch(\n switches::kXWalkDisableLoadingExtensionsOnDemand)) {\n command_line->AppendSwitch(\n switches::kXWalkDisableLoadingExtensionsOnDemand);\n }\n}\n\ncontent::QuotaPermissionContext*\nXWalkContentBrowserClient::CreateQuotaPermissionContext() {\n return new RuntimeQuotaPermissionContext();\n}\n\ncontent::AccessTokenStore* XWalkContentBrowserClient::CreateAccessTokenStore() {\n return new XWalkAccessTokenStore(url_request_context_getter_);\n}\n\ncontent::WebContentsViewDelegate*\nXWalkContentBrowserClient::GetWebContentsViewDelegate(\n content::WebContents* web_contents) {\n return NULL;\n}\n\nvoid XWalkContentBrowserClient::RenderProcessHostCreated(\n content::RenderProcessHost* host) {\n main_parts_->extension_service()->OnRenderProcessHostCreated(host);\n}\n\ncontent::MediaObserver* XWalkContentBrowserClient::GetMediaObserver() {\n return XWalkMediaCaptureDevicesDispatcher::GetInstance();\n}\n\n#if defined(OS_ANDROID)\nvoid XWalkContentBrowserClient::GetAdditionalMappedFilesForChildProcess(\n const CommandLine& command_line,\n int child_process_id,\n std::vector<content::FileDescriptorInfo>* mappings) {\n int flags = base::PLATFORM_FILE_OPEN | base::PLATFORM_FILE_READ;\n base::FilePath pak_file;\n bool r = PathService::Get(base::DIR_ANDROID_APP_DATA, &pak_file);\n CHECK(r);\n pak_file = pak_file.Append(FILE_PATH_LITERAL(\"paks\"));\n pak_file = pak_file.Append(FILE_PATH_LITERAL(kXWalkPakFilePath));\n\n base::PlatformFile f =\n base::CreatePlatformFile(pak_file, flags, NULL, NULL);\n if (f == base::kInvalidPlatformFileValue) {\n NOTREACHED() << \"Failed to open file when creating renderer process: \"\n << \"xwalk.pak\";\n }\n mappings->push_back(\n content::FileDescriptorInfo(kXWalkPakDescriptor,\n base::FileDescriptor(f, true)));\n}\n\nvoid XWalkContentBrowserClient::ResourceDispatcherHostCreated() {\n RuntimeResourceDispatcherHostDelegate::ResourceDispatcherHostCreated();\n}\n#endif\n\n} \/\/ namespace xwalk\n<commit_msg>[Extensions] Pass to RP whether we use or not use extension process<commit_after>\/\/ Copyright (c) 2013 Intel Corporation. All rights reserved.\n\/\/ Use of this source code is governed by a BSD-style license that can be\n\/\/ found in the LICENSE file.\n\n#include \"xwalk\/runtime\/browser\/xwalk_content_browser_client.h\"\n\n#include <vector>\n\n#include \"base\/command_line.h\"\n#include \"base\/path_service.h\"\n#include \"base\/platform_file.h\"\n#include \"xwalk\/extensions\/browser\/xwalk_extension_service.h\"\n#include \"xwalk\/extensions\/common\/xwalk_extension_switches.h\"\n#include \"xwalk\/runtime\/browser\/xwalk_browser_main_parts.h\"\n#include \"xwalk\/runtime\/browser\/geolocation\/xwalk_access_token_store.h\"\n#include \"xwalk\/runtime\/browser\/media\/media_capture_devices_dispatcher.h\"\n#include \"xwalk\/runtime\/browser\/runtime_context.h\"\n#include \"xwalk\/runtime\/browser\/runtime_quota_permission_context.h\"\n#include \"content\/public\/browser\/browser_main_parts.h\"\n#include \"content\/public\/browser\/render_process_host.h\"\n#include \"content\/public\/browser\/web_contents.h\"\n#include \"content\/public\/common\/main_function_params.h\"\n#include \"net\/url_request\/url_request_context_getter.h\"\n\n#if defined(OS_ANDROID)\n#include \"base\/android\/path_utils.h\"\n#include \"base\/base_paths_android.h\"\n#include \"xwalk\/runtime\/browser\/runtime_resource_dispatcher_host_delegate.h\"\n#include \"xwalk\/runtime\/common\/android\/xwalk_globals_android.h\"\n#endif\n\nnamespace xwalk {\n\nnamespace {\n\n\/\/ The application-wide singleton of ContentBrowserClient impl.\nXWalkContentBrowserClient* g_browser_client = NULL;\n\n#if defined(OS_ANDROID)\n\/\/ Android creates and holds its browser context by browser client.\nRuntimeContext* g_runtime_context;\n#endif\n\n} \/\/ namespace\n\n\/\/ static\nXWalkContentBrowserClient* XWalkContentBrowserClient::Get() {\n return g_browser_client;\n}\n\n#if defined(OS_ANDROID)\n\/\/ static\nRuntimeContext* XWalkContentBrowserClient::GetRuntimeContext() {\n return g_runtime_context;\n}\n#endif\n\nXWalkContentBrowserClient::XWalkContentBrowserClient()\n : main_parts_(NULL) {\n DCHECK(!g_browser_client);\n g_browser_client = this;\n#if defined(OS_ANDROID)\n g_runtime_context = new RuntimeContext();\n#endif\n}\n\nXWalkContentBrowserClient::~XWalkContentBrowserClient() {\n DCHECK(g_browser_client);\n g_browser_client = NULL;\n#if defined(OS_ANDROID)\n g_runtime_context = NULL;\n#endif\n}\n\ncontent::BrowserMainParts* XWalkContentBrowserClient::CreateBrowserMainParts(\n const content::MainFunctionParams& parameters) {\n main_parts_ = new XWalkBrowserMainParts(parameters);\n\n#if defined(OS_ANDROID)\n main_parts_->SetRuntimeContext(g_runtime_context);\n#endif\n return main_parts_;\n}\n\nnet::URLRequestContextGetter* XWalkContentBrowserClient::CreateRequestContext(\n content::BrowserContext* browser_context,\n content::ProtocolHandlerMap* protocol_handlers) {\n url_request_context_getter_ = static_cast<RuntimeContext*>(browser_context)->\n CreateRequestContext(protocol_handlers);\n return url_request_context_getter_;\n}\n\nnet::URLRequestContextGetter*\nXWalkContentBrowserClient::CreateRequestContextForStoragePartition(\n content::BrowserContext* browser_context,\n const base::FilePath& partition_path,\n bool in_memory,\n content::ProtocolHandlerMap* protocol_handlers) {\n return static_cast<RuntimeContext*>(browser_context)->\n CreateRequestContextForStoragePartition(\n partition_path, in_memory, protocol_handlers);\n}\n\n\/\/ This allow us to append extra command line switches to the child\n\/\/ process we launch.\nvoid XWalkContentBrowserClient::AppendExtraCommandLineSwitches(\n CommandLine* command_line, int child_process_id) {\n CommandLine* browser_process_cmd_line = CommandLine::ForCurrentProcess();\n const int extra_switches_count = 2;\n const char* extra_switches[extra_switches_count] = {\n switches::kXWalkDisableLoadingExtensionsOnDemand,\n switches::kXWalkDisableExtensionProcess\n };\n\n for (int i = 0; i < extra_switches_count; i++) {\n if (browser_process_cmd_line->HasSwitch(extra_switches[i]))\n command_line->AppendSwitch(extra_switches[i]);\n }\n}\n\ncontent::QuotaPermissionContext*\nXWalkContentBrowserClient::CreateQuotaPermissionContext() {\n return new RuntimeQuotaPermissionContext();\n}\n\ncontent::AccessTokenStore* XWalkContentBrowserClient::CreateAccessTokenStore() {\n return new XWalkAccessTokenStore(url_request_context_getter_);\n}\n\ncontent::WebContentsViewDelegate*\nXWalkContentBrowserClient::GetWebContentsViewDelegate(\n content::WebContents* web_contents) {\n return NULL;\n}\n\nvoid XWalkContentBrowserClient::RenderProcessHostCreated(\n content::RenderProcessHost* host) {\n main_parts_->extension_service()->OnRenderProcessHostCreated(host);\n}\n\ncontent::MediaObserver* XWalkContentBrowserClient::GetMediaObserver() {\n return XWalkMediaCaptureDevicesDispatcher::GetInstance();\n}\n\n#if defined(OS_ANDROID)\nvoid XWalkContentBrowserClient::GetAdditionalMappedFilesForChildProcess(\n const CommandLine& command_line,\n int child_process_id,\n std::vector<content::FileDescriptorInfo>* mappings) {\n int flags = base::PLATFORM_FILE_OPEN | base::PLATFORM_FILE_READ;\n base::FilePath pak_file;\n bool r = PathService::Get(base::DIR_ANDROID_APP_DATA, &pak_file);\n CHECK(r);\n pak_file = pak_file.Append(FILE_PATH_LITERAL(\"paks\"));\n pak_file = pak_file.Append(FILE_PATH_LITERAL(kXWalkPakFilePath));\n\n base::PlatformFile f =\n base::CreatePlatformFile(pak_file, flags, NULL, NULL);\n if (f == base::kInvalidPlatformFileValue) {\n NOTREACHED() << \"Failed to open file when creating renderer process: \"\n << \"xwalk.pak\";\n }\n mappings->push_back(\n content::FileDescriptorInfo(kXWalkPakDescriptor,\n base::FileDescriptor(f, true)));\n}\n\nvoid XWalkContentBrowserClient::ResourceDispatcherHostCreated() {\n RuntimeResourceDispatcherHostDelegate::ResourceDispatcherHostCreated();\n}\n#endif\n\n} \/\/ namespace xwalk\n<|endoftext|>"} {"text":"<commit_before>\/\/ TestWin32.cpp : Definiert den Einsprungpunkt fr die Anwendung.\n\/\/\n\n#define _WIN32_DCOM\n\n#include \"stdafx.h\"\n\n#include <windows.h>\n\n#include <ole2.h>\n#include <objidl.h>\n#include <objbase.h>\n#include <process.h>\n#include <olectl.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <..\\..\\inc\\systools\\win32\\MtaOleClipb.h>\n\n#include \"resource.h\"\n\n#define MAX_LOADSTRING 100\n\n\/\/ Globale Variablen:\nHINSTANCE hInst; \/\/ aktuelle Instanz\nWCHAR szTitle[MAX_LOADSTRING]; \/\/ Text der Titelzeile\nWCHAR szWindowClass[MAX_LOADSTRING]; \/\/ Text der Titelzeile\nATOM MyRegisterClass( HINSTANCE hInstance );\nBOOL InitInstance( HINSTANCE, int );\nLRESULT CALLBACK WndProc( HWND, UINT, WPARAM, LPARAM );\nLRESULT CALLBACK About( HWND, UINT, WPARAM, LPARAM );\nvoid PasteClipboardData(HWND hwndParent);\nvoid PasteClipboardData2(HWND hwndParent);\n\nLPSTREAM g_pStm = NULL;\nchar* pTextBuff = NULL;\nDWORD lData = 0;\n\n\/\/----------------------------------------------------\n\/\/ a thread function\n\/\/----------------------------------------------------\n\nunsigned int _stdcall ThreadProc(LPVOID pParam)\n{\n IDataObject* pIDataObj = NULL;\n FORMATETC formatETC;\n STGMEDIUM stgMedium;\n LPVOID pGlobMem;\n HWND hwnd;\n DWORD sizeGlobBuff;\n HRESULT hr;\n\n hwnd = (HWND)pParam;\n\n OleInitialize( NULL );\n\n hr = OleGetClipboard( &pIDataObj );\n\n hr = CoGetInterfaceAndReleaseStream(\n g_pStm,\n __uuidof(IDataObject),\n reinterpret_cast<LPVOID*>(&pIDataObj));\n\n formatETC.cfFormat = CF_TEXT;\n formatETC.ptd = NULL;\n formatETC.dwAspect = DVASPECT_CONTENT;\n formatETC.lindex = -1;\n formatETC.tymed = TYMED_HGLOBAL;\n\n hr = pIDataObj->GetData( &formatETC, &stgMedium );\n pGlobMem = GlobalLock( stgMedium.hGlobal );\n if ( NULL != pGlobMem )\n {\n if ( NULL != pTextBuff )\n {\n free( pTextBuff );\n }\n\n sizeGlobBuff = GlobalSize( stgMedium.hGlobal );\n pTextBuff = (char*)malloc( sizeGlobBuff + 1 );\n ZeroMemory( pTextBuff, sizeGlobBuff + 1 );\n\n memcpy( pTextBuff, pGlobMem, sizeGlobBuff );\n lData = sizeGlobBuff;\n\n InvalidateRect( hwnd, NULL, TRUE );\n UpdateWindow( hwnd );\n }\n\n GlobalUnlock( stgMedium.hGlobal );\n\n ReleaseStgMedium( &stgMedium );\n\n pIDataObj->Release();\n\n \/\/CoUninitialize( );\n\n OleUninitialize( );\n\n return 0;\n}\n\n\/\/----------------------------------------------------\n\/\/ WinMain\n\/\/----------------------------------------------------\n\nint APIENTRY WinMain(HINSTANCE hInstance,\n HINSTANCE hPrevInstance,\n LPSTR lpCmdLine,\n int nCmdShow )\n{\n \/\/ ZU ERLEDIGEN: Fgen Sie hier den Code ein.\n MSG msg;\n HACCEL hAccelTable;\n HRESULT hr = E_FAIL;\n\n \/\/ it's important to initialize ole\n \/\/ in order to use the clipboard\n \/\/hr = OleInitialize( NULL );\n hr = CoInitializeEx( NULL, COINIT_MULTITHREADED );\n \/\/hr = CoInitializeEx( NULL, COINIT_APARTMENTTHREADED );\n\n \/\/ Globale Zeichenfolgen initialisieren\n LoadStringW(hInstance, IDS_APP_TITLE, szTitle, MAX_LOADSTRING);\n LoadStringW(hInstance, IDC_TESTWIN32, szWindowClass, MAX_LOADSTRING);\n MyRegisterClass(hInstance);\n\n \/\/ Initialisierung der Anwendung durchfhren:\n if( !InitInstance( hInstance, nCmdShow ) )\n {\n return FALSE;\n }\n\n hAccelTable = LoadAccelerators(hInstance, (LPCTSTR)IDC_TESTWIN32);\n\n \/\/ Hauptnachrichtenschleife:\n while( GetMessage(&msg, NULL, 0, 0) )\n {\n if( !TranslateAccelerator (msg.hwnd, hAccelTable, &msg) )\n {\n TranslateMessage( &msg );\n DispatchMessage( &msg );\n }\n }\n\n \/\/ uninitializing the ole libraries\n \/\/OleUninitialize( );\n CoUninitialize( );\n\n return msg.wParam;\n}\n\n\n\n\/\/\n\/\/ FUNKTION: MyRegisterClass()\n\/\/\n\/\/ AUFGABE: Registriert die Fensterklasse.\n\/\/\n\/\/ KOMMENTARE:\n\/\/\n\/\/ Diese Funktion und ihre Verwendung sind nur notwendig, wenn dieser Code\n\/\/ mit Win32-Systemen vor der 'RegisterClassEx'-Funktion kompatibel sein soll,\n\/\/ die zu Windows 95 hinzugefgt wurde. Es ist wichtig diese Funktion aufzurufen,\n\/\/ damit der Anwendung kleine Symbole mit den richtigen Proportionen zugewiesen\n\/\/ werden.\n\/\/\nATOM MyRegisterClass( HINSTANCE hInstance )\n{\n WNDCLASSEXW wcex;\n\n wcex.cbSize = sizeof(WNDCLASSEX);\n\n wcex.style = CS_HREDRAW | CS_VREDRAW;\n wcex.lpfnWndProc = (WNDPROC)WndProc;\n wcex.cbClsExtra = 0;\n wcex.cbWndExtra = 0;\n wcex.hInstance = hInstance;\n wcex.hIcon = LoadIcon(hInstance, (LPCTSTR)IDI_TESTWIN32);\n wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n wcex.hbrBackground = (HBRUSH)(COLOR_WINDOW+1);\n wcex.lpszMenuName = (LPCWSTR)IDC_TESTWIN32;\n wcex.lpszClassName = szWindowClass;\n wcex.hIconSm = LoadIcon(wcex.hInstance, (LPCTSTR)IDI_SMALL);\n\n return RegisterClassExW(&wcex);\n}\n\n\/\/\n\/\/ FUNKTION: InitInstance(HANDLE, int)\n\/\/\n\/\/ AUFGABE: Speichert die Instanzzugriffsnummer und erstellt das Hauptfenster\n\/\/\n\/\/ KOMMENTARE:\n\/\/\n\/\/ In dieser Funktion wird die Instanzzugriffsnummer in einer globalen Variable\n\/\/ gespeichert und das Hauptprogrammfenster erstellt und angezeigt.\n\/\/\nBOOL InitInstance( HINSTANCE hInstance, int nCmdShow )\n{\n HWND hWnd;\n\n hInst = hInstance; \/\/ Instanzzugriffsnummer in unserer globalen Variable speichern\n\n hWnd = CreateWindowExW(0, szWindowClass, szTitle, WS_OVERLAPPEDWINDOW,\n CW_USEDEFAULT, 0, CW_USEDEFAULT, 0, NULL, NULL, hInstance, NULL);\n\n if( !hWnd )\n {\n return FALSE;\n }\n\n ShowWindow( hWnd, nCmdShow );\n UpdateWindow( hWnd );\n\n return TRUE;\n}\n\n\/\/\n\/\/ FUNKTION: WndProc(HWND, unsigned, WORD, LONG)\n\/\/\n\/\/ AUFGABE: Verarbeitet Nachrichten fr das Hauptfenster.\n\/\/\n\/\/ WM_COMMAND - Anwendungsmen verarbeiten\n\/\/ WM_PAINT - Hauptfenster darstellen\n\/\/ WM_DESTROY - Beendigungsnachricht ausgeben und zurckkehren\n\/\/\n\/\/\nLRESULT CALLBACK WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam)\n{\n int wmId;\n int wmEvent;\n PAINTSTRUCT ps;\n HDC hdc;\n TCHAR szHello[MAX_LOADSTRING];\n\n\n LoadString(hInst, IDS_HELLO, szHello, MAX_LOADSTRING);\n\n switch( message )\n {\n case WM_COMMAND:\n wmId = LOWORD(wParam);\n wmEvent = HIWORD(wParam);\n \/\/ Menauswahlen analysieren:\n switch( wmId )\n {\n case IDD_PASTE:\n \/\/PasteClipboardData(hWnd);\n PasteClipboardData2(hWnd);\n break;\n\n case IDM_EXIT:\n DestroyWindow( hWnd );\n break;\n\n default:\n return DefWindowProc( hWnd, message, wParam, lParam );\n }\n break;\n\n case WM_PAINT:\n hdc = BeginPaint (hWnd, &ps);\n \/\/ ZU ERLEDIGEN: Hier beliebigen Code zum Zeichnen hinzufgen...\n RECT rt;\n GetClientRect( hWnd, &rt );\n\n if ( NULL != pTextBuff )\n {\n DrawText( hdc, pTextBuff, lData, &rt, DT_CENTER );\n }\n else\n {\n DrawText( hdc, szHello, strlen(szHello), &rt, DT_CENTER );\n }\n\n EndPaint( hWnd, &ps );\n break;\n\n case WM_DESTROY:\n PostQuitMessage( 0 );\n break;\n\n default:\n return DefWindowProc( hWnd, message, wParam, lParam );\n }\n return 0;\n}\n\nvoid PasteClipboardData2(HWND hwndParent)\n{\n IDataObject* pIDataObject;\n HRESULT hr;\n FORMATETC formatETC;\n STGMEDIUM stgMedium;\n LPVOID pGlobMem;\n HWND hwnd;\n DWORD sizeGlobBuff;\n\n hr = MTAGetClipboard( &pIDataObject );\n if ( SUCCEEDED( hr ) )\n {\n formatETC.cfFormat = CF_TEXT;\n formatETC.ptd = NULL;\n formatETC.dwAspect = DVASPECT_CONTENT;\n formatETC.lindex = -1;\n formatETC.tymed = TYMED_HGLOBAL;\n\n hr = pIDataObject->GetData( &formatETC, &stgMedium );\n pGlobMem = GlobalLock( stgMedium.hGlobal );\n if ( NULL != pGlobMem )\n {\n if ( NULL != pTextBuff )\n {\n free( pTextBuff );\n }\n\n sizeGlobBuff = GlobalSize( stgMedium.hGlobal );\n pTextBuff = (char*)malloc( sizeGlobBuff + 1 );\n ZeroMemory( pTextBuff, sizeGlobBuff + 1 );\n\n memcpy( pTextBuff, pGlobMem, sizeGlobBuff );\n lData = sizeGlobBuff;\n\n InvalidateRect( hwndParent, NULL, TRUE );\n UpdateWindow( hwndParent );\n }\n\n GlobalUnlock( stgMedium.hGlobal );\n\n ReleaseStgMedium( &stgMedium );\n\n pIDataObject->Release();\n }\n}\n\n\/\/----------------------------------------------------\n\/\/ clipboard handling\n\/\/----------------------------------------------------\n\n\/*\nvoid PasteClipboardData(HWND hwndParent)\n{\n IDataObject* pIDataObj = NULL;\n HRESULT hr = E_FAIL;\n unsigned int dwId;\n\n hr = OleGetClipboard( &pIDataObj );\n if ( SUCCEEDED( hr ) )\n {\n HRESULT hr = CoMarshalInterThreadInterfaceInStream(\n __uuidof(IDataObject), \/\/The IID of inteface to be marshaled\n pIDataObj, \/\/The interface pointer\n &g_pStm \/\/IStream pointer\n );\n\n HANDLE hThread = (HANDLE)_beginthreadex(\n NULL, \/\/Security\n 0, \/\/Stack Size\n ThreadProc, \/\/Start Address\n NULL, \/\/Parmeter\n (unsigned int)hwndParent, \/\/Creation Flag\n &dwId \/\/Thread Id\n );\n\n \/\/Wait for the thread to finish execution\n \/\/A thread handle is signaled is thread execution\n \/\/is complete\n for(;;)\n {\n DWORD dwRet = ::MsgWaitForMultipleObjects(\n 1, \/\/Count of objects\n &hThread, \/\/pointer to the array of objects\n FALSE, \/\/Wait for all objects?\n INFINITE, \/\/Wait How Long?\n QS_ALLINPUT \/\/Wait for all messges\n );\n\n \/\/This means that the object is signaled\n if ( dwRet != WAIT_OBJECT_0 + 1 )\n break;\n\n \/\/Remove the messages from the queue\n MSG msg;\n\n while (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE) > 0)\n {\n \/\/Not essential\n TranslateMessage(&msg);\n \/\/Let the windowproc handle the message\n DispatchMessage(&msg);\n }\n }\n\n CloseHandle( hThread );\n pIDataObj->Release();\n }\n}\n*\/\n<commit_msg>INTEGRATION: CWS pchfix02 (1.1.600); FILE MERGED 2006\/09\/01 17:34:23 kaib 1.1.600.1: #i68856# Added header markers and pch files<commit_after>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: cbptest.cxx,v $\n *\n * $Revision: 1.2 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 09:11:58 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_sal.hxx\"\n\/\/ TestWin32.cpp : Definiert den Einsprungpunkt fr die Anwendung.\n\/\/\n\n#define _WIN32_DCOM\n\n#include \"stdafx.h\"\n\n#include <windows.h>\n\n#include <ole2.h>\n#include <objidl.h>\n#include <objbase.h>\n#include <process.h>\n#include <olectl.h>\n#include <stdlib.h>\n#include <malloc.h>\n#include <..\\..\\inc\\systools\\win32\\MtaOleClipb.h>\n\n#include \"resource.h\"\n\n#define MAX_LOADSTRING 100\n\n\/\/ Globale Variablen:\nHINSTANCE hInst; \/\/ aktuelle Instanz\nWCHAR szTitle[MAX_LOADSTRING]; \/\/ Text der Titelzeile\nWCHAR szWindowClass[MAX_LOADSTRING]; \/\/ Text der Titelzeile\nATOM MyRegisterClass( HINSTANCE hInstance );\nBOOL InitInstance( HINSTANCE, int );\nLRESULT CALLBACK WndProc( HWND, UINT, WPARAM, LPARAM );\nLRESULT CALLBACK About( HWND, UINT, WPARAM, LPARAM );\nvoid PasteClipboardData(HWND hwndParent);\nvoid PasteClipboardData2(HWND hwndParent);\n\nLPSTREAM g_pStm = NULL;\nchar* pTextBuff = NULL;\nDWORD lData = 0;\n\n\/\/----------------------------------------------------\n\/\/ a thread function\n\/\/----------------------------------------------------\n\nunsigned int _stdcall ThreadProc(LPVOID pParam)\n{\n IDataObject* pIDataObj = NULL;\n FORMATETC formatETC;\n STGMEDIUM stgMedium;\n LPVOID pGlobMem;\n HWND hwnd;\n DWORD sizeGlobBuff;\n HRESULT hr;\n\n hwnd = (HWND)pParam;\n\n OleInitialize( NULL );\n\n hr = OleGetClipboard( &pIDataObj );\n\n hr = CoGetInterfaceAndReleaseStream(\n g_pStm,\n __uuidof(IDataObject),\n reinterpret_cast<LPVOID*>(&pIDataObj));\n\n formatETC.cfFormat = CF_TEXT;\n formatETC.ptd = NULL;\n formatETC.dwAspect = DVASPECT_CONTENT;\n formatETC.lindex = -1;\n formatETC.tymed = TYMED_HGLOBAL;\n\n hr = pIDataObj->GetData( &formatETC, &stgMedium );\n pGlobMem = GlobalLock( stgMedium.hGlobal );\n if ( NULL != pGlobMem )\n {\n if ( NULL != pTextBuff )\n {\n free( pTextBuff );\n }\n\n sizeGlobBuff = GlobalSize( stgMedium.hGlobal );\n pTextBuff = (char*)malloc( sizeGlobBuff + 1 );\n ZeroMemory( pTextBuff, sizeGlobBuff + 1 );\n\n memcpy( pTextBuff, pGlobMem, sizeGlobBuff );\n lData = sizeGlobBuff;\n\n InvalidateRect( hwnd, NULL, TRUE );\n UpdateWindow( hwnd );\n }\n\n GlobalUnlock( stgMedium.hGlobal );\n\n ReleaseStgMedium( &stgMedium );\n\n pIDataObj->Release();\n\n \/\/CoUninitialize( );\n\n OleUninitialize( );\n\n return 0;\n}\n\n\/\/----------------------------------------------------\n\/\/ WinMain\n\/\/----------------------------------------------------\n\nint APIENTRY WinMain(HINSTANCE hInstance,\n HINSTANCE hPrevInstance,\n LPSTR lpCmdLine,\n int nCmdShow )\n{\n \/\/ ZU ERLEDIGEN: Fgen Sie hier den Code ein.\n MSG msg;\n HACCEL hAccelTable;\n HRESULT hr = E_FAIL;\n\n \/\/ it's important to initialize ole\n \/\/ in order to use the clipboard\n \/\/hr = OleInitialize( NULL );\n hr = CoInitializeEx( NULL, COINIT_MULTITHREADED );\n \/\/hr = CoInitializeEx( NULL, COINIT_APARTMENTTHREADED );\n\n \/\/ Globale Zeichenfolgen initialisieren\n LoadStringW(hInstance, IDS_APP_TITLE, szTitle, MAX_LOADSTRING);\n LoadStringW(hInstance, IDC_TESTWIN32, szWindowClass, MAX_LOADSTRING);\n MyRegisterClass(hInstance);\n\n \/\/ Initialisierung der Anwendung durchfhren:\n if( !InitInstance( hInstance, nCmdShow ) )\n {\n return FALSE;\n }\n\n hAccelTable = LoadAccelerators(hInstance, (LPCTSTR)IDC_TESTWIN32);\n\n \/\/ Hauptnachrichtenschleife:\n while( GetMessage(&msg, NULL, 0, 0) )\n {\n if( !TranslateAccelerator (msg.hwnd, hAccelTable, &msg) )\n {\n TranslateMessage( &msg );\n DispatchMessage( &msg );\n }\n }\n\n \/\/ uninitializing the ole libraries\n \/\/OleUninitialize( );\n CoUninitialize( );\n\n return msg.wParam;\n}\n\n\n\n\/\/\n\/\/ FUNKTION: MyRegisterClass()\n\/\/\n\/\/ AUFGABE: Registriert die Fensterklasse.\n\/\/\n\/\/ KOMMENTARE:\n\/\/\n\/\/ Diese Funktion und ihre Verwendung sind nur notwendig, wenn dieser Code\n\/\/ mit Win32-Systemen vor der 'RegisterClassEx'-Funktion kompatibel sein soll,\n\/\/ die zu Windows 95 hinzugefgt wurde. Es ist wichtig diese Funktion aufzurufen,\n\/\/ damit der Anwendung kleine Symbole mit den richtigen Proportionen zugewiesen\n\/\/ werden.\n\/\/\nATOM MyRegisterClass( HINSTANCE hInstance )\n{\n WNDCLASSEXW wcex;\n\n wcex.cbSize = sizeof(WNDCLASSEX);\n\n wcex.style = CS_HREDRAW | CS_VREDRAW;\n wcex.lpfnWndProc = (WNDPROC)WndProc;\n wcex.cbClsExtra = 0;\n wcex.cbWndExtra = 0;\n wcex.hInstance = hInstance;\n wcex.hIcon = LoadIcon(hInstance, (LPCTSTR)IDI_TESTWIN32);\n wcex.hCursor = LoadCursor(NULL, IDC_ARROW);\n wcex.hbrBackground = (HBRUSH)(COLOR_WINDOW+1);\n wcex.lpszMenuName = (LPCWSTR)IDC_TESTWIN32;\n wcex.lpszClassName = szWindowClass;\n wcex.hIconSm = LoadIcon(wcex.hInstance, (LPCTSTR)IDI_SMALL);\n\n return RegisterClassExW(&wcex);\n}\n\n\/\/\n\/\/ FUNKTION: InitInstance(HANDLE, int)\n\/\/\n\/\/ AUFGABE: Speichert die Instanzzugriffsnummer und erstellt das Hauptfenster\n\/\/\n\/\/ KOMMENTARE:\n\/\/\n\/\/ In dieser Funktion wird die Instanzzugriffsnummer in einer globalen Variable\n\/\/ gespeichert und das Hauptprogrammfenster erstellt und angezeigt.\n\/\/\nBOOL InitInstance( HINSTANCE hInstance, int nCmdShow )\n{\n HWND hWnd;\n\n hInst = hInstance; \/\/ Instanzzugriffsnummer in unserer globalen Variable speichern\n\n hWnd = CreateWindowExW(0, szWindowClass, szTitle, WS_OVERLAPPEDWINDOW,\n CW_USEDEFAULT, 0, CW_USEDEFAULT, 0, NULL, NULL, hInstance, NULL);\n\n if( !hWnd )\n {\n return FALSE;\n }\n\n ShowWindow( hWnd, nCmdShow );\n UpdateWindow( hWnd );\n\n return TRUE;\n}\n\n\/\/\n\/\/ FUNKTION: WndProc(HWND, unsigned, WORD, LONG)\n\/\/\n\/\/ AUFGABE: Verarbeitet Nachrichten fr das Hauptfenster.\n\/\/\n\/\/ WM_COMMAND - Anwendungsmen verarbeiten\n\/\/ WM_PAINT - Hauptfenster darstellen\n\/\/ WM_DESTROY - Beendigungsnachricht ausgeben und zurckkehren\n\/\/\n\/\/\nLRESULT CALLBACK WndProc(HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam)\n{\n int wmId;\n int wmEvent;\n PAINTSTRUCT ps;\n HDC hdc;\n TCHAR szHello[MAX_LOADSTRING];\n\n\n LoadString(hInst, IDS_HELLO, szHello, MAX_LOADSTRING);\n\n switch( message )\n {\n case WM_COMMAND:\n wmId = LOWORD(wParam);\n wmEvent = HIWORD(wParam);\n \/\/ Menauswahlen analysieren:\n switch( wmId )\n {\n case IDD_PASTE:\n \/\/PasteClipboardData(hWnd);\n PasteClipboardData2(hWnd);\n break;\n\n case IDM_EXIT:\n DestroyWindow( hWnd );\n break;\n\n default:\n return DefWindowProc( hWnd, message, wParam, lParam );\n }\n break;\n\n case WM_PAINT:\n hdc = BeginPaint (hWnd, &ps);\n \/\/ ZU ERLEDIGEN: Hier beliebigen Code zum Zeichnen hinzufgen...\n RECT rt;\n GetClientRect( hWnd, &rt );\n\n if ( NULL != pTextBuff )\n {\n DrawText( hdc, pTextBuff, lData, &rt, DT_CENTER );\n }\n else\n {\n DrawText( hdc, szHello, strlen(szHello), &rt, DT_CENTER );\n }\n\n EndPaint( hWnd, &ps );\n break;\n\n case WM_DESTROY:\n PostQuitMessage( 0 );\n break;\n\n default:\n return DefWindowProc( hWnd, message, wParam, lParam );\n }\n return 0;\n}\n\nvoid PasteClipboardData2(HWND hwndParent)\n{\n IDataObject* pIDataObject;\n HRESULT hr;\n FORMATETC formatETC;\n STGMEDIUM stgMedium;\n LPVOID pGlobMem;\n HWND hwnd;\n DWORD sizeGlobBuff;\n\n hr = MTAGetClipboard( &pIDataObject );\n if ( SUCCEEDED( hr ) )\n {\n formatETC.cfFormat = CF_TEXT;\n formatETC.ptd = NULL;\n formatETC.dwAspect = DVASPECT_CONTENT;\n formatETC.lindex = -1;\n formatETC.tymed = TYMED_HGLOBAL;\n\n hr = pIDataObject->GetData( &formatETC, &stgMedium );\n pGlobMem = GlobalLock( stgMedium.hGlobal );\n if ( NULL != pGlobMem )\n {\n if ( NULL != pTextBuff )\n {\n free( pTextBuff );\n }\n\n sizeGlobBuff = GlobalSize( stgMedium.hGlobal );\n pTextBuff = (char*)malloc( sizeGlobBuff + 1 );\n ZeroMemory( pTextBuff, sizeGlobBuff + 1 );\n\n memcpy( pTextBuff, pGlobMem, sizeGlobBuff );\n lData = sizeGlobBuff;\n\n InvalidateRect( hwndParent, NULL, TRUE );\n UpdateWindow( hwndParent );\n }\n\n GlobalUnlock( stgMedium.hGlobal );\n\n ReleaseStgMedium( &stgMedium );\n\n pIDataObject->Release();\n }\n}\n\n\/\/----------------------------------------------------\n\/\/ clipboard handling\n\/\/----------------------------------------------------\n\n\/*\nvoid PasteClipboardData(HWND hwndParent)\n{\n IDataObject* pIDataObj = NULL;\n HRESULT hr = E_FAIL;\n unsigned int dwId;\n\n hr = OleGetClipboard( &pIDataObj );\n if ( SUCCEEDED( hr ) )\n {\n HRESULT hr = CoMarshalInterThreadInterfaceInStream(\n __uuidof(IDataObject), \/\/The IID of inteface to be marshaled\n pIDataObj, \/\/The interface pointer\n &g_pStm \/\/IStream pointer\n );\n\n HANDLE hThread = (HANDLE)_beginthreadex(\n NULL, \/\/Security\n 0, \/\/Stack Size\n ThreadProc, \/\/Start Address\n NULL, \/\/Parmeter\n (unsigned int)hwndParent, \/\/Creation Flag\n &dwId \/\/Thread Id\n );\n\n \/\/Wait for the thread to finish execution\n \/\/A thread handle is signaled is thread execution\n \/\/is complete\n for(;;)\n {\n DWORD dwRet = ::MsgWaitForMultipleObjects(\n 1, \/\/Count of objects\n &hThread, \/\/pointer to the array of objects\n FALSE, \/\/Wait for all objects?\n INFINITE, \/\/Wait How Long?\n QS_ALLINPUT \/\/Wait for all messges\n );\n\n \/\/This means that the object is signaled\n if ( dwRet != WAIT_OBJECT_0 + 1 )\n break;\n\n \/\/Remove the messages from the queue\n MSG msg;\n\n while (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE) > 0)\n {\n \/\/Not essential\n TranslateMessage(&msg);\n \/\/Let the windowproc handle the message\n DispatchMessage(&msg);\n }\n }\n\n CloseHandle( hThread );\n pIDataObj->Release();\n }\n}\n*\/\n<|endoftext|>"} {"text":"<commit_before>#include \"warnings-disable.h\"\n\nWARNINGS_DISABLE\n#include <QPixmap>\n#include <QPushButton>\n#include <QtTest\/QtTest>\nWARNINGS_ENABLE\n\n#include \"..\/qtest-platform.h\"\n\n#include \"busywidget.h\"\n#include \"confirmationdialog.h\"\n#include \"elidedannotatedlabel.h\"\n#include \"filepickerdialog.h\"\n#include \"filepickerwidget.h\"\n\n#include \"ElidedLabel.h\"\n#include \"TSettings.h\"\n#include \"TWizard.h\"\n#include \"TWizardPage.h\"\n\nclass TestSmallWidgets : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n void initTestCase();\n void cleanupTestCase();\n\n void elidedLabel();\n void elidedAnnotatedLabel();\n void filepickerwidget();\n void filepickerdialog();\n void confirmationDialog();\n void busywidget();\n void statuslabel();\n void twizard();\n};\n\nvoid TestSmallWidgets::initTestCase()\n{\n QCoreApplication::setOrganizationName(TEST_NAME);\n\n \/\/ Use a custom message handler to filter out unwanted messages\n IF_NOT_VISUAL { qInstallMessageHandler(offscreenMessageOutput); }\n}\n\nvoid TestSmallWidgets::cleanupTestCase()\n{\n TSettings::destroy();\n}\n\nvoid TestSmallWidgets::elidedLabel()\n{\n \/\/ Initialize variables.\n const QString text(\"this is a long long long piece of text\");\n ElidedLabel * elidedlabel = new ElidedLabel();\n\n VISUAL_INIT(elidedlabel);\n\n \/\/ Set up ElidedText.\n elidedlabel->setElide(Qt::ElideRight);\n elidedlabel->setText(text);\n\n \/\/ The text should be fully visible if there's enough room.\n elidedlabel->setGeometry(100, 100, 1000, 20);\n QVERIFY(elidedlabel->text() == text);\n QVERIFY(elidedlabel->elideText(text).count() == text.count());\n VISUAL_WAIT;\n\n \/\/ The text should be elided if the widget is too narrow.\n elidedlabel->setGeometry(100, 100, 100, 20);\n QVERIFY(elidedlabel->text() == text);\n QVERIFY(elidedlabel->elideText(text).count() < text.count());\n VISUAL_WAIT;\n\n delete elidedlabel;\n}\n\nvoid TestSmallWidgets::elidedAnnotatedLabel()\n{\n ElidedAnnotatedLabel *el = new ElidedAnnotatedLabel();\n\n const QString plain(\"grey black long piece of text again grey\");\n const QString full(\"<font color=\\\"grey\\\">grey<\/font> black long piece of \"\n \"text <font color=\\\"grey\\\">again grey<\/font>\");\n QVector<QString> texts(3);\n texts[0] = \"grey\";\n texts[1] = \" black long piece of text \";\n texts[2] = \"again grey\";\n QVector<QString> annotations(6, \"\");\n annotations[0] = \"<font color=\\\"grey\\\">\";\n annotations[1] = \"<\/font>\";\n annotations[4] = \"<font color=\\\"grey\\\">\";\n annotations[5] = \"<\/font>\";\n\n VISUAL_INIT(el);\n\n \/\/ Set up ElidedText.\n el->setElide(Qt::ElideRight);\n el->setAnnotatedText(texts, annotations);\n\n \/\/ The text should be fully visible if there's enough room.\n el->setGeometry(100, 100, 1000, 20);\n QVERIFY(el->text() == plain);\n QVERIFY(el->elideText().count() == full.count());\n VISUAL_WAIT;\n\n \/\/ The text should be elided if the widget is too narrow.\n el->setGeometry(100, 100, 100, 20);\n QVERIFY(el->text() == plain);\n QVERIFY(el->elideText().count() < full.count());\n VISUAL_WAIT;\n\n delete el;\n}\n\nvoid TestSmallWidgets::filepickerwidget()\n{\n FilePickerWidget *fpw = new FilePickerWidget();\n delete fpw;\n}\n\nvoid TestSmallWidgets::filepickerdialog()\n{\n QWidget * widget = new QWidget();\n FilePickerDialog *fpd = new FilePickerDialog(widget);\n\n QList<QUrl> myurls({QUrl(\"file:\/\/\/tmp\")});\n fpd->setSelectedUrls(myurls);\n QVERIFY(fpd->getSelectedUrls() == myurls);\n\n delete fpd;\n delete widget;\n}\n\nvoid TestSmallWidgets::confirmationDialog()\n{\n ConfirmationDialog *confirm = new ConfirmationDialog();\n delete confirm;\n}\n\nvoid TestSmallWidgets::busywidget()\n{\n BusyWidget *bw = new BusyWidget();\n\n VISUAL_INIT(bw);\n\n \/\/ Before starting\n VISUAL_WAIT;\n\n \/\/ Animation\n bw->animate(true);\n QTest::qWait(100);\n VISUAL_WAIT;\n\n \/\/ After animation\n bw->animate(false);\n QTest::qWait(100);\n VISUAL_WAIT;\n\n delete bw;\n}\n\nvoid TestSmallWidgets::statuslabel()\n{\n ElidedLabel *el = new ElidedLabel();\n el->setMinimumWidth(200);\n\n VISUAL_INIT(el);\n\n el->messageNormal(\"normal message\");\n VISUAL_WAIT;\n\n el->messageError(\"error message\");\n VISUAL_WAIT;\n\n delete el;\n}\n\nvoid TestSmallWidgets::twizard()\n{\n TWizard *wizard = new TWizard();\n\n \/\/ Add logo\n QPixmap pix(32, 32);\n pix.fill(Qt::blue);\n wizard->setLogo(pix);\n\n \/\/ Create pages with titles\n TWizardPage *p1 = new TWizardPage();\n TWizardPage *p2 = new TWizardPage();\n p1->setTitle(\"page 1\");\n p2->setTitle(\"page 2\");\n\n \/\/ Add a \"proceed\" button to each page\n QPushButton *pb1 = new QPushButton(p1);\n pb1->setText(\"Next\");\n pb1->setObjectName(\"nextButton\");\n QPushButton *pb2 = new QPushButton(p2);\n pb2->setText(\"Finish\");\n pb2->setObjectName(\"finishButton\");\n\n \/\/ Add pages to the wizard; must be after the buttons have been added\n wizard->addPages(QList<TWizardPage *>() << p1 << p2);\n\n \/\/ Navigate through the pages.\n VISUAL_INIT(wizard);\n IF_NOT_VISUAL { wizard->open(); }\n\n wizard->currentPage()->button(TWizardPage::NextButton)->click();\n VISUAL_WAIT;\n wizard->currentPage()->button(TWizardPage::FinishButton)->click();\n VISUAL_WAIT;\n\n \/\/ We should have quit the wizard\n QVERIFY(wizard->isVisible() == false);\n\n delete wizard;\n}\n\nQTEST_MAIN(TestSmallWidgets)\n#include \"test-small-widgets.moc\"\n<commit_msg>tests\/small-widgets: busywidget_on_off<commit_after>#include \"warnings-disable.h\"\n\nWARNINGS_DISABLE\n#include <QPixmap>\n#include <QPushButton>\n#include <QtTest\/QtTest>\nWARNINGS_ENABLE\n\n#include \"..\/qtest-platform.h\"\n\n#include \"busywidget.h\"\n#include \"confirmationdialog.h\"\n#include \"elidedannotatedlabel.h\"\n#include \"filepickerdialog.h\"\n#include \"filepickerwidget.h\"\n\n#include \"ElidedLabel.h\"\n#include \"TSettings.h\"\n#include \"TWizard.h\"\n#include \"TWizardPage.h\"\n\nclass TestSmallWidgets : public QObject\n{\n Q_OBJECT\n\nprivate slots:\n void initTestCase();\n void cleanupTestCase();\n\n void elidedLabel();\n void elidedAnnotatedLabel();\n void filepickerwidget();\n void filepickerdialog();\n void confirmationDialog();\n void busywidget();\n void busywidget_on_off();\n void statuslabel();\n void twizard();\n};\n\nvoid TestSmallWidgets::initTestCase()\n{\n QCoreApplication::setOrganizationName(TEST_NAME);\n\n \/\/ Use a custom message handler to filter out unwanted messages\n IF_NOT_VISUAL { qInstallMessageHandler(offscreenMessageOutput); }\n}\n\nvoid TestSmallWidgets::cleanupTestCase()\n{\n TSettings::destroy();\n}\n\nvoid TestSmallWidgets::elidedLabel()\n{\n \/\/ Initialize variables.\n const QString text(\"this is a long long long piece of text\");\n ElidedLabel * elidedlabel = new ElidedLabel();\n\n VISUAL_INIT(elidedlabel);\n\n \/\/ Set up ElidedText.\n elidedlabel->setElide(Qt::ElideRight);\n elidedlabel->setText(text);\n\n \/\/ The text should be fully visible if there's enough room.\n elidedlabel->setGeometry(100, 100, 1000, 20);\n QVERIFY(elidedlabel->text() == text);\n QVERIFY(elidedlabel->elideText(text).count() == text.count());\n VISUAL_WAIT;\n\n \/\/ The text should be elided if the widget is too narrow.\n elidedlabel->setGeometry(100, 100, 100, 20);\n QVERIFY(elidedlabel->text() == text);\n QVERIFY(elidedlabel->elideText(text).count() < text.count());\n VISUAL_WAIT;\n\n delete elidedlabel;\n}\n\nvoid TestSmallWidgets::elidedAnnotatedLabel()\n{\n ElidedAnnotatedLabel *el = new ElidedAnnotatedLabel();\n\n const QString plain(\"grey black long piece of text again grey\");\n const QString full(\"<font color=\\\"grey\\\">grey<\/font> black long piece of \"\n \"text <font color=\\\"grey\\\">again grey<\/font>\");\n QVector<QString> texts(3);\n texts[0] = \"grey\";\n texts[1] = \" black long piece of text \";\n texts[2] = \"again grey\";\n QVector<QString> annotations(6, \"\");\n annotations[0] = \"<font color=\\\"grey\\\">\";\n annotations[1] = \"<\/font>\";\n annotations[4] = \"<font color=\\\"grey\\\">\";\n annotations[5] = \"<\/font>\";\n\n VISUAL_INIT(el);\n\n \/\/ Set up ElidedText.\n el->setElide(Qt::ElideRight);\n el->setAnnotatedText(texts, annotations);\n\n \/\/ The text should be fully visible if there's enough room.\n el->setGeometry(100, 100, 1000, 20);\n QVERIFY(el->text() == plain);\n QVERIFY(el->elideText().count() == full.count());\n VISUAL_WAIT;\n\n \/\/ The text should be elided if the widget is too narrow.\n el->setGeometry(100, 100, 100, 20);\n QVERIFY(el->text() == plain);\n QVERIFY(el->elideText().count() < full.count());\n VISUAL_WAIT;\n\n delete el;\n}\n\nvoid TestSmallWidgets::filepickerwidget()\n{\n FilePickerWidget *fpw = new FilePickerWidget();\n delete fpw;\n}\n\nvoid TestSmallWidgets::filepickerdialog()\n{\n QWidget * widget = new QWidget();\n FilePickerDialog *fpd = new FilePickerDialog(widget);\n\n QList<QUrl> myurls({QUrl(\"file:\/\/\/tmp\")});\n fpd->setSelectedUrls(myurls);\n QVERIFY(fpd->getSelectedUrls() == myurls);\n\n delete fpd;\n delete widget;\n}\n\nvoid TestSmallWidgets::confirmationDialog()\n{\n ConfirmationDialog *confirm = new ConfirmationDialog();\n delete confirm;\n}\n\nvoid TestSmallWidgets::busywidget()\n{\n BusyWidget *bw = new BusyWidget();\n\n VISUAL_INIT(bw);\n IF_NOT_VISUAL { bw->show(); }\n\n delete bw;\n}\n\nvoid TestSmallWidgets::busywidget_on_off()\n{\n BusyWidget *bw = new BusyWidget();\n\n VISUAL_INIT(bw);\n IF_NOT_VISUAL { bw->show(); }\n\n \/\/ Before starting\n VISUAL_WAIT;\n\n \/\/ Animation\n bw->animate(true);\n QTest::qWait(100);\n VISUAL_WAIT;\n\n \/\/ After animation\n bw->animate(false);\n QTest::qWait(100);\n VISUAL_WAIT;\n\n delete bw;\n}\n\nvoid TestSmallWidgets::statuslabel()\n{\n ElidedLabel *el = new ElidedLabel();\n el->setMinimumWidth(200);\n\n VISUAL_INIT(el);\n\n el->messageNormal(\"normal message\");\n VISUAL_WAIT;\n\n el->messageError(\"error message\");\n VISUAL_WAIT;\n\n delete el;\n}\n\nvoid TestSmallWidgets::twizard()\n{\n TWizard *wizard = new TWizard();\n\n \/\/ Add logo\n QPixmap pix(32, 32);\n pix.fill(Qt::blue);\n wizard->setLogo(pix);\n\n \/\/ Create pages with titles\n TWizardPage *p1 = new TWizardPage();\n TWizardPage *p2 = new TWizardPage();\n p1->setTitle(\"page 1\");\n p2->setTitle(\"page 2\");\n\n \/\/ Add a \"proceed\" button to each page\n QPushButton *pb1 = new QPushButton(p1);\n pb1->setText(\"Next\");\n pb1->setObjectName(\"nextButton\");\n QPushButton *pb2 = new QPushButton(p2);\n pb2->setText(\"Finish\");\n pb2->setObjectName(\"finishButton\");\n\n \/\/ Add pages to the wizard; must be after the buttons have been added\n wizard->addPages(QList<TWizardPage *>() << p1 << p2);\n\n \/\/ Navigate through the pages.\n VISUAL_INIT(wizard);\n IF_NOT_VISUAL { wizard->open(); }\n\n wizard->currentPage()->button(TWizardPage::NextButton)->click();\n VISUAL_WAIT;\n wizard->currentPage()->button(TWizardPage::FinishButton)->click();\n VISUAL_WAIT;\n\n \/\/ We should have quit the wizard\n QVERIFY(wizard->isVisible() == false);\n\n delete wizard;\n}\n\nQTEST_MAIN(TestSmallWidgets)\n#include \"test-small-widgets.moc\"\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/jit\/xla_device_context.h\"\n\n#include <memory>\n\n#include \"tensorflow\/compiler\/jit\/xla_device.h\"\n#include \"tensorflow\/compiler\/jit\/xla_launch_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/literal_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/dma_helper.h\"\n#include \"tensorflow\/core\/platform\/mem.h\"\n\nnamespace tensorflow {\n\n\/\/ The allocator used for Tensors assigned to the XLA device.\nXlaDeviceAllocator::XlaDeviceAllocator() {}\nXlaDeviceAllocator::~XlaDeviceAllocator() = default;\n\nstring XlaDeviceAllocator::Name() { return \"xla\"; }\n\nvoid* XlaDeviceAllocator::AllocateRaw(size_t alignment, size_t num_bytes) {\n \/\/ We always return an empty XlaTensor object, encoded as an opaque tagged\n \/\/ pointer. We can return an empty object and ignore num_bytes here because we\n \/\/ have control over all of the uses of this device tensor, and can lazily\n \/\/ allocate memory when used. This allows us to also know the shape of the\n \/\/ allocated Tensor, which is useful if the device's tensor representation\n \/\/ differs from the host.\n return XlaTensor::ToOpaquePointer(new XlaTensor());\n}\n\nvoid XlaDeviceAllocator::DeallocateRaw(void* ptr) {\n delete XlaTensor::FromOpaquePointer(ptr);\n}\n\nvoid XlaDeviceAllocator::GetStats(AllocatorStats* stats) { stats->Clear(); }\n\nXlaDeviceContext::XlaDeviceContext(\n std::shared_ptr<se::Stream> compute_stream,\n std::shared_ptr<se::Stream> host_to_device_stream,\n std::shared_ptr<se::Stream> device_to_host_stream, xla::LocalClient* client,\n bool transfer_as_literal,\n XlaCompiler::ShapeRepresentationFn shape_representation_fn,\n thread::ThreadPool* thread_pool)\n : stream_(std::move(compute_stream)),\n host_to_device_stream_(std::move(host_to_device_stream)),\n device_to_host_stream_(std::move(device_to_host_stream)),\n client_(client),\n transfer_manager_(client->backend().transfer_manager()),\n transfer_as_literal_(transfer_as_literal),\n shape_representation_fn_(std::move(shape_representation_fn)),\n thread_pool_(thread_pool) {\n CHECK(host_to_device_stream_ != nullptr);\n CHECK(device_to_host_stream_ != nullptr);\n CHECK(stream_ != nullptr);\n if (!shape_representation_fn_) {\n shape_representation_fn_ =\n [](const TensorShape& shape,\n DataType dtype) -> xla::StatusOr<TensorShape> { return shape; };\n }\n}\n\nStatus XlaDeviceContext::TransferLiteralToDevice(const Tensor& host_tensor,\n Tensor* device_tensor) const {\n xla::Shape xla_shape;\n TF_RETURN_IF_ERROR(TensorShapeToXLAShape(host_tensor.dtype(),\n host_tensor.shape(), &xla_shape));\n \/\/ Create a reference to hold onto host_tensor until after the literal has\n \/\/ been transferred. Also make sure the literal exists until the function\n \/\/ asynchronously completes, as it will be wrapped in an xla::LiteralSlice.\n TensorReference ref(host_tensor);\n auto literal = std::make_shared<xla::BorrowingLiteral>(\n static_cast<const char*>(DMAHelper::base(&host_tensor)), xla_shape);\n\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n const xla::ShapedBuffer& shaped_buffer = xla_tensor->shaped_buffer();\n VLOG(1) << \"Transfer to device as literal: \" << literal->ToString() << \" \"\n << shaped_buffer.ToString();\n if (UseMultipleStreams() && !transfer_manager_->CanShapedBufferBeAccessedNow(\n stream_->parent(), shaped_buffer)) {\n \/\/ Initially wait for the compute stream so that memory allocations are\n \/\/ synchronized.\n host_to_device_stream_->ThenWaitFor(stream_.get());\n }\n TF_RETURN_IF_ERROR(transfer_manager_->TransferLiteralToDeviceAsync(\n host_to_device_stream_.get(), *literal, shaped_buffer));\n if (UseMultipleStreams()) {\n auto event = std::make_shared<se::Event>(stream_->parent());\n TF_RET_CHECK(event->Init()) << \"Event failed to initialize!\";\n host_to_device_stream_->ThenRecordEvent(event.get());\n xla_tensor->ResetDefinitionEvent(std::move(event),\n host_to_device_stream_.get());\n }\n \/\/ Unref the host tensor, and capture the literal shared_ptr too so it goes\n \/\/ out of scope when the lambda completes.\n host_to_device_stream_->ThenDoHostCallback([ref, literal]() { ref.Unref(); });\n\n return Status::OK();\n}\n\nvoid XlaDeviceContext::TransferLiteralFromDevice(\n Tensor* host_tensor, const Tensor& device_tensor,\n const StatusCallback& done) const {\n xla::MutableBorrowingLiteral literal;\n TF_CHECK_OK(HostTensorToMutableBorrowingLiteral(host_tensor, &literal));\n\n const xla::ShapedBuffer& shaped_buffer =\n XlaTensor::FromTensor(&device_tensor)->shaped_buffer();\n\n TensorReference ref(device_tensor);\n transfer_manager_->TransferLiteralFromDevice(\n device_to_host_stream_.get(), shaped_buffer, literal,\n [=, &shaped_buffer](xla::Status status) {\n ref.Unref();\n done([&]() -> Status {\n VLOG(1) << \"Transfer from device as literal: \"\n << shaped_buffer.ToString();\n return status;\n }());\n });\n}\n\nvoid XlaDeviceContext::CopyCPUTensorToDevice(const Tensor* cpu_tensor,\n Device* device,\n Tensor* device_tensor,\n StatusCallback done) const {\n if (cpu_tensor->NumElements() == 0) {\n VLOG(2) << \"CopyCPUTensorToDevice empty tensor\";\n done(Status::OK());\n return;\n }\n\n VLOG(2) << \"CopyCPUTensorToDevice \"\n << reinterpret_cast<const void*>(cpu_tensor->tensor_data().data())\n << \" \"\n << reinterpret_cast<const void*>(device_tensor->tensor_data().data())\n << \" \" << cpu_tensor->NumElements() << \" \"\n << cpu_tensor->shape().DebugString() << \" \"\n << device_tensor->shape().DebugString();\n\n void* src_ptr = const_cast<void*>(DMAHelper::base(cpu_tensor));\n const int64 total_bytes = cpu_tensor->TotalBytes();\n\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n CHECK(xla_tensor);\n\n xla::StatusOr<TensorShape> shape_or_status =\n shape_representation_fn_(device_tensor->shape(), device_tensor->dtype());\n if (!shape_or_status.ok()) {\n done(shape_or_status.status());\n return;\n }\n TensorShape shape = shape_or_status.ValueOrDie();\n if (!xla_tensor->has_shaped_buffer()) {\n Status s =\n xla_tensor->AllocateShapedBuffer(device_tensor->dtype(), shape, client_,\n stream_->parent()->device_ordinal());\n if (!s.ok()) {\n done(s);\n return;\n }\n }\n\n Status status;\n if (transfer_as_literal_) {\n Tensor reshaped_cpu_tensor;\n if (!reshaped_cpu_tensor.CopyFrom(*cpu_tensor, shape)) {\n done(errors::Internal(\n \"Tensor::CopyFrom failed when copying from CPU to XLA device\"));\n return;\n }\n status = TransferLiteralToDevice(reshaped_cpu_tensor, device_tensor);\n } else {\n se::DeviceMemoryBase dev_dst_ptr =\n XlaTensor::DeviceMemoryFromTensor(*device_tensor);\n host_to_device_stream_->ThenMemcpy(&dev_dst_ptr, src_ptr, total_bytes);\n \/\/ TODO(hpucha): Make this asynchronous.\n Status block_status = host_to_device_stream_->BlockHostUntilDone();\n if (!block_status.ok()) {\n status = xla::InternalError(\n \"Failed to complete data transfer on stream %p: %s\",\n host_to_device_stream_.get(), block_status.error_message().c_str());\n }\n }\n if (status.ok()) {\n xla_tensor->set_host_tensor(*cpu_tensor);\n }\n done(status);\n}\n\nvoid XlaDeviceContext::CopyDeviceTensorToCPU(const Tensor* device_tensor,\n absl::string_view tensor_name,\n Device* device, Tensor* cpu_tensor,\n StatusCallback done) {\n if (device_tensor->NumElements() == 0) {\n VLOG(2) << \"CopyDeviceTensorToCPU empty tensor\";\n done(Status::OK());\n return;\n }\n VLOG(2) << \"CopyDeviceTensorToCPU \"\n << reinterpret_cast<const void*>(device_tensor->tensor_data().data())\n << \" \"\n << reinterpret_cast<const void*>(cpu_tensor->tensor_data().data())\n << \" \" << device_tensor->NumElements() << \" \"\n << cpu_tensor->shape().DebugString() << \" \"\n << device_tensor->shape().DebugString();\n\n const int64 total_bytes = cpu_tensor->TotalBytes();\n se::DeviceMemoryBase dev_src_ptr =\n XlaTensor::DeviceMemoryFromTensor(*device_tensor);\n void* dst_ptr = DMAHelper::base(cpu_tensor);\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n\n xla_tensor->WaitForDefinitionEventOnStream(device_to_host_stream_.get());\n\n Status status;\n if (transfer_as_literal_) {\n TransferLiteralFromDevice(cpu_tensor, *device_tensor, done);\n return;\n } else {\n device_to_host_stream_->ThenMemcpy(dst_ptr, dev_src_ptr, total_bytes);\n \/\/ TODO(hpucha): Make this asynchronous.\n Status block_status = device_to_host_stream_->BlockHostUntilDone();\n if (!block_status.ok()) {\n status = xla::InternalError(\n \"Failed to complete data transfer on stream %p: %s\", stream_.get(),\n block_status.error_message().c_str());\n }\n }\n\n done(status);\n}\n\n} \/\/ namespace tensorflow\n<commit_msg>[TF:XLA] Clarify comment on XlaDeviceContext::TransferLiteralToDevice.<commit_after>\/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*\/\n\n#include \"tensorflow\/compiler\/jit\/xla_device_context.h\"\n\n#include <memory>\n\n#include \"tensorflow\/compiler\/jit\/xla_device.h\"\n#include \"tensorflow\/compiler\/jit\/xla_launch_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/literal_util.h\"\n#include \"tensorflow\/compiler\/tf2xla\/shape_util.h\"\n#include \"tensorflow\/compiler\/xla\/util.h\"\n#include \"tensorflow\/core\/common_runtime\/device.h\"\n#include \"tensorflow\/core\/common_runtime\/dma_helper.h\"\n#include \"tensorflow\/core\/platform\/mem.h\"\n\nnamespace tensorflow {\n\n\/\/ The allocator used for Tensors assigned to the XLA device.\nXlaDeviceAllocator::XlaDeviceAllocator() {}\nXlaDeviceAllocator::~XlaDeviceAllocator() = default;\n\nstring XlaDeviceAllocator::Name() { return \"xla\"; }\n\nvoid* XlaDeviceAllocator::AllocateRaw(size_t alignment, size_t num_bytes) {\n \/\/ We always return an empty XlaTensor object, encoded as an opaque tagged\n \/\/ pointer. We can return an empty object and ignore num_bytes here because we\n \/\/ have control over all of the uses of this device tensor, and can lazily\n \/\/ allocate memory when used. This allows us to also know the shape of the\n \/\/ allocated Tensor, which is useful if the device's tensor representation\n \/\/ differs from the host.\n return XlaTensor::ToOpaquePointer(new XlaTensor());\n}\n\nvoid XlaDeviceAllocator::DeallocateRaw(void* ptr) {\n delete XlaTensor::FromOpaquePointer(ptr);\n}\n\nvoid XlaDeviceAllocator::GetStats(AllocatorStats* stats) { stats->Clear(); }\n\nXlaDeviceContext::XlaDeviceContext(\n std::shared_ptr<se::Stream> compute_stream,\n std::shared_ptr<se::Stream> host_to_device_stream,\n std::shared_ptr<se::Stream> device_to_host_stream, xla::LocalClient* client,\n bool transfer_as_literal,\n XlaCompiler::ShapeRepresentationFn shape_representation_fn,\n thread::ThreadPool* thread_pool)\n : stream_(std::move(compute_stream)),\n host_to_device_stream_(std::move(host_to_device_stream)),\n device_to_host_stream_(std::move(device_to_host_stream)),\n client_(client),\n transfer_manager_(client->backend().transfer_manager()),\n transfer_as_literal_(transfer_as_literal),\n shape_representation_fn_(std::move(shape_representation_fn)),\n thread_pool_(thread_pool) {\n CHECK(host_to_device_stream_ != nullptr);\n CHECK(device_to_host_stream_ != nullptr);\n CHECK(stream_ != nullptr);\n if (!shape_representation_fn_) {\n shape_representation_fn_ =\n [](const TensorShape& shape,\n DataType dtype) -> xla::StatusOr<TensorShape> { return shape; };\n }\n}\n\nStatus XlaDeviceContext::TransferLiteralToDevice(const Tensor& host_tensor,\n Tensor* device_tensor) const {\n xla::Shape xla_shape;\n TF_RETURN_IF_ERROR(TensorShapeToXLAShape(host_tensor.dtype(),\n host_tensor.shape(), &xla_shape));\n \/\/ Create a reference to hold onto host_tensor until after the literal has\n \/\/ been transferred. Also make sure the literal exists until the function\n \/\/ asynchronously completes, as it will be wrapped in an xla::LiteralSlice.\n TensorReference ref(host_tensor);\n auto literal = std::make_shared<xla::BorrowingLiteral>(\n static_cast<const char*>(DMAHelper::base(&host_tensor)), xla_shape);\n\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n const xla::ShapedBuffer& shaped_buffer = xla_tensor->shaped_buffer();\n VLOG(1) << \"Transfer to device as literal: \" << literal->ToString() << \" \"\n << shaped_buffer.ToString();\n if (UseMultipleStreams() && !transfer_manager_->CanShapedBufferBeAccessedNow(\n stream_->parent(), shaped_buffer)) {\n \/\/ Initially wait for the compute stream so that memory allocations are\n \/\/ synchronized.\n host_to_device_stream_->ThenWaitFor(stream_.get());\n }\n TF_RETURN_IF_ERROR(transfer_manager_->TransferLiteralToDeviceAsync(\n host_to_device_stream_.get(), *literal, shaped_buffer));\n if (UseMultipleStreams()) {\n auto event = std::make_shared<se::Event>(stream_->parent());\n TF_RET_CHECK(event->Init()) << \"Event failed to initialize!\";\n host_to_device_stream_->ThenRecordEvent(event.get());\n xla_tensor->ResetDefinitionEvent(std::move(event),\n host_to_device_stream_.get());\n }\n \/\/ Unref the host tensor, and capture the literal shared_ptr too so it goes\n \/\/ out of scope when the lambda completes.\n \/\/ We don't defer the call to done() onto the stream here, and the reasons why\n \/\/ this is correct are subtle. We assume that:\n \/\/ a) all consumers of the device tensor will wait for its definition event.\n \/\/ b) if the tensor is destroyed, then the memory allocator will not hand out\n \/\/ the same buffers until the transfer has completed.\n host_to_device_stream_->ThenDoHostCallback([ref, literal]() { ref.Unref(); });\n\n return Status::OK();\n}\n\nvoid XlaDeviceContext::TransferLiteralFromDevice(\n Tensor* host_tensor, const Tensor& device_tensor,\n const StatusCallback& done) const {\n xla::MutableBorrowingLiteral literal;\n TF_CHECK_OK(HostTensorToMutableBorrowingLiteral(host_tensor, &literal));\n\n const xla::ShapedBuffer& shaped_buffer =\n XlaTensor::FromTensor(&device_tensor)->shaped_buffer();\n\n TensorReference ref(device_tensor);\n transfer_manager_->TransferLiteralFromDevice(\n device_to_host_stream_.get(), shaped_buffer, literal,\n [=, &shaped_buffer](xla::Status status) {\n ref.Unref();\n done([&]() -> Status {\n VLOG(1) << \"Transfer from device as literal: \"\n << shaped_buffer.ToString();\n return status;\n }());\n });\n}\n\nvoid XlaDeviceContext::CopyCPUTensorToDevice(const Tensor* cpu_tensor,\n Device* device,\n Tensor* device_tensor,\n StatusCallback done) const {\n if (cpu_tensor->NumElements() == 0) {\n VLOG(2) << \"CopyCPUTensorToDevice empty tensor\";\n done(Status::OK());\n return;\n }\n\n VLOG(2) << \"CopyCPUTensorToDevice \"\n << reinterpret_cast<const void*>(cpu_tensor->tensor_data().data())\n << \" \"\n << reinterpret_cast<const void*>(device_tensor->tensor_data().data())\n << \" \" << cpu_tensor->NumElements() << \" \"\n << cpu_tensor->shape().DebugString() << \" \"\n << device_tensor->shape().DebugString();\n\n void* src_ptr = const_cast<void*>(DMAHelper::base(cpu_tensor));\n const int64 total_bytes = cpu_tensor->TotalBytes();\n\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n CHECK(xla_tensor);\n\n xla::StatusOr<TensorShape> shape_or_status =\n shape_representation_fn_(device_tensor->shape(), device_tensor->dtype());\n if (!shape_or_status.ok()) {\n done(shape_or_status.status());\n return;\n }\n TensorShape shape = shape_or_status.ValueOrDie();\n if (!xla_tensor->has_shaped_buffer()) {\n Status s =\n xla_tensor->AllocateShapedBuffer(device_tensor->dtype(), shape, client_,\n stream_->parent()->device_ordinal());\n if (!s.ok()) {\n done(s);\n return;\n }\n }\n\n Status status;\n if (transfer_as_literal_) {\n Tensor reshaped_cpu_tensor;\n if (!reshaped_cpu_tensor.CopyFrom(*cpu_tensor, shape)) {\n done(errors::Internal(\n \"Tensor::CopyFrom failed when copying from CPU to XLA device\"));\n return;\n }\n status = TransferLiteralToDevice(reshaped_cpu_tensor, device_tensor);\n } else {\n se::DeviceMemoryBase dev_dst_ptr =\n XlaTensor::DeviceMemoryFromTensor(*device_tensor);\n host_to_device_stream_->ThenMemcpy(&dev_dst_ptr, src_ptr, total_bytes);\n \/\/ TODO(hpucha): Make this asynchronous.\n Status block_status = host_to_device_stream_->BlockHostUntilDone();\n if (!block_status.ok()) {\n status = xla::InternalError(\n \"Failed to complete data transfer on stream %p: %s\",\n host_to_device_stream_.get(), block_status.error_message().c_str());\n }\n }\n if (status.ok()) {\n xla_tensor->set_host_tensor(*cpu_tensor);\n }\n done(status);\n}\n\nvoid XlaDeviceContext::CopyDeviceTensorToCPU(const Tensor* device_tensor,\n absl::string_view tensor_name,\n Device* device, Tensor* cpu_tensor,\n StatusCallback done) {\n if (device_tensor->NumElements() == 0) {\n VLOG(2) << \"CopyDeviceTensorToCPU empty tensor\";\n done(Status::OK());\n return;\n }\n VLOG(2) << \"CopyDeviceTensorToCPU \"\n << reinterpret_cast<const void*>(device_tensor->tensor_data().data())\n << \" \"\n << reinterpret_cast<const void*>(cpu_tensor->tensor_data().data())\n << \" \" << device_tensor->NumElements() << \" \"\n << cpu_tensor->shape().DebugString() << \" \"\n << device_tensor->shape().DebugString();\n\n const int64 total_bytes = cpu_tensor->TotalBytes();\n se::DeviceMemoryBase dev_src_ptr =\n XlaTensor::DeviceMemoryFromTensor(*device_tensor);\n void* dst_ptr = DMAHelper::base(cpu_tensor);\n XlaTensor* xla_tensor = XlaTensor::FromTensor(device_tensor);\n\n xla_tensor->WaitForDefinitionEventOnStream(device_to_host_stream_.get());\n\n Status status;\n if (transfer_as_literal_) {\n TransferLiteralFromDevice(cpu_tensor, *device_tensor, done);\n return;\n } else {\n device_to_host_stream_->ThenMemcpy(dst_ptr, dev_src_ptr, total_bytes);\n \/\/ TODO(hpucha): Make this asynchronous.\n Status block_status = device_to_host_stream_->BlockHostUntilDone();\n if (!block_status.ok()) {\n status = xla::InternalError(\n \"Failed to complete data transfer on stream %p: %s\", stream_.get(),\n block_status.error_message().c_str());\n }\n }\n\n done(status);\n}\n\n} \/\/ namespace tensorflow\n<|endoftext|>"} {"text":"<commit_before>#pragma once\n\/*\n * Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n\n#ifndef _QI_ATOMIC_HPP_\n#define _QI_ATOMIC_HPP_\n\n#ifdef _MSC_VER\n# include <windows.h>\n\nextern \"C\" long __cdecl _InterlockedIncrement(long volatile *);\nextern \"C\" long __cdecl _InterlockedDecrement(long volatile *);\n\n# pragma intrinsic(_InterlockedIncrement)\n# pragma intrinsic(_InterlockedDecrement)\n\n#endif\n\n#include <boost\/static_assert.hpp>\n\n#include <qi\/config.hpp>\n#include <qi\/macro.hpp>\n\nnamespace qi\n{\n inline long testAndSet(long* cond)\n {\n#ifdef __GNUC__\n return __sync_bool_compare_and_swap(cond, 0, 1);\n#endif\n#ifdef _MSC_VER\n return 1 - InterlockedCompareExchange(cond, 1, 0);\n#endif\n }\n\n \/* \/!\\ WARNING\n * The volatile is needed, because there is no memory barrier\n * surrounding the simple getter operator.\n * AtomicBase has public member so that it can be initialized at\n * static-initialization time.\n *\/\n template <typename T>\n struct AtomicBase\n {\n public:\n\n\n \/* prefix operators *\/\n inline T operator++();\n inline T operator--();\n inline AtomicBase<T>& operator=(T value);\n inline T swap(T value);\n\n inline T operator*()\n {\n return _value;\n }\n\n public:\n BOOST_STATIC_ASSERT_MSG(sizeof(T) == sizeof(int), \"qi::Atomic is only supprted for int-like types\");\n\n volatile T _value;\n };\n\n template <typename T>\n class Atomic: public AtomicBase<T>\n {\n public:\n Atomic()\n {\n this->_value = 0;\n }\n\n Atomic(T value)\n {\n this->_value = value;\n }\n };\n#ifdef __GNUC__\n template <typename T>\n inline T AtomicBase<T>::operator++()\n {\n return __sync_add_and_fetch(&_value, 1);\n }\n\n template <typename T>\n inline T AtomicBase<T>::operator--()\n {\n return __sync_sub_and_fetch(&_value, 1);\n }\n\n template <typename T>\n inline AtomicBase<T>& AtomicBase<T>::operator=(T value)\n {\n __sync_lock_test_and_set(&_value, value);\n return *this;\n }\n\n template <typename T>\n inline T AtomicBase<T>::swap(T value)\n {\n return __sync_lock_test_and_set(&_value, value);\n }\n#endif\n\n#ifdef _MSC_VER\n\n template <>\n inline int AtomicBase<int>::operator++()\n {\n return _InterlockedIncrement(reinterpret_cast<long*>(&_value));\n }\n\n template <>\n inline int AtomicBase<int>::operator--()\n {\n return _InterlockedDecrement(reinterpret_cast<long*>(&_value));\n }\n\n template<>\n inline AtomicBase<int>& AtomicBase<int>::operator=(int value)\n {\n InterlockedExchange(reinterpret_cast<long*>(&_value), value);\n return *this;\n }\n\n template<>\n inline int AtomicBase<int>::swap(int value)\n {\n return InterlockedExchange(reinterpret_cast<long*>(&_value), value);\n }\n\n template <>\n inline unsigned int AtomicBase<unsigned int>::operator++()\n {\n return _InterlockedIncrement(reinterpret_cast<long*>(&_value));\n }\n\n template <>\n inline unsigned int AtomicBase<unsigned int>::operator--()\n {\n return _InterlockedDecrement(reinterpret_cast<long*>(&_value));\n }\n\n template<>\n inline AtomicBase<unsigned int>& AtomicBase<unsigned int>::operator=(unsigned int value)\n {\n InterlockedExchange(reinterpret_cast<long*>(&_value), value);\n return *this;\n }\n\n template<>\n inline unsigned int AtomicBase<unsigned int>::swap(unsigned int value)\n {\n return InterlockedExchange(reinterpret_cast<long*>(&_value), value);\n }\n\n#endif\n\n}\n\n#endif \/\/ _QI_ATOMIC_HPP_\n<commit_msg>Atomic: Fix for 64bit WIN32<commit_after>#pragma once\n\/*\n * Copyright (c) 2012 Aldebaran Robotics. All rights reserved.\n * Use of this source code is governed by a BSD-style license that can be\n * found in the COPYING file.\n *\/\n\n\n#ifndef _QI_ATOMIC_HPP_\n#define _QI_ATOMIC_HPP_\n\n#ifdef _MSC_VER\n# include <windows.h>\n\nextern \"C\" long __cdecl _InterlockedIncrement(long volatile *);\nextern \"C\" long __cdecl _InterlockedDecrement(long volatile *);\n\n# pragma intrinsic(_InterlockedIncrement)\n# pragma intrinsic(_InterlockedDecrement)\n\n#endif\n\n#include <boost\/static_assert.hpp>\n\n#include <qi\/config.hpp>\n#include <qi\/macro.hpp>\n\nnamespace qi\n{\n inline long testAndSet(long* cond)\n {\n#ifdef __GNUC__\n return __sync_bool_compare_and_swap(cond, 0, 1);\n#endif\n#ifdef _MSC_VER\n return 1 - InterlockedCompareExchange(cond, 1, 0);\n#endif\n }\n\n \/* \/!\\ WARNING\n * The volatile is needed, because there is no memory barrier\n * surrounding the simple getter operator.\n * AtomicBase has public member so that it can be initialized at\n * static-initialization time.\n *\/\n template <typename T>\n struct AtomicBase\n {\n public:\n\n\n \/* prefix operators *\/\n inline T operator++();\n inline T operator--();\n inline AtomicBase<T>& operator=(T value);\n inline T swap(T value);\n\n inline T operator*()\n {\n return _value;\n }\n\n public:\n BOOST_STATIC_ASSERT_MSG(sizeof(T) == sizeof(int), \"qi::Atomic is only supprted for int-like types\");\n\n volatile\n#ifdef _MSC_VER\n long\n#else\n T\n#endif\n _value;\n };\n\n template <typename T>\n class Atomic: public AtomicBase<T>\n {\n public:\n Atomic()\n {\n this->_value = 0;\n }\n\n Atomic(T value)\n {\n this->_value = value;\n }\n };\n#ifdef __GNUC__\n template <typename T>\n inline T AtomicBase<T>::operator++()\n {\n return __sync_add_and_fetch(&_value, 1);\n }\n\n template <typename T>\n inline T AtomicBase<T>::operator--()\n {\n return __sync_sub_and_fetch(&_value, 1);\n }\n\n template <typename T>\n inline AtomicBase<T>& AtomicBase<T>::operator=(T value)\n {\n __sync_lock_test_and_set(&_value, value);\n return *this;\n }\n\n template <typename T>\n inline T AtomicBase<T>::swap(T value)\n {\n return __sync_lock_test_and_set(&_value, value);\n }\n#endif\n\n#ifdef _MSC_VER\n\n template <>\n inline int AtomicBase<int>::operator++()\n {\n return _InterlockedIncrement(&_value);\n }\n\n template <>\n inline int AtomicBase<int>::operator--()\n {\n return _InterlockedDecrement(&_value);\n }\n\n template<>\n inline AtomicBase<int>& AtomicBase<int>::operator=(int value)\n {\n InterlockedExchange(&_value, value);\n return *this;\n }\n\n template<>\n inline int AtomicBase<int>::swap(int value)\n {\n return InterlockedExchange(&_value, value);\n }\n\n template <>\n inline unsigned int AtomicBase<unsigned int>::operator++()\n {\n return _InterlockedIncrement(&_value);\n }\n\n template <>\n inline unsigned int AtomicBase<unsigned int>::operator--()\n {\n return _InterlockedDecrement(&_value);\n }\n\n template<>\n inline AtomicBase<unsigned int>& AtomicBase<unsigned int>::operator=(unsigned int value)\n {\n InterlockedExchange(&_value, value);\n return *this;\n }\n\n template<>\n inline unsigned int AtomicBase<unsigned int>::swap(unsigned int value)\n {\n return InterlockedExchange(&_value, value);\n }\n\n#endif\n\n}\n\n#endif \/\/ _QI_ATOMIC_HPP_\n<|endoftext|>"} {"text":"<commit_before>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"butler.hpp\"\n\nusing namespace butler;\nusing namespace std::string_literals;\n\nButler::Butler(SharedDisk disk, std::string root, Options opt)\n : disk_(disk), root_(root), options_(opt)\n{}\n\nvoid Butler::process(mana::Request_ptr req, mana::Response_ptr res, mana::Next next)\n{\n \/\/ if not a valid request\n if(req->method() != http::GET && req->method() != http::HEAD) {\n if(options_.fallthrough) {\n return (*next)();\n }\n res->add_header(http::header_fields::Entity::Allow, \"GET, HEAD\"s);\n res->send_code(http::Method_Not_Allowed);\n return;\n }\n\n \/\/ get path\n std::string path = req->uri().path();\n \/\/ resolve extension\n auto ext = get_extension(path);\n \/\/ concatenate root with path, example: \/ => \/public\/\n path = root_ + path;\n\n\n \/\/ no extension found\n if(ext.empty() and !options_.index.empty()) {\n if(path.back() != '\/') path += '\/';\n \/\/ lets try to see if we can serve an index\n path += options_.index[0]; \/\/ only check first one for now, else we have to use fs().ls\n disk_->fs().cstat(path,\n [this, req, res, next, path](auto err, const auto& entry)\n {\n \/\/printf(\"<Butler> err=%s path=%s entry=%s\\n\",\n \/\/ err.to_string().c_str(), path.c_str(), entry.name().c_str());\n \/\/ no index was found on this path, go to next middleware\n if(err or !entry.is_file()) {\n return (*next)();\n }\n \/\/ we got an index, lets send it\n else {\n http::Mime_Type mime = http::extension_to_type(get_extension(path));\n res->add_header(http::header_fields::Entity::Content_Type, mime);\n return res->send_file({disk_, entry});\n }\n });\n }\n \/\/ we found an extension, this is a (probably) a file request\n else {\n \/\/printf(\"<Butler> Extension found - assuming request for file.\\n\");\n disk_->fs().cstat(path,\n [this, req, res, next, path](auto err, const auto& entry)\n {\n \/\/printf(\"<Butler> err=%s path=%s entry=%s\\n\",\n \/\/ err.to_string().c_str(), path.c_str(), entry.name().c_str());\n if(err or !entry.is_file()) {\n #ifdef VERBOSE_WEBSERVER\n printf(\"<Butler> File not found. Replying with 404.\\n\");\n #endif\n res->send_code(http::Not_Found);\n return;\n \/*\n if(!options_.fallthrough) {\n printf(\"<Butler> File not found. Replying with 404.\\n\");\n return res->send_code(http::Not_Found);\n }\n else {\n return (*next)();\n }*\/\n }\n else {\n #ifdef VERBOSE_WEBSERVER\n printf(\"<Butler> Found file: %s (%llu B)\\n\", entry.name().c_str(), entry.size());\n #endif\n http::Mime_Type mime = http::extension_to_type(get_extension(path));\n res->add_header(http::header_fields::Entity::Content_Type, mime);\n res->send_file({disk_, entry});\n return;\n }\n });\n }\n}\n\nstd::string Butler::get_extension(const std::string& path) const {\n std::string ext;\n auto idx = path.find_last_of(\".\");\n \/\/ Find extension\n if(idx != std::string::npos) {\n ext = path.substr(idx+1);\n }\n return ext;\n}\n<commit_msg>Added include for http to know about MIME type<commit_after>\/\/ This file is a part of the IncludeOS unikernel - www.includeos.org\n\/\/\n\/\/ Copyright 2015-2016 Oslo and Akershus University College of Applied Sciences\n\/\/ and Alfred Bratterud\n\/\/\n\/\/ Licensed under the Apache License, Version 2.0 (the \"License\");\n\/\/ you may not use this file except in compliance with the License.\n\/\/ You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing, software\n\/\/ distributed under the License is distributed on an \"AS IS\" BASIS,\n\/\/ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n\/\/ See the License for the specific language governing permissions and\n\/\/ limitations under the License.\n\n#include \"butler.hpp\"\n#include <mana\/http> \/\/ http::Mime_Type\n\nusing namespace butler;\nusing namespace std::string_literals;\n\nButler::Butler(SharedDisk disk, std::string root, Options opt)\n : disk_(disk), root_(root), options_(opt)\n{}\n\nvoid Butler::process(mana::Request_ptr req, mana::Response_ptr res, mana::Next next)\n{\n \/\/ if not a valid request\n if(req->method() != http::GET && req->method() != http::HEAD) {\n if(options_.fallthrough) {\n return (*next)();\n }\n res->add_header(http::header_fields::Entity::Allow, \"GET, HEAD\"s);\n res->send_code(http::Method_Not_Allowed);\n return;\n }\n\n \/\/ get path\n std::string path = req->uri().path();\n \/\/ resolve extension\n auto ext = get_extension(path);\n \/\/ concatenate root with path, example: \/ => \/public\/\n path = root_ + path;\n\n\n \/\/ no extension found\n if(ext.empty() and !options_.index.empty()) {\n if(path.back() != '\/') path += '\/';\n \/\/ lets try to see if we can serve an index\n path += options_.index[0]; \/\/ only check first one for now, else we have to use fs().ls\n disk_->fs().cstat(path,\n [this, req, res, next, path](auto err, const auto& entry)\n {\n \/\/printf(\"<Butler> err=%s path=%s entry=%s\\n\",\n \/\/ err.to_string().c_str(), path.c_str(), entry.name().c_str());\n \/\/ no index was found on this path, go to next middleware\n if(err or !entry.is_file()) {\n return (*next)();\n }\n \/\/ we got an index, lets send it\n else {\n http::Mime_Type mime = http::extension_to_type(get_extension(path));\n res->add_header(http::header_fields::Entity::Content_Type, mime);\n return res->send_file({disk_, entry});\n }\n });\n }\n \/\/ we found an extension, this is a (probably) a file request\n else {\n \/\/printf(\"<Butler> Extension found - assuming request for file.\\n\");\n disk_->fs().cstat(path,\n [this, req, res, next, path](auto err, const auto& entry)\n {\n \/\/printf(\"<Butler> err=%s path=%s entry=%s\\n\",\n \/\/ err.to_string().c_str(), path.c_str(), entry.name().c_str());\n if(err or !entry.is_file()) {\n #ifdef VERBOSE_WEBSERVER\n printf(\"<Butler> File not found. Replying with 404.\\n\");\n #endif\n res->send_code(http::Not_Found);\n return;\n \/*\n if(!options_.fallthrough) {\n printf(\"<Butler> File not found. Replying with 404.\\n\");\n return res->send_code(http::Not_Found);\n }\n else {\n return (*next)();\n }*\/\n }\n else {\n #ifdef VERBOSE_WEBSERVER\n printf(\"<Butler> Found file: %s (%llu B)\\n\", entry.name().c_str(), entry.size());\n #endif\n http::Mime_Type mime = http::extension_to_type(get_extension(path));\n res->add_header(http::header_fields::Entity::Content_Type, mime);\n res->send_file({disk_, entry});\n return;\n }\n });\n }\n}\n\nstd::string Butler::get_extension(const std::string& path) const {\n std::string ext;\n auto idx = path.find_last_of(\".\");\n \/\/ Find extension\n if(idx != std::string::npos) {\n ext = path.substr(idx+1);\n }\n return ext;\n}\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n==============================================================================*\/\r\n\r\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/softmax.h\"\r\n\r\n#include \"tensorflow\/lite\/c\/builtin_op_data.h\"\r\n#include \"tensorflow\/lite\/c\/common.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/common.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/quantization_util.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/tensor_ctypes.h\"\r\n#include \"tensorflow\/lite\/kernels\/kernel_util.h\"\r\n#include \"tensorflow\/lite\/kernels\/op_macros.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/ceva\/ceva_tflm_lib.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/kernel_util.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/softmax.h\"\r\n#ifdef MCPS_MEASUREMENT\r\n#include \"mcps_macros.h\"\r\n#endif\r\n\r\n#if defined(CEVA_BX1) || defined(CEVA_SP500)\r\nextern int32_t* CEVA_TFLM_KERNELS_SCRATCH;\r\nextern int32_t CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL;\r\n#endif\r\n\r\nnamespace tflite {\r\nnamespace {\r\n\r\n\/\/ Takes a tensor and performs softmax along the last dimension.\r\nvoid SoftmaxFloatCEVA(const TfLiteEvalTensor* input, TfLiteEvalTensor* output,\r\n const SoftmaxParams& op_data) {\r\n const RuntimeShape& input_shape = tflite::micro::GetTensorShape(input);\r\n const float* input_data = tflite::micro::GetTensorData<float>(input);\r\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\r\n float* output_data = tflite::micro::GetTensorData<float>(output);\r\n\r\n const float beta = static_cast<float>(op_data.beta);\r\n const int trailing_dim = input_shape.DimensionsCount() - 1;\r\n const int outer_size =\r\n MatchingFlatSizeSkipDim(input_shape, trailing_dim, output_shape);\r\n const int depth =\r\n MatchingDim(input_shape, trailing_dim, output_shape, trailing_dim);\r\n int outer_size_mcps = outer_size;\r\n int depth_mcps = depth;\r\n\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_START_ONE;\r\n#endif\r\n for (int i = 0; i < outer_size; ++i) {\r\n CEVA_TFLM_Softmax_Float32(&input_data[i * depth], &output_data[i * depth],\r\n beta, depth);\r\n }\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_STOP_ONE(\r\n \"Test params:Call CEVA_TFLM_Softmax_Float32 %d times, inetrnal loop = %d\",\r\n outer_size_mcps, depth_mcps);\r\n#endif\r\n}\r\n\r\nTfLiteStatus SoftmaxQuantizedCEVA(TfLiteContext* context,\r\n const TfLiteEvalTensor* input,\r\n TfLiteEvalTensor* output,\r\n const SoftmaxParams& op_data) {\r\n if (input->type == kTfLiteUInt8) {\r\n tflite::reference_ops::Softmax(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<uint8_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<uint8_t>(output));\r\n } else if (input->type == kTfLiteInt8) {\r\n if (output->type == kTfLiteInt16) {\r\n tflite::reference_ops::Softmax(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<int8_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<int16_t>(output));\r\n } else {\r\n const RuntimeShape& input_shape = tflite::micro::GetTensorShape(input);\r\n const int8_t* input_data = tflite::micro::GetTensorData<int8_t>(input);\r\n\r\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\r\n int8_t* output_data = tflite::micro::GetTensorData<int8_t>(output);\r\n\r\n const int32_t input_beta_multiplier =\r\n static_cast<int32_t>(op_data.input_multiplier);\r\n const int32_t input_beta_left_shift =\r\n static_cast<int32_t>(op_data.input_left_shift);\r\n const int trailing_dim = input_shape.DimensionsCount() - 1;\r\n const int outer_size =\r\n MatchingFlatSizeSkipDim(input_shape, trailing_dim, output_shape);\r\n const int depth =\r\n MatchingDim(input_shape, trailing_dim, output_shape, trailing_dim);\r\n int outer_size_mcps = outer_size;\r\n int depth_mcps = depth;\r\n\r\n if (depth > CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL) {\r\n TF_LITE_KERNEL_LOG(context, \"Scratch size (%d) less that required (%d)\",\r\n CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL, depth);\r\n return kTfLiteError;\r\n }\r\n\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_START_ONE;\r\n#endif\r\n for (int i = 0; i < outer_size; ++i) {\r\n CEVA_TFLM_Softmax_Int8(&input_data[i * depth], &output_data[i * depth],\r\n input_beta_multiplier, input_beta_left_shift,\r\n depth, CEVA_TFLM_KERNELS_SCRATCH);\r\n }\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_STOP_ONE(\r\n \"Test params:Call CEVA_TFLM_Softmax_Int8 %d times, inetrnal loop = \"\r\n \"%d\",\r\n outer_size_mcps, depth_mcps);\r\n#endif\r\n }\r\n } else {\r\n tflite::reference_ops::SoftmaxInt16(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<int16_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<int16_t>(output));\r\n }\r\n\r\n return kTfLiteOk;\r\n}\r\n\r\nTfLiteStatus SoftmaxEvalCEVA(TfLiteContext* context, TfLiteNode* node) {\r\n const TfLiteEvalTensor* input = tflite::micro::GetEvalInput(context, node, 0);\r\n TfLiteEvalTensor* output = tflite::micro::GetEvalOutput(context, node, 0);\r\n\r\n TFLITE_DCHECK(node->user_data != nullptr);\r\n SoftmaxParams op_data = *static_cast<SoftmaxParams*>(node->user_data);\r\n\r\n switch (input->type) {\r\n case kTfLiteFloat32: {\r\n SoftmaxFloatCEVA(input, output, op_data);\r\n return kTfLiteOk;\r\n }\r\n case kTfLiteInt8:\r\n case kTfLiteUInt8:\r\n case kTfLiteInt16: {\r\n return SoftmaxQuantizedCEVA(context, input, output, op_data);\r\n }\r\n default:\r\n TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\r\n TfLiteTypeGetName(input->type), input->type);\r\n return kTfLiteError;\r\n }\r\n}\r\n\r\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\r\n#if defined(CEVA_BX1) || defined(CEVA_SP500)\r\n return SoftmaxEvalCEVA(context, node);\r\n#else\r\n return SoftmaxEval(context, node); \/\/ reference fallback\r\n#endif\r\n}\r\n} \/\/ namespace\r\n\r\nTfLiteRegistration Register_SOFTMAX() {\r\n return {\/*init=*\/SoftmaxInit,\r\n \/*free=*\/nullptr,\r\n \/*prepare=*\/SoftmaxPrepare,\r\n \/*invoke=*\/Eval,\r\n \/*profiling_string=*\/nullptr,\r\n \/*builtin_code=*\/0,\r\n \/*custom_name=*\/nullptr,\r\n \/*version=*\/0};\r\n}\r\n\r\n} \/\/ namespace tflite\r\n<commit_msg>fixed include path<commit_after>\/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.\r\n\r\nLicensed under the Apache License, Version 2.0 (the \"License\");\r\nyou may not use this file except in compliance with the License.\r\nYou may obtain a copy of the License at\r\n\r\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\r\n\r\nUnless required by applicable law or agreed to in writing, software\r\ndistributed under the License is distributed on an \"AS IS\" BASIS,\r\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\nSee the License for the specific language governing permissions and\r\nlimitations under the License.\r\n==============================================================================*\/\r\n\r\n#include \"tensorflow\/lite\/kernels\/internal\/reference\/softmax.h\"\r\n\r\n#include \"tensorflow\/lite\/c\/builtin_op_data.h\"\r\n#include \"tensorflow\/lite\/c\/common.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/common.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/quantization_util.h\"\r\n#include \"tensorflow\/lite\/kernels\/internal\/tensor_ctypes.h\"\r\n#include \"tensorflow\/lite\/kernels\/kernel_util.h\"\r\n#include \"tensorflow\/lite\/kernels\/op_macros.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/ceva\/ceva_tflm_lib.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/kernel_util.h\"\r\n#include \"tensorflow\/lite\/micro\/kernels\/softmax.h\"\r\n#ifdef MCPS_MEASUREMENT\r\n#include \"tensorflow\/lite\/micro\/kernels\/ceva\/mcps_macros.h\"\r\n#endif\r\n\r\n#if defined(CEVA_BX1) || defined(CEVA_SP500)\r\nextern int32_t* CEVA_TFLM_KERNELS_SCRATCH;\r\nextern int32_t CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL;\r\n#endif\r\n\r\nnamespace tflite {\r\nnamespace {\r\n\r\n\/\/ Takes a tensor and performs softmax along the last dimension.\r\nvoid SoftmaxFloatCEVA(const TfLiteEvalTensor* input, TfLiteEvalTensor* output,\r\n const SoftmaxParams& op_data) {\r\n const RuntimeShape& input_shape = tflite::micro::GetTensorShape(input);\r\n const float* input_data = tflite::micro::GetTensorData<float>(input);\r\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\r\n float* output_data = tflite::micro::GetTensorData<float>(output);\r\n\r\n const float beta = static_cast<float>(op_data.beta);\r\n const int trailing_dim = input_shape.DimensionsCount() - 1;\r\n const int outer_size =\r\n MatchingFlatSizeSkipDim(input_shape, trailing_dim, output_shape);\r\n const int depth =\r\n MatchingDim(input_shape, trailing_dim, output_shape, trailing_dim);\r\n int outer_size_mcps = outer_size;\r\n int depth_mcps = depth;\r\n\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_START_ONE;\r\n#endif\r\n for (int i = 0; i < outer_size; ++i) {\r\n CEVA_TFLM_Softmax_Float32(&input_data[i * depth], &output_data[i * depth],\r\n beta, depth);\r\n }\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_STOP_ONE(\r\n \"Test params:Call CEVA_TFLM_Softmax_Float32 %d times, inetrnal loop = %d\",\r\n outer_size_mcps, depth_mcps);\r\n#endif\r\n}\r\n\r\nTfLiteStatus SoftmaxQuantizedCEVA(TfLiteContext* context,\r\n const TfLiteEvalTensor* input,\r\n TfLiteEvalTensor* output,\r\n const SoftmaxParams& op_data) {\r\n if (input->type == kTfLiteUInt8) {\r\n tflite::reference_ops::Softmax(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<uint8_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<uint8_t>(output));\r\n } else if (input->type == kTfLiteInt8) {\r\n if (output->type == kTfLiteInt16) {\r\n tflite::reference_ops::Softmax(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<int8_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<int16_t>(output));\r\n } else {\r\n const RuntimeShape& input_shape = tflite::micro::GetTensorShape(input);\r\n const int8_t* input_data = tflite::micro::GetTensorData<int8_t>(input);\r\n\r\n const RuntimeShape& output_shape = tflite::micro::GetTensorShape(output);\r\n int8_t* output_data = tflite::micro::GetTensorData<int8_t>(output);\r\n\r\n const int32_t input_beta_multiplier =\r\n static_cast<int32_t>(op_data.input_multiplier);\r\n const int32_t input_beta_left_shift =\r\n static_cast<int32_t>(op_data.input_left_shift);\r\n const int trailing_dim = input_shape.DimensionsCount() - 1;\r\n const int outer_size =\r\n MatchingFlatSizeSkipDim(input_shape, trailing_dim, output_shape);\r\n const int depth =\r\n MatchingDim(input_shape, trailing_dim, output_shape, trailing_dim);\r\n int outer_size_mcps = outer_size;\r\n int depth_mcps = depth;\r\n\r\n if (depth > CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL) {\r\n TF_LITE_KERNEL_LOG(context, \"Scratch size (%d) less that required (%d)\",\r\n CEVA_TFLM_KERNELS_SCRATCH_SIZE_VAL, depth);\r\n return kTfLiteError;\r\n }\r\n\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_START_ONE;\r\n#endif\r\n for (int i = 0; i < outer_size; ++i) {\r\n CEVA_TFLM_Softmax_Int8(&input_data[i * depth], &output_data[i * depth],\r\n input_beta_multiplier, input_beta_left_shift,\r\n depth, CEVA_TFLM_KERNELS_SCRATCH);\r\n }\r\n#ifdef MCPS_MEASUREMENT\r\n MCPS_STOP_ONE(\r\n \"Test params:Call CEVA_TFLM_Softmax_Int8 %d times, inetrnal loop = \"\r\n \"%d\",\r\n outer_size_mcps, depth_mcps);\r\n#endif\r\n }\r\n } else {\r\n tflite::reference_ops::SoftmaxInt16(\r\n op_data, tflite::micro::GetTensorShape(input),\r\n tflite::micro::GetTensorData<int16_t>(input),\r\n tflite::micro::GetTensorShape(output),\r\n tflite::micro::GetTensorData<int16_t>(output));\r\n }\r\n\r\n return kTfLiteOk;\r\n}\r\n\r\nTfLiteStatus SoftmaxEvalCEVA(TfLiteContext* context, TfLiteNode* node) {\r\n const TfLiteEvalTensor* input = tflite::micro::GetEvalInput(context, node, 0);\r\n TfLiteEvalTensor* output = tflite::micro::GetEvalOutput(context, node, 0);\r\n\r\n TFLITE_DCHECK(node->user_data != nullptr);\r\n SoftmaxParams op_data = *static_cast<SoftmaxParams*>(node->user_data);\r\n\r\n switch (input->type) {\r\n case kTfLiteFloat32: {\r\n SoftmaxFloatCEVA(input, output, op_data);\r\n return kTfLiteOk;\r\n }\r\n case kTfLiteInt8:\r\n case kTfLiteUInt8:\r\n case kTfLiteInt16: {\r\n return SoftmaxQuantizedCEVA(context, input, output, op_data);\r\n }\r\n default:\r\n TF_LITE_KERNEL_LOG(context, \"Type %s (%d) not supported.\",\r\n TfLiteTypeGetName(input->type), input->type);\r\n return kTfLiteError;\r\n }\r\n}\r\n\r\nTfLiteStatus Eval(TfLiteContext* context, TfLiteNode* node) {\r\n#if defined(CEVA_BX1) || defined(CEVA_SP500)\r\n return SoftmaxEvalCEVA(context, node);\r\n#else\r\n return SoftmaxEval(context, node); \/\/ reference fallback\r\n#endif\r\n}\r\n} \/\/ namespace\r\n\r\nTfLiteRegistration Register_SOFTMAX() {\r\n return {\/*init=*\/SoftmaxInit,\r\n \/*free=*\/nullptr,\r\n \/*prepare=*\/SoftmaxPrepare,\r\n \/*invoke=*\/Eval,\r\n \/*profiling_string=*\/nullptr,\r\n \/*builtin_code=*\/0,\r\n \/*custom_name=*\/nullptr,\r\n \/*version=*\/0};\r\n}\r\n\r\n} \/\/ namespace tflite\r\n<|endoftext|>"} {"text":"<commit_before>\/*\n * caosVM.cpp\n * openc2e\n *\n * Created by Alyssa Milburn on Tue May 25 2004.\n * Copyright (c) 2004 Alyssa Milburn. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n\n#include \"caosVM.h\"\n#include \"openc2e.h\"\n#include \"World.h\"\n#include \"bytecode.h\"\n#include \"caosScript.h\"\n#include <iostream>\n\n#include <boost\/format.hpp>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\n\nvoid dumpStack(caosVM *vm) {\n\tstd::cerr << \"\\tvalueStack: \";\n\tint i, c = 0;\n\tfor (i = vm->valueStack.size() - 1; i >= 0 && c++ < 5; i--)\n\t\tstd::cerr << vm->valueStack[i].dump() << \" | \";\n\tif (i >= 0)\n\t\tstd::cerr << \"...\";\n\telse\n\t\tstd::cerr << \"END\";\n\tstd::cerr << std::endl;\n}\n\ncaosVM::caosVM(const AgentRef &o)\n\t: vm(this)\n{\n\towner = o;\n\tcurrentscript.reset();\n\tcip = nip = 0;\n\tblocking = NULL;\n\tinputstream = 0; outputstream = 0;\n\tresetCore();\n\ttrace = false;\n}\n\ncaosVM::~caosVM() {\n\tresetCore(); \/\/ delete blocking, close streams\n}\n\nbool caosVM::isBlocking() {\n\tif (!blocking) return false;\n\tbool bl = (*blocking)();\n\tif (!bl) {\n\t\tdelete blocking;\n\t\tblocking = NULL;\n\t}\n\treturn bl;\n}\n\nvoid caosVM::startBlocking(blockCond *whileWhat) {\n\tif (!owner)\n\t\t\/\/ TODO: should this just fail to block?\n\t\tthrow creaturesException(\"trying to block in a non-blockable script\");\n\tinst = false;\n\tif (blocking)\n\t\tthrow creaturesException(\"trying to block with a block condition in-place\");\n\tblocking = whileWhat;\n}\n\ninline void caosVM::safeJMP(int dest) {\n\/\/\tstd::cerr << \"jmp from \" << cip << \" to \" << dest << \"(old nip = \" << nip << \") in script of length \" << currentscript->scriptLength() << std::endl;\n\tif (dest < 0) {\n\t\tstd::cerr << currentscript->dump();\n\t\tthrow caosException(boost::str(boost::format(\"Internal error: Unrelocated jump at %08x\") % cip));\n\t}\n\tif (dest >= currentscript->scriptLength()) {\n\t\tstd::cerr << currentscript->dump();\n\t\tthrow creaturesException(boost::str(boost::format(\"Internal error: Jump out of bounds at %08x\") % cip));\n\t}\n\tnip = dest;\n}\n\ninline void caosVM::invoke_cmd(script *s, bool is_saver, int opidx) {\n\tconst cmdinfo *ci = s->dialect->getcmd(opidx);\n\t\/\/ We subtract two here to account for a) the missing return, and b)\n\t\/\/ consuming the new value.\n\tint stackdelta = ci->stackdelta - (is_saver ? 2 : 0);\n\tunsigned int stackstart = valueStack.size();\n\tassert(result.isNull());\n#ifndef VCPP_BROKENNESS\n\tif (is_saver)\n\t\t(this->*(ci->savehandler))();\n\telse\n\t\t(this->*(ci->handler))();\n#else\n\tif (is_saver)\n\t\tdispatchCAOS(this, ci->savehandler_idx);\n\telse\n\t\tdispatchCAOS(this, ci->handler_idx);\n#endif\n\tif (!is_saver && !result.isNull()) {\n\t\tvalueStack.push_back(result);\n\t\tresult.reset();\n\t} else {\n\t\tassert(result.isNull());\n\t}\n\tif (stackdelta < INT_MAX - 1) {\n\t\tif ((int)stackstart + stackdelta != (int)valueStack.size()) {\n\t\t\tdumpStack(this);\n\t\t\tthrow caosException(\"Stack imbalance detected\");\n\t\t}\n\t}\n}\n\ninline void caosVM::runOpCore(script *s, caosOp op) {\n\tswitch (op.opcode) {\n\t\tcase CAOS_NOP: break;\n\t\tcase CAOS_DIE:\n\t\t\t{\n\t\t\t\tint idx = op.argument;\n\t\t\t\tstd::string err = \"aborted\";\n\t\t\t\tcaosVar constVal = s->getConstant(idx);\n\t\t\t\tif (constVal.hasString())\n\t\t\t\t\terr = constVal.getString();\n\t\t\t\tthrow creaturesException(err);\n\t\t\t}\n\t\tcase CAOS_STOP:\n\t\t\t{\n\t\t\t\tstop();\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_SAVE_CMD:\n\t\t\t{\n\t\t\t\tinvoke_cmd(s, true, op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CMD:\n\t\t\t{\n\t\t\t\tinvoke_cmd(s, false, op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_YIELD:\n\t\t\t{\n#ifndef NDEBUG\n\t\t\t\t\/\/ This condition can arise as a result of bad save data,\n\t\t\t\t\/\/ so an assert is not appropriate... or is it?\n\t\t\t\t\/\/\n\t\t\t\t\/\/ In any case, it is mostly harmless but should never occur,\n\t\t\t\t\/\/ as it indicates a bug in the CAOS compiler.\n\t\t\t\tcaos_assert(auxStack.size() == 0);\n#endif\n\t\t\t\tif (!inst)\n\t\t\t\t\ttimeslice -= op.argument;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_COND:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v2);\n\t\t\t\tVM_PARAM_VALUE(v1);\n\t\t\t\tVM_PARAM_INTEGER(condaccum);\n\t\t\t\tassert(!v1.isEmpty());\n\t\t\t\tassert(!v2.isEmpty());\n\t\t\t\tint condition = op.argument;\n\t\t\t\tif (condition & CAND) condition -= CAND;\n\t\t\t\tif (condition & COR) condition -= COR;\n\t\t\t\tint result = 0;\n\t\t\t\tif (condition == CEQ)\n\t\t\t\t\tresult = (v1 == v2);\n\t\t\t\tif (condition == CNE)\n\t\t\t\t\tresult = !(v1 == v2);\n\t\t\t\t\n\t\t\t\tif (condition == CLT)\n\t\t\t\t\tresult = (v1 < v2);\n\t\t\t\tif (condition == CGE)\n\t\t\t\t\tresult = !(v1 < v2);\n\t\t\t\tif (condition == CGT)\n\t\t\t\t\tresult = (v1 > v2);\n\t\t\t\tif (condition == CLE)\n\t\t\t\t\tresult = !(v1 > v2);\n\n\t\t\t\tif (condition == CBT) {\n\t\t\t\t\tcaos_assert(v1.hasInt() && v2.hasInt());\n\t\t\t\t\tresult = (v2.getInt() == v1.getInt() & v2.getInt());\n\t\t\t\t}\n\t\t\t\tif (condition == CBF) {\n\t\t\t\t\tcaos_assert(v1.hasInt() && v2.hasInt());\n\t\t\t\t\tresult = (0 == v1.getInt() & v2.getInt());\n\t\t\t\t}\n\t\t\t\tif (op.argument & CAND)\n\t\t\t\t\tresult = (condaccum && result);\n\t\t\t\telse\n\t\t\t\t\tresult = (condaccum || result);\n\t\t\t\tvalueStack.push_back(caosVar(result));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CONST:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(s->getConstant(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CONSTINT:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(caosVar(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_BYTESTR:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(s->getBytestr(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_PUSH_AUX:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument < (int)valueStack.size());\n\t\t\t\tauxStack.push_back(valueStack[valueStack.size() - op.argument - 1]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_RESTORE_AUX:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument <= (int)auxStack.size());\n\t\t\t\tfor (int i = 0; i < op.argument; i++) {\n\t\t\t\t\tvalueStack.push_back(auxStack.back());\n\t\t\t\t\tauxStack.pop_back();\n\t\t\t\t}\t\n\t\t\t\tbreak;\t\t\t\t\n\t\t\t}\n\t\tcase CAOS_STACK_ROT:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument < (int)valueStack.size());\n\t\t\t\tfor (int i = 0; i < op.argument; i++) {\n\t\t\t\t\tint top = valueStack.size() - 1;\n\t\t\t\t\tstd::swap(valueStack[top - i], valueStack[top - i - 1]);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CJMP:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v);\n\t\t\t\tif (v.getInt() != 0)\n\t\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_JMP:\n\t\t\t{\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_DECJNZ:\n\t\t\t{\n\t\t\t\tVM_PARAM_INTEGER(counter);\n\t\t\t\tcounter--;\n\t\t\t\tif (counter) {\n\t\t\t\t\tsafeJMP(op.argument);\n\t\t\t\t\tvalueStack.push_back(caosVar(counter));\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_GSUB:\n\t\t\t{\n\t\t\t\tcallStack.push_back(callStackItem());\n\t\t\t\tcallStack.back().nip = nip;\n\t\t\t\tcallStack.back().valueStack.swap(valueStack);\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\t\t\t\t\n\t\t\t}\n\t\tcase CAOS_ENUMPOP:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v);\n\t\t\t\tif (v.isEmpty())\n\t\t\t\t\tbreak;\n\t\t\t\tif (!v.hasAgent()) {\n\t\t\t\t\tdumpStack(this);\n\t\t\t\t\tthrow caosException(std::string(\"Stack item type mismatch: \") + v.dump());\n\t\t\t\t}\n\t\t\t\ttarg = v.getAgentRef();\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tdefault:\n\t\t\tthrow creaturesException(boost::str(boost::format(\"Illegal opcode %d\") % (int)op.opcode));\n\t}\n}\n\ninline void caosVM::runOp() {\n\tcip = nip;\n\tnip++;\n\t\n\trunops++;\n\tif (runops > 1000000) throw creaturesException(\"script exceeded 1m ops\");\n\n\tshared_ptr<script> scr = currentscript;\n\tcaosOp op = currentscript->getOp(cip);\n\t\n\ttry {\n\t\tif (trace) {\n\t\t\tstd::cerr\n\t\t\t\t<< boost::str(boost::format(\"optrace(%s): INST=%d TS=%d %p @%08d top=%s depth=%d \") % scr->filename.c_str() % (int)inst % (int)timeslice % (void *)this % cip % (valueStack.empty() ? std::string(\"(empty)\") : valueStack.back().dump()) % valueStack.size())\n\t\t\t\t<< dumpOp(currentscript->dialect, op) << std::endl;\n\t\t\tif (trace >= 2) {\n\t\t\t\tdumpStack(this);\n\t\t\t}\n\t\t}\n\t\trunOpCore(scr.get(), op);\n\t} catch (caosException &e) {\n\t\te.trace(currentscript, op.traceindex);\n\t\tstop();\n\t\tthrow;\n\t} catch (creaturesException &e) {\n\t\tstop();\n\t\tthrow;\n\t}\n\t\n}\n\nvoid caosVM::stop() {\n\tlock = false;\n\tcurrentscript.reset();\n}\n\nvoid caosVM::runEntirely(shared_ptr<script> s) {\n\t\/\/ caller is responsible for resetting\/setting *all* state!\n\tcip = nip = runops = 0;\n\tcurrentscript = s;\n\n\twhile (true) {\n\t\trunOp();\n\t\tif (!currentscript) break;\n\t\tif (blocking) {\n\t\t\tdelete blocking;\n\t\t\tblocking = NULL;\n\t\t\tthrow creaturesException(\"blocking in an installation script\");\n\t\t}\n\t}\n}\n\nbool caosVM::fireScript(shared_ptr<script> s, bool nointerrupt, Agent *frm) {\n\tassert(owner);\n\tassert(s);\n\tif (lock) return false; \/\/ can't interrupt scripts which called LOCK\n\tif (currentscript && nointerrupt) return false; \/\/ don't interrupt scripts with a timer script\n\n\tresetScriptState();\n\tcurrentscript = s;\n\ttarg = owner;\n\tfrom.setAgent(frm);\n\ttimeslice = 1;\n\treturn true;\n}\n\nvoid caosVM::resetScriptState() {\n\tstop();\n\tresetCore();\n}\n\nvoid caosVM::resetCore() {\n\tif (blocking)\n\t\tdelete blocking;\n\tblocking = NULL;\n\tresult.reset();\n\t\n\tvalueStack.clear();\n\tauxStack.clear();\n\tcallStack.clear();\n\n\tinst = lock = 0;\n\ttimeslice = 0;\n\n\tc_FILE_ICLO(); \/\/ make sure input stream is freed\n\tinputstream = 0; \/\/ .. possibly not strictly necessary, when all is bugfree\n\tc_FILE_OCLO(); \/\/ make sure output stream is freed\n\toutputstream = 0;\n\n\t_it_ = NULL;\n\tfrom.setAgent(NULL);\n\tsetTarg(owner);\n\tpart = 0;\n\n\t_p_[0].reset(); _p_[0].setInt(0); _p_[1].reset(); _p_[1].setInt(0);\n\tfor (unsigned int i = 0; i < 100; i++) { var[i].reset(); var[i].setInt(0); }\n\n\tcamera.reset();\n\n\ttrace = 0;\n\tcip = nip = runops = 0;\n}\n\nvoid caosVM::tick() {\n\tstop_loop = false;\n\trunops = 0;\n\twhile (currentscript && !stop_loop && (timeslice > 0 || inst)) {\n\t\tif (isBlocking()) return;\n\t\trunOp();\n\t}\n}\n\nvoid caosVM::dummy_cmd() {\n\t\/\/ no-op\n}\n\/* vim: set noet: *\/\n<commit_msg>make the VM stack imbalance error a bit more informative<commit_after>\/*\n * caosVM.cpp\n * openc2e\n *\n * Created by Alyssa Milburn on Tue May 25 2004.\n * Copyright (c) 2004 Alyssa Milburn. All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n *\/\n\n#include \"caosVM.h\"\n#include \"openc2e.h\"\n#include \"World.h\"\n#include \"bytecode.h\"\n#include \"caosScript.h\"\n#include <iostream>\n\n#include <boost\/format.hpp>\n\nusing std::cout;\nusing std::cerr;\nusing std::endl;\n\nvoid dumpStack(caosVM *vm) {\n\tstd::cerr << \"\\tvalueStack: \";\n\tint i, c = 0;\n\tfor (i = vm->valueStack.size() - 1; i >= 0 && c++ < 5; i--)\n\t\tstd::cerr << vm->valueStack[i].dump() << \" | \";\n\tif (i >= 0)\n\t\tstd::cerr << \"...\";\n\telse\n\t\tstd::cerr << \"END\";\n\tstd::cerr << std::endl;\n}\n\ncaosVM::caosVM(const AgentRef &o)\n\t: vm(this)\n{\n\towner = o;\n\tcurrentscript.reset();\n\tcip = nip = 0;\n\tblocking = NULL;\n\tinputstream = 0; outputstream = 0;\n\tresetCore();\n\ttrace = false;\n}\n\ncaosVM::~caosVM() {\n\tresetCore(); \/\/ delete blocking, close streams\n}\n\nbool caosVM::isBlocking() {\n\tif (!blocking) return false;\n\tbool bl = (*blocking)();\n\tif (!bl) {\n\t\tdelete blocking;\n\t\tblocking = NULL;\n\t}\n\treturn bl;\n}\n\nvoid caosVM::startBlocking(blockCond *whileWhat) {\n\tif (!owner)\n\t\t\/\/ TODO: should this just fail to block?\n\t\tthrow creaturesException(\"trying to block in a non-blockable script\");\n\tinst = false;\n\tif (blocking)\n\t\tthrow creaturesException(\"trying to block with a block condition in-place\");\n\tblocking = whileWhat;\n}\n\ninline void caosVM::safeJMP(int dest) {\n\/\/\tstd::cerr << \"jmp from \" << cip << \" to \" << dest << \"(old nip = \" << nip << \") in script of length \" << currentscript->scriptLength() << std::endl;\n\tif (dest < 0) {\n\t\tstd::cerr << currentscript->dump();\n\t\tthrow caosException(boost::str(boost::format(\"Internal error: Unrelocated jump at %08x\") % cip));\n\t}\n\tif (dest >= currentscript->scriptLength()) {\n\t\tstd::cerr << currentscript->dump();\n\t\tthrow creaturesException(boost::str(boost::format(\"Internal error: Jump out of bounds at %08x\") % cip));\n\t}\n\tnip = dest;\n}\n\ninline void caosVM::invoke_cmd(script *s, bool is_saver, int opidx) {\n\tconst cmdinfo *ci = s->dialect->getcmd(opidx);\n\t\/\/ We subtract two here to account for a) the missing return, and b)\n\t\/\/ consuming the new value.\n\tint stackdelta = ci->stackdelta - (is_saver ? 2 : 0);\n\tunsigned int stackstart = valueStack.size();\n\tassert(result.isNull());\n#ifndef VCPP_BROKENNESS\n\tif (is_saver)\n\t\t(this->*(ci->savehandler))();\n\telse\n\t\t(this->*(ci->handler))();\n#else\n\tif (is_saver)\n\t\tdispatchCAOS(this, ci->savehandler_idx);\n\telse\n\t\tdispatchCAOS(this, ci->handler_idx);\n#endif\n\tif (!is_saver && !result.isNull()) {\n\t\tvalueStack.push_back(result);\n\t\tresult.reset();\n\t} else {\n\t\tassert(result.isNull());\n\t}\n\tif (stackdelta < INT_MAX - 1) {\n\t\tif ((int)stackstart + stackdelta != (int)valueStack.size()) {\n\t\t\tdumpStack(this);\n\t\t\tthrow caosException(boost::str(boost::format(\"Internal error: Stack imbalance detected: expected to be %d after start of %d, but stack size is now %d\") % stackdelta % (int)stackstart % (int)valueStack.size()));\n\t\t}\n\t}\n}\n\ninline void caosVM::runOpCore(script *s, caosOp op) {\n\tswitch (op.opcode) {\n\t\tcase CAOS_NOP: break;\n\t\tcase CAOS_DIE:\n\t\t\t{\n\t\t\t\tint idx = op.argument;\n\t\t\t\tstd::string err = \"aborted\";\n\t\t\t\tcaosVar constVal = s->getConstant(idx);\n\t\t\t\tif (constVal.hasString())\n\t\t\t\t\terr = constVal.getString();\n\t\t\t\tthrow creaturesException(err);\n\t\t\t}\n\t\tcase CAOS_STOP:\n\t\t\t{\n\t\t\t\tstop();\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_SAVE_CMD:\n\t\t\t{\n\t\t\t\tinvoke_cmd(s, true, op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CMD:\n\t\t\t{\n\t\t\t\tinvoke_cmd(s, false, op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_YIELD:\n\t\t\t{\n#ifndef NDEBUG\n\t\t\t\t\/\/ This condition can arise as a result of bad save data,\n\t\t\t\t\/\/ so an assert is not appropriate... or is it?\n\t\t\t\t\/\/\n\t\t\t\t\/\/ In any case, it is mostly harmless but should never occur,\n\t\t\t\t\/\/ as it indicates a bug in the CAOS compiler.\n\t\t\t\tcaos_assert(auxStack.size() == 0);\n#endif\n\t\t\t\tif (!inst)\n\t\t\t\t\ttimeslice -= op.argument;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_COND:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v2);\n\t\t\t\tVM_PARAM_VALUE(v1);\n\t\t\t\tVM_PARAM_INTEGER(condaccum);\n\t\t\t\tassert(!v1.isEmpty());\n\t\t\t\tassert(!v2.isEmpty());\n\t\t\t\tint condition = op.argument;\n\t\t\t\tif (condition & CAND) condition -= CAND;\n\t\t\t\tif (condition & COR) condition -= COR;\n\t\t\t\tint result = 0;\n\t\t\t\tif (condition == CEQ)\n\t\t\t\t\tresult = (v1 == v2);\n\t\t\t\tif (condition == CNE)\n\t\t\t\t\tresult = !(v1 == v2);\n\t\t\t\t\n\t\t\t\tif (condition == CLT)\n\t\t\t\t\tresult = (v1 < v2);\n\t\t\t\tif (condition == CGE)\n\t\t\t\t\tresult = !(v1 < v2);\n\t\t\t\tif (condition == CGT)\n\t\t\t\t\tresult = (v1 > v2);\n\t\t\t\tif (condition == CLE)\n\t\t\t\t\tresult = !(v1 > v2);\n\n\t\t\t\tif (condition == CBT) {\n\t\t\t\t\tcaos_assert(v1.hasInt() && v2.hasInt());\n\t\t\t\t\tresult = (v2.getInt() == v1.getInt() & v2.getInt());\n\t\t\t\t}\n\t\t\t\tif (condition == CBF) {\n\t\t\t\t\tcaos_assert(v1.hasInt() && v2.hasInt());\n\t\t\t\t\tresult = (0 == v1.getInt() & v2.getInt());\n\t\t\t\t}\n\t\t\t\tif (op.argument & CAND)\n\t\t\t\t\tresult = (condaccum && result);\n\t\t\t\telse\n\t\t\t\t\tresult = (condaccum || result);\n\t\t\t\tvalueStack.push_back(caosVar(result));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CONST:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(s->getConstant(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CONSTINT:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(caosVar(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_BYTESTR:\n\t\t\t{\n\t\t\t\tvalueStack.push_back(vmStackItem(s->getBytestr(op.argument)));\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_PUSH_AUX:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument < (int)valueStack.size());\n\t\t\t\tauxStack.push_back(valueStack[valueStack.size() - op.argument - 1]);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_RESTORE_AUX:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument <= (int)auxStack.size());\n\t\t\t\tfor (int i = 0; i < op.argument; i++) {\n\t\t\t\t\tvalueStack.push_back(auxStack.back());\n\t\t\t\t\tauxStack.pop_back();\n\t\t\t\t}\t\n\t\t\t\tbreak;\t\t\t\t\n\t\t\t}\n\t\tcase CAOS_STACK_ROT:\n\t\t\t{\n\t\t\t\tcaos_assert(op.argument >= 0);\n\t\t\t\tcaos_assert(op.argument < (int)valueStack.size());\n\t\t\t\tfor (int i = 0; i < op.argument; i++) {\n\t\t\t\t\tint top = valueStack.size() - 1;\n\t\t\t\t\tstd::swap(valueStack[top - i], valueStack[top - i - 1]);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_CJMP:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v);\n\t\t\t\tif (v.getInt() != 0)\n\t\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_JMP:\n\t\t\t{\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_DECJNZ:\n\t\t\t{\n\t\t\t\tVM_PARAM_INTEGER(counter);\n\t\t\t\tcounter--;\n\t\t\t\tif (counter) {\n\t\t\t\t\tsafeJMP(op.argument);\n\t\t\t\t\tvalueStack.push_back(caosVar(counter));\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\tcase CAOS_GSUB:\n\t\t\t{\n\t\t\t\tcallStack.push_back(callStackItem());\n\t\t\t\tcallStack.back().nip = nip;\n\t\t\t\tcallStack.back().valueStack.swap(valueStack);\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\t\t\t\t\n\t\t\t}\n\t\tcase CAOS_ENUMPOP:\n\t\t\t{\n\t\t\t\tVM_PARAM_VALUE(v);\n\t\t\t\tif (v.isEmpty())\n\t\t\t\t\tbreak;\n\t\t\t\tif (!v.hasAgent()) {\n\t\t\t\t\tdumpStack(this);\n\t\t\t\t\tthrow caosException(std::string(\"Stack item type mismatch: \") + v.dump());\n\t\t\t\t}\n\t\t\t\ttarg = v.getAgentRef();\n\t\t\t\tsafeJMP(op.argument);\n\t\t\t\tbreak;\n\t\t\t}\n\t\tdefault:\n\t\t\tthrow creaturesException(boost::str(boost::format(\"Illegal opcode %d\") % (int)op.opcode));\n\t}\n}\n\ninline void caosVM::runOp() {\n\tcip = nip;\n\tnip++;\n\t\n\trunops++;\n\tif (runops > 1000000) throw creaturesException(\"script exceeded 1m ops\");\n\n\tshared_ptr<script> scr = currentscript;\n\tcaosOp op = currentscript->getOp(cip);\n\t\n\ttry {\n\t\tif (trace) {\n\t\t\tstd::cerr\n\t\t\t\t<< boost::str(boost::format(\"optrace(%s): INST=%d TS=%d %p @%08d top=%s depth=%d \") % scr->filename.c_str() % (int)inst % (int)timeslice % (void *)this % cip % (valueStack.empty() ? std::string(\"(empty)\") : valueStack.back().dump()) % valueStack.size())\n\t\t\t\t<< dumpOp(currentscript->dialect, op) << std::endl;\n\t\t\tif (trace >= 2) {\n\t\t\t\tdumpStack(this);\n\t\t\t}\n\t\t}\n\t\trunOpCore(scr.get(), op);\n\t} catch (caosException &e) {\n\t\te.trace(currentscript, op.traceindex);\n\t\tstop();\n\t\tthrow;\n\t} catch (creaturesException &e) {\n\t\tstop();\n\t\tthrow;\n\t}\n\t\n}\n\nvoid caosVM::stop() {\n\tlock = false;\n\tcurrentscript.reset();\n}\n\nvoid caosVM::runEntirely(shared_ptr<script> s) {\n\t\/\/ caller is responsible for resetting\/setting *all* state!\n\tcip = nip = runops = 0;\n\tcurrentscript = s;\n\n\twhile (true) {\n\t\trunOp();\n\t\tif (!currentscript) break;\n\t\tif (blocking) {\n\t\t\tdelete blocking;\n\t\t\tblocking = NULL;\n\t\t\tthrow creaturesException(\"blocking in an installation script\");\n\t\t}\n\t}\n}\n\nbool caosVM::fireScript(shared_ptr<script> s, bool nointerrupt, Agent *frm) {\n\tassert(owner);\n\tassert(s);\n\tif (lock) return false; \/\/ can't interrupt scripts which called LOCK\n\tif (currentscript && nointerrupt) return false; \/\/ don't interrupt scripts with a timer script\n\n\tresetScriptState();\n\tcurrentscript = s;\n\ttarg = owner;\n\tfrom.setAgent(frm);\n\ttimeslice = 1;\n\treturn true;\n}\n\nvoid caosVM::resetScriptState() {\n\tstop();\n\tresetCore();\n}\n\nvoid caosVM::resetCore() {\n\tif (blocking)\n\t\tdelete blocking;\n\tblocking = NULL;\n\tresult.reset();\n\t\n\tvalueStack.clear();\n\tauxStack.clear();\n\tcallStack.clear();\n\n\tinst = lock = 0;\n\ttimeslice = 0;\n\n\tc_FILE_ICLO(); \/\/ make sure input stream is freed\n\tinputstream = 0; \/\/ .. possibly not strictly necessary, when all is bugfree\n\tc_FILE_OCLO(); \/\/ make sure output stream is freed\n\toutputstream = 0;\n\n\t_it_ = NULL;\n\tfrom.setAgent(NULL);\n\tsetTarg(owner);\n\tpart = 0;\n\n\t_p_[0].reset(); _p_[0].setInt(0); _p_[1].reset(); _p_[1].setInt(0);\n\tfor (unsigned int i = 0; i < 100; i++) { var[i].reset(); var[i].setInt(0); }\n\n\tcamera.reset();\n\n\ttrace = 0;\n\tcip = nip = runops = 0;\n}\n\nvoid caosVM::tick() {\n\tstop_loop = false;\n\trunops = 0;\n\twhile (currentscript && !stop_loop && (timeslice > 0 || inst)) {\n\t\tif (isBlocking()) return;\n\t\trunOp();\n\t}\n}\n\nvoid caosVM::dummy_cmd() {\n\t\/\/ no-op\n}\n\/* vim: set noet: *\/\n<|endoftext|>"} {"text":"<commit_before>\/\/ Test for \"sancov.py missing ...\".\n\n\/\/ First case: coverage from executable. main() is called on every code path.\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s -o %t -DFOOBAR -DMAIN\n\/\/ RUN: rm -rf %T\/coverage-missing\n\/\/ RUN: mkdir -p %T\/coverage-missing\n\/\/ RUN: cd %T\/coverage-missing\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t\n\/\/ RUN: %sancov print *.sancov > main.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 1 < main.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x\n\/\/ RUN: %sancov print *.sancov > foo.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 3 < foo.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x x\n\/\/ RUN: %sancov print *.sancov > bar.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 4 < bar.txt\n\/\/ RUN: %sancov missing %t < foo.txt > foo-missing.txt\n\/\/ RUN: sort main.txt foo-missing.txt -o foo-missing-with-main.txt\n\/\/ The \"missing from foo\" set may contain a few bogus PCs from the sanitizer\n\/\/ runtime, but it must include the entire \"bar\" code path as a subset. Sorted\n\/\/ lists can be tested for set inclusion with diff + grep.\n\/\/ RUN: ( diff bar.txt foo-missing-with-main.txt || true ) | not grep \"^<\"\n\n\/\/ Second case: coverage from DSO.\n\/\/ cd %T\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s -o %dynamiclib -DFOOBAR -shared -fPIC\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s %dynamiclib -o %t -DMAIN\n\/\/ RUN: export LIBNAME=`basename %dynamiclib`\n\/\/ RUN: rm -rf %T\/coverage-missing\n\/\/ RUN: mkdir -p %T\/coverage-missing\n\/\/ RUN: cd %T\/coverage-missing\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x\n\/\/ RUN: %sancov print $LIBNAME.*.sancov > foo.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 2 < foo.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x x\n\/\/ RUN: %sancov print $LIBNAME.*.sancov > bar.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 3 < bar.txt\n\/\/ RUN: %sancov missing %dynamiclib < foo.txt > foo-missing.txt\n\/\/ RUN: ( diff bar.txt foo-missing.txt || true ) | not grep \"^<\"\n\n\/\/ REQUIRES: x86-target-arch\n\/\/ XFAIL: android\n\n#include <stdio.h>\n\nvoid foo1();\nvoid foo2();\nvoid bar1();\nvoid bar2();\nvoid bar3();\n\n#if defined(FOOBAR)\nvoid foo1() { fprintf(stderr, \"foo1\\n\"); }\nvoid foo2() { fprintf(stderr, \"foo2\\n\"); }\n\nvoid bar1() { fprintf(stderr, \"bar1\\n\"); }\nvoid bar2() { fprintf(stderr, \"bar2\\n\"); }\nvoid bar3() { fprintf(stderr, \"bar3\\n\"); }\n#endif\n\n#if defined(MAIN)\nint main(int argc, char **argv) {\n switch (argc) {\n case 1:\n break;\n case 2:\n foo1();\n foo2();\n break;\n case 3:\n bar1();\n bar2();\n bar3();\n break;\n }\n}\n#endif\n<commit_msg>Avoid sub shell.<commit_after>\/\/ Test for \"sancov.py missing ...\".\n\n\/\/ First case: coverage from executable. main() is called on every code path.\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s -o %t -DFOOBAR -DMAIN\n\/\/ RUN: rm -rf %T\/coverage-missing\n\/\/ RUN: mkdir -p %T\/coverage-missing\n\/\/ RUN: cd %T\/coverage-missing\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t\n\/\/ RUN: %sancov print *.sancov > main.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 1 < main.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x\n\/\/ RUN: %sancov print *.sancov > foo.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 3 < foo.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x x\n\/\/ RUN: %sancov print *.sancov > bar.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 4 < bar.txt\n\/\/ RUN: %sancov missing %t < foo.txt > foo-missing.txt\n\/\/ RUN: sort main.txt foo-missing.txt -o foo-missing-with-main.txt\n\/\/ The \"missing from foo\" set may contain a few bogus PCs from the sanitizer\n\/\/ runtime, but it must include the entire \"bar\" code path as a subset. Sorted\n\/\/ lists can be tested for set inclusion with diff + grep.\n\/\/ RUN: diff bar.txt foo-missing-with-main.txt > %t.log || true\n\/\/ RUN: not grep \"^<\" %t.log\n\n\/\/ Second case: coverage from DSO.\n\/\/ cd %T\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s -o %dynamiclib -DFOOBAR -shared -fPIC\n\/\/ RUN: %clangxx_asan -fsanitize-coverage=func %s %dynamiclib -o %t -DMAIN\n\/\/ RUN: export LIBNAME=`basename %dynamiclib`\n\/\/ RUN: rm -rf %T\/coverage-missing\n\/\/ RUN: mkdir -p %T\/coverage-missing\n\/\/ RUN: cd %T\/coverage-missing\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x\n\/\/ RUN: %sancov print $LIBNAME.*.sancov > foo.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 2 < foo.txt\n\/\/ RUN: %env_asan_opts=coverage=1:coverage_dir=%T\/coverage-missing %run %t x x\n\/\/ RUN: %sancov print $LIBNAME.*.sancov > bar.txt\n\/\/ RUN: rm *.sancov\n\/\/ RUN: count 3 < bar.txt\n\/\/ RUN: %sancov missing %dynamiclib < foo.txt > foo-missing.txt\n\/\/ RUN: diff bar.txt foo-missing.txt > %t.log || true\n\/\/ RUN: not grep \"^<\" %t.log\n\n\/\/ REQUIRES: x86-target-arch\n\/\/ XFAIL: android\n\n#include <stdio.h>\n\nvoid foo1();\nvoid foo2();\nvoid bar1();\nvoid bar2();\nvoid bar3();\n\n#if defined(FOOBAR)\nvoid foo1() { fprintf(stderr, \"foo1\\n\"); }\nvoid foo2() { fprintf(stderr, \"foo2\\n\"); }\n\nvoid bar1() { fprintf(stderr, \"bar1\\n\"); }\nvoid bar2() { fprintf(stderr, \"bar2\\n\"); }\nvoid bar3() { fprintf(stderr, \"bar3\\n\"); }\n#endif\n\n#if defined(MAIN)\nint main(int argc, char **argv) {\n switch (argc) {\n case 1:\n break;\n case 2:\n foo1();\n foo2();\n break;\n case 3:\n bar1();\n bar2();\n bar3();\n break;\n }\n}\n#endif\n<|endoftext|>"} {"text":"<commit_before>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"core\/codegen\/passes\/weight_layout\/weight_layout.h\"\n\n#include \"core\/codegen\/common\/common.h\"\n#include \"core\/codegen\/common\/utils.h\"\n#include \"core\/codegen\/mti\/mti_tvm_utils.h\"\n#include \"core\/codegen\/passes\/utils\/ort_tvm_utils.h\"\n\nnamespace onnxruntime {\nnamespace tvm_codegen {\n\nstatic tvm::Tensor CreateTVMPlaceholder(\n const std::string& name,\n HalideIR::Type type,\n int dim) {\n tvm::Array<tvm::Expr> shape;\n if (dim > 0) {\n for (int i = 0; i < dim; ++i) {\n shape.push_back(tvm::Var(name + \"_v\" + std::to_string(i)));\n }\n } else {\n shape.push_back(1);\n }\n return tvm::placeholder(shape, type, name + \"_placeholder\");\n}\n\nconst std::string WeightLayout::GetKey(\n const std::string& name,\n ONNX_NAMESPACE::TensorProto_DataType proto_type,\n int input_dim,\n float pad_zero) {\n std::string key = name;\n key += \"_type_\" + std::to_string(static_cast<int>(proto_type));\n key += \"_dim_\" + input_dim;\n key += \"_pad_zero_\" + std::to_string(pad_zero);\n key = NormalizeCppName(key);\n return key;\n}\n\nWeightLayout::WeightLayout(\n const std::string& name,\n ONNX_NAMESPACE::TensorProto_DataType proto_type,\n int input_dim,\n float pad_zero)\n : name_(GetKey(name, proto_type, input_dim, pad_zero)),\n proto_type_(proto_type),\n input_dim_(input_dim),\n pad_zero_(pad_zero) {}\n\nconst std::string& WeightLayout::Name() const {\n return name_;\n}\n\nvoid WeightLayout::CreateLayoutMarshallingTVMOp(tvm::Array<tvm::Tensor>& inputs,\n tvm::Array<tvm::Tensor>& outputs) const {\n HalideIR::Type halide_type = ToTvmType(proto_type_);\n\n tvm::Tensor placeholder = CreateTVMPlaceholder(name_, halide_type, input_dim_);\n inputs.push_back(placeholder);\n\n tvm::Array<tvm::Expr> new_shape = ToActualShape(placeholder);\n CoordTransFunc new_coord_to_old_coord_func = ToNominal(placeholder);\n tvm::Expr pad_zero_expr = tvm::make_const(halide_type, pad_zero_);\n\n tvm::Tensor output = tvm::compute(\n new_shape,\n [&](const tvm::Array<tvm::Var>& output_coord) {\n tvm::Array<tvm::Expr> output_coord1;\n for (const auto& coord : output_coord)\n output_coord1.push_back(coord);\n auto input_coord = new_coord_to_old_coord_func(output_coord1);\n ORT_ENFORCE(input_coord.size() == placeholder->shape.size());\n\n if (input_coord.size() > 0) {\n auto in_range = (input_coord[0] >= 0) && (input_coord[0] < placeholder->shape[0]);\n for (size_t dim = 1; dim < input_coord.size(); ++dim)\n in_range = in_range && (input_coord[dim] >= 0) && (input_coord[dim] < placeholder->shape[dim]);\n\n return tvm::ir::Select::make(in_range, placeholder(input_coord), pad_zero_expr);\n } else {\n \/\/ scalar\n return placeholder(input_coord);\n }\n });\n\n outputs.push_back(output);\n}\n\n} \/\/ namespace tvm_codegen\n} \/\/ namespace onnxruntime\n<commit_msg>Nuphar: Fix a bug in weight layout where read may go out of bound (#2129)<commit_after>\/\/ Copyright (c) Microsoft Corporation. All rights reserved.\n\/\/ Licensed under the MIT License.\n\n#include \"core\/codegen\/passes\/weight_layout\/weight_layout.h\"\n\n#include \"core\/codegen\/common\/common.h\"\n#include \"core\/codegen\/common\/utils.h\"\n#include \"core\/codegen\/mti\/mti_tvm_utils.h\"\n#include \"core\/codegen\/passes\/utils\/ort_tvm_utils.h\"\n\nnamespace onnxruntime {\nnamespace tvm_codegen {\n\nstatic tvm::Tensor CreateTVMPlaceholder(\n const std::string& name,\n HalideIR::Type type,\n int dim) {\n tvm::Array<tvm::Expr> shape;\n if (dim > 0) {\n for (int i = 0; i < dim; ++i) {\n shape.push_back(tvm::Var(name + \"_v\" + std::to_string(i)));\n }\n } else {\n shape.push_back(1);\n }\n return tvm::placeholder(shape, type, name + \"_placeholder\");\n}\n\nconst std::string WeightLayout::GetKey(\n const std::string& name,\n ONNX_NAMESPACE::TensorProto_DataType proto_type,\n int input_dim,\n float pad_zero) {\n std::string key = name;\n key += \"_type_\" + std::to_string(static_cast<int>(proto_type));\n key += \"_dim_\" + input_dim;\n key += \"_pad_zero_\" + std::to_string(pad_zero);\n key = NormalizeCppName(key);\n return key;\n}\n\nWeightLayout::WeightLayout(\n const std::string& name,\n ONNX_NAMESPACE::TensorProto_DataType proto_type,\n int input_dim,\n float pad_zero)\n : name_(GetKey(name, proto_type, input_dim, pad_zero)),\n proto_type_(proto_type),\n input_dim_(input_dim),\n pad_zero_(pad_zero) {}\n\nconst std::string& WeightLayout::Name() const {\n return name_;\n}\n\nvoid WeightLayout::CreateLayoutMarshallingTVMOp(tvm::Array<tvm::Tensor>& inputs,\n tvm::Array<tvm::Tensor>& outputs) const {\n HalideIR::Type halide_type = ToTvmType(proto_type_);\n\n tvm::Tensor placeholder = CreateTVMPlaceholder(name_, halide_type, input_dim_);\n inputs.push_back(placeholder);\n\n tvm::Array<tvm::Expr> new_shape = ToActualShape(placeholder);\n CoordTransFunc new_coord_to_old_coord_func = ToNominal(placeholder);\n tvm::Expr pad_zero_expr = tvm::make_const(halide_type, pad_zero_);\n\n tvm::Tensor output = tvm::compute(\n new_shape,\n [&](const tvm::Array<tvm::Var>& output_coord) {\n tvm::Array<tvm::Expr> output_coord1;\n for (const auto& coord : output_coord)\n output_coord1.push_back(coord);\n auto input_coord = new_coord_to_old_coord_func(output_coord1);\n ORT_ENFORCE(input_coord.size() == placeholder->shape.size());\n\n if (input_coord.size() > 0) {\n auto in_range = (input_coord[0] >= 0) && (input_coord[0] < placeholder->shape[0]);\n for (size_t dim = 1; dim < input_coord.size(); ++dim)\n in_range = in_range && (input_coord[dim] >= 0) && (input_coord[dim] < placeholder->shape[dim]);\n\n return tvm::if_then_else(in_range, placeholder(input_coord), pad_zero_expr);\n } else {\n \/\/ scalar\n return placeholder(input_coord);\n }\n });\n\n outputs.push_back(output);\n}\n\n} \/\/ namespace tvm_codegen\n} \/\/ namespace onnxruntime\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Instruction.cpp\n *\n * Created on: 28 oct. 2017\n * Author: Matthieu\n *\/\n\n#include <Instruction.h>\n\nfloat defaultTemperature = 13.0;\nfloat instructedTemperature = 16.0;\nconst float Instruction::T_DIFF = 0.1;\ntime_t blimit = 0;\nTimer* Instruction::timer;\n\nInstruction::Instruction(Timer* timer, float defaultTemperature,\n\t\tfloat instructedTemperature, time_t limit) {\n\tthis->init(timer, defaultTemperature, instructedTemperature, limit);\n\n}\nInstruction::Instruction() {\n}\n\nInstruction::~Instruction() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nvoid Instruction::init(Timer* timer, float defaultTemperature,\n\t\tfloat instructedTemperature, time_t limit) {\n\tthis->setDefaultTemperature(defaultTemperature);\n\tInstruction::setTimer(timer);\n\tthis->setInstructedTemperature(instructedTemperature);\n\tthis->setLimit(limit);\n}\n\nvoid Instruction::setTimer(Timer* timer) {\n\tInstruction::timer = timer;\n}\n\nfloat Instruction::getDefaultTemperature() {\n\treturn defaultTemperature;\n}\nfloat Instruction::getInstructedTemperature() {\n\treturn instructedTemperature;\n}\ntime_t Instruction::getLimit() {\n\treturn limit;\n}\nvoid Instruction::setLimit(time_t limit_) {\n\tlimit = limit_;\n}\n\nvoid Instruction::setInstructedTemperature(float instructedTemperature_) {\n\tinstructedTemperature = instructedTemperature_;\n}\nvoid Instruction::setDefaultTemperature(float defaultTemperature_) {\n\tdefaultTemperature = defaultTemperature_;\n}\n\n\/*\n * Return a int between 0 and 5 included telling how much power we should give, in %, 5 being 100%, 0 being no heat needed.\n * see *_POWER static variables in Instruction class.\n *\/\n\nint Instruction::shouldHeat(DHTSmoother* dht) {\n\t\/\/handle two kind of instructions : cold and hot ones\n\t\/\/TODO the thinking is not done yet\n\tif (Instruction::timer->getEpochTime() <= getLimit()) {\n\t\treturn Instruction::compare(instructedTemperature,\n\t\t\t\tdht->readTemperature());\n\t} else {\n\t\treturn Instruction::compare(defaultTemperature, dht->readTemperature());\n\t}\n\n}\n\nint Instruction::compare(float instructed, float current) {\n\tif (current > instructed + Instruction::T_DIFF) {\n\t\treturn Instruction::NO_POWER;\n\t} else if (current > instructed) {\n\t\treturn Instruction::VERY_LOW_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF) {\n\t\treturn Instruction::LOW_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF * 2) {\n\t\treturn Instruction::MEDIUM_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF * 3) {\n\t\treturn Instruction::HIGH_POWER;\n\t} else {\n\t\treturn Instruction::FULL_POWER;\n\t}\n\t\/\/SHould not happen\n\treturn Instruction::NO_POWER;\n}\nbool Instruction::parseInstruction(const char*) {\n\treturn false;\n}\n\n<commit_msg>working, had an issue after several minutes of runningm need to investigate why<commit_after>\/*\n * Instruction.cpp\n *\n * Created on: 28 oct. 2017\n * Author: Matthieu\n *\/\n\n#include <Instruction.h>\n\nfloat defaultTemperature = 13.0;\nfloat instructedTemperature = 16.0;\nconst float Instruction::T_DIFF = 0.1;\ntime_t blimit = 0;\nTimer* Instruction::timer;\n\nInstruction::Instruction(Timer* timer, float defaultTemperature,\n\t\tfloat instructedTemperature, time_t limit) {\n\tthis->init(timer, defaultTemperature, instructedTemperature, limit);\n\n}\nInstruction::Instruction() {\n}\n\nInstruction::~Instruction() {\n\t\/\/ TODO Auto-generated destructor stub\n}\n\nvoid Instruction::init(Timer* timer, float defaultTemperature,\n\t\tfloat instructedTemperature, time_t limit) {\n\tthis->setDefaultTemperature(defaultTemperature);\n\tInstruction::setTimer(timer);\n\tthis->setInstructedTemperature(instructedTemperature);\n\tthis->setLimit(limit);\n}\n\nvoid Instruction::setTimer(Timer* timer) {\n\tInstruction::timer = timer;\n}\n\nfloat Instruction::getDefaultTemperature() {\n\treturn defaultTemperature;\n}\nfloat Instruction::getInstructedTemperature() {\n\treturn instructedTemperature;\n}\ntime_t Instruction::getLimit() {\n\treturn limit;\n}\nvoid Instruction::setLimit(time_t limit_) {\n\tlimit = limit_;\n}\n\nvoid Instruction::setInstructedTemperature(float instructedTemperature_) {\n\tinstructedTemperature = instructedTemperature_;\n}\nvoid Instruction::setDefaultTemperature(float defaultTemperature_) {\n\tdefaultTemperature = defaultTemperature_;\n}\n\n\/*\n * Return a int between 0 and 5 included telling how much power we should give, in %, 5 being 100%, 0 being no heat needed.\n * see *_POWER static variables in Instruction class.\n *\/\n\nint Instruction::shouldHeat(DHTSmoother* dht) {\n\t\/\/handle two kind of instructions : cold and hot ones\n\t\/\/TODO let it run several minutes on COM port to check if no error.\n\tif (Instruction::timer->getEpochTime() <= getLimit()) {\n\t\treturn Instruction::compare(instructedTemperature,\n\t\t\t\tdht->readTemperature());\n\t} else {\n\t\treturn Instruction::compare(defaultTemperature, dht->readTemperature());\n\t}\n\n}\n\nint Instruction::compare(float instructed, float current) {\n\tif (current > instructed + Instruction::T_DIFF) {\n\t\treturn Instruction::NO_POWER;\n\t} else if (current > instructed) {\n\t\treturn Instruction::VERY_LOW_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF) {\n\t\treturn Instruction::LOW_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF * 2) {\n\t\treturn Instruction::MEDIUM_POWER;\n\t} else if (current > instructed - Instruction::T_DIFF * 3) {\n\t\treturn Instruction::HIGH_POWER;\n\t} else {\n\t\treturn Instruction::FULL_POWER;\n\t}\n\t\/\/SHould not happen\n\treturn Instruction::NO_POWER;\n}\nbool Instruction::parseInstruction(const char*) {\n\treturn false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <seqan\/arg_parse.h>\n#include <seqan\/seq_io.h>\n\nusing namespace seqan;\nusing namespace std;\n\nconst char *PROGRAM_NAME = \"biotool\";\nconst char *HEADER = \"FILENAME\\tNUMSEQ\\tTOTAL\\tMIN\\tAVG\\tMAX\";\nconst unsigned DEFAULT_MIN_LEN = 0;\n\ntypedef enum {Success=0, Error_command_line=1, Error_open_file=2, Error_parse_file=3} exit_status;\n\nstruct BiotoolOptions\n{\n unsigned minlen;\n bool verbose;\n bool version;\n vector<string> fasta_files;\n\n BiotoolOptions() :\n minlen(DEFAULT_MIN_LEN), verbose(false), version(false), fasta_files({})\n {}\n};\n\nvoid print_error(const char *message)\n{\n cerr << PROGRAM_NAME << \" ERROR: \" << message << endl;\n}\n\nBiotoolOptions parse_options(int argc, char const **argv)\n{\n ArgumentParser parser(PROGRAM_NAME);\n addArgument(parser, ArgParseArgument(\n ArgParseArgument::STRING, \"FASTA_FILE\", true));\n addOption(parser, ArgParseOption(\n \"m\", \"minlen\", \"Minimum length sequence to include in stats (default \" + to_string(DEFAULT_MIN_LEN) + \")\",\n ArgParseArgument::INTEGER, \"INT\"));\n addOption(parser, ArgParseOption(\n \"v\", \"version\", \"Display program version and exit\"));\n addOption(parser, ArgParseOption(\n \"b\", \"verbose\", \"Print more stuff about what's happening\"));\n ArgumentParser::ParseResult res = parse(parser, argc, argv);\n\n \/\/if (res == ArgumentParser::PARSE_ERROR)\n if (res != ArgumentParser::PARSE_OK)\n {\n\tif (res == ArgumentParser::PARSE_ERROR) { \n exit(Error_command_line);\n\t}\n\telse {\n exit(Success);\n }\n }\n\n BiotoolOptions options;\n getOptionValue(options.minlen, parser, \"minlen\");\n options.verbose = isSet(parser, \"verbose\");\n options.version = isSet(parser, \"version\");\n options.fasta_files = getArgumentValues(parser, 0);\n return options;\n}\n\nvoid process_files(BiotoolOptions options)\n{\n CharString id;\n CharString seq;\n\n cout << HEADER << endl;\n\n for (string filename : options.fasta_files) {\n\tSeqFileIn seqFileIn;\n\n if (!open(seqFileIn, toCString(filename)))\n {\n\t print_error(\"Could not open the file.\");\n exit(Error_open_file);\n }\n\n int max_len = 0;\n int min_len = -1; \n\tint this_len;\n unsigned total_len = 0; \n unsigned num_seqs = 0;\n\tunsigned int average;\n\n while(!atEnd(seqFileIn))\n {\n\t try\n\t {\n\t readRecord(id, seq, seqFileIn);\n\t }\n catch (Exception const & e)\n {\n\t print_error(e.what());\n exit(Error_parse_file);\n }\n\t this_len = length(seq);\n\t if (this_len > options.minlen)\n {\n\t num_seqs++;\n\t total_len += this_len;\n\t max_len = max(max_len, this_len);\n\t if (min_len < 0 || this_len < min_len)\n {\n min_len = this_len;\n }\n\t }\n }\n\tif (num_seqs > 0)\n {\n average = (unsigned int) floor((double) total_len \/ (double) num_seqs);\n\t cout << filename << '\\t' << num_seqs << '\\t' \\\n\t\t << min_len << '\\t' << average << '\\t' << max_len << endl;\n }\n\telse\n {\n\t cout << filename << \"\\t0\\t0\\t-\\t-\\t-\" << endl;\n }\n }\n}\n\nint main(int argc, char const **argv)\n{\n BiotoolOptions options = parse_options(argc, argv);\n process_files(options);\n\n return 0;\n}\n<commit_msg>Include total sequence length in output<commit_after>#include <iostream>\n#include <seqan\/arg_parse.h>\n#include <seqan\/seq_io.h>\n\nusing namespace seqan;\nusing namespace std;\n\nconst char *PROGRAM_NAME = \"biotool\";\nconst char *HEADER = \"FILENAME\\tNUMSEQ\\tTOTAL\\tMIN\\tAVG\\tMAX\";\nconst unsigned DEFAULT_MIN_LEN = 0;\n\ntypedef enum {Success=0, Error_command_line=1, Error_open_file=2, Error_parse_file=3} exit_status;\n\nstruct BiotoolOptions\n{\n unsigned minlen;\n bool verbose;\n bool version;\n vector<string> fasta_files;\n\n BiotoolOptions() :\n minlen(DEFAULT_MIN_LEN), verbose(false), version(false), fasta_files({})\n {}\n};\n\nvoid print_error(const char *message)\n{\n cerr << PROGRAM_NAME << \" ERROR: \" << message << endl;\n}\n\nBiotoolOptions parse_options(int argc, char const **argv)\n{\n ArgumentParser parser(PROGRAM_NAME);\n addArgument(parser, ArgParseArgument(\n ArgParseArgument::STRING, \"FASTA_FILE\", true));\n addOption(parser, ArgParseOption(\n \"m\", \"minlen\", \"Minimum length sequence to include in stats (default \" + to_string(DEFAULT_MIN_LEN) + \")\",\n ArgParseArgument::INTEGER, \"INT\"));\n addOption(parser, ArgParseOption(\n \"v\", \"version\", \"Display program version and exit\"));\n addOption(parser, ArgParseOption(\n \"b\", \"verbose\", \"Print more stuff about what's happening\"));\n ArgumentParser::ParseResult res = parse(parser, argc, argv);\n\n \/\/if (res == ArgumentParser::PARSE_ERROR)\n if (res != ArgumentParser::PARSE_OK)\n {\n\tif (res == ArgumentParser::PARSE_ERROR) { \n exit(Error_command_line);\n\t}\n\telse {\n exit(Success);\n }\n }\n\n BiotoolOptions options;\n getOptionValue(options.minlen, parser, \"minlen\");\n options.verbose = isSet(parser, \"verbose\");\n options.version = isSet(parser, \"version\");\n options.fasta_files = getArgumentValues(parser, 0);\n return options;\n}\n\nvoid process_files(BiotoolOptions options)\n{\n CharString id;\n CharString seq;\n\n cout << HEADER << endl;\n\n for (string filename : options.fasta_files) {\n\tSeqFileIn seqFileIn;\n\n if (!open(seqFileIn, toCString(filename)))\n {\n\t print_error(\"Could not open the file.\");\n exit(Error_open_file);\n }\n\n int max_len = 0;\n int min_len = -1; \n\tint this_len;\n unsigned total_len = 0; \n unsigned num_seqs = 0;\n\tunsigned int average;\n\n while(!atEnd(seqFileIn))\n {\n\t try\n\t {\n\t readRecord(id, seq, seqFileIn);\n\t }\n catch (Exception const & e)\n {\n\t print_error(e.what());\n exit(Error_parse_file);\n }\n\t this_len = length(seq);\n\t if (this_len > options.minlen)\n {\n\t num_seqs++;\n\t total_len += this_len;\n\t max_len = max(max_len, this_len);\n\t if (min_len < 0 || this_len < min_len)\n {\n min_len = this_len;\n }\n\t }\n }\n\tif (num_seqs > 0)\n {\n average = (unsigned int) floor((double) total_len \/ (double) num_seqs);\n\t cout << filename << '\\t' << num_seqs << '\\t' << total_len << '\\t' \\\n\t\t << min_len << '\\t' << average << '\\t' << max_len << endl;\n }\n\telse\n {\n\t cout << filename << \"\\t0\\t0\\t-\\t-\\t-\" << endl;\n }\n }\n}\n\nint main(int argc, char const **argv)\n{\n BiotoolOptions options = parse_options(argc, argv);\n process_files(options);\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tchar const* creator_str = \"libtorrent\";\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter);\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i)\n\t\t\tt.add_tracker(*i);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tfwrite(&torrent[0], 1, torrent.size(), stdout);\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<commit_msg>error handling in make_torrent<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/create_torrent.hpp\"\n#include \"libtorrent\/file.hpp\"\n\n#include <boost\/bind.hpp>\n\nusing namespace libtorrent;\n\n\/\/ do not include files and folders whose\n\/\/ name starts with a .\nbool file_filter(std::string const& f)\n{\n\tif (filename(f)[0] == '.') return false;\n\tfprintf(stderr, \"%s\\n\", f.c_str());\n\treturn true;\n}\n\nvoid print_progress(int i, int num)\n{\n\tfprintf(stderr, \"\\r%d\/%d\", i+1, num);\n}\n\nvoid print_usage()\n{\n\tfputs(\"usage: make_torrent FILE [OPTIONS]\\n\"\n\t\t\"\\n\"\n\t\t\"Generates a torrent file from the specified file\\n\"\n\t\t\"or directory and writes it to standard out\\n\\n\"\n\t\t\"OPTIONS:\\n\"\n\t\t\"-m generate a merkle hash tree torrent.\\n\"\n\t\t\" merkle torrents require client support\\n\"\n\t\t\"-w url adds a web seed to the torrent with\\n\"\n\t\t\" the specified url\\n\"\n\t\t\"-t url adds the specified tracker to the\\n\"\n\t\t\" torrent\\n\"\n\t\t\"-p bytes enables padding files. Files larger\\n\"\n\t\t\" than bytes will be piece-aligned\\n\"\n\t\t\"-s bytes specifies a piece size for the torrent\\n\"\n\t\t\" This has to be a multiple of 16 kiB\\n\"\n\t\t, stderr);\n}\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\n\tchar const* creator_str = \"libtorrent\";\n\n\tif (argc < 2)\n\t{\n\t\tprint_usage();\n\t\treturn 1;\n\t}\n\n#ifndef BOOST_NO_EXCEPTIONS\n\ttry\n\t{\n#endif\n\t\tstd::vector<std::string> web_seeds;\n\t\tstd::vector<std::string> trackers;\n\t\tint pad_file_limit = -1;\n\t\tint piece_size = 0;\n\t\tint flags = 0;\n\n\t\tfor (int i = 2; i < argc; ++i)\n\t\t{\n\t\t\tif (argv[i][0] != '-')\n\t\t\t{\n\t\t\t\tprint_usage();\n\t\t\t\treturn 1;\n\t\t\t}\n\n\t\t\tswitch (argv[i][1])\n\t\t\t{\n\t\t\t\tcase 'w':\n\t\t\t\t\t++i;\n\t\t\t\t\tweb_seeds.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 't':\n\t\t\t\t\t++i;\n\t\t\t\t\ttrackers.push_back(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'p':\n\t\t\t\t\t++i;\n\t\t\t\t\tpad_file_limit = atoi(argv[i]);\n\t\t\t\t\tflags |= create_torrent::optimize;\n\t\t\t\t\tbreak;\n\t\t\t\tcase 's':\n\t\t\t\t\t++i;\n\t\t\t\t\tpiece_size = atoi(argv[i]);\n\t\t\t\t\tbreak;\n\t\t\t\tcase 'm':\n\t\t\t\t\tflags |= create_torrent::merkle;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tprint_usage();\n\t\t\t\t\treturn 1;\n\t\t\t}\n\t\t}\n\n\t\tfile_storage fs;\n\t\tfile_pool fp;\n\t\tstd::string full_path = libtorrent::complete(argv[1]);\n\n\t\tadd_files(fs, full_path, file_filter);\n\t\tif (fs.num_files() == 0)\n\t\t{\n\t\t\tfputs(\"no files specified.\\n\", stderr);\n\t\t\treturn 1;\n\t\t}\n\n\t\tcreate_torrent t(fs, piece_size, pad_file_limit, flags);\n\t\tfor (std::vector<std::string>::iterator i = trackers.begin()\n\t\t\t, end(trackers.end()); i != end; ++i)\n\t\t\tt.add_tracker(*i);\n\n\t\tfor (std::vector<std::string>::iterator i = web_seeds.begin()\n\t\t\t, end(web_seeds.end()); i != end; ++i)\n\t\t\tt.add_url_seed(*i);\n\n\t\terror_code ec;\n\t\tset_piece_hashes(t, parent_path(full_path)\n\t\t\t, boost::bind(&print_progress, _1, t.num_pieces()), ec);\n\t\tif (ec)\n\t\t{\n\t\t\tfprintf(stderr, \"%s\\n\", ec.message().c_str());\n\t\t\treturn 1;\n\t\t}\n\n\t\tfprintf(stderr, \"\\n\");\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to stdout\n\t\tstd::vector<char> torrent;\n\t\tbencode(back_inserter(torrent), t.generate());\n\t\tfwrite(&torrent[0], 1, torrent.size(), stdout);\n\n#ifndef BOOST_NO_EXCEPTIONS\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tfprintf(stderr, \"%s\\n\", e.what());\n\t}\n#endif\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <iomanip>\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n\nusing namespace boost::filesystem;\nusing namespace libtorrent;\n\nvoid add_files(\n\ttorrent_info& t\n\t, path const& p\n\t, path const& l)\n{\n\tpath f(p \/ l);\n\tif (is_directory(f))\n\t{\n\t\tfor (directory_iterator i(f), end; i != end; ++i)\n\t\t\tadd_files(t, p, l \/ i->leaf());\n\t}\n\telse\n\t{\n\t\tstd::cerr << \"adding \\\"\" << l.string() << \"\\\"\\n\";\n\t\tt.add_file(l, file_size(f));\n\t}\n}\n\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\tpath::default_name_check(no_check);\n\n\tif (argc != 4)\n\t{\n\t\tstd::cerr << \"usage: make_torrent <output torrent-file> \"\n\t\t\t\"<announce url> <file or directory to create torrent from>\\n\";\n\t\treturn 1;\n\t}\n\n\ttry\n\t{\n\t\ttorrent_info t;\n\t\tpath full_path = complete(path(argv[3]));\n\t\tofstream out(complete(path(argv[1])), std::ios_base::binary);\n\n\t\tint piece_size = 256 * 1024;\n\t\tchar const* creator_str = \"libtorrent\";\n\n\t\tadd_files(t, full_path.branch_path(), full_path.leaf());\n\t\tt.set_piece_size(piece_size);\n\n\t\tfile_pool fp;\n\t\tstorage st(t, full_path.branch_path(), fp);\n\t\tt.add_tracker(argv[2]);\n\n\t\t\/\/ calculate the hash for all pieces\n\t\tint num = t.num_pieces();\n\t\tstd::vector<char> buf(piece_size);\n\t\tfor (int i = 0; i < num; ++i)\n\t\t{\n\t\t\tst.read(&buf[0], i, 0, t.piece_size(i));\n\t\t\thasher h(&buf[0], t.piece_size(i));\n\t\t\tt.set_hash(i, h.final());\n\t\t\tstd::cerr << (i+1) << \"\/\" << num << \"\\r\";\n\t\t}\n\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to out\n\t\tentry e = t.create_torrent();\n\t\tlibtorrent::bencode(std::ostream_iterator<char>(out), e);\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << e.what() << \"\\n\";\n\t}\n\n\treturn 0;\n}\n\n<commit_msg>the torrent maker now skips hidden files<commit_after>\/*\n\nCopyright (c) 2006, Arvid Norberg\nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions\nare met:\n\n * Redistributions of source code must retain the above copyright\n notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n notice, this list of conditions and the following disclaimer in\n the documentation and\/or other materials provided with the distribution.\n * Neither the name of the author nor the names of its\n contributors may be used to endorse or promote products derived\n from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\nARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\nLIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\nCONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\nSUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\nINTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\nCONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\nARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\nPOSSIBILITY OF SUCH DAMAGE.\n\n*\/\n\n#include <iostream>\n#include <fstream>\n#include <iterator>\n#include <iomanip>\n\n#include \"libtorrent\/entry.hpp\"\n#include \"libtorrent\/bencode.hpp\"\n#include \"libtorrent\/torrent_info.hpp\"\n#include \"libtorrent\/file.hpp\"\n#include \"libtorrent\/storage.hpp\"\n#include \"libtorrent\/hasher.hpp\"\n#include \"libtorrent\/file_pool.hpp\"\n\n#include <boost\/filesystem\/operations.hpp>\n#include <boost\/filesystem\/path.hpp>\n#include <boost\/filesystem\/fstream.hpp>\n\nusing namespace boost::filesystem;\nusing namespace libtorrent;\n\nvoid add_files(\n\ttorrent_info& t\n\t, path const& p\n\t, path const& l)\n{\n\tif (l.leaf()[0] == '.') return;\n\tpath f(p \/ l);\n\tif (is_directory(f))\n\t{\n\t\tfor (directory_iterator i(f), end; i != end; ++i)\n\t\t\tadd_files(t, p, l \/ i->leaf());\n\t}\n\telse\n\t{\n\t\tstd::cerr << \"adding \\\"\" << l.string() << \"\\\"\\n\";\n\t\tt.add_file(l, file_size(f));\n\t}\n}\n\n\nint main(int argc, char* argv[])\n{\n\tusing namespace libtorrent;\n\tusing namespace boost::filesystem;\n\n\tpath::default_name_check(no_check);\n\n\tif (argc != 4)\n\t{\n\t\tstd::cerr << \"usage: make_torrent <output torrent-file> \"\n\t\t\t\"<announce url> <file or directory to create torrent from>\\n\";\n\t\treturn 1;\n\t}\n\n\ttry\n\t{\n\t\ttorrent_info t;\n\t\tpath full_path = complete(path(argv[3]));\n\t\tofstream out(complete(path(argv[1])), std::ios_base::binary);\n\n\t\tint piece_size = 256 * 1024;\n\t\tchar const* creator_str = \"libtorrent\";\n\n\t\tadd_files(t, full_path.branch_path(), full_path.leaf());\n\t\tt.set_piece_size(piece_size);\n\n\t\tfile_pool fp;\n\t\tstorage st(t, full_path.branch_path(), fp);\n\t\tt.add_tracker(argv[2]);\n\n\t\t\/\/ calculate the hash for all pieces\n\t\tint num = t.num_pieces();\n\t\tstd::vector<char> buf(piece_size);\n\t\tfor (int i = 0; i < num; ++i)\n\t\t{\n\t\t\tst.read(&buf[0], i, 0, t.piece_size(i));\n\t\t\thasher h(&buf[0], t.piece_size(i));\n\t\t\tt.set_hash(i, h.final());\n\t\t\tstd::cerr << (i+1) << \"\/\" << num << \"\\r\";\n\t\t}\n\n\t\tt.set_creator(creator_str);\n\n\t\t\/\/ create the torrent and print it to out\n\t\tentry e = t.create_torrent();\n\t\tlibtorrent::bencode(std::ostream_iterator<char>(out), e);\n\t}\n\tcatch (std::exception& e)\n\t{\n\t\tstd::cerr << e.what() << \"\\n\";\n\t}\n\n\treturn 0;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ This file is part of Swift2D. \/\/\n\/\/ \/\/\n\/\/ Copyright: (c) 2011-2014 Simon Schneegans & Felix Lauer \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <swift2d\/swift2d.hpp>\n#include \"SpaceScene.hpp\"\n#include \"Player.hpp\"\n\n#include <steam\/steam_api.h>\n\nusing namespace swift;\n\n\/\/ main ------------------------------------------------------------------------\nint main(int argc, char** argv) {\n\n \/\/ initialize Swift2D\n Application::get().init(argc, argv);\n Network::get().connect(\"TestGame\");\n\n if (!Steam::get().init()) {\n Application::get().clean_up();\n return 1;\n }\n\n Steam::get().update_room_list();\n\n\n Steam::get().on_updated_room_list.connect(\n [](std::unordered_map<uint64_t, Steam::RoomData> const& rooms) {\n for (auto const& room : rooms) {\n if (room.second.name == \"ichmachemaleinfachnureinenraumauf\") {\n Steam::get().join_room(room.first);\n return;\n }\n }\n\n Steam::get().create_room(\"ichmachemaleinfachnureinenraumauf\");\n });\n\n Steam::get().on_message.connect(\n [](Steam::MessageType type, uint64_t user_id, std::string const& join_message) {\n std::cout << join_message << std::endl;\n\n std::string huhu(\"huhu\");\n SteamNetworking()->SendP2PPacket(user_id, huhu.c_str(), huhu.length(), k_EP2PSendReliable);\n });\n\n \/\/ scene ---------------------------------------------------------------------\n auto scene = SpaceScene::create();\n auto camera = scene->add<CameraComponent>();\n camera->Size = math::vec2(2.f, 2.f);\n\n \/\/ player --------------------------------------------------------------------\n Player::init();\n Player player(true);\n\n \/\/ rendering pipeline --------------------------------------------------------\n auto window = WindowManager::get().get_default();\n\n \/\/ main loop -----------------------------------------------------------------\n Timer timer;\n timer.start();\n Application::get().on_frame.connect([&]() {\n Steam::get().update();\n\n uint32 size;\n if (SteamNetworking()->IsP2PPacketAvailable(&size)) {\n std::string result(size, ' ');\n uint32 actual_size;\n CSteamID sender;\n SteamNetworking()->ReadP2PPacket(&(*result.begin()), size, &actual_size, &sender);\n std::cout << \"Got message: \" << result << \" from \" << Steam::get().get_user_name(sender.ConvertToUint64()) << std::endl;\n }\n\n double time(timer.get_elapsed());\n timer.reset();\n\n window->process_input();\n Network::get().update();\n scene->update(time);\n Application::get().display(scene, camera);\n });\n\n window->on_close.connect([&](){\n Application::get().stop();\n });\n\n window->on_key_press.connect([&](Key key, int scancode, int action, int mods) {\n if (action != 1) {\n switch(key) {\n case Key::ESCAPE:\n Application::get().stop();\n break;\n }\n }\n });\n\n Application::get().start();\n Application::get().clean_up();\n\n return 0;\n}\n<commit_msg>added package on enter<commit_after>\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ \/\/\n\/\/ This file is part of Swift2D. \/\/\n\/\/ \/\/\n\/\/ Copyright: (c) 2011-2014 Simon Schneegans & Felix Lauer \/\/\n\/\/ \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n#include <swift2d\/swift2d.hpp>\n#include \"SpaceScene.hpp\"\n#include \"Player.hpp\"\n\n#include <steam\/steam_api.h>\n\nusing namespace swift;\n\n\/\/ main ------------------------------------------------------------------------\nint main(int argc, char** argv) {\n\n \/\/ initialize Swift2D\n Application::get().init(argc, argv);\n Network::get().connect(\"TestGame\");\n\n if (!Steam::get().init()) {\n Application::get().clean_up();\n return 1;\n }\n\n Steam::get().update_room_list();\n\n\n Steam::get().on_updated_room_list.connect(\n [](std::unordered_map<uint64_t, Steam::RoomData> const& rooms) {\n for (auto const& room : rooms) {\n if (room.second.name == \"ichmachemaleinfachnureinenraumauf\") {\n Steam::get().join_room(room.first);\n return;\n }\n }\n\n Steam::get().create_room(\"ichmachemaleinfachnureinenraumauf\");\n });\n\n std::set<uint64_t> user_ids;\n\n Steam::get().on_message.connect(\n [&](Steam::MessageType type, uint64_t user_id, std::string const& join_message) {\n std::cout << join_message << std::endl;\n user_ids.insert(user_id);\n std::string huhu(\"huhu\");\n SteamNetworking()->SendP2PPacket(user_id, huhu.c_str(), huhu.length(), k_EP2PSendReliable);\n });\n\n \/\/ scene ---------------------------------------------------------------------\n auto scene = SpaceScene::create();\n auto camera = scene->add<CameraComponent>();\n camera->Size = math::vec2(2.f, 2.f);\n\n \/\/ player --------------------------------------------------------------------\n Player::init();\n Player player(true);\n\n \/\/ rendering pipeline --------------------------------------------------------\n auto window = WindowManager::get().get_default();\n\n \/\/ main loop -----------------------------------------------------------------\n Timer timer;\n timer.start();\n Application::get().on_frame.connect([&]() {\n Steam::get().update();\n\n uint32 size;\n if (SteamNetworking()->IsP2PPacketAvailable(&size)) {\n std::string result(size, ' ');\n uint32 actual_size;\n CSteamID sender;\n SteamNetworking()->ReadP2PPacket(&(*result.begin()), size, &actual_size, &sender);\n std::cout << \"Got message: \" << result << \" from \" << Steam::get().get_user_name(sender.ConvertToUint64()) << std::endl;\n }\n\n double time(timer.get_elapsed());\n timer.reset();\n\n window->process_input();\n Network::get().update();\n scene->update(time);\n Application::get().display(scene, camera);\n });\n\n window->on_close.connect([&](){\n Application::get().stop();\n });\n\n window->on_key_press.connect([&](Key key, int scancode, int action, int mods) {\n if (action != 1) {\n switch(key) {\n case Key::ESCAPE:\n Application::get().stop();\n break;\n case Key::ENTER:\n for (auto user_id : user_ids) {\n std::string msg(\"Huhu, ich habe Enter gedrückt!\");\n SteamNetworking()->SendP2PPacket(user_id, msg.c_str(), msg.length(), k_EP2PSendReliable);\n }\n break;\n }\n }\n });\n\n Application::get().start();\n Application::get().clean_up();\n\n return 0;\n}\n<|endoftext|>"} {"text":"<commit_before>\/*************************************************************************\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: b3drange.cxx,v $\n *\n * $Revision: 1.8 $\n *\n * last change: $Author: obo $ $Date: 2006-09-17 08:05:24 $\n *\n * The Contents of this file are made available subject to\n * the terms of GNU Lesser General Public License Version 2.1.\n *\n *\n * GNU Lesser General Public License Version 2.1\n * =============================================\n * Copyright 2005 by Sun Microsystems, Inc.\n * 901 San Antonio Road, Palo Alto, CA 94303, USA\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License version 2.1, as published by the Free Software Foundation.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston,\n * MA 02111-1307 USA\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_basegfx.hxx\"\n\n#ifndef _BGFX_RANGE_B3DRANGE_HXX\n#include <basegfx\/range\/b3drange.hxx>\n#endif\n\n#ifndef _BGFX_RANGE_B3IRANGE_HXX\n#include <basegfx\/range\/b3irange.hxx>\n#endif\n\n#ifndef _BGFX_NUMERIC_FTOOLS_HXX\n#include <basegfx\/numeric\/ftools.hxx>\n#endif\n\nnamespace basegfx\n{\n B3DRange::B3DRange(const B3IRange& rRange) :\n maRangeX(),\n maRangeY(),\n maRangeZ()\n {\n if( !rRange.isEmpty() )\n {\n maRangeX = rRange.getMinX();\n maRangeY = rRange.getMinY();\n maRangeZ = rRange.getMinZ();\n\n maRangeX.expand( rRange.getMaxX() );\n maRangeY.expand( rRange.getMaxY() );\n maRangeZ.expand( rRange.getMaxZ() );\n }\n }\n\n B3IRange fround(const B3DRange& rRange )\n {\n return rRange.isEmpty() ?\n B3IRange() :\n B3IRange(fround(rRange.getMinX()),\n fround(rRange.getMinY()),\n fround(rRange.getMinZ()),\n fround(rRange.getMaxX()),\n fround(rRange.getMaxY()),\n fround(rRange.getMaxZ()));\n }\n\n} \/\/ end of namespace basegfx\n\n\/\/ eof\n<commit_msg>INTEGRATION: CWS changefileheader (1.8.58); FILE MERGED 2008\/04\/01 10:48:15 thb 1.8.58.2: #i85898# Stripping all external header guards 2008\/03\/28 16:05:56 rt 1.8.58.1: #i87441# Change license header to LPGL v3.<commit_after>\/*************************************************************************\n *\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * Copyright 2008 by Sun Microsystems, Inc.\n *\n * OpenOffice.org - a multi-platform office productivity suite\n *\n * $RCSfile: b3drange.cxx,v $\n * $Revision: 1.9 $\n *\n * This file is part of OpenOffice.org.\n *\n * OpenOffice.org is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License version 3\n * only, as published by the Free Software Foundation.\n *\n * OpenOffice.org is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License version 3 for more details\n * (a copy is included in the LICENSE file that accompanied this code).\n *\n * You should have received a copy of the GNU Lesser General Public License\n * version 3 along with OpenOffice.org. If not, see\n * <http:\/\/www.openoffice.org\/license.html>\n * for a copy of the LGPLv3 License.\n *\n ************************************************************************\/\n\n\/\/ MARKER(update_precomp.py): autogen include statement, do not remove\n#include \"precompiled_basegfx.hxx\"\n#include <basegfx\/range\/b3drange.hxx>\n#include <basegfx\/range\/b3irange.hxx>\n#include <basegfx\/numeric\/ftools.hxx>\n\nnamespace basegfx\n{\n B3DRange::B3DRange(const B3IRange& rRange) :\n maRangeX(),\n maRangeY(),\n maRangeZ()\n {\n if( !rRange.isEmpty() )\n {\n maRangeX = rRange.getMinX();\n maRangeY = rRange.getMinY();\n maRangeZ = rRange.getMinZ();\n\n maRangeX.expand( rRange.getMaxX() );\n maRangeY.expand( rRange.getMaxY() );\n maRangeZ.expand( rRange.getMaxZ() );\n }\n }\n\n B3IRange fround(const B3DRange& rRange )\n {\n return rRange.isEmpty() ?\n B3IRange() :\n B3IRange(fround(rRange.getMinX()),\n fround(rRange.getMinY()),\n fround(rRange.getMinZ()),\n fround(rRange.getMaxX()),\n fround(rRange.getMaxY()),\n fround(rRange.getMaxZ()));\n }\n\n} \/\/ end of namespace basegfx\n\n\/\/ eof\n<|endoftext|>"} {"text":"<commit_before><commit_msg>coverity#735397 dead code<commit_after><|endoftext|>"} {"text":"<commit_before>#include <iostream>\n#include <pcl\/io\/pcd_io.h>\n#include <pcl\/io\/ply_io.h>\n#include <pcl\/point_types.h>\n#include <pcl\/io\/vtk_lib_io.h>\n#include <pcl\/impl\/point_types.hpp>\n#include <pcl\/registration\/icp.h>\n#include <pcl\/visualization\/cloud_viewer.h>\n#include <fstream>\n#include <pcl\/kdtree\/kdtree_flann.h>\n#include <pcl\/features\/normal_3d.h>\n#include <pcl\/surface\/gp3.h>\n#include <pcl\/surface\/organized_fast_mesh.h>\n#include <sstream>\n#include <sensor_msgs\/PointCloud2.h>\n#include <pcl\/filters\/voxel_grid.h>\n\/\/#include <pcl\/PCLPointCloud2.h>\/\/1.7 only\n\nusing namespace std;\n\nvoid ShowCloud (pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud, int index)\n{\n\tstringstream title;\n \ttitle << \"Cloud \"<<index;\n\tpcl::visualization::CloudViewer viewer (title.str());\n\tviewer.showCloud (cloud);\n\twhile (!viewer.wasStopped ())\n\t{\n\t}\n}\n\nvoid ReadCloud (pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud, ifstream& file, int index, bool useBGR)\n{\n\tchar dsize[4];\n\tfile.read (dsize, 4);\n\tcout<<\"READ: \"<<(int)(dsize[0])<<\" \"<<(int)(dsize[1])<<\" \"<<(int)(dsize[2])<<\" \"<<(int)(dsize[3])<<endl;\n\tifstream::pos_type size = (unsigned char)dsize[0];\n\tsize = size<<8;\n\tsize += (unsigned char)dsize[1];\n\tsize = size<<8;\n\tsize += (unsigned char)dsize[2];\n\tsize = size<<8;\n\tsize += (unsigned char)dsize[3];\n\tcout<<\"Got Size: \"<<size<<\" \"<<endl;\n\tchar* memblock = new char [10*size];\n\tfile.read (memblock, 10*size);\n\tunsigned char* umem = reinterpret_cast<unsigned char*>(memblock);\n\n\tcloud->width = size;\n\tcloud->height = 1;\n\tcloud->is_dense = false;\n\tcloud->points.resize (cloud->width * cloud->height);\n\tfor (size_t i = 0; i < cloud->points.size (); ++i)\n\t{\n\t\t\tcloud->points[i].x = (signed short)(((umem[i*10+0])<<8) + umem[i*10+1]);\n\t\t\tcloud->points[i].y = (signed short)(((umem[i*10+2])<<8) + umem[i*10+3]);\n\t\t\tcloud->points[i].z = -(signed short)(((umem[i*10+4])<<8) + umem[i*10+5]);\n\t\t\tcloud->points[i].x\/=1000;\n\t\t\tcloud->points[i].y\/=1000;\n\t\t\tcloud->points[i].z\/=1000;\n\n\t\t\tif(i<5 || i+5>=cloud->points.size())\n\t\t\t{\n\t\t\t\tcout<<\"Point: \"<<i<<\" \"<<cloud->points[i].x<<\" \"<<cloud->points[i].y<<\" \"<<cloud->points[i].z<<endl;\n\t\t\t}\n\t\tif(!useBGR)\n\t\t{\n\t\t\t\n\t\t\tcloud->points[i].b = memblock[i*10+6];\n\t\t\tcloud->points[i].g = memblock[i*10+7];\n\t\t\tcloud->points[i].r = memblock[i*10+8];\n\t\t\tcloud->points[i].a = memblock[i*10+9];\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(index%3==0)\n\t\t\t{\n\t\t\t\tcloud->points[i].b = 255;\n\t\t\t\tcloud->points[i].g = 0;\n\t\t\t\tcloud->points[i].r = 0;\n\t\t\t\tcloud->points[i].a = 0;\n\t\t\t}\n\t\t\telse if (index%3==1)\n\t\t\t{\n\t\t\t\tcloud->points[i].b = 0;\n\t\t\t\tcloud->points[i].g = 255;\n\t\t\t\tcloud->points[i].r = 0;\n\t\t\t\tcloud->points[i].a = 0;\n\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tcloud->points[i].b = 0;\n\t\t\t\tcloud->points[i].g = 0;\n\t\t\t\tcloud->points[i].r = 255;\n\t\t\t\tcloud->points[i].a = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout<<\"Set cloud\"<<endl;\t\n\n\tdelete[] memblock;\n}\n\nvoid SaveToPly(pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud, string name)\n{\n\tpcl::PLYWriter plyWriter;\n\tplyWriter.write(name, *cloud);\n}\n\nvoid MakePolygons(pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud)\n{\n\tpcl::OrganizedFastMesh<pcl::PointXYZRGBA> ofm;\n\tofm.setInputCloud(cloud);\n\tpcl::PolygonMesh polymesh;\n\tofm.reconstruct(polymesh);\n\tcout<<\"Done constructing mesh\"<<endl;\n\n\t\/\/pcl::io::savePolygonFileSTL(\"sample2.stl\",polymesh); \n\/*\n\tpcl::PLYWriter plyWriter;\n\tplyWriter.writeASCII(\"sample.ply\",cloud);*\/\n\t\/*\n\t\/\/ Normal estimation*\n\tpcl::NormalEstimation<pcl::PointXYZRGBA, pcl::Normal> n;\n\tpcl::PointCloud<pcl::Normal>::Ptr normals (new pcl::PointCloud<pcl::Normal>);\n\tpcl::search::KdTree<pcl::PointXYZRGBA>::Ptr tree (new pcl::search::KdTree<pcl::PointXYZRGBA>);\n\ttree->setInputCloud (cloud);\n\tn.setInputCloud (cloud);n.setSearchMethod (tree);\n\tn.setKSearch (20);\n\tn.compute (*normals);\n\t\/\/ normals should not contain the point normals + surface curvatures\n\n\t\/\/ Concatenate the XYZ and normal fields*\n\tpcl::PointCloud<pcl::PointNormal>::Ptr cloud_with_normals (new pcl::PointCloud<pcl::PointNormal>);\n\tpcl::concatenateFields (*cloud, *normals, *cloud_with_normals);\n\t\/\/ cloud_with_normals = cloud + normals\n\n\t\/\/ Create search tree*\n\tpcl::search::KdTree<pcl::PointNormal>::Ptr tree2 (new pcl::search::KdTree<pcl::PointNormal>);\n\ttree2->setInputCloud (cloud_with_normals);\n\n\t\/\/ Initialize objects\n\tpcl::GreedyProjectionTriangulation<pcl::PointNormal> gp3;\n\tpcl::PolygonMesh triangles;\n\n\t\/\/ Set the maximum distance between connected points (maximum edge length)\n\tgp3.setSearchRadius (0.025);\n\n\t\/\/ Set typical values for the parameters\n\tgp3.setMu (2.5);\n\tgp3.setMaximumNearestNeighbors (100);\n\tgp3.setMaximumSurfaceAngle(M_PI\/4); \/\/ 45 degrees\n\tgp3.setMinimumAngle(M_PI\/18); \/\/ 10 degrees\n\tgp3.setMaximumAngle(2*M_PI\/3); \/\/ 120 degrees\n\tgp3.setNormalConsistency(false);\n\n\t\/\/ Get result\n\tgp3.setInputCloud (cloud_with_normals);\n\tgp3.setSearchMethod (tree2);\n\tgp3.reconstruct (triangles);\n\n\t\/\/ Additional vertex information\n\tstd::vector<int> parts = gp3.getPartIDs();\n\tstd::vector<int> states = gp3.getPointStates();*\/\n}\n\nvoid FilterCloud(pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud)\n{\n\tsensor_msgs::PointCloud2::Ptr msg (new sensor_msgs::PointCloud2);\n\tsensor_msgs::PointCloud2::Ptr cloud_filtered (new sensor_msgs::PointCloud2);\n\t\/\/pcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZRGBA>); \n\tpcl::toROSMsg (*cloud, *msg);\n\n\tstd::cerr << \"PointCloud before filtering: \" << cloud->width * cloud->height \n\t\t<< endl;\n\n\t\/\/ Create the filtering object\n\tpcl::VoxelGrid<sensor_msgs::PointCloud2> sor;\n\tsor.setInputCloud (msg);\n\tsor.setLeafSize (10.0f, 10.0f, 10.0f);\n\tsor.filter (*cloud_filtered);\n\n\tstd::cerr << \"PointCloud after filtering: \" << cloud_filtered->width * cloud_filtered->height \n\t\t<< endl;\n}\n\nint main (int argc, char** argv)\n{\n\tcout<<\"Usage: [# iterations], [Use rgb], [ply file name], [use ICP]\"<<endl;\n\t\n\tint iters = 3;\n\tif(argc>1)\n\t{\n\t\tsscanf(argv[1],\"%d\",&iters);\n\t\tcout<<\"Iters: \"<<iters<<endl;\n\t}\n\n\tbool useBGR = 1;\n\tint a;\n\tif(argc>2)\n\t{\n\t\tsscanf(argv[2],\"%d\",&a);\n\t\tuseBGR = a!=0;\n\t}\n\n\tstring plyFile = \"sample2.ply\";\n\tif(argc>3)\n\t{\n\t\tplyFile = string(argv[3]);\n\t}\n\n\tbool useICP = false;\n\tif(argc>4)\n\t{\n\t\tsscanf(argv[4],\"%d\",&a);\n\t\tuseICP = a!=0;\n\t}\n\n\tbool savePly = true;\n\tif(argc>5)\n\t{\n\t\tsscanf(argv[5],\"%d\",&a);\n\t\tsavePly = a!=0;\n\t}\n\n\t\/\/ pcl::PointCloud<pcl::PointXYZRGBA> cloud, cloud2;\n\tpcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud (new pcl::PointCloud<pcl::PointXYZRGBA>); \n\tpcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud2 (new pcl::PointCloud<pcl::PointXYZRGBA>); \n\tpcl::PointCloud<pcl::PointXYZRGBA>::Ptr cloud3 (new pcl::PointCloud<pcl::PointXYZRGBA>); \n\n\n\n\t\/\/ Fill in the cloud data\n\n\tcloud2->width = 1000;\n\tcloud2->height = 1;\n\tcloud2->is_dense = false;\n\tcloud2->points.resize (cloud2->width * cloud2->height);\n\n\t\/\/ifstream file (\"C:\\\\Users\\\\Eric\\\\Documents\\\\Visual Studio 2013\\\\Projects\\\\KinectExplorer-WPF\\\\bin\\\\Debug\\\\KinectDepth2.txt\", ios::in|ios::binary|ios::ate);\n\tifstream file (\"..\\\\data\\\\KinectDepth2.txt\", ios::in|ios::binary|ios::ate);\n\t\n\tif (file.is_open())\n\t{\n\t\tfile.seekg (0, ios::beg);\n\t\tfor(int i=0; i <iters; i++)\n\t\t{\n\t\t\tif(i==0)\n\t\t\t{\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tShowCloud(cloud,i);\n\t\t\t\t*cloud3+=*cloud;\n\n\t\t\t\/\/\tFilterCloud(cloud3);\n\t\t\t\t\/\/MakePolygons(cloud);\n\t\t\t}\n\t\t\telse if(i%2==1)\n\t\t\t{\n\t\t\t\tReadCloud(cloud2, file,i, useBGR);\n\t\t\t\tReadCloud(cloud2, file,i, useBGR);\n\t\t\t\tReadCloud(cloud2, file,i, useBGR);\n\t\t\t\tReadCloud(cloud2, file,i, useBGR);\n\t\t\t\tShowCloud(cloud2,i);\n\t\t\t\tif(useICP)\n\t\t\t\t{\n\t\t\t\t\tpcl::IterativeClosestPoint<pcl::PointXYZRGBA, pcl::PointXYZRGBA> icp;\n\n\t\t\t\t\ticp.setInputCloud (cloud2);\n\t\t\t\t\ticp.setInputTarget(cloud);\n\t\t\t\t\ticp.setMaximumIterations (2);\n\t\t\t\t\ticp.setMaxCorrespondenceDistance (1);\n\n\t\t\t\t\tcout<<\"Trying to align!\"<<endl;\n\t\t\t\t\ticp.align(*cloud2);\n\t\t\t\t\tEigen::Matrix4f transformation = icp.getFinalTransformation ();\n\n\t\t\t\t\tcout << \"has converged:\" << icp.hasConverged() << \" score: \" << icp.getFitnessScore() << std::endl;\n\n\n\t\t\t\t\tcout << transformation << endl;\n\t\t\t\t\tcout<<\"Size afer icp: \"<<cloud2->size()<<\" \"<<cloud3->size()<<endl;\n\t\t\t\t}\n\n\t\t\t\t*cloud3+=*cloud2;\n\t\t\t}\n\t\t\telse if(i%2==0)\n\t\t\t{\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tReadCloud(cloud, file,i, useBGR);\n\t\t\t\tShowCloud(cloud,i);\n\n\t\t\t\tif(useICP)\n\t\t\t\t{\n\t\t\t\t\tpcl::IterativeClosestPoint<pcl::PointXYZRGBA, pcl::PointXYZRGBA> icp;\n\n\t\t\t\t\ticp.setInputCloud (cloud);\n\t\t\t\t\ticp.setInputTarget(cloud2);\n\t\t\t\t\ticp.setMaximumIterations (2);\n\t\t\t\t\ticp.setMaxCorrespondenceDistance (1);\n\n\t\t\t\t\tcout<<\"Trying to align!\"<<endl;\n\t\t\t\t\ticp.align(*cloud);\n\t\t\t\t\tEigen::Matrix4f transformation = icp.getFinalTransformation ();\n\n\t\t\t\t\tcout << \"has converged:\" << icp.hasConverged() << \" score: \" << icp.getFitnessScore() << std::endl;\n\n\n\t\t\t\t\tcout << transformation << endl;\n\t\t\t\t\tcout<<\"Size afer icp: \"<<cloud->size()<<\" \"<<cloud3->size()<<endl;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t*cloud3+=*cloud;\n\t\t\t}\n\t\t}\n\n\t\tcout<<\"FINAL CLOUD!\"<<endl;\n\t\tShowCloud(cloud3,-1);\n\t\tcout<<\"Saving to ply file...\"<<endl;\n\t\tif(savePly)\n\t\t\tSaveToPly(cloud3, plyFile);\n\t\t\/\/MakePolygons(cloud3);\n\t}\n\telse cout << \"Unable to open file\";\n\n\tstd::cout<<\"DONE!\\n\";\n\t\/*\n\t pcl::io::savePCDFileASCII (\"test_pcd.pcd\", cloud);\n\t std::cerr << \"Saved \" << cloud.points.size () << \" data points to test_pcd.pcd.\" << std::endl;\n\n\t for (size_t i = 0; i < cloud.points.size (); ++i)\n\t std::cerr << \" \" << cloud.points[i].x << \" \" << cloud.points[i].y << \" \" << cloud.points[i].z << std::endl;\n\t *\/\n\treturn (0);\n}\n\n<commit_msg>remove kinect2mesh<commit_after><|endoftext|>"} {"text":"<commit_before>#include \"LLVM_Headers.h\"\n#include \"LLVM_Output.h\"\n#include \"LLVM_Runtime_Linker.h\"\n#include \"CodeGen_LLVM.h\"\n#include \"CodeGen_C.h\"\n#include \"CodeGen_Internal.h\"\n\n#include <iostream>\n#include <fstream>\n\n#ifdef _WIN32\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#include <windows.h>\n#else\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#endif\n\nnamespace Halide {\n\nstd::unique_ptr<llvm::raw_fd_ostream> make_raw_fd_ostream(const std::string &filename) {\n std::string error_string;\n std::error_code err;\n std::unique_ptr<llvm::raw_fd_ostream> raw_out(new llvm::raw_fd_ostream(filename, err, llvm::sys::fs::F_None));\n if (err) error_string = err.message();\n internal_assert(error_string.empty())\n << \"Error opening output \" << filename << \": \" << error_string << \"\\n\";\n\n return raw_out;\n}\n\nvoid emit_file(llvm::Module &module, Internal::LLVMOStream& out, llvm::TargetMachine::CodeGenFileType file_type) {\n Internal::debug(1) << \"emit_file.Compiling to native code...\\n\";\n Internal::debug(2) << \"Target triple: \" << module.getTargetTriple() << \"\\n\";\n\n \/\/ Get the target specific parser.\n auto target_machine = Internal::make_target_machine(module);\n internal_assert(target_machine.get()) << \"Could not allocate target machine!\\n\";\n\n #if LLVM_VERSION == 37\n llvm::DataLayout target_data_layout(*(target_machine->getDataLayout()));\n #else\n llvm::DataLayout target_data_layout(target_machine->createDataLayout());\n #endif\n if (!(target_data_layout == module.getDataLayout())) {\n internal_error << \"Warning: module's data layout does not match target machine's\\n\"\n << target_data_layout.getStringRepresentation() << \"\\n\"\n << module.getDataLayout().getStringRepresentation() << \"\\n\";\n }\n\n \/\/ Build up all of the passes that we want to do to the module.\n llvm::legacy::PassManager pass_manager;\n\n pass_manager.add(new llvm::TargetLibraryInfoWrapperPass(llvm::Triple(module.getTargetTriple())));\n\n \/\/ Make sure things marked as always-inline get inlined\n #if LLVM_VERSION < 40\n pass_manager.add(llvm::createAlwaysInlinerPass());\n #else\n pass_manager.add(llvm::createAlwaysInlinerLegacyPass());\n #endif\n\n \/\/ Enable symbol rewriting. This allows code outside libHalide to\n \/\/ use symbol rewriting when compiling Halide code (for example, by\n \/\/ using cl::ParseCommandLineOption and then passing the appropriate\n \/\/ rewrite options via -mllvm flags).\n pass_manager.add(llvm::createRewriteSymbolsPass());\n\n \/\/ Override default to generate verbose assembly.\n target_machine->Options.MCOptions.AsmVerbose = true;\n\n \/\/ Ask the target to add backend passes as necessary.\n target_machine->addPassesToEmitFile(pass_manager, out, file_type);\n\n pass_manager.run(module);\n}\n\nstd::unique_ptr<llvm::Module> compile_module_to_llvm_module(const Module &module, llvm::LLVMContext &context) {\n return codegen_llvm(module, context);\n}\n\nvoid compile_llvm_module_to_object(llvm::Module &module, Internal::LLVMOStream& out) {\n emit_file(module, out, llvm::TargetMachine::CGFT_ObjectFile);\n}\n\nvoid compile_llvm_module_to_assembly(llvm::Module &module, Internal::LLVMOStream& out) {\n emit_file(module, out, llvm::TargetMachine::CGFT_AssemblyFile);\n}\n\nvoid compile_llvm_module_to_llvm_bitcode(llvm::Module &module, Internal::LLVMOStream& out) {\n WriteBitcodeToFile(&module, out);\n}\n\nvoid compile_llvm_module_to_llvm_assembly(llvm::Module &module, Internal::LLVMOStream& out) {\n module.print(out, nullptr);\n}\n\n\/\/ Note that the utilities for get\/set working directory are deliberately *not* in Util.h;\n\/\/ generally speaking, you shouldn't ever need or want to do this, and doing so is asking for\n\/\/ trouble. This exists solely to work around an issue with LLVM, hence its restricted\n\/\/ location. If we ever legitimately need this elsewhere, consider moving it to Util.h.\nnamespace {\n\nstd::string get_current_directory() {\n#ifdef _WIN32\n std::string dir;\n char p[MAX_PATH];\n DWORD ret = GetCurrentDirectoryA(MAX_PATH, p);\n internal_assert(ret == 0) << \"GetCurrentDirectoryA() failed\";\n dir = p;\n return dir;\n#else\n std::string dir;\n char *p = getcwd(nullptr, 0);\n internal_assert(p != NULL) << \"getcwd() failed\";\n dir = p;\n free(p);\n return dir;\n#endif\n}\n\nvoid set_current_directory(const std::string &d) {\n#ifdef _WIN32\n internal_assert(SetCurrentDirectoryA(d.c_str())) << \"SetCurrentDirectoryA() failed\";\n#else\n internal_assert(chdir(d.c_str()) == 0) << \"chdir() failed\";\n#endif\n}\n\nstd::pair<std::string, std::string> dir_and_file(const std::string &path) {\n std::string dir, file;\n size_t slash_pos = path.rfind('\/');\n#ifdef _WIN32\n if (slash_pos == std::string::npos) {\n \/\/ Windows is a thing\n slash_pos = path.rfind('\\\\');\n }\n#endif\n if (slash_pos != std::string::npos) {\n dir = path.substr(0, slash_pos);\n file = path.substr(slash_pos + 1);\n } else {\n file = path;\n }\n return { dir, file };\n}\n\nstruct SetCwd {\n const std::string original_directory;\n explicit SetCwd(const std::string &d) : original_directory(get_current_directory()) {\n if (!d.empty()) {\n set_current_directory(d);\n }\n }\n ~SetCwd() {\n set_current_directory(original_directory);\n }\n};\n\n}\n\nvoid create_static_library(const std::vector<std::string> &src_files_in, const Target &target,\n const std::string &dst_file, bool deterministic) {\n internal_assert(!src_files_in.empty());\n\n \/\/ If we give absolute paths to LLVM, it will dutifully embed them in the resulting\n \/\/ .a file; some versions of 'ar x' are unable to deal with the resulting files,\n \/\/ which is inconvenient. So let's doctor the inputs to be simple filenames,\n \/\/ and temporarily change the working directory. (Note that this requires all the\n \/\/ input files be in the same directory; this is currently always the case for\n \/\/ our existing usage.)\n std::string src_dir = dir_and_file(src_files_in.front()).first;\n std::vector<std::string> src_files;\n for (auto &s_in : src_files_in) {\n auto df = dir_and_file(s_in);\n internal_assert(df.first == src_dir) << \"All inputs to create_static_library() must be in the same directory\";\n for (auto &s_existing : src_files) {\n internal_assert(s_existing != df.second) << \"create_static_library() does not allow duplicate filenames.\";\n }\n src_files.push_back(df.second);\n }\n\n SetCwd set_cwd(src_dir);\n\n#if LLVM_VERSION >= 39\n std::vector<llvm::NewArchiveMember> new_members;\n for (auto &src : src_files) {\n llvm::Expected<llvm::NewArchiveMember> new_member =\n llvm::NewArchiveMember::getFile(src, \/*Deterministic=*\/true);\n if (!new_member) {\n \/\/ Don't use internal_assert: the call to new_member.takeError() will be evaluated\n \/\/ even if the assert does not fail, leaving new_member in an indeterminate\n \/\/ state.\n internal_error << src << \": \" << llvm::toString(new_member.takeError()) << \"\\n\";\n }\n new_members.push_back(std::move(*new_member));\n }\n#elif LLVM_VERSION == 38\n std::vector<llvm::NewArchiveIterator> new_members;\n for (auto &src : src_files) {\n new_members.push_back(llvm::NewArchiveIterator(src));\n }\n#else\n std::vector<llvm::NewArchiveIterator> new_members;\n for (auto &src : src_files) {\n new_members.push_back(llvm::NewArchiveIterator(src, src));\n }\n#endif\n\n const bool write_symtab = true;\n const auto kind = Internal::get_triple_for_target(target).isOSDarwin()\n ? llvm::object::Archive::K_BSD\n : llvm::object::Archive::K_GNU;\n#if LLVM_VERSION == 37\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic);\n#elif LLVM_VERSION == 38\n const bool thin = false;\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic, thin);\n#else\n const bool thin = false;\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic, thin, nullptr);\n#endif\n internal_assert(!result.second) << \"Failed to write archive: \" << dst_file\n << \", reason: \" << result.second << \"\\n\";\n}\n\n} \/\/ namespace Halide\n<commit_msg>Ensure that the dst_file for create_static_library() is an absolute path<commit_after>#include \"LLVM_Headers.h\"\n#include \"LLVM_Output.h\"\n#include \"LLVM_Runtime_Linker.h\"\n#include \"CodeGen_LLVM.h\"\n#include \"CodeGen_C.h\"\n#include \"CodeGen_Internal.h\"\n\n#include <iostream>\n#include <fstream>\n\n#ifdef _WIN32\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#include <windows.h>\n#else\n#include <stdio.h>\n#include <sys\/stat.h>\n#include <unistd.h>\n#endif\n\nnamespace Halide {\n\nstd::unique_ptr<llvm::raw_fd_ostream> make_raw_fd_ostream(const std::string &filename) {\n std::string error_string;\n std::error_code err;\n std::unique_ptr<llvm::raw_fd_ostream> raw_out(new llvm::raw_fd_ostream(filename, err, llvm::sys::fs::F_None));\n if (err) error_string = err.message();\n internal_assert(error_string.empty())\n << \"Error opening output \" << filename << \": \" << error_string << \"\\n\";\n\n return raw_out;\n}\n\nvoid emit_file(llvm::Module &module, Internal::LLVMOStream& out, llvm::TargetMachine::CodeGenFileType file_type) {\n Internal::debug(1) << \"emit_file.Compiling to native code...\\n\";\n Internal::debug(2) << \"Target triple: \" << module.getTargetTriple() << \"\\n\";\n\n \/\/ Get the target specific parser.\n auto target_machine = Internal::make_target_machine(module);\n internal_assert(target_machine.get()) << \"Could not allocate target machine!\\n\";\n\n #if LLVM_VERSION == 37\n llvm::DataLayout target_data_layout(*(target_machine->getDataLayout()));\n #else\n llvm::DataLayout target_data_layout(target_machine->createDataLayout());\n #endif\n if (!(target_data_layout == module.getDataLayout())) {\n internal_error << \"Warning: module's data layout does not match target machine's\\n\"\n << target_data_layout.getStringRepresentation() << \"\\n\"\n << module.getDataLayout().getStringRepresentation() << \"\\n\";\n }\n\n \/\/ Build up all of the passes that we want to do to the module.\n llvm::legacy::PassManager pass_manager;\n\n pass_manager.add(new llvm::TargetLibraryInfoWrapperPass(llvm::Triple(module.getTargetTriple())));\n\n \/\/ Make sure things marked as always-inline get inlined\n #if LLVM_VERSION < 40\n pass_manager.add(llvm::createAlwaysInlinerPass());\n #else\n pass_manager.add(llvm::createAlwaysInlinerLegacyPass());\n #endif\n\n \/\/ Enable symbol rewriting. This allows code outside libHalide to\n \/\/ use symbol rewriting when compiling Halide code (for example, by\n \/\/ using cl::ParseCommandLineOption and then passing the appropriate\n \/\/ rewrite options via -mllvm flags).\n pass_manager.add(llvm::createRewriteSymbolsPass());\n\n \/\/ Override default to generate verbose assembly.\n target_machine->Options.MCOptions.AsmVerbose = true;\n\n \/\/ Ask the target to add backend passes as necessary.\n target_machine->addPassesToEmitFile(pass_manager, out, file_type);\n\n pass_manager.run(module);\n}\n\nstd::unique_ptr<llvm::Module> compile_module_to_llvm_module(const Module &module, llvm::LLVMContext &context) {\n return codegen_llvm(module, context);\n}\n\nvoid compile_llvm_module_to_object(llvm::Module &module, Internal::LLVMOStream& out) {\n emit_file(module, out, llvm::TargetMachine::CGFT_ObjectFile);\n}\n\nvoid compile_llvm_module_to_assembly(llvm::Module &module, Internal::LLVMOStream& out) {\n emit_file(module, out, llvm::TargetMachine::CGFT_AssemblyFile);\n}\n\nvoid compile_llvm_module_to_llvm_bitcode(llvm::Module &module, Internal::LLVMOStream& out) {\n WriteBitcodeToFile(&module, out);\n}\n\nvoid compile_llvm_module_to_llvm_assembly(llvm::Module &module, Internal::LLVMOStream& out) {\n module.print(out, nullptr);\n}\n\n\/\/ Note that the utilities for get\/set working directory are deliberately *not* in Util.h;\n\/\/ generally speaking, you shouldn't ever need or want to do this, and doing so is asking for\n\/\/ trouble. This exists solely to work around an issue with LLVM, hence its restricted\n\/\/ location. If we ever legitimately need this elsewhere, consider moving it to Util.h.\nnamespace {\n\nstd::string get_current_directory() {\n#ifdef _WIN32\n std::string dir;\n char p[MAX_PATH];\n DWORD ret = GetCurrentDirectoryA(MAX_PATH, p);\n internal_assert(ret == 0) << \"GetCurrentDirectoryA() failed\";\n dir = p;\n return dir;\n#else\n std::string dir;\n char *p = getcwd(nullptr, 0);\n internal_assert(p != NULL) << \"getcwd() failed\";\n dir = p;\n free(p);\n return dir;\n#endif\n}\n\nvoid set_current_directory(const std::string &d) {\n#ifdef _WIN32\n internal_assert(SetCurrentDirectoryA(d.c_str())) << \"SetCurrentDirectoryA() failed\";\n#else\n internal_assert(chdir(d.c_str()) == 0) << \"chdir() failed\";\n#endif\n}\n\nstd::pair<std::string, std::string> dir_and_file(const std::string &path) {\n std::string dir, file;\n size_t slash_pos = path.rfind('\/');\n#ifdef _WIN32\n if (slash_pos == std::string::npos) {\n \/\/ Windows is a thing\n slash_pos = path.rfind('\\\\');\n }\n#endif\n if (slash_pos != std::string::npos) {\n dir = path.substr(0, slash_pos);\n file = path.substr(slash_pos + 1);\n } else {\n file = path;\n }\n return { dir, file };\n}\n\nstd::string make_absolute_path(const std::string &path) {\n bool is_absolute = path.size() >= 1 && path[0] == '\/';\n char sep = '\/';\n#ifdef _WIN32\n \/\/ Allow for C:\\whatever or c:\/whatever on Windows\n if (path.size() >= 3 && path[1] == ':' && (path[2] == '\\\\' || path[2] == '\/')) {\n is_absolute = true;\n sep = path[2];\n }\n#endif\n if (!is_absolute) {\n return get_current_directory() + sep + path;\n }\n return path;\n}\n\nstruct SetCwd {\n const std::string original_directory;\n explicit SetCwd(const std::string &d) : original_directory(get_current_directory()) {\n if (!d.empty()) {\n set_current_directory(d);\n }\n }\n ~SetCwd() {\n set_current_directory(original_directory);\n }\n};\n\n}\n\nvoid create_static_library(const std::vector<std::string> &src_files_in, const Target &target,\n const std::string &dst_file_in, bool deterministic) {\n internal_assert(!src_files_in.empty());\n\n \/\/ Ensure that dst_file is an absolute path, since we're going to change the\n \/\/ working directory temporarily.\n std::string dst_file = make_absolute_path(dst_file_in);\n\n \/\/ If we give absolute paths to LLVM, it will dutifully embed them in the resulting\n \/\/ .a file; some versions of 'ar x' are unable to deal with the resulting files,\n \/\/ which is inconvenient. So let's doctor the inputs to be simple filenames,\n \/\/ and temporarily change the working directory. (Note that this requires all the\n \/\/ input files be in the same directory; this is currently always the case for\n \/\/ our existing usage.)\n std::string src_dir = dir_and_file(src_files_in.front()).first;\n std::vector<std::string> src_files;\n for (auto &s_in : src_files_in) {\n auto df = dir_and_file(s_in);\n internal_assert(df.first == src_dir) << \"All inputs to create_static_library() must be in the same directory\";\n for (auto &s_existing : src_files) {\n internal_assert(s_existing != df.second) << \"create_static_library() does not allow duplicate filenames.\";\n }\n src_files.push_back(df.second);\n }\n\n SetCwd set_cwd(src_dir);\n\n#if LLVM_VERSION >= 39\n std::vector<llvm::NewArchiveMember> new_members;\n for (auto &src : src_files) {\n llvm::Expected<llvm::NewArchiveMember> new_member =\n llvm::NewArchiveMember::getFile(src, \/*Deterministic=*\/true);\n if (!new_member) {\n \/\/ Don't use internal_assert: the call to new_member.takeError() will be evaluated\n \/\/ even if the assert does not fail, leaving new_member in an indeterminate\n \/\/ state.\n internal_error << src << \": \" << llvm::toString(new_member.takeError()) << \"\\n\";\n }\n new_members.push_back(std::move(*new_member));\n }\n#elif LLVM_VERSION == 38\n std::vector<llvm::NewArchiveIterator> new_members;\n for (auto &src : src_files) {\n new_members.push_back(llvm::NewArchiveIterator(src));\n }\n#else\n std::vector<llvm::NewArchiveIterator> new_members;\n for (auto &src : src_files) {\n new_members.push_back(llvm::NewArchiveIterator(src, src));\n }\n#endif\n\n const bool write_symtab = true;\n const auto kind = Internal::get_triple_for_target(target).isOSDarwin()\n ? llvm::object::Archive::K_BSD\n : llvm::object::Archive::K_GNU;\n#if LLVM_VERSION == 37\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic);\n#elif LLVM_VERSION == 38\n const bool thin = false;\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic, thin);\n#else\n const bool thin = false;\n auto result = llvm::writeArchive(dst_file, new_members,\n write_symtab, kind,\n deterministic, thin, nullptr);\n#endif\n internal_assert(!result.second) << \"Failed to write archive: \" << dst_file\n << \", reason: \" << result.second << \"\\n\";\n}\n\n} \/\/ namespace Halide\n<|endoftext|>"} {"text":"<commit_before>\/*\n * This file is part of the bitcoin-classic project\n * Copyright (C) 2017 Tom Zander <tomz@freedommail.ch>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"LogChannels_p.h\"\n#include \"util.h\"\n\n#include <iostream>\n\nnamespace {\nstd::string shortenMethod(const char *methodName) {\n assert(methodName);\n const char *start = strchr(methodName, ' ');\n const char *end = strchr(methodName, '(');\n if (!start || start > end)\n start = methodName;\n if (start && end) {\n ++start;\n ++end;\n std::string copy(start, end - start);\n return std::move(copy);\n }\n return std::string();\n}\n\n}\n\nLog::Channel::Channel(TimeStampFormat f)\n : m_timeStampFormat(f),\n m_printSection(true),\n m_printLineNumber(false),\n m_printMethodName(true),\n m_printFilename(false),\n m_showSubSecondPrecision(true)\n{\n}\n\nbool Log::Channel::printSection() const\n{\n return m_printSection;\n}\n\nvoid Log::Channel::setPrintSection(bool printSection)\n{\n m_printSection = printSection;\n}\n\nbool Log::Channel::printLineNumber() const\n{\n return m_printLineNumber;\n}\n\nvoid Log::Channel::setPrintLineNumber(bool printLineNumber)\n{\n m_printLineNumber = printLineNumber;\n}\n\nbool Log::Channel::printMethodName() const\n{\n return m_printMethodName;\n}\n\nvoid Log::Channel::setPrintMethodName(bool printMethodName)\n{\n m_printMethodName = printMethodName;\n}\n\nbool Log::Channel::printFilename() const\n{\n return m_printFilename;\n}\n\nvoid Log::Channel::setPrintFilename(bool printFilename)\n{\n m_printFilename = printFilename;\n}\n\nLog::Channel::TimeStampFormat Log::Channel::timeStampFormat() const\n{\n return m_timeStampFormat;\n}\n\nvoid Log::Channel::setTimeStampFormat(const TimeStampFormat &timeStampFormat)\n{\n m_timeStampFormat = timeStampFormat;\n}\n\nbool Log::Channel::showSubSecondPrecision() const\n{\n return m_showSubSecondPrecision;\n}\n\nvoid Log::Channel::setShowSubSecondPrecision(bool showSubSecondPrecision)\n{\n m_showSubSecondPrecision = showSubSecondPrecision;\n}\n\n\n\/\/ ------------------------------------------------------\n\nConsoleLogChannel::ConsoleLogChannel()\n : Channel(TimeOnly)\n{\n}\n\nvoid ConsoleLogChannel::pushLog(int64_t, std::string *timestamp, const std::string &line, const char *filename, int lineNumber, const char *methodName, short logSection, short logLevel)\n{\n std::ostream &out = logLevel >= Log::WarningLevel ? std::clog : std::cout;\n if (timestamp)\n out << *timestamp << ' ';\n if (m_printSection && logSection) {\n out << '[';\n const std::string section = Log::Manager::sectionString(logSection);\n if (!section.empty())\n out << section;\n else\n out << logSection;\n out << \"] \";\n }\n if (m_printFilename && filename)\n out << filename << (m_printLineNumber ? ':' : ' ');\n if (m_printLineNumber && lineNumber)\n out << lineNumber << ';';\n if (m_printMethodName && methodName) {\n std::string m(shortenMethod(methodName));\n if (!m.empty())\n out << m << \") \";\n }\n out << line;\n if (line.empty() || line.back() != '\\n')\n out << std::endl;\n out.flush();\n}\n\nFileLogChannel::FileLogChannel()\n : Channel(DateTime),\n m_fileout(0)\n{\n reopenLogFiles();\n}\n\nFileLogChannel::~FileLogChannel()\n{\n if (m_fileout)\n fclose(m_fileout);\n}\n\nstatic void FileWriteStr(const std::string &str, FILE *fp) {\n fwrite(str.data(), 1, str.size(), fp);\n}\n\nvoid FileLogChannel::pushLog(int64_t, std::string *timestamp, const std::string &line, const char*, int, const char *methodName, short logSection, short)\n{\n if (m_fileout) {\n if (timestamp) {\n FileWriteStr(*timestamp, m_fileout);\n FileWriteStr(\" \", m_fileout);\n }\n if (m_printSection && logSection) {\n FileWriteStr(\"[\", m_fileout);\n const std::string section = Log::Manager::sectionString(logSection);\n if (section.empty()) {\n std::ostringstream num;\n num << logSection;\n FileWriteStr(num.str() , m_fileout);\n } else {\n FileWriteStr(section , m_fileout);\n }\n FileWriteStr(\"] \", m_fileout);\n }\n if (m_printMethodName && methodName) {\n std::string m(shortenMethod(methodName));\n if (!m.empty()) {\n FileWriteStr(m , m_fileout);\n FileWriteStr(\") \" , m_fileout);\n }\n }\n FileWriteStr(line, m_fileout);\n if (line.empty() || line.back() != '\\n')\n FileWriteStr(\"\\n\", m_fileout);\n }\n}\n\nvoid FileLogChannel::reopenLogFiles()\n{\n if (m_fileout)\n fclose(m_fileout);\n\n boost::filesystem::path pathDebug = GetDataDir() \/ \"debug.log\";\n m_fileout = fopen(pathDebug.string().c_str(), \"a\");\n if (m_fileout)\n setbuf(m_fileout, NULL); \/\/ unbuffered\n}\n<commit_msg>Fix logger skipping first char of constructor<commit_after>\/*\n * This file is part of the bitcoin-classic project\n * Copyright (C) 2017 Tom Zander <tomz@freedommail.ch>\n *\n * This program is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n#include \"LogChannels_p.h\"\n#include \"util.h\"\n\n#include <iostream>\n\nnamespace {\nstd::string shortenMethod(const char *methodName) {\n assert(methodName);\n const char *start = strchr(methodName, ' ');\n const char *end = strchr(methodName, '(');\n if (end) {\n if (!start || start > end)\n start = methodName;\n else\n ++start;\n ++end;\n std::string copy(start, end - start);\n return std::move(copy);\n }\n return std::string();\n}\n\n}\n\nLog::Channel::Channel(TimeStampFormat f)\n : m_timeStampFormat(f),\n m_printSection(true),\n m_printLineNumber(false),\n m_printMethodName(true),\n m_printFilename(false),\n m_showSubSecondPrecision(true)\n{\n}\n\nbool Log::Channel::printSection() const\n{\n return m_printSection;\n}\n\nvoid Log::Channel::setPrintSection(bool printSection)\n{\n m_printSection = printSection;\n}\n\nbool Log::Channel::printLineNumber() const\n{\n return m_printLineNumber;\n}\n\nvoid Log::Channel::setPrintLineNumber(bool printLineNumber)\n{\n m_printLineNumber = printLineNumber;\n}\n\nbool Log::Channel::printMethodName() const\n{\n return m_printMethodName;\n}\n\nvoid Log::Channel::setPrintMethodName(bool printMethodName)\n{\n m_printMethodName = printMethodName;\n}\n\nbool Log::Channel::printFilename() const\n{\n return m_printFilename;\n}\n\nvoid Log::Channel::setPrintFilename(bool printFilename)\n{\n m_printFilename = printFilename;\n}\n\nLog::Channel::TimeStampFormat Log::Channel::timeStampFormat() const\n{\n return m_timeStampFormat;\n}\n\nvoid Log::Channel::setTimeStampFormat(const TimeStampFormat &timeStampFormat)\n{\n m_timeStampFormat = timeStampFormat;\n}\n\nbool Log::Channel::showSubSecondPrecision() const\n{\n return m_showSubSecondPrecision;\n}\n\nvoid Log::Channel::setShowSubSecondPrecision(bool showSubSecondPrecision)\n{\n m_showSubSecondPrecision = showSubSecondPrecision;\n}\n\n\n\/\/ ------------------------------------------------------\n\nConsoleLogChannel::ConsoleLogChannel()\n : Channel(TimeOnly)\n{\n}\n\nvoid ConsoleLogChannel::pushLog(int64_t, std::string *timestamp, const std::string &line, const char *filename, int lineNumber, const char *methodName, short logSection, short logLevel)\n{\n std::ostream &out = logLevel >= Log::WarningLevel ? std::clog : std::cout;\n if (timestamp)\n out << *timestamp << ' ';\n if (m_printSection && logSection) {\n out << '[';\n const std::string section = Log::Manager::sectionString(logSection);\n if (!section.empty())\n out << section;\n else\n out << logSection;\n out << \"] \";\n }\n if (m_printFilename && filename)\n out << filename << (m_printLineNumber ? ':' : ' ');\n if (m_printLineNumber && lineNumber)\n out << lineNumber << ';';\n if (m_printMethodName && methodName) {\n std::string m(shortenMethod(methodName));\n if (!m.empty())\n out << m << \") \";\n }\n out << line;\n if (line.empty() || line.back() != '\\n')\n out << std::endl;\n out.flush();\n}\n\nFileLogChannel::FileLogChannel()\n : Channel(DateTime),\n m_fileout(0)\n{\n reopenLogFiles();\n}\n\nFileLogChannel::~FileLogChannel()\n{\n if (m_fileout)\n fclose(m_fileout);\n}\n\nstatic void FileWriteStr(const std::string &str, FILE *fp) {\n fwrite(str.data(), 1, str.size(), fp);\n}\n\nvoid FileLogChannel::pushLog(int64_t, std::string *timestamp, const std::string &line, const char*, int, const char *methodName, short logSection, short)\n{\n if (m_fileout) {\n if (timestamp) {\n FileWriteStr(*timestamp, m_fileout);\n FileWriteStr(\" \", m_fileout);\n }\n if (m_printSection && logSection) {\n FileWriteStr(\"[\", m_fileout);\n const std::string section = Log::Manager::sectionString(logSection);\n if (section.empty()) {\n std::ostringstream num;\n num << logSection;\n FileWriteStr(num.str() , m_fileout);\n } else {\n FileWriteStr(section , m_fileout);\n }\n FileWriteStr(\"] \", m_fileout);\n }\n if (m_printMethodName && methodName) {\n std::string m(shortenMethod(methodName));\n if (!m.empty()) {\n FileWriteStr(m , m_fileout);\n FileWriteStr(\") \" , m_fileout);\n }\n }\n FileWriteStr(line, m_fileout);\n if (line.empty() || line.back() != '\\n')\n FileWriteStr(\"\\n\", m_fileout);\n }\n}\n\nvoid FileLogChannel::reopenLogFiles()\n{\n if (m_fileout)\n fclose(m_fileout);\n\n boost::filesystem::path pathDebug = GetDataDir() \/ \"debug.log\";\n m_fileout = fopen(pathDebug.string().c_str(), \"a\");\n if (m_fileout)\n setbuf(m_fileout, NULL); \/\/ unbuffered\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied. See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n\n#include \"service\/control-service.h\"\n\n#include \"common\/constant-strings.h\"\n#include \"exec\/kudu-util.h\"\n#include \"kudu\/rpc\/rpc_context.h\"\n#include \"rpc\/rpc-mgr.h\"\n#include \"rpc\/rpc-mgr.inline.h\"\n#include \"runtime\/coordinator.h\"\n#include \"runtime\/exec-env.h\"\n#include \"runtime\/mem-tracker.h\"\n#include \"service\/client-request-state.h\"\n#include \"service\/impala-server.h\"\n#include \"testutil\/fault-injection-util.h\"\n#include \"util\/debug-util.h\"\n#include \"util\/memory-metrics.h\"\n#include \"util\/parse-util.h\"\n#include \"util\/uid-util.h\"\n\n#include \"gen-cpp\/control_service.pb.h\"\n#include \"gen-cpp\/control_service.proxy.h\"\n#include \"gen-cpp\/RuntimeProfile_types.h\"\n\n#include \"common\/names.h\"\n\nusing kudu::rpc::RpcContext;\n\nstatic const string QUEUE_LIMIT_MSG = \"(Advanced) Limit on RPC payloads consumption for \"\n \"ControlService. \" + Substitute(MEM_UNITS_HELP_MSG, \"the process memory limit\");\nDEFINE_string(control_service_queue_mem_limit, \"50MB\", QUEUE_LIMIT_MSG.c_str());\nDEFINE_int32(control_service_num_svc_threads, 0, \"Number of threads for processing \"\n \"control service's RPCs. if left at default value 0, it will be set to number of \"\n \"CPU cores. Set it to a positive value to change from the default.\");\n\nnamespace impala {\n\nControlService::ControlService(MetricGroup* metric_group)\n : ControlServiceIf(ExecEnv::GetInstance()->rpc_mgr()->metric_entity(),\n ExecEnv::GetInstance()->rpc_mgr()->result_tracker()) {\n MemTracker* process_mem_tracker = ExecEnv::GetInstance()->process_mem_tracker();\n bool is_percent; \/\/ not used\n int64_t bytes_limit = ParseUtil::ParseMemSpec(FLAGS_control_service_queue_mem_limit,\n &is_percent, process_mem_tracker->limit());\n if (bytes_limit <= 0) {\n CLEAN_EXIT_WITH_ERROR(Substitute(\"Invalid mem limit for control service queue: \"\n \"'$0'.\", FLAGS_control_service_queue_mem_limit));\n }\n mem_tracker_.reset(new MemTracker(\n bytes_limit, \"Control Service Queue\", process_mem_tracker));\n MemTrackerMetric::CreateMetrics(metric_group, mem_tracker_.get(), \"ControlService\");\n}\n\nStatus ControlService::Init() {\n int num_svc_threads = FLAGS_control_service_num_svc_threads > 0 ?\n FLAGS_control_service_num_svc_threads : CpuInfo::num_cores();\n \/\/ The maximum queue length is set to maximum 32-bit value. Its actual capacity is\n \/\/ bound by memory consumption against 'mem_tracker_'.\n RETURN_IF_ERROR(ExecEnv::GetInstance()->rpc_mgr()->RegisterService(num_svc_threads,\n std::numeric_limits<int32_t>::max(), this, mem_tracker_.get()));\n return Status::OK();\n}\n\nStatus ControlService::GetProxy(const TNetworkAddress& address, const string& hostname,\n unique_ptr<ControlServiceProxy>* proxy) {\n \/\/ Create a ControlService proxy to the destination.\n return ExecEnv::GetInstance()->rpc_mgr()->GetProxy(address, hostname, proxy);\n}\n\nbool ControlService::Authorize(const google::protobuf::Message* req,\n google::protobuf::Message* resp, RpcContext* context) {\n return ExecEnv::GetInstance()->rpc_mgr()->Authorize(\"ControlService\", context,\n mem_tracker_.get());\n}\n\nStatus ControlService::GetProfile(const ReportExecStatusRequestPB& request,\n const ClientRequestState& request_state, kudu::rpc::RpcContext* rpc_context,\n TRuntimeProfileForest* thrift_profiles) {\n \/\/ Debug action to simulate deserialization failure.\n RETURN_IF_ERROR(DebugAction(request_state.query_options(),\n \"REPORT_EXEC_STATUS_PROFILE\"));\n kudu::Slice thrift_profiles_slice;\n KUDU_RETURN_IF_ERROR(rpc_context->GetInboundSidecar(\n request.thrift_profiles_sidecar_idx(), &thrift_profiles_slice),\n \"Failed to get thrift profile sidecar\");\n uint32_t len = thrift_profiles_slice.size();\n RETURN_IF_ERROR(DeserializeThriftMsg(thrift_profiles_slice.data(),\n &len, true, thrift_profiles));\n return Status::OK();\n}\n\nvoid ControlService::ReportExecStatus(const ReportExecStatusRequestPB* request,\n ReportExecStatusResponsePB* response, kudu::rpc::RpcContext* rpc_context) {\n const TUniqueId query_id = ProtoToQueryId(request->query_id());\n shared_ptr<ClientRequestState> request_state =\n ExecEnv::GetInstance()->impala_server()->GetClientRequestState(query_id);\n\n if (request_state.get() == nullptr) {\n \/\/ This is expected occasionally (since a report RPC might be in flight while\n \/\/ cancellation is happening). Return an error to the caller to get it to stop.\n const string& err = Substitute(\"ReportExecStatus(): Received report for unknown \"\n \"query ID (probably closed or cancelled): $0\", PrintId(query_id));\n VLOG(1) << err;\n RespondAndReleaseRpc(Status::Expected(err), response, rpc_context);\n return;\n }\n\n \/\/ This failpoint is to allow jitter to be injected.\n DebugActionNoFail(request_state->query_options(), \"REPORT_EXEC_STATUS_DELAY\");\n\n \/\/ The runtime profile is sent as a Thrift serialized buffer via sidecar. Get the\n \/\/ sidecar and deserialize the thrift profile if there is any. The sender may have\n \/\/ failed to serialize the Thrift profile so an empty thrift profile is valid.\n \/\/ TODO: Fix IMPALA-7232 to indicate incomplete profile in this case.\n TRuntimeProfileForest thrift_profiles;\n if (LIKELY(request->has_thrift_profiles_sidecar_idx())) {\n const Status& profile_status =\n GetProfile(*request, *request_state.get(), rpc_context, &thrift_profiles);\n if (UNLIKELY(!profile_status.ok())) {\n LOG(ERROR) << Substitute(\"ReportExecStatus(): Failed to deserialize profile \"\n \"for query ID $0: $1\", PrintId(request_state->query_id()),\n profile_status.GetDetail());\n \/\/ Do not expose a partially deserialized profile.\n TRuntimeProfileForest empty_profiles;\n swap(thrift_profiles, empty_profiles);\n }\n }\n\n Status resp_status = request_state->UpdateBackendExecStatus(*request, thrift_profiles);\n RespondAndReleaseRpc(resp_status, response, rpc_context);\n}\n\ntemplate<typename ResponsePBType>\nvoid ControlService::RespondAndReleaseRpc(const Status& status, ResponsePBType* response,\n kudu::rpc::RpcContext* rpc_context) {\n status.ToProto(response->mutable_status());\n \/\/ Release the memory against the control service's memory tracker.\n mem_tracker_->Release(rpc_context->GetTransferSize());\n rpc_context->RespondSuccess();\n}\n\n}\n<commit_msg>IMPALA-7183: Include remote host when logging unknown execution status.<commit_after>\/\/ Licensed to the Apache Software Foundation (ASF) under one\n\/\/ or more contributor license agreements. See the NOTICE file\n\/\/ distributed with this work for additional information\n\/\/ regarding copyright ownership. The ASF licenses this file\n\/\/ to you under the Apache License, Version 2.0 (the\n\/\/ \"License\"); you may not use this file except in compliance\n\/\/ with the License. You may obtain a copy of the License at\n\/\/\n\/\/ http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\/\/\n\/\/ Unless required by applicable law or agreed to in writing,\n\/\/ software distributed under the License is distributed on an\n\/\/ \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n\/\/ KIND, either express or implied. See the License for the\n\/\/ specific language governing permissions and limitations\n\/\/ under the License.\n\n#include \"service\/control-service.h\"\n\n#include \"common\/constant-strings.h\"\n#include \"exec\/kudu-util.h\"\n#include \"kudu\/rpc\/rpc_context.h\"\n#include \"rpc\/rpc-mgr.h\"\n#include \"rpc\/rpc-mgr.inline.h\"\n#include \"runtime\/coordinator.h\"\n#include \"runtime\/exec-env.h\"\n#include \"runtime\/mem-tracker.h\"\n#include \"service\/client-request-state.h\"\n#include \"service\/impala-server.h\"\n#include \"testutil\/fault-injection-util.h\"\n#include \"util\/debug-util.h\"\n#include \"util\/memory-metrics.h\"\n#include \"util\/parse-util.h\"\n#include \"util\/uid-util.h\"\n\n#include \"gen-cpp\/control_service.pb.h\"\n#include \"gen-cpp\/control_service.proxy.h\"\n#include \"gen-cpp\/RuntimeProfile_types.h\"\n\n#include \"common\/names.h\"\n\nusing kudu::rpc::RpcContext;\n\nstatic const string QUEUE_LIMIT_MSG = \"(Advanced) Limit on RPC payloads consumption for \"\n \"ControlService. \" + Substitute(MEM_UNITS_HELP_MSG, \"the process memory limit\");\nDEFINE_string(control_service_queue_mem_limit, \"50MB\", QUEUE_LIMIT_MSG.c_str());\nDEFINE_int32(control_service_num_svc_threads, 0, \"Number of threads for processing \"\n \"control service's RPCs. if left at default value 0, it will be set to number of \"\n \"CPU cores. Set it to a positive value to change from the default.\");\n\nnamespace impala {\n\nControlService::ControlService(MetricGroup* metric_group)\n : ControlServiceIf(ExecEnv::GetInstance()->rpc_mgr()->metric_entity(),\n ExecEnv::GetInstance()->rpc_mgr()->result_tracker()) {\n MemTracker* process_mem_tracker = ExecEnv::GetInstance()->process_mem_tracker();\n bool is_percent; \/\/ not used\n int64_t bytes_limit = ParseUtil::ParseMemSpec(FLAGS_control_service_queue_mem_limit,\n &is_percent, process_mem_tracker->limit());\n if (bytes_limit <= 0) {\n CLEAN_EXIT_WITH_ERROR(Substitute(\"Invalid mem limit for control service queue: \"\n \"'$0'.\", FLAGS_control_service_queue_mem_limit));\n }\n mem_tracker_.reset(new MemTracker(\n bytes_limit, \"Control Service Queue\", process_mem_tracker));\n MemTrackerMetric::CreateMetrics(metric_group, mem_tracker_.get(), \"ControlService\");\n}\n\nStatus ControlService::Init() {\n int num_svc_threads = FLAGS_control_service_num_svc_threads > 0 ?\n FLAGS_control_service_num_svc_threads : CpuInfo::num_cores();\n \/\/ The maximum queue length is set to maximum 32-bit value. Its actual capacity is\n \/\/ bound by memory consumption against 'mem_tracker_'.\n RETURN_IF_ERROR(ExecEnv::GetInstance()->rpc_mgr()->RegisterService(num_svc_threads,\n std::numeric_limits<int32_t>::max(), this, mem_tracker_.get()));\n return Status::OK();\n}\n\nStatus ControlService::GetProxy(const TNetworkAddress& address, const string& hostname,\n unique_ptr<ControlServiceProxy>* proxy) {\n \/\/ Create a ControlService proxy to the destination.\n return ExecEnv::GetInstance()->rpc_mgr()->GetProxy(address, hostname, proxy);\n}\n\nbool ControlService::Authorize(const google::protobuf::Message* req,\n google::protobuf::Message* resp, RpcContext* context) {\n return ExecEnv::GetInstance()->rpc_mgr()->Authorize(\"ControlService\", context,\n mem_tracker_.get());\n}\n\nStatus ControlService::GetProfile(const ReportExecStatusRequestPB& request,\n const ClientRequestState& request_state, kudu::rpc::RpcContext* rpc_context,\n TRuntimeProfileForest* thrift_profiles) {\n \/\/ Debug action to simulate deserialization failure.\n RETURN_IF_ERROR(DebugAction(request_state.query_options(),\n \"REPORT_EXEC_STATUS_PROFILE\"));\n kudu::Slice thrift_profiles_slice;\n KUDU_RETURN_IF_ERROR(rpc_context->GetInboundSidecar(\n request.thrift_profiles_sidecar_idx(), &thrift_profiles_slice),\n \"Failed to get thrift profile sidecar\");\n uint32_t len = thrift_profiles_slice.size();\n RETURN_IF_ERROR(DeserializeThriftMsg(thrift_profiles_slice.data(),\n &len, true, thrift_profiles));\n return Status::OK();\n}\n\nvoid ControlService::ReportExecStatus(const ReportExecStatusRequestPB* request,\n ReportExecStatusResponsePB* response, kudu::rpc::RpcContext* rpc_context) {\n const TUniqueId query_id = ProtoToQueryId(request->query_id());\n shared_ptr<ClientRequestState> request_state =\n ExecEnv::GetInstance()->impala_server()->GetClientRequestState(query_id);\n\n if (request_state.get() == nullptr) {\n \/\/ This is expected occasionally (since a report RPC might be in flight while\n \/\/ cancellation is happening). Return an error to the caller to get it to stop.\n const string& err = Substitute(\"ReportExecStatus(): Received report for unknown \"\n \"query ID (probably closed or cancelled): $0 \"\n \"remote host=$1\",\n PrintId(query_id), rpc_context->remote_address().ToString());\n VLOG(1) << err;\n RespondAndReleaseRpc(Status::Expected(err), response, rpc_context);\n return;\n }\n\n \/\/ This failpoint is to allow jitter to be injected.\n DebugActionNoFail(request_state->query_options(), \"REPORT_EXEC_STATUS_DELAY\");\n\n \/\/ The runtime profile is sent as a Thrift serialized buffer via sidecar. Get the\n \/\/ sidecar and deserialize the thrift profile if there is any. The sender may have\n \/\/ failed to serialize the Thrift profile so an empty thrift profile is valid.\n \/\/ TODO: Fix IMPALA-7232 to indicate incomplete profile in this case.\n TRuntimeProfileForest thrift_profiles;\n if (LIKELY(request->has_thrift_profiles_sidecar_idx())) {\n const Status& profile_status =\n GetProfile(*request, *request_state.get(), rpc_context, &thrift_profiles);\n if (UNLIKELY(!profile_status.ok())) {\n LOG(ERROR) << Substitute(\"ReportExecStatus(): Failed to deserialize profile \"\n \"for query ID $0: $1\", PrintId(request_state->query_id()),\n profile_status.GetDetail());\n \/\/ Do not expose a partially deserialized profile.\n TRuntimeProfileForest empty_profiles;\n swap(thrift_profiles, empty_profiles);\n }\n }\n\n Status resp_status = request_state->UpdateBackendExecStatus(*request, thrift_profiles);\n RespondAndReleaseRpc(resp_status, response, rpc_context);\n}\n\ntemplate<typename ResponsePBType>\nvoid ControlService::RespondAndReleaseRpc(const Status& status, ResponsePBType* response,\n kudu::rpc::RpcContext* rpc_context) {\n status.ToProto(response->mutable_status());\n \/\/ Release the memory against the control service's memory tracker.\n mem_tracker_->Release(rpc_context->GetTransferSize());\n rpc_context->RespondSuccess();\n}\n\n}\n<|endoftext|>"} {"text":"<commit_before>\n#include \"Globals.h\" \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Rabbit.h\"\n#include \"..\/Entities\/Player.h\"\n#include \"..\/World.h\"\n\n\n\n\n\ncRabbit::cRabbit(void) :\n\tsuper(\"Rabbit\", mtRabbit, \"mob.rabbit.idle\", \"mob.rabbit.death\", 0.9, 0.9)\n{\n}\n\n\n\n\n\nvoid cRabbit::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\tint LootingLevel = 0;\n\tif (a_Killer != nullptr)\n\t{\n\t\tLootingLevel = a_Killer->GetEquippedWeapon().m_Enchantments.GetLevel(cEnchantments::enchLooting);\n\t}\n\tAddRandomDropItem(a_Drops, 0, 1 + LootingLevel, IsOnFire() ? E_ITEM_COOKED_RABBIT : E_ITEM_RAW_RABBIT);\n\tAddRandomDropItem(a_Drops, 0, 1 + LootingLevel, E_ITEM_RABBIT_HIDE);\n\tcItems RareDrops;\n\tRareDrops.Add(cItem(E_ITEM_RABBITS_FOOT));\n\tAddRandomRareDropItem(a_Drops, RareDrops, LootingLevel);\n}\n\n\n\n\n\n<commit_msg>Fixed Rabbit size<commit_after>\n#include \"Globals.h\" \/\/ NOTE: MSVC stupidness requires this to be the same across all modules\n\n#include \"Rabbit.h\"\n#include \"..\/Entities\/Player.h\"\n#include \"..\/World.h\"\n\n\n\n\n\ncRabbit::cRabbit(void) :\n\tsuper(\"Rabbit\", mtRabbit, \"mob.rabbit.idle\", \"mob.rabbit.death\", 0.82, 0.68)\n{\n}\n\n\n\n\n\nvoid cRabbit::GetDrops(cItems & a_Drops, cEntity * a_Killer)\n{\n\tint LootingLevel = 0;\n\tif (a_Killer != nullptr)\n\t{\n\t\tLootingLevel = a_Killer->GetEquippedWeapon().m_Enchantments.GetLevel(cEnchantments::enchLooting);\n\t}\n\tAddRandomDropItem(a_Drops, 0, 1 + LootingLevel, IsOnFire() ? E_ITEM_COOKED_RABBIT : E_ITEM_RAW_RABBIT);\n\tAddRandomDropItem(a_Drops, 0, 1 + LootingLevel, E_ITEM_RABBIT_HIDE);\n\tcItems RareDrops;\n\tRareDrops.Add(cItem(E_ITEM_RABBITS_FOOT));\n\tAddRandomRareDropItem(a_Drops, RareDrops, LootingLevel);\n}\n\n\n\n\n\n<|endoftext|>"} {"text":"<commit_before>\/* Copyright (C) 2017 BARBOTIN Nicolas\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this\n * software and associated documentation files (the \"Software\"), to deal in the Software\n * without restriction, including without limitation the rights to use, copy, modify,\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to permit\n * persons to whom the Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies\n * or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR\n * PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n * OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"mgpcl\/ProgramArgs.h\"\n#include <iostream>\n\n\/*************************************** ArgValue ***************************************\/\n\nm::ArgValue::~ArgValue()\n{\n if(m_values != nullptr) {\n const int cnt = valueCount();\n for(int i = 0; i < cnt; i++)\n m_values[i].~String();\n\n delete[] reinterpret_cast<uint8_t*>(m_values);\n }\n}\n\n\/*************************************** ArgDescriptor ***************************************\/\n\nm::ArgDescriptor::ArgDescriptor(ArgType t, const String &n)\n{\n m_type = t;\n m_optional = true;\n m_numeric = false;\n m_unique = true;\n m_names.add(n);\n m_lastErr = kAE_NoError;\n m_default = nullptr;\n}\n\nm::ArgDescriptor::~ArgDescriptor()\n{\n for(ArgValue *v : m_values)\n v->removeRef();\n\n if(m_default != nullptr)\n m_default->removeRef();\n}\n\nbool m::ArgDescriptor::matches(const String &name) const\n{\n for(const String &s: m_names) {\n if(name == s)\n return true;\n }\n\n return false;\n}\n\nm::ArgValue *m::ArgDescriptor::parse(int *argc, const char ***argv)\n{\n if((m_unique || m_type == kAT_Switch) && !m_values.isEmpty()) {\n m_lastErr = kAE_AlreadySet;\n return nullptr;\n }\n\n int needed = static_cast<int>(m_type) + 1; \/\/Don't forget (*argv)[0] == argName, and then comes values\n if(*argc < needed) {\n m_lastErr = kAE_MissingValues;\n return nullptr;\n }\n\n ArgValue *ret = new ArgValue(this);\n ret->allocate(needed);\n\n if(m_type == kAT_Switch)\n new(ret->m_values) String(\"true\");\n else {\n bool wrongFormat = false;\n\n for(int i = 0; i < needed - 1; i++) {\n new(ret->m_values + i) String((*argv)[i + 1]);\n\n if(m_numeric && !wrongFormat && !ret->m_values[i].isNumber())\n wrongFormat = true;\n }\n\n if(wrongFormat) {\n m_lastErr = kAE_NotNumeric;\n delete ret; \/\/Destructor will care about allocated strings. Also, no need to use removeRef()\n return nullptr;\n }\n }\n\n \/\/Everything went fine\n m_values.add(ret);\n ret->addRef();\n\n *argc -= needed;\n *argv += needed;\n return ret;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Single, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate();\n new(m_default->m_values) String(a);\n\n m_default->addRef();\n return *this;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a, const String &b)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Dual, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate(2);\n new(m_default->m_values + 0) String(a);\n new(m_default->m_values + 1) String(b);\n\n m_default->addRef();\n return *this;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a, const String &b, const String &c)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Triple, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate(3);\n new(m_default->m_values + 0) String(a);\n new(m_default->m_values + 1) String(b);\n new(m_default->m_values + 2) String(c);\n\n m_default->addRef();\n return *this;\n}\n\nvoid m::ArgDescriptor::clearValues()\n{\n for(ArgValue *v : m_values)\n v->removeRef();\n\n m_values.cleanup();\n}\n\nm::String m::ArgDescriptor::errorString() const\n{\n switch(m_lastErr) {\n case kAE_NoError:\n return String(\"No error\");\n\n case kAE_MissingValues:\n return String(m_type == kAT_Single ? \"Missing value\" : \"Missing values\");\n\n case kAE_NotNumeric:\n return String(\"One or more value has an invalid numeric format\");\n\n case kAE_AlreadySet:\n return String(\"Multiple instances of this argument found\");\n\n case kAE_Required:\n return String(\"This argument is required and wasn't set\");\n\n default:\n return String(\"Unknown error\");\n }\n}\n\n\/*************************************** ProgramArgs ***************************************\/\n\nm::ProgramArgs::~ProgramArgs()\n{\n for(ArgValue *v : m_args)\n v->removeRef();\n\n for(ArgDescriptor *d: m_descr)\n delete d;\n}\n\nm::ArgDescriptor *m::ProgramArgs::argByName(const String &name)\n{\n for(ArgDescriptor *d: m_descr) {\n if(d->matches(name))\n return d;\n }\n\n return nullptr;\n}\n\nm::ArgDescriptor &m::ProgramArgs::add(const String &n, ArgType t)\n{\n ArgDescriptor *ret = new ArgDescriptor(t, n);\n m_descr.add(ret);\n\n return *ret;\n}\n\nm::ArgDescriptor &m::ProgramArgs::addHelpSwitch(const String &name)\n{\n ArgDescriptor *ret = new ArgDescriptor(kAT_Switch, name);\n m_descr.add(ret);\n\n m_helpSwitch = ret;\n return *ret;\n}\n\nm::ArgParseError m::ProgramArgs::parse()\n{\n int argc = m_argc - 1; \/\/First argument is program binary location, so ignore it...\n const char **argv = m_argv + 1;\n\n \/\/Cleanup existing args & error\n for(ArgDescriptor *ad : m_descr)\n ad->clearValues();\n\n for(ArgValue *v : m_args)\n v->removeRef();\n\n m_args.cleanup();\n m_err = nullptr;\n m_remainingIdx = -1;\n m_unrecognized.clear();\n\n \/\/Parse from descriptors\n bool argFound = true;\n while(argFound && argc > 0) {\n ArgDescriptor *d = argByName(*argv);\n\n if(d == nullptr)\n argFound = false;\n else {\n ArgValue *v = d->parse(&argc, &argv);\n if(v == nullptr) {\n m_err = d;\n m_lastErr = kAPE_ArgError;\n\n return kAPE_ArgError; \/\/Something wrong happened.\n }\n\n m_args.add(v);\n v->addRef();\n }\n }\n\n \/\/Make sure everyone has its value\n for(ArgDescriptor *d: m_descr) {\n if(d->m_type == kAT_Switch && d->m_values.isEmpty()) {\n ArgValue *av = new ArgValue(d);\n av->allocate();\n new(av->m_values) String(\"false\");\n\n av->addRef(); \/\/Ref will be destroyed by ArgDescriptor\n d->m_values.add(av);\n } if(!d->isSatisfied() && (!m_helpIgnoreReqs || m_helpSwitch == nullptr)) {\n d->m_lastErr = kAE_Required;\n\n m_err = d;\n m_lastErr = kAPE_ArgError;\n return kAPE_ArgError;\n }\n }\n\n \/\/Append remaining arguments\n if(argc > 0) {\n if(!m_acceptsRem) {\n m_unrecognized = *argv;\n m_lastErr = kAPE_UnknownArgFound;\n return kAPE_UnknownArgFound;\n }\n\n m_remainingIdx = m_args.size();\n }\n\n while(argc > 0) {\n ArgValue *v = new ArgValue(nullptr); \/\/No parent\n v->allocate();\n new(v->m_values) String(*argv);\n\n \/\/Append value & next arg\n m_args.add(v);\n v->addRef();\n\n argc--;\n argv++;\n }\n\n \/\/Print help if needed\n if(m_helpSwitch != nullptr && m_helpSwitch->isSet())\n printHelp();\n\n m_lastErr = kAPE_NoError;\n return kAPE_NoError;\n}\n\nvoid m::ProgramArgs::printHelp() const\n{\n int maxlen = 0;\n String *descr = new String[m_descr.size()];\n\n for(int i = 0; i < m_descr.size(); i++) {\n descr[i] = m_descr[i]->name();\n for(int j = 1; j < m_descr[i]->nameCount(); j++) {\n descr[i] += \", \";\n descr[i] += m_descr[i]->name(j);\n }\n\n descr[i] += \": \";\n if(descr[i].length() > maxlen)\n maxlen = descr[i].length();\n }\n\n if(!m_helpHdr.isEmpty())\n std::cout << m_helpHdr.raw() << std::endl << std::endl;\n\n for(int i = 0; i < m_descr.size(); i++) {\n int delta = maxlen - descr[i].length();\n std::cout << descr[i].raw();\n\n for(int j = 0; j < delta; j++)\n std::cout << ' ';\n\n std::cout << m_descr[i]->helpText().raw() << std::endl;\n }\n\n delete[] descr;\n}\n\nm::String m::ProgramArgs::errorString() const\n{\n if(m_lastErr == kAPE_NoError)\n return String(\"No error\");\n else if(m_lastErr == kAPE_UnknownArgFound)\n return String(\"Found unrecognized argument \") + m_unrecognized;\n else if(m_lastErr == kAPE_ArgError) {\n String ret(\"Argument \\\"\");\n ret += m_err->name();\n ret += \"\\\" errored: \";\n ret += m_err->errorString();\n\n return ret;\n }\n\n return String(\"Unknown error\");\n}\n<commit_msg>* Fixed segmentation fault caused by help switch of ProgramArgs<commit_after>\/* Copyright (C) 2017 BARBOTIN Nicolas\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this\n * software and associated documentation files (the \"Software\"), to deal in the Software\n * without restriction, including without limitation the rights to use, copy, modify,\n * merge, publish, distribute, sublicense, and\/or sell copies of the Software, and to permit\n * persons to whom the Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies\n * or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n * INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR\n * PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\n * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\n * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE\n * OR OTHER DEALINGS IN THE SOFTWARE.\n *\/\n\n#include \"mgpcl\/ProgramArgs.h\"\n#include <iostream>\n\n\/*************************************** ArgValue ***************************************\/\n\nm::ArgValue::~ArgValue()\n{\n if(m_values != nullptr) {\n const int cnt = valueCount();\n for(int i = 0; i < cnt; i++)\n m_values[i].~String();\n\n delete[] reinterpret_cast<uint8_t*>(m_values);\n }\n}\n\n\/*************************************** ArgDescriptor ***************************************\/\n\nm::ArgDescriptor::ArgDescriptor(ArgType t, const String &n)\n{\n m_type = t;\n m_optional = true;\n m_numeric = false;\n m_unique = true;\n m_names.add(n);\n m_lastErr = kAE_NoError;\n m_default = nullptr;\n}\n\nm::ArgDescriptor::~ArgDescriptor()\n{\n for(ArgValue *v : m_values)\n v->removeRef();\n\n if(m_default != nullptr)\n m_default->removeRef();\n}\n\nbool m::ArgDescriptor::matches(const String &name) const\n{\n for(const String &s: m_names) {\n if(name == s)\n return true;\n }\n\n return false;\n}\n\nm::ArgValue *m::ArgDescriptor::parse(int *argc, const char ***argv)\n{\n if((m_unique || m_type == kAT_Switch) && !m_values.isEmpty()) {\n m_lastErr = kAE_AlreadySet;\n return nullptr;\n }\n\n int needed = static_cast<int>(m_type) + 1; \/\/Don't forget (*argv)[0] == argName, and then comes values\n if(*argc < needed) {\n m_lastErr = kAE_MissingValues;\n return nullptr;\n }\n\n ArgValue *ret = new ArgValue(this);\n ret->allocate(needed);\n\n if(m_type == kAT_Switch)\n new(ret->m_values) String(\"true\");\n else {\n bool wrongFormat = false;\n\n for(int i = 0; i < needed - 1; i++) {\n new(ret->m_values + i) String((*argv)[i + 1]);\n\n if(m_numeric && !wrongFormat && !ret->m_values[i].isNumber())\n wrongFormat = true;\n }\n\n if(wrongFormat) {\n m_lastErr = kAE_NotNumeric;\n delete ret; \/\/Destructor will care about allocated strings. Also, no need to use removeRef()\n return nullptr;\n }\n }\n\n \/\/Everything went fine\n m_values.add(ret);\n ret->addRef();\n\n *argc -= needed;\n *argv += needed;\n return ret;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Single, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate();\n new(m_default->m_values) String(a);\n\n m_default->addRef();\n return *this;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a, const String &b)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Dual, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate(2);\n new(m_default->m_values + 0) String(a);\n new(m_default->m_values + 1) String(b);\n\n m_default->addRef();\n return *this;\n}\n\nm::ArgDescriptor &m::ArgDescriptor::setDefault(const String &a, const String &b, const String &c)\n{\n if(m_default != nullptr)\n m_default->removeRef();\n\n mAssert(m_type == kAT_Triple, \"invalid default value\");\n\n m_default = new ArgValue(this);\n m_default->allocate(3);\n new(m_default->m_values + 0) String(a);\n new(m_default->m_values + 1) String(b);\n new(m_default->m_values + 2) String(c);\n\n m_default->addRef();\n return *this;\n}\n\nvoid m::ArgDescriptor::clearValues()\n{\n for(ArgValue *v : m_values)\n v->removeRef();\n\n m_values.cleanup();\n}\n\nm::String m::ArgDescriptor::errorString() const\n{\n switch(m_lastErr) {\n case kAE_NoError:\n return String(\"No error\");\n\n case kAE_MissingValues:\n return String(m_type == kAT_Single ? \"Missing value\" : \"Missing values\");\n\n case kAE_NotNumeric:\n return String(\"One or more value has an invalid numeric format\");\n\n case kAE_AlreadySet:\n return String(\"Multiple instances of this argument found\");\n\n case kAE_Required:\n return String(\"This argument is required and wasn't set\");\n\n default:\n return String(\"Unknown error\");\n }\n}\n\n\/*************************************** ProgramArgs ***************************************\/\n\nm::ProgramArgs::~ProgramArgs()\n{\n for(ArgValue *v : m_args)\n v->removeRef();\n\n for(ArgDescriptor *d: m_descr)\n delete d;\n}\n\nm::ArgDescriptor *m::ProgramArgs::argByName(const String &name)\n{\n for(ArgDescriptor *d: m_descr) {\n if(d->matches(name))\n return d;\n }\n\n return nullptr;\n}\n\nm::ArgDescriptor &m::ProgramArgs::add(const String &n, ArgType t)\n{\n ArgDescriptor *ret = new ArgDescriptor(t, n);\n m_descr.add(ret);\n\n return *ret;\n}\n\nm::ArgDescriptor &m::ProgramArgs::addHelpSwitch(const String &name)\n{\n ArgDescriptor *ret = new ArgDescriptor(kAT_Switch, name);\n m_descr.add(ret);\n\n m_helpSwitch = ret;\n return *ret;\n}\n\nm::ArgParseError m::ProgramArgs::parse()\n{\n int argc = m_argc - 1; \/\/First argument is program binary location, so ignore it...\n const char **argv = m_argv + 1;\n\n \/\/Cleanup existing args & error\n for(ArgDescriptor *ad : m_descr)\n ad->clearValues();\n\n for(ArgValue *v : m_args)\n v->removeRef();\n\n m_args.cleanup();\n m_err = nullptr;\n m_remainingIdx = -1;\n m_unrecognized.clear();\n\n \/\/Parse from descriptors\n bool argFound = true;\n while(argFound && argc > 0) {\n ArgDescriptor *d = argByName(*argv);\n\n if(d == nullptr)\n argFound = false;\n else {\n ArgValue *v = d->parse(&argc, &argv);\n if(v == nullptr) {\n m_err = d;\n m_lastErr = kAPE_ArgError;\n\n return kAPE_ArgError; \/\/Something wrong happened.\n }\n\n m_args.add(v);\n v->addRef();\n }\n }\n\n const bool ignoreReqs = m_helpIgnoreReqs && m_helpSwitch != nullptr && !m_helpSwitch->m_values.isEmpty();\n\n \/\/Make sure everyone has its value\n for(ArgDescriptor *d: m_descr) {\n if(d->m_type == kAT_Switch && d->m_values.isEmpty()) {\n ArgValue *av = new ArgValue(d);\n av->allocate();\n new(av->m_values) String(\"false\");\n\n av->addRef(); \/\/Ref will be destroyed by ArgDescriptor\n d->m_values.add(av);\n } if(!d->isSatisfied() && !ignoreReqs) {\n d->m_lastErr = kAE_Required;\n\n m_err = d;\n m_lastErr = kAPE_ArgError;\n return kAPE_ArgError;\n }\n }\n\n \/\/Append remaining arguments\n if(argc > 0) {\n if(!m_acceptsRem) {\n m_unrecognized = *argv;\n m_lastErr = kAPE_UnknownArgFound;\n return kAPE_UnknownArgFound;\n }\n\n m_remainingIdx = m_args.size();\n }\n\n while(argc > 0) {\n ArgValue *v = new ArgValue(nullptr); \/\/No parent\n v->allocate();\n new(v->m_values) String(*argv);\n\n \/\/Append value & next arg\n m_args.add(v);\n v->addRef();\n\n argc--;\n argv++;\n }\n\n \/\/Print help if needed\n if(m_helpSwitch != nullptr && m_helpSwitch->isSet())\n printHelp();\n\n m_lastErr = kAPE_NoError;\n return kAPE_NoError;\n}\n\nvoid m::ProgramArgs::printHelp() const\n{\n int maxlen = 0;\n String *descr = new String[m_descr.size()];\n\n for(int i = 0; i < m_descr.size(); i++) {\n descr[i] = m_descr[i]->name();\n for(int j = 1; j < m_descr[i]->nameCount(); j++) {\n descr[i] += \", \";\n descr[i] += m_descr[i]->name(j);\n }\n\n descr[i] += \": \";\n if(descr[i].length() > maxlen)\n maxlen = descr[i].length();\n }\n\n if(!m_helpHdr.isEmpty())\n std::cout << m_helpHdr.raw() << std::endl << std::endl;\n\n for(int i = 0; i < m_descr.size(); i++) {\n int delta = maxlen - descr[i].length();\n std::cout << descr[i].raw();\n\n for(int j = 0; j < delta; j++)\n std::cout << ' ';\n\n std::cout << m_descr[i]->helpText().raw() << std::endl;\n }\n\n delete[] descr;\n}\n\nm::String m::ProgramArgs::errorString() const\n{\n if(m_lastErr == kAPE_NoError)\n return String(\"No error\");\n else if(m_lastErr == kAPE_UnknownArgFound)\n return String(\"Found unrecognized argument \") + m_unrecognized;\n else if(m_lastErr == kAPE_ArgError) {\n String ret(\"Argument \\\"\");\n ret += m_err->name();\n ret += \"\\\" errored: \";\n ret += m_err->errorString();\n\n return ret;\n }\n\n return String(\"Unknown error\");\n}\n<|endoftext|>"} {"text":"<commit_before>\/\/ PythonStuff.cpp\n\/\/ Copyright (c) 2009, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include <wx\/file.h>\n#include <wx\/mimetype.h>\n#include <wx\/stdpaths.h>\n#include <wx\/filename.h>\n#include <wx\/txtstrm.h>\n#include <wx\/log.h>\n#include \"PythonStuff.h\"\n#include \"ProgramCanvas.h\"\n#include \"OutputCanvas.h\"\n#include \"Program.h\"\n#include \"CNCConfig.h\"\n#include \"interface\/PropertyString.h\"\n\n\/\/static\nbool CPyProcess::redirect = true;\n\nCPyProcess::CPyProcess(void)\n{\n m_pid = 0;\n wxProcess(heeksCAD->GetMainFrame());\n Connect(wxEVT_TIMER, wxTimerEventHandler(CPyProcess::OnTimer));\n m_timer.SetOwner(this);\n\n}\n\nvoid CPyProcess::OnTimer(wxTimerEvent& event)\n{\n HandleInput();\n}\n\nvoid CPyProcess::HandleInput(void) {\n\twxInputStream *m_in, *m_err;\n\n\tm_in = GetInputStream();\n\tm_err = GetErrorStream();\n\n\tif (m_in) {\n\t\twxString s;\n\t\twhile (m_in->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_in->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_in->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"> %s\"), s.c_str());\n\t\t}\n\t}\n\tif (m_err) {\n\t\twxString s;\n\t\twhile (m_err->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_err->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_err->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"! %s\"), s.c_str());\n\t\t}\n\t}\n}\n\nvoid CPyProcess::Execute(const wxChar* cmd)\n{\n\tif(redirect) {\n\t\tRedirect();\n\t}\n\t\/\/ make process group leader so Cancel kan terminate process including children\n\tm_pid = wxExecute(cmd, wxEXEC_ASYNC|wxEXEC_MAKE_GROUP_LEADER, this);\n\tif (!m_pid) {\n\t wxLogMessage(_T(\"could not execute '%s'\"),cmd);\n\t} else {\n\t wxLogMessage(_T(\"starting '%s' (%d)\"),cmd,m_pid);\n\t}\n\tif (redirect) {\n\t\tm_timer.Start(100); \/\/msec\n\t}\n}\n\nvoid CPyProcess::Cancel(void)\n{\n\tif (m_pid)\n\t{\n\t\twxKillError kerror;\n\t\twxSignal sig = wxSIGTERM;\n\t\tint retcode;\n\n\t\tif ( wxProcess::Exists(m_pid) ) {\n\t\t\tretcode = wxKill(m_pid, sig, &kerror, wxKILL_CHILDREN);\n\t\t\tswitch (kerror) {\n\t\t\tcase wxKILL_OK:\n\t\t\t\twxLogMessage(_T(\"sent signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_NO_PROCESS:\n\t\t\t\twxLogMessage(_T(\"process %d already exited\"),m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ACCESS_DENIED:\n\t\t\t\twxLogMessage(_T(\"sending signal %d to process %d - access denied\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_BAD_SIGNAL: \/\/ no such signal\n\t\t\t\twxLogMessage(_T(\"no such signal: %d\"),sig);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ERROR: \/\/ another, unspecified error\n\t\t\t\twxLogMessage(_T(\"unspecified error sending signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\twxLogMessage(_T(\"process %d has gone away\"), m_pid);\n\t\t}\n\t\tm_pid = 0;\n\t}\n}\n\nvoid CPyProcess::OnTerminate(int pid, int status)\n{\n\tif (pid == m_pid)\n\t{\n\t if (redirect) {\n\t\t m_timer.Stop();\n\t\t HandleInput(); \/\/ anything left?\n\t }\n\t if (status) {\n\t\t wxLogMessage(_T(\"process %d exit(%d)\"),pid, status);\n\t } else {\n\t\t wxLogDebug(_T(\"process %d exit(0)\"),pid);\n\t }\n\t m_pid = 0;\n\t ThenDo();\n\t}\n\t\/\/ else: the process already was already treated with Cancel() so m_pid is 0\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CPyBackPlot : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\tHeeksObj* m_into;\n\twxString m_filename;\n\twxBusyCursor *m_busy_cursor;\n\n\tstatic CPyBackPlot* m_object;\n\npublic:\n\tCPyBackPlot(const CProgram* program, HeeksObj* into, const wxChar* filename): m_program(program), m_into(into),m_filename(filename),m_busy_cursor(NULL) { m_object = this; }\n\t~CPyBackPlot(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\tif(m_busy_cursor == NULL)m_busy_cursor = new wxBusyCursor();\n\n\t\tif (m_program->m_machine.file_name == _T(\"not found\"))\n\t\t{\n\t\t\twxMessageBox(_T(\"Machine name (defined in Program Properties) not found\"));\n\t\t} \/\/ End if - then\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\tExecute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + _T(\"\\\\nc_read.bat\\\" \") + m_program->m_machine.file_name + _T(\" \\\"\") + m_filename + _T(\"\\\"\"));\n#else\n#ifdef RUNINPLACE\n wxString path(_T(\"\/nc\/\"));\n#else\n wxString path(_T(\"\/..\/heekscnc\/nc\/\"));\n#endif\n\n\t\t\tExecute(wxString(_T(\"python \\\"\")) + theApp.GetDllFolder() + path + m_program->m_machine.file_name + wxString(_T(\"_read.py\\\" \\\"\")) + m_filename + wxString(_T(\"\\\"\")) );\n#endif\n\t\t} \/\/ End if - else\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\t\/\/ there should now be a .nc.xml written\n\t\twxString xml_file_str = m_filename + wxString(_T(\".nc.xml\"));\n\t\twxFile ofs(xml_file_str.c_str());\n\t\tif(!ofs.IsOpened())\n\t\t{\n\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + xml_file_str);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ read the xml file, just like paste, into the program\n\t\theeksCAD->OpenXMLFile(xml_file_str, m_into);\n\t\theeksCAD->Repaint();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\tdelete m_busy_cursor;\n\t\tm_busy_cursor = NULL;\n\t}\n};\n\nCPyBackPlot* CPyBackPlot::m_object = NULL;\n\nclass CPyPostProcess : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\twxString m_filename;\n\tbool m_include_backplot_processing;\n\n\tstatic CPyPostProcess* m_object;\n\npublic:\n\tCPyPostProcess(const CProgram* program,\n\t\t\tconst wxChar* filename,\n\t\t\tconst bool include_backplot_processing = true ) :\n\t\tm_program(program), m_filename(filename), m_include_backplot_processing(include_backplot_processing)\n\t{\n\t\tm_object = this;\n\t}\n\n\t~CPyPostProcess(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\t\twxStandardPaths standard_paths;\n\t\twxFileName path( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n#ifdef WIN32\n Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + wxString(_T(\"\\\\post.bat\\\" \\\"\")) + path.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n\n wxString post_path = wxString(_T(\"python \")) + path.GetFullPath();\n\t\tExecute(post_path);\n#endif\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\tif (m_include_backplot_processing)\n\t\t{\n\t\t\t(new CPyBackPlot(m_program, (HeeksObj*)m_program, m_filename))->Do();\n\t\t}\n\t}\n};\n\nCPyPostProcess* CPyPostProcess::m_object = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool write_python_file(const wxString& python_file_path)\n{\n\twxFile ofs(python_file_path.c_str(), wxFile::write);\n\tif(!ofs.IsOpened())return false;\n\n\tofs.Write(theApp.m_program->m_python_program.c_str());\n\n\treturn true;\n}\n\nbool HeeksPyPostProcess(const CProgram* program, const wxString &filepath, const bool include_backplot_processing)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t\/\/ write the python file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName file_str( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n\t\tif(!write_python_file(file_str.GetFullPath()))\n\t\t{\n\t\t wxString error;\n\t\t error << _T(\"couldn't write \") << file_str.GetFullPath();\n\t\t wxMessageBox(error.c_str());\n\t\t}\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\t\/\/ Set the working directory to the area that contains the DLL so that\n\t\t\t\/\/ the system can find the post.bat file correctly.\n\t\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n#else\n\t\t\t::wxSetWorkingDirectory(standard_paths.GetTempDir());\n#endif\n\n\t\t\t\/\/ call the python file\n\t\t\t(new CPyPostProcess(program, filepath, include_backplot_processing))->Do();\n\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while post-processing the program!\"));\n\t}\n\treturn false;\n}\n\nbool HeeksPyBackplot(const CProgram* program, HeeksObj* into, const wxString &filepath)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n\n\t\t\/\/ call the python file\n\t\t(new CPyBackPlot(program, into, filepath))->Do();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\treturn true;\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while backplotting the program!\"));\n\t}\n\treturn false;\n}\n\nvoid HeeksPyCancel(void)\n{\n\tCPyBackPlot::StaticCancel();\n\tCPyPostProcess::StaticCancel();\n}\n\n\n\/\/ create a temporary ngc file\n\/\/ make your favorite machine load it\nvoid CSendToMachine::Cancel(void) { CPyProcess::Cancel(); }\nvoid CSendToMachine::SendGCode(const wxChar *gcode)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\n\t\t\/\/ write the ngc file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName ngcpath( standard_paths.GetTempDir().c_str(), wxString::Format(_T(\"heekscnc-%d.ngc\"), m_serial));\n\t\tm_serial++;\n\t\t{\n\t\t\twxFile ofs(ngcpath.GetFullPath(), wxFile::write);\n\t\t\tif(!ofs.IsOpened())\n\t\t\t{\n\t\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + ngcpath.GetFullPath());\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tofs.Write(theApp.m_output_canvas->m_textCtrl->GetValue());\n\t\t}\n\t\twxLogDebug(_T(\"created '%s')\"), ngcpath.GetFullPath().c_str());\n\n#ifdef WIN32\n Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() +wxString(_T(\"\\\\\")) + m_command + wxString(_T(\"\\\" \\\"\")) + ngcpath.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n wxString sendto_cmdline = m_command + wxString(_T(\" \")) + ngcpath.GetFullPath();\n wxLogDebug(_T(\"executing '%s')\"), sendto_cmdline.c_str());\n\t\tExecute(sendto_cmdline);\n#endif\n\t}\n\n\nint CSendToMachine::m_serial;\nwxString CSendToMachine::m_command;\n\nstatic void on_set_to_machine_command(const wxChar *value, HeeksObj* object)\n{\n\tCSendToMachine::m_command = value;\n\tCSendToMachine::WriteToConfig();\n}\n\n\/\/ static\nvoid CSendToMachine::GetOptions(std::list<Property *> *list)\n{\n\tlist->push_back(new PropertyString(_(\"send-to-machine command\"), m_command, NULL, on_set_to_machine_command));\n}\n\n\/\/ static\nvoid CSendToMachine::ReadFromConfig()\n{\n CNCConfig config(CSendToMachine::ConfigScope());\n config.Read(_T(\"SendToMachineCommand\"), &m_command , _T(\"axis-remote\"));\n}\n\/\/ static\nvoid CSendToMachine::WriteToConfig()\n{\n CNCConfig config(CSendToMachine::ConfigScope());\n config.Write(_T(\"SendToMachineCommand\"), m_command);\n}\n\n\nstatic CSendToMachine *sendto;\n\nbool HeeksSendToMachine(const wxString &gcode)\n{\n\tif (sendto != NULL) {\n\t\tsendto->Cancel();\n\t\tdelete sendto;\n\t}\n\tsendto = new CSendToMachine;\n\tsendto->SendGCode(gcode);\n\n\treturn false;\n}\n\n<commit_msg>I fixed a compile error on Windows; seems like \"sento\" was already defined in \"winsock.h\", so I changed it to \"send_to\"<commit_after>\/\/ PythonStuff.cpp\n\/\/ Copyright (c) 2009, Dan Heeks\n\/\/ This program is released under the BSD license. See the file COPYING for details.\n\n#include \"stdafx.h\"\n#include <wx\/file.h>\n#include <wx\/mimetype.h>\n#include <wx\/stdpaths.h>\n#include <wx\/filename.h>\n#include <wx\/txtstrm.h>\n#include <wx\/log.h>\n#include \"PythonStuff.h\"\n#include \"ProgramCanvas.h\"\n#include \"OutputCanvas.h\"\n#include \"Program.h\"\n#include \"CNCConfig.h\"\n#include \"interface\/PropertyString.h\"\n\n\/\/static\nbool CPyProcess::redirect = true;\n\nCPyProcess::CPyProcess(void)\n{\n m_pid = 0;\n wxProcess(heeksCAD->GetMainFrame());\n Connect(wxEVT_TIMER, wxTimerEventHandler(CPyProcess::OnTimer));\n m_timer.SetOwner(this);\n\n}\n\nvoid CPyProcess::OnTimer(wxTimerEvent& event)\n{\n HandleInput();\n}\n\nvoid CPyProcess::HandleInput(void) {\n\twxInputStream *m_in, *m_err;\n\n\tm_in = GetInputStream();\n\tm_err = GetErrorStream();\n\n\tif (m_in) {\n\t\twxString s;\n\t\twhile (m_in->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_in->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_in->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"> %s\"), s.c_str());\n\t\t}\n\t}\n\tif (m_err) {\n\t\twxString s;\n\t\twhile (m_err->CanRead()) {\n\t\t\tchar buffer[4096];\n\t\t\tm_err->Read(buffer, sizeof(buffer));\n\t\t\ts += wxString::From8BitData(buffer, m_err->LastRead());\n\t\t}\n\t\tif (s.Length() > 0) {\n\t\t\twxLogMessage(_T(\"! %s\"), s.c_str());\n\t\t}\n\t}\n}\n\nvoid CPyProcess::Execute(const wxChar* cmd)\n{\n\tif(redirect) {\n\t\tRedirect();\n\t}\n\t\/\/ make process group leader so Cancel kan terminate process including children\n\tm_pid = wxExecute(cmd, wxEXEC_ASYNC|wxEXEC_MAKE_GROUP_LEADER, this);\n\tif (!m_pid) {\n\t wxLogMessage(_T(\"could not execute '%s'\"),cmd);\n\t} else {\n\t wxLogMessage(_T(\"starting '%s' (%d)\"),cmd,m_pid);\n\t}\n\tif (redirect) {\n\t\tm_timer.Start(100); \/\/msec\n\t}\n}\n\nvoid CPyProcess::Cancel(void)\n{\n\tif (m_pid)\n\t{\n\t\twxKillError kerror;\n\t\twxSignal sig = wxSIGTERM;\n\t\tint retcode;\n\n\t\tif ( wxProcess::Exists(m_pid) ) {\n\t\t\tretcode = wxKill(m_pid, sig, &kerror, wxKILL_CHILDREN);\n\t\t\tswitch (kerror) {\n\t\t\tcase wxKILL_OK:\n\t\t\t\twxLogMessage(_T(\"sent signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_NO_PROCESS:\n\t\t\t\twxLogMessage(_T(\"process %d already exited\"),m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ACCESS_DENIED:\n\t\t\t\twxLogMessage(_T(\"sending signal %d to process %d - access denied\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_BAD_SIGNAL: \/\/ no such signal\n\t\t\t\twxLogMessage(_T(\"no such signal: %d\"),sig);\n\t\t\t\tbreak;\n\t\t\tcase wxKILL_ERROR: \/\/ another, unspecified error\n\t\t\t\twxLogMessage(_T(\"unspecified error sending signal %d to process %d\"),sig, m_pid);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t} else {\n\t\t\twxLogMessage(_T(\"process %d has gone away\"), m_pid);\n\t\t}\n\t\tm_pid = 0;\n\t}\n}\n\nvoid CPyProcess::OnTerminate(int pid, int status)\n{\n\tif (pid == m_pid)\n\t{\n\t if (redirect) {\n\t\t m_timer.Stop();\n\t\t HandleInput(); \/\/ anything left?\n\t }\n\t if (status) {\n\t\t wxLogMessage(_T(\"process %d exit(%d)\"),pid, status);\n\t } else {\n\t\t wxLogDebug(_T(\"process %d exit(0)\"),pid);\n\t }\n\t m_pid = 0;\n\t ThenDo();\n\t}\n\t\/\/ else: the process already was already treated with Cancel() so m_pid is 0\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nclass CPyBackPlot : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\tHeeksObj* m_into;\n\twxString m_filename;\n\twxBusyCursor *m_busy_cursor;\n\n\tstatic CPyBackPlot* m_object;\n\npublic:\n\tCPyBackPlot(const CProgram* program, HeeksObj* into, const wxChar* filename): m_program(program), m_into(into),m_filename(filename),m_busy_cursor(NULL) { m_object = this; }\n\t~CPyBackPlot(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\tif(m_busy_cursor == NULL)m_busy_cursor = new wxBusyCursor();\n\n\t\tif (m_program->m_machine.file_name == _T(\"not found\"))\n\t\t{\n\t\t\twxMessageBox(_T(\"Machine name (defined in Program Properties) not found\"));\n\t\t} \/\/ End if - then\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\tExecute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + _T(\"\\\\nc_read.bat\\\" \") + m_program->m_machine.file_name + _T(\" \\\"\") + m_filename + _T(\"\\\"\"));\n#else\n#ifdef RUNINPLACE\n wxString path(_T(\"\/nc\/\"));\n#else\n wxString path(_T(\"\/..\/heekscnc\/nc\/\"));\n#endif\n\n\t\t\tExecute(wxString(_T(\"python \\\"\")) + theApp.GetDllFolder() + path + m_program->m_machine.file_name + wxString(_T(\"_read.py\\\" \\\"\")) + m_filename + wxString(_T(\"\\\"\")) );\n#endif\n\t\t} \/\/ End if - else\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\t\/\/ there should now be a .nc.xml written\n\t\twxString xml_file_str = m_filename + wxString(_T(\".nc.xml\"));\n\t\twxFile ofs(xml_file_str.c_str());\n\t\tif(!ofs.IsOpened())\n\t\t{\n\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + xml_file_str);\n\t\t\treturn;\n\t\t}\n\n\t\t\/\/ read the xml file, just like paste, into the program\n\t\theeksCAD->OpenXMLFile(xml_file_str, m_into);\n\t\theeksCAD->Repaint();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\tdelete m_busy_cursor;\n\t\tm_busy_cursor = NULL;\n\t}\n};\n\nCPyBackPlot* CPyBackPlot::m_object = NULL;\n\nclass CPyPostProcess : public CPyProcess\n{\nprotected:\n\tconst CProgram* m_program;\n\twxString m_filename;\n\tbool m_include_backplot_processing;\n\n\tstatic CPyPostProcess* m_object;\n\npublic:\n\tCPyPostProcess(const CProgram* program,\n\t\t\tconst wxChar* filename,\n\t\t\tconst bool include_backplot_processing = true ) :\n\t\tm_program(program), m_filename(filename), m_include_backplot_processing(include_backplot_processing)\n\t{\n\t\tm_object = this;\n\t}\n\n\t~CPyPostProcess(void) { m_object = NULL; }\n\n\tstatic void StaticCancel(void) { if (m_object) m_object->Cancel(); }\n\n\tvoid Do(void)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\t\twxStandardPaths standard_paths;\n\t\twxFileName path( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n#ifdef WIN32\n Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() + wxString(_T(\"\\\\post.bat\\\" \\\"\")) + path.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n\n wxString post_path = wxString(_T(\"python \")) + path.GetFullPath();\n\t\tExecute(post_path);\n#endif\n\t}\n\tvoid ThenDo(void)\n\t{\n\t\tif (m_include_backplot_processing)\n\t\t{\n\t\t\t(new CPyBackPlot(m_program, (HeeksObj*)m_program, m_filename))->Do();\n\t\t}\n\t}\n};\n\nCPyPostProcess* CPyPostProcess::m_object = NULL;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nstatic bool write_python_file(const wxString& python_file_path)\n{\n\twxFile ofs(python_file_path.c_str(), wxFile::write);\n\tif(!ofs.IsOpened())return false;\n\n\tofs.Write(theApp.m_program->m_python_program.c_str());\n\n\treturn true;\n}\n\nbool HeeksPyPostProcess(const CProgram* program, const wxString &filepath, const bool include_backplot_processing)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t\/\/ write the python file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName file_str( standard_paths.GetTempDir().c_str(), _T(\"post.py\"));\n\n\t\tif(!write_python_file(file_str.GetFullPath()))\n\t\t{\n\t\t wxString error;\n\t\t error << _T(\"couldn't write \") << file_str.GetFullPath();\n\t\t wxMessageBox(error.c_str());\n\t\t}\n\t\telse\n\t\t{\n#ifdef WIN32\n\t\t\t\/\/ Set the working directory to the area that contains the DLL so that\n\t\t\t\/\/ the system can find the post.bat file correctly.\n\t\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n#else\n\t\t\t::wxSetWorkingDirectory(standard_paths.GetTempDir());\n#endif\n\n\t\t\t\/\/ call the python file\n\t\t\t(new CPyPostProcess(program, filepath, include_backplot_processing))->Do();\n\n\t\t\treturn true;\n\t\t}\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while post-processing the program!\"));\n\t}\n\treturn false;\n}\n\nbool HeeksPyBackplot(const CProgram* program, HeeksObj* into, const wxString &filepath)\n{\n\ttry{\n\t\ttheApp.m_output_canvas->m_textCtrl->Clear(); \/\/ clear the output window\n\n\t\t::wxSetWorkingDirectory(theApp.GetDllFolder());\n\n\t\t\/\/ call the python file\n\t\t(new CPyBackPlot(program, into, filepath))->Do();\n\n\t\t\/\/ in Windows, at least, executing the bat file was making HeeksCAD change it's Z order\n\t\theeksCAD->GetMainFrame()->Raise();\n\n\t\treturn true;\n\t}\n\tcatch(...)\n\t{\n\t\twxMessageBox(_T(\"Error while backplotting the program!\"));\n\t}\n\treturn false;\n}\n\nvoid HeeksPyCancel(void)\n{\n\tCPyBackPlot::StaticCancel();\n\tCPyPostProcess::StaticCancel();\n}\n\n\n\/\/ create a temporary ngc file\n\/\/ make your favorite machine load it\nvoid CSendToMachine::Cancel(void) { CPyProcess::Cancel(); }\nvoid CSendToMachine::SendGCode(const wxChar *gcode)\n\t{\n\t\twxBusyCursor wait; \/\/ show an hour glass until the end of this function\n\n\t\t\/\/ write the ngc file\n\t\twxStandardPaths standard_paths;\n\t\twxFileName ngcpath( standard_paths.GetTempDir().c_str(), wxString::Format(_T(\"heekscnc-%d.ngc\"), m_serial));\n\t\tm_serial++;\n\t\t{\n\t\t\twxFile ofs(ngcpath.GetFullPath(), wxFile::write);\n\t\t\tif(!ofs.IsOpened())\n\t\t\t{\n\t\t\t\twxMessageBox(wxString(_(\"Couldn't open file\")) + _T(\" - \") + ngcpath.GetFullPath());\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tofs.Write(theApp.m_output_canvas->m_textCtrl->GetValue());\n\t\t}\n\t\twxLogDebug(_T(\"created '%s')\"), ngcpath.GetFullPath().c_str());\n\n#ifdef WIN32\n Execute(wxString(_T(\"\\\"\")) + theApp.GetDllFolder() +wxString(_T(\"\\\\\")) + m_command + wxString(_T(\"\\\" \\\"\")) + ngcpath.GetFullPath() + wxString(_T(\"\\\"\")));\n#else\n wxString sendto_cmdline = m_command + wxString(_T(\" \")) + ngcpath.GetFullPath();\n wxLogDebug(_T(\"executing '%s')\"), sendto_cmdline.c_str());\n\t\tExecute(sendto_cmdline);\n#endif\n\t}\n\n\nint CSendToMachine::m_serial;\nwxString CSendToMachine::m_command;\n\nstatic void on_set_to_machine_command(const wxChar *value, HeeksObj* object)\n{\n\tCSendToMachine::m_command = value;\n\tCSendToMachine::WriteToConfig();\n}\n\n\/\/ static\nvoid CSendToMachine::GetOptions(std::list<Property *> *list)\n{\n\tlist->push_back(new PropertyString(_(\"send-to-machine command\"), m_command, NULL, on_set_to_machine_command));\n}\n\n\/\/ static\nvoid CSendToMachine::ReadFromConfig()\n{\n CNCConfig config(CSendToMachine::ConfigScope());\n config.Read(_T(\"SendToMachineCommand\"), &m_command , _T(\"axis-remote\"));\n}\n\/\/ static\nvoid CSendToMachine::WriteToConfig()\n{\n CNCConfig config(CSendToMachine::ConfigScope());\n config.Write(_T(\"SendToMachineCommand\"), m_command);\n}\n\n\nstatic CSendToMachine *send_to;\n\nbool HeeksSendToMachine(const wxString &gcode)\n{\n\tif (send_to != NULL) {\n\t\tsend_to->Cancel();\n\t\tdelete send_to;\n\t}\n\tsend_to = new CSendToMachine;\n\tsend_to->SendGCode(gcode);\n\n\treturn false;\n}\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Morwenn\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstddef>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <numeric>\n#include <cpp-sort\/adapters\/counting_adapter.h>\n#include <cpp-sort\/adapters\/small_array_adapter.h>\n#include <cpp-sort\/sorters.h>\n\nusing namespace cppsort;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Readable sorter names\n\ntemplate<typename Sorter>\nstruct sorter_name;\n\ntemplate<>\nstruct sorter_name<insertion_sorter>\n{\n static constexpr const char* value = \"insertion_sorter\";\n};\n\ntemplate<>\nstruct sorter_name<selection_sorter>\n{\n static constexpr const char* value = \"selection_sorter\";\n};\n\ntemplate<typename... Args>\nstruct sorter_name<small_array_adapter<Args...>>\n{\n static constexpr const char* value = \"small_array_sorter\";\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Counting functions\n\ntemplate<std::size_t N, typename Sorter>\nauto count_comparison()\n -> void\n{\n \/\/ Fill an array of size N\n std::array<int, N> collection;\n std::iota(std::begin(collection), std::end(collection), 0);\n\n \/\/ Count comparisons made by a sorter\n cppsort::counting_adapter<Sorter> sorter;\n\n \/\/ Total number of comparisons\n std::size_t count = 0;\n\n \/\/ For each possible permutation of collection\n do\n {\n auto to_sort = collection;\n \/\/ Sort collection, get the number of comparisons made\n count += sorter(to_sort);\n \/\/ Double counts as sorter tests\n assert(std::is_sorted(std::begin(to_sort), std::end(to_sort)));\n } while (std::next_permutation(std::begin(collection), std::end(collection)));\n\n \/\/ Display the result\n std::cout << std::left\n << std::setw(20) << sorter_name<Sorter>::value\n << std::setw(6) << count\n << '\\n';\n}\n\ntemplate<std::size_t N, typename... Sorters>\nauto compare_fixed_size()\n -> void\n{\n std::cout << \"array of size \" << N << '\\n';\n\n \/\/ Variadic dispatch only works with expressions\n int dummy[] = {\n (count_comparison<N, Sorters>(), 0)...\n };\n (void) dummy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Main\n\nint main()\n{\n \/\/ Size of the arrays to sort\n static constexpr std::size_t size = 7;\n\n compare_fixed_size<size,\n insertion_sorter,\n selection_sorter,\n small_array_adapter<void>\n >();\n}\n<commit_msg>Test comparisons, moves and cycles at once.<commit_after>\/*\n * The MIT License (MIT)\n *\n * Copyright (c) 2015 Morwenn\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and\/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n *\/\n#include <algorithm>\n#include <array>\n#include <cassert>\n#include <cstddef>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <numeric>\n#include <cpp-sort\/adapters.h>\n#include <cpp-sort\/sorters.h>\n\nusing namespace cppsort;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Readable sorter names\n\ntemplate<typename Sorter>\nstruct sorter_name;\n\ntemplate<>\nstruct sorter_name<insertion_sorter>\n{\n static constexpr const char* value = \"insertion_sorter\";\n};\n\ntemplate<typename... Args>\nstruct sorter_name<low_comparisons_adapter<Args...>>\n{\n static constexpr const char* value = \"low_comparisons_sorter\";\n};\n\ntemplate<typename... Args>\nstruct sorter_name<low_moves_adapter<Args...>>\n{\n static constexpr const char* value = \"low_moves_sorter\";\n};\n\ntemplate<typename... Args>\nstruct sorter_name<small_array_adapter<Args...>>\n{\n static constexpr const char* value = \"small_array_sorter\";\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Count the number of comparisons\n\ntemplate<std::size_t N, typename Sorter, std::size_t... Ind>\nauto count_comparisons(std::index_sequence<Ind...>)\n -> void\n{\n cppsort::counting_adapter<Sorter> sorter;\n\n \/\/ Fill an array of size N\n std::array<int, N> collection;\n std::iota(std::begin(collection), std::end(collection), 0);\n\n \/\/ Total number of comparisons\n std::size_t count = 0;\n\n \/\/ For each possible permutation of collection\n do\n {\n std::array<int, N> to_sort = { std::get<Ind>(collection)... };\n \/\/ Sort collection, get the number of comparisons made\n count += sorter(to_sort);\n\n \/\/ Double counts as sorter tests\n assert(std::is_sorted(std::begin(to_sort), std::end(to_sort)));\n } while (std::next_permutation(std::begin(collection), std::end(collection)));\n\n \/\/ Display the result\n std::cout << std::left\n << std::setw(25) << sorter_name<Sorter>::value\n << std::setw(6) << count\n << '\\n';\n}\n\ntemplate<std::size_t N, typename... Sorters>\nauto compare_comparisons()\n -> void\n{\n std::cout << \"\\ncomparisons needed to sort an array of size \" << N << '\\n';\n\n using indices = std::make_index_sequence<N>;\n\n \/\/ Variadic dispatch only works with expressions\n int dummy[] = {\n (count_comparisons<N, Sorters>(indices{}), 0)...\n };\n (void) dummy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Count the number of moves\n\ntemplate<typename T>\nstruct move_counter\n{\n \/\/\n \/\/ This structure is used to count the number of moves\n \/\/ performed by a sorting algorithm and additionally\n \/\/ checks that no read from moved-from values happen\n \/\/ during the sort\n \/\/\n\n \/\/ Constructors\n\n move_counter() = delete;\n move_counter(const move_counter&) = delete;\n\n move_counter(const T& value):\n moves(0),\n can_read(true),\n value(value)\n {}\n\n move_counter(move_counter&& other):\n moves(other.moves + 1),\n can_read(true),\n value(std::move(other.value))\n {\n if (not std::exchange(other.can_read, false))\n {\n std::cout << \"illegal read from a moved-from value\\n\";\n assert(false);\n }\n }\n\n \/\/ Assignment operators\n\n move_counter& operator=(const move_counter&) = delete;\n\n auto operator=(move_counter&& other)\n -> move_counter&\n {\n if (&other != this)\n {\n moves += other.moves + 1;\n if (not std::exchange(other.can_read, false))\n {\n std::cout << \"illegal read from a moved-from value\\n\";\n assert(false);\n }\n can_read = true;\n value = std::move(other.value);\n }\n return *this;\n }\n\n \/\/ Number of moves since its creation\n std::size_t moves;\n \/\/ Whether the value can be read\n bool can_read;\n \/\/ Actual value\n T value;\n};\n\ntemplate<typename T>\nauto operator<(const move_counter<T>& lhs, const move_counter<T>& rhs)\n -> bool\n{\n return lhs.value < rhs.value;\n}\n\ntemplate<std::size_t N, typename Sorter, std::size_t... Ind>\nauto count_moves(std::index_sequence<Ind...>)\n -> void\n{\n Sorter sorter;\n\n \/\/ Fill an array of size N\n std::array<int, N> collection;\n std::iota(std::begin(collection), std::end(collection), 0);\n\n \/\/ Total number of moves\n std::size_t count = 0;\n\n \/\/ For each possible permutation of collection\n do\n {\n std::array<move_counter<int>, N> to_sort = { std::get<Ind>(collection)... };\n\n \/\/ Sort collection, get the number of loves performed\n sorter(to_sort);\n for (auto& val: to_sort)\n {\n count += val.moves;\n }\n\n \/\/ Double counts as sorter tests\n assert(std::is_sorted(std::begin(to_sort), std::end(to_sort)));\n } while (std::next_permutation(std::begin(collection), std::end(collection)));\n\n \/\/ Display the result\n std::cout << std::left\n << std::setw(25) << sorter_name<Sorter>::value\n << std::setw(6) << count\n << '\\n';\n}\n\ntemplate<std::size_t N, typename... Sorters>\nauto compare_moves()\n -> void\n{\n std::cout << \"\\nmoves needed to sort and array of size \" << N << '\\n';\n\n using indices = std::make_index_sequence<N>;\n\n \/\/ Variadic dispatch only works with expressions\n int dummy[] = {\n (count_moves<N, Sorters>(indices{}), 0)...\n };\n (void) dummy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Measure the number of cycles\n\n#ifdef _WIN32\n #include <intrin.h>\n #define rdtsc __rdtsc\n#else\n #ifdef __i386__\n static __inline__ unsigned long long rdtsc() {\n unsigned long long int x;\n __asm__ volatile(\".byte 0x0f, 0x31\" : \"=A\" (x));\n return x;\n }\n #elif defined(__x86_64__)\n static __inline__ unsigned long long rdtsc(){\n unsigned hi, lo;\n __asm__ __volatile__(\"rdtsc\" : \"=a\"(lo), \"=d\"(hi));\n return ((unsigned long long) lo) | (((unsigned long long) hi) << 32);\n }\n #else\n #error no rdtsc implementation\n #endif\n#endif\n\ntemplate<std::size_t N, typename Sorter, std::size_t... Ind>\nauto count_cycles(std::index_sequence<Ind...>)\n -> void\n{\n Sorter sorter;\n\n \/\/ Fill an array of size N\n std::array<int, N> collection;\n std::iota(std::begin(collection), std::end(collection), 0);\n\n \/\/ Total number of cycles\n std::size_t count = 0;\n\n \/\/ For each possible permutation of collection\n do\n {\n std::array<int, N> to_sort = { std::get<Ind>(collection)... };\n \/\/ Sort collection, get the number of cycles\n auto start = rdtsc();\n sorter(to_sort);\n auto end = rdtsc();\n\n count += (end - start);\n\n \/\/ Double counts as sorter tests\n assert(std::is_sorted(std::begin(to_sort), std::end(to_sort)));\n } while (std::next_permutation(std::begin(collection), std::end(collection)));\n\n \/\/ Display the result\n std::cout << std::left\n << std::setw(25) << sorter_name<Sorter>::value\n << std::setw(6) << count\n << '\\n';\n}\n\ntemplate<std::size_t N, typename... Sorters>\nauto compare_time()\n -> void\n{\n std::cout << \"\\ncycles needed to sort an array of size \" << N << '\\n';\n\n using indices = std::make_index_sequence<N>;\n\n \/\/ Variadic dispatch only works with expressions\n int dummy[] = {\n (count_cycles<N, Sorters>(indices{}), 0)...\n };\n (void) dummy;\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Main\n\nint main()\n{\n \/\/ Size of the arrays to sort\n static constexpr std::size_t size = 5;\n\n compare_comparisons<size,\n insertion_sorter,\n low_moves_adapter<void>,\n low_comparisons_adapter<void>,\n small_array_adapter<void>\n >();\n\n compare_moves<size,\n insertion_sorter,\n low_moves_adapter<void>,\n low_comparisons_adapter<void>,\n small_array_adapter<void>\n >();\n\n compare_time<size,\n insertion_sorter,\n low_moves_adapter<void>,\n low_comparisons_adapter<void>,\n small_array_adapter<void>\n >();\n}\n<|endoftext|>"} {"text":"<commit_before>\/* This file is part of the KDE libraries\n Copyright (C) 2002 Anders Lund <anders@alweb.dk>\n \n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n\n $Id$\n*\/\n\n#include \"insertfileplugin.h\"\n#include \"insertfileplugin.moc\"\n\n#include <ktexteditor\/document.h>\n#include <ktexteditor\/viewcursorinterface.h>\n#include <ktexteditor\/editinterface.h>\n\n#include <assert.h>\n#include <kio\/job.h>\n#include <kaction.h>\n#include <kfiledialog.h>\n#include <kgenericfactory.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <ktempfile.h>\n#include <kurl.h>\n\n#include <qfile.h>\n#include <qtextstream.h>\n\nK_EXPORT_COMPONENT_FACTORY( ktexteditor_insertfile, KGenericFactory<InsertFilePlugin>( \"ktexteditor_insertfile\" ) );\n\n\n\/\/BEGIN InsertFilePlugin\nInsertFilePlugin::InsertFilePlugin( QObject *parent, const char* name, const QStringList& )\n\t: KTextEditor::Plugin ( (KTextEditor::Document*) parent, name )\n{\n}\n\nInsertFilePlugin::~InsertFilePlugin()\n{\n}\n\nvoid InsertFilePlugin::addView(KTextEditor::View *view)\n{\n InsertFilePluginView *nview = new InsertFilePluginView (view, \"Insert File Plugin\");\n m_views.append (nview);\n}\n\nvoid InsertFilePlugin::removeView(KTextEditor::View *view)\n{\n for (uint z=0; z < m_views.count(); z++)\n if (m_views.at(z)->parentClient() == view)\n {\n InsertFilePluginView *nview = m_views.at(z);\n m_views.remove (nview);\n delete nview;\n }\n}\n\/\/END InsertFilePlugin\n\n\/\/BEGIN InsertFilePluginView\nInsertFilePluginView::InsertFilePluginView( KTextEditor::View *view, const char *name )\n : QObject( view, name ),\n KXMLGUIClient( view )\n{\n view->insertChildClient( this );\n setInstance( KGenericFactory<InsertFilePlugin>::instance() );\n _job = 0;\n (void) new KAction( i18n(\"Insert File...\"), 0, this, SLOT(slotInsertFile()), actionCollection(), \"tools_insert_file\" );\n setXMLFile( \"ktexteditor_insertfileui.rc\" );\n}\n\nvoid InsertFilePluginView::slotInsertFile()\n{\n _file = KFileDialog::getOpenURL( \"::insertfile\", \"\",\n (QWidget*)parent(),\n i18n(\"Choose File to Insert\") ).url();\n if ( _file.isEmpty() ) return;\n\n if ( _file.isLocalFile() ) {\n _tmpfile = _file.fileName();\n insertFile();\n }\n else {\n KTempFile tempFile( QString::null );\n _tmpfile = tempFile.name();\n\n KURL destURL;\n destURL.setPath( _tmpfile );\n _job = KIO::file_copy( _file, destURL, 0600, true, false, true );\n connect( _job, SIGNAL( result( KIO::Job * ) ), this, SLOT( slotFinished ( KIO::Job * ) ) );\n }\n}\n\nvoid InsertFilePluginView::slotFinished( KIO::Job *job )\n{\n assert( job == _job );\n _job = 0;\n if ( job->error() )\n KMessageBox::error( (QWidget*)parent(), i18n(\"Failed to load file:\\n\\n\") + job->errorString(), i18n(\"Insert File error\") );\n else\n insertFile();\n}\n\nvoid InsertFilePluginView::insertFile()\n{\n QString error;\n if ( _tmpfile.isEmpty() )\n error = i18n(\"<p>The file <strong>%1<\/strong> is empty, aborting.\").arg(_file.fileName());\n\n QFileInfo fi;\n fi.setFile( _tmpfile );\n if (!fi.exists() || !fi.isReadable())\n error = i18n(\"<p>The file <strong>%1<\/strong> does not exist or is not readable, aborting.\").arg(_file.fileName());\n\n QFile f( _tmpfile );\n if ( !f.open(IO_ReadOnly) )\n error = i18n(\"<p>Unable to open file <strong>%1<\/strong>, aborting.\").arg(_file.fileName());\n\n if ( ! error.isEmpty() ) {\n KMessageBox::sorry( (QWidget*)parent(), error, i18n(\"Insert file error\") );\n return;\n }\n\n \/\/ now grab file contents\n QTextStream stream(&f);\n QString str, tmp;\n uint numlines = 0;\n uint len = 0;\n while (!stream.eof()) {\n if ( numlines )\n str += \"\\n\";\n tmp = stream.readLine();\n str += tmp;\n len = tmp.length();\n numlines++;\n }\n f.close();\n\n if ( str.isEmpty() )\n error = i18n(\"<p>File <strong>%1<\/strong> had no contents.\").arg(_file.fileName());\n if ( ! error.isEmpty() ) {\n KMessageBox::sorry( (QWidget*)parent(), error, i18n(\"Insert file error\") );\n return;\n }\n\n \/\/ insert !!\n KTextEditor::EditInterface *ei;\n KTextEditor::ViewCursorInterface *ci;\n KTextEditor::View *v = (KTextEditor::View*)parent();\n ei = KTextEditor::editInterface( v->document() );\n ci = KTextEditor::viewCursorInterface( v );\n uint line, col;\n ci->cursorPositionReal( &line, &col );\n ei->insertText( line, col, str );\n\n \/\/ move the cursor\n ci->setCursorPositionReal( line + numlines - 1, numlines > 1 ? len : col + len );\n\n \/\/ clean up\n _file = KURL ();\n _tmpfile.truncate( 0 );\n v = 0;\n ei = 0;\n ci = 0;\n}\n\n\/\/END InsertFilePluginView\n\n<commit_msg>fixing to wrok with local files [how embarrassing..]<commit_after>\/* This file is part of the KDE libraries\n Copyright (C) 2002 Anders Lund <anders@alweb.dk>\n\n This library is free software; you can redistribute it and\/or\n modify it under the terms of the GNU Library General Public\n License version 2 as published by the Free Software Foundation.\n\n This library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Library General Public License for more details.\n\n You should have received a copy of the GNU Library General Public License\n along with this library; see the file COPYING.LIB. If not, write to\n the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n Boston, MA 02111-1307, USA.\n\n $Id$\n*\/\n\n#include \"insertfileplugin.h\"\n#include \"insertfileplugin.moc\"\n\n#include <ktexteditor\/document.h>\n#include <ktexteditor\/viewcursorinterface.h>\n#include <ktexteditor\/editinterface.h>\n\n#include <assert.h>\n#include <kio\/job.h>\n#include <kaction.h>\n#include <kfiledialog.h>\n#include <kgenericfactory.h>\n#include <klocale.h>\n#include <kmessagebox.h>\n#include <ktempfile.h>\n#include <kurl.h>\n\n#include <qfile.h>\n#include <qtextstream.h>\n\nK_EXPORT_COMPONENT_FACTORY( ktexteditor_insertfile, KGenericFactory<InsertFilePlugin>( \"ktexteditor_insertfile\" ) );\n\n\n\/\/BEGIN InsertFilePlugin\nInsertFilePlugin::InsertFilePlugin( QObject *parent, const char* name, const QStringList& )\n\t: KTextEditor::Plugin ( (KTextEditor::Document*) parent, name )\n{\n}\n\nInsertFilePlugin::~InsertFilePlugin()\n{\n}\n\nvoid InsertFilePlugin::addView(KTextEditor::View *view)\n{\n InsertFilePluginView *nview = new InsertFilePluginView (view, \"Insert File Plugin\");\n m_views.append (nview);\n}\n\nvoid InsertFilePlugin::removeView(KTextEditor::View *view)\n{\n for (uint z=0; z < m_views.count(); z++)\n if (m_views.at(z)->parentClient() == view)\n {\n InsertFilePluginView *nview = m_views.at(z);\n m_views.remove (nview);\n delete nview;\n }\n}\n\/\/END InsertFilePlugin\n\n\/\/BEGIN InsertFilePluginView\nInsertFilePluginView::InsertFilePluginView( KTextEditor::View *view, const char *name )\n : QObject( view, name ),\n KXMLGUIClient( view )\n{\n view->insertChildClient( this );\n setInstance( KGenericFactory<InsertFilePlugin>::instance() );\n _job = 0;\n (void) new KAction( i18n(\"Insert File...\"), 0, this, SLOT(slotInsertFile()), actionCollection(), \"tools_insert_file\" );\n setXMLFile( \"ktexteditor_insertfileui.rc\" );\n}\n\nvoid InsertFilePluginView::slotInsertFile()\n{\n _file = KFileDialog::getOpenURL( \"::insertfile\", \"\",\n (QWidget*)parent(),\n i18n(\"Choose File to Insert\") ).url();\n if ( _file.isEmpty() ) return;\n\n if ( _file.isLocalFile() ) {\n _tmpfile = _file.path();\n insertFile();\n }\n else {\n KTempFile tempFile( QString::null );\n _tmpfile = tempFile.name();\n\n KURL destURL;\n destURL.setPath( _tmpfile );\n _job = KIO::file_copy( _file, destURL, 0600, true, false, true );\n connect( _job, SIGNAL( result( KIO::Job * ) ), this, SLOT( slotFinished ( KIO::Job * ) ) );\n }\n}\n\nvoid InsertFilePluginView::slotFinished( KIO::Job *job )\n{\n assert( job == _job );\n _job = 0;\n if ( job->error() )\n KMessageBox::error( (QWidget*)parent(), i18n(\"Failed to load file:\\n\\n\") + job->errorString(), i18n(\"Insert File error\") );\n else\n insertFile();\n}\n\nvoid InsertFilePluginView::insertFile()\n{\n QString error;\n if ( _tmpfile.isEmpty() )\n return;\n\n QFileInfo fi;\n fi.setFile( _tmpfile );\n if (!fi.exists() || !fi.isReadable())\n error = i18n(\"<p>The file <strong>%1<\/strong> does not exist or is not readable, aborting.\").arg(_file.fileName());\n\n QFile f( _tmpfile );\n if ( !f.open(IO_ReadOnly) )\n error = i18n(\"<p>Unable to open file <strong>%1<\/strong>, aborting.\").arg(_file.fileName());\n\n if ( ! error.isEmpty() ) {\n KMessageBox::sorry( (QWidget*)parent(), error, i18n(\"Insert file error\") );\n return;\n }\n\n \/\/ now grab file contents\n QTextStream stream(&f);\n QString str, tmp;\n uint numlines = 0;\n uint len = 0;\n while (!stream.eof()) {\n if ( numlines )\n str += \"\\n\";\n tmp = stream.readLine();\n str += tmp;\n len = tmp.length();\n numlines++;\n }\n f.close();\n\n if ( str.isEmpty() )\n error = i18n(\"<p>File <strong>%1<\/strong> had no contents.\").arg(_file.fileName());\n if ( ! error.isEmpty() ) {\n KMessageBox::sorry( (QWidget*)parent(), error, i18n(\"Insert file error\") );\n return;\n }\n\n \/\/ insert !!\n KTextEditor::EditInterface *ei;\n KTextEditor::ViewCursorInterface *ci;\n KTextEditor::View *v = (KTextEditor::View*)parent();\n ei = KTextEditor::editInterface( v->document() );\n ci = KTextEditor::viewCursorInterface( v );\n uint line, col;\n ci->cursorPositionReal( &line, &col );\n ei->insertText( line, col, str );\n\n \/\/ move the cursor\n ci->setCursorPositionReal( line + numlines - 1, numlines > 1 ? len : col + len );\n\n \/\/ clean up\n _file = KURL ();\n _tmpfile.truncate( 0 );\n v = 0;\n ei = 0;\n ci = 0;\n}\n\n\/\/END InsertFilePluginView\n\n<|endoftext|>"} {"text":"<commit_before>#include \"variant\/usart_platform.hpp\"\n\n#include \"hal.h\"\n\n\/\/ UART2 configuration (XBee)\nstatic const SerialConfig UART2_CONFIG {\n 38400,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\n\/\/ UART4 configuration (Unused)\nstatic const SerialConfig UART4_CONFIG {\n 115200,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\n\/\/ UART6 configuration (GPS)\nstatic const SerialConfig UART6_CONFIG {\n 9600,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\nUSARTPlatform::USARTPlatform() {\n \/\/ Force RX high on startup to prevent XBee from entering SPI mode\n palSetPadMode(GPIOA, 3, PAL_MODE_OUTPUT_PUSHPULL); \/\/ RX\n palSetPad(GPIOA, 3);\n chThdSleepMilliseconds(500);\n\n \/\/ UART2\n sdStart(&SD2, &UART2_CONFIG);\n palSetPadMode(GPIOA, 2, PAL_MODE_ALTERNATE(7)); \/\/ TX\n palSetPadMode(GPIOA, 3, PAL_MODE_ALTERNATE(7)); \/\/ RX\n\n \/\/ UART4\n sdStart(&SD4, &UART4_CONFIG);\n palSetPadMode(GPIOA, 0, PAL_MODE_ALTERNATE(8)); \/\/ TX\n palSetPadMode(GPIOA, 1, PAL_MODE_ALTERNATE(8)); \/\/ RX\n\n \/\/ UART6\n sdStart(&SD6, &UART6_CONFIG);\n palSetPadMode(GPIOC, 6, PAL_MODE_ALTERNATE(8)); \/\/ TX\n palSetPadMode(GPIOC, 7, PAL_MODE_ALTERNATE(8)); \/\/ RX\n}\n\nchibios_rt::BaseSequentialStreamInterface& USARTPlatform::getPrimaryStream() {\n return reinterpret_cast<chibios_rt::BaseSequentialStreamInterface&>(SD2);\n}\n<commit_msg>Update GPS baudrate back to 115200.<commit_after>#include \"variant\/usart_platform.hpp\"\n\n#include \"hal.h\"\n\n\/\/ UART2 configuration (XBee)\nstatic const SerialConfig UART2_CONFIG {\n 38400,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\n\/\/ UART4 configuration (Unused)\nstatic const SerialConfig UART4_CONFIG {\n 115200,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\n\/\/ UART6 configuration (GPS)\nstatic const SerialConfig UART6_CONFIG {\n 115200,\n 0,\n USART_CR2_STOP1_BITS | USART_CR2_LINEN,\n 0\n};\n\nUSARTPlatform::USARTPlatform() {\n \/\/ Force RX high on startup to prevent XBee from entering SPI mode\n palSetPadMode(GPIOA, 3, PAL_MODE_OUTPUT_PUSHPULL); \/\/ RX\n palSetPad(GPIOA, 3);\n chThdSleepMilliseconds(500);\n\n \/\/ UART2\n sdStart(&SD2, &UART2_CONFIG);\n palSetPadMode(GPIOA, 2, PAL_MODE_ALTERNATE(7)); \/\/ TX\n palSetPadMode(GPIOA, 3, PAL_MODE_ALTERNATE(7)); \/\/ RX\n\n \/\/ UART4\n sdStart(&SD4, &UART4_CONFIG);\n palSetPadMode(GPIOA, 0, PAL_MODE_ALTERNATE(8)); \/\/ TX\n palSetPadMode(GPIOA, 1, PAL_MODE_ALTERNATE(8)); \/\/ RX\n\n \/\/ UART6\n sdStart(&SD6, &UART6_CONFIG);\n palSetPadMode(GPIOC, 6, PAL_MODE_ALTERNATE(8)); \/\/ TX\n palSetPadMode(GPIOC, 7, PAL_MODE_ALTERNATE(8)); \/\/ RX\n}\n\nchibios_rt::BaseSequentialStreamInterface& USARTPlatform::getPrimaryStream() {\n return reinterpret_cast<chibios_rt::BaseSequentialStreamInterface&>(SD2);\n}\n<|endoftext|>"} {"text":"<commit_before>\/*\n * SMD2Structs.cpp\n *\n * Created on: 09.02.2016\n * Author: Megacrafter127\n *\/\n\n#include \"SMD2Structs.h\"\n#include <string.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <arpa\/inet.h>\n#include <zlib.h>\n#include <stdexcept>\n\nnamespace smd2{\n\tblock::block(const struct block *copy) {\n\t\tmemcpy(this,copy,sizeof(struct block));\n\t};\n\tblock::block(const unsigned int id, const unsigned int hp, const bool active, const unsigned int orientation) {\n\t\tthis->id=id;\n\t\tthis->hp=hp;\n\t\tthis->active=active;\n\t\tthis->orientation=orientation;\n\t};\n\tblock::block(const rawBlock *raw, const blocktypeList *list) {\n\t\tif(!list) std::__throw_invalid_argument(\"the provided list may not be NULL\");\n\t\tuint32_t buff=0;\n\t\tmemcpy(&buff+sizeof(uint32_t)-sizeof(rawBlock),raw,sizeof(rawBlock));\n\t\tif(buff) {\n\t\t\tbuff=ntohl(buff);\n\t\t\tthis->id=buff;\n\t\t\tbuff>>=11;\n\t\t\tblockType type=((blockType*)list)[this->id];\n\t\t\tif(type==undefined) {\n\t\t\t\tstd::__throw_invalid_argument(\"blocktype not defined\");\n\t\t\t}\n\t\t\tthis->hp=buff;\n\t\t\tif(type==fullyRotating) {\n\t\t\t\tthis->hp&=0x00FF;\n\t\t\t\tbuff>>=8;\n\t\t\t} else buff>>=9;\n\t\t\tif(type==logic) {\n\t\t\t\tthis->active=buff & 1;\n\t\t\t\tbuff>>=1;\n\t\t\t}\n\t\t\tthis->orientation=buff;\n\t\t} else {\n\t\t\tthis->id=0;\n\t\t\tthis->hp=0;\n\t\t\tthis->active=false;\n\t\t\tthis->orientation=0;\n\t\t}\n\t};\n\tblock::block() {\n\t\tthis->id=0;\n\t\tthis->hp=0;\n\t\tthis->active=false;\n\t\tthis->orientation=0;\n\t};\n\trawBlock *block::toRaw(rawBlock *target, const blocktypeList *list) {\n\t\tif(!list) std::__throw_invalid_argument(\"the provided list may not be NULL\");\n\t\tblockType type=((blockType*)list)[this->id];\n\t\tif(type==undefined) {\n\t\t\tstd::__throw_invalid_argument(\"blocktype not defined\");\n\t\t}\n\t\tuint32_t buff=this->orientation;\n\t\tif(type==logic) {\n\t\t\tbuff<<=1;\n\t\t\tif(this->active) buff++;\n\t\t}\n\t\tif(type==fullyRotating) {\n\t\t\tbuff<<=8;\n\t\t\tbuff+=(0xFF & this->hp);\n\t\t} else {\n\t\t\tbuff<<=9;\n\t\t\tbuff+=this->hp;\n\t\t}\n\t\tbuff<<=11;\n\t\tbuff+=id;\n\t\tbuff=htonl(buff);\n\t\tmemcpy(target,&buff+sizeof(uint32_t)-sizeof(rawBlock),sizeof(rawBlock));\n\t\treturn target;\n\t};\n\t\n\trawChunkData *inflate(rawChunkData *trg,const compressedChunkData *src) {}; \/\/TODO #31\n\tcompressedChunkData *deflate(compressedChunkData *trg,const rawChunkData *src) {}; \/\/TODO #32\n\tbool isEmpty(const rawCompressedSegment *segment) {\n\t\tsize_t *chars=(size_t*)segment;\n\t\tfor(size_t i=0;i<(sizeof(rawCompressedSegment)\/sizeof(size_t));i++) {\n\t\t\tif(chars[i]) return false;\n\t\t}\n\t\treturn true;\n\t};\n\t\n\tsegmentHead::segmentHead(const struct segmentHead *copy) {\n\t\tmemcpy(this,copy,sizeof(struct segmentHead));\n\t};\n\tsegmentHead::segmentHead(const unsigned char unknownChar, const unsigned long long timestamp, const signed long x, const signed long y, const signed long z, const unsigned char type, const unsigned long inlen) {\n\t\tthis->unknownChar=unknownChar;\n\t\tthis->timestamp=timestamp;\n\t\tthis->x=x;\n\t\tthis->y=y;\n\t\tthis->z=z;\n\t\tthis->type=type;\n\t\tthis->inlen=inlen;\n\t};\n\tsegmentHead::segmentHead(const rawCompressedSegment *raw,const bool offset) {\n\t\tsize_t i=0;\n\t\tchar *chars=(char*)raw;\n\t\tif(offset) {\n\t\t\tthis->unknownChar=chars[i];\n\t\t\ti++;\n\t\t}\n\t\tuint64_t dbuff64;\n\t\tuint32_t *buff32=(uint32_t*)&dbuff64,dbuff32=ntohl(buff32[0]);\n\t\tmemcpy(buff32,&(chars[i]),sizeof(uint64_t));\n\t\tif(ntohl(1)!=1) {\n\t\t\tbuff32[0]=ntohl(buff32[1]);\n\t\t\tbuff32[1]=dbuff32;\n\t\t}\n\t\tthis->timestamp=dbuff64;\n\t\ti+=sizeof(uint64_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->x=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->y=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->z=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tthis->type=chars[i];\n\t\ti++;\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(uint32_t));\n\t\tthis->inlen=ntohl(dbuff32);\n\t};\n\tsegmentHead::segmentHead() {\n\t\tthis->unknownChar=0;\n\t\tthis->timestamp=0;\n\t\tthis->x=0;\n\t\tthis->y=0;\n\t\tthis->z=0;\n\t\tthis->type=0;\n\t\tthis->inlen=0;\n\t};\n\trawCompressedSegment *segmentHead::toRaw(rawCompressedSegment *target,const bool offset) {\n\t\tsize_t i=0;\n\t\tchar *chars=(char*)target;\n\t\tif(offset) {\n\t\t\tchars[i]=this->unknownChar;\n\t\t\ti++;\n\t\t}\n\t\tuint64_t dbuff64=this->timestamp;\n\t\tuint32_t *buff32=(uint32_t*)&dbuff64,dbuff32=htonl(buff32[0]);\n\t\tif(htonl(1)!=1) {\n\t\t\tbuff32[0]=htonl(buff32[1]);\n\t\t\tbuff32[1]=dbuff32;\n\t\t}\n\t\tmemcpy(&(chars[i]),buff32,sizeof(uint64_t));\n\t\ti+=sizeof(uint64_t);\n\t\t\n\t\tdbuff32=htonl(this->x);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tdbuff32=htonl(this->y);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tdbuff32=htonl(this->z);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tthis->type=chars[i];\n\t\ti++;\n\t\t\n\t\tdbuff32=htonl(this->inlen);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(uint32_t));\n\t\treturn target;\n\t};\n\t\n\tsegment::segment(const struct segment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct segment));\n\t};\n\tsegment::segment(const struct segmentHead *head,const chunkData *blocks) {}; \/\/TODO #8\n\tsegment::segment(const struct segmentHead *head,const rawChunkData *blocks) {}; \/\/TODO #9\n\tsegment::segment(const struct segmentHead *head,const compressedChunkData *blocks) {}; \/\/TODO #10\n\tsegment::segment(const struct rawSegment *src) {}; \/\/TODO #9\n\tsegment::segment(const struct compressedSegment *src) {}; \/\/TODO #10\n\tsegment::segment(const rawCompressedSegment *src) {}; \/\/TODO #11\n\trawCompressedSegment *segment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #12\n\t\n\trawSegment::rawSegment(const struct rawSegment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct rawSegment));\n\t};\n\trawSegment::rawSegment(const struct segmentHead *head,const rawChunkData*) {}; \/\/TODO #14\n\trawSegment::rawSegment(const struct segmentHead *head,const chunkData*) {}; \/\/TODO #15\n\trawSegment::rawSegment(const struct segmentHead *head,const compressedChunkData*) {}; \/\/TODO #16\n\trawSegment::rawSegment(const struct segment *src) {}; \/\/TODO #15\n\trawSegment::rawSegment(const struct compressedSegment *src) {}; \/\/TODO #16\n\trawSegment::rawSegment(const rawCompressedSegment *src) {}; \/\/TODO #17\n\trawCompressedSegment *rawSegment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #18\n\t\n\tcompressedSegment::compressedSegment(const struct compressedSegment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct compressedSegment));\n\t};\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const compressedChunkData *blocks) {}; \/\/TODO #20\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const chunkData *blocks) {}; \/\/TODO #21\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const rawChunkData *blocks) {}; \/\/TODO #22\n\tcompressedSegment::compressedSegment(const struct segment *src) {}; \/\/TODO #21\n\tcompressedSegment::compressedSegment(const struct rawSegment *src) {}; \/\/TODO #22\n\tcompressedSegment::compressedSegment(const rawCompressedSegment *src) {}; \/\/TODO #23\n\trawCompressedSegment *compressedSegment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #24\n\t\n\t\n\tsmd2Index::smd2Index(const struct smd2Index *copy) {\n\t\tthis->id=copy->id;\n\t\tthis->inlen=copy->inlen;\n\t};\n\tsmd2Index::smd2Index(const signed long id, const unsigned long len) {\n\t\tthis->id=id;\n\t\tthis->inlen=len;\n\t};\n\tsmd2Index::smd2Index() {\n\t\tthis->id=-1;\n\t\tthis->inlen=0;\n\t};\n\tsmd2Index::smd2Index(const rawSmd2Index *raw) {\n\t\tuint32_t split[2];\n\t\tmemcpy(split,raw,sizeof(rawSmd2Index));\n\t\tthis->id=ntohl(split[0]);\n\t\tthis->inlen=ntohl(split[1]);\n\t};\n\trawSmd2Index *smd2Index::toRaw(rawSmd2Index *trg) {\n\t\tuint32_t split[2];\n\t\tsplit[0]=htonl(this->id);\n\t\tsplit[1]=htonl(this->inlen);\n\t\tmemcpy(trg,split,sizeof(rawSmd2Index));\n\t\treturn trg;\n\t};\n\tbool smd2Index::isValid() {\n\t\treturn this->id!=-1;\n\t};\n\t\n\tsmd2Head::smd2Head(const struct smd2Head*) {}; \/\/TODO #25\n\tsmd2Head::smd2Head(const unsigned long version, const fullSmd2Index *index,const fullSmd2TimestampHead *timestamps) {\n\t\tthis->version=version;\n\t\tmemcpy(&(this->index),index,sizeof(fullSmd2Index));\n\t\tmemcpy(&(this->timestamps),timestamps,sizeof(fullSmd2TimestampHead));\n\t};\n\tsmd2Head::smd2Head(const rawSmd2Head*) {}; \/\/TODO #26\n\trawSmd2Head *smd2Head::toRaw(rawSmd2Head*) {}; \/\/TODO #27\n\t\n\tunsigned int getSegmentSlotCountFromSMD2Size(const size_t) {}; \/\/TODO #29\n\tsize_t getSMD2SizeFromSegmentSlotCount(const unsigned int) {}; \/\/TODO #30\n}\n\n\n<commit_msg>closed #8, closed #14, closed #20<commit_after>\/*\n * SMD2Structs.cpp\n *\n * Created on: 09.02.2016\n * Author: Megacrafter127\n *\/\n\n#include \"SMD2Structs.h\"\n#include <string.h>\n#include <stdlib.h>\n#include <stdint.h>\n#include <arpa\/inet.h>\n#include <zlib.h>\n#include <stdexcept>\n\nnamespace smd2{\n\tblock::block(const struct block *copy) {\n\t\tmemcpy(this,copy,sizeof(struct block));\n\t};\n\tblock::block(const unsigned int id, const unsigned int hp, const bool active, const unsigned int orientation) {\n\t\tthis->id=id;\n\t\tthis->hp=hp;\n\t\tthis->active=active;\n\t\tthis->orientation=orientation;\n\t};\n\tblock::block(const rawBlock *raw, const blocktypeList *list) {\n\t\tif(!list) std::__throw_invalid_argument(\"the provided list may not be NULL\");\n\t\tuint32_t buff=0;\n\t\tmemcpy(&buff+sizeof(uint32_t)-sizeof(rawBlock),raw,sizeof(rawBlock));\n\t\tif(buff) {\n\t\t\tbuff=ntohl(buff);\n\t\t\tthis->id=buff;\n\t\t\tbuff>>=11;\n\t\t\tblockType type=((blockType*)list)[this->id];\n\t\t\tif(type==undefined) {\n\t\t\t\tstd::__throw_invalid_argument(\"blocktype not defined\");\n\t\t\t}\n\t\t\tthis->hp=buff;\n\t\t\tif(type==fullyRotating) {\n\t\t\t\tthis->hp&=0x00FF;\n\t\t\t\tbuff>>=8;\n\t\t\t} else buff>>=9;\n\t\t\tif(type==logic) {\n\t\t\t\tthis->active=buff & 1;\n\t\t\t\tbuff>>=1;\n\t\t\t}\n\t\t\tthis->orientation=buff;\n\t\t} else {\n\t\t\tthis->id=0;\n\t\t\tthis->hp=0;\n\t\t\tthis->active=false;\n\t\t\tthis->orientation=0;\n\t\t}\n\t};\n\tblock::block() {\n\t\tthis->id=0;\n\t\tthis->hp=0;\n\t\tthis->active=false;\n\t\tthis->orientation=0;\n\t};\n\trawBlock *block::toRaw(rawBlock *target, const blocktypeList *list) {\n\t\tif(!list) std::__throw_invalid_argument(\"the provided list may not be NULL\");\n\t\tblockType type=((blockType*)list)[this->id];\n\t\tif(type==undefined) {\n\t\t\tstd::__throw_invalid_argument(\"blocktype not defined\");\n\t\t}\n\t\tuint32_t buff=this->orientation;\n\t\tif(type==logic) {\n\t\t\tbuff<<=1;\n\t\t\tif(this->active) buff++;\n\t\t}\n\t\tif(type==fullyRotating) {\n\t\t\tbuff<<=8;\n\t\t\tbuff+=(0xFF & this->hp);\n\t\t} else {\n\t\t\tbuff<<=9;\n\t\t\tbuff+=this->hp;\n\t\t}\n\t\tbuff<<=11;\n\t\tbuff+=id;\n\t\tbuff=htonl(buff);\n\t\tmemcpy(target,&buff+sizeof(uint32_t)-sizeof(rawBlock),sizeof(rawBlock));\n\t\treturn target;\n\t};\n\t\n\trawChunkData *inflate(rawChunkData *trg,const compressedChunkData *src) {}; \/\/TODO #31\n\tcompressedChunkData *deflate(compressedChunkData *trg,const rawChunkData *src) {}; \/\/TODO #32\n\tbool isEmpty(const rawCompressedSegment *segment) {\n\t\tsize_t *chars=(size_t*)segment;\n\t\tfor(size_t i=0;i<(sizeof(rawCompressedSegment)\/sizeof(size_t));i++) {\n\t\t\tif(chars[i]) return false;\n\t\t}\n\t\treturn true;\n\t};\n\t\n\tsegmentHead::segmentHead(const struct segmentHead *copy) {\n\t\tmemcpy(this,copy,sizeof(struct segmentHead));\n\t};\n\tsegmentHead::segmentHead(const unsigned char unknownChar, const unsigned long long timestamp, const signed long x, const signed long y, const signed long z, const unsigned char type, const unsigned long inlen) {\n\t\tthis->unknownChar=unknownChar;\n\t\tthis->timestamp=timestamp;\n\t\tthis->x=x;\n\t\tthis->y=y;\n\t\tthis->z=z;\n\t\tthis->type=type;\n\t\tthis->inlen=inlen;\n\t};\n\tsegmentHead::segmentHead(const rawCompressedSegment *raw,const bool offset) {\n\t\tsize_t i=0;\n\t\tchar *chars=(char*)raw;\n\t\tif(offset) {\n\t\t\tthis->unknownChar=chars[i];\n\t\t\ti++;\n\t\t}\n\t\tuint64_t dbuff64;\n\t\tuint32_t *buff32=(uint32_t*)&dbuff64,dbuff32=ntohl(buff32[0]);\n\t\tmemcpy(buff32,&(chars[i]),sizeof(uint64_t));\n\t\tif(ntohl(1)!=1) {\n\t\t\tbuff32[0]=ntohl(buff32[1]);\n\t\t\tbuff32[1]=dbuff32;\n\t\t}\n\t\tthis->timestamp=dbuff64;\n\t\ti+=sizeof(uint64_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->x=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->y=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(int32_t));\n\t\tthis->z=ntohl(dbuff32);\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tthis->type=chars[i];\n\t\ti++;\n\t\t\n\t\tmemcpy(&dbuff32,&(chars[i]),sizeof(uint32_t));\n\t\tthis->inlen=ntohl(dbuff32);\n\t};\n\tsegmentHead::segmentHead() {\n\t\tthis->unknownChar=0;\n\t\tthis->timestamp=0;\n\t\tthis->x=0;\n\t\tthis->y=0;\n\t\tthis->z=0;\n\t\tthis->type=0;\n\t\tthis->inlen=0;\n\t};\n\trawCompressedSegment *segmentHead::toRaw(rawCompressedSegment *target,const bool offset) {\n\t\tsize_t i=0;\n\t\tchar *chars=(char*)target;\n\t\tif(offset) {\n\t\t\tchars[i]=this->unknownChar;\n\t\t\ti++;\n\t\t}\n\t\tuint64_t dbuff64=this->timestamp;\n\t\tuint32_t *buff32=(uint32_t*)&dbuff64,dbuff32=htonl(buff32[0]);\n\t\tif(htonl(1)!=1) {\n\t\t\tbuff32[0]=htonl(buff32[1]);\n\t\t\tbuff32[1]=dbuff32;\n\t\t}\n\t\tmemcpy(&(chars[i]),buff32,sizeof(uint64_t));\n\t\ti+=sizeof(uint64_t);\n\t\t\n\t\tdbuff32=htonl(this->x);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tdbuff32=htonl(this->y);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tdbuff32=htonl(this->z);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(int32_t));\n\t\ti+=sizeof(int32_t);\n\t\t\n\t\tthis->type=chars[i];\n\t\ti++;\n\t\t\n\t\tdbuff32=htonl(this->inlen);\n\t\tmemcpy(&(chars[i]),&dbuff32,sizeof(uint32_t));\n\t\treturn target;\n\t};\n\t\n\tsegment::segment(const struct segment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct segment));\n\t};\n\tsegment::segment(const struct segmentHead *head,const chunkData *blocks) {\n\t\tthis->head=*head;\n\t\tmemcpy(&(this->blocks),blocks,sizeof(chunkData));\n\t};\n\tsegment::segment(const struct segmentHead *head,const rawChunkData *blocks) {}; \/\/TODO #9\n\tsegment::segment(const struct segmentHead *head,const compressedChunkData *blocks) {}; \/\/TODO #10\n\tsegment::segment(const struct rawSegment *src) {}; \/\/TODO #9\n\tsegment::segment(const struct compressedSegment *src) {}; \/\/TODO #10\n\tsegment::segment(const rawCompressedSegment *src) {}; \/\/TODO #11\n\trawCompressedSegment *segment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #12\n\t\n\trawSegment::rawSegment(const struct rawSegment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct rawSegment));\n\t};\n\trawSegment::rawSegment(const struct segmentHead *head,const rawChunkData *blocks) {\n\t\tthis->head=*head;\n\t\tmemcpy(&(this->blocks),blocks,sizeof(rawChunkData));\n\t};\n\trawSegment::rawSegment(const struct segmentHead *head,const chunkData*) {}; \/\/TODO #15\n\trawSegment::rawSegment(const struct segmentHead *head,const compressedChunkData*) {}; \/\/TODO #16\n\trawSegment::rawSegment(const struct segment *src) {}; \/\/TODO #15\n\trawSegment::rawSegment(const struct compressedSegment *src) {}; \/\/TODO #16\n\trawSegment::rawSegment(const rawCompressedSegment *src) {}; \/\/TODO #17\n\trawCompressedSegment *rawSegment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #18\n\t\n\tcompressedSegment::compressedSegment(const struct compressedSegment *copy) {\n\t\tmemcpy(this,copy,sizeof(struct compressedSegment));\n\t};\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const compressedChunkData *blocks) {\n\t\tthis->head=*head;\n\t\tmemcpy(&(this->blocks),blocks,sizeof(compressedChunkData));\n\t};\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const chunkData *blocks) {}; \/\/TODO #21\n\tcompressedSegment::compressedSegment(const struct segmentHead *head,const rawChunkData *blocks) {}; \/\/TODO #22\n\tcompressedSegment::compressedSegment(const struct segment *src) {}; \/\/TODO #21\n\tcompressedSegment::compressedSegment(const struct rawSegment *src) {}; \/\/TODO #22\n\tcompressedSegment::compressedSegment(const rawCompressedSegment *src) {}; \/\/TODO #23\n\trawCompressedSegment *compressedSegment::toRawCompressed(rawCompressedSegment *trg,const bool offset) {}; \/\/TODO #24\n\t\n\t\n\tsmd2Index::smd2Index(const struct smd2Index *copy) {\n\t\tthis->id=copy->id;\n\t\tthis->inlen=copy->inlen;\n\t};\n\tsmd2Index::smd2Index(const signed long id, const unsigned long len) {\n\t\tthis->id=id;\n\t\tthis->inlen=len;\n\t};\n\tsmd2Index::smd2Index() {\n\t\tthis->id=-1;\n\t\tthis->inlen=0;\n\t};\n\tsmd2Index::smd2Index(const rawSmd2Index *raw) {\n\t\tuint32_t split[2];\n\t\tmemcpy(split,raw,sizeof(rawSmd2Index));\n\t\tthis->id=ntohl(split[0]);\n\t\tthis->inlen=ntohl(split[1]);\n\t};\n\trawSmd2Index *smd2Index::toRaw(rawSmd2Index *trg) {\n\t\tuint32_t split[2];\n\t\tsplit[0]=htonl(this->id);\n\t\tsplit[1]=htonl(this->inlen);\n\t\tmemcpy(trg,split,sizeof(rawSmd2Index));\n\t\treturn trg;\n\t};\n\tbool smd2Index::isValid() {\n\t\treturn this->id!=-1;\n\t};\n\t\n\tsmd2Head::smd2Head(const struct smd2Head*) {}; \/\/TODO #25\n\tsmd2Head::smd2Head(const unsigned long version, const fullSmd2Index *index,const fullSmd2TimestampHead *timestamps) {\n\t\tthis->version=version;\n\t\tmemcpy(&(this->index),index,sizeof(fullSmd2Index));\n\t\tmemcpy(&(this->timestamps),timestamps,sizeof(fullSmd2TimestampHead));\n\t};\n\tsmd2Head::smd2Head(const rawSmd2Head*) {}; \/\/TODO #26\n\trawSmd2Head *smd2Head::toRaw(rawSmd2Head*) {}; \/\/TODO #27\n\t\n\tunsigned int getSegmentSlotCountFromSMD2Size(const size_t) {}; \/\/TODO #29\n\tsize_t getSMD2SizeFromSegmentSlotCount(const unsigned int) {}; \/\/TODO #30\n}\n\n\n<|endoftext|>"} {"text":"<commit_before>\/*\n * Copyright (C) 2012 Kolibre\n *\n * This file is part of kolibre-clientcore.\n *\n * Kolibre-clientcore is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation, either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * Kolibre-clientcore is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with kolibre-clientcore. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Db.h\"\n\n#ifdef WIN32\n#include <iconv.h>\n#include <windows.h>\n#endif\n\n#include <cstdlib>\n#include <unistd.h>\n#include <cstdio>\n#include <log4cxx\/logger.h>\n\n\/\/ create logger which will become a child to logger kolibre.clientcore\nlog4cxx::LoggerPtr dbLog(log4cxx::Logger::getLogger(\"kolibre.clientcore.db\"));\n\nusing namespace std;\n\nint busyHandler(void *pArg1, int iPriorCalls)\n{\n LOG4CXX_WARN(dbLog, \"busyHandler \" << iPriorCalls << \" !!\");\n \/\/ sleep if handler has been called less than threshold value\n if (iPriorCalls < 20)\n {\n \/\/ adding a random value here greatly reduces locking\n if (pArg1 < 0)\n usleep((rand() % 500000) + 400000);\n else\n usleep(500000);\n return 1;\n }\n\n \/\/ have sqlite3_exec immediately return SQLITE_BUSY\n return 0;\n}\n\nDB::DB(const string &database)\n{\n mDatabase = database;\n pDBHandle = NULL;\n pStatement = NULL;\n mLasterror = \"\";\n\n}\n\nDB::DB(sqlite3 *handle)\n{\n pStatement = NULL;\n pDBHandle = handle;\n int sleepMode = 1;\n sqlite3_busy_handler(pDBHandle, &busyHandler, &sleepMode);\n}\n\nbool DB::connect()\n{\n if (pDBHandle != NULL)\n return true;\n\n LOG4CXX_DEBUG(dbLog, \"Opening settings database: \" << mDatabase);\n if (sqlite3_open_v2(mDatabase.c_str(), &pDBHandle, SQLITE_OPEN_NOMUTEX | SQLITE_OPEN_READWRITE | SQLITE_OPEN_CREATE, NULL) != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n sqlite3_close(pDBHandle);\n pDBHandle = NULL;\n return false;\n }\n\n int sleepMode = 1;\n sqlite3_busy_handler(pDBHandle, &busyHandler, &sleepMode);\n\n bClosedb = true;\n return true;\n}\n\nDB::~DB()\n{\n \/\/ If we recieved the handle in the constructor the caller should close the db\n if (pDBHandle && bClosedb)\n {\n sqlite3_close(pDBHandle);\n }\n}\n\nbool DB::prepare(const char *query)\n{\n if (!pDBHandle)\n return false;\n if (pStatement)\n sqlite3_finalize(pStatement);\n\n if (query == NULL)\n query = mLastquery.c_str();\n\n pStatement = NULL;\n rc = sqlite3_prepare_v2(pDBHandle, query, -1, &pStatement, 0);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n\n mLastquery.assign(query);\n return true;\n}\n\nbool DB::bind(const int idx, const int value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_int(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const int value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const long value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_int(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const long value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const double value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_double(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const double value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const char *value, int length, void (*freefunc)(void*))\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_text(pStatement, idx, value, length, freefunc);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const char *value, int length, void (*freefunc)(void*))\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value, length, freefunc);\n}\n\nbool DB::bind(const int idx, const void *value, int length, void (*freefunc)(void*))\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_blob(pStatement, idx, value, length, freefunc);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const void *value, int length, void (*freefunc)(void*))\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value, length, freefunc);\n}\n\nbool DB::reset()\n{\n if (pStatement)\n {\n rc = sqlite3_reset(pStatement);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n }\n \/\/ Prepares a copy of the previous query\n return prepare(NULL);\n}\n\nbool DB::perform(DBResult *result)\n{\n if (!pStatement)\n return false;\n\n \/\/ Called does not want a result, only success or failure\n if (result == NULL)\n {\n DBResult res;\n res.setup(pDBHandle, pStatement);\n pStatement = NULL;\n while (!res.isError() && !res.isDone() && res.loadRow());\n bool ret = (!res.isError() && res.isDone());\n\n \/\/printf(\"in perform, result NULL, returning %i, err %i, done %i\\n\", ret, res.isError(), res.isDone());\n\n return ret;\n }\n\n \/\/ return a result\n bool ret = result->setup(pDBHandle, pStatement);\n pStatement = NULL;\n return ret;\n}\n\nDBResult::DBResult()\n{\n pDBHandle = NULL;\n pStatement = NULL;\n}\n\nbool DBResult::setup(sqlite3 *handle, sqlite3_stmt* statement)\n{\n pDBHandle = handle;\n pStatement = statement;\n bFirstcall = true;\n bError = false;\n bDone = false;\n\n \/\/ Step once\n step();\n\n return !bError;\n}\n\nDBResult::~DBResult()\n{\n if (pStatement)\n {\n sqlite3_finalize(pStatement);\n }\n}\n\nint DBResult::step()\n{\n rc = sqlite3_step(pStatement);\n switch (rc)\n {\n case SQLITE_OK:\n \/\/printf(\"Got ok\\n\");\n return rc;\n break;\n\n case SQLITE_ROW:\n \/\/printf(\"Got row\\n\");\n return rc;\n\n case SQLITE_DONE:\n bDone = true;\n \/\/printf(\"Got done\\n\");\n return 0;\n\n case SQLITE_CONSTRAINT:\n \/\/printf(\"Got constraint violation\\n\");\n bError = true;\n mLasterror.assign(\"DB: SQLITE_CONSTRAINT violation\");\n return rc;\n break;\n\n case SQLITE_MISUSE:\n bError = true;\n mLasterror.assign(\"DB: SQLITE_MISUSE\");\n return rc;\n break;\n\n default:\n \/\/printf(\"DB: error code: %d\\n\", rc);\n bError = true;\n mLasterror = sqlite3_errmsg(pDBHandle);\n }\n return rc;\n}\n\nbool DBResult::isError()\n{\n return bError;\n}\n\nbool DBResult::isDone()\n{\n return bDone;\n}\n\nbool DBResult::loadRow()\n{\n if (bDone)\n return false;\n if (bError)\n return false;\n if (bFirstcall)\n {\n bFirstcall = false;\n if (rc == SQLITE_ROW)\n return true;\n return false;\n }\n\n if (step() == SQLITE_ROW)\n return true;\n return false;\n}\n\nvoid DBResult::printRow()\n{\n int i;\n for (i = 0; i < sqlite3_column_count(pStatement); ++i)\n switch (sqlite3_column_type(pStatement, i))\n {\n case SQLITE_INTEGER:\n printf(\"%d\\t\", sqlite3_column_int(pStatement, i));\n break;\n case SQLITE_FLOAT:\n printf(\"%f\\t\", sqlite3_column_double(pStatement, i));\n break;\n case SQLITE_TEXT:\n printf(\"%s\\t\", sqlite3_column_text(pStatement, i));\n break;\n case SQLITE_BLOB:\n printf(\"<blob>%X\\t\", sqlite3_column_blob(pStatement, i));\n break;\n case SQLITE_NULL:\n printf(\"Null \");\n break;\n default:\n printf(\" *Cannot determine SQLITE TYPE* col=%d \", i);\n }\n printf(\"\\n\");\n}\n\nlong DBResult::getInsertId()\n{\n return sqlite3_last_insert_rowid(pDBHandle);\n}\n\nlong DBResult::getInt(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_INTEGER)\n return sqlite3_column_int(pStatement, column);\n\n return 0;\n}\n\ndouble DBResult::getDouble(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_FLOAT)\n return sqlite3_column_double(pStatement, column);\n\n return 0;\n}\n\nconst char *DBResult::getText(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_TEXT)\n return (const char *) sqlite3_column_text(pStatement, column);\n\n return NULL;\n}\n\nconst void *DBResult::getData(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_BLOB)\n return sqlite3_column_blob(pStatement, column);\n\n return NULL;\n}\n\nlong DBResult::getDataSize(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_TEXT || sqlite3_column_type(pStatement, column) == SQLITE_BLOB)\n return sqlite3_column_bytes(pStatement, column);\n\n return 0;\n}\n\n<commit_msg>Db: initiate all variables on start<commit_after>\/*\n * Copyright (C) 2012 Kolibre\n *\n * This file is part of kolibre-clientcore.\n *\n * Kolibre-clientcore is free software: you can redistribute it and\/or modify\n * it under the terms of the GNU Lesser General Public License as published by\n * the Free Software Foundation, either version 2.1 of the License, or\n * (at your option) any later version.\n *\n * Kolibre-clientcore is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public License\n * along with kolibre-clientcore. If not, see <http:\/\/www.gnu.org\/licenses\/>.\n *\/\n\n#include \"Db.h\"\n\n#ifdef WIN32\n#include <iconv.h>\n#include <windows.h>\n#endif\n\n#include <cstdlib>\n#include <unistd.h>\n#include <cstdio>\n#include <log4cxx\/logger.h>\n\n\/\/ create logger which will become a child to logger kolibre.clientcore\nlog4cxx::LoggerPtr dbLog(log4cxx::Logger::getLogger(\"kolibre.clientcore.db\"));\n\nusing namespace std;\n\nint busyHandler(void *pArg1, int iPriorCalls)\n{\n LOG4CXX_WARN(dbLog, \"busyHandler \" << iPriorCalls << \" !!\");\n \/\/ sleep if handler has been called less than threshold value\n if (iPriorCalls < 20)\n {\n \/\/ adding a random value here greatly reduces locking\n if (pArg1 < 0)\n usleep((rand() % 500000) + 400000);\n else\n usleep(500000);\n return 1;\n }\n\n \/\/ have sqlite3_exec immediately return SQLITE_BUSY\n return 0;\n}\n\nDB::DB(const string &database):\n mDatabase(database), pDBHandle(NULL), pStatement(NULL), mLasterror(\"\"), mLastquery(\"\")\n{\n\n}\n\nDB::DB(sqlite3 *handle)\n{\n pStatement = NULL;\n pDBHandle = handle;\n int sleepMode = 1;\n sqlite3_busy_handler(pDBHandle, &busyHandler, &sleepMode);\n}\n\nbool DB::connect()\n{\n if (pDBHandle != NULL)\n return true;\n\n LOG4CXX_DEBUG(dbLog, \"Opening settings database: \" << mDatabase);\n if (sqlite3_open_v2(mDatabase.c_str(), &pDBHandle, SQLITE_OPEN_NOMUTEX | SQLITE_OPEN_READWRITE | SQLITE_OPEN_CREATE, NULL) != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n sqlite3_close(pDBHandle);\n pDBHandle = NULL;\n return false;\n }\n\n int sleepMode = 1;\n sqlite3_busy_handler(pDBHandle, &busyHandler, &sleepMode);\n\n bClosedb = true;\n return true;\n}\n\nDB::~DB()\n{\n \/\/ If we recieved the handle in the constructor the caller should close the db\n if (pDBHandle && bClosedb)\n {\n sqlite3_close(pDBHandle);\n }\n}\n\nbool DB::prepare(const char *query)\n{\n if (!pDBHandle)\n return false;\n if (pStatement)\n sqlite3_finalize(pStatement);\n\n if (query == NULL)\n query = mLastquery.c_str();\n\n pStatement = NULL;\n rc = sqlite3_prepare_v2(pDBHandle, query, -1, &pStatement, 0);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n\n mLastquery.assign(query);\n return true;\n}\n\nbool DB::bind(const int idx, const int value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_int(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const int value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const long value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_int(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const long value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const double value)\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_double(pStatement, idx, value);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const double value)\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value);\n}\n\nbool DB::bind(const int idx, const char *value, int length, void (*freefunc)(void*))\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_text(pStatement, idx, value, length, freefunc);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const char *value, int length, void (*freefunc)(void*))\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value, length, freefunc);\n}\n\nbool DB::bind(const int idx, const void *value, int length, void (*freefunc)(void*))\n{\n if (!pStatement)\n prepare(NULL);\n if (idx == 0)\n return false;\n rc = sqlite3_bind_blob(pStatement, idx, value, length, freefunc);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n return true;\n}\n\nbool DB::bind(const char *key, const void *value, int length, void (*freefunc)(void*))\n{\n return bind(sqlite3_bind_parameter_index(pStatement, key), value, length, freefunc);\n}\n\nbool DB::reset()\n{\n if (pStatement)\n {\n rc = sqlite3_reset(pStatement);\n if (rc != SQLITE_OK)\n {\n mLasterror.assign(sqlite3_errmsg(pDBHandle));\n return false;\n }\n }\n \/\/ Prepares a copy of the previous query\n return prepare(NULL);\n}\n\nbool DB::perform(DBResult *result)\n{\n if (!pStatement)\n return false;\n\n \/\/ Called does not want a result, only success or failure\n if (result == NULL)\n {\n DBResult res;\n res.setup(pDBHandle, pStatement);\n pStatement = NULL;\n while (!res.isError() && !res.isDone() && res.loadRow());\n bool ret = (!res.isError() && res.isDone());\n\n \/\/printf(\"in perform, result NULL, returning %i, err %i, done %i\\n\", ret, res.isError(), res.isDone());\n\n return ret;\n }\n\n \/\/ return a result\n bool ret = result->setup(pDBHandle, pStatement);\n pStatement = NULL;\n return ret;\n}\n\nDBResult::DBResult()\n{\n pDBHandle = NULL;\n pStatement = NULL;\n}\n\nbool DBResult::setup(sqlite3 *handle, sqlite3_stmt* statement)\n{\n pDBHandle = handle;\n pStatement = statement;\n bFirstcall = true;\n bError = false;\n bDone = false;\n\n \/\/ Step once\n step();\n\n return !bError;\n}\n\nDBResult::~DBResult()\n{\n if (pStatement)\n {\n sqlite3_finalize(pStatement);\n }\n}\n\nint DBResult::step()\n{\n rc = sqlite3_step(pStatement);\n switch (rc)\n {\n case SQLITE_OK:\n \/\/printf(\"Got ok\\n\");\n return rc;\n break;\n\n case SQLITE_ROW:\n \/\/printf(\"Got row\\n\");\n return rc;\n\n case SQLITE_DONE:\n bDone = true;\n \/\/printf(\"Got done\\n\");\n return 0;\n\n case SQLITE_CONSTRAINT:\n \/\/printf(\"Got constraint violation\\n\");\n bError = true;\n mLasterror.assign(\"DB: SQLITE_CONSTRAINT violation\");\n return rc;\n break;\n\n case SQLITE_MISUSE:\n bError = true;\n mLasterror.assign(\"DB: SQLITE_MISUSE\");\n return rc;\n break;\n\n default:\n \/\/printf(\"DB: error code: %d\\n\", rc);\n bError = true;\n mLasterror = sqlite3_errmsg(pDBHandle);\n }\n return rc;\n}\n\nbool DBResult::isError()\n{\n return bError;\n}\n\nbool DBResult::isDone()\n{\n return bDone;\n}\n\nbool DBResult::loadRow()\n{\n if (bDone)\n return false;\n if (bError)\n return false;\n if (bFirstcall)\n {\n bFirstcall = false;\n if (rc == SQLITE_ROW)\n return true;\n return false;\n }\n\n if (step() == SQLITE_ROW)\n return true;\n return false;\n}\n\nvoid DBResult::printRow()\n{\n int i;\n for (i = 0; i < sqlite3_column_count(pStatement); ++i)\n switch (sqlite3_column_type(pStatement, i))\n {\n case SQLITE_INTEGER:\n printf(\"%d\\t\", sqlite3_column_int(pStatement, i));\n break;\n case SQLITE_FLOAT:\n printf(\"%f\\t\", sqlite3_column_double(pStatement, i));\n break;\n case SQLITE_TEXT:\n printf(\"%s\\t\", sqlite3_column_text(pStatement, i));\n break;\n case SQLITE_BLOB:\n printf(\"<blob>%X\\t\", sqlite3_column_blob(pStatement, i));\n break;\n case SQLITE_NULL:\n printf(\"Null \");\n break;\n default:\n printf(\" *Cannot determine SQLITE TYPE* col=%d \", i);\n }\n printf(\"\\n\");\n}\n\nlong DBResult::getInsertId()\n{\n return sqlite3_last_insert_rowid(pDBHandle);\n}\n\nlong DBResult::getInt(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_INTEGER)\n return sqlite3_column_int(pStatement, column);\n\n return 0;\n}\n\ndouble DBResult::getDouble(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_FLOAT)\n return sqlite3_column_double(pStatement, column);\n\n return 0;\n}\n\nconst char *DBResult::getText(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_TEXT)\n return (const char *) sqlite3_column_text(pStatement, column);\n\n return NULL;\n}\n\nconst void *DBResult::getData(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_BLOB)\n return sqlite3_column_blob(pStatement, column);\n\n return NULL;\n}\n\nlong DBResult::getDataSize(const long column)\n{\n if (sqlite3_column_type(pStatement, column) == SQLITE_TEXT || sqlite3_column_type(pStatement, column) == SQLITE_BLOB)\n return sqlite3_column_bytes(pStatement, column);\n\n return 0;\n}\n\n<|endoftext|>"}